{"text":"<commit_before>\/************************************************************************\n*\n* Copyright (C) 2017 by Peter Harrison. www.micromouseonline.com\n*\n* Permission is hereby granted, free of charge, to any person obtaining a\n* copy of this software and associated documentation files (the\n* \"Software\"), to deal in the Software without restriction, including\n* without l> imitation the rights to use, copy, modify, merge, publish,\n* distribute, sublicense, and\/or sell copies of the Software, and to\n* permit persons to whom the Software is furnished to do so, subject to\n* the following conditions:\n*\n* The above copyright notice and this permission notice shall be included\n* in all copies or substantial portions of the Software.\n*\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\n* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n*\n************************************************************************\/\n\n#include <assert.h>\n#include \"maze.h\"\n#include \"mazesearcher.h\"\n#include \"mazeprinter.h\"\n\/\/#include \"stddef.h\"\n\nMazeSearcher::MazeSearcher() :\n    mLocation(0),\n    mHeading(NORTH),\n    mMap(NULL),\n    mRealMaze(NULL),\n    mVerbose(false),\n    mSearchMethod(SEARCH_NORMAL) {\n  mMap = new Maze(16);\n  mMap->setFloodType(Maze::MANHATTAN_FLOOD);\n}\n\nMazeSearcher::~MazeSearcher() {\n  delete mMap;\n}\n\nbool MazeSearcher::isVerbose() const {\n  return mVerbose;\n}\n\nvoid MazeSearcher::setVerbose(bool mVerbose) {\n  MazeSearcher::mVerbose = mVerbose;\n}\n\nuint16_t MazeSearcher::location() const {\n  return mLocation;\n}\n\nvoid MazeSearcher::setLocation(uint16_t location) {\n  MazeSearcher::mLocation = location;\n}\n\nuint8_t MazeSearcher::heading() const {\n  return mHeading;\n}\n\nvoid MazeSearcher::setHeading(uint8_t heading) {\n  MazeSearcher::mHeading = heading;\n}\n\nvoid MazeSearcher::move() {\n  mLocation = mMap->neighbour(mLocation, mHeading);\n}\n\nvoid MazeSearcher::setMapFromFileData(const uint8_t *mazeWalls, uint16_t cellCount) {\n  mMap->copyMazeFromFileData(mazeWalls, cellCount);\n}\n\nMaze *MazeSearcher::map() {\n  return mMap;\n}\n\nconst Maze *MazeSearcher::realMaze() const {\n  return mRealMaze;\n}\n\nvoid MazeSearcher::setRealMaze(const Maze *maze) {\n  mRealMaze = maze;\n}\n\nint MazeSearcher::runTo(uint16_t target) {\n  int steps = 0;\n  mMap->flood(target);\n  while (mLocation != target) {\n    uint8_t heading = mMap->direction(mLocation);\n    if (heading == INVALID_DIRECTION) {\n      steps = -1;\n      break;\n    }\n\n    setHeading(heading);\n    move();\n    steps++;\n    if (steps > 256) {\n      steps = -2;\n      break;\n    }\n    if (isVerbose()) {\n      MazePrinter::printVisitedDirs(mMap);\n    }\n  }\n  return steps;\n}\n\n\/\/ TODO: this needs looking at.\n\/\/ the returned number of steps may be inconsistent\nint MazeSearcher::searchTo(uint16_t target) {\n  int stepCount = 0;\n  while (mLocation != target) {\n    mMap->updateMap(mLocation, mRealMaze->walls(mLocation));\n    uint8_t newHeading;\n    switch (mSearchMethod) {\n      case SEARCH_LEFT_WALL:\n        newHeading = followLeftWall();\n        break;\n      case SEARCH_RIGHT_WALL:\n        newHeading = followRightWall();\n        break;\n      case SEARCH_ALTERNATE:\n        newHeading = followAlternateWall();\n        break;\n      case SEARCH_NORMAL:\n        mMap->flood(target);\n        newHeading = mMap->direction(mLocation);\n        break;\n      default:\n        newHeading = INVALID_DIRECTION;\n        break;\n    }\n    if (newHeading == INVALID_DIRECTION) {\n      stepCount = E_NO_ROUTE;\n      break;\n    }\n    setHeading(newHeading);\n    stepCount++;\n    if (stepCount > mMap->numCells()) {\n      stepCount = E_ROUTE_TOO_LONG;\n      break;\n    }\n    move();\n    if (isVerbose()) {\n      MazePrinter::printVisitedDirs(mMap);\n    }\n  }\n  return stepCount;\n}\n\nuint8_t MazeSearcher::followLeftWall() const {\n  uint8_t newHeading;\n  if (mMap->hasExit(mLocation, Maze::leftOf(mHeading))) {\n    newHeading = Maze::leftOf(mHeading);\n  } else if (mMap->hasExit(mLocation, Maze::ahead(mHeading))) {\n    newHeading = Maze::ahead(mHeading);\n  } else if (mMap->hasExit(mLocation, Maze::rightOf(mHeading))) {\n    newHeading = Maze::rightOf(mHeading);\n  } else {\n    newHeading = Maze::behind(mHeading);\n  }\n  return newHeading;\n}\n\nuint8_t MazeSearcher::followRightWall() const {\n  uint8_t newHeading;\n  if (mMap->hasExit(mLocation, Maze::rightOf(mHeading))) {\n    newHeading = Maze::rightOf(mHeading);\n  } else if (mMap->hasExit(mLocation, Maze::ahead(mHeading))) {\n    newHeading = Maze::ahead(mHeading);\n  } else if (mMap->hasExit(mLocation, Maze::leftOf(mHeading))) {\n    newHeading = Maze::leftOf(mHeading);\n  } else {\n    newHeading = Maze::behind(mHeading);\n  }\n  return newHeading;\n}\n\nuint8_t MazeSearcher::followAlternateWall() const {\n  static bool useLeft = true;\n  uint8_t newHeading;\n  newHeading = useLeft ? followLeftWall() : followRightWall();\n  useLeft = !useLeft;\n  return newHeading;\n}\n\nvoid MazeSearcher::setSearchMethod(int mSearchMethod) {\n  MazeSearcher::mSearchMethod = mSearchMethod;\n}\n\nvoid MazeSearcher::turnRight() {\n  mHeading = Maze::rightOf(mHeading);\n}\n\nvoid MazeSearcher::turnLeft() {\n  mHeading = Maze::leftOf(mHeading);\n}\n\nvoid MazeSearcher::turnAround() {\n  mHeading = Maze::behind(mHeading);\n}\n<commit_msg>reinstate stddef.h to get a definition for NULL<commit_after>\/************************************************************************\n*\n* Copyright (C) 2017 by Peter Harrison. www.micromouseonline.com\n*\n* Permission is hereby granted, free of charge, to any person obtaining a\n* copy of this software and associated documentation files (the\n* \"Software\"), to deal in the Software without restriction, including\n* without l> imitation the rights to use, copy, modify, merge, publish,\n* distribute, sublicense, and\/or sell copies of the Software, and to\n* permit persons to whom the Software is furnished to do so, subject to\n* the following conditions:\n*\n* The above copyright notice and this permission notice shall be included\n* in all copies or substantial portions of the Software.\n*\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\n* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n*\n************************************************************************\/\n\n#include <assert.h>\n#include \"maze.h\"\n#include \"mazesearcher.h\"\n#include \"mazeprinter.h\"\n#include \"stddef.h\"\n\nMazeSearcher::MazeSearcher() :\n    mLocation(0),\n    mHeading(NORTH),\n    mMap(NULL),\n    mRealMaze(NULL),\n    mVerbose(false),\n    mSearchMethod(SEARCH_NORMAL) {\n  mMap = new Maze(16);\n  mMap->setFloodType(Maze::MANHATTAN_FLOOD);\n}\n\nMazeSearcher::~MazeSearcher() {\n  delete mMap;\n}\n\nbool MazeSearcher::isVerbose() const {\n  return mVerbose;\n}\n\nvoid MazeSearcher::setVerbose(bool mVerbose) {\n  MazeSearcher::mVerbose = mVerbose;\n}\n\nuint16_t MazeSearcher::location() const {\n  return mLocation;\n}\n\nvoid MazeSearcher::setLocation(uint16_t location) {\n  MazeSearcher::mLocation = location;\n}\n\nuint8_t MazeSearcher::heading() const {\n  return mHeading;\n}\n\nvoid MazeSearcher::setHeading(uint8_t heading) {\n  MazeSearcher::mHeading = heading;\n}\n\nvoid MazeSearcher::move() {\n  mLocation = mMap->neighbour(mLocation, mHeading);\n}\n\nvoid MazeSearcher::setMapFromFileData(const uint8_t *mazeWalls, uint16_t cellCount) {\n  mMap->copyMazeFromFileData(mazeWalls, cellCount);\n}\n\nMaze *MazeSearcher::map() {\n  return mMap;\n}\n\nconst Maze *MazeSearcher::realMaze() const {\n  return mRealMaze;\n}\n\nvoid MazeSearcher::setRealMaze(const Maze *maze) {\n  mRealMaze = maze;\n}\n\nint MazeSearcher::runTo(uint16_t target) {\n  int steps = 0;\n  mMap->flood(target);\n  while (mLocation != target) {\n    uint8_t heading = mMap->direction(mLocation);\n    if (heading == INVALID_DIRECTION) {\n      steps = -1;\n      break;\n    }\n\n    setHeading(heading);\n    move();\n    steps++;\n    if (steps > 256) {\n      steps = -2;\n      break;\n    }\n    if (isVerbose()) {\n      MazePrinter::printVisitedDirs(mMap);\n    }\n  }\n  return steps;\n}\n\n\/\/ TODO: this needs looking at.\n\/\/ the returned number of steps may be inconsistent\nint MazeSearcher::searchTo(uint16_t target) {\n  int stepCount = 0;\n  while (mLocation != target) {\n    mMap->updateMap(mLocation, mRealMaze->walls(mLocation));\n    uint8_t newHeading;\n    switch (mSearchMethod) {\n      case SEARCH_LEFT_WALL:\n        newHeading = followLeftWall();\n        break;\n      case SEARCH_RIGHT_WALL:\n        newHeading = followRightWall();\n        break;\n      case SEARCH_ALTERNATE:\n        newHeading = followAlternateWall();\n        break;\n      case SEARCH_NORMAL:\n        mMap->flood(target);\n        newHeading = mMap->direction(mLocation);\n        break;\n      default:\n        newHeading = INVALID_DIRECTION;\n        break;\n    }\n    if (newHeading == INVALID_DIRECTION) {\n      stepCount = E_NO_ROUTE;\n      break;\n    }\n    setHeading(newHeading);\n    stepCount++;\n    if (stepCount > mMap->numCells()) {\n      stepCount = E_ROUTE_TOO_LONG;\n      break;\n    }\n    move();\n    if (isVerbose()) {\n      MazePrinter::printVisitedDirs(mMap);\n    }\n  }\n  return stepCount;\n}\n\nuint8_t MazeSearcher::followLeftWall() const {\n  uint8_t newHeading;\n  if (mMap->hasExit(mLocation, Maze::leftOf(mHeading))) {\n    newHeading = Maze::leftOf(mHeading);\n  } else if (mMap->hasExit(mLocation, Maze::ahead(mHeading))) {\n    newHeading = Maze::ahead(mHeading);\n  } else if (mMap->hasExit(mLocation, Maze::rightOf(mHeading))) {\n    newHeading = Maze::rightOf(mHeading);\n  } else {\n    newHeading = Maze::behind(mHeading);\n  }\n  return newHeading;\n}\n\nuint8_t MazeSearcher::followRightWall() const {\n  uint8_t newHeading;\n  if (mMap->hasExit(mLocation, Maze::rightOf(mHeading))) {\n    newHeading = Maze::rightOf(mHeading);\n  } else if (mMap->hasExit(mLocation, Maze::ahead(mHeading))) {\n    newHeading = Maze::ahead(mHeading);\n  } else if (mMap->hasExit(mLocation, Maze::leftOf(mHeading))) {\n    newHeading = Maze::leftOf(mHeading);\n  } else {\n    newHeading = Maze::behind(mHeading);\n  }\n  return newHeading;\n}\n\nuint8_t MazeSearcher::followAlternateWall() const {\n  static bool useLeft = true;\n  uint8_t newHeading;\n  newHeading = useLeft ? followLeftWall() : followRightWall();\n  useLeft = !useLeft;\n  return newHeading;\n}\n\nvoid MazeSearcher::setSearchMethod(int mSearchMethod) {\n  MazeSearcher::mSearchMethod = mSearchMethod;\n}\n\nvoid MazeSearcher::turnRight() {\n  mHeading = Maze::rightOf(mHeading);\n}\n\nvoid MazeSearcher::turnLeft() {\n  mHeading = Maze::leftOf(mHeading);\n}\n\nvoid MazeSearcher::turnAround() {\n  mHeading = Maze::behind(mHeading);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <QtNetwork\/QNetworkReply>\n#include <QtQuick\/QQuickView>\n\/\/#include <QtQml\/QQmlContext>\n\/\/#include <QtQml\/QQmlEngine>\n#include <QtQml>\n#include <QtWidgets\/QMessageBox>\n#include <QtWidgets\/QInputDialog>\n#include <QtGui\/QClipboard>\n#include <QtCore\/QtCore>\n#include <libethereum\/Dagger.h>\n#include <libethereum\/Client.h>\n#include <libethereum\/Instruction.h>\n#include <libethereum\/FileSystem.h>\n#include \"MainWin.h\"\n#include \"ui_Main.h\"\nusing namespace std;\n\n\/\/ types\nusing eth::bytes;\nusing eth::bytesConstRef;\nusing eth::h160;\nusing eth::h256;\nusing eth::u160;\nusing eth::u256;\nusing eth::Address;\nusing eth::BlockInfo;\nusing eth::Client;\nusing eth::Instruction;\nusing eth::KeyPair;\nusing eth::NodeMode;\nusing eth::PeerInfo;\nusing eth::RLP;\nusing eth::Secret;\nusing eth::Transaction;\n\n\/\/ functions\nusing eth::asHex;\nusing eth::assemble;\nusing eth::compileLisp;\nusing eth::disassemble;\nusing eth::formatBalance;\nusing eth::fromUserHex;\nusing eth::right160;\nusing eth::simpleDebugOut;\nusing eth::toLog2;\nusing eth::toString;\nusing eth::units;\n\n\/\/ vars\nusing eth::g_logPost;\nusing eth::g_logVerbosity;\nusing eth::c_instructionInfo;\n\n\/\/ Horrible global for the mainwindow. Needed for the QEthereums to find the Main window which acts as multiplexer for now.\n\/\/ Can get rid of this once we've sorted out ITC for signalling & multiplexed querying.\nMain* g_main = nullptr;\n\n#define ADD_QUOTES_HELPER(s) #s\n#define ADD_QUOTES(s) ADD_QUOTES_HELPER(s)\n\nQEthereum::QEthereum(QObject* _p): QObject(_p)\n{\n\tconnect(g_main, SIGNAL(changed()), SIGNAL(changed()));\n}\n\nQEthereum::~QEthereum()\n{\n}\n\nClient* QEthereum::client() const\n{\n\treturn g_main->client();\n}\n\nAddress QEthereum::coinbase() const\n{\n\treturn client()->address();\n}\n\nvoid QEthereum::setCoinbase(Address _a)\n{\n\tif (client()->address() != _a)\n\t{\n\t\tclient()->setAddress(_a);\n\t\tchanged();\n\t}\n}\n\nQAccount::QAccount(QObject* _p)\n{\n}\n\nQAccount::~QAccount()\n{\n}\n\nvoid QAccount::setEthereum(QEthereum* _eth)\n{\n\tif (m_eth == _eth)\n\t\treturn;\n\tif (m_eth)\n\t\tdisconnect(m_eth, SIGNAL(changed()), this, SIGNAL(changed()));\n\tm_eth = _eth;\n\tif (m_eth)\n\t\tconnect(m_eth, SIGNAL(changed()), this, SIGNAL(changed()));\n\tethChanged();\n\tchanged();\n}\n\nu256 QAccount::balance() const\n{\n\tif (m_eth)\n\t\treturn m_eth->balanceAt(m_address);\n\treturn 0;\n}\n\nuint64_t QAccount::txCount() const\n{\n\tif (m_eth)\n\t\treturn m_eth->txCountAt(m_address);\n\treturn 0;\n}\n\nbool QAccount::isContract() const\n{\n\tif (m_eth)\n\t\treturn m_eth->isContractAt(m_address);\n\treturn 0;\n}\n\nu256 QEthereum::balanceAt(Address _a) const\n{\n\treturn client()->postState().balance(_a);\n}\n\nbool QEthereum::isContractAt(Address _a) const\n{\n\treturn client()->postState().isContractAddress(_a);\n}\n\nbool QEthereum::isMining() const\n{\n\treturn client()->isMining();\n}\n\nbool QEthereum::isListening() const\n{\n\treturn client()->haveNetwork();\n}\n\nvoid QEthereum::setMining(bool _l)\n{\n\tif (_l)\n\t\tclient()->startMining();\n\telse\n\t\tclient()->stopMining();\n}\n\nvoid QEthereum::setListening(bool _l)\n{\n\tif (_l)\n\t\tclient()->startNetwork();\n\telse\n\t\tclient()->stopNetwork();\n}\n\nuint64_t QEthereum::txCountAt(Address _a) const\n{\n\treturn (uint64_t)client()->postState().transactionsFrom(_a);\n}\n\nunsigned QEthereum::peerCount() const\n{\n\treturn client()->peerCount();\n}\n\nvoid QEthereum::transact(Secret _secret, Address _dest, u256 _amount)\n{\n\tclient()->transact(_secret, _dest, _amount);\n}\n\nMain::Main(QWidget *parent) :\n\tQMainWindow(parent),\n\tui(new Ui::Main)\n{\n\tsetWindowFlags(Qt::Window);\n\tui->setupUi(this);\n\tsetWindowIcon(QIcon(\":\/Ethereum.png\"));\n\n\tg_main = this;\n\n\tm_client.reset(new Client(\"Walleth\", Address(), eth::getDataDir() + \"\/Walleth\"));\n\n\tqRegisterMetaType<eth::u256>(\"eth::u256\");\n\tqRegisterMetaType<eth::KeyPair>(\"eth::KeyPair\");\n\tqRegisterMetaType<eth::Secret>(\"eth::Secret\");\n\tqRegisterMetaType<eth::Address>(\"eth::Address\");\n\tqRegisterMetaType<QAccount*>(\"QAccount*\");\n\tqRegisterMetaType<QEthereum*>(\"QEthereum*\");\n\n\tqmlRegisterType<QEthereum>(\"org.ethereum\", 1, 0, \"Ethereum\");\n\tqmlRegisterType<QAccount>(\"org.ethereum\", 1, 0, \"Account\");\n\tqmlRegisterSingletonType<U256Helper>(\"org.ethereum\", 1, 0, \"Balance\", QEthereum::constructU256Helper);\n\tqmlRegisterSingletonType<KeyHelper>(\"org.ethereum\", 1, 0, \"Key\", QEthereum::constructKeyHelper);\n\n\t\/*\n\tui->librariesView->setModel(m_libraryMan);\n\tui->graphsView->setModel(m_graphMan);\n\t*\/\n\n\tm_view = new QQuickView();\n\n\/\/\tQQmlContext* context = m_view->rootContext();\n\/\/\tcontext->setContextProperty(\"u256\", new U256Helper(this));\n\n\tm_view->setSource(QUrl(\"qrc:\/Simple.qml\"));\n\n\tQWidget* w = QWidget::createWindowContainer(m_view);\n\tm_view->setResizeMode(QQuickView::SizeRootObjectToView);\n\tui->fullDisplay->insertWidget(0, w);\n\tm_view->create();\n\n\/\/\tm_timelinesItem = m_view->rootObject()->findChild<TimelinesItem*>(\"timelines\");\n\n\treadSettings();\n\trefresh();\n\n\tm_refreshNetwork = new QTimer(this);\n\tconnect(m_refreshNetwork, SIGNAL(timeout()), SLOT(refreshNetwork()));\n\tm_refreshNetwork->start(1000);\n\n\tconnect(this, SIGNAL(changed()), SLOT(refresh()));\n\n\tconnect(&m_webCtrl, &QNetworkAccessManager::finished, [&](QNetworkReply* _r)\n\t{\n\t\tm_servers = QString::fromUtf8(_r->readAll()).split(\"\\n\", QString::SkipEmptyParts);\n\t\tif (m_servers.size())\n\t\t{\n\t\t\tui->net->setChecked(true);\n\t\t\ton_net_triggered(true);\n\t\t}\n\t});\n\tQNetworkRequest r(QUrl(\"http:\/\/www.ethereum.org\/servers.poc3.txt\"));\n\tr.setHeader(QNetworkRequest::UserAgentHeader, \"Mozilla\/5.0 (Windows NT 6.3; WOW64) AppleWebKit\/537.36 (KHTML, like Gecko) Chrome\/33.0.1712.0 Safari\/537.36\");\n\tm_webCtrl.get(r);\n\tsrand(time(0));\n\n\tstartTimer(200);\n\n\tstatusBar()->addPermanentWidget(ui->balance);\n\tstatusBar()->addPermanentWidget(ui->peerCount);\n\tstatusBar()->addPermanentWidget(ui->blockCount);\n}\n\nMain::~Main()\n{\n\twriteSettings();\n}\n\nvoid Main::timerEvent(QTimerEvent *)\n{\n\tif (m_client->changed())\n\t\tchanged();\n}\n\nvoid Main::on_about_triggered()\n{\n\tQMessageBox::about(this, \"About Walleth PoC-\" + QString(ADD_QUOTES(ETH_VERSION)).section('.', 1, 1), \"Walleth\/v\" ADD_QUOTES(ETH_VERSION) \"\/\" ADD_QUOTES(ETH_BUILD_TYPE) \"\/\" ADD_QUOTES(ETH_BUILD_PLATFORM) \"\\nBy Gav Wood, 2014.\\nBased on a design by Vitalik Buterin.\\n\\nTeam Ethereum++ includes: Tim Hughes, Eric Lombrozo, Marko Simovic, Alex Leverington and several others.\");\n}\n\nvoid Main::writeSettings()\n{\n\tQSettings s(\"ethereum\", \"walleth\");\n\tQByteArray b;\n\tb.resize(sizeof(Secret) * m_myKeys.size());\n\tauto p = b.data();\n\tfor (auto i: m_myKeys)\n\t{\n\t\tmemcpy(p, &(i.secret()), sizeof(Secret));\n\t\tp += sizeof(Secret);\n\t}\n\ts.setValue(\"address\", b);\n\n\ts.setValue(\"upnp\", ui->upnp->isChecked());\n\ts.setValue(\"clientName\", m_clientName);\n\ts.setValue(\"idealPeers\", m_idealPeers);\n\ts.setValue(\"port\", m_port);\n\n\tif (client()->peerServer())\n\t{\n\t\tbytes d = client()->peerServer()->savePeers();\n\t\tm_peers = QByteArray((char*)d.data(), (int)d.size());\n\n\t}\n\ts.setValue(\"peers\", m_peers);\n\n\ts.setValue(\"geometry\", saveGeometry());\n\ts.setValue(\"windowState\", saveState());\n}\n\nvoid Main::readSettings()\n{\n\tQSettings s(\"ethereum\", \"walleth\");\n\n\trestoreGeometry(s.value(\"geometry\").toByteArray());\n\trestoreState(s.value(\"windowState\").toByteArray());\n\n\n\tQByteArray b = s.value(\"address\").toByteArray();\n\tif (b.isEmpty())\n\t\tm_myKeys.append(KeyPair::create());\n\telse\n\t{\n\t\th256 k;\n\t\tfor (unsigned i = 0; i < b.size() \/ sizeof(Secret); ++i)\n\t\t{\n\t\t\tmemcpy(&k, b.data() + i * sizeof(Secret), sizeof(Secret));\n\t\t\tm_myKeys.append(KeyPair(k));\n\t\t}\n\t}\n\t\/\/m_eth->setAddress(m_myKeys.last().address());\n\tm_peers = s.value(\"peers\").toByteArray();\n\tui->upnp->setChecked(s.value(\"upnp\", true).toBool());\n\tm_clientName = s.value(\"clientName\", \"\").toString();\n\tm_idealPeers = s.value(\"idealPeers\", 5).toInt();\n\tm_port = s.value(\"port\", 30303).toInt();\n}\n\nvoid Main::refreshNetwork()\n{\n\tauto ps = client()->peers();\n\tui->peerCount->setText(QString::fromStdString(toString(ps.size())) + \" peer(s)\");\n}\n\neth::State const& Main::state() const\n{\n\treturn ui->preview->isChecked() ? client()->postState() : client()->state();\n}\n\nvoid Main::refresh()\n{\n\teth::ClientGuard l(client());\n\tauto const& st = state();\n\n\tauto d = client()->blockChain().details();\n\tauto diff = BlockInfo(client()->blockChain().block()).difficulty;\n\tui->blockCount->setText(QString(\"#%1 @%3 T%2\").arg(d.number).arg(toLog2(d.totalDifficulty)).arg(toLog2(diff)));\n\n\tm_keysChanged = false;\n\tu256 totalBalance = 0;\n\tfor (auto i: m_myKeys)\n\t{\n\t\tu256 b = st.balance(i.address());\n\t\ttotalBalance += b;\n\t}\n\tui->balance->setText(QString::fromStdString(formatBalance(totalBalance)));\n}\n\nvoid Main::on_net_triggered(bool _auto)\n{\n\tstring n = \"Walleth\/v\" ADD_QUOTES(ETH_VERSION);\n\tif (m_clientName.size())\n\t\tn += \"\/\" + m_clientName.toStdString();\n\tn +=  \"\/\" ADD_QUOTES(ETH_BUILD_TYPE) \"\/\" ADD_QUOTES(ETH_BUILD_PLATFORM);\n\tclient()->setClientVersion(n);\n\tif (ui->net->isChecked())\n\t{\n\t\tif (_auto)\n\t\t{\n\t\t\tQString s = m_servers[rand() % m_servers.size()];\n\t\t\tclient()->startNetwork(m_port, s.section(':', 0, 0).toStdString(), s.section(':', 1).toInt(), NodeMode::Full, m_idealPeers, std::string(), ui->upnp->isChecked());\n\t\t}\n\t\telse\n\t\t\tclient()->startNetwork(m_port, string(), 0, NodeMode::Full, m_idealPeers, std::string(), ui->upnp->isChecked());\n\t\tif (m_peers.size())\n\t\t\tclient()->peerServer()->restorePeers(bytesConstRef((byte*)m_peers.data(), m_peers.size()));\n\t}\n\telse\n\t\tclient()->stopNetwork();\n}\n\nvoid Main::on_connect_triggered()\n{\n\tif (!ui->net->isChecked())\n\t{\n\t\tui->net->setChecked(true);\n\t\ton_net_triggered();\n\t}\n\tbool ok = false;\n\tQString s = QInputDialog::getItem(this, \"Connect to a Network Peer\", \"Enter a peer to which a connection may be made:\", m_servers, m_servers.count() ? rand() % m_servers.count() : 0, true, &ok);\n\tif (ok && s.contains(\":\"))\n\t{\n\t\tstring host = s.section(\":\", 0, 0).toStdString();\n\t\tunsigned short port = s.section(\":\", 1).toInt();\n\t\tclient()->connect(host, port);\n\t}\n}\n\nvoid Main::on_mine_triggered()\n{\n\tif (ui->mine->isChecked())\n\t{\n\t\tclient()->setAddress(m_myKeys.last().address());\n\t\tclient()->startMining();\n\t}\n\telse\n\t\tclient()->stopMining();\n}\n\nvoid Main::on_create_triggered()\n{\n\tm_myKeys.append(KeyPair::create());\n\tm_keysChanged = true;\n}\n\n\/\/ extra bits needed to link on VS\n#ifdef _MSC_VER\n\n\/\/ include moc file, ofuscated to hide from automoc\n#include\\\n\"moc_MainWin.cpp\"\n\n\/\/ specify library dependencies, it's easier to do here than in the project since we can control the \"d\" debug suffix\n#ifdef _DEBUG\n#define QTLIB(x) x\"d.lib\"\n#else \n#define QTLIB(x) x\".lib\"\n#endif\n\n#pragma comment(lib, QTLIB(\"Qt5PlatformSupport\"))\n#pragma comment(lib, QTLIB(\"Qt5Core\"))\n#pragma comment(lib, QTLIB(\"Qt5GUI\"))\n#pragma comment(lib, QTLIB(\"Qt5Widgets\"))\n#pragma comment(lib, QTLIB(\"Qt5Network\"))\n#pragma comment(lib, QTLIB(\"qwindows\"))\n#pragma comment(lib, \"Imm32.lib\")\n#pragma comment(lib, \"opengl32.lib\")\n#pragma comment(lib, \"winmm.lib\")\n\n\n#endif\n<commit_msg>Use BuildInfo.h<commit_after>#include <QtNetwork\/QNetworkReply>\n#include <QtQuick\/QQuickView>\n\/\/#include <QtQml\/QQmlContext>\n\/\/#include <QtQml\/QQmlEngine>\n#include <QtQml>\n#include <QtWidgets\/QMessageBox>\n#include <QtWidgets\/QInputDialog>\n#include <QtGui\/QClipboard>\n#include <QtCore\/QtCore>\n#include <libethereum\/Dagger.h>\n#include <libethereum\/Client.h>\n#include <libethereum\/Instruction.h>\n#include <libethereum\/FileSystem.h>\n#include \"BuildInfo.h\"\n#include \"MainWin.h\"\n#include \"ui_Main.h\"\nusing namespace std;\n\n\/\/ types\nusing eth::bytes;\nusing eth::bytesConstRef;\nusing eth::h160;\nusing eth::h256;\nusing eth::u160;\nusing eth::u256;\nusing eth::Address;\nusing eth::BlockInfo;\nusing eth::Client;\nusing eth::Instruction;\nusing eth::KeyPair;\nusing eth::NodeMode;\nusing eth::PeerInfo;\nusing eth::RLP;\nusing eth::Secret;\nusing eth::Transaction;\n\n\/\/ functions\nusing eth::asHex;\nusing eth::assemble;\nusing eth::compileLisp;\nusing eth::disassemble;\nusing eth::formatBalance;\nusing eth::fromUserHex;\nusing eth::right160;\nusing eth::simpleDebugOut;\nusing eth::toLog2;\nusing eth::toString;\nusing eth::units;\n\n\/\/ vars\nusing eth::g_logPost;\nusing eth::g_logVerbosity;\nusing eth::c_instructionInfo;\n\n\/\/ Horrible global for the mainwindow. Needed for the QEthereums to find the Main window which acts as multiplexer for now.\n\/\/ Can get rid of this once we've sorted out ITC for signalling & multiplexed querying.\nMain* g_main = nullptr;\n\nQEthereum::QEthereum(QObject* _p): QObject(_p)\n{\n\tconnect(g_main, SIGNAL(changed()), SIGNAL(changed()));\n}\n\nQEthereum::~QEthereum()\n{\n}\n\nClient* QEthereum::client() const\n{\n\treturn g_main->client();\n}\n\nAddress QEthereum::coinbase() const\n{\n\treturn client()->address();\n}\n\nvoid QEthereum::setCoinbase(Address _a)\n{\n\tif (client()->address() != _a)\n\t{\n\t\tclient()->setAddress(_a);\n\t\tchanged();\n\t}\n}\n\nQAccount::QAccount(QObject* _p)\n{\n}\n\nQAccount::~QAccount()\n{\n}\n\nvoid QAccount::setEthereum(QEthereum* _eth)\n{\n\tif (m_eth == _eth)\n\t\treturn;\n\tif (m_eth)\n\t\tdisconnect(m_eth, SIGNAL(changed()), this, SIGNAL(changed()));\n\tm_eth = _eth;\n\tif (m_eth)\n\t\tconnect(m_eth, SIGNAL(changed()), this, SIGNAL(changed()));\n\tethChanged();\n\tchanged();\n}\n\nu256 QAccount::balance() const\n{\n\tif (m_eth)\n\t\treturn m_eth->balanceAt(m_address);\n\treturn 0;\n}\n\nuint64_t QAccount::txCount() const\n{\n\tif (m_eth)\n\t\treturn m_eth->txCountAt(m_address);\n\treturn 0;\n}\n\nbool QAccount::isContract() const\n{\n\tif (m_eth)\n\t\treturn m_eth->isContractAt(m_address);\n\treturn 0;\n}\n\nu256 QEthereum::balanceAt(Address _a) const\n{\n\treturn client()->postState().balance(_a);\n}\n\nbool QEthereum::isContractAt(Address _a) const\n{\n\treturn client()->postState().isContractAddress(_a);\n}\n\nbool QEthereum::isMining() const\n{\n\treturn client()->isMining();\n}\n\nbool QEthereum::isListening() const\n{\n\treturn client()->haveNetwork();\n}\n\nvoid QEthereum::setMining(bool _l)\n{\n\tif (_l)\n\t\tclient()->startMining();\n\telse\n\t\tclient()->stopMining();\n}\n\nvoid QEthereum::setListening(bool _l)\n{\n\tif (_l)\n\t\tclient()->startNetwork();\n\telse\n\t\tclient()->stopNetwork();\n}\n\nuint64_t QEthereum::txCountAt(Address _a) const\n{\n\treturn (uint64_t)client()->postState().transactionsFrom(_a);\n}\n\nunsigned QEthereum::peerCount() const\n{\n\treturn client()->peerCount();\n}\n\nvoid QEthereum::transact(Secret _secret, Address _dest, u256 _amount)\n{\n\tclient()->transact(_secret, _dest, _amount);\n}\n\nMain::Main(QWidget *parent) :\n\tQMainWindow(parent),\n\tui(new Ui::Main)\n{\n\tsetWindowFlags(Qt::Window);\n\tui->setupUi(this);\n\tsetWindowIcon(QIcon(\":\/Ethereum.png\"));\n\n\tg_main = this;\n\n\tm_client.reset(new Client(\"Walleth\", Address(), eth::getDataDir() + \"\/Walleth\"));\n\n\tqRegisterMetaType<eth::u256>(\"eth::u256\");\n\tqRegisterMetaType<eth::KeyPair>(\"eth::KeyPair\");\n\tqRegisterMetaType<eth::Secret>(\"eth::Secret\");\n\tqRegisterMetaType<eth::Address>(\"eth::Address\");\n\tqRegisterMetaType<QAccount*>(\"QAccount*\");\n\tqRegisterMetaType<QEthereum*>(\"QEthereum*\");\n\n\tqmlRegisterType<QEthereum>(\"org.ethereum\", 1, 0, \"Ethereum\");\n\tqmlRegisterType<QAccount>(\"org.ethereum\", 1, 0, \"Account\");\n\tqmlRegisterSingletonType<U256Helper>(\"org.ethereum\", 1, 0, \"Balance\", QEthereum::constructU256Helper);\n\tqmlRegisterSingletonType<KeyHelper>(\"org.ethereum\", 1, 0, \"Key\", QEthereum::constructKeyHelper);\n\n\t\/*\n\tui->librariesView->setModel(m_libraryMan);\n\tui->graphsView->setModel(m_graphMan);\n\t*\/\n\n\tm_view = new QQuickView();\n\n\/\/\tQQmlContext* context = m_view->rootContext();\n\/\/\tcontext->setContextProperty(\"u256\", new U256Helper(this));\n\n\tm_view->setSource(QUrl(\"qrc:\/Simple.qml\"));\n\n\tQWidget* w = QWidget::createWindowContainer(m_view);\n\tm_view->setResizeMode(QQuickView::SizeRootObjectToView);\n\tui->fullDisplay->insertWidget(0, w);\n\tm_view->create();\n\n\/\/\tm_timelinesItem = m_view->rootObject()->findChild<TimelinesItem*>(\"timelines\");\n\n\treadSettings();\n\trefresh();\n\n\tm_refreshNetwork = new QTimer(this);\n\tconnect(m_refreshNetwork, SIGNAL(timeout()), SLOT(refreshNetwork()));\n\tm_refreshNetwork->start(1000);\n\n\tconnect(this, SIGNAL(changed()), SLOT(refresh()));\n\n\tconnect(&m_webCtrl, &QNetworkAccessManager::finished, [&](QNetworkReply* _r)\n\t{\n\t\tm_servers = QString::fromUtf8(_r->readAll()).split(\"\\n\", QString::SkipEmptyParts);\n\t\tif (m_servers.size())\n\t\t{\n\t\t\tui->net->setChecked(true);\n\t\t\ton_net_triggered(true);\n\t\t}\n\t});\n\tQNetworkRequest r(QUrl(\"http:\/\/www.ethereum.org\/servers.poc3.txt\"));\n\tr.setHeader(QNetworkRequest::UserAgentHeader, \"Mozilla\/5.0 (Windows NT 6.3; WOW64) AppleWebKit\/537.36 (KHTML, like Gecko) Chrome\/33.0.1712.0 Safari\/537.36\");\n\tm_webCtrl.get(r);\n\tsrand(time(0));\n\n\tstartTimer(200);\n\n\tstatusBar()->addPermanentWidget(ui->balance);\n\tstatusBar()->addPermanentWidget(ui->peerCount);\n\tstatusBar()->addPermanentWidget(ui->blockCount);\n}\n\nMain::~Main()\n{\n\twriteSettings();\n}\n\nvoid Main::timerEvent(QTimerEvent *)\n{\n\tif (m_client->changed())\n\t\tchanged();\n}\n\nvoid Main::on_about_triggered()\n{\n\tQMessageBox::about(this, \"About Walleth PoC-\" + QString(ETH_QUOTED(ETH_VERSION)).section('.', 1, 1), \"Walleth\/v\" ETH_QUOTED(ETH_VERSION) \"\/\" ETH_QUOTED(ETH_BUILD_TYPE) \"\/\" ETH_QUOTED(ETH_BUILD_PLATFORM) \"\\nBy Gav Wood, 2014.\\nBased on a design by Vitalik Buterin.\\n\\nTeam Ethereum++ includes: Tim Hughes, Eric Lombrozo, Marko Simovic, Alex Leverington and several others.\");\n}\n\nvoid Main::writeSettings()\n{\n\tQSettings s(\"ethereum\", \"walleth\");\n\tQByteArray b;\n\tb.resize(sizeof(Secret) * m_myKeys.size());\n\tauto p = b.data();\n\tfor (auto i: m_myKeys)\n\t{\n\t\tmemcpy(p, &(i.secret()), sizeof(Secret));\n\t\tp += sizeof(Secret);\n\t}\n\ts.setValue(\"address\", b);\n\n\ts.setValue(\"upnp\", ui->upnp->isChecked());\n\ts.setValue(\"clientName\", m_clientName);\n\ts.setValue(\"idealPeers\", m_idealPeers);\n\ts.setValue(\"port\", m_port);\n\n\tif (client()->peerServer())\n\t{\n\t\tbytes d = client()->peerServer()->savePeers();\n\t\tm_peers = QByteArray((char*)d.data(), (int)d.size());\n\n\t}\n\ts.setValue(\"peers\", m_peers);\n\n\ts.setValue(\"geometry\", saveGeometry());\n\ts.setValue(\"windowState\", saveState());\n}\n\nvoid Main::readSettings()\n{\n\tQSettings s(\"ethereum\", \"walleth\");\n\n\trestoreGeometry(s.value(\"geometry\").toByteArray());\n\trestoreState(s.value(\"windowState\").toByteArray());\n\n\n\tQByteArray b = s.value(\"address\").toByteArray();\n\tif (b.isEmpty())\n\t\tm_myKeys.append(KeyPair::create());\n\telse\n\t{\n\t\th256 k;\n\t\tfor (unsigned i = 0; i < b.size() \/ sizeof(Secret); ++i)\n\t\t{\n\t\t\tmemcpy(&k, b.data() + i * sizeof(Secret), sizeof(Secret));\n\t\t\tm_myKeys.append(KeyPair(k));\n\t\t}\n\t}\n\t\/\/m_eth->setAddress(m_myKeys.last().address());\n\tm_peers = s.value(\"peers\").toByteArray();\n\tui->upnp->setChecked(s.value(\"upnp\", true).toBool());\n\tm_clientName = s.value(\"clientName\", \"\").toString();\n\tm_idealPeers = s.value(\"idealPeers\", 5).toInt();\n\tm_port = s.value(\"port\", 30303).toInt();\n}\n\nvoid Main::refreshNetwork()\n{\n\tauto ps = client()->peers();\n\tui->peerCount->setText(QString::fromStdString(toString(ps.size())) + \" peer(s)\");\n}\n\neth::State const& Main::state() const\n{\n\treturn ui->preview->isChecked() ? client()->postState() : client()->state();\n}\n\nvoid Main::refresh()\n{\n\teth::ClientGuard l(client());\n\tauto const& st = state();\n\n\tauto d = client()->blockChain().details();\n\tauto diff = BlockInfo(client()->blockChain().block()).difficulty;\n\tui->blockCount->setText(QString(\"#%1 @%3 T%2\").arg(d.number).arg(toLog2(d.totalDifficulty)).arg(toLog2(diff)));\n\n\tm_keysChanged = false;\n\tu256 totalBalance = 0;\n\tfor (auto i: m_myKeys)\n\t{\n\t\tu256 b = st.balance(i.address());\n\t\ttotalBalance += b;\n\t}\n\tui->balance->setText(QString::fromStdString(formatBalance(totalBalance)));\n}\n\nvoid Main::on_net_triggered(bool _auto)\n{\n\tstring n = \"Walleth\/v\" ETH_QUOTED(ETH_VERSION);\n\tif (m_clientName.size())\n\t\tn += \"\/\" + m_clientName.toStdString();\n\tn +=  \"\/\" ETH_QUOTED(ETH_BUILD_TYPE) \"\/\" ETH_QUOTED(ETH_BUILD_PLATFORM);\n\tclient()->setClientVersion(n);\n\tif (ui->net->isChecked())\n\t{\n\t\tif (_auto)\n\t\t{\n\t\t\tQString s = m_servers[rand() % m_servers.size()];\n\t\t\tclient()->startNetwork(m_port, s.section(':', 0, 0).toStdString(), s.section(':', 1).toInt(), NodeMode::Full, m_idealPeers, std::string(), ui->upnp->isChecked());\n\t\t}\n\t\telse\n\t\t\tclient()->startNetwork(m_port, string(), 0, NodeMode::Full, m_idealPeers, std::string(), ui->upnp->isChecked());\n\t\tif (m_peers.size())\n\t\t\tclient()->peerServer()->restorePeers(bytesConstRef((byte*)m_peers.data(), m_peers.size()));\n\t}\n\telse\n\t\tclient()->stopNetwork();\n}\n\nvoid Main::on_connect_triggered()\n{\n\tif (!ui->net->isChecked())\n\t{\n\t\tui->net->setChecked(true);\n\t\ton_net_triggered();\n\t}\n\tbool ok = false;\n\tQString s = QInputDialog::getItem(this, \"Connect to a Network Peer\", \"Enter a peer to which a connection may be made:\", m_servers, m_servers.count() ? rand() % m_servers.count() : 0, true, &ok);\n\tif (ok && s.contains(\":\"))\n\t{\n\t\tstring host = s.section(\":\", 0, 0).toStdString();\n\t\tunsigned short port = s.section(\":\", 1).toInt();\n\t\tclient()->connect(host, port);\n\t}\n}\n\nvoid Main::on_mine_triggered()\n{\n\tif (ui->mine->isChecked())\n\t{\n\t\tclient()->setAddress(m_myKeys.last().address());\n\t\tclient()->startMining();\n\t}\n\telse\n\t\tclient()->stopMining();\n}\n\nvoid Main::on_create_triggered()\n{\n\tm_myKeys.append(KeyPair::create());\n\tm_keysChanged = true;\n}\n\n\/\/ extra bits needed to link on VS\n#ifdef _MSC_VER\n\n\/\/ include moc file, ofuscated to hide from automoc\n#include\\\n\"moc_MainWin.cpp\"\n\n\/\/ specify library dependencies, it's easier to do here than in the project since we can control the \"d\" debug suffix\n#ifdef _DEBUG\n#define QTLIB(x) x\"d.lib\"\n#else \n#define QTLIB(x) x\".lib\"\n#endif\n\n#pragma comment(lib, QTLIB(\"Qt5PlatformSupport\"))\n#pragma comment(lib, QTLIB(\"Qt5Core\"))\n#pragma comment(lib, QTLIB(\"Qt5GUI\"))\n#pragma comment(lib, QTLIB(\"Qt5Widgets\"))\n#pragma comment(lib, QTLIB(\"Qt5Network\"))\n#pragma comment(lib, QTLIB(\"qwindows\"))\n#pragma comment(lib, \"Imm32.lib\")\n#pragma comment(lib, \"opengl32.lib\")\n#pragma comment(lib, \"winmm.lib\")\n\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <silicium\/variant.hpp>\n#include <boost\/asio\/async_result.hpp>\n#include <functional>\n\nnamespace warpcoil\n{\n    struct use_future_type\n    {\n    };\n\n    constexpr use_future_type use_future;\n\n    namespace detail\n    {\n        template <class Result>\n        struct future_handler\n        {\n            std::shared_ptr<Si::variant<Si::unit, std::function<void(Result)>, Result>> state;\n\n            explicit future_handler(use_future_type)\n                : state(std::make_shared<\n                        Si::variant<Si::unit, std::function<void(Result)>, Result>>())\n            {\n            }\n\n            void operator()(Result result)\n            {\n                Si::visit<void>(*state,\n                                [this, &result](Si::unit)\n                                {\n                                    *state = std::move(result);\n                                },\n                                [&result](std::function<void(Result)> &handler)\n                                {\n                                    handler(std::move(result));\n                                },\n                                [](Result &)\n                                {\n                                    SILICIUM_UNREACHABLE();\n                                });\n            }\n        };\n    }\n\n    namespace detail\n    {\n        template <class T>\n        struct apply_transform\n        {\n            template <class Transformation, class Input, class HandleResult>\n            static void apply(Transformation &&transform, Input &&input,\n                              HandleResult &&handle_result)\n            {\n                std::forward<HandleResult>(handle_result)(\n                    std::forward<Transformation>(transform)(std::forward<Input>(input)));\n            }\n\n            template <class Transformation, class HandleResult>\n            static void apply(Transformation &&transform, HandleResult &&handle_result)\n            {\n                std::forward<HandleResult>(handle_result)(\n                    std::forward<Transformation>(transform)());\n            }\n        };\n\n        template <>\n        struct apply_transform<void>\n        {\n            template <class Transformation, class Input, class HandleResult>\n            static void apply(Transformation &&transform, Input &&input,\n                              HandleResult &&handle_result)\n            {\n                std::forward<Transformation>(transform)(std::forward<Input>(input));\n                std::forward<HandleResult>(handle_result)();\n            }\n\n            template <class Transformation, class HandleResult>\n            static void apply(Transformation &&transform, HandleResult &&handle_result)\n            {\n                std::forward<Transformation>(transform)();\n                std::forward<HandleResult>(handle_result)();\n            }\n        };\n    }\n\n    template <class Result>\n    struct future\n    {\n        explicit future(std::function<void(std::function<void(Result)>)> wait)\n            : _wait(std::move(wait))\n        {\n        }\n\n        template <class CompletionToken>\n        auto async_wait(CompletionToken &&token)\n        {\n            assert(_wait);\n            using handler_type =\n                typename boost::asio::handler_type<decltype(token), void(Result)>::type;\n            handler_type handler(std::forward<CompletionToken>(token));\n            boost::asio::async_result<handler_type> result(handler);\n            _wait(std::move(handler));\n            return result.get();\n        }\n\n        template <class Transformation>\n        auto then(Transformation &&transform)\n        {\n            using transformed_result = decltype(transform(std::declval<Result>()));\n            auto wait = std::move(_wait);\n            assert(!_wait);\n            return future<transformed_result>(\n                [ wait = std::move(wait), transform = std::forward<Transformation>(transform) ](\n                    std::function<void(transformed_result)> on_result) mutable\n                {\n                    wait([\n                        on_result = std::move(on_result),\n                        transform = std::forward<Transformation>(transform)\n                    ](Result intermediate) mutable\n                         {\n                             detail::apply_transform<transformed_result>::apply(\n                                 std::forward<Transformation>(transform),\n                                 std::forward<Result>(intermediate), std::move(on_result));\n                         });\n                });\n        }\n\n    private:\n        std::function<void(std::function<void(Result)>)> _wait;\n    };\n\n    template <>\n    struct future<void>\n    {\n        explicit future(std::function<void(std::function<void()>)> wait)\n            : _wait(std::move(wait))\n        {\n        }\n\n        template <class CompletionToken>\n        auto async_wait(CompletionToken &&token)\n        {\n            assert(_wait);\n            using handler_type = typename boost::asio::handler_type<decltype(token), void()>::type;\n            handler_type handler(std::forward<CompletionToken>(token));\n            boost::asio::async_result<handler_type> result(handler);\n            _wait(std::move(handler));\n            return result.get();\n        }\n\n        template <class Transformation>\n        auto then(Transformation &&transform)\n        {\n            using transformed_result = decltype(transform());\n            auto wait = std::move(_wait);\n            assert(!_wait);\n            return future<transformed_result>(\n                [ wait = std::move(wait), transform = std::forward<Transformation>(transform) ](\n                    std::function<void(transformed_result)> on_result) mutable\n                {\n                    wait([\n                        on_result = std::move(on_result),\n                        transform = std::forward<Transformation>(transform)\n                    ]() mutable\n                         {\n                             detail::apply_transform<transformed_result>::apply(\n                                 std::forward<Transformation>(transform), std::move(on_result));\n                         });\n                });\n        }\n\n    private:\n        std::function<void(std::function<void()>)> _wait;\n    };\n\n    template <class... Futures>\n    auto when_all(Futures &&... futures)\n    {\n        size_t completed = 0;\n        return future<void>(std::function<void(std::function<void()>)>(std::bind<void>(\n            [completed](auto &&on_result, auto &&... futures) mutable\n            {\n                static constexpr size_t future_count = sizeof...(futures);\n                using expand_type = int[];\n                expand_type{(futures.async_wait([&completed, on_result]()\n                                                {\n                                                    ++completed;\n                                                    if (completed == future_count)\n                                                    {\n                                                        on_result();\n                                                    }\n                                                }),\n                             0)...};\n            },\n            std::placeholders::_1, std::forward<Futures>(futures)...)));\n    }\n}\n\nnamespace boost\n{\n    namespace asio\n    {\n        template <class Result>\n        struct async_result<warpcoil::detail::future_handler<Result>>\n        {\n            using type = warpcoil::future<Result>;\n\n            explicit async_result(warpcoil::detail::future_handler<Result> const &handler)\n                : _handler(handler)\n            {\n                assert(_handler.state);\n            }\n\n            warpcoil::future<Result> get()\n            {\n                assert(_handler.state);\n                return warpcoil::future<Result>([state = std::move(_handler.state)](\n                    std::function<void(Result)> handle_result)\n                                                {\n                                                    Si::visit<void>(\n                                                        *state,\n                                                        [&state, &handle_result](Si::unit)\n                                                        {\n                                                            *state = std::move(handle_result);\n                                                        },\n                                                        [](std::function<void(Result)> &)\n                                                        {\n                                                            SILICIUM_UNREACHABLE();\n                                                        },\n                                                        [&handle_result](Result &result)\n                                                        {\n                                                            handle_result(std::move(result));\n                                                        });\n                                                });\n            }\n\n        private:\n            warpcoil::detail::future_handler<Result> _handler;\n        };\n\n        template <class Result>\n        struct handler_type<warpcoil::use_future_type, void(Result)>\n        {\n            using type = warpcoil::detail::future_handler<Result>;\n        };\n    }\n}\n<commit_msg>try to fix GCC build<commit_after>#pragma once\n\n#include <silicium\/variant.hpp>\n#include <boost\/asio\/async_result.hpp>\n#include <functional>\n\nnamespace warpcoil\n{\n    struct use_future_type\n    {\n    };\n\n    constexpr use_future_type use_future;\n\n    namespace detail\n    {\n        template <class Result>\n        struct future_handler\n        {\n            std::shared_ptr<Si::variant<Si::unit, std::function<void(Result)>, Result>> state;\n\n            explicit future_handler(use_future_type)\n                : state(std::make_shared<\n                        Si::variant<Si::unit, std::function<void(Result)>, Result>>())\n            {\n            }\n\n            void operator()(Result result)\n            {\n                Si::visit<void>(*state,\n                                [this, &result](Si::unit)\n                                {\n                                    *state = std::move(result);\n                                },\n                                [&result](std::function<void(Result)> &handler)\n                                {\n                                    handler(std::move(result));\n                                },\n                                [](Result &)\n                                {\n                                    SILICIUM_UNREACHABLE();\n                                });\n            }\n        };\n    }\n\n    namespace detail\n    {\n        template <class T>\n        struct apply_transform\n        {\n            template <class Transformation, class Input, class HandleResult>\n            static void apply(Transformation &&transform, Input &&input,\n                              HandleResult &&handle_result)\n            {\n                std::forward<HandleResult>(handle_result)(\n                    std::forward<Transformation>(transform)(std::forward<Input>(input)));\n            }\n\n            template <class Transformation, class HandleResult>\n            static void apply(Transformation &&transform, HandleResult &&handle_result)\n            {\n                std::forward<HandleResult>(handle_result)(\n                    std::forward<Transformation>(transform)());\n            }\n        };\n\n        template <>\n        struct apply_transform<void>\n        {\n            template <class Transformation, class Input, class HandleResult>\n            static void apply(Transformation &&transform, Input &&input,\n                              HandleResult &&handle_result)\n            {\n                std::forward<Transformation>(transform)(std::forward<Input>(input));\n                std::forward<HandleResult>(handle_result)();\n            }\n\n            template <class Transformation, class HandleResult>\n            static void apply(Transformation &&transform, HandleResult &&handle_result)\n            {\n                std::forward<Transformation>(transform)();\n                std::forward<HandleResult>(handle_result)();\n            }\n        };\n    }\n\n    template <class Result>\n    struct future\n    {\n        explicit future(std::function<void(std::function<void(Result)>)> wait)\n            : _wait(std::move(wait))\n        {\n        }\n\n        template <class CompletionToken>\n        auto async_wait(CompletionToken &&token)\n        {\n            assert(_wait);\n            using handler_type =\n                typename boost::asio::handler_type<decltype(token), void(Result)>::type;\n            handler_type handler(std::forward<CompletionToken>(token));\n            boost::asio::async_result<handler_type> result(handler);\n            _wait(std::move(handler));\n            return result.get();\n        }\n\n        template <class Transformation>\n        auto then(Transformation &&transform)\n        {\n            using transformed_result = decltype(transform(std::declval<Result>()));\n            auto wait = std::move(_wait);\n            assert(!_wait);\n            return future<transformed_result>(\n                [ wait = std::move(wait), transform = std::forward<Transformation>(transform) ](\n                    std::function<void(transformed_result)> on_result) mutable\n                {\n                    wait([\n                        on_result = std::move(on_result),\n                        transform = std::forward<Transformation>(transform)\n                    ](Result intermediate) mutable\n                         {\n                             detail::apply_transform<transformed_result>::apply(\n                                 std::forward<Transformation>(transform),\n                                 std::forward<Result>(intermediate), std::move(on_result));\n                         });\n                });\n        }\n\n    private:\n        std::function<void(std::function<void(Result)>)> _wait;\n    };\n\n    template <>\n    struct future<void>\n    {\n        explicit future(std::function<void(std::function<void()>)> wait)\n            : _wait(std::move(wait))\n        {\n        }\n\n        template <class CompletionToken>\n        auto async_wait(CompletionToken &&token)\n        {\n            assert(_wait);\n            using handler_type = typename boost::asio::handler_type<decltype(token), void()>::type;\n            handler_type handler(std::forward<CompletionToken>(token));\n            boost::asio::async_result<handler_type> result(handler);\n            _wait(std::move(handler));\n            return result.get();\n        }\n\n        template <class Transformation>\n        auto then(Transformation &&transform)\n        {\n            using transformed_result = decltype(transform());\n            auto wait = std::move(_wait);\n            assert(!_wait);\n            return future<transformed_result>(\n                [ wait = std::move(wait), transform = std::forward<Transformation>(transform) ](\n                    std::function<void(transformed_result)> on_result) mutable\n                {\n                    wait([\n                        on_result = std::move(on_result),\n                        transform = std::forward<Transformation>(transform)\n                    ]() mutable\n                         {\n                             detail::apply_transform<transformed_result>::apply(\n                                 std::forward<Transformation>(transform), std::move(on_result));\n                         });\n                });\n        }\n\n    private:\n        std::function<void(std::function<void()>)> _wait;\n    };\n\n    template <class... Futures>\n    auto when_all(Futures &&... futures)\n    {\n        return future<void>(std::function<void(std::function<void()>)>(std::bind<void>(\n            [](auto &&on_result, auto &&... futures) mutable\n            {\n                static constexpr size_t future_count = sizeof...(futures);\n                using expand_type = int[];\n                auto callback = [ completed = std::make_shared<size_t>(0), on_result ]()\n                {\n                    ++*completed;\n                    if (*completed == future_count)\n                    {\n                        on_result();\n                    }\n                };\n                expand_type{(futures.async_wait(callback), 0)...};\n            },\n            std::placeholders::_1, std::forward<Futures>(futures)...)));\n    }\n}\n\nnamespace boost\n{\n    namespace asio\n    {\n        template <class Result>\n        struct async_result<warpcoil::detail::future_handler<Result>>\n        {\n            using type = warpcoil::future<Result>;\n\n            explicit async_result(warpcoil::detail::future_handler<Result> const &handler)\n                : _handler(handler)\n            {\n                assert(_handler.state);\n            }\n\n            warpcoil::future<Result> get()\n            {\n                assert(_handler.state);\n                return warpcoil::future<Result>([state = std::move(_handler.state)](\n                    std::function<void(Result)> handle_result)\n                                                {\n                                                    Si::visit<void>(\n                                                        *state,\n                                                        [&state, &handle_result](Si::unit)\n                                                        {\n                                                            *state = std::move(handle_result);\n                                                        },\n                                                        [](std::function<void(Result)> &)\n                                                        {\n                                                            SILICIUM_UNREACHABLE();\n                                                        },\n                                                        [&handle_result](Result &result)\n                                                        {\n                                                            handle_result(std::move(result));\n                                                        });\n                                                });\n            }\n\n        private:\n            warpcoil::detail::future_handler<Result> _handler;\n        };\n\n        template <class Result>\n        struct handler_type<warpcoil::use_future_type, void(Result)>\n        {\n            using type = warpcoil::detail::future_handler<Result>;\n        };\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 <math.h>\n#include \"renderer.hpp\"\n\n\/\/#include \"scene.hpp\"\n\nRenderer::Renderer()\n  :\n  scene_{},\n  colorbuffer_(scene_.xres_*scene_.yres_, Color{}),\n  ppm_(scene_.xres_, scene_.yres_, \"default.ppm\")\n  {}\n\nRenderer::Renderer(Scene scene)\n  : \/*width_{scene->xres_}\n  , height_{scene->yres_}\n  , colorbuffer_(w*h, Color(0.0, 0.0, 0.0))\n  , filename_(file)\n  , ppm_(width_, height_)*\/\n  scene_{scene},\n  colorbuffer_(scene.xres_*scene.yres_, Color{}),\n  ppm_(scene.xres_, scene.yres_, scene.filename)\n  {}\n\n\n\n\/\/0.5 Alpha \/ 2 M_PI\nvoid Renderer::render()\n{\n\n  float pic_ymax =2\/scene_.xres_*scene_.yres_;\n\n\/\/float pic_z =1\/(0.5*1.0\/*alpha*\/);\/\/alpha von der camera aus der scene \"angle\"\n\/\/glm::vec3 p1{-1.0,};\n\/\/  height_=(2\/scene.width_);\n\/\/prinzipieller aufbau\n  \/*\nwhile (int x = 0; x < width; ++x)\n{\n  for (int y = 0; y < height; ++y)\n  {\n    Pixel p(x,y,pic_z);\n  }\n}*\/\n\n\n\n  const std::size_t checkersize = 20;\n\n    float distance=(((45\/360)*2*3.1415)*0.5)\/2*3.1415;\n    glm::vec3 mittelp{0.0,0.0,-3.0};\n    float rad = 1;\n    Sphere kugel{mittelp, rad};\n    glm::vec3 onedirection{0.0,0.0,-1.0};\n    int height_= scene_.yres_;\n    int width_= scene_.xres_;\n\n\n  for (unsigned y = 0; y < height_; ++y) {\n    \/\/std::cout << y << \"\\n\";\n    int h = height_\/2;\n\n    for (unsigned x = 0; x < width_; ++x) {\n      int w = -(width_\/2);\n        \/\/std::cout << \"x = \" << x << \"\\n\";\n      \/\/\n      \/\/ p.color = raytrace(ray, depth);\n      glm::vec3 origin{w,h,0.0};\n      Ray camray{origin, onedirection};\n      Pixel p(x,y);\n      Hit hitteter=kugel.intersect(camray);\n      if (hitteter.hit_ == true){\n        p.color = Color(1.0,1.0,1.0);\n      } else{\n        p.color = Color(0.0,0.0,0.0);\n      }\n      write(p);\n      ++w;\n    }\n    --h;\n  }\n  ppm_.save(scene_.filename);\n  std::cout << \"saved file in: \" << scene_.filename << \" amazing! \\n\";\n}\n\nvoid Renderer::write(Pixel const& p)\n{\n  \/\/ flip pixels, because of opengl glDrawPixels\n  size_t buf_pos = (scene_.xres_*p.y + p.x);\n  if (buf_pos >= colorbuffer_.size() || (int)buf_pos < 0) {\n    std::cerr << \"Fatal Error Renderer::write(Pixel p) : \"\n      << \"pixel out of ppm_ : \"\n      << (int)p.x << \",\" << (int)p.y\n      << std::endl;\n  } else {\n    colorbuffer_[buf_pos] = p.color;\n  }\n  \/\/std::cout << scene_.xres_ << \" \" << scene_.yres_ << \"\\n\";\n  ppm_.write(p);\n}\n<commit_msg>First picgit add .. !<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 <math.h>\n#include \"renderer.hpp\"\n\n\/\/#include \"scene.hpp\"\n\nRenderer::Renderer()\n  :\n  scene_{},\n  colorbuffer_(scene_.xres_*scene_.yres_, Color{}),\n  ppm_(scene_.xres_, scene_.yres_, \"default.ppm\")\n  {}\n\nRenderer::Renderer(Scene scene)\n  : \/*width_{scene->xres_}\n  , height_{scene->yres_}\n  , colorbuffer_(w*h, Color(0.0, 0.0, 0.0))\n  , filename_(file)\n  , ppm_(width_, height_)*\/\n  scene_{scene},\n  colorbuffer_(scene.xres_*scene.yres_, Color{}),\n  ppm_(scene.xres_, scene.yres_, scene.filename)\n  {}\n\n\n\n\/\/0.5 Alpha \/ 2 M_PI\nvoid Renderer::render()\n{\n\n  float pic_ymax =2\/scene_.xres_*scene_.yres_;\n\n\/\/float pic_z =1\/(0.5*1.0\/*alpha*\/);\/\/alpha von der camera aus der scene \"angle\"\n\/\/glm::vec3 p1{-1.0,};\n\/\/  height_=(2\/scene.width_);\n\/\/prinzipieller aufbau\n  \/*\nwhile (int x = 0; x < width; ++x)\n{\n  for (int y = 0; y < height; ++y)\n  {\n    Pixel p(x,y,pic_z);\n  }\n}*\/\n\n\n\n\/\/  const std::size_t checkersize = 20;\n\n    float distance=(((45\/360)*2*3.1415)*0.5)\/2*3.1415;\n    glm::vec3 mittelp{0.0,0.0,-3.0};\n    float rad = 1;\n    Sphere kugel{mittelp, rad};\n    glm::vec3 onedirection{0.0,0.0,-1.0};\n    int height_= scene_.yres_;\n    int width_= scene_.xres_;\n\n    float h = height_\/2;\n  for (unsigned y = 0; y < height_; ++y) {\n    \/\/std::cout << y << \"\\n\";\n\n\n      float w = -width_\/2;\n    for (unsigned x = 0; x < width_; ++x) {\n        \/\/std::cout << \"x = \" << x << \"\\n\";\n      \/\/\n      \/\/ p.color = raytrace(ray, depth);\n      glm::vec3 origin{w\/(width_\/2),h\/(height_\/2),0.0};\n      std::cout <<\"origin vec \" << origin.x << \", \" << origin.y << \", \" << origin.z << \" \\n\";\n      Ray camray{origin, onedirection};\n      Pixel p(x,y);\n      Hit hitteter=kugel.intersect(camray);\n      if (hitteter.hit_ == true){\n        p.color = Color(1.0,1.0,1.0);\n      } else{\n        p.color = Color(0.0,0.0,0.0);\n      }\n      write(p);\n      ++w;\n    }\n    --h;\n  }\n  ppm_.save(scene_.filename);\n  std::cout << \"saved file in: \" << scene_.filename << \" amazing! \\n\";\n}\n\nvoid Renderer::write(Pixel const& p)\n{\n  \/\/ flip pixels, because of opengl glDrawPixels\n  size_t buf_pos = (scene_.xres_*p.y + p.x);\n  if (buf_pos >= colorbuffer_.size() || (int)buf_pos < 0) {\n    std::cerr << \"Fatal Error Renderer::write(Pixel p) : \"\n      << \"pixel out of ppm_ : \"\n      << (int)p.x << \",\" << (int)p.y\n      << std::endl;\n  } else {\n    colorbuffer_[buf_pos] = p.color;\n  }\n  \/\/std::cout << scene_.xres_ << \" \" << scene_.yres_ << \"\\n\";\n  ppm_.write(p);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"server\/http\/reply.hpp\"\n\n#include <string>\n\nnamespace osrm\n{\nnamespace server\n{\nnamespace http\n{\n\nconst char ok_html[] = \"\";\nconst char bad_request_html[] = \"{\\\"status\\\": 400,\\\"status_message\\\":\\\"Bad Request\\\"}\";\nconst char internal_server_error_html[] =\n    \"{\\\"status\\\": 500,\\\"status_message\\\":\\\"Internal Server Error\\\"}\";\nconst char seperators[] = {':', ' '};\nconst char crlf[] = {'\\r', '\\n'};\nconst std::string http_ok_string = \"HTTP\/1.0 200 OK\\r\\n\";\nconst std::string http_bad_request_string = \"HTTP\/1.0 400 Bad Request\\r\\n\";\nconst std::string http_internal_server_error_string = \"HTTP\/1.0 500 Internal Server Error\\r\\n\";\n\nvoid reply::set_size(const std::size_t size)\n{\n    for (header &h : headers)\n    {\n        if (\"Content-Length\" == h.name)\n        {\n            h.value = std::to_string(size);\n        }\n    }\n}\n\nvoid reply::set_uncompressed_size() { set_size(content.size()); }\n\nstd::vector<boost::asio::const_buffer> reply::to_buffers()\n{\n    std::vector<boost::asio::const_buffer> buffers;\n    buffers.push_back(status_to_buffer(status));\n    for (const header &h : headers)\n    {\n        buffers.push_back(boost::asio::buffer(h.name));\n        buffers.push_back(boost::asio::buffer(seperators));\n        buffers.push_back(boost::asio::buffer(h.value));\n        buffers.push_back(boost::asio::buffer(crlf));\n    }\n    buffers.push_back(boost::asio::buffer(crlf));\n    buffers.push_back(boost::asio::buffer(content));\n    return buffers;\n}\n\nstd::vector<boost::asio::const_buffer> reply::headers_to_buffers()\n{\n    std::vector<boost::asio::const_buffer> buffers;\n    buffers.push_back(status_to_buffer(status));\n    for (const header &current_header : headers)\n    {\n        buffers.push_back(boost::asio::buffer(current_header.name));\n        buffers.push_back(boost::asio::buffer(seperators));\n        buffers.push_back(boost::asio::buffer(current_header.value));\n        buffers.push_back(boost::asio::buffer(crlf));\n    }\n    buffers.push_back(boost::asio::buffer(crlf));\n    return buffers;\n}\n\nreply reply::stock_reply(const reply::status_type status)\n{\n    reply reply;\n    reply.status = status;\n    reply.content.clear();\n\n    const std::string status_string = reply.status_to_string(status);\n    reply.content.insert(reply.content.end(), status_string.begin(), status_string.end());\n    reply.headers.emplace_back(\"Access-Control-Allow-Origin\", \"*\");\n    reply.headers.emplace_back(\"Content-Length\", std::to_string(reply.content.size()));\n    reply.headers.emplace_back(\"Content-Type\", \"text\/html\");\n    return reply;\n}\n\nstd::string reply::status_to_string(const reply::status_type status)\n{\n    if (reply::ok == status)\n    {\n        return ok_html;\n    }\n    if (reply::bad_request == status)\n    {\n        return bad_request_html;\n    }\n    return internal_server_error_html;\n}\n\nboost::asio::const_buffer reply::status_to_buffer(const reply::status_type status)\n{\n    if (reply::ok == status)\n    {\n        return boost::asio::buffer(http_ok_string);\n    }\n    if (reply::internal_server_error == status)\n    {\n        return boost::asio::buffer(http_internal_server_error_string);\n    }\n    return boost::asio::buffer(http_bad_request_string);\n}\n\nreply::reply() : status(ok) {}\n}\n}\n}\n<commit_msg>Send the Connection: close response header<commit_after>#include \"server\/http\/reply.hpp\"\n\n#include <string>\n\nnamespace osrm\n{\nnamespace server\n{\nnamespace http\n{\n\nconst char ok_html[] = \"\";\nconst char bad_request_html[] = \"{\\\"status\\\": 400,\\\"status_message\\\":\\\"Bad Request\\\"}\";\nconst char internal_server_error_html[] =\n    \"{\\\"status\\\": 500,\\\"status_message\\\":\\\"Internal Server Error\\\"}\";\nconst char seperators[] = {':', ' '};\nconst char crlf[] = {'\\r', '\\n'};\nconst std::string http_ok_string = \"HTTP\/1.0 200 OK\\r\\n\";\nconst std::string http_bad_request_string = \"HTTP\/1.0 400 Bad Request\\r\\n\";\nconst std::string http_internal_server_error_string = \"HTTP\/1.0 500 Internal Server Error\\r\\n\";\n\nvoid reply::set_size(const std::size_t size)\n{\n    for (header &h : headers)\n    {\n        if (\"Content-Length\" == h.name)\n        {\n            h.value = std::to_string(size);\n        }\n    }\n}\n\nvoid reply::set_uncompressed_size() { set_size(content.size()); }\n\nstd::vector<boost::asio::const_buffer> reply::to_buffers()\n{\n    std::vector<boost::asio::const_buffer> buffers;\n    buffers.push_back(status_to_buffer(status));\n    for (const header &h : headers)\n    {\n        buffers.push_back(boost::asio::buffer(h.name));\n        buffers.push_back(boost::asio::buffer(seperators));\n        buffers.push_back(boost::asio::buffer(h.value));\n        buffers.push_back(boost::asio::buffer(crlf));\n    }\n    buffers.push_back(boost::asio::buffer(crlf));\n    buffers.push_back(boost::asio::buffer(content));\n    return buffers;\n}\n\nstd::vector<boost::asio::const_buffer> reply::headers_to_buffers()\n{\n    std::vector<boost::asio::const_buffer> buffers;\n    buffers.push_back(status_to_buffer(status));\n    for (const header &current_header : headers)\n    {\n        buffers.push_back(boost::asio::buffer(current_header.name));\n        buffers.push_back(boost::asio::buffer(seperators));\n        buffers.push_back(boost::asio::buffer(current_header.value));\n        buffers.push_back(boost::asio::buffer(crlf));\n    }\n    buffers.push_back(boost::asio::buffer(crlf));\n    return buffers;\n}\n\nreply reply::stock_reply(const reply::status_type status)\n{\n    reply reply;\n    reply.status = status;\n    reply.content.clear();\n\n    const std::string status_string = reply.status_to_string(status);\n    reply.content.insert(reply.content.end(), status_string.begin(), status_string.end());\n    reply.headers.emplace_back(\"Access-Control-Allow-Origin\", \"*\");\n    reply.headers.emplace_back(\"Content-Length\", std::to_string(reply.content.size()));\n    reply.headers.emplace_back(\"Content-Type\", \"text\/html\");\n    return reply;\n}\n\nstd::string reply::status_to_string(const reply::status_type status)\n{\n    if (reply::ok == status)\n    {\n        return ok_html;\n    }\n    if (reply::bad_request == status)\n    {\n        return bad_request_html;\n    }\n    return internal_server_error_html;\n}\n\nboost::asio::const_buffer reply::status_to_buffer(const reply::status_type status)\n{\n    if (reply::ok == status)\n    {\n        return boost::asio::buffer(http_ok_string);\n    }\n    if (reply::internal_server_error == status)\n    {\n        return boost::asio::buffer(http_internal_server_error_string);\n    }\n    return boost::asio::buffer(http_bad_request_string);\n}\n\nreply::reply() : status(ok)\n{\n    \/\/ We do not currently support keep alive. Always set 'Connection: close'.\n    headers.emplace_back(\"Connection\", \"close\");\n}\n}\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkChartParallelCoordinates.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 \"vtkChartParallelCoordinates.h\"\n\n#include \"vtkContext2D.h\"\n#include \"vtkBrush.h\"\n#include \"vtkPen.h\"\n#include \"vtkContextScene.h\"\n#include \"vtkTextProperty.h\"\n#include \"vtkAxis.h\"\n#include \"vtkPlotParallelCoordinates.h\"\n#include \"vtkContextMapper2D.h\"\n#include \"vtkSmartPointer.h\"\n#include \"vtkTable.h\"\n#include \"vtkDataArray.h\"\n#include \"vtkIdTypeArray.h\"\n#include \"vtkTransform2D.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkCommand.h\"\n#include \"vtkAnnotationLink.h\"\n#include \"vtkSelection.h\"\n#include \"vtkSelectionNode.h\"\n\n#include \"vtkstd\/vector\"\n#include \"vtkstd\/algorithm\"\n\n\/\/ Minimal storage class for STL containers etc.\nclass vtkChartParallelCoordinates::Private\n{\npublic:\n  Private()\n    {\n    this->Plot = vtkSmartPointer<vtkPlotParallelCoordinates>::New();\n    this->Transform = vtkSmartPointer<vtkTransform2D>::New();\n    this->CurrentAxis = -1;\n    }\n  ~Private()\n    {\n    for (vtkstd::vector<vtkAxis *>::iterator it = this->Axes.begin();\n         it != this->Axes.end(); ++it)\n      {\n      (*it)->Delete();\n      }\n    }\n  vtkSmartPointer<vtkPlotParallelCoordinates> Plot;\n  vtkSmartPointer<vtkTransform2D> Transform;\n  vtkstd::vector<vtkAxis *> Axes;\n  vtkstd::vector<vtkRectf> AxesSelections;\n  int CurrentAxis;\n};\n\n\/\/-----------------------------------------------------------------------------\n\n\/\/-----------------------------------------------------------------------------\nvtkStandardNewMacro(vtkChartParallelCoordinates);\n\n\/\/-----------------------------------------------------------------------------\nvtkChartParallelCoordinates::vtkChartParallelCoordinates()\n{\n  this->Storage = new vtkChartParallelCoordinates::Private;\n  this->Storage->Plot->SetParent(this);\n  this->GeometryValid = false;\n  this->Selection = vtkIdTypeArray::New();\n  this->Storage->Plot->SetSelection(this->Selection);\n}\n\n\/\/-----------------------------------------------------------------------------\nvtkChartParallelCoordinates::~vtkChartParallelCoordinates()\n{\n  this->Storage->Plot->SetSelection(NULL);\n  delete this->Storage;\n  this->Selection->Delete();\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartParallelCoordinates::Update()\n{\n  vtkTable* table = this->Storage->Plot->GetData()->GetInput();\n  if (!table)\n    {\n    return;\n    }\n\n  if (table->GetMTime() < this->BuildTime)\n  {\n    return;\n  }\n\n  \/\/ Now we have a table, set up the axes accordingly, clear and build.\n  if (static_cast<int>(this->Storage->Axes.size()) != table->GetNumberOfColumns())\n    {\n    for (vtkstd::vector<vtkAxis *>::iterator it = this->Storage->Axes.begin();\n         it != this->Storage->Axes.end(); ++it)\n      {\n      (*it)->Delete();\n      }\n    this->Storage->Axes.clear();\n\n    for (int i = 0; i < table->GetNumberOfColumns(); ++i)\n      {\n      vtkAxis* axis = vtkAxis::New();\n      axis->SetPosition(vtkAxis::PARALLEL);\n      this->Storage->Axes.push_back(axis);\n      }\n    }\n\n  \/\/ Now set up their ranges and locations\n  for (int i = 0; i < table->GetNumberOfColumns(); ++i)\n    {\n    double range[2];\n    vtkDataArray* array = vtkDataArray::SafeDownCast(table->GetColumn(i));\n    if (array)\n      {\n      array->GetRange(range);\n      }\n    vtkAxis* axis = this->Storage->Axes[i];\n    axis->SetMinimum(range[0]);\n    axis->SetMaximum(range[1]);\n    axis->SetTitle(table->GetColumnName(i));\n    }\n  this->Storage->AxesSelections.clear();\n\n  this->Storage->AxesSelections.resize(this->Storage->Axes.size());\n  this->GeometryValid = false;\n  this->BuildTime.Modified();\n}\n\n\/\/-----------------------------------------------------------------------------\nbool vtkChartParallelCoordinates::Paint(vtkContext2D *painter)\n{\n  if (this->GetScene()->GetViewWidth() == 0 ||\n      this->GetScene()->GetViewHeight() == 0 ||\n      !this->Visible || !this->Storage->Plot->GetVisible())\n    {\n    \/\/ The geometry of the chart must be valid before anything can be drawn\n    return false;\n    }\n\n  this->Update();\n  this->UpdateGeometry();\n\n  \/\/ Handle selections\n  vtkIdTypeArray *idArray = 0;\n  if (this->AnnotationLink)\n    {\n    vtkSelection *selection = this->AnnotationLink->GetCurrentSelection();\n    if (selection->GetNumberOfNodes() &&\n        this->AnnotationLink->GetMTime() > this->Storage->Plot->GetMTime())\n      {\n      vtkSelectionNode *node = selection->GetNode(0);\n      idArray = vtkIdTypeArray::SafeDownCast(node->GetSelectionList());\n      this->Storage->Plot->SetSelection(idArray);\n      }\n    }\n  else\n    {\n    vtkDebugMacro(\"No annotation link set.\");\n    }\n\n  painter->PushMatrix();\n  painter->SetTransform(this->Storage->Transform);\n  this->Storage->Plot->Paint(painter);\n  painter->PopMatrix();\n\n  \/\/ Now we have a table, set up the axes accordingly, clear and build.\n  for (vtkstd::vector<vtkAxis *>::iterator it = this->Storage->Axes.begin();\n       it != this->Storage->Axes.end(); ++it)\n    {\n    (*it)->Paint(painter);\n    }\n\n  \/\/ If there is a selected axis, draw the highlight\n  if (this->Storage->CurrentAxis >= 0)\n    {\n    painter->GetBrush()->SetColor(200, 200, 200, 200);\n    vtkAxis* axis = this->Storage->Axes[this->Storage->CurrentAxis];\n    painter->DrawRect(axis->GetPoint1()[0]-10, this->Point1[1],\n                      20, this->Point2[1]-this->Point1[1]);\n    }\n\n  \/\/ Now draw our active selections\n  for (size_t i = 0; i < this->Storage->AxesSelections.size(); ++i)\n    {\n    vtkRectf &rect = this->Storage->AxesSelections[i];\n    if (rect.Height() != 0.0f)\n      {\n      painter->GetBrush()->SetColor(200, 20, 20, 220);\n      painter->DrawRect(rect.X(), rect.Y(), rect.Width(), rect.Height());\n      }\n    }\n\n  return true;\n}\n\n\/\/-----------------------------------------------------------------------------\nvtkPlot * vtkChartParallelCoordinates::AddPlot(int)\n{\n  return NULL;\n}\n\n\/\/-----------------------------------------------------------------------------\nbool vtkChartParallelCoordinates::RemovePlot(vtkIdType)\n{\n  return false;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartParallelCoordinates::ClearPlots()\n{\n}\n\n\/\/-----------------------------------------------------------------------------\nvtkPlot* vtkChartParallelCoordinates::GetPlot(vtkIdType)\n{\n  return this->Storage->Plot;\n}\n\n\/\/-----------------------------------------------------------------------------\nvtkIdType vtkChartParallelCoordinates::GetNumberOfPlots()\n{\n  return 1;\n}\n\n\/\/-----------------------------------------------------------------------------\nvtkAxis* vtkChartParallelCoordinates::GetAxis(int index)\n{\n  if (index < this->GetNumberOfAxes())\n    {\n    return this->Storage->Axes[index];\n    }\n  else\n    {\n    return NULL;\n    }\n}\n\n\/\/-----------------------------------------------------------------------------\nvtkIdType vtkChartParallelCoordinates::GetNumberOfAxes()\n{\n  return this->Storage->Axes.size();\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartParallelCoordinates::UpdateGeometry()\n{\n  int geometry[] = { this->GetScene()->GetViewWidth(),\n                     this->GetScene()->GetViewHeight() };\n\n  if (geometry[0] != this->Geometry[0] || geometry[1] != this->Geometry[1] ||\n      !this->GeometryValid)\n    {\n    \/\/ Take up the entire window right now, this could be made configurable\n    this->SetGeometry(geometry);\n    this->SetBorders(60, 20, 20, 50);\n\n    \/\/ Iterate through the axes and set them up to span the chart area.\n    int xStep = (this->Point2[0] - this->Point1[0]) \/\n                (static_cast<int>(this->Storage->Axes.size())-1);\n    int x =  this->Point1[0];\n\n    for (size_t i = 0; i < this->Storage->Axes.size(); ++i)\n      {\n      vtkAxis* axis = this->Storage->Axes[i];\n      axis->SetPoint1(x, this->Point1[1]);\n      axis->SetPoint2(x, this->Point2[1]);\n      axis->AutoScale();\n      axis->Update();\n      x += xStep;\n      }\n\n    this->GeometryValid = true;\n    \/\/ Cause the plot transform to be recalculated if necessary\n    this->CalculatePlotTransform();\n    this->Storage->Plot->Update();\n    }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartParallelCoordinates::CalculatePlotTransform()\n{\n  \/\/ In the case of parallel coordinates everything is plotted in a normalized\n  \/\/ system, where the range is from 0.0 to 1.0 in the y axis, and in screen\n  \/\/ coordinates along the x axis.\n  if (!this->Storage->Axes.size())\n    {\n    return;\n    }\n\n  vtkAxis* axis = this->Storage->Axes[0];\n  float *min = axis->GetPoint1();\n  float *max = axis->GetPoint2();\n  float yScale = 1.0f \/ (max[1] - min[1]);\n\n  this->Storage->Transform->Identity();\n  this->Storage->Transform->Translate(0, axis->GetPoint1()[1]);\n  \/\/ Get the scale for the plot area from the x and y axes\n  this->Storage->Transform->Scale(1.0, 1.0 \/ yScale);\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartParallelCoordinates::RecalculateBounds()\n{\n  return;\n}\n\n\/\/-----------------------------------------------------------------------------\nbool vtkChartParallelCoordinates::Hit(const vtkContextMouseEvent &mouse)\n{\n  if (mouse.ScreenPos[0] > this->Point1[0]-10 &&\n      mouse.ScreenPos[0] < this->Point2[0]+10 &&\n      mouse.ScreenPos[1] > this->Point1[1] &&\n      mouse.ScreenPos[1] < this->Point2[1])\n    {\n    return true;\n    }\n  else\n    {\n    return false;\n    }\n}\n\n\/\/-----------------------------------------------------------------------------\nbool vtkChartParallelCoordinates::MouseEnterEvent(const vtkContextMouseEvent &)\n{\n  return true;\n}\n\n\/\/-----------------------------------------------------------------------------\nbool vtkChartParallelCoordinates::MouseMoveEvent(const vtkContextMouseEvent &mouse)\n{\n  if (mouse.Button == 0)\n    {\n    \/\/ If an axis is selected, then lets try to narrow down a selection...\n    if (this->Storage->CurrentAxis >= 0)\n      {\n      vtkAxis* axis = this->Storage->Axes[this->Storage->CurrentAxis];\n      vtkRectf &rect = this->Storage->AxesSelections[this->Storage->CurrentAxis];\n      if (mouse.ScenePos[1] > axis->GetPoint2()[1])\n        {\n        rect.SetHeight(axis->GetPoint2()[1] - rect.Y());\n        }\n      else if (mouse.ScenePos[1] < axis->GetPoint1()[1])\n        {\n        rect.SetHeight(axis->GetPoint1()[1] - rect.Y());\n        }\n      else\n        {\n        rect.SetHeight(mouse.ScenePos[1] - rect.Y());\n        }\n      }\n    this->Scene->SetDirty(true);\n\n    }\n  else if (mouse.Button == 2)\n    {\n    }\n  else if (mouse.Button < 0)\n    {\n\n    }\n\n  return true;\n}\n\n\/\/-----------------------------------------------------------------------------\nbool vtkChartParallelCoordinates::MouseLeaveEvent(const vtkContextMouseEvent &)\n{\n  return true;\n}\n\n\/\/-----------------------------------------------------------------------------\nbool vtkChartParallelCoordinates::MouseButtonPressEvent(const vtkContextMouseEvent\n                                                        &mouse)\n{\n  if (mouse.Button == 0)\n    {\n    \/\/ Select an axis if we are within range\n    if (mouse.ScenePos[1] > this->Point1[1] &&\n        mouse.ScenePos[1] < this->Point2[1])\n      {\n      \/\/ Iterate over the axes, see if we are within 10 pixels of an axis\n      for (size_t i = 0; i < this->Storage->Axes.size(); ++i)\n        {\n        vtkAxis* axis = this->Storage->Axes[i];\n        if (axis->GetPoint1()[0]-10 < mouse.ScenePos[0] &&\n            axis->GetPoint1()[0]+10 > mouse.ScenePos[0])\n          {\n          this->Storage->CurrentAxis = static_cast<int>(i);\n          this->Scene->SetDirty(true);\n          this->Storage->AxesSelections[i].Set(axis->GetPoint1()[0]-5,\n                                               mouse.ScenePos[1],\n                                               10, 0);\n          return true;\n          }\n        }\n      }\n      this->Storage->CurrentAxis = -1;\n      this->Scene->SetDirty(true);\n      return false;\n    return true;\n    }\n  else if (mouse.Button == 2)\n    {\n    \/\/ Right mouse button - zoom box\n\n    return true;\n    }\n  else\n    {\n    return false;\n    }\n}\n\n\/\/-----------------------------------------------------------------------------\nbool vtkChartParallelCoordinates::MouseButtonReleaseEvent(const vtkContextMouseEvent\n                                                          &mouse)\n{\n  if (mouse.Button == 0)\n    {\n    if (this->Storage->CurrentAxis >= 0)\n      {\n      vtkAxis* axis = this->Storage->Axes[this->Storage->CurrentAxis];\n      vtkRectf &rect = this->Storage->AxesSelections[this->Storage->CurrentAxis];\n\n      \/\/ Set the final mouse position\n      if (mouse.ScenePos[1] > axis->GetPoint2()[1])\n        {\n        rect.SetHeight(axis->GetPoint2()[1] - rect.Y());\n        }\n      else if (mouse.ScenePos[1] < axis->GetPoint1()[1])\n        {\n        rect.SetHeight(axis->GetPoint1()[1] - rect.Y());\n        }\n      else\n        {\n        rect.SetHeight(mouse.ScenePos[1] - rect.Y());\n        }\n\n      if (rect.Height() == 0.0f)\n        {\n        \/\/ Reset the axes.\n        this->Storage->Plot->ResetSelectionRange();\n\n        \/\/ Now set the remaining selections that were kept\n        float low = 0.0;\n        float high = 0.0;\n        for (size_t i = 0; i < this->Storage->AxesSelections.size(); ++i)\n          {\n          vtkRectf &rect2 = this->Storage->AxesSelections[i];\n          if (rect2.Height() != 0.0f)\n            {\n            if (rect2.Height() > 0.0f)\n              {\n              low = rect2.Y();\n              high = rect2.Y() + rect2.Height();\n              }\n            else\n              {\n              low = rect2.Y() + rect2.Height();\n              high = rect2.Y();\n              }\n            low -= this->Storage->Transform->GetMatrix()->GetElement(1, 2);\n            low \/= this->Storage->Transform->GetMatrix()->GetElement(1, 1);\n            high -= this->Storage->Transform->GetMatrix()->GetElement(1, 2);\n            high \/= this->Storage->Transform->GetMatrix()->GetElement(1, 1);\n\n            \/\/ Process the selected range and display this\n            this->Storage->Plot->SetSelectionRange(static_cast<int>(i),\n                                                   low, high);\n            }\n          }\n        }\n      else\n        {\n        float low = 0.0;\n        float high = 0.0;\n        if (rect.Height() > 0.0f)\n          {\n          low = rect.Y();\n          high = rect.Y() + rect.Height();\n          }\n        else\n          {\n          low = rect.Y() + rect.Height();\n          high = rect.Y();\n          }\n        low -= this->Storage->Transform->GetMatrix()->GetElement(1, 2);\n        low \/= this->Storage->Transform->GetMatrix()->GetElement(1, 1);\n        high -= this->Storage->Transform->GetMatrix()->GetElement(1, 2);\n        high \/= this->Storage->Transform->GetMatrix()->GetElement(1, 1);\n        \/\/ Process the selected range and display this\n        this->Storage->Plot->SetSelectionRange(this->Storage->CurrentAxis,\n                                               low, high);\n        }\n\n      this->Scene->SetDirty(true);\n      }\n    if (this->AnnotationLink)\n      {\n      vtkSelection* selection = vtkSelection::New();\n      vtkSelectionNode* node = vtkSelectionNode::New();\n      selection->AddNode(node);\n      node->SetSelectionList(this->Storage->Plot->GetSelection());\n      this->AnnotationLink->SetCurrentSelection(selection);\n      selection->Delete();\n      node->Delete();\n      }\n    this->InvokeEvent(vtkCommand::SelectionChangedEvent);\n    }\n  return false;\n}\n\n\/\/-----------------------------------------------------------------------------\nbool vtkChartParallelCoordinates::MouseWheelEvent(const vtkContextMouseEvent &,\n                                                  int)\n{\n  return true;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartParallelCoordinates::PrintSelf(ostream &os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os, indent);\n}\n<commit_msg>BUG: Tightly couple the selections to the axes.<commit_after>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkChartParallelCoordinates.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 \"vtkChartParallelCoordinates.h\"\n\n#include \"vtkContext2D.h\"\n#include \"vtkBrush.h\"\n#include \"vtkPen.h\"\n#include \"vtkContextScene.h\"\n#include \"vtkTextProperty.h\"\n#include \"vtkAxis.h\"\n#include \"vtkPlotParallelCoordinates.h\"\n#include \"vtkContextMapper2D.h\"\n#include \"vtkSmartPointer.h\"\n#include \"vtkTable.h\"\n#include \"vtkDataArray.h\"\n#include \"vtkIdTypeArray.h\"\n#include \"vtkTransform2D.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkCommand.h\"\n#include \"vtkAnnotationLink.h\"\n#include \"vtkSelection.h\"\n#include \"vtkSelectionNode.h\"\n\n#include \"vtkstd\/vector\"\n#include \"vtkstd\/algorithm\"\n\n\/\/ Minimal storage class for STL containers etc.\nclass vtkChartParallelCoordinates::Private\n{\npublic:\n  Private()\n    {\n    this->Plot = vtkSmartPointer<vtkPlotParallelCoordinates>::New();\n    this->Transform = vtkSmartPointer<vtkTransform2D>::New();\n    this->CurrentAxis = -1;\n    }\n  ~Private()\n    {\n    for (vtkstd::vector<vtkAxis *>::iterator it = this->Axes.begin();\n         it != this->Axes.end(); ++it)\n      {\n      (*it)->Delete();\n      }\n    }\n  vtkSmartPointer<vtkPlotParallelCoordinates> Plot;\n  vtkSmartPointer<vtkTransform2D> Transform;\n  vtkstd::vector<vtkAxis *> Axes;\n  vtkstd::vector<vtkVector<float, 2> > AxesSelections;\n  int CurrentAxis;\n};\n\n\/\/-----------------------------------------------------------------------------\n\n\/\/-----------------------------------------------------------------------------\nvtkStandardNewMacro(vtkChartParallelCoordinates);\n\n\/\/-----------------------------------------------------------------------------\nvtkChartParallelCoordinates::vtkChartParallelCoordinates()\n{\n  this->Storage = new vtkChartParallelCoordinates::Private;\n  this->Storage->Plot->SetParent(this);\n  this->GeometryValid = false;\n  this->Selection = vtkIdTypeArray::New();\n  this->Storage->Plot->SetSelection(this->Selection);\n}\n\n\/\/-----------------------------------------------------------------------------\nvtkChartParallelCoordinates::~vtkChartParallelCoordinates()\n{\n  this->Storage->Plot->SetSelection(NULL);\n  delete this->Storage;\n  this->Selection->Delete();\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartParallelCoordinates::Update()\n{\n  vtkTable* table = this->Storage->Plot->GetData()->GetInput();\n  if (!table)\n    {\n    return;\n    }\n\n  if (table->GetMTime() < this->BuildTime)\n  {\n    return;\n  }\n\n  \/\/ Now we have a table, set up the axes accordingly, clear and build.\n  if (static_cast<int>(this->Storage->Axes.size()) != table->GetNumberOfColumns())\n    {\n    for (vtkstd::vector<vtkAxis *>::iterator it = this->Storage->Axes.begin();\n         it != this->Storage->Axes.end(); ++it)\n      {\n      (*it)->Delete();\n      }\n    this->Storage->Axes.clear();\n\n    for (int i = 0; i < table->GetNumberOfColumns(); ++i)\n      {\n      vtkAxis* axis = vtkAxis::New();\n      axis->SetPosition(vtkAxis::PARALLEL);\n      this->Storage->Axes.push_back(axis);\n      }\n    }\n\n  \/\/ Now set up their ranges and locations\n  for (int i = 0; i < table->GetNumberOfColumns(); ++i)\n    {\n    double range[2];\n    vtkDataArray* array = vtkDataArray::SafeDownCast(table->GetColumn(i));\n    if (array)\n      {\n      array->GetRange(range);\n      }\n    vtkAxis* axis = this->Storage->Axes[i];\n    axis->SetMinimum(range[0]);\n    axis->SetMaximum(range[1]);\n    axis->SetTitle(table->GetColumnName(i));\n    }\n  this->Storage->AxesSelections.clear();\n\n  this->Storage->AxesSelections.resize(this->Storage->Axes.size());\n  this->GeometryValid = false;\n  this->BuildTime.Modified();\n}\n\n\/\/-----------------------------------------------------------------------------\nbool vtkChartParallelCoordinates::Paint(vtkContext2D *painter)\n{\n  if (this->GetScene()->GetViewWidth() == 0 ||\n      this->GetScene()->GetViewHeight() == 0 ||\n      !this->Visible || !this->Storage->Plot->GetVisible())\n    {\n    \/\/ The geometry of the chart must be valid before anything can be drawn\n    return false;\n    }\n\n  this->Update();\n  this->UpdateGeometry();\n\n  \/\/ Handle selections\n  vtkIdTypeArray *idArray = 0;\n  if (this->AnnotationLink)\n    {\n    vtkSelection *selection = this->AnnotationLink->GetCurrentSelection();\n    if (selection->GetNumberOfNodes() &&\n        this->AnnotationLink->GetMTime() > this->Storage->Plot->GetMTime())\n      {\n      vtkSelectionNode *node = selection->GetNode(0);\n      idArray = vtkIdTypeArray::SafeDownCast(node->GetSelectionList());\n      this->Storage->Plot->SetSelection(idArray);\n      }\n    }\n  else\n    {\n    vtkDebugMacro(\"No annotation link set.\");\n    }\n\n  painter->PushMatrix();\n  painter->SetTransform(this->Storage->Transform);\n  this->Storage->Plot->Paint(painter);\n  painter->PopMatrix();\n\n  \/\/ Now we have a table, set up the axes accordingly, clear and build.\n  for (vtkstd::vector<vtkAxis *>::iterator it = this->Storage->Axes.begin();\n       it != this->Storage->Axes.end(); ++it)\n    {\n    (*it)->Paint(painter);\n    }\n\n  \/\/ If there is a selected axis, draw the highlight\n  if (this->Storage->CurrentAxis >= 0)\n    {\n    painter->GetBrush()->SetColor(200, 200, 200, 200);\n    vtkAxis* axis = this->Storage->Axes[this->Storage->CurrentAxis];\n    painter->DrawRect(axis->GetPoint1()[0]-10, this->Point1[1],\n                      20, this->Point2[1]-this->Point1[1]);\n    }\n\n  \/\/ Now draw our active selections\n  for (size_t i = 0; i < this->Storage->AxesSelections.size(); ++i)\n    {\n    vtkVector<float, 2> &range = this->Storage->AxesSelections[i];\n    if (range[0] != range[1])\n      {\n      painter->GetBrush()->SetColor(200, 20, 20, 220);\n      float x = this->Storage->Axes[i]->GetPoint1()[0] - 5;\n      float y = range[0];\n      y *= this->Storage->Transform->GetMatrix()->GetElement(1, 1);\n      y += this->Storage->Transform->GetMatrix()->GetElement(1, 2);\n      float height = range[1] - range[0];\n      height *= this->Storage->Transform->GetMatrix()->GetElement(1, 1);\n\n      painter->DrawRect(x, y, 10, height);\n      }\n    }\n\n  return true;\n}\n\n\/\/-----------------------------------------------------------------------------\nvtkPlot * vtkChartParallelCoordinates::AddPlot(int)\n{\n  return NULL;\n}\n\n\/\/-----------------------------------------------------------------------------\nbool vtkChartParallelCoordinates::RemovePlot(vtkIdType)\n{\n  return false;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartParallelCoordinates::ClearPlots()\n{\n}\n\n\/\/-----------------------------------------------------------------------------\nvtkPlot* vtkChartParallelCoordinates::GetPlot(vtkIdType)\n{\n  return this->Storage->Plot;\n}\n\n\/\/-----------------------------------------------------------------------------\nvtkIdType vtkChartParallelCoordinates::GetNumberOfPlots()\n{\n  return 1;\n}\n\n\/\/-----------------------------------------------------------------------------\nvtkAxis* vtkChartParallelCoordinates::GetAxis(int index)\n{\n  if (index < this->GetNumberOfAxes())\n    {\n    return this->Storage->Axes[index];\n    }\n  else\n    {\n    return NULL;\n    }\n}\n\n\/\/-----------------------------------------------------------------------------\nvtkIdType vtkChartParallelCoordinates::GetNumberOfAxes()\n{\n  return this->Storage->Axes.size();\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartParallelCoordinates::UpdateGeometry()\n{\n  vtkVector2i geometry(this->GetScene()->GetViewWidth(),\n                       this->GetScene()->GetViewHeight());\n\n  if (geometry.X() != this->Geometry[0] || geometry.Y() != this->Geometry[1] ||\n      !this->GeometryValid)\n    {\n    \/\/ Take up the entire window right now, this could be made configurable\n    this->SetGeometry(geometry.GetData());\n    this->SetBorders(60, 20, 20, 50);\n\n    \/\/ Iterate through the axes and set them up to span the chart area.\n    int xStep = (this->Point2[0] - this->Point1[0]) \/\n                (static_cast<int>(this->Storage->Axes.size())-1);\n    int x =  this->Point1[0];\n\n    for (size_t i = 0; i < this->Storage->Axes.size(); ++i)\n      {\n      vtkAxis* axis = this->Storage->Axes[i];\n      axis->SetPoint1(x, this->Point1[1]);\n      axis->SetPoint2(x, this->Point2[1]);\n      axis->AutoScale();\n      axis->Update();\n      x += xStep;\n      }\n\n    this->GeometryValid = true;\n    \/\/ Cause the plot transform to be recalculated if necessary\n    this->CalculatePlotTransform();\n    this->Storage->Plot->Update();\n    }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartParallelCoordinates::CalculatePlotTransform()\n{\n  \/\/ In the case of parallel coordinates everything is plotted in a normalized\n  \/\/ system, where the range is from 0.0 to 1.0 in the y axis, and in screen\n  \/\/ coordinates along the x axis.\n  if (!this->Storage->Axes.size())\n    {\n    return;\n    }\n\n  vtkAxis* axis = this->Storage->Axes[0];\n  float *min = axis->GetPoint1();\n  float *max = axis->GetPoint2();\n  float yScale = 1.0f \/ (max[1] - min[1]);\n\n  this->Storage->Transform->Identity();\n  this->Storage->Transform->Translate(0, axis->GetPoint1()[1]);\n  \/\/ Get the scale for the plot area from the x and y axes\n  this->Storage->Transform->Scale(1.0, 1.0 \/ yScale);\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartParallelCoordinates::RecalculateBounds()\n{\n  return;\n}\n\n\/\/-----------------------------------------------------------------------------\nbool vtkChartParallelCoordinates::Hit(const vtkContextMouseEvent &mouse)\n{\n  if (mouse.ScreenPos[0] > this->Point1[0]-10 &&\n      mouse.ScreenPos[0] < this->Point2[0]+10 &&\n      mouse.ScreenPos[1] > this->Point1[1] &&\n      mouse.ScreenPos[1] < this->Point2[1])\n    {\n    return true;\n    }\n  else\n    {\n    return false;\n    }\n}\n\n\/\/-----------------------------------------------------------------------------\nbool vtkChartParallelCoordinates::MouseEnterEvent(const vtkContextMouseEvent &)\n{\n  return true;\n}\n\n\/\/-----------------------------------------------------------------------------\nbool vtkChartParallelCoordinates::MouseMoveEvent(const vtkContextMouseEvent &mouse)\n{\n  if (mouse.Button == vtkContextMouseEvent::LEFT_BUTTON)\n    {\n    \/\/ If an axis is selected, then lets try to narrow down a selection...\n    if (this->Storage->CurrentAxis >= 0)\n      {\n      vtkVector<float, 2> &range =\n          this->Storage->AxesSelections[this->Storage->CurrentAxis];\n\n      \/\/ Normalize the coordinates\n      float current = mouse.ScenePos.Y();\n      current -= this->Storage->Transform->GetMatrix()->GetElement(1, 2);\n      current \/= this->Storage->Transform->GetMatrix()->GetElement(1, 1);\n\n      if (current > 1.0f)\n        {\n        range[1] = 1.0f;\n        }\n      else if (current < 0.0f)\n        {\n        range[1] = 0.0f;\n        }\n      else\n        {\n        range[1] = current;\n        }\n      }\n    this->Scene->SetDirty(true);\n    }\n  else if (mouse.Button == 2)\n    {\n    }\n\n  return true;\n}\n\n\/\/-----------------------------------------------------------------------------\nbool vtkChartParallelCoordinates::MouseLeaveEvent(const vtkContextMouseEvent &)\n{\n  return true;\n}\n\n\/\/-----------------------------------------------------------------------------\nbool vtkChartParallelCoordinates::MouseButtonPressEvent(const vtkContextMouseEvent\n                                                        &mouse)\n{\n  if (mouse.Button == vtkContextMouseEvent::LEFT_BUTTON)\n    {\n    \/\/ Select an axis if we are within range\n    if (mouse.ScenePos[1] > this->Point1[1] &&\n        mouse.ScenePos[1] < this->Point2[1])\n      {\n      \/\/ Iterate over the axes, see if we are within 10 pixels of an axis\n      for (size_t i = 0; i < this->Storage->Axes.size(); ++i)\n        {\n        vtkAxis* axis = this->Storage->Axes[i];\n        if (axis->GetPoint1()[0]-10 < mouse.ScenePos[0] &&\n            axis->GetPoint1()[0]+10 > mouse.ScenePos[0])\n          {\n          this->Storage->CurrentAxis = static_cast<int>(i);\n          this->Scene->SetDirty(true);\n\n          \/\/ Transform into normalized coordinates\n          float low = mouse.ScenePos[1];\n          low -= this->Storage->Transform->GetMatrix()->GetElement(1, 2);\n          low \/= this->Storage->Transform->GetMatrix()->GetElement(1, 1);\n          this->Storage->AxesSelections[i][0] = low;\n          this->Storage->AxesSelections[i][1] = low;\n          return true;\n          }\n        }\n      }\n    this->Storage->CurrentAxis = -1;\n    this->Scene->SetDirty(true);\n    return true;\n    }\n  else if (mouse.Button == 2)\n    {\n    \/\/ Right mouse button - zoom box\n\n    return true;\n    }\n  else\n    {\n    return false;\n    }\n}\n\n\/\/-----------------------------------------------------------------------------\nbool vtkChartParallelCoordinates::MouseButtonReleaseEvent(const vtkContextMouseEvent\n                                                          &mouse)\n{\n  if (mouse.Button == vtkContextMouseEvent::LEFT_BUTTON)\n    {\n    if (this->Storage->CurrentAxis >= 0)\n      {\n      vtkVector<float, 2> &range =\n          this->Storage->AxesSelections[this->Storage->CurrentAxis];\n\n      float final = mouse.ScenePos[1];\n      final -= this->Storage->Transform->GetMatrix()->GetElement(1, 2);\n      final \/= this->Storage->Transform->GetMatrix()->GetElement(1, 1);\n\n      \/\/ Set the final mouse position\n      if (final > 1.0)\n        {\n        range[1] = 1.0;\n        }\n      else if (final < 0.0)\n        {\n        range[1] = 0.0;\n        }\n      else\n        {\n        range[1] = final;\n        }\n\n      if (range[0] == range[1])\n        {\n        \/\/ Reset the axes.\n        this->Storage->Plot->ResetSelectionRange();\n\n        \/\/ Now set the remaining selections that were kept\n        for (size_t i = 0; i < this->Storage->AxesSelections.size(); ++i)\n          {\n          vtkVector<float, 2> &range2 = this->Storage->AxesSelections[i];\n          if (range2[0] != range2[1])\n            {\n            \/\/ Process the selected range and display this\n            if (range[0] < range[1])\n              {\n              this->Storage->Plot->SetSelectionRange(static_cast<int>(i),\n                                                     range2[0], range2[1]);\n              }\n            else\n              {\n              this->Storage->Plot->SetSelectionRange(static_cast<int>(i),\n                                                     range2[1], range2[0]);\n              }\n            }\n          }\n        }\n      else\n        {\n        \/\/ Add a new selection\n        if (range[0] < range[1])\n          {\n          this->Storage->Plot->SetSelectionRange(this->Storage->CurrentAxis,\n                                                 range[0], range[1]);\n          }\n        else\n          {\n          this->Storage->Plot->SetSelectionRange(this->Storage->CurrentAxis,\n                                                 range[1], range[0]);\n          }\n        }\n\n      if (this->AnnotationLink)\n        {\n        vtkSelection* selection = vtkSelection::New();\n        vtkSelectionNode* node = vtkSelectionNode::New();\n        selection->AddNode(node);\n        node->SetSelectionList(this->Storage->Plot->GetSelection());\n        this->AnnotationLink->SetCurrentSelection(selection);\n        selection->Delete();\n        node->Delete();\n        }\n      this->InvokeEvent(vtkCommand::SelectionChangedEvent);\n      this->Scene->SetDirty(true);\n      }\n    }\n  return false;\n}\n\n\/\/-----------------------------------------------------------------------------\nbool vtkChartParallelCoordinates::MouseWheelEvent(const vtkContextMouseEvent &,\n                                                  int)\n{\n  return true;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkChartParallelCoordinates::PrintSelf(ostream &os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os, indent);\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#define _USE_MATH_DEFINES\n\n#include \"renderer.hpp\"\n#include \"SDFloader.hpp\"\n#include \"ray.hpp\"\n#include <cmath>\n#include <glm\/glm.hpp>\n\nusing namespace std;\n\nRenderer::Renderer(unsigned w, unsigned h)\n  : width_(w)\n  , height_(h)\n  , colorbuffer_(w*h, Color(0.0, 0.0, 0.0))\n  , scenefile_(\"scene.sdf\")\n  , ppm_(width_, height_)\n  ,finished_(false)\n{\n    scene_ = SDFLoader::load(scenefile_);\n}\n\nRenderer::Renderer(unsigned w, unsigned h, string const& scenefile)\n  : width_(w)\n  , height_(h)\n  , colorbuffer_(w*h, Color(0.0, 0.0, 0.0))\n  , scenefile_(scenefile)\n  , ppm_(width_, height_)\n  ,finished_(false)\n{\n   scene_ = SDFLoader::load(scenefile);\n}\n\nvoid Renderer::render() {\n    if (width_<scene_.resX){\n        cout << \"ERROR: Resolution X to big. Forcing: \"<<width_<<endl;\n        scene_.resX=width_;\n    }\n    if (height_<scene_.resY){\n        cout << \"ERROR: Resolution Y to big. Forcing: \"<<height_<<endl;\n        scene_.resY=height_;\n    }\n    if (scene_.renderObjects.find(\"root\")!= scene_.renderObjects.end()){\n        cout << \"#####RENDERING####\"<<endl;\n        cout << \"Resolution: \"<<scene_.resX<<\"x\"<<scene_.resY<<endl;\n        cout << \"Camera: \"<<scene_.camname<<endl;\n        cout << \"ambient light \"<<scene_.amb<<endl;\n\n        float d = -int(scene_.resX)\/tan(scene_.camera.GetFovX()*M_PI\/180); \/\/apply camera fov, little different angle for each pixel\n\n        for (unsigned yr = 0; yr < scene_.resY; ++yr) {\n            for (unsigned xr = 0; xr < scene_.resX; ++xr) {\n                unsigned x=xr;\n                unsigned y=yr;\n                \n                \/\/allow random pixel rendering\n                if (scene_.random){\n                    x=rand() % scene_.resX;\n                    y=rand() % scene_.resY;\n                    for (int i = 0; i < 100; i++) {\/\/try 100 times\n                        auto coloratp = colorbuffer_[(width_*y + x)];\n                        if (!(coloratp.r == 0 && coloratp.g==0 && coloratp.b==0)){\/\/again if already filled\n                            x=rand() % scene_.resX;\n                            y=rand() % scene_.resY;\n                        }else break;\n                    }\n                }\n                \n                Pixel p(x,y);\n\n               \n                \/\/Ray ray(glm::vec3(scene_.camera.GetTransformation() * glm::vec4(0,0,0,1)));\n                Ray ray;\n                ray.direction.x = -int(scene_.resX)\/2.0f+x; \n                ray.direction.y = -int(scene_.resY)\/2.0f+y;\n                ray.direction.z = d;\n                \n                \/\/apply camera transformations\n                ray.origin = glm::vec3(scene_.camera.GetTransformation_inv() * glm::vec4(ray.origin, 1));\n                ray.direction = glm::vec3(scene_.camera.GetTransformation_inv() * glm::vec4(ray.direction, 0));\n                        \n                if (scene_.antialiase>0){\/\/SSAA\n                    int samples = sqrt(scene_.antialiase);\n                    for (int xAA=1;xAA<samples+1;++xAA){\n                        for (int yAA=1;yAA<samples+1;++yAA){\n                            Ray aaRay;\n                            aaRay.direction.x = ray.direction.x +(float) (xAA)\/(float)samples-0.5f; \n                            aaRay.direction.y = ray.direction.y +(float) (yAA)\/(float)samples-0.5f;\n                            aaRay.direction.z = d;\n                            p.color +=getColor(aaRay);\n                        }\n                    }\n                }\n\n\n                \/\/cout << \"Ray@(\"<<x<<\"x\"<<y<<\"): \"<<ray<<endl;\n                if (scene_.antialiase>0)\n                    p.color \/=scene_.antialiase;\n                else\n                    p.color +=getColor(ray);\n                write(p);\n            }\n        }\n        ppm_.save(scene_.outputFile);\n        finished_ = true;\n    } else {\n        cout << \"no root found!\"<<endl;\n    }\n}\n\nColor Renderer::getColor(Ray const& ray) {\n    Color clr;\n    \n    auto intersection( scene_.renderObjects[\"root\"]->intersect(ray) );\n\n    if (intersection.hit){\/\/if intersection happened\n        clr +=scene_.amb*intersection.material.getKa();\/\/ambient light\n        \n        \/\/starting from the intersection go to every light source\n        for(auto lightIt = scene_.lights.begin(); lightIt != scene_.lights.end(); lightIt++) {\n            auto light = lightIt->second;\n            \/\/a ray pointing to the current light source\n            auto lightRay = Ray(\n                intersection.ray.origin,    \/\/start at intersection point\n                glm::normalize(light.GetPos()-intersection.ray.origin)\/\/l=IL =L-I \n            );\n            lightRay.maxt = glm::length(light.GetPos()-lightRay.origin);\n            \n            \/\/shaddow\n            auto lighintersect = scene_.renderObjects[\"root\"]->intersect(lightRay);\n            if (!(lighintersect.hit)){\/\/check if intersec between p and light source\n                \/\/diffuse light\n                double fDiffuse = glm::dot(lightRay.direction, intersection.ray.direction);\/\/l*n\n                fDiffuse = fDiffuse < 0 ? 0 : fDiffuse;\/\/allow no negative diffuse light\n\n                clr +=  light.GetDiff()\/\/get light color\n                        * intersection.material.getKd()\/\/multiply by material, (l_p * k_d)\n                        * fDiffuse\n                        * intersection.material.getOpacity();\n                \n                \n                auto r = glm::normalize(\n                            glm::reflect(\n                                lightRay.direction,\n                                intersection.ray.direction\n                            )\n                        );\n                Color spec = light.GetDiff()\n                       * intersection.material.getKs()\n                       * glm::pow(\n                            glm::dot(r, glm::normalize(ray.direction)),\n                            intersection.material.getM()\n                        );\/\/(l*r)^m\n                if (spec.r<0) spec.r=0;\n                if (spec.g<0) spec.g=0;\n                if (spec.b<0) spec.b=0;\n                clr +=spec*intersection.material.getOpacity(); \n                \n                \/\/refraction\n                if (intersection.material.getOpacity()<1.0f){\n                    auto refrdir = glm::refract(ray.direction, intersection.ray.direction, intersection.material.getRefraction());\n                    clr += getColor(\n                            Ray(\n                                intersection.ray.origin,    \/\/start at intersection point\n                                refrdir\n                            )\n                        )*(1.0f-intersection.material.getOpacity());\n                }\n\n            }\n        }\n    }\n    return clr;\n}\n\nvoid Renderer::write(Pixel const& p) {\n  \/\/ flip pixels, because of opengl glDrawPixels\n  size_t buf_pos = (width_*p.y + p.x);\n  if (buf_pos >= colorbuffer_.size() || (int)buf_pos < 0) {\n    cerr << \"Fatal Error Renderer::write(Pixel p) : \"\n      << \"pixel out of ppm_ : \"\n      << (int)p.x << \",\" << (int)p.y\n      << endl;\n  } else {\n    colorbuffer_[buf_pos] = p.color;\n  }\n\n  ppm_.write(p);\n}\n<commit_msg>refraction also in shadow<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#define _USE_MATH_DEFINES\n\n#include \"renderer.hpp\"\n#include \"SDFloader.hpp\"\n#include \"ray.hpp\"\n#include <cmath>\n#include <glm\/glm.hpp>\n\nusing namespace std;\n\nRenderer::Renderer(unsigned w, unsigned h)\n  : width_(w)\n  , height_(h)\n  , colorbuffer_(w*h, Color(0.0, 0.0, 0.0))\n  , scenefile_(\"scene.sdf\")\n  , ppm_(width_, height_)\n  ,finished_(false)\n{\n    scene_ = SDFLoader::load(scenefile_);\n}\n\nRenderer::Renderer(unsigned w, unsigned h, string const& scenefile)\n  : width_(w)\n  , height_(h)\n  , colorbuffer_(w*h, Color(0.0, 0.0, 0.0))\n  , scenefile_(scenefile)\n  , ppm_(width_, height_)\n  ,finished_(false)\n{\n   scene_ = SDFLoader::load(scenefile);\n}\n\nvoid Renderer::render() {\n    if (width_<scene_.resX){\n        cout << \"ERROR: Resolution X to big. Forcing: \"<<width_<<endl;\n        scene_.resX=width_;\n    }\n    if (height_<scene_.resY){\n        cout << \"ERROR: Resolution Y to big. Forcing: \"<<height_<<endl;\n        scene_.resY=height_;\n    }\n    if (scene_.renderObjects.find(\"root\")!= scene_.renderObjects.end()){\n        cout << \"#####RENDERING####\"<<endl;\n        cout << \"Resolution: \"<<scene_.resX<<\"x\"<<scene_.resY<<endl;\n        cout << \"Camera: \"<<scene_.camname<<endl;\n        cout << \"ambient light \"<<scene_.amb<<endl;\n\n        float d = -int(scene_.resX)\/tan(scene_.camera.GetFovX()*M_PI\/180); \/\/apply camera fov, little different angle for each pixel\n\n        for (unsigned yr = 0; yr < scene_.resY; ++yr) {\n            for (unsigned xr = 0; xr < scene_.resX; ++xr) {\n                unsigned x=xr;\n                unsigned y=yr;\n                \n                \/\/allow random pixel rendering\n                if (scene_.random){\n                    x=rand() % scene_.resX;\n                    y=rand() % scene_.resY;\n                    for (int i = 0; i < 100; i++) {\/\/try 100 times\n                        auto coloratp = colorbuffer_[(width_*y + x)];\n                        if (!(coloratp.r == 0 && coloratp.g==0 && coloratp.b==0)){\/\/again if already filled\n                            x=rand() % scene_.resX;\n                            y=rand() % scene_.resY;\n                        }else break;\n                    }\n                }\n                \n                Pixel p(x,y);\n\n               \n                \/\/Ray ray(glm::vec3(scene_.camera.GetTransformation() * glm::vec4(0,0,0,1)));\n                Ray ray;\n                ray.direction.x = -int(scene_.resX)\/2.0f+x; \n                ray.direction.y = -int(scene_.resY)\/2.0f+y;\n                ray.direction.z = d;\n                \n                \/\/apply camera transformations\n                ray.origin = glm::vec3(scene_.camera.GetTransformation_inv() * glm::vec4(ray.origin, 1));\n                ray.direction = glm::vec3(scene_.camera.GetTransformation_inv() * glm::vec4(ray.direction, 0));\n                        \n                if (scene_.antialiase>0){\/\/SSAA\n                    int samples = sqrt(scene_.antialiase);\n                    for (int xAA=1;xAA<samples+1;++xAA){\n                        for (int yAA=1;yAA<samples+1;++yAA){\n                            Ray aaRay;\n                            aaRay.direction.x = ray.direction.x +(float) (xAA)\/(float)samples-0.5f; \n                            aaRay.direction.y = ray.direction.y +(float) (yAA)\/(float)samples-0.5f;\n                            aaRay.direction.z = d;\n                            p.color +=getColor(aaRay);\n                        }\n                    }\n                }\n\n\n                \/\/cout << \"Ray@(\"<<x<<\"x\"<<y<<\"): \"<<ray<<endl;\n                if (scene_.antialiase>0)\n                    p.color \/=scene_.antialiase;\n                else\n                    p.color +=getColor(ray);\n                write(p);\n            }\n        }\n        ppm_.save(scene_.outputFile);\n        finished_ = true;\n    } else {\n        cout << \"no root found!\"<<endl;\n    }\n}\n\nColor Renderer::getColor(Ray const& ray) {\n    Color clr;\n    \n    auto intersection( scene_.renderObjects[\"root\"]->intersect(ray) );\n\n    if (intersection.hit){\/\/if intersection happened\n        clr +=scene_.amb*intersection.material.getKa();\/\/ambient light\n        \n        \/\/starting from the intersection go to every light source\n        for(auto lightIt = scene_.lights.begin(); lightIt != scene_.lights.end(); lightIt++) {\n            auto light = lightIt->second;\n            \/\/a ray pointing to the current light source\n            auto lightRay = Ray(\n                intersection.ray.origin,    \/\/start at intersection point\n                glm::normalize(light.GetPos()-intersection.ray.origin)\/\/l=IL =L-I \n            );\n            lightRay.maxt = glm::length(light.GetPos()-lightRay.origin);\n            \n            \/\/shaddow\n            auto lighintersect = scene_.renderObjects[\"root\"]->intersect(lightRay);\n            if (!(lighintersect.hit)){\/\/check if intersec between p and light source\n                \/\/diffuse light\n                double fDiffuse = glm::dot(lightRay.direction, intersection.ray.direction);\/\/l*n\n                fDiffuse = fDiffuse < 0 ? 0 : fDiffuse;\/\/allow no negative diffuse light\n\n                clr +=  light.GetDiff()\/\/get light color\n                        * intersection.material.getKd()\/\/multiply by material, (l_p * k_d)\n                        * fDiffuse\n                        * intersection.material.getOpacity();\n                \n                \n                auto r = glm::normalize(\n                            glm::reflect(\n                                lightRay.direction,\n                                intersection.ray.direction\n                            )\n                        );\n                Color spec = light.GetDiff()\n                       * intersection.material.getKs()\n                       * glm::pow(\n                            glm::dot(r, glm::normalize(ray.direction)),\n                            intersection.material.getM()\n                        );\/\/(l*r)^m\n                if (spec.r<0) spec.r=0;\n                if (spec.g<0) spec.g=0;\n                if (spec.b<0) spec.b=0;\n                clr +=spec*intersection.material.getOpacity(); \n            }\n             \/\/refraction\n            if (intersection.material.getOpacity()<1.0f){\n                auto refrdir = glm::refract(ray.direction, intersection.ray.direction, intersection.material.getRefraction());\n                clr += getColor(\n                        Ray(\n                            intersection.ray.origin,    \/\/start at intersection point\n                            refrdir\n                        )\n                    )*(1.0f-intersection.material.getOpacity());\n            }\n        }\n    }\n    return clr;\n}\n\nvoid Renderer::write(Pixel const& p) {\n  \/\/ flip pixels, because of opengl glDrawPixels\n  size_t buf_pos = (width_*p.y + p.x);\n  if (buf_pos >= colorbuffer_.size() || (int)buf_pos < 0) {\n    cerr << \"Fatal Error Renderer::write(Pixel p) : \"\n      << \"pixel out of ppm_ : \"\n      << (int)p.x << \",\" << (int)p.y\n      << endl;\n  } else {\n    colorbuffer_[buf_pos] = p.color;\n  }\n\n  ppm_.write(p);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ This file is part of OpenCV project.\n\/\/ It is subject to the license terms in the LICENSE file found in the top-level directory\n\/\/ of this distribution and at http:\/\/opencv.org\/license.html.\n\n#ifndef OPENCV_VERSION_HPP\n#define OPENCV_VERSION_HPP\n\n#define CV_VERSION_MAJOR    3\n#define CV_VERSION_MINOR    4\n#define CV_VERSION_REVISION 15\n#define CV_VERSION_STATUS   \"-pre\"\n\n#define CVAUX_STR_EXP(__A)  #__A\n#define CVAUX_STR(__A)      CVAUX_STR_EXP(__A)\n\n#define CVAUX_STRW_EXP(__A)  L ## #__A\n#define CVAUX_STRW(__A)      CVAUX_STRW_EXP(__A)\n\n#define CV_VERSION          CVAUX_STR(CV_VERSION_MAJOR) \".\" CVAUX_STR(CV_VERSION_MINOR) \".\" CVAUX_STR(CV_VERSION_REVISION) CV_VERSION_STATUS\n\n\/* old  style version constants*\/\n#define CV_MAJOR_VERSION    CV_VERSION_MAJOR\n#define CV_MINOR_VERSION    CV_VERSION_MINOR\n#define CV_SUBMINOR_VERSION CV_VERSION_REVISION\n\n#endif \/\/ OPENCV_VERSION_HPP\n<commit_msg>release: OpenCV 3.4.15<commit_after>\/\/ This file is part of OpenCV project.\n\/\/ It is subject to the license terms in the LICENSE file found in the top-level directory\n\/\/ of this distribution and at http:\/\/opencv.org\/license.html.\n\n#ifndef OPENCV_VERSION_HPP\n#define OPENCV_VERSION_HPP\n\n#define CV_VERSION_MAJOR    3\n#define CV_VERSION_MINOR    4\n#define CV_VERSION_REVISION 15\n#define CV_VERSION_STATUS   \"\"\n\n#define CVAUX_STR_EXP(__A)  #__A\n#define CVAUX_STR(__A)      CVAUX_STR_EXP(__A)\n\n#define CVAUX_STRW_EXP(__A)  L ## #__A\n#define CVAUX_STRW(__A)      CVAUX_STRW_EXP(__A)\n\n#define CV_VERSION          CVAUX_STR(CV_VERSION_MAJOR) \".\" CVAUX_STR(CV_VERSION_MINOR) \".\" CVAUX_STR(CV_VERSION_REVISION) CV_VERSION_STATUS\n\n\/* old  style version constants*\/\n#define CV_MAJOR_VERSION    CV_VERSION_MAJOR\n#define CV_MINOR_VERSION    CV_VERSION_MINOR\n#define CV_SUBMINOR_VERSION CV_VERSION_REVISION\n\n#endif \/\/ OPENCV_VERSION_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/** \\file mysql_diff_schemas.cc\n *  \\brief A tool for listing the differences between two schemas.\n *  \\author Dr. Johannes Ruscheinski (johannes.ruscheinski@uni-tuebingen.de)\n *\n *  \\copyright 2020 Universitätsbibliothek Tübingen.  All rights reserved.\n *\n *  This program is free software: you can redistribute it and\/or modify\n *  it under the terms of the GNU Affero General Public License as\n *  published by the Free Software Foundation, either version 3 of the\n *  License, or (at your option) any later version.\n *\n *  This program is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n *  GNU Affero General Public License for more details.\n *\n *  You should have received a copy of the GNU Affero General Public License\n *  along with this program.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n#include <algorithm>\n#include <iostream>\n#include <map>\n#include <set>\n#include <vector>\n#include <cstdlib>\n#include \"FileUtil.h\"\n#include \"RegexMatcher.h\"\n#include \"StringUtil.h\"\n#include \"util.h\"\n\n\nstd::string ExtractBackQuotedString(const std::string &s) {\n    auto ch(s.cbegin());\n    if (unlikely(*ch != '`'))\n        LOG_ERROR(\"\\\"\" + s + \"\\\" does not start with a backtick!\");\n    ++ch;\n\n    std::string extracted_string;\n    while (ch != s.cend() and *ch != '`')\n        extracted_string += *ch++;\n    if (unlikely(ch == s.cend()))\n        LOG_ERROR(\"\\\"\" + s + \"\\\" does not end with a backtick!\");\n\n    return extracted_string;\n}\n\n\ninline bool SchemaLineIsLessThan(const std::string &line1, const std::string &line2) {\n    if ((*line1.c_str() == '`') != (*line2.c_str() == '`'))\n        return *line1.c_str() == '`';\n\n    return line1 < line2;\n}\n\n\nvoid LoadSchema(const std::string &filename, std::map<std::string, std::vector<std::string>> * const table_name_to_schema_map) {\n    std::string current_table;\n    std::vector<std::string> current_schema;\n    for (auto line : FileUtil::ReadLines(filename)) {\n        StringUtil::Trim(&line);\n        if (StringUtil::StartsWith(line, \"CREATE TABLE \")) {\n            if (not current_table.empty()) {\n                std::sort(current_schema.begin(), current_schema.end(), SchemaLineIsLessThan);\n                (*table_name_to_schema_map)[current_table] = current_schema;\n            }\n            current_table = ExtractBackQuotedString(line.substr(__builtin_strlen(\"CREATE TABLE \")));\n            current_schema.clear();\n        } else {\n            if (line[line.length() - 1] == ',')\n                line = line.substr(0, line.length() - 1);\n            current_schema.emplace_back(line);\n        }\n    }\n    if (not current_schema.empty()) {\n        std::sort(current_schema.begin(), current_schema.end(), SchemaLineIsLessThan);\n        (*table_name_to_schema_map)[current_table] = current_schema;\n    }\n}\n\n\nstd::set<std::string> FindLinesStartingWithPrefix(const std::vector<std::string> &lines, const std::string &prefix) {\n    std::set<std::string> matching_lines;\n    for (const auto &line : lines) {\n        if (StringUtil::StartsWith(line, prefix))\n            matching_lines.emplace(line);\n    }\n    return matching_lines;\n}\n\n\n\/\/ Reports differences for lines that start w\/ \"prefix\" for tables w\/ the identical names.\nvoid CompareTables(const std::string &prefix, const std::map<std::string, std::vector<std::string>> &table_name_to_schema_map1,\n                   const std::map<std::string, std::vector<std::string>> &table_name_to_schema_map2)\n{\n    for (const auto &table_name1_and_schema1 : table_name_to_schema_map1) {\n        const auto &table_name1(table_name1_and_schema1.first);\n        const auto table_name2_and_schema2(table_name_to_schema_map2.find(table_name1));\n        if (table_name2_and_schema2 == table_name_to_schema_map2.cend())\n            continue;\n        const auto &schema2(table_name2_and_schema2->second);\n\n        const std::set<std::string> matching_lines_in_table1(FindLinesStartingWithPrefix(table_name1_and_schema1.second, prefix));\n        for (const auto &matching_line_in_table1 : matching_lines_in_table1) {\n            const auto matching_line_in_schema2(std::find(schema2.cbegin(), schema2.cend(), matching_line_in_table1));\n            if (matching_line_in_schema2 == schema2.cend())\n                std::cout << matching_line_in_table1 << \" is missing in 2nd schema for table \" << table_name1 << '\\n';\n        }\n        for (const auto &line_in_table2 : schema2) {\n            if (StringUtil::StartsWith(line_in_table2, prefix)\n                and matching_lines_in_table1.find(line_in_table2) == matching_lines_in_table1.cend())\n                std::cout << line_in_table2 << \" is missing in 1st schema for table \" << table_name1 << '\\n';\n        }\n    }\n}\n\n\nclass StartsWith {\n    std::string prefix_;\npublic:\n    explicit StartsWith(const std::string &prefix): prefix_(prefix) { }\n    bool operator ()(const std::string &line) const { return StringUtil::StartsWith(line, prefix_); }\n};\n\n\nclass StartsWithColumnName: public StartsWith {\npublic:\n    explicit StartsWithColumnName(const std::string &reference_column_name): StartsWith(\"`\" + reference_column_name + \"`\") { }\n};\n\n\nvoid CompareTableOptions(const std::map<std::string, std::vector<std::string>> &table_name_to_schema_map1,\n                         const std::map<std::string, std::vector<std::string>> &table_name_to_schema_map2)\n{\n    for (const auto &table_name1_and_schema1 : table_name_to_schema_map1) {\n        const auto &table_name1(table_name1_and_schema1.first);\n        const auto table_name2_and_schema2(table_name_to_schema_map2.find(table_name1));\n        if (table_name2_and_schema2 == table_name_to_schema_map2.cend())\n            continue;\n\n        const auto &schema1(table_name1_and_schema1.second);\n        const auto table_options1(std::find_if(schema1.cbegin(), schema1.cend(), StartsWith(\") \")));\n        if (unlikely(table_options1 == schema1.cend()))\n            LOG_ERROR(\"No table options line for table \\\"\" + table_name1 + \"\\\" found in 1st schema!\");\n\n        const auto &schema2(table_name2_and_schema2->second);\n        const auto table_options2(std::find_if(schema2.cbegin(), schema2.cend(), StartsWith(\") \")));\n        if (unlikely(table_options2 == schema2.cend()))\n            LOG_ERROR(\"No table options line for table \\\"\" + table_name1 + \"\\\" found in 2nd schema!\");\n\n        static RegexMatcher * const auto_increment_matcher(RegexMatcher::RegexMatcherFactoryOrDie(\"\\\\s*AUTO_INCREMENT=\\\\d+\"));\n        const std::string cleaned_table_options1(auto_increment_matcher->replaceAll(table_options1->substr(2), \"\"));\n        const std::string cleaned_table_options2(auto_increment_matcher->replaceAll(table_options2->substr(2), \"\"));\n\n        if (cleaned_table_options1 != cleaned_table_options2)\n            std::cerr << \"Table options differ for \" << table_name1 << \": \" << cleaned_table_options1 << \" -> \"\n                      << cleaned_table_options2 << '\\n';\n    }\n}\n\n\nvoid ReportUnknownLines(const std::string &schema, const std::map<std::string, std::vector<std::string>> &table_name_to_schema_map) {\n    static const std::vector<std::string> KNOWN_LINE_PREFIXES{ \"KEY\", \"PRIMARY KEY\", \"UNIQUE KEY\", \"CONSTRAINT\", \" )\" };\n\n    for (const auto &table_name_and_schema : table_name_to_schema_map) {\n        for (const auto &line : table_name_and_schema.second) {\n            bool found_a_known_prefix(false);\n            for (const auto &known_prefix : KNOWN_LINE_PREFIXES) {\n                if (StringUtil::StartsWith(line, known_prefix)) {\n                    found_a_known_prefix = true;\n                    break;\n                }\n            }\n\n            if (not found_a_known_prefix)\n                LOG_ERROR(\"Unknown line type in \" + schema + \", table \" + table_name_and_schema.first + \": \" + line);\n        }\n    }\n}\n\n\nvoid DiffSchemas(const std::map<std::string, std::vector<std::string>> &table_name_to_schema_map1,\n                 const std::map<std::string, std::vector<std::string>> &table_name_to_schema_map2)\n{\n    std::set<std::string> already_processed_table_names;\n    for (const auto &table_name1_and_schema1 : table_name_to_schema_map1) {\n        const auto &table_name1(table_name1_and_schema1.first);\n        already_processed_table_names.emplace(table_name1);\n        const auto table_name2_and_schema2(table_name_to_schema_map2.find(table_name1));\n        if (table_name2_and_schema2 == table_name_to_schema_map2.cend()) {\n            std::cout << \"Table was deleted: \" << table_name1 << '\\n';\n            continue;\n        }\n\n        const auto &schema1(table_name1_and_schema1.second);\n        const auto &schema2(table_name2_and_schema2->second);\n\n        \/\/ Compare column definitions first:\n        const auto last_column_def1(std::find_if(schema1.crbegin(), schema1.crend(),\n                                                 [](const std::string &line){ return not line.empty() and line[0] == '`'; }));\n        const auto last_column_def2(std::find_if(schema2.crbegin(), schema2.crend(),\n                                                 [](const std::string &line){ return not line.empty() and line[0] == '`'; }));\n\n        std::set<std::string> already_processed_column_names;\n        for (auto column_def1(schema1.cbegin()); column_def1 != last_column_def1.base(); ++column_def1) {\n            const auto column_name1(ExtractBackQuotedString(*column_def1));\n            already_processed_column_names.emplace(column_name1);\n            const auto column_def2(std::find_if(schema2.cbegin(), last_column_def2.base(), StartsWithColumnName(column_name1)));\n            if (column_def2 == last_column_def2.base())\n                std::cout << \"Column does not exist in 1st schema: \" << table_name1 << '.' << column_name1 << '\\n';\n            else if (*column_def1 != *column_def2)\n                std::cout << \"Column definition differs between the 1st and 2nd schemas (\" << table_name1 << \"): \" << *column_def1 << \" -> \" << *column_def2 << '\\n';\n        }\n\n        for (auto column_def2(schema2.cbegin()); column_def2 != last_column_def2.base(); ++column_def2) {\n            const auto column_name2(ExtractBackQuotedString(*column_def2));\n            if (already_processed_column_names.find(column_name2) == already_processed_column_names.cend())\n                std::cout << \"Column exists only in 2nd schema: \" << table_name1 << '.' << column_name2 << '\\n';\n        }\n    }\n\n    std::set<std::string> schema2_tables;\n    for (const auto &table_name2_and_schema2 : table_name_to_schema_map2) {\n        const auto &table_name2(table_name2_and_schema2.first);\n        schema2_tables.emplace(table_name2);\n        if (already_processed_table_names.find(table_name2) == already_processed_table_names.cend())\n            std::cout << \"Table exists only in 1st schema: \" << table_name2 << '\\n';\n    }\n    for (const auto &table_name1_and_schema1 : table_name_to_schema_map1) {\n        const auto &table_name1(table_name1_and_schema1.first);\n        if (schema2_tables.find(table_name1) == schema2_tables.cend())\n            std::cout << \"Table exist only in 2st schema: \" << table_name1 << '\\n';\n    }\n\n    CompareTables(\"KEY\", table_name_to_schema_map1, table_name_to_schema_map2);\n    CompareTables(\"PRIMARY KEY\", table_name_to_schema_map1, table_name_to_schema_map2);\n    CompareTables(\"UNIQUE KEY\", table_name_to_schema_map1, table_name_to_schema_map2);\n    CompareTables(\"CONSTRAINT\", table_name_to_schema_map1, table_name_to_schema_map2);\n    CompareTableOptions(table_name_to_schema_map1, table_name_to_schema_map2);\n\n    ReportUnknownLines(\"schema1\", table_name_to_schema_map1);\n    ReportUnknownLines(\"schema2\", table_name_to_schema_map1);\n}\n\n\nint Main(int argc, char *argv[]) {\n    if (argc != 3)\n        ::Usage(\"schema1 schema2\\n\"\n                \"Please note that this tool may not work particularly well if you do not use output from mysql_list_tables\");\n\n    std::map<std::string, std::vector<std::string>> table_name_to_schema_map1;\n    LoadSchema(argv[1], &table_name_to_schema_map1);\n\n    std::map<std::string, std::vector<std::string>> table_name_to_schema_map2;\n    LoadSchema(argv[2], &table_name_to_schema_map2);\n\n    DiffSchemas(table_name_to_schema_map1, table_name_to_schema_map2);\n\n    return EXIT_SUCCESS;\n}\n<commit_msg>mysql_schema_diff: fix for ReportUnknownLines (ignore regular columns + table ends)<commit_after>\/** \\file mysql_diff_schemas.cc\n *  \\brief A tool for listing the differences between two schemas.\n *  \\author Dr. Johannes Ruscheinski (johannes.ruscheinski@uni-tuebingen.de)\n *\n *  \\copyright 2020 Universitätsbibliothek Tübingen.  All rights reserved.\n *\n *  This program is free software: you can redistribute it and\/or modify\n *  it under the terms of the GNU Affero General Public License as\n *  published by the Free Software Foundation, either version 3 of the\n *  License, or (at your option) any later version.\n *\n *  This program is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n *  GNU Affero General Public License for more details.\n *\n *  You should have received a copy of the GNU Affero General Public License\n *  along with this program.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n#include <algorithm>\n#include <iostream>\n#include <map>\n#include <set>\n#include <vector>\n#include <cstdlib>\n#include \"FileUtil.h\"\n#include \"RegexMatcher.h\"\n#include \"StringUtil.h\"\n#include \"util.h\"\n\n\nstd::string ExtractBackQuotedString(const std::string &s) {\n    auto ch(s.cbegin());\n    if (unlikely(*ch != '`'))\n        LOG_ERROR(\"\\\"\" + s + \"\\\" does not start with a backtick!\");\n    ++ch;\n\n    std::string extracted_string;\n    while (ch != s.cend() and *ch != '`')\n        extracted_string += *ch++;\n    if (unlikely(ch == s.cend()))\n        LOG_ERROR(\"\\\"\" + s + \"\\\" does not end with a backtick!\");\n\n    return extracted_string;\n}\n\n\ninline bool SchemaLineIsLessThan(const std::string &line1, const std::string &line2) {\n    if ((*line1.c_str() == '`') != (*line2.c_str() == '`'))\n        return *line1.c_str() == '`';\n\n    return line1 < line2;\n}\n\n\nvoid LoadSchema(const std::string &filename, std::map<std::string, std::vector<std::string>> * const table_name_to_schema_map) {\n    std::string current_table;\n    std::vector<std::string> current_schema;\n    for (auto line : FileUtil::ReadLines(filename)) {\n        StringUtil::Trim(&line);\n        if (StringUtil::StartsWith(line, \"CREATE TABLE \")) {\n            if (not current_table.empty()) {\n                std::sort(current_schema.begin(), current_schema.end(), SchemaLineIsLessThan);\n                (*table_name_to_schema_map)[current_table] = current_schema;\n            }\n            current_table = ExtractBackQuotedString(line.substr(__builtin_strlen(\"CREATE TABLE \")));\n            current_schema.clear();\n        } else {\n            if (line[line.length() - 1] == ',')\n                line = line.substr(0, line.length() - 1);\n            current_schema.emplace_back(line);\n        }\n    }\n    if (not current_schema.empty()) {\n        std::sort(current_schema.begin(), current_schema.end(), SchemaLineIsLessThan);\n        (*table_name_to_schema_map)[current_table] = current_schema;\n    }\n}\n\n\nstd::vector<std::string> FindLinesStartingWithPrefix(const std::vector<std::string> &lines, const std::string &prefix) {\n    std::vector<std::string> matching_lines;\n    for (const auto &line : lines) {\n        if (StringUtil::StartsWith(line, prefix))\n            matching_lines.emplace_back(line);\n    }\n    return matching_lines;\n}\n\n\n\/\/ Reports differences for lines that start w\/ \"prefix\" for tables w\/ the identical names.\nvoid CompareTables(const std::string &prefix, const std::map<std::string, std::vector<std::string>> &table_name_to_schema_map1,\n                   const std::map<std::string, std::vector<std::string>> &table_name_to_schema_map2)\n{\n    for (const auto &table_name1_and_schema1 : table_name_to_schema_map1) {\n        const auto &table_name1(table_name1_and_schema1.first);\n        const auto table_name2_and_schema2(table_name_to_schema_map2.find(table_name1));\n        if (table_name2_and_schema2 == table_name_to_schema_map2.cend())\n            continue;\n        const auto &schema2(table_name2_and_schema2->second);\n\n        const auto matching_lines_in_table1(FindLinesStartingWithPrefix(table_name1_and_schema1.second, prefix));\n        for (const auto &matching_line_in_table1 : matching_lines_in_table1) {\n            const auto matching_line_in_schema2(std::find(schema2.cbegin(), schema2.cend(), matching_line_in_table1));\n            if (matching_line_in_schema2 == schema2.cend())\n                std::cout << matching_line_in_table1 << \" is missing in 2nd schema for table \" << table_name1 << '\\n';\n        }\n        for (const auto &line_in_table2 : schema2) {\n            if (StringUtil::StartsWith(line_in_table2, prefix)\n                and std::find(matching_lines_in_table1.cbegin(), matching_lines_in_table1.cend(), line_in_table2) == matching_lines_in_table1.cend())\n                std::cout << line_in_table2 << \" is missing in 1st schema for table \" << table_name1 << '\\n';\n        }\n    }\n}\n\n\nclass StartsWith {\n    std::string prefix_;\npublic:\n    explicit StartsWith(const std::string &prefix): prefix_(prefix) { }\n    bool operator ()(const std::string &line) const { return StringUtil::StartsWith(line, prefix_); }\n};\n\n\nclass StartsWithColumnName: public StartsWith {\npublic:\n    explicit StartsWithColumnName(const std::string &reference_column_name): StartsWith(\"`\" + reference_column_name + \"`\") { }\n};\n\n\nvoid CompareTableOptions(const std::map<std::string, std::vector<std::string>> &table_name_to_schema_map1,\n                         const std::map<std::string, std::vector<std::string>> &table_name_to_schema_map2)\n{\n    for (const auto &table_name1_and_schema1 : table_name_to_schema_map1) {\n        const auto &table_name1(table_name1_and_schema1.first);\n        const auto table_name2_and_schema2(table_name_to_schema_map2.find(table_name1));\n        if (table_name2_and_schema2 == table_name_to_schema_map2.cend())\n            continue;\n\n        const auto &schema1(table_name1_and_schema1.second);\n        const auto table_options1(std::find_if(schema1.cbegin(), schema1.cend(), StartsWith(\") \")));\n        if (unlikely(table_options1 == schema1.cend()))\n            LOG_ERROR(\"No table options line for table \\\"\" + table_name1 + \"\\\" found in 1st schema!\");\n\n        const auto &schema2(table_name2_and_schema2->second);\n        const auto table_options2(std::find_if(schema2.cbegin(), schema2.cend(), StartsWith(\") \")));\n        if (unlikely(table_options2 == schema2.cend()))\n            LOG_ERROR(\"No table options line for table \\\"\" + table_name1 + \"\\\" found in 2nd schema!\");\n\n        static RegexMatcher * const auto_increment_matcher(RegexMatcher::RegexMatcherFactoryOrDie(\"\\\\s*AUTO_INCREMENT=\\\\d+\"));\n        const std::string cleaned_table_options1(auto_increment_matcher->replaceAll(table_options1->substr(2), \"\"));\n        const std::string cleaned_table_options2(auto_increment_matcher->replaceAll(table_options2->substr(2), \"\"));\n\n        if (cleaned_table_options1 != cleaned_table_options2)\n            std::cerr << \"Table options differ for \" << table_name1 << \": \" << cleaned_table_options1 << \" -> \"\n                      << cleaned_table_options2 << '\\n';\n    }\n}\n\n\nvoid ReportUnknownLines(const std::string &schema, const std::map<std::string, std::vector<std::string>> &table_name_to_schema_map) {\n    static const std::vector<std::string> KNOWN_LINE_PREFIXES{ \"KEY\", \"PRIMARY KEY\", \"UNIQUE KEY\", \"CONSTRAINT\", \") \", \"`\" };\n\n    for (const auto &table_name_and_schema : table_name_to_schema_map) {\n        for (const auto &line : table_name_and_schema.second) {\n            bool found_a_known_prefix(false);\n            for (const auto &known_prefix : KNOWN_LINE_PREFIXES) {\n                if (StringUtil::StartsWith(line, known_prefix)) {\n                    found_a_known_prefix = true;\n                    break;\n                }\n            }\n\n            if (not found_a_known_prefix)\n                LOG_ERROR(\"Unknown line type in \" + schema + \", table \" + table_name_and_schema.first + \": \" + line);\n        }\n    }\n}\n\n\nvoid DiffSchemas(const std::map<std::string, std::vector<std::string>> &table_name_to_schema_map1,\n                 const std::map<std::string, std::vector<std::string>> &table_name_to_schema_map2)\n{\n    std::set<std::string> already_processed_table_names;\n    for (const auto &table_name1_and_schema1 : table_name_to_schema_map1) {\n        const auto &table_name1(table_name1_and_schema1.first);\n        already_processed_table_names.emplace(table_name1);\n        const auto table_name2_and_schema2(table_name_to_schema_map2.find(table_name1));\n        if (table_name2_and_schema2 == table_name_to_schema_map2.cend()) {\n            std::cout << \"Table was deleted: \" << table_name1 << '\\n';\n            continue;\n        }\n\n        const auto &schema1(table_name1_and_schema1.second);\n        const auto &schema2(table_name2_and_schema2->second);\n\n        \/\/ Compare column definitions first:\n        const auto last_column_def1(std::find_if(schema1.crbegin(), schema1.crend(),\n                                                 [](const std::string &line){ return not line.empty() and line[0] == '`'; }));\n        const auto last_column_def2(std::find_if(schema2.crbegin(), schema2.crend(),\n                                                 [](const std::string &line){ return not line.empty() and line[0] == '`'; }));\n\n        std::set<std::string> already_processed_column_names;\n        for (auto column_def1(schema1.cbegin()); column_def1 != last_column_def1.base(); ++column_def1) {\n            const auto column_name1(ExtractBackQuotedString(*column_def1));\n            already_processed_column_names.emplace(column_name1);\n            const auto column_def2(std::find_if(schema2.cbegin(), last_column_def2.base(), StartsWithColumnName(column_name1)));\n            if (column_def2 == last_column_def2.base())\n                std::cout << \"Column does not exist in 1st schema: \" << table_name1 << '.' << column_name1 << '\\n';\n            else if (*column_def1 != *column_def2)\n                std::cout << \"Column definition differs between the 1st and 2nd schemas (\" << table_name1 << \"): \" << *column_def1 << \" -> \" << *column_def2 << '\\n';\n        }\n\n        for (auto column_def2(schema2.cbegin()); column_def2 != last_column_def2.base(); ++column_def2) {\n            const auto column_name2(ExtractBackQuotedString(*column_def2));\n            if (already_processed_column_names.find(column_name2) == already_processed_column_names.cend())\n                std::cout << \"Column exists only in 2nd schema: \" << table_name1 << '.' << column_name2 << '\\n';\n        }\n    }\n\n    std::set<std::string> schema2_tables;\n    for (const auto &table_name2_and_schema2 : table_name_to_schema_map2) {\n        const auto &table_name2(table_name2_and_schema2.first);\n        schema2_tables.emplace(table_name2);\n        if (already_processed_table_names.find(table_name2) == already_processed_table_names.cend())\n            std::cout << \"Table exists only in 1st schema: \" << table_name2 << '\\n';\n    }\n    for (const auto &table_name1_and_schema1 : table_name_to_schema_map1) {\n        const auto &table_name1(table_name1_and_schema1.first);\n        if (schema2_tables.find(table_name1) == schema2_tables.cend())\n            std::cout << \"Table exist only in 2st schema: \" << table_name1 << '\\n';\n    }\n\n    CompareTables(\"KEY\", table_name_to_schema_map1, table_name_to_schema_map2);\n    CompareTables(\"PRIMARY KEY\", table_name_to_schema_map1, table_name_to_schema_map2);\n    CompareTables(\"UNIQUE KEY\", table_name_to_schema_map1, table_name_to_schema_map2);\n    CompareTables(\"CONSTRAINT\", table_name_to_schema_map1, table_name_to_schema_map2);\n    CompareTableOptions(table_name_to_schema_map1, table_name_to_schema_map2);\n\n    ReportUnknownLines(\"schema1\", table_name_to_schema_map1);\n    ReportUnknownLines(\"schema2\", table_name_to_schema_map2);\n}\n\n\nint Main(int argc, char *argv[]) {\n    if (argc != 3)\n        ::Usage(\"schema1 schema2\\n\"\n                \"Please note that this tool may not work particularly well if you do not use output from mysql_list_tables\");\n\n    std::map<std::string, std::vector<std::string>> table_name_to_schema_map1;\n    LoadSchema(argv[1], &table_name_to_schema_map1);\n\n    std::map<std::string, std::vector<std::string>> table_name_to_schema_map2;\n    LoadSchema(argv[2], &table_name_to_schema_map2);\n\n    DiffSchemas(table_name_to_schema_map1, table_name_to_schema_map2);\n\n    return EXIT_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>templates: add comments in TaskBase.* to explain some error messages<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ run testOperations in loop mode from size 2x2 up to 30x30\n#define TEST_ALL_MATRIX_SIZES\n#define NITER 10\n#include \"testOperations.cxx\"\n<commit_msg>keep NITER=1 as default<commit_after>\/\/ run testOperations in loop mode from size 2x2 up to 30x30\n#define TEST_ALL_MATRIX_SIZES\n\/\/#define NITER 10\n#include \"testOperations.cxx\"\n<|endoftext|>"}
{"text":"<commit_before>#include <QtWidgets>\n#include <QtTest>\n#include <type_traits>\n\nnamespace detail {\ntemplate <typename T> struct MetatypeFunctionHelperImpl {\n   static void Destruct(void *t) { static_cast<T*>(t)->~T(); }\n   static void *Construct(void *where, const void *t) {\n      if (t)\n         return new (where) T(*static_cast<const T*>(t));\n      return new (where) T;\n   }\n   static void Save(QDataStream &ds, const void *t) { ds << *static_cast<const T*>(t); }\n   static void Load(QDataStream &stream, void *t) { ds >> *static_cast<T*>(t); }\n};\ntemplate <typename B, typename T> struct BaseMetatypeFunctionhelper<B, T> :\n      MetatypeFunctionHelperImpl<T> {};\n}\n\n#define DECLARE_CUSTOM_METATYPE(BASE_TYPE, TYPE) DECLARE_CUSTOM_METATYPE_IMPL(BASE_TYPE, TYPE)\n\n#define DECLARE_CUSTOM_METATYPE_IMPL(BASE_TYPE, TYPE) \\\n   QT_BEGIN_NAMESPACE \\\n   template <> \\\n   struct QtMetaTypePrivate::QMetaTypeFunctionHelper<TYPE, true> : \\\n   BaseMetatypeFunctionhelper<BASE_TYPE, TYPE> {}; \\\n\n\nQ_GLOBAL_STATIC(QReadWriteLock, aa)\n\n                template <typename T> struct QGraphicsItemHelper {\n                   static void Destruct(void *t) { static_cast<T*>(t)->~T(); }\n                   static void *Construct(void *where, const void *t) {\n                      Q_ASSERT(!t);\n                      return new (where) T;\n                   }\n                   static void Save(QDataStream &ds, const void *t) { ds << *static_cast<const T*>(t); }\n                   static void Load(QDataStream &ds, void *t) { ds >> *static_cast<T*>(t); }\n                };\n\ntemplate <typename T> bool checkTypeEnum() {\n   auto const &en = QMetaEnum::fromType<T>();\n   for (int i = 0; i < en.keyCount(); i++)\n      if (QMetaType::type(en.key(i)) == QMetaType::UnknownType)\n         return false;\n   return true;\n}\n\ntemplate <typename T> int typeIdToEnum(int typeId) {\n   auto const &en = QMetaEnum::fromType<T>();\n   return en.keyToValue(QMetaType::typeName(typeId));\n}\n\ntemplate <typename T> int enumToTypeId(int enumVal) {\n   auto const &en = QMetaEnum::fromType<T>();\n   auto *name = en.valueToKey(enumVal);\n   return name ? QMetaType::type(name) : QMetaType::UnknownType;\n}\n\n#define DECLARE_GRAPHICS_METAITEM(TYPE) DECLARE_GRAPHICS_METAITEM_IMPL(TYPE)\n#define DECLARE_GRAPHICS_METAITEM_IMPL(TYPE)                            \\\n   QT_BEGIN_NAMESPACE                                                   \\\n   template <>                                                          \\\n   struct QtMetaTypePrivate::QMetaTypeFunctionHelper<TYPE, true> :      \\\n   QGraphicsItemHelper<TYPE> {};                                     \\\n   template <>                                                          \\\n   struct QMetaTypeId<TYPE>                                             \\\n{                                                                    \\\n   enum { Defined = 1 };                                            \\\n   static int qt_metatype_id()                                      \\\n{                                                            \\\n   static QBasicAtomicInt metatype_id = Q_BASIC_ATOMIC_INITIALIZER(0); \\\n   if (const int id = metatype_id.loadAcquire())            \\\n   return id;                                           \\\n   const int newId = qRegisterMetaType< TYPE >(#TYPE,       \\\n   reinterpret_cast< TYPE *>(quintptr(-1)));  \\\n   metatype_id.storeRelease(newId);                         \\\n   return newId;                                            \\\n   }                                                            \\\n   };                                                                   \\\n   QT_END_NAMESPACE\n\nDECLARE_GRAPHICS_METAITEM(QGraphicsEllipseItem)\n\nclass ItemStream {\n   Q_GADGET\n   QDataStream &ds;\n   QGraphicsItem &item;\n   public:\n   enum Type {\n      QGraphicsEllipseItem = QGraphicsEllipseItem::Type,\n      QGraphicsPathItem = QGraphicsPathItem::Type,\n      QGraphicsPolygonItem = QGraphicsPolygonItem::Type,\n      QGraphicsRectItem = QGraphicsRectItem::Type,\n      QGraphicsSimpleTextItem = QGraphicsSimpleTextItem::Type,\n      QGraphicsLineItem = QGraphicsLineItem::Type,\n      QGraphicsPixmapItem = QGraphicsPixmapItem::Type\n   };\n   Q_ENUM(Type)\n   ItemStream(QDataStream &ds, class QGraphicsItem &item) : ds(ds), item(item) {}\n   template <typename C, typename T> ItemStream &operator>>(void (C::*set)(T)) {\n      using decayed_type = typename std::decay<T>::type;\n      using value_type = typename std::conditional<std::is_enum<decayed_type>::value,\n      std::underlying_type<decayed_type>, std::decay<T>>::type::type;\n      value_type value;\n      ds >> value;\n      (static_cast<C&>(item).*set)(static_cast<T>(value));\n      return *this;\n   }\n};\n\nQDataStream &operator<<(QDataStream &out, const QGraphicsItem &g) {\n   out << g.type()\n       << g.pos()\n       << g.scale()\n       << g.rotation()\n       << g.transform()\n          \/\/<< g.transformations()\n       << g.transformOriginPoint()\n       << g.flags()\n       << g.isEnabled()\n       << g.isSelected()\n       << g.zValue();\n   return out;\n}\n\nQDataStream &operator>>(QDataStream &in, QGraphicsItem &g) {\n   using QGI = std::decay<decltype(g)>::type;\n   int type;\n   QTransform transform;\n   in >> type;\n   Q_ASSERT(g.type() == type);\n   ItemStream iin(in, g);\n   iin >> &QGI::setPos\n         >> &QGI::setScale\n         >> &QGI::setRotation;\n   in >> transform;\n   iin \/\/>> &QGI::setTransformations\n         >> &QGI::setTransformOriginPoint\n         >> &QGI::setFlags\n         >> &QGI::setEnabled\n         >> &QGI::setSelected\n         >> &QGI::setZValue;\n   g.setTransform(transform);\n   return in;\n}\n\nQDataStream &operator<<(QDataStream &out, const QAbstractGraphicsShapeItem &g){\n   out << static_cast<const QGraphicsItem&>(g);\n   out << g.pen() << g.brush();\n   return out;\n}\n\nQDataStream &operator>>(QDataStream &in, QAbstractGraphicsShapeItem &g){\n   using QGI = std::decay<decltype(g)>::type;\n   in >> static_cast<QGraphicsItem &>(g);\n   ItemStream(in,g) >> &QGI::setPen >> &QGI::setBrush;\n   return in;\n}\n\nQDataStream &operator<<(QDataStream &out, const QGraphicsEllipseItem &g){\n   out << dynamic_cast<const QAbstractGraphicsShapeItem &>(g);\n   out << g.rect() << g.startAngle() << g.spanAngle();\n   return out;\n}\n\nQDataStream &operator>>(QDataStream &in, QGraphicsEllipseItem &g) {\n   using QGI = std::decay<decltype(g)>::type;\n   in >> static_cast<QAbstractGraphicsShapeItem &>(g);\n   ItemStream(in, g) >> &QGI::setRect >> &QGI::setStartAngle >> &QGI::setSpanAngle;\n   return in;\n}\n\nQDataStream &operator<<(QDataStream &out, const QGraphicsPathItem &g) {\n   out << static_cast<const QAbstractGraphicsShapeItem &>(g);\n   out << g.path();\n   return out;\n}\n\nQDataStream &operator>>(QDataStream &in, QGraphicsPathItem &g) {\n   using QGI = std::decay<decltype(g)>::type;\n   in >> static_cast<QAbstractGraphicsShapeItem &>(g);\n   ItemStream(in, g) >> &QGI::setPath;\n   return in;\n}\n\nQDataStream &operator<<(QDataStream &out, const QGraphicsPolygonItem &g) {\n   out << static_cast<const QAbstractGraphicsShapeItem &>(g);\n   out << g.polygon()<< g.fillRule();\n   return out;\n}\n\nQDataStream &operator>>(QDataStream &in, QGraphicsPolygonItem &g) {\n   using QGI = std::decay<decltype(g)>::type;\n   in >> static_cast<QAbstractGraphicsShapeItem &>(g);\n   ItemStream(in, g) >> &QGI::setPolygon >> &QGI::setFillRule;\n   return in;\n}\n\nQDataStream &operator<<(QDataStream &out, const QGraphicsRectItem &g) {\n   out << static_cast<const QAbstractGraphicsShapeItem &>(g);\n   out << g.rect();\n   return out;\n}\n\nQDataStream &operator>>(QDataStream &in, QGraphicsRectItem &g) {\n   using QGI = std::decay<decltype(g)>::type;\n   in >> static_cast<QAbstractGraphicsShapeItem &>(g);\n   ItemStream(in,g) >> &QGI::setRect;\n   return in;\n}\n\nQDataStream &operator<<(QDataStream &out, const QGraphicsSimpleTextItem &g) {\n   out << static_cast<const QAbstractGraphicsShapeItem &>(g);\n   out << g.text() << g.font();\n   return out;\n}\n\nQDataStream &operator>>(QDataStream &in, QGraphicsSimpleTextItem &g) {\n   using QGI = std::decay<decltype(g)>::type;\n   in >> static_cast<QAbstractGraphicsShapeItem&>(g);\n   ItemStream(in, g) >> &QGI::setText >> &QGI::setFont;\n   return in;\n}\n\nQDataStream &operator<<(QDataStream &out, const QGraphicsLineItem &g) {\n   out << static_cast<const QGraphicsItem &>(g);\n   out << g.pen() << g.line();\n   return out;\n}\n\nQDataStream &operator>>(QDataStream &in, QGraphicsLineItem &g) {\n   using QGI = std::decay<decltype(g)>::type;\n   in >> static_cast<QGraphicsItem&>(g);\n   ItemStream(in, g) >> &QGI::setPen >> &QGI::setLine;\n   return in;\n}\n\nQDataStream &operator<<(QDataStream &out, const QGraphicsPixmapItem &g) {\n   out << static_cast<const QGraphicsItem&>(g);\n   out << g.pixmap() << g.offset() << g.transformationMode() << g.shapeMode();\n   return out;\n}\n\nQDataStream &operator>>(QDataStream &in, QGraphicsPixmapItem &g) {\n   using QGI = std::decay<decltype(g)>::type;\n   in >> static_cast<QGraphicsItem&>(g);\n   ItemStream(in, g) >> &QGI::setPixmap >> &QGI::setOffset\n                     >> &QGI::setTransformationMode >> &QGI::setShapeMode;\n   return in;\n}\n\n#if 0\nstatic void saveItems(QList<QGraphicsItem *> items, QDataStream & out){\n   for(QGraphicsItem *item : items){\n      out << g.type();\n      switch (g.type()) {\n      case QGraphicsLineItem::Type:\n         out << dynamic_cast<QGraphicsLineItem *>(item);\n         break;\n      case QGraphicsSimpleTextItem::Type:\n         out << dynamic_cast<QGraphicsSimpleTextItem *>(item);\n         break;\n      case QGraphicsRectItem::Type:\n         out << dynamic_cast<QGraphicsRectItem *>(item);\n         break;\n      case QGraphicsPolygonItem::Type:\n         out << dynamic_cast<QGraphicsPolygonItem *>(item);\n         break;\n      case QGraphicsPathItem::Type:\n         out << dynamic_cast<QGraphicsPathItem *>(item);\n         break;\n      case QGraphicsPixmapItem::Type:\n         out << dynamic_cast<QGraphicsPixmapItem *>(item);\n         break;\n      }\n   }\n}\n\nstatic QList<QGraphicsItem *> readItems(QDataStream & in){\n   QList<QGraphicsItem *> items;\n   int type;\n   while (!in.atEnd()) {\n      in >> type;\n      switch (type) {\n      case QGraphicsLineItem::Type: {\n         QGraphicsLineItem *item = new QGraphicsLineItem;\n         in >> item;\n         items << item;\n         break;\n      }\n      case QGraphicsSimpleTextItem::Type:{\n         QGraphicsSimpleTextItem *item = new QGraphicsSimpleTextItem;\n         in >> item;\n         items << item;\n         break;\n      }\n      case QGraphicsRectItem::Type:{\n         QGraphicsRectItem *item = new QGraphicsRectItem;\n         in >> item;\n         items << item;\n         break;\n      }\n      case QGraphicsPolygonItem::Type:{\n         QGraphicsPolygonItem *item = new QGraphicsPolygonItem;\n         in >> item;\n         items << item;\n         break;\n      }\n      case QGraphicsPathItem::Type:{\n         QGraphicsPathItem *item = new QGraphicsPathItem;\n         in >> item;\n         items << item;\n         break;\n      }\n      case QGraphicsPixmapItem::Type:{\n         QGraphicsPixmapItem *item = new QGraphicsPixmapItem;\n         in >> item;\n         items << item;\n         break;\n      }\n      }\n   }\n   return  items;\n}\n#endif\n\nint main(int argc, char *argv[])\n{\n   QCoreApplication a(argc, argv);\n\n   return a.exec();\n}\n#include \"main.moc\"\n<commit_msg>WIP - some generic code can be reused for other projects<commit_after>#include <QtWidgets>\n#include <QtTest>\n#include <type_traits>\n#include <utility>\n\n#if 0\n\/* Common polymorphic type machinery *\/\n\nnamespace detail {\n\ntemplate <typename T> struct CopyableFunctionHelperImpl {\n   static void Destruct(void *t) { static_cast<T*>(t)->~T(); }\n   static void *Construct(void *where, const void *t) {\n      return t ? new (where) T(*static_cast<const T*>(t)) : new (where) T;\n   }\n   static void Save(QDataStream &ds, const void *t) { ds << *static_cast<const T*>(t); }\n   static void Load(QDataStream &stream, void *t) { ds >> *static_cast<T*>(t); }\n};\n\ntemplate <typename T> struct NonCopyableFunctionHelperImpl {\n   static void Destruct(void *t) { static_cast<T*>(t)->~T(); }\n   static void *Construct(void *where, const void *t) { return (!t) ? new (where) T : nullptr; }\n   static void Save(QDataStream &ds, const void *t) { ds << *static_cast<const T*>(t); }\n   static void Load(QDataStream &stream, void *t) { ds >> *static_cast<T*>(t); }\n};\n\ntemplate <typename B, bool Enabled = false> struct PolymorphicTraits;\n\ntemplate <typename B> struct PolymorphicTraits<B, true> {\n   \/\/ By default, discriminate types by their metatype Id\n   using discriminator_type = int;\n   template <typename T> static discriminator_type type() { return qMetaTypeId<T>(); }\n   template <typename T> static void *create(void *copy) { return QMetaType::create(type<T>(), copy); }\n   template <typename T> static discriminator_type registerDiscriminator() { return type<T>(); }\n};\n\n}\n\n#define DECLARE_POLYMORPHIC_METATYPE(BASE_TYPE, TYPE) DECLARE_POLYMORPHIC_METATYPE_IMPL(BASE_TYPE, TYPE)\n#define DECLARE_POLYMORPHIC_METATYPE_IMPL(BASE_TYPE, TYPE)           \\\n   QT_BEGIN_NAMESPACE                                                \\\n   template <> struct QtMetaTypePrivate::QMetaTypeFunctionHelper     \\\n   <typename std::enable_if<std::is_copy_constructible<TYPE>::value, TYPE>::type, true> : \\\n   detail::CopyableFunctionHelperImpl<TYPE> {};                   \\\n   template <> struct QtMetaTypePrivate::QMetaTypeFunctionHelper     \\\n   <typename std::enable_if<!std::is_copy_constructible<TYPE>::value, TYPE>::type, true> : \\\n   detail::NonCopyableFunctionHelperImpl<TYPE> {};                \\\n   template <>                                                       \\\n   int qRegisterMetaType(const char *typeName, TYPE *dummy,          \\\n   typename QtPrivate::MetaTypeDefinedHelper<T, QMetaTypeId2<T>::Defined && !QMetaTypeId2<T>::IsBuiltIn>::DefinedType defined) \\\n{ \\\n   QT_PREPEND_NAMESPACE(QByteArray) normalizedTypeName = QMetaObject::normalizedType(typeName); \\\n   detail::PolymorphicTraits<BASE_TYPE>::registerDiscriminator<TYPE>();   \\\n   return qRegisterNormalizedMetaType<TYPE>(normalizedTypeName, dummy, defined); \\\n   } \\\n   template <> struct QMetaTypeId<TYPE> {                            \\                                                                  \\\n   enum { Defined = 1 };                                          \\\n   static int qt_metatype_id() {                                  \\\n   static QBasicAtomicInt metatype_id = Q_BASIC_ATOMIC_INITIALIZER(0); \\\n   if (const int id = metatype_id.loadAcquire())               \\\n   return id;                                                  \\\n   const int newId = qRegisterMetaType<TYPE>(#TYPE,            \\\n   reinterpret_cast<TYPE*>(quintptr(-1)));                  \\\n   metatype_id.storeRelease(newId);                            \\\n   return newId;                                               \\\n   }                                                              \\\n   };                                                                \\\n   QT_END_NAMESPACE\n\n\n\n#define DEFINE_POLYMORPHIC_METATYPE(TYPE) DEFINE_POLYMORPHIC_METATYPE_IMPL(TYPE)\n#define DEFINE_POLYMORPHIC_METATYPE_IMPL(TYPE) \\\n   static\n\nQ_GLOBAL_STATIC(QReadWriteLock, aa)\n\n\ntemplate <typename T> bool checkTypeEnum() {\n   auto const &en = QMetaEnum::fromType<T>();\n   for (int i = 0; i < en.keyCount(); i++)\n      if (QMetaType::type(en.key(i)) == QMetaType::UnknownType)\n         return false;\n   return true;\n}\n\ntemplate <typename T> int typeIdToEnum(int typeId) {\n   auto const &en = QMetaEnum::fromType<T>();\n   return en.keyToValue(QMetaType::typeName(typeId));\n}\n\ntemplate <typename T> int enumToTypeId(int enumVal) {\n   auto const &en = QMetaEnum::fromType<T>();\n   auto *name = en.valueToKey(enumVal);\n   return name ? QMetaType::type(name) : QMetaType::UnknownType;\n}\n\n#define DECLARE_GRAPHICS_METAITEM(TYPE) DECLARE_GRAPHICS_METAITEM_IMPL(TYPE)\n#define DECLARE_GRAPHICS_METAITEM_IMPL(TYPE)                            \\\n   QT_BEGIN_NAMESPACE                                                   \\\n   template <>                                                          \\\n   struct QtMetaTypePrivate::QMetaTypeFunctionHelper<TYPE, true> :      \\\n   QGraphicsItemHelper<TYPE> {};                                     \\\n   template <>                                                          \\\n   struct QMetaTypeId<TYPE>                                             \\\n{                                                                    \\\n   enum { Defined = 1 };                                            \\\n\n\nDECLARE_GRAPHICS_METAITEM(QGraphicsEllipseItem)\n#endif\n\n\ntemplate <typename T, typename B> struct NonCopyableFunctionHelper {\n   using base_type = B;\n   static void Destruct(void *t) { static_cast<T*>(t)->~T(); }\n   static void *Construct(void *where, const void *t) { return (!t) ? new (where) T : nullptr; }\n   static void Save(QDataStream &ds, const void *t) { ds << *static_cast<const T*>(t); }\n   static void Load(QDataStream &ds, void *t) { ds >> *static_cast<T*>(t); }\n};\n\n#define DECLARE_POLYMORPHIC_METATYPE(BASE_TYPE, TYPE) DECLARE_POLYMORPHIC_METATYPE_IMPL(BASE_TYPE, TYPE)\n#define DECLARE_POLYMORPHIC_METATYPE_IMPL(BASE_TYPE, TYPE)                          \\\n   QT_BEGIN_NAMESPACE                                                               \\\n   template <> struct QtMetaTypePrivate::QMetaTypeFunctionHelper                    \\\n   <typename std::enable_if<!std::is_copy_constructible<TYPE>::value, TYPE>::type, true> : \\\n      detail::NonCopyableFunctionHelperImpl<TYPE, BASE_TYPE> {};                    \\\n   QT_END_NAMESPACE                                                                 \\\n   Q_DECLARE_METATYPE_IMPL(TYPE)\n\n\/\/DECLARE_POLYMORPHIC_METATYPE(QGraphicsItem, QGraphicsEllipseItem)\n\n\n\/*Interface*\/\ntemplate <> struct QtMetaTypePrivate::QMetaTypeFunctionHelper\n      <typename std::enable_if<!std::is_copy_constructible<QGraphicsEllipseItem>::value, QGraphicsEllipseItem>::type, true> :\n      NonCopyableFunctionHelper<QGraphicsEllipseItem, QGraphicsItem> {};\nQ_DECLARE_METATYPE(QGraphicsEllipseItem)\n\ntemplate <typename T, typename Enable = std::false_type> struct BaseTraits;\n\ntemplate <> struct BaseTraits<QGraphicsItem, std::true_type> {\n   using base_type = QGraphicsItem;\n   struct pair_type { int itemType; int typeId; };\n   template <typename T>\n   static typename std::enable_if<std::is_base_of<base_type, T>::value>::type registerType() {\n      qRegisterMetaTypeStreamOperators<T>();\n      registerMapping(qMetaTypeId<T>(), T::type());\n   }\n   static pair_type registerMapping(int typeId, int d);\n};\n\nQDataStream &operator<<(QDataStream &, QGraphicsItem *g);\nQDataStream &operator>>(QDataStream &, QGraphicsItem *&g);\n\n\/*Implementation*\/\n\nQDataStream &operator<<(QDataStream &ds, const QGraphicsItem *g) {\n   auto mapping = BaseTraits<QGraphicsItem, std::true_type>::registerMapping(QMetaType::UnknownType, g->type());\n   QMetaType::save(ds, mapping.typeId, g);\n   return ds;\n}\n\nQDataStream &operator>>(QDataStream &, QGraphicsItem *&g) {\n   int type = 0;\n   auto read = ds.device()->peek(reinterpret_cast<char*>(&type), sizeof(type));\n   if (read != sizeof(type)) {\n      ds.setStatus(QDataStream::ReadPastEnd);\n      return ds;\n   }\n   auto mapping = BaseTraits<QGraphicsItem, std::true_type>::registerMapping(type, 0);\n   const QMetaType mt(mapping.typeId);\n   g = mt.create();\n   if (g) mt.load()\n   QMetaClassIn\n}\n\n\nclass ItemStream {\n   Q_GADGET\n   QDataStream &ds;\n   QGraphicsItem &item;\npublic:\n   enum Type {\n      QGraphicsEllipseItem = QGraphicsEllipseItem::Type,\n      QGraphicsPathItem = QGraphicsPathItem::Type,\n      QGraphicsPolygonItem = QGraphicsPolygonItem::Type,\n      QGraphicsRectItem = QGraphicsRectItem::Type,\n      QGraphicsSimpleTextItem = QGraphicsSimpleTextItem::Type,\n      QGraphicsLineItem = QGraphicsLineItem::Type,\n      QGraphicsPixmapItem = QGraphicsPixmapItem::Type\n   };\n   Q_ENUM(Type)\n   ItemStream(QDataStream &ds, class QGraphicsItem &item) : ds(ds), item(item) {}\n   template <typename C, typename T> ItemStream &operator>>(void (C::*set)(T)) {\n      using decayed_type = typename std::decay<T>::type;\n      using value_type = typename std::conditional<std::is_enum<decayed_type>::value,\n      std::underlying_type<decayed_type>, std::decay<T>>::type::type;\n      value_type value;\n      ds >> value;\n      (static_cast<C&>(item).*set)(static_cast<T>(value));\n      return *this;\n   }\n};\n\nQDataStream &operator<<(QDataStream &out, const QGraphicsItem &g) {\n   out << g.type()\n       << g.pos()\n       << g.scale()\n       << g.rotation()\n       << g.transform()\n          \/\/<< g.transformations()\n       << g.transformOriginPoint()\n       << g.flags()\n       << g.isEnabled()\n       << g.isSelected()\n       << g.zValue();\n   return out;\n}\n\nQDataStream &operator>>(QDataStream &in, QGraphicsItem &g) {\n   using QGI = std::decay<decltype(g)>::type;\n   int type;\n   QTransform transform;\n   in >> type;\n   Q_ASSERT(g.type() == type);\n   ItemStream iin(in, g);\n   iin >> &QGI::setPos\n         >> &QGI::setScale\n         >> &QGI::setRotation;\n   in >> transform;\n   iin \/\/>> &QGI::setTransformations\n         >> &QGI::setTransformOriginPoint\n         >> &QGI::setFlags\n         >> &QGI::setEnabled\n         >> &QGI::setSelected\n         >> &QGI::setZValue;\n   g.setTransform(transform);\n   return in;\n}\n\nQDataStream &operator<<(QDataStream &out, const QAbstractGraphicsShapeItem &g){\n   out << static_cast<const QGraphicsItem&>(g);\n   out << g.pen() << g.brush();\n   return out;\n}\n\nQDataStream &operator>>(QDataStream &in, QAbstractGraphicsShapeItem &g){\n   using QGI = std::decay<decltype(g)>::type;\n   in >> static_cast<QGraphicsItem &>(g);\n   ItemStream(in,g) >> &QGI::setPen >> &QGI::setBrush;\n   return in;\n}\n\nQDataStream &operator<<(QDataStream &out, const QGraphicsEllipseItem &g){\n   out << dynamic_cast<const QAbstractGraphicsShapeItem &>(g);\n   out << g.rect() << g.startAngle() << g.spanAngle();\n   return out;\n}\n\nQDataStream &operator>>(QDataStream &in, QGraphicsEllipseItem &g) {\n   using QGI = std::decay<decltype(g)>::type;\n   in >> static_cast<QAbstractGraphicsShapeItem &>(g);\n   ItemStream(in, g) >> &QGI::setRect >> &QGI::setStartAngle >> &QGI::setSpanAngle;\n   return in;\n}\n\nQDataStream &operator<<(QDataStream &out, const QGraphicsPathItem &g) {\n   out << static_cast<const QAbstractGraphicsShapeItem &>(g);\n   out << g.path();\n   return out;\n}\n\nQDataStream &operator>>(QDataStream &in, QGraphicsPathItem &g) {\n   using QGI = std::decay<decltype(g)>::type;\n   in >> static_cast<QAbstractGraphicsShapeItem &>(g);\n   ItemStream(in, g) >> &QGI::setPath;\n   return in;\n}\n\nQDataStream &operator<<(QDataStream &out, const QGraphicsPolygonItem &g) {\n   out << static_cast<const QAbstractGraphicsShapeItem &>(g);\n   out << g.polygon()<< g.fillRule();\n   return out;\n}\n\nQDataStream &operator>>(QDataStream &in, QGraphicsPolygonItem &g) {\n   using QGI = std::decay<decltype(g)>::type;\n   in >> static_cast<QAbstractGraphicsShapeItem &>(g);\n   ItemStream(in, g) >> &QGI::setPolygon >> &QGI::setFillRule;\n   return in;\n}\n\nQDataStream &operator<<(QDataStream &out, const QGraphicsRectItem &g) {\n   out << static_cast<const QAbstractGraphicsShapeItem &>(g);\n   out << g.rect();\n   return out;\n}\n\nQDataStream &operator>>(QDataStream &in, QGraphicsRectItem &g) {\n   using QGI = std::decay<decltype(g)>::type;\n   in >> static_cast<QAbstractGraphicsShapeItem &>(g);\n   ItemStream(in,g) >> &QGI::setRect;\n   return in;\n}\n\nQDataStream &operator<<(QDataStream &out, const QGraphicsSimpleTextItem &g) {\n   out << static_cast<const QAbstractGraphicsShapeItem &>(g);\n   out << g.text() << g.font();\n   return out;\n}\n\nQDataStream &operator>>(QDataStream &in, QGraphicsSimpleTextItem &g) {\n   using QGI = std::decay<decltype(g)>::type;\n   in >> static_cast<QAbstractGraphicsShapeItem&>(g);\n   ItemStream(in, g) >> &QGI::setText >> &QGI::setFont;\n   return in;\n}\n\nQDataStream &operator<<(QDataStream &out, const QGraphicsLineItem &g) {\n   out << static_cast<const QGraphicsItem &>(g);\n   out << g.pen() << g.line();\n   return out;\n}\n\nQDataStream &operator>>(QDataStream &in, QGraphicsLineItem &g) {\n   using QGI = std::decay<decltype(g)>::type;\n   in >> static_cast<QGraphicsItem&>(g);\n   ItemStream(in, g) >> &QGI::setPen >> &QGI::setLine;\n   return in;\n}\n\nQDataStream &operator<<(QDataStream &out, const QGraphicsPixmapItem &g) {\n   out << static_cast<const QGraphicsItem&>(g);\n   out << g.pixmap() << g.offset() << g.transformationMode() << g.shapeMode();\n   return out;\n}\n\nQDataStream &operator>>(QDataStream &in, QGraphicsPixmapItem &g) {\n   using QGI = std::decay<decltype(g)>::type;\n   in >> static_cast<QGraphicsItem&>(g);\n   ItemStream(in, g) >> &QGI::setPixmap >> &QGI::setOffset\n                     >> &QGI::setTransformationMode >> &QGI::setShapeMode;\n   return in;\n}\n\n#if 0\nstatic void saveItems(QList<QGraphicsItem *> items, QDataStream & out){\n   for(QGraphicsItem *item : items){\n      out << g.type();\n      switch (g.type()) {\n      case QGraphicsLineItem::Type:\n         out << dynamic_cast<QGraphicsLineItem *>(item);\n         break;\n      case QGraphicsSimpleTextItem::Type:\n         out << dynamic_cast<QGraphicsSimpleTextItem *>(item);\n         break;\n      case QGraphicsRectItem::Type:\n         out << dynamic_cast<QGraphicsRectItem *>(item);\n         break;\n      case QGraphicsPolygonItem::Type:\n         out << dynamic_cast<QGraphicsPolygonItem *>(item);\n         break;\n      case QGraphicsPathItem::Type:\n         out << dynamic_cast<QGraphicsPathItem *>(item);\n         break;\n      case QGraphicsPixmapItem::Type:\n         out << dynamic_cast<QGraphicsPixmapItem *>(item);\n         break;\n      }\n   }\n}\n\nstatic QList<QGraphicsItem *> readItems(QDataStream & in){\n   QList<QGraphicsItem *> items;\n   int type;\n   while (!in.atEnd()) {\n      in >> type;\n      switch (type) {\n      case QGraphicsLineItem::Type: {\n         QGraphicsLineItem *item = new QGraphicsLineItem;\n         in >> item;\n         items << item;\n         break;\n      }\n      case QGraphicsSimpleTextItem::Type:{\n         QGraphicsSimpleTextItem *item = new QGraphicsSimpleTextItem;\n         in >> item;\n         items << item;\n         break;\n      }\n      case QGraphicsRectItem::Type:{\n         QGraphicsRectItem *item = new QGraphicsRectItem;\n         in >> item;\n         items << item;\n         break;\n      }\n      case QGraphicsPolygonItem::Type:{\n         QGraphicsPolygonItem *item = new QGraphicsPolygonItem;\n         in >> item;\n         items << item;\n         break;\n      }\n      case QGraphicsPathItem::Type:{\n         QGraphicsPathItem *item = new QGraphicsPathItem;\n         in >> item;\n         items << item;\n         break;\n      }\n      case QGraphicsPixmapItem::Type:{\n         QGraphicsPixmapItem *item = new QGraphicsPixmapItem;\n         in >> item;\n         items << item;\n         break;\n      }\n      }\n   }\n   return  items;\n}\n#endif\n\nint main(int argc, char *argv[])\n{\n   QCoreApplication a(argc, argv);\n\n   return a.exec();\n}\n#include \"main.moc\"\n<|endoftext|>"}
{"text":"<commit_before>\/**\n *  @copyright Copyright 2017 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 JPetTaskLooper.cpp\n *\/\n\n#include \"JPetTaskLooper.h\"\n#include \"JPetLoggerInclude.h\"\n#include \"JPetParams\/JPetParams.h\"\n#include \"JPetData\/JPetData.h\"\n\nJPetTaskLooper::JPetTaskLooper(const char* name, std::unique_ptr<JPetTask> subtask, Predicate isCondition):\n  JPetTask(name),\n  fIsCondition(isCondition)\n{\n  addSubTask(std::move(subtask));\n}\n\nbool JPetTaskLooper::init(const JPetParams& paramsI)\n{\n  fParams = paramsI;\n  return true;\n}\n\nbool JPetTaskLooper::run(const JPetDataInterface&)\n{\n  JPetDataInterface nullDataObject;\n  auto subTasks = getSubTasks();\n  if (subTasks.empty()) {\n    WARNING(\"No subtask defined in JPetTaskLooper\");\n  }\n  for (const auto& subTask : subTasks) {\n    if (!subTask) {\n      ERROR(\"some subTasks are nullptr\");\n      return false;\n    }\n  }\n  JPetParams inParams = fParams;\n  JPetParams outParams;\n  while (fIsCondition(inParams)) {\n    for (const auto& subTask : subTasks) {\n      subTask->init(inParams);\n      subTask->run(nullDataObject);\n      subTask->terminate(outParams);\n      inParams = outParams;\n    }\n  }\n  return true;\n}\n\nbool JPetTaskLooper::terminate(JPetParams& paramsO)\n{\n  paramsO = fParams;\n  return true;\n}\n\nvoid JPetTaskLooper::setConditionFunction(Predicate isCondition)\n{\n  fIsCondition = isCondition;\n}\n\n\nPredicate JPetTaskLooper::getMaxIterationPredicate(int maxIteration)\n{\n  assert(maxIteration >=0);\n  int counter = 0;\n  auto iterationFunction = [maxIteration, counter](const JPetParams&) mutable ->bool {\n    if (counter < maxIteration) {\n      counter++;\n      return true;\n    } else {\n      return false;\n    }\n  };\n  return iterationFunction;\n}\n\nPredicate JPetTaskLooper::getStopOnOptionPredicate(const std::string stopIterationOptName)\n{\n  auto stopFunction = [stopIterationOptName](const JPetParams& params)->bool {\n    using namespace jpet_options_tools;\n    auto options = params.getOptions();\n    bool continueIteration = isOptionSet(options, stopIterationOptName) && (!getOptionAsBool(options, stopIterationOptName));\n    return continueIteration;\n  };\n  return stopFunction;\n}\n<commit_msg>Add some error handling for subtasks calls<commit_after>\/**\n *  @copyright Copyright 2017 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 JPetTaskLooper.cpp\n *\/\n\n#include \"JPetTaskLooper.h\"\n#include \"JPetLoggerInclude.h\"\n#include \"JPetParams\/JPetParams.h\"\n#include \"JPetData\/JPetData.h\"\n\nJPetTaskLooper::JPetTaskLooper(const char* name, std::unique_ptr<JPetTask> subtask, Predicate isCondition):\n  JPetTask(name),\n  fIsCondition(isCondition)\n{\n  addSubTask(std::move(subtask));\n}\n\nbool JPetTaskLooper::init(const JPetParams& paramsI)\n{\n  fParams = paramsI;\n  return true;\n}\n\nbool JPetTaskLooper::run(const JPetDataInterface&)\n{\n  JPetDataInterface nullDataObject;\n  auto subTasks = getSubTasks();\n  if (subTasks.empty()) {\n    WARNING(\"No subtask defined in JPetTaskLooper\");\n  }\n  for (const auto& subTask : subTasks) {\n    if (!subTask) {\n      ERROR(\"some subTasks are nullptr\");\n      return false;\n    }\n  }\n  JPetParams inParams = fParams;\n  JPetParams outParams;\n  while (fIsCondition(inParams)) {\n    for (const auto& subTask : subTasks) {\n      auto isOk = subTask->init(inParams);\n      if (!isOk) {\n        ERROR(\"Errors in subtask init(). run() and terminate() calls will be skipped. \");\n        continue;\n      }\n      subTask->run(nullDataObject);\n      isOk = subTask->terminate(outParams);\n      if (!isOk) {\n        ERROR(\"Errors in subtask terminate(). \");\n      }\n      inParams = outParams;\n    }\n  }\n  return true;\n}\n\nbool JPetTaskLooper::terminate(JPetParams& paramsO)\n{\n  paramsO = fParams;\n  return true;\n}\n\nvoid JPetTaskLooper::setConditionFunction(Predicate isCondition)\n{\n  fIsCondition = isCondition;\n}\n\n\nPredicate JPetTaskLooper::getMaxIterationPredicate(int maxIteration)\n{\n  assert(maxIteration >= 0);\n  int counter = 0;\n  auto iterationFunction = [maxIteration, counter](const JPetParams&) mutable ->bool {\n    if (counter < maxIteration)\n    {\n      counter++;\n      return true;\n    } else {\n      return false;\n    }\n  };\n  return iterationFunction;\n}\n\nPredicate JPetTaskLooper::getStopOnOptionPredicate(const std::string stopIterationOptName)\n{\n  auto stopFunction = [stopIterationOptName](const JPetParams & params)->bool {\n    using namespace jpet_options_tools;\n    auto options = params.getOptions();\n    bool continueIteration = isOptionSet(options, stopIterationOptName) && (!getOptionAsBool(options, stopIterationOptName));\n    return continueIteration;\n  };\n  return stopFunction;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>ncsid: Guarantee MAC override<commit_after><|endoftext|>"}
{"text":"<commit_before>\n#include \"base\/not_null.hpp\"\n\n#include <memory>\n#include <utility>\n#include <string>\n#include <vector>\n\n#include \"base\/macros.hpp\"\n#include \"gtest\/gtest.h\"\n#include \"gmock\/gmock.h\"\n\nusing testing::Eq;\n\nnamespace principia {\nnamespace base {\n\nclass NotNullTest : public testing::Test {\n protected:\n  \/\/ A very convoluted wrapper for the x86 add...\n  void Add(not_null<int*> const destination,\n           not_null<int const*> const source) {\n    *destination += *source;\n  }\n  void Sub(not_null<int*> const destination,\n           not_null<int const*> const source) {\n    *destination -= *source;\n  }\n};\n\nusing NotNullDeathTest = NotNullTest;\n\nTEST_F(NotNullDeathTest, DeathByNullptr) {\n  EXPECT_DEATH({\n    int* const null_int_ptr = nullptr;\n    check_not_null(null_int_ptr);\n  }, \"Check failed: .* != nullptr\");\n  EXPECT_DEATH({\n    std::unique_ptr<int> null_int_ptr;\n    check_not_null(std::move(null_int_ptr));\n  }, \"Check failed: .* != nullptr\");\n}\n\nTEST_F(NotNullTest, Move) {\n  not_null<std::unique_ptr<int>> int_ptr1 = make_not_null_unique<int>(3);\n#if !PRINCIPIA_COMPILER_MSVC || \\\n    !(_MSC_FULL_VER == 190'023'506 || \\\n      _MSC_FULL_VER == 190'023'918 || \\\n      _MSC_FULL_VER == 190'024'210 || \\\n      _MSC_FULL_VER == 190'024'213 || \\\n      _MSC_FULL_VER == 190'024'215 || \\\n      _MSC_FULL_VER == 191'326'215 || \\\n      _MSC_FULL_VER == 191'426'316 || \\\n      _MSC_FULL_VER == 191'426'412 || \\\n      _MSC_FULL_VER == 191'426'428 || \\\n      _MSC_FULL_VER == 191'426'429 || \\\n      _MSC_FULL_VER == 191'526'608 || \\\n      _MSC_FULL_VER == 191'526'731 || \\\n      _MSC_FULL_VER == 191'627'024 || \\\n      _MSC_FULL_VER == 191'627'025 || \\\n      _MSC_FULL_VER == 191'627'027 || \\\n      _MSC_FULL_VER == 192'027'508 || \\\n      _MSC_FULL_VER == 192'227'706 || \\\n      _MSC_FULL_VER == 192'227'724 || \\\n      _MSC_FULL_VER == 192'227'905 || \\\n      _MSC_FULL_VER == 192'328'106 || \\\n      _MSC_FULL_VER == 192'428'314)\n  EXPECT_THAT(*(std::unique_ptr<int> const&)int_ptr1, Eq(3));\n#endif\n  not_null<std::unique_ptr<int>> int_ptr2 = std::move(int_ptr1);\n  EXPECT_THAT(*int_ptr2, Eq(3));\n  not_null<std::unique_ptr<int>> int_ptr3(std::move(int_ptr2));\n  EXPECT_THAT(*int_ptr3, Eq(3));\n  int_ptr2 = make_not_null_unique<int>(5);\n  EXPECT_THAT(*int_ptr2, Eq(5));\n  int_ptr2 = std::move(int_ptr3);\n  EXPECT_THAT(*int_ptr2, Eq(3));\n}\n\nTEST_F(NotNullTest, Copy) {\n  std::unique_ptr<int> const owner_of_three = std::make_unique<int>(3);\n  std::unique_ptr<int> const owner_of_five = std::make_unique<int>(5);\n  not_null<int*> const int_ptr1 = check_not_null(owner_of_three.get());\n  not_null<int*> int_ptr2 = int_ptr1;\n  not_null<int*> const int_ptr3(int_ptr2);\n  EXPECT_THAT(int_ptr1, Eq(owner_of_three.get()));\n  EXPECT_THAT(int_ptr2, Eq(owner_of_three.get()));\n  EXPECT_THAT(int_ptr3, Eq(owner_of_three.get()));\n  EXPECT_THAT(*int_ptr1, Eq(3));\n  EXPECT_THAT(*int_ptr2, Eq(3));\n  EXPECT_THAT(*int_ptr3, Eq(3));\n  int_ptr2 = check_not_null(owner_of_five.get());\n  EXPECT_THAT(*int_ptr2, Eq(5));\n  int_ptr2 = int_ptr3;\n  EXPECT_THAT(*int_ptr2, Eq(3));\n  EXPECT_THAT(*int_ptr3, Eq(3));\n}\n\nTEST_F(NotNullTest, CheckNotNull) {\n#if 0\n  std::unique_ptr<int> owner_int = std::make_unique<int>(3);\n  int* const constant_access_int = owner_int.get();\n  not_null<int*> const constant_not_null_access_int =\n      check_not_null(constant_access_int);\n  check_not_null(constant_not_null_access_int);\n  not_null<std::unique_ptr<int>> not_null_owner_int =\n      check_not_null(std::move(owner_int));\n  check_not_null(std::move(not_null_owner_int));\n#endif\n}\n\nTEST_F(NotNullTest, Booleans) {\n  not_null<std::unique_ptr<int>> const pointer = make_not_null_unique<int>(3);\n  EXPECT_TRUE(pointer);\n  EXPECT_TRUE(pointer != nullptr);\n  EXPECT_FALSE(pointer == nullptr);\n}\n\nTEST_F(NotNullTest, ImplicitConversions) {\n  not_null<std::unique_ptr<int>> not_null_owner_int =\n      make_not_null_unique<int>(3);\n  not_null<int const*> const constant_not_null_access_int =\n      not_null_owner_int.get();\n  \/\/ Copy constructor.\n  not_null<int const*> not_null_access_constant_int =\n      constant_not_null_access_int;\n  \/\/ Copy assignment.\n  not_null_access_constant_int = not_null_owner_int.get();\n  \/\/ Move constructor.\n  not_null<std::unique_ptr<int const>> not_null_owner_constant_int =\n      make_not_null_unique<int>(5);\n  \/\/ Move assignment.\n  not_null_owner_constant_int = std::move(not_null_owner_int);\n}\n\nTEST_F(NotNullTest, Arrow) {\n  not_null<std::unique_ptr<std::string>> not_null_owner_string =\n      make_not_null_unique<std::string>(\"-\");\n  not_null_owner_string->append(\">\");\n  EXPECT_THAT(*not_null_owner_string, Eq(\"->\"));\n  not_null<std::string*> not_null_access_string = not_null_owner_string.get();\n  not_null_access_string->insert(0, \"operator\");\n  EXPECT_THAT(*not_null_access_string, Eq(\"operator->\"));\n}\n\nTEST_F(NotNullTest, NotNullNotNull) {\n  not_null<std::unique_ptr<int>> owner = make_not_null_unique<int>(42);\n  not_null<not_null<int*>> x = owner.get();\n  not_null<int*> y = x;\n  *x = 6 * 9;\n  EXPECT_THAT(*owner, Eq(6 * 9));\n  EXPECT_THAT(*x, Eq(6 * 9));\n  EXPECT_THAT(*y, Eq(6 * 9));\n}\n\nTEST_F(NotNullTest, CheckArguments) {\n  not_null<std::unique_ptr<int>> accumulator = make_not_null_unique<int>(21);\n  std::unique_ptr<int const> twenty_one = std::make_unique<int const>(21);\n  Add(accumulator.get(), check_not_null(twenty_one.get()));\n  EXPECT_THAT(*twenty_one, Eq(21));\n  EXPECT_THAT(*accumulator, Eq(42));\n#if 0\n  Sub(check_not_null(accumulator.get()), check_not_null(twenty_one.get()));\n  EXPECT_THAT(*accumulator, Eq(21));\n#endif\n}\n\nTEST_F(NotNullTest, DynamicCast) {\n  class Base {\n   public:\n    virtual ~Base() = default;\n  };\n  class Derived : public Base {};\n  {\n    not_null<Base*> b = new Derived;\n    [[maybe_unused]] not_null<Derived*> d = dynamic_cast_not_null<Derived*>(b);\n    delete b;\n  }\n  {\n    not_null<std::unique_ptr<Base>> b = make_not_null_unique<Derived>();\n    not_null<std::unique_ptr<Derived>> d =\n        dynamic_cast_not_null<std::unique_ptr<Derived>>(std::move(b));\n  }\n}\n\nTEST_F(NotNullTest, RValue) {\n  std::unique_ptr<int> owner_int = std::make_unique<int>(1);\n  not_null<int*> not_null_int = new int(2);\n  EXPECT_NE(owner_int.get(), not_null_int);\n\n  not_null<std::unique_ptr<int>> not_null_owner_int =\n      make_not_null_unique<int>(4);\n  std::vector<int*> v1;\n  \/\/ |v1.push_back| would be ambiguous here if |not_null<pointer>| had an\n  \/\/ |operator pointer const&() const&| instead of an\n  \/\/ |operator pointer const&&() const&|.\n  v1.push_back(not_null_owner_int.get());\n  \/\/ |emplace_back| is fine no matter what.\n  v1.emplace_back(not_null_owner_int.get());\n  EXPECT_EQ(4, *v1[0]);\n  EXPECT_EQ(4, *not_null_owner_int);\n\n  std::vector<int*> v2;\n  \/\/ NOTE(egg): The following fails using clang, I'm not sure where the bug is.\n  \/\/ More generally, if functions |foo(int*&&)| and |foo(int* const&)| exist,\n  \/\/ |foo(non_rvalue_not_null)| fails to compile with clang (\"no viable\n  \/\/ conversion\"), but without the |foo(int*&&)| overload it compiles.\n  \/\/ This is easily circumvented using a temporary (whereas the ambiguity that\n  \/\/ would result from having an |operator pointer const&() const&| would\n  \/\/ entirely prevent conversion of |not_null<unique_ptr<T>>| to\n  \/\/ |unique_ptr<T>|), so we ignore it.\n#if PRINCIPIA_COMPILER_MSVC\n  v2.push_back(not_null_int);\n#else\n  int* const temporary = not_null_int;\n  v2.push_back(temporary);\n#endif\n  EXPECT_EQ(2, *v2[0]);\n  EXPECT_EQ(2, *not_null_int);\n\n  \/\/ |std::unique_ptr<int>::operator=| would be ambiguous here between the move\n  \/\/ and copy assignments if |not_null<pointer>| had an\n  \/\/ |operator pointer const&() const&| instead of an\n  \/\/ |operator pointer const&&() const&|.\n  \/\/ Note that one of the overloads (the implicit copy assignment operator) is\n  \/\/ deleted, but this does not matter for overload resolution; however MSVC\n  \/\/ compiles this even when it is ambiguous, while clang correctly fails.\n  owner_int = make_not_null_unique<int>(1729);\n\n  not_null<int*> not_null_access_int = owner_int.get();\n  [[maybe_unused]] int const* access_const_int = not_null_access_int;\n\n  not_null<std::shared_ptr<int>> not_null_shared_int = std::make_shared<int>(3);\n  \/\/ This exercises |operator OtherPointer() const&|.  The conversion from\n  \/\/ |not_null<int*>| to |int const*| does not; instead it goes through the\n  \/\/ conversion |not_null<int*>| -> |int*| -> |int const*|, where the latter is\n  \/\/ a qualification adjustment, part of a standard conversion sequence.\n  std::shared_ptr<int const> shared_const_int = not_null_shared_int;\n\n  \/\/ MSVC seems to be confused by templatized move-conversion operators.\n#if PRINCIPIA_COMPILER_MSVC\n  \/\/ Uses |not_null(not_null<OtherPointer>&& other)| followed by\n  \/\/ |operator pointer&&() &&|, so the first conversion has to be explicit.\n  std::unique_ptr<int const> owner_const_int =\n      static_cast<not_null<std::unique_ptr<int const>>>(\n          make_not_null_unique<int>(5));\n#else\n  \/\/ Uses |operator OtherPointer() &&|.\n  std::unique_ptr<int const> owner_const_int = make_not_null_unique<int>(5);\n#endif\n  EXPECT_EQ(5, *owner_const_int);\n}\n\n}  \/\/ namespace base\n}  \/\/ namespace principia\n<commit_msg>Upgrade to 1.4.4.<commit_after>\n#include \"base\/not_null.hpp\"\n\n#include <memory>\n#include <utility>\n#include <string>\n#include <vector>\n\n#include \"base\/macros.hpp\"\n#include \"gtest\/gtest.h\"\n#include \"gmock\/gmock.h\"\n\nusing testing::Eq;\n\nnamespace principia {\nnamespace base {\n\nclass NotNullTest : public testing::Test {\n protected:\n  \/\/ A very convoluted wrapper for the x86 add...\n  void Add(not_null<int*> const destination,\n           not_null<int const*> const source) {\n    *destination += *source;\n  }\n  void Sub(not_null<int*> const destination,\n           not_null<int const*> const source) {\n    *destination -= *source;\n  }\n};\n\nusing NotNullDeathTest = NotNullTest;\n\nTEST_F(NotNullDeathTest, DeathByNullptr) {\n  EXPECT_DEATH({\n    int* const null_int_ptr = nullptr;\n    check_not_null(null_int_ptr);\n  }, \"Check failed: .* != nullptr\");\n  EXPECT_DEATH({\n    std::unique_ptr<int> null_int_ptr;\n    check_not_null(std::move(null_int_ptr));\n  }, \"Check failed: .* != nullptr\");\n}\n\nTEST_F(NotNullTest, Move) {\n  not_null<std::unique_ptr<int>> int_ptr1 = make_not_null_unique<int>(3);\n#if !PRINCIPIA_COMPILER_MSVC || \\\n    !(_MSC_FULL_VER == 190'023'506 || \\\n      _MSC_FULL_VER == 190'023'918 || \\\n      _MSC_FULL_VER == 190'024'210 || \\\n      _MSC_FULL_VER == 190'024'213 || \\\n      _MSC_FULL_VER == 190'024'215 || \\\n      _MSC_FULL_VER == 191'326'215 || \\\n      _MSC_FULL_VER == 191'426'316 || \\\n      _MSC_FULL_VER == 191'426'412 || \\\n      _MSC_FULL_VER == 191'426'428 || \\\n      _MSC_FULL_VER == 191'426'429 || \\\n      _MSC_FULL_VER == 191'526'608 || \\\n      _MSC_FULL_VER == 191'526'731 || \\\n      _MSC_FULL_VER == 191'627'024 || \\\n      _MSC_FULL_VER == 191'627'025 || \\\n      _MSC_FULL_VER == 191'627'027 || \\\n      _MSC_FULL_VER == 192'027'508 || \\\n      _MSC_FULL_VER == 192'227'706 || \\\n      _MSC_FULL_VER == 192'227'724 || \\\n      _MSC_FULL_VER == 192'227'905 || \\\n      _MSC_FULL_VER == 192'328'106 || \\\n      _MSC_FULL_VER == 192'428'314 || \\\n      _MSC_FULL_VER == 192'428'316)\n  EXPECT_THAT(*(std::unique_ptr<int> const&)int_ptr1, Eq(3));\n#endif\n  not_null<std::unique_ptr<int>> int_ptr2 = std::move(int_ptr1);\n  EXPECT_THAT(*int_ptr2, Eq(3));\n  not_null<std::unique_ptr<int>> int_ptr3(std::move(int_ptr2));\n  EXPECT_THAT(*int_ptr3, Eq(3));\n  int_ptr2 = make_not_null_unique<int>(5);\n  EXPECT_THAT(*int_ptr2, Eq(5));\n  int_ptr2 = std::move(int_ptr3);\n  EXPECT_THAT(*int_ptr2, Eq(3));\n}\n\nTEST_F(NotNullTest, Copy) {\n  std::unique_ptr<int> const owner_of_three = std::make_unique<int>(3);\n  std::unique_ptr<int> const owner_of_five = std::make_unique<int>(5);\n  not_null<int*> const int_ptr1 = check_not_null(owner_of_three.get());\n  not_null<int*> int_ptr2 = int_ptr1;\n  not_null<int*> const int_ptr3(int_ptr2);\n  EXPECT_THAT(int_ptr1, Eq(owner_of_three.get()));\n  EXPECT_THAT(int_ptr2, Eq(owner_of_three.get()));\n  EXPECT_THAT(int_ptr3, Eq(owner_of_three.get()));\n  EXPECT_THAT(*int_ptr1, Eq(3));\n  EXPECT_THAT(*int_ptr2, Eq(3));\n  EXPECT_THAT(*int_ptr3, Eq(3));\n  int_ptr2 = check_not_null(owner_of_five.get());\n  EXPECT_THAT(*int_ptr2, Eq(5));\n  int_ptr2 = int_ptr3;\n  EXPECT_THAT(*int_ptr2, Eq(3));\n  EXPECT_THAT(*int_ptr3, Eq(3));\n}\n\nTEST_F(NotNullTest, CheckNotNull) {\n#if 0\n  std::unique_ptr<int> owner_int = std::make_unique<int>(3);\n  int* const constant_access_int = owner_int.get();\n  not_null<int*> const constant_not_null_access_int =\n      check_not_null(constant_access_int);\n  check_not_null(constant_not_null_access_int);\n  not_null<std::unique_ptr<int>> not_null_owner_int =\n      check_not_null(std::move(owner_int));\n  check_not_null(std::move(not_null_owner_int));\n#endif\n}\n\nTEST_F(NotNullTest, Booleans) {\n  not_null<std::unique_ptr<int>> const pointer = make_not_null_unique<int>(3);\n  EXPECT_TRUE(pointer);\n  EXPECT_TRUE(pointer != nullptr);\n  EXPECT_FALSE(pointer == nullptr);\n}\n\nTEST_F(NotNullTest, ImplicitConversions) {\n  not_null<std::unique_ptr<int>> not_null_owner_int =\n      make_not_null_unique<int>(3);\n  not_null<int const*> const constant_not_null_access_int =\n      not_null_owner_int.get();\n  \/\/ Copy constructor.\n  not_null<int const*> not_null_access_constant_int =\n      constant_not_null_access_int;\n  \/\/ Copy assignment.\n  not_null_access_constant_int = not_null_owner_int.get();\n  \/\/ Move constructor.\n  not_null<std::unique_ptr<int const>> not_null_owner_constant_int =\n      make_not_null_unique<int>(5);\n  \/\/ Move assignment.\n  not_null_owner_constant_int = std::move(not_null_owner_int);\n}\n\nTEST_F(NotNullTest, Arrow) {\n  not_null<std::unique_ptr<std::string>> not_null_owner_string =\n      make_not_null_unique<std::string>(\"-\");\n  not_null_owner_string->append(\">\");\n  EXPECT_THAT(*not_null_owner_string, Eq(\"->\"));\n  not_null<std::string*> not_null_access_string = not_null_owner_string.get();\n  not_null_access_string->insert(0, \"operator\");\n  EXPECT_THAT(*not_null_access_string, Eq(\"operator->\"));\n}\n\nTEST_F(NotNullTest, NotNullNotNull) {\n  not_null<std::unique_ptr<int>> owner = make_not_null_unique<int>(42);\n  not_null<not_null<int*>> x = owner.get();\n  not_null<int*> y = x;\n  *x = 6 * 9;\n  EXPECT_THAT(*owner, Eq(6 * 9));\n  EXPECT_THAT(*x, Eq(6 * 9));\n  EXPECT_THAT(*y, Eq(6 * 9));\n}\n\nTEST_F(NotNullTest, CheckArguments) {\n  not_null<std::unique_ptr<int>> accumulator = make_not_null_unique<int>(21);\n  std::unique_ptr<int const> twenty_one = std::make_unique<int const>(21);\n  Add(accumulator.get(), check_not_null(twenty_one.get()));\n  EXPECT_THAT(*twenty_one, Eq(21));\n  EXPECT_THAT(*accumulator, Eq(42));\n#if 0\n  Sub(check_not_null(accumulator.get()), check_not_null(twenty_one.get()));\n  EXPECT_THAT(*accumulator, Eq(21));\n#endif\n}\n\nTEST_F(NotNullTest, DynamicCast) {\n  class Base {\n   public:\n    virtual ~Base() = default;\n  };\n  class Derived : public Base {};\n  {\n    not_null<Base*> b = new Derived;\n    [[maybe_unused]] not_null<Derived*> d = dynamic_cast_not_null<Derived*>(b);\n    delete b;\n  }\n  {\n    not_null<std::unique_ptr<Base>> b = make_not_null_unique<Derived>();\n    not_null<std::unique_ptr<Derived>> d =\n        dynamic_cast_not_null<std::unique_ptr<Derived>>(std::move(b));\n  }\n}\n\nTEST_F(NotNullTest, RValue) {\n  std::unique_ptr<int> owner_int = std::make_unique<int>(1);\n  not_null<int*> not_null_int = new int(2);\n  EXPECT_NE(owner_int.get(), not_null_int);\n\n  not_null<std::unique_ptr<int>> not_null_owner_int =\n      make_not_null_unique<int>(4);\n  std::vector<int*> v1;\n  \/\/ |v1.push_back| would be ambiguous here if |not_null<pointer>| had an\n  \/\/ |operator pointer const&() const&| instead of an\n  \/\/ |operator pointer const&&() const&|.\n  v1.push_back(not_null_owner_int.get());\n  \/\/ |emplace_back| is fine no matter what.\n  v1.emplace_back(not_null_owner_int.get());\n  EXPECT_EQ(4, *v1[0]);\n  EXPECT_EQ(4, *not_null_owner_int);\n\n  std::vector<int*> v2;\n  \/\/ NOTE(egg): The following fails using clang, I'm not sure where the bug is.\n  \/\/ More generally, if functions |foo(int*&&)| and |foo(int* const&)| exist,\n  \/\/ |foo(non_rvalue_not_null)| fails to compile with clang (\"no viable\n  \/\/ conversion\"), but without the |foo(int*&&)| overload it compiles.\n  \/\/ This is easily circumvented using a temporary (whereas the ambiguity that\n  \/\/ would result from having an |operator pointer const&() const&| would\n  \/\/ entirely prevent conversion of |not_null<unique_ptr<T>>| to\n  \/\/ |unique_ptr<T>|), so we ignore it.\n#if PRINCIPIA_COMPILER_MSVC\n  v2.push_back(not_null_int);\n#else\n  int* const temporary = not_null_int;\n  v2.push_back(temporary);\n#endif\n  EXPECT_EQ(2, *v2[0]);\n  EXPECT_EQ(2, *not_null_int);\n\n  \/\/ |std::unique_ptr<int>::operator=| would be ambiguous here between the move\n  \/\/ and copy assignments if |not_null<pointer>| had an\n  \/\/ |operator pointer const&() const&| instead of an\n  \/\/ |operator pointer const&&() const&|.\n  \/\/ Note that one of the overloads (the implicit copy assignment operator) is\n  \/\/ deleted, but this does not matter for overload resolution; however MSVC\n  \/\/ compiles this even when it is ambiguous, while clang correctly fails.\n  owner_int = make_not_null_unique<int>(1729);\n\n  not_null<int*> not_null_access_int = owner_int.get();\n  [[maybe_unused]] int const* access_const_int = not_null_access_int;\n\n  not_null<std::shared_ptr<int>> not_null_shared_int = std::make_shared<int>(3);\n  \/\/ This exercises |operator OtherPointer() const&|.  The conversion from\n  \/\/ |not_null<int*>| to |int const*| does not; instead it goes through the\n  \/\/ conversion |not_null<int*>| -> |int*| -> |int const*|, where the latter is\n  \/\/ a qualification adjustment, part of a standard conversion sequence.\n  std::shared_ptr<int const> shared_const_int = not_null_shared_int;\n\n  \/\/ MSVC seems to be confused by templatized move-conversion operators.\n#if PRINCIPIA_COMPILER_MSVC\n  \/\/ Uses |not_null(not_null<OtherPointer>&& other)| followed by\n  \/\/ |operator pointer&&() &&|, so the first conversion has to be explicit.\n  std::unique_ptr<int const> owner_const_int =\n      static_cast<not_null<std::unique_ptr<int const>>>(\n          make_not_null_unique<int>(5));\n#else\n  \/\/ Uses |operator OtherPointer() &&|.\n  std::unique_ptr<int const> owner_const_int = make_not_null_unique<int>(5);\n#endif\n  EXPECT_EQ(5, *owner_const_int);\n}\n\n}  \/\/ namespace base\n}  \/\/ namespace principia\n<|endoftext|>"}
{"text":"<commit_before>extern \"C\" {\n#include \"ets_sys.h\"\n#include <gpio.h>\n#include <os_type.h>\n#include <osapi.h>\n#include <mem.h>\n#include <user_interface.h>\n#include \"ets_rom.h\"\n}\n\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <fcntl.h>\n\n#include \"os\/os.h\"\n#include \"utils\/blinker.h\"\n#include \"hardware.hxx\"\n#include \"freertos\/bootloader_hal.h\"\n\nnamespace nmranet {\nextern char CONFIG_FILENAME[];\n}\n\nextern \"C\" {\n\nextern void ets_delay_us(uint32_t us);\n\nvoid resetblink(uint32_t pattern)\n{\n    if (pattern)\n    {\n        HW::BLINKER_RAW_Pin::set(!HW::blinker_invert);\n    }\n    else\n    {\n        HW::BLINKER_RAW_Pin::set(HW::blinker_invert);\n    }\n}\n\nvoid setblink(uint32_t pattern)\n{\n    resetblink(pattern);\n}\n\nvoid __attribute__((noreturn)) diewith(uint32_t pattern)\n{\n    extern void ets_wdt_disable();\n    ets_wdt_disable();\n    uint32_t p = 0;\n    while(true) {\n        if (p & 1) {\n            HW::BLINKER_RAW_Pin::set(!HW::blinker_invert);\n        } else {\n            HW::BLINKER_RAW_Pin::set(HW::blinker_invert);\n        }\n        p >>= 1;\n        if (!p) p = pattern;\n        ets_delay_us(125000);\n    }\n    \/*\n    resetblink(pattern);\n    while (1)\n    ;*\/\n}\n\nvoid ICACHE_FLASH_ATTR abort() {\n    diewith(BLINK_DIE_ABORT);\n}\n\nvoid ICACHE_FLASH_ATTR usleep(useconds_t sleep_usec)\n{\n    ets_delay_us(sleep_usec);\n}\n\n\/\/static os_event_t appl_task_event[1];\n\nvoid ICACHE_FLASH_ATTR appl_task(os_event_t *e)\n{\n    static int argc = 0;\n    static char **argv = {0};\n    appl_main(argc, argv);\n}\n\nstruct _reent* _impure_ptr = nullptr;\n\nchar noerror[] = \"strerror output\";\n\nchar* strerror(int) {\n    return noerror;\n}\n\nextern void (*__init_array_start)(void);\nextern void (*__init_array_end)(void);\n\nstatic void do_global_ctors(void) {\n    void (**p)(void);\n    for(p = &__init_array_start; p != &__init_array_end; ++p)\n        (*p)();\n}\n\nextern void spiffs_init();\n\nvoid init_done() {\n    system_set_os_print(1);\n    \/\/gdb_init();\n    do_global_ctors();\n    spiffs_init();\n    \/\/ Try to open the config file\n    int fd = ::open(nmranet::CONFIG_FILENAME, O_RDONLY);\n    if (fd < 0) fd = ::open(nmranet::CONFIG_FILENAME, O_CREAT|O_TRUNC|O_RDWR);\n    if (fd < 0) {\n        printf(\"Formatting the SPIFFS fs.\");\n        extern void esp_spiffs_deinit(uint8_t);\n        esp_spiffs_deinit(1);\n        spiffs_init();\n    }\n\n    appl_task(nullptr);\n}\n\nextern \"C\" void system_restart_local();\n\nvoid reboot_now() {\n    system_restart_local();\n}\n\nvoid reboot() {\n    system_restart_local();\n}\n\nvoid enter_bootloader() {\n    extern uint32_t __bootloader_magic_ptr;\n    __bootloader_magic_ptr = REQUEST_BOOTLOADER;\n    \n    system_restart_local();\n}\n\nvoid ICACHE_FLASH_ATTR user_init()\n{\n    gpio_init();\n    HW::BLINKER_RAW_Pin::hw_init();\n    HW::BLINKER_RAW_Pin::hw_set_to_safe();\n    HW::GpioBootloaderInit::hw_init();\n\n    \/\/uart_div_modify(0, UART_CLK_FREQ \/ (74880));\n    uart_div_modify(0, UART_CLK_FREQ \/ (115200));\n\n    \/\/abort();\n\n    \/\/uart_init(74880, 74880);\n\n    os_printf(\"hello,world\\n\");\n    \/\/ init gpio subsytem\n    system_init_done_cb(&init_done);\n\n    \/\/ static os_task_t appl_task_struct;\n    \/\/ system_os_task(appl_task, USER_TASK_PRIO_0, appl_task_event, 1);\n\n}\n\n\n}  \/\/ extern \"C\"\n\nvoid log_output(char* buf, int size) {\n    if (size <= 0) return;\n    printf(\"%s\\n\", buf);\n}\n<commit_msg>Adds more debugging.<commit_after>extern \"C\" {\n#include \"ets_sys.h\"\n#include <gpio.h>\n#include <os_type.h>\n#include <osapi.h>\n#include <mem.h>\n#include <user_interface.h>\n#include \"ets_rom.h\"\n}\n\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <fcntl.h>\n\n#include \"os\/os.h\"\n#include \"utils\/blinker.h\"\n#include \"hardware.hxx\"\n#include \"freertos\/bootloader_hal.h\"\n\nnamespace nmranet {\nextern char CONFIG_FILENAME[];\n}\n\nextern \"C\" {\n\nextern void ets_delay_us(uint32_t us);\n\nvoid resetblink(uint32_t pattern)\n{\n    if (pattern)\n    {\n        HW::BLINKER_RAW_Pin::set(!HW::blinker_invert);\n    }\n    else\n    {\n        HW::BLINKER_RAW_Pin::set(HW::blinker_invert);\n    }\n}\n\nvoid setblink(uint32_t pattern)\n{\n    resetblink(pattern);\n}\n\nvoid __attribute__((noreturn)) diewith(uint32_t pattern)\n{\n    extern void ets_wdt_disable();\n    ets_wdt_disable();\n    uint32_t p = 0;\n    while(true) {\n        if (p & 1) {\n            HW::BLINKER_RAW_Pin::set(!HW::blinker_invert);\n        } else {\n            HW::BLINKER_RAW_Pin::set(HW::blinker_invert);\n        }\n        p >>= 1;\n        if (!p) p = pattern;\n        ets_delay_us(125000);\n    }\n    \/*\n    resetblink(pattern);\n    while (1)\n    ;*\/\n}\n\nvoid ICACHE_FLASH_ATTR abort() {\n    diewith(BLINK_DIE_ABORT);\n}\n\nvoid ICACHE_FLASH_ATTR usleep(useconds_t sleep_usec)\n{\n    ets_delay_us(sleep_usec);\n}\n\n\/\/static os_event_t appl_task_event[1];\n\nvoid ICACHE_FLASH_ATTR appl_task(os_event_t *e)\n{\n    static int argc = 0;\n    static char **argv = {0};\n    appl_main(argc, argv);\n}\n\nstruct _reent* _impure_ptr = nullptr;\n\nchar noerror[] = \"strerror output\";\n\nchar* strerror(int) {\n    return noerror;\n}\n\nextern void (*__init_array_start)(void);\nextern void (*__init_array_end)(void);\n\nstatic void do_global_ctors(void) {\n    void (**p)(void);\n    for(p = &__init_array_start; p != &__init_array_end; ++p)\n        (*p)();\n}\n\nextern void spiffs_init();\n\nvoid init_done() {\n    system_set_os_print(1);\n    \/\/gdb_init();\n    do_global_ctors();\n    spiffs_init();\n    \/\/ Try to open the config file\n    int fd = ::open(nmranet::CONFIG_FILENAME, O_RDONLY);\n    if (fd < 0) fd = ::open(nmranet::CONFIG_FILENAME, O_CREAT|O_TRUNC|O_RDWR);\n    if (fd < 0) {\n        printf(\"Formatting the SPIFFS fs.\");\n        extern void esp_spiffs_deinit(uint8_t);\n        esp_spiffs_deinit(1);\n        spiffs_init();\n    }\n\n    printf(\"userinit pinout: B hi %d; B lo %d; A hi %d; A lo %d;\\n\",\n           HW::MOT_B_HI_Pin::PIN, \n           HW::MOT_B_LO_Pin::PIN, \n           HW::MOT_A_HI_Pin::PIN, \n           HW::MOT_A_LO_Pin::PIN);\n    appl_task(nullptr);\n}\n\nextern \"C\" void system_restart_local();\n\nvoid reboot_now() {\n    system_restart_local();\n}\n\nvoid reboot() {\n    system_restart_local();\n}\n\nvoid enter_bootloader() {\n    extern uint32_t __bootloader_magic_ptr;\n    __bootloader_magic_ptr = REQUEST_BOOTLOADER;\n    \n    system_restart_local();\n}\n\nvoid ICACHE_FLASH_ATTR user_init()\n{\n    gpio_init();\n    HW::BLINKER_RAW_Pin::hw_init();\n    HW::BLINKER_RAW_Pin::hw_set_to_safe();\n    HW::GpioBootloaderInit::hw_init();\n\n    \/\/uart_div_modify(0, UART_CLK_FREQ \/ (74880));\n    uart_div_modify(0, UART_CLK_FREQ \/ (115200));\n\n    \/\/abort();\n\n    \/\/uart_init(74880, 74880);\n\n    os_printf(\"hello,world\\n\");\n    \/\/ init gpio subsytem\n    system_init_done_cb(&init_done);\n\n    \/\/ static os_task_t appl_task_struct;\n    \/\/ system_os_task(appl_task, USER_TASK_PRIO_0, appl_task_event, 1);\n\n}\n\n\n}  \/\/ extern \"C\"\n\nvoid log_output(char* buf, int size) {\n    if (size <= 0) return;\n    printf(\"%s\\n\", buf);\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\r\n#include <functional>\r\n#include <string>\r\n#include <type_traits>\r\n\r\n#include \"maths\/maths.hpp\"\r\n\r\ntemplate<typename T>\r\nclass Rational {\r\npublic:\r\n\tstatic_assert(std::is_integral<T>::value, \"Base type of Rational must be an integral.\");\r\n\r\n\tconstexpr Rational() : Rational(0) {}\r\n\tconstexpr Rational(const T a) : a_(a), b_(1) {}\r\n\tRational(const T a, const T b) : a_(a), b_(b) {\r\n\t\tnormalize();\r\n\t}\r\n\r\n\tvoid swap(Rational& rhs) {\r\n\t\tstd::swap(a_, rhs.a_);\r\n\t\tstd::swap(b_, rhs.b_);\r\n\t}\r\n\r\n\tconstexpr operator bool() const {\r\n\t\treturn a_ != 0;\r\n\t}\r\n\r\n\tconstexpr operator T() const {\r\n\t\treturn to_int();\r\n\t}\r\n\r\n\tconstexpr operator long double() const {\r\n\t\treturn to_double();\r\n\t}\r\n\r\n\tstd::string to_string() const {\r\n\t\treturn std::to_string(a_) + \"\/\" + std::to_string(b_);\r\n\t}\r\n\r\n\tconstexpr bool operator !() const {\r\n\t\treturn a_ == 0;\r\n\t}\r\n\r\n\tconstexpr Rational operator -() const {\r\n\t\treturn negate();\r\n\t}\r\n\r\n\tconstexpr Rational operator +() const {\r\n\t\treturn{ a_, b_ };\r\n\t}\r\n\r\n\tRational& operator ++() {\r\n\t\ta_ += b_;\r\n\t\treturn *this;\r\n\t}\r\n\r\n\tRational operator ++(int) {\r\n\t\ta_ += b_;\r\n\t\treturn {a_ - b_, b_};\r\n\t}\r\n\r\n\tRational& operator --() {\r\n\t\ta_ -= b_;\r\n\t\treturn *this;\r\n\t}\r\n\r\n\tRational operator --(int) {\r\n\t\ta_ -= b_;\r\n\t\treturn{ a_ + b_, b_ };\r\n\t}\r\n\r\n\tconstexpr Rational add(const Rational& rhs) const {\r\n\t\treturn{ a_ * rhs.b_ + rhs.a_ * b_, b_ * rhs.b_ };\r\n\t}\r\n\r\n\tconstexpr Rational subtract(const Rational& rhs) const {\r\n\t\treturn add(rhs.negate());\r\n\t}\r\n\r\n\tconstexpr Rational multiply(const Rational& rhs) const {\r\n\t\treturn{ a_ * rhs.a_, b_ * rhs.b_ };\r\n\t}\r\n\r\n\tconstexpr Rational divide(const Rational& rhs) const {\r\n\t\treturn{ a_ * rhs.b_, b_ * rhs.a_ };\r\n\t}\r\n\r\n\tconstexpr Rational operator +(const Rational& rhs) const {\r\n\t\treturn add(rhs);\r\n\t}\r\n\r\n\tconstexpr Rational operator -(const Rational& rhs) const {\r\n\t\treturn subtract(rhs);\r\n\t}\r\n\r\n\tconstexpr Rational operator *(const Rational& rhs) const {\r\n\t\treturn multiply(rhs);\r\n\t}\r\n\r\n\tconstexpr Rational operator \/(const Rational& rhs) const {\r\n\t\treturn divide(rhs);\r\n\t}\r\n\r\n\tRational& operator +=(const Rational& rhs) {\r\n\t\tRational res = add(rhs);\r\n\t\tswap(res);\r\n\t\treturn *this;\r\n\t}\r\n\r\n\tRational& operator -=(const Rational& rhs) {\r\n\t\tRational res = subtract(rhs);\r\n\t\tswap(res);\r\n\t\treturn *this;\r\n\t}\r\n\r\n\tRational& operator *=(const Rational& rhs) {\r\n\t\tRational res = multiply(rhs);\r\n\t\tswap(res);\r\n\t\treturn *this;\r\n\t}\r\n\r\n\tRational& operator \/=(const Rational& x) {\r\n\t\tRational res = divide(rhs);\r\n\t\tswap(res);\r\n\t\treturn *this;\r\n\t}\r\n\r\n\tconstexpr friend bool operator ==(const Rational& lhs, const Rational& rhs) {\r\n\t\treturn lhs.a_ == rhs.a_ && lhs.b_ == rhs.b_;\r\n\t}\r\n\r\n\tconstexpr friend bool operator !=(const Rational& lhs, const Rational& rhs) {\r\n\t\treturn !(lhs == rhs);\r\n\t}\r\n\r\n\tconstexpr friend bool operator <(const Rational& lhs, const Rational& rhs) {\r\n\t\treturn lhs.a_ * rhs.b_ < lhs.a_ * rhs.b_;\r\n\t}\r\n\r\n\tconstexpr friend bool operator >(const Rational& lhs, const Rational& rhs) {\r\n\t\treturn rhs < lhs;\r\n\t}\r\n\r\n\tconstexpr friend bool operator <=(const Rational& lhs, const Rational& rhs) {\r\n\t\treturn lhs.a_ * rhs.b_ <= lhs.a_ * rhs.b_;\r\n\t}\r\n\r\n\tconstexpr friend bool operator >=(const Rational& lhs, const Rational& rhs) {\r\n\t\treturn rhs <= lhs;\r\n\t}\r\n\r\n\tfriend std::ostream& operator << (std::ostream& out, const Rational& rational) {\r\n\t\treturn out << rational.a_ << \" \" << rational.b_;\r\n\t}\r\n\r\n\tfriend std::istream& operator >> (std::istream& in, Rational& rational) {\r\n\t\tin >> rational .a_ >> rational.b_;\r\n\t\trational.normalize();\r\n\t\treturn in;\r\n\t}\r\n\r\n\tvoid normalize() {\r\n\t\tconst T g = gcd(a_, b_);\r\n\t\ta_ \/= g;\r\n\t\tb_ \/= g;\r\n\t\tif (b_ < 0) {\r\n\t\t\ta_ = -a_;\r\n\t\t\tb_ = -b_;\r\n\t\t}\r\n\t}\r\n\r\n\tvoid read_slash(std::istream& in) {\r\n\t\tchar ch;\r\n\t\tin >> a_ >> ch >> b_;\r\n\t\tnormalize();\r\n\t}\r\n\r\n\tvoid print_slash(std::ostream& out) const {\r\n\t\tout << a_ << \"\/\" << b_;\r\n\t}\r\n\r\n\tconstexpr Rational negate() const {\r\n\t\treturn{ -a_, b_ };\r\n\t}\r\n\r\n\tconstexpr Rational abs() const {\r\n\t\treturn a_ < 0 ? Rational(-a_, b_) : Rational(a_, b_);\r\n\t}\r\n\r\n\tconstexpr Rational inverse() const {\r\n\t\treturn{ b_, a_ };\r\n\t}\r\n\r\n\tconstexpr int sign() const {\r\n\t\treturn a_ < 0 ? -1 : static_cast<int>(a_ > 0);\r\n\t}\r\n\r\n\tconstexpr long double to_double() const {\r\n\t\treturn static_cast<long double>(a_) \/ b_;\r\n\t}\r\n\r\n\tconstexpr T to_int() const {\r\n\t\treturn a_ \/ b_;\r\n\t}\r\n\r\n\tconstexpr T floor() const {\r\n\t\treturn to_int();\r\n\t}\r\n\r\n\tconstexpr T ceil() const {\r\n\t\treturn static_cast<T>(ceil(to_double() - EPS));\r\n\t}\r\n\r\n\tconstexpr T round() const {\r\n\t\tconst long double cur = to_double();\r\n\t\treturn static_cast<T>(cur < 0 ? ceil(cur - 0.5 - EPS) : floor(cur + 0.5 + EPS));\r\n\t}\r\n\r\n\tconstexpr long double frac() const {\r\n\t\treturn to_double() - to_int();\r\n\t}\r\n\r\n\tconstexpr Rational pow(const ll n) const {\r\n\t\treturn{ binpow(a_, n), binpow(b_, n) };\r\n\t}\r\n\r\nprivate:\r\n\tT a_;\r\n\tT b_;\r\n\r\n};\r\n\r\nnamespace std {\r\n\r\ntemplate<typename T>\r\nstd::string to_string(const Rational<T>& arg) {\r\n\treturn arg.to_string();\r\n}\r\n\r\ntemplate<typename T>\r\nstruct hash<Rational<T>> {\r\n\tsize_t operator()(const Rational<T>& arg) const {\r\n\t\treturn hash<pair<T, T>>({ arg.a, arg.b });\r\n\t}\r\n};\r\n\r\ntemplate<typename T>\r\nvoid swap(Rational<T>& lhs, Rational<T>& rhs) {\r\n\tlhs.swap(rhs);\r\n}\r\n\r\n}\r\n<commit_msg>Updated Rational class.<commit_after>#pragma once\r\n#include <functional>\r\n#include <string>\r\n#include <type_traits>\r\n\r\n#include \"maths\/maths.hpp\"\r\n\r\ntemplate<typename T>\r\nclass Rational {\r\npublic:\r\n\tstatic_assert(std::is_integral<T>::value, \"Base type of Rational must be an integral.\");\r\n\r\n\tconstexpr Rational() : Rational(0) {}\r\n\tconstexpr Rational(const T a) : a_(a), b_(1) {}\r\n\tRational(const T a, const T b) : a_(a), b_(b) {\r\n\t\tnormalize();\r\n\t}\r\n\r\n\tvoid swap(Rational& rhs) {\r\n\t\tstd::swap(a_, rhs.a_);\r\n\t\tstd::swap(b_, rhs.b_);\r\n\t}\r\n\r\n\tconstexpr operator bool() const {\r\n\t\treturn a_ != 0;\r\n\t}\r\n\r\n\tconstexpr operator T() const {\r\n\t\treturn to_int();\r\n\t}\r\n\r\n\tconstexpr operator long double() const {\r\n\t\treturn to_double();\r\n\t}\r\n\r\n\tstd::string to_string() const {\r\n\t\treturn std::to_string(a_) + \"\/\" + std::to_string(b_);\r\n\t}\r\n\r\n\tconstexpr bool operator !() const {\r\n\t\treturn a_ == 0;\r\n\t}\r\n\r\n\tconstexpr Rational operator -() const {\r\n\t\treturn negate();\r\n\t}\r\n\r\n\tconstexpr Rational operator +() const {\r\n\t\treturn{ a_, b_ };\r\n\t}\r\n\r\n\tRational& operator ++() {\r\n\t\ta_ += b_;\r\n\t\treturn *this;\r\n\t}\r\n\r\n\tRational operator ++(int) {\r\n\t\ta_ += b_;\r\n\t\treturn {a_ - b_, b_};\r\n\t}\r\n\r\n\tRational& operator --() {\r\n\t\ta_ -= b_;\r\n\t\treturn *this;\r\n\t}\r\n\r\n\tRational operator --(int) {\r\n\t\ta_ -= b_;\r\n\t\treturn{ a_ + b_, b_ };\r\n\t}\r\n\r\n\tconstexpr Rational add(const Rational& rhs) const {\r\n\t\treturn{ a_ * rhs.b_ + rhs.a_ * b_, b_ * rhs.b_ };\r\n\t}\r\n\r\n\tconstexpr Rational subtract(const Rational& rhs) const {\r\n\t\treturn add(rhs.negate());\r\n\t}\r\n\r\n\tconstexpr Rational multiply(const Rational& rhs) const {\r\n\t\treturn{ a_ * rhs.a_, b_ * rhs.b_ };\r\n\t}\r\n\r\n\tconstexpr Rational divide(const Rational& rhs) const {\r\n\t\treturn{ a_ * rhs.b_, b_ * rhs.a_ };\r\n\t}\r\n\r\n\tconstexpr Rational operator +(const Rational& rhs) const {\r\n\t\treturn add(rhs);\r\n\t}\r\n\r\n\tconstexpr Rational operator -(const Rational& rhs) const {\r\n\t\treturn subtract(rhs);\r\n\t}\r\n\r\n\tconstexpr Rational operator *(const Rational& rhs) const {\r\n\t\treturn multiply(rhs);\r\n\t}\r\n\r\n\tconstexpr Rational operator \/(const Rational& rhs) const {\r\n\t\treturn divide(rhs);\r\n\t}\r\n\r\n\tconstexpr T a() const {\r\n\t\treturn a_;\r\n\t}\r\n\r\n\tconstexpr T b() const {\r\n\t\treturn b_;\r\n\t}\r\n\r\n\tRational& operator +=(const Rational& rhs) {\r\n\t\tRational res = add(rhs);\r\n\t\tswap(res);\r\n\t\treturn *this;\r\n\t}\r\n\r\n\tRational& operator -=(const Rational& rhs) {\r\n\t\tRational res = subtract(rhs);\r\n\t\tswap(res);\r\n\t\treturn *this;\r\n\t}\r\n\r\n\tRational& operator *=(const Rational& rhs) {\r\n\t\tRational res = multiply(rhs);\r\n\t\tswap(res);\r\n\t\treturn *this;\r\n\t}\r\n\r\n\tRational& operator \/=(const Rational& x) {\r\n\t\tRational res = divide(rhs);\r\n\t\tswap(res);\r\n\t\treturn *this;\r\n\t}\r\n\r\n\tconstexpr friend bool operator ==(const Rational& lhs, const Rational& rhs) {\r\n\t\treturn lhs.a_ == rhs.a_ && lhs.b_ == rhs.b_;\r\n\t}\r\n\r\n\tconstexpr friend bool operator !=(const Rational& lhs, const Rational& rhs) {\r\n\t\treturn !(lhs == rhs);\r\n\t}\r\n\r\n\tconstexpr friend bool operator <(const Rational& lhs, const Rational& rhs) {\r\n\t\treturn lhs.a_ * rhs.b_ < rhs.a_ * lhs.b_;\r\n\t}\r\n\r\n\tconstexpr friend bool operator >(const Rational& lhs, const Rational& rhs) {\r\n\t\treturn rhs < lhs;\r\n\t}\r\n\r\n\tconstexpr friend bool operator <=(const Rational& lhs, const Rational& rhs) {\r\n\t\treturn lhs.a_ * rhs.b_ <= rhs.a_ * lhs.b_;\r\n\t}\r\n\r\n\tconstexpr friend bool operator >=(const Rational& lhs, const Rational& rhs) {\r\n\t\treturn rhs <= lhs;\r\n\t}\r\n\r\n\tfriend std::ostream& operator << (std::ostream& out, const Rational& rational) {\r\n\t\treturn out << rational.a_ << \" \" << rational.b_;\r\n\t}\r\n\r\n\tfriend std::istream& operator >> (std::istream& in, Rational& rational) {\r\n\t\tin >> rational .a_ >> rational.b_;\r\n\t\trational.normalize();\r\n\t\treturn in;\r\n\t}\r\n\r\n\tvoid normalize() {\r\n\t\tconst T g = gcd(a_, b_);\r\n\t\ta_ \/= g;\r\n\t\tb_ \/= g;\r\n\t\tif (b_ < 0) {\r\n\t\t\ta_ = -a_;\r\n\t\t\tb_ = -b_;\r\n\t\t}\r\n\t}\r\n\r\n\tvoid read_slash(std::istream& in) {\r\n\t\tchar ch;\r\n\t\tin >> a_ >> ch >> b_;\r\n\t\tnormalize();\r\n\t}\r\n\r\n\tvoid print_slash(std::ostream& out) const {\r\n\t\tout << a_ << \"\/\" << b_;\r\n\t}\r\n\r\n\tconstexpr Rational negate() const {\r\n\t\treturn{ -a_, b_ };\r\n\t}\r\n\r\n\tconstexpr Rational abs() const {\r\n\t\treturn a_ < 0 ? Rational(-a_, b_) : Rational(a_, b_);\r\n\t}\r\n\r\n\tconstexpr Rational inverse() const {\r\n\t\treturn{ b_, a_ };\r\n\t}\r\n\r\n\tconstexpr int sign() const {\r\n\t\treturn a_ < 0 ? -1 : static_cast<int>(a_ > 0);\r\n\t}\r\n\r\n\tconstexpr long double to_double() const {\r\n\t\treturn static_cast<long double>(a_) \/ b_;\r\n\t}\r\n\r\n\tconstexpr T to_int() const {\r\n\t\treturn a_ \/ b_;\r\n\t}\r\n\r\n\tconstexpr T floor() const {\r\n\t\treturn to_int();\r\n\t}\r\n\r\n\tconstexpr T ceil() const {\r\n\t\treturn static_cast<T>(ceil(to_double() - EPS));\r\n\t}\r\n\r\n\tconstexpr T round() const {\r\n\t\tconst long double cur = to_double();\r\n\t\treturn static_cast<T>(cur < 0 ? ceil(cur - 0.5 - EPS) : floor(cur + 0.5 + EPS));\r\n\t}\r\n\r\n\tconstexpr long double frac() const {\r\n\t\treturn to_double() - to_int();\r\n\t}\r\n\r\n\tconstexpr Rational pow(const ll n) const {\r\n\t\treturn{ binpow(a_, n), binpow(b_, n) };\r\n\t}\r\n\r\nprivate:\r\n\tT a_;\r\n\tT b_;\r\n\r\n};\r\n\r\nnamespace std {\r\n\r\ntemplate<typename T>\r\nstd::string to_string(const Rational<T>& arg) {\r\n\treturn arg.to_string();\r\n}\r\n\r\ntemplate<typename T>\r\nstruct hash<Rational<T>> {\r\n\tsize_t operator()(const Rational<T>& arg) const {\r\n\t\treturn hash<pair<T, T>>({ arg.a, arg.b });\r\n\t}\r\n};\r\n\r\ntemplate<typename T>\r\nvoid swap(Rational<T>& lhs, Rational<T>& rhs) {\r\n\tlhs.swap(rhs);\r\n}\r\n\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\n * extensions_manager.cpp: Extensions manager for Qt\n ****************************************************************************\n * Copyright (C) 2009-2010 VideoLAN and authors\n * $Id$\n *\n * Authors: Jean-Philippe André < jpeg # videolan.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 \"extensions_manager.hpp\"\n#include \"input_manager.hpp\"\n#include \"dialogs\/extensions.hpp\"\n\n#include \"assert.h\"\n\n#include <QMenu>\n#include <QAction>\n#include <QSignalMapper>\n#include <QIcon>\n\n#define MENU_MAP(a,e) ((uint32_t)( (((uint16_t)a) << 16) | ((uint16_t)e) ))\n#define MENU_GET_ACTION(a) ( (uint16_t)( ((uint32_t)a) >> 16 ) )\n#define MENU_GET_EXTENSION(a) ( (uint16_t)( ((uint32_t)a) & 0xFFFF ) )\n\nExtensionsManager* ExtensionsManager::instance = NULL;\n\nExtensionsManager::ExtensionsManager( intf_thread_t *_p_intf, QObject *parent )\n        : QObject( parent ), p_intf( _p_intf ), p_extensions_manager( NULL )\n        , p_edp( NULL )\n{\n    assert( ExtensionsManager::instance == NULL );\n    instance = this;\n\n    menuMapper = new QSignalMapper( this );\n    CONNECT( menuMapper, mapped( int ), this, triggerMenu( int ) );\n    CONNECT( THEMIM->getIM(), statusChanged( int ), this, playingChanged( int ) );\n    DCONNECT( THEMIM, inputChanged( input_thread_t* ),\n              this, inputChanged( input_thread_t* ) );\n    b_unloading = false;\n    b_failed = false;\n}\n\nExtensionsManager::~ExtensionsManager()\n{\n    msg_Dbg( p_intf, \"Killing extension dialog provider\" );\n    ExtensionsDialogProvider::killInstance();\n    if( p_extensions_manager )\n    {\n        module_unneed( p_extensions_manager, p_extensions_manager->p_module );\n        vlc_object_release( p_extensions_manager );\n    }\n}\n\nbool ExtensionsManager::loadExtensions()\n{\n    if( !p_extensions_manager )\n    {\n        p_extensions_manager = ( extensions_manager_t* )\n                    vlc_object_create( p_intf, sizeof( extensions_manager_t ) );\n        if( !p_extensions_manager )\n        {\n            b_failed = true;\n            emit extensionsUpdated();\n            return false;\n        }\n        vlc_object_attach( p_extensions_manager, p_intf );\n\n        p_extensions_manager->p_module =\n                module_need( p_extensions_manager, \"extension\", NULL, false );\n\n        if( !p_extensions_manager->p_module )\n        {\n            msg_Err( p_intf, \"Unable to load extensions module\" );\n            vlc_object_release( p_extensions_manager );\n            p_extensions_manager = NULL;\n            b_failed = true;\n            emit extensionsUpdated();\n            return false;\n        }\n\n        \/* Initialize dialog provider *\/\n        p_edp = ExtensionsDialogProvider::getInstance( p_intf,\n                                                       p_extensions_manager );\n        if( !p_edp )\n        {\n            msg_Err( p_intf, \"Unable to create dialogs provider for extensions\" );\n            module_unneed( p_extensions_manager,\n                           p_extensions_manager->p_module );\n            vlc_object_release( p_extensions_manager );\n            p_extensions_manager = NULL;\n            b_failed = true;\n            emit extensionsUpdated();\n            return false;\n        }\n        b_unloading = false;\n    }\n    b_failed = false;\n    emit extensionsUpdated();\n    return true;\n}\n\nvoid ExtensionsManager::unloadExtensions()\n{\n    if( !p_extensions_manager )\n        return;\n    b_unloading = true;\n    module_unneed( p_extensions_manager, p_extensions_manager->p_module );\n    vlc_object_release( p_extensions_manager );\n    p_extensions_manager = NULL;\n    emit extensionsUpdated();\n    ExtensionsDialogProvider::killInstance();\n}\n\nvoid ExtensionsManager::reloadExtensions()\n{\n    unloadExtensions();\n    loadExtensions();\n    emit extensionsUpdated();\n}\n\nvoid ExtensionsManager::menu( QMenu *current )\n{\n    assert( current != NULL );\n    if( !isLoaded() )\n    {\n        \/\/ This case can happen: do nothing\n        return;\n    }\n\n    vlc_mutex_lock( &p_extensions_manager->lock );\n\n    QAction *action;\n    extension_t *p_ext = NULL;\n    int i_ext = 0;\n    FOREACH_ARRAY( p_ext, p_extensions_manager->extensions )\n    {\n        bool b_Active = extension_IsActivated( p_extensions_manager, p_ext );\n\n        if( b_Active && extension_HasMenu( p_extensions_manager, p_ext ) )\n        {\n            QMenu *submenu = new QMenu( qfu( p_ext->psz_title ) );\n            char **ppsz_titles = NULL;\n            uint16_t *pi_ids = NULL;\n            size_t i_num = 0;\n            action = current->addMenu( submenu );\n\n            action->setCheckable( true );\n            action->setChecked( true );\n\n            if( extension_GetMenu( p_extensions_manager, p_ext,\n                                   &ppsz_titles, &pi_ids ) == VLC_SUCCESS )\n            {\n                for( int i = 0; ppsz_titles[i] != NULL; ++i )\n                {\n                    ++i_num;\n                    action = submenu->addAction( qfu( ppsz_titles[i] ) );\n                    menuMapper->setMapping( action,\n                                            MENU_MAP( pi_ids[i], i_ext ) );\n                    CONNECT( action, triggered(), menuMapper, map() );\n                }\n                if( !i_num )\n                {\n                    action = submenu->addAction( qtr( \"Empty\" ) );\n                    action->setEnabled( false );\n                }\n            }\n            else\n            {\n                msg_Warn( p_intf, \"Could not get menu for extension '%s'\",\n                          p_ext->psz_title );\n                action = submenu->addAction( qtr( \"Empty\" ) );\n                action->setEnabled( false );\n            }\n\n            submenu->addSeparator();\n            action = submenu->addAction( QIcon( \":\/menu\/quit\" ),\n                                         qtr( \"Deactivate\" ) );\n            menuMapper->setMapping( action, MENU_MAP( 0, i_ext ) );\n            CONNECT( action, triggered(), menuMapper, map() );\n        }\n        else\n        {\n            action = current->addAction( qfu( p_ext->psz_title ) );\n            menuMapper->setMapping( action, MENU_MAP( 0, i_ext ) );\n            CONNECT( action, triggered(), menuMapper, map() );\n\n            if( !extension_TriggerOnly( p_extensions_manager, p_ext ) )\n            {\n                action->setCheckable( true );\n                action->setChecked( b_Active );\n            }\n        }\n        i_ext++;\n    }\n    FOREACH_END()\n\n    vlc_mutex_unlock( &p_extensions_manager->lock );\n}\n\nvoid ExtensionsManager::triggerMenu( int id )\n{\n    uint16_t i_ext = MENU_GET_EXTENSION( id );\n    uint16_t i_action = MENU_GET_ACTION( id );\n\n    vlc_mutex_lock( &p_extensions_manager->lock );\n\n    if( (int) i_ext > p_extensions_manager->extensions.i_size )\n    {\n        msg_Dbg( p_intf, \"can't trigger extension with wrong id %d\",\n                 (int) i_ext );\n        return;\n    }\n\n    extension_t *p_ext = ARRAY_VAL( p_extensions_manager->extensions, i_ext );\n    assert( p_ext != NULL);\n\n    vlc_mutex_unlock( &p_extensions_manager->lock );\n\n    if( i_action == 0 )\n    {\n        msg_Dbg( p_intf, \"activating or triggering extension '%s'\",\n                 p_ext->psz_title );\n\n        if( extension_TriggerOnly( p_extensions_manager, p_ext ) )\n        {\n            extension_Trigger( p_extensions_manager, p_ext );\n        }\n        else\n        {\n            if( !extension_IsActivated( p_extensions_manager, p_ext ) )\n                extension_Activate( p_extensions_manager, p_ext );\n            else\n                extension_Deactivate( p_extensions_manager, p_ext );\n        }\n    }\n    else\n    {\n        msg_Dbg( p_intf, \"triggering extension '%s', on menu with id = 0x%x\",\n                 p_ext->psz_title, i_action );\n\n        extension_TriggerMenu( p_extensions_manager, p_ext, i_action );\n    }\n}\n\nvoid ExtensionsManager::inputChanged( input_thread_t* p_input )\n{\n    \/\/This is unlikely, but can happen if no extension modules can be loaded.\n    if ( p_extensions_manager == NULL )\n        return ;\n    vlc_mutex_lock( &p_extensions_manager->lock );\n\n    extension_t *p_ext;\n    FOREACH_ARRAY( p_ext, p_extensions_manager->extensions )\n    {\n        if( extension_IsActivated( p_extensions_manager, p_ext ) )\n        {\n            extension_SetInput( p_extensions_manager, p_ext, p_input );\n        }\n    }\n    FOREACH_END()\n\n    vlc_mutex_unlock( &p_extensions_manager->lock );\n}\n\nvoid ExtensionsManager::playingChanged( int state )\n{\n    \/\/This is unlikely, but can happen if no extension modules can be loaded.\n    if ( p_extensions_manager == NULL )\n        return ;\n    vlc_mutex_lock( &p_extensions_manager->lock );\n\n    extension_t *p_ext;\n    FOREACH_ARRAY( p_ext, p_extensions_manager->extensions )\n    {\n        if( extension_IsActivated( p_extensions_manager, p_ext ) )\n        {\n            extension_PlayingChanged( p_extensions_manager, p_ext, state );\n        }\n    }\n    FOREACH_END()\n\n    vlc_mutex_unlock( &p_extensions_manager->lock );\n}\n<commit_msg>qt4: fix another QMenu without parent<commit_after>\/*****************************************************************************\n * extensions_manager.cpp: Extensions manager for Qt\n ****************************************************************************\n * Copyright (C) 2009-2010 VideoLAN and authors\n * $Id$\n *\n * Authors: Jean-Philippe André < jpeg # videolan.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 \"extensions_manager.hpp\"\n#include \"input_manager.hpp\"\n#include \"dialogs\/extensions.hpp\"\n\n#include \"assert.h\"\n\n#include <QMenu>\n#include <QAction>\n#include <QSignalMapper>\n#include <QIcon>\n\n#define MENU_MAP(a,e) ((uint32_t)( (((uint16_t)a) << 16) | ((uint16_t)e) ))\n#define MENU_GET_ACTION(a) ( (uint16_t)( ((uint32_t)a) >> 16 ) )\n#define MENU_GET_EXTENSION(a) ( (uint16_t)( ((uint32_t)a) & 0xFFFF ) )\n\nExtensionsManager* ExtensionsManager::instance = NULL;\n\nExtensionsManager::ExtensionsManager( intf_thread_t *_p_intf, QObject *parent )\n        : QObject( parent ), p_intf( _p_intf ), p_extensions_manager( NULL )\n        , p_edp( NULL )\n{\n    assert( ExtensionsManager::instance == NULL );\n    instance = this;\n\n    menuMapper = new QSignalMapper( this );\n    CONNECT( menuMapper, mapped( int ), this, triggerMenu( int ) );\n    CONNECT( THEMIM->getIM(), statusChanged( int ), this, playingChanged( int ) );\n    DCONNECT( THEMIM, inputChanged( input_thread_t* ),\n              this, inputChanged( input_thread_t* ) );\n    b_unloading = false;\n    b_failed = false;\n}\n\nExtensionsManager::~ExtensionsManager()\n{\n    msg_Dbg( p_intf, \"Killing extension dialog provider\" );\n    ExtensionsDialogProvider::killInstance();\n    if( p_extensions_manager )\n    {\n        module_unneed( p_extensions_manager, p_extensions_manager->p_module );\n        vlc_object_release( p_extensions_manager );\n    }\n}\n\nbool ExtensionsManager::loadExtensions()\n{\n    if( !p_extensions_manager )\n    {\n        p_extensions_manager = ( extensions_manager_t* )\n                    vlc_object_create( p_intf, sizeof( extensions_manager_t ) );\n        if( !p_extensions_manager )\n        {\n            b_failed = true;\n            emit extensionsUpdated();\n            return false;\n        }\n        vlc_object_attach( p_extensions_manager, p_intf );\n\n        p_extensions_manager->p_module =\n                module_need( p_extensions_manager, \"extension\", NULL, false );\n\n        if( !p_extensions_manager->p_module )\n        {\n            msg_Err( p_intf, \"Unable to load extensions module\" );\n            vlc_object_release( p_extensions_manager );\n            p_extensions_manager = NULL;\n            b_failed = true;\n            emit extensionsUpdated();\n            return false;\n        }\n\n        \/* Initialize dialog provider *\/\n        p_edp = ExtensionsDialogProvider::getInstance( p_intf,\n                                                       p_extensions_manager );\n        if( !p_edp )\n        {\n            msg_Err( p_intf, \"Unable to create dialogs provider for extensions\" );\n            module_unneed( p_extensions_manager,\n                           p_extensions_manager->p_module );\n            vlc_object_release( p_extensions_manager );\n            p_extensions_manager = NULL;\n            b_failed = true;\n            emit extensionsUpdated();\n            return false;\n        }\n        b_unloading = false;\n    }\n    b_failed = false;\n    emit extensionsUpdated();\n    return true;\n}\n\nvoid ExtensionsManager::unloadExtensions()\n{\n    if( !p_extensions_manager )\n        return;\n    b_unloading = true;\n    module_unneed( p_extensions_manager, p_extensions_manager->p_module );\n    vlc_object_release( p_extensions_manager );\n    p_extensions_manager = NULL;\n    emit extensionsUpdated();\n    ExtensionsDialogProvider::killInstance();\n}\n\nvoid ExtensionsManager::reloadExtensions()\n{\n    unloadExtensions();\n    loadExtensions();\n    emit extensionsUpdated();\n}\n\nvoid ExtensionsManager::menu( QMenu *current )\n{\n    assert( current != NULL );\n    if( !isLoaded() )\n    {\n        \/\/ This case can happen: do nothing\n        return;\n    }\n\n    vlc_mutex_lock( &p_extensions_manager->lock );\n\n    QAction *action;\n    extension_t *p_ext = NULL;\n    int i_ext = 0;\n    FOREACH_ARRAY( p_ext, p_extensions_manager->extensions )\n    {\n        bool b_Active = extension_IsActivated( p_extensions_manager, p_ext );\n\n        if( b_Active && extension_HasMenu( p_extensions_manager, p_ext ) )\n        {\n            QMenu *submenu = new QMenu( qfu( p_ext->psz_title ), current );\n            char **ppsz_titles = NULL;\n            uint16_t *pi_ids = NULL;\n            size_t i_num = 0;\n            action = current->addMenu( submenu );\n\n            action->setCheckable( true );\n            action->setChecked( true );\n\n            if( extension_GetMenu( p_extensions_manager, p_ext,\n                                   &ppsz_titles, &pi_ids ) == VLC_SUCCESS )\n            {\n                for( int i = 0; ppsz_titles[i] != NULL; ++i )\n                {\n                    ++i_num;\n                    action = submenu->addAction( qfu( ppsz_titles[i] ) );\n                    menuMapper->setMapping( action,\n                                            MENU_MAP( pi_ids[i], i_ext ) );\n                    CONNECT( action, triggered(), menuMapper, map() );\n                }\n                if( !i_num )\n                {\n                    action = submenu->addAction( qtr( \"Empty\" ) );\n                    action->setEnabled( false );\n                }\n            }\n            else\n            {\n                msg_Warn( p_intf, \"Could not get menu for extension '%s'\",\n                          p_ext->psz_title );\n                action = submenu->addAction( qtr( \"Empty\" ) );\n                action->setEnabled( false );\n            }\n\n            submenu->addSeparator();\n            action = submenu->addAction( QIcon( \":\/menu\/quit\" ),\n                                         qtr( \"Deactivate\" ) );\n            menuMapper->setMapping( action, MENU_MAP( 0, i_ext ) );\n            CONNECT( action, triggered(), menuMapper, map() );\n        }\n        else\n        {\n            action = current->addAction( qfu( p_ext->psz_title ) );\n            menuMapper->setMapping( action, MENU_MAP( 0, i_ext ) );\n            CONNECT( action, triggered(), menuMapper, map() );\n\n            if( !extension_TriggerOnly( p_extensions_manager, p_ext ) )\n            {\n                action->setCheckable( true );\n                action->setChecked( b_Active );\n            }\n        }\n        i_ext++;\n    }\n    FOREACH_END()\n\n    vlc_mutex_unlock( &p_extensions_manager->lock );\n}\n\nvoid ExtensionsManager::triggerMenu( int id )\n{\n    uint16_t i_ext = MENU_GET_EXTENSION( id );\n    uint16_t i_action = MENU_GET_ACTION( id );\n\n    vlc_mutex_lock( &p_extensions_manager->lock );\n\n    if( (int) i_ext > p_extensions_manager->extensions.i_size )\n    {\n        msg_Dbg( p_intf, \"can't trigger extension with wrong id %d\",\n                 (int) i_ext );\n        return;\n    }\n\n    extension_t *p_ext = ARRAY_VAL( p_extensions_manager->extensions, i_ext );\n    assert( p_ext != NULL);\n\n    vlc_mutex_unlock( &p_extensions_manager->lock );\n\n    if( i_action == 0 )\n    {\n        msg_Dbg( p_intf, \"activating or triggering extension '%s'\",\n                 p_ext->psz_title );\n\n        if( extension_TriggerOnly( p_extensions_manager, p_ext ) )\n        {\n            extension_Trigger( p_extensions_manager, p_ext );\n        }\n        else\n        {\n            if( !extension_IsActivated( p_extensions_manager, p_ext ) )\n                extension_Activate( p_extensions_manager, p_ext );\n            else\n                extension_Deactivate( p_extensions_manager, p_ext );\n        }\n    }\n    else\n    {\n        msg_Dbg( p_intf, \"triggering extension '%s', on menu with id = 0x%x\",\n                 p_ext->psz_title, i_action );\n\n        extension_TriggerMenu( p_extensions_manager, p_ext, i_action );\n    }\n}\n\nvoid ExtensionsManager::inputChanged( input_thread_t* p_input )\n{\n    \/\/This is unlikely, but can happen if no extension modules can be loaded.\n    if ( p_extensions_manager == NULL )\n        return ;\n    vlc_mutex_lock( &p_extensions_manager->lock );\n\n    extension_t *p_ext;\n    FOREACH_ARRAY( p_ext, p_extensions_manager->extensions )\n    {\n        if( extension_IsActivated( p_extensions_manager, p_ext ) )\n        {\n            extension_SetInput( p_extensions_manager, p_ext, p_input );\n        }\n    }\n    FOREACH_END()\n\n    vlc_mutex_unlock( &p_extensions_manager->lock );\n}\n\nvoid ExtensionsManager::playingChanged( int state )\n{\n    \/\/This is unlikely, but can happen if no extension modules can be loaded.\n    if ( p_extensions_manager == NULL )\n        return ;\n    vlc_mutex_lock( &p_extensions_manager->lock );\n\n    extension_t *p_ext;\n    FOREACH_ARRAY( p_ext, p_extensions_manager->extensions )\n    {\n        if( extension_IsActivated( p_extensions_manager, p_ext ) )\n        {\n            extension_PlayingChanged( p_extensions_manager, p_ext, state );\n        }\n    }\n    FOREACH_END()\n\n    vlc_mutex_unlock( &p_extensions_manager->lock );\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2018 The Brave Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"brave\/utility\/tor\/tor_launcher_impl.h\"\n\n#include <utility>\n\n#include \"base\/command_line.h\"\n#include \"base\/process\/kill.h\"\n#include \"base\/process\/launch.h\"\n#include \"base\/single_thread_task_runner.h\"\n#include \"base\/task_scheduler\/post_task.h\"\n#include \"base\/threading\/thread.h\"\n#include \"base\/threading\/thread_task_runner_handle.h\"\n\n#if defined(OS_POSIX)\nint pipehack[2];\n\nstatic void SIGCHLDHandler(int signo) {\n  int error = errno;\n  char ch = 0;\n  write(pipehack[1], &ch, 1);\n  errno = error;\n}\n\nstatic void SetupPipeHack() {\n  if (pipe(pipehack) == -1)\n    LOG(ERROR) << \"pipehack\";\n\n  int flags;\n  for (size_t i = 0; i < 2; ++i) {\n    if ((flags = fcntl(pipehack[i], F_GETFL)) == -1)\n      LOG(ERROR) << \"get flags\";\n    \/\/ Nonblock write end on SIGCHLD handler which will notify monitor thread\n    \/\/ by sending one byte to pipe whose read end is blocked and wait for\n    \/\/ SIGCHLD to arrives to avoid busy reading\n    if (i == 1)\n      flags |= O_NONBLOCK;\n    if (fcntl(pipehack[i], F_SETFL, flags) == -1)\n      LOG(ERROR) << \"set flags\";\n    if ((flags = fcntl(pipehack[i], F_GETFD)) == -1)\n      LOG(ERROR) << \"get fd flags\";\n    flags |= FD_CLOEXEC;\n    if (fcntl(pipehack[i], F_SETFD, flags) == -1)\n      LOG(ERROR) << \"set fd flags\";\n  }\n\n  struct sigaction action;\n  memset(&action, 0, sizeof(action));\n  action.sa_handler = SIGCHLDHandler;\n  sigaction(SIGCHLD, &action, NULL);\n}\n\nstatic void TearDownPipeHack() {\n  struct sigaction action;\n  memset(&action, 0, sizeof(action));\n  action.sa_handler = SIG_DFL;\n  sigaction(SIGCHLD, &action, NULL);\n  for (size_t i = 0; i < 2; ++i)\n    close(pipehack[i]);\n}\n#endif\n\nnamespace brave {\n\n#if defined(OS_POSIX)\nclass TorLauncherDelegate : public base::LaunchOptions::PreExecDelegate {\n public:\n    TorLauncherDelegate() {}\n    ~TorLauncherDelegate() override {}\n\n    void RunAsyncSafe() override {\n      \/\/ Makes tor process a new leader of process group so that it won't get\n      \/\/ affected by ctrl+c (SIGINT) in current terminal\n      setsid();\n    }\n private:\n    DISALLOW_COPY_AND_ASSIGN(TorLauncherDelegate);\n};\n#endif\n\nTorLauncherImpl::TorLauncherImpl(\n    std::unique_ptr<service_manager::ServiceContextRef> service_ref)\n    : service_ref_(std::move(service_ref)) {\n#if defined(OS_POSIX)\n  SetupPipeHack();\n#endif\n}\n\nTorLauncherImpl::~TorLauncherImpl() {\n  if (tor_process_.IsValid()) {\n    tor_process_.Terminate(0, false);\n#if defined(OS_POSIX)\n    TearDownPipeHack();\n#endif\n#if defined(OS_MACOSX)\n    base::PostTaskWithTraits(\n        FROM_HERE, {base::MayBlock(), base::TaskPriority::BACKGROUND},\n        base::BindOnce(&base::EnsureProcessTerminated, Passed(&tor_process_)));\n#else\n    base::EnsureProcessTerminated(std::move(tor_process_));\n#endif\n  }\n}\n\nvoid TorLauncherImpl::Launch(const base::FilePath& tor_bin,\n                             const std::string& tor_host,\n                             const std::string& tor_port,\n                             const base::FilePath& tor_data_dir,\n                             LaunchCallback callback) {\n  base::CommandLine args(tor_bin);\n  args.AppendArg(\"--ignore-missing-torrc\");\n  args.AppendArg(\"-f\");\n  args.AppendArg(\"\/nonexistent\");\n  args.AppendArg(\"--defaults-torrc\");\n  args.AppendArg(\"\/nonexistent\");\n  args.AppendArg(\"--SocksPort\");\n  args.AppendArg(tor_host + \":\" + tor_port);\n  if (!tor_data_dir.empty()) {\n    args.AppendArg(\"--DataDirectory\");\n    args.AppendArgPath(tor_data_dir);\n  }\n\n  base::LaunchOptions launchopts;\n#if defined(OS_POSIX)\n  TorLauncherDelegate tor_launcher_delegate;\n  launchopts.pre_exec_delegate = &tor_launcher_delegate;\n#endif\n#if defined(OS_LINUX)\n  launchopts.kill_on_parent_death = true;\n#endif\n  tor_process_ = base::LaunchProcess(args, launchopts);\n\n  bool result;\n  \/\/ TODO(darkdh): return success when tor connected to tor network\n  if (tor_process_.IsValid())\n    result = true;\n  else\n    result = false;\n\n  if (callback)\n    std::move(callback).Run(result);\n\n  if (!child_monitor_thread_.get()) {\n    child_monitor_thread_.reset(new base::Thread(\"child_monitor_thread\"));\n    if (!child_monitor_thread_->Start()) {\n      NOTREACHED();\n    }\n\n    child_monitor_thread_->task_runner()->PostTask(\n      FROM_HERE,\n      base::BindOnce(&TorLauncherImpl::MonitorChild, base::Unretained(this)));\n  }\n}\n\nvoid TorLauncherImpl::SetCrashHandler(SetCrashHandlerCallback callback) {\n  crash_handler_callback_ = std::move(callback);\n}\n\nvoid TorLauncherImpl::MonitorChild() {\n#if defined(OS_POSIX)\n  char buf[PIPE_BUF];\n\n  while (1) {\n      if (read(pipehack[0], buf, sizeof(buf)) > 0) {\n        pid_t pid;\n        int status;\n\n        if ((pid = waitpid(-1, &status, WNOHANG)) != -1) {\n          if (WIFSIGNALED(status)) {\n            LOG(ERROR) << \"tor got terminated by signal \" << WTERMSIG(status);\n          } else if (WCOREDUMP(status)) {\n            LOG(ERROR) << \"tor coredumped\";\n          } else if (WIFEXITED(status)) {\n            LOG(ERROR) << \"tor exit (\" << WEXITSTATUS(status) << \")\";\n          }\n          if (crash_handler_callback_)\n            std::move(crash_handler_callback_).Run(pid);\n        }\n      } else {\n        \/\/ pipes closed\n        break;\n      }\n  }\n#elif defined(OS_WIN)\n  WaitForSingleObject(tor_process_.Handle(), INFINITE);\n  if (crash_handler_callback_)\n    std::move(crash_handler_callback_).\n      Run(base::GetProcId(tor_process_.Handle()));\n#else\n#error unsupported platforms\n#endif\n}\n\n}  \/\/ namespace brave\n<commit_msg>linux header fix (Mac and Windows have build\/precompile.h)<commit_after>\/\/ Copyright (c) 2018 The Brave Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"brave\/utility\/tor\/tor_launcher_impl.h\"\n\n\n#if defined(OS_LINUX)\n#include <errno.h>\n#include <fcntl.h>\n#include <signal.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#endif\n\n#include <utility>\n\n#include \"base\/command_line.h\"\n#include \"base\/process\/kill.h\"\n#include \"base\/process\/launch.h\"\n#include \"base\/single_thread_task_runner.h\"\n#include \"base\/task_scheduler\/post_task.h\"\n#include \"base\/threading\/thread.h\"\n#include \"base\/threading\/thread_task_runner_handle.h\"\n\n#if defined(OS_POSIX)\nint pipehack[2];\n\nstatic void SIGCHLDHandler(int signo) {\n  int error = errno;\n  char ch = 0;\n  write(pipehack[1], &ch, 1);\n  errno = error;\n}\n\nstatic void SetupPipeHack() {\n  if (pipe(pipehack) == -1)\n    LOG(ERROR) << \"pipehack\";\n\n  int flags;\n  for (size_t i = 0; i < 2; ++i) {\n    if ((flags = fcntl(pipehack[i], F_GETFL)) == -1)\n      LOG(ERROR) << \"get flags\";\n    \/\/ Nonblock write end on SIGCHLD handler which will notify monitor thread\n    \/\/ by sending one byte to pipe whose read end is blocked and wait for\n    \/\/ SIGCHLD to arrives to avoid busy reading\n    if (i == 1)\n      flags |= O_NONBLOCK;\n    if (fcntl(pipehack[i], F_SETFL, flags) == -1)\n      LOG(ERROR) << \"set flags\";\n    if ((flags = fcntl(pipehack[i], F_GETFD)) == -1)\n      LOG(ERROR) << \"get fd flags\";\n    flags |= FD_CLOEXEC;\n    if (fcntl(pipehack[i], F_SETFD, flags) == -1)\n      LOG(ERROR) << \"set fd flags\";\n  }\n\n  struct sigaction action;\n  memset(&action, 0, sizeof(action));\n  action.sa_handler = SIGCHLDHandler;\n  sigaction(SIGCHLD, &action, NULL);\n}\n\nstatic void TearDownPipeHack() {\n  struct sigaction action;\n  memset(&action, 0, sizeof(action));\n  action.sa_handler = SIG_DFL;\n  sigaction(SIGCHLD, &action, NULL);\n  for (size_t i = 0; i < 2; ++i)\n    close(pipehack[i]);\n}\n#endif\n\nnamespace brave {\n\n#if defined(OS_POSIX)\nclass TorLauncherDelegate : public base::LaunchOptions::PreExecDelegate {\n public:\n    TorLauncherDelegate() {}\n    ~TorLauncherDelegate() override {}\n\n    void RunAsyncSafe() override {\n      \/\/ Makes tor process a new leader of process group so that it won't get\n      \/\/ affected by ctrl+c (SIGINT) in current terminal\n      setsid();\n    }\n private:\n    DISALLOW_COPY_AND_ASSIGN(TorLauncherDelegate);\n};\n#endif\n\nTorLauncherImpl::TorLauncherImpl(\n    std::unique_ptr<service_manager::ServiceContextRef> service_ref)\n    : service_ref_(std::move(service_ref)) {\n#if defined(OS_POSIX)\n  SetupPipeHack();\n#endif\n}\n\nTorLauncherImpl::~TorLauncherImpl() {\n  if (tor_process_.IsValid()) {\n    tor_process_.Terminate(0, false);\n#if defined(OS_POSIX)\n    TearDownPipeHack();\n#endif\n#if defined(OS_MACOSX)\n    base::PostTaskWithTraits(\n        FROM_HERE, {base::MayBlock(), base::TaskPriority::BACKGROUND},\n        base::BindOnce(&base::EnsureProcessTerminated, Passed(&tor_process_)));\n#else\n    base::EnsureProcessTerminated(std::move(tor_process_));\n#endif\n  }\n}\n\nvoid TorLauncherImpl::Launch(const base::FilePath& tor_bin,\n                             const std::string& tor_host,\n                             const std::string& tor_port,\n                             const base::FilePath& tor_data_dir,\n                             LaunchCallback callback) {\n  base::CommandLine args(tor_bin);\n  args.AppendArg(\"--ignore-missing-torrc\");\n  args.AppendArg(\"-f\");\n  args.AppendArg(\"\/nonexistent\");\n  args.AppendArg(\"--defaults-torrc\");\n  args.AppendArg(\"\/nonexistent\");\n  args.AppendArg(\"--SocksPort\");\n  args.AppendArg(tor_host + \":\" + tor_port);\n  if (!tor_data_dir.empty()) {\n    args.AppendArg(\"--DataDirectory\");\n    args.AppendArgPath(tor_data_dir);\n  }\n\n  base::LaunchOptions launchopts;\n#if defined(OS_POSIX)\n  TorLauncherDelegate tor_launcher_delegate;\n  launchopts.pre_exec_delegate = &tor_launcher_delegate;\n#endif\n#if defined(OS_LINUX)\n  launchopts.kill_on_parent_death = true;\n#endif\n  tor_process_ = base::LaunchProcess(args, launchopts);\n\n  bool result;\n  \/\/ TODO(darkdh): return success when tor connected to tor network\n  if (tor_process_.IsValid())\n    result = true;\n  else\n    result = false;\n\n  if (callback)\n    std::move(callback).Run(result);\n\n  if (!child_monitor_thread_.get()) {\n    child_monitor_thread_.reset(new base::Thread(\"child_monitor_thread\"));\n    if (!child_monitor_thread_->Start()) {\n      NOTREACHED();\n    }\n\n    child_monitor_thread_->task_runner()->PostTask(\n      FROM_HERE,\n      base::BindOnce(&TorLauncherImpl::MonitorChild, base::Unretained(this)));\n  }\n}\n\nvoid TorLauncherImpl::SetCrashHandler(SetCrashHandlerCallback callback) {\n  crash_handler_callback_ = std::move(callback);\n}\n\nvoid TorLauncherImpl::MonitorChild() {\n#if defined(OS_POSIX)\n  char buf[PIPE_BUF];\n\n  while (1) {\n      if (read(pipehack[0], buf, sizeof(buf)) > 0) {\n        pid_t pid;\n        int status;\n\n        if ((pid = waitpid(-1, &status, WNOHANG)) != -1) {\n          if (WIFSIGNALED(status)) {\n            LOG(ERROR) << \"tor got terminated by signal \" << WTERMSIG(status);\n          } else if (WCOREDUMP(status)) {\n            LOG(ERROR) << \"tor coredumped\";\n          } else if (WIFEXITED(status)) {\n            LOG(ERROR) << \"tor exit (\" << WEXITSTATUS(status) << \")\";\n          }\n          if (crash_handler_callback_)\n            std::move(crash_handler_callback_).Run(pid);\n        }\n      } else {\n        \/\/ pipes closed\n        break;\n      }\n  }\n#elif defined(OS_WIN)\n  WaitForSingleObject(tor_process_.Handle(), INFINITE);\n  if (crash_handler_callback_)\n    std::move(crash_handler_callback_).\n      Run(base::GetProcId(tor_process_.Handle()));\n#else\n#error unsupported platforms\n#endif\n}\n\n}  \/\/ namespace brave\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Add comments in formatclipboard.hxx<commit_after><|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 Albrecht\n\/\/ License: BSD 2-Clause License (http:\/\/opensource.org\/licenses\/BSD-2-Clause)\n\n#ifndef DUNE_GDT_SPACE_CONTINUOUS_LAGRANGE_FEM_LOCALFUNCTIONS_HH\n#define DUNE_GDT_SPACE_CONTINUOUS_LAGRANGE_FEM_LOCALFUNCTIONS_HH\n\n#include <memory>\n#include <limits>\n#include <type_traits>\n\n#include <dune\/common\/typetraits.hh>\n#include <dune\/common\/static_assert.hh>\n#include <dune\/common\/exceptions.hh>\n\n#include <dune\/geometry\/referenceelements.hh>\n\n#include <dune\/grid\/sgrid.hh>\n#include <dune\/grid\/yaspgrid.hh>\n\n#include <dune\/localfunctions\/lagrange\/equidistantpoints.hh>\n#include <dune\/localfunctions\/lagrange.hh>\n\n#if HAVE_DUNE_FEM\n#include <dune\/fem\/space\/common\/allgeomtypes.hh>\n#endif\n\n#if HAVE_DUNE_FEM_LOCALFUNCTIONS\n#include <dune\/fem_localfunctions\/localfunctions\/transformations.hh>\n#include <dune\/fem_localfunctions\/basefunctions\/genericbasefunctionsetstorage.hh>\n#include <dune\/fem_localfunctions\/basefunctionsetmap\/basefunctionsetmap.hh>\n#include <dune\/fem_localfunctions\/space\/genericdiscretefunctionspace.hh>\n#endif \/\/ HAVE_DUNE_FEM_LOCALFUNCTIONS\n\n#include <dune\/stuff\/common\/color.hh>\n#include <dune\/stuff\/common\/float_cmp.hh>\n\n#include \"..\/..\/mapper\/fem.hh\"\n#include \"..\/..\/basefunctionset\/fem-localfunctions.hh\"\n#include \"..\/continuouslagrange.hh\"\n\nnamespace Dune {\nnamespace GDT {\nnamespace ContinuousLagrangeSpace {\n\n#if HAVE_DUNE_FEM_LOCALFUNCTIONS\n\n\n\/\/ forward, to be used in the traits and to allow for specialization\ntemplate <class GridPartImp, int polynomialOrder, class RangeFieldImp, int rangeDim, int rangeDimCols = 1>\nclass FemLocalfunctionsWrapper\n{\n  static_assert(Dune::AlwaysFalse<GridPartImp>::value, \"Untested for these dimensions!\");\n};\n\n\n\/**\n *  \\brief Traits class for ContinuousLagrangeSpace::FemLocalfunctionsWrapper.\n *\/\ntemplate <class GridPartImp, int polynomialOrder, class RangeFieldImp, int rangeDim, int rangeDimCols = 1>\nclass FemLocalfunctionsWrapperTraits\n{\npublic:\n  typedef GridPartImp GridPartType;\n  typedef typename GridPartType::GridViewType GridViewType;\n  static const int polOrder = polynomialOrder;\n  static_assert(polOrder >= 1, \"Wrong polOrder given!\");\n\nprivate:\n  typedef typename GridPartType::ctype DomainFieldType;\n\npublic:\n  static const unsigned int dimDomain = GridPartType::dimension;\n  typedef RangeFieldImp RangeFieldType;\n  static const unsigned int dimRange     = rangeDim;\n  static const unsigned int dimRangeCols = rangeDimCols;\n  typedef FemLocalfunctionsWrapper<GridPartType, polOrder, RangeFieldType, dimRange, dimRangeCols> derived_type;\n\nprivate:\n  typedef FemLocalfunctionsWrapperTraits<GridPartType, polOrder, RangeFieldType, dimRange, dimRangeCols> ThisType;\n\npublic:\n  typedef Dune::LagrangeLocalFiniteElement<Dune::EquidistantPointSet, dimDomain, DomainFieldType, RangeFieldType>\n      FiniteElementType;\n\nprivate:\n  typedef Dune::FemLocalFunctions::BaseFunctionSetMap<GridPartType, FiniteElementType,\n                                                      Dune::FemLocalFunctions::NoTransformation,\n                                                      Dune::FemLocalFunctions::SimpleStorage, polOrder,\n                                                      polOrder> BaseFunctionSetMapType;\n\npublic:\n  typedef Dune::FemLocalFunctions::DiscreteFunctionSpace<BaseFunctionSetMapType> BackendType;\n  typedef Mapper::FemDofWrapper<typename BackendType::MapperType> MapperType;\n  typedef BaseFunctionSet::FemLocalfunctionsWrapper<BaseFunctionSetMapType, DomainFieldType, dimDomain, RangeFieldType,\n                                                    dimRange, dimRangeCols> BaseFunctionSetType;\n  typedef typename BaseFunctionSetType::EntityType EntityType;\n  static const bool needs_grid_view = false;\n\nprivate:\n  template <class G, int p, class R, int r, int rC>\n  friend class FemLocalfunctionsWrapper;\n}; \/\/ class FemLocalfunctionsWrapperTraits\n\n\ntemplate <class GridPartImp, int polynomialOrder, class RangeFieldImp>\nclass FemLocalfunctionsWrapper<GridPartImp, polynomialOrder, RangeFieldImp, 1, 1>\n    : public ContinuousLagrangeSpaceBase<FemLocalfunctionsWrapperTraits<GridPartImp, polynomialOrder, RangeFieldImp, 1,\n                                                                        1>,\n                                         GridPartImp::dimension, RangeFieldImp, 1, 1>\n{\n  typedef ContinuousLagrangeSpaceBase<FemLocalfunctionsWrapperTraits<GridPartImp, polynomialOrder, RangeFieldImp, 1, 1>,\n                                      GridPartImp::dimension, RangeFieldImp, 1, 1> BaseType;\n  typedef FemLocalfunctionsWrapper<GridPartImp, polynomialOrder, RangeFieldImp, 1, 1> ThisType;\n\npublic:\n  typedef FemLocalfunctionsWrapperTraits<GridPartImp, polynomialOrder, RangeFieldImp, 1, 1> Traits;\n\n  typedef typename Traits::GridPartType GridPartType;\n  typedef typename Traits::GridViewType GridViewType;\n  static const int polOrder = Traits::polOrder;\n  typedef typename GridPartType::ctype DomainFieldType;\n  static const unsigned int dimDomain = GridPartType::dimension;\n  typedef FieldVector<DomainFieldType, dimDomain> DomainType;\n  typedef typename Traits::RangeFieldType RangeFieldType;\n  static const unsigned int dimRange     = Traits::dimRange;\n  static const unsigned int dimRangeCols = Traits::dimRangeCols;\n\n  typedef typename Traits::BackendType BackendType;\n  typedef typename Traits::MapperType MapperType;\n  typedef typename Traits::BaseFunctionSetType BaseFunctionSetType;\n  typedef typename Traits::EntityType EntityType;\n\n  typedef Dune::Stuff::LA::SparsityPatternDefault PatternType;\n\nprivate:\n  typedef typename Traits::BaseFunctionSetMapType BaseFunctionSetMapType;\n\npublic:\n  FemLocalfunctionsWrapper(std::shared_ptr<const GridPartType> gridP)\n    : gridPart_(assertGridPart(gridP))\n    , gridView_(std::make_shared<GridViewType>(gridPart_->gridView()))\n    , baseFunctionSetMap_(new BaseFunctionSetMapType(*gridPart_))\n    , backend_(new BackendType(const_cast<GridPartType&>(*gridPart_), *baseFunctionSetMap_))\n    , mapper_(new MapperType(backend_->mapper()))\n    , tmp_global_indices_(mapper_->maxNumDofs())\n  {\n  }\n\n  FemLocalfunctionsWrapper(const ThisType& other)\n    : gridPart_(other.gridPart_)\n    , gridView_(other.gridView_)\n    , baseFunctionSetMap_(other.baseFunctionSetMap_)\n    , backend_(other.backend_)\n    , mapper_(other.mapper_)\n    , tmp_global_indices_(mapper_->maxNumDofs())\n  {\n  }\n\n  ThisType& operator=(const ThisType& other)\n  {\n    if (this != &other) {\n      gridPart_           = other.gridPart_;\n      gridView_           = other.gridView_;\n      baseFunctionSetMap_ = other.baseFunctionSetMap_;\n      backend_            = other.backend_;\n      mapper_ = other.mapper_;\n      tmp_global_indices_.resize(mapper_->maxNumDofs());\n    }\n    return *this;\n  }\n\n  std::shared_ptr<const GridPartType> grid_part() const\n  {\n    return gridPart_;\n  }\n\n  std::shared_ptr<const GridViewType> grid_view() const\n  {\n    return gridView_;\n  }\n\n  const BackendType& backend() const\n  {\n    return *backend_;\n  }\n\n  bool continuous() const\n  {\n    return true;\n  }\n\n  const MapperType& mapper() const\n  {\n    return *mapper_;\n  }\n\n  BaseFunctionSetType base_function_set(const EntityType& entity) const\n  {\n    return BaseFunctionSetType(*baseFunctionSetMap_, entity);\n  }\n\nprivate:\n  static std::shared_ptr<const GridPartType> assertGridPart(const std::shared_ptr<const GridPartType> gP)\n  {\n    \/\/ static checks\n    typedef typename GridPartType::GridType GridType;\n    static_assert((dimDomain == 1) || !std::is_same<GridType, SGrid<dimDomain, dimDomain>>::value,\n                  \"This space is only implemented for simplicial grids!\");\n    static_assert((dimDomain == 1) || !std::is_same<GridType, YaspGrid<dimDomain>>::value,\n                  \"This space is only implemented for simplicial grids!\");\n    \/\/ dynamic checks\n    typedef typename Dune::Fem::AllGeomTypes<typename GridPartType::IndexSetType, typename GridPartType::GridType>\n        AllGeometryTypes;\n    const AllGeometryTypes allGeometryTypes(gP->indexSet());\n    const std::vector<Dune::GeometryType>& geometryTypes = allGeometryTypes.geomTypes(0);\n    if (!(geometryTypes.size() == 1 && geometryTypes[0].isSimplex()))\n      DUNE_THROW(Dune::NotImplemented,\n                 \"\\n\" << Dune::Stuff::Common::colorStringRed(\"ERROR:\")\n                      << \" this space is only implemented for simplicial grids!\");\n    return gP;\n  } \/\/ ... assertGridPart(...)\n\n  std::shared_ptr<const GridPartType> gridPart_;\n  std::shared_ptr<const GridViewType> gridView_;\n  std::shared_ptr<BaseFunctionSetMapType> baseFunctionSetMap_;\n  std::shared_ptr<const BackendType> backend_;\n  std::shared_ptr<const MapperType> mapper_;\n  mutable Dune::DynamicVector<size_t> tmp_global_indices_;\n}; \/\/ class FemLocalfunctionsWrapper< ..., 1, 1 >\n\n\n#else \/\/ HAVE_DUNE_FEM_LOCALFUNCTIONS\n\n\ntemplate <class GridPartImp, int polynomialOrder, class RangeFieldImp, int rangeDim, int rangeDimCols = 1>\nclass FemLocalfunctionsWrapper\n{\n  static_assert(Dune::AlwaysFalse<GridPartImp>::value, \"You are missing dune-fem-localfunctions!\");\n};\n\n\n#endif \/\/ HAVE_DUNE_FEM_LOCALFUNCTIONS\n\n} \/\/ namespace ContinuousLagrangeSpace\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_SPACE_CONTINUOUS_LAGRANGE_FEM_LOCALFUNCTIONS_HH\n<commit_msg>[space.continuouslagrange.fem-localfunctions] use grid capabilities for static checks<commit_after>\/\/ This file is part of the dune-gdt project:\n\/\/   http:\/\/users.dune-project.org\/projects\/dune-gdt\n\/\/ Copyright holders: Felix Albrecht\n\/\/ License: BSD 2-Clause License (http:\/\/opensource.org\/licenses\/BSD-2-Clause)\n\n#ifndef DUNE_GDT_SPACE_CONTINUOUS_LAGRANGE_FEM_LOCALFUNCTIONS_HH\n#define DUNE_GDT_SPACE_CONTINUOUS_LAGRANGE_FEM_LOCALFUNCTIONS_HH\n\n#include <memory>\n#include <type_traits>\n\n#include <dune\/common\/typetraits.hh>\n#include <dune\/common\/static_assert.hh>\n#include <dune\/common\/exceptions.hh>\n\n#include <dune\/geometry\/referenceelements.hh>\n#include <dune\/geometry\/genericgeometry\/topologytypes.hh>\n\n#include <dune\/grid\/common\/capabilities.hh>\n\n#if HAVE_DUNE_LOCALFUNCTIONS\n#include <dune\/localfunctions\/lagrange\/equidistantpoints.hh>\n#include <dune\/localfunctions\/lagrange.hh>\n#endif \/\/ HAVE_DUNE_LOCALFUNCTIONS\n\n#if HAVE_DUNE_FEM_LOCALFUNCTIONS\n#include <dune\/fem_localfunctions\/localfunctions\/transformations.hh>\n#include <dune\/fem_localfunctions\/basefunctions\/genericbasefunctionsetstorage.hh>\n#include <dune\/fem_localfunctions\/basefunctionsetmap\/basefunctionsetmap.hh>\n#include <dune\/fem_localfunctions\/space\/genericdiscretefunctionspace.hh>\n#endif \/\/ HAVE_DUNE_FEM_LOCALFUNCTIONS\n\n#include \"..\/..\/mapper\/fem.hh\"\n#include \"..\/..\/basefunctionset\/fem-localfunctions.hh\"\n#include \"..\/continuouslagrange.hh\"\n\nnamespace Dune {\nnamespace GDT {\nnamespace ContinuousLagrangeSpace {\n\n#if HAVE_DUNE_FEM_LOCALFUNCTIONS\n\n\n\/\/ forward, to be used in the traits and to allow for specialization\ntemplate <class GridPartImp, int polynomialOrder, class RangeFieldImp, int rangeDim, int rangeDimCols = 1>\nclass FemLocalfunctionsWrapper\n{\n  static_assert(Dune::AlwaysFalse<GridPartImp>::value, \"Untested for these dimensions!\");\n};\n\n\n\/**\n *  \\brief Traits class for ContinuousLagrangeSpace::FemLocalfunctionsWrapper.\n *\/\ntemplate <class GridPartImp, int polynomialOrder, class RangeFieldImp, int rangeDim, int rangeDimCols = 1>\nclass FemLocalfunctionsWrapperTraits\n{\npublic:\n  typedef GridPartImp GridPartType;\n  typedef typename GridPartType::GridViewType GridViewType;\n  static const int polOrder = polynomialOrder;\n  static_assert(polOrder >= 1, \"Wrong polOrder given!\");\n\nprivate:\n  typedef typename GridPartType::ctype DomainFieldType;\n\npublic:\n  static const unsigned int dimDomain = GridPartType::dimension;\n  typedef RangeFieldImp RangeFieldType;\n  static const unsigned int dimRange     = rangeDim;\n  static const unsigned int dimRangeCols = rangeDimCols;\n  typedef FemLocalfunctionsWrapper<GridPartType, polOrder, RangeFieldType, dimRange, dimRangeCols> derived_type;\n\nprivate:\n  typedef typename GridPartType::GridType GridType;\n  static_assert(dimDomain == 1 || Dune::Capabilities::hasSingleGeometryType<GridType>::v,\n                \"This space is only implemented for fully simplicial grids!\");\n  static_assert(dimDomain == 1 || (Dune::Capabilities::hasSingleGeometryType<GridType>::topologyId\n                                   == GenericGeometry::SimplexTopology<dimDomain>::type::id),\n                \"This space is only implemented for fully simplicial grids!\");\n  typedef FemLocalfunctionsWrapperTraits<GridPartType, polOrder, RangeFieldType, dimRange, dimRangeCols> ThisType;\n\npublic:\n  typedef Dune::LagrangeLocalFiniteElement<Dune::EquidistantPointSet, dimDomain, DomainFieldType, RangeFieldType>\n      FiniteElementType;\n\nprivate:\n  typedef Dune::FemLocalFunctions::BaseFunctionSetMap<GridPartType, FiniteElementType,\n                                                      Dune::FemLocalFunctions::NoTransformation,\n                                                      Dune::FemLocalFunctions::SimpleStorage, polOrder,\n                                                      polOrder> BaseFunctionSetMapType;\n\npublic:\n  typedef Dune::FemLocalFunctions::DiscreteFunctionSpace<BaseFunctionSetMapType> BackendType;\n  typedef Mapper::FemDofWrapper<typename BackendType::MapperType> MapperType;\n  typedef BaseFunctionSet::FemLocalfunctionsWrapper<BaseFunctionSetMapType, DomainFieldType, dimDomain, RangeFieldType,\n                                                    dimRange, dimRangeCols> BaseFunctionSetType;\n  typedef typename BaseFunctionSetType::EntityType EntityType;\n  static const bool needs_grid_view = false;\n\nprivate:\n  template <class G, int p, class R, int r, int rC>\n  friend class FemLocalfunctionsWrapper;\n}; \/\/ class FemLocalfunctionsWrapperTraits\n\n\ntemplate <class GridPartImp, int polynomialOrder, class RangeFieldImp>\nclass FemLocalfunctionsWrapper<GridPartImp, polynomialOrder, RangeFieldImp, 1, 1>\n    : public ContinuousLagrangeSpaceBase<FemLocalfunctionsWrapperTraits<GridPartImp, polynomialOrder, RangeFieldImp, 1,\n                                                                        1>,\n                                         GridPartImp::dimension, RangeFieldImp, 1, 1>\n{\n  typedef ContinuousLagrangeSpaceBase<FemLocalfunctionsWrapperTraits<GridPartImp, polynomialOrder, RangeFieldImp, 1, 1>,\n                                      GridPartImp::dimension, RangeFieldImp, 1, 1> BaseType;\n  typedef FemLocalfunctionsWrapper<GridPartImp, polynomialOrder, RangeFieldImp, 1, 1> ThisType;\n\npublic:\n  typedef FemLocalfunctionsWrapperTraits<GridPartImp, polynomialOrder, RangeFieldImp, 1, 1> Traits;\n\n  typedef typename Traits::GridPartType GridPartType;\n  typedef typename Traits::GridViewType GridViewType;\n  static const int polOrder = Traits::polOrder;\n  typedef typename GridPartType::ctype DomainFieldType;\n  static const unsigned int dimDomain = GridPartType::dimension;\n  typedef FieldVector<DomainFieldType, dimDomain> DomainType;\n  typedef typename Traits::RangeFieldType RangeFieldType;\n  static const unsigned int dimRange     = Traits::dimRange;\n  static const unsigned int dimRangeCols = Traits::dimRangeCols;\n\n  typedef typename Traits::BackendType BackendType;\n  typedef typename Traits::MapperType MapperType;\n  typedef typename Traits::BaseFunctionSetType BaseFunctionSetType;\n  typedef typename Traits::EntityType EntityType;\n\n  typedef Dune::Stuff::LA::SparsityPatternDefault PatternType;\n\nprivate:\n  typedef typename Traits::BaseFunctionSetMapType BaseFunctionSetMapType;\n\npublic:\n  FemLocalfunctionsWrapper(std::shared_ptr<const GridPartType> gridP)\n    : gridPart_(gridP)\n    , gridView_(std::make_shared<GridViewType>(gridPart_->gridView()))\n    , baseFunctionSetMap_(new BaseFunctionSetMapType(*gridPart_))\n    , backend_(new BackendType(const_cast<GridPartType&>(*gridPart_), *baseFunctionSetMap_))\n    , mapper_(new MapperType(backend_->mapper()))\n    , tmp_global_indices_(mapper_->maxNumDofs())\n  {\n  }\n\n  FemLocalfunctionsWrapper(const ThisType& other)\n    : gridPart_(other.gridPart_)\n    , gridView_(other.gridView_)\n    , baseFunctionSetMap_(other.baseFunctionSetMap_)\n    , backend_(other.backend_)\n    , mapper_(other.mapper_)\n    , tmp_global_indices_(mapper_->maxNumDofs())\n  {\n  }\n\n  ThisType& operator=(const ThisType& other)\n  {\n    if (this != &other) {\n      gridPart_           = other.gridPart_;\n      gridView_           = other.gridView_;\n      baseFunctionSetMap_ = other.baseFunctionSetMap_;\n      backend_            = other.backend_;\n      mapper_ = other.mapper_;\n      tmp_global_indices_.resize(mapper_->maxNumDofs());\n    }\n    return *this;\n  }\n\n  const std::shared_ptr<const GridPartType>& grid_part() const\n  {\n    return gridPart_;\n  }\n\n  const std::shared_ptr<const GridViewType>& grid_view() const\n  {\n    return gridView_;\n  }\n\n  const BackendType& backend() const\n  {\n    return *backend_;\n  }\n\n  bool continuous() const\n  {\n    return true;\n  }\n\n  const MapperType& mapper() const\n  {\n    return *mapper_;\n  }\n\n  BaseFunctionSetType base_function_set(const EntityType& entity) const\n  {\n    return BaseFunctionSetType(*baseFunctionSetMap_, entity);\n  }\n\nprivate:\n  std::shared_ptr<const GridPartType> gridPart_;\n  std::shared_ptr<const GridViewType> gridView_;\n  std::shared_ptr<BaseFunctionSetMapType> baseFunctionSetMap_;\n  std::shared_ptr<const BackendType> backend_;\n  std::shared_ptr<const MapperType> mapper_;\n  mutable Dune::DynamicVector<size_t> tmp_global_indices_;\n}; \/\/ class FemLocalfunctionsWrapper< ..., 1, 1 >\n\n\n#else \/\/ HAVE_DUNE_FEM_LOCALFUNCTIONS\n\n\ntemplate <class GridPartImp, int polynomialOrder, class RangeFieldImp, int rangeDim, int rangeDimCols = 1>\nclass FemLocalfunctionsWrapper\n{\n  static_assert(Dune::AlwaysFalse<GridPartImp>::value, \"You are missing dune-fem-localfunctions!\");\n};\n\n\n#endif \/\/ HAVE_DUNE_FEM_LOCALFUNCTIONS\n\n} \/\/ namespace ContinuousLagrangeSpace\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_SPACE_CONTINUOUS_LAGRANGE_FEM_LOCALFUNCTIONS_HH\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  AKTriangleOscillatorDSPKernel.hpp\n\/\/  AudioKit\n\/\/\n\/\/  Created by Aurelius Prochazka, revision history on Github.\n\/\/  Copyright (c) 2016 Aurelius Prochazka. All rights reserved.\n\/\/\n\n#ifndef AKTriangleOscillatorDSPKernel_hpp\n#define AKTriangleOscillatorDSPKernel_hpp\n\n#import \"AKDSPKernel.hpp\"\n#import \"AKParameterRamper.hpp\"\n\nextern \"C\" {\n#include \"soundpipe.h\"\n}\n\nenum {\n    frequencyAddress = 0,\n    amplitudeAddress = 1,\n    detuningOffsetAddress = 2,\n    detuningMultiplierAddress = 3\n};\n\nclass AKTriangleOscillatorDSPKernel : public AKDSPKernel {\npublic:\n    \/\/ MARK: Member Functions\n\n    AKTriangleOscillatorDSPKernel() {}\n\n    void init(int channelCount, double inSampleRate) {\n        channels = channelCount;\n\n        sampleRate = float(inSampleRate);\n\n        sp_create(&sp);\n        sp_bltriangle_create(&bltriangle);\n        sp_bltriangle_init(sp, bltriangle);\n        *bltriangle->freq = 440;\n        *bltriangle->amp = 0.5;\n    }\n\n\n    void start() {\n        started = true;\n    }\n\n    void stop() {\n        started = false;\n    }\n\n    void destroy() {\n        sp_bltriangle_destroy(&bltriangle);\n        sp_destroy(&sp);\n    }\n\n    void reset() {\n    }\n\n    void setFrequency(float freq) {\n        frequency = freq;\n        frequencyRamper.set(clamp(freq, (float)0.0, (float)20000.0));\n    }\n\n    void setAmplitude(float amp) {\n        amplitude = amp;\n        amplitudeRamper.set(clamp(amp, (float)0.0, (float)1.0));\n    }\n\n    void setDetuningoffset(float detuneOffset) {\n        detuningOffset = detuneOffset;\n        detuningOffsetRamper.set(clamp(detuneOffset, (float)-1000, (float)1000));\n    }\n\n    void setDetuningmultiplier(float detuneScale) {\n        detuningMultiplier = detuneScale;\n        detuningMultiplierRamper.set(clamp(detuneScale, (float)0.9, (float)1.11));\n    }\n\n\n    void setParameter(AUParameterAddress address, AUValue value) {\n        switch (address) {\n            case frequencyAddress:\n                frequencyRamper.set(clamp(value, (float)0.0, (float)20000.0));\n                break;\n\n            case amplitudeAddress:\n                amplitudeRamper.set(clamp(value, (float)0.0, (float)1.0));\n                break;\n\n            case detuningOffsetAddress:\n                detuningOffsetRamper.set(clamp(value, (float)-1000, (float)1000));\n                break;\n\n            case detuningMultiplierAddress:\n                detuningMultiplierRamper.set(clamp(value, (float)0.9, (float)1.11));\n                break;\n\n        }\n    }\n\n    AUValue getParameter(AUParameterAddress address) {\n        switch (address) {\n            case frequencyAddress:\n                return frequencyRamper.goal();\n\n            case amplitudeAddress:\n                return amplitudeRamper.goal();\n\n            case detuningOffsetAddress:\n                return detuningOffsetRamper.goal();\n\n            case detuningMultiplierAddress:\n                return detuningMultiplierRamper.goal();\n\n            default: return 0.0f;\n        }\n    }\n\n    void startRamp(AUParameterAddress address, AUValue value, AUAudioFrameCount duration) override {\n        switch (address) {\n            case frequencyAddress:\n                frequencyRamper.startRamp(clamp(value, (float)0.0, (float)20000.0), duration);\n                break;\n\n            case amplitudeAddress:\n                amplitudeRamper.startRamp(clamp(value, (float)0.0, (float)1.0), duration);\n                break;\n\n            case detuningOffsetAddress:\n                detuningOffsetRamper.startRamp(clamp(value, (float)-1000, (float)1000), duration);\n                break;\n\n            case detuningMultiplierAddress:\n                detuningMultiplierRamper.startRamp(clamp(value, (float)0.9, (float)1.11), duration);\n                break;\n\n        }\n    }\n\n    void setBuffer(AudioBufferList *outBufferList) {\n        outBufferListPtr = outBufferList;\n    }\n\n    void process(AUAudioFrameCount frameCount, AUAudioFrameCount bufferOffset) override {\n        \/\/ For each sample.\n        for (int frameIndex = 0; frameIndex < frameCount; ++frameIndex) {\n            int frameOffset = int(frameIndex + bufferOffset);\n\n            frequency = double(frequencyRamper.getStep());\n            amplitude = double(amplitudeRamper.getStep());\n            detuningOffset = double(detuningOffsetRamper.getStep());\n            detuningMultiplier = double(detuningMultiplierRamper.getStep());\n\n            *bltriangle->freq = frequency;\n            *bltriangle->amp = amplitude;\n\n            float temp = 0;\n            for (int channel = 0; channel < channels; ++channel) {\n                float *out = (float *)outBufferListPtr->mBuffers[channel].mData + frameOffset;\n                if (started) {\n                    if (channel == 0) {\n                        sp_bltriangle_compute(sp, bltriangle, nil, &temp);\n                    }\n                    *out = temp;\n                } else {\n                    *out = 0.0;\n                }\n            }\n        }\n    }\n\n    \/\/ MARK: Member Variables\n\nprivate:\n\n    int channels = 2;\n    float sampleRate = 44100.0;\n\n    AudioBufferList *outBufferListPtr = nullptr;\n\n    sp_data *sp;\n    sp_bltriangle *bltriangle;\n\n\n    float frequency = 440;\n    float amplitude = 0.5;\n    float detuningOffset = 0;\n    float detuningMultiplier = 1;\n\npublic:\n    bool started = false;\n    AKParameterRamper frequencyRamper = 440;\n    AKParameterRamper amplitudeRamper = 0.5;\n    AKParameterRamper detuningOffsetRamper = 0;\n    AKParameterRamper detuningMultiplierRamper = 1;\n};\n\n#endif \/* AKTriangleOscillatorDSPKernel_hpp *\/\n<commit_msg>Properly used detune parameters<commit_after>\/\/\n\/\/  AKTriangleOscillatorDSPKernel.hpp\n\/\/  AudioKit\n\/\/\n\/\/  Created by Aurelius Prochazka, revision history on Github.\n\/\/  Copyright (c) 2016 Aurelius Prochazka. All rights reserved.\n\/\/\n\n#ifndef AKTriangleOscillatorDSPKernel_hpp\n#define AKTriangleOscillatorDSPKernel_hpp\n\n#import \"AKDSPKernel.hpp\"\n#import \"AKParameterRamper.hpp\"\n\nextern \"C\" {\n#include \"soundpipe.h\"\n}\n\nenum {\n    frequencyAddress = 0,\n    amplitudeAddress = 1,\n    detuningOffsetAddress = 2,\n    detuningMultiplierAddress = 3\n};\n\nclass AKTriangleOscillatorDSPKernel : public AKDSPKernel {\npublic:\n    \/\/ MARK: Member Functions\n\n    AKTriangleOscillatorDSPKernel() {}\n\n    void init(int channelCount, double inSampleRate) {\n        channels = channelCount;\n\n        sampleRate = float(inSampleRate);\n\n        sp_create(&sp);\n        sp_bltriangle_create(&bltriangle);\n        sp_bltriangle_init(sp, bltriangle);\n        *bltriangle->freq = 440;\n        *bltriangle->amp = 0.5;\n    }\n\n\n    void start() {\n        started = true;\n    }\n\n    void stop() {\n        started = false;\n    }\n\n    void destroy() {\n        sp_bltriangle_destroy(&bltriangle);\n        sp_destroy(&sp);\n    }\n\n    void reset() {\n    }\n\n    void setFrequency(float freq) {\n        frequency = freq;\n        frequencyRamper.set(clamp(freq, (float)0.0, (float)20000.0));\n    }\n\n    void setAmplitude(float amp) {\n        amplitude = amp;\n        amplitudeRamper.set(clamp(amp, (float)0.0, (float)1.0));\n    }\n\n    void setDetuningoffset(float detuneOffset) {\n        detuningOffset = detuneOffset;\n        detuningOffsetRamper.set(clamp(detuneOffset, (float)-1000, (float)1000));\n    }\n\n    void setDetuningmultiplier(float detuneScale) {\n        detuningMultiplier = detuneScale;\n        detuningMultiplierRamper.set(clamp(detuneScale, (float)0.9, (float)1.11));\n    }\n\n\n    void setParameter(AUParameterAddress address, AUValue value) {\n        switch (address) {\n            case frequencyAddress:\n                frequencyRamper.set(clamp(value, (float)0.0, (float)20000.0));\n                break;\n\n            case amplitudeAddress:\n                amplitudeRamper.set(clamp(value, (float)0.0, (float)1.0));\n                break;\n\n            case detuningOffsetAddress:\n                detuningOffsetRamper.set(clamp(value, (float)-1000, (float)1000));\n                break;\n\n            case detuningMultiplierAddress:\n                detuningMultiplierRamper.set(clamp(value, (float)0.9, (float)1.11));\n                break;\n\n        }\n    }\n\n    AUValue getParameter(AUParameterAddress address) {\n        switch (address) {\n            case frequencyAddress:\n                return frequencyRamper.goal();\n\n            case amplitudeAddress:\n                return amplitudeRamper.goal();\n\n            case detuningOffsetAddress:\n                return detuningOffsetRamper.goal();\n\n            case detuningMultiplierAddress:\n                return detuningMultiplierRamper.goal();\n\n            default: return 0.0f;\n        }\n    }\n\n    void startRamp(AUParameterAddress address, AUValue value, AUAudioFrameCount duration) override {\n        switch (address) {\n            case frequencyAddress:\n                frequencyRamper.startRamp(clamp(value, (float)0.0, (float)20000.0), duration);\n                break;\n\n            case amplitudeAddress:\n                amplitudeRamper.startRamp(clamp(value, (float)0.0, (float)1.0), duration);\n                break;\n\n            case detuningOffsetAddress:\n                detuningOffsetRamper.startRamp(clamp(value, (float)-1000, (float)1000), duration);\n                break;\n\n            case detuningMultiplierAddress:\n                detuningMultiplierRamper.startRamp(clamp(value, (float)0.9, (float)1.11), duration);\n                break;\n\n        }\n    }\n\n    void setBuffer(AudioBufferList *outBufferList) {\n        outBufferListPtr = outBufferList;\n    }\n\n    void process(AUAudioFrameCount frameCount, AUAudioFrameCount bufferOffset) override {\n        \/\/ For each sample.\n        for (int frameIndex = 0; frameIndex < frameCount; ++frameIndex) {\n            int frameOffset = int(frameIndex + bufferOffset);\n\n            frequency = double(frequencyRamper.getStep());\n            amplitude = double(amplitudeRamper.getStep());\n            detuningOffset = double(detuningOffsetRamper.getStep());\n            detuningMultiplier = double(detuningMultiplierRamper.getStep());\n\n            *bltriangle->freq = frequency * detuningMultiplier + detuningOffset;\n            *bltriangle->amp = amplitude;\n\n            float temp = 0;\n            for (int channel = 0; channel < channels; ++channel) {\n                float *out = (float *)outBufferListPtr->mBuffers[channel].mData + frameOffset;\n                if (started) {\n                    if (channel == 0) {\n                        sp_bltriangle_compute(sp, bltriangle, nil, &temp);\n                    }\n                    *out = temp;\n                } else {\n                    *out = 0.0;\n                }\n            }\n        }\n    }\n\n    \/\/ MARK: Member Variables\n\nprivate:\n\n    int channels = 2;\n    float sampleRate = 44100.0;\n\n    AudioBufferList *outBufferListPtr = nullptr;\n\n    sp_data *sp;\n    sp_bltriangle *bltriangle;\n\n\n    float frequency = 440;\n    float amplitude = 0.5;\n    float detuningOffset = 0;\n    float detuningMultiplier = 1;\n\npublic:\n    bool started = false;\n    AKParameterRamper frequencyRamper = 440;\n    AKParameterRamper amplitudeRamper = 0.5;\n    AKParameterRamper detuningOffsetRamper = 0;\n    AKParameterRamper detuningMultiplierRamper = 1;\n};\n\n#endif \/* AKTriangleOscillatorDSPKernel_hpp *\/\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 \"database.hh\"\n#include \"db\/api.hh\"\n\nnamespace validation {\n\nconstexpr size_t max_key_size = std::numeric_limits<uint16_t>::max();\n\n\/**\n * Based on org.apache.cassandra.thrift.ThriftValidation#validate_key()\n *\/\nvoid validate_cql_key(schema_ptr schema, const api::partition_key& key) {\n    if (key.empty()) {\n        throw exceptions::invalid_request_exception(\"Key may not be empty\");\n    }\n\n    \/\/ check that key can be handled by FBUtilities.writeShortByteArray\n    if (key.size() > max_key_size) {\n        throw exceptions::invalid_request_exception(sprint(\"Key length of %s is longer than maximum of %d\", key.size(), max_key_size));\n    }\n\n    try {\n        schema->partition_key_type->validate(key);\n    } catch (const marshal_exception& e) {\n        throw exceptions::invalid_request_exception(e.why());\n    }\n}\n\n}\n<commit_msg>validation: Fix incorrect format specifier<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 \"database.hh\"\n#include \"db\/api.hh\"\n\nnamespace validation {\n\nconstexpr size_t max_key_size = std::numeric_limits<uint16_t>::max();\n\n\/**\n * Based on org.apache.cassandra.thrift.ThriftValidation#validate_key()\n *\/\nvoid validate_cql_key(schema_ptr schema, const api::partition_key& key) {\n    if (key.empty()) {\n        throw exceptions::invalid_request_exception(\"Key may not be empty\");\n    }\n\n    \/\/ check that key can be handled by FBUtilities.writeShortByteArray\n    if (key.size() > max_key_size) {\n        throw exceptions::invalid_request_exception(sprint(\"Key length of %d is longer than maximum of %d\", key.size(), max_key_size));\n    }\n\n    try {\n        schema->partition_key_type->validate(key);\n    } catch (const marshal_exception& e) {\n        throw exceptions::invalid_request_exception(e.why());\n    }\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <ros\/ros.h>\n#include <sensor_msgs\/Joy.h>\n#include <std_msgs\/Bool.h>\n#include <diagnostic_msgs\/DiagnosticStatus.h>\n#include <diagnostic_msgs\/DiagnosticArray.h>\n#include <motor_controller\/speed_steering.h>\n#include <motor_controller\/steering.h>\n#include <motor_controller\/speed.h>\n#include <motor_controller\/ignition_control.h>\n#include <robot_state\/robot_state_constants.h>\n#include <robot_state\/robot_state.h>\n#include <speech_engine\/speech_request.h>\n#include <stdio.h> \/\/ standard input \/ output functions\n#include <string.h> \/\/ string function definitions\n#include <unistd.h> \/\/ UNIX standard function definitions\n#include <fcntl.h> \/\/ File control definitions\n#include <errno.h> \/\/ Error number definitions\n#include <termios.h> \/\/ POSIX terminal control definitions\n#include <time.h>   \/\/ time calls\n#include <ros\/console.h>\n#include <iostream>\n\nusing namespace std;\n\n\/\/const int JoyLinearAxisPositive = 9;\n\/\/const int JoyLinearAxisNegative = 8;\nconst int JoyLinearAxisPositive = 3;\nconst int JoyLinearAxisNegative = 1;\nconst int JoyRotationAxis = 0;\nconst int JoyHeadRotationAxis = 2;\nconst int JoyIgnitionButton = 1;\nconst int JoyIgnitionResetButton = 6;\nconst float MaximumHeadAngle = 90.0f;\nconst float MaximumSteeringAngle = 30.0f;\n\/\/\/ <summary>\n\/\/\/ Maximum forward travel speed in meters per second.\n\/\/\/ <\/summary>\nconst float MaximumForwardSpeed = 1.0f;\n\/\/\/ <summary>\n\/\/\/ Maximum reverse travel speed in meters per second.\n\/\/\/ <\/summary>\nconst float MaximumReverseSpeed = -1.0f;\n\nclass RemoteControllerCls\n{\npublic:\n\tRemoteControllerCls();\n\nprivate:\n\tvoid robotStateCallback(const robot_state::robot_state::ConstPtr& state);\n\tvoid joyCallback(const sensor_msgs::Joy::ConstPtr& joy);\n\tvoid heartBeatStopCallback(const std_msgs::Bool::ConstPtr& stop);\n\tvoid joyDiagCallback(const diagnostic_msgs::DiagnosticArray::ConstPtr& diag);\n\tvoid ChangeState(int new_state);\n\tros::NodeHandle nh_;\n\n\tros::Publisher ignition_control_pub_;\n\tros::Publisher speed_steering_pub_;\n\tros::Subscriber heart_beat_stop_sub_;\n\tros::Subscriber joy_sub_;\n\tros::Subscriber joy_diag_sub_;\n\tros::Subscriber robot_state_sub_;\n\tros::Publisher robot_state_change_request_pub_;\n\tros::Publisher speech_pub_;\n\tbool force_next_ignition_;\n\tint robot_state;\n\tbool joy_ok;\n};\n\nRemoteControllerCls::RemoteControllerCls()\n{\n\tjoy_ok = false;\n\tforce_next_ignition_ = false;\n\t\/\/nh_.param(\"axis_linear\", linear_, linear_);\n\t\/\/nh_.param(\"axis_angular\", angular_, angular_);\n\t\/\/nh_.param(\"scale_angular\", a_scale_, a_scale_);\n\t\/\/nh_.param(\"scale_linear\", l_scale_, l_scale_);\n\tspeech_pub_ = nh_.advertise <speech_engine::speech_request> (\"speech_engine\/speech_request\", 1);\n\theart_beat_stop_sub_ = nh_.subscribe <std_msgs::Bool> (\"heart_beat_stop\", 3, &RemoteControllerCls::heartBeatStopCallback, this);\n\tjoy_sub_ = nh_.subscribe < sensor_msgs::Joy> (\"joy\", 3, &RemoteControllerCls::joyCallback, this);\n\tjoy_diag_sub_ = nh_.subscribe < diagnostic_msgs::DiagnosticArray> (\"diagnostics\", 3, &RemoteControllerCls::joyDiagCallback, this);\n\tspeed_steering_pub_ = nh_.advertise < motor_controller::speed_steering\n\t\t\t> (\"motor_controller\/speed_steering_control\", 1);\n\tignition_control_pub_ = nh_.advertise < motor_controller::ignition_control\n\t\t\t> (\"motor_controller\/ignition_control\", 1);\n\trobot_state_sub_ = nh_.subscribe < robot_state::robot_state > (\"robot_state\/robot_state\", 10, &RemoteControllerCls::robotStateCallback, this);\n\trobot_state_change_request_pub_ = nh_.advertise < robot_state::robot_state> (\"robot_state\/robot_state_change_request\", 1, false);\n}\n\nvoid RemoteControllerCls::heartBeatStopCallback(const std_msgs::Bool::ConstPtr& stop)\n{\n\tif (robot_state != robot_state::robot_state_constants::RobotState_Stop)\n\t{\n\t\tif (stop->data == true)\n\t\t{\n\t\t\tROS_WARN(\"Heart beat not received.\");\n\t\t\trobot_state::robot_state stop_message;\n\t\t\tstop_message.state = robot_state::robot_state_constants::RobotState_Stop;\n\t\t\trobot_state_change_request_pub_.publish(stop_message);\n\n\t\t\tsleep(1);\n\t\t\t\/\/ Speak after state transition.\n\t\t\tspeech_engine::speech_request speech_message;\n\t\t\tstring speech_text = \"Connection lost!\";\n\t\t\tspeech_message.speech_request = speech_text;\n\t\t\tspeech_pub_.publish(speech_message);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tROS_WARN(\"No heart beat message received but value is false???.\");\n\t\t}\n\t}\n}\nvoid RemoteControllerCls::robotStateCallback(const robot_state::robot_state::ConstPtr& state)\n{\n\tChangeState((int)((int)state->state));\n}\n\n\nvoid RemoteControllerCls::ChangeState(int new_state)\n{\n\trobot_state = new_state;\n}\n\nvoid RemoteControllerCls::joyDiagCallback(const diagnostic_msgs::DiagnosticArray::ConstPtr& diag)\n{\n\tif (diag->status.size() > 0)\n\t{\n\t\tif (joy_ok && (diag->status[0].level != 0))\n\t\t{\n\t\t\tROS_WARN(\"Joystick disconnected\");\n\t\t\trobot_state::robot_state stop_message;\n\t\t\tstop_message.state = robot_state::robot_state_constants::RobotState_Stop;\n\t\t\trobot_state_change_request_pub_.publish(stop_message);\n\t\t}\n\t\tjoy_ok = (diag->status[0].level == 0);\n\t}\n\t\/\/ROS_INFO(\"Joy OK\");\n}\n\nvoid RemoteControllerCls::joyCallback(const sensor_msgs::Joy::ConstPtr& joy)\n{\n\t\/\/ROS_INFO(\"Joy callback OK: %d, Buttons: %d,%d,%d,%d\", joy_ok, joy->buttons[0],\n\t\/\/\t\t\t\t\t\tjoy->buttons[1], joy->buttons[2], joy->buttons[3], joy->buttons[4]);\n\tif (!joy_ok)\n\t{\n\n\t}\n\telse\n\t{\n\t\tif (robot_state == robot_state::robot_state_constants::RobotState_Remote)\n\t\t{\n\t\t\tif (joy->buttons[JoyIgnitionResetButton])\n\t\t\t{\n\t\t\t\tforce_next_ignition_ = true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tif (joy->buttons[JoyIgnitionButton])\n\t\t\t\t{\n\t\t\t\t\tROS_INFO(\"Ignition button\");\n\t\t\t\t\tif (force_next_ignition_)\n\t\t\t\t\t{\n\t\t\t\t\t\tforce_next_ignition_ = false;\n\t\t\t\t\t\tmotor_controller::ignition_control ignition_message;\n\t\t\t\t\t\tignition_message.initiate_ignition = 1;\n\t\t\t\t\t\tignition_message.force = 1;\n\t\t\t\t\t\tignition_control_pub_.publish(ignition_message);\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tmotor_controller::ignition_control ignition_message;\n\t\t\t\t\t\tignition_message.initiate_ignition = 1;\n\t\t\t\t\t\tignition_message.force = 0;\n\t\t\t\t\t\tignition_control_pub_.publish(ignition_message);\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\tif (joy_ok)\n\t\t\t\t\t{\n\t\t\t\t\t\tfloat steering = joy->axes[JoyRotationAxis];\n\t\t\t\t\t\tfloat steering_degree = steering * MaximumSteeringAngle;\n\t\t\t\t\t\tfloat head = joy->axes[JoyHeadRotationAxis];\t\t\t\t\t\t\n\t\t\t\t\t\tfloat head_degree = steering * MaximumHeadAngle; \/\/ head * MaximumHeadAngle;\n\n\t\t\t\t\t\tfloat positive_speed = joy->axes[JoyLinearAxisPositive];\n\t\t\t\t\t\t\/\/ Map from [1,-1] to [0,1]\n\t\t\t\t\t\tpositive_speed = (1 - positive_speed) \/ 2.0f;\n\t\t\t\t\t\tfloat negative_speed = joy->axes[JoyLinearAxisNegative];\n\t\t\t\t\t\t\/\/ Map from [1,-1] to [0,1]\n\t\t\t\t\t\tnegative_speed = (1 - negative_speed) \/ 2.0f;\n\t\t\t\t\t\tfloat speed = positive_speed - negative_speed;\n\t\t\t\t\t\tfloat speed_mps = speed * MaximumForwardSpeed;\n\n\t\t\t\t\t\tmotor_controller::speed_steering speed_steering_message;\n\n\t\t\t\t\t\tspeed_steering_message.speed_mps.speed_mps = speed_mps;\n\t\t\t\t\t\tspeed_steering_message.steering_degree.degree = steering_degree;\n\t\t\t\t\t\tspeed_steering_message.head_degree.degree = head_degree;\n\n\t\t\t\t\t\tspeed_steering_pub_.publish(speed_steering_message);\n\t\t\t\t\t\tROS_INFO(\"Joy OK: %d, Speed: %f, Steering %f, Head %f\", joy_ok, speed_mps, steering_degree, head_degree);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nint main(int argc, char** argv)\n{\n\tros::init(argc, argv, \"RemoteController\");\n\tRemoteControllerCls remote_controller;\n\tros::spin();\n}\n\n<commit_msg>Remote control should send 0 speed when state changes<commit_after>#include <ros\/ros.h>\n#include <sensor_msgs\/Joy.h>\n#include <std_msgs\/Bool.h>\n#include <diagnostic_msgs\/DiagnosticStatus.h>\n#include <diagnostic_msgs\/DiagnosticArray.h>\n#include <motor_controller\/speed_steering.h>\n#include <motor_controller\/steering.h>\n#include <motor_controller\/speed.h>\n#include <motor_controller\/ignition_control.h>\n#include <robot_state\/robot_state_constants.h>\n#include <robot_state\/robot_state.h>\n#include <speech_engine\/speech_request.h>\n#include <stdio.h> \/\/ standard input \/ output functions\n#include <string.h> \/\/ string function definitions\n#include <unistd.h> \/\/ UNIX standard function definitions\n#include <fcntl.h> \/\/ File control definitions\n#include <errno.h> \/\/ Error number definitions\n#include <termios.h> \/\/ POSIX terminal control definitions\n#include <time.h>   \/\/ time calls\n#include <ros\/console.h>\n#include <iostream>\n\nusing namespace std;\n\n\/\/const int JoyLinearAxisPositive = 9;\n\/\/const int JoyLinearAxisNegative = 8;\nconst int JoyLinearAxisPositive = 3;\nconst int JoyLinearAxisNegative = 1;\nconst int JoyRotationAxis = 0;\nconst int JoyHeadRotationAxis = 2;\nconst int JoyIgnitionButton = 1;\nconst int JoyIgnitionResetButton = 6;\nconst float MaximumHeadAngle = 90.0f;\nconst float MaximumSteeringAngle = 30.0f;\n\/\/\/ <summary>\n\/\/\/ Maximum forward travel speed in meters per second.\n\/\/\/ <\/summary>\nconst float MaximumForwardSpeed = 1.0f;\n\/\/\/ <summary>\n\/\/\/ Maximum reverse travel speed in meters per second.\n\/\/\/ <\/summary>\nconst float MaximumReverseSpeed = -1.0f;\n\nclass RemoteControllerCls\n{\npublic:\n\tRemoteControllerCls();\n\nprivate:\n\tvoid robotStateCallback(const robot_state::robot_state::ConstPtr& state);\n\tvoid joyCallback(const sensor_msgs::Joy::ConstPtr& joy);\n\tvoid heartBeatStopCallback(const std_msgs::Bool::ConstPtr& stop);\n\tvoid joyDiagCallback(const diagnostic_msgs::DiagnosticArray::ConstPtr& diag);\n\tvoid ChangeState(int new_state);\n\tvoid Stop();\n\tros::NodeHandle nh_;\n\n\tros::Publisher ignition_control_pub_;\n\tros::Publisher speed_steering_pub_;\n\tros::Subscriber heart_beat_stop_sub_;\n\tros::Subscriber joy_sub_;\n\tros::Subscriber joy_diag_sub_;\n\tros::Subscriber robot_state_sub_;\n\tros::Publisher robot_state_change_request_pub_;\n\tros::Publisher speech_pub_;\n\tbool force_next_ignition_;\n\tint robot_state;\n\tbool joy_ok;\n};\n\nvoid RemoteControllerCls::Stop() \n{\n\tmotor_controller::speed_steering speed_steering_message;\n\n\tspeed_steering_message.speed_mps.speed_mps = 0;\n\tspeed_steering_message.steering_degree.degree = 0;\n\tspeed_steering_message.head_degree.degree = 0;\n\n\tspeed_steering_pub_.publish(speed_steering_message);\n\tROS_INFO(\"Joy OK: %d, Speed: %f, Steering %f, Head %f\", joy_ok, 0, 0, 0);\n}\nRemoteControllerCls::RemoteControllerCls()\n{\n\tjoy_ok = false;\n\tforce_next_ignition_ = false;\n\t\/\/nh_.param(\"axis_linear\", linear_, linear_);\n\t\/\/nh_.param(\"axis_angular\", angular_, angular_);\n\t\/\/nh_.param(\"scale_angular\", a_scale_, a_scale_);\n\t\/\/nh_.param(\"scale_linear\", l_scale_, l_scale_);\n\tspeech_pub_ = nh_.advertise <speech_engine::speech_request> (\"speech_engine\/speech_request\", 1);\n\theart_beat_stop_sub_ = nh_.subscribe <std_msgs::Bool> (\"heart_beat_stop\", 3, &RemoteControllerCls::heartBeatStopCallback, this);\n\tjoy_sub_ = nh_.subscribe < sensor_msgs::Joy> (\"joy\", 3, &RemoteControllerCls::joyCallback, this);\n\tjoy_diag_sub_ = nh_.subscribe < diagnostic_msgs::DiagnosticArray> (\"diagnostics\", 3, &RemoteControllerCls::joyDiagCallback, this);\n\tspeed_steering_pub_ = nh_.advertise < motor_controller::speed_steering\n\t\t\t> (\"motor_controller\/speed_steering_control\", 1);\n\tignition_control_pub_ = nh_.advertise < motor_controller::ignition_control\n\t\t\t> (\"motor_controller\/ignition_control\", 1);\n\trobot_state_sub_ = nh_.subscribe < robot_state::robot_state > (\"robot_state\/robot_state\", 10, &RemoteControllerCls::robotStateCallback, this);\n\trobot_state_change_request_pub_ = nh_.advertise < robot_state::robot_state> (\"robot_state\/robot_state_change_request\", 1, false);\n}\n\nvoid RemoteControllerCls::heartBeatStopCallback(const std_msgs::Bool::ConstPtr& stop)\n{\n\tif (robot_state != robot_state::robot_state_constants::RobotState_Stop)\n\t{\n\t\tif (stop->data == true)\n\t\t{\n\t\t\tROS_WARN(\"Heart beat not received.\");\n\t\t\trobot_state::robot_state stop_message;\n\t\t\tstop_message.state = robot_state::robot_state_constants::RobotState_Stop;\n\t\t\trobot_state_change_request_pub_.publish(stop_message);\n\n\t\t\tsleep(1);\n\t\t\t\/\/ Speak after state transition.\n\t\t\tspeech_engine::speech_request speech_message;\n\t\t\tstring speech_text = \"Connection lost!\";\n\t\t\tspeech_message.speech_request = speech_text;\n\t\t\tspeech_pub_.publish(speech_message);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tROS_WARN(\"No heart beat message received but value is false???.\");\n\t\t}\n\t}\n}\nvoid RemoteControllerCls::robotStateCallback(const robot_state::robot_state::ConstPtr& state)\n{\t\n\tChangeState((int)((int)state->state));\n\tStop();\n}\n\n\nvoid RemoteControllerCls::ChangeState(int new_state)\n{\n\trobot_state = new_state;\n}\n\nvoid RemoteControllerCls::joyDiagCallback(const diagnostic_msgs::DiagnosticArray::ConstPtr& diag)\n{\n\tif (diag->status.size() > 0)\n\t{\n\t\tif (joy_ok && (diag->status[0].level != 0))\n\t\t{\n\t\t\tROS_WARN(\"Joystick disconnected\");\n\t\t\trobot_state::robot_state stop_message;\n\t\t\tstop_message.state = robot_state::robot_state_constants::RobotState_Stop;\n\t\t\trobot_state_change_request_pub_.publish(stop_message);\n\t\t}\n\t\tjoy_ok = (diag->status[0].level == 0);\n\t}\n\t\/\/ROS_INFO(\"Joy OK\");\n}\n\nvoid RemoteControllerCls::joyCallback(const sensor_msgs::Joy::ConstPtr& joy)\n{\n\t\/\/ROS_INFO(\"Joy callback OK: %d, Buttons: %d,%d,%d,%d\", joy_ok, joy->buttons[0],\n\t\/\/\t\t\t\t\t\tjoy->buttons[1], joy->buttons[2], joy->buttons[3], joy->buttons[4]);\n\tif (!joy_ok)\n\t{\n\t\tStop();\n\t}\n\telse\n\t{\n\t\tif (robot_state == robot_state::robot_state_constants::RobotState_Remote)\n\t\t{\n\t\t\tif (joy->buttons[JoyIgnitionResetButton])\n\t\t\t{\n\t\t\t\tforce_next_ignition_ = true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tif (joy->buttons[JoyIgnitionButton])\n\t\t\t\t{\n\t\t\t\t\tROS_INFO(\"Ignition button\");\n\t\t\t\t\tif (force_next_ignition_)\n\t\t\t\t\t{\n\t\t\t\t\t\tforce_next_ignition_ = false;\n\t\t\t\t\t\tmotor_controller::ignition_control ignition_message;\n\t\t\t\t\t\tignition_message.initiate_ignition = 1;\n\t\t\t\t\t\tignition_message.force = 1;\n\t\t\t\t\t\tignition_control_pub_.publish(ignition_message);\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tmotor_controller::ignition_control ignition_message;\n\t\t\t\t\t\tignition_message.initiate_ignition = 1;\n\t\t\t\t\t\tignition_message.force = 0;\n\t\t\t\t\t\tignition_control_pub_.publish(ignition_message);\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\tif (joy_ok)\n\t\t\t\t\t{\n\t\t\t\t\t\tfloat steering = joy->axes[JoyRotationAxis];\n\t\t\t\t\t\tfloat steering_degree = steering * MaximumSteeringAngle;\n\t\t\t\t\t\tfloat head = joy->axes[JoyHeadRotationAxis];\t\t\t\t\t\t\n\t\t\t\t\t\tfloat head_degree = steering * MaximumHeadAngle; \/\/ head * MaximumHeadAngle;\n\n\t\t\t\t\t\tfloat positive_speed = joy->axes[JoyLinearAxisPositive];\n\t\t\t\t\t\t\/\/ Map from [1,-1] to [0,1]\n\t\t\t\t\t\tpositive_speed = (1 - positive_speed) \/ 2.0f;\n\t\t\t\t\t\tfloat negative_speed = joy->axes[JoyLinearAxisNegative];\n\t\t\t\t\t\t\/\/ Map from [1,-1] to [0,1]\n\t\t\t\t\t\tnegative_speed = (1 - negative_speed) \/ 2.0f;\n\t\t\t\t\t\tfloat speed = positive_speed - negative_speed;\n\t\t\t\t\t\tfloat speed_mps = speed * MaximumForwardSpeed;\n\n\t\t\t\t\t\tmotor_controller::speed_steering speed_steering_message;\n\n\t\t\t\t\t\tspeed_steering_message.speed_mps.speed_mps = speed_mps;\n\t\t\t\t\t\tspeed_steering_message.steering_degree.degree = steering_degree;\n\t\t\t\t\t\tspeed_steering_message.head_degree.degree = head_degree;\n\n\t\t\t\t\t\tspeed_steering_pub_.publish(speed_steering_message);\n\t\t\t\t\t\tROS_INFO(\"Joy OK: %d, Speed: %f, Steering %f, Head %f\", joy_ok, speed_mps, steering_degree, head_degree);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nint main(int argc, char** argv)\n{\n\tros::init(argc, argv, \"RemoteController\");\n\tRemoteControllerCls remote_controller;\n\tros::spin();\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-2017 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 (2017)\n\n#ifndef DUNE_GDT_TESTS_LINEARELLIPTIC_DISCRETIZERS_BLOCK_IPDG_HH\n#define DUNE_GDT_TESTS_LINEARELLIPTIC_DISCRETIZERS_BLOCK_IPDG_HH\n\n#include <dune\/xt\/common\/timedlogging.hh>\n#include <dune\/xt\/common\/memory.hh>\n#include <dune\/xt\/grid\/boundaryinfo.hh>\n#include <dune\/xt\/grid\/layers.hh>\n#include <dune\/xt\/grid\/gridprovider.hh>\n#include <dune\/xt\/grid\/view\/subdomain\/part.hh>\n#include <dune\/xt\/la\/container.hh>\n\n#include <dune\/gdt\/playground\/spaces\/block.hh>\n#include <dune\/gdt\/local\/integrands\/elliptic-ipdg.hh>\n#include <dune\/gdt\/local\/functionals\/integrals.hh>\n#include <dune\/gdt\/local\/operators\/integrals.hh>\n\n#include \"..\/problems\/base.hh\"\n#include \"base.hh\"\n#include \"ipdg.hh\"\n\nnamespace Dune {\nnamespace GDT {\nnamespace LinearElliptic {\n\n\n\/**\n * \\todo add pattern() to StationaryContainerBasedDefaultDiscretization, avoid computation of local_pattern below\n *\/\ntemplate <class GridType,\n          Backends spacebackend = Backends::fem, \/\/ we only have local grid parts atm\n          XT::LA::Backends la = XT::LA::default_sparse_backend,\n          int pol = 1,\n          class RangeFieldType = double,\n          size_t dimRange = 1,\n          LocalEllipticIpdgIntegrands::Method local_method = LocalEllipticIpdgIntegrands::default_method,\n          LocalEllipticIpdgIntegrands::Method coupling_method = LocalEllipticIpdgIntegrands::default_method>\nclass BlockIpdgDiscretizer\n{\n  typedef IpdgDiscretizer<GridType,\n                          XT::Grid::Layers::dd_subdomain,\n                          spacebackend,\n                          la,\n                          pol,\n                          RangeFieldType,\n                          dimRange,\n                          local_method>\n      LocalDiscretizer;\n  typedef typename LocalDiscretizer::DiscretizationType LocalDiscretizationType;\n  typedef typename LocalDiscretizer::SpaceType LocalSpaceType;\n\npublic:\n  typedef typename LocalDiscretizer::ProblemType ProblemType;\n  typedef BlockSpace<LocalSpaceType> SpaceType;\n  typedef typename LocalDiscretizer::MatrixType MatrixType;\n  typedef typename LocalDiscretizer::VectorType VectorType;\n  typedef StationaryContainerBasedDefaultDiscretization<ProblemType, SpaceType, MatrixType, VectorType, SpaceType>\n      DiscretizationType;\n  static const constexpr ChooseDiscretizer type = ChooseDiscretizer::block_ipdg;\n  static const constexpr XT::LA::Backends la_backend = la;\n  static const int polOrder = pol;\n\n  static std::string static_id()\n  {\n    return std::string(\"gdt.linearelliptic.discretization.block-ipdg.order_\")\n           + Dune::XT::Common::to_string(int(polOrder)); \/\/ int() needed, otherwise we get a linker error\n  }\n\n  static DiscretizationType\n  discretize(XT::Grid::GridProvider<GridType, XT::Grid::DD::SubdomainGrid<GridType>>& grid_provider,\n             const ProblemType& problem,\n             const int \/*level*\/ = 0,\n             const size_t inner_boundary_index = std::numeric_limits<size_t>::max() - 42)\n  {\n    auto logger = XT::Common::TimedLogger().get(static_id());\n    const auto& dd_grid = grid_provider.dd_grid();\n    logger.info() << \"Creating \" << dd_grid.size() << \" local discretizations... \" << std::endl;\n    XT::Common::Configuration local_boundary_cfg;\n    local_boundary_cfg[\"type\"] = \"xt.grid.boundaryinfo.boundarysegmentindexbased\";\n    local_boundary_cfg[\"default\"] = \"dirichlet\";\n    local_boundary_cfg[\"neumann\"] =\n        \"[\" + XT::Common::to_string(inner_boundary_index) + \" \" + XT::Common::to_string(inner_boundary_index + 1) + \"]\";\n    LinearElliptic::ProblemBase<typename GridType::template Codim<0>::Entity,\n                                typename GridType::ctype,\n                                GridType::dimension,\n                                typename SpaceType::RangeFieldType,\n                                1>\n        local_problem(problem.diffusion_factor(),\n                      problem.diffusion_tensor(),\n                      problem.force(),\n                      problem.dirichlet(),\n                      problem.neumann(),\n                      XT::Common::Configuration(),\n                      local_boundary_cfg);\n    std::vector<LocalDiscretizationType> local_discretizations;\n    auto local_spaces_ptr = std::make_shared<std::vector<LocalSpaceType>>();\n    auto& local_spaces = *local_spaces_ptr;\n    for (size_t ss = 0; ss < dd_grid.size(); ++ss) {\n      local_discretizations.emplace_back(\n          LocalDiscretizer::discretize(grid_provider, local_problem, boost::numeric_cast<int>(ss)));\n      local_spaces.emplace_back(local_discretizations.back().test_space());\n    }\n    logger.info() << \"Creating space... \" << std::endl;\n    SpaceType space(dd_grid, local_spaces_ptr);\n\n    logger.info() << \"Preparing container...\" << std::endl;\n    std::vector<XT::LA::SparsityPatternDefault> local_patterns(dd_grid.size());\n    std::vector<std::map<size_t, XT::LA::SparsityPatternDefault>> inside_outside_patterns(dd_grid.size());\n    std::vector<std::map<size_t, XT::LA::SparsityPatternDefault>> outside_inside_patterns(dd_grid.size());\n    std::map<size_t, XT::LA::SparsityPatternDefault> boundary_patterns;\n    XT::LA::SparsityPatternDefault pattern(space.mapper().size());\n    for (size_t ss = 0; ss < dd_grid.size(); ++ss) {\n      local_patterns[ss] = local_spaces[ss].compute_face_and_volume_pattern(); \/\/ todo: from the local discretization\n      copy_local_to_global(local_patterns[ss], space, ss, ss, pattern);\n      if (dd_grid.boundary(ss)) {\n        \/\/ in general, this can differ from the local one (think of CG)\n        boundary_patterns[ss] = local_spaces[ss].compute_face_pattern(dd_grid.boundaryGridPart(ss));\n        copy_local_to_global(boundary_patterns[ss], space, ss, ss, pattern);\n      }\n      for (auto&& nn : dd_grid.neighborsOf(ss)) {\n        if (ss < nn) { \/\/  each coupling only once\n          inside_outside_patterns[ss][nn] =\n              local_spaces[ss].compute_face_pattern(dd_grid.couplingGridPart(ss, nn), local_spaces[nn]);\n          copy_local_to_global(inside_outside_patterns[ss][nn], space, ss, nn, pattern);\n          outside_inside_patterns[nn][ss] =\n              local_spaces[nn].compute_face_pattern(dd_grid.couplingGridPart(nn, ss), local_spaces[ss]);\n          copy_local_to_global(outside_inside_patterns[nn][ss], space, nn, ss, pattern);\n        }\n      }\n    }\n    pattern.sort();\n    MatrixType system_matrix(space.mapper().size(), space.mapper().size(), pattern);\n    VectorType rhs_vector(space.mapper().size());\n    for (size_t ss = 0; ss < dd_grid.size(); ++ss) {\n      copy_local_to_global(local_discretizations[ss].system_matrix(), local_patterns[ss], space, ss, ss, system_matrix);\n      copy_local_to_global(local_discretizations[ss].rhs_vector(), space, ss, rhs_vector);\n    }\n\n    logger.info() << \"Assembling coupling contributions...\" << std::endl;\n    for (size_t ss = 0; ss < dd_grid.size(); ++ss) {\n      for (auto&& nn : dd_grid.neighborsOf(ss)) {\n        if (ss < nn) { \/\/  each coupling only once\n          MatrixType inside_inside_matrix(\n              local_spaces[ss].mapper().size(), local_spaces[ss].mapper().size(), local_patterns[ss]);\n          MatrixType outside_outside_matrix(\n              local_spaces[nn].mapper().size(), local_spaces[nn].mapper().size(), local_patterns[nn]);\n          MatrixType inside_outside_matrix(\n              local_spaces[ss].mapper().size(), local_spaces[nn].mapper().size(), inside_outside_patterns[ss][nn]);\n          MatrixType outside_inside_matrix(\n              local_spaces[nn].mapper().size(), local_spaces[ss].mapper().size(), outside_inside_patterns[nn][ss]);\n          auto coupling_grid_part = dd_grid.couplingGridPart(ss, nn);\n          \/\/ put all of this into a coupling operator\n          SystemAssembler<LocalSpaceType, decltype(coupling_grid_part)> coupling_assembler(\n              coupling_grid_part, local_spaces[ss], local_spaces[ss], local_spaces[nn], local_spaces[nn]);\n          typedef XT::Grid::extract_intersection_t<decltype(coupling_grid_part)> IntersectionType;\n          typedef LocalEllipticIpdgIntegrands::Inner<typename ProblemType::DiffusionFactorType,\n                                                     typename ProblemType::DiffusionTensorType,\n                                                     coupling_method>\n              CouplingIntegrandType;\n          LocalCouplingIntegralOperator<CouplingIntegrandType,\n                                        typename LocalSpaceType::BaseFunctionSetType,\n                                        IntersectionType>\n              local_coupling_operator(problem.diffusion_factor(), problem.diffusion_tensor());\n          LocalCouplingTwoFormAssembler<LocalSpaceType, IntersectionType, MatrixType> local_coupling_assembler(\n              local_coupling_operator);\n          coupling_assembler.append(local_coupling_assembler,\n                                    inside_inside_matrix,\n                                    outside_outside_matrix,\n                                    inside_outside_matrix,\n                                    outside_inside_matrix);\n          coupling_assembler.assemble();\n          copy_local_to_global(inside_inside_matrix, local_patterns[ss], space, ss, ss, system_matrix);\n          copy_local_to_global(outside_outside_matrix, local_patterns[nn], space, nn, nn, system_matrix);\n          copy_local_to_global(inside_outside_matrix, inside_outside_patterns[ss][nn], space, ss, nn, system_matrix);\n          copy_local_to_global(outside_inside_matrix, outside_inside_patterns[nn][ss], space, nn, ss, system_matrix);\n        }\n      }\n    }\n\n    logger.info() << \"Assembling boundary contributions...\" << std::endl;\n    for (size_t ss = 0; ss < dd_grid.size(); ++ss) {\n      if (dd_grid.boundary(ss)) {\n        auto boundary_grid_part = dd_grid.boundaryGridPart(ss);\n        auto boundary_pattern = local_spaces[ss].compute_face_and_volume_pattern(boundary_grid_part);\n        MatrixType boundary_matrix(\n            local_spaces[ss].mapper().size(), local_spaces[ss].mapper().size(), boundary_pattern);\n        VectorType boundary_vector(local_spaces[ss].mapper().size());\n        SystemAssembler<LocalSpaceType, decltype(boundary_grid_part)> boundary_assembler(local_spaces[ss],\n                                                                                         boundary_grid_part);\n        typedef XT::Grid::extract_intersection_t<decltype(boundary_grid_part)> IntersectionType;\n        auto boundary_info = XT::Grid::BoundaryInfoFactory<IntersectionType>::create(problem.boundary_info_cfg());\n        typedef LocalEllipticIpdgIntegrands::BoundaryLHS<typename ProblemType::DiffusionFactorType,\n                                                         typename ProblemType::DiffusionTensorType,\n                                                         coupling_method>\n            BoundaryLhsIntegrandType;\n        LocalBoundaryIntegralOperator<BoundaryLhsIntegrandType,\n                                      typename LocalSpaceType::BaseFunctionSetType,\n                                      IntersectionType>\n            local_boundary_operator(problem.diffusion_factor(), problem.diffusion_tensor());\n        LocalBoundaryTwoFormAssembler<LocalSpaceType, IntersectionType, MatrixType> local_boundary_operator_assembler(\n            local_boundary_operator);\n        boundary_assembler.append(\n            local_boundary_operator_assembler,\n            boundary_matrix,\n            new XT::Grid::ApplyOn::DirichletIntersections<decltype(boundary_grid_part)>(*boundary_info));\n        typedef LocalEllipticIpdgIntegrands::BoundaryRHS<typename ProblemType::FunctionType,\n                                                         typename ProblemType::DiffusionFactorType,\n                                                         typename ProblemType::DiffusionTensorType,\n                                                         coupling_method>\n            BoundaryRhsIntegrandType;\n        LocalFaceIntegralFunctional<BoundaryRhsIntegrandType,\n                                    typename LocalSpaceType::BaseFunctionSetType,\n                                    IntersectionType>\n            local_boundary_functional(problem.dirichlet(), problem.diffusion_factor(), problem.diffusion_tensor());\n        LocalFaceFunctionalAssembler<LocalSpaceType, IntersectionType, VectorType> local_boundary_functional_assembler(\n            local_boundary_functional);\n        boundary_assembler.append(\n            local_boundary_functional_assembler,\n            boundary_vector,\n            new XT::Grid::ApplyOn::DirichletIntersections<decltype(boundary_grid_part)>(*boundary_info));\n        boundary_assembler.assemble();\n        copy_local_to_global(boundary_matrix, boundary_pattern, space, ss, ss, system_matrix);\n        copy_local_to_global(boundary_vector, space, ss, rhs_vector);\n      }\n    }\n\n    \/\/ create the discretization (no copy of the containers done here, bc. of cow)\n    return DiscretizationType(problem, space, system_matrix, rhs_vector);\n  } \/\/ ... discretize(...)\n\nprivate:\n  static void copy_local_to_global(const XT::LA::SparsityPatternDefault& local_pattern,\n                                   const SpaceType& space,\n                                   const size_t test_subdomain,\n                                   const size_t ansatz_subdomain,\n                                   XT::LA::SparsityPatternDefault& global_pattern)\n  {\n    const auto& mapper = space.mapper();\n    for (size_t local_ii = 0; local_ii < local_pattern.size(); ++local_ii) {\n      const size_t global_ii = mapper.mapToGlobal(test_subdomain, local_ii);\n      const auto& local_rows = local_pattern.inner(local_ii);\n      for (const auto& local_jj : local_rows) {\n        const size_t global_jj = mapper.mapToGlobal(ansatz_subdomain, local_jj);\n        global_pattern.insert(global_ii, global_jj);\n      }\n    }\n  } \/\/ ... copy_local_to_global(...)\n\n  static void copy_local_to_global(const MatrixType& local_matrix,\n                                   const XT::LA::SparsityPatternDefault& local_pattern,\n                                   const SpaceType& space,\n                                   const size_t test_subdomain,\n                                   const size_t ansatz_subdomain,\n                                   MatrixType& global_matrix)\n  {\n    for (size_t local_ii = 0; local_ii < local_pattern.size(); ++local_ii) {\n      const size_t global_ii = space.mapper().mapToGlobal(test_subdomain, local_ii);\n      for (const size_t& local_jj : local_pattern.inner(local_ii)) {\n        const size_t global_jj = space.mapper().mapToGlobal(ansatz_subdomain, local_jj);\n        global_matrix.add_to_entry(global_ii, global_jj, local_matrix.get_entry(local_ii, local_jj));\n      }\n    }\n  } \/\/ ... copy_local_to_global_matrix(...)\n\n  static void copy_local_to_global(const VectorType& local_vector,\n                                   const SpaceType& space,\n                                   const size_t subdomain,\n                                   VectorType& global_vector)\n  {\n    for (size_t local_ii = 0; local_ii < local_vector.size(); ++local_ii) {\n      const size_t global_ii = space.mapper().mapToGlobal(subdomain, local_ii);\n      global_vector.add_to_entry(global_ii, local_vector.get_entry(local_ii));\n    }\n  } \/\/ ... copy_local_to_global_matrix(...)\n}; \/\/ class BlockIpdgDiscretizer\n\n\n} \/\/ namespace LinearElliptic\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_TESTS_LINEARELLIPTIC_DISCRETIZERS_BLOCK_IPDG_HH\n<commit_msg>[test.linearelliptic.block-ipdg] fix discretizer<commit_after>\/\/ This file is part of the dune-gdt project:\n\/\/   https:\/\/github.com\/dune-community\/dune-gdt\n\/\/ Copyright 2010-2017 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 (2017)\n\n#ifndef DUNE_GDT_TESTS_LINEARELLIPTIC_DISCRETIZERS_BLOCK_IPDG_HH\n#define DUNE_GDT_TESTS_LINEARELLIPTIC_DISCRETIZERS_BLOCK_IPDG_HH\n\n#include <dune\/xt\/common\/memory.hh>\n#include <dune\/xt\/common\/numeric_cast.hh>\n#include <dune\/xt\/common\/timedlogging.hh>\n#include <dune\/xt\/grid\/boundaryinfo.hh>\n#include <dune\/xt\/grid\/layers.hh>\n#include <dune\/xt\/grid\/gridprovider.hh>\n#include <dune\/xt\/grid\/view\/subdomain\/part.hh>\n#include <dune\/xt\/la\/container.hh>\n\n#include <dune\/gdt\/playground\/spaces\/block.hh>\n#include <dune\/gdt\/local\/integrands\/elliptic-ipdg.hh>\n#include <dune\/gdt\/local\/functionals\/integrals.hh>\n#include <dune\/gdt\/local\/operators\/integrals.hh>\n\n#include \"..\/problems\/base.hh\"\n#include \"base.hh\"\n#include \"ipdg.hh\"\n\nnamespace Dune {\nnamespace GDT {\nnamespace LinearElliptic {\n\n\n\/**\n * \\todo add pattern() to StationaryContainerBasedDefaultDiscretization, avoid computation of local_pattern below\n *\/\ntemplate <class GridType,\n          Backends spacebackend = Backends::fem, \/\/ we only have local grid parts atm\n          XT::LA::Backends la = XT::LA::default_sparse_backend,\n          int pol = 1,\n          class RangeFieldType = double,\n          size_t dimRange = 1,\n          LocalEllipticIpdgIntegrands::Method local_method = LocalEllipticIpdgIntegrands::default_method,\n          LocalEllipticIpdgIntegrands::Method coupling_method = LocalEllipticIpdgIntegrands::default_method>\nclass BlockIpdgDiscretizer\n{\n  typedef IpdgDiscretizer<GridType,\n                          XT::Grid::Layers::dd_subdomain,\n                          spacebackend,\n                          la,\n                          pol,\n                          RangeFieldType,\n                          dimRange,\n                          local_method>\n      LocalDiscretizer;\n  typedef typename LocalDiscretizer::DiscretizationType LocalDiscretizationType;\n  typedef typename LocalDiscretizer::SpaceType LocalSpaceType;\n\npublic:\n  typedef typename LocalDiscretizer::ProblemType ProblemType;\n  typedef BlockSpace<LocalSpaceType> SpaceType;\n  typedef typename LocalDiscretizer::MatrixType MatrixType;\n  typedef typename LocalDiscretizer::VectorType VectorType;\n  typedef StationaryContainerBasedDefaultDiscretization<ProblemType, SpaceType, MatrixType, VectorType, SpaceType>\n      DiscretizationType;\n  static const constexpr ChooseDiscretizer type = ChooseDiscretizer::block_ipdg;\n  static const constexpr XT::LA::Backends la_backend = la;\n  static const int polOrder = pol;\n\n  static std::string static_id()\n  {\n    return std::string(\"gdt.linearelliptic.discretization.block-ipdg.order_\")\n           + Dune::XT::Common::to_string(int(polOrder)); \/\/ int() needed, otherwise we get a linker error\n  }\n\n  static DiscretizationType\n  discretize(XT::Grid::GridProvider<GridType, XT::Grid::DD::SubdomainGrid<GridType>>& grid_provider,\n             const ProblemType& problem,\n             const int \/*level*\/ = 0)\n  {\n    auto logger = XT::Common::TimedLogger().get(static_id());\n    const auto& dd_grid = grid_provider.dd_grid();\n    logger.info() << \"Creating \" << dd_grid.size() << \" local discretizations... \" << std::endl;\n    const LinearElliptic::ProblemBase<typename GridType::template Codim<0>::Entity,\n                                      typename GridType::ctype,\n                                      GridType::dimension,\n                                      typename SpaceType::RangeFieldType,\n                                      1>\n        local_problem(problem.diffusion_factor(),\n                      problem.diffusion_tensor(),\n                      problem.force(),\n                      problem.dirichlet(),\n                      problem.neumann(),\n                      XT::Common::Configuration(),\n                      XT::Grid::allneumann_boundaryinfo_default_config());\n    std::vector<LocalDiscretizationType> local_discretizations;\n    auto local_spaces_ptr = std::make_shared<std::vector<LocalSpaceType>>();\n    auto& local_spaces = *local_spaces_ptr;\n    for (size_t ss = 0; ss < dd_grid.size(); ++ss)\n      local_discretizations.emplace_back(\n          LocalDiscretizer::discretize(grid_provider, local_problem, XT::Common::numeric_cast<int>(ss)));\n\n    logger.info() << \"Creating space... \" << std::endl;\n    for (size_t ss = 0; ss < dd_grid.size(); ++ss)\n      local_spaces.emplace_back(local_discretizations[ss].test_space());\n    SpaceType space(dd_grid, local_spaces_ptr);\n\n    logger.info() << \"Preparing container...\" << std::endl;\n    std::vector<XT::LA::SparsityPatternDefault> local_patterns(dd_grid.size());\n    std::map<size_t, XT::LA::SparsityPatternDefault> boundary_patterns;\n    std::vector<std::map<size_t, XT::LA::SparsityPatternDefault>> coupling_patterns(dd_grid.size());\n    XT::LA::SparsityPatternDefault pattern(space.mapper().size());\n    for (size_t ss = 0; ss < dd_grid.size(); ++ss) {\n      local_patterns[ss] = local_spaces[ss].compute_face_and_volume_pattern();\n      copy_local_to_global(local_patterns[ss], space, ss, ss, pattern);\n      if (dd_grid.boundary(ss)) {\n        boundary_patterns[ss] = local_spaces[ss].compute_volume_pattern(dd_grid.boundaryGridPart(ss));\n        copy_local_to_global(boundary_patterns[ss], space, ss, ss, pattern);\n      }\n      coupling_patterns[ss][ss] = local_spaces[ss].compute_volume_pattern(); \/\/ this is too much, but we are relazy here\n      for (auto&& nn : dd_grid.neighborsOf(ss)) {\n        if (ss < nn) { \/\/  each coupling only once\n          coupling_patterns[ss][nn] =\n              local_spaces[ss].compute_face_pattern(dd_grid.couplingGridPart(ss, nn), local_spaces[nn]);\n          coupling_patterns[nn][ss] =\n              local_spaces[nn].compute_face_pattern(dd_grid.couplingGridPart(nn, ss), local_spaces[ss]);\n          copy_local_to_global(coupling_patterns[ss][ss], space, ss, ss, pattern);\n          copy_local_to_global(coupling_patterns[ss][nn], space, ss, nn, pattern);\n          copy_local_to_global(coupling_patterns[nn][ss], space, nn, ss, pattern);\n        }\n      }\n    }\n    pattern.sort();\n    MatrixType system_matrix(space.mapper().size(), space.mapper().size(), pattern);\n    VectorType rhs_vector(space.mapper().size());\n    for (size_t ss = 0; ss < dd_grid.size(); ++ss) {\n      copy_local_to_global(local_discretizations[ss].system_matrix(), local_patterns[ss], space, ss, ss, system_matrix);\n      copy_local_to_global(local_discretizations[ss].rhs_vector(), space, ss, rhs_vector);\n    }\n\n    logger.info() << \"Assembling coupling contributions...\" << std::endl;\n    for (size_t ss = 0; ss < dd_grid.size(); ++ss) {\n      for (auto&& nn : dd_grid.neighborsOf(ss)) {\n        if (ss < nn) { \/\/  each coupling only once\n          MatrixType inside_inside_matrix(\n              local_spaces[ss].mapper().size(), local_spaces[ss].mapper().size(), coupling_patterns[ss][ss]);\n          MatrixType outside_outside_matrix(\n              local_spaces[nn].mapper().size(), local_spaces[nn].mapper().size(), coupling_patterns[nn][nn]);\n          MatrixType inside_outside_matrix(\n              local_spaces[ss].mapper().size(), local_spaces[nn].mapper().size(), coupling_patterns[ss][nn]);\n          MatrixType outside_inside_matrix(\n              local_spaces[nn].mapper().size(), local_spaces[ss].mapper().size(), coupling_patterns[nn][ss]);\n          auto coupling_grid_part = dd_grid.couplingGridPart(ss, nn);\n          \/\/ put all of this into a coupling operator\n          SystemAssembler<LocalSpaceType, decltype(coupling_grid_part)> coupling_assembler(\n              coupling_grid_part, local_spaces[ss], local_spaces[ss], local_spaces[nn], local_spaces[nn]);\n          typedef XT::Grid::extract_intersection_t<decltype(coupling_grid_part)> IntersectionType;\n          typedef LocalEllipticIpdgIntegrands::Inner<typename ProblemType::DiffusionFactorType,\n                                                     typename ProblemType::DiffusionTensorType,\n                                                     coupling_method>\n              CouplingIntegrandType;\n          LocalCouplingIntegralOperator<CouplingIntegrandType,\n                                        typename LocalSpaceType::BaseFunctionSetType,\n                                        IntersectionType>\n              local_coupling_operator(problem.diffusion_factor(), problem.diffusion_tensor());\n          coupling_assembler.append(local_coupling_operator,\n                                    inside_inside_matrix,\n                                    outside_outside_matrix,\n                                    inside_outside_matrix,\n                                    outside_inside_matrix);\n          coupling_assembler.assemble();\n          copy_local_to_global(inside_inside_matrix, coupling_patterns[ss][ss], space, ss, ss, system_matrix);\n          copy_local_to_global(outside_outside_matrix, coupling_patterns[nn][nn], space, nn, nn, system_matrix);\n          copy_local_to_global(inside_outside_matrix, coupling_patterns[ss][nn], space, ss, nn, system_matrix);\n          copy_local_to_global(outside_inside_matrix, coupling_patterns[nn][ss], space, nn, ss, system_matrix);\n        }\n      }\n    }\n\n    logger.info() << \"Assembling boundary contributions...\" << std::endl;\n    for (size_t ss = 0; ss < dd_grid.size(); ++ss) {\n      if (dd_grid.boundary(ss)) {\n        auto boundary_grid_part = dd_grid.boundaryGridPart(ss);\n        MatrixType boundary_matrix(\n            local_spaces[ss].mapper().size(), local_spaces[ss].mapper().size(), boundary_patterns[ss]);\n        VectorType boundary_vector(local_spaces[ss].mapper().size());\n        SystemAssembler<LocalSpaceType, decltype(boundary_grid_part)> boundary_assembler(local_spaces[ss],\n                                                                                         boundary_grid_part);\n        typedef XT::Grid::extract_intersection_t<decltype(boundary_grid_part)> IntersectionType;\n        auto boundary_info = XT::Grid::BoundaryInfoFactory<IntersectionType>::create(problem.boundary_info_cfg());\n        typedef LocalEllipticIpdgIntegrands::BoundaryLHS<typename ProblemType::DiffusionFactorType,\n                                                         typename ProblemType::DiffusionTensorType,\n                                                         coupling_method>\n            BoundaryLhsIntegrandType;\n        LocalBoundaryIntegralOperator<BoundaryLhsIntegrandType,\n                                      typename LocalSpaceType::BaseFunctionSetType,\n                                      IntersectionType>\n            local_boundary_operator(problem.diffusion_factor(), problem.diffusion_tensor());\n        boundary_assembler.append(\n            local_boundary_operator,\n            boundary_matrix,\n            new XT::Grid::ApplyOn::DirichletIntersections<decltype(boundary_grid_part)>(*boundary_info));\n        typedef LocalEllipticIpdgIntegrands::BoundaryRHS<typename ProblemType::FunctionType,\n                                                         typename ProblemType::DiffusionFactorType,\n                                                         typename ProblemType::DiffusionTensorType,\n                                                         coupling_method>\n            BoundaryRhsIntegrandType;\n        LocalFaceIntegralFunctional<BoundaryRhsIntegrandType,\n                                    typename LocalSpaceType::BaseFunctionSetType,\n                                    IntersectionType>\n            local_boundary_functional(problem.dirichlet(), problem.diffusion_factor(), problem.diffusion_tensor());\n        LocalFaceFunctionalAssembler<LocalSpaceType, IntersectionType, VectorType> local_boundary_functional_assembler(\n            local_boundary_functional);\n        boundary_assembler.append(\n            local_boundary_functional_assembler,\n            boundary_vector,\n            new XT::Grid::ApplyOn::DirichletIntersections<decltype(boundary_grid_part)>(*boundary_info));\n        boundary_assembler.assemble();\n        copy_local_to_global(boundary_matrix, boundary_patterns[ss], space, ss, ss, system_matrix);\n        copy_local_to_global(boundary_vector, space, ss, rhs_vector);\n      }\n    }\n\n    \/\/ create the discretization (no copy of the containers done here, bc. of cow)\n    return DiscretizationType(problem, space, system_matrix, rhs_vector);\n  } \/\/ ... discretize(...)\n\nprivate:\n  static void copy_local_to_global(const XT::LA::SparsityPatternDefault& local_pattern,\n                                   const SpaceType& space,\n                                   const size_t test_subdomain,\n                                   const size_t ansatz_subdomain,\n                                   XT::LA::SparsityPatternDefault& global_pattern)\n  {\n    const auto& mapper = space.mapper();\n    for (size_t local_ii = 0; local_ii < local_pattern.size(); ++local_ii) {\n      const size_t global_ii = mapper.mapToGlobal(test_subdomain, local_ii);\n      const auto& local_rows = local_pattern.inner(local_ii);\n      for (const auto& local_jj : local_rows) {\n        const size_t global_jj = mapper.mapToGlobal(ansatz_subdomain, local_jj);\n        global_pattern.insert(global_ii, global_jj);\n      }\n    }\n  } \/\/ ... copy_local_to_global(...)\n\n  static void copy_local_to_global(const MatrixType& local_matrix,\n                                   const XT::LA::SparsityPatternDefault& local_pattern,\n                                   const SpaceType& space,\n                                   const size_t test_subdomain,\n                                   const size_t ansatz_subdomain,\n                                   MatrixType& global_matrix)\n  {\n    for (size_t local_ii = 0; local_ii < local_pattern.size(); ++local_ii) {\n      const size_t global_ii = space.mapper().mapToGlobal(test_subdomain, local_ii);\n      for (const size_t& local_jj : local_pattern.inner(local_ii)) {\n        const size_t global_jj = space.mapper().mapToGlobal(ansatz_subdomain, local_jj);\n        global_matrix.add_to_entry(global_ii, global_jj, local_matrix.get_entry(local_ii, local_jj));\n      }\n    }\n  } \/\/ ... copy_local_to_global_matrix(...)\n\n  static void copy_local_to_global(const VectorType& local_vector,\n                                   const SpaceType& space,\n                                   const size_t subdomain,\n                                   VectorType& global_vector)\n  {\n    for (size_t local_ii = 0; local_ii < local_vector.size(); ++local_ii) {\n      const size_t global_ii = space.mapper().mapToGlobal(subdomain, local_ii);\n      global_vector.add_to_entry(global_ii, local_vector.get_entry(local_ii));\n    }\n  } \/\/ ... copy_local_to_global_matrix(...)\n}; \/\/ class BlockIpdgDiscretizer\n\n\n} \/\/ namespace LinearElliptic\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_TESTS_LINEARELLIPTIC_DISCRETIZERS_BLOCK_IPDG_HH\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"gcd_utility.hpp\"\n#include \"human_interface_device.hpp\"\n#include \"spdlog_utility.hpp\"\n\nnamespace krbn {\nclass hid_grabber final {\npublic:\n  struct signal2_combiner_call_while_grabbable {\n    typedef grabbable_state result_type;\n\n    template <typename input_iterator>\n    result_type operator()(input_iterator first_observer,\n                           input_iterator last_observer) const {\n      result_type value = grabbable_state::grabbable;\n      for (;\n           first_observer != last_observer && value == grabbable_state::grabbable;\n           std::advance(first_observer, 1)) {\n        value = *first_observer;\n      }\n      return value;\n    }\n  };\n\n  \/\/ Signals\n\n  boost::signals2::signal<grabbable_state(human_interface_device&),\n                          signal2_combiner_call_while_grabbable>\n      device_grabbing;\n\n  boost::signals2::signal<void(human_interface_device&)> device_grabbed;\n\n  boost::signals2::signal<void(human_interface_device&)> device_ungrabbed;\n\n  \/\/ Methods\n\n  hid_grabber(human_interface_device& human_interface_device) : human_interface_device_(human_interface_device),\n                                                                grabbed_(false) {\n  }\n\n  ~hid_grabber(void) {\n    ungrab();\n  }\n\n  bool get_grabbed(void) const {\n    return grabbed_;\n  }\n\n  void grab(void) {\n    gcd_utility::dispatch_sync_in_main_queue(^{\n      log_reducer_.reset();\n\n      timer_ = nullptr;\n\n      timer_ = std::make_unique<gcd_utility::fire_while_false_timer>(\n          1 * NSEC_PER_SEC,\n          ^{\n            if (human_interface_device_.get_removed()) {\n              return true;\n            }\n\n            if (grabbed_) {\n              return true;\n            }\n\n            switch (device_grabbing(human_interface_device_)) {\n              case grabbable_state::grabbable:\n                break;\n\n              case grabbable_state::ungrabbable_temporarily:\n              case grabbable_state::device_error:\n                \/\/ Retry\n                return false;\n\n              case grabbable_state::ungrabbable_permanently:\n                return true;\n            }\n\n            \/\/ ----------------------------------------\n            auto r = human_interface_device_.open(kIOHIDOptionsTypeSeizeDevice);\n            if (r != kIOReturnSuccess) {\n              auto message = fmt::format(\"IOHIDDeviceOpen error: {0} ({1}) {2}\",\n                                         iokit_utility::get_error_name(r),\n                                         r,\n                                         human_interface_device_.get_name_for_log());\n              log_reducer_.error(message);\n              return false;\n            }\n\n            \/\/ ----------------------------------------\n            grabbed_ = true;\n\n            device_grabbed(human_interface_device_);\n\n            human_interface_device_.queue_start();\n            human_interface_device_.schedule();\n\n            return true;\n          });\n    });\n  }\n\n  void ungrab(void) {\n    gcd_utility::dispatch_sync_in_main_queue(^{\n      timer_ = nullptr;\n\n      if (!grabbed_) {\n        return;\n      }\n\n      human_interface_device_.unschedule();\n      human_interface_device_.queue_stop();\n      human_interface_device_.close();\n\n      grabbed_ = false;\n\n      device_ungrabbed(human_interface_device_);\n    });\n  }\n\nprivate:\n  human_interface_device& human_interface_device_;\n  bool grabbed_;\n  std::unique_ptr<gcd_utility::fire_while_false_timer> timer_;\n  spdlog_utility::log_reducer log_reducer_;\n};\n} \/\/ namespace krbn\n<commit_msg>use weak_ptr in hid_grabber<commit_after>#pragma once\n\n#include \"gcd_utility.hpp\"\n#include \"human_interface_device.hpp\"\n#include \"spdlog_utility.hpp\"\n\nnamespace krbn {\nclass hid_grabber final {\npublic:\n  struct signal2_combiner_call_while_grabbable {\n    typedef grabbable_state result_type;\n\n    template <typename input_iterator>\n    result_type operator()(input_iterator first_observer,\n                           input_iterator last_observer) const {\n      result_type value = grabbable_state::grabbable;\n      for (;\n           first_observer != last_observer && value == grabbable_state::grabbable;\n           std::advance(first_observer, 1)) {\n        value = *first_observer;\n      }\n      return value;\n    }\n  };\n\n  \/\/ Signals\n\n  boost::signals2::signal<grabbable_state(std::shared_ptr<human_interface_device>),\n                          signal2_combiner_call_while_grabbable>\n      device_grabbing;\n\n  boost::signals2::signal<void(std::shared_ptr<human_interface_device>)> device_grabbed;\n\n  boost::signals2::signal<void(std::shared_ptr<human_interface_device>)> device_ungrabbed;\n\n  \/\/ Methods\n\n  hid_grabber(std::shared_ptr<human_interface_device> human_interface_device) : human_interface_device_(human_interface_device),\n                                                                                grabbed_(false) {\n  }\n\n  ~hid_grabber(void) {\n    ungrab();\n  }\n\n  bool get_grabbed(void) const {\n    return grabbed_;\n  }\n\n  void grab(void) {\n    gcd_utility::dispatch_sync_in_main_queue(^{\n      log_reducer_.reset();\n\n      timer_ = nullptr;\n\n      timer_ = std::make_unique<gcd_utility::fire_while_false_timer>(\n          1 * NSEC_PER_SEC,\n          ^{\n            if (auto hid = human_interface_device_.lock()) {\n              if (hid->get_removed()) {\n                return true;\n              }\n\n              if (grabbed_) {\n                return true;\n              }\n\n              switch (device_grabbing(hid)) {\n                case grabbable_state::grabbable:\n                  break;\n\n                case grabbable_state::ungrabbable_temporarily:\n                case grabbable_state::device_error:\n                  \/\/ Retry\n                  return false;\n\n                case grabbable_state::ungrabbable_permanently:\n                  return true;\n              }\n\n              \/\/ ----------------------------------------\n              auto r = hid->open(kIOHIDOptionsTypeSeizeDevice);\n              if (r != kIOReturnSuccess) {\n                auto message = fmt::format(\"IOHIDDeviceOpen error: {0} ({1}) {2}\",\n                                           iokit_utility::get_error_name(r),\n                                           r,\n                                           hid->get_name_for_log());\n                log_reducer_.error(message);\n                return false;\n              }\n\n              \/\/ ----------------------------------------\n              grabbed_ = true;\n\n              device_grabbed(hid);\n\n              hid->queue_start();\n              hid->schedule();\n            }\n\n            return true;\n          });\n    });\n  }\n\n  void ungrab(void) {\n    gcd_utility::dispatch_sync_in_main_queue(^{\n      timer_ = nullptr;\n\n      if (auto hid = human_interface_device_.lock()) {\n        if (!grabbed_) {\n          return;\n        }\n\n        hid->unschedule();\n        hid->queue_stop();\n        hid->close();\n\n        grabbed_ = false;\n\n        device_ungrabbed(hid);\n      }\n    });\n  }\n\nprivate:\n  std::weak_ptr<human_interface_device> human_interface_device_;\n  bool grabbed_;\n  std::unique_ptr<gcd_utility::fire_while_false_timer> timer_;\n  spdlog_utility::log_reducer log_reducer_;\n};\n} \/\/ namespace krbn\n<|endoftext|>"}
{"text":"<commit_before>\/***********************************************************************************************************************\n **\n ** Copyright (c) 2011, 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\n **      following disclaimer.\n **    * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the\n **      following disclaimer in the documentation and\/or other materials provided with the distribution.\n **    * Neither the name of the ETH Zurich nor the names of its contributors may be used to endorse or promote products\n **      derived from this software without specific prior written permission.\n **\n **\n ** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES,\n ** INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n ** DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n ** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n ** SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n ** WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n ** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n **\n **********************************************************************************************************************\/\n\n#include \"CppExporter.h\"\n\n#include \"OOModel\/src\/declarations\/Project.h\"\n#include \"OOModel\/src\/expressions\/MetaCallExpression.h\"\n#include \"OOModel\/src\/declarations\/TypeAlias.h\"\n\n#include \"Export\/src\/writer\/Exporter.h\"\n#include \"Export\/src\/writer\/FragmentLayouter.h\"\n#include \"Export\/src\/tree\/CompositeFragment.h\"\n#include \"ModelBase\/src\/model\/TreeManager.h\"\n\n#include \"..\/CodeUnit.h\"\n#include \"..\/CodeComposite.h\"\n#include \"..\/Config.h\"\n\nnamespace CppExport {\n\nQList<Export::ExportError> CppExporter::exportTree(Model::TreeManager* treeManager,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tconst QString& pathToProjectContainerDirectory)\n{\n\tQList<CodeUnit*> codeUnits;\n\tunits(treeManager->root(), \"\", codeUnits);\n\n\tfor (auto unit : codeUnits) unit->calculateSourceFragments();\n\tfor (auto unit : codeUnits) unit->calculateDependencies(codeUnits);\n\n\tauto directory = new Export::SourceDir(nullptr, pathToProjectContainerDirectory + \"\/src\");\n\tfor (auto codeComposite : mergeUnits(codeUnits))\n\t\tcreateFilesFromComposite(directory, codeComposite);\n\n\tauto layout = layouter();\n\tExport::Exporter::exportToFileSystem(\"\", directory, &layout);\n\n\treturn {};\n\n}\n\nvoid CppExporter::createFilesFromComposite(Export::SourceDir* directory, CodeComposite* codeComposite)\n{\n\tExport::SourceFragment* headerFragment{};\n\tExport::SourceFragment* sourceFragment{};\n\tcodeComposite->fragments(headerFragment, sourceFragment);\n\n\tif (headerFragment) directory->file(codeComposite->name() + \".h\").append(headerFragment);\n\tif (sourceFragment) directory->file(codeComposite->name() + \".cpp\").append(sourceFragment);\n}\n\nvoid CppExporter::units(Model::Node* current, QString namespaceName, QList<CodeUnit*>& result)\n{\n\tif (!DCast<OOModel::Project>(current))\n\t{\n\t\tif (auto ooModule = DCast<OOModel::Module>(current))\n\t\t{\n\t\t\t\/\/ ignore the \"ExternalMacro\" module\n\t\t\tif (ooModule->name() == \"ExternalMacro\") return;\n\n\t\t\tnamespaceName = ooModule->name();\n\t\t}\n\t\telse if (auto ooClass = DCast<OOModel::Declaration>(current))\n\t\t{\n\t\t\tresult.append(new CodeUnit((namespaceName.isEmpty() ? \"\" : namespaceName + \"\/\") + ooClass->name(), current));\n\t\t\treturn;\n\t\t}\n\t\telse if (auto ooMetaCall = DCast<OOModel::MetaCallExpression>(current))\n\t\t{\n\t\t\tauto ooCalleeReference = DCast<OOModel::ReferenceExpression>(ooMetaCall->callee());\n\t\t\tQ_ASSERT(ooCalleeReference);\n\t\t\tresult.append(new CodeUnit((namespaceName.isEmpty() ? \"\" : namespaceName + \"\/\") + ooCalleeReference->name(),\n\t\t\t\t\t\t\t\t\t\t\t\tcurrent));\n\t\t\treturn;\n\t\t}\n\t}\n\n\tfor (auto child : current->children())\n\t\tunits(child, namespaceName, result);\n}\n\nQList<CodeComposite*> CppExporter::mergeUnits(QList<CodeUnit*>& units)\n{\n\tQHash<QString, QString> mergeMap = Config::instance().dependencyUnitMergeMap();\n\n\tQHash<QString, CodeComposite*> nameToCompositeMap;\n\tfor (auto unit : units)\n\t{\n\t\tauto it = mergeMap.find(unit->name());\n\t\tauto compositeName = it != mergeMap.end() ? *it : unit->name();\n\n\t\tauto cIt = nameToCompositeMap.find(compositeName);\n\t\tif (cIt != nameToCompositeMap.end())\n\t\t\t\/\/ case A: the composite that unit is a part of already exists => merge\n\t\t\t(*cIt)->addUnit(unit);\n\t\telse\n\t\t{\n\t\t\t\/\/ case B: the composite that unit is a part of does not yet exist\n\t\t\tauto composite = new CodeComposite(compositeName);\n\t\t\tcomposite->addUnit(unit);\n\t\t\tnameToCompositeMap.insert(composite->name(), composite);\n\t\t}\n\t}\n\n\treturn nameToCompositeMap.values();\n}\n\nExport::FragmentLayouter CppExporter::layouter()\n{\n\tauto result = Export::FragmentLayouter{\"\\t\"};\n\tresult.addRule(\"enumerators\", Export::FragmentLayouter::SpaceAfterSeparator, \"\", \",\", \"\");\n\tresult.addRule(\"vertical\", Export::FragmentLayouter::NoIndentation, \"\", \"\\n\", \"\");\n\tresult.addRule(\"sections\", Export::FragmentLayouter::NoIndentation, \"\", \"\\n\", \"\");\n\tresult.addRule(\"declarationComment\", Export::FragmentLayouter::NoIndentation\n\t\t\t\t\t\t\t| Export::FragmentLayouter::NewLineAfterPostfix, \"\", \"\\n\", \"\");\n\tresult.addRule(\"spacedSections\", Export::FragmentLayouter::NoIndentation, \"\", \"\\n\\n\", \"\");\n\tresult.addRule(\"accessorSections\", Export::FragmentLayouter::IndentChildFragments, \"\", \"\\n\", \"\");\n\tresult.addRule(\"bodySections\", Export::FragmentLayouter::NewLineBefore\n\t\t\t\t\t\t  | Export::FragmentLayouter::IndentChildFragments | Export::FragmentLayouter::NewLineAfterPrefix\n\t\t\t\t\t\t  | Export::FragmentLayouter::NewLineBeforePostfix, \"{\", \"\\n\", \"}\");\n\tresult.addRule(\"space\", Export::FragmentLayouter::SpaceAtEnd, \"\", \" \", \"\");\n\tresult.addRule(\"comma\", Export::FragmentLayouter::SpaceAfterSeparator, \"\", \",\", \"\");\n\tresult.addRule(\"baseClasses\", Export::FragmentLayouter::SpaceAfterSeparator, \" : public \", \",\", \"\");\n\tresult.addRule(\"initializerList\", Export::FragmentLayouter::SpaceAfterSeparator, \"{\", \",\", \"}\");\n\tresult.addRule(\"argsList\", Export::FragmentLayouter::SpaceAfterSeparator, \"(\", \",\", \")\");\n\tresult.addRule(\"typeArgsList\", Export::FragmentLayouter::SpaceAfterSeparator, \"<\", \",\", \">\");\n\tresult.addRule(\"templateArgsList\", Export::FragmentLayouter::SpaceAfterSeparator\n\t\t\t\t\t\t\t| Export::FragmentLayouter::NewLineAfterPostfix, \"template<\", \",\", \">\");\n\n\tresult.addRule(\"body\", Export::FragmentLayouter::NewLineBefore | Export::FragmentLayouter::IndentChildFragments\n\t\t\t\t\t\t\t| Export::FragmentLayouter::NewLineAfterPrefix | Export::FragmentLayouter::NewLineBeforePostfix,\n\t\t\t\t\t\t\t\"{\", \"\\n\", \"}\");\n\tresult.addRule(\"bodyNoBraces\", Export::FragmentLayouter::NewLineBefore\n\t\t\t\t\t\t\t| Export::FragmentLayouter::IndentChildFragments | Export::FragmentLayouter::NewLineAfterPrefix\n\t\t\t\t\t\t\t| Export::FragmentLayouter::NewLineBeforePostfix, \"\", \"\\n\", \"\");\n\tresult.addRule(\"macroBody\", Export::FragmentLayouter::NewLineBefore | Export::FragmentLayouter::IndentChildFragments\n\t\t\t\t\t\t\t| Export::FragmentLayouter::NewLineAfterPrefix | Export::FragmentLayouter::NewLineBeforePostfix,\n\t\t\t\t\t\t\t\"\", \"\\n\", \"\");\n\tresult.addRule(\"macro\", Export::FragmentLayouter::BackslashAfterLines\n\t\t\t\t\t\t| Export::FragmentLayouter::NewLineAfterPrefix | Export::FragmentLayouter::NewLineBeforePostfix);\n\tresult.addRule(\"emptyLineAtEnd\", Export::FragmentLayouter::EmptyLineAtEnd);\n\n\treturn result;\n}\n\nExport::ExportMapContainer& CppExporter::exportMaps()\n{\n\tstatic Export::ExportMapContainer* container = new Export::ExportMapContainer();\n\treturn *container;\n}\n\n}\n<commit_msg>remove unused layout<commit_after>\/***********************************************************************************************************************\n **\n ** Copyright (c) 2011, 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\n **      following disclaimer.\n **    * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the\n **      following disclaimer in the documentation and\/or other materials provided with the distribution.\n **    * Neither the name of the ETH Zurich nor the names of its contributors may be used to endorse or promote products\n **      derived from this software without specific prior written permission.\n **\n **\n ** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES,\n ** INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n ** DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n ** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n ** SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n ** WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n ** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n **\n **********************************************************************************************************************\/\n\n#include \"CppExporter.h\"\n\n#include \"OOModel\/src\/declarations\/Project.h\"\n#include \"OOModel\/src\/expressions\/MetaCallExpression.h\"\n#include \"OOModel\/src\/declarations\/TypeAlias.h\"\n\n#include \"Export\/src\/writer\/Exporter.h\"\n#include \"Export\/src\/writer\/FragmentLayouter.h\"\n#include \"Export\/src\/tree\/CompositeFragment.h\"\n#include \"ModelBase\/src\/model\/TreeManager.h\"\n\n#include \"..\/CodeUnit.h\"\n#include \"..\/CodeComposite.h\"\n#include \"..\/Config.h\"\n\nnamespace CppExport {\n\nQList<Export::ExportError> CppExporter::exportTree(Model::TreeManager* treeManager,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tconst QString& pathToProjectContainerDirectory)\n{\n\tQList<CodeUnit*> codeUnits;\n\tunits(treeManager->root(), \"\", codeUnits);\n\n\tfor (auto unit : codeUnits) unit->calculateSourceFragments();\n\tfor (auto unit : codeUnits) unit->calculateDependencies(codeUnits);\n\n\tauto directory = new Export::SourceDir(nullptr, pathToProjectContainerDirectory + \"\/src\");\n\tfor (auto codeComposite : mergeUnits(codeUnits))\n\t\tcreateFilesFromComposite(directory, codeComposite);\n\n\tauto layout = layouter();\n\tExport::Exporter::exportToFileSystem(\"\", directory, &layout);\n\n\treturn {};\n\n}\n\nvoid CppExporter::createFilesFromComposite(Export::SourceDir* directory, CodeComposite* codeComposite)\n{\n\tExport::SourceFragment* headerFragment{};\n\tExport::SourceFragment* sourceFragment{};\n\tcodeComposite->fragments(headerFragment, sourceFragment);\n\n\tif (headerFragment) directory->file(codeComposite->name() + \".h\").append(headerFragment);\n\tif (sourceFragment) directory->file(codeComposite->name() + \".cpp\").append(sourceFragment);\n}\n\nvoid CppExporter::units(Model::Node* current, QString namespaceName, QList<CodeUnit*>& result)\n{\n\tif (!DCast<OOModel::Project>(current))\n\t{\n\t\tif (auto ooModule = DCast<OOModel::Module>(current))\n\t\t{\n\t\t\t\/\/ ignore the \"ExternalMacro\" module\n\t\t\tif (ooModule->name() == \"ExternalMacro\") return;\n\n\t\t\tnamespaceName = ooModule->name();\n\t\t}\n\t\telse if (auto ooClass = DCast<OOModel::Declaration>(current))\n\t\t{\n\t\t\tresult.append(new CodeUnit((namespaceName.isEmpty() ? \"\" : namespaceName + \"\/\") + ooClass->name(), current));\n\t\t\treturn;\n\t\t}\n\t\telse if (auto ooMetaCall = DCast<OOModel::MetaCallExpression>(current))\n\t\t{\n\t\t\tauto ooCalleeReference = DCast<OOModel::ReferenceExpression>(ooMetaCall->callee());\n\t\t\tQ_ASSERT(ooCalleeReference);\n\t\t\tresult.append(new CodeUnit((namespaceName.isEmpty() ? \"\" : namespaceName + \"\/\") + ooCalleeReference->name(),\n\t\t\t\t\t\t\t\t\t\t\t\tcurrent));\n\t\t\treturn;\n\t\t}\n\t}\n\n\tfor (auto child : current->children())\n\t\tunits(child, namespaceName, result);\n}\n\nQList<CodeComposite*> CppExporter::mergeUnits(QList<CodeUnit*>& units)\n{\n\tQHash<QString, QString> mergeMap = Config::instance().dependencyUnitMergeMap();\n\n\tQHash<QString, CodeComposite*> nameToCompositeMap;\n\tfor (auto unit : units)\n\t{\n\t\tauto it = mergeMap.find(unit->name());\n\t\tauto compositeName = it != mergeMap.end() ? *it : unit->name();\n\n\t\tauto cIt = nameToCompositeMap.find(compositeName);\n\t\tif (cIt != nameToCompositeMap.end())\n\t\t\t\/\/ case A: the composite that unit is a part of already exists => merge\n\t\t\t(*cIt)->addUnit(unit);\n\t\telse\n\t\t{\n\t\t\t\/\/ case B: the composite that unit is a part of does not yet exist\n\t\t\tauto composite = new CodeComposite(compositeName);\n\t\t\tcomposite->addUnit(unit);\n\t\t\tnameToCompositeMap.insert(composite->name(), composite);\n\t\t}\n\t}\n\n\treturn nameToCompositeMap.values();\n}\n\nExport::FragmentLayouter CppExporter::layouter()\n{\n\tauto result = Export::FragmentLayouter{\"\\t\"};\n\tresult.addRule(\"enumerators\", Export::FragmentLayouter::SpaceAfterSeparator, \"\", \",\", \"\");\n\tresult.addRule(\"vertical\", Export::FragmentLayouter::NoIndentation, \"\", \"\\n\", \"\");\n\tresult.addRule(\"sections\", Export::FragmentLayouter::NoIndentation, \"\", \"\\n\", \"\");\n\tresult.addRule(\"declarationComment\", Export::FragmentLayouter::NoIndentation\n\t\t\t\t\t\t\t| Export::FragmentLayouter::NewLineAfterPostfix, \"\", \"\\n\", \"\");\n\tresult.addRule(\"spacedSections\", Export::FragmentLayouter::NoIndentation, \"\", \"\\n\\n\", \"\");\n\tresult.addRule(\"accessorSections\", Export::FragmentLayouter::IndentChildFragments, \"\", \"\\n\", \"\");\n\tresult.addRule(\"bodySections\", Export::FragmentLayouter::NewLineBefore\n\t\t\t\t\t\t  | Export::FragmentLayouter::IndentChildFragments | Export::FragmentLayouter::NewLineAfterPrefix\n\t\t\t\t\t\t  | Export::FragmentLayouter::NewLineBeforePostfix, \"{\", \"\\n\", \"}\");\n\tresult.addRule(\"space\", Export::FragmentLayouter::SpaceAtEnd, \"\", \" \", \"\");\n\tresult.addRule(\"comma\", Export::FragmentLayouter::SpaceAfterSeparator, \"\", \",\", \"\");\n\tresult.addRule(\"initializerList\", Export::FragmentLayouter::SpaceAfterSeparator, \"{\", \",\", \"}\");\n\tresult.addRule(\"argsList\", Export::FragmentLayouter::SpaceAfterSeparator, \"(\", \",\", \")\");\n\tresult.addRule(\"typeArgsList\", Export::FragmentLayouter::SpaceAfterSeparator, \"<\", \",\", \">\");\n\tresult.addRule(\"templateArgsList\", Export::FragmentLayouter::SpaceAfterSeparator\n\t\t\t\t\t\t\t| Export::FragmentLayouter::NewLineAfterPostfix, \"template<\", \",\", \">\");\n\n\tresult.addRule(\"body\", Export::FragmentLayouter::NewLineBefore | Export::FragmentLayouter::IndentChildFragments\n\t\t\t\t\t\t\t| Export::FragmentLayouter::NewLineAfterPrefix | Export::FragmentLayouter::NewLineBeforePostfix,\n\t\t\t\t\t\t\t\"{\", \"\\n\", \"}\");\n\tresult.addRule(\"bodyNoBraces\", Export::FragmentLayouter::NewLineBefore\n\t\t\t\t\t\t\t| Export::FragmentLayouter::IndentChildFragments | Export::FragmentLayouter::NewLineAfterPrefix\n\t\t\t\t\t\t\t| Export::FragmentLayouter::NewLineBeforePostfix, \"\", \"\\n\", \"\");\n\tresult.addRule(\"macroBody\", Export::FragmentLayouter::NewLineBefore | Export::FragmentLayouter::IndentChildFragments\n\t\t\t\t\t\t\t| Export::FragmentLayouter::NewLineAfterPrefix | Export::FragmentLayouter::NewLineBeforePostfix,\n\t\t\t\t\t\t\t\"\", \"\\n\", \"\");\n\tresult.addRule(\"macro\", Export::FragmentLayouter::BackslashAfterLines\n\t\t\t\t\t\t| Export::FragmentLayouter::NewLineAfterPrefix | Export::FragmentLayouter::NewLineBeforePostfix);\n\tresult.addRule(\"emptyLineAtEnd\", Export::FragmentLayouter::EmptyLineAtEnd);\n\n\treturn result;\n}\n\nExport::ExportMapContainer& CppExporter::exportMaps()\n{\n\tstatic Export::ExportMapContainer* container = new Export::ExportMapContainer();\n\treturn *container;\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, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/*\n * Modified by 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\/shared_ptr.hh\"\n#include \"core\/sstring.hh\"\n#include \"types.hh\"\n#include \"keys.hh\"\n#include \"utils\/managed_bytes.hh\"\n#include <memory>\n#include <random>\n#include <utility>\n\nnamespace sstables {\n\nclass key_view;\n\n}\n\nnamespace dht {\n\n\/\/\n\/\/ Origin uses a complex class hierarchy where Token is an abstract class,\n\/\/ and various subclasses use different implementations (LongToken vs.\n\/\/ BigIntegerToken vs. StringToken), plus other variants to to signify the\n\/\/ the beginning of the token space etc.\n\/\/\n\/\/ We'll fold all of that into the token class and push all of the variations\n\/\/ into its users.\n\nclass decorated_key;\nclass token;\nclass ring_position;\n\nclass token {\npublic:\n    enum class kind {\n        before_all_keys,\n        key,\n        after_all_keys,\n    };\n    kind _kind;\n    \/\/ _data can be interpreted as a big endian binary fraction\n    \/\/ in the range [0.0, 1.0).\n    \/\/\n    \/\/ So, [] == 0.0\n    \/\/     [0x00] == 0.0\n    \/\/     [0x80] == 0.5\n    \/\/     [0x00, 0x80] == 1\/512\n    \/\/     [0xff, 0x80] == 1 - 1\/512\n    managed_bytes _data;\n    token(kind k, managed_bytes d) : _kind(std::move(k)), _data(std::move(d)) {\n    }\n\n    bool is_minimum() const {\n        return _kind == kind::before_all_keys;\n    }\n\n    bool is_maximum() const {\n        return _kind == kind::after_all_keys;\n    }\n\n\n    void serialize(bytes::iterator& out) const;\n    static token deserialize(bytes_view& in);\n    size_t serialized_size() const;\n};\n\ntoken midpoint_unsigned(const token& t1, const token& t2);\ntoken minimum_token();\ntoken maximum_token();\nbool operator==(const token& t1, const token& t2);\nbool operator<(const token& t1, const token& t2);\nint tri_compare(const token& t1, const token& t2);\ninline bool operator!=(const token& t1, const token& t2) { return std::rel_ops::operator!=(t1, t2); }\ninline bool operator>(const token& t1, const token& t2) { return std::rel_ops::operator>(t1, t2); }\ninline bool operator<=(const token& t1, const token& t2) { return std::rel_ops::operator<=(t1, t2); }\ninline bool operator>=(const token& t1, const token& t2) { return std::rel_ops::operator>=(t1, t2); }\nstd::ostream& operator<<(std::ostream& out, const token& t);\n\ntemplate <typename T>\ninline auto get_random_number() {\n    static thread_local std::random_device rd;\n    static thread_local std::default_random_engine re(rd());\n    static thread_local std::uniform_int_distribution<T> dist{};\n    return dist(re);\n}\n\n\/\/ Wraps partition_key with its corresponding token.\n\/\/\n\/\/ Total ordering defined by comparators is compatible with Origin's ordering.\nclass decorated_key {\npublic:\n    dht::token _token;\n    partition_key _key;\n\n    struct less_comparator {\n        schema_ptr s;\n        less_comparator(schema_ptr s);\n        bool operator()(const decorated_key& k1, const decorated_key& k2) const;\n        bool operator()(const decorated_key& k1, const ring_position& k2) const;\n        bool operator()(const ring_position& k1, const decorated_key& k2) const;\n    };\n\n    bool equal(const schema& s, const decorated_key& other) const;\n\n    bool less_compare(const schema& s, const decorated_key& other) const;\n    bool less_compare(const schema& s, const ring_position& other) const;\n\n    \/\/ Trichotomic comparators defining total ordering on the union of\n    \/\/ decorated_key and ring_position objects.\n    int tri_compare(const schema& s, const decorated_key& other) const;\n    int tri_compare(const schema& s, const ring_position& other) const;\n\n    const dht::token& token() const {\n        return _token;\n    }\n\n    const partition_key& key() const {\n        return _key;\n    }\n};\n\nusing decorated_key_opt = std::experimental::optional<decorated_key>;\n\nclass i_partitioner {\npublic:\n    virtual ~i_partitioner() {}\n\n    \/**\n     * Transform key to object representation of the on-disk format.\n     *\n     * @param key the raw, client-facing key\n     * @return decorated version of key\n     *\/\n    decorated_key decorate_key(const schema& s, const partition_key& key) {\n        return { get_token(s, key), key };\n    }\n\n    \/**\n     * Transform key to object representation of the on-disk format.\n     *\n     * @param key the raw, client-facing key\n     * @return decorated version of key\n     *\/\n    decorated_key decorate_key(const schema& s, partition_key&& key) {\n        auto token = get_token(s, key);\n        return { std::move(token), std::move(key) };\n    }\n\n    \/**\n     * Calculate a token representing the approximate \"middle\" of the given\n     * range.\n     *\n     * @return The approximate midpoint between left and right.\n     *\/\n    virtual token midpoint(const token& left, const token& right) const = 0;\n\n    \/**\n     * @return A token smaller than all others in the range that is being partitioned.\n     * Not legal to assign to a node or key.  (But legal to use in range scans.)\n     *\/\n    token get_minimum_token() {\n        return dht::minimum_token();\n    }\n\n    \/**\n     * @return a token that can be used to route a given key\n     * (This is NOT a method to create a token from its string representation;\n     * for that, use tokenFactory.fromString.)\n     *\/\n    virtual token get_token(const schema& s, partition_key_view key) = 0;\n    virtual token get_token(const sstables::key_view& key) = 0;\n\n\n    \/**\n     * @return a partitioner-specific string representation of this token\n     *\/\n    virtual sstring to_sstring(const dht::token& t) const = 0;\n\n    \/**\n     * @return a token from its partitioner-specific string representation\n     *\/\n    virtual dht::token from_sstring(const sstring& t) const = 0;\n\n    \/**\n     * @return a randomly generated token\n     *\/\n    virtual token get_random_token() = 0;\n\n    \/\/ FIXME: token.tokenFactory\n    \/\/virtual token.tokenFactory gettokenFactory() = 0;\n\n    \/**\n     * @return True if the implementing class preserves key order in the tokens\n     * it generates.\n     *\/\n    virtual bool preserves_order() = 0;\n\n    \/**\n     * Calculate the deltas between tokens in the ring in order to compare\n     *  relative sizes.\n     *\n     * @param sortedtokens a sorted List of tokens\n     * @return the mapping from 'token' to 'percentage of the ring owned by that token'.\n     *\/\n    virtual std::map<token, float> describe_ownership(const std::vector<token>& sorted_tokens) = 0;\n\n    virtual data_type get_token_validator() = 0;\n\n    \/**\n     * @return name of partitioner.\n     *\/\n    virtual const sstring name() = 0;\n\n    \/**\n     * Calculates the shard that handles a particular token.\n     *\/\n    virtual unsigned shard_of(const token& t) const = 0;\n\n    \/**\n     * @return bytes that represent the token as required by get_token_validator().\n     *\/\n    virtual bytes token_to_bytes(const token& t) const {\n        return bytes(t._data.begin(), t._data.end());\n    }\nprotected:\n    \/**\n     * @return < 0 if if t1's _data array is less, t2's. 0 if they are equal, and > 0 otherwise. _kind comparison should be done separately.\n     *\/\n    virtual int tri_compare(const token& t1, const token& t2);\n    \/**\n     * @return true if t1's _data array is equal t2's. _kind comparison should be done separately.\n     *\/\n    bool is_equal(const token& t1, const token& t2) {\n        return tri_compare(t1, t2) == 0;\n    }\n    \/**\n     * @return true if t1's _data array is less then t2's. _kind comparison should be done separately.\n     *\/\n    bool is_less(const token& t1, const token& t2) {\n        return tri_compare(t1, t2) < 0;\n    }\n\n    friend bool operator==(const token& t1, const token& t2);\n    friend bool operator<(const token& t1, const token& t2);\n    friend int tri_compare(const token& t1, const token& t2);\n};\n\n\/\/\n\/\/ Represents position in the ring of partitions, where partitions are ordered\n\/\/ according to decorated_key ordering (first by token, then by key value).\n\/\/ Intended to be used for defining partition ranges.\n\/\/\n\/\/ The 'key' part is optional. When it's absent, this object represents a position\n\/\/ which is either before or after all keys sharing given token. That's determined\n\/\/ by relation_to_keys().\n\/\/\n\/\/ For example for the following data:\n\/\/\n\/\/   tokens: |    t1   | t2 |\n\/\/           +----+----+----+\n\/\/   keys:   | k1 | k2 | k3 |\n\/\/\n\/\/ The ordering is:\n\/\/\n\/\/   ring_position(t1, token_bound::start) < ring_position(k1)\n\/\/   ring_position(k1)                     < ring_position(k2)\n\/\/   ring_position(k1)                     == decorated_key(k1)\n\/\/   ring_position(k2)                     == decorated_key(k2)\n\/\/   ring_position(k2)                     < ring_position(t1, token_bound::end)\n\/\/   ring_position(k2)                     < ring_position(k3)\n\/\/   ring_position(t1, token_bound::end)   < ring_position(t2, token_bound::start)\n\/\/\n\/\/ Maps to org.apache.cassandra.db.RowPosition and its derivatives in Origin.\n\/\/\nclass ring_position {\npublic:\n    enum class token_bound : int8_t { start = -1, end = 1 };\nprivate:\n    dht::token _token;\n    token_bound _token_bound; \/\/ valid when !_key\n    std::experimental::optional<partition_key> _key;\npublic:\n    static ring_position starting_at(dht::token token) {\n        return { std::move(token), token_bound::start };\n    }\n\n    static ring_position ending_at(dht::token token) {\n        return { std::move(token), token_bound::end };\n    }\n\n    ring_position(dht::token token, token_bound bound)\n        : _token(std::move(token))\n        , _token_bound(bound)\n    { }\n\n    ring_position(dht::token token, partition_key key)\n        : _token(std::move(token))\n        , _key(std::experimental::make_optional(std::move(key)))\n    { }\n\n    ring_position(const dht::decorated_key& dk)\n        : _token(dk._token)\n        , _key(std::experimental::make_optional(dk._key))\n    { }\n\n    const dht::token& token() const {\n        return _token;\n    }\n\n    \/\/ Valid when !has_key()\n    token_bound bound() const {\n        return _token_bound;\n    }\n\n    \/\/ Returns -1 if smaller than keys with the same token, +1 if greater.\n    \/\/ Valid when !has_key().\n    int relation_to_keys() const {\n        return static_cast<int>(_token_bound);\n    }\n\n    const std::experimental::optional<partition_key>& key() const {\n        return _key;\n    }\n\n    bool has_key() const {\n        return bool(_key);\n    }\n\n    \/\/ Call only when has_key()\n    dht::decorated_key as_decorated_key() const {\n        return { _token, *_key };\n    }\n\n    bool equal(const schema&, const ring_position&) const;\n\n    \/\/ Trichotomic comparator defining a total ordering on ring_position objects\n    int tri_compare(const schema&, const ring_position&) const;\n\n    \/\/ \"less\" comparator corresponding to tri_compare()\n    bool less_compare(const schema&, const ring_position&) const;\n\n    size_t serialized_size() const;\n    void serialize(bytes::iterator& out) const;\n    static ring_position deserialize(bytes_view& in);\n\n    friend std::ostream& operator<<(std::ostream&, const ring_position&);\n};\n\n\/\/ Trichotomic comparator for ring_position\nstruct ring_position_comparator {\n    const schema& s;\n    ring_position_comparator(const schema& s_) : s(s_) {}\n    int operator()(const ring_position& lh, const ring_position& rh) const;\n};\n\n\/\/ \"less\" comparator for ring_position\nstruct ring_position_less_comparator {\n    const schema& s;\n    ring_position_less_comparator(const schema& s_) : s(s_) {}\n    bool operator()(const ring_position& lh, const ring_position& rh) const {\n        return lh.less_compare(s, rh);\n    }\n};\n\nstruct token_comparator {\n    \/\/ Return values are those of a trichotomic comparison.\n    int operator()(const token& t1, const token& t2) const;\n};\n\nstd::ostream& operator<<(std::ostream& out, const token& t);\n\nstd::ostream& operator<<(std::ostream& out, const decorated_key& t);\n\nvoid set_global_partitioner(const sstring& class_name);\ni_partitioner& global_partitioner();\n\nunsigned shard_of(const token&);\n\n} \/\/ dht\n\nnamespace std {\ntemplate<>\nstruct hash<dht::token> {\n    size_t operator()(const dht::token& t) const {\n        return (t._kind == dht::token::kind::key) ? std::hash<decltype(t._data)>()(t._data) : 0;\n    }\n};\n}\n<commit_msg>Add ring_position constructor needed by serializer.<commit_after>\/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements.  See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership.  The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License.  You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/*\n * Modified by 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\/shared_ptr.hh\"\n#include \"core\/sstring.hh\"\n#include \"types.hh\"\n#include \"keys.hh\"\n#include \"utils\/managed_bytes.hh\"\n#include <memory>\n#include <random>\n#include <utility>\n\nnamespace sstables {\n\nclass key_view;\n\n}\n\nnamespace dht {\n\n\/\/\n\/\/ Origin uses a complex class hierarchy where Token is an abstract class,\n\/\/ and various subclasses use different implementations (LongToken vs.\n\/\/ BigIntegerToken vs. StringToken), plus other variants to to signify the\n\/\/ the beginning of the token space etc.\n\/\/\n\/\/ We'll fold all of that into the token class and push all of the variations\n\/\/ into its users.\n\nclass decorated_key;\nclass token;\nclass ring_position;\n\nclass token {\npublic:\n    enum class kind {\n        before_all_keys,\n        key,\n        after_all_keys,\n    };\n    kind _kind;\n    \/\/ _data can be interpreted as a big endian binary fraction\n    \/\/ in the range [0.0, 1.0).\n    \/\/\n    \/\/ So, [] == 0.0\n    \/\/     [0x00] == 0.0\n    \/\/     [0x80] == 0.5\n    \/\/     [0x00, 0x80] == 1\/512\n    \/\/     [0xff, 0x80] == 1 - 1\/512\n    managed_bytes _data;\n    token(kind k, managed_bytes d) : _kind(std::move(k)), _data(std::move(d)) {\n    }\n\n    bool is_minimum() const {\n        return _kind == kind::before_all_keys;\n    }\n\n    bool is_maximum() const {\n        return _kind == kind::after_all_keys;\n    }\n\n\n    void serialize(bytes::iterator& out) const;\n    static token deserialize(bytes_view& in);\n    size_t serialized_size() const;\n};\n\ntoken midpoint_unsigned(const token& t1, const token& t2);\ntoken minimum_token();\ntoken maximum_token();\nbool operator==(const token& t1, const token& t2);\nbool operator<(const token& t1, const token& t2);\nint tri_compare(const token& t1, const token& t2);\ninline bool operator!=(const token& t1, const token& t2) { return std::rel_ops::operator!=(t1, t2); }\ninline bool operator>(const token& t1, const token& t2) { return std::rel_ops::operator>(t1, t2); }\ninline bool operator<=(const token& t1, const token& t2) { return std::rel_ops::operator<=(t1, t2); }\ninline bool operator>=(const token& t1, const token& t2) { return std::rel_ops::operator>=(t1, t2); }\nstd::ostream& operator<<(std::ostream& out, const token& t);\n\ntemplate <typename T>\ninline auto get_random_number() {\n    static thread_local std::random_device rd;\n    static thread_local std::default_random_engine re(rd());\n    static thread_local std::uniform_int_distribution<T> dist{};\n    return dist(re);\n}\n\n\/\/ Wraps partition_key with its corresponding token.\n\/\/\n\/\/ Total ordering defined by comparators is compatible with Origin's ordering.\nclass decorated_key {\npublic:\n    dht::token _token;\n    partition_key _key;\n\n    struct less_comparator {\n        schema_ptr s;\n        less_comparator(schema_ptr s);\n        bool operator()(const decorated_key& k1, const decorated_key& k2) const;\n        bool operator()(const decorated_key& k1, const ring_position& k2) const;\n        bool operator()(const ring_position& k1, const decorated_key& k2) const;\n    };\n\n    bool equal(const schema& s, const decorated_key& other) const;\n\n    bool less_compare(const schema& s, const decorated_key& other) const;\n    bool less_compare(const schema& s, const ring_position& other) const;\n\n    \/\/ Trichotomic comparators defining total ordering on the union of\n    \/\/ decorated_key and ring_position objects.\n    int tri_compare(const schema& s, const decorated_key& other) const;\n    int tri_compare(const schema& s, const ring_position& other) const;\n\n    const dht::token& token() const {\n        return _token;\n    }\n\n    const partition_key& key() const {\n        return _key;\n    }\n};\n\nusing decorated_key_opt = std::experimental::optional<decorated_key>;\n\nclass i_partitioner {\npublic:\n    virtual ~i_partitioner() {}\n\n    \/**\n     * Transform key to object representation of the on-disk format.\n     *\n     * @param key the raw, client-facing key\n     * @return decorated version of key\n     *\/\n    decorated_key decorate_key(const schema& s, const partition_key& key) {\n        return { get_token(s, key), key };\n    }\n\n    \/**\n     * Transform key to object representation of the on-disk format.\n     *\n     * @param key the raw, client-facing key\n     * @return decorated version of key\n     *\/\n    decorated_key decorate_key(const schema& s, partition_key&& key) {\n        auto token = get_token(s, key);\n        return { std::move(token), std::move(key) };\n    }\n\n    \/**\n     * Calculate a token representing the approximate \"middle\" of the given\n     * range.\n     *\n     * @return The approximate midpoint between left and right.\n     *\/\n    virtual token midpoint(const token& left, const token& right) const = 0;\n\n    \/**\n     * @return A token smaller than all others in the range that is being partitioned.\n     * Not legal to assign to a node or key.  (But legal to use in range scans.)\n     *\/\n    token get_minimum_token() {\n        return dht::minimum_token();\n    }\n\n    \/**\n     * @return a token that can be used to route a given key\n     * (This is NOT a method to create a token from its string representation;\n     * for that, use tokenFactory.fromString.)\n     *\/\n    virtual token get_token(const schema& s, partition_key_view key) = 0;\n    virtual token get_token(const sstables::key_view& key) = 0;\n\n\n    \/**\n     * @return a partitioner-specific string representation of this token\n     *\/\n    virtual sstring to_sstring(const dht::token& t) const = 0;\n\n    \/**\n     * @return a token from its partitioner-specific string representation\n     *\/\n    virtual dht::token from_sstring(const sstring& t) const = 0;\n\n    \/**\n     * @return a randomly generated token\n     *\/\n    virtual token get_random_token() = 0;\n\n    \/\/ FIXME: token.tokenFactory\n    \/\/virtual token.tokenFactory gettokenFactory() = 0;\n\n    \/**\n     * @return True if the implementing class preserves key order in the tokens\n     * it generates.\n     *\/\n    virtual bool preserves_order() = 0;\n\n    \/**\n     * Calculate the deltas between tokens in the ring in order to compare\n     *  relative sizes.\n     *\n     * @param sortedtokens a sorted List of tokens\n     * @return the mapping from 'token' to 'percentage of the ring owned by that token'.\n     *\/\n    virtual std::map<token, float> describe_ownership(const std::vector<token>& sorted_tokens) = 0;\n\n    virtual data_type get_token_validator() = 0;\n\n    \/**\n     * @return name of partitioner.\n     *\/\n    virtual const sstring name() = 0;\n\n    \/**\n     * Calculates the shard that handles a particular token.\n     *\/\n    virtual unsigned shard_of(const token& t) const = 0;\n\n    \/**\n     * @return bytes that represent the token as required by get_token_validator().\n     *\/\n    virtual bytes token_to_bytes(const token& t) const {\n        return bytes(t._data.begin(), t._data.end());\n    }\nprotected:\n    \/**\n     * @return < 0 if if t1's _data array is less, t2's. 0 if they are equal, and > 0 otherwise. _kind comparison should be done separately.\n     *\/\n    virtual int tri_compare(const token& t1, const token& t2);\n    \/**\n     * @return true if t1's _data array is equal t2's. _kind comparison should be done separately.\n     *\/\n    bool is_equal(const token& t1, const token& t2) {\n        return tri_compare(t1, t2) == 0;\n    }\n    \/**\n     * @return true if t1's _data array is less then t2's. _kind comparison should be done separately.\n     *\/\n    bool is_less(const token& t1, const token& t2) {\n        return tri_compare(t1, t2) < 0;\n    }\n\n    friend bool operator==(const token& t1, const token& t2);\n    friend bool operator<(const token& t1, const token& t2);\n    friend int tri_compare(const token& t1, const token& t2);\n};\n\n\/\/\n\/\/ Represents position in the ring of partitions, where partitions are ordered\n\/\/ according to decorated_key ordering (first by token, then by key value).\n\/\/ Intended to be used for defining partition ranges.\n\/\/\n\/\/ The 'key' part is optional. When it's absent, this object represents a position\n\/\/ which is either before or after all keys sharing given token. That's determined\n\/\/ by relation_to_keys().\n\/\/\n\/\/ For example for the following data:\n\/\/\n\/\/   tokens: |    t1   | t2 |\n\/\/           +----+----+----+\n\/\/   keys:   | k1 | k2 | k3 |\n\/\/\n\/\/ The ordering is:\n\/\/\n\/\/   ring_position(t1, token_bound::start) < ring_position(k1)\n\/\/   ring_position(k1)                     < ring_position(k2)\n\/\/   ring_position(k1)                     == decorated_key(k1)\n\/\/   ring_position(k2)                     == decorated_key(k2)\n\/\/   ring_position(k2)                     < ring_position(t1, token_bound::end)\n\/\/   ring_position(k2)                     < ring_position(k3)\n\/\/   ring_position(t1, token_bound::end)   < ring_position(t2, token_bound::start)\n\/\/\n\/\/ Maps to org.apache.cassandra.db.RowPosition and its derivatives in Origin.\n\/\/\nclass ring_position {\npublic:\n    enum class token_bound : int8_t { start = -1, end = 1 };\nprivate:\n    dht::token _token;\n    token_bound _token_bound; \/\/ valid when !_key\n    std::experimental::optional<partition_key> _key;\npublic:\n    static ring_position starting_at(dht::token token) {\n        return { std::move(token), token_bound::start };\n    }\n\n    static ring_position ending_at(dht::token token) {\n        return { std::move(token), token_bound::end };\n    }\n\n    ring_position(dht::token token, token_bound bound)\n        : _token(std::move(token))\n        , _token_bound(bound)\n    { }\n\n    ring_position(dht::token token, partition_key key)\n        : _token(std::move(token))\n        , _key(std::experimental::make_optional(std::move(key)))\n    { }\n\n    ring_position(dht::token token, token_bound bound, std::experimental::optional<partition_key> key)\n        : _token(std::move(token))\n        , _token_bound(bound)\n        , _key(std::move(key))\n    { }\n\n    ring_position(const dht::decorated_key& dk)\n        : _token(dk._token)\n        , _key(std::experimental::make_optional(dk._key))\n    { }\n\n    const dht::token& token() const {\n        return _token;\n    }\n\n    \/\/ Valid when !has_key()\n    token_bound bound() const {\n        return _token_bound;\n    }\n\n    \/\/ Returns -1 if smaller than keys with the same token, +1 if greater.\n    \/\/ Valid when !has_key().\n    int relation_to_keys() const {\n        return static_cast<int>(_token_bound);\n    }\n\n    const std::experimental::optional<partition_key>& key() const {\n        return _key;\n    }\n\n    bool has_key() const {\n        return bool(_key);\n    }\n\n    \/\/ Call only when has_key()\n    dht::decorated_key as_decorated_key() const {\n        return { _token, *_key };\n    }\n\n    bool equal(const schema&, const ring_position&) const;\n\n    \/\/ Trichotomic comparator defining a total ordering on ring_position objects\n    int tri_compare(const schema&, const ring_position&) const;\n\n    \/\/ \"less\" comparator corresponding to tri_compare()\n    bool less_compare(const schema&, const ring_position&) const;\n\n    size_t serialized_size() const;\n    void serialize(bytes::iterator& out) const;\n    static ring_position deserialize(bytes_view& in);\n\n    friend std::ostream& operator<<(std::ostream&, const ring_position&);\n};\n\n\/\/ Trichotomic comparator for ring_position\nstruct ring_position_comparator {\n    const schema& s;\n    ring_position_comparator(const schema& s_) : s(s_) {}\n    int operator()(const ring_position& lh, const ring_position& rh) const;\n};\n\n\/\/ \"less\" comparator for ring_position\nstruct ring_position_less_comparator {\n    const schema& s;\n    ring_position_less_comparator(const schema& s_) : s(s_) {}\n    bool operator()(const ring_position& lh, const ring_position& rh) const {\n        return lh.less_compare(s, rh);\n    }\n};\n\nstruct token_comparator {\n    \/\/ Return values are those of a trichotomic comparison.\n    int operator()(const token& t1, const token& t2) const;\n};\n\nstd::ostream& operator<<(std::ostream& out, const token& t);\n\nstd::ostream& operator<<(std::ostream& out, const decorated_key& t);\n\nvoid set_global_partitioner(const sstring& class_name);\ni_partitioner& global_partitioner();\n\nunsigned shard_of(const token&);\n\n} \/\/ dht\n\nnamespace std {\ntemplate<>\nstruct hash<dht::token> {\n    size_t operator()(const dht::token& t) const {\n        return (t._kind == dht::token::kind::key) ? std::hash<decltype(t._data)>()(t._data) : 0;\n    }\n};\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"eightpuzzlestate.h\"\n\nEightPuzzle::EightPuzzleState::EightPuzzleState(EightPuzzleId* id, EightPuzzleState* father, EightPuzzleOperator* fatherOperator, int depth, double cost) : State(id, father, fatherOperator, depth, cost)\n{\n}\n\nEightPuzzle::EightPuzzleState::~EightPuzzleState()\n{\n}\n\nbool EightPuzzle::EightPuzzleState::isFinal()\n{\n    return ((EightPuzzleId*)getId())->getIdValue().compare(\"12345678x\") == 0;\n}\n\nstd::vector<Operator*> EightPuzzle::EightPuzzleState::getAllowedOperators()\n{\n    std::pair<int, int> pos = getBlankPiecePos();\n    std::vector<Operator*> operatorAllowed;\n\n    Operator* up = new EightPuzzleOperator(\"up\");\n    Operator* down = new EightPuzzleOperator(\"down\");\n    Operator* left = new EightPuzzleOperator(\"left\");\n    Operator* right = new EightPuzzleOperator(\"right\");\n\n    operatorAllowed.push_back(up);\n    operatorAllowed.push_back(down);\n    operatorAllowed.push_back(left);\n    operatorAllowed.push_back(right);\n\n    switch (pos.first) {\n    case 0:\n        operatorAllowed.erase(std::remove(operatorAllowed.begin(), operatorAllowed.end(), up), operatorAllowed.end());\n        break;\n    case 2:\n        operatorAllowed.erase(std::remove(operatorAllowed.begin(), operatorAllowed.end(), down), operatorAllowed.end());\n        break;\n    default:\n        break;\n    }\n\n    switch (pos.second) {\n    case 0:\n        operatorAllowed.erase(std::remove(operatorAllowed.begin(), operatorAllowed.end(), left), operatorAllowed.end());\n        break;\n    case 2:\n        operatorAllowed.erase(std::remove(operatorAllowed.begin(), operatorAllowed.end(), right), operatorAllowed.end());\n        break;\n    default:\n        break;\n    }\n\n    for (Operator* var : operatorAllowed) {\n        std::cout << \"|\" << ((EightPuzzleOperator*)var)->getOperatorValue() << \"|\";\n    }\n    std::cout << std::endl;\n\n    return operatorAllowed;\n}\n\nstd::vector<State*> EightPuzzle::EightPuzzleState::genChilds(std::vector<Operator*> allowedOperators)\n{\n    std::vector<State*> childs;\n\n    for (int var = 0; var < allowedOperators.size(); ++var) {\n\n        Operator* side = allowedOperators[var];\n\n        childs.push_back(new EightPuzzleState((EightPuzzleId*)applyOperator(side), this, (EightPuzzleOperator*)side, getDepth() + 1, getCost() + 1));\n    }\n\n    return childs;\n}\n\nstd::pair<int, int> EightPuzzle::EightPuzzleState::getBlankPiecePos()\n{\n    std::size_t pos = ((EightPuzzleId*)getId())->getIdValue().find(\"x\");\n    int row = pos \/ 3;\n    int col = pos % 3;\n    return std::pair<int, int>(row, col);\n}\n\nId* EightPuzzle::EightPuzzleState::applyOperator(Operator* op)\n{\n    std::string newId = ((EightPuzzleId*)getId())->getIdValue();\n    std::pair<int, int> blankPos = getBlankPiecePos();\n    std::pair<int, int> numberPos;\n\n    if (((EightPuzzleOperator*)op)->getOperatorValue().compare(\"up\") == 0)\n    {\n        numberPos = std::pair<int, int>(blankPos.first - 1, blankPos.second);\n    }\n    else if (((EightPuzzleOperator*)op)->getOperatorValue().compare(\"down\") == 0)\n    {\n        numberPos = std::pair<int, int>(blankPos.first + 1, blankPos.second);\n    }\n    else if (((EightPuzzleOperator*)op)->getOperatorValue().compare(\"left\") == 0)\n    {\n        numberPos = std::pair<int, int>(blankPos.first, blankPos.second - 1);\n    }\n    else if (((EightPuzzleOperator*)op)->getOperatorValue().compare(\"right\") == 0)\n    {\n        numberPos = std::pair<int, int>(blankPos.first, blankPos.second + 1);\n    }\n\n    std::string letter1 = \"\";\n    std::string letter2 = \"\";\n\n    letter1 += ((EightPuzzleId*)getId())->getIdValue().at(numberPos.first * 3 + numberPos.second);\n    letter2 += ((EightPuzzleId*)getId())->getIdValue().at(blankPos.first * 3 + blankPos.second);\n\n    newId.replace(blankPos.first * 3 + blankPos.second, 1, letter1.c_str());\n    newId.replace(numberPos.first * 3 + numberPos.second, 1, letter2.c_str());\n\n    return new EightPuzzleId(newId);\n}\n<commit_msg>Remove some debugs<commit_after>#include \"eightpuzzlestate.h\"\n\nEightPuzzle::EightPuzzleState::EightPuzzleState(EightPuzzleId* id, EightPuzzleState* father, EightPuzzleOperator* fatherOperator, int depth, double cost) : State(id, father, fatherOperator, depth, cost)\n{\n}\n\nEightPuzzle::EightPuzzleState::~EightPuzzleState()\n{\n}\n\nbool EightPuzzle::EightPuzzleState::isFinal()\n{\n    return ((EightPuzzleId*)getId())->getIdValue().compare(\"12345678x\") == 0;\n}\n\nstd::vector<Operator*> EightPuzzle::EightPuzzleState::getAllowedOperators()\n{\n    std::pair<int, int> pos = getBlankPiecePos();\n    std::vector<Operator*> operatorAllowed;\n\n    Operator* up = new EightPuzzleOperator(\"up\");\n    Operator* down = new EightPuzzleOperator(\"down\");\n    Operator* left = new EightPuzzleOperator(\"left\");\n    Operator* right = new EightPuzzleOperator(\"right\");\n\n    operatorAllowed.push_back(up);\n    operatorAllowed.push_back(down);\n    operatorAllowed.push_back(left);\n    operatorAllowed.push_back(right);\n\n    switch (pos.first) {\n    case 0:\n        operatorAllowed.erase(std::remove(operatorAllowed.begin(), operatorAllowed.end(), up), operatorAllowed.end());\n        break;\n    case 2:\n        operatorAllowed.erase(std::remove(operatorAllowed.begin(), operatorAllowed.end(), down), operatorAllowed.end());\n        break;\n    default:\n        break;\n    }\n\n    switch (pos.second) {\n    case 0:\n        operatorAllowed.erase(std::remove(operatorAllowed.begin(), operatorAllowed.end(), left), operatorAllowed.end());\n        break;\n    case 2:\n        operatorAllowed.erase(std::remove(operatorAllowed.begin(), operatorAllowed.end(), right), operatorAllowed.end());\n        break;\n    default:\n        break;\n    }\n\n    return operatorAllowed;\n}\n\nstd::vector<State*> EightPuzzle::EightPuzzleState::genChilds(std::vector<Operator*> allowedOperators)\n{\n    std::vector<State*> childs;\n\n    for (int var = 0; var < allowedOperators.size(); ++var) {\n\n        Operator* side = allowedOperators[var];\n\n        childs.push_back(new EightPuzzleState((EightPuzzleId*)applyOperator(side), this, (EightPuzzleOperator*)side, getDepth() + 1, getCost() + 1));\n    }\n\n    return childs;\n}\n\nstd::pair<int, int> EightPuzzle::EightPuzzleState::getBlankPiecePos()\n{\n    std::size_t pos = ((EightPuzzleId*)getId())->getIdValue().find(\"x\");\n    int row = pos \/ 3;\n    int col = pos % 3;\n    return std::pair<int, int>(row, col);\n}\n\nId* EightPuzzle::EightPuzzleState::applyOperator(Operator* op)\n{\n    std::string newId = ((EightPuzzleId*)getId())->getIdValue();\n    std::pair<int, int> blankPos = getBlankPiecePos();\n    std::pair<int, int> numberPos;\n\n    if (((EightPuzzleOperator*)op)->getOperatorValue().compare(\"up\") == 0)\n    {\n        numberPos = std::pair<int, int>(blankPos.first - 1, blankPos.second);\n    }\n    else if (((EightPuzzleOperator*)op)->getOperatorValue().compare(\"down\") == 0)\n    {\n        numberPos = std::pair<int, int>(blankPos.first + 1, blankPos.second);\n    }\n    else if (((EightPuzzleOperator*)op)->getOperatorValue().compare(\"left\") == 0)\n    {\n        numberPos = std::pair<int, int>(blankPos.first, blankPos.second - 1);\n    }\n    else if (((EightPuzzleOperator*)op)->getOperatorValue().compare(\"right\") == 0)\n    {\n        numberPos = std::pair<int, int>(blankPos.first, blankPos.second + 1);\n    }\n\n    std::string letter1 = \"\";\n    std::string letter2 = \"\";\n\n    letter1 += ((EightPuzzleId*)getId())->getIdValue().at(numberPos.first * 3 + numberPos.second);\n    letter2 += ((EightPuzzleId*)getId())->getIdValue().at(blankPos.first * 3 + blankPos.second);\n\n    newId.replace(blankPos.first * 3 + blankPos.second, 1, letter1.c_str());\n    newId.replace(numberPos.first * 3 + numberPos.second, 1, letter2.c_str());\n\n    return new EightPuzzleId(newId);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *  Copyright (c) 2012 The WebRTC project authors. All Rights Reserved.\n *\n *  Use of this source code is governed by a BSD-style license\n *  that can be found in the LICENSE file in the root of the source\n *  tree. An additional intellectual property rights grant can be found\n *  in the file PATENTS.  All contributing project authors may\n *  be found in the AUTHORS file in the root of the source tree.\n *\/\n\n#include \"webrtc\/modules\/utility\/source\/process_thread_impl.h\"\n\n#include \"webrtc\/base\/checks.h\"\n#include \"webrtc\/modules\/interface\/module.h\"\n#include \"webrtc\/system_wrappers\/interface\/logging.h\"\n#include \"webrtc\/system_wrappers\/interface\/tick_util.h\"\n\nnamespace webrtc {\nnamespace {\n\n\/\/ We use this constant internally to signal that a module has requested\n\/\/ a callback right away.  When this is set, no call to TimeUntilNextProcess\n\/\/ should be made, but Process() should be called directly.\nconst int64_t kCallProcessImmediately = -1;\n\nint64_t GetNextCallbackTime(Module* module, int64_t time_now) {\n  int64_t interval = module->TimeUntilNextProcess();\n  \/\/ Currently some implementations erroneously return error codes from\n  \/\/ TimeUntilNextProcess(). So, as is, we correct that and log an error.\n  if (interval < 0) {\n    LOG(LS_ERROR) << \"TimeUntilNextProcess returned an invalid value \"\n                  << interval;\n    interval = 0;\n  }\n  return time_now + interval;\n}\n}\n\nProcessThread::~ProcessThread() {}\n\n\/\/ static\nrtc::scoped_ptr<ProcessThread> ProcessThread::Create() {\n  return rtc::scoped_ptr<ProcessThread>(new ProcessThreadImpl()).Pass();\n}\n\nProcessThreadImpl::ProcessThreadImpl()\n    : wake_up_(EventWrapper::Create()), stop_(false) {\n}\n\nProcessThreadImpl::~ProcessThreadImpl() {\n  DCHECK(thread_checker_.CalledOnValidThread());\n  DCHECK(!thread_.get());\n  DCHECK(!stop_);\n\n  while (!queue_.empty()) {\n    delete queue_.front();\n    queue_.pop();\n  }\n}\n\nvoid ProcessThreadImpl::Start() {\n  DCHECK(thread_checker_.CalledOnValidThread());\n  DCHECK(!thread_.get());\n  if (thread_.get())\n    return;\n\n  DCHECK(!stop_);\n\n  for (ModuleCallback& m : modules_)\n    m.module->ProcessThreadAttached(this);\n\n  thread_ = ThreadWrapper::CreateThread(\n      &ProcessThreadImpl::Run, this, \"ProcessThread\");\n  CHECK(thread_->Start());\n}\n\nvoid ProcessThreadImpl::Stop() {\n  DCHECK(thread_checker_.CalledOnValidThread());\n  if(!thread_.get())\n    return;\n\n  {\n    rtc::CritScope lock(&lock_);\n    stop_ = true;\n  }\n\n  wake_up_->Set();\n\n  CHECK(thread_->Stop());\n  thread_.reset();\n  stop_ = false;\n\n  for (ModuleCallback& m : modules_)\n    m.module->ProcessThreadAttached(nullptr);\n}\n\nvoid ProcessThreadImpl::WakeUp(Module* module) {\n  \/\/ Allowed to be called on any thread.\n  {\n    rtc::CritScope lock(&lock_);\n    for (ModuleCallback& m : modules_) {\n      if (m.module == module)\n        m.next_callback = kCallProcessImmediately;\n    }\n  }\n  wake_up_->Set();\n}\n\nvoid ProcessThreadImpl::PostTask(rtc::scoped_ptr<ProcessTask> task) {\n  \/\/ Allowed to be called on any thread.\n  {\n    rtc::CritScope lock(&lock_);\n    queue_.push(task.release());\n  }\n  wake_up_->Set();\n}\n\nvoid ProcessThreadImpl::RegisterModule(Module* module) {\n  \/\/ Allowed to be called on any thread.\n  DCHECK(module);\n\n#if (!defined(NDEBUG) || defined(DCHECK_ALWAYS_ON))\n  {\n    \/\/ Catch programmer error.\n    rtc::CritScope lock(&lock_);\n    for (const ModuleCallback& mc : modules_)\n      DCHECK(mc.module != module);\n  }\n#endif\n\n  \/\/ Now that we know the module isn't in the list, we'll call out to notify\n  \/\/ the module that it's attached to the worker thread.  We don't hold\n  \/\/ the lock while we make this call.\n  if (thread_.get())\n    module->ProcessThreadAttached(this);\n\n  {\n    rtc::CritScope lock(&lock_);\n    modules_.push_back(ModuleCallback(module));\n  }\n\n  \/\/ Wake the thread calling ProcessThreadImpl::Process() to update the\n  \/\/ waiting time. The waiting time for the just registered module may be\n  \/\/ shorter than all other registered modules.\n  wake_up_->Set();\n}\n\nvoid ProcessThreadImpl::DeRegisterModule(Module* module) {\n  \/\/ Allowed to be called on any thread.\n  DCHECK(module);\n  {\n    rtc::CritScope lock(&lock_);\n    modules_.remove_if([&module](const ModuleCallback& m) {\n        return m.module == module;\n      });\n  }\n\n  \/\/ Notify the module that it's been detached, while not holding the lock.\n  if (thread_.get())\n    module->ProcessThreadAttached(nullptr);\n}\n\n\/\/ static\nbool ProcessThreadImpl::Run(void* obj) {\n  return static_cast<ProcessThreadImpl*>(obj)->Process();\n}\n\nbool ProcessThreadImpl::Process() {\n  int64_t now = TickTime::MillisecondTimestamp();\n  int64_t next_checkpoint = now + (1000 * 60);\n\n  {\n    rtc::CritScope lock(&lock_);\n    if (stop_)\n      return false;\n    for (ModuleCallback& m : modules_) {\n      \/\/ TODO(tommi): Would be good to measure the time TimeUntilNextProcess\n      \/\/ takes and dcheck if it takes too long (e.g. >=10ms).  Ideally this\n      \/\/ operation should not require taking a lock, so querying all modules\n      \/\/ should run in a matter of nanoseconds.\n      if (m.next_callback == 0)\n        m.next_callback = GetNextCallbackTime(m.module, now);\n\n      if (m.next_callback <= now ||\n          m.next_callback == kCallProcessImmediately) {\n        m.module->Process();\n        \/\/ Use a new 'now' reference to calculate when the next callback\n        \/\/ should occur.  We'll continue to use 'now' above for the baseline\n        \/\/ of calculating how long we should wait, to reduce variance.\n        int64_t new_now = TickTime::MillisecondTimestamp();\n        m.next_callback = GetNextCallbackTime(m.module, new_now);\n      }\n\n      if (m.next_callback < next_checkpoint)\n        next_checkpoint = m.next_callback;\n    }\n\n    while (!queue_.empty()) {\n      ProcessTask* task = queue_.front();\n      queue_.pop();\n      lock_.Leave();\n      task->Run();\n      delete task;\n      lock_.Enter();\n    }\n  }\n\n  int64_t time_to_wait = next_checkpoint - TickTime::MillisecondTimestamp();\n  if (time_to_wait > 0)\n    wake_up_->Wait(static_cast<unsigned long>(time_to_wait));\n\n  return true;\n}\n}  \/\/ namespace webrtc\n<commit_msg>Add locks to Start(), Stop() methods in ProcessThread. This is necessary unfortunately since there are a few places where DeRegisterModule does not reliably occur on the same thread.<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\/utility\/source\/process_thread_impl.h\"\n\n#include \"webrtc\/base\/checks.h\"\n#include \"webrtc\/modules\/interface\/module.h\"\n#include \"webrtc\/system_wrappers\/interface\/logging.h\"\n#include \"webrtc\/system_wrappers\/interface\/tick_util.h\"\n\nnamespace webrtc {\nnamespace {\n\n\/\/ We use this constant internally to signal that a module has requested\n\/\/ a callback right away.  When this is set, no call to TimeUntilNextProcess\n\/\/ should be made, but Process() should be called directly.\nconst int64_t kCallProcessImmediately = -1;\n\nint64_t GetNextCallbackTime(Module* module, int64_t time_now) {\n  int64_t interval = module->TimeUntilNextProcess();\n  \/\/ Currently some implementations erroneously return error codes from\n  \/\/ TimeUntilNextProcess(). So, as is, we correct that and log an error.\n  if (interval < 0) {\n    LOG(LS_ERROR) << \"TimeUntilNextProcess returned an invalid value \"\n                  << interval;\n    interval = 0;\n  }\n  return time_now + interval;\n}\n}\n\nProcessThread::~ProcessThread() {}\n\n\/\/ static\nrtc::scoped_ptr<ProcessThread> ProcessThread::Create() {\n  return rtc::scoped_ptr<ProcessThread>(new ProcessThreadImpl()).Pass();\n}\n\nProcessThreadImpl::ProcessThreadImpl()\n    : wake_up_(EventWrapper::Create()), stop_(false) {\n}\n\nProcessThreadImpl::~ProcessThreadImpl() {\n  DCHECK(thread_checker_.CalledOnValidThread());\n  DCHECK(!thread_.get());\n  DCHECK(!stop_);\n\n  while (!queue_.empty()) {\n    delete queue_.front();\n    queue_.pop();\n  }\n}\n\nvoid ProcessThreadImpl::Start() {\n  DCHECK(thread_checker_.CalledOnValidThread());\n  DCHECK(!thread_.get());\n  if (thread_.get())\n    return;\n\n  DCHECK(!stop_);\n\n  {\n    \/\/ TODO(tommi): Since DeRegisterModule is currently being called from\n    \/\/ different threads in some cases (ChannelOwner), we need to lock access to\n    \/\/ the modules_ collection even on the controller thread.\n    \/\/ Once we've cleaned up those places, we can remove this lock.\n    rtc::CritScope lock(&lock_);\n    for (ModuleCallback& m : modules_)\n      m.module->ProcessThreadAttached(this);\n  }\n\n  thread_ = ThreadWrapper::CreateThread(\n      &ProcessThreadImpl::Run, this, \"ProcessThread\");\n  CHECK(thread_->Start());\n}\n\nvoid ProcessThreadImpl::Stop() {\n  DCHECK(thread_checker_.CalledOnValidThread());\n  if(!thread_.get())\n    return;\n\n  {\n    rtc::CritScope lock(&lock_);\n    stop_ = true;\n  }\n\n  wake_up_->Set();\n\n  CHECK(thread_->Stop());\n  thread_.reset();\n  stop_ = false;\n\n  \/\/ TODO(tommi): Since DeRegisterModule is currently being called from\n  \/\/ different threads in some cases (ChannelOwner), we need to lock access to\n  \/\/ the modules_ collection even on the controller thread.\n  \/\/ Once we've cleaned up those places, we can remove this lock.\n  rtc::CritScope lock(&lock_);\n  for (ModuleCallback& m : modules_)\n    m.module->ProcessThreadAttached(nullptr);\n}\n\nvoid ProcessThreadImpl::WakeUp(Module* module) {\n  \/\/ Allowed to be called on any thread.\n  \/\/ TODO(tommi): Disallow this ^^^\n  {\n    rtc::CritScope lock(&lock_);\n    for (ModuleCallback& m : modules_) {\n      if (m.module == module)\n        m.next_callback = kCallProcessImmediately;\n    }\n  }\n  wake_up_->Set();\n}\n\nvoid ProcessThreadImpl::PostTask(rtc::scoped_ptr<ProcessTask> task) {\n  \/\/ Allowed to be called on any thread.\n  \/\/ TODO(tommi): Disallow this ^^^\n  {\n    rtc::CritScope lock(&lock_);\n    queue_.push(task.release());\n  }\n  wake_up_->Set();\n}\n\nvoid ProcessThreadImpl::RegisterModule(Module* module) {\n  \/\/ Allowed to be called on any thread.\n  DCHECK(module);\n\n#if (!defined(NDEBUG) || defined(DCHECK_ALWAYS_ON))\n  {\n    \/\/ Catch programmer error.\n    rtc::CritScope lock(&lock_);\n    for (const ModuleCallback& mc : modules_)\n      DCHECK(mc.module != module);\n  }\n#endif\n\n  \/\/ Now that we know the module isn't in the list, we'll call out to notify\n  \/\/ the module that it's attached to the worker thread.  We don't hold\n  \/\/ the lock while we make this call.\n  if (thread_.get())\n    module->ProcessThreadAttached(this);\n\n  {\n    rtc::CritScope lock(&lock_);\n    modules_.push_back(ModuleCallback(module));\n  }\n\n  \/\/ Wake the thread calling ProcessThreadImpl::Process() to update the\n  \/\/ waiting time. The waiting time for the just registered module may be\n  \/\/ shorter than all other registered modules.\n  wake_up_->Set();\n}\n\nvoid ProcessThreadImpl::DeRegisterModule(Module* module) {\n  \/\/ Allowed to be called on any thread.\n  DCHECK(module);\n  {\n    rtc::CritScope lock(&lock_);\n    modules_.remove_if([&module](const ModuleCallback& m) {\n        return m.module == module;\n      });\n  }\n\n  \/\/ Notify the module that it's been detached, while not holding the lock.\n  if (thread_.get())\n    module->ProcessThreadAttached(nullptr);\n}\n\n\/\/ static\nbool ProcessThreadImpl::Run(void* obj) {\n  return static_cast<ProcessThreadImpl*>(obj)->Process();\n}\n\nbool ProcessThreadImpl::Process() {\n  int64_t now = TickTime::MillisecondTimestamp();\n  int64_t next_checkpoint = now + (1000 * 60);\n\n  {\n    rtc::CritScope lock(&lock_);\n    if (stop_)\n      return false;\n    for (ModuleCallback& m : modules_) {\n      \/\/ TODO(tommi): Would be good to measure the time TimeUntilNextProcess\n      \/\/ takes and dcheck if it takes too long (e.g. >=10ms).  Ideally this\n      \/\/ operation should not require taking a lock, so querying all modules\n      \/\/ should run in a matter of nanoseconds.\n      if (m.next_callback == 0)\n        m.next_callback = GetNextCallbackTime(m.module, now);\n\n      if (m.next_callback <= now ||\n          m.next_callback == kCallProcessImmediately) {\n        m.module->Process();\n        \/\/ Use a new 'now' reference to calculate when the next callback\n        \/\/ should occur.  We'll continue to use 'now' above for the baseline\n        \/\/ of calculating how long we should wait, to reduce variance.\n        int64_t new_now = TickTime::MillisecondTimestamp();\n        m.next_callback = GetNextCallbackTime(m.module, new_now);\n      }\n\n      if (m.next_callback < next_checkpoint)\n        next_checkpoint = m.next_callback;\n    }\n\n    while (!queue_.empty()) {\n      ProcessTask* task = queue_.front();\n      queue_.pop();\n      lock_.Leave();\n      task->Run();\n      delete task;\n      lock_.Enter();\n    }\n  }\n\n  int64_t time_to_wait = next_checkpoint - TickTime::MillisecondTimestamp();\n  if (time_to_wait > 0)\n    wake_up_->Wait(static_cast<unsigned long>(time_to_wait));\n\n  return true;\n}\n}  \/\/ namespace webrtc\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>ENH: Fixed coverity 107502<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"blackhole\/sink\/asynchronous.hpp\"\n\n#include <boost\/optional\/optional.hpp>\n\n#include \"blackhole\/config\/node.hpp\"\n#include \"blackhole\/config\/option.hpp\"\n#include \"blackhole\/registry.hpp\"\n\n#include \"blackhole\/detail\/sink\/asynchronous.hpp\"\n\n#include <cmath>\n\nnamespace blackhole {\ninline namespace v1 {\nnamespace experimental {\nnamespace sink {\nnamespace {\n\nstatic auto 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    if (stopped) {\n        throw std::logic_error(\"queue is sealed\");\n    }\n\n    while (true) {\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 (dequeued) {\n            try {\n                wrapped->emit(result.record.into_view(), result.message);\n                overflow_policy->wakeup();\n            } catch (...) {\n                \/\/ TODO: exception_policy->process(std::current_exception()); []\n            }\n\n        } else {\n            ::usleep(1000);\n            \/\/ TODO: underflow_policy->underflow(); [wait for enqueue, sleep].\n        }\n\n        if (stopped && !dequeued) {\n            return;\n        }\n    }\n}\n\n}  \/\/ namespace sink\n\nauto factory<sink::asynchronous_t>::type() const noexcept -> const char* {\n    return \"asynchronous\";\n}\n\nauto factory<sink::asynchronous_t>::from(const config::node_t& config) const -> std::unique_ptr<sink_t> {\n    auto factory = registry.sink(*config[\"sink\"][\"type\"].to_string());\n    return std::unique_ptr<sink_t>(new sink::asynchronous_t(factory(*config[\"sink\"].unwrap())));\n}\n\n}  \/\/ namespace experimental\n}  \/\/ namespace v1\n}  \/\/ namespace blackhole\n<commit_msg>fix: proper break logic<commit_after>#include \"blackhole\/sink\/asynchronous.hpp\"\n\n#include <boost\/optional\/optional.hpp>\n\n#include \"blackhole\/config\/node.hpp\"\n#include \"blackhole\/config\/option.hpp\"\n#include \"blackhole\/registry.hpp\"\n\n#include \"blackhole\/detail\/sink\/asynchronous.hpp\"\n\n#include <cmath>\n\nnamespace blackhole {\ninline namespace v1 {\nnamespace experimental {\nnamespace sink {\nnamespace {\n\nstatic auto 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 drop_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    if (stopped) {\n        throw std::logic_error(\"queue is sealed\");\n    }\n\n    while (true) {\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(std::current_exception()); []\n            }\n\n        } else {\n            ::usleep(1000);\n            \/\/ TODO: underflow_policy->underflow(); [wait for enqueue, sleep].\n        }\n    }\n}\n\n}  \/\/ namespace sink\n\nauto factory<sink::asynchronous_t>::type() const noexcept -> const char* {\n    return \"asynchronous\";\n}\n\nauto factory<sink::asynchronous_t>::from(const config::node_t& config) const -> std::unique_ptr<sink_t> {\n    auto factory = registry.sink(*config[\"sink\"][\"type\"].to_string());\n    return std::unique_ptr<sink_t>(new sink::asynchronous_t(factory(*config[\"sink\"].unwrap())));\n}\n\n}  \/\/ namespace experimental\n}  \/\/ namespace v1\n}  \/\/ namespace blackhole\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 \"indexfile.h\"\n\n#include \"file.h\"\n#include \"wordentry.h\"\n\n#include <QtCore\/QDebug>\n#include <QtCore\/QStringList>\n#include <QtCore\/QFile>\n#include <QtCore\/QtEndian>\n\nusing namespace MulaPluginStarDict;\n\nclass IndexFile::Private\n{\n    public:\n        Private()\n        {\n        }\n\n        ~Private()\n        {\n        }\n\n        QList<WordEntry> wordEntryList;\n};\n\nIndexFile::IndexFile()\n    : d(new Private)\n{\n}\n\nIndexFile::~IndexFile()\n{\n}\n\nbool\nIndexFile::load(const QString& filePath, qulonglong fileSize)\n{\n    QFile file(filePath);\n    if (!file.open(QIODevice::ReadOnly))\n    {\n        qDebug() << Q_FUNC_INFO << \"Failed to open file:\" << filePath;\n        return false;\n    }\n\n    QByteArray indexDataBuffer = file.read(fileSize);\n\n    file.close();\n\n    qulonglong position = 0;\n    d->wordEntryList.clear();\n    while (fileSize > position)\n    {\n        WordEntry wordEntry;\n        wordEntry.setData(indexDataBuffer.mid(position));\n        ++position;\n        wordEntry.setDataOffset(qFromBigEndian(*reinterpret_cast<quint32 *>(indexDataBuffer.mid(position).data())));\n        position += sizeof(quint32);\n        wordEntry.setDataSize(qFromBigEndian(*reinterpret_cast<quint32 *>(indexDataBuffer.mid(position).data())));\n        position += sizeof(quint32);\n\n        d->wordEntryList.append(wordEntry);\n    }\n\n    return true;\n}\n\nQByteArray\nIndexFile::key(long index)\n{\n    return d->wordEntryList.at(index).data();\n}\n\ninline bool\nlessThanCompare(const QString string1, const QString string2)\n{\n    return stardictStringCompare(string1, string2) < 0;\n}\n\nbool\nIndexFile::lookup(const QByteArray &word, int &index)\n{\n    bool found = false;\n    QStringList wordList;\n    foreach (const WordEntry &wordEntry, d->wordEntryList)\n        wordList.append(QString::fromUtf8(wordEntry.data()));\n\n    QStringList::iterator i = qBinaryFind(wordList.begin(), wordList.end(), QString::fromUtf8(word), lessThanCompare);\n\n    if (i == wordList.end())\n    {\n        index = -1;\n    }\n    else\n    {\n        index = i - wordList.begin();\n        found = true;\n    }\n\n    return found;\n}\n<commit_msg>Cache the value of the 32 bits<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 \"indexfile.h\"\n\n#include \"file.h\"\n#include \"wordentry.h\"\n\n#include <QtCore\/QDebug>\n#include <QtCore\/QStringList>\n#include <QtCore\/QFile>\n#include <QtCore\/QtEndian>\n\nusing namespace MulaPluginStarDict;\n\nclass IndexFile::Private\n{\n    public:\n        Private()\n        {\n        }\n\n        ~Private()\n        {\n        }\n\n        QList<WordEntry> wordEntryList;\n};\n\nIndexFile::IndexFile()\n    : d(new Private)\n{\n}\n\nIndexFile::~IndexFile()\n{\n}\n\nbool\nIndexFile::load(const QString& filePath, qulonglong fileSize)\n{\n    QFile file(filePath);\n    if (!file.open(QIODevice::ReadOnly))\n    {\n        qDebug() << Q_FUNC_INFO << \"Failed to open file:\" << filePath;\n        return false;\n    }\n\n    QByteArray indexDataBuffer = file.read(fileSize);\n\n    file.close();\n\n    qulonglong position = 0;\n    d->wordEntryList.clear();\n    int squint32 = sizeof(quint32);\n\n    while (fileSize > position)\n    {\n        WordEntry wordEntry;\n        wordEntry.setData(indexDataBuffer.mid(position));\n        ++position;\n        wordEntry.setDataOffset(qFromBigEndian(*reinterpret_cast<quint32 *>(indexDataBuffer.mid(position).data())));\n        position += squint32;\n        wordEntry.setDataSize(qFromBigEndian(*reinterpret_cast<quint32 *>(indexDataBuffer.mid(position).data())));\n        position += squint32;\n\n        d->wordEntryList.append(wordEntry);\n    }\n\n    return true;\n}\n\nQByteArray\nIndexFile::key(long index)\n{\n    return d->wordEntryList.at(index).data();\n}\n\ninline bool\nlessThanCompare(const QString string1, const QString string2)\n{\n    return stardictStringCompare(string1, string2) < 0;\n}\n\nbool\nIndexFile::lookup(const QByteArray &word, int &index)\n{\n    bool found = false;\n    QStringList wordList;\n    foreach (const WordEntry &wordEntry, d->wordEntryList)\n        wordList.append(QString::fromUtf8(wordEntry.data()));\n\n    QStringList::iterator i = qBinaryFind(wordList.begin(), wordList.end(), QString::fromUtf8(word), lessThanCompare);\n\n    if (i == wordList.end())\n    {\n        index = -1;\n    }\n    else\n    {\n        index = i - wordList.begin();\n        found = true;\n    }\n\n    return found;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *   Copyright (c) 2008-2018 SLIBIO <https:\/\/github.com\/SLIBIO>\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 \"slib\/ui\/check_box.h\"\n\n#include \"slib\/ui\/core.h\"\n#include \"slib\/ui\/resource.h\"\n#include \"slib\/core\/safe_static.h\"\n\nnamespace slib\n{\n\n\tclass _priv_CheckBox_Icon : public Drawable\n\t{\n\tpublic:\n\t\tRef<Pen> m_penBorder;\n\t\tRef<Brush> m_brush;\n\t\tRef<Pen> m_penCheck;\n\t\t\n\tpublic:\n\t\t_priv_CheckBox_Icon(const Ref<Pen>& penBorder, const Color& backColor, const Ref<Pen>& penCheck)\n\t\t{\n\t\t\tm_penBorder = penBorder;\n\t\t\tif (backColor.a > 0) {\n\t\t\t\tm_brush = Brush::createSolidBrush(backColor);\n\t\t\t}\n\t\t\tm_penCheck = penCheck;\n\t\t}\n\t\t\n\tpublic:\n\t\tvoid onDrawAll(Canvas* canvas, const Rectangle& rect, const DrawParam& param) override\n\t\t{\n\t\t\tsl_bool flagAntiAlias = canvas->isAntiAlias();\n\t\t\tcanvas->setAntiAlias(sl_false);\n\t\t\tcanvas->drawRectangle(rect, m_penBorder, m_brush);\n\t\t\tcanvas->setAntiAlias(flagAntiAlias);\n\t\t\t\n\t\t\tif (m_penCheck.isNotNull()) {\n\t\t\t\tPoint pts[3];\n\t\t\t\tpts[0] = Point(0.2f, 0.6f);\n\t\t\t\tpts[1] = Point(0.4f, 0.8f);\n\t\t\t\tpts[2] = Point(0.8f, 0.3f);\n\t\t\t\tfor (int i = 0; i < 3; i++) {\n\t\t\t\t\tpts[i].x = rect.left + rect.getWidth() * pts[i].x;\n\t\t\t\t\tpts[i].y = rect.top + rect.getHeight() * pts[i].y;\n\t\t\t\t}\n\t\t\t\tcanvas->drawLines(pts, 3, m_penCheck);\n\t\t\t}\n\t\t}\n\t\t\n\t};\n\n\tclass _priv_CheckBox_Categories\n\t{\n\tpublic:\n\t\tButtonCategory categories[2];\n\t\t\n\tpublic:\n\t\t_priv_CheckBox_Categories()\n\t\t{\n\t\t\tsl_real w = (sl_real)(UIResource::toUiPos(UIResource::dpToPixel(1)));\n\t\t\tColor colorBackNormal = Color::White;\n\t\t\tColor colorBackHover = Color::White;\n\t\t\tColor colorBackDown(220, 230, 255);\n\t\t\tColor colorBackDisabled(220, 220, 220);\n\t\t\tRef<Pen> penNormal = Pen::createSolidPen(w, Color::Black);\n\t\t\tRef<Pen> penHover = Pen::createSolidPen(w, Color(0, 80, 200));\n\t\t\tRef<Pen> penDown = penHover;\n\t\t\tRef<Pen> penDisabled = Pen::createSolidPen(w, Color(90, 90, 90));\n\t\t\tRef<Pen> penCheckNormal = Pen::createSolidPen(w*2, Color::Black);\n\t\t\tRef<Pen> penCheckHover = Pen::createSolidPen(w*2, Color(0, 80, 200));\n\t\t\tRef<Pen> penCheckDown = penCheckHover;\n\t\t\tRef<Pen> penCheckDisabled = Pen::createSolidPen(w*2, Color(90, 90, 90));\n\t\t\tcategories[0].properties[(int)ButtonState::Normal].icon = new _priv_CheckBox_Icon(penNormal, colorBackNormal, Ref<Pen>::null());\n\t\t\tcategories[0].properties[(int)ButtonState::Disabled].icon = new _priv_CheckBox_Icon(penDisabled, colorBackDisabled, Ref<Pen>::null());\n\t\t\tcategories[0].properties[(int)ButtonState::Hover].icon = new _priv_CheckBox_Icon(penHover, colorBackHover, Ref<Pen>::null());\n\t\t\tcategories[0].properties[(int)ButtonState::Pressed].icon = new _priv_CheckBox_Icon(penDown, colorBackDown, Ref<Pen>::null());\n\t\t\t\n\t\t\tcategories[1] = categories[0];\n\t\t\tcategories[1].properties[(int)ButtonState::Normal].icon = new _priv_CheckBox_Icon(penNormal, colorBackNormal, penCheckNormal);\n\t\t\tcategories[1].properties[(int)ButtonState::Disabled].icon = new _priv_CheckBox_Icon(penDisabled, colorBackDisabled, penCheckDisabled);\n\t\t\tcategories[1].properties[(int)ButtonState::Hover].icon = new _priv_CheckBox_Icon(penHover, colorBackHover, penCheckHover);\n\t\t\tcategories[1].properties[(int)ButtonState::Pressed].icon = new _priv_CheckBox_Icon(penDown, colorBackDown, penCheckDown);\n\t\t}\n\t\t\n\tpublic:\n\t\tstatic ButtonCategory* getCategories()\n\t\t{\n\t\t\tSLIB_SAFE_STATIC(_priv_CheckBox_Categories, ret)\n\t\t\tif (SLIB_SAFE_STATIC_CHECK_FREED(ret)) {\n\t\t\t\treturn sl_null;\n\t\t\t}\n\t\t\treturn ret.categories;\n\t\t}\n\t};\n\n\tSLIB_DEFINE_OBJECT(CheckBox, Button)\n\n\tCheckBox::CheckBox() : CheckBox(2, _priv_CheckBox_Categories::getCategories())\n\t{\n\t}\n\n\tCheckBox::CheckBox(sl_uint32 nCategories, ButtonCategory* categories) : Button(nCategories, categories)\n\t{\n\t\tsetCreatingNativeWidget(sl_false);\n\t\t\n\t\tm_flagChecked = sl_false;\n\t\t\n\t\tsetGravity(Alignment::MiddleLeft, UIUpdateMode::Init);\n\t\tsetIconAlignment(Alignment::MiddleLeft, UIUpdateMode::Init);\n\t\tsetTextAlignment(Alignment::MiddleLeft, UIUpdateMode::Init);\n\t\t\n\t\tsetBorder(sl_false, UIUpdateMode::Init);\n\t\tsetBackground(Ref<Drawable>::null(), UIUpdateMode::Init);\n\t\t\n\t\tsetTextColor(Color::Black, UIUpdateMode::Init);\n\t\tsetTextMarginLeft(2 * UIResource::toUiPos(UIResource::dpToPixel(1)), UIUpdateMode::Init);\n\t}\n\n\tCheckBox::~CheckBox()\n\t{\n\t}\n\n\tsl_bool CheckBox::isChecked()\n\t{\n\t\tif (isNativeWidget()) {\n\t\t\t_getChecked_NW();\n\t\t}\n\t\treturn m_flagChecked;\n\t}\n\n\tvoid CheckBox::setChecked(sl_bool flag, UIUpdateMode mode)\n\t{\n\t\tm_flagChecked = flag;\n\t\tif (isNativeWidget()) {\n\t\t\tsetCurrentCategory(flag ? 1 : 0, UIUpdateMode::None);\n\t\t\t_setChecked_NW(flag);\n\t\t} else {\n\t\t\tsetCurrentCategory(flag ? 1 : 0, mode);\n\t\t}\n\t}\n\t\n\tUISize _priv_CheckBox_macOS_measureSize(Button* view);\n\tUISize _priv_CheckBox_Win32_measureSize(Button* view);\n\n\tUISize CheckBox::measureLayoutContentSize()\n\t{\n#if defined(SLIB_PLATFORM_IS_MACOS)\n\t\tif (isCreatingNativeWidget()) {\n\t\t\treturn _priv_CheckBox_macOS_measureSize(this);\n\t\t}\n#endif\n#if defined(SLIB_PLATFORM_IS_WIN32)\n\t\tif (isCreatingNativeWidget()) {\n\t\t\treturn _priv_CheckBox_Win32_measureSize(this);\n\t\t}\n#endif\n\t\treturn measureContentSize();\n\t}\n\n\tvoid CheckBox::onClickEvent(UIEvent* ev)\n\t{\n\t\tif (isNativeWidget()) {\n\t\t\t_getChecked_NW();\n\t\t} else {\n\t\t\tsetChecked(!m_flagChecked);\n\t\t}\n\t}\n\n#if !defined(SLIB_UI_IS_MACOS) && !defined(SLIB_UI_IS_WIN32)\n\tRef<ViewInstance> CheckBox::createNativeWidget(ViewInstance* parent)\n\t{\n\t\treturn sl_null;\n\t}\n\n\tvoid CheckBox::_getChecked_NW()\n\t{\n\t}\n\n\tvoid CheckBox::_setChecked_NW(sl_bool flag)\n\t{\n\t}\n#endif\n\n}\n\n<commit_msg>ui\/CheckBox: adjust icon margin<commit_after>\/*\n *   Copyright (c) 2008-2018 SLIBIO <https:\/\/github.com\/SLIBIO>\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 \"slib\/ui\/check_box.h\"\n\n#include \"slib\/ui\/core.h\"\n#include \"slib\/ui\/resource.h\"\n#include \"slib\/core\/safe_static.h\"\n\nnamespace slib\n{\n\n\tclass _priv_CheckBox_Icon : public Drawable\n\t{\n\tpublic:\n\t\tRef<Pen> m_penBorder;\n\t\tRef<Brush> m_brush;\n\t\tRef<Pen> m_penCheck;\n\t\t\n\tpublic:\n\t\t_priv_CheckBox_Icon(const Ref<Pen>& penBorder, const Color& backColor, const Ref<Pen>& penCheck)\n\t\t{\n\t\t\tm_penBorder = penBorder;\n\t\t\tif (backColor.a > 0) {\n\t\t\t\tm_brush = Brush::createSolidBrush(backColor);\n\t\t\t}\n\t\t\tm_penCheck = penCheck;\n\t\t}\n\t\t\n\tpublic:\n\t\tvoid onDrawAll(Canvas* canvas, const Rectangle& rect, const DrawParam& param) override\n\t\t{\n\t\t\tsl_bool flagAntiAlias = canvas->isAntiAlias();\n\t\t\tcanvas->setAntiAlias(sl_false);\n\t\t\tcanvas->drawRectangle(rect, m_penBorder, m_brush);\n\t\t\tcanvas->setAntiAlias(flagAntiAlias);\n\t\t\t\n\t\t\tif (m_penCheck.isNotNull()) {\n\t\t\t\tPoint pts[3];\n\t\t\t\tpts[0] = Point(0.2f, 0.6f);\n\t\t\t\tpts[1] = Point(0.4f, 0.8f);\n\t\t\t\tpts[2] = Point(0.8f, 0.3f);\n\t\t\t\tfor (int i = 0; i < 3; i++) {\n\t\t\t\t\tpts[i].x = rect.left + rect.getWidth() * pts[i].x;\n\t\t\t\t\tpts[i].y = rect.top + rect.getHeight() * pts[i].y;\n\t\t\t\t}\n\t\t\t\tcanvas->drawLines(pts, 3, m_penCheck);\n\t\t\t}\n\t\t}\n\t\t\n\t};\n\n\tclass _priv_CheckBox_Categories\n\t{\n\tpublic:\n\t\tButtonCategory categories[2];\n\t\t\n\tpublic:\n\t\t_priv_CheckBox_Categories()\n\t\t{\n\t\t\tsl_real w = (sl_real)(UIResource::toUiPos(UIResource::dpToPixel(1)));\n\t\t\tColor colorBackNormal = Color::White;\n\t\t\tColor colorBackHover = Color::White;\n\t\t\tColor colorBackDown(220, 230, 255);\n\t\t\tColor colorBackDisabled(220, 220, 220);\n\t\t\tRef<Pen> penNormal = Pen::createSolidPen(w, Color::Black);\n\t\t\tRef<Pen> penHover = Pen::createSolidPen(w, Color(0, 80, 200));\n\t\t\tRef<Pen> penDown = penHover;\n\t\t\tRef<Pen> penDisabled = Pen::createSolidPen(w, Color(90, 90, 90));\n\t\t\tRef<Pen> penCheckNormal = Pen::createSolidPen(w*2, Color::Black);\n\t\t\tRef<Pen> penCheckHover = Pen::createSolidPen(w*2, Color(0, 80, 200));\n\t\t\tRef<Pen> penCheckDown = penCheckHover;\n\t\t\tRef<Pen> penCheckDisabled = Pen::createSolidPen(w*2, Color(90, 90, 90));\n\t\t\tcategories[0].properties[(int)ButtonState::Normal].icon = new _priv_CheckBox_Icon(penNormal, colorBackNormal, Ref<Pen>::null());\n\t\t\tcategories[0].properties[(int)ButtonState::Disabled].icon = new _priv_CheckBox_Icon(penDisabled, colorBackDisabled, Ref<Pen>::null());\n\t\t\tcategories[0].properties[(int)ButtonState::Hover].icon = new _priv_CheckBox_Icon(penHover, colorBackHover, Ref<Pen>::null());\n\t\t\tcategories[0].properties[(int)ButtonState::Pressed].icon = new _priv_CheckBox_Icon(penDown, colorBackDown, Ref<Pen>::null());\n\t\t\t\n\t\t\tcategories[1] = categories[0];\n\t\t\tcategories[1].properties[(int)ButtonState::Normal].icon = new _priv_CheckBox_Icon(penNormal, colorBackNormal, penCheckNormal);\n\t\t\tcategories[1].properties[(int)ButtonState::Disabled].icon = new _priv_CheckBox_Icon(penDisabled, colorBackDisabled, penCheckDisabled);\n\t\t\tcategories[1].properties[(int)ButtonState::Hover].icon = new _priv_CheckBox_Icon(penHover, colorBackHover, penCheckHover);\n\t\t\tcategories[1].properties[(int)ButtonState::Pressed].icon = new _priv_CheckBox_Icon(penDown, colorBackDown, penCheckDown);\n\t\t}\n\t\t\n\tpublic:\n\t\tstatic ButtonCategory* getCategories()\n\t\t{\n\t\t\tSLIB_SAFE_STATIC(_priv_CheckBox_Categories, ret)\n\t\t\tif (SLIB_SAFE_STATIC_CHECK_FREED(ret)) {\n\t\t\t\treturn sl_null;\n\t\t\t}\n\t\t\treturn ret.categories;\n\t\t}\n\t};\n\n\tSLIB_DEFINE_OBJECT(CheckBox, Button)\n\n\tCheckBox::CheckBox() : CheckBox(2, _priv_CheckBox_Categories::getCategories())\n\t{\n\t}\n\n\tCheckBox::CheckBox(sl_uint32 nCategories, ButtonCategory* categories) : Button(nCategories, categories)\n\t{\n\t\tsetCreatingNativeWidget(sl_false);\n\t\t\n\t\tm_flagChecked = sl_false;\n\t\t\n\t\tsetGravity(Alignment::MiddleLeft, UIUpdateMode::Init);\n\t\tsetIconAlignment(Alignment::MiddleLeft, UIUpdateMode::Init);\n\t\tsetTextAlignment(Alignment::MiddleLeft, UIUpdateMode::Init);\n\t\t\n\t\tsetBorder(sl_false, UIUpdateMode::Init);\n\t\tsetBackground(Ref<Drawable>::null(), UIUpdateMode::Init);\n\t\t\n\t\tsetTextColor(Color::Black, UIUpdateMode::Init);\n\t\tsetTextMargin(2 * UIResource::toUiPos(UIResource::dpToPixel(1)), 1, 1, 2, UIUpdateMode::Init);\n\t\tsetIconMargin(1, 2, 1, 1, UIUpdateMode::Init);\n\t}\n\n\tCheckBox::~CheckBox()\n\t{\n\t}\n\n\tsl_bool CheckBox::isChecked()\n\t{\n\t\tif (isNativeWidget()) {\n\t\t\t_getChecked_NW();\n\t\t}\n\t\treturn m_flagChecked;\n\t}\n\n\tvoid CheckBox::setChecked(sl_bool flag, UIUpdateMode mode)\n\t{\n\t\tm_flagChecked = flag;\n\t\tif (isNativeWidget()) {\n\t\t\tsetCurrentCategory(flag ? 1 : 0, UIUpdateMode::None);\n\t\t\t_setChecked_NW(flag);\n\t\t} else {\n\t\t\tsetCurrentCategory(flag ? 1 : 0, mode);\n\t\t}\n\t}\n\t\n\tUISize _priv_CheckBox_macOS_measureSize(Button* view);\n\tUISize _priv_CheckBox_Win32_measureSize(Button* view);\n\n\tUISize CheckBox::measureLayoutContentSize()\n\t{\n#if defined(SLIB_PLATFORM_IS_MACOS)\n\t\tif (isCreatingNativeWidget()) {\n\t\t\treturn _priv_CheckBox_macOS_measureSize(this);\n\t\t}\n#endif\n#if defined(SLIB_PLATFORM_IS_WIN32)\n\t\tif (isCreatingNativeWidget()) {\n\t\t\treturn _priv_CheckBox_Win32_measureSize(this);\n\t\t}\n#endif\n\t\treturn measureContentSize();\n\t}\n\n\tvoid CheckBox::onClickEvent(UIEvent* ev)\n\t{\n\t\tif (isNativeWidget()) {\n\t\t\t_getChecked_NW();\n\t\t} else {\n\t\t\tsetChecked(!m_flagChecked);\n\t\t}\n\t}\n\n#if !defined(SLIB_UI_IS_MACOS) && !defined(SLIB_UI_IS_WIN32)\n\tRef<ViewInstance> CheckBox::createNativeWidget(ViewInstance* parent)\n\t{\n\t\treturn sl_null;\n\t}\n\n\tvoid CheckBox::_getChecked_NW()\n\t{\n\t}\n\n\tvoid CheckBox::_setChecked_NW(sl_bool flag)\n\t{\n\t}\n#endif\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/configuration_policy_provider.h\"\n\n#include \"base\/values.h\"\n\nnamespace {\n\n\/\/ TODO(avi): Use this mapping to auto-generate MCX manifests and Windows\n\/\/ ADM\/ADMX files. http:\/\/crbug.com\/49316\n\nstruct InternalPolicyValueMapEntry {\n  ConfigurationPolicyStore::PolicyType policy_type;\n  Value::ValueType value_type;\n  const char* name;\n};\n\nconst InternalPolicyValueMapEntry kPolicyValueMap[] = {\n  { ConfigurationPolicyStore::kPolicyHomePage,\n      Value::TYPE_STRING, \"HomepageLocation\" },\n  { ConfigurationPolicyStore::kPolicyHomepageIsNewTabPage,\n      Value::TYPE_BOOLEAN, \"HomepageIsNewTabPage\" },\n  { ConfigurationPolicyStore::kPolicyProxyServerMode,\n      Value::TYPE_INTEGER, \"ProxyServerMode\" },\n  { ConfigurationPolicyStore::kPolicyProxyServer,\n      Value::TYPE_STRING, \"ProxyServer\" },\n  { ConfigurationPolicyStore::kPolicyProxyPacUrl,\n      Value::TYPE_STRING, \"ProxyPacUrl\" },\n  { ConfigurationPolicyStore::kPolicyProxyBypassList,\n       Value::TYPE_STRING, \"ProxyBypassList\" },\n  { ConfigurationPolicyStore::kPolicyAlternateErrorPagesEnabled,\n      Value::TYPE_BOOLEAN, \"AlternateErrorPagesEnabled\" },\n  { ConfigurationPolicyStore::kPolicySearchSuggestEnabled,\n      Value::TYPE_BOOLEAN, \"SearchSuggestEnabled\" },\n  { ConfigurationPolicyStore::kPolicyDnsPrefetchingEnabled,\n      Value::TYPE_BOOLEAN, \"DnsPrefetchingEnabled\" },\n  { ConfigurationPolicyStore::kPolicySafeBrowsingEnabled,\n      Value::TYPE_BOOLEAN, \"SafeBrowsingEnabled\" },\n  { ConfigurationPolicyStore::kPolicyMetricsReportingEnabled,\n      Value::TYPE_BOOLEAN, \"MetricsReportingEnabled\" },\n  { ConfigurationPolicyStore::kPolicyPasswordManagerEnabled,\n      Value::TYPE_BOOLEAN, \"PasswordManagerEnabled\" },\n  { ConfigurationPolicyStore::kPolicyDisabledPlugins,\n      Value::TYPE_STRING, \"DisabledPluginsList\" },\n  { ConfigurationPolicyStore::kPolicyApplicationLocale,\r\n      Value::TYPE_STRING, \"ApplicationLocaleValue\" },\n  { ConfigurationPolicyStore::kPolicySyncDisabled,\n      Value::TYPE_BOOLEAN, \"SyncDisabled\" },\n};\n\n}  \/\/ namespace\n\n\/* static *\/\nconst ConfigurationPolicyProvider::PolicyValueMap*\n    ConfigurationPolicyProvider::PolicyValueMapping() {\n  static PolicyValueMap* mapping;\n  if (!mapping) {\n    mapping = new PolicyValueMap();\n    for (size_t i = 0; i < arraysize(kPolicyValueMap); ++i) {\n      const InternalPolicyValueMapEntry& internal_entry = kPolicyValueMap[i];\n      PolicyValueMapEntry entry;\n      entry.policy_type = internal_entry.policy_type;\n      entry.value_type = internal_entry.value_type;\n      entry.name = std::string(internal_entry.name);\n      mapping->push_back(entry);\n    }\n  }\n  return mapping;\n}\n<commit_msg>Fix wrong line ending.<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\/configuration_policy_provider.h\"\n\n#include \"base\/values.h\"\n\nnamespace {\n\n\/\/ TODO(avi): Use this mapping to auto-generate MCX manifests and Windows\n\/\/ ADM\/ADMX files. http:\/\/crbug.com\/49316\n\nstruct InternalPolicyValueMapEntry {\n  ConfigurationPolicyStore::PolicyType policy_type;\n  Value::ValueType value_type;\n  const char* name;\n};\n\nconst InternalPolicyValueMapEntry kPolicyValueMap[] = {\n  { ConfigurationPolicyStore::kPolicyHomePage,\n      Value::TYPE_STRING, \"HomepageLocation\" },\n  { ConfigurationPolicyStore::kPolicyHomepageIsNewTabPage,\n      Value::TYPE_BOOLEAN, \"HomepageIsNewTabPage\" },\n  { ConfigurationPolicyStore::kPolicyProxyServerMode,\n      Value::TYPE_INTEGER, \"ProxyServerMode\" },\n  { ConfigurationPolicyStore::kPolicyProxyServer,\n      Value::TYPE_STRING, \"ProxyServer\" },\n  { ConfigurationPolicyStore::kPolicyProxyPacUrl,\n      Value::TYPE_STRING, \"ProxyPacUrl\" },\n  { ConfigurationPolicyStore::kPolicyProxyBypassList,\n       Value::TYPE_STRING, \"ProxyBypassList\" },\n  { ConfigurationPolicyStore::kPolicyAlternateErrorPagesEnabled,\n      Value::TYPE_BOOLEAN, \"AlternateErrorPagesEnabled\" },\n  { ConfigurationPolicyStore::kPolicySearchSuggestEnabled,\n      Value::TYPE_BOOLEAN, \"SearchSuggestEnabled\" },\n  { ConfigurationPolicyStore::kPolicyDnsPrefetchingEnabled,\n      Value::TYPE_BOOLEAN, \"DnsPrefetchingEnabled\" },\n  { ConfigurationPolicyStore::kPolicySafeBrowsingEnabled,\n      Value::TYPE_BOOLEAN, \"SafeBrowsingEnabled\" },\n  { ConfigurationPolicyStore::kPolicyMetricsReportingEnabled,\n      Value::TYPE_BOOLEAN, \"MetricsReportingEnabled\" },\n  { ConfigurationPolicyStore::kPolicyPasswordManagerEnabled,\n      Value::TYPE_BOOLEAN, \"PasswordManagerEnabled\" },\n  { ConfigurationPolicyStore::kPolicyDisabledPlugins,\n      Value::TYPE_STRING, \"DisabledPluginsList\" },\n  { ConfigurationPolicyStore::kPolicyApplicationLocale,\n      Value::TYPE_STRING, \"ApplicationLocaleValue\" },\n  { ConfigurationPolicyStore::kPolicySyncDisabled,\n      Value::TYPE_BOOLEAN, \"SyncDisabled\" },\n};\n\n}  \/\/ namespace\n\n\/* static *\/\nconst ConfigurationPolicyProvider::PolicyValueMap*\n    ConfigurationPolicyProvider::PolicyValueMapping() {\n  static PolicyValueMap* mapping;\n  if (!mapping) {\n    mapping = new PolicyValueMap();\n    for (size_t i = 0; i < arraysize(kPolicyValueMap); ++i) {\n      const InternalPolicyValueMapEntry& internal_entry = kPolicyValueMap[i];\n      PolicyValueMapEntry entry;\n      entry.policy_type = internal_entry.policy_type;\n      entry.value_type = internal_entry.value_type;\n      entry.name = std::string(internal_entry.name);\n      mapping->push_back(entry);\n    }\n  }\n  return mapping;\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\/testkit\/test_kit.h>\n#include <vespa\/config\/config.h>\n#include <vespa\/config\/raw\/rawsource.h>\n#include <vespa\/config\/common\/misc.h>\n#include <vespa\/config\/common\/configrequest.h>\n#include <vespa\/config\/common\/timingvalues.h>\n#include <vespa\/config\/common\/trace.h>\n#include <vespa\/config\/frt\/frtconfigagent.h>\n#include <config-my.h>\n\nusing namespace config;\n\nclass MyConfigRequest : public ConfigRequest\n{\npublic:\n    MyConfigRequest(const ConfigKey & key)\n        : _key(key)\n    { }\n\n    const ConfigKey & getKey() const override { return _key; }\n    bool abort() override { return false; }\n    bool isAborted() const override { return false; }\n    void setError(int errorCode) override { (void) errorCode; }\n    const ConfigKey _key;\n};\n\nclass MyConfigResponse : public ConfigResponse\n{\npublic:\n    MyConfigResponse(const ConfigKey & key, const ConfigValue & value, bool isUpdated, bool valid,\n                     int64_t timestamp, const vespalib::string & md5, const std::string & errorMsg, int errorC0de, bool iserror)\n        : _key(key),\n          _value(value),\n          _isUpdated(isUpdated),\n          _fillCalled(false),\n          _valid(valid),\n          _state(md5, timestamp),\n          _errorMessage(errorMsg),\n          _errorCode(errorC0de),\n          _isError(iserror)\n    { }\n\n    const ConfigKey& getKey() const override { return _key; }\n    const ConfigValue & getValue() const override { return _value; }\n    const ConfigState & getConfigState() const override { return _state; }\n    bool hasValidResponse() const override { return _valid; }\n    bool validateResponse() override { return _valid; }\n    void fill() override { _fillCalled = true; }\n    vespalib::string errorMessage() const override { return _errorMessage; }\n    int errorCode() const override { return _errorCode; }\n    bool isError() const override { return  _isError; }\n    const Trace & getTrace() const override { return _trace; }\n\n    const ConfigKey _key;\n    const ConfigValue _value;\n    bool _isUpdated;\n    bool _fillCalled;\n    bool _valid;\n    const ConfigState _state;\n    vespalib::string _errorMessage;\n    int _errorCode;\n    bool _isError;\n    Trace _trace;\n\n\n\/**\n    MyConfigResponse(const ConfigKey & key, const ConfigValue & value, bool isUpdated, bool valid,\n                     int64_t timestamp, const vespalib::string & md5, int64_t prevTimestamp, const vespalib::string &prevMd5,\n                     const std::string & errorMsg, int errorC0de, bool iserror)\n*\/\n    static ConfigResponse::UP createOKResponse(const ConfigKey & key, const ConfigValue & value)\n    {\n        return ConfigResponse::UP(new MyConfigResponse(key, value, true, true, 10, \"a\", \"\", 0, false));\n    }\n\n    static ConfigResponse::UP createServerErrorResponse(const ConfigKey & key, const ConfigValue & value)\n    {\n        return ConfigResponse::UP(new MyConfigResponse(key, value, false, true, 10, \"a\", \"whinewhine\", 2, true));\n    }\n\n    static ConfigResponse::UP createConfigErrorResponse(const ConfigKey & key, const ConfigValue & value)\n    {\n        return ConfigResponse::UP(new MyConfigResponse(key, value, false, false, 10, \"a\", \"\", 0, false));\n    }\n};\n\nclass MyHolder : public IConfigHolder\n{\npublic:\n    MyHolder()\n        : _update()\n    {\n    }\n\n    std::unique_ptr<ConfigUpdate> provide() override\n    {\n        return std::move(_update);\n    }\n\n    bool wait(uint64_t timeout) override\n    {\n        (void) timeout;\n        return true;\n    }\n\n    void handle(std::unique_ptr<ConfigUpdate> update) override\n    {\n        _update = std::move(update);\n    }\n\n    bool poll() override { return true; }\n    void interrupt() override { }\nprivate:\n    std::unique_ptr<ConfigUpdate> _update;\n};\n\n\nConfigValue createValue(const std::string & myField, const std::string & md5)\n{\n    std::vector< vespalib::string > lines;\n    lines.push_back(\"myField \\\"\" + myField + \"\\\"\");\n    return ConfigValue(lines, md5);\n}\n\nstatic TimingValues testTimingValues(\n        2000,  \/\/ successTimeout\n        500,  \/\/ errorTimeout\n        500,   \/\/ initialTimeout\n        4000,  \/\/ subscribeTimeout\n        0,     \/\/ fixedDelay\n        250,   \/\/ successDelay\n        250,   \/\/ unconfiguredDelay\n        500,   \/\/ configuredErrorDelay\n        5,\n        1000,\n        2000);    \/\/ maxDelayMultiplier\n\nTEST(\"require that agent returns correct values\") {\n    FRTConfigAgent handler(IConfigHolder::SP(new MyHolder()), testTimingValues);\n    ASSERT_EQUAL(500u, handler.getTimeout());\n    ASSERT_EQUAL(0u, handler.getWaitTime());\n    ConfigState cs;\n    ASSERT_EQUAL(cs.md5, handler.getConfigState().md5);\n    ASSERT_EQUAL(cs.generation, handler.getConfigState().generation);\n}\n\nTEST(\"require that successful request is delivered to holder\") {\n    const ConfigKey testKey(ConfigKey::create<MyConfig>(\"mykey\"));\n    const ConfigValue testValue(createValue(\"l33t\", \"a\"));\n    IConfigHolder::SP latch(new MyHolder());\n\n    FRTConfigAgent handler(latch, testTimingValues);\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createOKResponse(testKey, testValue));\n    ASSERT_TRUE(latch->poll());\n    ConfigUpdate::UP update(latch->provide());\n    ASSERT_TRUE(update.get() != NULL);\n    ASSERT_TRUE(update->hasChanged());\n    MyConfig cfg(update->getValue());\n    ASSERT_EQUAL(\"l33t\", cfg.myField);\n}\n\nTEST(\"require that successful request sets correct wait time\") {\n    const ConfigKey testKey(ConfigKey::create<MyConfig>(\"mykey\"));\n    const ConfigValue testValue(createValue(\"l33t\", \"a\"));\n    IConfigHolder::SP latch(new MyHolder());\n    FRTConfigAgent handler(latch, testTimingValues);\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createOKResponse(testKey, testValue));\n    ASSERT_EQUAL(250u, handler.getWaitTime());\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createOKResponse(testKey, testValue));\n    ASSERT_EQUAL(250u, handler.getWaitTime());\n}\n\nTEST(\"require that bad config response returns false\") {\n    const ConfigKey testKey(ConfigKey::create<MyConfig>(\"mykey\"));\n    const ConfigValue testValue(createValue(\"myval\", \"a\"));\n    IConfigHolder::SP latch(new MyHolder());\n    FRTConfigAgent handler(latch, testTimingValues);\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createConfigErrorResponse(testKey, testValue));\n    ASSERT_EQUAL(250u, handler.getWaitTime());\n    ASSERT_EQUAL(500u, handler.getTimeout());\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createConfigErrorResponse(testKey, testValue));\n    ASSERT_EQUAL(500u, handler.getWaitTime());\n    ASSERT_EQUAL(500u, handler.getTimeout());\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createConfigErrorResponse(testKey, testValue));\n    ASSERT_EQUAL(750u, handler.getWaitTime());\n    ASSERT_EQUAL(500u, handler.getTimeout());\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createConfigErrorResponse(testKey, testValue));\n    ASSERT_EQUAL(1000u, handler.getWaitTime());\n    ASSERT_EQUAL(500u, handler.getTimeout());\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createConfigErrorResponse(testKey, testValue));\n    ASSERT_EQUAL(1250u, handler.getWaitTime());\n    ASSERT_EQUAL(500u, handler.getTimeout());\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createConfigErrorResponse(testKey, testValue));\n    ASSERT_EQUAL(1250u, handler.getWaitTime());\n    ASSERT_EQUAL(500u, handler.getTimeout());\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createOKResponse(testKey, testValue));\n    ASSERT_EQUAL(250u, handler.getWaitTime());\n    ASSERT_EQUAL(2000u, handler.getTimeout());\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createConfigErrorResponse(testKey, testValue));\n    ASSERT_EQUAL(500u, handler.getWaitTime());\n    ASSERT_EQUAL(500u, handler.getTimeout());\n}\n\nTEST(\"require that bad response returns false\") {\n    const ConfigKey testKey(ConfigKey::create<MyConfig>(\"mykey\"));\n    std::vector<vespalib::string> lines;\n    const ConfigValue testValue(lines, \"a\");\n\n    IConfigHolder::SP latch(new MyHolder());\n    FRTConfigAgent handler(latch, testTimingValues);\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createServerErrorResponse(testKey, testValue));\n    ASSERT_EQUAL(250u, handler.getWaitTime());\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createServerErrorResponse(testKey, testValue));\n    ASSERT_EQUAL(500u, handler.getWaitTime());\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createServerErrorResponse(testKey, testValue));\n    ASSERT_EQUAL(750u, handler.getWaitTime());\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createServerErrorResponse(testKey, testValue));\n    ASSERT_EQUAL(1000u, handler.getWaitTime());\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createServerErrorResponse(testKey, testValue));\n    ASSERT_EQUAL(1250u, handler.getWaitTime());\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createServerErrorResponse(testKey, testValue));\n    ASSERT_EQUAL(1250u, handler.getWaitTime());\n}\n\nTEST_MAIN() { TEST_RUN_ALL(); }\n<commit_msg>Add a test proving that we can loose a config change.<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\/testkit\/test_kit.h>\n#include <vespa\/config\/config.h>\n#include <vespa\/config\/raw\/rawsource.h>\n#include <vespa\/config\/common\/misc.h>\n#include <vespa\/config\/common\/configrequest.h>\n#include <vespa\/config\/common\/timingvalues.h>\n#include <vespa\/config\/common\/trace.h>\n#include <vespa\/config\/frt\/frtconfigagent.h>\n#include <config-my.h>\n\nusing namespace config;\n\nclass MyConfigRequest : public ConfigRequest\n{\npublic:\n    MyConfigRequest(const ConfigKey & key)\n        : _key(key)\n    { }\n\n    const ConfigKey & getKey() const override { return _key; }\n    bool abort() override { return false; }\n    bool isAborted() const override { return false; }\n    void setError(int errorCode) override { (void) errorCode; }\n    const ConfigKey _key;\n};\n\nclass MyConfigResponse : public ConfigResponse\n{\npublic:\n    MyConfigResponse(const ConfigKey & key, const ConfigValue & value, bool valid, int64_t timestamp,\n                     const vespalib::string & md5, const std::string & errorMsg, int errorC0de, bool iserror)\n        : _key(key),\n          _value(value),\n          _fillCalled(false),\n          _valid(valid),\n          _state(md5, timestamp),\n          _errorMessage(errorMsg),\n          _errorCode(errorC0de),\n          _isError(iserror)\n    { }\n\n    const ConfigKey& getKey() const override { return _key; }\n    const ConfigValue & getValue() const override { return _value; }\n    const ConfigState & getConfigState() const override { return _state; }\n    bool hasValidResponse() const override { return _valid; }\n    bool validateResponse() override { return _valid; }\n    void fill() override { _fillCalled = true; }\n    vespalib::string errorMessage() const override { return _errorMessage; }\n    int errorCode() const override { return _errorCode; }\n    bool isError() const override { return  _isError; }\n    const Trace & getTrace() const override { return _trace; }\n\n    const ConfigKey _key;\n    const ConfigValue _value;\n    bool _fillCalled;\n    bool _valid;\n    const ConfigState _state;\n    vespalib::string _errorMessage;\n    int _errorCode;\n    bool _isError;\n    Trace _trace;\n\n\n    static ConfigResponse::UP createOKResponse(const ConfigKey & key, const ConfigValue & value, uint64_t timestamp = 10, const vespalib::string & md5 = \"a\")\n    {\n        return ConfigResponse::UP(new MyConfigResponse(key, value, true, timestamp, md5, \"\", 0, false));\n    }\n\n    static ConfigResponse::UP createServerErrorResponse(const ConfigKey & key, const ConfigValue & value)\n    {\n        return ConfigResponse::UP(new MyConfigResponse(key, value, true, 10, \"a\", \"whinewhine\", 2, true));\n    }\n\n    static ConfigResponse::UP createConfigErrorResponse(const ConfigKey & key, const ConfigValue & value)\n    {\n        return ConfigResponse::UP(new MyConfigResponse(key, value, false, 10, \"a\", \"\", 0, false));\n    }\n};\n\nclass MyHolder : public IConfigHolder\n{\npublic:\n    MyHolder()\n        : _update()\n    {\n    }\n\n    std::unique_ptr<ConfigUpdate> provide() override\n    {\n        return std::move(_update);\n    }\n\n    bool wait(uint64_t timeout) override\n    {\n        (void) timeout;\n        return true;\n    }\n\n    void handle(std::unique_ptr<ConfigUpdate> update) override\n    {\n        _update = std::move(update);\n    }\n\n    bool poll() override { return true; }\n    void interrupt() override { }\nprivate:\n    std::unique_ptr<ConfigUpdate> _update;\n};\n\n\nConfigValue createValue(const std::string & myField, const std::string & md5)\n{\n    std::vector< vespalib::string > lines;\n    lines.push_back(\"myField \\\"\" + myField + \"\\\"\");\n    return ConfigValue(lines, md5);\n}\n\nstatic TimingValues testTimingValues(\n        2000,  \/\/ successTimeout\n        500,  \/\/ errorTimeout\n        500,   \/\/ initialTimeout\n        4000,  \/\/ subscribeTimeout\n        0,     \/\/ fixedDelay\n        250,   \/\/ successDelay\n        250,   \/\/ unconfiguredDelay\n        500,   \/\/ configuredErrorDelay\n        5,\n        1000,\n        2000);    \/\/ maxDelayMultiplier\n\nTEST(\"require that agent returns correct values\") {\n    FRTConfigAgent handler(IConfigHolder::SP(new MyHolder()), testTimingValues);\n    ASSERT_EQUAL(500u, handler.getTimeout());\n    ASSERT_EQUAL(0u, handler.getWaitTime());\n    ConfigState cs;\n    ASSERT_EQUAL(cs.md5, handler.getConfigState().md5);\n    ASSERT_EQUAL(cs.generation, handler.getConfigState().generation);\n}\n\nTEST(\"require that successful request is delivered to holder\") {\n    const ConfigKey testKey(ConfigKey::create<MyConfig>(\"mykey\"));\n    const ConfigValue testValue(createValue(\"l33t\", \"a\"));\n    IConfigHolder::SP latch(new MyHolder());\n\n    FRTConfigAgent handler(latch, testTimingValues);\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createOKResponse(testKey, testValue));\n    ASSERT_TRUE(latch->poll());\n    ConfigUpdate::UP update(latch->provide());\n    ASSERT_TRUE(update);\n    ASSERT_TRUE(update->hasChanged());\n    MyConfig cfg(update->getValue());\n    ASSERT_EQUAL(\"l33t\", cfg.myField);\n}\n\nTEST(\"require that important(the change) request is delivered to holder even if it was not the last\") {\n    const ConfigKey testKey(ConfigKey::create<MyConfig>(\"mykey\"));\n    const ConfigValue testValue1(createValue(\"l33t\", \"a\"));\n    const ConfigValue testValue2(createValue(\"l34t\", \"b\"));\n    IConfigHolder::SP latch(new MyHolder());\n\n    FRTConfigAgent handler(latch, testTimingValues);\n    handler.handleResponse(MyConfigRequest(testKey),\n                           MyConfigResponse::createOKResponse(testKey, testValue1, 1, testValue1.getMd5()));\n    ASSERT_TRUE(latch->poll());\n    ConfigUpdate::UP update(latch->provide());\n    ASSERT_TRUE(update);\n    ASSERT_TRUE(update->hasChanged());\n    MyConfig cfg(update->getValue());\n    ASSERT_EQUAL(\"l33t\", cfg.myField);\n\n    handler.handleResponse(MyConfigRequest(testKey),\n                           MyConfigResponse::createOKResponse(testKey, testValue2, 2, testValue2.getMd5()));\n    handler.handleResponse(MyConfigRequest(testKey),\n                           MyConfigResponse::createOKResponse(testKey, testValue2, 3, testValue2.getMd5()));\n    ASSERT_TRUE(latch->poll());\n    update = latch->provide();\n    ASSERT_TRUE(update);\n    ASSERT_FALSE(update->hasChanged());  \/\/ This is a bug. We are loosing the change on generation 1->2\n    MyConfig cfg2(update->getValue());\n    ASSERT_EQUAL(\"l34t\", cfg2.myField);\n}\n\nTEST(\"require that successful request sets correct wait time\") {\n    const ConfigKey testKey(ConfigKey::create<MyConfig>(\"mykey\"));\n    const ConfigValue testValue(createValue(\"l33t\", \"a\"));\n    IConfigHolder::SP latch(new MyHolder());\n    FRTConfigAgent handler(latch, testTimingValues);\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createOKResponse(testKey, testValue));\n    ASSERT_EQUAL(250u, handler.getWaitTime());\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createOKResponse(testKey, testValue));\n    ASSERT_EQUAL(250u, handler.getWaitTime());\n}\n\nTEST(\"require that bad config response returns false\") {\n    const ConfigKey testKey(ConfigKey::create<MyConfig>(\"mykey\"));\n    const ConfigValue testValue(createValue(\"myval\", \"a\"));\n    IConfigHolder::SP latch(new MyHolder());\n    FRTConfigAgent handler(latch, testTimingValues);\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createConfigErrorResponse(testKey, testValue));\n    ASSERT_EQUAL(250u, handler.getWaitTime());\n    ASSERT_EQUAL(500u, handler.getTimeout());\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createConfigErrorResponse(testKey, testValue));\n    ASSERT_EQUAL(500u, handler.getWaitTime());\n    ASSERT_EQUAL(500u, handler.getTimeout());\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createConfigErrorResponse(testKey, testValue));\n    ASSERT_EQUAL(750u, handler.getWaitTime());\n    ASSERT_EQUAL(500u, handler.getTimeout());\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createConfigErrorResponse(testKey, testValue));\n    ASSERT_EQUAL(1000u, handler.getWaitTime());\n    ASSERT_EQUAL(500u, handler.getTimeout());\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createConfigErrorResponse(testKey, testValue));\n    ASSERT_EQUAL(1250u, handler.getWaitTime());\n    ASSERT_EQUAL(500u, handler.getTimeout());\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createConfigErrorResponse(testKey, testValue));\n    ASSERT_EQUAL(1250u, handler.getWaitTime());\n    ASSERT_EQUAL(500u, handler.getTimeout());\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createOKResponse(testKey, testValue));\n    ASSERT_EQUAL(250u, handler.getWaitTime());\n    ASSERT_EQUAL(2000u, handler.getTimeout());\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createConfigErrorResponse(testKey, testValue));\n    ASSERT_EQUAL(500u, handler.getWaitTime());\n    ASSERT_EQUAL(500u, handler.getTimeout());\n}\n\nTEST(\"require that bad response returns false\") {\n    const ConfigKey testKey(ConfigKey::create<MyConfig>(\"mykey\"));\n    std::vector<vespalib::string> lines;\n    const ConfigValue testValue(lines, \"a\");\n\n    IConfigHolder::SP latch(new MyHolder());\n    FRTConfigAgent handler(latch, testTimingValues);\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createServerErrorResponse(testKey, testValue));\n    ASSERT_EQUAL(250u, handler.getWaitTime());\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createServerErrorResponse(testKey, testValue));\n    ASSERT_EQUAL(500u, handler.getWaitTime());\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createServerErrorResponse(testKey, testValue));\n    ASSERT_EQUAL(750u, handler.getWaitTime());\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createServerErrorResponse(testKey, testValue));\n    ASSERT_EQUAL(1000u, handler.getWaitTime());\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createServerErrorResponse(testKey, testValue));\n    ASSERT_EQUAL(1250u, handler.getWaitTime());\n\n    handler.handleResponse(MyConfigRequest(testKey), MyConfigResponse::createServerErrorResponse(testKey, testValue));\n    ASSERT_EQUAL(1250u, handler.getWaitTime());\n}\n\nTEST_MAIN() { TEST_RUN_ALL(); }\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: ACatalog.cxx,v $\n *\n *  $Revision: 1.12 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 02:10: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_connectivity.hxx\"\n\n#ifndef _CONNECTIVITY_ADO_CATALOG_HXX_\n#include \"ado\/ACatalog.hxx\"\n#endif\n#ifndef _CONNECTIVITY_ADO_BCONNECTION_HXX_\n#include \"ado\/AConnection.hxx\"\n#endif\n#ifndef _CONNECTIVITY_ADO_GROUPS_HXX_\n#include \"ado\/AGroups.hxx\"\n#endif\n#ifndef _CONNECTIVITY_ADO_USERS_HXX_\n#include \"ado\/AUsers.hxx\"\n#endif\n#ifndef _CONNECTIVITY_ADO_TABLES_HXX_\n#include \"ado\/ATables.hxx\"\n#endif\n#ifndef _CONNECTIVITY_ADO_VIEWS_HXX_\n#include \"ado\/AViews.hxx\"\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_XRESULTSET_HPP_\n#include <com\/sun\/star\/sdbc\/XResultSet.hpp>\n#endif\n\n\n\/\/ -------------------------------------------------------------------------\nusing namespace connectivity;\nusing namespace connectivity::ado;\n\/\/ -------------------------------------------------------------------------\nOCatalog::OCatalog(_ADOCatalog* _pCatalog,OConnection* _pCon) : connectivity::sdbcx::OCatalog(_pCon)\n                ,m_pConnection(_pCon)\n                ,m_aCatalog(_pCatalog)\n{\n}\n\/\/ -----------------------------------------------------------------------------\nOCatalog::~OCatalog()\n{\n    if(m_aCatalog.IsValid())\n        m_aCatalog.putref_ActiveConnection(NULL);\n    m_aCatalog.clear();\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OCatalog::refreshTables()\n{\n    TStringVector aVector;\n\n    WpADOTables aTables(m_aCatalog.get_Tables());\n  if ( aTables.IsValid() )\n  {\n    aTables.Refresh();\n    sal_Int32 nCount = aTables.GetItemCount();\n    aVector.reserve(nCount);\n    for(sal_Int32 i=0;i< nCount;++i)\n    {\n        WpADOTable aElement = aTables.GetItem(i);\n          if ( aElement.IsValid() )\n          {\n              ::rtl::OUString sTypeName = aElement.get_Type();\n                  if ( !sTypeName.equalsIgnoreAsciiCaseAscii(\"SYSTEM TABLE\") && !sTypeName.equalsIgnoreAsciiCaseAscii(\"ACCESS TABLE\") )\n                     aVector.push_back(aElement.get_Name());\n               }\n         }\n     }\n\n    if(m_pTables)\n        m_pTables->reFill(aVector);\n    else\n        m_pTables = new OTables(this,m_aMutex,aVector,aTables,m_pConnection->getMetaData()->storesMixedCaseQuotedIdentifiers());\n}\n\/\/ -------------------------------------------------------------------------\nvoid OCatalog::refreshViews()\n{\n    TStringVector aVector;\n\n    WpADOViews aViews = m_aCatalog.get_Views();\n    aViews.fillElementNames(aVector);\n\n    if(m_pViews)\n        m_pViews->reFill(aVector);\n    else\n        m_pViews = new OViews(this,m_aMutex,aVector,aViews,m_pConnection->getMetaData()->storesMixedCaseQuotedIdentifiers());\n}\n\/\/ -------------------------------------------------------------------------\nvoid OCatalog::refreshGroups()\n{\n    TStringVector aVector;\n\n    WpADOGroups aGroups = m_aCatalog.get_Groups();\n    aGroups.fillElementNames(aVector);\n\n    if(m_pGroups)\n        m_pGroups->reFill(aVector);\n    else\n        m_pGroups = new OGroups(this,m_aMutex,aVector,aGroups,m_pConnection->getMetaData()->storesMixedCaseQuotedIdentifiers());\n}\n\/\/ -------------------------------------------------------------------------\nvoid OCatalog::refreshUsers()\n{\n    TStringVector aVector;\n\n    WpADOUsers aUsers = m_aCatalog.get_Users();\n    aUsers.fillElementNames(aVector);\n\n    if(m_pUsers)\n        m_pUsers->reFill(aVector);\n    else\n        m_pUsers = new OUsers(this,m_aMutex,aVector,aUsers,m_pConnection->getMetaData()->storesMixedCaseQuotedIdentifiers());\n}\n\/\/ -------------------------------------------------------------------------\n\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.12.216); FILE MERGED 2008\/04\/01 10:52:48 thb 1.12.216.2: #i85898# Stripping all external header guards 2008\/03\/28 15:23:25 rt 1.12.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: ACatalog.cxx,v $\n * $Revision: 1.13 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org.  If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_connectivity.hxx\"\n#include \"ado\/ACatalog.hxx\"\n#ifndef _CONNECTIVITY_ADO_BCONNECTION_HXX_\n#include \"ado\/AConnection.hxx\"\n#endif\n#include \"ado\/AGroups.hxx\"\n#include \"ado\/AUsers.hxx\"\n#include \"ado\/ATables.hxx\"\n#include \"ado\/AViews.hxx\"\n#include <com\/sun\/star\/sdbc\/XRow.hpp>\n#include <com\/sun\/star\/sdbc\/XResultSet.hpp>\n\n\n\/\/ -------------------------------------------------------------------------\nusing namespace connectivity;\nusing namespace connectivity::ado;\n\/\/ -------------------------------------------------------------------------\nOCatalog::OCatalog(_ADOCatalog* _pCatalog,OConnection* _pCon) : connectivity::sdbcx::OCatalog(_pCon)\n                ,m_pConnection(_pCon)\n                ,m_aCatalog(_pCatalog)\n{\n}\n\/\/ -----------------------------------------------------------------------------\nOCatalog::~OCatalog()\n{\n    if(m_aCatalog.IsValid())\n        m_aCatalog.putref_ActiveConnection(NULL);\n    m_aCatalog.clear();\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OCatalog::refreshTables()\n{\n    TStringVector aVector;\n\n    WpADOTables aTables(m_aCatalog.get_Tables());\n  if ( aTables.IsValid() )\n  {\n    aTables.Refresh();\n    sal_Int32 nCount = aTables.GetItemCount();\n    aVector.reserve(nCount);\n    for(sal_Int32 i=0;i< nCount;++i)\n    {\n        WpADOTable aElement = aTables.GetItem(i);\n          if ( aElement.IsValid() )\n          {\n              ::rtl::OUString sTypeName = aElement.get_Type();\n                  if ( !sTypeName.equalsIgnoreAsciiCaseAscii(\"SYSTEM TABLE\") && !sTypeName.equalsIgnoreAsciiCaseAscii(\"ACCESS TABLE\") )\n                     aVector.push_back(aElement.get_Name());\n               }\n         }\n     }\n\n    if(m_pTables)\n        m_pTables->reFill(aVector);\n    else\n        m_pTables = new OTables(this,m_aMutex,aVector,aTables,m_pConnection->getMetaData()->storesMixedCaseQuotedIdentifiers());\n}\n\/\/ -------------------------------------------------------------------------\nvoid OCatalog::refreshViews()\n{\n    TStringVector aVector;\n\n    WpADOViews aViews = m_aCatalog.get_Views();\n    aViews.fillElementNames(aVector);\n\n    if(m_pViews)\n        m_pViews->reFill(aVector);\n    else\n        m_pViews = new OViews(this,m_aMutex,aVector,aViews,m_pConnection->getMetaData()->storesMixedCaseQuotedIdentifiers());\n}\n\/\/ -------------------------------------------------------------------------\nvoid OCatalog::refreshGroups()\n{\n    TStringVector aVector;\n\n    WpADOGroups aGroups = m_aCatalog.get_Groups();\n    aGroups.fillElementNames(aVector);\n\n    if(m_pGroups)\n        m_pGroups->reFill(aVector);\n    else\n        m_pGroups = new OGroups(this,m_aMutex,aVector,aGroups,m_pConnection->getMetaData()->storesMixedCaseQuotedIdentifiers());\n}\n\/\/ -------------------------------------------------------------------------\nvoid OCatalog::refreshUsers()\n{\n    TStringVector aVector;\n\n    WpADOUsers aUsers = m_aCatalog.get_Users();\n    aUsers.fillElementNames(aVector);\n\n    if(m_pUsers)\n        m_pUsers->reFill(aVector);\n    else\n        m_pUsers = new OUsers(this,m_aMutex,aVector,aUsers,m_pConnection->getMetaData()->storesMixedCaseQuotedIdentifiers());\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 \"content\/common\/mojo\/service_registry_impl.h\"\n\n#include \"mojo\/common\/common_type_converters.h\"\n\nnamespace content {\n\nServiceRegistryImpl::ServiceRegistryImpl()\n    : binding_(this), weak_factory_(this) {\n  binding_.set_connection_error_handler(\n      base::Bind(&ServiceRegistryImpl::OnConnectionError,\n                 base::Unretained(this)));\n}\n\nServiceRegistryImpl::~ServiceRegistryImpl() {\n  while (!pending_connects_.empty()) {\n    mojo::CloseRaw(pending_connects_.front().second);\n    pending_connects_.pop();\n  }\n}\n\nvoid ServiceRegistryImpl::Bind(\n    mojo::InterfaceRequest<mojo::ServiceProvider> request) {\n  binding_.Bind(request.Pass());\n}\n\nvoid ServiceRegistryImpl::BindRemoteServiceProvider(\n    mojo::ServiceProviderPtr service_provider) {\n  CHECK(!remote_provider_);\n  remote_provider_ = service_provider.Pass();\n  while (!pending_connects_.empty()) {\n    remote_provider_->ConnectToService(\n        mojo::String::From(pending_connects_.front().first),\n        mojo::ScopedMessagePipeHandle(pending_connects_.front().second));\n    pending_connects_.pop();\n  }\n}\n\nvoid ServiceRegistryImpl::AddService(\n    const std::string& service_name,\n    const base::Callback<void(mojo::ScopedMessagePipeHandle)> service_factory) {\n  service_factories_[service_name] = service_factory;\n}\n\nvoid ServiceRegistryImpl::RemoveService(const std::string& service_name) {\n  service_factories_.erase(service_name);\n}\n\nvoid ServiceRegistryImpl::ConnectToRemoteService(\n    const base::StringPiece& service_name,\n    mojo::ScopedMessagePipeHandle handle) {\n  if (!remote_provider_) {\n    pending_connects_.push(\n        std::make_pair(service_name.as_string(), handle.release()));\n    return;\n  }\n  remote_provider_->ConnectToService(mojo::String::From(service_name),\n                                     handle.Pass());\n}\n\nbool ServiceRegistryImpl::IsBound() const {\n  return binding_.is_bound();\n}\n\nbase::WeakPtr<ServiceRegistry> ServiceRegistryImpl::GetWeakPtr() {\n  return weak_factory_.GetWeakPtr();\n}\n\nvoid ServiceRegistryImpl::ConnectToService(\n    const mojo::String& name,\n    mojo::ScopedMessagePipeHandle client_handle) {\n  std::map<std::string,\n           base::Callback<void(mojo::ScopedMessagePipeHandle)> >::iterator it =\n      service_factories_.find(name);\n  if (it == service_factories_.end())\n    return;\n\n  it->second.Run(client_handle.Pass());\n}\n\nvoid ServiceRegistryImpl::OnConnectionError() {\n  binding_.Close();\n}\n\n}  \/\/ namespace content\n<commit_msg>Reduce conversion template use for StringPiece.<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 \"content\/common\/mojo\/service_registry_impl.h\"\n\n#include \"mojo\/common\/common_type_converters.h\"\n\nnamespace content {\n\nServiceRegistryImpl::ServiceRegistryImpl()\n    : binding_(this), weak_factory_(this) {\n  binding_.set_connection_error_handler(\n      base::Bind(&ServiceRegistryImpl::OnConnectionError,\n                 base::Unretained(this)));\n}\n\nServiceRegistryImpl::~ServiceRegistryImpl() {\n  while (!pending_connects_.empty()) {\n    mojo::CloseRaw(pending_connects_.front().second);\n    pending_connects_.pop();\n  }\n}\n\nvoid ServiceRegistryImpl::Bind(\n    mojo::InterfaceRequest<mojo::ServiceProvider> request) {\n  binding_.Bind(request.Pass());\n}\n\nvoid ServiceRegistryImpl::BindRemoteServiceProvider(\n    mojo::ServiceProviderPtr service_provider) {\n  CHECK(!remote_provider_);\n  remote_provider_ = service_provider.Pass();\n  while (!pending_connects_.empty()) {\n    remote_provider_->ConnectToService(\n        mojo::String::From(pending_connects_.front().first),\n        mojo::ScopedMessagePipeHandle(pending_connects_.front().second));\n    pending_connects_.pop();\n  }\n}\n\nvoid ServiceRegistryImpl::AddService(\n    const std::string& service_name,\n    const base::Callback<void(mojo::ScopedMessagePipeHandle)> service_factory) {\n  service_factories_[service_name] = service_factory;\n}\n\nvoid ServiceRegistryImpl::RemoveService(const std::string& service_name) {\n  service_factories_.erase(service_name);\n}\n\nvoid ServiceRegistryImpl::ConnectToRemoteService(\n    const base::StringPiece& service_name,\n    mojo::ScopedMessagePipeHandle handle) {\n  if (!remote_provider_) {\n    pending_connects_.push(\n        std::make_pair(service_name.as_string(), handle.release()));\n    return;\n  }\n  remote_provider_->ConnectToService(\n      mojo::String::From(service_name.as_string()), handle.Pass());\n}\n\nbool ServiceRegistryImpl::IsBound() const {\n  return binding_.is_bound();\n}\n\nbase::WeakPtr<ServiceRegistry> ServiceRegistryImpl::GetWeakPtr() {\n  return weak_factory_.GetWeakPtr();\n}\n\nvoid ServiceRegistryImpl::ConnectToService(\n    const mojo::String& name,\n    mojo::ScopedMessagePipeHandle client_handle) {\n  std::map<std::string,\n           base::Callback<void(mojo::ScopedMessagePipeHandle)> >::iterator it =\n      service_factories_.find(name);\n  if (it == service_factories_.end())\n    return;\n\n  it->second.Run(client_handle.Pass());\n}\n\nvoid ServiceRegistryImpl::OnConnectionError() {\n  binding_.Close();\n}\n\n}  \/\/ namespace content\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"GasMeter.h\"\n\n#include <llvm\/IR\/GlobalVariable.h>\n#include <llvm\/IR\/Function.h>\n#include <llvm\/IR\/IntrinsicInst.h>\n\n#include \"Type.h\"\n#include \"Ext.h\"\n#include \"RuntimeManager.h\"\n\nnamespace dev\n{\nnamespace eth\n{\nnamespace jit\n{\n\nnamespace \/\/ Helper functions\n{\n\nuint64_t const c_stepGas = 1;\nuint64_t const c_balanceGas = 20;\nuint64_t const c_sha3Gas = 10;\nuint64_t const c_sha3WordGas = 10;\nuint64_t const c_sloadGas = 20;\nuint64_t const c_sstoreSetGas = 300;\nuint64_t const c_sstoreResetGas = 100;\nuint64_t const c_sstoreRefundGas = 100;\nuint64_t const c_createGas = 100;\nuint64_t const c_createDataGas = 5;\nuint64_t const c_callGas = 20;\nuint64_t const c_expGas = 1;\nuint64_t const c_expByteGas = 1;\nuint64_t const c_memoryGas = 1;\nuint64_t const c_txDataZeroGas = 1;\nuint64_t const c_txDataNonZeroGas = 5;\nuint64_t const c_txGas = 500;\nuint64_t const c_logGas = 32;\nuint64_t const c_logDataGas = 1;\nuint64_t const c_logTopicGas = 32;\nuint64_t const c_copyGas = 1;\n\nuint64_t getStepCost(Instruction inst)\n{\n\tswitch (inst)\n\t{\n\tdefault: \/\/ Assumes instruction code is valid\n\t\treturn c_stepGas;\n\n\tcase Instruction::STOP:\n\tcase Instruction::SUICIDE:\n\tcase Instruction::SSTORE: \/\/ Handle cost of SSTORE separately in GasMeter::countSStore()\n\t\treturn 0;\n\n\tcase Instruction::EXP:\t\treturn c_expGas;\n\n\tcase Instruction::SLOAD:\treturn c_sloadGas;\n\n\tcase Instruction::SHA3:\t\treturn c_sha3Gas;\n\n\tcase Instruction::BALANCE:\treturn c_balanceGas;\n\n\tcase Instruction::CALL:\n\tcase Instruction::CALLCODE:\treturn c_callGas;\n\n\tcase Instruction::CREATE:\treturn c_createGas;\n\n\tcase Instruction::LOG0:\n\tcase Instruction::LOG1:\n\tcase Instruction::LOG2:\n\tcase Instruction::LOG3:\n\tcase Instruction::LOG4:\n\t{\n\t\tauto numTopics = static_cast<uint64_t>(inst) - static_cast<uint64_t>(Instruction::LOG0);\n\t\treturn c_logGas + numTopics * c_logTopicGas;\n\t}\n\t}\n}\n\n}\n\nGasMeter::GasMeter(llvm::IRBuilder<>& _builder, RuntimeManager& _runtimeManager) :\n\tCompilerHelper(_builder),\n\tm_runtimeManager(_runtimeManager)\n{\n\tauto module = getModule();\n\n\tllvm::Type* gasCheckArgs[] = {Type::RuntimePtr, Type::Word};\n\tm_gasCheckFunc = llvm::Function::Create(llvm::FunctionType::get(Type::Void, gasCheckArgs, false), llvm::Function::PrivateLinkage, \"gas.check\", module);\n\tInsertPointGuard guard(m_builder);\n\n\tauto checkBB = llvm::BasicBlock::Create(_builder.getContext(), \"Check\", m_gasCheckFunc);\n\tauto outOfGasBB = llvm::BasicBlock::Create(_builder.getContext(), \"OutOfGas\", m_gasCheckFunc);\n\tauto updateBB = llvm::BasicBlock::Create(_builder.getContext(), \"Update\", m_gasCheckFunc);\n\n\tm_builder.SetInsertPoint(checkBB);\n\tauto arg = m_gasCheckFunc->arg_begin();\n\targ->setName(\"rt\");\n\t++arg;\n\targ->setName(\"cost\");\n\tauto cost = arg;\n\tauto gas = m_runtimeManager.getGas();\n\tauto isOutOfGas = m_builder.CreateICmpUGT(cost, gas, \"isOutOfGas\");\n\tm_builder.CreateCondBr(isOutOfGas, outOfGasBB, updateBB);\n\n\tm_builder.SetInsertPoint(outOfGasBB);\n\tm_runtimeManager.raiseException(ReturnCode::OutOfGas);\n\tm_builder.CreateUnreachable();\n\n\tm_builder.SetInsertPoint(updateBB);\n\tgas = m_builder.CreateSub(gas, cost);\n\tm_runtimeManager.setGas(gas);\n\tm_builder.CreateRetVoid();\n}\n\nvoid GasMeter::count(Instruction _inst)\n{\n\tif (!m_checkCall)\n\t{\n\t\t\/\/ Create gas check call with mocked block cost at begining of current cost-block\n\t\tm_checkCall = createCall(m_gasCheckFunc, {m_runtimeManager.getRuntimePtr(), llvm::UndefValue::get(Type::Word)});\n\t}\n\n\tm_blockCost += getStepCost(_inst);\n}\n\nvoid GasMeter::count(llvm::Value* _cost)\n{\n\tcreateCall(m_gasCheckFunc, {m_runtimeManager.getRuntimePtr(), _cost});\n}\n\nvoid GasMeter::countExp(llvm::Value* _exponent)\n{\n\t\/\/ Additional cost is 1 per significant byte of exponent\n\t\/\/ lz - leading zeros\n\t\/\/ cost = ((256 - lz) + 7) \/ 8\n\n\t\/\/ OPT: All calculations can be done on 32\/64 bits\n\n\tauto ctlz = llvm::Intrinsic::getDeclaration(getModule(), llvm::Intrinsic::ctlz, Type::Word);\n\tauto lz = m_builder.CreateCall2(ctlz, _exponent, m_builder.getInt1(false));\n\tauto sigBits = m_builder.CreateSub(Constant::get(256), lz);\n\tauto sigBytes = m_builder.CreateUDiv(m_builder.CreateAdd(sigBits, Constant::get(7)), Constant::get(8));\n\tcount(sigBytes);\n}\n\nvoid GasMeter::countSStore(Ext& _ext, llvm::Value* _index, llvm::Value* _newValue)\n{\n\tauto oldValue = _ext.sload(_index);\n\tauto oldValueIsZero = m_builder.CreateICmpEQ(oldValue, Constant::get(0), \"oldValueIsZero\");\n\tauto newValueIsZero = m_builder.CreateICmpEQ(_newValue, Constant::get(0), \"newValueIsZero\");\n\tauto oldValueIsntZero = m_builder.CreateICmpNE(oldValue, Constant::get(0), \"oldValueIsntZero\");\n\tauto newValueIsntZero = m_builder.CreateICmpNE(_newValue, Constant::get(0), \"newValueIsntZero\");\n\tauto isInsert = m_builder.CreateAnd(oldValueIsZero, newValueIsntZero, \"isInsert\");\n\tauto isDelete = m_builder.CreateAnd(oldValueIsntZero, newValueIsZero, \"isDelete\");\n\tauto cost = m_builder.CreateSelect(isInsert, Constant::get(c_sstoreSetGas), Constant::get(c_sstoreResetGas), \"cost\");\n\tcost = m_builder.CreateSelect(isDelete, Constant::get(0), cost, \"cost\");\n\tcount(cost);\n}\n\nvoid GasMeter::countLogData(llvm::Value* _dataLength)\n{\n\tassert(m_checkCall);\n\tassert(m_blockCost > 0); \/\/ LOGn instruction is already counted\n\tstatic_assert(c_logDataGas == 1, \"Log data gas cost has changed. Update GasMeter.\");\n\tcount(_dataLength);\n}\n\nvoid GasMeter::countSha3Data(llvm::Value* _dataLength)\n{\n\tassert(m_checkCall);\n\tassert(m_blockCost > 0); \/\/ SHA3 instruction is already counted\n\n\t\/\/ TODO: This round ups to 32 happens in many places\n\t\/\/ FIXME: Overflow possible but Memory::require() also called. Probably 64-bit arith can be used.\n\tstatic_assert(c_sha3WordGas != 1, \"SHA3 data cost has changed. Update GasMeter\");\n\tauto words = m_builder.CreateUDiv(m_builder.CreateAdd(_dataLength, Constant::get(31)), Constant::get(32));\n\tauto cost = m_builder.CreateNUWMul(Constant::get(c_sha3WordGas), words);\n\tcount(cost);\n}\n\nvoid GasMeter::giveBack(llvm::Value* _gas)\n{\n\tm_runtimeManager.setGas(m_builder.CreateAdd(m_runtimeManager.getGas(), _gas));\n}\n\nvoid GasMeter::commitCostBlock()\n{\n\t\/\/ If any uncommited block\n\tif (m_checkCall)\n\t{\n\t\tif (m_blockCost == 0) \/\/ Do not check 0\n\t\t{\n\t\t\tm_checkCall->eraseFromParent(); \/\/ Remove the gas check call\n\t\t\tm_checkCall = nullptr;\n\t\t\treturn;\n\t\t}\n\n\t\tm_checkCall->setArgOperand(1, Constant::get(m_blockCost)); \/\/ Update block cost in gas check call\n\t\tm_checkCall = nullptr; \/\/ End cost-block\n\t\tm_blockCost = 0;\n\t}\n\tassert(m_blockCost == 0);\n}\n\nvoid GasMeter::countMemory(llvm::Value* _additionalMemoryInWords)\n{\n\tstatic_assert(c_memoryGas == 1, \"Memory gas cost has changed. Update GasMeter.\");\n\tcount(_additionalMemoryInWords);\n}\n\nvoid GasMeter::countCopy(llvm::Value* _copyWords)\n{\n\tstatic_assert(c_copyGas == 1, \"Copy gas cost has changed. Update GasMeter.\");\n\tcount(_copyWords);\n}\n\n}\n}\n}\n\n<commit_msg>Compute SHA3 additional gas cost in 64-bit precision<commit_after>\n#include \"GasMeter.h\"\n\n#include <llvm\/IR\/GlobalVariable.h>\n#include <llvm\/IR\/Function.h>\n#include <llvm\/IR\/IntrinsicInst.h>\n\n#include \"Type.h\"\n#include \"Ext.h\"\n#include \"RuntimeManager.h\"\n\nnamespace dev\n{\nnamespace eth\n{\nnamespace jit\n{\n\nnamespace \/\/ Helper functions\n{\n\nuint64_t const c_stepGas = 1;\nuint64_t const c_balanceGas = 20;\nuint64_t const c_sha3Gas = 10;\nuint64_t const c_sha3WordGas = 10;\nuint64_t const c_sloadGas = 20;\nuint64_t const c_sstoreSetGas = 300;\nuint64_t const c_sstoreResetGas = 100;\nuint64_t const c_sstoreRefundGas = 100;\nuint64_t const c_createGas = 100;\nuint64_t const c_createDataGas = 5;\nuint64_t const c_callGas = 20;\nuint64_t const c_expGas = 1;\nuint64_t const c_expByteGas = 1;\nuint64_t const c_memoryGas = 1;\nuint64_t const c_txDataZeroGas = 1;\nuint64_t const c_txDataNonZeroGas = 5;\nuint64_t const c_txGas = 500;\nuint64_t const c_logGas = 32;\nuint64_t const c_logDataGas = 1;\nuint64_t const c_logTopicGas = 32;\nuint64_t const c_copyGas = 1;\n\nuint64_t getStepCost(Instruction inst)\n{\n\tswitch (inst)\n\t{\n\tdefault: \/\/ Assumes instruction code is valid\n\t\treturn c_stepGas;\n\n\tcase Instruction::STOP:\n\tcase Instruction::SUICIDE:\n\tcase Instruction::SSTORE: \/\/ Handle cost of SSTORE separately in GasMeter::countSStore()\n\t\treturn 0;\n\n\tcase Instruction::EXP:\t\treturn c_expGas;\n\n\tcase Instruction::SLOAD:\treturn c_sloadGas;\n\n\tcase Instruction::SHA3:\t\treturn c_sha3Gas;\n\n\tcase Instruction::BALANCE:\treturn c_balanceGas;\n\n\tcase Instruction::CALL:\n\tcase Instruction::CALLCODE:\treturn c_callGas;\n\n\tcase Instruction::CREATE:\treturn c_createGas;\n\n\tcase Instruction::LOG0:\n\tcase Instruction::LOG1:\n\tcase Instruction::LOG2:\n\tcase Instruction::LOG3:\n\tcase Instruction::LOG4:\n\t{\n\t\tauto numTopics = static_cast<uint64_t>(inst) - static_cast<uint64_t>(Instruction::LOG0);\n\t\treturn c_logGas + numTopics * c_logTopicGas;\n\t}\n\t}\n}\n\n}\n\nGasMeter::GasMeter(llvm::IRBuilder<>& _builder, RuntimeManager& _runtimeManager) :\n\tCompilerHelper(_builder),\n\tm_runtimeManager(_runtimeManager)\n{\n\tauto module = getModule();\n\n\tllvm::Type* gasCheckArgs[] = {Type::RuntimePtr, Type::Word};\n\tm_gasCheckFunc = llvm::Function::Create(llvm::FunctionType::get(Type::Void, gasCheckArgs, false), llvm::Function::PrivateLinkage, \"gas.check\", module);\n\tInsertPointGuard guard(m_builder);\n\n\tauto checkBB = llvm::BasicBlock::Create(_builder.getContext(), \"Check\", m_gasCheckFunc);\n\tauto outOfGasBB = llvm::BasicBlock::Create(_builder.getContext(), \"OutOfGas\", m_gasCheckFunc);\n\tauto updateBB = llvm::BasicBlock::Create(_builder.getContext(), \"Update\", m_gasCheckFunc);\n\n\tm_builder.SetInsertPoint(checkBB);\n\tauto arg = m_gasCheckFunc->arg_begin();\n\targ->setName(\"rt\");\n\t++arg;\n\targ->setName(\"cost\");\n\tauto cost = arg;\n\tauto gas = m_runtimeManager.getGas();\n\tauto isOutOfGas = m_builder.CreateICmpUGT(cost, gas, \"isOutOfGas\");\n\tm_builder.CreateCondBr(isOutOfGas, outOfGasBB, updateBB);\n\n\tm_builder.SetInsertPoint(outOfGasBB);\n\tm_runtimeManager.raiseException(ReturnCode::OutOfGas);\n\tm_builder.CreateUnreachable();\n\n\tm_builder.SetInsertPoint(updateBB);\n\tgas = m_builder.CreateSub(gas, cost);\n\tm_runtimeManager.setGas(gas);\n\tm_builder.CreateRetVoid();\n}\n\nvoid GasMeter::count(Instruction _inst)\n{\n\tif (!m_checkCall)\n\t{\n\t\t\/\/ Create gas check call with mocked block cost at begining of current cost-block\n\t\tm_checkCall = createCall(m_gasCheckFunc, {m_runtimeManager.getRuntimePtr(), llvm::UndefValue::get(Type::Word)});\n\t}\n\n\tm_blockCost += getStepCost(_inst);\n}\n\nvoid GasMeter::count(llvm::Value* _cost)\n{\n\tcreateCall(m_gasCheckFunc, {m_runtimeManager.getRuntimePtr(), _cost});\n}\n\nvoid GasMeter::countExp(llvm::Value* _exponent)\n{\n\t\/\/ Additional cost is 1 per significant byte of exponent\n\t\/\/ lz - leading zeros\n\t\/\/ cost = ((256 - lz) + 7) \/ 8\n\n\t\/\/ OPT: All calculations can be done on 32\/64 bits\n\n\tauto ctlz = llvm::Intrinsic::getDeclaration(getModule(), llvm::Intrinsic::ctlz, Type::Word);\n\tauto lz = m_builder.CreateCall2(ctlz, _exponent, m_builder.getInt1(false));\n\tauto sigBits = m_builder.CreateSub(Constant::get(256), lz);\n\tauto sigBytes = m_builder.CreateUDiv(m_builder.CreateAdd(sigBits, Constant::get(7)), Constant::get(8));\n\tcount(sigBytes);\n}\n\nvoid GasMeter::countSStore(Ext& _ext, llvm::Value* _index, llvm::Value* _newValue)\n{\n\tauto oldValue = _ext.sload(_index);\n\tauto oldValueIsZero = m_builder.CreateICmpEQ(oldValue, Constant::get(0), \"oldValueIsZero\");\n\tauto newValueIsZero = m_builder.CreateICmpEQ(_newValue, Constant::get(0), \"newValueIsZero\");\n\tauto oldValueIsntZero = m_builder.CreateICmpNE(oldValue, Constant::get(0), \"oldValueIsntZero\");\n\tauto newValueIsntZero = m_builder.CreateICmpNE(_newValue, Constant::get(0), \"newValueIsntZero\");\n\tauto isInsert = m_builder.CreateAnd(oldValueIsZero, newValueIsntZero, \"isInsert\");\n\tauto isDelete = m_builder.CreateAnd(oldValueIsntZero, newValueIsZero, \"isDelete\");\n\tauto cost = m_builder.CreateSelect(isInsert, Constant::get(c_sstoreSetGas), Constant::get(c_sstoreResetGas), \"cost\");\n\tcost = m_builder.CreateSelect(isDelete, Constant::get(0), cost, \"cost\");\n\tcount(cost);\n}\n\nvoid GasMeter::countLogData(llvm::Value* _dataLength)\n{\n\tassert(m_checkCall);\n\tassert(m_blockCost > 0); \/\/ LOGn instruction is already counted\n\tstatic_assert(c_logDataGas == 1, \"Log data gas cost has changed. Update GasMeter.\");\n\tcount(_dataLength);\n}\n\nvoid GasMeter::countSha3Data(llvm::Value* _dataLength)\n{\n\tassert(m_checkCall);\n\tassert(m_blockCost > 0); \/\/ SHA3 instruction is already counted\n\n\t\/\/ TODO: This round ups to 32 happens in many places\n\t\/\/ FIXME: 64-bit arith used, but not verified\n\tstatic_assert(c_sha3WordGas != 1, \"SHA3 data cost has changed. Update GasMeter\");\n\tauto dataLength64 = getBuilder().CreateTrunc(_dataLength, Type::lowPrecision);\n\tauto words64 = m_builder.CreateUDiv(m_builder.CreateAdd(dataLength64, getBuilder().getInt64(31)), getBuilder().getInt64(32));\n\tauto cost64 = m_builder.CreateNUWMul(getBuilder().getInt64(c_sha3WordGas), words64);\n\tauto cost = getBuilder().CreateZExt(cost64, Type::Word);\n\tcount(cost);\n}\n\nvoid GasMeter::giveBack(llvm::Value* _gas)\n{\n\tm_runtimeManager.setGas(m_builder.CreateAdd(m_runtimeManager.getGas(), _gas));\n}\n\nvoid GasMeter::commitCostBlock()\n{\n\t\/\/ If any uncommited block\n\tif (m_checkCall)\n\t{\n\t\tif (m_blockCost == 0) \/\/ Do not check 0\n\t\t{\n\t\t\tm_checkCall->eraseFromParent(); \/\/ Remove the gas check call\n\t\t\tm_checkCall = nullptr;\n\t\t\treturn;\n\t\t}\n\n\t\tm_checkCall->setArgOperand(1, Constant::get(m_blockCost)); \/\/ Update block cost in gas check call\n\t\tm_checkCall = nullptr; \/\/ End cost-block\n\t\tm_blockCost = 0;\n\t}\n\tassert(m_blockCost == 0);\n}\n\nvoid GasMeter::countMemory(llvm::Value* _additionalMemoryInWords)\n{\n\tstatic_assert(c_memoryGas == 1, \"Memory gas cost has changed. Update GasMeter.\");\n\tcount(_additionalMemoryInWords);\n}\n\nvoid GasMeter::countCopy(llvm::Value* _copyWords)\n{\n\tstatic_assert(c_copyGas == 1, \"Copy gas cost has changed. Update GasMeter.\");\n\tcount(_copyWords);\n}\n\n}\n}\n}\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Hackerrank > Algorithms > Warmup > Plus Minus<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2014 Andrew Duggan\n * Copyright (C) 2014 Synaptics 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 <errno.h>\n#include <getopt.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <dirent.h>\n#include <unistd.h>\n#include <time.h>\n\n#include \"hiddevice.h\"\n#include \"rmi4update.h\"\n\n#define RMI4UPDATE_GETOPTS\t\"hfd:\"\n\nvoid printHelp(const char *prog_name)\n{\n\tfprintf(stdout, \"Usage: %s [OPTIONS] FIRMWAREFILE\\n\", prog_name);\n\tfprintf(stdout, \"\\t-h, --help\\tPrint this message\\n\");\n\tfprintf(stdout, \"\\t-f, --force\\tForce updating firmware even it the image provided is older\\n\\t\\t\\tthen the current firmware on the device.\\n\");\n\tfprintf(stdout, \"\\t-d, --device\\thidraw device file associated with the device being updated.\\n\");\n}\n\nint UpdateDevice(FirmwareImage & image, bool force, const char * deviceFile)\n{\n\tHIDDevice rmidevice;\n\tint rc;\n\n\trc = rmidevice.Open(deviceFile);\n\tif (rc)\n\t\treturn rc;\n\n\tRMI4Update update(rmidevice, image);\n\trc = update.UpdateFirmware(force);\n\tif (rc != UPDATE_SUCCESS)\n\t\treturn rc;\n\n\treturn rc;\n}\n\nint WriteDeviceNameToFile(const char * file, const char * str)\n{\n\tint fd;\n\tssize_t size;\n\n\tfd = open(file, O_WRONLY);\n\tif (fd < 0)\n\t\treturn UPDATE_FAIL;\n\n\tfor (;;) {\n\t\tsize = write(fd, str, 19);\n\t\tif (size < 0) {\n\t\t\tif (errno == EINTR)\n\t\t\t\tcontinue;\n\n\t\t\treturn UPDATE_FAIL;\n\t\t}\n\t\tbreak;\n\t}\n\n\tclose(fd);\n\n\treturn UPDATE_SUCCESS;\n}\n\n\/*\n * We need to rebind the driver to the device after firmware update for two reasons\n * \ta) The parameters of the device may have changed in the new firmware so the\n *\t   driver should redo the initialization to read the new values.\n *\tb) Kernel commit 0f5a24c6 will now power down the device once we close the\n *\t   file descriptor for the hidraw device file. Reloading the driver powers the\n *\t   device back on.\n *\/\nvoid RebindDriver(const char * hidraw)\n{\n\tint rc;\n\tssize_t size;\n\tchar bindFile[PATH_MAX];\n\tchar unbindFile[PATH_MAX];\n\tchar deviceLink[PATH_MAX];\n\tchar driverName[PATH_MAX];\n\tchar driverLink[PATH_MAX];\n\tchar linkBuf[PATH_MAX];\n\tchar hidDeviceString[20];\n\tint i;\n\n\tsnprintf(unbindFile, PATH_MAX, \"\/sys\/class\/hidraw\/%s\/device\/driver\/unbind\", hidraw);\n\tsnprintf(deviceLink, PATH_MAX, \"\/sys\/class\/hidraw\/%s\/device\", hidraw);\n\n\tsize = readlink(deviceLink, linkBuf, PATH_MAX);\n\tif (size < 0) {\n\t\tfprintf(stderr, \"Failed to find the HID string for this device: %s\\n\",\n\t\t\thidraw);\n\t\treturn;\n\t}\n\tlinkBuf[size] = 0;\n\n\tstrncpy(hidDeviceString, StripPath(linkBuf, size), 20);\n\n\tsnprintf(driverLink, PATH_MAX, \"\/sys\/class\/hidraw\/%s\/device\/driver\", hidraw);\n\n\tsize = readlink(driverLink, linkBuf, PATH_MAX);\n\tif (size < 0) {\n\t\tfprintf(stderr, \"Failed to find the HID string for this device: %s\\n\",\n\t\t\thidraw);\n\t\treturn;\n\t}\n\tlinkBuf[size] = 0;\n\n\tstrncpy(driverName, StripPath(linkBuf, size), PATH_MAX);\n\n\tsnprintf(bindFile, PATH_MAX, \"\/sys\/bus\/hid\/drivers\/%s\/bind\", driverName);\n\n\trc = WriteDeviceNameToFile(unbindFile, hidDeviceString);\n\tif (rc != UPDATE_SUCCESS) {\n\t\tfprintf(stderr, \"Failed to unbind HID device %s: %s\\n\",\n\t\t\thidDeviceString, strerror(errno));\n\t\treturn;\n\t}\n\n\tfor (i = 0;; ++i) {\n\t\tstruct timespec req;\n\t\tstruct timespec rem;\n\n\t\trc = WriteDeviceNameToFile(bindFile, hidDeviceString);\n\t\tif (rc == UPDATE_SUCCESS)\n\t\t\treturn;\n\n\t\tif (i <= 4)\n\t\t\tbreak;\n\n\t\t\/* device might not be ready yet to bind to *\/\n\t\treq.tv_sec = 0;\n\t\treq.tv_nsec = 100 * 1000 * 1000; \/* 100 ms *\/\n\t\tfor (;;) {\n\t\t\trc = nanosleep(&req, &rem);\n\t\t\tif (rc < 0) {\n\t\t\t\tif (errno == EINTR) {\n\t\t\t\t\treq = rem;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tfprintf(stderr, \"Failed to bind HID device %s: %s\\n\",\n\t\thidDeviceString, strerror(errno));\n}\n\nint main(int argc, char **argv)\n{\n\tint rc;\n\tFirmwareImage image;\n\tint opt;\n\tint index;\n\tconst char *deviceName = NULL;\n\tconst char *firmwareName = NULL;\n\tbool force = false;\n\tstatic struct option long_options[] = {\n\t\t{\"help\", 0, NULL, 'h'},\n\t\t{\"force\", 0, NULL, 'f'},\n\t\t{\"device\", 1, NULL, 'd'},\n\t\t{0, 0, 0, 0},\n\t};\n\tstruct dirent * devDirEntry;\n\tDIR * devDir;\n\n\twhile ((opt = getopt_long(argc, argv, RMI4UPDATE_GETOPTS, long_options, &index)) != -1) {\n\t\tswitch (opt) {\n\t\t\tcase 'h':\n\t\t\t\tprintHelp(argv[0]);\n\t\t\t\treturn 0;\n\t\t\tcase 'f':\n\t\t\t\tforce = true;\n\t\t\t\tbreak;\n\t\t\tcase 'd':\n\t\t\t\tdeviceName = optarg;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tbreak;\n\n\t\t}\n\t}\n\n\tif (optind < argc) {\n\t\tfirmwareName = argv[optind];\n\t} else {\n\t\tprintHelp(argv[0]);\n\t\treturn -1;\n\t}\n\n\trc = image.Initialize(firmwareName);\n\tif (rc != UPDATE_SUCCESS) {\n\t\tfprintf(stderr, \"Failed to initialize the firmware image: %s\\n\", update_err_to_string(rc));\n\t\treturn 1;\n\t}\n\n\tif (deviceName) {\n\t\treturn UpdateDevice(image, force, deviceName);\n\t} else {\n\t\tchar rawDevice[PATH_MAX];\n\t\tchar deviceFile[PATH_MAX];\n\t\tbool found = false;\n\n\t\tdevDir = opendir(\"\/dev\");\n\t\tif (!devDir)\n\t\t\treturn -1;\n\n\t\twhile ((devDirEntry = readdir(devDir)) != NULL) {\n\t\t\tif (strstr(devDirEntry->d_name, \"hidraw\")) {\n\t\t\t\tstrncpy(rawDevice, devDirEntry->d_name, PATH_MAX);\n\t\t\t\tsnprintf(deviceFile, PATH_MAX, \"\/dev\/%s\", devDirEntry->d_name);\n\t\t\t\trc = UpdateDevice(image, force, deviceFile);\n\t\t\t\tif (rc != 0) {\n\t\t\t\t\tcontinue;\n\t\t\t\t} else {\n\t\t\t\t\tfound = true;\n\t\t\t\t\tRebindDriver(rawDevice);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tclosedir(devDir);\n\n\t\tif (!found)\n\t\t\treturn rc;\n\t}\n\n\treturn 0;\n}\n<commit_msg>Add an option to print a string describing the firmware version and build id.<commit_after>\/*\n * Copyright (C) 2014 Andrew Duggan\n * Copyright (C) 2014 Synaptics 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 <errno.h>\n#include <getopt.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <dirent.h>\n#include <unistd.h>\n#include <time.h>\n#include <string>\n#include <sstream>\n\n#include \"hiddevice.h\"\n#include \"rmi4update.h\"\n\n#define RMI4UPDATE_GETOPTS\t\"hfd:p\"\n\nvoid printHelp(const char *prog_name)\n{\n\tfprintf(stdout, \"Usage: %s [OPTIONS] FIRMWAREFILE\\n\", prog_name);\n\tfprintf(stdout, \"\\t-h, --help\\tPrint this message\\n\");\n\tfprintf(stdout, \"\\t-f, --force\\tForce updating firmware even it the image provided is older\\n\\t\\t\\tthen the current firmware on the device.\\n\");\n\tfprintf(stdout, \"\\t-d, --device\\thidraw device file associated with the device being updated.\\n\");\n\tfprintf(stdout, \"\\t-p, --fw-props\\tPrint the firmware properties.\\n\");\n}\n\nint UpdateDevice(FirmwareImage & image, bool force, const char * deviceFile)\n{\n\tHIDDevice rmidevice;\n\tint rc;\n\n\trc = rmidevice.Open(deviceFile);\n\tif (rc)\n\t\treturn rc;\n\n\tRMI4Update update(rmidevice, image);\n\trc = update.UpdateFirmware(force);\n\tif (rc != UPDATE_SUCCESS)\n\t\treturn rc;\n\n\treturn rc;\n}\n\nint WriteDeviceNameToFile(const char * file, const char * str)\n{\n\tint fd;\n\tssize_t size;\n\n\tfd = open(file, O_WRONLY);\n\tif (fd < 0)\n\t\treturn UPDATE_FAIL;\n\n\tfor (;;) {\n\t\tsize = write(fd, str, 19);\n\t\tif (size < 0) {\n\t\t\tif (errno == EINTR)\n\t\t\t\tcontinue;\n\n\t\t\treturn UPDATE_FAIL;\n\t\t}\n\t\tbreak;\n\t}\n\n\tclose(fd);\n\n\treturn UPDATE_SUCCESS;\n}\n\n\/*\n * We need to rebind the driver to the device after firmware update for two reasons\n * \ta) The parameters of the device may have changed in the new firmware so the\n *\t   driver should redo the initialization to read the new values.\n *\tb) Kernel commit 0f5a24c6 will now power down the device once we close the\n *\t   file descriptor for the hidraw device file. Reloading the driver powers the\n *\t   device back on.\n *\/\nvoid RebindDriver(const char * hidraw)\n{\n\tint rc;\n\tssize_t size;\n\tchar bindFile[PATH_MAX];\n\tchar unbindFile[PATH_MAX];\n\tchar deviceLink[PATH_MAX];\n\tchar driverName[PATH_MAX];\n\tchar driverLink[PATH_MAX];\n\tchar linkBuf[PATH_MAX];\n\tchar hidDeviceString[20];\n\tint i;\n\n\tsnprintf(unbindFile, PATH_MAX, \"\/sys\/class\/hidraw\/%s\/device\/driver\/unbind\", hidraw);\n\tsnprintf(deviceLink, PATH_MAX, \"\/sys\/class\/hidraw\/%s\/device\", hidraw);\n\n\tsize = readlink(deviceLink, linkBuf, PATH_MAX);\n\tif (size < 0) {\n\t\tfprintf(stderr, \"Failed to find the HID string for this device: %s\\n\",\n\t\t\thidraw);\n\t\treturn;\n\t}\n\tlinkBuf[size] = 0;\n\n\tstrncpy(hidDeviceString, StripPath(linkBuf, size), 20);\n\n\tsnprintf(driverLink, PATH_MAX, \"\/sys\/class\/hidraw\/%s\/device\/driver\", hidraw);\n\n\tsize = readlink(driverLink, linkBuf, PATH_MAX);\n\tif (size < 0) {\n\t\tfprintf(stderr, \"Failed to find the HID string for this device: %s\\n\",\n\t\t\thidraw);\n\t\treturn;\n\t}\n\tlinkBuf[size] = 0;\n\n\tstrncpy(driverName, StripPath(linkBuf, size), PATH_MAX);\n\n\tsnprintf(bindFile, PATH_MAX, \"\/sys\/bus\/hid\/drivers\/%s\/bind\", driverName);\n\n\trc = WriteDeviceNameToFile(unbindFile, hidDeviceString);\n\tif (rc != UPDATE_SUCCESS) {\n\t\tfprintf(stderr, \"Failed to unbind HID device %s: %s\\n\",\n\t\t\thidDeviceString, strerror(errno));\n\t\treturn;\n\t}\n\n\tfor (i = 0;; ++i) {\n\t\tstruct timespec req;\n\t\tstruct timespec rem;\n\n\t\trc = WriteDeviceNameToFile(bindFile, hidDeviceString);\n\t\tif (rc == UPDATE_SUCCESS)\n\t\t\treturn;\n\n\t\tif (i <= 4)\n\t\t\tbreak;\n\n\t\t\/* device might not be ready yet to bind to *\/\n\t\treq.tv_sec = 0;\n\t\treq.tv_nsec = 100 * 1000 * 1000; \/* 100 ms *\/\n\t\tfor (;;) {\n\t\t\trc = nanosleep(&req, &rem);\n\t\t\tif (rc < 0) {\n\t\t\t\tif (errno == EINTR) {\n\t\t\t\t\treq = rem;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tfprintf(stderr, \"Failed to bind HID device %s: %s\\n\",\n\t\thidDeviceString, strerror(errno));\n}\n\nint GetFirmwareProps(const char * deviceFile, std::string &props)\n{\n\tHIDDevice rmidevice;\n\tint rc = UPDATE_SUCCESS;\n\tstd::stringstream ss;\n\n\trc = rmidevice.Open(deviceFile);\n\tif (rc)\n\t\treturn rc;\n\n\trmidevice.ScanPDT();\n\trmidevice.QueryBasicProperties();\n\n\tss << rmidevice.GetFirmwareVersionMajor() << \".\"\n\t\t<< rmidevice.GetFirmwareVersionMinor() << \".\"\n\t\t<< std::hex << rmidevice.GetFirmwareID();\n\n\tprops = ss.str();\n\n\treturn rc;\n}\n\nint main(int argc, char **argv)\n{\n\tint rc;\n\tFirmwareImage image;\n\tint opt;\n\tint index;\n\tconst char *deviceName = NULL;\n\tconst char *firmwareName = NULL;\n\tbool force = false;\n\tstatic struct option long_options[] = {\n\t\t{\"help\", 0, NULL, 'h'},\n\t\t{\"force\", 0, NULL, 'f'},\n\t\t{\"device\", 1, NULL, 'd'},\n\t\t{\"fw-props\", 0, NULL, 'p'},\n\t\t{0, 0, 0, 0},\n\t};\n\tstruct dirent * devDirEntry;\n\tDIR * devDir;\n\tbool printFirmwareProps = false;\n\n\twhile ((opt = getopt_long(argc, argv, RMI4UPDATE_GETOPTS, long_options, &index)) != -1) {\n\t\tswitch (opt) {\n\t\t\tcase 'h':\n\t\t\t\tprintHelp(argv[0]);\n\t\t\t\treturn 0;\n\t\t\tcase 'f':\n\t\t\t\tforce = true;\n\t\t\t\tbreak;\n\t\t\tcase 'd':\n\t\t\t\tdeviceName = optarg;\n\t\t\t\tbreak;\n\t\t\tcase 'p':\n\t\t\t\tprintFirmwareProps = true;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tbreak;\n\n\t\t}\n\t}\n\n\tif (printFirmwareProps) {\n\t\tstd::string props;\n\n\t\tif (!deviceName) {\n\t\t\tfprintf(stderr, \"Specifiy which device to query\\n\");\n\t\t\treturn 1;\n\t\t}\n\t\trc = GetFirmwareProps(deviceName, props);\n\t\tif (rc) {\n\t\t\tfprintf(stderr, \"Failed to read properties from device: %s\\n\", update_err_to_string(rc));\n\t\t\treturn 1;\n\t\t}\n\t\tfprintf(stdout, \"%s\\n\", props.c_str());\n\t\treturn 0;\n\t}\n\n\tif (optind < argc) {\n\t\tfirmwareName = argv[optind];\n\t} else {\n\t\tprintHelp(argv[0]);\n\t\treturn -1;\n\t}\n\n\trc = image.Initialize(firmwareName);\n\tif (rc != UPDATE_SUCCESS) {\n\t\tfprintf(stderr, \"Failed to initialize the firmware image: %s\\n\", update_err_to_string(rc));\n\t\treturn 1;\n\t}\n\n\tif (deviceName) {\n\t\treturn UpdateDevice(image, force, deviceName);\n\t} else {\n\t\tchar rawDevice[PATH_MAX];\n\t\tchar deviceFile[PATH_MAX];\n\t\tbool found = false;\n\n\t\tdevDir = opendir(\"\/dev\");\n\t\tif (!devDir)\n\t\t\treturn -1;\n\n\t\twhile ((devDirEntry = readdir(devDir)) != NULL) {\n\t\t\tif (strstr(devDirEntry->d_name, \"hidraw\")) {\n\t\t\t\tstrncpy(rawDevice, devDirEntry->d_name, PATH_MAX);\n\t\t\t\tsnprintf(deviceFile, PATH_MAX, \"\/dev\/%s\", devDirEntry->d_name);\n\t\t\t\trc = UpdateDevice(image, force, deviceFile);\n\t\t\t\tif (rc != 0) {\n\t\t\t\t\tcontinue;\n\t\t\t\t} else {\n\t\t\t\t\tfound = true;\n\t\t\t\t\tRebindDriver(rawDevice);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tclosedir(devDir);\n\n\t\tif (!found)\n\t\t\treturn rc;\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Do not update settings that haven't changed.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2000, 2010 Oracle and\/or its affiliates.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org.  If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#include \"ShapeContextHandler.hxx\"\n#include \"oox\/vml\/vmldrawingfragment.hxx\"\n#include \"oox\/vml\/vmlshape.hxx\"\n#include \"oox\/vml\/vmlshapecontainer.hxx\"\n\nnamespace oox { namespace shape {\n\nusing namespace ::com::sun::star;\nusing namespace core;\nusing namespace drawingml;\n\n::rtl::OUString SAL_CALL ShapeContextHandler_getImplementationName()\n{\n    return CREATE_OUSTRING( \"com.sun.star.comp.oox.ShapeContextHandler\" );\n}\n\nuno::Sequence< ::rtl::OUString > SAL_CALL\nShapeContextHandler_getSupportedServiceNames()\n{\n    uno::Sequence< ::rtl::OUString > s(1);\n    s[0] = CREATE_OUSTRING( \"com.sun.star.xml.sax.FastShapeContextHandler\" );\n    return s;\n}\n\nuno::Reference< uno::XInterface > SAL_CALL\nShapeContextHandler_createInstance( const uno::Reference< uno::XComponentContext > & context)\n        SAL_THROW((uno::Exception))\n{\n    return static_cast< ::cppu::OWeakObject* >( new ShapeContextHandler(context) );\n}\n\n\nShapeContextHandler::ShapeContextHandler\n(uno::Reference< uno::XComponentContext > const & context) :\nmnStartToken(0), m_xContext(context)\n{\n    try\n    {\n        mxFilterBase.set( new ShapeFilterBase(context) );\n    }\n    catch( uno::Exception& )\n    {\n    }\n}\n\nShapeContextHandler::~ShapeContextHandler()\n{\n}\n\nuno::Reference<xml::sax::XFastContextHandler>\nShapeContextHandler::getGraphicShapeContext(::sal_Int32 Element )\n{\n    if (! mxGraphicShapeContext.is())\n    {\n        FragmentHandlerRef rFragmentHandler\n            (new ShapeFragmentHandler(*mxFilterBase, msRelationFragmentPath));\n        ShapePtr pMasterShape;\n\n        switch (Element & 0xffff)\n        {\n            case XML_graphic:\n                mpShape.reset(new Shape(\"com.sun.star.drawing.GraphicObjectShape\" ));\n                mxGraphicShapeContext.set\n                (new GraphicalObjectFrameContext(*rFragmentHandler, pMasterShape, mpShape, true));\n                break;\n            case XML_pic:\n                mpShape.reset(new Shape(\"com.sun.star.drawing.GraphicObjectShape\" ));\n                mxGraphicShapeContext.set\n                (new GraphicShapeContext(*rFragmentHandler, pMasterShape, mpShape));\n                break;\n            default:\n                break;\n        }\n    }\n\n    return mxGraphicShapeContext;\n}\n\nuno::Reference<xml::sax::XFastContextHandler>\nShapeContextHandler::getDrawingShapeContext()\n{\n    if (!mxDrawingFragmentHandler.is())\n    {\n        mpDrawing.reset( new oox::vml::Drawing( *mxFilterBase, mxDrawPage, oox::vml::VMLDRAWING_WORD ) );\n        mxDrawingFragmentHandler.set\n          (dynamic_cast<ContextHandler *>\n           (new oox::vml::DrawingFragment\n            ( *mxFilterBase, msRelationFragmentPath, *mpDrawing )));\n    }\n\n    return mxDrawingFragmentHandler;\n}\n\nuno::Reference<xml::sax::XFastContextHandler>\nShapeContextHandler::getContextHandler()\n{\n    uno::Reference<xml::sax::XFastContextHandler> xResult;\n\n    switch (getNamespace( mnStartToken ))\n    {\n        case NMSP_doc:\n        case NMSP_vml:\n            xResult.set(getDrawingShapeContext());\n            break;\n        default:\n            xResult.set(getGraphicShapeContext(mnStartToken));\n            break;\n    }\n\n    return xResult;\n}\n\n\/\/ ::com::sun::star::xml::sax::XFastContextHandler:\nvoid SAL_CALL ShapeContextHandler::startFastElement\n(::sal_Int32 Element,\n const uno::Reference< xml::sax::XFastAttributeList > & Attribs)\n    throw (uno::RuntimeException, xml::sax::SAXException)\n{\n    static const ::rtl::OUString sInputStream\n        (RTL_CONSTASCII_USTRINGPARAM (\"InputStream\"));\n\n    uno::Sequence<beans::PropertyValue> aSeq(1);\n    aSeq[0].Name = sInputStream;\n    aSeq[0].Value <<= mxInputStream;\n    mxFilterBase->filter(aSeq);\n\n    mpThemePtr.reset(new Theme());\n\n    uno::Reference<XFastContextHandler> xContextHandler(getContextHandler());\n\n    if (xContextHandler.is())\n        xContextHandler->startFastElement(Element, Attribs);\n}\n\nvoid SAL_CALL ShapeContextHandler::startUnknownElement\n(const ::rtl::OUString & Namespace, const ::rtl::OUString & Name,\n const uno::Reference< xml::sax::XFastAttributeList > & Attribs)\n    throw (uno::RuntimeException, xml::sax::SAXException)\n{\n    uno::Reference<XFastContextHandler> xContextHandler(getContextHandler());\n\n    if (xContextHandler.is())\n        xContextHandler->startUnknownElement(Namespace, Name, Attribs);\n}\n\nvoid SAL_CALL ShapeContextHandler::endFastElement(::sal_Int32 Element)\n    throw (uno::RuntimeException, xml::sax::SAXException)\n{\n    uno::Reference<XFastContextHandler> xContextHandler(getContextHandler());\n\n    if (xContextHandler.is())\n        xContextHandler->endFastElement(Element);\n}\n\nvoid SAL_CALL ShapeContextHandler::endUnknownElement\n(const ::rtl::OUString & Namespace,\n const ::rtl::OUString & Name)\n    throw (uno::RuntimeException, xml::sax::SAXException)\n{\n    uno::Reference<XFastContextHandler> xContextHandler(getContextHandler());\n\n    if (xContextHandler.is())\n        xContextHandler->endUnknownElement(Namespace, Name);\n}\n\nuno::Reference< xml::sax::XFastContextHandler > SAL_CALL\nShapeContextHandler::createFastChildContext\n(::sal_Int32 Element,\n const uno::Reference< xml::sax::XFastAttributeList > & Attribs)\n    throw (uno::RuntimeException, xml::sax::SAXException)\n{\n    uno::Reference< xml::sax::XFastContextHandler > xResult;\n    uno::Reference< xml::sax::XFastContextHandler > xContextHandler(getContextHandler());\n\n    if (xContextHandler.is())\n        xResult.set(xContextHandler->createFastChildContext\n                    (Element, Attribs));\n\n    return xResult;\n}\n\nuno::Reference< xml::sax::XFastContextHandler > SAL_CALL\nShapeContextHandler::createUnknownChildContext\n(const ::rtl::OUString & Namespace,\n const ::rtl::OUString & Name,\n const uno::Reference< xml::sax::XFastAttributeList > & Attribs)\n    throw (uno::RuntimeException, xml::sax::SAXException)\n{\n    uno::Reference<XFastContextHandler> xContextHandler(getContextHandler());\n\n    if (xContextHandler.is())\n        return xContextHandler->createUnknownChildContext\n            (Namespace, Name, Attribs);\n\n    return uno::Reference< xml::sax::XFastContextHandler >();\n}\n\nvoid SAL_CALL ShapeContextHandler::characters(const ::rtl::OUString & aChars)\n    throw (uno::RuntimeException, xml::sax::SAXException)\n{\n    uno::Reference<XFastContextHandler> xContextHandler(getContextHandler());\n\n    if (xContextHandler.is())\n        xContextHandler->characters(aChars);\n}\n\n\/\/ ::com::sun::star::xml::sax::XFastShapeContextHandler:\nuno::Reference< drawing::XShape > SAL_CALL\nShapeContextHandler::getShape() throw (uno::RuntimeException)\n{\n    uno::Reference< drawing::XShape > xResult;\n    uno::Reference< drawing::XShapes > xShapes( mxDrawPage, uno::UNO_QUERY );\n\n    if (mxFilterBase.is() && xShapes.is())\n    {\n        if ( getContextHandler() == getDrawingShapeContext() )\n        {\n            mpDrawing->finalizeFragmentImport();\n            if( const ::oox::vml::ShapeBase* pShape = mpDrawing->getShapes().getFirstShape() )\n            {\n                mpDrawing->getShapes( ).clearShapes( );\n                xResult = pShape->convertAndInsert( xShapes );\n            }\n        }\n        else if (mpShape.get() != NULL)\n        {\n            basegfx::B2DHomMatrix aTransformation;\n            mpShape->addShape(*mxFilterBase, mpThemePtr.get(), xShapes, aTransformation);\n            xResult.set(mpShape->getXShape());\n            mxGraphicShapeContext.clear( );\n        }\n    }\n\n    return xResult;\n}\n\ncss::uno::Reference< css::drawing::XDrawPage > SAL_CALL\nShapeContextHandler::getDrawPage() throw (css::uno::RuntimeException)\n{\n    return mxDrawPage;\n}\n\nvoid SAL_CALL ShapeContextHandler::setDrawPage\n(const css::uno::Reference< css::drawing::XDrawPage > & the_value)\n    throw (css::uno::RuntimeException)\n{\n    mxDrawPage = the_value;\n}\n\ncss::uno::Reference< css::frame::XModel > SAL_CALL\nShapeContextHandler::getModel() throw (css::uno::RuntimeException)\n{\n    if( !mxFilterBase.is() )\n        throw uno::RuntimeException();\n    return mxFilterBase->getModel();\n}\n\nvoid SAL_CALL ShapeContextHandler::setModel\n(const css::uno::Reference< css::frame::XModel > & the_value)\n    throw (css::uno::RuntimeException)\n{\n    if( !mxFilterBase.is() )\n        throw uno::RuntimeException();\n    uno::Reference<lang::XComponent> xComp(the_value, uno::UNO_QUERY_THROW);\n    mxFilterBase->setTargetDocument(xComp);\n}\n\nuno::Reference< io::XInputStream > SAL_CALL\nShapeContextHandler::getInputStream() throw (uno::RuntimeException)\n{\n    return mxInputStream;\n}\n\nvoid SAL_CALL ShapeContextHandler::setInputStream\n(const uno::Reference< io::XInputStream > & the_value)\n    throw (uno::RuntimeException)\n{\n    mxInputStream = the_value;\n}\n\n::rtl::OUString SAL_CALL ShapeContextHandler::getRelationFragmentPath()\n    throw (uno::RuntimeException)\n{\n    return msRelationFragmentPath;\n}\n\nvoid SAL_CALL ShapeContextHandler::setRelationFragmentPath\n(const ::rtl::OUString & the_value)\n    throw (uno::RuntimeException)\n{\n    msRelationFragmentPath = the_value;\n}\n\n::sal_Int32 SAL_CALL ShapeContextHandler::getStartToken() throw (::com::sun::star::uno::RuntimeException)\n{\n    return mnStartToken;\n}\n\nvoid SAL_CALL ShapeContextHandler::setStartToken( ::sal_Int32 _starttoken ) throw (::com::sun::star::uno::RuntimeException)\n{\n    mnStartToken = _starttoken;\n\n\n}\n\n::rtl::OUString ShapeContextHandler::getImplementationName()\n    throw (css::uno::RuntimeException)\n{\n    return ShapeContextHandler_getImplementationName();\n}\n\nuno::Sequence< ::rtl::OUString > ShapeContextHandler::getSupportedServiceNames()\n    throw (css::uno::RuntimeException)\n{\n    return ShapeContextHandler_getSupportedServiceNames();\n}\n\n::sal_Bool SAL_CALL ShapeContextHandler::supportsService\n(const ::rtl::OUString & ServiceName) throw (css::uno::RuntimeException)\n{\n    uno::Sequence< ::rtl::OUString > aSeq = getSupportedServiceNames();\n\n    if (aSeq[0].equals(ServiceName))\n        return sal_True;\n\n    return sal_False;\n}\n\n}}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>avoid deleting before a use (bnc#693200)<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#include \"ShapeContextHandler.hxx\"\n#include \"oox\/vml\/vmldrawingfragment.hxx\"\n#include \"oox\/vml\/vmlshape.hxx\"\n#include \"oox\/vml\/vmlshapecontainer.hxx\"\n\nnamespace oox { namespace shape {\n\nusing namespace ::com::sun::star;\nusing namespace core;\nusing namespace drawingml;\n\n::rtl::OUString SAL_CALL ShapeContextHandler_getImplementationName()\n{\n    return CREATE_OUSTRING( \"com.sun.star.comp.oox.ShapeContextHandler\" );\n}\n\nuno::Sequence< ::rtl::OUString > SAL_CALL\nShapeContextHandler_getSupportedServiceNames()\n{\n    uno::Sequence< ::rtl::OUString > s(1);\n    s[0] = CREATE_OUSTRING( \"com.sun.star.xml.sax.FastShapeContextHandler\" );\n    return s;\n}\n\nuno::Reference< uno::XInterface > SAL_CALL\nShapeContextHandler_createInstance( const uno::Reference< uno::XComponentContext > & context)\n        SAL_THROW((uno::Exception))\n{\n    return static_cast< ::cppu::OWeakObject* >( new ShapeContextHandler(context) );\n}\n\n\nShapeContextHandler::ShapeContextHandler\n(uno::Reference< uno::XComponentContext > const & context) :\nmnStartToken(0), m_xContext(context)\n{\n    try\n    {\n        mxFilterBase.set( new ShapeFilterBase(context) );\n    }\n    catch( uno::Exception& )\n    {\n    }\n}\n\nShapeContextHandler::~ShapeContextHandler()\n{\n}\n\nuno::Reference<xml::sax::XFastContextHandler>\nShapeContextHandler::getGraphicShapeContext(::sal_Int32 Element )\n{\n    if (! mxGraphicShapeContext.is())\n    {\n        FragmentHandlerRef rFragmentHandler\n            (new ShapeFragmentHandler(*mxFilterBase, msRelationFragmentPath));\n        ShapePtr pMasterShape;\n\n        switch (Element & 0xffff)\n        {\n            case XML_graphic:\n                mpShape.reset(new Shape(\"com.sun.star.drawing.GraphicObjectShape\" ));\n                mxGraphicShapeContext.set\n                (new GraphicalObjectFrameContext(*rFragmentHandler, pMasterShape, mpShape, true));\n                break;\n            case XML_pic:\n                mpShape.reset(new Shape(\"com.sun.star.drawing.GraphicObjectShape\" ));\n                mxGraphicShapeContext.set\n                (new GraphicShapeContext(*rFragmentHandler, pMasterShape, mpShape));\n                break;\n            default:\n                break;\n        }\n    }\n\n    return mxGraphicShapeContext;\n}\n\nuno::Reference<xml::sax::XFastContextHandler>\nShapeContextHandler::getDrawingShapeContext()\n{\n    if (!mxDrawingFragmentHandler.is())\n    {\n        mpDrawing.reset( new oox::vml::Drawing( *mxFilterBase, mxDrawPage, oox::vml::VMLDRAWING_WORD ) );\n        mxDrawingFragmentHandler.set\n          (dynamic_cast<ContextHandler *>\n           (new oox::vml::DrawingFragment\n            ( *mxFilterBase, msRelationFragmentPath, *mpDrawing )));\n    }\n\n    return mxDrawingFragmentHandler;\n}\n\nuno::Reference<xml::sax::XFastContextHandler>\nShapeContextHandler::getContextHandler()\n{\n    uno::Reference<xml::sax::XFastContextHandler> xResult;\n\n    switch (getNamespace( mnStartToken ))\n    {\n        case NMSP_doc:\n        case NMSP_vml:\n            xResult.set(getDrawingShapeContext());\n            break;\n        default:\n            xResult.set(getGraphicShapeContext(mnStartToken));\n            break;\n    }\n\n    return xResult;\n}\n\n\/\/ ::com::sun::star::xml::sax::XFastContextHandler:\nvoid SAL_CALL ShapeContextHandler::startFastElement\n(::sal_Int32 Element,\n const uno::Reference< xml::sax::XFastAttributeList > & Attribs)\n    throw (uno::RuntimeException, xml::sax::SAXException)\n{\n    static const ::rtl::OUString sInputStream\n        (RTL_CONSTASCII_USTRINGPARAM (\"InputStream\"));\n\n    uno::Sequence<beans::PropertyValue> aSeq(1);\n    aSeq[0].Name = sInputStream;\n    aSeq[0].Value <<= mxInputStream;\n    mxFilterBase->filter(aSeq);\n\n    mpThemePtr.reset(new Theme());\n\n    uno::Reference<XFastContextHandler> xContextHandler(getContextHandler());\n\n    if (xContextHandler.is())\n        xContextHandler->startFastElement(Element, Attribs);\n}\n\nvoid SAL_CALL ShapeContextHandler::startUnknownElement\n(const ::rtl::OUString & Namespace, const ::rtl::OUString & Name,\n const uno::Reference< xml::sax::XFastAttributeList > & Attribs)\n    throw (uno::RuntimeException, xml::sax::SAXException)\n{\n    uno::Reference<XFastContextHandler> xContextHandler(getContextHandler());\n\n    if (xContextHandler.is())\n        xContextHandler->startUnknownElement(Namespace, Name, Attribs);\n}\n\nvoid SAL_CALL ShapeContextHandler::endFastElement(::sal_Int32 Element)\n    throw (uno::RuntimeException, xml::sax::SAXException)\n{\n    uno::Reference<XFastContextHandler> xContextHandler(getContextHandler());\n\n    if (xContextHandler.is())\n        xContextHandler->endFastElement(Element);\n}\n\nvoid SAL_CALL ShapeContextHandler::endUnknownElement\n(const ::rtl::OUString & Namespace,\n const ::rtl::OUString & Name)\n    throw (uno::RuntimeException, xml::sax::SAXException)\n{\n    uno::Reference<XFastContextHandler> xContextHandler(getContextHandler());\n\n    if (xContextHandler.is())\n        xContextHandler->endUnknownElement(Namespace, Name);\n}\n\nuno::Reference< xml::sax::XFastContextHandler > SAL_CALL\nShapeContextHandler::createFastChildContext\n(::sal_Int32 Element,\n const uno::Reference< xml::sax::XFastAttributeList > & Attribs)\n    throw (uno::RuntimeException, xml::sax::SAXException)\n{\n    uno::Reference< xml::sax::XFastContextHandler > xResult;\n    uno::Reference< xml::sax::XFastContextHandler > xContextHandler(getContextHandler());\n\n    if (xContextHandler.is())\n        xResult.set(xContextHandler->createFastChildContext\n                    (Element, Attribs));\n\n    return xResult;\n}\n\nuno::Reference< xml::sax::XFastContextHandler > SAL_CALL\nShapeContextHandler::createUnknownChildContext\n(const ::rtl::OUString & Namespace,\n const ::rtl::OUString & Name,\n const uno::Reference< xml::sax::XFastAttributeList > & Attribs)\n    throw (uno::RuntimeException, xml::sax::SAXException)\n{\n    uno::Reference<XFastContextHandler> xContextHandler(getContextHandler());\n\n    if (xContextHandler.is())\n        return xContextHandler->createUnknownChildContext\n            (Namespace, Name, Attribs);\n\n    return uno::Reference< xml::sax::XFastContextHandler >();\n}\n\nvoid SAL_CALL ShapeContextHandler::characters(const ::rtl::OUString & aChars)\n    throw (uno::RuntimeException, xml::sax::SAXException)\n{\n    uno::Reference<XFastContextHandler> xContextHandler(getContextHandler());\n\n    if (xContextHandler.is())\n        xContextHandler->characters(aChars);\n}\n\n\/\/ ::com::sun::star::xml::sax::XFastShapeContextHandler:\nuno::Reference< drawing::XShape > SAL_CALL\nShapeContextHandler::getShape() throw (uno::RuntimeException)\n{\n    uno::Reference< drawing::XShape > xResult;\n    uno::Reference< drawing::XShapes > xShapes( mxDrawPage, uno::UNO_QUERY );\n\n    if (mxFilterBase.is() && xShapes.is())\n    {\n        if ( getContextHandler() == getDrawingShapeContext() )\n        {\n            mpDrawing->finalizeFragmentImport();\n            if( const ::oox::vml::ShapeBase* pShape = mpDrawing->getShapes().getFirstShape() )\n            {\n                xResult = pShape->convertAndInsert( xShapes );\n                mpDrawing->getShapes( ).clearShapes( );\n            }\n        }\n        else if (mpShape.get() != NULL)\n        {\n            basegfx::B2DHomMatrix aTransformation;\n            mpShape->addShape(*mxFilterBase, mpThemePtr.get(), xShapes, aTransformation);\n            xResult.set(mpShape->getXShape());\n            mxGraphicShapeContext.clear( );\n        }\n    }\n\n    return xResult;\n}\n\ncss::uno::Reference< css::drawing::XDrawPage > SAL_CALL\nShapeContextHandler::getDrawPage() throw (css::uno::RuntimeException)\n{\n    return mxDrawPage;\n}\n\nvoid SAL_CALL ShapeContextHandler::setDrawPage\n(const css::uno::Reference< css::drawing::XDrawPage > & the_value)\n    throw (css::uno::RuntimeException)\n{\n    mxDrawPage = the_value;\n}\n\ncss::uno::Reference< css::frame::XModel > SAL_CALL\nShapeContextHandler::getModel() throw (css::uno::RuntimeException)\n{\n    if( !mxFilterBase.is() )\n        throw uno::RuntimeException();\n    return mxFilterBase->getModel();\n}\n\nvoid SAL_CALL ShapeContextHandler::setModel\n(const css::uno::Reference< css::frame::XModel > & the_value)\n    throw (css::uno::RuntimeException)\n{\n    if( !mxFilterBase.is() )\n        throw uno::RuntimeException();\n    uno::Reference<lang::XComponent> xComp(the_value, uno::UNO_QUERY_THROW);\n    mxFilterBase->setTargetDocument(xComp);\n}\n\nuno::Reference< io::XInputStream > SAL_CALL\nShapeContextHandler::getInputStream() throw (uno::RuntimeException)\n{\n    return mxInputStream;\n}\n\nvoid SAL_CALL ShapeContextHandler::setInputStream\n(const uno::Reference< io::XInputStream > & the_value)\n    throw (uno::RuntimeException)\n{\n    mxInputStream = the_value;\n}\n\n::rtl::OUString SAL_CALL ShapeContextHandler::getRelationFragmentPath()\n    throw (uno::RuntimeException)\n{\n    return msRelationFragmentPath;\n}\n\nvoid SAL_CALL ShapeContextHandler::setRelationFragmentPath\n(const ::rtl::OUString & the_value)\n    throw (uno::RuntimeException)\n{\n    msRelationFragmentPath = the_value;\n}\n\n::sal_Int32 SAL_CALL ShapeContextHandler::getStartToken() throw (::com::sun::star::uno::RuntimeException)\n{\n    return mnStartToken;\n}\n\nvoid SAL_CALL ShapeContextHandler::setStartToken( ::sal_Int32 _starttoken ) throw (::com::sun::star::uno::RuntimeException)\n{\n    mnStartToken = _starttoken;\n\n\n}\n\n::rtl::OUString ShapeContextHandler::getImplementationName()\n    throw (css::uno::RuntimeException)\n{\n    return ShapeContextHandler_getImplementationName();\n}\n\nuno::Sequence< ::rtl::OUString > ShapeContextHandler::getSupportedServiceNames()\n    throw (css::uno::RuntimeException)\n{\n    return ShapeContextHandler_getSupportedServiceNames();\n}\n\n::sal_Bool SAL_CALL ShapeContextHandler::supportsService\n(const ::rtl::OUString & ServiceName) throw (css::uno::RuntimeException)\n{\n    uno::Sequence< ::rtl::OUString > aSeq = getSupportedServiceNames();\n\n    if (aSeq[0].equals(ServiceName))\n        return sal_True;\n\n    return sal_False;\n}\n\n}}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Licensed under the MIT License (MIT)\n *\n * Copyright (c) 2013 AudioScience Inc.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy of\n * this software and associated documentation files (the \"Software\"), to deal in\n * the Software without restriction, including without limitation the rights to\n * use, copy, modify, merge, publish, distribute, sublicense, and\/or sell copies of\n * the Software, and to permit persons to whom the Software is furnished to do so,\n * subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS\n * FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\n * COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\n * IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n *\/\n\n\/**\n * avdecc_cmd_line_main.cpp\n *\n * AVDECC command line main implementation used for testing command line interface.\n *\/\n\n\n#include <iostream>\n#include <fstream>\n#include <iomanip>\n#include <string>\n#include <vector>\n#include <cstdint>\n\n#include <stdexcept>\n#include \"cmd_line.h\"\n#if defined(__MACH__)\n#include <readline\/readline.h>\n#include <readline\/history.h>\n#elif defined(__linux__)\n#include <editline\/readline.h>\n#include <inttypes.h>\n#endif\n\n#if defined(__MACH__) || defined(__linux__)\n#include <unistd.h>\n#else\n#include \"getopt.h\"\n#endif\n\nusing namespace std;\n\nextern \"C\" void notification_callback(void *user_obj, int32_t notification_type, uint64_t guid, uint16_t cmd_type,\n                                      uint16_t desc_type, uint16_t desc_index, uint32_t cmd_status,\n                                      void *notification_id)\n{\n    if(notification_type == avdecc_lib::COMMAND_TIMEOUT || notification_type == avdecc_lib::RESPONSE_RECEIVED)\n    {\n        const char *cmd_name;\n        const char *desc_name;\n        const char *cmd_status_name;\n\n        if(cmd_type < avdecc_lib::CMD_LOOKUP)\n        {\n            cmd_name = cmd_line::utility->aem_cmd_value_to_name(cmd_type);\n            desc_name = cmd_line::utility->aem_desc_value_to_name(desc_type);\n            cmd_status_name = cmd_line::utility->aem_cmd_status_value_to_name(cmd_status);\n        }\n        else\n        {\n            cmd_name = cmd_line::utility->acmp_cmd_value_to_name(cmd_type - avdecc_lib::CMD_LOOKUP);\n            desc_name = \"NULL\";\n            cmd_status_name = cmd_line::utility->acmp_cmd_status_value_to_name(cmd_status);\n        }\n\n        printf(\"\\n[NOTIFICATION] (%s, 0x%llx, %s, %s, %d, %s, %p)\\n\",\n               cmd_line::utility->notification_value_to_name(notification_type),\n               guid,\n               cmd_name,\n               desc_name,\n               desc_index,\n               cmd_status_name,\n               notification_id);\n    }\n    else\n    {\n        printf(\"\\n[NOTIFICATION] (%s, 0x%llx, %d, %d, %d, %d, %p)\\n\",\n               cmd_line::utility->notification_value_to_name(notification_type),\n               guid,\n               cmd_type,\n               desc_type,\n               desc_index,\n               cmd_status,\n               notification_id);\n    }\n}\n\nextern \"C\" void log_callback(void *user_obj, int32_t log_level, const char *log_msg, int32_t time_stamp_ms)\n{\n    printf(\"\\n[LOG] %s (%s)\\n\", cmd_line::utility->logging_level_value_to_name(log_level), log_msg);\n}\n\nstatic void usage(char *argv[])\n{\n    std::cerr << \"Usage: \" << argv[0] << \" [-d] [-i interface]\" << std::endl;\n    std::cerr << \"  -t           :  Sets test mode which disables checks\" << std::endl;\n    std::cerr << \"  -i interface :  Sets the name of the interface to use\" << std::endl;\n    exit(1);\n}\n\nint main(int argc, char *argv[])\n{\n    bool test_mode = false;\n    int error = 0;\n    char *interface = NULL;\n    int c = 0;\n    while ((c = getopt(argc, argv, \"ti:\")) != -1) {\n        switch (c) {\n            case 't':\n                test_mode = true;\n                break;\n            case 'i':\n                interface = optarg;\n                break;\n            case ':':\n                fprintf(stderr, \"Option -%c requires an operand\\n\", optopt);\n                error++;\n                break;\n            case '?':\n                fprintf(stderr, \"Unrecognized option: '-%c'\\n\", optopt);\n                error++;\n                break;\n        }\n    }\n\n    for ( ; optind < argc; optind++) {\n        error++; \/\/ Unused arguments\n    }\n\n    if (error)\n    {\n        usage(argv);\n    }\n\n    if (test_mode)\n    {\n        \/\/ Ensure that stdout is not buffered\n        setvbuf(stdout, NULL, _IOLBF, 0);\n    }\n\n    cmd_line *avdecc_cmd_line_ref = new cmd_line(notification_callback, log_callback, test_mode, interface);\n\n    std::vector<std::string> input_argv;\n    size_t pos = 0;\n    bool done = false;\n    bool is_input_valid = false;\n    std::string cmd_input_orig;\n#if defined(__MACH__) || defined(__linux__)\n    char* input, shell_prompt[100];\n#endif\n\n\n    std::cout << \"\\nEnter \\\"help\\\" for a list of valid commands.\" << std::endl;\n\n    while(!done)\n    {\n#if defined(__MACH__) || defined(__linux__)\n        snprintf(shell_prompt, sizeof(shell_prompt), \"$ \");\n        input = readline(shell_prompt);\n\n        if (!input)\n            break;\n        if (strlen(input) == 0)\n            continue;\n        std::string cmd_input(input);\n        cmd_input_orig = cmd_input;\n        add_history(input);\n#else \n        std::string cmd_input;\n        printf(\"\\n>\");\n        std::getline(std::cin, cmd_input);\n        cmd_input_orig = cmd_input;\n#endif\n\n        while((pos = cmd_input.find(\" \")) != std::string::npos)\n        {\n            if (pos)\n              input_argv.push_back(cmd_input.substr(0, pos));\n\n            cmd_input.erase(0, pos + 1);\n        }\n\n        if(cmd_input != \" \")\n        {\n            input_argv.push_back(cmd_input);\n        }\n\n        if(avdecc_cmd_line_ref->is_output_redirected())\n        {\n            std::cout << \"\\n> \" << cmd_input_orig << std::endl;\n        }\n\n        done = avdecc_cmd_line_ref->handle(input_argv);\n\n        is_input_valid = false;\n        input_argv.clear();\n#if defined(__MACH__) || defined(__linux__)\n        free(input);\n#endif\n    }\n\n    delete avdecc_cmd_line_ref;\n    return 0;\n}\n<commit_msg>Use the stack rather than heap for variable that doesn't go out of scope.<commit_after>\/*\n * Licensed under the MIT License (MIT)\n *\n * Copyright (c) 2013 AudioScience Inc.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy of\n * this software and associated documentation files (the \"Software\"), to deal in\n * the Software without restriction, including without limitation the rights to\n * use, copy, modify, merge, publish, distribute, sublicense, and\/or sell copies of\n * the Software, and to permit persons to whom the Software is furnished to do so,\n * subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS\n * FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\n * COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\n * IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n *\/\n\n\/**\n * avdecc_cmd_line_main.cpp\n *\n * AVDECC command line main implementation used for testing command line interface.\n *\/\n\n\n#include <iostream>\n#include <fstream>\n#include <iomanip>\n#include <string>\n#include <vector>\n#include <cstdint>\n\n#include <stdexcept>\n#include \"cmd_line.h\"\n#if defined(__MACH__)\n#include <readline\/readline.h>\n#include <readline\/history.h>\n#elif defined(__linux__)\n#include <editline\/readline.h>\n#include <inttypes.h>\n#endif\n\n#if defined(__MACH__) || defined(__linux__)\n#include <unistd.h>\n#else\n#include \"getopt.h\"\n#endif\n\nusing namespace std;\n\nextern \"C\" void notification_callback(void *user_obj, int32_t notification_type, uint64_t guid, uint16_t cmd_type,\n                                      uint16_t desc_type, uint16_t desc_index, uint32_t cmd_status,\n                                      void *notification_id)\n{\n    if(notification_type == avdecc_lib::COMMAND_TIMEOUT || notification_type == avdecc_lib::RESPONSE_RECEIVED)\n    {\n        const char *cmd_name;\n        const char *desc_name;\n        const char *cmd_status_name;\n\n        if(cmd_type < avdecc_lib::CMD_LOOKUP)\n        {\n            cmd_name = cmd_line::utility->aem_cmd_value_to_name(cmd_type);\n            desc_name = cmd_line::utility->aem_desc_value_to_name(desc_type);\n            cmd_status_name = cmd_line::utility->aem_cmd_status_value_to_name(cmd_status);\n        }\n        else\n        {\n            cmd_name = cmd_line::utility->acmp_cmd_value_to_name(cmd_type - avdecc_lib::CMD_LOOKUP);\n            desc_name = \"NULL\";\n            cmd_status_name = cmd_line::utility->acmp_cmd_status_value_to_name(cmd_status);\n        }\n\n        printf(\"\\n[NOTIFICATION] (%s, 0x%llx, %s, %s, %d, %s, %p)\\n\",\n               cmd_line::utility->notification_value_to_name(notification_type),\n               guid,\n               cmd_name,\n               desc_name,\n               desc_index,\n               cmd_status_name,\n               notification_id);\n    }\n    else\n    {\n        printf(\"\\n[NOTIFICATION] (%s, 0x%llx, %d, %d, %d, %d, %p)\\n\",\n               cmd_line::utility->notification_value_to_name(notification_type),\n               guid,\n               cmd_type,\n               desc_type,\n               desc_index,\n               cmd_status,\n               notification_id);\n    }\n}\n\nextern \"C\" void log_callback(void *user_obj, int32_t log_level, const char *log_msg, int32_t time_stamp_ms)\n{\n    printf(\"\\n[LOG] %s (%s)\\n\", cmd_line::utility->logging_level_value_to_name(log_level), log_msg);\n}\n\nstatic void usage(char *argv[])\n{\n    std::cerr << \"Usage: \" << argv[0] << \" [-d] [-i interface]\" << std::endl;\n    std::cerr << \"  -t           :  Sets test mode which disables checks\" << std::endl;\n    std::cerr << \"  -i interface :  Sets the name of the interface to use\" << std::endl;\n    exit(1);\n}\n\nint main(int argc, char *argv[])\n{\n    bool test_mode = false;\n    int error = 0;\n    char *interface = NULL;\n    int c = 0;\n    while ((c = getopt(argc, argv, \"ti:\")) != -1) {\n        switch (c) {\n            case 't':\n                test_mode = true;\n                break;\n            case 'i':\n                interface = optarg;\n                break;\n            case ':':\n                fprintf(stderr, \"Option -%c requires an operand\\n\", optopt);\n                error++;\n                break;\n            case '?':\n                fprintf(stderr, \"Unrecognized option: '-%c'\\n\", optopt);\n                error++;\n                break;\n        }\n    }\n\n    for ( ; optind < argc; optind++) {\n        error++; \/\/ Unused arguments\n    }\n\n    if (error)\n    {\n        usage(argv);\n    }\n\n    if (test_mode)\n    {\n        \/\/ Ensure that stdout is not buffered\n        setvbuf(stdout, NULL, _IOLBF, 0);\n    }\n\n    cmd_line avdecc_cmd_line_ref(notification_callback, log_callback, test_mode, interface);\n\n    std::vector<std::string> input_argv;\n    size_t pos = 0;\n    bool done = false;\n    bool is_input_valid = false;\n    std::string cmd_input_orig;\n#if defined(__MACH__) || defined(__linux__)\n    char* input, shell_prompt[100];\n#endif\n\n\n    std::cout << \"\\nEnter \\\"help\\\" for a list of valid commands.\" << std::endl;\n\n    while(!done)\n    {\n#if defined(__MACH__) || defined(__linux__)\n        snprintf(shell_prompt, sizeof(shell_prompt), \"$ \");\n        input = readline(shell_prompt);\n\n        if (!input)\n            break;\n        if (strlen(input) == 0)\n            continue;\n        std::string cmd_input(input);\n        cmd_input_orig = cmd_input;\n        add_history(input);\n#else \n        std::string cmd_input;\n        printf(\"\\n>\");\n        std::getline(std::cin, cmd_input);\n        cmd_input_orig = cmd_input;\n#endif\n\n        while((pos = cmd_input.find(\" \")) != std::string::npos)\n        {\n            if (pos)\n              input_argv.push_back(cmd_input.substr(0, pos));\n\n            cmd_input.erase(0, pos + 1);\n        }\n\n        if(cmd_input != \" \")\n        {\n            input_argv.push_back(cmd_input);\n        }\n\n        if(avdecc_cmd_line_ref.is_output_redirected())\n        {\n            std::cout << \"\\n> \" << cmd_input_orig << std::endl;\n        }\n\n        done = avdecc_cmd_line_ref.handle(input_argv);\n\n        is_input_valid = false;\n        input_argv.clear();\n#if defined(__MACH__) || defined(__linux__)\n        free(input);\n#endif\n    }\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"palabos3D.h\"\n#include \"palabos3D.hh\"\n#include <vector>\n#include <cmath>\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\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\nint main(int argc, char **argv){\n    plbInit(&argc, &argv);\n    std::string fNameOut = \"tmp\";\n\n    const plint nx = 200;\n    const plint ny = 200;\n    const plint nz = 200;\n    const T lattice_speed_sound = 1\/sqrt(3);\n\n    const T omega = 1.985;\n    const plint maxT = 120000;\n\n    Array<T,3> u0(0, 0, 0);\n\n    global::directories().setOutputDir(fNameOut+\"\/\");\n\n    \/\/Build geometry\n    Array<T,3> centerLB(nx\/2, ny\/2, nz\/2);\n    \/\/TriangleSet<T> triangleSet(\"Duto_Fechado.STL\");\n    \/\/Array<T,3> center(param.cx, param.cy, param.cz);\n    TriangleSet<T> triangleSet;\n    pcout << \"construindo o duto\" << std::endl;\n    \/*\n    (Array<T,3> const& inletCenter, T externRadius, T internRadius,\n                                 T length, plint nAxial, plint nCirc)\n                                 *\/\n    triangleSet = constructDuct(centerLB, (T) 30, (T) 26, (T) 50, (plint) 10, (plint) 50);\n\n    \/\/triangleSet = constructSphere<T>(centerLB, (T) 10, (plint)40);\n    \/*TriangleSet<T> triangleSet(\"duto_fechado.STL\");\n    triangleSet.translate(centerLB);*\/\n    \/\/ rotate: Z, X, Y in radians\n    \/\/triangleSet.rotate((T) 0, (T) 0, (T) 0);       \n    \/\/triangleSet.scale((T) 3.95253e+2);\n\n    \/\/   tube to more efficient data structures that are internally used by palabos.\n    \/\/   The TriangleBoundary3D structure will be later used to assign proper boundary conditions.\n    plint borderWidth = 1;  \/\/ Because the Guo boundary condition acts in a one-cell layer.\n                        \/\/ Requirement: margin>=borderWidth.\n    plint margin      = 1;  \/\/ Extra margin of allocated cells around the obstacle.\n    plint extraLayer  = 0;  \/\/ Make the bounding box larger; for visualization purposes\n                        \/\/   only. For the simulation, it is OK to have extraLayer=0.\n    plint xDirection = 0;\n    DEFscaledMesh<T> defMesh(triangleSet, 0, xDirection, margin, Dot3D(0, 0, 0));\n    defMesh.setDx((T) 1.);\n\n    pcout << \"Valor do Dx: \" << defMesh.getDx() << std::endl;\n    Array<T, 3> physical_position = defMesh.getPhysicalLocation();\n    pcout << \"posicao fisica em x: \" << physical_position[0] << std::endl;\n    pcout << \"posicao fisica em y: \" << physical_position[1] << std::endl;\n    pcout << \"posicao fisica em z: \" << physical_position[2] << std::endl;\n    \/\/Array< T, 3 > position_lattice(50, ny\/2, nz\/2);\n    \/\/defMesh.setPhysicalLocation(position_lattice);\n    Array<T, 3> physical_position_c = defMesh.getPhysicalLocation();\n    pcout << \"posicao fisica em x_c: \" << physical_position_c[0] << std::endl;\n    pcout << \"posicao fisica em y_c: \" << physical_position_c[1] << std::endl;\n    pcout << \"posicao fisica em z_c: \" << physical_position_c[2] << std::endl;\n    defMesh.getMesh().inflate();\n    TriangleBoundary3D<T> boundary(defMesh);\n\n    boundary.getMesh().writeBinarySTL(\"duct.stl\");\n    pcout << \"Number of triangles: \" << boundary.getMesh().getNumTriangles() << std::endl;\n    \/\/   handled by the following voxelization process.\n    pcout << std::endl << \"Voxelizing the domain.\" << std::endl;\n    const int flowType = voxelFlag::outside;\n    const plint extendedEnvelopeWidth = 2;\n    const plint blockSize = 0; \/\/ Zero means: no sparse representation.\n     \/\/ Because the Guo boundary condition needs 2-cell neighbor access.\n    Box3D full_domain(0, nx-1, 0, ny-1, 0, nz-1);\n    VoxelizedDomain3D<T> voxelizedDomain (\n            boundary, flowType, full_domain, borderWidth, extendedEnvelopeWidth, blockSize);\n    pcout << getMultiBlockInfo(voxelizedDomain.getVoxelMatrix()) << std::endl;\n\n    \/\/ Build lattice and set default dynamics\n    \/\/-------------------------------------\n    MultiBlockLattice3D<T,DESCRIPTOR> *lattice = \n    new MultiBlockLattice3D<T,DESCRIPTOR>(voxelizedDomain.getVoxelMatrix());\n\n    \/\/ Setting anechoic dynamics like this way\n    defineDynamics(*lattice, lattice->getBoundingBox(),\n                new AnechoicBackgroundDynamics(omega));\n    defineDynamics(*lattice, lattice->getBoundingBox(),\n                new BackgroundDynamics(omega));\n    \/\/-------------------------------------\n\n    \/\/Set geometry in lattice\n     \/\/ The Guo off *lattice boundary condition is set up.\n    pcout << \"Creating boundary condition.\" << std::endl;\n    \/*BoundaryProfiles3D<T,Velocity> profiles;\n    \n    bool useAllDirections = true; \/\/ Extrapolation scheme for the off *lattice boundary condition.\n    GuoOffLatticeModel3D<T,DESCRIPTOR>* model =\n            new GuoOffLatticeModel3D<T,DESCRIPTOR> (\n                new TriangleFlowShape3D<T,Array<T,3> > (\n                    voxelizedDomain.getBoundary(), profiles),\n                flowType, useAllDirections );\n    bool useRegularized = true;\n    \/\/ Use an off *lattice boundary condition which is closer in spirit to\n    \/\/   regularized boundary conditions.\n    model->selectUseRegularizedModel(useRegularized);*\/\n\n   \/* BoundaryProfiles3D<T,Velocity> profiles;\n    bool useAllDirections=true;\n    OffLatticeModel3D<T,Velocity>* offLatticeModel=0;\n    profiles.setWallProfile(new NoSlipProfile3D<T>);\n    offLatticeModel =\n         new GuoOffLatticeModel3D<T,DESCRIPTOR> (\n            new TriangleFlowShape3D<T,Array<T,3> >(voxelizedDomain.getBoundary(), profiles),\n            flowType, useAllDirections );\n    offLatticeModel->setVelIsJ(false);\n    OffLatticeBoundaryCondition3D<T,DESCRIPTOR,Velocity> *boundaryCondition;\n    boundaryCondition = new OffLatticeBoundaryCondition3D<T,DESCRIPTOR,Velocity>(\n            offLatticeModel, voxelizedDomain, *lattice);\n    boundaryCondition->insert();*\/\n\n\n\n\n\n\n    \/\/Set geometry in lattice\n     \/\/ The Guo off *lattice boundary condition is set up.\n    pcout << \"Creating boundary condition.\" << std::endl;\n    BoundaryProfiles3D<T,Velocity> profiles;\n    \/\/profiles.setWallProfile(new NoSlipProfile3D<T>);\n    \n    bool useAllDirections = true; \/\/ Extrapolation scheme for the off *lattice boundary condition.\n    GuoOffLatticeModel3D<T,DESCRIPTOR>* model =\n            new GuoOffLatticeModel3D<T,DESCRIPTOR> (\n                new TriangleFlowShape3D<T,Array<T,3> > (\n                    voxelizedDomain.getBoundary(), profiles),\n                flowType, useAllDirections );\n    bool useRegularized = true;\n    \/\/ Use an off *lattice boundary condition which is closer in spirit to\n    \/\/   regularized boundary conditions.\n    model->selectUseRegularizedModel(useRegularized);\n    \/\/ ---\n    OffLatticeBoundaryCondition3D<T,DESCRIPTOR,Velocity> boundaryCondition (\n            model, voxelizedDomain, *lattice);\n    boundaryCondition.insert();\n    defineDynamics(*lattice, voxelizedDomain.getVoxelMatrix(),\n     lattice->getBoundingBox(), new NoDynamics<T,DESCRIPTOR>(-999), voxelFlag::inside);\n\n    pcout << \"Creation of the lattice.\" << 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    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(velocity_flow, 0, 0);\n    T size_anechoic_buffer = 20;\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    plb_ofstream history_pressures(\"tmp\/history_pressures.dat\");\n    plb_ofstream history_velocities_x(\"tmp\/history_velocities_x.dat\");\n    plb_ofstream history_velocities_y(\"tmp\/history_velocities_y.dat\");\n    plb_ofstream history_velocities_z(\"tmp\/history_velocities_z.dat\");\n    for (plint iT=0; iT<maxT; ++iT){\n        if (iT != 0){\n            T lattice_speed_sound = 1\/sqrt(3);\n            T rho_changing = 1. + drho*sin(2*M_PI*(lattice_speed_sound\/20)*iT);\n            Box3D impulse(nx\/2 + 50, nx\/2 + 50, ny\/2 + 50, ny\/2 + 50, nz\/2 + 50, nz\/2 + 50);\n            initializeAtEquilibrium( *lattice, impulse, rho_changing, u0);\n        }\n\n        if (iT % 10 == 0 && iT>0) {\n            pcout << \"Iteration \" << iT << endl;\n            \/\/writeGifs(lattice,iT);\n            writeVTK(*lattice, iT);\n        }\n\n        history_pressures << setprecision(10) << lattice->get(nx\/2+30, ny\/2+30, nz\/2+30).computeDensity() - rho0 << endl;\n        Array<T,3> velocities;\n        lattice->get(nx\/2+30, ny\/2+30, nz\/2+30).computeVelocity(velocities);\n        history_velocities_x << setprecision(10) << velocities[0]\/lattice_speed_sound << endl;\n        history_velocities_y << setprecision(10) << velocities[1]\/lattice_speed_sound << endl;\n        history_velocities_z << setprecision(10) << velocities[2]\/lattice_speed_sound << endl;\n        lattice->collideAndStream();\n\n    }\n\n    pcout << \"End of simulation at iteration \" << endl;\n}\n<commit_msg>Duct with big size<commit_after>#include \"palabos3D.h\"\n#include \"palabos3D.hh\"\n#include <vector>\n#include <cmath>\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\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\nint main(int argc, char **argv){\n    plbInit(&argc, &argv);\n    std::string fNameOut = \"tmp\";\n\n    const plint nx = 300;\n    const plint ny = 200;\n    const plint nz = 200;\n    const T lattice_speed_sound = 1\/sqrt(3);\n\n    const T omega = 1.985;\n    const plint maxT = 120000;\n\n    Array<T,3> u0(0, 0, 0);\n\n    global::directories().setOutputDir(fNameOut+\"\/\");\n\n    \/\/Build geometry\n    Array<T,3> centerLB(10, ny\/2, nz\/2);\n    \/\/TriangleSet<T> triangleSet(\"Duto_Fechado.STL\");\n    \/\/Array<T,3> center(param.cx, param.cy, param.cz);\n    TriangleSet<T> triangleSet;\n    pcout << \"construindo o duto\" << std::endl;\n    \/*\n    (Array<T,3> const& inletCenter, T externRadius, T internRadius,\n                                 T length, plint nAxial, plint nCirc)\n                                 *\/\n    T thickness_duct = 4;\n    T radius = 20;\n    triangleSet = constructDuct(centerLB, radius + thickness_duct, radius\n    , (T) 250, (plint) 10, (plint) 50);\n\n    \/\/triangleSet = constructSphere<T>(centerLB, (T) 10, (plint)40);\n    \/*TriangleSet<T> triangleSet(\"duto_fechado.STL\");\n    triangleSet.translate(centerLB);*\/\n    \/\/ rotate: Z, X, Y in radians\n    \/\/triangleSet.rotate((T) 0, (T) 0, (T) 0);       \n    \/\/triangleSet.scale((T) 3.95253e+2);\n\n    \/\/   tube to more efficient data structures that are internally used by palabos.\n    \/\/   The TriangleBoundary3D structure will be later used to assign proper boundary conditions.\n    plint borderWidth = 1;  \/\/ Because the Guo boundary condition acts in a one-cell layer.\n                        \/\/ Requirement: margin>=borderWidth.\n    plint margin      = 1;  \/\/ Extra margin of allocated cells around the obstacle.\n    plint extraLayer  = 0;  \/\/ Make the bounding box larger; for visualization purposes\n                        \/\/   only. For the simulation, it is OK to have extraLayer=0.\n    plint xDirection = 0;\n    DEFscaledMesh<T> defMesh(triangleSet, 0, xDirection, margin, Dot3D(0, 0, 0));\n    defMesh.setDx((T) 1.);\n\n    pcout << \"Valor do Dx: \" << defMesh.getDx() << std::endl;\n    Array<T, 3> physical_position = defMesh.getPhysicalLocation();\n    pcout << \"posicao fisica em x: \" << physical_position[0] << std::endl;\n    pcout << \"posicao fisica em y: \" << physical_position[1] << std::endl;\n    pcout << \"posicao fisica em z: \" << physical_position[2] << std::endl;\n    \/\/Array< T, 3 > position_lattice(50, ny\/2, nz\/2);\n    \/\/defMesh.setPhysicalLocation(position_lattice);\n    Array<T, 3> physical_position_c = defMesh.getPhysicalLocation();\n    pcout << \"posicao fisica em x_c: \" << physical_position_c[0] << std::endl;\n    pcout << \"posicao fisica em y_c: \" << physical_position_c[1] << std::endl;\n    pcout << \"posicao fisica em z_c: \" << physical_position_c[2] << std::endl;\n    defMesh.getMesh().inflate();\n    TriangleBoundary3D<T> boundary(defMesh);\n\n    boundary.getMesh().writeBinarySTL(\"duct.stl\");\n    pcout << \"Number of triangles: \" << boundary.getMesh().getNumTriangles() << std::endl;\n    \/\/   handled by the following voxelization process.\n    pcout << std::endl << \"Voxelizing the domain.\" << std::endl;\n    const int flowType = voxelFlag::outside;\n    const plint extendedEnvelopeWidth = 2;\n    const plint blockSize = 0; \/\/ Zero means: no sparse representation.\n     \/\/ Because the Guo boundary condition needs 2-cell neighbor access.\n    Box3D full_domain(0, nx-1, 0, ny-1, 0, nz-1);\n    VoxelizedDomain3D<T> voxelizedDomain (\n            boundary, flowType, full_domain, borderWidth, extendedEnvelopeWidth, blockSize);\n    pcout << getMultiBlockInfo(voxelizedDomain.getVoxelMatrix()) << std::endl;\n\n    \/\/ Build lattice and set default dynamics\n    \/\/-------------------------------------\n    MultiBlockLattice3D<T,DESCRIPTOR> *lattice = \n    new MultiBlockLattice3D<T,DESCRIPTOR>(voxelizedDomain.getVoxelMatrix());\n\n    \/\/ Setting anechoic dynamics like this way\n    defineDynamics(*lattice, lattice->getBoundingBox(),\n                new AnechoicBackgroundDynamics(omega));\n    defineDynamics(*lattice, lattice->getBoundingBox(),\n                new BackgroundDynamics(omega));\n    \/\/-------------------------------------\n\n    \/\/Set geometry in lattice\n     \/\/ The Guo off *lattice boundary condition is set up.\n    pcout << \"Creating boundary condition.\" << std::endl;\n    \/*BoundaryProfiles3D<T,Velocity> profiles;\n    \n    bool useAllDirections = true; \/\/ Extrapolation scheme for the off *lattice boundary condition.\n    GuoOffLatticeModel3D<T,DESCRIPTOR>* model =\n            new GuoOffLatticeModel3D<T,DESCRIPTOR> (\n                new TriangleFlowShape3D<T,Array<T,3> > (\n                    voxelizedDomain.getBoundary(), profiles),\n                flowType, useAllDirections );\n    bool useRegularized = true;\n    \/\/ Use an off *lattice boundary condition which is closer in spirit to\n    \/\/   regularized boundary conditions.\n    model->selectUseRegularizedModel(useRegularized);*\/\n\n   \/* BoundaryProfiles3D<T,Velocity> profiles;\n    bool useAllDirections=true;\n    OffLatticeModel3D<T,Velocity>* offLatticeModel=0;\n    profiles.setWallProfile(new NoSlipProfile3D<T>);\n    offLatticeModel =\n         new GuoOffLatticeModel3D<T,DESCRIPTOR> (\n            new TriangleFlowShape3D<T,Array<T,3> >(voxelizedDomain.getBoundary(), profiles),\n            flowType, useAllDirections );\n    offLatticeModel->setVelIsJ(false);\n    OffLatticeBoundaryCondition3D<T,DESCRIPTOR,Velocity> *boundaryCondition;\n    boundaryCondition = new OffLatticeBoundaryCondition3D<T,DESCRIPTOR,Velocity>(\n            offLatticeModel, voxelizedDomain, *lattice);\n    boundaryCondition->insert();*\/\n\n\n\n\n\n\n    \/\/Set geometry in lattice\n     \/\/ The Guo off *lattice boundary condition is set up.\n    pcout << \"Creating boundary condition.\" << std::endl;\n    BoundaryProfiles3D<T,Velocity> profiles;\n    \/\/profiles.setWallProfile(new NoSlipProfile3D<T>);\n    \n    bool useAllDirections = true; \/\/ Extrapolation scheme for the off *lattice boundary condition.\n    GuoOffLatticeModel3D<T,DESCRIPTOR>* model =\n            new GuoOffLatticeModel3D<T,DESCRIPTOR> (\n                new TriangleFlowShape3D<T,Array<T,3> > (\n                    voxelizedDomain.getBoundary(), profiles),\n                flowType, useAllDirections );\n    bool useRegularized = true;\n    \/\/ Use an off *lattice boundary condition which is closer in spirit to\n    \/\/   regularized boundary conditions.\n    model->selectUseRegularizedModel(useRegularized);\n    \/\/ ---\n    OffLatticeBoundaryCondition3D<T,DESCRIPTOR,Velocity> boundaryCondition (\n            model, voxelizedDomain, *lattice);\n    boundaryCondition.insert();\n    defineDynamics(*lattice, voxelizedDomain.getVoxelMatrix(),\n     lattice->getBoundingBox(), new NoDynamics<T,DESCRIPTOR>(-999), voxelFlag::inside);\n\n    pcout << \"Creation of the lattice.\" << 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    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(velocity_flow, 0, 0);\n    T size_anechoic_buffer = 20;\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    plb_ofstream history_pressures(\"tmp\/history_pressures.dat\");\n    plb_ofstream history_velocities_x(\"tmp\/history_velocities_x.dat\");\n    plb_ofstream history_velocities_y(\"tmp\/history_velocities_y.dat\");\n    plb_ofstream history_velocities_z(\"tmp\/history_velocities_z.dat\");\n    for (plint iT=0; iT<maxT; ++iT){\n        if (iT != 0){\n            T lattice_speed_sound = 1\/sqrt(3);\n            T rho_changing = 1. + drho*sin(2*M_PI*(lattice_speed_sound\/20)*iT);\n            \/\/Box3D impulse(nx\/2 + 50, nx\/2 + 50, ny\/2 + 50, ny\/2 + 50, nz\/2 + 50, nz\/2 + 50);\n            Box3D impulse(30, 30, ny\/2, ny\/2, nz\/2, nz\/2);\n            initializeAtEquilibrium( *lattice, impulse, rho_changing, u0);\n        }\n\n        if (iT % 10 == 0 && iT>0) {\n            pcout << \"Iteration \" << iT << endl;\n            \/\/writeGifs(lattice,iT);\n            writeVTK(*lattice, iT);\n        }\n\n        history_pressures << setprecision(10) << lattice->get(nx\/2+30, ny\/2+30, nz\/2+30).computeDensity() - rho0 << endl;\n        Array<T,3> velocities;\n        lattice->get(nx\/2+30, ny\/2+30, nz\/2+30).computeVelocity(velocities);\n        history_velocities_x << setprecision(10) << velocities[0]\/lattice_speed_sound << endl;\n        history_velocities_y << setprecision(10) << velocities[1]\/lattice_speed_sound << endl;\n        history_velocities_z << setprecision(10) << velocities[2]\/lattice_speed_sound << endl;\n        lattice->collideAndStream();\n\n    }\n\n    pcout << \"End of simulation at iteration \" << endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *   Copyright (C) 2014 Pelagicore AB\n *   All rights reserved.\n *\/\n#include \"gmock\/gmock.h\"\n#include \"gtest\/gtest.h\"\n\n#include <fcntl.h>\n\n#include \"abstractcontroller.h\"\n#include \"ipcmessage.h\"\n\nclass MockAbstractController :\n    public AbstractController\n{\npublic:\n    MOCK_METHOD0(runApp, int());\n    MOCK_METHOD0(killApp, void());\n    MOCK_METHOD2(setEnvironmentVariable, void(const std::string &, const std::string &));\n    MOCK_METHOD1(systemCall, void(const std::string &));\n};\n\nusing ::testing::InSequence;\nusing ::testing::Return;\nusing ::testing::NiceMock;\n\nTEST(IPCMessageTest, TestShouldCallRunAppAndKillApp) {\n    MockAbstractController controller;\n    IPCMessage message(controller);\n\n    std::string runAppCmd(\"1\");\n    std::string killAppCmd(\"2\");\n\n    \/\/ The calls should be made in the specific order as below:\n    {\n        InSequence sequence;\n        EXPECT_CALL(controller, runApp()).Times(1);\n        EXPECT_CALL(controller, killApp()).Times(1);\n    }\n\n    int status;\n    message.handleMessage(runAppCmd, &status);\n    message.handleMessage(killAppCmd, &status);\n}\n\nTEST(IPCMessageTest, TestShouldCallSystemCallWithExpectedArg) {\n    MockAbstractController controller;\n    IPCMessage message(controller);\n\n    std::string systemCallCmd(\"4 this is a system call\");\n\n    std::string expectedArgument(\"this is a system call\");\n    EXPECT_CALL(controller, systemCall(expectedArgument)).Times(1);\n\n    int status;\n    message.handleMessage(systemCallCmd, &status);\n}\n\nTEST(IPCMessageTest, TestShouldCallSetEnvironmentVariableWithExpectedArgs) {\n    MockAbstractController controller;\n    IPCMessage message(controller);\n\n    std::string setEnvironmentVariableCmd(\"3 THE_VARIABLE this is the value\");\n\n    std::string expectedVariable(\"THE_VARIABLE\");\n    std::string expectedValue(\"this is the value\");\n    EXPECT_CALL(controller, setEnvironmentVariable(expectedVariable, expectedValue)).Times(1);\n\n    int status;\n    message.handleMessage(setEnvironmentVariableCmd, &status);\n}\n\nTEST(IPCMessageTest, TestShouldSetErrorFlagAsExpected) {\n    NiceMock<MockAbstractController> controller;\n    IPCMessage message(controller);\n\n    int status = 123;\n    message.handleMessage(std::string(\"4 valid message\"), &status);\n    EXPECT_EQ(status, 0);\n\n    status = 123;\n    message.handleMessage(std::string(\"invalid message\"), &status);\n    EXPECT_EQ(status, -1);\n}\n\nTEST(IPCMessageTest, TestSendShouldReturnExpectedValue) {\n    NiceMock<MockAbstractController> controller;\n    IPCMessage message(controller);\n\n    std::string validMessage(\"4 valid message\");\n    std::string invalidMessage(\"invalid message\");\n    std::string killAppMessage(\"2\");\n\n    int status;\n    bool returnVal;\n\n    returnVal = message.handleMessage(validMessage, &status);\n    EXPECT_EQ(returnVal, true);\n\n    returnVal = message.handleMessage(invalidMessage, &status);\n    EXPECT_EQ(returnVal, true);\n\n    returnVal = message.handleMessage(killAppMessage, &status);\n    EXPECT_EQ(returnVal, false);\n}\n<commit_msg>ipcmessage_unittest.cpp: Added comments explaining the test cases.<commit_after>\/*\n *   Copyright (C) 2014 Pelagicore AB\n *   All rights reserved.\n *\/\n#include \"gmock\/gmock.h\"\n#include \"gtest\/gtest.h\"\n\n#include <fcntl.h>\n\n#include \"abstractcontroller.h\"\n#include \"ipcmessage.h\"\n\nclass MockAbstractController :\n    public AbstractController\n{\npublic:\n    MOCK_METHOD0(runApp, int());\n    MOCK_METHOD0(killApp, void());\n    MOCK_METHOD2(setEnvironmentVariable, void(const std::string &, const std::string &));\n    MOCK_METHOD1(systemCall, void(const std::string &));\n};\n\nusing ::testing::InSequence;\nusing ::testing::Return;\nusing ::testing::NiceMock;\n\n\/*! Test that Controller::runApp and Controller::killApp are called by IPCMessage\n * when the corresponding messages are passed to IPCMessage\n *\/\nTEST(IPCMessageTest, TestShouldCallRunAppAndKillApp) {\n    MockAbstractController controller;\n    IPCMessage message(controller);\n\n    std::string runAppCmd(\"1\");\n    std::string killAppCmd(\"2\");\n\n    \/\/ The calls should be made in the specific order as below:\n    {\n        InSequence sequence;\n        EXPECT_CALL(controller, runApp()).Times(1);\n        EXPECT_CALL(controller, killApp()).Times(1);\n    }\n\n    int status;\n    message.handleMessage(runAppCmd, &status);\n    message.handleMessage(killAppCmd, &status);\n}\n\n\/*! Test that Controller::systemCall is called with the expected argument\n * by IPCMessage.\n *\/\nTEST(IPCMessageTest, TestShouldCallSystemCallWithExpectedArg) {\n    MockAbstractController controller;\n    IPCMessage message(controller);\n\n    std::string systemCallCmd(\"4 this is a system call\");\n\n    std::string expectedArgument(\"this is a system call\");\n    EXPECT_CALL(controller, systemCall(expectedArgument)).Times(1);\n\n    int status;\n    message.handleMessage(systemCallCmd, &status);\n}\n\n\/*! Test that Controller::setEnvironmentVariable is called with the expected\n * arguments by IPCMessage.\n *\/\nTEST(IPCMessageTest, TestShouldCallSetEnvironmentVariableWithExpectedArgs) {\n    MockAbstractController controller;\n    IPCMessage message(controller);\n\n    std::string setEnvironmentVariableCmd(\"3 THE_VARIABLE this is the value\");\n\n    std::string expectedVariable(\"THE_VARIABLE\");\n    std::string expectedValue(\"this is the value\");\n    EXPECT_CALL(controller, setEnvironmentVariable(expectedVariable, expectedValue)).Times(1);\n\n    int status;\n    message.handleMessage(setEnvironmentVariableCmd, &status);\n}\n\n\/*! Test that IPCMessage sets status flag as expeced on a valid message and\n * an invalid message.\n *\/\nTEST(IPCMessageTest, TestShouldSetErrorFlagAsExpected) {\n    NiceMock<MockAbstractController> controller;\n    IPCMessage message(controller);\n\n    int status = 123;\n    message.handleMessage(std::string(\"4 valid message\"), &status);\n    EXPECT_EQ(status, 0);\n\n    status = 123;\n    message.handleMessage(std::string(\"invalid message\"), &status);\n    EXPECT_EQ(status, -1);\n}\n\n\/*! Test that IPCMessage returns the expected value. Valid and invalid messages\n * should get 'true' as a response, while a call to Controller::killApp should\n * result in 'false' as it means the IPC should stop sending more messages.\n *\/\nTEST(IPCMessageTest, TestSendShouldReturnExpectedValue) {\n    NiceMock<MockAbstractController> controller;\n    IPCMessage message(controller);\n\n    std::string validMessage(\"4 valid message\");\n    std::string invalidMessage(\"invalid message\");\n    std::string killAppMessage(\"2\");\n\n    int status;\n    bool returnVal;\n\n    returnVal = message.handleMessage(validMessage, &status);\n    EXPECT_EQ(returnVal, true);\n\n    returnVal = message.handleMessage(invalidMessage, &status);\n    EXPECT_EQ(returnVal, true);\n\n    returnVal = message.handleMessage(killAppMessage, &status);\n    EXPECT_EQ(returnVal, false);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <sys\/types.h>\n#include <sys\/sysctl.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n\n#include <iostream>\n#include <fstream>\n\n#include <CoreFoundation\/CoreFoundation.h>\n#include <SystemConfiguration\/SystemConfiguration.h>\n\nnamespace {\n  bool\n  verifyUser(void)\n  {\n    uid_t consoleUID;\n    CFStringRef result = SCDynamicStoreCopyConsoleUser(NULL, &consoleUID, NULL);\n    \/\/ TRUE if no user is logged in\n    if (result == NULL) return true;\n    CFRelease(result);\n\n    return (getuid() == consoleUID);\n  }\n\n  void\n  set(const char *name, int value)\n  {\n    char entry[512];\n    snprintf(entry, sizeof(entry), \"keyremap4macbook.%s\", name);\n\n    size_t oldlen = 0;\n    size_t newlen = sizeof(value);\n    if (sysctlbyname(entry, NULL, &oldlen, &value, newlen) == -1) {\n      perror(\"sysctl\");\n    }\n  }\n}\n\n\nint\nmain(int argc, char **argv)\n{\n  if (! verifyUser()) {\n    fprintf(stderr, \"Permission denied\\n\");\n    return 1;\n  }\n\n  std::ifstream ifs(\"\/Library\/org.pqrs\/KeyRemap4MacBook\/share\/reset\");\n  if (! ifs) return 1;\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    set(line, atoi(p + 1));\n  }\n\n  if (argc == 2 && strcmp(argv[1]) == \"terminate\") {\n    set(\"initialized\", 0);\n  }\n\n  return 0;\n}\n<commit_msg>fix sysctl_reset<commit_after>#include <sys\/types.h>\n#include <sys\/sysctl.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n\n#include <iostream>\n#include <fstream>\n\n#include <CoreFoundation\/CoreFoundation.h>\n#include <SystemConfiguration\/SystemConfiguration.h>\n\nnamespace {\n  bool\n  verifyUser(void)\n  {\n    uid_t consoleUID;\n    CFStringRef result = SCDynamicStoreCopyConsoleUser(NULL, &consoleUID, NULL);\n    \/\/ TRUE if no user is logged in\n    if (result == NULL) return true;\n    CFRelease(result);\n\n    return (getuid() == consoleUID);\n  }\n\n  void\n  set(const char *name, int value)\n  {\n    char entry[512];\n    snprintf(entry, sizeof(entry), \"keyremap4macbook.%s\", name);\n\n    size_t oldlen = 0;\n    size_t newlen = sizeof(value);\n    if (sysctlbyname(entry, NULL, &oldlen, &value, newlen) == -1) {\n      perror(\"sysctl\");\n    }\n  }\n}\n\n\nint\nmain(int argc, char **argv)\n{\n  if (! verifyUser()) {\n    fprintf(stderr, \"Permission denied\\n\");\n    return 1;\n  }\n\n  std::ifstream ifs(\"\/Library\/org.pqrs\/KeyRemap4MacBook\/share\/reset\");\n  if (! ifs) return 1;\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    set(line, atoi(p + 1));\n  }\n\n  if (argc == 2 && strcmp(argv[1], \"terminate\") == 0) {\n    set(\"initialized\", 0);\n  }\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===--- SemaDecl.cpp - Swift Semantic Analysis for Declarations ----------===\/\/\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 file implements semantic analysis for Swift declarations.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"swift\/Sema\/SemaDecl.h\"\n#include \"swift\/Sema\/Sema.h\"\n#include \"swift\/Sema\/Scope.h\"\n#include \"swift\/AST\/ASTContext.h\"\n#include \"swift\/AST\/Decl.h\"\n#include \"swift\/AST\/Expr.h\"\n#include \"swift\/AST\/Type.h\"\n#include \"llvm\/Support\/Casting.h\"\n#include \"llvm\/Support\/SMLoc.h\"\nusing namespace swift;\n\nSemaDecl::SemaDecl(Sema &S)\n  : SemaBase(S),\n    ScopeHT(new ScopeHTType()),\n    CurScope(0) {\n}\n\nSemaDecl::~SemaDecl() {\n  delete ScopeHT;\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Name lookup.\n\/\/===----------------------------------------------------------------------===\/\/\n\n\/\/\/ AddToScope - Register the specified decl as being in the current lexical\n\/\/\/ scope.\nvoid SemaDecl::AddToScope(NamedDecl *D) {\n  \/\/ If we have a shadowed variable definition, check to see if we have a\n  \/\/ redefinition: two definitions in the same scope with the same name.\n  std::pair<unsigned, NamedDecl*> Entry = ScopeHT->lookup(D->Name);\n  if (Entry.second && Entry.first == CurScope->getDepth()) {\n    Error(D->getLocStart(),\n          \"variable declaration conflicts with previous declaration\");\n    Note(ScopeHT->lookup(D->Name).second->getLocStart(),\n         \"previous declaration here\");\n    return;\n  }\n  \n  ScopeHT->insert(D->Name, std::make_pair(CurScope->getDepth(), D));\n}\n\n\/\/\/ LookupName - Perform a lexical scope lookup for the specified name,\n\/\/\/ returning the active decl if found or null if not.\nNamedDecl *SemaDecl::LookupName(Identifier Name) {\n  return ScopeHT->lookup(Name).second;\n}\n\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Declaration handling.\n\/\/===----------------------------------------------------------------------===\/\/\n\n\/\/\/ ValidateAttributes - Check that the func\/var declaration attributes are ok.\nstatic void ValidateAttributes(DeclAttributes &Attrs, Type *Ty, SemaDecl &SD) {\n  \/\/ If the decl has an infix precedence specified, then it must be a function\n  \/\/ whose input is a two element tuple.\n  if (Attrs.InfixPrecedence != -1) {\n    bool IsError = true;\n    if (FunctionType *FT = llvm::dyn_cast<FunctionType>(Ty))\n      if (TupleType *TT = llvm::dyn_cast<TupleType>(FT->Input))\n        IsError = TT->NumFields != 2;\n    if (IsError) {\n      SD.Error(Attrs.LSquareLoc, \"function with 'infix' specified must take \"\n               \"a two element tuple as input\");\n      Attrs.InfixPrecedence = -1;\n    }\n  }\n}\n\nVarDecl *SemaDecl::ActOnVarDecl(llvm::SMLoc VarLoc, llvm::StringRef Name,\n                                Type *Ty, Expr *Init, DeclAttributes &Attrs) {\n  \n  \/\/ Diagnose when we don't have a type or an expression.\n  if (Ty == 0 && Init == 0) {\n    Error(VarLoc, \"var declaration must specify a type if no \"\n          \"initializer is specified\");\n    \/\/ TODO: Recover better by still creating var, but making it have 'invalid'\n    \/\/ type.\n    return 0;\n  }\n  \n  \/\/ If both a type and an initializer are specified, make sure the\n  \/\/ initializer's type agrees with the (redundant) type.\n  if (Ty && Init) {\n    if (Expr *InitE = S.expr.HandleConversionToType(Init, Ty))\n      Init = InitE;\n    else {\n      \/\/ FIXME: Improve this to include the actual types!\n      Error(VarLoc, \"variable initializer's type ('TODO') does not match \"\n            \"specified type 'TODO'\");\n      Ty = Init->Ty;\n    }\n  }\n  \n  if (Ty == 0)\n    Ty = Init->Ty;\n  \n  \/\/ Validate attributes.\n  ValidateAttributes(Attrs, Ty, *this);\n  \n  return new (S.Context) VarDecl(VarLoc, S.Context.getIdentifier(Name),\n                                 Ty, Init, Attrs);\n}\n\nFuncDecl *SemaDecl::\nActOnFuncDecl(llvm::SMLoc FuncLoc, llvm::StringRef Name,\n              Type *Ty, Expr *Body, DeclAttributes &Attrs) {\n  assert(Ty && \"Type not specified?\");\n\n  \/\/ Validate that the body's type matches the function's type.\n  if (Expr *BodyE = S.expr.HandleConversionToType(Body, Ty))\n    Body = BodyE;\n  else {\n    \/\/ FIXME: Improve this to include the actual types!\n    Error(FuncLoc, \"func body's's type ('TODO') does not match \"\n          \"specified type 'TODO'\");\n    return 0;\n  }\n  \n  \/\/ Validate attributes.\n  ValidateAttributes(Attrs, Ty, *this);\n\n  return new (S.Context) FuncDecl(FuncLoc, S.Context.getIdentifier(Name),\n                                  Ty, Body, Attrs);\n}\n\n<commit_msg>unbreak function prototypes<commit_after>\/\/===--- SemaDecl.cpp - Swift Semantic Analysis for Declarations ----------===\/\/\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 file implements semantic analysis for Swift declarations.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"swift\/Sema\/SemaDecl.h\"\n#include \"swift\/Sema\/Sema.h\"\n#include \"swift\/Sema\/Scope.h\"\n#include \"swift\/AST\/ASTContext.h\"\n#include \"swift\/AST\/Decl.h\"\n#include \"swift\/AST\/Expr.h\"\n#include \"swift\/AST\/Type.h\"\n#include \"llvm\/Support\/Casting.h\"\n#include \"llvm\/Support\/SMLoc.h\"\nusing namespace swift;\n\nSemaDecl::SemaDecl(Sema &S)\n  : SemaBase(S),\n    ScopeHT(new ScopeHTType()),\n    CurScope(0) {\n}\n\nSemaDecl::~SemaDecl() {\n  delete ScopeHT;\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Name lookup.\n\/\/===----------------------------------------------------------------------===\/\/\n\n\/\/\/ AddToScope - Register the specified decl as being in the current lexical\n\/\/\/ scope.\nvoid SemaDecl::AddToScope(NamedDecl *D) {\n  \/\/ If we have a shadowed variable definition, check to see if we have a\n  \/\/ redefinition: two definitions in the same scope with the same name.\n  std::pair<unsigned, NamedDecl*> Entry = ScopeHT->lookup(D->Name);\n  if (Entry.second && Entry.first == CurScope->getDepth()) {\n    Error(D->getLocStart(),\n          \"variable declaration conflicts with previous declaration\");\n    Note(ScopeHT->lookup(D->Name).second->getLocStart(),\n         \"previous declaration here\");\n    return;\n  }\n  \n  ScopeHT->insert(D->Name, std::make_pair(CurScope->getDepth(), D));\n}\n\n\/\/\/ LookupName - Perform a lexical scope lookup for the specified name,\n\/\/\/ returning the active decl if found or null if not.\nNamedDecl *SemaDecl::LookupName(Identifier Name) {\n  return ScopeHT->lookup(Name).second;\n}\n\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Declaration handling.\n\/\/===----------------------------------------------------------------------===\/\/\n\n\/\/\/ ValidateAttributes - Check that the func\/var declaration attributes are ok.\nstatic void ValidateAttributes(DeclAttributes &Attrs, Type *Ty, SemaDecl &SD) {\n  \/\/ If the decl has an infix precedence specified, then it must be a function\n  \/\/ whose input is a two element tuple.\n  if (Attrs.InfixPrecedence != -1) {\n    bool IsError = true;\n    if (FunctionType *FT = llvm::dyn_cast<FunctionType>(Ty))\n      if (TupleType *TT = llvm::dyn_cast<TupleType>(FT->Input))\n        IsError = TT->NumFields != 2;\n    if (IsError) {\n      SD.Error(Attrs.LSquareLoc, \"function with 'infix' specified must take \"\n               \"a two element tuple as input\");\n      Attrs.InfixPrecedence = -1;\n    }\n  }\n}\n\nVarDecl *SemaDecl::ActOnVarDecl(llvm::SMLoc VarLoc, llvm::StringRef Name,\n                                Type *Ty, Expr *Init, DeclAttributes &Attrs) {\n  \n  \/\/ Diagnose when we don't have a type or an expression.\n  if (Ty == 0 && Init == 0) {\n    Error(VarLoc, \"var declaration must specify a type if no \"\n          \"initializer is specified\");\n    \/\/ TODO: Recover better by still creating var, but making it have 'invalid'\n    \/\/ type.\n    return 0;\n  }\n  \n  \/\/ If both a type and an initializer are specified, make sure the\n  \/\/ initializer's type agrees with the (redundant) type.\n  if (Ty && Init) {\n    if (Expr *InitE = S.expr.HandleConversionToType(Init, Ty))\n      Init = InitE;\n    else {\n      \/\/ FIXME: Improve this to include the actual types!\n      Error(VarLoc, \"variable initializer's type ('TODO') does not match \"\n            \"specified type 'TODO'\");\n      Ty = Init->Ty;\n    }\n  }\n  \n  if (Ty == 0)\n    Ty = Init->Ty;\n  \n  \/\/ Validate attributes.\n  ValidateAttributes(Attrs, Ty, *this);\n  \n  return new (S.Context) VarDecl(VarLoc, S.Context.getIdentifier(Name),\n                                 Ty, Init, Attrs);\n}\n\nFuncDecl *SemaDecl::\nActOnFuncDecl(llvm::SMLoc FuncLoc, llvm::StringRef Name,\n              Type *Ty, Expr *Body, DeclAttributes &Attrs) {\n  assert(Ty && \"Type not specified?\");\n\n  \/\/ Validate that the body's type matches the function's type if this isn't a\n  \/\/ external function.\n  if (Body) {\n    if (Expr *BodyE = S.expr.HandleConversionToType(Body, Ty))\n      Body = BodyE;\n    else {\n      \/\/ FIXME: Improve this to include the actual types!\n      Error(FuncLoc, \"func body's's type ('TODO') does not match \"\n            \"specified type 'TODO'\");\n      return 0;\n    }\n  }\n  \n  \/\/ Validate attributes.\n  ValidateAttributes(Attrs, Ty, *this);\n\n  return new (S.Context) FuncDecl(FuncLoc, S.Context.getIdentifier(Name),\n                                  Ty, Body, Attrs);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2010-2011 Google\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include <string>\n\n#include \"base\/commandlineflags.h\"\n#include \"base\/logging.h\"\n#include \"linear_solver\/linear_solver.h\"\n#include \"linear_solver\/linear_solver.pb.h\"\n\nnamespace operations_research {\nvoid BuildLinearProgrammingMaxExample(MPSolver::OptimizationProblemType type) {\n  const double kObjCoef[] = {10.0, 6.0, 4.0};\n  const string kVarName[] = {\"x1\", \"x2\", \"x3\"};\n  const int numVars = 3;\n  const int kNumConstraints = 3;\n  const string kConstraintName[] = {\"c1\", \"c2\", \"c3\"};\n  const double kConstraintCoef1[] = {1.0, 1.0, 1.0};\n  const double kConstraintCoef2[] = {10.0, 4.0, 5.0};\n  const double kConstraintCoef3[] = {2.0, 2.0, 6.0};\n  const double* kConstraintCoef[] = {kConstraintCoef1,\n                                     kConstraintCoef2,\n                                     kConstraintCoef3};\n  const double kConstraintUb[] = {100.0, 600.0, 300.0};\n\n  MPSolver solver(\"Max_Example\", type);\n  const double infinity = solver.infinity();\n  MPModelProto model_proto;\n\n  \/\/ Create variables and objective function\n  for (int j = 0; j < numVars; ++j) {\n    MPVariableProto* x = model_proto.add_variables();\n    x->set_id(kVarName[j]);\n    x->set_lb(0.0);\n    x->set_ub(infinity);\n    x->set_integer(false);\n    MPTermProto* obj_term = model_proto.add_objective_terms();\n    obj_term->set_variable_id(kVarName[j]);\n    obj_term->set_coefficient(kObjCoef[j]);\n  }\n  model_proto.set_maximize(true);\n\n  \/\/ Create constraints\n  for (int i = 0; i < kNumConstraints; ++i) {\n    MPConstraintProto* constraint_proto = model_proto.add_constraints();\n    constraint_proto->set_id(kConstraintName[i]);\n    constraint_proto->set_lb(-infinity);\n    constraint_proto->set_ub(kConstraintUb[i]);\n    for (int j = 0; j < numVars; ++j) {\n      MPTermProto* term = constraint_proto->add_terms();\n      term->set_variable_id(kVarName[j]);\n      term->set_coefficient(kConstraintCoef[i][j]);\n    }\n  }\n\n  MPModelRequest model_request;\n  model_request.mutable_model()->CopyFrom(model_proto);\n  if (type == MPSolver::GLPK_LINEAR_PROGRAMMING) {\n    model_request.set_problem_type(MPModelRequest::GLPK_LINEAR_PROGRAMMING);\n  } else {\n    model_request.set_problem_type(MPModelRequest::CLP_LINEAR_PROGRAMMING);\n  }\n\n  MPSolutionResponse solution_response;\n  solver.SolveWithProtocolBuffers(model_request, &solution_response);\n\n  \/\/ The problem has an optimal solution.\n  CHECK_EQ(MPSolver::OPTIMAL, solution_response.result_status());\n\n  LOG(INFO) << \"objective = \" <<  solution_response.objective_value();\n  for (int j = 0; j < numVars; ++j) {\n    MPSolutionValue solution_value = solution_response.solution_values(j);\n    LOG(INFO) << solution_value.variable_id() << \" = \"\n              << solution_value.value();\n  }\n}\n\nvoid RunAllExamples() {\n  LOG(INFO) << \"----- Running Max Example with GLPK -----\";\n  BuildLinearProgrammingMaxExample(MPSolver::GLPK_LINEAR_PROGRAMMING);\n  LOG(INFO) << \"----- Running Max Example with Coin LP -----\";\n  BuildLinearProgrammingMaxExample(MPSolver::CLP_LINEAR_PROGRAMMING);\n}\n}  \/\/ namespace operations_research\n\nint main(int argc, char **argv) {\n  google::ParseCommandLineFlags(&argc, &argv, true);\n  operations_research::RunAllExamples();\n  return 0;\n}\n<commit_msg>fix example<commit_after>\/\/ Copyright 2010-2011 Google\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include <string>\n\n#include \"base\/commandlineflags.h\"\n#include \"base\/logging.h\"\n#include \"linear_solver\/linear_solver.h\"\n#include \"linear_solver\/linear_solver.pb.h\"\n\nnamespace operations_research {\nvoid BuildLinearProgrammingMaxExample(MPSolver::OptimizationProblemType type) {\n  const double kObjCoef[] = {10.0, 6.0, 4.0};\n  const string kVarName[] = {\"x1\", \"x2\", \"x3\"};\n  const int numVars = 3;\n  const int kNumConstraints = 3;\n  const string kConstraintName[] = {\"c1\", \"c2\", \"c3\"};\n  const double kConstraintCoef1[] = {1.0, 1.0, 1.0};\n  const double kConstraintCoef2[] = {10.0, 4.0, 5.0};\n  const double kConstraintCoef3[] = {2.0, 2.0, 6.0};\n  const double* kConstraintCoef[] = {kConstraintCoef1,\n                                     kConstraintCoef2,\n                                     kConstraintCoef3};\n  const double kConstraintUb[] = {100.0, 600.0, 300.0};\n\n  MPSolver solver(\"Max_Example\", type);\n  const double infinity = solver.infinity();\n  MPModelProto model_proto;\n\n  \/\/ Create variables and objective function\n  for (int j = 0; j < numVars; ++j) {\n    MPVariableProto* x = model_proto.add_variables();\n    x->set_id(kVarName[j]);\n    x->set_lb(0.0);\n    x->set_ub(infinity);\n    x->set_integer(false);\n    MPTermProto* obj_term = model_proto.add_objective_terms();\n    obj_term->set_variable_id(kVarName[j]);\n    obj_term->set_coefficient(kObjCoef[j]);\n  }\n  model_proto.set_maximize(true);\n\n  \/\/ Create constraints\n  for (int i = 0; i < kNumConstraints; ++i) {\n    MPConstraintProto* constraint_proto = model_proto.add_constraints();\n    constraint_proto->set_id(kConstraintName[i]);\n    constraint_proto->set_lb(-infinity);\n    constraint_proto->set_ub(kConstraintUb[i]);\n    for (int j = 0; j < numVars; ++j) {\n      MPTermProto* term = constraint_proto->add_terms();\n      term->set_variable_id(kVarName[j]);\n      term->set_coefficient(kConstraintCoef[i][j]);\n    }\n  }\n\n  MPModelRequest model_request;\n  model_request.mutable_model()->CopyFrom(model_proto);\n  if (type == MPSolver::GLPK_LINEAR_PROGRAMMING) {\n    model_request.set_problem_type(MPModelRequest::GLPK_LINEAR_PROGRAMMING);\n  } else {\n    model_request.set_problem_type(MPModelRequest::CLP_LINEAR_PROGRAMMING);\n  }\n\n  MPSolutionResponse solution_response;\n  solver.SolveWithProtocolBuffers(model_request, &solution_response);\n\n  \/\/ The problem has an optimal solution.\n  CHECK_EQ(MPSolver::OPTIMAL, solution_response.result_status());\n\n  LOG(INFO) << \"objective = \" <<  solution_response.objective_value();\n  const int num_non_zeros = solution_response.solution_values_size();\n  for (int j = 0; j < num_non_zeros; ++j) {\n    MPSolutionValue solution_value = solution_response.solution_values(j);\n    LOG(INFO) << solution_value.variable_id() << \" = \"\n              << solution_value.value();\n  }\n}\n\nvoid RunAllExamples() {\n  LOG(INFO) << \"----- Running Max Example with GLPK -----\";\n  BuildLinearProgrammingMaxExample(MPSolver::GLPK_LINEAR_PROGRAMMING);\n  LOG(INFO) << \"----- Running Max Example with Coin LP -----\";\n  BuildLinearProgrammingMaxExample(MPSolver::CLP_LINEAR_PROGRAMMING);\n}\n}  \/\/ namespace operations_research\n\nint main(int argc, char **argv) {\n  google::ParseCommandLineFlags(&argc, &argv, true);\n  operations_research::RunAllExamples();\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright © 2001-2014, Canal TP and\/or its affiliates. All rights reserved.\n  \nThis file is part of Navitia,\n    the software to build cool stuff with public transport.\n \nHope you'll enjoy and contribute to this project,\n    powered by Canal TP (www.canaltp.fr).\nHelp us simplify mobility and open public transport:\n    a non ending quest to the responsive locomotion way of traveling!\n  \nLICENCE: This program is free software; you can redistribute it and\/or modify\nit under the terms of the GNU Affero General Public License as published by\nthe Free Software Foundation, either version 3 of the License, or\n(at your option) any later version.\n   \nThis program is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\nGNU Affero General Public License for more details.\n   \nYou should have received a copy of the GNU Affero General Public License\nalong with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n  \nStay tuned using\ntwitter @navitia \nIRC #navitia on freenode\nhttps:\/\/groups.google.com\/d\/forum\/navitia\nwww.navitia.io\n*\/\n\n#include \"raptor_api.h\"\n#include \"raptor.h\"\n#include \"georef\/street_network.h\"\n#include \"type\/data.h\"\n#include \"utils\/timer.h\"\n#include <boost\/program_options.hpp>\n#include <boost\/progress.hpp>\n#include <random>\n#include <fstream>\n#include \"utils\/init.h\"\n#include \"utils\/csv.h\"\n#include <boost\/algorithm\/string\/predicate.hpp>\n#ifdef __BENCH_WITH_CALGRIND__\n#include \"valgrind\/callgrind.h\"\n#endif\n\nusing namespace navitia;\nusing namespace routing;\nnamespace po = boost::program_options;\nnamespace ba = boost::algorithm;\n\nstruct PathDemand {\n    std::string start;\n    std::string target;\n\n    unsigned int date;\n    unsigned int hour;\n\n    type::Mode_e start_mode = type::Mode_e::Walking;\n    type::Mode_e target_mode = type::Mode_e::Walking;\n};\n\nstruct Result {\n    int duration;\n    int time;\n    int arrival;\n    int nb_changes;\n\n    Result(pbnavitia::Journey journey) : duration(journey.duration()), time(-1), arrival(journey.arrival_date_time()), nb_changes(journey.nb_transfers()) {}\n};\n\nstatic type::GeographicalCoord coord_of_entry_point(const type::EntryPoint& entry_point,\n                                                    const navitia::type::Data& data) {\n    type::GeographicalCoord result;\n    switch (entry_point.type) {\n    case type::Type_e::Address: {\n            auto way = data.geo_ref->way_map.find(entry_point.uri);\n            if (way != data.geo_ref->way_map.end()){\n                const auto geo_way = data.geo_ref->ways[way->second];\n                return geo_way->nearest_coord(entry_point.house_number, data.geo_ref->graph);\n            }\n        }\n        break;\n    case type::Type_e::StopPoint: {\n            auto sp_it = data.pt_data->stop_points_map.find(entry_point.uri);\n            if(sp_it != data.pt_data->stop_points_map.end()) {\n                return  sp_it->second->coord;\n            }\n        }\n        break;\n    case type::Type_e::StopArea: {\n            auto sa_it = data.pt_data->stop_areas_map.find(entry_point.uri);\n            if(sa_it != data.pt_data->stop_areas_map.end()) {\n                return  sa_it->second->coord;\n            }\n        }\n        break;\n    case type::Type_e::Coord:\n        return entry_point.coordinates;\n    case type::Type_e::Admin: {\n            auto it_admin = data.geo_ref->admin_map.find(entry_point.uri);\n            if (it_admin != data.geo_ref->admin_map.end()) {\n                const auto admin = data.geo_ref->admins[it_admin->second];\n                return  admin->coord;\n            }\n        }\n        break;\n    case type::Type_e::POI: {\n            auto poi = data.geo_ref->poi_map.find(entry_point.uri);\n            if (poi != data.geo_ref->poi_map.end()){\n                const auto geo_poi = data.geo_ref->pois[poi->second];\n                return geo_poi->coord;\n            }\n        }\n        break;\n    default:\n        break;\n    }\n    std::cout << \"coord not found for \" << entry_point.uri << std::endl;\n    return {};\n}\n\nstatic type::EntryPoint make_entry_point(const std::string& entry_id, const type::Data& data) {\n    type::EntryPoint entry;\n    try {\n        type::idx_t idx = boost::lexical_cast<type::idx_t>(entry_id);\n\n        \/\/if it is a idx, we consider it to be a stop area idx\n        entry = type::EntryPoint(type::Type_e::StopArea, data.pt_data->stop_areas.at(idx)->uri, 0);\n    } catch (boost::bad_lexical_cast) {\n        \/\/ else we use the same way to identify an entry point as the api\n        entry = type::EntryPoint(data.get_type_of_id(entry_id), entry_id);\n    }\n\n    entry.coordinates = coord_of_entry_point(entry, data);\n    return entry;\n}\n\nint main(int argc, char** argv){\n    navitia::init_app();\n    po::options_description desc(\"Options de l'outil de benchmark\");\n    std::string file, output, stop_input_file, start, target;\n    int iterations, date, hour, nb_second_pass;\n\n    auto logger = log4cplus::Logger::getInstance(LOG4CPLUS_TEXT(\"logger\"));\n    logger.setLogLevel(log4cplus::WARN_LOG_LEVEL);\n\n    desc.add_options()\n            (\"help\", \"Show this message\")\n            (\"iterations,i\", po::value<int>(&iterations)->default_value(100),\n                     \"Number of iterations (10 requests by iteration)\")\n            (\"file,f\", po::value<std::string>(&file)->default_value(\"data.nav.lz4\"),\n                     \"Path to data.nav.lz4\")\n            (\"start,s\", po::value<std::string>(&start),\n                    \"Start of a particular journey\")\n            (\"target,t\", po::value<std::string>(&target),\n                    \"Target of a particular journey\")\n            (\"date,d\", po::value<int>(&date)->default_value(-1),\n                    \"Beginning date of a particular journey\")\n            (\"hour,h\", po::value<int>(&hour)->default_value(-1),\n                    \"Beginning hour of a particular journey\")\n            (\"verbose,v\", \"Verbose debugging output\")\n            (\"nb_second_pass\", po::value<int>(&nb_second_pass)->default_value(0), \"nb second pass\")\n            (\"stop_files\", po::value<std::string>(&stop_input_file), \"File with list of start and target\")\n            (\"output,o\", po::value<std::string>(&output)->default_value(\"benchmark.csv\"),\n                     \"Output file\");\n    po::variables_map vm;\n    po::store(po::parse_command_line(argc, argv, desc), vm);\n    po::notify(vm);\n    bool verbose = vm.count(\"verbose\");\n\n    if (vm.count(\"help\")) {\n        std::cout << \"This is used to benchmark journey computation\" << std::endl;\n        std::cout << desc << std::endl;\n        return 1;\n    }\n\n    type::Data data;\n    {\n        Timer t(\"Chargement des données : \" + file);\n        data.load(file);\n    }\n    std::vector<PathDemand> demands;\n\n    if (! stop_input_file.empty()) {\n        \/\/csv file should be the same as the output one\n        CsvReader csv(stop_input_file, ',');\n        csv.next();\n        size_t cpt_not_found = 0;\n        for (auto it = csv.next(); ! csv.eof(); it = csv.next()) {\n            PathDemand demand;\n            demand.start = it[0];\n            demand.target = it[1];\n            demand.hour = boost::lexical_cast<unsigned int>(it[5]);\n            demand.date = boost::lexical_cast<unsigned int>(it[4]);\n            demands.push_back(demand);\n        }\n        std::cout << \"nb start not found \" << cpt_not_found << std::endl;\n    }\n    else if(start != \"\" && target != \"\" && date != -1 && hour != -1) {\n        PathDemand demand;\n        demand.start = start;\n        demand.target = target;\n        demand.hour = hour;\n        demand.date = date;\n        std::cout << \"we use the entry param \" << start << \" -> \" << target << std::endl;\n        demands.push_back(demand);\n    } else {\n        \/\/ Génération des instances\n        std::random_device rd;\n        std::mt19937 rng(31442);\n        std::uniform_int_distribution<> gen(0,data.pt_data->stop_areas.size()-1);\n        std::vector<unsigned int> hours{0, 28800, 36000, 72000, 86000};\n        std::vector<unsigned int> days({date != -1 ? unsigned(date) : 7});\n        if(data.pt_data->validity_patterns.front()->beginning_date.day_of_week().as_number() == 6)\n            days.push_back(days.front() + 1);\n        else\n            days.push_back(days.front() + 6);\n\n        for(int i = 0; i < iterations; ++i) {\n            PathDemand demand;\n            const type::StopArea* sa_start;\n            const type::StopArea* sa_dest;\n            do {\n                sa_start = data.pt_data->stop_areas[gen(rng)];\n                sa_dest = data.pt_data->stop_areas[gen(rng)];\n                demand.start = sa_start->uri;\n                demand.target = sa_dest->uri;\n            }\n            while(sa_start == sa_dest\n                    || ba::starts_with(sa_dest->uri, \"stop_area:SNC:\")\n                    || ba::starts_with(sa_start->uri, \"stop_area:SNC:\"));\n\n            for(auto day : days) {\n                for(auto hour : hours) {\n                    demand.date = day;\n                    demand.hour = hour;\n                    demands.push_back(demand);\n                }\n            }\n        }\n    }\n\n    \/\/ Calculs des itinéraires\n    std::vector<Result> results;\n    data.build_raptor();\n    RAPTOR router(data);\n    auto georef_worker = georef::StreetNetwork(*data.geo_ref);\n\n    std::cout << \"On lance le benchmark de l'algo \" << std::endl;\n    boost::progress_display show_progress(demands.size());\n    Timer t(\"Calcul avec l'algorithme \");\n    \/\/ProfilerStart(\"bench.prof\");\n    int nb_reponses = 0, nb_journeys = 0;\n#ifdef __BENCH_WITH_CALGRIND__\n    CALLGRIND_START_INSTRUMENTATION;\n#endif\n    for (auto demand: demands) {\n        ++show_progress;\n        Timer t2;\n        auto date = data.pt_data->validity_patterns.front()->beginning_date + boost::gregorian::days(demand.date + 1) - boost::gregorian::date(1970, 1, 1);\n        if (verbose) {\n            std::cout << demand.start\n                      << \", \" << demand.start\n                      << \", \" << demand.target\n                      << \", \" << demand.target\n                      << \", \" << date\n                      << \", \" << demand.hour\n                      << \"\\n\";\n        }\n\n        type::EntryPoint origin = make_entry_point(demand.start, data);\n        type::EntryPoint destination = make_entry_point(demand.target, data);\n\n        origin.streetnetwork_params.mode = demand.start_mode;\n        origin.streetnetwork_params.offset = data.geo_ref->offsets[demand.start_mode];\n        origin.streetnetwork_params.max_duration = navitia::seconds(15*60);\n        origin.streetnetwork_params.speed_factor = 1;\n        destination.streetnetwork_params.mode = demand.target_mode;\n        destination.streetnetwork_params.offset = data.geo_ref->offsets[demand.target_mode];\n        destination.streetnetwork_params.max_duration = navitia::seconds(15*60);\n        destination.streetnetwork_params.speed_factor = 1;\n        type::AccessibiliteParams accessibilite_params;\n        auto resp = make_response(router, origin, destination,\n              {DateTimeUtils::set(date.days(), demand.hour)}, true,\n              accessibilite_params,\n              {},\n              georef_worker,\n              type::RTLevel::Base,\n              std::numeric_limits<int>::max(),\n              10,\n              false,\n              nb_second_pass);\n\n        if (resp.journeys_size() > 0) {\n            ++ nb_reponses;\n            nb_journeys += resp.journeys_size();\n\n            Result result(resp.journeys(0));\n            result.time = t2.ms();\n            results.push_back(result);\n        }\n    }\n    \/\/ProfilerStop();\n#ifdef __BENCH_WITH_CALGRIND__\n    CALLGRIND_STOP_INSTRUMENTATION;\n#endif\n\n    std::cout << \"Number of requests: \" << demands.size() << std::endl;\n    std::cout << \"Number of results with solution: \" << nb_reponses << std::endl;\n    std::cout << \"Number of journey found: \" << nb_journeys << std::endl;\n}\n<commit_msg>benchmark_full: use 30 min of street network<commit_after>\/* Copyright © 2001-2014, Canal TP and\/or its affiliates. All rights reserved.\n  \nThis file is part of Navitia,\n    the software to build cool stuff with public transport.\n \nHope you'll enjoy and contribute to this project,\n    powered by Canal TP (www.canaltp.fr).\nHelp us simplify mobility and open public transport:\n    a non ending quest to the responsive locomotion way of traveling!\n  \nLICENCE: This program is free software; you can redistribute it and\/or modify\nit under the terms of the GNU Affero General Public License as published by\nthe Free Software Foundation, either version 3 of the License, or\n(at your option) any later version.\n   \nThis program is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\nGNU Affero General Public License for more details.\n   \nYou should have received a copy of the GNU Affero General Public License\nalong with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n  \nStay tuned using\ntwitter @navitia \nIRC #navitia on freenode\nhttps:\/\/groups.google.com\/d\/forum\/navitia\nwww.navitia.io\n*\/\n\n#include \"raptor_api.h\"\n#include \"raptor.h\"\n#include \"georef\/street_network.h\"\n#include \"type\/data.h\"\n#include \"utils\/timer.h\"\n#include <boost\/program_options.hpp>\n#include <boost\/progress.hpp>\n#include <random>\n#include <fstream>\n#include \"utils\/init.h\"\n#include \"utils\/csv.h\"\n#include <boost\/algorithm\/string\/predicate.hpp>\n#ifdef __BENCH_WITH_CALGRIND__\n#include \"valgrind\/callgrind.h\"\n#endif\n\nusing namespace navitia;\nusing namespace routing;\nnamespace po = boost::program_options;\nnamespace ba = boost::algorithm;\n\nstruct PathDemand {\n    std::string start;\n    std::string target;\n\n    unsigned int date;\n    unsigned int hour;\n\n    type::Mode_e start_mode = type::Mode_e::Walking;\n    type::Mode_e target_mode = type::Mode_e::Walking;\n};\n\nstruct Result {\n    int duration;\n    int time;\n    int arrival;\n    int nb_changes;\n\n    Result(pbnavitia::Journey journey) : duration(journey.duration()), time(-1), arrival(journey.arrival_date_time()), nb_changes(journey.nb_transfers()) {}\n};\n\nstatic type::GeographicalCoord coord_of_entry_point(const type::EntryPoint& entry_point,\n                                                    const navitia::type::Data& data) {\n    type::GeographicalCoord result;\n    switch (entry_point.type) {\n    case type::Type_e::Address: {\n            auto way = data.geo_ref->way_map.find(entry_point.uri);\n            if (way != data.geo_ref->way_map.end()){\n                const auto geo_way = data.geo_ref->ways[way->second];\n                return geo_way->nearest_coord(entry_point.house_number, data.geo_ref->graph);\n            }\n        }\n        break;\n    case type::Type_e::StopPoint: {\n            auto sp_it = data.pt_data->stop_points_map.find(entry_point.uri);\n            if(sp_it != data.pt_data->stop_points_map.end()) {\n                return  sp_it->second->coord;\n            }\n        }\n        break;\n    case type::Type_e::StopArea: {\n            auto sa_it = data.pt_data->stop_areas_map.find(entry_point.uri);\n            if(sa_it != data.pt_data->stop_areas_map.end()) {\n                return  sa_it->second->coord;\n            }\n        }\n        break;\n    case type::Type_e::Coord:\n        return entry_point.coordinates;\n    case type::Type_e::Admin: {\n            auto it_admin = data.geo_ref->admin_map.find(entry_point.uri);\n            if (it_admin != data.geo_ref->admin_map.end()) {\n                const auto admin = data.geo_ref->admins[it_admin->second];\n                return  admin->coord;\n            }\n        }\n        break;\n    case type::Type_e::POI: {\n            auto poi = data.geo_ref->poi_map.find(entry_point.uri);\n            if (poi != data.geo_ref->poi_map.end()){\n                const auto geo_poi = data.geo_ref->pois[poi->second];\n                return geo_poi->coord;\n            }\n        }\n        break;\n    default:\n        break;\n    }\n    std::cout << \"coord not found for \" << entry_point.uri << std::endl;\n    return {};\n}\n\nstatic type::EntryPoint make_entry_point(const std::string& entry_id, const type::Data& data) {\n    type::EntryPoint entry;\n    try {\n        type::idx_t idx = boost::lexical_cast<type::idx_t>(entry_id);\n\n        \/\/if it is a idx, we consider it to be a stop area idx\n        entry = type::EntryPoint(type::Type_e::StopArea, data.pt_data->stop_areas.at(idx)->uri, 0);\n    } catch (boost::bad_lexical_cast) {\n        \/\/ else we use the same way to identify an entry point as the api\n        entry = type::EntryPoint(data.get_type_of_id(entry_id), entry_id);\n    }\n\n    entry.coordinates = coord_of_entry_point(entry, data);\n    return entry;\n}\n\nint main(int argc, char** argv){\n    navitia::init_app();\n    po::options_description desc(\"Options de l'outil de benchmark\");\n    std::string file, output, stop_input_file, start, target;\n    int iterations, date, hour, nb_second_pass;\n\n    auto logger = log4cplus::Logger::getInstance(LOG4CPLUS_TEXT(\"logger\"));\n    logger.setLogLevel(log4cplus::WARN_LOG_LEVEL);\n\n    desc.add_options()\n            (\"help\", \"Show this message\")\n            (\"iterations,i\", po::value<int>(&iterations)->default_value(100),\n                     \"Number of iterations (10 requests by iteration)\")\n            (\"file,f\", po::value<std::string>(&file)->default_value(\"data.nav.lz4\"),\n                     \"Path to data.nav.lz4\")\n            (\"start,s\", po::value<std::string>(&start),\n                    \"Start of a particular journey\")\n            (\"target,t\", po::value<std::string>(&target),\n                    \"Target of a particular journey\")\n            (\"date,d\", po::value<int>(&date)->default_value(-1),\n                    \"Beginning date of a particular journey\")\n            (\"hour,h\", po::value<int>(&hour)->default_value(-1),\n                    \"Beginning hour of a particular journey\")\n            (\"verbose,v\", \"Verbose debugging output\")\n            (\"nb_second_pass\", po::value<int>(&nb_second_pass)->default_value(0), \"nb second pass\")\n            (\"stop_files\", po::value<std::string>(&stop_input_file), \"File with list of start and target\")\n            (\"output,o\", po::value<std::string>(&output)->default_value(\"benchmark.csv\"),\n                     \"Output file\");\n    po::variables_map vm;\n    po::store(po::parse_command_line(argc, argv, desc), vm);\n    po::notify(vm);\n    bool verbose = vm.count(\"verbose\");\n\n    if (vm.count(\"help\")) {\n        std::cout << \"This is used to benchmark journey computation\" << std::endl;\n        std::cout << desc << std::endl;\n        return 1;\n    }\n\n    type::Data data;\n    {\n        Timer t(\"Chargement des données : \" + file);\n        data.load(file);\n    }\n    std::vector<PathDemand> demands;\n\n    if (! stop_input_file.empty()) {\n        \/\/csv file should be the same as the output one\n        CsvReader csv(stop_input_file, ',');\n        csv.next();\n        size_t cpt_not_found = 0;\n        for (auto it = csv.next(); ! csv.eof(); it = csv.next()) {\n            PathDemand demand;\n            demand.start = it[0];\n            demand.target = it[1];\n            demand.hour = boost::lexical_cast<unsigned int>(it[5]);\n            demand.date = boost::lexical_cast<unsigned int>(it[4]);\n            demands.push_back(demand);\n        }\n        std::cout << \"nb start not found \" << cpt_not_found << std::endl;\n    }\n    else if(start != \"\" && target != \"\" && date != -1 && hour != -1) {\n        PathDemand demand;\n        demand.start = start;\n        demand.target = target;\n        demand.hour = hour;\n        demand.date = date;\n        std::cout << \"we use the entry param \" << start << \" -> \" << target << std::endl;\n        demands.push_back(demand);\n    } else {\n        \/\/ Génération des instances\n        std::random_device rd;\n        std::mt19937 rng(31442);\n        std::uniform_int_distribution<> gen(0,data.pt_data->stop_areas.size()-1);\n        std::vector<unsigned int> hours{0, 28800, 36000, 72000, 86000};\n        std::vector<unsigned int> days({date != -1 ? unsigned(date) : 7});\n        if(data.pt_data->validity_patterns.front()->beginning_date.day_of_week().as_number() == 6)\n            days.push_back(days.front() + 1);\n        else\n            days.push_back(days.front() + 6);\n\n        for(int i = 0; i < iterations; ++i) {\n            PathDemand demand;\n            const type::StopArea* sa_start;\n            const type::StopArea* sa_dest;\n            do {\n                sa_start = data.pt_data->stop_areas[gen(rng)];\n                sa_dest = data.pt_data->stop_areas[gen(rng)];\n                demand.start = sa_start->uri;\n                demand.target = sa_dest->uri;\n            }\n            while(sa_start == sa_dest\n                    || ba::starts_with(sa_dest->uri, \"stop_area:SNC:\")\n                    || ba::starts_with(sa_start->uri, \"stop_area:SNC:\"));\n\n            for(auto day : days) {\n                for(auto hour : hours) {\n                    demand.date = day;\n                    demand.hour = hour;\n                    demands.push_back(demand);\n                }\n            }\n        }\n    }\n\n    \/\/ Calculs des itinéraires\n    std::vector<Result> results;\n    data.build_raptor();\n    RAPTOR router(data);\n    auto georef_worker = georef::StreetNetwork(*data.geo_ref);\n\n    std::cout << \"On lance le benchmark de l'algo \" << std::endl;\n    boost::progress_display show_progress(demands.size());\n    Timer t(\"Calcul avec l'algorithme \");\n    \/\/ProfilerStart(\"bench.prof\");\n    int nb_reponses = 0, nb_journeys = 0;\n#ifdef __BENCH_WITH_CALGRIND__\n    CALLGRIND_START_INSTRUMENTATION;\n#endif\n    for (auto demand: demands) {\n        ++show_progress;\n        Timer t2;\n        auto date = data.pt_data->validity_patterns.front()->beginning_date + boost::gregorian::days(demand.date + 1) - boost::gregorian::date(1970, 1, 1);\n        if (verbose) {\n            std::cout << demand.start\n                      << \", \" << demand.start\n                      << \", \" << demand.target\n                      << \", \" << demand.target\n                      << \", \" << date\n                      << \", \" << demand.hour\n                      << \"\\n\";\n        }\n\n        type::EntryPoint origin = make_entry_point(demand.start, data);\n        type::EntryPoint destination = make_entry_point(demand.target, data);\n\n        origin.streetnetwork_params.mode = demand.start_mode;\n        origin.streetnetwork_params.offset = data.geo_ref->offsets[demand.start_mode];\n        origin.streetnetwork_params.max_duration = navitia::seconds(30*60);\n        origin.streetnetwork_params.speed_factor = 1;\n        destination.streetnetwork_params.mode = demand.target_mode;\n        destination.streetnetwork_params.offset = data.geo_ref->offsets[demand.target_mode];\n        destination.streetnetwork_params.max_duration = navitia::seconds(30*60);\n        destination.streetnetwork_params.speed_factor = 1;\n        type::AccessibiliteParams accessibilite_params;\n        auto resp = make_response(router, origin, destination,\n              {DateTimeUtils::set(date.days(), demand.hour)}, true,\n              accessibilite_params,\n              {},\n              georef_worker,\n              type::RTLevel::Base,\n              std::numeric_limits<int>::max(),\n              10,\n              false,\n              nb_second_pass);\n\n        if (resp.journeys_size() > 0) {\n            ++ nb_reponses;\n            nb_journeys += resp.journeys_size();\n\n            Result result(resp.journeys(0));\n            result.time = t2.ms();\n            results.push_back(result);\n        }\n    }\n    \/\/ProfilerStop();\n#ifdef __BENCH_WITH_CALGRIND__\n    CALLGRIND_STOP_INSTRUMENTATION;\n#endif\n\n    std::cout << \"Number of requests: \" << demands.size() << std::endl;\n    std::cout << \"Number of results with solution: \" << nb_reponses << std::endl;\n    std::cout << \"Number of journey found: \" << nb_journeys << std::endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file CSRFile_test.cpp\n * @brief Test for reading and writing CSR formatted csrs.\n * @author Dominique LaSalle <wildriver@domnet.org>\n * Copyright 2015-2017\n * @version 1\n *\n *\/\n\n\n\n\n#include <iostream>\n#include <fstream>\n#include <memory>\n\n#include \"CSRFile.hpp\"\n#include \"DomTest.hpp\"\n\n\n\n\nusing namespace WildRiver;\n\n\n\n\nnamespace DomTest\n{\n\n\nstatic void writeTest(\n    std::string const & testFile)\n{\n  CSRFile csr(testFile);\n\n  csr.setInfo(6,6,14);\n\n  wildriver_ind_t rowptr[] = {0,2,4,7,10,12,14};\n  wildriver_dim_t rowind[] = {1,2,0,2,0,1,3,2,4,5,3,5,3,4};\n  wildriver_val_t rowval[] = {1,2,3,4,5,6,7,8,9,1,2,3,4,5};\n\n  csr.write(rowptr,rowind,rowval);\n}\n\n\nstatic void readTest(\n    std::string const & testFile)\n{\n  CSRFile csr(testFile);\n\n  wildriver_dim_t nrows, ncols;\n  wildriver_ind_t nnz;\n\n  csr.getInfo(nrows,ncols,nnz);\n\n  testEquals(nrows,6);\n  testEquals(ncols,6);\n  testEquals(nnz,14);\n\n  std::unique_ptr<wildriver_ind_t[]> rowptr(new wildriver_ind_t[nrows+1]);\n  std::unique_ptr<wildriver_dim_t[]> rowind(new wildriver_dim_t[nnz]);\n  std::unique_ptr<wildriver_val_t[]> rowval(new wildriver_val_t[nnz]);\n\n  csr.read(rowptr.get(),rowind.get(),rowval.get(),nullptr);\n\n  \/\/ test rowptr\n  testEquals(rowptr[0],0);\n  testEquals(rowptr[1],2);\n  testEquals(rowptr[2],4);\n  testEquals(rowptr[3],7);\n  testEquals(rowptr[4],10);\n  testEquals(rowptr[5],12);\n  testEquals(rowptr[6],14);\n\n  \/\/ test rowind\n  testEquals(rowind[0],1);\n  testEquals(rowind[1],2);\n  testEquals(rowval[0],1);\n  testEquals(rowval[1],2);\n\n  testEquals(rowind[2],0);\n  testEquals(rowind[3],2);\n  testEquals(rowval[2],3);\n  testEquals(rowval[3],4);\n\n  testEquals(rowind[4],0);\n  testEquals(rowind[5],1);\n  testEquals(rowind[6],3);\n  testEquals(rowval[4],5);\n  testEquals(rowval[5],6);\n  testEquals(rowval[6],7);\n\n  testEquals(rowind[7],2);\n  testEquals(rowind[8],4);\n  testEquals(rowind[9],5);\n  testEquals(rowval[7],8);\n  testEquals(rowval[8],9);\n  testEquals(rowval[9],1);\n\n  testEquals(rowind[10],3);\n  testEquals(rowind[11],5);\n  testEquals(rowval[10],2);\n  testEquals(rowval[11],3);\n\n  testEquals(rowind[12],3);\n  testEquals(rowind[13],4);\n  testEquals(rowval[12],4);\n  testEquals(rowval[13],5);\n}\n\n\nvoid Test::run()\n{\n  std::string testFile(\".\/CSRFile_test.csr\");\n\n  writeTest(testFile);\n  readTest(testFile);\n\n}\n\n\n\n\n}\n<commit_msg>Update unit test for CSRFile base one<commit_after>\/**\n * @file CSRFile_test.cpp\n * @brief Test for reading and writing CSR formatted csrs.\n * @author Dominique LaSalle <wildriver@domnet.org>\n * Copyright 2015-2017\n * @version 1\n *\n *\/\n\n\n\n\n#include <iostream>\n#include <fstream>\n#include <memory>\n\n#include \"CSRFile.hpp\"\n#include \"DomTest.hpp\"\n\n\n\n\nusing namespace WildRiver;\n\n\n\n\nnamespace DomTest\n{\n\n\nstatic void writeTest(\n    std::string const & testFile)\n{\n  CSRFile csr(testFile);\n\n  csr.setInfo(6,6,14);\n\n  wildriver_ind_t rowptr[] = {0,2,4,7,10,12,14};\n  wildriver_dim_t rowind[] = {1,2,0,2,0,1,3,2,4,5,3,5,3,4};\n  wildriver_val_t rowval[] = {1,2,3,4,5,6,7,8,9,1,2,3,4,5};\n\n  csr.write(rowptr,rowind,rowval);\n}\n\n\nstatic void readTestBaseZero(\n    std::string const & testFile)\n{\n  std::ofstream fout(testFile, std::ofstream::trunc);\n  fout << \"1 1.0 2 2.0\" << std::endl;\n  fout << \"0 3.0 2 4.0\" << std::endl;\n  fout << \"0 5.0 1 6.0 3 7.0\" << std::endl;\n  fout << \"2 8.0 4 9.0 5 1.0\" << std::endl;\n  fout << \"3 2.0 5 3.0\" << std::endl;\n  fout << \"3 4.0 4 5.0\" << std::endl;\n\n  fout.close();\n\n  CSRFile csr(testFile);\n\n  wildriver_dim_t nrows, ncols;\n  wildriver_ind_t nnz;\n\n  csr.getInfo(nrows,ncols,nnz);\n\n  testEquals(nrows,6);\n  testEquals(ncols,6);\n  testEquals(nnz,14);\n\n  std::unique_ptr<wildriver_ind_t[]> rowptr(new wildriver_ind_t[nrows+1]);\n  std::unique_ptr<wildriver_dim_t[]> rowind(new wildriver_dim_t[nnz]);\n  std::unique_ptr<wildriver_val_t[]> rowval(new wildriver_val_t[nnz]);\n\n  csr.read(rowptr.get(),rowind.get(),rowval.get(),nullptr);\n\n  \/\/ test rowptr\n  testEquals(rowptr[0],0);\n  testEquals(rowptr[1],2);\n  testEquals(rowptr[2],4);\n  testEquals(rowptr[3],7);\n  testEquals(rowptr[4],10);\n  testEquals(rowptr[5],12);\n  testEquals(rowptr[6],14);\n\n  \/\/ test rowind\n  testEquals(rowind[0],1);\n  testEquals(rowind[1],2);\n  testEquals(rowval[0],1);\n  testEquals(rowval[1],2);\n\n  testEquals(rowind[2],0);\n  testEquals(rowind[3],2);\n  testEquals(rowval[2],3);\n  testEquals(rowval[3],4);\n\n  testEquals(rowind[4],0);\n  testEquals(rowind[5],1);\n  testEquals(rowind[6],3);\n  testEquals(rowval[4],5);\n  testEquals(rowval[5],6);\n  testEquals(rowval[6],7);\n\n  testEquals(rowind[7],2);\n  testEquals(rowind[8],4);\n  testEquals(rowind[9],5);\n  testEquals(rowval[7],8);\n  testEquals(rowval[8],9);\n  testEquals(rowval[9],1);\n\n  testEquals(rowind[10],3);\n  testEquals(rowind[11],5);\n  testEquals(rowval[10],2);\n  testEquals(rowval[11],3);\n\n  testEquals(rowind[12],3);\n  testEquals(rowind[13],4);\n  testEquals(rowval[12],4);\n  testEquals(rowval[13],5);\n}\n\n\nstatic void readTestBaseOne(\n    std::string const & testFile)\n{\n  std::ofstream fout(testFile, std::ofstream::trunc);\n  fout << \"2 1.0 3 2.0\" << std::endl;\n  fout << \"1 3.0 3 4.0\" << std::endl;\n  fout << \"1 5.0 2 6.0 4 7.0\" << std::endl;\n  fout << \"3 8.0 5 9.0 6 1.0\" << std::endl;\n  fout << \"4 2.0 6 3.0\" << std::endl;\n  fout << \"4 4.0 5 5.0\" << std::endl;\n\n  fout.close();\n\n  CSRFile csr(testFile);\n\n  wildriver_dim_t nrows, ncols;\n  wildriver_ind_t nnz;\n\n  csr.getInfo(nrows,ncols,nnz);\n\n  testEquals(nrows,6);\n  testEquals(ncols,6);\n  testEquals(nnz,14);\n\n  std::unique_ptr<wildriver_ind_t[]> rowptr(new wildriver_ind_t[nrows+1]);\n  std::unique_ptr<wildriver_dim_t[]> rowind(new wildriver_dim_t[nnz]);\n  std::unique_ptr<wildriver_val_t[]> rowval(new wildriver_val_t[nnz]);\n\n  csr.read(rowptr.get(),rowind.get(),rowval.get(),nullptr);\n\n  \/\/ test rowptr\n  testEquals(rowptr[0],0);\n  testEquals(rowptr[1],2);\n  testEquals(rowptr[2],4);\n  testEquals(rowptr[3],7);\n  testEquals(rowptr[4],10);\n  testEquals(rowptr[5],12);\n  testEquals(rowptr[6],14);\n\n  \/\/ test rowind\n  testEquals(rowind[0],1);\n  testEquals(rowind[1],2);\n  testEquals(rowval[0],1);\n  testEquals(rowval[1],2);\n\n  testEquals(rowind[2],0);\n  testEquals(rowind[3],2);\n  testEquals(rowval[2],3);\n  testEquals(rowval[3],4);\n\n  testEquals(rowind[4],0);\n  testEquals(rowind[5],1);\n  testEquals(rowind[6],3);\n  testEquals(rowval[4],5);\n  testEquals(rowval[5],6);\n  testEquals(rowval[6],7);\n\n  testEquals(rowind[7],2);\n  testEquals(rowind[8],4);\n  testEquals(rowind[9],5);\n  testEquals(rowval[7],8);\n  testEquals(rowval[8],9);\n  testEquals(rowval[9],1);\n\n  testEquals(rowind[10],3);\n  testEquals(rowind[11],5);\n  testEquals(rowval[10],2);\n  testEquals(rowval[11],3);\n\n  testEquals(rowind[12],3);\n  testEquals(rowind[13],4);\n  testEquals(rowval[12],4);\n  testEquals(rowval[13],5);\n}\n\n\n\nvoid Test::run()\n{\n  std::string testFile(\".\/CSRFile_test.csr\");\n\n  writeTest(testFile);\n\n  remove(testFile.c_str());\n\n  readTestBaseZero(testFile);\n\n  remove(testFile.c_str());\n\n  readTestBaseOne(testFile);\n\n  remove(testFile.c_str());\n\n}\n\n\n\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"swissknife_lease.h\"\n\n#include \"curl\/curl.h\"\n\nstatic bool CheckParams(const swissknife::CommandLease::Parameters& p) {\n  if (p.action != \"acquire\" && p.action != \"drop\") {\n    return false;\n  }\n\n  return true;\n}\n\nnamespace swissknife {\n\nCommandLease::~CommandLease() {\n}\n\nParameterList CommandLease::GetParams() const {\n    ParameterList r;\n    r.push_back(Parameter::Mandatory('u', \"repo service url\"));\n    r.push_back(Parameter::Mandatory('a', \"action (acquire or drop)\"));\n    r.push_back(Parameter::Mandatory('n', \"user name\"));\n    r.push_back(Parameter::Mandatory('p', \"lease path\"));\n    return r;\n}\n\nint CommandLease::Main(const ArgumentList& args) {\n  Parameters params;\n\n  params.repo_service_url = *(args.find('u')->second);\n  params.action = *(args.find('a')->second);\n  params.user_name = *(args.find('n')->second);\n  params.lease_path = *(args.find('p')->second);\n\n  if (!CheckParams(params)) return 2;\n\n  \/\/ Initialize curl\n  if (curl_global_init(CURL_GLOBAL_ALL)) {\n    return 1;\n  }\n\n  if (params.action == \"acquire\") {\n    \/\/ Acquire lease from repo services\n  } else if (params.action == \"drop\") {\n    \/\/ Drop the current lease\n  }\n\n  return 0;\n}\n\n}\n<commit_msg>WIP: Implementing lease acquisition in swissknife_lease<commit_after>#include \"swissknife_lease.h\"\n\n#include \"util\/pointer.h\"\n#include \"json_document.h\"\n#include \"json.h\"\n#include \"logging.h\"\n\n#include \"curl\/curl.h\"\n\nnamespace {\n\nbool CheckParams(const swissknife::CommandLease::Parameters& p) {\n  if (p.action != \"acquire\" && p.action != \"drop\") {\n    return false;\n  }\n\n  return true;\n}\n\n\/*size_t SendCB(void *buffer, size_t size, size_t nmemb, void *userp) {\n}*\/\n\nstruct CurlBuffer {\n  std::string data;\n};\n\nsize_t RecvCB(void *buffer, size_t size, size_t nmemb, void *userp) {\n  CurlBuffer* my_buffer = (CurlBuffer*)userp;\n\n  if (size * nmemb < 1) {\n    return 0;\n  }\n\n  my_buffer->data = static_cast<char*>(buffer);\n\n  return my_buffer->data.size();\n}\n\n}\n\nnamespace swissknife {\n\nCommandLease::~CommandLease() {\n}\n\nParameterList CommandLease::GetParams() const {\n    ParameterList r;\n    r.push_back(Parameter::Mandatory('u', \"repo service url\"));\n    r.push_back(Parameter::Mandatory('a', \"action (acquire or drop)\"));\n    r.push_back(Parameter::Mandatory('n', \"user name\"));\n    r.push_back(Parameter::Mandatory('p', \"lease path\"));\n    return r;\n}\n\nint CommandLease::Main(const ArgumentList& args) {\n  Parameters params;\n\n  params.repo_service_url = *(args.find('u')->second);\n  params.action = *(args.find('a')->second);\n  params.user_name = *(args.find('n')->second);\n  params.lease_path = *(args.find('p')->second);\n\n  if (!CheckParams(params)) return 2;\n\n  \/\/ Initialize curl\n  if (curl_global_init(CURL_GLOBAL_ALL)) {\n    return 1;\n  }\n\n  CURL* h_curl = curl_easy_init();\n  CURLcode ret = static_cast<CURLcode>(0);\n  if (h_curl) {\n    if (params.action == \"acquire\") {\n      \/\/ Prepare payload\n      std::string payload = \"{\\\"user\\\" : \\\"\" + params.user_name + \"\\\", \\\"path\\\" : \\\"\" + params.lease_path + \"\\\"}\";\n\n      \/\/ Make request to acquire lease from repo services\n      curl_easy_setopt(h_curl, CURLOPT_URL, (params.repo_service_url + \"\/api\/leases\").c_str());\n      curl_easy_setopt(h_curl, CURLOPT_NOPROGRESS, 1L);\n      curl_easy_setopt(h_curl, CURLOPT_POSTFIELDS, payload.c_str());\n      curl_easy_setopt(h_curl,\n                       CURLOPT_POSTFIELDSIZE_LARGE,\n                       static_cast<curl_off_t>(payload.length()));\n      curl_easy_setopt(h_curl, CURLOPT_USERAGENT, \"curl\/7.47.0\");\n      curl_easy_setopt(h_curl, CURLOPT_MAXREDIRS, 50L);\n      curl_easy_setopt(h_curl, CURLOPT_CUSTOMREQUEST, \"POST\");\n      curl_easy_setopt(h_curl, CURLOPT_TCP_KEEPALIVE, 1L);\n\n      CurlBuffer buffer;\n\n      curl_easy_setopt(h_curl, CURLOPT_WRITEFUNCTION, RecvCB);\n      curl_easy_setopt(h_curl, CURLOPT_WRITEDATA, &buffer);\n\n      ret = curl_easy_perform(h_curl);\n\n      curl_easy_cleanup(h_curl);\n      h_curl = NULL;\n\n      \/\/Parse reply\n      UniquePtr<JsonDocument> reply(JsonDocument::Create(buffer.data));\n      if (reply->IsValid()) {\n        JSON* result = JsonDocument::SearchInObject(reply->root(), \"status\", JSON_STRING);\n        if (result != NULL) {\n          std::string status = result->string_value;\n          if (status == \"ok\") {\n            LogCvmfs(kLogCvmfs, kLogStderr, \"Status: ok\");\n            JSON* token = JsonDocument::SearchInObject(reply->root(), \"session_token\", JSON_STRING);\n            if (token != NULL) {\n              LogCvmfs(kLogCvmfs, kLogStderr, \"Session token: %s\", token->string_value);\n              std::string session_token = token->string_value;\n              \/\/ Save session token to \/var\/spool\/cvmfs\/<REPO_NAME>\n              \/\/ TODO: Is there a special way to access the scratch directory?\n              std::string token_file_name = \"\/var\/spool\/cvmfs\/\" + params.lease_path + \"\/session_token\";\n              FILE* token_file = std::fopen(token_file_name.c_str(), \"w\");\n              if (token_file != NULL) {\n                std::fprintf(token_file, \"%s\", session_token.c_str());\n                std::fclose(token_file);\n              } else {\n                LogCvmfs(kLogCvmfs, kLogStderr, \"Error opening file: %s\", std::strerror(errno));\n              }\n            }\n          } else if (status == \"path_busy\") {\n            JSON* time_remaining = JsonDocument::SearchInObject(reply->root(), \"time_remaining\", JSON_INT);\n            if (time_remaining != NULL) {\n              LogCvmfs(kLogCvmfs, kLogStderr, \"Path busy. Time remaining = %d\", time_remaining->int_value);\n            }\n          } else if (status == \"error\") {\n            JSON* reason = JsonDocument::SearchInObject(reply->root(), \"reason\", JSON_STRING);\n            if (reason != NULL) {\n              LogCvmfs(kLogCvmfs, kLogStderr, \"Error: %s\", reason->string_value);\n            }\n          } else {\n            LogCvmfs(kLogCvmfs, kLogStderr, \"Unknown reply. Status: %s\", status.c_str());\n          }\n        }\n      }\n\n    } else if (params.action == \"drop\") {\n      \/\/ Drop the current lease\n    }\n  } else {\n    return 1;\n  }\n\n  return ret;\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"functors.hpp\"\n\n#include <cassert>\n#include <memory>\n#include <type_traits>\n#include <vector>\n\nnamespace cu\n{\n\ntemplate <typename ...Ts>\nclass Visitor;\n\ntemplate <>\nclass Visitor<>\n{\nprotected:\n  void visit() = delete;\n};\n\ntemplate <typename T, typename ...Ts>\nclass Visitor<T,Ts...> : public Visitor<Ts...>\n{\npublic:\n  virtual ~Visitor() = default;\n\n  using Visitor<Ts...>::visit;\n  virtual void visit( T& ) = 0;\n};\n\ntemplate <typename ...Ts>\nusing ConstVisitor = Visitor<const Ts...>;\n\n\ntemplate <typename ...Ts>\nclass VisitableBase\n{\npublic:\n  using Visitor = Visitor<Ts...>;\n  using ConstVisitor = ConstVisitor<Ts...>;\n\n  virtual ~VisitableBase() = default;\n\n  virtual void accept( Visitor & visitor ) = 0;\n  virtual void accept( ConstVisitor & visitor ) const = 0;\n};\n\n\n\/\/\/ Base should derive from @c VisitableBase<...,Derived,...>.\ntemplate <typename Derived, typename Base>\nclass VisitableImpl\n    : public Base\n{\npublic:\n  using Visitor = typename Base::Visitor;\n  using ConstVisitor = typename Base::ConstVisitor;\n\n  using Base::Base;\n\n  virtual void accept( Visitor & visitor ) override\n  {\n    assert( dynamic_cast<Derived*>(this) &&\n            \"The dynamic type of this object must be 'Derived' \"\n            \"or inherit from it.\" );\n    visitor.visit( static_cast<Derived&>(*this) );\n  }\n\n  virtual void accept( ConstVisitor & visitor ) const override\n  {\n    assert( dynamic_cast<const Derived*>(this) &&\n            \"The dynamic type of this object must be 'Derived' \"\n            \"or inherit from it.\" );\n    visitor.visit( static_cast<const Derived&>(*this) );\n  }\n};\n\n\nnamespace detail\n{\n\n  template <typename ...Ts>\n  class VisitorImpl;\n\n  template <typename F, typename Result, typename VisitorBase>\n  class VisitorImpl<F, Result, VisitorBase>\n      : public VisitorBase\n  {\n  public:\n    VisitorImpl( F && f_ )\n      : f(std::forward<F>(f_))\n    {}\n\n    Result && getResult()\n    {\n      return std::move(result);\n    }\n\n  protected:\n    template <typename T>\n    void doVisit( T && arg )\n    {\n      result = std::forward<F>(f)( std::forward<T>(arg) );\n    }\n\n  private:\n    Result result{};\n    F && f;\n  };\n\n  template <typename F,\n            typename VisitorBase>\n  class VisitorImpl<F, void, VisitorBase>\n      : public VisitorBase\n  {\n  public:\n    VisitorImpl( F && f_ )\n      : f(std::forward<F>(f_))\n    {}\n\n    void getResult()\n    {}\n\n  protected:\n    template <typename T>\n    void doVisit( T && arg )\n    {\n      std::forward<F>(f)( std::forward<T>(arg) );\n    }\n\n  private:\n    F && f;\n  };\n\n  template <typename F,\n            typename Result,\n            typename VisitorBase,\n            typename T,\n            typename ...Ts>\n  class VisitorImpl<F, Result, VisitorBase, T, Ts...>\n      : public VisitorImpl<F, Result, VisitorBase, Ts...>\n  {\n    using DirectBase = VisitorImpl<F, Result, VisitorBase, Ts...>;\n  public:\n    using DirectBase::DirectBase;\n    using VisitorBase::visit;\n    virtual void visit( T & x ) override\n    {\n      this->doVisit( x );\n    }\n  };\n\n} \/\/ namespace detail\n\ntemplate <typename ...Ts, typename F>\nauto visit( VisitableBase<Ts...> & visitable, F && f )\n{\n  using Result = std::common_type_t<std::result_of_t<F&&(Ts&)>...>;\n  detail::VisitorImpl<F, Result, Visitor<Ts...>, Ts...> visitor{\n    std::forward<F>(f) };\n  visitable.accept( visitor );\n  return visitor.getResult();\n}\n\ntemplate <typename ...Ts, typename F>\nauto visit( const VisitableBase<Ts...> & visitable, F && f )\n{\n  using Result = std::common_type_t<std::result_of_t<F&&(Ts&)>...>;\n  detail::VisitorImpl<F, Result, ConstVisitor<Ts...>, const Ts...> visitor{\n    std::forward<F>(f) };\n  visitable.accept( visitor );\n  return visitor.getResult();\n}\n\ntemplate <typename ...Ts, typename ...Fs>\ndecltype(auto) visit( VisitableBase<Ts...> & visitable, Fs &&... fs )\n{\n  return visit( visitable, makeOverloadedFunctor( fs... ) );\n}\n\ntemplate <typename ...Ts, typename ...Fs>\ndecltype(auto) visit( const VisitableBase<Ts...> & visitable, Fs &&... fs )\n{\n  return visit( visitable, makeOverloadedFunctor( fs... ) );\n}\n\n\nnamespace detail\n{\n\n  template <typename VisitableTemplate>\n  decltype(auto) makeGenericCloner()\n  {\n    return []( const auto & item )\n    {\n      return std::unique_ptr<VisitableTemplate>(\n            std::make_unique<std::decay_t<decltype(item)>>( item ) );\n    };\n  }\n\n} \/\/ namespace detail\n\ntemplate <typename VisitableTemplate>\nauto clone( const VisitableTemplate & item )\n  -> decltype( visit( item, detail::makeGenericCloner<VisitableTemplate>() ) )\n{\n  return visit( item, detail::makeGenericCloner<VisitableTemplate>() );\n}\n\ntemplate <typename VisitableTemplate>\nauto clone( const std::vector<std::unique_ptr<VisitableTemplate> > & v )\n  -> decltype( (void)clone( *v[0] ),\n               std::unique_ptr<std::vector<std::unique_ptr<VisitableTemplate> > >() )\n{\n  auto result = std::make_unique<std::vector<std::unique_ptr<VisitableTemplate> > >();\n  for ( const auto & x : v )\n    result->push_back( clone( *x ) );\n\n  return result;\n}\n\n} \/\/ namespace cu\n<commit_msg>Added isEqual() function for visitable classes.<commit_after>#pragma once\n\n#include \"functors.hpp\"\n\n#include <cassert>\n#include <memory>\n#include <type_traits>\n#include <vector>\n\nnamespace cu\n{\n\ntemplate <typename ...Ts>\nclass Visitor;\n\ntemplate <>\nclass Visitor<>\n{\nprotected:\n  void visit() = delete;\n};\n\ntemplate <typename T, typename ...Ts>\nclass Visitor<T,Ts...> : public Visitor<Ts...>\n{\npublic:\n  virtual ~Visitor() = default;\n\n  using Visitor<Ts...>::visit;\n  virtual void visit( T& ) = 0;\n};\n\ntemplate <typename ...Ts>\nusing ConstVisitor = Visitor<const Ts...>;\n\n\ntemplate <typename ...Ts>\nclass VisitableBase\n{\npublic:\n  using Visitor = Visitor<Ts...>;\n  using ConstVisitor = ConstVisitor<Ts...>;\n\n  virtual ~VisitableBase() = default;\n\n  virtual void accept( Visitor & visitor ) = 0;\n  virtual void accept( ConstVisitor & visitor ) const = 0;\n};\n\n\n\/\/\/ Base should derive from @c VisitableBase<...,Derived,...>.\ntemplate <typename Derived, typename Base>\nclass VisitableImpl\n    : public Base\n{\npublic:\n  using Visitor = typename Base::Visitor;\n  using ConstVisitor = typename Base::ConstVisitor;\n\n  using Base::Base;\n\n  virtual void accept( Visitor & visitor ) override\n  {\n    assert( dynamic_cast<Derived*>(this) &&\n            \"The dynamic type of this object must be 'Derived' \"\n            \"or inherit from it.\" );\n    visitor.visit( static_cast<Derived&>(*this) );\n  }\n\n  virtual void accept( ConstVisitor & visitor ) const override\n  {\n    assert( dynamic_cast<const Derived*>(this) &&\n            \"The dynamic type of this object must be 'Derived' \"\n            \"or inherit from it.\" );\n    visitor.visit( static_cast<const Derived&>(*this) );\n  }\n};\n\n\nnamespace detail\n{\n\n  template <typename ...Ts>\n  class VisitorImpl;\n\n  template <typename F, typename Result, typename VisitorBase>\n  class VisitorImpl<F, Result, VisitorBase>\n      : public VisitorBase\n  {\n  public:\n    VisitorImpl( F && f_ )\n      : f(std::forward<F>(f_))\n    {}\n\n    Result && getResult()\n    {\n      return std::move(result);\n    }\n\n  protected:\n    template <typename T>\n    void doVisit( T && arg )\n    {\n      result = std::forward<F>(f)( std::forward<T>(arg) );\n    }\n\n  private:\n    Result result{};\n    F && f;\n  };\n\n  template <typename F,\n            typename VisitorBase>\n  class VisitorImpl<F, void, VisitorBase>\n      : public VisitorBase\n  {\n  public:\n    VisitorImpl( F && f_ )\n      : f(std::forward<F>(f_))\n    {}\n\n    void getResult()\n    {}\n\n  protected:\n    template <typename T>\n    void doVisit( T && arg )\n    {\n      std::forward<F>(f)( std::forward<T>(arg) );\n    }\n\n  private:\n    F && f;\n  };\n\n  template <typename F,\n            typename Result,\n            typename VisitorBase,\n            typename T,\n            typename ...Ts>\n  class VisitorImpl<F, Result, VisitorBase, T, Ts...>\n      : public VisitorImpl<F, Result, VisitorBase, Ts...>\n  {\n    using DirectBase = VisitorImpl<F, Result, VisitorBase, Ts...>;\n  public:\n    using DirectBase::DirectBase;\n    using VisitorBase::visit;\n    virtual void visit( T & x ) override\n    {\n      this->doVisit( x );\n    }\n  };\n\n} \/\/ namespace detail\n\ntemplate <typename ...Ts, typename F>\nauto visit( VisitableBase<Ts...> & visitable, F && f )\n{\n  using Result = std::common_type_t<std::result_of_t<F&&(Ts&)>...>;\n  detail::VisitorImpl<F, Result, Visitor<Ts...>, Ts...> visitor{\n    std::forward<F>(f) };\n  visitable.accept( visitor );\n  return visitor.getResult();\n}\n\ntemplate <typename ...Ts, typename F>\nauto visit( const VisitableBase<Ts...> & visitable, F && f )\n{\n  using Result = std::common_type_t<std::result_of_t<F&&(Ts&)>...>;\n  detail::VisitorImpl<F, Result, ConstVisitor<Ts...>, const Ts...> visitor{\n    std::forward<F>(f) };\n  visitable.accept( visitor );\n  return visitor.getResult();\n}\n\ntemplate <typename ...Ts, typename ...Fs>\ndecltype(auto) visit( VisitableBase<Ts...> & visitable, Fs &&... fs )\n{\n  return visit( visitable, makeOverloadedFunctor( fs... ) );\n}\n\ntemplate <typename ...Ts, typename ...Fs>\ndecltype(auto) visit( const VisitableBase<Ts...> & visitable, Fs &&... fs )\n{\n  return visit( visitable, makeOverloadedFunctor( fs... ) );\n}\n\n\nnamespace detail\n{\n\n  template <typename VisitableTemplate>\n  decltype(auto) makeGenericCloner()\n  {\n    return []( const auto & item )\n    {\n      return std::unique_ptr<VisitableTemplate>(\n            std::make_unique<std::decay_t<decltype(item)>>( item ) );\n    };\n  }\n\n} \/\/ namespace detail\n\ntemplate <typename VisitableTemplate>\nauto clone( const VisitableTemplate & item )\n  -> decltype( visit( item, detail::makeGenericCloner<VisitableTemplate>() ) )\n{\n  return visit( item, detail::makeGenericCloner<VisitableTemplate>() );\n}\n\ntemplate <typename VisitableTemplate>\nauto clone( const std::vector<std::unique_ptr<VisitableTemplate> > & v )\n  -> decltype( (void)clone( *v[0] ),\n               std::unique_ptr<std::vector<std::unique_ptr<VisitableTemplate> > >() )\n{\n  auto result = std::make_unique<std::vector<std::unique_ptr<VisitableTemplate> > >();\n  for ( const auto & x : v )\n    result->push_back( clone( *x ) );\n\n  return result;\n}\n\n\nnamespace detail\n{\n\n  struct IsEqualFunctor\n  {\n    template <typename T>\n    bool operator()( const T & lhs, const T & rhs ) const\n    {\n      return lhs == rhs;\n    }\n\n    template <typename T1, typename T2>\n    bool operator()( const T1 &, const T2 & ) const\n    {\n      return false;\n    }\n  };\n\n} \/\/ namespace detail\n\ntemplate <typename VisitableTemplate>\nbool isEqual( const VisitableTemplate & lhs, const VisitableTemplate & rhs )\n{\n  return visit( lhs, [&rhs]( const auto & lhs )\n  {\n    return visit( rhs, [&lhs]( const auto & rhs )\n    {\n      return detail::IsEqualFunctor()( lhs, rhs );\n    });\n  });\n}\n\n} \/\/ namespace cu\n<|endoftext|>"}
{"text":"<commit_before>#include <QString>\n#include <QVector>\n#include <QSqlQuery>\n#include <QSqlRecord>\n#include <QSqlError>\n\n#include \"raster.h\"\n#include \"pixeliterator.h\"\n\n\nusing namespace Ilwis;\n\nbool PixelIterator::isValid() const {\n    return _isValid;\n}\n\nPixelIterator::PixelIterator() : _localOffset(0), _currentBlock(0), _step(0), _flow(fXYZ),_isValid(false),_positionid(0) {\n\n}\n\nPixelIterator::PixelIterator(IGridCoverage raster, const Box3D<>& box, double step) :\n    _raster(raster),\n    _box(box),\n    _localOffset(0),\n    _currentBlock(0),\n    _step(step),\n    _flow(fXYZ),\n    _isValid(false)\n{\n    init();\n}\n\nPixelIterator::PixelIterator(const PixelIterator& iter)  {\n    copy(iter);\n}\n\ninline PixelIterator::PixelIterator(quint64 posid ) :\n    _localOffset(0),\n    _currentBlock(0),\n    _step(0),\n    _flow(fXYZ),\n    _isValid(false),\n    _positionid(posid)\n{\n}\n\n\nvoid PixelIterator::copy(const PixelIterator &iter) {\n    _raster = iter._raster;\n    if ( _raster.isValid()) \/\/ TODO beyond end marker(end()) dont have a valid raster, no problem just yet but it maybe needed in the future\n        _grid = _raster->_grid.data();\n    _box = iter._box;\n    _step = iter._step;\n    _isValid = iter._isValid;\n    _flow = iter._flow;\n    _positionid = iter._positionid;\n    _x = iter._x;\n    _y = iter._y;\n    _z = iter._z;\n    _endx = iter._endx;\n    _endy = iter._endy;\n    _endz = iter._endz;\n    _positionid = iter._positionid;\n    _endpositionid = iter._endpositionid;\n    _localOffset = iter._localOffset;\n    _currentBlock = iter._currentBlock;\n\n}\n\nvoid PixelIterator::init() {\n    const Size& sz = _raster->size();\n    if ( _box.isNull()) {\n        _box = Box3D<>(sz);\n    }\n    _box.ensure(sz);\n\n    _x = _box.min_corner().x();\n    _y = _box.min_corner().y();\n    _z = _box.min_corner().z();\n\n    _endx = _box.max_corner().x();\n    _endy = _box.max_corner().y();\n    _endz = _box.max_corner().z();\n\n    bool inside = contains(Pixel(_x,_y));\n    if ( inside) {\n        _raster->pix2value(Voxel(_x,_y,0));\n        _grid = _raster->_grid.data();\n    }\n\n    initPosition();\n    quint64 shift = _x + _y * 1e5 + (_z + 1) *1e10;\n    _endpositionid = _positionid + shift;\n    \/\/_endpositionid = _endx + _endy * 1e5 + _endz*1e10 + _raster->id() * 1e13;\n    _isValid = inside;\n    _xChanged = _yChanged = _zChanged = false;\n}\n\ninline bool PixelIterator::moveXYZ(int n) {\n    _x += n * _step;\n    _localOffset += n;\n    _xChanged = true;\n    _yChanged = _zChanged = false;\n    if ( _x > _endx) {\n        ++_y;\n        _x = _box.min_corner().x();\n        _yChanged = true;\n        _localOffset += _x;\n        if ( (_y % _grid->maxLines()) == 0) {\n            ++_currentBlock;\n            _localOffset = 0;\n        }\n        if ( _y > _endy) {\n            ++_z;\n            ++_currentBlock;\n            _zChanged = true;\n            _y = _box.min_corner().y();\n            _localOffset = 0;\n            if ( _z >= _endz) { \/\/ done with this iteration block\n                _positionid = _endpositionid;\n                return false;\n            }\n        }\n    }\n    return true;\n}\n\ninline bool PixelIterator::isAtEnd() const {\n    return _x == _box.max_corner().x() &&\n           _y == _box.max_corner().y() &&\n            _z == _box.max_corner().z();\n}\n\nVoxel PixelIterator::position() const\n{\n    return Voxel(_x, _y, _z);\n}\n\ninline bool PixelIterator::move(int n) {\n    if (isAtEnd()) {\n        _positionid = _endpositionid;\n        return false;\n    }\n    bool ok;\n    if ( _flow == fXYZ) {\n        ok = moveXYZ(n);\n    }\n    else if ( _flow == fYXZ){\n    }\n    if (ok)\n        _positionid = calcPosId();\n\n    return ok;\n}\n\nPixelIterator& PixelIterator::operator=(const PixelIterator& iter) {\n    copy(iter);\n    return *this;\n}\n\ninline PixelIterator PixelIterator::operator++(int) {\n    PixelIterator temp(*this);\n    if(!move(1))\n        return end();\n    return temp;\n}\ninline PixelIterator PixelIterator::operator--(int) {\n    PixelIterator temp(*this);\n    move(-1);\n    return temp;\n}\n\nbool PixelIterator::operator==(const PixelIterator& iter) const{\n    return _positionid == iter._positionid;\n}\n\nbool PixelIterator::operator!=(const PixelIterator& iter) const{\n    return ! operator ==(iter);\n}\n\n\n\nPixelIterator PixelIterator::end() const {\n    return PixelIterator(_endpositionid);\n}\n\nvoid PixelIterator::setFlow(Flow flw) {\n    _flow = flw;\n}\n\nbool PixelIterator::contains(const Pixel& pix) {\n    return pix.x() >= _box.min_corner().x() &&\n            pix.x() < _box.max_corner().x()  &&\n            pix.y() >= _box.min_corner().y() &&\n            pix.y() < _box.max_corner().y();\n\n}\n\nbool PixelIterator::xchanged() const {\n    return _xChanged;\n}\n\nbool PixelIterator::ychanged() const {\n    return _yChanged;\n}\n\nbool PixelIterator::zchanged() const {\n    return _zChanged;\n}\n\nvoid PixelIterator::initPosition() {\n    const Size& sz = _raster->size();\n    quint64 linearPos = _y * sz.xsize() + _x;\n    _currentBlock = _y \/ _grid->maxLines();\n    _localOffset = linearPos - _currentBlock * _grid->maxLines() * sz.xsize();\n    _currentBlock += _z * _grid->blocksPerBand();\n\n    _positionid = calcPosId();\n}\n\n\n<commit_msg>initialization of grid now in a more logical way<commit_after>#include <QString>\n#include <QVector>\n#include <QSqlQuery>\n#include <QSqlRecord>\n#include <QSqlError>\n\n#include \"raster.h\"\n#include \"pixeliterator.h\"\n\n\nusing namespace Ilwis;\n\nbool PixelIterator::isValid() const {\n    return _isValid;\n}\n\nPixelIterator::PixelIterator() : _localOffset(0), _currentBlock(0), _step(0), _flow(fXYZ),_isValid(false),_positionid(0) {\n\n}\n\nPixelIterator::PixelIterator(IGridCoverage raster, const Box3D<>& box, double step) :\n    _raster(raster),\n    _box(box),\n    _localOffset(0),\n    _currentBlock(0),\n    _step(step),\n    _flow(fXYZ),\n    _isValid(false)\n{\n    init();\n}\n\nPixelIterator::PixelIterator(const PixelIterator& iter)  {\n    copy(iter);\n}\n\ninline PixelIterator::PixelIterator(quint64 posid ) :\n    _localOffset(0),\n    _currentBlock(0),\n    _step(0),\n    _flow(fXYZ),\n    _isValid(false),\n    _positionid(posid)\n{\n}\n\n\nvoid PixelIterator::copy(const PixelIterator &iter) {\n    _raster = iter._raster;\n    if ( _raster.isValid()) \/\/ TODO beyond end marker(end()) dont have a valid raster, no problem just yet but it maybe needed in the future\n        _grid = _raster->_grid.data();\n    _box = iter._box;\n    _step = iter._step;\n    _isValid = iter._isValid;\n    _flow = iter._flow;\n    _positionid = iter._positionid;\n    _x = iter._x;\n    _y = iter._y;\n    _z = iter._z;\n    _endx = iter._endx;\n    _endy = iter._endy;\n    _endz = iter._endz;\n    _positionid = iter._positionid;\n    _endpositionid = iter._endpositionid;\n    _localOffset = iter._localOffset;\n    _currentBlock = iter._currentBlock;\n\n}\n\nvoid PixelIterator::init() {\n    const Size& sz = _raster->size();\n    if ( _box.isNull()) {\n        _box = Box3D<>(sz);\n    }\n    _box.ensure(sz);\n\n    _x = _box.min_corner().x();\n    _y = _box.min_corner().y();\n    _z = _box.min_corner().z();\n\n    _endx = _box.max_corner().x();\n    _endy = _box.max_corner().y();\n    _endz = _box.max_corner().z();\n\n    bool inside = contains(Pixel(_x,_y));\n    if ( inside) {\n        _grid = _raster->grid();\n    }\n\n    initPosition();\n    quint64 shift = _x + _y * 1e5 + (_z + 1) *1e10;\n    _endpositionid = _positionid + shift;\n    \/\/_endpositionid = _endx + _endy * 1e5 + _endz*1e10 + _raster->id() * 1e13;\n    _isValid = inside;\n    _xChanged = _yChanged = _zChanged = false;\n}\n\ninline bool PixelIterator::moveXYZ(int n) {\n    _x += n * _step;\n    _localOffset += n;\n    _xChanged = true;\n    _yChanged = _zChanged = false;\n    if ( _x > _endx) {\n        ++_y;\n        _x = _box.min_corner().x();\n        _yChanged = true;\n        _localOffset += _x;\n        if ( (_y % _grid->maxLines()) == 0) {\n            ++_currentBlock;\n            _localOffset = 0;\n        }\n        if ( _y > _endy) {\n            ++_z;\n            ++_currentBlock;\n            _zChanged = true;\n            _y = _box.min_corner().y();\n            _localOffset = 0;\n            if ( _z >= _endz) { \/\/ done with this iteration block\n                _positionid = _endpositionid;\n                return false;\n            }\n        }\n    }\n    return true;\n}\n\ninline bool PixelIterator::isAtEnd() const {\n    return _x == _box.max_corner().x() &&\n           _y == _box.max_corner().y() &&\n            _z == _box.max_corner().z();\n}\n\nVoxel PixelIterator::position() const\n{\n    return Voxel(_x, _y, _z);\n}\n\ninline bool PixelIterator::move(int n) {\n    if (isAtEnd()) {\n        _positionid = _endpositionid;\n        return false;\n    }\n    bool ok;\n    if ( _flow == fXYZ) {\n        ok = moveXYZ(n);\n    }\n    else if ( _flow == fYXZ){\n    }\n    if (ok)\n        _positionid = calcPosId();\n\n    return ok;\n}\n\nPixelIterator& PixelIterator::operator=(const PixelIterator& iter) {\n    copy(iter);\n    return *this;\n}\n\ninline PixelIterator PixelIterator::operator++(int) {\n    PixelIterator temp(*this);\n    if(!move(1))\n        return end();\n    return temp;\n}\ninline PixelIterator PixelIterator::operator--(int) {\n    PixelIterator temp(*this);\n    move(-1);\n    return temp;\n}\n\nbool PixelIterator::operator==(const PixelIterator& iter) const{\n    return _positionid == iter._positionid;\n}\n\nbool PixelIterator::operator!=(const PixelIterator& iter) const{\n    return ! operator ==(iter);\n}\n\n\n\nPixelIterator PixelIterator::end() const {\n    return PixelIterator(_endpositionid);\n}\n\nvoid PixelIterator::setFlow(Flow flw) {\n    _flow = flw;\n}\n\nbool PixelIterator::contains(const Pixel& pix) {\n    return pix.x() >= _box.min_corner().x() &&\n            pix.x() < _box.max_corner().x()  &&\n            pix.y() >= _box.min_corner().y() &&\n            pix.y() < _box.max_corner().y();\n\n}\n\nbool PixelIterator::xchanged() const {\n    return _xChanged;\n}\n\nbool PixelIterator::ychanged() const {\n    return _yChanged;\n}\n\nbool PixelIterator::zchanged() const {\n    return _zChanged;\n}\n\nvoid PixelIterator::initPosition() {\n    const Size& sz = _raster->size();\n    quint64 linearPos = _y * sz.xsize() + _x;\n    _currentBlock = _y \/ _grid->maxLines();\n    _localOffset = linearPos - _currentBlock * _grid->maxLines() * sz.xsize();\n    _currentBlock += _z * _grid->blocksPerBand();\n\n    _positionid = calcPosId();\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 <boost\/math\/constants\/constants.hpp>\n\n#include \"KEYObject.h\"\n#include \"KEYPath.h\"\n#include \"KEYShape.h\"\n#include \"KEYTypes.h\"\n\n#include \"KEYShapeTest.h\"\n\nnamespace test\n{\n\nnamespace m = boost::math::constants;\n\nusing libetonyek::KEYPath;\nusing libetonyek::KEYPathPtr_t;\nusing libetonyek::KEYSize;\n\nvoid KEYShapeTest::setUp()\n{\n}\n\nvoid KEYShapeTest::tearDown()\n{\n}\n\nvoid KEYShapeTest::testMakePolygonPath()\n{\n  using libetonyek::makePolygonPath;\n\n  const KEYSize size(100, 100);\n\n  \/\/ triangle\n  {\n    const double d = 25 * (2 - m::root_three<double>());\n\n    \/\/ FIXME: the shape is not scaled to whole width...\n    KEYPath ref;\n    ref.appendMoveTo(50, 0);\n    ref.appendLineTo(100 - d, 75);\n    ref.appendLineTo(d, 75);\n    ref.appendClose();\n\n    const KEYPathPtr_t test = makePolygonPath(size, 3);\n\n    CPPUNIT_ASSERT(bool(test));\n    CPPUNIT_ASSERT(*test == ref);\n  }\n\n  \/\/ diamond\n  {\n    KEYPath ref;\n    ref.appendMoveTo(50, 0);\n    ref.appendLineTo(100, 50);\n    ref.appendLineTo(50, 100);\n    ref.appendLineTo(0, 50);\n    ref.appendClose();\n\n    const KEYPathPtr_t test = makePolygonPath(size, 4);\n\n    CPPUNIT_ASSERT(bool(test));\n    CPPUNIT_ASSERT(*test == ref);\n  }\n\n  \/\/ octagon\n  {\n    const double d = 25 * (2 - m::root_two<double>());\n\n    KEYPath ref;\n    ref.appendMoveTo(50, 0);\n    ref.appendLineTo(100 - d, d);\n    ref.appendLineTo(100, 50);\n    ref.appendLineTo(100 - d, 100 -d);\n    ref.appendLineTo(50, 100);\n    ref.appendLineTo(d, 100 - d);\n    ref.appendLineTo(0, 50);\n    ref.appendLineTo(d, d);\n    ref.appendClose();\n\n    const KEYPathPtr_t test = makePolygonPath(size, 8);\n\n    CPPUNIT_ASSERT(bool(test));\n    CPPUNIT_ASSERT(*test == ref);\n  }\n}\n\nvoid KEYShapeTest::testMakeRoundedRectanglePath()\n{\n  \/\/ TODO: implement me\n}\n\nvoid KEYShapeTest::testMakeArrowPath()\n{\n  \/\/ TODO: implement me\n}\n\nvoid KEYShapeTest::testMakeDoubleArrowPath()\n{\n  \/\/ TODO: implement me\n}\n\nvoid KEYShapeTest::testMakeStarPath()\n{\n  \/\/ TODO: implement me\n}\n\nvoid KEYShapeTest::testMakeConnectionPath()\n{\n  \/\/ TODO: implement me\n}\n\nvoid KEYShapeTest::testMakeCalloutPath()\n{\n  \/\/ TODO: implement me\n}\n\nvoid KEYShapeTest::testMakeQuoteBubblePath()\n{\n  \/\/ TODO: implement me\n}\n\nCPPUNIT_TEST_SUITE_REGISTRATION(KEYShapeTest);\n\n}\n\n\/* vim:set shiftwidth=2 softtabstop=2 expandtab: *\/\n<commit_msg>somehow this constant is not there in older boost<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\/math\/constants\/constants.hpp>\n\n#include \"KEYObject.h\"\n#include \"KEYPath.h\"\n#include \"KEYShape.h\"\n#include \"KEYTypes.h\"\n\n#include \"KEYShapeTest.h\"\n\nnamespace test\n{\n\nnamespace m = boost::math::constants;\n\nusing libetonyek::KEYPath;\nusing libetonyek::KEYPathPtr_t;\nusing libetonyek::KEYSize;\n\nconst double etonyek_root_three(1.73205080756887729352744634150587236694280525381038062805580697945193301690880003708114618675724857567562614142e+00);\n\nvoid KEYShapeTest::setUp()\n{\n}\n\nvoid KEYShapeTest::tearDown()\n{\n}\n\nvoid KEYShapeTest::testMakePolygonPath()\n{\n  using libetonyek::makePolygonPath;\n\n  const KEYSize size(100, 100);\n\n  \/\/ triangle\n  {\n    const double d = 25 * (2 - etonyek_root_three);\n\n    \/\/ FIXME: the shape is not scaled to whole width...\n    KEYPath ref;\n    ref.appendMoveTo(50, 0);\n    ref.appendLineTo(100 - d, 75);\n    ref.appendLineTo(d, 75);\n    ref.appendClose();\n\n    const KEYPathPtr_t test = makePolygonPath(size, 3);\n\n    CPPUNIT_ASSERT(bool(test));\n    CPPUNIT_ASSERT(*test == ref);\n  }\n\n  \/\/ diamond\n  {\n    KEYPath ref;\n    ref.appendMoveTo(50, 0);\n    ref.appendLineTo(100, 50);\n    ref.appendLineTo(50, 100);\n    ref.appendLineTo(0, 50);\n    ref.appendClose();\n\n    const KEYPathPtr_t test = makePolygonPath(size, 4);\n\n    CPPUNIT_ASSERT(bool(test));\n    CPPUNIT_ASSERT(*test == ref);\n  }\n\n  \/\/ octagon\n  {\n    const double d = 25 * (2 - m::root_two<double>());\n\n    KEYPath ref;\n    ref.appendMoveTo(50, 0);\n    ref.appendLineTo(100 - d, d);\n    ref.appendLineTo(100, 50);\n    ref.appendLineTo(100 - d, 100 -d);\n    ref.appendLineTo(50, 100);\n    ref.appendLineTo(d, 100 - d);\n    ref.appendLineTo(0, 50);\n    ref.appendLineTo(d, d);\n    ref.appendClose();\n\n    const KEYPathPtr_t test = makePolygonPath(size, 8);\n\n    CPPUNIT_ASSERT(bool(test));\n    CPPUNIT_ASSERT(*test == ref);\n  }\n}\n\nvoid KEYShapeTest::testMakeRoundedRectanglePath()\n{\n  \/\/ TODO: implement me\n}\n\nvoid KEYShapeTest::testMakeArrowPath()\n{\n  \/\/ TODO: implement me\n}\n\nvoid KEYShapeTest::testMakeDoubleArrowPath()\n{\n  \/\/ TODO: implement me\n}\n\nvoid KEYShapeTest::testMakeStarPath()\n{\n  \/\/ TODO: implement me\n}\n\nvoid KEYShapeTest::testMakeConnectionPath()\n{\n  \/\/ TODO: implement me\n}\n\nvoid KEYShapeTest::testMakeCalloutPath()\n{\n  \/\/ TODO: implement me\n}\n\nvoid KEYShapeTest::testMakeQuoteBubblePath()\n{\n  \/\/ TODO: implement me\n}\n\nCPPUNIT_TEST_SUITE_REGISTRATION(KEYShapeTest);\n\n}\n\n\/* vim:set shiftwidth=2 softtabstop=2 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: calendar_gregorian.hxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: obo $ $Date: 2005-03-15 13:41:57 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef _I18N_CALENDAR_GREGORIAN_HXX_\n#define _I18N_CALENDAR_GREGORIAN_HXX_\n\n#include \"calendarImpl.hxx\"\n#include \"nativenumbersupplier.hxx\"\n#include \"unicode\/calendar.h\"\n\n\/\/  ----------------------------------------------------\n\/\/  class Calendar_gregorian\n\/\/  ----------------------------------------------------\n\nnamespace com { namespace sun { namespace star { namespace i18n {\n\nstruct Era {\n    sal_Int32 year;\n    sal_Int32 month;\n    sal_Int32 day;\n};\n\nclass Calendar_gregorian : public CalendarImpl\n{\npublic:\n\n    \/\/ Constructors\n    Calendar_gregorian();\n    Calendar_gregorian(Era *_eraArray);\n\n    \/**\n    * Destructor\n    *\/\n    ~Calendar_gregorian();\n\n    \/\/ Methods\n    virtual void SAL_CALL loadCalendar(const rtl::OUString& uniqueID, const com::sun::star::lang::Locale& rLocale) throw(com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL setDateTime(double nTimeInDays) throw(com::sun::star::uno::RuntimeException);\n    virtual double SAL_CALL getDateTime() throw(com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL setValue( sal_Int16 nFieldIndex, sal_Int16 nValue ) throw(com::sun::star::uno::RuntimeException);\n    virtual sal_Int16 SAL_CALL getValue(sal_Int16 nFieldIndex) throw(com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL addValue(sal_Int16 nFieldIndex, sal_Int32 nAmount) throw(com::sun::star::uno::RuntimeException);\n    virtual sal_Bool SAL_CALL isValid() throw (com::sun::star::uno::RuntimeException);\n    virtual Calendar SAL_CALL getLoadedCalendar() throw(com::sun::star::uno::RuntimeException);\n    virtual rtl::OUString SAL_CALL getUniqueID() throw(com::sun::star::uno::RuntimeException);\n    virtual sal_Int16 SAL_CALL getFirstDayOfWeek() throw(com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL setFirstDayOfWeek(sal_Int16 nDay) throw(com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL setMinimumNumberOfDaysForFirstWeek(sal_Int16 nDays) throw(com::sun::star::uno::RuntimeException);\n    virtual sal_Int16 SAL_CALL getMinimumNumberOfDaysForFirstWeek() throw(com::sun::star::uno::RuntimeException);\n    virtual sal_Int16 SAL_CALL getNumberOfMonthsInYear() throw(com::sun::star::uno::RuntimeException);\n    virtual sal_Int16 SAL_CALL getNumberOfDaysInWeek() throw(com::sun::star::uno::RuntimeException);\n    virtual com::sun::star::uno::Sequence < CalendarItem > SAL_CALL getMonths() throw(com::sun::star::uno::RuntimeException);\n    virtual com::sun::star::uno::Sequence < CalendarItem > SAL_CALL getDays() throw(com::sun::star::uno::RuntimeException);\n    virtual rtl::OUString SAL_CALL getDisplayName(sal_Int16 nCalendarDisplayIndex, sal_Int16 nIdx, sal_Int16 nNameType) throw(com::sun::star::uno::RuntimeException);\n\n    \/\/ Methods in XExtendedCalendar\n    virtual rtl::OUString SAL_CALL getDisplayString( sal_Int32 nCalendarDisplayCode, sal_Int16 nNativeNumberMode ) 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\nprotected:\n    Era *eraArray;\n    icu::Calendar *body;\n    NativeNumberSupplier aNatNum;\n    const sal_Char* cCalendar;\n    com::sun::star::lang::Locale aLocale;\n    sal_uInt32 fieldSet;\n    sal_Int16 fieldValue[CalendarFieldIndex::FIELD_COUNT];\n    sal_Int16 fieldSetValue[CalendarFieldIndex::FIELD_COUNT];\n    virtual void SAL_CALL mapToGregorian() throw(com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL mapFromGregorian() throw(com::sun::star::uno::RuntimeException);\n    void SAL_CALL getValue() throw(com::sun::star::uno::RuntimeException);\nprivate:\n    \/\/ submit fieldValue array according to fieldSet, plus YMDhms if >=0\n    void SAL_CALL submitValues( sal_Int32 nYear, sal_Int32 nMonth, sal_Int32 nDay, sal_Int32 nHour, sal_Int32 nMinute, sal_Int32 nSecond, sal_Int32 nMilliSecond) throw(com::sun::star::uno::RuntimeException);\n    void SAL_CALL setValue() throw(com::sun::star::uno::RuntimeException);\n    void SAL_CALL init(Era *_eraArray) throw(com::sun::star::uno::RuntimeException);\n    Calendar aCalendar;\n    sal_Int16 aStartOfWeek;\n};\n\n\/\/  ----------------------------------------------------\n\/\/  class Calendar_hanja\n\/\/  ----------------------------------------------------\nclass Calendar_hanja : public Calendar_gregorian\n{\npublic:\n    \/\/ Constructors\n    Calendar_hanja();\n    virtual void SAL_CALL loadCalendar(const rtl::OUString& uniqueID, const com::sun::star::lang::Locale& rLocale) throw(com::sun::star::uno::RuntimeException);\n    virtual rtl::OUString SAL_CALL getDisplayName(sal_Int16 nCalendarDisplayIndex, sal_Int16 nIdx, sal_Int16 nNameType) throw(com::sun::star::uno::RuntimeException);\n};\n\n\/\/  ----------------------------------------------------\n\/\/  class Calendar_gengou\n\/\/  ----------------------------------------------------\nclass Calendar_gengou : public Calendar_gregorian\n{\npublic:\n    \/\/ Constructors\n    Calendar_gengou();\n};\n\n\/\/  ----------------------------------------------------\n\/\/  class Calendar_ROC\n\/\/  ----------------------------------------------------\nclass Calendar_ROC : public Calendar_gregorian\n{\npublic:\n    \/\/ Constructors\n    Calendar_ROC();\n};\n\n\/\/  ----------------------------------------------------\n\/\/  class Calendar_buddhist\n\/\/  ----------------------------------------------------\nclass Calendar_buddhist : public Calendar_gregorian\n{\npublic:\n    \/\/ Constructors\n    Calendar_buddhist();\n\n    \/\/ Methods in XExtendedCalendar\n    virtual rtl::OUString SAL_CALL getDisplayString( sal_Int32 nCalendarDisplayCode, sal_Int16 nNativeNumberMode ) throw (com::sun::star::uno::RuntimeException);\n};\n\n} } } }\n\n#endif\n<commit_msg>INTEGRATION: CWS ooo19126 (1.9.30); FILE MERGED 2005\/09\/05 17:47:22 rt 1.9.30.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: calendar_gregorian.hxx,v $\n *\n *  $Revision: 1.10 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-07 16:48: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#ifndef _I18N_CALENDAR_GREGORIAN_HXX_\n#define _I18N_CALENDAR_GREGORIAN_HXX_\n\n#include \"calendarImpl.hxx\"\n#include \"nativenumbersupplier.hxx\"\n#include \"unicode\/calendar.h\"\n\n\/\/  ----------------------------------------------------\n\/\/  class Calendar_gregorian\n\/\/  ----------------------------------------------------\n\nnamespace com { namespace sun { namespace star { namespace i18n {\n\nstruct Era {\n    sal_Int32 year;\n    sal_Int32 month;\n    sal_Int32 day;\n};\n\nclass Calendar_gregorian : public CalendarImpl\n{\npublic:\n\n    \/\/ Constructors\n    Calendar_gregorian();\n    Calendar_gregorian(Era *_eraArray);\n\n    \/**\n    * Destructor\n    *\/\n    ~Calendar_gregorian();\n\n    \/\/ Methods\n    virtual void SAL_CALL loadCalendar(const rtl::OUString& uniqueID, const com::sun::star::lang::Locale& rLocale) throw(com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL setDateTime(double nTimeInDays) throw(com::sun::star::uno::RuntimeException);\n    virtual double SAL_CALL getDateTime() throw(com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL setValue( sal_Int16 nFieldIndex, sal_Int16 nValue ) throw(com::sun::star::uno::RuntimeException);\n    virtual sal_Int16 SAL_CALL getValue(sal_Int16 nFieldIndex) throw(com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL addValue(sal_Int16 nFieldIndex, sal_Int32 nAmount) throw(com::sun::star::uno::RuntimeException);\n    virtual sal_Bool SAL_CALL isValid() throw (com::sun::star::uno::RuntimeException);\n    virtual Calendar SAL_CALL getLoadedCalendar() throw(com::sun::star::uno::RuntimeException);\n    virtual rtl::OUString SAL_CALL getUniqueID() throw(com::sun::star::uno::RuntimeException);\n    virtual sal_Int16 SAL_CALL getFirstDayOfWeek() throw(com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL setFirstDayOfWeek(sal_Int16 nDay) throw(com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL setMinimumNumberOfDaysForFirstWeek(sal_Int16 nDays) throw(com::sun::star::uno::RuntimeException);\n    virtual sal_Int16 SAL_CALL getMinimumNumberOfDaysForFirstWeek() throw(com::sun::star::uno::RuntimeException);\n    virtual sal_Int16 SAL_CALL getNumberOfMonthsInYear() throw(com::sun::star::uno::RuntimeException);\n    virtual sal_Int16 SAL_CALL getNumberOfDaysInWeek() throw(com::sun::star::uno::RuntimeException);\n    virtual com::sun::star::uno::Sequence < CalendarItem > SAL_CALL getMonths() throw(com::sun::star::uno::RuntimeException);\n    virtual com::sun::star::uno::Sequence < CalendarItem > SAL_CALL getDays() throw(com::sun::star::uno::RuntimeException);\n    virtual rtl::OUString SAL_CALL getDisplayName(sal_Int16 nCalendarDisplayIndex, sal_Int16 nIdx, sal_Int16 nNameType) throw(com::sun::star::uno::RuntimeException);\n\n    \/\/ Methods in XExtendedCalendar\n    virtual rtl::OUString SAL_CALL getDisplayString( sal_Int32 nCalendarDisplayCode, sal_Int16 nNativeNumberMode ) 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\nprotected:\n    Era *eraArray;\n    icu::Calendar *body;\n    NativeNumberSupplier aNatNum;\n    const sal_Char* cCalendar;\n    com::sun::star::lang::Locale aLocale;\n    sal_uInt32 fieldSet;\n    sal_Int16 fieldValue[CalendarFieldIndex::FIELD_COUNT];\n    sal_Int16 fieldSetValue[CalendarFieldIndex::FIELD_COUNT];\n    virtual void SAL_CALL mapToGregorian() throw(com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL mapFromGregorian() throw(com::sun::star::uno::RuntimeException);\n    void SAL_CALL getValue() throw(com::sun::star::uno::RuntimeException);\nprivate:\n    \/\/ submit fieldValue array according to fieldSet, plus YMDhms if >=0\n    void SAL_CALL submitValues( sal_Int32 nYear, sal_Int32 nMonth, sal_Int32 nDay, sal_Int32 nHour, sal_Int32 nMinute, sal_Int32 nSecond, sal_Int32 nMilliSecond) throw(com::sun::star::uno::RuntimeException);\n    void SAL_CALL setValue() throw(com::sun::star::uno::RuntimeException);\n    void SAL_CALL init(Era *_eraArray) throw(com::sun::star::uno::RuntimeException);\n    Calendar aCalendar;\n    sal_Int16 aStartOfWeek;\n};\n\n\/\/  ----------------------------------------------------\n\/\/  class Calendar_hanja\n\/\/  ----------------------------------------------------\nclass Calendar_hanja : public Calendar_gregorian\n{\npublic:\n    \/\/ Constructors\n    Calendar_hanja();\n    virtual void SAL_CALL loadCalendar(const rtl::OUString& uniqueID, const com::sun::star::lang::Locale& rLocale) throw(com::sun::star::uno::RuntimeException);\n    virtual rtl::OUString SAL_CALL getDisplayName(sal_Int16 nCalendarDisplayIndex, sal_Int16 nIdx, sal_Int16 nNameType) throw(com::sun::star::uno::RuntimeException);\n};\n\n\/\/  ----------------------------------------------------\n\/\/  class Calendar_gengou\n\/\/  ----------------------------------------------------\nclass Calendar_gengou : public Calendar_gregorian\n{\npublic:\n    \/\/ Constructors\n    Calendar_gengou();\n};\n\n\/\/  ----------------------------------------------------\n\/\/  class Calendar_ROC\n\/\/  ----------------------------------------------------\nclass Calendar_ROC : public Calendar_gregorian\n{\npublic:\n    \/\/ Constructors\n    Calendar_ROC();\n};\n\n\/\/  ----------------------------------------------------\n\/\/  class Calendar_buddhist\n\/\/  ----------------------------------------------------\nclass Calendar_buddhist : public Calendar_gregorian\n{\npublic:\n    \/\/ Constructors\n    Calendar_buddhist();\n\n    \/\/ Methods in XExtendedCalendar\n    virtual rtl::OUString SAL_CALL getDisplayString( sal_Int32 nCalendarDisplayCode, sal_Int16 nNativeNumberMode ) throw (com::sun::star::uno::RuntimeException);\n};\n\n} } } }\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include <GL\/glut.h>\n#include <cmath>\n\n#define PI 3.14159265359\n\nusing namespace std;\n\nint deg = 0;\n\nvoid radioactive();\nvoid rotate();\nvoid init();\n\nint main(int argc, char **argv)\n{\n\tglutInit(&argc, argv);\n\tglutInitDisplayMode(GLUT_DOUBLE | GLUT_RGB);\n\tglutInitWindowSize(500,500);\n\tglutInitWindowPosition(0,0);\n\tglutCreateWindow(\"radioactive\");\n\tglutIdleFunc(rotate);\n\tglutDisplayFunc(radioactive);\n\tinit();\n\tglutMainLoop();\n}\n\nvoid init()\n{\n\tglClearColor(1.0 ,1.0 ,0.0 ,0.0);\n\tglMatrixMode(GL_PROJECTION);\n\tglLoadIdentity();\n}\n\nvoid radioactive()\n{\n\tglClear(GL_COLOR_BUFFER_BIT);\n\tglColor3f(0.0, 0.0, 0.0);\n\tglRotated(deg, 0.0, 0.0, 1.0);\n\tglPolygonMode(GL_FRONT, GL_FILL);\n\tfor (double d = PI\/2.0; d < 2.0*PI; d += 2*PI\/3.0)\n\t{\n\t\tglBegin(GL_TRIANGLE_FAN);\n\t\t\tglVertex2d(0.0,0.0);\n\t\t\tfor (double dis = -PI\/6; dis < PI\/6; dis += 0.1)\n\t\t\t{\n\t\t\t\tglColor3f(0.0, 0.0, 0.0);\n\t\t\t\tglVertex2d(cos(d + dis), sin(d + dis));\n\t\t\t}\n\t\tglEnd();\n\t}\n\tglLoadIdentity();\n\tglutSwapBuffers();\n}\n\nvoid rotate()\n{\n\tdeg = (deg < 360) ? deg + 1 : 0;\n\t glutPostRedisplay();\n}\n<commit_msg>rgba -> rgb<commit_after>#include <GL\/glut.h>\n#include <cmath>\n\n#define PI 3.14159265359\n\nusing namespace std;\n\nint deg = 0;\n\nvoid radioactive();\nvoid rotate();\nvoid init();\n\nint main(int argc, char **argv)\n{\n\tglutInit(&argc, argv);\n\tglutInitDisplayMode(GLUT_DOUBLE | GLUT_RGB);\n\tglutInitWindowSize(500,500);\n\tglutInitWindowPosition(0,0);\n\tglutCreateWindow(\"Radioactive\");\n\tglutIdleFunc(rotate);\n\tglutDisplayFunc(radioactive);\n\tinit();\n\tglutMainLoop();\n}\n\nvoid init()\n{\n\tglClearColor(1.0 ,1.0 ,0.0 ,0.0);\n\tglMatrixMode(GL_PROJECTION);\n\tglLoadIdentity();\n}\n\nvoid radioactive()\n{\n\tglClear(GL_COLOR_BUFFER_BIT);\n\tglColor3f(0.0, 0.0, 0.0);\n\tglRotated(deg, 0.0, 0.0, 1.0);\n\tglPolygonMode(GL_FRONT, GL_FILL);\n\tfor (double d = PI\/2.0; d < 2.0*PI; d += 2*PI\/3.0)\n\t{\n\t\tglBegin(GL_TRIANGLE_FAN);\n\t\t\tglVertex2d(0.0,0.0);\n\t\t\tfor (double dis = -PI\/6; dis < PI\/6; dis += 0.1)\n\t\t\t{\n\t\t\t\tglColor3f(0.0, 0.0, 0.0);\n\t\t\t\tglVertex2d(cos(d + dis), sin(d + dis));\n\t\t\t}\n\t\tglEnd();\n\t}\n\tglLoadIdentity();\n\tglutSwapBuffers();\n}\n\nvoid rotate()\n{\n\tdeg = (deg < 360) ? deg + 1 : 0;\n\t glutPostRedisplay();\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef VEXCL_FFT_HPP\n#define VEXCL_FFT_HPP\n\n\/*\nThe MIT License\n\nCopyright (c) 2012 Denis Demidov <ddemidov@ksu.ru>\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*\/\n\n\/**\n * \\file   stencil.hpp\n * \\author Pascal Germroth <pascal@ensieve.org>\n * \\brief  Fast Fourier Transformation.\n *\/\n\n\/\/ TODO: multivector (AMD FFT supports batch transforms!)\n#include <vexcl\/vector.hpp>\n\n#ifdef USE_AMD_FFT\n#   include <clAmdFft.h>\n#else\n#   include <vexcl\/fft\/plan.hpp>\n#endif\n\nnamespace vex {\n\n\/\/\/ \\cond INTERNAL\n\ntemplate <class F>\nstruct fft_expr\n    : vector_expression< boost::proto::terminal< additive_vector_transform >::type >\n{\n    F &f;\n    vector<typename F::input_t> &input;\n\n    fft_expr(F &f, vector<typename F::input_t> &x) : f(f), input(x) {}\n\n    template <bool negate, bool append>\n    void apply(vector<typename F::output_t> &output) const\n    {\n        f.template execute<negate, append>(input, output);\n    }\n};\n\n\n#ifdef USE_AMD_FFT\nenum fft_direction {\n   forward = CLFFT_FORWARD,\n   inverse = CLFFT_BACKWARD\n};\n\n\/\/ AMD FFT needs Setup\/Teardown calls for the whole library.\n\/\/ Sequential Setup\/Teardowns are OK, but overlapping is not.\nsize_t fft_ref_count = 0;\n\/\/ TODO: breaks when two objects, both using FFT, are linked.\n\n\n\/**\n * An FFT functor. Assumes the vector is in row major format and densely packed.\n * Only supports a single device, only 2^a 3^b 5^c sizes, only single precision.\n * 1-3 dimensions.\n * Usage:\n * \\code\n * FFT<cl_float2> fft(ctx.queue(), {width, height});\n * output = fft(input); \/\/ out-of-place transform\n * data = fft(data); \/\/ in-place transform\n * \\endcode\n *\/\ntemplate <typename T0, typename T1 = T0>\nstruct FFT {\n    static_assert(std::is_same<T0, T1>::value &&\n        std::is_same<T0, cl_float2>::value,\n        \"Only single precision Complex-to-Complex transformations implemented.\");\n\n    typedef FFT<T0, T1> this_t;\n    typedef T0 input_t;\n    typedef T1 output_t;\n\n    const std::vector<cl::CommandQueue> &queues;\n    clAmdFftPlanHandle plan;\n    fft_direction dir;\n\n    void check_error(clAmdFftStatus status) const {\n        if(status != CL_SUCCESS)\n            throw cl::Error(status, \"AMD FFT\");\n    }\n\n    template <class Array>\n    FFT(const std::vector<cl::CommandQueue> &queues,\n        const Array &lengths, fft_direction dir = forward)\n        : queues(queues), plan(0), dir(dir) {\n        init(lengths);\n    }\n\n    FFT(const std::vector<cl::CommandQueue> &queues,\n        size_t length, fft_direction dir = forward)\n        : queues(queues), plan(0), dir(dir) {\n        std::array<size_t, 1> lengths = {{length}};\n        init(lengths);\n    }\n   \n#ifndef BOOST_NO_INITIALIZER_LISTS\n    FFT(const std::vector<cl::CommandQueue> &queues,\n        std::initializer_list<size_t> lengths, fft_direction dir = forward)\n        : queues(queues), plan(0), dir(dir) {\n        init(lengths);\n    }\n#endif\n\n    template <class Array>\n    void init(const Array &lengths) {\n        assert(lengths.size() >= 1 && lengths.size() <= 3);\n        size_t _lengths[lengths.size()];\n        std::copy(std::begin(lengths), std::end(lengths), _lengths);\n        \/\/ TODO: all queues must be in same context\n        cl::Context context = static_cast<cl::CommandQueue>(queues[0]).getInfo<CL_QUEUE_CONTEXT>();\n        if(fft_ref_count++ == 0)\n            check_error(clAmdFftSetup(NULL));\n        check_error(clAmdFftCreateDefaultPlan(&plan, context(),\n            static_cast<clAmdFftDim>(lengths.size()), _lengths));\n        check_error(clAmdFftSetPlanPrecision(plan, CLFFT_SINGLE)); \n        check_error(clAmdFftSetLayout(plan, CLFFT_COMPLEX_INTERLEAVED, CLFFT_COMPLEX_INTERLEAVED));\n    }\n\n    ~FFT() {\n        if(plan)\n            check_error(clAmdFftDestroyPlan(&plan));\n        if(--fft_ref_count == 0)\n            check_error(clAmdFftTeardown());\n    }\n    \n\n    template <bool negate, bool append>\n    void execute(const vector<T0> &input, vector<T1> &output) const {\n        assert(!append); \/\/ TODO: that should be static.\n        static_assert(!negate, \"Negation not implemented yet.\");\n        \/\/ Doesn't support split buffers.\n        assert(queues.size() == 1);\n        cl_mem input_buf = input(0)();\n        cl_mem output_buf = output(0)();\n        check_error(clAmdFftSetResultLocation(plan,\n            input_buf == output_buf ? CLFFT_INPLACE : CLFFT_OUTOFPLACE));\n        cl_command_queue _queues[queues.size()];\n        for(size_t i = 0 ; i < queues.size() ; i++)\n            _queues[i] = queues[i]();\n        check_error(clAmdFftEnqueueTransform(plan, static_cast<clAmdFftDirection>(dir),\n            queues.size(), _queues,\n            \/* wait events *\/0, NULL, \/* out events *\/NULL,\n            &input_buf, &output_buf, NULL));\n    }\n\n\n    \/\/ User call\n    fft_expr<this_t> operator()(vector<T0> &x) {\n        return {*this, x};\n    }\n};\n#else \/\/ USE_AMD_FFT\n\nenum direction {\n    forward, inverse\n};\n\ntemplate <typename T0, typename T1 = T0>\nstruct FFT {\n    typedef FFT<T0, T1> this_t;\n    typedef T0 input_t;\n    typedef T1 output_t;\n    typedef typename cl::scalar_of<T0>::type T0s;\n    typedef typename cl::scalar_of<T1>::type T1s;\n    static_assert(std::is_same<T0s, T1s>::value, \"Input and output must have same precision.\");\n    typedef T0s T;\n\n    fft::plan<T> plan;\n\n    \/\/\/ 1D constructor\n    FFT(const std::vector<cl::CommandQueue> &queues,\n        size_t length, direction dir = forward)\n        : plan(queues, {length}, dir == inverse) {}\n\n    \/\/\/ N-D constructors\n    FFT(const std::vector<cl::CommandQueue> &queues,\n        const std::vector<size_t> &lengths, direction dir = forward)\n        : plan(queues, lengths, dir == inverse) {}\n\n#ifndef BOOST_NO_INITIALIZER_LISTS\n    FFT(const std::vector<cl::CommandQueue> &queues,\n        const std::initializer_list<size_t> &lengths, direction dir = forward)\n        : plan(queues, lengths, dir == inverse) {}\n#endif\n\n    template <bool negate, bool append>\n    void execute(vector<T0> &input, vector<T1> &output) {\n        assert(!append);\n        static_assert(!negate, \"Not implemented\");\n        plan(input, output);\n    }\n\n\n    \/\/ User call\n    fft_expr<this_t> operator()(vector<T0> &x) {\n        return {*this, x};\n    }\n};\n\n#endif\n\n\n}\n\n#endif\n<commit_msg>Review suggestions<commit_after>#ifndef VEXCL_FFT_HPP\n#define VEXCL_FFT_HPP\n\n\/*\nThe MIT License\n\nCopyright (c) 2012 Denis Demidov <ddemidov@ksu.ru>\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*\/\n\n\/**\n * \\file   stencil.hpp\n * \\author Pascal Germroth <pascal@ensieve.org>\n * \\brief  Fast Fourier Transformation.\n *\/\n\n\/\/ TODO: multivector (AMD FFT supports batch transforms!)\n#include <vexcl\/vector.hpp>\n\n#ifdef USE_AMD_FFT\n#   include <clAmdFft.h>\n#else\n#   include <vexcl\/fft\/plan.hpp>\n#endif\n\nnamespace vex {\n\n\/\/\/ \\cond INTERNAL\n\ntemplate <class F>\nstruct fft_expr\n    : vector_expression< boost::proto::terminal< additive_vector_transform >::type >\n{\n    F &f;\n    vector<typename F::input_t> &input;\n\n    fft_expr(F &f, vector<typename F::input_t> &x) : f(f), input(x) {}\n\n    template <bool negate, bool append>\n    void apply(vector<typename F::output_t> &output) const\n    {\n        f.template execute<negate, append>(input, output);\n    }\n};\n\n\n#ifdef USE_AMD_FFT\nenum fft_direction {\n   forward = CLFFT_FORWARD,\n   inverse = CLFFT_BACKWARD\n};\n\nvoid fft_check_error(clAmdFftStatus status) const {\n    if(status != CL_SUCCESS)\n        throw cl::Error(status, \"AMD FFT\");\n}\n\n\/\/ AMD FFT needs Setup\/Teardown calls for the whole library.\n\/\/ Sequential Setup\/Teardowns are OK, but overlapping is not.\nstruct amd_context_t {\n    amd_context_t() { fft_check_error(clAmdFftSetup(NULL)); }\n    ~amd_context_t() { fft_check_error(clAmdFftTeardown()); }\n};\nstatic std::unique_ptr<amd_fft_context> amd_context;\n\n\n\/**\n * An FFT functor. Assumes the vector is in row major format and densely packed.\n * Only supports a single device, only 2^a 3^b 5^c sizes, only single precision.\n * 1-3 dimensions.\n * Usage:\n * \\code\n * FFT<cl_float2> fft(ctx.queue(), {width, height});\n * output = fft(input); \/\/ out-of-place transform\n * data = fft(data); \/\/ in-place transform\n * \\endcode\n *\/\ntemplate <typename T0, typename T1 = T0>\nstruct FFT {\n    static_assert(std::is_same<T0, T1>::value &&\n        std::is_same<T0, cl_float2>::value,\n        \"Only single precision Complex-to-Complex transformations implemented.\");\n\n    typedef FFT<T0, T1> this_t;\n    typedef T0 input_t;\n    typedef T1 output_t;\n\n    const std::vector<cl::CommandQueue> &queues;\n    clAmdFftPlanHandle plan;\n    fft_direction dir;\n\n    template <class Array>\n    FFT(const std::vector<cl::CommandQueue> &queues,\n        const Array &lengths, fft_direction dir = forward)\n        : queues(queues), plan(0), dir(dir) {\n        init(lengths);\n    }\n\n    FFT(const std::vector<cl::CommandQueue> &queues,\n        size_t length, fft_direction dir = forward)\n        : queues(queues), plan(0), dir(dir) {\n        std::array<size_t, 1> lengths = {{length}};\n        init(lengths);\n    }\n   \n#ifndef BOOST_NO_INITIALIZER_LISTS\n    FFT(const std::vector<cl::CommandQueue> &queues,\n        std::initializer_list<size_t> lengths, fft_direction dir = forward)\n        : queues(queues), plan(0), dir(dir) {\n        init(lengths);\n    }\n#endif\n\n    template <class Array>\n    void init(const Array &lengths) {\n        assert(lengths.size() >= 1 && lengths.size() <= 3);\n        assert(queues.size() == 1);\n        if(!amd_context) amd_context.reset(new amd_context_t());\n        size_t _lengths[3];\n        std::copy(std::begin(lengths), std::end(lengths), _lengths);\n        cl::Context context = qctx(queues[0]);\n        if(fft_ref_count++ == 0)\n            check_error(clAmdFftSetup(NULL));\n        check_error(clAmdFftCreateDefaultPlan(&plan, context(),\n            static_cast<clAmdFftDim>(lengths.size()), _lengths));\n        check_error(clAmdFftSetPlanPrecision(plan, CLFFT_SINGLE)); \n        check_error(clAmdFftSetLayout(plan, CLFFT_COMPLEX_INTERLEAVED, CLFFT_COMPLEX_INTERLEAVED));\n    }\n\n    ~FFT() {\n        if(plan)\n            check_error(clAmdFftDestroyPlan(&plan));\n        if(--fft_ref_count == 0)\n            check_error(clAmdFftTeardown());\n    }\n    \n\n    template <bool negate, bool append>\n    void execute(const vector<T0> &input, vector<T1> &output) const {\n        static_assert(!append, \"Appending not implemented yet.\");\n        static_assert(!negate, \"Negation not implemented yet.\");\n        cl_mem input_buf = input(0)();\n        cl_mem output_buf = output(0)();\n        fft_check_error(clAmdFftSetResultLocation(plan,\n            input_buf == output_buf ? CLFFT_INPLACE : CLFFT_OUTOFPLACE));\n        cl_command_queue queue = queues[0]();\n        fft_check_error(clAmdFftEnqueueTransform(plan,\n            static_cast<clAmdFftDirection>(dir),\n            1, &queue, \/* wait events *\/0, NULL, \/* out events *\/NULL,\n            &input_buf, &output_buf, NULL));\n    }\n\n\n    \/\/ User call\n    fft_expr<this_t> operator()(vector<T0> &x) {\n        return {*this, x};\n    }\n};\n#else \/\/ USE_AMD_FFT\n\nenum direction {\n    forward, inverse\n};\n\ntemplate <typename T0, typename T1 = T0>\nstruct FFT {\n    typedef FFT<T0, T1> this_t;\n    typedef T0 input_t;\n    typedef T1 output_t;\n    typedef typename cl::scalar_of<T0>::type T0s;\n    typedef typename cl::scalar_of<T1>::type T1s;\n    static_assert(std::is_same<T0s, T1s>::value, \"Input and output must have same precision.\");\n    typedef T0s T;\n\n    fft::plan<T> plan;\n\n    \/\/\/ 1D constructor\n    FFT(const std::vector<cl::CommandQueue> &queues,\n        size_t length, direction dir = forward)\n        : plan(queues, {length}, dir == inverse) {}\n\n    \/\/\/ N-D constructors\n    FFT(const std::vector<cl::CommandQueue> &queues,\n        const std::vector<size_t> &lengths, direction dir = forward)\n        : plan(queues, lengths, dir == inverse) {}\n\n#ifndef BOOST_NO_INITIALIZER_LISTS\n    FFT(const std::vector<cl::CommandQueue> &queues,\n        const std::initializer_list<size_t> &lengths, direction dir = forward)\n        : plan(queues, lengths, dir == inverse) {}\n#endif\n\n    template <bool negate, bool append>\n    void execute(vector<T0> &input, vector<T1> &output) {\n        assert(!append);\n        static_assert(!negate, \"Not implemented\");\n        plan(input, output);\n    }\n\n\n    \/\/ User call\n    fft_expr<this_t> operator()(vector<T0> &x) {\n        return {*this, x};\n    }\n};\n\n#endif\n\n\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"scatter-vm\/sslang_vm.h\"\n\nScript g_Script;<commit_msg>start vm test<commit_after>#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n#include \"scatter-asm\/ssasm_pre.h\"\n#include \"scatter-vm\/ssvm_pre.h\"\n#include \"scatter-vm\/sslang_vm.h\"\n#include \"scatter-vm\/ssvm.h\"\n\nScript g_Script;\n\nint main(int argc, char* argv[])\n{\n\tif (argc < 2)\n\t{\n\t\tprintf(\"Wrong usage !\\n\");\n\t\treturn 0;\n\t}\n\n\tchar* exeFilename = (char*) malloc(strlen(argv[1]) + 1);\n\tstrcpy(exeFilename, argv[1]);\n\n\tInit();\n\n\tint errorCode = LoadScript(exeFilename);\n\n\tif (errorCode != LOAD_OK)\n\t{\n\t\tprintf(\"Error: \");\n\t\tswitch (errorCode)\n\t\t{\n\t\tcase LOAD_ERROR_FAIL_FILE_OPEN:\n\t\t\tprintf(\"Can not open sse file\");\n\t\t\tbreak;\n\n\t\tcase LOAD_ERROR_INVALID_SSE:\n\t\t\tprintf(\"Invalid sse file\");\n\t\t\tbreak;\n\n\t\tcase LOAD_ERROR_UNSOPPORTED_VERSION:\n\t\t\tprintf(\"Unsupported sse version\");\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tbreak;\n\t\t}\n\t\tprintf(\".\\n\");\n\n\t\treturn 0;\n\t}\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2013, Hernan Saez\n * All 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 <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 \"RenderSystem.hpp\"\n\n#include \"Rendering\/ComputePass.hpp\"\n#include \"Rendering\/FrameGraphOperation.hpp\"\n#include \"Rendering\/Operations\/OperationUtils.hpp\"\n#include \"Rendering\/Operations\/Operations.hpp\"\n#include \"Rendering\/Operations\/Operations_computeRT.hpp\"\n#include \"Rendering\/Operations\/Operations_debugLightCascades.hpp\"\n#include \"Rendering\/Operations\/Operations_debugShadowAtlas.hpp\"\n#include \"Rendering\/Operations\/Operations_softRT.hpp\"\n#include \"Rendering\/Operations\/Operations_ssao.hpp\"\n#include \"Rendering\/RenderPass.hpp\"\n#include \"Rendering\/ScenePass.hpp\"\n#include \"Simulation\/Simulation.hpp\"\n\n#include <queue>\n#include <unordered_map>\n#include <unordered_set>\n\nnamespace crimild {\n\n    namespace utils {\n\n        template< typename Fn >\n        void traverse( SharedPointer< FrameGraphOperation > root, Fn fn ) noexcept\n        {\n            std::queue< SharedPointer< FrameGraphOperation > > frontier;\n            std::unordered_set< FrameGraphOperation * > expanded;\n            std::unordered_map< FrameGraphOperation *, size_t > blockCount;\n\n            frontier.push( root );\n            while ( !frontier.empty() ) {\n                auto current = frontier.front();\n                frontier.pop();\n                if ( expanded.count( current.get() ) != 0 ) {\n                    \/\/ already expanded\n                    continue;\n                }\n                expanded.insert( current.get() );\n                fn( current );\n                current->eachBlockedBy(\n                    [ & ]( auto pass ) {\n                        if ( blockCount.count( pass.get() ) == 0 ) {\n                            blockCount[ pass.get() ] = pass->getBlockCount();\n                        }\n\n                        --blockCount[ pass.get() ];\n                        if ( blockCount[ pass.get() ] == 0 ) {\n                            frontier.push( pass );\n                        }\n                    } );\n            }\n        }\n\n    }\n}\n\nusing namespace crimild;\n\nvoid RenderSystem::start( void ) noexcept\n{\n    useDefaultRenderPath();\n}\n\n#include <queue>\n#include <unordered_map>\n#include <unordered_set>\n\ntemplate< typename Fn >\nvoid traverse( SharedPointer< FrameGraphOperation > root, Fn fn ) noexcept\n{\n    std::queue< SharedPointer< FrameGraphOperation > > frontier;\n    std::unordered_set< FrameGraphOperation * > expanded;\n    std::unordered_map< FrameGraphOperation *, size_t > blockCount;\n\n    frontier.push( root );\n    while ( !frontier.empty() ) {\n        auto current = frontier.front();\n        frontier.pop();\n        if ( expanded.count( get_ptr( current ) ) != 0 ) {\n            \/\/ already expanded\n            continue;\n        }\n        expanded.insert( crimild::get_ptr( current ) );\n        fn( current );\n        current->eachBlockedBy(\n            [ & ]( auto passPtr ) {\n                auto pass = get_ptr( passPtr );\n                if ( blockCount.count( pass ) == 0 ) {\n                    \/\/ TODO: if passes are discarded because they don't really add up to the final image,\n                    \/\/ this number will not be correct, since it will show more blocks than actually are.\n                    blockCount[ pass ] = pass->getBlockCount();\n                }\n\n                --blockCount[ pass ];\n                if ( blockCount[ pass ] == 0 ) {\n                    frontier.push( passPtr );\n                }\n            } );\n    }\n}\n\nvoid RenderSystem::sort( SharedPointer< FrameGraphOperation > const &root ) noexcept\n{\n    m_scenePasses.clear();\n    m_renderPasses.clear();\n    m_computePasses.clear();\n\n    std::list< SharedPointer< FrameGraphOperation > > sorted;\n\n    traverse(\n        root,\n        [ & ]( auto pass ) {\n            if ( pass->getType() == FrameGraphOperation::Type::SCENE_PASS ) {\n                m_scenePasses.add( cast_ptr< ScenePass >( pass ) );\n            } else if ( pass->getType() == FrameGraphOperation::Type::RENDER_PASS ) {\n                m_renderPasses.add( cast_ptr< RenderPass >( pass ) );\n            } else if ( pass->getType() == FrameGraphOperation::Type::COMPUTE_PASS ) {\n                m_computePasses.add( cast_ptr< ComputePass >( pass ) );\n            }\n            sorted.push_front( pass );\n        } );\n\n    FrameGraphOperation::Priority p = 0;\n    for ( auto pass : sorted ) {\n        pass->setPriority( p++ );\n    }\n\n    m_scenePasses = m_scenePasses.reversed();\n    m_renderPasses = m_renderPasses.reversed();\n    m_computePasses = m_computePasses.reversed();\n}\n\nvoid RenderSystem::onPreRender( void ) noexcept\n{\n    System::onPreRender();\n\n    if ( m_frameGraph != nullptr && m_renderPasses.empty() ) {\n        sort( m_frameGraph );\n    }\n\n    m_scenePasses.each(\n        []( auto pass ) {\n            \/\/ Scene passes are executed every frame with no image index\n            pass->apply( 0, true );\n        } );\n}\n\nvoid RenderSystem::setFrameGraph( SharedPointer< FrameGraphOperation > const &frameGraph ) noexcept\n{\n    m_frameGraph = frameGraph;\n\n    m_renderPasses.clear();\n    m_scenePasses.clear();\n    m_computePasses.clear();\n\n    m_sortedOperations.clear();\n\n    m_graphicsCommands.clear();\n    m_computeCommands.clear();\n\n    broadcastMessage( messaging::FrameGraphDidChange {} );\n}\n\nRenderSystem::CommandBufferArray &RenderSystem::getGraphicsCommands( Size imageIndex, Bool forceAll ) noexcept\n{\n    m_graphicsCommands.clear();\n    m_renderPasses.each(\n        [ & ]( auto pass ) {\n            if ( pass->apply( imageIndex, forceAll ) ) {\n                m_graphicsCommands.add( get_ptr( pass->getCommandBuffers()[ imageIndex ] ) );\n            }\n        } );\n\n    return m_graphicsCommands;\n}\n\nRenderSystem::CommandBufferArray &RenderSystem::getComputeCommands( Size imageIndex, Bool forceAll ) noexcept\n{\n    m_computeCommands.clear();\n    m_computePasses.each(\n        [ & ]( auto pass ) {\n            if ( pass->apply( imageIndex, forceAll ) ) {\n                m_computeCommands.add( get_ptr( pass->getCommandBuffers()[ imageIndex ] ) );\n            }\n        } );\n\n    return m_computeCommands;\n}\n\nvoid RenderSystem::useDefaultRenderPath( Bool enableDebug ) noexcept\n{\n    setFrameGraph(\n        [ enableDebug ] {\n            using namespace crimild::framegraph;\n\n            auto settings = Simulation::getInstance()->getSettings();\n\n            auto renderables = fetchRenderables();\n            auto litRenderables = renderables->getProduct( 0 );\n            auto unlitRenderables = renderables->getProduct( 1 );\n            auto envRenderables = renderables->getProduct( 2 );\n\n            auto gBuffer = gBufferPass( litRenderables );\n            auto albedo = gBuffer->getProduct( 0 );\n            auto positions = gBuffer->getProduct( 1 );\n            auto normals = gBuffer->getProduct( 2 );\n            auto materials = gBuffer->getProduct( 3 );\n            auto depth = gBuffer->getProduct( 4 );\n\n            if ( settings->get< Bool >( \"debug.show_albedo\" ) ) {\n                return present( albedo );\n            }\n\n            if ( settings->get< Bool >( \"debug.show_metallic\" ) ) {\n                return channel( \"metallic\", materials, 0 );\n            }\n\n            if ( settings->get< Bool >( \"debug.show_roughness\" ) ) {\n                return channel( \"roughness\", materials, 1 );\n            }\n\n            if ( settings->get< Bool >( \"debug.show_ambient_occlusion\" ) ) {\n                return channel( \"ambientOcclusion\", materials, 2 );\n            }\n\n            if ( settings->get< Bool >( \"debug.show_normals\" ) ) {\n                return present( normals );\n            }\n\n            auto reflectionAtlasPass = computeReflectionMap( envRenderables );\n            auto irradianceMapPass = computeIrradianceMap( useResource( reflectionAtlasPass ) );\n            auto prefilterMapPass = computePrefilterMap( useResource( reflectionAtlasPass ) );\n            auto brdfLutPass = computeBRDFLUT( nullptr );\n\n            auto shadowAtlasPass = renderShadowAtlas( litRenderables );\n\n            auto shadowAtlas = useResource( shadowAtlasPass );\n            auto reflectionAtlas = useResource( reflectionAtlasPass );\n            auto irradianceAtlas = useResource( irradianceMapPass );\n            auto prefilterAtlas = useResource( prefilterMapPass );\n            auto brdfLUT = useResource( brdfLutPass );\n\n            \/\/ todo: rename to \"localLightingPass\"\n            auto lit = lightingPass(\n                albedo,\n                positions,\n                normals,\n                materials,\n                depth,\n                shadowAtlas );\n\n            \/\/ TODO: rename to \"globalLightingPass\"\n            auto ibl = iblPass(\n                albedo,\n                positions,\n                normals,\n                materials,\n                depth,\n                reflectionAtlas,\n                irradianceAtlas,\n                prefilterAtlas,\n                brdfLUT );\n\n            auto unlit = forwardUnlitPass( unlitRenderables, nullptr, depth );\n\n            \/\/ Render environment objects in HDR\n            auto env = forwardUnlitPass(\n                envRenderables,\n                useColorAttachment( \"envObjects\/color\", Format::R32G32B32A32_SFLOAT ),\n                depth );\n\n            auto composed = blend(\n                {\n                    useResource( lit ),\n                    useResource( ibl ),\n                    useResource( env ),\n                } );\n\n            if ( settings->get< Bool >( \"video.ssao.enabled\", false ) ) {\n                auto withBlur = [ & ]( auto op ) {\n                    if ( settings->get< Bool >( \"video.ssao.blur\", true ) ) {\n                        return blur( useResource( op ) );\n                    } else {\n                        return op;\n                    }\n                };\n\n                composed = blend(\n                    {\n                        useResource( composed ),\n                        useResource(\n                            withBlur(\n                                ssao(\n                                    positions,\n                                    normals ) ) ),\n                    },\n                    \"multiply\" );\n            }\n\n            auto ret = composed;\n            auto tonemapped = composed;\n\n            if ( settings->get< Bool >( \"video.bloom.enabled\", false ) ) {\n                auto bloom = brightPassFilter(\n                    useResource( composed ),\n                    Vector3f { 0.2126f, 0.7152f, 0.0722f } );\n\n                bloom = gaussianBlur( useResource( bloom ) );\n\n                auto tonemapped = tonemapping(\n                    useResource(\n                        composed ) );\n\n                \/\/ apply bloom after tonemapping\n                ret = blend(\n                    { useResource( tonemapped ), \/\/ forces format to RGB8\n                      useResource( bloom ) } );\n\n            } else {\n                tonemapped = tonemapping(\n                    useResource(\n                        composed ) );\n                ret = tonemapped;\n            }\n\n            ret = blend(\n                {\n                    useResource( unlit ),\n                    useResource( ret ),\n                } );\n\n            if ( enableDebug || settings->get< Bool >( \"debug.show_render_passes\", false ) ) {\n                auto lightCascades = debugLightCascades(\n                    albedo,\n                    positions,\n                    normals,\n                    materials,\n                    depth,\n                    shadowAtlas );\n\n                auto shadowAtlasDebug = debugShadowAtlas( shadowAtlas );\n\n                ret = debug(\n                    {\n                        useResource( ret ),\n                        albedo,\n                        positions,\n                        normals,\n                        materials,\n                        depth,\n                        useResource( shadowAtlasDebug ),\n                        reflectionAtlas,\n                        irradianceAtlas,\n                        prefilterAtlas,\n                        brdfLUT,\n                        useResource( lightCascades ),\n                        useResource( lit ),\n                        useResource( ibl ),\n                        useResource( tonemapped ),\n                        useResource( unlit ),\n                        useResource( env ),\n                    } );\n            }\n\n            return ret;\n        }() );\n}\n\nvoid RenderSystem::useRTSoftRenderPath( Bool enableDebug ) noexcept\n{\n    setFrameGraph(\n        [ & ] {\n            using namespace crimild::framegraph;\n            return present( tonemapping( useResource( softRT() ) ) );\n        }() );\n}\n\nvoid RenderSystem::useRTComputeRenderPath( Bool enableDebug ) noexcept\n{\n    setFrameGraph(\n        [ & ] {\n            using namespace crimild::framegraph;\n            return present( tonemapping( useResource( computeRT() ) ) );\n        }() );\n}\n<commit_msg>Allow render system to start with different render paths<commit_after>\/*\n * Copyright (c) 2013, Hernan Saez\n * All 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 <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 \"RenderSystem.hpp\"\n\n#include \"Rendering\/ComputePass.hpp\"\n#include \"Rendering\/FrameGraphOperation.hpp\"\n#include \"Rendering\/Operations\/OperationUtils.hpp\"\n#include \"Rendering\/Operations\/Operations.hpp\"\n#include \"Rendering\/Operations\/Operations_computeRT.hpp\"\n#include \"Rendering\/Operations\/Operations_debugLightCascades.hpp\"\n#include \"Rendering\/Operations\/Operations_debugShadowAtlas.hpp\"\n#include \"Rendering\/Operations\/Operations_softRT.hpp\"\n#include \"Rendering\/Operations\/Operations_ssao.hpp\"\n#include \"Rendering\/RenderPass.hpp\"\n#include \"Rendering\/ScenePass.hpp\"\n#include \"Simulation\/Simulation.hpp\"\n\n#include <queue>\n#include <unordered_map>\n#include <unordered_set>\n\nnamespace crimild {\n\n    namespace utils {\n\n        template< typename Fn >\n        void traverse( SharedPointer< FrameGraphOperation > root, Fn fn ) noexcept\n        {\n            std::queue< SharedPointer< FrameGraphOperation > > frontier;\n            std::unordered_set< FrameGraphOperation * > expanded;\n            std::unordered_map< FrameGraphOperation *, size_t > blockCount;\n\n            frontier.push( root );\n            while ( !frontier.empty() ) {\n                auto current = frontier.front();\n                frontier.pop();\n                if ( expanded.count( current.get() ) != 0 ) {\n                    \/\/ already expanded\n                    continue;\n                }\n                expanded.insert( current.get() );\n                fn( current );\n                current->eachBlockedBy(\n                    [ & ]( auto pass ) {\n                        if ( blockCount.count( pass.get() ) == 0 ) {\n                            blockCount[ pass.get() ] = pass->getBlockCount();\n                        }\n\n                        --blockCount[ pass.get() ];\n                        if ( blockCount[ pass.get() ] == 0 ) {\n                            frontier.push( pass );\n                        }\n                    } );\n            }\n        }\n\n    }\n}\n\nusing namespace crimild;\n\nvoid RenderSystem::start( void ) noexcept\n{\n    auto settings = Simulation::getInstance()->getSettings();\n    auto renderPath = settings->get< std::string >( \"video.render_path\", \"default\" );\n    if ( renderPath == \"softRT\" ) {\n        useRTSoftRenderPath();\n    } else if ( renderPath == \"computeRT\" ) {\n        useRTComputeRenderPath();\n    } else {\n        useDefaultRenderPath();\n    }\n}\n\n#include <queue>\n#include <unordered_map>\n#include <unordered_set>\n\ntemplate< typename Fn >\nvoid traverse( SharedPointer< FrameGraphOperation > root, Fn fn ) noexcept\n{\n    std::queue< SharedPointer< FrameGraphOperation > > frontier;\n    std::unordered_set< FrameGraphOperation * > expanded;\n    std::unordered_map< FrameGraphOperation *, size_t > blockCount;\n\n    frontier.push( root );\n    while ( !frontier.empty() ) {\n        auto current = frontier.front();\n        frontier.pop();\n        if ( expanded.count( get_ptr( current ) ) != 0 ) {\n            \/\/ already expanded\n            continue;\n        }\n        expanded.insert( crimild::get_ptr( current ) );\n        fn( current );\n        current->eachBlockedBy(\n            [ & ]( auto passPtr ) {\n                auto pass = get_ptr( passPtr );\n                if ( blockCount.count( pass ) == 0 ) {\n                    \/\/ TODO: if passes are discarded because they don't really add up to the final image,\n                    \/\/ this number will not be correct, since it will show more blocks than actually are.\n                    blockCount[ pass ] = pass->getBlockCount();\n                }\n\n                --blockCount[ pass ];\n                if ( blockCount[ pass ] == 0 ) {\n                    frontier.push( passPtr );\n                }\n            } );\n    }\n}\n\nvoid RenderSystem::sort( SharedPointer< FrameGraphOperation > const &root ) noexcept\n{\n    m_scenePasses.clear();\n    m_renderPasses.clear();\n    m_computePasses.clear();\n\n    std::list< SharedPointer< FrameGraphOperation > > sorted;\n\n    traverse(\n        root,\n        [ & ]( auto pass ) {\n            if ( pass->getType() == FrameGraphOperation::Type::SCENE_PASS ) {\n                m_scenePasses.add( cast_ptr< ScenePass >( pass ) );\n            } else if ( pass->getType() == FrameGraphOperation::Type::RENDER_PASS ) {\n                m_renderPasses.add( cast_ptr< RenderPass >( pass ) );\n            } else if ( pass->getType() == FrameGraphOperation::Type::COMPUTE_PASS ) {\n                m_computePasses.add( cast_ptr< ComputePass >( pass ) );\n            }\n            sorted.push_front( pass );\n        } );\n\n    FrameGraphOperation::Priority p = 0;\n    for ( auto pass : sorted ) {\n        pass->setPriority( p++ );\n    }\n\n    m_scenePasses = m_scenePasses.reversed();\n    m_renderPasses = m_renderPasses.reversed();\n    m_computePasses = m_computePasses.reversed();\n}\n\nvoid RenderSystem::onPreRender( void ) noexcept\n{\n    System::onPreRender();\n\n    if ( m_frameGraph != nullptr && m_renderPasses.empty() ) {\n        sort( m_frameGraph );\n    }\n\n    m_scenePasses.each(\n        []( auto pass ) {\n            \/\/ Scene passes are executed every frame with no image index\n            pass->apply( 0, true );\n        } );\n}\n\nvoid RenderSystem::setFrameGraph( SharedPointer< FrameGraphOperation > const &frameGraph ) noexcept\n{\n    m_frameGraph = frameGraph;\n\n    m_renderPasses.clear();\n    m_scenePasses.clear();\n    m_computePasses.clear();\n\n    m_sortedOperations.clear();\n\n    m_graphicsCommands.clear();\n    m_computeCommands.clear();\n\n    broadcastMessage( messaging::FrameGraphDidChange {} );\n}\n\nRenderSystem::CommandBufferArray &RenderSystem::getGraphicsCommands( Size imageIndex, Bool forceAll ) noexcept\n{\n    m_graphicsCommands.clear();\n    m_renderPasses.each(\n        [ & ]( auto pass ) {\n            if ( pass->apply( imageIndex, forceAll ) ) {\n                m_graphicsCommands.add( get_ptr( pass->getCommandBuffers()[ imageIndex ] ) );\n            }\n        } );\n\n    return m_graphicsCommands;\n}\n\nRenderSystem::CommandBufferArray &RenderSystem::getComputeCommands( Size imageIndex, Bool forceAll ) noexcept\n{\n    m_computeCommands.clear();\n    m_computePasses.each(\n        [ & ]( auto pass ) {\n            if ( pass->apply( imageIndex, forceAll ) ) {\n                m_computeCommands.add( get_ptr( pass->getCommandBuffers()[ imageIndex ] ) );\n            }\n        } );\n\n    return m_computeCommands;\n}\n\nvoid RenderSystem::useDefaultRenderPath( Bool enableDebug ) noexcept\n{\n    setFrameGraph(\n        [ enableDebug ] {\n            using namespace crimild::framegraph;\n\n            auto settings = Simulation::getInstance()->getSettings();\n\n            auto renderables = fetchRenderables();\n            auto litRenderables = renderables->getProduct( 0 );\n            auto unlitRenderables = renderables->getProduct( 1 );\n            auto envRenderables = renderables->getProduct( 2 );\n\n            auto gBuffer = gBufferPass( litRenderables );\n            auto albedo = gBuffer->getProduct( 0 );\n            auto positions = gBuffer->getProduct( 1 );\n            auto normals = gBuffer->getProduct( 2 );\n            auto materials = gBuffer->getProduct( 3 );\n            auto depth = gBuffer->getProduct( 4 );\n\n            if ( settings->get< Bool >( \"debug.show_albedo\" ) ) {\n                return present( albedo );\n            }\n\n            if ( settings->get< Bool >( \"debug.show_metallic\" ) ) {\n                return channel( \"metallic\", materials, 0 );\n            }\n\n            if ( settings->get< Bool >( \"debug.show_roughness\" ) ) {\n                return channel( \"roughness\", materials, 1 );\n            }\n\n            if ( settings->get< Bool >( \"debug.show_ambient_occlusion\" ) ) {\n                return channel( \"ambientOcclusion\", materials, 2 );\n            }\n\n            if ( settings->get< Bool >( \"debug.show_normals\" ) ) {\n                return present( normals );\n            }\n\n            auto reflectionAtlasPass = computeReflectionMap( envRenderables );\n            auto irradianceMapPass = computeIrradianceMap( useResource( reflectionAtlasPass ) );\n            auto prefilterMapPass = computePrefilterMap( useResource( reflectionAtlasPass ) );\n            auto brdfLutPass = computeBRDFLUT( nullptr );\n\n            auto shadowAtlasPass = renderShadowAtlas( litRenderables );\n\n            auto shadowAtlas = useResource( shadowAtlasPass );\n            auto reflectionAtlas = useResource( reflectionAtlasPass );\n            auto irradianceAtlas = useResource( irradianceMapPass );\n            auto prefilterAtlas = useResource( prefilterMapPass );\n            auto brdfLUT = useResource( brdfLutPass );\n\n            \/\/ todo: rename to \"localLightingPass\"\n            auto lit = lightingPass(\n                albedo,\n                positions,\n                normals,\n                materials,\n                depth,\n                shadowAtlas );\n\n            \/\/ TODO: rename to \"globalLightingPass\"\n            auto ibl = iblPass(\n                albedo,\n                positions,\n                normals,\n                materials,\n                depth,\n                reflectionAtlas,\n                irradianceAtlas,\n                prefilterAtlas,\n                brdfLUT );\n\n            auto unlit = forwardUnlitPass( unlitRenderables, nullptr, depth );\n\n            \/\/ Render environment objects in HDR\n            auto env = forwardUnlitPass(\n                envRenderables,\n                useColorAttachment( \"envObjects\/color\", Format::R32G32B32A32_SFLOAT ),\n                depth );\n\n            auto composed = blend(\n                {\n                    useResource( lit ),\n                    useResource( ibl ),\n                    useResource( env ),\n                } );\n\n            if ( settings->get< Bool >( \"video.ssao.enabled\", false ) ) {\n                auto withBlur = [ & ]( auto op ) {\n                    if ( settings->get< Bool >( \"video.ssao.blur\", true ) ) {\n                        return blur( useResource( op ) );\n                    } else {\n                        return op;\n                    }\n                };\n\n                composed = blend(\n                    {\n                        useResource( composed ),\n                        useResource(\n                            withBlur(\n                                ssao(\n                                    positions,\n                                    normals ) ) ),\n                    },\n                    \"multiply\" );\n            }\n\n            auto ret = composed;\n            auto tonemapped = composed;\n\n            if ( settings->get< Bool >( \"video.bloom.enabled\", false ) ) {\n                auto bloom = brightPassFilter(\n                    useResource( composed ),\n                    Vector3f { 0.2126f, 0.7152f, 0.0722f } );\n\n                bloom = gaussianBlur( useResource( bloom ) );\n\n                auto tonemapped = tonemapping(\n                    useResource(\n                        composed ) );\n\n                \/\/ apply bloom after tonemapping\n                ret = blend(\n                    { useResource( tonemapped ), \/\/ forces format to RGB8\n                      useResource( bloom ) } );\n\n            } else {\n                tonemapped = tonemapping(\n                    useResource(\n                        composed ) );\n                ret = tonemapped;\n            }\n\n            ret = blend(\n                {\n                    useResource( unlit ),\n                    useResource( ret ),\n                } );\n\n            if ( enableDebug || settings->get< Bool >( \"debug.show_render_passes\", false ) ) {\n                auto lightCascades = debugLightCascades(\n                    albedo,\n                    positions,\n                    normals,\n                    materials,\n                    depth,\n                    shadowAtlas );\n\n                auto shadowAtlasDebug = debugShadowAtlas( shadowAtlas );\n\n                ret = debug(\n                    {\n                        useResource( ret ),\n                        albedo,\n                        positions,\n                        normals,\n                        materials,\n                        depth,\n                        useResource( shadowAtlasDebug ),\n                        reflectionAtlas,\n                        irradianceAtlas,\n                        prefilterAtlas,\n                        brdfLUT,\n                        useResource( lightCascades ),\n                        useResource( lit ),\n                        useResource( ibl ),\n                        useResource( tonemapped ),\n                        useResource( unlit ),\n                        useResource( env ),\n                    } );\n            }\n\n            return ret;\n        }() );\n}\n\nvoid RenderSystem::useRTSoftRenderPath( Bool enableDebug ) noexcept\n{\n    setFrameGraph(\n        [ & ] {\n            using namespace crimild::framegraph;\n            return present( tonemapping( useResource( softRT() ) ) );\n        }() );\n}\n\nvoid RenderSystem::useRTComputeRenderPath( Bool enableDebug ) noexcept\n{\n    setFrameGraph(\n        [ & ] {\n            using namespace crimild::framegraph;\n            return present( tonemapping( useResource( computeRT() ) ) );\n        }() );\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"Cpu.hpp\"\n#include \"registerAddr.hpp\"\n#include <stdio.h>\n\n#define CLOCKSPEED 4194304\n\n\/*\n ** ################################################################\n ** CREATE Singleton\n ** ################################################################\n *\/\n\/\/ See opcode.hpp\nstd::array<t_opcode, 256>\t\t_opcodeMap;\nstd::array<t_opcode, 256>\t\t_CBopcodeMap;\n\nCpu_z80::Cpu_z80(Memory *memory) :\n\t_memory(memory)\n{\n\t_setOpcodeMap();\n\t_setCbOpcodeMap();\n}\n\nCpu_z80::~Cpu_z80(void)\n{\n}\n\nuint32_t Cpu_z80::getClockSpeed(void)\n{\n\treturn CLOCKSPEED;\n}\n\n\/*\n ** ################################################################\n ** METHOD opcode\n ** ################################################################\n*\/\n\nt_opcode Cpu_z80::_getOpcode(uint8_t opcode)\n{\n\tif (opcode == 0xCB)\n\t{\n\/\/\t\tthis->_cpuRegister.PC += LENGTH_ADDR;\n\t\tuint8_t cbopcode = this->_memory->read_byte(this->_cpuRegister.PC);\n\t\treturn _CBopcodeMap[cbopcode];\n\t}\n\treturn _opcodeMap[opcode];\n}\n\nuint8_t\tCpu_z80::_getCycleOpcode(void)\n{\n\treturn this->_opcodeInProgress.cycleOpcodeNoFlag > this->_opcodeInProgress.cycleOpcodeFlag ?\n\t\tthis->_opcodeInProgress.cycleOpcodeNoFlag : this->_opcodeInProgress.cycleOpcodeFlag;\n}\n\n\nvoid Cpu_z80::_setDataOpcode(void)\n{\n\tif (this->_opcodeInProgress.lengthData > 1 && getStepState())\n\t{\n\t\tif (this->_opcodeInProgress.lengthData > 2)\n\t\t\tthis->_opcodeInProgress.data = this->_memory->read_byte(this->_cpuRegister.PC + LENGTH_ADDR);\n\t\telse\n\t\t\tthis->_opcodeInProgress.data = this->_memory->read_word(this->_cpuRegister.PC + LENGTH_ADDR);\n\t}\n}\n\nvoid Cpu_z80::setStepState(bool state)\n{\n\t_stepState = state;\n}\n\nbool Cpu_z80::getStepState()\n{\n\treturn (this->_stepState);\n}\n\nuint16_t Cpu_z80::_getDataOpcode(void)\n{\n\treturn this->_opcodeInProgress.data;\n}\n\nuint8_t Cpu_z80::_getLengthDataOpcode(void)\n{\n\treturn this->_opcodeInProgress.lengthData;\n}\n\nvoid Cpu_z80::_setHalt(bool state)\n{\n\tthis->_halt = state;\n}\n\nbool Cpu_z80::getHalt(void)\n{\n\treturn this->_halt;\n}\n\nvoid Cpu_z80::_setStop(bool state)\n{\n\tthis->_stop = state;\n}\n\nbool Cpu_z80::getStop(void)\n{\n\treturn this->_stop;\n}\n\nvoid Cpu_z80::_setIME(bool state)\n{\n\tthis->_IME = state;\n}\n\nvoid Cpu_z80::setHoldIME(bool state)\n{\n\tthis->_holdIME = state;\n}\n\nbool Cpu_z80::getHoldIME(void)\n{\n\treturn this->_holdIME;\n}\n\nbool Cpu_z80::getIME(void)\n{\n\treturn this->_IME;\n}\n\n#include \"interrupt.hpp\"\n\nbool Cpu_z80::isInterrupt(void)\n{\n\treturn (this->_memory->read_byte(REGISTER_IF) & INTER_MASK);\n}\n\nbool Cpu_z80::_getInterrupt(uint8_t interrupt)\n{\n\treturn ((this->_memory->read_byte(REGISTER_IF) & interrupt) >= 0x1);\n}\n\n\nvoid Cpu_z80::_loadPtr(uint16_t pc)\n{\n\tthis->_opcodeInProgress = this->_getOpcode(this->_memory->read_byte(pc));\n\tthis->_setDataOpcode();\n}\n\nvoid Cpu_z80::_nextPtr(void) {\n\tif (getStepState())\n\t\tthis->_cpuRegister.PC = this->_cpuRegister.PC + this->_opcodeInProgress.lengthData;\n\tthis->_loadPtr(this->_cpuRegister.PC);\n}\n\nuint8_t Cpu_z80::nbCycleNextOpCode(void)\n{\n\treturn this->_getCycleOpcode();\n}\n\nuint8_t Cpu_z80::executeNextOpcode(void)\n{\n\tif (this->_opcodeInProgress.functionOpcode == NULL)\n\t\tprintf(\"Function not yet implemented: opcode(%.2X), PC = 0x%02x\\n\", this->_opcodeInProgress.opcode, _cpuRegister.PC);\n\telse\n\t\tthis->_opcodeInProgress.functionOpcode();\n\tuint8_t cycle = this->_getCycleOpcode();\n\tthis->_nextPtr();\n\tsetStepState(true);\n\treturn cycle;\n}\n\n#include \"registerAddr.hpp\"\n\nvoid Cpu_z80::init(htype hardware)\n{\n\tsetStepState(true);\n\tthis->_IME = false;\n\tthis->_holdIME = false;\n\n\t\/\/init register cpu\n\tthis->_cpuRegister.A = hardware == GB ? 0x01 : 0x11;\n\tthis->_cpuRegister.F = 0xB0;\n\tthis->_cpuRegister.BC = 0x0013;\n\tthis->_cpuRegister.DE = 0x00D8;\n\tthis->_cpuRegister.HL = 0x014D;\n\n\tthis->_cpuRegister.SP = 0xFFFE;\n\n\t\/\/init register memory\n\tthis->_memory->write_byte(REGISTER_NR10, 0x80);\n\tthis->_memory->write_byte(REGISTER_NR11, 0xBF);\n\tthis->_memory->write_byte(REGISTER_NR12, 0xF3);\n\tthis->_memory->write_byte(REGISTER_NR14, 0xBF);\n\tthis->_memory->write_byte(REGISTER_NR21, 0x3F);\n\tthis->_memory->write_byte(REGISTER_NR22, 0x00);\n\tthis->_memory->write_byte(REGISTER_NR24, 0xBF);\n\tthis->_memory->write_byte(REGISTER_NR30, 0x7F);\n\tthis->_memory->write_byte(REGISTER_NR31, 0xFF);\n\tthis->_memory->write_byte(REGISTER_NR32, 0x9F);\n\tthis->_memory->write_byte(REGISTER_NR33, 0xBF);\n\tthis->_memory->write_byte(REGISTER_NR41, 0xFF);\n\tthis->_memory->write_byte(REGISTER_NR42, 0x00);\n\tthis->_memory->write_byte(REGISTER_NR43, 0x00);\n\tthis->_memory->write_byte(REGISTER_NR30_, 0xBF);\n\tthis->_memory->write_byte(REGISTER_NR50, 0x77);\n\tthis->_memory->write_byte(REGISTER_NR51, 0xF3);\n\tthis->_memory->write_byte(REGISTER_NR52, 0xF1);\n\n\t\/\/ Other register\n\tthis->_memory->write_byte(REGISTER_P1, 0xCF, true);\n\tthis->_memory->write_byte(REGISTER_SB, 0x00);\n\tthis->_memory->write_byte(REGISTER_SC, 0x7E);\n\tthis->_memory->write_byte(REGISTER_DIV, 0xA4); \/\/ bios: 0xD3 start: 0x81\n\tthis->_memory->write_byte(REGISTER_TIMA, 0x00);\n\tthis->_memory->write_byte(REGISTER_TMA, 0x00);\n\tthis->_memory->write_byte(REGISTER_TAC, 0x00);\n\tthis->_memory->write_byte(REGISTER_KEY1, 0xFF);\n\tthis->_memory->write_byte(REGISTER_VBK, 0xFF);\n\tthis->_memory->write_byte(REGISTER_HDMA1, 0xFF);\n\tthis->_memory->write_byte(REGISTER_HDMA2, 0xFF);\n\tthis->_memory->write_byte(REGISTER_HDMA3, 0xFF);\n\tthis->_memory->write_byte(REGISTER_HDMA4, 0xFF);\n\tthis->_memory->write_byte(REGISTER_HDMA5, 0xFF);\n\tthis->_memory->write_byte(REGISTER_SVBK, 0xFF);\n\tthis->_memory->write_byte(REGISTER_IF, 0xE1);\n\tthis->_memory->write_byte(REGISTER_IE, 0x00);\n\t\n\n\tthis->_memory->write_byte(REGISTER_LCDC, 0x91);\n\tthis->_memory->write_byte(REGISTER_STAT, 0x81); \/\/ bios: 0x80 start: 0x81\n\tthis->_memory->write_byte(REGISTER_SCY, 0x00);\n\tthis->_memory->write_byte(REGISTER_SCX, 0x00);\n\tthis->_memory->write_byte(REGISTER_LY, 0x00); \/\/ bios: 0x00 start: 0x81\n\tthis->_memory->write_byte(REGISTER_LYC, 0x00);\n\tthis->_memory->write_byte(REGISTER_DMA, 0xFF);\n\tthis->_memory->write_byte(REGISTER_BGP, 0xFC); \/\/ edelangh: this is bullshit !!\n\tthis->_memory->write_byte(REGISTER_OBP0, 0xFF);\n\tthis->_memory->write_byte(REGISTER_OBP1, 0xFF);\n\tthis->_memory->write_byte(REGISTER_WY, 0x00);\n\tthis->_memory->write_byte(REGISTER_WX, 0x00);\n\t\/* TODO: WTF ? I dont see then in doc *\/\n\tthis->_memory->write_byte(REGISTER_BCPS, 0xFF);\n\tthis->_memory->write_byte(REGISTER_BCPD, 0xFF);\n\tthis->_memory->write_byte(REGISTER_OCPS, 0xFF);\n\tthis->_memory->write_byte(REGISTER_OCPD, 0xFF);\n\n\tthis->_opcodeInProgress = this->_getOpcode(this->_memory->read_byte(this->_cpuRegister.PC));\n\tthis->_setDataOpcode();\n\n\t\/\/TODO: Setup loop, i think this one is up when rom memory is plugged\n\tthis->_setHightBit(REGISTER_TAC, 2);\n}\n\n\/*\n ** ################################################################\n ** METHOD Math\n ** ################################################################\n *\/\n\nvoid Cpu_z80::_setLowBit(uint16_t addr, uint8_t bit)\n{\n\tthis->_memory->write_byte(addr, (uint8_t)((0x01 << bit) ^ this->_memory->read_byte(addr)));\n}\n\nvoid Cpu_z80::_setHightBit(uint16_t addr, uint8_t bit)\n{\n\tthis->_memory->write_byte(addr, (uint8_t)((0x01 << bit) | this->_memory->read_byte(addr)));\n}\n\nvoid Cpu_z80::_resetInterrupt(void)\n{\n\tthis->_memory->write_byte(REGISTER_IF, 0x00);\n}\n\nvoid Cpu_z80::execInterrupt(void)\n{\n\t\/\/ Get interrupt here\n\tif (this->_getInterrupt(INTER_VBLANK))\n\t{\n\t\t\/\/ push PC on stack\n\t\tthis->_cpuRegister.SP -= 2;\n\t\tthis->_memory->write_word(_cpuRegister.SP, _cpuRegister.PC);\n\t\t\/\/ set low INTER_VBLANK\n\t\tthis->_memory->write_byte(REGISTER_IF,\n\t\t\t\t_memory->read_byte(REGISTER_IF) & (INTER_MASK ^ INTER_VBLANK));\n\t\t\/\/ Go to 0x40\n\t\tthis->_cpuRegister.PC = 0x40;\n\t\tthis->_loadPtr(this->_cpuRegister.PC);\n\t}\n\telse if (this->_getInterrupt(INTER_TOVERF))\n\t\tthis->_setStop(false);\n\tthis->_setHalt(false);\n\tthis->_resetInterrupt();\n}\n\nstd::array<uint32_t, 4> Cpu_z80::getArrayFrequency()\n{\n\treturn this->_arrayFrequency;\n}\n\nvoid Cpu_z80::_resetPtrAddr(void)\n{\n\tthis->_cpuRegister.PC = 0x100;\n}\n<commit_msg>Fix non reset PC<commit_after>#include \"Cpu.hpp\"\n#include \"registerAddr.hpp\"\n#include <stdio.h>\n\n#define CLOCKSPEED 4194304\n\n\/*\n ** ################################################################\n ** CREATE Singleton\n ** ################################################################\n *\/\n\/\/ See opcode.hpp\nstd::array<t_opcode, 256>\t\t_opcodeMap;\nstd::array<t_opcode, 256>\t\t_CBopcodeMap;\n\nCpu_z80::Cpu_z80(Memory *memory) :\n\t_memory(memory)\n{\n\t_setOpcodeMap();\n\t_setCbOpcodeMap();\n}\n\nCpu_z80::~Cpu_z80(void)\n{\n}\n\nuint32_t Cpu_z80::getClockSpeed(void)\n{\n\treturn CLOCKSPEED;\n}\n\n\/*\n ** ################################################################\n ** METHOD opcode\n ** ################################################################\n*\/\n\nt_opcode Cpu_z80::_getOpcode(uint8_t opcode)\n{\n\tif (opcode == 0xCB)\n\t{\n\/\/\t\tthis->_cpuRegister.PC += LENGTH_ADDR;\n\t\tuint8_t cbopcode = this->_memory->read_byte(this->_cpuRegister.PC);\n\t\treturn _CBopcodeMap[cbopcode];\n\t}\n\treturn _opcodeMap[opcode];\n}\n\nuint8_t\tCpu_z80::_getCycleOpcode(void)\n{\n\treturn this->_opcodeInProgress.cycleOpcodeNoFlag > this->_opcodeInProgress.cycleOpcodeFlag ?\n\t\tthis->_opcodeInProgress.cycleOpcodeNoFlag : this->_opcodeInProgress.cycleOpcodeFlag;\n}\n\n\nvoid Cpu_z80::_setDataOpcode(void)\n{\n\tif (this->_opcodeInProgress.lengthData > 1 && getStepState())\n\t{\n\t\tif (this->_opcodeInProgress.lengthData > 2)\n\t\t\tthis->_opcodeInProgress.data = this->_memory->read_byte(this->_cpuRegister.PC + LENGTH_ADDR);\n\t\telse\n\t\t\tthis->_opcodeInProgress.data = this->_memory->read_word(this->_cpuRegister.PC + LENGTH_ADDR);\n\t}\n}\n\nvoid Cpu_z80::setStepState(bool state)\n{\n\t_stepState = state;\n}\n\nbool Cpu_z80::getStepState()\n{\n\treturn (this->_stepState);\n}\n\nuint16_t Cpu_z80::_getDataOpcode(void)\n{\n\treturn this->_opcodeInProgress.data;\n}\n\nuint8_t Cpu_z80::_getLengthDataOpcode(void)\n{\n\treturn this->_opcodeInProgress.lengthData;\n}\n\nvoid Cpu_z80::_setHalt(bool state)\n{\n\tthis->_halt = state;\n}\n\nbool Cpu_z80::getHalt(void)\n{\n\treturn this->_halt;\n}\n\nvoid Cpu_z80::_setStop(bool state)\n{\n\tthis->_stop = state;\n}\n\nbool Cpu_z80::getStop(void)\n{\n\treturn this->_stop;\n}\n\nvoid Cpu_z80::_setIME(bool state)\n{\n\tthis->_IME = state;\n}\n\nvoid Cpu_z80::setHoldIME(bool state)\n{\n\tthis->_holdIME = state;\n}\n\nbool Cpu_z80::getHoldIME(void)\n{\n\treturn this->_holdIME;\n}\n\nbool Cpu_z80::getIME(void)\n{\n\treturn this->_IME;\n}\n\n#include \"interrupt.hpp\"\n\nbool Cpu_z80::isInterrupt(void)\n{\n\treturn (this->_memory->read_byte(REGISTER_IF) & INTER_MASK);\n}\n\nbool Cpu_z80::_getInterrupt(uint8_t interrupt)\n{\n\treturn ((this->_memory->read_byte(REGISTER_IF) & interrupt) >= 0x1);\n}\n\n\nvoid Cpu_z80::_loadPtr(uint16_t pc)\n{\n\tthis->_opcodeInProgress = this->_getOpcode(this->_memory->read_byte(pc));\n\tthis->_setDataOpcode();\n}\n\nvoid Cpu_z80::_nextPtr(void) {\n\tif (getStepState())\n\t\tthis->_cpuRegister.PC = this->_cpuRegister.PC + this->_opcodeInProgress.lengthData;\n\tthis->_loadPtr(this->_cpuRegister.PC);\n}\n\nuint8_t Cpu_z80::nbCycleNextOpCode(void)\n{\n\treturn this->_getCycleOpcode();\n}\n\nuint8_t Cpu_z80::executeNextOpcode(void)\n{\n\tif (this->_opcodeInProgress.functionOpcode == NULL)\n\t\tprintf(\"Function not yet implemented: opcode(%.2X), PC = 0x%02x\\n\", this->_opcodeInProgress.opcode, _cpuRegister.PC);\n\telse\n\t\tthis->_opcodeInProgress.functionOpcode();\n\tuint8_t cycle = this->_getCycleOpcode();\n\tthis->_nextPtr();\n\tsetStepState(true);\n\treturn cycle;\n}\n\n#include \"registerAddr.hpp\"\n\nvoid Cpu_z80::init(htype hardware)\n{\n\tsetStepState(true);\n\tthis->_IME = false;\n\tthis->_holdIME = false;\n\n\t\/\/init register cpu\n\tthis->_cpuRegister.A = hardware == GB ? 0x01 : 0x11;\n\tthis->_cpuRegister.F = 0xB0;\n\tthis->_cpuRegister.BC = 0x0013;\n\tthis->_cpuRegister.DE = 0x00D8;\n\tthis->_cpuRegister.HL = 0x014D;\n\n\tthis->_cpuRegister.PC = 0x100;\n\tthis->_cpuRegister.SP = 0xFFFE;\n\n\t\/\/init register memory\n\tthis->_memory->write_byte(REGISTER_NR10, 0x80);\n\tthis->_memory->write_byte(REGISTER_NR11, 0xBF);\n\tthis->_memory->write_byte(REGISTER_NR12, 0xF3);\n\tthis->_memory->write_byte(REGISTER_NR14, 0xBF);\n\tthis->_memory->write_byte(REGISTER_NR21, 0x3F);\n\tthis->_memory->write_byte(REGISTER_NR22, 0x00);\n\tthis->_memory->write_byte(REGISTER_NR24, 0xBF);\n\tthis->_memory->write_byte(REGISTER_NR30, 0x7F);\n\tthis->_memory->write_byte(REGISTER_NR31, 0xFF);\n\tthis->_memory->write_byte(REGISTER_NR32, 0x9F);\n\tthis->_memory->write_byte(REGISTER_NR33, 0xBF);\n\tthis->_memory->write_byte(REGISTER_NR41, 0xFF);\n\tthis->_memory->write_byte(REGISTER_NR42, 0x00);\n\tthis->_memory->write_byte(REGISTER_NR43, 0x00);\n\tthis->_memory->write_byte(REGISTER_NR30_, 0xBF);\n\tthis->_memory->write_byte(REGISTER_NR50, 0x77);\n\tthis->_memory->write_byte(REGISTER_NR51, 0xF3);\n\tthis->_memory->write_byte(REGISTER_NR52, 0xF1);\n\n\t\/\/ Other register\n\tthis->_memory->write_byte(REGISTER_P1, 0xCF, true);\n\tthis->_memory->write_byte(REGISTER_SB, 0x00);\n\tthis->_memory->write_byte(REGISTER_SC, 0x7E);\n\tthis->_memory->write_byte(REGISTER_DIV, 0xA4); \/\/ bios: 0xD3 start: 0x81\n\tthis->_memory->write_byte(REGISTER_TIMA, 0x00);\n\tthis->_memory->write_byte(REGISTER_TMA, 0x00);\n\tthis->_memory->write_byte(REGISTER_TAC, 0x00);\n\tthis->_memory->write_byte(REGISTER_KEY1, 0xFF);\n\tthis->_memory->write_byte(REGISTER_VBK, 0xFF);\n\tthis->_memory->write_byte(REGISTER_HDMA1, 0xFF);\n\tthis->_memory->write_byte(REGISTER_HDMA2, 0xFF);\n\tthis->_memory->write_byte(REGISTER_HDMA3, 0xFF);\n\tthis->_memory->write_byte(REGISTER_HDMA4, 0xFF);\n\tthis->_memory->write_byte(REGISTER_HDMA5, 0xFF);\n\tthis->_memory->write_byte(REGISTER_SVBK, 0xFF);\n\tthis->_memory->write_byte(REGISTER_IF, 0xE1);\n\tthis->_memory->write_byte(REGISTER_IE, 0x00);\n\t\n\n\tthis->_memory->write_byte(REGISTER_LCDC, 0x91);\n\tthis->_memory->write_byte(REGISTER_STAT, 0x81); \/\/ bios: 0x80 start: 0x81\n\tthis->_memory->write_byte(REGISTER_SCY, 0x00);\n\tthis->_memory->write_byte(REGISTER_SCX, 0x00);\n\tthis->_memory->write_byte(REGISTER_LY, 0x00); \/\/ bios: 0x00 start: 0x81\n\tthis->_memory->write_byte(REGISTER_LYC, 0x00);\n\tthis->_memory->write_byte(REGISTER_DMA, 0xFF);\n\tthis->_memory->write_byte(REGISTER_BGP, 0xFC); \/\/ edelangh: this is bullshit !!\n\tthis->_memory->write_byte(REGISTER_OBP0, 0xFF);\n\tthis->_memory->write_byte(REGISTER_OBP1, 0xFF);\n\tthis->_memory->write_byte(REGISTER_WY, 0x00);\n\tthis->_memory->write_byte(REGISTER_WX, 0x00);\n\t\/* TODO: WTF ? I dont see then in doc *\/\n\tthis->_memory->write_byte(REGISTER_BCPS, 0xFF);\n\tthis->_memory->write_byte(REGISTER_BCPD, 0xFF);\n\tthis->_memory->write_byte(REGISTER_OCPS, 0xFF);\n\tthis->_memory->write_byte(REGISTER_OCPD, 0xFF);\n\n\tthis->_opcodeInProgress = this->_getOpcode(this->_memory->read_byte(this->_cpuRegister.PC));\n\tthis->_setDataOpcode();\n\n\t\/\/TODO: Setup loop, i think this one is up when rom memory is plugged\n\tthis->_setHightBit(REGISTER_TAC, 2);\n}\n\n\/*\n ** ################################################################\n ** METHOD Math\n ** ################################################################\n *\/\n\nvoid Cpu_z80::_setLowBit(uint16_t addr, uint8_t bit)\n{\n\tthis->_memory->write_byte(addr, (uint8_t)((0x01 << bit) ^ this->_memory->read_byte(addr)));\n}\n\nvoid Cpu_z80::_setHightBit(uint16_t addr, uint8_t bit)\n{\n\tthis->_memory->write_byte(addr, (uint8_t)((0x01 << bit) | this->_memory->read_byte(addr)));\n}\n\nvoid Cpu_z80::_resetInterrupt(void)\n{\n\tthis->_memory->write_byte(REGISTER_IF, 0x00);\n}\n\nvoid Cpu_z80::execInterrupt(void)\n{\n\t\/\/ Get interrupt here\n\tif (this->_getInterrupt(INTER_VBLANK))\n\t{\n\t\t\/\/ push PC on stack\n\t\tthis->_cpuRegister.SP -= 2;\n\t\tthis->_memory->write_word(_cpuRegister.SP, _cpuRegister.PC);\n\t\t\/\/ set low INTER_VBLANK\n\t\tthis->_memory->write_byte(REGISTER_IF,\n\t\t\t\t_memory->read_byte(REGISTER_IF) & (INTER_MASK ^ INTER_VBLANK));\n\t\t\/\/ Go to 0x40\n\t\tthis->_cpuRegister.PC = 0x40;\n\t\tthis->_loadPtr(this->_cpuRegister.PC);\n\t}\n\telse if (this->_getInterrupt(INTER_TOVERF))\n\t\tthis->_setStop(false);\n\tthis->_setHalt(false);\n\tthis->_resetInterrupt();\n}\n\nstd::array<uint32_t, 4> Cpu_z80::getArrayFrequency()\n{\n\treturn this->_arrayFrequency;\n}\n\nvoid Cpu_z80::_resetPtrAddr(void)\n{\n\tthis->_cpuRegister.PC = 0x100;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <fstream>\n#include <iostream>\n#include \"Rom.hpp\"\n\nRom\t\t\tRom::_instance = Rom();\n\nRom::Rom(void)\n{\n\tthis->_eram = NULL;\n\tthis->_rom = NULL;\n\tthis->_mbcPtrRead = {\n\t\tstd::bind(&Rom::_readRom, this, std::placeholders::_1),\n\t\tstd::bind(&Rom::_readMbc1, this, std::placeholders::_1),\n\t\tstd::bind(&Rom::_readMbc2, this, std::placeholders::_1),\n\t\tstd::bind(&Rom::_readMbc3, this, std::placeholders::_1),\n\t\tstd::bind(&Rom::_readMbc5, this, std::placeholders::_1)\n\t\t};\n\tthis->_mbcPtrWrite = {\n\t\tstd::bind(&Rom::_writeRom, this, std::placeholders::_1, std::placeholders::_2),\n\t\tstd::bind(&Rom::_writeMbc1, this, std::placeholders::_1, std::placeholders::_2),\n\t\tstd::bind(&Rom::_writeMbc2, this, std::placeholders::_1, std::placeholders::_2),\n\t\tstd::bind(&Rom::_writeMbc3, this, std::placeholders::_1, std::placeholders::_2),\n\t\tstd::bind(&Rom::_writeMbc5, this, std::placeholders::_1, std::placeholders::_2)\n\t\t};\n}\n\nRom::~Rom(void)\n{\n\tif (this->_rom != NULL)\n\t\tdelete[] this->_rom;\n\tif (this->_eram != NULL)\n\t\tdelete[] this->_eram;\n}\n\nRom\t\t\t&Rom::Instance(void)\n{\n\treturn Rom::_instance;\n}\n\nvoid\t\tRom::init(void)\n{\n\tuint8_t\tflag_cgb;\n\n\tflag_cgb = (this->_rom[CGBFLAG] & 0xFF);\n\tif (flag_cgb == 0x00 || flag_cgb == 0x80)\n\t\tthis->_hardware = GB;\n\telse if (flag_cgb == 0xC0)\n\t\tthis->_hardware = GBC;\n\tif (this->getBankEram(this->_rom[RAMSIZE]) > 0)\n\t\tthis->_eram = new uint8_t [this->getBankEram(this->_rom[RAMSIZE]) * 8192];\n\tthis->_bank = 0;\n\tthis->_rambank = 0;\n\tthis->_write_protect = 0;\n\tthis->_mbc = this->getMbc(this->_rom[CARTRIDGE]);\n}\n\nint\t\t\tRom::load(const char *file)\n{\n\tstd::ifstream\tromFile;\n\tuint32_t\t\trom_size;\n\n\tif (this->_rom != NULL)\n\t\tdelete[] this->_rom;\n\tif (this->_eram != NULL)\n\t\tdelete[] this->_eram;\n\tthis->_rom = NULL;\n\tthis->_eram = NULL;\n\tromFile.open(file, std::ios::in | std::ios::ate | std::ios::binary);\n\tif (romFile.is_open())\n\t{\n\t\trom_size = romFile.tellg();\n\t\tthis->_rom = new char [rom_size];\n\t\tromFile.seekg(0, std::ios::beg);\n\t\tromFile.read(this->_rom, rom_size);\n\t\tromFile.close();\n\t\tthis->init();\n\t\t\/\/ TODO check if ROM valide (nitendo logo, checksum, ...)\n\t\tif (this->_mbc == 0xFF)\n\t\t\treturn -2;\n\t\treturn 0;\n\t}\n\treturn -1;\n}\n\nhtype\t\tRom::getHardware(void)\n{\n\treturn this->_hardware;\n}\n\nuint8_t\t\tRom::read(uint16_t addr)\n{\n\tif (this->_rom == NULL || this->_mbc == 0xFF)\n\t\treturn -1;\n\treturn this->_mbcPtrRead[this->_mbc](addr);\n}\n\nvoid\t\tRom::write(uint16_t addr, uint8_t val)\n{\n\tif (this->_rom == NULL || this->_mbc == 0xFF)\n\t\treturn ;\n\tthis->_mbcPtrWrite[this->_mbc](addr, val);\n}\n\nvoid\t\tRom::reset(void)\n{\n}\n\nuint8_t\t\tRom::getBankEram(uint8_t octet)\n{\n\tif (octet == 1 || octet == 2)\n\t\treturn 1;\n\telse if (octet == 3)\n\t\treturn 4;\n\telse if (octet == 4)\n\t\treturn 16;\n\treturn 0;\n}\n\nbool\t\tRom::isLoaded(void)\n{\n\tif (this->_rom == NULL)\n\t\treturn false;\n\treturn true;\n}\n\nuint8_t\t\tRom::getMbc(uint8_t octet)\n{\n\tswitch (octet)\n\t{\n\t\tcase 0x00:\n\t\tcase 0x08:\n\t\tcase 0x09:\n\t\t\treturn ROM;\n\t\t\tbreak;\n\t\tcase 0x01:\n\t\tcase 0x02:\n\t\tcase 0x03:\n\t\t\treturn MBC1;\n\t\t\tbreak;\n\t\tcase 0x05:\n\t\tcase 0x06:\n\t\t\treturn MBC2;\n\t\t\tbreak ;\n\t\tcase 0x0F:\n\t\tcase 0x10:\n\t\tcase 0x11:\n\t\tcase 0x12:\n\t\tcase 0x13:\n\t\t\treturn MBC3;\n\t\t\tbreak ;\n\t\tcase 0x19:\n\t\tcase 0x1A:\n\t\tcase 0x1B:\n\t\tcase 0x1C:\n\t\tcase 0x1D:\n\t\tcase 0x1E:\n\t\t\treturn MBC5;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\treturn -1;\n\t\t\tbreak;\n\t}\n\treturn -1;\n}\n\nuint8_t\t\tRom::_readRom(uint16_t addr)\n{\n\tif (addr < 0x8000)\n\t\treturn this->_rom[addr];\n\treturn 0;\n}\n\nuint8_t\t\tRom::_readMbc1(uint16_t addr)\n{\n\tif (addr < 0x4000)\n\t\treturn this->_rom[addr];\n\telse if (addr < 0x8000)\n\t\treturn this->_rom[(addr - 0x4000) + (this->_bank * 0x4000)];\n\telse if (addr >= 0xA000 && addr < 0xC000)\n\t\treturn this->_eram[addr + (this->_rambank * 0x2000)];\n\treturn 0;\n}\n\nuint8_t\t\tRom::_readMbc2(uint16_t addr)\n{\n\treturn 0;\n}\n\nuint8_t\t\tRom::_readMbc3(uint16_t addr)\n{\n\treturn 0;\n}\n\nuint8_t\t\tRom::_readMbc5(uint16_t addr)\n{\n\treturn 0;\n}\n\nvoid\t\tRom::_writeRom(uint16_t addr, uint8_t val)\n{\n\treturn ;\n}\n\nvoid\t\tRom::_writeMbc1(uint16_t addr, uint8_t val)\n{\n\tswitch (addr & 0xF000){\n\t\tcase 0x0000:\n\t\tcase 0x1000:\n\t\t\t\/\/ RAMCS\n\t\t\tif (val == 0x00 || val == 0x0A)\n\t\t\t\tthis->_write_protect = val;\n\t\t\tbreak;\n\t\tcase 0x2000:\n\t\tcase 0x3000:\n\t\t\t\/\/ Rom bank code\n\t\t\tif (val >= 0x01 && val <= 0x1F)\n\t\t\t{\n\t\t\t\tval &= 0x1F;\n\t\t\t\tthis->_bank &= 0xE0;\n\t\t\t\tthis->_bank |= val;\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 0x4000:\n\t\tcase 0x5000:\n\t\t\t\/\/ Upper Rom bank code\n\t\t\tif (val <= 0x03)\n\t\t\t{\n\t\t\t\tif (this->_tbank == 0)\n\t\t\t\t{\n\t\t\t\t\t\/\/ ROM\n\t\t\t\t\tval <<= 5;\n\t\t\t\t\tthis->_bank &= 0x1F;\n\t\t\t\t\tval &= 0xE0;\n\t\t\t\t\tthis->_bank |= val;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t\/\/ ERAM\n\t\t\t\t\tthis->_rambank = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 0x6000:\n\t\tcase 0x7000:\n\t\t\t\/\/ Rom\/Ram change\n\t\t\tif (val == 0x00 || val == 0x01)\n\t\t\t\tthis->_tbank = val;\n\t\t\tbreak;\n\t\tcase 0xA000:\n\t\tcase 0xB000:\n\t\t\t\/\/ ERAM\n\t\t\tif (this->_write_protect == 0x0A)\n\t\t\t\tthis->_eram[addr + (this->_rambank * 0x2000)] = val;\n\t\t\tbreak;\n\t}\n}\n\nvoid\t\tRom::_writeMbc2(uint16_t addr, uint8_t val) {}\nvoid\t\tRom::_writeMbc3(uint16_t addr, uint8_t val) {}\nvoid\t\tRom::_writeMbc5(uint16_t addr, uint8_t val) {}\n<commit_msg>Ajout gestion MBC2<commit_after>#include <fstream>\n#include <iostream>\n#include \"Rom.hpp\"\n\nRom\t\t\tRom::_instance = Rom();\n\nRom::Rom(void)\n{\n\tthis->_eram = NULL;\n\tthis->_rom = NULL;\n\tthis->_mbcPtrRead = {\n\t\tstd::bind(&Rom::_readRom, this, std::placeholders::_1),\n\t\tstd::bind(&Rom::_readMbc1, this, std::placeholders::_1),\n\t\tstd::bind(&Rom::_readMbc2, this, std::placeholders::_1),\n\t\tstd::bind(&Rom::_readMbc3, this, std::placeholders::_1),\n\t\tstd::bind(&Rom::_readMbc5, this, std::placeholders::_1)\n\t\t};\n\tthis->_mbcPtrWrite = {\n\t\tstd::bind(&Rom::_writeRom, this, std::placeholders::_1, std::placeholders::_2),\n\t\tstd::bind(&Rom::_writeMbc1, this, std::placeholders::_1, std::placeholders::_2),\n\t\tstd::bind(&Rom::_writeMbc2, this, std::placeholders::_1, std::placeholders::_2),\n\t\tstd::bind(&Rom::_writeMbc3, this, std::placeholders::_1, std::placeholders::_2),\n\t\tstd::bind(&Rom::_writeMbc5, this, std::placeholders::_1, std::placeholders::_2)\n\t\t};\n}\n\nRom::~Rom(void)\n{\n\tif (this->_rom != NULL)\n\t\tdelete[] this->_rom;\n\tif (this->_eram != NULL)\n\t\tdelete[] this->_eram;\n}\n\nRom\t\t\t&Rom::Instance(void)\n{\n\treturn Rom::_instance;\n}\n\nvoid\t\tRom::init(void)\n{\n\tuint8_t\tflag_cgb;\n\n\tflag_cgb = (this->_rom[CGBFLAG] & 0xFF);\n\tif (flag_cgb == 0x00 || flag_cgb == 0x80)\n\t\tthis->_hardware = GB;\n\telse if (flag_cgb == 0xC0)\n\t\tthis->_hardware = GBC;\n\tif (this->getBankEram(this->_rom[RAMSIZE]) > 0)\n\t\tthis->_eram = new uint8_t [this->getBankEram(this->_rom[RAMSIZE]) * 8192];\n\tthis->_bank = 0;\n\tthis->_rambank = 0;\n\tthis->_write_protect = 0;\n\tthis->_mbc = this->getMbc(this->_rom[CARTRIDGE]);\n}\n\nint\t\t\tRom::load(const char *file)\n{\n\tstd::ifstream\tromFile;\n\tuint32_t\t\trom_size;\n\n\tif (this->_rom != NULL)\n\t\tdelete[] this->_rom;\n\tif (this->_eram != NULL)\n\t\tdelete[] this->_eram;\n\tthis->_rom = NULL;\n\tthis->_eram = NULL;\n\tromFile.open(file, std::ios::in | std::ios::ate | std::ios::binary);\n\tif (romFile.is_open())\n\t{\n\t\trom_size = romFile.tellg();\n\t\tthis->_rom = new char [rom_size];\n\t\tromFile.seekg(0, std::ios::beg);\n\t\tromFile.read(this->_rom, rom_size);\n\t\tromFile.close();\n\t\tthis->init();\n\t\t\/\/ TODO check if ROM valide (nitendo logo, checksum, ...)\n\t\tif (this->_mbc == 0xFF)\n\t\t\treturn -2;\n\t\treturn 0;\n\t}\n\treturn -1;\n}\n\nhtype\t\tRom::getHardware(void)\n{\n\treturn this->_hardware;\n}\n\nuint8_t\t\tRom::read(uint16_t addr)\n{\n\tif (this->_rom == NULL || this->_mbc == 0xFF)\n\t\treturn -1;\n\treturn this->_mbcPtrRead[this->_mbc](addr);\n}\n\nvoid\t\tRom::write(uint16_t addr, uint8_t val)\n{\n\tif (this->_rom == NULL || this->_mbc == 0xFF)\n\t\treturn ;\n\tthis->_mbcPtrWrite[this->_mbc](addr, val);\n}\n\nvoid\t\tRom::reset(void)\n{\n}\n\nuint8_t\t\tRom::getBankEram(uint8_t octet)\n{\n\tif (octet == 1 || octet == 2)\n\t\treturn 1;\n\telse if (octet == 3)\n\t\treturn 4;\n\telse if (octet == 4)\n\t\treturn 16;\n\treturn 0;\n}\n\nbool\t\tRom::isLoaded(void)\n{\n\tif (this->_rom == NULL)\n\t\treturn false;\n\treturn true;\n}\n\nuint8_t\t\tRom::getMbc(uint8_t octet)\n{\n\tswitch (octet)\n\t{\n\t\tcase 0x00:\n\t\tcase 0x08:\n\t\tcase 0x09:\n\t\t\treturn ROM;\n\t\t\tbreak;\n\t\tcase 0x01:\n\t\tcase 0x02:\n\t\tcase 0x03:\n\t\t\treturn MBC1;\n\t\t\tbreak;\n\t\tcase 0x05:\n\t\tcase 0x06:\n\t\t\treturn MBC2;\n\t\t\tbreak ;\n\t\tcase 0x0F:\n\t\tcase 0x10:\n\t\tcase 0x11:\n\t\tcase 0x12:\n\t\tcase 0x13:\n\t\t\treturn MBC3;\n\t\t\tbreak ;\n\t\tcase 0x19:\n\t\tcase 0x1A:\n\t\tcase 0x1B:\n\t\tcase 0x1C:\n\t\tcase 0x1D:\n\t\tcase 0x1E:\n\t\t\treturn MBC5;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\treturn -1;\n\t\t\tbreak;\n\t}\n\treturn -1;\n}\n\nuint8_t\t\tRom::_readRom(uint16_t addr)\n{\n\tif (addr < 0x8000)\n\t\treturn this->_rom[addr];\n\treturn 0;\n}\n\nuint8_t\t\tRom::_readMbc1(uint16_t addr)\n{\n\tif (addr < 0x4000)\n\t\treturn this->_rom[addr];\n\telse if (addr < 0x8000)\n\t\treturn this->_rom[(addr - 0x4000) + (this->_bank * 0x4000)];\n\telse if (addr >= 0xA000 && addr < 0xC000)\n\t\treturn this->_eram[addr + (this->_rambank * 0x2000)];\n\treturn 0;\n}\n\nuint8_t\t\tRom::_readMbc2(uint16_t addr)\n{\n\tif (addr < 0x4000)\n\t\treturn this->_rom[addr];\n\telse if (addr < 0x8000)\n\t\treturn this->_rom[(addr - 0x4000) + (this->_bank * 0x4000)];\n\telse if (addr >= 0xA000 && addr < 0xA200)\n\t\treturn this->_eram[addr];\n\treturn 0;\n}\n\nuint8_t\t\tRom::_readMbc3(uint16_t addr)\n{\n\treturn 0;\n}\n\nuint8_t\t\tRom::_readMbc5(uint16_t addr)\n{\n\treturn 0;\n}\n\nvoid\t\tRom::_writeRom(uint16_t addr, uint8_t val)\n{\n\treturn ;\n}\n\nvoid\t\tRom::_writeMbc1(uint16_t addr, uint8_t val)\n{\n\tswitch (addr & 0xF000){\n\t\tcase 0x0000:\n\t\tcase 0x1000:\n\t\t\t\/\/ RAMCS\n\t\t\tif (val == 0x00 || val == 0x0A)\n\t\t\t\tthis->_write_protect = val;\n\t\t\tbreak;\n\t\tcase 0x2000:\n\t\tcase 0x3000:\n\t\t\t\/\/ Rom bank code\n\t\t\tif (val >= 0x01 && val <= 0x1F)\n\t\t\t{\n\t\t\t\tval &= 0x1F;\n\t\t\t\tthis->_bank &= 0xE0;\n\t\t\t\tthis->_bank |= val;\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 0x4000:\n\t\tcase 0x5000:\n\t\t\t\/\/ Upper Rom bank code\n\t\t\tif (val <= 0x03)\n\t\t\t{\n\t\t\t\tif (this->_tbank == 0)\n\t\t\t\t{\n\t\t\t\t\t\/\/ ROM\n\t\t\t\t\tval <<= 5;\n\t\t\t\t\tthis->_bank &= 0x1F;\n\t\t\t\t\tval &= 0xE0;\n\t\t\t\t\tthis->_bank |= val;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t\/\/ ERAM\n\t\t\t\t\tthis->_rambank = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 0x6000:\n\t\tcase 0x7000:\n\t\t\t\/\/ Rom\/Ram change\n\t\t\tif (val == 0x00 || val == 0x01)\n\t\t\t\tthis->_tbank = val;\n\t\t\tbreak;\n\t\tcase 0xA000:\n\t\tcase 0xB000:\n\t\t\t\/\/ ERAM\n\t\t\tif (this->_write_protect == 0x0A)\n\t\t\t\tthis->_eram[addr + (this->_rambank * 0x2000)] = val;\n\t\t\tbreak;\n\t}\n}\n\nvoid\t\tRom::_writeMbc2(uint16_t addr, uint8_t val)\n{\n\tswitch (addr & 0xF000){\n\t\tcase 0x0000:\n\t\t\t\/\/ RAMCS\n\t\t\tthis->_write_protect = val;\n\t\t\tbreak;\n\t\tcase 0x2000:\n\t\t\t\/\/ Rom bank code\n\t\t\tif ((addr & 0x0F00) == 0x0100)\n\t\t\t{\n\t\t\t\tif (val >= 0x01 && val <= 0x0F)\n\t\t\t\t{\n\t\t\t\t\tval &= 0x0F;\n\t\t\t\t\tthis->_bank &= 0xF0;\n\t\t\t\t\tthis->_bank |= val;\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 0xA000:\n\t\t\t\/\/ ERAM\n\t\t\tif ((addr & 0x0F00) == 0x00 || (addr & 0x0F00) == 0x01)\n\t\t\t{\n\t\t\t\tif (this->_write_protect == 0x0A)\n\t\t\t\t\tthis->_eram[addr] = val;\n\t\t\t}\n\t\t\tbreak;\n\t}\n}\n\nvoid\t\tRom::_writeMbc3(uint16_t addr, uint8_t val) {}\nvoid\t\tRom::_writeMbc5(uint16_t addr, uint8_t val) {}\n<|endoftext|>"}
{"text":"<commit_before>#include <vector>\n\n#include <ros\/ros.h>\n#include <sensor_msgs\/PointCloud2.h>\n#include <geometry_msgs\/PolygonStamped.h>\n#include <geometry_msgs\/Point32.h>\n#include <visualization_msgs\/MarkerArray.h>\n\n#include <pcl\/point_cloud.h>\n#include <pcl\/point_types.h>\n#include <pcl_conversions\/pcl_conversions.h>\n#include <pcl\/segmentation\/sac_segmentation.h>\n#include <pcl\/filters\/voxel_grid.h>\n#include <pcl\/filters\/extract_indices.h>\n#include <pcl\/features\/moment_of_inertia_estimation.h>\n\nusing namespace std;\nros::Publisher pub;\n\nstruct Plane {\n\tpcl::PointXYZ min;\n\tpcl::PointXYZ max;\n};\n\nvoid printROSPoint(geometry_msgs::Point *p) {\n\tROS_INFO(\"Point: %f %f %f\", p->x, p->y, p->z);\n}\n\nvoid printPlane(struct Plane *plane) {\n\tROS_INFO(\"AABB: %f %f %f -> %f %f %f\", plane->min.x, plane->min.y, plane->min.z, plane->max.x, plane->max.z,\n\t\tplane->max.z);\n}\n\nvoid printPoint(pcl::PointXYZ *p) {\n\tROS_INFO(\"Point: %f %f %f\", p->x, p->y, p->z);\n}\n\nvoid getAABB(pcl::PointCloud<pcl::PointXYZ>::Ptr cloud, struct Plane *plane) {\n\tpcl::MomentOfInertiaEstimation<pcl::PointXYZ> feature_extractor;\n\tfeature_extractor.setInputCloud(cloud);\n\tfeature_extractor.compute();\n\tfeature_extractor.getAABB(plane->min, plane->max);\n}\n\n\/**\n * Transforms a point from PCL coordinate system to ROS coordinate system\n *\n * Documentation:\n * ROS: http:\/\/wiki.ros.org\/geometry\/CoordinateFrameConventions\n *\/\nvoid transformPCLPointToROSPoint(pcl::PointXYZ *input, geometry_msgs::Point *output) {\n\toutput->x = input->z;\n\toutput->y = input->x * (-1.f);\n\toutput->z = input->y * (-1.f);\n}\n\nvoid buildRosMarker(visualization_msgs::Marker *marker, struct Plane *plane, unsigned int id) {\n\tmarker->header.frame_id = \"camera_link\";\n\tmarker->header.stamp = ros::Time::now();\n\tmarker->ns = \"hmmwv\";\n\tmarker->id = id;\n\tmarker->lifetime = ros::Duration();\n\n\tmarker->type = visualization_msgs::Marker::LINE_STRIP;\n\tmarker->action = visualization_msgs::Marker::ADD;\n\n\tmarker->scale.x = 0.05f;\n\n\tmarker->color.r = static_cast <float> (rand()) \/ static_cast <float> (RAND_MAX);\n\tmarker->color.g = static_cast <float> (rand()) \/ static_cast <float> (RAND_MAX);\n\tmarker->color.b = static_cast <float> (rand()) \/ static_cast <float> (RAND_MAX);\n\tmarker->color.a = 1.0;\n\n\t\/*\n\t * Get vertices of the rectangle and transform them to ROS coordinates\n\t *\n\t *  p2-----------------p3\n\t *  |                   |\n\t *  |                   |\n\t *  p1-----------------p4\n\t *\n\t *\/\n\n\tgeometry_msgs::Point p1;\n\ttransformPCLPointToROSPoint(&plane->min, &p1);\n\n\tgeometry_msgs::Point p2;\n\tpcl::PointXYZ leftTop(plane->min.x, plane->max.y, plane->min.z);\n\ttransformPCLPointToROSPoint(&leftTop, &p2);\n\n\tgeometry_msgs::Point p3;\n\ttransformPCLPointToROSPoint(&plane->max, &p3);\n\n\tgeometry_msgs::Point p4;\n\tpcl::PointXYZ rightBottom(plane->max.x, plane->min.y, plane->max.z);\n\ttransformPCLPointToROSPoint(&rightBottom, &p4);\n\n\tmarker->points.push_back(p1);\n\tmarker->points.push_back(p2);\n\tmarker->points.push_back(p3);\n\tmarker->points.push_back(p4);\n\tmarker->points.push_back(p1);\n}\n\nvoid callback(const sensor_msgs::PointCloud2ConstPtr& input) {\n\tROS_INFO(\"Callback!\");\n\n\t\/\/ convert from ros::pointcloud2 to pcl::pointcloud2\n\tpcl::PCLPointCloud2* unfilteredCloud = new pcl::PCLPointCloud2;\n\tpcl::PCLPointCloud2ConstPtr unfilteredCloudPtr(unfilteredCloud);\n\tpcl_conversions::toPCL(*input, *unfilteredCloud);\n\n\t\/\/ create a voxelgrid to downsample the input data to speed things up.\n\tpcl::PCLPointCloud2::Ptr filteredCloud (new pcl::PCLPointCloud2);\n\n\tpcl::VoxelGrid<pcl::PCLPointCloud2> sor;\n\tsor.setInputCloud(unfilteredCloudPtr);\n\tsor.setLeafSize(0.01f, 0.01f, 0.01f);\n\tsor.filter(*filteredCloud);\n\n\t\/\/ convert to pointcloud\n\tpcl::PointCloud<pcl::PointXYZ>::Ptr cloud(new pcl::PointCloud<pcl::PointXYZ>);\n\tpcl::fromPCLPointCloud2(*filteredCloud, *cloud);\n\n\t\/\/ Does the parametric segmentation\n\tpcl::ModelCoefficients::Ptr coefficients(new pcl::ModelCoefficients);\n\tpcl::PointIndices::Ptr inliers(new pcl::PointIndices);\n\n\tpcl::SACSegmentation<pcl::PointXYZ> seg;\n\tseg.setOptimizeCoefficients(true);\n\n\tseg.setModelType(pcl::SACMODEL_PLANE);\n\tseg.setModelType(pcl::SACMODEL_PLANE);\n\tseg.setMaxIterations(1000);\n\tseg.setDistanceThreshold(0.01);\n\n\tpcl::ExtractIndices<pcl::PointXYZ> extract;\n\tpcl::PointCloud<pcl::PointXYZ>::Ptr cloud1(new pcl::PointCloud<pcl::PointXYZ>),\n\t\tcloud2(new pcl::PointCloud<pcl::PointXYZ>);\n\tunsigned int pointsAtStart = cloud->points.size(), id = 0;\n\n\tstd::vector<struct Plane> planes;\n\tvisualization_msgs::MarkerArray markerArray;\n\n\t\/\/ while 10% of the original cloud is still present\n\twhile (cloud->points.size() > 0.1 * pointsAtStart) {\n\n\t\tseg.setInputCloud(cloud);\n\t\tseg.segment(*inliers, *coefficients);\n\n\t\tif (inliers->indices.size() == 0) {\n\t\t\tROS_WARN(\"Could not estimate a planar model for the given dataset.\");\n\t\t\tbreak;\n\t\t}\n\n\t\t\/\/ extract the inliers\n\t\textract.setInputCloud(cloud);\n\t\textract.setIndices(inliers);\n\t\textract.setNegative(false);\n\t\textract.filter(*cloud1);\n\n\t\textract.setNegative(true);\n\t\textract.filter(*cloud2);\n\t\tcloud.swap(cloud2);\n\n\t\t\/\/ calculate AABB and add to planes list\n\t\tstruct Plane plane;\n\t\tgetAABB(cloud1, &plane);\n\n\t\t\/\/ calculate the height of the plane and remove planes with less than 5 cm or more than 40 cm\n\t\tfloat height = plane.max.y - plane.min.y;\n\t\tROS_INFO(\"Height: %f\", height);\n\t\tif (height <= 0.4f && height >= 0.0f) {\n\t\t\tvisualization_msgs::Marker marker;\n\t\t\tbuildRosMarker(&marker, &plane, id);\n\t\t\tmarkerArray.markers.push_back(marker);\n\t\t}\n\n\t\tid++;\n\t}\n\n    pub.publish(markerArray);\n}\n\nint main(int argc, char **argv) {\n\n\tros::init(argc, argv, \"stairwaydetector\");\n\tros::NodeHandle nh;\n\tros::Subscriber sub = nh.subscribe<sensor_msgs::PointCloud2>(\"\/camera\/depth\/points\", 1, callback);\n\tpub = nh.advertise<visualization_msgs::MarkerArray>(\"\/hmmwv\/steps\", 0);\n\n\tros::spin();\n\t\n\treturn 0;\n}\n<commit_msg>Some stairsdetection implementation pimps<commit_after>#include <vector>\n#include <cmath>\n\n#include <ros\/ros.h>\n#include <sensor_msgs\/PointCloud2.h>\n#include <geometry_msgs\/PolygonStamped.h>\n#include <geometry_msgs\/Point32.h>\n#include <visualization_msgs\/MarkerArray.h>\n\n#include <pcl\/point_cloud.h>\n#include <pcl\/point_types.h>\n#include <pcl_conversions\/pcl_conversions.h>\n#include <pcl\/segmentation\/sac_segmentation.h>\n#include <pcl\/filters\/voxel_grid.h>\n#include <pcl\/filters\/extract_indices.h>\n#include <pcl\/features\/moment_of_inertia_estimation.h>\n\nusing namespace std;\nros::Publisher pub;\n\nstruct Plane {\n\tpcl::PointXYZ min;\n\tpcl::PointXYZ max;\n};\n\nvoid printROSPoint(geometry_msgs::Point *p) {\n\tROS_INFO(\"Point: %f %f %f\", p->x, p->y, p->z);\n}\n\nvoid printPlane(struct Plane *plane) {\n\tROS_INFO(\"AABB: %f %f %f -> %f %f %f\", plane->min.x, plane->min.y, plane->min.z, plane->max.x, plane->max.z,\n\t\tplane->max.z);\n}\n\nvoid printPoint(pcl::PointXYZ *p) {\n\tROS_INFO(\"Point: %f %f %f\", p->x, p->y, p->z);\n}\n\nvoid getAABB(pcl::PointCloud<pcl::PointXYZ>::Ptr cloud, struct Plane *plane) {\n\tpcl::MomentOfInertiaEstimation<pcl::PointXYZ> feature_extractor;\n\tfeature_extractor.setInputCloud(cloud);\n\tfeature_extractor.compute();\n\tfeature_extractor.getAABB(plane->min, plane->max);\n}\n\n\/**\n * Transforms a point from PCL coordinate system to ROS coordinate system\n *\n * Documentation:\n * ROS: http:\/\/wiki.ros.org\/geometry\/CoordinateFrameConventions\n *\/\nvoid transformPCLPointToROSPoint(pcl::PointXYZ *input, geometry_msgs::Point *output) {\n\toutput->x = input->z;\n\toutput->y = input->x * (-1.f);\n\toutput->z = input->y * (-1.f);\n}\n\nvoid buildRosMarker(visualization_msgs::Marker *marker, struct Plane *plane, unsigned int id) {\n\tmarker->header.frame_id = \"camera_link\";\n\tmarker->header.stamp = ros::Time::now();\n\tmarker->ns = \"hmmwv\";\n\tmarker->id = id;\n\tmarker->lifetime = ros::Duration();\n\n\tmarker->type = visualization_msgs::Marker::LINE_STRIP;\n\tmarker->action = visualization_msgs::Marker::ADD;\n\n\tmarker->scale.x = 0.05f;\n\n\tmarker->color.r = static_cast <float> (rand()) \/ static_cast <float> (RAND_MAX);\n\tmarker->color.g = static_cast <float> (rand()) \/ static_cast <float> (RAND_MAX);\n\tmarker->color.b = static_cast <float> (rand()) \/ static_cast <float> (RAND_MAX);\n\tmarker->color.a = 1.0;\n\n\t\/*\n\t * Get vertices of the rectangle and transform them to ROS coordinates\n\t *\n\t *  p2-----------------p3\n\t *  |                   |\n\t *  |                   |\n\t *  p1-----------------p4\n\t *\n\t *\/\n\n\tgeometry_msgs::Point p1;\n\ttransformPCLPointToROSPoint(&plane->min, &p1);\n\n\tgeometry_msgs::Point p2;\n\tpcl::PointXYZ leftTop(plane->min.x, plane->max.y, plane->min.z);\n\ttransformPCLPointToROSPoint(&leftTop, &p2);\n\n\tgeometry_msgs::Point p3;\n\ttransformPCLPointToROSPoint(&plane->max, &p3);\n\n\tgeometry_msgs::Point p4;\n\tpcl::PointXYZ rightBottom(plane->max.x, plane->min.y, plane->max.z);\n\ttransformPCLPointToROSPoint(&rightBottom, &p4);\n\n\tmarker->points.push_back(p1);\n\tmarker->points.push_back(p2);\n\tmarker->points.push_back(p3);\n\tmarker->points.push_back(p4);\n\tmarker->points.push_back(p1);\n}\n\nvoid callback(const sensor_msgs::PointCloud2ConstPtr& input) {\n\tROS_INFO(\"===================================\");\n\n\t\/\/ convert from ros::pointcloud2 to pcl::pointcloud2\n\tpcl::PCLPointCloud2* unfilteredCloud = new pcl::PCLPointCloud2;\n\tpcl::PCLPointCloud2ConstPtr unfilteredCloudPtr(unfilteredCloud);\n\tpcl_conversions::toPCL(*input, *unfilteredCloud);\n\n\t\/\/ downsample the input data to speed things up.\n\tpcl::PCLPointCloud2::Ptr filteredCloud(new pcl::PCLPointCloud2);\n\n\tpcl::VoxelGrid<pcl::PCLPointCloud2> sor;\n\tsor.setInputCloud(unfilteredCloudPtr);\n\tsor.setLeafSize(0.01f, 0.01f, 0.01f);\n\tsor.filter(*filteredCloud);\n\n\t\/\/ convert to pointcloud\n\tpcl::PointCloud<pcl::PointXYZ>::Ptr cloud(new pcl::PointCloud<pcl::PointXYZ>);\n\tpcl::fromPCLPointCloud2(*filteredCloud, *cloud);\n\n\t\/\/ Do the parametric segmentation\n\tpcl::ModelCoefficients::Ptr coefficients(new pcl::ModelCoefficients);\n\tpcl::PointIndices::Ptr inliers(new pcl::PointIndices);\n\n\tpcl::SACSegmentation<pcl::PointXYZ> seg;\n\tseg.setOptimizeCoefficients(true);\n\n\tseg.setModelType(pcl::SACMODEL_PLANE);\n\tseg.setMethodType(pcl::SAC_RANSAC);\n\tseg.setMaxIterations(1000);\n\tseg.setDistanceThreshold(0.01);\n\n\tpcl::ExtractIndices<pcl::PointXYZ> extract;\n\tpcl::PointCloud<pcl::PointXYZ>::Ptr cloud1(new pcl::PointCloud<pcl::PointXYZ>),\n\t\tcloud2(new pcl::PointCloud<pcl::PointXYZ>);\n\tunsigned int pointsAtStart = cloud->points.size(), id = 0;\n\n\tstd::vector<struct Plane> planes;\n\tvisualization_msgs::MarkerArray markerArray;\n\n\t\/\/ while 5% of the original cloud is still present\n\twhile (cloud->points.size() > 0.05 * pointsAtStart) {\n\n\t\tseg.setInputCloud(cloud);\n\t\tseg.segment(*inliers, *coefficients);\n\n\t\tif (inliers->indices.size() == 0) {\n\t\t\tROS_WARN(\"Could not estimate a planar model for the given dataset.\");\n\t\t\tbreak;\n\t\t}\n\n\t\t\/\/ extract the inliers\n\t\textract.setInputCloud(cloud);\n\t\textract.setIndices(inliers);\n\t\textract.setNegative(false);\n\t\textract.filter(*cloud1);\n\n\t\textract.setNegative(true);\n\t\textract.filter(*cloud2);\n\t\tcloud.swap(cloud2);\n\n\t\t\/\/ calculate AABB and add to planes list\n\t\tstruct Plane plane;\n\t\tgetAABB(cloud1, &plane);\n\n\t\t\/\/ calculate the width of the plane and remove planes with less than 30cm\n\t\t\/\/ calculate the height of the plane and remove planes with less than 5cm or more than 40cm\n\t\tfloat width  = fabs(plane.max.x - plane.min.x);\n\t\tfloat height = plane.max.y - plane.min.y;\n\t\tROS_INFO(\"Width: %f | Height: %f\", width, height);\n\t\tif (width >= 0.3f && height <= 0.4f && height >= 0.15f) {\n\t\t\tvisualization_msgs::Marker marker;\n\t\t\tbuildRosMarker(&marker, &plane, id);\n\t\t\tmarkerArray.markers.push_back(marker);\n\t\t}\n\n\t\tid++;\n\t}\n\n    pub.publish(markerArray);\n}\n\nint main(int argc, char **argv) {\n\n\tros::init(argc, argv, \"stairwaydetector\");\n\tros::NodeHandle nh;\n\tros::Subscriber sub = nh.subscribe<sensor_msgs::PointCloud2>(\"\/camera\/depth\/points\", 1, callback);\n\tpub = nh.advertise<visualization_msgs::MarkerArray>(\"\/hmmwv\/steps\", 0);\n\n\tros::spin();\n\t\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\n\n\n#include <time.h>\n#include <sys\/time.h>\n#include <signal.h>   \/\/ SIGKILL\n\n#include \"logMsg\/logMsg.h\"                          \/\/ LM_X\n\n#include \"au\/string.h\"                             \/\/ au::xml_...\n#include \"au\/TokenTaker.h\"                          \/\/ au::TokenTake\n#include \"au\/ErrorManager.h\"                       \/\/ au::ErrorManager\n#include \"au\/Token.h\"                       \/\/ au::Token\n#include \"au\/xml.h\"         \/\/ au::xml...\n\n\n#include \"Notification.h\"                           \/\/ engine::Notification\n\n#include \"engine\/EngineElement.h\"\t\t\t\t\t\/\/ engine::EngineElement\n#include \"engine\/ProcessItem.h\"                     \/\/ engine::ProcessItem\n#include \"engine\/DiskOperation.h\"\t\t\t\t\t\/\/ engine::DiskOperation\n#include \"engine\/NotificationElement.h\"       \/\/ engine::EngineNotificationElement\n\n#include \"engine\/MemoryManager.h\"\n#include \"engine\/DiskManager.h\"\n#include \"engine\/ProcessManager.h\"\n\n#include \"engine\/Engine.h\"\t\t\t\t\t\t\t\/\/ Own interface\n\n\/\/ Goyo. From 60 to 60000\n#define ENGINE_MAX_RUNNING_TIME     60000\n\nNAMESPACE_BEGIN(engine)\n\n\/\/ Common engine\nEngine *engine = NULL;\n\nvoid* runEngineBakground(void* e )\n{\n    engine->run();\n    return NULL;\n}\n\nEngine::Engine() :  EngineService(\"Engine\") , token(\"EngineToken\")\n{\n    running_element = NULL;                         \/\/ Initially, no running element\n    flag_finish_threads = false;                    \/\/ Put this to \"true\" when destroying Engine\n}\n\nEngine::~Engine()\n{\n    \/\/ Waiting for all threads to finish\n    engine->finish_threads();\n    \n    \/\/ Remove pending elements in Engine\n    elements.clearList();\n}\n\nEngine* Engine::shared()\n{\n    if (!engine )\n        LM_X(1,(\"Please init Engine with Engine::init()\"));\n    return engine;\n}\n\n\nvoid Engine::init()\n{\n    if ( engine )\n    {\n        LM_W((\"Init engine twice... just ignoring\"));\n        return;\n    }\n    \n    \/\/ Create the unique engine entity\n    engine = new Engine();\n    \n    \/\/ Add a simple periodic element to not die inmediatelly\n    EngineElement *element = new NotificationElement( new Notification(\"alive\") , 10 );\n    engine->elements.push_back( element );\n    \n    LM_T( LmtEngine , (\"Running engine in background...\") );\n    pthread_create(&engine->t, 0, runEngineBakground, NULL);\n    \n    \/\/ Function to remove this engine and all EngineServices like MemoryMamager, DiskManager, ProcessManager etc...\n    atexit( destroy_engine_services );\n}\n\nvoid Engine::finish_threads()\n{\n    flag_finish_threads = true;\n    LM_M((\"Waiting threads of Engine to finish...\"));\n    pthread_join(t, NULL);\n    LM_M((\"All Engine threads finished\"));\n}\n\n\n\nEngineElement* Engine::intern_getNextElement()\n{\n    \/\/ Mutex protection\n    au::TokenTaker tt(&token , \"Engine::getNextElement\");\n    \n    \/\/ Compute current time\n    time_t now = time(NULL);\n    \n    if( now >= elements.front()->getThriggerTime() )\n    {\n        EngineElement* element = elements.front();\n        elements.pop_front();\n        return element;\n    }\n    \n    return NULL;\n}\n\nbool Engine::isEmpty()\n{\n    \/\/ Mutex protection\n    au::TokenTaker tt(&token , \"Engine::getNextElement\");\n    \n    return ( elements.size() == 0);\n    \n}\n\nvoid Engine::getNextElement( )\n{\n    \/\/ Defauly values\n    running_element = NULL;\n    \n    while( true )\n    {\n        \/\/ Keep a total counter of loops\n        counter++;  \n        \n        \/\/ If no more elements, just return\n        if( isEmpty() )\n        {\n            LM_T( LmtEngine, (\"SamsonEngine: No more elements to process in the engine. Quitting ...\"));\n            return;\n        }\n        \n        \/\/ Try to get an element\n        EngineElement* element = intern_getNextElement();\n        \n        if( element )\n        {\n            running_element = element;\n            return;\n        }\n        else\n            sleep(1);   \/\/ Sleep until the next element\n        \n    }\n}\n\nvoid Engine::run()\n{\n    \n    LM_T( LmtEngine , (\"Engine run\"));\n    \n    counter = 0;            \/\/ Init the counter to elements managed by this run-time\n    \n    while( true )\n    {\n        \n        \/\/ Finish this thread if necessary\n        if( flag_finish_threads )\n            return; \n        \n        \/\/ Get next element or sleep time\n        getNextElement( );\n        \n        \/\/ Run or sleep\n        if ( !running_element )\n            LM_X(1,(\"Internal error at Engine\"));\n        \n        {\n            \/\/ Execute the item selected as running_element\n            \n            time_t now = time(NULL);\n            LM_T( LmtEngine, (\"[START] Engine executing %s at time:%lu, wanted:%lu\" , running_element->getDescription().c_str(), now, running_element->thiggerTime));\n            \n            if ((now - running_element->thiggerTime) > 30)\n            {\n                LM_W((\"[WARNING] Task %s delayed %d seconds in starting. This should not be more than 30\", running_element->getDescription().c_str() , (int)(now - running_element->thiggerTime )));\n            }\n            \n            \/\/ Reset cronometer for this particular task\n            cronometer.reset();\n            \n            running_element->run();\n            \n            \/\/ Compute the time spent in this element\n            time_t t = cronometer.diffTimeInSeconds();\n            \/\/ Goyo\n            if( t > 1 )\n                LM_W((\"[WARNING2] Task %s spent %s seconds.\", running_element->getDescription().c_str() , au::time_string( t ).c_str()  ));\n            \n            LM_T( LmtEngine, (\"[DONE] Engine executing %s\" , running_element->getDescription().c_str()));\n            \n            EngineElement * _running_element = running_element;\n            \n            running_element = NULL; \/\/ Put running element to NULL\n            \n            if( _running_element->isRepeated() )\n            {\n                \/\/ Insert again\n                _running_element->Reschedule(now);\n                add( _running_element );\n            }\n            else\n                delete _running_element;\n            \n        }\n    }\n}\n\n\nstd::list<EngineElement*>::iterator Engine::_find_pos( EngineElement *e)\n{\n    for (std::list<EngineElement*>::iterator i = elements.begin() ; i != elements.end() ; i++)\n    {\n        if( (*i)->getThriggerTime() > e->getThriggerTime() )\n            return i;\n    }\n    \n    return elements.end();\n}\n\n#pragma mark ----\n\n\/\/ get xml information\nvoid Engine::getInfo( std::ostringstream& output)\n{\n    \/\/ Mutex protection\n    au::TokenTaker tt(&token , \"Engine::str\");\n    \n    au::xml_open(output, \"engine\");\n    \n    au::xml_simple(output , \"loops\" , counter );\n    \n    if( running_element )\n        au::xml_simple( output , \"running_element\" , running_element->getDescription() );\n    else\n        au::xml_simple( output , \"running_element\" , \"No running element\" );\n    \n    au::xml_iterate_list( output , \"elements\" , elements );\n    \n    au::xml_simple( output , \"uptime\" , uptime.diffTimeInSeconds() );\n    \n    au::xml_close(output , \"engine\");\n    \n}\n\n\n\/\/ Functions to register objects ( general and for a particular notification )\nvoid Engine::register_object( Object* object )\n{\n    \/\/ Mutex protection\n    au::TokenTaker tt(&token , \"Engine::register_object\" );\n    \n    objectsManager.add( object );\n}\n\nvoid Engine::register_object_for_channel( Object* object, const char* channel )\n{\n    \/\/ Mutex protection\n    au::TokenTaker tt(&token,\"Engine::register_object_for_channel\");\n    \n    objectsManager.add( object , channel );\n}\n\n\/\/ Generic method to unregister an object\nvoid Engine::unregister_object( Object* object )\n{\n    \/\/ Mutex protection\n    au::TokenTaker tt(&token , \"Engine::unregister_object\");\n    \n    objectsManager.remove( object );\n}\n\n\n\/\/ Run a particular notification\n\/\/ Only executed from friend class \"NotificationElement\"\nvoid Engine::send( Notification * notification )\n{\n    objectsManager.send( notification );\n}\n\n\/\/ Add a notification\nvoid Engine::notify( Notification*  notification )\n{\n    \/\/ Push a notification element with the notification\n    add( new NotificationElement( notification ) );\n}\n\nvoid Engine::notify( Notification*  notification , int seconds )\n{\n    \/\/ Push a notification element with the notification ( in this case with periodic time )\n    add( new NotificationElement( notification , seconds ) );\n}\n\n\/\/ Function to add a simple foreground tasks \nvoid Engine::add( EngineElement *element )\n{\n    \/\/ Mutex protection\n    au::TokenTaker tt(&token);\n    \n    \/\/ Insert an element in the engine\n    elements.insert( engine->_find_pos( element ) ,  element );\n    \n    \/\/ Wake up main thread if sleeping\n    tt.wakeUp();\n}\n\n\/\/ Get an object by its registry names\nObject* Engine::getObjectByName( const char *name )\n{\n    \/\/ Mutex protection\n    au::TokenTaker tt(&token);\n    \n    return objectsManager.getObjectByName(name);\n    \n}\n\nNAMESPACE_END<commit_msg>Better check of excesive time for engine operations<commit_after>\n\n\n#include <time.h>\n#include <sys\/time.h>\n#include <signal.h>   \/\/ SIGKILL\n\n#include \"logMsg\/logMsg.h\"                          \/\/ LM_X\n\n#include \"au\/string.h\"                             \/\/ au::xml_...\n#include \"au\/TokenTaker.h\"                          \/\/ au::TokenTake\n#include \"au\/ErrorManager.h\"                       \/\/ au::ErrorManager\n#include \"au\/Token.h\"                       \/\/ au::Token\n#include \"au\/xml.h\"         \/\/ au::xml...\n\n\n#include \"Notification.h\"                           \/\/ engine::Notification\n\n#include \"engine\/EngineElement.h\"\t\t\t\t\t\/\/ engine::EngineElement\n#include \"engine\/ProcessItem.h\"                     \/\/ engine::ProcessItem\n#include \"engine\/DiskOperation.h\"\t\t\t\t\t\/\/ engine::DiskOperation\n#include \"engine\/NotificationElement.h\"       \/\/ engine::EngineNotificationElement\n\n#include \"engine\/MemoryManager.h\"\n#include \"engine\/DiskManager.h\"\n#include \"engine\/ProcessManager.h\"\n\n#include \"engine\/Engine.h\"\t\t\t\t\t\t\t\/\/ Own interface\n\n\/\/ Goyo. From 60 to 60000\n#define ENGINE_MAX_RUNNING_TIME     60000\n\nNAMESPACE_BEGIN(engine)\n\n\/\/ Common engine\nEngine *engine = NULL;\n\nvoid* runEngineBakground(void* e )\n{\n    engine->run();\n    return NULL;\n}\n\nEngine::Engine() :  EngineService(\"Engine\") , token(\"EngineToken\")\n{\n    running_element = NULL;                         \/\/ Initially, no running element\n    flag_finish_threads = false;                    \/\/ Put this to \"true\" when destroying Engine\n}\n\nEngine::~Engine()\n{\n    \/\/ Waiting for all threads to finish\n    engine->finish_threads();\n    \n    \/\/ Remove pending elements in Engine\n    elements.clearList();\n}\n\nEngine* Engine::shared()\n{\n    if (!engine )\n        LM_X(1,(\"Please init Engine with Engine::init()\"));\n    return engine;\n}\n\n\nvoid Engine::init()\n{\n    if ( engine )\n    {\n        LM_W((\"Init engine twice... just ignoring\"));\n        return;\n    }\n    \n    \/\/ Create the unique engine entity\n    engine = new Engine();\n    \n    \/\/ Add a simple periodic element to not die inmediatelly\n    EngineElement *element = new NotificationElement( new Notification(\"alive\") , 10 );\n    engine->elements.push_back( element );\n    \n    LM_T( LmtEngine , (\"Running engine in background...\") );\n    pthread_create(&engine->t, 0, runEngineBakground, NULL);\n    \n    \/\/ Function to remove this engine and all EngineServices like MemoryMamager, DiskManager, ProcessManager etc...\n    atexit( destroy_engine_services );\n}\n\nvoid Engine::finish_threads()\n{\n    flag_finish_threads = true;\n    LM_M((\"Waiting threads of Engine to finish...\"));\n    pthread_join(t, NULL);\n    LM_M((\"All Engine threads finished\"));\n}\n\n\n\nEngineElement* Engine::intern_getNextElement()\n{\n    \/\/ Mutex protection\n    au::TokenTaker tt(&token , \"Engine::getNextElement\");\n    \n    \/\/ Compute current time\n    time_t now = time(NULL);\n    \n    if( now >= elements.front()->getThriggerTime() )\n    {\n        EngineElement* element = elements.front();\n        elements.pop_front();\n        return element;\n    }\n    \n    return NULL;\n}\n\nbool Engine::isEmpty()\n{\n    \/\/ Mutex protection\n    au::TokenTaker tt(&token , \"Engine::getNextElement\");\n    \n    return ( elements.size() == 0);\n    \n}\n\nvoid Engine::getNextElement( )\n{\n    \/\/ Defauly values\n    running_element = NULL;\n    \n    while( true )\n    {\n        \/\/ Keep a total counter of loops\n        counter++;  \n        \n        \/\/ If no more elements, just return\n        if( isEmpty() )\n        {\n            LM_T( LmtEngine, (\"SamsonEngine: No more elements to process in the engine. Quitting ...\"));\n            return;\n        }\n        \n        \/\/ Try to get an element\n        EngineElement* element = intern_getNextElement();\n        \n        if( element )\n        {\n            running_element = element;\n            return;\n        }\n        else\n            sleep(1);   \/\/ Sleep until the next element\n        \n    }\n}\n\nvoid Engine::run()\n{\n    \n    LM_T( LmtEngine , (\"Engine run\"));\n    \n    counter = 0;            \/\/ Init the counter to elements managed by this run-time\n    \n    while( true )\n    {\n        \n        \/\/ Finish this thread if necessary\n        if( flag_finish_threads )\n            return; \n        \n        \/\/ Get next element or sleep time\n        getNextElement( );\n        \n        \/\/ Run or sleep\n        if ( !running_element )\n            LM_X(1,(\"Internal error at Engine\"));\n        \n        {\n            \/\/ Execute the item selected as running_element\n            \n            time_t now = time(NULL);\n            LM_T( LmtEngine, (\"[START] Engine executing %s at time:%lu, wanted:%lu\" , running_element->getDescription().c_str(), now, running_element->thiggerTime));\n            \n            if ((now - running_element->thiggerTime) > 30)\n            {\n                LM_W((\"[WARNING] Task %s delayed %d seconds in starting. This should not be more than 30\", running_element->getDescription().c_str() , (int)(now - running_element->thiggerTime )));\n            }\n            \n            \/\/ Reset cronometer for this particular task\n            cronometer.reset();\n            \n            running_element->run();\n            \n            \/\/ Compute the time spent in this element\n            double t = cronometer.diffTime();\n            \/\/ Goyo\n            if( t > 1.0 )\n                LM_W((\"[WARNING2] Task %s spent %s seconds.\", running_element->getDescription().c_str() , au::time_string( t ).c_str()  ));\n            \n            LM_T( LmtEngine, (\"[DONE] Engine executing %s\" , running_element->getDescription().c_str()));\n            \n            EngineElement * _running_element = running_element;\n            \n            running_element = NULL; \/\/ Put running element to NULL\n            \n            if( _running_element->isRepeated() )\n            {\n                \/\/ Insert again\n                _running_element->Reschedule(now);\n                add( _running_element );\n            }\n            else\n                delete _running_element;\n            \n        }\n    }\n}\n\n\nstd::list<EngineElement*>::iterator Engine::_find_pos( EngineElement *e)\n{\n    for (std::list<EngineElement*>::iterator i = elements.begin() ; i != elements.end() ; i++)\n    {\n        if( (*i)->getThriggerTime() > e->getThriggerTime() )\n            return i;\n    }\n    \n    return elements.end();\n}\n\n#pragma mark ----\n\n\/\/ get xml information\nvoid Engine::getInfo( std::ostringstream& output)\n{\n    \/\/ Mutex protection\n    au::TokenTaker tt(&token , \"Engine::str\");\n    \n    au::xml_open(output, \"engine\");\n    \n    au::xml_simple(output , \"loops\" , counter );\n    \n    if( running_element )\n        au::xml_simple( output , \"running_element\" , running_element->getDescription() );\n    else\n        au::xml_simple( output , \"running_element\" , \"No running element\" );\n    \n    au::xml_iterate_list( output , \"elements\" , elements );\n    \n    au::xml_simple( output , \"uptime\" , uptime.diffTimeInSeconds() );\n    \n    au::xml_close(output , \"engine\");\n    \n}\n\n\n\/\/ Functions to register objects ( general and for a particular notification )\nvoid Engine::register_object( Object* object )\n{\n    \/\/ Mutex protection\n    au::TokenTaker tt(&token , \"Engine::register_object\" );\n    \n    objectsManager.add( object );\n}\n\nvoid Engine::register_object_for_channel( Object* object, const char* channel )\n{\n    \/\/ Mutex protection\n    au::TokenTaker tt(&token,\"Engine::register_object_for_channel\");\n    \n    objectsManager.add( object , channel );\n}\n\n\/\/ Generic method to unregister an object\nvoid Engine::unregister_object( Object* object )\n{\n    \/\/ Mutex protection\n    au::TokenTaker tt(&token , \"Engine::unregister_object\");\n    \n    objectsManager.remove( object );\n}\n\n\n\/\/ Run a particular notification\n\/\/ Only executed from friend class \"NotificationElement\"\nvoid Engine::send( Notification * notification )\n{\n    objectsManager.send( notification );\n}\n\n\/\/ Add a notification\nvoid Engine::notify( Notification*  notification )\n{\n    \/\/ Push a notification element with the notification\n    add( new NotificationElement( notification ) );\n}\n\nvoid Engine::notify( Notification*  notification , int seconds )\n{\n    \/\/ Push a notification element with the notification ( in this case with periodic time )\n    add( new NotificationElement( notification , seconds ) );\n}\n\n\/\/ Function to add a simple foreground tasks \nvoid Engine::add( EngineElement *element )\n{\n    \/\/ Mutex protection\n    au::TokenTaker tt(&token);\n    \n    \/\/ Insert an element in the engine\n    elements.insert( engine->_find_pos( element ) ,  element );\n    \n    \/\/ Wake up main thread if sleeping\n    tt.wakeUp();\n}\n\n\/\/ Get an object by its registry names\nObject* Engine::getObjectByName( const char *name )\n{\n    \/\/ Mutex protection\n    au::TokenTaker tt(&token);\n    \n    return objectsManager.getObjectByName(name);\n    \n}\n\nNAMESPACE_END<|endoftext|>"}
{"text":"<commit_before>#include \"Variant.h\"\n#include \"convert.h\"\n#include <vector>\n\nusing namespace std;\nusing namespace vcf;\n\nint main(int argc, char** argv) {\n\n    VariantCallFile variantFile;\n\n    if (argc > 1) {\n        string filename = argv[1];\n        variantFile.open(filename);\n    } else {\n        variantFile.open(std::cin);\n    }\n\n    if (!variantFile.is_open()) {\n        return 1;\n    }\n\n    variantFile.addHeaderLine(\"##INFO=<ID=length,Number=A,Type=Integer,Description=\\\"length(ALT) - length(REF) for each ALT\\\">\");\n    cout << variantFile.header << endl;\n\n    Variant var(variantFile);\n    while (variantFile.getNextVariant(var)) {\n\tvector<string>& lengths = var.info[\"length\"];\n\tlengths.clear();\n\tfor (vector<string>::iterator a = var.alt.begin(); a != var.alt.end(); ++a) {\n\t    lengths.push_back(convert(abs((int) a->size() - (int) var.ref.size())));\n\t}\n        cout << var << endl;\n    }\n\n    return 0;\n\n}\n\n<commit_msg>update to vcflength, use +\/- instead of abs(...)<commit_after>#include \"Variant.h\"\n#include \"convert.h\"\n#include <vector>\n\nusing namespace std;\nusing namespace vcf;\n\nint main(int argc, char** argv) {\n\n    VariantCallFile variantFile;\n\n    if (argc > 1) {\n        string filename = argv[1];\n        variantFile.open(filename);\n    } else {\n        variantFile.open(std::cin);\n    }\n\n    if (!variantFile.is_open()) {\n        return 1;\n    }\n\n    variantFile.addHeaderLine(\"##INFO=<ID=length,Number=A,Type=Integer,Description=\\\"length(ALT) - length(REF) for each ALT\\\">\");\n    cout << variantFile.header << endl;\n\n    Variant var(variantFile);\n    while (variantFile.getNextVariant(var)) {\n        vector<string>& lengths = var.info[\"length\"];\n        lengths.clear();\n        for (vector<string>::iterator a = var.alt.begin(); a != var.alt.end(); ++a) {\n            lengths.push_back(convert((int) a->size() - (int) var.ref.size()));\n        }\n        cout << var << endl;\n    }\n\n    return 0;\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/  illarionserver - server for the game Illarion\n\/\/  Copyright 2011 Illarion e.V.\n\/\/\n\/\/  This file is part of illarionserver.\n\/\/\n\/\/  illarionserver is free software: you can redistribute it and\/or modify\n\/\/  it under the terms of the GNU General Public License as published by\n\/\/  the Free Software Foundation, either version 3 of the License, or\n\/\/  (at your option) any later version.\n\/\/\n\/\/  illarionserver is distributed in the hope that it will be useful,\n\/\/  but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n\/\/  GNU General Public License for more details.\n\/\/\n\/\/  You should have received a copy of the GNU General Public License\n\/\/  along with illarionserver.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n\n#include \"db\/ConnectionManager.hpp\"\n#include \"db\/SchemaHelper.hpp\"\n#include \"db\/SelectQuery.hpp\"\n#include \"db\/Result.hpp\"\n\n#include \"ArmorObjectTable.hpp\"\n#include \"types.hpp\"\n\n#include <iostream>\n#include <sstream>\n\nArmorObjectTable::ArmorObjectTable() : m_dataOK(false) {\n    reload();\n}\n\nvoid ArmorObjectTable::reload() {\n#ifdef DataConnect_DEBUG\n    std::cout << \"ArmorObjectTable: reload\" << std::endl;\n#endif\n\n    try {\n        Database::PConnection connection =\n            Database::ConnectionManager::getInstance().getConnection();\n\n        Database::SelectQuery query(*connection);\n        query.addColumn(\"armor\", \"arm_itemid\");\n        query.addColumn(\"armor\", \"arm_bodyparts\");\n        query.addColumn(\"armor\", \"arm_puncture\");\n        query.addColumn(\"armor\", \"arm_stroke\");\n        query.addColumn(\"armor\", \"arm_thrust\");\n        query.addColumn(\"armor\", \"arm_magicdisturbance\");\n        query.addColumn(\"armor\", \"arm_absorb\");\n        query.addColumn(\"armor\", \"arm_stiffness\");\n        query.addServerTable(\"armor\");\n\n        Database::Result results = query.execute();\n        Database::ConnectionManager::getInstance().releaseConnection(connection);\n\n        if (!results.empty()) {\n            clearOldTable();\n            ArmorStruct temprecord;\n\n            for (Database::Result::ConstIterator itr = results.begin();\n                 itr != results.end(); ++itr) {\n\n                temprecord.BodyParts = (TYPE_OF_BODYPARTS)((*itr)[\"arm_bodyparts\"].as<int16_t>());\n                temprecord.PunctureArmor = (TYPE_OF_PUNCTUREARMOR)((*itr)[\"arm_puncture\"].as<int16_t>());\n                temprecord.StrokeArmor = (TYPE_OF_STROKEARMOR)((*itr)[\"arm_stroke\"].as<int16_t>());\n                temprecord.ThrustArmor = (TYPE_OF_THRUSTARMOR)((*itr)[\"arm_thrust\"].as<int16_t>());\n                temprecord.MagicDisturbance = (TYPE_OF_MAGICDISTURBANCE)(*itr)[\"arm_magicdisturbance\"].as<int32_t>();\n                temprecord.Absorb = (*itr)[\"arm_absorb\"].as<int16_t>();\n                temprecord.Stiffness = (*itr)[\"arm_stiffness\"].as<int16_t>();\n\n                m_table[(TYPE_OF_ITEM_ID)((*itr)[\"arm_itemid\"].as<TYPE_OF_ITEM_ID>())] = temprecord;\n            }\n\n            m_dataOK = true;\n        } else {\n            m_dataOK = false;\n        }\n\n#ifdef DataConnect_DEBUG\n        std::cout << \"loaded \" << rows;\n        std::cout << \" rows into ArmorObjectTable\" << std::endl;\n#endif\n\n    } catch (...) {\n        m_dataOK = false;\n    }\n}\n\nbool ArmorObjectTable::find(TYPE_OF_ITEM_ID Id, ArmorStruct &ret) {\n    TABLE::iterator iterator;\n    iterator = m_table.find(Id);\n\n    if (iterator == m_table.end()) {\n        return false;\n    } else {\n        ret = (*iterator).second;\n        return true;\n    }\n}\n\n\n\nvoid ArmorObjectTable::clearOldTable() {\n    m_table.clear();\n}\n\n\nArmorObjectTable::~ArmorObjectTable() {\n    clearOldTable();\n}\n<commit_msg>Cleaned implementation of the new database interface to the armor object table<commit_after>\/\/  illarionserver - server for the game Illarion\n\/\/  Copyright 2011 Illarion e.V.\n\/\/\n\/\/  This file is part of illarionserver.\n\/\/\n\/\/  illarionserver is free software: you can redistribute it and\/or modify\n\/\/  it under the terms of the GNU General Public License as published by\n\/\/  the Free Software Foundation, either version 3 of the License, or\n\/\/  (at your option) any later version.\n\/\/\n\/\/  illarionserver is distributed in the hope that it will be useful,\n\/\/  but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n\/\/  GNU General Public License for more details.\n\/\/\n\/\/  You should have received a copy of the GNU General Public License\n\/\/  along with illarionserver.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n#include \"ArmorObjectTable.hpp\"\n\n#include \"db\/ConnectionManager.hpp\"\n#include \"db\/SchemaHelper.hpp\"\n#include \"db\/SelectQuery.hpp\"\n#include \"db\/Result.hpp\"\n\n#include \"types.hpp\"\n\n#include <iostream>\n#include <sstream>\n\nArmorObjectTable::ArmorObjectTable() : m_dataOK(false) {\n    reload();\n}\n\nvoid ArmorObjectTable::reload() {\n#ifdef DataConnect_DEBUG\n    std::cout << \"ArmorObjectTable: reload\" << std::endl;\n#endif\n\n    try {\n        Database::PConnection connection =\n            Database::ConnectionManager::getInstance().getConnection();\n\n        Database::SelectQuery query(*connection);\n        query.addColumn(\"armor\", \"arm_itemid\");\n        query.addColumn(\"armor\", \"arm_bodyparts\");\n        query.addColumn(\"armor\", \"arm_puncture\");\n        query.addColumn(\"armor\", \"arm_stroke\");\n        query.addColumn(\"armor\", \"arm_thrust\");\n        query.addColumn(\"armor\", \"arm_magicdisturbance\");\n        query.addColumn(\"armor\", \"arm_absorb\");\n        query.addColumn(\"armor\", \"arm_stiffness\");\n        query.addServerTable(\"armor\");\n\n        Database::Result results = query.execute();\n        Database::ConnectionManager::getInstance().releaseConnection(connection);\n\n        if (!results.empty()) {\n            clearOldTable();\n            ArmorStruct temprecord;\n\n            for (Database::Result::ConstIterator itr = results.begin();\n                 itr != results.end(); ++itr) {\n\n                temprecord.BodyParts = (TYPE_OF_BODYPARTS)((*itr)[\"arm_bodyparts\"].as<int16_t>());\n                temprecord.PunctureArmor = (TYPE_OF_PUNCTUREARMOR)((*itr)[\"arm_puncture\"].as<int16_t>());\n                temprecord.StrokeArmor = (TYPE_OF_STROKEARMOR)((*itr)[\"arm_stroke\"].as<int16_t>());\n                temprecord.ThrustArmor = (TYPE_OF_THRUSTARMOR)((*itr)[\"arm_thrust\"].as<int16_t>());\n                temprecord.MagicDisturbance = (TYPE_OF_MAGICDISTURBANCE)(*itr)[\"arm_magicdisturbance\"].as<int32_t>();\n                temprecord.Absorb = (*itr)[\"arm_absorb\"].as<int16_t>();\n                temprecord.Stiffness = (*itr)[\"arm_stiffness\"].as<int16_t>();\n\n                m_table[(TYPE_OF_ITEM_ID)((*itr)[\"arm_itemid\"].as<TYPE_OF_ITEM_ID>())] = temprecord;\n            }\n\n            m_dataOK = true;\n        } else {\n            m_dataOK = false;\n        }\n\n#ifdef DataConnect_DEBUG\n        std::cout << \"loaded \" << rows;\n        std::cout << \" rows into ArmorObjectTable\" << std::endl;\n#endif\n\n    } catch (...) {\n        m_dataOK = false;\n    }\n}\n\nbool ArmorObjectTable::find(TYPE_OF_ITEM_ID Id, ArmorStruct &ret) {\n    TABLE::iterator iterator;\n    iterator = m_table.find(Id);\n\n    if (iterator == m_table.end()) {\n        return false;\n    } else {\n        ret = (*iterator).second;\n        return true;\n    }\n}\n\n\n\nvoid ArmorObjectTable::clearOldTable() {\n    m_table.clear();\n}\n\n\nArmorObjectTable::~ArmorObjectTable() {\n    clearOldTable();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: hfi_tag.cxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: obo $ $Date: 2004-11-15 13:34: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\n#include <precomp.h>\n#include \"hfi_tag.hxx\"\n\n\n\/\/ NOT FULLY DEFINED SERVICES\n#include <ary\/idl\/i_ce.hxx>\n#include <ary\/idl\/i_module.hxx>\n#include <ary_i\/ci_text2.hxx>\n#include <ary_i\/d_token.hxx>\n#include <toolkit\/out_tree.hxx>\n#include <adc_cl.hxx>\n#include \"hfi_typetext.hxx\"\n#include \"hi_ary.hxx\"\n#include \"hi_env.hxx\"\n#include \"hi_linkhelper.hxx\"\n\n\nusing ary::info::DocuTex2;\n\n\ninline void\nHF_IdlTag::Enter_TextOut( Xml::Element & o_rText ) const\n{\n    aTextOut.Out().Enter(o_rText);\n}\n\ninline void\nHF_IdlTag::Leave_TextOut() const\n{\n    aTextOut.Out().Leave();\n}\n\ninline void\nHF_IdlTag::PutText_Out( const ary::info::DocuTex2 & i_rText ) const\n{\n    i_rText.DisplayAt( const_cast< HF_IdlDocuTextDisplay& >(aTextOut) );\n}\n\n\n\nHF_IdlTag::HF_IdlTag( Environment &                 io_rEnv,\n                      const ary::idl::CodeEntity &  i_rScopeGivingCe )\n    :   HtmlFactory_Idl( io_rEnv, 0 ),\n        pTitleOut(0),\n        aTextOut(io_rEnv, 0, i_rScopeGivingCe)\n{\n}\n\nHF_IdlTag::~HF_IdlTag()\n{\n}\n\nvoid\nHF_IdlTag::Produce_byData( Xml::Element &              o_rTitle,\n                           Xml::Element &              o_rText,\n                           const ary::info::AtTag2 &   i_rTag ) const\n{\n    pTitleOut = &o_rTitle;\n    Enter_TextOut(o_rText);\n    i_rTag.DisplayAt( const_cast< HF_IdlTag& >(*this) );\n    Leave_TextOut();\n}\n\nvoid\nHF_IdlTag::Display_StdAtTag( const csi::dsapi::DT_StdAtTag & i_rTag )\n{\n    if ( i_rTag.Text().IsEmpty() )\n        return;\n\n    csv_assert( pTitleOut != 0 );\n    *pTitleOut << i_rTag.Title();\n    PutText_Out( i_rTag.Text() );\n}\n\nvoid\nHF_IdlTag::Display_SeeAlsoAtTag( const csi::dsapi::DT_SeeAlsoAtTag & i_rTag )\n{\n    if ( i_rTag.Text().IsEmpty() )\n        return;\n\n    csv_assert( pTitleOut != 0 );\n    *pTitleOut << \"See also\";\n\n    HF_IdlTypeText aLinkText(Env(),aTextOut.CurOut(),true, &aTextOut.ScopeGivingCe());\n    aLinkText.Produce_byData( i_rTag.LinkText() );\n\n    aTextOut.CurOut() << new Html::LineBreak;\n    PutText_Out( i_rTag.Text() );\n}\n\nvoid\nHF_IdlTag::Display_ParameterAtTag( const csi::dsapi::DT_ParameterAtTag & i_rTag )\n{\n    csv_assert( pTitleOut != 0 );\n    *pTitleOut\n        << ( StreamLock(100)() << \"Parameter \" << i_rTag.Title() << c_str );\n    PutText_Out( i_rTag.Text() );\n}\n\nvoid\nHF_IdlTag::Display_SinceAtTag( const csi::dsapi::DT_SinceAtTag & i_rTag )\n{\n    csv_assert(pTitleOut != 0);\n\n    if ( i_rTag.Text().IsEmpty() )\n    {\n         return;\n    }\n\n    \/\/ Transform the value of the @since tag into the text to be displayed.\n    String sDisplay =\n        autodoc::CommandLine::Get_().DisplayOf_SinceTagValue(\n                                        i_rTag.Text().TextOfFirstToken() );\n    if (sDisplay.empty())\n        return;\n\n    *pTitleOut << \"Since \";\n    DocuTex2 aHelp;\n    aHelp.AddToken(* new csi::dsapi::DT_TextToken(sDisplay));\n    PutText_Out(aHelp);\n}\n\n\n\/\/********************      HF_IdlShortDocu     *********************\/\n\nHF_IdlShortDocu::HF_IdlShortDocu( Environment &         io_rEnv,\n                                  Xml::Element &        o_rOut )\n    :   HtmlFactory_Idl( io_rEnv, &o_rOut )\n{\n}\n\nHF_IdlShortDocu::~HF_IdlShortDocu()\n{\n}\n\nvoid\nHF_IdlShortDocu::Produce_byData( const ary::idl::CodeEntity & i_rCe )\n{\n    if (i_rCe.Docu() == 0)\n        return;\n\n    const ce_info &\n        rDocu = *i_rCe.Docu();\n    if ( rDocu.IsDeprecated() )\n    {\n        CurOut()\n            >> *new Html::Bold\n                << \"[ DEPRECATED ]\" << new Html::LineBreak;\n    }\n    if ( rDocu.IsOptional() )\n    {\n        CurOut()\n            >> *new Html::Bold\n                << \"[ OPTIONAL ]\" << new Html::LineBreak;\n    }\n\n    HF_IdlDocuTextDisplay\n        aText( Env(), &CurOut(), i_rCe);\n    rDocu.Short().DisplayAt(aText);\n}\n\n\n\/\/********************      HF_IdlDocuTextDisplay       *********************\/\n\n\nHF_IdlDocuTextDisplay::HF_IdlDocuTextDisplay( Environment &                 io_rEnv,\n                                              Xml::Element *                o_pOut,\n                                              const ary::idl::CodeEntity &  i_rScopeGivingCe )\n    :   HtmlFactory_Idl(io_rEnv, o_pOut),\n        sScope(),\n        sLinkToken(),\n        bGatherLink(false),\n        pScopeGivingCe(&i_rScopeGivingCe)\n{\n}\n\nHF_IdlDocuTextDisplay::~HF_IdlDocuTextDisplay()\n{\n}\n\nvoid\nHF_IdlDocuTextDisplay::Display_TextToken( const csi::dsapi::DT_TextToken & i_rToken )\n{\n    if (bGatherLink)\n    {\n        if (sLinkToken.length() == 0)\n        {\n            sLinkToken = i_rToken.GetText();\n            return;\n        }\n        else\n        {\n            Cerr() << \"Error in documentation: Too many or too few tokens for a link in <member> or <type>.\" << Endl();\n            Cerr() << \"  Link won't be created, but all tokens shown plain.\" << Endl();\n            Cerr() << \"  \\\"\" << sLinkToken << \"\\\"\";\n            if ( pScopeGivingCe != 0 )\n                Cerr() << \" in \" << pScopeGivingCe->LocalName();\n            Cerr() << Endl();\n            StopLinkGathering();\n        }\n    }   \/\/ endif (bGatherLink)\n\n    CurOut() << new Xml::XmlCode( i_rToken.GetText() ) << \" \";\n}\n\nvoid\nHF_IdlDocuTextDisplay::Display_MupType( const csi::dsapi::DT_MupType & i_rToken )\n{\n    if (i_rToken.IsBegin())\n    {\n        StartLinkGathering(i_rToken.Scope());\n    }\n    else\n    {\n        if (bGatherLink)\n        {\n            CreateTypeLink();\n            CurOut()\n                << \" \";\n            StopLinkGathering();\n        }\n    }\n}\n\nvoid\nHF_IdlDocuTextDisplay::Display_MupMember( const csi::dsapi::DT_MupMember & i_rToken )\n{\n    if (i_rToken.IsBegin())\n    {\n        StartLinkGathering(i_rToken.Scope());\n    }\n    else\n    {\n        if (bGatherLink)\n        {\n            CreateMemberLink();\n            CurOut()\n                << \" \";\n            StopLinkGathering();\n        }\n    }\n}\n\nvoid\nHF_IdlDocuTextDisplay::Display_MupConst( const csi::dsapi::DT_MupConst & i_rToken )\n{\n    CurOut()\n        >> *new Html::Bold\n           << i_rToken.GetText();\n    CurOut()\n        << \" \";\n}\n\nvoid\nHF_IdlDocuTextDisplay::Display_Style( const csi::dsapi::DT_Style & i_rToken )\n{\n    CurOut() << new Xml::XmlCode( i_rToken.GetText() );\n}\n\nvoid\nHF_IdlDocuTextDisplay::Display_EOL()\n{\n    CurOut() << \"\\n\";\n}\n\nvoid\nHF_IdlDocuTextDisplay::CreateTypeLink()\n{\n    if (strchr(sLinkToken,':') != 0)\n    {\n         Cerr() << \"Warning: Qualified name (probably member) \\\"\"\n                << sLinkToken\n                << \"\\\" found in <type> tag in \"\n               << Env().CurPageCe_AsText()\n               << Endl();\n        CurOut() << sLinkToken;\n        return;\n    }\n    HF_IdlTypeText aLink(Env(), CurOut(), true, &ScopeGivingCe());\n    aLink.Produce_LinkInDocu(sScope, sLinkToken, String::Null_());\n}\n\nvoid\nHF_IdlDocuTextDisplay::CreateMemberLink()\n{\n\n    HF_IdlTypeText aLink(Env(), CurOut(), true, &ScopeGivingCe());\n\n    const char *\n        sSplit = strchr(sLinkToken,':');\n\n    if (sSplit != 0)\n    {\n        String sCe(sLinkToken.c_str(), sSplit - sLinkToken.c_str());\n        String sMember(sSplit+2);\n\n        if (NOT sScope.empty() OR ScopeGivingCe().LocalName() != sCe )\n            aLink.Produce_LinkInDocu(sScope, sCe, sMember);\n        else\n            aLink.Produce_LocalLinkInDocu(sMember);\n    }\n    else\n    {\n        aLink.Produce_LocalLinkInDocu(sLinkToken);\n    }\n}\n<commit_msg>INTEGRATION: CWS adc10 (1.5.2); FILE MERGED 2005\/01\/12 13:14:25 np 1.5.2.1: #i31025# Convenient error log file.<commit_after>\/*************************************************************************\n *\n *  $RCSfile: hfi_tag.cxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: obo $ $Date: 2005-01-27 11:18:53 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n\n#include <precomp.h>\n#include \"hfi_tag.hxx\"\n\n\n\/\/ NOT FULLY DEFINED SERVICES\n#include <ary\/idl\/i_ce.hxx>\n#include <ary\/idl\/i_module.hxx>\n#include <ary_i\/ci_text2.hxx>\n#include <ary_i\/d_token.hxx>\n#include <toolkit\/out_tree.hxx>\n#include <adc_cl.hxx>\n#include <adc_msg.hxx>\n#include \"hfi_typetext.hxx\"\n#include \"hi_ary.hxx\"\n#include \"hi_env.hxx\"\n#include \"hi_linkhelper.hxx\"\n\n\nusing ary::info::DocuTex2;\n\n\ninline void\nHF_IdlTag::Enter_TextOut( Xml::Element & o_rText ) const\n{\n    aTextOut.Out().Enter(o_rText);\n}\n\ninline void\nHF_IdlTag::Leave_TextOut() const\n{\n    aTextOut.Out().Leave();\n}\n\ninline void\nHF_IdlTag::PutText_Out( const ary::info::DocuTex2 & i_rText ) const\n{\n    i_rText.DisplayAt( const_cast< HF_IdlDocuTextDisplay& >(aTextOut) );\n}\n\n\n\nHF_IdlTag::HF_IdlTag( Environment &                 io_rEnv,\n                      const ary::idl::CodeEntity &  i_rScopeGivingCe )\n    :   HtmlFactory_Idl( io_rEnv, 0 ),\n        pTitleOut(0),\n        aTextOut(io_rEnv, 0, i_rScopeGivingCe)\n{\n}\n\nHF_IdlTag::~HF_IdlTag()\n{\n}\n\nvoid\nHF_IdlTag::Produce_byData( Xml::Element &              o_rTitle,\n                           Xml::Element &              o_rText,\n                           const ary::info::AtTag2 &   i_rTag ) const\n{\n    pTitleOut = &o_rTitle;\n    Enter_TextOut(o_rText);\n    i_rTag.DisplayAt( const_cast< HF_IdlTag& >(*this) );\n    Leave_TextOut();\n}\n\nvoid\nHF_IdlTag::Display_StdAtTag( const csi::dsapi::DT_StdAtTag & i_rTag )\n{\n    if ( i_rTag.Text().IsEmpty() )\n        return;\n\n    csv_assert( pTitleOut != 0 );\n    *pTitleOut << i_rTag.Title();\n    PutText_Out( i_rTag.Text() );\n}\n\nvoid\nHF_IdlTag::Display_SeeAlsoAtTag( const csi::dsapi::DT_SeeAlsoAtTag & i_rTag )\n{\n    if ( i_rTag.Text().IsEmpty() )\n        return;\n\n    csv_assert( pTitleOut != 0 );\n    *pTitleOut << \"See also\";\n\n    HF_IdlTypeText aLinkText(Env(),aTextOut.CurOut(),true, &aTextOut.ScopeGivingCe());\n    aLinkText.Produce_byData( i_rTag.LinkText() );\n\n    aTextOut.CurOut() << new Html::LineBreak;\n    PutText_Out( i_rTag.Text() );\n}\n\nvoid\nHF_IdlTag::Display_ParameterAtTag( const csi::dsapi::DT_ParameterAtTag & i_rTag )\n{\n    csv_assert( pTitleOut != 0 );\n    *pTitleOut\n        << ( StreamLock(100)() << \"Parameter \" << i_rTag.Title() << c_str );\n    PutText_Out( i_rTag.Text() );\n}\n\nvoid\nHF_IdlTag::Display_SinceAtTag( const csi::dsapi::DT_SinceAtTag & i_rTag )\n{\n    csv_assert(pTitleOut != 0);\n\n    if ( i_rTag.Text().IsEmpty() )\n    {\n         return;\n    }\n\n    \/\/ Transform the value of the @since tag into the text to be displayed.\n    String sDisplay =\n        autodoc::CommandLine::Get_().DisplayOf_SinceTagValue(\n                                        i_rTag.Text().TextOfFirstToken() );\n    if (sDisplay.empty())\n        return;\n\n    *pTitleOut << \"Since \";\n    DocuTex2 aHelp;\n    aHelp.AddToken(* new csi::dsapi::DT_TextToken(sDisplay));\n    PutText_Out(aHelp);\n}\n\n\n\/\/********************      HF_IdlShortDocu     *********************\/\n\nHF_IdlShortDocu::HF_IdlShortDocu( Environment &         io_rEnv,\n                                  Xml::Element &        o_rOut )\n    :   HtmlFactory_Idl( io_rEnv, &o_rOut )\n{\n}\n\nHF_IdlShortDocu::~HF_IdlShortDocu()\n{\n}\n\nvoid\nHF_IdlShortDocu::Produce_byData( const ary::idl::CodeEntity & i_rCe )\n{\n    if (i_rCe.Docu() == 0)\n        return;\n\n    const ce_info &\n        rDocu = *i_rCe.Docu();\n    if ( rDocu.IsDeprecated() )\n    {\n        CurOut()\n            >> *new Html::Bold\n                << \"[ DEPRECATED ]\" << new Html::LineBreak;\n    }\n    if ( rDocu.IsOptional() )\n    {\n        CurOut()\n            >> *new Html::Bold\n                << \"[ OPTIONAL ]\" << new Html::LineBreak;\n    }\n\n    HF_IdlDocuTextDisplay\n        aText( Env(), &CurOut(), i_rCe);\n    rDocu.Short().DisplayAt(aText);\n}\n\n\n\/\/********************      HF_IdlDocuTextDisplay       *********************\/\n\n\nHF_IdlDocuTextDisplay::HF_IdlDocuTextDisplay( Environment &                 io_rEnv,\n                                              Xml::Element *                o_pOut,\n                                              const ary::idl::CodeEntity &  i_rScopeGivingCe )\n    :   HtmlFactory_Idl(io_rEnv, o_pOut),\n        sScope(),\n        sLinkToken(),\n        bGatherLink(false),\n        pScopeGivingCe(&i_rScopeGivingCe)\n{\n}\n\nHF_IdlDocuTextDisplay::~HF_IdlDocuTextDisplay()\n{\n}\n\nvoid\nHF_IdlDocuTextDisplay::Display_TextToken( const csi::dsapi::DT_TextToken & i_rToken )\n{\n    if (bGatherLink)\n    {\n        if (sLinkToken.length() == 0)\n        {\n            sLinkToken = i_rToken.GetText();\n            return;\n        }\n        else\n        {\n            if ( pScopeGivingCe == 0 )\n            {   \/\/ only in original file\n                TheMessages().Out_TypeVsMemberMisuse(sLinkToken, Env().CurPageCe_AsText(), 0);\n            }\n            else\n            {\n                Cerr() << \"Error in documentation: Too many or too few tokens for a link in <member> or <type>.\" << Endl();\n                Cerr() << \"  Link won't be created, but all tokens shown plain.\" << Endl();\n                Cerr() << \"  \\\"\" << sLinkToken << \"\\\"\";\n                if ( pScopeGivingCe != 0 )\n                    Cerr() << \" in \" << pScopeGivingCe->LocalName();\n                Cerr() << Endl();\n            }\n            StopLinkGathering();\n        }\n    }   \/\/ endif (bGatherLink)\n\n    CurOut() << new Xml::XmlCode( i_rToken.GetText() ) << \" \";\n}\n\nvoid\nHF_IdlDocuTextDisplay::Display_MupType( const csi::dsapi::DT_MupType & i_rToken )\n{\n    if (i_rToken.IsBegin())\n    {\n        StartLinkGathering(i_rToken.Scope());\n    }\n    else\n    {\n        if (bGatherLink)\n        {\n            CreateTypeLink();\n            CurOut()\n                << \" \";\n            StopLinkGathering();\n        }\n    }\n}\n\nvoid\nHF_IdlDocuTextDisplay::Display_MupMember( const csi::dsapi::DT_MupMember & i_rToken )\n{\n    if (i_rToken.IsBegin())\n    {\n        StartLinkGathering(i_rToken.Scope());\n    }\n    else\n    {\n        if (bGatherLink)\n        {\n            CreateMemberLink();\n            CurOut()\n                << \" \";\n            StopLinkGathering();\n        }\n    }\n}\n\nvoid\nHF_IdlDocuTextDisplay::Display_MupConst( const csi::dsapi::DT_MupConst & i_rToken )\n{\n    CurOut()\n        >> *new Html::Bold\n           << i_rToken.GetText();\n    CurOut()\n        << \" \";\n}\n\nvoid\nHF_IdlDocuTextDisplay::Display_Style( const csi::dsapi::DT_Style & i_rToken )\n{\n    CurOut() << new Xml::XmlCode( i_rToken.GetText() );\n}\n\nvoid\nHF_IdlDocuTextDisplay::Display_EOL()\n{\n    CurOut() << \"\\n\";\n}\n\nvoid\nHF_IdlDocuTextDisplay::CreateTypeLink()\n{\n    if (strchr(sLinkToken,':') != 0)\n    {\n        TheMessages().Out_TypeVsMemberMisuse(sLinkToken, Env().CurPageCe_AsFile(\".idl\"), 0);\n        CurOut() << sLinkToken;\n        return;\n    }\n    HF_IdlTypeText aLink(Env(), CurOut(), true, &ScopeGivingCe());\n    aLink.Produce_LinkInDocu(sScope, sLinkToken, String::Null_());\n}\n\nvoid\nHF_IdlDocuTextDisplay::CreateMemberLink()\n{\n\n    HF_IdlTypeText aLink(Env(), CurOut(), true, &ScopeGivingCe());\n\n    const char *\n        sSplit = strchr(sLinkToken,':');\n\n    if (sSplit != 0)\n    {\n        String sCe(sLinkToken.c_str(), sSplit - sLinkToken.c_str());\n        String sMember(sSplit+2);\n\n        if (NOT sScope.empty() OR ScopeGivingCe().LocalName() != sCe )\n            aLink.Produce_LinkInDocu(sScope, sCe, sMember);\n        else\n            aLink.Produce_LocalLinkInDocu(sMember);\n    }\n    else\n    {\n        aLink.Produce_LocalLinkInDocu(sLinkToken);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the test suite of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the Technology Preview License Agreement accompanying\n** this package.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain additional\n** rights.  These rights are described in the Nokia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at qt-info@nokia.com.\n**\n**\n**\n**\n**\n**\n**\n**\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n#include <qtest.h>\n#include <QtDeclarative\/qmlengine.h>\n#include <QtDeclarative\/qmlcomponent.h>\n#include <private\/qmlgraphicsloader_p.h>\n\nclass tst_QmlGraphicsLoader : public QObject\n\n{\n    Q_OBJECT\npublic:\n    tst_QmlGraphicsLoader();\n\nprivate slots:\n    void url();\n    void invalidUrl();\n    void component();\n    void clear();\n    void urlToComponent();\n    void componentToUrl();\n    void sizeLoaderToItem();\n    void sizeItemToLoader();\n    void noResize();\n\nprivate:\n    QmlEngine engine;\n};\n\n\/*\ninline QUrl TEST_FILE(const QString &filename)\n{\n    QFileInfo fileInfo(__FILE__);\n    return QUrl::fromLocalFile(fileInfo.absoluteDir().filePath(filename));\n}\n\ninline QUrl TEST_FILE(const char *filename)\n{\n    return TEST_FILE(QLatin1String(filename));\n}\n*\/\n\ntst_QmlGraphicsLoader::tst_QmlGraphicsLoader()\n{\n}\n\nvoid tst_QmlGraphicsLoader::url()\n{\n    QmlComponent component(&engine, QByteArray(\"import Qt 4.6\\nLoader { source: \\\"Rect120x60.qml\\\" }\"), QUrl(\"file:\/\/\" SRCDIR \"\/\"));\n    QmlGraphicsLoader *loader = qobject_cast<QmlGraphicsLoader*>(component.create());\n    QVERIFY(loader != 0);\n    QVERIFY(loader->item());\n    QVERIFY(loader->source() == QUrl(\"file:\/\/\" SRCDIR \"\/Rect120x60.qml\"));\n    QCOMPARE(loader->progress(), 1.0);\n    QCOMPARE(loader->status(), QmlGraphicsLoader::Ready);\n    QCOMPARE(static_cast<QGraphicsItem*>(loader)->children().count(), 1);\n\n    delete loader;\n}\n\nvoid tst_QmlGraphicsLoader::component()\n{\n    QmlComponent component(&engine, QUrl(\"file:\/\/\" SRCDIR \"\/SetSourceComponent.qml\"));\n    QmlGraphicsItem *item = qobject_cast<QmlGraphicsItem*>(component.create());\n    QVERIFY(item);\n\n    QmlGraphicsLoader *loader = qobject_cast<QmlGraphicsLoader*>(item->QGraphicsObject::children().at(1)); \n    QVERIFY(loader);\n    QVERIFY(loader->item());\n    QCOMPARE(loader->progress(), 1.0);\n    QCOMPARE(loader->status(), QmlGraphicsLoader::Ready);\n    QCOMPARE(static_cast<QGraphicsItem*>(loader)->children().count(), 1);\n\n    delete loader;\n}\n\nvoid tst_QmlGraphicsLoader::invalidUrl()\n{\n\/\/    QTest::ignoreMessage(QtWarningMsg, \"(:-1: File error for URL file:\/\/\" SRCDIR \"\/IDontExist.qml)\");\n\n    QmlComponent component(&engine, QByteArray(\"import Qt 4.6\\nLoader { source: \\\"IDontExist.qml\\\" }\"), QUrl(\"file:\/\/\" SRCDIR \"\/\"));\n    QmlGraphicsLoader *loader = qobject_cast<QmlGraphicsLoader*>(component.create());\n    QVERIFY(loader != 0);\n    QVERIFY(loader->item() == 0);\n    QCOMPARE(loader->progress(), 1.0);\n    QCOMPARE(loader->status(), QmlGraphicsLoader::Error);\n    QCOMPARE(static_cast<QGraphicsItem*>(loader)->children().count(), 0);\n\n    delete loader;\n}\n\nvoid tst_QmlGraphicsLoader::clear()\n{\n    {\n        QmlComponent component(&engine, QByteArray(\n                    \"import Qt 4.6\\n\"\n                    \" Loader { id: loader\\n\"\n                    \"  source: 'Rect120x60.qml'\\n\"\n                    \"  Timer { interval: 200; running: true; onTriggered: loader.source = '' }\\n\"\n                    \" }\")\n                , QUrl(\"file:\/\/\" SRCDIR \"\/\"));\n        QmlGraphicsLoader *loader = qobject_cast<QmlGraphicsLoader*>(component.create());\n        QVERIFY(loader != 0);\n        QVERIFY(loader->item());\n        QCOMPARE(loader->progress(), 1.0);\n        QCOMPARE(static_cast<QGraphicsItem*>(loader)->children().count(), 1);\n\n        QTest::qWait(500);\n\n        QVERIFY(loader->item() == 0);\n        QCOMPARE(loader->progress(), 0.0);\n        QCOMPARE(loader->status(), QmlGraphicsLoader::Null);\n        QCOMPARE(static_cast<QGraphicsItem*>(loader)->children().count(), 0);\n\n        delete loader;\n    }\n    {\n        QmlComponent component(&engine, QUrl(\"file:\/\/\" SRCDIR \"\/SetSourceComponent.qml\"));\n        QmlGraphicsItem *item = qobject_cast<QmlGraphicsItem*>(component.create());\n        QVERIFY(item);\n\n        QmlGraphicsLoader *loader = qobject_cast<QmlGraphicsLoader*>(item->QGraphicsObject::children().at(1)); \n        QVERIFY(loader);\n        QVERIFY(loader->item());\n        QCOMPARE(loader->progress(), 1.0);\n        QCOMPARE(static_cast<QGraphicsItem*>(loader)->children().count(), 1);\n\n        loader->setSourceComponent(0);\n\n        QVERIFY(loader->item() == 0);\n        QCOMPARE(loader->progress(), 0.0);\n        QCOMPARE(loader->status(), QmlGraphicsLoader::Null);\n        QCOMPARE(static_cast<QGraphicsItem*>(loader)->children().count(), 0);\n\n        delete loader;\n    }\n}\n\nvoid tst_QmlGraphicsLoader::urlToComponent()\n{\n    QmlComponent component(&engine, QByteArray(\"import Qt 4.6\\n\"\n                \"Loader {\\n\"\n                \" id: loader\\n\"\n                \" Component { id: myComp; Rectangle { width: 10; height: 10 } }\\n\"\n                \" source: \\\"Rect120x60.qml\\\"\\n\"\n                \" Timer { interval: 100; running: true; onTriggered: loader.sourceComponent = myComp }\\n\"\n                \"}\" )\n            , QUrl(\"file:\/\/\" SRCDIR \"\/\"));\n    QmlGraphicsLoader *loader = qobject_cast<QmlGraphicsLoader*>(component.create());\n    QTest::qWait(500);\n    QVERIFY(loader != 0);\n    QVERIFY(loader->item());\n    QCOMPARE(loader->progress(), 1.0);\n    QCOMPARE(static_cast<QGraphicsItem*>(loader)->children().count(), 1);\n    QCOMPARE(loader->width(), 10.0);\n    QCOMPARE(loader->height(), 10.0);\n\n    delete loader;\n}\n\nvoid tst_QmlGraphicsLoader::componentToUrl()\n{\n    QmlComponent component(&engine, QUrl(\"file:\/\/\" SRCDIR \"\/SetSourceComponent.qml\"));\n    QmlGraphicsItem *item = qobject_cast<QmlGraphicsItem*>(component.create());\n    QVERIFY(item);\n\n    QmlGraphicsLoader *loader = qobject_cast<QmlGraphicsLoader*>(item->QGraphicsObject::children().at(1)); \n    QVERIFY(loader);\n    QVERIFY(loader->item());\n    QCOMPARE(loader->progress(), 1.0);\n    QCOMPARE(static_cast<QGraphicsItem*>(loader)->children().count(), 1);\n\n    loader->setSource(QUrl(\"file:\/\/\" SRCDIR \"\/Rect120x60.qml\"));\n    QVERIFY(loader->item());\n    QCOMPARE(loader->progress(), 1.0);\n    QCOMPARE(static_cast<QGraphicsItem*>(loader)->children().count(), 1);\n    QCOMPARE(loader->width(), 120.0);\n    QCOMPARE(loader->height(), 60.0);\n\n    delete loader;\n}\n\nvoid tst_QmlGraphicsLoader::sizeLoaderToItem()\n{\n    QmlComponent component(&engine, QUrl(\"file:\/\/\" SRCDIR \"\/SizeToItem.qml\"));\n    QmlGraphicsLoader *loader = qobject_cast<QmlGraphicsLoader*>(component.create());\n    QVERIFY(loader != 0);\n    QVERIFY(loader->resizeMode() == QmlGraphicsLoader::SizeLoaderToItem);\n    QCOMPARE(loader->width(), 120.0);\n    QCOMPARE(loader->height(), 60.0);\n\n    \/\/ Check resize\n    QmlGraphicsItem *rect = loader->item();\n    QVERIFY(rect);\n    rect->setWidth(150);\n    rect->setHeight(45);\n    QCOMPARE(loader->width(), 150.0);\n    QCOMPARE(loader->height(), 45.0);\n\n    \/\/ Switch mode\n    loader->setResizeMode(QmlGraphicsLoader::SizeItemToLoader);\n    loader->setWidth(180);\n    loader->setHeight(30);\n    QCOMPARE(rect->width(), 180.0);\n    QCOMPARE(rect->height(), 30.0);\n}\n\nvoid tst_QmlGraphicsLoader::sizeItemToLoader()\n{\n    QmlComponent component(&engine, QUrl(\"file:\/\/\" SRCDIR \"\/SizeToLoader.qml\"));\n    QmlGraphicsLoader *loader = qobject_cast<QmlGraphicsLoader*>(component.create());\n    QVERIFY(loader != 0);\n    QVERIFY(loader->resizeMode() == QmlGraphicsLoader::SizeItemToLoader);\n    QCOMPARE(loader->width(), 200.0);\n    QCOMPARE(loader->height(), 80.0);\n\n    QmlGraphicsItem *rect = loader->item();\n    QVERIFY(rect);\n    QCOMPARE(rect->width(), 200.0);\n    QCOMPARE(rect->height(), 80.0);\n\n    \/\/ Check resize\n    loader->setWidth(180);\n    loader->setHeight(30);\n    QCOMPARE(rect->width(), 180.0);\n    QCOMPARE(rect->height(), 30.0);\n}\n\nvoid tst_QmlGraphicsLoader::noResize()\n{\n    QmlComponent component(&engine, QUrl(\"file:\/\/\" SRCDIR \"\/NoResize.qml\"));\n    QmlGraphicsLoader *loader = qobject_cast<QmlGraphicsLoader*>(component.create());\n    QVERIFY(loader != 0);\n    QCOMPARE(loader->width(), 200.0);\n    QCOMPARE(loader->height(), 80.0);\n\n    QmlGraphicsItem *rect = loader->item();\n    QVERIFY(rect);\n    QCOMPARE(rect->width(), 120.0);\n    QCOMPARE(rect->height(), 60.0);\n}\n\nQTEST_MAIN(tst_QmlGraphicsLoader)\n\n#include \"tst_qmlgraphicsloader.moc\"\n<commit_msg>Fix error message (warning often have trailing spaces)<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the test suite of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the Technology Preview License Agreement accompanying\n** this package.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain additional\n** rights.  These rights are described in the Nokia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at qt-info@nokia.com.\n**\n**\n**\n**\n**\n**\n**\n**\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n#include <qtest.h>\n#include <QtDeclarative\/qmlengine.h>\n#include <QtDeclarative\/qmlcomponent.h>\n#include <private\/qmlgraphicsloader_p.h>\n\nclass tst_QmlGraphicsLoader : public QObject\n\n{\n    Q_OBJECT\npublic:\n    tst_QmlGraphicsLoader();\n\nprivate slots:\n    void url();\n    void invalidUrl();\n    void component();\n    void clear();\n    void urlToComponent();\n    void componentToUrl();\n    void sizeLoaderToItem();\n    void sizeItemToLoader();\n    void noResize();\n\nprivate:\n    QmlEngine engine;\n};\n\n\/*\ninline QUrl TEST_FILE(const QString &filename)\n{\n    QFileInfo fileInfo(__FILE__);\n    return QUrl::fromLocalFile(fileInfo.absoluteDir().filePath(filename));\n}\n\ninline QUrl TEST_FILE(const char *filename)\n{\n    return TEST_FILE(QLatin1String(filename));\n}\n*\/\n\ntst_QmlGraphicsLoader::tst_QmlGraphicsLoader()\n{\n}\n\nvoid tst_QmlGraphicsLoader::url()\n{\n    QmlComponent component(&engine, QByteArray(\"import Qt 4.6\\nLoader { source: \\\"Rect120x60.qml\\\" }\"), QUrl(\"file:\/\/\" SRCDIR \"\/\"));\n    QmlGraphicsLoader *loader = qobject_cast<QmlGraphicsLoader*>(component.create());\n    QVERIFY(loader != 0);\n    QVERIFY(loader->item());\n    QVERIFY(loader->source() == QUrl(\"file:\/\/\" SRCDIR \"\/Rect120x60.qml\"));\n    QCOMPARE(loader->progress(), 1.0);\n    QCOMPARE(loader->status(), QmlGraphicsLoader::Ready);\n    QCOMPARE(static_cast<QGraphicsItem*>(loader)->children().count(), 1);\n\n    delete loader;\n}\n\nvoid tst_QmlGraphicsLoader::component()\n{\n    QmlComponent component(&engine, QUrl(\"file:\/\/\" SRCDIR \"\/SetSourceComponent.qml\"));\n    QmlGraphicsItem *item = qobject_cast<QmlGraphicsItem*>(component.create());\n    QVERIFY(item);\n\n    QmlGraphicsLoader *loader = qobject_cast<QmlGraphicsLoader*>(item->QGraphicsObject::children().at(1)); \n    QVERIFY(loader);\n    QVERIFY(loader->item());\n    QCOMPARE(loader->progress(), 1.0);\n    QCOMPARE(loader->status(), QmlGraphicsLoader::Ready);\n    QCOMPARE(static_cast<QGraphicsItem*>(loader)->children().count(), 1);\n\n    delete loader;\n}\n\nvoid tst_QmlGraphicsLoader::invalidUrl()\n{\n    QTest::ignoreMessage(QtWarningMsg, \"(:-1: File error for URL file:\/\/\" SRCDIR \"\/IDontExist.qml) \");\n\n    QmlComponent component(&engine, QByteArray(\"import Qt 4.6\\nLoader { source: \\\"IDontExist.qml\\\" }\"), QUrl(\"file:\/\/\" SRCDIR \"\/\"));\n    QmlGraphicsLoader *loader = qobject_cast<QmlGraphicsLoader*>(component.create());\n    QVERIFY(loader != 0);\n    QVERIFY(loader->item() == 0);\n    QCOMPARE(loader->progress(), 1.0);\n    QCOMPARE(loader->status(), QmlGraphicsLoader::Error);\n    QCOMPARE(static_cast<QGraphicsItem*>(loader)->children().count(), 0);\n\n    delete loader;\n}\n\nvoid tst_QmlGraphicsLoader::clear()\n{\n    {\n        QmlComponent component(&engine, QByteArray(\n                    \"import Qt 4.6\\n\"\n                    \" Loader { id: loader\\n\"\n                    \"  source: 'Rect120x60.qml'\\n\"\n                    \"  Timer { interval: 200; running: true; onTriggered: loader.source = '' }\\n\"\n                    \" }\")\n                , QUrl(\"file:\/\/\" SRCDIR \"\/\"));\n        QmlGraphicsLoader *loader = qobject_cast<QmlGraphicsLoader*>(component.create());\n        QVERIFY(loader != 0);\n        QVERIFY(loader->item());\n        QCOMPARE(loader->progress(), 1.0);\n        QCOMPARE(static_cast<QGraphicsItem*>(loader)->children().count(), 1);\n\n        QTest::qWait(500);\n\n        QVERIFY(loader->item() == 0);\n        QCOMPARE(loader->progress(), 0.0);\n        QCOMPARE(loader->status(), QmlGraphicsLoader::Null);\n        QCOMPARE(static_cast<QGraphicsItem*>(loader)->children().count(), 0);\n\n        delete loader;\n    }\n    {\n        QmlComponent component(&engine, QUrl(\"file:\/\/\" SRCDIR \"\/SetSourceComponent.qml\"));\n        QmlGraphicsItem *item = qobject_cast<QmlGraphicsItem*>(component.create());\n        QVERIFY(item);\n\n        QmlGraphicsLoader *loader = qobject_cast<QmlGraphicsLoader*>(item->QGraphicsObject::children().at(1)); \n        QVERIFY(loader);\n        QVERIFY(loader->item());\n        QCOMPARE(loader->progress(), 1.0);\n        QCOMPARE(static_cast<QGraphicsItem*>(loader)->children().count(), 1);\n\n        loader->setSourceComponent(0);\n\n        QVERIFY(loader->item() == 0);\n        QCOMPARE(loader->progress(), 0.0);\n        QCOMPARE(loader->status(), QmlGraphicsLoader::Null);\n        QCOMPARE(static_cast<QGraphicsItem*>(loader)->children().count(), 0);\n\n        delete loader;\n    }\n}\n\nvoid tst_QmlGraphicsLoader::urlToComponent()\n{\n    QmlComponent component(&engine, QByteArray(\"import Qt 4.6\\n\"\n                \"Loader {\\n\"\n                \" id: loader\\n\"\n                \" Component { id: myComp; Rectangle { width: 10; height: 10 } }\\n\"\n                \" source: \\\"Rect120x60.qml\\\"\\n\"\n                \" Timer { interval: 100; running: true; onTriggered: loader.sourceComponent = myComp }\\n\"\n                \"}\" )\n            , QUrl(\"file:\/\/\" SRCDIR \"\/\"));\n    QmlGraphicsLoader *loader = qobject_cast<QmlGraphicsLoader*>(component.create());\n    QTest::qWait(500);\n    QVERIFY(loader != 0);\n    QVERIFY(loader->item());\n    QCOMPARE(loader->progress(), 1.0);\n    QCOMPARE(static_cast<QGraphicsItem*>(loader)->children().count(), 1);\n    QCOMPARE(loader->width(), 10.0);\n    QCOMPARE(loader->height(), 10.0);\n\n    delete loader;\n}\n\nvoid tst_QmlGraphicsLoader::componentToUrl()\n{\n    QmlComponent component(&engine, QUrl(\"file:\/\/\" SRCDIR \"\/SetSourceComponent.qml\"));\n    QmlGraphicsItem *item = qobject_cast<QmlGraphicsItem*>(component.create());\n    QVERIFY(item);\n\n    QmlGraphicsLoader *loader = qobject_cast<QmlGraphicsLoader*>(item->QGraphicsObject::children().at(1)); \n    QVERIFY(loader);\n    QVERIFY(loader->item());\n    QCOMPARE(loader->progress(), 1.0);\n    QCOMPARE(static_cast<QGraphicsItem*>(loader)->children().count(), 1);\n\n    loader->setSource(QUrl(\"file:\/\/\" SRCDIR \"\/Rect120x60.qml\"));\n    QVERIFY(loader->item());\n    QCOMPARE(loader->progress(), 1.0);\n    QCOMPARE(static_cast<QGraphicsItem*>(loader)->children().count(), 1);\n    QCOMPARE(loader->width(), 120.0);\n    QCOMPARE(loader->height(), 60.0);\n\n    delete loader;\n}\n\nvoid tst_QmlGraphicsLoader::sizeLoaderToItem()\n{\n    QmlComponent component(&engine, QUrl(\"file:\/\/\" SRCDIR \"\/SizeToItem.qml\"));\n    QmlGraphicsLoader *loader = qobject_cast<QmlGraphicsLoader*>(component.create());\n    QVERIFY(loader != 0);\n    QVERIFY(loader->resizeMode() == QmlGraphicsLoader::SizeLoaderToItem);\n    QCOMPARE(loader->width(), 120.0);\n    QCOMPARE(loader->height(), 60.0);\n\n    \/\/ Check resize\n    QmlGraphicsItem *rect = loader->item();\n    QVERIFY(rect);\n    rect->setWidth(150);\n    rect->setHeight(45);\n    QCOMPARE(loader->width(), 150.0);\n    QCOMPARE(loader->height(), 45.0);\n\n    \/\/ Switch mode\n    loader->setResizeMode(QmlGraphicsLoader::SizeItemToLoader);\n    loader->setWidth(180);\n    loader->setHeight(30);\n    QCOMPARE(rect->width(), 180.0);\n    QCOMPARE(rect->height(), 30.0);\n}\n\nvoid tst_QmlGraphicsLoader::sizeItemToLoader()\n{\n    QmlComponent component(&engine, QUrl(\"file:\/\/\" SRCDIR \"\/SizeToLoader.qml\"));\n    QmlGraphicsLoader *loader = qobject_cast<QmlGraphicsLoader*>(component.create());\n    QVERIFY(loader != 0);\n    QVERIFY(loader->resizeMode() == QmlGraphicsLoader::SizeItemToLoader);\n    QCOMPARE(loader->width(), 200.0);\n    QCOMPARE(loader->height(), 80.0);\n\n    QmlGraphicsItem *rect = loader->item();\n    QVERIFY(rect);\n    QCOMPARE(rect->width(), 200.0);\n    QCOMPARE(rect->height(), 80.0);\n\n    \/\/ Check resize\n    loader->setWidth(180);\n    loader->setHeight(30);\n    QCOMPARE(rect->width(), 180.0);\n    QCOMPARE(rect->height(), 30.0);\n}\n\nvoid tst_QmlGraphicsLoader::noResize()\n{\n    QmlComponent component(&engine, QUrl(\"file:\/\/\" SRCDIR \"\/NoResize.qml\"));\n    QmlGraphicsLoader *loader = qobject_cast<QmlGraphicsLoader*>(component.create());\n    QVERIFY(loader != 0);\n    QCOMPARE(loader->width(), 200.0);\n    QCOMPARE(loader->height(), 80.0);\n\n    QmlGraphicsItem *rect = loader->item();\n    QVERIFY(rect);\n    QCOMPARE(rect->width(), 120.0);\n    QCOMPARE(rect->height(), 60.0);\n}\n\nQTEST_MAIN(tst_QmlGraphicsLoader)\n\n#include \"tst_qmlgraphicsloader.moc\"\n<|endoftext|>"}
{"text":"<commit_before>\n#include <iostream>\n\n#include \"SCIP.hpp\"\n#include \"scip_exception.hpp\"\n#include <math.h>\n\n\n\/**************************************************************\n ********************     Solver        ***********************\n **************************************************************\/\n\nSCIPSolver::SCIPSolver(){\n\n  DBG(\"create a scip solver\\n%s\", \"\");\n\n  var_counter = 0;\n  _verbosity = 0;\n  has_been_added = false;\n\n  \/\/ Load up SCIP\n  SCIP_CALL_EXC( SCIPcreate(& _scip) );\n  \/\/ load default plugins linke separators, heuristics, etc.\n  SCIP_CALL_EXC( SCIPincludeDefaultPlugins(_scip) );\n  \/\/ create an empty problem\n  SCIP_CALL_EXC( SCIPcreateProb(_scip, \"Numberjack Model\",\n\t\t\t\tNULL, NULL, NULL, NULL, NULL, NULL, NULL) );\n  \/\/ set the objective sense to maximize, default is minimize\n  SCIP_CALL_EXC( SCIPsetObjsense(_scip, SCIP_OBJSENSE_MAXIMIZE) );\n}\n\nSCIPSolver::~SCIPSolver(){ DBG(\"delete wrapped solver\\n%s\", \"\"); }\n\nSCIP* SCIPSolver::get_scip() {return _scip;}\n\nvoid SCIPSolver::initialise(MipWrapperExpArray& arg){\n  DBG(\"Initialise the Solver with search vars %s\\n\", \"\");\n\n  initialise();\n}\n\nvoid SCIPSolver::initialise(){\n  DBG(\"initialise the solver%s\\n\", \"\");\n  MipWrapperSolver::initialise();\n  if(_obj != NULL) add_in_constraint(_obj, _obj_coef);\n  for(unsigned int i = 0; i < _constraints.size(); ++i)\n    add_in_constraint(_constraints[i]);\n  has_been_added = true;\n}\n\nvoid SCIPSolver::add_in_constraint(LinearConstraint *con, double coef){\n  DBG(\"Creating a SCIP representation of a constriant%s\\n\", \"\");\n  \n  double *weights = new double[con->_coefficients.size()];\n  SCIP_VAR** vars = new SCIP_VAR*[con->_variables.size()];\n  \n  for(unsigned int i = 0; i < con->_variables.size(); ++i){\n    \n    DBG(\"\\tAdding variable to SCIP\\n%s\", \"\");\n    \n    if(con->_variables[i]->_var == NULL){\n    \n      SCIP_VAR* var_ptr;\n      SCIP_VARTYPE type;\n    \n      if(con->_variables[i]->_continuous) type = SCIP_VARTYPE_CONTINUOUS;\n      else type = SCIP_VARTYPE_INTEGER;\n    \n      SCIP_CALL_EXC(SCIPcreateVar(_scip, &var_ptr,\n\t\t\t\t  \"SCIP_Var\",\n\t\t\t\t  con->_variables[i]->_lower, \/\/ LB\n\t\t\t\t  con->_variables[i]->_upper, \/\/ UB\n\t\t\t\t  coef, \/\/ ective\n\t\t\t\t  type,\n\t\t\t\t  TRUE, FALSE, NULL, NULL, NULL, NULL, NULL) );\n      SCIP_CALL_EXC( SCIPaddVar(_scip, var_ptr) );\n    \n      con->_variables[i]->_var = (void*) var_ptr;\n      vars[i] = var_ptr;\n      weights[i] = con->_coefficients[i];\n    } else {\n      vars[i] = (SCIP_VAR*) con->_variables[i]->_var;\n      weights[i] = con->_coefficients[i];\n    }\n  }\n  \n  SCIP_CONS *scip_con;\n  SCIP_CALL_EXC( SCIPcreateConsLinear(_scip, &scip_con,\"constraint\",\n\t\t\t\t\tcon->_variables.size(), \/\/ # vars\n\t\t\t\t\tvars, \/\/ variables\n\t\t\t\t\tweights, \/\/ values\n\t\t\t\t\tcon->_lhs, \/\/ LHS\n\t\t\t\t\tcon->_rhs, \/\/ RHS\n\t\t\t\t\tTRUE, TRUE, TRUE, TRUE, TRUE,\n\t\t\t\t\tFALSE, FALSE, FALSE, FALSE, FALSE) );\n  SCIP_CALL_EXC( SCIPaddCons(_scip, scip_con) ); \n}\n\nint SCIPSolver::solve(){\n  DBG(\"solve!%s\\n\", \"\");\n  \n  if(!has_been_added) initialise();\n\n  if(_verbosity > 0 && _verbosity < 3){\n    \/\/ Do nothing extra\n  } else if(_verbosity >= 3){\n    \/\/SCIP_CALL_EXC(SCIPwriteOrigProblem(_scip, \"scip_model\", NULL, TRUE));\n    SCIP_CALL_EXC(SCIPprintOrigProblem(_scip, NULL, NULL, FALSE));\n  } else {\n      \/\/ disable scip output to stdout\n    SCIP_CALL_EXC( SCIPsetMessagehdlr(_scip, NULL) );\n  }\n\n  SCIP_CALL_EXC( SCIPsolve(_scip) );\n  SCIP_STATUS status = SCIPgetStatus(_scip);\n \n  if( status == SCIP_STATUS_OPTIMAL ) return SAT;\n  else if( status == SCIP_STATUS_INFEASIBLE ) return UNSAT;\n  else return UNKNOWN;\n}\n\nvoid SCIPSolver::setTimeLimit(const int cutoff){\n  SCIPsetRealParam(_scip, \"limits\/time\", (double)cutoff);\n}\n \nvoid SCIPSolver::setVerbosity(const int degree){ _verbosity = degree; }\n\nbool SCIPSolver::is_sat(){\n  return !( SCIPgetStatus(_scip) == SCIP_STATUS_INFEASIBLE );\n}\n\nbool SCIPSolver::is_unsat(){ return ! is_sat(); }\n\nbool SCIPSolver::is_opt(){\n  return SCIPgetStatus(_scip) == SCIP_STATUS_OPTIMAL;\n}\n\nvoid SCIPSolver::printStatistics(){\n  std::cout << \"\\td Time: \" << getTime() << \"\\tNodes:\" << getNodes()\n\t    << std::endl;\n  if(_verbosity > 1){\n    SCIP_CALL_EXC(SCIPprintStatistics(_scip, NULL));\n  }\n}\n\nint SCIPSolver::getNodes(){ return _scip->stat->nnodes; }\n\ndouble SCIPSolver::getTime(){\n  return SCIPclockGetTime(_scip->stat->solvingtime);\n}\n\ndouble SCIPSolver::get_value(void *ptr){\n  return SCIPgetSolVal(_scip, SCIPgetBestSol(_scip), (SCIP_VAR*) ptr);\n}\n<commit_msg>Variables coefficients in the objective was not being passed to SCIP.<commit_after>\n#include <iostream>\n\n#include \"SCIP.hpp\"\n#include \"scip_exception.hpp\"\n#include <math.h>\n\n\n\/**************************************************************\n ********************     Solver        ***********************\n **************************************************************\/\n\nSCIPSolver::SCIPSolver(){\n\n  DBG(\"create a scip solver\\n%s\", \"\");\n\n  var_counter = 0;\n  _verbosity = 0;\n  has_been_added = false;\n\n  \/\/ Load up SCIP\n  SCIP_CALL_EXC( SCIPcreate(& _scip) );\n  \/\/ load default plugins linke separators, heuristics, etc.\n  SCIP_CALL_EXC( SCIPincludeDefaultPlugins(_scip) );\n  \/\/ create an empty problem\n  SCIP_CALL_EXC( SCIPcreateProb(_scip, \"Numberjack Model\",\n\t\t\t\tNULL, NULL, NULL, NULL, NULL, NULL, NULL) );\n  \/\/ set the objective sense to maximize, default is minimize\n  SCIP_CALL_EXC( SCIPsetObjsense(_scip, SCIP_OBJSENSE_MAXIMIZE) );\n}\n\nSCIPSolver::~SCIPSolver(){ DBG(\"delete wrapped solver\\n%s\", \"\"); }\n\nSCIP* SCIPSolver::get_scip() {return _scip;}\n\nvoid SCIPSolver::initialise(MipWrapperExpArray& arg){\n  DBG(\"Initialise the Solver with search vars %s\\n\", \"\");\n\n  initialise();\n}\n\nvoid SCIPSolver::initialise(){\n  DBG(\"initialise the solver%s\\n\", \"\");\n  MipWrapperSolver::initialise();\n  if(_obj != NULL) add_in_constraint(_obj, _obj_coef);\n  for(unsigned int i = 0; i < _constraints.size(); ++i)\n    add_in_constraint(_constraints[i]);\n  has_been_added = true;\n}\n\nvoid SCIPSolver::add_in_constraint(LinearConstraint *con, double coef){\n  DBG(\"Creating a SCIP representation of a constriant%s\\n\", \"\");\n  \n  double *weights = new double[con->_coefficients.size()];\n  SCIP_VAR** vars = new SCIP_VAR*[con->_variables.size()];\n  \n  for(unsigned int i = 0; i < con->_variables.size(); ++i){\n    \n    DBG(\"\\tAdding variable to SCIP\\n%s\", \"\");\n    \n    if(con->_variables[i]->_var == NULL){\n    \n      SCIP_VAR* var_ptr;\n      SCIP_VARTYPE type;\n    \n      if(con->_variables[i]->_continuous) type = SCIP_VARTYPE_CONTINUOUS;\n      else type = SCIP_VARTYPE_INTEGER;\n    \n      SCIP_CALL_EXC(SCIPcreateVar(_scip, &var_ptr,\n\t\t\t\t  \"SCIP_Var\",\n\t\t\t\t  con->_variables[i]->_lower, \/\/ LB\n\t\t\t\t  con->_variables[i]->_upper, \/\/ UB\n\t\t\t\t  coef * con->_coefficients[i], \/\/ ective\n\t\t\t\t  type,\n\t\t\t\t  TRUE, FALSE, NULL, NULL, NULL, NULL, NULL) );\n      SCIP_CALL_EXC( SCIPaddVar(_scip, var_ptr) );\n    \n      con->_variables[i]->_var = (void*) var_ptr;\n      vars[i] = var_ptr;\n      weights[i] = con->_coefficients[i];\n    } else {\n      vars[i] = (SCIP_VAR*) con->_variables[i]->_var;\n      weights[i] = con->_coefficients[i];\n    }\n  }\n  \n  SCIP_CONS *scip_con;\n  SCIP_CALL_EXC( SCIPcreateConsLinear(_scip, &scip_con,\"constraint\",\n\t\t\t\t\tcon->_variables.size(), \/\/ # vars\n\t\t\t\t\tvars, \/\/ variables\n\t\t\t\t\tweights, \/\/ values\n\t\t\t\t\tcon->_lhs, \/\/ LHS\n\t\t\t\t\tcon->_rhs, \/\/ RHS\n\t\t\t\t\tTRUE, TRUE, TRUE, TRUE, TRUE,\n\t\t\t\t\tFALSE, FALSE, FALSE, FALSE, FALSE) );\n  SCIP_CALL_EXC( SCIPaddCons(_scip, scip_con) ); \n}\n\nint SCIPSolver::solve(){\n  DBG(\"solve!%s\\n\", \"\");\n  \n  if(!has_been_added) initialise();\n\n  if(_verbosity > 0 && _verbosity < 3){\n    \/\/ Do nothing extra\n  } else if(_verbosity >= 3){\n    SCIP_CALL_EXC(SCIPprintOrigProblem(_scip, NULL, NULL, FALSE));\n    \/\/ SCIP_CALL_EXC(SCIPwriteOrigProblem(_scip, \"scip.lp\", \"lp\", TRUE));\n  } else {\n      \/\/ disable scip output to stdout\n    SCIP_CALL_EXC( SCIPsetMessagehdlr(_scip, NULL) );\n  }\n\n  SCIP_CALL_EXC( SCIPsolve(_scip) );\n  SCIP_STATUS status = SCIPgetStatus(_scip);\n \n  if( status == SCIP_STATUS_OPTIMAL ) return SAT;\n  else if( status == SCIP_STATUS_INFEASIBLE ) return UNSAT;\n  else return UNKNOWN;\n}\n\nvoid SCIPSolver::setTimeLimit(const int cutoff){\n  SCIPsetRealParam(_scip, \"limits\/time\", (double)cutoff);\n}\n \nvoid SCIPSolver::setVerbosity(const int degree){ _verbosity = degree; }\n\nbool SCIPSolver::is_sat(){\n  return !( SCIPgetStatus(_scip) == SCIP_STATUS_INFEASIBLE );\n}\n\nbool SCIPSolver::is_unsat(){ return ! is_sat(); }\n\nbool SCIPSolver::is_opt(){\n  return SCIPgetStatus(_scip) == SCIP_STATUS_OPTIMAL;\n}\n\nvoid SCIPSolver::printStatistics(){\n  std::cout << \"\\td Time: \" << getTime() << \"\\tNodes:\" << getNodes()\n\t    << std::endl;\n  if(_verbosity > 1){\n    SCIP_CALL_EXC(SCIPprintStatistics(_scip, NULL));\n  }\n}\n\nint SCIPSolver::getNodes(){ return _scip->stat->nnodes; }\n\ndouble SCIPSolver::getTime(){\n  return SCIPclockGetTime(_scip->stat->solvingtime);\n}\n\ndouble SCIPSolver::get_value(void *ptr){\n  return SCIPgetSolVal(_scip, SCIPgetBestSol(_scip), (SCIP_VAR*) ptr);\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\/time.h\"\n\n#include <CoreFoundation\/CFDate.h>\n#include <CoreFoundation\/CFTimeZone.h>\n#include <mach\/mach_time.h>\n#include <sys\/time.h>\n#include <time.h>\n\n#include \"base\/basictypes.h\"\n#include \"base\/logging.h\"\n#include \"base\/mac\/scoped_cftyperef.h\"\n\nnamespace base {\n\n\/\/ The Time routines in this file use Mach and CoreFoundation APIs, since the\n\/\/ POSIX definition of time_t in Mac OS X wraps around after 2038--and\n\/\/ there are already cookie expiration dates, etc., past that time out in\n\/\/ the field.  Using CFDate prevents that problem, and using mach_absolute_time\n\/\/ for TimeTicks gives us nice high-resolution interval timing.\n\n\/\/ Time -----------------------------------------------------------------------\n\n\/\/ Core Foundation uses a double second count since 2001-01-01 00:00:00 UTC.\n\/\/ The UNIX epoch is 1970-01-01 00:00:00 UTC.\n\/\/ Windows uses a Gregorian epoch of 1601.  We need to match this internally\n\/\/ so that our time representations match across all platforms.  See bug 14734.\n\/\/   irb(main):010:0> Time.at(0).getutc()\n\/\/   => Thu Jan 01 00:00:00 UTC 1970\n\/\/   irb(main):011:0> Time.at(-11644473600).getutc()\n\/\/   => Mon Jan 01 00:00:00 UTC 1601\nstatic const int64 kWindowsEpochDeltaSeconds = GG_INT64_C(11644473600);\nstatic const int64 kWindowsEpochDeltaMilliseconds =\n    kWindowsEpochDeltaSeconds * Time::kMillisecondsPerSecond;\n\n\/\/ static\nconst int64 Time::kWindowsEpochDeltaMicroseconds =\n    kWindowsEpochDeltaSeconds * Time::kMicrosecondsPerSecond;\n\n\/\/ Some functions in time.cc use time_t directly, so we provide an offset\n\/\/ to convert from time_t (Unix epoch) and internal (Windows epoch).\n\/\/ static\nconst int64 Time::kTimeTToMicrosecondsOffset = kWindowsEpochDeltaMicroseconds;\n\n\/\/ static\nTime Time::Now() {\n  CFAbsoluteTime now =\n      CFAbsoluteTimeGetCurrent() + kCFAbsoluteTimeIntervalSince1970;\n  return Time(static_cast<int64>(now * kMicrosecondsPerSecond) +\n      kWindowsEpochDeltaMicroseconds);\n}\n\n\/\/ static\nTime Time::NowFromSystemTime() {\n  \/\/ Just use Now() because Now() returns the system time.\n  return Now();\n}\n\n\/\/ static\nTime Time::FromExploded(bool is_local, const Exploded& exploded) {\n  CFGregorianDate date;\n  date.second = exploded.second +\n      exploded.millisecond \/ static_cast<double>(kMillisecondsPerSecond);\n  date.minute = exploded.minute;\n  date.hour = exploded.hour;\n  date.day = exploded.day_of_month;\n  date.month = exploded.month;\n  date.year = exploded.year;\n\n  base::mac::ScopedCFTypeRef<CFTimeZoneRef>\n      time_zone(is_local ? CFTimeZoneCopySystem() : NULL);\n  CFAbsoluteTime seconds = CFGregorianDateGetAbsoluteTime(date, time_zone) +\n      kCFAbsoluteTimeIntervalSince1970;\n  return Time(static_cast<int64>(seconds * kMicrosecondsPerSecond) +\n      kWindowsEpochDeltaMicroseconds);\n}\n\nvoid Time::Explode(bool is_local, Exploded* exploded) const {\n  CFAbsoluteTime seconds =\n      (static_cast<double>((us_ - kWindowsEpochDeltaMicroseconds) \/\n      kMicrosecondsPerSecond) - kCFAbsoluteTimeIntervalSince1970);\n\n  base::mac::ScopedCFTypeRef<CFTimeZoneRef>\n      time_zone(is_local ? CFTimeZoneCopySystem() : NULL);\n  CFGregorianDate date = CFAbsoluteTimeGetGregorianDate(seconds, time_zone);\n\n  exploded->year = date.year;\n  exploded->month = date.month;\n  exploded->day_of_month = date.day;\n  exploded->hour = date.hour;\n  exploded->minute = date.minute;\n  exploded->second = date.second;\n  exploded->millisecond  =\n      static_cast<int>(date.second * kMillisecondsPerSecond) %\n      kMillisecondsPerSecond;\n}\n\n\/\/ TimeTicks ------------------------------------------------------------------\n\n\/\/ static\nTimeTicks TimeTicks::Now() {\n  uint64_t absolute_micro;\n\n  static mach_timebase_info_data_t timebase_info;\n  if (timebase_info.denom == 0) {\n    \/\/ Zero-initialization of statics guarantees that denom will be 0 before\n    \/\/ calling mach_timebase_info.  mach_timebase_info will never set denom to\n    \/\/ 0 as that would be invalid, so the zero-check can be used to determine\n    \/\/ whether mach_timebase_info has already been called.  This is\n    \/\/ recommended by Apple's QA1398.\n    kern_return_t kr = mach_timebase_info(&timebase_info);\n    DCHECK(kr == KERN_SUCCESS);\n  }\n\n  \/\/ mach_absolute_time is it when it comes to ticks on the Mac.  Other calls\n  \/\/ with less precision (such as TickCount) just call through to\n  \/\/ mach_absolute_time.\n\n  \/\/ timebase_info converts absolute time tick units into nanoseconds.  Convert\n  \/\/ to microseconds up front to stave off overflows.\n  absolute_micro = mach_absolute_time() \/ Time::kNanosecondsPerMicrosecond *\n                   timebase_info.numer \/ timebase_info.denom;\n\n  \/\/ Don't bother with the rollover handling that the Windows version does.\n  \/\/ With numer and denom = 1 (the expected case), the 64-bit absolute time\n  \/\/ reported in nanoseconds is enough to last nearly 585 years.\n\n  return TimeTicks(absolute_micro);\n}\n\n\/\/ static\nTimeTicks TimeTicks::HighResNow() {\n  return Now();\n}\n\n}  \/\/ namespace base\n<commit_msg>Put the parentheses back where they belong in time_mac.cc. This will allow Aaron's new test in http:\/\/codereview.chromium.org\/4471001 to pass.<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\/time.h\"\n\n#include <CoreFoundation\/CFDate.h>\n#include <CoreFoundation\/CFTimeZone.h>\n#include <mach\/mach_time.h>\n#include <sys\/time.h>\n#include <time.h>\n\n#include \"base\/basictypes.h\"\n#include \"base\/logging.h\"\n#include \"base\/mac\/scoped_cftyperef.h\"\n\nnamespace base {\n\n\/\/ The Time routines in this file use Mach and CoreFoundation APIs, since the\n\/\/ POSIX definition of time_t in Mac OS X wraps around after 2038--and\n\/\/ there are already cookie expiration dates, etc., past that time out in\n\/\/ the field.  Using CFDate prevents that problem, and using mach_absolute_time\n\/\/ for TimeTicks gives us nice high-resolution interval timing.\n\n\/\/ Time -----------------------------------------------------------------------\n\n\/\/ Core Foundation uses a double second count since 2001-01-01 00:00:00 UTC.\n\/\/ The UNIX epoch is 1970-01-01 00:00:00 UTC.\n\/\/ Windows uses a Gregorian epoch of 1601.  We need to match this internally\n\/\/ so that our time representations match across all platforms.  See bug 14734.\n\/\/   irb(main):010:0> Time.at(0).getutc()\n\/\/   => Thu Jan 01 00:00:00 UTC 1970\n\/\/   irb(main):011:0> Time.at(-11644473600).getutc()\n\/\/   => Mon Jan 01 00:00:00 UTC 1601\nstatic const int64 kWindowsEpochDeltaSeconds = GG_INT64_C(11644473600);\nstatic const int64 kWindowsEpochDeltaMilliseconds =\n    kWindowsEpochDeltaSeconds * Time::kMillisecondsPerSecond;\n\n\/\/ static\nconst int64 Time::kWindowsEpochDeltaMicroseconds =\n    kWindowsEpochDeltaSeconds * Time::kMicrosecondsPerSecond;\n\n\/\/ Some functions in time.cc use time_t directly, so we provide an offset\n\/\/ to convert from time_t (Unix epoch) and internal (Windows epoch).\n\/\/ static\nconst int64 Time::kTimeTToMicrosecondsOffset = kWindowsEpochDeltaMicroseconds;\n\n\/\/ static\nTime Time::Now() {\n  CFAbsoluteTime now =\n      CFAbsoluteTimeGetCurrent() + kCFAbsoluteTimeIntervalSince1970;\n  return Time(static_cast<int64>(now * kMicrosecondsPerSecond) +\n      kWindowsEpochDeltaMicroseconds);\n}\n\n\/\/ static\nTime Time::NowFromSystemTime() {\n  \/\/ Just use Now() because Now() returns the system time.\n  return Now();\n}\n\n\/\/ static\nTime Time::FromExploded(bool is_local, const Exploded& exploded) {\n  CFGregorianDate date;\n  date.second = exploded.second +\n      exploded.millisecond \/ static_cast<double>(kMillisecondsPerSecond);\n  date.minute = exploded.minute;\n  date.hour = exploded.hour;\n  date.day = exploded.day_of_month;\n  date.month = exploded.month;\n  date.year = exploded.year;\n\n  base::mac::ScopedCFTypeRef<CFTimeZoneRef>\n      time_zone(is_local ? CFTimeZoneCopySystem() : NULL);\n  CFAbsoluteTime seconds = CFGregorianDateGetAbsoluteTime(date, time_zone) +\n      kCFAbsoluteTimeIntervalSince1970;\n  return Time(static_cast<int64>(seconds * kMicrosecondsPerSecond) +\n      kWindowsEpochDeltaMicroseconds);\n}\n\nvoid Time::Explode(bool is_local, Exploded* exploded) const {\n  CFAbsoluteTime seconds =\n      ((static_cast<double>(us_) - kWindowsEpochDeltaMicroseconds) \/\n      kMicrosecondsPerSecond) - kCFAbsoluteTimeIntervalSince1970;\n\n  base::mac::ScopedCFTypeRef<CFTimeZoneRef>\n      time_zone(is_local ? CFTimeZoneCopySystem() : NULL);\n  CFGregorianDate date = CFAbsoluteTimeGetGregorianDate(seconds, time_zone);\n\n  exploded->year = date.year;\n  exploded->month = date.month;\n  exploded->day_of_month = date.day;\n  exploded->hour = date.hour;\n  exploded->minute = date.minute;\n  exploded->second = date.second;\n  exploded->millisecond  =\n      static_cast<int>(date.second * kMillisecondsPerSecond) %\n      kMillisecondsPerSecond;\n}\n\n\/\/ TimeTicks ------------------------------------------------------------------\n\n\/\/ static\nTimeTicks TimeTicks::Now() {\n  uint64_t absolute_micro;\n\n  static mach_timebase_info_data_t timebase_info;\n  if (timebase_info.denom == 0) {\n    \/\/ Zero-initialization of statics guarantees that denom will be 0 before\n    \/\/ calling mach_timebase_info.  mach_timebase_info will never set denom to\n    \/\/ 0 as that would be invalid, so the zero-check can be used to determine\n    \/\/ whether mach_timebase_info has already been called.  This is\n    \/\/ recommended by Apple's QA1398.\n    kern_return_t kr = mach_timebase_info(&timebase_info);\n    DCHECK(kr == KERN_SUCCESS);\n  }\n\n  \/\/ mach_absolute_time is it when it comes to ticks on the Mac.  Other calls\n  \/\/ with less precision (such as TickCount) just call through to\n  \/\/ mach_absolute_time.\n\n  \/\/ timebase_info converts absolute time tick units into nanoseconds.  Convert\n  \/\/ to microseconds up front to stave off overflows.\n  absolute_micro = mach_absolute_time() \/ Time::kNanosecondsPerMicrosecond *\n                   timebase_info.numer \/ timebase_info.denom;\n\n  \/\/ Don't bother with the rollover handling that the Windows version does.\n  \/\/ With numer and denom = 1 (the expected case), the 64-bit absolute time\n  \/\/ reported in nanoseconds is enough to last nearly 585 years.\n\n  return TimeTicks(absolute_micro);\n}\n\n\/\/ static\nTimeTicks TimeTicks::HighResNow() {\n  return Now();\n}\n\n}  \/\/ namespace base\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    This file is part of KAddressBook.\n    Copyright (C) 2003 Helge Deller <deller@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    version 2 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    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 *  - ldifvcardthumbnail -\n *\n *  kioslave which generates tumbnails for vCard and LDIF files.\n *  The thumbnails are used e.g. by Konqueror or in the file selection\n *  dialog.\n *\n *\/\n\n#include <QDateTime>\n#include <QFile>\n#include <QPixmap>\n#include <QImage>\n#include <QPainter>\n\n#include <kdebug.h>\n#include <kglobal.h>\n#include <kglobalsettings.h>\n#include <klocale.h>\n#include <kabc\/ldifconverter.h>\n#include <kabc\/vcardconverter.h>\n#include <kpixmapsplitter.h>\n#include <kstandarddirs.h>\n\n#include \"ldifvcardcreator.h\"\n\nextern \"C\"\n{\n  ThumbCreator *new_creator()\n  {\n    KGlobal::locale()->insertCatalog( \"kaddressbook\" );\n    return new VCard_LDIFCreator;\n  }\n}\n\nVCard_LDIFCreator::VCard_LDIFCreator()\n  : mFont( 0 )\n{\n}\n\nVCard_LDIFCreator::~VCard_LDIFCreator()\n{\n  delete mFont;\n}\n\n\nbool VCard_LDIFCreator::readContents( const QString &path )\n{\n  \/\/ read file contents\n  QFile file( path );\n  if ( !file.open( QIODevice::ReadOnly ) )\n    return false;\n\n  QString info;\n  text.truncate(0);\n\n  \/\/ read the file\n  QByteArray contents = file.readAll();\n  file.close();\n\n  \/\/ convert the file contents to a KABC::Addressee address\n  KABC::Addressee::List addrList;\n  KABC::Addressee addr;\n  KABC::VCardConverter converter;\n\n  addrList = converter.parseVCards( contents);\n  if ( addrList.count() == 0 ) {\n    KABC::AddresseeList l; \/\/ FIXME porting\n    if ( !KABC::LDIFConverter::LDIFToAddressee( contents, l ) )\n\treturn false;\n    \/\/ FIXME porting\n    KABC::AddresseeList::ConstIterator it( l.constBegin() );\n    for ( ; it != l.constEnd(); ++ it ) {\n        addrList.append( *it );\n    }\n  }\n  if ( addrList.count()>1 ) {\n    \/\/ create an overview (list of all names)\n    name = i18np(\"One contact found:\", \"%1 contacts found:\", addrList.count());\n    int no, linenr;\n    for (linenr=no=0; linenr<30 && no<addrList.count(); ++no) {\n       addr = addrList[no];\n       info = addr.formattedName().simplified();\n       if (info.isEmpty())\n          info = addr.givenName() + ' ' + addr.familyName();\n       info = info.simplified();\n       if (info.isEmpty())\n         continue;\n       text.append(info);\n       text.append(\"\\n\");\n       ++linenr;\n    }\n    return true;\n  }\n\n  \/\/ create card for _one_ contact\n  addr = addrList[ 0 ];\n\n  \/\/ prepare the text\n  name = addr.formattedName().simplified();\n  if ( name.isEmpty() )\n    name = addr.givenName() + ' ' + addr.familyName();\n  name = name.simplified();\n\n\n  KABC::PhoneNumber::List pnList = addr.phoneNumbers();\n  QStringList phoneNumbers;\n  for (int no=0; no<pnList.count(); ++no) {\n    QString pn = pnList[no].number().simplified();\n    if (!pn.isEmpty() && !phoneNumbers.contains(pn))\n      phoneNumbers.append(pn);\n  }\n  if ( !phoneNumbers.isEmpty() )\n      text += phoneNumbers.join(\"\\n\") + '\\n';\n\n  info = addr.organization().simplified();\n  if ( !info.isEmpty() )\n    text += info + '\\n';\n\n  \/\/ get an address\n  KABC::Address address = addr.address(KABC::Address::Work);\n  if (address.isEmpty())\n    address = addr.address(KABC::Address::Home);\n  if (address.isEmpty())\n    address = addr.address(KABC::Address::Pref);\n  info = address.formattedAddress();\n  if ( !info.isEmpty() )\n    text += info + '\\n';\n\n  return true;\n}\n\nQRect glyphCoords(int index, int fontWidth)\n{\n    int itemsPerRow = fontWidth \/ 4;\n    return QRect( (index % itemsPerRow) * 4, (index \/ itemsPerRow) * 7, 4, 7 );\n}\n\nbool VCard_LDIFCreator::createImageSmall()\n{\n  text = name + '\\n' + text;\n\n  if ( !mFont ) {\n    QString pixmap = KStandardDirs::locate( \"data\", \"konqueror\/pics\/thumbnailfont_7x4.png\" );\n    if ( pixmap.isEmpty() ) {\n      kWarning() <<\"VCard_LDIFCreator: Font image \\\"thumbnailfont_7x4.png\\\" not found!\";\n      return false;\n    }\n    mFont = new QPixmap( pixmap );\n  }\n\n  QSize chSize(4, 7); \/\/ the size of one char\n  int xOffset = chSize.width();\n  int yOffset = chSize.height();\n\n  \/\/ calculate a better border so that the text is centered\n  int canvasWidth = pixmapSize.width() - 2 * xborder;\n  int canvasHeight = pixmapSize.height() -  2 * yborder;\n  int numCharsPerLine = (int) (canvasWidth \/ chSize.width());\n  int numLines = (int) (canvasHeight \/ chSize.height());\n\n  \/\/ render the information\n  QRect rect;\n  int rest = mPixmap.width() - (numCharsPerLine * chSize.width());\n  xborder = qMax( xborder, rest \/ 2 ); \/\/ center horizontally\n  rest = mPixmap.height() - (numLines * chSize.height());\n  yborder = qMax( yborder, rest \/ 2 ); \/\/ center vertically\n  \/\/ end centering\n\n  int x = xborder, y = yborder; \/\/ where to paint the characters\n  int posNewLine  = mPixmap.width() - (chSize.width() + xborder);\n  int posLastLine = mPixmap.height() - (chSize.height() + yborder);\n  bool newLine = false;\n  Q_ASSERT( posNewLine > 0 );\n  \/\/const QPixmap *fontPixmap = &(mSplitter->pixmap());\n\n  for ( int i = 0; i < text.length(); i++ ) {\n    if ( x > posNewLine || newLine ) {  \/\/ start a new line?\n      x = xborder;\n      y += yOffset;\n\n      if ( y > posLastLine ) \/\/ more text than space\n        break;\n\n      \/\/ after starting a new line, we also jump to the next\n      \/\/ physical newline in the file if we don't come from one\n      if ( !newLine ) {\n        int pos = text.indexOf( '\\n', i );\n        if ( pos > (int) i )\n          i = pos +1;\n      }\n\n      newLine = false;\n    }\n\n    \/\/ check for newlines in the text (unix,dos)\n    QChar ch = text.at( i );\n    if ( ch == '\\n' ) {\n      newLine = true;\n      continue;\n    } else if ( ch == '\\r' && text.at(i+1) == '\\n' ) {\n      newLine = true;\n      i++; \/\/ skip the next character (\\n) as well\n      continue;\n    }\n\n    rect = glyphCoords( (unsigned char)ch.toLatin1(), mFont->width() );\n    \/* FIXME porting\n    if ( !rect.isEmpty() )\n      bitBlt( &mPixmap, QPoint(x,y), fontPixmap, rect, Qt::CopyROP );\n     *\/\n\n    x += xOffset; \/\/ next character\n  }\n\n  return true;\n}\n\nbool VCard_LDIFCreator::createImageBig()\n{\n  QFont normalFont( KGlobalSettings::generalFont() );\n  QFont titleFont( normalFont );\n  titleFont.setBold(true);\n  \/\/ titleFont.setUnderline(true);\n  titleFont.setItalic(true);\n\n  QPainter painter(&mPixmap);\n  painter.setFont(titleFont);\n  QFontMetrics fm(painter.fontMetrics());\n\n  \/\/ draw contact name\n  painter.setClipRect(2, 2, pixmapSize.width()-4, pixmapSize.height()-4);\n  QPoint p(5, fm.height()+2);\n  painter.drawText(p, name);\n  p.setY( 3*p.y()\/2 );\n\n  \/\/ draw contact information\n  painter.setFont(normalFont);\n  fm = painter.fontMetrics();\n\n  const QStringList list( text.split('\\n', QString::SkipEmptyParts) );\n  for ( QStringList::ConstIterator it = list.begin();\n             p.y()<=pixmapSize.height() && it != list.end(); ++it ) {\n     p.setY( p.y() + fm.height() );\n     painter.drawText(p, *it);\n  }\n\n  return true;\n}\n\nbool VCard_LDIFCreator::create(const QString &path, int width, int height, QImage &img)\n{\n  if ( !readContents(path) )\n    return false;\n\n  \/\/ resize the image if necessary\n  pixmapSize = QSize( width, height );\n  if (height * 3 > width * 4)\n    pixmapSize.setHeight( width * 4 \/ 3 );\n  else\n    pixmapSize.setWidth( height * 3 \/ 4 );\n\n  if ( pixmapSize != mPixmap.size() )\n    mPixmap = QPixmap( pixmapSize );\n\n  mPixmap.fill( QColor( 245, 245, 245 ) ); \/\/ light-grey background\n\n  \/\/ one pixel for the rectangle, the rest. whitespace\n  xborder = 1 + pixmapSize.width()\/16;  \/\/ minimum x-border\n  yborder = 1 + pixmapSize.height()\/16; \/\/ minimum y-border\n\n  bool ok;\n  if ( width >= 150 \/*pixel*\/ )\n    ok = createImageBig();\n  else\n    ok = createImageSmall();\n  if (!ok)\n    return false;\n\n  img = mPixmap.toImage();\n  return true;\n}\n\nThumbCreator::Flags VCard_LDIFCreator::flags() const\n{\n  return (Flags)(DrawFrame | BlendIcon);\n}\n<commit_msg>remove unused header<commit_after>\/*\n    This file is part of KAddressBook.\n    Copyright (C) 2003 Helge Deller <deller@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    version 2 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    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 *  - ldifvcardthumbnail -\n *\n *  kioslave which generates tumbnails for vCard and LDIF files.\n *  The thumbnails are used e.g. by Konqueror or in the file selection\n *  dialog.\n *\n *\/\n\n#include <QDateTime>\n#include <QFile>\n#include <QPixmap>\n#include <QImage>\n#include <QPainter>\n\n#include <kdebug.h>\n#include <kglobal.h>\n#include <kglobalsettings.h>\n#include <klocale.h>\n#include <kabc\/ldifconverter.h>\n#include <kabc\/vcardconverter.h>\n#include <kstandarddirs.h>\n\n#include \"ldifvcardcreator.h\"\n\nextern \"C\"\n{\n  ThumbCreator *new_creator()\n  {\n    KGlobal::locale()->insertCatalog( \"kaddressbook\" );\n    return new VCard_LDIFCreator;\n  }\n}\n\nVCard_LDIFCreator::VCard_LDIFCreator()\n  : mFont( 0 )\n{\n}\n\nVCard_LDIFCreator::~VCard_LDIFCreator()\n{\n  delete mFont;\n}\n\n\nbool VCard_LDIFCreator::readContents( const QString &path )\n{\n  \/\/ read file contents\n  QFile file( path );\n  if ( !file.open( QIODevice::ReadOnly ) )\n    return false;\n\n  QString info;\n  text.truncate(0);\n\n  \/\/ read the file\n  QByteArray contents = file.readAll();\n  file.close();\n\n  \/\/ convert the file contents to a KABC::Addressee address\n  KABC::Addressee::List addrList;\n  KABC::Addressee addr;\n  KABC::VCardConverter converter;\n\n  addrList = converter.parseVCards( contents);\n  if ( addrList.count() == 0 ) {\n    KABC::AddresseeList l; \/\/ FIXME porting\n    if ( !KABC::LDIFConverter::LDIFToAddressee( contents, l ) )\n\treturn false;\n    \/\/ FIXME porting\n    KABC::AddresseeList::ConstIterator it( l.constBegin() );\n    for ( ; it != l.constEnd(); ++ it ) {\n        addrList.append( *it );\n    }\n  }\n  if ( addrList.count()>1 ) {\n    \/\/ create an overview (list of all names)\n    name = i18np(\"One contact found:\", \"%1 contacts found:\", addrList.count());\n    int no, linenr;\n    for (linenr=no=0; linenr<30 && no<addrList.count(); ++no) {\n       addr = addrList[no];\n       info = addr.formattedName().simplified();\n       if (info.isEmpty())\n          info = addr.givenName() + ' ' + addr.familyName();\n       info = info.simplified();\n       if (info.isEmpty())\n         continue;\n       text.append(info);\n       text.append(\"\\n\");\n       ++linenr;\n    }\n    return true;\n  }\n\n  \/\/ create card for _one_ contact\n  addr = addrList[ 0 ];\n\n  \/\/ prepare the text\n  name = addr.formattedName().simplified();\n  if ( name.isEmpty() )\n    name = addr.givenName() + ' ' + addr.familyName();\n  name = name.simplified();\n\n\n  KABC::PhoneNumber::List pnList = addr.phoneNumbers();\n  QStringList phoneNumbers;\n  for (int no=0; no<pnList.count(); ++no) {\n    QString pn = pnList[no].number().simplified();\n    if (!pn.isEmpty() && !phoneNumbers.contains(pn))\n      phoneNumbers.append(pn);\n  }\n  if ( !phoneNumbers.isEmpty() )\n      text += phoneNumbers.join(\"\\n\") + '\\n';\n\n  info = addr.organization().simplified();\n  if ( !info.isEmpty() )\n    text += info + '\\n';\n\n  \/\/ get an address\n  KABC::Address address = addr.address(KABC::Address::Work);\n  if (address.isEmpty())\n    address = addr.address(KABC::Address::Home);\n  if (address.isEmpty())\n    address = addr.address(KABC::Address::Pref);\n  info = address.formattedAddress();\n  if ( !info.isEmpty() )\n    text += info + '\\n';\n\n  return true;\n}\n\nQRect glyphCoords(int index, int fontWidth)\n{\n    int itemsPerRow = fontWidth \/ 4;\n    return QRect( (index % itemsPerRow) * 4, (index \/ itemsPerRow) * 7, 4, 7 );\n}\n\nbool VCard_LDIFCreator::createImageSmall()\n{\n  text = name + '\\n' + text;\n\n  if ( !mFont ) {\n    QString pixmap = KStandardDirs::locate( \"data\", \"konqueror\/pics\/thumbnailfont_7x4.png\" );\n    if ( pixmap.isEmpty() ) {\n      kWarning() <<\"VCard_LDIFCreator: Font image \\\"thumbnailfont_7x4.png\\\" not found!\";\n      return false;\n    }\n    mFont = new QPixmap( pixmap );\n  }\n\n  QSize chSize(4, 7); \/\/ the size of one char\n  int xOffset = chSize.width();\n  int yOffset = chSize.height();\n\n  \/\/ calculate a better border so that the text is centered\n  int canvasWidth = pixmapSize.width() - 2 * xborder;\n  int canvasHeight = pixmapSize.height() -  2 * yborder;\n  int numCharsPerLine = (int) (canvasWidth \/ chSize.width());\n  int numLines = (int) (canvasHeight \/ chSize.height());\n\n  \/\/ render the information\n  QRect rect;\n  int rest = mPixmap.width() - (numCharsPerLine * chSize.width());\n  xborder = qMax( xborder, rest \/ 2 ); \/\/ center horizontally\n  rest = mPixmap.height() - (numLines * chSize.height());\n  yborder = qMax( yborder, rest \/ 2 ); \/\/ center vertically\n  \/\/ end centering\n\n  int x = xborder, y = yborder; \/\/ where to paint the characters\n  int posNewLine  = mPixmap.width() - (chSize.width() + xborder);\n  int posLastLine = mPixmap.height() - (chSize.height() + yborder);\n  bool newLine = false;\n  Q_ASSERT( posNewLine > 0 );\n  \/\/const QPixmap *fontPixmap = &(mSplitter->pixmap());\n\n  for ( int i = 0; i < text.length(); i++ ) {\n    if ( x > posNewLine || newLine ) {  \/\/ start a new line?\n      x = xborder;\n      y += yOffset;\n\n      if ( y > posLastLine ) \/\/ more text than space\n        break;\n\n      \/\/ after starting a new line, we also jump to the next\n      \/\/ physical newline in the file if we don't come from one\n      if ( !newLine ) {\n        int pos = text.indexOf( '\\n', i );\n        if ( pos > (int) i )\n          i = pos +1;\n      }\n\n      newLine = false;\n    }\n\n    \/\/ check for newlines in the text (unix,dos)\n    QChar ch = text.at( i );\n    if ( ch == '\\n' ) {\n      newLine = true;\n      continue;\n    } else if ( ch == '\\r' && text.at(i+1) == '\\n' ) {\n      newLine = true;\n      i++; \/\/ skip the next character (\\n) as well\n      continue;\n    }\n\n    rect = glyphCoords( (unsigned char)ch.toLatin1(), mFont->width() );\n    \/* FIXME porting\n    if ( !rect.isEmpty() )\n      bitBlt( &mPixmap, QPoint(x,y), fontPixmap, rect, Qt::CopyROP );\n     *\/\n\n    x += xOffset; \/\/ next character\n  }\n\n  return true;\n}\n\nbool VCard_LDIFCreator::createImageBig()\n{\n  QFont normalFont( KGlobalSettings::generalFont() );\n  QFont titleFont( normalFont );\n  titleFont.setBold(true);\n  \/\/ titleFont.setUnderline(true);\n  titleFont.setItalic(true);\n\n  QPainter painter(&mPixmap);\n  painter.setFont(titleFont);\n  QFontMetrics fm(painter.fontMetrics());\n\n  \/\/ draw contact name\n  painter.setClipRect(2, 2, pixmapSize.width()-4, pixmapSize.height()-4);\n  QPoint p(5, fm.height()+2);\n  painter.drawText(p, name);\n  p.setY( 3*p.y()\/2 );\n\n  \/\/ draw contact information\n  painter.setFont(normalFont);\n  fm = painter.fontMetrics();\n\n  const QStringList list( text.split('\\n', QString::SkipEmptyParts) );\n  for ( QStringList::ConstIterator it = list.begin();\n             p.y()<=pixmapSize.height() && it != list.end(); ++it ) {\n     p.setY( p.y() + fm.height() );\n     painter.drawText(p, *it);\n  }\n\n  return true;\n}\n\nbool VCard_LDIFCreator::create(const QString &path, int width, int height, QImage &img)\n{\n  if ( !readContents(path) )\n    return false;\n\n  \/\/ resize the image if necessary\n  pixmapSize = QSize( width, height );\n  if (height * 3 > width * 4)\n    pixmapSize.setHeight( width * 4 \/ 3 );\n  else\n    pixmapSize.setWidth( height * 3 \/ 4 );\n\n  if ( pixmapSize != mPixmap.size() )\n    mPixmap = QPixmap( pixmapSize );\n\n  mPixmap.fill( QColor( 245, 245, 245 ) ); \/\/ light-grey background\n\n  \/\/ one pixel for the rectangle, the rest. whitespace\n  xborder = 1 + pixmapSize.width()\/16;  \/\/ minimum x-border\n  yborder = 1 + pixmapSize.height()\/16; \/\/ minimum y-border\n\n  bool ok;\n  if ( width >= 150 \/*pixel*\/ )\n    ok = createImageBig();\n  else\n    ok = createImageSmall();\n  if (!ok)\n    return false;\n\n  img = mPixmap.toImage();\n  return true;\n}\n\nThumbCreator::Flags VCard_LDIFCreator::flags() const\n{\n  return (Flags)(DrawFrame | BlendIcon);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"cpp_uriparser.h\"\n#include <iostream>\n#include <gtest\/gtest.h>\n\nusing namespace uri_parser;\n\nTEST(cppUriParser, traversing_through_url)\n{\n\n  const char* url = \"http:\/\/www.example.com\/name%20with%20spaces\/lalala\/TheLastOne\";\n\n  auto entry = uri_parser::UriParseUrl(url);\n  auto pathHead = entry.PathHead();\n\n  auto id = 0;\n  for (auto pathFragment = std::begin(pathHead); pathFragment != std::end(pathHead); ++pathFragment, ++id)\n  {\n    switch (id)\n    {\n    case 0:\n      EXPECT_STREQ(pathFragment->c_str(), \"name%20with%20spaces\");\n      break;\n    case 1:\n      EXPECT_STREQ(pathFragment->c_str(), \"lalala\");\n      break;\n    case 2:\n      EXPECT_STREQ(pathFragment->c_str(), \"TheLastOne\");\n      break;\n    default:\n      ADD_FAILURE();\n      break;\n    }\n  }\n}\n\nTEST(cppUriParser, unescape_test)\n{\n  const char* url = \"http:\/\/www.example.com\/name%20with%20spaces\/lalala%01%FFg%0D%0A\";\n  auto entry = uri_parser::UriParseUrl(url);\n\n  auto unescapedString = entry.GetUnescapedUrlString();\n  EXPECT_FALSE(unescapedString.empty());\n  EXPECT_STREQ(\"http:\/\/www.example.com\/name with spaces\/lalala\\x01\\xffg\\r\\n\", unescapedString.c_str());\n}\n\nTEST(cppUriParser, unescaping_fragment)\n{\n  {\n    const wchar_t* url = L\"https:\/\/www.google.com\/webhp?lala=la#q=%D0%BF%D1%80%D0%B8%D0%B2%D0%B5%D1%82\";\n    auto entry = uri_parser::UriParseUrl(url);\n    auto frag = entry.GetUnescapedFragment();\n\n    EXPECT_TRUE(frag.is_initialized());\n    EXPECT_STREQ(frag.get().c_str(), L\"q=\\xd0\\xbf\\xd1\\x80\\xd0\\xb8\\xd0\\xb2\\xd0\\xb5\\xd1\\x82\");\n  }\n  const char* url = \"https:\/\/www.google.com\/webhp?lala=la#q=%D0%BF%D1%80%D0%B8%D0%B2%D0%B5%D1%82\";\n  auto entry = uri_parser::UriParseUrl(url);\n  auto frag = entry.GetUnescapedFragment();\n\n  EXPECT_TRUE(frag.is_initialized());\n  EXPECT_STREQ(frag.get().c_str(), \"q=\\xd0\\xbf\\xd1\\x80\\xd0\\xb8\\xd0\\xb2\\xd0\\xb5\\xd1\\x82\");\n}\n\nTEST(cppUriParser, UriTypesMoveTest)\n{\n  typedef uri_parser::internal::UriTypes<wchar_t*> UriTypesChar;\n  UriTypesChar uriTypes;\n\n  EXPECT_TRUE(uriTypes.freeUriMembers);\n\n  std::unique_ptr<UriTypesChar> uriTypesEmpty = std::make_unique<UriTypesChar>(std::move(uriTypes));\n  EXPECT_TRUE(uriTypesEmpty->freeUriMembers);\n  EXPECT_TRUE(uriTypes.freeUriMembers);\n}<commit_msg>disabled types test<commit_after>#include \"cpp_uriparser.h\"\n#include <iostream>\n#include <gtest\/gtest.h>\n\nusing namespace uri_parser;\n\nTEST(cppUriParser, traversing_through_url)\n{\n\n  const char* url = \"http:\/\/www.example.com\/name%20with%20spaces\/lalala\/TheLastOne\";\n\n  auto entry = uri_parser::UriParseUrl(url);\n  auto pathHead = entry.PathHead();\n\n  auto id = 0;\n  for (auto pathFragment = std::begin(pathHead); pathFragment != std::end(pathHead); ++pathFragment, ++id)\n  {\n    switch (id)\n    {\n    case 0:\n      EXPECT_STREQ(pathFragment->c_str(), \"name%20with%20spaces\");\n      break;\n    case 1:\n      EXPECT_STREQ(pathFragment->c_str(), \"lalala\");\n      break;\n    case 2:\n      EXPECT_STREQ(pathFragment->c_str(), \"TheLastOne\");\n      break;\n    default:\n      ADD_FAILURE();\n      break;\n    }\n  }\n}\n\nTEST(cppUriParser, unescape_test)\n{\n  const char* url = \"http:\/\/www.example.com\/name%20with%20spaces\/lalala%01%FFg%0D%0A\";\n  auto entry = uri_parser::UriParseUrl(url);\n\n  auto unescapedString = entry.GetUnescapedUrlString();\n  EXPECT_FALSE(unescapedString.empty());\n  EXPECT_STREQ(\"http:\/\/www.example.com\/name with spaces\/lalala\\x01\\xffg\\r\\n\", unescapedString.c_str());\n}\n\nTEST(cppUriParser, unescaping_fragment)\n{\n  {\n    const wchar_t* url = L\"https:\/\/www.google.com\/webhp?lala=la#q=%D0%BF%D1%80%D0%B8%D0%B2%D0%B5%D1%82\";\n    auto entry = uri_parser::UriParseUrl(url);\n    auto frag = entry.GetUnescapedFragment();\n\n    EXPECT_TRUE(frag.is_initialized());\n    EXPECT_STREQ(frag.get().c_str(), L\"q=\\xd0\\xbf\\xd1\\x80\\xd0\\xb8\\xd0\\xb2\\xd0\\xb5\\xd1\\x82\");\n  }\n  const char* url = \"https:\/\/www.google.com\/webhp?lala=la#q=%D0%BF%D1%80%D0%B8%D0%B2%D0%B5%D1%82\";\n  auto entry = uri_parser::UriParseUrl(url);\n  auto frag = entry.GetUnescapedFragment();\n\n  EXPECT_TRUE(frag.is_initialized());\n  EXPECT_STREQ(frag.get().c_str(), \"q=\\xd0\\xbf\\xd1\\x80\\xd0\\xb8\\xd0\\xb2\\xd0\\xb5\\xd1\\x82\");\n}\n\nTEST(cppUriParser, DISABLED_UriTypesMoveTest)\n{\n  typedef uri_parser::internal::UriTypes<wchar_t*> UriTypesChar;\n  UriTypesChar uriTypes;\n  \/*\n  EXPECT_TRUE(uriTypes.freeUriMembers);\n\n  std::unique_ptr<UriTypesChar> uriTypesEmpty = std::make_unique<UriTypesChar>(std::move(uriTypes));\n  EXPECT_TRUE(uriTypesEmpty->freeUriMembers);\n  EXPECT_TRUE(uriTypes.freeUriMembers);\n  *\/\n}<|endoftext|>"}
{"text":"<commit_before>#include \"mainwindow.h\"\n#include \"ui_mainwindow.h\"\n#include \"plotwidget.h\"\n#include \"signalhandler.h\"\n#include \"signaldata.h\"\n#include \"selectsignaldialog.h\"\n#include \"signaldescription.h\"\n#include \"lcmthread.h\"\n\n#include <QLabel>\n#include <QLayout>\n#include <QApplication>\n#include <QComboBox>\n#include <QLabel>\n#include <QSpinBox>\n#include <QDebug>\n#include <QScrollArea>\n#include <QPushButton>\n#include <QShortcut>\n#include <QFileDialog>\n#include <QInputDialog>\n#include <QTimer>\n\n#include \"qjson.h\"\n\n#include \"ctkPythonConsole.h\"\n#include \"ctkAbstractPythonManager.h\"\n#include \"pythonsignalhandler.h\"\n#include \"pythonchannelsubscribercollection.h\"\n\n\n#include <cstdio>\n#include <limits>\n\n\nclass MainWindow::Internal : public Ui::MainWindow\n{\npublic:\n\n};\n\n\nMainWindow::MainWindow(QWidget* parent): QMainWindow(parent)\n{\n  mInternal = new Internal;\n  mInternal->setupUi(this);\n\n  mPlaying = false;\n  this->setWindowTitle(\"Signal Scope\");\n\n  mLCMThread = new LCMThread;\n  mLCMThread->start();\n\n  this->initPython();\n\n\n  mScrollArea = new QScrollArea;\n  mPlotArea = new QWidget;\n  mPlotLayout = new QVBoxLayout(mPlotArea);\n\n  mScrollArea->setWidget(mPlotArea);\n  mScrollArea->setHorizontalScrollBarPolicy(Qt::ScrollBarAlwaysOff);\n  mScrollArea->setVerticalScrollBarPolicy(Qt::ScrollBarAsNeeded);\n  mScrollArea->setWidgetResizable(true);\n  this->setCentralWidget(mScrollArea);\n\n  mInternal->ActionOpen->setIcon(qApp->style()->standardIcon(QStyle::SP_DialogOpenButton));\n  mInternal->ActionSave->setIcon(qApp->style()->standardIcon(QStyle::SP_DialogSaveButton));\n  mInternal->ActionPause->setIcon(qApp->style()->standardIcon(QStyle::SP_MediaPlay));\n  mInternal->ActionClearHistory->setIcon(qApp->style()->standardIcon(QStyle::SP_TrashIcon));\n  mInternal->ActionAddPlot->setIcon(qApp->style()->standardIcon(QStyle::SP_TrashIcon));\n  \/\/QStyle::SP_DialogDiscardButton\n\n  this->connect(mInternal->ActionQuit, SIGNAL(triggered()), SLOT(close()));\n  this->connect(mInternal->ActionOpen, SIGNAL(triggered()), SLOT(onOpenSettings()));\n  this->connect(mInternal->ActionSave, SIGNAL(triggered()), SLOT(onSaveSettings()));\n  this->connect(mInternal->ActionPause, SIGNAL(triggered()), SLOT(onTogglePause()));\n  this->connect(mInternal->ActionAddPlot, SIGNAL(triggered()), SLOT(onNewPlotClicked()));\n  this->connect(mInternal->ActionClearHistory, SIGNAL(triggered()), SLOT(onClearHistory()));\n\n  this->connect(mInternal->ActionBackgroundColor, SIGNAL(triggered()), SLOT(onChooseBackgroundColor()));\n\n  mInternal->toolBar->addSeparator();\n  mInternal->toolBar->addWidget(new QLabel(\"    Style: \"));\n\n  QComboBox* curveStyleCombo = new QComboBox(this);\n  curveStyleCombo->addItem(\"points\");\n  curveStyleCombo->addItem(\"lines\");\n  mInternal->toolBar->addWidget(curveStyleCombo);\n\n  mInternal->toolBar->addWidget(new QLabel(\"    Point size: \"));\n\n  QSpinBox* pointSizeSpin = new QSpinBox(this);\n  pointSizeSpin->setMinimum(1);\n  pointSizeSpin->setMaximum(20);\n  pointSizeSpin->setSingleStep(1);\n  pointSizeSpin->setValue(1);\n  mInternal->toolBar->addWidget(pointSizeSpin);\n\n  this->connect(curveStyleCombo, SIGNAL(currentIndexChanged(const QString&)), SLOT(onCurveStyleChanged(QString)));\n  this->connect(pointSizeSpin, SIGNAL(valueChanged(int)), SLOT(onPointSizeChanged(int)));\n\n  mRedrawTimer = new QTimer(this);\n  \/\/mRedrawTimer->setSingleShot(true);\n  this->connect(mRedrawTimer, SIGNAL(timeout()), this, SLOT(onRedrawPlots()));\n\n  QShortcut* showConsole = new QShortcut(QKeySequence(\"F8\"), this);\n  this->connect(showConsole, SIGNAL(activated()), this->mConsole, SLOT(show()));\n\n  this->connect(new QShortcut(QKeySequence(\"Ctrl+W\"), this->mConsole), SIGNAL(activated()), this->mConsole, SLOT(close()));\n\n  QString closeShortcut = \"Ctrl+D\";\n  #ifdef Q_OS_DARWIN\n  closeShortcut = \"Meta+D\";\n  #endif\n  this->connect(new QShortcut(QKeySequence(closeShortcut), this->mConsole), SIGNAL(activated()), this->mConsole, SLOT(close()));\n\n  this->resize(1024,800);\n  this->handleCommandLineArgs();\n\n  this->onTogglePause();\n\n  \/\/this->testPythonSignals();\n}\n\nMainWindow::~MainWindow()\n{\n\n  QString settingsFile = QDir::homePath() + \"\/.signal_scope.json\";\n  this->saveSettings(settingsFile);\n\n  mLCMThread->stop();\n  mLCMThread->wait(250);\n  delete mLCMThread;\n\n  delete mInternal;\n}\n\nvoid MainWindow::handleCommandLineArgs()\n{\n  QStringList args = QApplication::instance()->arguments();\n\n  if (args.length() > 1)\n  {\n    QString filename = args[1];\n    this->loadSettings(filename);\n  }\n  else\n  {\n    QString settingsFile = QDir::homePath() + \"\/.signal_scope.json\";\n    if (QFileInfo(settingsFile).exists())\n    {\n      this->loadSettings(settingsFile);\n    }\n  }\n}\n\nvoid MainWindow::testPythonSignals()\n{\n  this->onRemoveAllPlots();\n  PlotWidget* plot = this->addPlot();\n\n  QString testFile = QString(getenv(\"DRC_BASE\")) + \"\/software\/motion_estimate\/signal_scope\/src\/signal_scope\/userSignals.py\";\n  this->loadPythonSignals(plot, testFile);\n}\n\nvoid MainWindow::initPython()\n{\n  this->mPythonManager = new ctkAbstractPythonManager(this);\n  this->mConsole = new ctkPythonConsole(this);\n  this->mConsole->setWindowFlags(Qt::Dialog);\n  this->mConsole->initialize(this->mPythonManager);\n  this->mConsole->setAttribute(Qt::WA_QuitOnClose, true);\n  this->mConsole->resize(600, 280);\n  this->mConsole->setProperty(\"isInteractive\", true);\n  this->mPythonManager->addObjectToPythonMain(\"_console\", this->mConsole);\n\n  this->mPythonManager->executeFile(QString(getenv(\"DRC_BASE\")) + \"\/software\/motion_estimate\/signal_scope\/src\/signal_scope\/signalScopeSetup.py\");\n  PythonQtObjectPtr mainContext = PythonQt::self()->getMainModule();\n  PythonQtObjectPtr decodeCallback = PythonQt::self()->getVariable(mainContext, \"decodeMessageFunction\");\n\n  this->mSubscribers = new PythonChannelSubscriberCollection(mLCMThread, decodeCallback, this);\n}\n\nvoid MainWindow::loadPythonSignals(PlotWidget* plot, const QString& filename)\n{\n  this->mPythonManager->executeFile(filename);\n  PythonQtObjectPtr mainContext = PythonQt::self()->getMainModule();\n  QList<QVariant> signalsMap = PythonQt::self()->getVariable(mainContext, \"signals\").toList();\n  foreach (const QVariant& signalItem, signalsMap)\n  {\n    QList<QVariant> signalItemList = signalItem.toList();\n    QString channel = signalItemList[0].toString();\n    PythonQtObjectPtr callback = signalItemList[1].value<PythonQtObjectPtr>();\n\n    SignalDescription signalDescription;\n    signalDescription.mChannel = channel;\n    PythonSignalHandler* signalHandler = new PythonSignalHandler(&signalDescription, callback);\n    plot->addSignal(signalHandler);\n  }\n}\n\nvoid MainWindow::onCurveStyleChanged(QString style)\n{\n  QwtPlotCurve::CurveStyle curveStyle = style == \"lines\" ? QwtPlotCurve::Lines : QwtPlotCurve::Dots;\n\n  foreach (PlotWidget* plot, mPlots)\n  {\n    plot->setCurveStyle(curveStyle);\n  }\n}\n\n\nvoid MainWindow::onPointSizeChanged(int pointSize)\n{\n  foreach (PlotWidget* plot, mPlots)\n  {\n    plot->setPointSize(pointSize - 1);\n  }\n}\n\nvoid MainWindow::onClearHistory()\n{\n  foreach (PlotWidget* plot, mPlots)\n  {\n    plot->clearHistory();\n  }\n}\n\nQString MainWindow::defaultSettingsDir()\n{\n  QString configDir = qgetenv(\"DRC_BASE\") + \"\/software\/config\/signal_scope_configs\";\n  if (QDir(configDir).exists())\n  {\n    return QDir(configDir).canonicalPath();\n  }\n  else\n  {\n    return QDir::currentPath();\n  }\n}\n\nvoid MainWindow::onChooseBackgroundColor()\n{\n  QStringList colors;\n  colors << \"Black\" << \"White\";\n\n  bool ok;\n  QString color = QInputDialog::getItem(this, \"Choose background color\", \"Color\", colors, 0, false, &ok);\n  if (ok)\n  {\n    this->setPlotBackgroundColor(color);\n  }\n}\n\nvoid MainWindow::onChoosePointSize()\n{\n  bool ok;\n  int pointSize = QInputDialog::getInt(this, \"Choose point size\", \"Point size\", 1, 1, 20, 1, &ok);\n  if (ok)\n  {\n    foreach (PlotWidget* plot, mPlots)\n    {\n      plot->setPointSize(pointSize - 1);\n    }\n  }\n}\n\nvoid MainWindow::setPlotBackgroundColor(QString color)\n{\n  foreach (PlotWidget* plot, mPlots)\n  {\n    plot->setBackgroundColor(color);\n  }\n}\n\nvoid MainWindow::onSyncXAxis(double x0, double x1)\n{\n  foreach (PlotWidget* plot, mPlots)\n  {\n    if (plot == this->sender())\n      continue;\n\n    plot->setXAxisScale(x0, x1);\n    plot->replot();\n  }\n}\n\nvoid MainWindow::onRedrawPlots()\n{\n  mFPSCounter.update();\n  \/\/printf(\"redraw fps: %f\\n\", this->mFPSCounter.averageFPS());\n\n  if (mPlots.isEmpty())\n  {\n    return;\n  }\n\n  QList<SignalData*> signalDataList;\n  foreach (PlotWidget* plot, mPlots)\n  {\n    foreach (SignalHandler* signalHandler, plot->signalHandlers())\n    {\n      signalDataList.append(signalHandler->signalData());\n    }\n  }\n\n  if (signalDataList.isEmpty())\n  {\n    return;\n  }\n\n  double maxTime = -std::numeric_limits<float>::max();\n\n  foreach (SignalData* signalData, signalDataList)\n  {\n    signalData->updateValues();\n    double signalMaxTime = signalData->lastSampleTime();\n\n    if (signalMaxTime > maxTime)\n    {\n      maxTime = signalMaxTime;\n    }\n  }\n\n  if (maxTime == -std::numeric_limits<float>::max())\n  {\n    return;\n  }\n\n  foreach (PlotWidget* plot, mPlots)\n  {\n    \/\/plot->setEndTime(maxTime + (plot->timeWindow()\/2.0) );\n    plot->setEndTime(maxTime);\n    plot->replot();\n  }\n}\n\nvoid MainWindow::onOpenSettings()\n{\n  QString filter = \"JSON (*.json)\";\n  QString filename = QFileDialog::getOpenFileName(this, \"Open Settings\", this->defaultSettingsDir(), filter);\n  if (filename.length())\n  {\n    this->onRemoveAllPlots();\n    this->loadSettings(filename);\n  }\n}\n\nvoid MainWindow::onSaveSettings()\n{\n  QString defaultFile = mLastOpenFile.isEmpty() ? this->defaultSettingsDir() : mLastOpenFile;\n  QString filter = \"JSON (*.json)\";\n  QString filename = QFileDialog::getSaveFileName(this, \"Save Settings\", defaultFile, filter);\n  if (filename.length())\n  {\n    this->saveSettings(filename);\n  }\n}\n\nvoid MainWindow::saveSettings(const QString& filename)\n{\n  QMap<QString, QVariant> settings;\n\n  settings[\"windowWidth\"] = this->width();\n  settings[\"windowHeight\"] = this->height();\n\n  QList<QVariant> plotSettings;\n  foreach (PlotWidget* plot, mPlots)\n  {\n    plotSettings.append(plot->saveSettings());\n  }\n\n  settings[\"plots\"] = plotSettings;\n\n  Json::encodeFile(filename, settings);\n}\n\nvoid MainWindow::loadSettings(const QString& filename)\n{\n  QMap<QString, QVariant> settings = Json::decodeFile(filename);\n  this->loadSettings(settings);\n}\n\nvoid MainWindow::loadSettings(const QMap<QString, QVariant>& settings)\n{\n  QList<QVariant> plots = settings.value(\"plots\").toList();\n  foreach (const QVariant& plot, plots)\n  {\n    PlotWidget* plotWidget = this->addPlot();\n    QMap<QString, QVariant> plotSettings = plot.toMap();\n    plotWidget->loadSettings(plotSettings);\n\n    QString pythonFile = plotSettings.value(\"pythonScript\").toString();\n    if (pythonFile.length())\n    {\n      pythonFile = QString(getenv(\"DRC_BASE\")) + \"\/\" + pythonFile;\n      this->loadPythonSignals(plotWidget, pythonFile);\n    }\n  }\n\n  int windowWidth = settings.value(\"windowWidth\", 1024).toInt();\n  int windowHeight = settings.value(\"windowHeight\", 800).toInt();\n  this->resize(windowWidth, windowHeight);\n}\n\nvoid MainWindow::onTogglePause()\n{\n  mPlaying = !mPlaying;\n  mInternal->ActionPause->setChecked(mPlaying);\n  mInternal->ActionPause->setIcon(qApp->style()->standardIcon(mPlaying ? QStyle::SP_MediaPause : QStyle::SP_MediaPlay));\n  mInternal->ActionPause->setText(mPlaying ? \"Pause\" : \"Play\");\n\n\n  foreach (PlotWidget* plot, mPlots)\n  {\n    if (mPlaying)\n      plot->start();\n    else\n      plot->stop();\n  }\n\n  if (mPlaying)\n  {\n    mRedrawTimer->start(33);\n  }\n  else\n  {\n    mRedrawTimer->stop();\n  }\n}\n\nQList<SignalHandler*> MainWindow::getSignalSelectionFromUser()\n{\n  SelectSignalDialog dialog(this);\n  int result = dialog.exec();\n  if (result != QDialog::Accepted)\n  {\n    return QList<SignalHandler*>();\n  }\n\n  return dialog.createSignalHandlers();\n}\n\nvoid MainWindow::onNewPlotClicked()\n{\n  QList<SignalHandler*> signalHandlers = this->getSignalSelectionFromUser();\n  if (signalHandlers.isEmpty())\n  {\n    return;\n  }\n\n  PlotWidget* plot = this->addPlot();\n  foreach (SignalHandler* signalHandler, signalHandlers)\n  {\n    plot->addSignal(signalHandler);\n  }\n}\n\nPlotWidget* MainWindow::addPlot()\n{\n  PlotWidget* plot = new PlotWidget(mSubscribers);\n  mPlotLayout->addWidget(plot);\n  this->connect(plot, SIGNAL(removePlotRequested(PlotWidget*)), SLOT(onRemovePlot(PlotWidget*)));\n  this->connect(plot, SIGNAL(addSignalRequested(PlotWidget*)), SLOT(onAddSignalToPlot(PlotWidget*)));\n  this->connect(plot, SIGNAL(syncXAxisScale(double, double)), SLOT(onSyncXAxis(double, double)));\n  mPlots.append(plot);\n\n  if (mPlaying)\n    plot->start();\n  else\n    plot->stop();\n\n  return plot;\n}\n\nvoid MainWindow::onAddSignalToPlot(PlotWidget* plot)\n{\n  if (!plot)\n  {\n    return;\n  }\n\n  QList<SignalHandler*> signalHandlers = this->getSignalSelectionFromUser();\n  if (signalHandlers.isEmpty())\n  {\n    return;\n  }\n\n  foreach (SignalHandler* signalHandler, signalHandlers)\n  {\n    plot->addSignal(signalHandler);\n  }\n}\n\nvoid MainWindow::onRemoveAllPlots()\n{\n  QList<PlotWidget*> plots = mPlots;\n  foreach(PlotWidget* plot, plots)\n  {\n    this->onRemovePlot(plot);\n  }\n}\n\nvoid MainWindow::onRemovePlot(PlotWidget* plot)\n{\n  if (!plot)\n  {\n    return;\n  }\n\n  mPlotLayout->removeWidget(plot);\n  mPlots.removeAll(plot);\n  delete plot;\n}\n<commit_msg>avoid flicker when moving plots in play mode<commit_after>#include \"mainwindow.h\"\n#include \"ui_mainwindow.h\"\n#include \"plotwidget.h\"\n#include \"signalhandler.h\"\n#include \"signaldata.h\"\n#include \"selectsignaldialog.h\"\n#include \"signaldescription.h\"\n#include \"lcmthread.h\"\n\n#include <QLabel>\n#include <QLayout>\n#include <QApplication>\n#include <QComboBox>\n#include <QLabel>\n#include <QSpinBox>\n#include <QDebug>\n#include <QScrollArea>\n#include <QPushButton>\n#include <QShortcut>\n#include <QFileDialog>\n#include <QInputDialog>\n#include <QTimer>\n\n#include \"qjson.h\"\n\n#include \"ctkPythonConsole.h\"\n#include \"ctkAbstractPythonManager.h\"\n#include \"pythonsignalhandler.h\"\n#include \"pythonchannelsubscribercollection.h\"\n\n\n#include <cstdio>\n#include <limits>\n\n\nclass MainWindow::Internal : public Ui::MainWindow\n{\npublic:\n\n};\n\n\nMainWindow::MainWindow(QWidget* parent): QMainWindow(parent)\n{\n  mInternal = new Internal;\n  mInternal->setupUi(this);\n\n  mPlaying = false;\n  this->setWindowTitle(\"Signal Scope\");\n\n  mLCMThread = new LCMThread;\n  mLCMThread->start();\n\n  this->initPython();\n\n\n  mScrollArea = new QScrollArea;\n  mPlotArea = new QWidget;\n  mPlotLayout = new QVBoxLayout(mPlotArea);\n\n  mScrollArea->setWidget(mPlotArea);\n  mScrollArea->setHorizontalScrollBarPolicy(Qt::ScrollBarAlwaysOff);\n  mScrollArea->setVerticalScrollBarPolicy(Qt::ScrollBarAsNeeded);\n  mScrollArea->setWidgetResizable(true);\n  this->setCentralWidget(mScrollArea);\n\n  mInternal->ActionOpen->setIcon(qApp->style()->standardIcon(QStyle::SP_DialogOpenButton));\n  mInternal->ActionSave->setIcon(qApp->style()->standardIcon(QStyle::SP_DialogSaveButton));\n  mInternal->ActionPause->setIcon(qApp->style()->standardIcon(QStyle::SP_MediaPlay));\n  mInternal->ActionClearHistory->setIcon(qApp->style()->standardIcon(QStyle::SP_TrashIcon));\n  mInternal->ActionAddPlot->setIcon(qApp->style()->standardIcon(QStyle::SP_TrashIcon));\n  \/\/QStyle::SP_DialogDiscardButton\n\n  this->connect(mInternal->ActionQuit, SIGNAL(triggered()), SLOT(close()));\n  this->connect(mInternal->ActionOpen, SIGNAL(triggered()), SLOT(onOpenSettings()));\n  this->connect(mInternal->ActionSave, SIGNAL(triggered()), SLOT(onSaveSettings()));\n  this->connect(mInternal->ActionPause, SIGNAL(triggered()), SLOT(onTogglePause()));\n  this->connect(mInternal->ActionAddPlot, SIGNAL(triggered()), SLOT(onNewPlotClicked()));\n  this->connect(mInternal->ActionClearHistory, SIGNAL(triggered()), SLOT(onClearHistory()));\n\n  this->connect(mInternal->ActionBackgroundColor, SIGNAL(triggered()), SLOT(onChooseBackgroundColor()));\n\n  mInternal->toolBar->addSeparator();\n  mInternal->toolBar->addWidget(new QLabel(\"    Style: \"));\n\n  QComboBox* curveStyleCombo = new QComboBox(this);\n  curveStyleCombo->addItem(\"points\");\n  curveStyleCombo->addItem(\"lines\");\n  mInternal->toolBar->addWidget(curveStyleCombo);\n\n  mInternal->toolBar->addWidget(new QLabel(\"    Point size: \"));\n\n  QSpinBox* pointSizeSpin = new QSpinBox(this);\n  pointSizeSpin->setMinimum(1);\n  pointSizeSpin->setMaximum(20);\n  pointSizeSpin->setSingleStep(1);\n  pointSizeSpin->setValue(1);\n  mInternal->toolBar->addWidget(pointSizeSpin);\n\n  this->connect(curveStyleCombo, SIGNAL(currentIndexChanged(const QString&)), SLOT(onCurveStyleChanged(QString)));\n  this->connect(pointSizeSpin, SIGNAL(valueChanged(int)), SLOT(onPointSizeChanged(int)));\n\n  mRedrawTimer = new QTimer(this);\n  \/\/mRedrawTimer->setSingleShot(true);\n  this->connect(mRedrawTimer, SIGNAL(timeout()), this, SLOT(onRedrawPlots()));\n\n  QShortcut* showConsole = new QShortcut(QKeySequence(\"F8\"), this);\n  this->connect(showConsole, SIGNAL(activated()), this->mConsole, SLOT(show()));\n\n  this->connect(new QShortcut(QKeySequence(\"Ctrl+W\"), this->mConsole), SIGNAL(activated()), this->mConsole, SLOT(close()));\n\n  QString closeShortcut = \"Ctrl+D\";\n  #ifdef Q_OS_DARWIN\n  closeShortcut = \"Meta+D\";\n  #endif\n  this->connect(new QShortcut(QKeySequence(closeShortcut), this->mConsole), SIGNAL(activated()), this->mConsole, SLOT(close()));\n\n  this->resize(1024,800);\n  this->handleCommandLineArgs();\n\n  this->onTogglePause();\n\n  \/\/this->testPythonSignals();\n}\n\nMainWindow::~MainWindow()\n{\n\n  QString settingsFile = QDir::homePath() + \"\/.signal_scope.json\";\n  this->saveSettings(settingsFile);\n\n  mLCMThread->stop();\n  mLCMThread->wait(250);\n  delete mLCMThread;\n\n  delete mInternal;\n}\n\nvoid MainWindow::handleCommandLineArgs()\n{\n  QStringList args = QApplication::instance()->arguments();\n\n  if (args.length() > 1)\n  {\n    QString filename = args[1];\n    this->loadSettings(filename);\n  }\n  else\n  {\n    QString settingsFile = QDir::homePath() + \"\/.signal_scope.json\";\n    if (QFileInfo(settingsFile).exists())\n    {\n      this->loadSettings(settingsFile);\n    }\n  }\n}\n\nvoid MainWindow::testPythonSignals()\n{\n  this->onRemoveAllPlots();\n  PlotWidget* plot = this->addPlot();\n\n  QString testFile = QString(getenv(\"DRC_BASE\")) + \"\/software\/motion_estimate\/signal_scope\/src\/signal_scope\/userSignals.py\";\n  this->loadPythonSignals(plot, testFile);\n}\n\nvoid MainWindow::initPython()\n{\n  this->mPythonManager = new ctkAbstractPythonManager(this);\n  this->mConsole = new ctkPythonConsole(this);\n  this->mConsole->setWindowFlags(Qt::Dialog);\n  this->mConsole->initialize(this->mPythonManager);\n  this->mConsole->setAttribute(Qt::WA_QuitOnClose, true);\n  this->mConsole->resize(600, 280);\n  this->mConsole->setProperty(\"isInteractive\", true);\n  this->mPythonManager->addObjectToPythonMain(\"_console\", this->mConsole);\n\n  this->mPythonManager->executeFile(QString(getenv(\"DRC_BASE\")) + \"\/software\/motion_estimate\/signal_scope\/src\/signal_scope\/signalScopeSetup.py\");\n  PythonQtObjectPtr mainContext = PythonQt::self()->getMainModule();\n  PythonQtObjectPtr decodeCallback = PythonQt::self()->getVariable(mainContext, \"decodeMessageFunction\");\n\n  this->mSubscribers = new PythonChannelSubscriberCollection(mLCMThread, decodeCallback, this);\n}\n\nvoid MainWindow::loadPythonSignals(PlotWidget* plot, const QString& filename)\n{\n  this->mPythonManager->executeFile(filename);\n  PythonQtObjectPtr mainContext = PythonQt::self()->getMainModule();\n  QList<QVariant> signalsMap = PythonQt::self()->getVariable(mainContext, \"signals\").toList();\n  foreach (const QVariant& signalItem, signalsMap)\n  {\n    QList<QVariant> signalItemList = signalItem.toList();\n    QString channel = signalItemList[0].toString();\n    PythonQtObjectPtr callback = signalItemList[1].value<PythonQtObjectPtr>();\n\n    SignalDescription signalDescription;\n    signalDescription.mChannel = channel;\n    PythonSignalHandler* signalHandler = new PythonSignalHandler(&signalDescription, callback);\n    plot->addSignal(signalHandler);\n  }\n}\n\nvoid MainWindow::onCurveStyleChanged(QString style)\n{\n  QwtPlotCurve::CurveStyle curveStyle = style == \"lines\" ? QwtPlotCurve::Lines : QwtPlotCurve::Dots;\n\n  foreach (PlotWidget* plot, mPlots)\n  {\n    plot->setCurveStyle(curveStyle);\n  }\n}\n\n\nvoid MainWindow::onPointSizeChanged(int pointSize)\n{\n  foreach (PlotWidget* plot, mPlots)\n  {\n    plot->setPointSize(pointSize - 1);\n  }\n}\n\nvoid MainWindow::onClearHistory()\n{\n  foreach (PlotWidget* plot, mPlots)\n  {\n    plot->clearHistory();\n  }\n}\n\nQString MainWindow::defaultSettingsDir()\n{\n  QString configDir = qgetenv(\"DRC_BASE\") + \"\/software\/config\/signal_scope_configs\";\n  if (QDir(configDir).exists())\n  {\n    return QDir(configDir).canonicalPath();\n  }\n  else\n  {\n    return QDir::currentPath();\n  }\n}\n\nvoid MainWindow::onChooseBackgroundColor()\n{\n  QStringList colors;\n  colors << \"Black\" << \"White\";\n\n  bool ok;\n  QString color = QInputDialog::getItem(this, \"Choose background color\", \"Color\", colors, 0, false, &ok);\n  if (ok)\n  {\n    this->setPlotBackgroundColor(color);\n  }\n}\n\nvoid MainWindow::onChoosePointSize()\n{\n  bool ok;\n  int pointSize = QInputDialog::getInt(this, \"Choose point size\", \"Point size\", 1, 1, 20, 1, &ok);\n  if (ok)\n  {\n    foreach (PlotWidget* plot, mPlots)\n    {\n      plot->setPointSize(pointSize - 1);\n    }\n  }\n}\n\nvoid MainWindow::setPlotBackgroundColor(QString color)\n{\n  foreach (PlotWidget* plot, mPlots)\n  {\n    plot->setBackgroundColor(color);\n  }\n}\n\nvoid MainWindow::onSyncXAxis(double x0, double x1)\n{\n  if (mPlaying)\n    return;\n\n  foreach (PlotWidget* plot, mPlots)\n  {\n    if (plot == this->sender())\n      continue;\n\n    plot->setXAxisScale(x0, x1);\n    plot->replot();\n  }\n}\n\nvoid MainWindow::onRedrawPlots()\n{\n  mFPSCounter.update();\n  \/\/printf(\"redraw fps: %f\\n\", this->mFPSCounter.averageFPS());\n\n  if (mPlots.isEmpty())\n  {\n    return;\n  }\n\n  QList<SignalData*> signalDataList;\n  foreach (PlotWidget* plot, mPlots)\n  {\n    foreach (SignalHandler* signalHandler, plot->signalHandlers())\n    {\n      signalDataList.append(signalHandler->signalData());\n    }\n  }\n\n  if (signalDataList.isEmpty())\n  {\n    return;\n  }\n\n  double maxTime = -std::numeric_limits<float>::max();\n\n  foreach (SignalData* signalData, signalDataList)\n  {\n    signalData->updateValues();\n    double signalMaxTime = signalData->lastSampleTime();\n\n    if (signalMaxTime > maxTime)\n    {\n      maxTime = signalMaxTime;\n    }\n  }\n\n  if (maxTime == -std::numeric_limits<float>::max())\n  {\n    return;\n  }\n\n  foreach (PlotWidget* plot, mPlots)\n  {\n    \/\/plot->setEndTime(maxTime + (plot->timeWindow()\/2.0) );\n    plot->setEndTime(maxTime);\n    plot->replot();\n  }\n}\n\nvoid MainWindow::onOpenSettings()\n{\n  QString filter = \"JSON (*.json)\";\n  QString filename = QFileDialog::getOpenFileName(this, \"Open Settings\", this->defaultSettingsDir(), filter);\n  if (filename.length())\n  {\n    this->onRemoveAllPlots();\n    this->loadSettings(filename);\n  }\n}\n\nvoid MainWindow::onSaveSettings()\n{\n  QString defaultFile = mLastOpenFile.isEmpty() ? this->defaultSettingsDir() : mLastOpenFile;\n  QString filter = \"JSON (*.json)\";\n  QString filename = QFileDialog::getSaveFileName(this, \"Save Settings\", defaultFile, filter);\n  if (filename.length())\n  {\n    this->saveSettings(filename);\n  }\n}\n\nvoid MainWindow::saveSettings(const QString& filename)\n{\n  QMap<QString, QVariant> settings;\n\n  settings[\"windowWidth\"] = this->width();\n  settings[\"windowHeight\"] = this->height();\n\n  QList<QVariant> plotSettings;\n  foreach (PlotWidget* plot, mPlots)\n  {\n    plotSettings.append(plot->saveSettings());\n  }\n\n  settings[\"plots\"] = plotSettings;\n\n  Json::encodeFile(filename, settings);\n}\n\nvoid MainWindow::loadSettings(const QString& filename)\n{\n  QMap<QString, QVariant> settings = Json::decodeFile(filename);\n  this->loadSettings(settings);\n}\n\nvoid MainWindow::loadSettings(const QMap<QString, QVariant>& settings)\n{\n  QList<QVariant> plots = settings.value(\"plots\").toList();\n  foreach (const QVariant& plot, plots)\n  {\n    PlotWidget* plotWidget = this->addPlot();\n    QMap<QString, QVariant> plotSettings = plot.toMap();\n    plotWidget->loadSettings(plotSettings);\n\n    QString pythonFile = plotSettings.value(\"pythonScript\").toString();\n    if (pythonFile.length())\n    {\n      pythonFile = QString(getenv(\"DRC_BASE\")) + \"\/\" + pythonFile;\n      this->loadPythonSignals(plotWidget, pythonFile);\n    }\n  }\n\n  int windowWidth = settings.value(\"windowWidth\", 1024).toInt();\n  int windowHeight = settings.value(\"windowHeight\", 800).toInt();\n  this->resize(windowWidth, windowHeight);\n}\n\nvoid MainWindow::onTogglePause()\n{\n  mPlaying = !mPlaying;\n  mInternal->ActionPause->setChecked(mPlaying);\n  mInternal->ActionPause->setIcon(qApp->style()->standardIcon(mPlaying ? QStyle::SP_MediaPause : QStyle::SP_MediaPlay));\n  mInternal->ActionPause->setText(mPlaying ? \"Pause\" : \"Play\");\n\n\n  foreach (PlotWidget* plot, mPlots)\n  {\n    if (mPlaying)\n      plot->start();\n    else\n      plot->stop();\n  }\n\n  if (mPlaying)\n  {\n    mRedrawTimer->start(33);\n  }\n  else\n  {\n    mRedrawTimer->stop();\n  }\n}\n\nQList<SignalHandler*> MainWindow::getSignalSelectionFromUser()\n{\n  SelectSignalDialog dialog(this);\n  int result = dialog.exec();\n  if (result != QDialog::Accepted)\n  {\n    return QList<SignalHandler*>();\n  }\n\n  return dialog.createSignalHandlers();\n}\n\nvoid MainWindow::onNewPlotClicked()\n{\n  QList<SignalHandler*> signalHandlers = this->getSignalSelectionFromUser();\n  if (signalHandlers.isEmpty())\n  {\n    return;\n  }\n\n  PlotWidget* plot = this->addPlot();\n  foreach (SignalHandler* signalHandler, signalHandlers)\n  {\n    plot->addSignal(signalHandler);\n  }\n}\n\nPlotWidget* MainWindow::addPlot()\n{\n  PlotWidget* plot = new PlotWidget(mSubscribers);\n  mPlotLayout->addWidget(plot);\n  this->connect(plot, SIGNAL(removePlotRequested(PlotWidget*)), SLOT(onRemovePlot(PlotWidget*)));\n  this->connect(plot, SIGNAL(addSignalRequested(PlotWidget*)), SLOT(onAddSignalToPlot(PlotWidget*)));\n  this->connect(plot, SIGNAL(syncXAxisScale(double, double)), SLOT(onSyncXAxis(double, double)));\n  mPlots.append(plot);\n\n  if (mPlaying)\n    plot->start();\n  else\n    plot->stop();\n\n  return plot;\n}\n\nvoid MainWindow::onAddSignalToPlot(PlotWidget* plot)\n{\n  if (!plot)\n  {\n    return;\n  }\n\n  QList<SignalHandler*> signalHandlers = this->getSignalSelectionFromUser();\n  if (signalHandlers.isEmpty())\n  {\n    return;\n  }\n\n  foreach (SignalHandler* signalHandler, signalHandlers)\n  {\n    plot->addSignal(signalHandler);\n  }\n}\n\nvoid MainWindow::onRemoveAllPlots()\n{\n  QList<PlotWidget*> plots = mPlots;\n  foreach(PlotWidget* plot, plots)\n  {\n    this->onRemovePlot(plot);\n  }\n}\n\nvoid MainWindow::onRemovePlot(PlotWidget* plot)\n{\n  if (!plot)\n  {\n    return;\n  }\n\n  mPlotLayout->removeWidget(plot);\n  mPlots.removeAll(plot);\n  delete plot;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>reverse linkedlist<commit_after><|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <memory>\n\n#include <anyode\/anyode.hpp>\n#include <anyode\/anyode_blas_lapack.hpp>  \/\/ dgemv, dgesvd\n#include <anyode\/anyode_matrix.hpp> \/\/ DenseMatrixView\n#include <anyode\/anyode_buffer.hpp>  \/\/ make_unique\n#include <anyode\/anyode_decomposition.hpp>  \/\/ SVD\n\nnamespace AnyODE {\n\n    template <typename Real_t=double, typename JacMat_t=DenseMatrixView<Real_t>, typename Decomp_t=SVD<Real_t>>\n    struct OdeSysIterativeBase : public OdeSysBase<Real_t> {\n        int m_njacvec_dot=0, m_nprec_setup=0, m_nprec_solve=0;\n        std::unique_ptr<JacMat_t> m_jac_cache {nullptr};\n        std::unique_ptr<JacMat_t> m_prec_cache {nullptr};\n        bool m_update_prec_cache = false;\n        Real_t m_old_gamma;\n\n        virtual Status jac_times_vec(const Real_t * const __restrict__ vec,\n                                     Real_t * const __restrict__ out,\n                                     Real_t t,\n                                     const Real_t * const __restrict__ y,\n                                     const Real_t * const __restrict__ fy\n                                     ) override\n        {\n            \/\/ See \"Jacobian information (matrix-vector product)\"\n            \/\/     (4.6.8 in cvs_guide.pdf for sundials 2.7.0)\n            auto status = AnyODE::Status::success;\n            const int ny = this->get_ny();\n            if (m_jac_cache == nullptr){\n                m_jac_cache = make_unique<JacMat_t>(nullptr, ny, ny, ny, true);\n                status = this->dense_jac_cmaj(t, y, fy, m_jac_cache->m_data, m_jac_cache->m_ld);\n            }\n            m_jac_cache->dot_vec(vec, out);\n            m_njacvec_dot++;\n            return status;\n        }\n\n        virtual Status prec_setup(Real_t t,\n                                  const Real_t * const __restrict__ y,\n                                  const Real_t * const __restrict__ fy,\n                                  bool jac_ok,\n                                  bool& jac_recomputed,\n                                  Real_t gamma) override\n        {\n            const int ny = this->get_ny();\n            auto status = AnyODE::Status::success;\n            ignore(gamma);\n            \/\/ See \"Preconditioning (Jacobian data)\" in cvs_guide.pdf (4.6.10 for 2.7.0)\n            if (m_jac_cache == nullptr)\n                m_jac_cache = make_unique<JacMat_t>(nullptr, ny, ny, ny, true);\n\n            if (jac_ok){\n                jac_recomputed = false;\n            } else {\n                status = this->dense_jac_cmaj(t, y, fy, m_jac_cache->m_data, m_jac_cache->m_ld);\n                m_update_prec_cache = true;\n                jac_recomputed = true;\n            }\n            m_nprec_setup++;\n            return status;\n        }\n\n        virtual Status prec_solve_left(const Real_t t,\n                                       const Real_t * const __restrict__ y,\n                                       const Real_t * const __restrict__ fy,\n                                       const Real_t * const __restrict__ r,\n                                       Real_t * const __restrict__ z,\n                                       Real_t gamma,\n                                       Real_t delta,\n                                       const Real_t * const __restrict__ ewt\n                                       ) override\n        {\n            \/\/ See 4.6.9 on page 75 in cvs_guide.pdf (Sundials 2.6.2)\n            \/\/ Solves P*z = r, where P ~= I - gamma*J\n            ignore(delta);\n            const int ny = this->get_ny();\n            if (ewt)\n                throw std::runtime_error(\"Not implemented.\");\n            m_nprec_solve++;\n\n            ignore(t); ignore(fy); ignore(y);\n            bool recompute = false;\n            if (m_prec_cache == nullptr){\n                m_prec_cache = make_unique<JacMat_t>(nullptr, ny, ny, ny, true);\n                recompute = true;\n            } else {\n                if (m_update_prec_cache or (m_old_gamma != gamma))\n                    recompute = true;\n            }\n            if (recompute){\n                m_old_gamma = gamma;\n                m_prec_cache->set_to_eye_plus_scaled_mtx(-gamma, *m_jac_cache);\n            }\n            int info;\n            auto decomp = Decomp_t((JacMat_t*)(m_prec_cache.get()));\n            info = decomp.solve(r, z);\n            if (info == 0)\n                return AnyODE::Status::success;\n            return AnyODE::Status::recoverable_error;\n        }\n\n\n    };\n}\n<commit_msg>Forgot to rename class<commit_after>#pragma once\n\n#include <memory>\n\n#include <anyode\/anyode.hpp>\n#include <anyode\/anyode_blas_lapack.hpp>  \/\/ dgemv, dgesvd\n#include <anyode\/anyode_matrix.hpp> \/\/ DenseMatrix\n#include <anyode\/anyode_buffer.hpp>  \/\/ make_unique\n#include <anyode\/anyode_decomposition.hpp>  \/\/ SVD\n\nnamespace AnyODE {\n\n    template <typename Real_t=double, typename JacMat_t=DenseMatrix<Real_t>, typename Decomp_t=SVD<Real_t>>\n    struct OdeSysIterativeBase : public OdeSysBase<Real_t> {\n        int m_njacvec_dot=0, m_nprec_setup=0, m_nprec_solve=0;\n        std::unique_ptr<JacMat_t> m_jac_cache {nullptr};\n        std::unique_ptr<JacMat_t> m_prec_cache {nullptr};\n        bool m_update_prec_cache = false;\n        Real_t m_old_gamma;\n\n        virtual Status jac_times_vec(const Real_t * const __restrict__ vec,\n                                     Real_t * const __restrict__ out,\n                                     Real_t t,\n                                     const Real_t * const __restrict__ y,\n                                     const Real_t * const __restrict__ fy\n                                     ) override\n        {\n            \/\/ See \"Jacobian information (matrix-vector product)\"\n            \/\/     (4.6.8 in cvs_guide.pdf for sundials 2.7.0)\n            auto status = AnyODE::Status::success;\n            const int ny = this->get_ny();\n            if (m_jac_cache == nullptr){\n                m_jac_cache = make_unique<JacMat_t>(nullptr, ny, ny, ny, true);\n                status = this->dense_jac_cmaj(t, y, fy, m_jac_cache->m_data, m_jac_cache->m_ld);\n            }\n            m_jac_cache->dot_vec(vec, out);\n            m_njacvec_dot++;\n            return status;\n        }\n\n        virtual Status prec_setup(Real_t t,\n                                  const Real_t * const __restrict__ y,\n                                  const Real_t * const __restrict__ fy,\n                                  bool jac_ok,\n                                  bool& jac_recomputed,\n                                  Real_t gamma) override\n        {\n            const int ny = this->get_ny();\n            auto status = AnyODE::Status::success;\n            ignore(gamma);\n            \/\/ See \"Preconditioning (Jacobian data)\" in cvs_guide.pdf (4.6.10 for 2.7.0)\n            if (m_jac_cache == nullptr)\n                m_jac_cache = make_unique<JacMat_t>(nullptr, ny, ny, ny, true);\n\n            if (jac_ok){\n                jac_recomputed = false;\n            } else {\n                status = this->dense_jac_cmaj(t, y, fy, m_jac_cache->m_data, m_jac_cache->m_ld);\n                m_update_prec_cache = true;\n                jac_recomputed = true;\n            }\n            m_nprec_setup++;\n            return status;\n        }\n\n        virtual Status prec_solve_left(const Real_t t,\n                                       const Real_t * const __restrict__ y,\n                                       const Real_t * const __restrict__ fy,\n                                       const Real_t * const __restrict__ r,\n                                       Real_t * const __restrict__ z,\n                                       Real_t gamma,\n                                       Real_t delta,\n                                       const Real_t * const __restrict__ ewt\n                                       ) override\n        {\n            \/\/ See 4.6.9 on page 75 in cvs_guide.pdf (Sundials 2.6.2)\n            \/\/ Solves P*z = r, where P ~= I - gamma*J\n            ignore(delta);\n            const int ny = this->get_ny();\n            if (ewt)\n                throw std::runtime_error(\"Not implemented.\");\n            m_nprec_solve++;\n\n            ignore(t); ignore(fy); ignore(y);\n            bool recompute = false;\n            if (m_prec_cache == nullptr){\n                m_prec_cache = make_unique<JacMat_t>(nullptr, ny, ny, ny, true);\n                recompute = true;\n            } else {\n                if (m_update_prec_cache or (m_old_gamma != gamma))\n                    recompute = true;\n            }\n            if (recompute){\n                m_old_gamma = gamma;\n                m_prec_cache->set_to_eye_plus_scaled_mtx(-gamma, *m_jac_cache);\n            }\n            int info;\n            auto decomp = Decomp_t((JacMat_t*)(m_prec_cache.get()));\n            info = decomp.solve(r, z);\n            if (info == 0)\n                return AnyODE::Status::success;\n            return AnyODE::Status::recoverable_error;\n        }\n\n\n    };\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n#ifndef OPENGM_MAXIMUM_LIKELIHOOD_LEARNER_HXX\n#define OPENGM_MAXIMUM_LIKELIHOOD_LEARNER_HXX\n\n#include <vector>\n#include <opengm\/functions\/learnablefunction.hxx>\n#include <fstream>\n#include <opengm\/inference\/messagepassing\/messagepassing.hxx>\n#include <opengm\/functions\/explicit_function.hxx>\n#include <opengm\/functions\/view_convert_function.hxx>\n#include <opengm\/functions\/learnable\/lpotts.hxx>\n#include <opengm\/functions\/learnable\/sum_of_experts.hxx>\n#include <opengm\/graphicalmodel\/graphicalmodel.hxx>\n#include <opengm\/inference\/icm.hxx>\n\ntypedef double ValueType;\ntypedef size_t IndexType;\ntypedef size_t LabelType;\ntypedef opengm::meta::TypeListGenerator<\n    opengm::ExplicitFunction<ValueType,IndexType,LabelType>,\n    opengm::functions::learnable::LPotts<ValueType,IndexType,LabelType>,\n    opengm::functions::learnable::SumOfExperts<ValueType,IndexType,LabelType>\n>::type FunctionListType;\n\ntypedef opengm::GraphicalModel<\n    ValueType,opengm::Adder,\n    FunctionListType,\n    opengm::DiscreteSpace<IndexType,LabelType>\n> GM;\n\ntypedef opengm::ICM<GM,opengm::Minimizer> INF;\ntypedef opengm::learning::Weights<ValueType> WeightType;\n\nstruct WeightGradientFunctor{\n    WeightGradientFunctor(IndexType weight, std::vector<LabelType>::iterator labelVectorBegin)\n        : weight_(weight),\n          labelVectorBegin_(labelVectorBegin){\n    }\n\n    template<class F>\n    void operator()(const F & function ){\n        IndexType index=-1;\n        for(size_t i=0; i<function.numberOfWeights();++i)\n            if(function.weightIndex(i)==weight_)\n                index=i;\n        if(index!=-1)\n            result_ = function.weightGradient(index, labelVectorBegin_);\n        else\n            result_ = 0;\n    }\n\n    IndexType weight_;\n    std::vector<LabelType>::iterator labelVectorBegin_;\n    ValueType result_;\n};\n\nnamespace opengm {\nnamespace learning {\n\ntemplate<class DATASET, class LOSS>\nclass MaximumLikelihoodLearner\n{\npublic:\n    typedef typename DATASET::GMType   GMType;\n    typedef typename GMType::ValueType ValueType;\n    typedef typename GMType::IndexType IndexType;\n    typedef typename GMType::LabelType LabelType;\n    typedef typename GMType::FactorType FactorType;\n\n    class Weight{\n    public:\n        std::vector<double> weightUpperbound_;\n        std::vector<double> weightLowerbound_;\n        std::vector<IndexType> testingPoints_;\n        Weight(){;}\n    };\n\n\n    MaximumLikelihoodLearner(DATASET&, Weight& );\n\n    template<class INF>\n    void learn(typename INF::Parameter& weight);\n\n    const opengm::learning::Weights<ValueType>& getModelWeights(){return modelWeights_;}\n    Weight& getLerningWeights(){return weight_;}\n\nprivate:\n    DATASET& dataset_;\n    opengm::learning::Weights<ValueType> modelWeights_;\n    Weight weight_;\n};\n\ntemplate<class DATASET, class LOSS>\nMaximumLikelihoodLearner<DATASET, LOSS>::MaximumLikelihoodLearner(DATASET& ds, Weight& w )\n    : dataset_(ds), weight_(w)\n{\n    modelWeights_ = opengm::learning::Weights<ValueType>(ds.getNumberOfWeights());\n    if(weight_.weightUpperbound_.size() != ds.getNumberOfWeights())\n        weight_.weightUpperbound_.resize(ds.getNumberOfWeights(),10.0);\n    if(weight_.weightLowerbound_.size() != ds.getNumberOfWeights())\n        weight_.weightLowerbound_.resize(ds.getNumberOfWeights(),0.0);\n    if(weight_.testingPoints_.size() != ds.getNumberOfWeights())\n        weight_.testingPoints_.resize(ds.getNumberOfWeights(),10);\n}\n\n\ntemplate<class DATASET, class LOSS>\ntemplate<class INF>\nvoid MaximumLikelihoodLearner<DATASET, LOSS>::learn(typename INF::Parameter& weight){\n\n    opengm::learning::Weights<ValueType> modelWeight( dataset_.getNumberOfWeights() );\n    opengm::learning::Weights<ValueType> bestModelWeight( dataset_.getNumberOfWeights() );\n    double bestLoss = 100000000.0;\n    std::vector<ValueType> point(dataset_.getNumberOfWeights(),0);\n    std::vector<ValueType> gradient(dataset_.getNumberOfWeights(),0);\n    std::vector<ValueType> Delta(dataset_.getNumberOfWeights(),0);\n    for(IndexType p=0; p<dataset_.getNumberOfWeights(); ++p)\n        point[p] = ValueType((weight_.weightUpperbound_[p]-weight_.weightLowerbound_[p])\/2);\n        \/\/point[p] = ValueType(weight_.weightUpperbound_[p]);\n        \/\/point[p] = ValueType(weight_.weightLowerbound_[p]);\n\n    LOSS lossFunction;\n    bool search=true;\n    int count=0;\n\n    std::vector< std::vector<ValueType> > w( dataset_.getNumberOfModels(), std::vector<ValueType> ( dataset_.getModel(0).numberOfVariables()) );\n\n    \/***********************************************************************************************************\/\n    \/\/ construct Ground Truth dependent weights\n    \/***********************************************************************************************************\/\n\n    for(IndexType m=0; m<dataset_.getNumberOfModels(); ++m){ \/\/ for each model\n        const GMType &model = dataset_.getModel(m);\n        const std::vector<typename INF::LabelType>& gt =  dataset_.getGT(m);\n\n        for(IndexType v=0; v<model.numberOfVariables();++v)\n            w[m][v]=(ValueType)gt[v];\n    }\n\n    ValueType eta = 0.01;\n    ValueType delta = 0.25; \/\/ 0 <= delta <= 0.5\n    ValueType D_a = 1.0; \/\/ distance treshold\n    ValueType optFun, bestOptFun=0.0;\n\n    while(search){\n        ++count;\n        \/\/if (count % 1000 == 0)\n        std::cout << \"---count--->\" << count << \"     \";\n\n        \/\/ Get Weights\n        for(IndexType p=0; p<dataset_.getNumberOfWeights(); ++p){\n            modelWeight.setWeight(p, point[p]);\n        }\n\n        \/***********************************************************************************************************\/\n        \/\/ calculate current loss - not needed\n        \/***********************************************************************************************************\/\n        opengm::learning::Weights<ValueType>& mp =  dataset_.getWeights();\n        mp = modelWeight;\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),weight);\n           inf.infer();\n           inf.arg(confs[m]);\n           const std::vector<typename INF::LabelType>& gt =  dataset_.getGT(m);\n           loss += lossFunction.loss(confs[m].begin(), confs[m].end(), gt.begin(), gt.end());\n        }\n\n        std::cout << \" eta = \" << eta << \"   weights  \";\/\/<< std::endl;\n        for(IndexType p=0; p<dataset_.getNumberOfWeights(); ++p){\n            std::cout << modelWeight[p] << \" \" ;\n        }\n\n        optFun=0.0;\n\n        \/***********************************************************************************************************\/\n        \/\/ Loopy Belief Propagation setup\n        \/***********************************************************************************************************\/\n        typedef typename opengm::ExplicitFunction<ValueType,IndexType,LabelType> FunctionType;\n        typedef typename opengm::ViewConvertFunction<GMType,Minimizer,ValueType> ViewFunctionType;\n        typedef typename GMType::FunctionIdentifier FunctionIdentifierType;\n        typedef typename opengm::meta::TypeListGenerator<FunctionType,ViewFunctionType>::type FunctionListType;\n        typedef opengm::GraphicalModel<ValueType,opengm::Multiplier, FunctionListType, opengm::DiscreteSpace<IndexType,LabelType> > GmBpType;\n        typedef BeliefPropagationUpdateRules<GmBpType, opengm::Integrator> UpdateRules;\n        typedef MessagePassing<GmBpType, opengm::Integrator, UpdateRules, opengm::MaxDistance> BeliefPropagation;\n\n        const IndexType maxNumberOfIterations = 40;\n        const double convergenceBound = 1e-7;\n        const double damping = 0.5;\n        typename BeliefPropagation::Parameter weight(maxNumberOfIterations, convergenceBound, damping);\n\n        std::vector< std::vector<ValueType> > b  ( dataset_.getNumberOfModels(), std::vector<ValueType> ( dataset_.getModel(0).numberOfFactors()) );\n\n        for(IndexType m=0; m<dataset_.getNumberOfModels(); ++m){\n            GmBpType bpModel(dataset_.getModel(m).space());\n\n            for(IndexType f = 0; f<dataset_.getModel(m).numberOfFactors();++f){\n                const typename GMType::FactorType& factor=dataset_.getModel(m)[f];\n                typedef typename opengm::ViewConvertFunction<GMType,Minimizer,ValueType> ViewFunctionType;\n                typedef typename GMType::FunctionIdentifier FunctionIdentifierType;\n                FunctionIdentifierType fid = bpModel.addFunction(ViewFunctionType(factor));\n                bpModel.addFactor(fid, factor.variableIndicesBegin(), factor.variableIndicesEnd());\n            }\n            \/***********************************************************************************************************\/\n            \/\/ run: Loopy Belief Propagation\n            \/***********************************************************************************************************\/\n            BeliefPropagation bp(bpModel, weight);\n            const std::vector<typename INF::LabelType>& gt =  dataset_.getGT(m);\n            bp.infer();\n            typename GMType::IndependentFactorType marg;\n            for(IndexType f = 0; f<dataset_.getModel(m).numberOfFactors();++f){\n                bp.factorMarginal(f, marg);\n                std::vector<IndexType> indexVector( marg.variableIndicesBegin(), marg.variableIndicesEnd() );\n                std::vector<LabelType> labelVector( marg.numberOfVariables());\n                for(IndexType v=0; v<marg.numberOfVariables();++v)\n                    labelVector[v] = gt[indexVector[v]];\n                b[m][f] = marg(labelVector.begin());\n            }\n        }\n\n        \/***********************************************************************************************************\/\n        \/\/ Calculate Gradient\n        \/***********************************************************************************************************\/\n        std::vector<ValueType> sum(dataset_.getNumberOfWeights());\n        for(IndexType p=0; p<dataset_.getNumberOfWeights();++p){\n            std::vector< std::vector<ValueType> >\n                piW(dataset_.getNumberOfModels(),\n                    std::vector<ValueType> ( dataset_.getModel(0).numberOfFactors()));\n\n            for(IndexType m=0; m<dataset_.getNumberOfModels(); ++m){\n                const GMType &model = dataset_.getModel(m);\n                const std::vector<typename INF::LabelType>& gt =  dataset_.getGT(m);\n                ValueType f_x; \/\/ f^{d}_{C;k} ( x^d_C ) J. Kappes p. 64\n\n                for(IndexType f=0; f<dataset_.getModel(m).numberOfFactors();++f){\n                    const FactorType &factor = dataset_.getModel(m)[f];\n                    std::vector<IndexType> indexVector( factor.variableIndicesBegin(), factor.variableIndicesEnd() );\n                    std::vector<LabelType> labelVector( factor.numberOfVariables());\n                    piW[m][f]=1.0;\n\n                    for(IndexType v=0; v<factor.numberOfVariables();++v){\n                        labelVector[v] = gt[indexVector[v]];\n                        piW[m][f] *=w[m][indexVector[v]];\n                    }\n                    WeightGradientFunctor weightGradientFunctor(p, labelVector.begin());\n                    factor.callFunctor(weightGradientFunctor);\n                    f_x =weightGradientFunctor.result_;\n                    \/\/ ( ground truth - marginals ) * factorWeightGradient\n                    sum[p] += (b[m][f] - piW[m][f]) * f_x;\n                    \/\/ ( ground truth - marginals ) * factor\n                    optFun += b[m][f] - piW[m][f] * factor(labelVector.begin());\n                }\n            }\n        }\n        std::cout << \" loss = \" << loss << \" optFun = \" << optFun << std::endl;\n\n        if(loss<=bestLoss){\n            bestLoss=loss;\n            bestModelWeight=modelWeight;\n            bestOptFun=optFun;\n        }\n\n        if (count>=200 ){\n            search = false;\n        }else{\n            \/\/ Calculate the next point\n            ValueType norm2=0.0;\n            for(IndexType p=0; p<dataset_.getNumberOfWeights(); ++p){\n                gradient[p] = sum[p];\n                norm2 += gradient[p]*gradient[p];\n            }\n            norm2 = std::sqrt(norm2);\n            for(IndexType p=0; p<dataset_.getNumberOfWeights(); ++p){\n                point[p] += eta * gradient[p]\/norm2;\n                std::cout << \" gradient [\" << p << \"] = \" << gradient[p] << std::endl;\n            }\n            eta *= (ValueType)count\/(count+1);\n        }\n    } \/\/ end while search\n\n    std::cout <<std::endl<< \"Best weights: \";\n    for(IndexType p=0; p<dataset_.getNumberOfWeights(); ++p){\n        std::cout << bestModelWeight[p] <<\" \";\n    }\n    std::cout << \" ==> \";\n    std::cout << \" loss = \" << bestLoss << \" bestOptFun = \" << bestOptFun << std::endl;\n\n    modelWeights_ = bestModelWeight;\n};\n}\n}\n#endif\n\n\n<commit_msg>Change in eta.<commit_after>#pragma once\n#ifndef OPENGM_MAXIMUM_LIKELIHOOD_LEARNER_HXX\n#define OPENGM_MAXIMUM_LIKELIHOOD_LEARNER_HXX\n\n#include <vector>\n#include <opengm\/functions\/learnablefunction.hxx>\n#include <fstream>\n#include <opengm\/inference\/messagepassing\/messagepassing.hxx>\n#include <opengm\/functions\/explicit_function.hxx>\n#include <opengm\/functions\/view_convert_function.hxx>\n#include <opengm\/functions\/learnable\/lpotts.hxx>\n#include <opengm\/functions\/learnable\/sum_of_experts.hxx>\n#include <opengm\/graphicalmodel\/graphicalmodel.hxx>\n#include <opengm\/inference\/icm.hxx>\n\ntypedef double ValueType;\ntypedef size_t IndexType;\ntypedef size_t LabelType;\ntypedef opengm::meta::TypeListGenerator<\n    opengm::ExplicitFunction<ValueType,IndexType,LabelType>,\n    opengm::functions::learnable::LPotts<ValueType,IndexType,LabelType>,\n    opengm::functions::learnable::SumOfExperts<ValueType,IndexType,LabelType>\n>::type FunctionListType;\n\ntypedef opengm::GraphicalModel<\n    ValueType,opengm::Adder,\n    FunctionListType,\n    opengm::DiscreteSpace<IndexType,LabelType>\n> GM;\n\ntypedef opengm::ICM<GM,opengm::Minimizer> INF;\ntypedef opengm::learning::Weights<ValueType> WeightType;\n\nstruct WeightGradientFunctor{\n    WeightGradientFunctor(IndexType weight, std::vector<LabelType>::iterator labelVectorBegin)\n        : weight_(weight),\n          labelVectorBegin_(labelVectorBegin){\n    }\n\n    template<class F>\n    void operator()(const F & function ){\n        IndexType index=-1;\n        for(size_t i=0; i<function.numberOfWeights();++i)\n            if(function.weightIndex(i)==weight_)\n                index=i;\n        if(index!=-1)\n            result_ = function.weightGradient(index, labelVectorBegin_);\n        else\n            result_ = 0;\n    }\n\n    IndexType weight_;\n    std::vector<LabelType>::iterator labelVectorBegin_;\n    ValueType result_;\n};\n\nnamespace opengm {\nnamespace learning {\n\ntemplate<class DATASET, class LOSS>\nclass MaximumLikelihoodLearner\n{\npublic:\n    typedef typename DATASET::GMType   GMType;\n    typedef typename GMType::ValueType ValueType;\n    typedef typename GMType::IndexType IndexType;\n    typedef typename GMType::LabelType LabelType;\n    typedef typename GMType::FactorType FactorType;\n\n    class Weight{\n    public:\n        std::vector<double> weightUpperbound_;\n        std::vector<double> weightLowerbound_;\n        std::vector<IndexType> testingPoints_;\n        Weight(){;}\n    };\n\n\n    MaximumLikelihoodLearner(DATASET&, Weight& );\n\n    template<class INF>\n    void learn(typename INF::Parameter& weight);\n\n    const opengm::learning::Weights<ValueType>& getModelWeights(){return modelWeights_;}\n    Weight& getLerningWeights(){return weight_;}\n\nprivate:\n    DATASET& dataset_;\n    opengm::learning::Weights<ValueType> modelWeights_;\n    Weight weight_;\n};\n\ntemplate<class DATASET, class LOSS>\nMaximumLikelihoodLearner<DATASET, LOSS>::MaximumLikelihoodLearner(DATASET& ds, Weight& w )\n    : dataset_(ds), weight_(w)\n{\n    modelWeights_ = opengm::learning::Weights<ValueType>(ds.getNumberOfWeights());\n    if(weight_.weightUpperbound_.size() != ds.getNumberOfWeights())\n        weight_.weightUpperbound_.resize(ds.getNumberOfWeights(),10.0);\n    if(weight_.weightLowerbound_.size() != ds.getNumberOfWeights())\n        weight_.weightLowerbound_.resize(ds.getNumberOfWeights(),0.0);\n    if(weight_.testingPoints_.size() != ds.getNumberOfWeights())\n        weight_.testingPoints_.resize(ds.getNumberOfWeights(),10);\n}\n\n\ntemplate<class DATASET, class LOSS>\ntemplate<class INF>\nvoid MaximumLikelihoodLearner<DATASET, LOSS>::learn(typename INF::Parameter& weight){\n\n    opengm::learning::Weights<ValueType> modelWeight( dataset_.getNumberOfWeights() );\n    opengm::learning::Weights<ValueType> bestModelWeight( dataset_.getNumberOfWeights() );\n    double bestLoss = 100000000.0;\n    std::vector<ValueType> point(dataset_.getNumberOfWeights(),0);\n    std::vector<ValueType> gradient(dataset_.getNumberOfWeights(),0);\n    std::vector<ValueType> Delta(dataset_.getNumberOfWeights(),0);\n    for(IndexType p=0; p<dataset_.getNumberOfWeights(); ++p)\n        point[p] = ValueType((weight_.weightUpperbound_[p]-weight_.weightLowerbound_[p])\/2);\n        \/\/point[p] = ValueType(weight_.weightUpperbound_[p]);\n        \/\/point[p] = ValueType(weight_.weightLowerbound_[p]);\n\n    LOSS lossFunction;\n    bool search=true;\n    int count=0;\n\n    std::vector< std::vector<ValueType> > w( dataset_.getNumberOfModels(), std::vector<ValueType> ( dataset_.getModel(0).numberOfVariables()) );\n\n    \/***********************************************************************************************************\/\n    \/\/ construct Ground Truth dependent weights\n    \/***********************************************************************************************************\/\n\n    for(IndexType m=0; m<dataset_.getNumberOfModels(); ++m){ \/\/ for each model\n        const GMType &model = dataset_.getModel(m);\n        const std::vector<typename INF::LabelType>& gt =  dataset_.getGT(m);\n\n        for(IndexType v=0; v<model.numberOfVariables();++v)\n            w[m][v]=(ValueType)gt[v];\n    }\n\n    ValueType eta = 0.1;\n    ValueType delta = 0.25; \/\/ 0 <= delta <= 0.5\n    ValueType D_a = 1.0; \/\/ distance treshold\n    ValueType optFunTmp, optFun, bestOptFun=0.0;\n\n    while(search){\n        ++count;\n        \/\/if (count % 1000 == 0)\n        std::cout << \"---count--->\" << count << \"     \";\n\n        \/\/ Get Weights\n        for(IndexType p=0; p<dataset_.getNumberOfWeights(); ++p){\n            modelWeight.setWeight(p, point[p]);\n        }\n\n        \/***********************************************************************************************************\/\n        \/\/ calculate current loss - not needed\n        \/***********************************************************************************************************\/\n        opengm::learning::Weights<ValueType>& mp =  dataset_.getWeights();\n        mp = modelWeight;\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),weight);\n           inf.infer();\n           inf.arg(confs[m]);\n           const std::vector<typename INF::LabelType>& gt =  dataset_.getGT(m);\n           loss += lossFunction.loss(confs[m].begin(), confs[m].end(), gt.begin(), gt.end());\n        }\n\n        std::cout << \" eta = \" << eta << \"   weights  \";\/\/<< std::endl;\n        for(IndexType p=0; p<dataset_.getNumberOfWeights(); ++p){\n            std::cout << modelWeight[p] << \" \" ;\n        }\n\n        optFun=0.0;\n        optFunTmp=0.0;\n\n        \/***********************************************************************************************************\/\n        \/\/ Loopy Belief Propagation setup\n        \/***********************************************************************************************************\/\n        typedef typename opengm::ExplicitFunction<ValueType,IndexType,LabelType> FunctionType;\n        typedef typename opengm::ViewConvertFunction<GMType,Minimizer,ValueType> ViewFunctionType;\n        typedef typename GMType::FunctionIdentifier FunctionIdentifierType;\n        typedef typename opengm::meta::TypeListGenerator<FunctionType,ViewFunctionType>::type FunctionListType;\n        typedef opengm::GraphicalModel<ValueType,opengm::Multiplier, FunctionListType, opengm::DiscreteSpace<IndexType,LabelType> > GmBpType;\n        typedef BeliefPropagationUpdateRules<GmBpType, opengm::Integrator> UpdateRules;\n        typedef MessagePassing<GmBpType, opengm::Integrator, UpdateRules, opengm::MaxDistance> BeliefPropagation;\n\n        const IndexType maxNumberOfIterations = 40;\n        const double convergenceBound = 1e-7;\n        const double damping = 0.5;\n        typename BeliefPropagation::Parameter weight(maxNumberOfIterations, convergenceBound, damping);\n\n        std::vector< std::vector<ValueType> > b  ( dataset_.getNumberOfModels(), std::vector<ValueType> ( dataset_.getModel(0).numberOfFactors()) );\n\n        for(IndexType m=0; m<dataset_.getNumberOfModels(); ++m){\n            GmBpType bpModel(dataset_.getModel(m).space());\n\n            for(IndexType f = 0; f<dataset_.getModel(m).numberOfFactors();++f){\n                const typename GMType::FactorType& factor=dataset_.getModel(m)[f];\n                typedef typename opengm::ViewConvertFunction<GMType,Minimizer,ValueType> ViewFunctionType;\n                typedef typename GMType::FunctionIdentifier FunctionIdentifierType;\n                FunctionIdentifierType fid = bpModel.addFunction(ViewFunctionType(factor));\n                bpModel.addFactor(fid, factor.variableIndicesBegin(), factor.variableIndicesEnd());\n            }\n            \/***********************************************************************************************************\/\n            \/\/ run: Loopy Belief Propagation\n            \/***********************************************************************************************************\/\n            BeliefPropagation bp(bpModel, weight);\n            const std::vector<typename INF::LabelType>& gt =  dataset_.getGT(m);\n            bp.infer();\n            typename GMType::IndependentFactorType marg;\n            for(IndexType f = 0; f<dataset_.getModel(m).numberOfFactors();++f){\n                bp.factorMarginal(f, marg);\n                std::vector<IndexType> indexVector( marg.variableIndicesBegin(), marg.variableIndicesEnd() );\n                std::vector<LabelType> labelVector( marg.numberOfVariables());\n                for(IndexType v=0; v<marg.numberOfVariables();++v)\n                    labelVector[v] = gt[indexVector[v]];\n                b[m][f] = marg(labelVector.begin());\n            }\n        }\n\n        \/***********************************************************************************************************\/\n        \/\/ Calculate Gradient\n        \/***********************************************************************************************************\/\n        std::vector<ValueType> sum(dataset_.getNumberOfWeights());\n        for(IndexType p=0; p<dataset_.getNumberOfWeights();++p){\n            std::vector< std::vector<ValueType> >\n                piW(dataset_.getNumberOfModels(),\n                    std::vector<ValueType> ( dataset_.getModel(0).numberOfFactors()));\n\n            for(IndexType m=0; m<dataset_.getNumberOfModels(); ++m){\n                const GMType &model = dataset_.getModel(m);\n                const std::vector<typename INF::LabelType>& gt =  dataset_.getGT(m);\n                ValueType f_x; \/\/ f^{d}_{C;k} ( x^d_C ) J. Kappes p. 64\n\n                for(IndexType f=0; f<dataset_.getModel(m).numberOfFactors();++f){\n                    const FactorType &factor = dataset_.getModel(m)[f];\n                    std::vector<IndexType> indexVector( factor.variableIndicesBegin(), factor.variableIndicesEnd() );\n                    std::vector<LabelType> labelVector( factor.numberOfVariables());\n                    piW[m][f]=1.0;\n\n                    for(IndexType v=0; v<factor.numberOfVariables();++v){\n                        labelVector[v] = gt[indexVector[v]];\n                        piW[m][f] *=w[m][indexVector[v]];\n                    }\n                    WeightGradientFunctor weightGradientFunctor(p, labelVector.begin());\n                    factor.callFunctor(weightGradientFunctor);\n                    f_x =weightGradientFunctor.result_;\n                    \/\/ ( ground truth - marginals ) * factorWeightGradient\n                    sum[p] += (b[m][f] - piW[m][f]) * f_x;\n                    \/\/ ( ground truth - marginals ) * factor\n                    optFun += b[m][f] - piW[m][f] * factor(labelVector.begin());\n                    optFunTmp += (b[m][f] - piW[m][f]) * factor(labelVector.begin());\n                }\n            }\n        }\n        std::cout << \" loss = \" << loss << \" optFun = \" << optFun << \" optFunTmp = \" << optFunTmp << std::endl;\n\n        if(loss<=bestLoss){\n            bestLoss=loss;\n            bestModelWeight=modelWeight;\n            bestOptFun=optFun;\n        }\n\n        if (count>=200 ){\n            search = false;\n        }else{\n            \/\/ Calculate the next point\n            ValueType norm2=0.0;\n            for(IndexType p=0; p<dataset_.getNumberOfWeights(); ++p){\n                gradient[p] = sum[p];\n                norm2 += gradient[p]*gradient[p];\n            }\n            norm2 = std::sqrt(norm2);\n            for(IndexType p=0; p<dataset_.getNumberOfWeights(); ++p){\n                point[p] += eta * gradient[p]\/norm2;\n                std::cout << \" gradient [\" << p << \"] = \" << gradient[p] << std::endl;\n            }\n            eta *= (ValueType)count\/(count+1);\n        }\n    } \/\/ end while search\n\n    std::cout <<std::endl<< \"Best weights: \";\n    for(IndexType p=0; p<dataset_.getNumberOfWeights(); ++p){\n        std::cout << bestModelWeight[p] <<\" \";\n    }\n    std::cout << \" ==> \";\n    std::cout << \" loss = \" << bestLoss << \" bestOptFun = \" << bestOptFun << std::endl;\n\n    modelWeights_ = bestModelWeight;\n};\n}\n}\n#endif\n\n\n<|endoftext|>"}
{"text":"<commit_before>\n#ifndef _config_ctor_hpp\n#define _config_ctor_hpp\n\n#include <cstdint>\n#include <string>\n#include <iosfwd>\n\n#include <boost\/property_tree\/ptree.hpp>\n#include <boost\/property_tree\/ini_parser.hpp>\n#include <boost\/property_tree\/json_parser.hpp>\n#include <boost\/property_tree\/info_parser.hpp>\n#include <boost\/property_tree\/xml_parser.hpp>\n\n#include <boost\/preprocessor\/cat.hpp>\n#include <boost\/preprocessor\/comparison\/greater_equal.hpp>\n#include <boost\/preprocessor\/control\/if.hpp>\n#include <boost\/preprocessor\/stringize.hpp>\n#include <boost\/preprocessor\/punctuation\/comma_if.hpp>\n#include <boost\/preprocessor\/seq\/for_each_i.hpp>\n#include <boost\/preprocessor\/tuple\/size.hpp>\n#include <boost\/preprocessor\/tuple\/elem.hpp>\n\n\/***************************************************************************\/\n\nnamespace construct_config {\nnamespace {\n\n\/\/ for other types (strings)\ntemplate<bool ok>\nstruct get_concrete_value {\n\ttemplate<typename T>\n\tstatic T get(const char *key, const boost::property_tree::ptree &ini, const char *default_value) {\n\t\treturn default_value != nullptr\n\t\t\t? ini.get<T>(key, default_value)\n\t\t\t: ini.get<T>(key)\n\t\t;\n\t}\n};\n\n\/\/ specialization for arithmetic types\ntemplate<>\nstruct get_concrete_value<true> {\n\ttemplate<typename T>\n\tstatic T get(const char *key, const boost::property_tree::ptree &ini, const char *default_value) {\n\t\t\/\/ handle bool types\n\t\tif ( std::is_same<T, bool>::value ) {\n\t\t\treturn default_value != nullptr\n\t\t\t\t? ini.get<bool>(key, (std::strcmp(default_value, \"true\") == 0))\n\t\t\t\t: ini.get<bool>(key)\n\t\t\t;\n\t\t}\n\n\t\t\/\/ handle other arithmetic types\n\t\tstd::string val = default_value != nullptr\n\t\t\t? ini.get<std::string>(key, default_value)\n\t\t\t: ini.get<std::string>(key)\n\t\t;\n\t\tif ( val.empty() ) return T{};\n\n\t\tif ( (std::is_signed<T>::value || std::is_unsigned<T>::value) && !std::is_floating_point<T>::value ) {\n\t\t\tstd::size_t mult = 1u;\n\t\t\tswitch ( val.back() ) {\n\t\t\t\tcase 'G': mult *= 1024u;\n\t\t\t\tcase 'M': mult *= 1024u;\n\t\t\t\tcase 'K': mult *= 1024u;\n\n\t\t\t\tval.pop_back();\n\t\t\t}\n\n\t\t\treturn (std::is_signed<T>::value ? std::stol(val) : std::stoul(val));\n\t\t}\n\n\t\treturn std::stod(val);\n\t}\n};\n\n} \/\/ anon ns\n\ntemplate<typename T>\nstatic T get_value(const char *key, const boost::property_tree::ptree &cfg, const char *default_value) {\n\tusing TT = typename std::remove_cv<T>::type;\n\treturn get_concrete_value<std::is_arithmetic<TT>::value>::template get<TT>(key, cfg, default_value);\n}\n\ntemplate<bool ok>\nstruct print_value {\n\ttemplate<typename T>\n\tstatic void print(const T &v, std::ostream &os) {\n\t\tos << '\\\"' << v << '\\\"';\n\t}\n};\n\ntemplate<>\nstruct print_value<true> {\n\ttemplate<typename T>\n\tstatic void print(const T &v, std::ostream &os) {\n\t\tos << std::boolalpha << v;\n\t}\n};\n\n} \/\/ ns construct_config\n\n\/***************************************************************************\/\n\n#define _CONSTRUCT_CONFIG__WRAP_SEQUENCE_X(...) \\\n\t((__VA_ARGS__)) _CONSTRUCT_CONFIG__WRAP_SEQUENCE_Y\n#define _CONSTRUCT_CONFIG__WRAP_SEQUENCE_Y(...) \\\n\t((__VA_ARGS__)) _CONSTRUCT_CONFIG__WRAP_SEQUENCE_X\n\n#define _CONSTRUCT_CONFIG__WRAP_SEQUENCE_X0\n#define _CONSTRUCT_CONFIG__WRAP_SEQUENCE_Y0\n\n\/***************************************************************************\/\n\n#define _CONSTRUCT_CONFIG__GENERATE_MEMBERS(unused, data, idx, elem) \\\n\tBOOST_PP_TUPLE_ELEM(0, elem) \/* type *\/ BOOST_PP_TUPLE_ELEM(1, elem) \/* var name *\/ ;\n\n#define _CONSTRUCT_CONFIG__INIT_MEMBERS_WITH_DEFAULT(...) \\\n\t,BOOST_PP_STRINGIZE(BOOST_PP_TUPLE_ELEM(2, __VA_ARGS__))\n\n#define _CONSTRUCT_CONFIG__INIT_MEMBERS_WITHOUT_DEFAULT(...) \\\n\t,nullptr\n\n#define _CONSTRUCT_CONFIG__INIT_MEMBERS(unused, data, idx, elem) \\\n\tBOOST_PP_COMMA_IF(idx) \\\n\t\t::construct_config::get_value<BOOST_PP_TUPLE_ELEM(0, elem)>( \\\n\t\t\t BOOST_PP_STRINGIZE(BOOST_PP_TUPLE_ELEM(1, elem)) \\\n\t\t\t,cfg \\\n\t\t\tBOOST_PP_IF( \\\n\t\t\t\t BOOST_PP_GREATER_EQUAL(BOOST_PP_TUPLE_SIZE(elem), 3) \\\n\t\t\t\t,_CONSTRUCT_CONFIG__INIT_MEMBERS_WITH_DEFAULT \\\n\t\t\t\t,_CONSTRUCT_CONFIG__INIT_MEMBERS_WITHOUT_DEFAULT \\\n\t\t\t)(elem) \\\n\t\t)\n\n#define _CONSTRUCT_CONFIG__ENUM_MEMBERS(unused, data, idx, elem) \\\n\tos << BOOST_PP_STRINGIZE(BOOST_PP_TUPLE_ELEM(1, elem)) \"=\"; \\\n\t::construct_config::print_value< \\\n\t\tstd::is_arithmetic<decltype(BOOST_PP_TUPLE_ELEM(1, elem))>::value \\\n\t>::print(BOOST_PP_TUPLE_ELEM(1, elem), os); \\\n\tos << std::endl;\n\n\/***************************************************************************\/\n\n#define _CONSTRUCT_CONFIG__ENUM_WRITE_MEMBERS(unused, data, idx, elem) \\\n\tptree.put(BOOST_PP_STRINGIZE(BOOST_PP_TUPLE_ELEM(1, elem)), cfg.BOOST_PP_TUPLE_ELEM(1, elem));\n\n\/***************************************************************************\/\n\n#define _CONSTRUCT_CONFIG__GENERATE_STRUCT(fmt, name, seq) \\\n\tstruct name { \\\n\t\tBOOST_PP_SEQ_FOR_EACH_I( \\\n\t\t\t _CONSTRUCT_CONFIG__GENERATE_MEMBERS \\\n\t\t\t,~ \\\n\t\t\t,seq \\\n\t\t) \\\n\t\t\\\n\t\tstatic name read(std::istream &is) { \\\n\t\t\tboost::property_tree::ptree cfg; \\\n\t\t\tboost::property_tree::read_##fmt(is, cfg); \\\n\t\t\t\\\n\t\t\treturn { \\\n\t\t\t\tBOOST_PP_SEQ_FOR_EACH_I( \\\n\t\t\t\t\t _CONSTRUCT_CONFIG__INIT_MEMBERS \\\n\t\t\t\t\t,~ \\\n\t\t\t\t\t,seq \\\n\t\t\t\t) \\\n\t\t\t}; \\\n\t\t} \\\n\t\tstatic name read(const std::string &fname) { \\\n\t\t\tboost::property_tree::ptree cfg; \\\n\t\t\tboost::property_tree::read_##fmt(fname, cfg); \\\n\t\t\t\\\n\t\t\treturn { \\\n\t\t\t\tBOOST_PP_SEQ_FOR_EACH_I( \\\n\t\t\t\t\t _CONSTRUCT_CONFIG__INIT_MEMBERS \\\n\t\t\t\t\t,~ \\\n\t\t\t\t\t,seq \\\n\t\t\t\t) \\\n\t\t\t}; \\\n\t\t} \\\n\t\t\\\n\t\tstatic void write(const std::string &fname, const name &cfg) { \\\n\t\t\tboost::property_tree::ptree ptree; \\\n\t\t\tBOOST_PP_SEQ_FOR_EACH_I( \\\n\t\t\t\t _CONSTRUCT_CONFIG__ENUM_WRITE_MEMBERS \\\n\t\t\t\t,~ \\\n\t\t\t\t,seq \\\n\t\t\t) \\\n\t\t\tboost::property_tree::write_##fmt(fname, ptree); \\\n\t\t} \\\n\t\tstatic void write(std::ostream &os, const name &cfg) { \\\n\t\t\tboost::property_tree::ptree ptree; \\\n\t\t\tBOOST_PP_SEQ_FOR_EACH_I( \\\n\t\t\t\t _CONSTRUCT_CONFIG__ENUM_WRITE_MEMBERS \\\n\t\t\t\t,~ \\\n\t\t\t\t,seq \\\n\t\t\t) \\\n\t\t\tboost::property_tree::write_##fmt(os, ptree); \\\n\t\t} \\\n\t\t\\\n\t\tvoid dump(std::ostream &os) const { \\\n\t\t\tBOOST_PP_SEQ_FOR_EACH_I( \\\n\t\t\t\t _CONSTRUCT_CONFIG__ENUM_MEMBERS \\\n\t\t\t\t,~ \\\n\t\t\t\t,seq \\\n\t\t\t) \\\n\t\t} \\\n\t};\n\n\/***************************************************************************\/\n\n#define CONSTRUCT_CONFIG( \\\n\t fmt  \/* config file format *\/ \\\n\t,name \/* config struct name *\/ \\\n\t,seq  \/* sequence of vars *\/ \\\n) \\\n\t_CONSTRUCT_CONFIG__GENERATE_STRUCT( \\\n\t\t fmt \\\n\t\t,name \\\n\t\t,BOOST_PP_CAT(_CONSTRUCT_CONFIG__WRAP_SEQUENCE_X seq, 0) \\\n\t)\n\n#define CONSTRUCT_INI_CONFIG(name, seq) \\\n\tCONSTRUCT_CONFIG(ini, name, seq)\n\n#define CONSTRUCT_JSON_CONFIG(name, seq) \\\n\tCONSTRUCT_CONFIG(json, name, seq)\n\n#define CONSTRUCT_XML_CONFIG(name, seq) \\\n\tCONSTRUCT_CONFIG(xml, name, seq)\n\n#define CONSTRUCT_INFO_CONFIG(name, seq) \\\n\tCONSTRUCT_CONFIG(info, name, seq)\n\n\/***************************************************************************\/\n\n#endif \/\/ _config_ctor_hpp\n<commit_msg>Update config-ctor.hpp<commit_after>\n#ifndef _config_ctor_hpp\n#define _config_ctor_hpp\n\n#include <cstdint>\n#include <string>\n#include <iosfwd>\n\n#include <boost\/property_tree\/ptree.hpp>\n#include <boost\/property_tree\/ini_parser.hpp>\n#include <boost\/property_tree\/json_parser.hpp>\n#include <boost\/property_tree\/info_parser.hpp>\n#include <boost\/property_tree\/xml_parser.hpp>\n\n#include <boost\/preprocessor\/cat.hpp>\n#include <boost\/preprocessor\/comparison\/greater_equal.hpp>\n#include <boost\/preprocessor\/control\/if.hpp>\n#include <boost\/preprocessor\/stringize.hpp>\n#include <boost\/preprocessor\/punctuation\/comma_if.hpp>\n#include <boost\/preprocessor\/seq\/for_each_i.hpp>\n#include <boost\/preprocessor\/tuple\/size.hpp>\n#include <boost\/preprocessor\/tuple\/elem.hpp>\n\n\/***************************************************************************\/\n\nnamespace construct_config {\nnamespace {\n\n\/\/ for other types (strings)\ntemplate<bool ok>\nstruct get_concrete_value {\n\ttemplate<typename T>\n\tstatic T get(const char *key, const boost::property_tree::ptree &ini, const char *default_value) {\n\t\treturn default_value != nullptr\n\t\t\t? ini.get<T>(key, default_value)\n\t\t\t: ini.get<T>(key)\n\t\t;\n\t}\n};\n\n\/\/ specialization for arithmetic types\ntemplate<>\nstruct get_concrete_value<true> {\n\ttemplate<typename T>\n\tstatic T get(const char *key, const boost::property_tree::ptree &ini, const char *default_value) {\n\t\t\/\/ handle bool types\n\t\tif ( std::is_same<T, bool>::value ) {\n\t\t\treturn default_value != nullptr\n\t\t\t\t? ini.get<bool>(key, (std::strcmp(default_value, \"true\") == 0))\n\t\t\t\t: ini.get<bool>(key)\n\t\t\t;\n\t\t}\n\n\t\t\/\/ handle other arithmetic types\n\t\tstd::string val = default_value != nullptr\n\t\t\t? ini.get<std::string>(key, default_value)\n\t\t\t: ini.get<std::string>(key)\n\t\t;\n\t\tif ( val.empty() ) return T{};\n\n\t\tif ( (std::is_signed<T>::value || std::is_unsigned<T>::value) && !std::is_floating_point<T>::value ) {\n\t\t\tstd::size_t mult = 1u;\n\t\t\tswitch ( val.back() ) {\n\t\t\t\tcase 'G': mult *= 1024u;\n\t\t\t\tcase 'M': mult *= 1024u;\n\t\t\t\tcase 'K': mult *= 1024u;\n\n\t\t\t\tval.pop_back();\n\t\t\t}\n\n\t\t\treturn (std::is_signed<T>::value ? std::stol(val) : std::stoul(val)) * mult;\n\t\t}\n\n\t\treturn std::stod(val);\n\t}\n};\n\n} \/\/ anon ns\n\ntemplate<typename T>\nstatic T get_value(const char *key, const boost::property_tree::ptree &cfg, const char *default_value) {\n\tusing TT = typename std::remove_cv<T>::type;\n\treturn get_concrete_value<std::is_arithmetic<TT>::value>::template get<TT>(key, cfg, default_value);\n}\n\ntemplate<bool ok>\nstruct print_value {\n\ttemplate<typename T>\n\tstatic void print(const T &v, std::ostream &os) {\n\t\tos << '\\\"' << v << '\\\"';\n\t}\n};\n\ntemplate<>\nstruct print_value<true> {\n\ttemplate<typename T>\n\tstatic void print(const T &v, std::ostream &os) {\n\t\tos << std::boolalpha << v;\n\t}\n};\n\n} \/\/ ns construct_config\n\n\/***************************************************************************\/\n\n#define _CONSTRUCT_CONFIG__WRAP_SEQUENCE_X(...) \\\n\t((__VA_ARGS__)) _CONSTRUCT_CONFIG__WRAP_SEQUENCE_Y\n#define _CONSTRUCT_CONFIG__WRAP_SEQUENCE_Y(...) \\\n\t((__VA_ARGS__)) _CONSTRUCT_CONFIG__WRAP_SEQUENCE_X\n\n#define _CONSTRUCT_CONFIG__WRAP_SEQUENCE_X0\n#define _CONSTRUCT_CONFIG__WRAP_SEQUENCE_Y0\n\n\/***************************************************************************\/\n\n#define _CONSTRUCT_CONFIG__GENERATE_MEMBERS(unused, data, idx, elem) \\\n\tBOOST_PP_TUPLE_ELEM(0, elem) \/* type *\/ BOOST_PP_TUPLE_ELEM(1, elem) \/* var name *\/ ;\n\n#define _CONSTRUCT_CONFIG__INIT_MEMBERS_WITH_DEFAULT(...) \\\n\t,BOOST_PP_STRINGIZE(BOOST_PP_TUPLE_ELEM(2, __VA_ARGS__))\n\n#define _CONSTRUCT_CONFIG__INIT_MEMBERS_WITHOUT_DEFAULT(...) \\\n\t,nullptr\n\n#define _CONSTRUCT_CONFIG__INIT_MEMBERS(unused, data, idx, elem) \\\n\tBOOST_PP_COMMA_IF(idx) \\\n\t\t::construct_config::get_value<BOOST_PP_TUPLE_ELEM(0, elem)>( \\\n\t\t\t BOOST_PP_STRINGIZE(BOOST_PP_TUPLE_ELEM(1, elem)) \\\n\t\t\t,cfg \\\n\t\t\tBOOST_PP_IF( \\\n\t\t\t\t BOOST_PP_GREATER_EQUAL(BOOST_PP_TUPLE_SIZE(elem), 3) \\\n\t\t\t\t,_CONSTRUCT_CONFIG__INIT_MEMBERS_WITH_DEFAULT \\\n\t\t\t\t,_CONSTRUCT_CONFIG__INIT_MEMBERS_WITHOUT_DEFAULT \\\n\t\t\t)(elem) \\\n\t\t)\n\n#define _CONSTRUCT_CONFIG__ENUM_MEMBERS(unused, data, idx, elem) \\\n\tos << BOOST_PP_STRINGIZE(BOOST_PP_TUPLE_ELEM(1, elem)) \"=\"; \\\n\t::construct_config::print_value< \\\n\t\tstd::is_arithmetic<decltype(BOOST_PP_TUPLE_ELEM(1, elem))>::value \\\n\t>::print(BOOST_PP_TUPLE_ELEM(1, elem), os); \\\n\tos << std::endl;\n\n\/***************************************************************************\/\n\n#define _CONSTRUCT_CONFIG__ENUM_WRITE_MEMBERS(unused, data, idx, elem) \\\n\tptree.put(BOOST_PP_STRINGIZE(BOOST_PP_TUPLE_ELEM(1, elem)), cfg.BOOST_PP_TUPLE_ELEM(1, elem));\n\n\/***************************************************************************\/\n\n#define _CONSTRUCT_CONFIG__GENERATE_STRUCT(fmt, name, seq) \\\n\tstruct name { \\\n\t\tBOOST_PP_SEQ_FOR_EACH_I( \\\n\t\t\t _CONSTRUCT_CONFIG__GENERATE_MEMBERS \\\n\t\t\t,~ \\\n\t\t\t,seq \\\n\t\t) \\\n\t\t\\\n\t\tstatic name read(std::istream &is) { \\\n\t\t\tboost::property_tree::ptree cfg; \\\n\t\t\tboost::property_tree::read_##fmt(is, cfg); \\\n\t\t\t\\\n\t\t\treturn { \\\n\t\t\t\tBOOST_PP_SEQ_FOR_EACH_I( \\\n\t\t\t\t\t _CONSTRUCT_CONFIG__INIT_MEMBERS \\\n\t\t\t\t\t,~ \\\n\t\t\t\t\t,seq \\\n\t\t\t\t) \\\n\t\t\t}; \\\n\t\t} \\\n\t\tstatic name read(const std::string &fname) { \\\n\t\t\tboost::property_tree::ptree cfg; \\\n\t\t\tboost::property_tree::read_##fmt(fname, cfg); \\\n\t\t\t\\\n\t\t\treturn { \\\n\t\t\t\tBOOST_PP_SEQ_FOR_EACH_I( \\\n\t\t\t\t\t _CONSTRUCT_CONFIG__INIT_MEMBERS \\\n\t\t\t\t\t,~ \\\n\t\t\t\t\t,seq \\\n\t\t\t\t) \\\n\t\t\t}; \\\n\t\t} \\\n\t\t\\\n\t\tstatic void write(const std::string &fname, const name &cfg) { \\\n\t\t\tboost::property_tree::ptree ptree; \\\n\t\t\tBOOST_PP_SEQ_FOR_EACH_I( \\\n\t\t\t\t _CONSTRUCT_CONFIG__ENUM_WRITE_MEMBERS \\\n\t\t\t\t,~ \\\n\t\t\t\t,seq \\\n\t\t\t) \\\n\t\t\tboost::property_tree::write_##fmt(fname, ptree); \\\n\t\t} \\\n\t\tstatic void write(std::ostream &os, const name &cfg) { \\\n\t\t\tboost::property_tree::ptree ptree; \\\n\t\t\tBOOST_PP_SEQ_FOR_EACH_I( \\\n\t\t\t\t _CONSTRUCT_CONFIG__ENUM_WRITE_MEMBERS \\\n\t\t\t\t,~ \\\n\t\t\t\t,seq \\\n\t\t\t) \\\n\t\t\tboost::property_tree::write_##fmt(os, ptree); \\\n\t\t} \\\n\t\t\\\n\t\tvoid dump(std::ostream &os) const { \\\n\t\t\tBOOST_PP_SEQ_FOR_EACH_I( \\\n\t\t\t\t _CONSTRUCT_CONFIG__ENUM_MEMBERS \\\n\t\t\t\t,~ \\\n\t\t\t\t,seq \\\n\t\t\t) \\\n\t\t} \\\n\t};\n\n\/***************************************************************************\/\n\n#define CONSTRUCT_CONFIG( \\\n\t fmt  \/* config file format *\/ \\\n\t,name \/* config struct name *\/ \\\n\t,seq  \/* sequence of vars *\/ \\\n) \\\n\t_CONSTRUCT_CONFIG__GENERATE_STRUCT( \\\n\t\t fmt \\\n\t\t,name \\\n\t\t,BOOST_PP_CAT(_CONSTRUCT_CONFIG__WRAP_SEQUENCE_X seq, 0) \\\n\t)\n\n#define CONSTRUCT_INI_CONFIG(name, seq) \\\n\tCONSTRUCT_CONFIG(ini, name, seq)\n\n#define CONSTRUCT_JSON_CONFIG(name, seq) \\\n\tCONSTRUCT_CONFIG(json, name, seq)\n\n#define CONSTRUCT_XML_CONFIG(name, seq) \\\n\tCONSTRUCT_CONFIG(xml, name, seq)\n\n#define CONSTRUCT_INFO_CONFIG(name, seq) \\\n\tCONSTRUCT_CONFIG(info, name, seq)\n\n\/***************************************************************************\/\n\n#endif \/\/ _config_ctor_hpp\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 <distributions\/common.hpp>\n#include <distributions\/special.hpp>\n#include <distributions\/random.hpp>\n#include <distributions\/vector.hpp>\n#include <distributions\/vector_math.hpp>\n\nnamespace distributions\n{\n\ntemplate<int max_dim>\nstruct DirichletDiscrete\n{\n\nstatic const char * name () { return \"DirichletDiscrete\"; }\nstatic const char * short_name () { return \"dd\"; }\n\n\/\/----------------------------------------------------------------------------\n\/\/ Data\n\nint dim;  \/\/ fixed parameter\nfloat alphas[max_dim];  \/\/ hyperparamter\n\n\/\/----------------------------------------------------------------------------\n\/\/ Datatypes\n\ntypedef uint32_t count_t;\n\ntypedef int Value;\n\nstruct Group\n{\n    count_t count_sum;\n    count_t counts[max_dim];\n};\n\nstruct Sampler\n{\n    float ps[max_dim];\n};\n\nstruct Scorer\n{\n    float alpha_sum;\n    float alphas[max_dim];\n};\n\nstruct Classifier\n{\n    std::vector<Group> groups;\n    float alpha_sum;\n    std::vector<VectorFloat> scores;\n    VectorFloat scores_shift;\n};\n\nclass Fitter\n{\n    std::vector<Group> groups;\n    VectorFloat scores;\n};\n\n\/\/----------------------------------------------------------------------------\n\/\/ Mutation\n\nvoid group_init (\n        Group & group,\n        rng_t &) const\n{\n    group.count_sum = 0;\n    for (Value value = 0; value < dim; ++value) {\n        group.counts[value] = 0;\n    }\n}\n\nvoid group_add_value (\n        Group & group,\n        const Value & value,\n        rng_t &) const\n{\n    DIST_ASSERT1(value < dim, \"value out of bounds\");\n    group.count_sum += 1;\n    group.counts[value] += 1;\n}\n\nvoid group_remove_value (\n        Group & group,\n        const Value & value,\n        rng_t &) const\n{\n    DIST_ASSERT1(value < dim, \"value out of bounds\");\n    group.count_sum -= 1;\n    group.counts[value] -= 1;\n}\n\nvoid group_merge (\n        Group & destin,\n        const Group & source,\n        rng_t &) const\n{\n    DIST_ASSERT1(& destin != & source, \"cannot merge with self\");\n    for (Value value = 0; value < dim; ++value) {\n        destin.counts[value] += source.counts[value];\n    }\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ Sampling\n\nvoid sampler_init (\n        Sampler & sampler,\n        const Group & group,\n        rng_t & rng) const\n{\n    for (Value value = 0; value < dim; ++value) {\n        sampler.ps[value] = alphas[value] + group.counts[value];\n    }\n\n    sample_dirichlet(rng, dim, sampler.ps, sampler.ps);\n}\n\nValue sampler_eval (\n        const Sampler & sampler,\n        rng_t & rng) const\n{\n    return sample_discrete(rng, dim, sampler.ps);\n}\n\nValue sample_value (\n        const Group & group,\n        rng_t & rng) const\n{\n    Sampler sampler;\n    sampler_init(sampler, group, rng);\n    return sampler_eval(sampler, rng);\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ Scoring\n\nvoid scorer_init (\n        Scorer & scorer,\n        const Group & group,\n        rng_t &) const\n{\n    float alpha_sum = 0;\n    for (Value value = 0; value < dim; ++value) {\n        float alpha = alphas[value] + group.counts[value];\n        scorer.alphas[value] = alpha;\n        alpha_sum += alpha;\n    }\n    scorer.alpha_sum = alpha_sum;\n}\n\nfloat scorer_eval (\n        const Scorer & scorer,\n        const Value & value,\n        rng_t &) const\n{\n    DIST_ASSERT1(value < dim, \"value out of bounds\");\n    return fast_log(scorer.alphas[value] \/ scorer.alpha_sum);\n}\n\nfloat score_value (\n        const Group & group,\n        const Value & value,\n        rng_t & rng) const\n{\n    DIST_ASSERT1(value < dim, \"value out of bounds\");\n    Scorer scorer;\n    scorer_init(scorer, group, rng);\n    return scorer_eval(scorer, value, rng);\n}\n\nfloat score_group (\n        const Group & group,\n        rng_t &) const\n{\n    float alpha_sum = 0;\n    float score = 0;\n\n    for (Value value = 0; value < dim; ++value) {\n        float alpha = alphas[value];\n        alpha_sum += alpha;\n        score += fast_lgamma(alpha + group.counts[value]) - fast_lgamma(alpha);\n    }\n\n    score += fast_lgamma(alpha_sum) - fast_lgamma(alpha_sum + group.count_sum);\n\n    return score;\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ Classification\n\nvoid classifier_init (\n        Classifier & classifier,\n        rng_t &) const\n{\n    const size_t group_count = classifier.groups.size();\n    classifier.scores_shift.resize(group_count);\n    classifier.alpha_sum = 0;\n    classifier.scores.resize(dim);\n    for (Value value = 0; value < dim; ++value) {\n        classifier.alpha_sum += alphas[value];\n        classifier.scores[value].resize(group_count);\n    }\n    for (size_t groupid = 0; groupid < group_count; ++groupid) {\n        const Group & group = classifier.groups[groupid];\n        for (Value value = 0; value < dim; ++value) {\n            classifier.scores[value][groupid] =\n                alphas[value] + group.counts[value];\n        }\n        classifier.scores_shift[groupid] =\n            classifier.alpha_sum + group.count_sum;\n    }\n    vector_log(group_count, classifier.scores_shift.data());\n    for (Value value = 0; value < dim; ++value) {\n        vector_log(group_count, classifier.scores[value].data());\n    }\n}\n\nvoid classifier_add_group (\n        Classifier & classifier,\n        rng_t & rng) const\n{\n    const size_t group_count = classifier.groups.size() + 1;\n    classifier.groups.resize(group_count);\n    group_init(classifier.groups.back(), rng);\n    classifier.scores_shift.resize(group_count, 0);\n    for (Value value = 0; value < dim; ++value) {\n        classifier.scores[value].resize(group_count, 0);\n    }\n}\n\nvoid classifier_remove_group (\n        Classifier & classifier,\n        size_t groupid) const\n{\n    const size_t group_count = classifier.groups.size() - 1;\n    if (groupid != group_count) {\n        std::swap(classifier.groups[groupid], classifier.groups.back());\n        classifier.scores_shift[groupid] = classifier.scores_shift.back();\n        for (Value value = 0; value < dim; ++value) {\n            VectorFloat & scores = classifier.scores[value];\n            scores[groupid] = scores.back();\n        }\n    }\n    classifier.groups.resize(group_count);\n    classifier.scores_shift.resize(group_count);\n    for (Value value = 0; value < dim; ++value) {\n        classifier.scores[value].resize(group_count);\n    }\n}\n\nvoid classifier_add_value (\n        Classifier & classifier,\n        size_t groupid,\n        const Value & value,\n        rng_t &) const\n{\n    DIST_ASSERT1(groupid < classifier.groups.size(), \"groupid out of bounds\");\n    DIST_ASSERT1(value < dim, \"value out of bounds\");\n    Group & group = classifier.groups[groupid];\n    count_t count_sum = group.count_sum += 1;\n    count_t count = group.counts[value] += 1;\n    classifier.scores[value][groupid] = fast_log(alphas[value] + count);\n    classifier.scores_shift[groupid] =\n        fast_log(classifier.alpha_sum + count_sum);\n}\n\nvoid classifier_remove_value (\n        Classifier & classifier,\n        size_t groupid,\n        const Value & value,\n        rng_t &) const\n{\n    DIST_ASSERT1(groupid < classifier.groups.size(), \"groupid out of bounds\");\n    DIST_ASSERT1(value < dim, \"value out of bounds\");\n    Group & group = classifier.groups[groupid];\n    count_t count_sum = group.count_sum -= 1;\n    count_t count = group.counts[value] -= 1;\n    classifier.scores[value][groupid] = fast_log(alphas[value] + count);\n    classifier.scores_shift[groupid] =\n        fast_log(classifier.alpha_sum + count_sum);\n}\n\nvoid classifier_score (\n        const Classifier & classifier,\n        const Value & value,\n        VectorFloat & scores_accum,\n        rng_t &) const\n{\n    DIST_ASSERT1(value < dim, \"value out of bounds\");\n    DIST_ASSERT2(\n        scores_accum.size() == classifier.groups.size(),\n        \"expected scores_accum.size() = \" << classifier.groups.size() <<\n        \", actual \" << scores_accum.size());\n    const size_t group_count = classifier.groups.size();\n    vector_add_subtract(\n        group_count,\n        scores_accum.data(),\n        classifier.scores[value].data(),\n        classifier.scores_shift.data());\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ Fitting\n\nvoid fitter_init (\n    Fitter & fitter) const\n{\n    const size_t group_count = fitter.groups.size();\n    const float alpha_sum = vector_sum(dim, alphas);\n    fitter.scores.resize(dim + 1);\n    for (Value value = 0; value < dim; ++value) {\n        vector_zero(fitter.scores[value].size(), fitter.scores[value].data());\n    }\n    float score_shift = 0;\n    for (size_t groupid = 0; groupid < group_count; ++groupid) {\n        const Group & group = fitter.groups[groupid];\n        for (Value value = 0; value < dim; ++value) {\n            float alpha = alphas[value];\n            fitter.scores[value] +=\n                fast_lgamma(alpha + group.counts[value]) - fast_lgamma(alpha);\n        }\n        score_shift +=\n            fast_lgamma(alpha_sum) - fast_lgamma(alpha_sum + group.count_sum);\n    }\n    fitter.scores.back() = score_shift;\n}\n\nvoid fitter_set_param_alpha (\n    Fitter & fitter,\n    Value value,\n    float alpha)\n{\n    DIST_ASSERT1(value < dim, \"value out of bounds\");\n\n    alphas[value] = alpha;\n\n    const size_t group_count = fitter.groups.size();\n    const float alpha_sum = vector_sum(dim, alphas);\n    float score = 0;\n    float score_shift = 0;\n    for (size_t groupid = 0; groupid < group_count; ++groupid) {\n        const Group & group = fitter.groups[groupid];\n        score += fast_lgamma(alpha + group.counts[value]) - fast_lgamma(alpha);\n        score_shift +=\n            fast_lgamma(alpha_sum) - fast_lgamma(alpha_sum + group.count_sum);\n    }\n    fitter.scores[value] = score;\n    fitter.scores.back() = score_shift;\n}\n\nfloat fitter_score (\n        Fitter & fitter) const\n{\n    return vector_sum(fitter.scores.size(), fitter.scores.data());\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ Examples\n\nstatic DirichletDiscrete<max_dim> EXAMPLE ();\n\n}; \/\/ struct DirichletDiscrete<max_dim>\n\ntemplate<int max_dim>\ninline DirichletDiscrete<max_dim> DirichletDiscrete<max_dim>::EXAMPLE ()\n{\n    DirichletDiscrete<max_dim> model;\n    model.dim = max_dim;\n    for (int i = 0; i < max_dim; ++i) {\n        model.alphas[i] = 0.5;\n    }\n    return model;\n}\n\n} \/\/ namespace distributions\n<commit_msg>Better error handling in protobuf parsing<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 <distributions\/common.hpp>\n#include <distributions\/special.hpp>\n#include <distributions\/random.hpp>\n#include <distributions\/vector.hpp>\n#include <distributions\/vector_math.hpp>\n\nnamespace distributions\n{\n\ntemplate<int max_dim>\nstruct DirichletDiscrete\n{\n\nstatic const char * name () { return \"DirichletDiscrete\"; }\nstatic const char * short_name () { return \"dd\"; }\n\n\/\/----------------------------------------------------------------------------\n\/\/ Data\n\nint dim;  \/\/ fixed parameter\nfloat alphas[max_dim];  \/\/ hyperparamter\n\n\/\/----------------------------------------------------------------------------\n\/\/ Datatypes\n\ntypedef uint32_t count_t;\n\ntypedef int Value;\n\nstruct Group\n{\n    count_t count_sum;\n    count_t counts[max_dim];\n};\n\nstruct Sampler\n{\n    float ps[max_dim];\n};\n\nstruct Scorer\n{\n    float alpha_sum;\n    float alphas[max_dim];\n};\n\nstruct Classifier\n{\n    std::vector<Group> groups;\n    float alpha_sum;\n    std::vector<VectorFloat> scores;\n    VectorFloat scores_shift;\n};\n\nclass Fitter\n{\n    std::vector<Group> groups;\n    VectorFloat scores;\n};\n\n\/\/----------------------------------------------------------------------------\n\/\/ Mutation\n\nvoid group_init (\n        Group & group,\n        rng_t &) const\n{\n    group.count_sum = 0;\n    for (Value value = 0; value < dim; ++value) {\n        group.counts[value] = 0;\n    }\n}\n\nvoid group_add_value (\n        Group & group,\n        const Value & value,\n        rng_t &) const\n{\n    DIST_ASSERT1(value < dim, \"value out of bounds: \" << value);\n    group.count_sum += 1;\n    group.counts[value] += 1;\n}\n\nvoid group_remove_value (\n        Group & group,\n        const Value & value,\n        rng_t &) const\n{\n    DIST_ASSERT1(value < dim, \"value out of bounds: \" << value);\n    group.count_sum -= 1;\n    group.counts[value] -= 1;\n}\n\nvoid group_merge (\n        Group & destin,\n        const Group & source,\n        rng_t &) const\n{\n    DIST_ASSERT1(& destin != & source, \"cannot merge with self\");\n    for (Value value = 0; value < dim; ++value) {\n        destin.counts[value] += source.counts[value];\n    }\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ Sampling\n\nvoid sampler_init (\n        Sampler & sampler,\n        const Group & group,\n        rng_t & rng) const\n{\n    for (Value value = 0; value < dim; ++value) {\n        sampler.ps[value] = alphas[value] + group.counts[value];\n    }\n\n    sample_dirichlet(rng, dim, sampler.ps, sampler.ps);\n}\n\nValue sampler_eval (\n        const Sampler & sampler,\n        rng_t & rng) const\n{\n    return sample_discrete(rng, dim, sampler.ps);\n}\n\nValue sample_value (\n        const Group & group,\n        rng_t & rng) const\n{\n    Sampler sampler;\n    sampler_init(sampler, group, rng);\n    return sampler_eval(sampler, rng);\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ Scoring\n\nvoid scorer_init (\n        Scorer & scorer,\n        const Group & group,\n        rng_t &) const\n{\n    float alpha_sum = 0;\n    for (Value value = 0; value < dim; ++value) {\n        float alpha = alphas[value] + group.counts[value];\n        scorer.alphas[value] = alpha;\n        alpha_sum += alpha;\n    }\n    scorer.alpha_sum = alpha_sum;\n}\n\nfloat scorer_eval (\n        const Scorer & scorer,\n        const Value & value,\n        rng_t &) const\n{\n    DIST_ASSERT1(value < dim, \"value out of bounds: \" << value);\n    return fast_log(scorer.alphas[value] \/ scorer.alpha_sum);\n}\n\nfloat score_value (\n        const Group & group,\n        const Value & value,\n        rng_t & rng) const\n{\n    DIST_ASSERT1(value < dim, \"value out of bounds: \" << value);\n    Scorer scorer;\n    scorer_init(scorer, group, rng);\n    return scorer_eval(scorer, value, rng);\n}\n\nfloat score_group (\n        const Group & group,\n        rng_t &) const\n{\n    float alpha_sum = 0;\n    float score = 0;\n\n    for (Value value = 0; value < dim; ++value) {\n        float alpha = alphas[value];\n        alpha_sum += alpha;\n        score += fast_lgamma(alpha + group.counts[value]) - fast_lgamma(alpha);\n    }\n\n    score += fast_lgamma(alpha_sum) - fast_lgamma(alpha_sum + group.count_sum);\n\n    return score;\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ Classification\n\nvoid classifier_init (\n        Classifier & classifier,\n        rng_t &) const\n{\n    const size_t group_count = classifier.groups.size();\n    classifier.scores_shift.resize(group_count);\n    classifier.alpha_sum = 0;\n    classifier.scores.resize(dim);\n    for (Value value = 0; value < dim; ++value) {\n        classifier.alpha_sum += alphas[value];\n        classifier.scores[value].resize(group_count);\n    }\n    for (size_t groupid = 0; groupid < group_count; ++groupid) {\n        const Group & group = classifier.groups[groupid];\n        for (Value value = 0; value < dim; ++value) {\n            classifier.scores[value][groupid] =\n                alphas[value] + group.counts[value];\n        }\n        classifier.scores_shift[groupid] =\n            classifier.alpha_sum + group.count_sum;\n    }\n    vector_log(group_count, classifier.scores_shift.data());\n    for (Value value = 0; value < dim; ++value) {\n        vector_log(group_count, classifier.scores[value].data());\n    }\n}\n\nvoid classifier_add_group (\n        Classifier & classifier,\n        rng_t & rng) const\n{\n    const size_t group_count = classifier.groups.size() + 1;\n    classifier.groups.resize(group_count);\n    group_init(classifier.groups.back(), rng);\n    classifier.scores_shift.resize(group_count, 0);\n    for (Value value = 0; value < dim; ++value) {\n        classifier.scores[value].resize(group_count, 0);\n    }\n}\n\nvoid classifier_remove_group (\n        Classifier & classifier,\n        size_t groupid) const\n{\n    const size_t group_count = classifier.groups.size() - 1;\n    if (groupid != group_count) {\n        std::swap(classifier.groups[groupid], classifier.groups.back());\n        classifier.scores_shift[groupid] = classifier.scores_shift.back();\n        for (Value value = 0; value < dim; ++value) {\n            VectorFloat & scores = classifier.scores[value];\n            scores[groupid] = scores.back();\n        }\n    }\n    classifier.groups.resize(group_count);\n    classifier.scores_shift.resize(group_count);\n    for (Value value = 0; value < dim; ++value) {\n        classifier.scores[value].resize(group_count);\n    }\n}\n\nvoid classifier_add_value (\n        Classifier & classifier,\n        size_t groupid,\n        const Value & value,\n        rng_t &) const\n{\n    DIST_ASSERT1(groupid < classifier.groups.size(), \"groupid out of bounds\");\n    DIST_ASSERT1(value < dim, \"value out of bounds: \" << value);\n    Group & group = classifier.groups[groupid];\n    count_t count_sum = group.count_sum += 1;\n    count_t count = group.counts[value] += 1;\n    classifier.scores[value][groupid] = fast_log(alphas[value] + count);\n    classifier.scores_shift[groupid] =\n        fast_log(classifier.alpha_sum + count_sum);\n}\n\nvoid classifier_remove_value (\n        Classifier & classifier,\n        size_t groupid,\n        const Value & value,\n        rng_t &) const\n{\n    DIST_ASSERT1(groupid < classifier.groups.size(), \"groupid out of bounds\");\n    DIST_ASSERT1(value < dim, \"value out of bounds: \" << value);\n    Group & group = classifier.groups[groupid];\n    count_t count_sum = group.count_sum -= 1;\n    count_t count = group.counts[value] -= 1;\n    classifier.scores[value][groupid] = fast_log(alphas[value] + count);\n    classifier.scores_shift[groupid] =\n        fast_log(classifier.alpha_sum + count_sum);\n}\n\nvoid classifier_score (\n        const Classifier & classifier,\n        const Value & value,\n        VectorFloat & scores_accum,\n        rng_t &) const\n{\n    DIST_ASSERT1(value < dim, \"value out of bounds: \" << value);\n    DIST_ASSERT2(\n        scores_accum.size() == classifier.groups.size(),\n        \"expected scores_accum.size() = \" << classifier.groups.size() <<\n        \", actual \" << scores_accum.size());\n    const size_t group_count = classifier.groups.size();\n    vector_add_subtract(\n        group_count,\n        scores_accum.data(),\n        classifier.scores[value].data(),\n        classifier.scores_shift.data());\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ Fitting\n\nvoid fitter_init (\n    Fitter & fitter) const\n{\n    const size_t group_count = fitter.groups.size();\n    const float alpha_sum = vector_sum(dim, alphas);\n    fitter.scores.resize(dim + 1);\n    for (Value value = 0; value < dim; ++value) {\n        vector_zero(fitter.scores[value].size(), fitter.scores[value].data());\n    }\n    float score_shift = 0;\n    for (size_t groupid = 0; groupid < group_count; ++groupid) {\n        const Group & group = fitter.groups[groupid];\n        for (Value value = 0; value < dim; ++value) {\n            float alpha = alphas[value];\n            fitter.scores[value] +=\n                fast_lgamma(alpha + group.counts[value]) - fast_lgamma(alpha);\n        }\n        score_shift +=\n            fast_lgamma(alpha_sum) - fast_lgamma(alpha_sum + group.count_sum);\n    }\n    fitter.scores.back() = score_shift;\n}\n\nvoid fitter_set_param_alpha (\n    Fitter & fitter,\n    Value value,\n    float alpha)\n{\n    DIST_ASSERT1(value < dim, \"value out of bounds: \" << value);\n\n    alphas[value] = alpha;\n\n    const size_t group_count = fitter.groups.size();\n    const float alpha_sum = vector_sum(dim, alphas);\n    float score = 0;\n    float score_shift = 0;\n    for (size_t groupid = 0; groupid < group_count; ++groupid) {\n        const Group & group = fitter.groups[groupid];\n        score += fast_lgamma(alpha + group.counts[value]) - fast_lgamma(alpha);\n        score_shift +=\n            fast_lgamma(alpha_sum) - fast_lgamma(alpha_sum + group.count_sum);\n    }\n    fitter.scores[value] = score;\n    fitter.scores.back() = score_shift;\n}\n\nfloat fitter_score (\n        Fitter & fitter) const\n{\n    return vector_sum(fitter.scores.size(), fitter.scores.data());\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ Examples\n\nstatic DirichletDiscrete<max_dim> EXAMPLE ();\n\n}; \/\/ struct DirichletDiscrete<max_dim>\n\ntemplate<int max_dim>\ninline DirichletDiscrete<max_dim> DirichletDiscrete<max_dim>::EXAMPLE ()\n{\n    DirichletDiscrete<max_dim> model;\n    model.dim = max_dim;\n    for (int i = 0; i < max_dim; ++i) {\n        model.alphas[i] = 0.5;\n    }\n    return model;\n}\n\n} \/\/ namespace distributions\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 itkSpectra1DImageFilter_hxx\n#define itkSpectra1DImageFilter_hxx\n\n#include \"itkSpectra1DImageFilter.h\"\n\n#include \"itkImageLinearConstIteratorWithIndex.h\"\n#include \"itkImageLinearIteratorWithIndex.h\"\n#include \"itkImageRegionConstIterator.h\"\n#include \"itkMetaDataObject.h\"\n\n#include \"itkSpectra1DSupportWindowImageFilter.h\"\n\nnamespace itk\n{\n\ntemplate< typename TInputImage, typename TSupportWindowImage, typename TOutputImage >\nSpectra1DImageFilter< TInputImage, TSupportWindowImage, TOutputImage >\n::Spectra1DImageFilter()\n{\n  this->AddRequiredInputName( \"SupportWindowImage\" );\n}\n\n\ntemplate< typename TInputImage, typename TSupportWindowImage, typename TOutputImage >\nvoid\nSpectra1DImageFilter< TInputImage, TSupportWindowImage, TOutputImage >\n::GenerateOutputInformation()\n{\n  Superclass::GenerateOutputInformation();\n\n  const SupportWindowImageType * supportWindowImage = this->GetSupportWindowImage();\n  const MetaDataDictionary & dict = supportWindowImage->GetMetaDataDictionary();\n  FFT1DSizeType fft1DSize = 32;\n  ExposeMetaData< FFT1DSizeType >( dict, \"FFT1DSize\", fft1DSize );\n  const FFT1DSizeType spectraComponents = fft1DSize \/ 2 - 1;\n\n  OutputImageType * output = this->GetOutput();\n  output->SetVectorLength( spectraComponents );\n}\n\n\ntemplate< typename TInputImage, typename TSupportWindowImage, typename TOutputImage >\nvoid\nSpectra1DImageFilter< TInputImage, TSupportWindowImage, TOutputImage >\n::BeforeThreadedGenerateData()\n{\n  const SupportWindowImageType * supportWindowImage = this->GetSupportWindowImage();\n  const MetaDataDictionary & dict = supportWindowImage->GetMetaDataDictionary();\n  FFT1DSizeType fft1DSize = 32;\n  ExposeMetaData< FFT1DSizeType >( dict, \"FFT1DSize\", fft1DSize );\n  const FFT1DSizeType spectraComponents = fft1DSize \/ 2 - 1;\n\n  const ThreadIdType numberOfThreads = this->GetNumberOfThreads();\n  this->m_PerThreadDataContainer.resize( numberOfThreads );\n  for( ThreadIdType threadId = 0; threadId < numberOfThreads; ++threadId )\n    {\n    PerThreadData & perThreadData = this->m_PerThreadDataContainer[threadId];\n    perThreadData.ComplexVector.set_size( fft1DSize );\n    perThreadData.SpectraVector.set_size( spectraComponents );\n    perThreadData.LineImageRegionSize.Fill( 1 );\n    perThreadData.LineImageRegionSize[0] = fft1DSize;\n    }\n}\n\n\ntemplate< typename TInputImage, typename TSupportWindowImage, typename TOutputImage >\nvoid\nSpectra1DImageFilter< TInputImage, TSupportWindowImage, TOutputImage >\n::AddLineWindow( FFT1DSizeType length, LineWindowMapType & lineWindowMap )\n{\n  if( lineWindowMap.count( length ) == 1 )\n    {\n    return;\n    }\n  \/\/ Currently using a Hamming Window\n  SpectraVectorType window( length );\n  ScalarType sum = NumericTraits< ScalarType >::ZeroValue();\n  const ScalarType twopi = 2 * vnl_math::pi;\n  for( FFT1DSizeType sample = 0; sample < length; ++sample )\n    {\n    window[sample] = 0.54 + 0.46 * std::cos( (twopi * sample) \/ (length - 1) );\n    sum += window[sample];\n    }\n  for( FFT1DSizeType sample = 0; sample < length; ++sample )\n    {\n    window[sample] \/= sum;\n    }\n  lineWindowMap[length] = window;\n}\n\n\ntemplate< typename TInputImage, typename TSupportWindowImage, typename TOutputImage >\ntypename Spectra1DImageFilter< TInputImage, TSupportWindowImage, TOutputImage >::SpectraLineType\nSpectra1DImageFilter< TInputImage, TSupportWindowImage, TOutputImage >\n::ComputeSpectra( const IndexType & lineIndex, ThreadIdType threadId )\n{\n  const InputImageType * input = this->GetInput();\n  PerThreadData & perThreadData = this->m_PerThreadDataContainer[threadId];\n\n  const FFT1DSizeType fft1DSize = static_cast< FFT1DSizeType >( perThreadData.ComplexVector.size() );\n\n  const typename InputImageType::RegionType lineRegion( lineIndex, perThreadData.LineImageRegionSize );\n  InputImageIteratorType inputIt( input, lineRegion );\n  inputIt.GoToBegin();\n  perThreadData.ComplexVector.fill( 0 );\n  typename ComplexVectorType::iterator complexVectorIt = perThreadData.ComplexVector.begin();\n  typename SpectraVectorType::const_iterator windowIt = perThreadData.LineWindowMap[fft1DSize].begin();\n  while( !inputIt.IsAtEnd() )\n    {\n    *complexVectorIt = inputIt.Value() * *windowIt;\n    ++inputIt;\n    ++complexVectorIt;\n    ++windowIt;\n    }\n  FFT1DType fft1D( fft1DSize );\n  fft1D.bwd_transform( perThreadData.ComplexVector );\n  typename ComplexVectorType::const_iterator complexVectorConstIt = perThreadData.ComplexVector.begin();\n  typename SpectraVectorType::iterator spectraVectorIt = perThreadData.SpectraVector.begin();\n  \/\/ drop DC component\n  ++complexVectorConstIt;\n  const size_t highFreq = perThreadData.SpectraVector.size();\n  for( size_t freq = 0; freq < highFreq; ++freq )\n    {\n    spectraVectorIt[freq] = std::real(*complexVectorConstIt * std::conj(*complexVectorConstIt));\n    ++complexVectorConstIt;\n    }\n  return std::make_pair( lineIndex, perThreadData.SpectraVector );\n}\n\n\ntemplate< typename TInputImage, typename TSupportWindowImage, typename TOutputImage >\nvoid\nSpectra1DImageFilter< TInputImage, TSupportWindowImage, TOutputImage >\n::ThreadedGenerateData( const OutputImageRegionType & outputRegionForThread, ThreadIdType threadId )\n{\n  OutputImageType * output = this->GetOutput();\n  const SupportWindowImageType * supportWindowImage = this->GetSupportWindowImage();\n\n  typedef ImageLinearIteratorWithIndex< OutputImageType > OutputIteratorType;\n  OutputIteratorType outputIt( output, outputRegionForThread );\n  outputIt.SetDirection( 1 );\n\n  const MetaDataDictionary & dict = supportWindowImage->GetMetaDataDictionary();\n  FFT1DSizeType fft1DSize = 32;\n  ExposeMetaData< FFT1DSizeType >( dict, \"FFT1DSize\", fft1DSize );\n  PerThreadData & perThreadData = this->m_PerThreadDataContainer[threadId];\n  this->AddLineWindow( fft1DSize, perThreadData.LineWindowMap );\n\n  ComplexVectorType complexVector( fft1DSize );\n  SpectraVectorType spectraVector( fft1DSize );\n  typename InputImageType::SizeType lineImageRegionSize;\n  lineImageRegionSize.Fill( 1 );\n  lineImageRegionSize[0] = fft1DSize;\n  vnl_fft_1d< ScalarType > fft1D( fft1DSize );\n  SpectraLinesContainerType spectraLines;\n\n  typedef ImageLinearConstIteratorWithIndex< SupportWindowImageType > SupportWindowIteratorType;\n  SupportWindowIteratorType supportWindowIt( supportWindowImage, outputRegionForThread );\n  supportWindowIt.SetDirection( 1 );\n\n  for( outputIt.GoToBegin(), supportWindowIt.GoToBegin();\n       !outputIt.IsAtEnd();\n       outputIt.NextLine(), supportWindowIt.NextLine() )\n    {\n    spectraLines.clear();\n    while( ! outputIt.IsAtEndOfLine() )\n      {\n      \/\/ Compute the per line spectra.\n      const SupportWindowType & supportWindow = supportWindowIt.Value();\n      if( spectraLines.size() == 0 ) \/\/ first window in this lateral direction\n        {\n        const typename SupportWindowType::const_iterator windowLineEnd = supportWindow.end();\n        for( typename SupportWindowType::const_iterator windowLine = supportWindow.begin();\n             windowLine != windowLineEnd;\n             ++windowLine )\n          {\n          const IndexType & lineIndex = *windowLine;\n          const SpectraLineType & spectraLine = this->ComputeSpectra( lineIndex, threadId );\n          spectraLines.push_back( spectraLine );\n          }\n        }\n      else \/\/ subsequent window along a line\n        {\n        const IndexValueType desiredFirstLine = supportWindow[0][1];\n        while( spectraLines[0].first[1] < desiredFirstLine )\n          {\n          spectraLines.pop_front();\n          }\n        const typename SupportWindowType::const_iterator windowLineEnd = supportWindow.end();\n        typename SpectraLinesContainerType::iterator spectraLinesIt = spectraLines.begin();\n        const typename SpectraLinesContainerType::iterator spectraLinesEnd = spectraLines.end();\n        for( typename SupportWindowType::const_iterator windowLine = supportWindow.begin();\n             windowLine != windowLineEnd;\n             ++windowLine )\n          {\n          const IndexType & lineIndex = *windowLine;\n          if( spectraLinesIt == spectraLinesEnd ) \/\/ past the end of the previously processed lines\n            {\n            const SpectraLineType & spectraLine = this->ComputeSpectra( lineIndex, threadId );\n            spectraLines.push_back( spectraLine );\n            }\n          else if( lineIndex[1] == (spectraLinesIt->first)[1] ) \/\/ one of the same lines that was previously computed\n            {\n            if( lineIndex[0] != (spectraLinesIt->first)[0] )\n              {\n              const SpectraLineType & spectraLine = this->ComputeSpectra( lineIndex, threadId );\n              *spectraLinesIt = spectraLine;\n              }\n            ++spectraLinesIt;\n            }\n          else\n            {\n            itkExceptionMacro( \"Unexpected line\" );\n            }\n          }\n        }\n\n      const size_t spectraLinesCount = spectraLines.size();\n      this->AddLineWindow( spectraLinesCount, perThreadData.LineWindowMap );\n      typename OutputImageType::PixelType outputPixel;\n      outputPixel.SetSize( fft1DSize );\n      outputPixel.Fill( NumericTraits< ScalarType >::ZeroValue() );\n      typename SpectraVectorType::const_iterator windowIt = perThreadData.LineWindowMap[spectraLinesCount].begin();\n      for( size_t line = 0; line < spectraLinesCount; ++line )\n        {\n        typename SpectraVectorType::const_iterator spectraIt = spectraLines[line].second.begin();\n        for( FFT1DSizeType sample = 0; sample < fft1DSize; ++sample )\n          {\n          outputPixel[sample] += *windowIt * *spectraIt;\n          ++spectraIt;\n          }\n        ++windowIt;\n        }\n      outputIt.Set( outputPixel );\n\n      ++outputIt;\n      ++supportWindowIt;\n      }\n    }\n}\n\n\n} \/\/ end namespace itk\n\n#endif\n<commit_msg>ENH: Improve twopi specification<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 itkSpectra1DImageFilter_hxx\n#define itkSpectra1DImageFilter_hxx\n\n#include \"itkSpectra1DImageFilter.h\"\n\n#include \"itkImageLinearConstIteratorWithIndex.h\"\n#include \"itkImageLinearIteratorWithIndex.h\"\n#include \"itkImageRegionConstIterator.h\"\n#include \"itkMetaDataObject.h\"\n\n#include \"itkSpectra1DSupportWindowImageFilter.h\"\n\nnamespace itk\n{\n\ntemplate< typename TInputImage, typename TSupportWindowImage, typename TOutputImage >\nSpectra1DImageFilter< TInputImage, TSupportWindowImage, TOutputImage >\n::Spectra1DImageFilter()\n{\n  this->AddRequiredInputName( \"SupportWindowImage\" );\n}\n\n\ntemplate< typename TInputImage, typename TSupportWindowImage, typename TOutputImage >\nvoid\nSpectra1DImageFilter< TInputImage, TSupportWindowImage, TOutputImage >\n::GenerateOutputInformation()\n{\n  Superclass::GenerateOutputInformation();\n\n  const SupportWindowImageType * supportWindowImage = this->GetSupportWindowImage();\n  const MetaDataDictionary & dict = supportWindowImage->GetMetaDataDictionary();\n  FFT1DSizeType fft1DSize = 32;\n  ExposeMetaData< FFT1DSizeType >( dict, \"FFT1DSize\", fft1DSize );\n  const FFT1DSizeType spectraComponents = fft1DSize \/ 2 - 1;\n\n  OutputImageType * output = this->GetOutput();\n  output->SetVectorLength( spectraComponents );\n}\n\n\ntemplate< typename TInputImage, typename TSupportWindowImage, typename TOutputImage >\nvoid\nSpectra1DImageFilter< TInputImage, TSupportWindowImage, TOutputImage >\n::BeforeThreadedGenerateData()\n{\n  const SupportWindowImageType * supportWindowImage = this->GetSupportWindowImage();\n  const MetaDataDictionary & dict = supportWindowImage->GetMetaDataDictionary();\n  FFT1DSizeType fft1DSize = 32;\n  ExposeMetaData< FFT1DSizeType >( dict, \"FFT1DSize\", fft1DSize );\n  const FFT1DSizeType spectraComponents = fft1DSize \/ 2 - 1;\n\n  const ThreadIdType numberOfThreads = this->GetNumberOfThreads();\n  this->m_PerThreadDataContainer.resize( numberOfThreads );\n  for( ThreadIdType threadId = 0; threadId < numberOfThreads; ++threadId )\n    {\n    PerThreadData & perThreadData = this->m_PerThreadDataContainer[threadId];\n    perThreadData.ComplexVector.set_size( fft1DSize );\n    perThreadData.SpectraVector.set_size( spectraComponents );\n    perThreadData.LineImageRegionSize.Fill( 1 );\n    perThreadData.LineImageRegionSize[0] = fft1DSize;\n    }\n}\n\n\ntemplate< typename TInputImage, typename TSupportWindowImage, typename TOutputImage >\nvoid\nSpectra1DImageFilter< TInputImage, TSupportWindowImage, TOutputImage >\n::AddLineWindow( FFT1DSizeType length, LineWindowMapType & lineWindowMap )\n{\n  if( lineWindowMap.count( length ) == 1 )\n    {\n    return;\n    }\n  \/\/ Currently using a Hamming Window\n  SpectraVectorType window( length );\n  ScalarType sum = NumericTraits< ScalarType >::ZeroValue();\n  for( FFT1DSizeType sample = 0; sample < length; ++sample )\n    {\n    window[sample] = 0.54 + 0.46 * std::cos( (Math::twopi * sample) \/ (length - 1) );\n    sum += window[sample];\n    }\n  for( FFT1DSizeType sample = 0; sample < length; ++sample )\n    {\n    window[sample] \/= sum;\n    }\n  lineWindowMap[length] = window;\n}\n\n\ntemplate< typename TInputImage, typename TSupportWindowImage, typename TOutputImage >\ntypename Spectra1DImageFilter< TInputImage, TSupportWindowImage, TOutputImage >::SpectraLineType\nSpectra1DImageFilter< TInputImage, TSupportWindowImage, TOutputImage >\n::ComputeSpectra( const IndexType & lineIndex, ThreadIdType threadId )\n{\n  const InputImageType * input = this->GetInput();\n  PerThreadData & perThreadData = this->m_PerThreadDataContainer[threadId];\n\n  const FFT1DSizeType fft1DSize = static_cast< FFT1DSizeType >( perThreadData.ComplexVector.size() );\n\n  const typename InputImageType::RegionType lineRegion( lineIndex, perThreadData.LineImageRegionSize );\n  InputImageIteratorType inputIt( input, lineRegion );\n  inputIt.GoToBegin();\n  perThreadData.ComplexVector.fill( 0 );\n  typename ComplexVectorType::iterator complexVectorIt = perThreadData.ComplexVector.begin();\n  typename SpectraVectorType::const_iterator windowIt = perThreadData.LineWindowMap[fft1DSize].begin();\n  while( !inputIt.IsAtEnd() )\n    {\n    *complexVectorIt = inputIt.Value() * *windowIt;\n    ++inputIt;\n    ++complexVectorIt;\n    ++windowIt;\n    }\n  FFT1DType fft1D( fft1DSize );\n  fft1D.bwd_transform( perThreadData.ComplexVector );\n  typename ComplexVectorType::const_iterator complexVectorConstIt = perThreadData.ComplexVector.begin();\n  typename SpectraVectorType::iterator spectraVectorIt = perThreadData.SpectraVector.begin();\n  \/\/ drop DC component\n  ++complexVectorConstIt;\n  const size_t highFreq = perThreadData.SpectraVector.size();\n  for( size_t freq = 0; freq < highFreq; ++freq )\n    {\n    spectraVectorIt[freq] = std::real(*complexVectorConstIt * std::conj(*complexVectorConstIt));\n    ++complexVectorConstIt;\n    }\n  return std::make_pair( lineIndex, perThreadData.SpectraVector );\n}\n\n\ntemplate< typename TInputImage, typename TSupportWindowImage, typename TOutputImage >\nvoid\nSpectra1DImageFilter< TInputImage, TSupportWindowImage, TOutputImage >\n::ThreadedGenerateData( const OutputImageRegionType & outputRegionForThread, ThreadIdType threadId )\n{\n  OutputImageType * output = this->GetOutput();\n  const SupportWindowImageType * supportWindowImage = this->GetSupportWindowImage();\n\n  typedef ImageLinearIteratorWithIndex< OutputImageType > OutputIteratorType;\n  OutputIteratorType outputIt( output, outputRegionForThread );\n  outputIt.SetDirection( 1 );\n\n  const MetaDataDictionary & dict = supportWindowImage->GetMetaDataDictionary();\n  FFT1DSizeType fft1DSize = 32;\n  ExposeMetaData< FFT1DSizeType >( dict, \"FFT1DSize\", fft1DSize );\n  PerThreadData & perThreadData = this->m_PerThreadDataContainer[threadId];\n  this->AddLineWindow( fft1DSize, perThreadData.LineWindowMap );\n\n  ComplexVectorType complexVector( fft1DSize );\n  SpectraVectorType spectraVector( fft1DSize );\n  typename InputImageType::SizeType lineImageRegionSize;\n  lineImageRegionSize.Fill( 1 );\n  lineImageRegionSize[0] = fft1DSize;\n  vnl_fft_1d< ScalarType > fft1D( fft1DSize );\n  SpectraLinesContainerType spectraLines;\n\n  typedef ImageLinearConstIteratorWithIndex< SupportWindowImageType > SupportWindowIteratorType;\n  SupportWindowIteratorType supportWindowIt( supportWindowImage, outputRegionForThread );\n  supportWindowIt.SetDirection( 1 );\n\n  for( outputIt.GoToBegin(), supportWindowIt.GoToBegin();\n       !outputIt.IsAtEnd();\n       outputIt.NextLine(), supportWindowIt.NextLine() )\n    {\n    spectraLines.clear();\n    while( ! outputIt.IsAtEndOfLine() )\n      {\n      \/\/ Compute the per line spectra.\n      const SupportWindowType & supportWindow = supportWindowIt.Value();\n      if( spectraLines.size() == 0 ) \/\/ first window in this lateral direction\n        {\n        const typename SupportWindowType::const_iterator windowLineEnd = supportWindow.end();\n        for( typename SupportWindowType::const_iterator windowLine = supportWindow.begin();\n             windowLine != windowLineEnd;\n             ++windowLine )\n          {\n          const IndexType & lineIndex = *windowLine;\n          const SpectraLineType & spectraLine = this->ComputeSpectra( lineIndex, threadId );\n          spectraLines.push_back( spectraLine );\n          }\n        }\n      else \/\/ subsequent window along a line\n        {\n        const IndexValueType desiredFirstLine = supportWindow[0][1];\n        while( spectraLines[0].first[1] < desiredFirstLine )\n          {\n          spectraLines.pop_front();\n          }\n        const typename SupportWindowType::const_iterator windowLineEnd = supportWindow.end();\n        typename SpectraLinesContainerType::iterator spectraLinesIt = spectraLines.begin();\n        const typename SpectraLinesContainerType::iterator spectraLinesEnd = spectraLines.end();\n        for( typename SupportWindowType::const_iterator windowLine = supportWindow.begin();\n             windowLine != windowLineEnd;\n             ++windowLine )\n          {\n          const IndexType & lineIndex = *windowLine;\n          if( spectraLinesIt == spectraLinesEnd ) \/\/ past the end of the previously processed lines\n            {\n            const SpectraLineType & spectraLine = this->ComputeSpectra( lineIndex, threadId );\n            spectraLines.push_back( spectraLine );\n            }\n          else if( lineIndex[1] == (spectraLinesIt->first)[1] ) \/\/ one of the same lines that was previously computed\n            {\n            if( lineIndex[0] != (spectraLinesIt->first)[0] )\n              {\n              const SpectraLineType & spectraLine = this->ComputeSpectra( lineIndex, threadId );\n              *spectraLinesIt = spectraLine;\n              }\n            ++spectraLinesIt;\n            }\n          else\n            {\n            itkExceptionMacro( \"Unexpected line\" );\n            }\n          }\n        }\n\n      const size_t spectraLinesCount = spectraLines.size();\n      this->AddLineWindow( spectraLinesCount, perThreadData.LineWindowMap );\n      typename OutputImageType::PixelType outputPixel;\n      outputPixel.SetSize( fft1DSize );\n      outputPixel.Fill( NumericTraits< ScalarType >::ZeroValue() );\n      typename SpectraVectorType::const_iterator windowIt = perThreadData.LineWindowMap[spectraLinesCount].begin();\n      for( size_t line = 0; line < spectraLinesCount; ++line )\n        {\n        typename SpectraVectorType::const_iterator spectraIt = spectraLines[line].second.begin();\n        for( FFT1DSizeType sample = 0; sample < fft1DSize; ++sample )\n          {\n          outputPixel[sample] += *windowIt * *spectraIt;\n          ++spectraIt;\n          }\n        ++windowIt;\n        }\n      outputIt.Set( outputPixel );\n\n      ++outputIt;\n      ++supportWindowIt;\n      }\n    }\n}\n\n\n} \/\/ end namespace itk\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <iomanip> \/\/ << fixed << setprecision(xxx)\n#include <algorithm> \/\/ do { } while ( next_permutation(A, A+xxx) ) ;\n#include <vector>\n#include <string> \/\/ to_string(nnn) \/\/ substr(m, n) \/\/ stoi(nnn)\n#include <complex>\n#include <tuple> \/\/ get<n>(xxx)\n#include <queue>\n#include <stack>\n#include <map> \/\/ if (M.find(key) != M.end()) { }\n#include <set> \/\/ S.insert(M);\n\/\/ if (S.find(key) != S.end()) { }\n\/\/ for (auto it=S.begin(); it != S.end(); it++) { }\n\/\/ auto it = S.lower_bound(M);\n#include <random> \/\/ random_device rd; mt19937 mt(rd());\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib> \/\/ atoi(xxx)\nusing namespace std;\n\n#define DEBUG 0 \/\/ change 0 -> 1 if we need debug.\n\/\/ insert #if<tab> by my emacs. #if DEBUG == 1 ... #end\n\ntypedef long long ll;\n\n\/\/ const int dx[4] = {1, 0, -1, 0};\n\/\/ const int dy[4] = {0, 1, 0, -1};\n\n\/\/ const int C = 1e6+10;\n\/\/ const ll M = 1000000007;\n\nvector<int> V[100010];\nbool visited[100010];\n\ntypedef tuple<int, int> state;\n\nint main () {\n  int N;\n  cin >> N;\n  for (auto i = 0; i < N-1; ++i) {\n    int a, b;\n    a--;\n    b--;\n    V[a].push_back(b);\n    V[b].push_back(a);\n  }\n  stack<state> S;\n  S.push(state(0, 0));\n  int parent;\n  int D;\n  fill(visited, visited+N, false);\n  while (!S.empty()) {\n    int now = get<0>(S.top());\n    int d = get<1>(S.top());\n    S.pop();\n    if (!visited[now]) {\n      visited[now] = true;\n      if (now == N-1) {\n        D = d;\n        parent = now;\n        break;\n      }\n      for (auto x : V[now]) {\n        if (!visited[x]) {\n          S.push(state(x, d+1));\n        }\n      }\n    }\n  }\n  stack<state> SS;\n  SS.push(state(N-1, 0));\n  int cnt = 0;\n  fill(visited, visited+N, false);  \n  while (!SS.empty()) {\n    int now = get<0>(SS.top());\n    int d = get<1>(SS.top());\n    S.pop();\n    if (!visited[now]) {\n      visited[now] = true;\n      cnt++;\n      for (auto x : V[now]) {\n        if (!visited[x] && x != parent) {\n          SS.push(state(x, d+1));\n        }\n      }\n    }    \n  }\n  int su = (D-1)\/2 + cnt - 1;\n  int fa = N - 2 - fa;\n  if (fa > su) {\n    cout << \"Fennec\" << endl;\n  } else {\n    cout << \"Snuke\" << endl;\n  }\n}\n<commit_msg>tried D.cpp to 'D'<commit_after>#include <iostream>\n#include <iomanip> \/\/ << fixed << setprecision(xxx)\n#include <algorithm> \/\/ do { } while ( next_permutation(A, A+xxx) ) ;\n#include <vector>\n#include <string> \/\/ to_string(nnn) \/\/ substr(m, n) \/\/ stoi(nnn)\n#include <complex>\n#include <tuple> \/\/ get<n>(xxx)\n#include <queue>\n#include <stack>\n#include <map> \/\/ if (M.find(key) != M.end()) { }\n#include <set> \/\/ S.insert(M);\n\/\/ if (S.find(key) != S.end()) { }\n\/\/ for (auto it=S.begin(); it != S.end(); it++) { }\n\/\/ auto it = S.lower_bound(M);\n#include <random> \/\/ random_device rd; mt19937 mt(rd());\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib> \/\/ atoi(xxx)\nusing namespace std;\n\n#define DEBUG 0 \/\/ change 0 -> 1 if we need debug.\n\/\/ insert #if<tab> by my emacs. #if DEBUG == 1 ... #end\n\ntypedef long long ll;\n\n\/\/ const int dx[4] = {1, 0, -1, 0};\n\/\/ const int dy[4] = {0, 1, 0, -1};\n\n\/\/ const int C = 1e6+10;\n\/\/ const ll M = 1000000007;\n\nvector<int> V[100010];\nbool visited[100010];\n\ntypedef tuple<int, int> state;\n\nint main () {\n  int N;\n  cin >> N;\n  for (auto i = 0; i < N-1; ++i) {\n    int a, b;\n    a--;\n    b--;\n    V[a].push_back(b);\n    V[b].push_back(a);\n  }\n  stack<state> S;\n  S.push(state(0, 0));\n  int parent;\n  int D;\n  fill(visited, visited+N, false);\n  cerr << \"aaa\" << endl;\n  while (!S.empty()) {\n    int now = get<0>(S.top());\n    int d = get<1>(S.top());\n    S.pop();\n    if (!visited[now]) {\n      visited[now] = true;\n      if (now == N-1) {\n        D = d;\n        parent = now;\n        break;\n      }\n      for (auto x : V[now]) {\n        if (!visited[x]) {\n          S.push(state(x, d+1));\n        }\n      }\n    }\n  }\n  stack<state> SS;\n  SS.push(state(N-1, 0));\n  int cnt = 0;\n  fill(visited, visited+N, false);\n  cerr << \"aaa\" << endl;\n  while (!SS.empty()) {\n    int now = get<0>(SS.top());\n    int d = get<1>(SS.top());\n    S.pop();\n    if (!visited[now]) {\n      visited[now] = true;\n      cnt++;\n      for (auto x : V[now]) {\n        if (!visited[x] && x != parent) {\n          SS.push(state(x, d+1));\n        }\n      }\n    }    \n  }\n  int su = (D-1)\/2 + cnt - 1;\n  int fa = N - 2 - fa;\n  if (fa > su) {\n    cout << \"Fennec\" << endl;\n  } else {\n    cout << \"Snuke\" << endl;\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <iomanip> \/\/ << fixed << setprecision(xxx)\n#include <algorithm> \/\/ do { } while ( next_permutation(A, A+xxx) ) ;\n#include <vector>\n#include <string> \/\/ to_string(nnn) \/\/ substr(m, n) \/\/ stoi(nnn)\n#include <complex>\n#include <tuple> \/\/ get<n>(xxx)\n#include <queue>\n#include <stack>\n#include <map> \/\/ if (M.find(key) != M.end()) { }\n#include <set> \/\/ S.insert(M);\n\/\/ if (S.find(key) != S.end()) { }\n\/\/ for (auto it=S.begin(); it != S.end(); it++) { }\n\/\/ auto it = S.lower_bound(M);\n#include <random> \/\/ random_device rd; mt19937 mt(rd());\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib> \/\/ atoi(xxx)\n#include <chrono>\nusing namespace std;\n\n#define DEBUG 0 \/\/ change 0 -> 1 if we need debug.\n\/\/ insert #if<tab> by my emacs. #if DEBUG == 1 ... #end\n\ntypedef long long ll;\n\n\/\/ const int dx[4] = {1, 0, -1, 0};\n\/\/ const int dy[4] = {0, 1, 0, -1};\n\n\/\/ const int C = 1e6+10;\n\/\/ const ll M = 1000000007;\n\nint main () {\n  auto start = std::chrono::system_clock::now();\n  random_device rd;\n  mt19937 mt(rd());\n  int N;\n  cin >> N;\n  vector<ll> a(N+1, 0);\n  for (auto i = 1; i <= N; ++i) {\n    cin >> a[i];\n  }\n  for (auto i = N; i > N\/3; --i) {\n    ll val = 0;\n    for (auto j = 1; i*j <= N; ++j) {\n      val += a[i*j];\n    }\n    if (val < 0) {\n      for (auto j = 1; i*j <= N; ++j) {\n        a[i*j] = 0;\n      }      \n    }\n  }\n  \/*\n  cerr << \"a : \";\n  for (auto x : a) {\n    cerr << x << \" \";\n  }\n  cerr << endl;\n  *\/\n  ll M = (1 << N\/3);\n  uniform_int_distribution<> rand(0, (1 << M) - 1);\n  ll ans = 0;\n  while (true) {\n    ll i = rand(mt);\n    vector<ll> x = a;\n    for (auto j = 0; j < M; ++j) {\n      if (((i >> j) & 1) == 1) {\n        int k = j+1;\n        for (auto l = 1; k*l <= N; ++l) {\n          x[k*l] = 0;\n        }      \n      }\n    }\n    ll ret = 0;\n    for (auto j = 1; j <= N; ++j) {\n      ret += x[j];\n    }\n    if (ans < ret) {\n      ans = ret;\n    }\n    auto end = std::chrono::system_clock::now();\n    double timer = std::chrono::duration_cast<std::chrono::milliseconds>(end-start).count();\n    if (timer > 1900) break;\n  }\n  cout << ans << endl;\n}\n<commit_msg>submit E.cpp to 'E - MUL' (arc085) [C++14 (GCC 5.4.1)]<commit_after>#include <iostream>\n#include <iomanip> \/\/ << fixed << setprecision(xxx)\n#include <algorithm> \/\/ do { } while ( next_permutation(A, A+xxx) ) ;\n#include <vector>\n#include <string> \/\/ to_string(nnn) \/\/ substr(m, n) \/\/ stoi(nnn)\n#include <complex>\n#include <tuple> \/\/ get<n>(xxx)\n#include <queue>\n#include <stack>\n#include <map> \/\/ if (M.find(key) != M.end()) { }\n#include <set> \/\/ S.insert(M);\n\/\/ if (S.find(key) != S.end()) { }\n\/\/ for (auto it=S.begin(); it != S.end(); it++) { }\n\/\/ auto it = S.lower_bound(M);\n#include <random> \/\/ random_device rd; mt19937 mt(rd());\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib> \/\/ atoi(xxx)\nusing namespace std;\n \n#define DEBUG 0 \/\/ change 0 -> 1 if we need debug.\n\/\/ insert #if<tab> by my emacs. #if DEBUG == 1 ... #end\n \ntypedef long long ll;\n \n\/\/ const int dx[4] = {1, 0, -1, 0};\n\/\/ const int dy[4] = {0, 1, 0, -1};\n \n\/\/ const int C = 1e6+10;\n\/\/ const ll M = 1000000007;\n \nint main () {\n  int N;\n  cin >> N;\n  vector<ll> a(N+1, 0);\n  for (auto i = 1; i <= N; ++i) {\n    cin >> a[i];\n  }\n  for (auto i = N; i > N\/3; --i) {\n    ll val = 0;\n    for (auto j = 1; i*j <= N; ++j) {\n      val += a[i*j];\n    }\n    if (val < 0) {\n      for (auto j = 1; i*j <= N; ++j) {\n        a[i*j] = 0;\n      }      \n    }\n  }\n  \/*\n  cerr << \"a : \";\n  for (auto x : a) {\n    cerr << x << \" \";\n  }\n  cerr << endl;\n  *\/\n  int M = N\/6 + 1;\n  \/\/cerr << \"M = \" << M << endl;\n  ll ans = 0;\n  for (auto i = 0; i < (1 << M); ++i) {\n    vector<ll> x = a;\n    for (auto j = 0; j < M; ++j) {\n      if (((i >> j) & 1) == 1) {\n        int k = j+1;\n        for (auto l = 1; k*l <= N; ++l) {\n          x[k*l] = 0;\n        }      \n      }\n    }\n    \/*\n    cerr << \"i = \" << i << \", x : \";\n    for (auto y : x) {\n      cerr << y << \" \";\n    }\n    cerr << endl;\n    *\/\n    for (auto j = N\/3; j >= M+1; --j) {\n      ll val = 0;\n      for (auto l = 1; l*j <= N; ++l) {\n        val += x[l*j];\n      }\n      if (val < 0) {\n        for (auto l = 1; l*j <= N; ++l) {\n          x[l*j] = 0;\n        }      \n      }\n    }\n    ll ret = 0;\n    for (auto j = 1; j <= N; ++j) {\n      ret += x[j];\n    }\n    ans = max(ans, ret);\n  }\n  cout << ans << endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <iomanip> \/\/ << fixed << setprecision(xxx)\n#include <algorithm> \/\/ do { } while ( next_permutation(A, A+xxx) ) ;\n#include <vector>\n#include <string> \/\/ to_string(nnn) \/\/ substr(m, n) \/\/ stoi(nnn)\n#include <complex>\n#include <tuple> \/\/ get<n>(xxx)\n#include <queue>\n#include <stack>\n#include <map> \/\/ if (M.find(key) != M.end()) { }\n#include <set> \/\/ S.insert(M);\n\/\/ if (S.find(key) != S.end()) { }\n\/\/ for (auto it=S.begin(); it != S.end(); it++) { }\n\/\/ auto it = S.lower_bound(M);\n#include <random> \/\/ random_device rd; mt19937 mt(rd());\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib> \/\/ atoi(xxx)\nusing namespace std;\n\n#define DEBUG 0 \/\/ change 0 -> 1 if we need debug.\n\/\/ insert #if<tab> by my emacs. #if DEBUG == 1 ... #end\n\ntypedef long long ll;\n\n\/\/ const int dx[4] = {1, 0, -1, 0};\n\/\/ const int dy[4] = {0, 1, 0, -1};\n\n\/\/ const int C = 1e6+10;\n\/\/ const ll M = 1000000007;\n\nint N, K;\nint cnt[2000][2000][2];\nint sum[2000][2000][2];\n\nint main () {\n  fill(&cnt[0][0][0], &cnt[0][0][0]+2000*2000*2, 0);\n  cin >> N >> K;\n  int white = 0;\n  for (auto i = 0; i < N; ++i) {\n    int x, y;\n    char c;\n    cin >> x >> y >> c;\n    bool color = (c == 'W');\n    int area = ((x\/K) + (y\/K))%2;\n    x %= K;\n    y %= K;\n    if (color) {\n      white++;\n      cnt[x + K * area][y][0]++;\n      cnt[x + K * (1-area)][y + K][0]++;\n    } else {\n      cnt[x + K * area][y][1]++;      \n      cnt[x + K * (1-area)][y + K][1]++;      \n    }\n  }\n  \/*\n  for (auto k = 0; k < 2; ++k) {\n    cerr << \"k = \" << k << endl;\n    for (auto i = 0; i < 2 * K; ++i) {\n      for (auto j = 0; j < 2 * K; ++j) {\n        cerr << cnt[i][j][k] << \" \";\n      }\n      cerr << endl;\n    }    \n  }\n  *\/\n  for (auto k = 0; k < 2; ++k) {\n    for (auto i = 0; i < 2 * K; ++i) {\n      for (auto j = 0; j < 2 * K; ++j) {\n        sum[i][j][k] = cnt[i][j][k];\n      }\n    }\n    for (auto i = 0; i < 2 * K; ++i) {\n      for (auto j = 0; j < 2 * K-1; ++j) {\n        sum[i][j+1][k] += sum[i][j][k];\n      }\n    }\n    for (auto j = 0; j < 2 * K; ++j) {\n      for (auto i = 0; i < 2 * K-1; ++i) {\n        sum[i+1][j][k] += sum[i][j][k];\n      }\n    }\n  }\n  \/*\n  for (auto k = 0; k < 2; ++k) {\n    cerr << \"k = \" << k << endl;\n    for (auto i = 0; i < 2 * K; ++i) {\n      for (auto j = 0; j < 2 * K; ++j) {\n        cerr << sum[i][j][k] << \" \";\n      }\n      cerr << endl;\n    }    \n  }\n  *\/\n  int ans = 0;\n  for (auto i = 0; i < K; ++i) {\n    for (auto j = 0; j < K; ++j) {\n      int x = i + K;\n      int y = j + K;\n      int w = sum[x][y][0] - sum[i][y][0] - sum[x][j][0] + sum[i][j][0];\n      int b = sum[x][y][1] - sum[i][y][1] - sum[x][j][1] + sum[i][j][1];\n      \/\/cerr << \"(\" << x << \", \" << y << \") = (\"\n      \/\/     << w << \", \" << b << \")\" << endl;\n      int c = white - w + b;\n      ans = max(ans, c);\n    }\n  }\n  cout << ans << endl;\n}\n<commit_msg>submit D.cpp to 'D - Checker' (arc089) [C++14 (GCC 5.4.1)]<commit_after>#include <iostream>\n#include <iomanip> \/\/ << fixed << setprecision(xxx)\n#include <algorithm> \/\/ do { } while ( next_permutation(A, A+xxx) ) ;\n#include <vector>\n#include <string> \/\/ to_string(nnn) \/\/ substr(m, n) \/\/ stoi(nnn)\n#include <complex>\n#include <tuple> \/\/ get<n>(xxx)\n#include <queue>\n#include <stack>\n#include <map> \/\/ if (M.find(key) != M.end()) { }\n#include <set> \/\/ S.insert(M);\n\/\/ if (S.find(key) != S.end()) { }\n\/\/ for (auto it=S.begin(); it != S.end(); it++) { }\n\/\/ auto it = S.lower_bound(M);\n#include <random> \/\/ random_device rd; mt19937 mt(rd());\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib> \/\/ atoi(xxx)\nusing namespace std;\n\n#define DEBUG 0 \/\/ change 0 -> 1 if we need debug.\n\/\/ insert #if<tab> by my emacs. #if DEBUG == 1 ... #end\n\ntypedef long long ll;\n\n\/\/ const int dx[4] = {1, 0, -1, 0};\n\/\/ const int dy[4] = {0, 1, 0, -1};\n\n\/\/ const int C = 1e6+10;\n\/\/ const ll M = 1000000007;\n\nint N, K;\nint cnt[2000][2000][2];\nint sum[2000][2000][2];\n\nint main () {\n  fill(&cnt[0][0][0], &cnt[0][0][0]+2000*2000*2, 0);\n  cin >> N >> K;\n  int white = 0;\n  for (auto i = 0; i < N; ++i) {\n    int x, y;\n    char c;\n    cin >> x >> y >> c;\n    bool color = (c == 'W');\n    int area = ((x\/K) + (y\/K))%2;\n    x %= K;\n    y %= K;\n    if (color) {\n      white++;\n      cnt[x + K * area][y][0]++;\n      cnt[x + K * (1-area)][y + K][0]++;\n    } else {\n      cnt[x + K * area][y][1]++;      \n      cnt[x + K * (1-area)][y + K][1]++;      \n    }\n  }\n#if DEBUG == 1\n  for (auto k = 0; k < 2; ++k) {\n    cerr << \"k = \" << k << endl;\n    for (auto i = 0; i < 2 * K; ++i) {\n      for (auto j = 0; j < 2 * K; ++j) {\n        cerr << cnt[i][j][k] << \" \";\n      }\n      cerr << endl;\n    }    \n  }  \n#endif\n  for (auto k = 0; k < 2; ++k) {\n    for (auto i = 0; i < 2 * K; ++i) {\n      for (auto j = 0; j < 2 * K; ++j) {\n        sum[i][j][k] = cnt[i][j][k];\n      }\n    }\n    for (auto i = 0; i < 2 * K; ++i) {\n      for (auto j = 0; j < 2 * K-1; ++j) {\n        sum[i][j+1][k] += sum[i][j][k];\n      }\n    }\n    for (auto j = 0; j < 2 * K; ++j) {\n      for (auto i = 0; i < 2 * K-1; ++i) {\n        sum[i+1][j][k] += sum[i][j][k];\n      }\n    }\n  }\n#if DEBUG == 1\n  for (auto k = 0; k < 2; ++k) {\n    cerr << \"k = \" << k << endl;\n    for (auto i = 0; i < 2 * K; ++i) {\n      for (auto j = 0; j < 2 * K; ++j) {\n        cerr << sum[i][j][k] << \" \";\n      }\n      cerr << endl;\n    }    \n  }  \n#endif\n  int ans = 0;\n  for (auto i = 0; i < K; ++i) {\n    for (auto j = 0; j < K; ++j) {\n      int x = i + K;\n      int y = j + K;\n      int w = sum[x][y][0] - sum[i][y][0] - sum[x][j][0] + sum[i][j][0];\n      int b = sum[x][y][1] - sum[i][y][1] - sum[x][j][1] + sum[i][j][1];\n#if DEBUG == 1\n      cerr << \"(\" << x << \", \" << y << \") = (\"\n           << w << \", \" << b << \")\" << endl;\n#endif\n      int c = white - w + b;\n      c = max(N-c, c);\n      ans = max(ans, c);\n    }\n  }\n  cout << ans << endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * File    : E.cpp\n * Author  : Kazune Takahashi\n * Created : 2018-4-14 21:58:19\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 <random> \/\/ random_device rd; mt19937 mt(rd());\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 H, W;\nstring S[20];\ntypedef tuple<int, int> P;\nvector<vector<P>> pairs;\n\nvoid dfs(vector<P> temp, vector<bool> used, int R)\n{\n  if (R%2 == 1)\n  {\n    for (auto i = 0; i < H; i++)\n    {\n      if (!used[i])\n      {\n        vector<bool> n_used = used;\n        n_used[i] = true;\n        vector<P> n_temp = temp;\n        n_temp.push_back(P(i, i));\n        dfs(n_temp, n_used, R - 1);\n      }\n    }\n    return;\n  }\n  if (R == 0)\n  {\n    reverse(temp.begin(), temp.end());\n    pairs.push_back(temp);\n    return;\n  }\n  assert(R >= 2);\n  int first = -1;\n  for (auto i = 0; i < H; i++)\n  {\n    if (!used[i])\n    {\n      first = i;\n      used[i] = true;\n      break;\n    }\n  }\n  assert(first >= 0);\n  for (auto i = 0; i < H; i++)\n  {\n    if (!used[i])\n    {\n      vector<bool> n_used = used;\n      n_used[i] = true;\n      vector<P> n_temp = temp;\n      n_temp.push_back(P(first, i));\n      dfs(n_temp, n_used, R - 2);\n    }\n  }\n}\n\nvector<string> make_strings(vector<P>& V)\n{\n  vector<int> X;\n  int N = V.size();\n  for (auto i = 0; i < N; i++)\n  {\n    X.push_back(get<0>(V[i]));\n  }\n  for (auto i = N-1; i >= 0; i--)\n  {\n    if (i == N-1 && get<0>(V[i]) == get<1>(V[i]))\n    {\n      continue;\n    }\n    X.push_back(get<1>(V[i]));\n  }\n  vector<string> res;\n  for (auto j = 0; j < W; j++)\n  {\n    string str = \"\";\n    for (auto i : X)\n    {\n      string t = {S[i][j]};\n      str += t;\n    }\n    res.push_back(str);\n  }\n  return res;\n}\n\nvector<string> reverse_strings(const vector<string>& V)\n{\n  vector<string> res;\n  for (auto x : V)\n  {\n    reverse(x.begin(), x.end());\n    res.push_back(x);\n  }\n  return res;\n}\n\nint main()\n{\n  cin >> H >> W;\n  for (auto i = 0; i < H; i++)\n  {\n    cin >> S[i];\n  }\n  vector<P> emp_P;\n  vector<bool> emp_used = vector<bool>(H, false);\n  dfs(emp_P, emp_used, H);\n#if DEBUG == 1\n  cerr << \"pairs.size() = \" << pairs.size() << endl;\n  if (pairs.size() < 5)\n  {\n    for (auto V : pairs)\n    {\n      for (auto e : V)\n      {\n        cerr << \"[\" << get<0>(e) << \", \" << get<1>(e) << \"] \";\n      }\n      cerr << endl;\n    }\n  }\n#endif\n  for (auto e : pairs)\n  {\n    vector<string> V1 = make_strings(e);\n    vector<string> V2 = reverse_strings(V1);\n    assert((int)V1.size() == W && (int)V2.size() == W);\n#if DEBUG == 1\n    if (pairs.size() < 5)\n    {\n      for (auto x : V1)\n      {\n        cerr << x << \" \";\n      }\n      cerr << endl;\n      for (auto x : V2)\n      {\n        cerr << x << \" \";\n      }\n      cerr << endl;\n    }\n#endif\n    vector<bool> used = vector<bool>(W, false);\n    bool found = true;\n    bool has_center = (W%2 == 0);\n    for (auto i = 0; i < W; i++)\n    {\n      if (used[i])\n      {\n        continue;\n      }\n      found = false;\n      used[i] = true;\n      for (auto j = i + 1; j < W; j++)\n      {\n        if (!used[j] && V1[i] == V2[j])\n        {\n          used[j] = true;\n          found = true;\n          break;\n        }\n      }\n      if (!has_center && V1[i] == V2[i])\n      {\n        has_center = true;\n        found = true;\n      }\n      if (!found)\n      {\n        break;\n      }\n    }\n    if (found)\n    {\n      cout << \"YES\" << endl;\n      return 0;\n    }\n  }\n  cout << \"NO\" << endl;\n}<commit_msg>submit E.cpp to 'E - Symmetric Grid' (arc095) [C++14 (GCC 5.4.1)]<commit_after>\/**\n * File    : E.cpp\n * Author  : Kazune Takahashi\n * Created : 2018-4-14 21:58:19\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 <random> \/\/ random_device rd; mt19937 mt(rd());\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 H, W;\nstring S[20];\ntypedef tuple<int, int> P;\nvector<vector<P>> pairs;\n\nvoid dfs(vector<P> temp, vector<bool> used, int R)\n{\n  if (R%2 == 1)\n  {\n    for (auto i = 0; i < H; i++)\n    {\n      if (!used[i])\n      {\n        vector<bool> n_used = used;\n        n_used[i] = true;\n        vector<P> n_temp = temp;\n        n_temp.push_back(P(i, i));\n        dfs(n_temp, n_used, R - 1);\n      }\n    }\n    return;\n  }\n  if (R == 0)\n  {\n    reverse(temp.begin(), temp.end());\n    pairs.push_back(temp);\n    return;\n  }\n  assert(R >= 2);\n  int first = -1;\n  for (auto i = 0; i < H; i++)\n  {\n    if (!used[i])\n    {\n      first = i;\n      used[i] = true;\n      break;\n    }\n  }\n  assert(first >= 0);\n  for (auto i = 0; i < H; i++)\n  {\n    if (!used[i])\n    {\n      vector<bool> n_used = used;\n      n_used[i] = true;\n      vector<P> n_temp = temp;\n      n_temp.push_back(P(first, i));\n      dfs(n_temp, n_used, R - 2);\n    }\n  }\n}\n\nvector<string> make_strings(vector<P>& V)\n{\n  vector<int> X;\n  int N = V.size();\n  for (auto i = 0; i < N; i++)\n  {\n    X.push_back(get<0>(V[i]));\n  }\n  for (auto i = N-1; i >= 0; i--)\n  {\n    if (i == N-1 && get<0>(V[i]) == get<1>(V[i]))\n    {\n      continue;\n    }\n    X.push_back(get<1>(V[i]));\n  }\n  vector<string> res;\n  for (auto j = 0; j < W; j++)\n  {\n    string str = \"\";\n    for (auto i : X)\n    {\n      string t = {S[i][j]};\n      str += t;\n    }\n    res.push_back(str);\n  }\n  return res;\n}\n\nvector<string> reverse_strings(const vector<string>& V)\n{\n  vector<string> res;\n  for (auto x : V)\n  {\n    reverse(x.begin(), x.end());\n    res.push_back(x);\n  }\n  return res;\n}\n\nint main()\n{\n  cin >> H >> W;\n  for (auto i = 0; i < H; i++)\n  {\n    cin >> S[i];\n  }\n  vector<P> emp_P;\n  vector<bool> emp_used = vector<bool>(H, false);\n  dfs(emp_P, emp_used, H);\n#if DEBUG == 1\n  cerr << \"pairs.size() = \" << pairs.size() << endl;\n  if (pairs.size() < 5)\n  {\n    for (auto V : pairs)\n    {\n      for (auto e : V)\n      {\n        cerr << \"[\" << get<0>(e) << \", \" << get<1>(e) << \"] \";\n      }\n      cerr << endl;\n    }\n  }\n#endif\n  for (auto e : pairs)\n  {\n    vector<string> V1 = make_strings(e);\n    vector<string> V2 = reverse_strings(V1);\n    assert((int)V1.size() == W && (int)V2.size() == W);\n#if DEBUG == 1\n    if (pairs.size() < 5)\n    {\n      for (auto x : V1)\n      {\n        cerr << x << \" \";\n      }\n      cerr << endl;\n      for (auto x : V2)\n      {\n        cerr << x << \" \";\n      }\n      cerr << endl;\n    }\n#endif\n    vector<bool> used = vector<bool>(W, false);\n    int cnt = 0;\n    for (auto i = 0; i < W; i++)\n    {\n      if (used[i])\n      {\n        continue;\n      }\n      for (auto j = i + 1; j < W; j++)\n      {\n        if (!used[j] && V1[i] == V2[j])\n        {\n          used[i] = true;\n          used[j] = true;\n          cnt += 2;\n          break;\n        }\n      }\n    }\n    if (W - cnt == 1)\n    {\n      for (auto i = 0; i < W; i++)\n      {\n        if (!used[i] && V1[i] == V2[i]) {\n          used[i] = true;\n          cnt++;\n          break;\n        }\n      }\n    }\n    if (W == cnt)\n    {\n      cout << \"YES\" << endl;\n      return 0;\n    }\n  }\n  cout << \"NO\" << endl;\n}<|endoftext|>"}
{"text":"<commit_before>\/**\n * File    : A.cpp\n * Author  : Kazune Takahashi\n * Created : 2018-4-15 20:56:39\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 <random> \/\/ random_device rd; mt19937 mt(rd());\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, T;\nint a[1010];\n\nint main()\n{\n  cin >> N >> T;\n  for (auto i = 0; i < N; i++)\n  {\n    cin >> a[i];\n  }\n  int now = 0;\n  int ans = 0;\n  while (now < N)\n  {\n    if (ans - a[now] > 0 && (ans - a[now])%T == 0)\n    {\n      now++;\n    }\n    ans++;\n  }\n  cout << ans << endl;\n}<commit_msg>tried A.cpp to 'A'<commit_after>\/**\n * File    : A.cpp\n * Author  : Kazune Takahashi\n * Created : 2018-4-15 20:56:39\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 <random> \/\/ random_device rd; mt19937 mt(rd());\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, T;\nint a[1010];\n\nint main()\n{\n  cin >> N >> T;\n  for (auto i = 0; i < N; i++)\n  {\n    cin >> a[i];\n  }\n  int now = 0;\n  int ans = 0;\n  while (now < N)\n  {\n    if (ans - a[now] >= 0 && (ans - a[now]) % T == 0)\n    {\n      now++;\n    }\n    ans++;\n  }\n  cout << ans << endl;\n}<|endoftext|>"}
{"text":"<commit_before>\/**\n * File    : E.cpp\n * Author  : Kazune Takahashi\n * Created : 2018-5-26 21:42:14\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 <random> \/\/ random_device rd; mt19937 mt(rd());\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\nclass BIT\n{ \/\/ index starts at 1.\npublic:\n  int N;\n  ll *data;\n\n  BIT(int n) : N(n)\n  {\n    data = new ll[N + 1];\n    for (auto i = 1; i <= N; ++i)\n    {\n      data[i] = 0;\n    }\n  }\n\n  ~BIT()\n  {\n    delete[] data;\n  }\n\n  ll sum(int i)\n  { \/\/ [1, i]\n    ll s = 0;\n    while (i > 0)\n    {\n      s += data[i];\n      i -= i & -i;\n    }\n    return s;\n  }\n\n  ll sum(int a, int b)\n  { \/\/ [a, b)\n    return sum(b - 1) - sum(a - 1);\n  }\n\n  void add(int i, ll x)\n  {\n    while (i <= N)\n    {\n      data[i] += x;\n      i += i & -i;\n    }\n  }\n\n  void add(int i)\n  {\n    add(i, 1);\n  }\n};\n\ntypedef pair<int, int> P;\n\nint N;\nint K;\nint Q;\nint A[2010];\nvector<P> V;\nbool visited[2010];\n\nint main()\n{\n  cin >> N >> K >> Q;\n  for (auto i = 0; i < N; i++)\n  {\n    cin >> A[i];\n    V.push_back(P(A[i], i));\n  }\n  sort(V.begin(), V.end());\n  reverse(V.begin(), V.end());\n  int ans = 1000000007;\n  fill(visited, visited + 2010, false);\n  for (auto i = 0; i < N; i++)\n  {\n    int k = V[i].second;\n    visited[k] = true;\n    int left[2010];\n    int right[2010];\n    int t = -1;\n    for (auto j = 0; j < N; j++)\n    {\n      if (!visited[i])\n      {\n        t = i;\n      }\n      left[i] = t;\n    }\n    t = N;\n    for (auto j = N; j >= 0; j--)\n    {\n      if (!visited[i])\n      {\n        t = i;\n      }\n      right[i] = t;\n    }\n    BIT bit(N + 1);\n    int cnt[2010];\n    for (auto j = 0; j <= i; j++)\n    {\n      k = V[k].second;\n      bit.add(k);\n      cnt[k] = bit.sum(left[k] + 1, right[k]);\n    }\n    int Y = V[i].first;\n    int sel = 0;\n    for (auto j = i; j >= 0; j--)\n    {\n      k = V[k].second;\n      if (cnt[k] >= K)\n      {\n        sel++;\n        if (sel == Q)\n        {\n          int X = V[j].first;\n          ans = min(ans, X - Y);\n          break;\n        }\n      }\n    }\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 : 2018-5-26 21:42:14\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 <random> \/\/ random_device rd; mt19937 mt(rd());\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\nclass BIT\n{ \/\/ index starts at 1.\npublic:\n  int N;\n  ll *data;\n\n  BIT(int n) : N(n)\n  {\n    data = new ll[N + 1];\n    for (auto i = 1; i <= N; ++i)\n    {\n      data[i] = 0;\n    }\n  }\n\n  ~BIT()\n  {\n    delete[] data;\n  }\n\n  ll sum(int i)\n  { \/\/ [1, i]\n    ll s = 0;\n    while (i > 0)\n    {\n      s += data[i];\n      i -= i & -i;\n    }\n    return s;\n  }\n\n  ll sum(int a, int b)\n  { \/\/ [a, b)\n    return sum(b - 1) - sum(a - 1);\n  }\n\n  void add(int i, ll x)\n  {\n    while (i <= N)\n    {\n      data[i] += x;\n      i += i & -i;\n    }\n  }\n\n  void add(int i)\n  {\n    add(i, 1);\n  }\n};\n\ntypedef pair<int, int> P;\n\nint N;\nint K;\nint Q;\nint A[2010];\nvector<P> V;\nbool visited[2010];\n\nint main()\n{\n  cin >> N >> K >> Q;\n  for (auto i = 0; i < N; i++)\n  {\n    cin >> A[i];\n    V.push_back(P(A[i], i));\n  }\n  sort(V.begin(), V.end());\n  reverse(V.begin(), V.end());\n  int ans = 1000000007;\n  fill(visited, visited + 2010, false);\n  for (auto i = 0; i < N; i++)\n  {\n    int k = V[i].second;\n    visited[k] = true;\n    int left[2010];\n    int right[2010];\n    int t = -1;\n    for (auto j = 0; j < N; j++)\n    {\n      if (!visited[j])\n      {\n        t = j;\n      }\n      left[j] = t;\n    }\n    t = N;\n    for (auto j = N; j >= 0; j--)\n    {\n      if (!visited[j])\n      {\n        t = j;\n      }\n      right[j] = t;\n    }\n    BIT bit(N + 1);\n    int cnt[2010];\n    for (auto j = 0; j <= i; j++)\n    {\n      k = V[k].second;\n      bit.add(k);\n      cnt[k] = bit.sum(left[k] + 1, right[k]);\n    }\n    int Y = V[i].first;\n    int sel = 0;\n    for (auto j = i; j >= 0; j--)\n    {\n      k = V[k].second;\n      if (cnt[k] >= K)\n      {\n        sel++;\n        if (sel == Q)\n        {\n          int X = V[j].first;\n          ans = min(ans, X - Y);\n          break;\n        }\n      }\n    }\n  }\n  cout << ans << endl;\n}<|endoftext|>"}
{"text":"<commit_before>#define DEBUG 1\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 5\/16\/2020, 6:32:30 PM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(const Mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(const Mint &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint &operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint &operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(const Mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(const Mint &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n  Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n  Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n  Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n  bool operator<(const Mint &a) const { return x < a.x; }\n  bool operator<=(const Mint &a) const { return x <= a.x; }\n  bool operator>(const Mint &a) const { return x > a.x; }\n  bool operator>=(const Mint &a) const { return x >= a.x; }\n  bool operator==(const Mint &a) const { return x == a.x; }\n  bool operator!=(const Mint &a) const { return !(*this == a); }\n  const Mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, const Mint<MOD> &rhs)\n{\n  return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, const Mint<MOD> &rhs)\n{\n  return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n  return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, const Mint<MOD> &a)\n{\n  return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2LL; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1LL; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\ntemplate <typename T>\nT gcd(T x, T y) { return y ? gcd(y, x % y) : x; }\ntemplate <typename T>\nT lcm(T x, T y) { return x \/ gcd(x, y) * y; }\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n  int ans{0};\n  while (x != 0)\n  {\n    ans += x & 1;\n    x >>= 1;\n  }\n  return ans;\n}\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1000000000000000LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\/\/ ----- main() -----\n\nint main()\n{\n  int M, K;\n  cin >> M >> K;\n  if (M == 0)\n  {\n    cout << \"0 0\" << endl;\n  }\n  else if (M == 1)\n  {\n    if (K == 0)\n    {\n      cout << \"0 0 1 1\" << endl;\n    }\n    else\n    {\n      cout << \"-1\" << endl;\n    }\n  }\n  else if (K >= (1 << M))\n  {\n    cout << \"-1\" << endl;\n  }\n  else\n  {\n    vector<int> A;\n    for (auto i = 0; i < (1 << M); ++i)\n    {\n      if (i == K)\n      {\n        continue;\n      }\n      A.push_back(i);\n    }\n    auto B{A};\n    reverse(B.begin(), B.end());\n    vector<int> ans;\n    copy(A.begin(), A.end(), back_inserter(ans));\n    ans.push_back(K);\n    copy(B.begin(), B.end(), back_inserter(ans));\n    ans.push_back(K);\n    for (auto it = ans.begin(); it != ans.end(); ++it)\n    {\n      cout << *it;\n      if (it + 1 != ans.end())\n      {\n        cout << \" \";\n      }\n      else\n      {\n        cout << endl;\n      }\n    }\n  }\n}\n<commit_msg>submit F.cpp to 'F - XOR Matching' (abc126) [C++14 (GCC 5.4.1)]<commit_after>#define DEBUG 1\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 5\/16\/2020, 6:32:30 PM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(const Mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(const Mint &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint &operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint &operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(const Mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(const Mint &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n  Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n  Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n  Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n  bool operator<(const Mint &a) const { return x < a.x; }\n  bool operator<=(const Mint &a) const { return x <= a.x; }\n  bool operator>(const Mint &a) const { return x > a.x; }\n  bool operator>=(const Mint &a) const { return x >= a.x; }\n  bool operator==(const Mint &a) const { return x == a.x; }\n  bool operator!=(const Mint &a) const { return !(*this == a); }\n  const Mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, const Mint<MOD> &rhs)\n{\n  return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, const Mint<MOD> &rhs)\n{\n  return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n  return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, const Mint<MOD> &a)\n{\n  return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2LL; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1LL; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\ntemplate <typename T>\nT gcd(T x, T y) { return y ? gcd(y, x % y) : x; }\ntemplate <typename T>\nT lcm(T x, T y) { return x \/ gcd(x, y) * y; }\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n  int ans{0};\n  while (x != 0)\n  {\n    ans += x & 1;\n    x >>= 1;\n  }\n  return ans;\n}\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1000000000000000LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\/\/ ----- main() -----\n\nint main()\n{\n  int M, K;\n  cin >> M >> K;\n  if (K >= (1 << M))\n  {\n    cout << \"-1\" << endl;\n  }\n  else if (M == 0)\n  {\n    cout << \"0 0\" << endl;\n  }\n  else if (M == 1)\n  {\n    if (K == 0)\n    {\n      cout << \"0 0 1 1\" << endl;\n    }\n    else\n    {\n      cout << \"-1\" << endl;\n    }\n  }\n  else\n  {\n    vector<int> A;\n    for (auto i = 0; i < (1 << M); ++i)\n    {\n      if (i == K)\n      {\n        continue;\n      }\n      A.push_back(i);\n    }\n    auto B{A};\n    reverse(B.begin(), B.end());\n    vector<int> ans;\n    copy(A.begin(), A.end(), back_inserter(ans));\n    ans.push_back(K);\n    copy(B.begin(), B.end(), back_inserter(ans));\n    ans.push_back(K);\n    for (auto it = ans.begin(); it != ans.end(); ++it)\n    {\n      cout << *it;\n      if (it + 1 != ans.end())\n      {\n        cout << \" \";\n      }\n      else\n      {\n        cout << endl;\n      }\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#define DEBUG 1\n\n\/**\n * File    : A.cpp\n * Author  : Kazune Takahashi\n * Created : 2019-6-2 20:42:31\n * Powered by Visual Studio Code\n *\/\n\n#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <complex>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <functional>\n#include <random>\n#include <chrono>\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\nusing namespace std;\n\ntypedef long long ll;\n\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\n\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\n\/*\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, 1, 0, -1};\n*\/\n\n\/\/ const ll MOD = 1000000007;\n\nstring S;\nint A, B, C, D, N;\n\nbool solve(int X, int Y)\n{\n  for (auto i = X; i < Y; i++)\n  {\n    if (S[i] == '#' && S[i + 1] == '#')\n    {\n      return false;\n    }\n  }\n  return true;\n}\n\nbool solve2(int X, int Y, int Z, int W)\n{\n  for (auto i = Z; i < W - 1; i++)\n  {\n    if ((i == 0 || S[i - 1] == '.') && S[i] == '.' && S[i + 1] == '.')\n    {\n      S[i] = '#';\n      break;\n    }\n  }\n  return solve(X, Y);\n}\n\nint main()\n{\n  cin >> N >> A >> B >> C >> D >> S;\n  A--;\n  B--;\n  C--;\n  D--;\n  if (C < B)\n  {\n    if (solve(A, B) && solve(C, D))\n    {\n      Yes();\n    }\n    No();\n  }\n  if (solve(C, D) && solve2(A, B, C, D))\n  {\n    Yes();\n  }\n  No();\n}<commit_msg>tried A.cpp to 'A'<commit_after>#define DEBUG 1\n\n\/**\n * File    : A.cpp\n * Author  : Kazune Takahashi\n * Created : 2019-6-2 20:42:31\n * Powered by Visual Studio Code\n *\/\n\n#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <complex>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <functional>\n#include <random>\n#include <chrono>\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\nusing namespace std;\n\ntypedef long long ll;\n\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\n\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\n\/*\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, 1, 0, -1};\n*\/\n\n\/\/ const ll MOD = 1000000007;\n\nstring S;\nint A, B, C, D, N;\n\nbool solve(int X, int Y)\n{\n  for (auto i = X; i < Y; i++)\n  {\n    if (S[i] == '#' && S[i + 1] == '#')\n    {\n      return false;\n    }\n  }\n  return true;\n}\n\nbool solve2(int X, int Y, int Z, int W)\n{\n  bool ok = false;\n  for (auto i = Z; i < W - 1; i++)\n  {\n    if ((i == 0 || S[i - 1] == '.') && S[i] == '.' && S[i + 1] == '.')\n    {\n      S[i] = '#';\n      ok = true;\n      break;\n    }\n  }\n  if (!ok)\n  {\n    return false;\n  }\n  return solve(X, Y);\n}\n\nint main()\n{\n  cin >> N >> A >> B >> C >> D >> S;\n  A--;\n  B--;\n  C--;\n  D--;\n  if (C < B)\n  {\n    if (solve(A, B) && solve(C, D))\n    {\n      Yes();\n    }\n    No();\n  }\n  if (solve(C, D) && solve2(A, B, C, D))\n  {\n    Yes();\n  }\n  No();\n}<|endoftext|>"}
{"text":"<commit_before>#define DEBUG 1\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 5\/19\/2020, 3:57:45 PM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(const Mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(const Mint &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(const Mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(const Mint &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n  Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n  Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n  Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n  bool operator<(const Mint &a) const { return x < a.x; }\n  bool operator<=(const Mint &a) const { return x <= a.x; }\n  bool operator>(const Mint &a) const { return x > a.x; }\n  bool operator>=(const Mint &a) const { return x >= a.x; }\n  bool operator==(const Mint &a) const { return x == a.x; }\n  bool operator!=(const Mint &a) const { return !(*this == a); }\n  const Mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, const Mint<MOD> &rhs)\n{\n  return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, const Mint<MOD> &rhs)\n{\n  return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n  return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, const Mint<MOD> &a)\n{\n  return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2LL; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1LL; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\ntemplate <typename T>\nT gcd(T x, T y) { return y ? gcd(y, x % y) : x; }\ntemplate <typename T>\nT lcm(T x, T y) { return x \/ gcd(x, y) * y; }\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n  int ans{0};\n  while (x != 0)\n  {\n    ans += x & 1;\n    x >>= 1;\n  }\n  return ans;\n}\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1000000000000000LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\n\/\/ ----- LCA -----\n\ntemplate <typename T = ll>\nclass LCA\n{\n  int N, root, L;\n  vector<vector<int>> to;\n  vector<vector<T>> co;\n  vector<int> dep;\n  vector<T> costs;\n  vector<vector<int>> par;\n\npublic:\n  LCA(int n) : N{n}, L{0}, to(n), co(n), dep(n), costs(n)\n  {\n    while ((1 << L) < N)\n    {\n      ++L;\n    }\n    par = vector<vector<int>>(N + 1, vector<int>(L, N));\n  }\n\n  void add_edge(int a, int b, T c = 0)\n  {\n    to[a].push_back(b);\n    co[a].push_back(c);\n    to[b].push_back(a);\n    co[b].push_back(c);\n  }\n\n  void init(int _root)\n  {\n    root = _root;\n    dfs(root);\n    for (auto i = 0; i < L - 1; i++)\n    {\n      for (auto v = 0; v < N; v++)\n      {\n        if (par[v][i] != -1)\n        {\n          par[v][i + 1] = par[par[v][i]][i];\n        }\n      }\n    }\n  }\n\n  \/\/ LCA\n  int operator()(int a, int b)\n  {\n    if (dep[a] > dep[b])\n    {\n      swap(a, b);\n    }\n    int gap = dep[b] - dep[a];\n    for (auto i = L - 1; i >= 0; i--)\n    {\n      int len = 1 << i;\n      if (gap >= len)\n      {\n        gap -= len;\n        b = par[b][i];\n      }\n    }\n    if (a == b)\n    {\n      return a;\n    }\n    for (auto i = L - 1; i >= 0; i--)\n    {\n      int na = par[a][i];\n      int nb = par[b][i];\n      if (na != nb)\n      {\n        a = na;\n        b = nb;\n      }\n    }\n    return par[a][0];\n  }\n\n  int depth(int a, int b)\n  {\n    int c = (*this)(a, b);\n    return dep[a] + dep[b] - 2 * dep[c];\n  }\n\n  T cost(int a, int b)\n  {\n    int c = (*this)(a, b);\n    return costs[a] + costs[b] - 2 * costs[c];\n  }\n\nprivate:\n  void dfs(int v, int d = 0, T c = 0, int p = -1)\n  {\n    if (p != -1)\n    {\n      par[v][0] = p;\n    }\n    dep[v] = d;\n    costs[v] = c;\n    for (auto i = 0u; i < to[v].size(); i++)\n    {\n      int u = to[v][i];\n      if (u == p)\n      {\n        continue;\n      }\n      dfs(u, d + 1, c + co[v][i], v);\n    }\n  }\n};\n\n\/\/ ----- main() -----\n\nstruct Query\n{\n  int id, color, y, coefficient;\n};\n\nstruct Edge\n{\n  int src, dst, color, cost;\n};\n\nclass Solve\n{\n  int N, Q;\n  vector<vector<Edge>> V;\n  vector<vector<Query>> W;\n  LCA<int> lca;\n  vector<int> ans;\n  vector<int> sum, cnt;\n\npublic:\n  Solve(int N, int Q) : N{N}, Q{Q}, V(N), W(Q), lca{N}, ans(Q), sum(N, 0), cnt(N, 0)\n  {\n    for (auto i = 0; i < N - 1; ++i)\n    {\n      int a, b, c, d;\n      cin >> a >> b >> c >> d;\n      --a;\n      --b;\n      V[a].push_back({a, b, c, d});\n      V[b].push_back({b, a, c, d});\n      lca.add_edge(a, b, d);\n    }\n    lca.init(0);\n    for (auto i = 0; i < Q; ++i)\n    {\n      int x, y, u, v;\n      cin >> x >> y >> u >> v;\n      --x;\n      --y;\n      --u;\n      --v;\n      W[u].push_back({i, x, y, 1});\n      W[v].push_back({i, x, y, 1});\n      W[lca(u, v)].push_back({i, x, y, -2});\n      ans[i] = lca.cost(u, v);\n    }\n  }\n\n  void flush()\n  {\n#if DEBUG == 1\n    cerr << \"aaa\" << endl;\n#endif\n    dfs();\n    for (auto i = 0; i < Q; ++i)\n    {\n      cout << ans[i] << endl;\n    }\n  }\n\nprivate:\n  void dfs(int u = 0, int p = -1)\n  {\n#if DEBUG == 1\n    cerr << \"u = \" << u << endl;\n#endif\n    for (auto const &q : W[u])\n    {\n      ans[q.id] += q.coefficient * (-sum[q.color] + cnt[q.color] * q.y);\n    }\n    for (auto const &e : V[u])\n    {\n      if (e.dst == p)\n      {\n        continue;\n      }\n      sum[e.color] += e.cost;\n      cnt[e.color]++;\n      dfs(e.dst, u);\n      sum[e.color] -= e.cost;\n      cnt[e.color]--;\n    }\n  }\n};\n\nint main()\n{\n  int N, Q;\n  cin >> N >> Q;\n  Solve solve(N, Q);\n  solve.flush();\n}\n<commit_msg>tried F.cpp to 'F'<commit_after>#define DEBUG 1\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 5\/19\/2020, 3:57:45 PM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(const Mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(const Mint &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(const Mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(const Mint &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n  Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n  Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n  Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n  bool operator<(const Mint &a) const { return x < a.x; }\n  bool operator<=(const Mint &a) const { return x <= a.x; }\n  bool operator>(const Mint &a) const { return x > a.x; }\n  bool operator>=(const Mint &a) const { return x >= a.x; }\n  bool operator==(const Mint &a) const { return x == a.x; }\n  bool operator!=(const Mint &a) const { return !(*this == a); }\n  const Mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, const Mint<MOD> &rhs)\n{\n  return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, const Mint<MOD> &rhs)\n{\n  return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n  return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, const Mint<MOD> &a)\n{\n  return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2LL; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1LL; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\ntemplate <typename T>\nT gcd(T x, T y) { return y ? gcd(y, x % y) : x; }\ntemplate <typename T>\nT lcm(T x, T y) { return x \/ gcd(x, y) * y; }\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n  int ans{0};\n  while (x != 0)\n  {\n    ans += x & 1;\n    x >>= 1;\n  }\n  return ans;\n}\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1000000000000000LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\n\/\/ ----- LCA -----\n\ntemplate <typename T = ll>\nclass LCA\n{\n  int N, root, L;\n  vector<vector<int>> to;\n  vector<vector<T>> co;\n  vector<int> dep;\n  vector<T> costs;\n  vector<vector<int>> par;\n\npublic:\n  LCA(int n) : N{n}, L{0}, to(n), co(n), dep(n), costs(n)\n  {\n    while ((1 << L) < N)\n    {\n      ++L;\n    }\n    par = vector<vector<int>>(N + 1, vector<int>(L, N));\n  }\n\n  void add_edge(int a, int b, T c = 0)\n  {\n    to[a].push_back(b);\n    co[a].push_back(c);\n    to[b].push_back(a);\n    co[b].push_back(c);\n  }\n\n  void init(int _root)\n  {\n    root = _root;\n    dfs(root);\n    for (auto i = 0; i < L - 1; i++)\n    {\n      for (auto v = 0; v < N; v++)\n      {\n        if (par[v][i] != -1)\n        {\n          par[v][i + 1] = par[par[v][i]][i];\n        }\n      }\n    }\n  }\n\n  \/\/ LCA\n  int operator()(int a, int b)\n  {\n    if (dep[a] > dep[b])\n    {\n      swap(a, b);\n    }\n    int gap = dep[b] - dep[a];\n    for (auto i = L - 1; i >= 0; i--)\n    {\n      int len = 1 << i;\n      if (gap >= len)\n      {\n        gap -= len;\n        b = par[b][i];\n      }\n    }\n    if (a == b)\n    {\n      return a;\n    }\n    for (auto i = L - 1; i >= 0; i--)\n    {\n      int na = par[a][i];\n      int nb = par[b][i];\n      if (na != nb)\n      {\n        a = na;\n        b = nb;\n      }\n    }\n    return par[a][0];\n  }\n\n  int depth(int a, int b)\n  {\n    int c = (*this)(a, b);\n    return dep[a] + dep[b] - 2 * dep[c];\n  }\n\n  T cost(int a, int b)\n  {\n    int c = (*this)(a, b);\n    return costs[a] + costs[b] - 2 * costs[c];\n  }\n\nprivate:\n  void dfs(int v, int d = 0, T c = 0, int p = -1)\n  {\n    if (p != -1)\n    {\n      par[v][0] = p;\n    }\n    dep[v] = d;\n    costs[v] = c;\n    for (auto i = 0u; i < to[v].size(); i++)\n    {\n      int u = to[v][i];\n      if (u == p)\n      {\n        continue;\n      }\n      dfs(u, d + 1, c + co[v][i], v);\n    }\n  }\n};\n\n\/\/ ----- main() -----\n\nstruct Query\n{\n  int id, color, y, coefficient;\n};\n\nstruct Edge\n{\n  int src, dst, color, cost;\n};\n\nclass Solve\n{\n  int N, Q;\n  vector<vector<Edge>> V;\n  vector<vector<Query>> W;\n  LCA<int> lca;\n  vector<int> ans;\n  vector<int> sum, cnt;\n\npublic:\n  Solve(int N, int Q) : N{N}, Q{Q}, V(N), W(Q), lca{N}, ans(Q), sum(N - 1, 0), cnt(N - 1, 0)\n  {\n    for (auto i = 0; i < N - 1; ++i)\n    {\n      int a, b, c, d;\n      cin >> a >> b >> c >> d;\n      --a;\n      --b;\n      V[a].push_back({a, b, c, d});\n      V[b].push_back({b, a, c, d});\n      lca.add_edge(a, b, d);\n    }\n    lca.init(0);\n    for (auto i = 0; i < Q; ++i)\n    {\n      int x, y, u, v;\n      cin >> x >> y >> u >> v;\n      --x;\n      --y;\n      --u;\n      --v;\n      W[u].push_back({i, x, y, 1});\n      W[v].push_back({i, x, y, 1});\n      W[lca(u, v)].push_back({i, x, y, -2});\n      ans[i] = lca.cost(u, v);\n#if DEBUG == 1\n      cerr << \"ans[\" << i << \"] = \" << ans[i] << endl;\n#endif\n    }\n  }\n\n  void flush()\n  {\n#if DEBUG == 1\n    cerr << \"aaa\" << endl;\n#endif\n    dfs();\n    for (auto i = 0; i < Q; ++i)\n    {\n      cout << ans[i] << endl;\n    }\n  }\n\nprivate:\n  void dfs(int u = 0, int p = -1)\n  {\n#if DEBUG == 1\n    cerr << \"u = \" << u << endl;\n#endif\n    for (auto const &q : W[u])\n    {\n      ans[q.id] += q.coefficient * (-sum[q.color] + cnt[q.color] * q.y);\n    }\n    for (auto const &e : V[u])\n    {\n      if (e.dst == p)\n      {\n        continue;\n      }\n      sum[e.color] += e.cost;\n      cnt[e.color]++;\n      dfs(e.dst, u);\n      sum[e.color] -= e.cost;\n      cnt[e.color]--;\n    }\n  }\n};\n\nint main()\n{\n  int N, Q;\n  cin >> N >> Q;\n  Solve solve(N, Q);\n  solve.flush();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- X86AsmInstrumentation.cpp - Instrument X86 inline assembly 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\/X86BaseInfo.h\"\n#include \"X86AsmInstrumentation.h\"\n#include \"X86Operand.h\"\n#include \"llvm\/ADT\/StringExtras.h\"\n#include \"llvm\/ADT\/Triple.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/MC\/MCContext.h\"\n#include \"llvm\/MC\/MCInst.h\"\n#include \"llvm\/MC\/MCInstBuilder.h\"\n#include \"llvm\/MC\/MCInstrInfo.h\"\n#include \"llvm\/MC\/MCParser\/MCParsedAsmOperand.h\"\n#include \"llvm\/MC\/MCStreamer.h\"\n#include \"llvm\/MC\/MCSubtargetInfo.h\"\n#include \"llvm\/MC\/MCTargetOptions.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n\nnamespace llvm {\nnamespace {\n\nstatic cl::opt<bool> ClAsanInstrumentAssembly(\n    \"asan-instrument-assembly\",\n    cl::desc(\"instrument assembly with AddressSanitizer checks\"), cl::Hidden,\n    cl::init(false));\n\nbool IsStackReg(unsigned Reg) {\n  return Reg == X86::RSP || Reg == X86::ESP || Reg == X86::SP;\n}\n\nstd::string FuncName(unsigned AccessSize, bool IsWrite) {\n  return std::string(\"__sanitizer_sanitize_\") + (IsWrite ? \"store\" : \"load\") +\n         (utostr(AccessSize));\n}\n\nclass X86AddressSanitizer : public X86AsmInstrumentation {\npublic:\n  X86AddressSanitizer(const MCSubtargetInfo &STI) : STI(STI) {}\n  virtual ~X86AddressSanitizer() {}\n\n  \/\/ X86AsmInstrumentation implementation:\n  virtual void InstrumentInstruction(\n      const MCInst &Inst, SmallVectorImpl<MCParsedAsmOperand *> &Operands,\n      MCContext &Ctx, const MCInstrInfo &MII, MCStreamer &Out) override {\n    InstrumentMOV(Inst, Operands, Ctx, MII, Out);\n  }\n\n  \/\/ Should be implemented differently in x86_32 and x86_64 subclasses.\n  virtual void InstrumentMemOperandImpl(X86Operand *Op, unsigned AccessSize,\n                                        bool IsWrite, MCContext &Ctx,\n                                        MCStreamer &Out) = 0;\n\n  void InstrumentMemOperand(MCParsedAsmOperand *Op, unsigned AccessSize,\n                            bool IsWrite, MCContext &Ctx, MCStreamer &Out);\n  void InstrumentMOV(const MCInst &Inst,\n                     SmallVectorImpl<MCParsedAsmOperand *> &Operands,\n                     MCContext &Ctx, const MCInstrInfo &MII, MCStreamer &Out);\n  void EmitInstruction(MCStreamer &Out, const MCInst &Inst) {\n    Out.EmitInstruction(Inst, STI);\n  }\n\nprotected:\n  const MCSubtargetInfo &STI;\n};\n\nvoid X86AddressSanitizer::InstrumentMemOperand(\n    MCParsedAsmOperand *Op, unsigned AccessSize, bool IsWrite, MCContext &Ctx,\n    MCStreamer &Out) {\n  assert(Op && Op->isMem() && \"Op should be a memory operand.\");\n  assert((AccessSize & (AccessSize - 1)) == 0 && AccessSize <= 16 &&\n         \"AccessSize should be a power of two, less or equal than 16.\");\n\n  X86Operand *MemOp = static_cast<X86Operand *>(Op);\n  \/\/ FIXME: get rid of this limitation.\n  if (IsStackReg(MemOp->getMemBaseReg()) || IsStackReg(MemOp->getMemIndexReg()))\n    return;\n\n  InstrumentMemOperandImpl(MemOp, AccessSize, IsWrite, Ctx, Out);\n}\n\nvoid X86AddressSanitizer::InstrumentMOV(\n    const MCInst &Inst, SmallVectorImpl<MCParsedAsmOperand *> &Operands,\n    MCContext &Ctx, const MCInstrInfo &MII, MCStreamer &Out) {\n  \/\/ Access size in bytes.\n  unsigned AccessSize = 0;\n\n  switch (Inst.getOpcode()) {\n  case X86::MOV8mi:\n  case X86::MOV8mr:\n  case X86::MOV8rm:\n    AccessSize = 1;\n    break;\n  case X86::MOV16mi:\n  case X86::MOV16mr:\n  case X86::MOV16rm:\n    AccessSize = 2;\n    break;\n  case X86::MOV32mi:\n  case X86::MOV32mr:\n  case X86::MOV32rm:\n    AccessSize = 4;\n    break;\n  case X86::MOV64mi32:\n  case X86::MOV64mr:\n  case X86::MOV64rm:\n    AccessSize = 8;\n    break;\n  case X86::MOVAPDmr:\n  case X86::MOVAPSmr:\n  case X86::MOVAPDrm:\n  case X86::MOVAPSrm:\n    AccessSize = 16;\n    break;\n  default:\n    return;\n  }\n\n  const bool IsWrite = MII.get(Inst.getOpcode()).mayStore();\n  for (unsigned Ix = 0; Ix < Operands.size(); ++Ix) {\n    MCParsedAsmOperand *Op = Operands[Ix];\n    if (Op && Op->isMem())\n      InstrumentMemOperand(Op, AccessSize, IsWrite, Ctx, Out);\n  }\n}\n\nclass X86AddressSanitizer32 : public X86AddressSanitizer {\npublic:\n  X86AddressSanitizer32(const MCSubtargetInfo &STI)\n      : X86AddressSanitizer(STI) {}\n  virtual ~X86AddressSanitizer32() {}\n\n  virtual void InstrumentMemOperandImpl(X86Operand *Op, unsigned AccessSize,\n                                        bool IsWrite, MCContext &Ctx,\n                                        MCStreamer &Out) override;\n};\n\nvoid X86AddressSanitizer32::InstrumentMemOperandImpl(\n    X86Operand *Op, unsigned AccessSize, bool IsWrite, MCContext &Ctx,\n    MCStreamer &Out) {\n  \/\/ FIXME: emit .cfi directives for correct stack unwinding.\n  EmitInstruction(Out, MCInstBuilder(X86::PUSH32r).addReg(X86::EAX));\n  {\n    MCInst Inst;\n    Inst.setOpcode(X86::LEA32r);\n    Inst.addOperand(MCOperand::CreateReg(X86::EAX));\n    Op->addMemOperands(Inst, 5);\n    EmitInstruction(Out, Inst);\n  }\n  EmitInstruction(Out, MCInstBuilder(X86::PUSH32r).addReg(X86::EAX));\n  {\n    const std::string Func = FuncName(AccessSize, IsWrite);\n    const MCSymbol *FuncSym = Ctx.GetOrCreateSymbol(StringRef(Func));\n    const MCSymbolRefExpr *FuncExpr =\n        MCSymbolRefExpr::Create(FuncSym, MCSymbolRefExpr::VK_PLT, Ctx);\n    EmitInstruction(Out, MCInstBuilder(X86::CALLpcrel32).addExpr(FuncExpr));\n  }\n  EmitInstruction(Out, MCInstBuilder(X86::ADD32ri).addReg(X86::ESP)\n                           .addReg(X86::ESP).addImm(4));\n  EmitInstruction(Out, MCInstBuilder(X86::POP32r).addReg(X86::EAX));\n}\n\nclass X86AddressSanitizer64 : public X86AddressSanitizer {\npublic:\n  X86AddressSanitizer64(const MCSubtargetInfo &STI)\n      : X86AddressSanitizer(STI) {}\n  virtual ~X86AddressSanitizer64() {}\n\n  virtual void InstrumentMemOperandImpl(X86Operand *Op, unsigned AccessSize,\n                                        bool IsWrite, MCContext &Ctx,\n                                        MCStreamer &Out) override;\n};\n\nvoid X86AddressSanitizer64::InstrumentMemOperandImpl(X86Operand *Op,\n                                                     unsigned AccessSize,\n                                                     bool IsWrite,\n                                                     MCContext &Ctx,\n                                                     MCStreamer &Out) {\n  \/\/ FIXME: emit .cfi directives for correct stack unwinding.\n\n  \/\/ Set %rsp below current red zone (128 bytes wide) using LEA instruction to\n  \/\/ preserve flags.\n  {\n    MCInst Inst;\n    Inst.setOpcode(X86::LEA64r);\n    Inst.addOperand(MCOperand::CreateReg(X86::RSP));\n\n    const MCExpr *Disp = MCConstantExpr::Create(-128, Ctx);\n    std::unique_ptr<X86Operand> Op(\n        X86Operand::CreateMem(0, Disp, X86::RSP, 0, 1, SMLoc(), SMLoc()));\n    Op->addMemOperands(Inst, 5);\n    EmitInstruction(Out, Inst);\n  }\n  EmitInstruction(Out, MCInstBuilder(X86::PUSH64r).addReg(X86::RDI));\n  {\n    MCInst Inst;\n    Inst.setOpcode(X86::LEA64r);\n    Inst.addOperand(MCOperand::CreateReg(X86::RDI));\n    Op->addMemOperands(Inst, 5);\n    EmitInstruction(Out, Inst);\n  }\n  {\n    const std::string Func = FuncName(AccessSize, IsWrite);\n    const MCSymbol *FuncSym = Ctx.GetOrCreateSymbol(StringRef(Func));\n    const MCSymbolRefExpr *FuncExpr =\n        MCSymbolRefExpr::Create(FuncSym, MCSymbolRefExpr::VK_PLT, Ctx);\n    EmitInstruction(Out, MCInstBuilder(X86::CALL64pcrel32).addExpr(FuncExpr));\n  }\n  EmitInstruction(Out, MCInstBuilder(X86::POP64r).addReg(X86::RDI));\n\n  \/\/ Restore old %rsp value.\n  {\n    MCInst Inst;\n    Inst.setOpcode(X86::LEA64r);\n    Inst.addOperand(MCOperand::CreateReg(X86::RSP));\n\n    const MCExpr *Disp = MCConstantExpr::Create(128, Ctx);\n    std::unique_ptr<X86Operand> Op(\n        X86Operand::CreateMem(0, Disp, X86::RSP, 0, 1, SMLoc(), SMLoc()));\n    Op->addMemOperands(Inst, 5);\n    EmitInstruction(Out, Inst);\n  }\n}\n\n} \/\/ End anonymous namespace\n\nX86AsmInstrumentation::X86AsmInstrumentation() {}\nX86AsmInstrumentation::~X86AsmInstrumentation() {}\n\nvoid X86AsmInstrumentation::InstrumentInstruction(\n    const MCInst &Inst, SmallVectorImpl<MCParsedAsmOperand *> &Operands,\n    MCContext &Ctx, const MCInstrInfo &MII, MCStreamer &Out) {}\n\nX86AsmInstrumentation *\nCreateX86AsmInstrumentation(const MCTargetOptions &MCOptions,\n                            const MCContext &Ctx, const MCSubtargetInfo &STI) {\n  Triple T(STI.getTargetTriple());\n  const bool hasCompilerRTSupport = T.isOSLinux();\n  if (ClAsanInstrumentAssembly && hasCompilerRTSupport &&\n      MCOptions.SanitizeAddress) {\n    if ((STI.getFeatureBits() & X86::Mode32Bit) != 0)\n      return new X86AddressSanitizer32(STI);\n    if ((STI.getFeatureBits() & X86::Mode64Bit) != 0)\n      return new X86AddressSanitizer64(STI);\n  }\n  return new X86AsmInstrumentation();\n}\n\n} \/\/ End llvm namespace\n<commit_msg>[asan] Fix x86-32 asm instrumentation to preserve flags.<commit_after>\/\/===-- X86AsmInstrumentation.cpp - Instrument X86 inline assembly 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\/X86BaseInfo.h\"\n#include \"X86AsmInstrumentation.h\"\n#include \"X86Operand.h\"\n#include \"llvm\/ADT\/StringExtras.h\"\n#include \"llvm\/ADT\/Triple.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/MC\/MCContext.h\"\n#include \"llvm\/MC\/MCInst.h\"\n#include \"llvm\/MC\/MCInstBuilder.h\"\n#include \"llvm\/MC\/MCInstrInfo.h\"\n#include \"llvm\/MC\/MCParser\/MCParsedAsmOperand.h\"\n#include \"llvm\/MC\/MCStreamer.h\"\n#include \"llvm\/MC\/MCSubtargetInfo.h\"\n#include \"llvm\/MC\/MCTargetOptions.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n\nnamespace llvm {\nnamespace {\n\nstatic cl::opt<bool> ClAsanInstrumentAssembly(\n    \"asan-instrument-assembly\",\n    cl::desc(\"instrument assembly with AddressSanitizer checks\"), cl::Hidden,\n    cl::init(false));\n\nbool IsStackReg(unsigned Reg) {\n  return Reg == X86::RSP || Reg == X86::ESP || Reg == X86::SP;\n}\n\nstd::string FuncName(unsigned AccessSize, bool IsWrite) {\n  return std::string(\"__sanitizer_sanitize_\") + (IsWrite ? \"store\" : \"load\") +\n         (utostr(AccessSize));\n}\n\nclass X86AddressSanitizer : public X86AsmInstrumentation {\npublic:\n  X86AddressSanitizer(const MCSubtargetInfo &STI) : STI(STI) {}\n  virtual ~X86AddressSanitizer() {}\n\n  \/\/ X86AsmInstrumentation implementation:\n  virtual void InstrumentInstruction(\n      const MCInst &Inst, SmallVectorImpl<MCParsedAsmOperand *> &Operands,\n      MCContext &Ctx, const MCInstrInfo &MII, MCStreamer &Out) override {\n    InstrumentMOV(Inst, Operands, Ctx, MII, Out);\n  }\n\n  \/\/ Should be implemented differently in x86_32 and x86_64 subclasses.\n  virtual void InstrumentMemOperandImpl(X86Operand *Op, unsigned AccessSize,\n                                        bool IsWrite, MCContext &Ctx,\n                                        MCStreamer &Out) = 0;\n\n  void InstrumentMemOperand(MCParsedAsmOperand *Op, unsigned AccessSize,\n                            bool IsWrite, MCContext &Ctx, MCStreamer &Out);\n  void InstrumentMOV(const MCInst &Inst,\n                     SmallVectorImpl<MCParsedAsmOperand *> &Operands,\n                     MCContext &Ctx, const MCInstrInfo &MII, MCStreamer &Out);\n  void EmitInstruction(MCStreamer &Out, const MCInst &Inst) {\n    Out.EmitInstruction(Inst, STI);\n  }\n\nprotected:\n  const MCSubtargetInfo &STI;\n};\n\nvoid X86AddressSanitizer::InstrumentMemOperand(\n    MCParsedAsmOperand *Op, unsigned AccessSize, bool IsWrite, MCContext &Ctx,\n    MCStreamer &Out) {\n  assert(Op && Op->isMem() && \"Op should be a memory operand.\");\n  assert((AccessSize & (AccessSize - 1)) == 0 && AccessSize <= 16 &&\n         \"AccessSize should be a power of two, less or equal than 16.\");\n\n  X86Operand *MemOp = static_cast<X86Operand *>(Op);\n  \/\/ FIXME: get rid of this limitation.\n  if (IsStackReg(MemOp->getMemBaseReg()) || IsStackReg(MemOp->getMemIndexReg()))\n    return;\n\n  InstrumentMemOperandImpl(MemOp, AccessSize, IsWrite, Ctx, Out);\n}\n\nvoid X86AddressSanitizer::InstrumentMOV(\n    const MCInst &Inst, SmallVectorImpl<MCParsedAsmOperand *> &Operands,\n    MCContext &Ctx, const MCInstrInfo &MII, MCStreamer &Out) {\n  \/\/ Access size in bytes.\n  unsigned AccessSize = 0;\n\n  switch (Inst.getOpcode()) {\n  case X86::MOV8mi:\n  case X86::MOV8mr:\n  case X86::MOV8rm:\n    AccessSize = 1;\n    break;\n  case X86::MOV16mi:\n  case X86::MOV16mr:\n  case X86::MOV16rm:\n    AccessSize = 2;\n    break;\n  case X86::MOV32mi:\n  case X86::MOV32mr:\n  case X86::MOV32rm:\n    AccessSize = 4;\n    break;\n  case X86::MOV64mi32:\n  case X86::MOV64mr:\n  case X86::MOV64rm:\n    AccessSize = 8;\n    break;\n  case X86::MOVAPDmr:\n  case X86::MOVAPSmr:\n  case X86::MOVAPDrm:\n  case X86::MOVAPSrm:\n    AccessSize = 16;\n    break;\n  default:\n    return;\n  }\n\n  const bool IsWrite = MII.get(Inst.getOpcode()).mayStore();\n  for (unsigned Ix = 0; Ix < Operands.size(); ++Ix) {\n    MCParsedAsmOperand *Op = Operands[Ix];\n    if (Op && Op->isMem())\n      InstrumentMemOperand(Op, AccessSize, IsWrite, Ctx, Out);\n  }\n}\n\nclass X86AddressSanitizer32 : public X86AddressSanitizer {\npublic:\n  X86AddressSanitizer32(const MCSubtargetInfo &STI)\n      : X86AddressSanitizer(STI) {}\n  virtual ~X86AddressSanitizer32() {}\n\n  virtual void InstrumentMemOperandImpl(X86Operand *Op, unsigned AccessSize,\n                                        bool IsWrite, MCContext &Ctx,\n                                        MCStreamer &Out) override;\n};\n\nvoid X86AddressSanitizer32::InstrumentMemOperandImpl(\n    X86Operand *Op, unsigned AccessSize, bool IsWrite, MCContext &Ctx,\n    MCStreamer &Out) {\n  \/\/ FIXME: emit .cfi directives for correct stack unwinding.\n  EmitInstruction(Out, MCInstBuilder(X86::PUSH32r).addReg(X86::EAX));\n  {\n    MCInst Inst;\n    Inst.setOpcode(X86::LEA32r);\n    Inst.addOperand(MCOperand::CreateReg(X86::EAX));\n    Op->addMemOperands(Inst, 5);\n    EmitInstruction(Out, Inst);\n  }\n  EmitInstruction(Out, MCInstBuilder(X86::PUSH32r).addReg(X86::EAX));\n  {\n    const std::string Func = FuncName(AccessSize, IsWrite);\n    const MCSymbol *FuncSym = Ctx.GetOrCreateSymbol(StringRef(Func));\n    const MCSymbolRefExpr *FuncExpr =\n        MCSymbolRefExpr::Create(FuncSym, MCSymbolRefExpr::VK_PLT, Ctx);\n    EmitInstruction(Out, MCInstBuilder(X86::CALLpcrel32).addExpr(FuncExpr));\n  }\n  EmitInstruction(Out, MCInstBuilder(X86::POP32r).addReg(X86::EAX));\n  EmitInstruction(Out, MCInstBuilder(X86::POP32r).addReg(X86::EAX));\n}\n\nclass X86AddressSanitizer64 : public X86AddressSanitizer {\npublic:\n  X86AddressSanitizer64(const MCSubtargetInfo &STI)\n      : X86AddressSanitizer(STI) {}\n  virtual ~X86AddressSanitizer64() {}\n\n  virtual void InstrumentMemOperandImpl(X86Operand *Op, unsigned AccessSize,\n                                        bool IsWrite, MCContext &Ctx,\n                                        MCStreamer &Out) override;\n};\n\nvoid X86AddressSanitizer64::InstrumentMemOperandImpl(X86Operand *Op,\n                                                     unsigned AccessSize,\n                                                     bool IsWrite,\n                                                     MCContext &Ctx,\n                                                     MCStreamer &Out) {\n  \/\/ FIXME: emit .cfi directives for correct stack unwinding.\n\n  \/\/ Set %rsp below current red zone (128 bytes wide) using LEA instruction to\n  \/\/ preserve flags.\n  {\n    MCInst Inst;\n    Inst.setOpcode(X86::LEA64r);\n    Inst.addOperand(MCOperand::CreateReg(X86::RSP));\n\n    const MCExpr *Disp = MCConstantExpr::Create(-128, Ctx);\n    std::unique_ptr<X86Operand> Op(\n        X86Operand::CreateMem(0, Disp, X86::RSP, 0, 1, SMLoc(), SMLoc()));\n    Op->addMemOperands(Inst, 5);\n    EmitInstruction(Out, Inst);\n  }\n  EmitInstruction(Out, MCInstBuilder(X86::PUSH64r).addReg(X86::RDI));\n  {\n    MCInst Inst;\n    Inst.setOpcode(X86::LEA64r);\n    Inst.addOperand(MCOperand::CreateReg(X86::RDI));\n    Op->addMemOperands(Inst, 5);\n    EmitInstruction(Out, Inst);\n  }\n  {\n    const std::string Func = FuncName(AccessSize, IsWrite);\n    const MCSymbol *FuncSym = Ctx.GetOrCreateSymbol(StringRef(Func));\n    const MCSymbolRefExpr *FuncExpr =\n        MCSymbolRefExpr::Create(FuncSym, MCSymbolRefExpr::VK_PLT, Ctx);\n    EmitInstruction(Out, MCInstBuilder(X86::CALL64pcrel32).addExpr(FuncExpr));\n  }\n  EmitInstruction(Out, MCInstBuilder(X86::POP64r).addReg(X86::RDI));\n\n  \/\/ Restore old %rsp value.\n  {\n    MCInst Inst;\n    Inst.setOpcode(X86::LEA64r);\n    Inst.addOperand(MCOperand::CreateReg(X86::RSP));\n\n    const MCExpr *Disp = MCConstantExpr::Create(128, Ctx);\n    std::unique_ptr<X86Operand> Op(\n        X86Operand::CreateMem(0, Disp, X86::RSP, 0, 1, SMLoc(), SMLoc()));\n    Op->addMemOperands(Inst, 5);\n    EmitInstruction(Out, Inst);\n  }\n}\n\n} \/\/ End anonymous namespace\n\nX86AsmInstrumentation::X86AsmInstrumentation() {}\nX86AsmInstrumentation::~X86AsmInstrumentation() {}\n\nvoid X86AsmInstrumentation::InstrumentInstruction(\n    const MCInst &Inst, SmallVectorImpl<MCParsedAsmOperand *> &Operands,\n    MCContext &Ctx, const MCInstrInfo &MII, MCStreamer &Out) {}\n\nX86AsmInstrumentation *\nCreateX86AsmInstrumentation(const MCTargetOptions &MCOptions,\n                            const MCContext &Ctx, const MCSubtargetInfo &STI) {\n  Triple T(STI.getTargetTriple());\n  const bool hasCompilerRTSupport = T.isOSLinux();\n  if (ClAsanInstrumentAssembly && hasCompilerRTSupport &&\n      MCOptions.SanitizeAddress) {\n    if ((STI.getFeatureBits() & X86::Mode32Bit) != 0)\n      return new X86AddressSanitizer32(STI);\n    if ((STI.getFeatureBits() & X86::Mode64Bit) != 0)\n      return new X86AddressSanitizer64(STI);\n  }\n  return new X86AsmInstrumentation();\n}\n\n} \/\/ End llvm namespace\n<|endoftext|>"}
{"text":"<commit_before>#define DEBUG 1\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 6\/2\/2020, 1:13:26 PM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nll MOD;\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\n\/\/ ----- Mint -----\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(const Mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(const Mint &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(const Mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(const Mint &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n  Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n  Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n  Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n  bool operator<(const Mint &a) const { return x < a.x; }\n  bool operator<=(const Mint &a) const { return x <= a.x; }\n  bool operator>(const Mint &a) const { return x > a.x; }\n  bool operator>=(const Mint &a) const { return x >= a.x; }\n  bool operator==(const Mint &a) const { return x == a.x; }\n  bool operator!=(const Mint &a) const { return !(*this == a); }\n  const Mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\nMint operator+(ll lhs, const Mint &rhs)\n{\n  return rhs + lhs;\n}\nMint operator-(ll lhs, const Mint &rhs)\n{\n  return -rhs + lhs;\n}\nMint operator*(ll lhs, const Mint &rhs)\n{\n  return rhs * lhs;\n}\nMint operator\/(ll lhs, const Mint &rhs)\n{\n  return Mint{lhs} \/ rhs;\n}\nistream &operator>>(istream &stream, Mint &a)\n{\n  return stream >> a.x;\n}\nostream &operator<<(ostream &stream, const Mint &a)\n{\n  return stream << a.x;\n}\n\/\/ ----- Combination -----\nclass Combination\n{\npublic:\n  vector<Mint> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2LL; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1LL; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint;\nusing combination = Combination;\ntemplate <typename T>\nT gcd(T x, T y) { return y ? gcd(y, x % y) : x; }\ntemplate <typename T>\nT lcm(T x, T y) { return x \/ gcd(x, y) * y; }\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n  int ans{0};\n  while (x != 0)\n  {\n    ans += x & 1;\n    x >>= 1;\n  }\n  return ans;\n}\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1000000000000000LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\/\/ ----- main() -----\n\nCombination C;\n\nvector<mint> delta(int i)\n{\n  vector<mint> ans(MOD, 0);\n  ans[0] = 1;\n  mint base{-i};\n  for (auto j = 0; j < MOD; ++j)\n  {\n    ans[MOD - 1 - j] -= C(MOD - 1, j) * base.power(j);\n  }\n  return ans;\n}\n\nint main()\n{\n  cin >> MOD;\n  C = Combination();\n  vector<mint> A(MOD);\n#if DEBUG == 1\n  cerr << \"Here\" << endl;\n#endif\n  for (auto i = 0; i < MOD; ++i)\n  {\n    cin >> A[i];\n  }\n  vector<mint> B(MOD, 0);\n  for (auto i = 0; i < MOD; ++i)\n  {\n    auto V{delta(i)};\n    for (auto j = 0; j < MOD; ++j)\n    {\n      B[j] += A[i] * V[j];\n    }\n  }\n  for (auto i = 0; i < MOD; ++i)\n  {\n    cout << B[i];\n    if (i < MOD - 1)\n    {\n      cout << \" \";\n    }\n    else\n    {\n      cout << endl;\n    }\n  }\n}\n<commit_msg>tried F.cpp to 'F'<commit_after>#define DEBUG 1\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 6\/2\/2020, 1:13:26 PM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nll MOD;\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\n\/\/ ----- Mint -----\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(const Mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(const Mint &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(const Mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(const Mint &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n  Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n  Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n  Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n  bool operator<(const Mint &a) const { return x < a.x; }\n  bool operator<=(const Mint &a) const { return x <= a.x; }\n  bool operator>(const Mint &a) const { return x > a.x; }\n  bool operator>=(const Mint &a) const { return x >= a.x; }\n  bool operator==(const Mint &a) const { return x == a.x; }\n  bool operator!=(const Mint &a) const { return !(*this == a); }\n  const Mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\nMint operator+(ll lhs, const Mint &rhs)\n{\n  return rhs + lhs;\n}\nMint operator-(ll lhs, const Mint &rhs)\n{\n  return -rhs + lhs;\n}\nMint operator*(ll lhs, const Mint &rhs)\n{\n  return rhs * lhs;\n}\nMint operator\/(ll lhs, const Mint &rhs)\n{\n  return Mint{lhs} \/ rhs;\n}\nistream &operator>>(istream &stream, Mint &a)\n{\n  return stream >> a.x;\n}\nostream &operator<<(ostream &stream, const Mint &a)\n{\n  return stream << a.x;\n}\n\/\/ ----- Combination -----\nclass Combination\n{\npublic:\n  vector<Mint> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2LL; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1LL; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint;\nusing combination = Combination;\ntemplate <typename T>\nT gcd(T x, T y) { return y ? gcd(y, x % y) : x; }\ntemplate <typename T>\nT lcm(T x, T y) { return x \/ gcd(x, y) * y; }\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n  int ans{0};\n  while (x != 0)\n  {\n    ans += x & 1;\n    x >>= 1;\n  }\n  return ans;\n}\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1000000000000000LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\/\/ ----- main() -----\n\nCombination C;\n\nvector<mint> delta(int i)\n{\n  vector<mint> ans(MOD, 0);\n  ans[0] = 1;\n  mint base{-i};\n  for (auto j = 0; j < MOD; ++j)\n  {\n    ans[MOD - 1 - j] -= C(MOD - 1, j) * base.power(j);\n  }\n  return ans;\n}\n\nint main()\n{\n  cin >> MOD;\n#if DEBUG == 1\n  cerr << \"Here\" << endl;\n#endif\n  C = Combination();\n#if DEBUG == 1\n  cerr << \"Here\" << endl;\n#endif\n  vector<mint> A(MOD);\n  for (auto i = 0; i < MOD; ++i)\n  {\n    cin >> A[i];\n  }\n  vector<mint> B(MOD, 0);\n  for (auto i = 0; i < MOD; ++i)\n  {\n    auto V{delta(i)};\n    for (auto j = 0; j < MOD; ++j)\n    {\n      B[j] += A[i] * V[j];\n    }\n  }\n  for (auto i = 0; i < MOD; ++i)\n  {\n    cout << B[i];\n    if (i < MOD - 1)\n    {\n      cout << \" \";\n    }\n    else\n    {\n      cout << endl;\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: DBTypeWizDlgSetup.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: pjunck $ $Date: 2004-10-27 13:10: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 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 _DBU_REGHELPER_HXX_\n#include \"dbu_reghelper.hxx\"\n#endif\n#ifndef DBAUI_DBTYPEWIZDLGSETUP_HXX\n#include \"DBTypeWizDlgSetup.hxx\"\n#endif\n#ifndef DBAUI_DBWIZSETUP_HXX\n#include \"dbwizsetup.hxx\"\n#endif\n\nusing namespace dbaui;\n\nextern \"C\" void SAL_CALL createRegistryInfo_ODBTypeWizDialogSetup()\n{\n    static OMultiInstanceAutoRegistration< ODBTypeWizDialogSetup > aAutoRegistration;\n}\n\n\/\/.........................................................................\nnamespace dbaui\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\/\/-------------------------------------------------------------------------\nODBTypeWizDialogSetup::ODBTypeWizDialogSetup(const Reference< XMultiServiceFactory >& _rxORB)\n    :ODatabaseAdministrationDialog(_rxORB)\n{\n}\n\/\/-------------------------------------------------------------------------\nSequence<sal_Int8> SAL_CALL ODBTypeWizDialogSetup::getImplementationId(  ) throw(RuntimeException)\n{\n    static ::cppu::OImplementationId aId;\n    return aId.getImplementationId();\n}\n\n\/\/-------------------------------------------------------------------------\nReference< XInterface > SAL_CALL ODBTypeWizDialogSetup::Create(const Reference< XMultiServiceFactory >& _rxFactory)\n{\n    Reference < XInterface > xDBContext = _rxFactory->createInstance(::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"com.sun.star.sdb.DatabaseDocument\")));\n       Sequence<Any> aSequence(1);\n    PropertyValue aPropertyValue;\n    Any aTmp;\n    aTmp <<= xDBContext;\n    aPropertyValue.Name = ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"InitialSelection\"));\n    aPropertyValue.Value = aTmp;\n    aSequence[0] <<= aPropertyValue;\n    Reference < XInterface > xDBWizard = *(new ODBTypeWizDialogSetup(_rxFactory));\n    Reference < XInitialization > xDBWizardInit(xDBWizard, UNO_QUERY);\n\n    xDBWizardInit->initialize(aSequence);\n    Reference <com::sun::star::ui::dialogs::XExecutableDialog> xDBWizardExecute( xDBWizard, UNO_QUERY );\n    xDBWizardExecute->execute();\n    return xDBWizard;\n}\n\n\/\/-------------------------------------------------------------------------\n::rtl::OUString SAL_CALL ODBTypeWizDialogSetup::getImplementationName() throw(RuntimeException)\n{\n    return getImplementationName_Static();\n}\n\n\/\/-------------------------------------------------------------------------\n::rtl::OUString ODBTypeWizDialogSetup::getImplementationName_Static() throw(RuntimeException)\n{\n    return ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"org.openoffice.comp.dbu.ODBTypeWizDialogSetup\"));\n}\n\n\/\/-------------------------------------------------------------------------\n::comphelper::StringSequence SAL_CALL ODBTypeWizDialogSetup::getSupportedServiceNames() throw(RuntimeException)\n{\n    return getSupportedServiceNames_Static();\n}\n\n\/\/-------------------------------------------------------------------------\n::comphelper::StringSequence ODBTypeWizDialogSetup::getSupportedServiceNames_Static() throw(RuntimeException)\n{\n    ::comphelper::StringSequence aSupported(1);\n    aSupported.getArray()[0] = ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"com.sun.star.sdb.DatabaseWizardDialog\"));\n    return aSupported;\n}\n\n\/\/-------------------------------------------------------------------------\nReference<XPropertySetInfo>  SAL_CALL ODBTypeWizDialogSetup::getPropertySetInfo() throw(RuntimeException)\n{\n    Reference<XPropertySetInfo>  xInfo( createPropertySetInfo( getInfoHelper() ) );\n    return xInfo;\n}\n\n\/\/-------------------------------------------------------------------------\n::cppu::IPropertyArrayHelper& ODBTypeWizDialogSetup::getInfoHelper()\n{\n    return *const_cast<ODBTypeWizDialogSetup*>(this)->getArrayHelper();\n}\n\n\/\/------------------------------------------------------------------------------\n::cppu::IPropertyArrayHelper* ODBTypeWizDialogSetup::createArrayHelper( ) const\n{\n    Sequence< Property > aProps;\n    describeProperties(aProps);\n    return new ::cppu::OPropertyArrayHelper(aProps);\n}\n\/\/------------------------------------------------------------------------------\nDialog* ODBTypeWizDialogSetup::createDialog(Window* _pParent)\n{\n    ODbTypeWizDialogSetup* pDlg = new ODbTypeWizDialogSetup(_pParent, m_pDatasourceItems, m_xORB, m_aInitialSelection);\n    return pDlg;\n}\n\n\/\/.........................................................................\n}   \/\/ namespace dbaui\n\/\/.........................................................................\n\n<commit_msg>INTEGRATION: CWS imprec01 (1.2.40); FILE MERGED 2005\/01\/11 13:59:36 oj 1.2.40.1: #i39228# send document events<commit_after>\/*************************************************************************\n *\n *  $RCSfile: DBTypeWizDlgSetup.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-02-02 14:00: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 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 _DBU_REGHELPER_HXX_\n#include \"dbu_reghelper.hxx\"\n#endif\n#ifndef _COM_SUN_STAR_DOCUMENT_XEVENTLISTENER_HPP_\n#include <com\/sun\/star\/document\/XEventListener.hpp>\n#endif\n#ifndef DBAUI_DBTYPEWIZDLGSETUP_HXX\n#include \"DBTypeWizDlgSetup.hxx\"\n#endif\n#ifndef DBAUI_DBWIZSETUP_HXX\n#include \"dbwizsetup.hxx\"\n#endif\n\nusing namespace dbaui;\n\nextern \"C\" void SAL_CALL createRegistryInfo_ODBTypeWizDialogSetup()\n{\n    static OMultiInstanceAutoRegistration< ODBTypeWizDialogSetup > aAutoRegistration;\n}\n\n\/\/.........................................................................\nnamespace dbaui\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\/\/-------------------------------------------------------------------------\nODBTypeWizDialogSetup::ODBTypeWizDialogSetup(const Reference< XMultiServiceFactory >& _rxORB)\n    :ODatabaseAdministrationDialog(_rxORB)\n{\n}\n\/\/-------------------------------------------------------------------------\nSequence<sal_Int8> SAL_CALL ODBTypeWizDialogSetup::getImplementationId(  ) throw(RuntimeException)\n{\n    static ::cppu::OImplementationId aId;\n    return aId.getImplementationId();\n}\n\n\/\/-------------------------------------------------------------------------\nReference< XInterface > SAL_CALL ODBTypeWizDialogSetup::Create(const Reference< XMultiServiceFactory >& _rxFactory)\n{\n    Reference < XInterface > xDBContext = _rxFactory->createInstance(::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"com.sun.star.sdb.DatabaseDocument\")));\n       Sequence<Any> aSequence(1);\n    PropertyValue aPropertyValue;\n    Any aTmp;\n    aTmp <<= xDBContext;\n    aPropertyValue.Name = ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"InitialSelection\"));\n    aPropertyValue.Value = aTmp;\n    aSequence[0] <<= aPropertyValue;\n    Reference < XInterface > xDBWizard = *(new ODBTypeWizDialogSetup(_rxFactory));\n    Reference < XInitialization > xDBWizardInit(xDBWizard, UNO_QUERY);\n\n    xDBWizardInit->initialize(aSequence);\n\n    try\n    {\n        Reference< ::com::sun::star::document::XEventListener > xDocEventBroadcaster(_rxFactory->createInstance(::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"com.sun.star.frame.GlobalEventBroadcaster\"))),\n            UNO_QUERY);\n        if ( xDocEventBroadcaster.is() )\n        {\n            ::com::sun::star::document::EventObject aEvent(xDBContext, ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"OnNew\")) );\n            xDocEventBroadcaster->notifyEvent(aEvent);\n        }\n    }\n    catch(Exception)\n    {\n        OSL_ENSURE(0,\"Could not create GlobalEventBroadcaster!\");\n    }\n    Reference <com::sun::star::ui::dialogs::XExecutableDialog> xDBWizardExecute( xDBWizard, UNO_QUERY );\n    xDBWizardExecute->execute();\n    return xDBWizard;\n}\n\n\/\/-------------------------------------------------------------------------\n::rtl::OUString SAL_CALL ODBTypeWizDialogSetup::getImplementationName() throw(RuntimeException)\n{\n    return getImplementationName_Static();\n}\n\n\/\/-------------------------------------------------------------------------\n::rtl::OUString ODBTypeWizDialogSetup::getImplementationName_Static() throw(RuntimeException)\n{\n    return ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"org.openoffice.comp.dbu.ODBTypeWizDialogSetup\"));\n}\n\n\/\/-------------------------------------------------------------------------\n::comphelper::StringSequence SAL_CALL ODBTypeWizDialogSetup::getSupportedServiceNames() throw(RuntimeException)\n{\n    return getSupportedServiceNames_Static();\n}\n\n\/\/-------------------------------------------------------------------------\n::comphelper::StringSequence ODBTypeWizDialogSetup::getSupportedServiceNames_Static() throw(RuntimeException)\n{\n    ::comphelper::StringSequence aSupported(1);\n    aSupported.getArray()[0] = ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"com.sun.star.sdb.DatabaseWizardDialog\"));\n    return aSupported;\n}\n\n\/\/-------------------------------------------------------------------------\nReference<XPropertySetInfo>  SAL_CALL ODBTypeWizDialogSetup::getPropertySetInfo() throw(RuntimeException)\n{\n    Reference<XPropertySetInfo>  xInfo( createPropertySetInfo( getInfoHelper() ) );\n    return xInfo;\n}\n\n\/\/-------------------------------------------------------------------------\n::cppu::IPropertyArrayHelper& ODBTypeWizDialogSetup::getInfoHelper()\n{\n    return *const_cast<ODBTypeWizDialogSetup*>(this)->getArrayHelper();\n}\n\n\/\/------------------------------------------------------------------------------\n::cppu::IPropertyArrayHelper* ODBTypeWizDialogSetup::createArrayHelper( ) const\n{\n    Sequence< Property > aProps;\n    describeProperties(aProps);\n    return new ::cppu::OPropertyArrayHelper(aProps);\n}\n\/\/------------------------------------------------------------------------------\nDialog* ODBTypeWizDialogSetup::createDialog(Window* _pParent)\n{\n    ODbTypeWizDialogSetup* pDlg = new ODbTypeWizDialogSetup(_pParent, m_pDatasourceItems, m_xORB, m_aInitialSelection);\n    return pDlg;\n}\n\n\/\/.........................................................................\n}   \/\/ namespace dbaui\n\/\/.........................................................................\n\n<|endoftext|>"}
{"text":"<commit_before>#define DEBUG 1\n\/**\n * File    : D.cpp\n * Author  : Kazune Takahashi\n * Created : 2019\/9\/21 21:33:29\n * Powered by Visual Studio Code\n *\/\n#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <complex>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <functional>\n#include <random>\n#include <chrono>\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\nusing namespace std;\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\nusing ll = long long;\nclass mint\n{\npublic:\n  static ll MOD;\n  ll x;\n  mint() : x(0) {}\n  mint(ll x) : x(x % MOD) {}\n  mint operator-() const { return x ? MOD - x : 0; }\n  mint &operator+=(const mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  mint &operator-=(const mint &a) { return *this += -a; }\n  mint &operator*=(const mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  mint &operator\/=(const mint &a)\n  {\n    mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  mint operator+(const mint &a) const { return mint(*this) += a; }\n  mint operator-(const mint &a) const { return mint(*this) -= a; }\n  mint operator*(const mint &a) const { return mint(*this) *= a; }\n  mint operator\/(const mint &a) const { return mint(*this) \/= a; }\n  bool operator<(const mint &a) const { return x < a.x; }\n  bool operator==(const mint &a) const { return x == a.x; }\n  const mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\nll mint::MOD = 1e9 + 7;\nistream &operator>>(istream &stream, mint &a) { return stream >> a.x; }\nostream &operator<<(ostream &stream, const mint &a) { return stream << a.x; }\nclass combination\n{\npublic:\n  vector<mint> inv, fact, factinv;\n  static int MAX_SIZE;\n  combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[mint::MOD % i]) * (mint::MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1; i < MAX_SIZE; i++)\n    {\n      fact[i] = mint(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  mint operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n};\nint combination::MAX_SIZE = 3000010;\nll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }\n\/\/ constexpr double epsilon = 1e-10;\n\/\/ constexpr ll infty = 1000000000000000LL;\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\nclass UnionFind\n{\n  vector<long long> par;\n\npublic:\n  UnionFind() {}\n  UnionFind(int n) : par(n, -1) {}\n\n  bool is_same(int x, int y)\n  {\n    return root(x) == root(y);\n  }\n\n  bool merge(int x, int y)\n  {\n    x = root(x);\n    y = root(y);\n    if (x == y)\n    {\n      return false;\n    }\n    if (par[x] > par[y])\n    {\n      swap(x, y);\n    }\n    par[x] += par[y];\n    par[y] = x;\n    return true;\n  }\n\n  long long size(int x)\n  {\n    return -par[root(x)];\n  }\n\n  bool is_root(int x)\n  {\n    return (par[x] < 0);\n  }\n\n  void all_root()\n  {\n    for (auto i = 0u; i < par.size(); i++)\n    {\n      root(i);\n    }\n  }\n\n  void view()\n  {\n    for (auto i = 0u; i < par.size(); i++)\n    {\n      cerr << \"par[\" << i << \"] = \" << par[i] << endl;\n    }\n  }\n\nprivate:\n  int root(int x)\n  {\n    if (par[x] < 0)\n    {\n      return x;\n    }\n    return par[x] = root(par[x]);\n  }\n};\n\nll N, M, Q;\nint A[100010];\nint B[100010];\nint C[100010];\nusing edge = tuple<int, int>;\nset<edge> S[2];\n\nint main()\n{\n  cin >> N >> M >> Q;\n  for (auto i = 0; i < Q; i++)\n  {\n    cin >> A[i] >> B[i] >> C[i];\n  }\n  if (M == N - 1)\n  {\n    for (auto i = 0; i < Q; i++)\n    {\n      if (C[i] == 1)\n      {\n        No();\n      }\n    }\n    Yes();\n  }\n  for (auto i = 0; i < Q; i++)\n  {\n    if (A[i] > B[i])\n    {\n      swap(A[i], B[i]);\n      edge e{A[i], B[i]};\n      if (S[1 - C[i]].find(e) != S[1 - C[i]].end())\n      {\n        No();\n      }\n      S[C[i]].insert(e);\n#if DEBUG == 1\n      cerr << get<0>(e) << \", \" << get<1>(e) << endl;\n#endif\n    }\n  }\n  UnionFind uf(N);\n  for (auto const &e : S[0])\n  {\n    uf.merge(get<0>(e), get<1>(e));\n  }\n  uf.all_root();\n#if DEBUG == 1\n  uf.view();\n#endif\n  ll K{0};\n  ll X{0};\n  for (auto i = 0; i < N; i++)\n  {\n    if (uf.is_root(i))\n    {\n      X += uf.size(i) - 1;\n      ++K;\n    }\n  }\n  ll mini{X + K};\n  ll maxi{X + K * (K - 1) \/ 2};\n  assert(mini == N);\n  if (K >= 3 && mini <= M && M <= maxi)\n  {\n    Yes();\n  }\n  No();\n}<commit_msg>tried D.cpp to 'D'<commit_after>#define DEBUG 1\n\/**\n * File    : D.cpp\n * Author  : Kazune Takahashi\n * Created : 2019\/9\/21 21:33:29\n * Powered by Visual Studio Code\n *\/\n#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <complex>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <functional>\n#include <random>\n#include <chrono>\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\nusing namespace std;\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\nusing ll = long long;\nclass mint\n{\npublic:\n  static ll MOD;\n  ll x;\n  mint() : x(0) {}\n  mint(ll x) : x(x % MOD) {}\n  mint operator-() const { return x ? MOD - x : 0; }\n  mint &operator+=(const mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  mint &operator-=(const mint &a) { return *this += -a; }\n  mint &operator*=(const mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  mint &operator\/=(const mint &a)\n  {\n    mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  mint operator+(const mint &a) const { return mint(*this) += a; }\n  mint operator-(const mint &a) const { return mint(*this) -= a; }\n  mint operator*(const mint &a) const { return mint(*this) *= a; }\n  mint operator\/(const mint &a) const { return mint(*this) \/= a; }\n  bool operator<(const mint &a) const { return x < a.x; }\n  bool operator==(const mint &a) const { return x == a.x; }\n  const mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\nll mint::MOD = 1e9 + 7;\nistream &operator>>(istream &stream, mint &a) { return stream >> a.x; }\nostream &operator<<(ostream &stream, const mint &a) { return stream << a.x; }\nclass combination\n{\npublic:\n  vector<mint> inv, fact, factinv;\n  static int MAX_SIZE;\n  combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[mint::MOD % i]) * (mint::MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1; i < MAX_SIZE; i++)\n    {\n      fact[i] = mint(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  mint operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n};\nint combination::MAX_SIZE = 3000010;\nll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }\n\/\/ constexpr double epsilon = 1e-10;\n\/\/ constexpr ll infty = 1000000000000000LL;\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\nclass UnionFind\n{\n  vector<long long> par;\n\npublic:\n  UnionFind() {}\n  UnionFind(int n) : par(n, -1) {}\n\n  bool is_same(int x, int y)\n  {\n    return root(x) == root(y);\n  }\n\n  bool merge(int x, int y)\n  {\n    x = root(x);\n    y = root(y);\n    if (x == y)\n    {\n      return false;\n    }\n    if (par[x] > par[y])\n    {\n      swap(x, y);\n    }\n    par[x] += par[y];\n    par[y] = x;\n    return true;\n  }\n\n  long long size(int x)\n  {\n    return -par[root(x)];\n  }\n\n  bool is_root(int x)\n  {\n    return (par[x] < 0);\n  }\n\n  void all_root()\n  {\n    for (auto i = 0u; i < par.size(); i++)\n    {\n      root(i);\n    }\n  }\n\n  void view()\n  {\n    for (auto i = 0u; i < par.size(); i++)\n    {\n      cerr << \"par[\" << i << \"] = \" << par[i] << endl;\n    }\n  }\n\nprivate:\n  int root(int x)\n  {\n    if (par[x] < 0)\n    {\n      return x;\n    }\n    return par[x] = root(par[x]);\n  }\n};\n\nll N, M, Q;\nint A[100010];\nint B[100010];\nint C[100010];\nusing edge = tuple<int, int>;\nset<edge> S[2];\n\nint main()\n{\n  cin >> N >> M >> Q;\n  for (auto i = 0; i < Q; i++)\n  {\n    cin >> A[i] >> B[i] >> C[i];\n  }\n  if (M == N - 1)\n  {\n    for (auto i = 0; i < Q; i++)\n    {\n      if (C[i] == 1)\n      {\n        No();\n      }\n    }\n    Yes();\n  }\n#if DEBUG == 1\n  cerr << \"aaa\" << endl;\n#endif\n  for (auto i = 0; i < Q; i++)\n  {\n    if (A[i] > B[i])\n    {\n      swap(A[i], B[i]);\n      edge e{A[i], B[i]};\n      if (S[1 - C[i]].find(e) != S[1 - C[i]].end())\n      {\n        No();\n      }\n      S[C[i]].insert(e);\n#if DEBUG == 1\n      cerr << get<0>(e) << \", \" << get<1>(e) << endl;\n#endif\n    }\n  }\n  UnionFind uf(N);\n  for (auto const &e : S[0])\n  {\n    uf.merge(get<0>(e), get<1>(e));\n  }\n  uf.all_root();\n#if DEBUG == 1\n  uf.view();\n#endif\n  ll K{0};\n  ll X{0};\n  for (auto i = 0; i < N; i++)\n  {\n    if (uf.is_root(i))\n    {\n      X += uf.size(i) - 1;\n      ++K;\n    }\n  }\n  ll mini{X + K};\n  ll maxi{X + K * (K - 1) \/ 2};\n  assert(mini == N);\n  if (K >= 3 && mini <= M && M <= maxi)\n  {\n    Yes();\n  }\n  No();\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2015, Yahoo Inc. All rights reserved.\n * Copyrights licensed under the New BSD License.\n * See the accompanying LICENSE file for terms.\n *\/\n\n#include <iomanip>\n#include <iostream>\n#include <sstream>\n\n#include \"vm-printer.h\"\n\nnamespace http {\nnamespace filters {\nnamespace vm {\nvoid Printer::print(const Code & co, const Memory & m) const {\n  print(co, m, std::cout);\n}\n\nvoid Printer::print(const Code & co, const Memory & m,\n    std::ostream & o) const {\n\n  typedef std::pair< uint32_t, int > Pair;\n  typedef std::vector< Pair > Entries;\n  int z = 1;\n\n  Entries entries1,\n          entries2;\n\n  for (uint32_t i = 0; i < co.size; i += kSize) {\n    const uint32_t op = co[i];\n    if (op == Opcodes::kExecute\n        || op == Opcodes::kExecuteSingle) {\n      const uint32_t b = co[i + 2];\n      entries1.push_back(std::make_pair(b * kSize, z));\n      entries2.push_back(std::make_pair(i, z));\n      ++z;\n    }\n  }\n\n  const Entries::const_iterator END1 = entries1.end(),\n        END2 = entries2.end();\n\n  Entries::const_iterator it1 = entries1.begin(),\n    it2 = entries2.begin();\n\n  ASSERT(entries1.size() == entries2.size());\n\n  for (uint32_t i = 0; i < co.size; i += kSize) {\n    const uint32_t op = co[i];\n    const uint32_t a = co[i + 1];\n    const uint32_t b = co[i + 2];\n    const uint32_t c = co[i + 3];\n\n    if (it1 != END1 && it1->first == i) {\n      o << \"\\n\" \" -- Entry \" << it1->second << \" --\" \"\\n\";\n      ++it1;\n    }\n\n    o << std::resetiosflags(std::ios::left) << std::setiosflags(std::ios::right)\n      << std::setw(6) << std::dec << (i \/ kSize) << \" \"\n      << std::resetiosflags(std::ios::right) << std::setiosflags(std::ios::left)\n      << \"0x\" << std::setw(6) << std::hex << std::setfill('0') <<  (i * sizeof(uint32_t)) << std::setfill(' ') << \" \"\n      << std::setw(30) << opcode(static_cast< Opcodes::OPCODES >(op))\n      << \"0x\" << std::setw(8) << a\n      << \"0x\" << std::setw(8) << b\n      << \"0x\" << std::setw(8) << c;\n\n    std::stringstream comments;\n\n    if (op == Opcodes::kExecute || op == Opcodes::kExecuteSingle) {\n      switch(a) {\n      case ExecutionMode::kNone:\n        comments << ( ! comments.str().empty() ? \", \" : \"\") << \" kNone\";\n        break;\n      case ExecutionMode::kAnd:\n        comments << ( ! comments.str().empty() ? \", \" : \"\") << \" kAnd\";\n        break;\n      case ExecutionMode::kOr:\n        comments << ( ! comments.str().empty() ? \", \" : \"\") << \" kOr\";\n        break;\n      default: ASSERT(false); break; \/\/unreacheable\n      }\n    }\n\n    if (it2 != END2 && it2->first == i) {\n      ASSERT(op == Opcodes::kExecute\n          || op == Opcodes::kExecuteSingle);\n      comments << ( ! comments.str().empty() ? \", \" : \"\") << \"Entry \" << it2->second;\n      ++it2;\n    }\n\n    if ( ! comments.str().empty()) {\n      o << \" \/\/\" << comments.str();\n      comments.str().clear();\n    }\n\n    o << \"\\n\";\n\n    switch (op) {\n      case Opcodes::kContainsCookie:\n      case Opcodes::kContainsDomain:\n      case Opcodes::kContainsHeader:\n      case Opcodes::kContainsPath:\n      case Opcodes::kContainsQueryParameter:\n      case Opcodes::kEqualCookie:\n      case Opcodes::kEqualDomain:\n      case Opcodes::kEqualHeader:\n      case Opcodes::kEqualPath:\n      case Opcodes::kEqualQueryParameter:\n      case Opcodes::kExistsCookie:\n      case Opcodes::kExistsHeader:\n      case Opcodes::kExistsQueryParameter:\n      case Opcodes::kGreaterThanAfterCookie:\n      case Opcodes::kGreaterThanAfterHeader:\n      case Opcodes::kGreaterThanAfterQueryParameter:\n      case Opcodes::kGreaterThanCookie:\n      case Opcodes::kGreaterThanHeader:\n      case Opcodes::kGreaterThanQueryParameter:\n      case Opcodes::kIsMethod:\n      case Opcodes::kIsScheme:\n      case Opcodes::kLessThanAfterCookie:\n      case Opcodes::kLessThanAfterHeader:\n      case Opcodes::kLessThanAfterQueryParameter:\n      case Opcodes::kLessThanCookie:\n      case Opcodes::kLessThanHeader:\n      case Opcodes::kLessThanQueryParameter:\n      case Opcodes::kNotEqualDomain:\n      case Opcodes::kNotEqualPath:\n      case Opcodes::kNotEqualCookie:\n      case Opcodes::kNotEqualHeader:\n      case Opcodes::kNotEqualQueryParameter:\n      case Opcodes::kPrintDebug:\n      case Opcodes::kPrintError:\n        if (a != 0) {\n          ASSERT(a < m.size);\n          o << \" -> \\\"\" << m.t + a << \"\\\"\\n\";\n        }\n        break;\n\n      default:\n        break;\n    }\n\n    switch (op) {\n      case Opcodes::kContainsCookie:\n      case Opcodes::kContainsHeader:\n      case Opcodes::kContainsQueryParameter:\n      case Opcodes::kEqualCookie:\n      case Opcodes::kEqualHeader:\n      case Opcodes::kEqualQueryParameter:\n      case Opcodes::kGreaterThanAfterCookie:\n      case Opcodes::kGreaterThanAfterHeader:\n      case Opcodes::kGreaterThanAfterQueryParameter:\n      case Opcodes::kLessThanAfterCookie:\n      case Opcodes::kLessThanAfterHeader:\n      case Opcodes::kLessThanAfterQueryParameter:\n      case Opcodes::kLessThanQueryParameter:\n      case Opcodes::kNotEqualCookie:\n      case Opcodes::kNotEqualHeader:\n      case Opcodes::kNotEqualQueryParameter:\n      case Opcodes::kPrintDebug:\n      case Opcodes::kPrintError:\n        if (b != 0) {\n          ASSERT(b < m.size);\n          o << \" -> \\\"\" << m.t + b << \"\\\"\\n\";\n        }\n        break;\n\n      default:\n        break;\n    }\n  }\n\n  o << std::flush;\n}\n\nconst char * Printer::opcode(Opcodes::OPCODES op) {\n  switch (op) {\n  case Opcodes::kNull:\n    return \"kNull\"; break;\n\n  case Opcodes::kSkip:\n    return \"kSkip\"; break;\n  case Opcodes::kExecute:\n    return \"kExecute\"; break;\n  case Opcodes::kExecuteSingle:\n    return \"kExecuteSingle\"; break;\n  case Opcodes::kReturn:\n    return \"kReturn\"; break;\n  case Opcodes::kHalt:\n    return \"kHalt\"; break;\n\n  case Opcodes::kNone:\n    return \"kNone\"; break;\n  case Opcodes::kAnd:\n    return \"kAnd\"; break;\n  case Opcodes::kOr:\n    return \"kOr\"; break;\n  case Opcodes::kNot:\n    return \"kNot\"; break;\n\n  case Opcodes::kFalse:\n    return \"kFalse\"; break;\n  case Opcodes::kTrue:\n    return \"kTrue\"; break;\n\n  case Opcodes::kPrintError:\n    return \"kPrintError\"; break;\n  case Opcodes::kPrintDebug:\n    return \"kPrintDebug\"; break;\n\n  case Opcodes::kIsMethod:\n    return \"kIsMethod\"; break;\n  case Opcodes::kIsScheme:\n    return \"kIsScheme\"; break;\n\n  case Opcodes::kContainsDomain:\n    return \"kContainsDomain\"; break;\n  case Opcodes::kEqualDomain:\n    return \"kEqualDomain\"; break;\n  case Opcodes::kNotEqualDomain:\n    return \"kNotEqualDomain\"; break;\n  case Opcodes::kStartsWithDomain:\n    return \"kStartsWithDomain\"; break;\n\n  case Opcodes::kContainsPath:\n    return \"kContainsPath\"; break;\n  case Opcodes::kEqualPath:\n    return \"kEqualPath\"; break;\n  case Opcodes::kNotEqualPath:\n    return \"kNotEqualPath\"; break;\n  case Opcodes::kStartsWithPath:\n    return \"kStartsWithPath\"; break;\n\n  case Opcodes::kContainsQueryParameter:\n    return \"kContainsQueryParameter\"; break;\n  case Opcodes::kEqualQueryParameter:\n    return \"kEqualQueryParameter\"; break;\n  case Opcodes::kExistsQueryParameter:\n    return \"kExistsQueryParameter\"; break;\n  case Opcodes::kGreaterThanQueryParameter:\n    return \"kGreaterThanQueryParameter\"; break;\n  case Opcodes::kGreaterThanAfterQueryParameter:\n    return \"kGreaterThanAfterQueryParameter\"; break;\n  case Opcodes::kLessThanQueryParameter:\n    return \"kLessThanQueryParameter\"; break;\n  case Opcodes::kLessThanAfterQueryParameter:\n    return \"kLessThanAfterQueryParameter\"; break;\n  case Opcodes::kNotEqualQueryParameter:\n    return \"kNotEqualQueryParameter\"; break;\n  case Opcodes::kStartsWithQueryParameter:\n    return \"kStartsWithQueryParameter\"; break;\n\n  case Opcodes::kContainsHeader:\n    return \"kContainsHeader\"; break;\n  case Opcodes::kEqualHeader:\n    return \"kEqualHeader\"; break;\n  case Opcodes::kExistsHeader:\n    return \"kExistsHeader\"; break;\n  case Opcodes::kGreaterThanHeader:\n    return \"kGreaterThanHeader\"; break;\n  case Opcodes::kGreaterThanAfterHeader:\n    return \"kGreaterThanAfterHeader\"; break;\n  case Opcodes::kLessThanHeader:\n    return \"kLessThanHeader\"; break;\n  case Opcodes::kLessThanAfterHeader:\n    return \"kLessThanAfterHeader\"; break;\n  case Opcodes::kNotEqualHeader:\n    return \"kNotEqualHeader\"; break;\n  case Opcodes::kStartsWithHeader:\n    return \"kStartsWithHeader\"; break;\n\n  case Opcodes::kContainsCookie:\n    return \"kContainsCookie\"; break;\n  case Opcodes::kEqualCookie:\n    return \"kEqualCookie\"; break;\n  case Opcodes::kExistsCookie:\n    return \"kExistsCookie\"; break;\n  case Opcodes::kGreaterThanCookie:\n    return \"kGreaterThanCookie\"; break;\n  case Opcodes::kGreaterThanAfterCookie:\n    return \"kGreaterThanAfterCookie\"; break;\n  case Opcodes::kLessThanCookie:\n    return \"kLessThanCookie\"; break;\n  case Opcodes::kLessThanAfterCookie:\n    return \"kLessThanAfterCookie\"; break;\n  case Opcodes::kNotEqualCookie:\n    return \"kNotEqualCookie\"; break;\n  case Opcodes::kStartsWithCookie:\n    return \"kStartsWithCookie\"; break;\n\n  case Opcodes::kUpperBound:\n    return \"kUpperBound\"; break;\n\n  default: return \"(Unknown)\"; break;\n  }\n}\n} \/\/end of vm namespace\n} \/\/end of filters namespace\n} \/\/end of http namespace\n<commit_msg>enhancing printing for StartsWith ops<commit_after>\/*\n * Copyright (c) 2015, Yahoo Inc. All rights reserved.\n * Copyrights licensed under the New BSD License.\n * See the accompanying LICENSE file for terms.\n *\/\n\n#include <iomanip>\n#include <iostream>\n#include <sstream>\n\n#include \"vm-printer.h\"\n\nnamespace http {\nnamespace filters {\nnamespace vm {\nvoid Printer::print(const Code & co, const Memory & m) const {\n  print(co, m, std::cout);\n}\n\nvoid Printer::print(const Code & co, const Memory & m,\n    std::ostream & o) const {\n\n  typedef std::pair< uint32_t, int > Pair;\n  typedef std::vector< Pair > Entries;\n  int z = 1;\n\n  Entries entries1,\n          entries2;\n\n  for (uint32_t i = 0; i < co.size; i += kSize) {\n    const uint32_t op = co[i];\n    if (op == Opcodes::kExecute\n        || op == Opcodes::kExecuteSingle) {\n      const uint32_t b = co[i + 2];\n      entries1.push_back(std::make_pair(b * kSize, z));\n      entries2.push_back(std::make_pair(i, z));\n      ++z;\n    }\n  }\n\n  const Entries::const_iterator END1 = entries1.end(),\n        END2 = entries2.end();\n\n  Entries::const_iterator it1 = entries1.begin(),\n    it2 = entries2.begin();\n\n  ASSERT(entries1.size() == entries2.size());\n\n  for (uint32_t i = 0; i < co.size; i += kSize) {\n    const uint32_t op = co[i];\n    const uint32_t a = co[i + 1];\n    const uint32_t b = co[i + 2];\n    const uint32_t c = co[i + 3];\n\n    if (it1 != END1 && it1->first == i) {\n      o << \"\\n\" \" -- Entry \" << it1->second << \" --\" \"\\n\";\n      ++it1;\n    }\n\n    o << std::resetiosflags(std::ios::left) << std::setiosflags(std::ios::right)\n      << std::setw(6) << std::dec << (i \/ kSize) << \" \"\n      << std::resetiosflags(std::ios::right) << std::setiosflags(std::ios::left)\n      << \"0x\" << std::setw(6) << std::hex << std::setfill('0') <<  (i * sizeof(uint32_t)) << std::setfill(' ') << \" \"\n      << std::setw(30) << opcode(static_cast< Opcodes::OPCODES >(op))\n      << \"0x\" << std::setw(8) << a\n      << \"0x\" << std::setw(8) << b\n      << \"0x\" << std::setw(8) << c;\n\n    std::stringstream comments;\n\n    if (op == Opcodes::kExecute || op == Opcodes::kExecuteSingle) {\n      switch(a) {\n      case ExecutionMode::kNone:\n        comments << ( ! comments.str().empty() ? \", \" : \"\") << \" kNone\";\n        break;\n      case ExecutionMode::kAnd:\n        comments << ( ! comments.str().empty() ? \", \" : \"\") << \" kAnd\";\n        break;\n      case ExecutionMode::kOr:\n        comments << ( ! comments.str().empty() ? \", \" : \"\") << \" kOr\";\n        break;\n      default: ASSERT(false); break; \/\/unreacheable\n      }\n    }\n\n    if (it2 != END2 && it2->first == i) {\n      ASSERT(op == Opcodes::kExecute\n          || op == Opcodes::kExecuteSingle);\n      comments << ( ! comments.str().empty() ? \", \" : \"\") << \"Entry \" << it2->second;\n      ++it2;\n    }\n\n    if ( ! comments.str().empty()) {\n      o << \" \/\/\" << comments.str();\n      comments.str().clear();\n    }\n\n    o << \"\\n\";\n\n    switch (op) {\n      case Opcodes::kContainsCookie:\n      case Opcodes::kContainsDomain:\n      case Opcodes::kContainsHeader:\n      case Opcodes::kContainsPath:\n      case Opcodes::kContainsQueryParameter:\n      case Opcodes::kEqualCookie:\n      case Opcodes::kEqualDomain:\n      case Opcodes::kEqualHeader:\n      case Opcodes::kEqualPath:\n      case Opcodes::kEqualQueryParameter:\n      case Opcodes::kExistsCookie:\n      case Opcodes::kExistsHeader:\n      case Opcodes::kExistsQueryParameter:\n      case Opcodes::kGreaterThanAfterCookie:\n      case Opcodes::kGreaterThanAfterHeader:\n      case Opcodes::kGreaterThanAfterQueryParameter:\n      case Opcodes::kGreaterThanCookie:\n      case Opcodes::kGreaterThanHeader:\n      case Opcodes::kGreaterThanQueryParameter:\n      case Opcodes::kIsMethod:\n      case Opcodes::kIsScheme:\n      case Opcodes::kLessThanAfterCookie:\n      case Opcodes::kLessThanAfterHeader:\n      case Opcodes::kLessThanAfterQueryParameter:\n      case Opcodes::kLessThanCookie:\n      case Opcodes::kLessThanHeader:\n      case Opcodes::kLessThanQueryParameter:\n      case Opcodes::kNotEqualDomain:\n      case Opcodes::kNotEqualPath:\n      case Opcodes::kNotEqualCookie:\n      case Opcodes::kNotEqualHeader:\n      case Opcodes::kNotEqualQueryParameter:\n      case Opcodes::kPrintDebug:\n      case Opcodes::kPrintError:\n      case Opcodes::kStartsWithCookie:\n      case Opcodes::kStartsWithDomain:\n      case Opcodes::kStartsWithHeader:\n      case Opcodes::kStartsWithPath:\n      case Opcodes::kStartsWithQueryParameter:\n        if (a != 0) {\n          ASSERT(a < m.size);\n          o << \" -> \\\"\" << m.t + a << \"\\\"\\n\";\n        }\n        break;\n\n      default:\n        break;\n    }\n\n    switch (op) {\n      case Opcodes::kContainsCookie:\n      case Opcodes::kContainsHeader:\n      case Opcodes::kContainsQueryParameter:\n      case Opcodes::kEqualCookie:\n      case Opcodes::kEqualHeader:\n      case Opcodes::kEqualQueryParameter:\n      case Opcodes::kGreaterThanAfterCookie:\n      case Opcodes::kGreaterThanAfterHeader:\n      case Opcodes::kGreaterThanAfterQueryParameter:\n      case Opcodes::kLessThanAfterCookie:\n      case Opcodes::kLessThanAfterHeader:\n      case Opcodes::kLessThanAfterQueryParameter:\n      case Opcodes::kLessThanQueryParameter:\n      case Opcodes::kNotEqualCookie:\n      case Opcodes::kNotEqualHeader:\n      case Opcodes::kNotEqualQueryParameter:\n      case Opcodes::kPrintDebug:\n      case Opcodes::kPrintError:\n      case Opcodes::kStartsWithCookie:\n      case Opcodes::kStartsWithDomain:\n      case Opcodes::kStartsWithHeader:\n      case Opcodes::kStartsWithPath:\n      case Opcodes::kStartsWithQueryParameter:\n        if (b != 0) {\n          ASSERT(b < m.size);\n          o << \" -> \\\"\" << m.t + b << \"\\\"\\n\";\n        }\n        break;\n\n      default:\n        break;\n    }\n  }\n\n  o << std::flush;\n}\n\nconst char * Printer::opcode(Opcodes::OPCODES op) {\n  switch (op) {\n  case Opcodes::kNull:\n    return \"kNull\"; break;\n\n  case Opcodes::kSkip:\n    return \"kSkip\"; break;\n  case Opcodes::kExecute:\n    return \"kExecute\"; break;\n  case Opcodes::kExecuteSingle:\n    return \"kExecuteSingle\"; break;\n  case Opcodes::kReturn:\n    return \"kReturn\"; break;\n  case Opcodes::kHalt:\n    return \"kHalt\"; break;\n\n  case Opcodes::kNone:\n    return \"kNone\"; break;\n  case Opcodes::kAnd:\n    return \"kAnd\"; break;\n  case Opcodes::kOr:\n    return \"kOr\"; break;\n  case Opcodes::kNot:\n    return \"kNot\"; break;\n\n  case Opcodes::kFalse:\n    return \"kFalse\"; break;\n  case Opcodes::kTrue:\n    return \"kTrue\"; break;\n\n  case Opcodes::kPrintError:\n    return \"kPrintError\"; break;\n  case Opcodes::kPrintDebug:\n    return \"kPrintDebug\"; break;\n\n  case Opcodes::kIsMethod:\n    return \"kIsMethod\"; break;\n  case Opcodes::kIsScheme:\n    return \"kIsScheme\"; break;\n\n  case Opcodes::kContainsDomain:\n    return \"kContainsDomain\"; break;\n  case Opcodes::kEqualDomain:\n    return \"kEqualDomain\"; break;\n  case Opcodes::kNotEqualDomain:\n    return \"kNotEqualDomain\"; break;\n  case Opcodes::kStartsWithDomain:\n    return \"kStartsWithDomain\"; break;\n\n  case Opcodes::kContainsPath:\n    return \"kContainsPath\"; break;\n  case Opcodes::kEqualPath:\n    return \"kEqualPath\"; break;\n  case Opcodes::kNotEqualPath:\n    return \"kNotEqualPath\"; break;\n  case Opcodes::kStartsWithPath:\n    return \"kStartsWithPath\"; break;\n\n  case Opcodes::kContainsQueryParameter:\n    return \"kContainsQueryParameter\"; break;\n  case Opcodes::kEqualQueryParameter:\n    return \"kEqualQueryParameter\"; break;\n  case Opcodes::kExistsQueryParameter:\n    return \"kExistsQueryParameter\"; break;\n  case Opcodes::kGreaterThanQueryParameter:\n    return \"kGreaterThanQueryParameter\"; break;\n  case Opcodes::kGreaterThanAfterQueryParameter:\n    return \"kGreaterThanAfterQueryParameter\"; break;\n  case Opcodes::kLessThanQueryParameter:\n    return \"kLessThanQueryParameter\"; break;\n  case Opcodes::kLessThanAfterQueryParameter:\n    return \"kLessThanAfterQueryParameter\"; break;\n  case Opcodes::kNotEqualQueryParameter:\n    return \"kNotEqualQueryParameter\"; break;\n  case Opcodes::kStartsWithQueryParameter:\n    return \"kStartsWithQueryParameter\"; break;\n\n  case Opcodes::kContainsHeader:\n    return \"kContainsHeader\"; break;\n  case Opcodes::kEqualHeader:\n    return \"kEqualHeader\"; break;\n  case Opcodes::kExistsHeader:\n    return \"kExistsHeader\"; break;\n  case Opcodes::kGreaterThanHeader:\n    return \"kGreaterThanHeader\"; break;\n  case Opcodes::kGreaterThanAfterHeader:\n    return \"kGreaterThanAfterHeader\"; break;\n  case Opcodes::kLessThanHeader:\n    return \"kLessThanHeader\"; break;\n  case Opcodes::kLessThanAfterHeader:\n    return \"kLessThanAfterHeader\"; break;\n  case Opcodes::kNotEqualHeader:\n    return \"kNotEqualHeader\"; break;\n  case Opcodes::kStartsWithHeader:\n    return \"kStartsWithHeader\"; break;\n\n  case Opcodes::kContainsCookie:\n    return \"kContainsCookie\"; break;\n  case Opcodes::kEqualCookie:\n    return \"kEqualCookie\"; break;\n  case Opcodes::kExistsCookie:\n    return \"kExistsCookie\"; break;\n  case Opcodes::kGreaterThanCookie:\n    return \"kGreaterThanCookie\"; break;\n  case Opcodes::kGreaterThanAfterCookie:\n    return \"kGreaterThanAfterCookie\"; break;\n  case Opcodes::kLessThanCookie:\n    return \"kLessThanCookie\"; break;\n  case Opcodes::kLessThanAfterCookie:\n    return \"kLessThanAfterCookie\"; break;\n  case Opcodes::kNotEqualCookie:\n    return \"kNotEqualCookie\"; break;\n  case Opcodes::kStartsWithCookie:\n    return \"kStartsWithCookie\"; break;\n\n  case Opcodes::kUpperBound:\n    return \"kUpperBound\"; break;\n\n  default: return \"(Unknown)\"; break;\n  }\n}\n} \/\/end of vm namespace\n} \/\/end of filters namespace\n} \/\/end of http namespace\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: ZipPackageEntry.cxx,v $\n *\n *  $Revision: 1.25 $\n *\n *  last change: $Author: kz $ $Date: 2004-10-04 21:09:49 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): Martin Gallwey (gallwey@sun.com)\n *\n *\n ************************************************************************\/\n#ifndef _ZIP_PACKAGE_ENTRY_HXX\n#include <ZipPackageEntry.hxx>\n#endif\n#ifndef _COM_SUN_STAR_PACKAGE_ZIP_ZIPCONSTANTS_HPP_\n#include <com\/sun\/star\/packages\/zip\/ZipConstants.hpp>\n#endif\n#ifndef _VOS_DIAGNOSE_H_\n#include <vos\/diagnose.hxx>\n#endif\n#ifndef _IMPL_VALID_CHARACTERS_HXX_\n#include <ImplValidCharacters.hxx>\n#endif\n#ifndef _ZIP_PACKAGE_FOLDER_HXX\n#include <ZipPackageFolder.hxx>\n#endif\n#ifndef _ZIP_PACKAGE_STREAM_HXX\n#include <ZipPackageStream.hxx>\n#endif\n#ifndef _CONTENT_INFO_HXX_\n#include <ContentInfo.hxx>\n#endif\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::container;\nusing namespace com::sun::star::packages::zip;\nusing namespace com::sun::star::packages::zip::ZipConstants;\n\nZipPackageEntry::ZipPackageEntry ( bool bNewFolder )\n: pParent ( NULL )\n, mbIsFolder ( bNewFolder )\n{\n}\n\nZipPackageEntry::~ZipPackageEntry()\n{\n    \/\/ When the entry is destroyed it must be already disconnected from the parent\n    OSL_ENSURE( !pParent, \"The parent must be disconnected already! Memory corruption is possible!\\n\" );\n}\n\n\/\/ XChild\nOUString SAL_CALL ZipPackageEntry::getName(  )\n    throw(RuntimeException)\n{\n    return aEntry.sName;\n}\nvoid SAL_CALL ZipPackageEntry::setName( const OUString& aName )\n    throw(RuntimeException)\n{\n    if ( pParent && pParent->hasByName ( aEntry.sName ) )\n        pParent->removeByName ( aEntry.sName );\n\n    const sal_Unicode *pChar = aName.getStr();\n    VOS_ENSURE ( Impl_IsValidChar (pChar, static_cast < sal_Int16 > ( aName.getLength() ), sal_False), \"Invalid character in new zip package entry name!\");\n\n    aEntry.sName = aName;\n\n    if ( pParent )\n        pParent->doInsertByName ( this, sal_False );\n}\nReference< XInterface > SAL_CALL ZipPackageEntry::getParent(  )\n        throw(RuntimeException)\n{\n    \/\/ return Reference< XInterface >( xParent, UNO_QUERY );\n    return Reference< XInterface >( static_cast< ::cppu::OWeakObject* >( pParent ), UNO_QUERY );\n}\n\nvoid ZipPackageEntry::doSetParent ( ZipPackageFolder * pNewParent, sal_Bool bInsert )\n{\n    \/\/ xParent = pParent = pNewParent;\n    pParent = pNewParent;\n    if ( bInsert && !pNewParent->hasByName ( aEntry.sName ) )\n        pNewParent->doInsertByName ( this, sal_False );\n}\n\nvoid SAL_CALL ZipPackageEntry::setParent( const Reference< XInterface >& xNewParent )\n        throw(NoSupportException, RuntimeException)\n{\n    sal_Int64 nTest;\n    Reference < XUnoTunnel > xTunnel ( xNewParent, UNO_QUERY );\n    if ( !xNewParent.is() || ( nTest = xTunnel->getSomething ( ZipPackageFolder::static_getImplementationId () ) ) == 0 )\n        throw NoSupportException();\n\n    ZipPackageFolder *pNewParent = reinterpret_cast < ZipPackageFolder * > ( nTest );\n\n    if ( pNewParent != pParent )\n    {\n        if ( pParent && pParent->hasByName ( aEntry.sName ) )\n            pParent->removeByName( aEntry.sName );\n        doSetParent ( pNewParent, sal_True );\n    }\n}\n    \/\/XPropertySet\nReference< beans::XPropertySetInfo > SAL_CALL ZipPackageEntry::getPropertySetInfo(  )\n        throw(RuntimeException)\n{\n    return Reference < beans::XPropertySetInfo > ();\n}\nvoid SAL_CALL ZipPackageEntry::addPropertyChangeListener( const OUString& aPropertyName, const Reference< beans::XPropertyChangeListener >& xListener )\n        throw(beans::UnknownPropertyException, WrappedTargetException, RuntimeException)\n{\n}\nvoid SAL_CALL ZipPackageEntry::removePropertyChangeListener( const OUString& aPropertyName, const Reference< beans::XPropertyChangeListener >& aListener )\n        throw(beans::UnknownPropertyException, WrappedTargetException, RuntimeException)\n{\n}\nvoid SAL_CALL ZipPackageEntry::addVetoableChangeListener( const OUString& PropertyName, const Reference< beans::XVetoableChangeListener >& aListener )\n        throw(beans::UnknownPropertyException, WrappedTargetException, RuntimeException)\n{\n}\nvoid SAL_CALL ZipPackageEntry::removeVetoableChangeListener( const OUString& PropertyName, const Reference< beans::XVetoableChangeListener >& aListener )\n        throw(beans::UnknownPropertyException, WrappedTargetException, RuntimeException)\n{\n}\n<commit_msg>INTEGRATION: CWS mav18 (1.25.44); FILE MERGED 2005\/05\/27 14:52:21 mav 1.25.44.1: #i49755# fix incoplete commit problem<commit_after>\/*************************************************************************\n *\n *  $RCSfile: ZipPackageEntry.cxx,v $\n *\n *  $Revision: 1.26 $\n *\n *  last change: $Author: kz $ $Date: 2005-07-12 12:31: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): Martin Gallwey (gallwey@sun.com)\n *\n *\n ************************************************************************\/\n#ifndef _ZIP_PACKAGE_ENTRY_HXX\n#include <ZipPackageEntry.hxx>\n#endif\n#ifndef _COM_SUN_STAR_PACKAGE_ZIP_ZIPCONSTANTS_HPP_\n#include <com\/sun\/star\/packages\/zip\/ZipConstants.hpp>\n#endif\n#ifndef _VOS_DIAGNOSE_H_\n#include <vos\/diagnose.hxx>\n#endif\n#ifndef _IMPL_VALID_CHARACTERS_HXX_\n#include <ImplValidCharacters.hxx>\n#endif\n#ifndef _ZIP_PACKAGE_FOLDER_HXX\n#include <ZipPackageFolder.hxx>\n#endif\n#ifndef _ZIP_PACKAGE_STREAM_HXX\n#include <ZipPackageStream.hxx>\n#endif\n#ifndef _CONTENT_INFO_HXX_\n#include <ContentInfo.hxx>\n#endif\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::container;\nusing namespace com::sun::star::packages::zip;\nusing namespace com::sun::star::packages::zip::ZipConstants;\n\nZipPackageEntry::ZipPackageEntry ( bool bNewFolder )\n: pParent ( NULL )\n, mbIsFolder ( bNewFolder )\n, mbAllowRemoveOnInsert( sal_True )\n{\n}\n\nZipPackageEntry::~ZipPackageEntry()\n{\n    \/\/ When the entry is destroyed it must be already disconnected from the parent\n    OSL_ENSURE( !pParent, \"The parent must be disconnected already! Memory corruption is possible!\\n\" );\n}\n\n\/\/ XChild\nOUString SAL_CALL ZipPackageEntry::getName(  )\n    throw(RuntimeException)\n{\n    return aEntry.sName;\n}\nvoid SAL_CALL ZipPackageEntry::setName( const OUString& aName )\n    throw(RuntimeException)\n{\n    if ( pParent && pParent->hasByName ( aEntry.sName ) )\n        pParent->removeByName ( aEntry.sName );\n\n    const sal_Unicode *pChar = aName.getStr();\n    VOS_ENSURE ( Impl_IsValidChar (pChar, static_cast < sal_Int16 > ( aName.getLength() ), sal_False), \"Invalid character in new zip package entry name!\");\n\n    aEntry.sName = aName;\n\n    if ( pParent )\n        pParent->doInsertByName ( this, sal_False );\n}\nReference< XInterface > SAL_CALL ZipPackageEntry::getParent(  )\n        throw(RuntimeException)\n{\n    \/\/ return Reference< XInterface >( xParent, UNO_QUERY );\n    return Reference< XInterface >( static_cast< ::cppu::OWeakObject* >( pParent ), UNO_QUERY );\n}\n\nvoid ZipPackageEntry::doSetParent ( ZipPackageFolder * pNewParent, sal_Bool bInsert )\n{\n    \/\/ xParent = pParent = pNewParent;\n    pParent = pNewParent;\n    if ( bInsert && !pNewParent->hasByName ( aEntry.sName ) )\n        pNewParent->doInsertByName ( this, sal_False );\n}\n\nvoid SAL_CALL ZipPackageEntry::setParent( const Reference< XInterface >& xNewParent )\n        throw(NoSupportException, RuntimeException)\n{\n    sal_Int64 nTest;\n    Reference < XUnoTunnel > xTunnel ( xNewParent, UNO_QUERY );\n    if ( !xNewParent.is() || ( nTest = xTunnel->getSomething ( ZipPackageFolder::static_getImplementationId () ) ) == 0 )\n        throw NoSupportException();\n\n    ZipPackageFolder *pNewParent = reinterpret_cast < ZipPackageFolder * > ( nTest );\n\n    if ( pNewParent != pParent )\n    {\n        if ( pParent && pParent->hasByName ( aEntry.sName ) && mbAllowRemoveOnInsert )\n            pParent->removeByName( aEntry.sName );\n        doSetParent ( pNewParent, sal_True );\n    }\n}\n    \/\/XPropertySet\nReference< beans::XPropertySetInfo > SAL_CALL ZipPackageEntry::getPropertySetInfo(  )\n        throw(RuntimeException)\n{\n    return Reference < beans::XPropertySetInfo > ();\n}\nvoid SAL_CALL ZipPackageEntry::addPropertyChangeListener( const OUString& aPropertyName, const Reference< beans::XPropertyChangeListener >& xListener )\n        throw(beans::UnknownPropertyException, WrappedTargetException, RuntimeException)\n{\n}\nvoid SAL_CALL ZipPackageEntry::removePropertyChangeListener( const OUString& aPropertyName, const Reference< beans::XPropertyChangeListener >& aListener )\n        throw(beans::UnknownPropertyException, WrappedTargetException, RuntimeException)\n{\n}\nvoid SAL_CALL ZipPackageEntry::addVetoableChangeListener( const OUString& PropertyName, const Reference< beans::XVetoableChangeListener >& aListener )\n        throw(beans::UnknownPropertyException, WrappedTargetException, RuntimeException)\n{\n}\nvoid SAL_CALL ZipPackageEntry::removeVetoableChangeListener( const OUString& PropertyName, const Reference< beans::XVetoableChangeListener >& aListener )\n        throw(beans::UnknownPropertyException, WrappedTargetException, RuntimeException)\n{\n}\n<|endoftext|>"}
{"text":"<commit_before>#define DEBUG 1\n\/**\n * File    : B.cpp\n * Author  : Kazune Takahashi\n * Created : 12\/28\/2019, 10:05:50 PM\n * Powered by Visual Studio Code\n *\/\n#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <complex>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <functional>\n#include <random>\n#include <chrono>\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n\/\/ ----- using directives and manipulations -----\nusing boost::rational;\nusing namespace std;\nusing ll = long long;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{x % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(const Mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(const Mint &a) { return *this += -a; }\n  Mint &operator*=(const Mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(const Mint &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n  Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n  Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n  Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n  bool operator<(const Mint &a) const { return x < a.x; }\n  bool operator<=(const Mint &a) const { return x <= a.x; }\n  bool operator>(const Mint &a) const { return x > a.x; }\n  bool operator>=(const Mint &a) const { return x >= a.x; }\n  bool operator==(const Mint &a) const { return x == a.x; }\n  bool operator!=(const Mint &a) const { return !(*this == a); }\n  const Mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, const Mint<MOD> &rhs)\n{\n  return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, const Mint<MOD> &rhs)\n{\n  return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n  return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, const Mint<MOD> &a)\n{\n  return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2LL; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1LL; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\nll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1000000000000000LL};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\/\/ ----- main() -----\n\nclass Solve\n{\n  ll N, M, V, P;\n  vector<ll> A;\n  vector<ll> sum;\n\npublic:\n  Solve(ll N, ll M, ll V, ll P, vector<ll> A) : N{N}, M{M}, V{V}, P{P}, A(A), sum(N + 1, 0LL)\n  {\n    sum[P - 1] = A[P - 1];\n    for (auto i = P; i < N; i++)\n    {\n      sum[P] = A[P] + sum[P - 1];\n    }\n  }\n\n  ll answer()\n  {\n    if (V <= P)\n    {\n      return answer0();\n    }\n    else\n    {\n      return answer1();\n    }\n  }\n\nprivate:\n  ll answer0()\n  {\n    ll ans{0};\n    for (auto i = P; i < N; i++)\n    {\n      if (A[P - 1] <= A[i] + M)\n      {\n        ans++;\n      }\n    }\n    return ans + P;\n  }\n\n  ll answer1()\n  {\n    ll ok{P - 1};\n    ll ng{N};\n    if (abs(ok - ng) > 1)\n    {\n      ll t{(ok + ng) \/ 2};\n      if (test(t))\n      {\n        ok = t;\n      }\n      else\n      {\n        ng = t;\n      }\n    }\n    return ok + 1;\n  }\n\n  bool test(ll i)\n  {\n    ll K{V - (P - 1) - (N - i)};\n    if (K <= 0)\n    {\n      return A[i] + M >= A[P - 1];\n    }\n    return (A[i] + M) * (i - (P - 1)) >= sum[i - 1] + K * M;\n  }\n};\n\nint main()\n{\n  ll N, M, V, P;\n  cin >> N >> M >> V >> P;\n  vector<ll> A(N);\n  for (auto i = 0; i < N; i++)\n  {\n    cin >> A[i];\n  }\n  sort(A.rbegin(), A.rend());\n  Solve solve(N, M, V, P, A);\n  cout << solve.answer() << endl;\n}\n<commit_msg>tried B.cpp to 'B'<commit_after>#define DEBUG 1\n\/**\n * File    : B.cpp\n * Author  : Kazune Takahashi\n * Created : 12\/28\/2019, 10:05:50 PM\n * Powered by Visual Studio Code\n *\/\n#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <complex>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <functional>\n#include <random>\n#include <chrono>\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n\/\/ ----- using directives and manipulations -----\nusing boost::rational;\nusing namespace std;\nusing ll = long long;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{x % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(const Mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(const Mint &a) { return *this += -a; }\n  Mint &operator*=(const Mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(const Mint &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n  Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n  Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n  Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n  bool operator<(const Mint &a) const { return x < a.x; }\n  bool operator<=(const Mint &a) const { return x <= a.x; }\n  bool operator>(const Mint &a) const { return x > a.x; }\n  bool operator>=(const Mint &a) const { return x >= a.x; }\n  bool operator==(const Mint &a) const { return x == a.x; }\n  bool operator!=(const Mint &a) const { return !(*this == a); }\n  const Mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, const Mint<MOD> &rhs)\n{\n  return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, const Mint<MOD> &rhs)\n{\n  return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n  return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, const Mint<MOD> &a)\n{\n  return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2LL; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1LL; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\nll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1000000000000000LL};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\/\/ ----- main() -----\n\nclass Solve\n{\n  ll N, M, V, P;\n  vector<ll> A;\n  vector<ll> sum;\n\npublic:\n  Solve(ll N, ll M, ll V, ll P, vector<ll> A) : N{N}, M{M}, V{V}, P{P}, A(A), sum(N + 1, 0LL)\n  {\n    sum[P - 1] = A[P - 1];\n    for (auto i = P; i < N; i++)\n    {\n      sum[P] = A[P] + sum[P - 1];\n    }\n  }\n\n  ll answer()\n  {\n    if (V <= P)\n    {\n      return answer0();\n    }\n    else\n    {\n      return answer1();\n    }\n  }\n\nprivate:\n  ll answer0()\n  {\n    ll ans{0};\n    for (auto i = P; i < N; i++)\n    {\n      if (A[P - 1] <= A[i] + M)\n      {\n        ans++;\n      }\n    }\n    return ans + P;\n  }\n\n  ll answer1()\n  {\n    ll ok{P - 1};\n    ll ng{N};\n    if (abs(ok - ng) > 1)\n    {\n      ll t{(ok + ng) \/ 2};\n      if (test(t))\n      {\n        ok = t;\n      }\n      else\n      {\n        ng = t;\n      }\n    }\n    return ok + 1;\n  }\n\n  bool test(ll i)\n  {\n    ll K{V - (P - 1) - (N - i)};\n    if (K <= 0)\n    {\n#if DEBUG == 1\n      cerr << \"i = \" << i << endl;\n      cerr << \"A[\" << i << \"] = \" << A[i] << endl;\n      cerr << \"M = \" << M << endl;\n      cerr << \"P - 1 = \" << P - 1 << endl;\n      cerr << \"A[\" << P - 1 << \"] = \" << A[P - 1] << endl;\n#endif\n      return A[i] + M >= A[P - 1];\n    }\n    return (A[i] + M) * (i - (P - 1)) >= sum[i - 1] + K * M;\n  }\n};\n\nint main()\n{\n  ll N, M, V, P;\n  cin >> N >> M >> V >> P;\n  vector<ll> A(N);\n  for (auto i = 0; i < N; i++)\n  {\n    cin >> A[i];\n  }\n  sort(A.rbegin(), A.rend());\n  Solve solve(N, M, V, P, A);\n  cout << solve.answer() << endl;\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 <gtest\/gtest.h>\n#include <HippoMocks\/hippomocks.h>\n#include <atomic>\n#include <functional>\n#include <condition_variable>\n#include <mutex>\n#include <chrono>\n\n#include \"NSProviderInterface.h\"\n#include \"NSConsumerSimulator.h\"\n#include \"NSCommon.h\"\n\nnamespace\n{\n    std::atomic_bool g_isStartedStack(false);\n\n    std::chrono::milliseconds g_waitForResponse(500);\n\n    std::condition_variable responseCon;\n    std::mutex mutexForCondition;\n\n    NSConsumerSimulator g_consumerSimul;\n    NSConsumer * g_consumer;\n}\n\nclass TestWithMock: public testing::Test\n{\npublic:\n    MockRepository mocks;\n\nprotected:\n    virtual ~TestWithMock() noexcept(noexcept(std::declval<Test>().~Test())) {}\n\n    virtual void TearDown() {\n        try\n        {\n            mocks.VerifyAll();\n        }\n        catch (...)\n        {\n            mocks.reset();\n            throw;\n        }\n    }\n};\n\nclass NotificationProviderTest : public TestWithMock\n{\npublic:\n    NotificationProviderTest() = default;\n    ~NotificationProviderTest() = default;\n\n    static void NSRequestedSubscribeCallbackEmpty(NSConsumer *)\n    {\n        std::cout << __func__ << std::endl;\n    }\n\n    static void NSSyncCallbackEmpty(NSSyncInfo *)\n    {\n        std::cout << __func__ << std::endl;\n    }\n\n    static void NSMessageCallbackFromConsumerEmpty(\n            const int &, const std::string &, const std::string &, const std::string &)\n    {\n        std::cout << __func__ << std::endl;\n    }\n\n    static void NSSyncCallbackFromConsumerEmpty(int, int)\n    {\n        std::cout << __func__ << std::endl;\n    }\n\nprotected:\n\n    void SetUp()\n    {\n        TestWithMock::SetUp();\n\n        if (g_isStartedStack == false)\n        {\n            OC::PlatformConfig cfg\n            {\n                OC::ServiceType::InProc,\n                OC::ModeType::Both,\n                \"0.0.0.0\",\n                0,\n                OC::QualityOfService::HighQos\n            };\n            OC::OCPlatform::Configure(cfg);\n\n            try\n            {\n                OC::OCPlatform::stopPresence();\n            }\n            catch (...)\n            {\n\n            }\n\n            g_isStartedStack = true;\n        }\n\n    }\n\n    void TearDown()\n    {\n        TestWithMock::TearDown();\n    }\n\n};\n\nTEST_F(NotificationProviderTest, StartProviderPositiveWithNSPolicyTrue)\n{\n    NSProviderConfig config;\n    config.subRequestCallback = NSRequestedSubscribeCallbackEmpty;\n    config.syncInfoCallback = NSSyncCallbackEmpty;\n    config.policy = true;\n    config.userInfo = NULL;\n\n    NSResult ret = NSStartProvider(config);\n\n    std::unique_lock< std::mutex > lock{ mutexForCondition };\n    responseCon.wait_for(lock, g_waitForResponse);\n\n    EXPECT_EQ(ret, NS_OK);\n}\n\nTEST_F(NotificationProviderTest, StopProviderPositive)\n{\n    NSResult ret = NSStopProvider();\n\n    std::unique_lock< std::mutex > lock{ mutexForCondition };\n    responseCon.wait_for(lock, g_waitForResponse);\n\n    EXPECT_EQ(ret, NS_OK);\n}\n\nTEST_F(NotificationProviderTest, StartProviderPositiveWithNSPolicyFalse)\n{\n    NSProviderConfig config;\n    config.subRequestCallback = NSRequestedSubscribeCallbackEmpty;\n    config.syncInfoCallback = NSSyncCallbackEmpty;\n    config.policy = false;\n    config.userInfo = NULL;\n\n    NSResult ret = NSStartProvider(config);\n\n    std::unique_lock< std::mutex > lock{ mutexForCondition };\n    responseCon.wait_for(lock, std::chrono::milliseconds(3000));\n    g_consumerSimul.findProvider();\n\n    responseCon.wait_for(lock, std::chrono::milliseconds(3000));\n    NSStopProvider();\n    EXPECT_EQ(ret, NS_OK);\n}\n\nTEST_F(NotificationProviderTest, ExpectCallbackWhenReceiveSubscribeRequestWithAccepterProvider)\n{\n    mocks.ExpectCallFunc(NSRequestedSubscribeCallbackEmpty).Do(\n            [](NSConsumer * consumer)\n            {\n                std::cout << \"NSRequestedSubscribeCallback\" << std::endl;\n                g_consumer = (NSConsumer *)malloc(sizeof(NSConsumer));\n                strncpy(g_consumer->consumerId , consumer->consumerId, 37);\n                responseCon.notify_all();\n            });\n\n    NSProviderConfig config;\n    config.subRequestCallback = NSRequestedSubscribeCallbackEmpty;\n    config.syncInfoCallback = NSSyncCallbackEmpty;\n    config.policy = true;\n    config.userInfo = NULL;\n\n    NSStartProvider(config);\n\n    {\n        std::unique_lock< std::mutex > lock{ mutexForCondition };\n        responseCon.wait_for(lock, g_waitForResponse);\n    }\n\n    g_consumerSimul.setCallback(NSMessageCallbackFromConsumerEmpty,\n            NSSyncCallbackFromConsumerEmpty);\n    g_consumerSimul.findProvider();\n\n    std::unique_lock< std::mutex > lock{ mutexForCondition };\n    responseCon.wait_for(lock, std::chrono::milliseconds(1000));\n}\n\nTEST_F(NotificationProviderTest, NeverCallNotifyOnConsumerByAcceptIsFalse)\n{\n    bool expectTrue = true;\n    int msgID;\n\n    mocks.OnCallFunc(NSMessageCallbackFromConsumerEmpty).Do(\n            [& expectTrue, &msgID](const int &id, const std::string&, const std::string&, const std::string&)\n            {\n                if (id == msgID)\n                {\n                    std::cout << \"This function never call\" << std::endl;\n                    expectTrue = false;\n                }\n            });\n\n    NSAcceptSubscription(g_consumer, false);\n\n    NSMessage * msg = NSCreateMessage();\n    msgID = (int)msg->messageId;\n    msg->title = strdup(std::string(\"Title\").c_str());\n    msg->contentText = strdup(std::string(\"ContentText\").c_str());\n    msg->sourceName = strdup(std::string(\"OCF\").c_str());\n\n    NSSendMessage(msg);\n    {\n        std::unique_lock< std::mutex > lock{ mutexForCondition };\n        responseCon.wait_for(lock, g_waitForResponse);\n    }\n\n    std::unique_lock< std::mutex > lock{ mutexForCondition };\n    responseCon.wait_for(lock, std::chrono::milliseconds(1000));\n\n    EXPECT_EQ(expectTrue, true);\n\n    NSAcceptSubscription(g_consumer, true);\n}\n\nTEST_F(NotificationProviderTest, ExpectCallNotifyOnConsumerByAcceptIsTrue)\n{\n    int msgID;\n\n    mocks.ExpectCallFunc(NSMessageCallbackFromConsumerEmpty).Do(\n            [&msgID](const int &id, const std::string&, const std::string&, const std::string&)\n            {\n                std::cout << \"id : \" << id << std::endl;\n                if (id == msgID)\n                {\n                    std::cout << \"ExpectCallNotifyOnConsumerByAcceptIsTrue\" << std::endl;\n                }\n                responseCon.notify_all();\n            });\n\n    NSAcceptSubscription(g_consumer, true);\n\n    NSMessage * msg = new NSMessage();\n    msgID = 10;\n    msg->title = strdup(std::string(\"Title\").c_str());\n    msg->contentText = strdup(std::string(\"ContentText\").c_str());\n    msg->sourceName = strdup(std::string(\"OCF\").c_str());\n    NSSendMessage(msg);\n\n    std::unique_lock< std::mutex > lock{ mutexForCondition };\n    responseCon.wait(lock);\n}\n\nTEST_F(NotificationProviderTest, ExpectCallbackSyncOnReadToConsumer)\n{\n    int id;\n\n    mocks.ExpectCallFunc(NSSyncCallbackFromConsumerEmpty).Do(\n            [& id](int & type, int &syncId)\n            {\n        std::cout << \"NSSyncCallbackEmpty\" << std::endl;\n                if (syncId == id &&\n                        type == NS_SYNC_READ)\n                {\n                    std::cout << \"ExpectCallbackSyncOnReadFromConsumer\" << std::endl;\n                    responseCon.notify_all();\n                }\n            });\n\n    NSMessage * msg = NSCreateMessage();\n    id = (int)msg->messageId;\n    msg->title = strdup(std::string(\"Title\").c_str());\n    msg->contentText = strdup(std::string(\"ContentText\").c_str());\n    msg->sourceName = strdup(std::string(\"OCF\").c_str());\n\n    NSProviderSendSyncInfo(msg->messageId, NS_SYNC_READ);\n    std::unique_lock< std::mutex > lock{ mutexForCondition };\n    responseCon.wait_for(lock, std::chrono::milliseconds(5000));\n}\n\nTEST_F(NotificationProviderTest, ExpectCallbackSyncOnReadFromConsumer)\n{\n    int type = NS_SYNC_READ;\n    int id;\n    mocks.ExpectCallFunc(NSSyncCallbackEmpty).Do(\n            [& id](NSSyncInfo * sync)\n            {\n                std::cout << \"NSSyncCallbackEmpty\" << std::endl;\n                if ((int)sync->messageId == id && sync->state == NS_SYNC_READ)\n                {\n                    std::cout << \"ExpectCallbackSyncOnReadFromConsumer\" << std::endl;\n                    responseCon.notify_all();\n                }\n            });\n\n    NSMessage * msg = NSCreateMessage();\n    id = (int)msg->messageId;\n    msg->title = strdup(std::string(\"Title\").c_str());\n    msg->contentText = strdup(std::string(\"ContentText\").c_str());\n    msg->sourceName = strdup(std::string(\"OCF\").c_str());\n\n    g_consumerSimul.syncToProvider(type, id, msg->providerId);\n    std::unique_lock< std::mutex > lock{ mutexForCondition };\n    responseCon.wait_for(lock, std::chrono::milliseconds(5000));\n}\n\nTEST_F(NotificationProviderTest, CancelObserves)\n{\n    bool ret = g_consumerSimul.cancelObserves();\n\n    std::unique_lock< std::mutex > lock{ mutexForCondition };\n    responseCon.wait_for(lock, std::chrono::milliseconds(5000));\n\n    EXPECT_EQ(ret, true);\n}\n<commit_msg>Bug fixes unittest for ExpectCallNotifyOnConsumerByAcceptIsTrue.<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 <gtest\/gtest.h>\n#include <HippoMocks\/hippomocks.h>\n#include <atomic>\n#include <functional>\n#include <condition_variable>\n#include <mutex>\n#include <chrono>\n\n#include \"NSProviderInterface.h\"\n#include \"NSConsumerSimulator.h\"\n#include \"NSCommon.h\"\n\nnamespace\n{\n    std::atomic_bool g_isStartedStack(false);\n\n    std::chrono::milliseconds g_waitForResponse(500);\n\n    std::condition_variable responseCon;\n    std::mutex mutexForCondition;\n\n    NSConsumerSimulator g_consumerSimul;\n    NSConsumer * g_consumer;\n}\n\nclass TestWithMock: public testing::Test\n{\npublic:\n    MockRepository mocks;\n\nprotected:\n    virtual ~TestWithMock() noexcept(noexcept(std::declval<Test>().~Test())) {}\n\n    virtual void TearDown() {\n        try\n        {\n            mocks.VerifyAll();\n        }\n        catch (...)\n        {\n            mocks.reset();\n            throw;\n        }\n    }\n};\n\nclass NotificationProviderTest : public TestWithMock\n{\npublic:\n    NotificationProviderTest() = default;\n    ~NotificationProviderTest() = default;\n\n    static void NSRequestedSubscribeCallbackEmpty(NSConsumer *)\n    {\n        std::cout << __func__ << std::endl;\n    }\n\n    static void NSSyncCallbackEmpty(NSSyncInfo *)\n    {\n        std::cout << __func__ << std::endl;\n    }\n\n    static void NSMessageCallbackFromConsumerEmpty(\n            const int &, const std::string &, const std::string &, const std::string &)\n    {\n        std::cout << __func__ << std::endl;\n    }\n\n    static void NSSyncCallbackFromConsumerEmpty(int, int)\n    {\n        std::cout << __func__ << std::endl;\n    }\n\nprotected:\n\n    void SetUp()\n    {\n        TestWithMock::SetUp();\n\n        if (g_isStartedStack == false)\n        {\n            OC::PlatformConfig cfg\n            {\n                OC::ServiceType::InProc,\n                OC::ModeType::Both,\n                \"0.0.0.0\",\n                0,\n                OC::QualityOfService::HighQos\n            };\n            OC::OCPlatform::Configure(cfg);\n\n            try\n            {\n                OC::OCPlatform::stopPresence();\n            }\n            catch (...)\n            {\n\n            }\n\n            g_isStartedStack = true;\n        }\n\n    }\n\n    void TearDown()\n    {\n        TestWithMock::TearDown();\n    }\n\n};\n\nTEST_F(NotificationProviderTest, StartProviderPositiveWithNSPolicyTrue)\n{\n    NSProviderConfig config;\n    config.subRequestCallback = NSRequestedSubscribeCallbackEmpty;\n    config.syncInfoCallback = NSSyncCallbackEmpty;\n    config.policy = true;\n    config.userInfo = NULL;\n\n    NSResult ret = NSStartProvider(config);\n\n    std::unique_lock< std::mutex > lock{ mutexForCondition };\n    responseCon.wait_for(lock, g_waitForResponse);\n\n    EXPECT_EQ(ret, NS_OK);\n}\n\nTEST_F(NotificationProviderTest, StopProviderPositive)\n{\n    NSResult ret = NSStopProvider();\n\n    std::unique_lock< std::mutex > lock{ mutexForCondition };\n    responseCon.wait_for(lock, g_waitForResponse);\n\n    EXPECT_EQ(ret, NS_OK);\n}\n\nTEST_F(NotificationProviderTest, StartProviderPositiveWithNSPolicyFalse)\n{\n    NSProviderConfig config;\n    config.subRequestCallback = NSRequestedSubscribeCallbackEmpty;\n    config.syncInfoCallback = NSSyncCallbackEmpty;\n    config.policy = false;\n    config.userInfo = NULL;\n\n    NSResult ret = NSStartProvider(config);\n\n    std::unique_lock< std::mutex > lock{ mutexForCondition };\n    responseCon.wait_for(lock, std::chrono::milliseconds(3000));\n    g_consumerSimul.findProvider();\n\n    responseCon.wait_for(lock, std::chrono::milliseconds(3000));\n    NSStopProvider();\n    EXPECT_EQ(ret, NS_OK);\n}\n\nTEST_F(NotificationProviderTest, ExpectCallbackWhenReceiveSubscribeRequestWithAccepterProvider)\n{\n    mocks.ExpectCallFunc(NSRequestedSubscribeCallbackEmpty).Do(\n            [](NSConsumer * consumer)\n            {\n                std::cout << \"NSRequestedSubscribeCallback\" << std::endl;\n                g_consumer = (NSConsumer *)malloc(sizeof(NSConsumer));\n                strncpy(g_consumer->consumerId , consumer->consumerId, 37);\n                responseCon.notify_all();\n            });\n\n    NSProviderConfig config;\n    config.subRequestCallback = NSRequestedSubscribeCallbackEmpty;\n    config.syncInfoCallback = NSSyncCallbackEmpty;\n    config.policy = true;\n    config.userInfo = NULL;\n\n    NSStartProvider(config);\n\n    {\n        std::unique_lock< std::mutex > lock{ mutexForCondition };\n        responseCon.wait_for(lock, g_waitForResponse);\n    }\n\n    g_consumerSimul.setCallback(NSMessageCallbackFromConsumerEmpty,\n            NSSyncCallbackFromConsumerEmpty);\n    g_consumerSimul.findProvider();\n\n    std::unique_lock< std::mutex > lock{ mutexForCondition };\n    responseCon.wait_for(lock, std::chrono::milliseconds(1000));\n}\n\nTEST_F(NotificationProviderTest, NeverCallNotifyOnConsumerByAcceptIsFalse)\n{\n    bool expectTrue = true;\n    int msgID;\n\n    mocks.OnCallFunc(NSMessageCallbackFromConsumerEmpty).Do(\n            [& expectTrue, &msgID](const int &id, const std::string&, const std::string&, const std::string&)\n            {\n                if (id == msgID)\n                {\n                    std::cout << \"This function never call\" << std::endl;\n                    expectTrue = false;\n                }\n            });\n\n    NSAcceptSubscription(g_consumer, false);\n\n    NSMessage * msg = NSCreateMessage();\n    msgID = (int)msg->messageId;\n    msg->title = strdup(std::string(\"Title\").c_str());\n    msg->contentText = strdup(std::string(\"ContentText\").c_str());\n    msg->sourceName = strdup(std::string(\"OCF\").c_str());\n\n    NSSendMessage(msg);\n    {\n        std::unique_lock< std::mutex > lock{ mutexForCondition };\n        responseCon.wait_for(lock, g_waitForResponse);\n    }\n\n    std::unique_lock< std::mutex > lock{ mutexForCondition };\n    responseCon.wait_for(lock, std::chrono::milliseconds(1000));\n\n    EXPECT_EQ(expectTrue, true);\n\n    NSAcceptSubscription(g_consumer, true);\n}\n\nTEST_F(NotificationProviderTest, ExpectCallNotifyOnConsumerByAcceptIsTrue)\n{\n    int msgID;\n\n    mocks.ExpectCallFunc(NSMessageCallbackFromConsumerEmpty).Do(\n            [&msgID](const int &id, const std::string&, const std::string&, const std::string&)\n            {\n                std::cout << \"id : \" << id << std::endl;\n                if (id == msgID)\n                {\n                    std::cout << \"ExpectCallNotifyOnConsumerByAcceptIsTrue\" << std::endl;\n                    responseCon.notify_all();\n                }\n            });\n\n    NSAcceptSubscription(g_consumer, true);\n\n    NSMessage * msg = NSCreateMessage();\n    msgID = (int)msg->messageId;\n    msg->title = strdup(std::string(\"Title\").c_str());\n    msg->contentText = strdup(std::string(\"ContentText\").c_str());\n    msg->sourceName = strdup(std::string(\"OCF\").c_str());\n    NSSendMessage(msg);\n\n    std::unique_lock< std::mutex > lock{ mutexForCondition };\n    responseCon.wait(lock);\n}\n\nTEST_F(NotificationProviderTest, ExpectCallbackSyncOnReadToConsumer)\n{\n    int id;\n\n    mocks.ExpectCallFunc(NSSyncCallbackFromConsumerEmpty).Do(\n            [& id](int & type, int &syncId)\n            {\n        std::cout << \"NSSyncCallbackEmpty\" << std::endl;\n                if (syncId == id &&\n                        type == NS_SYNC_READ)\n                {\n                    std::cout << \"ExpectCallbackSyncOnReadFromConsumer\" << std::endl;\n                    responseCon.notify_all();\n                }\n            });\n\n    NSMessage * msg = NSCreateMessage();\n    id = (int)msg->messageId;\n    msg->title = strdup(std::string(\"Title\").c_str());\n    msg->contentText = strdup(std::string(\"ContentText\").c_str());\n    msg->sourceName = strdup(std::string(\"OCF\").c_str());\n\n    NSProviderSendSyncInfo(msg->messageId, NS_SYNC_READ);\n    std::unique_lock< std::mutex > lock{ mutexForCondition };\n    responseCon.wait_for(lock, std::chrono::milliseconds(5000));\n}\n\nTEST_F(NotificationProviderTest, ExpectCallbackSyncOnReadFromConsumer)\n{\n    int type = NS_SYNC_READ;\n    int id;\n    mocks.ExpectCallFunc(NSSyncCallbackEmpty).Do(\n            [& id](NSSyncInfo * sync)\n            {\n                std::cout << \"NSSyncCallbackEmpty\" << std::endl;\n                if ((int)sync->messageId == id && sync->state == NS_SYNC_READ)\n                {\n                    std::cout << \"ExpectCallbackSyncOnReadFromConsumer\" << std::endl;\n                    responseCon.notify_all();\n                }\n            });\n\n    NSMessage * msg = NSCreateMessage();\n    id = (int)msg->messageId;\n    msg->title = strdup(std::string(\"Title\").c_str());\n    msg->contentText = strdup(std::string(\"ContentText\").c_str());\n    msg->sourceName = strdup(std::string(\"OCF\").c_str());\n\n    g_consumerSimul.syncToProvider(type, id, msg->providerId);\n    std::unique_lock< std::mutex > lock{ mutexForCondition };\n    responseCon.wait_for(lock, std::chrono::milliseconds(5000));\n}\n\nTEST_F(NotificationProviderTest, CancelObserves)\n{\n    bool ret = g_consumerSimul.cancelObserves();\n\n    std::unique_lock< std::mutex > lock{ mutexForCondition };\n    responseCon.wait_for(lock, std::chrono::milliseconds(5000));\n\n    EXPECT_EQ(ret, true);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <boost\/test\/unit_test.hpp>\n\n#include \"util.h\"\n#include \"scrypt.h\"\n\nBOOST_AUTO_TEST_SUITE(scrypt_tests)\n\nBOOST_AUTO_TEST_CASE(scrypt_hashtest)\n{\n    \/\/ Test Scrypt hash with known inputs against expected outputs\n    #define HASHCOUNT 5\n    const char* inputhex[HASHCOUNT] = { \"020000004c1271c211717198227392b029a64a7971931d351b387bb80db027f270411e398a07046f7d4a08dd815412a8712f874a7ebf0507e3878bd24e20a3b73fd750a667d2f451eac7471b00de6659\", \"0200000011503ee6a855e900c00cfdd98f5f55fffeaee9b6bf55bea9b852d9de2ce35828e204eef76acfd36949ae56d1fbe81c1ac9c0209e6331ad56414f9072506a77f8c6faf551eac7471b00389d01\", \"02000000a72c8a177f523946f42f22c3e86b8023221b4105e8007e59e81f6beb013e29aaf635295cb9ac966213fb56e046dc71df5b3f7f67ceaeab24038e743f883aff1aaafaf551eac7471b0166249b\", \"010000007824bc3a8a1b4628485eee3024abd8626721f7f870f8ad4d2f33a27155167f6a4009d1285049603888fe85a84b6c803a53305a8d497965a5e896e1a00568359589faf551eac7471b0065434e\", \"0200000050bfd4e4a307a8cb6ef4aef69abc5c0f2d579648bd80d7733e1ccc3fbc90ed664a7f74006cb11bde87785f229ecd366c2d4e44432832580e0608c579e4cb76f383f7f551eac7471b00c36982\" };\n    const char* expected[HASHCOUNT] = { \"00000000002bef4107f882f6115e0b01f348d21195dacd3582aa2dabd7985806\" , \"00000000003a0d11bdd5eb634e08b7feddcfbbf228ed35d250daf19f1c88fc94\", \"00000000000b40f895f288e13244728a6c2d9d59d8aff29c65f8dd5114a8ca81\", \"00000000003007005891cd4923031e99d8e8d72f6e8e7edc6a86181897e105fe\", \"000000000018f0b426a4afc7130ccb47fa02af730d345b4fe7c7724d3800ec8c\" };\n    uint256 scrypthash;\n    std::vector<unsigned char> inputbytes;\n\n    for (int i = 0; i < HASHCOUNT; i++) {\n        inputbytes = ParseHex(inputhex[i]);\n        scrypt_1024_1_1_256((const char*)&inputbytes[0], BEGIN(scrypthash));\n        BOOST_CHECK_EQUAL(scrypthash.ToString().c_str(), expected[i]);\n    }\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<commit_msg>Litecoin: SSE2 scrypt unit test coverage<commit_after>#include <boost\/test\/unit_test.hpp>\n\n#include \"util.h\"\n#include \"scrypt.h\"\n\nBOOST_AUTO_TEST_SUITE(scrypt_tests)\n\nBOOST_AUTO_TEST_CASE(scrypt_hashtest)\n{\n    \/\/ Test Scrypt hash with known inputs against expected outputs\n    #define HASHCOUNT 5\n    const char* inputhex[HASHCOUNT] = { \"020000004c1271c211717198227392b029a64a7971931d351b387bb80db027f270411e398a07046f7d4a08dd815412a8712f874a7ebf0507e3878bd24e20a3b73fd750a667d2f451eac7471b00de6659\", \"0200000011503ee6a855e900c00cfdd98f5f55fffeaee9b6bf55bea9b852d9de2ce35828e204eef76acfd36949ae56d1fbe81c1ac9c0209e6331ad56414f9072506a77f8c6faf551eac7471b00389d01\", \"02000000a72c8a177f523946f42f22c3e86b8023221b4105e8007e59e81f6beb013e29aaf635295cb9ac966213fb56e046dc71df5b3f7f67ceaeab24038e743f883aff1aaafaf551eac7471b0166249b\", \"010000007824bc3a8a1b4628485eee3024abd8626721f7f870f8ad4d2f33a27155167f6a4009d1285049603888fe85a84b6c803a53305a8d497965a5e896e1a00568359589faf551eac7471b0065434e\", \"0200000050bfd4e4a307a8cb6ef4aef69abc5c0f2d579648bd80d7733e1ccc3fbc90ed664a7f74006cb11bde87785f229ecd366c2d4e44432832580e0608c579e4cb76f383f7f551eac7471b00c36982\" };\n    const char* expected[HASHCOUNT] = { \"00000000002bef4107f882f6115e0b01f348d21195dacd3582aa2dabd7985806\" , \"00000000003a0d11bdd5eb634e08b7feddcfbbf228ed35d250daf19f1c88fc94\", \"00000000000b40f895f288e13244728a6c2d9d59d8aff29c65f8dd5114a8ca81\", \"00000000003007005891cd4923031e99d8e8d72f6e8e7edc6a86181897e105fe\", \"000000000018f0b426a4afc7130ccb47fa02af730d345b4fe7c7724d3800ec8c\" };\n    uint256 scrypthash;\n    std::vector<unsigned char> inputbytes;\n    char scratchpad[SCRYPT_SCRATCHPAD_SIZE];\n    for (int i = 0; i < HASHCOUNT; i++) {\n        inputbytes = ParseHex(inputhex[i]);\n#if defined(USE_SSE2)\n        \/\/ Test SSE2 scrypt\n        scrypt_1024_1_1_256_sp_sse2((const char*)&inputbytes[0], BEGIN(scrypthash), scratchpad);\n#endif\n        \/\/ Test generic scrypt\n        scrypt_1024_1_1_256_sp_generic((const char*)&inputbytes[0], BEGIN(scrypthash), scratchpad);\n        BOOST_CHECK_EQUAL(scrypthash.ToString().c_str(), expected[i]);\n    }\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<|endoftext|>"}
{"text":"<commit_before>#define DEBUG 1\n\/**\n * File    : D.cpp\n * Author  : Kazune Takahashi\n * Created : 6\/16\/2020, 3:58:35 AM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ld = long double;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1'000'000'007LL};\n\/\/ constexpr ll MOD{998'244'353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3'000'010LL};\n\/\/ constexpr ll MAX_SIZE{30'000'010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nbool ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n    return true;\n  }\n  return false;\n}\ntemplate <typename T>\nbool ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n    return true;\n  }\n  return false;\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(Mint const &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(Mint const &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(Mint const &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(Mint const &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(Mint const &a) const { return Mint(*this) += a; }\n  Mint operator-(Mint const &a) const { return Mint(*this) -= a; }\n  Mint operator*(Mint const &a) const { return Mint(*this) *= a; }\n  Mint operator\/(Mint const &a) const { return Mint(*this) \/= a; }\n  bool operator<(Mint const &a) const { return x < a.x; }\n  bool operator<=(Mint const &a) const { return x <= a.x; }\n  bool operator>(Mint const &a) const { return x > a.x; }\n  bool operator>=(Mint const &a) const { return x >= a.x; }\n  bool operator==(Mint const &a) const { return x == a.x; }\n  bool operator!=(Mint const &a) const { return !(*this == a); }\n  Mint power(ll N) const\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, Mint<MOD> const &rhs) { return rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, Mint<MOD> const &rhs) { return -rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, Mint<MOD> const &rhs) { return rhs * lhs; }\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, Mint<MOD> const &rhs) { return Mint<MOD>{lhs} \/ rhs; }\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a) { return stream >> a.x; }\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, Mint<MOD> const &a) { return stream << a.x; }\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i{2LL}; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i{1LL}; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\ntemplate <typename T>\nT gcd(T x, T y) { return y ? gcd(y, x % y) : x; }\ntemplate <typename T>\nT lcm(T x, T y) { return x \/ gcd(x, y) * y; }\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n  int ans{0};\n  while (x != 0)\n  {\n    ans += x & 1;\n    x >>= 1;\n  }\n  return ans;\n}\n\/\/ ----- Infty -----\ntemplate <typename T>\nconstexpr T Infty() { return numeric_limits<T>::max(); }\ntemplate <typename T>\nconstexpr T mInfty() { return numeric_limits<T>::min(); }\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1'000'000'000'000'010LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\nconstexpr int dx[4] = {1, 0, -1, 0};\nconstexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\n\/\/ ----- WarshallFloyd -----\n\ntemplate <typename T>\nvoid WarshallFloyd(vector<vector<T>> &V, T infinity = numeric_limits<T>::max())\n{\n  \/\/ It is valid to apply this method for\n  \/\/  - a directed\/undirected graph,\n  \/\/  - a graph whose edge may be negative.\n  \/\/    - Negative cycle can be detected by V[i][i] < 0 if we initialize V[i][i] = 0.\n  auto N{static_cast<int>(V.size())};\n  for (auto k{0}; k < N; ++k)\n  {\n    for (auto i{0}; i < N; ++i)\n    {\n      for (auto j{0}; j < N; ++j)\n      {\n        if (V[i][k] == infinity || V[k][j] == infinity)\n        {\n          continue;\n        }\n        ch_min(V[i][j], V[i][k] + V[k][j]);\n      }\n    }\n  }\n}\n\n\/\/ ----- Solve -----\n\nclass Solve\n{\n  int H, W, K;\n  vector<string> S;\n  vector<vector<int>> toID;\n\npublic:\n  Solve(int H, int W) : H{H}, W{W}, S(H), toID(H, vector<int>(W, -1))\n  {\n    for (auto i{0}; i < H; ++i)\n    {\n      cin >> S[i];\n    }\n    int id{0};\n    for (auto i{0}; i < H; ++i)\n    {\n      for (auto j{0}; j < W; ++j)\n      {\n        if (S[i][j] == '.')\n        {\n          toID[i][j] = id++;\n        }\n      }\n    }\n    K = id;\n  }\n\n  void flush()\n  {\n    vector<vector<int>> D(K, vector<int>(K, Infty<int>()));\n    for (auto i{0}; i < H; ++i)\n    {\n      for (auto j{0}; j < W; ++j)\n      {\n        for (auto k{0}; k < 4; ++k)\n        {\n          int nx{i + dx[k]};\n          int ny{j + dy[k]};\n          if (0 <= nx && nx < H && 0 <= ny && ny < W && toID[nx][ny] != -1)\n          {\n            int s{toID[i][j]};\n            int t{toID[nx][ny]};\n#if DEBUG == 1\n            cerr << \"s = \" << s << \", t = \" << t << endl;\n#endif\n            D[s][t] = 1;\n            D[t][s] = 1;\n          }\n        }\n      }\n    }\n    WarshallFloyd(D);\n    int ans{0};\n    for (auto i{0}; i < K; ++i)\n    {\n      for (auto j{i + 1}; j < K; ++j)\n      {\n        ch_max(ans, D[i][j]);\n      }\n    }\n    cout << ans << endl;\n  }\n\nprivate:\n};\n\n\/\/ ----- main() -----\n\nint main()\n{\n  int H, W;\n  cin >> H >> W;\n  Solve solve(H, W);\n  solve.flush();\n}\n<commit_msg>submit D.cpp to 'D - Maze Master' (abc151) [C++14 (GCC 5.4.1)]<commit_after>#define DEBUG 1\n\/**\n * File    : D.cpp\n * Author  : Kazune Takahashi\n * Created : 6\/16\/2020, 3:58:35 AM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ld = long double;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1'000'000'007LL};\n\/\/ constexpr ll MOD{998'244'353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3'000'010LL};\n\/\/ constexpr ll MAX_SIZE{30'000'010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nbool ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n    return true;\n  }\n  return false;\n}\ntemplate <typename T>\nbool ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n    return true;\n  }\n  return false;\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(Mint const &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(Mint const &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(Mint const &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(Mint const &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(Mint const &a) const { return Mint(*this) += a; }\n  Mint operator-(Mint const &a) const { return Mint(*this) -= a; }\n  Mint operator*(Mint const &a) const { return Mint(*this) *= a; }\n  Mint operator\/(Mint const &a) const { return Mint(*this) \/= a; }\n  bool operator<(Mint const &a) const { return x < a.x; }\n  bool operator<=(Mint const &a) const { return x <= a.x; }\n  bool operator>(Mint const &a) const { return x > a.x; }\n  bool operator>=(Mint const &a) const { return x >= a.x; }\n  bool operator==(Mint const &a) const { return x == a.x; }\n  bool operator!=(Mint const &a) const { return !(*this == a); }\n  Mint power(ll N) const\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, Mint<MOD> const &rhs) { return rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, Mint<MOD> const &rhs) { return -rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, Mint<MOD> const &rhs) { return rhs * lhs; }\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, Mint<MOD> const &rhs) { return Mint<MOD>{lhs} \/ rhs; }\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a) { return stream >> a.x; }\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, Mint<MOD> const &a) { return stream << a.x; }\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i{2LL}; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i{1LL}; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\ntemplate <typename T>\nT gcd(T x, T y) { return y ? gcd(y, x % y) : x; }\ntemplate <typename T>\nT lcm(T x, T y) { return x \/ gcd(x, y) * y; }\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n  int ans{0};\n  while (x != 0)\n  {\n    ans += x & 1;\n    x >>= 1;\n  }\n  return ans;\n}\n\/\/ ----- Infty -----\ntemplate <typename T>\nconstexpr T Infty() { return numeric_limits<T>::max(); }\ntemplate <typename T>\nconstexpr T mInfty() { return numeric_limits<T>::min(); }\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1'000'000'000'000'010LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\nconstexpr int dx[4] = {1, 0, -1, 0};\nconstexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\n\/\/ ----- WarshallFloyd -----\n\ntemplate <typename T>\nvoid WarshallFloyd(vector<vector<T>> &V, T infinity = numeric_limits<T>::max())\n{\n  \/\/ It is valid to apply this method for\n  \/\/  - a directed\/undirected graph,\n  \/\/  - a graph whose edge may be negative.\n  \/\/    - Negative cycle can be detected by V[i][i] < 0 if we initialize V[i][i] = 0.\n  auto N{static_cast<int>(V.size())};\n  for (auto k{0}; k < N; ++k)\n  {\n    for (auto i{0}; i < N; ++i)\n    {\n      for (auto j{0}; j < N; ++j)\n      {\n        if (V[i][k] == infinity || V[k][j] == infinity)\n        {\n          continue;\n        }\n        ch_min(V[i][j], V[i][k] + V[k][j]);\n      }\n    }\n  }\n}\n\n\/\/ ----- Solve -----\n\nclass Solve\n{\n  int H, W, K;\n  vector<string> S;\n  vector<vector<int>> toID;\n\npublic:\n  Solve(int H, int W) : H{H}, W{W}, S(H), toID(H, vector<int>(W, -1))\n  {\n    for (auto i{0}; i < H; ++i)\n    {\n      cin >> S[i];\n    }\n    int id{0};\n    for (auto i{0}; i < H; ++i)\n    {\n      for (auto j{0}; j < W; ++j)\n      {\n        if (S[i][j] == '.')\n        {\n          toID[i][j] = id++;\n        }\n      }\n    }\n    K = id;\n  }\n\n  void flush()\n  {\n    vector<vector<int>> D(K, vector<int>(K, Infty<int>()));\n    for (auto i{0}; i < H; ++i)\n    {\n      for (auto j{0}; j < W; ++j)\n      {\n        if (toID[i][j] == -1)\n        {\n          continue;\n        }\n        for (auto k{0}; k < 4; ++k)\n        {\n          int nx{i + dx[k]};\n          int ny{j + dy[k]};\n          if (0 <= nx && nx < H && 0 <= ny && ny < W && toID[nx][ny] != -1)\n          {\n            int s{toID[i][j]};\n            int t{toID[nx][ny]};\n#if DEBUG == 1\n            cerr << \"s = \" << s << \", t = \" << t << endl;\n#endif\n            D[s][t] = 1;\n            D[t][s] = 1;\n          }\n        }\n      }\n    }\n    WarshallFloyd(D);\n    int ans{0};\n    for (auto i{0}; i < K; ++i)\n    {\n      for (auto j{i + 1}; j < K; ++j)\n      {\n        ch_max(ans, D[i][j]);\n      }\n    }\n    cout << ans << endl;\n  }\n\nprivate:\n};\n\n\/\/ ----- main() -----\n\nint main()\n{\n  int H, W;\n  cin >> H >> W;\n  Solve solve(H, W);\n  solve.flush();\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef RBX_VM_BUILTIN_OBJECT_HPP\n#define RBX_VM_BUILTIN_OBJECT_HPP\n\n#include <vector>\n\n#include \"vm.hpp\"\n#include \"oop.hpp\"\n#include \"type_info.hpp\"\n#include \"executor.hpp\"\n#include \"objectmemory.hpp\"\n\nnamespace rubinius {\n\n\/**\n *  Create a writer method for a slot.\n *\n *  For attr_writer(foo, SomeClass), creates void foo(STATE, SomeClass* obj)\n *  that sets the instance variable foo_ to the object given and runs the write\n *  barrier.\n *\/\n#define attr_writer(name, type) \\\n  template <class T> \\\n  void name(T state, type* obj) { \\\n    name ## _ = obj; \\\n    this->write_barrier(state, obj); \\\n  }\n\n\/**\n *  Create a reader method for a slot.\n *\n *  For attr_reader(foo, SomeClass), creates SomeClass* foo() which returns the\n *  instance variable foo_. A const version is also generated.\n *\/\n#define attr_reader(name, type) \\\n  type* name() const { return name ## _; }\n\n\/**\n *  Ruby-like accessor creation for a slot.\n *\n *  Both attr_writer and attr_reader.\n *\/\n#define attr_accessor(name, type) \\\n  attr_reader(name, type) \\\n  attr_writer(name, type)\n\n  \/* Forwards *\/\n  class Fixnum;\n  class Integer;\n  class String;\n  class Module;\n  class Executable;\n  class Array;\n  class Object;\n\n  \/**\n   *  Object is the basic Ruby object.\n   *\n   *  Because of needing to exactly control the in-memory layout of\n   *  Objects, none of the subclasses of Object (or ObjectHeader)\n   *  is allowed to use define virtual methods. In order to achieve\n   *  virtual dispatch for the cases where it is needed (it usually\n   *  is not), the TypeInfo class should be used. Each builtin class\n   *  defines a contained type Info which inherits--directly or not\n   *  from TypeInfo. TypeInfos use virtual methods to achieve dynamism.\n   *  Instances of these Info classes are held by the VM, where they\n   *  can be retrieved using a given Object's object_type. The Info\n   *  object will then dispatch the correct virtual method for the\n   *  type. The methods are written to understand the types they are\n   *  dealing with.\n   *\n   *  The class definition layout differs from the normal alphabetic\n   *  order in order to group the different aspects involved better\n   *  and to simplify finding\/adding &c. related methods.\n   *\n   *  @todo The entire codebase should be reviewed for const\n   *        correctness. --rue\n   *\n   *  @todo Remove the unimplemented definitions? --rue\n   *\n   *  @see  vm\/type_info.hpp\n   *\n   *\/\n  class Object : public ObjectHeader {\n  public:   \/* Slots and bookkeeping *\/\n\n    \/** Class type identifier. *\/\n    static const object_type type = ObjectType;\n\n    static void bootstrap_methods(STATE);\n\n  public:   \/* GC support, bookkeeping &c. *\/\n\n    \/** Provides access to the GC write barrier from any object. *\/\n    void        write_barrier(STATE, void* obj);\n    void        write_barrier(VM*, void* obj);\n\n    \/** Special-case write_barrier() for Fixnums. *\/\n    void        write_barrier(STATE, Fixnum* obj);\n    \/** Special-case write_barrier() for Symbols. *\/\n    void        write_barrier(STATE, Symbol* obj);\n\n    void        write_barrier(ObjectMemory* om, void* obj);\n\n    void        setup_allocation_site(STATE, CallFrame* call_frame = NULL);\n\n  public:   \/* Type information, field access, copy support &c. *\/\n\n    \/**\n     * Returns a copy of this object. This is NOT the same as Ruby\n     * Kernel#dup. Code that needs Kernel#dup semantics MUST call\n     * #dup from Ruby. This method is used in the VM to duplicate\n     * data structures. It will not call the Ruby allocate() or\n     * initialize_copy() methods.\n     *\/\n    Object* duplicate(STATE);\n\n    Object* copy_object(STATE, Object* other);\n\n    \/**\n     *  Copies the object including any instance variables. Called by\n     *  Kernel#dup.\n     *\/\n\n    \/\/ Rubinius.primitive :object_copy_object\n    Object* copy_object_prim(STATE, Object* other, CallFrame* calling_environment);\n\n    \/**\n     * Copies this Object's MetaClass to the other Object. Called\n     * by Kernel#clone.\n     *\/\n    \/\/ Rubinius.primitive :object_copy_singleton_class\n    Object* copy_singleton_class(STATE, GCToken gct, Object* other, CallFrame* calling_environment);\n\n    \/** True if this Object* is actually a Fixnum, false otherwise. *\/\n    bool fixnum_p() const;\n\n    \/**\n     *  Retrieve the Object stored in given field index of this Object.\n     *\n     *  Uses TypeInfo.\n     *\/\n    Object*     get_field(STATE, std::size_t index);\n\n    \/** Safely return the object type, even if the receiver is an immediate. *\/\n    object_type get_type() const;\n\n    \/** True if given Module is this Object's class, superclass or an included Module. *\/\n    bool        kind_of_p(STATE, Object* module);\n\n    \/** Store the given Object at given field index of this Object through TypeInfo. *\/\n    void        set_field(STATE, std::size_t index, Object* val);\n\n    \/** True if this Object* is actually a Symbol, false otherwise. *\/\n    bool        symbol_p() const;\n\n    \/** Return the TypeInfo for this Object's type. *\/\n    TypeInfo*   type_info(STATE) const;\n\n\n  public:   \/* Method dispatch stuff *\/\n\n    \/** Actual class for this object. Also handles immediates *\/\n    Class*       direct_class(STATE) const;\n\n    \/** Module where to start looking for the MethodTable for this Object. *\/\n    Module*      lookup_begin(STATE) const;\n\n    \/**\n     *  Directly send a method to this Object.\n     *\n     *  Sets up the current task to send the given method name to this\n     *  Object, passing the given number of arguments through varargs.\n     *\/\n    Object* send(STATE, CallFrame* caller, Symbol* name, Array* args,\n        Object* block = cNil, bool allow_private = true);\n    Object* send(STATE, CallFrame* caller, Symbol* name, bool allow_private = true);\n\n    Object* send_prim(STATE, CallFrame* call_frame, Executable* exec, Module* mod, Arguments& args,\n        Symbol* min_visibility);\n\n    \/**\n     *  Ruby #send\/#__send__\n     *\/\n    \/\/ Rubinius.primitive? :object_send\n    Object* private_send_prim(STATE, CallFrame* call_frame, Executable* exec, Module* mod, Arguments& args);\n\n    \/**\n     *  Ruby #public_send\n     *\/\n    \/\/ Rubinius.primitive? :object_public_send\n    Object* public_send_prim(STATE, CallFrame* call_frame, Executable* exec, Module* mod, Arguments& args);\n\n\n  public:   \/* Ruby interface *\/\n\n    \/** Returns the Class object of which this Object is an instance. *\/\n    \/\/ Rubinius.primitive+ :object_class\n    Class*    class_object(STATE) const;\n\n    \/**\n     *  Ruby #equal?.\n     *\n     *  Returns true if and only if this and the other object are\n     *  the SAME object, false otherwise.\n     *\/\n    \/\/ Rubinius.primitive+ :object_equal\n    Object*   equal(STATE, Object* other);\n\n    \/** Sets the frozen flag. Rubinius does NOT currently support freezing. *\/\n    \/\/ Rubinius.primitive :object_freeze\n    Object*   freeze(STATE);\n\n    \/** Returns true if this Object's frozen flag set, false otherwise. *\/\n    \/\/ Rubinius.primitive+ :object_frozen_p\n    Object*   frozen_p(STATE);\n\n    \/**\n     *  Ruby #instance_variable_get.\n     *\n     *  Return the Object stored as instance variable under the given\n     *  identifier.\n     *\/\n    \/\/ Rubinius.primitive :object_get_ivar\n    Object*   get_ivar_prim(STATE, Symbol* sym);\n\n    Object*   get_ivar(STATE, Symbol* sym);\n\n    \/\/ A version that only attempts to find +sym+ in the ivars slot\n    Object*   get_table_ivar(STATE, Symbol* sym);\n\n    \/\/ Rubinius.primitive :object_del_ivar\n    Object*   del_ivar(STATE, Symbol* sym);\n    Object*   del_table_ivar(STATE, Symbol* sym, bool* removed = 0);\n\n    Object*   table_ivar_defined(STATE, Symbol* sym);\n\n    Object*   ivar_defined(STATE, Symbol* sym);\n\n    \/\/ Rubinius.primitive :object_ivar_defined\n    Object*   ivar_defined_prim(STATE, Symbol* sym);\n\n    \/** Returns the structure containing this object's instance variables. *\/\n    \/\/ Rubinius.primitive :object_ivar_names\n    Array*   ivar_names(STATE);\n\n    Array*   ivar_names(STATE, Array* ary);\n\n    \/** Calculate a hash value for this object. *\/\n    hashval   hash(STATE);\n\n    \/** Returns the hash value as an Integer. @see hash(). *\/\n    \/\/ Rubinius.primitive+ :object_hash\n    Integer*  hash_prim(STATE);\n\n    \/** Returns an Integer ID for this object. Created as needed. *\/\n    \/\/ Rubinius.primitive+ :object_id\n    Integer*  id(STATE);\n\n    \/** Indicates if this object has been assigned an object id. *\/\n    bool has_id(STATE);\n\n    \/** Reset the object id *\/\n    void reset_id(STATE);\n\n    \/\/ Rubinius.primitive+ :object_infect\n    Object* infect_prim(STATE, Object* obj, Object* other) {\n      other->infect(state, obj);\n      return obj;\n    }\n\n    \/**\n     * Taints other if this is tainted.\n     *\/\n    void infect(STATE, Object* other);\n\n    \/**\n     *  Ruby #kind_of?\n     *\n     *  Returns true if given Module is this Object's class,\n     *  superclass or an included Module, false otherwise.\n     *\/\n    \/\/ Rubinius.primitive+ :object_kind_of\n    Object*   kind_of_prim(STATE, Module* klass);\n\n    \/**\n     *  Ruby #instance_of?\n     *\n     *  Returns true if given Module is this Object's class,\n     *  false otherwise.\n     *\/\n    \/\/ Rubinius.primitive+ :object_instance_of\n    Object*   instance_of_prim(STATE, Module* klass);\n\n    \/** Return object's MetaClass object. Created as needed.\n     *  Also fixes up the parent hierarchy if needed *\/\n    Class* singleton_class(STATE);\n\n    \/** Return object's MetaClass object. Created as needed. *\/\n    Class* singleton_class_instance(STATE);\n\n    \/**\n     *  Ruby #instance_variable_set\n     *\n     *  Store the given object in the instance variable by\n     *  given identifier.\n     *\/\n    \/\/ Rubinius.primitive :object_set_ivar\n    Object*   set_ivar_prim(STATE, Symbol* sym, Object* val);\n\n    Object*   set_ivar(STATE, Symbol* sym, Object* val);\n\n    \/\/ Specialized version that only checks ivars_\n    Object*   set_table_ivar(STATE, Symbol* sym, Object* val);\n\n    \/** String describing this object (through TypeInfo.) *\/\n    \/\/ Rubinius.primitive :object_show\n    Object*   show(STATE);\n    \/** Indented String describing this object (through TypeInfo.) *\/\n    Object*   show(STATE, int level);\n    \/** Shorter String describing this object (through TypeInfo.) *\/\n    Object*   show_simple(STATE);\n    \/** Shorter indented String describing this object (through TypeInfo.) *\/\n    Object*   show_simple(STATE, int level);\n\n    \/**\n     *  Set tainted flag on this object.\n     *\/\n    \/\/ Rubinius.primitive :object_taint\n    Object*   taint(STATE);\n\n    \/**\n     *  Returns true if this object's tainted flag is set.\n     *\/\n    \/\/ Rubinius.primitive+ :object_tainted_p\n    Object*   tainted_p(STATE);\n\n    \/**\n     *  Clears the tainted flag on this object.\n     *\/\n    \/\/ Rubinius.primitive :object_untaint\n    Object*   untaint(STATE);\n\n    \/**\n     * Returns true if this object's untrusted flag is set.\n     *\/\n    \/\/ Rubinius.primitive+ :object_untrusted_p\n    Object* untrusted_p(STATE);\n\n    \/**\n     * Sets the untrusted flag on this object.\n     *\/\n    \/\/ Rubinius.primitive :object_untrust\n    Object* untrust(STATE);\n\n    \/**\n     * Clears the untrusted flag on this object.\n     *\/\n    \/\/ Rubinius.primitive :object_trust\n    Object* trust(STATE);\n\n    \/**\n     *  Returns an #inspect-like representation of an Object for\n     *  use in C++ code.\n     *\n     *  If address is true, uses the actual address of the object.\n     *  Otherwise, uses the object's id().\n     *\/\n    std::string to_string(STATE, bool address = false);\n\n    \/**\n     *  Returns an #inspect-like representation of an Object for\n     *  use in C++ code. Not called from Ruby code.\n     *\n     *  If address is true, uses the actual address of the object.\n     *  Otherwise, uses the object's id().\n     *\/\n    String* to_s(STATE, bool address = false);\n\n    \/**\n     *\n     * Returns cTrue if this responds to method +meth+\n     *\/\n    \/\/ Rubinius.primitive+ :object_respond_to\n    Object* respond_to(STATE, Symbol* name, Object* priv, CallFrame* calling_environment);\n\n    Object* respond_to(STATE, Symbol* name, Object* priv);\n\n    \/**\n     * Checks if object is frozen and raises RuntimeError if it is.\n     * Similar to CRuby rb_check_frozen\n     *\/\n    void check_frozen(STATE);\n\n  public:   \/* accessors *\/\n\n    \/* klass_ from ObjectHeader. *\/\n    attr_reader(klass, Class);\n\n    template <class T>\n      inline void klass(T state, Class* cls) {\n        if(klass_ != cls) {\n          klass_ = cls;\n          this->write_barrier(state, cls);\n        }\n      }\n\n    \/* ivars_ from ObjectHeader. *\/\n    attr_accessor(ivars, Object);\n\n\n  public:   \/* TypeInfo *\/\n\n    \/**\n     *  Static type information for Object.\n     *\/\n    class Info : public TypeInfo {\n    public:\n      virtual ~Info() {}\n      Info(object_type type)\n        : TypeInfo(type)\n      {}\n\n      virtual void auto_mark(Object* obj, ObjectMark& mark) {}\n    };\n  };\n\n\/* Object inlines -- Alphabetic, unlike class definition. *\/\n\n  inline bool Object::fixnum_p() const {\n    return __FIXNUM_P__(this);\n  }\n\n  inline Class* Object::direct_class(STATE) const {\n    if(reference_p()) {\n      return klass_;\n    }\n\n    return state->globals().special_classes[((uintptr_t)this) & SPECIAL_CLASS_MASK].get();\n  }\n\n  inline Module* Object::lookup_begin(STATE) const {\n    return reinterpret_cast<Module*>(direct_class(state));\n  }\n\n  inline bool Object::symbol_p() const {\n    return __SYMBOL_P__(this);\n  }\n\n  inline void Object::write_barrier(STATE, Fixnum* obj) {\n    \/* No-op *\/\n  }\n\n  inline void Object::write_barrier(STATE, Symbol* obj) {\n    \/* No-op *\/\n  }\n\n  inline void Object::write_barrier(STATE, void* ptr) {\n    Object* obj = reinterpret_cast<Object*>(ptr);\n    state->memory()->write_barrier(this, obj);\n  }\n\n  inline void Object::write_barrier(VM* vm, void* ptr) {\n    Object* obj = reinterpret_cast<Object*>(ptr);\n    vm->om->write_barrier(this, obj);\n  }\n\n  \/\/ Used in filtering APIs\n  class ObjectMatcher {\n  public:\n    virtual ~ObjectMatcher() {}\n    virtual bool match_p(STATE, Object* obj) = 0;\n  };\n\n  class ObjectMatchAll : public ObjectMatcher {\n  public:\n    virtual ~ObjectMatchAll() {}\n    virtual bool match_p(STATE, Object* obj) { return true; }\n  };\n\n}\n\n#endif\n<commit_msg>This check would cause conditional jumps on uninitialized data<commit_after>#ifndef RBX_VM_BUILTIN_OBJECT_HPP\n#define RBX_VM_BUILTIN_OBJECT_HPP\n\n#include <vector>\n\n#include \"vm.hpp\"\n#include \"oop.hpp\"\n#include \"type_info.hpp\"\n#include \"executor.hpp\"\n#include \"objectmemory.hpp\"\n\nnamespace rubinius {\n\n\/**\n *  Create a writer method for a slot.\n *\n *  For attr_writer(foo, SomeClass), creates void foo(STATE, SomeClass* obj)\n *  that sets the instance variable foo_ to the object given and runs the write\n *  barrier.\n *\/\n#define attr_writer(name, type) \\\n  template <class T> \\\n  void name(T state, type* obj) { \\\n    name ## _ = obj; \\\n    this->write_barrier(state, obj); \\\n  }\n\n\/**\n *  Create a reader method for a slot.\n *\n *  For attr_reader(foo, SomeClass), creates SomeClass* foo() which returns the\n *  instance variable foo_. A const version is also generated.\n *\/\n#define attr_reader(name, type) \\\n  type* name() const { return name ## _; }\n\n\/**\n *  Ruby-like accessor creation for a slot.\n *\n *  Both attr_writer and attr_reader.\n *\/\n#define attr_accessor(name, type) \\\n  attr_reader(name, type) \\\n  attr_writer(name, type)\n\n  \/* Forwards *\/\n  class Fixnum;\n  class Integer;\n  class String;\n  class Module;\n  class Executable;\n  class Array;\n  class Object;\n\n  \/**\n   *  Object is the basic Ruby object.\n   *\n   *  Because of needing to exactly control the in-memory layout of\n   *  Objects, none of the subclasses of Object (or ObjectHeader)\n   *  is allowed to use define virtual methods. In order to achieve\n   *  virtual dispatch for the cases where it is needed (it usually\n   *  is not), the TypeInfo class should be used. Each builtin class\n   *  defines a contained type Info which inherits--directly or not\n   *  from TypeInfo. TypeInfos use virtual methods to achieve dynamism.\n   *  Instances of these Info classes are held by the VM, where they\n   *  can be retrieved using a given Object's object_type. The Info\n   *  object will then dispatch the correct virtual method for the\n   *  type. The methods are written to understand the types they are\n   *  dealing with.\n   *\n   *  The class definition layout differs from the normal alphabetic\n   *  order in order to group the different aspects involved better\n   *  and to simplify finding\/adding &c. related methods.\n   *\n   *  @todo The entire codebase should be reviewed for const\n   *        correctness. --rue\n   *\n   *  @todo Remove the unimplemented definitions? --rue\n   *\n   *  @see  vm\/type_info.hpp\n   *\n   *\/\n  class Object : public ObjectHeader {\n  public:   \/* Slots and bookkeeping *\/\n\n    \/** Class type identifier. *\/\n    static const object_type type = ObjectType;\n\n    static void bootstrap_methods(STATE);\n\n  public:   \/* GC support, bookkeeping &c. *\/\n\n    \/** Provides access to the GC write barrier from any object. *\/\n    void        write_barrier(STATE, void* obj);\n    void        write_barrier(VM*, void* obj);\n\n    \/** Special-case write_barrier() for Fixnums. *\/\n    void        write_barrier(STATE, Fixnum* obj);\n    \/** Special-case write_barrier() for Symbols. *\/\n    void        write_barrier(STATE, Symbol* obj);\n\n    void        write_barrier(ObjectMemory* om, void* obj);\n\n    void        setup_allocation_site(STATE, CallFrame* call_frame = NULL);\n\n  public:   \/* Type information, field access, copy support &c. *\/\n\n    \/**\n     * Returns a copy of this object. This is NOT the same as Ruby\n     * Kernel#dup. Code that needs Kernel#dup semantics MUST call\n     * #dup from Ruby. This method is used in the VM to duplicate\n     * data structures. It will not call the Ruby allocate() or\n     * initialize_copy() methods.\n     *\/\n    Object* duplicate(STATE);\n\n    Object* copy_object(STATE, Object* other);\n\n    \/**\n     *  Copies the object including any instance variables. Called by\n     *  Kernel#dup.\n     *\/\n\n    \/\/ Rubinius.primitive :object_copy_object\n    Object* copy_object_prim(STATE, Object* other, CallFrame* calling_environment);\n\n    \/**\n     * Copies this Object's MetaClass to the other Object. Called\n     * by Kernel#clone.\n     *\/\n    \/\/ Rubinius.primitive :object_copy_singleton_class\n    Object* copy_singleton_class(STATE, GCToken gct, Object* other, CallFrame* calling_environment);\n\n    \/** True if this Object* is actually a Fixnum, false otherwise. *\/\n    bool fixnum_p() const;\n\n    \/**\n     *  Retrieve the Object stored in given field index of this Object.\n     *\n     *  Uses TypeInfo.\n     *\/\n    Object*     get_field(STATE, std::size_t index);\n\n    \/** Safely return the object type, even if the receiver is an immediate. *\/\n    object_type get_type() const;\n\n    \/** True if given Module is this Object's class, superclass or an included Module. *\/\n    bool        kind_of_p(STATE, Object* module);\n\n    \/** Store the given Object at given field index of this Object through TypeInfo. *\/\n    void        set_field(STATE, std::size_t index, Object* val);\n\n    \/** True if this Object* is actually a Symbol, false otherwise. *\/\n    bool        symbol_p() const;\n\n    \/** Return the TypeInfo for this Object's type. *\/\n    TypeInfo*   type_info(STATE) const;\n\n\n  public:   \/* Method dispatch stuff *\/\n\n    \/** Actual class for this object. Also handles immediates *\/\n    Class*       direct_class(STATE) const;\n\n    \/** Module where to start looking for the MethodTable for this Object. *\/\n    Module*      lookup_begin(STATE) const;\n\n    \/**\n     *  Directly send a method to this Object.\n     *\n     *  Sets up the current task to send the given method name to this\n     *  Object, passing the given number of arguments through varargs.\n     *\/\n    Object* send(STATE, CallFrame* caller, Symbol* name, Array* args,\n        Object* block = cNil, bool allow_private = true);\n    Object* send(STATE, CallFrame* caller, Symbol* name, bool allow_private = true);\n\n    Object* send_prim(STATE, CallFrame* call_frame, Executable* exec, Module* mod, Arguments& args,\n        Symbol* min_visibility);\n\n    \/**\n     *  Ruby #send\/#__send__\n     *\/\n    \/\/ Rubinius.primitive? :object_send\n    Object* private_send_prim(STATE, CallFrame* call_frame, Executable* exec, Module* mod, Arguments& args);\n\n    \/**\n     *  Ruby #public_send\n     *\/\n    \/\/ Rubinius.primitive? :object_public_send\n    Object* public_send_prim(STATE, CallFrame* call_frame, Executable* exec, Module* mod, Arguments& args);\n\n\n  public:   \/* Ruby interface *\/\n\n    \/** Returns the Class object of which this Object is an instance. *\/\n    \/\/ Rubinius.primitive+ :object_class\n    Class*    class_object(STATE) const;\n\n    \/**\n     *  Ruby #equal?.\n     *\n     *  Returns true if and only if this and the other object are\n     *  the SAME object, false otherwise.\n     *\/\n    \/\/ Rubinius.primitive+ :object_equal\n    Object*   equal(STATE, Object* other);\n\n    \/** Sets the frozen flag. Rubinius does NOT currently support freezing. *\/\n    \/\/ Rubinius.primitive :object_freeze\n    Object*   freeze(STATE);\n\n    \/** Returns true if this Object's frozen flag set, false otherwise. *\/\n    \/\/ Rubinius.primitive+ :object_frozen_p\n    Object*   frozen_p(STATE);\n\n    \/**\n     *  Ruby #instance_variable_get.\n     *\n     *  Return the Object stored as instance variable under the given\n     *  identifier.\n     *\/\n    \/\/ Rubinius.primitive :object_get_ivar\n    Object*   get_ivar_prim(STATE, Symbol* sym);\n\n    Object*   get_ivar(STATE, Symbol* sym);\n\n    \/\/ A version that only attempts to find +sym+ in the ivars slot\n    Object*   get_table_ivar(STATE, Symbol* sym);\n\n    \/\/ Rubinius.primitive :object_del_ivar\n    Object*   del_ivar(STATE, Symbol* sym);\n    Object*   del_table_ivar(STATE, Symbol* sym, bool* removed = 0);\n\n    Object*   table_ivar_defined(STATE, Symbol* sym);\n\n    Object*   ivar_defined(STATE, Symbol* sym);\n\n    \/\/ Rubinius.primitive :object_ivar_defined\n    Object*   ivar_defined_prim(STATE, Symbol* sym);\n\n    \/** Returns the structure containing this object's instance variables. *\/\n    \/\/ Rubinius.primitive :object_ivar_names\n    Array*   ivar_names(STATE);\n\n    Array*   ivar_names(STATE, Array* ary);\n\n    \/** Calculate a hash value for this object. *\/\n    hashval   hash(STATE);\n\n    \/** Returns the hash value as an Integer. @see hash(). *\/\n    \/\/ Rubinius.primitive+ :object_hash\n    Integer*  hash_prim(STATE);\n\n    \/** Returns an Integer ID for this object. Created as needed. *\/\n    \/\/ Rubinius.primitive+ :object_id\n    Integer*  id(STATE);\n\n    \/** Indicates if this object has been assigned an object id. *\/\n    bool has_id(STATE);\n\n    \/** Reset the object id *\/\n    void reset_id(STATE);\n\n    \/\/ Rubinius.primitive+ :object_infect\n    Object* infect_prim(STATE, Object* obj, Object* other) {\n      other->infect(state, obj);\n      return obj;\n    }\n\n    \/**\n     * Taints other if this is tainted.\n     *\/\n    void infect(STATE, Object* other);\n\n    \/**\n     *  Ruby #kind_of?\n     *\n     *  Returns true if given Module is this Object's class,\n     *  superclass or an included Module, false otherwise.\n     *\/\n    \/\/ Rubinius.primitive+ :object_kind_of\n    Object*   kind_of_prim(STATE, Module* klass);\n\n    \/**\n     *  Ruby #instance_of?\n     *\n     *  Returns true if given Module is this Object's class,\n     *  false otherwise.\n     *\/\n    \/\/ Rubinius.primitive+ :object_instance_of\n    Object*   instance_of_prim(STATE, Module* klass);\n\n    \/** Return object's MetaClass object. Created as needed.\n     *  Also fixes up the parent hierarchy if needed *\/\n    Class* singleton_class(STATE);\n\n    \/** Return object's MetaClass object. Created as needed. *\/\n    Class* singleton_class_instance(STATE);\n\n    \/**\n     *  Ruby #instance_variable_set\n     *\n     *  Store the given object in the instance variable by\n     *  given identifier.\n     *\/\n    \/\/ Rubinius.primitive :object_set_ivar\n    Object*   set_ivar_prim(STATE, Symbol* sym, Object* val);\n\n    Object*   set_ivar(STATE, Symbol* sym, Object* val);\n\n    \/\/ Specialized version that only checks ivars_\n    Object*   set_table_ivar(STATE, Symbol* sym, Object* val);\n\n    \/** String describing this object (through TypeInfo.) *\/\n    \/\/ Rubinius.primitive :object_show\n    Object*   show(STATE);\n    \/** Indented String describing this object (through TypeInfo.) *\/\n    Object*   show(STATE, int level);\n    \/** Shorter String describing this object (through TypeInfo.) *\/\n    Object*   show_simple(STATE);\n    \/** Shorter indented String describing this object (through TypeInfo.) *\/\n    Object*   show_simple(STATE, int level);\n\n    \/**\n     *  Set tainted flag on this object.\n     *\/\n    \/\/ Rubinius.primitive :object_taint\n    Object*   taint(STATE);\n\n    \/**\n     *  Returns true if this object's tainted flag is set.\n     *\/\n    \/\/ Rubinius.primitive+ :object_tainted_p\n    Object*   tainted_p(STATE);\n\n    \/**\n     *  Clears the tainted flag on this object.\n     *\/\n    \/\/ Rubinius.primitive :object_untaint\n    Object*   untaint(STATE);\n\n    \/**\n     * Returns true if this object's untrusted flag is set.\n     *\/\n    \/\/ Rubinius.primitive+ :object_untrusted_p\n    Object* untrusted_p(STATE);\n\n    \/**\n     * Sets the untrusted flag on this object.\n     *\/\n    \/\/ Rubinius.primitive :object_untrust\n    Object* untrust(STATE);\n\n    \/**\n     * Clears the untrusted flag on this object.\n     *\/\n    \/\/ Rubinius.primitive :object_trust\n    Object* trust(STATE);\n\n    \/**\n     *  Returns an #inspect-like representation of an Object for\n     *  use in C++ code.\n     *\n     *  If address is true, uses the actual address of the object.\n     *  Otherwise, uses the object's id().\n     *\/\n    std::string to_string(STATE, bool address = false);\n\n    \/**\n     *  Returns an #inspect-like representation of an Object for\n     *  use in C++ code. Not called from Ruby code.\n     *\n     *  If address is true, uses the actual address of the object.\n     *  Otherwise, uses the object's id().\n     *\/\n    String* to_s(STATE, bool address = false);\n\n    \/**\n     *\n     * Returns cTrue if this responds to method +meth+\n     *\/\n    \/\/ Rubinius.primitive+ :object_respond_to\n    Object* respond_to(STATE, Symbol* name, Object* priv, CallFrame* calling_environment);\n\n    Object* respond_to(STATE, Symbol* name, Object* priv);\n\n    \/**\n     * Checks if object is frozen and raises RuntimeError if it is.\n     * Similar to CRuby rb_check_frozen\n     *\/\n    void check_frozen(STATE);\n\n  public:   \/* accessors *\/\n\n    \/* klass_ from ObjectHeader. *\/\n    attr_accessor(klass, Class);\n\n    \/* ivars_ from ObjectHeader. *\/\n    attr_accessor(ivars, Object);\n\n\n  public:   \/* TypeInfo *\/\n\n    \/**\n     *  Static type information for Object.\n     *\/\n    class Info : public TypeInfo {\n    public:\n      virtual ~Info() {}\n      Info(object_type type)\n        : TypeInfo(type)\n      {}\n\n      virtual void auto_mark(Object* obj, ObjectMark& mark) {}\n    };\n  };\n\n\/* Object inlines -- Alphabetic, unlike class definition. *\/\n\n  inline bool Object::fixnum_p() const {\n    return __FIXNUM_P__(this);\n  }\n\n  inline Class* Object::direct_class(STATE) const {\n    if(reference_p()) {\n      return klass_;\n    }\n\n    return state->globals().special_classes[((uintptr_t)this) & SPECIAL_CLASS_MASK].get();\n  }\n\n  inline Module* Object::lookup_begin(STATE) const {\n    return reinterpret_cast<Module*>(direct_class(state));\n  }\n\n  inline bool Object::symbol_p() const {\n    return __SYMBOL_P__(this);\n  }\n\n  inline void Object::write_barrier(STATE, Fixnum* obj) {\n    \/* No-op *\/\n  }\n\n  inline void Object::write_barrier(STATE, Symbol* obj) {\n    \/* No-op *\/\n  }\n\n  inline void Object::write_barrier(STATE, void* ptr) {\n    Object* obj = reinterpret_cast<Object*>(ptr);\n    state->memory()->write_barrier(this, obj);\n  }\n\n  inline void Object::write_barrier(VM* vm, void* ptr) {\n    Object* obj = reinterpret_cast<Object*>(ptr);\n    vm->om->write_barrier(this, obj);\n  }\n\n  \/\/ Used in filtering APIs\n  class ObjectMatcher {\n  public:\n    virtual ~ObjectMatcher() {}\n    virtual bool match_p(STATE, Object* obj) = 0;\n  };\n\n  class ObjectMatchAll : public ObjectMatcher {\n  public:\n    virtual ~ObjectMatchAll() {}\n    virtual bool match_p(STATE, Object* obj) { return true; }\n  };\n\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2009-2017 The Bitcoin Core developers\n\/\/ Copyright (c) 2018-2018 The VERGE 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\/setup_common.h>\n\n#include <chainparams.h>\n#include <consensus\/consensus.h>\n#include <consensus\/validation.h>\n#include <crypto\/sha256.h>\n#include <validation.h>\n#include <miner.h>\n#include <net_processing.h>\n#include <pow.h>\n#include <ui_interface.h>\n#include <streams.h>\n#include <rpc\/server.h>\n#include <rpc\/register.h>\n#include <script\/sigcache.h>\n\nvoid CConnmanTest::AddNode(CNode& node)\n{\n    LOCK(g_connman->cs_vNodes);\n    g_connman->vNodes.push_back(&node);\n}\n\nvoid CConnmanTest::ClearNodes()\n{\n    LOCK(g_connman->cs_vNodes);\n    for (CNode* node : g_connman->vNodes) {\n        delete node;\n    }\n    g_connman->vNodes.clear();\n}\n\nuint256 insecure_rand_seed = GetRandHash();\nFastRandomContext insecure_rand_ctx(insecure_rand_seed);\n\nextern bool fPrintToConsole;\nextern void noui_connect();\n\nstd::ostream& operator<<(std::ostream& os, const uint256& num)\n{\n    os << num.ToString();\n    return os;\n}\n\nBasicTestingSetup::BasicTestingSetup(const std::string& chainName)\n\t: m_path_root(fs::temp_directory_path() \/ \"test_verge\" \/ strprintf(\"%lu_%i\", (unsigned long)GetTime(), (int)(InsecureRandRange(1 << 30))))\n{\n    SHA256AutoDetect();\n    RandomInit();\n    ECC_Start();\n    SetupEnvironment();\n    SetupNetworking();\n    InitSignatureCache();\n    InitScriptExecutionCache();\n    fCheckBlockIndex = true;\n    SelectParams(chainName);\n    noui_connect();\n}\n\nBasicTestingSetup::~BasicTestingSetup()\n{\n    fs::remove_all(m_path_root);\n    ECC_Stop();\n}\n\nfs::path BasicTestingSetup::SetDataDir(const std::string& name)\n{\n    fs::path ret = m_path_root \/ name;\n    fs::create_directories(ret);\n    gArgs.ForceSetArg(\"-datadir\", ret.string());\n    return ret;\n}\n\nTestingSetup::TestingSetup(const std::string& chainName) : BasicTestingSetup(chainName)\n{\n\tSetDataDir(\"tempdir\");\n    const CChainParams& chainparams = Params();\n    std::cout << \"1\";\n        \/\/ Ideally we'd move all the RPC tests to the functional testing framework\n        \/\/ instead of unit tests, but for now we need these here.\n\n        RegisterAllCoreRPCCommands(tableRPC);\n        std::cout << \"2\";\n        ClearDatadirCache();\n        std::cout << \"3\";\n\n        \/\/ We have to run a scheduler thread to prevent ActivateBestChain\n        \/\/ from blocking due to queue overrun.\n        std::cout << \"6\";\n        threadGroup.create_thread(boost::bind(&CScheduler::serviceQueue, &scheduler));\n        std::cout << \"7\";\n        GetMainSignals().RegisterBackgroundSignalScheduler(scheduler);\n        \n        std::cout << \"7\";\n        mempool.setSanityCheck(1.0);\n        pblocktree.reset(new CBlockTreeDB(1 << 20, true));\n        pcoinsdbview.reset(new CCoinsViewDB(1 << 23, true));\n        pcoinsTip.reset(new CCoinsViewCache(pcoinsdbview.get()));\n        std::cout << \"8\";\n        if (!LoadGenesisBlock(chainparams)) {\n            std::cout << \"8.E\";\n            throw std::runtime_error(\"LoadGenesisBlock failed.\");\n        }\n        std::cout << \"9.P\";\n        {\n            CValidationState state;\n            std::cout << \"9\";\n            if (!ActivateBestChain(state, chainparams)) {\n                std::cout << \"9.E\";\n                throw std::runtime_error(strprintf(\"ActivateBestChain failed. (%s)\", FormatStateMessage(state)));\n            }\n        }\n        nScriptCheckThreads = 3;\n        for (int i=0; i < nScriptCheckThreads-1; i++)\n            threadGroup.create_thread(&ThreadScriptCheck);\n        \n        std::cout << \"10\";\n        g_connman = std::unique_ptr<CConnman>(new CConnman(0x1337, 0x1337)); \/\/ Deterministic randomness for tests.\n        std::cout << \"11\";\n        connman = g_connman.get();\n        std::cout << \"12\";\n        peerLogic.reset(new PeerLogicValidation(connman, scheduler));\n        std::cout << \"END\\n\";\n}\n\nTestingSetup::~TestingSetup()\n{\n        threadGroup.interrupt_all();\n        threadGroup.join_all();\n        GetMainSignals().FlushBackgroundCallbacks();\n        GetMainSignals().UnregisterBackgroundSignalScheduler();\n        g_connman.reset();\n        peerLogic.reset();\n        UnloadBlockIndex();\n        pcoinsTip.reset();\n        pcoinsdbview.reset();\n        pblocktree.reset();\n}\n\nTestChain100Setup::TestChain100Setup() : TestingSetup(CBaseChainParams::REGTEST)\n{\n    \/\/ CreateAndProcessBlock() does not support building SegWit blocks, so don't activate in these tests.\n    \/\/ TODO: fix the code to support SegWit blocks.\n    UpdateVersionBitsParameters(Consensus::DEPLOYMENT_SEGWIT, 0, Consensus::BIP9Deployment::NO_TIMEOUT);\n    \/\/ Generate a 100-block chain:\n    coinbaseKey.MakeNewKey(true);\n    CScript scriptPubKey = CScript() <<  ToByteVector(coinbaseKey.GetPubKey()) << OP_CHECKSIG;\n    for (int i = 0; i < COINBASE_MATURITY; i++)\n    {\n        std::vector<CMutableTransaction> noTxns;\n        CBlock b = CreateAndProcessBlock(noTxns, scriptPubKey);\n        m_coinbase_txns.push_back(b.vtx[0]);\n    }\n}\n\n\/\/\n\/\/ Create a new block with just given transactions, coinbase paying to\n\/\/ scriptPubKey, and try to add it to the current chain.\n\/\/\nCBlock\nTestChain100Setup::CreateAndProcessBlock(const std::vector<CMutableTransaction>& txns, const CScript& scriptPubKey)\n{\n    const CChainParams& chainparams = Params();\n    std::unique_ptr<CBlockTemplate> pblocktemplate = BlockAssembler(chainparams).CreateNewBlock(scriptPubKey);\n    CBlock& block = pblocktemplate->block;\n\n    \/\/ Replace mempool-selected txns with just coinbase plus passed-in txns:\n    block.vtx.resize(1);\n    for (const CMutableTransaction& tx : txns)\n        block.vtx.push_back(MakeTransactionRef(tx));\n    \/\/ IncrementExtraNonce creates a valid coinbase and merkleRoot\n    {\n        LOCK(cs_main);\n        unsigned int extraNonce = 0;\n        IncrementExtraNonce(&block, chainActive.Tip(), extraNonce);\n    }\n\n    while (!CheckProofOfWork(block.GetPoWHash(block.GetAlgo()), block.nBits, chainparams.GetConsensus())) ++block.nNonce;\n\n    std::shared_ptr<const CBlock> shared_pblock = std::make_shared<const CBlock>(block);\n    ProcessNewBlock(chainparams, shared_pblock, true, nullptr);\n\n    CBlock result = block;\n    return result;\n}\n\nTestChain100Setup::~TestChain100Setup()\n{\n}\n\n\nCTxMemPoolEntry TestMemPoolEntryHelper::FromTx(const CMutableTransaction &tx) {\n    return FromTx(MakeTransactionRef(tx));\n}\n\nCTxMemPoolEntry TestMemPoolEntryHelper::FromTx(const CTransactionRef& tx)\n{\n    return CTxMemPoolEntry(tx, nFee, nTime, nHeight,\n                           spendsCoinbase, sigOpCost, lp);\n}\n\nCBlock getBlock13b8a()\n{\n    CBlock block;\n    CDataStream stream(ParseHex(\"04000000a0ec72a85d7de0ba13768bad314ee654ebc34e21d666cd87ce18ec0100000000d79a8656f873672e21495aac316cae23e05f862d02c955ff3ef924683f3aef7c2c4aea5498c6011c55772bda02010000002c4aea54010000000000000000000000000000000000000000000000000000000000000000ffffffff2703500a02062f503253482f042d4aea5408f800ea79eb9519000d2f7374726174756d506f6f6c2f0000000001a0401fd205000000232102614f24e897de983c2fee0acde4b32d3d2e50a9dc35b3b602154d685918591f00ac0000000001000000fd49ea5401cf851280c5434c73c99909ad9dfac1736a42c98ce240c2d605384fc340071cae010000006b48304502206c16cbe5ee5c6b418045a7ccebf632c06a40f726729bd15e679b944cffb320f7022100cf5deaaf0ab4114baad917b9e7447bd70c7c107048c3b9b02b96f936ce998d0b012102bcd4705d8784d52e594b5481c265ee20010d14366ac91a1c8a4cacf00c55e2acffffffff023aca1b96000000001976a914bb1243827de7374740fc00c290cc35115b4402d988ac807d2195000000001976a9146f5f2839260da439ffd448e61cf7ca2da631391a88ac00000000463044022068710e3fca37a02628c08799d59b152e0aaebb4eea187a58629cc9a12c7e00a202207297aa8213af08ad96ecdbfcff012a03bc96e140578889e92a31ec6babfdcd55\"), SER_NETWORK, PROTOCOL_VERSION);\n    stream >> block;\n    return block;\n}\n<commit_msg>Remove useless logging<commit_after>\/\/ Copyright (c) 2009-2017 The Bitcoin Core developers\n\/\/ Copyright (c) 2018-2018 The VERGE 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\/setup_common.h>\n\n#include <chainparams.h>\n#include <consensus\/consensus.h>\n#include <consensus\/validation.h>\n#include <crypto\/sha256.h>\n#include <validation.h>\n#include <miner.h>\n#include <net_processing.h>\n#include <pow.h>\n#include <ui_interface.h>\n#include <streams.h>\n#include <rpc\/server.h>\n#include <rpc\/register.h>\n#include <script\/sigcache.h>\n\nvoid CConnmanTest::AddNode(CNode& node)\n{\n    LOCK(g_connman->cs_vNodes);\n    g_connman->vNodes.push_back(&node);\n}\n\nvoid CConnmanTest::ClearNodes()\n{\n    LOCK(g_connman->cs_vNodes);\n    for (CNode* node : g_connman->vNodes) {\n        delete node;\n    }\n    g_connman->vNodes.clear();\n}\n\nuint256 insecure_rand_seed = GetRandHash();\nFastRandomContext insecure_rand_ctx(insecure_rand_seed);\n\nextern bool fPrintToConsole;\nextern void noui_connect();\n\nstd::ostream& operator<<(std::ostream& os, const uint256& num)\n{\n    os << num.ToString();\n    return os;\n}\n\nBasicTestingSetup::BasicTestingSetup(const std::string& chainName)\n\t: m_path_root(fs::temp_directory_path() \/ \"test_verge\" \/ strprintf(\"%lu_%i\", (unsigned long)GetTime(), (int)(InsecureRandRange(1 << 30))))\n{\n    SHA256AutoDetect();\n    RandomInit();\n    ECC_Start();\n    SetupEnvironment();\n    SetupNetworking();\n    InitSignatureCache();\n    InitScriptExecutionCache();\n    fCheckBlockIndex = true;\n    SelectParams(chainName);\n    noui_connect();\n}\n\nBasicTestingSetup::~BasicTestingSetup()\n{\n    fs::remove_all(m_path_root);\n    ECC_Stop();\n}\n\nfs::path BasicTestingSetup::SetDataDir(const std::string& name)\n{\n    fs::path ret = m_path_root \/ name;\n    fs::create_directories(ret);\n    gArgs.ForceSetArg(\"-datadir\", ret.string());\n    return ret;\n}\n\nTestingSetup::TestingSetup(const std::string& chainName) : BasicTestingSetup(chainName)\n{\n\tSetDataDir(\"tempdir\");\n    const CChainParams& chainparams = Params();\n    \/\/ Ideally we'd move all the RPC tests to the functional testing framework\n    \/\/ instead of unit tests, but for now we need these here.\n\n    RegisterAllCoreRPCCommands(tableRPC);\n    ClearDatadirCache();\n\n    \/\/ We have to run a scheduler thread to prevent ActivateBestChain\n    \/\/ from blocking due to queue overrun.\n    threadGroup.create_thread(boost::bind(&CScheduler::serviceQueue, &scheduler));\n    GetMainSignals().RegisterBackgroundSignalScheduler(scheduler);\n    \n    mempool.setSanityCheck(1.0);\n    pblocktree.reset(new CBlockTreeDB(1 << 20, true));\n    pcoinsdbview.reset(new CCoinsViewDB(1 << 23, true));\n    pcoinsTip.reset(new CCoinsViewCache(pcoinsdbview.get()));\n\n    if (!LoadGenesisBlock(chainparams)) {\n        throw std::runtime_error(\"LoadGenesisBlock failed.\");\n    }\n\n    {\n        CValidationState state;\n        if (!ActivateBestChain(state, chainparams)) {\n            throw std::runtime_error(strprintf(\"ActivateBestChain failed. (%s)\", FormatStateMessage(state)));\n        }\n    }\n    nScriptCheckThreads = 3;\n    for (int i=0; i < nScriptCheckThreads-1; i++)\n        threadGroup.create_thread(&ThreadScriptCheck);\n    \n    g_connman = std::unique_ptr<CConnman>(new CConnman(0x1337, 0x1337)); \/\/ Deterministic randomness for tests.\n    connman = g_connman.get();\n    peerLogic.reset(new PeerLogicValidation(connman, scheduler));\n}\n\nTestingSetup::~TestingSetup()\n{\n        threadGroup.interrupt_all();\n        threadGroup.join_all();\n        GetMainSignals().FlushBackgroundCallbacks();\n        GetMainSignals().UnregisterBackgroundSignalScheduler();\n        g_connman.reset();\n        peerLogic.reset();\n        UnloadBlockIndex();\n        pcoinsTip.reset();\n        pcoinsdbview.reset();\n        pblocktree.reset();\n}\n\nTestChain100Setup::TestChain100Setup() : TestingSetup(CBaseChainParams::REGTEST)\n{\n    \/\/ CreateAndProcessBlock() does not support building SegWit blocks, so don't activate in these tests.\n    \/\/ TODO: fix the code to support SegWit blocks.\n    UpdateVersionBitsParameters(Consensus::DEPLOYMENT_SEGWIT, 0, Consensus::BIP9Deployment::NO_TIMEOUT);\n    \/\/ Generate a 100-block chain:\n    coinbaseKey.MakeNewKey(true);\n    CScript scriptPubKey = CScript() <<  ToByteVector(coinbaseKey.GetPubKey()) << OP_CHECKSIG;\n    for (int i = 0; i < COINBASE_MATURITY; i++)\n    {\n        std::vector<CMutableTransaction> noTxns;\n        CBlock b = CreateAndProcessBlock(noTxns, scriptPubKey);\n        m_coinbase_txns.push_back(b.vtx[0]);\n    }\n}\n\n\/\/\n\/\/ Create a new block with just given transactions, coinbase paying to\n\/\/ scriptPubKey, and try to add it to the current chain.\n\/\/\nCBlock\nTestChain100Setup::CreateAndProcessBlock(const std::vector<CMutableTransaction>& txns, const CScript& scriptPubKey)\n{\n    const CChainParams& chainparams = Params();\n    std::unique_ptr<CBlockTemplate> pblocktemplate = BlockAssembler(chainparams).CreateNewBlock(scriptPubKey);\n    CBlock& block = pblocktemplate->block;\n\n    \/\/ Replace mempool-selected txns with just coinbase plus passed-in txns:\n    block.vtx.resize(1);\n    for (const CMutableTransaction& tx : txns)\n        block.vtx.push_back(MakeTransactionRef(tx));\n    \/\/ IncrementExtraNonce creates a valid coinbase and merkleRoot\n    {\n        LOCK(cs_main);\n        unsigned int extraNonce = 0;\n        IncrementExtraNonce(&block, chainActive.Tip(), extraNonce);\n    }\n\n    while (!CheckProofOfWork(block.GetPoWHash(block.GetAlgo()), block.nBits, chainparams.GetConsensus())) ++block.nNonce;\n\n    std::shared_ptr<const CBlock> shared_pblock = std::make_shared<const CBlock>(block);\n    ProcessNewBlock(chainparams, shared_pblock, true, nullptr);\n\n    CBlock result = block;\n    return result;\n}\n\nTestChain100Setup::~TestChain100Setup()\n{\n}\n\n\nCTxMemPoolEntry TestMemPoolEntryHelper::FromTx(const CMutableTransaction &tx) {\n    return FromTx(MakeTransactionRef(tx));\n}\n\nCTxMemPoolEntry TestMemPoolEntryHelper::FromTx(const CTransactionRef& tx)\n{\n    return CTxMemPoolEntry(tx, nFee, nTime, nHeight,\n                           spendsCoinbase, sigOpCost, lp);\n}\n\nCBlock getBlock13b8a()\n{\n    CBlock block;\n    CDataStream stream(ParseHex(\"04000000a0ec72a85d7de0ba13768bad314ee654ebc34e21d666cd87ce18ec0100000000d79a8656f873672e21495aac316cae23e05f862d02c955ff3ef924683f3aef7c2c4aea5498c6011c55772bda02010000002c4aea54010000000000000000000000000000000000000000000000000000000000000000ffffffff2703500a02062f503253482f042d4aea5408f800ea79eb9519000d2f7374726174756d506f6f6c2f0000000001a0401fd205000000232102614f24e897de983c2fee0acde4b32d3d2e50a9dc35b3b602154d685918591f00ac0000000001000000fd49ea5401cf851280c5434c73c99909ad9dfac1736a42c98ce240c2d605384fc340071cae010000006b48304502206c16cbe5ee5c6b418045a7ccebf632c06a40f726729bd15e679b944cffb320f7022100cf5deaaf0ab4114baad917b9e7447bd70c7c107048c3b9b02b96f936ce998d0b012102bcd4705d8784d52e594b5481c265ee20010d14366ac91a1c8a4cacf00c55e2acffffffff023aca1b96000000001976a914bb1243827de7374740fc00c290cc35115b4402d988ac807d2195000000001976a9146f5f2839260da439ffd448e61cf7ca2da631391a88ac00000000463044022068710e3fca37a02628c08799d59b152e0aaebb4eea187a58629cc9a12c7e00a202207297aa8213af08ad96ecdbfcff012a03bc96e140578889e92a31ec6babfdcd55\"), SER_NETWORK, PROTOCOL_VERSION);\n    stream >> block;\n    return block;\n}\n<|endoftext|>"}
{"text":"<commit_before>#define DEBUG 1\n\/**\n * File    : E.cpp\n * Author  : Kazune Takahashi\n * Created : 2020\/2\/2 16:15:30\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(const Mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(const Mint &a) { return *this += -a; }\n  Mint &operator*=(const Mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(const Mint &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n  Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n  Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n  Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n  bool operator<(const Mint &a) const { return x < a.x; }\n  bool operator<=(const Mint &a) const { return x <= a.x; }\n  bool operator>(const Mint &a) const { return x > a.x; }\n  bool operator>=(const Mint &a) const { return x >= a.x; }\n  bool operator==(const Mint &a) const { return x == a.x; }\n  bool operator!=(const Mint &a) const { return !(*this == a); }\n  const Mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, const Mint<MOD> &rhs)\n{\n  return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, const Mint<MOD> &rhs)\n{\n  return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n  return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, const Mint<MOD> &a)\n{\n  return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2LL; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1LL; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n  int ans{0};\n  while (x != 0)\n  {\n    ans += x & 1;\n    x >>= 1;\n  }\n  return ans;\n}\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1000000000000000LL};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\/\/ ----- main() -----\n\nint main()\n{\n  int H, W;\n  cin >> H >> W;\n  vector<vector<int>> G(H, vector<int>(W));\n  for (auto i = 0; i < H; ++i)\n  {\n    for (auto j = 0; j < W; ++j)\n    {\n      cin >> G[i][j];\n    }\n  }\n  for (auto i = 0; i < H; ++i)\n  {\n    for (auto j = 0; j < W; ++j)\n    {\n      int t;\n      cin >> t;\n      G[i][j] = abs(G[i][j] - t);\n    }\n  }\n  vector<vector<vector<bool>>> DP(H, vector<vector<bool>>(W, vector<bool>(10000, false)));\n  DP[0][0][G[0][0]] = false;\n  for (auto i = 0; i < H; ++i)\n  {\n    for (auto j = 0; j < W; ++j)\n    {\n      if (i + 1 < H)\n      {\n        for (auto k = 0; k < 10000; ++k)\n        {\n          if (DP[i][j][k])\n          {\n            DP[i + 1][j][abs(k + G[i + 1][j])] = true;\n            DP[i + 1][j][abs(k - G[i + 1][j])] = true;\n          }\n        }\n      }\n      if (j + 1 < W)\n      {\n        for (auto k = 0; k < 10000; ++k)\n        {\n          if (DP[i][j][k])\n          {\n            DP[i][j + 1][abs(k + G[i][j + 1])] = true;\n            DP[i][j + 1][abs(k - G[i][j + 1])] = true;\n          }\n        }\n      }\n    }\n  }\n#if DEBUG == 1\n  for (auto i = 0; i < H; ++i)\n  {\n    for (auto j = 0; j < W; ++j)\n    {\n      for (auto k = 0; k < 10000; ++k)\n      {\n        if (DP[i][j][k])\n        {\n          cout << \"DP[\" << i << \"][\" << j << \"] = \" << k << endl;\n          break;\n        }\n      }\n    }\n  }\n#endif\n  for (auto k = 0; k < 10000; ++k)\n  {\n    if (DP[H - 1][W - 1][k])\n    {\n      cout << k << endl;\n      return 0;\n    }\n  }\n}\n<commit_msg>tried E.cpp to 'E'<commit_after>#define DEBUG 1\n\/**\n * File    : E.cpp\n * Author  : Kazune Takahashi\n * Created : 2020\/2\/2 16:15:30\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(const Mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(const Mint &a) { return *this += -a; }\n  Mint &operator*=(const Mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(const Mint &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n  Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n  Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n  Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n  bool operator<(const Mint &a) const { return x < a.x; }\n  bool operator<=(const Mint &a) const { return x <= a.x; }\n  bool operator>(const Mint &a) const { return x > a.x; }\n  bool operator>=(const Mint &a) const { return x >= a.x; }\n  bool operator==(const Mint &a) const { return x == a.x; }\n  bool operator!=(const Mint &a) const { return !(*this == a); }\n  const Mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, const Mint<MOD> &rhs)\n{\n  return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, const Mint<MOD> &rhs)\n{\n  return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n  return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, const Mint<MOD> &a)\n{\n  return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2LL; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1LL; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n  int ans{0};\n  while (x != 0)\n  {\n    ans += x & 1;\n    x >>= 1;\n  }\n  return ans;\n}\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1000000000000000LL};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\/\/ ----- main() -----\n\nint main()\n{\n  int H, W;\n  cin >> H >> W;\n  vector<vector<int>> G(H, vector<int>(W));\n  for (auto i = 0; i < H; ++i)\n  {\n    for (auto j = 0; j < W; ++j)\n    {\n      cin >> G[i][j];\n    }\n  }\n  for (auto i = 0; i < H; ++i)\n  {\n    for (auto j = 0; j < W; ++j)\n    {\n      int t;\n      cin >> t;\n      G[i][j] = abs(G[i][j] - t);\n    }\n  }\n  vector<vector<vector<bool>>> DP(H, vector<vector<bool>>(W, vector<bool>(10000, false)));\n  DP[0][0][G[0][0]] = true;\n  for (auto i = 0; i < H; ++i)\n  {\n    for (auto j = 0; j < W; ++j)\n    {\n      if (i + 1 < H)\n      {\n        for (auto k = 0; k < 10000; ++k)\n        {\n          if (DP[i][j][k])\n          {\n            DP[i + 1][j][abs(k + G[i + 1][j])] = true;\n            DP[i + 1][j][abs(k - G[i + 1][j])] = true;\n          }\n        }\n      }\n      if (j + 1 < W)\n      {\n        for (auto k = 0; k < 10000; ++k)\n        {\n          if (DP[i][j][k])\n          {\n            DP[i][j + 1][abs(k + G[i][j + 1])] = true;\n            DP[i][j + 1][abs(k - G[i][j + 1])] = true;\n          }\n        }\n      }\n    }\n  }\n#if DEBUG == 1\n  for (auto i = 0; i < H; ++i)\n  {\n    for (auto j = 0; j < W; ++j)\n    {\n      for (auto k = 0; k < 10000; ++k)\n      {\n        if (DP[i][j][k])\n        {\n          cout << \"DP[\" << i << \"][\" << j << \"] = \" << k << endl;\n          break;\n        }\n      }\n    }\n  }\n#endif\n  for (auto k = 0; k < 10000; ++k)\n  {\n    if (DP[H - 1][W - 1][k])\n    {\n      cout << k << endl;\n      return 0;\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#define BOOST_TEST_MODULE Bitcoin Test Suite\n#include <boost\/test\/unit_test.hpp>\n\n#include \"db.h\"\n#include \"txdb.h\"\n#include \"main.h\"\n#include \"wallet.h\"\n\nCWallet* pwalletMain;\nCClientUIInterface uiInterface;\n\nextern bool fPrintToConsole;\nextern void noui_connect();\n\nstruct TestingSetup {\n    CCoinsViewDB *pcoinsdbview;\n\n    TestingSetup() {\n        fPrintToDebugger = true; \/\/ don't want to write to debug.log file\n        noui_connect();\n        bitdb.MakeMock();\n        pblocktree = new CBlockTreeDB(1 << 20, true);\n        pcoinsdbview = new CCoinsViewDB(1 << 23, true);\n        pcoinsTip = new CCoinsViewCache(*pcoinsdbview);\n        LoadBlockIndex();\n        bool fFirstRun;\n        pwalletMain = new CWallet(\"wallet.dat\");\n        pwalletMain->LoadWallet(fFirstRun);\n        RegisterWallet(pwalletMain);\n    }\n    ~TestingSetup()\n    {\n        delete pwalletMain;\n        pwalletMain = NULL;\n        delete pcoinsTip;\n        delete pcoinsdbview;\n        delete pblocktree;\n        bitdb.Flush(true);\n    }\n};\n\nBOOST_GLOBAL_FIXTURE(TestingSetup);\n\nvoid Shutdown(void* parg)\n{\n  exit(0);\n}\n\nvoid StartShutdown()\n{\n  exit(0);\n}\n\n<commit_msg>Make test_bitcoin run in a temp datadir<commit_after>#define BOOST_TEST_MODULE Bitcoin Test Suite\n#include <boost\/test\/unit_test.hpp>\n#include <boost\/filesystem.hpp>\n\n#include \"db.h\"\n#include \"txdb.h\"\n#include \"main.h\"\n#include \"wallet.h\"\n#include \"util.h\"\n\nCWallet* pwalletMain;\nCClientUIInterface uiInterface;\n\nextern bool fPrintToConsole;\nextern void noui_connect();\n\nstruct TestingSetup {\n    CCoinsViewDB *pcoinsdbview;\n    boost::filesystem::path pathTemp;\n\n    TestingSetup() {\n        fPrintToDebugger = true; \/\/ don't want to write to debug.log file\n        noui_connect();\n        bitdb.MakeMock();\n        pathTemp = GetTempPath() \/ strprintf(\"test_bitcoin_%lu_%i\", (unsigned long)GetTime(), (int)(GetRand(100000)));\n        boost::filesystem::create_directories(pathTemp);\n        mapArgs[\"-datadir\"] = pathTemp.string();\n        pblocktree = new CBlockTreeDB(1 << 20, true);\n        pcoinsdbview = new CCoinsViewDB(1 << 23, true);\n        pcoinsTip = new CCoinsViewCache(*pcoinsdbview);\n        LoadBlockIndex();\n        bool fFirstRun;\n        pwalletMain = new CWallet(\"wallet.dat\");\n        pwalletMain->LoadWallet(fFirstRun);\n        RegisterWallet(pwalletMain);\n    }\n    ~TestingSetup()\n    {\n        delete pwalletMain;\n        pwalletMain = NULL;\n        delete pcoinsTip;\n        delete pcoinsdbview;\n        delete pblocktree;\n        bitdb.Flush(true);\n        boost::filesystem::remove_all(pathTemp);\n    }\n};\n\nBOOST_GLOBAL_FIXTURE(TestingSetup);\n\nvoid Shutdown(void* parg)\n{\n  exit(0);\n}\n\nvoid StartShutdown()\n{\n  exit(0);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#define DEBUG 1\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 2\/6\/2020, 1:50:46 PM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(const Mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(const Mint &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint &operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint &operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(const Mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(const Mint &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n  Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n  Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n  Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n  bool operator<(const Mint &a) const { return x < a.x; }\n  bool operator<=(const Mint &a) const { return x <= a.x; }\n  bool operator>(const Mint &a) const { return x > a.x; }\n  bool operator>=(const Mint &a) const { return x >= a.x; }\n  bool operator==(const Mint &a) const { return x == a.x; }\n  bool operator!=(const Mint &a) const { return !(*this == a); }\n  const Mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, const Mint<MOD> &rhs)\n{\n  return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, const Mint<MOD> &rhs)\n{\n  return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n  return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, const Mint<MOD> &a)\n{\n  return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2LL; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1LL; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\ntemplate <typename T>\nT gcd(T x, T y) { return y ? gcd(y, x % y) : x; }\ntemplate <typename T>\nT lcm(T x, T y) { return x \/ gcd(x, y) * y; }\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n  int ans{0};\n  while (x != 0)\n  {\n    ans += x & 1;\n    x >>= 1;\n  }\n  return ans;\n}\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1000000000000000LL};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\/\/ ----- main() -----\n\nclass Solve\n{\n  int N;\n  vector<vector<int>> V;\n  vector<double> alpha, beta, S, T;\n  double total;\n\npublic:\n  Solve(int N, vector<vector<int>> const &V) : N{N}, V(V), alpha(N, 0.0), beta(N, 0.0), S(N, 0.0), T(N, 0.0)\n  {\n    calc_alpha();\n    calc_beta();\n    calc_S();\n    calc_T();\n    total = S[N - 1];\n#if DEBUG == 1\n    cerr << fixed << setprecision(4);\n    for (auto i = 0; i < N; ++i)\n    {\n      cerr << \"alpha[\" << i << \"] = \" << alpha[i] << endl;\n    }\n    for (auto i = 0; i < N; ++i)\n    {\n      cerr << \"beta[\" << i << \"] = \" << beta[i] << endl;\n    }\n    for (auto i = 0; i < N; ++i)\n    {\n      cerr << \"S[\" << i << \"] = \" << S[i] << endl;\n    }\n    for (auto i = 0; i < N; ++i)\n    {\n      cerr << \"T[\" << i << \"] = \" << T[i] << endl;\n    }\n#endif\n  }\n\n  void flush()\n  {\n    double ans{0.0};\n    for (auto i = 0; i < N; ++i)\n    {\n      if (V[i].size() <= 1)\n      {\n        continue;\n      }\n      double Delta{0.0};\n      double d{delta(i)};\n      for (auto j : V[i])\n      {\n        Delta += delta(i, j, d);\n      }\n      d = delta_zero(i);\n      for (auto j : V[i])\n      {\n        ch_min(ans, Delta + delta(i, j, d));\n      }\n    }\n    cout << fixed << setprecision(10) << ans + total << endl;\n  }\n\nprivate:\n  double prob(int i)\n  {\n    assert(!V[i].empty());\n    return 1.0 \/ V[i].size();\n  }\n\n  double delta(int i)\n  {\n    assert(V[i].size() > 1);\n    return 1.0 \/ (V[i].size() - 1) - 1.0 \/ V[i].size();\n  }\n\n  double delta_zero(int i)\n  {\n    assert(V[i].size() > 1);\n    return -1.0 \/ (V[i].size() - 1);\n  }\n\n  double delta(int u, int v, double d)\n  {\n    return d * (beta[v] * S[u] + alpha[u] * T[v] + alpha[u] * beta[v]);\n  }\n\n  void calc_alpha()\n  {\n    alpha[0] = 1.0;\n    for (auto i = 0; i < N - 1; ++i)\n    {\n      for (auto j : V[i])\n      {\n        alpha[j] += prob(i) * alpha[i];\n      }\n    }\n  }\n\n  void calc_beta()\n  {\n    beta = alpha;\n  }\n\n  void calc_S()\n  {\n    for (auto i = 0; i < N - 1; ++i)\n    {\n      for (auto j : V[i])\n      {\n        S[j] += alpha[i] * prob(i) * (S[i] + 1.0);\n      }\n    }\n  }\n\n  void calc_T()\n  {\n    for (auto i = N - 2; i >= 0; --i)\n    {\n      double sum{0.0};\n      for (auto j : V[i])\n      {\n        sum += T[j];\n      }\n      T[i] = 1.0 + prob(i) * sum;\n    }\n  }\n};\n\nint main()\n{\n  int N, M;\n  cin >> N >> M;\n  vector<vector<int>> V(N);\n  for (auto i = 0; i < M; ++i)\n  {\n    int s, t;\n    cin >> s >> t;\n    --s;\n    --t;\n    V[s].push_back(t);\n  }\n  Solve solve(N, V);\n  solve.flush();\n}\n<commit_msg>tried F.cpp to 'F'<commit_after>#define DEBUG 1\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 2\/6\/2020, 1:50:46 PM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(const Mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(const Mint &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint &operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint &operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(const Mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(const Mint &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n  Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n  Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n  Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n  bool operator<(const Mint &a) const { return x < a.x; }\n  bool operator<=(const Mint &a) const { return x <= a.x; }\n  bool operator>(const Mint &a) const { return x > a.x; }\n  bool operator>=(const Mint &a) const { return x >= a.x; }\n  bool operator==(const Mint &a) const { return x == a.x; }\n  bool operator!=(const Mint &a) const { return !(*this == a); }\n  const Mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, const Mint<MOD> &rhs)\n{\n  return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, const Mint<MOD> &rhs)\n{\n  return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n  return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, const Mint<MOD> &a)\n{\n  return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2LL; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1LL; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\ntemplate <typename T>\nT gcd(T x, T y) { return y ? gcd(y, x % y) : x; }\ntemplate <typename T>\nT lcm(T x, T y) { return x \/ gcd(x, y) * y; }\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n  int ans{0};\n  while (x != 0)\n  {\n    ans += x & 1;\n    x >>= 1;\n  }\n  return ans;\n}\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1000000000000000LL};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\/\/ ----- main() -----\n\nclass Solve\n{\n  int N;\n  vector<vector<int>> V;\n  vector<double> alpha, beta, S, T;\n  double total;\n\npublic:\n  Solve(int N, vector<vector<int>> const &V) : N{N}, V(V), alpha(N, 0.0), beta(N, 0.0), S(N, 0.0), T(N, 0.0)\n  {\n    calc_alpha();\n    calc_beta();\n    calc_S();\n    calc_T();\n    total = S[N - 1];\n#if DEBUG == 1\n    cerr << fixed << setprecision(4);\n    for (auto i = 0; i < N; ++i)\n    {\n      cerr << \"alpha[\" << i << \"] = \" << alpha[i] << endl;\n    }\n    for (auto i = 0; i < N; ++i)\n    {\n      cerr << \"beta[\" << i << \"] = \" << beta[i] << endl;\n    }\n    for (auto i = 0; i < N; ++i)\n    {\n      cerr << \"S[\" << i << \"] = \" << S[i] << endl;\n    }\n    for (auto i = 0; i < N; ++i)\n    {\n      cerr << \"T[\" << i << \"] = \" << T[i] << endl;\n    }\n#endif\n  }\n\n  void flush()\n  {\n    double ans{0.0};\n    for (auto i = 0; i < N; ++i)\n    {\n      if (V[i].size() <= 1)\n      {\n        continue;\n      }\n      double Delta{0.0};\n      double d{delta(i)};\n      for (auto j : V[i])\n      {\n        Delta += delta(i, j, d);\n      }\n      d = delta_zero(i);\n      for (auto j : V[i])\n      {\n        ch_min(ans, Delta + delta(i, j, d));\n      }\n    }\n    cout << fixed << setprecision(10) << ans + total << endl;\n  }\n\nprivate:\n  double prob(int i)\n  {\n    assert(!V[i].empty());\n    return 1.0 \/ V[i].size();\n  }\n\n  double delta(int i)\n  {\n    assert(V[i].size() > 1);\n    return 1.0 \/ (V[i].size() - 1) - 1.0 \/ V[i].size();\n  }\n\n  double delta_zero(int i)\n  {\n    assert(V[i].size() > 1);\n    return -1.0 \/ (V[i].size() - 1);\n  }\n\n  double delta(int u, int v, double d)\n  {\n    return d * (beta[v] * S[u] + alpha[u] * T[v] + alpha[u] * beta[v]);\n  }\n\n  void calc_alpha()\n  {\n    alpha[0] = 1.0;\n    for (auto i = 0; i < N - 1; ++i)\n    {\n      for (auto j : V[i])\n      {\n        alpha[j] += prob(i) * alpha[i];\n      }\n    }\n  }\n\n  void calc_beta()\n  {\n    beta = alpha;\n  }\n\n  void calc_S()\n  {\n    for (auto i = 0; i < N - 1; ++i)\n    {\n      for (auto j : V[i])\n      {\n        S[j] += alpha[i] * prob(i) * 1.0 + prob(i) * S[i];\n      }\n    }\n  }\n\n  void calc_T()\n  {\n    for (auto i = N - 2; i >= 0; --i)\n    {\n      double sum{0.0};\n      for (auto j : V[i])\n      {\n        sum += T[j];\n      }\n      T[i] = 1.0 + prob(i) * sum;\n    }\n  }\n};\n\nint main()\n{\n  int N, M;\n  cin >> N >> M;\n  vector<vector<int>> V(N);\n  for (auto i = 0; i < M; ++i)\n  {\n    int s, t;\n    cin >> s >> t;\n    --s;\n    --t;\n    V[s].push_back(t);\n  }\n  Solve solve(N, V);\n  solve.flush();\n}\n<|endoftext|>"}
{"text":"<commit_before>#define DEBUG 1\n\/**\n * File    : E.cpp\n * Author  : Kazune Takahashi\n * Created : 2\/10\/2020, 5:30:41 PM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(const Mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(const Mint &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint &operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint &operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(const Mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(const Mint &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n  Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n  Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n  Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n  bool operator<(const Mint &a) const { return x < a.x; }\n  bool operator<=(const Mint &a) const { return x <= a.x; }\n  bool operator>(const Mint &a) const { return x > a.x; }\n  bool operator>=(const Mint &a) const { return x >= a.x; }\n  bool operator==(const Mint &a) const { return x == a.x; }\n  bool operator!=(const Mint &a) const { return !(*this == a); }\n  const Mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, const Mint<MOD> &rhs)\n{\n  return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, const Mint<MOD> &rhs)\n{\n  return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n  return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, const Mint<MOD> &a)\n{\n  return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2LL; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1LL; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\ntemplate <typename T>\nT gcd(T x, T y) { return y ? gcd(y, x % y) : x; }\ntemplate <typename T>\nT lcm(T x, T y) { return x \/ gcd(x, y) * y; }\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n  int ans{0};\n  while (x != 0)\n  {\n    ans += x & 1;\n    x >>= 1;\n  }\n  return ans;\n}\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1000000000000000LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\/\/ ----- main() -----\n\nint main()\n{\n  string S;\n  int K;\n  cin >> S >> K;\n  int N{static_cast<int>(S.size())};\n  vector<vector<vector<ll>>> DP(N + 1, vector<vector<ll>>(K + 1, vector<ll>(2, 0)));\n  DP[0][0][0] = 1;\n  for (auto i = 0; i < N; ++i)\n  {\n    for (auto k = 0; k <= K; ++k)\n    {\n      for (auto j = 0; j < 2; ++j)\n      {\n        for (auto d = 0; d <= 9; ++d)\n        {\n          int ni{i + 1}, nk{k}, nj{j};\n          if (d > 0)\n          {\n            ++nk;\n          }\n          if (nk > K)\n          {\n            continue;\n          }\n          int num{S[i] - '0'};\n          if (k == 0 && d > num)\n          {\n            continue;\n          }\n          else if (k == 0 && d < num)\n          {\n            nk = 1;\n          }\n          DP[ni][nk][nj] += DP[i][k][j];\n        }\n      }\n    }\n  }\n  cout << DP[N][K][0] + DP[N][K][1] << endl;\n}\n<commit_msg>tried E.cpp to 'E'<commit_after>#define DEBUG 1\n\/**\n * File    : E.cpp\n * Author  : Kazune Takahashi\n * Created : 2\/10\/2020, 5:30:41 PM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(const Mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(const Mint &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint &operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint &operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(const Mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(const Mint &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n  Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n  Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n  Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n  bool operator<(const Mint &a) const { return x < a.x; }\n  bool operator<=(const Mint &a) const { return x <= a.x; }\n  bool operator>(const Mint &a) const { return x > a.x; }\n  bool operator>=(const Mint &a) const { return x >= a.x; }\n  bool operator==(const Mint &a) const { return x == a.x; }\n  bool operator!=(const Mint &a) const { return !(*this == a); }\n  const Mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, const Mint<MOD> &rhs)\n{\n  return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, const Mint<MOD> &rhs)\n{\n  return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n  return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, const Mint<MOD> &a)\n{\n  return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2LL; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1LL; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\ntemplate <typename T>\nT gcd(T x, T y) { return y ? gcd(y, x % y) : x; }\ntemplate <typename T>\nT lcm(T x, T y) { return x \/ gcd(x, y) * y; }\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n  int ans{0};\n  while (x != 0)\n  {\n    ans += x & 1;\n    x >>= 1;\n  }\n  return ans;\n}\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1000000000000000LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\/\/ ----- main() -----\n\nint main()\n{\n  string S;\n  int K;\n  cin >> S >> K;\n  int N{static_cast<int>(S.size())};\n  vector<vector<vector<ll>>> DP(N + 1, vector<vector<ll>>(K + 1, vector<ll>(2, 0)));\n  DP[0][0][0] = 1;\n  for (auto i = 0; i < N; ++i)\n  {\n    for (auto k = 0; k <= K; ++k)\n    {\n      for (auto j = 0; j < 2; ++j)\n      {\n        for (auto d = 0; d <= 9; ++d)\n        {\n          int ni{i + 1}, nk{k}, nj{j};\n          if (d > 0)\n          {\n            ++nk;\n          }\n          if (nk > K)\n          {\n            continue;\n          }\n          int num{S[i] - '0'};\n          if (k == 0 && d > num)\n          {\n            continue;\n          }\n          else if (k == 0 && d < num)\n          {\n            nk = 1;\n          }\n          DP[ni][nk][nj] += DP[i][k][j];\n        }\n      }\n    }\n  }\n#if DEBUG == 1\n  for (auto i = 0; i < N; ++i)\n  {\n    for (auto k = 0; k <= K; ++k)\n    {\n      for (auto j = 0; j < 2; ++j)\n      {\n        cerr << \"DP[\" << i + 1 << \"][\" << k << \"][\" << j << \"] = \" << DP[i + 1][k][j] << endl;\n      }\n    }\n  }\n#endif\n  cout << DP[N][K][0] + DP[N][K][1] << endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>#define DEBUG 1\n\/**\n * File    : A.cpp\n * Author  : Kazune Takahashi\n * Created : 2\/22\/2020, 8:41:54 PM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(const Mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(const Mint &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint &operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint &operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(const Mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(const Mint &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n  Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n  Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n  Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n  bool operator<(const Mint &a) const { return x < a.x; }\n  bool operator<=(const Mint &a) const { return x <= a.x; }\n  bool operator>(const Mint &a) const { return x > a.x; }\n  bool operator>=(const Mint &a) const { return x >= a.x; }\n  bool operator==(const Mint &a) const { return x == a.x; }\n  bool operator!=(const Mint &a) const { return !(*this == a); }\n  const Mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, const Mint<MOD> &rhs)\n{\n  return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, const Mint<MOD> &rhs)\n{\n  return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n  return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, const Mint<MOD> &a)\n{\n  return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2LL; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1LL; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\ntemplate <typename T>\nT gcd(T x, T y) { return y ? gcd(y, x % y) : x; }\ntemplate <typename T>\nT lcm(T x, T y) { return x \/ gcd(x, y) * y; }\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n  int ans{0};\n  while (x != 0)\n  {\n    ans += x & 1;\n    x >>= 1;\n  }\n  return ans;\n}\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1000000000000000LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\/\/ ----- main() -----\n\nint main()\n{\n  ll N, R;\n  cin >> N >> R;\n  if (N >= 10)\n  {\n    cout << R << endl;\n  }\n  else\n  {\n    cout << R - 100 * (10 - N) << endl;\n  }\n}\n<commit_msg>submit A.cpp to 'A - Beginner' (abc156) [C++14 (GCC 5.4.1)]<commit_after>#define DEBUG 1\n\/**\n * File    : A.cpp\n * Author  : Kazune Takahashi\n * Created : 2\/22\/2020, 8:41:54 PM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(const Mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(const Mint &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint &operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint &operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(const Mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(const Mint &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n  Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n  Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n  Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n  bool operator<(const Mint &a) const { return x < a.x; }\n  bool operator<=(const Mint &a) const { return x <= a.x; }\n  bool operator>(const Mint &a) const { return x > a.x; }\n  bool operator>=(const Mint &a) const { return x >= a.x; }\n  bool operator==(const Mint &a) const { return x == a.x; }\n  bool operator!=(const Mint &a) const { return !(*this == a); }\n  const Mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, const Mint<MOD> &rhs)\n{\n  return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, const Mint<MOD> &rhs)\n{\n  return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n  return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, const Mint<MOD> &a)\n{\n  return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2LL; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1LL; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\ntemplate <typename T>\nT gcd(T x, T y) { return y ? gcd(y, x % y) : x; }\ntemplate <typename T>\nT lcm(T x, T y) { return x \/ gcd(x, y) * y; }\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n  int ans{0};\n  while (x != 0)\n  {\n    ans += x & 1;\n    x >>= 1;\n  }\n  return ans;\n}\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1000000000000000LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\/\/ ----- main() -----\n\nint main()\n{\n  ll N, R;\n  cin >> N >> R;\n  if (N >= 10)\n  {\n    cout << R << endl;\n  }\n  else\n  {\n    cout << R + 100 * (10 - N) << endl;\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"common\/RhoPort.h\"\nextern \"C\" void Init_System();\nextern \"C\" void Init_Network();\nextern \"C\" void Init_SQLite3();\nextern \"C\" void Init_Log();\nextern \"C\" void Init_WebView();\nextern \"C\" void Init_WebView_extension();\nextern \"C\" void Init_Application();\nextern \"C\" void Init_NativeToolbar();\nextern \"C\" void Init_NativeToolbar_extension();\nextern \"C\" void Init_NativeTabbar();\nextern \"C\" void Init_NativeTabbar_extension();\nextern \"C\" void Init_Navbar();\nextern \"C\" void Init_Notification();\nextern \"C\" void Init_RhoFile();\nextern \"C\" void Init_NativeMenuBar();\nextern \"C\" void Init_Led();\nextern \"C\" void Init_Push();\nextern \"C\" void Init_NewORM_extension();\nextern \"C\" void Init_Intent();\n\nextern \"C\" void Init_CoreAPI_Extension()\n{\n    Init_System();\n    Init_Application();\n\n\tInit_Network();\n    Init_SQLite3();\n    Init_NewORM_extension();\n    Init_Log();\n#if defined(OS_MACOSX) || defined(OS_WINDOWS_DESKTOP) || defined(OS_WINCE) || defined(OS_ANDROID)\n    Init_WebView();\n#elif defined(OS_WP8)\n    Init_WebView_extension();\n#endif\n\n#if defined(OS_WINDOWS_DESKTOP) || defined(OS_WINCE) || (defined(OS_MACOSX) && defined(RHODES_EMULATOR)) || defined(OS_ANDROID) || defined(OS_MACOSX)\n    Init_NativeToolbar();\n    Init_NativeTabbar();\n#elif defined(OS_WP8)\n    Init_NativeToolbar_extension();\n    Init_NativeTabbar_extension();\n#endif\n\n#if defined(OS_MACOSX) || defined(RHODES_EMULATOR)\n    Init_Navbar();\n#endif\n\n#if defined(OS_WINDOWS_DESKTOP) || defined(RHODES_EMULATOR) || defined(OS_WINCE) || defined(OS_MACOSX) || defined(OS_ANDROID)\n    Init_Notification();\n#endif\n\n#if defined(OS_MACOSX) || defined(OS_ANDROID) || defined(WINDOWS_PLATFORM)\n    Init_RhoFile();\n#endif\n\n#if defined(OS_WINDOWS_DESKTOP) || defined(OS_WINCE) || defined(RHODES_EMULATOR)\n    Init_NativeMenuBar();\n#endif\n\n\n#if defined(OS_WINCE) || defined(OS_ANDROID)\n    \/\/Init_Led();\n#endif\n\n#if defined(OS_ANDROID) || defined(OS_WINCE) || defined(OS_MACOSX) || (defined(OS_WINDOWS_DESKTOP) && !defined(RHODES_EMULATOR))\n    Init_Push();\n#endif\n\n#if defined(OS_ANDROID) || (defined(OS_MACOSX) && !defined(RHODES_EMULATOR)) || defined(OS_WINCE)\n    Init_Intent();\n#endif\n}\n<commit_msg>Limiting NewORM to iOS & Android for now<commit_after>#include \"common\/RhoPort.h\"\nextern \"C\" void Init_System();\nextern \"C\" void Init_Network();\nextern \"C\" void Init_SQLite3();\nextern \"C\" void Init_Log();\nextern \"C\" void Init_WebView();\nextern \"C\" void Init_WebView_extension();\nextern \"C\" void Init_Application();\nextern \"C\" void Init_NativeToolbar();\nextern \"C\" void Init_NativeToolbar_extension();\nextern \"C\" void Init_NativeTabbar();\nextern \"C\" void Init_NativeTabbar_extension();\nextern \"C\" void Init_Navbar();\nextern \"C\" void Init_Notification();\nextern \"C\" void Init_RhoFile();\nextern \"C\" void Init_NativeMenuBar();\nextern \"C\" void Init_Led();\nextern \"C\" void Init_Push();\nextern \"C\" void Init_NewORM_extension();\nextern \"C\" void Init_Intent();\n\nextern \"C\" void Init_CoreAPI_Extension()\n{\n    Init_System();\n    Init_Application();\n\n\tInit_Network();\n    Init_SQLite3();\n#if defined(OS_MACOSX) || defined(OS_ANDROID)\n    Init_NewORM_extension();\n#endif\n    Init_Log();\n#if defined(OS_MACOSX) || defined(OS_WINDOWS_DESKTOP) || defined(OS_WINCE) || defined(OS_ANDROID)\n    Init_WebView();\n#elif defined(OS_WP8)\n    Init_WebView_extension();\n#endif\n\n#if defined(OS_WINDOWS_DESKTOP) || defined(OS_WINCE) || (defined(OS_MACOSX) && defined(RHODES_EMULATOR)) || defined(OS_ANDROID) || defined(OS_MACOSX)\n    Init_NativeToolbar();\n    Init_NativeTabbar();\n#elif defined(OS_WP8)\n    Init_NativeToolbar_extension();\n    Init_NativeTabbar_extension();\n#endif\n\n#if defined(OS_MACOSX) || defined(RHODES_EMULATOR)\n    Init_Navbar();\n#endif\n\n#if defined(OS_WINDOWS_DESKTOP) || defined(RHODES_EMULATOR) || defined(OS_WINCE) || defined(OS_MACOSX) || defined(OS_ANDROID)\n    Init_Notification();\n#endif\n\n#if defined(OS_MACOSX) || defined(OS_ANDROID) || defined(WINDOWS_PLATFORM)\n    Init_RhoFile();\n#endif\n\n#if defined(OS_WINDOWS_DESKTOP) || defined(OS_WINCE) || defined(RHODES_EMULATOR)\n    Init_NativeMenuBar();\n#endif\n\n\n#if defined(OS_WINCE) || defined(OS_ANDROID)\n    \/\/Init_Led();\n#endif\n\n#if defined(OS_ANDROID) || defined(OS_WINCE) || defined(OS_MACOSX) || (defined(OS_WINDOWS_DESKTOP) && !defined(RHODES_EMULATOR))\n    Init_Push();\n#endif\n\n#if defined(OS_ANDROID) || (defined(OS_MACOSX) && !defined(RHODES_EMULATOR)) || defined(OS_WINCE)\n    Init_Intent();\n#endif\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: object.cxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: vg $ $Date: 2006-06-02 12:42:35 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n\n#if defined(WIN32) || defined(WIN16)\n#include <windows.h>\n#endif\n\n#include <string.h>\n\n#include <rtl\/alloc.h>\n#include <rtl\/memory.h>\n\n#include <vos\/diagnose.hxx>\n\n#include <vos\/object.hxx>\n\nusing namespace vos;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Object super class\n\nVOS_NAMESPACE(OClassInfo, vos) VOS_NAMESPACE(OObject, vos)::__ClassInfo__(VOS_CLASSNAME(OObject, vos), sizeof(VOS_NAMESPACE(OObject, vos)));\n\nOObject::OObject()\n{\n}\n\nOObject::OObject(const OCreateParam& rParam)\n{\n}\n\nOObject::~OObject()\n{\n}\n\nvoid* OObject::operator new(size_t size)\n{\n   void* p = rtl_allocateMemory(size);\n\n   VOS_ASSERT(p != NULL);\n\n   return (p);\n}\n\nvoid* OObject::operator new(size_t size, void* p)\n{\n   return (p);\n}\n\nvoid OObject::operator delete(void* p)\n{\n   rtl_freeMemory(p);\n}\n\nconst OClassInfo& OObject::classInfo()\n{\n    return (__ClassInfo__);\n}\n\nconst OClassInfo& OObject::getClassInfo() const\n{\n    return (VOS_CLASSINFO(VOS_NAMESPACE(OObject, vos)));\n}\n\nsal_Bool OObject::isKindOf(const OClassInfo& rClass) const\n{\n    VOS_ASSERT(this != NULL);\n\n    const OClassInfo& rClassThis = getClassInfo();\n\n    return (rClassThis.isDerivedFrom(rClass));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Basic class information\n\nOClassInfo::OClassInfo(const sal_Char *pClassName, sal_Int32 ObjectSize,\n                       const OClassInfo* pBaseClass, sal_uInt32 Schema,\n                       OObject* (SAL_CALL * fnCreateObject)(const OCreateParam&))\n{\n    m_pClassName  = pClassName;\n    m_nObjectSize = ObjectSize;\n    m_wSchema     = Schema;\n\n    m_pfnCreateObject = fnCreateObject;\n\n    m_pBaseClass = pBaseClass;\n    m_pNextClass = NULL;\n}\n\nOObject* OClassInfo::createObject(const OCreateParam& rParam) const\n{\n    if (m_pfnCreateObject == NULL)\n        return NULL;\n\n    OObject* pObject = NULL;\n    pObject = (*m_pfnCreateObject)(rParam);\n\n    return (pObject);\n}\n\nsal_Bool OClassInfo::isDerivedFrom(const OClassInfo& rClass) const\n{\n    VOS_ASSERT(this != NULL);\n\n    const OClassInfo* pClassThis = this;\n\n    while (pClassThis != NULL)\n    {\n        if (pClassThis == &rClass)\n            return (sal_True);\n\n        pClassThis = pClassThis->m_pBaseClass;\n    }\n\n    return (sal_False);      \/\/ walked to the top, no match\n}\n\nconst OClassInfo* OClassInfo::getClassInfo(const sal_Char* pClassName)\n{\n    VOS_ASSERT(pClassName != NULL);\n\n    const OClassInfo* pClass = &VOS_CLASSINFO(VOS_NAMESPACE(OObject, vos));\n\n    while (pClass != NULL)\n    {\n        if (strcmp(pClassName, pClass->m_pClassName) == 0)\n            break;\n\n        pClass = pClass->m_pNextClass;\n    }\n\n    return (pClass);\n}\n\nVOS_CLASSINIT::VOS_CLASSINIT(register OClassInfo* pNewClass)\n{\n    VOS_ASSERT(pNewClass != NULL);\n\n    OClassInfo* pClassRoot = (OClassInfo*)&VOS_CLASSINFO(VOS_NAMESPACE(OObject, vos));\n\n    pNewClass->m_pNextClass = pClassRoot->m_pNextClass;\n\n    pClassRoot->m_pNextClass = pNewClass;\n}\n<commit_msg>INTEGRATION: CWS warnings01 (1.3.126); FILE MERGED 2006\/01\/25 21:59:16 sb 1.3.126.4: RESYNC: (1.4-1.5); FILE MERGED 2005\/11\/21 15:07:03 sb 1.3.126.3: #i53898# Made code warning-free. 2005\/09\/23 00:18:15 sb 1.3.126.2: RESYNC: (1.3-1.4); FILE MERGED 2005\/09\/07 16:34:15 sb 1.3.126.1: #i53898# Made code warning-free.<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: object.cxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: hr $ $Date: 2006-06-20 04:06: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#include <string.h>\n\n#include <rtl\/alloc.h>\n#include <rtl\/memory.h>\n\n#include <vos\/diagnose.hxx>\n\n#include <vos\/object.hxx>\n\nusing namespace vos;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Object super class\n\nVOS_NAMESPACE(OClassInfo, vos) VOS_NAMESPACE(OObject, vos)::__ClassInfo__(VOS_CLASSNAME(OObject, vos), sizeof(VOS_NAMESPACE(OObject, vos)));\n\nOObject::OObject()\n{\n}\n\nOObject::OObject(const OCreateParam&)\n{\n}\n\nOObject::~OObject()\n{\n}\n\nvoid* OObject::operator new(size_t size)\n{\n   void* p = rtl_allocateMemory(size);\n\n   VOS_ASSERT(p != NULL);\n\n   return (p);\n}\n\nvoid* OObject::operator new(size_t, void* p)\n{\n   return (p);\n}\n\nvoid OObject::operator delete(void* p)\n{\n   rtl_freeMemory(p);\n}\n\nconst OClassInfo& OObject::classInfo()\n{\n    return (__ClassInfo__);\n}\n\nconst OClassInfo& OObject::getClassInfo() const\n{\n    return (VOS_CLASSINFO(VOS_NAMESPACE(OObject, vos)));\n}\n\nsal_Bool OObject::isKindOf(const OClassInfo& rClass) const\n{\n    VOS_ASSERT(this != NULL);\n\n    const OClassInfo& rClassThis = getClassInfo();\n\n    return (rClassThis.isDerivedFrom(rClass));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Basic class information\n\nOClassInfo::OClassInfo(const sal_Char *pClassName, sal_Int32 ObjectSize,\n                       const OClassInfo* pBaseClass, sal_uInt32 Schema,\n                       OObject* (SAL_CALL * fnCreateObject)(const OCreateParam&))\n{\n    m_pClassName  = pClassName;\n    m_nObjectSize = ObjectSize;\n    m_wSchema     = Schema;\n\n    m_pfnCreateObject = fnCreateObject;\n\n    m_pBaseClass = pBaseClass;\n    m_pNextClass = NULL;\n}\n\nOObject* OClassInfo::createObject(const OCreateParam& rParam) const\n{\n    if (m_pfnCreateObject == NULL)\n        return NULL;\n\n    OObject* pObject = NULL;\n    pObject = (*m_pfnCreateObject)(rParam);\n\n    return (pObject);\n}\n\nsal_Bool OClassInfo::isDerivedFrom(const OClassInfo& rClass) const\n{\n    VOS_ASSERT(this != NULL);\n\n    const OClassInfo* pClassThis = this;\n\n    while (pClassThis != NULL)\n    {\n        if (pClassThis == &rClass)\n            return (sal_True);\n\n        pClassThis = pClassThis->m_pBaseClass;\n    }\n\n    return (sal_False);      \/\/ walked to the top, no match\n}\n\nconst OClassInfo* OClassInfo::getClassInfo(const sal_Char* pClassName)\n{\n    VOS_ASSERT(pClassName != NULL);\n\n    const OClassInfo* pClass = &VOS_CLASSINFO(VOS_NAMESPACE(OObject, vos));\n\n    while (pClass != NULL)\n    {\n        if (strcmp(pClassName, pClass->m_pClassName) == 0)\n            break;\n\n        pClass = pClass->m_pNextClass;\n    }\n\n    return (pClass);\n}\n\nVOS_CLASSINIT::VOS_CLASSINIT(register OClassInfo* pNewClass)\n{\n    VOS_ASSERT(pNewClass != NULL);\n\n    OClassInfo* pClassRoot = (OClassInfo*)&VOS_CLASSINFO(VOS_NAMESPACE(OObject, vos));\n\n    pNewClass->m_pNextClass = pClassRoot->m_pNextClass;\n\n    pClassRoot->m_pNextClass = pNewClass;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*  This file is part of the KDE project.\n\nCopyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n\nThis library is free software: you can redistribute it and\/or modify\nit under the terms of the GNU Lesser General Public License as published by\nthe Free Software Foundation, either version 2.1 or 3 of the License.\n\nThis library is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\nGNU Lesser General Public License for more details.\n\nYou should have received a copy of the GNU Lesser General Public License\nalong with this library.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n#include \"mediaobject.h\"\n#include \"utils.h\"\n\n#include \"videowidget.h\"\n\n#ifdef PHONON_MMF_VIDEO_SURFACES\n#include \"videooutput_surface.h\"\n#else\n#include \"videooutput_dsa.h\"\n#endif\n\nQT_BEGIN_NAMESPACE\n\nusing namespace Phonon;\nusing namespace Phonon::MMF;\n\n\/*! \\class MMF::VideoWidget\n  \\internal\n*\/\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Constants\n\/\/-----------------------------------------------------------------------------\n\nstatic const qreal DefaultBrightness = 1.0;\nstatic const qreal DefaultContrast = 1.0;\nstatic const qreal DefaultHue = 1.0;\nstatic const qreal DefaultSaturation = 1.0;\n\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Constructor \/ destructor\n\/\/-----------------------------------------------------------------------------\n\nMMF::VideoWidget::VideoWidget(QWidget *parent)\n        :   MediaNode(parent)\n#ifdef PHONON_MMF_VIDEO_SURFACES\n        ,   m_videoOutput(new SurfaceVideoOutput(parent))\n#else\n        ,   m_videoOutput(new DsaVideoOutput(parent))\n#endif\n        ,   m_brightness(DefaultBrightness)\n        ,   m_contrast(DefaultContrast)\n        ,   m_hue(DefaultHue)\n        ,   m_saturation(DefaultSaturation)\n{\n    TRACE_CONTEXT(VideoWidget::VideoWidget, EVideoApi);\n    TRACE_ENTRY_0();\n\n    TRACE_EXIT_0();\n}\n\nMMF::VideoWidget::~VideoWidget()\n{\n    TRACE_CONTEXT(VideoWidget::~VideoWidget, EVideoApi);\n    TRACE_ENTRY_0();\n\n    TRACE_EXIT_0();\n}\n\n#ifndef PHONON_MMF_VIDEO_SURFACES\nvoid MMF::VideoWidget::setAncestorMoveMonitor(AncestorMoveMonitor *monitor)\n{\n    static_cast<DsaVideoOutput *>(m_videoOutput.data())->setAncestorMoveMonitor(monitor);\n}\n#endif\n\n\n\/\/-----------------------------------------------------------------------------\n\/\/ VideoWidgetInterface\n\/\/-----------------------------------------------------------------------------\n\nPhonon::VideoWidget::AspectRatio MMF::VideoWidget::aspectRatio() const\n{\n    return m_videoOutput->aspectRatio();\n}\n\nvoid MMF::VideoWidget::setAspectRatio\n(Phonon::VideoWidget::AspectRatio aspectRatio)\n{\n    TRACE_CONTEXT(VideoWidget::setAspectRatio, EVideoApi);\n    TRACE(\"aspectRatio %d\", aspectRatio);\n\n    m_videoOutput->setAspectRatio(aspectRatio);\n}\n\nqreal MMF::VideoWidget::brightness() const\n{\n    return m_brightness;\n}\n\nvoid MMF::VideoWidget::setBrightness(qreal brightness)\n{\n    TRACE_CONTEXT(VideoWidget::setBrightness, EVideoApi);\n    TRACE(\"brightness %f\", brightness);\n\n    m_brightness = brightness;\n}\n\nPhonon::VideoWidget::ScaleMode MMF::VideoWidget::scaleMode() const\n{\n    return m_videoOutput->scaleMode();\n}\n\nvoid MMF::VideoWidget::setScaleMode(Phonon::VideoWidget::ScaleMode scaleMode)\n{\n    TRACE_CONTEXT(VideoWidget::setScaleMode, EVideoApi);\n    TRACE(\"setScaleMode %d\", setScaleMode);\n\n    m_videoOutput->setScaleMode(scaleMode);\n}\n\nqreal MMF::VideoWidget::contrast() const\n{\n    return m_contrast;\n}\n\nvoid MMF::VideoWidget::setContrast(qreal contrast)\n{\n    TRACE_CONTEXT(VideoWidget::setContrast, EVideoApi);\n    TRACE(\"contrast %f\", contrast);\n\n    m_contrast = contrast;\n}\n\nqreal MMF::VideoWidget::hue() const\n{\n    return m_hue;\n}\n\nvoid MMF::VideoWidget::setHue(qreal hue)\n{\n    TRACE_CONTEXT(VideoWidget::setHue, EVideoApi);\n    TRACE(\"hue %f\", hue);\n\n    m_hue = hue;\n}\n\nqreal MMF::VideoWidget::saturation() const\n{\n    return m_saturation;\n}\n\nvoid MMF::VideoWidget::setSaturation(qreal saturation)\n{\n    TRACE_CONTEXT(VideoWidget::setSaturation, EVideoApi);\n    TRACE(\"saturation %f\", saturation);\n\n    m_saturation = saturation;\n}\n\nQWidget* MMF::VideoWidget::widget()\n{\n    return m_videoOutput.data();\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ MediaNode\n\/\/-----------------------------------------------------------------------------\n\nvoid MMF::VideoWidget::connectMediaObject(MediaObject *mediaObject)\n{\n    mediaObject->setVideoOutput(m_videoOutput.data());\n}\n\nvoid MMF::VideoWidget::disconnectMediaObject(MediaObject *mediaObject)\n{\n    mediaObject->setVideoOutput(0);\n}\n\nQT_END_NAMESPACE\n\n<commit_msg>Phonon MMF: fixed typo in trace statement<commit_after>\/*  This file is part of the KDE project.\n\nCopyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n\nThis library is free software: you can redistribute it and\/or modify\nit under the terms of the GNU Lesser General Public License as published by\nthe Free Software Foundation, either version 2.1 or 3 of the License.\n\nThis library is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\nGNU Lesser General Public License for more details.\n\nYou should have received a copy of the GNU Lesser General Public License\nalong with this library.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n#include \"mediaobject.h\"\n#include \"utils.h\"\n\n#include \"videowidget.h\"\n\n#ifdef PHONON_MMF_VIDEO_SURFACES\n#include \"videooutput_surface.h\"\n#else\n#include \"videooutput_dsa.h\"\n#endif\n\nQT_BEGIN_NAMESPACE\n\nusing namespace Phonon;\nusing namespace Phonon::MMF;\n\n\/*! \\class MMF::VideoWidget\n  \\internal\n*\/\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Constants\n\/\/-----------------------------------------------------------------------------\n\nstatic const qreal DefaultBrightness = 1.0;\nstatic const qreal DefaultContrast = 1.0;\nstatic const qreal DefaultHue = 1.0;\nstatic const qreal DefaultSaturation = 1.0;\n\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Constructor \/ destructor\n\/\/-----------------------------------------------------------------------------\n\nMMF::VideoWidget::VideoWidget(QWidget *parent)\n        :   MediaNode(parent)\n#ifdef PHONON_MMF_VIDEO_SURFACES\n        ,   m_videoOutput(new SurfaceVideoOutput(parent))\n#else\n        ,   m_videoOutput(new DsaVideoOutput(parent))\n#endif\n        ,   m_brightness(DefaultBrightness)\n        ,   m_contrast(DefaultContrast)\n        ,   m_hue(DefaultHue)\n        ,   m_saturation(DefaultSaturation)\n{\n    TRACE_CONTEXT(VideoWidget::VideoWidget, EVideoApi);\n    TRACE_ENTRY_0();\n\n    TRACE_EXIT_0();\n}\n\nMMF::VideoWidget::~VideoWidget()\n{\n    TRACE_CONTEXT(VideoWidget::~VideoWidget, EVideoApi);\n    TRACE_ENTRY_0();\n\n    TRACE_EXIT_0();\n}\n\n#ifndef PHONON_MMF_VIDEO_SURFACES\nvoid MMF::VideoWidget::setAncestorMoveMonitor(AncestorMoveMonitor *monitor)\n{\n    static_cast<DsaVideoOutput *>(m_videoOutput.data())->setAncestorMoveMonitor(monitor);\n}\n#endif\n\n\n\/\/-----------------------------------------------------------------------------\n\/\/ VideoWidgetInterface\n\/\/-----------------------------------------------------------------------------\n\nPhonon::VideoWidget::AspectRatio MMF::VideoWidget::aspectRatio() const\n{\n    return m_videoOutput->aspectRatio();\n}\n\nvoid MMF::VideoWidget::setAspectRatio\n(Phonon::VideoWidget::AspectRatio aspectRatio)\n{\n    TRACE_CONTEXT(VideoWidget::setAspectRatio, EVideoApi);\n    TRACE(\"aspectRatio %d\", aspectRatio);\n\n    m_videoOutput->setAspectRatio(aspectRatio);\n}\n\nqreal MMF::VideoWidget::brightness() const\n{\n    return m_brightness;\n}\n\nvoid MMF::VideoWidget::setBrightness(qreal brightness)\n{\n    TRACE_CONTEXT(VideoWidget::setBrightness, EVideoApi);\n    TRACE(\"brightness %f\", brightness);\n\n    m_brightness = brightness;\n}\n\nPhonon::VideoWidget::ScaleMode MMF::VideoWidget::scaleMode() const\n{\n    return m_videoOutput->scaleMode();\n}\n\nvoid MMF::VideoWidget::setScaleMode(Phonon::VideoWidget::ScaleMode scaleMode)\n{\n    TRACE_CONTEXT(VideoWidget::setScaleMode, EVideoApi);\n    TRACE(\"setScaleMode %d\", scaleMode);\n\n    m_videoOutput->setScaleMode(scaleMode);\n}\n\nqreal MMF::VideoWidget::contrast() const\n{\n    return m_contrast;\n}\n\nvoid MMF::VideoWidget::setContrast(qreal contrast)\n{\n    TRACE_CONTEXT(VideoWidget::setContrast, EVideoApi);\n    TRACE(\"contrast %f\", contrast);\n\n    m_contrast = contrast;\n}\n\nqreal MMF::VideoWidget::hue() const\n{\n    return m_hue;\n}\n\nvoid MMF::VideoWidget::setHue(qreal hue)\n{\n    TRACE_CONTEXT(VideoWidget::setHue, EVideoApi);\n    TRACE(\"hue %f\", hue);\n\n    m_hue = hue;\n}\n\nqreal MMF::VideoWidget::saturation() const\n{\n    return m_saturation;\n}\n\nvoid MMF::VideoWidget::setSaturation(qreal saturation)\n{\n    TRACE_CONTEXT(VideoWidget::setSaturation, EVideoApi);\n    TRACE(\"saturation %f\", saturation);\n\n    m_saturation = saturation;\n}\n\nQWidget* MMF::VideoWidget::widget()\n{\n    return m_videoOutput.data();\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ MediaNode\n\/\/-----------------------------------------------------------------------------\n\nvoid MMF::VideoWidget::connectMediaObject(MediaObject *mediaObject)\n{\n    mediaObject->setVideoOutput(m_videoOutput.data());\n}\n\nvoid MMF::VideoWidget::disconnectMediaObject(MediaObject *mediaObject)\n{\n    mediaObject->setVideoOutput(0);\n}\n\nQT_END_NAMESPACE\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ $Id$\n\n#include <iostream.h>\n\nvoid hits()\n{\n  hits(\"FMD\",\"1\");\n  hits(\"PHOS\",\"1\");\n  hits(\"START\",\"1\");\n  hits(\"TOF\",\"2\");\n  hits(\"TPC\",\"2\");\n\n  \/\/hits(\"ITS\",\"5\");\n  \/\/hits(\"MUON\",\"0\");\n  \/\/hits(\"PMD\",\"1\");\n  \/\/hits(\"RICH\",\"1\");\n}  \n\nvoid hits(const TString& detName, const TString& detVersion)\n{\n  cout << detName << endl;\n\n  \/\/ labels\n  TString g3 = \"G3: \";\n  TString g4 = \"G4: \";\n\n  \/\/ construct file names\n  TString top = getenv(\"ALICE_ROOT\");\n  TString f1NameEnd = \"test10.root\";\n  TString f2NameEnd = \"test20.root\";\n\n  TString g3File1Name = top + \"\/test\/\" + f1NameEnd;\n  TString g3File2Name = top + \"\/test\/\" + f2NameEnd;\n  TString g4File1Name = top + \"\/AliGeant4\/test\/\" + f1NameEnd;\n  TString g4File2Name = top + \"\/AliGeant4\/test\/\" + f2NameEnd;\n  \n  cout << \"Files: \" << endl;\n  cout << g3File1Name << endl;\n  cout << g3File2Name << endl;\n  cout << g4File1Name << endl;\n  cout << g4File2Name << endl;\n\n  \/\/ link shared libs\n  if (gClassTable->GetID(\"AliRun\") < 0) {\n    gROOT->LoadMacro(\"loadlibs.C\");\n    loadlibs();\n  }\n  cout << \"AliRoot libraries were loaded.\" << endl;\n      \n  \/\/ set histogram ranges\n  Int_t nbin;\n  Int_t g3xmin; Int_t g4xmin; Int_t g3xmax; Int_t g4xmax;\n  Int_t g3ymin; Int_t g4ymin; Int_t g3ymax; Int_t g4ymax;\n  Int_t g3zmin; Int_t g4zmin; Int_t g3zmax; Int_t g4zmax;\n  SetHistogramRanges(detName, nbin, \n                     g3xmin, g3xmax, g4xmin, g4xmax,\n                     g3ymin, g3ymax, g4ymin, g4ymax,\n                     g3zmin, g3zmax, g4zmin, g4zmax);\n\n\n  \/\/ create histograms\n  TH1F* g3x  = new TH1F(\"g3x\",  g3 + detName + \" hits per x\", nbin, g3xmin, g3xmax);\n  TH1F* g3xh = new TH1F(\"g3xh\", g3 + detName + \" hits per x\", nbin, g3xmin, g3xmax);\n  TH1F* g4x  = new TH1F(\"g4x\",  g4 + detName + \" hits per x\", nbin, g4xmin, g4xmax);\n  TH1F* g4xh = new TH1F(\"g4xh\", g4 + detName + \" hits per x\", nbin, g4xmin, g4xmax);\n\n  TH1F* g3z  = new TH1F(\"g3z\",  g3 + detName + \" hits per z\", nbin, g3zmin, g3zmax);\n  TH1F* g3zh = new TH1F(\"g3zh\", g3 + detName + \" hits per z\", nbin, g3zmin, g3zmax);\n  TH1F* g4z  = new TH1F(\"g4z\",  g4 + detName + \" hits per z\", nbin, g4zmin, g4zmax);\n  TH1F* g4zh = new TH1F(\"g4zh\", g4 + detName + \" hits per z\", nbin, g4zmin, g4zmax);\n\n  TH1F* g3y  = 0;\n  TH1F* g3yh = 0;\n  TH1F* g4y  = 0;\n  TH1F* g4yh = 0;\n  if (detName == \"PHOS\") {\n    TH1F* g3y  = new TH1F(\"g3y\",  g3 + detName + \" hits per y\", nbin, g3ymin, g3ymax);\n    TH1F* g3yh = new TH1F(\"g3yh\", g3 + detName + \" hits per y\", nbin, g3ymin, g3ymax);\n    TH1F* g4y  = new TH1F(\"g4y\",  g4 + detName + \" hits per y\", nbin, g4ymin, g4ymax);\n    TH1F* g4yh = new TH1F(\"g4yh\", g4 + detName + \" hits per y\", nbin, g4ymin, g4ymax);\n  }\n\n  cout << \"Histograms were created.\" << endl;\n\n  \/\/ fill histograms\n  AliDetector* detector;\n\n  \/\/detector = LoadDetector(g3File1Name, detName, g3);\n  \/\/FillHistogram(detector, g3, g3x, g3y, g3z); \n\n  detector = LoadDetector(g3File2Name, detName,  g3);\n  FillHistogram(detector, g3, g3xh, g3yh, g3zh); \n  \/\/TH1F* g3xh = LoadHistograms(\"g3xh\"); \n  \/\/TH1F* g3zh = LoadHistograms(\"g3zh\"); \n\n  detector = LoadDetector(g4File1Name, detName, g4);\n  FillHistogram(detector, g4, g4x, g4y, g4z); \n\n  detector = LoadDetector(g4File2Name, detName, g4);\n  FillHistogram(detector, g4, g4xh, g4yh, g4zh); \n\n  \/\/ compose picture name\n  TString gifNameBase =  \"hits\" + detName + \"v\" + detVersion;\n  TString title = detName + \" hits\";\n\n  \/\/ draw histohrams\n  DrawHistograms(title, gifNameBase + \".gif\", g3xh, g4xh, g3zh, g4zh);\n  if (detName == \"PHOS\") \n    DrawHistograms(title, gifNameBase + \"2.gif\", g3yh, g4yh, g3zh, g4zh);\n\n  \/\/DrawHistograms(title, gifNameBase + \"_x.gif\", g3x, g4x, g3xh, g4xh);\n  \/\/DrawHistograms(title, gifNameBase + \"_y.gif\", g3y, g4y, g3yh, g4yh);\n  \/\/DrawHistograms(title, gifNameBase + \"_z.gif\", g3z, g4z, g3zh, g4zh);\n  \n}\n\nvoid SetHistogramRanges(TString& detName, Int_t& nbin, \n                        Int_t& g3xmin, Int_t& g3xmax,\n                        Int_t& g4xmin, Int_t& g4xmax,\n                        Int_t& g3ymin, Int_t& g3ymax, \n                        Int_t& g4ymin, Int_t& g4ymax, \n                        Int_t& g3zmin, Int_t& g3zmax, \n                        Int_t& g4zmin, Int_t& g4zmax)\n{\t\t\t \n  nbin = 200;\n\n  g3xmin = 0; g4xmin = g3xmin;\n  g3xmax = 1; g4xmax = g3xmax;\n  g3ymin = 0; g4ymin = g3xmin;\n  g3ymax = 1; g4ymax = g3xmax;\n  g3zmin = 0; g4zmin = g3zmin;\n  g3zmax = 1; g4zmax = g3zmax;\n\n  if (detName == \"FMD\") {\n    g3xmin = -50; g4xmin = g3xmin;\n    g3xmax =  50; g4xmax = g3xmax;\n    g3zmin = -700; g4zmin = g3zmin;\n    g3zmax =  150; g4zmax = g3zmax;\n  }\n  else if (detName == \"ITS\") {\n    g3xmin = -60; g4xmin = g3xmin;\n    g3xmax =  60; g4xmax = g3xmax;\n    g3zmin = -60; g4zmin = g3zmin;\n    g3zmax =  60; g4zmax = g3zmax;\n  }  \n  else if (detName == \"MUON\") {\n    g3xmin = -450; g4xmin = g3xmin;\n    g3xmax =  450; g4xmax = g3xmax;\n    g3zmin =  400; g4zmin = g3zmin;\n    g3zmax = 1800; g4zmax = g3zmax;\n  }\n  else if (detName == \"PHOS\") {\n    g3xmin = -400; g4xmin = g3xmin;\n    g3xmax =  400; g4xmax = g3xmax;\n    g3ymin =  250; g4ymin = g3ymin;\n    g3ymax =  500; g4ymax = g3ymax;\n    g3zmin =  -80; g4zmin = g3zmin;\n    g3zmax =   80; g4zmax = g3zmax;\n  }\n  else if (detName == \"PMD\") {\n    g3xmin = -200; g4xmin = g3xmin*10;\n    g3xmax =  200; g4xmax = g3xmax*10;\n    g3zmin = -582; g4zmin = g3zmin*10;\n    g3zmax = -578; g4zmax = g3zmax*10;\n  }\n  else if (detName == \"RICH\") {\n    g3xmin = -250; g4xmin = g3xmin;\n    g3xmax =  250; g4xmax = g3xmax;\n    g3zmin = -250; g4zmin = g3zmin;\n    g3zmax =  250; g4zmax = g3zmax;\n  }\n  else if (detName == \"START\") {\n    g3xmin = -10; g4xmin = g3xmin;\n    g3xmax =  10; g4xmax = g3xmax;\n    g3zmin = -80; g4zmin = g3zmin;\n    g3zmax =  80; g4zmax = g3zmax;\n  }\n  else if (detName == \"TOF\") {\n    g3xmin = -400; g4xmin = g3xmin;\n    g3xmax =  400; g4xmax = g3xmax;\n    g3zmin = -400; g4zmin = g3zmin;\n    g3zmax =  400; g4zmax = g3zmax;\n  }\n  else if (detName == \"TPC\") {\n    g3xmin = -300; g4xmin = g3xmin;\n    g3xmax =  300; g4xmax = g3xmax;\n    g3zmin = -300; g4zmin = g3zmin;\n    g3zmax =  300; g4zmax = g3zmax;\n  }\n}  \n\nAliDetector* LoadDetector(TString& fileName, TString& detName, TString& label)\n{ \n  \/\/ connect the Root files\n  TFile* file = new TFile(fileName);\n  if (!file) {\n    cerr << \"Root file was not found.\" << endl;\n    return 0;\n  }\n\n  \/\/ get AliRun object from file \n  if (gAlice) delete gAlice;\n  gAlice = 0;\n  gAlice = (AliRun*)file->Get(\"gAlice\");\n  if (!gAlice) {\n    cerr << label << \"AliRun object not found in a file.\" << endl;\n    return 0;\n  }\n      \n  \/\/ import the hits trees \n  Int_t nparticles = gAlice->GetEvent(0);\n  if (nparticles <= 0) {\n    cerr << label << \"No particles in a file.\" << endl;\n    return 0;\n  }  \n  cout << label << \"got nparticles = \" << nparticles << endl;\n\n  \/\/ get detector\n  AliDetector* detector = gAlice->GetDetector(detName);\n  if (!detector) {\n    cerr << label << \"No detector \" << detName << \" in a file.\" << endl;\n    return 0;\n  }  \n  \n  return detector;\n}  \n\nvoid FillHistogram(AliDetector* detector, TString& label, \n                   TH1F* hx, TH1F* hy, TH1F* hz) \n{ \n  Int_t nofHits = 0;\n  \/\/ get number of primary tracks\n  Int_t ntracks = gAlice->TreeH()->GetEntries();\n  cout << label << \"got ntracks = \" << ntracks << endl;\n\n  \/\/ loop on tracks in the hits container\n  for (Int_t i=0; i<ntracks; i++) {\n    \/\/ loop on hits  \n    for(AliHit* hit= detector->FirstHit(i); hit; hit=detector->NextHit()) {\n\n      TString detName = detector->GetName();\n      if (detName == \"PHOS\") { \n        \/\/ PHOS special\n        FillPHOSHit(detector, hit, hx, hy, hz);\n      }\t\n      else {\n        FillHit(hit, hx, hy, hz);\n      }\t\n\t\n      nofHits++;\n    }\n  } \n\/*  \n  TFile* file = new TFile(\"tmp.root\",\"recreate\");\n  hx->Write();\n  hz->Write();\n  file->Close();\n*\/\n  cout << label << \"filled \" << nofHits << \" hits\" << endl;\n}  \n\nTH1F* LoadHistograms(TString name)\n{\n  TFile* file = new TFile(\"tmp.root\");\n  return (TH1F*)file->Get(name);\n}  \n\nvoid FillHit(AliHit* hit, TH1F* hx, TH1F* hy, TH1F* hz) \n{ \n  if (hx) hx->Fill(hit->X());\n  if (hy) hy->Fill(hit->Y());\n  if (hz) hz->Fill(hit->Z());\n}  \n\nvoid FillPHOSHit(AliDetector* detector, AliHit* hit, \n                 TH1F* hx, TH1F* hy, TH1F* hz) \n{ \n  \/\/ PHOS special\n  Float_t id = ((AliPHOSHit*)hit)->GetId();\n      \n  TVector3 pos;\n  ((AliPHOS*)detector)->GetGeometry()->RelPosInAlice(id, pos);\n    \n  if (hx) hx->Fill(pos.X());\n  if (hy) hy->Fill(pos.Y());\n  if (hz) hz->Fill(pos.Z());\n}  \n\nvoid DrawHistograms(TString& title, TString& gifName,\n                    TH1F* h1, TH1F* h2, TH1F* h3, TH1F* h4)\n{\n\/\/ Create canvas, set the view range, show histograms.\n\/\/ ---\n\n  if (h1 && h2 && h3 && h4) {\n    \/\/ create canvas\n    TCanvas* canvas = new TCanvas(\"c1\", title, 400, 10, 800, 600);\n    canvas->Divide(2,2);\n    \n    \/\/ draw histograms\n    canvas->cd(1); h1->Draw();\n    canvas->cd(2); h2->Draw(); \n    canvas->cd(3); h3->Draw(); \n    canvas->cd(4); h4->Draw();\n    \n    \/\/ save gif\n    \/\/canvas->SaveAs(gifNameBase + \"_x.gif\"); \n    canvas->SaveAs(gifName); \n  }  \n}\n<commit_msg>added function for drawing histograms one by one; added function for loading histograms from tmp file<commit_after>\/\/ $Id$\n\n#include <iostream.h>\n\nvoid hits()\n{\n  hits(\"FMD\",\"1\");\n  hits(\"PHOS\",\"1\");\n  hits(\"START\",\"1\");\n  hits(\"TOF\",\"2\");\n  hits(\"TPC\",\"2\");\n\n  \/\/hits(\"ITS\",\"5\");\n  \/\/hits(\"MUON\",\"0\");\n  \/\/hits(\"PMD\",\"1\");\n  \/\/hits(\"RICH\",\"1\");\n}  \n\nvoid hits(const TString& detName, const TString& detVersion)\n{\n  cout << detName << endl;\n\n  \/\/ labels\n  TString g3 = \"G3: \";\n  TString g4 = \"G4: \";\n\n  \/\/ construct file names\n  TString top = getenv(\"ALICE_ROOT\");\n  TString f1NameEnd = \"test10.root\";\n  TString f2NameEnd = \"test20.root\";\n\n  TString g3File1Name = top + \"\/test\/\" + f1NameEnd;\n  TString g3File2Name = top + \"\/test\/\" + f2NameEnd;\n  TString g4File1Name = top + \"\/AliGeant4\/test\/\" + f1NameEnd;\n  TString g4File2Name = top + \"\/AliGeant4\/test\/\" + f2NameEnd;\n  \n  cout << \"Files: \" << endl;\n  cout << g3File1Name << endl;\n  cout << g3File2Name << endl;\n  cout << g4File1Name << endl;\n  cout << g4File2Name << endl;\n\n  \/\/ link shared libs\n  if (gClassTable->GetID(\"AliRun\") < 0) {\n    gROOT->LoadMacro(\"loadlibs.C\");\n    loadlibs();\n  }\n  cout << \"AliRoot libraries were loaded.\" << endl;\n      \n  \/\/ set histogram ranges\n  Int_t nbin;\n  Int_t g3xmin; Int_t g4xmin; Int_t g3xmax; Int_t g4xmax;\n  Int_t g3ymin; Int_t g4ymin; Int_t g3ymax; Int_t g4ymax;\n  Int_t g3zmin; Int_t g4zmin; Int_t g3zmax; Int_t g4zmax;\n  SetHistogramRanges(detName, nbin, \n                     g3xmin, g3xmax, g4xmin, g4xmax,\n                     g3ymin, g3ymax, g4ymin, g4ymax,\n                     g3zmin, g3zmax, g4zmin, g4zmax);\n\n\n  \/\/ create histograms\n  TH1F* g3x  = new TH1F(\"g3x\",  g3 + detName + \" hits per x\", nbin, g3xmin, g3xmax);\n  TH1F* g3xh = new TH1F(\"g3xh\", g3 + detName + \" hits per x\", nbin, g3xmin, g3xmax);\n  TH1F* g4x  = new TH1F(\"g4x\",  g4 + detName + \" hits per x\", nbin, g4xmin, g4xmax);\n  TH1F* g4xh = new TH1F(\"g4xh\", g4 + detName + \" hits per x\", nbin, g4xmin, g4xmax);\n\n  TH1F* g3z  = new TH1F(\"g3z\",  g3 + detName + \" hits per z\", nbin, g3zmin, g3zmax);\n  TH1F* g3zh = new TH1F(\"g3zh\", g3 + detName + \" hits per z\", nbin, g3zmin, g3zmax);\n  TH1F* g4z  = new TH1F(\"g4z\",  g4 + detName + \" hits per z\", nbin, g4zmin, g4zmax);\n  TH1F* g4zh = new TH1F(\"g4zh\", g4 + detName + \" hits per z\", nbin, g4zmin, g4zmax);\n\n  TH1F* g3y  = 0;\n  TH1F* g3yh = 0;\n  TH1F* g4y  = 0;\n  TH1F* g4yh = 0;\n  if (detName == \"PHOS\") {\n    TH1F* g3y  = new TH1F(\"g3y\",  g3 + detName + \" hits per y\", nbin, g3ymin, g3ymax);\n    TH1F* g3yh = new TH1F(\"g3yh\", g3 + detName + \" hits per y\", nbin, g3ymin, g3ymax);\n    TH1F* g4y  = new TH1F(\"g4y\",  g4 + detName + \" hits per y\", nbin, g4ymin, g4ymax);\n    TH1F* g4yh = new TH1F(\"g4yh\", g4 + detName + \" hits per y\", nbin, g4ymin, g4ymax);\n  }\n\n  cout << \"Histograms were created.\" << endl;\n\n  \/\/ fill histograms\n  AliDetector* detector;\n\n  detector = LoadDetector(g3File1Name, detName, g3);\n  FillHistogram(detector, g3, g3x, g3y, g3z); \n\n  detector = LoadDetector(g3File2Name, detName,  g3);\n  FillHistogram(detector, g3, g3xh, g3yh, g3zh); \n  \/\/TH1F* g3xh = LoadHistograms(\"g3xh\"); \n  \/\/TH1F* g3zh = LoadHistograms(\"g3zh\"); \n\n  detector = LoadDetector(g4File1Name, detName, g4);\n  FillHistogram(detector, g4, g4x, g4y, g4z); \n\n  detector = LoadDetector(g4File2Name, detName, g4);\n  FillHistogram(detector, g4, g4xh, g4yh, g4zh); \n\n  \/\/ compose picture name\n  TString gifNameBase =  \"hits\" + detName + \"v\" + detVersion;\n  TString title = detName + \" hits\";\n\n  \/\/ draw histograms (G3, G4 in one canvas)\n  DrawHistograms(title, gifNameBase + \".gif\", g3xh, g4xh, g3zh, g4zh);\n  if (detName == \"PHOS\") \n    DrawHistograms(title, gifNameBase + \"2.gif\", g3yh, g4yh, g3zh, g4zh);\n\n  \/\/DrawHistograms(title, gifNameBase + \"_x.gif\", g3x, g4x, g3xh, g4xh);\n  \/\/DrawHistograms(title, gifNameBase + \"_y.gif\", g3y, g4y, g3yh, g4yh);\n  \/\/DrawHistograms(title, gifNameBase + \"_z.gif\", g3z, g4z, g3zh, g4zh);\n  \n  \/\/ draw histograms (one by one)\n  DrawHistogram(title, \"g3x_\"+ gifNameBase + \".gif\", g3xh);\n  DrawHistogram(title, \"g4x_\"+ gifNameBase + \".gif\", g4xh);\n  DrawHistogram(title, \"g3z_\"+ gifNameBase + \".gif\", g3zh);\n  DrawHistogram(title, \"g4z_\"+ gifNameBase + \".gif\", g4zh);\n\n}\n\nvoid SetHistogramRanges(TString& detName, Int_t& nbin, \n                        Int_t& g3xmin, Int_t& g3xmax,\n                        Int_t& g4xmin, Int_t& g4xmax,\n                        Int_t& g3ymin, Int_t& g3ymax, \n                        Int_t& g4ymin, Int_t& g4ymax, \n                        Int_t& g3zmin, Int_t& g3zmax, \n                        Int_t& g4zmin, Int_t& g4zmax)\n{\t\t\t \n  nbin = 200;\n\n  g3xmin = 0; g4xmin = g3xmin;\n  g3xmax = 1; g4xmax = g3xmax;\n  g3ymin = 0; g4ymin = g3xmin;\n  g3ymax = 1; g4ymax = g3xmax;\n  g3zmin = 0; g4zmin = g3zmin;\n  g3zmax = 1; g4zmax = g3zmax;\n\n  if (detName == \"FMD\") {\n    g3xmin = -50; g4xmin = g3xmin;\n    g3xmax =  50; g4xmax = g3xmax;\n    g3zmin = -700; g4zmin = g3zmin;\n    g3zmax =  150; g4zmax = g3zmax;\n  }\n  else if (detName == \"ITS\") {\n    g3xmin = -60; g4xmin = g3xmin;\n    g3xmax =  60; g4xmax = g3xmax;\n    g3zmin = -60; g4zmin = g3zmin;\n    g3zmax =  60; g4zmax = g3zmax;\n  }  \n  else if (detName == \"MUON\") {\n    g3xmin = -450; g4xmin = g3xmin;\n    g3xmax =  450; g4xmax = g3xmax;\n    g3zmin =  400; g4zmin = g3zmin;\n    g3zmax = 1800; g4zmax = g3zmax;\n  }\n  else if (detName == \"PHOS\") {\n    g3xmin = -400; g4xmin = g3xmin;\n    g3xmax =  400; g4xmax = g3xmax;\n    g3ymin =  250; g4ymin = g3ymin;\n    g3ymax =  500; g4ymax = g3ymax;\n    g3zmin =  -80; g4zmin = g3zmin;\n    g3zmax =   80; g4zmax = g3zmax;\n  }\n  else if (detName == \"PMD\") {\n    g3xmin = -200; g4xmin = g3xmin*10;\n    g3xmax =  200; g4xmax = g3xmax*10;\n    g3zmin = -582; g4zmin = g3zmin*10;\n    g3zmax = -578; g4zmax = g3zmax*10;\n  }\n  else if (detName == \"RICH\") {\n    g3xmin = -250; g4xmin = g3xmin;\n    g3xmax =  250; g4xmax = g3xmax;\n    g3zmin = -250; g4zmin = g3zmin;\n    g3zmax =  250; g4zmax = g3zmax;\n  }\n  else if (detName == \"START\") {\n    g3xmin = -10; g4xmin = g3xmin;\n    g3xmax =  10; g4xmax = g3xmax;\n    g3zmin = -80; g4zmin = g3zmin;\n    g3zmax =  80; g4zmax = g3zmax;\n  }\n  else if (detName == \"TOF\") {\n    g3xmin = -400; g4xmin = g3xmin;\n    g3xmax =  400; g4xmax = g3xmax;\n    g3zmin = -400; g4zmin = g3zmin;\n    g3zmax =  400; g4zmax = g3zmax;\n  }\n  else if (detName == \"TPC\") {\n    g3xmin = -300; g4xmin = g3xmin;\n    g3xmax =  300; g4xmax = g3xmax;\n    g3zmin = -300; g4zmin = g3zmin;\n    g3zmax =  300; g4zmax = g3zmax;\n  }\n}  \n\nAliDetector* LoadDetector(TString& fileName, TString& detName, TString& label)\n{ \n  \/\/ connect the Root files\n  TFile* file = new TFile(fileName);\n  if (!file) {\n    cerr << \"Root file was not found.\" << endl;\n    return 0;\n  }\n\n  \/\/ get AliRun object from file \n  if (gAlice) delete gAlice;\n  gAlice = 0;\n  gAlice = (AliRun*)file->Get(\"gAlice\");\n  if (!gAlice) {\n    cerr << label << \"AliRun object not found in a file.\" << endl;\n    return 0;\n  }\n      \n  \/\/ import the hits trees \n  Int_t nparticles = gAlice->GetEvent(0);\n  if (nparticles <= 0) {\n    cerr << label << \"No particles in a file.\" << endl;\n    return 0;\n  }  \n  cout << label << \"got nparticles = \" << nparticles << endl;\n\n  \/\/ get detector\n  AliDetector* detector = gAlice->GetDetector(detName);\n  if (!detector) {\n    cerr << label << \"No detector \" << detName << \" in a file.\" << endl;\n    return 0;\n  }  \n  \n  return detector;\n}  \n\nvoid FillHistogram(AliDetector* detector, TString& label, \n                   TH1F* hx, TH1F* hy, TH1F* hz) \n{ \n  Int_t nofHits = 0;\n  \/\/ get number of primary tracks\n  Int_t ntracks = gAlice->TreeH()->GetEntries();\n  cout << label << \"got ntracks = \" << ntracks << endl;\n\n  \/\/ loop on tracks in the hits container\n  for (Int_t i=0; i<ntracks; i++) {\n    \/\/ loop on hits  \n    for(AliHit* hit= detector->FirstHit(i); hit; hit=detector->NextHit()) {\n\n      TString detName = detector->GetName();\n      if (detName == \"PHOS\") { \n        \/\/ PHOS special\n        FillPHOSHit(detector, hit, hx, hy, hz);\n      }\t\n      else {\n        FillHit(hit, hx, hy, hz);\n      }\t\n\t\n      nofHits++;\n    }\n  } \n\/*  \n  TFile* file = new TFile(\"tmp.root\",\"recreate\");\n  hx->Write();\n  hz->Write();\n  file->Close();\n*\/\n  cout << label << \"filled \" << nofHits << \" hits\" << endl;\n}  \n\nTH1F* LoadHistograms(TString name)\n{\n  TFile* file = new TFile(\"tmp.root\");\n  return (TH1F*)file->Get(name);\n}  \n\nvoid FillHit(AliHit* hit, TH1F* hx, TH1F* hy, TH1F* hz) \n{ \n  if (hx) hx->Fill(hit->X());\n  if (hy) hy->Fill(hit->Y());\n  if (hz) hz->Fill(hit->Z());\n}  \n\nvoid FillPHOSHit(AliDetector* detector, AliHit* hit, \n                 TH1F* hx, TH1F* hy, TH1F* hz) \n{ \n  \/\/ PHOS special\n  Float_t id = ((AliPHOSHit*)hit)->GetId();\n      \n  TVector3 pos;\n  ((AliPHOS*)detector)->GetGeometry()->RelPosInAlice(id, pos);\n    \n  if (hx) hx->Fill(pos.X());\n  if (hy) hy->Fill(pos.Y());\n  if (hz) hz->Fill(pos.Z());\n}  \n\nvoid DrawHistograms(TString& title, TString& gifName,\n                    TH1F* h1, TH1F* h2, TH1F* h3, TH1F* h4)\n{\n\/\/ Create canvas, set the view range, show histograms.\n\/\/ ---\n\n  if (h1 && h2 && h3 && h4) {\n    \/\/ create canvas\n    TCanvas* canvas1 = new TCanvas(\"c1\", title, 400, 10, 400, 300);\n    TCanvas* canvas2 = new TCanvas(\"c2\", title, 400, 10, 400, 300);\n    TCanvas* canvas3 = new TCanvas(\"c3\", title, 400, 10, 400, 300);\n    TCanvas* canvas4 = new TCanvas(\"c4\", title, 400, 10, 400, 300);\n    \/\/canvas->Divide(2,2);\n    \n    \/\/ draw histograms\n    canvas1->cd(1); h1->Draw();\n    canvas2->cd(1); h2->Draw(); \n    canvas3->cd(1); h3->Draw(); \n    canvas4->cd(1); h4->Draw();\n    \n    \/\/ save gif\n    \/\/canvas->SaveAs(gifNameBase + \"_x.gif\"); \n    canvas1->SaveAs(gifName+\"1\"); \n    canvas2->SaveAs(gifName+\"2\"); \n    canvas3->SaveAs(gifName+\"3\"); \n    canvas4->SaveAs(gifName+\"4\"); \n  }  \n}\n\nvoid DrawHistogram(TString& title, TString& gifName, TH1F* h)\n{\n\/\/ Create canvas, set the view range, show histograms.\n\/\/ ---\n\n  if (h){\n    \/\/ create canvas\n    TCanvas* canvas = new TCanvas(\"c\", title, 400, 10, 400, 300);\n    \n    \/\/ draw histograms\n    h->Draw();\n    \n    \/\/ save gif\n    canvas->SaveAs(gifName); \n  }  \n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/ \\file DboxPassword.cpp\n\/\/-----------------------------------------------------------------------------\n\n#include \"PasswordSafe.h\"\n\n#include \"ThisMfcApp.h\"\n#include \"corelib\/Util.h\"\n#include \"corelib\/PWCharPool.h\"\n#include \"corelib\/PWSprefs.h\"\n\n#include \"DboxMain.h\"\n\n\n\/\/-----------------------------------------------------------------------------\nCMyString\nDboxMain::GetPassword(void) const\n{\n  PWSprefs *prefs = PWSprefs::GetInstance();\n  CPasswordCharPool pwchars(prefs->GetPref(PWSprefs::IntPrefs::PWLenDefault),\n\t\t\t    prefs->GetPref(PWSprefs::BoolPrefs::PWUseLowercase),\n\t\t\t    prefs->GetPref(PWSprefs::BoolPrefs::PWUseUppercase),\n\t\t\t    prefs->GetPref(PWSprefs::BoolPrefs::PWUseDigits),\n\t\t\t    prefs->GetPref(PWSprefs::BoolPrefs::PWUseSymbols),\n\t\t\t    prefs->GetPref(PWSprefs::BoolPrefs::PWUseHexDigits),\n\t\t\t    prefs->GetPref(PWSprefs::BoolPrefs::PWEasyVision));\n\n  return pwchars.MakePassword();\n}\n\n\n\n<commit_msg>add comment.<commit_after>\/\/\/ \\file DboxPassword.cpp\n\/\/-----------------------------------------------------------------------------\n\n#include \"PasswordSafe.h\"\n\n#include \"ThisMfcApp.h\"\n#include \"corelib\/Util.h\"\n#include \"corelib\/PWCharPool.h\"\n#include \"corelib\/PWSprefs.h\"\n\n#include \"DboxMain.h\"\n\n\n\/\/-----------------------------------------------------------------------------\n\n\/\/ Generate a new random password.\nCMyString\nDboxMain::GetPassword(void) const\n{\n  PWSprefs *prefs = PWSprefs::GetInstance();\n  CPasswordCharPool pwchars(prefs->GetPref(PWSprefs::IntPrefs::PWLenDefault),\n\t\t\t    prefs->GetPref(PWSprefs::BoolPrefs::PWUseLowercase),\n\t\t\t    prefs->GetPref(PWSprefs::BoolPrefs::PWUseUppercase),\n\t\t\t    prefs->GetPref(PWSprefs::BoolPrefs::PWUseDigits),\n\t\t\t    prefs->GetPref(PWSprefs::BoolPrefs::PWUseSymbols),\n\t\t\t    prefs->GetPref(PWSprefs::BoolPrefs::PWUseHexDigits),\n\t\t\t    prefs->GetPref(PWSprefs::BoolPrefs::PWEasyVision));\n\n  return pwchars.MakePassword();\n}\n\n\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>[webgui] use loopback address by default<commit_after><|endoftext|>"}
{"text":"<commit_before>\/* \n * Copyright 2009 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 <votca\/tools\/spline.h>\n#include <votca\/tools\/cubicspline.h>\n#include <votca\/tools\/akimaspline.h>\n#include <votca\/tools\/linspline.h>\n#include <votca\/tools\/table.h>\n#include <votca\/tools\/tokenizer.h>\n#include <boost\/program_options.hpp>\n#include <iostream>\n#include \"version.h\"\n\nusing namespace std;\nnamespace po = boost::program_options;\nusing namespace votca::csg;\nusing namespace votca::tools;\n\nvoid help_text()\n{\n    votca::csg::HelpTextHeader(\"csg_resample\");\n    cout << \"Change grid + interval of any sort of table files.\\n\"\n            \"Mainly called internally by inverse script, can also be\\n\"\n            \"used to manually prepare input files for coarse-grained\\n\"\n            \"simulations.\\n\\n\";     \n}\n\nvoid check_option(po::options_description &desc, po::variables_map &vm, const string &option)\n{\n    if(!vm.count(option)) {\n        cout << \"csg_resample \\n\\n\";                \n        cout << desc << endl << \"parameter \" << option << \" is not specified\\n\";\n        exit(1);\n    }\n}\n\nint main(int argc, char** argv)\n{\n\n    string in_file, out_file, grid, fitgrid, comment, type, boundaries;\n    Spline *spline;\n    Table in, out, der;\n    \/\/ program options\n    po::options_description desc(\"Allowed options\");            \n    \n    desc.add_options()\n      (\"in\", po::value<string>(&in_file), \"table to read\")\n      (\"out\", po::value<string>(&out_file), \"table to write\")\n      (\"derivative\", po::value<string>(), \"table to write\")\n      (\"grid\", po::value<string>(&grid), \"new grid spacing (min:step:max). If 'grid' is specified only, interpolation is performed.\")\n      (\"type\", po::value<string>(&type)->default_value(\"akima\"), \"[cubic|akima|linear]. If option is not specified, the default type 'akima' is assumed.\")\n      (\"fitgrid\", po::value<string>(&fitgrid), \"specify fit grid (min:step:max). If 'grid' and 'fitgrid' are specified, a fit is performed.\")\n      (\"nocut\", \"Option for fitgrid: Normally, values out of fitgrid boundaries are cut off. If they shouldn't, choose --nocut.\")\n      (\"comment\", po::value<string>(&comment), \"store a comment in the output table\")\n      (\"boundaries\", po::value<string>(&boundaries), \"(natural|periodic|derivativezero) sets boundary conditions\")\n      (\"help\", \"options file for coarse graining\");\n    \n    po::variables_map vm;\n    try {\n        po::store(po::parse_command_line(argc, argv, desc), vm);    \n        po::notify(vm);\n    }\n    catch(po::error err) {\n        cout << \"error parsing command line: \" << err.what() << endl;\n        return -1;\n    }\n    \n    \/\/ does the user want help?\n    if (vm.count(\"help\")) {\n        help_text();\n        cout << desc << endl;\n        return 0;\n    }\n    \n    check_option(desc, vm, \"in\");\n    check_option(desc, vm, \"out\");\n\n    if(!(vm.count(\"grid\") || vm.count(\"fitgrid\"))) {\n            cout << \"Need grid for interpolation or fitgrid for fit.\\n\";\n            return 1;\n    }\n\n    if((!vm.count(\"grid\")) && vm.count(\"fitgrid\")) {\n            cout << \"Need a grid for fitting as well.\\n\";\n            return 1;\n    }\n\n    \n    double min, max, step;\n    {\n        Tokenizer tok(grid, \":\");\n        vector<string> toks;\n        tok.ToVector(toks);\n        if(toks.size()!=3) {\n            cout << \"wrong range format, use min:step:max\\n\";\n            return 1;        \n        }\n        min = boost::lexical_cast<double>(toks[0]);\n        step = boost::lexical_cast<double>(toks[1]);\n        max = boost::lexical_cast<double>(toks[2]);\n    }\n\n   \n    in.Load(in_file);\n\n    if (vm.count(\"type\")) {\n        if(type==\"cubic\") {\n            spline = new CubicSpline();\n        }\n        else if(type==\"akima\") {\n            spline = new AkimaSpline();\n        }\n        else if(type==\"linear\") {\n            spline = new LinSpline();\n        }\n        else {\n            throw std::runtime_error(\"unknown type\");\n        }\n    }\n    spline->setBC(Spline::splineNormal);\n    \n\n    if (vm.count(\"boundaries\")) {\n        if(boundaries==\"periodic\") {\n            spline->setBC(Spline::splinePeriodic);\n        }\n        if(boundaries==\"derivativezero\") {\n            spline->setBC(Spline::splineDerivativeZero);\n        }\n        \/\/default: normal\n    }\n\n\n    \/\/ in case fit is specified\n    if (vm.count(\"fitgrid\")) {\n        Tokenizer tok(fitgrid, \":\");\n        vector<string> toks;\n        tok.ToVector(toks);\n        if(toks.size()!=3) {\n            cout << \"wrong range format in fitgrid, use min:step:max\\n\";\n            return 1;        \n        }\n        double sp_min, sp_max, sp_step;\n        sp_min = boost::lexical_cast<double>(toks[0]);\n        sp_step = boost::lexical_cast<double>(toks[1]);\n        sp_max = boost::lexical_cast<double>(toks[2]);\n        cout << \"doing \" << type << \" fit \" << sp_min << \":\" << sp_step << \":\" << sp_max << endl;\n\n        \/\/ cut off any values out of fitgrid boundaries (exception: do nothing in case of --nocut)\n        ub::vector<double> x_copy;\n        ub::vector<double> y_copy;\n        if (!vm.count(\"nocut\")) {\n            \/\/ determine vector size\n            int minindex=-1, maxindex;\n            for (int i=0; i<in.x().size(); i++) {\n                if(in.x(i)<sp_min) {\n                    minindex = i;\n                }\n                if(in.x(i)<sp_max) {\n                    maxindex = i;\n                }\n            }\n            \/\/ copy data values in [sp_min,sp_max] into new vectors\n            minindex++;\n            x_copy = ub::zero_vector<double>(maxindex-minindex+1);\n            y_copy = ub::zero_vector<double>(maxindex-minindex+1);\n            for (int i=minindex; i<=maxindex; i++) {\n                x_copy(i-minindex) = in.x(i);\n                y_copy(i-minindex) = in.y(i);\n            }\n        }\n\n        \/\/ fitting\n        spline->GenerateGrid(sp_min, sp_max, sp_step);\n        if (vm.count(\"nocut\")) {\n            spline->Fit(in.x(), in.y());\n        } else {\n            spline->Fit(x_copy, y_copy);\n        }\n    } else {\n        \/\/ otherwise do interpolation (default = cubic)\n        spline->Interpolate(in.x(), in.y());\n    }\n\n    \n    out.GenerateGridSpacing(min, max, step);\n    spline->Calculate(out.x(), out.y());\n        \n    \n    \/\/store a comment line\n    if (vm.count(\"comment\")){\n        out.set_comment(comment);\n    }\n    out.y() = out.y();\n    out.flags() = ub::scalar_vector<double>(out.flags().size(), 'o');\n\n    int i=0;\n    for(i=0; out.x(i) < in.x(0) && i<out.size(); ++i);\n\n    int j=0;\n    for(;i < out.size(); ++i) {\n        for(; j < in.size(); ++j)\n            if(in.x(j) >= out.x(i)  || fabs(in.x(j)-out.x(i) ) < 1e-12) \/\/ fix for precison errors\n                break;        \n        if(in.size() == j) break;\n        out.flags(i) = in.flags(j);\n    }\n    \n    out.Save(out_file);\n    \n    if (vm.count(\"derivative\")) {\n        der.GenerateGridSpacing(min, max, step);\n        der.flags() = ub::scalar_vector<double>(der.flags().size(), 'o');\n\n        spline->CalculateDerivative(der.x(), der.y());\n\n        der.Save(vm[\"derivative\"].as<string>());\n    }\n\n    delete spline;\n    return 0;\n}\n\n<commit_msg>error handling in csg_resample<commit_after>\/* \n * Copyright 2009 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 <votca\/tools\/spline.h>\n#include <votca\/tools\/cubicspline.h>\n#include <votca\/tools\/akimaspline.h>\n#include <votca\/tools\/linspline.h>\n#include <votca\/tools\/table.h>\n#include <votca\/tools\/tokenizer.h>\n#include <boost\/program_options.hpp>\n#include <iostream>\n#include \"version.h\"\n\nusing namespace std;\nnamespace po = boost::program_options;\nusing namespace votca::csg;\nusing namespace votca::tools;\n\nvoid help_text()\n{\n    votca::csg::HelpTextHeader(\"csg_resample\");\n    cout << \"Change grid + interval of any sort of table files.\\n\"\n            \"Mainly called internally by inverse script, can also be\\n\"\n            \"used to manually prepare input files for coarse-grained\\n\"\n            \"simulations.\\n\\n\";     \n}\n\nvoid check_option(po::options_description &desc, po::variables_map &vm, const string &option)\n{\n    if(!vm.count(option)) {\n        cout << \"csg_resample \\n\\n\";                \n        cout << desc << endl << \"parameter \" << option << \" is not specified\\n\";\n        exit(1);\n    }\n}\n\nint main(int argc, char** argv)\n{\n\n    string in_file, out_file, grid, fitgrid, comment, type, boundaries;\n    Spline *spline;\n    Table in, out, der;\n    \/\/ program options\n    po::options_description desc(\"Allowed options\");            \n    \n    desc.add_options()\n      (\"in\", po::value<string>(&in_file), \"table to read\")\n      (\"out\", po::value<string>(&out_file), \"table to write\")\n      (\"derivative\", po::value<string>(), \"table to write\")\n      (\"grid\", po::value<string>(&grid), \"new grid spacing (min:step:max). If 'grid' is specified only, interpolation is performed.\")\n      (\"type\", po::value<string>(&type)->default_value(\"akima\"), \"[cubic|akima|linear]. If option is not specified, the default type 'akima' is assumed.\")\n      (\"fitgrid\", po::value<string>(&fitgrid), \"specify fit grid (min:step:max). If 'grid' and 'fitgrid' are specified, a fit is performed.\")\n      (\"nocut\", \"Option for fitgrid: Normally, values out of fitgrid boundaries are cut off. If they shouldn't, choose --nocut.\")\n      (\"comment\", po::value<string>(&comment), \"store a comment in the output table\")\n      (\"boundaries\", po::value<string>(&boundaries), \"(natural|periodic|derivativezero) sets boundary conditions\")\n      (\"help\", \"options file for coarse graining\");\n    \n    po::variables_map vm;\n    try {\n        po::store(po::parse_command_line(argc, argv, desc), vm);    \n        po::notify(vm);\n    }\n    catch(po::error err) {\n        cout << \"error parsing command line: \" << err.what() << endl;\n        return -1;\n    }\n    \n    \/\/ does the user want help?\n    if (vm.count(\"help\")) {\n        help_text();\n        cout << desc << endl;\n        return 0;\n    }\n    \n    check_option(desc, vm, \"in\");\n    check_option(desc, vm, \"out\");\n\n    if(!(vm.count(\"grid\") || vm.count(\"fitgrid\"))) {\n            cout << \"Need grid for interpolation or fitgrid for fit.\\n\";\n            return 1;\n    }\n\n    if((!vm.count(\"grid\")) && vm.count(\"fitgrid\")) {\n            cout << \"Need a grid for fitting as well.\\n\";\n            return 1;\n    }\n\n    \n    double min, max, step;\n    {\n        Tokenizer tok(grid, \":\");\n        vector<string> toks;\n        tok.ToVector(toks);\n        if(toks.size()!=3) {\n            cout << \"wrong range format, use min:step:max\\n\";\n            return 1;        \n        }\n        min = boost::lexical_cast<double>(toks[0]);\n        step = boost::lexical_cast<double>(toks[1]);\n        max = boost::lexical_cast<double>(toks[2]);\n    }\n\n   \n    in.Load(in_file);\n\n    if (vm.count(\"type\")) {\n        if(type==\"cubic\") {\n            spline = new CubicSpline();\n        }\n        else if(type==\"akima\") {\n            spline = new AkimaSpline();\n        }\n        else if(type==\"linear\") {\n            spline = new LinSpline();\n        }\n        else {\n            throw std::runtime_error(\"unknown type\");\n        }\n    }\n    spline->setBC(Spline::splineNormal);\n    \n\n    if (vm.count(\"boundaries\")) {\n        if(boundaries==\"periodic\") {\n            spline->setBC(Spline::splinePeriodic);\n        }\n        if(boundaries==\"derivativezero\") {\n            spline->setBC(Spline::splineDerivativeZero);\n        }\n        \/\/default: normal\n    }\n\n\n    \/\/ in case fit is specified\n    if (vm.count(\"fitgrid\")) {\n        Tokenizer tok(fitgrid, \":\");\n        vector<string> toks;\n        tok.ToVector(toks);\n        if(toks.size()!=3) {\n            cout << \"wrong range format in fitgrid, use min:step:max\\n\";\n            return 1;        \n        }\n        double sp_min, sp_max, sp_step;\n        sp_min = boost::lexical_cast<double>(toks[0]);\n        sp_step = boost::lexical_cast<double>(toks[1]);\n        sp_max = boost::lexical_cast<double>(toks[2]);\n        cout << \"doing \" << type << \" fit \" << sp_min << \":\" << sp_step << \":\" << sp_max << endl;\n\n        \/\/ cut off any values out of fitgrid boundaries (exception: do nothing in case of --nocut)\n        ub::vector<double> x_copy;\n        ub::vector<double> y_copy;\n        if (!vm.count(\"nocut\")) {\n            \/\/ determine vector size\n            int minindex=-1, maxindex;\n            for (int i=0; i<in.x().size(); i++) {\n                if(in.x(i)<sp_min) {\n                    minindex = i;\n                }\n                if(in.x(i)<sp_max) {\n                    maxindex = i;\n                }\n            }\n            \/\/ copy data values in [sp_min,sp_max] into new vectors\n            minindex++;\n            x_copy = ub::zero_vector<double>(maxindex-minindex+1);\n            y_copy = ub::zero_vector<double>(maxindex-minindex+1);\n            for (int i=minindex; i<=maxindex; i++) {\n                x_copy(i-minindex) = in.x(i);\n                y_copy(i-minindex) = in.y(i);\n            }\n        }\n\n        \/\/ fitting\n        spline->GenerateGrid(sp_min, sp_max, sp_step);\n        try {\n            if (vm.count(\"nocut\")) {\n                spline->Fit(in.x(), in.y());\n            } else {\n                spline->Fit(x_copy, y_copy);\n            }   \n        } catch (const char* message) {\n            if(message=\"qrsolve_zero_column_in_matrix\") {\n                throw std::runtime_error(\"error in Linalg::linalg_qrsolve : Not enough data for fit, please adjust grid (zero row in fit matrix)\");\n            }    \n            else if(message=\"constrained_qrsolve_zero_column_in_matrix\") {\n                throw std::runtime_error(\"error in Linalg::linalg_constrained_qrsolve : Not enough data for fit, please adjust grid (zero row in fit matrix)\");\n            }\n            else throw std::runtime_error(\"Unknown error in csg_resample while fitting.\");\n        }\n    } else {\n        \/\/ otherwise do interpolation (default = cubic)\n        try {\n            spline->Interpolate(in.x(), in.y());\n        } catch (const char* message) {\n            if(message=\"qrsolve_zero_column_in_matrix\") {\n                throw std::runtime_error(\"error in Linalg::linalg_qrsolve : Not enough data, please adjust grid (zero row in fit matrix)\");\n            }\n            else if(message=\"constrained_qrsolve_zero_column_in_matrix\") {\n                throw std::runtime_error(\"error in Linalg::linalg_constrained_qrsolve : Not enough data, please adjust grid (zero row in fit matrix)\");\n            }\n            else throw std::runtime_error(\"Unknown error in csg_resample while interpolating.\");\n        }\n    }\n\n    \n    out.GenerateGridSpacing(min, max, step);\n    spline->Calculate(out.x(), out.y());\n        \n    \n    \/\/store a comment line\n    if (vm.count(\"comment\")){\n        out.set_comment(comment);\n    }\n    out.y() = out.y();\n    out.flags() = ub::scalar_vector<double>(out.flags().size(), 'o');\n\n    int i=0;\n    for(i=0; out.x(i) < in.x(0) && i<out.size(); ++i);\n\n    int j=0;\n    for(;i < out.size(); ++i) {\n        for(; j < in.size(); ++j)\n            if(in.x(j) >= out.x(i)  || fabs(in.x(j)-out.x(i) ) < 1e-12) \/\/ fix for precison errors\n                break;        \n        if(in.size() == j) break;\n        out.flags(i) = in.flags(j);\n    }\n    \n    out.Save(out_file);\n    \n    if (vm.count(\"derivative\")) {\n        der.GenerateGridSpacing(min, max, step);\n        der.flags() = ub::scalar_vector<double>(der.flags().size(), 'o');\n\n        spline->CalculateDerivative(der.x(), der.y());\n\n        der.Save(vm[\"derivative\"].as<string>());\n    }\n\n    delete spline;\n    return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/* \n * Copyright 2009 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 <votca\/tools\/cubicspline.h>\n#include <votca\/tools\/table.h>\n#include <votca\/tools\/tokenizer.h>\n#include <boost\/program_options.hpp>\n#include <iostream>\n#include \"version.h\"\n\nusing namespace std;\nnamespace po = boost::program_options;\nusing namespace votca::csg;\nusing namespace votca::tools;\n\nvoid help_text()\n{\n    votca::csg::HelpTextHeader(\"csg_resample\");\n    cout << \"Change grid + interval of any sort of table files.\\n\"\n            \"Mainly called internally by inverse script, can also be\\n\"\n            \"used to manually prepare input files for coarse-grained\\n\"\n            \"simulations.\\n\\n\";     \n}\n\nvoid check_option(po::options_description &desc, po::variables_map &vm, const string &option)\n{\n    if(!vm.count(option)) {\n        cout << \"csg_resample \\n\\n\";                \n        cout << desc << endl << \"parameter \" << option << \" is not specified\\n\";\n        exit(1);\n    }\n}\n\nint main(int argc, char** argv)\n{\n    string in_file, out_file, grid, spfit, comment, boundaries;\n    CubicSpline spline;\n    Table in, out, der;\n\n    \/\/ program options\n    po::options_description desc(\"Allowed options\");            \n    \n    desc.add_options()\n      (\"in\", po::value<string>(&in_file), \"table to read\")\n      (\"out\", po::value<string>(&out_file), \"table to write\")\n      (\"derivative\", po::value<string>(), \"table to write\")\n      (\"grid\", po::value<string>(&grid), \"new grid spacing (min:step:max)\")\n      (\"spfit\", po::value<string>(&spfit), \"specify spline fit grid. if option is not specified, normal spline interpolation is performed\")\n      \/\/(\"bc\", po::)\n      (\"comment\", po::value<string>(&comment), \"store a comment in the output table\")\n      (\"boundaries\", po::value<string>(&boundaries), \"(natural|periodic|derivativezero) sets boundary conditions\")\n      (\"help\", \"options file for coarse graining\");\n    \n    po::variables_map vm;\n    try {\n        po::store(po::parse_command_line(argc, argv, desc), vm);    \n        po::notify(vm);\n    }\n    catch(po::error err) {\n        cout << \"error parsing command line: \" << err.what() << endl;\n        return -1;\n    }\n    \n    \/\/ does the user want help?\n    if (vm.count(\"help\")) {\n        help_text();\n        cout << desc << endl;\n        return 0;\n    }\n    \n    check_option(desc, vm, \"in\");\n    check_option(desc, vm, \"out\");\n    check_option(desc, vm, \"grid\");\n    \n    double min, max, step;\n    {\n        Tokenizer tok(grid, \":\");\n        vector<string> toks;\n        tok.ToVector(toks);\n        if(toks.size()!=3) {\n            cout << \"wrong range format, use min:step:max\\n\";\n            return 1;        \n        }\n        min = boost::lexical_cast<double>(toks[0]);\n        step = boost::lexical_cast<double>(toks[1]);\n        max = boost::lexical_cast<double>(toks[2]);\n    }\n        \n    \n    in.Load(in_file);\n    \n    if (vm.count(\"boundaries\")){\n        if (boundaries==\"periodic\"){\n            spline.setBC(CubicSpline::splinePeriodic);\n        }\n        else if (boundaries==\"derivativezero\"){\n            spline.setBC(CubicSpline::splineDerivativeZero);\n        }\n        \/\/default: normal\n    }    \n    if (vm.count(\"spfit\")) {\n        Tokenizer tok(spfit, \":\");\n        vector<string> toks;\n        tok.ToVector(toks);\n        if(toks.size()!=3) {\n            cout << \"wrong range format in spfit, use min:step:max\\n\";\n            return 1;        \n        }\n        double sp_min, sp_max, sp_step;\n        sp_min = boost::lexical_cast<double>(toks[0]);\n        sp_step = boost::lexical_cast<double>(toks[1]);\n        sp_max = boost::lexical_cast<double>(toks[2]);\n        cout << \"doing spline fit \" << sp_min << \":\" << sp_step << \":\" << sp_max << endl;\n        spline.GenerateGrid(sp_min, sp_max, sp_step);\n\n        spline.Fit(in.x(), in.y());\n    } else {\n        spline.Interpolate(in.x(), in.y());\n    }\n    \n    out.GenerateGridSpacing(min, max, step);\n    spline.Calculate(out.x(), out.y());\n    \n    \/\/store a comment line\n    if (vm.count(\"comment\")){\n        out.set_comment(comment);\n    }\n    out.y() = out.y();\n    out.flags() = ub::scalar_vector<double>(out.flags().size(), 'o');\n\n    int i=0;\n    for(i=0; out.x(i) < in.x(0) && i<out.size(); ++i);\n\n    int j=0;\n    for(;i < out.size(); ++i) {\n        for(; j < in.size(); ++j)\n            if(in.x(j) >= out.x(i))\n                break;        \n        if(in.size() == j) break;\n        out.flags(i) = in.flags(j);\n    }\n    \n    out.Save(out_file);\n    \n    if (vm.count(\"derivative\")) {\n        der.GenerateGridSpacing(min, max, step);\n        der.flags() = ub::scalar_vector<double>(der.flags().size(), 'o');\n        spline.CalculateDerivative(der.x(), der.y());\n        der.Save(vm[\"derivative\"].as<string>());\n    }\n    return 0;\n}\n\n<commit_msg>added akima support to csg_resample<commit_after>\/* \n * Copyright 2009 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 <votca\/tools\/cubicspline.h>\n#include <votca\/tools\/akimaspline.h>\n#include <votca\/tools\/linspline.h>\n#include <votca\/tools\/table.h>\n#include <votca\/tools\/tokenizer.h>\n#include <boost\/program_options.hpp>\n#include <iostream>\n#include \"version.h\"\n\nusing namespace std;\nnamespace po = boost::program_options;\nusing namespace votca::csg;\nusing namespace votca::tools;\n\nvoid help_text()\n{\n    votca::csg::HelpTextHeader(\"csg_resample\");\n    cout << \"Change grid + interval of any sort of table files.\\n\"\n            \"Mainly called internally by inverse script, can also be\\n\"\n            \"used to manually prepare input files for coarse-grained\\n\"\n            \"simulations.\\n\\n\";     \n}\n\nvoid check_option(po::options_description &desc, po::variables_map &vm, const string &option)\n{\n    if(!vm.count(option)) {\n        cout << \"csg_resample \\n\\n\";                \n        cout << desc << endl << \"parameter \" << option << \" is not specified\\n\";\n        exit(1);\n    }\n}\n\nint main(int argc, char** argv)\n{\n\n    string in_file, out_file, grid, fitgrid, comment, type, boundaries;\n    CubicSpline spline;\n    AkimaSpline akspline;\n    LinSpline linspline;\n    Table in, out, der;\n\n    \/\/ program options\n    po::options_description desc(\"Allowed options\");            \n    \n    desc.add_options()\n      (\"in\", po::value<string>(&in_file), \"table to read\")\n      (\"out\", po::value<string>(&out_file), \"table to write\")\n      (\"derivative\", po::value<string>(), \"table to write\")\n      (\"grid\", po::value<string>(&grid), \"new grid spacing (min:step:max). If 'grid' is specified only, interpolation is performed.\")\n      (\"type\", po::value<string>(&type)->default_value(\"akima\"), \"[cubic|akima|linear]. If option is not specified, the default type 'akima' is assumed.\")\n      (\"fitgrid\", po::value<string>(&fitgrid), \"specify fit grid (min:step:max). If 'grid' and 'fitgrid' are specified, a fit is performed.\")\n      (\"comment\", po::value<string>(&comment), \"store a comment in the output table\")\n      (\"boundaries\", po::value<string>(&boundaries), \"(natural|periodic|derivativezero) sets boundary conditions\")\n      (\"help\", \"options file for coarse graining\");\n    \n    po::variables_map vm;\n    try {\n        po::store(po::parse_command_line(argc, argv, desc), vm);    \n        po::notify(vm);\n    }\n    catch(po::error err) {\n        cout << \"error parsing command line: \" << err.what() << endl;\n        return -1;\n    }\n    \n    \/\/ does the user want help?\n    if (vm.count(\"help\")) {\n        help_text();\n        cout << desc << endl;\n        return 0;\n    }\n    \n    check_option(desc, vm, \"in\");\n    check_option(desc, vm, \"out\");\n\n    if(!(vm.count(\"grid\") || vm.count(\"fitgrid\"))) {\n            cout << \"Need grid for interpolation or fitgrid for fit.\\n\";\n            return 1;\n    }\n\n    if((!vm.count(\"grid\")) && vm.count(\"fitgrid\")) {\n            cout << \"Need a grid for fitting as well.\\n\";\n            return 1;\n    }\n\n    \n    double min, max, step;\n    {\n        Tokenizer tok(grid, \":\");\n        vector<string> toks;\n        tok.ToVector(toks);\n        if(toks.size()!=3) {\n            cout << \"wrong range format, use min:step:max\\n\";\n            return 1;        \n        }\n        min = boost::lexical_cast<double>(toks[0]);\n        step = boost::lexical_cast<double>(toks[1]);\n        max = boost::lexical_cast<double>(toks[2]);\n    }\n\n   \n    in.Load(in_file);\n\n    if (vm.count(\"type\")) {\n        if(type==\"cubic\") {\n            spline.setBC(CubicSpline::splineNormal);\n        }\n        if(type==\"akima\") {\n            akspline.setBC(AkimaSpline::splineNormal);\n        }\n        if(type==\"linear\") {\n            linspline.setBC(LinSpline::splineNormal);\n        }\n    }\n    \n\n    if (vm.count(\"boundaries\")) {\n        if(boundaries==\"periodic\") {\n            spline.setBC(CubicSpline::splinePeriodic);\n            akspline.setBC(AkimaSpline::splinePeriodic);\n            linspline.setBC(LinSpline::splinePeriodic);\n        }\n        if(boundaries==\"derivativezero\") {\n            spline.setBC(CubicSpline::splineDerivativeZero);\n        }\n        \/\/default: normal\n    }    \n\n\n    \/\/ in case fit is specified\n    if (vm.count(\"fitgrid\")) {\n        Tokenizer tok(fitgrid, \":\");\n        vector<string> toks;\n        tok.ToVector(toks);\n        if(toks.size()!=3) {\n            cout << \"wrong range format in fitgrid, use min:step:max\\n\";\n            return 1;        \n        }\n        double sp_min, sp_max, sp_step;\n        sp_min = boost::lexical_cast<double>(toks[0]);\n        sp_step = boost::lexical_cast<double>(toks[1]);\n        sp_max = boost::lexical_cast<double>(toks[2]);\n        cout << \"doing \" << type << \" fit \" << sp_min << \":\" << sp_step << \":\" << sp_max << endl;\n\n        if(type==\"cubic\") {\n            spline.GenerateGrid(sp_min, sp_max, sp_step);\n            spline.Fit(in.x(), in.y());\n        }\n        if(type==\"akima\") {\n            akspline.GenerateGrid(sp_min, sp_max, sp_step);\n            akspline.Fit(in.x(), in.y());\n        }\n        if(type==\"linear\") {\n            linspline.GenerateGrid(sp_min, sp_max, sp_step);\n            linspline.Fit(in.x(), in.y());\n        }\n    } else {\n        \/\/ else: do interpolation (default = cubic)\n        if(type==\"cubic\") {\n            spline.Interpolate(in.x(), in.y());\n        }\n        if(type==\"akima\") {\n            akspline.Interpolate(in.x(), in.y());\n        }\n        if(type==\"linear\") {\n            linspline.Interpolate(in.x(), in.y());\n        }\n    }\n\n    \n    out.GenerateGridSpacing(min, max, step);\n\n    if(type==\"cubic\") {\n        spline.Calculate(out.x(), out.y());\n    }\n    if(type==\"akima\") {\n        akspline.Calculate(out.x(), out.y());\n    }\n    if(type==\"linear\") {\n        linspline.Calculate(out.x(), out.y());\n    }\n    \n    \n    \/\/store a comment line\n    if (vm.count(\"comment\")){\n        out.set_comment(comment);\n    }\n    out.y() = out.y();\n    out.flags() = ub::scalar_vector<double>(out.flags().size(), 'o');\n\n    int i=0;\n    for(i=0; out.x(i) < in.x(0) && i<out.size(); ++i);\n\n    int j=0;\n    for(;i < out.size(); ++i) {\n        for(; j < in.size(); ++j)\n            if(in.x(j) >= out.x(i))\n                break;        \n        if(in.size() == j) break;\n        out.flags(i) = in.flags(j);\n    }\n    \n    out.Save(out_file);\n    \n    if (vm.count(\"derivative\")) {\n        der.GenerateGridSpacing(min, max, step);\n        der.flags() = ub::scalar_vector<double>(der.flags().size(), 'o');\n\n        if (type == \"cubic\") {\n            spline.CalculateDerivative(der.x(), der.y());\n        }\n        if (type == \"akima\") {\n            akspline.CalculateDerivative(der.x(), der.y());\n        }\n        if (type == \"linear\") {\n            linspline.CalculateDerivative(der.x(), der.y());\n        }\n        der.Save(vm[\"derivative\"].as<string>());\n    }\n    return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*ckwg +5\n * Copyright 2012-2013 by Kitware, Inc. All Rights Reserved. Please refer to\n * KITWARE_LICENSE.TXT for licensing information, or contact General Counsel,\n * Kitware, Inc., 28 Corporate Drive, Clifton Park, NY 12065.\n *\/\n\n#include \"helpers\/pipeline_builder.h\"\n#include \"helpers\/tool_main.h\"\n#include \"helpers\/tool_usage.h\"\n\n#include <vistk\/pipeline_util\/pipe_declaration_types.h>\n\n#include <vistk\/pipeline\/config.h>\n#include <vistk\/pipeline\/modules.h>\n#include <vistk\/pipeline\/pipeline.h>\n#include <vistk\/pipeline\/pipeline_exception.h>\n#include <vistk\/pipeline\/process.h>\n#include <vistk\/pipeline\/process_cluster.h>\n#include <vistk\/pipeline\/types.h>\n\n#include <vistk\/utilities\/path.h>\n\n#include <boost\/algorithm\/string\/join.hpp>\n#include <boost\/algorithm\/string\/predicate.hpp>\n#include <boost\/algorithm\/string\/replace.hpp>\n#include <boost\/filesystem\/fstream.hpp>\n#include <boost\/foreach.hpp>\n#include <boost\/variant.hpp>\n\n#include <iostream>\n#include <set>\n#include <stdexcept>\n\n#include <cstdlib>\n\nclass config_printer\n  : public boost::static_visitor<>\n{\n  public:\n    config_printer(std::ostream& ostr, vistk::pipeline_t const& pipe, vistk::config_t const& conf);\n    ~config_printer();\n\n    void operator () (vistk::config_pipe_block const& config_block);\n    void operator () (vistk::process_pipe_block const& process_block);\n    void operator () (vistk::connect_pipe_block const& connect_block) const;\n\n    void output_process_defaults();\n  private:\n    void print_config_value(vistk::config_value_t const& config_value) const;\n    void output_process_by_name(vistk::process::name_t const& name, bool fatal_if_no_process);\n    void output_process(vistk::process_t const& proc);\n\n    typedef std::set<vistk::process::name_t> process_set_t;\n\n    std::ostream& m_ostr;\n    vistk::pipeline_t const m_pipe;\n    vistk::config_t const m_config;\n    process_set_t m_visited;\n};\n\nint\ntool_main(int argc, char* argv[])\n{\n  vistk::load_known_modules();\n\n  boost::program_options::options_description desc;\n  desc\n    .add(tool_common_options())\n    .add(pipeline_common_options())\n    .add(pipeline_input_options())\n    .add(pipeline_output_options());\n\n  boost::program_options::variables_map const vm = tool_parse(argc, argv, desc);\n\n  pipeline_builder const builder(vm, desc);\n\n  vistk::pipeline_t const pipe = builder.pipeline();\n  vistk::config_t const config = builder.config();\n  vistk::pipe_blocks const blocks = builder.blocks();\n\n  if (!pipe)\n  {\n    std::cerr << \"Error: Unable to bake pipeline\" << std::endl;\n\n    return EXIT_FAILURE;\n  }\n\n  std::ostream* postr;\n  boost::filesystem::ofstream fout;\n\n  vistk::path_t const opath = vm[\"output\"].as<vistk::path_t>();\n\n  if (opath == vistk::path_t(\"-\"))\n  {\n    postr = &std::cout;\n  }\n  else\n  {\n    fout.open(opath);\n\n    if (fout.bad())\n    {\n      std::cerr << \"Error: Unable to open output file\" << std::endl;\n\n      return EXIT_FAILURE;\n    }\n\n    postr = &fout;\n  }\n\n  std::ostream& ostr = *postr;\n\n  config_printer printer(ostr, pipe, config);\n\n  std::for_each(blocks.begin(), blocks.end(), boost::apply_visitor(printer));\n\n  printer.output_process_defaults();\n\n  return EXIT_SUCCESS;\n}\n\nconfig_printer\n::config_printer(std::ostream& ostr, vistk::pipeline_t const& pipe, vistk::config_t const& conf)\n  : m_ostr(ostr)\n  , m_pipe(pipe)\n  , m_config(conf)\n{\n}\n\nconfig_printer\n::~config_printer()\n{\n}\n\nclass key_printer\n{\n  public:\n    key_printer(std::ostream& ostr);\n    ~key_printer();\n\n    void operator () (vistk::config_value_t const& config_value) const;\n  private:\n    std::ostream& m_ostr;\n};\n\nvoid\nconfig_printer\n::operator () (vistk::config_pipe_block const& config_block)\n{\n  vistk::config::keys_t const& keys = config_block.key;\n  vistk::config_values_t const& values = config_block.values;\n\n  vistk::config::key_t const key_path = boost::join(keys, vistk::config::block_sep);\n\n  m_ostr << \"config \" << key_path << std::endl;\n\n  key_printer const printer(m_ostr);\n\n  std::for_each(values.begin(), values.end(), printer);\n\n  output_process_by_name(key_path, false);\n}\n\nvoid\nconfig_printer\n::operator () (vistk::process_pipe_block const& process_block)\n{\n  vistk::process::name_t const& name = process_block.name;\n  vistk::process::type_t const& type = process_block.type;\n  vistk::config_values_t const& values = process_block.config_values;\n\n  m_ostr << \"process \" << name << std::endl;\n  m_ostr << \"  :: \" << type << std::endl;\n\n  key_printer const printer(m_ostr);\n\n  std::for_each(values.begin(), values.end(), printer);\n\n  output_process_by_name(name, true);\n}\n\nvoid\nconfig_printer\n::operator () (vistk::connect_pipe_block const& connect_block) const\n{\n  vistk::process::port_addr_t const& upstream_addr = connect_block.from;\n  vistk::process::port_addr_t const& downstream_addr = connect_block.to;\n\n  vistk::process::name_t const& upstream_name = upstream_addr.first;\n  vistk::process::port_t const& upstream_port = upstream_addr.second;\n  vistk::process::name_t const& downstream_name = downstream_addr.first;\n  vistk::process::port_t const& downstream_port = downstream_addr.second;\n\n  m_ostr << \"connect from \" << upstream_name << \".\" << upstream_port << std::endl;\n  m_ostr << \"        to   \" << downstream_name << \".\" << downstream_port << std::endl;\n\n  m_ostr << std::endl;\n}\n\nvoid\nconfig_printer\n::output_process_defaults()\n{\n  vistk::process::names_t const cluster_names = m_pipe->cluster_names();\n\n  BOOST_FOREACH (vistk::process::name_t const& name, cluster_names)\n  {\n    if (m_visited.count(name))\n    {\n      continue;\n    }\n\n    vistk::process_cluster_t const cluster = m_pipe->cluster_by_name(name);\n    vistk::process_t const proc = boost::static_pointer_cast<vistk::process>(cluster);\n\n    vistk::process::type_t const& type = proc->type();\n\n    m_ostr << \"# Defaults for \\'\" << name << \"\\' cluster:\" << std::endl;\n    m_ostr << \"config \" << name << std::endl;\n    m_ostr << \"#  :: \" << type << std::endl;\n\n    output_process(proc);\n  }\n\n  vistk::process::names_t const process_names = m_pipe->process_names();\n\n  BOOST_FOREACH (vistk::process::name_t const& name, process_names)\n  {\n    if (m_visited.count(name))\n    {\n      continue;\n    }\n\n    vistk::process_t const proc = m_pipe->process_by_name(name);\n\n    vistk::process::type_t const& type = proc->type();\n\n    m_ostr << \"# Defaults for \\'\" << name << \"\\' process:\" << std::endl;\n    m_ostr << \"config \" << name << std::endl;\n    m_ostr << \"#  :: \" << type << std::endl;\n\n    output_process(proc);\n  }\n}\n\nvoid\nconfig_printer\n::output_process_by_name(vistk::process::name_t const& name, bool fatal_if_no_process)\n{\n  vistk::process_t proc;\n\n  if (!m_visited.count(name))\n  {\n    try\n    {\n      proc = m_pipe->process_by_name(name);\n    }\n    catch (vistk::no_such_process_exception const& \/*e*\/)\n    {\n      try\n      {\n        vistk::process_cluster_t const cluster = m_pipe->cluster_by_name(name);\n\n        proc = boost::static_pointer_cast<vistk::process>(cluster);\n      }\n      catch (vistk::no_such_process_exception const& \/*e*\/)\n      {\n        if (fatal_if_no_process)\n        {\n          std::string const reason = \"A process block did not result in a process being \"\n                                     \"added to the pipeline: \" + name;\n\n          throw std::logic_error(reason);\n        }\n      }\n    }\n  }\n\n  if (proc)\n  {\n    output_process(proc);\n  }\n  else\n  {\n    m_ostr << std::endl;\n  }\n}\n\nvoid\nconfig_printer\n::output_process(vistk::process_t const& proc)\n{\n  vistk::process::name_t const name = proc->name();\n  vistk::config::keys_t const keys = proc->available_config();\n\n  BOOST_FOREACH (vistk::config::key_t const& key, keys)\n  {\n    if (boost::starts_with(key, \"_\"))\n    {\n      continue;\n    }\n\n    m_ostr << std::endl;\n\n    vistk::process::conf_info_t const& info = proc->config_info(key);\n\n    vistk::config::description_t const desc = boost::replace_all_copy(info->description, \"\\n\", \"\\n  #   \");\n\n    m_ostr << \"  # Key: \" << key << std::endl;\n\n    m_ostr << \"  # Description: \" << desc << std::endl;\n\n    vistk::config::value_t const& def = info->def;\n\n    if (def.empty())\n    {\n      m_ostr << \"  # No default value\" << std::endl;\n    }\n    else\n    {\n      m_ostr << \"  # Default value: \" << def << std::endl;\n    }\n\n    vistk::config::key_t const resolved_key = name + vistk::config::block_sep + key;\n\n    if (m_config->has_value(resolved_key))\n    {\n      vistk::config::value_t const cur_value = m_config->get_value<vistk::config::value_t>(resolved_key);\n\n      m_ostr << \"  # Current value: \" << cur_value << std::endl;\n    }\n    else\n    {\n      m_ostr << \"  # No current value\" << std::endl;\n    }\n  }\n\n  m_ostr << std::endl;\n\n  m_visited.insert(name);\n}\n\nkey_printer\n::key_printer(std::ostream& ostr)\n  : m_ostr(ostr)\n{\n}\n\nkey_printer\n::~key_printer()\n{\n}\n\nvoid\nkey_printer\n::operator () (vistk::config_value_t const& config_value) const\n{\n  vistk::config_key_t const& key = config_value.key;\n  vistk::config::value_t const& value = config_value.value;\n\n  vistk::config::keys_t const& keys = key.key_path;\n  vistk::config_key_options_t const& options = key.options;\n\n  vistk::config::key_t const key_path = boost::join(keys, vistk::config::block_sep);\n\n  boost::optional<vistk::config_flags_t> const& flags = options.flags;\n  boost::optional<vistk::config_provider_t> const& provider = options.provider;\n\n  m_ostr << \"  \" << vistk::config::block_sep << key_path;\n\n  if (flags)\n  {\n    vistk::config_flag_t const flag_list = boost::join(*flags, \",\");\n\n    m_ostr << \"[\" << flag_list << \"]\";\n  }\n\n  if (provider)\n  {\n    m_ostr << \"{\" << *provider << \"}\";\n  }\n\n  m_ostr << \" \" << value << std::endl;\n}\n<commit_msg>Refactor printing a process block from nothing<commit_after>\/*ckwg +5\n * Copyright 2012-2013 by Kitware, Inc. All Rights Reserved. Please refer to\n * KITWARE_LICENSE.TXT for licensing information, or contact General Counsel,\n * Kitware, Inc., 28 Corporate Drive, Clifton Park, NY 12065.\n *\/\n\n#include \"helpers\/pipeline_builder.h\"\n#include \"helpers\/tool_main.h\"\n#include \"helpers\/tool_usage.h\"\n\n#include <vistk\/pipeline_util\/pipe_declaration_types.h>\n\n#include <vistk\/pipeline\/config.h>\n#include <vistk\/pipeline\/modules.h>\n#include <vistk\/pipeline\/pipeline.h>\n#include <vistk\/pipeline\/pipeline_exception.h>\n#include <vistk\/pipeline\/process.h>\n#include <vistk\/pipeline\/process_cluster.h>\n#include <vistk\/pipeline\/types.h>\n\n#include <vistk\/utilities\/path.h>\n\n#include <boost\/algorithm\/string\/join.hpp>\n#include <boost\/algorithm\/string\/predicate.hpp>\n#include <boost\/algorithm\/string\/replace.hpp>\n#include <boost\/filesystem\/fstream.hpp>\n#include <boost\/foreach.hpp>\n#include <boost\/variant.hpp>\n\n#include <iostream>\n#include <set>\n#include <stdexcept>\n#include <string>\n\n#include <cstdlib>\n\nclass config_printer\n  : public boost::static_visitor<>\n{\n  public:\n    config_printer(std::ostream& ostr, vistk::pipeline_t const& pipe, vistk::config_t const& conf);\n    ~config_printer();\n\n    void operator () (vistk::config_pipe_block const& config_block);\n    void operator () (vistk::process_pipe_block const& process_block);\n    void operator () (vistk::connect_pipe_block const& connect_block) const;\n\n    void output_process_defaults();\n  private:\n    void print_config_value(vistk::config_value_t const& config_value) const;\n    void output_process_by_name(vistk::process::name_t const& name, bool fatal_if_no_process);\n    void output_process_block(vistk::process_t const& name, std::string const& kind);\n    void output_process(vistk::process_t const& proc);\n\n    typedef std::set<vistk::process::name_t> process_set_t;\n\n    std::ostream& m_ostr;\n    vistk::pipeline_t const m_pipe;\n    vistk::config_t const m_config;\n    process_set_t m_visited;\n};\n\nint\ntool_main(int argc, char* argv[])\n{\n  vistk::load_known_modules();\n\n  boost::program_options::options_description desc;\n  desc\n    .add(tool_common_options())\n    .add(pipeline_common_options())\n    .add(pipeline_input_options())\n    .add(pipeline_output_options());\n\n  boost::program_options::variables_map const vm = tool_parse(argc, argv, desc);\n\n  pipeline_builder const builder(vm, desc);\n\n  vistk::pipeline_t const pipe = builder.pipeline();\n  vistk::config_t const config = builder.config();\n  vistk::pipe_blocks const blocks = builder.blocks();\n\n  if (!pipe)\n  {\n    std::cerr << \"Error: Unable to bake pipeline\" << std::endl;\n\n    return EXIT_FAILURE;\n  }\n\n  std::ostream* postr;\n  boost::filesystem::ofstream fout;\n\n  vistk::path_t const opath = vm[\"output\"].as<vistk::path_t>();\n\n  if (opath == vistk::path_t(\"-\"))\n  {\n    postr = &std::cout;\n  }\n  else\n  {\n    fout.open(opath);\n\n    if (fout.bad())\n    {\n      std::cerr << \"Error: Unable to open output file\" << std::endl;\n\n      return EXIT_FAILURE;\n    }\n\n    postr = &fout;\n  }\n\n  std::ostream& ostr = *postr;\n\n  config_printer printer(ostr, pipe, config);\n\n  std::for_each(blocks.begin(), blocks.end(), boost::apply_visitor(printer));\n\n  printer.output_process_defaults();\n\n  return EXIT_SUCCESS;\n}\n\nconfig_printer\n::config_printer(std::ostream& ostr, vistk::pipeline_t const& pipe, vistk::config_t const& conf)\n  : m_ostr(ostr)\n  , m_pipe(pipe)\n  , m_config(conf)\n{\n}\n\nconfig_printer\n::~config_printer()\n{\n}\n\nclass key_printer\n{\n  public:\n    key_printer(std::ostream& ostr);\n    ~key_printer();\n\n    void operator () (vistk::config_value_t const& config_value) const;\n  private:\n    std::ostream& m_ostr;\n};\n\nvoid\nconfig_printer\n::operator () (vistk::config_pipe_block const& config_block)\n{\n  vistk::config::keys_t const& keys = config_block.key;\n  vistk::config_values_t const& values = config_block.values;\n\n  vistk::config::key_t const key_path = boost::join(keys, vistk::config::block_sep);\n\n  m_ostr << \"config \" << key_path << std::endl;\n\n  key_printer const printer(m_ostr);\n\n  std::for_each(values.begin(), values.end(), printer);\n\n  output_process_by_name(key_path, false);\n}\n\nvoid\nconfig_printer\n::operator () (vistk::process_pipe_block const& process_block)\n{\n  vistk::process::name_t const& name = process_block.name;\n  vistk::process::type_t const& type = process_block.type;\n  vistk::config_values_t const& values = process_block.config_values;\n\n  m_ostr << \"process \" << name << std::endl;\n  m_ostr << \"  :: \" << type << std::endl;\n\n  key_printer const printer(m_ostr);\n\n  std::for_each(values.begin(), values.end(), printer);\n\n  output_process_by_name(name, true);\n}\n\nvoid\nconfig_printer\n::operator () (vistk::connect_pipe_block const& connect_block) const\n{\n  vistk::process::port_addr_t const& upstream_addr = connect_block.from;\n  vistk::process::port_addr_t const& downstream_addr = connect_block.to;\n\n  vistk::process::name_t const& upstream_name = upstream_addr.first;\n  vistk::process::port_t const& upstream_port = upstream_addr.second;\n  vistk::process::name_t const& downstream_name = downstream_addr.first;\n  vistk::process::port_t const& downstream_port = downstream_addr.second;\n\n  m_ostr << \"connect from \" << upstream_name << \".\" << upstream_port << std::endl;\n  m_ostr << \"        to   \" << downstream_name << \".\" << downstream_port << std::endl;\n\n  m_ostr << std::endl;\n}\n\nvoid\nconfig_printer\n::output_process_defaults()\n{\n  vistk::process::names_t const cluster_names = m_pipe->cluster_names();\n\n  BOOST_FOREACH (vistk::process::name_t const& name, cluster_names)\n  {\n    if (m_visited.count(name))\n    {\n      continue;\n    }\n\n    vistk::process_cluster_t const cluster = m_pipe->cluster_by_name(name);\n    vistk::process_t const proc = boost::static_pointer_cast<vistk::process>(cluster);\n\n    static std::string const kind = \"cluster\";\n\n    output_process_block(proc, kind);\n  }\n\n  vistk::process::names_t const process_names = m_pipe->process_names();\n\n  BOOST_FOREACH (vistk::process::name_t const& name, process_names)\n  {\n    if (m_visited.count(name))\n    {\n      continue;\n    }\n\n    vistk::process_t const proc = m_pipe->process_by_name(name);\n\n    static std::string const kind = \"process\";\n\n    output_process_block(proc, kind);\n  }\n}\n\nvoid\nconfig_printer\n::output_process_by_name(vistk::process::name_t const& name, bool fatal_if_no_process)\n{\n  vistk::process_t proc;\n\n  if (!m_visited.count(name))\n  {\n    try\n    {\n      proc = m_pipe->process_by_name(name);\n    }\n    catch (vistk::no_such_process_exception const& \/*e*\/)\n    {\n      try\n      {\n        vistk::process_cluster_t const cluster = m_pipe->cluster_by_name(name);\n\n        proc = boost::static_pointer_cast<vistk::process>(cluster);\n      }\n      catch (vistk::no_such_process_exception const& \/*e*\/)\n      {\n        if (fatal_if_no_process)\n        {\n          std::string const reason = \"A process block did not result in a process being \"\n                                     \"added to the pipeline: \" + name;\n\n          throw std::logic_error(reason);\n        }\n      }\n    }\n  }\n\n  if (proc)\n  {\n    output_process(proc);\n  }\n  else\n  {\n    m_ostr << std::endl;\n  }\n}\n\nvoid\nconfig_printer\n::output_process_block(vistk::process_t const& proc, std::string const& kind)\n{\n  vistk::process::type_t const& type = proc->type();\n\n  m_ostr << \"# Defaults for \\'\" << name << \"\\' \" << kind << \":\" << std::endl;\n  m_ostr << \"config \" << name << std::endl;\n  m_ostr << \"#  :: \" << type << std::endl;\n\n  output_process(proc);\n}\n\nvoid\nconfig_printer\n::output_process(vistk::process_t const& proc)\n{\n  vistk::process::name_t const name = proc->name();\n  vistk::config::keys_t const keys = proc->available_config();\n\n  BOOST_FOREACH (vistk::config::key_t const& key, keys)\n  {\n    if (boost::starts_with(key, \"_\"))\n    {\n      continue;\n    }\n\n    m_ostr << std::endl;\n\n    vistk::process::conf_info_t const& info = proc->config_info(key);\n\n    vistk::config::description_t const desc = boost::replace_all_copy(info->description, \"\\n\", \"\\n  #   \");\n\n    m_ostr << \"  # Key: \" << key << std::endl;\n\n    m_ostr << \"  # Description: \" << desc << std::endl;\n\n    vistk::config::value_t const& def = info->def;\n\n    if (def.empty())\n    {\n      m_ostr << \"  # No default value\" << std::endl;\n    }\n    else\n    {\n      m_ostr << \"  # Default value: \" << def << std::endl;\n    }\n\n    vistk::config::key_t const resolved_key = name + vistk::config::block_sep + key;\n\n    if (m_config->has_value(resolved_key))\n    {\n      vistk::config::value_t const cur_value = m_config->get_value<vistk::config::value_t>(resolved_key);\n\n      m_ostr << \"  # Current value: \" << cur_value << std::endl;\n    }\n    else\n    {\n      m_ostr << \"  # No current value\" << std::endl;\n    }\n  }\n\n  m_ostr << std::endl;\n\n  m_visited.insert(name);\n}\n\nkey_printer\n::key_printer(std::ostream& ostr)\n  : m_ostr(ostr)\n{\n}\n\nkey_printer\n::~key_printer()\n{\n}\n\nvoid\nkey_printer\n::operator () (vistk::config_value_t const& config_value) const\n{\n  vistk::config_key_t const& key = config_value.key;\n  vistk::config::value_t const& value = config_value.value;\n\n  vistk::config::keys_t const& keys = key.key_path;\n  vistk::config_key_options_t const& options = key.options;\n\n  vistk::config::key_t const key_path = boost::join(keys, vistk::config::block_sep);\n\n  boost::optional<vistk::config_flags_t> const& flags = options.flags;\n  boost::optional<vistk::config_provider_t> const& provider = options.provider;\n\n  m_ostr << \"  \" << vistk::config::block_sep << key_path;\n\n  if (flags)\n  {\n    vistk::config_flag_t const flag_list = boost::join(*flags, \",\");\n\n    m_ostr << \"[\" << flag_list << \"]\";\n  }\n\n  if (provider)\n  {\n    m_ostr << \"{\" << *provider << \"}\";\n  }\n\n  m_ostr << \" \" << value << std::endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ 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\/login_prompt.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/lock.h\"\n#include \"base\/message_loop.h\"\n#include \"chrome\/browser\/browser_process.h\"\n#include \"chrome\/browser\/password_manager\/password_manager.h\"\n#include \"chrome\/browser\/renderer_host\/render_process_host.h\"\n#include \"chrome\/browser\/renderer_host\/resource_dispatcher_host.h\"\n#include \"chrome\/browser\/tab_contents\/constrained_window.h\"\n#include \"chrome\/browser\/tab_contents\/navigation_controller.h\"\n#include \"chrome\/browser\/tab_contents\/tab_util.h\"\n#include \"chrome\/browser\/tab_contents\/web_contents.h\"\n#include \"chrome\/browser\/views\/login_view.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/l10n_util.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"chrome\/views\/dialog_delegate.h\"\n#include \"grit\/generated_resources.h\"\n#include \"net\/base\/auth.h\"\n#include \"net\/url_request\/url_request.h\"\n\nusing namespace std;\nusing views::LoginView;\n\nclass LoginHandlerImpl;\n\n\/\/ Helper to remove the ref from an URLRequest to the LoginHandler.\n\/\/ Should only be called from the IO thread, since it accesses an URLRequest.\nstatic void ResetLoginHandlerForRequest(URLRequest* request) {\n  ResourceDispatcherHost::ExtraRequestInfo* info =\n      ResourceDispatcherHost::ExtraInfoForRequest(request);\n  if (!info)\n    return;\n\n  info->login_handler = NULL;\n}\n\n\/\/ Get the signon_realm under which this auth info should be stored.\n\/\/\n\/\/ The format of the signon_realm for proxy auth is:\n\/\/     proxy-host\/auth-realm\n\/\/ The format of the signon_realm for server auth is:\n\/\/     url-scheme:\/\/url-host[:url-port]\/auth-realm\n\/\/\n\/\/ Be careful when changing this function, since you could make existing\n\/\/ saved logins un-retrievable.\n\nstd::string GetSignonRealm(const GURL& url,\n                           const net::AuthChallengeInfo& auth_info) {\n  std::string signon_realm;\n  if (auth_info.is_proxy) {\n    signon_realm = WideToASCII(auth_info.host);\n    signon_realm.append(\"\/\");\n  } else {\n    \/\/ Take scheme, host, and port from the url.\n    signon_realm = url.GetOrigin().spec();\n    \/\/ This ends with a \"\/\".\n  }\n  signon_realm.append(WideToUTF8(auth_info.realm));\n  return signon_realm;\n}\n\n\/\/ ----------------------------------------------------------------------------\n\/\/ LoginHandlerImpl\n\n\/\/ This class simply forwards the authentication from the LoginView (on\n\/\/ the UI thread) to the URLRequest (on the I\/O thread).\n\/\/ This class uses ref counting to ensure that it lives until all InvokeLaters\n\/\/ have been called.\nclass LoginHandlerImpl : public LoginHandler,\n                         public base::RefCountedThreadSafe<LoginHandlerImpl>,\n                         public views::DialogDelegate {\n public:\n  LoginHandlerImpl(URLRequest* request, MessageLoop* ui_loop)\n      : dialog_(NULL),\n        handled_auth_(false),\n        request_(request),\n        request_loop_(MessageLoop::current()),\n        ui_loop_(ui_loop),\n        password_manager_(NULL) {\n    DCHECK(request_) << \"LoginHandler constructed with NULL request\";\n\n    AddRef();  \/\/ matched by ReleaseLater.\n    if (!tab_util::GetTabContentsID(request_, &render_process_host_id_,\n                                    &tab_contents_id_)) {\n      NOTREACHED();\n    }\n  }\n\n  ~LoginHandlerImpl() {\n  }\n\n  \/\/ Initialize the UI part of the LoginHandler.\n  \/\/ Scary thread safety note: This can potentially be called *after* SetAuth\n  \/\/ or CancelAuth (say, if the request was cancelled before the UI thread got\n  \/\/ control).  However, that's OK since any UI interaction in those functions\n  \/\/ will occur via an InvokeLater on the UI thread, which is guaranteed\n  \/\/ to happen after this is called (since this was InvokeLater'd first).\n  void InitWithDialog(ConstrainedWindow* dlg) {\n    DCHECK(MessageLoop::current() == ui_loop_);\n    dialog_ = dlg;\n    SendNotifications();\n  }\n\n  \/\/ Returns the WebContents that needs authentication.\n  WebContents* GetWebContentsForLogin() {\n    DCHECK(MessageLoop::current() == ui_loop_);\n\n    return tab_util::GetWebContentsByID(render_process_host_id_,\n                                        tab_contents_id_);\n  }\n\n  void set_login_view(LoginView* login_view) {\n    login_view_ = login_view;\n  }\n\n  void set_password_form(const PasswordForm& form) {\n    password_form_ = form;\n  }\n\n  void set_password_manager(PasswordManager* password_manager) {\n    password_manager_ = password_manager;\n  }\n\n  \/\/ views::DialogDelegate methods:\n  virtual std::wstring GetDialogButtonLabel(DialogButton button) const {\n    if (button == DIALOGBUTTON_OK)\n      return l10n_util::GetString(IDS_LOGIN_DIALOG_OK_BUTTON_LABEL);\n    return DialogDelegate::GetDialogButtonLabel(button);\n  }\n  virtual std::wstring GetWindowTitle() const {\n    return l10n_util::GetString(IDS_LOGIN_DIALOG_TITLE);\n  }\n  virtual void WindowClosing() {\n    DCHECK(MessageLoop::current() == ui_loop_);\n\n    \/\/ Reference is no longer valid.\n    dialog_ = NULL;\n\n    if (!WasAuthHandled(true)) {\n      request_loop_->PostTask(FROM_HERE, NewRunnableMethod(\n          this, &LoginHandlerImpl::CancelAuthDeferred));\n      SendNotifications();\n    }\n  }\n  virtual void DeleteDelegate() {\n    \/\/ Delete this object once all InvokeLaters have been called.\n    request_loop_->ReleaseSoon(FROM_HERE, this);\n  }\n  virtual bool Cancel() {\n    DCHECK(MessageLoop::current() == ui_loop_);\n    DCHECK(dialog_) << \"LoginHandler invoked without being attached\";\n    CancelAuth();\n    return true;\n  }\n  virtual bool Accept() {\n    DCHECK(MessageLoop::current() == ui_loop_);\n    DCHECK(dialog_) << \"LoginHandler invoked without being attached\";\n    SetAuth(login_view_->GetUsername(), login_view_->GetPassword());\n    return true;\n  }\n  virtual views::View* GetContentsView() {\n    return login_view_;\n  }\n\n  \/\/ LoginHandler:\n  virtual void SetAuth(const std::wstring& username,\n                       const std::wstring& password) {\n    if (WasAuthHandled(true))\n      return;\n\n    \/\/ Tell the password manager the credentials were submitted \/ accepted.\n    if (password_manager_) {\n      password_form_.username_value = username;\n      password_form_.password_value = password;\n      password_manager_->ProvisionallySavePassword(password_form_);\n    }\n\n    ui_loop_->PostTask(FROM_HERE, NewRunnableMethod(\n        this, &LoginHandlerImpl::CloseContentsDeferred));\n    ui_loop_->PostTask(FROM_HERE, NewRunnableMethod(\n        this, &LoginHandlerImpl::SendNotifications));\n    request_loop_->PostTask(FROM_HERE, NewRunnableMethod(\n        this, &LoginHandlerImpl::SetAuthDeferred, username, password));\n  }\n\n  virtual void CancelAuth() {\n    if (WasAuthHandled(true))\n      return;\n\n    ui_loop_->PostTask(FROM_HERE, NewRunnableMethod(\n        this, &LoginHandlerImpl::CloseContentsDeferred));\n    ui_loop_->PostTask(FROM_HERE, NewRunnableMethod(\n        this, &LoginHandlerImpl::SendNotifications));\n    request_loop_->PostTask(FROM_HERE, NewRunnableMethod(\n        this, &LoginHandlerImpl::CancelAuthDeferred));\n  }\n\n  virtual void OnRequestCancelled() {\n    DCHECK(MessageLoop::current() == request_loop_) <<\n        \"Why is OnRequestCancelled called from the UI thread?\";\n\n    \/\/ Reference is no longer valid.\n    request_ = NULL;\n\n    \/\/ Give up on auth if the request was cancelled.\n    CancelAuth();\n  }\n\n private:\n\n  \/\/ Calls SetAuth from the request_loop.\n  void SetAuthDeferred(const std::wstring& username,\n                       const std::wstring& password) {\n    DCHECK(MessageLoop::current() == request_loop_);\n\n    if (request_) {\n      request_->SetAuth(username, password);\n      ResetLoginHandlerForRequest(request_);\n    }\n  }\n\n  \/\/ Calls CancelAuth from the request_loop.\n  void CancelAuthDeferred() {\n    DCHECK(MessageLoop::current() == request_loop_);\n\n    if (request_) {\n      request_->CancelAuth();\n      \/\/ Verify that CancelAuth does destroy the request via our delegate.\n      DCHECK(request_ != NULL);\n      ResetLoginHandlerForRequest(request_);\n    }\n  }\n\n  \/\/ Closes the view_contents from the UI loop.\n  void CloseContentsDeferred() {\n    DCHECK(MessageLoop::current() == ui_loop_);\n\n    \/\/ The hosting ConstrainedWindow may have been freed.\n    if (dialog_)\n      dialog_->CloseConstrainedWindow();\n  }\n\n  \/\/ Returns whether authentication had been handled (SetAuth or CancelAuth).\n  \/\/ If |set_handled| is true, it will mark authentication as handled.\n  bool WasAuthHandled(bool set_handled) {\n    AutoLock lock(handled_auth_lock_);\n    bool was_handled = handled_auth_;\n    if (set_handled)\n      handled_auth_ = true;\n    return was_handled;\n  }\n\n  \/\/ Notify observers that authentication is needed or received.  The automation\n  \/\/ proxy uses this for testing.\n  void SendNotifications() {\n    DCHECK(MessageLoop::current() == ui_loop_);\n\n    NotificationService* service = NotificationService::current();\n    WebContents* requesting_contents = GetWebContentsForLogin();\n    if (!requesting_contents)\n      return;\n\n    NavigationController* controller = requesting_contents->controller();\n\n    if (!WasAuthHandled(false)) {\n      LoginNotificationDetails details(this);\n      service->Notify(NotificationType::AUTH_NEEDED,\n                      Source<NavigationController>(controller),\n                      Details<LoginNotificationDetails>(&details));\n    } else {\n      service->Notify(NotificationType::AUTH_SUPPLIED,\n                      Source<NavigationController>(controller),\n                      NotificationService::NoDetails());\n    }\n  }\n\n  \/\/ True if we've handled auth (SetAuth or CancelAuth has been called).\n  bool handled_auth_;\n  Lock handled_auth_lock_;\n\n  \/\/ The ConstrainedWindow that is hosting our LoginView.\n  \/\/ This should only be accessed on the ui_loop_.\n  ConstrainedWindow* dialog_;\n\n  \/\/ The MessageLoop of the thread that the ChromeViewContents lives in.\n  MessageLoop* ui_loop_;\n\n  \/\/ The request that wants login data.\n  \/\/ This should only be accessed on the request_loop_.\n  URLRequest* request_;\n\n  \/\/ The MessageLoop of the thread that the URLRequest lives in.\n  MessageLoop* request_loop_;\n\n  \/\/ The LoginView that contains the user's login information\n  LoginView* login_view_;\n\n  \/\/ The PasswordForm sent to the PasswordManager. This is so we can refer to it\n  \/\/ when later notifying the password manager if the credentials were accepted\n  \/\/ or rejected.\n  \/\/ This should only be accessed on the ui_loop_.\n  PasswordForm password_form_;\n\n  \/\/ Points to the password manager owned by the TabContents requesting auth.\n  \/\/ Can be null if the TabContents is not a WebContents.\n  \/\/ This should only be accessed on the ui_loop_.\n  PasswordManager* password_manager_;\n\n  \/\/ Cached from the URLRequest, in case it goes NULL on us.\n  int render_process_host_id_;\n  int tab_contents_id_;\n\n  DISALLOW_EVIL_CONSTRUCTORS(LoginHandlerImpl);\n};\n\n\n\/\/ ----------------------------------------------------------------------------\n\/\/ LoginDialogTask\n\n\/\/ This task is run on the UI thread and creates a constrained window with\n\/\/ a LoginView to prompt the user.  The response will be sent to LoginHandler,\n\/\/ which then routes it to the URLRequest on the I\/O thread.\nclass LoginDialogTask : public Task {\n public:\n  LoginDialogTask(net::AuthChallengeInfo* auth_info, LoginHandlerImpl* handler)\n      : auth_info_(auth_info), handler_(handler) {\n  }\n  virtual ~LoginDialogTask() {\n  }\n\n  void Run() {\n    WebContents* parent_contents = handler_->GetWebContentsForLogin();\n    if (!parent_contents) {\n      \/\/ The request was probably cancelled.\n      return;\n    }\n\n    wstring explanation = auth_info_->realm.empty() ?\n        l10n_util::GetStringF(IDS_LOGIN_DIALOG_DESCRIPTION_NO_REALM,\n                              auth_info_->host) :\n        l10n_util::GetStringF(IDS_LOGIN_DIALOG_DESCRIPTION,\n                              auth_info_->host,\n                              auth_info_->realm);\n    LoginView* view = new LoginView(explanation);\n    \/\/ Tell the password manager to look for saved passwords. There is only\n    \/\/ a password manager when dealing with a WebContents type.\n    if (parent_contents->type() == TAB_CONTENTS_WEB) {\n      PasswordManager* password_manager =\n          parent_contents->AsWebContents()->GetPasswordManager();\n      \/\/ Set the model for the login view. The model (password manager) is owned\n      \/\/ by the view's parent TabContents, so natural destruction order means we\n      \/\/ don't have to worry about calling SetModel(NULL), because the view will\n      \/\/ be deleted before the password manager.\n      view->SetModel(password_manager);\n      std::vector<PasswordForm> v;\n      MakeInputForPasswordManager(parent_contents->GetURL(), &v);\n      password_manager->PasswordFormsSeen(v);\n      handler_->set_password_manager(password_manager);\n    }\n\n    handler_->set_login_view(view);\n    ConstrainedWindow* dialog =\n        parent_contents->CreateConstrainedDialog(handler_, view);\n    handler_->InitWithDialog(dialog);\n  }\n\n private:\n  \/\/ Helper to create a PasswordForm and stuff it into a vector as input\n  \/\/ for PasswordManager::PasswordFormsSeen, the hook into PasswordManager.\n  void MakeInputForPasswordManager(\n      const GURL& origin_url,\n      std::vector<PasswordForm>* password_manager_input) {\n    PasswordForm dialog_form;\n    if (LowerCaseEqualsASCII(auth_info_->scheme, \"basic\")) {\n      dialog_form.scheme = PasswordForm::SCHEME_BASIC;\n    } else if (LowerCaseEqualsASCII(auth_info_->scheme, \"digest\")) {\n      dialog_form.scheme = PasswordForm::SCHEME_DIGEST;\n    } else {\n      dialog_form.scheme = PasswordForm::SCHEME_OTHER;\n    }\n    dialog_form.origin = origin_url;\n    dialog_form.signon_realm = GetSignonRealm(dialog_form.origin, *auth_info_);\n    password_manager_input->push_back(dialog_form);\n    \/\/ Set the password form for the handler (by copy).\n    handler_->set_password_form(dialog_form);\n  }\n\n  \/\/ Info about who\/where\/what is asking for authentication.\n  scoped_refptr<net::AuthChallengeInfo> auth_info_;\n\n  \/\/ Where to send the authentication when obtained.\n  \/\/ This is owned by the ResourceDispatcherHost that invoked us.\n  LoginHandlerImpl* handler_;\n\n  DISALLOW_EVIL_CONSTRUCTORS(LoginDialogTask);\n};\n\n\/\/ ----------------------------------------------------------------------------\n\/\/ Public API\n\nLoginHandler* CreateLoginPrompt(net::AuthChallengeInfo* auth_info,\n                                URLRequest* request,\n                                MessageLoop* ui_loop) {\n  LoginHandlerImpl* handler = new LoginHandlerImpl(request, ui_loop);\n  ui_loop->PostTask(FROM_HERE, new LoginDialogTask(auth_info, handler));\n  return handler;\n}\n<commit_msg>bustage fix - moved file<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\/login_prompt.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/lock.h\"\n#include \"base\/message_loop.h\"\n#include \"chrome\/browser\/browser_process.h\"\n#include \"chrome\/browser\/password_manager\/password_manager.h\"\n#include \"chrome\/browser\/renderer_host\/render_process_host.h\"\n#include \"chrome\/browser\/renderer_host\/resource_dispatcher_host.h\"\n#include \"chrome\/browser\/tab_contents\/constrained_window.h\"\n#include \"chrome\/browser\/tab_contents\/navigation_controller.h\"\n#include \"chrome\/browser\/tab_contents\/tab_util.h\"\n#include \"chrome\/browser\/tab_contents\/web_contents.h\"\n#include \"chrome\/browser\/views\/login_view.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/l10n_util.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"chrome\/views\/window\/dialog_delegate.h\"\n#include \"grit\/generated_resources.h\"\n#include \"net\/base\/auth.h\"\n#include \"net\/url_request\/url_request.h\"\n\nusing namespace std;\nusing views::LoginView;\n\nclass LoginHandlerImpl;\n\n\/\/ Helper to remove the ref from an URLRequest to the LoginHandler.\n\/\/ Should only be called from the IO thread, since it accesses an URLRequest.\nstatic void ResetLoginHandlerForRequest(URLRequest* request) {\n  ResourceDispatcherHost::ExtraRequestInfo* info =\n      ResourceDispatcherHost::ExtraInfoForRequest(request);\n  if (!info)\n    return;\n\n  info->login_handler = NULL;\n}\n\n\/\/ Get the signon_realm under which this auth info should be stored.\n\/\/\n\/\/ The format of the signon_realm for proxy auth is:\n\/\/     proxy-host\/auth-realm\n\/\/ The format of the signon_realm for server auth is:\n\/\/     url-scheme:\/\/url-host[:url-port]\/auth-realm\n\/\/\n\/\/ Be careful when changing this function, since you could make existing\n\/\/ saved logins un-retrievable.\n\nstd::string GetSignonRealm(const GURL& url,\n                           const net::AuthChallengeInfo& auth_info) {\n  std::string signon_realm;\n  if (auth_info.is_proxy) {\n    signon_realm = WideToASCII(auth_info.host);\n    signon_realm.append(\"\/\");\n  } else {\n    \/\/ Take scheme, host, and port from the url.\n    signon_realm = url.GetOrigin().spec();\n    \/\/ This ends with a \"\/\".\n  }\n  signon_realm.append(WideToUTF8(auth_info.realm));\n  return signon_realm;\n}\n\n\/\/ ----------------------------------------------------------------------------\n\/\/ LoginHandlerImpl\n\n\/\/ This class simply forwards the authentication from the LoginView (on\n\/\/ the UI thread) to the URLRequest (on the I\/O thread).\n\/\/ This class uses ref counting to ensure that it lives until all InvokeLaters\n\/\/ have been called.\nclass LoginHandlerImpl : public LoginHandler,\n                         public base::RefCountedThreadSafe<LoginHandlerImpl>,\n                         public views::DialogDelegate {\n public:\n  LoginHandlerImpl(URLRequest* request, MessageLoop* ui_loop)\n      : dialog_(NULL),\n        handled_auth_(false),\n        request_(request),\n        request_loop_(MessageLoop::current()),\n        ui_loop_(ui_loop),\n        password_manager_(NULL) {\n    DCHECK(request_) << \"LoginHandler constructed with NULL request\";\n\n    AddRef();  \/\/ matched by ReleaseLater.\n    if (!tab_util::GetTabContentsID(request_, &render_process_host_id_,\n                                    &tab_contents_id_)) {\n      NOTREACHED();\n    }\n  }\n\n  ~LoginHandlerImpl() {\n  }\n\n  \/\/ Initialize the UI part of the LoginHandler.\n  \/\/ Scary thread safety note: This can potentially be called *after* SetAuth\n  \/\/ or CancelAuth (say, if the request was cancelled before the UI thread got\n  \/\/ control).  However, that's OK since any UI interaction in those functions\n  \/\/ will occur via an InvokeLater on the UI thread, which is guaranteed\n  \/\/ to happen after this is called (since this was InvokeLater'd first).\n  void InitWithDialog(ConstrainedWindow* dlg) {\n    DCHECK(MessageLoop::current() == ui_loop_);\n    dialog_ = dlg;\n    SendNotifications();\n  }\n\n  \/\/ Returns the WebContents that needs authentication.\n  WebContents* GetWebContentsForLogin() {\n    DCHECK(MessageLoop::current() == ui_loop_);\n\n    return tab_util::GetWebContentsByID(render_process_host_id_,\n                                        tab_contents_id_);\n  }\n\n  void set_login_view(LoginView* login_view) {\n    login_view_ = login_view;\n  }\n\n  void set_password_form(const PasswordForm& form) {\n    password_form_ = form;\n  }\n\n  void set_password_manager(PasswordManager* password_manager) {\n    password_manager_ = password_manager;\n  }\n\n  \/\/ views::DialogDelegate methods:\n  virtual std::wstring GetDialogButtonLabel(DialogButton button) const {\n    if (button == DIALOGBUTTON_OK)\n      return l10n_util::GetString(IDS_LOGIN_DIALOG_OK_BUTTON_LABEL);\n    return DialogDelegate::GetDialogButtonLabel(button);\n  }\n  virtual std::wstring GetWindowTitle() const {\n    return l10n_util::GetString(IDS_LOGIN_DIALOG_TITLE);\n  }\n  virtual void WindowClosing() {\n    DCHECK(MessageLoop::current() == ui_loop_);\n\n    \/\/ Reference is no longer valid.\n    dialog_ = NULL;\n\n    if (!WasAuthHandled(true)) {\n      request_loop_->PostTask(FROM_HERE, NewRunnableMethod(\n          this, &LoginHandlerImpl::CancelAuthDeferred));\n      SendNotifications();\n    }\n  }\n  virtual void DeleteDelegate() {\n    \/\/ Delete this object once all InvokeLaters have been called.\n    request_loop_->ReleaseSoon(FROM_HERE, this);\n  }\n  virtual bool Cancel() {\n    DCHECK(MessageLoop::current() == ui_loop_);\n    DCHECK(dialog_) << \"LoginHandler invoked without being attached\";\n    CancelAuth();\n    return true;\n  }\n  virtual bool Accept() {\n    DCHECK(MessageLoop::current() == ui_loop_);\n    DCHECK(dialog_) << \"LoginHandler invoked without being attached\";\n    SetAuth(login_view_->GetUsername(), login_view_->GetPassword());\n    return true;\n  }\n  virtual views::View* GetContentsView() {\n    return login_view_;\n  }\n\n  \/\/ LoginHandler:\n  virtual void SetAuth(const std::wstring& username,\n                       const std::wstring& password) {\n    if (WasAuthHandled(true))\n      return;\n\n    \/\/ Tell the password manager the credentials were submitted \/ accepted.\n    if (password_manager_) {\n      password_form_.username_value = username;\n      password_form_.password_value = password;\n      password_manager_->ProvisionallySavePassword(password_form_);\n    }\n\n    ui_loop_->PostTask(FROM_HERE, NewRunnableMethod(\n        this, &LoginHandlerImpl::CloseContentsDeferred));\n    ui_loop_->PostTask(FROM_HERE, NewRunnableMethod(\n        this, &LoginHandlerImpl::SendNotifications));\n    request_loop_->PostTask(FROM_HERE, NewRunnableMethod(\n        this, &LoginHandlerImpl::SetAuthDeferred, username, password));\n  }\n\n  virtual void CancelAuth() {\n    if (WasAuthHandled(true))\n      return;\n\n    ui_loop_->PostTask(FROM_HERE, NewRunnableMethod(\n        this, &LoginHandlerImpl::CloseContentsDeferred));\n    ui_loop_->PostTask(FROM_HERE, NewRunnableMethod(\n        this, &LoginHandlerImpl::SendNotifications));\n    request_loop_->PostTask(FROM_HERE, NewRunnableMethod(\n        this, &LoginHandlerImpl::CancelAuthDeferred));\n  }\n\n  virtual void OnRequestCancelled() {\n    DCHECK(MessageLoop::current() == request_loop_) <<\n        \"Why is OnRequestCancelled called from the UI thread?\";\n\n    \/\/ Reference is no longer valid.\n    request_ = NULL;\n\n    \/\/ Give up on auth if the request was cancelled.\n    CancelAuth();\n  }\n\n private:\n\n  \/\/ Calls SetAuth from the request_loop.\n  void SetAuthDeferred(const std::wstring& username,\n                       const std::wstring& password) {\n    DCHECK(MessageLoop::current() == request_loop_);\n\n    if (request_) {\n      request_->SetAuth(username, password);\n      ResetLoginHandlerForRequest(request_);\n    }\n  }\n\n  \/\/ Calls CancelAuth from the request_loop.\n  void CancelAuthDeferred() {\n    DCHECK(MessageLoop::current() == request_loop_);\n\n    if (request_) {\n      request_->CancelAuth();\n      \/\/ Verify that CancelAuth does destroy the request via our delegate.\n      DCHECK(request_ != NULL);\n      ResetLoginHandlerForRequest(request_);\n    }\n  }\n\n  \/\/ Closes the view_contents from the UI loop.\n  void CloseContentsDeferred() {\n    DCHECK(MessageLoop::current() == ui_loop_);\n\n    \/\/ The hosting ConstrainedWindow may have been freed.\n    if (dialog_)\n      dialog_->CloseConstrainedWindow();\n  }\n\n  \/\/ Returns whether authentication had been handled (SetAuth or CancelAuth).\n  \/\/ If |set_handled| is true, it will mark authentication as handled.\n  bool WasAuthHandled(bool set_handled) {\n    AutoLock lock(handled_auth_lock_);\n    bool was_handled = handled_auth_;\n    if (set_handled)\n      handled_auth_ = true;\n    return was_handled;\n  }\n\n  \/\/ Notify observers that authentication is needed or received.  The automation\n  \/\/ proxy uses this for testing.\n  void SendNotifications() {\n    DCHECK(MessageLoop::current() == ui_loop_);\n\n    NotificationService* service = NotificationService::current();\n    WebContents* requesting_contents = GetWebContentsForLogin();\n    if (!requesting_contents)\n      return;\n\n    NavigationController* controller = requesting_contents->controller();\n\n    if (!WasAuthHandled(false)) {\n      LoginNotificationDetails details(this);\n      service->Notify(NotificationType::AUTH_NEEDED,\n                      Source<NavigationController>(controller),\n                      Details<LoginNotificationDetails>(&details));\n    } else {\n      service->Notify(NotificationType::AUTH_SUPPLIED,\n                      Source<NavigationController>(controller),\n                      NotificationService::NoDetails());\n    }\n  }\n\n  \/\/ True if we've handled auth (SetAuth or CancelAuth has been called).\n  bool handled_auth_;\n  Lock handled_auth_lock_;\n\n  \/\/ The ConstrainedWindow that is hosting our LoginView.\n  \/\/ This should only be accessed on the ui_loop_.\n  ConstrainedWindow* dialog_;\n\n  \/\/ The MessageLoop of the thread that the ChromeViewContents lives in.\n  MessageLoop* ui_loop_;\n\n  \/\/ The request that wants login data.\n  \/\/ This should only be accessed on the request_loop_.\n  URLRequest* request_;\n\n  \/\/ The MessageLoop of the thread that the URLRequest lives in.\n  MessageLoop* request_loop_;\n\n  \/\/ The LoginView that contains the user's login information\n  LoginView* login_view_;\n\n  \/\/ The PasswordForm sent to the PasswordManager. This is so we can refer to it\n  \/\/ when later notifying the password manager if the credentials were accepted\n  \/\/ or rejected.\n  \/\/ This should only be accessed on the ui_loop_.\n  PasswordForm password_form_;\n\n  \/\/ Points to the password manager owned by the TabContents requesting auth.\n  \/\/ Can be null if the TabContents is not a WebContents.\n  \/\/ This should only be accessed on the ui_loop_.\n  PasswordManager* password_manager_;\n\n  \/\/ Cached from the URLRequest, in case it goes NULL on us.\n  int render_process_host_id_;\n  int tab_contents_id_;\n\n  DISALLOW_EVIL_CONSTRUCTORS(LoginHandlerImpl);\n};\n\n\n\/\/ ----------------------------------------------------------------------------\n\/\/ LoginDialogTask\n\n\/\/ This task is run on the UI thread and creates a constrained window with\n\/\/ a LoginView to prompt the user.  The response will be sent to LoginHandler,\n\/\/ which then routes it to the URLRequest on the I\/O thread.\nclass LoginDialogTask : public Task {\n public:\n  LoginDialogTask(net::AuthChallengeInfo* auth_info, LoginHandlerImpl* handler)\n      : auth_info_(auth_info), handler_(handler) {\n  }\n  virtual ~LoginDialogTask() {\n  }\n\n  void Run() {\n    WebContents* parent_contents = handler_->GetWebContentsForLogin();\n    if (!parent_contents) {\n      \/\/ The request was probably cancelled.\n      return;\n    }\n\n    wstring explanation = auth_info_->realm.empty() ?\n        l10n_util::GetStringF(IDS_LOGIN_DIALOG_DESCRIPTION_NO_REALM,\n                              auth_info_->host) :\n        l10n_util::GetStringF(IDS_LOGIN_DIALOG_DESCRIPTION,\n                              auth_info_->host,\n                              auth_info_->realm);\n    LoginView* view = new LoginView(explanation);\n    \/\/ Tell the password manager to look for saved passwords. There is only\n    \/\/ a password manager when dealing with a WebContents type.\n    if (parent_contents->type() == TAB_CONTENTS_WEB) {\n      PasswordManager* password_manager =\n          parent_contents->AsWebContents()->GetPasswordManager();\n      \/\/ Set the model for the login view. The model (password manager) is owned\n      \/\/ by the view's parent TabContents, so natural destruction order means we\n      \/\/ don't have to worry about calling SetModel(NULL), because the view will\n      \/\/ be deleted before the password manager.\n      view->SetModel(password_manager);\n      std::vector<PasswordForm> v;\n      MakeInputForPasswordManager(parent_contents->GetURL(), &v);\n      password_manager->PasswordFormsSeen(v);\n      handler_->set_password_manager(password_manager);\n    }\n\n    handler_->set_login_view(view);\n    ConstrainedWindow* dialog =\n        parent_contents->CreateConstrainedDialog(handler_, view);\n    handler_->InitWithDialog(dialog);\n  }\n\n private:\n  \/\/ Helper to create a PasswordForm and stuff it into a vector as input\n  \/\/ for PasswordManager::PasswordFormsSeen, the hook into PasswordManager.\n  void MakeInputForPasswordManager(\n      const GURL& origin_url,\n      std::vector<PasswordForm>* password_manager_input) {\n    PasswordForm dialog_form;\n    if (LowerCaseEqualsASCII(auth_info_->scheme, \"basic\")) {\n      dialog_form.scheme = PasswordForm::SCHEME_BASIC;\n    } else if (LowerCaseEqualsASCII(auth_info_->scheme, \"digest\")) {\n      dialog_form.scheme = PasswordForm::SCHEME_DIGEST;\n    } else {\n      dialog_form.scheme = PasswordForm::SCHEME_OTHER;\n    }\n    dialog_form.origin = origin_url;\n    dialog_form.signon_realm = GetSignonRealm(dialog_form.origin, *auth_info_);\n    password_manager_input->push_back(dialog_form);\n    \/\/ Set the password form for the handler (by copy).\n    handler_->set_password_form(dialog_form);\n  }\n\n  \/\/ Info about who\/where\/what is asking for authentication.\n  scoped_refptr<net::AuthChallengeInfo> auth_info_;\n\n  \/\/ Where to send the authentication when obtained.\n  \/\/ This is owned by the ResourceDispatcherHost that invoked us.\n  LoginHandlerImpl* handler_;\n\n  DISALLOW_EVIL_CONSTRUCTORS(LoginDialogTask);\n};\n\n\/\/ ----------------------------------------------------------------------------\n\/\/ Public API\n\nLoginHandler* CreateLoginPrompt(net::AuthChallengeInfo* auth_info,\n                                URLRequest* request,\n                                MessageLoop* ui_loop) {\n  LoginHandlerImpl* handler = new LoginHandlerImpl(request, ui_loop);\n  ui_loop->PostTask(FROM_HERE, new LoginDialogTask(auth_info, handler));\n  return handler;\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 <shlobj.h>\n#include <shobjidl.h>\n\n#include \"chrome\/common\/win_safe_util.h\"\n\n#include \"app\/win_util.h\"\n#include \"base\/file_path.h\"\n#include \"base\/logging.h\"\n#include \"base\/path_service.h\"\n#include \"base\/scoped_comptr_win.h\"\n#include \"base\/string_util.h\"\n\nnamespace win_util {\n\n\/\/ This function implementation is based on the attachment execution\n\/\/ services functionally deployed with IE6 or Service pack 2. This\n\/\/ functionality is exposed in the IAttachmentExecute COM interface.\n\/\/ more information at:\n\/\/ http:\/\/msdn2.microsoft.com\/en-us\/library\/ms647048.aspx\nbool SaferOpenItemViaShell(HWND hwnd, const std::wstring& window_title,\n                           const FilePath& full_path,\n                           const std::wstring& source_url) {\n  ScopedComPtr<IAttachmentExecute> attachment_services;\n  HRESULT hr = attachment_services.CreateInstance(CLSID_AttachmentServices);\n  if (FAILED(hr)) {\n    \/\/ We don't have Attachment Execution Services, it must be a pre-XP.SP2\n    \/\/ Windows installation, or the thread does not have COM initialized.\n    if (hr == CO_E_NOTINITIALIZED) {\n      NOTREACHED();\n      return false;\n    }\n    return OpenItemViaShell(full_path);\n  }\n\n  \/\/ This GUID is associated with any 'don't ask me again' settings that the\n  \/\/ user can select for different file types.\n  \/\/ {2676A9A2-D919-4fee-9187-152100393AB2}\n  static const GUID kClientID = { 0x2676a9a2, 0xd919, 0x4fee,\n    { 0x91, 0x87, 0x15, 0x21, 0x0, 0x39, 0x3a, 0xb2 } };\n\n  attachment_services->SetClientGuid(kClientID);\n\n  if (!window_title.empty())\n    attachment_services->SetClientTitle(window_title.c_str());\n\n  \/\/ To help windows decide if the downloaded file is dangerous we can provide\n  \/\/ what the documentation calls evidence. Which we provide now:\n  \/\/\n  \/\/ Set the file itself as evidence.\n  hr = attachment_services->SetLocalPath(full_path.value().c_str());\n  if (FAILED(hr))\n    return false;\n  \/\/ Set the origin URL as evidence.\n  hr = attachment_services->SetSource(source_url.c_str());\n  if (FAILED(hr))\n    return false;\n\n  \/\/ Now check the windows policy.\n  bool do_prompt;\n  hr = attachment_services->CheckPolicy();\n  if (S_FALSE == hr) {\n    \/\/ The user prompt is required.\n    do_prompt = true;\n  } else if (S_OK == hr) {\n    \/\/ An S_OK means that the file is safe to open without user consent.\n    do_prompt = false;\n  } else {\n    \/\/ It is possible that the last call returns an undocumented result\n    \/\/ equal to 0x800c000e which seems to indicate that the URL failed the\n    \/\/ the security check. If you proceed with the Prompt() call the\n    \/\/ Shell might show a dialog that says:\n    \/\/ \"windows found that this file is potentially harmful. To help protect\n    \/\/ your computer, Windows has blocked access to this file.\"\n    \/\/ Upon dismissal of the dialog windows will delete the file (!!).\n    \/\/ So, we can 'return' here but maybe is best to let it happen to fail on\n    \/\/ the safe side.\n  }\n  if (do_prompt) {\n    ATTACHMENT_ACTION action;\n    \/\/ We cannot control what the prompt says or does directly but it\n    \/\/ is a pretty decent dialog; for example, if an excutable is signed it can\n    \/\/ decode and show the publisher and the certificate.\n    hr = attachment_services->Prompt(hwnd, ATTACHMENT_PROMPT_EXEC, &action);\n    if (FAILED(hr) || (ATTACHMENT_ACTION_CANCEL == action))\n    {\n      \/\/ The user has declined opening the item.\n      return false;\n    }\n  }\n  return OpenItemViaShellNoZoneCheck(full_path);\n}\n\nbool SetInternetZoneIdentifier(const FilePath& full_path) {\n  const DWORD kShare = FILE_SHARE_READ | FILE_SHARE_WRITE | FILE_SHARE_DELETE;\n  std::wstring path = full_path.value() + L\":Zone.Identifier\";\n  HANDLE file = CreateFile(path.c_str(), GENERIC_WRITE, kShare, NULL,\n                           OPEN_ALWAYS, FILE_ATTRIBUTE_NORMAL, NULL);\n  if (INVALID_HANDLE_VALUE == file)\n    return false;\n\n  const char kIdentifier[] = \"[ZoneTransfer]\\nZoneId=3\";\n  DWORD written = 0;\n  BOOL result = WriteFile(file, kIdentifier, arraysize(kIdentifier), &written,\n                          NULL);\n  BOOL flush_result = FlushFileBuffers(file);\n  CloseHandle(file);\n\n  if (!result || !flush_result || written != arraysize(kIdentifier)) {\n    NOTREACHED();\n    return false;\n  }\n\n  return true;\n}\n\n}  \/\/ namespace win_util\n<commit_msg>win_safe_util: fix uninitialized variable<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 <shlobj.h>\n#include <shobjidl.h>\n\n#include \"chrome\/common\/win_safe_util.h\"\n\n#include \"app\/win_util.h\"\n#include \"base\/file_path.h\"\n#include \"base\/logging.h\"\n#include \"base\/path_service.h\"\n#include \"base\/scoped_comptr_win.h\"\n#include \"base\/string_util.h\"\n\nnamespace win_util {\n\n\/\/ This function implementation is based on the attachment execution\n\/\/ services functionally deployed with IE6 or Service pack 2. This\n\/\/ functionality is exposed in the IAttachmentExecute COM interface.\n\/\/ more information at:\n\/\/ http:\/\/msdn2.microsoft.com\/en-us\/library\/ms647048.aspx\nbool SaferOpenItemViaShell(HWND hwnd, const std::wstring& window_title,\n                           const FilePath& full_path,\n                           const std::wstring& source_url) {\n  ScopedComPtr<IAttachmentExecute> attachment_services;\n  HRESULT hr = attachment_services.CreateInstance(CLSID_AttachmentServices);\n  if (FAILED(hr)) {\n    \/\/ We don't have Attachment Execution Services, it must be a pre-XP.SP2\n    \/\/ Windows installation, or the thread does not have COM initialized.\n    if (hr == CO_E_NOTINITIALIZED) {\n      NOTREACHED();\n      return false;\n    }\n    return OpenItemViaShell(full_path);\n  }\n\n  \/\/ This GUID is associated with any 'don't ask me again' settings that the\n  \/\/ user can select for different file types.\n  \/\/ {2676A9A2-D919-4fee-9187-152100393AB2}\n  static const GUID kClientID = { 0x2676a9a2, 0xd919, 0x4fee,\n    { 0x91, 0x87, 0x15, 0x21, 0x0, 0x39, 0x3a, 0xb2 } };\n\n  attachment_services->SetClientGuid(kClientID);\n\n  if (!window_title.empty())\n    attachment_services->SetClientTitle(window_title.c_str());\n\n  \/\/ To help windows decide if the downloaded file is dangerous we can provide\n  \/\/ what the documentation calls evidence. Which we provide now:\n  \/\/\n  \/\/ Set the file itself as evidence.\n  hr = attachment_services->SetLocalPath(full_path.value().c_str());\n  if (FAILED(hr))\n    return false;\n  \/\/ Set the origin URL as evidence.\n  hr = attachment_services->SetSource(source_url.c_str());\n  if (FAILED(hr))\n    return false;\n\n  \/\/ Now check the windows policy.\n  if (attachment_services->CheckPolicy() != S_OK) {\n    \/\/ It is possible that the above call returns an undocumented result\n    \/\/ equal to 0x800c000e which seems to indicate that the URL failed the\n    \/\/ the security check. If you proceed with the Prompt() call the\n    \/\/ Shell might show a dialog that says:\n    \/\/ \"windows found that this file is potentially harmful. To help protect\n    \/\/ your computer, Windows has blocked access to this file.\"\n    \/\/ Upon dismissal of the dialog windows will delete the file (!!).\n    \/\/ So, we can 'return' in that case but maybe is best to let it happen to\n    \/\/ fail on the safe side.\n\n    ATTACHMENT_ACTION action;\n    \/\/ We cannot control what the prompt says or does directly but it\n    \/\/ is a pretty decent dialog; for example, if an executable is signed it can\n    \/\/ decode and show the publisher and the certificate.\n    hr = attachment_services->Prompt(hwnd, ATTACHMENT_PROMPT_EXEC, &action);\n    if (FAILED(hr) || (ATTACHMENT_ACTION_CANCEL == action)) {\n      \/\/ The user has declined opening the item.\n      return false;\n    }\n  }\n  return OpenItemViaShellNoZoneCheck(full_path);\n}\n\nbool SetInternetZoneIdentifier(const FilePath& full_path) {\n  const DWORD kShare = FILE_SHARE_READ | FILE_SHARE_WRITE | FILE_SHARE_DELETE;\n  std::wstring path = full_path.value() + L\":Zone.Identifier\";\n  HANDLE file = CreateFile(path.c_str(), GENERIC_WRITE, kShare, NULL,\n                           OPEN_ALWAYS, FILE_ATTRIBUTE_NORMAL, NULL);\n  if (INVALID_HANDLE_VALUE == file)\n    return false;\n\n  const char kIdentifier[] = \"[ZoneTransfer]\\nZoneId=3\";\n  DWORD written = 0;\n  BOOL result = WriteFile(file, kIdentifier, arraysize(kIdentifier), &written,\n                          NULL);\n  BOOL flush_result = FlushFileBuffers(file);\n  CloseHandle(file);\n\n  if (!result || !flush_result || written != arraysize(kIdentifier)) {\n    NOTREACHED();\n    return false;\n  }\n\n  return true;\n}\n\n}  \/\/ namespace win_util\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright © 2012 Intel 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, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <iostream>\n#include <sstream>\n#include <set>\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/IR\/Instructions.h\"\n#include \"llvm\/IR\/Module.h\"\n#include \"llvm\/IRReader\/IRReader.h\"\n#include \"llvm\/PassManager.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/IR\/IRBuilder.h\"\n#include \"llvm\/Support\/FileSystem.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include \"llvm\/Bitcode\/ReaderWriter.h\"\n#include \"llvm\/Transforms\/IPO.h\"\n#include \"llvm\/Transforms\/Utils\/Cloning.h\"\n#include \"llvm\/Support\/SourceMgr.h\"\n\n#include \"sys\/cvar.hpp\"\n#include \"src\/GBEConfig.h\"\n#include \"llvm\/llvm_gen_backend.hpp\"\n#include \"llvm-c\/Linker.h\"\n\nusing namespace llvm;\n\nSVAR(OCL_BITCODE_LIB_PATH, OCL_BITCODE_BIN);\n\nnamespace gbe\n{\n  static Module* createOclBitCodeModule(LLVMContext& ctx, bool strictMath)\n  {\n    std::string bitCodeFiles = OCL_BITCODE_LIB_PATH;\n    std::istringstream bitCodeFilePath(bitCodeFiles);\n    std::string FilePath;\n    bool findBC = false;\n    Module* oclLib = NULL;\n    SMDiagnostic Err;\n\n    while (std::getline(bitCodeFilePath, FilePath, ':')) {\n      if(access(FilePath.c_str(), R_OK) == 0) {\n        findBC = true;\n        break;\n      }\n    }\n    assert(findBC);\n\n#if LLVM_VERSION_MAJOR == 3 && LLVM_VERSION_MINOR <= 5\n    oclLib = getLazyIRFileModule(FilePath, Err, ctx);\n#else\n    oclLib = getLazyIRFileModule(FilePath, Err, ctx).release();\n#endif\n    if (!oclLib) {\n      printf(\"Fatal Error: ocl lib can not be opened\\n\");\n      return NULL;\n    }\n\n    if (strictMath) {\n      llvm::GlobalVariable* mathFastFlag = oclLib->getGlobalVariable(\"__ocl_math_fastpath_flag\");\n      assert(mathFastFlag);\n      Type* intTy = IntegerType::get(ctx, 32);\n      mathFastFlag->setInitializer(ConstantInt::get(intTy, 0));\n    }\n\n    return oclLib;\n  }\n\n  static bool materializedFuncCall(Module& src, Module& lib, llvm::Function &KF, std::set<std::string>& MFS)\n  {\n    bool fromSrc = false;\n    for (llvm::Function::iterator B = KF.begin(), BE = KF.end(); B != BE; B++) {\n      for (BasicBlock::iterator instI = B->begin(),\n           instE = B->end(); instI != instE; ++instI) {\n        llvm::CallInst* call = dyn_cast<llvm::CallInst>(instI);\n        if (!call) {\n          continue;\n        }\n\n        if (call->getCalledFunction() &&\n            call->getCalledFunction()->getIntrinsicID() != 0)\n          continue;\n\n        Value *Callee = call->getCalledValue();\n        const std::string fnName = Callee->getName();\n\n        if (!MFS.insert(fnName).second) {\n          continue;\n        }\n\n        fromSrc = false;\n        llvm::Function *newMF = lib.getFunction(fnName);\n        if (!newMF) {\n          newMF = src.getFunction(fnName);\n          if (!newMF) {\n            printf(\"Can not find the lib: %s\\n\", fnName.c_str());\n            return false;\n          }\n          fromSrc = true;\n        }\n\n        std::string ErrInfo;\/\/ = \"Not Materializable\";\n        if (!fromSrc && newMF->isMaterializable()) {\n#if LLVM_VERSION_MAJOR == 3 && LLVM_VERSION_MINOR <= 5\n          if (newMF->Materialize(&ErrInfo)) {\n            printf(\"Can not materialize the function: %s, because %s\\n\", fnName.c_str(), ErrInfo.c_str());\n            return false;\n          }\n#else\n          if (std::error_code EC = newMF->materialize()) {\n            printf(\"Can not materialize the function: %s, because %s\\n\", fnName.c_str(), EC.message().c_str());\n            return false;\n          }\n#endif\n        }\n        if (!materializedFuncCall(src, lib, *newMF, MFS))\n          return false;\n\n      }\n    }\n\n    return true;\n  }\n\n\n  Module* runBitCodeLinker(Module *mod, bool strictMath)\n  {\n    LLVMContext& ctx = mod->getContext();\n    std::set<std::string> materializedFuncs;\n    Module* clonedLib = createOclBitCodeModule(ctx, strictMath);\n    assert(clonedLib && \"Can not create the beignet bitcode\\n\");\n\n    std::vector<const char *> kernels;\n    std::vector<const char *> builtinFuncs;\n    \/* Add the memset and memcpy functions here. *\/\n    builtinFuncs.push_back(\"__gen_memcpy_gg\");\n    builtinFuncs.push_back(\"__gen_memcpy_gp\");\n    builtinFuncs.push_back(\"__gen_memcpy_gl\");\n    builtinFuncs.push_back(\"__gen_memcpy_pg\");\n    builtinFuncs.push_back(\"__gen_memcpy_pp\");\n    builtinFuncs.push_back(\"__gen_memcpy_pl\");\n    builtinFuncs.push_back(\"__gen_memcpy_lg\");\n    builtinFuncs.push_back(\"__gen_memcpy_lp\");\n    builtinFuncs.push_back(\"__gen_memcpy_ll\");\n    builtinFuncs.push_back(\"__gen_memset_p\");\n    builtinFuncs.push_back(\"__gen_memset_g\");\n    builtinFuncs.push_back(\"__gen_memset_l\");\n\n    builtinFuncs.push_back(\"__gen_memcpy_gg_align\");\n    builtinFuncs.push_back(\"__gen_memcpy_gp_align\");\n    builtinFuncs.push_back(\"__gen_memcpy_gl_align\");\n    builtinFuncs.push_back(\"__gen_memcpy_pg_align\");\n    builtinFuncs.push_back(\"__gen_memcpy_pp_align\");\n    builtinFuncs.push_back(\"__gen_memcpy_pl_align\");\n    builtinFuncs.push_back(\"__gen_memcpy_lg_align\");\n    builtinFuncs.push_back(\"__gen_memcpy_lp_align\");\n    builtinFuncs.push_back(\"__gen_memcpy_ll_align\");\n    builtinFuncs.push_back(\"__gen_memset_p_align\");\n    builtinFuncs.push_back(\"__gen_memset_g_align\");\n    builtinFuncs.push_back(\"__gen_memset_l_align\");\n\n    builtinFuncs.push_back(\"__gen_memcpy_pc\");\n    builtinFuncs.push_back(\"__gen_memcpy_gc\");\n    builtinFuncs.push_back(\"__gen_memcpy_lc\");\n\n    builtinFuncs.push_back(\"__gen_memcpy_pc_align\");\n    builtinFuncs.push_back(\"__gen_memcpy_gc_align\");\n    builtinFuncs.push_back(\"__gen_memcpy_lc_align\");\n\n    for (Module::iterator SF = mod->begin(), E = mod->end(); SF != E; ++SF) {\n      if (SF->isDeclaration()) continue;\n      if (!isKernelFunction(*SF)) continue;\n      kernels.push_back(SF->getName().data());\n\n      if (!materializedFuncCall(*mod, *clonedLib, *SF, materializedFuncs)) {\n        delete clonedLib;\n        return NULL;\n      }\n    }\n\n    if (kernels.empty()) {\n      printf(\"One module without kernel function!\\n\");\n      delete clonedLib;\n      return NULL;\n    }\n\n    for (auto &f : builtinFuncs) {\n      const std::string fnName(f);\n      if (!materializedFuncs.insert(fnName).second) {\n        continue;\n      }\n\n      llvm::Function *newMF = clonedLib->getFunction(fnName);\n      if (!newMF) {\n        printf(\"Can not find the function: %s\\n\", fnName.c_str());\n        delete clonedLib;\n        return NULL;\n      }\n      std::string ErrInfo;\/\/ = \"Not Materializable\";\n      if (newMF->isMaterializable()) {\n#if LLVM_VERSION_MAJOR == 3 && LLVM_VERSION_MINOR <= 5\n        if (newMF->Materialize(&ErrInfo)) {\n          printf(\"Can not materialize the function: %s, because %s\\n\", fnName.c_str(), ErrInfo.c_str());\n          delete clonedLib;\n          return NULL;\n        }\n      }\n#else\n        if (std::error_code EC = newMF->materialize()) {\n          printf(\"Can not materialize the function: %s, because %s\\n\", fnName.c_str(), EC.message().c_str();\n          delete clonedLib;\n          return NULL;\n        }\n      }\n#endif\n\n      if (!materializedFuncCall(*mod, *clonedLib, *newMF, materializedFuncs)) {\n        delete clonedLib;\n        return NULL;\n      }\n\n      kernels.push_back(f);\n    }\n\n    \/* We use beignet's bitcode as dst because it will have a lot of\n       lazy functions which will not be loaded. *\/\n    char* errorMsg;\n#if LLVM_VERSION_MAJOR == 3 && LLVM_VERSION_MINOR <= 5\n    if(LLVMLinkModules(wrap(clonedLib), wrap(mod), LLVMLinkerDestroySource, &errorMsg)) {\n#else\n    if(LLVMLinkModules(wrap(clonedLib), wrap(mod), 0, &errorMsg)) {\n#endif\n      delete clonedLib;\n      printf(\"Fatal Error: link the bitcode error:\\n%s\\n\", errorMsg);\n      return NULL;\n    }\n\n    llvm::PassManager passes;\n\n    passes.add(createInternalizePass(kernels));\n    passes.add(createGlobalDCEPass());\n\n    passes.run(*clonedLib);\n\n    return clonedLib;\n  }\n\n} \/\/ end namespace\n<commit_msg>GBE: fix build error for llvm 3.6.<commit_after>\/*\n * Copyright © 2012 Intel 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, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <iostream>\n#include <sstream>\n#include <set>\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/IR\/Instructions.h\"\n#include \"llvm\/IR\/Module.h\"\n#include \"llvm\/IRReader\/IRReader.h\"\n#include \"llvm\/PassManager.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/IR\/IRBuilder.h\"\n#include \"llvm\/Support\/FileSystem.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include \"llvm\/Bitcode\/ReaderWriter.h\"\n#include \"llvm\/Transforms\/IPO.h\"\n#include \"llvm\/Transforms\/Utils\/Cloning.h\"\n#include \"llvm\/Support\/SourceMgr.h\"\n\n#include \"sys\/cvar.hpp\"\n#include \"src\/GBEConfig.h\"\n#include \"llvm\/llvm_gen_backend.hpp\"\n#include \"llvm-c\/Linker.h\"\n\nusing namespace llvm;\n\nSVAR(OCL_BITCODE_LIB_PATH, OCL_BITCODE_BIN);\n\nnamespace gbe\n{\n  static Module* createOclBitCodeModule(LLVMContext& ctx, bool strictMath)\n  {\n    std::string bitCodeFiles = OCL_BITCODE_LIB_PATH;\n    std::istringstream bitCodeFilePath(bitCodeFiles);\n    std::string FilePath;\n    bool findBC = false;\n    Module* oclLib = NULL;\n    SMDiagnostic Err;\n\n    while (std::getline(bitCodeFilePath, FilePath, ':')) {\n      if(access(FilePath.c_str(), R_OK) == 0) {\n        findBC = true;\n        break;\n      }\n    }\n    assert(findBC);\n\n#if LLVM_VERSION_MAJOR == 3 && LLVM_VERSION_MINOR <= 5\n    oclLib = getLazyIRFileModule(FilePath, Err, ctx);\n#else\n    oclLib = getLazyIRFileModule(FilePath, Err, ctx).release();\n#endif\n    if (!oclLib) {\n      printf(\"Fatal Error: ocl lib can not be opened\\n\");\n      return NULL;\n    }\n\n    if (strictMath) {\n      llvm::GlobalVariable* mathFastFlag = oclLib->getGlobalVariable(\"__ocl_math_fastpath_flag\");\n      assert(mathFastFlag);\n      Type* intTy = IntegerType::get(ctx, 32);\n      mathFastFlag->setInitializer(ConstantInt::get(intTy, 0));\n    }\n\n    return oclLib;\n  }\n\n  static bool materializedFuncCall(Module& src, Module& lib, llvm::Function &KF, std::set<std::string>& MFS)\n  {\n    bool fromSrc = false;\n    for (llvm::Function::iterator B = KF.begin(), BE = KF.end(); B != BE; B++) {\n      for (BasicBlock::iterator instI = B->begin(),\n           instE = B->end(); instI != instE; ++instI) {\n        llvm::CallInst* call = dyn_cast<llvm::CallInst>(instI);\n        if (!call) {\n          continue;\n        }\n\n        if (call->getCalledFunction() &&\n            call->getCalledFunction()->getIntrinsicID() != 0)\n          continue;\n\n        Value *Callee = call->getCalledValue();\n        const std::string fnName = Callee->getName();\n\n        if (!MFS.insert(fnName).second) {\n          continue;\n        }\n\n        fromSrc = false;\n        llvm::Function *newMF = lib.getFunction(fnName);\n        if (!newMF) {\n          newMF = src.getFunction(fnName);\n          if (!newMF) {\n            printf(\"Can not find the lib: %s\\n\", fnName.c_str());\n            return false;\n          }\n          fromSrc = true;\n        }\n\n        std::string ErrInfo;\/\/ = \"Not Materializable\";\n        if (!fromSrc && newMF->isMaterializable()) {\n#if LLVM_VERSION_MAJOR == 3 && LLVM_VERSION_MINOR <= 5\n          if (newMF->Materialize(&ErrInfo)) {\n            printf(\"Can not materialize the function: %s, because %s\\n\", fnName.c_str(), ErrInfo.c_str());\n            return false;\n          }\n#else\n          if (std::error_code EC = newMF->materialize()) {\n            printf(\"Can not materialize the function: %s, because %s\\n\", fnName.c_str(), EC.message().c_str());\n            return false;\n          }\n#endif\n        }\n        if (!materializedFuncCall(src, lib, *newMF, MFS))\n          return false;\n\n      }\n    }\n\n    return true;\n  }\n\n\n  Module* runBitCodeLinker(Module *mod, bool strictMath)\n  {\n    LLVMContext& ctx = mod->getContext();\n    std::set<std::string> materializedFuncs;\n    Module* clonedLib = createOclBitCodeModule(ctx, strictMath);\n    assert(clonedLib && \"Can not create the beignet bitcode\\n\");\n\n    std::vector<const char *> kernels;\n    std::vector<const char *> builtinFuncs;\n    \/* Add the memset and memcpy functions here. *\/\n    builtinFuncs.push_back(\"__gen_memcpy_gg\");\n    builtinFuncs.push_back(\"__gen_memcpy_gp\");\n    builtinFuncs.push_back(\"__gen_memcpy_gl\");\n    builtinFuncs.push_back(\"__gen_memcpy_pg\");\n    builtinFuncs.push_back(\"__gen_memcpy_pp\");\n    builtinFuncs.push_back(\"__gen_memcpy_pl\");\n    builtinFuncs.push_back(\"__gen_memcpy_lg\");\n    builtinFuncs.push_back(\"__gen_memcpy_lp\");\n    builtinFuncs.push_back(\"__gen_memcpy_ll\");\n    builtinFuncs.push_back(\"__gen_memset_p\");\n    builtinFuncs.push_back(\"__gen_memset_g\");\n    builtinFuncs.push_back(\"__gen_memset_l\");\n\n    builtinFuncs.push_back(\"__gen_memcpy_gg_align\");\n    builtinFuncs.push_back(\"__gen_memcpy_gp_align\");\n    builtinFuncs.push_back(\"__gen_memcpy_gl_align\");\n    builtinFuncs.push_back(\"__gen_memcpy_pg_align\");\n    builtinFuncs.push_back(\"__gen_memcpy_pp_align\");\n    builtinFuncs.push_back(\"__gen_memcpy_pl_align\");\n    builtinFuncs.push_back(\"__gen_memcpy_lg_align\");\n    builtinFuncs.push_back(\"__gen_memcpy_lp_align\");\n    builtinFuncs.push_back(\"__gen_memcpy_ll_align\");\n    builtinFuncs.push_back(\"__gen_memset_p_align\");\n    builtinFuncs.push_back(\"__gen_memset_g_align\");\n    builtinFuncs.push_back(\"__gen_memset_l_align\");\n\n    builtinFuncs.push_back(\"__gen_memcpy_pc\");\n    builtinFuncs.push_back(\"__gen_memcpy_gc\");\n    builtinFuncs.push_back(\"__gen_memcpy_lc\");\n\n    builtinFuncs.push_back(\"__gen_memcpy_pc_align\");\n    builtinFuncs.push_back(\"__gen_memcpy_gc_align\");\n    builtinFuncs.push_back(\"__gen_memcpy_lc_align\");\n\n    for (Module::iterator SF = mod->begin(), E = mod->end(); SF != E; ++SF) {\n      if (SF->isDeclaration()) continue;\n      if (!isKernelFunction(*SF)) continue;\n      kernels.push_back(SF->getName().data());\n\n      if (!materializedFuncCall(*mod, *clonedLib, *SF, materializedFuncs)) {\n        delete clonedLib;\n        return NULL;\n      }\n    }\n\n    if (kernels.empty()) {\n      printf(\"One module without kernel function!\\n\");\n      delete clonedLib;\n      return NULL;\n    }\n\n    for (auto &f : builtinFuncs) {\n      const std::string fnName(f);\n      if (!materializedFuncs.insert(fnName).second) {\n        continue;\n      }\n\n      llvm::Function *newMF = clonedLib->getFunction(fnName);\n      if (!newMF) {\n        printf(\"Can not find the function: %s\\n\", fnName.c_str());\n        delete clonedLib;\n        return NULL;\n      }\n      std::string ErrInfo;\/\/ = \"Not Materializable\";\n      if (newMF->isMaterializable()) {\n#if LLVM_VERSION_MAJOR == 3 && LLVM_VERSION_MINOR <= 5\n        if (newMF->Materialize(&ErrInfo)) {\n          printf(\"Can not materialize the function: %s, because %s\\n\", fnName.c_str(), ErrInfo.c_str());\n          delete clonedLib;\n          return NULL;\n        }\n      }\n#else\n        if (std::error_code EC = newMF->materialize()) {\n          printf(\"Can not materialize the function: %s, because %s\\n\", fnName.c_str(), EC.message().c_str());\n          delete clonedLib;\n          return NULL;\n        }\n      }\n#endif\n\n      if (!materializedFuncCall(*mod, *clonedLib, *newMF, materializedFuncs)) {\n        delete clonedLib;\n        return NULL;\n      }\n\n      kernels.push_back(f);\n    }\n\n    \/* We use beignet's bitcode as dst because it will have a lot of\n       lazy functions which will not be loaded. *\/\n    char* errorMsg;\n#if LLVM_VERSION_MAJOR == 3 && LLVM_VERSION_MINOR <= 5\n    if(LLVMLinkModules(wrap(clonedLib), wrap(mod), LLVMLinkerDestroySource, &errorMsg)) {\n#else\n    if(LLVMLinkModules(wrap(clonedLib), wrap(mod), 0, &errorMsg)) {\n#endif\n      delete clonedLib;\n      printf(\"Fatal Error: link the bitcode error:\\n%s\\n\", errorMsg);\n      return NULL;\n    }\n\n    llvm::PassManager passes;\n\n    passes.add(createInternalizePass(kernels));\n    passes.add(createGlobalDCEPass());\n\n    passes.run(*clonedLib);\n\n    return clonedLib;\n  }\n\n} \/\/ end namespace\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>OBJ_LOADER_DEMO: Allow TiledCull to show all the gbuffers<commit_after><|endoftext|>"}
{"text":"<commit_before>#include <string>\n#include <vector>\n\n#include <ros\/ros.h>\n#include <moveit\/move_group_interface\/move_group.h>\n#include <moveit\/robot_trajectory\/robot_trajectory.h>\n#include <moveit\/trajectory_processing\/iterative_time_parameterization.h>\n#include <tf2_ros\/transform_listener.h>\n\n#include <geometry_msgs\/Pose.h>\n#include <geometry_msgs\/Point.h>\n#include <geometry_msgs\/TransformStamped.h>\n#include <moveit_msgs\/RobotTrajectory.h>\n\nclass MoveGroupInterface {\n  moveit::planning_interface::MoveGroup move_group_;\n\n  tf2_ros::Buffer buffer_;\n  tf2_ros::TransformListener listener_;\n\n  geometry_msgs::Pose tomapo_;\n  std::vector<geometry_msgs::Pose> waypoints_;\n\n  static constexpr double eef_length_ {0.3}; \/\/ TODO\n  static constexpr double eef_step_ {0.10};\n\n  static constexpr double abs_rail_length_ {5.0};\n  double sign_;\n\npublic:\n  MoveGroupInterface(const std::string& group_name, const double& joint_tolerance)\n    : move_group_ {group_name},\n      buffer_ {},\n      listener_ {buffer_},\n      tomapo_ {},\n      waypoints_ {},\n      sign_ {1.0}\n  {\n    move_group_.allowReplanning(true);\n    move_group_.setGoalJointTolerance(joint_tolerance);\n    move_group_.setPlanningTime(5.0);\n  }\n\n  bool queryTargetExistence()\n  {\n    try {\n      geometry_msgs::TransformStamped transform_stamped_ {buffer_.lookupTransform(\"rail\", \"tomato\", ros::Time(0), ros::Duration(1.0))};\n      tomapo_.position.x = transform_stamped_.transform.translation.x;\n      tomapo_.position.y = transform_stamped_.transform.translation.y;\n      tomapo_.position.z = transform_stamped_.transform.translation.z;\n      tomapo_.orientation.x = 0;\n      tomapo_.orientation.y = 0;\n      tomapo_.orientation.z = 0;\n      tomapo_.orientation.w = 1.0;\n      return true;\n    } catch (const tf2::TransformException& ex) {\n      ROS_INFO_STREAM(ex.what());\n      return false;\n    }\n  }\n\n  bool startSequence()\n  {\n    waypoints_.clear();\n\n    geometry_msgs::Pose pose1 {tomapo_};\n    pose1.position.x -= eef_length_;\n    \/\/ waypoints_.push_back(pose1);\n    move_group_.setPoseTarget(pose1);\n\n    moveit::planning_interface::MoveGroup::Plan plan;\n    move_group_.plan(plan);\n    if (!move_group_.execute(plan)) return false;\n\n    geometry_msgs::Pose pose2 {tomapo_};\n    waypoints_.push_back(pose2);\n\n    geometry_msgs::Pose pose3 {tomapo_};\n    pose3.orientation = tf::createQuaternionMsgFromRollPitchYaw(1.0, 0, 0);\n    waypoints_.push_back(pose3);\n\n    geometry_msgs::Pose pose4 {tomapo_};\n    pose4.position.x -= eef_length_;\n    waypoints_.push_back(pose4);\n\n    moveit_msgs::RobotTrajectory trajectory_msgs_;\n    move_group_.computeCartesianPath(waypoints_, eef_step_, 0.0, trajectory_msgs_);\n\n    robot_trajectory::RobotTrajectory robot_trajectory_ {move_group_.getCurrentState()->getRobotModel(), move_group_.getName()};\n    robot_trajectory_.setRobotTrajectoryMsg(*move_group_.getCurrentState(), trajectory_msgs_);\n\n    trajectory_processing::IterativeParabolicTimeParameterization iptp;\n    iptp.computeTimeStamps(robot_trajectory_);\n\n    robot_trajectory_.getRobotTrajectoryMsg(trajectory_msgs_);\n\n    moveit::planning_interface::MoveGroup::Plan motion_plan_;\n    motion_plan_.trajectory_ = trajectory_msgs_;\n\n    return move_group_.execute(motion_plan_);\n  }\n\n  bool shift()\n  {\n    double tmp;\n\n    try {\n      geometry_msgs::TransformStamped transform_stamped {buffer_.lookupTransform(\"rail\", \"shaft\", ros::Time(0), ros::Duration(1.0))};\n      tmp = transform_stamped.transform.translation.y;\n      if (tmp > (abs_rail_length_ - 1.0)) sign_ = -1.0;\n      else if (tmp < -(abs_rail_length_ - 1.0)) sign_ = 1.0;\n    } catch (const tf2::TransformException& ex) {\n      ROS_INFO_STREAM(ex.what());\n      return false;\n    }\n\n    \/\/ auto named_target_values = move_group_.getNamedTargetValues(\"init\");\n    \/\/ named_target_values[\"rail_to_shaft_joint\"] += (sign_ * 1.0);\n    \/\/ move_group_.setJointValueTarget(named_target_values);\n\n    \/\/ move_group_.setNamedTarget(\"init\");\n\n    std::vector<double> joint_values = move_group_.getCurrentJointValues();\n    \/\/ auto joint_model_group = move_group_.getCurrentState()->getRobotModel()->getJointModelGroup(move_group_.getName());\n    \/\/ move_group_.getCurrentState()->copyJointGroupPositions(joint_model_group, joint_values);\n\n    \/\/ joint_values[0] += sign_ * 1.0;\n    \/\/ joint_values[1] = -0.3927;\n    joint_values[1] =  0;\n    joint_values[2] = -0.7854;\n    joint_values[3] =  1.5707;\n    joint_values[4] = -0.7854;\n    joint_values[5] =  0;\n\n    move_group_.setJointValueTarget(joint_values);\n    moveit::planning_interface::MoveGroup::Plan plan;\n    move_group_.plan(plan);\n\n    move_group_.execute(plan);\n\n    joint_values[0] += sign_ * 1.0;\n    \/\/ joint_values[1] = -0.3927;\n    joint_values[1] =  0;\n    joint_values[2] = -0.7854;\n    joint_values[3] =  1.5707;\n    joint_values[4] = -0.7854;\n    joint_values[5] =  0;\n\n    move_group_.setJointValueTarget(joint_values);\n    \/\/ moveit::planning_interface::MoveGroup::Plan plan;\n    move_group_.plan(plan);\n\n    return move_group_.execute(plan);\n  }\n};\n\nint main(int argc, char** argv)\n{\n  ros::init(argc, argv, \"arcsys2_move_group_interface_node\");\n  ros::NodeHandle node_handle {\"~\"};\n\n  ros::AsyncSpinner spinner {1};\n  spinner.start();\n\n  MoveGroupInterface interface {\"arcsys2\", node_handle.param(\"joint_tolerance\", 0.1)};\n\n  while (ros::ok()) {\n    while (!interface.queryTargetExistence()) interface.shift();\n    interface.startSequence();\n  }\n\n  spinner.stop();\n\n  return 0;\n}\n<commit_msg>Comment-out unneeded code<commit_after>#include <string>\n#include <vector>\n\n#include <ros\/ros.h>\n#include <moveit\/move_group_interface\/move_group.h>\n#include <moveit\/robot_trajectory\/robot_trajectory.h>\n#include <moveit\/trajectory_processing\/iterative_time_parameterization.h>\n#include <tf2_ros\/transform_listener.h>\n\n#include <geometry_msgs\/Pose.h>\n#include <geometry_msgs\/Point.h>\n#include <geometry_msgs\/TransformStamped.h>\n#include <moveit_msgs\/RobotTrajectory.h>\n\nclass MoveGroupInterface {\n  moveit::planning_interface::MoveGroup move_group_;\n\n  tf2_ros::Buffer buffer_;\n  tf2_ros::TransformListener listener_;\n\n  geometry_msgs::Pose tomapo_;\n  std::vector<geometry_msgs::Pose> waypoints_;\n\n  static constexpr double eef_length_ {0.3}; \/\/ TODO\n  static constexpr double eef_step_ {0.10};\n\n  static constexpr double abs_rail_length_ {5.0};\n  double sign_;\n\npublic:\n  MoveGroupInterface(const std::string& group_name, const double& joint_tolerance)\n    : move_group_ {group_name},\n      buffer_ {},\n      listener_ {buffer_},\n      tomapo_ {},\n      waypoints_ {},\n      sign_ {1.0}\n  {\n    move_group_.allowReplanning(true);\n    move_group_.setGoalJointTolerance(joint_tolerance);\n    move_group_.setPlanningTime(5.0);\n  }\n\n  bool queryTargetExistence()\n  {\n    try {\n      geometry_msgs::TransformStamped transform_stamped_ {buffer_.lookupTransform(\"rail\", \"tomato\", ros::Time(0), ros::Duration(1.0))};\n      tomapo_.position.x = transform_stamped_.transform.translation.x;\n      tomapo_.position.y = transform_stamped_.transform.translation.y;\n      tomapo_.position.z = transform_stamped_.transform.translation.z;\n      tomapo_.orientation.x = 0;\n      tomapo_.orientation.y = 0;\n      tomapo_.orientation.z = 0;\n      tomapo_.orientation.w = 1.0;\n      return true;\n    } catch (const tf2::TransformException& ex) {\n      ROS_INFO_STREAM(ex.what());\n      return false;\n    }\n  }\n\n  bool startSequence()\n  {\n    waypoints_.clear();\n\n    geometry_msgs::Pose pose1 {tomapo_};\n    pose1.position.x -= eef_length_;\n    \/\/ waypoints_.push_back(pose1);\n    move_group_.setPoseTarget(pose1);\n\n    moveit::planning_interface::MoveGroup::Plan plan;\n    move_group_.plan(plan);\n    if (!move_group_.execute(plan)) return false;\n\n    geometry_msgs::Pose pose2 {tomapo_};\n    waypoints_.push_back(pose2);\n\n    geometry_msgs::Pose pose3 {tomapo_};\n    pose3.orientation = tf::createQuaternionMsgFromRollPitchYaw(1.0, 0, 0);\n    waypoints_.push_back(pose3);\n\n    geometry_msgs::Pose pose4 {tomapo_};\n    pose4.position.x -= eef_length_;\n    waypoints_.push_back(pose4);\n\n    moveit_msgs::RobotTrajectory trajectory_msgs_;\n    move_group_.computeCartesianPath(waypoints_, eef_step_, 0.0, trajectory_msgs_);\n\n    robot_trajectory::RobotTrajectory robot_trajectory_ {move_group_.getCurrentState()->getRobotModel(), move_group_.getName()};\n    robot_trajectory_.setRobotTrajectoryMsg(*move_group_.getCurrentState(), trajectory_msgs_);\n\n    trajectory_processing::IterativeParabolicTimeParameterization iptp;\n    iptp.computeTimeStamps(robot_trajectory_);\n\n    robot_trajectory_.getRobotTrajectoryMsg(trajectory_msgs_);\n\n    moveit::planning_interface::MoveGroup::Plan motion_plan_;\n    motion_plan_.trajectory_ = trajectory_msgs_;\n\n    return move_group_.execute(motion_plan_);\n  }\n\n  bool shift()\n  {\n    double tmp;\n\n    try {\n      geometry_msgs::TransformStamped transform_stamped {buffer_.lookupTransform(\"rail\", \"shaft\", ros::Time(0), ros::Duration(1.0))};\n      tmp = transform_stamped.transform.translation.y;\n      if (tmp > (abs_rail_length_ - 1.0)) sign_ = -1.0;\n      else if (tmp < -(abs_rail_length_ - 1.0)) sign_ = 1.0;\n    } catch (const tf2::TransformException& ex) {\n      ROS_INFO_STREAM(ex.what());\n      return false;\n    }\n\n    \/\/ auto named_target_values = move_group_.getNamedTargetValues(\"init\");\n    \/\/ named_target_values[\"rail_to_shaft_joint\"] += (sign_ * 1.0);\n    \/\/ move_group_.setJointValueTarget(named_target_values);\n\n    \/\/ move_group_.setNamedTarget(\"init\");\n\n    std::vector<double> joint_values {move_group_.getCurrentJointValues()};\n\n    \/\/ joint_values[0] += sign_ * 1.0;\n    \/\/ joint_values[1] = -0.3927;\n    \/\/ joint_values[1] =  0;\n    joint_values[2] = -0.7854;\n    joint_values[3] =  1.5707;\n    joint_values[4] = -0.7854;\n    joint_values[5] =  0;\n\n    move_group_.setJointValueTarget(joint_values);\n    moveit::planning_interface::MoveGroup::Plan plan;\n    move_group_.plan(plan);\n\n    move_group_.execute(plan);\n\n    joint_values[0] += sign_ * 1.0;\n    \/\/ joint_values[1] = -0.3927;\n    \/\/ joint_values[1] =  0;\n    \/\/ joint_values[2] = -0.7854;\n    \/\/ joint_values[3] =  1.5707;\n    \/\/ joint_values[4] = -0.7854;\n    \/\/ joint_values[5] =  0;\n\n    move_group_.setJointValueTarget(joint_values);\n    \/\/ moveit::planning_interface::MoveGroup::Plan plan;\n    move_group_.plan(plan);\n\n    return move_group_.execute(plan);\n  }\n};\n\nint main(int argc, char** argv)\n{\n  ros::init(argc, argv, \"arcsys2_move_group_interface_node\");\n  ros::NodeHandle node_handle {\"~\"};\n\n  ros::AsyncSpinner spinner {1};\n  spinner.start();\n\n  MoveGroupInterface interface {\"arcsys2\", node_handle.param(\"joint_tolerance\", 0.1)};\n\n  while (ros::ok()) {\n    while (!interface.queryTargetExistence()) interface.shift();\n    interface.startSequence();\n  }\n\n  spinner.stop();\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2022 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 <string>\n#include \"optick\/optick.h\"\n#include \"..\/common\/common.hh\"\n#include \"..\/common\/python_helper.hh\"\n\nclass OptickProfiler final : public common::Singleton<OptickProfiler> {\npublic:\n  inline void startup(short listen_port = 8099) noexcept {\n    Optick::SetDefaultPort(listen_port);\n  }\n\n  inline void push_event(const std::string& funcname, const std::string& filename, int lineno) noexcept {\n    Optick::EventDescription* desc = Optick::CreateDescription(funcname.c_str(), filename.c_str(), lineno);\n    if (desc != nullptr)\n      desc->color = static_cast<std::uint32_t>(Optick::Color::GoldenRod);\n    Optick::Event::Push(*desc);\n  }\n\n  inline void pop_event() noexcept { Optick::Event::Pop(); }\n  inline void frame_event() noexcept { OPTICK_FRAME(\"Optick.Python\"); }\n};\n\nstatic int _pprofile_tracefunc(PyObject* obj, PyFrameObject* frame, int what, PyObject* arg) {\n  switch (what) {\n  case PyTrace_CALL:\n    {\n      PyCodeObject* funccode = frame->f_code;\n      auto [funcname, filename] = python_helper::get_from_call(funccode);\n      OptickProfiler::get_instance().push_event(funcname, filename, funccode->co_firstlineno);\n    } break;\n  case PyTrace_C_CALL:\n    if (PyCFunction_Check(arg)) {\n      PyCFunctionObject* fn = reinterpret_cast<PyCFunctionObject*>(arg);\n      auto [funcname, filename] = python_helper::get_from_ccall(fn);\n      OptickProfiler::get_instance().push_event(funcname, filename, 0);\n    } break;\n  case PyTrace_RETURN:\n  case PyTrace_C_RETURN:\n    OptickProfiler::get_instance().pop_event();\n    break;\n  case PyTrace_C_EXCEPTION:\n    if (PyCFunction_Check(arg))\n      OptickProfiler::get_instance().pop_event();\n    break;\n  default: break;\n  }\n  return 0;\n}\n\nstatic PyObject* _pprofile_startup(PyObject* obj, PyObject* args, PyObject* kwds) {\n  (void)obj, (void)args;\n\n  static char* kwdslist[] = {(char*)\"port\", nullptr};\n\n  int listen_port = 8099;\n  if (!PyArg_ParseTupleAndKeywords(args, kwds, \"|i:startup\", kwdslist, &listen_port))\n    return nullptr;\n\n  OptickProfiler::get_instance().startup(static_cast<short>(listen_port));\n  Py_RETURN_NONE;\n}\n\nstatic PyObject* _pprofile_enable(PyObject* obj,  PyObject* args) {\n  (void)obj, (void)args;\n\n  PyEval_SetProfile(_pprofile_tracefunc, nullptr);\n  Py_RETURN_NONE;\n}\n\nstatic PyObject* _pprofile_disable(PyObject* obj, PyObject* args) {\n  (void)obj, (void)args;\n\n  PyEval_SetProfile(nullptr, nullptr);\n  Py_RETURN_NONE;\n}\n\nstatic PyObject* _pprofile_frame(PyObject* obj, PyObject* args) {\n  (void)obj, (void)args;\n\n  OptickProfiler::get_instance().frame_event();\n  Py_RETURN_NONE;\n}\n\nPyMODINIT_FUNC PyInit_cpprofile() {\n  static PyMethodDef _pprofile_methods[] = {\n    {\"startup\", (PyCFunction)_pprofile_startup, METH_VARARGS | METH_KEYWORDS, \"cpprofile.startup(port=8099) -> None\"},\n    {\"enable\", _pprofile_enable, METH_NOARGS, \"cpprofile.enable() -> None\"},\n    {\"disable\", _pprofile_disable, METH_NOARGS, \"cpprofile.disable() -> None\"},\n    {\"frame\", _pprofile_frame, METH_NOARGS, \"cpprofile.frame() -> None\"},\n    {nullptr},\n  };\n  static PyModuleDef _pprofile_module = {\n    PyModuleDef_HEAD_INIT,\n    \"cpprofile\", \/\/ m_name\n    \"CXX profile with Optick binding\", \/\/ m_doc\n    -1, \/\/ m_size\n    _pprofile_methods, \/\/ m_methods\n    nullptr, \/\/ m_reload\n    nullptr, \/\/ m_traverse\n    nullptr, \/\/ m_clear\n    nullptr, \/\/ m_free\n  };\n\n  return PyModule_Create(&_pprofile_module);\n}\n<commit_msg>:construction: chore(profile): updated the implementation of profile with optick binding<commit_after>\/\/ Copyright (c) 2022 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 <string>\n#include \"optick\/optick.h\"\n#include \"..\/common\/common.hh\"\n#include \"..\/common\/python_helper.hh\"\n\nclass OptickProfiler final : public common::Singleton<OptickProfiler> {\npublic:\n  inline void startup(short listen_port = 8099) noexcept {\n    Optick::SetDefaultPort(listen_port);\n  }\n\n  inline void push_event(const std::string& funcname, const std::string& filename, int lineno) noexcept {\n    Optick::EventDescription* desc = Optick::CreateDescription(funcname.c_str(), filename.c_str(), lineno);\n    if (desc != nullptr)\n      desc->color = static_cast<std::uint32_t>(Optick::Color::GoldenRod);\n    Optick::Event::Push(*desc);\n  }\n\n  inline void pop_event() noexcept { Optick::Event::Pop(); }\n  inline void frame_event() noexcept { OPTICK_FRAME(\"Optick.Python\"); }\n};\n\nstatic int _pprofile_tracefunc(PyObject* obj, PyFrameObject* frame, int what, PyObject* arg) {\n  switch (what) {\n  case PyTrace_CALL:\n    {\n      PyCodeObject* funccode = frame->f_code;\n      auto [funcname, filename] = python_helper::get_from_call(funccode);\n      OptickProfiler::get_instance().push_event(funcname, filename, funccode->co_firstlineno);\n    } break;\n  case PyTrace_C_CALL:\n    if (PyCFunction_Check(arg)) {\n      PyCFunctionObject* fn = reinterpret_cast<PyCFunctionObject*>(arg);\n      auto [funcname, filename] = python_helper::get_from_ccall(fn);\n      OptickProfiler::get_instance().push_event(funcname, filename, 0);\n    } break;\n  case PyTrace_RETURN:\n  case PyTrace_C_RETURN:\n    OptickProfiler::get_instance().pop_event();\n    break;\n  case PyTrace_C_EXCEPTION:\n    if (PyCFunction_Check(arg))\n      OptickProfiler::get_instance().pop_event();\n    break;\n  default: break;\n  }\n  return 0;\n}\n\nstatic PyObject* _pprofile_startup(PyObject* obj, PyObject* args, PyObject* kwds) {\n  (void)obj;\n\n  static char* kwdslist[] = {(char*)\"port\", nullptr};\n\n  int listen_port = 8099;\n  if (!PyArg_ParseTupleAndKeywords(args, kwds, \"|i:startup\", kwdslist, &listen_port))\n    return nullptr;\n\n  OptickProfiler::get_instance().startup(static_cast<short>(listen_port));\n  Py_RETURN_NONE;\n}\n\nstatic PyObject* _pprofile_enable(PyObject* obj,  PyObject* args) {\n  (void)obj, (void)args;\n\n  PyEval_SetProfile(_pprofile_tracefunc, nullptr);\n  Py_RETURN_NONE;\n}\n\nstatic PyObject* _pprofile_disable(PyObject* obj, PyObject* args) {\n  (void)obj, (void)args;\n\n  PyEval_SetProfile(nullptr, nullptr);\n  Py_RETURN_NONE;\n}\n\nstatic PyObject* _pprofile_frame(PyObject* obj, PyObject* args) {\n  (void)obj, (void)args;\n\n  OptickProfiler::get_instance().frame_event();\n  Py_RETURN_NONE;\n}\n\nPyMODINIT_FUNC PyInit_cpprofile() {\n  static PyMethodDef _pprofile_methods[] = {\n    {\"startup\", (PyCFunction)_pprofile_startup, METH_VARARGS | METH_KEYWORDS, \"cpprofile.startup(port: int = 8099) -> None\"},\n    {\"enable\", _pprofile_enable, METH_NOARGS, \"cpprofile.enable() -> None\"},\n    {\"disable\", _pprofile_disable, METH_NOARGS, \"cpprofile.disable() -> None\"},\n    {\"frame\", _pprofile_frame, METH_NOARGS, \"cpprofile.frame() -> None\"},\n    {nullptr},\n  };\n  static PyModuleDef _pprofile_module = {\n    PyModuleDef_HEAD_INIT,\n    \"cpprofile\", \/\/ m_name\n    \"CXX profile with Optick binding\", \/\/ m_doc\n    -1, \/\/ m_size\n    _pprofile_methods, \/\/ m_methods\n    nullptr, \/\/ m_reload\n    nullptr, \/\/ m_traverse\n    nullptr, \/\/ m_clear\n    nullptr, \/\/ m_free\n  };\n\n  return PyModule_Create(&_pprofile_module);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright (c) 2017, EPL-Vizards\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 EPL-Vizards 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 COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\r\n * ANY 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 EPL-Vizards 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 * \\file DefaultPluginEditor.cpp\r\n *\/\r\n\r\n#include \"DefaultPluginEditor.hpp\"\r\n\r\nDefaultPluginEditor::DefaultPluginEditor(PluginEditorWidget *parent) : PluginEditorBase(parent) {\r\n  layout = new QGridLayout(this);\r\n}\r\n\r\nDefaultPluginEditor::~DefaultPluginEditor() {}\r\n\r\nvoid DefaultPluginEditor::createWidget() {\r\n  if (!widget) {\r\n    \/\/ The widget does not yet exist, create a new one\r\n    widget = new QPlainTextEdit(this);\r\n    layout->addWidget(widget);\r\n    connect(widget->document(), SIGNAL(modificationChanged(bool)), this, SLOT(modified()));\r\n  }\r\n\r\n  widget->document()->setPlainText(contents[current]);\r\n\r\n  \/\/ Check if the file was dirty\r\n  if (!dirtyFiles.contains(current)) {\r\n    widget->document()->setModified(false); \/\/ Setting the text of the editor modifies it\r\n  }\r\n}\r\n\r\nvoid DefaultPluginEditor::updateStatusBar(bool enabled) { (void)enabled; }\r\n\r\nvoid DefaultPluginEditor::openConfig() {\r\n  QMessageBox::information(0, \"Info\", tr(\"There is currently no configuration for this editor\"));\r\n}\r\n\r\nvoid DefaultPluginEditor::selectDocument(QString plugin) {\r\n  if (widget) {\r\n    \/\/ Check if the file is dirty\r\n    if (widget->document()->isModified() && !dirtyFiles.contains(current)) {\r\n      dirtyFiles.append(current);\r\n      contents[current] = widget->document()->toPlainText(); \/\/ Also stash the changes\r\n    }\r\n  }\r\n  current = plugin;\r\n  createWidget();\r\n}\r\n\r\nvoid DefaultPluginEditor::closeDocument(QString name) {\r\n  \/\/ Only try to close if the editor is open\r\n  if (!widget)\r\n    return;\r\n\r\n  if (dirtyFiles.contains(name)) {\r\n    \/\/ TODO Add notification to make sure the user keeps his changes\r\n\r\n    dirtyFiles.removeOne(name);\r\n  }\r\n\r\n  files.remove(name);\r\n  contents.remove(name);\r\n\r\n  current = QString();\r\n  layout->removeWidget(widget);\r\n  delete widget;\r\n  widget = nullptr;\r\n}\r\n\r\nvoid DefaultPluginEditor::openDocument(QUrl file) {\r\n  QFileInfo fileInfo(file.toLocalFile());\r\n  QString   fileName;\r\n  QString   filePath;\r\n\r\n  if (fileInfo.exists() && fileInfo.isFile()) {\r\n    fileName = fileInfo.fileName();\r\n    filePath = fileInfo.filePath();\r\n\r\n    files.insert(fileName, filePath);\r\n  } else {\r\n    QMessageBox::critical(0, \"Error\", tr(\"Could not open file '%1'.\").arg(filePath));\r\n    return;\r\n  }\r\n\r\n  QFile f(filePath);\r\n\r\n  if (!f.open(QIODevice::ReadOnly | QIODevice::Text)) {\r\n    QMessageBox::critical(0, \"Error\", tr(\"Could not open file '%1'.\").arg(filePath));\r\n    return;\r\n  }\r\n\r\n  QTextStream in(&f);\r\n\r\n  contents.insert(fileName, in.readAll());\r\n  current = fileName;\r\n\r\n  createWidget();\r\n}\r\n\r\nvoid DefaultPluginEditor::cleanUp() {\r\n  QMessageBox  msg(this);\r\n  QPushButton *saveButton       = msg.addButton(\"Save\", QMessageBox::ActionRole);\r\n  QPushButton *saveAllButton    = msg.addButton(\"Save All\", QMessageBox::ActionRole);\r\n  QPushButton *discardButton    = msg.addButton(\"Discard\", QMessageBox::ActionRole);\r\n  QPushButton *discardAllButton = msg.addButton(\"Discard All\", QMessageBox::ActionRole);\r\n\r\n\r\n  msg.setInformativeText(\"Would you like to save them?\");\r\n  msg.setDefaultButton(saveAllButton);\r\n\r\n  bool saveAll = false;\r\n\r\n  \/\/ Since dirty files are only acknowledged when \"stashing them\", check if the current file is dirty\r\n  if (widget && !dirtyFiles.contains(current) && widget->document()->isModified()) {\r\n    dirtyFiles.append(current);\r\n  }\r\n\r\n  QList<QString> list = dirtyFiles;\r\n\r\n  for (QString file : list) {\r\n    if (saveAll) {\r\n      current = file;\r\n      save();\r\n      continue;\r\n    }\r\n\r\n    msg.setText(\"The file '\" + file + \"' has unsaved changes.\");\r\n\r\n    msg.exec();\r\n\r\n    QPushButton *clicked = dynamic_cast<QPushButton *>(msg.clickedButton());\r\n\r\n    if (clicked == saveButton) {\r\n      \/\/ Save the changes to this document\r\n      current = file;\r\n      save();\r\n      continue;\r\n    } else if (clicked == saveAllButton) {\r\n      \/\/ Save the changes to this document and remember the choice\r\n      current = file;\r\n      save();\r\n      saveAll = true;\r\n      continue;\r\n    } else if (clicked == discardButton) {\r\n      \/\/ Discard changes for current document\r\n      continue;\r\n    } else if (clicked == discardAllButton) {\r\n      \/\/ Discard all changes\r\n      break;\r\n    }\r\n  }\r\n\r\n  QMap<QString, QString> savedFiles;\r\n\r\n  \/\/ Destroy all documents and add them to the map of saved plugins\r\n  for (QString file : files.keys()) {\r\n    QString localFile = files[file];\r\n\r\n    if (!dirtyFiles.contains(file)) {\r\n      if (QFile::exists(localFile)) {\r\n        savedFiles.insert(file, localFile);\r\n      }\r\n    }\r\n  }\r\n\r\n\r\n  emit pluginsSaved(savedFiles);\r\n  files.clear();\r\n  contents.clear();\r\n  dirtyFiles.clear();\r\n  current = QString();\r\n  layout->removeWidget(widget);\r\n  delete widget;\r\n  widget     = nullptr;\r\n  newCounter = 1;\r\n}\r\n\r\nvoid DefaultPluginEditor::writeToFile(QString filePath) {\r\n\r\n  QFile file(filePath);\r\n\r\n  contents[current] = widget->document()->toPlainText();\r\n\r\n  \/\/ Try to open the file write-only, truncating any previous contents\r\n  if (file.open(QIODevice::WriteOnly | QIODevice::Truncate | QIODevice::Text)) {\r\n    QTextStream out(&file);\r\n\r\n    \/\/ Write the current editors content to the file\r\n    out << contents[current] << \"\\n\";\r\n\r\n    file.close();\r\n    emit modifiedChanged(false); \/\/ The file is now saved\r\n\r\n    dirtyFiles.removeOne(current);\r\n  } else {\r\n    QMessageBox::critical(0, \"Error\", tr(\"Could not save to file '%1'.\").arg(filePath));\r\n  }\r\n}\r\n\r\nvoid DefaultPluginEditor::save() {\r\n  \/\/ Abort when the editor is not open\r\n  if (!widget)\r\n    return;\r\n\r\n  QString filePath = files[current];\r\n\r\n  \/\/ If the file is not yet saved, save as instead\r\n  if (filePath == QString()) {\r\n    saveAs();\r\n    return;\r\n  }\r\n\r\n  writeToFile(filePath);\r\n}\r\n\r\nvoid DefaultPluginEditor::saveAs() {\r\n  \/\/ Abort when the editor is not open\r\n  if (!widget)\r\n    return;\r\n\r\n  \/\/ Ask for a file to save to\r\n  QString filePath =\r\n        QFileDialog::getSaveFileName(this, tr(\"Save Document\"), \"\", tr(\"Python files (*.py);;All Files (*)\"));\r\n\r\n  \/\/ Check if user selected a file\r\n  if (filePath == QString::null)\r\n    return;\r\n\r\n  writeToFile(filePath);\r\n\r\n  \/\/ Check if the name or path changed\r\n  QFileInfo fileInfo(filePath);\r\n\r\n  if (fileInfo.exists() && fileInfo.isFile()) {\r\n    QString newName = fileInfo.fileName();\r\n\r\n    \/\/ Check if the path changed\r\n    if (filePath != files[current]) {\r\n\r\n      \/\/ A name change can only occur when the path changes\r\n      if (newName != current) {\r\n        QString content = contents[current]; \/\/ Keep content\r\n\r\n        files.remove(current); \/\/ Remove the entry as the key is invalid\r\n\r\n        \/\/ Check if file was marked as dirty\r\n        if (dirtyFiles.contains(current)) {\r\n          dirtyFiles.removeOne(current);\r\n        }\r\n\r\n        current = newName;\r\n\r\n        files.insert(current, filePath);\r\n        contents.insert(current, content);\r\n        nameChange();\r\n      } else {\r\n        files[current] = filePath; \/\/ Update the file path\r\n      }\r\n\r\n      urlChange();\r\n    }\r\n  }\r\n}\r\n\r\nvoid DefaultPluginEditor::newDocument() {\r\n  if (newCounter > 1)\r\n    current = QString(\"Untitled (%1)\").arg(newCounter);\r\n  else\r\n    current = \"Untitled\";\r\n  newCounter++;\r\n\r\n  files.insert(current, QString());\r\n  contents.insert(current, QString());\r\n\r\n  createWidget();\r\n  widget->document()->setModified(false);\r\n}\r\n\r\nvoid DefaultPluginEditor::modified() { emit modifiedChanged(widget->document()->isModified()); }\r\n\r\nvoid DefaultPluginEditor::nameChange() { emit nameChanged(current); }\r\n\r\nvoid DefaultPluginEditor::urlChange() { emit urlChanged(files[current]); }\r\n<commit_msg>Added dialog box for closing a dirty file in the default plugin editor<commit_after>\/* Copyright (c) 2017, EPL-Vizards\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 EPL-Vizards 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 COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\r\n * ANY 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 EPL-Vizards 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 * \\file DefaultPluginEditor.cpp\r\n *\/\r\n\r\n#include \"DefaultPluginEditor.hpp\"\r\n\r\nDefaultPluginEditor::DefaultPluginEditor(PluginEditorWidget *parent) : PluginEditorBase(parent) {\r\n  layout = new QGridLayout(this);\r\n}\r\n\r\nDefaultPluginEditor::~DefaultPluginEditor() {}\r\n\r\nvoid DefaultPluginEditor::createWidget() {\r\n  if (!widget) {\r\n    \/\/ The widget does not yet exist, create a new one\r\n    widget = new QPlainTextEdit(this);\r\n    layout->addWidget(widget);\r\n    connect(widget->document(), SIGNAL(modificationChanged(bool)), this, SLOT(modified()));\r\n  }\r\n\r\n  widget->document()->setPlainText(contents[current]);\r\n\r\n  \/\/ Check if the file was dirty\r\n  if (!dirtyFiles.contains(current)) {\r\n    widget->document()->setModified(false); \/\/ Setting the text of the editor modifies it\r\n  }\r\n}\r\n\r\nvoid DefaultPluginEditor::updateStatusBar(bool enabled) { (void)enabled; }\r\n\r\nvoid DefaultPluginEditor::openConfig() {\r\n  QMessageBox::information(0, \"Info\", tr(\"There is currently no configuration for this editor\"));\r\n}\r\n\r\nvoid DefaultPluginEditor::selectDocument(QString plugin) {\r\n  if (widget) {\r\n    \/\/ Check if the file is dirty\r\n    if (widget->document()->isModified() && !dirtyFiles.contains(current)) {\r\n      dirtyFiles.append(current);\r\n      contents[current] = widget->document()->toPlainText(); \/\/ Also stash the changes\r\n    }\r\n  }\r\n  current = plugin;\r\n  createWidget();\r\n}\r\n\r\nvoid DefaultPluginEditor::closeDocument(QString name) {\r\n  \/\/ Only try to close if the editor is open\r\n  if (!widget)\r\n    return;\r\n\r\n  \/\/ Check if file is dirty\r\n  if (dirtyFiles.contains(name) || (name == current && widget->document()->isModified())) {\r\n    \/\/ Ask user for further input\r\n    QMessageBox msg(this);\r\n\r\n    QPushButton *saveButton = msg.addButton(\"Save\", QMessageBox::ActionRole);\r\n    msg.addButton(\"Discard\", QMessageBox::ActionRole);\r\n\r\n\r\n    msg.setText(\"The file '\" + name + \"' has unsaved changes.\");\r\n    msg.setInformativeText(\"Would you like to save them?\");\r\n    msg.setDefaultButton(saveButton);\r\n\r\n    \/\/ Open message box\r\n    msg.exec();\r\n\r\n    QPushButton *clicked = dynamic_cast<QPushButton *>(msg.clickedButton());\r\n\r\n    if (clicked == saveButton) {\r\n      \/\/ Save the changes to this document\r\n      save();\r\n    } else {\r\n      \/\/ Discard button was pressed, remove from dirty files\r\n      dirtyFiles.removeOne(name);\r\n    }\r\n  }\r\n\r\n  files.remove(name);\r\n  contents.remove(name);\r\n\r\n  current = QString();\r\n  layout->removeWidget(widget);\r\n  delete widget;\r\n  widget = nullptr;\r\n}\r\n\r\nvoid DefaultPluginEditor::openDocument(QUrl file) {\r\n  QFileInfo fileInfo(file.toLocalFile());\r\n  QString   fileName;\r\n  QString   filePath;\r\n\r\n  if (fileInfo.exists() && fileInfo.isFile()) {\r\n    fileName = fileInfo.fileName();\r\n    filePath = fileInfo.filePath();\r\n\r\n    files.insert(fileName, filePath);\r\n  } else {\r\n    QMessageBox::critical(0, \"Error\", tr(\"Could not open file '%1'.\").arg(filePath));\r\n    return;\r\n  }\r\n\r\n  QFile f(filePath);\r\n\r\n  if (!f.open(QIODevice::ReadOnly | QIODevice::Text)) {\r\n    QMessageBox::critical(0, \"Error\", tr(\"Could not open file '%1'.\").arg(filePath));\r\n    return;\r\n  }\r\n\r\n  QTextStream in(&f);\r\n\r\n  contents.insert(fileName, in.readAll());\r\n  current = fileName;\r\n\r\n  createWidget();\r\n}\r\n\r\nvoid DefaultPluginEditor::cleanUp() {\r\n  QMessageBox  msg(this);\r\n  QPushButton *saveButton       = msg.addButton(\"Save\", QMessageBox::ActionRole);\r\n  QPushButton *saveAllButton    = msg.addButton(\"Save All\", QMessageBox::ActionRole);\r\n  QPushButton *discardButton    = msg.addButton(\"Discard\", QMessageBox::ActionRole);\r\n  QPushButton *discardAllButton = msg.addButton(\"Discard All\", QMessageBox::ActionRole);\r\n\r\n\r\n  msg.setInformativeText(\"Would you like to save them?\");\r\n  msg.setDefaultButton(saveAllButton);\r\n\r\n  bool saveAll = false;\r\n\r\n  \/\/ Since dirty files are only acknowledged when \"stashing them\", check if the current file is dirty\r\n  if (widget && !dirtyFiles.contains(current) && widget->document()->isModified()) {\r\n    dirtyFiles.append(current);\r\n  }\r\n\r\n  QList<QString> list = dirtyFiles;\r\n\r\n  for (QString file : list) {\r\n    if (saveAll) {\r\n      current = file;\r\n      save();\r\n      continue;\r\n    }\r\n\r\n    msg.setText(\"The file '\" + file + \"' has unsaved changes.\");\r\n\r\n    msg.exec();\r\n\r\n    QPushButton *clicked = dynamic_cast<QPushButton *>(msg.clickedButton());\r\n\r\n    if (clicked == saveButton) {\r\n      \/\/ Save the changes to this document\r\n      current = file;\r\n      save();\r\n      continue;\r\n    } else if (clicked == saveAllButton) {\r\n      \/\/ Save the changes to this document and remember the choice\r\n      current = file;\r\n      save();\r\n      saveAll = true;\r\n      continue;\r\n    } else if (clicked == discardButton) {\r\n      \/\/ Discard changes for current document\r\n      continue;\r\n    } else if (clicked == discardAllButton) {\r\n      \/\/ Discard all changes\r\n      break;\r\n    }\r\n  }\r\n\r\n  QMap<QString, QString> savedFiles;\r\n\r\n  \/\/ Destroy all documents and add them to the map of saved plugins\r\n  for (QString file : files.keys()) {\r\n    QString localFile = files[file];\r\n\r\n    if (!dirtyFiles.contains(file)) {\r\n      if (QFile::exists(localFile)) {\r\n        savedFiles.insert(file, localFile);\r\n      }\r\n    }\r\n  }\r\n\r\n\r\n  emit pluginsSaved(savedFiles);\r\n  files.clear();\r\n  contents.clear();\r\n  dirtyFiles.clear();\r\n  current = QString();\r\n  layout->removeWidget(widget);\r\n  delete widget;\r\n  widget     = nullptr;\r\n  newCounter = 1;\r\n}\r\n\r\nvoid DefaultPluginEditor::writeToFile(QString filePath) {\r\n\r\n  QFile file(filePath);\r\n\r\n  contents[current] = widget->document()->toPlainText();\r\n\r\n  \/\/ Try to open the file write-only, truncating any previous contents\r\n  if (file.open(QIODevice::WriteOnly | QIODevice::Truncate | QIODevice::Text)) {\r\n    QTextStream out(&file);\r\n\r\n    \/\/ Write the current editors content to the file\r\n    out << contents[current] << \"\\n\";\r\n\r\n    file.close();\r\n    emit modifiedChanged(false); \/\/ The file is now saved\r\n\r\n    dirtyFiles.removeOne(current);\r\n  } else {\r\n    QMessageBox::critical(0, \"Error\", tr(\"Could not save to file '%1'.\").arg(filePath));\r\n  }\r\n}\r\n\r\nvoid DefaultPluginEditor::save() {\r\n  \/\/ Abort when the editor is not open\r\n  if (!widget)\r\n    return;\r\n\r\n  QString filePath = files[current];\r\n\r\n  \/\/ If the file is not yet saved, save as instead\r\n  if (filePath == QString()) {\r\n    saveAs();\r\n    return;\r\n  }\r\n\r\n  writeToFile(filePath);\r\n}\r\n\r\nvoid DefaultPluginEditor::saveAs() {\r\n  \/\/ Abort when the editor is not open\r\n  if (!widget)\r\n    return;\r\n\r\n  \/\/ Ask for a file to save to\r\n  QString filePath =\r\n        QFileDialog::getSaveFileName(this, tr(\"Save Document\"), \"\", tr(\"Python files (*.py);;All Files (*)\"));\r\n\r\n  \/\/ Check if user selected a file\r\n  if (filePath == QString::null)\r\n    return;\r\n\r\n  writeToFile(filePath);\r\n\r\n  \/\/ Check if the name or path changed\r\n  QFileInfo fileInfo(filePath);\r\n\r\n  if (fileInfo.exists() && fileInfo.isFile()) {\r\n    QString newName = fileInfo.fileName();\r\n\r\n    \/\/ Check if the path changed\r\n    if (filePath != files[current]) {\r\n\r\n      \/\/ A name change can only occur when the path changes\r\n      if (newName != current) {\r\n        QString content = contents[current]; \/\/ Keep content\r\n\r\n        files.remove(current); \/\/ Remove the entry as the key is invalid\r\n\r\n        \/\/ Check if file was marked as dirty\r\n        if (dirtyFiles.contains(current)) {\r\n          dirtyFiles.removeOne(current);\r\n        }\r\n\r\n        current = newName;\r\n\r\n        files.insert(current, filePath);\r\n        contents.insert(current, content);\r\n        nameChange();\r\n      } else {\r\n        files[current] = filePath; \/\/ Update the file path\r\n      }\r\n\r\n      urlChange();\r\n    }\r\n  }\r\n}\r\n\r\nvoid DefaultPluginEditor::newDocument() {\r\n  if (newCounter > 1)\r\n    current = QString(\"Untitled (%1)\").arg(newCounter);\r\n  else\r\n    current = \"Untitled\";\r\n  newCounter++;\r\n\r\n  files.insert(current, QString());\r\n  contents.insert(current, QString());\r\n\r\n  createWidget();\r\n  widget->document()->setModified(false);\r\n}\r\n\r\nvoid DefaultPluginEditor::modified() { emit modifiedChanged(widget->document()->isModified()); }\r\n\r\nvoid DefaultPluginEditor::nameChange() { emit nameChanged(current); }\r\n\r\nvoid DefaultPluginEditor::urlChange() { emit urlChanged(files[current]); }\r\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Added param descrs collection to ackermannize_bv_tactic<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 \"base\/file_util.h\"\n#include \"base\/path_service.h\"\n#include \"build\/build_config.h\"\n#include \"chrome\/common\/chrome_switches.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#include \"webkit\/glue\/plugins\/plugin_switches.h\"\n\nnamespace {\n\n\/\/ Platform-specific filename relative to the chrome executable.\n#if defined(OS_WIN)\nconst wchar_t library_name[] = L\"ppapi_tests.dll\";\n#elif defined(OS_MACOSX)\nconst char library_name[] = \"ppapi_tests.plugin\";\n#elif defined(OS_POSIX)\nconst char library_name[] = \"libppapi_tests.so\";\n#endif\n\n}  \/\/ namespace\n\nclass PPAPITest : public UITest {\n public:\n  PPAPITest() {\n    \/\/ Append the switch to register the pepper plugin.\n    \/\/ library name = <out dir>\/<test_name>.<library_extension>\n    \/\/ MIME type = application\/x-ppapi-<test_name>\n    FilePath plugin_dir;\n    PathService::Get(base::DIR_EXE, &plugin_dir);\n\n    FilePath plugin_lib = plugin_dir.Append(library_name);\n    EXPECT_TRUE(file_util::PathExists(plugin_lib));\n    FilePath::StringType pepper_plugin = plugin_lib.value();\n    pepper_plugin.append(FILE_PATH_LITERAL(\";application\/x-ppapi-tests\"));\n    launch_arguments_.AppendSwitchNative(switches::kRegisterPepperPlugins,\n                                         pepper_plugin);\n\n    \/\/ The test sends us the result via a cookie.\n    launch_arguments_.AppendSwitch(switches::kEnableFileCookies);\n\n    \/\/ Some stuff is hung off of the testing interface which is not enabled\n    \/\/ by default.\n    launch_arguments_.AppendSwitch(switches::kEnablePepperTesting);\n  }\n\n  void RunTest(const std::string& test_case) {\n    FilePath test_path;\n    PathService::Get(base::DIR_SOURCE_ROOT, &test_path);\n    test_path = test_path.Append(FILE_PATH_LITERAL(\"third_party\"));\n    test_path = test_path.Append(FILE_PATH_LITERAL(\"ppapi\"));\n    test_path = test_path.Append(FILE_PATH_LITERAL(\"tests\"));\n    test_path = test_path.Append(FILE_PATH_LITERAL(\"test_case.html\"));\n\n    \/\/ Sanity check the file name.\n    EXPECT_TRUE(file_util::PathExists(test_path));\n\n    GURL::Replacements replacements;\n    replacements.SetQuery(test_case.c_str(),\n                          url_parse::Component(0, test_case.size()));\n    GURL test_url = net::FilePathToFileURL(test_path);\n    RunTestURL(test_url.ReplaceComponents(replacements));\n  }\n\n  void RunTestViaHTTP(const std::string& test_case) {\n    net::TestServer test_server(\n        net::TestServer::TYPE_HTTP,\n        FilePath(FILE_PATH_LITERAL(\"third_party\/ppapi\/tests\")));\n    ASSERT_TRUE(test_server.Start());\n    RunTestURL(test_server.GetURL(\"files\/test_case.html?\" + test_case));\n  }\n\n private:\n  void RunTestURL(const GURL& test_url) {\n    scoped_refptr<TabProxy> tab(GetActiveTab());\n    ASSERT_TRUE(tab.get());\n    ASSERT_TRUE(tab->NavigateToURL(test_url));\n    std::string escaped_value =\n        WaitUntilCookieNonEmpty(tab.get(), test_url,\n            \"COMPLETION_COOKIE\", action_max_timeout_ms());\n    EXPECT_STREQ(\"PASS\", escaped_value.c_str());\n  }\n};\n\nTEST_F(PPAPITest, FAILS_Instance) {\n  RunTest(\"Instance\");\n}\n\n\/\/ http:\/\/crbug.com\/54150\nTEST_F(PPAPITest, FLAKY_Graphics2D) {\n  RunTest(\"Graphics2D\");\n}\n\n\/\/ TODO(brettw) bug 51344: this is flaky on bots. Seems to timeout navigating.\n\/\/ Possibly all the image allocations slow things down on a loaded bot too much.\nTEST_F(PPAPITest, FLAKY_ImageData) {\n  RunTest(\"ImageData\");\n}\n\nTEST_F(PPAPITest, Buffer) {\n  RunTest(\"Buffer\");\n}\n\nTEST_F(PPAPITest, URLLoader) {\n  RunTestViaHTTP(\"URLLoader\");\n}\n\n\/\/ Flaky, http:\/\/crbug.com\/51012\nTEST_F(PPAPITest, FLAKY_PaintAggregator) {\n  RunTestViaHTTP(\"PaintAggregator\");\n}\n\n\/\/ Flaky, http:\/\/crbug.com\/48544.\nTEST_F(PPAPITest, FLAKY_Scrollbar) {\n  RunTest(\"Scrollbar\");\n}\n\nTEST_F(PPAPITest, UrlUtil) {\n  RunTest(\"UrlUtil\");\n}\n\nTEST_F(PPAPITest, CharSet) {\n  RunTest(\"CharSet\");\n}\n<commit_msg>Mark PPAPITest.URLLoader as flaky.<commit_after>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/file_util.h\"\n#include \"base\/path_service.h\"\n#include \"build\/build_config.h\"\n#include \"chrome\/common\/chrome_switches.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#include \"webkit\/glue\/plugins\/plugin_switches.h\"\n\nnamespace {\n\n\/\/ Platform-specific filename relative to the chrome executable.\n#if defined(OS_WIN)\nconst wchar_t library_name[] = L\"ppapi_tests.dll\";\n#elif defined(OS_MACOSX)\nconst char library_name[] = \"ppapi_tests.plugin\";\n#elif defined(OS_POSIX)\nconst char library_name[] = \"libppapi_tests.so\";\n#endif\n\n}  \/\/ namespace\n\nclass PPAPITest : public UITest {\n public:\n  PPAPITest() {\n    \/\/ Append the switch to register the pepper plugin.\n    \/\/ library name = <out dir>\/<test_name>.<library_extension>\n    \/\/ MIME type = application\/x-ppapi-<test_name>\n    FilePath plugin_dir;\n    PathService::Get(base::DIR_EXE, &plugin_dir);\n\n    FilePath plugin_lib = plugin_dir.Append(library_name);\n    EXPECT_TRUE(file_util::PathExists(plugin_lib));\n    FilePath::StringType pepper_plugin = plugin_lib.value();\n    pepper_plugin.append(FILE_PATH_LITERAL(\";application\/x-ppapi-tests\"));\n    launch_arguments_.AppendSwitchNative(switches::kRegisterPepperPlugins,\n                                         pepper_plugin);\n\n    \/\/ The test sends us the result via a cookie.\n    launch_arguments_.AppendSwitch(switches::kEnableFileCookies);\n\n    \/\/ Some stuff is hung off of the testing interface which is not enabled\n    \/\/ by default.\n    launch_arguments_.AppendSwitch(switches::kEnablePepperTesting);\n  }\n\n  void RunTest(const std::string& test_case) {\n    FilePath test_path;\n    PathService::Get(base::DIR_SOURCE_ROOT, &test_path);\n    test_path = test_path.Append(FILE_PATH_LITERAL(\"third_party\"));\n    test_path = test_path.Append(FILE_PATH_LITERAL(\"ppapi\"));\n    test_path = test_path.Append(FILE_PATH_LITERAL(\"tests\"));\n    test_path = test_path.Append(FILE_PATH_LITERAL(\"test_case.html\"));\n\n    \/\/ Sanity check the file name.\n    EXPECT_TRUE(file_util::PathExists(test_path));\n\n    GURL::Replacements replacements;\n    replacements.SetQuery(test_case.c_str(),\n                          url_parse::Component(0, test_case.size()));\n    GURL test_url = net::FilePathToFileURL(test_path);\n    RunTestURL(test_url.ReplaceComponents(replacements));\n  }\n\n  void RunTestViaHTTP(const std::string& test_case) {\n    net::TestServer test_server(\n        net::TestServer::TYPE_HTTP,\n        FilePath(FILE_PATH_LITERAL(\"third_party\/ppapi\/tests\")));\n    ASSERT_TRUE(test_server.Start());\n    RunTestURL(test_server.GetURL(\"files\/test_case.html?\" + test_case));\n  }\n\n private:\n  void RunTestURL(const GURL& test_url) {\n    scoped_refptr<TabProxy> tab(GetActiveTab());\n    ASSERT_TRUE(tab.get());\n    ASSERT_TRUE(tab->NavigateToURL(test_url));\n    std::string escaped_value =\n        WaitUntilCookieNonEmpty(tab.get(), test_url,\n            \"COMPLETION_COOKIE\", action_max_timeout_ms());\n    EXPECT_STREQ(\"PASS\", escaped_value.c_str());\n  }\n};\n\nTEST_F(PPAPITest, FAILS_Instance) {\n  RunTest(\"Instance\");\n}\n\n\/\/ http:\/\/crbug.com\/54150\nTEST_F(PPAPITest, FLAKY_Graphics2D) {\n  RunTest(\"Graphics2D\");\n}\n\n\/\/ TODO(brettw) bug 51344: this is flaky on bots. Seems to timeout navigating.\n\/\/ Possibly all the image allocations slow things down on a loaded bot too much.\nTEST_F(PPAPITest, FLAKY_ImageData) {\n  RunTest(\"ImageData\");\n}\n\nTEST_F(PPAPITest, Buffer) {\n  RunTest(\"Buffer\");\n}\n\nTEST_F(PPAPITest, FLAKY_URLLoader) {\n  RunTestViaHTTP(\"URLLoader\");\n}\n\n\/\/ Flaky, http:\/\/crbug.com\/51012\nTEST_F(PPAPITest, FLAKY_PaintAggregator) {\n  RunTestViaHTTP(\"PaintAggregator\");\n}\n\n\/\/ Flaky, http:\/\/crbug.com\/48544.\nTEST_F(PPAPITest, FLAKY_Scrollbar) {\n  RunTest(\"Scrollbar\");\n}\n\nTEST_F(PPAPITest, UrlUtil) {\n  RunTest(\"UrlUtil\");\n}\n\nTEST_F(PPAPITest, CharSet) {\n  RunTest(\"CharSet\");\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: b2drange.hxx,v $\n *\n *  $Revision: 1.15 $\n *\n *  last change: $Author: kz $ $Date: 2005-11-02 13:54: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 _BGFX_RANGE_B2DRANGE_HXX\n#define _BGFX_RANGE_B2DRANGE_HXX\n\n#ifndef _BGFX_VECTOR_B2DVECTOR_HXX\n#include <basegfx\/vector\/b2dvector.hxx>\n#endif\n#ifndef _BGFX_POINT_B2DPOINT_HXX\n#include <basegfx\/point\/b2dpoint.hxx>\n#endif\n#ifndef _BGFX_TUPLE_B2DTUPLE_HXX\n#include <basegfx\/tuple\/b2dtuple.hxx>\n#endif\n\n#ifndef _BGFX_RANGE_BASICRANGE_HXX\n#include <basegfx\/range\/basicrange.hxx>\n#endif\n\n#include <vector>\n\n\nnamespace basegfx\n{\n    \/\/ predeclarations\n    class B2IRange;\n\n    class B2DRange\n    {\n    public:\n        typedef double          ValueType;\n        typedef DoubleTraits    TraitsType;\n\n        B2DRange()\n        {\n        }\n\n        explicit B2DRange(const B2DTuple& rTuple)\n        :   maRangeX(rTuple.getX()),\n            maRangeY(rTuple.getY())\n        {\n        }\n\n        B2DRange(double x1,\n                 double y1,\n                 double x2,\n                 double y2)\n        :   maRangeX(x1),\n            maRangeY(y1)\n        {\n            maRangeX.expand(x2);\n            maRangeY.expand(y2);\n        }\n\n        B2DRange(const B2DTuple& rTuple1,\n                 const B2DTuple& rTuple2)\n        :   maRangeX(rTuple1.getX()),\n            maRangeY(rTuple1.getY())\n        {\n            expand( rTuple2 );\n        }\n\n        B2DRange(const B2DRange& rRange)\n        :   maRangeX(rRange.maRangeX),\n            maRangeY(rRange.maRangeY)\n        {\n        }\n\n        explicit B2DRange(const B2IRange& rRange);\n\n        bool isEmpty() const\n        {\n            return (\n                maRangeX.isEmpty()\n                || maRangeY.isEmpty()\n                );\n        }\n\n        void reset()\n        {\n            maRangeX.reset();\n            maRangeY.reset();\n        }\n\n        bool operator==( const B2DRange& rRange ) const\n        {\n            return (maRangeX == rRange.maRangeX\n                && maRangeY == rRange.maRangeY);\n        }\n\n        bool operator!=( const B2DRange& rRange ) const\n        {\n            return (maRangeX != rRange.maRangeX\n                || maRangeY != rRange.maRangeY);\n        }\n\n        void operator=(const B2DRange& rRange)\n        {\n            maRangeX = rRange.maRangeX;\n            maRangeY = rRange.maRangeY;\n        }\n\n        bool equal(const B2DRange& rRange) const\n        {\n            return (maRangeX.equal(rRange.maRangeX)\n                    && maRangeY.equal(rRange.maRangeY));\n        }\n\n        bool equal(const B2DRange& rRange, const double& rfSmallValue) const\n        {\n            return (maRangeX.equal(rRange.maRangeX,rfSmallValue)\n                    && maRangeY.equal(rRange.maRangeY,rfSmallValue));\n        }\n\n        double getMinX() const\n        {\n            return maRangeX.getMinimum();\n        }\n\n        double getMinY() const\n        {\n            return maRangeY.getMinimum();\n        }\n\n        double getMaxX() const\n        {\n            return maRangeX.getMaximum();\n        }\n\n        double getMaxY() const\n        {\n            return maRangeY.getMaximum();\n        }\n\n        double getWidth() const\n        {\n            return maRangeX.getRange();\n        }\n\n        double getHeight() const\n        {\n            return maRangeY.getRange();\n        }\n\n        B2DPoint getMinimum() const\n        {\n            return B2DPoint(\n                maRangeX.getMinimum(),\n                maRangeY.getMinimum()\n                );\n        }\n\n        B2DPoint getMaximum() const\n        {\n            return B2DPoint(\n                maRangeX.getMaximum(),\n                maRangeY.getMaximum()\n                );\n        }\n\n        B2DVector getRange() const\n        {\n            return B2DVector(\n                maRangeX.getRange(),\n                maRangeY.getRange()\n                );\n        }\n\n        B2DPoint getCenter() const\n        {\n            return B2DPoint(\n                maRangeX.getCenter(),\n                maRangeY.getCenter()\n                );\n        }\n\n        double getCenterX() const\n        {\n            return maRangeX.getCenter();\n        }\n\n        double getCenterY() const\n        {\n            return maRangeY.getCenter();\n        }\n\n        bool isInside(const B2DTuple& rTuple) const\n        {\n            return (\n                maRangeX.isInside(rTuple.getX())\n                && maRangeY.isInside(rTuple.getY())\n                );\n        }\n\n        bool isInside(const B2DRange& rRange) const\n        {\n            return (\n                maRangeX.isInside(rRange.maRangeX)\n                && maRangeY.isInside(rRange.maRangeY)\n                );\n        }\n\n        bool overlaps(const B2DRange& rRange) const\n        {\n            return (\n                maRangeX.overlaps(rRange.maRangeX)\n                && maRangeY.overlaps(rRange.maRangeY)\n                );\n        }\n\n        void expand(const B2DTuple& rTuple)\n        {\n            maRangeX.expand(rTuple.getX());\n            maRangeY.expand(rTuple.getY());\n        }\n\n        void expand(const B2DRange& rRange)\n        {\n            maRangeX.expand(rRange.maRangeX);\n            maRangeY.expand(rRange.maRangeY);\n        }\n\n        void intersect(const B2DRange& rRange)\n        {\n            maRangeX.intersect(rRange.maRangeX);\n            maRangeY.intersect(rRange.maRangeY);\n        }\n\n        void grow(double fValue)\n        {\n            maRangeX.grow(fValue);\n            maRangeY.grow(fValue);\n        }\n\n    private:\n        typedef ::basegfx::BasicRange< ValueType, TraitsType >  MyBasicRange;\n\n        MyBasicRange        maRangeX;\n        MyBasicRange        maRangeY;\n    };\n\n    \/** Round double to nearest integer for 2D range\n\n        @return the nearest integer for this range\n    *\/\n    B2IRange fround(const B2DRange& rRange);\n\n    \/** Compute the set difference of the two given ranges\n\n        This method calculates the symmetric difference (aka XOR)\n        between the two given ranges, and returning the resulting\n        ranges. Thus, the result will contain all areas where one, but\n        not both ranges lie.\n\n        @param o_rResult\n        Result vector. The up to four difference ranges are returned\n        within this vector\n\n        @param rFirst\n        The first range\n\n        @param rSecond\n        The second range\n\n        @return the input vector\n     *\/\n    ::std::vector< B2DRange >& computeSetDifference( ::std::vector< B2DRange >& o_rResult,\n                                                     const B2DRange&            rFirst,\n                                                     const B2DRange&            rSecond );\n\n} \/\/ end of namespace basegfx\n\n\n#endif \/* _BGFX_RANGE_B2DRANGE_HXX *\/\n<commit_msg>INTEGRATION: CWS aw024 (1.15.4); FILE MERGED 2006\/03\/15 11:12:27 aw 1.15.4.1: #i39528# Added transform to B2DRange<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: b2drange.hxx,v $\n *\n *  $Revision: 1.16 $\n *\n *  last change: $Author: ihi $ $Date: 2006-11-14 14:06:16 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n#ifndef _BGFX_RANGE_B2DRANGE_HXX\n#define _BGFX_RANGE_B2DRANGE_HXX\n\n#ifndef _BGFX_VECTOR_B2DVECTOR_HXX\n#include <basegfx\/vector\/b2dvector.hxx>\n#endif\n#ifndef _BGFX_POINT_B2DPOINT_HXX\n#include <basegfx\/point\/b2dpoint.hxx>\n#endif\n#ifndef _BGFX_TUPLE_B2DTUPLE_HXX\n#include <basegfx\/tuple\/b2dtuple.hxx>\n#endif\n\n#ifndef _BGFX_RANGE_BASICRANGE_HXX\n#include <basegfx\/range\/basicrange.hxx>\n#endif\n\n#include <vector>\n\n\nnamespace basegfx\n{\n    \/\/ predeclarations\n    class B2IRange;\n\n    class B2DRange\n    {\n    public:\n        typedef double          ValueType;\n        typedef DoubleTraits    TraitsType;\n\n        B2DRange()\n        {\n        }\n\n        explicit B2DRange(const B2DTuple& rTuple)\n        :   maRangeX(rTuple.getX()),\n            maRangeY(rTuple.getY())\n        {\n        }\n\n        B2DRange(double x1,\n                 double y1,\n                 double x2,\n                 double y2)\n        :   maRangeX(x1),\n            maRangeY(y1)\n        {\n            maRangeX.expand(x2);\n            maRangeY.expand(y2);\n        }\n\n        B2DRange(const B2DTuple& rTuple1,\n                 const B2DTuple& rTuple2)\n        :   maRangeX(rTuple1.getX()),\n            maRangeY(rTuple1.getY())\n        {\n            expand( rTuple2 );\n        }\n\n        B2DRange(const B2DRange& rRange)\n        :   maRangeX(rRange.maRangeX),\n            maRangeY(rRange.maRangeY)\n        {\n        }\n\n        explicit B2DRange(const B2IRange& rRange);\n\n        bool isEmpty() const\n        {\n            return (\n                maRangeX.isEmpty()\n                || maRangeY.isEmpty()\n                );\n        }\n\n        void reset()\n        {\n            maRangeX.reset();\n            maRangeY.reset();\n        }\n\n        bool operator==( const B2DRange& rRange ) const\n        {\n            return (maRangeX == rRange.maRangeX\n                && maRangeY == rRange.maRangeY);\n        }\n\n        bool operator!=( const B2DRange& rRange ) const\n        {\n            return (maRangeX != rRange.maRangeX\n                || maRangeY != rRange.maRangeY);\n        }\n\n        void operator=(const B2DRange& rRange)\n        {\n            maRangeX = rRange.maRangeX;\n            maRangeY = rRange.maRangeY;\n        }\n\n        bool equal(const B2DRange& rRange) const\n        {\n            return (maRangeX.equal(rRange.maRangeX)\n                    && maRangeY.equal(rRange.maRangeY));\n        }\n\n        bool equal(const B2DRange& rRange, const double& rfSmallValue) const\n        {\n            return (maRangeX.equal(rRange.maRangeX,rfSmallValue)\n                    && maRangeY.equal(rRange.maRangeY,rfSmallValue));\n        }\n\n        double getMinX() const\n        {\n            return maRangeX.getMinimum();\n        }\n\n        double getMinY() const\n        {\n            return maRangeY.getMinimum();\n        }\n\n        double getMaxX() const\n        {\n            return maRangeX.getMaximum();\n        }\n\n        double getMaxY() const\n        {\n            return maRangeY.getMaximum();\n        }\n\n        double getWidth() const\n        {\n            return maRangeX.getRange();\n        }\n\n        double getHeight() const\n        {\n            return maRangeY.getRange();\n        }\n\n        B2DPoint getMinimum() const\n        {\n            return B2DPoint(\n                maRangeX.getMinimum(),\n                maRangeY.getMinimum()\n                );\n        }\n\n        B2DPoint getMaximum() const\n        {\n            return B2DPoint(\n                maRangeX.getMaximum(),\n                maRangeY.getMaximum()\n                );\n        }\n\n        B2DVector getRange() const\n        {\n            return B2DVector(\n                maRangeX.getRange(),\n                maRangeY.getRange()\n                );\n        }\n\n        B2DPoint getCenter() const\n        {\n            return B2DPoint(\n                maRangeX.getCenter(),\n                maRangeY.getCenter()\n                );\n        }\n\n        double getCenterX() const\n        {\n            return maRangeX.getCenter();\n        }\n\n        double getCenterY() const\n        {\n            return maRangeY.getCenter();\n        }\n\n        bool isInside(const B2DTuple& rTuple) const\n        {\n            return (\n                maRangeX.isInside(rTuple.getX())\n                && maRangeY.isInside(rTuple.getY())\n                );\n        }\n\n        bool isInside(const B2DRange& rRange) const\n        {\n            return (\n                maRangeX.isInside(rRange.maRangeX)\n                && maRangeY.isInside(rRange.maRangeY)\n                );\n        }\n\n        bool overlaps(const B2DRange& rRange) const\n        {\n            return (\n                maRangeX.overlaps(rRange.maRangeX)\n                && maRangeY.overlaps(rRange.maRangeY)\n                );\n        }\n\n        void expand(const B2DTuple& rTuple)\n        {\n            maRangeX.expand(rTuple.getX());\n            maRangeY.expand(rTuple.getY());\n        }\n\n        void expand(const B2DRange& rRange)\n        {\n            maRangeX.expand(rRange.maRangeX);\n            maRangeY.expand(rRange.maRangeY);\n        }\n\n        void intersect(const B2DRange& rRange)\n        {\n            maRangeX.intersect(rRange.maRangeX);\n            maRangeY.intersect(rRange.maRangeY);\n        }\n\n        void grow(double fValue)\n        {\n            maRangeX.grow(fValue);\n            maRangeY.grow(fValue);\n        }\n\n        void transform(const B2DHomMatrix& rMatrix);\n\n    private:\n        typedef ::basegfx::BasicRange< ValueType, TraitsType >  MyBasicRange;\n\n        MyBasicRange        maRangeX;\n        MyBasicRange        maRangeY;\n    };\n\n    \/** Round double to nearest integer for 2D range\n\n        @return the nearest integer for this range\n    *\/\n    B2IRange fround(const B2DRange& rRange);\n\n    \/** Compute the set difference of the two given ranges\n\n        This method calculates the symmetric difference (aka XOR)\n        between the two given ranges, and returning the resulting\n        ranges. Thus, the result will contain all areas where one, but\n        not both ranges lie.\n\n        @param o_rResult\n        Result vector. The up to four difference ranges are returned\n        within this vector\n\n        @param rFirst\n        The first range\n\n        @param rSecond\n        The second range\n\n        @return the input vector\n     *\/\n    ::std::vector< B2DRange >& computeSetDifference( ::std::vector< B2DRange >& o_rResult,\n                                                     const B2DRange&            rFirst,\n                                                     const B2DRange&            rSecond );\n\n} \/\/ end of namespace basegfx\n\n\n#endif \/* _BGFX_RANGE_B2DRANGE_HXX *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/worker_host\/worker_service.h\"\n#include \"chrome\/test\/automation\/browser_proxy.h\"\n#include \"chrome\/test\/automation\/tab_proxy.h\"\n#include \"chrome\/test\/ui\/ui_layout_test.h\"\n\nstatic const char kTestCompleteCookie[] = \"status\";\nstatic const char kTestCompleteSuccess[] = \"OK\";\n\nclass WorkerTest : public UILayoutTest {\n protected:\n  virtual ~WorkerTest() { }\n\n  void RunTest(const std::wstring& test_case) {\n    scoped_refptr<TabProxy> tab(GetActiveTab());\n    ASSERT_TRUE(tab.get());\n\n    GURL url = GetTestUrl(L\"workers\", test_case);\n    ASSERT_TRUE(tab->NavigateToURL(url));\n\n    std::string value = WaitUntilCookieNonEmpty(tab.get(), url,\n        kTestCompleteCookie, kTestIntervalMs, kTestWaitTimeoutMs);\n    ASSERT_STREQ(kTestCompleteSuccess, value.c_str());\n  }\n};\n\nTEST_F(WorkerTest, SingleWorker) {\n  RunTest(L\"single_worker.html\");\n}\n\nTEST_F(WorkerTest, MultipleWorkers) {\n  RunTest(L\"multi_worker.html\");\n}\n\n\/\/ WorkerFastLayoutTests works on the linux try servers, but fails on the\n\/\/ build bots and fails on mac valgrind.\n#if !defined(OS_WIN)\n#define WorkerFastLayoutTests DISABLED_WorkerFastLayoutTests\n#endif\n\nTEST_F(WorkerTest, WorkerFastLayoutTests) {\n  static const char* kLayoutTestFiles[] = {\n    \"stress-js-execution.html\",\n#if defined(OS_WIN)\n    \/\/ Workers don't properly initialize the V8 stack guard.\n    \/\/ (http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=21653).\n    \"use-machine-stack.html\",\n#endif\n    \"worker-call.html\",\n    \/\/ Disabled because cloning ports are too slow in Chromium to meet the\n    \/\/ thresholds in this test.\n    \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=22780\n    \/\/ \"worker-cloneport.html\",\n\n    \"worker-close.html\",\n    \"worker-constructor.html\",\n    \"worker-context-gc.html\",\n    \"worker-context-multi-port.html\",\n    \"worker-event-listener.html\",\n    \"worker-gc.html\",\n    \/\/ worker-lifecycle.html relies on layoutTestController.workerThreadCount\n    \/\/ which is not currently implemented.\n    \/\/ \"worker-lifecycle.html\",\n    \"worker-location.html\",\n    \"worker-messageport.html\",\n    \/\/ Disabled after r27089 (WebKit merge), http:\/\/crbug.com\/22947\n    \/\/ \"worker-messageport-gc.html\",\n    \"worker-multi-port.html\",\n    \"worker-navigator.html\",\n    \"worker-replace-global-constructor.html\",\n    \"worker-replace-self.html\",\n    \"worker-script-error.html\",\n    \"worker-terminate.html\",\n    \"worker-timeout.html\"\n  };\n\n  FilePath fast_test_dir;\n  fast_test_dir = fast_test_dir.AppendASCII(\"LayoutTests\");\n  fast_test_dir = fast_test_dir.AppendASCII(\"fast\");\n\n  FilePath worker_test_dir;\n  worker_test_dir = worker_test_dir.AppendASCII(\"workers\");\n  InitializeForLayoutTest(fast_test_dir, worker_test_dir, false);\n\n  \/\/ Worker tests also rely on common files in js\/resources.\n  FilePath js_dir = fast_test_dir.AppendASCII(\"js\");\n  FilePath resource_dir;\n  resource_dir = resource_dir.AppendASCII(\"resources\");\n  AddResourceForLayoutTest(js_dir, resource_dir);\n\n  for (size_t i = 0; i < arraysize(kLayoutTestFiles); ++i)\n    RunLayoutTest(kLayoutTestFiles[i], false);\n}\n\nTEST_F(WorkerTest, WorkerHttpLayoutTests) {\n  static const char* kLayoutTestFiles[] = {\n    \/\/ flakey? BUG 16934 \"text-encoding.html\",\n#if defined(OS_WIN)\n    \/\/ Fails on the mac (and linux?):\n    \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=22599\n    \"worker-importScripts.html\",\n#endif\n    \"worker-redirect.html\",\n  };\n\n  FilePath http_test_dir;\n  http_test_dir = http_test_dir.AppendASCII(\"LayoutTests\");\n  http_test_dir = http_test_dir.AppendASCII(\"http\");\n  http_test_dir = http_test_dir.AppendASCII(\"tests\");\n\n  FilePath worker_test_dir;\n  worker_test_dir = worker_test_dir.AppendASCII(\"workers\");\n  InitializeForLayoutTest(http_test_dir, worker_test_dir, true);\n\n  StartHttpServer(new_http_root_dir_);\n  for (size_t i = 0; i < arraysize(kLayoutTestFiles); ++i)\n    RunLayoutTest(kLayoutTestFiles[i], true);\n  StopHttpServer();\n}\n\nTEST_F(WorkerTest, WorkerXhrHttpLayoutTests) {\n  static const char* kLayoutTestFiles[] = {\n    \"abort-exception-assert.html\",\n#if defined(OS_WIN)\n    \/\/ Fails on the mac (and linux?):\n    \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=22599\n    \"close.html\",\n#endif\n    \/\/\"methods-async.html\",\n    \/\/\"methods.html\",\n    \"xmlhttprequest-file-not-found.html\"\n  };\n\n  FilePath http_test_dir;\n  http_test_dir = http_test_dir.AppendASCII(\"LayoutTests\");\n  http_test_dir = http_test_dir.AppendASCII(\"http\");\n  http_test_dir = http_test_dir.AppendASCII(\"tests\");\n\n  FilePath worker_test_dir;\n  worker_test_dir = worker_test_dir.AppendASCII(\"xmlhttprequest\");\n  worker_test_dir = worker_test_dir.AppendASCII(\"workers\");\n  InitializeForLayoutTest(http_test_dir, worker_test_dir, true);\n\n  StartHttpServer(new_http_root_dir_);\n  for (size_t i = 0; i < arraysize(kLayoutTestFiles); ++i)\n    RunLayoutTest(kLayoutTestFiles[i], true);\n  StopHttpServer();\n}\n\nTEST_F(WorkerTest, MessagePorts) {\n  static const char* kLayoutTestFiles[] = {\n    \"message-channel-gc.html\",\n    \"message-channel-gc-2.html\",\n    \"message-channel-gc-3.html\",\n    \"message-channel-gc-4.html\",\n    \"message-port.html\",\n    \"message-port-clone.html\",\n    \"message-port-constructor-for-deleted-document.html\",\n    \"message-port-deleted-document.html\",\n    \"message-port-deleted-frame.html\",\n    \"message-port-inactive-document.html\",\n    \"message-port-multi.html\",\n    \"message-port-no-wrapper.html\",\n    \/\/ Only works with run-webkit-tests --leaks.\n    \/\/\"message-channel-listener-circular-ownership.html\",\n  };\n\n  FilePath fast_test_dir;\n  fast_test_dir = fast_test_dir.AppendASCII(\"LayoutTests\");\n  fast_test_dir = fast_test_dir.AppendASCII(\"fast\");\n\n  FilePath worker_test_dir;\n  worker_test_dir = worker_test_dir.AppendASCII(\"events\");\n  InitializeForLayoutTest(fast_test_dir, worker_test_dir, false);\n\n  \/\/ MessagePort tests also rely on common files in js\/resources.\n  FilePath js_dir = fast_test_dir.AppendASCII(\"js\");\n  FilePath resource_dir;\n  resource_dir = resource_dir.AppendASCII(\"resources\");\n  AddResourceForLayoutTest(js_dir, resource_dir);\n\n  for (size_t i = 0; i < arraysize(kLayoutTestFiles); ++i)\n    RunLayoutTest(kLayoutTestFiles[i], false);\n}\n\n\/\/ Disable LimitPerPage on Linux. Seems to work on Mac though:\n\/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=22608\n#if !defined(OS_LINUX)\nTEST_F(WorkerTest, LimitPerPage) {\n  int max_workers_per_tab = WorkerService::kMaxWorkersPerTabWhenSeparate;\n  GURL url = GetTestUrl(L\"workers\", L\"many_workers.html\");\n  url = GURL(url.spec() + StringPrintf(\"?count=%d\", max_workers_per_tab + 1));\n\n  scoped_refptr<TabProxy> tab(GetActiveTab());\n  ASSERT_TRUE(tab.get());\n  ASSERT_TRUE(tab->NavigateToURL(url));\n\n  EXPECT_EQ(max_workers_per_tab + 1 + (UITest::in_process_renderer() ? 0 : 1),\n            UITest::GetBrowserProcessCount());\n}\n#endif\n\n\/\/ Disable LimitTotal on Linux and Mac.\n\/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=22608\n#if defined(OS_WIN)\nTEST_F(WorkerTest, LimitTotal) {\n  int max_workers_per_tab = WorkerService::kMaxWorkersPerTabWhenSeparate;\n  int total_workers = WorkerService::kMaxWorkersWhenSeparate;\n\n  int tab_count = (total_workers \/ max_workers_per_tab) + 1;\n  GURL url = GetTestUrl(L\"workers\", L\"many_workers.html\");\n  url = GURL(url.spec() + StringPrintf(\"?count=%d\", max_workers_per_tab));\n\n  scoped_refptr<TabProxy> tab(GetActiveTab());\n  ASSERT_TRUE(tab.get());\n  ASSERT_TRUE(tab->NavigateToURL(url));\n  scoped_refptr<BrowserProxy> window(automation()->GetBrowserWindow(0));\n  for (int i = 1; i < tab_count; ++i)\n    window->AppendTab(url);\n\n  \/\/ Check that we didn't create more than the max number of workers.\n  EXPECT_EQ(total_workers + 1 + (UITest::in_process_renderer() ? 0 : tab_count),\n            UITest::GetBrowserProcessCount());\n\n  \/\/ Now close the first tab and check that the queued workers were started.\n  tab->Close(true);\n  tab->NavigateToURL(GetTestUrl(L\"google\", L\"google.html\"));\n\n  EXPECT_EQ(total_workers + 1 + (UITest::in_process_renderer() ? 0 : tab_count),\n            UITest::GetBrowserProcessCount());\n}\n#endif\n<commit_msg>Disabling failing WorkerTest.MessagePorts after WebKit roll.<commit_after>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/worker_host\/worker_service.h\"\n#include \"chrome\/test\/automation\/browser_proxy.h\"\n#include \"chrome\/test\/automation\/tab_proxy.h\"\n#include \"chrome\/test\/ui\/ui_layout_test.h\"\n\nstatic const char kTestCompleteCookie[] = \"status\";\nstatic const char kTestCompleteSuccess[] = \"OK\";\n\nclass WorkerTest : public UILayoutTest {\n protected:\n  virtual ~WorkerTest() { }\n\n  void RunTest(const std::wstring& test_case) {\n    scoped_refptr<TabProxy> tab(GetActiveTab());\n    ASSERT_TRUE(tab.get());\n\n    GURL url = GetTestUrl(L\"workers\", test_case);\n    ASSERT_TRUE(tab->NavigateToURL(url));\n\n    std::string value = WaitUntilCookieNonEmpty(tab.get(), url,\n        kTestCompleteCookie, kTestIntervalMs, kTestWaitTimeoutMs);\n    ASSERT_STREQ(kTestCompleteSuccess, value.c_str());\n  }\n};\n\nTEST_F(WorkerTest, SingleWorker) {\n  RunTest(L\"single_worker.html\");\n}\n\nTEST_F(WorkerTest, MultipleWorkers) {\n  RunTest(L\"multi_worker.html\");\n}\n\n\/\/ WorkerFastLayoutTests works on the linux try servers, but fails on the\n\/\/ build bots and fails on mac valgrind.\n#if !defined(OS_WIN)\n#define WorkerFastLayoutTests DISABLED_WorkerFastLayoutTests\n#endif\n\nTEST_F(WorkerTest, WorkerFastLayoutTests) {\n  static const char* kLayoutTestFiles[] = {\n    \"stress-js-execution.html\",\n#if defined(OS_WIN)\n    \/\/ Workers don't properly initialize the V8 stack guard.\n    \/\/ (http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=21653).\n    \"use-machine-stack.html\",\n#endif\n    \"worker-call.html\",\n    \/\/ Disabled because cloning ports are too slow in Chromium to meet the\n    \/\/ thresholds in this test.\n    \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=22780\n    \/\/ \"worker-cloneport.html\",\n\n    \"worker-close.html\",\n    \"worker-constructor.html\",\n    \"worker-context-gc.html\",\n    \"worker-context-multi-port.html\",\n    \"worker-event-listener.html\",\n    \"worker-gc.html\",\n    \/\/ worker-lifecycle.html relies on layoutTestController.workerThreadCount\n    \/\/ which is not currently implemented.\n    \/\/ \"worker-lifecycle.html\",\n    \"worker-location.html\",\n    \"worker-messageport.html\",\n    \/\/ Disabled after r27089 (WebKit merge), http:\/\/crbug.com\/22947\n    \/\/ \"worker-messageport-gc.html\",\n    \"worker-multi-port.html\",\n    \"worker-navigator.html\",\n    \"worker-replace-global-constructor.html\",\n    \"worker-replace-self.html\",\n    \"worker-script-error.html\",\n    \"worker-terminate.html\",\n    \"worker-timeout.html\"\n  };\n\n  FilePath fast_test_dir;\n  fast_test_dir = fast_test_dir.AppendASCII(\"LayoutTests\");\n  fast_test_dir = fast_test_dir.AppendASCII(\"fast\");\n\n  FilePath worker_test_dir;\n  worker_test_dir = worker_test_dir.AppendASCII(\"workers\");\n  InitializeForLayoutTest(fast_test_dir, worker_test_dir, false);\n\n  \/\/ Worker tests also rely on common files in js\/resources.\n  FilePath js_dir = fast_test_dir.AppendASCII(\"js\");\n  FilePath resource_dir;\n  resource_dir = resource_dir.AppendASCII(\"resources\");\n  AddResourceForLayoutTest(js_dir, resource_dir);\n\n  for (size_t i = 0; i < arraysize(kLayoutTestFiles); ++i)\n    RunLayoutTest(kLayoutTestFiles[i], false);\n}\n\nTEST_F(WorkerTest, WorkerHttpLayoutTests) {\n  static const char* kLayoutTestFiles[] = {\n    \/\/ flakey? BUG 16934 \"text-encoding.html\",\n#if defined(OS_WIN)\n    \/\/ Fails on the mac (and linux?):\n    \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=22599\n    \"worker-importScripts.html\",\n#endif\n    \"worker-redirect.html\",\n  };\n\n  FilePath http_test_dir;\n  http_test_dir = http_test_dir.AppendASCII(\"LayoutTests\");\n  http_test_dir = http_test_dir.AppendASCII(\"http\");\n  http_test_dir = http_test_dir.AppendASCII(\"tests\");\n\n  FilePath worker_test_dir;\n  worker_test_dir = worker_test_dir.AppendASCII(\"workers\");\n  InitializeForLayoutTest(http_test_dir, worker_test_dir, true);\n\n  StartHttpServer(new_http_root_dir_);\n  for (size_t i = 0; i < arraysize(kLayoutTestFiles); ++i)\n    RunLayoutTest(kLayoutTestFiles[i], true);\n  StopHttpServer();\n}\n\nTEST_F(WorkerTest, WorkerXhrHttpLayoutTests) {\n  static const char* kLayoutTestFiles[] = {\n    \"abort-exception-assert.html\",\n#if defined(OS_WIN)\n    \/\/ Fails on the mac (and linux?):\n    \/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=22599\n    \"close.html\",\n#endif\n    \/\/\"methods-async.html\",\n    \/\/\"methods.html\",\n    \"xmlhttprequest-file-not-found.html\"\n  };\n\n  FilePath http_test_dir;\n  http_test_dir = http_test_dir.AppendASCII(\"LayoutTests\");\n  http_test_dir = http_test_dir.AppendASCII(\"http\");\n  http_test_dir = http_test_dir.AppendASCII(\"tests\");\n\n  FilePath worker_test_dir;\n  worker_test_dir = worker_test_dir.AppendASCII(\"xmlhttprequest\");\n  worker_test_dir = worker_test_dir.AppendASCII(\"workers\");\n  InitializeForLayoutTest(http_test_dir, worker_test_dir, true);\n\n  StartHttpServer(new_http_root_dir_);\n  for (size_t i = 0; i < arraysize(kLayoutTestFiles); ++i)\n    RunLayoutTest(kLayoutTestFiles[i], true);\n  StopHttpServer();\n}\n\nTEST_F(WorkerTest, DISABLED_MessagePorts) {\n  static const char* kLayoutTestFiles[] = {\n    \"message-channel-gc.html\",\n    \"message-channel-gc-2.html\",\n    \"message-channel-gc-3.html\",\n    \"message-channel-gc-4.html\",\n    \"message-port.html\",\n    \"message-port-clone.html\",\n    \"message-port-constructor-for-deleted-document.html\",\n    \"message-port-deleted-document.html\",\n    \"message-port-deleted-frame.html\",\n    \"message-port-inactive-document.html\",\n    \"message-port-multi.html\",\n    \"message-port-no-wrapper.html\",\n    \/\/ Only works with run-webkit-tests --leaks.\n    \/\/\"message-channel-listener-circular-ownership.html\",\n  };\n\n  FilePath fast_test_dir;\n  fast_test_dir = fast_test_dir.AppendASCII(\"LayoutTests\");\n  fast_test_dir = fast_test_dir.AppendASCII(\"fast\");\n\n  FilePath worker_test_dir;\n  worker_test_dir = worker_test_dir.AppendASCII(\"events\");\n  InitializeForLayoutTest(fast_test_dir, worker_test_dir, false);\n\n  \/\/ MessagePort tests also rely on common files in js\/resources.\n  FilePath js_dir = fast_test_dir.AppendASCII(\"js\");\n  FilePath resource_dir;\n  resource_dir = resource_dir.AppendASCII(\"resources\");\n  AddResourceForLayoutTest(js_dir, resource_dir);\n\n  for (size_t i = 0; i < arraysize(kLayoutTestFiles); ++i)\n    RunLayoutTest(kLayoutTestFiles[i], false);\n}\n\n\/\/ Disable LimitPerPage on Linux. Seems to work on Mac though:\n\/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=22608\n#if !defined(OS_LINUX)\nTEST_F(WorkerTest, LimitPerPage) {\n  int max_workers_per_tab = WorkerService::kMaxWorkersPerTabWhenSeparate;\n  GURL url = GetTestUrl(L\"workers\", L\"many_workers.html\");\n  url = GURL(url.spec() + StringPrintf(\"?count=%d\", max_workers_per_tab + 1));\n\n  scoped_refptr<TabProxy> tab(GetActiveTab());\n  ASSERT_TRUE(tab.get());\n  ASSERT_TRUE(tab->NavigateToURL(url));\n\n  EXPECT_EQ(max_workers_per_tab + 1 + (UITest::in_process_renderer() ? 0 : 1),\n            UITest::GetBrowserProcessCount());\n}\n#endif\n\n\/\/ Disable LimitTotal on Linux and Mac.\n\/\/ http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=22608\n#if defined(OS_WIN)\nTEST_F(WorkerTest, LimitTotal) {\n  int max_workers_per_tab = WorkerService::kMaxWorkersPerTabWhenSeparate;\n  int total_workers = WorkerService::kMaxWorkersWhenSeparate;\n\n  int tab_count = (total_workers \/ max_workers_per_tab) + 1;\n  GURL url = GetTestUrl(L\"workers\", L\"many_workers.html\");\n  url = GURL(url.spec() + StringPrintf(\"?count=%d\", max_workers_per_tab));\n\n  scoped_refptr<TabProxy> tab(GetActiveTab());\n  ASSERT_TRUE(tab.get());\n  ASSERT_TRUE(tab->NavigateToURL(url));\n  scoped_refptr<BrowserProxy> window(automation()->GetBrowserWindow(0));\n  for (int i = 1; i < tab_count; ++i)\n    window->AppendTab(url);\n\n  \/\/ Check that we didn't create more than the max number of workers.\n  EXPECT_EQ(total_workers + 1 + (UITest::in_process_renderer() ? 0 : tab_count),\n            UITest::GetBrowserProcessCount());\n\n  \/\/ Now close the first tab and check that the queued workers were started.\n  tab->Close(true);\n  tab->NavigateToURL(GetTestUrl(L\"google\", L\"google.html\"));\n\n  EXPECT_EQ(total_workers + 1 + (UITest::in_process_renderer() ? 0 : tab_count),\n            UITest::GetBrowserProcessCount());\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2015-2020 Elviss Strazdins. All rights reserved.\n\n#ifndef OUZEL_UTILS_LOG_HPP\n#define OUZEL_UTILS_LOG_HPP\n\n#include <atomic>\n#include <condition_variable>\n#include <cstring>\n#include <mutex>\n#include <queue>\n#include <string>\n#include <thread>\n#include <type_traits>\n#include \"..\/math\/Matrix.hpp\"\n#include \"..\/math\/Quaternion.hpp\"\n#include \"..\/math\/Size.hpp\"\n#include \"..\/math\/Vector.hpp\"\n#include \"..\/storage\/Path.hpp\"\n#include \"Thread.hpp\"\n#include \"Utils.hpp\"\n\nnamespace ouzel\n{\n    class Logger;\n\n    class Log final\n    {\n    public:\n        enum class Level\n        {\n            off,\n            error,\n            warning,\n            info,\n            all\n        };\n\n        explicit Log(const Logger& initLogger, Level initLevel = Level::info):\n            logger(initLogger), level(initLevel)\n        {\n        }\n\n        Log(const Log& other):\n            logger(other.logger),\n            level(other.level),\n            s(other.s)\n        {\n        }\n\n        Log(Log&& other) noexcept:\n            logger(other.logger),\n            level(other.level),\n            s(std::move(other.s))\n        {\n            other.level = Level::info;\n        }\n\n        Log& operator=(const Log& other)\n        {\n            if (&other == this) return *this;\n\n            level = other.level;\n            s = other.s;\n\n            return *this;\n        }\n\n        Log& operator=(Log&& other) noexcept\n        {\n            if (&other == this) return *this;\n\n            level = other.level;\n            other.level = Level::info;\n            s = std::move(other.s);\n\n            return *this;\n        }\n\n        ~Log();\n\n        Log& operator<<(const bool val)\n        {\n            s += val ? \"true\" : \"false\";\n            return *this;\n        }\n\n        Log& operator<<(const uint8_t val)\n        {\n            constexpr char digits[] = \"0123456789abcdef\";\n\n            for (std::uint32_t p = 0; p < 2; ++p)\n                s.push_back(digits[(val >> (4 - p * 4)) & 0x0F]);\n\n            return *this;\n        }\n\n        template <typename T, typename std::enable_if_t<std::is_arithmetic_v<T> &&\n            !std::is_same_v<T, bool> &&\n            !std::is_same_v<T, std::uint8_t>>* = nullptr>\n        Log& operator<<(const T val)\n        {\n            s += std::to_string(val);\n            return *this;\n        }\n\n        Log& operator<<(const std::string& val)\n        {\n            s += val;\n            return *this;\n        }\n\n        Log& operator<<(const char* val)\n        {\n            s += val;\n            return *this;\n        }\n\n        template <typename T, typename std::enable_if_t<!std::is_same_v<T, char>>* = nullptr>\n        Log& operator<<(const T* val)\n        {\n            constexpr char digits[] = \"0123456789abcdef\";\n\n            const auto ptrValue = bitCast<std::uintptr_t>(val);\n\n            for (std::size_t i = 0; i < sizeof(val) * 2; ++i)\n                s.push_back(digits[(ptrValue >> (sizeof(ptrValue) * 2 - i - 1) * 4) & 0x0F]);\n\n            return *this;\n        }\n\n        Log& operator<<(const storage::Path& val)\n        {\n            s += val;\n            return *this;\n        }\n\n        template<typename T, typename = void>\n        struct isContainer: std::false_type {};\n\n        template<typename T>\n        struct isContainer<T,\n            std::void_t<decltype(std::declval<T>().begin()),\n                decltype(std::declval<T>().end())\n            >>: std::true_type {};\n\n        template <typename T, typename std::enable_if_t<isContainer<T>::value>* = nullptr>\n        Log& operator<<(const T& val)\n        {\n            bool first = true;\n            for (const auto& i : val)\n            {\n                if (!first) s += \", \";\n                first = false;\n                operator<<(i);\n            }\n\n            return *this;\n        }\n\n        template <std::size_t N, std::size_t M, class T>\n        Log& operator<<(const Matrix<N, M, T>& val)\n        {\n            bool first = true;\n\n            for (const T c : val.m)\n            {\n                if (!first) s += \",\";\n                first = false;\n                s += std::to_string(c);\n            }\n\n            return *this;\n        }\n\n        template <typename T>\n        Log& operator<<(const Quaternion<T>& val)\n        {\n            s += std::to_string(val.v[0]) + \",\" + std::to_string(val.v[1]) + \",\" +\n                std::to_string(val.v[2]) + \",\" + std::to_string(val.v[3]);\n            return *this;\n        }\n\n        template <std::size_t N, class T>\n        Log& operator<<(const Size<N, T>& val)\n        {\n            bool first = true;\n\n            for (const T c : val.v)\n            {\n                if (!first) s += \",\";\n                first = false;\n                s += std::to_string(c);\n            }\n            return *this;\n        }\n\n        template <std::size_t N, class T>\n        Log& operator<<(const Vector<N, T>& val)\n        {\n            bool first = true;\n\n            for (const T c : val.v)\n            {\n                if (!first) s += \",\";\n                first = false;\n                s += std::to_string(c);\n            }\n            return *this;\n        }\n\n    private:\n        const Logger& logger;\n        Level level = Level::info;\n        std::string s;\n    };\n\n    class Logger final\n    {\n    public:\n        explicit Logger(Log::Level initThreshold = Log::Level::all):\n            threshold(initThreshold)\n        {\n#if !defined(__EMSCRIPTEN__)\n            logThread = Thread(&Logger::logLoop, this);\n#endif\n        }\n\n        Logger(const Logger&) = delete;\n        Logger& operator=(const Logger&) = delete;\n        Logger(Logger&&) = delete;\n        Logger& operator=(Logger&&) = delete;\n\n        ~Logger()\n        {\n#if !defined(__EMSCRIPTEN__)\n            std::unique_lock lock(queueMutex);\n            commandQueue.push(Command(Command::Type::quit));\n            lock.unlock();\n            queueCondition.notify_all();\n#endif\n        }\n\n        Log log(const Log::Level level = Log::Level::info) const\n        {\n            return Log(*this, level);\n        }\n\n        void log(const std::string& str, const Log::Level level = Log::Level::info) const\n        {\n            if (level <= threshold)\n            {\n#if defined(__EMSCRIPTEN__)\n                logString(str, level);\n#else\n                std::unique_lock lock(queueMutex);\n                commandQueue.push(Command(Command::Type::logString, level, str));\n                lock.unlock();\n                queueCondition.notify_all();\n#endif\n            }\n        }\n\n    private:\n        static void logString(const std::string& str, const Log::Level level = Log::Level::info);\n\n#ifdef DEBUG\n        std::atomic<Log::Level> threshold{Log::Level::all};\n#else\n        std::atomic<Log::Level> threshold{Log::Level::info};\n#endif\n\n#if !defined(__EMSCRIPTEN__)\n        class Command final\n        {\n        public:\n            enum class Type\n            {\n                logString,\n                quit\n            };\n\n            explicit Command(const Type initType):\n                type(initType)\n            {\n            }\n\n            Command(const Type initType, const Log::Level initLevel,\n                    const std::string& initString):\n                type(initType),\n                level(initLevel),\n                str(initString)\n            {\n            }\n\n            Type type;\n            Log::Level level = Log::Level::all;\n            std::string str;\n        };\n\n        void logLoop()\n        {\n            for (;;)\n            {\n                std::unique_lock lock(queueMutex);\n                while (commandQueue.empty()) queueCondition.wait(lock);\n                auto command = std::move(commandQueue.front());\n                commandQueue.pop();\n                lock.unlock();\n\n                if (command.type == Command::Type::logString)\n                    logString(command.str, command.level);\n                else if (command.type == Command::Type::quit)\n                    break;\n            }\n        }\n\n        mutable std::condition_variable queueCondition;\n        mutable std::mutex queueMutex;\n        mutable std::queue<Command> commandQueue;\n        Thread logThread;\n#endif\n    };\n}\n\n#endif \/\/ OUZEL_UTILS_LOG_HPP\n<commit_msg>Check also for arrays<commit_after>\/\/ Copyright 2015-2020 Elviss Strazdins. All rights reserved.\n\n#ifndef OUZEL_UTILS_LOG_HPP\n#define OUZEL_UTILS_LOG_HPP\n\n#include <atomic>\n#include <condition_variable>\n#include <cstring>\n#include <mutex>\n#include <queue>\n#include <string>\n#include <thread>\n#include <type_traits>\n#include \"..\/math\/Matrix.hpp\"\n#include \"..\/math\/Quaternion.hpp\"\n#include \"..\/math\/Size.hpp\"\n#include \"..\/math\/Vector.hpp\"\n#include \"..\/storage\/Path.hpp\"\n#include \"Thread.hpp\"\n#include \"Utils.hpp\"\n\nnamespace ouzel\n{\n    class Logger;\n\n    class Log final\n    {\n    public:\n        enum class Level\n        {\n            off,\n            error,\n            warning,\n            info,\n            all\n        };\n\n        explicit Log(const Logger& initLogger, Level initLevel = Level::info):\n            logger(initLogger), level(initLevel)\n        {\n        }\n\n        Log(const Log& other):\n            logger(other.logger),\n            level(other.level),\n            s(other.s)\n        {\n        }\n\n        Log(Log&& other) noexcept:\n            logger(other.logger),\n            level(other.level),\n            s(std::move(other.s))\n        {\n            other.level = Level::info;\n        }\n\n        Log& operator=(const Log& other)\n        {\n            if (&other == this) return *this;\n\n            level = other.level;\n            s = other.s;\n\n            return *this;\n        }\n\n        Log& operator=(Log&& other) noexcept\n        {\n            if (&other == this) return *this;\n\n            level = other.level;\n            other.level = Level::info;\n            s = std::move(other.s);\n\n            return *this;\n        }\n\n        ~Log();\n\n        Log& operator<<(const bool val)\n        {\n            s += val ? \"true\" : \"false\";\n            return *this;\n        }\n\n        Log& operator<<(const uint8_t val)\n        {\n            constexpr char digits[] = \"0123456789abcdef\";\n\n            for (std::uint32_t p = 0; p < 2; ++p)\n                s.push_back(digits[(val >> (4 - p * 4)) & 0x0F]);\n\n            return *this;\n        }\n\n        template <typename T, typename std::enable_if_t<std::is_arithmetic_v<T> &&\n            !std::is_same_v<T, bool> &&\n            !std::is_same_v<T, std::uint8_t>>* = nullptr>\n        Log& operator<<(const T val)\n        {\n            s += std::to_string(val);\n            return *this;\n        }\n\n        Log& operator<<(const std::string& val)\n        {\n            s += val;\n            return *this;\n        }\n\n        Log& operator<<(const char* val)\n        {\n            s += val;\n            return *this;\n        }\n\n        template <typename T, typename std::enable_if_t<!std::is_same_v<T, char>>* = nullptr>\n        Log& operator<<(const T* val)\n        {\n            constexpr char digits[] = \"0123456789abcdef\";\n\n            const auto ptrValue = bitCast<std::uintptr_t>(val);\n\n            for (std::size_t i = 0; i < sizeof(val) * 2; ++i)\n                s.push_back(digits[(ptrValue >> (sizeof(ptrValue) * 2 - i - 1) * 4) & 0x0F]);\n\n            return *this;\n        }\n\n        Log& operator<<(const storage::Path& val)\n        {\n            s += val;\n            return *this;\n        }\n\n        template<typename T, typename = void>\n        struct isContainer: std::false_type {};\n\n        template<typename T>\n        struct isContainer<T,\n            std::void_t<decltype(std::declval<T>().begin()),\n                decltype(std::declval<T>().end())\n            >>: std::true_type {};\n\n        template <typename T, typename std::enable_if_t<isContainer<T>::value || std::is_array_v<T>>* = nullptr>\n        Log& operator<<(const T& val)\n        {\n            bool first = true;\n            for (const auto& i : val)\n            {\n                if (!first) s += \", \";\n                first = false;\n                operator<<(i);\n            }\n\n            return *this;\n        }\n\n        template <std::size_t N, std::size_t M, class T>\n        Log& operator<<(const Matrix<N, M, T>& val)\n        {\n            bool first = true;\n\n            for (const T c : val.m)\n            {\n                if (!first) s += \",\";\n                first = false;\n                s += std::to_string(c);\n            }\n\n            return *this;\n        }\n\n        template <typename T>\n        Log& operator<<(const Quaternion<T>& val)\n        {\n            s += std::to_string(val.v[0]) + \",\" + std::to_string(val.v[1]) + \",\" +\n                std::to_string(val.v[2]) + \",\" + std::to_string(val.v[3]);\n            return *this;\n        }\n\n        template <std::size_t N, class T>\n        Log& operator<<(const Size<N, T>& val)\n        {\n            bool first = true;\n\n            for (const T c : val.v)\n            {\n                if (!first) s += \",\";\n                first = false;\n                s += std::to_string(c);\n            }\n            return *this;\n        }\n\n        template <std::size_t N, class T>\n        Log& operator<<(const Vector<N, T>& val)\n        {\n            bool first = true;\n\n            for (const T c : val.v)\n            {\n                if (!first) s += \",\";\n                first = false;\n                s += std::to_string(c);\n            }\n            return *this;\n        }\n\n    private:\n        const Logger& logger;\n        Level level = Level::info;\n        std::string s;\n    };\n\n    class Logger final\n    {\n    public:\n        explicit Logger(Log::Level initThreshold = Log::Level::all):\n            threshold(initThreshold)\n        {\n#if !defined(__EMSCRIPTEN__)\n            logThread = Thread(&Logger::logLoop, this);\n#endif\n        }\n\n        Logger(const Logger&) = delete;\n        Logger& operator=(const Logger&) = delete;\n        Logger(Logger&&) = delete;\n        Logger& operator=(Logger&&) = delete;\n\n        ~Logger()\n        {\n#if !defined(__EMSCRIPTEN__)\n            std::unique_lock lock(queueMutex);\n            commandQueue.push(Command(Command::Type::quit));\n            lock.unlock();\n            queueCondition.notify_all();\n#endif\n        }\n\n        Log log(const Log::Level level = Log::Level::info) const\n        {\n            return Log(*this, level);\n        }\n\n        void log(const std::string& str, const Log::Level level = Log::Level::info) const\n        {\n            if (level <= threshold)\n            {\n#if defined(__EMSCRIPTEN__)\n                logString(str, level);\n#else\n                std::unique_lock lock(queueMutex);\n                commandQueue.push(Command(Command::Type::logString, level, str));\n                lock.unlock();\n                queueCondition.notify_all();\n#endif\n            }\n        }\n\n    private:\n        static void logString(const std::string& str, const Log::Level level = Log::Level::info);\n\n#ifdef DEBUG\n        std::atomic<Log::Level> threshold{Log::Level::all};\n#else\n        std::atomic<Log::Level> threshold{Log::Level::info};\n#endif\n\n#if !defined(__EMSCRIPTEN__)\n        class Command final\n        {\n        public:\n            enum class Type\n            {\n                logString,\n                quit\n            };\n\n            explicit Command(const Type initType):\n                type(initType)\n            {\n            }\n\n            Command(const Type initType, const Log::Level initLevel,\n                    const std::string& initString):\n                type(initType),\n                level(initLevel),\n                str(initString)\n            {\n            }\n\n            Type type;\n            Log::Level level = Log::Level::all;\n            std::string str;\n        };\n\n        void logLoop()\n        {\n            for (;;)\n            {\n                std::unique_lock lock(queueMutex);\n                while (commandQueue.empty()) queueCondition.wait(lock);\n                auto command = std::move(commandQueue.front());\n                commandQueue.pop();\n                lock.unlock();\n\n                if (command.type == Command::Type::logString)\n                    logString(command.str, command.level);\n                else if (command.type == Command::Type::quit)\n                    break;\n            }\n        }\n\n        mutable std::condition_variable queueCondition;\n        mutable std::mutex queueMutex;\n        mutable std::queue<Command> commandQueue;\n        Thread logThread;\n#endif\n    };\n}\n\n#endif \/\/ OUZEL_UTILS_LOG_HPP\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Temporarily disable a failing ui test.<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>Uncrash BrowserFocusTest.*<commit_after><|endoftext|>"}
{"text":"<commit_before>#include <bench\/tests\/mongodb\/mongodb_facade.hpp>\n#include <boost\/algorithm\/string.hpp>\n#include <mongo\/bson\/bson.h>\n#include <iostream>\n\n#define NAMESPACE \"bench.objects\"\n\n\/\/ Calls MongoDB function, checks for error and discards result\n#define CHECK_ERROR(func, conn, ...)         \\\n    conn.func(__VA_ARGS__);                  \\\n                                             \\\n    std::string error = conn.getLastError(); \\\n    if (error != \"\") throw std::runtime_error(#func + error);\n\n\/\/ Calls MongoDB function, checks for error and store result in `result`\n#define CHECK_ERROR_STORE(func, conn, result, ...) \\\n    auto result = conn.func(__VA_ARGS__);          \\\n                                                   \\\n    std::string error = conn.getLastError();       \\\n    if (error != \"\") throw std::runtime_error(#func + error);\n\nusing namespace bench::tests::mongodb;\n\nmongodb_facade::mongodb_facade()\n{\n}\n\nmongodb_facade::~mongodb_facade()\n{\n}\n\nvoid\nmongodb_facade::connect(const std::string & cluster_uri) {\n    _conn.connect(cluster_uri);\n}\n\n\/* static *\/ mongo::BSONObj mongodb_facade::server_status(const std::string & node_uri) {\n    mongo::DBClientConnection conn;\n    conn.connect(node_uri);\n\n    mongo::BSONObj serverStatus;\n\n    if (!conn.runCommand(\"bench\", BSON(\"serverStatus\" << 1), serverStatus)) {\n        throw std::runtime_error(\"node_status: serverStatus\");\n    }\n\n    return BSON(\"server\" << serverStatus << \"db\" << mongodb_facade::db_status(node_uri));\n}\n\n\/* static *\/ mongo::BSONObj mongodb_facade::db_status(const std::string & node_uri) {\n    mongo::DBClientConnection conn;\n    conn.connect(node_uri);\n\n    mongo::BSONObj dbStats;\n    if (!conn.runCommand(\"bench\", BSON(\"dbStats\" << 1), dbStats)) {\n        throw std::runtime_error(\"node_status: dbStats\");\n    }\n\n    return dbStats;\n}\n\n\n\/* static *\/ std::vector<std::string> mongodb_facade::resolve_topology(const std::string & node_uri) {\n    mongo::DBClientConnection conn;\n    conn.connect(node_uri);\n\n    \/*\n       Our `node_uri` can be any of the following:\n\n       * an entry to a `mongos` instance, a sharded cluster;\n       * an entry to a replica set;\n       * a single node configuration.\n\n       We are going to probe for what kind of configuration we are\n       dealing with by executing the relevant admin commands, and\n       based on those responses resolve the entire topology.\n    *\/\n\n    mongo::BSONObj response;\n\n    std::vector<std::string> result;\n\n    if (conn.runCommand(\"admin\", BSON(\"listShards\" << 1), response)) {\n        \/\/ We are in sharded cluster.\n\n        for (mongo::BSONElement const & member : response[\"shards\"].Array()) {\n            \/\/ Member can be either a replica set, which looks like\n            \/\/ `rs0\/1.2.3.4:1234,4.3.2.1:4321`, or it is a regular\n            \/\/ host, which looks like `1.2.3.4:1234`.\n            std::string host = member[\"host\"].String();\n\n            std::vector<std::string> tokens;\n            boost::split(tokens, host, boost::is_any_of(\"\/\"));\n\n            if (tokens.size() == 1) {\n                \/\/ A regular host\n                result.push_back(tokens.at(0));\n            } else if (tokens.size() == 2) {\n                std::vector<std::string> hosts;\n\n                boost::split(hosts, tokens.at(1), boost::is_any_of(\",\"));\n\n                std::copy(hosts.begin(), hosts.end(),\n                          std::back_insert_iterator<std::vector<std::string>>(result));\n            } else {\n                throw std::runtime_error(\"Invalid host: \" + host);\n            }\n        }\n\n    } else if (conn.runCommand(\"admin\", BSON(\"replSetGetStatus\" << 1), response)) {\n        \/\/ A replica set has been configured.\n        for (mongo::BSONElement const & member : response[\"members\"].Array()) {\n            result.push_back(member[\"name\"].String());\n        }\n\n    } else {\n        \/\/ Single node configuration.\n        result.push_back(node_uri);\n    }\n\n    return result;\n}\n\nvoid mongodb_facade::remove(const std::string & alias)\n{\n    CHECK_ERROR(remove, _conn, NAMESPACE, MONGO_QUERY(\"_id\" << alias), true, NULL);\n}\n\nvoid mongodb_facade::blob_put(const std::string & alias, const std::string & content)\n{\n    CHECK_ERROR(insert, _conn, NAMESPACE, BSON(\"_id\" << alias << \"content\" << content));\n}\n\nvoid mongodb_facade::blob_update(const std::string & alias, const std::string & content)\n{\n    CHECK_ERROR(findAndModify, _conn, NAMESPACE, BSON(\"_id\" << alias), BSON(\"content\" << content),\n                false, true);\n}\n\nstd::string mongodb_facade::blob_get(const std::string & alias)\n{\n    CHECK_ERROR_STORE(query, _conn, cursor, NAMESPACE, MONGO_QUERY(\"_id\" << alias));\n\n    return cursor->next().getField(\"content\").String();\n}\n\nvoid mongodb_facade::int_put(const std::string & alias, std::int64_t value)\n{\n    CHECK_ERROR(insert, _conn, NAMESPACE,\n                BSON(\"_id\" << alias << \"num\" << static_cast<long long>(value)));\n}\n\nstd::int64_t mongodb_facade::int_add(const std::string & alias, std::int64_t value)\n{\n    CHECK_ERROR_STORE(findAndModify, _conn, obj, NAMESPACE, BSON(\"_id\" << alias),\n                      BSON(\"$inc\" << BSON(\"num\" << static_cast<long long>(value))), false, true);\n\n    return obj.getField(\"num\").Long();\n}\n<commit_msg>Make MongoDB sync to Journal, like quasardb does.<commit_after>#include <bench\/tests\/mongodb\/mongodb_facade.hpp>\n#include <boost\/algorithm\/string.hpp>\n#include <mongo\/bson\/bson.h>\n#include <iostream>\n\n#define NAMESPACE \"bench.objects\"\n\n\/\/ Calls MongoDB function, checks for error and discards result\n#define CHECK_ERROR(func, conn, ...)         \\\n    conn.func(__VA_ARGS__);                  \\\n                                             \\\n    std::string error = conn.getLastError(); \\\n    if (error != \"\") throw std::runtime_error(#func + error);\n\n\/\/ Calls MongoDB function, checks for error and store result in `result`\n#define CHECK_ERROR_STORE(func, conn, result, ...) \\\n    auto result = conn.func(__VA_ARGS__);          \\\n                                                   \\\n    std::string error = conn.getLastError();       \\\n    if (error != \"\") throw std::runtime_error(#func + error);\n\nusing namespace bench::tests::mongodb;\n\nmongodb_facade::mongodb_facade()\n{\n}\n\nmongodb_facade::~mongodb_facade()\n{\n}\n\nvoid mongodb_facade::connect(const std::string & cluster_uri)\n{\n    _conn.connect(cluster_uri);\n}\n\n\/* static *\/ mongo::BSONObj mongodb_facade::server_status(const std::string & node_uri)\n{\n    mongo::DBClientConnection conn;\n    conn.connect(node_uri);\n\n    mongo::BSONObj serverStatus;\n\n    if (!conn.runCommand(\"bench\", BSON(\"serverStatus\" << 1), serverStatus))\n    {\n        throw std::runtime_error(\"node_status: serverStatus\");\n    }\n\n    return BSON(\"server\" << serverStatus << \"db\" << mongodb_facade::db_status(node_uri));\n}\n\n\/* static *\/ mongo::BSONObj mongodb_facade::db_status(const std::string & node_uri)\n{\n    mongo::DBClientConnection conn;\n    conn.connect(node_uri);\n\n    mongo::BSONObj dbStats;\n    if (!conn.runCommand(\"bench\", BSON(\"dbStats\" << 1), dbStats))\n    {\n        throw std::runtime_error(\"node_status: dbStats\");\n    }\n\n    return dbStats;\n}\n\n\/* static *\/ std::vector<std::string> mongodb_facade::resolve_topology(const std::string & node_uri)\n{\n    mongo::DBClientConnection conn;\n    conn.connect(node_uri);\n\n    \/*\n       Our `node_uri` can be any of the following:\n\n       * an entry to a `mongos` instance, a sharded cluster;\n       * an entry to a replica set;\n       * a single node configuration.\n\n       We are going to probe for what kind of configuration we are\n       dealing with by executing the relevant admin commands, and\n       based on those responses resolve the entire topology.\n    *\/\n\n    mongo::BSONObj response;\n\n    std::vector<std::string> result;\n\n    if (conn.runCommand(\"admin\", BSON(\"listShards\" << 1), response))\n    {\n        \/\/ We are in sharded cluster.\n\n        for (mongo::BSONElement const & member : response[\"shards\"].Array())\n        {\n            \/\/ Member can be either a replica set, which looks like\n            \/\/ `rs0\/1.2.3.4:1234,4.3.2.1:4321`, or it is a regular\n            \/\/ host, which looks like `1.2.3.4:1234`.\n            std::string host = member[\"host\"].String();\n\n            std::vector<std::string> tokens;\n            boost::split(tokens, host, boost::is_any_of(\"\/\"));\n\n            if (tokens.size() == 1)\n            {\n                \/\/ A regular host\n                result.push_back(tokens.at(0));\n            }\n            else if (tokens.size() == 2)\n            {\n                std::vector<std::string> hosts;\n\n                boost::split(hosts, tokens.at(1), boost::is_any_of(\",\"));\n\n                std::copy(hosts.begin(), hosts.end(), std::back_insert_iterator<std::vector<std::string>>(result));\n            }\n            else\n            {\n                throw std::runtime_error(\"Invalid host: \" + host);\n            }\n        }\n    }\n    else if (conn.runCommand(\"admin\", BSON(\"replSetGetStatus\" << 1), response))\n    {\n        \/\/ A replica set has been configured.\n        for (mongo::BSONElement const & member : response[\"members\"].Array())\n        {\n            result.push_back(member[\"name\"].String());\n        }\n    }\n    else\n    {\n        \/\/ Single node configuration.\n        result.push_back(node_uri);\n    }\n\n    return result;\n}\n\nvoid mongodb_facade::remove(const std::string & alias)\n{\n    CHECK_ERROR(remove, _conn, NAMESPACE, MONGO_QUERY(\"_id\" << alias), 0, &mongo::WriteConcern::journaled);\n}\n\nvoid mongodb_facade::blob_put(const std::string & alias, const std::string & content)\n{\n    CHECK_ERROR(insert, _conn, NAMESPACE, BSON(\"_id\" << alias << \"content\" << content), 0,\n                &mongo::WriteConcern::journaled);\n}\n\nvoid mongodb_facade::blob_update(const std::string & alias, const std::string & content)\n{\n    CHECK_ERROR(findAndModify, _conn, NAMESPACE, BSON(\"_id\" << alias), BSON(\"content\" << content), false, true,\n                mongo::BSONObj(), mongo::BSONObj(), &mongo::WriteConcern::journaled);\n}\n\nstd::string mongodb_facade::blob_get(const std::string & alias)\n{\n    CHECK_ERROR_STORE(query, _conn, cursor, NAMESPACE, MONGO_QUERY(\"_id\" << alias));\n\n    return cursor->next().getField(\"content\").String();\n}\n\nvoid mongodb_facade::int_put(const std::string & alias, std::int64_t value)\n{\n    CHECK_ERROR(insert, _conn, NAMESPACE, BSON(\"_id\" << alias << \"num\" << static_cast<long long>(value)), 0,\n                &mongo::WriteConcern::journaled);\n}\n\nstd::int64_t mongodb_facade::int_add(const std::string & alias, std::int64_t value)\n{\n    CHECK_ERROR_STORE(findAndModify, _conn, obj, NAMESPACE, BSON(\"_id\" << alias),\n                      BSON(\"$inc\" << BSON(\"num\" << static_cast<long long>(value))), false, true, mongo::BSONObj(),\n                      mongo::BSONObj(), &mongo::WriteConcern::journaled);\n\n    return obj.getField(\"num\").Long();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"pacmanplugin.h\"\n\n#include <QDebug>\n#include <QProcess>\n\nPacmanPlugin::PacmanPlugin(QObject *parent) :\n\tPackageManagerPlugin(parent)\n{\n\n}\n\n\nvoid PacmanPlugin::initialize()\n{\n}\n\nQList<PacmanPlugin::FilterInfo> PacmanPlugin::extraFilters()\n{\n\tQList<PacmanPlugin::FilterInfo> list;\n\tlist.append({QStringLiteral(\"&Explicitly installed\"), QStringLiteral(\"Only explicitly installed packages\"), false});\n\tlist.append({QStringLiteral(\"&Leaf packages\"), QStringLiteral(\"Only leaf packages\"), false});\n\tlist.append({QStringLiteral(\"&AUR packages only\"), QStringLiteral(\"\"), true});\n\tlist.append({QStringLiteral(\"&Native packages only\"), QStringLiteral(\"\"), true});\n\treturn list;\n}\n\nQStringList PacmanPlugin::listAllPackages()\n{\/\/pacman -Qq\n\n}\n\nQStringList PacmanPlugin::listPackages(QVector<bool> extraFilters)\n{\n\tif(extraFilters[2] && extraFilters[3])\n\t\treturn {};\n\n\tauto queryString = QStringLiteral(\"-Qq\");\n\n\tif(extraFilters[0])\n\t\tqueryString += QLatin1Char('e');\n\tif(extraFilters[1])\n\t\tqueryString += QLatin1Char('t');\n\tif(extraFilters[2])\n\t\tqueryString += QLatin1Char('m');\n\tif(extraFilters[3])\n\t\tqueryString += QLatin1Char('n');\n\n\tQProcess p;\n\tp.start(QStringLiteral(\"pacman\"), {queryString});\n\tif(!p.waitForFinished(5000))\n\t\treturn {};\n\n\tauto list = QString::fromUtf8(p.readAll()).split(QStringLiteral(\"\\n\"), QString::SkipEmptyParts);\n\tqDebug() << list;\n\treturn list;\n}\n\nQString PacmanPlugin::installationCmd(const QStringList &packages)\n{\n}\n\nQString PacmanPlugin::uninstallationCmd(const QStringList &packages)\n{\n}\n\nbool PacmanPlugin::startGuiInstall(const QStringList &packages)\n{\n}\n\nbool PacmanPlugin::startGuiUninstall(const QStringList &packages)\n{\n}\n\nQList<PackageManagerPlugin::SettingsInfo> PacmanPlugin::listSettings()\n{\n}\n<commit_msg>pacmanplugin wip<commit_after>#include \"pacmanplugin.h\"\n\n#include <QDebug>\n#include <QProcess>\n\nPacmanPlugin::PacmanPlugin(QObject *parent) :\n\tPackageManagerPlugin(parent)\n{\n\n}\n\n\nvoid PacmanPlugin::initialize()\n{\n}\n\nQList<PacmanPlugin::FilterInfo> PacmanPlugin::extraFilters()\n{\n\tQList<PacmanPlugin::FilterInfo> list;\n\tlist.append({QStringLiteral(\"&Explicitly installed\"), QStringLiteral(\"Only explicitly installed packages\"), false});\n\tlist.append({QStringLiteral(\"&Leaf packages\"), QStringLiteral(\"Only leaf packages\"), false});\n\tlist.append({QStringLiteral(\"&AUR packages only\"), QStringLiteral(\"\"), false});\n\tlist.append({QStringLiteral(\"&Native packages only\"), QStringLiteral(\"\"), false});\n\treturn list;\n}\n\nQStringList PacmanPlugin::listAllPackages()\n{\/\/pacman -Qq\n\treturn  listPackages({false, false, false, false});\n}\n\nQStringList PacmanPlugin::listPackages(QVector<bool> extraFilters)\n{\n\tif(extraFilters[2] && extraFilters[3])\n\t\treturn {};\n\n\tauto queryString = QStringLiteral(\"-Qq\");\n\n\tif(extraFilters[0])\n\t\tqueryString += QLatin1Char('e');\n\tif(extraFilters[1])\n\t\tqueryString += QLatin1Char('t');\n\tif(extraFilters[2])\n\t\tqueryString += QLatin1Char('m');\n\tif(extraFilters[3])\n\t\tqueryString += QLatin1Char('n');\n\n\tQProcess p;\n\tp.start(QStringLiteral(\"pacman\"), {queryString});\n\tif(!p.waitForFinished(5000))\n\t\treturn {};\n\n\tauto list = QString::fromUtf8(p.readAll()).split(QStringLiteral(\"\\n\"), QString::SkipEmptyParts);\n\tqDebug() << list;\n\treturn list;\n}\n\nQString PacmanPlugin::installationCmd(const QStringList &packages)\n{\n}\n\nQString PacmanPlugin::uninstallationCmd(const QStringList &packages)\n{\n}\n\nbool PacmanPlugin::startGuiInstall(const QStringList &packages)\n{\n}\n\nbool PacmanPlugin::startGuiUninstall(const QStringList &packages)\n{\n}\n\nQList<PackageManagerPlugin::SettingsInfo> PacmanPlugin::listSettings()\n{\n}\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 <QMenuBar>\n#include <QFileDialog>\n#include <QtGui>\n\n#include \"libmv\/image\/array_nd.h\"\n#include \"libmv\/image\/surf.h\"\n#include \"libmv\/image\/surf_descriptor.h\"\n#include \"libmv\/multiview\/projection.h\"\n#include \"libmv\/multiview\/fundamental.h\"\n#include \"libmv\/multiview\/focal_from_fundamental.h\"\n#include \"libmv\/multiview\/nviewtriangulation.h\"\n#include \"libmv\/logging\/logging.h\"\n#include \"ui\/tvr\/main_window.h\"\n\n\nTvrMainWindow::TvrMainWindow(QWidget *parent)\n  : QMainWindow(parent) {\n\n  viewer2d_ = new MatchViewer();\n  viewer3d_ = new Viewer3D();\n  setCentralWidget(viewer2d_);\n  current_view_ = view2d;\n\n  CreateActions();\n  CreateMenus();\n}\n\nTvrMainWindow::~TvrMainWindow() {\n}\n\nvoid TvrMainWindow::CreateActions() {\n  open_images_action_ = new QAction(tr(\"&Open Images...\"), this);\n  open_images_action_->setShortcut(tr(\"Ctrl+O\"));\n  open_images_action_->setStatusTip(tr(\"Open an image pair\"));\n  connect(open_images_action_, SIGNAL(triggered()),\n          this, SLOT(OpenImages()));\n\n  toggle_view_action_ = new QAction(tr(\"&Toggle View\"), this);\n  toggle_view_action_->setShortcut(tr(\"TAB\"));\n  toggle_view_action_->setStatusTip(tr(\"Toggle between 2D and 3D\"));\n  connect(toggle_view_action_, SIGNAL(triggered()),\n          this, SLOT(ToggleView()));\n\n  save_blender_action_ = new QAction(tr(\"&Save as Blender...\"), this);\n  save_blender_action_->setShortcut(tr(\"Ctrl+S\"));\n  save_blender_action_->setStatusTip(tr(\"Save Scene as a Blender Script\"));\n  connect(save_blender_action_, SIGNAL(triggered()),\n          this, SLOT(SaveBlender()));\n  \n\n  compute_features_action_ = new QAction(tr(\"&Compute Features\"), this);\n  compute_features_action_->setStatusTip(tr(\"Compute Surf Features\"));\n  connect(compute_features_action_, SIGNAL(triggered()),\n          this, SLOT(ComputeFeatures()));\n  \n  compute_candidate_matches_action_ =\n      new QAction(tr(\"&Compute Candidate Matches\"), this);\n  compute_candidate_matches_action_->setStatusTip(\n      tr(\"Compute Candidate Matches\"));\n  connect(compute_candidate_matches_action_, SIGNAL(triggered()),\n          this, SLOT(ComputeCandidateMatches()));\n  \n  compute_robust_matches_action_ = new QAction(tr(\"&Compute Robust Matches\"),\n                                               this);\n  compute_robust_matches_action_->setStatusTip(tr(\"Compute Robust Matches\"));\n  connect(compute_robust_matches_action_, SIGNAL(triggered()),\n          this, SLOT(ComputeRobustMatches()));\n\n  focal_from_fundamental_action_ = new QAction(tr(\"&Focal from Fundamental\"),\n                                               this);\n  focal_from_fundamental_action_->setStatusTip(\n      tr(\"Compute Focal Distance from the Fundamental MatrixRobust Matrix\"));\n  connect(focal_from_fundamental_action_, SIGNAL(triggered()),\n          this, SLOT(FocalFromFundamental()));\n\n  metric_reconstruction_action_ = new QAction(tr(\"&Metric Reconstruction\"), this);\n  metric_reconstruction_action_->setStatusTip(tr(\n      \"Compute a metric reconstrution given the current focal length estimates\"));\n  connect(metric_reconstruction_action_, SIGNAL(triggered()),\n          this, SLOT(MetricReconstruction()));\n}\n\nvoid TvrMainWindow::CreateMenus() {\n  file_menu_ = menuBar()->addMenu(tr(\"&File\"));\n  file_menu_->addAction(open_images_action_);\n  file_menu_->addAction(save_blender_action_);\n  view_menu_ = menuBar()->addMenu(tr(\"&View\"));\n  view_menu_->addAction(toggle_view_action_);\n  matching_menu_ = menuBar()->addMenu(tr(\"&Matching\"));\n  matching_menu_->addAction(compute_features_action_);\n  matching_menu_->addAction(compute_candidate_matches_action_);\n  matching_menu_->addAction(compute_robust_matches_action_);\n  calibration_menu_ = menuBar()->addMenu(tr(\"&Calibration\"));\n  calibration_menu_->addAction(focal_from_fundamental_action_);\n  calibration_menu_->addAction(metric_reconstruction_action_);\n}\n\nvoid TvrMainWindow::OpenImages() {\n  QStringList filenames = QFileDialog::getOpenFileNames(this,\n      \"Select Two Images\", \"\", \"Image Files (*.png *.jpg *.bmp *.ppm *.pgm *.xpm)\");\n\n  if (filenames.size() == 2) {\n    for (int i = 0; i < 2; ++i) {\n      document_.images[i].load(filenames[i]);\n    }\n    viewer2d_->SetDocument(&document_);\n    viewer3d_->SetDocument(&document_);\n  } else if (filenames.size() != 0) {\n    QMessageBox::information(this, tr(\"TVR\"),\n          tr(\"Please select 2 images.\"));\n    OpenImages();\n  }\n}\n\nvoid TvrMainWindow::SaveBlender() {\n  QString filename = QFileDialog::getSaveFileName(this,\n      \"Save as Blender Script\", \"\", \"Blender Python Script (*.py)\");\n  if(filename.isNull())\n    return;\n  document_.SaveAsBlender(filename.toAscii().data());\n}\n\nvoid TvrMainWindow::ToggleView() {\n  if(current_view_ == view2d) {\n    setCentralWidget(viewer3d_);\n    current_view_ = view3d;\n  } else {\n    setCentralWidget(viewer2d_);\n    current_view_ = view2d;\n  }\n}\n\nvoid TvrMainWindow::ComputeFeatures() {\n  for (int i = 0; i < 2; ++i) {\n    ComputeFeatures(i);\n  }\n}\n  \nvoid TvrMainWindow::ComputeFeatures(int image_index) {\n  QImage &qimage = document_.images[image_index];\n  int width = qimage.width(), height = qimage.height();\n  SurfFeatureSet &fs = document_.feature_sets[image_index];\n      \n  \/\/ Convert to gray-scale.\n  \/\/ TODO(keir): Make a libmv image <-> QImage interop library inside libmv for\n  \/\/ easy bidirectional exchange of images between Qt and libmv.\n  libmv::Array3Df image(height, width, 1);\n  for (int y = 0; y < height; ++y) {\n    for (int x = 0; x < width; ++x) {\n      \/\/ TODO(pau): there are better ways to compute intensity.\n      \/\/            Implement one and put it on libmv\/image.\n      int depth = qimage.depth() \/ 8;\n      image(y, x) = 0;\n      for (int c = 0; c < depth; ++c) {\n        if (c != 3) {  \/\/ Skip alpha channel for RGBA.\n          image(y, x) = float(qimage.bits()[depth*(y * width + x) + c]);\n        }\n      }\n      image(y, x) \/= depth == 4 ? 3 : depth;\n    }\n  }\n  libmv::SurfFeatures(image, 3, 4, &fs.features);\n\n  \/\/ Build the kd-tree.\n  fs.tree.Build(&fs.features[0], fs.features.size(), 64, 10);\n\n  viewer2d_->updateGL();\n}\n\nvoid TvrMainWindow::ComputeCandidateMatches() {\n  FindCandidateMatches(document_.feature_sets[0],\n                       document_.feature_sets[1],\n                       &document_.correspondences);\n  viewer2d_->updateGL();\n}\n\nvoid TvrMainWindow::ComputeRobustMatches() {\n  libmv::Correspondences new_correspondences;\n\n  ComputeFundamental(document_.correspondences,\n                     &document_.F, &new_correspondences);\n  \n  \/\/ TODO(pau) Make sure this is not copying too many things.  We could\n  \/\/           implement an efficient swap for the biparted graph (just swaping\n  \/\/           the maps), or remove outlier tracks from the candidate matches\n  \/\/           instead of constructing a new correspondance set.\n  std::swap(document_.correspondences, new_correspondences);\n  viewer2d_->updateGL();\n}\n\nvoid TvrMainWindow::FocalFromFundamental() {\n  libmv::Vec2 p0((document_.images[0].width() - 1) \/ 2.,\n                 (document_.images[0].height() - 1) \/ 2.);\n  libmv::Vec2 p1((document_.images[1].width() - 1) \/ 2.,\n                 (document_.images[1].height() - 1) \/ 2.);\n  libmv::FocalFromFundamental(document_.F, p0, p1,\n                              &document_.focal_distance[0],\n                              &document_.focal_distance[1]);\n\n  LOG(INFO) << \"focal 0: \" << document_.focal_distance[0]\n            << \" focal 1: \" << document_.focal_distance[1] << \"\\n\";\n\n  viewer2d_->updateGL();\n}\n\nvoid TvrMainWindow::MetricReconstruction() {\n  using namespace libmv;\n\n  Vec2 p0((document_.images[0].width() - 1) \/ 2.,\n          (document_.images[0].height() - 1) \/ 2.);\n  Vec2 p1((document_.images[1].width() - 1) \/ 2.,\n          (document_.images[1].height() - 1) \/ 2.);\n  double f0 = document_.focal_distance[0];\n  double f1 = document_.focal_distance[1];\n  Mat3 K0, K1;\n  K0 << f0,  0, p0(0),\n         0, f0, p0(1),\n         0,  0,     1;\n  K1 << f1,  0, p1(0),\n         0, f1, p1(1),\n         0,  0,     1;\n  \n  \/\/ Compute essential matrix\n  Mat3 E;\n  EssentialFromFundamental(document_.F, K0, K1, &E);\n\n  \/\/ Get one match from the corresponcence structure.\n  Vec2 x[2];\n  {\n    Correspondences::TrackIterator t =\n        document_.correspondences.ScanAllTracks();\n    PointCorrespondences::Iterator it =\n        PointCorrespondences(&document_.correspondences)\n              .ScanFeaturesForTrack(t.track());\n    x[it.image()](0) = it.feature()->x();\n    x[it.image()](1) = it.feature()->y();\n    it.Next();\n    x[it.image()](0) = it.feature()->x();\n    x[it.image()](1) = it.feature()->y();\n  }\n\n  \/\/ Recover R, t from E and K\n  Mat3 R;\n  Vec3 t;\n  MotionFromEssentialAndCorrespondence(E, K0, x[0], K1, x[1], &R, &t);\n\n  LOG(INFO) << \"R:\\n\" << R << \"\\nt:\\n\" << t;\n\n  document_.K[0] = K0;\n  document_.R[0] = Mat3::Identity();\n  document_.t[0] = Vec3::Zero();\n  document_.K[1] = K1;\n  document_.R[1] = R;\n  document_.t[1] = t;\n\n  \/\/ Triangulate features.\n  {\n    std::vector<Mat34> Ps(2);\n    P_From_KRt(document_.K[0], document_.R[0], document_.t[0], &Ps[0]);\n    P_From_KRt(document_.K[1], document_.R[1], document_.t[1], &Ps[1]);\n    int n = document_.correspondences.NumTracks();\n    document_.X.resize(n);\n    int i = 0;\n    for (Correspondences::TrackIterator t =\n             document_.correspondences.ScanAllTracks(); !t.Done(); t.Next()) {\n      PointCorrespondences::Iterator it =\n          PointCorrespondences(&document_.correspondences)\n              .ScanFeaturesForTrack(t.track());\n      Mat2X x(2, 2);\n      Vec4 X;\n      x(0, it.image()) = it.feature()->x();\n      x(1, it.image()) = it.feature()->y();\n      it.Next();\n      x(0, it.image()) = it.feature()->x();\n      x(1, it.image()) = it.feature()->y();\n      NViewTriangulate(x, Ps, &X);\n      X \/= X(3);\n      document_.X[i] = X.start<3>();\n      i++;\n    }\n  }\n}\n<commit_msg>Fixed segfault on changing view in tvr.<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 <QMenuBar>\n#include <QFileDialog>\n#include <QtGui>\n\n#include \"libmv\/image\/array_nd.h\"\n#include \"libmv\/image\/surf.h\"\n#include \"libmv\/image\/surf_descriptor.h\"\n#include \"libmv\/multiview\/projection.h\"\n#include \"libmv\/multiview\/fundamental.h\"\n#include \"libmv\/multiview\/focal_from_fundamental.h\"\n#include \"libmv\/multiview\/nviewtriangulation.h\"\n#include \"libmv\/logging\/logging.h\"\n#include \"ui\/tvr\/main_window.h\"\n\n\nTvrMainWindow::TvrMainWindow(QWidget *parent)\n  : QMainWindow(parent) {\n\n  viewer2d_ = new MatchViewer();\n  setCentralWidget(viewer2d_);\n  current_view_ = view2d;\n\n  CreateActions();\n  CreateMenus();\n}\n\nTvrMainWindow::~TvrMainWindow() {\n}\n\nvoid TvrMainWindow::CreateActions() {\n  open_images_action_ = new QAction(tr(\"&Open Images...\"), this);\n  open_images_action_->setShortcut(tr(\"Ctrl+O\"));\n  open_images_action_->setStatusTip(tr(\"Open an image pair\"));\n  connect(open_images_action_, SIGNAL(triggered()),\n          this, SLOT(OpenImages()));\n\n  toggle_view_action_ = new QAction(tr(\"&Toggle View\"), this);\n  toggle_view_action_->setShortcut(tr(\"TAB\"));\n  toggle_view_action_->setStatusTip(tr(\"Toggle between 2D and 3D\"));\n  connect(toggle_view_action_, SIGNAL(triggered()),\n          this, SLOT(ToggleView()));\n\n  save_blender_action_ = new QAction(tr(\"&Save as Blender...\"), this);\n  save_blender_action_->setShortcut(tr(\"Ctrl+S\"));\n  save_blender_action_->setStatusTip(tr(\"Save Scene as a Blender Script\"));\n  connect(save_blender_action_, SIGNAL(triggered()),\n          this, SLOT(SaveBlender()));\n  \n\n  compute_features_action_ = new QAction(tr(\"&Compute Features\"), this);\n  compute_features_action_->setStatusTip(tr(\"Compute Surf Features\"));\n  connect(compute_features_action_, SIGNAL(triggered()),\n          this, SLOT(ComputeFeatures()));\n  \n  compute_candidate_matches_action_ =\n      new QAction(tr(\"&Compute Candidate Matches\"), this);\n  compute_candidate_matches_action_->setStatusTip(\n      tr(\"Compute Candidate Matches\"));\n  connect(compute_candidate_matches_action_, SIGNAL(triggered()),\n          this, SLOT(ComputeCandidateMatches()));\n  \n  compute_robust_matches_action_ = new QAction(tr(\"&Compute Robust Matches\"),\n                                               this);\n  compute_robust_matches_action_->setStatusTip(tr(\"Compute Robust Matches\"));\n  connect(compute_robust_matches_action_, SIGNAL(triggered()),\n          this, SLOT(ComputeRobustMatches()));\n\n  focal_from_fundamental_action_ = new QAction(tr(\"&Focal from Fundamental\"),\n                                               this);\n  focal_from_fundamental_action_->setStatusTip(\n      tr(\"Compute Focal Distance from the Fundamental MatrixRobust Matrix\"));\n  connect(focal_from_fundamental_action_, SIGNAL(triggered()),\n          this, SLOT(FocalFromFundamental()));\n\n  metric_reconstruction_action_ = new QAction(tr(\"&Metric Reconstruction\"), this);\n  metric_reconstruction_action_->setStatusTip(tr(\n      \"Compute a metric reconstrution given the current focal length estimates\"));\n  connect(metric_reconstruction_action_, SIGNAL(triggered()),\n          this, SLOT(MetricReconstruction()));\n}\n\nvoid TvrMainWindow::CreateMenus() {\n  file_menu_ = menuBar()->addMenu(tr(\"&File\"));\n  file_menu_->addAction(open_images_action_);\n  file_menu_->addAction(save_blender_action_);\n  view_menu_ = menuBar()->addMenu(tr(\"&View\"));\n  view_menu_->addAction(toggle_view_action_);\n  matching_menu_ = menuBar()->addMenu(tr(\"&Matching\"));\n  matching_menu_->addAction(compute_features_action_);\n  matching_menu_->addAction(compute_candidate_matches_action_);\n  matching_menu_->addAction(compute_robust_matches_action_);\n  calibration_menu_ = menuBar()->addMenu(tr(\"&Calibration\"));\n  calibration_menu_->addAction(focal_from_fundamental_action_);\n  calibration_menu_->addAction(metric_reconstruction_action_);\n}\n\nvoid TvrMainWindow::OpenImages() {\n  QStringList filenames = QFileDialog::getOpenFileNames(this,\n      \"Select Two Images\", \"\", \"Image Files (*.png *.jpg *.bmp *.ppm *.pgm *.xpm)\");\n\n  if (filenames.size() == 2) {\n    for (int i = 0; i < 2; ++i) {\n      document_.images[i].load(filenames[i]);\n    }\n    if(current_view_ != view2d)\n      ToggleView();\n    viewer2d_->SetDocument(&document_);\n  } else if (filenames.size() != 0) {\n    QMessageBox::information(this, tr(\"TVR\"),\n          tr(\"Please select 2 images.\"));\n    OpenImages();\n  }\n}\n\nvoid TvrMainWindow::SaveBlender() {\n  QString filename = QFileDialog::getSaveFileName(this,\n      \"Save as Blender Script\", \"\", \"Blender Python Script (*.py)\");\n  if(filename.isNull())\n    return;\n  document_.SaveAsBlender(filename.toAscii().data());\n}\n\nvoid TvrMainWindow::ToggleView() {\n  if(current_view_ == view2d) {\n    viewer3d_ = new Viewer3D();\n    viewer3d_->SetDocument(&document_);\n    setCentralWidget(viewer3d_);\n    current_view_ = view3d;\n  } else {\n    viewer2d_ = new MatchViewer();\n    viewer2d_->SetDocument(&document_);\n    setCentralWidget(viewer2d_);\n    current_view_ = view2d;\n  }\n}\n\nvoid TvrMainWindow::ComputeFeatures() {\n  for (int i = 0; i < 2; ++i) {\n    ComputeFeatures(i);\n  }\n}\n  \nvoid TvrMainWindow::ComputeFeatures(int image_index) {\n  QImage &qimage = document_.images[image_index];\n  int width = qimage.width(), height = qimage.height();\n  SurfFeatureSet &fs = document_.feature_sets[image_index];\n      \n  \/\/ Convert to gray-scale.\n  \/\/ TODO(keir): Make a libmv image <-> QImage interop library inside libmv for\n  \/\/ easy bidirectional exchange of images between Qt and libmv.\n  libmv::Array3Df image(height, width, 1);\n  for (int y = 0; y < height; ++y) {\n    for (int x = 0; x < width; ++x) {\n      \/\/ TODO(pau): there are better ways to compute intensity.\n      \/\/            Implement one and put it on libmv\/image.\n      int depth = qimage.depth() \/ 8;\n      image(y, x) = 0;\n      for (int c = 0; c < depth; ++c) {\n        if (c != 3) {  \/\/ Skip alpha channel for RGBA.\n          image(y, x) = float(qimage.bits()[depth*(y * width + x) + c]);\n        }\n      }\n      image(y, x) \/= depth == 4 ? 3 : depth;\n    }\n  }\n  libmv::SurfFeatures(image, 3, 4, &fs.features);\n\n  \/\/ Build the kd-tree.\n  fs.tree.Build(&fs.features[0], fs.features.size(), 64, 10);\n\n  viewer2d_->updateGL();\n}\n\nvoid TvrMainWindow::ComputeCandidateMatches() {\n  FindCandidateMatches(document_.feature_sets[0],\n                       document_.feature_sets[1],\n                       &document_.correspondences);\n  viewer2d_->updateGL();\n}\n\nvoid TvrMainWindow::ComputeRobustMatches() {\n  libmv::Correspondences new_correspondences;\n\n  ComputeFundamental(document_.correspondences,\n                     &document_.F, &new_correspondences);\n  \n  \/\/ TODO(pau) Make sure this is not copying too many things.  We could\n  \/\/           implement an efficient swap for the biparted graph (just swaping\n  \/\/           the maps), or remove outlier tracks from the candidate matches\n  \/\/           instead of constructing a new correspondance set.\n  std::swap(document_.correspondences, new_correspondences);\n  viewer2d_->updateGL();\n}\n\nvoid TvrMainWindow::FocalFromFundamental() {\n  libmv::Vec2 p0((document_.images[0].width() - 1) \/ 2.,\n                 (document_.images[0].height() - 1) \/ 2.);\n  libmv::Vec2 p1((document_.images[1].width() - 1) \/ 2.,\n                 (document_.images[1].height() - 1) \/ 2.);\n  libmv::FocalFromFundamental(document_.F, p0, p1,\n                              &document_.focal_distance[0],\n                              &document_.focal_distance[1]);\n\n  LOG(INFO) << \"focal 0: \" << document_.focal_distance[0]\n            << \" focal 1: \" << document_.focal_distance[1] << \"\\n\";\n\n  viewer2d_->updateGL();\n}\n\nvoid TvrMainWindow::MetricReconstruction() {\n  using namespace libmv;\n\n  Vec2 p0((document_.images[0].width() - 1) \/ 2.,\n          (document_.images[0].height() - 1) \/ 2.);\n  Vec2 p1((document_.images[1].width() - 1) \/ 2.,\n          (document_.images[1].height() - 1) \/ 2.);\n  double f0 = document_.focal_distance[0];\n  double f1 = document_.focal_distance[1];\n  Mat3 K0, K1;\n  K0 << f0,  0, p0(0),\n         0, f0, p0(1),\n         0,  0,     1;\n  K1 << f1,  0, p1(0),\n         0, f1, p1(1),\n         0,  0,     1;\n  \n  \/\/ Compute essential matrix\n  Mat3 E;\n  EssentialFromFundamental(document_.F, K0, K1, &E);\n\n  \/\/ Get one match from the corresponcence structure.\n  Vec2 x[2];\n  {\n    Correspondences::TrackIterator t =\n        document_.correspondences.ScanAllTracks();\n    PointCorrespondences::Iterator it =\n        PointCorrespondences(&document_.correspondences)\n              .ScanFeaturesForTrack(t.track());\n    x[it.image()](0) = it.feature()->x();\n    x[it.image()](1) = it.feature()->y();\n    it.Next();\n    x[it.image()](0) = it.feature()->x();\n    x[it.image()](1) = it.feature()->y();\n  }\n\n  \/\/ Recover R, t from E and K\n  Mat3 R;\n  Vec3 t;\n  MotionFromEssentialAndCorrespondence(E, K0, x[0], K1, x[1], &R, &t);\n\n  LOG(INFO) << \"R:\\n\" << R << \"\\nt:\\n\" << t;\n\n  document_.K[0] = K0;\n  document_.R[0] = Mat3::Identity();\n  document_.t[0] = Vec3::Zero();\n  document_.K[1] = K1;\n  document_.R[1] = R;\n  document_.t[1] = t;\n\n  \/\/ Triangulate features.\n  {\n    std::vector<Mat34> Ps(2);\n    P_From_KRt(document_.K[0], document_.R[0], document_.t[0], &Ps[0]);\n    P_From_KRt(document_.K[1], document_.R[1], document_.t[1], &Ps[1]);\n    int n = document_.correspondences.NumTracks();\n    document_.X.resize(n);\n    int i = 0;\n    for (Correspondences::TrackIterator t =\n             document_.correspondences.ScanAllTracks(); !t.Done(); t.Next()) {\n      PointCorrespondences::Iterator it =\n          PointCorrespondences(&document_.correspondences)\n              .ScanFeaturesForTrack(t.track());\n      Mat2X x(2, 2);\n      Vec4 X;\n      x(0, it.image()) = it.feature()->x();\n      x(1, it.image()) = it.feature()->y();\n      it.Next();\n      x(0, it.image()) = it.feature()->x();\n      x(1, it.image()) = it.feature()->y();\n      NViewTriangulate(x, Ps, &X);\n      X \/= X(3);\n      document_.X[i] = X.start<3>();\n      i++;\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef __EXTENSION_EXPLICIT_COUNTERSTRATEGY_HPP\n#define __EXTENSION_EXPLICIT_COUNTERSTRATEGY_HPP\n\n#include \"gr1context.hpp\"\n#include <string>\n\n\/**\n * A class that computes an explicit state counterstrategy for an unrealizable specification\n *\/\ntemplate<class T> class XExtractExplicitCounterStrategy : public T {\nprotected:\n    \/\/ New variables\n    std::string outputFilename;\n\n    \/\/ Inherited stuff used\n    using T::mgr;\n    using T::strategyDumpingData;\n    using T::livenessGuarantees;\n    using T::livenessAssumptions;\n    using T::varVectorPre;\n    using T::varVectorPost;\n    using T::varCubePostOutput;\n    using T::varCubePostInput;\n    using T::varCubePreOutput;\n    using T::varCubePreInput;\n    using T::varCubePre;\n    using T::varCubePost;\n    using T::safetyEnv;\n    using T::safetySys;\n    using T::winningPositions;\n    using T::initEnv;\n    using T::initSys;\n    using T::preVars;\n    using T::postVars;\n    using T::variableTypes;\n    using T::variables;\n    using T::variableNames;\n    using T::realizable;\n    using T::determinize;\n    using T::postInputVars;\n    using T::postOutputVars;\n    using T::doesVariableInheritType;\n\n    XExtractExplicitCounterStrategy<T>(std::list<std::string> &filenames) : T(filenames) {\n        if (filenames.size()==1) {\n            outputFilename = \"\";\n        } else {\n            outputFilename = filenames.front();\n            filenames.pop_front();\n        }\n    }\n\npublic:\n\n\/**\n * @brief Compute and print out (to stdout) an explicit-state counter strategy that is winning for\n *        the environment. The output is compatible with the old JTLV output of LTLMoP.\n *        This function requires that the unrealizability of the specification has already been\n *        detected and that the variables \"strategyDumpingData\" and\n *        \"winningPositions\" have been filled by the synthesis algorithm with meaningful data.\n * @param outputStream - Where the strategy shall be printed to.\n *\/\nvoid execute() {\n        T::execute();\n        if (!realizable) {\n            if (outputFilename==\"\") {\n                computeAndPrintExplicitStateStrategy(std::cout);\n            } else {\n                std::ofstream of(outputFilename.c_str());\n                if (of.fail()) {\n                    SlugsException ex(false);\n                    ex << \"Error: Could not open output file'\" << outputFilename << \"\\n\";\n                    throw ex;\n                }\n                computeAndPrintExplicitStateStrategy(of);\n                if (of.fail()) {\n                    SlugsException ex(false);\n                    ex << \"Error: Writing to output file'\" << outputFilename << \"failed. \\n\";\n                    throw ex;\n                }\n                of.close();\n            }\n        }\n}\n\n    \nvoid computeAndPrintExplicitStateStrategy(std::ostream &outputStream) {\n\n    \/\/ We don't want any reordering from this point onwards, as\n    \/\/ the BDD manipulations from this point onwards are 'kind of simple'.\n    mgr.setAutomaticOptimisation(false);\n\n    \/\/ List of states in existance so far. The first map\n    \/\/ maps from a BF node pointer (for the pre variable valuation) and a goal\n    \/\/ to a state number. The vector then contains the concrete valuation.\n    std::map<std::pair<size_t, std::pair<unsigned int, unsigned int> >, unsigned int > lookupTableForPastStates;\n    std::vector<BF> bfsUsedInTheLookupTable;\n    std::list<std::pair<size_t, std::pair<unsigned int, unsigned int> > > todoList;\n\n    \n    \/\/ Prepare positional strategies for the individual goals\n    std::vector<std::vector<BF> > positionalStrategiesForTheIndividualGoals(livenessAssumptions.size());\n    for (unsigned int i=0;i<livenessAssumptions.size();i++) {\n        \/\/BF casesCovered = mgr.constantFalse();\n        std::vector<BF> strategy(livenessGuarantees.size()+1);\n        for (unsigned int j=0;j<livenessGuarantees.size()+1;j++) {\n            strategy[j] = mgr.constantFalse();\n        }\n        for (auto it = strategyDumpingData.begin();it!=strategyDumpingData.end();it++) {\n            if (boost::get<0>(*it) == i) {\n                \/\/Have to cover each guarantee (since the winning strategy depends on which guarantee is being pursued)\n                \/\/Essentially, the choice of which guarantee to pursue can be thought of as a system \"move\".\n                \/\/The environment always to chooses that prevent the appropriate guarantee.\n                strategy[boost::get<1>(*it)] |= boost::get<2>(*it).UnivAbstract(varCubePostOutput) & !(strategy[boost::get<1>(*it)].ExistAbstract(varCubePost));\n            }\n        }\n        positionalStrategiesForTheIndividualGoals[i] = strategy;\n    }\n    \n    \/\/ Prepare initial to-do list from the allowed initial states. Select a single initial input valuation.\n\n    \/\/ TODO: Support for non-special-robotics semantics\n    BF todoInit = (winningPositions & initEnv & initSys);\n    while (!(todoInit.isFalse())) {\n        BF concreteState = determinize(todoInit,preVars);\n        \n        \/\/find which liveness guarantee is being prevented (finds the first liveness in order specified)\n        \/\/ Note by Ruediger here: Removed \"!livenessGuarantees[j]\" as condition as it is non-positional\n        unsigned int found_j_index = 0;\n        for (unsigned int j=0;j<livenessGuarantees.size();j++) {\n            if (!(concreteState & positionalStrategiesForTheIndividualGoals[0][j]).isFalse()) {\n                found_j_index = j;\n                break;\n            }\n        }\n            \n        std::pair<size_t, std::pair<unsigned int, unsigned int> > lookup = std::pair<size_t, std::pair<unsigned int, unsigned int> >(concreteState.getHashCode(),std::pair<unsigned int, unsigned int>(0,found_j_index));\n        lookupTableForPastStates[lookup] = bfsUsedInTheLookupTable.size();\n        bfsUsedInTheLookupTable.push_back(concreteState);\n        \/\/from now on use the same initial input valuation (but consider all other initial output valuations)\n        todoInit &= !concreteState;\n        todoList.push_back(lookup);\n    }\n\n    \/\/ Extract strategy\n    while (todoList.size()>0) {\n        std::pair<size_t, std::pair<unsigned int, unsigned int> > current = todoList.front();\n        todoList.pop_front();\n        unsigned int stateNum = lookupTableForPastStates[current];\n        BF currentPossibilities = bfsUsedInTheLookupTable[stateNum];\n        \/\/ Print state information\n        outputStream << \"State \" << stateNum << \" with rank (\" << current.second.first << \",\" << current.second.second << \") -> <\";\n        bool first = true;\n        for (unsigned int i=0;i<variables.size();i++) {\n            if (doesVariableInheritType(i,Pre)) {\n                if (first) {\n                    first = false;\n                } else {\n                    outputStream << \", \";\n                }\n                outputStream << variableNames[i] << \":\";\n                outputStream << (((currentPossibilities & variables[i]).isFalse())?\"0\":\"1\");\n            }\n        }\n\n        outputStream << \">\\n\\tWith successors : \";\n        first = true;\n\n        \/\/ Can we enforce a deadlock?\n        BF deadlockInput = (currentPossibilities & safetyEnv & !safetySys).UnivAbstract(varCubePostOutput);\n        if (deadlockInput!=mgr.constantFalse()) {\n            addDeadlocked(deadlockInput, current, bfsUsedInTheLookupTable,  lookupTableForPastStates, outputStream);\n        } else {\n\n            \/\/ No deadlock in sight -> Jump to a different liveness guarantee if necessary.\n            while ((currentPossibilities & positionalStrategiesForTheIndividualGoals[current.second.first][current.second.second])==mgr.constantFalse()) current.second.second = (current.second.second + 1) % livenessGuarantees.size();\n            currentPossibilities &= positionalStrategiesForTheIndividualGoals[current.second.first][current.second.second];\n            assert(currentPossibilities != mgr.constantFalse());\n            BF remainingTransitions = currentPossibilities;\n\n            \/\/ Choose one next input and stick to it!\n            remainingTransitions = determinize(remainingTransitions,postInputVars);\n\n            \/\/ Switching goals\n            while (!(remainingTransitions & safetySys).isFalse()) {\n\n                BF safeTransition = remainingTransitions & safetySys;\n                BF newCombination = determinize(safeTransition, postOutputVars);\n\n                \/\/ Jump as much forward  in the liveness assumption list as possible (\"stuttering avoidance\")\n                unsigned int nextLivenessAssumption = current.second.first;\n                bool firstTry = true;\n                while (((nextLivenessAssumption != current.second.first) | firstTry) && !((livenessAssumptions[nextLivenessAssumption] & newCombination).isFalse())) {\n                    nextLivenessAssumption  = (nextLivenessAssumption + 1) % livenessAssumptions.size();\n                    firstTry = false;\n                }\n\n                \/\/Mark which input has been captured by this case. Use the same input for other successors\n                remainingTransitions &= !newCombination;\n\n                \/\/ We don't need the pre information from the point onwards anymore.\n                newCombination = newCombination.ExistAbstract(varCubePre).SwapVariables(varVectorPre,varVectorPost);\n\n                unsigned int tn;\n\n                std::pair<size_t, std::pair<unsigned int, unsigned int> > target;\n\n                target = std::pair<size_t, std::pair<unsigned int, unsigned int> >(newCombination.getHashCode(),std::pair<unsigned int, unsigned int>(nextLivenessAssumption, current.second.second));\n\n                if (lookupTableForPastStates.count(target)==0) {\n                    tn = lookupTableForPastStates[target] = bfsUsedInTheLookupTable.size();\n                    bfsUsedInTheLookupTable.push_back(newCombination);\n                    todoList.push_back(target);\n                } else {\n                    tn = lookupTableForPastStates[target];\n                }\n\n                \/\/ Print\n                if (first) {\n                    first = false;\n                } else {\n                    outputStream << \", \";\n                }\n                outputStream << tn;\n\n            }\n        }\n\n        outputStream << \"\\n\";\n    }\n    }\n\n\n    \/\/This function adds a new successor-less \"state\" that captures the deadlock-causing input values\n    \/\/The outputvalues are omitted (indeed, no valuation exists that satisfies the system safeties)\n    \/\/Format compatible with JTLV counterstrategy\n\n    void addDeadlocked(BF targetPositionCandidateSet, std::pair<size_t, std::pair<unsigned int, unsigned int> > current, std::vector<BF> &bfsUsedInTheLookupTable, std::map<std::pair<size_t, std::pair<unsigned int, unsigned int> >, unsigned int > &lookupTableForPastStates, std::ostream &outputStream) {\n    \n    BF newCombination = determinize(targetPositionCandidateSet, postVars) ;\n    \n    newCombination  = (newCombination.ExistAbstract(varCubePostOutput).ExistAbstract(varCubePre)).SwapVariables(varVectorPre,varVectorPost);\n    \n    std::pair<size_t, std::pair<unsigned int, unsigned int> > target = std::pair<size_t, std::pair<unsigned int, unsigned int> >(newCombination.getHashCode(),std::pair<unsigned int, unsigned int>(current.second.first, current.second.second));\n    unsigned int tn;\n    \n    if (lookupTableForPastStates.count(target)==0) {\n        tn = lookupTableForPastStates[target] = bfsUsedInTheLookupTable.size();\n        bfsUsedInTheLookupTable.push_back(newCombination);   \n        outputStream << tn << \"\\n\";\n        \n        \/\/Note that since we are printing here, we usually end up with the states being printed out of order.\n        \/\/TOTO: print in order\n        outputStream << \"State \" << tn << \" with rank (\" << current.second.first << \",\" << current.second.second << \") -> <\";\n        bool first = true;\n        for (unsigned int i=0;i<variables.size();i++) {\n            if (doesVariableInheritType(i,PreInput)) {\n                if (first) {\n                    first = false;\n                } else {\n                    outputStream << \", \";\n                }\n                outputStream << variableNames[i] << \":\";\n                outputStream << (((newCombination & variables[i]).isFalse())?\"0\":\"1\");\n            }\n        }\n        outputStream << \">\\n\\tWith no successors.\";\n    \n    } else {\n        tn = lookupTableForPastStates[target];\n        outputStream << tn;\n    }\n    \n}\n\n\n    static GR1Context* makeInstance(std::list<std::string> &filenames) {\n        return new XExtractExplicitCounterStrategy<T>(filenames);\n    }\n};\n\n#endif\n\n<commit_msg>counterstrategy for transition goals -- fixes #10<commit_after>#ifndef __EXTENSION_EXPLICIT_COUNTERSTRATEGY_HPP\n#define __EXTENSION_EXPLICIT_COUNTERSTRATEGY_HPP\n\n#include \"gr1context.hpp\"\n#include <string>\n\n\/**\n * A class that computes an explicit state counterstrategy for an unrealizable specification\n *\/\ntemplate<class T> class XExtractExplicitCounterStrategy : public T {\nprotected:\n    \/\/ New variables\n    std::string outputFilename;\n\n    \/\/ Inherited stuff used\n    using T::mgr;\n    using T::strategyDumpingData;\n    using T::livenessGuarantees;\n    using T::livenessAssumptions;\n    using T::varVectorPre;\n    using T::varVectorPost;\n    using T::varCubePostOutput;\n    using T::varCubePostInput;\n    using T::varCubePreOutput;\n    using T::varCubePreInput;\n    using T::varCubePre;\n    using T::varCubePost;\n    using T::safetyEnv;\n    using T::safetySys;\n    using T::winningPositions;\n    using T::initEnv;\n    using T::initSys;\n    using T::preVars;\n    using T::postVars;\n    using T::variableTypes;\n    using T::variables;\n    using T::variableNames;\n    using T::realizable;\n    using T::determinize;\n    using T::postInputVars;\n    using T::postOutputVars;\n    using T::doesVariableInheritType;\n\n    XExtractExplicitCounterStrategy<T>(std::list<std::string> &filenames) : T(filenames) {\n        if (filenames.size()==1) {\n            outputFilename = \"\";\n        } else {\n            outputFilename = filenames.front();\n            filenames.pop_front();\n        }\n    }\n\npublic:\n\n\/**\n * @brief Compute and print out (to stdout) an explicit-state counter strategy that is winning for\n *        the environment. The output is compatible with the old JTLV output of LTLMoP.\n *        This function requires that the unrealizability of the specification has already been\n *        detected and that the variables \"strategyDumpingData\" and\n *        \"winningPositions\" have been filled by the synthesis algorithm with meaningful data.\n * @param outputStream - Where the strategy shall be printed to.\n *\/\nvoid execute() {\n        T::execute();\n        if (!realizable) {\n            if (outputFilename==\"\") {\n                computeAndPrintExplicitStateStrategy(std::cout);\n            } else {\n                std::ofstream of(outputFilename.c_str());\n                if (of.fail()) {\n                    SlugsException ex(false);\n                    ex << \"Error: Could not open output file'\" << outputFilename << \"\\n\";\n                    throw ex;\n                }\n                computeAndPrintExplicitStateStrategy(of);\n                if (of.fail()) {\n                    SlugsException ex(false);\n                    ex << \"Error: Writing to output file'\" << outputFilename << \"failed. \\n\";\n                    throw ex;\n                }\n                of.close();\n            }\n        }\n}\n\n    \nvoid computeAndPrintExplicitStateStrategy(std::ostream &outputStream) {\n\n    \/\/ We don't want any reordering from this point onwards, as\n    \/\/ the BDD manipulations from this point onwards are 'kind of simple'.\n    mgr.setAutomaticOptimisation(false);\n\n    \/\/ List of states in existance so far. The first map\n    \/\/ maps from a BF node pointer (for the pre variable valuation) and a goal\n    \/\/ to a state number. The vector then contains the concrete valuation.\n    std::map<std::pair<size_t, std::pair<unsigned int, unsigned int> >, unsigned int > lookupTableForPastStates;\n    std::vector<BF> bfsUsedInTheLookupTable;\n    std::list<std::pair<size_t, std::pair<unsigned int, unsigned int> > > todoList;\n\n    \n    \/\/ Prepare positional strategies for the individual goals\n    std::vector<std::vector<BF> > positionalStrategiesForTheIndividualGoals(livenessAssumptions.size());\n    for (unsigned int i=0;i<livenessAssumptions.size();i++) {\n        \/\/BF casesCovered = mgr.constantFalse();\n        std::vector<BF> strategy(livenessGuarantees.size()+1);\n        for (unsigned int j=0;j<livenessGuarantees.size()+1;j++) {\n            strategy[j] = mgr.constantFalse();\n        }\n        for (auto it = strategyDumpingData.begin();it!=strategyDumpingData.end();it++) {\n            if (boost::get<0>(*it) == i) {\n                \/\/Have to cover each guarantee (since the winning strategy depends on which guarantee is being pursued)\n                \/\/Essentially, the choice of which guarantee to pursue can be thought of as a system \"move\".\n                \/\/The environment always to chooses that prevent the appropriate guarantee.\n                strategy[boost::get<1>(*it)] |= boost::get<2>(*it).UnivAbstract(varCubePostOutput) & !(strategy[boost::get<1>(*it)].ExistAbstract(varCubePost));\n            }\n        }\n        positionalStrategiesForTheIndividualGoals[i] = strategy;\n    }\n    \n    \/\/ Prepare initial to-do list from the allowed initial states. Select a single initial input valuation.\n\n    \/\/ TODO: Support for non-special-robotics semantics\n    BF todoInit = (winningPositions & initEnv & initSys);\n    while (!(todoInit.isFalse())) {\n        BF concreteState = determinize(todoInit,preVars);\n        \n        \/\/find which liveness guarantee is being prevented (finds the first liveness in order specified)\n        \/\/ Note by Ruediger here: Removed \"!livenessGuarantees[j]\" as condition as it is non-positional\n        unsigned int found_j_index = 0;\n        for (unsigned int j=0;j<livenessGuarantees.size();j++) {\n            if (!(concreteState & positionalStrategiesForTheIndividualGoals[0][j]).isFalse()) {\n                found_j_index = j;\n                break;\n            }\n        }\n            \n        std::pair<size_t, std::pair<unsigned int, unsigned int> > lookup = std::pair<size_t, std::pair<unsigned int, unsigned int> >(concreteState.getHashCode(),std::pair<unsigned int, unsigned int>(0,found_j_index));\n        lookupTableForPastStates[lookup] = bfsUsedInTheLookupTable.size();\n        bfsUsedInTheLookupTable.push_back(concreteState);\n        \/\/from now on use the same initial input valuation (but consider all other initial output valuations)\n        todoInit &= !concreteState;\n        todoList.push_back(lookup);\n    }\n\n    \/\/ Extract strategy\n    while (todoList.size()>0) {\n        std::pair<size_t, std::pair<unsigned int, unsigned int> > current = todoList.front();\n        todoList.pop_front();\n        unsigned int stateNum = lookupTableForPastStates[current];\n        BF currentPossibilities = bfsUsedInTheLookupTable[stateNum];\n        \/\/ Print state information\n        outputStream << \"State \" << stateNum << \" with rank (\" << current.second.first << \",\" << current.second.second << \") -> <\";\n        bool first = true;\n        for (unsigned int i=0;i<variables.size();i++) {\n            if (doesVariableInheritType(i,Pre)) {\n                if (first) {\n                    first = false;\n                } else {\n                    outputStream << \", \";\n                }\n                outputStream << variableNames[i] << \":\";\n                outputStream << (((currentPossibilities & variables[i]).isFalse())?\"0\":\"1\");\n            }\n        }\n\n        outputStream << \">\\n\\tWith successors : \";\n        first = true;\n\n        \/\/ Can we enforce a deadlock?\n        BF deadlockInput = (currentPossibilities & safetyEnv & !safetySys).UnivAbstract(varCubePostOutput);\n        if (deadlockInput!=mgr.constantFalse()) {\n            addDeadlocked(deadlockInput, current, bfsUsedInTheLookupTable,  lookupTableForPastStates, outputStream);\n        } else {\n\n            \/\/ No deadlock in sight -> Jump to a different liveness guarantee if necessary.\n            while ((currentPossibilities & positionalStrategiesForTheIndividualGoals[current.second.first][current.second.second])==mgr.constantFalse()) current.second.second = (current.second.second + 1) % livenessGuarantees.size();\n            currentPossibilities &= positionalStrategiesForTheIndividualGoals[current.second.first][current.second.second];\n            assert(currentPossibilities != mgr.constantFalse());\n            BF remainingTransitions = currentPossibilities;\n\n             \/\/ Choose one next input and stick to it!\n            if (!((remainingTransitions & ! livenessGuarantees[current.second.second]).isFalse())) {\n\t      remainingTransitions = remainingTransitions & ! livenessGuarantees[current.second.second];\n\t    }\n\t    remainingTransitions = determinize(remainingTransitions,postInputVars);\n\n            \/\/ Switching goals\n            while (!(remainingTransitions & safetySys).isFalse()) {\n\n                BF safeTransition = remainingTransitions & safetySys;\n                BF newCombination = determinize(safeTransition, postOutputVars);\n\n                \/\/ Jump as much forward  in the liveness assumption list as possible (\"stuttering avoidance\")\n                unsigned int nextLivenessAssumption = current.second.first;\n                bool firstTry = true;\n                while (((nextLivenessAssumption != current.second.first) | firstTry) && !((livenessAssumptions[nextLivenessAssumption] & newCombination).isFalse())) {\n                    nextLivenessAssumption  = (nextLivenessAssumption + 1) % livenessAssumptions.size();\n                    firstTry = false;\n                }\n\n                \/\/Mark which input has been captured by this case. Use the same input for other successors\n                remainingTransitions &= !newCombination;\n\n                \/\/ We don't need the pre information from the point onwards anymore.\n                newCombination = newCombination.ExistAbstract(varCubePre).SwapVariables(varVectorPre,varVectorPost);\n\n                unsigned int tn;\n\n                std::pair<size_t, std::pair<unsigned int, unsigned int> > target;\n\n                target = std::pair<size_t, std::pair<unsigned int, unsigned int> >(newCombination.getHashCode(),std::pair<unsigned int, unsigned int>(nextLivenessAssumption, current.second.second));\n\n                if (lookupTableForPastStates.count(target)==0) {\n                    tn = lookupTableForPastStates[target] = bfsUsedInTheLookupTable.size();\n                    bfsUsedInTheLookupTable.push_back(newCombination);\n                    todoList.push_back(target);\n                } else {\n                    tn = lookupTableForPastStates[target];\n                }\n\n                \/\/ Print\n                if (first) {\n                    first = false;\n                } else {\n                    outputStream << \", \";\n                }\n                outputStream << tn;\n\n            }\n        }\n\n        outputStream << \"\\n\";\n    }\n    }\n\n\n    \/\/This function adds a new successor-less \"state\" that captures the deadlock-causing input values\n    \/\/The outputvalues are omitted (indeed, no valuation exists that satisfies the system safeties)\n    \/\/Format compatible with JTLV counterstrategy\n\n    void addDeadlocked(BF targetPositionCandidateSet, std::pair<size_t, std::pair<unsigned int, unsigned int> > current, std::vector<BF> &bfsUsedInTheLookupTable, std::map<std::pair<size_t, std::pair<unsigned int, unsigned int> >, unsigned int > &lookupTableForPastStates, std::ostream &outputStream) {\n    \n    BF newCombination = determinize(targetPositionCandidateSet, postVars) ;\n    \n    newCombination  = (newCombination.ExistAbstract(varCubePostOutput).ExistAbstract(varCubePre)).SwapVariables(varVectorPre,varVectorPost);\n    \n    std::pair<size_t, std::pair<unsigned int, unsigned int> > target = std::pair<size_t, std::pair<unsigned int, unsigned int> >(newCombination.getHashCode(),std::pair<unsigned int, unsigned int>(current.second.first, current.second.second));\n    unsigned int tn;\n    \n    if (lookupTableForPastStates.count(target)==0) {\n        tn = lookupTableForPastStates[target] = bfsUsedInTheLookupTable.size();\n        bfsUsedInTheLookupTable.push_back(newCombination);   \n        outputStream << tn << \"\\n\";\n        \n        \/\/Note that since we are printing here, we usually end up with the states being printed out of order.\n        \/\/TOTO: print in order\n        outputStream << \"State \" << tn << \" with rank (\" << current.second.first << \",\" << current.second.second << \") -> <\";\n        bool first = true;\n        for (unsigned int i=0;i<variables.size();i++) {\n            if (doesVariableInheritType(i,PreInput)) {\n                if (first) {\n                    first = false;\n                } else {\n                    outputStream << \", \";\n                }\n                outputStream << variableNames[i] << \":\";\n                outputStream << (((newCombination & variables[i]).isFalse())?\"0\":\"1\");\n            }\n        }\n        outputStream << \">\\n\\tWith no successors.\";\n    \n    } else {\n        tn = lookupTableForPastStates[target];\n        outputStream << tn;\n    }\n    \n}\n\n\n    static GR1Context* makeInstance(std::list<std::string> &filenames) {\n        return new XExtractExplicitCounterStrategy<T>(filenames);\n    }\n};\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <cctype>\n#include <chrono>\n#include <list>\n#include <string.h>\n\n#include <tclap\/CmdLine.h>\n\n#include \"core\/Halite.hpp\"\n\ninline std::istream & operator>>(std::istream & i, std::pair<signed int, signed int> & p) {\n    i >> p.first >> p.second;\n    return i;\n}\ninline std::ostream & operator<<(std::ostream & o, const std::pair<signed int, signed int> & p) {\n    o << p.first << ' ' << p.second;\n    return o;\n}\nnamespace TCLAP {\ntemplate<> struct ArgTraits< std::pair<signed int, signed int> > {\n    typedef TCLAP::ValueLike ValueCategory;\n};\n}\n\nbool quiet_output = false; \/\/Need to be passed to a bunch of classes; extern is cleaner.\nHalite * my_game; \/\/Is a pointer to avoid problems with assignment, dynamic memory, and default constructors.\n\nNetworking promptNetworking();\nvoid promptDimensions(unsigned short & w, unsigned short & h);\n\nint main(int argc, char ** argv) {\n    srand(time(NULL)); \/\/For all non-seeded randomness.\n\n    if(argc == 1) {\n        std::cout << \"You've provided the environment with no arguments.\\n\"\n        << \"If this was intentional, please ignore this message.\\n\"\n        << \"Else, please use the -h (--help) flag for usage details.\\n\";\n    }\n    \n    Networking networking;\n    std::vector<std::string> * names = NULL;\n    unsigned int id = std::chrono::duration_cast<std::chrono::seconds>(std::chrono::high_resolution_clock().now().time_since_epoch()).count();\n\n    TCLAP::CmdLine cmd(\"Halite Game Environment\", ' ', \"1.0\");\n\n    \/\/Switch Args.\n    TCLAP::SwitchArg quietSwitch(\"q\", \"quiet\", \"Runs game in quiet mode, producing machine-parsable output.\", cmd, false);\n    TCLAP::SwitchArg overrideSwitch(\"o\", \"override\", \"Overrides player-sent names using cmd args [SERVER ONLY].\", cmd, false);\n    TCLAP::SwitchArg timeoutSwitch(\"t\", \"timeout\", \"Causes game environment to ignore timeouts (give all bots infinite time).\", cmd, false);\n\n    \/\/Value Args\n    TCLAP::ValueArg< std::pair<signed int, signed int> > dimensionArgs(\"d\", \"dimensions\", \"The dimensions of the map.\", false, { 0, 0 }, \"a string containing two space-seprated positive integers\", cmd);\n    TCLAP::ValueArg<unsigned int> seedArg(\"s\", \"seed\", \"The seed for the map generator.\", false, 0, \"positive integer\", cmd);\n\n    \/\/Remaining Args, be they start commands and\/or override names. Description only includes start commands since it will only be seen on local testing.\n    TCLAP::UnlabeledMultiArg<std::string> otherArgs(\"NonspecifiedArgs\", \"Start commands for bots.\", false, \"Array of strings\", cmd);\n\n    cmd.parse(argc, argv);\n\n    unsigned short mapWidth = dimensionArgs.getValue().first;\n    unsigned short mapHeight = dimensionArgs.getValue().second;\n\n    unsigned int seed;\n    if(seedArg.getValue() != 0) seed = seedArg.getValue();\n    else seed = (std::chrono::duration_cast<std::chrono::microseconds>(std::chrono::system_clock::now().time_since_epoch()).count() % 4294967295);\n\n    quiet_output = quietSwitch.getValue();\n    bool override_names = overrideSwitch.getValue();\n    bool ignore_timeout = timeoutSwitch.getValue();\n\n    std::vector<std::string> unlabeledArgsVector = otherArgs.getValue();\n    std::list<std::string> unlabeledArgs;\n    for(auto a = unlabeledArgsVector.begin(); a != unlabeledArgsVector.end(); a++) {\n        unlabeledArgs.push_back(*a);\n    }\n\n    if(mapWidth == 0 && mapHeight == 0) {\n        promptDimensions(mapWidth, mapHeight);\n    }\n\n    if(override_names) {\n        if(unlabeledArgs.size() < 4 || unlabeledArgs.size() % 2 != 0) {\n            std::cout << \"Invalid player parameters from argv. Prompting instead (override disabled):\" << std::endl;\n            networking = promptNetworking();\n        }\n        else {\n            try {\n                names = new std::vector<std::string>();\n                while(!unlabeledArgs.empty()) {\n                    networking.startAndConnectBot(unlabeledArgs.front());\n                    unlabeledArgs.pop_front();\n                    names->push_back(unlabeledArgs.front());\n                    unlabeledArgs.pop_front();\n                }\n            }\n            catch(...) {\n                std::cout << \"Invalid player parameters from argv. Prompting instead (override disabled):\" << std::endl;\n                networking = promptNetworking();\n                delete names;\n                names = NULL;\n            }\n        }\n    }\n    else {\n        if(unlabeledArgs.size() < 2) {\n            std::cout << \"Invalid player parameters from argv. Prompting instead:\" << std::endl;\n            networking = promptNetworking();\n        }\n        try {\n            while(!unlabeledArgs.empty()) {\n                std::cout << unlabeledArgs.front() << std::endl;\n                networking.startAndConnectBot(unlabeledArgs.front());\n                unlabeledArgs.pop_front();\n            }\n        }\n        catch(...) {\n            std::cout << \"Invalid player parameters from argv. Prompting instead:\" << std::endl;\n            networking = promptNetworking();\n        }\n    }\n\n    \/\/Create game. Null parameters will be ignored.\n    my_game = new Halite(mapWidth, mapHeight, seed, networking, ignore_timeout);\n\n    GameStatistics stats = my_game->runGame(names, seed, id);\n    if(names != NULL) delete names;\n\n    std::string victoryOut;\n    if(quiet_output) {\n        std::cout << stats;\n    }\n    else {\n        for(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    }\n\n    delete my_game;\n\n    return 0;\n}\n\nNetworking promptNetworking() {\n    Networking n;\n    std::string in;\n    bool done = false;\n    for(int np = 0; !done; np++) {\n        \/\/If less than 2, bypass this step: Ask if the user like to add another AI\n        if (np >= 2) {\n            std::cout << \"Would you like to add another player? Please enter Yes or No: \";\n            while (true) {\n                std::getline(std::cin, in);\n                std::transform(in.begin(), in.end(), in.begin(), ::tolower);\n                if (in == \"n\" || in == \"no\" || in == \"nope\" || in == \"y\" || in == \"yes\" || in == \"yep\") break;\n                std::cout << \"That isn't a valid input. Please enter Yes or No: \";\n            }\n            if (in == \"n\" || in == \"no\" || in == \"nope\") break;\n        }\n\n        while (true) {\n            std::string startCommand;\n            std::cout << \"What is the start command for this bot: \";\n            std::getline(std::cin, startCommand);\n\n            try{\n                n.startAndConnectBot(startCommand);\n                break;\n            }\n            catch (int e) {\n                std::cout << \"There was a problem with that start command. Please enter another one.\\n\";\n            }\n        }\n\n        std::cout << \"Connected to player #\" << int(np + 1) << std::endl;\n    }\n    return n;\n}\n\nvoid promptDimensions(unsigned short & w, unsigned short & h) {\n    std::string in;\n    std::cout << \"Please enter the width of the map: \";\n    std::getline(std::cin, in);\n    while(true) {\n        try{\n            w = std::stoi(in);\n            break;\n        }\n        catch(std::exception e) {\n            std::cout << \"That isn't a valid input. Please enter a positive integer width of the map: \";\n            std::getline(std::cin, in);\n        }\n    }\n    std::cout << \"Please enter the height of the map: \";\n    std::getline(std::cin, in);\n    while(true) {\n        try{\n            h = std::stoi(in);\n            break;\n        }\n        catch(std::exception e) {\n            std::cout << \"That isn't a valid input. Please enter a positive integer height of the map: \";\n            std::getline(std::cin, in);\n        }\n    }\n}\n<commit_msg>Minor change to env docs<commit_after>#include <iostream>\n#include <cctype>\n#include <chrono>\n#include <list>\n#include <string.h>\n\n#include <tclap\/CmdLine.h>\n\n#include \"core\/Halite.hpp\"\n\ninline std::istream & operator>>(std::istream & i, std::pair<signed int, signed int> & p) {\n    i >> p.first >> p.second;\n    return i;\n}\ninline std::ostream & operator<<(std::ostream & o, const std::pair<signed int, signed int> & p) {\n    o << p.first << ' ' << p.second;\n    return o;\n}\nnamespace TCLAP {\ntemplate<> struct ArgTraits< std::pair<signed int, signed int> > {\n    typedef TCLAP::ValueLike ValueCategory;\n};\n}\n\nbool quiet_output = false; \/\/Need to be passed to a bunch of classes; extern is cleaner.\nHalite * my_game; \/\/Is a pointer to avoid problems with assignment, dynamic memory, and default constructors.\n\nNetworking promptNetworking();\nvoid promptDimensions(unsigned short & w, unsigned short & h);\n\nint main(int argc, char ** argv) {\n    srand(time(NULL)); \/\/For all non-seeded randomness.\n\n    if(argc == 1) {\n        std::cout << \"You've provided the environment with no arguments.\\n\"\n        << \"If this was intentional, please ignore this message.\\n\"\n        << \"Else, please use the --help flag for usage details.\\n\";\n    }\n    \n    Networking networking;\n    std::vector<std::string> * names = NULL;\n    unsigned int id = std::chrono::duration_cast<std::chrono::seconds>(std::chrono::high_resolution_clock().now().time_since_epoch()).count();\n\n    TCLAP::CmdLine cmd(\"Halite Game Environment\", ' ', \"1.0.1\");\n\n    \/\/Switch Args.\n    TCLAP::SwitchArg quietSwitch(\"q\", \"quiet\", \"Runs game in quiet mode, producing machine-parsable output.\", cmd, false);\n    TCLAP::SwitchArg overrideSwitch(\"o\", \"override\", \"Overrides player-sent names using cmd args [SERVER ONLY].\", cmd, false);\n    TCLAP::SwitchArg timeoutSwitch(\"t\", \"timeout\", \"Causes game environment to ignore timeouts (give all bots infinite time).\", cmd, false);\n\n    \/\/Value Args\n    TCLAP::ValueArg< std::pair<signed int, signed int> > dimensionArgs(\"d\", \"dimensions\", \"The dimensions of the map.\", false, { 0, 0 }, \"a string containing two space-seprated positive integers\", cmd);\n    TCLAP::ValueArg<unsigned int> seedArg(\"s\", \"seed\", \"The seed for the map generator.\", false, 0, \"positive integer\", cmd);\n\n    \/\/Remaining Args, be they start commands and\/or override names. Description only includes start commands since it will only be seen on local testing.\n    TCLAP::UnlabeledMultiArg<std::string> otherArgs(\"NonspecifiedArgs\", \"Start commands for bots.\", false, \"Array of strings\", cmd);\n\n    cmd.parse(argc, argv);\n\n    unsigned short mapWidth = dimensionArgs.getValue().first;\n    unsigned short mapHeight = dimensionArgs.getValue().second;\n\n    unsigned int seed;\n    if(seedArg.getValue() != 0) seed = seedArg.getValue();\n    else seed = (std::chrono::duration_cast<std::chrono::microseconds>(std::chrono::system_clock::now().time_since_epoch()).count() % 4294967295);\n\n    quiet_output = quietSwitch.getValue();\n    bool override_names = overrideSwitch.getValue();\n    bool ignore_timeout = timeoutSwitch.getValue();\n\n    std::vector<std::string> unlabeledArgsVector = otherArgs.getValue();\n    std::list<std::string> unlabeledArgs;\n    for(auto a = unlabeledArgsVector.begin(); a != unlabeledArgsVector.end(); a++) {\n        unlabeledArgs.push_back(*a);\n    }\n\n    if(mapWidth == 0 && mapHeight == 0) {\n        promptDimensions(mapWidth, mapHeight);\n    }\n\n    if(override_names) {\n        if(unlabeledArgs.size() < 4 || unlabeledArgs.size() % 2 != 0) {\n            std::cout << \"Invalid player parameters from argv. Prompting instead (override disabled):\" << std::endl;\n            networking = promptNetworking();\n        }\n        else {\n            try {\n                names = new std::vector<std::string>();\n                while(!unlabeledArgs.empty()) {\n                    networking.startAndConnectBot(unlabeledArgs.front());\n                    unlabeledArgs.pop_front();\n                    names->push_back(unlabeledArgs.front());\n                    unlabeledArgs.pop_front();\n                }\n            }\n            catch(...) {\n                std::cout << \"Invalid player parameters from argv. Prompting instead (override disabled):\" << std::endl;\n                networking = promptNetworking();\n                delete names;\n                names = NULL;\n            }\n        }\n    }\n    else {\n        if(unlabeledArgs.size() < 2) {\n            std::cout << \"Invalid player parameters from argv. Prompting instead:\" << std::endl;\n            networking = promptNetworking();\n        }\n        try {\n            while(!unlabeledArgs.empty()) {\n                std::cout << unlabeledArgs.front() << std::endl;\n                networking.startAndConnectBot(unlabeledArgs.front());\n                unlabeledArgs.pop_front();\n            }\n        }\n        catch(...) {\n            std::cout << \"Invalid player parameters from argv. Prompting instead:\" << std::endl;\n            networking = promptNetworking();\n        }\n    }\n\n    \/\/Create game. Null parameters will be ignored.\n    my_game = new Halite(mapWidth, mapHeight, seed, networking, ignore_timeout);\n\n    GameStatistics stats = my_game->runGame(names, seed, id);\n    if(names != NULL) delete names;\n\n    std::string victoryOut;\n    if(quiet_output) {\n        std::cout << stats;\n    }\n    else {\n        for(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    }\n\n    delete my_game;\n\n    return 0;\n}\n\nNetworking promptNetworking() {\n    Networking n;\n    std::string in;\n    bool done = false;\n    for(int np = 0; !done; np++) {\n        \/\/If less than 2, bypass this step: Ask if the user like to add another AI\n        if (np >= 2) {\n            std::cout << \"Would you like to add another player? Please enter Yes or No: \";\n            while (true) {\n                std::getline(std::cin, in);\n                std::transform(in.begin(), in.end(), in.begin(), ::tolower);\n                if (in == \"n\" || in == \"no\" || in == \"nope\" || in == \"y\" || in == \"yes\" || in == \"yep\") break;\n                std::cout << \"That isn't a valid input. Please enter Yes or No: \";\n            }\n            if (in == \"n\" || in == \"no\" || in == \"nope\") break;\n        }\n\n        while (true) {\n            std::string startCommand;\n            std::cout << \"What is the start command for this bot: \";\n            std::getline(std::cin, startCommand);\n\n            try{\n                n.startAndConnectBot(startCommand);\n                break;\n            }\n            catch (int e) {\n                std::cout << \"There was a problem with that start command. Please enter another one.\\n\";\n            }\n        }\n\n        std::cout << \"Connected to player #\" << int(np + 1) << std::endl;\n    }\n    return n;\n}\n\nvoid promptDimensions(unsigned short & w, unsigned short & h) {\n    std::string in;\n    std::cout << \"Please enter the width of the map: \";\n    std::getline(std::cin, in);\n    while(true) {\n        try{\n            w = std::stoi(in);\n            break;\n        }\n        catch(std::exception e) {\n            std::cout << \"That isn't a valid input. Please enter a positive integer width of the map: \";\n            std::getline(std::cin, in);\n        }\n    }\n    std::cout << \"Please enter the height of the map: \";\n    std::getline(std::cin, in);\n    while(true) {\n        try{\n            h = std::stoi(in);\n            break;\n        }\n        catch(std::exception e) {\n            std::cout << \"That isn't a valid input. Please enter a positive integer height of the map: \";\n            std::getline(std::cin, in);\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Disable tap to click by default<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/reflex:$Id$\n\/\/ Author: Stefan Roiser 2006\n\n\/\/ Copyright CERN, CH-1211 Geneva 23, 2004-2006, All rights reserved.\n\/\/\n\/\/ Permission to use, copy, modify, and distribute this software for any\n\/\/ purpose is hereby granted without fee, provided that this copyright and\n\/\/ permissions notice appear in all copies and derivatives.\n\/\/\n\/\/ This software is provided \"as is\" without express or implied warranty.\n\n#ifndef REFLEX_BUILD\n#define REFLEX_BUILD\n#endif\n\n#include \"NameLookup.h\"\n#include \"Reflex\/Base.h\"\n#include \"Reflex\/Scope.h\"\n#include \"Reflex\/Type.h\"\n#include \"Reflex\/Tools.h\"\n#include \"Reflex\/internal\/OwnedMember.h\"\n\n#include <sstream>\n#include <string.h>\n\n\/\/______________________________________________________________________________\nReflex::NameLookup::NameLookup(const std::string& name, const Scope& current):\n   fLookupName(name), fPosNamePart(0), fPosNamePartLen(std::string::npos),\n   fCurrentScope(current), fPartialSuccess(false)\n{\n   \/\/ Initialize a NameLookup object used internally to keep track of lookup\n   \/\/ states.\n}\n\n\/\/______________________________________________________________________________\nReflex::Type Reflex::NameLookup::LookupType(const std::string& nam, const Scope& current)\n{\n   \/\/ Lookup up a (possibly scoped) type name appearing in the scope context\n   \/\/ current. This is the public interface for type lookup.\n   NameLookup lookup(nam, current);\n   return lookup.Lookup<Type>();\n}\n\n\/\/______________________________________________________________________________\nReflex::Scope Reflex::NameLookup::LookupScope(const std::string& nam, const Scope& current)\n{\n   \/\/ Lookup up a (possibly scoped) scope name appearing in the scope context\n   \/\/ current. This is the public interface for scope lookup.\n   NameLookup lookup(nam, current);\n   return lookup.Lookup<Scope>();\n}\n\n\/*\n\/\/______________________________________________________________________________\nReflex::Member LookupMember(const std::string& nam, const Scope& current )\n{\n   \/\/ Lookup up a (possibly scoped) member name appearing in the scope context\n   \/\/ current. This is the public interface for member lookup.\n   NameLookup lookup(nam, current);\n   \/\/ this will not work, member lookup is too different from type lookup...\n   return lookup.Lookup<Member>();\n}\n*\/\n\n\/\/______________________________________________________________________________\ntemplate<class T> T Reflex::NameLookup::Lookup(bool isTemplateExpanded \/* = false *\/)\n{\n   \/\/ Lookup a type using fLookupName, fCurrentScope.\n\n   Scope startScope = fCurrentScope;\n   T result;\n\n   fPartialSuccess = false;\n   fPosNamePart = 0;\n   fPosNamePartLen = std::string::npos;\n   FindNextScopePos();\n   if (fPosNamePart == 2) {\n      fLookedAtUsingDir.clear();\n      \/\/ ::A...\n      fCurrentScope = Scope::GlobalScope();\n      result = LookupInScope<T>();\n   } else {\n      \/\/ A...\n      result = LookupInUnknownScope<T>();\n   }\n\n   if (!isTemplateExpanded && !result && fLookupName.find('<') != std::string::npos) {\n\n      \/\/ We need to replace the template argument both of this type\n      \/\/ and any of it enclosing type:\n      \/\/    myspace::mytop<A,B>::mytype<C>\n      \n      std::ostringstream tmp;\n      for(size_t i = 0, level = 0, sofar = 0; i < fLookupName.size(); ++i) {\n         if (level==0) {\n            tmp << fLookupName.substr( sofar, i+1 - sofar );\n            sofar = i+1;\n         }\n         switch( fLookupName[i] ) {\n            case '<': ++level; break;\n            case '>': --level; \/\/ intentional fall through to the ',' case\n            case ',':\n               if (level == (1 - (int)(fLookupName[i]=='>'))) {\n                  std::string arg( fLookupName.substr( sofar, i-sofar) );\n                  \n                  size_t p = arg.size();\n         \n                  while (p > 0 && (arg[p-1] == '*' || arg[p-1] == '&'))\n                     --p;\n                  \n                  std::string end( arg.substr( p ) );\n                  arg.erase( p  );\n\n                  const char *start = arg.c_str();\n                  while(strncmp(start,\"const \",6)==0) start+=6;\n\n                  tmp << arg.substr( 0, start - arg.c_str() );\n                  arg.erase(0, start - arg.c_str() ); \n\n                  Reflex::Type type( LookupType(arg , startScope ));\n\n                  if (type) {\n                     if (type.Name()!=\"Double32_t\" && type.Name()!=\"Float16_t\") {\n                        \/\/ Use the real type rather than the typedef unless\n                        \/\/ this is Double32_t or Float16_t\n                        type = type.FinalType();\n                     }\n                     tmp << type.Name(Reflex::SCOPED|Reflex::QUALIFIED);\n                  } else {\n                     tmp << arg;\n                  }\n                  tmp << end;\n                  \n                  tmp << fLookupName[i];\n\n                  sofar = i+1;\n               } \n               break;\n         }      \n      }\n      NameLookup next( tmp.str(), startScope );\n      return next.Lookup<T>(true);\n   }\n\n\n   return result;\n}\n\n\/\/______________________________________________________________________________\ntemplate<class T> T Reflex::NameLookup::LookupInScope()\n{\n   \/\/ Lookup a type in fCurrentScope.\n   \/\/ Checks sub-types, sub-scopes, using directives, and base classes for\n   \/\/ the name given by fLookupName, fPosNamePart, and fPosNamePartLen.\n   \/\/ If the name part is found, and another name part follows in fPosNamePart,\n   \/\/ LookupTypeInScope requests the scope found to lookup the next name\n   \/\/ part. fPartialMatch reflexts that the left part of the name was matched;\n   \/\/ even if the trailing part of fLookupName cannot be found, the lookup\n   \/\/ cannot continue on declaring scopes and has to fail.\n   \/\/ A list of lookups performed in namespaces pulled in via using directives is\n   \/\/ kept in fLookedAtUsingDir, to prevent infinite loops due to\n   \/\/   namespace A{using namespace B;} namespace B{using namespace A;}\n   \/\/ loops.\n   \/\/ The lookup does not take the declaration order into account; the result of\n   \/\/ parts of the lookup algorithm which depend on the order will be unpredictable.\n\n   if (!fCurrentScope) {\n      return Dummy::Get<T>();\n   }\n\n   \/\/ prevent inf loop from\n   \/\/ ns A { using ns B; } ns B {using ns A;}\n   if (fLookedAtUsingDir.find(fCurrentScope) != fLookedAtUsingDir.end()) {\n      return Dummy::Get<T>();\n   }\n\n   int len = fCurrentScope.SubTypeSize();\n   int i = 0;\n   for (Type_Iterator it = fCurrentScope.SubType_Begin(); i < len; ++it, ++i) {\n      const Type& type = *it;\n      const TypeBase* base = type.ToTypeBase();\n      if (base) {\n         size_t pos;\n         const std::string &name(base->SimpleName(pos));\n         \/\/fprintf(stderr, \"Reflex::NameLookup::LookupInScope<T>: looking up '%s', considering subscope '%s' ...\\n\", fLookupName.c_str(), name.c_str());\n         if (\n            (fLookupName[fPosNamePart] == name[pos]) &&\n            !fLookupName.compare(fPosNamePart, fPosNamePartLen, name, pos, name.length())\n         ) {\n            \/\/fprintf(stderr, \"Reflex::NameLookup::LookupInScope<T>: lookup up '%s', partial success with subscope '%s' ...\\n\", fLookupName.c_str(), name.c_str());\n            fPartialSuccess = true;\n            fLookedAtUsingDir.clear();\n            FindNextScopePos();\n            if (fPosNamePart == std::string::npos) {\n               return type;\n            }\n            if (it->IsTypedef()) {\n               fCurrentScope = it->FinalType();\n            }\n            else {\n               fCurrentScope = type;\n            }\n            return LookupInScope< T >();\n         }\n      }\n   }\n\n   Scope_Iterator subscope_end(fCurrentScope.SubScope_End());\n   for (Scope_Iterator in = fCurrentScope.SubScope_Begin(); in != subscope_end; ++in) {\n      \/\/ only take namespaces into account - classes were checked as part of SubType\n      if (in->IsNamespace()) {\n         const Scope& scope = *in;\n         const ScopeBase* base = scope.ToScopeBase();\n         if (base) {\n            size_t pos;\n            const std::string& name(base->SimpleName(pos));\n            if (\n               (fLookupName[fPosNamePart] == name[pos]) &&\n               !fLookupName.compare(fPosNamePart, fPosNamePartLen, name, pos, name.length())\n            ) {\n               fPartialSuccess = true;\n               fLookedAtUsingDir.clear();\n               FindNextScopePos();\n               if (fPosNamePart == std::string::npos) {\n                  return (T) (*in);\n               }\n               fCurrentScope = (Scope) (*in);\n               return LookupInScope<T>();\n            }\n         }\n      }\n   }\n\n   if (fCurrentScope.UsingDirectiveSize()) {\n      fLookedAtUsingDir.insert(fCurrentScope);\n      Scope storeCurrentScope = fCurrentScope;\n      Scope_Iterator usingscope_end(storeCurrentScope.UsingDirective_End());\n      for (Scope_Iterator si = storeCurrentScope.UsingDirective_Begin(); si != usingscope_end; ++si) {\n         fCurrentScope = *si;\n         T t = LookupInScope<T>();\n         if (fPartialSuccess) {\n            return t;\n         }\n      }\n      fCurrentScope = storeCurrentScope;\n   }\n\n   if (!fPosNamePart) { \/\/ only for \"BaseClass...\", not for \"A::BaseClass...\"\n      Base_Iterator base_end(fCurrentScope.Base_End());\n      for (Base_Iterator bi = fCurrentScope.Base_Begin(); bi != base_end; ++bi) {\n         if (!fLookupName.compare(fPosNamePart, fPosNamePartLen, bi->Name())) {\n            fPartialSuccess = true;\n            fLookedAtUsingDir.clear();\n            FindNextScopePos();\n            if (fPosNamePart == std::string::npos) {\n               return bi->ToType();\n            }\n            fCurrentScope = bi->ToType().FinalType();\n            return LookupInScope< T >();\n         }\n      }\n   }\n\n   if (fCurrentScope.BaseSize()) {\n      Scope storeCurrentScope = fCurrentScope;\n      Base_Iterator base_end(storeCurrentScope.Base_End());\n      for (Base_Iterator bi = storeCurrentScope.Base_Begin(); bi != base_end; ++bi) {\n         fCurrentScope = bi->ToScope();\n         T t = LookupInScope<T>();\n         if (fPartialSuccess) {\n            return t;\n         }\n      }\n      fCurrentScope = storeCurrentScope;\n   }\n\n   return Dummy::Get<T>();\n}\n\n\/\/______________________________________________________________________________\ntemplate<class T> T Reflex::NameLookup::LookupInUnknownScope()\n{\n   \/\/ Lookup a type in fCurrentScope and its declaring scopes.\n   for (fPartialSuccess = false; !fPartialSuccess && fCurrentScope; fCurrentScope = fCurrentScope.DeclaringScope()) {\n      fLookedAtUsingDir.clear();\n      T t = LookupInScope<T>();\n      if (fPartialSuccess) {\n         return t;\n      }\n      if (fCurrentScope.IsTopScope()) {\n         break;\n      }\n   }\n   return Dummy::Get<T>();\n}\n\n\/\/______________________________________________________________________________\nReflex::Member Reflex::NameLookup::LookupMember(const std::string& nam, const Scope& current)\n{\n   \/\/ Lookup a member.\n   if (Tools::GetBasePosition(nam)) {\n      return LookupMemberQualified(nam);\n   }\n   return LookupMemberUnqualified(nam, current);\n}\n\n\/\/______________________________________________________________________________\nReflex::Member Reflex::NameLookup::LookupMemberQualified(const std::string& nam)\n{\n   \/\/ Lookup of a qualified member.\n   Scope bscope = Scope::ByName(Tools::GetScopeName(nam));\n   if (bscope) {\n      return LookupMemberUnqualified(Tools::GetBaseName(nam), bscope);\n   }\n   return Dummy::Member();\n}\n\n\/\/______________________________________________________________________________\nReflex::Member Reflex::NameLookup::LookupMemberUnqualified(const std::string& nam, const Scope& current)\n{\n   \/\/ Lookup of an unqualified member.\n   {\n      Member m = current.MemberByName(nam);\n      if (m) {\n         return m;\n      }\n   }\n   for (Scope_Iterator si = current.UsingDirective_Begin(); si != current.UsingDirective_End(); ++si) {\n      Member m = LookupMember(nam, *si);\n      if (m) {\n         return m;\n      }\n   }\n   for (Base_Iterator bi = current.Base_Begin(); bi != current.Base_End(); ++bi) {\n      Member m = LookupMember(nam, bi->ToScope());\n      if (m) {\n         return m;\n      }\n   }\n   if (!current.IsTopScope()) {\n      return LookupMember(nam, current.DeclaringScope());\n   }\n   return Dummy::Member();\n}\n\n\/\/______________________________________________________________________________\nReflex::Type Reflex::NameLookup::AccessControl(const Type& typ, const Scope& \/*current*\/)\n{\n   \/\/ Check access.\n   \/\/ if (typ.IsPublic()) {\n   \/\/    return true;\n   \/\/ }\n   \/\/ else if (typ.IsProtected() && current.HasBase(typ.DeclaringScope())) {\n   \/\/    return true;\n   \/\/ }\n   return typ;\n}\n\n\/\/______________________________________________________________________________\nvoid Reflex::NameLookup::FindNextScopePos()\n{\n   \/\/ Move fPosNamePart to point to the next scope in fLookupName, updating\n   \/\/ fPosNamePartLen. If fPosNamePartLen == std::string::npos, initialize\n   \/\/ fPosNamePart and fPosNamePartLen. If there is no next scope left, fPosNamePart\n   \/\/ will be set to std::string::npos and fPosNamePartLen will be set to 0.\n   if (fPosNamePartLen != std::string::npos) {\n      \/\/ we know the length, so jump\n      fPosNamePart += fPosNamePartLen + 2;\n      if (fPosNamePart > fLookupName.length()) {\n         \/\/ past the string's end?\n         fPosNamePart = std::string::npos;\n         fPosNamePartLen = 0;\n         return;\n      }\n   }\n   else {\n      \/\/ uninitialized\n      \/\/ set fPosNamePartLen and check that fLookupName doesn't start with '::'\n      fPosNamePart = 0;\n      if (!fLookupName.compare(0, 2, \"::\")) {\n         fPosNamePart = 2;\n      }\n   }\n   fPosNamePartLen = Tools::GetFirstScopePosition(fLookupName.substr(fPosNamePart));\n   if (!fPosNamePartLen) { \/\/ no next \"::\"\n      fPosNamePartLen = fLookupName.length();\n   }\n   else { \/\/ no \"::\"\n      fPosNamePartLen -= 2;\n   }\n}\n\n<commit_msg>From Paul and Philippe: In NameLookup when expanding template parameters,  also _unconditionally_ strip the prefix std:: to match the fact that Cint(5) ignores it. With this updates, all ROOT dictionary should  be properly generated and compiled.  Now on to the bold frontier (roottest).<commit_after>\/\/ @(#)root\/reflex:$Id$\n\/\/ Author: Stefan Roiser 2006\n\n\/\/ Copyright CERN, CH-1211 Geneva 23, 2004-2006, All rights reserved.\n\/\/\n\/\/ Permission to use, copy, modify, and distribute this software for any\n\/\/ purpose is hereby granted without fee, provided that this copyright and\n\/\/ permissions notice appear in all copies and derivatives.\n\/\/\n\/\/ This software is provided \"as is\" without express or implied warranty.\n\n#ifndef REFLEX_BUILD\n#define REFLEX_BUILD\n#endif\n\n#include \"NameLookup.h\"\n#include \"Reflex\/Base.h\"\n#include \"Reflex\/Scope.h\"\n#include \"Reflex\/Type.h\"\n#include \"Reflex\/Tools.h\"\n#include \"Reflex\/internal\/OwnedMember.h\"\n\n#include <sstream>\n#include <string.h>\n\n\/\/______________________________________________________________________________\nReflex::NameLookup::NameLookup(const std::string& name, const Scope& current):\n   fLookupName(name), fPosNamePart(0), fPosNamePartLen(std::string::npos),\n   fCurrentScope(current), fPartialSuccess(false)\n{\n   \/\/ Initialize a NameLookup object used internally to keep track of lookup\n   \/\/ states.\n}\n\n\/\/______________________________________________________________________________\nReflex::Type Reflex::NameLookup::LookupType(const std::string& nam, const Scope& current)\n{\n   \/\/ Lookup up a (possibly scoped) type name appearing in the scope context\n   \/\/ current. This is the public interface for type lookup.\n   NameLookup lookup(nam, current);\n   return lookup.Lookup<Type>();\n}\n\n\/\/______________________________________________________________________________\nReflex::Scope Reflex::NameLookup::LookupScope(const std::string& nam, const Scope& current)\n{\n   \/\/ Lookup up a (possibly scoped) scope name appearing in the scope context\n   \/\/ current. This is the public interface for scope lookup.\n   NameLookup lookup(nam, current);\n   return lookup.Lookup<Scope>();\n}\n\n\/*\n\/\/______________________________________________________________________________\nReflex::Member LookupMember(const std::string& nam, const Scope& current )\n{\n   \/\/ Lookup up a (possibly scoped) member name appearing in the scope context\n   \/\/ current. This is the public interface for member lookup.\n   NameLookup lookup(nam, current);\n   \/\/ this will not work, member lookup is too different from type lookup...\n   return lookup.Lookup<Member>();\n}\n*\/\n\n\/\/______________________________________________________________________________\ntemplate<class T> T Reflex::NameLookup::Lookup(bool isTemplateExpanded \/* = false *\/)\n{\n   \/\/ Lookup a type using fLookupName, fCurrentScope.\n\n   Scope startScope = fCurrentScope;\n   T result;\n\n   fPartialSuccess = false;\n   fPosNamePart = 0;\n   fPosNamePartLen = std::string::npos;\n   FindNextScopePos();\n   if (fPosNamePart == 2) {\n      fLookedAtUsingDir.clear();\n      \/\/ ::A...\n      fCurrentScope = Scope::GlobalScope();\n      result = LookupInScope<T>();\n   } else {\n      \/\/ A...\n      result = LookupInUnknownScope<T>();\n   }\n\n   if (!isTemplateExpanded && !result && fLookupName.find('<') != std::string::npos) {\n\n      \/\/ We need to replace the template argument both of this type\n      \/\/ and any of it enclosing type:\n      \/\/    myspace::mytop<A,B>::mytype<C>\n      \n      std::ostringstream tmp;\n      for(size_t i = 0, level = 0, sofar = 0; i < fLookupName.size(); ++i) {\n         if (level==0) {\n            tmp << fLookupName.substr( sofar, i+1 - sofar );\n            sofar = i+1;\n         }\n         switch( fLookupName[i] ) {\n            case '<': ++level; break;\n            case '>': --level; \/\/ intentional fall through to the ',' case\n            case ',':\n               if (level == (1 - (int)(fLookupName[i]=='>'))) {\n                  std::string arg( fLookupName.substr( sofar, i-sofar) );\n                  \n                  size_t p = arg.size();\n         \n                  while (p > 0 && (arg[p-1] == '*' || arg[p-1] == '&' || arg[p-1] == ' ') )\n                     --p;\n                  \n                  std::string end( arg.substr( p ) );\n                  arg.erase( p  );\n\n                  const char *start = arg.c_str();\n                  while(strncmp(start,\"const \",6)==0) start+=6;\n\n                  tmp << arg.substr( 0, start - arg.c_str() );\n\n                  while(strncmp(start,\"std::\",5)==0) start+=5;\n\n                  arg.erase(0, start - arg.c_str() ); \n\n                  Reflex::Type type( LookupType(arg , startScope) );\n\n                  if (type) {\n                     if (type.Name()!=\"Double32_t\" && type.Name()!=\"Float16_t\") {\n                        \/\/ Use the real type rather than the typedef unless\n                        \/\/ this is Double32_t or Float16_t\n                        type = type.FinalType();\n                     }\n\t\t     tmp << type.Name(Reflex::SCOPED|Reflex::QUALIFIED) );\n                  } else {\n                     tmp << arg;\n                  }\n                  tmp << end;\n                  \n                  tmp << fLookupName[i];\n\n                  sofar = i+1;\n               } \n               break;\n         }      \n      }\n      NameLookup next( tmp.str(), startScope );\n      return next.Lookup<T>(true);\n   }\n\n\n   return result;\n}\n\n\/\/______________________________________________________________________________\ntemplate<class T> T Reflex::NameLookup::LookupInScope()\n{\n   \/\/ Lookup a type in fCurrentScope.\n   \/\/ Checks sub-types, sub-scopes, using directives, and base classes for\n   \/\/ the name given by fLookupName, fPosNamePart, and fPosNamePartLen.\n   \/\/ If the name part is found, and another name part follows in fPosNamePart,\n   \/\/ LookupTypeInScope requests the scope found to lookup the next name\n   \/\/ part. fPartialMatch reflexts that the left part of the name was matched;\n   \/\/ even if the trailing part of fLookupName cannot be found, the lookup\n   \/\/ cannot continue on declaring scopes and has to fail.\n   \/\/ A list of lookups performed in namespaces pulled in via using directives is\n   \/\/ kept in fLookedAtUsingDir, to prevent infinite loops due to\n   \/\/   namespace A{using namespace B;} namespace B{using namespace A;}\n   \/\/ loops.\n   \/\/ The lookup does not take the declaration order into account; the result of\n   \/\/ parts of the lookup algorithm which depend on the order will be unpredictable.\n\n   if (!fCurrentScope) {\n      return Dummy::Get<T>();\n   }\n\n   \/\/ prevent inf loop from\n   \/\/ ns A { using ns B; } ns B {using ns A;}\n   if (fLookedAtUsingDir.find(fCurrentScope) != fLookedAtUsingDir.end()) {\n      return Dummy::Get<T>();\n   }\n\n   int len = fCurrentScope.SubTypeSize();\n   int i = 0;\n   for (Type_Iterator it = fCurrentScope.SubType_Begin(); i < len; ++it, ++i) {\n      const Type& type = *it;\n      const TypeBase* base = type.ToTypeBase();\n      if (base) {\n         size_t pos;\n         const std::string &name(base->SimpleName(pos));\n         \/\/fprintf(stderr, \"Reflex::NameLookup::LookupInScope<T>: looking up '%s', considering subscope '%s' ...\\n\", fLookupName.c_str(), name.c_str());\n         if (\n            (fLookupName[fPosNamePart] == name[pos]) &&\n            !fLookupName.compare(fPosNamePart, fPosNamePartLen, name, pos, name.length())\n         ) {\n            \/\/fprintf(stderr, \"Reflex::NameLookup::LookupInScope<T>: lookup up '%s', partial success with subscope '%s' ...\\n\", fLookupName.c_str(), name.c_str());\n            fPartialSuccess = true;\n            fLookedAtUsingDir.clear();\n            FindNextScopePos();\n            if (fPosNamePart == std::string::npos) {\n               return type;\n            }\n            if (it->IsTypedef()) {\n               fCurrentScope = it->FinalType();\n            }\n            else {\n               fCurrentScope = type;\n            }\n            return LookupInScope< T >();\n         }\n      }\n   }\n\n   Scope_Iterator subscope_end(fCurrentScope.SubScope_End());\n   for (Scope_Iterator in = fCurrentScope.SubScope_Begin(); in != subscope_end; ++in) {\n      \/\/ only take namespaces into account - classes were checked as part of SubType\n      if (in->IsNamespace()) {\n         const Scope& scope = *in;\n         const ScopeBase* base = scope.ToScopeBase();\n         if (base) {\n            size_t pos;\n            const std::string& name(base->SimpleName(pos));\n            if (\n               (fLookupName[fPosNamePart] == name[pos]) &&\n               !fLookupName.compare(fPosNamePart, fPosNamePartLen, name, pos, name.length())\n            ) {\n               fPartialSuccess = true;\n               fLookedAtUsingDir.clear();\n               FindNextScopePos();\n               if (fPosNamePart == std::string::npos) {\n                  return (T) (*in);\n               }\n               fCurrentScope = (Scope) (*in);\n               return LookupInScope<T>();\n            }\n         }\n      }\n   }\n\n   if (fCurrentScope.UsingDirectiveSize()) {\n      fLookedAtUsingDir.insert(fCurrentScope);\n      Scope storeCurrentScope = fCurrentScope;\n      Scope_Iterator usingscope_end(storeCurrentScope.UsingDirective_End());\n      for (Scope_Iterator si = storeCurrentScope.UsingDirective_Begin(); si != usingscope_end; ++si) {\n         fCurrentScope = *si;\n         T t = LookupInScope<T>();\n         if (fPartialSuccess) {\n            return t;\n         }\n      }\n      fCurrentScope = storeCurrentScope;\n   }\n\n   if (!fPosNamePart) { \/\/ only for \"BaseClass...\", not for \"A::BaseClass...\"\n      Base_Iterator base_end(fCurrentScope.Base_End());\n      for (Base_Iterator bi = fCurrentScope.Base_Begin(); bi != base_end; ++bi) {\n         if (!fLookupName.compare(fPosNamePart, fPosNamePartLen, bi->Name())) {\n            fPartialSuccess = true;\n            fLookedAtUsingDir.clear();\n            FindNextScopePos();\n            if (fPosNamePart == std::string::npos) {\n               return bi->ToType();\n            }\n            fCurrentScope = bi->ToType().FinalType();\n            return LookupInScope< T >();\n         }\n      }\n   }\n\n   if (fCurrentScope.BaseSize()) {\n      Scope storeCurrentScope = fCurrentScope;\n      Base_Iterator base_end(storeCurrentScope.Base_End());\n      for (Base_Iterator bi = storeCurrentScope.Base_Begin(); bi != base_end; ++bi) {\n         fCurrentScope = bi->ToScope();\n         T t = LookupInScope<T>();\n         if (fPartialSuccess) {\n            return t;\n         }\n      }\n      fCurrentScope = storeCurrentScope;\n   }\n\n   return Dummy::Get<T>();\n}\n\n\/\/______________________________________________________________________________\ntemplate<class T> T Reflex::NameLookup::LookupInUnknownScope()\n{\n   \/\/ Lookup a type in fCurrentScope and its declaring scopes.\n   for (fPartialSuccess = false; !fPartialSuccess && fCurrentScope; fCurrentScope = fCurrentScope.DeclaringScope()) {\n      fLookedAtUsingDir.clear();\n      T t = LookupInScope<T>();\n      if (fPartialSuccess) {\n         return t;\n      }\n      if (fCurrentScope.IsTopScope()) {\n         break;\n      }\n   }\n   return Dummy::Get<T>();\n}\n\n\/\/______________________________________________________________________________\nReflex::Member Reflex::NameLookup::LookupMember(const std::string& nam, const Scope& current)\n{\n   \/\/ Lookup a member.\n   if (Tools::GetBasePosition(nam)) {\n      return LookupMemberQualified(nam);\n   }\n   return LookupMemberUnqualified(nam, current);\n}\n\n\/\/______________________________________________________________________________\nReflex::Member Reflex::NameLookup::LookupMemberQualified(const std::string& nam)\n{\n   \/\/ Lookup of a qualified member.\n   Scope bscope = Scope::ByName(Tools::GetScopeName(nam));\n   if (bscope) {\n      return LookupMemberUnqualified(Tools::GetBaseName(nam), bscope);\n   }\n   return Dummy::Member();\n}\n\n\/\/______________________________________________________________________________\nReflex::Member Reflex::NameLookup::LookupMemberUnqualified(const std::string& nam, const Scope& current)\n{\n   \/\/ Lookup of an unqualified member.\n   {\n      Member m = current.MemberByName(nam);\n      if (m) {\n         return m;\n      }\n   }\n   for (Scope_Iterator si = current.UsingDirective_Begin(); si != current.UsingDirective_End(); ++si) {\n      Member m = LookupMember(nam, *si);\n      if (m) {\n         return m;\n      }\n   }\n   for (Base_Iterator bi = current.Base_Begin(); bi != current.Base_End(); ++bi) {\n      Member m = LookupMember(nam, bi->ToScope());\n      if (m) {\n         return m;\n      }\n   }\n   if (!current.IsTopScope()) {\n      return LookupMember(nam, current.DeclaringScope());\n   }\n   return Dummy::Member();\n}\n\n\/\/______________________________________________________________________________\nReflex::Type Reflex::NameLookup::AccessControl(const Type& typ, const Scope& \/*current*\/)\n{\n   \/\/ Check access.\n   \/\/ if (typ.IsPublic()) {\n   \/\/    return true;\n   \/\/ }\n   \/\/ else if (typ.IsProtected() && current.HasBase(typ.DeclaringScope())) {\n   \/\/    return true;\n   \/\/ }\n   return typ;\n}\n\n\/\/______________________________________________________________________________\nvoid Reflex::NameLookup::FindNextScopePos()\n{\n   \/\/ Move fPosNamePart to point to the next scope in fLookupName, updating\n   \/\/ fPosNamePartLen. If fPosNamePartLen == std::string::npos, initialize\n   \/\/ fPosNamePart and fPosNamePartLen. If there is no next scope left, fPosNamePart\n   \/\/ will be set to std::string::npos and fPosNamePartLen will be set to 0.\n   if (fPosNamePartLen != std::string::npos) {\n      \/\/ we know the length, so jump\n      fPosNamePart += fPosNamePartLen + 2;\n      if (fPosNamePart > fLookupName.length()) {\n         \/\/ past the string's end?\n         fPosNamePart = std::string::npos;\n         fPosNamePartLen = 0;\n         return;\n      }\n   }\n   else {\n      \/\/ uninitialized\n      \/\/ set fPosNamePartLen and check that fLookupName doesn't start with '::'\n      fPosNamePart = 0;\n      if (!fLookupName.compare(0, 2, \"::\")) {\n         fPosNamePart = 2;\n      }\n   }\n   fPosNamePartLen = Tools::GetFirstScopePosition(fLookupName.substr(fPosNamePart));\n   if (!fPosNamePartLen) { \/\/ no next \"::\"\n      fPosNamePartLen = fLookupName.length();\n   }\n   else { \/\/ no \"::\"\n      fPosNamePartLen -= 2;\n   }\n}\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>GTK: Add back more missing accelerators.<commit_after><|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\/session_startup_pref.h\"\n\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 \"base\/string_util.h\"\n\n\/\/ static\nvoid SessionStartupPref::RegisterUserPrefs(PrefService* prefs) {\n  prefs->RegisterIntegerPref(prefs::kRestoreOnStartup, 0);\n  prefs->RegisterListPref(prefs::kURLsToRestoreOnStartup);\n}\n\n\/\/ static\nvoid SessionStartupPref::SetStartupPref(\n    Profile* profile,\n    const SessionStartupPref& pref) {\n  DCHECK(profile);\n  SetStartupPref(profile->GetPrefs(), pref);\n}\n\n\/\/static\nvoid SessionStartupPref::SetStartupPref(PrefService* prefs,\n                                        const SessionStartupPref& pref) {\n  DCHECK(prefs);\n  int type = 0;\n  switch(pref.type) {\n    case LAST:\n      type = 1;\n      break;\n\n    case URLS:\n      type = 4;\n      break;\n\n    default:\n      break;\n  }\n  prefs->SetInteger(prefs::kRestoreOnStartup, type);\n\n  \/\/ Always save the URLs, that way the UI can remain consistent even if the\n  \/\/ user changes the startup type pref.\n  \/\/ Ownership of the ListValue retains with the pref service.\n  ListValue* url_pref_list =\n      prefs->GetMutableList(prefs::kURLsToRestoreOnStartup);\n  DCHECK(url_pref_list);\n  url_pref_list->Clear();\n  for (size_t i = 0; i < pref.urls.size(); ++i) {\n    url_pref_list->Set(static_cast<int>(i),\n                       new StringValue(UTF8ToWide(pref.urls[i].spec())));\n  }\n}\n\n\/\/ static\nSessionStartupPref SessionStartupPref::GetStartupPref(Profile* profile) {\n  DCHECK(profile);\n  return GetStartupPref(profile->GetPrefs());\n}\n\n\/\/ static\nSessionStartupPref SessionStartupPref::GetStartupPref(PrefService* prefs) {\n  DCHECK(prefs);\n  SessionStartupPref pref;\n  switch (prefs->GetInteger(prefs::kRestoreOnStartup)) {\n    case 1: {\n      pref.type = LAST;\n      break;\n    }\n\n    case 4: {\n      pref.type = URLS;\n      break;\n    }\n\n    \/\/ default case or bogus type are treated as not doing anything special\n    \/\/ on startup.\n  }\n\n  ListValue* url_pref_list = prefs->GetMutableList(\n      prefs::kURLsToRestoreOnStartup);\n  DCHECK(url_pref_list);\n  for (size_t i = 0; i < url_pref_list->GetSize(); ++i) {\n    Value* value = NULL;\n    if (url_pref_list->Get(i, &value)) {\n      std::wstring url_text;\n      if (value->GetAsString(&url_text))\n        pref.urls.push_back(GURL(WideToUTF8(url_text)));\n    }\n  }\n\n  return pref;\n}\n\n<commit_msg>Changed SessionStartupPref to use UTF-8 strings.<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\/session_startup_pref.h\"\n\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 \"base\/string_util.h\"\n\n\/\/ static\nvoid SessionStartupPref::RegisterUserPrefs(PrefService* prefs) {\n  prefs->RegisterIntegerPref(prefs::kRestoreOnStartup, 0);\n  prefs->RegisterListPref(prefs::kURLsToRestoreOnStartup);\n}\n\n\/\/ static\nvoid SessionStartupPref::SetStartupPref(\n    Profile* profile,\n    const SessionStartupPref& pref) {\n  DCHECK(profile);\n  SetStartupPref(profile->GetPrefs(), pref);\n}\n\n\/\/static\nvoid SessionStartupPref::SetStartupPref(PrefService* prefs,\n                                        const SessionStartupPref& pref) {\n  DCHECK(prefs);\n  int type = 0;\n  switch(pref.type) {\n    case LAST:\n      type = 1;\n      break;\n\n    case URLS:\n      type = 4;\n      break;\n\n    default:\n      break;\n  }\n  prefs->SetInteger(prefs::kRestoreOnStartup, type);\n\n  \/\/ Always save the URLs, that way the UI can remain consistent even if the\n  \/\/ user changes the startup type pref.\n  \/\/ Ownership of the ListValue retains with the pref service.\n  ListValue* url_pref_list =\n      prefs->GetMutableList(prefs::kURLsToRestoreOnStartup);\n  DCHECK(url_pref_list);\n  url_pref_list->Clear();\n  for (size_t i = 0; i < pref.urls.size(); ++i) {\n    url_pref_list->Set(static_cast<int>(i),\n                       new StringValue(UTF8ToWide(pref.urls[i].spec())));\n  }\n}\n\n\/\/ static\nSessionStartupPref SessionStartupPref::GetStartupPref(Profile* profile) {\n  DCHECK(profile);\n  return GetStartupPref(profile->GetPrefs());\n}\n\n\/\/ static\nSessionStartupPref SessionStartupPref::GetStartupPref(PrefService* prefs) {\n  DCHECK(prefs);\n  SessionStartupPref pref;\n  switch (prefs->GetInteger(prefs::kRestoreOnStartup)) {\n    case 1: {\n      pref.type = LAST;\n      break;\n    }\n\n    case 4: {\n      pref.type = URLS;\n      break;\n    }\n\n    \/\/ default case or bogus type are treated as not doing anything special\n    \/\/ on startup.\n  }\n\n  ListValue* url_pref_list = prefs->GetMutableList(\n      prefs::kURLsToRestoreOnStartup);\n  DCHECK(url_pref_list);\n  for (size_t i = 0; i < url_pref_list->GetSize(); ++i) {\n    Value* value = NULL;\n    if (url_pref_list->Get(i, &value)) {\n      std::string url_text;\n      if (value->GetAsString(&url_text))\n        pref.urls.push_back(GURL(url_text));\n    }\n  }\n\n  return pref;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Ubitrack - Library for Ubiquitous Tracking\n * Copyright 2006, Technische Universitaet Muenchen, and individual\n * contributors as indicated by the @authors tag. See the \n * copyright.txt in the distribution for a full listing of individual\n * contributors.\n *\n * This is free software; you can redistribute it and\/or modify it\n * under the terms of the GNU Lesser General Public License as\n * published by the Free Software Foundation; either version 2.1 of\n * the License, or (at your option) any later version.\n *\n * This software is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this software; if not, write to the Free\n * Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA\n * 02110-1301 USA, or see the FSF site: http:\/\/www.fsf.org.\n *\/\n\n\/**\n * @file\n * Implementation of a high resolution timer to measure execution time of code blocks\n *\n * @author Daniel Pustka <daniel.pustka@in.tum.de>\n *\/\n\n#include <iostream>\n#include <sstream>\n#include <iomanip>\n\n#include \"BlockTimer.h\"\n\nnamespace Ubitrack { namespace Util { \n\n\nBlockTimer::~BlockTimer()\n{\n\tif ( m_pLogger && m_nRuns ) \n\t{ \n\t\tstd::ostringstream s;\n\t\ts << *this;\n\t\tm_pLogger->log( log4cpp::Priority::debug, s.str(), m_sCodeFile.c_str(), m_nCodeLine );\n\t}\n}\n\n\nvoid BlockTimer::initializeStart( const char* sCodeFile, unsigned nCodeLine )\n{ \n\tm_sCodeFile = sCodeFile; \n\tm_nCodeLine = nCodeLine;\n}\n\n\nvoid BlockTimer::initializeEnd()\n{\n\tm_bInitialized = true;\n\t\/\/ TODO: add automatic hierarchy detection\n}\n\n\n\n\nstd::ostream& operator<<( std::ostream& s, const BlockTimer& t )\n{\t\t\n\tunsigned long long totalRunTime = getHighPerformanceCounter() - t.m_startTime;\n\treturn s << std::setw( 30 ) << t.getName()\n\t\t<< \" runs: \" << std::setw( 6 ) << t.getRuns()\n\t\t<< \", total: \" << std::setw( 7 ) << t.getTotalTime()\n\t\t<< \"ms, avg: \" << std::setw( 7 ) << t.getAvgTime() << \"ms\"\n\t\t<< \"ms, totalRuntime: \" << std::setw( 7 ) << totalRunTime << \"ms\"\n\t\t<< \"ms, call per second: \" << std::setw( 7 ) << totalRunTime\/1000.0 \/  t.getRuns() << \"ms\";\n\t\t\n}\n\n} } \/\/ namespace Ubitrack::Util\n<commit_msg>small fix for nicer output<commit_after>\/*\n * Ubitrack - Library for Ubiquitous Tracking\n * Copyright 2006, Technische Universitaet Muenchen, and individual\n * contributors as indicated by the @authors tag. See the \n * copyright.txt in the distribution for a full listing of individual\n * contributors.\n *\n * This is free software; you can redistribute it and\/or modify it\n * under the terms of the GNU Lesser General Public License as\n * published by the Free Software Foundation; either version 2.1 of\n * the License, or (at your option) any later version.\n *\n * This software is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this software; if not, write to the Free\n * Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA\n * 02110-1301 USA, or see the FSF site: http:\/\/www.fsf.org.\n *\/\n\n\/**\n * @file\n * Implementation of a high resolution timer to measure execution time of code blocks\n *\n * @author Daniel Pustka <daniel.pustka@in.tum.de>\n *\/\n\n#include <iostream>\n#include <sstream>\n#include <iomanip>\n\n#include \"BlockTimer.h\"\n\nnamespace Ubitrack { namespace Util { \n\n\nBlockTimer::~BlockTimer()\n{\n\tif ( m_pLogger && m_nRuns ) \n\t{ \n\t\tstd::ostringstream s;\n\t\ts << *this;\n\t\tm_pLogger->log( log4cpp::Priority::debug, s.str(), m_sCodeFile.c_str(), m_nCodeLine );\n\t}\n}\n\n\nvoid BlockTimer::initializeStart( const char* sCodeFile, unsigned nCodeLine )\n{ \n\tm_sCodeFile = sCodeFile; \n\tm_nCodeLine = nCodeLine;\n}\n\n\nvoid BlockTimer::initializeEnd()\n{\n\tm_bInitialized = true;\n\t\/\/\/ @todo add automatic hierarchy detection\n}\n\n\n\n\nstd::ostream& operator<<( std::ostream& s, const BlockTimer& t )\n{\t\t\n\tunsigned long long totalRunTime = getHighPerformanceCounter() - t.m_startTime;\n\treturn s << std::setw( 30 ) << t.getName()\n\t\t<< \" runs: \" << std::setw( 6 ) << t.getRuns()\n\t\t<< \", total: \" << std::setw( 7 ) << t.getTotalTime() << \"ms\"\n\t\t<< \", avg: \" << std::setw( 7 ) << t.getAvgTime() << \"ms\"\n\t\t<< \", totalRuntime: \" << std::setw( 7 ) << totalRunTime << \"ms\"\n\t\t<< \", call per second: \" << std::setw( 7 ) << totalRunTime\/1000.0 \/  t.getRuns();\n\t\t\n}\n\n} } \/\/ namespace Ubitrack::Util\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 \"build\/build_config.h\"\n\n#if defined(OS_WIN)\n#include <windows.h>\n#endif\n\n#include <string>\n\n#include \"base\/basictypes.h\"\n#include \"base\/command_line.h\"\n#include \"base\/environment.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/env_vars.h\"\n#include \"chrome\/common\/logging_chrome.h\"\n#include \"chrome\/test\/automation\/automation_proxy.h\"\n#include \"chrome\/test\/automation\/browser_proxy.h\"\n#include \"chrome\/test\/ui\/ui_test.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nclass ChromeLoggingTest : public testing::Test {\n public:\n  \/\/ Stores the current value of the log file name environment\n  \/\/ variable and sets the variable to new_value.\n  void SaveEnvironmentVariable(std::string new_value) {\n    scoped_ptr<base::Environment> env(base::Environment::Create());\n    if (!env->GetVar(env_vars::kLogFileName, &environment_filename_))\n      environment_filename_ = \"\";\n\n    env->SetVar(env_vars::kLogFileName, new_value);\n  }\n\n  \/\/ Restores the value of the log file nave environment variable\n  \/\/ previously saved by SaveEnvironmentVariable().\n  void RestoreEnvironmentVariable() {\n    scoped_ptr<base::Environment> env(base::Environment::Create());\n    env->SetVar(env_vars::kLogFileName, environment_filename_);\n  }\n\n private:\n  std::string environment_filename_;  \/\/ Saves real environment value.\n};\n\n\/\/ Tests the log file name getter without an environment variable.\nTEST_F(ChromeLoggingTest, LogFileName) {\n  SaveEnvironmentVariable(\"\");\n\n  FilePath filename = logging::GetLogFileName();\n  ASSERT_NE(FilePath::StringType::npos,\n            filename.value().find(FILE_PATH_LITERAL(\"chrome_debug.log\")));\n\n  RestoreEnvironmentVariable();\n}\n\n\/\/ Tests the log file name getter with an environment variable.\nTEST_F(ChromeLoggingTest, EnvironmentLogFileName) {\n  SaveEnvironmentVariable(\"test value\");\n\n  FilePath filename = logging::GetLogFileName();\n  ASSERT_EQ(FilePath(FILE_PATH_LITERAL(\"test value\")).value(),\n            filename.value());\n\n  RestoreEnvironmentVariable();\n}\n\n#if defined(OS_LINUX) && (!defined(NDEBUG) || !defined(USE_LINUX_BREAKPAD))\n\/\/ On Linux in Debug mode, Chrome generates a SIGTRAP.\n\/\/ we do not catch SIGTRAPs, thus no crash dump.\n\/\/ This also does not work if Breakpad is disabled.\n#define EXPECTED_ASSERT_CRASHES 0\n#else\n#define EXPECTED_ASSERT_CRASHES 1\n#endif\n\n\/\/ Touch build will start an extra renderer process (the extension process)\n\/\/ for the virtual keyboard.\n#if defined(TOUCH_UI)\n#define EXPECTED_ASSERT_ERRORS 2\n#else\n#define EXPECTED_ASSERT_ERRORS 1\n#endif\n\n#if !defined(NDEBUG)  \/\/ We don't have assertions in release builds.\n\/\/ Tests whether we correctly fail on renderer assertions during tests.\nclass AssertionTest : public UITest {\n protected:\n  AssertionTest() {\n#if defined(OS_WIN)\n    \/\/ TODO(phajdan.jr): Make crash notifications on launch work on Win.\n    wait_for_initial_loads_ = false;\n#endif\n    launch_arguments_.AppendSwitch(switches::kRendererAssertTest);\n  }\n};\n\n\/\/ Launch the app in assertion test mode, then close the app.\n#if defined(OS_WIN)\n\/\/ http:\/\/crbug.com\/26715\n#define Assertion DISABLED_Assertion\n#elif defined(OS_MACOSX)\n\/\/ Crash service doesn't exist for the Mac yet: http:\/\/crbug.com\/45243\n#define Assertion DISABLED_Assertion\n#endif\nTEST_F(AssertionTest, Assertion) {\n  expected_errors_ = EXPECTED_ASSERT_ERRORS;\n  expected_crashes_ = EXPECTED_ASSERT_CRASHES;\n}\n#endif  \/\/ !defined(NDEBUG)\n\n#if !defined(OFFICIAL_BUILD)\n\/\/ Only works on Linux in Release mode with CHROME_HEADLESS=1\nclass CheckFalseTest : public UITest {\n protected:\n  CheckFalseTest() {\n#if defined(OS_WIN)\n    \/\/ TODO(phajdan.jr): Make crash notifications on launch work on Win.\n    wait_for_initial_loads_ = false;\n#endif\n    launch_arguments_.AppendSwitch(switches::kRendererCheckFalseTest);\n  }\n};\n\n#if defined(OS_WIN)\n\/\/ http:\/\/crbug.com\/38497\n#define CheckFails FLAKY_CheckFails\n#elif defined(OS_MACOSX)\n\/\/ Crash service doesn't exist for the Mac yet: http:\/\/crbug.com\/45243\n#define CheckFails DISABLED_CheckFails\n#endif\n\/\/ Launch the app in assertion test mode, then close the app.\nTEST_F(CheckFalseTest, CheckFails) {\n  expected_errors_ = EXPECTED_ASSERT_ERRORS;\n  expected_crashes_ = EXPECTED_ASSERT_CRASHES;\n}\n#endif  \/\/ !defined(OFFICIAL_BUILD)\n\n\/\/ Tests whether we correctly fail on browser crashes during UI Tests.\nclass RendererCrashTest : public UITest {\n protected:\n  RendererCrashTest() {\n#if defined(OS_WIN)\n    \/\/ TODO(phajdan.jr): Make crash notifications on launch work on Win.\n    wait_for_initial_loads_ = false;\n#endif\n    launch_arguments_.AppendSwitch(switches::kRendererCrashTest);\n  }\n};\n\n#if defined(OS_LINUX) && !defined(USE_LINUX_BREAKPAD)\n\/\/ On Linux, do not expect a crash dump if Breakpad is disabled.\n#define EXPECTED_CRASH_CRASHES 0\n#else\n#define EXPECTED_CRASH_CRASHES 1\n#endif\n\n#if defined(OS_MACOSX)\n\/\/ Crash service doesn't exist for the Mac yet: http:\/\/crbug.com\/45243\n#define Crash DISABLED_Crash\n#endif\n\/\/ Launch the app in renderer crash test mode, then close the app.\nTEST_F(RendererCrashTest, Crash) {\n  scoped_refptr<BrowserProxy> browser(automation()->GetBrowserWindow(0));\n  ASSERT_TRUE(browser.get());\n  ASSERT_TRUE(browser->WaitForTabCountToBecome(1));\n  expected_crashes_ = EXPECTED_CRASH_CRASHES;\n}\n<commit_msg>Mark RendererCrashTest.Crash test as flaky on ChromiumOS<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 \"build\/build_config.h\"\n\n#if defined(OS_WIN)\n#include <windows.h>\n#endif\n\n#include <string>\n\n#include \"base\/basictypes.h\"\n#include \"base\/command_line.h\"\n#include \"base\/environment.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/env_vars.h\"\n#include \"chrome\/common\/logging_chrome.h\"\n#include \"chrome\/test\/automation\/automation_proxy.h\"\n#include \"chrome\/test\/automation\/browser_proxy.h\"\n#include \"chrome\/test\/ui\/ui_test.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nclass ChromeLoggingTest : public testing::Test {\n public:\n  \/\/ Stores the current value of the log file name environment\n  \/\/ variable and sets the variable to new_value.\n  void SaveEnvironmentVariable(std::string new_value) {\n    scoped_ptr<base::Environment> env(base::Environment::Create());\n    if (!env->GetVar(env_vars::kLogFileName, &environment_filename_))\n      environment_filename_ = \"\";\n\n    env->SetVar(env_vars::kLogFileName, new_value);\n  }\n\n  \/\/ Restores the value of the log file nave environment variable\n  \/\/ previously saved by SaveEnvironmentVariable().\n  void RestoreEnvironmentVariable() {\n    scoped_ptr<base::Environment> env(base::Environment::Create());\n    env->SetVar(env_vars::kLogFileName, environment_filename_);\n  }\n\n private:\n  std::string environment_filename_;  \/\/ Saves real environment value.\n};\n\n\/\/ Tests the log file name getter without an environment variable.\nTEST_F(ChromeLoggingTest, LogFileName) {\n  SaveEnvironmentVariable(\"\");\n\n  FilePath filename = logging::GetLogFileName();\n  ASSERT_NE(FilePath::StringType::npos,\n            filename.value().find(FILE_PATH_LITERAL(\"chrome_debug.log\")));\n\n  RestoreEnvironmentVariable();\n}\n\n\/\/ Tests the log file name getter with an environment variable.\nTEST_F(ChromeLoggingTest, EnvironmentLogFileName) {\n  SaveEnvironmentVariable(\"test value\");\n\n  FilePath filename = logging::GetLogFileName();\n  ASSERT_EQ(FilePath(FILE_PATH_LITERAL(\"test value\")).value(),\n            filename.value());\n\n  RestoreEnvironmentVariable();\n}\n\n#if defined(OS_LINUX) && (!defined(NDEBUG) || !defined(USE_LINUX_BREAKPAD))\n\/\/ On Linux in Debug mode, Chrome generates a SIGTRAP.\n\/\/ we do not catch SIGTRAPs, thus no crash dump.\n\/\/ This also does not work if Breakpad is disabled.\n#define EXPECTED_ASSERT_CRASHES 0\n#else\n#define EXPECTED_ASSERT_CRASHES 1\n#endif\n\n\/\/ Touch build will start an extra renderer process (the extension process)\n\/\/ for the virtual keyboard.\n#if defined(TOUCH_UI)\n#define EXPECTED_ASSERT_ERRORS 2\n#else\n#define EXPECTED_ASSERT_ERRORS 1\n#endif\n\n#if !defined(NDEBUG)  \/\/ We don't have assertions in release builds.\n\/\/ Tests whether we correctly fail on renderer assertions during tests.\nclass AssertionTest : public UITest {\n protected:\n  AssertionTest() {\n#if defined(OS_WIN)\n    \/\/ TODO(phajdan.jr): Make crash notifications on launch work on Win.\n    wait_for_initial_loads_ = false;\n#endif\n    launch_arguments_.AppendSwitch(switches::kRendererAssertTest);\n  }\n};\n\n\/\/ Launch the app in assertion test mode, then close the app.\n#if defined(OS_WIN)\n\/\/ http:\/\/crbug.com\/26715\n#define Assertion DISABLED_Assertion\n#elif defined(OS_MACOSX)\n\/\/ Crash service doesn't exist for the Mac yet: http:\/\/crbug.com\/45243\n#define Assertion DISABLED_Assertion\n#endif\nTEST_F(AssertionTest, Assertion) {\n  expected_errors_ = EXPECTED_ASSERT_ERRORS;\n  expected_crashes_ = EXPECTED_ASSERT_CRASHES;\n}\n#endif  \/\/ !defined(NDEBUG)\n\n#if !defined(OFFICIAL_BUILD)\n\/\/ Only works on Linux in Release mode with CHROME_HEADLESS=1\nclass CheckFalseTest : public UITest {\n protected:\n  CheckFalseTest() {\n#if defined(OS_WIN)\n    \/\/ TODO(phajdan.jr): Make crash notifications on launch work on Win.\n    wait_for_initial_loads_ = false;\n#endif\n    launch_arguments_.AppendSwitch(switches::kRendererCheckFalseTest);\n  }\n};\n\n#if defined(OS_WIN)\n\/\/ http:\/\/crbug.com\/38497\n#define CheckFails FLAKY_CheckFails\n#elif defined(OS_MACOSX)\n\/\/ Crash service doesn't exist for the Mac yet: http:\/\/crbug.com\/45243\n#define CheckFails DISABLED_CheckFails\n#endif\n\/\/ Launch the app in assertion test mode, then close the app.\nTEST_F(CheckFalseTest, CheckFails) {\n  expected_errors_ = EXPECTED_ASSERT_ERRORS;\n  expected_crashes_ = EXPECTED_ASSERT_CRASHES;\n}\n#endif  \/\/ !defined(OFFICIAL_BUILD)\n\n\/\/ Tests whether we correctly fail on browser crashes during UI Tests.\nclass RendererCrashTest : public UITest {\n protected:\n  RendererCrashTest() {\n#if defined(OS_WIN)\n    \/\/ TODO(phajdan.jr): Make crash notifications on launch work on Win.\n    wait_for_initial_loads_ = false;\n#endif\n    launch_arguments_.AppendSwitch(switches::kRendererCrashTest);\n  }\n};\n\n#if defined(OS_LINUX) && !defined(USE_LINUX_BREAKPAD)\n\/\/ On Linux, do not expect a crash dump if Breakpad is disabled.\n#define EXPECTED_CRASH_CRASHES 0\n#else\n#define EXPECTED_CRASH_CRASHES 1\n#endif\n\n#if defined(OS_MACOSX)\n\/\/ Crash service doesn't exist for the Mac yet: http:\/\/crbug.com\/45243\n#define MAYBE_Crash DISABLED_Crash\n#elif defined(OS_CHROME)\n#define MAYBE_Crash FLAKY_Crash\n#else\n#define MAYBE_Crash Crash\n#endif\n\/\/ Launch the app in renderer crash test mode, then close the app.\nTEST_F(RendererCrashTest, MAYBE_Crash) {\n  scoped_refptr<BrowserProxy> browser(automation()->GetBrowserWindow(0));\n  ASSERT_TRUE(browser.get());\n  ASSERT_TRUE(browser->WaitForTabCountToBecome(1));\n  expected_crashes_ = EXPECTED_CRASH_CRASHES;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===--- ModuleManager.cpp - Module Manager ---------------------*- 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 ModuleManager class, which manages a set of loaded\n\/\/  modules for the ASTReader.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n#include \"clang\/Serialization\/ModuleManager.h\"\n#include \"clang\/Frontend\/PCHContainerOperations.h\"\n#include \"clang\/Lex\/HeaderSearch.h\"\n#include \"clang\/Lex\/ModuleMap.h\"\n#include \"clang\/Serialization\/GlobalModuleIndex.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include \"llvm\/Support\/Path.h\"\n#include <system_error>\n\n#ifndef NDEBUG\n#include \"llvm\/Support\/GraphWriter.h\"\n#endif\n\nusing namespace clang;\nusing namespace serialization;\n\nModuleFile *ModuleManager::lookup(StringRef Name) {\n  const FileEntry *Entry = FileMgr.getFile(Name, \/*openFile=*\/false,\n                                           \/*cacheFailure=*\/false);\n  if (Entry)\n    return lookup(Entry);\n\n  return nullptr;\n}\n\nModuleFile *ModuleManager::lookup(const FileEntry *File) {\n  llvm::DenseMap<const FileEntry *, ModuleFile *>::iterator Known\n    = Modules.find(File);\n  if (Known == Modules.end())\n    return nullptr;\n\n  return Known->second;\n}\n\nstd::unique_ptr<llvm::MemoryBuffer>\nModuleManager::lookupBuffer(StringRef Name) {\n  const FileEntry *Entry = FileMgr.getFile(Name, \/*openFile=*\/false,\n                                           \/*cacheFailure=*\/false);\n  return std::move(InMemoryBuffers[Entry]);\n}\n\nModuleManager::AddModuleResult\nModuleManager::addModule(StringRef FileName, ModuleKind Type,\n                         SourceLocation ImportLoc, ModuleFile *ImportedBy,\n                         unsigned Generation,\n                         off_t ExpectedSize, time_t ExpectedModTime,\n                         ASTFileSignature ExpectedSignature,\n                         ASTFileSignatureReader ReadSignature,\n                         ModuleFile *&Module,\n                         std::string &ErrorStr) {\n  Module = nullptr;\n\n  \/\/ Look for the file entry. This only fails if the expected size or\n  \/\/ modification time differ.\n  const FileEntry *Entry;\n  if (Type == MK_ExplicitModule || Type == MK_PrebuiltModule) {\n    \/\/ If we're not expecting to pull this file out of the module cache, it\n    \/\/ might have a different mtime due to being moved across filesystems in\n    \/\/ a distributed build. The size must still match, though. (As must the\n    \/\/ contents, but we can't check that.)\n    ExpectedModTime = 0;\n  }\n  if (lookupModuleFile(FileName, ExpectedSize, ExpectedModTime, Entry)) {\n    ErrorStr = \"module file out of date\";\n    return OutOfDate;\n  }\n\n  if (!Entry && FileName != \"-\") {\n    ErrorStr = \"module file not found\";\n    return Missing;\n  }\n\n  \/\/ Check whether we already loaded this module, before\n  ModuleFile *ModuleEntry = Modules[Entry];\n  bool NewModule = false;\n  if (!ModuleEntry) {\n    \/\/ Allocate a new module.\n    NewModule = true;\n    ModuleEntry = new ModuleFile(Type, Generation);\n    ModuleEntry->Index = Chain.size();\n    ModuleEntry->FileName = FileName.str();\n    ModuleEntry->File = Entry;\n    ModuleEntry->ImportLoc = ImportLoc;\n    ModuleEntry->InputFilesValidationTimestamp = 0;\n\n    if (ModuleEntry->Kind == MK_ImplicitModule) {\n      std::string TimestampFilename = ModuleEntry->getTimestampFilename();\n      vfs::Status Status;\n      \/\/ A cached stat value would be fine as well.\n      if (!FileMgr.getNoncachedStatValue(TimestampFilename, Status))\n        ModuleEntry->InputFilesValidationTimestamp =\n            Status.getLastModificationTime().toEpochTime();\n    }\n\n    \/\/ Load the contents of the module\n    if (std::unique_ptr<llvm::MemoryBuffer> Buffer = lookupBuffer(FileName)) {\n      \/\/ The buffer was already provided for us.\n      ModuleEntry->Buffer = std::move(Buffer);\n    } else {\n      \/\/ Open the AST file.\n      llvm::ErrorOr<std::unique_ptr<llvm::MemoryBuffer>> Buf(\n          (std::error_code()));\n      if (FileName == \"-\") {\n        Buf = llvm::MemoryBuffer::getSTDIN();\n      } else {\n        \/\/ Leave the FileEntry open so if it gets read again by another\n        \/\/ ModuleManager it must be the same underlying file.\n        \/\/ FIXME: Because FileManager::getFile() doesn't guarantee that it will\n        \/\/ give us an open file, this may not be 100% reliable.\n        Buf = FileMgr.getBufferForFile(ModuleEntry->File,\n                                       \/*IsVolatile=*\/false,\n                                       \/*ShouldClose=*\/false);\n      }\n\n      if (!Buf) {\n        ErrorStr = Buf.getError().message();\n        delete ModuleEntry;\n        return Missing;\n      }\n\n      ModuleEntry->Buffer = std::move(*Buf);\n    }\n\n    \/\/ Initialize the stream.\n    PCHContainerRdr.ExtractPCH(ModuleEntry->Buffer->getMemBufferRef(),\n                               ModuleEntry->StreamFile);\n  }\n\n  if (ExpectedSignature) {\n    \/\/ If we've not read the control block yet, read the signature eagerly now\n    \/\/ so that we can check it.\n    if (!ModuleEntry->Signature)\n      ModuleEntry->Signature = ReadSignature(ModuleEntry->StreamFile);\n\n    if (ModuleEntry->Signature != ExpectedSignature) {\n      ErrorStr = ModuleEntry->Signature ? \"signature mismatch\"\n                                        : \"could not read module signature\";\n\n      if (NewModule)\n        delete ModuleEntry;\n      return OutOfDate;\n    }\n  }\n\n  if (ImportedBy) {\n    ModuleEntry->ImportedBy.insert(ImportedBy);\n    ImportedBy->Imports.insert(ModuleEntry);\n  } else {\n    if (!ModuleEntry->DirectlyImported)\n      ModuleEntry->ImportLoc = ImportLoc;\n    \n    ModuleEntry->DirectlyImported = true;\n  }\n\n  Module = ModuleEntry;\n\n  if (!NewModule)\n    return AlreadyLoaded;\n\n  assert(!Modules[Entry] && \"module loaded twice\");\n  Modules[Entry] = ModuleEntry;\n\n  Chain.push_back(ModuleEntry);\n  if (!ModuleEntry->isModule())\n    PCHChain.push_back(ModuleEntry);\n  if (!ImportedBy)\n    Roots.push_back(ModuleEntry);\n\n  return NewlyLoaded;\n}\n\nvoid ModuleManager::removeModules(\n    ModuleIterator first, ModuleIterator last,\n    llvm::SmallPtrSetImpl<ModuleFile *> &LoadedSuccessfully,\n    ModuleMap *modMap) {\n  if (first == last)\n    return;\n\n  \/\/ Explicitly clear VisitOrder since we might not notice it is stale.\n  VisitOrder.clear();\n\n  \/\/ Collect the set of module file pointers that we'll be removing.\n  llvm::SmallPtrSet<ModuleFile *, 4> victimSet(first, last);\n\n  auto IsVictim = [&](ModuleFile *MF) {\n    return victimSet.count(MF);\n  };\n  \/\/ Remove any references to the now-destroyed modules.\n  for (unsigned i = 0, n = Chain.size(); i != n; ++i) {\n    Chain[i]->ImportedBy.remove_if(IsVictim);\n  }\n  Roots.erase(std::remove_if(Roots.begin(), Roots.end(), IsVictim),\n              Roots.end());\n\n  \/\/ Remove the modules from the PCH chain.\n  for (auto I = first; I != last; ++I) {\n    if (!(*I)->isModule()) {\n      PCHChain.erase(std::find(PCHChain.begin(), PCHChain.end(), *I),\n                     PCHChain.end());\n      break;\n    }\n  }\n\n  \/\/ Delete the modules and erase them from the various structures.\n  for (ModuleIterator victim = first; victim != last; ++victim) {\n    Modules.erase((*victim)->File);\n\n    if (modMap) {\n      StringRef ModuleName = (*victim)->ModuleName;\n      if (Module *mod = modMap->findModule(ModuleName)) {\n        mod->setASTFile(nullptr);\n      }\n    }\n\n    \/\/ Files that didn't make it through ReadASTCore successfully will be\n    \/\/ rebuilt (or there was an error). Invalidate them so that we can load the\n    \/\/ new files that will be renamed over the old ones.\n    if (LoadedSuccessfully.count(*victim) == 0)\n      FileMgr.invalidateCache((*victim)->File);\n\n    delete *victim;\n  }\n\n  \/\/ Remove the modules from the chain.\n  Chain.erase(first, last);\n}\n\nvoid\nModuleManager::addInMemoryBuffer(StringRef FileName,\n                                 std::unique_ptr<llvm::MemoryBuffer> Buffer) {\n\n  const FileEntry *Entry =\n      FileMgr.getVirtualFile(FileName, Buffer->getBufferSize(), 0);\n  InMemoryBuffers[Entry] = std::move(Buffer);\n}\n\nModuleManager::VisitState *ModuleManager::allocateVisitState() {\n  \/\/ Fast path: if we have a cached state, use it.\n  if (FirstVisitState) {\n    VisitState *Result = FirstVisitState;\n    FirstVisitState = FirstVisitState->NextState;\n    Result->NextState = nullptr;\n    return Result;\n  }\n\n  \/\/ Allocate and return a new state.\n  return new VisitState(size());\n}\n\nvoid ModuleManager::returnVisitState(VisitState *State) {\n  assert(State->NextState == nullptr && \"Visited state is in list?\");\n  State->NextState = FirstVisitState;\n  FirstVisitState = State;\n}\n\nvoid ModuleManager::setGlobalIndex(GlobalModuleIndex *Index) {\n  GlobalIndex = Index;\n  if (!GlobalIndex) {\n    ModulesInCommonWithGlobalIndex.clear();\n    return;\n  }\n\n  \/\/ Notify the global module index about all of the modules we've already\n  \/\/ loaded.\n  for (unsigned I = 0, N = Chain.size(); I != N; ++I) {\n    if (!GlobalIndex->loadedModuleFile(Chain[I])) {\n      ModulesInCommonWithGlobalIndex.push_back(Chain[I]);\n    }\n  }\n}\n\nvoid ModuleManager::moduleFileAccepted(ModuleFile *MF) {\n  if (!GlobalIndex || GlobalIndex->loadedModuleFile(MF))\n    return;\n\n  ModulesInCommonWithGlobalIndex.push_back(MF);\n}\n\nModuleManager::ModuleManager(FileManager &FileMgr,\n                             const PCHContainerReader &PCHContainerRdr)\n    : FileMgr(FileMgr), PCHContainerRdr(PCHContainerRdr), GlobalIndex(),\n      FirstVisitState(nullptr) {}\n\nModuleManager::~ModuleManager() {\n  for (unsigned i = 0, e = Chain.size(); i != e; ++i)\n    delete Chain[e - i - 1];\n  delete FirstVisitState;\n}\n\nvoid ModuleManager::visit(llvm::function_ref<bool(ModuleFile &M)> Visitor,\n                          llvm::SmallPtrSetImpl<ModuleFile *> *ModuleFilesHit) {\n  \/\/ If the visitation order vector is the wrong size, recompute the order.\n  if (VisitOrder.size() != Chain.size()) {\n    unsigned N = size();\n    VisitOrder.clear();\n    VisitOrder.reserve(N);\n    \n    \/\/ Record the number of incoming edges for each module. When we\n    \/\/ encounter a module with no incoming edges, push it into the queue\n    \/\/ to seed the queue.\n    SmallVector<ModuleFile *, 4> Queue;\n    Queue.reserve(N);\n    llvm::SmallVector<unsigned, 4> UnusedIncomingEdges;\n    UnusedIncomingEdges.resize(size());\n    for (ModuleFile *M : llvm::reverse(*this)) {\n      unsigned Size = M->ImportedBy.size();\n      UnusedIncomingEdges[M->Index] = Size;\n      if (!Size)\n        Queue.push_back(M);\n    }\n\n    \/\/ Traverse the graph, making sure to visit a module before visiting any\n    \/\/ of its dependencies.\n    while (!Queue.empty()) {\n      ModuleFile *CurrentModule = Queue.pop_back_val();\n      VisitOrder.push_back(CurrentModule);\n\n      \/\/ For any module that this module depends on, push it on the\n      \/\/ stack (if it hasn't already been marked as visited).\n      for (auto M = CurrentModule->Imports.rbegin(),\n                MEnd = CurrentModule->Imports.rend();\n           M != MEnd; ++M) {\n        \/\/ Remove our current module as an impediment to visiting the\n        \/\/ module we depend on. If we were the last unvisited module\n        \/\/ that depends on this particular module, push it into the\n        \/\/ queue to be visited.\n        unsigned &NumUnusedEdges = UnusedIncomingEdges[(*M)->Index];\n        if (NumUnusedEdges && (--NumUnusedEdges == 0))\n          Queue.push_back(*M);\n      }\n    }\n\n    assert(VisitOrder.size() == N && \"Visitation order is wrong?\");\n\n    delete FirstVisitState;\n    FirstVisitState = nullptr;\n  }\n\n  VisitState *State = allocateVisitState();\n  unsigned VisitNumber = State->NextVisitNumber++;\n\n  \/\/ If the caller has provided us with a hit-set that came from the global\n  \/\/ module index, mark every module file in common with the global module\n  \/\/ index that is *not* in that set as 'visited'.\n  if (ModuleFilesHit && !ModulesInCommonWithGlobalIndex.empty()) {\n    for (unsigned I = 0, N = ModulesInCommonWithGlobalIndex.size(); I != N; ++I)\n    {\n      ModuleFile *M = ModulesInCommonWithGlobalIndex[I];\n      if (!ModuleFilesHit->count(M))\n        State->VisitNumber[M->Index] = VisitNumber;\n    }\n  }\n\n  for (unsigned I = 0, N = VisitOrder.size(); I != N; ++I) {\n    ModuleFile *CurrentModule = VisitOrder[I];\n    \/\/ Should we skip this module file?\n    if (State->VisitNumber[CurrentModule->Index] == VisitNumber)\n      continue;\n\n    \/\/ Visit the module.\n    assert(State->VisitNumber[CurrentModule->Index] == VisitNumber - 1);\n    State->VisitNumber[CurrentModule->Index] = VisitNumber;\n    if (!Visitor(*CurrentModule))\n      continue;\n\n    \/\/ The visitor has requested that cut off visitation of any\n    \/\/ module that the current module depends on. To indicate this\n    \/\/ behavior, we mark all of the reachable modules as having been visited.\n    ModuleFile *NextModule = CurrentModule;\n    do {\n      \/\/ For any module that this module depends on, push it on the\n      \/\/ stack (if it hasn't already been marked as visited).\n      for (llvm::SetVector<ModuleFile *>::iterator\n             M = NextModule->Imports.begin(),\n             MEnd = NextModule->Imports.end();\n           M != MEnd; ++M) {\n        if (State->VisitNumber[(*M)->Index] != VisitNumber) {\n          State->Stack.push_back(*M);\n          State->VisitNumber[(*M)->Index] = VisitNumber;\n        }\n      }\n\n      if (State->Stack.empty())\n        break;\n\n      \/\/ Pop the next module off the stack.\n      NextModule = State->Stack.pop_back_val();\n    } while (true);\n  }\n\n  returnVisitState(State);\n}\n\nbool ModuleManager::lookupModuleFile(StringRef FileName,\n                                     off_t ExpectedSize,\n                                     time_t ExpectedModTime,\n                                     const FileEntry *&File) {\n  \/\/ Open the file immediately to ensure there is no race between stat'ing and\n  \/\/ opening the file.\n  File = FileMgr.getFile(FileName, \/*openFile=*\/true, \/*cacheFailure=*\/false);\n\n  if (!File && FileName != \"-\") {\n    return false;\n  }\n\n  if ((ExpectedSize && ExpectedSize != File->getSize()) ||\n      (ExpectedModTime && ExpectedModTime != File->getModificationTime()))\n    \/\/ Do not destroy File, as it may be referenced. If we need to rebuild it,\n    \/\/ it will be destroyed by removeModules.\n    return true;\n\n  return false;\n}\n\n#ifndef NDEBUG\nnamespace llvm {\n  template<>\n  struct GraphTraits<ModuleManager> {\n    typedef ModuleFile *NodeRef;\n    typedef llvm::SetVector<ModuleFile *>::const_iterator ChildIteratorType;\n    typedef ModuleManager::ModuleConstIterator nodes_iterator;\n\n    static ChildIteratorType child_begin(NodeRef Node) {\n      return Node->Imports.begin();\n    }\n\n    static ChildIteratorType child_end(NodeRef Node) {\n      return Node->Imports.end();\n    }\n    \n    static nodes_iterator nodes_begin(const ModuleManager &Manager) {\n      return Manager.begin();\n    }\n    \n    static nodes_iterator nodes_end(const ModuleManager &Manager) {\n      return Manager.end();\n    }\n  };\n  \n  template<>\n  struct DOTGraphTraits<ModuleManager> : public DefaultDOTGraphTraits {\n    explicit DOTGraphTraits(bool IsSimple = false)\n      : DefaultDOTGraphTraits(IsSimple) { }\n    \n    static bool renderGraphFromBottomUp() {\n      return true;\n    }\n\n    std::string getNodeLabel(ModuleFile *M, const ModuleManager&) {\n      return M->ModuleName;\n    }\n  };\n}\n\nvoid ModuleManager::viewGraph() {\n  llvm::ViewGraph(*this, \"Modules\");\n}\n#endif\n<commit_msg>Clean up handling of reading module files from stdin. Don't bother trying to look for a corresponding file, since we're not going to read it anyway.<commit_after>\/\/===--- ModuleManager.cpp - Module Manager ---------------------*- 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 ModuleManager class, which manages a set of loaded\n\/\/  modules for the ASTReader.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n#include \"clang\/Serialization\/ModuleManager.h\"\n#include \"clang\/Frontend\/PCHContainerOperations.h\"\n#include \"clang\/Lex\/HeaderSearch.h\"\n#include \"clang\/Lex\/ModuleMap.h\"\n#include \"clang\/Serialization\/GlobalModuleIndex.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include \"llvm\/Support\/Path.h\"\n#include <system_error>\n\n#ifndef NDEBUG\n#include \"llvm\/Support\/GraphWriter.h\"\n#endif\n\nusing namespace clang;\nusing namespace serialization;\n\nModuleFile *ModuleManager::lookup(StringRef Name) {\n  const FileEntry *Entry = FileMgr.getFile(Name, \/*openFile=*\/false,\n                                           \/*cacheFailure=*\/false);\n  if (Entry)\n    return lookup(Entry);\n\n  return nullptr;\n}\n\nModuleFile *ModuleManager::lookup(const FileEntry *File) {\n  llvm::DenseMap<const FileEntry *, ModuleFile *>::iterator Known\n    = Modules.find(File);\n  if (Known == Modules.end())\n    return nullptr;\n\n  return Known->second;\n}\n\nstd::unique_ptr<llvm::MemoryBuffer>\nModuleManager::lookupBuffer(StringRef Name) {\n  const FileEntry *Entry = FileMgr.getFile(Name, \/*openFile=*\/false,\n                                           \/*cacheFailure=*\/false);\n  return std::move(InMemoryBuffers[Entry]);\n}\n\nModuleManager::AddModuleResult\nModuleManager::addModule(StringRef FileName, ModuleKind Type,\n                         SourceLocation ImportLoc, ModuleFile *ImportedBy,\n                         unsigned Generation,\n                         off_t ExpectedSize, time_t ExpectedModTime,\n                         ASTFileSignature ExpectedSignature,\n                         ASTFileSignatureReader ReadSignature,\n                         ModuleFile *&Module,\n                         std::string &ErrorStr) {\n  Module = nullptr;\n\n  \/\/ Look for the file entry. This only fails if the expected size or\n  \/\/ modification time differ.\n  const FileEntry *Entry;\n  if (Type == MK_ExplicitModule || Type == MK_PrebuiltModule) {\n    \/\/ If we're not expecting to pull this file out of the module cache, it\n    \/\/ might have a different mtime due to being moved across filesystems in\n    \/\/ a distributed build. The size must still match, though. (As must the\n    \/\/ contents, but we can't check that.)\n    ExpectedModTime = 0;\n  }\n  if (lookupModuleFile(FileName, ExpectedSize, ExpectedModTime, Entry)) {\n    ErrorStr = \"module file out of date\";\n    return OutOfDate;\n  }\n\n  if (!Entry && FileName != \"-\") {\n    ErrorStr = \"module file not found\";\n    return Missing;\n  }\n\n  \/\/ Check whether we already loaded this module, before\n  ModuleFile *ModuleEntry = Modules[Entry];\n  bool NewModule = false;\n  if (!ModuleEntry) {\n    \/\/ Allocate a new module.\n    NewModule = true;\n    ModuleEntry = new ModuleFile(Type, Generation);\n    ModuleEntry->Index = Chain.size();\n    ModuleEntry->FileName = FileName.str();\n    ModuleEntry->File = Entry;\n    ModuleEntry->ImportLoc = ImportLoc;\n    ModuleEntry->InputFilesValidationTimestamp = 0;\n\n    if (ModuleEntry->Kind == MK_ImplicitModule) {\n      std::string TimestampFilename = ModuleEntry->getTimestampFilename();\n      vfs::Status Status;\n      \/\/ A cached stat value would be fine as well.\n      if (!FileMgr.getNoncachedStatValue(TimestampFilename, Status))\n        ModuleEntry->InputFilesValidationTimestamp =\n            Status.getLastModificationTime().toEpochTime();\n    }\n\n    \/\/ Load the contents of the module\n    if (std::unique_ptr<llvm::MemoryBuffer> Buffer = lookupBuffer(FileName)) {\n      \/\/ The buffer was already provided for us.\n      ModuleEntry->Buffer = std::move(Buffer);\n    } else {\n      \/\/ Open the AST file.\n      llvm::ErrorOr<std::unique_ptr<llvm::MemoryBuffer>> Buf(\n          (std::error_code()));\n      if (FileName == \"-\") {\n        Buf = llvm::MemoryBuffer::getSTDIN();\n      } else {\n        \/\/ Leave the FileEntry open so if it gets read again by another\n        \/\/ ModuleManager it must be the same underlying file.\n        \/\/ FIXME: Because FileManager::getFile() doesn't guarantee that it will\n        \/\/ give us an open file, this may not be 100% reliable.\n        Buf = FileMgr.getBufferForFile(ModuleEntry->File,\n                                       \/*IsVolatile=*\/false,\n                                       \/*ShouldClose=*\/false);\n      }\n\n      if (!Buf) {\n        ErrorStr = Buf.getError().message();\n        delete ModuleEntry;\n        return Missing;\n      }\n\n      ModuleEntry->Buffer = std::move(*Buf);\n    }\n\n    \/\/ Initialize the stream.\n    PCHContainerRdr.ExtractPCH(ModuleEntry->Buffer->getMemBufferRef(),\n                               ModuleEntry->StreamFile);\n  }\n\n  if (ExpectedSignature) {\n    \/\/ If we've not read the control block yet, read the signature eagerly now\n    \/\/ so that we can check it.\n    if (!ModuleEntry->Signature)\n      ModuleEntry->Signature = ReadSignature(ModuleEntry->StreamFile);\n\n    if (ModuleEntry->Signature != ExpectedSignature) {\n      ErrorStr = ModuleEntry->Signature ? \"signature mismatch\"\n                                        : \"could not read module signature\";\n\n      if (NewModule)\n        delete ModuleEntry;\n      return OutOfDate;\n    }\n  }\n\n  if (ImportedBy) {\n    ModuleEntry->ImportedBy.insert(ImportedBy);\n    ImportedBy->Imports.insert(ModuleEntry);\n  } else {\n    if (!ModuleEntry->DirectlyImported)\n      ModuleEntry->ImportLoc = ImportLoc;\n    \n    ModuleEntry->DirectlyImported = true;\n  }\n\n  Module = ModuleEntry;\n\n  if (!NewModule)\n    return AlreadyLoaded;\n\n  assert(!Modules[Entry] && \"module loaded twice\");\n  Modules[Entry] = ModuleEntry;\n\n  Chain.push_back(ModuleEntry);\n  if (!ModuleEntry->isModule())\n    PCHChain.push_back(ModuleEntry);\n  if (!ImportedBy)\n    Roots.push_back(ModuleEntry);\n\n  return NewlyLoaded;\n}\n\nvoid ModuleManager::removeModules(\n    ModuleIterator first, ModuleIterator last,\n    llvm::SmallPtrSetImpl<ModuleFile *> &LoadedSuccessfully,\n    ModuleMap *modMap) {\n  if (first == last)\n    return;\n\n  \/\/ Explicitly clear VisitOrder since we might not notice it is stale.\n  VisitOrder.clear();\n\n  \/\/ Collect the set of module file pointers that we'll be removing.\n  llvm::SmallPtrSet<ModuleFile *, 4> victimSet(first, last);\n\n  auto IsVictim = [&](ModuleFile *MF) {\n    return victimSet.count(MF);\n  };\n  \/\/ Remove any references to the now-destroyed modules.\n  for (unsigned i = 0, n = Chain.size(); i != n; ++i) {\n    Chain[i]->ImportedBy.remove_if(IsVictim);\n  }\n  Roots.erase(std::remove_if(Roots.begin(), Roots.end(), IsVictim),\n              Roots.end());\n\n  \/\/ Remove the modules from the PCH chain.\n  for (auto I = first; I != last; ++I) {\n    if (!(*I)->isModule()) {\n      PCHChain.erase(std::find(PCHChain.begin(), PCHChain.end(), *I),\n                     PCHChain.end());\n      break;\n    }\n  }\n\n  \/\/ Delete the modules and erase them from the various structures.\n  for (ModuleIterator victim = first; victim != last; ++victim) {\n    Modules.erase((*victim)->File);\n\n    if (modMap) {\n      StringRef ModuleName = (*victim)->ModuleName;\n      if (Module *mod = modMap->findModule(ModuleName)) {\n        mod->setASTFile(nullptr);\n      }\n    }\n\n    \/\/ Files that didn't make it through ReadASTCore successfully will be\n    \/\/ rebuilt (or there was an error). Invalidate them so that we can load the\n    \/\/ new files that will be renamed over the old ones.\n    if (LoadedSuccessfully.count(*victim) == 0)\n      FileMgr.invalidateCache((*victim)->File);\n\n    delete *victim;\n  }\n\n  \/\/ Remove the modules from the chain.\n  Chain.erase(first, last);\n}\n\nvoid\nModuleManager::addInMemoryBuffer(StringRef FileName,\n                                 std::unique_ptr<llvm::MemoryBuffer> Buffer) {\n\n  const FileEntry *Entry =\n      FileMgr.getVirtualFile(FileName, Buffer->getBufferSize(), 0);\n  InMemoryBuffers[Entry] = std::move(Buffer);\n}\n\nModuleManager::VisitState *ModuleManager::allocateVisitState() {\n  \/\/ Fast path: if we have a cached state, use it.\n  if (FirstVisitState) {\n    VisitState *Result = FirstVisitState;\n    FirstVisitState = FirstVisitState->NextState;\n    Result->NextState = nullptr;\n    return Result;\n  }\n\n  \/\/ Allocate and return a new state.\n  return new VisitState(size());\n}\n\nvoid ModuleManager::returnVisitState(VisitState *State) {\n  assert(State->NextState == nullptr && \"Visited state is in list?\");\n  State->NextState = FirstVisitState;\n  FirstVisitState = State;\n}\n\nvoid ModuleManager::setGlobalIndex(GlobalModuleIndex *Index) {\n  GlobalIndex = Index;\n  if (!GlobalIndex) {\n    ModulesInCommonWithGlobalIndex.clear();\n    return;\n  }\n\n  \/\/ Notify the global module index about all of the modules we've already\n  \/\/ loaded.\n  for (unsigned I = 0, N = Chain.size(); I != N; ++I) {\n    if (!GlobalIndex->loadedModuleFile(Chain[I])) {\n      ModulesInCommonWithGlobalIndex.push_back(Chain[I]);\n    }\n  }\n}\n\nvoid ModuleManager::moduleFileAccepted(ModuleFile *MF) {\n  if (!GlobalIndex || GlobalIndex->loadedModuleFile(MF))\n    return;\n\n  ModulesInCommonWithGlobalIndex.push_back(MF);\n}\n\nModuleManager::ModuleManager(FileManager &FileMgr,\n                             const PCHContainerReader &PCHContainerRdr)\n    : FileMgr(FileMgr), PCHContainerRdr(PCHContainerRdr), GlobalIndex(),\n      FirstVisitState(nullptr) {}\n\nModuleManager::~ModuleManager() {\n  for (unsigned i = 0, e = Chain.size(); i != e; ++i)\n    delete Chain[e - i - 1];\n  delete FirstVisitState;\n}\n\nvoid ModuleManager::visit(llvm::function_ref<bool(ModuleFile &M)> Visitor,\n                          llvm::SmallPtrSetImpl<ModuleFile *> *ModuleFilesHit) {\n  \/\/ If the visitation order vector is the wrong size, recompute the order.\n  if (VisitOrder.size() != Chain.size()) {\n    unsigned N = size();\n    VisitOrder.clear();\n    VisitOrder.reserve(N);\n    \n    \/\/ Record the number of incoming edges for each module. When we\n    \/\/ encounter a module with no incoming edges, push it into the queue\n    \/\/ to seed the queue.\n    SmallVector<ModuleFile *, 4> Queue;\n    Queue.reserve(N);\n    llvm::SmallVector<unsigned, 4> UnusedIncomingEdges;\n    UnusedIncomingEdges.resize(size());\n    for (ModuleFile *M : llvm::reverse(*this)) {\n      unsigned Size = M->ImportedBy.size();\n      UnusedIncomingEdges[M->Index] = Size;\n      if (!Size)\n        Queue.push_back(M);\n    }\n\n    \/\/ Traverse the graph, making sure to visit a module before visiting any\n    \/\/ of its dependencies.\n    while (!Queue.empty()) {\n      ModuleFile *CurrentModule = Queue.pop_back_val();\n      VisitOrder.push_back(CurrentModule);\n\n      \/\/ For any module that this module depends on, push it on the\n      \/\/ stack (if it hasn't already been marked as visited).\n      for (auto M = CurrentModule->Imports.rbegin(),\n                MEnd = CurrentModule->Imports.rend();\n           M != MEnd; ++M) {\n        \/\/ Remove our current module as an impediment to visiting the\n        \/\/ module we depend on. If we were the last unvisited module\n        \/\/ that depends on this particular module, push it into the\n        \/\/ queue to be visited.\n        unsigned &NumUnusedEdges = UnusedIncomingEdges[(*M)->Index];\n        if (NumUnusedEdges && (--NumUnusedEdges == 0))\n          Queue.push_back(*M);\n      }\n    }\n\n    assert(VisitOrder.size() == N && \"Visitation order is wrong?\");\n\n    delete FirstVisitState;\n    FirstVisitState = nullptr;\n  }\n\n  VisitState *State = allocateVisitState();\n  unsigned VisitNumber = State->NextVisitNumber++;\n\n  \/\/ If the caller has provided us with a hit-set that came from the global\n  \/\/ module index, mark every module file in common with the global module\n  \/\/ index that is *not* in that set as 'visited'.\n  if (ModuleFilesHit && !ModulesInCommonWithGlobalIndex.empty()) {\n    for (unsigned I = 0, N = ModulesInCommonWithGlobalIndex.size(); I != N; ++I)\n    {\n      ModuleFile *M = ModulesInCommonWithGlobalIndex[I];\n      if (!ModuleFilesHit->count(M))\n        State->VisitNumber[M->Index] = VisitNumber;\n    }\n  }\n\n  for (unsigned I = 0, N = VisitOrder.size(); I != N; ++I) {\n    ModuleFile *CurrentModule = VisitOrder[I];\n    \/\/ Should we skip this module file?\n    if (State->VisitNumber[CurrentModule->Index] == VisitNumber)\n      continue;\n\n    \/\/ Visit the module.\n    assert(State->VisitNumber[CurrentModule->Index] == VisitNumber - 1);\n    State->VisitNumber[CurrentModule->Index] = VisitNumber;\n    if (!Visitor(*CurrentModule))\n      continue;\n\n    \/\/ The visitor has requested that cut off visitation of any\n    \/\/ module that the current module depends on. To indicate this\n    \/\/ behavior, we mark all of the reachable modules as having been visited.\n    ModuleFile *NextModule = CurrentModule;\n    do {\n      \/\/ For any module that this module depends on, push it on the\n      \/\/ stack (if it hasn't already been marked as visited).\n      for (llvm::SetVector<ModuleFile *>::iterator\n             M = NextModule->Imports.begin(),\n             MEnd = NextModule->Imports.end();\n           M != MEnd; ++M) {\n        if (State->VisitNumber[(*M)->Index] != VisitNumber) {\n          State->Stack.push_back(*M);\n          State->VisitNumber[(*M)->Index] = VisitNumber;\n        }\n      }\n\n      if (State->Stack.empty())\n        break;\n\n      \/\/ Pop the next module off the stack.\n      NextModule = State->Stack.pop_back_val();\n    } while (true);\n  }\n\n  returnVisitState(State);\n}\n\nbool ModuleManager::lookupModuleFile(StringRef FileName,\n                                     off_t ExpectedSize,\n                                     time_t ExpectedModTime,\n                                     const FileEntry *&File) {\n  if (FileName == \"-\") {\n    File = nullptr;\n    return false;\n  }\n\n  \/\/ Open the file immediately to ensure there is no race between stat'ing and\n  \/\/ opening the file.\n  File = FileMgr.getFile(FileName, \/*openFile=*\/true, \/*cacheFailure=*\/false);\n  if (!File)\n    return false;\n\n  if ((ExpectedSize && ExpectedSize != File->getSize()) ||\n      (ExpectedModTime && ExpectedModTime != File->getModificationTime()))\n    \/\/ Do not destroy File, as it may be referenced. If we need to rebuild it,\n    \/\/ it will be destroyed by removeModules.\n    return true;\n\n  return false;\n}\n\n#ifndef NDEBUG\nnamespace llvm {\n  template<>\n  struct GraphTraits<ModuleManager> {\n    typedef ModuleFile *NodeRef;\n    typedef llvm::SetVector<ModuleFile *>::const_iterator ChildIteratorType;\n    typedef ModuleManager::ModuleConstIterator nodes_iterator;\n\n    static ChildIteratorType child_begin(NodeRef Node) {\n      return Node->Imports.begin();\n    }\n\n    static ChildIteratorType child_end(NodeRef Node) {\n      return Node->Imports.end();\n    }\n    \n    static nodes_iterator nodes_begin(const ModuleManager &Manager) {\n      return Manager.begin();\n    }\n    \n    static nodes_iterator nodes_end(const ModuleManager &Manager) {\n      return Manager.end();\n    }\n  };\n  \n  template<>\n  struct DOTGraphTraits<ModuleManager> : public DefaultDOTGraphTraits {\n    explicit DOTGraphTraits(bool IsSimple = false)\n      : DefaultDOTGraphTraits(IsSimple) { }\n    \n    static bool renderGraphFromBottomUp() {\n      return true;\n    }\n\n    std::string getNodeLabel(ModuleFile *M, const ModuleManager&) {\n      return M->ModuleName;\n    }\n  };\n}\n\nvoid ModuleManager::viewGraph() {\n  llvm::ViewGraph(*this, \"Modules\");\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/===--- ModuleManager.cpp - Module Manager ---------------------*- 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 ModuleManager class, which manages a set of loaded\n\/\/  modules for the ASTReader.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n#include \"clang\/Serialization\/ModuleManager.h\"\n#include \"clang\/Frontend\/PCHContainerOperations.h\"\n#include \"clang\/Lex\/HeaderSearch.h\"\n#include \"clang\/Lex\/ModuleMap.h\"\n#include \"clang\/Serialization\/GlobalModuleIndex.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include \"llvm\/Support\/Path.h\"\n#include <system_error>\n\n#ifndef NDEBUG\n#include \"llvm\/Support\/GraphWriter.h\"\n#endif\n\nusing namespace clang;\nusing namespace serialization;\n\nModuleFile *ModuleManager::lookup(StringRef Name) {\n  const FileEntry *Entry = FileMgr.getFile(Name, \/*openFile=*\/false,\n                                           \/*cacheFailure=*\/false);\n  if (Entry)\n    return lookup(Entry);\n\n  return nullptr;\n}\n\nModuleFile *ModuleManager::lookup(const FileEntry *File) {\n  llvm::DenseMap<const FileEntry *, ModuleFile *>::iterator Known\n    = Modules.find(File);\n  if (Known == Modules.end())\n    return nullptr;\n\n  return Known->second;\n}\n\nstd::unique_ptr<llvm::MemoryBuffer>\nModuleManager::lookupBuffer(StringRef Name) {\n  const FileEntry *Entry = FileMgr.getFile(Name, \/*openFile=*\/false,\n                                           \/*cacheFailure=*\/false);\n  return std::move(InMemoryBuffers[Entry]);\n}\n\nstatic bool checkSignature(ASTFileSignature Signature,\n                           ASTFileSignature ExpectedSignature,\n                           std::string &ErrorStr) {\n  if (!ExpectedSignature || Signature == ExpectedSignature)\n    return false;\n\n  ErrorStr =\n      Signature ? \"signature mismatch\" : \"could not read module signature\";\n  return true;\n}\n\nstatic void updateModuleImports(ModuleFile &MF, ModuleFile *ImportedBy,\n                                SourceLocation ImportLoc) {\n  if (ImportedBy) {\n    MF.ImportedBy.insert(ImportedBy);\n    ImportedBy->Imports.insert(&MF);\n  } else {\n    if (!MF.DirectlyImported)\n      MF.ImportLoc = ImportLoc;\n\n    MF.DirectlyImported = true;\n  }\n}\n\nModuleManager::AddModuleResult\nModuleManager::addModule(StringRef FileName, ModuleKind Type,\n                         SourceLocation ImportLoc, ModuleFile *ImportedBy,\n                         unsigned Generation,\n                         off_t ExpectedSize, time_t ExpectedModTime,\n                         ASTFileSignature ExpectedSignature,\n                         ASTFileSignatureReader ReadSignature,\n                         ModuleFile *&Module,\n                         std::string &ErrorStr) {\n  Module = nullptr;\n\n  \/\/ Look for the file entry. This only fails if the expected size or\n  \/\/ modification time differ.\n  const FileEntry *Entry;\n  if (Type == MK_ExplicitModule || Type == MK_PrebuiltModule) {\n    \/\/ If we're not expecting to pull this file out of the module cache, it\n    \/\/ might have a different mtime due to being moved across filesystems in\n    \/\/ a distributed build. The size must still match, though. (As must the\n    \/\/ contents, but we can't check that.)\n    ExpectedModTime = 0;\n  }\n  if (lookupModuleFile(FileName, ExpectedSize, ExpectedModTime, Entry)) {\n    ErrorStr = \"module file out of date\";\n    return OutOfDate;\n  }\n\n  if (!Entry && FileName != \"-\") {\n    ErrorStr = \"module file not found\";\n    return Missing;\n  }\n\n  \/\/ Check whether we already loaded this module, before\n  if (ModuleFile *ModuleEntry = Modules.lookup(Entry)) {\n    \/\/ Check the stored signature.\n    if (checkSignature(ModuleEntry->Signature, ExpectedSignature, ErrorStr))\n      return OutOfDate;\n\n    Module = ModuleEntry;\n    updateModuleImports(*ModuleEntry, ImportedBy, ImportLoc);\n    return AlreadyLoaded;\n  }\n\n  \/\/ Allocate a new module.\n  auto NewModule = llvm::make_unique<ModuleFile>(Type, Generation);\n  NewModule->Index = Chain.size();\n  NewModule->FileName = FileName.str();\n  NewModule->File = Entry;\n  NewModule->ImportLoc = ImportLoc;\n  NewModule->InputFilesValidationTimestamp = 0;\n\n  if (NewModule->Kind == MK_ImplicitModule) {\n    std::string TimestampFilename = NewModule->getTimestampFilename();\n    vfs::Status Status;\n    \/\/ A cached stat value would be fine as well.\n    if (!FileMgr.getNoncachedStatValue(TimestampFilename, Status))\n      NewModule->InputFilesValidationTimestamp =\n          llvm::sys::toTimeT(Status.getLastModificationTime());\n  }\n\n  \/\/ Load the contents of the module\n  if (std::unique_ptr<llvm::MemoryBuffer> Buffer = lookupBuffer(FileName)) {\n    \/\/ The buffer was already provided for us.\n    NewModule->Buffer = std::move(Buffer);\n  } else {\n    \/\/ Open the AST file.\n    llvm::ErrorOr<std::unique_ptr<llvm::MemoryBuffer>> Buf((std::error_code()));\n    if (FileName == \"-\") {\n      Buf = llvm::MemoryBuffer::getSTDIN();\n    } else {\n      \/\/ Leave the FileEntry open so if it gets read again by another\n      \/\/ ModuleManager it must be the same underlying file.\n      \/\/ FIXME: Because FileManager::getFile() doesn't guarantee that it will\n      \/\/ give us an open file, this may not be 100% reliable.\n      Buf = FileMgr.getBufferForFile(NewModule->File,\n                                     \/*IsVolatile=*\/false,\n                                     \/*ShouldClose=*\/false);\n    }\n\n    if (!Buf) {\n      ErrorStr = Buf.getError().message();\n      return Missing;\n    }\n\n    NewModule->Buffer = std::move(*Buf);\n  }\n\n  \/\/ Initialize the stream.\n  NewModule->Data = PCHContainerRdr.ExtractPCH(*NewModule->Buffer);\n\n  \/\/ Read the signature eagerly now so that we can check it.\n  if (checkSignature(ReadSignature(NewModule->Data), ExpectedSignature,\n                     ErrorStr))\n    return OutOfDate;\n\n  \/\/ We're keeping this module.  Store it everywhere.\n  Module = Modules[Entry] = NewModule.get();\n\n  updateModuleImports(*NewModule, ImportedBy, ImportLoc);\n\n  if (!NewModule->isModule())\n    PCHChain.push_back(NewModule.get());\n  if (!ImportedBy)\n    Roots.push_back(NewModule.get());\n\n  Chain.push_back(std::move(NewModule));\n  return NewlyLoaded;\n}\n\nvoid ModuleManager::removeModules(\n    ModuleIterator First,\n    llvm::SmallPtrSetImpl<ModuleFile *> &LoadedSuccessfully,\n    ModuleMap *modMap) {\n  auto Last = end();\n  if (First == Last)\n    return;\n\n\n  \/\/ Explicitly clear VisitOrder since we might not notice it is stale.\n  VisitOrder.clear();\n\n  \/\/ Collect the set of module file pointers that we'll be removing.\n  llvm::SmallPtrSet<ModuleFile *, 4> victimSet(\n      (llvm::pointer_iterator<ModuleIterator>(First)),\n      (llvm::pointer_iterator<ModuleIterator>(Last)));\n\n  auto IsVictim = [&](ModuleFile *MF) {\n    return victimSet.count(MF);\n  };\n  \/\/ Remove any references to the now-destroyed modules.\n  for (auto I = begin(); I != First; ++I) {\n    I->Imports.remove_if(IsVictim);\n    I->ImportedBy.remove_if(IsVictim);\n  }\n  Roots.erase(std::remove_if(Roots.begin(), Roots.end(), IsVictim),\n              Roots.end());\n\n  \/\/ Remove the modules from the PCH chain.\n  for (auto I = First; I != Last; ++I) {\n    if (!I->isModule()) {\n      PCHChain.erase(std::find(PCHChain.begin(), PCHChain.end(), &*I),\n                     PCHChain.end());\n      break;\n    }\n  }\n\n  \/\/ Delete the modules and erase them from the various structures.\n  for (ModuleIterator victim = First; victim != Last; ++victim) {\n    Modules.erase(victim->File);\n\n    if (modMap) {\n      StringRef ModuleName = victim->ModuleName;\n      if (Module *mod = modMap->findModule(ModuleName)) {\n        mod->setASTFile(nullptr);\n      }\n    }\n\n    \/\/ Files that didn't make it through ReadASTCore successfully will be\n    \/\/ rebuilt (or there was an error). Invalidate them so that we can load the\n    \/\/ new files that will be renamed over the old ones.\n    if (LoadedSuccessfully.count(&*victim) == 0)\n      FileMgr.invalidateCache(victim->File);\n  }\n\n  \/\/ Delete the modules.\n  Chain.erase(Chain.begin() + (First - begin()), Chain.end());\n}\n\nvoid\nModuleManager::addInMemoryBuffer(StringRef FileName,\n                                 std::unique_ptr<llvm::MemoryBuffer> Buffer) {\n\n  const FileEntry *Entry =\n      FileMgr.getVirtualFile(FileName, Buffer->getBufferSize(), 0);\n  InMemoryBuffers[Entry] = std::move(Buffer);\n}\n\nModuleManager::VisitState *ModuleManager::allocateVisitState() {\n  \/\/ Fast path: if we have a cached state, use it.\n  if (FirstVisitState) {\n    VisitState *Result = FirstVisitState;\n    FirstVisitState = FirstVisitState->NextState;\n    Result->NextState = nullptr;\n    return Result;\n  }\n\n  \/\/ Allocate and return a new state.\n  return new VisitState(size());\n}\n\nvoid ModuleManager::returnVisitState(VisitState *State) {\n  assert(State->NextState == nullptr && \"Visited state is in list?\");\n  State->NextState = FirstVisitState;\n  FirstVisitState = State;\n}\n\nvoid ModuleManager::setGlobalIndex(GlobalModuleIndex *Index) {\n  GlobalIndex = Index;\n  if (!GlobalIndex) {\n    ModulesInCommonWithGlobalIndex.clear();\n    return;\n  }\n\n  \/\/ Notify the global module index about all of the modules we've already\n  \/\/ loaded.\n  for (ModuleFile &M : *this)\n    if (!GlobalIndex->loadedModuleFile(&M))\n      ModulesInCommonWithGlobalIndex.push_back(&M);\n}\n\nvoid ModuleManager::moduleFileAccepted(ModuleFile *MF) {\n  if (!GlobalIndex || GlobalIndex->loadedModuleFile(MF))\n    return;\n\n  ModulesInCommonWithGlobalIndex.push_back(MF);\n}\n\nModuleManager::ModuleManager(FileManager &FileMgr,\n                             const PCHContainerReader &PCHContainerRdr)\n    : FileMgr(FileMgr), PCHContainerRdr(PCHContainerRdr), GlobalIndex(),\n      FirstVisitState(nullptr) {}\n\nModuleManager::~ModuleManager() { delete FirstVisitState; }\n\nvoid ModuleManager::visit(llvm::function_ref<bool(ModuleFile &M)> Visitor,\n                          llvm::SmallPtrSetImpl<ModuleFile *> *ModuleFilesHit) {\n  \/\/ If the visitation order vector is the wrong size, recompute the order.\n  if (VisitOrder.size() != Chain.size()) {\n    unsigned N = size();\n    VisitOrder.clear();\n    VisitOrder.reserve(N);\n    \n    \/\/ Record the number of incoming edges for each module. When we\n    \/\/ encounter a module with no incoming edges, push it into the queue\n    \/\/ to seed the queue.\n    SmallVector<ModuleFile *, 4> Queue;\n    Queue.reserve(N);\n    llvm::SmallVector<unsigned, 4> UnusedIncomingEdges;\n    UnusedIncomingEdges.resize(size());\n    for (ModuleFile &M : llvm::reverse(*this)) {\n      unsigned Size = M.ImportedBy.size();\n      UnusedIncomingEdges[M.Index] = Size;\n      if (!Size)\n        Queue.push_back(&M);\n    }\n\n    \/\/ Traverse the graph, making sure to visit a module before visiting any\n    \/\/ of its dependencies.\n    while (!Queue.empty()) {\n      ModuleFile *CurrentModule = Queue.pop_back_val();\n      VisitOrder.push_back(CurrentModule);\n\n      \/\/ For any module that this module depends on, push it on the\n      \/\/ stack (if it hasn't already been marked as visited).\n      for (auto M = CurrentModule->Imports.rbegin(),\n                MEnd = CurrentModule->Imports.rend();\n           M != MEnd; ++M) {\n        \/\/ Remove our current module as an impediment to visiting the\n        \/\/ module we depend on. If we were the last unvisited module\n        \/\/ that depends on this particular module, push it into the\n        \/\/ queue to be visited.\n        unsigned &NumUnusedEdges = UnusedIncomingEdges[(*M)->Index];\n        if (NumUnusedEdges && (--NumUnusedEdges == 0))\n          Queue.push_back(*M);\n      }\n    }\n\n    assert(VisitOrder.size() == N && \"Visitation order is wrong?\");\n\n    delete FirstVisitState;\n    FirstVisitState = nullptr;\n  }\n\n  VisitState *State = allocateVisitState();\n  unsigned VisitNumber = State->NextVisitNumber++;\n\n  \/\/ If the caller has provided us with a hit-set that came from the global\n  \/\/ module index, mark every module file in common with the global module\n  \/\/ index that is *not* in that set as 'visited'.\n  if (ModuleFilesHit && !ModulesInCommonWithGlobalIndex.empty()) {\n    for (unsigned I = 0, N = ModulesInCommonWithGlobalIndex.size(); I != N; ++I)\n    {\n      ModuleFile *M = ModulesInCommonWithGlobalIndex[I];\n      if (!ModuleFilesHit->count(M))\n        State->VisitNumber[M->Index] = VisitNumber;\n    }\n  }\n\n  for (unsigned I = 0, N = VisitOrder.size(); I != N; ++I) {\n    ModuleFile *CurrentModule = VisitOrder[I];\n    \/\/ Should we skip this module file?\n    if (State->VisitNumber[CurrentModule->Index] == VisitNumber)\n      continue;\n\n    \/\/ Visit the module.\n    assert(State->VisitNumber[CurrentModule->Index] == VisitNumber - 1);\n    State->VisitNumber[CurrentModule->Index] = VisitNumber;\n    if (!Visitor(*CurrentModule))\n      continue;\n\n    \/\/ The visitor has requested that cut off visitation of any\n    \/\/ module that the current module depends on. To indicate this\n    \/\/ behavior, we mark all of the reachable modules as having been visited.\n    ModuleFile *NextModule = CurrentModule;\n    do {\n      \/\/ For any module that this module depends on, push it on the\n      \/\/ stack (if it hasn't already been marked as visited).\n      for (llvm::SetVector<ModuleFile *>::iterator\n             M = NextModule->Imports.begin(),\n             MEnd = NextModule->Imports.end();\n           M != MEnd; ++M) {\n        if (State->VisitNumber[(*M)->Index] != VisitNumber) {\n          State->Stack.push_back(*M);\n          State->VisitNumber[(*M)->Index] = VisitNumber;\n        }\n      }\n\n      if (State->Stack.empty())\n        break;\n\n      \/\/ Pop the next module off the stack.\n      NextModule = State->Stack.pop_back_val();\n    } while (true);\n  }\n\n  returnVisitState(State);\n}\n\nbool ModuleManager::lookupModuleFile(StringRef FileName,\n                                     off_t ExpectedSize,\n                                     time_t ExpectedModTime,\n                                     const FileEntry *&File) {\n  if (FileName == \"-\") {\n    File = nullptr;\n    return false;\n  }\n\n  \/\/ Open the file immediately to ensure there is no race between stat'ing and\n  \/\/ opening the file.\n  File = FileMgr.getFile(FileName, \/*openFile=*\/true, \/*cacheFailure=*\/false);\n  if (!File)\n    return false;\n\n  if ((ExpectedSize && ExpectedSize != File->getSize()) ||\n      (ExpectedModTime && ExpectedModTime != File->getModificationTime()))\n    \/\/ Do not destroy File, as it may be referenced. If we need to rebuild it,\n    \/\/ it will be destroyed by removeModules.\n    return true;\n\n  return false;\n}\n\n#ifndef NDEBUG\nnamespace llvm {\n  template<>\n  struct GraphTraits<ModuleManager> {\n    typedef ModuleFile *NodeRef;\n    typedef llvm::SetVector<ModuleFile *>::const_iterator ChildIteratorType;\n    typedef pointer_iterator<ModuleManager::ModuleConstIterator> nodes_iterator;\n\n    static ChildIteratorType child_begin(NodeRef Node) {\n      return Node->Imports.begin();\n    }\n\n    static ChildIteratorType child_end(NodeRef Node) {\n      return Node->Imports.end();\n    }\n    \n    static nodes_iterator nodes_begin(const ModuleManager &Manager) {\n      return nodes_iterator(Manager.begin());\n    }\n    \n    static nodes_iterator nodes_end(const ModuleManager &Manager) {\n      return nodes_iterator(Manager.end());\n    }\n  };\n  \n  template<>\n  struct DOTGraphTraits<ModuleManager> : public DefaultDOTGraphTraits {\n    explicit DOTGraphTraits(bool IsSimple = false)\n      : DefaultDOTGraphTraits(IsSimple) { }\n    \n    static bool renderGraphFromBottomUp() {\n      return true;\n    }\n\n    std::string getNodeLabel(ModuleFile *M, const ModuleManager&) {\n      return M->ModuleName;\n    }\n  };\n}\n\nvoid ModuleManager::viewGraph() {\n  llvm::ViewGraph(*this, \"Modules\");\n}\n#endif\n<commit_msg>Modules: Fix a minor performance bug from r293393<commit_after>\/\/===--- ModuleManager.cpp - Module Manager ---------------------*- 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 ModuleManager class, which manages a set of loaded\n\/\/  modules for the ASTReader.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n#include \"clang\/Serialization\/ModuleManager.h\"\n#include \"clang\/Frontend\/PCHContainerOperations.h\"\n#include \"clang\/Lex\/HeaderSearch.h\"\n#include \"clang\/Lex\/ModuleMap.h\"\n#include \"clang\/Serialization\/GlobalModuleIndex.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include \"llvm\/Support\/Path.h\"\n#include <system_error>\n\n#ifndef NDEBUG\n#include \"llvm\/Support\/GraphWriter.h\"\n#endif\n\nusing namespace clang;\nusing namespace serialization;\n\nModuleFile *ModuleManager::lookup(StringRef Name) {\n  const FileEntry *Entry = FileMgr.getFile(Name, \/*openFile=*\/false,\n                                           \/*cacheFailure=*\/false);\n  if (Entry)\n    return lookup(Entry);\n\n  return nullptr;\n}\n\nModuleFile *ModuleManager::lookup(const FileEntry *File) {\n  llvm::DenseMap<const FileEntry *, ModuleFile *>::iterator Known\n    = Modules.find(File);\n  if (Known == Modules.end())\n    return nullptr;\n\n  return Known->second;\n}\n\nstd::unique_ptr<llvm::MemoryBuffer>\nModuleManager::lookupBuffer(StringRef Name) {\n  const FileEntry *Entry = FileMgr.getFile(Name, \/*openFile=*\/false,\n                                           \/*cacheFailure=*\/false);\n  return std::move(InMemoryBuffers[Entry]);\n}\n\nstatic bool checkSignature(ASTFileSignature Signature,\n                           ASTFileSignature ExpectedSignature,\n                           std::string &ErrorStr) {\n  if (!ExpectedSignature || Signature == ExpectedSignature)\n    return false;\n\n  ErrorStr =\n      Signature ? \"signature mismatch\" : \"could not read module signature\";\n  return true;\n}\n\nstatic void updateModuleImports(ModuleFile &MF, ModuleFile *ImportedBy,\n                                SourceLocation ImportLoc) {\n  if (ImportedBy) {\n    MF.ImportedBy.insert(ImportedBy);\n    ImportedBy->Imports.insert(&MF);\n  } else {\n    if (!MF.DirectlyImported)\n      MF.ImportLoc = ImportLoc;\n\n    MF.DirectlyImported = true;\n  }\n}\n\nModuleManager::AddModuleResult\nModuleManager::addModule(StringRef FileName, ModuleKind Type,\n                         SourceLocation ImportLoc, ModuleFile *ImportedBy,\n                         unsigned Generation,\n                         off_t ExpectedSize, time_t ExpectedModTime,\n                         ASTFileSignature ExpectedSignature,\n                         ASTFileSignatureReader ReadSignature,\n                         ModuleFile *&Module,\n                         std::string &ErrorStr) {\n  Module = nullptr;\n\n  \/\/ Look for the file entry. This only fails if the expected size or\n  \/\/ modification time differ.\n  const FileEntry *Entry;\n  if (Type == MK_ExplicitModule || Type == MK_PrebuiltModule) {\n    \/\/ If we're not expecting to pull this file out of the module cache, it\n    \/\/ might have a different mtime due to being moved across filesystems in\n    \/\/ a distributed build. The size must still match, though. (As must the\n    \/\/ contents, but we can't check that.)\n    ExpectedModTime = 0;\n  }\n  if (lookupModuleFile(FileName, ExpectedSize, ExpectedModTime, Entry)) {\n    ErrorStr = \"module file out of date\";\n    return OutOfDate;\n  }\n\n  if (!Entry && FileName != \"-\") {\n    ErrorStr = \"module file not found\";\n    return Missing;\n  }\n\n  \/\/ Check whether we already loaded this module, before\n  if (ModuleFile *ModuleEntry = Modules.lookup(Entry)) {\n    \/\/ Check the stored signature.\n    if (checkSignature(ModuleEntry->Signature, ExpectedSignature, ErrorStr))\n      return OutOfDate;\n\n    Module = ModuleEntry;\n    updateModuleImports(*ModuleEntry, ImportedBy, ImportLoc);\n    return AlreadyLoaded;\n  }\n\n  \/\/ Allocate a new module.\n  auto NewModule = llvm::make_unique<ModuleFile>(Type, Generation);\n  NewModule->Index = Chain.size();\n  NewModule->FileName = FileName.str();\n  NewModule->File = Entry;\n  NewModule->ImportLoc = ImportLoc;\n  NewModule->InputFilesValidationTimestamp = 0;\n\n  if (NewModule->Kind == MK_ImplicitModule) {\n    std::string TimestampFilename = NewModule->getTimestampFilename();\n    vfs::Status Status;\n    \/\/ A cached stat value would be fine as well.\n    if (!FileMgr.getNoncachedStatValue(TimestampFilename, Status))\n      NewModule->InputFilesValidationTimestamp =\n          llvm::sys::toTimeT(Status.getLastModificationTime());\n  }\n\n  \/\/ Load the contents of the module\n  if (std::unique_ptr<llvm::MemoryBuffer> Buffer = lookupBuffer(FileName)) {\n    \/\/ The buffer was already provided for us.\n    NewModule->Buffer = std::move(Buffer);\n  } else {\n    \/\/ Open the AST file.\n    llvm::ErrorOr<std::unique_ptr<llvm::MemoryBuffer>> Buf((std::error_code()));\n    if (FileName == \"-\") {\n      Buf = llvm::MemoryBuffer::getSTDIN();\n    } else {\n      \/\/ Leave the FileEntry open so if it gets read again by another\n      \/\/ ModuleManager it must be the same underlying file.\n      \/\/ FIXME: Because FileManager::getFile() doesn't guarantee that it will\n      \/\/ give us an open file, this may not be 100% reliable.\n      Buf = FileMgr.getBufferForFile(NewModule->File,\n                                     \/*IsVolatile=*\/false,\n                                     \/*ShouldClose=*\/false);\n    }\n\n    if (!Buf) {\n      ErrorStr = Buf.getError().message();\n      return Missing;\n    }\n\n    NewModule->Buffer = std::move(*Buf);\n  }\n\n  \/\/ Initialize the stream.\n  NewModule->Data = PCHContainerRdr.ExtractPCH(*NewModule->Buffer);\n\n  \/\/ Read the signature eagerly now so that we can check it.  Avoid calling\n  \/\/ ReadSignature unless there's something to check though.\n  if (ExpectedSignature && checkSignature(ReadSignature(NewModule->Data),\n                                          ExpectedSignature, ErrorStr))\n    return OutOfDate;\n\n  \/\/ We're keeping this module.  Store it everywhere.\n  Module = Modules[Entry] = NewModule.get();\n\n  updateModuleImports(*NewModule, ImportedBy, ImportLoc);\n\n  if (!NewModule->isModule())\n    PCHChain.push_back(NewModule.get());\n  if (!ImportedBy)\n    Roots.push_back(NewModule.get());\n\n  Chain.push_back(std::move(NewModule));\n  return NewlyLoaded;\n}\n\nvoid ModuleManager::removeModules(\n    ModuleIterator First,\n    llvm::SmallPtrSetImpl<ModuleFile *> &LoadedSuccessfully,\n    ModuleMap *modMap) {\n  auto Last = end();\n  if (First == Last)\n    return;\n\n\n  \/\/ Explicitly clear VisitOrder since we might not notice it is stale.\n  VisitOrder.clear();\n\n  \/\/ Collect the set of module file pointers that we'll be removing.\n  llvm::SmallPtrSet<ModuleFile *, 4> victimSet(\n      (llvm::pointer_iterator<ModuleIterator>(First)),\n      (llvm::pointer_iterator<ModuleIterator>(Last)));\n\n  auto IsVictim = [&](ModuleFile *MF) {\n    return victimSet.count(MF);\n  };\n  \/\/ Remove any references to the now-destroyed modules.\n  for (auto I = begin(); I != First; ++I) {\n    I->Imports.remove_if(IsVictim);\n    I->ImportedBy.remove_if(IsVictim);\n  }\n  Roots.erase(std::remove_if(Roots.begin(), Roots.end(), IsVictim),\n              Roots.end());\n\n  \/\/ Remove the modules from the PCH chain.\n  for (auto I = First; I != Last; ++I) {\n    if (!I->isModule()) {\n      PCHChain.erase(std::find(PCHChain.begin(), PCHChain.end(), &*I),\n                     PCHChain.end());\n      break;\n    }\n  }\n\n  \/\/ Delete the modules and erase them from the various structures.\n  for (ModuleIterator victim = First; victim != Last; ++victim) {\n    Modules.erase(victim->File);\n\n    if (modMap) {\n      StringRef ModuleName = victim->ModuleName;\n      if (Module *mod = modMap->findModule(ModuleName)) {\n        mod->setASTFile(nullptr);\n      }\n    }\n\n    \/\/ Files that didn't make it through ReadASTCore successfully will be\n    \/\/ rebuilt (or there was an error). Invalidate them so that we can load the\n    \/\/ new files that will be renamed over the old ones.\n    if (LoadedSuccessfully.count(&*victim) == 0)\n      FileMgr.invalidateCache(victim->File);\n  }\n\n  \/\/ Delete the modules.\n  Chain.erase(Chain.begin() + (First - begin()), Chain.end());\n}\n\nvoid\nModuleManager::addInMemoryBuffer(StringRef FileName,\n                                 std::unique_ptr<llvm::MemoryBuffer> Buffer) {\n\n  const FileEntry *Entry =\n      FileMgr.getVirtualFile(FileName, Buffer->getBufferSize(), 0);\n  InMemoryBuffers[Entry] = std::move(Buffer);\n}\n\nModuleManager::VisitState *ModuleManager::allocateVisitState() {\n  \/\/ Fast path: if we have a cached state, use it.\n  if (FirstVisitState) {\n    VisitState *Result = FirstVisitState;\n    FirstVisitState = FirstVisitState->NextState;\n    Result->NextState = nullptr;\n    return Result;\n  }\n\n  \/\/ Allocate and return a new state.\n  return new VisitState(size());\n}\n\nvoid ModuleManager::returnVisitState(VisitState *State) {\n  assert(State->NextState == nullptr && \"Visited state is in list?\");\n  State->NextState = FirstVisitState;\n  FirstVisitState = State;\n}\n\nvoid ModuleManager::setGlobalIndex(GlobalModuleIndex *Index) {\n  GlobalIndex = Index;\n  if (!GlobalIndex) {\n    ModulesInCommonWithGlobalIndex.clear();\n    return;\n  }\n\n  \/\/ Notify the global module index about all of the modules we've already\n  \/\/ loaded.\n  for (ModuleFile &M : *this)\n    if (!GlobalIndex->loadedModuleFile(&M))\n      ModulesInCommonWithGlobalIndex.push_back(&M);\n}\n\nvoid ModuleManager::moduleFileAccepted(ModuleFile *MF) {\n  if (!GlobalIndex || GlobalIndex->loadedModuleFile(MF))\n    return;\n\n  ModulesInCommonWithGlobalIndex.push_back(MF);\n}\n\nModuleManager::ModuleManager(FileManager &FileMgr,\n                             const PCHContainerReader &PCHContainerRdr)\n    : FileMgr(FileMgr), PCHContainerRdr(PCHContainerRdr), GlobalIndex(),\n      FirstVisitState(nullptr) {}\n\nModuleManager::~ModuleManager() { delete FirstVisitState; }\n\nvoid ModuleManager::visit(llvm::function_ref<bool(ModuleFile &M)> Visitor,\n                          llvm::SmallPtrSetImpl<ModuleFile *> *ModuleFilesHit) {\n  \/\/ If the visitation order vector is the wrong size, recompute the order.\n  if (VisitOrder.size() != Chain.size()) {\n    unsigned N = size();\n    VisitOrder.clear();\n    VisitOrder.reserve(N);\n    \n    \/\/ Record the number of incoming edges for each module. When we\n    \/\/ encounter a module with no incoming edges, push it into the queue\n    \/\/ to seed the queue.\n    SmallVector<ModuleFile *, 4> Queue;\n    Queue.reserve(N);\n    llvm::SmallVector<unsigned, 4> UnusedIncomingEdges;\n    UnusedIncomingEdges.resize(size());\n    for (ModuleFile &M : llvm::reverse(*this)) {\n      unsigned Size = M.ImportedBy.size();\n      UnusedIncomingEdges[M.Index] = Size;\n      if (!Size)\n        Queue.push_back(&M);\n    }\n\n    \/\/ Traverse the graph, making sure to visit a module before visiting any\n    \/\/ of its dependencies.\n    while (!Queue.empty()) {\n      ModuleFile *CurrentModule = Queue.pop_back_val();\n      VisitOrder.push_back(CurrentModule);\n\n      \/\/ For any module that this module depends on, push it on the\n      \/\/ stack (if it hasn't already been marked as visited).\n      for (auto M = CurrentModule->Imports.rbegin(),\n                MEnd = CurrentModule->Imports.rend();\n           M != MEnd; ++M) {\n        \/\/ Remove our current module as an impediment to visiting the\n        \/\/ module we depend on. If we were the last unvisited module\n        \/\/ that depends on this particular module, push it into the\n        \/\/ queue to be visited.\n        unsigned &NumUnusedEdges = UnusedIncomingEdges[(*M)->Index];\n        if (NumUnusedEdges && (--NumUnusedEdges == 0))\n          Queue.push_back(*M);\n      }\n    }\n\n    assert(VisitOrder.size() == N && \"Visitation order is wrong?\");\n\n    delete FirstVisitState;\n    FirstVisitState = nullptr;\n  }\n\n  VisitState *State = allocateVisitState();\n  unsigned VisitNumber = State->NextVisitNumber++;\n\n  \/\/ If the caller has provided us with a hit-set that came from the global\n  \/\/ module index, mark every module file in common with the global module\n  \/\/ index that is *not* in that set as 'visited'.\n  if (ModuleFilesHit && !ModulesInCommonWithGlobalIndex.empty()) {\n    for (unsigned I = 0, N = ModulesInCommonWithGlobalIndex.size(); I != N; ++I)\n    {\n      ModuleFile *M = ModulesInCommonWithGlobalIndex[I];\n      if (!ModuleFilesHit->count(M))\n        State->VisitNumber[M->Index] = VisitNumber;\n    }\n  }\n\n  for (unsigned I = 0, N = VisitOrder.size(); I != N; ++I) {\n    ModuleFile *CurrentModule = VisitOrder[I];\n    \/\/ Should we skip this module file?\n    if (State->VisitNumber[CurrentModule->Index] == VisitNumber)\n      continue;\n\n    \/\/ Visit the module.\n    assert(State->VisitNumber[CurrentModule->Index] == VisitNumber - 1);\n    State->VisitNumber[CurrentModule->Index] = VisitNumber;\n    if (!Visitor(*CurrentModule))\n      continue;\n\n    \/\/ The visitor has requested that cut off visitation of any\n    \/\/ module that the current module depends on. To indicate this\n    \/\/ behavior, we mark all of the reachable modules as having been visited.\n    ModuleFile *NextModule = CurrentModule;\n    do {\n      \/\/ For any module that this module depends on, push it on the\n      \/\/ stack (if it hasn't already been marked as visited).\n      for (llvm::SetVector<ModuleFile *>::iterator\n             M = NextModule->Imports.begin(),\n             MEnd = NextModule->Imports.end();\n           M != MEnd; ++M) {\n        if (State->VisitNumber[(*M)->Index] != VisitNumber) {\n          State->Stack.push_back(*M);\n          State->VisitNumber[(*M)->Index] = VisitNumber;\n        }\n      }\n\n      if (State->Stack.empty())\n        break;\n\n      \/\/ Pop the next module off the stack.\n      NextModule = State->Stack.pop_back_val();\n    } while (true);\n  }\n\n  returnVisitState(State);\n}\n\nbool ModuleManager::lookupModuleFile(StringRef FileName,\n                                     off_t ExpectedSize,\n                                     time_t ExpectedModTime,\n                                     const FileEntry *&File) {\n  if (FileName == \"-\") {\n    File = nullptr;\n    return false;\n  }\n\n  \/\/ Open the file immediately to ensure there is no race between stat'ing and\n  \/\/ opening the file.\n  File = FileMgr.getFile(FileName, \/*openFile=*\/true, \/*cacheFailure=*\/false);\n  if (!File)\n    return false;\n\n  if ((ExpectedSize && ExpectedSize != File->getSize()) ||\n      (ExpectedModTime && ExpectedModTime != File->getModificationTime()))\n    \/\/ Do not destroy File, as it may be referenced. If we need to rebuild it,\n    \/\/ it will be destroyed by removeModules.\n    return true;\n\n  return false;\n}\n\n#ifndef NDEBUG\nnamespace llvm {\n  template<>\n  struct GraphTraits<ModuleManager> {\n    typedef ModuleFile *NodeRef;\n    typedef llvm::SetVector<ModuleFile *>::const_iterator ChildIteratorType;\n    typedef pointer_iterator<ModuleManager::ModuleConstIterator> nodes_iterator;\n\n    static ChildIteratorType child_begin(NodeRef Node) {\n      return Node->Imports.begin();\n    }\n\n    static ChildIteratorType child_end(NodeRef Node) {\n      return Node->Imports.end();\n    }\n    \n    static nodes_iterator nodes_begin(const ModuleManager &Manager) {\n      return nodes_iterator(Manager.begin());\n    }\n    \n    static nodes_iterator nodes_end(const ModuleManager &Manager) {\n      return nodes_iterator(Manager.end());\n    }\n  };\n  \n  template<>\n  struct DOTGraphTraits<ModuleManager> : public DefaultDOTGraphTraits {\n    explicit DOTGraphTraits(bool IsSimple = false)\n      : DefaultDOTGraphTraits(IsSimple) { }\n    \n    static bool renderGraphFromBottomUp() {\n      return true;\n    }\n\n    std::string getNodeLabel(ModuleFile *M, const ModuleManager&) {\n      return M->ModuleName;\n    }\n  };\n}\n\nvoid ModuleManager::viewGraph() {\n  llvm::ViewGraph(*this, \"Modules\");\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/chips\/ocmb\/odyssey\/procedures\/hwp\/memory\/lib\/mc\/ody_port.C $ *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2019,2022                        *\/\n\/* [+] International Business Machines Corp.                              *\/\n\/*                                                                        *\/\n\/*                                                                        *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\");        *\/\n\/* you may not use this file except in compliance with the License.       *\/\n\/* You may obtain a copy of the License at                                *\/\n\/*                                                                        *\/\n\/*     http:\/\/www.apache.org\/licenses\/LICENSE-2.0                         *\/\n\/*                                                                        *\/\n\/* Unless required by applicable law or agreed to in writing, software    *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS,      *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or        *\/\n\/* implied. See the License for the specific language governing           *\/\n\/* permissions and limitations under the License.                         *\/\n\/*                                                                        *\/\n\/* IBM_PROLOG_END_TAG                                                     *\/\n\/\/ EKB-Mirror-To: hostboot\n\n\/\/\/\n\/\/\/ @file ody_port.C\n\/\/\/ @brief Odyssey specializations for memory ports\n\/\/\/\n\/\/ *HWP HWP Owner: Louis Stermole <stermole@us.ibm.com>\n\/\/ *HWP HWP Backup: Stephen Glancy <sglancy@us.ibm.com>\n\/\/ *HWP Team: Memory\n\/\/ *HWP Level: 2\n\/\/ *HWP Consumed by: HB:FSP\n\n#include <fapi2.H>\n#include <ody_scom_ody.H>\n#include <lib\/shared\/ody_consts.H>\n#include <lib\/dimm\/ody_rank.H>\n#include <generic\/memory\/lib\/utils\/mc\/gen_mss_port.H>\n#include <generic\/memory\/lib\/utils\/mc\/gen_mss_restore_repairs.H>\n#include <generic\/memory\/lib\/utils\/shared\/mss_generic_consts.H>\n#include <generic\/memory\/lib\/utils\/mc\/gen_mss_port_traits.H>\n#include <generic\/memory\/lib\/utils\/poll.H>\n#include <generic\/memory\/lib\/utils\/find.H>\n#include <generic\/memory\/lib\/utils\/pos.H>\n#include <lib\/mc\/ody_port_traits.H>\n#include <lib\/mc\/ody_port.H>\n#include <lib\/ecc\/ecc_traits_odyssey.H>\n#include <lib\/mcbist\/ody_mcbist_traits.H>\n#include <lib\/mcbist\/ody_maint_cmds.H>\n#include <mss_generic_attribute_getters.H>\n#include <ody_scom_ody_odc.H>\n\n\nnamespace mss\n{\nconst std::vector<uint8_t> portTraits< mss::mc_type::ODYSSEY >::NON_SPARE_NIBBLES =\n{\n    0,\n    1,\n    2,\n    3,\n    4,\n    5,\n    6,\n    7,\n    8,\n    9,\n    \/\/ Byte 5 contains the spares (if they exist) for mc_type\n    12,\n    13,\n    14,\n    15,\n    16,\n    17,\n    18,\n    19,\n};\n\nconst std::vector<uint8_t> portTraits< mss::mc_type::ODYSSEY >::SPARE_NIBBLES =\n{\n    \/\/ Byte 5 contains the spares (if they exist) for mc_type\n    10,\n    11\n};\n\n\/\/\/\n\/\/\/ @brief Configures the write reorder queue bit - Odyssey specialization\n\/\/\/ @param[in] i_target the target to effect\n\/\/\/ @param[in] i_state to set the bit too\n\/\/\/ @return FAPI2_RC_SUCCSS iff ok\n\/\/\/ @NOTE: Due to RRQ and WRQ being combined into ROQ this function is now NOOP\n\/\/\/\ntemplate< >\nfapi2::ReturnCode configure_wrq<mss::mc_type::ODYSSEY>(\n    const fapi2::Target<fapi2::TARGET_TYPE_OCMB_CHIP>& i_target,\n    const mss::states i_state)\n{\n    return fapi2::FAPI2_RC_SUCCESS;\n}\n\n\/\/\/\n\/\/\/ @brief Configures the read reorder queue bit - Odyssey specialization\n\/\/\/ @param[in] i_target the target to effect\n\/\/\/ @param[in] i_state to set the bit too\n\/\/\/ @return FAPI2_RC_SUCCSS iff ok\n\/\/\/\ntemplate< >\nfapi2::ReturnCode configure_rrq<mss::mc_type::ODYSSEY>(\n    const fapi2::Target<fapi2::TARGET_TYPE_OCMB_CHIP>& i_target,\n    const mss::states i_state)\n{\n    using TT = portTraits<mss::mc_type::ODYSSEY>;\n    fapi2::buffer<uint64_t> l_data;\n\n    \/\/ Gets the reg\n    FAPI_TRY(mss::getScom(i_target, TT::ROQ_REG, l_data), \"%s failed to getScom from ROQ0Q\",\n             mss::c_str(i_target));\n\n    \/\/ Sets the bit\n    l_data.writeBit<TT::ROQ_FIFO_MODE>(i_state == mss::states::ON);\n\n    \/\/ Sets the regs\n    FAPI_TRY(mss::putScom(i_target, TT::ROQ_REG, l_data), \"%s failed to putScom to ROQ0Q\",\n             mss::c_str(i_target));\n\n    return fapi2::FAPI2_RC_SUCCESS;\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\nnamespace ody\n{\n\n\/\/\/\n\/\/\/ @brief Initializes the DFI interface\n\/\/\/ @param[in] i_target the target to check for DFI interface completion\n\/\/\/ @return FAPI2_RC_SUCCSS iff ok\n\/\/\/\nfapi2::ReturnCode poll_for_dfi_init_complete( const fapi2::Target<fapi2::TARGET_TYPE_OCMB_CHIP>& i_target )\n{\n\n    \/\/ For each port...\n    for(const auto& l_port : mss::find_targets<fapi2::TARGET_TYPE_MEM_PORT>(i_target))\n    {\n        \/\/ ... Polls for the DFI init complete\n        FAPI_TRY(poll_for_dfi_init_complete(l_port));\n    }\n\n    return fapi2::FAPI2_RC_SUCCESS;\nfapi_try_exit:\n    return fapi2::current_err;\n\n}\n\n\/\/\/\n\/\/\/ @brief Initializes the DFI interface\n\/\/\/ @param[in] i_target the target to check for DFI interface completion\n\/\/\/ @return FAPI2_RC_SUCCSS iff ok\n\/\/\/\nfapi2::ReturnCode poll_for_dfi_init_complete( const fapi2::Target<fapi2::TARGET_TYPE_MEM_PORT>& i_target )\n{\n    using TT = mss::portTraits< mss::mc_type::ODYSSEY >;\n    const auto& l_ocmb = mss::find_target<fapi2::TARGET_TYPE_OCMB_CHIP>(i_target);\n\n    \/\/ Each PHY (aka port target) has its own DFI complete bit\n    \/\/ As such, depending upon the port in question, the DFI complete bit is different\n    const uint64_t DFI_COMPLETE_BIT = mss::relative_pos<mss::mc_type::ODYSSEY, fapi2::TARGET_TYPE_OCMB_CHIP>\n                                      (i_target) == 0 ?\n                                      TT::DFI_INIT_COMPLETE0 : TT::DFI_INIT_COMPLETE1;\n\n\n    fapi2::buffer<uint64_t> l_data;\n    mss::poll_parameters l_poll_params(DELAY_10NS,\n                                       200,\n                                       mss::DELAY_1MS,\n                                       200,\n                                       200);\n\n    \/\/ Poll for getting 1 at the DFI complete bit\n    bool l_poll_return = mss::poll(l_ocmb, l_poll_params, [&l_ocmb, &DFI_COMPLETE_BIT]()->bool\n    {\n        fapi2::buffer<uint64_t> l_data;\n        FAPI_TRY(fapi2::getScom(l_ocmb, TT::FARB6Q_REG, l_data));\n        return l_data.getBit(DFI_COMPLETE_BIT);\n\n    fapi_try_exit:\n        FAPI_ERR(\"mss::poll() hit an error in mss::getScom\");\n        return false;\n    });\n\n    \/\/ following FAPI_TRY to preserve the scom failure in lambda.\n    FAPI_TRY(fapi2::current_err);\n    FAPI_ASSERT(l_poll_return,\n                fapi2::ODY_DRAMINIT_DFI_INIT_TIMEOUT().\n                set_PORT_TARGET(i_target),\n                TARGTIDFORMAT \" poll for DFI init complete timed out\", TARGTID);\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\n} \/\/ ody\n\n} \/\/ mss\n<commit_msg>Adds trace to Odyssey DFI polling functionality<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/chips\/ocmb\/odyssey\/procedures\/hwp\/memory\/lib\/mc\/ody_port.C $ *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2019,2022                        *\/\n\/* [+] International Business Machines Corp.                              *\/\n\/*                                                                        *\/\n\/*                                                                        *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\");        *\/\n\/* you may not use this file except in compliance with the License.       *\/\n\/* You may obtain a copy of the License at                                *\/\n\/*                                                                        *\/\n\/*     http:\/\/www.apache.org\/licenses\/LICENSE-2.0                         *\/\n\/*                                                                        *\/\n\/* Unless required by applicable law or agreed to in writing, software    *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS,      *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or        *\/\n\/* implied. See the License for the specific language governing           *\/\n\/* permissions and limitations under the License.                         *\/\n\/*                                                                        *\/\n\/* IBM_PROLOG_END_TAG                                                     *\/\n\/\/ EKB-Mirror-To: hostboot\n\n\/\/\/\n\/\/\/ @file ody_port.C\n\/\/\/ @brief Odyssey specializations for memory ports\n\/\/\/\n\/\/ *HWP HWP Owner: Louis Stermole <stermole@us.ibm.com>\n\/\/ *HWP HWP Backup: Stephen Glancy <sglancy@us.ibm.com>\n\/\/ *HWP Team: Memory\n\/\/ *HWP Level: 2\n\/\/ *HWP Consumed by: HB:FSP\n\n#include <fapi2.H>\n#include <ody_scom_ody.H>\n#include <lib\/shared\/ody_consts.H>\n#include <lib\/dimm\/ody_rank.H>\n#include <generic\/memory\/lib\/utils\/mc\/gen_mss_port.H>\n#include <generic\/memory\/lib\/utils\/mc\/gen_mss_restore_repairs.H>\n#include <generic\/memory\/lib\/utils\/shared\/mss_generic_consts.H>\n#include <generic\/memory\/lib\/utils\/mc\/gen_mss_port_traits.H>\n#include <generic\/memory\/lib\/utils\/poll.H>\n#include <generic\/memory\/lib\/utils\/find.H>\n#include <generic\/memory\/lib\/utils\/pos.H>\n#include <lib\/mc\/ody_port_traits.H>\n#include <lib\/mc\/ody_port.H>\n#include <lib\/ecc\/ecc_traits_odyssey.H>\n#include <lib\/mcbist\/ody_mcbist_traits.H>\n#include <lib\/mcbist\/ody_maint_cmds.H>\n#include <mss_generic_attribute_getters.H>\n#include <ody_scom_ody_odc.H>\n#include <generic\/memory\/lib\/utils\/mss_generic_check.H>\n\n\nnamespace mss\n{\nconst std::vector<uint8_t> portTraits< mss::mc_type::ODYSSEY >::NON_SPARE_NIBBLES =\n{\n    0,\n    1,\n    2,\n    3,\n    4,\n    5,\n    6,\n    7,\n    8,\n    9,\n    \/\/ Byte 5 contains the spares (if they exist) for mc_type\n    12,\n    13,\n    14,\n    15,\n    16,\n    17,\n    18,\n    19,\n};\n\nconst std::vector<uint8_t> portTraits< mss::mc_type::ODYSSEY >::SPARE_NIBBLES =\n{\n    \/\/ Byte 5 contains the spares (if they exist) for mc_type\n    10,\n    11\n};\n\n\/\/\/\n\/\/\/ @brief Configures the write reorder queue bit - Odyssey specialization\n\/\/\/ @param[in] i_target the target to effect\n\/\/\/ @param[in] i_state to set the bit too\n\/\/\/ @return FAPI2_RC_SUCCSS iff ok\n\/\/\/ @NOTE: Due to RRQ and WRQ being combined into ROQ this function is now NOOP\n\/\/\/\ntemplate< >\nfapi2::ReturnCode configure_wrq<mss::mc_type::ODYSSEY>(\n    const fapi2::Target<fapi2::TARGET_TYPE_OCMB_CHIP>& i_target,\n    const mss::states i_state)\n{\n    return fapi2::FAPI2_RC_SUCCESS;\n}\n\n\/\/\/\n\/\/\/ @brief Configures the read reorder queue bit - Odyssey specialization\n\/\/\/ @param[in] i_target the target to effect\n\/\/\/ @param[in] i_state to set the bit too\n\/\/\/ @return FAPI2_RC_SUCCSS iff ok\n\/\/\/\ntemplate< >\nfapi2::ReturnCode configure_rrq<mss::mc_type::ODYSSEY>(\n    const fapi2::Target<fapi2::TARGET_TYPE_OCMB_CHIP>& i_target,\n    const mss::states i_state)\n{\n    using TT = portTraits<mss::mc_type::ODYSSEY>;\n    fapi2::buffer<uint64_t> l_data;\n\n    \/\/ Gets the reg\n    FAPI_TRY(mss::getScom(i_target, TT::ROQ_REG, l_data), \"%s failed to getScom from ROQ0Q\",\n             mss::c_str(i_target));\n\n    \/\/ Sets the bit\n    l_data.writeBit<TT::ROQ_FIFO_MODE>(i_state == mss::states::ON);\n\n    \/\/ Sets the regs\n    FAPI_TRY(mss::putScom(i_target, TT::ROQ_REG, l_data), \"%s failed to putScom to ROQ0Q\",\n             mss::c_str(i_target));\n\n    return fapi2::FAPI2_RC_SUCCESS;\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\nnamespace ody\n{\n\n\/\/\/\n\/\/\/ @brief Initializes the DFI interface\n\/\/\/ @param[in] i_target the target to check for DFI interface completion\n\/\/\/ @return FAPI2_RC_SUCCSS iff ok\n\/\/\/\nfapi2::ReturnCode poll_for_dfi_init_complete( const fapi2::Target<fapi2::TARGET_TYPE_OCMB_CHIP>& i_target )\n{\n\n    \/\/ For each port...\n    for(const auto& l_port : mss::find_targets<fapi2::TARGET_TYPE_MEM_PORT>(i_target))\n    {\n        \/\/ ... Polls for the DFI init complete\n        FAPI_TRY(poll_for_dfi_init_complete(l_port));\n    }\n\n    FAPI_INF(TARGTIDFORMAT \" DFI polling completed successfully\", TARGTID);\n\n    return fapi2::FAPI2_RC_SUCCESS;\nfapi_try_exit:\n    return fapi2::current_err;\n\n}\n\n\/\/\/\n\/\/\/ @brief Initializes the DFI interface\n\/\/\/ @param[in] i_target the target to check for DFI interface completion\n\/\/\/ @return FAPI2_RC_SUCCSS iff ok\n\/\/\/\nfapi2::ReturnCode poll_for_dfi_init_complete( const fapi2::Target<fapi2::TARGET_TYPE_MEM_PORT>& i_target )\n{\n    using TT = mss::portTraits< mss::mc_type::ODYSSEY >;\n    const auto& l_ocmb = mss::find_target<fapi2::TARGET_TYPE_OCMB_CHIP>(i_target);\n\n    \/\/ Each PHY (aka port target) has its own DFI complete bit\n    \/\/ As such, depending upon the port in question, the DFI complete bit is different\n    const uint64_t DFI_COMPLETE_BIT = mss::relative_pos<mss::mc_type::ODYSSEY, fapi2::TARGET_TYPE_OCMB_CHIP>\n                                      (i_target) == 0 ?\n                                      TT::DFI_INIT_COMPLETE0 : TT::DFI_INIT_COMPLETE1;\n\n\n    fapi2::buffer<uint64_t> l_data;\n    mss::poll_parameters l_poll_params(DELAY_10NS,\n                                       200,\n                                       mss::DELAY_1MS,\n                                       200,\n                                       200);\n\n    \/\/ Poll for getting 1 at the DFI complete bit\n    bool l_poll_return = mss::poll(l_ocmb, l_poll_params, [&l_ocmb, &DFI_COMPLETE_BIT]()->bool\n    {\n        fapi2::buffer<uint64_t> l_data;\n        FAPI_TRY(fapi2::getScom(l_ocmb, TT::FARB6Q_REG, l_data));\n        return l_data.getBit(DFI_COMPLETE_BIT);\n\n    fapi_try_exit:\n        FAPI_ERR(\"mss::poll() hit an error in mss::getScom\");\n        return false;\n    });\n\n    \/\/ following FAPI_TRY to preserve the scom failure in lambda.\n    FAPI_TRY(fapi2::current_err);\n    FAPI_ASSERT(l_poll_return,\n                fapi2::ODY_DRAMINIT_DFI_INIT_TIMEOUT().\n                set_PORT_TARGET(i_target),\n                TARGTIDFORMAT \" poll for DFI init complete timed out\", TARGTID);\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\n} \/\/ ody\n\n} \/\/ mss\n<|endoftext|>"}
{"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/chips\/p10\/procedures\/hwp\/perv\/p10_core_checkstop_handler.C $ *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2018,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\/\/--------------------------------------------------------------------------\n\/\/\n\/\/\/ @file p10_core_checkstop_handler.C\n\/\/\/ @brief Depending on input flag, trun local xstops into system xstops.\n\/\/\/\n\/\/\/ *HWP HW Maintainer: Manish Chowdhary  <manichow@in.ibm.com>\n\/\/\/ *HWP FW Maintainer: Dan Crowell <dcrowell@us.ibm.com>\n\/\/\/ *HWP Consumed by: HB\n\/\/\/\n\n#include \"p10_core_checkstop_handler.H\"\n#include \"p10_scom_c_b.H\"\n#include \"p10_scom_c_d.H\"\n#include \"p10_scom_c_d_unused.H\"\n#include \"p10_scom_c_b_unused.H\"\n\nusing namespace scomt;\nusing namespace scomt::c;\n\nfapi2::ReturnCode p10_core_checkstop_handler(\n    const fapi2::Target<fapi2::TARGET_TYPE_CORE>& i_target_core,\n    bool i_override_restore)\n{\n    FAPI_INF(\"Entering ...\");\n\n    fapi2::buffer<uint64_t> l_action0;\n    fapi2::buffer<uint64_t> l_action1;\n\n    \/\/if true, save off the original action, and turn local xstops into system xstops.\n    if(i_override_restore == CORE_XSTOP_HNDLR__SAVE_AND_ESCALATE)\n    {\n\n        \/\/ Getting ACTION0\n        FAPI_TRY(GET_EC_PC_FIR_CORE_ACTION0(i_target_core, l_action0));\n\n\n        \/\/ Getting ACTION1\n        FAPI_TRY(GET_EC_PC_FIR_CORE_ACTION1(i_target_core, l_action1));\n\n        \/\/ We want to save the original actions into an attribute for a save-restore\n        FAPI_TRY(FAPI_ATTR_SET(fapi2::ATTR_ORIG_FIR_SETTINGS_ACTION0, i_target_core, l_action0),\n                 \"Error from FAPI_ATTR_SET (ATTR_ORIG_FIR_SETTINGS_ACTION0)\");\n\n        FAPI_TRY(FAPI_ATTR_SET(fapi2::ATTR_ORIG_FIR_SETTINGS_ACTION1, i_target_core, l_action1),\n                 \"Error from FAPI_ATTR_SET (ATTR_ORIG_FIR_SETTINGS_ACTION1)\");\n\n        \/\/ For every bit, turn every local xstop (0b11) into system xstops (0b00)\n        uint64_t l_local_xstop = l_action0 & l_action1; \/\/gets bits that are both set to 1\n        l_action0 &= ~l_local_xstop;\n        l_action1 &= ~l_local_xstop;\n    }\n    else\n    {\n        \/\/ We want to pull out the original actions, and restore them\n        FAPI_TRY(FAPI_ATTR_GET(fapi2::ATTR_ORIG_FIR_SETTINGS_ACTION0, i_target_core, l_action0),\n                 \"Error from FAPI_ATTR_GET (ATTR_ORIG_FIR_SETTINGS_ACTION0)\");\n\n        FAPI_TRY(FAPI_ATTR_GET(fapi2::ATTR_ORIG_FIR_SETTINGS_ACTION1, i_target_core, l_action1),\n                 \"Error from FAPI_ATTR_GET (ATTR_ORIG_FIR_SETTINGS_ACTION1)\");\n    }\n\n    \/\/ Save off the current values of actions into the register\n    FAPI_TRY(PREP_EC_PC_FIR_CORE_ACTION0(i_target_core));\n    FAPI_TRY(PUT_EC_PC_FIR_CORE_ACTION0(i_target_core, l_action0));\n    FAPI_TRY(PREP_EC_PC_FIR_CORE_ACTION1(i_target_core));\n    FAPI_TRY(PUT_EC_PC_FIR_CORE_ACTION1(i_target_core, l_action1));\n\n    FAPI_INF(\"Exiting ...\");\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n<commit_msg>Update register header files for dd2<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/chips\/p10\/procedures\/hwp\/perv\/p10_core_checkstop_handler.C $ *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2018,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\/\/--------------------------------------------------------------------------\n\/\/\n\/\/\/ @file p10_core_checkstop_handler.C\n\/\/\/ @brief Depending on input flag, trun local xstops into system xstops.\n\/\/\/\n\/\/\/ *HWP HW Maintainer: Manish Chowdhary  <manichow@in.ibm.com>\n\/\/\/ *HWP FW Maintainer: Dan Crowell <dcrowell@us.ibm.com>\n\/\/\/ *HWP Consumed by: HB\n\/\/\/\n\n#include \"p10_core_checkstop_handler.H\"\n#include \"p10_scom_c_b.H\"\n#include \"p10_scom_c_d.H\"\n\nusing namespace scomt;\nusing namespace scomt::c;\n\nfapi2::ReturnCode p10_core_checkstop_handler(\n    const fapi2::Target<fapi2::TARGET_TYPE_CORE>& i_target_core,\n    bool i_override_restore)\n{\n    FAPI_INF(\"Entering ...\");\n\n    fapi2::buffer<uint64_t> l_action0;\n    fapi2::buffer<uint64_t> l_action1;\n\n    \/\/if true, save off the original action, and turn local xstops into system xstops.\n    if(i_override_restore == CORE_XSTOP_HNDLR__SAVE_AND_ESCALATE)\n    {\n\n        \/\/ Getting ACTION0\n        FAPI_TRY(GET_EC_PC_FIR_CORE_ACTION0(i_target_core, l_action0));\n\n\n        \/\/ Getting ACTION1\n        FAPI_TRY(GET_EC_PC_FIR_CORE_ACTION1(i_target_core, l_action1));\n\n        \/\/ We want to save the original actions into an attribute for a save-restore\n        FAPI_TRY(FAPI_ATTR_SET(fapi2::ATTR_ORIG_FIR_SETTINGS_ACTION0, i_target_core, l_action0),\n                 \"Error from FAPI_ATTR_SET (ATTR_ORIG_FIR_SETTINGS_ACTION0)\");\n\n        FAPI_TRY(FAPI_ATTR_SET(fapi2::ATTR_ORIG_FIR_SETTINGS_ACTION1, i_target_core, l_action1),\n                 \"Error from FAPI_ATTR_SET (ATTR_ORIG_FIR_SETTINGS_ACTION1)\");\n\n        \/\/ For every bit, turn every local xstop (0b11) into system xstops (0b00)\n        uint64_t l_local_xstop = l_action0 & l_action1; \/\/gets bits that are both set to 1\n        l_action0 &= ~l_local_xstop;\n        l_action1 &= ~l_local_xstop;\n    }\n    else\n    {\n        \/\/ We want to pull out the original actions, and restore them\n        FAPI_TRY(FAPI_ATTR_GET(fapi2::ATTR_ORIG_FIR_SETTINGS_ACTION0, i_target_core, l_action0),\n                 \"Error from FAPI_ATTR_GET (ATTR_ORIG_FIR_SETTINGS_ACTION0)\");\n\n        FAPI_TRY(FAPI_ATTR_GET(fapi2::ATTR_ORIG_FIR_SETTINGS_ACTION1, i_target_core, l_action1),\n                 \"Error from FAPI_ATTR_GET (ATTR_ORIG_FIR_SETTINGS_ACTION1)\");\n    }\n\n    \/\/ Save off the current values of actions into the register\n    FAPI_TRY(PREP_EC_PC_FIR_CORE_ACTION0(i_target_core));\n    FAPI_TRY(PUT_EC_PC_FIR_CORE_ACTION0(i_target_core, l_action0));\n    FAPI_TRY(PREP_EC_PC_FIR_CORE_ACTION1(i_target_core));\n    FAPI_TRY(PUT_EC_PC_FIR_CORE_ACTION1(i_target_core, l_action1));\n\n    FAPI_INF(\"Exiting ...\");\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===--- QueryDriverDatabase.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\/\/ Some compiler drivers have implicit search mechanism for system headers.\n\/\/ This compilation database implementation tries to extract that information by\n\/\/ executing the driver in verbose mode. gcc-compatible drivers print something\n\/\/ like:\n\/\/ ....\n\/\/ ....\n\/\/ #include <...> search starts here:\n\/\/  \/usr\/lib\/gcc\/x86_64-linux-gnu\/7\/include\n\/\/  \/usr\/local\/include\n\/\/  \/usr\/lib\/gcc\/x86_64-linux-gnu\/7\/include-fixed\n\/\/  \/usr\/include\/x86_64-linux-gnu\n\/\/  \/usr\/include\n\/\/ End of search list.\n\/\/ ....\n\/\/ ....\n\/\/ This component parses that output and adds each path to command line args\n\/\/ provided by Base, after prepending them with -isystem. Therefore current\n\/\/ implementation would not work with a driver that is not gcc-compatible.\n\/\/\n\/\/ First argument of the command line received from underlying compilation\n\/\/ database is used as compiler driver path. Due to this arbitrary binary\n\/\/ execution, this mechanism is not used by default and only executes binaries\n\/\/ in the paths that are explicitly whitelisted by the user.\n\n#include \"GlobalCompilationDatabase.h\"\n#include \"Logger.h\"\n#include \"Path.h\"\n#include \"Trace.h\"\n#include \"clang\/Driver\/Types.h\"\n#include \"clang\/Tooling\/CompilationDatabase.h\"\n#include \"llvm\/ADT\/DenseMap.h\"\n#include \"llvm\/ADT\/ScopeExit.h\"\n#include \"llvm\/ADT\/SmallString.h\"\n#include \"llvm\/ADT\/StringExtras.h\"\n#include \"llvm\/ADT\/StringRef.h\"\n#include \"llvm\/ADT\/iterator_range.h\"\n#include \"llvm\/Support\/FileSystem.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include \"llvm\/Support\/Path.h\"\n#include \"llvm\/Support\/Program.h\"\n#include \"llvm\/Support\/Regex.h\"\n#include \"llvm\/Support\/ScopedPrinter.h\"\n#include <algorithm>\n#include <map>\n#include <string>\n#include <vector>\n\nnamespace clang {\nnamespace clangd {\nnamespace {\n\nstd::vector<std::string> parseDriverOutput(llvm::StringRef Output) {\n  std::vector<std::string> SystemIncludes;\n  constexpr char const *SIS = \"#include <...> search starts here:\";\n  constexpr char const *SIE = \"End of search list.\";\n  llvm::SmallVector<llvm::StringRef, 8> Lines;\n  Output.split(Lines, '\\n', \/*MaxSplit=*\/-1, \/*KeepEmpty=*\/false);\n\n  auto StartIt =\n      std::find_if(Lines.begin(), Lines.end(),\n                   [SIS](llvm::StringRef Line) { return Line.trim() == SIS; });\n  if (StartIt == Lines.end()) {\n    elog(\"System include extraction: start marker not found: {0}\", Output);\n    return {};\n  }\n  ++StartIt;\n  const auto EndIt = std::find(StartIt, Lines.end(), SIE);\n  if (EndIt == Lines.end()) {\n    elog(\"System include extraction: end marker missing: {0}\", Output);\n    return {};\n  }\n\n  for (llvm::StringRef Line : llvm::make_range(StartIt, EndIt)) {\n    SystemIncludes.push_back(Line.trim().str());\n    vlog(\"System include extraction: adding {0}\", Line);\n  }\n  return SystemIncludes;\n}\n\nstd::vector<std::string> extractSystemIncludes(PathRef Driver,\n                                               llvm::StringRef Lang,\n                                               llvm::Regex &QueryDriverRegex) {\n  trace::Span Tracer(\"Extract system includes\");\n  SPAN_ATTACH(Tracer, \"driver\", Driver);\n  SPAN_ATTACH(Tracer, \"lang\", Lang);\n\n  if (!QueryDriverRegex.match(Driver)) {\n    vlog(\"System include extraction: not whitelisted driver {0}\", Driver);\n    return {};\n  }\n\n  if (!llvm::sys::fs::exists(Driver)) {\n    elog(\"System include extraction: {0} does not exist.\", Driver);\n    return {};\n  }\n  if (!llvm::sys::fs::can_execute(Driver)) {\n    elog(\"System include extraction: {0} is not executable.\", Driver);\n    return {};\n  }\n\n  llvm::SmallString<128> StdErrPath;\n  if (auto EC = llvm::sys::fs::createTemporaryFile(\"system-includes\", \"clangd\",\n                                                   StdErrPath)) {\n    elog(\"System include extraction: failed to create temporary file with \"\n         \"error {0}\",\n         EC.message());\n    return {};\n  }\n  auto CleanUp = llvm::make_scope_exit(\n      [&StdErrPath]() { llvm::sys::fs::remove(StdErrPath); });\n\n  llvm::Optional<llvm::StringRef> Redirects[] = {\n      {\"\"}, {\"\"}, llvm::StringRef(StdErrPath)};\n\n  \/\/ Should we also preserve flags like \"-sysroot\", \"-nostdinc\" ?\n  const llvm::StringRef Args[] = {Driver, \"-E\", \"-x\", Lang, \"-\", \"-v\"};\n\n  if (int RC = llvm::sys::ExecuteAndWait(Driver, Args, \/*Env=*\/llvm::None,\n                                         Redirects)) {\n    elog(\"System include extraction: driver execution failed with return code: \"\n         \"{0}\",\n         llvm::to_string(RC));\n    return {};\n  }\n\n  auto BufOrError = llvm::MemoryBuffer::getFile(StdErrPath);\n  if (!BufOrError) {\n    elog(\"System include extraction: failed to read {0} with error {1}\",\n         StdErrPath, BufOrError.getError().message());\n    return {};\n  }\n\n  auto Includes = parseDriverOutput(BufOrError->get()->getBuffer());\n  log(\"System include extractor: succesfully executed {0}, got includes: \"\n      \"\\\"{1}\\\"\",\n      Driver, llvm::join(Includes, \", \"));\n  return Includes;\n}\n\ntooling::CompileCommand &\naddSystemIncludes(tooling::CompileCommand &Cmd,\n                  llvm::ArrayRef<std::string> SystemIncludes) {\n  for (llvm::StringRef Include : SystemIncludes) {\n    \/\/ FIXME(kadircet): This doesn't work when we have \"--driver-mode=cl\"\n    Cmd.CommandLine.push_back(\"-isystem\");\n    Cmd.CommandLine.push_back(Include.str());\n  }\n  return Cmd;\n}\n\n\/\/\/ Converts a glob containing only ** or * into a regex.\nstd::string convertGlobToRegex(llvm::StringRef Glob) {\n  std::string RegText;\n  llvm::raw_string_ostream RegStream(RegText);\n  RegStream << '^';\n  for (size_t I = 0, E = Glob.size(); I < E; ++I) {\n    if (Glob[I] == '*') {\n      if (I + 1 < E && Glob[I + 1] == '*') {\n        \/\/ Double star, accept any sequence.\n        RegStream << \".*\";\n        \/\/ Also skip the second star.\n        ++I;\n      } else {\n        \/\/ Single star, accept any sequence without a slash.\n        RegStream << \"[^\/]*\";\n      }\n    } else {\n      RegStream << llvm::Regex::escape(Glob.substr(I, 1));\n    }\n  }\n  RegStream << '$';\n  RegStream.flush();\n  return RegText;\n}\n\n\/\/\/ Converts a glob containing only ** or * into a regex.\nllvm::Regex convertGlobsToRegex(llvm::ArrayRef<std::string> Globs) {\n  assert(!Globs.empty() && \"Globs cannot be empty!\");\n  std::vector<std::string> RegTexts;\n  RegTexts.reserve(Globs.size());\n  for (llvm::StringRef Glob : Globs)\n    RegTexts.push_back(convertGlobToRegex(Glob));\n\n  llvm::Regex Reg(llvm::join(RegTexts, \"|\"));\n  assert(Reg.isValid(RegTexts.front()) &&\n         \"Created an invalid regex from globs\");\n  return Reg;\n}\n\n\/\/\/ Extracts system includes from a trusted driver by parsing the output of\n\/\/\/ include search path and appends them to the commands coming from underlying\n\/\/\/ compilation database.\nclass QueryDriverDatabase : public GlobalCompilationDatabase {\npublic:\n  QueryDriverDatabase(llvm::ArrayRef<std::string> QueryDriverGlobs,\n                      std::unique_ptr<GlobalCompilationDatabase> Base)\n      : QueryDriverRegex(convertGlobsToRegex(QueryDriverGlobs)),\n        Base(std::move(Base)) {\n    assert(this->Base);\n    BaseChanged =\n        this->Base->watch([this](const std::vector<std::string> &Changes) {\n          OnCommandChanged.broadcast(Changes);\n        });\n  }\n\n  llvm::Optional<tooling::CompileCommand>\n  getCompileCommand(PathRef File) const override {\n    auto Cmd = Base->getCompileCommand(File);\n    if (!Cmd || Cmd->CommandLine.empty())\n      return Cmd;\n\n    llvm::StringRef Lang;\n    for (size_t I = 0, E = Cmd->CommandLine.size(); I < E; ++I) {\n      llvm::StringRef Arg = Cmd->CommandLine[I];\n      if (Arg == \"-x\" && I + 1 < E)\n        Lang = Cmd->CommandLine[I + 1];\n      else if (Arg.startswith(\"-x\"))\n        Lang = Arg.drop_front(2).trim();\n    }\n    if (Lang.empty()) {\n      llvm::StringRef Ext = llvm::sys::path::extension(File).trim('.');\n      auto Type = driver::types::lookupTypeForExtension(Ext);\n      if (Type == driver::types::TY_INVALID) {\n        elog(\"System include extraction: invalid file type for {0}\", Ext);\n        return {};\n      }\n      Lang = driver::types::getTypeName(Type);\n    }\n\n    llvm::SmallString<128> Driver(Cmd->CommandLine.front());\n    llvm::sys::fs::make_absolute(Cmd->Directory, Driver);\n    auto Key = std::make_pair(Driver.str(), Lang);\n\n    std::vector<std::string> SystemIncludes;\n    {\n      std::lock_guard<std::mutex> Lock(Mu);\n\n      auto It = DriverToIncludesCache.find(Key);\n      if (It != DriverToIncludesCache.end())\n        SystemIncludes = It->second;\n      else\n        DriverToIncludesCache[Key] = SystemIncludes =\n            extractSystemIncludes(Key.first, Key.second, QueryDriverRegex);\n    }\n\n    return addSystemIncludes(*Cmd, SystemIncludes);\n  }\n\n  llvm::Optional<ProjectInfo> getProjectInfo(PathRef File) const override {\n    return Base->getProjectInfo(File);\n  }\n\nprivate:\n  mutable std::mutex Mu;\n  \/\/ Caches includes extracted from a driver.\n  mutable std::map<std::pair<std::string, std::string>,\n                   std::vector<std::string>>\n      DriverToIncludesCache;\n  mutable llvm::Regex QueryDriverRegex;\n\n  std::unique_ptr<GlobalCompilationDatabase> Base;\n  CommandChanged::Subscription BaseChanged;\n};\n} \/\/ namespace\n\nstd::unique_ptr<GlobalCompilationDatabase>\ngetQueryDriverDatabase(llvm::ArrayRef<std::string> QueryDriverGlobs,\n                       std::unique_ptr<GlobalCompilationDatabase> Base) {\n  assert(Base && \"Null base to SystemIncludeExtractor\");\n  if (QueryDriverGlobs.empty())\n    return Base;\n  return llvm::make_unique<QueryDriverDatabase>(QueryDriverGlobs,\n                                                std::move(Base));\n}\n\n} \/\/ namespace clangd\n} \/\/ namespace clang\n<commit_msg>[clangd] Fix Fix -Wunused-lambda-capture after r366339<commit_after>\/\/===--- QueryDriverDatabase.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\/\/ Some compiler drivers have implicit search mechanism for system headers.\n\/\/ This compilation database implementation tries to extract that information by\n\/\/ executing the driver in verbose mode. gcc-compatible drivers print something\n\/\/ like:\n\/\/ ....\n\/\/ ....\n\/\/ #include <...> search starts here:\n\/\/  \/usr\/lib\/gcc\/x86_64-linux-gnu\/7\/include\n\/\/  \/usr\/local\/include\n\/\/  \/usr\/lib\/gcc\/x86_64-linux-gnu\/7\/include-fixed\n\/\/  \/usr\/include\/x86_64-linux-gnu\n\/\/  \/usr\/include\n\/\/ End of search list.\n\/\/ ....\n\/\/ ....\n\/\/ This component parses that output and adds each path to command line args\n\/\/ provided by Base, after prepending them with -isystem. Therefore current\n\/\/ implementation would not work with a driver that is not gcc-compatible.\n\/\/\n\/\/ First argument of the command line received from underlying compilation\n\/\/ database is used as compiler driver path. Due to this arbitrary binary\n\/\/ execution, this mechanism is not used by default and only executes binaries\n\/\/ in the paths that are explicitly whitelisted by the user.\n\n#include \"GlobalCompilationDatabase.h\"\n#include \"Logger.h\"\n#include \"Path.h\"\n#include \"Trace.h\"\n#include \"clang\/Driver\/Types.h\"\n#include \"clang\/Tooling\/CompilationDatabase.h\"\n#include \"llvm\/ADT\/DenseMap.h\"\n#include \"llvm\/ADT\/ScopeExit.h\"\n#include \"llvm\/ADT\/SmallString.h\"\n#include \"llvm\/ADT\/StringExtras.h\"\n#include \"llvm\/ADT\/StringRef.h\"\n#include \"llvm\/ADT\/iterator_range.h\"\n#include \"llvm\/Support\/FileSystem.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include \"llvm\/Support\/Path.h\"\n#include \"llvm\/Support\/Program.h\"\n#include \"llvm\/Support\/Regex.h\"\n#include \"llvm\/Support\/ScopedPrinter.h\"\n#include <algorithm>\n#include <map>\n#include <string>\n#include <vector>\n\nnamespace clang {\nnamespace clangd {\nnamespace {\n\nstd::vector<std::string> parseDriverOutput(llvm::StringRef Output) {\n  std::vector<std::string> SystemIncludes;\n  const char SIS[] = \"#include <...> search starts here:\";\n  constexpr char const *SIE = \"End of search list.\";\n  llvm::SmallVector<llvm::StringRef, 8> Lines;\n  Output.split(Lines, '\\n', \/*MaxSplit=*\/-1, \/*KeepEmpty=*\/false);\n\n  auto StartIt = llvm::find_if(\n      Lines, [SIS](llvm::StringRef Line) { return Line.trim() == SIS; });\n  if (StartIt == Lines.end()) {\n    elog(\"System include extraction: start marker not found: {0}\", Output);\n    return {};\n  }\n  ++StartIt;\n  const auto EndIt = std::find(StartIt, Lines.end(), SIE);\n  if (EndIt == Lines.end()) {\n    elog(\"System include extraction: end marker missing: {0}\", Output);\n    return {};\n  }\n\n  for (llvm::StringRef Line : llvm::make_range(StartIt, EndIt)) {\n    SystemIncludes.push_back(Line.trim().str());\n    vlog(\"System include extraction: adding {0}\", Line);\n  }\n  return SystemIncludes;\n}\n\nstd::vector<std::string> extractSystemIncludes(PathRef Driver,\n                                               llvm::StringRef Lang,\n                                               llvm::Regex &QueryDriverRegex) {\n  trace::Span Tracer(\"Extract system includes\");\n  SPAN_ATTACH(Tracer, \"driver\", Driver);\n  SPAN_ATTACH(Tracer, \"lang\", Lang);\n\n  if (!QueryDriverRegex.match(Driver)) {\n    vlog(\"System include extraction: not whitelisted driver {0}\", Driver);\n    return {};\n  }\n\n  if (!llvm::sys::fs::exists(Driver)) {\n    elog(\"System include extraction: {0} does not exist.\", Driver);\n    return {};\n  }\n  if (!llvm::sys::fs::can_execute(Driver)) {\n    elog(\"System include extraction: {0} is not executable.\", Driver);\n    return {};\n  }\n\n  llvm::SmallString<128> StdErrPath;\n  if (auto EC = llvm::sys::fs::createTemporaryFile(\"system-includes\", \"clangd\",\n                                                   StdErrPath)) {\n    elog(\"System include extraction: failed to create temporary file with \"\n         \"error {0}\",\n         EC.message());\n    return {};\n  }\n  auto CleanUp = llvm::make_scope_exit(\n      [&StdErrPath]() { llvm::sys::fs::remove(StdErrPath); });\n\n  llvm::Optional<llvm::StringRef> Redirects[] = {\n      {\"\"}, {\"\"}, llvm::StringRef(StdErrPath)};\n\n  \/\/ Should we also preserve flags like \"-sysroot\", \"-nostdinc\" ?\n  const llvm::StringRef Args[] = {Driver, \"-E\", \"-x\", Lang, \"-\", \"-v\"};\n\n  if (int RC = llvm::sys::ExecuteAndWait(Driver, Args, \/*Env=*\/llvm::None,\n                                         Redirects)) {\n    elog(\"System include extraction: driver execution failed with return code: \"\n         \"{0}\",\n         llvm::to_string(RC));\n    return {};\n  }\n\n  auto BufOrError = llvm::MemoryBuffer::getFile(StdErrPath);\n  if (!BufOrError) {\n    elog(\"System include extraction: failed to read {0} with error {1}\",\n         StdErrPath, BufOrError.getError().message());\n    return {};\n  }\n\n  auto Includes = parseDriverOutput(BufOrError->get()->getBuffer());\n  log(\"System include extractor: succesfully executed {0}, got includes: \"\n      \"\\\"{1}\\\"\",\n      Driver, llvm::join(Includes, \", \"));\n  return Includes;\n}\n\ntooling::CompileCommand &\naddSystemIncludes(tooling::CompileCommand &Cmd,\n                  llvm::ArrayRef<std::string> SystemIncludes) {\n  for (llvm::StringRef Include : SystemIncludes) {\n    \/\/ FIXME(kadircet): This doesn't work when we have \"--driver-mode=cl\"\n    Cmd.CommandLine.push_back(\"-isystem\");\n    Cmd.CommandLine.push_back(Include.str());\n  }\n  return Cmd;\n}\n\n\/\/\/ Converts a glob containing only ** or * into a regex.\nstd::string convertGlobToRegex(llvm::StringRef Glob) {\n  std::string RegText;\n  llvm::raw_string_ostream RegStream(RegText);\n  RegStream << '^';\n  for (size_t I = 0, E = Glob.size(); I < E; ++I) {\n    if (Glob[I] == '*') {\n      if (I + 1 < E && Glob[I + 1] == '*') {\n        \/\/ Double star, accept any sequence.\n        RegStream << \".*\";\n        \/\/ Also skip the second star.\n        ++I;\n      } else {\n        \/\/ Single star, accept any sequence without a slash.\n        RegStream << \"[^\/]*\";\n      }\n    } else {\n      RegStream << llvm::Regex::escape(Glob.substr(I, 1));\n    }\n  }\n  RegStream << '$';\n  RegStream.flush();\n  return RegText;\n}\n\n\/\/\/ Converts a glob containing only ** or * into a regex.\nllvm::Regex convertGlobsToRegex(llvm::ArrayRef<std::string> Globs) {\n  assert(!Globs.empty() && \"Globs cannot be empty!\");\n  std::vector<std::string> RegTexts;\n  RegTexts.reserve(Globs.size());\n  for (llvm::StringRef Glob : Globs)\n    RegTexts.push_back(convertGlobToRegex(Glob));\n\n  llvm::Regex Reg(llvm::join(RegTexts, \"|\"));\n  assert(Reg.isValid(RegTexts.front()) &&\n         \"Created an invalid regex from globs\");\n  return Reg;\n}\n\n\/\/\/ Extracts system includes from a trusted driver by parsing the output of\n\/\/\/ include search path and appends them to the commands coming from underlying\n\/\/\/ compilation database.\nclass QueryDriverDatabase : public GlobalCompilationDatabase {\npublic:\n  QueryDriverDatabase(llvm::ArrayRef<std::string> QueryDriverGlobs,\n                      std::unique_ptr<GlobalCompilationDatabase> Base)\n      : QueryDriverRegex(convertGlobsToRegex(QueryDriverGlobs)),\n        Base(std::move(Base)) {\n    assert(this->Base);\n    BaseChanged =\n        this->Base->watch([this](const std::vector<std::string> &Changes) {\n          OnCommandChanged.broadcast(Changes);\n        });\n  }\n\n  llvm::Optional<tooling::CompileCommand>\n  getCompileCommand(PathRef File) const override {\n    auto Cmd = Base->getCompileCommand(File);\n    if (!Cmd || Cmd->CommandLine.empty())\n      return Cmd;\n\n    llvm::StringRef Lang;\n    for (size_t I = 0, E = Cmd->CommandLine.size(); I < E; ++I) {\n      llvm::StringRef Arg = Cmd->CommandLine[I];\n      if (Arg == \"-x\" && I + 1 < E)\n        Lang = Cmd->CommandLine[I + 1];\n      else if (Arg.startswith(\"-x\"))\n        Lang = Arg.drop_front(2).trim();\n    }\n    if (Lang.empty()) {\n      llvm::StringRef Ext = llvm::sys::path::extension(File).trim('.');\n      auto Type = driver::types::lookupTypeForExtension(Ext);\n      if (Type == driver::types::TY_INVALID) {\n        elog(\"System include extraction: invalid file type for {0}\", Ext);\n        return {};\n      }\n      Lang = driver::types::getTypeName(Type);\n    }\n\n    llvm::SmallString<128> Driver(Cmd->CommandLine.front());\n    llvm::sys::fs::make_absolute(Cmd->Directory, Driver);\n    auto Key = std::make_pair(Driver.str(), Lang);\n\n    std::vector<std::string> SystemIncludes;\n    {\n      std::lock_guard<std::mutex> Lock(Mu);\n\n      auto It = DriverToIncludesCache.find(Key);\n      if (It != DriverToIncludesCache.end())\n        SystemIncludes = It->second;\n      else\n        DriverToIncludesCache[Key] = SystemIncludes =\n            extractSystemIncludes(Key.first, Key.second, QueryDriverRegex);\n    }\n\n    return addSystemIncludes(*Cmd, SystemIncludes);\n  }\n\n  llvm::Optional<ProjectInfo> getProjectInfo(PathRef File) const override {\n    return Base->getProjectInfo(File);\n  }\n\nprivate:\n  mutable std::mutex Mu;\n  \/\/ Caches includes extracted from a driver.\n  mutable std::map<std::pair<std::string, std::string>,\n                   std::vector<std::string>>\n      DriverToIncludesCache;\n  mutable llvm::Regex QueryDriverRegex;\n\n  std::unique_ptr<GlobalCompilationDatabase> Base;\n  CommandChanged::Subscription BaseChanged;\n};\n} \/\/ namespace\n\nstd::unique_ptr<GlobalCompilationDatabase>\ngetQueryDriverDatabase(llvm::ArrayRef<std::string> QueryDriverGlobs,\n                       std::unique_ptr<GlobalCompilationDatabase> Base) {\n  assert(Base && \"Null base to SystemIncludeExtractor\");\n  if (QueryDriverGlobs.empty())\n    return Base;\n  return llvm::make_unique<QueryDriverDatabase>(QueryDriverGlobs,\n                                                std::move(Base));\n}\n\n} \/\/ namespace clangd\n} \/\/ namespace clang\n<|endoftext|>"}
{"text":"<commit_before>\/\/Copyright (c) 2018 Ultimaker B.V.\n\/\/CuraEngine is released under the terms of the AGPLv3 or higher.\n\n#include \"linearAlg2D.h\"\n\n#include <cmath> \/\/ atan2\n#include <cassert>\n#include <algorithm> \/\/ swap\n\n#include \"IntPoint.h\" \/\/ dot\n\nnamespace cura \n{\n\nfloat LinearAlg2D::getAngleLeft(const Point& a, const Point& b, const Point& c)\n{\n    const Point ba = a - b;\n    const Point bc = c - b;\n    const coord_t dott = dot(ba, bc); \/\/ dot product\n    const coord_t det = ba.X * bc.Y - ba.Y * bc.X; \/\/ determinant\n    const float angle = -atan2(det, dott); \/\/ from -pi to pi\n    if (angle >= 0)\n    {\n        return angle;\n    }\n    else \n    {\n        return M_PI * 2 + angle;\n    }\n}\n\n\nbool LinearAlg2D::getPointOnLineWithDist(const Point& p, const Point& a, const Point& b, const coord_t dist, Point& result)\n{\n    \/\/         result\n    \/\/         v\n    \/\/   b<----r---a.......x\n    \/\/          '-.        :\n    \/\/              '-.    :\n    \/\/                  '-.p\n    const Point ab = b - a;\n    const coord_t ab_size = vSize(ab);\n    const Point ap = p - a;\n    const coord_t ax_size = (ab_size < 50)? dot(normal(ab, 1000), ap) \/ 1000 : dot(ab, ap) \/ ab_size;\n    const coord_t ap_size2 = vSize2(ap);\n    const coord_t px_size = sqrt(std::max(coord_t(0), ap_size2 - ax_size * ax_size));\n    if (px_size > dist)\n    {\n        return false;\n    }\n    const coord_t xr_size = sqrt(dist * dist - px_size * px_size);\n    if (ax_size <= 0)\n    { \/\/ x lies before ab\n        const coord_t ar_size = xr_size + ax_size;\n        if (ar_size < 0 || ar_size > ab_size)\n        { \/\/ r lies outisde of ab\n            return false;\n        }\n        else\n        {\n            result = a + normal(ab, ar_size);\n            return true;\n        }\n    }\n    else if (ax_size >= ab_size)\n    { \/\/ x lies after ab\n        \/\/         result\n        \/\/         v\n        \/\/   a-----r-->b.......x\n        \/\/          '-.        :\n        \/\/              '-.    :\n        \/\/                  '-.p\n        const coord_t ar_size = ax_size - xr_size;\n        if (ar_size < 0 || ar_size > ab_size)\n        { \/\/ r lies outisde of ab\n            return false;\n        }\n        else\n        {\n            result = a + normal(ab, ar_size);\n            return true;\n        }\n    }\n    else \/\/ ax_size > 0 && ax_size < ab_size\n    { \/\/ x lies on ab\n        \/\/            result is either or\n        \/\/         v                       v\n        \/\/   a-----r-----------x-----------r----->b\n        \/\/          '-.        :        .-'\n        \/\/              '-.    :    .-'\n        \/\/                  '-.p.-'\n        \/\/           or there is not result:\n        \/\/         v                       v\n        \/\/         r   a-------x---->b     r\n        \/\/          '-.        :        .-'\n        \/\/              '-.    :    .-'\n        \/\/                  '-.p.-'\n        \/\/ try r in both directions\n        const coord_t ar1_size = ax_size - xr_size;\n        if (ar1_size >= 0)\n        {\n            result = a + normal(ab, ar1_size);\n            return true;\n        }\n        const coord_t ar2_size = ax_size + xr_size;\n        if (ar2_size < ab_size)\n        {\n            result = a + normal(ab, ar2_size);\n            return true;\n        }\n        return false;\n    }\n}\n\n\nstd::pair<Point, Point> LinearAlg2D::getClosestConnection(Point a1, Point a2, Point b1, Point b2)\n{\n    Point b1_on_a = getClosestOnLineSegment(b1, a1, a2);\n    coord_t b1_on_a_dist2 = vSize2(b1_on_a - b1);\n    Point b2_on_a = getClosestOnLineSegment(b2, a1, a2);\n    coord_t b2_on_a_dist2 = vSize2(b2_on_a - b2);\n    Point a1_on_b = getClosestOnLineSegment(a1, b1, b2);\n    coord_t a1_on_b_dist2 = vSize2(a1_on_b - a1);\n    Point a2_on_b = getClosestOnLineSegment(a1, b1, b2);\n    coord_t a2_on_b_dist2 = vSize2(a2_on_b - a2);\n    if (b1_on_a_dist2 < b2_on_a_dist2 && b1_on_a_dist2 < a1_on_b_dist2 && b1_on_a_dist2 < a2_on_b_dist2)\n    {\n        return std::make_pair(b1_on_a, b1);\n    }\n    else if (b2_on_a_dist2 < a1_on_b_dist2 && b2_on_a_dist2 < a2_on_b_dist2)\n    {\n        return std::make_pair(b2_on_a, b2);\n    }\n    else if (a1_on_b_dist2 < a2_on_b_dist2)\n    {\n        return std::make_pair(a1, a1_on_b);\n    }\n    else\n    {\n        return std::make_pair(a2, a2_on_b);\n    }\n}\n\nbool LinearAlg2D::lineSegmentsCollide(const Point& a_from_transformed, const Point& a_to_transformed, Point b_from_transformed, Point b_to_transformed)\n{\n    assert(std::abs(a_from_transformed.Y - a_to_transformed.Y) < 2 && \"line a is supposed to be transformed to be aligned with the X axis!\");\n    assert(a_from_transformed.X - 2 <= a_to_transformed.X && \"line a is supposed to be aligned with X axis in positive direction!\");\n    if ((b_from_transformed.Y >= a_from_transformed.Y && b_to_transformed.Y <= a_from_transformed.Y) || (b_to_transformed.Y >= a_from_transformed.Y && b_from_transformed.Y <= a_from_transformed.Y))\n    {\n        if(b_to_transformed.Y == b_from_transformed.Y)\n        {\n            if (b_to_transformed.X < b_from_transformed.X)\n            {\n                std::swap(b_to_transformed.X, b_from_transformed.X);\n            }\n            if (b_from_transformed.X > a_to_transformed.X)\n            {\n                return false;\n            }\n            if (b_to_transformed.X < a_from_transformed.X)\n            {\n                return false;\n            }\n            return true;\n        }\n        else\n        {\n            const coord_t x = b_from_transformed.X + (b_to_transformed.X - b_from_transformed.X) * (a_from_transformed.Y - b_from_transformed.Y) \/ (b_to_transformed.Y - b_from_transformed.Y);\n            if (x >= a_from_transformed.X && x <= a_to_transformed.X)\n            {\n                return true;\n            }\n        }\n    }\n    return false;\n}\n\ncoord_t LinearAlg2D::getDist2FromLine(const Point& p, const Point& a, const Point& b)\n{\n    \/\/  x.......a------------b\n    \/\/  :\n    \/\/  :\n    \/\/  p\n    \/\/ return px_size\n    assert(a != b);  \/\/ the line can't be a point\n    const Point vab = b - a;\n    const Point vap = p - a;\n    const coord_t dott = dot(vab, vap);\n    const coord_t ax_size2 = dott * dott \/ vSize2(vab);\n    const coord_t ap_size2 = vSize2(vap);\n    const coord_t px_size2 = std::max(coord_t(0), ap_size2 - ax_size2);\n    return px_size2;\n}\n\n} \/\/ namespace cura\n<commit_msg>Allow lines of length 0<commit_after>\/\/Copyright (c) 2019 Ultimaker B.V.\n\/\/CuraEngine is released under the terms of the AGPLv3 or higher.\n\n#include \"linearAlg2D.h\"\n\n#include <cmath> \/\/ atan2\n#include <cassert>\n#include <algorithm> \/\/ swap\n\n#include \"IntPoint.h\" \/\/ dot\n\nnamespace cura \n{\n\nfloat LinearAlg2D::getAngleLeft(const Point& a, const Point& b, const Point& c)\n{\n    const Point ba = a - b;\n    const Point bc = c - b;\n    const coord_t dott = dot(ba, bc); \/\/ dot product\n    const coord_t det = ba.X * bc.Y - ba.Y * bc.X; \/\/ determinant\n    const float angle = -atan2(det, dott); \/\/ from -pi to pi\n    if (angle >= 0)\n    {\n        return angle;\n    }\n    else \n    {\n        return M_PI * 2 + angle;\n    }\n}\n\n\nbool LinearAlg2D::getPointOnLineWithDist(const Point& p, const Point& a, const Point& b, const coord_t dist, Point& result)\n{\n    \/\/         result\n    \/\/         v\n    \/\/   b<----r---a.......x\n    \/\/          '-.        :\n    \/\/              '-.    :\n    \/\/                  '-.p\n    const Point ab = b - a;\n    const coord_t ab_size = vSize(ab);\n    const Point ap = p - a;\n    const coord_t ax_size = (ab_size < 50)? dot(normal(ab, 1000), ap) \/ 1000 : dot(ab, ap) \/ ab_size;\n    const coord_t ap_size2 = vSize2(ap);\n    const coord_t px_size = sqrt(std::max(coord_t(0), ap_size2 - ax_size * ax_size));\n    if (px_size > dist)\n    {\n        return false;\n    }\n    const coord_t xr_size = sqrt(dist * dist - px_size * px_size);\n    if (ax_size <= 0)\n    { \/\/ x lies before ab\n        const coord_t ar_size = xr_size + ax_size;\n        if (ar_size < 0 || ar_size > ab_size)\n        { \/\/ r lies outisde of ab\n            return false;\n        }\n        else\n        {\n            result = a + normal(ab, ar_size);\n            return true;\n        }\n    }\n    else if (ax_size >= ab_size)\n    { \/\/ x lies after ab\n        \/\/         result\n        \/\/         v\n        \/\/   a-----r-->b.......x\n        \/\/          '-.        :\n        \/\/              '-.    :\n        \/\/                  '-.p\n        const coord_t ar_size = ax_size - xr_size;\n        if (ar_size < 0 || ar_size > ab_size)\n        { \/\/ r lies outisde of ab\n            return false;\n        }\n        else\n        {\n            result = a + normal(ab, ar_size);\n            return true;\n        }\n    }\n    else \/\/ ax_size > 0 && ax_size < ab_size\n    { \/\/ x lies on ab\n        \/\/            result is either or\n        \/\/         v                       v\n        \/\/   a-----r-----------x-----------r----->b\n        \/\/          '-.        :        .-'\n        \/\/              '-.    :    .-'\n        \/\/                  '-.p.-'\n        \/\/           or there is not result:\n        \/\/         v                       v\n        \/\/         r   a-------x---->b     r\n        \/\/          '-.        :        .-'\n        \/\/              '-.    :    .-'\n        \/\/                  '-.p.-'\n        \/\/ try r in both directions\n        const coord_t ar1_size = ax_size - xr_size;\n        if (ar1_size >= 0)\n        {\n            result = a + normal(ab, ar1_size);\n            return true;\n        }\n        const coord_t ar2_size = ax_size + xr_size;\n        if (ar2_size < ab_size)\n        {\n            result = a + normal(ab, ar2_size);\n            return true;\n        }\n        return false;\n    }\n}\n\n\nstd::pair<Point, Point> LinearAlg2D::getClosestConnection(Point a1, Point a2, Point b1, Point b2)\n{\n    Point b1_on_a = getClosestOnLineSegment(b1, a1, a2);\n    coord_t b1_on_a_dist2 = vSize2(b1_on_a - b1);\n    Point b2_on_a = getClosestOnLineSegment(b2, a1, a2);\n    coord_t b2_on_a_dist2 = vSize2(b2_on_a - b2);\n    Point a1_on_b = getClosestOnLineSegment(a1, b1, b2);\n    coord_t a1_on_b_dist2 = vSize2(a1_on_b - a1);\n    Point a2_on_b = getClosestOnLineSegment(a1, b1, b2);\n    coord_t a2_on_b_dist2 = vSize2(a2_on_b - a2);\n    if (b1_on_a_dist2 < b2_on_a_dist2 && b1_on_a_dist2 < a1_on_b_dist2 && b1_on_a_dist2 < a2_on_b_dist2)\n    {\n        return std::make_pair(b1_on_a, b1);\n    }\n    else if (b2_on_a_dist2 < a1_on_b_dist2 && b2_on_a_dist2 < a2_on_b_dist2)\n    {\n        return std::make_pair(b2_on_a, b2);\n    }\n    else if (a1_on_b_dist2 < a2_on_b_dist2)\n    {\n        return std::make_pair(a1, a1_on_b);\n    }\n    else\n    {\n        return std::make_pair(a2, a2_on_b);\n    }\n}\n\nbool LinearAlg2D::lineSegmentsCollide(const Point& a_from_transformed, const Point& a_to_transformed, Point b_from_transformed, Point b_to_transformed)\n{\n    assert(std::abs(a_from_transformed.Y - a_to_transformed.Y) < 2 && \"line a is supposed to be transformed to be aligned with the X axis!\");\n    assert(a_from_transformed.X - 2 <= a_to_transformed.X && \"line a is supposed to be aligned with X axis in positive direction!\");\n    if ((b_from_transformed.Y >= a_from_transformed.Y && b_to_transformed.Y <= a_from_transformed.Y) || (b_to_transformed.Y >= a_from_transformed.Y && b_from_transformed.Y <= a_from_transformed.Y))\n    {\n        if(b_to_transformed.Y == b_from_transformed.Y)\n        {\n            if (b_to_transformed.X < b_from_transformed.X)\n            {\n                std::swap(b_to_transformed.X, b_from_transformed.X);\n            }\n            if (b_from_transformed.X > a_to_transformed.X)\n            {\n                return false;\n            }\n            if (b_to_transformed.X < a_from_transformed.X)\n            {\n                return false;\n            }\n            return true;\n        }\n        else\n        {\n            const coord_t x = b_from_transformed.X + (b_to_transformed.X - b_from_transformed.X) * (a_from_transformed.Y - b_from_transformed.Y) \/ (b_to_transformed.Y - b_from_transformed.Y);\n            if (x >= a_from_transformed.X && x <= a_to_transformed.X)\n            {\n                return true;\n            }\n        }\n    }\n    return false;\n}\n\ncoord_t LinearAlg2D::getDist2FromLine(const Point& p, const Point& a, const Point& b)\n{\n    \/\/  x.......a------------b\n    \/\/  :\n    \/\/  :\n    \/\/  p\n    \/\/ return px_size\n    const Point vab = b - a;\n    const Point vap = p - a;\n    const coord_t ab_size2 = vSize2(vab);\n    const coord_t ap_size2 = vSize2(vap);\n    if(ab_size2 == 0) \/\/Line of 0 length. Assume it's a line perpendicular to the direction to p.\n    {\n        return ap_size2;\n    }\n    const coord_t dott = dot(vab, vap);\n    const coord_t ax_size2 = dott * dott \/ vSize2(vab);\n    const coord_t px_size2 = std::max(coord_t(0), ap_size2 - ax_size2);\n    return px_size2;\n}\n\n} \/\/ namespace cura\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\n * (c) Copyright Ascensio System SIA 2010-2017\r\n *\r\n * This program is a free software product. You can redistribute it and\/or\r\n * modify it under the terms of the GNU Affero General Public License (AGPL)\r\n * version 3 as published by the Free Software Foundation. In accordance with\r\n * Section 7(a) of the GNU AGPL its Section 15 shall be amended to the effect\r\n * that Ascensio System SIA expressly excludes the warranty of non-infringement\r\n * of any third-party rights.\r\n *\r\n * This program is distributed WITHOUT ANY WARRANTY; without even the implied\r\n * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR  PURPOSE. For\r\n * details, see the GNU AGPL at: http:\/\/www.gnu.org\/licenses\/agpl-3.0.html\r\n *\r\n * You can contact Ascensio System SIA at Lubanas st. 125a-25, Riga, Latvia,\r\n * EU, LV-1021.\r\n *\r\n * The  interactive user interfaces in modified source and object code versions\r\n * of the Program must display Appropriate Legal Notices, as required under\r\n * Section 5 of the GNU AGPL version 3.\r\n *\r\n * Pursuant to Section 7(b) of the License you must retain the original Product\r\n * logo when distributing the program. Pursuant to Section 7(e) we decline to\r\n * grant you any rights under trademark law for use of our trademarks.\r\n *\r\n * All the Product's GUI elements, including illustrations and icon sets, as\r\n * well as technical writing content are licensed under the terms of the\r\n * Creative Commons Attribution-ShareAlike 4.0 International. See the License\r\n * terms at http:\/\/creativecommons.org\/licenses\/by-sa\/4.0\/legalcode\r\n *\r\n *\/\r\n\r\n#include \"SERIESDATA.h\"\r\n#include <Logic\/Biff_records\/Dimensions.h>\r\n#include <Logic\/Biff_records\/SIIndex.h>\r\n#include <Logic\/Biff_records\/Number.h>\r\n#include <Logic\/Biff_records\/BoolErr.h>\r\n#include <Logic\/Biff_records\/Blank.h>\r\n#include <Logic\/Biff_records\/Label.h>\r\n\r\nnamespace XLS\r\n{\r\n\r\n\r\nSERIESDATA::SERIESDATA()\r\n{\r\n}\r\n\r\n\r\nSERIESDATA::~SERIESDATA()\r\n{\r\n}\r\n\r\n\r\n\/\/  (Number \/ BoolErr \/ Blank \/ Label)\r\nclass Parenthesis_SERIESDATA_2: public ABNFParenthesis\r\n{\r\n\tBASE_OBJECT_DEFINE_CLASS_NAME(Parenthesis_SERIESDATA_2)\r\npublic:\r\n\tBaseObjectPtr clone()\r\n\t{\r\n\t\treturn BaseObjectPtr(new Parenthesis_SERIESDATA_2(*this));\r\n\t}\r\n\r\n\tconst bool loadContent(BinProcessor& proc)\r\n\t{\r\n\t\treturn\tproc.optional<Number>() ||\r\n\t\t\t\tproc.optional<BoolErr>() ||\r\n\t\t\t\tproc.optional<Blank>() ||\r\n\t\t\t\tproc.optional<Label>();\r\n\t};\r\n};\r\n\r\n\r\n\/\/  (SIIndex *(Number \/ BoolErr \/ Blank \/ Label))\r\nclass Parenthesis_SERIESDATA_1: public ABNFParenthesis\r\n{\r\n\tBASE_OBJECT_DEFINE_CLASS_NAME(Parenthesis_SERIESDATA_1)\r\npublic:\r\n\tstd::vector<BaseObjectPtr>\tm_arSERIESDATA;\r\n\tBaseObjectPtr\t\t\t\tm_SIIndex;\r\n\r\n\tBaseObjectPtr clone()\r\n\t{\r\n\t\treturn BaseObjectPtr(new Parenthesis_SERIESDATA_1(*this));\r\n\t}\r\n\r\n\tconst bool loadContent(BinProcessor& proc)\r\n\t{\r\n\t\tif(!proc.mandatory<SIIndex>())\r\n\t\t{\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\tint count = proc.repeated<Parenthesis_SERIESDATA_2>(0, 0);\r\n\t\treturn true;\r\n\t};\r\n};\r\n\r\n\r\n\r\nBaseObjectPtr SERIESDATA::clone()\r\n{\r\n\treturn BaseObjectPtr(new SERIESDATA(*this));\r\n}\r\n\r\n\r\n\/\/ SERIESDATA = Dimensions 3(SIIndex *(Number \/ BoolErr \/ Blank \/ Label))\r\nconst bool SERIESDATA::loadContent(BinProcessor& proc)\r\n{\r\n\tif(!proc.optional<Dimensions>())\r\n\t{\r\n\t\treturn false;\r\n\t}\r\n\r\n\tif (elements_.size() > 0)\r\n\t{\r\n\t\tm_Dimensions = elements_.back();\r\n\t\telements_.pop_back();\r\n\r\n\t}\r\n\r\n\tint count = proc.repeated<Parenthesis_SERIESDATA_1>(3, 3);\r\n\r\n\tint count1= elements_.size();\r\n\twhile(count1 > 0)\r\n\t{\r\n\t\tif (\"SIIndex\" == elements_.front()->getClassName())\r\n\t\t{\r\n\t\t\tm_arSIIndex.push_back(elements_.front()); count--;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tSIIndex * si_in = dynamic_cast<SIIndex *>(m_arSIIndex.back().get());\r\n\t\t\tif (si_in)\r\n\t\t\t\tsi_in->m_arData.push_back(elements_.front());\r\n\t\t}\r\n\t\telements_.pop_front(); count1--;\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\n} \/\/ namespace XLS\r\n\r\n<commit_msg>fix users file<commit_after>\/*\r\n * (c) Copyright Ascensio System SIA 2010-2017\r\n *\r\n * This program is a free software product. You can redistribute it and\/or\r\n * modify it under the terms of the GNU Affero General Public License (AGPL)\r\n * version 3 as published by the Free Software Foundation. In accordance with\r\n * Section 7(a) of the GNU AGPL its Section 15 shall be amended to the effect\r\n * that Ascensio System SIA expressly excludes the warranty of non-infringement\r\n * of any third-party rights.\r\n *\r\n * This program is distributed WITHOUT ANY WARRANTY; without even the implied\r\n * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR  PURPOSE. For\r\n * details, see the GNU AGPL at: http:\/\/www.gnu.org\/licenses\/agpl-3.0.html\r\n *\r\n * You can contact Ascensio System SIA at Lubanas st. 125a-25, Riga, Latvia,\r\n * EU, LV-1021.\r\n *\r\n * The  interactive user interfaces in modified source and object code versions\r\n * of the Program must display Appropriate Legal Notices, as required under\r\n * Section 5 of the GNU AGPL version 3.\r\n *\r\n * Pursuant to Section 7(b) of the License you must retain the original Product\r\n * logo when distributing the program. Pursuant to Section 7(e) we decline to\r\n * grant you any rights under trademark law for use of our trademarks.\r\n *\r\n * All the Product's GUI elements, including illustrations and icon sets, as\r\n * well as technical writing content are licensed under the terms of the\r\n * Creative Commons Attribution-ShareAlike 4.0 International. See the License\r\n * terms at http:\/\/creativecommons.org\/licenses\/by-sa\/4.0\/legalcode\r\n *\r\n *\/\r\n\r\n#include \"SERIESDATA.h\"\r\n#include <Logic\/Biff_records\/Dimensions.h>\r\n#include <Logic\/Biff_records\/SIIndex.h>\r\n#include <Logic\/Biff_records\/Number.h>\r\n#include <Logic\/Biff_records\/BoolErr.h>\r\n#include <Logic\/Biff_records\/Blank.h>\r\n#include <Logic\/Biff_records\/Label.h>\r\n\r\nnamespace XLS\r\n{\r\n\r\n\r\nSERIESDATA::SERIESDATA()\r\n{\r\n}\r\n\r\n\r\nSERIESDATA::~SERIESDATA()\r\n{\r\n}\r\n\r\n\r\n\/\/  (Number \/ BoolErr \/ Blank \/ Label)\r\nclass Parenthesis_SERIESDATA_2: public ABNFParenthesis\r\n{\r\n\tBASE_OBJECT_DEFINE_CLASS_NAME(Parenthesis_SERIESDATA_2)\r\npublic:\r\n\tBaseObjectPtr clone()\r\n\t{\r\n\t\treturn BaseObjectPtr(new Parenthesis_SERIESDATA_2(*this));\r\n\t}\r\n\r\n\tconst bool loadContent(BinProcessor& proc)\r\n\t{\r\n\t\treturn\tproc.optional<Number>() ||\r\n\t\t\t\tproc.optional<BoolErr>() ||\r\n\t\t\t\tproc.optional<Blank>() ||\r\n\t\t\t\tproc.optional<Label>();\r\n\t};\r\n};\r\n\r\n\r\n\/\/  (SIIndex *(Number \/ BoolErr \/ Blank \/ Label))\r\nclass Parenthesis_SERIESDATA_1: public ABNFParenthesis\r\n{\r\n\tBASE_OBJECT_DEFINE_CLASS_NAME(Parenthesis_SERIESDATA_1)\r\npublic:\r\n\tstd::vector<BaseObjectPtr>\tm_arSERIESDATA;\r\n\tBaseObjectPtr\t\t\t\tm_SIIndex;\r\n\r\n\tBaseObjectPtr clone()\r\n\t{\r\n\t\treturn BaseObjectPtr(new Parenthesis_SERIESDATA_1(*this));\r\n\t}\r\n\r\n\tconst bool loadContent(BinProcessor& proc)\r\n\t{\r\n\t\tif(!proc.mandatory<SIIndex>())\r\n\t\t{\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\tint count = proc.repeated<Parenthesis_SERIESDATA_2>(0, 0);\r\n\t\treturn true;\r\n\t};\r\n};\r\n\r\n\r\n\r\nBaseObjectPtr SERIESDATA::clone()\r\n{\r\n\treturn BaseObjectPtr(new SERIESDATA(*this));\r\n}\r\n\r\n\r\n\/\/ SERIESDATA = Dimensions 3(SIIndex *(Number \/ BoolErr \/ Blank \/ Label))\r\nconst bool SERIESDATA::loadContent(BinProcessor& proc)\r\n{\r\n\tbool result = false;\r\n\tif(proc.optional<Dimensions>())\r\n\t{\r\n\t\tm_Dimensions = elements_.back();\r\n\t\telements_.pop_back();\r\n\t\tresult = true;\r\n\t}\r\n\r\n\tint count = proc.repeated<Parenthesis_SERIESDATA_1>(3, 3);\r\n\tif (count > 0)\r\n\t{\r\n\t\tresult = true;\r\n\r\n\t\tint count1= elements_.size();\r\n\t\twhile(count1 > 0)\r\n\t\t{\r\n\t\t\tif (\"SIIndex\" == elements_.front()->getClassName())\r\n\t\t\t{\r\n\t\t\t\tm_arSIIndex.push_back(elements_.front()); count--;\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tSIIndex * si_in = dynamic_cast<SIIndex *>(m_arSIIndex.back().get());\r\n\t\t\t\tif (si_in)\r\n\t\t\t\t\tsi_in->m_arData.push_back(elements_.front());\r\n\t\t\t}\r\n\t\t\telements_.pop_front(); count1--;\r\n\t\t}\r\n\t}\r\n\r\n\treturn result;\r\n}\r\n\r\n} \/\/ namespace XLS\r\n\r\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 <libtorrent\/torrent_handle.hpp>\n#include <boost\/python.hpp>\n#include <boost\/python\/tuple.hpp>\n#include <boost\/lexical_cast.hpp>\n#include \"gil.hpp\"\n\nusing namespace boost::python;\nusing namespace libtorrent;\n\nnamespace\n{\n\n  list url_seeds(torrent_handle& handle)\n  {\n      list ret;\n      std::set<std::string> urls;\n      {\n          allow_threading_guard guard;\n          urls = handle.url_seeds();\n      }\n\n      for (std::set<std::string>::iterator i(urls.begin())\n          , end(urls.end()); i != end; ++i)\n          ret.append(*i);\n      return ret;\n  }\n\n  list piece_availability(torrent_handle& handle)\n  {\n      list ret;\n      std::vector<int> avail;\n      {\n          allow_threading_guard guard;\n          handle.piece_availability(avail);\n      }\n\n      for (std::vector<int>::iterator i(avail.begin())\n          , end(avail.end()); i != end; ++i)\n          ret.append(*i);\n      return ret;\n  }\n\n  list piece_priorities(torrent_handle& handle)\n  {\n      list ret;\n      std::vector<int> prio;\n      {\n          allow_threading_guard guard;\n          prio = handle.piece_priorities();\n      }\n\n      for (std::vector<int>::iterator i(prio.begin())\n          , end(prio.end()); i != end; ++i)\n          ret.append(*i);\n      return ret;\n  }\n\n  std::vector<announce_entry>::const_iterator begin_trackers(torrent_handle& i)\n  {\n      allow_threading_guard guard;\n      return i.trackers().begin();\n  }\n\n  std::vector<announce_entry>::const_iterator end_trackers(torrent_handle& i)\n  {\n      allow_threading_guard guard;\n      return i.trackers().end();\n  }\n\n} \/\/ namespace unnamed\n\nlist file_progress(torrent_handle& handle)\n{\n    std::vector<size_type> p;\n\n    {\n        allow_threading_guard guard;\n        p.reserve(handle.get_torrent_info().num_files());\n        handle.file_progress(p);\n    }\n\n    list result;\n\n    for (std::vector<size_type>::iterator i(p.begin()), e(p.end()); i != e; ++i)\n        result.append(*i);\n\n    return result;\n}\n\nlist get_peer_info(torrent_handle const& handle)\n{\n    std::vector<peer_info> pi;\n\n    {\n        allow_threading_guard guard;\n        handle.get_peer_info(pi);\n    }\n\n    list result;\n\n    for (std::vector<peer_info>::iterator i = pi.begin(); i != pi.end(); ++i)\n        result.append(*i);\n\n    return result;\n}\n\nvoid prioritize_pieces(torrent_handle& info, object o)\n{\n   std::vector<int> result;\n   try\n   {\n      object iter_obj = object( handle<>( PyObject_GetIter( o.ptr() ) ));\n      while( 1 )\n      {\n         object obj = extract<object>( iter_obj.attr( \"next\" )() );\n         result.push_back(extract<int const>( obj ));\n      }\n   }\n   catch( error_already_set )\n   {\n      PyErr_Clear();\n      info.prioritize_pieces(result);\n      return;\n   }\n}\n\nvoid prioritize_files(torrent_handle& info, object o)\n{\n   std::vector<int> result;\n   try\n   {\n      object iter_obj = object( handle<>( PyObject_GetIter( o.ptr() ) ));\n      while( 1 )\n      {\n         object obj = extract<object>( iter_obj.attr( \"next\" )() );\n         result.push_back(extract<int const>( obj ));\n      }\n   }\n   catch( error_already_set )\n   {\n      PyErr_Clear();\n      info.prioritize_files(result);\n      return;\n   }\n}\n\nlist file_priorities(torrent_handle& handle)\n{\n    list ret;\n    std::vector<int> priorities = handle.file_priorities();\n\n    for (std::vector<int>::iterator i = priorities.begin(); i != priorities.end(); ++i)\n        ret.append(*i);\n\n    return ret;\n}\n\nvoid replace_trackers(torrent_handle& info, object trackers)\n{\n    object iter(trackers.attr(\"__iter__\")());\n\n    std::vector<announce_entry> result;\n\n    for (;;)\n    {\n        handle<> entry(allow_null(PyIter_Next(iter.ptr())));\n\n        if (entry == handle<>())\n            break;\n\n        result.push_back(extract<announce_entry const&>(object(entry)));\n    }\n\n    allow_threading_guard guard;\n    info.replace_trackers(result);\n}\n\nlist get_download_queue(torrent_handle& handle)\n{\n    using boost::python::make_tuple;\n\n    list ret;\n\n    std::vector<partial_piece_info> downloading;\n\n    {\n        allow_threading_guard guard;\n        handle.get_download_queue(downloading);\n    }\n\n    for (std::vector<partial_piece_info>::iterator i = downloading.begin()\n        , end(downloading.end()); i != end; ++i)\n    {\n        dict partial_piece;\n        partial_piece[\"piece_index\"] = i->piece_index;\n        partial_piece[\"blocks_in_piece\"] = i->blocks_in_piece;\n        list block_list;\n        for (int k = 0; k < i->blocks_in_piece; ++k)\n        {\n            dict block_info;\n            block_info[\"state\"] = i->blocks[k].state;\n            block_info[\"num_peers\"] = i->blocks[k].num_peers;\n            block_info[\"bytes_progress\"] = i->blocks[k].bytes_progress;\n            block_info[\"block_size\"] = i->blocks[k].block_size;\n            block_info[\"peer\"] = make_tuple(\n                boost::lexical_cast<std::string>(i->blocks[k].peer.address()), i->blocks[k].peer.port());\n            block_list.append(block_info);\n        }\n        partial_piece[\"blocks\"] = block_list;\n\n        ret.append(partial_piece);\n    }\n\n    return ret;\n}\n\nnamespace\n{\n    tcp::endpoint tuple_to_endpoint(tuple const& t)\n    {\n        return tcp::endpoint(address::from_string(extract<std::string>(t[0])), extract<int>(t[1]));\n    }\n}\n\nvoid force_reannounce(torrent_handle& th, int s)\n{\n    th.force_reannounce(boost::posix_time::seconds(s));\n}\n\nvoid connect_peer(torrent_handle& th, tuple ip, int source)\n{\n    th.connect_peer(tuple_to_endpoint(ip), source);\n}\n\nvoid set_peer_upload_limit(torrent_handle& th, tuple const& ip, int limit)\n{\n    th.set_peer_upload_limit(tuple_to_endpoint(ip), limit);\n}\n\nvoid set_peer_download_limit(torrent_handle& th, tuple const& ip, int limit)\n{\n    th.set_peer_download_limit(tuple_to_endpoint(ip), limit);\n}\n\nvoid bind_torrent_handle()\n{\n    void (torrent_handle::*force_reannounce0)() const = &torrent_handle::force_reannounce;\n\n    int (torrent_handle::*piece_priority0)(int) const = &torrent_handle::piece_priority;\n    void (torrent_handle::*piece_priority1)(int, int) const = &torrent_handle::piece_priority;\n\n    void (torrent_handle::*move_storage0)(fs::path const&) const = &torrent_handle::move_storage;\n    void (torrent_handle::*move_storage1)(fs::wpath const&) const = &torrent_handle::move_storage;\n\n    void (torrent_handle::*rename_file0)(int, fs::path const&) const = &torrent_handle::rename_file;\n    void (torrent_handle::*rename_file1)(int, fs::wpath const&) const = &torrent_handle::rename_file;\n\t\n#ifndef TORRENT_DISABLE_RESOLVE_COUNTRIES\n    bool (torrent_handle::*resolve_countries0)() const = &torrent_handle::resolve_countries;\n    void (torrent_handle::*resolve_countries1)(bool) = &torrent_handle::resolve_countries;\n#endif\n\n    return_value_policy<copy_const_reference> copy;\n\n#define _ allow_threads\n\n    class_<torrent_handle>(\"torrent_handle\")\n        .def(\"get_peer_info\", get_peer_info)\n        .def(\"status\", _(&torrent_handle::status))\n        .def(\"get_download_queue\", get_download_queue)\n        .def(\"file_progress\", file_progress)\n        .def(\"trackers\", range(begin_trackers, end_trackers))\n        .def(\"replace_trackers\", replace_trackers)\n        .def(\"add_url_seed\", _(&torrent_handle::add_url_seed))\n        .def(\"remove_url_seed\", _(&torrent_handle::remove_url_seed))\n        .def(\"url_seeds\", url_seeds)\n        .def(\"has_metadata\", _(&torrent_handle::has_metadata))\n        .def(\"get_torrent_info\", _(&torrent_handle::get_torrent_info), return_internal_reference<>())\n        .def(\"is_valid\", _(&torrent_handle::is_valid))\n        .def(\"is_seed\", _(&torrent_handle::is_seed))\n        .def(\"is_finished\", _(&torrent_handle::is_finished))\n        .def(\"is_paused\", _(&torrent_handle::is_paused))\n        .def(\"pause\", _(&torrent_handle::pause))\n        .def(\"resume\", _(&torrent_handle::resume))\n        .def(\"clear_error\", _(&torrent_handle::clear_error))\n\n        .def(\"is_auto_managed\", _(&torrent_handle::is_auto_managed))\n        .def(\"auto_managed\", _(&torrent_handle::auto_managed))\n        .def(\"queue_position\", _(&torrent_handle::queue_position))\n        .def(\"queue_position_up\", _(&torrent_handle::queue_position_up))\n        .def(\"queue_position_down\", _(&torrent_handle::queue_position_down))\n        .def(\"queue_position_top\", _(&torrent_handle::queue_position_top))\n        .def(\"queue_position_bottom\", _(&torrent_handle::queue_position_bottom))\n\n#ifndef TORRENT_DISABLE_RESOLVE_COUNTRIES\n        .def(\"resolve_countries\", _(resolve_countries0))\n        .def(\"resolve_countries\", _(resolve_countries1))\n#endif\n        \/\/ deprecated\n#ifndef TORRENT_NO_DEPRECATE\n        .def(\"filter_piece\", _(&torrent_handle::filter_piece))\n        .def(\"is_piece_filtered\", _(&torrent_handle::is_piece_filtered))\n        .def(\"write_resume_data\", _(&torrent_handle::write_resume_data))\n#endif\n        .def(\"piece_availability\", piece_availability)\n        .def(\"piece_priority\", _(piece_priority0))\n        .def(\"piece_priority\", _(piece_priority1))\n        .def(\"prioritize_pieces\", prioritize_pieces)\n        .def(\"piece_prioritize\", piece_priorities)\n        .def(\"prioritize_files\", prioritize_files)\n        .def(\"file_priorities\", file_priorities)\n        .def(\"use_interface\", &torrent_handle::use_interface)\n        .def(\"save_resume_data\", _(&torrent_handle::save_resume_data))\n        .def(\"force_reannounce\", _(force_reannounce0))\n        .def(\"force_reannounce\", force_reannounce)\n        .def(\"scrape_tracker\", _(&torrent_handle::scrape_tracker))\n        .def(\"name\", _(&torrent_handle::name))\n        .def(\"set_upload_limit\", _(&torrent_handle::set_upload_limit))\n        .def(\"upload_limit\", _(&torrent_handle::upload_limit))\n        .def(\"set_download_limit\", _(&torrent_handle::set_download_limit))\n        .def(\"download_limit\", _(&torrent_handle::download_limit))\n        .def(\"set_sequential_download\", _(&torrent_handle::set_sequential_download))\n        .def(\"set_peer_upload_limit\", set_peer_upload_limit)\n        .def(\"set_peer_download_limit\", set_peer_download_limit)\n        .def(\"connect_peer\", connect_peer)\n        .def(\"set_ratio\", _(&torrent_handle::set_ratio))\n        .def(\"save_path\", _(&torrent_handle::save_path))\n        .def(\"set_max_uploads\", _(&torrent_handle::set_max_uploads))\n        .def(\"set_max_connections\", _(&torrent_handle::set_max_connections))\n        .def(\"set_tracker_login\", _(&torrent_handle::set_tracker_login))\n        .def(\"move_storage\", _(move_storage0))\n        .def(\"move_storage\", _(move_storage1))\n        .def(\"info_hash\", _(&torrent_handle::info_hash))\n        .def(\"force_recheck\", _(&torrent_handle::force_recheck))\n        .def(\"rename_file\", _(rename_file0))\n        .def(\"rename_file\", _(rename_file1))\n        ;\n}\n<commit_msg>expose add_piece to the python bindings<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 <libtorrent\/torrent_handle.hpp>\n#include <boost\/python.hpp>\n#include <boost\/python\/tuple.hpp>\n#include <boost\/lexical_cast.hpp>\n#include \"gil.hpp\"\n\nusing namespace boost::python;\nusing namespace libtorrent;\n\nnamespace\n{\n\n  list url_seeds(torrent_handle& handle)\n  {\n      list ret;\n      std::set<std::string> urls;\n      {\n          allow_threading_guard guard;\n          urls = handle.url_seeds();\n      }\n\n      for (std::set<std::string>::iterator i(urls.begin())\n          , end(urls.end()); i != end; ++i)\n          ret.append(*i);\n      return ret;\n  }\n\n  list piece_availability(torrent_handle& handle)\n  {\n      list ret;\n      std::vector<int> avail;\n      {\n          allow_threading_guard guard;\n          handle.piece_availability(avail);\n      }\n\n      for (std::vector<int>::iterator i(avail.begin())\n          , end(avail.end()); i != end; ++i)\n          ret.append(*i);\n      return ret;\n  }\n\n  list piece_priorities(torrent_handle& handle)\n  {\n      list ret;\n      std::vector<int> prio;\n      {\n          allow_threading_guard guard;\n          prio = handle.piece_priorities();\n      }\n\n      for (std::vector<int>::iterator i(prio.begin())\n          , end(prio.end()); i != end; ++i)\n          ret.append(*i);\n      return ret;\n  }\n\n  std::vector<announce_entry>::const_iterator begin_trackers(torrent_handle& i)\n  {\n      allow_threading_guard guard;\n      return i.trackers().begin();\n  }\n\n  std::vector<announce_entry>::const_iterator end_trackers(torrent_handle& i)\n  {\n      allow_threading_guard guard;\n      return i.trackers().end();\n  }\n\n} \/\/ namespace unnamed\n\nlist file_progress(torrent_handle& handle)\n{\n    std::vector<size_type> p;\n\n    {\n        allow_threading_guard guard;\n        p.reserve(handle.get_torrent_info().num_files());\n        handle.file_progress(p);\n    }\n\n    list result;\n\n    for (std::vector<size_type>::iterator i(p.begin()), e(p.end()); i != e; ++i)\n        result.append(*i);\n\n    return result;\n}\n\nlist get_peer_info(torrent_handle const& handle)\n{\n    std::vector<peer_info> pi;\n\n    {\n        allow_threading_guard guard;\n        handle.get_peer_info(pi);\n    }\n\n    list result;\n\n    for (std::vector<peer_info>::iterator i = pi.begin(); i != pi.end(); ++i)\n        result.append(*i);\n\n    return result;\n}\n\nvoid prioritize_pieces(torrent_handle& info, object o)\n{\n   std::vector<int> result;\n   try\n   {\n      object iter_obj = object( handle<>( PyObject_GetIter( o.ptr() ) ));\n      while( 1 )\n      {\n         object obj = extract<object>( iter_obj.attr( \"next\" )() );\n         result.push_back(extract<int const>( obj ));\n      }\n   }\n   catch( error_already_set )\n   {\n      PyErr_Clear();\n      info.prioritize_pieces(result);\n      return;\n   }\n}\n\nvoid prioritize_files(torrent_handle& info, object o)\n{\n   std::vector<int> result;\n   try\n   {\n      object iter_obj = object( handle<>( PyObject_GetIter( o.ptr() ) ));\n      while( 1 )\n      {\n         object obj = extract<object>( iter_obj.attr( \"next\" )() );\n         result.push_back(extract<int const>( obj ));\n      }\n   }\n   catch( error_already_set )\n   {\n      PyErr_Clear();\n      info.prioritize_files(result);\n      return;\n   }\n}\n\nlist file_priorities(torrent_handle& handle)\n{\n    list ret;\n    std::vector<int> priorities = handle.file_priorities();\n\n    for (std::vector<int>::iterator i = priorities.begin(); i != priorities.end(); ++i)\n        ret.append(*i);\n\n    return ret;\n}\n\nvoid replace_trackers(torrent_handle& info, object trackers)\n{\n    object iter(trackers.attr(\"__iter__\")());\n\n    std::vector<announce_entry> result;\n\n    for (;;)\n    {\n        handle<> entry(allow_null(PyIter_Next(iter.ptr())));\n\n        if (entry == handle<>())\n            break;\n\n        result.push_back(extract<announce_entry const&>(object(entry)));\n    }\n\n    allow_threading_guard guard;\n    info.replace_trackers(result);\n}\n\nlist get_download_queue(torrent_handle& handle)\n{\n    using boost::python::make_tuple;\n\n    list ret;\n\n    std::vector<partial_piece_info> downloading;\n\n    {\n        allow_threading_guard guard;\n        handle.get_download_queue(downloading);\n    }\n\n    for (std::vector<partial_piece_info>::iterator i = downloading.begin()\n        , end(downloading.end()); i != end; ++i)\n    {\n        dict partial_piece;\n        partial_piece[\"piece_index\"] = i->piece_index;\n        partial_piece[\"blocks_in_piece\"] = i->blocks_in_piece;\n        list block_list;\n        for (int k = 0; k < i->blocks_in_piece; ++k)\n        {\n            dict block_info;\n            block_info[\"state\"] = i->blocks[k].state;\n            block_info[\"num_peers\"] = i->blocks[k].num_peers;\n            block_info[\"bytes_progress\"] = i->blocks[k].bytes_progress;\n            block_info[\"block_size\"] = i->blocks[k].block_size;\n            block_info[\"peer\"] = make_tuple(\n                boost::lexical_cast<std::string>(i->blocks[k].peer.address()), i->blocks[k].peer.port());\n            block_list.append(block_info);\n        }\n        partial_piece[\"blocks\"] = block_list;\n\n        ret.append(partial_piece);\n    }\n\n    return ret;\n}\n\nnamespace\n{\n    tcp::endpoint tuple_to_endpoint(tuple const& t)\n    {\n        return tcp::endpoint(address::from_string(extract<std::string>(t[0])), extract<int>(t[1]));\n    }\n}\n\nvoid force_reannounce(torrent_handle& th, int s)\n{\n    th.force_reannounce(boost::posix_time::seconds(s));\n}\n\nvoid connect_peer(torrent_handle& th, tuple ip, int source)\n{\n    th.connect_peer(tuple_to_endpoint(ip), source);\n}\n\nvoid set_peer_upload_limit(torrent_handle& th, tuple const& ip, int limit)\n{\n    th.set_peer_upload_limit(tuple_to_endpoint(ip), limit);\n}\n\nvoid set_peer_download_limit(torrent_handle& th, tuple const& ip, int limit)\n{\n    th.set_peer_download_limit(tuple_to_endpoint(ip), limit);\n}\n\nvoid add_piece(torrent_handle& th, int piece, char const *data, int flags)\n{\n   th.add_piece(piece, data, flags);\n}\n\nvoid bind_torrent_handle()\n{\n    void (torrent_handle::*force_reannounce0)() const = &torrent_handle::force_reannounce;\n\n    int (torrent_handle::*piece_priority0)(int) const = &torrent_handle::piece_priority;\n    void (torrent_handle::*piece_priority1)(int, int) const = &torrent_handle::piece_priority;\n\n    void (torrent_handle::*move_storage0)(fs::path const&) const = &torrent_handle::move_storage;\n    void (torrent_handle::*move_storage1)(fs::wpath const&) const = &torrent_handle::move_storage;\n\n    void (torrent_handle::*rename_file0)(int, fs::path const&) const = &torrent_handle::rename_file;\n    void (torrent_handle::*rename_file1)(int, fs::wpath const&) const = &torrent_handle::rename_file;\n\t\n#ifndef TORRENT_DISABLE_RESOLVE_COUNTRIES\n    bool (torrent_handle::*resolve_countries0)() const = &torrent_handle::resolve_countries;\n    void (torrent_handle::*resolve_countries1)(bool) = &torrent_handle::resolve_countries;\n#endif\n\n    return_value_policy<copy_const_reference> copy;\n\n#define _ allow_threads\n\n    class_<torrent_handle>(\"torrent_handle\")\n        .def(\"get_peer_info\", get_peer_info)\n        .def(\"status\", _(&torrent_handle::status))\n        .def(\"get_download_queue\", get_download_queue)\n        .def(\"file_progress\", file_progress)\n        .def(\"trackers\", range(begin_trackers, end_trackers))\n        .def(\"replace_trackers\", replace_trackers)\n        .def(\"add_url_seed\", _(&torrent_handle::add_url_seed))\n        .def(\"remove_url_seed\", _(&torrent_handle::remove_url_seed))\n        .def(\"url_seeds\", url_seeds)\n        .def(\"has_metadata\", _(&torrent_handle::has_metadata))\n        .def(\"get_torrent_info\", _(&torrent_handle::get_torrent_info), return_internal_reference<>())\n        .def(\"is_valid\", _(&torrent_handle::is_valid))\n        .def(\"is_seed\", _(&torrent_handle::is_seed))\n        .def(\"is_finished\", _(&torrent_handle::is_finished))\n        .def(\"is_paused\", _(&torrent_handle::is_paused))\n        .def(\"pause\", _(&torrent_handle::pause))\n        .def(\"resume\", _(&torrent_handle::resume))\n        .def(\"clear_error\", _(&torrent_handle::clear_error))\n\n        .def(\"is_auto_managed\", _(&torrent_handle::is_auto_managed))\n        .def(\"auto_managed\", _(&torrent_handle::auto_managed))\n        .def(\"queue_position\", _(&torrent_handle::queue_position))\n        .def(\"queue_position_up\", _(&torrent_handle::queue_position_up))\n        .def(\"queue_position_down\", _(&torrent_handle::queue_position_down))\n        .def(\"queue_position_top\", _(&torrent_handle::queue_position_top))\n        .def(\"queue_position_bottom\", _(&torrent_handle::queue_position_bottom))\n\n#ifndef TORRENT_DISABLE_RESOLVE_COUNTRIES\n        .def(\"resolve_countries\", _(resolve_countries0))\n        .def(\"resolve_countries\", _(resolve_countries1))\n#endif\n        \/\/ deprecated\n#ifndef TORRENT_NO_DEPRECATE\n        .def(\"filter_piece\", _(&torrent_handle::filter_piece))\n        .def(\"is_piece_filtered\", _(&torrent_handle::is_piece_filtered))\n        .def(\"write_resume_data\", _(&torrent_handle::write_resume_data))\n#endif\n        .def(\"add_piece\", add_piece)\n        .def(\"piece_availability\", piece_availability)\n        .def(\"piece_priority\", _(piece_priority0))\n        .def(\"piece_priority\", _(piece_priority1))\n        .def(\"prioritize_pieces\", prioritize_pieces)\n        .def(\"piece_prioritize\", piece_priorities)\n        .def(\"prioritize_files\", prioritize_files)\n        .def(\"file_priorities\", file_priorities)\n        .def(\"use_interface\", &torrent_handle::use_interface)\n        .def(\"save_resume_data\", _(&torrent_handle::save_resume_data))\n        .def(\"force_reannounce\", _(force_reannounce0))\n        .def(\"force_reannounce\", force_reannounce)\n        .def(\"scrape_tracker\", _(&torrent_handle::scrape_tracker))\n        .def(\"name\", _(&torrent_handle::name))\n        .def(\"set_upload_limit\", _(&torrent_handle::set_upload_limit))\n        .def(\"upload_limit\", _(&torrent_handle::upload_limit))\n        .def(\"set_download_limit\", _(&torrent_handle::set_download_limit))\n        .def(\"download_limit\", _(&torrent_handle::download_limit))\n        .def(\"set_sequential_download\", _(&torrent_handle::set_sequential_download))\n        .def(\"set_peer_upload_limit\", set_peer_upload_limit)\n        .def(\"set_peer_download_limit\", set_peer_download_limit)\n        .def(\"connect_peer\", connect_peer)\n        .def(\"set_ratio\", _(&torrent_handle::set_ratio))\n        .def(\"save_path\", _(&torrent_handle::save_path))\n        .def(\"set_max_uploads\", _(&torrent_handle::set_max_uploads))\n        .def(\"set_max_connections\", _(&torrent_handle::set_max_connections))\n        .def(\"set_tracker_login\", _(&torrent_handle::set_tracker_login))\n        .def(\"move_storage\", _(move_storage0))\n        .def(\"move_storage\", _(move_storage1))\n        .def(\"info_hash\", _(&torrent_handle::info_hash))\n        .def(\"force_recheck\", _(&torrent_handle::force_recheck))\n        .def(\"rename_file\", _(rename_file0))\n        .def(\"rename_file\", _(rename_file1))\n        ;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n *\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#include \"FlightTaskManualPositionSmoothVel.hpp\"\n\n#include <mathlib\/mathlib.h>\n#include <float.h>\n\nusing namespace matrix;\n\nbool FlightTaskManualPositionSmoothVel::activate()\n{\n\tbool ret = FlightTaskManualPosition::activate();\n\n\treset(Axes::XYZ);\n\n\treturn ret;\n}\n\nvoid FlightTaskManualPositionSmoothVel::reActivate()\n{\n\treset(Axes::XY);\n}\n\nvoid FlightTaskManualPositionSmoothVel::reset(Axes axes)\n{\n\tint count;\n\n\tswitch (axes) {\n\tcase Axes::XY:\n\t\tcount = 2;\n\t\tbreak;\n\n\tcase Axes::XYZ:\n\t\tcount = 3;\n\t\tbreak;\n\n\tdefault:\n\t\tcount = 0;\n\t\tbreak;\n\t}\n\n\t\/\/ TODO: get current accel\n\tfor (int i = 0; i < count; ++i) {\n\t\t_smoothing[i].reset(0.f, _velocity(i), _position(i));\n\t}\n\n\t_position_lock_xy_active = false;\n\t_position_lock_z_active = false;\n\t_position_setpoint_xy_locked(0) = NAN;\n\t_position_setpoint_xy_locked(1) = NAN;\n\t_position_setpoint_z_locked = NAN;\n}\n\nvoid FlightTaskManualPositionSmoothVel::_updateSetpoints()\n{\n\t\/* Get yaw setpont, un-smoothed position setpoints.*\/\n\tFlightTaskManualPosition::_updateSetpoints();\n\n\t\/* Update constraints *\/\n\t_smoothing[0].setMaxAccel(MPC_ACC_HOR_MAX.get());\n\t_smoothing[1].setMaxAccel(MPC_ACC_HOR_MAX.get());\n\t_smoothing[0].setMaxVel(_constraints.speed_xy);\n\t_smoothing[1].setMaxVel(_constraints.speed_xy);\n\n\tif (_velocity_setpoint(2) < 0.f) { \/\/ up\n\t\t_smoothing[2].setMaxAccel(MPC_ACC_UP_MAX.get());\n\t\t_smoothing[2].setMaxVel(MPC_Z_VEL_MAX_UP.get());\n\n\t} else { \/\/ down\n\t\t_smoothing[2].setMaxAccel(MPC_ACC_DOWN_MAX.get());\n\t\t_smoothing[2].setMaxVel(MPC_Z_VEL_MAX_DN.get());\n\t}\n\n\tfloat jerk[3] = {_jerk_max.get(), _jerk_max.get(), _jerk_max.get()};\n\n\t\/* Check for position unlock\n\t * During a position lock -> position unlock transition, we have to make sure that the velocity setpoint\n\t * is continuous. We know that the output of the position loop (part of the velocity setpoint) will suddenly become null\n\t * and only the feedforward (generated by this flight task) will remain. This is why the previous input of the velocity controller\n\t * is used to set current velocity of the trajectory.\n\t *\/\n\tVector2f sticks_expo_xy = Vector2f(&_sticks_expo(0));\n\n\tif (sticks_expo_xy.length() > FLT_EPSILON) {\n\t\tif (_position_lock_xy_active) {\n\t\t\t_smoothing[0].setCurrentVelocity(_velocity_setpoint_feedback(\n\t\t\t\t\t0)); \/\/ Start the trajectory at the current velocity setpoint\n\t\t\t_smoothing[1].setCurrentVelocity(_velocity_setpoint_feedback(1));\n\t\t\t_position_setpoint_xy_locked(0) = NAN;\n\t\t\t_position_setpoint_xy_locked(1) = NAN;\n\t\t}\n\n\t\t_position_lock_xy_active = false;\n\t}\n\n\tif (fabsf(_sticks_expo(2)) > FLT_EPSILON) {\n\t\tif (_position_lock_z_active) {\n\t\t\t_smoothing[2].setCurrentVelocity(_velocity_setpoint_feedback(\n\t\t\t\t\t2)); \/\/ Start the trajectory at the current velocity setpoint\n\t\t\t_position_setpoint_z_locked = NAN;\n\t\t}\n\n\t\t_position_lock_z_active = false;\n\t}\n\n\tfor (int i = 0; i < 3; ++i) {\n\t\t_smoothing[i].setMaxJerk(jerk[i]);\n\t\t_smoothing[i].updateDurations(_deltatime, _velocity_setpoint(i));\n\t}\n\n\tVelocitySmoothing::timeSynchronization(_smoothing, 2); \/\/ Synchronize x and y only\n\n\tif (_position_lock_xy_active) {\n\t\t\/\/ Check if a reset event has happened.\n\t\tif (_sub_vehicle_local_position->get().xy_reset_counter != _reset_counter) {\n\t\t\t\/\/ Reset the XY axes\n\t\t\t_smoothing[0].setCurrentPosition(_position(0));\n\t\t\t_smoothing[1].setCurrentPosition(_position(1));\n\t\t\t_reset_counter = _sub_vehicle_local_position->get().xy_reset_counter;\n\t\t}\n\t}\n\n\tif (!_position_lock_xy_active) {\n\t\t_smoothing[0].setCurrentPosition(_position(0));\n\t\t_smoothing[1].setCurrentPosition(_position(1));\n\t}\n\tif (!_position_lock_z_active) {\n\t\t_smoothing[2].setCurrentPosition(_position(2));\n\t}\n\n\tVector3f pos_sp_smooth;\n\tfor (int i = 0; i < 3; ++i) {\n\n\t\t_smoothing[i].integrate(_acceleration_setpoint(i), _vel_sp_smooth(i), pos_sp_smooth(i));\n\t\t_velocity_setpoint(i) = _vel_sp_smooth(i); \/\/ Feedforward\n\t\t_jerk_setpoint(i) = _smoothing[i].getCurrentJerk();\n\t}\n\n\t\/\/ Check for position lock transition\n\tif (Vector2f(_vel_sp_smooth).length() < 0.01f &&\n\t    Vector2f(_acceleration_setpoint).length() < .2f &&\n\t    sticks_expo_xy.length() <= FLT_EPSILON) {\n\t\t_position_setpoint_xy_locked(0) = pos_sp_smooth(0);\n\t\t_position_setpoint_xy_locked(1) = pos_sp_smooth(1);\n\t\t_position_lock_xy_active = true;\n\t}\n\tif (fabsf(_vel_sp_smooth(2)) < 0.01f &&\n\t    fabsf(_acceleration_setpoint(2)) < .2f &&\n\t    fabsf(_sticks_expo(2)) <= FLT_EPSILON) {\n\t\t_position_setpoint_z_locked = pos_sp_smooth(2);\n\t\t_position_lock_z_active = true;\n\t}\n\n\t_position_setpoint(0) = _position_setpoint_xy_locked(0);\n\t_position_setpoint(1) = _position_setpoint_xy_locked(1);\n\t_position_setpoint(2) = _position_setpoint_z_locked;\n}\n<commit_msg>Manual vel smooth - use speed_up and speed_down constraints to limit velocity target of the trajectory generator<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#include \"FlightTaskManualPositionSmoothVel.hpp\"\n\n#include <mathlib\/mathlib.h>\n#include <float.h>\n\nusing namespace matrix;\n\nbool FlightTaskManualPositionSmoothVel::activate()\n{\n\tbool ret = FlightTaskManualPosition::activate();\n\n\treset(Axes::XYZ);\n\n\treturn ret;\n}\n\nvoid FlightTaskManualPositionSmoothVel::reActivate()\n{\n\treset(Axes::XY);\n}\n\nvoid FlightTaskManualPositionSmoothVel::reset(Axes axes)\n{\n\tint count;\n\n\tswitch (axes) {\n\tcase Axes::XY:\n\t\tcount = 2;\n\t\tbreak;\n\n\tcase Axes::XYZ:\n\t\tcount = 3;\n\t\tbreak;\n\n\tdefault:\n\t\tcount = 0;\n\t\tbreak;\n\t}\n\n\t\/\/ TODO: get current accel\n\tfor (int i = 0; i < count; ++i) {\n\t\t_smoothing[i].reset(0.f, _velocity(i), _position(i));\n\t}\n\n\t_position_lock_xy_active = false;\n\t_position_lock_z_active = false;\n\t_position_setpoint_xy_locked(0) = NAN;\n\t_position_setpoint_xy_locked(1) = NAN;\n\t_position_setpoint_z_locked = NAN;\n}\n\nvoid FlightTaskManualPositionSmoothVel::_updateSetpoints()\n{\n\t\/* Get yaw setpont, un-smoothed position setpoints.*\/\n\tFlightTaskManualPosition::_updateSetpoints();\n\n\t\/* Update constraints *\/\n\t_smoothing[0].setMaxAccel(MPC_ACC_HOR_MAX.get());\n\t_smoothing[1].setMaxAccel(MPC_ACC_HOR_MAX.get());\n\t_smoothing[0].setMaxVel(_constraints.speed_xy);\n\t_smoothing[1].setMaxVel(_constraints.speed_xy);\n\n\tif (_velocity_setpoint(2) < 0.f) { \/\/ up\n\t\t_smoothing[2].setMaxAccel(MPC_ACC_UP_MAX.get());\n\t\t_smoothing[2].setMaxVel(_constraints.speed_up);\n\n\t} else { \/\/ down\n\t\t_smoothing[2].setMaxAccel(MPC_ACC_DOWN_MAX.get());\n\t\t_smoothing[2].setMaxVel(_constraints.speed_down);\n\t}\n\n\tfloat jerk[3] = {_jerk_max.get(), _jerk_max.get(), _jerk_max.get()};\n\n\t\/* Check for position unlock\n\t * During a position lock -> position unlock transition, we have to make sure that the velocity setpoint\n\t * is continuous. We know that the output of the position loop (part of the velocity setpoint) will suddenly become null\n\t * and only the feedforward (generated by this flight task) will remain. This is why the previous input of the velocity controller\n\t * is used to set current velocity of the trajectory.\n\t *\/\n\tVector2f sticks_expo_xy = Vector2f(&_sticks_expo(0));\n\n\tif (sticks_expo_xy.length() > FLT_EPSILON) {\n\t\tif (_position_lock_xy_active) {\n\t\t\t_smoothing[0].setCurrentVelocity(_velocity_setpoint_feedback(\n\t\t\t\t\t0)); \/\/ Start the trajectory at the current velocity setpoint\n\t\t\t_smoothing[1].setCurrentVelocity(_velocity_setpoint_feedback(1));\n\t\t\t_position_setpoint_xy_locked(0) = NAN;\n\t\t\t_position_setpoint_xy_locked(1) = NAN;\n\t\t}\n\n\t\t_position_lock_xy_active = false;\n\t}\n\n\tif (fabsf(_sticks_expo(2)) > FLT_EPSILON) {\n\t\tif (_position_lock_z_active) {\n\t\t\t_smoothing[2].setCurrentVelocity(_velocity_setpoint_feedback(\n\t\t\t\t\t2)); \/\/ Start the trajectory at the current velocity setpoint\n\t\t\t_position_setpoint_z_locked = NAN;\n\t\t}\n\n\t\t_position_lock_z_active = false;\n\t}\n\n\tfor (int i = 0; i < 3; ++i) {\n\t\t_smoothing[i].setMaxJerk(jerk[i]);\n\t\t_smoothing[i].updateDurations(_deltatime, _velocity_setpoint(i));\n\t}\n\n\tVelocitySmoothing::timeSynchronization(_smoothing, 2); \/\/ Synchronize x and y only\n\n\tif (_position_lock_xy_active) {\n\t\t\/\/ Check if a reset event has happened.\n\t\tif (_sub_vehicle_local_position->get().xy_reset_counter != _reset_counter) {\n\t\t\t\/\/ Reset the XY axes\n\t\t\t_smoothing[0].setCurrentPosition(_position(0));\n\t\t\t_smoothing[1].setCurrentPosition(_position(1));\n\t\t\t_reset_counter = _sub_vehicle_local_position->get().xy_reset_counter;\n\t\t}\n\t}\n\n\tif (!_position_lock_xy_active) {\n\t\t_smoothing[0].setCurrentPosition(_position(0));\n\t\t_smoothing[1].setCurrentPosition(_position(1));\n\t}\n\tif (!_position_lock_z_active) {\n\t\t_smoothing[2].setCurrentPosition(_position(2));\n\t}\n\n\tVector3f pos_sp_smooth;\n\tfor (int i = 0; i < 3; ++i) {\n\n\t\t_smoothing[i].integrate(_acceleration_setpoint(i), _vel_sp_smooth(i), pos_sp_smooth(i));\n\t\t_velocity_setpoint(i) = _vel_sp_smooth(i); \/\/ Feedforward\n\t\t_jerk_setpoint(i) = _smoothing[i].getCurrentJerk();\n\t}\n\n\t\/\/ Check for position lock transition\n\tif (Vector2f(_vel_sp_smooth).length() < 0.01f &&\n\t    Vector2f(_acceleration_setpoint).length() < .2f &&\n\t    sticks_expo_xy.length() <= FLT_EPSILON) {\n\t\t_position_setpoint_xy_locked(0) = pos_sp_smooth(0);\n\t\t_position_setpoint_xy_locked(1) = pos_sp_smooth(1);\n\t\t_position_lock_xy_active = true;\n\t}\n\tif (fabsf(_vel_sp_smooth(2)) < 0.01f &&\n\t    fabsf(_acceleration_setpoint(2)) < .2f &&\n\t    fabsf(_sticks_expo(2)) <= FLT_EPSILON) {\n\t\t_position_setpoint_z_locked = pos_sp_smooth(2);\n\t\t_position_lock_z_active = true;\n\t}\n\n\t_position_setpoint(0) = _position_setpoint_xy_locked(0);\n\t_position_setpoint(1) = _position_setpoint_xy_locked(1);\n\t_position_setpoint(2) = _position_setpoint_z_locked;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Makes sure we close all browsers, not just the active ones. This fixes NOTREACHED() being hit on browser tests when a browser window that has not been activated is closed.<commit_after><|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 \"chrome\/test\/perf\/perf_ui_test_suite.h\"\n\n#include <stdio.h>\n\n#include \"base\/file_util.h\"\n#include \"base\/json\/json_file_value_serializer.h\"\n#include \"base\/lazy_instance.h\"\n#include \"base\/logging.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/path_service.h\"\n#include \"base\/string_util.h\"\n#include \"base\/threading\/platform_thread.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/themes\/browser_theme_pack.h\"\n#include \"chrome\/common\/chrome_constants.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/extensions\/extension.h\"\n#include \"chrome\/test\/perf\/generate_profile.h\"\n#include \"content\/public\/test\/test_browser_thread.h\"\n\n#if defined(OS_WIN)\n#include <atlbase.h>\n#include \"ui\/base\/resource\/resource_bundle_win.h\"\n#endif\n\nusing content::BrowserThread;\nusing extensions::Extension;\n\nnamespace {\n\nconst int kNumURLs = 20000;\n\nconst char kThemeExtension[] = \"mblmlcbknbnfebdfjnolmcapmdofhmme\";\n\nbase::LazyInstance<base::FilePath> g_default_profile_dir =\n    LAZY_INSTANCE_INITIALIZER;\nbase::LazyInstance<base::FilePath> g_complex_profile_dir =\n    LAZY_INSTANCE_INITIALIZER;\n\n}  \/\/ namespace\n\nPerfUITestSuite::PerfUITestSuite(int argc, char** argv)\n    : UITestSuite(argc, argv) {\n  fprintf(stderr, \"In the constructor of the PerfUITestSuite.\\n\");\n  base::PlatformThread::SetName(\"Tests_Main\");\n}\n\nPerfUITestSuite::~PerfUITestSuite() {\n}\n\nbase::FilePath PerfUITestSuite::GetPathForProfileType(\n    ProfileType profile_type) {\n  switch (profile_type) {\n    case DEFAULT_THEME:\n      return g_default_profile_dir.Get();\n    case COMPLEX_THEME:\n      return g_complex_profile_dir.Get();\n    default:\n      NOTREACHED();\n      return base::FilePath();\n  }\n}\n\nvoid PerfUITestSuite::Initialize() {\n#if defined(OS_WIN)\n  \/\/ On Windows, make sure we've loaded the main chrome dll for its resource\n  \/\/ before we let our parent class initialize the shared resource bundle\n  \/\/ infrastructure. We have to do this manually because the extension system\n  \/\/ uses several resources which, on Windows, are only compiled into the\n  \/\/ browser DLL, but the base chrome testing stuff is used outside of browser.\n  \/\/\n  \/\/ TODO(darin): Kill this once http:\/\/crbug.com\/52609 is fixed.\n  base::FilePath dll;\n  fprintf(stderr, \"About to get dir module.\\n\");\n  PathService::Get(base::DIR_MODULE, &dll);\n  dll = dll.Append(chrome::kBrowserResourcesDll);\n  fprintf(stderr, \"About to LoadLibraryExW.\\n\");\n  HMODULE res_mod = ::LoadLibraryExW(dll.value().c_str(),\n      NULL, LOAD_LIBRARY_AS_DATAFILE | LOAD_LIBRARY_AS_IMAGE_RESOURCE);\n  DCHECK(res_mod);\n  fprintf(stderr, \"About to _AtlBaseModule.SetResourceInstance().\\n\");\n  _AtlBaseModule.SetResourceInstance(res_mod);\n\n  fprintf(stderr, \"About to ui::SetResourcesDataDLL.\\n\");\n  ui::SetResourcesDataDLL(_AtlBaseModule.GetResourceInstance());\n#endif\n\n  fprintf(stderr, \"About to go through UITestSuite::Initialize().\\n\");\n  UITestSuite::Initialize();\n\n  fprintf(stderr, \"About to default_profile_dir_.CreateUniqueTempDir().\\n\");\n  if (!default_profile_dir_.CreateUniqueTempDir()) {\n    LOG(FATAL) << \"Failed to create default profile directory...\";\n  }\n\n  \/\/ Build a profile in default profile dir.\n  fprintf(stderr, \"About to call GenerateProfile().\\n\");\n  base::FilePath default_path =\n      default_profile_dir_.path().AppendASCII(\"Default\");\n  if (!GenerateProfile(TOP_SITES, kNumURLs, default_path)) {\n    LOG(FATAL) << \"Failed to generate default profile for tests...\";\n  }\n\n  g_default_profile_dir.Get() = default_profile_dir_.path();\n\n  fprintf(stderr, \"About to build second temp dir().\\n\");\n  if (!complex_profile_dir_.CreateUniqueTempDir()) {\n    LOG(FATAL) << \"Failed to create complex profile directory...\";\n  }\n\n  fprintf(stderr, \"About to copy profile directory.\\n\");\n  if (!file_util::CopyDirectory(default_path,\n                                complex_profile_dir_.path(),\n                                true)) {\n    LOG(FATAL) << \"Failed to copy data to complex profile directory...\";\n  }\n\n  \/\/ Copy the Extensions directory from the template into the\n  \/\/ complex_profile_dir dir.\n  base::FilePath base_data_dir;\n  if (!PathService::Get(chrome::DIR_TEST_DATA, &base_data_dir))\n    LOG(FATAL) << \"Failed to fetch test data dir\";\n\n  base_data_dir = base_data_dir.AppendASCII(\"profiles\");\n  base_data_dir = base_data_dir.AppendASCII(\"profile_with_complex_theme\");\n  base_data_dir = base_data_dir.AppendASCII(\"Default\");\n\n  fprintf(stderr, \"About to copy extensions directory.\\n\");\n  if (!file_util::CopyDirectory(base_data_dir,\n                                complex_profile_dir_.path(),\n                                true)) {\n    LOG(FATAL) << \"Failed to copy default to complex profile\";\n  }\n\n  fprintf(stderr, \"About to build theme pack.\\n\");\n  \/\/ Parse the manifest and make a temporary extension object because the\n  \/\/ theme system takes extensions as input.\n  base::FilePath extension_base =\n      complex_profile_dir_.path()\n      .AppendASCII(\"Default\")\n      .AppendASCII(\"Extensions\")\n      .AppendASCII(kThemeExtension)\n      .AppendASCII(\"1.1\");\n  BuildCachedThemePakIn(extension_base);\n\n  g_complex_profile_dir.Get() = complex_profile_dir_.path();\n  fprintf(stderr, \"All done with init.\\n\");\n}\n\nvoid PerfUITestSuite::BuildCachedThemePakIn(\n    const base::FilePath& extension_base) {\n  int error_code = 0;\n  std::string error;\n  JSONFileValueSerializer serializer(\n      extension_base.AppendASCII(\"manifest.json\"));\n  scoped_ptr<DictionaryValue> valid_value(static_cast<DictionaryValue*>(\n      serializer.Deserialize(&error_code, &error)));\n  if (error_code != 0 || !valid_value)\n    LOG(FATAL) << \"Error parsing theme manifest: \" << error;\n\n  scoped_refptr<Extension> extension =\n      Extension::Create(extension_base,\n                        extensions::Manifest::INVALID_LOCATION,\n                        *valid_value,\n                        Extension::NO_FLAGS,\n                        &error);\n  if (!extension)\n    LOG(FATAL) << \"Error loading theme extension: \" << error;\n\n  \/\/ Build the \"Cached Theme.pak\" file in the template. (It's not committed\n  \/\/ both because committing large binary files is bad in a git world and\n  \/\/ because people don't remember to update it anyway, meaning we usually\n  \/\/ have the theme rebuild penalty in our data.)\n  MessageLoopForUI message_loop_;\n  content::TestBrowserThread ui_thread_(BrowserThread::UI, &message_loop_);\n  content::TestBrowserThread file_thread_(BrowserThread::FILE,\n                                          &message_loop_);\n\n  scoped_refptr<BrowserThemePack> theme(\n      BrowserThemePack::BuildFromExtension(extension));\n  if (!theme)\n    LOG(FATAL) << \"Failed to load theme from extension\";\n\n  theme->WriteToDisk(extension_base.AppendASCII(\"Cached Theme.pak\"));\n}\n<commit_msg>Revert \"Add debugging statements for problem that only happens on 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 \"chrome\/test\/perf\/perf_ui_test_suite.h\"\n\n#include \"base\/file_util.h\"\n#include \"base\/json\/json_file_value_serializer.h\"\n#include \"base\/lazy_instance.h\"\n#include \"base\/logging.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/path_service.h\"\n#include \"base\/string_util.h\"\n#include \"base\/threading\/platform_thread.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/themes\/browser_theme_pack.h\"\n#include \"chrome\/common\/chrome_constants.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/extensions\/extension.h\"\n#include \"chrome\/test\/perf\/generate_profile.h\"\n#include \"content\/public\/test\/test_browser_thread.h\"\n\n#if defined(OS_WIN)\n#include <atlbase.h>\n#include \"ui\/base\/resource\/resource_bundle_win.h\"\n#endif\n\nusing content::BrowserThread;\nusing extensions::Extension;\n\nnamespace {\n\nconst int kNumURLs = 20000;\n\nconst char kThemeExtension[] = \"mblmlcbknbnfebdfjnolmcapmdofhmme\";\n\nbase::LazyInstance<base::FilePath> g_default_profile_dir =\n    LAZY_INSTANCE_INITIALIZER;\nbase::LazyInstance<base::FilePath> g_complex_profile_dir =\n    LAZY_INSTANCE_INITIALIZER;\n\n}  \/\/ namespace\n\nPerfUITestSuite::PerfUITestSuite(int argc, char** argv)\n    : UITestSuite(argc, argv) {\n  base::PlatformThread::SetName(\"Tests_Main\");\n}\n\nPerfUITestSuite::~PerfUITestSuite() {\n}\n\nbase::FilePath PerfUITestSuite::GetPathForProfileType(\n    ProfileType profile_type) {\n  switch (profile_type) {\n    case DEFAULT_THEME:\n      return g_default_profile_dir.Get();\n    case COMPLEX_THEME:\n      return g_complex_profile_dir.Get();\n    default:\n      NOTREACHED();\n      return base::FilePath();\n  }\n}\n\nvoid PerfUITestSuite::Initialize() {\n#if defined(OS_WIN)\n  \/\/ On Windows, make sure we've loaded the main chrome dll for its resource\n  \/\/ before we let our parent class initialize the shared resource bundle\n  \/\/ infrastructure. We have to do this manually because the extension system\n  \/\/ uses several resources which, on Windows, are only compiled into the\n  \/\/ browser DLL, but the base chrome testing stuff is used outside of browser.\n  \/\/\n  \/\/ TODO(darin): Kill this once http:\/\/crbug.com\/52609 is fixed.\n  base::FilePath dll;\n  PathService::Get(base::DIR_MODULE, &dll);\n  dll = dll.Append(chrome::kBrowserResourcesDll);\n  HMODULE res_mod = ::LoadLibraryExW(dll.value().c_str(),\n      NULL, LOAD_LIBRARY_AS_DATAFILE | LOAD_LIBRARY_AS_IMAGE_RESOURCE);\n  DCHECK(res_mod);\n  _AtlBaseModule.SetResourceInstance(res_mod);\n\n  ui::SetResourcesDataDLL(_AtlBaseModule.GetResourceInstance());\n#endif\n\n  UITestSuite::Initialize();\n\n  if (!default_profile_dir_.CreateUniqueTempDir()) {\n    LOG(FATAL) << \"Failed to create default profile directory...\";\n  }\n\n  \/\/ Build a profile in default profile dir.\n  base::FilePath default_path =\n      default_profile_dir_.path().AppendASCII(\"Default\");\n  if (!GenerateProfile(TOP_SITES, kNumURLs, default_path)) {\n    LOG(FATAL) << \"Failed to generate default profile for tests...\";\n  }\n\n  g_default_profile_dir.Get() = default_profile_dir_.path();\n\n  if (!complex_profile_dir_.CreateUniqueTempDir()) {\n    LOG(FATAL) << \"Failed to create complex profile directory...\";\n  }\n\n  if (!file_util::CopyDirectory(default_path,\n                                complex_profile_dir_.path(),\n                                true)) {\n    LOG(FATAL) << \"Failed to copy data to complex profile directory...\";\n  }\n\n  \/\/ Copy the Extensions directory from the template into the\n  \/\/ complex_profile_dir dir.\n  base::FilePath base_data_dir;\n  if (!PathService::Get(chrome::DIR_TEST_DATA, &base_data_dir))\n    LOG(FATAL) << \"Failed to fetch test data dir\";\n\n  base_data_dir = base_data_dir.AppendASCII(\"profiles\");\n  base_data_dir = base_data_dir.AppendASCII(\"profile_with_complex_theme\");\n  base_data_dir = base_data_dir.AppendASCII(\"Default\");\n\n  if (!file_util::CopyDirectory(base_data_dir,\n                                complex_profile_dir_.path(),\n                                true)) {\n    LOG(FATAL) << \"Failed to copy default to complex profile\";\n  }\n\n  \/\/ Parse the manifest and make a temporary extension object because the\n  \/\/ theme system takes extensions as input.\n  base::FilePath extension_base =\n      complex_profile_dir_.path()\n      .AppendASCII(\"Default\")\n      .AppendASCII(\"Extensions\")\n      .AppendASCII(kThemeExtension)\n      .AppendASCII(\"1.1\");\n  BuildCachedThemePakIn(extension_base);\n\n  g_complex_profile_dir.Get() = complex_profile_dir_.path();\n}\n\nvoid PerfUITestSuite::BuildCachedThemePakIn(\n    const base::FilePath& extension_base) {\n  int error_code = 0;\n  std::string error;\n  JSONFileValueSerializer serializer(\n      extension_base.AppendASCII(\"manifest.json\"));\n  scoped_ptr<DictionaryValue> valid_value(static_cast<DictionaryValue*>(\n      serializer.Deserialize(&error_code, &error)));\n  if (error_code != 0 || !valid_value)\n    LOG(FATAL) << \"Error parsing theme manifest: \" << error;\n\n  scoped_refptr<Extension> extension =\n      Extension::Create(extension_base,\n                        extensions::Manifest::INVALID_LOCATION,\n                        *valid_value,\n                        Extension::NO_FLAGS,\n                        &error);\n  if (!extension)\n    LOG(FATAL) << \"Error loading theme extension: \" << error;\n\n  \/\/ Build the \"Cached Theme.pak\" file in the template. (It's not committed\n  \/\/ both because committing large binary files is bad in a git world and\n  \/\/ because people don't remember to update it anyway, meaning we usually\n  \/\/ have the theme rebuild penalty in our data.)\n  MessageLoopForUI message_loop_;\n  content::TestBrowserThread ui_thread_(BrowserThread::UI, &message_loop_);\n  content::TestBrowserThread file_thread_(BrowserThread::FILE,\n                                          &message_loop_);\n\n  scoped_refptr<BrowserThemePack> theme(\n      BrowserThemePack::BuildFromExtension(extension));\n  if (!theme)\n    LOG(FATAL) << \"Failed to load theme from extension\";\n\n  theme->WriteToDisk(extension_base.AppendASCII(\"Cached Theme.pak\"));\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: bdNTConfigurationParserTest.cpp,v 1.12 2011\/12\/09 17:11:45 rtobar Exp $\"\n*\n* who       when      what\n* --------  --------  ----------------------------------------------\n* bjeram  2011-04-19  created\n*\/\n#include <stdio.h>\n\n#include \"bulkDataNTConfiguration.h\"\n#include \"bulkDataNTConfigurationParser.h\"\n#include \"ACS_BD_Errors.h\"\n#include <iostream>\n#include <fstream>\n\nusing namespace std;\nusing namespace xercesc;\nusing namespace AcsBulkdata;\nusing namespace ACS_BD_Errors;\n\nvoid printConfigMap(BulkDataConfigurationParser &parser,\n\t\tset<const char *> (BulkDataConfigurationParser::*streamNamesGetter)(void),\n\t\tset<const char *> (BulkDataConfigurationParser::*flowNamesGetter)(const char *)) {\n\n\tset<const char *> streamNames = (parser.*streamNamesGetter)();\n\tif( streamNames.size() == 0 ) {\n\t\tcout << \"No streams found\" << endl;\n\t\treturn;\n\t}\n\n\tcout << \"Number of streams: \" << streamNames.size() << endl;\n\n\tset<const char *>::iterator it;\n\tfor(it = streamNames.begin(); it != streamNames.end(); it++) {\n\n\t\tset<const char *> flowNames = (parser.*flowNamesGetter)(*it);\n\n\t\tcout << \"   Stream name: '\" << *it << \"'\" << endl;\n\t\tcout << \"   Number of flows: \" << flowNames.size() << endl;\n\n\t\tset<const char *>::iterator it2;\n\t\tfor(it2 = flowNames.begin(); it2 != flowNames.end(); it2++)\n\t\t\tcout << \"     Flow name: \" << *it2 << endl;\n\t}\n\n}\n\nvoid parseFiles(const char *directory, BulkDataConfigurationParser &parser,\n\t\tvoid (BulkDataConfigurationParser::*parserMethod)(const char *),\n\t\tset<const char *> (BulkDataConfigurationParser::*streamNamesGetter)(void),\n\t\tset<const char *> (BulkDataConfigurationParser::*flowNamesGetter)(const char *)) {\n\n\tACE_DIRENT **nameList;\n\tint fileCount;\n\n\t\/\/ Parse all receiver configs\n\tfileCount = ACE_OS::scandir(directory, &nameList, 0, 0);\n\tfor(int i=0; i<fileCount; i++) {\n\t\tACE_DIRENT *dirent = nameList[i];\n\n\t\tif( ACE_OS::strcmp(dirent->d_name, \".\") == 0 ||\n\t\t\t\tACE_OS::strcmp(dirent->d_name, \"..\") == 0 ) {\n\t\t\tfree(dirent);\n\t\t\tcontinue;\n\t\t}\n\n\n\t\tstring realFilename(directory);\n\t\trealFilename.append(\"\/\");\n\t\trealFilename.append(dirent->d_name);\n\n\t\tcout << \"Parsing file: \" << realFilename << endl;\n\n\t\tifstream file(realFilename.c_str());\n\t\tstring s((std::istreambuf_iterator<char>(file)), istreambuf_iterator<char>());\n\t\tfile.close();\n\n\t\ttry {\n\t\t\tBulkDataConfigurationParser parser;\n\t\t\t(parser.*parserMethod)(s.c_str());\n\t\t\tprintConfigMap(parser, streamNamesGetter, flowNamesGetter);\n\t\t} catch(CDBProblemExImpl &ex) {\n\t\t\tex.log(LM_ERROR);\n\t\t}\n\n\t\tfree(dirent);\n\t}\n\tfree(nameList);\n\n}\n\nvoid parseSenderFiles() {\n\tBulkDataConfigurationParser parser;\n\tparseFiles(\"bdSenderConfigs\", parser,\n\t\t\t&BulkDataConfigurationParser::parseSenderConfig,\n\t\t\t&BulkDataConfigurationParser::getAllSenderStreamNames,\n\t\t\t&BulkDataConfigurationParser::getAllSenderFlowNames);\n}\n\nvoid parseReceiverFiles() {\n\tBulkDataConfigurationParser parser;\n\tparseFiles(\"bdReceiverConfigs\", parser,\n\t\t\t&BulkDataConfigurationParser::parseReceiverConfig,\n\t\t\t&BulkDataConfigurationParser::getAllReceiverStreamNames,\n\t\t\t&BulkDataConfigurationParser::getAllReceiverFlowNames);\n}\n\nint main(int args, char *argv[]) {\n\n\tLoggingProxy m_logger(0, 0, 31);\n\tLoggingProxy::init (&m_logger);\n    ACS_CHECK_LOGGER;\n\n    parseSenderFiles();\n    parseReceiverFiles();\n\n\tm_logger.done();\n\tLoggingProxy::done();\n\treturn 0;\n\n}\n<commit_msg>Ommit CVS directory for XML file reading<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: bdNTConfigurationParserTest.cpp,v 1.13 2011\/12\/12 09:48:26 rtobar Exp $\"\n*\n* who       when      what\n* --------  --------  ----------------------------------------------\n* bjeram  2011-04-19  created\n*\/\n#include <stdio.h>\n\n#include \"bulkDataNTConfiguration.h\"\n#include \"bulkDataNTConfigurationParser.h\"\n#include \"ACS_BD_Errors.h\"\n#include <iostream>\n#include <fstream>\n\nusing namespace std;\nusing namespace xercesc;\nusing namespace AcsBulkdata;\nusing namespace ACS_BD_Errors;\n\nvoid printConfigMap(BulkDataConfigurationParser &parser,\n\t\tset<const char *> (BulkDataConfigurationParser::*streamNamesGetter)(void),\n\t\tset<const char *> (BulkDataConfigurationParser::*flowNamesGetter)(const char *)) {\n\n\tset<const char *> streamNames = (parser.*streamNamesGetter)();\n\tif( streamNames.size() == 0 ) {\n\t\tcout << \"No streams found\" << endl;\n\t\treturn;\n\t}\n\n\tcout << \"Number of streams: \" << streamNames.size() << endl;\n\n\tset<const char *>::iterator it;\n\tfor(it = streamNames.begin(); it != streamNames.end(); it++) {\n\n\t\tset<const char *> flowNames = (parser.*flowNamesGetter)(*it);\n\n\t\tcout << \"   Stream name: '\" << *it << \"'\" << endl;\n\t\tcout << \"   Number of flows: \" << flowNames.size() << endl;\n\n\t\tset<const char *>::iterator it2;\n\t\tfor(it2 = flowNames.begin(); it2 != flowNames.end(); it2++)\n\t\t\tcout << \"     Flow name: \" << *it2 << endl;\n\t}\n\n}\n\nvoid parseFiles(const char *directory, BulkDataConfigurationParser &parser,\n\t\tvoid (BulkDataConfigurationParser::*parserMethod)(const char *),\n\t\tset<const char *> (BulkDataConfigurationParser::*streamNamesGetter)(void),\n\t\tset<const char *> (BulkDataConfigurationParser::*flowNamesGetter)(const char *)) {\n\n\tACE_DIRENT **nameList;\n\tint fileCount;\n\n\t\/\/ Parse all receiver configs\n\tfileCount = ACE_OS::scandir(directory, &nameList, 0, 0);\n\tfor(int i=0; i<fileCount; i++) {\n\t\tACE_DIRENT *dirent = nameList[i];\n\n\t\tif( ACE_OS::strcmp(dirent->d_name, \".\") == 0 ||\n\t\t    ACE_OS::strcmp(dirent->d_name, \"..\") == 0 ||\n\t\t    ACE_OS::strcmp(dirent->d_name, \"CVS\") == 0 ) {\n\t\t\tfree(dirent);\n\t\t\tcontinue;\n\t\t}\n\n\n\t\tstring realFilename(directory);\n\t\trealFilename.append(\"\/\");\n\t\trealFilename.append(dirent->d_name);\n\n\t\tcout << \"Parsing file: \" << realFilename << endl;\n\n\t\tifstream file(realFilename.c_str());\n\t\tstring s((std::istreambuf_iterator<char>(file)), istreambuf_iterator<char>());\n\t\tfile.close();\n\n\t\ttry {\n\t\t\tBulkDataConfigurationParser parser;\n\t\t\t(parser.*parserMethod)(s.c_str());\n\t\t\tprintConfigMap(parser, streamNamesGetter, flowNamesGetter);\n\t\t} catch(CDBProblemExImpl &ex) {\n\t\t\tex.log(LM_ERROR);\n\t\t}\n\n\t\tfree(dirent);\n\t}\n\tfree(nameList);\n\n}\n\nvoid parseSenderFiles() {\n\tBulkDataConfigurationParser parser;\n\tparseFiles(\"bdSenderConfigs\", parser,\n\t\t\t&BulkDataConfigurationParser::parseSenderConfig,\n\t\t\t&BulkDataConfigurationParser::getAllSenderStreamNames,\n\t\t\t&BulkDataConfigurationParser::getAllSenderFlowNames);\n}\n\nvoid parseReceiverFiles() {\n\tBulkDataConfigurationParser parser;\n\tparseFiles(\"bdReceiverConfigs\", parser,\n\t\t\t&BulkDataConfigurationParser::parseReceiverConfig,\n\t\t\t&BulkDataConfigurationParser::getAllReceiverStreamNames,\n\t\t\t&BulkDataConfigurationParser::getAllReceiverFlowNames);\n}\n\nint main(int args, char *argv[]) {\n\n\tLoggingProxy m_logger(0, 0, 31);\n\tLoggingProxy::init (&m_logger);\n    ACS_CHECK_LOGGER;\n\n    parseSenderFiles();\n    parseReceiverFiles();\n\n\tm_logger.done();\n\tLoggingProxy::done();\n\treturn 0;\n\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Skip myriad<commit_after><|endoftext|>"}
{"text":"<commit_before>\/**\n * @file ToDartUtils.cpp\n * @brief Functions that convert ModelInterface objects to their Dart counterparts\n * @author A. Huaman Quispe\n * @date 2012 \/ 10 \/ 12\n *\/\n#include \"DartLoader.h\"\n#include <dynamics\/SkeletonDynamics.h>\n#include <kinematics\/Joint.h>\n#include <kinematics\/BodyNode.h>\n#include <dynamics\/BodyNodeDynamics.h>\n#include \"..\/urdf_parser\/urdf_parser.h\"\n\nkinematics::Joint* DartLoader::createDartRootJoint( boost::shared_ptr<const urdf::Link> _rootLink,\n\t\t\t\t\t\t    dynamics::SkeletonDynamics* _skel,\n\t\t\t\t\t\t    bool _createdDummyRoot ) {\n  \n  \/\/ Parent will be NULL. Get root node as child  \n  dynamics::BodyNodeDynamics* rootLoadedNode = getNode( _rootLink->name );\n  kinematics::Joint* rootLoadedJoint;\n  if(debug) printf (\"Root loaded name: %s \\n\", _rootLink->name.c_str());\n\n  if( _createdDummyRoot == false ) {\n\n    \/\/ This joint connects with the world \n    rootLoadedJoint = new kinematics::Joint( NULL,\n\t\t\t\t\t     rootLoadedNode,\n\t\t\t\t\t     \"RootLoadedJoint\" );\n    \n    \/\/ Add Rigid transform \n    add_XyzRpy( rootLoadedJoint, 0, 0, 0, 0, 0, 0 );  \n  }\n\n  else {\n    \/\/ This body node should connect with dummy Root\n    if( _skel->getRoot() == NULL ) { if(debug) printf (\"[X] You did not create the dummy Root! \\n\"); }\n    if(debug) printf (\"Created dummy node name: %s \\n\", _skel->getRoot()->getName() );\n    rootLoadedJoint = new kinematics::Joint( _skel->getRoot(),\n\t\t\t\t\t     rootLoadedNode,\n\t\t\t\t\t     \"RootLoadedJoint\" );\n    \n    \/\/ Add Rigid transform \n    add_XyzRpy( rootLoadedJoint, 0, 0, 0, 0, 0, 0 );  \n\n  }\n\n  return rootLoadedJoint;\n}\n\n\n\/**\n * @function createDartJoint\n *\/\nkinematics::Joint* DartLoader::createDartJoint( boost::shared_ptr<urdf::Joint> _jt,\n\t\t\t\t\t\tdynamics::SkeletonDynamics* _skel ) {\n\n\n  double x, y, z; \n  double roll, pitch, yaw;\n  double val;\n  double vmin, vmax;\n  int axis;\n \n  \/\/ Get parent and child body Nodes\n  const char* jointName = ( _jt->name).c_str();\n  dynamics::BodyNodeDynamics* parent = getNode( _jt->parent_link_name );\n  dynamics::BodyNodeDynamics* child = getNode( _jt->child_link_name );\n  if(debug) printf (\"Joint: %s Parent: %s child : %s \\n\",   jointName, parent->getName(), \n\t\t    child->getName() );\n  \/\/ Create joint\n  kinematics::Joint* joint = new kinematics::Joint( parent,\n\t\t\t\t\t\t    child,\n\t\t\t\t\t\t    jointName );\n  \/\/ Add Rigid transform\n  urdf::Pose p = _jt->parent_to_joint_origin_transform;\n  x = p.position.x;\n  y = p.position.y;\n  z = p.position.z;\n  p.rotation.getRPY( roll, pitch, yaw );\n  add_XyzRpy( joint, x, y, z, roll, pitch, yaw );\n  \n  \/\/ Add DOF if prismatic or revolute joint\n  val = 0;\n  if( _jt->type == urdf::Joint::REVOLUTE || _jt->type == urdf::Joint::PRISMATIC ) {\n    \n    \/\/ Revolute\n    if(   _jt->type == urdf::Joint::REVOLUTE ) {  \n      if( _jt->axis.x == 1 \/*&& _jt->axis.y == 0 && _jt->axis.z == 0 *\/) {\n\taxis = GOLEM_ROLL; \n      } else if( _jt->axis.y == 1 \/* && _jt->axis.x == 0 && _jt->axis.z == 0 *\/ ) {\n\taxis = GOLEM_PITCH; \n      } else if( _jt->axis.z == 1  \/* && _jt->axis.x == 0 && _jt->axis.y == 0 *\/) {\n\taxis = GOLEM_YAW; \n      } else if( _jt->axis.x == -1  \/* && _jt->axis.y == 0 && _jt->axis.z == 0 *\/) {\n\taxis = GOLEM_ROLL; printf(\"Joint %s has negative x \\n\", jointName );\n      } else if( _jt->axis.y == -1 \/* && _jt->axis.x == 0 && _jt->axis.z == 0 *\/ ) { \n\taxis = GOLEM_PITCH;  printf(\"Joint %s has negative y \\n\", jointName );\n      }\n      else if(  _jt->axis.z == -1 \/* && _jt->axis.x == 0 && _jt->axis.y == 0 *\/ ) { \n\taxis = GOLEM_YAW;  printf(\"Joint %s has negative z \\n\", jointName );\n      }\n      else { \n\t\/\/if(debug) \n\tprintf (\"[ERROR] [%s] No axis defined for Revolute DOF (%f %f %f) !  \\n\", jointName, _jt->axis.x, _jt->axis.y, _jt->axis.z ); \n      }\n    }\n    \/\/ Prismatic\n    else if( _jt->type == urdf::Joint::PRISMATIC ) {\n      \n      if( _jt->axis.x == 1 || _jt->axis.x == -1  ) { axis = GOLEM_X; }\n      else if( _jt->axis.y == 1 || _jt->axis.y == -1  ) { axis = GOLEM_Y; }\n      else if( _jt->axis.z == 1 || _jt->axis.z == -1 ) { axis = GOLEM_Z; }\n      else { printf (\" [ERROR] No axis defined for Prismatic DOF! \\n\"); }\n    }\n    \n    vmin = _jt->limits->lower;\n    vmax = _jt->limits->upper;\n    \n    add_DOF( _skel, joint, val, vmin, vmax, axis );\n  }\n  \n  \/\/ Fixed, do not add DOF\n  else if( _jt->type == urdf::Joint::FIXED ) {\n    \/\/if(debug) \n      printf (\"Fixed joint: %s \\n\", jointName );\n  }\n  \n  \/\/ None of the above\n  else {\n    printf (\"[createDartJoint] ERROR: Parsing %s joint: No PRISMATIC or REVOLUTE or FIXED \\n\", jointName );\n  }\n  \n  return joint;\n}\n\n\/**\n * @function createDartNode\n *\/\ndynamics::BodyNodeDynamics* DartLoader::createDartNode( boost::shared_ptr<urdf::Link> _lk,\n\t\t\t\t\t\t\tdynamics::SkeletonDynamics* _skel ) {\n  \n  std::string fullVisualPath;\n  std::string fullCollisionPath;\n\n  const char* lk_name = _lk->name.c_str();\n  if(debug) printf (\"** Creating dart node: %s \\n\", lk_name );\n  \n  dynamics::BodyNodeDynamics* node =  (dynamics::BodyNodeDynamics*) _skel->createBodyNode( lk_name );\n  \n  \/\/ Mesh Loading\n  double mass = 0.1;\n  Eigen::Matrix3d inertia = Eigen::MatrixXd::Identity(3,3);\n  inertia *= 0.1;\n  \n  \/\/ Load Inertial information\n  if( _lk->inertial ) {\n    boost::shared_ptr<urdf::Inertial>inert= (_lk->inertial);\n    \n    \/\/ Load mass\n    mass = inert->mass;\n\n    \/\/ Load Inertia matrix\n    inertia(0,0) = inert->ixx;\n    inertia(0,1) = -1*(inert->ixy);\n    inertia(0,2) = -1*(inert->ixz);\n    \n    inertia(1,0) = -1*(inert->ixy);\n    inertia(1,1) = (inert->iyy);\n    inertia(1,2) = -1*(inert->iyz);\n    \n    inertia(2,0) = -1*(inert->ixz);\n    inertia(2,1) = -1*(inert->iyz);\n    inertia(2,2) = inert->izz;\n    \n    \/\/ Load local CoM\n    Eigen::Vector3d localCOM;\n    localCOM << inert->origin.position.x, \n      inert->origin.position.y, \n      inert->origin.position.z;\n    \/\/ Set it to Node\n    node->setLocalCOM( localCOM );\n    \n    if( debug ) { printf (\"* Mass is: %f \\n\", mass); }\n    if( debug ) { std::cout<< \"* Inertia is: \\n\"<< inertia << std::endl; }\n  }\n  \n  if( !_lk->visual ) {\n    add_Shape( node,  mass, inertia ); \n  }\n  else {\n    \n    \/\/ Get the visTransform from visual\n    \/\/ origin\n    urdf::Pose visPose = _lk->visual->origin;\n\n    if( _lk->visual->geometry->type == urdf::Geometry::MESH ) {\n      \n      boost::shared_ptr<urdf::Mesh> mesh = boost::static_pointer_cast<urdf::Mesh>( _lk->visual->geometry );\n      fullVisualPath = mPath;\n      fullVisualPath.append( mesh->filename );\n\n      \/\/ Check collision\n      if( _lk->collision ) {\n\tif( _lk->collision->geometry->type == urdf::Geometry::MESH ) {\n\t  boost::shared_ptr<urdf::Mesh> collisionMesh = boost::static_pointer_cast<urdf::Mesh>( _lk->collision->geometry );\n\t  fullCollisionPath = mPath;\n\t  fullCollisionPath.append( collisionMesh->filename );\n\t}\n      }\n\n      add_ShapeMesh( node, \n\t\t     (fullVisualPath).c_str(), \n\t\t     mass,\n\t\t     inertia,\n\t\t     (fullCollisionPath).c_str(),\n\t\t     visPose ); \n      \n    }\n    \n    \/\/ Empty\n    else {\n      add_Shape( node, mass, inertia ); \n    }\n  } \/\/ end else : We have visual\n  \n  return node;\n}\n<commit_msg>Do not set the COM by the URDF parser for now to avoid problems, since DART currently centers the geometry at the COM<commit_after>\/**\n * @file ToDartUtils.cpp\n * @brief Functions that convert ModelInterface objects to their Dart counterparts\n * @author A. Huaman Quispe\n * @date 2012 \/ 10 \/ 12\n *\/\n#include \"DartLoader.h\"\n#include <dynamics\/SkeletonDynamics.h>\n#include <kinematics\/Joint.h>\n#include <kinematics\/BodyNode.h>\n#include <dynamics\/BodyNodeDynamics.h>\n#include \"..\/urdf_parser\/urdf_parser.h\"\n\nkinematics::Joint* DartLoader::createDartRootJoint( boost::shared_ptr<const urdf::Link> _rootLink,\n\t\t\t\t\t\t    dynamics::SkeletonDynamics* _skel,\n\t\t\t\t\t\t    bool _createdDummyRoot ) {\n  \n  \/\/ Parent will be NULL. Get root node as child  \n  dynamics::BodyNodeDynamics* rootLoadedNode = getNode( _rootLink->name );\n  kinematics::Joint* rootLoadedJoint;\n  if(debug) printf (\"Root loaded name: %s \\n\", _rootLink->name.c_str());\n\n  if( _createdDummyRoot == false ) {\n\n    \/\/ This joint connects with the world \n    rootLoadedJoint = new kinematics::Joint( NULL,\n\t\t\t\t\t     rootLoadedNode,\n\t\t\t\t\t     \"RootLoadedJoint\" );\n    \n    \/\/ Add Rigid transform \n    add_XyzRpy( rootLoadedJoint, 0, 0, 0, 0, 0, 0 );  \n  }\n\n  else {\n    \/\/ This body node should connect with dummy Root\n    if( _skel->getRoot() == NULL ) { if(debug) printf (\"[X] You did not create the dummy Root! \\n\"); }\n    if(debug) printf (\"Created dummy node name: %s \\n\", _skel->getRoot()->getName() );\n    rootLoadedJoint = new kinematics::Joint( _skel->getRoot(),\n\t\t\t\t\t     rootLoadedNode,\n\t\t\t\t\t     \"RootLoadedJoint\" );\n    \n    \/\/ Add Rigid transform \n    add_XyzRpy( rootLoadedJoint, 0, 0, 0, 0, 0, 0 );  \n\n  }\n\n  return rootLoadedJoint;\n}\n\n\n\/**\n * @function createDartJoint\n *\/\nkinematics::Joint* DartLoader::createDartJoint( boost::shared_ptr<urdf::Joint> _jt,\n\t\t\t\t\t\tdynamics::SkeletonDynamics* _skel ) {\n\n\n  double x, y, z; \n  double roll, pitch, yaw;\n  double val;\n  double vmin, vmax;\n  int axis;\n \n  \/\/ Get parent and child body Nodes\n  const char* jointName = ( _jt->name).c_str();\n  dynamics::BodyNodeDynamics* parent = getNode( _jt->parent_link_name );\n  dynamics::BodyNodeDynamics* child = getNode( _jt->child_link_name );\n  if(debug) printf (\"Joint: %s Parent: %s child : %s \\n\",   jointName, parent->getName(), \n\t\t    child->getName() );\n  \/\/ Create joint\n  kinematics::Joint* joint = new kinematics::Joint( parent,\n\t\t\t\t\t\t    child,\n\t\t\t\t\t\t    jointName );\n  \/\/ Add Rigid transform\n  urdf::Pose p = _jt->parent_to_joint_origin_transform;\n  x = p.position.x;\n  y = p.position.y;\n  z = p.position.z;\n  p.rotation.getRPY( roll, pitch, yaw );\n  add_XyzRpy( joint, x, y, z, roll, pitch, yaw );\n  \n  \/\/ Add DOF if prismatic or revolute joint\n  val = 0;\n  if( _jt->type == urdf::Joint::REVOLUTE || _jt->type == urdf::Joint::PRISMATIC ) {\n    \n    \/\/ Revolute\n    if(   _jt->type == urdf::Joint::REVOLUTE ) {  \n      if( _jt->axis.x == 1 \/*&& _jt->axis.y == 0 && _jt->axis.z == 0 *\/) {\n\taxis = GOLEM_ROLL; \n      } else if( _jt->axis.y == 1 \/* && _jt->axis.x == 0 && _jt->axis.z == 0 *\/ ) {\n\taxis = GOLEM_PITCH; \n      } else if( _jt->axis.z == 1  \/* && _jt->axis.x == 0 && _jt->axis.y == 0 *\/) {\n\taxis = GOLEM_YAW; \n      } else if( _jt->axis.x == -1  \/* && _jt->axis.y == 0 && _jt->axis.z == 0 *\/) {\n\taxis = GOLEM_ROLL; printf(\"Joint %s has negative x \\n\", jointName );\n      } else if( _jt->axis.y == -1 \/* && _jt->axis.x == 0 && _jt->axis.z == 0 *\/ ) { \n\taxis = GOLEM_PITCH;  printf(\"Joint %s has negative y \\n\", jointName );\n      }\n      else if(  _jt->axis.z == -1 \/* && _jt->axis.x == 0 && _jt->axis.y == 0 *\/ ) { \n\taxis = GOLEM_YAW;  printf(\"Joint %s has negative z \\n\", jointName );\n      }\n      else { \n\t\/\/if(debug) \n\tprintf (\"[ERROR] [%s] No axis defined for Revolute DOF (%f %f %f) !  \\n\", jointName, _jt->axis.x, _jt->axis.y, _jt->axis.z ); \n      }\n    }\n    \/\/ Prismatic\n    else if( _jt->type == urdf::Joint::PRISMATIC ) {\n      \n      if( _jt->axis.x == 1 || _jt->axis.x == -1  ) { axis = GOLEM_X; }\n      else if( _jt->axis.y == 1 || _jt->axis.y == -1  ) { axis = GOLEM_Y; }\n      else if( _jt->axis.z == 1 || _jt->axis.z == -1 ) { axis = GOLEM_Z; }\n      else { printf (\" [ERROR] No axis defined for Prismatic DOF! \\n\"); }\n    }\n    \n    vmin = _jt->limits->lower;\n    vmax = _jt->limits->upper;\n    \n    add_DOF( _skel, joint, val, vmin, vmax, axis );\n  }\n  \n  \/\/ Fixed, do not add DOF\n  else if( _jt->type == urdf::Joint::FIXED ) {\n    \/\/if(debug) \n      printf (\"Fixed joint: %s \\n\", jointName );\n  }\n  \n  \/\/ None of the above\n  else {\n    printf (\"[createDartJoint] ERROR: Parsing %s joint: No PRISMATIC or REVOLUTE or FIXED \\n\", jointName );\n  }\n  \n  return joint;\n}\n\n\/**\n * @function createDartNode\n *\/\ndynamics::BodyNodeDynamics* DartLoader::createDartNode( boost::shared_ptr<urdf::Link> _lk,\n\t\t\t\t\t\t\tdynamics::SkeletonDynamics* _skel ) {\n  \n  std::string fullVisualPath;\n  std::string fullCollisionPath;\n\n  const char* lk_name = _lk->name.c_str();\n  if(debug) printf (\"** Creating dart node: %s \\n\", lk_name );\n  \n  dynamics::BodyNodeDynamics* node =  (dynamics::BodyNodeDynamics*) _skel->createBodyNode( lk_name );\n  \n  \/\/ Mesh Loading\n  double mass = 0.1;\n  Eigen::Matrix3d inertia = Eigen::MatrixXd::Identity(3,3);\n  inertia *= 0.1;\n  \n  \/\/ Load Inertial information\n  if( _lk->inertial ) {\n    boost::shared_ptr<urdf::Inertial>inert= (_lk->inertial);\n    \n    \/\/ Load mass\n    mass = inert->mass;\n\n    \/\/ Load Inertia matrix\n    inertia(0,0) = inert->ixx;\n    inertia(0,1) = -1*(inert->ixy);\n    inertia(0,2) = -1*(inert->ixz);\n    \n    inertia(1,0) = -1*(inert->ixy);\n    inertia(1,1) = (inert->iyy);\n    inertia(1,2) = -1*(inert->iyz);\n    \n    inertia(2,0) = -1*(inert->ixz);\n    inertia(2,1) = -1*(inert->iyz);\n    inertia(2,2) = inert->izz;\n    \n    \/\/ Load local CoM\n    Eigen::Vector3d localCOM;\n    localCOM << inert->origin.position.x, \n      inert->origin.position.y, \n      inert->origin.position.z;\n    \/\/ Set it to Node\n    \/\/node->setLocalCOM( localCOM );  \/\/ Temporary Hack: Do not set COM since DART uses that as the location of the mesh\n    \n    if( debug ) { printf (\"* Mass is: %f \\n\", mass); }\n    if( debug ) { std::cout<< \"* Inertia is: \\n\"<< inertia << std::endl; }\n  }\n  \n  if( !_lk->visual ) {\n    add_Shape( node,  mass, inertia ); \n  }\n  else {\n    \n    \/\/ Get the visTransform from visual\n    \/\/ origin\n    urdf::Pose visPose = _lk->visual->origin;\n\n    if( _lk->visual->geometry->type == urdf::Geometry::MESH ) {\n      \n      boost::shared_ptr<urdf::Mesh> mesh = boost::static_pointer_cast<urdf::Mesh>( _lk->visual->geometry );\n      fullVisualPath = mPath;\n      fullVisualPath.append( mesh->filename );\n\n      \/\/ Check collision\n      if( _lk->collision ) {\n\tif( _lk->collision->geometry->type == urdf::Geometry::MESH ) {\n\t  boost::shared_ptr<urdf::Mesh> collisionMesh = boost::static_pointer_cast<urdf::Mesh>( _lk->collision->geometry );\n\t  fullCollisionPath = mPath;\n\t  fullCollisionPath.append( collisionMesh->filename );\n\t}\n      }\n\n      add_ShapeMesh( node, \n\t\t     (fullVisualPath).c_str(), \n\t\t     mass,\n\t\t     inertia,\n\t\t     (fullCollisionPath).c_str(),\n\t\t     visPose ); \n      \n    }\n    \n    \/\/ Empty\n    else {\n      add_Shape( node, mass, inertia ); \n    }\n  } \/\/ end else : We have visual\n  \n  return node;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <map>\n#include \"StaticData.h\"\n#include \"WordLattice.h\"\n#include \"PCNTools.h\"\n#include \"Util.h\"\n#include \"FloydWarshall.h\"\n#include \"TranslationOptionCollectionLattice.h\"\n#include \"TranslationOptionCollectionConfusionNet.h\"\n#include \"moses\/FF\/InputFeature.h\"\n\nnamespace Moses\n{\nWordLattice::WordLattice()\n{\n  UTIL_THROW_IF2(&InputFeature::Instance() == NULL,\n\t\t  \"Input feature must be specified\");\n}\n\nsize_t WordLattice::GetColumnIncrement(size_t i, size_t j) const\n{\n  return next_nodes[i][j];\n}\n\nvoid WordLattice::Print(std::ostream& out) const\n{\n  out<<\"word lattice: \"<<data.size()<<\"\\n\";\n  for(size_t i=0; i<data.size(); ++i) {\n    out<<i<<\" -- \";\n    for(size_t j=0; j<data[i].size(); ++j) {\n      out<<\"(\"<<data[i][j].first.ToString()<<\", \";\n\n      \/\/ dense\n      std::vector<float>::const_iterator iterDense;\n      for(iterDense = data[i][j].second.denseScores.begin(); iterDense < data[i][j].second.denseScores.end(); ++iterDense) {\n        out<<\", \"<<*iterDense;\n      }\n\n      \/\/ sparse\n      std::map<StringPiece, float>::const_iterator iterSparse;\n      for(iterSparse = data[i][j].second.sparseScores.begin(); iterSparse != data[i][j].second.sparseScores.end(); ++iterSparse) {\n        out << \", \" << iterSparse->first << \"=\" << iterSparse->second;\n      }\n\n      out << GetColumnIncrement(i,j) << \") \";\n    }\n\n    out<<\"\\n\";\n  }\n  out<<\"\\n\\n\";\n}\n\nint WordLattice::InitializeFromPCNDataType(const PCN::CN& cn, const std::vector<FactorType>& factorOrder, const std::string& debug_line)\n{\n  const StaticData &staticData = StaticData::Instance();\n  const InputFeature &inputFeature = InputFeature::Instance();\n  size_t numInputScores = inputFeature.GetNumInputScores();\n  size_t numRealWordCount = inputFeature.GetNumRealWordsInInput();\n\n  size_t maxSizePhrase = StaticData::Instance().GetMaxPhraseLength();\n\n  bool addRealWordCount = (numRealWordCount > 0);\n\n  \/\/when we have one more weight than params, we add a word count feature\n  data.resize(cn.size());\n  next_nodes.resize(cn.size());\n  for(size_t i=0; i<cn.size(); ++i) {\n    const PCN::CNCol& col = cn[i];\n    if (col.empty()) return false;\n    data[i].resize(col.size());\n    next_nodes[i].resize(col.size());\n    for (size_t j=0; j<col.size(); ++j) {\n      const PCN::CNAlt& alt = col[j];\n\n      \/\/check for correct number of link parameters\n      if (alt.m_denseFeatures.size() != numInputScores) {\n        TRACE_ERR(\"ERROR: need \" << numInputScores << \" link parameters, found \" << alt.m_denseFeatures.size() << \" while reading column \" << i << \" from \" << debug_line << \"\\n\");\n        return false;\n      }\n\n      \/\/check each element for bounds\n      std::vector<float>::const_iterator probsIterator;\n      data[i][j].second = std::vector<float>(0);\n      for(probsIterator = alt.m_denseFeatures.begin(); probsIterator < alt.m_denseFeatures.end(); probsIterator++) {\n        IFVERBOSE(1) {\n          if (*probsIterator < 0.0f) {\n            TRACE_ERR(\"WARN: neg probability: \" << *probsIterator << \"\\n\");\n            \/\/*probsIterator = 0.0f;\n          }\n          if (*probsIterator > 1.0f) {\n            TRACE_ERR(\"WARN: probability > 1: \" << *probsIterator << \"\\n\");\n            \/\/*probsIterator = 1.0f;\n          }\n        }\n\n        float score = std::max(static_cast<float>(log(*probsIterator)), LOWEST_SCORE);\n        ScorePair &scorePair = data[i][j].second;\n        scorePair.denseScores.push_back(score);\n      }\n      \/\/store 'real' word count in last feature if we have one more weight than we do arc scores and not epsilon\n      if (addRealWordCount) {\n        \/\/only add count if not epsilon\n        float value = (alt.m_word==\"\" || alt.m_word==EPSILON) ? 0.0f : -1.0f;\n        data[i][j].second.denseScores.push_back(value);\n      }\n      String2Word(alt.m_word, data[i][j]. first, factorOrder);\n      next_nodes[i][j] = alt.m_next;\n\n      if(next_nodes[i][j] > maxSizePhrase) {\n        TRACE_ERR(\"ERROR: Jump length \" << next_nodes[i][j] << \" in word lattice exceeds maximum phrase length \" << maxSizePhrase << \".\\n\");\n        TRACE_ERR(\"ERROR: Increase max-phrase-length to process this lattice.\\n\");\n        return false;\n      }\n    }\n  }\n  if (!cn.empty()) {\n    std::vector<std::vector<bool> > edges(0);\n    this->GetAsEdgeMatrix(edges);\n    floyd_warshall(edges,distances);\n\n    IFVERBOSE(2) {\n      TRACE_ERR(\"Shortest paths:\\n\");\n      for (size_t i=0; i<edges.size(); ++i) {\n        for (size_t j=0; j<edges.size(); ++j) {\n          int d = distances[i][j];\n          if (d > 99999) {\n            d=-1;\n          }\n          TRACE_ERR(\"\\t\" << d);\n        }\n        TRACE_ERR(\"\\n\");\n      }\n    }\n  }\n  return !cn.empty();\n}\n\nint WordLattice::Read(std::istream& in,const std::vector<FactorType>& factorOrder)\n{\n  Clear();\n  std::string line;\n  if(!getline(in,line)) return 0;\n  std::map<std::string, std::string> meta=ProcessAndStripSGML(line);\n  if (meta.find(\"id\") != meta.end()) {\n    this->SetTranslationId(atol(meta[\"id\"].c_str()));\n  }\n\n  PCN::CN cn = PCN::parsePCN(line);\n  return InitializeFromPCNDataType(cn, factorOrder, line);\n}\n\nvoid WordLattice::GetAsEdgeMatrix(std::vector<std::vector<bool> >& edges) const\n{\n  edges.resize(data.size()+1,std::vector<bool>(data.size()+1, false));\n  for (size_t i=0; i<data.size(); ++i) {\n    for (size_t j=0; j<data[i].size(); ++j) {\n      edges[i][i+next_nodes[i][j]] = true;\n    }\n  }\n}\n\nint WordLattice::ComputeDistortionDistance(const WordsRange& prev, const WordsRange& current) const\n{\n  int result;\n\n  if (prev.GetStartPos() == NOT_FOUND && current.GetStartPos() == 0) {\n    result = 0;\n\n    VERBOSE(4, \"Word lattice distortion: monotonic initial step\\n\");\n  } else if (prev.GetEndPos()+1 == current.GetStartPos()) {\n    result = 0;\n\n    VERBOSE(4, \"Word lattice distortion: monotonic step from \" << prev.GetEndPos() << \" to \" << current.GetStartPos() << \"\\n\");\n  } else if (prev.GetStartPos() == NOT_FOUND) {\n    result = distances[0][current.GetStartPos()];\n\n    VERBOSE(4, \"Word lattice distortion: initial step from 0 to \" << current.GetStartPos() << \" of length \" << result << \"\\n\");\n    if (result < 0 || result > 99999) {\n      TRACE_ERR(\"prev: \" << prev << \"\\ncurrent: \" << current << \"\\n\");\n      TRACE_ERR(\"A: got a weird distance from 0 to \" << (current.GetStartPos()+1) << \" of \" << result << \"\\n\");\n    }\n  } else if (prev.GetEndPos() > current.GetStartPos()) {\n    result = distances[current.GetStartPos()][prev.GetEndPos() + 1];\n\n    VERBOSE(4, \"Word lattice distortion: backward step from \" << (prev.GetEndPos()+1) << \" to \" << current.GetStartPos() << \" of length \" << result << \"\\n\");\n    if (result < 0 || result > 99999) {\n      TRACE_ERR(\"prev: \" << prev << \"\\ncurrent: \" << current << \"\\n\");\n      TRACE_ERR(\"B: got a weird distance from \"<< current.GetStartPos() << \" to \" << prev.GetEndPos()+1 << \" of \" << result << \"\\n\");\n    }\n  } else {\n    result = distances[prev.GetEndPos() + 1][current.GetStartPos()];\n\n    VERBOSE(4, \"Word lattice distortion: forward step from \" << (prev.GetEndPos()+1) << \" to \" << current.GetStartPos() << \" of length \" << result << \"\\n\");\n    if (result < 0 || result > 99999) {\n      TRACE_ERR(\"prev: \" << prev << \"\\ncurrent: \" << current << \"\\n\");\n      TRACE_ERR(\"C: got a weird distance from \"<< prev.GetEndPos()+1 << \" to \" << current.GetStartPos() << \" of \" << result << \"\\n\");\n    }\n  }\n\n  return result;\n}\n\nbool WordLattice::CanIGetFromAToB(size_t start, size_t end) const\n{\n  \/\/  std::cerr << \"CanIgetFromAToB(\" << start << \",\" << end << \")=\" << distances[start][end] << std::endl;\n  return distances[start][end] < 100000;\n}\n\nTranslationOptionCollection*\nWordLattice::CreateTranslationOptionCollection() const\n{\n  size_t maxNoTransOptPerCoverage = StaticData::Instance().GetMaxNoTransOptPerCoverage();\n  float translationOptionThreshold = StaticData::Instance().GetTranslationOptionThreshold();\n\n  TranslationOptionCollection *rv = NULL;\n  \/\/rv = new TranslationOptionCollectionConfusionNet(*this, maxNoTransOptPerCoverage, translationOptionThreshold);\n\n  if (StaticData::Instance().GetUseLegacyPT()) {\n    rv = new TranslationOptionCollectionConfusionNet(*this, maxNoTransOptPerCoverage, translationOptionThreshold);\n  }\n  else {\n\trv = new TranslationOptionCollectionLattice(*this, maxNoTransOptPerCoverage, translationOptionThreshold);\n  }\n\n  assert(rv);\n  return rv;\n}\n\n\nstd::ostream& operator<<(std::ostream &out, const WordLattice &obj)\n{\n  out << \"next_nodes=\";\n  for (size_t i = 0; i < obj.next_nodes.size(); ++i) {\n    out << i << \":\";\n\n    const std::vector<size_t> &inner = obj.next_nodes[i];\n    for (size_t j = 0; j < inner.size(); ++j) {\n      out << inner[j] << \" \";\n    }\n  }\n\n  out << \"distances=\";\n  for (size_t i = 0; i < obj.distances.size(); ++i) {\n    out << i << \":\";\n\n    const std::vector<int> &inner = obj.distances[i];\n    for (size_t j = 0; j < inner.size(); ++j) {\n      out << inner[j] << \" \";\n    }\n  }\n  return out;\n}\n\n} \/\/ namespace\n\n<commit_msg>Replaced calls to String2Word by calls to Word::CreateFromString(). String2Word is deprecated (code duplication) and should be removed. Some reformatting for readability.<commit_after>#include <map>\n#include \"StaticData.h\"\n#include \"WordLattice.h\"\n#include \"PCNTools.h\"\n#include \"Util.h\"\n#include \"FloydWarshall.h\"\n#include \"TranslationOptionCollectionLattice.h\"\n#include \"TranslationOptionCollectionConfusionNet.h\"\n#include \"moses\/FF\/InputFeature.h\"\n\nnamespace Moses\n{\nWordLattice::WordLattice()\n{\n  UTIL_THROW_IF2(&InputFeature::Instance() == NULL,\n\t\t  \"Input feature must be specified\");\n}\n\nsize_t WordLattice::GetColumnIncrement(size_t i, size_t j) const\n{\n  return next_nodes[i][j];\n}\n\nvoid WordLattice::Print(std::ostream& out) const\n{\n  out<<\"word lattice: \"<<data.size()<<\"\\n\";\n  for(size_t i=0; i<data.size(); ++i) {\n    out<<i<<\" -- \";\n    for(size_t j=0; j<data[i].size(); ++j) {\n      out<<\"(\"<<data[i][j].first.ToString()<<\", \";\n\n      \/\/ dense\n      std::vector<float>::const_iterator iterDense;\n      for(iterDense = data[i][j].second.denseScores.begin(); iterDense < data[i][j].second.denseScores.end(); ++iterDense) {\n        out<<\", \"<<*iterDense;\n      }\n\n      \/\/ sparse\n      std::map<StringPiece, float>::const_iterator iterSparse;\n      for(iterSparse = data[i][j].second.sparseScores.begin(); iterSparse != data[i][j].second.sparseScores.end(); ++iterSparse) {\n        out << \", \" << iterSparse->first << \"=\" << iterSparse->second;\n      }\n\n      out << GetColumnIncrement(i,j) << \") \";\n    }\n\n    out<<\"\\n\";\n  }\n  out<<\"\\n\\n\";\n}\n\nint \nWordLattice::\nInitializeFromPCNDataType\n(const PCN::CN& cn, \n const std::vector<FactorType>& factorOrder, \n const std::string& debug_line)\n{\n  const StaticData &staticData = StaticData::Instance();\n  const InputFeature &inputFeature = InputFeature::Instance();\n  size_t numInputScores = inputFeature.GetNumInputScores();\n  size_t numRealWordCount = inputFeature.GetNumRealWordsInInput();\n\n  size_t maxSizePhrase = StaticData::Instance().GetMaxPhraseLength();\n\n  bool addRealWordCount = (numRealWordCount > 0);\n\n  \/\/when we have one more weight than params, we add a word count feature\n  data.resize(cn.size());\n  next_nodes.resize(cn.size());\n  for(size_t i=0; i<cn.size(); ++i) {\n    const PCN::CNCol& col = cn[i];\n    if (col.empty()) return false;\n    data[i].resize(col.size());\n    next_nodes[i].resize(col.size());\n    for (size_t j=0; j<col.size(); ++j) {\n      const PCN::CNAlt& alt = col[j];\n\n      \/\/check for correct number of link parameters\n      if (alt.m_denseFeatures.size() != numInputScores) {\n        TRACE_ERR(\"ERROR: need \" << numInputScores \n\t\t  << \" link parameters, found \" \n\t\t  << alt.m_denseFeatures.size() \n\t\t  << \" while reading column \" << i \n\t\t  << \" from \" << debug_line << \"\\n\");\n        return false;\n      }\n\n      \/\/check each element for bounds\n      std::vector<float>::const_iterator probsIterator;\n      data[i][j].second = std::vector<float>(0);\n      for(probsIterator = alt.m_denseFeatures.begin(); \n\t  probsIterator < alt.m_denseFeatures.end(); \n\t  probsIterator++) {\n        IFVERBOSE(1) {\n          if (*probsIterator < 0.0f) {\n            TRACE_ERR(\"WARN: neg probability: \" << *probsIterator << \"\\n\");\n            \/\/*probsIterator = 0.0f;\n          }\n          if (*probsIterator > 1.0f) {\n            TRACE_ERR(\"WARN: probability > 1: \" << *probsIterator << \"\\n\");\n            \/\/*probsIterator = 1.0f;\n          }\n        }\n\n        float score = std::max(static_cast<float>(log(*probsIterator)), LOWEST_SCORE);\n        ScorePair &scorePair = data[i][j].second;\n        scorePair.denseScores.push_back(score);\n      }\n      \/\/store 'real' word count in last feature if we have one more weight than we do arc scores and not epsilon\n      if (addRealWordCount) {\n        \/\/only add count if not epsilon\n        float value = (alt.m_word==\"\" || alt.m_word==EPSILON) ? 0.0f : -1.0f;\n        data[i][j].second.denseScores.push_back(value);\n      }\n      Word& w = data[i][j].first;\n      w.CreateFromString(Input,factorOrder,StringPiece(alt.m_word),false);\n      \/\/ String2Word(alt.m_word, data[i][j]. first, factorOrder);\n      next_nodes[i][j] = alt.m_next;\n\n      if(next_nodes[i][j] > maxSizePhrase) {\n        TRACE_ERR(\"ERROR: Jump length \" << next_nodes[i][j] << \" in word lattice exceeds maximum phrase length \" << maxSizePhrase << \".\\n\");\n        TRACE_ERR(\"ERROR: Increase max-phrase-length to process this lattice.\\n\");\n        return false;\n      }\n    }\n  }\n  if (!cn.empty()) {\n    std::vector<std::vector<bool> > edges(0);\n    this->GetAsEdgeMatrix(edges);\n    floyd_warshall(edges,distances);\n\n    IFVERBOSE(2) {\n      TRACE_ERR(\"Shortest paths:\\n\");\n      for (size_t i=0; i<edges.size(); ++i) {\n        for (size_t j=0; j<edges.size(); ++j) {\n          int d = distances[i][j];\n          if (d > 99999) {\n            d=-1;\n          }\n          TRACE_ERR(\"\\t\" << d);\n        }\n        TRACE_ERR(\"\\n\");\n      }\n    }\n  }\n  return !cn.empty();\n}\n\nint WordLattice::Read(std::istream& in,const std::vector<FactorType>& factorOrder)\n{\n  Clear();\n  std::string line;\n  if(!getline(in,line)) return 0;\n  std::map<std::string, std::string> meta=ProcessAndStripSGML(line);\n  if (meta.find(\"id\") != meta.end()) {\n    this->SetTranslationId(atol(meta[\"id\"].c_str()));\n  }\n\n  PCN::CN cn = PCN::parsePCN(line);\n  return InitializeFromPCNDataType(cn, factorOrder, line);\n}\n\nvoid WordLattice::GetAsEdgeMatrix(std::vector<std::vector<bool> >& edges) const\n{\n  edges.resize(data.size()+1,std::vector<bool>(data.size()+1, false));\n  for (size_t i=0; i<data.size(); ++i) {\n    for (size_t j=0; j<data[i].size(); ++j) {\n      edges[i][i+next_nodes[i][j]] = true;\n    }\n  }\n}\n\nint WordLattice::ComputeDistortionDistance(const WordsRange& prev, const WordsRange& current) const\n{\n  int result;\n\n  if (prev.GetStartPos() == NOT_FOUND && current.GetStartPos() == 0) {\n    result = 0;\n\n    VERBOSE(4, \"Word lattice distortion: monotonic initial step\\n\");\n  } else if (prev.GetEndPos()+1 == current.GetStartPos()) {\n    result = 0;\n\n    VERBOSE(4, \"Word lattice distortion: monotonic step from \" << prev.GetEndPos() << \" to \" << current.GetStartPos() << \"\\n\");\n  } else if (prev.GetStartPos() == NOT_FOUND) {\n    result = distances[0][current.GetStartPos()];\n\n    VERBOSE(4, \"Word lattice distortion: initial step from 0 to \" << current.GetStartPos() << \" of length \" << result << \"\\n\");\n    if (result < 0 || result > 99999) {\n      TRACE_ERR(\"prev: \" << prev << \"\\ncurrent: \" << current << \"\\n\");\n      TRACE_ERR(\"A: got a weird distance from 0 to \" << (current.GetStartPos()+1) << \" of \" << result << \"\\n\");\n    }\n  } else if (prev.GetEndPos() > current.GetStartPos()) {\n    result = distances[current.GetStartPos()][prev.GetEndPos() + 1];\n\n    VERBOSE(4, \"Word lattice distortion: backward step from \" << (prev.GetEndPos()+1) << \" to \" << current.GetStartPos() << \" of length \" << result << \"\\n\");\n    if (result < 0 || result > 99999) {\n      TRACE_ERR(\"prev: \" << prev << \"\\ncurrent: \" << current << \"\\n\");\n      TRACE_ERR(\"B: got a weird distance from \"<< current.GetStartPos() << \" to \" << prev.GetEndPos()+1 << \" of \" << result << \"\\n\");\n    }\n  } else {\n    result = distances[prev.GetEndPos() + 1][current.GetStartPos()];\n\n    VERBOSE(4, \"Word lattice distortion: forward step from \" << (prev.GetEndPos()+1) << \" to \" << current.GetStartPos() << \" of length \" << result << \"\\n\");\n    if (result < 0 || result > 99999) {\n      TRACE_ERR(\"prev: \" << prev << \"\\ncurrent: \" << current << \"\\n\");\n      TRACE_ERR(\"C: got a weird distance from \"<< prev.GetEndPos()+1 << \" to \" << current.GetStartPos() << \" of \" << result << \"\\n\");\n    }\n  }\n\n  return result;\n}\n\nbool WordLattice::CanIGetFromAToB(size_t start, size_t end) const\n{\n  \/\/  std::cerr << \"CanIgetFromAToB(\" << start << \",\" << end << \")=\" << distances[start][end] << std::endl;\n  return distances[start][end] < 100000;\n}\n\nTranslationOptionCollection*\nWordLattice::CreateTranslationOptionCollection() const\n{\n  size_t maxNoTransOptPerCoverage = StaticData::Instance().GetMaxNoTransOptPerCoverage();\n  float translationOptionThreshold = StaticData::Instance().GetTranslationOptionThreshold();\n\n  TranslationOptionCollection *rv = NULL;\n  \/\/rv = new TranslationOptionCollectionConfusionNet(*this, maxNoTransOptPerCoverage, translationOptionThreshold);\n\n  if (StaticData::Instance().GetUseLegacyPT()) {\n    rv = new TranslationOptionCollectionConfusionNet(*this, maxNoTransOptPerCoverage, translationOptionThreshold);\n  }\n  else {\n\trv = new TranslationOptionCollectionLattice(*this, maxNoTransOptPerCoverage, translationOptionThreshold);\n  }\n\n  assert(rv);\n  return rv;\n}\n\n\nstd::ostream& operator<<(std::ostream &out, const WordLattice &obj)\n{\n  out << \"next_nodes=\";\n  for (size_t i = 0; i < obj.next_nodes.size(); ++i) {\n    out << i << \":\";\n\n    const std::vector<size_t> &inner = obj.next_nodes[i];\n    for (size_t j = 0; j < inner.size(); ++j) {\n      out << inner[j] << \" \";\n    }\n  }\n\n  out << \"distances=\";\n  for (size_t i = 0; i < obj.distances.size(); ++i) {\n    out << i << \":\";\n\n    const std::vector<int> &inner = obj.distances[i];\n    for (size_t j = 0; j < inner.size(); ++j) {\n      out << inner[j] << \" \";\n    }\n  }\n  return out;\n}\n\n} \/\/ namespace\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>fdo#39007: blind fix for renamed OS X restore-state file<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2016-2021 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#if defined(HAVE_CONFIG_H)\n#include <config\/bitcoin-config.h>\n#endif\n\n#include <wallet\/wallettool.h>\n\n#include <fs.h>\n#include <tinyformat.h>\n#include <univalue.h>\n#include <util\/system.h>\n#include <util\/translation.h>\n#include <wallet\/dump.h>\n#include <wallet\/salvage.h>\n#include <wallet\/wallet.h>\n#include <wallet\/walletutil.h>\n\n#include <cassert>\n#include <fstream>\n#include <string>\n\nnamespace wallet {\n\nUniValue ProcessDescriptorImport(CWallet& wallet, const UniValue& data, const int64_t timestamp)\n    EXCLUSIVE_LOCKS_REQUIRED(wallet.cs_wallet);\n\nnamespace WalletTool {\n\n\/\/ The standard wallet deleter function blocks on the validation interface\n\/\/ queue, which doesn't exist for the bitcoin-wallet. Define our own\n\/\/ deleter here.\nstatic void WalletToolReleaseWallet(CWallet* wallet)\n{\n    wallet->WalletLogPrintf(\"Releasing wallet\\n\");\n    wallet->Close();\n    delete wallet;\n}\n\nstatic void WalletCreate(CWallet* wallet_instance, uint64_t wallet_creation_flags)\n{\n    LOCK(wallet_instance->cs_wallet);\n\n    wallet_instance->SetMinVersion(FEATURE_LATEST);\n    wallet_instance->AddWalletFlags(wallet_creation_flags);\n\n    if (wallet_instance->IsWalletFlagSet(WALLET_FLAG_BLANK_WALLET)) {\n        return;\n    }\n\n    if (!wallet_instance->IsWalletFlagSet(WALLET_FLAG_DESCRIPTORS)) {\n        auto spk_man = wallet_instance->GetOrCreateLegacyScriptPubKeyMan();\n        spk_man->SetupGeneration(false);\n    } else {\n        wallet_instance->SetupDescriptorScriptPubKeyMans();\n    }\n\n    tfm::format(std::cout, \"Topping up keypool...\\n\");\n    wallet_instance->TopUpKeyPool();\n}\n\nstatic const std::shared_ptr<CWallet> MakeWallet(const std::string& name, const fs::path& path, const ArgsManager& args, DatabaseOptions options)\n{\n    DatabaseStatus status;\n    bilingual_str error;\n    std::unique_ptr<WalletDatabase> database = MakeDatabase(path, options, status, error);\n    if (!database) {\n        tfm::format(std::cerr, \"%s\\n\", error.original);\n        return nullptr;\n    }\n\n    \/\/ dummy chain interface\n    std::shared_ptr<CWallet> wallet_instance{new CWallet(nullptr \/* chain *\/, name, args, std::move(database)), WalletToolReleaseWallet};\n    DBErrors load_wallet_ret;\n    try {\n        load_wallet_ret = wallet_instance->LoadWallet();\n    } catch (const std::runtime_error&) {\n        tfm::format(std::cerr, \"Error loading %s. Is wallet being used by another process?\\n\", name);\n        return nullptr;\n    }\n\n    if (load_wallet_ret != DBErrors::LOAD_OK) {\n        wallet_instance = nullptr;\n        if (load_wallet_ret == DBErrors::CORRUPT) {\n            tfm::format(std::cerr, \"Error loading %s: Wallet corrupted\", name);\n            return nullptr;\n        } else if (load_wallet_ret == DBErrors::NONCRITICAL_ERROR) {\n            tfm::format(std::cerr, \"Error reading %s! All keys read correctly, but transaction data\"\n                            \" or address book entries might be missing or incorrect.\",\n                name);\n        } else if (load_wallet_ret == DBErrors::TOO_NEW) {\n            tfm::format(std::cerr, \"Error loading %s: Wallet requires newer version of %s\",\n                name, PACKAGE_NAME);\n            return nullptr;\n        } else if (load_wallet_ret == DBErrors::NEED_REWRITE) {\n            tfm::format(std::cerr, \"Wallet needed to be rewritten: restart %s to complete\", PACKAGE_NAME);\n            return nullptr;\n        } else if (load_wallet_ret == DBErrors::NEED_RESCAN) {\n            tfm::format(std::cerr, \"Error reading %s! Some transaction data might be missing or\"\n                           \" incorrect. Wallet requires a rescan.\",\n                name);\n        } else {\n            tfm::format(std::cerr, \"Error loading %s\", name);\n            return nullptr;\n        }\n    }\n\n    if (options.require_create) WalletCreate(wallet_instance.get(), options.create_flags);\n\n    return wallet_instance;\n}\n\nstatic void WalletShowInfo(CWallet* wallet_instance)\n{\n    LOCK(wallet_instance->cs_wallet);\n\n    tfm::format(std::cout, \"Wallet info\\n===========\\n\");\n    tfm::format(std::cout, \"Name: %s\\n\", wallet_instance->GetName());\n    tfm::format(std::cout, \"Format: %s\\n\", wallet_instance->GetDatabase().Format());\n    tfm::format(std::cout, \"Descriptors: %s\\n\", wallet_instance->IsWalletFlagSet(WALLET_FLAG_DESCRIPTORS) ? \"yes\" : \"no\");\n    tfm::format(std::cout, \"Encrypted: %s\\n\", wallet_instance->IsCrypted() ? \"yes\" : \"no\");\n    tfm::format(std::cout, \"HD (hd seed available): %s\\n\", wallet_instance->IsHDEnabled() ? \"yes\" : \"no\");\n    tfm::format(std::cout, \"Keypool Size: %u\\n\", wallet_instance->GetKeyPoolSize());\n    tfm::format(std::cout, \"Transactions: %zu\\n\", wallet_instance->mapWallet.size());\n    tfm::format(std::cout, \"Address Book: %zu\\n\", wallet_instance->m_address_book.size());\n}\n\nstatic bool ReadAndParseColdcardFile(const fs::path& path, UniValue& decriptors)\n{\n    std::ifstream file;\n    file.open(path);\n    if (!file.is_open()) {\n        tfm::format(std::cerr, \"%s. Please check permissions.\\n\", fs::PathToString(path));\n        return false;\n    }\n\n    std::string line;\n    while (std::getline(file, line)) {\n        if (line.substr(0, 22) == \"importdescriptors \\'[{\\\"\") break;\n    }\n\n    file.close();\n\n    decriptors.clear();\n    if (!decriptors.read(line.substr(19, line.size() - 20))) {\n        tfm::format(std::cerr, \"Unable to parse %s\\n\", fs::PathToString(path));\n        return false;\n    }\n\n    assert(decriptors.isArray());\n    return true;\n}\n\nbool ExecuteWalletToolFunc(const ArgsManager& args, const std::string& command)\n{\n    if (args.IsArgSet(\"-format\") && command != \"createfromdump\") {\n        tfm::format(std::cerr, \"The -format option can only be used with the \\\"createfromdump\\\" command.\\n\");\n        return false;\n    }\n    if (args.IsArgSet(\"-dumpfile\") && command != \"dump\" && command != \"createfromdump\" && command != \"importfromcoldcard\") {\n        tfm::format(std::cerr, \"The -dumpfile option can only be used with the \\\"dump\\\", \\\"createfromdump\\\" and \\\"importfromcoldcard\\\" commands.\\n\");\n        return false;\n    }\n    if (args.IsArgSet(\"-descriptors\") && command != \"create\") {\n        tfm::format(std::cerr, \"The -descriptors option can only be used with the 'create' command.\\n\");\n        return false;\n    }\n    if (args.IsArgSet(\"-legacy\") && command != \"create\") {\n        tfm::format(std::cerr, \"The -legacy option can only be used with the 'create' command.\\n\");\n        return false;\n    }\n    if (command == \"create\" && !args.IsArgSet(\"-wallet\")) {\n        tfm::format(std::cerr, \"Wallet name must be provided when creating a new wallet.\\n\");\n        return false;\n    }\n    const std::string name = args.GetArg(\"-wallet\", \"\");\n    const fs::path path = fsbridge::AbsPathJoin(GetWalletDir(), fs::PathFromString(name));\n\n    if (command == \"create\") {\n        DatabaseOptions options;\n        options.require_create = true;\n        \/\/ If -legacy is set, use it. Otherwise default to false.\n        bool make_legacy = args.GetBoolArg(\"-legacy\", false);\n        \/\/ If neither -legacy nor -descriptors is set, default to true. If -descriptors is set, use its value.\n        bool make_descriptors = (!args.IsArgSet(\"-descriptors\") && !args.IsArgSet(\"-legacy\")) || (args.IsArgSet(\"-descriptors\") && args.GetBoolArg(\"-descriptors\", true));\n        if (make_legacy && make_descriptors) {\n            tfm::format(std::cerr, \"Only one of -legacy or -descriptors can be set to true, not both\\n\");\n            return false;\n        }\n        if (!make_legacy && !make_descriptors) {\n            tfm::format(std::cerr, \"One of -legacy or -descriptors must be set to true (or omitted)\\n\");\n            return false;\n        }\n        if (make_descriptors) {\n            options.create_flags |= WALLET_FLAG_DESCRIPTORS;\n            options.require_format = DatabaseFormat::SQLITE;\n        }\n\n        const std::shared_ptr<CWallet> wallet_instance = MakeWallet(name, path, args, options);\n        if (wallet_instance) {\n            WalletShowInfo(wallet_instance.get());\n            wallet_instance->Close();\n        }\n    } else if (command == \"info\") {\n        DatabaseOptions options;\n        options.require_existing = true;\n        const std::shared_ptr<CWallet> wallet_instance = MakeWallet(name, path, args, options);\n        if (!wallet_instance) return false;\n        WalletShowInfo(wallet_instance.get());\n        wallet_instance->Close();\n    } else if (command == \"salvage\") {\n#ifdef USE_BDB\n        bilingual_str error;\n        std::vector<bilingual_str> warnings;\n        bool ret = RecoverDatabaseFile(path, error, warnings);\n        if (!ret) {\n            for (const auto& warning : warnings) {\n                tfm::format(std::cerr, \"%s\\n\", warning.original);\n            }\n            if (!error.empty()) {\n                tfm::format(std::cerr, \"%s\\n\", error.original);\n            }\n        }\n        return ret;\n#else\n        tfm::format(std::cerr, \"Salvage command is not available as BDB support is not compiled\");\n        return false;\n#endif\n    } else if (command == \"dump\") {\n        DatabaseOptions options;\n        options.require_existing = true;\n        const std::shared_ptr<CWallet> wallet_instance = MakeWallet(name, path, args, options);\n        if (!wallet_instance) return false;\n        bilingual_str error;\n        bool ret = DumpWallet(*wallet_instance, error);\n        if (!ret && !error.empty()) {\n            tfm::format(std::cerr, \"%s\\n\", error.original);\n            return ret;\n        }\n        tfm::format(std::cout, \"The dumpfile may contain private keys. To ensure the safety of your Bitcoin, do not share the dumpfile.\\n\");\n        return ret;\n    } else if (command == \"createfromdump\") {\n        bilingual_str error;\n        std::vector<bilingual_str> warnings;\n        bool ret = CreateFromDump(name, path, error, warnings);\n        for (const auto& warning : warnings) {\n            tfm::format(std::cout, \"%s\\n\", warning.original);\n        }\n        if (!ret && !error.empty()) {\n            tfm::format(std::cerr, \"%s\\n\", error.original);\n        }\n        return ret;\n    } else if (command == \"importfromcoldcard\") {\n        std::string filename = gArgs.GetArg(\"-dumpfile\", \"\");\n        if (filename.empty()) {\n            tfm::format(std::cerr, \"To use importfromcoldcard, -dumpfile=<filename> must be provided.\\n\");\n            return false;\n        }\n\n        const fs::path import_file_path{fs::absolute(fs::PathFromString(filename))};\n        if (!fs::exists(import_file_path)) {\n            tfm::format(std::cerr, \"File %s does not exist.\\n\", fs::PathToString(import_file_path));\n            return false;\n        }\n\n        UniValue descriptors;\n        if (!ReadAndParseColdcardFile(import_file_path, descriptors)) {\n            return false;\n        }\n\n        DatabaseOptions options;\n        options.require_create = true;\n        options.create_flags |= WALLET_FLAG_DESCRIPTORS;\n        options.create_flags |= WALLET_FLAG_DISABLE_PRIVATE_KEYS;\n        options.create_flags |= WALLET_FLAG_BLANK_WALLET;\n        options.require_format = DatabaseFormat::SQLITE;\n        std::shared_ptr<CWallet> wallet_instance = MakeWallet(name, path, gArgs, options);\n        if (!wallet_instance) {\n            return false;\n        }\n\n        LOCK(wallet_instance->cs_wallet);\n        for (const UniValue& descriptor : descriptors.getValues()) {\n            const UniValue result = ProcessDescriptorImport(*wallet_instance, descriptor, 0);\n            tfm::format(std::cerr, \"%s\\n\", result.write(2));\n        }\n\n        WalletShowInfo(wallet_instance.get());\n        wallet_instance->Close();\n    } else {\n        tfm::format(std::cerr, \"Invalid command: %s\\n\", command);\n        return false;\n    }\n\n    return true;\n}\n} \/\/ namespace WalletTool\n} \/\/ namespace wallet\n<commit_msg>wallettool: Add experimental warning to importfromcoldcard command<commit_after>\/\/ Copyright (c) 2016-2021 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#if defined(HAVE_CONFIG_H)\n#include <config\/bitcoin-config.h>\n#endif\n\n#include <wallet\/wallettool.h>\n\n#include <fs.h>\n#include <tinyformat.h>\n#include <univalue.h>\n#include <util\/system.h>\n#include <util\/translation.h>\n#include <wallet\/dump.h>\n#include <wallet\/salvage.h>\n#include <wallet\/wallet.h>\n#include <wallet\/walletutil.h>\n\n#include <cassert>\n#include <fstream>\n#include <string>\n\nnamespace wallet {\n\nUniValue ProcessDescriptorImport(CWallet& wallet, const UniValue& data, const int64_t timestamp)\n    EXCLUSIVE_LOCKS_REQUIRED(wallet.cs_wallet);\n\nnamespace WalletTool {\n\n\/\/ The standard wallet deleter function blocks on the validation interface\n\/\/ queue, which doesn't exist for the bitcoin-wallet. Define our own\n\/\/ deleter here.\nstatic void WalletToolReleaseWallet(CWallet* wallet)\n{\n    wallet->WalletLogPrintf(\"Releasing wallet\\n\");\n    wallet->Close();\n    delete wallet;\n}\n\nstatic void WalletCreate(CWallet* wallet_instance, uint64_t wallet_creation_flags)\n{\n    LOCK(wallet_instance->cs_wallet);\n\n    wallet_instance->SetMinVersion(FEATURE_LATEST);\n    wallet_instance->AddWalletFlags(wallet_creation_flags);\n\n    if (wallet_instance->IsWalletFlagSet(WALLET_FLAG_BLANK_WALLET)) {\n        return;\n    }\n\n    if (!wallet_instance->IsWalletFlagSet(WALLET_FLAG_DESCRIPTORS)) {\n        auto spk_man = wallet_instance->GetOrCreateLegacyScriptPubKeyMan();\n        spk_man->SetupGeneration(false);\n    } else {\n        wallet_instance->SetupDescriptorScriptPubKeyMans();\n    }\n\n    tfm::format(std::cout, \"Topping up keypool...\\n\");\n    wallet_instance->TopUpKeyPool();\n}\n\nstatic const std::shared_ptr<CWallet> MakeWallet(const std::string& name, const fs::path& path, const ArgsManager& args, DatabaseOptions options)\n{\n    DatabaseStatus status;\n    bilingual_str error;\n    std::unique_ptr<WalletDatabase> database = MakeDatabase(path, options, status, error);\n    if (!database) {\n        tfm::format(std::cerr, \"%s\\n\", error.original);\n        return nullptr;\n    }\n\n    \/\/ dummy chain interface\n    std::shared_ptr<CWallet> wallet_instance{new CWallet(nullptr \/* chain *\/, name, args, std::move(database)), WalletToolReleaseWallet};\n    DBErrors load_wallet_ret;\n    try {\n        load_wallet_ret = wallet_instance->LoadWallet();\n    } catch (const std::runtime_error&) {\n        tfm::format(std::cerr, \"Error loading %s. Is wallet being used by another process?\\n\", name);\n        return nullptr;\n    }\n\n    if (load_wallet_ret != DBErrors::LOAD_OK) {\n        wallet_instance = nullptr;\n        if (load_wallet_ret == DBErrors::CORRUPT) {\n            tfm::format(std::cerr, \"Error loading %s: Wallet corrupted\", name);\n            return nullptr;\n        } else if (load_wallet_ret == DBErrors::NONCRITICAL_ERROR) {\n            tfm::format(std::cerr, \"Error reading %s! All keys read correctly, but transaction data\"\n                            \" or address book entries might be missing or incorrect.\",\n                name);\n        } else if (load_wallet_ret == DBErrors::TOO_NEW) {\n            tfm::format(std::cerr, \"Error loading %s: Wallet requires newer version of %s\",\n                name, PACKAGE_NAME);\n            return nullptr;\n        } else if (load_wallet_ret == DBErrors::NEED_REWRITE) {\n            tfm::format(std::cerr, \"Wallet needed to be rewritten: restart %s to complete\", PACKAGE_NAME);\n            return nullptr;\n        } else if (load_wallet_ret == DBErrors::NEED_RESCAN) {\n            tfm::format(std::cerr, \"Error reading %s! Some transaction data might be missing or\"\n                           \" incorrect. Wallet requires a rescan.\",\n                name);\n        } else {\n            tfm::format(std::cerr, \"Error loading %s\", name);\n            return nullptr;\n        }\n    }\n\n    if (options.require_create) WalletCreate(wallet_instance.get(), options.create_flags);\n\n    return wallet_instance;\n}\n\nstatic void WalletShowInfo(CWallet* wallet_instance)\n{\n    LOCK(wallet_instance->cs_wallet);\n\n    tfm::format(std::cout, \"Wallet info\\n===========\\n\");\n    tfm::format(std::cout, \"Name: %s\\n\", wallet_instance->GetName());\n    tfm::format(std::cout, \"Format: %s\\n\", wallet_instance->GetDatabase().Format());\n    tfm::format(std::cout, \"Descriptors: %s\\n\", wallet_instance->IsWalletFlagSet(WALLET_FLAG_DESCRIPTORS) ? \"yes\" : \"no\");\n    tfm::format(std::cout, \"Encrypted: %s\\n\", wallet_instance->IsCrypted() ? \"yes\" : \"no\");\n    tfm::format(std::cout, \"HD (hd seed available): %s\\n\", wallet_instance->IsHDEnabled() ? \"yes\" : \"no\");\n    tfm::format(std::cout, \"Keypool Size: %u\\n\", wallet_instance->GetKeyPoolSize());\n    tfm::format(std::cout, \"Transactions: %zu\\n\", wallet_instance->mapWallet.size());\n    tfm::format(std::cout, \"Address Book: %zu\\n\", wallet_instance->m_address_book.size());\n}\n\nstatic bool ReadAndParseColdcardFile(const fs::path& path, UniValue& decriptors)\n{\n    std::ifstream file;\n    file.open(path);\n    if (!file.is_open()) {\n        tfm::format(std::cerr, \"%s. Please check permissions.\\n\", fs::PathToString(path));\n        return false;\n    }\n\n    std::string line;\n    while (std::getline(file, line)) {\n        if (line.substr(0, 22) == \"importdescriptors \\'[{\\\"\") break;\n    }\n\n    file.close();\n\n    decriptors.clear();\n    if (!decriptors.read(line.substr(19, line.size() - 20))) {\n        tfm::format(std::cerr, \"Unable to parse %s\\n\", fs::PathToString(path));\n        return false;\n    }\n\n    assert(decriptors.isArray());\n    return true;\n}\n\nbool ExecuteWalletToolFunc(const ArgsManager& args, const std::string& command)\n{\n    if (args.IsArgSet(\"-format\") && command != \"createfromdump\") {\n        tfm::format(std::cerr, \"The -format option can only be used with the \\\"createfromdump\\\" command.\\n\");\n        return false;\n    }\n    if (args.IsArgSet(\"-dumpfile\") && command != \"dump\" && command != \"createfromdump\" && command != \"importfromcoldcard\") {\n        tfm::format(std::cerr, \"The -dumpfile option can only be used with the \\\"dump\\\", \\\"createfromdump\\\" and \\\"importfromcoldcard\\\" commands.\\n\");\n        return false;\n    }\n    if (args.IsArgSet(\"-descriptors\") && command != \"create\") {\n        tfm::format(std::cerr, \"The -descriptors option can only be used with the 'create' command.\\n\");\n        return false;\n    }\n    if (args.IsArgSet(\"-legacy\") && command != \"create\") {\n        tfm::format(std::cerr, \"The -legacy option can only be used with the 'create' command.\\n\");\n        return false;\n    }\n    if (command == \"create\" && !args.IsArgSet(\"-wallet\")) {\n        tfm::format(std::cerr, \"Wallet name must be provided when creating a new wallet.\\n\");\n        return false;\n    }\n    const std::string name = args.GetArg(\"-wallet\", \"\");\n    const fs::path path = fsbridge::AbsPathJoin(GetWalletDir(), fs::PathFromString(name));\n\n    if (command == \"create\") {\n        DatabaseOptions options;\n        options.require_create = true;\n        \/\/ If -legacy is set, use it. Otherwise default to false.\n        bool make_legacy = args.GetBoolArg(\"-legacy\", false);\n        \/\/ If neither -legacy nor -descriptors is set, default to true. If -descriptors is set, use its value.\n        bool make_descriptors = (!args.IsArgSet(\"-descriptors\") && !args.IsArgSet(\"-legacy\")) || (args.IsArgSet(\"-descriptors\") && args.GetBoolArg(\"-descriptors\", true));\n        if (make_legacy && make_descriptors) {\n            tfm::format(std::cerr, \"Only one of -legacy or -descriptors can be set to true, not both\\n\");\n            return false;\n        }\n        if (!make_legacy && !make_descriptors) {\n            tfm::format(std::cerr, \"One of -legacy or -descriptors must be set to true (or omitted)\\n\");\n            return false;\n        }\n        if (make_descriptors) {\n            options.create_flags |= WALLET_FLAG_DESCRIPTORS;\n            options.require_format = DatabaseFormat::SQLITE;\n        }\n\n        const std::shared_ptr<CWallet> wallet_instance = MakeWallet(name, path, args, options);\n        if (wallet_instance) {\n            WalletShowInfo(wallet_instance.get());\n            wallet_instance->Close();\n        }\n    } else if (command == \"info\") {\n        DatabaseOptions options;\n        options.require_existing = true;\n        const std::shared_ptr<CWallet> wallet_instance = MakeWallet(name, path, args, options);\n        if (!wallet_instance) return false;\n        WalletShowInfo(wallet_instance.get());\n        wallet_instance->Close();\n    } else if (command == \"salvage\") {\n#ifdef USE_BDB\n        bilingual_str error;\n        std::vector<bilingual_str> warnings;\n        bool ret = RecoverDatabaseFile(path, error, warnings);\n        if (!ret) {\n            for (const auto& warning : warnings) {\n                tfm::format(std::cerr, \"%s\\n\", warning.original);\n            }\n            if (!error.empty()) {\n                tfm::format(std::cerr, \"%s\\n\", error.original);\n            }\n        }\n        return ret;\n#else\n        tfm::format(std::cerr, \"Salvage command is not available as BDB support is not compiled\");\n        return false;\n#endif\n    } else if (command == \"dump\") {\n        DatabaseOptions options;\n        options.require_existing = true;\n        const std::shared_ptr<CWallet> wallet_instance = MakeWallet(name, path, args, options);\n        if (!wallet_instance) return false;\n        bilingual_str error;\n        bool ret = DumpWallet(*wallet_instance, error);\n        if (!ret && !error.empty()) {\n            tfm::format(std::cerr, \"%s\\n\", error.original);\n            return ret;\n        }\n        tfm::format(std::cout, \"The dumpfile may contain private keys. To ensure the safety of your Bitcoin, do not share the dumpfile.\\n\");\n        return ret;\n    } else if (command == \"createfromdump\") {\n        bilingual_str error;\n        std::vector<bilingual_str> warnings;\n        bool ret = CreateFromDump(name, path, error, warnings);\n        for (const auto& warning : warnings) {\n            tfm::format(std::cout, \"%s\\n\", warning.original);\n        }\n        if (!ret && !error.empty()) {\n            tfm::format(std::cerr, \"%s\\n\", error.original);\n        }\n        return ret;\n    } else if (command == \"importfromcoldcard\") {\n        tfm::format(std::cerr, \"WARNING: The \\\"importfromcoldcard\\\" command is experimental and will likely be removed or changed incompatibly in a future version.\\n\");\n\n        std::string filename = gArgs.GetArg(\"-dumpfile\", \"\");\n        if (filename.empty()) {\n            tfm::format(std::cerr, \"To use importfromcoldcard, -dumpfile=<filename> must be provided.\\n\");\n            return false;\n        }\n\n        const fs::path import_file_path{fs::absolute(fs::PathFromString(filename))};\n        if (!fs::exists(import_file_path)) {\n            tfm::format(std::cerr, \"File %s does not exist.\\n\", fs::PathToString(import_file_path));\n            return false;\n        }\n\n        UniValue descriptors;\n        if (!ReadAndParseColdcardFile(import_file_path, descriptors)) {\n            return false;\n        }\n\n        DatabaseOptions options;\n        options.require_create = true;\n        options.create_flags |= WALLET_FLAG_DESCRIPTORS;\n        options.create_flags |= WALLET_FLAG_DISABLE_PRIVATE_KEYS;\n        options.create_flags |= WALLET_FLAG_BLANK_WALLET;\n        options.require_format = DatabaseFormat::SQLITE;\n        std::shared_ptr<CWallet> wallet_instance = MakeWallet(name, path, gArgs, options);\n        if (!wallet_instance) {\n            return false;\n        }\n\n        LOCK(wallet_instance->cs_wallet);\n        for (const UniValue& descriptor : descriptors.getValues()) {\n            const UniValue result = ProcessDescriptorImport(*wallet_instance, descriptor, 0);\n            tfm::format(std::cerr, \"%s\\n\", result.write(2));\n        }\n\n        WalletShowInfo(wallet_instance.get());\n        wallet_instance->Close();\n    } else {\n        tfm::format(std::cerr, \"Invalid command: %s\\n\", command);\n        return false;\n    }\n\n    return true;\n}\n} \/\/ namespace WalletTool\n} \/\/ namespace wallet\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Module:    itkHessianRecursiveGaussianFilterTest.cxx\n  Language:  C++\n  Date:      $Date$\n  Version:   $Revision$\n\n  Copyright (c) Insight Software Consortium. All rights reserved.\n  See ITKCopyright.txt or http:\/\/www.itk.org\/HTML\/Copyright.htm for details.\n\n     This software is distributed WITHOUT ANY WARRANTY; without even \n     the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR \n     PURPOSE.  See the above copyright notices for more information.\n\n=========================================================================*\/\n#if defined(_MSC_VER)\n#pragma warning ( disable : 4786 )\n#endif\n\n\n\n\n#include <itkHessianRecursiveGaussianImageFilter.h>\n#include <itkImageRegionIteratorWithIndex.h>\n\n\nint itkHessianRecursiveGaussianFilterTest(int, char* [] ) \n{\n\n  \/\/ Define the dimension of the images\n  const unsigned int myDimension = 3;\n\n  \/\/ Declare the types of the images\n  typedef itk::Image<float, myDimension>           myImageType;\n\n  \/\/ Declare the type of the index to access images\n  typedef itk::Index<myDimension>             myIndexType;\n\n  \/\/ Declare the type of the size \n  typedef itk::Size<myDimension>              mySizeType;\n\n  \/\/ Declare the type of the Region\n  typedef itk::ImageRegion<myDimension>        myRegionType;\n\n  \/\/ Create the image\n  myImageType::Pointer inputImage  = myImageType::New();\n\n  \n  \/\/ Define their size, and start index\n  mySizeType size;\n  size[0] = 8;\n  size[1] = 8;\n  size[2] = 8;\n\n  myIndexType start;\n  start.Fill(0);\n\n  myRegionType region;\n  region.SetIndex( start );\n  region.SetSize( size );\n\n  \/\/ Initialize Image A\n  inputImage->SetLargestPossibleRegion( region );\n  inputImage->SetBufferedRegion( region );\n  inputImage->SetRequestedRegion( region );\n  inputImage->Allocate();\n\n  \/\/ Declare Iterator type for the input image\n  typedef itk::ImageRegionIteratorWithIndex<myImageType>  myIteratorType;\n\n  \/\/ Create one iterator for the Input Image A (this is a light object)\n  myIteratorType it( inputImage, inputImage->GetRequestedRegion() );\n\n  \/\/ Initialize the content of Image A\n  while( !it.IsAtEnd() ) \n    {\n    it.Set( 0.0 );\n    ++it;\n    }\n\n  size[0] = 4;\n  size[1] = 4;\n  size[2] = 4;\n\n  start[0] = 2;\n  start[1] = 2;\n  start[2] = 2;\n\n  \/\/ Create one iterator for an internal region\n  region.SetSize( size );\n  region.SetIndex( start );\n  myIteratorType itb( inputImage, region );\n\n  \/\/ Initialize the content the internal region\n  while( !itb.IsAtEnd() ) \n    {\n    itb.Set( 100.0 );\n    ++itb;\n    }\n\n  \/\/ Declare the type for the \n  typedef itk::HessianRecursiveGaussianImageFilter< \n                                            myImageType >  myFilterType;\n            \n  typedef myFilterType::OutputImageType myHessianImageType;\n\n\n  \/\/ Create a  Filter                                \n  myFilterType::Pointer filter = myFilterType::New();\n\n\n  \/\/ Connect the input images\n  filter->SetInput( inputImage ); \n\n  \/\/ Select the value of Sigma\n  filter->SetSigma( 2.5 ); \n\n  \n  \/\/ Execute the filter\n  filter->Update();\n\n  \/\/ Get the Smart Pointer to the Filter Output \n  \/\/ It is important to do it AFTER the filter is Updated\n  \/\/ Because the object connected to the output may be changed\n  \/\/ by another during GenerateData() call\n  myHessianImageType::Pointer outputImage = filter->GetOutput();\n\n  \/\/ Declare Iterator type for the output image\n  typedef itk::ImageRegionIteratorWithIndex<\n                                 myHessianImageType>  myOutputIteratorType;\n\n  \/\/ Create an iterator for going through the output image\n  myOutputIteratorType itg( outputImage, \n                            outputImage->GetRequestedRegion() );\n  \n  \/\/  Print the content of the result image\n  std::cout << \" Result \" << std::endl;\n  itg.GoToBegin();\n  while( !itg.IsAtEnd() ) \n    {\n    std::cout << itg.Get();\n    ++itg;\n    }\n\n\n  \/\/ All objects should be automatically destroyed at this point\n  return EXIT_SUCCESS;\n\n}\n\n\n\n\n<commit_msg>Add code to  2d HessianRecursiveGaussianFilter warnings Removed trailing whitespace<commit_after>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Module:    itkHessianRecursiveGaussianFilterTest.cxx\n  Language:  C++\n  Date:      $Date$\n  Version:   $Revision$\n\n  Copyright (c) Insight Software Consortium. All rights reserved.\n  See ITKCopyright.txt or http:\/\/www.itk.org\/HTML\/Copyright.htm for details.\n\n     This software is distributed WITHOUT ANY WARRANTY; without even\n     the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n     PURPOSE.  See the above copyright notices for more information.\n\n=========================================================================*\/\n#if defined(_MSC_VER)\n#pragma warning ( disable : 4786 )\n#endif\n\n\n\n\n#include <itkHessianRecursiveGaussianImageFilter.h>\n#include <itkImageRegionIteratorWithIndex.h>\n\n\nint itkHessianRecursiveGaussianFilterTest(int, char* [] )\n{\n\n  \/\/ Define the dimension of the images\n  const unsigned int myDimension = 3;\n\n  \/\/ Declare the types of the images\n  typedef itk::Image<float, myDimension>           myImageType;\n\n  \/\/ Declare the type of the index to access images\n  typedef itk::Index<myDimension>             myIndexType;\n\n  \/\/ Declare the type of the size\n  typedef itk::Size<myDimension>              mySizeType;\n\n  \/\/ Declare the type of the Region\n  typedef itk::ImageRegion<myDimension>        myRegionType;\n\n  \/\/ Create the image\n  myImageType::Pointer inputImage  = myImageType::New();\n\n\n  \/\/ Define their size, and start index\n  mySizeType size;\n  size[0] = 8;\n  size[1] = 8;\n  size[2] = 8;\n\n  myIndexType start;\n  start.Fill(0);\n\n  myRegionType region;\n  region.SetIndex( start );\n  region.SetSize( size );\n\n  \/\/ Initialize Image A\n  inputImage->SetLargestPossibleRegion( region );\n  inputImage->SetBufferedRegion( region );\n  inputImage->SetRequestedRegion( region );\n  inputImage->Allocate();\n\n  \/\/ Declare Iterator type for the input image\n  typedef itk::ImageRegionIteratorWithIndex<myImageType>  myIteratorType;\n\n  \/\/ Create one iterator for the Input Image A (this is a light object)\n  myIteratorType it( inputImage, inputImage->GetRequestedRegion() );\n\n  \/\/ Initialize the content of Image A\n  while( !it.IsAtEnd() )\n    {\n    it.Set( 0.0 );\n    ++it;\n    }\n\n  size[0] = 4;\n  size[1] = 4;\n  size[2] = 4;\n\n  start[0] = 2;\n  start[1] = 2;\n  start[2] = 2;\n\n  \/\/ Create one iterator for an internal region\n  region.SetSize( size );\n  region.SetIndex( start );\n  myIteratorType itb( inputImage, region );\n\n  \/\/ Initialize the content the internal region\n  while( !itb.IsAtEnd() )\n    {\n    itb.Set( 100.0 );\n    ++itb;\n    }\n\n  \/\/ Declare the type for the\n  typedef itk::HessianRecursiveGaussianImageFilter<\n                                            myImageType >  myFilterType;\n\n  typedef myFilterType::OutputImageType myHessianImageType;\n\n\n  \/\/ Create a  Filter\n  myFilterType::Pointer filter = myFilterType::New();\n\n\n  \/\/ Connect the input images\n  filter->SetInput( inputImage );\n\n  \/\/ Select the value of Sigma\n  filter->SetSigma( 2.5 );\n\n\n  \/\/ Execute the filter\n  filter->Update();\n\n  \/\/ Get the Smart Pointer to the Filter Output\n  \/\/ It is important to do it AFTER the filter is Updated\n  \/\/ Because the object connected to the output may be changed\n  \/\/ by another during GenerateData() call\n  myHessianImageType::Pointer outputImage = filter->GetOutput();\n\n  \/\/ Declare Iterator type for the output image\n  typedef itk::ImageRegionIteratorWithIndex<\n                                 myHessianImageType>  myOutputIteratorType;\n\n  \/\/ Create an iterator for going through the output image\n  myOutputIteratorType itg( outputImage,\n                            outputImage->GetRequestedRegion() );\n\n  \/\/  Print the content of the result image\n  std::cout << \" Result \" << std::endl;\n  itg.GoToBegin();\n  while( !itg.IsAtEnd() )\n    {\n    std::cout << itg.Get();\n    ++itg;\n    }\n\n  \/\/ the following just tests for warnings in 2D\n  typedef itk::Image<float,2>                                       my2DImageType;\n  typedef itk::HessianRecursiveGaussianImageFilter<my2DImageType >  my2DFilterType;\n  my2DFilterType::Pointer test = my2DFilterType::New();\n\n  \/\/ All objects should be automatically destroyed at this point\n  return EXIT_SUCCESS;\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Created by Administrator on 2016\/11\/30.\n\/\/\n#define LOG_NDEBUG 0\n#define TAG \"YTX-VideoRefreshThread-JNI\"\n\n#include \"ytxplayer\/ALog-priv.h\"\n\n#include <ytxplayer\/gl_engine.h>\n#include <ytxplayer\/VideoStateInfo.h>\n#include <ytxplayer\/android_media_YtxMediaPlayer.h>\n#include <png.h>\n#include \"ytxplayer\/VideoRefreshController.h\"\n\n\nVideoRefreshController::VideoRefreshController(VideoStateInfo *mVideoStateInfo) {\n\n    last_duration = 0.0;\n    duration = 0.0;\n    delay = 0.0;\n    vp = NULL;\n    lastvp = NULL;\n    remaining_time = 0.0;\n    time = 0.0;\n    frame_timer = 0.0;\n    this->mVideoStateInfo = mVideoStateInfo;\n}\n\nvoid VideoRefreshController::handleRun(void *ptr) {\n    if (!prepare()) {\n        ALOGE(\"Couldn't prepare VideoRefreshController\\n\");\n        return;\n    }\n    refresh();\n}\n\nbool VideoRefreshController::prepare() {\n    return true;\n}\n\n#define REFRESH_RATE 0.01\n#define AV_SYNC_THRESHOLD_MAX 0.1\n\nvoid VideoRefreshController::process() {\n    Frame *sp, *sp2;\n    if (mVideoStateInfo != NULL) {\n\n        if (*mVideoStateInfo->mCurrentState == MEDIA_PLAYER_PAUSED) {\n            mVideoStateInfo->waitOnNotify(MEDIA_PLAYER_PAUSED);\n\n        }\n\n        if (*mVideoStateInfo->mCurrentState == MEDIA_PLAYER_STOPPED ||\n            *mVideoStateInfo->mCurrentState == MEDIA_PLAYER_PLAYBACK_COMPLETE) {\n            return;\n        }\n        if (remaining_time > 0.0) {\n            av_usleep((unsigned int) (remaining_time * 1000000.0));\n        }\n        remaining_time = REFRESH_RATE;\n\n        if (mVideoStateInfo->frameQueueVideo->frameQueueNumRemaining() < 1) {\n            \/\/ nothing to do, no picture to display in the queue\n\n        } else {\n\n\n            lastvp = mVideoStateInfo->frameQueueVideo->frameQueuePeekLast();\n            vp = mVideoStateInfo->frameQueueVideo->frameQueuePeek();\n\n\n            last_duration = vpDuration(lastvp, vp);\n            \/\/ delay = last_duration;\n            delay = computeTargetDelay(last_duration);\n\n\n            time = av_gettime_relative() \/ 1000000.0; \/\/获取ff系统时间,单位为秒\n\n            if (time < frame_timer + delay) { \/\/如果当前时间小于(frame_timer+delay)则不去frameQueue取下一帧直接刷新当前帧\n                remaining_time = FFMIN(frame_timer + delay - time, remaining_time); \/\/显示下一帧还差多长时间\n                return;\n            }\n\n            frame_timer += delay; \/\/下一帧需要在这个时间显示\n            if (delay > 0 && time - frame_timer > AV_SYNC_THRESHOLD_MAX) {\n                frame_timer = time;\n            }\n\n            mLock.lock();\n            if (!isnan(vp->pts)) {\n                mVideoStateInfo->currentTime = (int) (vp->pts * 1000);\n                mVideoStateInfo->updateVideoPts(vp->pts, vp->pos, vp->serial);\n            }\n            mLock.unlock();\n            \/*\n             * 添加subtitles\n             *\/\n\n            if (mVideoStateInfo->streamSubtitle->st) {\n\n                while (mVideoStateInfo->frameQueueSubtitle->frameQueueNumRemaining() > 0) {\n                    sp = mVideoStateInfo->frameQueueSubtitle->frameQueuePeek();\n\n                    if (mVideoStateInfo->frameQueueSubtitle->frameQueueNumRemaining() > 1) {\n                        sp2 = mVideoStateInfo->frameQueueSubtitle->frameQueuePeekNext();\n                    } else {\n                        sp2 = NULL;\n                    }\n\n\n                    if (sp->serial != mVideoStateInfo->pkt_serial_subtitle\n                        || (mVideoStateInfo->vidClk->pts >\n                            (sp->pts + ((float) sp->sub.end_display_time \/ 1000)))\n                        || (sp2 && mVideoStateInfo->vidClk->pts >\n                                   (sp2->pts + ((float) sp2->sub.start_display_time \/ 1000)))) {\n                        mVideoStateInfo->frameQueueSubtitle->frameQueueNext();\n                    } else {\n                        break;\n                    }\n                }\n            }\n\n            int decodeWidth = mVideoStateInfo->streamVideo->dec_ctx->width;\n            int decodeHeight = mVideoStateInfo->streamVideo->dec_ctx->height;\n            int y_size = decodeWidth * decodeHeight;\n            if (lastvp->out_buffer_video_yuv[0] != NULL &&\n                *mVideoStateInfo->mCurrentState != MEDIA_PLAYER_STOPPED) {\n\/\/                fwrite(vp->frame->data[0],1,y_size,mVideoStateInfo->fp_yuv);    \/\/Y\n\/\/                fwrite(vp->frame->data[1],1,y_size\/4,mVideoStateInfo->fp_yuv);  \/\/U\n\/\/                fwrite(vp->frame->data[2],1,y_size\/4,mVideoStateInfo->fp_yuv);  \/\/V\n\n                bool hasSubtitles = false;\n                int i = 0;\n                if (mVideoStateInfo->streamSubtitle->st) {\n                    if (mVideoStateInfo->frameQueueSubtitle->frameQueueNumRemaining() > 0) {\n                        sp = mVideoStateInfo->frameQueueSubtitle->frameQueuePeek();\n\n                        if (vp->pts >= sp->pts + ((float) sp->sub.start_display_time \/ 1000)) {\n\/\/                            write_png(mVideoStateInfo->join(mVideoStateInfo->mStorageDir,\"ass.png\"), sp->imageFrame);\n                            hasSubtitles = true;\n\n                            if (mVideoStateInfo->sub_format == 0) {\n                                uint8_t *data[4] = {0};\n                                int linesize[4] = {0};\n                                mLock.lock();\n                                data[0] = (uint8_t *) lastvp->out_buffer_video_yuv[0];\n                                data[1] = (uint8_t *) lastvp->out_buffer_video_yuv[1];\n                                data[2] = (uint8_t *) lastvp->out_buffer_video_yuv[2];\n\n                                linesize[0] = lastvp->linesize[0];\n                                linesize[1] = lastvp->linesize[1];\n                                linesize[2] = lastvp->linesize[2];\n\n\n                                for (i = 0; i < sp->sub.num_rects; i++) {\n                                    blend_subrect(data, linesize, sp->subrects[i], decodeWidth,\n                                                  decodeHeight);\n                                }\n                                mLock.unlock();\n                            }\n                        }\n                    }\n                }\n\n\n                android_media_player_notifyRenderFrame(mVideoStateInfo->VideoGlSurfaceViewObj);\n                if (hasSubtitles) {\n                    addRendererVideoFrame(mVideoStateInfo->GraphicRendererObj,\n                                          sp->imageFrame,\n                                          lastvp->out_buffer_video_yuv[0],\n                                          lastvp->out_buffer_video_yuv[1],\n                                          lastvp->out_buffer_video_yuv[2],\n                                          decodeWidth,\n                                          decodeHeight);\n                } else {\n                    addRendererVideoFrame(mVideoStateInfo->GraphicRendererObj,\n                                          NULL,\n                                          lastvp->out_buffer_video_yuv[0],\n                                          lastvp->out_buffer_video_yuv[1],\n                                          lastvp->out_buffer_video_yuv[2],\n                                          decodeWidth,\n                                          decodeHeight);\n                }\n\n\n            }\n            mVideoStateInfo->frameQueueVideo->frameQueueNext();\n        }\n    }\n\n}\n\n#define ALPHA_BLEND(a, oldp, newp, s)\\\n((((oldp << s) * (255 - (a))) + (newp * (a))) \/ (255 << s))\n\nvoid\nVideoRefreshController::blend_subrect(uint8_t **data, int *linesize, const AVSubtitleRect *rect,\n                                      int imgw, int imgh) {\n    int x, y, Y, U, V, A;\n    uint8_t *lum, *cb, *cr;\n    int dstx, dsty, dstw, dsth;\n    const AVSubtitleRect *src = rect;\n\n    dstw = av_clip(rect->w, 0, imgw);\n    dsth = av_clip(rect->h, 0, imgh);\n    dstx = av_clip(rect->x, 0, imgw - dstw);\n    dsty = av_clip(rect->y, 0, imgh - dsth);\n    lum = data[0] + dstx + dsty * linesize[0];\n    cb = data[1] + dstx \/ 2 + (dsty >> 1) * linesize[1];\n    cr = data[2] + dstx \/ 2 + (dsty >> 1) * linesize[2];\n\n    for (y = 0; y < dsth; y++) {\n        for (x = 0; x < dstw; x++) {\n            Y = src->data[0][x + y * src->linesize[0]];\n            A = src->data[3][x + y * src->linesize[3]];\n            lum[0] = ALPHA_BLEND(A, lum[0], Y, 0);\n            lum++;\n        }\n        lum += linesize[0] - dstw;\n    }\n\n    for (y = 0; y < dsth \/ 2; y++) {\n        for (x = 0; x < dstw \/ 2; x++) {\n            U = src->data[1][x + y * src->linesize[1]];\n            V = src->data[2][x + y * src->linesize[2]];\n            A = src->data[3][2 * x + 2 * y * src->linesize[3]]\n                + src->data[3][2 * x + 1 + 2 * y * src->linesize[3]]\n                + src->data[3][2 * x + 1 + (2 * y + 1) * src->linesize[3]]\n                + src->data[3][2 * x + (2 * y + 1) * src->linesize[3]];\n            cb[0] = ALPHA_BLEND(A >> 2, cb[0], U, 0);\n            cr[0] = ALPHA_BLEND(A >> 2, cr[0], V, 0);\n            cb++;\n            cr++;\n        }\n        cb += linesize[1] - dstw \/ 2;\n        cr += linesize[2] - dstw \/ 2;\n    }\n\n}\n\nvoid VideoRefreshController::write_png(char *fname, image_t *img) {\n\n    FILE *fp;\n    png_structp png_ptr;\n    png_infop info_ptr;\n    png_byte **row_pointers;\n    int k;\n\n    png_ptr = png_create_write_struct(PNG_LIBPNG_VER_STRING, NULL, NULL, NULL);\n    info_ptr = png_create_info_struct(png_ptr);\n    fp = NULL;\n\n    if (setjmp(png_jmpbuf(png_ptr))) {\n        png_destroy_write_struct(&png_ptr, &info_ptr);\n        fclose(fp);\n        return;\n    }\n\n    fp = fopen(fname, \"wb\");\n    if (fp == NULL) {\n        ALOGE(\"PNG Error opening %s for writing!\\n\", fname);\n        return;\n    }\n\n    png_init_io(png_ptr, fp);\n    png_set_compression_level(png_ptr, 0);\n\n    png_set_IHDR(png_ptr, info_ptr, img->width, img->height,\n                 8, PNG_COLOR_TYPE_RGB, PNG_INTERLACE_NONE,\n                 PNG_COMPRESSION_TYPE_DEFAULT, PNG_FILTER_TYPE_DEFAULT);\n\n    png_write_info(png_ptr, info_ptr);\n\n    png_set_bgr(png_ptr);\n\n    row_pointers = (png_byte **) malloc(img->height * sizeof(png_byte *));\n    for (k = 0; k < img->height; k++)\n        row_pointers[k] = img->buffer + img->stride * k;\n\n    png_write_image(png_ptr, row_pointers);\n    png_write_end(png_ptr, info_ptr);\n    png_destroy_write_struct(&png_ptr, &info_ptr);\n\n    free(row_pointers);\n\n    fclose(fp);\n}\n\nvoid VideoRefreshController::stop() {\n    mRunning = false;\n    int ret = -1;\n    if ((ret = wait()) != 0) {\n        ALOGE(\"Couldn't cancel IDecoder: %i\\n\", ret);\n        return;\n    }\n}\n\nvoid VideoRefreshController::refresh() {\n\n    while (mRunning) {\n        process();\n    }\n    \/\/结束视频刷新\n    resetRendererVideoFrame(mVideoStateInfo->GraphicRendererObj);\n    android_media_player_notifyRenderFrame(mVideoStateInfo->VideoGlSurfaceViewObj);\n\n}\n\ndouble VideoRefreshController::vpDuration(Frame *vp, Frame *next_vp) {\n    if (vp->serial == next_vp->serial) {\n        double duration = next_vp->pts - vp->pts;\n        if (isnan(duration) || duration <= 0 || duration > mVideoStateInfo->max_frame_duration)\n            return vp->duration;\n        else\n            return duration;\n    } else {\n        return 0.0;\n    }\n}\n\n\ndouble VideoRefreshController::computeTargetDelay(double delay) {\n    double sync_threshold, diff = 0;\n\n    \/* update delay to follow master synchronisation source *\/\n\n    diff = mVideoStateInfo->getClock(mVideoStateInfo->vidClk) -\n           mVideoStateInfo->getClock(mVideoStateInfo->audClk);\n\n    \/* skip or repeat frame. We take into account the\n       delay to compute the threshold. I still don't know\n       if it is the best guess *\/\n    sync_threshold = FFMAX(AV_SYNC_THRESHOLD_MIN, FFMIN(AV_SYNC_THRESHOLD_MAX, delay));\n    if (!isnan(diff) && fabs(diff) < mVideoStateInfo->max_frame_duration) {\n\n        if (diff <= -sync_threshold) {\n            \/\/如果音频播放比视频快\n            delay = FFMAX(0, delay + diff);\n        } else if (diff >= sync_threshold && delay > AV_SYNC_FRAMEDUP_THRESHOLD) {\n            \/\/如果视频比音频快\n            delay = delay + diff;\n        } else if (diff >= sync_threshold) {\n\n            delay = 2 * delay;\n        }\n\n    }\n\n    \/\/     ALOGI(\"video: delay=%0.3lf V-A=%lf \\n\", delay, diff);\n\n    return delay;\n\n}<commit_msg>解决播放无音频文件时crash问题<commit_after>\/\/\n\/\/ Created by Administrator on 2016\/11\/30.\n\/\/\n#define LOG_NDEBUG 0\n#define TAG \"YTX-VideoRefreshThread-JNI\"\n\n#include \"ytxplayer\/ALog-priv.h\"\n\n#include <ytxplayer\/gl_engine.h>\n#include <ytxplayer\/VideoStateInfo.h>\n#include <ytxplayer\/android_media_YtxMediaPlayer.h>\n#include <png.h>\n#include \"ytxplayer\/VideoRefreshController.h\"\n\n\nVideoRefreshController::VideoRefreshController(VideoStateInfo *mVideoStateInfo) {\n\n    last_duration = 0.0;\n    duration = 0.0;\n    delay = 0.0;\n    vp = NULL;\n    lastvp = NULL;\n    remaining_time = 0.0;\n    time = 0.0;\n    frame_timer = 0.0;\n    this->mVideoStateInfo = mVideoStateInfo;\n}\n\nvoid VideoRefreshController::handleRun(void *ptr) {\n    if (!prepare()) {\n        ALOGE(\"Couldn't prepare VideoRefreshController\\n\");\n        return;\n    }\n    refresh();\n}\n\nbool VideoRefreshController::prepare() {\n    return true;\n}\n\n#define REFRESH_RATE 0.01\n#define AV_SYNC_THRESHOLD_MAX 0.1\n\nvoid VideoRefreshController::process() {\n    Frame *sp, *sp2;\n    if (mVideoStateInfo != NULL) {\n\n        if (*mVideoStateInfo->mCurrentState == MEDIA_PLAYER_PAUSED) {\n            mVideoStateInfo->waitOnNotify(MEDIA_PLAYER_PAUSED);\n\n        }\n\n        if (*mVideoStateInfo->mCurrentState == MEDIA_PLAYER_STOPPED ||\n            *mVideoStateInfo->mCurrentState == MEDIA_PLAYER_PLAYBACK_COMPLETE) {\n            return;\n        }\n        if (remaining_time > 0.0) {\n            av_usleep((unsigned int) (remaining_time * 1000000.0));\n        }\n        remaining_time = REFRESH_RATE;\n\n        if (mVideoStateInfo->frameQueueVideo->frameQueueNumRemaining() < 1) {\n            \/\/ nothing to do, no picture to display in the queue\n\n        } else {\n\n\n            lastvp = mVideoStateInfo->frameQueueVideo->frameQueuePeekLast();\n            vp = mVideoStateInfo->frameQueueVideo->frameQueuePeek();\n\n\n            last_duration = vpDuration(lastvp, vp);\n            \/\/ delay = last_duration;\n            if(mVideoStateInfo->st_index[AVMEDIA_TYPE_AUDIO] >= 0){\n                delay = computeTargetDelay(last_duration);\n            }else{\n                delay = last_duration;\n            }\n\n\n\n            time = av_gettime_relative() \/ 1000000.0; \/\/获取ff系统时间,单位为秒\n\n            if (time < frame_timer + delay) { \/\/如果当前时间小于(frame_timer+delay)则不去frameQueue取下一帧直接刷新当前帧\n                remaining_time = FFMIN(frame_timer + delay - time, remaining_time); \/\/显示下一帧还差多长时间\n                return;\n            }\n\n            frame_timer += delay; \/\/下一帧需要在这个时间显示\n            if (delay > 0 && time - frame_timer > AV_SYNC_THRESHOLD_MAX) {\n                frame_timer = time;\n            }\n\n            mLock.lock();\n            if (!isnan(vp->pts)) {\n                mVideoStateInfo->currentTime = (int) (vp->pts * 1000);\n                mVideoStateInfo->updateVideoPts(vp->pts, vp->pos, vp->serial);\n            }\n            mLock.unlock();\n            \/*\n             * 添加subtitles\n             *\/\n\n            if (mVideoStateInfo->streamSubtitle->st) {\n\n                while (mVideoStateInfo->frameQueueSubtitle->frameQueueNumRemaining() > 0) {\n                    sp = mVideoStateInfo->frameQueueSubtitle->frameQueuePeek();\n\n                    if (mVideoStateInfo->frameQueueSubtitle->frameQueueNumRemaining() > 1) {\n                        sp2 = mVideoStateInfo->frameQueueSubtitle->frameQueuePeekNext();\n                    } else {\n                        sp2 = NULL;\n                    }\n\n\n                    if (sp->serial != mVideoStateInfo->pkt_serial_subtitle\n                        || (mVideoStateInfo->vidClk->pts >\n                            (sp->pts + ((float) sp->sub.end_display_time \/ 1000)))\n                        || (sp2 && mVideoStateInfo->vidClk->pts >\n                                   (sp2->pts + ((float) sp2->sub.start_display_time \/ 1000)))) {\n                        mVideoStateInfo->frameQueueSubtitle->frameQueueNext();\n                    } else {\n                        break;\n                    }\n                }\n            }\n\n            int decodeWidth = mVideoStateInfo->streamVideo->dec_ctx->width;\n            int decodeHeight = mVideoStateInfo->streamVideo->dec_ctx->height;\n            int y_size = decodeWidth * decodeHeight;\n            if (lastvp->out_buffer_video_yuv[0] != NULL &&\n                *mVideoStateInfo->mCurrentState != MEDIA_PLAYER_STOPPED) {\n\/\/                fwrite(vp->frame->data[0],1,y_size,mVideoStateInfo->fp_yuv);    \/\/Y\n\/\/                fwrite(vp->frame->data[1],1,y_size\/4,mVideoStateInfo->fp_yuv);  \/\/U\n\/\/                fwrite(vp->frame->data[2],1,y_size\/4,mVideoStateInfo->fp_yuv);  \/\/V\n\n                bool hasSubtitles = false;\n                int i = 0;\n                if (mVideoStateInfo->streamSubtitle->st) {\n                    if (mVideoStateInfo->frameQueueSubtitle->frameQueueNumRemaining() > 0) {\n                        sp = mVideoStateInfo->frameQueueSubtitle->frameQueuePeek();\n\n                        if (vp->pts >= sp->pts + ((float) sp->sub.start_display_time \/ 1000)) {\n\/\/                            write_png(mVideoStateInfo->join(mVideoStateInfo->mStorageDir,\"ass.png\"), sp->imageFrame);\n                            hasSubtitles = true;\n\n                            if (mVideoStateInfo->sub_format == 0) {\n                                uint8_t *data[4] = {0};\n                                int linesize[4] = {0};\n                                mLock.lock();\n                                data[0] = (uint8_t *) lastvp->out_buffer_video_yuv[0];\n                                data[1] = (uint8_t *) lastvp->out_buffer_video_yuv[1];\n                                data[2] = (uint8_t *) lastvp->out_buffer_video_yuv[2];\n\n                                linesize[0] = lastvp->linesize[0];\n                                linesize[1] = lastvp->linesize[1];\n                                linesize[2] = lastvp->linesize[2];\n\n\n                                for (i = 0; i < sp->sub.num_rects; i++) {\n                                    blend_subrect(data, linesize, sp->subrects[i], decodeWidth,\n                                                  decodeHeight);\n                                }\n                                mLock.unlock();\n                            }\n                        }\n                    }\n                }\n\n\n                android_media_player_notifyRenderFrame(mVideoStateInfo->VideoGlSurfaceViewObj);\n                if (hasSubtitles) {\n                    addRendererVideoFrame(mVideoStateInfo->GraphicRendererObj,\n                                          sp->imageFrame,\n                                          lastvp->out_buffer_video_yuv[0],\n                                          lastvp->out_buffer_video_yuv[1],\n                                          lastvp->out_buffer_video_yuv[2],\n                                          decodeWidth,\n                                          decodeHeight);\n                } else {\n                    addRendererVideoFrame(mVideoStateInfo->GraphicRendererObj,\n                                          NULL,\n                                          lastvp->out_buffer_video_yuv[0],\n                                          lastvp->out_buffer_video_yuv[1],\n                                          lastvp->out_buffer_video_yuv[2],\n                                          decodeWidth,\n                                          decodeHeight);\n                }\n\n\n            }\n            mVideoStateInfo->frameQueueVideo->frameQueueNext();\n        }\n    }\n\n}\n\n#define ALPHA_BLEND(a, oldp, newp, s)\\\n((((oldp << s) * (255 - (a))) + (newp * (a))) \/ (255 << s))\n\nvoid\nVideoRefreshController::blend_subrect(uint8_t **data, int *linesize, const AVSubtitleRect *rect,\n                                      int imgw, int imgh) {\n    int x, y, Y, U, V, A;\n    uint8_t *lum, *cb, *cr;\n    int dstx, dsty, dstw, dsth;\n    const AVSubtitleRect *src = rect;\n\n    dstw = av_clip(rect->w, 0, imgw);\n    dsth = av_clip(rect->h, 0, imgh);\n    dstx = av_clip(rect->x, 0, imgw - dstw);\n    dsty = av_clip(rect->y, 0, imgh - dsth);\n    lum = data[0] + dstx + dsty * linesize[0];\n    cb = data[1] + dstx \/ 2 + (dsty >> 1) * linesize[1];\n    cr = data[2] + dstx \/ 2 + (dsty >> 1) * linesize[2];\n\n    for (y = 0; y < dsth; y++) {\n        for (x = 0; x < dstw; x++) {\n            Y = src->data[0][x + y * src->linesize[0]];\n            A = src->data[3][x + y * src->linesize[3]];\n            lum[0] = ALPHA_BLEND(A, lum[0], Y, 0);\n            lum++;\n        }\n        lum += linesize[0] - dstw;\n    }\n\n    for (y = 0; y < dsth \/ 2; y++) {\n        for (x = 0; x < dstw \/ 2; x++) {\n            U = src->data[1][x + y * src->linesize[1]];\n            V = src->data[2][x + y * src->linesize[2]];\n            A = src->data[3][2 * x + 2 * y * src->linesize[3]]\n                + src->data[3][2 * x + 1 + 2 * y * src->linesize[3]]\n                + src->data[3][2 * x + 1 + (2 * y + 1) * src->linesize[3]]\n                + src->data[3][2 * x + (2 * y + 1) * src->linesize[3]];\n            cb[0] = ALPHA_BLEND(A >> 2, cb[0], U, 0);\n            cr[0] = ALPHA_BLEND(A >> 2, cr[0], V, 0);\n            cb++;\n            cr++;\n        }\n        cb += linesize[1] - dstw \/ 2;\n        cr += linesize[2] - dstw \/ 2;\n    }\n\n}\n\nvoid VideoRefreshController::write_png(char *fname, image_t *img) {\n\n    FILE *fp;\n    png_structp png_ptr;\n    png_infop info_ptr;\n    png_byte **row_pointers;\n    int k;\n\n    png_ptr = png_create_write_struct(PNG_LIBPNG_VER_STRING, NULL, NULL, NULL);\n    info_ptr = png_create_info_struct(png_ptr);\n    fp = NULL;\n\n    if (setjmp(png_jmpbuf(png_ptr))) {\n        png_destroy_write_struct(&png_ptr, &info_ptr);\n        fclose(fp);\n        return;\n    }\n\n    fp = fopen(fname, \"wb\");\n    if (fp == NULL) {\n        ALOGE(\"PNG Error opening %s for writing!\\n\", fname);\n        return;\n    }\n\n    png_init_io(png_ptr, fp);\n    png_set_compression_level(png_ptr, 0);\n\n    png_set_IHDR(png_ptr, info_ptr, img->width, img->height,\n                 8, PNG_COLOR_TYPE_RGB, PNG_INTERLACE_NONE,\n                 PNG_COMPRESSION_TYPE_DEFAULT, PNG_FILTER_TYPE_DEFAULT);\n\n    png_write_info(png_ptr, info_ptr);\n\n    png_set_bgr(png_ptr);\n\n    row_pointers = (png_byte **) malloc(img->height * sizeof(png_byte *));\n    for (k = 0; k < img->height; k++)\n        row_pointers[k] = img->buffer + img->stride * k;\n\n    png_write_image(png_ptr, row_pointers);\n    png_write_end(png_ptr, info_ptr);\n    png_destroy_write_struct(&png_ptr, &info_ptr);\n\n    free(row_pointers);\n\n    fclose(fp);\n}\n\nvoid VideoRefreshController::stop() {\n    mRunning = false;\n    int ret = -1;\n    if ((ret = wait()) != 0) {\n        ALOGE(\"Couldn't cancel IDecoder: %i\\n\", ret);\n        return;\n    }\n}\n\nvoid VideoRefreshController::refresh() {\n\n    while (mRunning) {\n        process();\n    }\n    \/\/结束视频刷新\n    resetRendererVideoFrame(mVideoStateInfo->GraphicRendererObj);\n    android_media_player_notifyRenderFrame(mVideoStateInfo->VideoGlSurfaceViewObj);\n\n}\n\ndouble VideoRefreshController::vpDuration(Frame *vp, Frame *next_vp) {\n    if (vp->serial == next_vp->serial) {\n        double duration = next_vp->pts - vp->pts;\n        if (isnan(duration) || duration <= 0 || duration > mVideoStateInfo->max_frame_duration)\n            return vp->duration;\n        else\n            return duration;\n    } else {\n        return 0.0;\n    }\n}\n\n\ndouble VideoRefreshController::computeTargetDelay(double delay) {\n    double sync_threshold, diff = 0;\n\n    \/* update delay to follow master synchronisation source *\/\n\n    diff = mVideoStateInfo->getClock(mVideoStateInfo->vidClk) -\n           mVideoStateInfo->getClock(mVideoStateInfo->audClk);\n\n    \/* skip or repeat frame. We take into account the\n       delay to compute the threshold. I still don't know\n       if it is the best guess *\/\n    sync_threshold = FFMAX(AV_SYNC_THRESHOLD_MIN, FFMIN(AV_SYNC_THRESHOLD_MAX, delay));\n    if (!isnan(diff) && fabs(diff) < mVideoStateInfo->max_frame_duration) {\n\n        if (diff <= -sync_threshold) {\n            \/\/如果音频播放比视频快\n            delay = FFMAX(0, delay + diff);\n        } else if (diff >= sync_threshold && delay > AV_SYNC_FRAMEDUP_THRESHOLD) {\n            \/\/如果视频比音频快\n            delay = delay + diff;\n        } else if (diff >= sync_threshold) {\n\n            delay = 2 * delay;\n        }\n\n    }\n\n    \/\/     ALOGI(\"video: delay=%0.3lf V-A=%lf \\n\", delay, diff);\n\n    return delay;\n\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n *  Copyright (c) 2012 The WebRTC project authors. All Rights Reserved.\n *\n *  Use of this source code is governed by a BSD-style license\n *  that can be found in the LICENSE file in the root of the source\n *  tree. An additional intellectual property rights grant can be found\n *  in the file PATENTS.  All contributing project authors may\n *  be found in the AUTHORS file in the root of the source tree.\n *\/\n\n#include \"webrtc\/modules\/audio_coding\/neteq4\/interface\/neteq.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq4\/neteq_impl.h\"\n\n#include \"gmock\/gmock.h\"\n#include \"gtest\/gtest.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq4\/accelerate.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq4\/expand.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq4\/mock\/mock_audio_decoder.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq4\/mock\/mock_buffer_level_filter.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq4\/mock\/mock_decoder_database.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq4\/mock\/mock_delay_manager.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq4\/mock\/mock_delay_peak_detector.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq4\/mock\/mock_dtmf_buffer.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq4\/mock\/mock_dtmf_tone_generator.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq4\/mock\/mock_packet_buffer.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq4\/mock\/mock_payload_splitter.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq4\/preemptive_expand.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq4\/timestamp_scaler.h\"\n\nusing ::testing::Return;\nusing ::testing::ReturnNull;\nusing ::testing::_;\nusing ::testing::SetArgPointee;\nusing ::testing::InSequence;\nusing ::testing::Invoke;\nusing ::testing::WithArg;\n\nnamespace webrtc {\n\n\/\/ This function is called when inserting a packet list into the mock packet\n\/\/ buffer. The purpose is to delete all inserted packets properly, to avoid\n\/\/ memory leaks in the test.\nint DeletePacketsAndReturnOk(PacketList* packet_list) {\n  PacketBuffer::DeleteAllPackets(packet_list);\n  return PacketBuffer::kOK;\n}\n\nclass NetEqImplTest : public ::testing::Test {\n protected:\n  static const int kInitSampleRateHz = 8000;\n  NetEqImplTest() {\n    buffer_level_filter_ = new MockBufferLevelFilter;\n    decoder_database_ = new MockDecoderDatabase;\n    delay_peak_detector_ = new MockDelayPeakDetector;\n    EXPECT_CALL(*delay_peak_detector_, Reset()).Times(1);\n    delay_manager_ = new MockDelayManager(NetEq::kMaxNumPacketsInBuffer,\n                                          delay_peak_detector_);\n    dtmf_buffer_ = new MockDtmfBuffer(kInitSampleRateHz);\n    dtmf_tone_generator_ = new MockDtmfToneGenerator;\n    packet_buffer_ = new MockPacketBuffer(NetEq::kMaxNumPacketsInBuffer,\n                                          NetEq::kMaxBytesInBuffer);\n    payload_splitter_ = new MockPayloadSplitter;\n    timestamp_scaler_ = new TimestampScaler(*decoder_database_);\n    EXPECT_CALL(*decoder_database_, GetActiveCngDecoder())\n        .WillOnce(ReturnNull());\n    AccelerateFactory* accelerate_factory = new AccelerateFactory;\n    ExpandFactory* expand_factory = new ExpandFactory;\n    PreemptiveExpandFactory* preemptive_expand_factory =\n        new PreemptiveExpandFactory;\n\n    neteq_ = new NetEqImpl(kInitSampleRateHz,\n                           buffer_level_filter_,\n                           decoder_database_,\n                           delay_manager_,\n                           delay_peak_detector_,\n                           dtmf_buffer_,\n                           dtmf_tone_generator_,\n                           packet_buffer_,\n                           payload_splitter_,\n                           timestamp_scaler_,\n                           accelerate_factory,\n                           expand_factory,\n                           preemptive_expand_factory);\n  }\n\n  virtual ~NetEqImplTest() {\n    EXPECT_CALL(*buffer_level_filter_, Die()).Times(1);\n    EXPECT_CALL(*decoder_database_, Die()).Times(1);\n    EXPECT_CALL(*delay_manager_, Die()).Times(1);\n    EXPECT_CALL(*delay_peak_detector_, Die()).Times(1);\n    EXPECT_CALL(*dtmf_buffer_, Die()).Times(1);\n    EXPECT_CALL(*dtmf_tone_generator_, Die()).Times(1);\n    EXPECT_CALL(*packet_buffer_, Die()).Times(1);\n    delete neteq_;\n  }\n\n  NetEqImpl* neteq_;\n  MockBufferLevelFilter* buffer_level_filter_;\n  MockDecoderDatabase* decoder_database_;\n  MockDelayPeakDetector* delay_peak_detector_;\n  MockDelayManager* delay_manager_;\n  MockDtmfBuffer* dtmf_buffer_;\n  MockDtmfToneGenerator* dtmf_tone_generator_;\n  MockPacketBuffer* packet_buffer_;\n  MockPayloadSplitter* payload_splitter_;\n  TimestampScaler* timestamp_scaler_;\n};\n\n\n\/\/ This tests the interface class NetEq.\n\/\/ TODO(hlundin): Move to separate file?\nTEST(NetEq, CreateAndDestroy) {\n  NetEq* neteq = NetEq::Create(8000);\n  delete neteq;\n}\n\nTEST_F(NetEqImplTest, RegisterPayloadType) {\n  uint8_t rtp_payload_type = 0;\n  NetEqDecoder codec_type = kDecoderPCMu;\n  EXPECT_CALL(*decoder_database_,\n              RegisterPayload(rtp_payload_type, codec_type));\n  neteq_->RegisterPayloadType(codec_type, rtp_payload_type);\n}\n\nTEST_F(NetEqImplTest, RemovePayloadType) {\n  uint8_t rtp_payload_type = 0;\n  EXPECT_CALL(*decoder_database_,\n              Remove(rtp_payload_type))\n      .WillOnce(Return(DecoderDatabase::kDecoderNotFound));\n  \/\/ Check that kFail is returned when database returns kDecoderNotFound.\n  EXPECT_EQ(NetEq::kFail, neteq_->RemovePayloadType(rtp_payload_type));\n}\n\nTEST_F(NetEqImplTest, InsertPacket) {\n  const int kPayloadLength = 100;\n  const uint8_t kPayloadType = 0;\n  const uint16_t kFirstSequenceNumber = 0x1234;\n  const uint32_t kFirstTimestamp = 0x12345678;\n  const uint32_t kSsrc = 0x87654321;\n  const uint32_t kFirstReceiveTime = 17;\n  uint8_t payload[kPayloadLength] = {0};\n  WebRtcRTPHeader rtp_header;\n  rtp_header.header.payloadType = kPayloadType;\n  rtp_header.header.sequenceNumber = kFirstSequenceNumber;\n  rtp_header.header.timestamp = kFirstTimestamp;\n  rtp_header.header.ssrc = kSsrc;\n\n  \/\/ Create a mock decoder object.\n  MockAudioDecoder mock_decoder;\n  \/\/ BWE update function called with first packet.\n  EXPECT_CALL(mock_decoder, IncomingPacket(_,\n                                           kPayloadLength,\n                                           kFirstSequenceNumber,\n                                           kFirstTimestamp,\n                                           kFirstReceiveTime));\n  \/\/ BWE update function called with second packet.\n  EXPECT_CALL(mock_decoder, IncomingPacket(_,\n                                           kPayloadLength,\n                                           kFirstSequenceNumber + 1,\n                                           kFirstTimestamp + 160,\n                                           kFirstReceiveTime + 155));\n  EXPECT_CALL(mock_decoder, Die()).Times(1);  \/\/ Called when deleted.\n\n  \/\/ Expectations for decoder database.\n  EXPECT_CALL(*decoder_database_, IsRed(kPayloadType))\n      .WillRepeatedly(Return(false));  \/\/ This is not RED.\n  EXPECT_CALL(*decoder_database_, CheckPayloadTypes(_))\n      .Times(2)\n      .WillRepeatedly(Return(DecoderDatabase::kOK));  \/\/ Payload type is valid.\n  EXPECT_CALL(*decoder_database_, IsDtmf(kPayloadType))\n      .WillRepeatedly(Return(false));  \/\/ This is not DTMF.\n  EXPECT_CALL(*decoder_database_, GetDecoder(kPayloadType))\n      .Times(3)\n      .WillRepeatedly(Return(&mock_decoder));\n  EXPECT_CALL(*decoder_database_, IsComfortNoise(kPayloadType))\n      .WillRepeatedly(Return(false));  \/\/ This is not CNG.\n  DecoderDatabase::DecoderInfo info;\n  info.codec_type = kDecoderPCMu;\n  EXPECT_CALL(*decoder_database_, GetDecoderInfo(kPayloadType))\n      .WillRepeatedly(Return(&info));\n\n  \/\/ Expectations for packet buffer.\n  EXPECT_CALL(*packet_buffer_, NumPacketsInBuffer())\n      .WillOnce(Return(0))   \/\/ First packet.\n      .WillOnce(Return(1))   \/\/ Second packet.\n      .WillOnce(Return(2));  \/\/ Second packet, checking after it was inserted.\n  EXPECT_CALL(*packet_buffer_, Flush())\n      .Times(1);\n  EXPECT_CALL(*packet_buffer_, InsertPacketList(_, _, _, _))\n      .Times(2)\n      .WillRepeatedly(DoAll(SetArgPointee<2>(kPayloadType),\n                            WithArg<0>(Invoke(DeletePacketsAndReturnOk))));\n  \/\/ SetArgPointee<2>(kPayloadType) means that the third argument (zero-based\n  \/\/ index) is a pointer, and the variable pointed to is set to kPayloadType.\n  \/\/ Also invoke the function DeletePacketsAndReturnOk to properly delete all\n  \/\/ packets in the list (to avoid memory leaks in the test).\n  EXPECT_CALL(*packet_buffer_, NextRtpHeader())\n      .Times(1)\n      .WillOnce(Return(&rtp_header.header));\n\n  \/\/ Expectations for DTMF buffer.\n  EXPECT_CALL(*dtmf_buffer_, Flush())\n      .Times(1);\n\n  \/\/ Expectations for delay manager.\n  {\n    \/\/ All expectations within this block must be called in this specific order.\n    InSequence sequence;  \/\/ Dummy variable.\n    \/\/ Expectations when the first packet is inserted.\n    EXPECT_CALL(*delay_manager_, LastDecoderType(kDecoderPCMu))\n        .Times(1);\n    EXPECT_CALL(*delay_manager_, last_pack_cng_or_dtmf())\n        .Times(2)\n        .WillRepeatedly(Return(-1));\n    EXPECT_CALL(*delay_manager_, set_last_pack_cng_or_dtmf(0))\n        .Times(1);\n    EXPECT_CALL(*delay_manager_, ResetPacketIatCount()).Times(1);\n    \/\/ Expectations when the second packet is inserted. Slightly different.\n    EXPECT_CALL(*delay_manager_, LastDecoderType(kDecoderPCMu))\n        .Times(1);\n    EXPECT_CALL(*delay_manager_, last_pack_cng_or_dtmf())\n        .WillOnce(Return(0));\n  }\n\n  \/\/ Expectations for payload splitter.\n  EXPECT_CALL(*payload_splitter_, SplitAudio(_, _))\n      .Times(2)\n      .WillRepeatedly(Return(PayloadSplitter::kOK));\n\n  \/\/ Insert first packet.\n  neteq_->InsertPacket(rtp_header, payload, kPayloadLength, kFirstReceiveTime);\n\n  \/\/ Insert second packet.\n  rtp_header.header.timestamp += 160;\n  rtp_header.header.sequenceNumber += 1;\n  neteq_->InsertPacket(rtp_header, payload, kPayloadLength,\n                       kFirstReceiveTime + 155);\n}\n\n}  \/\/ namespace webrtc\n<commit_msg>Developing NetEqImpl unit tests<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\/audio_coding\/neteq4\/interface\/neteq.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq4\/neteq_impl.h\"\n\n#include \"gmock\/gmock.h\"\n#include \"gtest\/gtest.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq4\/accelerate.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq4\/expand.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq4\/mock\/mock_audio_decoder.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq4\/mock\/mock_buffer_level_filter.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq4\/mock\/mock_decoder_database.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq4\/mock\/mock_delay_manager.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq4\/mock\/mock_delay_peak_detector.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq4\/mock\/mock_dtmf_buffer.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq4\/mock\/mock_dtmf_tone_generator.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq4\/mock\/mock_packet_buffer.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq4\/mock\/mock_payload_splitter.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq4\/preemptive_expand.h\"\n#include \"webrtc\/modules\/audio_coding\/neteq4\/timestamp_scaler.h\"\n\nusing ::testing::Return;\nusing ::testing::ReturnNull;\nusing ::testing::_;\nusing ::testing::SetArgPointee;\nusing ::testing::InSequence;\nusing ::testing::Invoke;\nusing ::testing::WithArg;\n\nnamespace webrtc {\n\n\/\/ This function is called when inserting a packet list into the mock packet\n\/\/ buffer. The purpose is to delete all inserted packets properly, to avoid\n\/\/ memory leaks in the test.\nint DeletePacketsAndReturnOk(PacketList* packet_list) {\n  PacketBuffer::DeleteAllPackets(packet_list);\n  return PacketBuffer::kOK;\n}\n\nclass NetEqImplTest : public ::testing::Test {\n protected:\n  static const int kInitSampleRateHz = 8000;\n  NetEqImplTest()\n      : neteq_(NULL),\n        mock_buffer_level_filter_(NULL),\n        buffer_level_filter_(NULL),\n        use_mock_buffer_level_filter_(true),\n        mock_decoder_database_(NULL),\n        decoder_database_(NULL),\n        use_mock_decoder_database_(true),\n        mock_delay_peak_detector_(NULL),\n        delay_peak_detector_(NULL),\n        use_mock_delay_peak_detector_(true),\n        mock_delay_manager_(NULL),\n        delay_manager_(NULL),\n        use_mock_delay_manager_(true),\n        mock_dtmf_buffer_(NULL),\n        dtmf_buffer_(NULL),\n        use_mock_dtmf_buffer_(true),\n        mock_dtmf_tone_generator_(NULL),\n        dtmf_tone_generator_(NULL),\n        use_mock_dtmf_tone_generator_(true),\n        mock_packet_buffer_(NULL),\n        packet_buffer_(NULL),\n        use_mock_packet_buffer_(true),\n        mock_payload_splitter_(NULL),\n        payload_splitter_(NULL),\n        use_mock_payload_splitter_(true),\n        timestamp_scaler_(NULL) {}\n\n  void CreateInstance() {\n    if (use_mock_buffer_level_filter_) {\n      mock_buffer_level_filter_ = new MockBufferLevelFilter;\n      buffer_level_filter_ = mock_buffer_level_filter_;\n    } else {\n      buffer_level_filter_ = new BufferLevelFilter;\n    }\n    if (use_mock_decoder_database_) {\n      mock_decoder_database_ = new MockDecoderDatabase;\n      EXPECT_CALL(*mock_decoder_database_, GetActiveCngDecoder())\n          .WillOnce(ReturnNull());\n      decoder_database_ = mock_decoder_database_;\n    } else {\n      decoder_database_ = new DecoderDatabase;\n    }\n    if (use_mock_delay_peak_detector_) {\n      mock_delay_peak_detector_ = new MockDelayPeakDetector;\n      EXPECT_CALL(*mock_delay_peak_detector_, Reset()).Times(1);\n      delay_peak_detector_ = mock_delay_peak_detector_;\n    } else {\n      delay_peak_detector_ = new DelayPeakDetector;\n    }\n    if (use_mock_delay_manager_) {\n      mock_delay_manager_ = new MockDelayManager(NetEq::kMaxNumPacketsInBuffer,\n                                                 delay_peak_detector_);\n      EXPECT_CALL(*mock_delay_manager_, set_streaming_mode(false)).Times(1);\n      delay_manager_ = mock_delay_manager_;\n    } else {\n      delay_manager_ =\n          new DelayManager(NetEq::kMaxNumPacketsInBuffer, delay_peak_detector_);\n    }\n    if (use_mock_dtmf_buffer_) {\n      mock_dtmf_buffer_ = new MockDtmfBuffer(kInitSampleRateHz);\n      dtmf_buffer_ = mock_dtmf_buffer_;\n    } else {\n      dtmf_buffer_ = new DtmfBuffer(kInitSampleRateHz);\n    }\n    if (use_mock_dtmf_tone_generator_) {\n      mock_dtmf_tone_generator_ = new MockDtmfToneGenerator;\n      dtmf_tone_generator_ = mock_dtmf_tone_generator_;\n    } else {\n      dtmf_tone_generator_ = new DtmfToneGenerator;\n    }\n    if (use_mock_packet_buffer_) {\n      mock_packet_buffer_ = new MockPacketBuffer(NetEq::kMaxNumPacketsInBuffer,\n                                                 NetEq::kMaxBytesInBuffer);\n      packet_buffer_ = mock_packet_buffer_;\n    } else {\n      packet_buffer_ = new PacketBuffer(NetEq::kMaxNumPacketsInBuffer,\n                                        NetEq::kMaxBytesInBuffer);\n    }\n    if (use_mock_payload_splitter_) {\n      mock_payload_splitter_ = new MockPayloadSplitter;\n      payload_splitter_ = mock_payload_splitter_;\n    } else {\n      payload_splitter_ = new PayloadSplitter;\n    }\n    timestamp_scaler_ = new TimestampScaler(*decoder_database_);\n    AccelerateFactory* accelerate_factory = new AccelerateFactory;\n    ExpandFactory* expand_factory = new ExpandFactory;\n    PreemptiveExpandFactory* preemptive_expand_factory =\n        new PreemptiveExpandFactory;\n\n    neteq_ = new NetEqImpl(kInitSampleRateHz,\n                           buffer_level_filter_,\n                           decoder_database_,\n                           delay_manager_,\n                           delay_peak_detector_,\n                           dtmf_buffer_,\n                           dtmf_tone_generator_,\n                           packet_buffer_,\n                           payload_splitter_,\n                           timestamp_scaler_,\n                           accelerate_factory,\n                           expand_factory,\n                           preemptive_expand_factory);\n    ASSERT_TRUE(neteq_ != NULL);\n  }\n\n  void UseNoMocks() {\n    ASSERT_TRUE(neteq_ == NULL) << \"Must call UseNoMocks before CreateInstance\";\n    use_mock_buffer_level_filter_ = false;\n    use_mock_decoder_database_ = false;\n    use_mock_delay_peak_detector_ = false;\n    use_mock_delay_manager_ = false;\n    use_mock_dtmf_buffer_ = false;\n    use_mock_dtmf_tone_generator_ = false;\n    use_mock_packet_buffer_ = false;\n    use_mock_payload_splitter_ = false;\n  }\n\n  virtual ~NetEqImplTest() {\n    if (use_mock_buffer_level_filter_) {\n      EXPECT_CALL(*mock_buffer_level_filter_, Die()).Times(1);\n    }\n    if (use_mock_decoder_database_) {\n      EXPECT_CALL(*mock_decoder_database_, Die()).Times(1);\n    }\n    if (use_mock_delay_manager_) {\n      EXPECT_CALL(*mock_delay_manager_, Die()).Times(1);\n    }\n    if (use_mock_delay_peak_detector_) {\n      EXPECT_CALL(*mock_delay_peak_detector_, Die()).Times(1);\n    }\n    if (use_mock_dtmf_buffer_) {\n      EXPECT_CALL(*mock_dtmf_buffer_, Die()).Times(1);\n    }\n    if (use_mock_dtmf_tone_generator_) {\n      EXPECT_CALL(*mock_dtmf_tone_generator_, Die()).Times(1);\n    }\n    if (use_mock_packet_buffer_) {\n      EXPECT_CALL(*mock_packet_buffer_, Die()).Times(1);\n    }\n    delete neteq_;\n  }\n\n  NetEqImpl* neteq_;\n  MockBufferLevelFilter* mock_buffer_level_filter_;\n  BufferLevelFilter* buffer_level_filter_;\n  bool use_mock_buffer_level_filter_;\n  MockDecoderDatabase* mock_decoder_database_;\n  DecoderDatabase* decoder_database_;\n  bool use_mock_decoder_database_;\n  MockDelayPeakDetector* mock_delay_peak_detector_;\n  DelayPeakDetector* delay_peak_detector_;\n  bool use_mock_delay_peak_detector_;\n  MockDelayManager* mock_delay_manager_;\n  DelayManager* delay_manager_;\n  bool use_mock_delay_manager_;\n  MockDtmfBuffer* mock_dtmf_buffer_;\n  DtmfBuffer* dtmf_buffer_;\n  bool use_mock_dtmf_buffer_;\n  MockDtmfToneGenerator* mock_dtmf_tone_generator_;\n  DtmfToneGenerator* dtmf_tone_generator_;\n  bool use_mock_dtmf_tone_generator_;\n  MockPacketBuffer* mock_packet_buffer_;\n  PacketBuffer* packet_buffer_;\n  bool use_mock_packet_buffer_;\n  MockPayloadSplitter* mock_payload_splitter_;\n  PayloadSplitter* payload_splitter_;\n  bool use_mock_payload_splitter_;\n  TimestampScaler* timestamp_scaler_;\n};\n\n\n\/\/ This tests the interface class NetEq.\n\/\/ TODO(hlundin): Move to separate file?\nTEST(NetEq, CreateAndDestroy) {\n  NetEq* neteq = NetEq::Create(8000);\n  delete neteq;\n}\n\nTEST_F(NetEqImplTest, RegisterPayloadType) {\n  CreateInstance();\n  uint8_t rtp_payload_type = 0;\n  NetEqDecoder codec_type = kDecoderPCMu;\n  EXPECT_CALL(*mock_decoder_database_,\n              RegisterPayload(rtp_payload_type, codec_type));\n  neteq_->RegisterPayloadType(codec_type, rtp_payload_type);\n}\n\nTEST_F(NetEqImplTest, RemovePayloadType) {\n  CreateInstance();\n  uint8_t rtp_payload_type = 0;\n  EXPECT_CALL(*mock_decoder_database_, Remove(rtp_payload_type))\n      .WillOnce(Return(DecoderDatabase::kDecoderNotFound));\n  \/\/ Check that kFail is returned when database returns kDecoderNotFound.\n  EXPECT_EQ(NetEq::kFail, neteq_->RemovePayloadType(rtp_payload_type));\n}\n\nTEST_F(NetEqImplTest, InsertPacket) {\n  CreateInstance();\n  const int kPayloadLength = 100;\n  const uint8_t kPayloadType = 0;\n  const uint16_t kFirstSequenceNumber = 0x1234;\n  const uint32_t kFirstTimestamp = 0x12345678;\n  const uint32_t kSsrc = 0x87654321;\n  const uint32_t kFirstReceiveTime = 17;\n  uint8_t payload[kPayloadLength] = {0};\n  WebRtcRTPHeader rtp_header;\n  rtp_header.header.payloadType = kPayloadType;\n  rtp_header.header.sequenceNumber = kFirstSequenceNumber;\n  rtp_header.header.timestamp = kFirstTimestamp;\n  rtp_header.header.ssrc = kSsrc;\n\n  \/\/ Create a mock decoder object.\n  MockAudioDecoder mock_decoder;\n  \/\/ BWE update function called with first packet.\n  EXPECT_CALL(mock_decoder, IncomingPacket(_,\n                                           kPayloadLength,\n                                           kFirstSequenceNumber,\n                                           kFirstTimestamp,\n                                           kFirstReceiveTime));\n  \/\/ BWE update function called with second packet.\n  EXPECT_CALL(mock_decoder, IncomingPacket(_,\n                                           kPayloadLength,\n                                           kFirstSequenceNumber + 1,\n                                           kFirstTimestamp + 160,\n                                           kFirstReceiveTime + 155));\n  EXPECT_CALL(mock_decoder, Die()).Times(1);  \/\/ Called when deleted.\n\n  \/\/ Expectations for decoder database.\n  EXPECT_CALL(*mock_decoder_database_, IsRed(kPayloadType))\n      .WillRepeatedly(Return(false));  \/\/ This is not RED.\n  EXPECT_CALL(*mock_decoder_database_, CheckPayloadTypes(_))\n      .Times(2)\n      .WillRepeatedly(Return(DecoderDatabase::kOK));  \/\/ Payload type is valid.\n  EXPECT_CALL(*mock_decoder_database_, IsDtmf(kPayloadType))\n      .WillRepeatedly(Return(false));  \/\/ This is not DTMF.\n  EXPECT_CALL(*mock_decoder_database_, GetDecoder(kPayloadType))\n      .Times(3)\n      .WillRepeatedly(Return(&mock_decoder));\n  EXPECT_CALL(*mock_decoder_database_, IsComfortNoise(kPayloadType))\n      .WillRepeatedly(Return(false));  \/\/ This is not CNG.\n  DecoderDatabase::DecoderInfo info;\n  info.codec_type = kDecoderPCMu;\n  EXPECT_CALL(*mock_decoder_database_, GetDecoderInfo(kPayloadType))\n      .WillRepeatedly(Return(&info));\n\n  \/\/ Expectations for packet buffer.\n  EXPECT_CALL(*mock_packet_buffer_, NumPacketsInBuffer())\n      .WillOnce(Return(0))   \/\/ First packet.\n      .WillOnce(Return(1))   \/\/ Second packet.\n      .WillOnce(Return(2));  \/\/ Second packet, checking after it was inserted.\n  EXPECT_CALL(*mock_packet_buffer_, Empty())\n      .WillOnce(Return(false));  \/\/ Called once after first packet is inserted.\n  EXPECT_CALL(*mock_packet_buffer_, Flush())\n      .Times(1);\n  EXPECT_CALL(*mock_packet_buffer_, InsertPacketList(_, _, _, _))\n      .Times(2)\n      .WillRepeatedly(DoAll(SetArgPointee<2>(kPayloadType),\n                            WithArg<0>(Invoke(DeletePacketsAndReturnOk))));\n  \/\/ SetArgPointee<2>(kPayloadType) means that the third argument (zero-based\n  \/\/ index) is a pointer, and the variable pointed to is set to kPayloadType.\n  \/\/ Also invoke the function DeletePacketsAndReturnOk to properly delete all\n  \/\/ packets in the list (to avoid memory leaks in the test).\n  EXPECT_CALL(*mock_packet_buffer_, NextRtpHeader())\n      .Times(1)\n      .WillOnce(Return(&rtp_header.header));\n\n  \/\/ Expectations for DTMF buffer.\n  EXPECT_CALL(*mock_dtmf_buffer_, Flush())\n      .Times(1);\n\n  \/\/ Expectations for delay manager.\n  {\n    \/\/ All expectations within this block must be called in this specific order.\n    InSequence sequence;  \/\/ Dummy variable.\n    \/\/ Expectations when the first packet is inserted.\n    EXPECT_CALL(*mock_delay_manager_, LastDecoderType(kDecoderPCMu))\n        .Times(1);\n    EXPECT_CALL(*mock_delay_manager_, last_pack_cng_or_dtmf())\n        .Times(2)\n        .WillRepeatedly(Return(-1));\n    EXPECT_CALL(*mock_delay_manager_, set_last_pack_cng_or_dtmf(0))\n        .Times(1);\n    EXPECT_CALL(*mock_delay_manager_, ResetPacketIatCount()).Times(1);\n    \/\/ Expectations when the second packet is inserted. Slightly different.\n    EXPECT_CALL(*mock_delay_manager_, LastDecoderType(kDecoderPCMu))\n        .Times(1);\n    EXPECT_CALL(*mock_delay_manager_, last_pack_cng_or_dtmf())\n        .WillOnce(Return(0));\n    EXPECT_CALL(*mock_delay_manager_, SetPacketAudioLength(30))\n        .WillOnce(Return(0));\n  }\n\n  \/\/ Expectations for payload splitter.\n  EXPECT_CALL(*mock_payload_splitter_, SplitAudio(_, _))\n      .Times(2)\n      .WillRepeatedly(Return(PayloadSplitter::kOK));\n\n  \/\/ Insert first packet.\n  neteq_->InsertPacket(rtp_header, payload, kPayloadLength, kFirstReceiveTime);\n\n  \/\/ Insert second packet.\n  rtp_header.header.timestamp += 160;\n  rtp_header.header.sequenceNumber += 1;\n  neteq_->InsertPacket(rtp_header, payload, kPayloadLength,\n                       kFirstReceiveTime + 155);\n}\n\nTEST_F(NetEqImplTest, InsertPacketsUntilBufferIsFull) {\n  UseNoMocks();\n  CreateInstance();\n\n  const int kPayloadLengthSamples = 80;\n  const size_t kPayloadLengthBytes = 2 * kPayloadLengthSamples;  \/\/ PCM 16-bit.\n  const uint8_t kPayloadType = 17;  \/\/ Just an arbitrary number.\n  const uint32_t kReceiveTime = 17;  \/\/ Value doesn't matter for this test.\n  uint8_t payload[kPayloadLengthBytes] = {0};\n  WebRtcRTPHeader rtp_header;\n  rtp_header.header.payloadType = kPayloadType;\n  rtp_header.header.sequenceNumber = 0x1234;\n  rtp_header.header.timestamp = 0x12345678;\n  rtp_header.header.ssrc = 0x87654321;\n\n  EXPECT_EQ(NetEq::kOK,\n            neteq_->RegisterPayloadType(kDecoderPCM16B, kPayloadType));\n\n  \/\/ Insert packets. The buffer should not flush.\n  for (int i = 1; i <= NetEq::kMaxNumPacketsInBuffer; ++i) {\n    EXPECT_EQ(NetEq::kOK,\n              neteq_->InsertPacket(\n                  rtp_header, payload, kPayloadLengthBytes, kReceiveTime));\n    rtp_header.header.timestamp += kPayloadLengthSamples;\n    rtp_header.header.sequenceNumber += 1;\n    EXPECT_EQ(i, packet_buffer_->NumPacketsInBuffer());\n  }\n\n  \/\/ Insert one more packet and make sure the buffer got flushed. That is, it\n  \/\/ should only hold one single packet.\n  EXPECT_EQ(NetEq::kOK,\n            neteq_->InsertPacket(\n                rtp_header, payload, kPayloadLengthBytes, kReceiveTime));\n  EXPECT_EQ(1, packet_buffer_->NumPacketsInBuffer());\n  const RTPHeader* test_header = packet_buffer_->NextRtpHeader();\n  EXPECT_EQ(rtp_header.header.timestamp, test_header->timestamp);\n  EXPECT_EQ(rtp_header.header.sequenceNumber, test_header->sequenceNumber);\n}\n\n}  \/\/ namespace webrtc\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 \"IOTransportTest.h\"\n\n#include <activemq\/transport\/IOTransport.h>\n#include <activemq\/transport\/TransportListener.h>\n#include <activemq\/wireformat\/WireFormat.h>\n#include <activemq\/commands\/BaseCommand.h>\n#include <decaf\/util\/concurrent\/Concurrent.h>\n#include <decaf\/util\/concurrent\/CountDownLatch.h>\n#include <decaf\/util\/concurrent\/Mutex.h>\n#include <decaf\/io\/BufferedInputStream.h>\n#include <decaf\/io\/BufferedOutputStream.h>\n#include <decaf\/io\/BlockingByteArrayInputStream.h>\n#include <decaf\/io\/ByteArrayOutputStream.h>\n#include <decaf\/lang\/Thread.h>\n#include <decaf\/lang\/Exception.h>\n#include <decaf\/util\/Random.h>\n\nusing namespace activemq;\nusing namespace activemq::transport;\nusing namespace activemq::exceptions;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nclass MyCommand : public commands::BaseCommand{\npublic:\n    MyCommand(){ c = 0; }\n    virtual ~MyCommand(){}\n\n    char c;\n\n    virtual unsigned char getDataStructureType() const { return 1; }\n\n    virtual decaf::lang::Pointer<commands::Command> visit( activemq::state::CommandVisitor* visitor )\n        throw( exceptions::ActiveMQException ) { return decaf::lang::Pointer<commands::Command>(); }\n\n    virtual std::string toString() const{ return \"\"; }\n    virtual MyCommand* cloneDataStructure() const{\n        MyCommand* command = new MyCommand;\n        command->c = c;\n        return command;\n    }\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nclass MyWireFormat : public wireformat::WireFormat {\npublic:\n\n    MyWireFormat(){ throwException = false; }\n    virtual ~MyWireFormat(){}\n\n    bool throwException;\n\n    virtual void setVersion( int version ) {}\n\n    virtual int getVersion() const { return 0; }\n\n    virtual bool hasNegotiator() const { return false; }\n\n    virtual Pointer<Transport> createNegotiator(\n        const Pointer<transport::Transport>& transport )\n            throw( decaf::lang::exceptions::UnsupportedOperationException ) {\n\n        return Pointer<wireformat::WireFormatNegotiator>();\n    }\n\n    virtual Pointer<commands::Command> unmarshal( decaf::io::DataInputStream* inputStream )\n        throw ( CommandIOException ){\n\n        try{\n            if( throwException ){\n                throw CommandIOException();\n            }\n\n            decaf::util::Random randGen;\n\n            synchronized( inputStream ){\n\n                Pointer<MyCommand> command( new MyCommand() );\n                try{\n\n                    \/\/ Throw a little uncertainty into the test.\n                    unsigned int randWait = randGen.nextInt( 50 );\n                    decaf::lang::Thread::sleep( randWait );\n\n                    command->c = inputStream->readByte();\n\n                } catch( decaf::lang::Exception& ex ){\n                    ex.setMark( __FILE__, __LINE__ );\n                    throw CommandIOException();\n                } catch( ... ) {\n                    throw CommandIOException( __FILE__, __LINE__, \"Catch all\" );\n                }\n\n                return command;\n            }\n\n            CPPUNIT_ASSERT( false );\n            return Pointer<Command>();\n\n        }catch( decaf::lang::Exception& ex ){\n            CommandIOException cx;\n            cx.setMark( __FILE__, __LINE__ );\n            throw cx;\n        }\n        catch( ... ){\n            CommandIOException cx;\n            cx.setMark( __FILE__, __LINE__ );\n            throw cx;\n        }\n    }\n\n    virtual void marshal( const Pointer<commands::Command>& command,\n                          decaf::io::DataOutputStream* outputStream )\n        throw (CommandIOException)\n    {\n        try{\n\n            synchronized( outputStream ){\n\n                const MyCommand* m =\n                    dynamic_cast<const MyCommand*>(command.get());\n                outputStream->write( m->c );\n            }\n\n        }catch( decaf::lang::Exception& ex ){\n            ex.setMark( __FILE__, __LINE__ );\n            throw CommandIOException( ex );\n        }\n        catch(...){\n            throw CommandIOException( __FILE__, __LINE__, \"writeCommand\");\n        }\n    }\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nclass MyTransportListener : public TransportListener{\nprivate:\n\n    decaf::util::concurrent::CountDownLatch latch;\n\npublic:\n\n    decaf::util::concurrent::Mutex mutex;\n    bool caughtOne;\n\n    MyTransportListener() : latch(1), caughtOne( false ) {}\n    MyTransportListener( unsigned int num ) : latch( num ), caughtOne( false ) {}\n    virtual ~MyTransportListener(){}\n\n    virtual void await() {\n        latch.await();\n    }\n\n    std::string str;\n    virtual void onCommand( const Pointer<commands::Command>& command ){\n        const MyCommand* cmd = dynamic_cast<const MyCommand*>(command.get());\n        str += cmd->c;\n        latch.countDown();\n    }\n\n    virtual void onException( const decaf::lang::Exception& ex AMQCPP_UNUSED){\n\n        this->caughtOne = true;\n        synchronized( &mutex )\n        {\n           mutex.notify();\n        }\n    }\n\n    \/**\n     * The transport has suffered an interruption from which it hopes to recover\n     *\/\n    virtual void transportInterrupted() {}\n\n    \/**\n     * The transport has resumed after an interruption\n     *\/\n    virtual void transportResumed() {}\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ This will just test that we can start and stop the\n\/\/ transport without any exceptions.\nvoid IOTransportTest::testStartClose(){\n\n    decaf::io::BlockingByteArrayInputStream is;\n    decaf::io::ByteArrayOutputStream os;\n    decaf::io::DataInputStream input( &is );\n    decaf::io::DataOutputStream output( &os );\n    MyTransportListener listener;\n    Pointer<MyWireFormat> wireFormat( new MyWireFormat() );\n    IOTransport transport( wireFormat );\n    transport.setTransportListener( &listener );\n    transport.setInputStream( &input );\n    transport.setOutputStream( &output );\n\n    transport.start();\n    decaf::lang::Thread::sleep( 60 );\n    transport.close();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid IOTransportTest::testStressTransportStartClose(){\n\n    decaf::io::BlockingByteArrayInputStream is;\n    decaf::io::ByteArrayOutputStream os;\n    decaf::io::BufferedInputStream bis( &is );\n    decaf::io::BufferedOutputStream bos( &os );\n    decaf::io::DataInputStream input( &bis );\n    decaf::io::DataOutputStream output( &bos );\n\n    Pointer<MyWireFormat> wireFormat( new MyWireFormat() );\n    MyTransportListener listener;\n\n    for( int i = 0; i < 50; ++i ) {\n\n        IOTransport transport;\n        transport.setWireFormat( wireFormat );\n        transport.setTransportListener( &listener );\n        transport.setInputStream( &input );\n        transport.setOutputStream( &output );\n\n        transport.start();\n        unsigned char buffer[10] = { '1', '2', '3', '4', '5', '6', '7', '8', '9', '0' };\n        try{\n            synchronized( &is ){\n                is.setByteArray( buffer, 10 );\n            }\n        }catch( decaf::lang::Exception& ex ){\n            ex.setMark( __FILE__, __LINE__ );\n        }\n        decaf::lang::Thread::yield();\n        transport.close();\n    }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid IOTransportTest::testRead(){\n\n    decaf::io::BlockingByteArrayInputStream is;\n    decaf::io::ByteArrayOutputStream os;\n    decaf::io::DataInputStream input( &is );\n    decaf::io::DataOutputStream output( &os );\n\n    Pointer<MyWireFormat> wireFormat( new MyWireFormat() );\n    MyTransportListener listener(10);\n    IOTransport transport;\n    transport.setInputStream( &input );\n    transport.setOutputStream( &output );\n    transport.setTransportListener( &listener );\n    transport.setWireFormat( wireFormat );\n\n    transport.start();\n\n    decaf::lang::Thread::sleep( 10 );\n\n    unsigned char buffer[10] = { '1', '2', '3', '4', '5', '6', '7', '8', '9', '0' };\n    try{\n        synchronized( &is ){\n            is.setByteArray( buffer, 10 );\n        }\n    }catch( decaf::lang::Exception& ex ){\n        ex.setMark( __FILE__, __LINE__ );\n    }\n\n    listener.await();\n\n    CPPUNIT_ASSERT( listener.str == \"1234567890\" );\n\n    transport.close();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid IOTransportTest::testWrite(){\n\n    decaf::io::BlockingByteArrayInputStream is;\n    decaf::io::ByteArrayOutputStream os;\n    decaf::io::DataInputStream input( &is );\n    decaf::io::DataOutputStream output( &os );\n\n    Pointer<MyWireFormat> wireFormat( new MyWireFormat() );\n    MyTransportListener listener;\n    IOTransport transport;\n    transport.setInputStream( &input );\n    transport.setOutputStream( &output );\n    transport.setTransportListener( &listener );\n    transport.setWireFormat( wireFormat );\n\n    transport.start();\n\n    Pointer<MyCommand> cmd( new MyCommand() );\n    cmd->c = '1';\n    transport.oneway( cmd );\n    cmd->c = '2';\n    transport.oneway( cmd );\n    cmd->c = '3';\n    transport.oneway( cmd );\n    cmd->c = '4';\n    transport.oneway( cmd );\n    cmd->c = '5';\n    transport.oneway( cmd );\n\n    const unsigned char* bytes = os.toByteArray();\n    std::size_t size = os.size();\n    CPPUNIT_ASSERT( size >= 5 );\n    CPPUNIT_ASSERT( bytes[0] == '1' );\n    CPPUNIT_ASSERT( bytes[1] == '2' );\n    CPPUNIT_ASSERT( bytes[2] == '3' );\n    CPPUNIT_ASSERT( bytes[3] == '4' );\n    CPPUNIT_ASSERT( bytes[4] == '5' );\n\n    transport.close();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid IOTransportTest::testException(){\n\n    decaf::io::BlockingByteArrayInputStream is;\n    decaf::io::ByteArrayOutputStream os;\n    decaf::io::DataInputStream input( &is );\n    decaf::io::DataOutputStream output( &os );\n\n    Pointer<MyWireFormat> wireFormat( new MyWireFormat() );\n    MyTransportListener listener;\n    IOTransport transport;\n    wireFormat->throwException = true;\n    transport.setInputStream( &input );\n    transport.setOutputStream( &output );\n    transport.setTransportListener( &listener );\n    transport.setWireFormat( wireFormat );\n\n    unsigned char buffer[1] = { '1' };\n    try{\n        synchronized( &is ){\n            is.setByteArray( buffer, 1);\n        }\n    }catch( decaf::lang::Exception& ex ){\n        ex.setMark(__FILE__, __LINE__ );\n    }\n\n    transport.start();\n\n    synchronized(&listener.mutex) {\n        if( !listener.caughtOne ) {\n            listener.mutex.wait(1000);\n         }\n    }\n\n    transport.close();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid IOTransportTest::testNarrow(){\n\n    IOTransport transport;\n\n    Transport* narrowed = transport.narrow( typeid( transport ) );\n    CPPUNIT_ASSERT( narrowed == &transport );\n\n    narrowed = transport.narrow( typeid( std::string() ) );\n    CPPUNIT_ASSERT( narrowed == NULL );\n\n    narrowed = transport.narrow( typeid( transport::IOTransport ) );\n    CPPUNIT_ASSERT( narrowed == &transport );\n\n}\n<commit_msg>Fix a segfault issue in this test.<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 \"IOTransportTest.h\"\n\n#include <activemq\/transport\/IOTransport.h>\n#include <activemq\/transport\/TransportListener.h>\n#include <activemq\/wireformat\/WireFormat.h>\n#include <activemq\/commands\/BaseCommand.h>\n#include <decaf\/lang\/exceptions\/NullPointerException.h>\n#include <decaf\/util\/concurrent\/Concurrent.h>\n#include <decaf\/util\/concurrent\/CountDownLatch.h>\n#include <decaf\/util\/concurrent\/Mutex.h>\n#include <decaf\/io\/BufferedInputStream.h>\n#include <decaf\/io\/BufferedOutputStream.h>\n#include <decaf\/io\/BlockingByteArrayInputStream.h>\n#include <decaf\/io\/ByteArrayOutputStream.h>\n#include <decaf\/lang\/Thread.h>\n#include <decaf\/lang\/Exception.h>\n#include <decaf\/util\/Random.h>\n\nusing namespace activemq;\nusing namespace activemq::transport;\nusing namespace activemq::exceptions;\nusing namespace decaf::lang::exceptions;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nclass MyCommand : public commands::BaseCommand{\npublic:\n    MyCommand(){ c = 0; }\n    virtual ~MyCommand(){}\n\n    char c;\n\n    virtual unsigned char getDataStructureType() const { return 1; }\n\n    virtual decaf::lang::Pointer<commands::Command> visit( activemq::state::CommandVisitor* visitor )\n        throw( exceptions::ActiveMQException ) { return decaf::lang::Pointer<commands::Command>(); }\n\n    virtual std::string toString() const{ return \"\"; }\n    virtual MyCommand* cloneDataStructure() const{\n        MyCommand* command = new MyCommand;\n        command->c = c;\n        return command;\n    }\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nclass MyWireFormat : public wireformat::WireFormat {\npublic:\n\n    MyWireFormat(){ throwException = false; }\n    virtual ~MyWireFormat(){}\n\n    bool throwException;\n\n    virtual void setVersion( int version ) {}\n\n    virtual int getVersion() const { return 0; }\n\n    virtual bool hasNegotiator() const { return false; }\n\n    virtual Pointer<Transport> createNegotiator(\n        const Pointer<transport::Transport>& transport )\n            throw( decaf::lang::exceptions::UnsupportedOperationException ) {\n\n        return Pointer<wireformat::WireFormatNegotiator>();\n    }\n\n    virtual Pointer<commands::Command> unmarshal( decaf::io::DataInputStream* inputStream )\n        throw ( CommandIOException ){\n\n        try{\n            if( throwException ){\n                throw CommandIOException();\n            }\n\n            if( inputStream == NULL ) {\n                throw NullPointerException(\n                    __FILE__, __LINE__, \"InputStream passed is Null\" );\n            }\n\n            decaf::util::Random randGen;\n\n            synchronized( inputStream ){\n\n                Pointer<MyCommand> command( new MyCommand() );\n                try{\n\n                    \/\/ Throw a little uncertainty into the test.\n                    unsigned int randWait = randGen.nextInt( 50 );\n                    decaf::lang::Thread::sleep( randWait );\n\n                    command->c = inputStream->readByte();\n\n                } catch( decaf::lang::Exception& ex ){\n                    ex.setMark( __FILE__, __LINE__ );\n                    throw CommandIOException();\n                } catch( ... ) {\n                    throw CommandIOException( __FILE__, __LINE__, \"Catch all\" );\n                }\n\n                return command;\n            }\n\n            CPPUNIT_ASSERT( false );\n            return Pointer<Command>();\n\n        }catch( decaf::lang::Exception& ex ){\n            CommandIOException cx;\n            cx.setMark( __FILE__, __LINE__ );\n            throw cx;\n        }\n        catch( ... ){\n            CommandIOException cx;\n            cx.setMark( __FILE__, __LINE__ );\n            throw cx;\n        }\n    }\n\n    virtual void marshal( const Pointer<commands::Command>& command,\n                          decaf::io::DataOutputStream* outputStream )\n        throw (CommandIOException)\n    {\n        try{\n\n            synchronized( outputStream ){\n\n                const MyCommand* m =\n                    dynamic_cast<const MyCommand*>(command.get());\n                outputStream->write( m->c );\n            }\n\n        }catch( decaf::lang::Exception& ex ){\n            ex.setMark( __FILE__, __LINE__ );\n            throw CommandIOException( ex );\n        }\n        catch(...){\n            throw CommandIOException( __FILE__, __LINE__, \"writeCommand\");\n        }\n    }\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nclass MyTransportListener : public TransportListener{\nprivate:\n\n    decaf::util::concurrent::CountDownLatch latch;\n\npublic:\n\n    decaf::util::concurrent::Mutex mutex;\n    bool caughtOne;\n\n    MyTransportListener() : latch(1), caughtOne( false ) {}\n    MyTransportListener( unsigned int num ) : latch( num ), caughtOne( false ) {}\n    virtual ~MyTransportListener(){}\n\n    virtual void await() {\n        latch.await();\n    }\n\n    std::string str;\n    virtual void onCommand( const Pointer<commands::Command>& command ){\n        const MyCommand* cmd = dynamic_cast<const MyCommand*>(command.get());\n        str += cmd->c;\n        latch.countDown();\n    }\n\n    virtual void onException( const decaf::lang::Exception& ex AMQCPP_UNUSED){\n\n        this->caughtOne = true;\n        synchronized( &mutex )\n        {\n           mutex.notify();\n        }\n    }\n\n    \/**\n     * The transport has suffered an interruption from which it hopes to recover\n     *\/\n    virtual void transportInterrupted() {}\n\n    \/**\n     * The transport has resumed after an interruption\n     *\/\n    virtual void transportResumed() {}\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ This will just test that we can start and stop the\n\/\/ transport without any exceptions.\nvoid IOTransportTest::testStartClose(){\n\n    decaf::io::BlockingByteArrayInputStream is;\n    decaf::io::ByteArrayOutputStream os;\n    decaf::io::DataInputStream input( &is );\n    decaf::io::DataOutputStream output( &os );\n    MyTransportListener listener;\n    Pointer<MyWireFormat> wireFormat( new MyWireFormat() );\n    IOTransport transport( wireFormat );\n    transport.setTransportListener( &listener );\n    transport.setInputStream( &input );\n    transport.setOutputStream( &output );\n\n    transport.start();\n    decaf::lang::Thread::sleep( 60 );\n    transport.close();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid IOTransportTest::testStressTransportStartClose(){\n\n    decaf::io::BlockingByteArrayInputStream is;\n    decaf::io::ByteArrayOutputStream os;\n    decaf::io::BufferedInputStream bis( &is );\n    decaf::io::BufferedOutputStream bos( &os );\n    decaf::io::DataInputStream input( &bis );\n    decaf::io::DataOutputStream output( &bos );\n\n    Pointer<MyWireFormat> wireFormat( new MyWireFormat() );\n    MyTransportListener listener;\n\n    for( int i = 0; i < 50; ++i ) {\n\n        IOTransport transport;\n        transport.setWireFormat( wireFormat );\n        transport.setTransportListener( &listener );\n        transport.setInputStream( &input );\n        transport.setOutputStream( &output );\n\n        transport.start();\n        unsigned char buffer[10] = { '1', '2', '3', '4', '5', '6', '7', '8', '9', '0' };\n        try{\n            synchronized( &is ){\n                is.setByteArray( buffer, 10 );\n            }\n        }catch( decaf::lang::Exception& ex ){\n            ex.setMark( __FILE__, __LINE__ );\n        }\n        decaf::lang::Thread::yield();\n        transport.close();\n    }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid IOTransportTest::testRead(){\n\n    decaf::io::BlockingByteArrayInputStream is;\n    decaf::io::ByteArrayOutputStream os;\n    decaf::io::DataInputStream input( &is );\n    decaf::io::DataOutputStream output( &os );\n\n    Pointer<MyWireFormat> wireFormat( new MyWireFormat() );\n    MyTransportListener listener(10);\n    IOTransport transport;\n    transport.setInputStream( &input );\n    transport.setOutputStream( &output );\n    transport.setTransportListener( &listener );\n    transport.setWireFormat( wireFormat );\n\n    transport.start();\n\n    decaf::lang::Thread::sleep( 10 );\n\n    unsigned char buffer[10] = { '1', '2', '3', '4', '5', '6', '7', '8', '9', '0' };\n    try{\n        synchronized( &is ){\n            is.setByteArray( buffer, 10 );\n        }\n    }catch( decaf::lang::Exception& ex ){\n        ex.setMark( __FILE__, __LINE__ );\n    }\n\n    listener.await();\n\n    CPPUNIT_ASSERT( listener.str == \"1234567890\" );\n\n    transport.close();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid IOTransportTest::testWrite(){\n\n    decaf::io::BlockingByteArrayInputStream is;\n    decaf::io::ByteArrayOutputStream os;\n    decaf::io::DataInputStream input( &is );\n    decaf::io::DataOutputStream output( &os );\n\n    Pointer<MyWireFormat> wireFormat( new MyWireFormat() );\n    MyTransportListener listener;\n    IOTransport transport;\n    transport.setInputStream( &input );\n    transport.setOutputStream( &output );\n    transport.setTransportListener( &listener );\n    transport.setWireFormat( wireFormat );\n\n    transport.start();\n\n    Pointer<MyCommand> cmd( new MyCommand() );\n    cmd->c = '1';\n    transport.oneway( cmd );\n    cmd->c = '2';\n    transport.oneway( cmd );\n    cmd->c = '3';\n    transport.oneway( cmd );\n    cmd->c = '4';\n    transport.oneway( cmd );\n    cmd->c = '5';\n    transport.oneway( cmd );\n\n    const unsigned char* bytes = os.toByteArray();\n    std::size_t size = os.size();\n    CPPUNIT_ASSERT( size >= 5 );\n    CPPUNIT_ASSERT( bytes[0] == '1' );\n    CPPUNIT_ASSERT( bytes[1] == '2' );\n    CPPUNIT_ASSERT( bytes[2] == '3' );\n    CPPUNIT_ASSERT( bytes[3] == '4' );\n    CPPUNIT_ASSERT( bytes[4] == '5' );\n\n    transport.close();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid IOTransportTest::testException(){\n\n    decaf::io::BlockingByteArrayInputStream is;\n    decaf::io::ByteArrayOutputStream os;\n    decaf::io::DataInputStream input( &is );\n    decaf::io::DataOutputStream output( &os );\n\n    Pointer<MyWireFormat> wireFormat( new MyWireFormat() );\n    MyTransportListener listener;\n    IOTransport transport;\n    wireFormat->throwException = true;\n    transport.setInputStream( &input );\n    transport.setOutputStream( &output );\n    transport.setTransportListener( &listener );\n    transport.setWireFormat( wireFormat );\n\n    unsigned char buffer[1] = { '1' };\n    try{\n        synchronized( &is ){\n            is.setByteArray( buffer, 1);\n        }\n    }catch( decaf::lang::Exception& ex ){\n        ex.setMark(__FILE__, __LINE__ );\n    }\n\n    transport.start();\n\n    synchronized(&listener.mutex) {\n        if( !listener.caughtOne ) {\n            listener.mutex.wait(1000);\n         }\n    }\n\n    transport.close();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid IOTransportTest::testNarrow(){\n\n    IOTransport transport;\n\n    Transport* narrowed = transport.narrow( typeid( transport ) );\n    CPPUNIT_ASSERT( narrowed == &transport );\n\n    narrowed = transport.narrow( typeid( std::string() ) );\n    CPPUNIT_ASSERT( narrowed == NULL );\n\n    narrowed = transport.narrow( typeid( transport::IOTransport ) );\n    CPPUNIT_ASSERT( narrowed == &transport );\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\r\n#ifndef BPPBenchmarker_h__\r\n#define BPPBenchmarker_h__\r\n#include <string>\r\n#include <map>\r\nnamespace bpp\r\n{\r\n\tclass BenchmarkScope;\r\n\ttemplate < class T >\r\n\tclass FactoryContainer;\r\n\r\n\t\/**\r\n\t\\brief The main class for benchmarking. Contains all scopes used for benchmarking, runs the benchmarks itself\r\n\tand uses writers to print the output.\r\n\r\n\tTypical Usage:\r\n\t\\code{.cpp}\r\n\tvoid main()\r\n\t{\r\n\t\tBenchmarker& instance = Benchmarker::Instance();\r\n\r\n\t\tMyLogger logger(\"SomeFile.log\"); \/\/Placeholder for your logger\r\n\t\tinstance.AddLogger(&logger);\r\n\t\tinstance.Run();\r\n\t\tinstance.Log();\r\n\r\n\t\tinstance.Release();\r\n\t}\r\n\t\\endcode\r\n\t\r\n\t*\/\r\n\tclass Benchmarker\r\n\t{\r\n\tpublic:\r\n\r\n\r\n\t\ttypedef FactoryContainer<BenchmarkScope*> ScopeContainer;\r\n\r\n\t\t\/**\r\n\t\t\\brief Gets the scope with the given name or a new Scope if none is existent with that name\r\n\t\t\r\n\t\t*\/\r\n\t\tBenchmarkScope* Scope( const std::string& name ) const;\r\n\r\n\t\t\/**\r\n\t\t\\brief Cleans up all data used by the benchmarker, the added scopes and writers added to the benchmarker.\r\n\t\t\r\n\t\t*\/\r\n\t\tstatic void Release( void );\r\n\r\n\t\t\/**\r\n\t\t\\brief Returns a valid instance of the benchmarker as long as there is enough memory available.\r\n\t\t\r\n\t\tCreates a new valid instance if none is yet created.\r\n\t\t\r\n\t\t*\/\r\n\t\tstatic Benchmarker& Instance( void );\r\n\r\n\t\t\/**\r\n\t\t\\brief Runs the registered Tests in the scopes and saves the results for the logger.\r\n\t\t\r\n\t\t*\/\r\n\t\tvoid Run( void );\r\n\r\n\t\tBenchmarkScope* CurrentScope( void ) const;\r\n\t\tvoid CurrentScope( BenchmarkScope* scope );\r\n\r\n\t\t\/**\r\n\t\t\\brief Adds a logger to the logging queue.\r\n\r\n\t\tThe logger will be initialized, called and released in the Log() Method.\r\n\t\tThe ownership of the logger is kept by the caller of this method.\r\n\t\t\r\n\t\t*\/\r\n\t\tvoid AddLogger( ILogger* logger );\r\n\r\n\t\t\/**\r\n\t\t\\brief Logs the results using the logger which were added.\r\n\t\tCalling this method only makes sense after the Benchmarks has been performed using the Run() Method.\r\n\r\n\t\tLoggers are going to be initialized, called and released during this process.\r\n\r\n\t\tThis is basically a NOP if no loggers were added to the Benchmarker.\r\n\t\t\r\n\t\t*\/\r\n\t\tvoid Log( void );\r\n\r\n\t\t\r\n\t\t\/**\r\n\t\t\\brief Sets the iterations of the Benchmarker\r\n\r\n\t\tThe iterations determines how often the benchmarks are repeated to reduce side effects of spontaneous spikes\r\n\t\tKeep in mind that if set to greater than 1 the tests need to be repeatable. If the tests are not repeatable, \r\n\t\tset the iteration to 1\r\n\t\t\r\n\t\t\\param val How often the tests will be repeated, value of 0 or 1 has the same effect\r\n\t\t*\/\r\n\t\tvoid Iterations( unsigned int val );\r\n\r\n\t\t\/**\r\n\t\t\\brief Returns the current iteration of the Benchmarker, \r\n\t\tthis can be changed by using the Iterations( unsigned int ) Method\r\n\t\t\r\n\t\t*\/\r\n\t\tunsigned int Iterations( void ) const;\r\n\r\n\r\n\tprotected:\r\n\tprivate:\r\n\r\n\t\tunsigned int m_Iterations;\r\n\t\tBenchmarker( const Benchmarker& rhs ) = delete;\r\n\t\tBenchmarker( void );\r\n\r\n\t\tstd::vector< ILogger* > m_Logger;\r\n\r\n\t\tstd::vector<ResultScope*> m_Results;\r\n\r\n\t\tBenchmarkScope* m_CurrentScope;\r\n\r\n\t\tstatic Benchmarker*& InternalInstance( bool createIfNotInstanced = true );\r\n\r\n\t};\r\n\r\n\r\n\r\n}\r\n\r\n#include \"BPPBenchmarker.inl\"\r\n\r\n#endif \/\/ BPPBenchmarker_h__\r\n<commit_msg>Removed delete on default constructor to work with VS 2012<commit_after>#pragma once\r\n#ifndef BPPBenchmarker_h__\r\n#define BPPBenchmarker_h__\r\n#include <string>\r\n#include <map>\r\nnamespace bpp\r\n{\r\n\tclass BenchmarkScope;\r\n\ttemplate < class T >\r\n\tclass FactoryContainer;\r\n\r\n\t\/**\r\n\t\\brief The main class for benchmarking. Contains all scopes used for benchmarking, runs the benchmarks itself\r\n\tand uses writers to print the output.\r\n\r\n\tTypical Usage:\r\n\t\\code{.cpp}\r\n\tvoid main()\r\n\t{\r\n\t\tBenchmarker& instance = Benchmarker::Instance();\r\n\r\n\t\tMyLogger logger(\"SomeFile.log\"); \/\/Placeholder for your logger\r\n\t\tinstance.AddLogger(&logger);\r\n\t\tinstance.Run();\r\n\t\tinstance.Log();\r\n\r\n\t\tinstance.Release();\r\n\t}\r\n\t\\endcode\r\n\t\r\n\t*\/\r\n\tclass Benchmarker\r\n\t{\r\n\tpublic:\r\n\r\n\r\n\t\ttypedef FactoryContainer<BenchmarkScope*> ScopeContainer;\r\n\r\n\t\t\/**\r\n\t\t\\brief Gets the scope with the given name or a new Scope if none is existent with that name\r\n\t\t\r\n\t\t*\/\r\n\t\tBenchmarkScope* Scope( const std::string& name ) const;\r\n\r\n\t\t\/**\r\n\t\t\\brief Cleans up all data used by the benchmarker, the added scopes and writers added to the benchmarker.\r\n\t\t\r\n\t\t*\/\r\n\t\tstatic void Release( void );\r\n\r\n\t\t\/**\r\n\t\t\\brief Returns a valid instance of the benchmarker as long as there is enough memory available.\r\n\t\t\r\n\t\tCreates a new valid instance if none is yet created.\r\n\t\t\r\n\t\t*\/\r\n\t\tstatic Benchmarker& Instance( void );\r\n\r\n\t\t\/**\r\n\t\t\\brief Runs the registered Tests in the scopes and saves the results for the logger.\r\n\t\t\r\n\t\t*\/\r\n\t\tvoid Run( void );\r\n\r\n\t\tBenchmarkScope* CurrentScope( void ) const;\r\n\t\tvoid CurrentScope( BenchmarkScope* scope );\r\n\r\n\t\t\/**\r\n\t\t\\brief Adds a logger to the logging queue.\r\n\r\n\t\tThe logger will be initialized, called and released in the Log() Method.\r\n\t\tThe ownership of the logger is kept by the caller of this method.\r\n\t\t\r\n\t\t*\/\r\n\t\tvoid AddLogger( ILogger* logger );\r\n\r\n\t\t\/**\r\n\t\t\\brief Logs the results using the logger which were added.\r\n\t\tCalling this method only makes sense after the Benchmarks has been performed using the Run() Method.\r\n\r\n\t\tLoggers are going to be initialized, called and released during this process.\r\n\r\n\t\tThis is basically a NOP if no loggers were added to the Benchmarker.\r\n\t\t\r\n\t\t*\/\r\n\t\tvoid Log( void );\r\n\r\n\t\t\r\n\t\t\/**\r\n\t\t\\brief Sets the iterations of the Benchmarker\r\n\r\n\t\tThe iterations determines how often the benchmarks are repeated to reduce side effects of spontaneous spikes\r\n\t\tKeep in mind that if set to greater than 1 the tests need to be repeatable. If the tests are not repeatable, \r\n\t\tset the iteration to 1\r\n\t\t\r\n\t\t\\param val How often the tests will be repeated, value of 0 or 1 has the same effect\r\n\t\t*\/\r\n\t\tvoid Iterations( unsigned int val );\r\n\r\n\t\t\/**\r\n\t\t\\brief Returns the current iteration of the Benchmarker, \r\n\t\tthis can be changed by using the Iterations( unsigned int ) Method\r\n\t\t\r\n\t\t*\/\r\n\t\tunsigned int Iterations( void ) const;\r\n\r\n\r\n\tprotected:\r\n\tprivate:\r\n\r\n\t\tunsigned int m_Iterations;\r\n\t\tBenchmarker( const Benchmarker& rhs ) {};\r\n\t\tBenchmarker( void );\r\n\r\n\t\tstd::vector< ILogger* > m_Logger;\r\n\r\n\t\tstd::vector<ResultScope*> m_Results;\r\n\r\n\t\tBenchmarkScope* m_CurrentScope;\r\n\r\n\t\tstatic Benchmarker*& InternalInstance( bool createIfNotInstanced = true );\r\n\r\n\t};\r\n\r\n\r\n\r\n}\r\n\r\n#include \"BPPBenchmarker.inl\"\r\n\r\n#endif \/\/ BPPBenchmarker_h__\r\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @brief Executor for materialization node.\n *\n * This executor also performs all functions of a projection node, in order\n * to support late materialization).\n *\n * TODO Integrate expression system into materialization.\n *\n * Copyright(c) 2015, CMU\n *\/\n\n#include \"executor\/materialization_executor.h\"\n\n#include <cassert>\n\n#include <memory>\n#include <utility>\n\n#include \"catalog\/schema.h\"\n#include \"executor\/logical_tile.h\"\n#include \"planner\/materialization_node.h\"\n#include \"storage\/tile.h\"\n#include \"storage\/tile_factory.h\"\n\nnamespace nstore {\nnamespace executor {\n\n\/**\n * @brief Constructor for the materialization executor.\n * @param node Materialization node corresponding to this executor.\n *\/\nMaterializationExecutor::MaterializationExecutor(\n    const planner::AbstractPlanNode *node)\n  : AbstractExecutor(node) {\n}\n\n\/**\n * @brief Nothing to init at the moment.\n *\n * @return True on success, false otherwise.\n *\/\nbool MaterializationExecutor::SubInit() {\n  assert(children_.size() == 1);\n  return true;\n}\n\n\/**\n * @brief Creates materialized physical tile from logical tile and wraps it\n *        in a new logical tile.\n *\n * @return Pointer to logical tile containing newly materialized physical tile.\n *\/\nLogicalTile *MaterializationExecutor::SubGetNextTile() {\n  assert(children_.size() == 1);\n\n  \/\/ Retrieve next tile.\n  std::unique_ptr<LogicalTile> source_tile(children_[0]->GetNextTile());\n  if (source_tile.get() == nullptr) {\n    return nullptr;\n  }\n\n  planner::MaterializationNode &node = GetNode<planner::MaterializationNode>();\n  std::unordered_map<id_t, id_t> &old_to_new_cols =\n    node.old_to_new_cols();\n\n  \/\/ Generate mappings.\n  std::unordered_map<storage::Tile *, std::vector<id_t> > tile_to_cols;\n  GenerateTileToColMap(\n      old_to_new_cols,\n      source_tile.get(),\n      tile_to_cols);\n\n  \/\/ Create new physical tile.\n  int num_tuples = source_tile->NumTuples();\n  bool owns_tuple_schema = true;\n  std::unique_ptr<storage::Tile> dest_tile(\n      storage::TileFactory::GetTile(\n        \/\/TODO Weird interface in schema?\n        node.schema().CopySchema(&node.schema()),\n        num_tuples,\n        node.column_names(),\n        owns_tuple_schema));\n\n  \/\/ Proceed to materialize by tile.\n  MaterializeByTiles(\n      source_tile.get(),\n      old_to_new_cols,\n      tile_to_cols,\n      dest_tile.get());\n\n  \/\/ Wrap physical tile in logical tile.\n  \/\/TODO\n\n  return nullptr;\n}\n\n\/** @brief Nothing to clean up at the moment. *\/\nvoid MaterializationExecutor::SubCleanUp() {}\n\n\/**\n * @brief Generates map from each base tile to columns originally from that\n *        base tile to be materialized.\n * @param column_ids Ids of columns to be materialized.\n * @param source_tile Logical tile that contains mapping from columns to\n *        base tiles.\n * @param tile_to_cols Map to be populated with mappings from tile to columns.\n *\n * We generate this mapping so that we can materialize columns by tile for\n * efficiency reasons.\n *\/\nvoid MaterializationExecutor::GenerateTileToColMap(\n    std::unordered_map<id_t, id_t> &old_to_new_cols,\n    LogicalTile *source_tile,\n    std::unordered_map<storage::Tile *, std::vector<id_t> > &tile_to_cols) {\n  for (const auto &kv : old_to_new_cols) {\n    id_t col = kv.first;\n    storage::Tile *base_tile = source_tile->GetBaseTile(col);\n    std::vector<id_t> &cols_from_tile = tile_to_cols[base_tile];\n    cols_from_tile.push_back(col);\n  }\n}\n\n\/**\n * @brief Does the actual copying of data into the new tile.\n * @param source_tile Source tile to copy data from.\n * @param tile_to_cols Map from base tile to columns in that tile\n *        to be materialized.\n * @param dest_tile New tile to copy data into.\n *\/\nvoid MaterializationExecutor::MaterializeByTiles(\n    LogicalTile *source_tile,\n    std::unordered_map<id_t, id_t> &old_to_new_cols,\n    const\n    std::unordered_map<storage::Tile *, std::vector<id_t> > &tile_to_cols,\n    storage::Tile *dest_tile) {\n  for (const auto &kv : tile_to_cols) {\n    \/\/ Copy over all data from each base tile.\n    const std::vector<id_t> &old_column_ids = kv.second;\n    for (id_t old_col_id : old_column_ids) {\n      int new_tuple_id = 0;\n      int new_col_id = old_to_new_cols[old_col_id];\n      for (id_t old_tuple_id : *source_tile) {\n        Value value = source_tile->GetValue(old_col_id, old_tuple_id);\n        dest_tile->SetValue(value, new_tuple_id++, new_col_id);\n      }\n    }\n  }\n}\n\n} \/\/ namespace executor\n} \/\/ namespace nstore\n<commit_msg>Finished materialization executor (without expressions).<commit_after>\/**\n * @brief Executor for materialization node.\n *\n * This executor also performs all functions of a projection node, in order\n * to support late materialization).\n *\n * TODO Integrate expression system into materialization.\n *\n * Copyright(c) 2015, CMU\n *\/\n\n#include \"executor\/materialization_executor.h\"\n\n#include <cassert>\n\n#include <memory>\n#include <utility>\n\n#include \"catalog\/schema.h\"\n#include \"executor\/logical_tile.h\"\n#include \"executor\/logical_tile_factory.h\"\n#include \"planner\/materialization_node.h\"\n#include \"storage\/tile.h\"\n#include \"storage\/tile_factory.h\"\n\nnamespace nstore {\nnamespace executor {\n\n\/**\n * @brief Constructor for the materialization executor.\n * @param node Materialization node corresponding to this executor.\n *\/\nMaterializationExecutor::MaterializationExecutor(\n    const planner::AbstractPlanNode *node)\n  : AbstractExecutor(node) {\n}\n\n\/**\n * @brief Nothing to init at the moment.\n *\n * @return True on success, false otherwise.\n *\/\nbool MaterializationExecutor::SubInit() {\n  assert(children_.size() == 1);\n  return true;\n}\n\n\/**\n * @brief Creates materialized physical tile from logical tile and wraps it\n *        in a new logical tile.\n *\n * @return Pointer to logical tile containing newly materialized physical tile.\n *\/\nLogicalTile *MaterializationExecutor::SubGetNextTile() {\n  assert(children_.size() == 1);\n\n  \/\/ Retrieve next tile.\n  std::unique_ptr<LogicalTile> source_tile(children_[0]->GetNextTile());\n  if (source_tile.get() == nullptr) {\n    return nullptr;\n  }\n\n  planner::MaterializationNode &node = GetNode<planner::MaterializationNode>();\n  std::unordered_map<id_t, id_t> &old_to_new_cols =\n    node.old_to_new_cols();\n\n  \/\/ Generate mappings.\n  std::unordered_map<storage::Tile *, std::vector<id_t> > tile_to_cols;\n  GenerateTileToColMap(\n      old_to_new_cols,\n      source_tile.get(),\n      tile_to_cols);\n\n  \/\/ Create new physical tile.\n  int num_tuples = source_tile->NumTuples();\n  bool owns_tuple_schema = true;\n  std::unique_ptr<storage::Tile> dest_tile(\n      storage::TileFactory::GetTile(\n        \/\/TODO Weird interface in schema?\n        node.schema().CopySchema(&node.schema()),\n        num_tuples,\n        node.column_names(),\n        owns_tuple_schema));\n\n  \/\/ Proceed to materialize by tile.\n  MaterializeByTiles(\n      source_tile.get(),\n      old_to_new_cols,\n      tile_to_cols,\n      dest_tile.get());\n\n  \/\/ Wrap physical tile in logical tile.\n  bool own_base_tile = true;\n  return LogicalTileFactory::WrapBaseTile(dest_tile.release(), own_base_tile);\n}\n\n\/** @brief Nothing to clean up at the moment. *\/\nvoid MaterializationExecutor::SubCleanUp() {}\n\n\/**\n * @brief Generates map from each base tile to columns originally from that\n *        base tile to be materialized.\n * @param column_ids Ids of columns to be materialized.\n * @param source_tile Logical tile that contains mapping from columns to\n *        base tiles.\n * @param tile_to_cols Map to be populated with mappings from tile to columns.\n *\n * We generate this mapping so that we can materialize columns by tile for\n * efficiency reasons.\n *\/\nvoid MaterializationExecutor::GenerateTileToColMap(\n    std::unordered_map<id_t, id_t> &old_to_new_cols,\n    LogicalTile *source_tile,\n    std::unordered_map<storage::Tile *, std::vector<id_t> > &tile_to_cols) {\n  for (const auto &kv : old_to_new_cols) {\n    id_t col = kv.first;\n    storage::Tile *base_tile = source_tile->GetBaseTile(col);\n    std::vector<id_t> &cols_from_tile = tile_to_cols[base_tile];\n    cols_from_tile.push_back(col);\n  }\n}\n\n\/**\n * @brief Does the actual copying of data into the new tile.\n * @param source_tile Source tile to copy data from.\n * @param tile_to_cols Map from base tile to columns in that tile\n *        to be materialized.\n * @param dest_tile New tile to copy data into.\n *\/\nvoid MaterializationExecutor::MaterializeByTiles(\n    LogicalTile *source_tile,\n    std::unordered_map<id_t, id_t> &old_to_new_cols,\n    const\n    std::unordered_map<storage::Tile *, std::vector<id_t> > &tile_to_cols,\n    storage::Tile *dest_tile) {\n  for (const auto &kv : tile_to_cols) {\n    \/\/ Copy over all data from each base tile.\n    const std::vector<id_t> &old_column_ids = kv.second;\n    for (id_t old_col_id : old_column_ids) {\n      int new_tuple_id = 0;\n      int new_col_id = old_to_new_cols[old_col_id];\n      for (id_t old_tuple_id : *source_tile) {\n        Value value = source_tile->GetValue(old_col_id, old_tuple_id);\n        dest_tile->SetValue(value, new_tuple_id++, new_col_id);\n      }\n    }\n  }\n}\n\n} \/\/ namespace executor\n} \/\/ namespace nstore\n<|endoftext|>"}
{"text":"<commit_before>#include<string>\n#include<vector>\n#include \"vmf\/metadatastream.hpp\"\n#include \"..\/com_intel_vmf_Variant.h\"\n\nusing namespace vmf;\n\nstatic void throwJavaException(JNIEnv *env, const std::exception *e, const char *method)\n{\n    std::string what = \"unknown exception\";\n    jclass je = 0;\n\n    if (e)\n    {\n        std::string exception_type = \"std::exception\";\n\n        if (dynamic_cast<const Exception*>(e))\n        {\n            exception_type = \"vmf::Exception\";\n            je = env->FindClass(\"com\/intel\/vmf\/VmfException\");\n        }\n\n        what = exception_type + \": \" + e->what();\n    }\n\n    if (!je)\n        je = env->FindClass(\"java\/lang\/Exception\");\n\n    env->ThrowNew(je, what.c_str());\n\n    VMF_LOG_ERROR(what.c_str());\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_Variant\n * Signature: ()J\n *\/\nJNIEXPORT jlong JNICALL Java_com_intel_vmf_Variant_n_1Variant__ (JNIEnv *, jclass)\n{\n    std::shared_ptr <Variant>* p = new std::shared_ptr <Variant>(new Variant());\n    return (jlong) p;\n} \n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_Variant\n * Signature: (J)J\n *\/\nJNIEXPORT jlong JNICALL Java_com_intel_vmf_Variant_n_1Variant__J (JNIEnv *, jclass, jlong otherAddr)\n{\n    std::shared_ptr <Variant>* other = (std::shared_ptr <Variant>*)otherAddr;\n    std::shared_ptr <Variant>* p = new std::shared_ptr <Variant>(new Variant(**other));\n    return (jlong) p;\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_setTo\n * Signature: (JI)V\n *\/\nJNIEXPORT void JNICALL Java_com_intel_vmf_Variant_n_1setTo__JI (JNIEnv *env, jclass, jlong self, jint value)\n{\n    std::shared_ptr <Variant>* obj = (std::shared_ptr <Variant>*)self;\n    (**obj) = (int) value;\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_setTo\n * Signature: (JF)V\n *\/\nJNIEXPORT void JNICALL Java_com_intel_vmf_Variant_n_1setTo__JF (JNIEnv *env, jclass, jlong self, jfloat value)\n{\n    std::shared_ptr <Variant>* obj = (std::shared_ptr <Variant>*)self;\n    (**obj) = (float) value;\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_setTo\n * Signature: (J[I)V\n *\/\nJNIEXPORT void JNICALL Java_com_intel_vmf_Variant_n_1setTo__J_3I (JNIEnv *env, jclass, jlong self, jintArray values)\n{\n    std::shared_ptr <Variant>* obj = (std::shared_ptr <Variant>*)self;\n    std::vector <int> vecValues;\n    jint *cArray = env->GetIntArrayElements (values, 0);\n    jsize len = env->GetArrayLength (values);\n    \n    for (int i = 0; i < len; i++)\n    {\n        vecValues.push_back((int)cArray[i]);\n    }\n    \n    env->ReleaseIntArrayElements (values, cArray, 0);\n    (**obj) = vecValues;\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_setTo\n * Signature: (J[F)V\n *\/\nJNIEXPORT void JNICALL Java_com_intel_vmf_Variant_n_1setTo__J_3F (JNIEnv *env, jclass, jlong self, jfloatArray values)\n{\n    std::shared_ptr <Variant>* obj = (std::shared_ptr <Variant>*)self;\n    std::vector <float> vecValues;\n    jfloat* array = env->GetFloatArrayElements (values, 0);\n    jsize len = env->GetArrayLength (values);\n    \n    for (int i = 0; i < len; i++)\n    {\n        float elem = (float) array[i];\n        vecValues.push_back (elem);\n    }\n    \n    env->ReleaseFloatArrayElements (values, array, 0);\n    (**obj) = vecValues;\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_setTo\n * Signature: (JLjava\/lang\/String;)V\n *\/\nJNIEXPORT void JNICALL Java_com_intel_vmf_Variant_n_1setTo__JLjava_lang_String_2 (JNIEnv *env, jclass, jlong self, jstring str)\n{\n    std::shared_ptr <Variant>* obj = (std::shared_ptr <Variant>*)self;\n    (**obj) = env->GetStringUTFChars (str, NULL);\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_setTo\n * Signature: (JJ)V\n *\/\nJNIEXPORT void JNICALL Java_com_intel_vmf_Variant_n_1setTo__JJ (JNIEnv *env, jclass, jlong self, jlong other)\n{\n    std::shared_ptr <Variant>* obj = (std::shared_ptr <Variant>*)self;\n    std::shared_ptr <Variant>* otherObj = (std::shared_ptr <Variant>*)other;\n    (**obj) = (**otherObj);\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_equals\n * Signature: (JJ)Z\n *\/\nJNIEXPORT jboolean JNICALL Java_com_intel_vmf_Variant_n_1equals (JNIEnv *env, jclass, jlong self, jlong other)\n{\n    std::shared_ptr <Variant>* obj = (std::shared_ptr <Variant>*)self;\n    std::shared_ptr <Variant>* otherObj = (std::shared_ptr <Variant>*)other;\n    \n    if ((**obj) == (**otherObj))\n        return JNI_TRUE;\n    else\n        return JNI_FALSE;\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_toString\n * Signature: (J)Ljava\/lang\/String;\n *\/\nJNIEXPORT jstring JNICALL Java_com_intel_vmf_Variant_n_1toString (JNIEnv *env, jclass, jlong self)\n{\n    std::shared_ptr <Variant>* obj = (std::shared_ptr <Variant>*)self;\n    std::string str = (*obj)->toString ();\n    return env->NewStringUTF (str.c_str());\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_fromString\n * Signature: (JILjava\/lang\/String;)V\n *\/\nJNIEXPORT void JNICALL Java_com_intel_vmf_Variant_n_1fromString (JNIEnv *env, jclass, jlong self, jint type, jstring value)\n{\n    static const char method_name[] = \"Variant::n_1fromString\";\n    \n    try \n    {\n        std::shared_ptr <Variant>* obj = (std::shared_ptr <Variant>*)self;\n        std::string str (env->GetStringUTFChars (value, NULL));\n        Variant::Type Type = (Variant::Type) type;\n        if (Type >= Variant::Type::type_unknown && Type <= Variant::Type::type_vec4d_vector)\n            (*obj)->fromString (Type, str);\n        else\n            throwJavaException(env, 0, method_name);\n    } \n    catch(const std::exception &e)\n    {\n        throwJavaException(env, &e, method_name);\n    } \n    catch (...)\n    {\n        throwJavaException(env, 0, method_name);\n    }\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_getType\n * Signature: (J)I\n *\/\nJNIEXPORT jint JNICALL Java_com_intel_vmf_Variant_n_1getType (JNIEnv *env, jclass, jlong self)\n{\n    static const char method_name[] = \"Variant::n_1getType\";\n    \n    try \n    {\n        std::shared_ptr <Variant>* obj = (std::shared_ptr <Variant>*)self;\n        return (jint) (*obj)->getType ();\n    }\n    catch(const std::exception &e)\n    {\n        throwJavaException(env, &e, method_name);\n    } \n    catch (...)\n    {\n        throwJavaException(env, 0, method_name);\n    }\n    \n    return 0;\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_isEmpty\n * Signature: (J)Z\n *\/\nJNIEXPORT jboolean JNICALL Java_com_intel_vmf_Variant_n_1isEmpty (JNIEnv *env, jclass, jlong self)\n{\n    static const char method_name[] = \"Variant::n_1isEmpty\";\n    \n    try \n    {\n        std::shared_ptr <Variant>* obj = (std::shared_ptr <Variant>*)self;\n        return (jboolean) (*obj)->isEmpty ();\n    }\n    catch(const std::exception &e)\n    {\n        throwJavaException(env, &e, method_name);\n    } \n    catch (...)\n    {\n        throwJavaException(env, 0, method_name);\n    }\n    \n    return 0;\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_getTypeName\n * Signature: (J)Ljava\/lang\/String;\n *\/\nJNIEXPORT jstring JNICALL Java_com_intel_vmf_Variant_n_1getTypeName (JNIEnv *env, jclass, jlong self)\n{\n    std::shared_ptr <Variant>* obj = (std::shared_ptr <Variant>*)self;\n    std::string str = (*obj)->getTypeName ();\n    return env->NewStringUTF (str.c_str());\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_convertTo\n * Signature: (JI)V\n *\/\nJNIEXPORT void JNICALL Java_com_intel_vmf_Variant_n_1convertTo (JNIEnv *env, jclass, jlong self, jint type)\n{\n    static const char method_name[] = \"Variant::n_1convertTo\";\n    \n    try \n    {\n        Variant::Type Type = (Variant::Type) type;\n        if ((Type >= Variant::Type::type_unknown) && (Type <= Variant::Type::type_vec4d_vector))\n        {\n            std::shared_ptr <Variant>* obj = (std::shared_ptr <Variant>*)self;\n            (*obj)->convertTo (Type);\n        }\n        else\n            throwJavaException(env, 0, method_name);\n    }\n    catch(const std::exception &e)\n    {\n        throwJavaException(env, &e, method_name);\n    } \n    catch (...)\n    {\n        throwJavaException(env, 0, method_name);\n    }\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_typeToString\n * Signature: (I)Ljava\/lang\/String;\n *\/\nJNIEXPORT jstring JNICALL Java_com_intel_vmf_Variant_n_1typeToString (JNIEnv *env, jclass, jint type)\n{\n    static const char method_name[] = \"Variant::n_1typeToString\";\n    \n    try \n    {\n        Variant::Type Type = (Variant::Type) type;\n        if (Type >= Variant::Type::type_unknown && Type <= Variant::Type::type_vec4d_vector)\n        {\n            std::string str = Variant::typeToString (Type);\n            return env->NewStringUTF (str.c_str());\n        }\n    }\n    catch(const std::exception &e)\n    {\n        throwJavaException(env, &e, method_name);\n    } \n    catch (...)\n    {\n        throwJavaException(env, 0, method_name);\n    }\n    \n    return 0;\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_typeFromString\n * Signature: (Ljava\/lang\/String;)I\n *\/\nJNIEXPORT jint JNICALL Java_com_intel_vmf_Variant_n_1typeFromString (JNIEnv *env, jclass, jstring type)\n{\n    static const char method_name[] = \"Variant::n_1typeFromString\";\n     \n    try \n    {\n        std::string sType (env->GetStringUTFChars (type, NULL));\n        return (jint) Variant::typeFromString (sType);\n    }\n    catch(const std::exception &e)\n    {\n        throwJavaException(env, &e, method_name);\n    } \n    catch (...)\n    {\n        throwJavaException(env, 0, method_name);\n    }\n    \n    return 0;\n}\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_isConvertible\n * Signature: (II)Z\n *\/\nJNIEXPORT jboolean JNICALL Java_com_intel_vmf_Variant_n_1isConvertible (JNIEnv *env, jclass, jint srcType, jint dstType)\n{\n    static const char method_name[] = \"Variant::n_1isConvertible\";\n    \n    try \n    {\n        Variant::Type src = (Variant::Type) srcType;\n        Variant::Type dst = (Variant::Type) dstType;\n        return (jboolean) Variant::isConvertible (src, dst);\n    }\n    catch(const std::exception &e)\n    {\n        throwJavaException(env, &e, method_name);\n    } \n    catch (...)\n    {\n        throwJavaException(env, 0, method_name);\n    }\n    \n    return 0;\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_base64Encode\n * Signature: ([BI)Ljava\/lang\/String;\n *\/\nJNIEXPORT jstring JNICALL Java_com_intel_vmf_Variant_n_1base64Encode (JNIEnv *env, jclass, jbyteArray buf, jint length)\n{\n    static const char method_name[] = \"Variant::n_1base64Encode\";\n    try \n    {\n        char* array = (char*) env->GetByteArrayElements (buf, 0);\n        vmf_rawbuffer rb(array, (size_t)length);\n\n        std::string str = Variant::base64encode(rb);\n\n        env->ReleaseByteArrayElements (buf, (jbyte*)array, 0);\n        return env->NewStringUTF(str.c_str());\n    }\n    catch(const std::exception &e)\n    {\n        throwJavaException(env, &e, method_name);\n    } \n    catch (...)\n    {\n        throwJavaException(env, 0, method_name);\n    }\n    \n    return 0;\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_base64Decode\n * Signature: (Ljava\/lang\/String;)[B\n *\/\nJNIEXPORT jbyteArray JNICALL Java_com_intel_vmf_Variant_n_1base64Decode (JNIEnv *env, jclass, jstring src)\n{\n    static const char method_name[] = \"Variant::n_1base64Decode\";\n    try \n    {\n        std::string str (env->GetStringUTFChars (src, NULL));\n        vmf_rawbuffer buf = Variant::base64decode (str);\n        jbyteArray byteArray = env->NewByteArray ((jsize)buf.size);\n        jbyte* array = env->GetByteArrayElements (byteArray, 0);\n        \n        for (std::size_t i = 0; i < buf.size; i++)\n        {\n            array[i] = buf.data[i];\n        }\n        \n        env->ReleaseByteArrayElements (byteArray, array, 0);\n        return byteArray;\n    }\n    catch(const std::exception &e)\n    {\n        throwJavaException(env, &e, method_name);\n    } \n    catch (...)\n    {\n        throwJavaException(env, 0, method_name);\n    }\n    \n    return 0;\n}\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_delete\n * Signature: (J)V\n *\/\nJNIEXPORT void JNICALL Java_com_intel_vmf_Variant_n_1delete (JNIEnv *env, jclass, jlong self)\n{\n    static const char method_name[] = \"Variant::n_1delete\";\n\n    try\n    {\n        std::shared_ptr<Variant>* p = (std::shared_ptr<Variant>*) self;\n        delete p;\n    }\n    catch (const std::exception &e)\n    {\n        throwJavaException(env, &e, method_name);\n    }\n    catch (...)\n    {\n        throwJavaException(env, 0, method_name);\n    }\n}\n<commit_msg>fix for compilation issues 2<commit_after>#include<string>\n#include<vector>\n#include \"vmf\/metadatastream.hpp\"\n#include \"..\/com_intel_vmf_Variant.h\"\n\nusing namespace vmf;\n\nstatic void throwJavaException(JNIEnv *env, const std::exception *e, const char *method)\n{\n    std::string what = \"unknown exception\";\n    jclass je = 0;\n\n    if (e)\n    {\n        std::string exception_type = \"std::exception\";\n\n        if (dynamic_cast<const Exception*>(e))\n        {\n            exception_type = \"vmf::Exception\";\n            je = env->FindClass(\"com\/intel\/vmf\/VmfException\");\n        }\n\n        what = exception_type + \": \" + e->what();\n    }\n\n    if (!je)\n        je = env->FindClass(\"java\/lang\/Exception\");\n\n    env->ThrowNew(je, what.c_str());\n\n    VMF_LOG_ERROR(what.c_str());\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_Variant\n * Signature: ()J\n *\/\nJNIEXPORT jlong JNICALL Java_com_intel_vmf_Variant_n_1Variant__ (JNIEnv *, jclass)\n{\n    std::shared_ptr <Variant>* p = new std::shared_ptr <Variant>(new Variant());\n    return (jlong) p;\n} \n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_Variant\n * Signature: (J)J\n *\/\nJNIEXPORT jlong JNICALL Java_com_intel_vmf_Variant_n_1Variant__J (JNIEnv *, jclass, jlong otherAddr)\n{\n    std::shared_ptr <Variant>* other = (std::shared_ptr <Variant>*)otherAddr;\n    std::shared_ptr <Variant>* p = new std::shared_ptr <Variant>(new Variant(**other));\n    return (jlong) p;\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_setTo\n * Signature: (JI)V\n *\/\nJNIEXPORT void JNICALL Java_com_intel_vmf_Variant_n_1setTo__JI (JNIEnv *env, jclass, jlong self, jint value)\n{\n    std::shared_ptr <Variant>* obj = (std::shared_ptr <Variant>*)self;\n    (**obj) = (int) value;\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_setTo\n * Signature: (JF)V\n *\/\nJNIEXPORT void JNICALL Java_com_intel_vmf_Variant_n_1setTo__JF (JNIEnv *env, jclass, jlong self, jfloat value)\n{\n    std::shared_ptr <Variant>* obj = (std::shared_ptr <Variant>*)self;\n    (**obj) = (float) value;\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_setTo\n * Signature: (J[I)V\n *\/\nJNIEXPORT void JNICALL Java_com_intel_vmf_Variant_n_1setTo__J_3I (JNIEnv *env, jclass, jlong self, jintArray values)\n{\n    std::shared_ptr <Variant>* obj = (std::shared_ptr <Variant>*)self;\n    std::vector <int> vecValues;\n    jint *cArray = env->GetIntArrayElements (values, 0);\n    jsize len = env->GetArrayLength (values);\n    \n    for (int i = 0; i < len; i++)\n    {\n        vecValues.push_back((int)cArray[i]);\n    }\n    \n    env->ReleaseIntArrayElements (values, cArray, 0);\n    (**obj) = vecValues;\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_setTo\n * Signature: (J[F)V\n *\/\nJNIEXPORT void JNICALL Java_com_intel_vmf_Variant_n_1setTo__J_3F (JNIEnv *env, jclass, jlong self, jfloatArray values)\n{\n    std::shared_ptr <Variant>* obj = (std::shared_ptr <Variant>*)self;\n    std::vector <float> vecValues;\n    jfloat* array = env->GetFloatArrayElements (values, 0);\n    jsize len = env->GetArrayLength (values);\n    \n    for (int i = 0; i < len; i++)\n    {\n        float elem = (float) array[i];\n        vecValues.push_back (elem);\n    }\n    \n    env->ReleaseFloatArrayElements (values, array, 0);\n    (**obj) = vecValues;\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_setTo\n * Signature: (JLjava\/lang\/String;)V\n *\/\nJNIEXPORT void JNICALL Java_com_intel_vmf_Variant_n_1setTo__JLjava_lang_String_2 (JNIEnv *env, jclass, jlong self, jstring str)\n{\n    std::shared_ptr <Variant>* obj = (std::shared_ptr <Variant>*)self;\n    (**obj) = env->GetStringUTFChars (str, NULL);\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_setTo\n * Signature: (JJ)V\n *\/\nJNIEXPORT void JNICALL Java_com_intel_vmf_Variant_n_1setTo__JJ (JNIEnv *env, jclass, jlong self, jlong other)\n{\n    std::shared_ptr <Variant>* obj = (std::shared_ptr <Variant>*)self;\n    std::shared_ptr <Variant>* otherObj = (std::shared_ptr <Variant>*)other;\n    (**obj) = (**otherObj);\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_equals\n * Signature: (JJ)Z\n *\/\nJNIEXPORT jboolean JNICALL Java_com_intel_vmf_Variant_n_1equals (JNIEnv *env, jclass, jlong self, jlong other)\n{\n    std::shared_ptr <Variant>* obj = (std::shared_ptr <Variant>*)self;\n    std::shared_ptr <Variant>* otherObj = (std::shared_ptr <Variant>*)other;\n    \n    if ((**obj) == (**otherObj))\n        return JNI_TRUE;\n    else\n        return JNI_FALSE;\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_toString\n * Signature: (J)Ljava\/lang\/String;\n *\/\nJNIEXPORT jstring JNICALL Java_com_intel_vmf_Variant_n_1toString (JNIEnv *env, jclass, jlong self)\n{\n    std::shared_ptr <Variant>* obj = (std::shared_ptr <Variant>*)self;\n    std::string str = (*obj)->toString ();\n    return env->NewStringUTF (str.c_str());\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_fromString\n * Signature: (JILjava\/lang\/String;)V\n *\/\nJNIEXPORT void JNICALL Java_com_intel_vmf_Variant_n_1fromString (JNIEnv *env, jclass, jlong self, jint type, jstring value)\n{\n    static const char method_name[] = \"Variant::n_1fromString\";\n    \n    try \n    {\n        std::shared_ptr <Variant>* obj = (std::shared_ptr <Variant>*)self;\n        std::string str (env->GetStringUTFChars (value, NULL));\n        Variant::Type Type = (Variant::Type) type;\n        if (Type >= Variant::Type::type_unknown && Type <= Variant::Type::type_vec4d_vector)\n            (*obj)->fromString (Type, str);\n        else\n            throwJavaException(env, 0, method_name);\n    } \n    catch(const std::exception &e)\n    {\n        throwJavaException(env, &e, method_name);\n    } \n    catch (...)\n    {\n        throwJavaException(env, 0, method_name);\n    }\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_getType\n * Signature: (J)I\n *\/\nJNIEXPORT jint JNICALL Java_com_intel_vmf_Variant_n_1getType (JNIEnv *env, jclass, jlong self)\n{\n    static const char method_name[] = \"Variant::n_1getType\";\n    \n    try \n    {\n        std::shared_ptr <Variant>* obj = (std::shared_ptr <Variant>*)self;\n        return (jint) (*obj)->getType ();\n    }\n    catch(const std::exception &e)\n    {\n        throwJavaException(env, &e, method_name);\n    } \n    catch (...)\n    {\n        throwJavaException(env, 0, method_name);\n    }\n    \n    return 0;\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_isEmpty\n * Signature: (J)Z\n *\/\nJNIEXPORT jboolean JNICALL Java_com_intel_vmf_Variant_n_1isEmpty (JNIEnv *env, jclass, jlong self)\n{\n    static const char method_name[] = \"Variant::n_1isEmpty\";\n    \n    try \n    {\n        std::shared_ptr <Variant>* obj = (std::shared_ptr <Variant>*)self;\n        return (jboolean) (*obj)->isEmpty ();\n    }\n    catch(const std::exception &e)\n    {\n        throwJavaException(env, &e, method_name);\n    } \n    catch (...)\n    {\n        throwJavaException(env, 0, method_name);\n    }\n    \n    return 0;\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_getTypeName\n * Signature: (J)Ljava\/lang\/String;\n *\/\nJNIEXPORT jstring JNICALL Java_com_intel_vmf_Variant_n_1getTypeName (JNIEnv *env, jclass, jlong self)\n{\n    std::shared_ptr <Variant>* obj = (std::shared_ptr <Variant>*)self;\n    std::string str = (*obj)->getTypeName ();\n    return env->NewStringUTF (str.c_str());\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_convertTo\n * Signature: (JI)V\n *\/\nJNIEXPORT void JNICALL Java_com_intel_vmf_Variant_n_1convertTo (JNIEnv *env, jclass, jlong self, jint type)\n{\n    static const char method_name[] = \"Variant::n_1convertTo\";\n    \n    try \n    {\n        Variant::Type Type = (Variant::Type) type;\n        if ((Type >= Variant::Type::type_unknown) && (Type <= Variant::Type::type_vec4d_vector))\n        {\n            std::shared_ptr <Variant>* obj = (std::shared_ptr <Variant>*)self;\n            (*obj)->convertTo (Type);\n        }\n        else\n            throwJavaException(env, 0, method_name);\n    }\n    catch(const std::exception &e)\n    {\n        throwJavaException(env, &e, method_name);\n    } \n    catch (...)\n    {\n        throwJavaException(env, 0, method_name);\n    }\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_typeToString\n * Signature: (I)Ljava\/lang\/String;\n *\/\nJNIEXPORT jstring JNICALL Java_com_intel_vmf_Variant_n_1typeToString (JNIEnv *env, jclass, jint type)\n{\n    static const char method_name[] = \"Variant::n_1typeToString\";\n    \n    try \n    {\n        Variant::Type Type = (Variant::Type) type;\n        if (Type >= Variant::Type::type_unknown && Type <= Variant::Type::type_vec4d_vector)\n        {\n            std::string str = Variant::typeToString (Type);\n            return env->NewStringUTF (str.c_str());\n        }\n    }\n    catch(const std::exception &e)\n    {\n        throwJavaException(env, &e, method_name);\n    } \n    catch (...)\n    {\n        throwJavaException(env, 0, method_name);\n    }\n    \n    return 0;\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_typeFromString\n * Signature: (Ljava\/lang\/String;)I\n *\/\nJNIEXPORT jint JNICALL Java_com_intel_vmf_Variant_n_1typeFromString (JNIEnv *env, jclass, jstring type)\n{\n    static const char method_name[] = \"Variant::n_1typeFromString\";\n     \n    try \n    {\n        std::string sType (env->GetStringUTFChars (type, NULL));\n        return (jint) Variant::typeFromString (sType);\n    }\n    catch(const std::exception &e)\n    {\n        throwJavaException(env, &e, method_name);\n    } \n    catch (...)\n    {\n        throwJavaException(env, 0, method_name);\n    }\n    \n    return 0;\n}\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_isConvertible\n * Signature: (II)Z\n *\/\nJNIEXPORT jboolean JNICALL Java_com_intel_vmf_Variant_n_1isConvertible (JNIEnv *env, jclass, jint srcType, jint dstType)\n{\n    static const char method_name[] = \"Variant::n_1isConvertible\";\n    \n    try \n    {\n        Variant::Type src = (Variant::Type) srcType;\n        Variant::Type dst = (Variant::Type) dstType;\n        return (jboolean) Variant::isConvertible (src, dst);\n    }\n    catch(const std::exception &e)\n    {\n        throwJavaException(env, &e, method_name);\n    } \n    catch (...)\n    {\n        throwJavaException(env, 0, method_name);\n    }\n    \n    return 0;\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_base64Encode\n * Signature: ([BI)Ljava\/lang\/String;\n *\/\nJNIEXPORT jstring JNICALL Java_com_intel_vmf_Variant_n_1base64Encode (JNIEnv *env, jclass, jbyteArray buf, jint length)\n{\n    static const char method_name[] = \"Variant::n_1base64Encode\";\n    try \n    {\n        char* array = (char*) env->GetByteArrayElements (buf, 0);\n        vmf_rawbuffer rb(array, (size_t)length);\n\n        std::string str = Variant::base64encode(rb);\n\n        env->ReleaseByteArrayElements (buf, (jbyte*)array, 0);\n        return env->NewStringUTF(str.c_str());\n    }\n    catch(const std::exception &e)\n    {\n        throwJavaException(env, &e, method_name);\n    } \n    catch (...)\n    {\n        throwJavaException(env, 0, method_name);\n    }\n    \n    return 0;\n}\n\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_base64Decode\n * Signature: (Ljava\/lang\/String;)[B\n *\/\nJNIEXPORT jbyteArray JNICALL Java_com_intel_vmf_Variant_n_1base64Decode (JNIEnv *env, jclass, jstring src)\n{\n    static const char method_name[] = \"Variant::n_1base64Decode\";\n    try \n    {\n        std::string str (env->GetStringUTFChars (src, NULL));\n        vmf_rawbuffer buf = Variant::base64decode (str);\n        jsize size = (jsize)(buf.size);\n        jbyteArray byteArray = env->NewByteArray (size);\n        jbyte* array = env->GetByteArrayElements (byteArray, 0);\n        \n        for (std::size_t i = 0; i < buf.size; i++)\n        {\n            array[i] = buf.data[i];\n        }\n        \n        env->ReleaseByteArrayElements (byteArray, array, 0);\n        return byteArray;\n    }\n    catch(const std::exception &e)\n    {\n        throwJavaException(env, &e, method_name);\n    } \n    catch (...)\n    {\n        throwJavaException(env, 0, method_name);\n    }\n    \n    return 0;\n}\n\/*\n * Class:     com_intel_vmf_Variant\n * Method:    n_delete\n * Signature: (J)V\n *\/\nJNIEXPORT void JNICALL Java_com_intel_vmf_Variant_n_1delete (JNIEnv *env, jclass, jlong self)\n{\n    static const char method_name[] = \"Variant::n_1delete\";\n\n    try\n    {\n        std::shared_ptr<Variant>* p = (std::shared_ptr<Variant>*) self;\n        delete p;\n    }\n    catch (const std::exception &e)\n    {\n        throwJavaException(env, &e, method_name);\n    }\n    catch (...)\n    {\n        throwJavaException(env, 0, method_name);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************** <auto-copyright.pl BEGIN do not edit this line> **************\n *\n * VR Juggler is (C) Copyright 1998-2003 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., 59 Temple Place - Suite 330,\n * Boston, MA 02111-1307, USA.\n *\n * -----------------------------------------------------------------\n * File:          $RCSfile$\n * Date modified: $Date$\n * Version:       $Revision$\n * -----------------------------------------------------------------\n *\n *************** <auto-copyright.pl END do not edit this line> ***************\/\n\n#include <vrj\/vrjConfig.h>\n\n#include <jccl\/Config\/ConfigElement.h>\n\n#include <gmtl\/Output.h>\n#include <gmtl\/Generate.h>\n\n#include <vrj\/Display\/Display.h>\n#include <vrj\/Display\/CameraProjection.h>\n\n#include <boost\/concept_check.hpp>\n\n\nnamespace vrj\n{\n\nvoid CameraProjection::config(jccl::ConfigElementPtr element)\n{\n   Projection::config(element);\n}\n\n\/** Calculate the viewmatrix and frustum for the camera\n* Calculates a perspective transform for the given settings.\n* Auto-calculates aspect ratio from the current size of the window and viewport\n*\/\nvoid CameraProjection::calcViewMatrix(gmtl::Matrix44f& cameraPos, const float scaleFactor)\n{\n   boost::ignore_unused_variable_warning(scaleFactor);\n   mViewMat = cameraPos;\n\n   gmtl::Vec3f camera_trans = gmtl::makeTrans<gmtl::Vec3f>(cameraPos);\n   vprDEBUG(vprDBG_ALL, vprDBG_DETAILED_LVL) << \"calcView: Cam pos:\" << camera_trans << std::endl << vprDEBUG_FLUSH;\n\n   int win_xo, win_yo, win_xs, win_ys;  \/\/ origin and size of display window\n   float vp_xo, vp_yo, vp_xs, vp_ys;  \/\/ origin and size of viewport\n   float width, height;\n   float aspect_ratio;\n\n   getViewport()->getDisplay()->getOriginAndSize(win_xo,win_yo, win_xs, win_ys);\n   getViewport()->getOriginAndSize( vp_xo, vp_yo, vp_xs, vp_ys );\n   width = float(win_xs) * vp_xs;\n   height = float(win_ys) * vp_ys;\n\n   aspect_ratio = (width\/height);\n\n   \/\/ Calculate frustum\n   float top, right;\n\n   top = gmtl::Math::tan( gmtl::Math::deg2Rad(mVertFOV\/2.0f) ) * mNearDist;     \/\/ Calculate the top based on fovy\n   right = aspect_ratio * top;\n\n   \/\/ XXX: The frustum is not used\n   mFrustum.set(-right, right, -top, top, mNearDist, mFarDist);\n}\n\nstd::ostream& CameraProjection::outStream(std::ostream& out,\n                                          const unsigned int indentLevel)\n{\n\/\/   const int pad_width_dot(20 - indentLevel);\n   out.setf(std::ios::left);\n\n   const std::string indent_text(indentLevel, ' ');\n\n   out << indent_text << \"vrj::CameraProjection:\\n\";\n\n   return Projection::outStream(out, indentLevel);\n}\n\n}\n<commit_msg>Remove invalid comment<commit_after>\/*************** <auto-copyright.pl BEGIN do not edit this line> **************\n *\n * VR Juggler is (C) Copyright 1998-2003 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., 59 Temple Place - Suite 330,\n * Boston, MA 02111-1307, USA.\n *\n * -----------------------------------------------------------------\n * File:          $RCSfile$\n * Date modified: $Date$\n * Version:       $Revision$\n * -----------------------------------------------------------------\n *\n *************** <auto-copyright.pl END do not edit this line> ***************\/\n\n#include <vrj\/vrjConfig.h>\n\n#include <jccl\/Config\/ConfigElement.h>\n\n#include <gmtl\/Output.h>\n#include <gmtl\/Generate.h>\n\n#include <vrj\/Display\/Display.h>\n#include <vrj\/Display\/CameraProjection.h>\n\n#include <boost\/concept_check.hpp>\n\n\nnamespace vrj\n{\n\nvoid CameraProjection::config(jccl::ConfigElementPtr element)\n{\n   Projection::config(element);\n}\n\n\/** Calculate the viewmatrix and frustum for the camera\n* Calculates a perspective transform for the given settings.\n* Auto-calculates aspect ratio from the current size of the window and viewport\n*\/\nvoid CameraProjection::calcViewMatrix(gmtl::Matrix44f& cameraPos, const float scaleFactor)\n{\n   boost::ignore_unused_variable_warning(scaleFactor);\n   mViewMat = cameraPos;\n\n   gmtl::Vec3f camera_trans = gmtl::makeTrans<gmtl::Vec3f>(cameraPos);\n   vprDEBUG(vprDBG_ALL, vprDBG_DETAILED_LVL) << \"calcView: Cam pos:\" << camera_trans << std::endl << vprDEBUG_FLUSH;\n\n   int win_xo, win_yo, win_xs, win_ys;  \/\/ origin and size of display window\n   float vp_xo, vp_yo, vp_xs, vp_ys;  \/\/ origin and size of viewport\n   float width, height;\n   float aspect_ratio;\n\n   getViewport()->getDisplay()->getOriginAndSize(win_xo,win_yo, win_xs, win_ys);\n   getViewport()->getOriginAndSize( vp_xo, vp_yo, vp_xs, vp_ys );\n   width = float(win_xs) * vp_xs;\n   height = float(win_ys) * vp_ys;\n\n   aspect_ratio = (width\/height);\n\n   \/\/ Calculate frustum\n   float top, right;\n   top = gmtl::Math::tan( gmtl::Math::deg2Rad(mVertFOV\/2.0f) ) * mNearDist;     \/\/ Calculate the top based on fovy\n   right = aspect_ratio * top;\n\n   \/\/ Calculate the frustum to use for the camera\n   mFrustum.set(-right, right, -top, top, mNearDist, mFarDist);\n}\n\nstd::ostream& CameraProjection::outStream(std::ostream& out,\n                                          const unsigned int indentLevel)\n{\n\/\/   const int pad_width_dot(20 - indentLevel);\n   out.setf(std::ios::left);\n\n   const std::string indent_text(indentLevel, ' ');\n\n   out << indent_text << \"vrj::CameraProjection:\\n\";\n\n   return Projection::outStream(out, indentLevel);\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"SymbolFile.h\"\n#include \"SymbolType.h\"\n#include \"FileHelper.h\"\n\n#include <sprite2\/SymType.h>\n#include <gum\/SymbolFile.h>\n#include <gum\/ExtendSymFile.h>\n\n#include <json\/json.h>\n\n#include <fstream>\n\nnamespace ee\n{\n\nSINGLETON_DEFINITION(SymbolFile);\n\nstatic const char* TAG_GEN = \"gen\";\n\nSymbolFile::SymbolFile()\n{\n\tRegist(SYM_ANIS,\t\t\"anis\");\n\tRegist(SYM_FONTBLANK,\t\"fontblank\");\n\tRegist(SYM_FREETYPE,\t\"freetype\");\n\tRegist(SYM_SCRIPTS,\t\t\"scripts\");\n\tRegist(SYM_P3DINV,\t\t\"p3dinv\");\n\tRegist(SYM_EJOY2D,\t\t\"ejoy2d\");\n\tRegist(SYM_TERRAIN2D,\t\"terrain2d\");\n\tRegist(SYM_SHADOW,\t\t\"shadow\");\n\tRegist(SYM_UI,\t\t\t\"ui\");\n\tRegist(SYM_PSD,\t\t\t\"psd\");\n\tRegist(SYM_UIWND,\t\t\"uiwnd\");\n\n\tRegist(s2::SYM_SCALE9,\t\t\"scale9\");\n\tRegist(s2::SYM_ICON,\t\t\"icon\");\n\tRegist(s2::SYM_TEXTURE,\t\t\"texture\");\n\tRegist(s2::SYM_TEXTBOX,\t\t\"text\");\n\tRegist(s2::SYM_COMPLEX,\t\t\"complex\");\n\tRegist(s2::SYM_ANIMATION,\t\"anim\");\n\tRegist(s2::SYM_PARTICLE3D,\t\"particle\");\n\tRegist(s2::SYM_PARTICLE2D,\t\"particle2d\");\n\tRegist(s2::SYM_SHAPE,\t\t\"shape\");\n\tRegist(s2::SYM_MESH,\t\t\"mesh\");\n\tRegist(s2::SYM_MASK,\t\t\"mask\");\n\tRegist(s2::SYM_TRAIL,\t\t\"trail\");\n\tRegist(s2::SYM_SKELETON,\t\"skeleton\");\n}\n\nint SymbolFile::Type(const std::string& filepath) const\n{\n\tint type = gum::SymbolFile::Instance()->Type(filepath);\n\tif (type != s2::SYM_UNKNOWN && type != s2::SYM_INVALID) {\n\t\treturn type;\n\t}\n\t\n\tint pos = filepath.rfind('.');\n\tstd::string ext = filepath.substr(pos + 1);\n\tif (ext == \"json\")\n\t{\n\t\tconst std::string filename = filepath.substr(0, filepath.find_last_of('.'));\n\t\tint pos = filename.find_last_of('_');\n\t\tif (pos == -1) {\n\t\t\treturn CheckTypeFromData(filepath);\n\t\t}\n\n\t\tstd::string tag = filename.substr(pos + 1);\n\t\tpos = tag.find(TAG_GEN);\n\t\tif (pos != std::string::npos) {\n\t\t\ttag = tag.substr(0, pos - 1);\n\t\t}\n\n\t\tstd::map<std::string, int>::const_iterator itr = m_tag2type.find(tag);\n\t\tif (itr != m_tag2type.end()) {\n\t\t\treturn itr->second;\n\t\t} \n\n\t\treturn CheckTypeFromData(filepath);\n\t}\n\telse if (ext == \"lua\")\n\t{\n\t\tconst std::string name = filepath.substr(0, filepath.find_last_of('.'));\n\t\tif (name.find('_') == -1) {\n\t\t\treturn s2::SYM_UNKNOWN;\n\t\t}\n\t\tconst std::string json_ext = name.substr(name.find_last_of('_') + 1);\n\t\tif (json_ext == \"scripts\") {\n\t\t\treturn SYM_SCRIPTS;\n\t\t} else {\n\t\t\treturn s2::SYM_UNKNOWN;\n\t\t}\n\t}\n\telse if (ext == \"ttf\")\n\t{\n\t\treturn SYM_FREETYPE;\n\t}\n\telse\n\t{\n\t\tstd::string filename = FileHelper::GetFilename(filepath);\n\t\tif (filename == SYM_GROUP_TAG) {\n\t\t\treturn s2::SYM_COMPLEX;\n\t\t} else if (filename == SYM_SHAPE_TAG) {\n\t\t\treturn s2::SYM_SHAPE;\n\t\t} else if (filename == SYM_TEXT_TAG) {\n\t\t\treturn s2::SYM_TEXTBOX;\n\t\t}\n\t}\n\n\treturn s2::SYM_UNKNOWN;\n}\n\nconst std::string& SymbolFile::Tag(int type) const\n{\n\tconst std::string& tag = gum::SymbolFile::Instance()->Tag(type);\n\tif (tag != gum::SymbolFile::UNKNOWN_TAG) {\n\t\treturn tag;\n\t}\n\n\tstd::map<int, std::string>::const_iterator itr = m_type2tag.find(type);\n\tif (itr != m_type2tag.end()) {\n\t\treturn itr->second;\n\t} else {\n\t\treturn gum::SymbolFile::UNKNOWN_TAG;\n\t}\n}\n\nvoid SymbolFile::Regist(int type, const std::string& tag)\n{\n\tm_type2tag.insert(std::make_pair(type, tag));\n\tm_tag2type.insert(std::make_pair(tag, type));\n}\n\nint SymbolFile::CheckTypeFromData(const std::string& filepath) const\n{\n\tJson::Value val;\n\tJson::Reader reader;\n\tstd::locale::global(std::locale(\"\"));\n\tstd::ifstream fin(filepath.c_str());\n\tstd::locale::global(std::locale(\"C\"));\n\treader.parse(fin, val);\n\tfin.close();\n\n\tint ret = s2::SYM_UNKNOWN;\n\tint type = gum::ExtendSymFile::GetType(val);\n\tswitch (type)\n\t{\n\tcase gum::SYM_SPINE:\n\t\tret = val.isMember(\"animations\") ? s2::SYM_ANIM2 : s2::SYM_SKELETON;\n\t\tbreak;\n\tcase gum::SYM_BODYMOVIN:\n\t\tret = s2::SYM_ANIMATION;\n\t\tbreak;\n\t}\n\treturn ret;\n}\n\n}<commit_msg>[CHANGED] not load bodymovin directly<commit_after>#include \"SymbolFile.h\"\n#include \"SymbolType.h\"\n#include \"FileHelper.h\"\n\n#include <sprite2\/SymType.h>\n#include <gum\/SymbolFile.h>\n#include <gum\/ExtendSymFile.h>\n\n#include <json\/json.h>\n\n#include <fstream>\n\nnamespace ee\n{\n\nSINGLETON_DEFINITION(SymbolFile);\n\nstatic const char* TAG_GEN = \"gen\";\n\nSymbolFile::SymbolFile()\n{\n\tRegist(SYM_ANIS,\t\t\"anis\");\n\tRegist(SYM_FONTBLANK,\t\"fontblank\");\n\tRegist(SYM_FREETYPE,\t\"freetype\");\n\tRegist(SYM_SCRIPTS,\t\t\"scripts\");\n\tRegist(SYM_P3DINV,\t\t\"p3dinv\");\n\tRegist(SYM_EJOY2D,\t\t\"ejoy2d\");\n\tRegist(SYM_TERRAIN2D,\t\"terrain2d\");\n\tRegist(SYM_SHADOW,\t\t\"shadow\");\n\tRegist(SYM_UI,\t\t\t\"ui\");\n\tRegist(SYM_PSD,\t\t\t\"psd\");\n\tRegist(SYM_UIWND,\t\t\"uiwnd\");\n\n\tRegist(s2::SYM_SCALE9,\t\t\"scale9\");\n\tRegist(s2::SYM_ICON,\t\t\"icon\");\n\tRegist(s2::SYM_TEXTURE,\t\t\"texture\");\n\tRegist(s2::SYM_TEXTBOX,\t\t\"text\");\n\tRegist(s2::SYM_COMPLEX,\t\t\"complex\");\n\tRegist(s2::SYM_ANIMATION,\t\"anim\");\n\tRegist(s2::SYM_PARTICLE3D,\t\"particle\");\n\tRegist(s2::SYM_PARTICLE2D,\t\"particle2d\");\n\tRegist(s2::SYM_SHAPE,\t\t\"shape\");\n\tRegist(s2::SYM_MESH,\t\t\"mesh\");\n\tRegist(s2::SYM_MASK,\t\t\"mask\");\n\tRegist(s2::SYM_TRAIL,\t\t\"trail\");\n\tRegist(s2::SYM_SKELETON,\t\"skeleton\");\n}\n\nint SymbolFile::Type(const std::string& filepath) const\n{\n\tint type = gum::SymbolFile::Instance()->Type(filepath);\n\tif (type != s2::SYM_UNKNOWN && type != s2::SYM_INVALID) {\n\t\treturn type;\n\t}\n\t\n\tint pos = filepath.rfind('.');\n\tstd::string ext = filepath.substr(pos + 1);\n\tif (ext == \"json\")\n\t{\n\t\tconst std::string filename = filepath.substr(0, filepath.find_last_of('.'));\n\t\tint pos = filename.find_last_of('_');\n\t\tif (pos == -1) {\n\t\t\treturn CheckTypeFromData(filepath);\n\t\t}\n\n\t\tstd::string tag = filename.substr(pos + 1);\n\t\tpos = tag.find(TAG_GEN);\n\t\tif (pos != std::string::npos) {\n\t\t\ttag = tag.substr(0, pos - 1);\n\t\t}\n\n\t\tstd::map<std::string, int>::const_iterator itr = m_tag2type.find(tag);\n\t\tif (itr != m_tag2type.end()) {\n\t\t\treturn itr->second;\n\t\t} \n\n\t\treturn CheckTypeFromData(filepath);\n\t}\n\telse if (ext == \"lua\")\n\t{\n\t\tconst std::string name = filepath.substr(0, filepath.find_last_of('.'));\n\t\tif (name.find('_') == -1) {\n\t\t\treturn s2::SYM_UNKNOWN;\n\t\t}\n\t\tconst std::string json_ext = name.substr(name.find_last_of('_') + 1);\n\t\tif (json_ext == \"scripts\") {\n\t\t\treturn SYM_SCRIPTS;\n\t\t} else {\n\t\t\treturn s2::SYM_UNKNOWN;\n\t\t}\n\t}\n\telse if (ext == \"ttf\")\n\t{\n\t\treturn SYM_FREETYPE;\n\t}\n\telse\n\t{\n\t\tstd::string filename = FileHelper::GetFilename(filepath);\n\t\tif (filename == SYM_GROUP_TAG) {\n\t\t\treturn s2::SYM_COMPLEX;\n\t\t} else if (filename == SYM_SHAPE_TAG) {\n\t\t\treturn s2::SYM_SHAPE;\n\t\t} else if (filename == SYM_TEXT_TAG) {\n\t\t\treturn s2::SYM_TEXTBOX;\n\t\t}\n\t}\n\n\treturn s2::SYM_UNKNOWN;\n}\n\nconst std::string& SymbolFile::Tag(int type) const\n{\n\tconst std::string& tag = gum::SymbolFile::Instance()->Tag(type);\n\tif (tag != gum::SymbolFile::UNKNOWN_TAG) {\n\t\treturn tag;\n\t}\n\n\tstd::map<int, std::string>::const_iterator itr = m_type2tag.find(type);\n\tif (itr != m_type2tag.end()) {\n\t\treturn itr->second;\n\t} else {\n\t\treturn gum::SymbolFile::UNKNOWN_TAG;\n\t}\n}\n\nvoid SymbolFile::Regist(int type, const std::string& tag)\n{\n\tm_type2tag.insert(std::make_pair(type, tag));\n\tm_tag2type.insert(std::make_pair(tag, type));\n}\n\nint SymbolFile::CheckTypeFromData(const std::string& filepath) const\n{\n\tJson::Value val;\n\tJson::Reader reader;\n\tstd::locale::global(std::locale(\"\"));\n\tstd::ifstream fin(filepath.c_str());\n\tstd::locale::global(std::locale(\"C\"));\n\treader.parse(fin, val);\n\tfin.close();\n\n\tint ret = s2::SYM_UNKNOWN;\n\tint type = gum::ExtendSymFile::GetType(val);\n\tswitch (type)\n\t{\n\tcase gum::SYM_SPINE:\n\t\tret = val.isMember(\"animations\") ? s2::SYM_ANIM2 : s2::SYM_SKELETON;\n\t\tbreak;\n\/\/ \tcase gum::SYM_BODYMOVIN:\n\/\/ \t\tret = s2::SYM_ANIMATION;\n\/\/ \t\tbreak;\n\t}\n\treturn ret;\n}\n\n}<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Created by monty on 06\/10\/16.\n\/\/\n\n\n\n#include \"glm\/glm.hpp\"\n#include \"glm\/gtc\/type_ptr.hpp\"\n#include \"glm\/gtc\/matrix_transform.hpp\"\n\n#include <utility>\n#include <functional>\n#include <string>\n#include <iostream>\n#include <memory>\n#include <map>\n#include <array>\n#include <fstream>\n#include <vector>\n#include <cstdlib>\n\n#include \"Vec2i.h\"\n#include \"NativeBitmap.h\"\n#include \"IMapElement.h\"\n#include \"CTeam.h\"\n#include \"CItem.h\"\n#include \"CActor.h\"\n#include \"CGameDelegate.h\"\n#include \"CMap.h\"\n#include \"IRenderer.h\"\n\n#include \"IFileLoaderDelegate.h\"\n#include \"CGame.h\"\n#include \"NoudarGLES2Bridge.h\"\n\n\n#include \"AudioSink.h\"\n#include \"SoundClip.h\"\n#include \"SoundUtils.h\"\n#include \"SoundListener.h\"\n#include \"SoundEmitter.h\"\n\n#include \"NoudarDungeonSnapshot.h\"\n\n#include \"GameNativeAPI.h\"\n\n#include \"Logger.h\"\n#include \"VisibilityStrategy.h\"\n\nnamespace odb {\n\n\tKnights::EDirection previousDirection = Knights::EDirection::kNorth;\n\tKnights::Vec2i previousPosition = {0,0};\n\tVisMap previous;\n\n    void NoudarGLES2Bridge::drawMap(Knights::CMap &map, std::shared_ptr<Knights::CActor> current) {\n\n        odb::NoudarDungeonSnapshot snapshot;\n\n        for ( int y = 0; y < Knights::kMapSize; ++y ) {\n            for ( int x = 0; x < Knights::kMapSize; ++x ) {\n\n                snapshot.map[ y ][ x ] = '.';\n                snapshot.snapshot[ y ][ x ] = EActorsSnapshotElement::kNothing;\n                snapshot.ids[ y ][ x ] = 0;\n                snapshot.splat[ y ][ x ] = -1;\n                snapshot.mVisibilityMap[ y ][ x ] = EVisibility::kVisible;\n\n\t            auto element = map.getElementAt( x, y );\n\n\t            if ( element != '0' ) {\n                    snapshot.map[ y ][ x ] = element;\n\t            }\n\n\t            auto actor = map.getActorAt({ x, y } );\n\n\t            if ( actor != nullptr && actor->isAlive()) {\n\n                    snapshot.ids[ y ][ x ] = actor->getId();\n                    bool alternate = (actor->getMoves() % 2) == 0;\n\n                    if ( actor->getTeam() != current->getTeam() ) {\n                        if ( actor->getStance() == Knights::EStance::kAttacking ) {\n                            snapshot.snapshot[ y ][ x ] = ( alternate ) ? EActorsSnapshotElement::kDemonAttacking0 : EActorsSnapshotElement::kDemonAttacking1;\n                        } else {\n                            snapshot.snapshot[ y ][ x ] =  ( alternate ) ? EActorsSnapshotElement::kDemonStanding0 : EActorsSnapshotElement::kDemonStanding1;\n                        }\n                    } else {\n                        if ( actor->getStance() == Knights::EStance::kAttacking ) {\n                            snapshot.snapshot[ y ][ x ] = ( alternate ) ? EActorsSnapshotElement::kHeroAttacking0 : EActorsSnapshotElement::kHeroAttacking1;\n                        } else {\n                            snapshot.snapshot[ y ][ x ] =  ( alternate ) ? EActorsSnapshotElement::kHeroStanding0: EActorsSnapshotElement::kHeroStanding1;\n                        }\n                    }\n                }\n            }\n        }\n\n        auto cameraPosition = current->getPosition();\n\t    VisMap currentVisMap;\n        VisibilityStrategy::castVisibility( currentVisMap, snapshot.map,  cameraPosition, current->getDirection(), true );\n\t    VisibilityStrategy::castVisibility( previous, snapshot.map,  previousPosition, previousDirection, true );\n\t    VisibilityStrategy::mergeInto( currentVisMap, previous, snapshot.mVisibilityMap);\n        auto item = current->getSelectedItem();\n\n        if ( item != nullptr ) {\n            snapshot.mCurrentItem = item->to_string();\n        } else {\n            snapshot.mCurrentItem = \"\";\n        }\n\n        snapshot.mHP = current->getHP();\n\n        setSnapshot( snapshot );\n\n\t    previousPosition = cameraPosition;\n\t    previousDirection = current->getDirection();\n\t    previous = snapshot.mVisibilityMap;\n    }\n\n    char NoudarGLES2Bridge::getInput() {\n\n\t    char tmp = mNextCmd;\n\t    mNextCmd = '.';\n        return tmp;\n    }\n\n\tvoid NoudarGLES2Bridge::setNextCommand(char cmd) {\n\t\tmNextCmd = cmd;\n\t}\n}\n<commit_msg>Update to the new interface in CMap<commit_after>\/\/\n\/\/ Created by monty on 06\/10\/16.\n\/\/\n\n\n\n#include \"glm\/glm.hpp\"\n#include \"glm\/gtc\/type_ptr.hpp\"\n#include \"glm\/gtc\/matrix_transform.hpp\"\n\n#include <utility>\n#include <functional>\n#include <string>\n#include <iostream>\n#include <memory>\n#include <map>\n#include <array>\n#include <fstream>\n#include <vector>\n#include <cstdlib>\n\n#include \"Vec2i.h\"\n#include \"NativeBitmap.h\"\n#include \"IMapElement.h\"\n#include \"CTeam.h\"\n#include \"CItem.h\"\n#include \"CActor.h\"\n#include \"CGameDelegate.h\"\n#include \"CMap.h\"\n#include \"IRenderer.h\"\n\n#include \"IFileLoaderDelegate.h\"\n#include \"CGame.h\"\n#include \"NoudarGLES2Bridge.h\"\n\n\n#include \"AudioSink.h\"\n#include \"SoundClip.h\"\n#include \"SoundUtils.h\"\n#include \"SoundListener.h\"\n#include \"SoundEmitter.h\"\n\n#include \"NoudarDungeonSnapshot.h\"\n\n#include \"GameNativeAPI.h\"\n\n#include \"Logger.h\"\n#include \"VisibilityStrategy.h\"\n\nnamespace odb {\n\n\tKnights::EDirection previousDirection = Knights::EDirection::kNorth;\n\tKnights::Vec2i previousPosition = {0,0};\n\tVisMap previous;\n\n    void NoudarGLES2Bridge::drawMap(Knights::CMap &map, std::shared_ptr<Knights::CActor> current) {\n\n        odb::NoudarDungeonSnapshot snapshot;\n\n        for ( int y = 0; y < Knights::kMapSize; ++y ) {\n            for ( int x = 0; x < Knights::kMapSize; ++x ) {\n\n                snapshot.map[ y ][ x ] = '.';\n                snapshot.snapshot[ y ][ x ] = EActorsSnapshotElement::kNothing;\n                snapshot.ids[ y ][ x ] = 0;\n                snapshot.splat[ y ][ x ] = -1;\n                snapshot.mVisibilityMap[ y ][ x ] = EVisibility::kVisible;\n\n\t            auto element = map.getElementAt( {x, y} );\n\n\t            if ( element != '0' ) {\n                    snapshot.map[ y ][ x ] = element;\n\t            }\n\n\t            auto actor = map.getActorAt({ x, y } );\n\n\t            if ( actor != nullptr && actor->isAlive()) {\n\n                    snapshot.ids[ y ][ x ] = actor->getId();\n                    bool alternate = (actor->getMoves() % 2) == 0;\n\n                    if ( actor->getTeam() != current->getTeam() ) {\n                        if ( actor->getStance() == Knights::EStance::kAttacking ) {\n                            snapshot.snapshot[ y ][ x ] = ( alternate ) ? EActorsSnapshotElement::kDemonAttacking0 : EActorsSnapshotElement::kDemonAttacking1;\n                        } else {\n                            snapshot.snapshot[ y ][ x ] =  ( alternate ) ? EActorsSnapshotElement::kDemonStanding0 : EActorsSnapshotElement::kDemonStanding1;\n                        }\n                    } else {\n                        if ( actor->getStance() == Knights::EStance::kAttacking ) {\n                            snapshot.snapshot[ y ][ x ] = ( alternate ) ? EActorsSnapshotElement::kHeroAttacking0 : EActorsSnapshotElement::kHeroAttacking1;\n                        } else {\n                            snapshot.snapshot[ y ][ x ] =  ( alternate ) ? EActorsSnapshotElement::kHeroStanding0: EActorsSnapshotElement::kHeroStanding1;\n                        }\n                    }\n                }\n            }\n        }\n\n        auto cameraPosition = current->getPosition();\n\t    VisMap currentVisMap;\n        VisibilityStrategy::castVisibility( currentVisMap, snapshot.map,  cameraPosition, current->getDirection(), true );\n\t    VisibilityStrategy::castVisibility( previous, snapshot.map,  previousPosition, previousDirection, true );\n\t    VisibilityStrategy::mergeInto( currentVisMap, previous, snapshot.mVisibilityMap);\n        auto item = current->getSelectedItem();\n\n        if ( item != nullptr ) {\n            snapshot.mCurrentItem = item->to_string();\n        } else {\n            snapshot.mCurrentItem = \"\";\n        }\n\n        snapshot.mHP = current->getHP();\n\n        setSnapshot( snapshot );\n\n\t    previousPosition = cameraPosition;\n\t    previousDirection = current->getDirection();\n\t    previous = snapshot.mVisibilityMap;\n    }\n\n    char NoudarGLES2Bridge::getInput() {\n\n\t    char tmp = mNextCmd;\n\t    mNextCmd = '.';\n        return tmp;\n    }\n\n\tvoid NoudarGLES2Bridge::setNextCommand(char cmd) {\n\t\tmNextCmd = cmd;\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <windows.h>\r\n#include <commctrl.h >\r\n#include \"hexcalc.h\"\r\n#include \"helper.h\"\r\n#include \"test.h\"\r\n\r\n#if _DEBUG\r\n#pragma comment(linker, \"\/SUBSYSTEM:console \/ENTRY:WinMainCRTStartup \")\r\n#endif\r\n\r\n#define IDC_MAIN_INPUT\t101\r\n#define IDC_MAIN_OUTPUT\t102\r\n#define IDC_ALWAYSTOP_CHECKBOX 103\r\n#pragma comment( lib, \"comctl32.lib\") \r\n#pragma comment(linker,\"\\\"\/manifestdependency:type='win32' \\\r\nname='Microsoft.Windows.Common-Controls' version='6.0.0.0' \\\r\nprocessorArchitecture='*' publicKeyToken='6595b64144ccf1df' language='*'\\\"\")\r\n\r\nconst char g_szClassName[] = \"WinHexCalc\";\r\n\r\n\/\/ Step 4: the Window Procedure\r\nLRESULT CALLBACK WndProc(HWND hwnd, UINT msg, WPARAM wParam, LPARAM lParam)\r\n{\r\n\tstatic HWND hOutput;\r\n\tstatic HWND hInput;\r\n\tstatic HWND hAlwaysTop;\r\n\tstatic HBRUSH hBrush;\r\n\r\n\tchar buffer[256];\r\n\tchar outputString[256];\r\n\tchar binaryOutput[256];\r\n\tchar binaryOutput2[256];\r\n\tEvaluate eval;\r\n\r\n\tswitch (msg)\r\n\t{\r\n\t\tcase WM_CREATE:\r\n\t\t{\r\n\t\t\tHFONT hfDefault;\r\n\r\n\t\t\thOutput = CreateWindowEx(WS_EX_CLIENTEDGE, \"EDIT\", \"\",\r\n\t\t\t\tWS_CHILD | WS_VISIBLE | WS_VSCROLL | ES_MULTILINE | ES_AUTOVSCROLL,\r\n\t\t\t\t0, 0, 0, 0, hwnd, (HMENU)IDC_MAIN_OUTPUT, GetModuleHandle(NULL), NULL);\r\n\t\t\tif (hOutput == NULL)\r\n\t\t\t\tMessageBox(hwnd, \"Could not create edit box.\", \"Error\", MB_OK | MB_ICONERROR);\r\n\r\n\t\t\thInput = CreateWindowEx(WS_EX_CLIENTEDGE, \"EDIT\", \"\",\r\n\t\t\t\tWS_CHILD | WS_VISIBLE,\r\n\t\t\t\t0, 0, 0, 0, hwnd, (HMENU)IDC_MAIN_INPUT, GetModuleHandle(NULL), NULL);\r\n\t\t\tif (hOutput == NULL)\r\n\t\t\t\tMessageBox(hwnd, \"Could not create edit box.\", \"Error\", MB_OK | MB_ICONERROR);\r\n\r\n\t\t\thAlwaysTop = CreateWindowEx(NULL, \"BUTTON\", \"Always on Top\",\r\n\t\t\t\tWS_CHILD | WS_VISIBLE | BS_AUTOCHECKBOX,\r\n\t\t\t\t0, 0, 0, 0,\r\n\t\t\t\thwnd, (HMENU)IDC_ALWAYSTOP_CHECKBOX, GetModuleHandle(NULL), NULL);\r\n\t\t\tif (hAlwaysTop == NULL)\r\n\t\t\t\tMessageBox(hwnd, \"Could not create check box.\", \"Error\", MB_OK | MB_ICONERROR);\r\n\r\n\t\t\thfDefault = CreateFont(-17, 0, 0, 0, FW_NORMAL, 0, 0, 0, DEFAULT_CHARSET, OUT_DEFAULT_PRECIS, CLIP_DEFAULT_PRECIS, DEFAULT_QUALITY, FF_DONTCARE, \"Courier New\");\r\n\t\t\t\/\/hfDefault=CreateFont(-17,0,0,0,FW_NORMAL,0,0,0,DEFAULT_CHARSET,OUT_DEFAULT_PRECIS,CLIP_DEFAULT_PRECIS,DEFAULT_QUALITY,FF_DONTCARE,\"Consolas\");\r\n\r\n\t\t\thBrush = CreateSolidBrush(RGB(255, 255, 255));\r\n\r\n\t\t\t\/\/hfDefault = GetStockObject(DEFAULT_GUI_FONT);\r\n\t\t\tSendMessage(hInput, WM_SETFONT, (WPARAM)hfDefault, MAKELPARAM(FALSE, 0));\r\n\t\t\tSendMessage(hOutput, WM_SETFONT, (WPARAM)hfDefault, MAKELPARAM(FALSE, 0));\r\n\t\t\t\r\n\t\t\t\/\/ set default focus on text input control\r\n\t\t\tSetFocus(hInput);\r\n\t\t\t\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tcase WM_SIZE:\r\n\t\t{\r\n\t\t\t\/\/ x, y = 640, 480\r\n\r\n\t\t\tRECT rcClient;\r\n\t\t\tGetClientRect(hwnd, &rcClient);\r\n\t\t\tSetWindowPos(hOutput, NULL, 10, 50, rcClient.right - 20, rcClient.bottom - 100, SWP_NOZORDER);\r\n\t\t\tSetWindowPos(hInput, NULL, 10, 10, rcClient.right - 20, 30, SWP_NOZORDER);\r\n\t\t\tSetWindowPos(hAlwaysTop, NULL, rcClient.right - 140, rcClient.bottom - 40, 160, 30, SWP_NOZORDER);\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tcase WM_COMMAND:\r\n\t\t{\r\n\t\t\tif (lParam == (LPARAM)hInput &&  HIWORD(wParam) == EN_CHANGE)\r\n\t\t\t{\r\n\t\t\t\tGetWindowText(hInput, buffer, sizeof(buffer));\r\n\t\t\t\tint64_t result = eval.Eval(buffer);\r\n\t\t\t\tprintToBinary((result >> 32), binaryOutput);\r\n\t\t\t\tprintToBinary((result & 0xffffffff), binaryOutput2);\r\n\t\t\t\tint64_t strBuffer[2] = {};\r\n\t\t\t\t*(strBuffer) = result;\r\n\t\t\t\tsprintf(outputString,\r\n\t\t\t\t\t\"Result:\"\r\n\t\t\t\t\t\"\\r\\n\"\r\n\t\t\t\t\t\"\\r\\n Signed  : %I64d\"\r\n\t\t\t\t\t\"\\r\\n\"\r\n\t\t\t\t\t\"\\r\\n Unsigned: %I64u\"\r\n\t\t\t\t\t\"\\r\\n\"\r\n\t\t\t\t\t\"\\r\\n Hex     : 0x%016llX\"\r\n\t\t\t\t\t\"\\r\\n\"\r\n\t\t\t\t\t\"\\r\\n Binary  : %s\"\r\n\t\t\t\t\t\"\\r\\n           %s\"\r\n\t\t\t\t\t\"\\r\\n\"\r\n\t\t\t\t\t\"\\r\\n String  : %s\", result, result, result, binaryOutput, binaryOutput2, (char *)strBuffer);\r\n\t\t\t\tSetWindowText(hOutput, outputString);\r\n\r\n\t\t\t}\r\n\t\t\telse if (HIWORD(wParam) == BN_CLICKED && LOWORD(wParam) == IDC_ALWAYSTOP_CHECKBOX)\r\n\t\t\t{\r\n\r\n\t\t\t\tRECT rect;\r\n\t\t\t\tGetWindowRect(hwnd, &rect);\r\n\r\n\t\t\t\tLRESULT chk = SendMessage((HWND)lParam, BM_GETCHECK, 0, 0);\r\n\r\n\t\t\t\tSetWindowPos(hwnd,\r\n\t\t\t\t\tchk == BST_CHECKED ? HWND_TOPMOST : HWND_NOTOPMOST,\r\n\t\t\t\t\trect.left, rect.top, rect.right - rect.left, rect.bottom - rect.top,\r\n\t\t\t\t\tSWP_SHOWWINDOW);\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tcase WM_CTLCOLORSTATIC:\r\n\t\t{\r\n\t\t\tHDC hdc = (HDC)wParam;\r\n\t\t\tHWND hWnd = (HWND)lParam;\r\n\t\t\tif (hWnd == hAlwaysTop)\r\n\t\t\t{\r\n\t\t\t\tSetBkMode(hdc, TRANSPARENT);\r\n\t\t\t\tSetTextColor(hdc, RGB(0, 0, 0));\r\n\t\t\t\treturn (LRESULT)hBrush;\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tcase WM_CLOSE:\r\n\t\t\tDestroyWindow(hwnd);\r\n\t\t\tbreak;\r\n\t\tcase WM_DESTROY:\r\n\t\t\tPostQuitMessage(0);\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n\t\t\treturn DefWindowProc(hwnd, msg, wParam, lParam);\r\n\t}\r\n\treturn 0;\r\n}\r\n\r\nint WINAPI WinMain(HINSTANCE hInstance, HINSTANCE, LPSTR, int nCmdShow)\r\n{\r\n\r\n\t\/\/ run unit test\r\n#ifdef _DEBUG\r\n\ttestHexCalc();\r\n#endif\r\n\r\n\tWNDCLASSEX wc;\r\n\tHWND hwnd;\r\n\tMSG Msg;\r\n\r\n\r\n\t\/\/Step 1: Registering the Window Class\r\n\twc.cbSize = sizeof(WNDCLASSEX);\r\n\twc.style = 0;\r\n\twc.lpfnWndProc = WndProc;\r\n\twc.cbClsExtra = 0;\r\n\twc.cbWndExtra = 0;\r\n\twc.hInstance = hInstance;\r\n\twc.hIcon = LoadIcon(NULL, IDI_APPLICATION);\r\n\twc.hCursor = LoadCursor(NULL, IDC_ARROW);\r\n\twc.hbrBackground = (HBRUSH)(COLOR_WINDOW + 1);\r\n\twc.lpszMenuName = NULL;\r\n\twc.lpszClassName = g_szClassName;\r\n\twc.hIconSm = LoadIcon(NULL, IDI_APPLICATION);\r\n\tInitCommonControls();\r\n\tif (!RegisterClassEx(&wc))\r\n\t{\r\n\t\tMessageBox(NULL, \"Window Registration Failed!\", \"Error!\",\r\n\t\t\tMB_ICONEXCLAMATION | MB_OK);\r\n\t\treturn 0;\r\n\t}\r\n\r\n\t\/\/ Step 2: Creating the Window\r\n\thwnd = CreateWindowEx(\r\n\t\tWS_EX_CLIENTEDGE,\r\n\t\tg_szClassName,\r\n\t\t\"WinHexCalc v0.2 - https:\/\/www.github.com\/azlan\/WinHexCalc\",\r\n\t\tWS_OVERLAPPEDWINDOW,\r\n\t\tCW_USEDEFAULT, CW_USEDEFAULT, 630, 400,\r\n\t\tNULL, NULL, hInstance, NULL);\r\n\r\n\tif (hwnd == NULL)\r\n\t{\r\n\t\tMessageBox(NULL, \"Window Creation Failed!\", \"Error!\",\r\n\t\t\tMB_ICONEXCLAMATION | MB_OK);\r\n\t\treturn 0;\r\n\t}\r\n\r\n\tShowWindow(hwnd, nCmdShow);\r\n\tUpdateWindow(hwnd);\r\n\r\n\t\/\/ Step 3: The Message Loop\r\n\twhile (GetMessage(&Msg, NULL, 0, 0) > 0)\r\n\t{\r\n\t\tTranslateMessage(&Msg);\r\n\t\tDispatchMessage(&Msg);\r\n\t}\r\n\treturn Msg.wParam;\r\n}\r\n<commit_msg>Remove Mingw-w64 warning about null pointer.<commit_after>#include <windows.h>\r\n#include <commctrl.h >\r\n#include \"hexcalc.h\"\r\n#include \"helper.h\"\r\n#include \"test.h\"\r\n\r\n#if _DEBUG\r\n#pragma comment(linker, \"\/SUBSYSTEM:console \/ENTRY:WinMainCRTStartup \")\r\n#endif\r\n\r\n#define IDC_MAIN_INPUT\t101\r\n#define IDC_MAIN_OUTPUT\t102\r\n#define IDC_ALWAYSTOP_CHECKBOX 103\r\n#pragma comment( lib, \"comctl32.lib\") \r\n#pragma comment(linker,\"\\\"\/manifestdependency:type='win32' \\\r\nname='Microsoft.Windows.Common-Controls' version='6.0.0.0' \\\r\nprocessorArchitecture='*' publicKeyToken='6595b64144ccf1df' language='*'\\\"\")\r\n\r\nconst char g_szClassName[] = \"WinHexCalc\";\r\n\r\n\/\/ Step 4: the Window Procedure\r\nLRESULT CALLBACK WndProc(HWND hwnd, UINT msg, WPARAM wParam, LPARAM lParam)\r\n{\r\n\tstatic HWND hOutput;\r\n\tstatic HWND hInput;\r\n\tstatic HWND hAlwaysTop;\r\n\tstatic HBRUSH hBrush;\r\n\r\n\tchar buffer[256];\r\n\tchar outputString[256];\r\n\tchar binaryOutput[256];\r\n\tchar binaryOutput2[256];\r\n\tEvaluate eval;\r\n\r\n\tswitch (msg)\r\n\t{\r\n\t\tcase WM_CREATE:\r\n\t\t{\r\n\t\t\tHFONT hfDefault;\r\n\r\n\t\t\thOutput = CreateWindowEx(WS_EX_CLIENTEDGE, \"EDIT\", \"\",\r\n\t\t\t\tWS_CHILD | WS_VISIBLE | WS_VSCROLL | ES_MULTILINE | ES_AUTOVSCROLL,\r\n\t\t\t\t0, 0, 0, 0, hwnd, (HMENU)IDC_MAIN_OUTPUT, GetModuleHandle(NULL), NULL);\r\n\t\t\tif (hOutput == NULL)\r\n\t\t\t\tMessageBox(hwnd, \"Could not create edit box.\", \"Error\", MB_OK | MB_ICONERROR);\r\n\r\n\t\t\thInput = CreateWindowEx(WS_EX_CLIENTEDGE, \"EDIT\", \"\",\r\n\t\t\t\tWS_CHILD | WS_VISIBLE,\r\n\t\t\t\t0, 0, 0, 0, hwnd, (HMENU)IDC_MAIN_INPUT, GetModuleHandle(NULL), NULL);\r\n\t\t\tif (hOutput == NULL)\r\n\t\t\t\tMessageBox(hwnd, \"Could not create edit box.\", \"Error\", MB_OK | MB_ICONERROR);\r\n\r\n\t\t\thAlwaysTop = CreateWindowEx(0, \"BUTTON\", \"Always on Top\",\r\n\t\t\t\tWS_CHILD | WS_VISIBLE | BS_AUTOCHECKBOX,\r\n\t\t\t\t0, 0, 0, 0,\r\n\t\t\t\thwnd, (HMENU)IDC_ALWAYSTOP_CHECKBOX, GetModuleHandle(NULL), NULL);\r\n\t\t\tif (hAlwaysTop == NULL)\r\n\t\t\t\tMessageBox(hwnd, \"Could not create check box.\", \"Error\", MB_OK | MB_ICONERROR);\r\n\r\n\t\t\thfDefault = CreateFont(-17, 0, 0, 0, FW_NORMAL, 0, 0, 0, DEFAULT_CHARSET, OUT_DEFAULT_PRECIS, CLIP_DEFAULT_PRECIS, DEFAULT_QUALITY, FF_DONTCARE, \"Courier New\");\r\n\t\t\t\/\/hfDefault=CreateFont(-17,0,0,0,FW_NORMAL,0,0,0,DEFAULT_CHARSET,OUT_DEFAULT_PRECIS,CLIP_DEFAULT_PRECIS,DEFAULT_QUALITY,FF_DONTCARE,\"Consolas\");\r\n\r\n\t\t\thBrush = CreateSolidBrush(RGB(255, 255, 255));\r\n\r\n\t\t\t\/\/hfDefault = GetStockObject(DEFAULT_GUI_FONT);\r\n\t\t\tSendMessage(hInput, WM_SETFONT, (WPARAM)hfDefault, MAKELPARAM(FALSE, 0));\r\n\t\t\tSendMessage(hOutput, WM_SETFONT, (WPARAM)hfDefault, MAKELPARAM(FALSE, 0));\r\n\t\t\t\r\n\t\t\t\/\/ set default focus on text input control\r\n\t\t\tSetFocus(hInput);\r\n\t\t\t\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tcase WM_SIZE:\r\n\t\t{\r\n\t\t\t\/\/ x, y = 640, 480\r\n\r\n\t\t\tRECT rcClient;\r\n\t\t\tGetClientRect(hwnd, &rcClient);\r\n\t\t\tSetWindowPos(hOutput, NULL, 10, 50, rcClient.right - 20, rcClient.bottom - 100, SWP_NOZORDER);\r\n\t\t\tSetWindowPos(hInput, NULL, 10, 10, rcClient.right - 20, 30, SWP_NOZORDER);\r\n\t\t\tSetWindowPos(hAlwaysTop, NULL, rcClient.right - 140, rcClient.bottom - 40, 160, 30, SWP_NOZORDER);\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tcase WM_COMMAND:\r\n\t\t{\r\n\t\t\tif (lParam == (LPARAM)hInput &&  HIWORD(wParam) == EN_CHANGE)\r\n\t\t\t{\r\n\t\t\t\tGetWindowText(hInput, buffer, sizeof(buffer));\r\n\t\t\t\tint64_t result = eval.Eval(buffer);\r\n\t\t\t\tprintToBinary((result >> 32), binaryOutput);\r\n\t\t\t\tprintToBinary((result & 0xffffffff), binaryOutput2);\r\n\t\t\t\tint64_t strBuffer[2] = {};\r\n\t\t\t\t*(strBuffer) = result;\r\n\t\t\t\tsprintf(outputString,\r\n\t\t\t\t\t\"Result:\"\r\n\t\t\t\t\t\"\\r\\n\"\r\n\t\t\t\t\t\"\\r\\n Signed  : %I64d\"\r\n\t\t\t\t\t\"\\r\\n\"\r\n\t\t\t\t\t\"\\r\\n Unsigned: %I64u\"\r\n\t\t\t\t\t\"\\r\\n\"\r\n\t\t\t\t\t\"\\r\\n Hex     : 0x%016llX\"\r\n\t\t\t\t\t\"\\r\\n\"\r\n\t\t\t\t\t\"\\r\\n Binary  : %s\"\r\n\t\t\t\t\t\"\\r\\n           %s\"\r\n\t\t\t\t\t\"\\r\\n\"\r\n\t\t\t\t\t\"\\r\\n String  : %s\", result, result, result, binaryOutput, binaryOutput2, (char *)strBuffer);\r\n\t\t\t\tSetWindowText(hOutput, outputString);\r\n\r\n\t\t\t}\r\n\t\t\telse if (HIWORD(wParam) == BN_CLICKED && LOWORD(wParam) == IDC_ALWAYSTOP_CHECKBOX)\r\n\t\t\t{\r\n\r\n\t\t\t\tRECT rect;\r\n\t\t\t\tGetWindowRect(hwnd, &rect);\r\n\r\n\t\t\t\tLRESULT chk = SendMessage((HWND)lParam, BM_GETCHECK, 0, 0);\r\n\r\n\t\t\t\tSetWindowPos(hwnd,\r\n\t\t\t\t\tchk == BST_CHECKED ? HWND_TOPMOST : HWND_NOTOPMOST,\r\n\t\t\t\t\trect.left, rect.top, rect.right - rect.left, rect.bottom - rect.top,\r\n\t\t\t\t\tSWP_SHOWWINDOW);\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tcase WM_CTLCOLORSTATIC:\r\n\t\t{\r\n\t\t\tHDC hdc = (HDC)wParam;\r\n\t\t\tHWND hWnd = (HWND)lParam;\r\n\t\t\tif (hWnd == hAlwaysTop)\r\n\t\t\t{\r\n\t\t\t\tSetBkMode(hdc, TRANSPARENT);\r\n\t\t\t\tSetTextColor(hdc, RGB(0, 0, 0));\r\n\t\t\t\treturn (LRESULT)hBrush;\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tcase WM_CLOSE:\r\n\t\t\tDestroyWindow(hwnd);\r\n\t\t\tbreak;\r\n\t\tcase WM_DESTROY:\r\n\t\t\tPostQuitMessage(0);\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n\t\t\treturn DefWindowProc(hwnd, msg, wParam, lParam);\r\n\t}\r\n\treturn 0;\r\n}\r\n\r\nint WINAPI WinMain(HINSTANCE hInstance, HINSTANCE, LPSTR, int nCmdShow)\r\n{\r\n\r\n\t\/\/ run unit test\r\n#ifdef _DEBUG\r\n\ttestHexCalc();\r\n#endif\r\n\r\n\tWNDCLASSEX wc;\r\n\tHWND hwnd;\r\n\tMSG Msg;\r\n\r\n\r\n\t\/\/Step 1: Registering the Window Class\r\n\twc.cbSize = sizeof(WNDCLASSEX);\r\n\twc.style = 0;\r\n\twc.lpfnWndProc = WndProc;\r\n\twc.cbClsExtra = 0;\r\n\twc.cbWndExtra = 0;\r\n\twc.hInstance = hInstance;\r\n\twc.hIcon = LoadIcon(NULL, IDI_APPLICATION);\r\n\twc.hCursor = LoadCursor(NULL, IDC_ARROW);\r\n\twc.hbrBackground = (HBRUSH)(COLOR_WINDOW + 1);\r\n\twc.lpszMenuName = NULL;\r\n\twc.lpszClassName = g_szClassName;\r\n\twc.hIconSm = LoadIcon(NULL, IDI_APPLICATION);\r\n\tInitCommonControls();\r\n\tif (!RegisterClassEx(&wc))\r\n\t{\r\n\t\tMessageBox(NULL, \"Window Registration Failed!\", \"Error!\",\r\n\t\t\tMB_ICONEXCLAMATION | MB_OK);\r\n\t\treturn 0;\r\n\t}\r\n\r\n\t\/\/ Step 2: Creating the Window\r\n\thwnd = CreateWindowEx(\r\n\t\tWS_EX_CLIENTEDGE,\r\n\t\tg_szClassName,\r\n\t\t\"WinHexCalc v0.2 - https:\/\/www.github.com\/azlan\/WinHexCalc\",\r\n\t\tWS_OVERLAPPEDWINDOW,\r\n\t\tCW_USEDEFAULT, CW_USEDEFAULT, 630, 400,\r\n\t\tNULL, NULL, hInstance, NULL);\r\n\r\n\tif (hwnd == NULL)\r\n\t{\r\n\t\tMessageBox(NULL, \"Window Creation Failed!\", \"Error!\",\r\n\t\t\tMB_ICONEXCLAMATION | MB_OK);\r\n\t\treturn 0;\r\n\t}\r\n\r\n\tShowWindow(hwnd, nCmdShow);\r\n\tUpdateWindow(hwnd);\r\n\r\n\t\/\/ Step 3: The Message Loop\r\n\twhile (GetMessage(&Msg, NULL, 0, 0) > 0)\r\n\t{\r\n\t\tTranslateMessage(&Msg);\r\n\t\tDispatchMessage(&Msg);\r\n\t}\r\n\treturn Msg.wParam;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/\/ unrealCTF.cpp : Defines the entry point for the DLL application.\n\/\/\n\n#include \"bzfsAPI.h\"\n#include \"plugin_utils.h\"\n\nBZ_GET_PLUGIN_VERSION\n\nclass UnrealCTFEventHandler : public bz_EventHandler\n{\npublic:\n  virtual void process ( bz_EventData *eventData );\n};\n\ntypedef struct \n{\n  int id;\n  int caried;\n  float basePos[3];\n}TeamFlagStatusRecord;\n\nTeamFlagStatusRecord  redFlag;\nTeamFlagStatusRecord  greenFlag;\nTeamFlagStatusRecord  blueFlag;\nTeamFlagStatusRecord  purpleFlag;\n\nbool gotFlags;\nvoid checkFlags ( void );\n\nUnrealCTFEventHandler unrealCTFEventHandler;\n\nBZF_PLUGIN_CALL int bz_Load ( const char* \/*commandLine*\/ )\n{\n  bz_registerEvent ( bz_eAllowFlagGrabEvent, &unrealCTFEventHandler );\n  bz_registerEvent ( bz_eFlagGrabbedEvent, &unrealCTFEventHandler );\n  bz_registerEvent ( bz_eAllowCTFCaptureEvent, &unrealCTFEventHandler );\n  bz_registerEvent ( bz_eWorldFinalized, &unrealCTFEventHandler );\n  bz_registerEvent ( bz_ePlayerJoinEvent, &unrealCTFEventHandler );\n\n  if (bz_anyPlayers())\n    checkFlags();\n  bz_debugMessage(4,\"unrealCTF plugin loaded\");\n  return 0;\n}\n\nBZF_PLUGIN_CALL int bz_Unload ( void )\n{\n  gotFlags = false;\n  bz_removeEvent ( bz_eAllowFlagGrabEvent, &unrealCTFEventHandler );\n  bz_removeEvent ( bz_ePlayerJoinEvent, &unrealCTFEventHandler );\n  bz_removeEvent ( bz_eFlagGrabbedEvent, &unrealCTFEventHandler );\n  bz_removeEvent ( bz_eAllowCTFCaptureEvent, &unrealCTFEventHandler );\n  bz_removeEvent ( bz_eWorldFinalized, &unrealCTFEventHandler );\n  bz_debugMessage(4,\"unrealCTF plugin unloaded\");\n  return 0;\n}\n\nbz_eTeamType teamFromFlag ( int i )\n{\n  std::string name = bz_getFlagName(i).c_str();\n  if ( name == \"R*\" )\n    return eRedTeam;\n\n  if ( name == \"G*\" )\n    return eGreenTeam;\n\n  if ( name == \"B*\" )\n    return eBlueTeam;\n\n  if ( name == \"P*\" )\n    return ePurpleTeam;\n\n  return eNoTeam;\n}\n\nvoid zapTeamFlagToBase ( bz_eTeamType team )\n{\n  if ( team == eRedTeam )\n  {\n    redFlag.caried = -1;\n    bz_resetFlag(redFlag.id);\n  }\n\n  if ( team == eGreenTeam  )\n  {\n    greenFlag.caried = -1;\n    bz_resetFlag ( greenFlag.id);\n  }\n\n  if ( team == eBlueTeam  )\n  {\n    blueFlag.caried = -1;\n    bz_resetFlag ( blueFlag.id);\n  }\n\n  if ( team == ePurpleTeam  )\n  {\n    purpleFlag.caried = -1;\n    bz_resetFlag ( purpleFlag.id);\n  }\n}\n\nvoid checkFlags ( void )\n{\n  if (gotFlags)\n    return;\n\n  bz_setBZDBBool(\"_grabOwnFlag\",true);\n  bz_APIWorldObjectList* worldObjects = bz_getWorldObjectList();\n\n  for ( int i = 0; i < (int)worldObjects->size(); i++)\n  {\n    if ( worldObjects->get(i)->type == eSolidObject)\n    {\n      bz_APISolidWorldObject_V1 *solid = (bz_APISolidWorldObject_V1*)worldObjects->get(i);\n      if ( solid->solidType == eBaseObject )\n      {\n\tbz_CTFBaseWorldObject_V1 *base = (bz_CTFBaseWorldObject_V1*)solid;\n\tswitch(base->team)\n\t{\n\t  case eRedTeam:\n\t    memcpy(redFlag.basePos,base->center,sizeof(float)*3);\n\t    redFlag.basePos[2] = base->maxAABBox[2]+0.1f;\n\t    break;\n\n\t  case eGreenTeam:\n\t    memcpy(greenFlag.basePos,base->center,sizeof(float)*3);\n\t    greenFlag.basePos[2] = base->maxAABBox[2]+0.1f;\n\t    break;\n\n\t  case eBlueTeam:\n\t    memcpy(blueFlag.basePos,base->center,sizeof(float)*3);\n\t    blueFlag.basePos[2] = base->maxAABBox[2]+0.1f;\n\t    break;\n\n\t   case ePurpleTeam:\n\t     memcpy(purpleFlag.basePos,base->center,sizeof(float)*3);\n\t     purpleFlag.basePos[2] = base->maxAABBox[2]+0.1f;\n\t     break;\n\t}\n      }\n    }\n  }\n\n  bz_releaseWorldObjectList(worldObjects);\n\n  int flagCount = bz_getNumFlags();\n  for ( int i = 0; i < flagCount; i++ )\n  {\n    std::string name = bz_getFlagName(i).c_str();\n\n    bz_eTeamType team = teamFromFlag(i);\n\n    if ( team == eRedTeam )\n      redFlag.id = i;\n\n    if ( team == eGreenTeam  )\n      greenFlag.id = i;\n\n    if ( team == eBlueTeam  )\n      blueFlag.id = i;\n\n    if ( team == ePurpleTeam  )\n      purpleFlag.id = i;\n\n    zapTeamFlagToBase(team);\n  }\n\n  gotFlags = true;\n}\n\n\nvoid setTeamFlagPickup ( bz_eTeamType team, int player )\n{\n  if ( team == eRedTeam )\n    redFlag.caried = player;\n\n  if ( team == eGreenTeam  )\n    greenFlag.caried = player;\n\n  if ( team == eBlueTeam  )\n    blueFlag.caried = player;\n\n  if ( team == ePurpleTeam  )\n    purpleFlag.caried = player;\n}\n\nint getTeamFlagCarier ( bz_eTeamType team)\n{\n  if ( team == eRedTeam )\n    return redFlag.caried;\n\n  if ( team == eGreenTeam  )\n    return greenFlag.caried;\n\n  if ( team == eBlueTeam  )\n    return blueFlag.caried;\n\n  if ( team == ePurpleTeam  )\n    return purpleFlag.caried;\n\n  return -1;\n}\n\n\nvoid UnrealCTFEventHandler::process ( bz_EventData *eventData )\n{\n  if (!eventData)\n    return;\n\n  switch(eventData->eventType)\n  {\n    case bz_ePlayerJoinEvent: \/\/ just in case we loaded, noone was here, and we didn't check the flags\n      if (!gotFlags)\n\tcheckFlags();\n      break;\n\n    case bz_eAllowFlagGrabEvent:\n      {\n\tbz_AllowFlagGrabEventData_V1 *allowGrab = (bz_AllowFlagGrabEventData_V1*)eventData;\n\tbz_eTeamType flagTeam = teamFromFlag(allowGrab->flagID);\n\tif ( flagTeam == eNoTeam)\n\t  break;\n\n\tbz_eTeamType playerTeam = bz_getPlayerTeam(allowGrab->playerID);\n\tif (playerTeam == eRogueTeam || playerTeam == flagTeam)\n\t{\n\t  zapTeamFlagToBase(flagTeam);\n\t  allowGrab->allow = false;\n\t}\n\n      }\n      break;\n\n    case bz_eFlagGrabbedEvent:\n    {\n\tbz_FlagGrabbedEventData_V1 *grabbed = (bz_FlagGrabbedEventData_V1*)eventData;\n\tbz_eTeamType flagTeam = teamFromFlag(grabbed->flagID);\n\tif ( flagTeam == eNoTeam)\n\t  break;\n\n\tbz_eTeamType playerTeam = bz_getPlayerTeam(grabbed->playerID);\n\tif (playerTeam == eRogueTeam || playerTeam == flagTeam)\n\t  zapTeamFlagToBase(flagTeam);\n\telse\n\t  setTeamFlagPickup(flagTeam,grabbed->playerID);\n    }\n    break;\n\n    case bz_eAllowCTFCaptureEvent:\n      {\n\tbz_AllowCTFCaptureEventData_V1* CTFCap = (bz_AllowCTFCaptureEventData_V1*)eventData;\n\n\tCTFCap->killTeam = false;\n\t\n\t\/\/ only let them cap if there flag is not caried\n\tCTFCap->allow = getTeamFlagCarier(CTFCap->teamCapping) == -1;\n      }\n      break;\n\n    case bz_eWorldFinalized:\n      gotFlags = false;\n      checkFlags();\n      break;\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 need to find the base zap point anymore.<commit_after>\/\/ unrealCTF.cpp : Defines the entry point for the DLL application.\n\/\/\n\n#include \"bzfsAPI.h\"\n#include \"plugin_utils.h\"\n\nBZ_GET_PLUGIN_VERSION\n\nclass UnrealCTFEventHandler : public bz_EventHandler\n{\npublic:\n  virtual void process ( bz_EventData *eventData );\n};\n\ntypedef struct \n{\n  int id;\n  int caried;\n}TeamFlagStatusRecord;\n\nTeamFlagStatusRecord  redFlag;\nTeamFlagStatusRecord  greenFlag;\nTeamFlagStatusRecord  blueFlag;\nTeamFlagStatusRecord  purpleFlag;\n\nbool gotFlags;\nvoid checkFlags ( void );\n\nUnrealCTFEventHandler unrealCTFEventHandler;\n\nBZF_PLUGIN_CALL int bz_Load ( const char* \/*commandLine*\/ )\n{\n  bz_registerEvent ( bz_eAllowFlagGrabEvent, &unrealCTFEventHandler );\n  bz_registerEvent ( bz_eFlagGrabbedEvent, &unrealCTFEventHandler );\n  bz_registerEvent ( bz_eAllowCTFCaptureEvent, &unrealCTFEventHandler );\n  bz_registerEvent ( bz_eWorldFinalized, &unrealCTFEventHandler );\n  bz_registerEvent ( bz_ePlayerJoinEvent, &unrealCTFEventHandler );\n\n  if (bz_anyPlayers())\n    checkFlags();\n  bz_debugMessage(4,\"unrealCTF plugin loaded\");\n  return 0;\n}\n\nBZF_PLUGIN_CALL int bz_Unload ( void )\n{\n  gotFlags = false;\n  bz_removeEvent ( bz_eAllowFlagGrabEvent, &unrealCTFEventHandler );\n  bz_removeEvent ( bz_ePlayerJoinEvent, &unrealCTFEventHandler );\n  bz_removeEvent ( bz_eFlagGrabbedEvent, &unrealCTFEventHandler );\n  bz_removeEvent ( bz_eAllowCTFCaptureEvent, &unrealCTFEventHandler );\n  bz_removeEvent ( bz_eWorldFinalized, &unrealCTFEventHandler );\n  bz_debugMessage(4,\"unrealCTF plugin unloaded\");\n  return 0;\n}\n\nbz_eTeamType teamFromFlag ( int i )\n{\n  std::string name = bz_getFlagName(i).c_str();\n  if ( name == \"R*\" )\n    return eRedTeam;\n\n  if ( name == \"G*\" )\n    return eGreenTeam;\n\n  if ( name == \"B*\" )\n    return eBlueTeam;\n\n  if ( name == \"P*\" )\n    return ePurpleTeam;\n\n  return eNoTeam;\n}\n\nvoid zapTeamFlagToBase ( bz_eTeamType team )\n{\n  if ( team == eRedTeam )\n  {\n    redFlag.caried = -1;\n    bz_resetFlag(redFlag.id);\n  }\n\n  if ( team == eGreenTeam  )\n  {\n    greenFlag.caried = -1;\n    bz_resetFlag ( greenFlag.id);\n  }\n\n  if ( team == eBlueTeam  )\n  {\n    blueFlag.caried = -1;\n    bz_resetFlag ( blueFlag.id);\n  }\n\n  if ( team == ePurpleTeam  )\n  {\n    purpleFlag.caried = -1;\n    bz_resetFlag ( purpleFlag.id);\n  }\n}\n\nvoid checkFlags ( void )\n{\n  if (gotFlags)\n    return;\n\n  bz_setBZDBBool(\"_grabOwnFlag\",true);\n \n  int flagCount = bz_getNumFlags();\n  for ( int i = 0; i < flagCount; i++ )\n  {\n    std::string name = bz_getFlagName(i).c_str();\n\n    bz_eTeamType team = teamFromFlag(i);\n\n    if ( team == eRedTeam )\n      redFlag.id = i;\n\n    if ( team == eGreenTeam  )\n      greenFlag.id = i;\n\n    if ( team == eBlueTeam  )\n      blueFlag.id = i;\n\n    if ( team == ePurpleTeam  )\n      purpleFlag.id = i;\n\n    zapTeamFlagToBase(team);\n  }\n\n  gotFlags = true;\n}\n\nvoid setTeamFlagPickup ( bz_eTeamType team, int player )\n{\n  if ( team == eRedTeam )\n    redFlag.caried = player;\n\n  if ( team == eGreenTeam  )\n    greenFlag.caried = player;\n\n  if ( team == eBlueTeam  )\n    blueFlag.caried = player;\n\n  if ( team == ePurpleTeam  )\n    purpleFlag.caried = player;\n}\n\nint getTeamFlagCarier ( bz_eTeamType team)\n{\n  if ( team == eRedTeam )\n    return redFlag.caried;\n\n  if ( team == eGreenTeam  )\n    return greenFlag.caried;\n\n  if ( team == eBlueTeam  )\n    return blueFlag.caried;\n\n  if ( team == ePurpleTeam  )\n    return purpleFlag.caried;\n\n  return -1;\n}\n\nvoid UnrealCTFEventHandler::process ( bz_EventData *eventData )\n{\n  if (!eventData)\n    return;\n\n  switch(eventData->eventType)\n  {\n    case bz_ePlayerJoinEvent: \/\/ just in case we loaded, noone was here, and we didn't check the flags\n      if (!gotFlags)\n\tcheckFlags();\n      break;\n\n    case bz_eAllowFlagGrabEvent:\n      {\n\tbz_AllowFlagGrabEventData_V1 *allowGrab = (bz_AllowFlagGrabEventData_V1*)eventData;\n\tbz_eTeamType flagTeam = teamFromFlag(allowGrab->flagID);\n\tif ( flagTeam == eNoTeam)\n\t  break;\n\n\tbz_eTeamType playerTeam = bz_getPlayerTeam(allowGrab->playerID);\n\tif (playerTeam == eRogueTeam || playerTeam == flagTeam)\n\t{\n\t  zapTeamFlagToBase(flagTeam);\n\t  allowGrab->allow = false;\n\t}\n\n      }\n      break;\n\n    case bz_eFlagGrabbedEvent:\n    {\n\tbz_FlagGrabbedEventData_V1 *grabbed = (bz_FlagGrabbedEventData_V1*)eventData;\n\tbz_eTeamType flagTeam = teamFromFlag(grabbed->flagID);\n\tif ( flagTeam == eNoTeam)\n\t  break;\n\n\tbz_eTeamType playerTeam = bz_getPlayerTeam(grabbed->playerID);\n\tif (playerTeam == eRogueTeam || playerTeam == flagTeam)\n\t  zapTeamFlagToBase(flagTeam);\n\telse\n\t  setTeamFlagPickup(flagTeam,grabbed->playerID);\n    }\n    break;\n\n    case bz_eAllowCTFCaptureEvent:\n      {\n\tbz_AllowCTFCaptureEventData_V1* CTFCap = (bz_AllowCTFCaptureEventData_V1*)eventData;\n\n\tCTFCap->killTeam = false;\n\t\n\t\/\/ only let them cap if there flag is not caried\n\tCTFCap->allow = getTeamFlagCarier(CTFCap->teamCapping) == -1;\n      }\n      break;\n\n    case bz_eWorldFinalized:\n      gotFlags = false;\n      checkFlags();\n      break;\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>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"ppapi\/shared_impl\/resource_tracker.h\"\n\n#include \"ppapi\/shared_impl\/id_assignment.h\"\n#include \"ppapi\/shared_impl\/resource.h\"\n\nnamespace ppapi {\n\nResourceTracker::ResourceTracker() : last_resource_value_(0) {\n}\n\nResourceTracker::~ResourceTracker() {\n}\n\nResource* ResourceTracker::GetResource(PP_Resource res) const {\n  ResourceMap::const_iterator i = live_resources_.find(res);\n  if (i == live_resources_.end())\n    return NULL;\n  return i->second.first;\n}\n\nvoid ResourceTracker::AddRefResource(PP_Resource res) {\n  DLOG_IF(ERROR, !CheckIdType(res, PP_ID_TYPE_RESOURCE))\n      << res << \" is not a PP_Resource.\";\n  ResourceMap::iterator i = live_resources_.find(res);\n  if (i == live_resources_.end())\n    return;\n\n  \/\/ Prevent overflow of refcount.\n  if (i->second.second ==\n      std::numeric_limits<ResourceAndRefCount::second_type>::max())\n    return;\n\n  \/\/ When we go from 0 to 1 plugin ref count, keep an additional \"real\" ref\n  \/\/ on its behalf.\n  if (i->second.second == 0)\n    i->second.first->AddRef();\n\n  i->second.second++;\n  return;\n}\n\nvoid ResourceTracker::ReleaseResource(PP_Resource res) {\n  DLOG_IF(ERROR, !CheckIdType(res, PP_ID_TYPE_RESOURCE))\n      << res << \" is not a PP_Resource.\";\n  ResourceMap::iterator i = live_resources_.find(res);\n  if (i == live_resources_.end())\n    return;\n\n  \/\/ Prevent underflow of refcount.\n  if (i->second.second == 0)\n    return;\n\n  i->second.second--;\n  if (i->second.second == 0) {\n    LastPluginRefWasDeleted(i->second.first);\n\n    \/\/ When we go from 1 to 0 plugin ref count, free the additional \"real\" ref\n    \/\/ on its behalf. THIS WILL MOST LIKELY RELEASE THE OBJECT AND REMOVE IT\n    \/\/ FROM OUR LIST.\n    i->second.first->Release();\n  }\n}\n\nvoid ResourceTracker::DidCreateInstance(PP_Instance instance) {\n  \/\/ Due to the infrastructure of some tests, the instance is registered\n  \/\/ twice in a few cases. It would be nice not to do that and assert here\n  \/\/ instead.\n  if (instance_map_.find(instance) != instance_map_.end())\n    return;\n  instance_map_[instance] = linked_ptr<InstanceData>(new InstanceData);\n}\n\nvoid ResourceTracker::DidDeleteInstance(PP_Instance instance) {\n  InstanceMap::iterator found_instance = instance_map_.find(instance);\n\n  \/\/ Due to the infrastructure of some tests, the instance is uyregistered\n  \/\/ twice in a few cases. It would be nice not to do that and assert here\n  \/\/ instead.\n  if (found_instance == instance_map_.end())\n    return;\n\n  InstanceData& data = *found_instance->second;\n\n  \/\/ Force release all plugin references to resources associated with the\n  \/\/ deleted instance. Make a copy since as we iterate through them, each one\n  \/\/ will remove itself from the tracking info individually.\n  ResourceSet to_delete = data.resources;\n  ResourceSet::iterator cur = to_delete.begin();\n  while (cur != to_delete.end()) {\n    \/\/ Note that it's remotely possible for the object to already be deleted\n    \/\/ from the live resources. One case is if a resource object is holding\n    \/\/ the last ref to another. When we release the first one, it will release\n    \/\/ the second one. So the second one will be gone when we eventually get\n    \/\/ to it.\n    ResourceMap::iterator found_resource = live_resources_.find(*cur);\n    if (found_resource != live_resources_.end()) {\n      Resource* resource = found_resource->second.first;\n      if (found_resource->second.second > 0) {\n        LastPluginRefWasDeleted(resource);\n        found_resource->second.second = 0;\n\n        \/\/ This will most likely delete the resource object and remove it\n        \/\/ from the live_resources_ list.\n        resource->Release();\n      }\n    }\n\n    cur++;\n  }\n\n  \/\/ In general the above pass will delete all the resources and there won't\n  \/\/ be any left in the map. However, if parts of the implementation are still\n  \/\/ holding on to internal refs, we need to tell them that the instance is\n  \/\/ gone.\n  to_delete = data.resources;\n  cur = to_delete.begin();\n  while (cur != to_delete.end()) {\n    ResourceMap::iterator found_resource = live_resources_.find(*cur);\n    if (found_resource != live_resources_.end())\n      found_resource->second.first->InstanceWasDeleted();\n    cur++;\n  }\n\n  instance_map_.erase(instance);\n}\n\nint ResourceTracker::GetLiveObjectsForInstance(PP_Instance instance) const {\n  InstanceMap::const_iterator found = instance_map_.find(instance);\n  if (found == instance_map_.end())\n    return 0;\n  return static_cast<int>(found->second->resources.size());\n}\n\nPP_Resource ResourceTracker::AddResource(Resource* object) {\n  \/\/ If the plugin manages to create too many resources, don't do crazy stuff.\n  if (last_resource_value_ == kMaxPPId)\n    return 0;\n\n  InstanceMap::iterator found = instance_map_.find(object->pp_instance());\n  if (found == instance_map_.end()) {\n    \/\/ If you hit this, it's likely somebody forgot to call DidCreateInstance,\n    \/\/ the resource was created with an invalid PP_Instance, or the renderer\n    \/\/ side tried to create a resource for a plugin that crashed.\n    NOTREACHED();\n    return 0;\n  }\n\n  PP_Resource new_id = MakeTypedId(++last_resource_value_, PP_ID_TYPE_RESOURCE);\n  found->second->resources.insert(new_id);\n\n  live_resources_[new_id] = ResourceAndRefCount(object, 0);\n  return new_id;\n}\n\nvoid ResourceTracker::RemoveResource(Resource* object) {\n  PP_Resource pp_resource = object->pp_resource();\n  if (object->pp_instance())\n    instance_map_[object->pp_instance()]->resources.erase(pp_resource);\n  live_resources_.erase(pp_resource);\n}\n\nvoid ResourceTracker::LastPluginRefWasDeleted(Resource* object) {\n  object->LastPluginRefWasDeleted();\n}\n\n}  \/\/ namespace ppapi\n<commit_msg>Fix a pepper plugin process crash which occurs if we receive input events for a deleted plugin. This could happen in the multi process plugin scenario where the renderer could send events for deleted plugins in the context of outgoing sync calls.<commit_after>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"ppapi\/shared_impl\/resource_tracker.h\"\n\n#include \"ppapi\/shared_impl\/id_assignment.h\"\n#include \"ppapi\/shared_impl\/resource.h\"\n\nnamespace ppapi {\n\nResourceTracker::ResourceTracker() : last_resource_value_(0) {\n}\n\nResourceTracker::~ResourceTracker() {\n}\n\nResource* ResourceTracker::GetResource(PP_Resource res) const {\n  ResourceMap::const_iterator i = live_resources_.find(res);\n  if (i == live_resources_.end())\n    return NULL;\n  return i->second.first;\n}\n\nvoid ResourceTracker::AddRefResource(PP_Resource res) {\n  DLOG_IF(ERROR, !CheckIdType(res, PP_ID_TYPE_RESOURCE))\n      << res << \" is not a PP_Resource.\";\n  ResourceMap::iterator i = live_resources_.find(res);\n  if (i == live_resources_.end())\n    return;\n\n  \/\/ Prevent overflow of refcount.\n  if (i->second.second ==\n      std::numeric_limits<ResourceAndRefCount::second_type>::max())\n    return;\n\n  \/\/ When we go from 0 to 1 plugin ref count, keep an additional \"real\" ref\n  \/\/ on its behalf.\n  if (i->second.second == 0)\n    i->second.first->AddRef();\n\n  i->second.second++;\n  return;\n}\n\nvoid ResourceTracker::ReleaseResource(PP_Resource res) {\n  DLOG_IF(ERROR, !CheckIdType(res, PP_ID_TYPE_RESOURCE))\n      << res << \" is not a PP_Resource.\";\n  ResourceMap::iterator i = live_resources_.find(res);\n  if (i == live_resources_.end())\n    return;\n\n  \/\/ Prevent underflow of refcount.\n  if (i->second.second == 0)\n    return;\n\n  i->second.second--;\n  if (i->second.second == 0) {\n    LastPluginRefWasDeleted(i->second.first);\n\n    \/\/ When we go from 1 to 0 plugin ref count, free the additional \"real\" ref\n    \/\/ on its behalf. THIS WILL MOST LIKELY RELEASE THE OBJECT AND REMOVE IT\n    \/\/ FROM OUR LIST.\n    i->second.first->Release();\n  }\n}\n\nvoid ResourceTracker::DidCreateInstance(PP_Instance instance) {\n  \/\/ Due to the infrastructure of some tests, the instance is registered\n  \/\/ twice in a few cases. It would be nice not to do that and assert here\n  \/\/ instead.\n  if (instance_map_.find(instance) != instance_map_.end())\n    return;\n  instance_map_[instance] = linked_ptr<InstanceData>(new InstanceData);\n}\n\nvoid ResourceTracker::DidDeleteInstance(PP_Instance instance) {\n  InstanceMap::iterator found_instance = instance_map_.find(instance);\n\n  \/\/ Due to the infrastructure of some tests, the instance is uyregistered\n  \/\/ twice in a few cases. It would be nice not to do that and assert here\n  \/\/ instead.\n  if (found_instance == instance_map_.end())\n    return;\n\n  InstanceData& data = *found_instance->second;\n\n  \/\/ Force release all plugin references to resources associated with the\n  \/\/ deleted instance. Make a copy since as we iterate through them, each one\n  \/\/ will remove itself from the tracking info individually.\n  ResourceSet to_delete = data.resources;\n  ResourceSet::iterator cur = to_delete.begin();\n  while (cur != to_delete.end()) {\n    \/\/ Note that it's remotely possible for the object to already be deleted\n    \/\/ from the live resources. One case is if a resource object is holding\n    \/\/ the last ref to another. When we release the first one, it will release\n    \/\/ the second one. So the second one will be gone when we eventually get\n    \/\/ to it.\n    ResourceMap::iterator found_resource = live_resources_.find(*cur);\n    if (found_resource != live_resources_.end()) {\n      Resource* resource = found_resource->second.first;\n      if (found_resource->second.second > 0) {\n        LastPluginRefWasDeleted(resource);\n        found_resource->second.second = 0;\n\n        \/\/ This will most likely delete the resource object and remove it\n        \/\/ from the live_resources_ list.\n        resource->Release();\n      }\n    }\n\n    cur++;\n  }\n\n  \/\/ In general the above pass will delete all the resources and there won't\n  \/\/ be any left in the map. However, if parts of the implementation are still\n  \/\/ holding on to internal refs, we need to tell them that the instance is\n  \/\/ gone.\n  to_delete = data.resources;\n  cur = to_delete.begin();\n  while (cur != to_delete.end()) {\n    ResourceMap::iterator found_resource = live_resources_.find(*cur);\n    if (found_resource != live_resources_.end())\n      found_resource->second.first->InstanceWasDeleted();\n    cur++;\n  }\n\n  instance_map_.erase(instance);\n}\n\nint ResourceTracker::GetLiveObjectsForInstance(PP_Instance instance) const {\n  InstanceMap::const_iterator found = instance_map_.find(instance);\n  if (found == instance_map_.end())\n    return 0;\n  return static_cast<int>(found->second->resources.size());\n}\n\nPP_Resource ResourceTracker::AddResource(Resource* object) {\n  \/\/ If the plugin manages to create too many resources, don't do crazy stuff.\n  if (last_resource_value_ == kMaxPPId)\n    return 0;\n\n  InstanceMap::iterator found = instance_map_.find(object->pp_instance());\n  if (found == instance_map_.end()) {\n    \/\/ If you hit this, it's likely somebody forgot to call DidCreateInstance,\n    \/\/ the resource was created with an invalid PP_Instance, or the renderer\n    \/\/ side tried to create a resource for a plugin that crashed\/exited. This\n    \/\/ could happen for OOP plugins where due to reentrancies in context of\n    \/\/ outgoing sync calls the renderer can send events after a plugin has\n    \/\/ exited.\n    DLOG(INFO) << \"Failed to find plugin instance in instance map\";\n    return 0;\n  }\n\n  PP_Resource new_id = MakeTypedId(++last_resource_value_, PP_ID_TYPE_RESOURCE);\n  found->second->resources.insert(new_id);\n\n  live_resources_[new_id] = ResourceAndRefCount(object, 0);\n  return new_id;\n}\n\nvoid ResourceTracker::RemoveResource(Resource* object) {\n  PP_Resource pp_resource = object->pp_resource();\n  InstanceMap::iterator found = instance_map_.find(object->pp_instance());\n  if (found != instance_map_.end())\n    instance_map_.erase(found);\n  live_resources_.erase(pp_resource);\n}\n\nvoid ResourceTracker::LastPluginRefWasDeleted(Resource* object) {\n  object->LastPluginRefWasDeleted();\n}\n\n}  \/\/ namespace ppapi\n<|endoftext|>"}
{"text":"<commit_before>\/*\n Copyright (C) 2012 by Ivan Safrin\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 \"PolycodeEditor.h\"\n\nextern PolycodeClipboard *globalClipboard;\n\nPolycodeEditorFactory::PolycodeEditorFactory() {\n\t\n}\n\nPolycodeEditorFactory::~PolycodeEditorFactory() {\n\t\n}\n\nbool PolycodeEditorFactory::canHandleExtension(String extension) {\n\tfor(int i=0; i < extensions.size(); i++) {\n\t\tif(extension == extensions[i])\n\t\t   return true;\n\t}\n\treturn false;\n}\n\nvoid PolycodeEditor::setFilePath(String newPath) {\n\tfilePath = newPath;\n}\n\nPolycodeEditor::PolycodeEditor(bool _isReadOnly) : ScreenEntity(), ClipboardProvider() {\n\tthis->_isReadOnly = _isReadOnly;\n\tenableScissor = true;\t\n\tprocessInputEvents = true;\n\t_hasChanges = false;\n\n\tCore *core = CoreServices::getInstance()->getCore();\n\t\n\tcore->addEventListener(this, Core::EVENT_COPY);\n\tcore->addEventListener(this, Core::EVENT_PASTE);\n}\n\nvoid PolycodeEditor::setHasChanges(bool newVal) {\n\tif(_hasChanges != newVal) {\n\t\t_hasChanges = newVal;\t\n\t\tdispatchEvent(new Event(), Event::CHANGE_EVENT);\n\t}\n}\n\nvoid PolycodeEditor::handleEvent(Event *event) {\n\tif(event->getDispatcher() == CoreServices::getInstance()->getCore()) {\n\t\tswitch(event->getEventCode()) {\n\n\t\t\t\/\/ Only copypaste of more complex IDE entities is handled here.\n\t\t\t\/\/ Pure text copy\/paste is handled in:\n\t\t\t\/\/ Modules\/Contents\/UI\/Source\/PolyUITextInput.cpp\n\t\t\tcase Core::EVENT_COPY:\n\t\t\t{\n\t\t\t\tvoid *data = NULL;\n\t\t\t\tString dataType = Copy(&data);\n\t\t\t\tif(data) {\n\t\t\t\t\tglobalClipboard->setData(data, dataType, this);\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\t\tcase Core::EVENT_PASTE:\n\t\t\t{\n\t\t\t\tif(globalClipboard->getData()) {\n\t\t\t\t\tPaste(globalClipboard->getData(), globalClipboard->getType());\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\nvoid PolycodeEditor::Resize(int x, int y) {\n\teditorSize = Vector2(x,y);\n\tVector2 pos = getScreenPosition();\n\tscissorBox.setRect(pos.x,pos.y, x, y);\t\n}\n\nPolycodeEditor::~PolycodeEditor() {\n\t\n}\n\n\n<commit_msg>Prevent editor from getting copy\/paste events if deactivated<commit_after>\/*\n Copyright (C) 2012 by Ivan Safrin\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 \"PolycodeEditor.h\"\n\nextern PolycodeClipboard *globalClipboard;\n\nPolycodeEditorFactory::PolycodeEditorFactory() {\n\t\n}\n\nPolycodeEditorFactory::~PolycodeEditorFactory() {\n\t\n}\n\nbool PolycodeEditorFactory::canHandleExtension(String extension) {\n\tfor(int i=0; i < extensions.size(); i++) {\n\t\tif(extension == extensions[i])\n\t\t   return true;\n\t}\n\treturn false;\n}\n\nvoid PolycodeEditor::setFilePath(String newPath) {\n\tfilePath = newPath;\n}\n\nPolycodeEditor::PolycodeEditor(bool _isReadOnly) : ScreenEntity(), ClipboardProvider() {\n\tthis->_isReadOnly = _isReadOnly;\n\tenableScissor = true;\t\n\tprocessInputEvents = true;\n\t_hasChanges = false;\n\n\tCore *core = CoreServices::getInstance()->getCore();\n\t\n\tcore->addEventListener(this, Core::EVENT_COPY);\n\tcore->addEventListener(this, Core::EVENT_PASTE);\n}\n\nvoid PolycodeEditor::setHasChanges(bool newVal) {\n\tif(_hasChanges != newVal) {\n\t\t_hasChanges = newVal;\t\n\t\tdispatchEvent(new Event(), Event::CHANGE_EVENT);\n\t}\n}\n\nvoid PolycodeEditor::handleEvent(Event *event) {\n\tif(event->getDispatcher() == CoreServices::getInstance()->getCore() && enabled) {\n\t\tswitch(event->getEventCode()) {\n\n\t\t\t\/\/ Only copypaste of more complex IDE entities is handled here.\n\t\t\t\/\/ Pure text copy\/paste is handled in:\n\t\t\t\/\/ Modules\/Contents\/UI\/Source\/PolyUITextInput.cpp\n\t\t\tcase Core::EVENT_COPY:\n\t\t\t{\n\t\t\t\tvoid *data = NULL;\n\t\t\t\tString dataType = Copy(&data);\n\t\t\t\tif(data) {\n\t\t\t\t\tglobalClipboard->setData(data, dataType, this);\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\t\tcase Core::EVENT_PASTE:\n\t\t\t{\n\t\t\t\tif(globalClipboard->getData()) {\n\t\t\t\t\tPaste(globalClipboard->getData(), globalClipboard->getType());\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\nvoid PolycodeEditor::Resize(int x, int y) {\n\teditorSize = Vector2(x,y);\n\tVector2 pos = getScreenPosition();\n\tscissorBox.setRect(pos.x,pos.y, x, y);\t\n}\n\nPolycodeEditor::~PolycodeEditor() {\n\t\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*=============================================================================\n\tCopyright (c) 2012-2013 Richard Otis\n\n    Distributed under the Boost Software License, Version 1.0. (See accompanying\n    file LICENSE_1_0.txt or copy at http:\/\/www.boost.org\/LICENSE_1_0.txt)\n=============================================================================*\/\n\n\/\/ definition for a function to find a naive starting point\n\n#include \"libgibbs\/include\/optimizer\/utils\/startingpoint_naive.hpp\"\n\nusing boost::multi_index_container;\nusing namespace boost::multi_index;\n\n\n\/\/ Set all site fractions to 1\/X, where X is the number of entered species in that sublattice\n\/\/ Set all phase fractions to 1\/Y, where Y is the number of entered phases\ntemplate <typename Y = int, typename T = double> std::map<Y,T> get_startingpoint_naive(const sublattice_set &total_view)  {\n\tstd::map<Y,T> retmap;\n\tboost::multi_index::index<sublattice_set,myindex>::type::const_iterator iter,end;\n\n\t\/\/ System structure iterators\n\titer = get<myindex>(total_view).begin();\n\tend = get<myindex>(total_view).end();\n\n\t\/\/ Iterate through the whole system\n\tfor (; iter != end; ++iter) {\n\t\tconst int sublindex = ((sublattice_set::const_iterator)iter)->index;\n\t\tconst Y opt_index = ((sublattice_set::const_iterator)iter)->opt_index;\n\t\tif (sublindex == -1) {\n\t\t\t\/\/ This is a phase fraction; count total number of entered phases\n\t\t\tconst size_t phasecount = total_view.get<myindex>().count(sublindex);\n\t\t\tretmap[opt_index] = (T)1 \/ (T)phasecount;\n\t\t}\n\t\telse {\n\t\t\tconst std::string phasename = ((sublattice_set::const_iterator)iter)->phase;\n\t\t\t\/\/ Count number of entered species in the current sublattice\n\t\t\tconst size_t speccount = total_view.get<phase_subl>().count(boost::make_tuple(phasename, sublindex));\n\t\t\tretmap[opt_index] = (T)1 \/ (T)speccount;\n\t\t}\n\t}\n\treturn retmap;\n}\n<commit_msg>explicit instantiation for template function<commit_after>\/*=============================================================================\n\tCopyright (c) 2012-2013 Richard Otis\n\n    Distributed under the Boost Software License, Version 1.0. (See accompanying\n    file LICENSE_1_0.txt or copy at http:\/\/www.boost.org\/LICENSE_1_0.txt)\n=============================================================================*\/\n\n\/\/ definition for a function to find a naive starting point\n\n#include \"libgibbs\/include\/optimizer\/utils\/startingpoint_naive.hpp\"\n\nusing boost::multi_index_container;\nusing namespace boost::multi_index;\n\n\n\/\/ Set all site fractions to 1\/X, where X is the number of entered species in that sublattice\n\/\/ Set all phase fractions to 1\/Y, where Y is the number of entered phases\ntemplate <typename Y = int, typename T = double> std::map<Y,T> get_startingpoint_naive(const sublattice_set &total_view)  {\n\tstd::map<Y,T> retmap;\n\tboost::multi_index::index<sublattice_set,myindex>::type::const_iterator iter,end;\n\n\t\/\/ System structure iterators\n\titer = get<myindex>(total_view).begin();\n\tend = get<myindex>(total_view).end();\n\n\t\/\/ Iterate through the whole system\n\tfor (; iter != end; ++iter) {\n\t\tconst int sublindex = ((sublattice_set::const_iterator)iter)->index;\n\t\tconst Y opt_index = ((sublattice_set::const_iterator)iter)->opt_index;\n\t\tif (sublindex == -1) {\n\t\t\t\/\/ This is a phase fraction; count total number of entered phases\n\t\t\tconst size_t phasecount = total_view.get<myindex>().count(sublindex);\n\t\t\tretmap[opt_index] = (T)1 \/ (T)phasecount;\n\t\t}\n\t\telse {\n\t\t\tconst std::string phasename = ((sublattice_set::const_iterator)iter)->phase;\n\t\t\t\/\/ Count number of entered species in the current sublattice\n\t\t\tconst size_t speccount = total_view.get<phase_subl>().count(boost::make_tuple(phasename, sublindex));\n\t\t\tretmap[opt_index] = (T)1 \/ (T)speccount;\n\t\t}\n\t}\n\treturn retmap;\n}\n\ntemplate std::map<int,double> get_startingpoint_naive(const sublattice_set &total_view); \/\/ explicit instantiation\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- X86TargetAsmInfo.cpp - X86 asm properties ---------------*- C++ -*-===\/\/\n\/\/\n\/\/                     The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file was developed by James M. Laskey and is distributed under the\n\/\/ University of Illinois Open Source License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file contains the declarations of the X86TargetAsmInfo properties.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"X86TargetAsmInfo.h\"\n#include \"X86TargetMachine.h\"\n#include \"X86Subtarget.h\"\n#include \"llvm\/DerivedTypes.h\"\n#include \"llvm\/InlineAsm.h\"\n#include \"llvm\/Instructions.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/ADT\/StringExtras.h\"\nusing namespace llvm;\n\nstatic const char* x86_asm_table[] = {\"{si}\", \"S\",\n                                      \"{di}\", \"D\",\n                                      \"{ax}\", \"a\",\n                                      \"{cx}\", \"c\",\n                                      \"{memory}\", \"memory\",\n                                      \"{flags}\", \"\",\n                                      \"{dirflag}\", \"\",\n                                      \"{fpsr}\", \"\",\n                                      \"{cc}\", \"cc\",\n                                      0,0};\n\nX86TargetAsmInfo::X86TargetAsmInfo(const X86TargetMachine &TM) {\n  const X86Subtarget *Subtarget = &TM.getSubtarget<X86Subtarget>();\n  \n  \/\/ FIXME - Should be simplified.\n\n  AsmTransCBE = x86_asm_table;\n  \n  switch (Subtarget->TargetType) {\n  case X86Subtarget::isDarwin:\n    AlignmentIsInBytes = false;\n    GlobalPrefix = \"_\";\n    if (!Subtarget->is64Bit())\n      Data64bitsDirective = 0;       \/\/ we can't emit a 64-bit unit\n    ZeroDirective = \"\\t.space\\t\";  \/\/ \".space N\" emits N zeros.\n    PrivateGlobalPrefix = \"L\";     \/\/ Marker for constant pool idxs\n    BSSSection = 0;                       \/\/ no BSS section.\n    ZeroFillDirective = \"\\t.zerofill\\t\";  \/\/ Uses .zerofill\n    ConstantPoolSection = \"\\t.const\\n\";\n    JumpTableDataSection = \"\\t.const\\n\";\n    CStringSection = \"\\t.cstring\";\n    FourByteConstantSection = \"\\t.literal4\\n\";\n    EightByteConstantSection = \"\\t.literal8\\n\";\n    if (Subtarget->is64Bit())\n      SixteenByteConstantSection = \"\\t.literal16\\n\";\n    ReadOnlySection = \"\\t.const\\n\";\n    LCOMMDirective = \"\\t.lcomm\\t\";\n    COMMDirectiveTakesAlignment = false;\n    HasDotTypeDotSizeDirective = false;\n    if (TM.getRelocationModel() == Reloc::Static) {\n      StaticCtorsSection = \".constructor\";\n      StaticDtorsSection = \".destructor\";\n    } else {\n      StaticCtorsSection = \".mod_init_func\";\n      StaticDtorsSection = \".mod_term_func\";\n    }\n    InlineAsmStart = \"# InlineAsm Start\";\n    InlineAsmEnd = \"# InlineAsm End\";\n    SetDirective = \"\\t.set\";\n    UsedDirective = \"\\t.no_dead_strip\\t\";\n    WeakRefDirective = \"\\t.weak_reference\\t\";\n    HiddenDirective = \"\\t.private_extern\\t\";\n    \n    \/\/ In non-PIC modes, emit a special label before jump tables so that the\n    \/\/ linker can perform more accurate dead code stripping.\n    if (TM.getRelocationModel() != Reloc::PIC_) {\n      \/\/ Emit a local label that is preserved until the linker runs.\n      JumpTableSpecialLabelPrefix = \"l\";\n    }\n    \n    NeedsSet = true;\n    DwarfAbbrevSection = \".section __DWARF,__debug_abbrev,regular,debug\";\n    DwarfInfoSection = \".section __DWARF,__debug_info,regular,debug\";\n    DwarfLineSection = \".section __DWARF,__debug_line,regular,debug\";\n    DwarfFrameSection = \".section __DWARF,__debug_frame,regular,debug\";\n    DwarfPubNamesSection = \".section __DWARF,__debug_pubnames,regular,debug\";\n    DwarfPubTypesSection = \".section __DWARF,__debug_pubtypes,regular,debug\";\n    DwarfStrSection = \".section __DWARF,__debug_str,regular,debug\";\n    DwarfLocSection = \".section __DWARF,__debug_loc,regular,debug\";\n    DwarfARangesSection = \".section __DWARF,__debug_aranges,regular,debug\";\n    DwarfRangesSection = \".section __DWARF,__debug_ranges,regular,debug\";\n    DwarfMacInfoSection = \".section __DWARF,__debug_macinfo,regular,debug\";\n    break;\n\n  case X86Subtarget::isELF:\n    \/\/ Set up DWARF directives\n    HasLEB128 = true;  \/\/ Target asm supports leb128 directives (little-endian)\n    AbsoluteSectionOffsets = true;\n    \/\/ bool HasLEB128; \/\/ Defaults to false.\n    \/\/ hasDotLoc - True if target asm supports .loc directives.\n    \/\/ bool HasDotLoc; \/\/ Defaults to false.\n    \/\/ HasDotFile - True if target asm supports .file directives.\n    \/\/ bool HasDotFile; \/\/ Defaults to false.\n    ReadOnlySection = \"\\t.section\\t.rodata\\n\";\n    PrivateGlobalPrefix = \".L\";\n    WeakRefDirective = \"\\t.weak\\t\";\n    DwarfRequiresFrameSection = false;\n    DwarfAbbrevSection =  \"\\t.section\\t.debug_abbrev,\\\"\\\",@progbits\";\n    DwarfInfoSection =    \"\\t.section\\t.debug_info,\\\"\\\",@progbits\";\n    DwarfLineSection =    \"\\t.section\\t.debug_line,\\\"\\\",@progbits\";\n    DwarfFrameSection =   \"\\t.section\\t.debug_frame,\\\"\\\",@progbits\";\n    DwarfPubNamesSection =\"\\t.section\\t.debug_pubnames,\\\"\\\",@progbits\";\n    DwarfPubTypesSection =\"\\t.section\\t.debug_pubtypes,\\\"\\\",@progbits\";\n    DwarfStrSection =     \"\\t.section\\t.debug_str,\\\"\\\",@progbits\";\n    DwarfLocSection =     \"\\t.section\\t.debug_loc,\\\"\\\",@progbits\";\n    DwarfARangesSection = \"\\t.section\\t.debug_aranges,\\\"\\\",@progbits\";\n    DwarfRangesSection =  \"\\t.section\\t.debug_ranges,\\\"\\\",@progbits\";\n    DwarfMacInfoSection = \"\\t.section\\t.debug_macinfo,\\\"\\\",@progbits\";\n    break;\n\n  case X86Subtarget::isCygwin:\n  case X86Subtarget::isMingw:\n    GlobalPrefix = \"_\";\n    LCOMMDirective = \"\\t.lcomm\\t\";\n    COMMDirectiveTakesAlignment = false;\n    HasDotTypeDotSizeDirective = false;\n    StaticCtorsSection = \"\\t.section .ctors,\\\"aw\\\"\";\n    StaticDtorsSection = \"\\t.section .dtors,\\\"aw\\\"\";\n    HiddenDirective = NULL;\n\n    \/\/ Set up DWARF directives\n    HasLEB128 = true;  \/\/ Target asm supports leb128 directives (little-endian)\n    AbsoluteSectionOffsets = true;\n    PrivateGlobalPrefix = \"L\";  \/\/ Prefix for private global symbols\n    WeakRefDirective = \"\\t.weak\\t\";\n    DwarfRequiresFrameSection = false;\n    DwarfSectionOffsetDirective = \"\\t.secrel32\\t\";\n    DwarfAbbrevSection =  \"\\t.section\\t.debug_abbrev,\\\"dr\\\"\";\n    DwarfInfoSection =    \"\\t.section\\t.debug_info,\\\"dr\\\"\";\n    DwarfLineSection =    \"\\t.section\\t.debug_line,\\\"dr\\\"\";\n    DwarfFrameSection =   \"\\t.section\\t.debug_frame,\\\"dr\\\"\";\n    DwarfPubNamesSection =\"\\t.section\\t.debug_pubnames,\\\"dr\\\"\";\n    DwarfPubTypesSection =\"\\t.section\\t.debug_pubtypes,\\\"dr\\\"\";\n    DwarfStrSection =     \"\\t.section\\t.debug_str,\\\"dr\\\"\";\n    DwarfLocSection =     \"\\t.section\\t.debug_loc,\\\"dr\\\"\";\n    DwarfARangesSection = \"\\t.section\\t.debug_aranges,\\\"dr\\\"\";\n    DwarfRangesSection =  \"\\t.section\\t.debug_ranges,\\\"dr\\\"\";\n    DwarfMacInfoSection = \"\\t.section\\t.debug_macinfo,\\\"dr\\\"\";\n    break;\n\n  case X86Subtarget::isWindows:\n    GlobalPrefix = \"_\";\n    HasDotTypeDotSizeDirective = false;\n    break;\n\n  default: break;\n  }\n  \n  if (Subtarget->isFlavorIntel()) {\n    GlobalPrefix = \"_\";\n    CommentString = \";\";\n  \n    PrivateGlobalPrefix = \"$\";\n    AlignDirective = \"\\talign\\t\";\n    ZeroDirective = \"\\tdb\\t\";\n    ZeroDirectiveSuffix = \" dup(0)\";\n    AsciiDirective = \"\\tdb\\t\";\n    AscizDirective = 0;\n    Data8bitsDirective = \"\\tdb\\t\";\n    Data16bitsDirective = \"\\tdw\\t\";\n    Data32bitsDirective = \"\\tdd\\t\";\n    Data64bitsDirective = \"\\tdq\\t\";\n    HasDotTypeDotSizeDirective = false;\n    \n    TextSection = \"_text\";\n    DataSection = \"_data\";\n    JumpTableDataSection = NULL;\n    SwitchToSectionDirective = \"\";\n    TextSectionStartSuffix = \"\\tsegment 'CODE'\";\n    DataSectionStartSuffix = \"\\tsegment 'DATA'\";\n    SectionEndDirectiveSuffix = \"\\tends\\n\";\n  }\n\n  AssemblerDialect = Subtarget->getAsmFlavor();\n}\n\nbool X86TargetAsmInfo::LowerToBSwap(CallInst *CI) const {\n  \/\/ FIXME: this should verify that we are targetting a 486 or better.  If not,\n  \/\/ we will turn this bswap into something that will be lowered to logical ops\n  \/\/ instead of emitting the bswap asm.  For now, we don't support 486 or lower\n  \/\/ so don't worry about this.\n  \n  \/\/ Verify this is a simple bswap.\n  if (CI->getNumOperands() != 2 ||\n      CI->getType() != CI->getOperand(1)->getType() ||\n      !CI->getType()->isInteger())\n    return false;\n  \n  const Type *Ty = CI->getType();\n  const char *IntName;\n  if (const IntegerType *ITy = dyn_cast<IntegerType>(Ty)) {\n    unsigned BitWidth = ITy->getBitWidth();\n    if (BitWidth == 16)\n      IntName = \"llvm.bswap.i16\";\n    else if (BitWidth == 32)\n      IntName = \"llvm.bswap.i32\";\n    else if (BitWidth == 64)\n      IntName = \"llvm.bswap.i64\";\n    else\n      return false;\n  } else\n    return false;\n\n  \/\/ Okay, we can do this xform, do so now.\n  Module *M = CI->getParent()->getParent()->getParent();\n  Constant *Int = M->getOrInsertFunction(IntName, Ty, Ty, (Type*)0);\n  \n  Value *Op = CI->getOperand(1);\n  Op = new CallInst(Int, Op, CI->getName(), CI);\n  \n  CI->replaceAllUsesWith(Op);\n  CI->eraseFromParent();\n  return true;\n}\n\n\nbool X86TargetAsmInfo::ExpandInlineAsm(CallInst *CI) const {\n  InlineAsm *IA = cast<InlineAsm>(CI->getCalledValue());\n  std::vector<InlineAsm::ConstraintInfo> Constraints = IA->ParseConstraints();\n  \n  std::string AsmStr = IA->getAsmString();\n  \n  \/\/ TODO: should remove alternatives from the asmstring: \"foo {a|b}\" -> \"foo a\"\n  std::vector<std::string> AsmPieces;\n  SplitString(AsmStr, AsmPieces, \"\\n\");  \/\/ ; as separator?\n  \n  switch (AsmPieces.size()) {\n  default: return false;    \n  case 1:\n    AsmStr = AsmPieces[0];\n    AsmPieces.clear();\n    SplitString(AsmStr, AsmPieces, \" \\t\");  \/\/ Split with whitespace.\n    \n    \/\/ bswap $0\n    if (AsmPieces.size() == 2 && \n        AsmPieces[0] == \"bswap\" && AsmPieces[1] == \"$0\") {\n      \/\/ No need to check constraints, nothing other than the equivalent of\n      \/\/ \"=r,0\" would be valid here.\n      return LowerToBSwap(CI);\n    }\n    break;\n  case 3:\n    if (CI->getType() == Type::Int64Ty && Constraints.size() >= 2 &&\n        Constraints[0].Codes.size() == 1 && Constraints[0].Codes[0] == \"A\" &&\n        Constraints[1].Codes.size() == 1 && Constraints[1].Codes[0] == \"0\") {\n      \/\/ bswap %eax \/ bswap %edx \/ xchgl %eax, %edx  -> llvm.bswap.i64\n      std::vector<std::string> Words;\n      SplitString(AsmPieces[0], Words, \" \\t\");\n      if (Words.size() == 2 && Words[0] == \"bswap\" && Words[1] == \"%eax\") {\n        Words.clear();\n        SplitString(AsmPieces[1], Words, \" \\t\");\n        if (Words.size() == 2 && Words[0] == \"bswap\" && Words[1] == \"%edx\") {\n          Words.clear();\n          SplitString(AsmPieces[2], Words, \" \\t,\");\n          if (Words.size() == 3 && Words[0] == \"xchgl\" && Words[1] == \"%eax\" &&\n              Words[2] == \"%edx\") {\n            return LowerToBSwap(CI);\n          }\n        }\n      }\n    }\n    break;\n  }\n  return false;\n}\n<commit_msg>fix breakage from last night, simplify code.<commit_after>\/\/===-- X86TargetAsmInfo.cpp - X86 asm properties ---------------*- C++ -*-===\/\/\n\/\/\n\/\/                     The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file was developed by James M. Laskey and is distributed under the\n\/\/ University of Illinois Open Source License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file contains the declarations of the X86TargetAsmInfo properties.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"X86TargetAsmInfo.h\"\n#include \"X86TargetMachine.h\"\n#include \"X86Subtarget.h\"\n#include \"llvm\/DerivedTypes.h\"\n#include \"llvm\/InlineAsm.h\"\n#include \"llvm\/Instructions.h\"\n#include \"llvm\/Intrinsics.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/ADT\/StringExtras.h\"\nusing namespace llvm;\n\nstatic const char* x86_asm_table[] = {\"{si}\", \"S\",\n                                      \"{di}\", \"D\",\n                                      \"{ax}\", \"a\",\n                                      \"{cx}\", \"c\",\n                                      \"{memory}\", \"memory\",\n                                      \"{flags}\", \"\",\n                                      \"{dirflag}\", \"\",\n                                      \"{fpsr}\", \"\",\n                                      \"{cc}\", \"cc\",\n                                      0,0};\n\nX86TargetAsmInfo::X86TargetAsmInfo(const X86TargetMachine &TM) {\n  const X86Subtarget *Subtarget = &TM.getSubtarget<X86Subtarget>();\n  \n  \/\/ FIXME - Should be simplified.\n\n  AsmTransCBE = x86_asm_table;\n  \n  switch (Subtarget->TargetType) {\n  case X86Subtarget::isDarwin:\n    AlignmentIsInBytes = false;\n    GlobalPrefix = \"_\";\n    if (!Subtarget->is64Bit())\n      Data64bitsDirective = 0;       \/\/ we can't emit a 64-bit unit\n    ZeroDirective = \"\\t.space\\t\";  \/\/ \".space N\" emits N zeros.\n    PrivateGlobalPrefix = \"L\";     \/\/ Marker for constant pool idxs\n    BSSSection = 0;                       \/\/ no BSS section.\n    ZeroFillDirective = \"\\t.zerofill\\t\";  \/\/ Uses .zerofill\n    ConstantPoolSection = \"\\t.const\\n\";\n    JumpTableDataSection = \"\\t.const\\n\";\n    CStringSection = \"\\t.cstring\";\n    FourByteConstantSection = \"\\t.literal4\\n\";\n    EightByteConstantSection = \"\\t.literal8\\n\";\n    if (Subtarget->is64Bit())\n      SixteenByteConstantSection = \"\\t.literal16\\n\";\n    ReadOnlySection = \"\\t.const\\n\";\n    LCOMMDirective = \"\\t.lcomm\\t\";\n    COMMDirectiveTakesAlignment = false;\n    HasDotTypeDotSizeDirective = false;\n    if (TM.getRelocationModel() == Reloc::Static) {\n      StaticCtorsSection = \".constructor\";\n      StaticDtorsSection = \".destructor\";\n    } else {\n      StaticCtorsSection = \".mod_init_func\";\n      StaticDtorsSection = \".mod_term_func\";\n    }\n    InlineAsmStart = \"# InlineAsm Start\";\n    InlineAsmEnd = \"# InlineAsm End\";\n    SetDirective = \"\\t.set\";\n    UsedDirective = \"\\t.no_dead_strip\\t\";\n    WeakRefDirective = \"\\t.weak_reference\\t\";\n    HiddenDirective = \"\\t.private_extern\\t\";\n    \n    \/\/ In non-PIC modes, emit a special label before jump tables so that the\n    \/\/ linker can perform more accurate dead code stripping.\n    if (TM.getRelocationModel() != Reloc::PIC_) {\n      \/\/ Emit a local label that is preserved until the linker runs.\n      JumpTableSpecialLabelPrefix = \"l\";\n    }\n    \n    NeedsSet = true;\n    DwarfAbbrevSection = \".section __DWARF,__debug_abbrev,regular,debug\";\n    DwarfInfoSection = \".section __DWARF,__debug_info,regular,debug\";\n    DwarfLineSection = \".section __DWARF,__debug_line,regular,debug\";\n    DwarfFrameSection = \".section __DWARF,__debug_frame,regular,debug\";\n    DwarfPubNamesSection = \".section __DWARF,__debug_pubnames,regular,debug\";\n    DwarfPubTypesSection = \".section __DWARF,__debug_pubtypes,regular,debug\";\n    DwarfStrSection = \".section __DWARF,__debug_str,regular,debug\";\n    DwarfLocSection = \".section __DWARF,__debug_loc,regular,debug\";\n    DwarfARangesSection = \".section __DWARF,__debug_aranges,regular,debug\";\n    DwarfRangesSection = \".section __DWARF,__debug_ranges,regular,debug\";\n    DwarfMacInfoSection = \".section __DWARF,__debug_macinfo,regular,debug\";\n    break;\n\n  case X86Subtarget::isELF:\n    \/\/ Set up DWARF directives\n    HasLEB128 = true;  \/\/ Target asm supports leb128 directives (little-endian)\n    AbsoluteSectionOffsets = true;\n    \/\/ bool HasLEB128; \/\/ Defaults to false.\n    \/\/ hasDotLoc - True if target asm supports .loc directives.\n    \/\/ bool HasDotLoc; \/\/ Defaults to false.\n    \/\/ HasDotFile - True if target asm supports .file directives.\n    \/\/ bool HasDotFile; \/\/ Defaults to false.\n    ReadOnlySection = \"\\t.section\\t.rodata\\n\";\n    PrivateGlobalPrefix = \".L\";\n    WeakRefDirective = \"\\t.weak\\t\";\n    DwarfRequiresFrameSection = false;\n    DwarfAbbrevSection =  \"\\t.section\\t.debug_abbrev,\\\"\\\",@progbits\";\n    DwarfInfoSection =    \"\\t.section\\t.debug_info,\\\"\\\",@progbits\";\n    DwarfLineSection =    \"\\t.section\\t.debug_line,\\\"\\\",@progbits\";\n    DwarfFrameSection =   \"\\t.section\\t.debug_frame,\\\"\\\",@progbits\";\n    DwarfPubNamesSection =\"\\t.section\\t.debug_pubnames,\\\"\\\",@progbits\";\n    DwarfPubTypesSection =\"\\t.section\\t.debug_pubtypes,\\\"\\\",@progbits\";\n    DwarfStrSection =     \"\\t.section\\t.debug_str,\\\"\\\",@progbits\";\n    DwarfLocSection =     \"\\t.section\\t.debug_loc,\\\"\\\",@progbits\";\n    DwarfARangesSection = \"\\t.section\\t.debug_aranges,\\\"\\\",@progbits\";\n    DwarfRangesSection =  \"\\t.section\\t.debug_ranges,\\\"\\\",@progbits\";\n    DwarfMacInfoSection = \"\\t.section\\t.debug_macinfo,\\\"\\\",@progbits\";\n    break;\n\n  case X86Subtarget::isCygwin:\n  case X86Subtarget::isMingw:\n    GlobalPrefix = \"_\";\n    LCOMMDirective = \"\\t.lcomm\\t\";\n    COMMDirectiveTakesAlignment = false;\n    HasDotTypeDotSizeDirective = false;\n    StaticCtorsSection = \"\\t.section .ctors,\\\"aw\\\"\";\n    StaticDtorsSection = \"\\t.section .dtors,\\\"aw\\\"\";\n    HiddenDirective = NULL;\n\n    \/\/ Set up DWARF directives\n    HasLEB128 = true;  \/\/ Target asm supports leb128 directives (little-endian)\n    AbsoluteSectionOffsets = true;\n    PrivateGlobalPrefix = \"L\";  \/\/ Prefix for private global symbols\n    WeakRefDirective = \"\\t.weak\\t\";\n    DwarfRequiresFrameSection = false;\n    DwarfSectionOffsetDirective = \"\\t.secrel32\\t\";\n    DwarfAbbrevSection =  \"\\t.section\\t.debug_abbrev,\\\"dr\\\"\";\n    DwarfInfoSection =    \"\\t.section\\t.debug_info,\\\"dr\\\"\";\n    DwarfLineSection =    \"\\t.section\\t.debug_line,\\\"dr\\\"\";\n    DwarfFrameSection =   \"\\t.section\\t.debug_frame,\\\"dr\\\"\";\n    DwarfPubNamesSection =\"\\t.section\\t.debug_pubnames,\\\"dr\\\"\";\n    DwarfPubTypesSection =\"\\t.section\\t.debug_pubtypes,\\\"dr\\\"\";\n    DwarfStrSection =     \"\\t.section\\t.debug_str,\\\"dr\\\"\";\n    DwarfLocSection =     \"\\t.section\\t.debug_loc,\\\"dr\\\"\";\n    DwarfARangesSection = \"\\t.section\\t.debug_aranges,\\\"dr\\\"\";\n    DwarfRangesSection =  \"\\t.section\\t.debug_ranges,\\\"dr\\\"\";\n    DwarfMacInfoSection = \"\\t.section\\t.debug_macinfo,\\\"dr\\\"\";\n    break;\n\n  case X86Subtarget::isWindows:\n    GlobalPrefix = \"_\";\n    HasDotTypeDotSizeDirective = false;\n    break;\n\n  default: break;\n  }\n  \n  if (Subtarget->isFlavorIntel()) {\n    GlobalPrefix = \"_\";\n    CommentString = \";\";\n  \n    PrivateGlobalPrefix = \"$\";\n    AlignDirective = \"\\talign\\t\";\n    ZeroDirective = \"\\tdb\\t\";\n    ZeroDirectiveSuffix = \" dup(0)\";\n    AsciiDirective = \"\\tdb\\t\";\n    AscizDirective = 0;\n    Data8bitsDirective = \"\\tdb\\t\";\n    Data16bitsDirective = \"\\tdw\\t\";\n    Data32bitsDirective = \"\\tdd\\t\";\n    Data64bitsDirective = \"\\tdq\\t\";\n    HasDotTypeDotSizeDirective = false;\n    \n    TextSection = \"_text\";\n    DataSection = \"_data\";\n    JumpTableDataSection = NULL;\n    SwitchToSectionDirective = \"\";\n    TextSectionStartSuffix = \"\\tsegment 'CODE'\";\n    DataSectionStartSuffix = \"\\tsegment 'DATA'\";\n    SectionEndDirectiveSuffix = \"\\tends\\n\";\n  }\n\n  AssemblerDialect = Subtarget->getAsmFlavor();\n}\n\nbool X86TargetAsmInfo::LowerToBSwap(CallInst *CI) const {\n  \/\/ FIXME: this should verify that we are targetting a 486 or better.  If not,\n  \/\/ we will turn this bswap into something that will be lowered to logical ops\n  \/\/ instead of emitting the bswap asm.  For now, we don't support 486 or lower\n  \/\/ so don't worry about this.\n  \n  \/\/ Verify this is a simple bswap.\n  if (CI->getNumOperands() != 2 ||\n      CI->getType() != CI->getOperand(1)->getType() ||\n      !CI->getType()->isInteger())\n    return false;\n  \n  const IntegerType *Ty = dyn_cast<IntegerType>(CI->getType());\n  if (!Ty || Ty->getBitWidth() % 16 != 0)\n    return false;\n  \n  \/\/ Okay, we can do this xform, do so now.\n  const Type *Tys[] = { Ty, Ty };\n  Module *M = CI->getParent()->getParent()->getParent();\n  Constant *Int = Intrinsic::getDeclaration(M, Intrinsic::bswap, Tys, 2);\n  \n  Value *Op = CI->getOperand(1);\n  Op = new CallInst(Int, Op, CI->getName(), CI);\n  \n  CI->replaceAllUsesWith(Op);\n  CI->eraseFromParent();\n  return true;\n}\n\n\nbool X86TargetAsmInfo::ExpandInlineAsm(CallInst *CI) const {\n  InlineAsm *IA = cast<InlineAsm>(CI->getCalledValue());\n  std::vector<InlineAsm::ConstraintInfo> Constraints = IA->ParseConstraints();\n  \n  std::string AsmStr = IA->getAsmString();\n  \n  \/\/ TODO: should remove alternatives from the asmstring: \"foo {a|b}\" -> \"foo a\"\n  std::vector<std::string> AsmPieces;\n  SplitString(AsmStr, AsmPieces, \"\\n\");  \/\/ ; as separator?\n  \n  switch (AsmPieces.size()) {\n  default: return false;    \n  case 1:\n    AsmStr = AsmPieces[0];\n    AsmPieces.clear();\n    SplitString(AsmStr, AsmPieces, \" \\t\");  \/\/ Split with whitespace.\n    \n    \/\/ bswap $0\n    if (AsmPieces.size() == 2 && \n        AsmPieces[0] == \"bswap\" && AsmPieces[1] == \"$0\") {\n      \/\/ No need to check constraints, nothing other than the equivalent of\n      \/\/ \"=r,0\" would be valid here.\n      return LowerToBSwap(CI);\n    }\n    break;\n  case 3:\n    if (CI->getType() == Type::Int64Ty && Constraints.size() >= 2 &&\n        Constraints[0].Codes.size() == 1 && Constraints[0].Codes[0] == \"A\" &&\n        Constraints[1].Codes.size() == 1 && Constraints[1].Codes[0] == \"0\") {\n      \/\/ bswap %eax \/ bswap %edx \/ xchgl %eax, %edx  -> llvm.bswap.i64\n      std::vector<std::string> Words;\n      SplitString(AsmPieces[0], Words, \" \\t\");\n      if (Words.size() == 2 && Words[0] == \"bswap\" && Words[1] == \"%eax\") {\n        Words.clear();\n        SplitString(AsmPieces[1], Words, \" \\t\");\n        if (Words.size() == 2 && Words[0] == \"bswap\" && Words[1] == \"%edx\") {\n          Words.clear();\n          SplitString(AsmPieces[2], Words, \" \\t,\");\n          if (Words.size() == 3 && Words[0] == \"xchgl\" && Words[1] == \"%eax\" &&\n              Words[2] == \"%edx\") {\n            return LowerToBSwap(CI);\n          }\n        }\n      }\n    }\n    break;\n  }\n  return false;\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"physics\/discrete_trajectory_iterator.hpp\"\n\n#include \"geometry\/named_quantities.hpp\"\n\nnamespace principia {\nnamespace physics {\nnamespace internal_discrete_trajectory_iterator {\n\nusing geometry::Instant;\n\ntemplate<typename Frame>\nDiscreteTrajectoryIterator<Frame>&\nDiscreteTrajectoryIterator<Frame>::operator++() {\n  CHECK(!is_at_end(point_));\n  auto& point = iterator(point_);\n  for (;;) {\n    if (point == --segment_->timeline_end()) {\n      ++segment_;\n      if (segment_ == segment_.end() || segment_->timeline_empty()) {\n        point_.reset();\n        break;\n      } else {\n        point = segment_->timeline_begin();\n      }\n    } else {\n      ++point;\n    }\n    if (point->first != previous_time_) {\n      previous_time_ = point->first;\n      break;\n    }\n  }\n  return *this;\n}\n\ntemplate<typename Frame>\nDiscreteTrajectoryIterator<Frame>&\nDiscreteTrajectoryIterator<Frame>::operator--() {\n  if (is_at_end(point_)) {\n    \/\/ Move the iterator to the end of the last segment and decrement it.\n    segment_ = --segment_.end();\n    point_ = segment_->timeline_end();\n  }\n  auto& point = iterator(point_);\n  for (;;) {\n    if (point == segment_->timeline_begin()) {\n      CHECK(segment_ != segment_.begin());\n      --segment_;\n      point = --segment_->timeline_end();\n    } else {\n      --point;\n    }\n    if (point->first != previous_time_) {\n      previous_time_ = point->first;\n      break;\n    }\n  }\n  return *this;\n}\n\ntemplate<typename Frame>\nDiscreteTrajectoryIterator<Frame>\nDiscreteTrajectoryIterator<Frame>::operator++(int) {  \/\/ NOLINT\n  auto const initial = *this;\n  ++*this;\n  return initial;\n}\n\ntemplate<typename Frame>\nDiscreteTrajectoryIterator<Frame>\nDiscreteTrajectoryIterator<Frame>::operator--(int) {  \/\/ NOLINT\n  auto const initial = *this;\n  --*this;\n  return initial;\n}\n\ntemplate<typename Frame>\ntypename internal_discrete_trajectory_types::Timeline<Frame>::value_type const&\nDiscreteTrajectoryIterator<Frame>::operator*() const {\n  CHECK(!is_at_end(point_));\n  return *iterator(point_);\n}\n\ntemplate<typename Frame>\ntypename internal_discrete_trajectory_types::Timeline<Frame>::value_type const*\nDiscreteTrajectoryIterator<Frame>::operator->() const {\n  CHECK(!is_at_end(point_));\n  return &*iterator(point_);\n}\n\ntemplate<typename Frame>\nbool DiscreteTrajectoryIterator<Frame>::operator==(\n    DiscreteTrajectoryIterator const& other) const {\n  if (is_at_end(point_)) {\n    return segment_ == other.segment_ && is_at_end(other.point_);\n  } else if (is_at_end(other.point_)) {\n    return false;\n  } else {\n    return iterator(point_)->first == iterator(other.point_)->first;\n  }\n}\n\ntemplate<typename Frame>\nbool DiscreteTrajectoryIterator<Frame>::operator!=(\n    DiscreteTrajectoryIterator const& other) const {\n  return !operator==(other);\n}\n\ntemplate<typename Frame>\nDiscreteTrajectoryIterator<Frame>::DiscreteTrajectoryIterator(\n    DiscreteTrajectorySegmentIterator<Frame> const segment,\n    OptionalTimelineConstIterator const point)\n    : segment_(segment),\n      point_(point) {\n  if (segment_->timeline_empty()) {\n    point_.reset();\n  }\n}\n\ntemplate<typename Frame>\nbool DiscreteTrajectoryIterator<Frame>::is_at_end(\n    OptionalTimelineConstIterator const point) {\n  return !point.has_value();\n}\n\ntemplate<typename Frame>\ntypename DiscreteTrajectoryIterator<Frame>::Timeline::const_iterator&\nDiscreteTrajectoryIterator<Frame>::iterator(\n    OptionalTimelineConstIterator& point) {\n  DCHECK(point.has_value());\n  return point.value();\n}\n\ntemplate<typename Frame>\ntypename DiscreteTrajectoryIterator<Frame>::Timeline::const_iterator const&\nDiscreteTrajectoryIterator<Frame>::iterator(\n    OptionalTimelineConstIterator const& point) {\n  DCHECK(point.has_value());\n  return point.value();\n}\n\n}  \/\/ namespace internal_discrete_trajectory_iterator\n}  \/\/ namespace physics\n}  \/\/ namespace principia\n<commit_msg>All tests passing.<commit_after>#pragma once\n\n#include \"physics\/discrete_trajectory_iterator.hpp\"\n\n#include \"geometry\/named_quantities.hpp\"\n\nnamespace principia {\nnamespace physics {\nnamespace internal_discrete_trajectory_iterator {\n\nusing geometry::Instant;\n\ntemplate<typename Frame>\nDiscreteTrajectoryIterator<Frame>&\nDiscreteTrajectoryIterator<Frame>::operator++() {\n  CHECK(!is_at_end(point_));\n  auto& point = iterator(point_);\n  for (;;) {\n    if (point == --segment_->timeline_end()) {\n      ++segment_;\n      if (segment_ == segment_.end() || segment_->timeline_empty()) {\n        point_.reset();\n        break;\n      } else {\n        point = segment_->timeline_begin();\n      }\n    } else {\n      ++point;\n    }\n    if (point->first != previous_time_) {\n      previous_time_ = point->first;\n      break;\n    }\n  }\n  return *this;\n}\n\ntemplate<typename Frame>\nDiscreteTrajectoryIterator<Frame>&\nDiscreteTrajectoryIterator<Frame>::operator--() {\n  if (is_at_end(point_)) {\n    \/\/ Move the iterator to the end of the last segment and decrement it.\n    segment_ = --segment_.end();\n    point_ = segment_->timeline_end();\n  }\n  auto& point = iterator(point_);\n  for (;;) {\n    if (point == segment_->timeline_begin()) {\n      CHECK(segment_ != segment_.begin());\n      --segment_;\n      point = --segment_->timeline_end();\n    } else {\n      --point;\n    }\n    if (point->first != previous_time_) {\n      previous_time_ = point->first;\n      break;\n    }\n  }\n  return *this;\n}\n\ntemplate<typename Frame>\nDiscreteTrajectoryIterator<Frame>\nDiscreteTrajectoryIterator<Frame>::operator++(int) {  \/\/ NOLINT\n  auto const initial = *this;\n  ++*this;\n  return initial;\n}\n\ntemplate<typename Frame>\nDiscreteTrajectoryIterator<Frame>\nDiscreteTrajectoryIterator<Frame>::operator--(int) {  \/\/ NOLINT\n  auto const initial = *this;\n  --*this;\n  return initial;\n}\n\ntemplate<typename Frame>\ntypename internal_discrete_trajectory_types::Timeline<Frame>::value_type const&\nDiscreteTrajectoryIterator<Frame>::operator*() const {\n  CHECK(!is_at_end(point_));\n  return *iterator(point_);\n}\n\ntemplate<typename Frame>\ntypename internal_discrete_trajectory_types::Timeline<Frame>::value_type const*\nDiscreteTrajectoryIterator<Frame>::operator->() const {\n  CHECK(!is_at_end(point_));\n  return &*iterator(point_);\n}\n\ntemplate<typename Frame>\nbool DiscreteTrajectoryIterator<Frame>::operator==(\n    DiscreteTrajectoryIterator const& other) const {\n  if (is_at_end(point_)) {\n    return segment_ == other.segment_ && is_at_end(other.point_);\n  } else if (is_at_end(other.point_)) {\n    return false;\n  } else {\n    return iterator(point_)->first == iterator(other.point_)->first;\n  }\n}\n\ntemplate<typename Frame>\nbool DiscreteTrajectoryIterator<Frame>::operator!=(\n    DiscreteTrajectoryIterator const& other) const {\n  return !operator==(other);\n}\n\ntemplate<typename Frame>\nDiscreteTrajectoryIterator<Frame>::DiscreteTrajectoryIterator(\n    DiscreteTrajectorySegmentIterator<Frame> const segment,\n    OptionalTimelineConstIterator const point)\n    : segment_(segment),\n      point_(point) {\n  if (segment_ == segment_.end() || segment_->timeline_empty()) {\n    point_.reset();\n  }\n}\n\ntemplate<typename Frame>\nbool DiscreteTrajectoryIterator<Frame>::is_at_end(\n    OptionalTimelineConstIterator const point) {\n  return !point.has_value();\n}\n\ntemplate<typename Frame>\ntypename DiscreteTrajectoryIterator<Frame>::Timeline::const_iterator&\nDiscreteTrajectoryIterator<Frame>::iterator(\n    OptionalTimelineConstIterator& point) {\n  DCHECK(point.has_value());\n  return point.value();\n}\n\ntemplate<typename Frame>\ntypename DiscreteTrajectoryIterator<Frame>::Timeline::const_iterator const&\nDiscreteTrajectoryIterator<Frame>::iterator(\n    OptionalTimelineConstIterator const& point) {\n  DCHECK(point.has_value());\n  return point.value();\n}\n\n}  \/\/ namespace internal_discrete_trajectory_iterator\n}  \/\/ namespace physics\n}  \/\/ namespace principia\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) Microsoft Corporation. All rights reserved.\n\/\/ Licensed under the MIT License.\n\n#include \"contrib_ops\/cpu\/non_max_suppression.h\"\n#include <queue>\n\nnamespace onnxruntime {\nnamespace contrib {\n\nONNX_CPU_OPERATOR_TYPED_MS_KERNEL(\n    NonMaxSuppression,\n    1,\n    float,\n    KernelDefBuilder()\n        .TypeConstraint(\"T1\", DataTypeImpl::GetTensorType<float>())\n        .TypeConstraint(\"T2\", DataTypeImpl::GetTensorType<int32_t>()),\n    NonMaxSuppression<float>);\n\ntemplate <typename T>\nvoid NonMaxSuppression<T>::MaxMin(const T& lhs, const T& rhs, T& min, T& max) const {\n  if (lhs >= rhs) {\n    min = rhs;\n    max = lhs;\n  } else {\n    min = lhs;\n    max = rhs;\n  }\n}\n\ntemplate <typename T>\nbool NonMaxSuppression<T>::SuppressByIOU(const T* boxes_data, int32_t box_index1, int32_t box_index2) const {\n  T x1_min, y1_min, x1_max, y1_max, x2_min, y2_min, x2_max, y2_max;\n  \/\/ boxes data [y1, x1, y2, x2],\n  MaxMin(boxes_data[4 * box_index1 + 1], boxes_data[4 * box_index1 + 3], x1_min, x1_max);\n  MaxMin(boxes_data[4 * box_index1 + 0], boxes_data[4 * box_index1 + 2], y1_min, y1_max);\n  MaxMin(boxes_data[4 * box_index2 + 1], boxes_data[4 * box_index2 + 3], x2_min, x2_max);\n  MaxMin(boxes_data[4 * box_index2 + 0], boxes_data[4 * box_index2 + 2], y2_min, y2_max);\n\n  const T intersection_x_min = std::max(x1_min, x2_min);\n  const T intersection_y_min = std::max(y1_min, y2_min);\n  const T intersection_x_max = std::min(x1_max, x2_max);\n  const T intersection_y_max = std::min(y1_max, y2_max);\n\n  const T intersection_area = std::max(intersection_x_max - intersection_x_min, static_cast<T>(0.0)) *\n                              std::max(intersection_y_max - intersection_y_min, static_cast<T>(0.0));\n\n  if (intersection_area <= static_cast<T>(0.0)) {\n    return false;\n  }\n\n  const T area1 = (x1_max - x1_min) * (y1_max - y1_min);\n  const T area2 = (x2_max - x2_min) * (y2_max - y2_min);\n  const T union_area = area1 + area2 - intersection_area;\n\n  if (area1 <= static_cast<T>(0.0) || area2 <= static_cast<T>(0.0) || union_area <= static_cast<T>(0.0)) {\n    return false;\n  }\n\n  const T intersection_over_union = intersection_area \/ union_area;\n\n  return intersection_over_union > iou_threshold_;\n}\n\ntemplate <typename T>\nStatus NonMaxSuppression<T>::Compute(OpKernelContext* ctx) const {\n  const Tensor* boxes = ctx->Input<Tensor>(0);\n  ORT_ENFORCE(boxes);\n  const Tensor* scores = ctx->Input<Tensor>(1);\n  ORT_ENFORCE(scores);\n\n  const TensorShape& boxes_shape = boxes->Shape();\n  auto boxes_dims = boxes_shape.GetDims();\n  ORT_RETURN_IF_NOT(boxes_shape.NumDimensions() == 2, \"boxes must be a 2D tensor.\");\n  int64_t num_boxes = boxes_dims[0];\n  ORT_RETURN_IF_NOT(boxes_dims[1] == 4, \"boxes shape must be a 2D tensor with shape [num_boxes, 4].\");\n\n  const TensorShape& scores_shape = scores->Shape();\n  ORT_RETURN_IF_NOT(scores_shape.NumDimensions() == 1, \"boxes must be a 1D tensor.\");\n  ORT_RETURN_IF_NOT(scores_shape.GetDims()[0] == num_boxes, \"scores and boxes should have same num_boxes.\");\n\n  if (max_output_size_ <= 0 || boxes_dims[0] == 0) {\n    TensorShape output_shape({0});\n    ctx->Output(0, output_shape);\n    return Status::OK();\n  }\n\n  const T* boxes_data = boxes->Data<T>();\n  const T* scores_data = scores->Data<T>();\n\n  struct ScoreIndexPair {\n    T score;\n    int32_t index;\n  };\n\n  auto LessCompare = [](const ScoreIndexPair& lhs, const ScoreIndexPair& rhs) {\n    return lhs.score < rhs.score;\n  };\n\n  \/\/ Filter by score_threshold_\n  std::priority_queue<ScoreIndexPair, std::deque<ScoreIndexPair>, decltype(LessCompare)> sorted_scores_with_index(LessCompare);\n  for (int32_t i = 0; i < num_boxes; ++i) {\n    if (static_cast<float>(scores_data[i]) > score_threshold_) {\n      sorted_scores_with_index.emplace(ScoreIndexPair({scores_data[i], i}));\n    }\n  }\n\n  int num_of_selected = 0;\n  std::vector<int32_t> selected_index(max_output_size_, 0);\n  ScoreIndexPair next_top_score;\n\n  \/\/ Get the next box with top score, filter by iou_threshold_\n  while (num_of_selected < max_output_size_ && !sorted_scores_with_index.empty()) {\n    next_top_score = sorted_scores_with_index.top();\n    sorted_scores_with_index.pop();\n\n    bool selected = true;\n    \/\/ Check with existing boxes, suppress if exceed the IOU (Intersection Over Union) threshold\n    for (int i = num_of_selected - 1; i >= 0; --i) {\n      if (SuppressByIOU(boxes_data, selected_index[i], next_top_score.index)) {\n        selected = false;\n        break;\n      }\n    }\n\n    if (selected) {\n      selected_index[num_of_selected] = next_top_score.index;\n      ++num_of_selected;\n    }\n  }\n\n  int64_t num_to_copy = pad_to_max_output_size_ == 1 ? max_output_size_ : num_of_selected;\n  TensorShape output_shape({num_to_copy});\n  Tensor* selected_indices = ctx->Output(0, output_shape);\n  auto output_data = selected_indices->MutableData<int32_t>();\n  memcpy(output_data, selected_index.data(), num_to_copy * sizeof(int32_t));\n\n  TensorShape valid_outputs_shape({1});\n  Tensor* valid_outputs = ctx->Output(1, valid_outputs_shape);\n  if (valid_outputs) {\n    valid_outputs->MutableData<int32_t>()[0] = num_of_selected;\n  }\n\n  return Status::OK();\n}\n\n}  \/\/ namespace contrib\n}  \/\/ namespace onnxruntime\n<commit_msg>Add tensorflow license (#296)<commit_after>\/* Copyright 2015 The TensorFlow Authors. All Rights Reserved.\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    http:\/\/www.apache.org\/licenses\/LICENSE-2.0\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\/* Modifications Copyright (c) Microsoft. *\/\n\n#include \"contrib_ops\/cpu\/non_max_suppression.h\"\n#include <queue>\n\nnamespace onnxruntime {\nnamespace contrib {\n\nONNX_CPU_OPERATOR_TYPED_MS_KERNEL(\n    NonMaxSuppression,\n    1,\n    float,\n    KernelDefBuilder()\n        .TypeConstraint(\"T1\", DataTypeImpl::GetTensorType<float>())\n        .TypeConstraint(\"T2\", DataTypeImpl::GetTensorType<int32_t>()),\n    NonMaxSuppression<float>);\n\ntemplate <typename T>\nvoid NonMaxSuppression<T>::MaxMin(const T& lhs, const T& rhs, T& min, T& max) const {\n  if (lhs >= rhs) {\n    min = rhs;\n    max = lhs;\n  } else {\n    min = lhs;\n    max = rhs;\n  }\n}\n\ntemplate <typename T>\nbool NonMaxSuppression<T>::SuppressByIOU(const T* boxes_data, int32_t box_index1, int32_t box_index2) const {\n  T x1_min, y1_min, x1_max, y1_max, x2_min, y2_min, x2_max, y2_max;\n  \/\/ boxes data [y1, x1, y2, x2],\n  MaxMin(boxes_data[4 * box_index1 + 1], boxes_data[4 * box_index1 + 3], x1_min, x1_max);\n  MaxMin(boxes_data[4 * box_index1 + 0], boxes_data[4 * box_index1 + 2], y1_min, y1_max);\n  MaxMin(boxes_data[4 * box_index2 + 1], boxes_data[4 * box_index2 + 3], x2_min, x2_max);\n  MaxMin(boxes_data[4 * box_index2 + 0], boxes_data[4 * box_index2 + 2], y2_min, y2_max);\n\n  const T intersection_x_min = std::max(x1_min, x2_min);\n  const T intersection_y_min = std::max(y1_min, y2_min);\n  const T intersection_x_max = std::min(x1_max, x2_max);\n  const T intersection_y_max = std::min(y1_max, y2_max);\n\n  const T intersection_area = std::max(intersection_x_max - intersection_x_min, static_cast<T>(0.0)) *\n                              std::max(intersection_y_max - intersection_y_min, static_cast<T>(0.0));\n\n  if (intersection_area <= static_cast<T>(0.0)) {\n    return false;\n  }\n\n  const T area1 = (x1_max - x1_min) * (y1_max - y1_min);\n  const T area2 = (x2_max - x2_min) * (y2_max - y2_min);\n  const T union_area = area1 + area2 - intersection_area;\n\n  if (area1 <= static_cast<T>(0.0) || area2 <= static_cast<T>(0.0) || union_area <= static_cast<T>(0.0)) {\n    return false;\n  }\n\n  const T intersection_over_union = intersection_area \/ union_area;\n\n  return intersection_over_union > iou_threshold_;\n}\n\ntemplate <typename T>\nStatus NonMaxSuppression<T>::Compute(OpKernelContext* ctx) const {\n  const Tensor* boxes = ctx->Input<Tensor>(0);\n  ORT_ENFORCE(boxes);\n  const Tensor* scores = ctx->Input<Tensor>(1);\n  ORT_ENFORCE(scores);\n\n  const TensorShape& boxes_shape = boxes->Shape();\n  auto boxes_dims = boxes_shape.GetDims();\n  ORT_RETURN_IF_NOT(boxes_shape.NumDimensions() == 2, \"boxes must be a 2D tensor.\");\n  int64_t num_boxes = boxes_dims[0];\n  ORT_RETURN_IF_NOT(boxes_dims[1] == 4, \"boxes shape must be a 2D tensor with shape [num_boxes, 4].\");\n\n  const TensorShape& scores_shape = scores->Shape();\n  ORT_RETURN_IF_NOT(scores_shape.NumDimensions() == 1, \"boxes must be a 1D tensor.\");\n  ORT_RETURN_IF_NOT(scores_shape.GetDims()[0] == num_boxes, \"scores and boxes should have same num_boxes.\");\n\n  if (max_output_size_ <= 0 || boxes_dims[0] == 0) {\n    TensorShape output_shape({0});\n    ctx->Output(0, output_shape);\n    return Status::OK();\n  }\n\n  const T* boxes_data = boxes->Data<T>();\n  const T* scores_data = scores->Data<T>();\n\n  struct ScoreIndexPair {\n    T score;\n    int32_t index;\n  };\n\n  auto LessCompare = [](const ScoreIndexPair& lhs, const ScoreIndexPair& rhs) {\n    return lhs.score < rhs.score;\n  };\n\n  \/\/ Filter by score_threshold_\n  std::priority_queue<ScoreIndexPair, std::deque<ScoreIndexPair>, decltype(LessCompare)> sorted_scores_with_index(LessCompare);\n  for (int32_t i = 0; i < num_boxes; ++i) {\n    if (static_cast<float>(scores_data[i]) > score_threshold_) {\n      sorted_scores_with_index.emplace(ScoreIndexPair({scores_data[i], i}));\n    }\n  }\n\n  int num_of_selected = 0;\n  std::vector<int32_t> selected_index(max_output_size_, 0);\n  ScoreIndexPair next_top_score;\n\n  \/\/ Get the next box with top score, filter by iou_threshold_\n  while (num_of_selected < max_output_size_ && !sorted_scores_with_index.empty()) {\n    next_top_score = sorted_scores_with_index.top();\n    sorted_scores_with_index.pop();\n\n    bool selected = true;\n    \/\/ Check with existing boxes, suppress if exceed the IOU (Intersection Over Union) threshold\n    for (int i = num_of_selected - 1; i >= 0; --i) {\n      if (SuppressByIOU(boxes_data, selected_index[i], next_top_score.index)) {\n        selected = false;\n        break;\n      }\n    }\n\n    if (selected) {\n      selected_index[num_of_selected] = next_top_score.index;\n      ++num_of_selected;\n    }\n  }\n\n  int64_t num_to_copy = pad_to_max_output_size_ == 1 ? max_output_size_ : num_of_selected;\n  TensorShape output_shape({num_to_copy});\n  Tensor* selected_indices = ctx->Output(0, output_shape);\n  auto output_data = selected_indices->MutableData<int32_t>();\n  memcpy(output_data, selected_index.data(), num_to_copy * sizeof(int32_t));\n\n  TensorShape valid_outputs_shape({1});\n  Tensor* valid_outputs = ctx->Output(1, valid_outputs_shape);\n  if (valid_outputs) {\n    valid_outputs->MutableData<int32_t>()[0] = num_of_selected;\n  }\n\n  return Status::OK();\n}\n\n}  \/\/ namespace contrib\n}  \/\/ namespace onnxruntime\n<|endoftext|>"}
{"text":"<commit_before>#include \"jobwidget.h\"\n#include \"debug.h\"\n#include \"restoredialog.h\"\n#include \"utils.h\"\n\n#include \"ui_jobwidget.h\"\n\n#include <QMenu>\n#include <QMessageBox>\n\n#include <TSettings.h>\n\nJobWidget::JobWidget(QWidget *parent)\n    : QWidget(parent), _ui(new Ui::JobWidget), _saveEnabled(false)\n{\n    _ui->setupUi(this);\n    _ui->archiveListWidget->setAttribute(Qt::WA_MacShowFocusRect, false);\n    _ui->infoLabel->hide();\n    updateUi();\n\n    _fsEventUpdate.setSingleShot(true);\n    connect(&_fsEventUpdate, &QTimer::timeout, this, &JobWidget::verifyJob);\n    connect(_ui->infoLabel, &ElidedLabel::clicked, this,\n            &JobWidget::showJobPathsWarn);\n    connect(_ui->jobNameLineEdit, &QLineEdit::textChanged,\n            [&]() { emit enableSave(canSaveNew()); });\n    connect(_ui->jobTreeWidget, &FilePickerWidget::selectionChanged, [&]() {\n        if(_job->objectKey().isEmpty())\n            emit enableSave(canSaveNew());\n        else\n            save();\n    });\n    connect(_ui->jobTreeWidget, &FilePickerWidget::settingChanged, [&]() {\n        if(!_job->objectKey().isEmpty())\n            save();\n    });\n\n    connect(_ui->scheduleComboBox, static_cast<void (QComboBox::*)(int)>(\n                                       &QComboBox::currentIndexChanged),\n            this, &JobWidget::save);\n    connect(_ui->preservePathsCheckBox, &QCheckBox::toggled, this,\n            &JobWidget::save);\n    connect(_ui->traverseMountCheckBox, &QCheckBox::toggled, this,\n            &JobWidget::save);\n    connect(_ui->followSymLinksCheckBox, &QCheckBox::toggled, this,\n            &JobWidget::save);\n    connect(_ui->skipNoDumpCheckBox, &QCheckBox::toggled, this,\n            &JobWidget::save);\n    connect(_ui->skipFilesSizeSpinBox, &QSpinBox::editingFinished, this,\n            &JobWidget::save);\n    connect(_ui->skipFilesCheckBox, &QCheckBox::toggled, this, &JobWidget::save);\n    connect(_ui->skipFilesLineEdit, &QLineEdit::editingFinished, this,\n            &JobWidget::save);\n    connect(_ui->hideButton, &QPushButton::clicked, this, &JobWidget::collapse);\n    connect(_ui->restoreButton, &QPushButton::clicked, this,\n            &JobWidget::restoreButtonClicked);\n    connect(_ui->backupButton, &QPushButton::clicked, this,\n            &JobWidget::backupButtonClicked);\n    connect(_ui->archiveListWidget, &ArchiveListWidget::inspectArchive, this,\n            &JobWidget::inspectJobArchive);\n    connect(_ui->archiveListWidget, &ArchiveListWidget::inspectArchive,\n            _ui->archiveListWidget, &ArchiveListWidget::selectArchive);\n    connect(_ui->archiveListWidget, &ArchiveListWidget::restoreArchive, this,\n            &JobWidget::restoreJobArchive);\n    connect(_ui->archiveListWidget, &ArchiveListWidget::deleteArchives, this,\n            &JobWidget::deleteJobArchives);\n    connect(_ui->skipFilesDefaultsButton, &QPushButton::clicked, [&]() {\n        TSettings settings;\n        _ui->skipFilesLineEdit->setText(\n            settings.value(\"app\/skip_system_files\", DEFAULT_SKIP_SYSTEM_FILES)\n                .toString());\n    });\n    connect(_ui->archiveListWidget,\n            &ArchiveListWidget::customContextMenuRequested, this,\n            &JobWidget::showArchiveListMenu);\n    connect(_ui->actionDelete, &QAction::triggered, _ui->archiveListWidget,\n            &ArchiveListWidget::deleteSelectedItems);\n    connect(_ui->actionRestore, &QAction::triggered, _ui->archiveListWidget,\n            &ArchiveListWidget::restoreSelectedItem);\n    connect(_ui->actionInspect, &QAction::triggered, _ui->archiveListWidget,\n            &ArchiveListWidget::inspectSelectedItem);\n}\n\nJobWidget::~JobWidget()\n{\n    delete _ui;\n}\n\nJobPtr JobWidget::job() const\n{\n    return _job;\n}\n\nvoid JobWidget::setJob(const JobPtr &job)\n{\n    if(_job)\n    {\n        _job->removeWatcher();\n        disconnect(_job.data(), &Job::fsEvent, this,\n                   &JobWidget::fsEventReceived);\n        disconnect(_job.data(), &Job::changed, this, &JobWidget::updateDetails);\n        disconnect(_job.data(), &Job::purged, this, &JobWidget::collapse);\n    }\n\n    _saveEnabled = false;\n    _job         = job;\n\n    \/\/ Creating a new job?\n    if(_job->objectKey().isEmpty())\n    {\n        _ui->restoreButton->hide();\n        _ui->backupButton->hide();\n        _ui->infoLabel->hide();\n        _ui->jobNameLabel->hide();\n        _ui->jobNameLineEdit->setText(_job->name());\n        _ui->jobNameLineEdit->show();\n        _ui->jobNameLineEdit->setFocus();\n    }\n    else\n    {\n        _ui->restoreButton->show();\n        _ui->backupButton->show();\n        _ui->jobNameLabel->show();\n        _ui->jobNameLineEdit->hide();\n        connect(_job.data(), &Job::changed, this, &JobWidget::updateDetails);\n        connect(_job.data(), &Job::fsEvent, this, &JobWidget::fsEventReceived);\n        connect(_job.data(), &Job::purged, this, &JobWidget::collapse);\n        job->installWatcher();\n    }\n    _ui->tabWidget->setCurrentWidget(_ui->jobTreeTab);\n    updateDetails();\n    _saveEnabled = true;\n}\n\nvoid JobWidget::save()\n{\n    if(_saveEnabled && !_job->name().isEmpty())\n    {\n        DEBUG << \"SAVE JOB\";\n        _job->setUrls(_ui->jobTreeWidget->getSelectedUrls());\n        _job->removeWatcher();\n        _job->installWatcher();\n        _job->setOptionScheduledEnabled(\n            static_cast<JobSchedule>(_ui->scheduleComboBox->currentIndex()));\n        _job->setOptionPreservePaths(_ui->preservePathsCheckBox->isChecked());\n        _job->setOptionTraverseMount(_ui->traverseMountCheckBox->isChecked());\n        _job->setOptionFollowSymLinks(_ui->followSymLinksCheckBox->isChecked());\n        _job->setOptionSkipNoDump(_ui->skipNoDumpCheckBox->isChecked());\n        _job->setOptionSkipFilesSize(_ui->skipFilesSizeSpinBox->value());\n        _job->setOptionSkipFiles(_ui->skipFilesCheckBox->isChecked());\n        _job->setOptionSkipFilesPatterns(_ui->skipFilesLineEdit->text());\n        _job->setSettingShowHidden(_ui->jobTreeWidget->settingShowHidden());\n        _job->setSettingShowSystem(_ui->jobTreeWidget->settingShowSystem());\n        _job->setSettingHideSymlinks(_ui->jobTreeWidget->settingHideSymlinks());\n        _job->save();\n        verifyJob();\n    }\n}\n\nvoid JobWidget::saveNew()\n{\n    if(!canSaveNew())\n        return;\n\n    DEBUG << \"SAVE NEW JOB\";\n    _job->setName(_ui->jobNameLineEdit->text());\n    if(!_job->archives().isEmpty())\n    {\n        QMessageBox::StandardButton confirm =\n            QMessageBox::question(this, \"Add job\",\n                                  tr(\"Assign %1 found archives to this Job?\")\n                                      .arg(_job->archives().count()),\n                                  QMessageBox::Yes | QMessageBox::No,\n                                  QMessageBox::No);\n        QList<ArchivePtr> empty;\n        if(confirm == QMessageBox::No)\n            _job->setArchives(empty);\n    }\n    save();\n    for(const ArchivePtr &archive : _job->archives())\n    {\n        archive->setJobRef(_job->objectKey());\n        archive->save();\n    }\n    emit jobAdded(_job);\n}\n\nvoid JobWidget::updateMatchingArchives(QList<ArchivePtr> archives)\n{\n    if(!archives.isEmpty())\n    {\n        _ui->infoLabel->setStyleSheet(\"\");\n        _ui->infoLabel->setText(tr(\"Found %1 unassigned archives matching this\"\n                                   \" Job description. Go to Archives tab below\"\n                                   \" to review.\")\n                                    .arg(archives.count()));\n        _ui->infoLabel->show();\n        _ui->tabWidget->setTabEnabled(_ui->tabWidget->indexOf(\n                                          _ui->archiveListTab),\n                                      true);\n    }\n    else\n    {\n        _ui->tabWidget->setTabEnabled(_ui->tabWidget->indexOf(\n                                          _ui->archiveListTab),\n                                      false);\n    }\n    _job->setArchives(archives);\n    _ui->archiveListWidget->setArchives(_job->archives());\n    _ui->tabWidget->setTabText(_ui->tabWidget->indexOf(_ui->archiveListTab),\n                               tr(\"Archives (%1)\").arg(_job->archives().count()));\n}\n\nvoid JobWidget::changeEvent(QEvent *event)\n{\n    if(event->type() == QEvent::LanguageChange)\n    {\n        _ui->retranslateUi(this);\n        updateUi();\n        if(_job)\n        {\n            if(_job->objectKey().isEmpty())\n                canSaveNew();\n            else\n                updateDetails();\n        }\n    }\n    QWidget::changeEvent(event);\n}\n\nvoid JobWidget::updateDetails()\n{\n    if(!_job)\n        return;\n    DEBUG << \"UPDATE JOB DETAILS\";\n    _saveEnabled = false;\n    _ui->jobNameLabel->setText(_job->name());\n    _ui->jobTreeWidget->setSettingShowHidden(_job->settingShowHidden());\n    _ui->jobTreeWidget->setSettingShowSystem(_job->settingShowSystem());\n    _ui->jobTreeWidget->setSettingHideSymlinks(_job->settingHideSymlinks());\n    _ui->jobTreeWidget->blockSignals(true);\n    _ui->jobTreeWidget->setSelectedUrls(_job->urls());\n    _ui->jobTreeWidget->blockSignals(false);\n    _ui->archiveListWidget->setArchives(_job->archives());\n    _ui->scheduleComboBox->setCurrentIndex(\n        static_cast<int>(_job->optionScheduledEnabled()));\n    _ui->preservePathsCheckBox->setChecked(_job->optionPreservePaths());\n    _ui->traverseMountCheckBox->setChecked(_job->optionTraverseMount());\n    _ui->followSymLinksCheckBox->setChecked(_job->optionFollowSymLinks());\n    _ui->skipNoDumpCheckBox->setChecked(_job->optionSkipNoDump());\n    _ui->skipFilesSizeSpinBox->setValue(_job->optionSkipFilesSize());\n    _ui->skipFilesCheckBox->setChecked(_job->optionSkipFiles());\n    _ui->skipFilesLineEdit->setText(_job->optionSkipFilesPatterns());\n    _ui->tabWidget->setTabEnabled(_ui->tabWidget->indexOf(_ui->archiveListTab),\n                                  _job->archives().count());\n    _ui->tabWidget->setTabText(_ui->tabWidget->indexOf(_ui->archiveListTab),\n                               tr(\"Archives (%1)\").arg(_job->archives().count()));\n    verifyJob();\n    _saveEnabled = true;\n}\n\nvoid JobWidget::restoreButtonClicked()\n{\n    if(_job && !_job->archives().isEmpty())\n    {\n        ArchivePtr     archive       = _job->archives().first();\n        RestoreDialog *restoreDialog = new RestoreDialog(this, archive);\n        restoreDialog->show();\n        connect(restoreDialog, &RestoreDialog::accepted, [=] {\n            emit restoreJobArchive(restoreDialog->archive(),\n                                   restoreDialog->getOptions());\n        });\n    }\n}\n\nvoid JobWidget::backupButtonClicked()\n{\n    if(_job)\n        emit backupJob(_job);\n}\n\nbool JobWidget::canSaveNew()\n{\n    _ui->infoLabel->setStyleSheet(\"\");\n    _ui->infoLabel->clear();\n    _ui->infoLabel->hide();\n    if(_job->objectKey().isEmpty() && !_ui->jobNameLineEdit->text().isEmpty())\n    {\n        JobPtr newJob(new Job);\n        newJob->setName(_ui->jobNameLineEdit->text());\n        if(!newJob->doesKeyExist(newJob->name()))\n        {\n            emit findMatchingArchives(newJob->archivePrefix());\n            if(!_ui->jobTreeWidget->getSelectedUrls().isEmpty())\n            {\n                return true;\n            }\n            else\n            {\n                _ui->infoLabel->setStyleSheet(\"#infoLabel { color: darkred; }\");\n                _ui->infoLabel->setText(tr(\"No backup paths selected.\"));\n                _ui->infoLabel->show();\n            }\n        }\n        else\n        {\n            _ui->infoLabel->setStyleSheet(\"#infoLabel { color: darkred; }\");\n            _ui->infoLabel->setText(\n                tr(\"Job name must be unique amongst existing\"\n                   \" Jobs.\"));\n            _ui->infoLabel->show();\n        }\n    }\n    return false;\n}\n\nvoid JobWidget::showArchiveListMenu(const QPoint &pos)\n{\n    QPoint globalPos = _ui->archiveListWidget->viewport()->mapToGlobal(pos);\n    QMenu  archiveListMenu(_ui->archiveListWidget);\n    if(!_ui->archiveListWidget->selectedItems().isEmpty())\n    {\n        if(_ui->archiveListWidget->selectedItems().count() == 1)\n        {\n            archiveListMenu.addAction(_ui->actionInspect);\n            archiveListMenu.addAction(_ui->actionRestore);\n        }\n        archiveListMenu.addAction(_ui->actionDelete);\n    }\n    archiveListMenu.exec(globalPos);\n}\n\nvoid JobWidget::fsEventReceived()\n{\n    _fsEventUpdate.start(250); \/\/ coalesce update events with a 250ms time delay\n}\n\nvoid JobWidget::showJobPathsWarn()\n{\n    if(_job->urls().isEmpty())\n        return;\n    QMessageBox *msg = new QMessageBox(this);\n    msg->setAttribute(Qt::WA_DeleteOnClose, true);\n    msg->setText(tr(\"Previously selected backup paths for this Job are not\"\n                    \" accessible anymore and thus backups may be incomplete.\"\n                    \" Mount missing drives or make a new selection. Press Show\"\n                    \" details to list all backup paths for Job %1:\")\n                     .arg(_job->name()));\n    QStringList urls;\n    for(const QUrl &url : _job->urls())\n        urls << url.toLocalFile();\n    msg->setDetailedText(urls.join('\\n'));\n    msg->show();\n}\n\nvoid JobWidget::verifyJob()\n{\n    if(_job->objectKey().isEmpty())\n        return;\n\n    _ui->jobTreeWidget->blockSignals(true);\n    _ui->jobTreeWidget->setSelectedUrls(_job->urls());\n    _ui->jobTreeWidget->blockSignals(false);\n\n    bool validUrls = _job->validateUrls();\n    _ui->infoLabel->setVisible(!validUrls);\n    if(!validUrls)\n    {\n        if(_job->urls().isEmpty())\n        {\n            _ui->infoLabel->setStyleSheet(\"#infoLabel { color: darkred; }\");\n            _ui->infoLabel->setText(tr(\"This Job has no backup paths selected. \"\n                                       \"Please make a selection.\"));\n        }\n        else\n        {\n            _ui->infoLabel->setText(\n                tr(\"Previously selected backup paths are not\"\n                   \" accessible. Click here for details.\"));\n        }\n    }\n}\n\nvoid JobWidget::updateUi()\n{\n    _ui->hideButton->setToolTip(_ui->hideButton->toolTip().arg(\n        QKeySequence(Qt::Key_Escape).toString(QKeySequence::NativeText)));\n}\n<commit_msg>JobWidget: fix morphBackupToJob<commit_after>#include \"jobwidget.h\"\n#include \"debug.h\"\n#include \"restoredialog.h\"\n#include \"utils.h\"\n\n#include \"ui_jobwidget.h\"\n\n#include <QMenu>\n#include <QMessageBox>\n\n#include <TSettings.h>\n\nJobWidget::JobWidget(QWidget *parent)\n    : QWidget(parent), _ui(new Ui::JobWidget), _saveEnabled(false)\n{\n    _ui->setupUi(this);\n    _ui->archiveListWidget->setAttribute(Qt::WA_MacShowFocusRect, false);\n    _ui->infoLabel->hide();\n    updateUi();\n\n    _fsEventUpdate.setSingleShot(true);\n    connect(&_fsEventUpdate, &QTimer::timeout, this, &JobWidget::verifyJob);\n    connect(_ui->infoLabel, &ElidedLabel::clicked, this,\n            &JobWidget::showJobPathsWarn);\n    connect(_ui->jobNameLineEdit, &QLineEdit::textChanged,\n            [&]() { emit enableSave(canSaveNew()); });\n    connect(_ui->jobTreeWidget, &FilePickerWidget::selectionChanged, [&]() {\n        if(_job->objectKey().isEmpty())\n            emit enableSave(canSaveNew());\n        else\n            save();\n    });\n    connect(_ui->jobTreeWidget, &FilePickerWidget::settingChanged, [&]() {\n        if(!_job->objectKey().isEmpty())\n            save();\n    });\n\n    connect(_ui->scheduleComboBox, static_cast<void (QComboBox::*)(int)>(\n                                       &QComboBox::currentIndexChanged),\n            this, &JobWidget::save);\n    connect(_ui->preservePathsCheckBox, &QCheckBox::toggled, this,\n            &JobWidget::save);\n    connect(_ui->traverseMountCheckBox, &QCheckBox::toggled, this,\n            &JobWidget::save);\n    connect(_ui->followSymLinksCheckBox, &QCheckBox::toggled, this,\n            &JobWidget::save);\n    connect(_ui->skipNoDumpCheckBox, &QCheckBox::toggled, this,\n            &JobWidget::save);\n    connect(_ui->skipFilesSizeSpinBox, &QSpinBox::editingFinished, this,\n            &JobWidget::save);\n    connect(_ui->skipFilesCheckBox, &QCheckBox::toggled, this, &JobWidget::save);\n    connect(_ui->skipFilesLineEdit, &QLineEdit::editingFinished, this,\n            &JobWidget::save);\n    connect(_ui->hideButton, &QPushButton::clicked, this, &JobWidget::collapse);\n    connect(_ui->restoreButton, &QPushButton::clicked, this,\n            &JobWidget::restoreButtonClicked);\n    connect(_ui->backupButton, &QPushButton::clicked, this,\n            &JobWidget::backupButtonClicked);\n    connect(_ui->archiveListWidget, &ArchiveListWidget::inspectArchive, this,\n            &JobWidget::inspectJobArchive);\n    connect(_ui->archiveListWidget, &ArchiveListWidget::inspectArchive,\n            _ui->archiveListWidget, &ArchiveListWidget::selectArchive);\n    connect(_ui->archiveListWidget, &ArchiveListWidget::restoreArchive, this,\n            &JobWidget::restoreJobArchive);\n    connect(_ui->archiveListWidget, &ArchiveListWidget::deleteArchives, this,\n            &JobWidget::deleteJobArchives);\n    connect(_ui->skipFilesDefaultsButton, &QPushButton::clicked, [&]() {\n        TSettings settings;\n        _ui->skipFilesLineEdit->setText(\n            settings.value(\"app\/skip_system_files\", DEFAULT_SKIP_SYSTEM_FILES)\n                .toString());\n    });\n    connect(_ui->archiveListWidget,\n            &ArchiveListWidget::customContextMenuRequested, this,\n            &JobWidget::showArchiveListMenu);\n    connect(_ui->actionDelete, &QAction::triggered, _ui->archiveListWidget,\n            &ArchiveListWidget::deleteSelectedItems);\n    connect(_ui->actionRestore, &QAction::triggered, _ui->archiveListWidget,\n            &ArchiveListWidget::restoreSelectedItem);\n    connect(_ui->actionInspect, &QAction::triggered, _ui->archiveListWidget,\n            &ArchiveListWidget::inspectSelectedItem);\n}\n\nJobWidget::~JobWidget()\n{\n    delete _ui;\n}\n\nJobPtr JobWidget::job() const\n{\n    return _job;\n}\n\nvoid JobWidget::setJob(const JobPtr &job)\n{\n    if(_job)\n    {\n        _job->removeWatcher();\n        disconnect(_job.data(), &Job::fsEvent, this,\n                   &JobWidget::fsEventReceived);\n        disconnect(_job.data(), &Job::changed, this, &JobWidget::updateDetails);\n        disconnect(_job.data(), &Job::purged, this, &JobWidget::collapse);\n    }\n\n    _saveEnabled = false;\n    _job         = job;\n\n    \/\/ Creating a new job?\n    if(_job->objectKey().isEmpty())\n    {\n        _ui->restoreButton->hide();\n        _ui->backupButton->hide();\n        _ui->infoLabel->hide();\n        _ui->jobNameLabel->hide();\n        _ui->jobNameLineEdit->setText(_job->name());\n        _ui->jobNameLineEdit->show();\n        _ui->jobNameLineEdit->setFocus();\n    }\n    else\n    {\n        _ui->restoreButton->show();\n        _ui->backupButton->show();\n        _ui->jobNameLabel->show();\n        _ui->jobNameLineEdit->hide();\n        connect(_job.data(), &Job::changed, this, &JobWidget::updateDetails);\n        connect(_job.data(), &Job::fsEvent, this, &JobWidget::fsEventReceived);\n        connect(_job.data(), &Job::purged, this, &JobWidget::collapse);\n        job->installWatcher();\n    }\n    _ui->tabWidget->setCurrentWidget(_ui->jobTreeTab);\n    updateDetails();\n    _saveEnabled = true;\n}\n\nvoid JobWidget::save()\n{\n    if(_saveEnabled && !_job->name().isEmpty())\n    {\n        DEBUG << \"SAVE JOB\";\n        _job->setUrls(_ui->jobTreeWidget->getSelectedUrls());\n        _job->removeWatcher();\n        _job->installWatcher();\n        _job->setOptionScheduledEnabled(\n            static_cast<JobSchedule>(_ui->scheduleComboBox->currentIndex()));\n        _job->setOptionPreservePaths(_ui->preservePathsCheckBox->isChecked());\n        _job->setOptionTraverseMount(_ui->traverseMountCheckBox->isChecked());\n        _job->setOptionFollowSymLinks(_ui->followSymLinksCheckBox->isChecked());\n        _job->setOptionSkipNoDump(_ui->skipNoDumpCheckBox->isChecked());\n        _job->setOptionSkipFilesSize(_ui->skipFilesSizeSpinBox->value());\n        _job->setOptionSkipFiles(_ui->skipFilesCheckBox->isChecked());\n        _job->setOptionSkipFilesPatterns(_ui->skipFilesLineEdit->text());\n        _job->setSettingShowHidden(_ui->jobTreeWidget->settingShowHidden());\n        _job->setSettingShowSystem(_ui->jobTreeWidget->settingShowSystem());\n        _job->setSettingHideSymlinks(_ui->jobTreeWidget->settingHideSymlinks());\n        _job->save();\n        verifyJob();\n    }\n}\n\nvoid JobWidget::saveNew()\n{\n    if(!canSaveNew())\n        return;\n\n    DEBUG << \"SAVE NEW JOB\";\n    _job->setName(_ui->jobNameLineEdit->text());\n    if(!_job->archives().isEmpty())\n    {\n        QMessageBox::StandardButton confirm =\n            QMessageBox::question(this, \"Add job\",\n                                  tr(\"Assign %1 found archives to this Job?\")\n                                      .arg(_job->archives().count()),\n                                  QMessageBox::Yes | QMessageBox::No,\n                                  QMessageBox::No);\n        QList<ArchivePtr> empty;\n        if(confirm == QMessageBox::No)\n            _job->setArchives(empty);\n    }\n    save();\n    for(const ArchivePtr &archive : _job->archives())\n    {\n        archive->setJobRef(_job->objectKey());\n        archive->save();\n    }\n    emit jobAdded(_job);\n}\n\nvoid JobWidget::updateMatchingArchives(QList<ArchivePtr> archives)\n{\n    if(!archives.isEmpty())\n    {\n        _ui->infoLabel->setStyleSheet(\"\");\n        _ui->infoLabel->setText(tr(\"Found %1 unassigned archives matching this\"\n                                   \" Job description. Go to Archives tab below\"\n                                   \" to review.\")\n                                    .arg(archives.count()));\n        _ui->infoLabel->show();\n        _ui->tabWidget->setTabEnabled(_ui->tabWidget->indexOf(\n                                          _ui->archiveListTab),\n                                      true);\n    }\n    else\n    {\n        _ui->tabWidget->setTabEnabled(_ui->tabWidget->indexOf(\n                                          _ui->archiveListTab),\n                                      false);\n    }\n    _job->setArchives(archives);\n    _ui->archiveListWidget->setArchives(_job->archives());\n    _ui->tabWidget->setTabText(_ui->tabWidget->indexOf(_ui->archiveListTab),\n                               tr(\"Archives (%1)\").arg(_job->archives().count()));\n}\n\nvoid JobWidget::changeEvent(QEvent *event)\n{\n    if(event->type() == QEvent::LanguageChange)\n    {\n        _ui->retranslateUi(this);\n        updateUi();\n        if(_job)\n        {\n            if(_job->objectKey().isEmpty())\n                canSaveNew();\n            else\n                updateDetails();\n        }\n    }\n    QWidget::changeEvent(event);\n}\n\nvoid JobWidget::updateDetails()\n{\n    if(!_job)\n        return;\n    DEBUG << \"UPDATE JOB DETAILS\";\n    _saveEnabled = false;\n    _ui->jobNameLabel->setText(_job->name());\n    _ui->jobTreeWidget->setSettingShowHidden(_job->settingShowHidden());\n    _ui->jobTreeWidget->setSettingShowSystem(_job->settingShowSystem());\n    _ui->jobTreeWidget->setSettingHideSymlinks(_job->settingHideSymlinks());\n    _ui->jobTreeWidget->blockSignals(true);\n    _ui->jobTreeWidget->setSelectedUrls(_job->urls());\n    _ui->jobTreeWidget->blockSignals(false);\n    _ui->archiveListWidget->setArchives(_job->archives());\n    _ui->scheduleComboBox->setCurrentIndex(\n        static_cast<int>(_job->optionScheduledEnabled()));\n    _ui->preservePathsCheckBox->setChecked(_job->optionPreservePaths());\n    _ui->traverseMountCheckBox->setChecked(_job->optionTraverseMount());\n    _ui->followSymLinksCheckBox->setChecked(_job->optionFollowSymLinks());\n    _ui->skipNoDumpCheckBox->setChecked(_job->optionSkipNoDump());\n    _ui->skipFilesSizeSpinBox->setValue(_job->optionSkipFilesSize());\n    _ui->skipFilesCheckBox->setChecked(_job->optionSkipFiles());\n    _ui->skipFilesLineEdit->setText(_job->optionSkipFilesPatterns());\n    _ui->tabWidget->setTabEnabled(_ui->tabWidget->indexOf(_ui->archiveListTab),\n                                  _job->archives().count());\n    _ui->tabWidget->setTabText(_ui->tabWidget->indexOf(_ui->archiveListTab),\n                               tr(\"Archives (%1)\").arg(_job->archives().count()));\n    verifyJob();\n    _saveEnabled = true;\n\n    \/\/ Needed when morphing a job from the Backup tab to Jobs tab.  There's\n    \/\/ probably a better way of doing this.\n    canSaveNew();\n}\n\nvoid JobWidget::restoreButtonClicked()\n{\n    if(_job && !_job->archives().isEmpty())\n    {\n        ArchivePtr     archive       = _job->archives().first();\n        RestoreDialog *restoreDialog = new RestoreDialog(this, archive);\n        restoreDialog->show();\n        connect(restoreDialog, &RestoreDialog::accepted, [=] {\n            emit restoreJobArchive(restoreDialog->archive(),\n                                   restoreDialog->getOptions());\n        });\n    }\n}\n\nvoid JobWidget::backupButtonClicked()\n{\n    if(_job)\n        emit backupJob(_job);\n}\n\nbool JobWidget::canSaveNew()\n{\n    _ui->infoLabel->setStyleSheet(\"\");\n    _ui->infoLabel->clear();\n    _ui->infoLabel->hide();\n    if(_job->objectKey().isEmpty() && !_ui->jobNameLineEdit->text().isEmpty())\n    {\n        JobPtr newJob(new Job);\n        newJob->setName(_ui->jobNameLineEdit->text());\n        if(!newJob->doesKeyExist(newJob->name()))\n        {\n            emit findMatchingArchives(newJob->archivePrefix());\n            if(!_ui->jobTreeWidget->getSelectedUrls().isEmpty())\n            {\n                return true;\n            }\n            else\n            {\n                _ui->infoLabel->setStyleSheet(\"#infoLabel { color: darkred; }\");\n                _ui->infoLabel->setText(tr(\"No backup paths selected.\"));\n                _ui->infoLabel->show();\n            }\n        }\n        else\n        {\n            _ui->infoLabel->setStyleSheet(\"#infoLabel { color: darkred; }\");\n            _ui->infoLabel->setText(\n                tr(\"Job name must be unique amongst existing\"\n                   \" Jobs.\"));\n            _ui->infoLabel->show();\n        }\n    }\n    return false;\n}\n\nvoid JobWidget::showArchiveListMenu(const QPoint &pos)\n{\n    QPoint globalPos = _ui->archiveListWidget->viewport()->mapToGlobal(pos);\n    QMenu  archiveListMenu(_ui->archiveListWidget);\n    if(!_ui->archiveListWidget->selectedItems().isEmpty())\n    {\n        if(_ui->archiveListWidget->selectedItems().count() == 1)\n        {\n            archiveListMenu.addAction(_ui->actionInspect);\n            archiveListMenu.addAction(_ui->actionRestore);\n        }\n        archiveListMenu.addAction(_ui->actionDelete);\n    }\n    archiveListMenu.exec(globalPos);\n}\n\nvoid JobWidget::fsEventReceived()\n{\n    _fsEventUpdate.start(250); \/\/ coalesce update events with a 250ms time delay\n}\n\nvoid JobWidget::showJobPathsWarn()\n{\n    if(_job->urls().isEmpty())\n        return;\n    QMessageBox *msg = new QMessageBox(this);\n    msg->setAttribute(Qt::WA_DeleteOnClose, true);\n    msg->setText(tr(\"Previously selected backup paths for this Job are not\"\n                    \" accessible anymore and thus backups may be incomplete.\"\n                    \" Mount missing drives or make a new selection. Press Show\"\n                    \" details to list all backup paths for Job %1:\")\n                     .arg(_job->name()));\n    QStringList urls;\n    for(const QUrl &url : _job->urls())\n        urls << url.toLocalFile();\n    msg->setDetailedText(urls.join('\\n'));\n    msg->show();\n}\n\nvoid JobWidget::verifyJob()\n{\n    if(_job->objectKey().isEmpty())\n        return;\n\n    _ui->jobTreeWidget->blockSignals(true);\n    _ui->jobTreeWidget->setSelectedUrls(_job->urls());\n    _ui->jobTreeWidget->blockSignals(false);\n\n    bool validUrls = _job->validateUrls();\n    _ui->infoLabel->setVisible(!validUrls);\n    if(!validUrls)\n    {\n        if(_job->urls().isEmpty())\n        {\n            _ui->infoLabel->setStyleSheet(\"#infoLabel { color: darkred; }\");\n            _ui->infoLabel->setText(tr(\"This Job has no backup paths selected. \"\n                                       \"Please make a selection.\"));\n        }\n        else\n        {\n            _ui->infoLabel->setText(\n                tr(\"Previously selected backup paths are not\"\n                   \" accessible. Click here for details.\"));\n        }\n    }\n}\n\nvoid JobWidget::updateUi()\n{\n    _ui->hideButton->setToolTip(_ui->hideButton->toolTip().arg(\n        QKeySequence(Qt::Key_Escape).toString(QKeySequence::NativeText)));\n}\n<|endoftext|>"}
{"text":"<commit_before>\/** @file\n    @brief Implementation\n\n    @date 2014\n\n    @author\n    Sensics, Inc.\n    <http:\/\/sensics.com\/osvr>\n*\/\n\n\/\/ Copyright 2014 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 \"DevicesWithParameters.h\"\n#include \"GetSerialPortState.h\"\n#include <osvr\/VRPNServer\/VRPNDeviceRegistration.h>\n#include <osvr\/USBSerial\/USBSerialEnum.h>\n\n\/\/ Library\/third-party includes\n#include <json\/reader.h>\n#include <json\/value.h>\n\n#include <vrpn_YEI_3Space.h>\n\n\/\/ Standard includes\n#include <vector>\n#include <memory>\n#include <string>\n#include <string.h>\n\nnamespace {\n\/\/\/ @brief Manage an array of dynamically allocated c-strings, terminated with a\n\/\/\/ null entry.\nclass CStringArray : boost::noncopyable {\n  public:\n    typedef std::unique_ptr<char[]> UniqueCharArray;\n    void push_back(std::string const &str) {\n        \/\/ Remove null terminator from array\n        if (m_arrayHasNullTerminator()) {\n            m_data.pop_back();\n        }\n        {\n            const size_t stringLength = str.size() + 1;\n            UniqueCharArray copy(new char[stringLength]);\n            memcpy(copy.get(), str.c_str(), stringLength);\n            m_dataOwnership.push_back(std::move(copy));\n        }\n        m_data.push_back(m_dataOwnership.back().get());\n    }\n    const char **get_array() {\n        \/\/ Ensure null terminator on array\n        if (!m_arrayHasNullTerminator()) {\n            m_data.push_back(nullptr);\n        }\n        return m_data.data();\n    }\n\n  private:\n    bool m_arrayHasNullTerminator() const {\n        return !m_data.empty() && nullptr == m_data.back();\n    }\n    std::vector<const char *> m_data;\n    std::vector<UniqueCharArray> m_dataOwnership;\n};\n} \/\/ namespace\n\nvoid createYEI(VRPNMultiserverData &data, OSVR_PluginRegContext ctx,\n               const char *params) {\n    Json::Reader reader;\n    Json::Value root;\n    if (!reader.parse(params, root)) {\n        throw std::runtime_error(\"Could not parse configuration: \" +\n                                 reader.getFormattedErrorMessages());\n    }\n    static const uint16_t vID = 0x9AC;\n    static const uint16_t pID = 0x3F2;\n    for (auto dev : osvr::usbserial::Enumerator(vID, pID)) {\n\n        std::string port = normalizeAndVerifySerialPort(dev->getPort());\n\n        bool calibrate_gyros_on_setup =\n            root.get(\"calibrateGyrosOnSetup\", false).asBool();\n        bool tare_on_setup = root.get(\"tareOnSetup\", false).asBool();\n        double frames_per_second = root.get(\"framesPerSecond\", 250).asFloat();\n\n        Json::Value commands = root.get(\"resetCommands\", Json::arrayValue);\n        CStringArray reset_commands;\n\n        for (Json::ArrayIndex i = 0, e = commands.size(); i < e; ++i) {\n            reset_commands.push_back(commands[i].asString());\n        }\n\n        osvr::vrpnserver::VRPNDeviceRegistration reg(ctx);\n\n        reg.registerDevice(new vrpn_YEI_3Space_Sensor(\n            reg.useDecoratedName(data.getName(\"YEI_3Space_Sensor\")).c_str(),\n            reg.getVRPNConnection(), port.c_str(), 115200,\n            calibrate_gyros_on_setup, tare_on_setup, frames_per_second, 0, 0, 1,\n            0, reset_commands.get_array()));\n    }\n}\n<commit_msg>Automatically add the \"use q-comp filter\" command to the start of the reset commands for YEI<commit_after>\/** @file\n    @brief Implementation\n\n    @date 2014\n\n    @author\n    Sensics, Inc.\n    <http:\/\/sensics.com\/osvr>\n*\/\n\n\/\/ Copyright 2014 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 \"DevicesWithParameters.h\"\n#include \"GetSerialPortState.h\"\n#include <osvr\/VRPNServer\/VRPNDeviceRegistration.h>\n#include <osvr\/USBSerial\/USBSerialEnum.h>\n\n\/\/ Library\/third-party includes\n#include <json\/reader.h>\n#include <json\/value.h>\n\n#include <vrpn_YEI_3Space.h>\n\n\/\/ Standard includes\n#include <vector>\n#include <memory>\n#include <string>\n#include <string.h>\n\nnamespace {\n\/\/\/ @brief Manage an array of dynamically allocated c-strings, terminated with a\n\/\/\/ null entry.\nclass CStringArray : boost::noncopyable {\n  public:\n    typedef std::unique_ptr<char[]> UniqueCharArray;\n    void push_back(std::string const &str) {\n        \/\/ Remove null terminator from array\n        if (m_arrayHasNullTerminator()) {\n            m_data.pop_back();\n        }\n        {\n            const size_t stringLength = str.size() + 1;\n            UniqueCharArray copy(new char[stringLength]);\n            memcpy(copy.get(), str.c_str(), stringLength);\n            m_dataOwnership.push_back(std::move(copy));\n        }\n        m_data.push_back(m_dataOwnership.back().get());\n    }\n    const char **get_array() {\n        \/\/ Ensure null terminator on array\n        if (!m_arrayHasNullTerminator()) {\n            m_data.push_back(nullptr);\n        }\n        return m_data.data();\n    }\n\n  private:\n    bool m_arrayHasNullTerminator() const {\n        return !m_data.empty() && nullptr == m_data.back();\n    }\n    std::vector<const char *> m_data;\n    std::vector<UniqueCharArray> m_dataOwnership;\n};\n} \/\/ namespace\n\nvoid createYEI(VRPNMultiserverData &data, OSVR_PluginRegContext ctx,\n               const char *params) {\n    Json::Reader reader;\n    Json::Value root;\n    if (!reader.parse(params, root)) {\n        throw std::runtime_error(\"Could not parse configuration: \" +\n                                 reader.getFormattedErrorMessages());\n    }\n    static const uint16_t vID = 0x9AC;\n    static const uint16_t pID = 0x3F2;\n    for (auto dev : osvr::usbserial::Enumerator(vID, pID)) {\n\n        std::string port = normalizeAndVerifySerialPort(dev->getPort());\n\n        bool calibrate_gyros_on_setup =\n            root.get(\"calibrateGyrosOnSetup\", false).asBool();\n        bool tare_on_setup = root.get(\"tareOnSetup\", false).asBool();\n        double frames_per_second = root.get(\"framesPerSecond\", 250).asFloat();\n\n        Json::Value commands = root.get(\"resetCommands\", Json::arrayValue);\n        CStringArray reset_commands;\n\n        \/\/ Enable Q-COMP filtering by default\n        reset_commands.push_back(\"123,2\");\n\n        for (Json::ArrayIndex i = 0, e = commands.size(); i < e; ++i) {\n            reset_commands.push_back(commands[i].asString());\n        }\n\n        osvr::vrpnserver::VRPNDeviceRegistration reg(ctx);\n\n        reg.registerDevice(new vrpn_YEI_3Space_Sensor(\n            reg.useDecoratedName(data.getName(\"YEI_3Space_Sensor\")).c_str(),\n            reg.getVRPNConnection(), port.c_str(), 115200,\n            calibrate_gyros_on_setup, tare_on_setup, frames_per_second, 0, 0, 1,\n            0, reset_commands.get_array()));\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright 2020 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/compiler\/mlir\/tools\/kernel_gen\/tf_framework_c_interface.h\"\n\n#include <cstddef>\n#include <string>\n#include <utility>\n\n#include \"llvm\/ADT\/SmallVector.h\"\n#include \"llvm\/Support\/TargetSelect.h\"\n#include \"mlir\/ExecutionEngine\/ExecutionEngine.h\"  \/\/ from @llvm-project\n#include \"mlir\/ExecutionEngine\/OptUtils.h\"  \/\/ from @llvm-project\n#include \"mlir\/Parser.h\"  \/\/ from @llvm-project\n#include \"tensorflow\/compiler\/mlir\/tools\/kernel_gen\/compile_cache_item.pb.h\"\n#include \"tensorflow\/compiler\/mlir\/tools\/kernel_gen\/ir\/tf_framework_ops.h\"\n#include \"tensorflow\/compiler\/mlir\/tools\/kernel_gen\/kernel_creator.h\"\n#include \"tensorflow\/compiler\/mlir\/tools\/kernel_gen\/tf_jit_cache.h\"\n#include \"tensorflow\/core\/framework\/allocator.h\"\n#include \"tensorflow\/core\/framework\/resource_mgr.h\"\n#include \"tensorflow\/core\/lib\/io\/path.h\"\n#include \"tensorflow\/core\/platform\/status.h\"\n#include \"tensorflow\/core\/platform\/statusor.h\"\n#include \"tensorflow\/stream_executor\/stream.h\"\n\n#if defined(GOOGLE_CUDA) || defined(TENSORFLOW_USE_ROCM)\n#include \"tensorflow\/compiler\/mlir\/tools\/kernel_gen\/tf_gpu_runtime_wrappers.h\"\n#endif\n\nstatic constexpr absl::string_view kTFJitCacheDirEnvVar = \"TF_JIT_CACHE_DIR\";\n\nnamespace mlir {\nnamespace kernel_gen {\nnamespace tf_framework {\nnamespace {\n\nusing tensorflow::Allocator;\nusing tensorflow::AllocatorAttributes;\n\nAllocator* GetAllocator(void* op_kernel_ctx) {\n  auto* ctx = static_cast<tensorflow::OpKernelContext*>(op_kernel_ctx);\n  \/\/ TODO(pifon): Figure out how to set AllocatorAttributes correctly.\n  AllocatorAttributes attrs;\n  return ctx->get_allocator(attrs);\n}\n\n}  \/\/ namespace\n\nextern \"C\" void* _mlir_ciface_tf_alloc(void* op_kernel_ctx, size_t num_elements,\n                                       size_t element_size,\n                                       int32_t output_index,\n                                       int32_t num_candidates,\n                                       int32_t* candidate_input_indices) {\n  static constexpr int kAmbiguousOutputIndex = -1;\n  auto* ctx = static_cast<tensorflow::OpKernelContext*>(op_kernel_ctx);\n  if (output_index != kAmbiguousOutputIndex) {\n    \/\/ Create a 1D shape, because the shapes don't have to match exactly for\n    \/\/ input forwarding. Only the number of elements must be the same.\n    tensorflow::TensorShape output_shape;\n    output_shape.AddDim(num_elements);\n\n    \/\/ Iterate over indices of all inputs that can potentially be used for\n    \/\/ forwarding.\n    for (int i = 0; i < num_candidates; ++i) {\n      auto tensor = ctx->forward_input(candidate_input_indices[i], output_index,\n                                       ctx->expected_output_dtype(output_index),\n                                       output_shape,\n                                       ctx->output_memory_type(output_index),\n                                       ctx->output_alloc_attr(output_index));\n      if (tensor != nullptr) {\n        return tensor->data();\n      }\n    }\n\n    CHECK(!ctx->output_expects_forwarding(output_index));\n  }\n\n  \/\/ If no forwarding happened, allocate a chunk of memory.\n  return GetAllocator(op_kernel_ctx)\n      ->AllocateRaw(Allocator::kAllocatorAlignment,\n                    num_elements * element_size);\n}\n\nextern \"C\" void _mlir_ciface_tf_dealloc(void* op_kernel_ctx, void* ptr) {\n  GetAllocator(op_kernel_ctx)->DeallocateRaw(ptr);\n}\n\nextern \"C\" void _mlir_ciface_tf_report_error(void* op_kernel_ctx,\n                                             int32_t error_code, char* msg) {\n  Optional<ErrorCode> symbol = symbolizeErrorCode(error_code);\n  if (!symbol.hasValue()) {\n    LOG(ERROR) << \"No valid conversion from integer value = \" << error_code\n               << \"to ErrorCode attribute\";\n    return;\n  }\n  auto* ctx = static_cast<tensorflow::OpKernelContext*>(op_kernel_ctx);\n  ctx->CtxFailureWithWarning(\n      tensorflow::Status{ConvertAttrToEnumValue(symbol.getValue()), msg});\n}\n\nstatic void ReportError(void* op_kernel_ctx, ErrorCode error_code,\n                        const char* msg) {\n  _mlir_ciface_tf_report_error(op_kernel_ctx, static_cast<uint32_t>(error_code),\n                               const_cast<char*>(msg));\n}\n\nnamespace {\n\nstd::string GetFileCachePath(const std::string cache_dir,\n                             const std::string& code) {\n  size_t hash = llvm::hash_value(code);\n  return tensorflow::io::JoinPath(cache_dir, std::to_string(hash));\n}\n\n\/\/ A callback to register all externally defined symbols needed by the kernel.\nllvm::orc::SymbolMap TFFrameworkSymbolMap(llvm::orc::MangleAndInterner mangle) {\n  llvm::orc::SymbolMap symbol_map;\n  auto bind = [&](llvm::StringRef name, auto symbol_ptr) {\n    symbol_map[mangle(name)] = llvm::JITEvaluatedSymbol(\n        llvm::pointerToJITTargetAddress(symbol_ptr), llvm::JITSymbolFlags());\n  };\n\n  \/\/ Register all the symbols.\n  bind(\"_mlir_ciface_tf_alloc\", &_mlir_ciface_tf_alloc);\n  bind(\"_mlir_ciface_tf_dealloc\", &_mlir_ciface_tf_dealloc);\n  bind(\"_mlir_ciface_tf_report_error\", &_mlir_ciface_tf_report_error);\n#if defined(GOOGLE_CUDA) || defined(TENSORFLOW_USE_ROCM)\n  bind(\"_mlir_ciface_tf_launch_kernel\", &_mlir_ciface_tf_launch_kernel);\n#endif\n\n  return symbol_map;\n}\n\nllvm::Expected<std::unique_ptr<ExecutionEngine>> Compile(\n    const std::string code, llvm::SmallVectorImpl<std::string>& architectures,\n    llvm::SmallVectorImpl<int64_t>& tile_sizes,\n    llvm::SmallVectorImpl<int64_t>& unroll_factors, int64_t max_supported_rank,\n    bool enable_ftz, bool index_64bit, bool cpu_codegen) {\n  std::string cache_dir;\n  if (const char* dir = getenv(kTFJitCacheDirEnvVar.data())) {\n    cache_dir = dir;\n  }\n\n  \/\/ Check if we already have a partially compiled module in the filesystem\n  \/\/ based cache.\n  CompilationCacheItem item;\n  auto tenv = tensorflow::Env::Default();\n  if (!cache_dir.empty() && tenv->RecursivelyCreateDir(cache_dir).ok()) {\n    std::string data;\n    if (tensorflow::ReadFileToString(tenv, GetFileCachePath(cache_dir, code),\n                                     &data)\n            .ok()) {\n      item.ParseFromString(data);\n      if (item.original_module() != code) {\n        item.Clear();\n      }\n    }\n  }\n\n  \/\/ Create the kernel.\n  mlir::OwningOpRef<mlir::ModuleOp> module;\n  mlir::MLIRContext context;\n\n  if (item.result_module().empty()) {\n    \/\/ Otherwise, compile the module now.\n    tensorflow::StatusOr<mlir::OwningOpRef<mlir::ModuleOp>> status_or_module =\n        tensorflow::kernel_gen::GenerateKernelForTfCode(\n            context, code, architectures, tile_sizes, unroll_factors,\n            max_supported_rank, \/*embed_memref_prints=*\/false,\n            \/*print_ptx=*\/false, \/*print_llvmir=*\/false, enable_ftz,\n            index_64bit, cpu_codegen,\n            \/*jit_compile=*\/false,\n            \/*jit_i64_indexed_for_large_tensors=*\/false);\n    if (!status_or_module.ok()) return nullptr;\n    module = std::move(status_or_module.ValueOrDie());\n\n    if (!cache_dir.empty() && tenv->RecursivelyCreateDir(cache_dir).ok()) {\n      \/\/ Save the compilation result here for future processes to use.\n      item.set_original_module(code);\n      llvm::raw_string_ostream stream(*item.mutable_result_module());\n      module.get().print(stream);\n      stream.flush();\n\n      tensorflow::WriteStringToFile(tenv, GetFileCachePath(cache_dir, code),\n                                    item.SerializeAsString())\n          .IgnoreError();\n    }\n  } else {\n    module = tensorflow::kernel_gen::SetupContextAndParseModule(\n                 context, item.result_module())\n                 .ValueOrDie();\n  }\n\n  \/\/ Initialize LLVM targets.\n  llvm::InitializeNativeTarget();\n  llvm::InitializeNativeTargetAsmPrinter();\n\n  \/\/ Create execution engine with an inner optimization pipeline.\n  auto opt_pipeline = mlir::makeOptimizingTransformer(\n      \/*optLevel=*\/2, \/*sizeLevel=*\/0, \/*targetMachine=*\/nullptr);\n  mlir::ExecutionEngineOptions engine_options;\n  engine_options.transformer = opt_pipeline;\n  llvm::Expected<std::unique_ptr<ExecutionEngine>> engine =\n      mlir::ExecutionEngine::create(module.get(), engine_options);\n  if (!engine) return nullptr;\n\n  \/\/ Finally, register the missing symbols.\n  engine.get()->registerSymbols(TFFrameworkSymbolMap);\n  return engine;\n}\n\ntemplate <typename T, typename U = T>\nllvm::SmallVector<T, 8> SmallVectorFromCArray(int64_t num_elements,\n                                              U* elements_ptr) {\n  llvm::SmallVector<T, 8> result;\n  result.reserve(num_elements);\n  for (int i = 0; i < num_elements; ++i) result.push_back(elements_ptr[i]);\n  return result;\n}\n\n}  \/\/ namespace\n\nextern \"C\" void* _mlir_ciface_tf_jit_compile(\n    void* op_kernel_ctx, char* code, int64_t num_tile_sizes,\n    int64_t* tile_sizes_ptr, int64_t num_unroll_factors,\n    int64_t* unroll_factors_ptr, int64_t max_supported_rank, bool enable_ftz,\n    bool index_64bit, bool cpu_codegen) {\n  \/\/ Get the resource manager.\n  auto* ctx = static_cast<tensorflow::OpKernelContext*>(op_kernel_ctx);\n  tensorflow::ResourceMgr* rm = ctx->resource_manager();\n  if (!rm) {\n    ReportError(op_kernel_ctx, ErrorCode::UNKNOWN, \"No resource manager.\");\n    return nullptr;\n  }\n\n  \/\/ Get the JIT cache.\n  JITCache* jit_cache = nullptr;\n  auto status = rm->LookupOrCreate<JITCache>(rm->default_container(),\n                                             JITCache::kDefaultResourceName,\n                                             &jit_cache, JITCache::Create);\n  tensorflow::core::ScopedUnref jit_cache_ref(jit_cache);\n  if (!status.ok()) {\n    ReportError(op_kernel_ctx, ErrorCode::UNKNOWN,\n                \"Failed to find or create JIT cache.\");\n    return nullptr;\n  }\n\n  \/\/ Determine the unique architecture for the current GPU, if any.\n  SmallVector<std::string, 1> architectures;\n#if defined(GOOGLE_CUDA)\n  stream_executor::CudaComputeCapability cc =\n      ctx->op_device_context()->stream()->GetCudaComputeCapability();\n  architectures.push_back(absl::StrCat(\"sm_\", cc.major, cc.minor));\n#elif defined(TENSORFLOW_USE_ROCM)\n  architectures.push_back(ctx->op_device_context()\n                              ->stream()\n                              ->parent()\n                              ->GetDeviceDescription()\n                              .rocm_amdgpu_gcn_arch_name());\n#endif\n\n  \/\/ Construct `SmallVector`s from arguments.\n  llvm::SmallVector<int64_t, 8> tile_sizes =\n      SmallVectorFromCArray<int64_t>(num_tile_sizes, tile_sizes_ptr);\n  llvm::SmallVector<int64_t, 8> unroll_factors =\n      SmallVectorFromCArray<int64_t>(num_unroll_factors, unroll_factors_ptr);\n\n  \/\/ Lookup or compile the execution module.\n  ExecutionEngine* engine = jit_cache->LookupOrCompile(code, [&]() {\n    return Compile(code, architectures, tile_sizes, unroll_factors,\n                   max_supported_rank, enable_ftz, index_64bit, cpu_codegen);\n  });\n  if (engine == nullptr) {\n    ReportError(op_kernel_ctx, ErrorCode::UNKNOWN, \"JIT compilation failed.\");\n    return nullptr;\n  }\n  return engine;\n}\n\nextern \"C\" void _mlir_ciface_tf_jit_execute(void* op_kernel_ctx, void* callable,\n                                            void* result, int64_t num_args,\n                                            void* args_ptr) {\n  \/\/ JIT compilation must have failed earlier if there is no callable ptr.\n  \/\/ Return some empty memory descriptor to prevent a crash.\n  if (callable == nullptr) {\n    auto* desc = static_cast<::UnrankedMemRefType<void>*>(result);\n    desc->rank = 0;\n    auto* inner_desc = static_cast<StridedMemRefType<int8_t, 0>*>(\n        malloc(sizeof(StridedMemRefType<int8_t, 0>)));\n    inner_desc->basePtr = nullptr;\n    inner_desc->data = nullptr;\n    inner_desc->offset = 0;\n    desc->descriptor = inner_desc;\n    return;\n  }\n\n  \/\/ Build the argument array according to `ExecutionEngine`'s calling\n  \/\/ convention.\n  auto* typed_args_ptr = static_cast<::UnrankedMemRefType<void>*>(args_ptr);\n  llvm::SmallVector<void*, 8> args_array = {&op_kernel_ctx};\n  for (int i = 0; i < num_args; i++) {\n    auto& desc = typed_args_ptr[i];\n    args_array.push_back(&desc.rank);\n    args_array.push_back(&desc.descriptor);\n  }\n  args_array.push_back(result);\n\n  llvm::Error invocation_result =\n      static_cast<ExecutionEngine*>(callable)->invokePacked(\"main\", args_array);\n  if (invocation_result)\n    ReportError(op_kernel_ctx, ErrorCode::UNKNOWN, \"JIT invocation failed.\");\n}\n\n}  \/\/ namespace tf_framework\n}  \/\/ namespace kernel_gen\n}  \/\/ namespace mlir\n<commit_msg>[KernelGen][JIT] Register malloc and free symbols to fix Windows<commit_after>\/* Copyright 2020 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/compiler\/mlir\/tools\/kernel_gen\/tf_framework_c_interface.h\"\n\n#include <cstddef>\n#include <string>\n#include <utility>\n\n#include \"llvm\/ADT\/SmallVector.h\"\n#include \"llvm\/Support\/TargetSelect.h\"\n#include \"mlir\/ExecutionEngine\/ExecutionEngine.h\"  \/\/ from @llvm-project\n#include \"mlir\/ExecutionEngine\/OptUtils.h\"  \/\/ from @llvm-project\n#include \"mlir\/Parser.h\"  \/\/ from @llvm-project\n#include \"tensorflow\/compiler\/mlir\/tools\/kernel_gen\/compile_cache_item.pb.h\"\n#include \"tensorflow\/compiler\/mlir\/tools\/kernel_gen\/ir\/tf_framework_ops.h\"\n#include \"tensorflow\/compiler\/mlir\/tools\/kernel_gen\/kernel_creator.h\"\n#include \"tensorflow\/compiler\/mlir\/tools\/kernel_gen\/tf_jit_cache.h\"\n#include \"tensorflow\/core\/framework\/allocator.h\"\n#include \"tensorflow\/core\/framework\/resource_mgr.h\"\n#include \"tensorflow\/core\/lib\/io\/path.h\"\n#include \"tensorflow\/core\/platform\/status.h\"\n#include \"tensorflow\/core\/platform\/statusor.h\"\n#include \"tensorflow\/stream_executor\/stream.h\"\n\n#if defined(GOOGLE_CUDA) || defined(TENSORFLOW_USE_ROCM)\n#include \"tensorflow\/compiler\/mlir\/tools\/kernel_gen\/tf_gpu_runtime_wrappers.h\"\n#endif\n\nstatic constexpr absl::string_view kTFJitCacheDirEnvVar = \"TF_JIT_CACHE_DIR\";\n\nnamespace mlir {\nnamespace kernel_gen {\nnamespace tf_framework {\nnamespace {\n\nusing tensorflow::Allocator;\nusing tensorflow::AllocatorAttributes;\n\nAllocator* GetAllocator(void* op_kernel_ctx) {\n  auto* ctx = static_cast<tensorflow::OpKernelContext*>(op_kernel_ctx);\n  \/\/ TODO(pifon): Figure out how to set AllocatorAttributes correctly.\n  AllocatorAttributes attrs;\n  return ctx->get_allocator(attrs);\n}\n\n}  \/\/ namespace\n\nextern \"C\" void* _mlir_ciface_tf_alloc(void* op_kernel_ctx, size_t num_elements,\n                                       size_t element_size,\n                                       int32_t output_index,\n                                       int32_t num_candidates,\n                                       int32_t* candidate_input_indices) {\n  static constexpr int kAmbiguousOutputIndex = -1;\n  auto* ctx = static_cast<tensorflow::OpKernelContext*>(op_kernel_ctx);\n  if (output_index != kAmbiguousOutputIndex) {\n    \/\/ Create a 1D shape, because the shapes don't have to match exactly for\n    \/\/ input forwarding. Only the number of elements must be the same.\n    tensorflow::TensorShape output_shape;\n    output_shape.AddDim(num_elements);\n\n    \/\/ Iterate over indices of all inputs that can potentially be used for\n    \/\/ forwarding.\n    for (int i = 0; i < num_candidates; ++i) {\n      auto tensor = ctx->forward_input(candidate_input_indices[i], output_index,\n                                       ctx->expected_output_dtype(output_index),\n                                       output_shape,\n                                       ctx->output_memory_type(output_index),\n                                       ctx->output_alloc_attr(output_index));\n      if (tensor != nullptr) {\n        return tensor->data();\n      }\n    }\n\n    CHECK(!ctx->output_expects_forwarding(output_index));\n  }\n\n  \/\/ If no forwarding happened, allocate a chunk of memory.\n  return GetAllocator(op_kernel_ctx)\n      ->AllocateRaw(Allocator::kAllocatorAlignment,\n                    num_elements * element_size);\n}\n\nextern \"C\" void _mlir_ciface_tf_dealloc(void* op_kernel_ctx, void* ptr) {\n  GetAllocator(op_kernel_ctx)->DeallocateRaw(ptr);\n}\n\nextern \"C\" void _mlir_ciface_tf_report_error(void* op_kernel_ctx,\n                                             int32_t error_code, char* msg) {\n  Optional<ErrorCode> symbol = symbolizeErrorCode(error_code);\n  if (!symbol.hasValue()) {\n    LOG(ERROR) << \"No valid conversion from integer value = \" << error_code\n               << \"to ErrorCode attribute\";\n    return;\n  }\n  auto* ctx = static_cast<tensorflow::OpKernelContext*>(op_kernel_ctx);\n  ctx->CtxFailureWithWarning(\n      tensorflow::Status{ConvertAttrToEnumValue(symbol.getValue()), msg});\n}\n\nstatic void ReportError(void* op_kernel_ctx, ErrorCode error_code,\n                        const char* msg) {\n  _mlir_ciface_tf_report_error(op_kernel_ctx, static_cast<uint32_t>(error_code),\n                               const_cast<char*>(msg));\n}\n\nnamespace {\n\nstd::string GetFileCachePath(const std::string cache_dir,\n                             const std::string& code) {\n  size_t hash = llvm::hash_value(code);\n  return tensorflow::io::JoinPath(cache_dir, std::to_string(hash));\n}\n\n\/\/ A callback to register all externally defined symbols needed by the kernel.\nllvm::orc::SymbolMap TFFrameworkSymbolMap(llvm::orc::MangleAndInterner mangle) {\n  llvm::orc::SymbolMap symbol_map;\n  auto bind = [&](llvm::StringRef name, auto symbol_ptr) {\n    symbol_map[mangle(name)] = llvm::JITEvaluatedSymbol(\n        llvm::pointerToJITTargetAddress(symbol_ptr), llvm::JITSymbolFlags());\n  };\n\n  \/\/ Register TF framework symbols.\n  bind(\"_mlir_ciface_tf_alloc\", &_mlir_ciface_tf_alloc);\n  bind(\"_mlir_ciface_tf_dealloc\", &_mlir_ciface_tf_dealloc);\n  bind(\"_mlir_ciface_tf_report_error\", &_mlir_ciface_tf_report_error);\n#if defined(GOOGLE_CUDA) || defined(TENSORFLOW_USE_ROCM)\n  bind(\"_mlir_ciface_tf_launch_kernel\", &_mlir_ciface_tf_launch_kernel);\n#endif\n\n  \/\/ Register malloc\/free to avoid unexpected implementations from shared libs.\n  bind(\"malloc\", &malloc);\n  bind(\"free\", &free);\n\n  return symbol_map;\n}\n\nllvm::Expected<std::unique_ptr<ExecutionEngine>> Compile(\n    const std::string code, llvm::SmallVectorImpl<std::string>& architectures,\n    llvm::SmallVectorImpl<int64_t>& tile_sizes,\n    llvm::SmallVectorImpl<int64_t>& unroll_factors, int64_t max_supported_rank,\n    bool enable_ftz, bool index_64bit, bool cpu_codegen) {\n  std::string cache_dir;\n  if (const char* dir = getenv(kTFJitCacheDirEnvVar.data())) {\n    cache_dir = dir;\n  }\n\n  \/\/ Check if we already have a partially compiled module in the filesystem\n  \/\/ based cache.\n  CompilationCacheItem item;\n  auto tenv = tensorflow::Env::Default();\n  if (!cache_dir.empty() && tenv->RecursivelyCreateDir(cache_dir).ok()) {\n    std::string data;\n    if (tensorflow::ReadFileToString(tenv, GetFileCachePath(cache_dir, code),\n                                     &data)\n            .ok()) {\n      item.ParseFromString(data);\n      if (item.original_module() != code) {\n        item.Clear();\n      }\n    }\n  }\n\n  \/\/ Create the kernel.\n  mlir::OwningOpRef<mlir::ModuleOp> module;\n  mlir::MLIRContext context;\n\n  if (item.result_module().empty()) {\n    \/\/ Otherwise, compile the module now.\n    tensorflow::StatusOr<mlir::OwningOpRef<mlir::ModuleOp>> status_or_module =\n        tensorflow::kernel_gen::GenerateKernelForTfCode(\n            context, code, architectures, tile_sizes, unroll_factors,\n            max_supported_rank, \/*embed_memref_prints=*\/false,\n            \/*print_ptx=*\/false, \/*print_llvmir=*\/false, enable_ftz,\n            index_64bit, cpu_codegen,\n            \/*jit_compile=*\/false,\n            \/*jit_i64_indexed_for_large_tensors=*\/false);\n    if (!status_or_module.ok()) return nullptr;\n    module = std::move(status_or_module.ValueOrDie());\n\n    if (!cache_dir.empty() && tenv->RecursivelyCreateDir(cache_dir).ok()) {\n      \/\/ Save the compilation result here for future processes to use.\n      item.set_original_module(code);\n      llvm::raw_string_ostream stream(*item.mutable_result_module());\n      module.get().print(stream);\n      stream.flush();\n\n      tensorflow::WriteStringToFile(tenv, GetFileCachePath(cache_dir, code),\n                                    item.SerializeAsString())\n          .IgnoreError();\n    }\n  } else {\n    module = tensorflow::kernel_gen::SetupContextAndParseModule(\n                 context, item.result_module())\n                 .ValueOrDie();\n  }\n\n  \/\/ Initialize LLVM targets.\n  llvm::InitializeNativeTarget();\n  llvm::InitializeNativeTargetAsmPrinter();\n\n  \/\/ Create execution engine with an inner optimization pipeline.\n  auto opt_pipeline = mlir::makeOptimizingTransformer(\n      \/*optLevel=*\/2, \/*sizeLevel=*\/0, \/*targetMachine=*\/nullptr);\n  mlir::ExecutionEngineOptions engine_options;\n  engine_options.transformer = opt_pipeline;\n  llvm::Expected<std::unique_ptr<ExecutionEngine>> engine =\n      mlir::ExecutionEngine::create(module.get(), engine_options);\n  if (!engine) return nullptr;\n\n  \/\/ Finally, register the missing symbols.\n  engine.get()->registerSymbols(TFFrameworkSymbolMap);\n  return engine;\n}\n\ntemplate <typename T, typename U = T>\nllvm::SmallVector<T, 8> SmallVectorFromCArray(int64_t num_elements,\n                                              U* elements_ptr) {\n  llvm::SmallVector<T, 8> result;\n  result.reserve(num_elements);\n  for (int i = 0; i < num_elements; ++i) result.push_back(elements_ptr[i]);\n  return result;\n}\n\n}  \/\/ namespace\n\nextern \"C\" void* _mlir_ciface_tf_jit_compile(\n    void* op_kernel_ctx, char* code, int64_t num_tile_sizes,\n    int64_t* tile_sizes_ptr, int64_t num_unroll_factors,\n    int64_t* unroll_factors_ptr, int64_t max_supported_rank, bool enable_ftz,\n    bool index_64bit, bool cpu_codegen) {\n  \/\/ Get the resource manager.\n  auto* ctx = static_cast<tensorflow::OpKernelContext*>(op_kernel_ctx);\n  tensorflow::ResourceMgr* rm = ctx->resource_manager();\n  if (!rm) {\n    ReportError(op_kernel_ctx, ErrorCode::UNKNOWN, \"No resource manager.\");\n    return nullptr;\n  }\n\n  \/\/ Get the JIT cache.\n  JITCache* jit_cache = nullptr;\n  auto status = rm->LookupOrCreate<JITCache>(rm->default_container(),\n                                             JITCache::kDefaultResourceName,\n                                             &jit_cache, JITCache::Create);\n  tensorflow::core::ScopedUnref jit_cache_ref(jit_cache);\n  if (!status.ok()) {\n    ReportError(op_kernel_ctx, ErrorCode::UNKNOWN,\n                \"Failed to find or create JIT cache.\");\n    return nullptr;\n  }\n\n  \/\/ Determine the unique architecture for the current GPU, if any.\n  SmallVector<std::string, 1> architectures;\n#if defined(GOOGLE_CUDA)\n  stream_executor::CudaComputeCapability cc =\n      ctx->op_device_context()->stream()->GetCudaComputeCapability();\n  architectures.push_back(absl::StrCat(\"sm_\", cc.major, cc.minor));\n#elif defined(TENSORFLOW_USE_ROCM)\n  architectures.push_back(ctx->op_device_context()\n                              ->stream()\n                              ->parent()\n                              ->GetDeviceDescription()\n                              .rocm_amdgpu_gcn_arch_name());\n#endif\n\n  \/\/ Construct `SmallVector`s from arguments.\n  llvm::SmallVector<int64_t, 8> tile_sizes =\n      SmallVectorFromCArray<int64_t>(num_tile_sizes, tile_sizes_ptr);\n  llvm::SmallVector<int64_t, 8> unroll_factors =\n      SmallVectorFromCArray<int64_t>(num_unroll_factors, unroll_factors_ptr);\n\n  \/\/ Lookup or compile the execution module.\n  ExecutionEngine* engine = jit_cache->LookupOrCompile(code, [&]() {\n    return Compile(code, architectures, tile_sizes, unroll_factors,\n                   max_supported_rank, enable_ftz, index_64bit, cpu_codegen);\n  });\n  if (engine == nullptr) {\n    ReportError(op_kernel_ctx, ErrorCode::UNKNOWN, \"JIT compilation failed.\");\n    return nullptr;\n  }\n  return engine;\n}\n\nextern \"C\" void _mlir_ciface_tf_jit_execute(void* op_kernel_ctx, void* callable,\n                                            void* result, int64_t num_args,\n                                            void* args_ptr) {\n  \/\/ JIT compilation must have failed earlier if there is no callable ptr.\n  \/\/ Return some empty memory descriptor to prevent a crash.\n  if (callable == nullptr) {\n    auto* desc = static_cast<::UnrankedMemRefType<void>*>(result);\n    desc->rank = 0;\n    auto* inner_desc = static_cast<StridedMemRefType<int8_t, 0>*>(\n        malloc(sizeof(StridedMemRefType<int8_t, 0>)));\n    inner_desc->basePtr = nullptr;\n    inner_desc->data = nullptr;\n    inner_desc->offset = 0;\n    desc->descriptor = inner_desc;\n    return;\n  }\n\n  \/\/ Build the argument array according to `ExecutionEngine`'s calling\n  \/\/ convention.\n  auto* typed_args_ptr = static_cast<::UnrankedMemRefType<void>*>(args_ptr);\n  llvm::SmallVector<void*, 8> args_array = {&op_kernel_ctx};\n  for (int i = 0; i < num_args; i++) {\n    auto& desc = typed_args_ptr[i];\n    args_array.push_back(&desc.rank);\n    args_array.push_back(&desc.descriptor);\n  }\n  args_array.push_back(result);\n\n  llvm::Error invocation_result =\n      static_cast<ExecutionEngine*>(callable)->invokePacked(\"main\", args_array);\n  if (invocation_result)\n    ReportError(op_kernel_ctx, ErrorCode::UNKNOWN, \"JIT invocation failed.\");\n}\n\n}  \/\/ namespace tf_framework\n}  \/\/ namespace kernel_gen\n}  \/\/ namespace mlir\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\n    Copyright Eli Dupree and Isaac Dupree, 2011, 2012\n\n    This file is part of Lasercake.\n\n    Lasercake is free software: you can redistribute it and\/or modify\n    it under the terms of the GNU General Public License as published by\n    the Free Software Foundation, either version 3 of the License, or\n    (at your option) any later version.\n\n    Lasercake is distributed in the hope that it will be useful,\n    but WITHOUT ANY WARRANTY; without even the implied warranty of\n    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n    GNU General Public License for more details.\n\n    You should have received a copy of the GNU General Public License\n    along with Lasercake.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n#ifndef LASERCAKE_WORLD_CONSTANTS_HPP__\n#define LASERCAKE_WORLD_CONSTANTS_HPP__\n\n#include \"utils.hpp\"\n#include \"units.hpp\"\n\n\/\/ TODO: conciser names?\n\/\/ make_units<[num[, den]], meter<3>, per, kilogram> ?\nconstexpr auto tile_widths = units_factor<10>() * meters;\nconstexpr auto tile_heights = units_factor<2>() * meters;\nconstexpr auto fine_units = tile_widths * units_factor<1, 2000>();\n\ntypedef decltype(imaginary_copy(tile_widths)) tile_widths_t;\ntypedef decltype(imaginary_copy(tile_heights)) tile_heights_t;\ntypedef decltype(imaginary_copy(fine_units)) fine_units_t;\n\ntypedef unit<int64_t, fine_units_t> fine_scalar; \/\/ Fine as opposed to coarse, that is.\n\n\nconstexpr auto velocity_units = fine_units \/ \/* units_factor<30>() \/ ? *\/ seconds;\nconstexpr auto tile_physics_sub_tile_units = fine_units \/ units_factor<30>();\n\ntypedef decltype(imaginary_copy(velocity_units)) velocity_units_t;\ntypedef decltype(imaginary_copy(tile_physics_sub_tile_units)) tile_physics_sub_tile_units_t;\n\ntypedef unit<int32_t, tile_physics_sub_tile_units_t> sub_tile_distance; \/\/ We can fit it within 32 bits, so we might as well do faster math\ntypedef unit<int64_t, tile_physics_sub_tile_units_t> large_sub_tile_distance;\n\n\n\/\/ Choose a number that makes lots of frames-per-second values multiply in evenly.\n\/\/ TODO if we use this more and want a different representation, that would be fine too.\n\/\/ TODO where it doesn't already, code should refer to some kind of time unit more,\n\/\/        rather than implicitly relying on frames being a fixed duration.\n\nconstexpr auto time_units = seconds * units_factor<1, (2*2*2*2 * 3*3*3 * 5*5 * 7 * 11)>();\ntypedef decltype(imaginary_copy(time_units)) time_units_t;\ntypedef unit<int64_t, time_units_t> time_unit;\n\n\/\/ok...\nconst fine_scalar tile_width = 1 * tile_widths * identity(fine_units \/ tile_widths);\nconst fine_scalar tile_height = 1 * tile_heights * identity(fine_units \/ tile_heights);\n#if 0\nconst time_unit time_units_per_second = 2*2*2*2 * 3*3*3 * 5*5 * 7 * 11;\n\/\/ delete these if we make frames variable length:\nconst time_unit fixed_frames_per_second = 30;\nconst time_unit time_units_per_fixed_frame = time_units_per_second \/ fixed_frames_per_second;\n\nconst fine_scalar tile_width = 2000;\nconst fine_scalar tile_height = 400;\nconst vector3<fine_scalar> tile_size(tile_width, tile_width, tile_height);\n\n\/\/ Velocity is currently in units of (fine_unit \/ second).  We might change this.\nconst fine_scalar velocity_scale_factor = fixed_frames_per_second;\n\nconst sub_tile_distance min_convincing_speed           = velocity_scale_factor * tile_width \/ 50;\nconst sub_tile_distance gravity_acceleration_magnitude = velocity_scale_factor * tile_width \/ 200;\nconst vector3<sub_tile_distance> gravity_acceleration(0, 0, -gravity_acceleration_magnitude); \/\/ in mini-units per frame squared\nconst sub_tile_distance friction_amount                = velocity_scale_factor * tile_width \/ 1800;\n\n\/\/ TODO: Get some of these constants out of the header that everyone includes\nconst sub_tile_distance pressure_per_depth_in_tile_heights = gravity_acceleration_magnitude * tile_height * velocity_scale_factor;\n\n\/\/ I believe this value makes it so that the terminal velocity of falling fluid is \"half a vertical tile per frame\".\nconst sub_tile_distance air_resistance_constant = tile_height * tile_height * velocity_scale_factor * velocity_scale_factor \/ gravity_acceleration_magnitude \/ 2;\nconst sub_tile_distance idle_progress_reduction_rate = 20 * velocity_scale_factor;\n\nconst vector3<sub_tile_distance> inactive_fluid_velocity(0, 0, -min_convincing_speed);\n\nconst fine_scalar max_object_speed_through_water = tile_width * velocity_scale_factor \/ 16;\n#endif\n\n#endif\n<commit_msg>comments<commit_after>\/*\n\n    Copyright Eli Dupree and Isaac Dupree, 2011, 2012\n\n    This file is part of Lasercake.\n\n    Lasercake is free software: you can redistribute it and\/or modify\n    it under the terms of the GNU General Public License as published by\n    the Free Software Foundation, either version 3 of the License, or\n    (at your option) any later version.\n\n    Lasercake is distributed in the hope that it will be useful,\n    but WITHOUT ANY WARRANTY; without even the implied warranty of\n    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n    GNU General Public License for more details.\n\n    You should have received a copy of the GNU General Public License\n    along with Lasercake.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n#ifndef LASERCAKE_WORLD_CONSTANTS_HPP__\n#define LASERCAKE_WORLD_CONSTANTS_HPP__\n\n#include \"utils.hpp\"\n#include \"units.hpp\"\n\n\/\/typedef typename units_prod<units_factor<10>, meters_t>::type tile_widths_t;\n\/\/typedef typename units_prod<units_factor<2>, meters_t>::type tile_heights_t;\n\/\/constexpr tile_widths_t tile_widths = tile_widths_t();\n\n\/\/ TODO: conciser names?\n\/\/ make_units<[num[, den]], meter<3>, per, kilogram> ?\nconstexpr auto tile_widths = units_factor<10>() * meters;\nconstexpr auto tile_heights = units_factor<2>() * meters;\nconstexpr auto fine_units = tile_widths * units_factor<1, 2000>();\n\ntypedef decltype(imaginary_copy(tile_widths)) tile_widths_t;\ntypedef decltype(imaginary_copy(tile_heights)) tile_heights_t;\ntypedef decltype(imaginary_copy(fine_units)) fine_units_t;\n\n\/\/ TODO should fine_scalar be renamed to e.g. fine_distance\/fine_coordinate\/?\ntypedef unit<int64_t, fine_units_t> fine_scalar; \/\/ Fine as opposed to coarse, that is.\n\n\nconstexpr auto velocity_units = fine_units \/ \/* units_factor<30>() \/ ? *\/ seconds;\nconstexpr auto tile_physics_sub_tile_units = fine_units \/ units_factor<30>();\n\ntypedef decltype(imaginary_copy(velocity_units)) velocity_units_t;\ntypedef decltype(imaginary_copy(tile_physics_sub_tile_units)) tile_physics_sub_tile_units_t;\n\ntypedef unit<int32_t, tile_physics_sub_tile_units_t> sub_tile_distance; \/\/ We can fit it within 32 bits, so we might as well do faster math\ntypedef unit<int64_t, tile_physics_sub_tile_units_t> large_sub_tile_distance;\n\n\n\/\/ Choose a number that makes lots of frames-per-second values multiply in evenly.\n\/\/ TODO if we use this more and want a different representation, that would be fine too.\n\/\/ TODO where it doesn't already, code should refer to some kind of time unit more,\n\/\/        rather than implicitly relying on frames being a fixed duration.\n\nconstexpr auto time_units = seconds * units_factor<1, (2*2*2*2 * 3*3*3 * 5*5 * 7 * 11)>();\ntypedef decltype(imaginary_copy(time_units)) time_units_t;\ntypedef unit<int64_t, time_units_t> time_unit;\n\n\/\/ok...\nconst fine_scalar tile_width = 1 * tile_widths * identity(fine_units \/ tile_widths);\nconst fine_scalar tile_height = 1 * tile_heights * identity(fine_units \/ tile_heights);\n#if 0\nconst time_unit time_units_per_second = 2*2*2*2 * 3*3*3 * 5*5 * 7 * 11;\n\/\/ delete these if we make frames variable length:\nconst time_unit fixed_frames_per_second = 30;\nconst time_unit time_units_per_fixed_frame = time_units_per_second \/ fixed_frames_per_second;\n\nconst fine_scalar tile_width = 2000;\nconst fine_scalar tile_height = 400;\nconst vector3<fine_scalar> tile_size(tile_width, tile_width, tile_height);\n\n\/\/ Velocity is currently in units of (fine_unit \/ second).  We might change this.\nconst fine_scalar velocity_scale_factor = fixed_frames_per_second;\n\nconst sub_tile_distance min_convincing_speed           = velocity_scale_factor * tile_width \/ 50;\nconst sub_tile_distance gravity_acceleration_magnitude = velocity_scale_factor * tile_width \/ 200;\nconst vector3<sub_tile_distance> gravity_acceleration(0, 0, -gravity_acceleration_magnitude); \/\/ in mini-units per frame squared\nconst sub_tile_distance friction_amount                = velocity_scale_factor * tile_width \/ 1800;\n\n\/\/ TODO: Get some of these constants out of the header that everyone includes\nconst sub_tile_distance pressure_per_depth_in_tile_heights = gravity_acceleration_magnitude * tile_height * velocity_scale_factor;\n\n\/\/ I believe this value makes it so that the terminal velocity of falling fluid is \"half a vertical tile per frame\".\nconst sub_tile_distance air_resistance_constant = tile_height * tile_height * velocity_scale_factor * velocity_scale_factor \/ gravity_acceleration_magnitude \/ 2;\nconst sub_tile_distance idle_progress_reduction_rate = 20 * velocity_scale_factor;\n\nconst vector3<sub_tile_distance> inactive_fluid_velocity(0, 0, -min_convincing_speed);\n\nconst fine_scalar max_object_speed_through_water = tile_width * velocity_scale_factor \/ 16;\n#endif\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: sequence.hxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 02:39: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#ifndef _COMPHELPER_SEQUENCE_HXX_\n#define _COMPHELPER_SEQUENCE_HXX_\n\n#ifndef INCLUDED_ALGORITHM\n#include <algorithm> \/\/ copy algorithm\n#define INCLUDED_ALGORITHM\n#endif\n\n#ifndef _COM_SUN_STAR_UNO_SEQUENCE_HXX_\n#include <com\/sun\/star\/uno\/Sequence.hxx>\n#endif\n\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n\n#ifndef INCLUDED_COMPHELPERDLLAPI_H\n#include \"comphelper\/comphelperdllapi.h\"\n#endif\n\n\/\/.........................................................................\nnamespace comphelper\n{\n\/\/.........................................................................\n\n    namespace staruno   = ::com::sun::star::uno;\n\n    \/\/-------------------------------------------------------------------------\n    \/** search the given string within the given sequence, return the positions where it was found.\n        if _bOnlyFirst is sal_True, only the first occurence will be returned.\n    *\/\n    COMPHELPER_DLLPUBLIC staruno::Sequence<sal_Int16> findValue(const staruno::Sequence< ::rtl::OUString >& _rList, const ::rtl::OUString& _rValue, sal_Bool _bOnlyFirst = sal_False);\n\n    \/\/-------------------------------------------------------------------------\n    namespace internal\n    {\n        template <class T>\n        void implCopySequence(const T* _pSource, T*& _pDest, sal_Int32 _nSourceLen)\n        {\n            for (sal_Int32 i=0; i<_nSourceLen; ++i, ++_pSource, ++_pDest)\n                *_pDest = *_pSource;\n        }\n    }\n    \/\/-------------------------------------------------------------------------\n    \/\/\/ concat two sequences\n    template <class T>\n     staruno::Sequence<T> concatSequences(const staruno::Sequence<T>& _rLeft, const staruno::Sequence<T>& _rRight)\n    {\n        sal_Int32 nLeft(_rLeft.getLength()), nRight(_rRight.getLength());\n        const T* pLeft = _rLeft.getConstArray();\n        const T* pRight = _rRight.getConstArray();\n\n        sal_Int32 nReturnLen(nLeft + nRight);\n        staruno::Sequence<T> aReturn(nReturnLen);\n        T* pReturn = aReturn.getArray();\n\n        internal::implCopySequence(pLeft, pReturn, nLeft);\n        internal::implCopySequence(pRight, pReturn, nRight);\n\n        return aReturn;\n    }\n\n    \/\/-------------------------------------------------------------------------\n    \/\/\/ concat three sequences\n    template <class T>\n    staruno::Sequence<T> concatSequences(const staruno::Sequence<T>& _rLeft, const staruno::Sequence<T>& _rMiddle, const staruno::Sequence<T>& _rRight)\n    {\n        sal_Int32 nLeft(_rLeft.getLength()), nMiddle(_rMiddle.getLength()), nRight(_rRight.getLength());\n        const T* pLeft = _rLeft.getConstArray();\n        const T* pMiddle = _rMiddle.getConstArray();\n        const T* pRight = _rRight.getConstArray();\n\n        sal_Int32 nReturnLen(nLeft + nMiddle + nRight);\n        staruno::Sequence<T> aReturn(nReturnLen);\n        T* pReturn = aReturn.getArray();\n\n        internal::implCopySequence(pLeft, pReturn, nLeft);\n        internal::implCopySequence(pMiddle, pReturn, nMiddle);\n        internal::implCopySequence(pRight, pReturn, nRight);\n\n        return aReturn;\n    }\n\n    \/\/-------------------------------------------------------------------------\n    \/\/\/ remove a specified element from a sequences\n    template<class T>\n    void removeElementAt(staruno::Sequence<T>& _rSeq, sal_Int32 _nPos)\n    {\n        sal_uInt32 nLength = _rSeq.getLength();\n\n        OSL_ENSURE(0 <= _nPos && (sal_uInt32)_nPos < nLength, \"invalid index\");\n\n        for (sal_uInt32 i = (sal_uInt32)_nPos + 1; i < nLength; ++i)\n        {\n            _rSeq[i-1] = _rSeq[i];\n        }\n\n        _rSeq.realloc(nLength-1);\n    }\n\n    \/\/=====================================================================\n    \/\/= iterating through sequences\n    \/\/=====================================================================\n    class SAL_NO_VTABLE IIterator\n    {\n    public:\n        virtual sal_Bool hasMoreElements() const = 0;\n        virtual ::com::sun::star::uno::Any  nextElement() = 0;\n    };\n    \/** a helper class for iterating through a sequence\n    *\/\n    template <class TYPE>\n    class OSequenceIterator : public IIterator\n    {\n        const TYPE* m_pElements;\n        sal_Int32   m_nLen;\n        const TYPE* m_pCurrent;\n\n    public:\n        \/** contrcuct a sequence iterator from a sequence\n        *\/\n        OSequenceIterator(const ::com::sun::star::uno::Sequence< TYPE >& _rSeq);\n        \/** contrcuct a sequence iterator from a Any containing a sequence\n        *\/\n        OSequenceIterator(const ::com::sun::star::uno::Any& _rSequenceAny);\n\n        virtual sal_Bool hasMoreElements() const;\n        virtual ::com::sun::star::uno::Any  nextElement();\n\n    protected:\n        void construct(const ::com::sun::star::uno::Sequence< TYPE >& _rSeq);\n    };\n\n    \/\/---------------------------------------------------------------------\n    template <class TYPE>\n    OSequenceIterator<TYPE>::OSequenceIterator(const ::com::sun::star::uno::Sequence< TYPE >& _rSeq)\n        :m_pElements(NULL)\n        ,m_nLen(0)\n        ,m_pCurrent(NULL)\n    {\n        construct(_rSeq);\n    }\n\n    \/\/---------------------------------------------------------------------\n    template <class TYPE>\n    OSequenceIterator<TYPE>::OSequenceIterator(const ::com::sun::star::uno::Any& _rSequenceAny)\n        :m_pElements(NULL)\n        ,m_nLen(0)\n        ,m_pCurrent(NULL)\n    {\n        ::com::sun::star::uno::Sequence< TYPE > aContainer;\n    #ifdef DBG_UTIL\n        sal_Bool bSuccess =\n    #endif\n        _rSequenceAny >>= aContainer;\n    #ifdef DBG_UTIL\n        OSL_ENSURE(bSuccess, \"OSequenceIterator::OSequenceIterator: invalid Any!\");\n    #endif\n        construct(aContainer);\n    }\n\n    \/\/---------------------------------------------------------------------\n    template <class TYPE>\n    void OSequenceIterator<TYPE>::construct(const ::com::sun::star::uno::Sequence< TYPE >& _rSeq)\n    {\n        m_pElements = _rSeq.getConstArray();\n        m_nLen = _rSeq.getLength();\n        m_pCurrent = m_pElements;\n    }\n\n    \/\/---------------------------------------------------------------------\n    template <class TYPE>\n    sal_Bool OSequenceIterator<TYPE>::hasMoreElements() const\n    {\n        return m_pCurrent - m_pElements < m_nLen;\n    }\n\n    \/\/---------------------------------------------------------------------\n    template <class TYPE>\n    ::com::sun::star::uno::Any OSequenceIterator<TYPE>::nextElement()\n    {\n        return ::com::sun::star::uno::makeAny(*m_pCurrent++);\n    }\n\n    \/\/-------------------------------------------------------------------------\n    \/** Copy from a plain C\/C++ array into a Sequence.\n\n        @tpl SrcType\n        Array element type. Must be assignable to DstType\n\n        @tpl DstType\n        Sequence element type. Must be assignable from SrcType\n\n        @param i_pArray\n        Valid pointer to at least num elements of type SrcType\n\n        @param nNum\n        Number of array elements to copy\n\n        @return the resulting Sequence\n\n        @attention when copying from e.g. a double array to a\n        Sequence<int>, no proper rounding will be performed, but the\n        values will be truncated. There's currently no measure to\n        prevent or detect precision loss, overflow or truncation.\n     *\/\n    template < typename DstType, typename SrcType >\n    ::com::sun::star::uno::Sequence< DstType > arrayToSequence( const SrcType* i_pArray, sal_Int32 nNum )\n    {\n        ::com::sun::star::uno::Sequence< DstType > result( nNum );\n        ::std::copy( i_pArray, i_pArray+nNum, result.getArray() );\n        return result;\n    }\n\n    \/\/-------------------------------------------------------------------------\n    \/** Copy from a Sequence into a plain C\/C++ array\n\n        @tpl SrcType\n        Sequence element type. Must be assignable to DstType\n\n        @tpl DstType\n        Array element type. Must be assignable from SrcType\n\n        @param io_pArray\n        Valid pointer to at least i_Sequence.getLength() elements of\n        type DstType\n\n        @param i_Sequence\n        Reference to a Sequence of SrcType elements\n\n        @return a pointer to the array\n\n        @attention when copying from e.g. a Sequence<double> to an int\n        array, no proper rounding will be performed, but the values\n        will be truncated. There's currently no measure to prevent or\n        detect precision loss, overflow or truncation.\n     *\/\n    template < typename DstType, typename SrcType >\n    DstType* sequenceToArray( DstType* io_pArray, const ::com::sun::star::uno::Sequence< SrcType >& i_Sequence )\n    {\n        ::std::copy( i_Sequence.getConstArray(), i_Sequence.getConstArray()+i_Sequence.getLength(), io_pArray );\n        return io_pArray;\n    }\n\n    \/\/-------------------------------------------------------------------------\n    \/** Copy from a container into a Sequence\n\n        @tpl SrcType\n        Container type. This type must fulfill the STL container\n        concept, in particular, the size(), begin() and end() methods\n        must be available and have the usual semantics.\n\n        @tpl DstType\n        Sequence element type. Must be assignable from SrcType's\n        elements\n\n        @param i_Container\n        Reference to the input contain with elements of type SrcType\n\n        @return the generated Sequence\n\n        @attention this function always performs a copy. Furthermore,\n        when copying from e.g. a vector<double> to a Sequence<int>, no\n        proper rounding will be performed, but the values will be\n        truncated. There's currently no measure to prevent or detect\n        precision loss, overflow or truncation.\n     *\/\n    template < typename DstType, typename SrcType >\n    ::com::sun::star::uno::Sequence< DstType > containerToSequence( const SrcType& i_Container )\n    {\n        ::com::sun::star::uno::Sequence< DstType > result( i_Container.size() );\n        ::std::copy( i_Container.begin(), i_Container.end(), result.getArray() );\n        return result;\n    }\n\n    \/\/-------------------------------------------------------------------------\n    \/** Copy from a Sequence into a container\n\n        @tpl SrcType\n        Sequence element type. Must be assignable to SrcType's\n        elements\n\n        @tpl DstType\n        Container type. This type must fulfill the STL container and\n        sequence concepts, in particular, the begin(), end() and the\n        unary constructor DstType(int) methods must be available and\n        have the usual semantics.\n\n        @param i_Sequence\n        Reference to a Sequence of SrcType elements\n\n        @return a pointer to the generated container\n\n        @attention this function always performs a copy. Furthermore,\n        when copying from e.g. a Sequence<double> to a vector<int>, no\n        proper rounding will be performed, but the values will be\n        truncated. There's currently no measure to prevent or detect\n        precision loss, overflow or truncation.\n     *\/\n    template < typename DstType, typename SrcType >\n    DstType sequenceToContainer( const ::com::sun::star::uno::Sequence< SrcType >& i_Sequence )\n    {\n        DstType result( i_Sequence.getLength() );\n        ::std::copy( i_Sequence.getConstArray(), i_Sequence.getConstArray()+i_Sequence.getLength(), result.begin() );\n        return result;\n    }\n\n\/\/.........................................................................\n}   \/\/ namespace comphelper\n\/\/.........................................................................\n\n#endif \/\/ _COMPHELPER_SEQUENCE_HXX_\n\n<commit_msg>INTEGRATION: CWS dbo510 (1.9.24); FILE MERGED 2006\/02\/15 10:11:59 dbo 1.9.24.2: #i59034# making containerToSequence() vector overload robust for non-pro 2005\/11\/01 21:55:58 dbo 1.9.24.1: optimizing containerToSequence( std::vector )<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: sequence.hxx,v $\n *\n *  $Revision: 1.10 $\n *\n *  last change: $Author: rt $ $Date: 2006-03-06 10:13:10 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n#ifndef _COMPHELPER_SEQUENCE_HXX_\n#define _COMPHELPER_SEQUENCE_HXX_\n\n#ifndef INCLUDED_ALGORITHM\n#include <algorithm> \/\/ copy algorithm\n#define INCLUDED_ALGORITHM\n#endif\n\n#ifndef _COM_SUN_STAR_UNO_SEQUENCE_HXX_\n#include <com\/sun\/star\/uno\/Sequence.hxx>\n#endif\n\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n\n#ifndef INCLUDED_COMPHELPERDLLAPI_H\n#include \"comphelper\/comphelperdllapi.h\"\n#endif\n\n#include <vector>\n\n\/\/.........................................................................\nnamespace comphelper\n{\n\/\/.........................................................................\n\n    namespace staruno   = ::com::sun::star::uno;\n\n    \/\/-------------------------------------------------------------------------\n    \/** search the given string within the given sequence, return the positions where it was found.\n        if _bOnlyFirst is sal_True, only the first occurence will be returned.\n    *\/\n    COMPHELPER_DLLPUBLIC staruno::Sequence<sal_Int16> findValue(const staruno::Sequence< ::rtl::OUString >& _rList, const ::rtl::OUString& _rValue, sal_Bool _bOnlyFirst = sal_False);\n\n    \/\/-------------------------------------------------------------------------\n    namespace internal\n    {\n        template <class T>\n        void implCopySequence(const T* _pSource, T*& _pDest, sal_Int32 _nSourceLen)\n        {\n            for (sal_Int32 i=0; i<_nSourceLen; ++i, ++_pSource, ++_pDest)\n                *_pDest = *_pSource;\n        }\n    }\n    \/\/-------------------------------------------------------------------------\n    \/\/\/ concat two sequences\n    template <class T>\n     staruno::Sequence<T> concatSequences(const staruno::Sequence<T>& _rLeft, const staruno::Sequence<T>& _rRight)\n    {\n        sal_Int32 nLeft(_rLeft.getLength()), nRight(_rRight.getLength());\n        const T* pLeft = _rLeft.getConstArray();\n        const T* pRight = _rRight.getConstArray();\n\n        sal_Int32 nReturnLen(nLeft + nRight);\n        staruno::Sequence<T> aReturn(nReturnLen);\n        T* pReturn = aReturn.getArray();\n\n        internal::implCopySequence(pLeft, pReturn, nLeft);\n        internal::implCopySequence(pRight, pReturn, nRight);\n\n        return aReturn;\n    }\n\n    \/\/-------------------------------------------------------------------------\n    \/\/\/ concat three sequences\n    template <class T>\n    staruno::Sequence<T> concatSequences(const staruno::Sequence<T>& _rLeft, const staruno::Sequence<T>& _rMiddle, const staruno::Sequence<T>& _rRight)\n    {\n        sal_Int32 nLeft(_rLeft.getLength()), nMiddle(_rMiddle.getLength()), nRight(_rRight.getLength());\n        const T* pLeft = _rLeft.getConstArray();\n        const T* pMiddle = _rMiddle.getConstArray();\n        const T* pRight = _rRight.getConstArray();\n\n        sal_Int32 nReturnLen(nLeft + nMiddle + nRight);\n        staruno::Sequence<T> aReturn(nReturnLen);\n        T* pReturn = aReturn.getArray();\n\n        internal::implCopySequence(pLeft, pReturn, nLeft);\n        internal::implCopySequence(pMiddle, pReturn, nMiddle);\n        internal::implCopySequence(pRight, pReturn, nRight);\n\n        return aReturn;\n    }\n\n    \/\/-------------------------------------------------------------------------\n    \/\/\/ remove a specified element from a sequences\n    template<class T>\n    void removeElementAt(staruno::Sequence<T>& _rSeq, sal_Int32 _nPos)\n    {\n        sal_uInt32 nLength = _rSeq.getLength();\n\n        OSL_ENSURE(0 <= _nPos && (sal_uInt32)_nPos < nLength, \"invalid index\");\n\n        for (sal_uInt32 i = (sal_uInt32)_nPos + 1; i < nLength; ++i)\n        {\n            _rSeq[i-1] = _rSeq[i];\n        }\n\n        _rSeq.realloc(nLength-1);\n    }\n\n    \/\/=====================================================================\n    \/\/= iterating through sequences\n    \/\/=====================================================================\n    class SAL_NO_VTABLE IIterator\n    {\n    public:\n        virtual sal_Bool hasMoreElements() const = 0;\n        virtual ::com::sun::star::uno::Any  nextElement() = 0;\n    };\n    \/** a helper class for iterating through a sequence\n    *\/\n    template <class TYPE>\n    class OSequenceIterator : public IIterator\n    {\n        const TYPE* m_pElements;\n        sal_Int32   m_nLen;\n        const TYPE* m_pCurrent;\n\n    public:\n        \/** contrcuct a sequence iterator from a sequence\n        *\/\n        OSequenceIterator(const ::com::sun::star::uno::Sequence< TYPE >& _rSeq);\n        \/** contrcuct a sequence iterator from a Any containing a sequence\n        *\/\n        OSequenceIterator(const ::com::sun::star::uno::Any& _rSequenceAny);\n\n        virtual sal_Bool hasMoreElements() const;\n        virtual ::com::sun::star::uno::Any  nextElement();\n\n    protected:\n        void construct(const ::com::sun::star::uno::Sequence< TYPE >& _rSeq);\n    };\n\n    \/\/---------------------------------------------------------------------\n    template <class TYPE>\n    OSequenceIterator<TYPE>::OSequenceIterator(const ::com::sun::star::uno::Sequence< TYPE >& _rSeq)\n        :m_pElements(NULL)\n        ,m_nLen(0)\n        ,m_pCurrent(NULL)\n    {\n        construct(_rSeq);\n    }\n\n    \/\/---------------------------------------------------------------------\n    template <class TYPE>\n    OSequenceIterator<TYPE>::OSequenceIterator(const ::com::sun::star::uno::Any& _rSequenceAny)\n        :m_pElements(NULL)\n        ,m_nLen(0)\n        ,m_pCurrent(NULL)\n    {\n        ::com::sun::star::uno::Sequence< TYPE > aContainer;\n    #ifdef DBG_UTIL\n        sal_Bool bSuccess =\n    #endif\n        _rSequenceAny >>= aContainer;\n    #ifdef DBG_UTIL\n        OSL_ENSURE(bSuccess, \"OSequenceIterator::OSequenceIterator: invalid Any!\");\n    #endif\n        construct(aContainer);\n    }\n\n    \/\/---------------------------------------------------------------------\n    template <class TYPE>\n    void OSequenceIterator<TYPE>::construct(const ::com::sun::star::uno::Sequence< TYPE >& _rSeq)\n    {\n        m_pElements = _rSeq.getConstArray();\n        m_nLen = _rSeq.getLength();\n        m_pCurrent = m_pElements;\n    }\n\n    \/\/---------------------------------------------------------------------\n    template <class TYPE>\n    sal_Bool OSequenceIterator<TYPE>::hasMoreElements() const\n    {\n        return m_pCurrent - m_pElements < m_nLen;\n    }\n\n    \/\/---------------------------------------------------------------------\n    template <class TYPE>\n    ::com::sun::star::uno::Any OSequenceIterator<TYPE>::nextElement()\n    {\n        return ::com::sun::star::uno::makeAny(*m_pCurrent++);\n    }\n\n    \/\/-------------------------------------------------------------------------\n    \/** Copy from a plain C\/C++ array into a Sequence.\n\n        @tpl SrcType\n        Array element type. Must be assignable to DstType\n\n        @tpl DstType\n        Sequence element type. Must be assignable from SrcType\n\n        @param i_pArray\n        Valid pointer to at least num elements of type SrcType\n\n        @param nNum\n        Number of array elements to copy\n\n        @return the resulting Sequence\n\n        @attention when copying from e.g. a double array to a\n        Sequence<int>, no proper rounding will be performed, but the\n        values will be truncated. There's currently no measure to\n        prevent or detect precision loss, overflow or truncation.\n     *\/\n    template < typename DstType, typename SrcType >\n    ::com::sun::star::uno::Sequence< DstType > arrayToSequence( const SrcType* i_pArray, sal_Int32 nNum )\n    {\n        ::com::sun::star::uno::Sequence< DstType > result( nNum );\n        ::std::copy( i_pArray, i_pArray+nNum, result.getArray() );\n        return result;\n    }\n\n    \/\/-------------------------------------------------------------------------\n    \/** Copy from a Sequence into a plain C\/C++ array\n\n        @tpl SrcType\n        Sequence element type. Must be assignable to DstType\n\n        @tpl DstType\n        Array element type. Must be assignable from SrcType\n\n        @param io_pArray\n        Valid pointer to at least i_Sequence.getLength() elements of\n        type DstType\n\n        @param i_Sequence\n        Reference to a Sequence of SrcType elements\n\n        @return a pointer to the array\n\n        @attention when copying from e.g. a Sequence<double> to an int\n        array, no proper rounding will be performed, but the values\n        will be truncated. There's currently no measure to prevent or\n        detect precision loss, overflow or truncation.\n     *\/\n    template < typename DstType, typename SrcType >\n    DstType* sequenceToArray( DstType* io_pArray, const ::com::sun::star::uno::Sequence< SrcType >& i_Sequence )\n    {\n        ::std::copy( i_Sequence.getConstArray(), i_Sequence.getConstArray()+i_Sequence.getLength(), io_pArray );\n        return io_pArray;\n    }\n\n    \/\/-------------------------------------------------------------------------\n    \/** Copy from a container into a Sequence\n\n        @tpl SrcType\n        Container type. This type must fulfill the STL container\n        concept, in particular, the size(), begin() and end() methods\n        must be available and have the usual semantics.\n\n        @tpl DstType\n        Sequence element type. Must be assignable from SrcType's\n        elements\n\n        @param i_Container\n        Reference to the input contain with elements of type SrcType\n\n        @return the generated Sequence\n\n        @attention this function always performs a copy. Furthermore,\n        when copying from e.g. a vector<double> to a Sequence<int>, no\n        proper rounding will be performed, but the values will be\n        truncated. There's currently no measure to prevent or detect\n        precision loss, overflow or truncation.\n     *\/\n    template < typename DstType, typename SrcType >\n    ::com::sun::star::uno::Sequence< DstType > containerToSequence( const SrcType& i_Container )\n    {\n        ::com::sun::star::uno::Sequence< DstType > result( i_Container.size() );\n        ::std::copy( i_Container.begin(), i_Container.end(), result.getArray() );\n        return result;\n    }\n\n    template <typename T>\n    inline ::com::sun::star::uno::Sequence<T> containerToSequence(\n        ::std::vector<T> const& v )\n    {\n        return ::com::sun::star::uno::Sequence<T>(\n            v.empty() ? 0 : &v[0], static_cast<sal_Int32>(v.size()) );\n    }\n\n    \/\/-------------------------------------------------------------------------\n    \/** Copy from a Sequence into a container\n\n        @tpl SrcType\n        Sequence element type. Must be assignable to SrcType's\n        elements\n\n        @tpl DstType\n        Container type. This type must fulfill the STL container and\n        sequence concepts, in particular, the begin(), end() and the\n        unary constructor DstType(int) methods must be available and\n        have the usual semantics.\n\n        @param i_Sequence\n        Reference to a Sequence of SrcType elements\n\n        @return a pointer to the generated container\n\n        @attention this function always performs a copy. Furthermore,\n        when copying from e.g. a Sequence<double> to a vector<int>, no\n        proper rounding will be performed, but the values will be\n        truncated. There's currently no measure to prevent or detect\n        precision loss, overflow or truncation.\n     *\/\n    template < typename DstType, typename SrcType >\n    DstType sequenceToContainer( const ::com::sun::star::uno::Sequence< SrcType >& i_Sequence )\n    {\n        DstType result( i_Sequence.getLength() );\n        ::std::copy( i_Sequence.getConstArray(), i_Sequence.getConstArray()+i_Sequence.getLength(), result.begin() );\n        return result;\n    }\n\n\/\/.........................................................................\n}   \/\/ namespace comphelper\n\/\/.........................................................................\n\n\n#endif \/\/ _COMPHELPER_SEQUENCE_HXX_\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"findCollidingNames.h\"\n#include \"symtab.h\"\n#include \"stringutil.h\"\n\n\/* Goal:\n * Find symbols that have names which already exist and munge those.\n * Strategy:\n * Keep track of all function symbols, type symbols and variable symbols in vector structures.\n * Search those structures for colliding names and change the cname to a unique name.\n * Initially all the cnames are the same as name; then we change them as needed.\n * \n *\/\n  \n\nvoid FindCollidingNames::processSymbol(Symbol* sym) {\n  if (_adhoc_to_uniform_mangling) {\n    if (FnSymbol* fnsym = dynamic_cast<FnSymbol*>(sym)) {\n      fnsyms.add(fnsym);\n    }\n    if (TypeSymbol* typesym = dynamic_cast<TypeSymbol*>(sym)) {\n      typesyms.add(typesym); \n    }\n    if (VarSymbol* varsym = dynamic_cast<VarSymbol*>(sym)) {\n      if (varsym->parentScope->type == SCOPE_MODULE) {\n        globalvars.add(varsym);\n      }\n    }\n  }\n}\n\nvoid FindCollidingNames::run(ModuleList* moduleList) {\n  SymtabTraversal::run(moduleList);\n  \/\/RED: for test purposes only\n  fnsyms.quickSort(0, fnsyms.length()-1);\n}\n\n\n<commit_msg>Forgot to comment out some stuff.<commit_after>#include \"findCollidingNames.h\"\n#include \"symtab.h\"\n#include \"stringutil.h\"\n\n\/* Goal:\n * Find symbols that have names which already exist and munge those.\n * Strategy:\n * Keep track of all function symbols, type symbols and variable symbols in vector structures.\n * Search those structures for colliding names and change the cname to a unique name.\n * Initially all the cnames are the same as name; then we change them as needed.\n * \n *\/\n  \n\nvoid FindCollidingNames::processSymbol(Symbol* sym) {\n  if (_adhoc_to_uniform_mangling) {\n    if (FnSymbol* fnsym = dynamic_cast<FnSymbol*>(sym)) {\n      fnsyms.add(fnsym);\n    }\n    if (TypeSymbol* typesym = dynamic_cast<TypeSymbol*>(sym)) {\n      typesyms.add(typesym); \n    }\n    if (VarSymbol* varsym = dynamic_cast<VarSymbol*>(sym)) {\n      if (varsym->parentScope->type == SCOPE_MODULE) {\n        globalvars.add(varsym);\n      }\n    }\n  }\n}\n\n\/*void FindCollidingNames::run(ModuleList* moduleList) {\n  SymtabTraversal::run(moduleList);\n  \/\/RED: for test purposes only\n  fnsyms.quickSort(0, fnsyms.length()-1);\n}*\/\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2015 The Qt Company Ltd.\n** Contact: http:\/\/www.qt.io\/licensing\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia.  For licensing terms and\n** conditions see http:\/\/www.qt.io\/licensing.  For further information\n** use the contact form at http:\/\/www.qt.io\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 or version 3 as published by the Free\n** Software Foundation and appearing in the file LICENSE.LGPLv21 and\n** LICENSE.LGPLv3 included in the packaging of this file.  Please review the\n** following information to ensure the GNU Lesser General Public License\n** requirements will be met: https:\/\/www.gnu.org\/licenses\/lgpl.html and\n** http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, 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 \"gtest\/gtest.h\"\n#include \"gmock\/gmock-matchers.h\"\n#include \"gtest-qt-printing.h\"\n\n#include <QString>\n#include <QBuffer>\n#include <QVariant>\n#include <vector>\n\n#include <cmbendcommand.h>\n#include <cmbalivecommand.h>\n#include <cmbcommands.h>\n#include <cmbregistertranslationunitsforcodecompletioncommand.h>\n#include <cmbunregistertranslationunitsforcodecompletioncommand.h>\n#include <cmbcodecompletedcommand.h>\n#include <cmbcompletecodecommand.h>\n#include <writecommandblock.h>\n#include <readcommandblock.h>\n\n#include \"gtest-qt-printing.h\"\n\nusing namespace testing;\nnamespace CodeModelBackeEndTest {\n\nclass ReadAndWriteCommandBlockTest : public ::testing::Test\n{\nprotected:\n    ReadAndWriteCommandBlockTest();\n\n    virtual void SetUp() override;\n    virtual void TearDown() override;\n\n    template<class Type>\n    void CompareCommand(const Type &command);\n\n    QBuffer buffer;\n    CodeModelBackEnd::WriteCommandBlock writeCommandBlock;\n    CodeModelBackEnd::ReadCommandBlock readCommandBlock;\n};\n\nReadAndWriteCommandBlockTest::ReadAndWriteCommandBlockTest()\n    :  writeCommandBlock(&buffer),\n       readCommandBlock(&buffer)\n{\n}\n\nvoid ReadAndWriteCommandBlockTest::SetUp()\n{\n    buffer.open(QIODevice::ReadWrite);\n    writeCommandBlock = CodeModelBackEnd::WriteCommandBlock(&buffer);\n    readCommandBlock = CodeModelBackEnd::ReadCommandBlock(&buffer);\n}\n\nvoid ReadAndWriteCommandBlockTest::TearDown()\n{\n    buffer.close();\n}\n\nTEST_F(ReadAndWriteCommandBlockTest, WriteCommandAndTestSize)\n{\n    writeCommandBlock.write(QVariant::fromValue(CodeModelBackEnd::EndCommand()));\n\n    ASSERT_EQ(50, buffer.size());\n}\n\nTEST_F(ReadAndWriteCommandBlockTest, WriteSecondCommandAndTestSize)\n{\n    writeCommandBlock.write(QVariant::fromValue(CodeModelBackEnd::EndCommand()));\n\n    ASSERT_EQ(50, buffer.size());\n}\n\nTEST_F(ReadAndWriteCommandBlockTest, WriteTwoCommandsAndTestCount)\n{\n    writeCommandBlock.write(QVariant::fromValue(CodeModelBackEnd::EndCommand()));\n    writeCommandBlock.write(QVariant::fromValue(CodeModelBackEnd::EndCommand()));\n\n    ASSERT_EQ(2, writeCommandBlock.counter());\n}\n\nTEST_F(ReadAndWriteCommandBlockTest, ReadThreeCommandsAndTestCount)\n{\n    writeCommandBlock.write(QVariant::fromValue(CodeModelBackEnd::EndCommand()));\n    writeCommandBlock.write(QVariant::fromValue(CodeModelBackEnd::EndCommand()));\n    writeCommandBlock.write(QVariant::fromValue(CodeModelBackEnd::EndCommand()));\n    buffer.seek(0);\n\n    ASSERT_EQ(3, readCommandBlock.readAll().count());\n}\n\nTEST_F(ReadAndWriteCommandBlockTest, CompareEndCommand)\n{\n    CompareCommand(CodeModelBackEnd::EndCommand());\n}\n\nTEST_F(ReadAndWriteCommandBlockTest, CompareAliveCommand)\n{\n    CompareCommand(CodeModelBackEnd::AliveCommand());\n}\n\nTEST_F(ReadAndWriteCommandBlockTest, CompareRegisterTranslationUnitForCodeCompletionCommand)\n{\n    CodeModelBackEnd::FileContainer fileContainer(Utf8StringLiteral(\"foo.cpp\"), Utf8StringLiteral(\"pathToProject.pro\"));\n    QVector<CodeModelBackEnd::FileContainer> fileContainers({fileContainer});\n\n    CompareCommand(CodeModelBackEnd::RegisterTranslationUnitForCodeCompletionCommand(fileContainers));\n}\n\nTEST_F(ReadAndWriteCommandBlockTest, CompareUnregisterFileForCodeCompletionCommand)\n{\n    CodeModelBackEnd::FileContainer fileContainer(Utf8StringLiteral(\"foo.cpp\"), Utf8StringLiteral(\"pathToProject.pro\"));\n\n    CompareCommand(CodeModelBackEnd::UnregisterTranslationUnitsForCodeCompletionCommand({fileContainer}));\n}\n\nTEST_F(ReadAndWriteCommandBlockTest, CompareCompleteCodeCommand)\n{\n    CompareCommand(CodeModelBackEnd::CompleteCodeCommand(Utf8StringLiteral(\"foo.cpp\"), 24, 33, Utf8StringLiteral(\"do what I want\")));\n}\n\nTEST_F(ReadAndWriteCommandBlockTest, CompareCodeCompletedCommand)\n{\n    QVector<CodeModelBackEnd::CodeCompletion> codeCompletions({Utf8StringLiteral(\"newFunction()\")});\n\n    CompareCommand(CodeModelBackEnd::CodeCompletedCommand(codeCompletions, 1));\n}\n\ntemplate<class Type>\nvoid ReadAndWriteCommandBlockTest::CompareCommand(const Type &command)\n{\n    const QVariant writeCommand = QVariant::fromValue(command);\n    writeCommandBlock.write(writeCommand);\n    buffer.seek(0);\n\n    const QVariant readCommand = readCommandBlock.read();\n\n    ASSERT_EQ(writeCommand, readCommand);\n}\n\n}\n\n\n<commit_msg>CmbIpc: Add unit tests for partial commands<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2015 The Qt Company Ltd.\n** Contact: http:\/\/www.qt.io\/licensing\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia.  For licensing terms and\n** conditions see http:\/\/www.qt.io\/licensing.  For further information\n** use the contact form at http:\/\/www.qt.io\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 or version 3 as published by the Free\n** Software Foundation and appearing in the file LICENSE.LGPLv21 and\n** LICENSE.LGPLv3 included in the packaging of this file.  Please review the\n** following information to ensure the GNU Lesser General Public License\n** requirements will be met: https:\/\/www.gnu.org\/licenses\/lgpl.html and\n** http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, 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 \"gtest\/gtest.h\"\n#include \"gmock\/gmock-matchers.h\"\n#include \"gtest-qt-printing.h\"\n\n#include <QString>\n#include <QBuffer>\n#include <QVariant>\n#include <vector>\n\n#include <cmbendcommand.h>\n#include <cmbalivecommand.h>\n#include <cmbcommands.h>\n#include <cmbregistertranslationunitsforcodecompletioncommand.h>\n#include <cmbunregistertranslationunitsforcodecompletioncommand.h>\n#include <cmbcodecompletedcommand.h>\n#include <cmbcompletecodecommand.h>\n#include <writecommandblock.h>\n#include <readcommandblock.h>\n\n#include \"gtest-qt-printing.h\"\n\nusing namespace testing;\nnamespace CodeModelBackeEndTest {\n\nclass ReadAndWriteCommandBlockTest : public ::testing::Test\n{\nprotected:\n    ReadAndWriteCommandBlockTest();\n\n    virtual void SetUp() override;\n    virtual void TearDown() override;\n\n    template<class Type>\n    void CompareCommand(const Type &command);\n\n    QVariant writeCodeCompletedCommand();\n    void popLastCharacterFromBuffer();\n    void pushLastCharacterToBuffer();\n    void readPartialCommand();\n\nprotected:\n    QBuffer buffer;\n    CodeModelBackEnd::WriteCommandBlock writeCommandBlock;\n    CodeModelBackEnd::ReadCommandBlock readCommandBlock;\n    char lastCharacter = 0;\n};\n\nReadAndWriteCommandBlockTest::ReadAndWriteCommandBlockTest()\n    :  writeCommandBlock(&buffer),\n       readCommandBlock(&buffer)\n{\n}\n\nvoid ReadAndWriteCommandBlockTest::SetUp()\n{\n    buffer.open(QIODevice::ReadWrite);\n    writeCommandBlock = CodeModelBackEnd::WriteCommandBlock(&buffer);\n    readCommandBlock = CodeModelBackEnd::ReadCommandBlock(&buffer);\n}\n\nvoid ReadAndWriteCommandBlockTest::TearDown()\n{\n    buffer.close();\n}\n\nTEST_F(ReadAndWriteCommandBlockTest, WriteCommandAndTestSize)\n{\n    writeCommandBlock.write(QVariant::fromValue(CodeModelBackEnd::EndCommand()));\n\n    ASSERT_EQ(50, buffer.size());\n}\n\nTEST_F(ReadAndWriteCommandBlockTest, WriteSecondCommandAndTestSize)\n{\n    writeCommandBlock.write(QVariant::fromValue(CodeModelBackEnd::EndCommand()));\n\n    ASSERT_EQ(50, buffer.size());\n}\n\nTEST_F(ReadAndWriteCommandBlockTest, WriteTwoCommandsAndTestCount)\n{\n    writeCommandBlock.write(QVariant::fromValue(CodeModelBackEnd::EndCommand()));\n    writeCommandBlock.write(QVariant::fromValue(CodeModelBackEnd::EndCommand()));\n\n    ASSERT_EQ(2, writeCommandBlock.counter());\n}\n\nTEST_F(ReadAndWriteCommandBlockTest, ReadThreeCommandsAndTestCount)\n{\n    writeCommandBlock.write(QVariant::fromValue(CodeModelBackEnd::EndCommand()));\n    writeCommandBlock.write(QVariant::fromValue(CodeModelBackEnd::EndCommand()));\n    writeCommandBlock.write(QVariant::fromValue(CodeModelBackEnd::EndCommand()));\n    buffer.seek(0);\n\n    ASSERT_EQ(3, readCommandBlock.readAll().count());\n}\n\nTEST_F(ReadAndWriteCommandBlockTest, CompareEndCommand)\n{\n    CompareCommand(CodeModelBackEnd::EndCommand());\n}\n\nTEST_F(ReadAndWriteCommandBlockTest, CompareAliveCommand)\n{\n    CompareCommand(CodeModelBackEnd::AliveCommand());\n}\n\nTEST_F(ReadAndWriteCommandBlockTest, CompareRegisterTranslationUnitForCodeCompletionCommand)\n{\n    CodeModelBackEnd::FileContainer fileContainer(Utf8StringLiteral(\"foo.cpp\"), Utf8StringLiteral(\"pathToProject.pro\"));\n    QVector<CodeModelBackEnd::FileContainer> fileContainers({fileContainer});\n\n    CompareCommand(CodeModelBackEnd::RegisterTranslationUnitForCodeCompletionCommand(fileContainers));\n}\n\nTEST_F(ReadAndWriteCommandBlockTest, CompareUnregisterFileForCodeCompletionCommand)\n{\n    CodeModelBackEnd::FileContainer fileContainer(Utf8StringLiteral(\"foo.cpp\"), Utf8StringLiteral(\"pathToProject.pro\"));\n\n    CompareCommand(CodeModelBackEnd::UnregisterTranslationUnitsForCodeCompletionCommand({fileContainer}));\n}\n\nTEST_F(ReadAndWriteCommandBlockTest, CompareCompleteCodeCommand)\n{\n    CompareCommand(CodeModelBackEnd::CompleteCodeCommand(Utf8StringLiteral(\"foo.cpp\"), 24, 33, Utf8StringLiteral(\"do what I want\")));\n}\n\nTEST_F(ReadAndWriteCommandBlockTest, CompareCodeCompletedCommand)\n{\n    QVector<CodeModelBackEnd::CodeCompletion> codeCompletions({Utf8StringLiteral(\"newFunction()\")});\n\n    CompareCommand(CodeModelBackEnd::CodeCompletedCommand(codeCompletions, 1));\n}\n\nTEST_F(ReadAndWriteCommandBlockTest, GetInvalidCommandForAPartialBuffer)\n{\n    writeCodeCompletedCommand();\n    popLastCharacterFromBuffer();\n    buffer.seek(0);\n\n    readPartialCommand();\n}\n\nTEST_F(ReadAndWriteCommandBlockTest, ReadCommandAfterInterruption)\n{\n    const QVariant writeCommand = writeCodeCompletedCommand();\n    popLastCharacterFromBuffer();\n    buffer.seek(0);\n    readPartialCommand();\n    pushLastCharacterToBuffer();\n\n    ASSERT_EQ(readCommandBlock.read(), writeCommand);\n}\n\nQVariant ReadAndWriteCommandBlockTest::writeCodeCompletedCommand()\n{\n    CodeModelBackEnd::CodeCompletedCommand command(QVector<CodeModelBackEnd::CodeCompletion>({Utf8StringLiteral(\"newFunction()\")}), 1);\n    const QVariant writeCommand = QVariant::fromValue(command);\n    writeCommandBlock.write(writeCommand);\n\n    return writeCommand;\n}\n\nvoid ReadAndWriteCommandBlockTest::popLastCharacterFromBuffer()\n{\n    auto &internalBuffer = buffer.buffer();\n    lastCharacter = internalBuffer.at(internalBuffer.size() - 1);\n    internalBuffer.chop(1);\n}\n\nvoid ReadAndWriteCommandBlockTest::pushLastCharacterToBuffer()\n{\n    buffer.buffer().push_back(lastCharacter);\n}\n\nvoid ReadAndWriteCommandBlockTest::readPartialCommand()\n{\n    QVariant readCommand = readCommandBlock.read();\n\n    ASSERT_FALSE(readCommand.isValid());\n}\n\ntemplate<class Type>\nvoid ReadAndWriteCommandBlockTest::CompareCommand(const Type &command)\n{\n    const QVariant writeCommand = QVariant::fromValue(command);\n    writeCommandBlock.write(writeCommand);\n    buffer.seek(0);\n\n    const QVariant readCommand = readCommandBlock.read();\n\n    ASSERT_EQ(writeCommand, readCommand);\n}\n\n}\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 <thrift\/lib\/cpp2\/transport\/rocket\/server\/ThriftRocketServerHandler.h>\n\n#include <memory>\n#include <utility>\n\n#include <fmt\/core.h>\n#include <folly\/ExceptionString.h>\n#include <folly\/ExceptionWrapper.h>\n#include <folly\/GLog.h>\n#include <folly\/io\/Cursor.h>\n#include <folly\/io\/IOBuf.h>\n\n#include <rsocket\/RSocketParameters.h>\n\n#include <thrift\/lib\/cpp\/TApplicationException.h>\n#include <thrift\/lib\/cpp2\/protocol\/CompactProtocol.h>\n#include <thrift\/lib\/cpp2\/server\/Cpp2ConnContext.h>\n#include <thrift\/lib\/cpp2\/server\/Cpp2Worker.h>\n#include <thrift\/lib\/cpp2\/transport\/core\/ThriftRequest.h>\n#include <thrift\/lib\/cpp2\/transport\/rocket\/PayloadUtils.h>\n#include <thrift\/lib\/cpp2\/transport\/rocket\/RocketException.h>\n#include <thrift\/lib\/cpp2\/transport\/rocket\/framing\/ErrorCode.h>\n#include <thrift\/lib\/cpp2\/transport\/rocket\/framing\/Frames.h>\n#include <thrift\/lib\/cpp2\/transport\/rocket\/server\/RocketServerConnection.h>\n#include <thrift\/lib\/cpp2\/transport\/rocket\/server\/RocketServerFrameContext.h>\n#include <thrift\/lib\/cpp2\/transport\/rocket\/server\/RocketSinkClientCallback.h>\n#include <thrift\/lib\/cpp2\/transport\/rocket\/server\/RocketStreamClientCallback.h>\n#include <thrift\/lib\/cpp2\/transport\/rocket\/server\/RocketThriftRequests.h>\n\n#include <thrift\/lib\/cpp2\/transport\/rsocket\/gen-cpp2\/Config_types.h>\n#include <thrift\/lib\/cpp2\/util\/Checksum.h>\n\nnamespace apache {\nnamespace thrift {\nnamespace rocket {\n\nthread_local uint32_t ThriftRocketServerHandler::sample_{0};\n\nnamespace {\nbool deserializeMetadata(const Payload& p, RequestRpcMetadata& metadata) {\n  try {\n    CompactProtocolReader reader;\n    reader.setInput(p.buffer());\n    metadata.read(&reader);\n    return reader.getCursorPosition() <= p.metadataSize();\n  } catch (const std::exception& ex) {\n    FB_LOG_EVERY_MS(ERROR, 10000)\n        << \"Exception on deserializing metadata: \" << folly::exceptionStr(ex);\n    return false;\n  }\n}\n\nbool isMetadataValid(const RequestRpcMetadata& metadata) {\n  return metadata.protocol_ref() && metadata.name_ref() && metadata.kind_ref();\n}\n} \/\/ namespace\n\nThriftRocketServerHandler::ThriftRocketServerHandler(\n    std::shared_ptr<Cpp2Worker> worker,\n    const folly::SocketAddress& clientAddress,\n    const folly::AsyncTransportWrapper* transport,\n    const std::vector<std::unique_ptr<SetupFrameHandler>>& handlers)\n    : worker_(std::move(worker)),\n      connectionGuard_(worker_->getActiveRequestsGuard()),\n      clientAddress_(clientAddress),\n      connContext_(\n          &clientAddress_,\n          transport,\n          nullptr, \/* eventBaseManager *\/\n          nullptr, \/* duplexChannel *\/\n          nullptr, \/* x509PeerCert *\/\n          worker_->getServer()->getClientIdentityHook()),\n      setupFrameHandlers_(handlers) {}\n\nThriftRocketServerHandler::~ThriftRocketServerHandler() {\n  if (serverConfigs_) {\n    if (auto* observer = serverConfigs_->getObserver()) {\n      observer->connClosed();\n    }\n  }\n}\n\napache::thrift::server::TServerObserver::SamplingStatus\nThriftRocketServerHandler::shouldSample() {\n  bool isServerSamplingEnabled =\n      (sampleRate_ > 0) && ((sample_++ % sampleRate_) == 0);\n\n  \/\/ TODO: determine isClientSamplingEnabled by \"client_logging_enabled\" header\n  return apache::thrift::server::TServerObserver::SamplingStatus(\n      isServerSamplingEnabled, false);\n}\n\nvoid ThriftRocketServerHandler::handleSetupFrame(\n    SetupFrame&& frame,\n    RocketServerConnection& connection) {\n  if (!frame.payload().hasNonemptyMetadata()) {\n    return connection.close(folly::make_exception_wrapper<RocketException>(\n        ErrorCode::INVALID_SETUP, \"Missing required metadata in SETUP frame\"));\n  }\n\n  folly::io::Cursor cursor(frame.payload().buffer());\n\n  \/\/ Validate Thrift major\/minor version\n  int16_t majorVersion;\n  int16_t minorVersion;\n  const bool success = cursor.tryReadBE<int16_t>(majorVersion) &&\n      cursor.tryReadBE<int16_t>(minorVersion);\n  if (!success || majorVersion != 0 || minorVersion != 1) {\n    return connection.close(folly::make_exception_wrapper<RocketException>(\n        ErrorCode::INVALID_SETUP, \"Incompatible Thrift version\"));\n  }\n\n  try {\n    CompactProtocolReader reader;\n    reader.setInput(cursor);\n    auto meta = std::make_unique<RequestSetupMetadata>();\n    \/\/ Throws on read error\n    meta->read(&reader);\n    if (reader.getCursorPosition() > frame.payload().metadataSize()) {\n      return connection.close(folly::make_exception_wrapper<RocketException>(\n          ErrorCode::INVALID_SETUP,\n          \"Error deserializing SETUP payload: underflow\"));\n    }\n    eventBase_ = connContext_.getTransport()->getEventBase();\n    for (const auto& h : setupFrameHandlers_) {\n      auto processorInfo = h->tryHandle(*meta);\n      if (processorInfo) {\n        bool valid = true;\n        valid &= !!(cpp2Processor_ = std::move(processorInfo->cpp2Processor_));\n        valid &= !!(threadManager_ = std::move(processorInfo->threadManager_));\n        valid &= !!(serverConfigs_ = &processorInfo->serverConfigs_);\n        valid &= !!(requestsRegistry_ = processorInfo->requestsRegistry_);\n        if (!valid) {\n          return connection.close(\n              folly::make_exception_wrapper<RocketException>(\n                  ErrorCode::INVALID_SETUP,\n                  \"Error in implementation of custom connection handler.\"));\n        }\n        return;\n      }\n    }\n    \/\/ no custom frame handler was found, do the default\n    cpp2Processor_ = worker_->getServer()->getCpp2Processor();\n    threadManager_ = worker_->getServer()->getThreadManager();\n    serverConfigs_ = worker_->getServer();\n    requestsRegistry_ = worker_->getRequestsRegistry();\n    \/\/ add sampleRate\n    if (serverConfigs_) {\n      if (auto* observer = serverConfigs_->getObserver()) {\n        sampleRate_ = observer->getSampleRate();\n      }\n    }\n  } catch (const std::exception& e) {\n    return connection.close(folly::make_exception_wrapper<RocketException>(\n        ErrorCode::INVALID_SETUP,\n        fmt::format(\n            \"Error deserializing SETUP payload: {}\",\n            folly::exceptionStr(e).toStdString())));\n  }\n}\n\nvoid ThriftRocketServerHandler::handleRequestResponseFrame(\n    RequestResponseFrame&& frame,\n    RocketServerFrameContext&& context) {\n  auto makeRequestResponse = [&](RequestRpcMetadata&& md,\n                                 std::unique_ptr<folly::IOBuf> debugPayload,\n                                 const folly::RequestContext* ctx) {\n    serverConfigs_->incActiveRequests();\n    \/\/ Note, we're passing connContext by reference and rely on the next\n    \/\/ chain of ownership to keep it alive: ThriftServerRequestResponse\n    \/\/ stores RocketServerFrameContext, which keeps refcount on\n    \/\/ RocketServerConnection, which in turn keeps ThriftRocketServerHandler\n    \/\/ alive, which in turn keeps connContext_ alive.\n    return RequestsRegistry::makeRequest<ThriftServerRequestResponse>(\n        *eventBase_,\n        *serverConfigs_,\n        std::move(md),\n        connContext_,\n        *requestsRegistry_,\n        std::move(debugPayload),\n        ctx->getRootId(),\n        std::move(context));\n  };\n\n  handleRequestCommon(\n      std::move(frame.payload()), std::move(makeRequestResponse));\n}\n\nvoid ThriftRocketServerHandler::handleRequestFnfFrame(\n    RequestFnfFrame&& frame,\n    RocketServerFrameContext&& context) {\n  auto makeRequestFnf = [&](RequestRpcMetadata&& md,\n                            std::unique_ptr<folly::IOBuf> debugPayload,\n                            const folly::RequestContext* ctx) {\n    serverConfigs_->incActiveRequests();\n    \/\/ Note, we're passing connContext by reference and rely on a complex\n    \/\/ chain of ownership (see handleRequestResponseFrame for detailed\n    \/\/ explanation).\n    return RequestsRegistry::makeRequest<ThriftServerRequestFnf>(\n        *eventBase_,\n        *serverConfigs_,\n        std::move(md),\n        connContext_,\n        *requestsRegistry_,\n        std::move(debugPayload),\n        ctx->getRootId(),\n        std::move(context),\n        [keepAlive = cpp2Processor_] {});\n  };\n\n  handleRequestCommon(std::move(frame.payload()), std::move(makeRequestFnf));\n}\n\nvoid ThriftRocketServerHandler::handleRequestStreamFrame(\n    RequestStreamFrame&& frame,\n    RocketServerFrameContext&& context,\n    RocketStreamClientCallback* clientCallback) {\n  auto makeRequestStream = [&](RequestRpcMetadata&& md,\n                               std::unique_ptr<folly::IOBuf> debugPayload,\n                               const folly::RequestContext* ctx) {\n    serverConfigs_->incActiveRequests();\n    return RequestsRegistry::makeRequest<ThriftServerRequestStream>(\n        *eventBase_,\n        *serverConfigs_,\n        std::move(md),\n        connContext_,\n        *requestsRegistry_,\n        std::move(debugPayload),\n        ctx->getRootId(),\n        std::move(context),\n        clientCallback,\n        cpp2Processor_);\n  };\n\n  handleRequestCommon(std::move(frame.payload()), std::move(makeRequestStream));\n}\n\nvoid ThriftRocketServerHandler::handleRequestChannelFrame(\n    RequestChannelFrame&& frame,\n    RocketServerFrameContext&& context,\n    RocketSinkClientCallback* clientCallback) {\n  auto makeRequestSink = [&](RequestRpcMetadata&& md,\n                             std::unique_ptr<folly::IOBuf> debugPayload,\n                             const folly::RequestContext* ctx) {\n    serverConfigs_->incActiveRequests();\n    return RequestsRegistry::makeRequest<ThriftServerRequestSink>(\n        *eventBase_,\n        *serverConfigs_,\n        std::move(md),\n        connContext_,\n        *requestsRegistry_,\n        std::move(debugPayload),\n        ctx->getRootId(),\n        std::move(context),\n        clientCallback,\n        cpp2Processor_);\n  };\n\n  handleRequestCommon(std::move(frame.payload()), std::move(makeRequestSink));\n}\n\ntemplate <class F>\nvoid ThriftRocketServerHandler::handleRequestCommon(\n    Payload&& payload,\n    F&& makeRequest) {\n  auto baseReqCtx = cpp2Processor_->getBaseContextForRequest();\n  auto rootid = requestsRegistry_->genRootId();\n  auto reqCtx = baseReqCtx\n      ? folly::RequestContext::copyAsRoot(*baseReqCtx, rootid)\n      : std::make_shared<folly::RequestContext>(rootid);\n  folly::RequestContextScopeGuard rctx(reqCtx);\n\n  RequestRpcMetadata metadata;\n  const bool parseOk = payload.metadataSize() <= payload.buffer()->length() &&\n      deserializeMetadata(payload, metadata);\n  bool validMetadata = parseOk && isMetadataValid(metadata);\n\n  \/\/ it is not safe get debug payload if metadata is not valid, the metadata\n  \/\/ size may be unbounded.\n  auto debugPayload = validMetadata\n      ? Payload::makeCombined(payload.buffer()->clone(), payload.metadataSize())\n            .data()\n      : nullptr;\n\n  if (!validMetadata) {\n    handleRequestWithBadMetadata(makeRequest(\n        std::move(metadata), std::move(debugPayload), reqCtx.get()));\n    return;\n  }\n\n  if (worker_->isStopping()) {\n    handleServerShutdown(makeRequest(\n        std::move(metadata), std::move(debugPayload), reqCtx.get()));\n    return;\n  }\n  \/\/ check if server is overloaded\n  auto errorCode = serverConfigs_->checkOverload(\n      metadata.otherMetadata_ref() ? &*metadata.otherMetadata_ref() : nullptr,\n      &*metadata.name_ref());\n  if (UNLIKELY(errorCode.has_value())) {\n    handleRequestOverloadedServer(\n        makeRequest(std::move(metadata), std::move(debugPayload), reqCtx.get()),\n        errorCode.value());\n    return;\n  }\n\n  auto data = std::move(payload).data();\n  \/\/ uncompress the request if it's compressed\n  if (auto compression = metadata.compression_ref()) {\n    auto result =\n        rocket::uncompressPayload(*metadata.compression_ref(), std::move(data));\n    if (!result) {\n      handleDecompressionFailure(\n          makeRequest(\n              std::move(metadata), std::move(debugPayload), reqCtx.get()),\n          std::move(result).error());\n      return;\n    }\n    data = std::move(result.value());\n  }\n\n  \/\/ check the checksum\n  const bool badChecksum = metadata.crc32c_ref() &&\n      (*metadata.crc32c_ref() != checksum::crc32c(*data));\n\n  if (badChecksum) {\n    handleRequestWithBadChecksum(makeRequest(\n        std::move(metadata), std::move(debugPayload), reqCtx.get()));\n    return;\n  }\n\n  auto request =\n      makeRequest(std::move(metadata), std::move(debugPayload), reqCtx.get());\n  const auto protocolId = request->getProtoId();\n  auto* const cpp2ReqCtx = request->getRequestContext();\n  if (serverConfigs_) {\n    if (auto* observer = serverConfigs_->getObserver()) {\n      auto samplingStatus = shouldSample();\n      if (UNLIKELY(\n              samplingStatus.isEnabled() &&\n              samplingStatus.isEnabledByServer())) {\n        observer->queuedRequests(threadManager_->pendingTaskCount());\n        observer->activeRequests(serverConfigs_->getActiveRequests());\n      }\n    }\n  }\n  try {\n    cpp2Processor_->processSerializedRequest(\n        std::move(request),\n        SerializedRequest(std::move(data)),\n        protocolId,\n        cpp2ReqCtx,\n        eventBase_,\n        threadManager_.get());\n  } catch (...) {\n    LOG(DFATAL) << \"AsyncProcessor::process exception: \"\n                << folly::exceptionStr(std::current_exception());\n  }\n}\n\nvoid ThriftRocketServerHandler::handleRequestWithBadMetadata(\n    ThriftRequestCoreUniquePtr request) {\n  if (auto* observer = serverConfigs_->getObserver()) {\n    observer->taskKilled();\n  }\n  request->sendErrorWrapped(\n      folly::make_exception_wrapper<TApplicationException>(\n          TApplicationException::UNSUPPORTED_CLIENT_TYPE,\n          \"Invalid metadata object\"),\n      \"Corrupted metadata in rsocket request\");\n}\n\nvoid ThriftRocketServerHandler::handleRequestWithBadChecksum(\n    ThriftRequestCoreUniquePtr request) {\n  if (auto* observer = serverConfigs_->getObserver()) {\n    observer->taskKilled();\n  }\n  request->sendErrorWrapped(\n      folly::make_exception_wrapper<TApplicationException>(\n          TApplicationException::CHECKSUM_MISMATCH, \"Checksum mismatch\"),\n      \"Corrupted request\");\n}\n\nvoid ThriftRocketServerHandler::handleDecompressionFailure(\n    ThriftRequestCoreUniquePtr request,\n    std::string&& reason) {\n  if (auto* observer = serverConfigs_->getObserver()) {\n    observer->taskKilled();\n  }\n  request->sendErrorWrapped(\n      folly::make_exception_wrapper<TApplicationException>(\n          TApplicationException::INVALID_TRANSFORM,\n          fmt::format(\"decompression failure: {}\", std::move(reason))),\n      \"decompression failure\");\n}\n\nvoid ThriftRocketServerHandler::handleRequestOverloadedServer(\n    ThriftRequestCoreUniquePtr request,\n    const std::string& \/*errorCode*\/) {\n  if (auto* observer = serverConfigs_->getObserver()) {\n    observer->serverOverloaded();\n  }\n  request->sendErrorWrapped(\n      folly::make_exception_wrapper<TApplicationException>(\n          TApplicationException::LOADSHEDDING, \"Loadshedding request\"),\n      kOverloadedErrorCode);\n}\n\nvoid ThriftRocketServerHandler::handleServerShutdown(\n    ThriftRequestCoreUniquePtr request) {\n  if (auto* observer = serverConfigs_->getObserver()) {\n    observer->taskKilled();\n  }\n  request->sendErrorWrapped(\n      folly::make_exception_wrapper<TApplicationException>(\n          TApplicationException::LOADSHEDDING, \"server shutting down\"),\n      kQueueOverloadedErrorCode);\n}\n\nvoid ThriftRocketServerHandler::requestComplete() {\n  serverConfigs_->decActiveRequests();\n}\n} \/\/ namespace rocket\n} \/\/ namespace thrift\n} \/\/ namespace apache\n<commit_msg>Ensure each connAccepted() has a matching connClosed()<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 <thrift\/lib\/cpp2\/transport\/rocket\/server\/ThriftRocketServerHandler.h>\n\n#include <memory>\n#include <utility>\n\n#include <fmt\/core.h>\n#include <folly\/ExceptionString.h>\n#include <folly\/ExceptionWrapper.h>\n#include <folly\/GLog.h>\n#include <folly\/io\/Cursor.h>\n#include <folly\/io\/IOBuf.h>\n\n#include <rsocket\/RSocketParameters.h>\n\n#include <thrift\/lib\/cpp\/TApplicationException.h>\n#include <thrift\/lib\/cpp2\/protocol\/CompactProtocol.h>\n#include <thrift\/lib\/cpp2\/server\/Cpp2ConnContext.h>\n#include <thrift\/lib\/cpp2\/server\/Cpp2Worker.h>\n#include <thrift\/lib\/cpp2\/transport\/core\/ThriftRequest.h>\n#include <thrift\/lib\/cpp2\/transport\/rocket\/PayloadUtils.h>\n#include <thrift\/lib\/cpp2\/transport\/rocket\/RocketException.h>\n#include <thrift\/lib\/cpp2\/transport\/rocket\/framing\/ErrorCode.h>\n#include <thrift\/lib\/cpp2\/transport\/rocket\/framing\/Frames.h>\n#include <thrift\/lib\/cpp2\/transport\/rocket\/server\/RocketServerConnection.h>\n#include <thrift\/lib\/cpp2\/transport\/rocket\/server\/RocketServerFrameContext.h>\n#include <thrift\/lib\/cpp2\/transport\/rocket\/server\/RocketSinkClientCallback.h>\n#include <thrift\/lib\/cpp2\/transport\/rocket\/server\/RocketStreamClientCallback.h>\n#include <thrift\/lib\/cpp2\/transport\/rocket\/server\/RocketThriftRequests.h>\n\n#include <thrift\/lib\/cpp2\/transport\/rsocket\/gen-cpp2\/Config_types.h>\n#include <thrift\/lib\/cpp2\/util\/Checksum.h>\n\nnamespace apache {\nnamespace thrift {\nnamespace rocket {\n\nthread_local uint32_t ThriftRocketServerHandler::sample_{0};\n\nnamespace {\nbool deserializeMetadata(const Payload& p, RequestRpcMetadata& metadata) {\n  try {\n    CompactProtocolReader reader;\n    reader.setInput(p.buffer());\n    metadata.read(&reader);\n    return reader.getCursorPosition() <= p.metadataSize();\n  } catch (const std::exception& ex) {\n    FB_LOG_EVERY_MS(ERROR, 10000)\n        << \"Exception on deserializing metadata: \" << folly::exceptionStr(ex);\n    return false;\n  }\n}\n\nbool isMetadataValid(const RequestRpcMetadata& metadata) {\n  return metadata.protocol_ref() && metadata.name_ref() && metadata.kind_ref();\n}\n} \/\/ namespace\n\nThriftRocketServerHandler::ThriftRocketServerHandler(\n    std::shared_ptr<Cpp2Worker> worker,\n    const folly::SocketAddress& clientAddress,\n    const folly::AsyncTransportWrapper* transport,\n    const std::vector<std::unique_ptr<SetupFrameHandler>>& handlers)\n    : worker_(std::move(worker)),\n      connectionGuard_(worker_->getActiveRequestsGuard()),\n      clientAddress_(clientAddress),\n      connContext_(\n          &clientAddress_,\n          transport,\n          nullptr, \/* eventBaseManager *\/\n          nullptr, \/* duplexChannel *\/\n          nullptr, \/* x509PeerCert *\/\n          worker_->getServer()->getClientIdentityHook()),\n      setupFrameHandlers_(handlers) {}\n\nThriftRocketServerHandler::~ThriftRocketServerHandler() {\n  \/\/ Ensure each connAccepted() call has a matching connClosed()\n  if (auto* observer = worker_->getServer()->getObserver()) {\n    observer->connClosed();\n  }\n}\n\napache::thrift::server::TServerObserver::SamplingStatus\nThriftRocketServerHandler::shouldSample() {\n  bool isServerSamplingEnabled =\n      (sampleRate_ > 0) && ((sample_++ % sampleRate_) == 0);\n\n  \/\/ TODO: determine isClientSamplingEnabled by \"client_logging_enabled\" header\n  return apache::thrift::server::TServerObserver::SamplingStatus(\n      isServerSamplingEnabled, false);\n}\n\nvoid ThriftRocketServerHandler::handleSetupFrame(\n    SetupFrame&& frame,\n    RocketServerConnection& connection) {\n  if (!frame.payload().hasNonemptyMetadata()) {\n    return connection.close(folly::make_exception_wrapper<RocketException>(\n        ErrorCode::INVALID_SETUP, \"Missing required metadata in SETUP frame\"));\n  }\n\n  folly::io::Cursor cursor(frame.payload().buffer());\n\n  \/\/ Validate Thrift major\/minor version\n  int16_t majorVersion;\n  int16_t minorVersion;\n  const bool success = cursor.tryReadBE<int16_t>(majorVersion) &&\n      cursor.tryReadBE<int16_t>(minorVersion);\n  if (!success || majorVersion != 0 || minorVersion != 1) {\n    return connection.close(folly::make_exception_wrapper<RocketException>(\n        ErrorCode::INVALID_SETUP, \"Incompatible Thrift version\"));\n  }\n\n  try {\n    CompactProtocolReader reader;\n    reader.setInput(cursor);\n    auto meta = std::make_unique<RequestSetupMetadata>();\n    \/\/ Throws on read error\n    meta->read(&reader);\n    if (reader.getCursorPosition() > frame.payload().metadataSize()) {\n      return connection.close(folly::make_exception_wrapper<RocketException>(\n          ErrorCode::INVALID_SETUP,\n          \"Error deserializing SETUP payload: underflow\"));\n    }\n    eventBase_ = connContext_.getTransport()->getEventBase();\n    for (const auto& h : setupFrameHandlers_) {\n      auto processorInfo = h->tryHandle(*meta);\n      if (processorInfo) {\n        bool valid = true;\n        valid &= !!(cpp2Processor_ = std::move(processorInfo->cpp2Processor_));\n        valid &= !!(threadManager_ = std::move(processorInfo->threadManager_));\n        valid &= !!(serverConfigs_ = &processorInfo->serverConfigs_);\n        valid &= !!(requestsRegistry_ = processorInfo->requestsRegistry_);\n        if (!valid) {\n          return connection.close(\n              folly::make_exception_wrapper<RocketException>(\n                  ErrorCode::INVALID_SETUP,\n                  \"Error in implementation of custom connection handler.\"));\n        }\n        return;\n      }\n    }\n    \/\/ no custom frame handler was found, do the default\n    cpp2Processor_ = worker_->getServer()->getCpp2Processor();\n    threadManager_ = worker_->getServer()->getThreadManager();\n    serverConfigs_ = worker_->getServer();\n    requestsRegistry_ = worker_->getRequestsRegistry();\n    \/\/ add sampleRate\n    if (serverConfigs_) {\n      if (auto* observer = serverConfigs_->getObserver()) {\n        sampleRate_ = observer->getSampleRate();\n      }\n    }\n  } catch (const std::exception& e) {\n    return connection.close(folly::make_exception_wrapper<RocketException>(\n        ErrorCode::INVALID_SETUP,\n        fmt::format(\n            \"Error deserializing SETUP payload: {}\",\n            folly::exceptionStr(e).toStdString())));\n  }\n}\n\nvoid ThriftRocketServerHandler::handleRequestResponseFrame(\n    RequestResponseFrame&& frame,\n    RocketServerFrameContext&& context) {\n  auto makeRequestResponse = [&](RequestRpcMetadata&& md,\n                                 std::unique_ptr<folly::IOBuf> debugPayload,\n                                 const folly::RequestContext* ctx) {\n    serverConfigs_->incActiveRequests();\n    \/\/ Note, we're passing connContext by reference and rely on the next\n    \/\/ chain of ownership to keep it alive: ThriftServerRequestResponse\n    \/\/ stores RocketServerFrameContext, which keeps refcount on\n    \/\/ RocketServerConnection, which in turn keeps ThriftRocketServerHandler\n    \/\/ alive, which in turn keeps connContext_ alive.\n    return RequestsRegistry::makeRequest<ThriftServerRequestResponse>(\n        *eventBase_,\n        *serverConfigs_,\n        std::move(md),\n        connContext_,\n        *requestsRegistry_,\n        std::move(debugPayload),\n        ctx->getRootId(),\n        std::move(context));\n  };\n\n  handleRequestCommon(\n      std::move(frame.payload()), std::move(makeRequestResponse));\n}\n\nvoid ThriftRocketServerHandler::handleRequestFnfFrame(\n    RequestFnfFrame&& frame,\n    RocketServerFrameContext&& context) {\n  auto makeRequestFnf = [&](RequestRpcMetadata&& md,\n                            std::unique_ptr<folly::IOBuf> debugPayload,\n                            const folly::RequestContext* ctx) {\n    serverConfigs_->incActiveRequests();\n    \/\/ Note, we're passing connContext by reference and rely on a complex\n    \/\/ chain of ownership (see handleRequestResponseFrame for detailed\n    \/\/ explanation).\n    return RequestsRegistry::makeRequest<ThriftServerRequestFnf>(\n        *eventBase_,\n        *serverConfigs_,\n        std::move(md),\n        connContext_,\n        *requestsRegistry_,\n        std::move(debugPayload),\n        ctx->getRootId(),\n        std::move(context),\n        [keepAlive = cpp2Processor_] {});\n  };\n\n  handleRequestCommon(std::move(frame.payload()), std::move(makeRequestFnf));\n}\n\nvoid ThriftRocketServerHandler::handleRequestStreamFrame(\n    RequestStreamFrame&& frame,\n    RocketServerFrameContext&& context,\n    RocketStreamClientCallback* clientCallback) {\n  auto makeRequestStream = [&](RequestRpcMetadata&& md,\n                               std::unique_ptr<folly::IOBuf> debugPayload,\n                               const folly::RequestContext* ctx) {\n    serverConfigs_->incActiveRequests();\n    return RequestsRegistry::makeRequest<ThriftServerRequestStream>(\n        *eventBase_,\n        *serverConfigs_,\n        std::move(md),\n        connContext_,\n        *requestsRegistry_,\n        std::move(debugPayload),\n        ctx->getRootId(),\n        std::move(context),\n        clientCallback,\n        cpp2Processor_);\n  };\n\n  handleRequestCommon(std::move(frame.payload()), std::move(makeRequestStream));\n}\n\nvoid ThriftRocketServerHandler::handleRequestChannelFrame(\n    RequestChannelFrame&& frame,\n    RocketServerFrameContext&& context,\n    RocketSinkClientCallback* clientCallback) {\n  auto makeRequestSink = [&](RequestRpcMetadata&& md,\n                             std::unique_ptr<folly::IOBuf> debugPayload,\n                             const folly::RequestContext* ctx) {\n    serverConfigs_->incActiveRequests();\n    return RequestsRegistry::makeRequest<ThriftServerRequestSink>(\n        *eventBase_,\n        *serverConfigs_,\n        std::move(md),\n        connContext_,\n        *requestsRegistry_,\n        std::move(debugPayload),\n        ctx->getRootId(),\n        std::move(context),\n        clientCallback,\n        cpp2Processor_);\n  };\n\n  handleRequestCommon(std::move(frame.payload()), std::move(makeRequestSink));\n}\n\ntemplate <class F>\nvoid ThriftRocketServerHandler::handleRequestCommon(\n    Payload&& payload,\n    F&& makeRequest) {\n  auto baseReqCtx = cpp2Processor_->getBaseContextForRequest();\n  auto rootid = requestsRegistry_->genRootId();\n  auto reqCtx = baseReqCtx\n      ? folly::RequestContext::copyAsRoot(*baseReqCtx, rootid)\n      : std::make_shared<folly::RequestContext>(rootid);\n  folly::RequestContextScopeGuard rctx(reqCtx);\n\n  RequestRpcMetadata metadata;\n  const bool parseOk = payload.metadataSize() <= payload.buffer()->length() &&\n      deserializeMetadata(payload, metadata);\n  bool validMetadata = parseOk && isMetadataValid(metadata);\n\n  \/\/ it is not safe get debug payload if metadata is not valid, the metadata\n  \/\/ size may be unbounded.\n  auto debugPayload = validMetadata\n      ? Payload::makeCombined(payload.buffer()->clone(), payload.metadataSize())\n            .data()\n      : nullptr;\n\n  if (!validMetadata) {\n    handleRequestWithBadMetadata(makeRequest(\n        std::move(metadata), std::move(debugPayload), reqCtx.get()));\n    return;\n  }\n\n  if (worker_->isStopping()) {\n    handleServerShutdown(makeRequest(\n        std::move(metadata), std::move(debugPayload), reqCtx.get()));\n    return;\n  }\n  \/\/ check if server is overloaded\n  auto errorCode = serverConfigs_->checkOverload(\n      metadata.otherMetadata_ref() ? &*metadata.otherMetadata_ref() : nullptr,\n      &*metadata.name_ref());\n  if (UNLIKELY(errorCode.has_value())) {\n    handleRequestOverloadedServer(\n        makeRequest(std::move(metadata), std::move(debugPayload), reqCtx.get()),\n        errorCode.value());\n    return;\n  }\n\n  auto data = std::move(payload).data();\n  \/\/ uncompress the request if it's compressed\n  if (auto compression = metadata.compression_ref()) {\n    auto result =\n        rocket::uncompressPayload(*metadata.compression_ref(), std::move(data));\n    if (!result) {\n      handleDecompressionFailure(\n          makeRequest(\n              std::move(metadata), std::move(debugPayload), reqCtx.get()),\n          std::move(result).error());\n      return;\n    }\n    data = std::move(result.value());\n  }\n\n  \/\/ check the checksum\n  const bool badChecksum = metadata.crc32c_ref() &&\n      (*metadata.crc32c_ref() != checksum::crc32c(*data));\n\n  if (badChecksum) {\n    handleRequestWithBadChecksum(makeRequest(\n        std::move(metadata), std::move(debugPayload), reqCtx.get()));\n    return;\n  }\n\n  auto request =\n      makeRequest(std::move(metadata), std::move(debugPayload), reqCtx.get());\n  const auto protocolId = request->getProtoId();\n  auto* const cpp2ReqCtx = request->getRequestContext();\n  if (serverConfigs_) {\n    if (auto* observer = serverConfigs_->getObserver()) {\n      auto samplingStatus = shouldSample();\n      if (UNLIKELY(\n              samplingStatus.isEnabled() &&\n              samplingStatus.isEnabledByServer())) {\n        observer->queuedRequests(threadManager_->pendingTaskCount());\n        observer->activeRequests(serverConfigs_->getActiveRequests());\n      }\n    }\n  }\n  try {\n    cpp2Processor_->processSerializedRequest(\n        std::move(request),\n        SerializedRequest(std::move(data)),\n        protocolId,\n        cpp2ReqCtx,\n        eventBase_,\n        threadManager_.get());\n  } catch (...) {\n    LOG(DFATAL) << \"AsyncProcessor::process exception: \"\n                << folly::exceptionStr(std::current_exception());\n  }\n}\n\nvoid ThriftRocketServerHandler::handleRequestWithBadMetadata(\n    ThriftRequestCoreUniquePtr request) {\n  if (auto* observer = serverConfigs_->getObserver()) {\n    observer->taskKilled();\n  }\n  request->sendErrorWrapped(\n      folly::make_exception_wrapper<TApplicationException>(\n          TApplicationException::UNSUPPORTED_CLIENT_TYPE,\n          \"Invalid metadata object\"),\n      \"Corrupted metadata in rsocket request\");\n}\n\nvoid ThriftRocketServerHandler::handleRequestWithBadChecksum(\n    ThriftRequestCoreUniquePtr request) {\n  if (auto* observer = serverConfigs_->getObserver()) {\n    observer->taskKilled();\n  }\n  request->sendErrorWrapped(\n      folly::make_exception_wrapper<TApplicationException>(\n          TApplicationException::CHECKSUM_MISMATCH, \"Checksum mismatch\"),\n      \"Corrupted request\");\n}\n\nvoid ThriftRocketServerHandler::handleDecompressionFailure(\n    ThriftRequestCoreUniquePtr request,\n    std::string&& reason) {\n  if (auto* observer = serverConfigs_->getObserver()) {\n    observer->taskKilled();\n  }\n  request->sendErrorWrapped(\n      folly::make_exception_wrapper<TApplicationException>(\n          TApplicationException::INVALID_TRANSFORM,\n          fmt::format(\"decompression failure: {}\", std::move(reason))),\n      \"decompression failure\");\n}\n\nvoid ThriftRocketServerHandler::handleRequestOverloadedServer(\n    ThriftRequestCoreUniquePtr request,\n    const std::string& \/*errorCode*\/) {\n  if (auto* observer = serverConfigs_->getObserver()) {\n    observer->serverOverloaded();\n  }\n  request->sendErrorWrapped(\n      folly::make_exception_wrapper<TApplicationException>(\n          TApplicationException::LOADSHEDDING, \"Loadshedding request\"),\n      kOverloadedErrorCode);\n}\n\nvoid ThriftRocketServerHandler::handleServerShutdown(\n    ThriftRequestCoreUniquePtr request) {\n  if (auto* observer = serverConfigs_->getObserver()) {\n    observer->taskKilled();\n  }\n  request->sendErrorWrapped(\n      folly::make_exception_wrapper<TApplicationException>(\n          TApplicationException::LOADSHEDDING, \"server shutting down\"),\n      kQueueOverloadedErrorCode);\n}\n\nvoid ThriftRocketServerHandler::requestComplete() {\n  serverConfigs_->decActiveRequests();\n}\n} \/\/ namespace rocket\n} \/\/ namespace thrift\n} \/\/ namespace apache\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\/strings\/stringprintf.h\"\n#include \"base\/strings\/utf_string_conversions.h\"\n#include \"chrome\/browser\/extensions\/api\/media_galleries_private\/media_galleries_private_api.h\"\n#include \"chrome\/browser\/extensions\/extension_apitest.h\"\n#include \"chrome\/browser\/extensions\/extension_service.h\"\n#include \"chrome\/browser\/extensions\/extension_system.h\"\n#include \"chrome\/browser\/extensions\/extension_test_message_listener.h\"\n#include \"chrome\/browser\/storage_monitor\/storage_info.h\"\n#include \"chrome\/browser\/storage_monitor\/storage_monitor.h\"\n#include \"chrome\/browser\/storage_monitor\/test_storage_monitor.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/test\/base\/ui_test_utils.h\"\n#include \"content\/public\/browser\/render_view_host.h\"\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"content\/public\/test\/browser_test_utils.h\"\n#include \"extensions\/common\/extension.h\"\n#include \"url\/gurl.h\"\n\nnamespace {\n\n\/\/ Id of test extension from\n\/\/ chrome\/test\/data\/extensions\/api_test\/|kTestExtensionPath|\nconst char kTestExtensionId[] = \"lkegdcleigedmkiikoijjgfchobofdbe\";\nconst char kTestExtensionPath[] = \"media_galleries_private\/attachdetach\";\n\n\/\/ JS commands.\nconst char kAddAttachListenerCmd[] = \"addAttachListener()\";\nconst char kAddDetachListenerCmd[] = \"addDetachListener()\";\nconst char kAddDummyDetachListenerCmd[] = \"addDummyDetachListener()\";\nconst char kRemoveAttachListenerCmd[] = \"removeAttachListener()\";\nconst char kRemoveDummyDetachListenerCmd[] = \"removeDummyDetachListener()\";\n\n\/\/ And JS reply messages.\nconst char kAddAttachListenerOk[] = \"add_attach_ok\";\nconst char kAddDetachListenerOk[] = \"add_detach_ok\";\nconst char kAddDummyDetachListenerOk[] = \"add_dummy_detach_ok\";\nconst char kRemoveAttachListenerOk[] = \"remove_attach_ok\";\nconst char kRemoveDummyDetachListenerOk[] = \"remove_dummy_detach_ok\";\n\n\/\/ Test reply messages.\nconst char kAttachTestOk[] = \"attach_test_ok\";\nconst char kDetachTestOk[] = \"detach_test_ok\";\n\n\/\/ Dummy device properties.\nconst char kDeviceId[] = \"testDeviceId\";\nconst char kDeviceName[] = \"foobar\";\nbase::FilePath::CharType kDevicePath[] = FILE_PATH_LITERAL(\"\/qux\");\n\n}  \/\/ namespace\n\nclass MediaGalleriesPrivateApiTest : public ExtensionApiTest {\n public:\n  MediaGalleriesPrivateApiTest() {}\n  virtual ~MediaGalleriesPrivateApiTest() {}\n\n  \/\/ ExtensionApiTest overrides.\n  virtual void SetUp() OVERRIDE {\n    device_id_ = StorageInfo::MakeDeviceId(\n        StorageInfo::REMOVABLE_MASS_STORAGE_WITH_DCIM, kDeviceId);\n    ExtensionApiTest::SetUp();\n  }\n\n protected:\n  \/\/ ExtensionApiTest overrides.\n  virtual void SetUpCommandLine(CommandLine* command_line) OVERRIDE {\n    ExtensionApiTest::SetUpCommandLine(command_line);\n    command_line->AppendSwitchASCII(switches::kWhitelistedExtensionID,\n                                    kTestExtensionId);\n  }\n\n  void ChangeListener(content::RenderViewHost* host,\n                      const std::string& js_command,\n                      const std::string& ok_message) {\n    ExtensionTestMessageListener listener(ok_message, false  \/* no reply *\/);\n    host->ExecuteJavascriptInWebFrame(string16(), ASCIIToUTF16(js_command));\n    EXPECT_TRUE(listener.WaitUntilSatisfied());\n  }\n\n  void AttachDetach() {\n    Attach();\n    Detach();\n  }\n\n  void Attach() {\n    DCHECK(StorageMonitor::GetInstance()->IsInitialized());\n    StorageInfo info(device_id_, ASCIIToUTF16(kDeviceName), kDevicePath,\n                     string16(), string16(), string16(), 0);\n    StorageMonitor::GetInstance()->receiver()->ProcessAttach(info);\n    content::RunAllPendingInMessageLoop();\n  }\n\n  void Detach() {\n    DCHECK(StorageMonitor::GetInstance()->IsInitialized());\n    StorageMonitor::GetInstance()->receiver()->ProcessDetach(device_id_);\n    content::RunAllPendingInMessageLoop();\n  }\n\n private:\n  std::string device_id_;\n\n  DISALLOW_COPY_AND_ASSIGN(MediaGalleriesPrivateApiTest);\n};\n\n\/\/ Fails on official Linux bot. See http:\/\/crbug.com\/315276\n#if defined(GOOGLE_CHROME_BUILD) && defined(OS_LINUX)\n#define MAYBE_DeviceAttachDetachEvents DISABLED_DeviceAttachDetachEvents\n#else\n#define MAYBE_DeviceAttachDetachEvents DeviceAttachDetachEvents\n#endif\nIN_PROC_BROWSER_TEST_F(MediaGalleriesPrivateApiTest,\n                       MAYBE_DeviceAttachDetachEvents) {\n  \/\/ Setup.\n  TestStorageMonitor::SyncInitialize();\n  const extensions::Extension* extension =\n      LoadExtension(test_data_dir_.AppendASCII(kTestExtensionPath));\n  ASSERT_TRUE(extension);\n\n  content::RenderViewHost* host =\n      extensions::ExtensionSystem::Get(browser()->profile())->\n          process_manager()->GetBackgroundHostForExtension(extension->id())->\n              render_view_host();\n  ASSERT_TRUE(host);\n\n  \/\/ No listeners, attach and detach a couple times.\n  AttachDetach();\n  AttachDetach();\n\n  \/\/ Add attach listener.\n  ChangeListener(host, kAddAttachListenerCmd, kAddAttachListenerOk);\n\n  \/\/ Attach \/ detach\n  const std::string expect_attach_msg =\n      base::StringPrintf(\"%s,%s\", kAttachTestOk, kDeviceName);\n  ExtensionTestMessageListener attach_finished_listener(expect_attach_msg,\n                                                        false  \/* no reply *\/);\n  Attach();\n  EXPECT_TRUE(attach_finished_listener.WaitUntilSatisfied());\n  Detach();\n\n  \/\/ Attach \/ detach\n  Attach();\n  EXPECT_TRUE(attach_finished_listener.WaitUntilSatisfied());\n  \/\/ Detach\n  Detach();\n\n  \/\/ Remove attach listener.\n  ChangeListener(host, kRemoveAttachListenerCmd, kRemoveAttachListenerOk);\n\n  \/\/ No listeners, attach and detach a couple times.\n  AttachDetach();\n  AttachDetach();\n\n  \/\/ Add detach listener.\n  ChangeListener(host, kAddDummyDetachListenerCmd, kAddDummyDetachListenerOk);\n\n  \/\/ Attach \/ detach\n  Attach();\n\n  ExtensionTestMessageListener detach_finished_listener(kDetachTestOk,\n                                                        false  \/* no reply *\/);\n  Detach();\n  EXPECT_TRUE(detach_finished_listener.WaitUntilSatisfied());\n\n  \/\/ Attach \/ detach\n  Attach();\n  Detach();\n  EXPECT_TRUE(detach_finished_listener.WaitUntilSatisfied());\n\n  \/\/ Switch ok dummy detach listener for the regular one.\n  ChangeListener(host, kRemoveDummyDetachListenerCmd,\n                 kRemoveDummyDetachListenerOk);\n  ChangeListener(host, kAddDetachListenerCmd, kAddDetachListenerOk);\n\n  \/\/ Add attach listener.\n  ChangeListener(host, kAddAttachListenerCmd, kAddAttachListenerOk);\n\n  Attach();\n  EXPECT_TRUE(attach_finished_listener.WaitUntilSatisfied());\n  Detach();\n  EXPECT_TRUE(detach_finished_listener.WaitUntilSatisfied());\n\n  Attach();\n  EXPECT_TRUE(attach_finished_listener.WaitUntilSatisfied());\n  Detach();\n  EXPECT_TRUE(detach_finished_listener.WaitUntilSatisfied());\n}\n<commit_msg>Disable MediaGalleriesPrivateApiTest.DeviceAttachDetachEvents on Mac because it's flaky on the trybots.<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\/strings\/stringprintf.h\"\n#include \"base\/strings\/utf_string_conversions.h\"\n#include \"chrome\/browser\/extensions\/api\/media_galleries_private\/media_galleries_private_api.h\"\n#include \"chrome\/browser\/extensions\/extension_apitest.h\"\n#include \"chrome\/browser\/extensions\/extension_service.h\"\n#include \"chrome\/browser\/extensions\/extension_system.h\"\n#include \"chrome\/browser\/extensions\/extension_test_message_listener.h\"\n#include \"chrome\/browser\/storage_monitor\/storage_info.h\"\n#include \"chrome\/browser\/storage_monitor\/storage_monitor.h\"\n#include \"chrome\/browser\/storage_monitor\/test_storage_monitor.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/test\/base\/ui_test_utils.h\"\n#include \"content\/public\/browser\/render_view_host.h\"\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"content\/public\/test\/browser_test_utils.h\"\n#include \"extensions\/common\/extension.h\"\n#include \"url\/gurl.h\"\n\nnamespace {\n\n\/\/ Id of test extension from\n\/\/ chrome\/test\/data\/extensions\/api_test\/|kTestExtensionPath|\nconst char kTestExtensionId[] = \"lkegdcleigedmkiikoijjgfchobofdbe\";\nconst char kTestExtensionPath[] = \"media_galleries_private\/attachdetach\";\n\n\/\/ JS commands.\nconst char kAddAttachListenerCmd[] = \"addAttachListener()\";\nconst char kAddDetachListenerCmd[] = \"addDetachListener()\";\nconst char kAddDummyDetachListenerCmd[] = \"addDummyDetachListener()\";\nconst char kRemoveAttachListenerCmd[] = \"removeAttachListener()\";\nconst char kRemoveDummyDetachListenerCmd[] = \"removeDummyDetachListener()\";\n\n\/\/ And JS reply messages.\nconst char kAddAttachListenerOk[] = \"add_attach_ok\";\nconst char kAddDetachListenerOk[] = \"add_detach_ok\";\nconst char kAddDummyDetachListenerOk[] = \"add_dummy_detach_ok\";\nconst char kRemoveAttachListenerOk[] = \"remove_attach_ok\";\nconst char kRemoveDummyDetachListenerOk[] = \"remove_dummy_detach_ok\";\n\n\/\/ Test reply messages.\nconst char kAttachTestOk[] = \"attach_test_ok\";\nconst char kDetachTestOk[] = \"detach_test_ok\";\n\n\/\/ Dummy device properties.\nconst char kDeviceId[] = \"testDeviceId\";\nconst char kDeviceName[] = \"foobar\";\nbase::FilePath::CharType kDevicePath[] = FILE_PATH_LITERAL(\"\/qux\");\n\n}  \/\/ namespace\n\nclass MediaGalleriesPrivateApiTest : public ExtensionApiTest {\n public:\n  MediaGalleriesPrivateApiTest() {}\n  virtual ~MediaGalleriesPrivateApiTest() {}\n\n  \/\/ ExtensionApiTest overrides.\n  virtual void SetUp() OVERRIDE {\n    device_id_ = StorageInfo::MakeDeviceId(\n        StorageInfo::REMOVABLE_MASS_STORAGE_WITH_DCIM, kDeviceId);\n    ExtensionApiTest::SetUp();\n  }\n\n protected:\n  \/\/ ExtensionApiTest overrides.\n  virtual void SetUpCommandLine(CommandLine* command_line) OVERRIDE {\n    ExtensionApiTest::SetUpCommandLine(command_line);\n    command_line->AppendSwitchASCII(switches::kWhitelistedExtensionID,\n                                    kTestExtensionId);\n  }\n\n  void ChangeListener(content::RenderViewHost* host,\n                      const std::string& js_command,\n                      const std::string& ok_message) {\n    ExtensionTestMessageListener listener(ok_message, false  \/* no reply *\/);\n    host->ExecuteJavascriptInWebFrame(string16(), ASCIIToUTF16(js_command));\n    EXPECT_TRUE(listener.WaitUntilSatisfied());\n  }\n\n  void AttachDetach() {\n    Attach();\n    Detach();\n  }\n\n  void Attach() {\n    DCHECK(StorageMonitor::GetInstance()->IsInitialized());\n    StorageInfo info(device_id_, ASCIIToUTF16(kDeviceName), kDevicePath,\n                     string16(), string16(), string16(), 0);\n    StorageMonitor::GetInstance()->receiver()->ProcessAttach(info);\n    content::RunAllPendingInMessageLoop();\n  }\n\n  void Detach() {\n    DCHECK(StorageMonitor::GetInstance()->IsInitialized());\n    StorageMonitor::GetInstance()->receiver()->ProcessDetach(device_id_);\n    content::RunAllPendingInMessageLoop();\n  }\n\n private:\n  std::string device_id_;\n\n  DISALLOW_COPY_AND_ASSIGN(MediaGalleriesPrivateApiTest);\n};\n\n\/\/ Fails on official Linux bot. See http:\/\/crbug.com\/315276\n\/\/ Flaky on Mac trybots. See http:\/\/crbug.com\/326324\n#if (defined(GOOGLE_CHROME_BUILD) && defined(OS_LINUX)) || defined(OS_MACOSX)\n#define MAYBE_DeviceAttachDetachEvents DISABLED_DeviceAttachDetachEvents\n#else\n#define MAYBE_DeviceAttachDetachEvents DeviceAttachDetachEvents\n#endif\nIN_PROC_BROWSER_TEST_F(MediaGalleriesPrivateApiTest,\n                       MAYBE_DeviceAttachDetachEvents) {\n  \/\/ Setup.\n  TestStorageMonitor::SyncInitialize();\n  const extensions::Extension* extension =\n      LoadExtension(test_data_dir_.AppendASCII(kTestExtensionPath));\n  ASSERT_TRUE(extension);\n\n  content::RenderViewHost* host =\n      extensions::ExtensionSystem::Get(browser()->profile())->\n          process_manager()->GetBackgroundHostForExtension(extension->id())->\n              render_view_host();\n  ASSERT_TRUE(host);\n\n  \/\/ No listeners, attach and detach a couple times.\n  AttachDetach();\n  AttachDetach();\n\n  \/\/ Add attach listener.\n  ChangeListener(host, kAddAttachListenerCmd, kAddAttachListenerOk);\n\n  \/\/ Attach \/ detach\n  const std::string expect_attach_msg =\n      base::StringPrintf(\"%s,%s\", kAttachTestOk, kDeviceName);\n  ExtensionTestMessageListener attach_finished_listener(expect_attach_msg,\n                                                        false  \/* no reply *\/);\n  Attach();\n  EXPECT_TRUE(attach_finished_listener.WaitUntilSatisfied());\n  Detach();\n\n  \/\/ Attach \/ detach\n  Attach();\n  EXPECT_TRUE(attach_finished_listener.WaitUntilSatisfied());\n  \/\/ Detach\n  Detach();\n\n  \/\/ Remove attach listener.\n  ChangeListener(host, kRemoveAttachListenerCmd, kRemoveAttachListenerOk);\n\n  \/\/ No listeners, attach and detach a couple times.\n  AttachDetach();\n  AttachDetach();\n\n  \/\/ Add detach listener.\n  ChangeListener(host, kAddDummyDetachListenerCmd, kAddDummyDetachListenerOk);\n\n  \/\/ Attach \/ detach\n  Attach();\n\n  ExtensionTestMessageListener detach_finished_listener(kDetachTestOk,\n                                                        false  \/* no reply *\/);\n  Detach();\n  EXPECT_TRUE(detach_finished_listener.WaitUntilSatisfied());\n\n  \/\/ Attach \/ detach\n  Attach();\n  Detach();\n  EXPECT_TRUE(detach_finished_listener.WaitUntilSatisfied());\n\n  \/\/ Switch ok dummy detach listener for the regular one.\n  ChangeListener(host, kRemoveDummyDetachListenerCmd,\n                 kRemoveDummyDetachListenerOk);\n  ChangeListener(host, kAddDetachListenerCmd, kAddDetachListenerOk);\n\n  \/\/ Add attach listener.\n  ChangeListener(host, kAddAttachListenerCmd, kAddAttachListenerOk);\n\n  Attach();\n  EXPECT_TRUE(attach_finished_listener.WaitUntilSatisfied());\n  Detach();\n  EXPECT_TRUE(detach_finished_listener.WaitUntilSatisfied());\n\n  Attach();\n  EXPECT_TRUE(attach_finished_listener.WaitUntilSatisfied());\n  Detach();\n  EXPECT_TRUE(detach_finished_listener.WaitUntilSatisfied());\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <native\/native.h>\nusing namespace native::http;\n\nint main() {\n    http server;\n    if(server.listen(\"0.0.0.0\", 8080, [](request& req, response& res) {\n        res.set_status(200);\n        res.set_header(\"Content-Type\", \"text\/plain\");\n        res.end(\"C++ FTW\\n\");\n    })) std::cout << \"Server running at http:\/\/0.0.0.0:8080\/\" << std::endl;\n\n    return native::run();\n}\n<commit_msg>exit if webserver fails to run<commit_after>#include <iostream>\n#include <native\/native.h>\nusing namespace native::http;\n\nint main() {\n    http server;\n    if(!server.listen(\"0.0.0.0\", 8080, [](request& req, response& res) {\n        res.set_status(200);\n        res.set_header(\"Content-Type\", \"text\/plain\");\n        res.end(\"C++ FTW\\n\");\n    })) return 1; \/\/ Failed to run server.\n\n    std::cout << \"Server running at http:\/\/0.0.0.0:8080\/\" << std::endl;\n    return native::run();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <gtest\/gtest.h>\n\n#include <vector>\n\n#include <openrave-core.h>\n#include <openrave_ompl_bridge\/RRTConnectParameters.h>\n\nusing namespace openrave_ompl_bridge;\n\nclass ParameterTest : public ::testing::Test \n{\n  protected:\n    virtual void SetUp()\n    {\n      OpenRAVE::RaveInitialize();\n      parameters = RRTConnectParametersPtr(new RRTConnectParameters());\n      no_timeout = 1.0;\n      some_timeout = 2.31;\n\n      empty_joints.clear();\n      full_joints.clear();\n\n      for (unsigned int i=0; i<7; i++)\n      {\n        full_joints.push_back(1.0);\n      }\n    }\n\n    virtual void TearDown()\n    {\n      OpenRAVE::RaveDestroy();\n    }\n\n    RRTConnectParametersPtr parameters;\n    std::vector<double> empty_joints, full_joints;\n    double no_timeout, some_timeout;\n\n};\n\nTEST_F(ParameterTest, GetGoalConfiguration)\n{\n  parameters->vgoalconfig = empty_joints;\n  EXPECT_TRUE(empty_joints.size() == parameters->GetGoalConfiguration().size());\n  \n  parameters->vgoalconfig = full_joints;\n  EXPECT_TRUE(full_joints.size() == parameters->GetGoalConfiguration().size());\n  for(unsigned int i=0; i<full_joints.size(); i++)\n    EXPECT_TRUE(parameters->GetGoalConfiguration()[i] == full_joints[i]);\n}\n\nTEST_F(ParameterTest, GetStartConfiguration)\n{\n  parameters->vinitialconfig = empty_joints;\n  EXPECT_TRUE(empty_joints.size() == parameters->GetStartConfiguration().size());\n  \n  parameters->vinitialconfig = full_joints;\n  EXPECT_TRUE(full_joints.size() == parameters->GetStartConfiguration().size());\n  for(unsigned int i=0; i<full_joints.size(); i++)\n    EXPECT_TRUE(parameters->GetStartConfiguration()[i] == full_joints[i]);\n}\n\nTEST_F(ParameterTest, GetTimeLimit)\n{\n  parameters->timelimit=no_timeout;\n  EXPECT_EQ(no_timeout, parameters->GetTimeLimit());\n\n  parameters->timelimit=some_timeout;\n  EXPECT_EQ(some_timeout, parameters->GetTimeLimit());\n}\n\nTEST_F(ParameterTest, CopyTypeCast)\n{\n  parameters->timelimit = some_timeout;\n\n  RRTConnectParametersPtr pointer2(new RRTConnectParameters());\n  OpenRAVE::PlannerBase::PlannerParametersPtr base_pointer = boost::static_pointer_cast<OpenRAVE::PlannerBase::PlannerParameters>(parameters);\n\n  pointer2->copy(base_pointer);\n  EXPECT_EQ(some_timeout, pointer2->GetTimeLimit());\n}\n\n<commit_msg>Added test cases checking testing\/getting and serialization\/deserialization of parameter for path smoothing timeout.<commit_after>#include <gtest\/gtest.h>\n\n#include <vector>\n\n#include <openrave-core.h>\n#include <openrave_ompl_bridge\/RRTConnectParameters.h>\n\nusing namespace openrave_ompl_bridge;\n\nclass ParameterTest : public ::testing::Test \n{\n  protected:\n    virtual void SetUp()\n    {\n      OpenRAVE::RaveInitialize();\n      parameters = RRTConnectParametersPtr(new RRTConnectParameters());\n      no_timeout = 1.0;\n      some_timeout = 2.31;\n      some_timeout2 = 3.75;\n\n      empty_joints.clear();\n      full_joints.clear();\n\n      for (unsigned int i=0; i<7; i++)\n      {\n        full_joints.push_back(1.0);\n      }\n    }\n\n    virtual void TearDown()\n    {\n      OpenRAVE::RaveDestroy();\n    }\n\n    RRTConnectParametersPtr parameters;\n    std::vector<double> empty_joints, full_joints;\n    double no_timeout, some_timeout, some_timeout2;\n\n};\n\nTEST_F(ParameterTest, GetGoalConfiguration)\n{\n  parameters->vgoalconfig = empty_joints;\n  EXPECT_TRUE(empty_joints.size() == parameters->GetGoalConfiguration().size());\n  \n  parameters->vgoalconfig = full_joints;\n  EXPECT_TRUE(full_joints.size() == parameters->GetGoalConfiguration().size());\n  for(unsigned int i=0; i<full_joints.size(); i++)\n    EXPECT_TRUE(parameters->GetGoalConfiguration()[i] == full_joints[i]);\n}\n\nTEST_F(ParameterTest, GetStartConfiguration)\n{\n  parameters->vinitialconfig = empty_joints;\n  EXPECT_TRUE(empty_joints.size() == parameters->GetStartConfiguration().size());\n  \n  parameters->vinitialconfig = full_joints;\n  EXPECT_TRUE(full_joints.size() == parameters->GetStartConfiguration().size());\n  for(unsigned int i=0; i<full_joints.size(); i++)\n    EXPECT_TRUE(parameters->GetStartConfiguration()[i] == full_joints[i]);\n}\n\nTEST_F(ParameterTest, GetTimeLimits)\n{\n  parameters->timelimit=no_timeout;\n  parameters->smoothing_timelimit=some_timeout;\n  EXPECT_EQ(no_timeout, parameters->GetTimeLimit());\n  EXPECT_EQ(some_timeout, parameters->GetSmoothingTimeLimit());\n\n  parameters->timelimit=some_timeout;\n  parameters->smoothing_timelimit=some_timeout2;\n  EXPECT_EQ(some_timeout, parameters->GetTimeLimit());\n  EXPECT_EQ(some_timeout2, parameters->GetSmoothingTimeLimit());\n}\n\nTEST_F(ParameterTest, CopyTypeCast)\n{\n  parameters->timelimit = some_timeout;\n  parameters->smoothing_timelimit = some_timeout2;\n\n  RRTConnectParametersPtr pointer2(new RRTConnectParameters());\n  OpenRAVE::PlannerBase::PlannerParametersPtr base_pointer = boost::static_pointer_cast<OpenRAVE::PlannerBase::PlannerParameters>(parameters);\n\n  pointer2->copy(base_pointer);\n  EXPECT_EQ(some_timeout, pointer2->GetTimeLimit());\n  EXPECT_EQ(some_timeout2, pointer2->GetSmoothingTimeLimit());\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\r\n\/\/=====================================================================\/\/\r\n\/*! @file\r\n    @brief  SEEDA03 (RX64M) メイン @n\r\n\t\t\tCopyright 2017 Kunihito Hiramatsu\r\n    @author 平松邦仁 (hira@rvf-rc45.net)\r\n*\/\r\n\/\/=====================================================================\/\/\r\n#include \"common\/renesas.hpp\"\r\n\r\n#include \"common\/rspi_io.hpp\"\r\n#include \"common\/spi_io.hpp\"\r\n#include \"common\/sdc_io.hpp\"\r\n#include \"common\/command.hpp\"\r\n#include \"common\/fifo.hpp\"\r\n#include \"common\/format.hpp\"\r\n#include \"common\/input.hpp\"\r\n#include \"common\/flash_man.hpp\"\r\n#include \"common\/time.h\"\r\n\r\n#include \"chip\/LTC2348_16.hpp\"\r\n#include \"sample.hpp\"\r\n\r\n#include \"chip\/EUI_XX.hpp\"\r\n\r\nnamespace seeda {\r\n\r\n\tstatic const int seeda_version_ = 110;\r\n\tstatic const uint32_t build_id_ = B_ID;\r\n\r\n\ttypedef utils::command<256> CMD;\r\n\r\n#ifdef SEEDA\r\n\ttypedef device::PORT<device::PORT6, device::bitpos::B7> SW1;\r\n\ttypedef device::PORT<device::PORT6, device::bitpos::B6> SW2;\r\n#endif\r\n\r\n\t\/\/ Soft SDC 用　SPI 定義（SPI）\r\n#ifdef SEEDA\r\n\ttypedef device::PORT<device::PORTD, device::bitpos::B6> MISO;\r\n\ttypedef device::PORT<device::PORTD, device::bitpos::B4> MOSI;\r\n\ttypedef device::PORT<device::PORTD, device::bitpos::B5> SPCK;\r\n\ttypedef device::spi_io<MISO, MOSI, SPCK> SPI;\r\n\r\n\ttypedef device::PORT<device::PORTD, device::bitpos::B3> SDC_SELECT;\t\/\/\/< カード選択信号\r\n\ttypedef device::NULL_PORT  SDC_POWER;\t\/\/\/< カード電源制御（常に電源ＯＮ）\r\n\ttypedef device::PORT<device::PORTE, device::bitpos::B6> SDC_DETECT;\t\/\/\/< カード検出\r\n#else\r\n\t\/\/ SDC 用　SPI 定義（RSPI）\r\n\ttypedef device::rspi_io<device::RSPI> SPI;\r\n\ttypedef device::PORT<device::PORTC, device::bitpos::B4> SDC_SELECT;\t\/\/\/< カード選択信号\r\n\ttypedef device::NULL_PORT  SDC_POWER;\t\/\/\/< カード電源制御（常に電源ＯＮ）\r\n\ttypedef device::PORT<device::PORTB, device::bitpos::B7> SDC_DETECT;\t\/\/\/< カード検出\r\n#endif\r\n\ttypedef utils::sdc_io<SPI, SDC_SELECT, SDC_POWER, SDC_DETECT> SDC;\r\n\r\n#ifdef SEEDA\r\n\t\/\/ LTC2348-16 A\/D 制御ポート定義\r\n\ttypedef device::PORT<device::PORT4, device::bitpos::B0> LTC_CSN;   \/\/ P40(141)\r\n\ttypedef device::PORT<device::PORTC, device::bitpos::B6> LTC_CNV;   \/\/ PC6(61)\r\n\ttypedef device::PORT<device::PORTD, device::bitpos::B0> LTC_BUSY;  \/\/ PD0\/IRQ0(126)\r\n\ttypedef device::PORT<device::PORT5, device::bitpos::B3> LTC_PD;    \/\/ P53(53)\r\n\ttypedef device::PORT<device::PORT5, device::bitpos::B6> LTC_SDI;   \/\/ P56(50)\r\n\ttypedef device::PORT<device::PORT8, device::bitpos::B6> LTC_SCKO;  \/\/ P86(41)\r\n\ttypedef device::PORT<device::PORT8, device::bitpos::B7> LTC_SCKI;  \/\/ P87(39)\r\n\ttypedef device::PORT<device::PORT2, device::bitpos::B0> LTC_SDO0;  \/\/ P20(37)\r\n\ttypedef device::PORT<device::PORT2, device::bitpos::B1> LTC_SDO2;  \/\/ P21(36)\r\n\ttypedef device::PORT<device::PORT2, device::bitpos::B2> LTC_SDO4;  \/\/ P22(35)\r\n\ttypedef device::PORT<device::PORT2, device::bitpos::B3> LTC_SDO6;  \/\/ P23(34)\r\n\ttypedef struct chip::LTC2348_SDO_t<LTC_SCKO, LTC_SDO0, LTC_SDO2, LTC_SDO4, LTC_SDO6> LTC_SDO;\r\n\ttypedef chip::LTC2348_16<LTC_CSN, LTC_CNV, LTC_BUSY, LTC_PD, LTC_SDI, LTC_SCKI, LTC_SDO> EADC;\r\n#endif\r\n\r\n\ttypedef device::flash_io FLASH_IO;\r\n\ttypedef utils::flash_man<FLASH_IO> FLASH_MAN;\r\n\r\n\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\t\/*!\r\n\t\t@brief  SDC_IO クラスへの参照\r\n\t\t@return SDC_IO クラス\r\n\t*\/\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\tSDC& at_sdc();\r\n\r\n\r\n#ifdef SEEDA\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\t\/*!\r\n\t\t@brief  EADC クラスへの参照\r\n\t\t@return EADC クラス\r\n\t*\/\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\tEADC& at_eadc();\r\n#endif\r\n\r\n\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\t\/*!\r\n\t\t@brief  EADC サーバー\r\n\t*\/\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\tvoid eadc_server();\r\n\r\n\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\t\/*!\r\n\t\t@brief  EADC サーバー許可\r\n\t\t@param[in]\tena\t「false」の場合不許可\r\n\t*\/\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\tvoid enable_eadc_server(bool ena = true);\r\n\r\n\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\t\/*!\r\n\t\t@brief  時間の作成\r\n\t\t@param[in]\tdate\t日付\r\n\t\t@param[in]\ttime\t時間\r\n\t*\/\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\tsize_t make_time(const char* date, const char* time);\r\n\r\n\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\t\/*!\r\n\t\t@brief  GMT 時間の設定\r\n\t\t@param[in]\tt\tGMT 時間\r\n\t*\/\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\tvoid set_time(time_t t);\r\n\r\n\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\t\/*!\r\n\t\t@brief  時間の表示\r\n\t\t@param[in]\tt\t\t時間\r\n\t\t@param[in]\tdst\t\t出力文字列\r\n\t\t@param[in]\tsize\t文字列の大きさ\r\n\t\t@return 生成された文字列の長さ\r\n\t*\/\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\tint disp_time(time_t t, char* dst = nullptr, uint32_t size = 0);\r\n\r\n\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\t\/*!\r\n\t\t@brief  設定スイッチの状態を取得\r\n\t\t@return 設定スイッチの状態\r\n\t*\/\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\tuint8_t get_switch()\r\n\t{\r\n#ifdef SEEDA\r\n\t\treturn static_cast<uint8_t>(!SW1::P()) | (static_cast<uint8_t>(!SW2::P()) << 1);\r\n#else\r\n\t\treturn 0;  \/\/ for only develope mode\r\n#endif\r\n\t}\r\n\r\n\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\t\/*!\r\n\t\t@brief  A\/D サンプルの参照\r\n\t\t@param[in]\tch\tチャネル（０～７）\r\n\t\t@return A\/D サンプル\r\n\t*\/\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\tsample_t& at_sample(uint8_t ch);\r\n\r\n\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\t\/*!\r\n\t\t@brief  A\/D サンプルの取得\r\n\t\t@param[in]\tch\tチャネル（０～７）\r\n\t\t@return A\/D サンプル\r\n\t*\/\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\tconst sample_t& get_sample(uint8_t ch);\r\n\r\n\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\t\/*!\r\n\t\t@brief  内臓 A\/D 変換値の取得\r\n\t\t@param[in]\tch\tチャネル（５、６、７）\r\n\t\t@return A\/D 変換値\r\n\t*\/\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\tuint16_t get_adc(uint32_t ch);\r\n}\r\n\r\nextern \"C\" {\r\n\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\t\/*!\r\n\t\t@brief  GMT 時間の取得\r\n\t\t@return GMT 時間\r\n\t*\/\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\ttime_t get_time();\r\n\r\n};\r\n<commit_msg>update version<commit_after>#pragma once\r\n\/\/=====================================================================\/\/\r\n\/*! @file\r\n    @brief  SEEDA03 (RX64M) メイン @n\r\n\t\t\tCopyright 2017 Kunihito Hiramatsu\r\n    @author 平松邦仁 (hira@rvf-rc45.net)\r\n*\/\r\n\/\/=====================================================================\/\/\r\n#include \"common\/renesas.hpp\"\r\n\r\n#include \"common\/rspi_io.hpp\"\r\n#include \"common\/spi_io.hpp\"\r\n#include \"common\/sdc_io.hpp\"\r\n#include \"common\/command.hpp\"\r\n#include \"common\/fifo.hpp\"\r\n#include \"common\/format.hpp\"\r\n#include \"common\/input.hpp\"\r\n#include \"common\/flash_man.hpp\"\r\n#include \"common\/time.h\"\r\n\r\n#include \"chip\/LTC2348_16.hpp\"\r\n#include \"sample.hpp\"\r\n\r\n#include \"chip\/EUI_XX.hpp\"\r\n\r\nnamespace seeda {\r\n\r\n\tstatic const int seeda_version_ = 115;\r\n\tstatic const uint32_t build_id_ = B_ID;\r\n\r\n\ttypedef utils::command<256> CMD;\r\n\r\n#ifdef SEEDA\r\n\ttypedef device::PORT<device::PORT6, device::bitpos::B7> SW1;\r\n\ttypedef device::PORT<device::PORT6, device::bitpos::B6> SW2;\r\n#endif\r\n\r\n\t\/\/ Soft SDC 用　SPI 定義（SPI）\r\n#ifdef SEEDA\r\n\ttypedef device::PORT<device::PORTD, device::bitpos::B6> MISO;\r\n\ttypedef device::PORT<device::PORTD, device::bitpos::B4> MOSI;\r\n\ttypedef device::PORT<device::PORTD, device::bitpos::B5> SPCK;\r\n\ttypedef device::spi_io<MISO, MOSI, SPCK> SPI;\r\n\r\n\ttypedef device::PORT<device::PORTD, device::bitpos::B3> SDC_SELECT;\t\/\/\/< カード選択信号\r\n\ttypedef device::NULL_PORT  SDC_POWER;\t\/\/\/< カード電源制御（常に電源ＯＮ）\r\n\ttypedef device::PORT<device::PORTE, device::bitpos::B6> SDC_DETECT;\t\/\/\/< カード検出\r\n#else\r\n\t\/\/ SDC 用　SPI 定義（RSPI）\r\n\ttypedef device::rspi_io<device::RSPI> SPI;\r\n\ttypedef device::PORT<device::PORTC, device::bitpos::B4> SDC_SELECT;\t\/\/\/< カード選択信号\r\n\ttypedef device::NULL_PORT  SDC_POWER;\t\/\/\/< カード電源制御（常に電源ＯＮ）\r\n\ttypedef device::PORT<device::PORTB, device::bitpos::B7> SDC_DETECT;\t\/\/\/< カード検出\r\n#endif\r\n\ttypedef utils::sdc_io<SPI, SDC_SELECT, SDC_POWER, SDC_DETECT> SDC;\r\n\r\n#ifdef SEEDA\r\n\t\/\/ LTC2348-16 A\/D 制御ポート定義\r\n\ttypedef device::PORT<device::PORT4, device::bitpos::B0> LTC_CSN;   \/\/ P40(141)\r\n\ttypedef device::PORT<device::PORTC, device::bitpos::B6> LTC_CNV;   \/\/ PC6(61)\r\n\ttypedef device::PORT<device::PORTD, device::bitpos::B0> LTC_BUSY;  \/\/ PD0\/IRQ0(126)\r\n\ttypedef device::PORT<device::PORT5, device::bitpos::B3> LTC_PD;    \/\/ P53(53)\r\n\ttypedef device::PORT<device::PORT5, device::bitpos::B6> LTC_SDI;   \/\/ P56(50)\r\n\ttypedef device::PORT<device::PORT8, device::bitpos::B6> LTC_SCKO;  \/\/ P86(41)\r\n\ttypedef device::PORT<device::PORT8, device::bitpos::B7> LTC_SCKI;  \/\/ P87(39)\r\n\ttypedef device::PORT<device::PORT2, device::bitpos::B0> LTC_SDO0;  \/\/ P20(37)\r\n\ttypedef device::PORT<device::PORT2, device::bitpos::B1> LTC_SDO2;  \/\/ P21(36)\r\n\ttypedef device::PORT<device::PORT2, device::bitpos::B2> LTC_SDO4;  \/\/ P22(35)\r\n\ttypedef device::PORT<device::PORT2, device::bitpos::B3> LTC_SDO6;  \/\/ P23(34)\r\n\ttypedef struct chip::LTC2348_SDO_t<LTC_SCKO, LTC_SDO0, LTC_SDO2, LTC_SDO4, LTC_SDO6> LTC_SDO;\r\n\ttypedef chip::LTC2348_16<LTC_CSN, LTC_CNV, LTC_BUSY, LTC_PD, LTC_SDI, LTC_SCKI, LTC_SDO> EADC;\r\n#endif\r\n\r\n\ttypedef device::flash_io FLASH_IO;\r\n\ttypedef utils::flash_man<FLASH_IO> FLASH_MAN;\r\n\r\n\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\t\/*!\r\n\t\t@brief  SDC_IO クラスへの参照\r\n\t\t@return SDC_IO クラス\r\n\t*\/\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\tSDC& at_sdc();\r\n\r\n\r\n#ifdef SEEDA\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\t\/*!\r\n\t\t@brief  EADC クラスへの参照\r\n\t\t@return EADC クラス\r\n\t*\/\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\tEADC& at_eadc();\r\n#endif\r\n\r\n\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\t\/*!\r\n\t\t@brief  EADC サーバー\r\n\t*\/\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\tvoid eadc_server();\r\n\r\n\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\t\/*!\r\n\t\t@brief  EADC サーバー許可\r\n\t\t@param[in]\tena\t「false」の場合不許可\r\n\t*\/\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\tvoid enable_eadc_server(bool ena = true);\r\n\r\n\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\t\/*!\r\n\t\t@brief  時間の作成\r\n\t\t@param[in]\tdate\t日付\r\n\t\t@param[in]\ttime\t時間\r\n\t*\/\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\tsize_t make_time(const char* date, const char* time);\r\n\r\n\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\t\/*!\r\n\t\t@brief  GMT 時間の設定\r\n\t\t@param[in]\tt\tGMT 時間\r\n\t*\/\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\tvoid set_time(time_t t);\r\n\r\n\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\t\/*!\r\n\t\t@brief  時間の表示\r\n\t\t@param[in]\tt\t\t時間\r\n\t\t@param[in]\tdst\t\t出力文字列\r\n\t\t@param[in]\tsize\t文字列の大きさ\r\n\t\t@return 生成された文字列の長さ\r\n\t*\/\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\tint disp_time(time_t t, char* dst = nullptr, uint32_t size = 0);\r\n\r\n\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\t\/*!\r\n\t\t@brief  設定スイッチの状態を取得\r\n\t\t@return 設定スイッチの状態\r\n\t*\/\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\tuint8_t get_switch()\r\n\t{\r\n#ifdef SEEDA\r\n\t\treturn static_cast<uint8_t>(!SW1::P()) | (static_cast<uint8_t>(!SW2::P()) << 1);\r\n#else\r\n\t\treturn 0;  \/\/ for only develope mode\r\n#endif\r\n\t}\r\n\r\n\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\t\/*!\r\n\t\t@brief  A\/D サンプルの参照\r\n\t\t@param[in]\tch\tチャネル（０～７）\r\n\t\t@return A\/D サンプル\r\n\t*\/\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\tsample_t& at_sample(uint8_t ch);\r\n\r\n\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\t\/*!\r\n\t\t@brief  A\/D サンプルの取得\r\n\t\t@param[in]\tch\tチャネル（０～７）\r\n\t\t@return A\/D サンプル\r\n\t*\/\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\tconst sample_t& get_sample(uint8_t ch);\r\n\r\n\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\t\/*!\r\n\t\t@brief  内臓 A\/D 変換値の取得\r\n\t\t@param[in]\tch\tチャネル（５、６、７）\r\n\t\t@return A\/D 変換値\r\n\t*\/\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\tuint16_t get_adc(uint32_t ch);\r\n}\r\n\r\nextern \"C\" {\r\n\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\t\/*!\r\n\t\t@brief  GMT 時間の取得\r\n\t\t@return GMT 時間\r\n\t*\/\r\n\t\/\/-----------------------------------------------------------------\/\/\r\n\ttime_t get_time();\r\n\r\n};\r\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 <boost\/algorithm\/string\/join.hpp>\n#include <boost\/filesystem\/operations.hpp>\n#include <boost\/filesystem\/path.hpp>\n\n#include <osquery\/core.h>\n#include <osquery\/filesystem.h>\n#include <osquery\/logger.h>\n#include <osquery\/tables.h>\n\nnamespace pt = boost::property_tree;\n\nnamespace osquery {\nnamespace tables {\n\nconst std::string kHomebrewRoot = \"\/usr\/local\/Cellar\/\";\n\nstd::vector<std::string> getHomebrewAppInfoPlistPaths() {\n  std::vector<std::string> results;\n\n  std::vector<std::string> homebrew_apps;\n  auto status = osquery::listFilesInDirectory(kHomebrewRoot, homebrew_apps);\n  if (status.ok()) {\n    for (const auto& app_path : homebrew_apps) {\n      results.push_back(app_path);\n    }\n  } else {\n    LOG(ERROR) << \"Error listing \" << kHomebrewRoot << \": \"\n               << status.toString();\n  }\n\n  return results;\n}\n\nstd::string getHomebrewNameFromInfoPlistPath(const std::string& path) {\n  auto bits = osquery::split(path, \"\/\");\n  return bits[bits.size() - 1];\n}\n\nstd::vector<std::string> getHomebrewVersionsFromInfoPlistPath(\n    const std::string& path) {\n  std::vector<std::string> results;\n\n  std::vector<std::string> app_versions;\n  auto status = osquery::listFilesInDirectory(path, app_versions);\n  if (status.ok()) {\n    for (const auto& version_path : app_versions) {\n      auto bits = osquery::split(version_path, \"\/\");\n      results.push_back(bits[bits.size() - 1]);\n    }\n  } else {\n    LOG(ERROR) << \"Error listing \" << path << \": \" << status.toString();\n  }\n\n  return results;\n}\n\nQueryData genHomebrewPackages(QueryContext& context) {\n  QueryData results;\n\n  for (const auto& path : getHomebrewAppInfoPlistPaths()) {\n    auto versions = getHomebrewVersionsFromInfoPlistPath(path);\n    auto name = getHomebrewNameFromInfoPlistPath(path);\n    for (const auto& version : versions) {\n      \/\/ Support a many to one version to package name.\n      Row r;\n      r[\"name\"] = name;\n      r[\"path\"] = path;\n      r[\"version\"] = version;\n\n      results.push_back(r);\n    }\n  }\n  return results;\n}\n}\n}\n<commit_msg>[Fix #885] Use list directories for homebrew<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 <boost\/algorithm\/string\/join.hpp>\n#include <boost\/filesystem\/operations.hpp>\n#include <boost\/filesystem\/path.hpp>\n\n#include <osquery\/core.h>\n#include <osquery\/filesystem.h>\n#include <osquery\/logger.h>\n#include <osquery\/tables.h>\n\nnamespace fs = boost::filesystem;\nnamespace pt = boost::property_tree;\n\nnamespace osquery {\nnamespace tables {\n\nconst std::string kHomebrewRoot = \"\/usr\/local\/Cellar\/\";\n\nstd::vector<std::string> getHomebrewAppInfoPlistPaths() {\n  std::vector<std::string> results;\n  auto status = osquery::listDirectoriesInDirectory(kHomebrewRoot, results);\n  if (!status.ok()) {\n    TLOG << \"Error listing \" << kHomebrewRoot << \": \" << status.toString();\n  }\n\n  return results;\n}\n\nstd::string getHomebrewNameFromInfoPlistPath(const std::string& path) {\n  auto bits = osquery::split(path, \"\/\");\n  return bits[bits.size() - 1];\n}\n\nstd::vector<std::string> getHomebrewVersionsFromInfoPlistPath(\n    const std::string& path) {\n  std::vector<std::string> results;\n  std::vector<std::string> app_versions;\n  auto status = osquery::listDirectoriesInDirectory(path, app_versions);\n  if (status.ok()) {\n    for (const auto& version : app_versions) {\n      results.push_back(fs::path(version).filename().string());\n    }\n  } else {\n    TLOG << \"Error listing \" << path << \": \" << status.toString();\n  }\n\n  return results;\n}\n\nQueryData genHomebrewPackages(QueryContext& context) {\n  QueryData results;\n\n  for (const auto& path : getHomebrewAppInfoPlistPaths()) {\n    auto versions = getHomebrewVersionsFromInfoPlistPath(path);\n    auto name = getHomebrewNameFromInfoPlistPath(path);\n    for (const auto& version : versions) {\n      \/\/ Support a many to one version to package name.\n      Row r;\n      r[\"name\"] = name;\n      r[\"path\"] = path;\n      r[\"version\"] = version;\n\n      results.push_back(r);\n    }\n  }\n  return results;\n}\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright 2020 The TensorFlow Quantum 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_quantum\/core\/qsim\/util.h\"\n\n#include \"gtest\/gtest.h\"\n\nnamespace tfq {\nnamespace qsim {\nnamespace {\n\n}  \/\/ namespace\n}  \/\/ namespace qsim\n}  \/\/ namespace tfq\n<commit_msg>Initial test<commit_after>\/* Copyright 2020 The TensorFlow Quantum 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_quantum\/core\/qsim\/util.h\"\n\n#include \"gtest\/gtest.h\"\n\nnamespace tfq {\nnamespace qsim {\nnamespace {\n\nTEST(Util, ComputeParity) {\n  \/\/ Check parities for |11> <--> 3\n  uint64_t sample_01 = 3;\n  absl::flat_hash_set<unsigned int> parity_();\n  absl::flat_hash_set<unsigned int> parity_0({0});\n  absl::flat_hash_set<unsigned int> parity_1({1});\n  absl::flat_hash_set<unsigned int> parity_01({0, 1});\n  ASSERT_EQ(ComputeParity(parity_, sample_01), 1);\n  ASSERT_EQ(ComputeParity(parity_0, sample_01), -1);\n  ASSERT_EQ(ComputeParity(parity_1, sample_01), -1);\n  ASSERT_EQ(ComputeParity(parity_01, sample_01), 1);\n}\n\n}  \/\/ namespace\n}  \/\/ namespace qsim\n}  \/\/ namespace tfq\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n\n#include \"manager.h\"\n#include <vespa\/config\/common\/exceptions.h>\n#include <vespa\/vespalib\/util\/signalhandler.h>\n#include <vespa\/vespalib\/util\/exceptions.h>\n#include <vespa\/defaults.h>\n#include <chrono>\n#include <string>\n#include <locale.h>\n#include <unistd.h>\n#include <sys\/time.h>\n\n#include <vespa\/log\/log.h>\nLOG_SETUP(\"sentinel.config-sentinel\");\n\nusing namespace config;\n\nstatic bool stop()\n{\n    return (vespalib::SignalHandler::INT.check() ||\n            vespalib::SignalHandler::TERM.check());\n}\n\nint\nmain(int argc, char **argv)\n{\n    int c = getopt(argc, argv, \"c:\");\n    if (c != 'c') {\n        LOG(error, \"Usage: %s -c <config-id>\", argv[0]);\n        EV_STOPPING(\"config-sentinel\", \"Bad arguments on command line\");\n        return EXIT_FAILURE;\n    }\n\n    std::string configId(optarg);\n\n    const char *rootDir = getenv(\"ROOT\");\n    if (!rootDir) {\n        rootDir = vespa::Defaults::vespaHome();\n        LOG(warning, \"ROOT is not set, using %s\", rootDir);\n        setenv(\"ROOT\", rootDir, 1);\n    }\n\n    if (chdir(rootDir) == -1) {\n        LOG(error, \"Fatal: Cannot cd to $ROOT (%s)\", rootDir);\n        EV_STOPPING(\"config-sentinel\", \"Cannot cd to $ROOT\");\n        return EXIT_FAILURE;\n    }\n\n    EV_STARTED(\"config-sentinel\");\n\n    vespalib::SignalHandler::PIPE.ignore();\n    vespalib::SignalHandler::TERM.hook();\n    vespalib::SignalHandler::INT.hook();\n    vespalib::SignalHandler::CHLD.hook();\n\n    if (setenv(\"LC_ALL\", \"C\", 1) != 0) {\n        LOG(error, \"Unable to set locale\");\n        return EXIT_FAILURE;\n    }\n    setlocale(LC_ALL, \"C\");\n\n    sentinel::Env environment;\n    LOG(debug, \"Reading configuration\");\n    try {\n        environment.boot(configId);\n    } catch (vespalib::FatalException& ex) {\n        LOG(error, \"Stopping before boot complete: %s\", ex.message());\n        EV_STOPPING(\"config-sentinel\", ex.message());\n        return EXIT_FAILURE;\n    } catch (ConfigTimeoutException & ex) {\n        LOG(warning, \"Timeout getting config, please check your setup. Will exit and restart: %s\", ex.message());\n        EV_STOPPING(\"config-sentinel\", ex.message());\n        return EXIT_FAILURE;\n    } catch (InvalidConfigException& ex) {\n        LOG(error, \"Fatal: Invalid configuration, please check your setup: %s\", ex.message());\n        EV_STOPPING(\"config-sentinel\", ex.message());\n        return EXIT_FAILURE;\n    } catch (ConfigRuntimeException& ex) {\n        LOG(error, \"Fatal: Could not get config, please check your setup: %s\", ex.message());\n        EV_STOPPING(\"config-sentinel\", ex.what());\n        return EXIT_FAILURE;\n    }\n\n    sentinel::Manager manager(environment);\n    vespalib::steady_time lastTime = vespalib::steady_clock::now();\n    while (!stop()) {\n        try {\n            vespalib::SignalHandler::CHLD.clear();\n            manager.doWork();       \/\/ Check for child procs & commands\n        } catch (InvalidConfigException& ex) {\n            LOG(warning, \"Configuration problem: (ignoring): %s\", ex.message());\n        } catch (vespalib::PortListenException& ex) {\n            LOG(error, \"Fatal: %s\", ex.message());\n            EV_STOPPING(\"config-sentinel\", ex.what());\n            return EXIT_FAILURE;\n        } catch (vespalib::FatalException& ex) {\n            LOG(error, \"Fatal: %s\", ex.message());\n            EV_STOPPING(\"config-sentinel\", ex.what());\n            return EXIT_FAILURE;\n        }\n        if (vespalib::SignalHandler::CHLD.check()) {\n            continue;\n        }\n        int maxNum = 0;\n        fd_set fds;\n        FD_ZERO(&fds);\n        manager.updateActiveFdset(&fds, &maxNum);\n\n        struct timeval tv;\n        tv.tv_sec = 0;\n        tv.tv_usec = 100000;  \/\/0.1s\n\n        select(maxNum, &fds, nullptr, nullptr, &tv);\n\n        vespalib::steady_time now = vespalib::steady_clock::now();\n        if ((now - lastTime) < 10ms) {\n            std::this_thread::sleep_for(12ms); \/\/ Avoid busy looping;\n        }\n        lastTime = now;\n    }\n\n    EV_STOPPING(\"config-sentinel\", \"normal exit\");\n    bool rv = manager.terminate();\n    return rv ? EXIT_SUCCESS : EXIT_FAILURE;\n}\n<commit_msg>Include clocale instead of locale.h<commit_after>\/\/ Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n\n#include \"manager.h\"\n#include <vespa\/config\/common\/exceptions.h>\n#include <vespa\/vespalib\/util\/signalhandler.h>\n#include <vespa\/vespalib\/util\/exceptions.h>\n#include <vespa\/defaults.h>\n#include <chrono>\n#include <clocale>\n#include <string>\n#include <unistd.h>\n#include <sys\/time.h>\n\n#include <vespa\/log\/log.h>\nLOG_SETUP(\"sentinel.config-sentinel\");\n\nusing namespace config;\n\nstatic bool stop()\n{\n    return (vespalib::SignalHandler::INT.check() ||\n            vespalib::SignalHandler::TERM.check());\n}\n\nint\nmain(int argc, char **argv)\n{\n    int c = getopt(argc, argv, \"c:\");\n    if (c != 'c') {\n        LOG(error, \"Usage: %s -c <config-id>\", argv[0]);\n        EV_STOPPING(\"config-sentinel\", \"Bad arguments on command line\");\n        return EXIT_FAILURE;\n    }\n\n    std::string configId(optarg);\n\n    const char *rootDir = getenv(\"ROOT\");\n    if (!rootDir) {\n        rootDir = vespa::Defaults::vespaHome();\n        LOG(warning, \"ROOT is not set, using %s\", rootDir);\n        setenv(\"ROOT\", rootDir, 1);\n    }\n\n    if (chdir(rootDir) == -1) {\n        LOG(error, \"Fatal: Cannot cd to $ROOT (%s)\", rootDir);\n        EV_STOPPING(\"config-sentinel\", \"Cannot cd to $ROOT\");\n        return EXIT_FAILURE;\n    }\n\n    EV_STARTED(\"config-sentinel\");\n\n    vespalib::SignalHandler::PIPE.ignore();\n    vespalib::SignalHandler::TERM.hook();\n    vespalib::SignalHandler::INT.hook();\n    vespalib::SignalHandler::CHLD.hook();\n\n    if (setenv(\"LC_ALL\", \"C\", 1) != 0) {\n        LOG(error, \"Unable to set locale\");\n        return EXIT_FAILURE;\n    }\n    setlocale(LC_ALL, \"C\");\n\n    sentinel::Env environment;\n    LOG(debug, \"Reading configuration\");\n    try {\n        environment.boot(configId);\n    } catch (vespalib::FatalException& ex) {\n        LOG(error, \"Stopping before boot complete: %s\", ex.message());\n        EV_STOPPING(\"config-sentinel\", ex.message());\n        return EXIT_FAILURE;\n    } catch (ConfigTimeoutException & ex) {\n        LOG(warning, \"Timeout getting config, please check your setup. Will exit and restart: %s\", ex.message());\n        EV_STOPPING(\"config-sentinel\", ex.message());\n        return EXIT_FAILURE;\n    } catch (InvalidConfigException& ex) {\n        LOG(error, \"Fatal: Invalid configuration, please check your setup: %s\", ex.message());\n        EV_STOPPING(\"config-sentinel\", ex.message());\n        return EXIT_FAILURE;\n    } catch (ConfigRuntimeException& ex) {\n        LOG(error, \"Fatal: Could not get config, please check your setup: %s\", ex.message());\n        EV_STOPPING(\"config-sentinel\", ex.what());\n        return EXIT_FAILURE;\n    }\n\n    sentinel::Manager manager(environment);\n    vespalib::steady_time lastTime = vespalib::steady_clock::now();\n    while (!stop()) {\n        try {\n            vespalib::SignalHandler::CHLD.clear();\n            manager.doWork();       \/\/ Check for child procs & commands\n        } catch (InvalidConfigException& ex) {\n            LOG(warning, \"Configuration problem: (ignoring): %s\", ex.message());\n        } catch (vespalib::PortListenException& ex) {\n            LOG(error, \"Fatal: %s\", ex.message());\n            EV_STOPPING(\"config-sentinel\", ex.what());\n            return EXIT_FAILURE;\n        } catch (vespalib::FatalException& ex) {\n            LOG(error, \"Fatal: %s\", ex.message());\n            EV_STOPPING(\"config-sentinel\", ex.what());\n            return EXIT_FAILURE;\n        }\n        if (vespalib::SignalHandler::CHLD.check()) {\n            continue;\n        }\n        int maxNum = 0;\n        fd_set fds;\n        FD_ZERO(&fds);\n        manager.updateActiveFdset(&fds, &maxNum);\n\n        struct timeval tv;\n        tv.tv_sec = 0;\n        tv.tv_usec = 100000;  \/\/0.1s\n\n        select(maxNum, &fds, nullptr, nullptr, &tv);\n\n        vespalib::steady_time now = vespalib::steady_clock::now();\n        if ((now - lastTime) < 10ms) {\n            std::this_thread::sleep_for(12ms); \/\/ Avoid busy looping;\n        }\n        lastTime = now;\n    }\n\n    EV_STOPPING(\"config-sentinel\", \"normal exit\");\n    bool rv = manager.terminate();\n    return rv ? EXIT_SUCCESS : EXIT_FAILURE;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: groupobjects.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: dg $ $Date: 2000-11-13 12:14:15 $\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 <stdio.h>\n#include \"groupobjects.hxx\"\n#include \"comphelper\/sequence.hxx\"\n\n\/\/........................................................................\nnamespace configmgr\n{\n\n\/\/==========================================================================\n\/\/= OInnerGroupInfo\n\/\/==========================================================================\n\n\/\/ XInterface refcounting\nvoid SAL_CALL OInnerGroupInfo::acquire( ) throw ()\n{\n    BasicInnerElement::acquire();\n}\n\nvoid SAL_CALL OInnerGroupInfo::release( ) throw ()\n{\n    BasicInnerElement::release();\n}\n\n\/\/ XInterface joining\nuno::Any SAL_CALL OInnerGroupInfo::queryInterface( uno::Type const& rType ) throw (uno::RuntimeException )\n{\n    uno::Any aRet = BasicInnerElement::queryInterface(rType);\n\n    if (!aRet.hasValue())\n        aRet = BasicGroupAccess::queryInterface(rType);\n\n    if (!aRet.hasValue())\n        aRet = BasicPropertySet::queryInterface(rType);\n\n    return aRet;\n}\n\n\/\/ XTypeProvider joining\nuno::Sequence< uno::Type > SAL_CALL OInnerGroupInfo::getTypes( ) throw (uno::RuntimeException )\n{\n    return comphelper::concatSequences(BasicInnerElement::getTypes(), BasicGroupAccess::getTypes(), BasicPropertySet::getTypes());\n}\n\nuno::Sequence< sal_Int8 > SAL_CALL OInnerGroupInfo::getImplementationId( ) throw (uno::RuntimeException )\n{\n    return BasicInnerElement::getImplementationId();\n}\n\n\nNodeAccess& OInnerGroupInfo::getNodeAccess()\n{\n    return m_aAccessElement;\n}\n\nNodeGroupInfoAccess& OInnerGroupInfo::getNode()\n{\n    return m_aAccessElement;\n}\n\nNodeGroupAccess* OInnerGroupInfo::maybeGetUpdateAccess()\n{\n    return 0;\n}\n\nInnerElement& OInnerGroupInfo::getElementClass()\n{\n    return m_aAccessElement;\n}\n\n\/\/==========================================================================\n\/\/= OInnerGroupUpdate\n\/\/==========================================================================\n\n\/\/ XInterface refcounting\nvoid SAL_CALL OInnerGroupUpdate::acquire( ) throw ()\n{\n    BasicInnerElement::acquire();\n}\n\nvoid SAL_CALL OInnerGroupUpdate::release( ) throw ()\n{\n    BasicInnerElement::release();\n}\n\n\/\/ XInterface joining\nuno::Any SAL_CALL OInnerGroupUpdate::queryInterface( uno::Type const& rType ) throw (uno::RuntimeException )\n{\n    uno::Any aRet = BasicInnerElement::queryInterface(rType);\n\n    if (!aRet.hasValue())\n        aRet = BasicGroup::queryInterface(rType);\n\n    if (!aRet.hasValue())\n        aRet = BasicPropertySet::queryInterface(rType);\n\n    return aRet;\n}\n\n\/\/ XTypeProvider joining\nuno::Sequence< uno::Type > SAL_CALL OInnerGroupUpdate::getTypes( ) throw (uno::RuntimeException )\n{\n    return comphelper::concatSequences(BasicInnerElement::getTypes(), BasicGroup::getTypes(), BasicPropertySet::getTypes());\n}\n\nuno::Sequence< sal_Int8 > SAL_CALL OInnerGroupUpdate::getImplementationId( ) throw (uno::RuntimeException )\n{\n    return BasicInnerElement::getImplementationId();\n}\n\n\nNodeAccess& OInnerGroupUpdate::getNodeAccess()\n{\n    return m_aAccessElement;\n}\n\nNodeGroupInfoAccess& OInnerGroupUpdate::getNode()\n{\n    return m_aAccessElement;\n}\n\nNodeGroupAccess*    OInnerGroupUpdate::maybeGetUpdateAccess()\n{\n    return &m_aAccessElement;\n}\n\nInnerElement& OInnerGroupUpdate::getElementClass()\n{\n    return m_aAccessElement;\n}\n\n\/\/==========================================================================\n\/\/= OSetElementGroupInfo\n\/\/==========================================================================\n\n\/\/ XInterface refcounting\nvoid SAL_CALL OSetElementGroupInfo::acquire( ) throw ()\n{\n    BasicSetElement::acquire();\n}\n\nvoid SAL_CALL OSetElementGroupInfo::release( ) throw ()\n{\n    BasicSetElement::release();\n}\n\n\/\/ XInterface joining\nuno::Any SAL_CALL OSetElementGroupInfo::queryInterface( uno::Type const& rType ) throw (uno::RuntimeException )\n{\n    uno::Any aRet = BasicSetElement::queryInterface(rType);\n\n    if (!aRet.hasValue())\n        aRet = BasicGroupAccess::queryInterface(rType);\n\n    if (!aRet.hasValue())\n        aRet = BasicPropertySet::queryInterface(rType);\n\n    return aRet;\n}\n\n\/\/ XTypeProvider joining\nuno::Sequence< uno::Type > SAL_CALL OSetElementGroupInfo::getTypes( ) throw (uno::RuntimeException )\n{\n    return comphelper::concatSequences(BasicSetElement::getTypes(), BasicGroupAccess::getTypes(), BasicPropertySet::getTypes() );\n}\n\nuno::Sequence< sal_Int8 > SAL_CALL OSetElementGroupInfo::getImplementationId( ) throw (uno::RuntimeException )\n{\n    return BasicSetElement::getImplementationId();\n}\n\n\nNodeAccess& OSetElementGroupInfo::getNodeAccess()\n{\n    return m_aAccessElement;\n}\n\nNodeGroupInfoAccess& OSetElementGroupInfo::getNode()\n{\n    return m_aAccessElement;\n}\n\nNodeGroupAccess* OSetElementGroupInfo::maybeGetUpdateAccess()\n{\n    return 0;\n}\n\nSetElement& OSetElementGroupInfo::getElementClass()\n{\n    return m_aAccessElement;\n}\n\n\/\/==========================================================================\n\/\/= OSetElementGroupUpdate\n\/\/==========================================================================\n\n\/\/ XInterface refcounting\nvoid SAL_CALL OSetElementGroupUpdate::acquire( ) throw ()\n{\n    BasicSetElement::acquire();\n}\n\nvoid SAL_CALL OSetElementGroupUpdate::release( ) throw ()\n{\n    BasicSetElement::release();\n}\n\n\/\/ XInterface joining\nuno::Any SAL_CALL OSetElementGroupUpdate::queryInterface( uno::Type const& rType ) throw (uno::RuntimeException )\n{\n    uno::Any aRet = BasicSetElement::queryInterface(rType);\n\n    if (!aRet.hasValue())\n        aRet = BasicGroup::queryInterface(rType);\n\n    if (!aRet.hasValue())\n        aRet = BasicPropertySet::queryInterface(rType);\n\n    return aRet;\n}\n\n\/\/ XTypeProvider joining\nuno::Sequence< uno::Type > SAL_CALL OSetElementGroupUpdate::getTypes( ) throw (uno::RuntimeException )\n{\n    return comphelper::concatSequences(BasicSetElement::getTypes(), BasicGroup::getTypes(), BasicPropertySet::getTypes());\n}\n\nuno::Sequence< sal_Int8 > SAL_CALL OSetElementGroupUpdate::getImplementationId( ) throw (uno::RuntimeException )\n{\n    return BasicSetElement::getImplementationId();\n}\n\n\nNodeAccess& OSetElementGroupUpdate::getNodeAccess()\n{\n    return m_aAccessElement;\n}\n\nNodeGroupInfoAccess& OSetElementGroupUpdate::getNode()\n{\n    return m_aAccessElement;\n}\n\nNodeGroupAccess* OSetElementGroupUpdate::maybeGetUpdateAccess()\n{\n    return &m_aAccessElement;\n}\n\nSetElement& OSetElementGroupUpdate::getElementClass()\n{\n    return m_aAccessElement;\n}\n\n\/\/==========================================================================\n\/\/= ORootElementGroupInfo\n\/\/==========================================================================\n\n\/\/ XInterface refcounting\nvoid SAL_CALL ORootElementGroupInfo::acquire( ) throw ()\n{\n    BasicRootElement::acquire();\n}\n\nvoid SAL_CALL ORootElementGroupInfo::release( ) throw ()\n{\n    BasicRootElement::release();\n}\n\n\/\/ XInterface joining\nuno::Any SAL_CALL ORootElementGroupInfo::queryInterface( uno::Type const& rType ) throw (uno::RuntimeException )\n{\n    uno::Any aRet = BasicRootElement::queryInterface(rType);\n\n    if (!aRet.hasValue())\n        aRet = BasicGroupAccess::queryInterface(rType);\n\n    if (!aRet.hasValue())\n        aRet = BasicPropertySet::queryInterface(rType);\n\n    return aRet;\n}\n\n\/\/ XTypeProvider joining\nuno::Sequence< uno::Type > SAL_CALL ORootElementGroupInfo::getTypes( ) throw (uno::RuntimeException )\n{\n    return comphelper::concatSequences(BasicRootElement::getTypes(), BasicGroupAccess::getTypes(), BasicPropertySet::getTypes());\n}\n\nuno::Sequence< sal_Int8 > SAL_CALL ORootElementGroupInfo::getImplementationId( ) throw (uno::RuntimeException )\n{\n    return BasicRootElement::getImplementationId();\n}\n\n\nNodeAccess& ORootElementGroupInfo::getNodeAccess()\n{\n    return m_aAccessElement;\n}\n\nNodeGroupInfoAccess& ORootElementGroupInfo::getNode()\n{\n    return m_aAccessElement;\n}\n\nNodeGroupAccess* ORootElementGroupInfo::maybeGetUpdateAccess()\n{\n    return 0;\n}\n\nRootElement& ORootElementGroupInfo::getElementClass()\n{\n    return m_aAccessElement;\n}\n\n\/\/==========================================================================\n\/\/= ORootElementGroupUpdate\n\/\/==========================================================================\n\n\/\/ XInterface refcounting\nvoid SAL_CALL ORootElementGroupUpdate::acquire( ) throw ()\n{\n    BasicUpdateElement::acquire();\n}\n\nvoid SAL_CALL ORootElementGroupUpdate::release( ) throw ()\n{\n    BasicUpdateElement::release();\n}\n\n\/\/ XInterface joining\nuno::Any SAL_CALL ORootElementGroupUpdate::queryInterface( uno::Type const& rType ) throw (uno::RuntimeException )\n{\n    uno::Any aRet = BasicUpdateElement::queryInterface(rType);\n\n    if (!aRet.hasValue())\n        aRet = BasicGroup::queryInterface(rType);\n\n    if (!aRet.hasValue())\n        aRet = BasicPropertySet::queryInterface(rType);\n\n    return aRet;\n}\n\n\/\/ XTypeProvider joining\nuno::Sequence< uno::Type > SAL_CALL ORootElementGroupUpdate::getTypes( ) throw (uno::RuntimeException )\n{\n    return comphelper::concatSequences(BasicUpdateElement::getTypes(),BasicGroup::getTypes(), BasicPropertySet::getTypes());\n}\n\nuno::Sequence< sal_Int8 > SAL_CALL ORootElementGroupUpdate::getImplementationId( ) throw (uno::RuntimeException )\n{\n    return BasicUpdateElement::getImplementationId();\n}\n\n\nNodeAccess& ORootElementGroupUpdate::getNodeAccess()\n{\n    return m_aAccessElement;\n}\n\nNodeGroupInfoAccess& ORootElementGroupUpdate::getNode()\n{\n    return m_aAccessElement;\n}\n\nNodeGroupAccess*    ORootElementGroupUpdate::maybeGetUpdateAccess()\n{\n    return &m_aAccessElement;\n}\n\nUpdateRootElement& ORootElementGroupUpdate::getElementClass()\n{\n    return m_aAccessElement;\n}\n\n\/\/........................................................................\n} \/\/ namespace configmgr\n\/\/........................................................................\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.2.258); FILE MERGED 2005\/09\/05 17:03:36 rt 1.2.258.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: groupobjects.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 03:14: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#include <stdio.h>\n#include \"groupobjects.hxx\"\n#include \"comphelper\/sequence.hxx\"\n\n\/\/........................................................................\nnamespace configmgr\n{\n\n\/\/==========================================================================\n\/\/= OInnerGroupInfo\n\/\/==========================================================================\n\n\/\/ XInterface refcounting\nvoid SAL_CALL OInnerGroupInfo::acquire( ) throw ()\n{\n    BasicInnerElement::acquire();\n}\n\nvoid SAL_CALL OInnerGroupInfo::release( ) throw ()\n{\n    BasicInnerElement::release();\n}\n\n\/\/ XInterface joining\nuno::Any SAL_CALL OInnerGroupInfo::queryInterface( uno::Type const& rType ) throw (uno::RuntimeException )\n{\n    uno::Any aRet = BasicInnerElement::queryInterface(rType);\n\n    if (!aRet.hasValue())\n        aRet = BasicGroupAccess::queryInterface(rType);\n\n    if (!aRet.hasValue())\n        aRet = BasicPropertySet::queryInterface(rType);\n\n    return aRet;\n}\n\n\/\/ XTypeProvider joining\nuno::Sequence< uno::Type > SAL_CALL OInnerGroupInfo::getTypes( ) throw (uno::RuntimeException )\n{\n    return comphelper::concatSequences(BasicInnerElement::getTypes(), BasicGroupAccess::getTypes(), BasicPropertySet::getTypes());\n}\n\nuno::Sequence< sal_Int8 > SAL_CALL OInnerGroupInfo::getImplementationId( ) throw (uno::RuntimeException )\n{\n    return BasicInnerElement::getImplementationId();\n}\n\n\nNodeAccess& OInnerGroupInfo::getNodeAccess()\n{\n    return m_aAccessElement;\n}\n\nNodeGroupInfoAccess& OInnerGroupInfo::getNode()\n{\n    return m_aAccessElement;\n}\n\nNodeGroupAccess* OInnerGroupInfo::maybeGetUpdateAccess()\n{\n    return 0;\n}\n\nInnerElement& OInnerGroupInfo::getElementClass()\n{\n    return m_aAccessElement;\n}\n\n\/\/==========================================================================\n\/\/= OInnerGroupUpdate\n\/\/==========================================================================\n\n\/\/ XInterface refcounting\nvoid SAL_CALL OInnerGroupUpdate::acquire( ) throw ()\n{\n    BasicInnerElement::acquire();\n}\n\nvoid SAL_CALL OInnerGroupUpdate::release( ) throw ()\n{\n    BasicInnerElement::release();\n}\n\n\/\/ XInterface joining\nuno::Any SAL_CALL OInnerGroupUpdate::queryInterface( uno::Type const& rType ) throw (uno::RuntimeException )\n{\n    uno::Any aRet = BasicInnerElement::queryInterface(rType);\n\n    if (!aRet.hasValue())\n        aRet = BasicGroup::queryInterface(rType);\n\n    if (!aRet.hasValue())\n        aRet = BasicPropertySet::queryInterface(rType);\n\n    return aRet;\n}\n\n\/\/ XTypeProvider joining\nuno::Sequence< uno::Type > SAL_CALL OInnerGroupUpdate::getTypes( ) throw (uno::RuntimeException )\n{\n    return comphelper::concatSequences(BasicInnerElement::getTypes(), BasicGroup::getTypes(), BasicPropertySet::getTypes());\n}\n\nuno::Sequence< sal_Int8 > SAL_CALL OInnerGroupUpdate::getImplementationId( ) throw (uno::RuntimeException )\n{\n    return BasicInnerElement::getImplementationId();\n}\n\n\nNodeAccess& OInnerGroupUpdate::getNodeAccess()\n{\n    return m_aAccessElement;\n}\n\nNodeGroupInfoAccess& OInnerGroupUpdate::getNode()\n{\n    return m_aAccessElement;\n}\n\nNodeGroupAccess*    OInnerGroupUpdate::maybeGetUpdateAccess()\n{\n    return &m_aAccessElement;\n}\n\nInnerElement& OInnerGroupUpdate::getElementClass()\n{\n    return m_aAccessElement;\n}\n\n\/\/==========================================================================\n\/\/= OSetElementGroupInfo\n\/\/==========================================================================\n\n\/\/ XInterface refcounting\nvoid SAL_CALL OSetElementGroupInfo::acquire( ) throw ()\n{\n    BasicSetElement::acquire();\n}\n\nvoid SAL_CALL OSetElementGroupInfo::release( ) throw ()\n{\n    BasicSetElement::release();\n}\n\n\/\/ XInterface joining\nuno::Any SAL_CALL OSetElementGroupInfo::queryInterface( uno::Type const& rType ) throw (uno::RuntimeException )\n{\n    uno::Any aRet = BasicSetElement::queryInterface(rType);\n\n    if (!aRet.hasValue())\n        aRet = BasicGroupAccess::queryInterface(rType);\n\n    if (!aRet.hasValue())\n        aRet = BasicPropertySet::queryInterface(rType);\n\n    return aRet;\n}\n\n\/\/ XTypeProvider joining\nuno::Sequence< uno::Type > SAL_CALL OSetElementGroupInfo::getTypes( ) throw (uno::RuntimeException )\n{\n    return comphelper::concatSequences(BasicSetElement::getTypes(), BasicGroupAccess::getTypes(), BasicPropertySet::getTypes() );\n}\n\nuno::Sequence< sal_Int8 > SAL_CALL OSetElementGroupInfo::getImplementationId( ) throw (uno::RuntimeException )\n{\n    return BasicSetElement::getImplementationId();\n}\n\n\nNodeAccess& OSetElementGroupInfo::getNodeAccess()\n{\n    return m_aAccessElement;\n}\n\nNodeGroupInfoAccess& OSetElementGroupInfo::getNode()\n{\n    return m_aAccessElement;\n}\n\nNodeGroupAccess* OSetElementGroupInfo::maybeGetUpdateAccess()\n{\n    return 0;\n}\n\nSetElement& OSetElementGroupInfo::getElementClass()\n{\n    return m_aAccessElement;\n}\n\n\/\/==========================================================================\n\/\/= OSetElementGroupUpdate\n\/\/==========================================================================\n\n\/\/ XInterface refcounting\nvoid SAL_CALL OSetElementGroupUpdate::acquire( ) throw ()\n{\n    BasicSetElement::acquire();\n}\n\nvoid SAL_CALL OSetElementGroupUpdate::release( ) throw ()\n{\n    BasicSetElement::release();\n}\n\n\/\/ XInterface joining\nuno::Any SAL_CALL OSetElementGroupUpdate::queryInterface( uno::Type const& rType ) throw (uno::RuntimeException )\n{\n    uno::Any aRet = BasicSetElement::queryInterface(rType);\n\n    if (!aRet.hasValue())\n        aRet = BasicGroup::queryInterface(rType);\n\n    if (!aRet.hasValue())\n        aRet = BasicPropertySet::queryInterface(rType);\n\n    return aRet;\n}\n\n\/\/ XTypeProvider joining\nuno::Sequence< uno::Type > SAL_CALL OSetElementGroupUpdate::getTypes( ) throw (uno::RuntimeException )\n{\n    return comphelper::concatSequences(BasicSetElement::getTypes(), BasicGroup::getTypes(), BasicPropertySet::getTypes());\n}\n\nuno::Sequence< sal_Int8 > SAL_CALL OSetElementGroupUpdate::getImplementationId( ) throw (uno::RuntimeException )\n{\n    return BasicSetElement::getImplementationId();\n}\n\n\nNodeAccess& OSetElementGroupUpdate::getNodeAccess()\n{\n    return m_aAccessElement;\n}\n\nNodeGroupInfoAccess& OSetElementGroupUpdate::getNode()\n{\n    return m_aAccessElement;\n}\n\nNodeGroupAccess* OSetElementGroupUpdate::maybeGetUpdateAccess()\n{\n    return &m_aAccessElement;\n}\n\nSetElement& OSetElementGroupUpdate::getElementClass()\n{\n    return m_aAccessElement;\n}\n\n\/\/==========================================================================\n\/\/= ORootElementGroupInfo\n\/\/==========================================================================\n\n\/\/ XInterface refcounting\nvoid SAL_CALL ORootElementGroupInfo::acquire( ) throw ()\n{\n    BasicRootElement::acquire();\n}\n\nvoid SAL_CALL ORootElementGroupInfo::release( ) throw ()\n{\n    BasicRootElement::release();\n}\n\n\/\/ XInterface joining\nuno::Any SAL_CALL ORootElementGroupInfo::queryInterface( uno::Type const& rType ) throw (uno::RuntimeException )\n{\n    uno::Any aRet = BasicRootElement::queryInterface(rType);\n\n    if (!aRet.hasValue())\n        aRet = BasicGroupAccess::queryInterface(rType);\n\n    if (!aRet.hasValue())\n        aRet = BasicPropertySet::queryInterface(rType);\n\n    return aRet;\n}\n\n\/\/ XTypeProvider joining\nuno::Sequence< uno::Type > SAL_CALL ORootElementGroupInfo::getTypes( ) throw (uno::RuntimeException )\n{\n    return comphelper::concatSequences(BasicRootElement::getTypes(), BasicGroupAccess::getTypes(), BasicPropertySet::getTypes());\n}\n\nuno::Sequence< sal_Int8 > SAL_CALL ORootElementGroupInfo::getImplementationId( ) throw (uno::RuntimeException )\n{\n    return BasicRootElement::getImplementationId();\n}\n\n\nNodeAccess& ORootElementGroupInfo::getNodeAccess()\n{\n    return m_aAccessElement;\n}\n\nNodeGroupInfoAccess& ORootElementGroupInfo::getNode()\n{\n    return m_aAccessElement;\n}\n\nNodeGroupAccess* ORootElementGroupInfo::maybeGetUpdateAccess()\n{\n    return 0;\n}\n\nRootElement& ORootElementGroupInfo::getElementClass()\n{\n    return m_aAccessElement;\n}\n\n\/\/==========================================================================\n\/\/= ORootElementGroupUpdate\n\/\/==========================================================================\n\n\/\/ XInterface refcounting\nvoid SAL_CALL ORootElementGroupUpdate::acquire( ) throw ()\n{\n    BasicUpdateElement::acquire();\n}\n\nvoid SAL_CALL ORootElementGroupUpdate::release( ) throw ()\n{\n    BasicUpdateElement::release();\n}\n\n\/\/ XInterface joining\nuno::Any SAL_CALL ORootElementGroupUpdate::queryInterface( uno::Type const& rType ) throw (uno::RuntimeException )\n{\n    uno::Any aRet = BasicUpdateElement::queryInterface(rType);\n\n    if (!aRet.hasValue())\n        aRet = BasicGroup::queryInterface(rType);\n\n    if (!aRet.hasValue())\n        aRet = BasicPropertySet::queryInterface(rType);\n\n    return aRet;\n}\n\n\/\/ XTypeProvider joining\nuno::Sequence< uno::Type > SAL_CALL ORootElementGroupUpdate::getTypes( ) throw (uno::RuntimeException )\n{\n    return comphelper::concatSequences(BasicUpdateElement::getTypes(),BasicGroup::getTypes(), BasicPropertySet::getTypes());\n}\n\nuno::Sequence< sal_Int8 > SAL_CALL ORootElementGroupUpdate::getImplementationId( ) throw (uno::RuntimeException )\n{\n    return BasicUpdateElement::getImplementationId();\n}\n\n\nNodeAccess& ORootElementGroupUpdate::getNodeAccess()\n{\n    return m_aAccessElement;\n}\n\nNodeGroupInfoAccess& ORootElementGroupUpdate::getNode()\n{\n    return m_aAccessElement;\n}\n\nNodeGroupAccess*    ORootElementGroupUpdate::maybeGetUpdateAccess()\n{\n    return &m_aAccessElement;\n}\n\nUpdateRootElement& ORootElementGroupUpdate::getElementClass()\n{\n    return m_aAccessElement;\n}\n\n\/\/........................................................................\n} \/\/ namespace configmgr\n\/\/........................................................................\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    This file is part of Magnum.\n\n    Copyright © 2010, 2011, 2012, 2013, 2014, 2015\n              Vladimír Vondruš <mosra@centrum.cz>\n    Copyright © 2013 <https:\/\/github.com\/ArEnSc>\n    Copyright © 2014 Travis Watkins <https:\/\/github.com\/amaranth>\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 \"WindowlessCglApplication.h\"\n\n#include <Corrade\/Utility\/Assert.h>\n#include <Corrade\/Utility\/Debug.h>\n\n#include \"Magnum\/Platform\/Context.h\"\n#include \"Magnum\/Version.h\"\n\nnamespace Magnum { namespace Platform {\n\n#ifndef DOXYGEN_GENERATING_OUTPUT\nWindowlessCglApplication::WindowlessCglApplication(const Arguments& arguments): WindowlessCglApplication{arguments, Configuration{}} {}\n#endif\n\nWindowlessCglApplication::WindowlessCglApplication(const Arguments& arguments, const Configuration& configuration): WindowlessCglApplication{arguments, nullptr} {\n    createContext(configuration);\n}\n\nWindowlessCglApplication::WindowlessCglApplication(const Arguments&, std::nullptr_t) {}\n\nvoid WindowlessCglApplication::createContext() { createContext({}); }\n\nvoid WindowlessCglApplication::createContext(const Configuration& configuration) {\n    if(!tryCreateContext(configuration)) std::exit(1);\n}\n\nbool WindowlessCglApplication::tryCreateContext(const Configuration&) {\n    CORRADE_ASSERT(!_context, \"Platform::WindowlessCglApplication::tryCreateContext(): context already created\", false);\n\n    \/* Check version *\/\n    GLint major, minor;\n    CGLGetVersion(&major, &minor);\n    if(version(major, minor) < Version::GL210) {\n        Error() << \"Platform::WindowlessCglApplication::tryCreateContext(): OpenGL version 2.1 or greater is required\";\n        return false;\n    }\n\n    int formatCount;\n    CGLPixelFormatAttribute attributes32[] = {\n        kCGLPFAAccelerated,\n        kCGLPFAOpenGLProfile,\n        CGLPixelFormatAttribute(kCGLOGLPVersion_3_2_Core),\n        CGLPixelFormatAttribute(0)\n    };\n    if(CGLChoosePixelFormat(attributes32, &_pixelFormat, &formatCount) != kCGLNoError) {\n        Error() << \"Platform::WindowlessCglApplication::tryCreateContext(): cannot choose pixel format for GL 3.2, falling back to 3.0\";\n\n        CGLPixelFormatAttribute attributes30[] = {\n            kCGLPFAAccelerated,\n            kCGLPFAOpenGLProfile,\n            CGLPixelFormatAttribute(kCGLOGLPVersion_GL3_Core),\n            CGLPixelFormatAttribute(0)\n        };\n        if(CGLChoosePixelFormat(attributes30, &_pixelFormat, &formatCount) != kCGLNoError) {\n            Error() << \"Platform::WindowlessCglApplication::tryCreateContext(): cannot choose pixel format for GL 3.0, falling back to 2.1\";\n\n            CGLPixelFormatAttribute attributes21[] = {\n                kCGLPFAAccelerated,\n                kCGLPFAOpenGLProfile,\n                CGLPixelFormatAttribute(kCGLOGLPVersion_Legacy),\n                CGLPixelFormatAttribute(0)\n            };\n            if(CGLChoosePixelFormat(attributes21, &_pixelFormat, &formatCount) != kCGLNoError) {\n                Error() << \"Platform::WindowlessCglApplication::tryCreateContext(): cannot choose pixel format\";\n                return false;\n            }\n        }\n    }\n\n    if(CGLCreateContext(_pixelFormat, nullptr, &_glContext) != kCGLNoError) {\n        Error() << \"Platform::WindowlessCglApplication::tryCreateContext(): cannot create context\";\n        return false;\n    }\n\n    if(CGLSetCurrentContext(_glContext) != kCGLNoError) {\n        Error() << \"Platform::WindowlessCglApplication::tryCreateContext(): cannot make context current\";\n        return false;\n    }\n\n    _context.reset(new Platform::Context);\n    return true;\n}\n\nWindowlessCglApplication::~WindowlessCglApplication() {\n    _context.reset();\n\n    CGLDestroyContext(_glContext);\n    CGLDestroyPixelFormat(_pixelFormat);\n}\n\n}}\n<commit_msg>Platform: removed bogus check in WindowlessCglApplication.<commit_after>\/*\n    This file is part of Magnum.\n\n    Copyright © 2010, 2011, 2012, 2013, 2014, 2015\n              Vladimír Vondruš <mosra@centrum.cz>\n    Copyright © 2013 <https:\/\/github.com\/ArEnSc>\n    Copyright © 2014 Travis Watkins <https:\/\/github.com\/amaranth>\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 \"WindowlessCglApplication.h\"\n\n#include <Corrade\/Utility\/Assert.h>\n#include <Corrade\/Utility\/Debug.h>\n\n#include \"Magnum\/Platform\/Context.h\"\n#include \"Magnum\/Version.h\"\n\nnamespace Magnum { namespace Platform {\n\n#ifndef DOXYGEN_GENERATING_OUTPUT\nWindowlessCglApplication::WindowlessCglApplication(const Arguments& arguments): WindowlessCglApplication{arguments, Configuration{}} {}\n#endif\n\nWindowlessCglApplication::WindowlessCglApplication(const Arguments& arguments, const Configuration& configuration): WindowlessCglApplication{arguments, nullptr} {\n    createContext(configuration);\n}\n\nWindowlessCglApplication::WindowlessCglApplication(const Arguments&, std::nullptr_t) {}\n\nvoid WindowlessCglApplication::createContext() { createContext({}); }\n\nvoid WindowlessCglApplication::createContext(const Configuration& configuration) {\n    if(!tryCreateContext(configuration)) std::exit(1);\n}\n\nbool WindowlessCglApplication::tryCreateContext(const Configuration&) {\n    CORRADE_ASSERT(!_context, \"Platform::WindowlessCglApplication::tryCreateContext(): context already created\", false);\n\n    int formatCount;\n    CGLPixelFormatAttribute attributes32[] = {\n        kCGLPFAAccelerated,\n        kCGLPFAOpenGLProfile,\n        CGLPixelFormatAttribute(kCGLOGLPVersion_3_2_Core),\n        CGLPixelFormatAttribute(0)\n    };\n    if(CGLChoosePixelFormat(attributes32, &_pixelFormat, &formatCount) != kCGLNoError) {\n        Error() << \"Platform::WindowlessCglApplication::tryCreateContext(): cannot choose pixel format for GL 3.2, falling back to 3.0\";\n\n        CGLPixelFormatAttribute attributes30[] = {\n            kCGLPFAAccelerated,\n            kCGLPFAOpenGLProfile,\n            CGLPixelFormatAttribute(kCGLOGLPVersion_GL3_Core),\n            CGLPixelFormatAttribute(0)\n        };\n        if(CGLChoosePixelFormat(attributes30, &_pixelFormat, &formatCount) != kCGLNoError) {\n            Error() << \"Platform::WindowlessCglApplication::tryCreateContext(): cannot choose pixel format for GL 3.0, falling back to 2.1\";\n\n            CGLPixelFormatAttribute attributes21[] = {\n                kCGLPFAAccelerated,\n                kCGLPFAOpenGLProfile,\n                CGLPixelFormatAttribute(kCGLOGLPVersion_Legacy),\n                CGLPixelFormatAttribute(0)\n            };\n            if(CGLChoosePixelFormat(attributes21, &_pixelFormat, &formatCount) != kCGLNoError) {\n                Error() << \"Platform::WindowlessCglApplication::tryCreateContext(): cannot choose pixel format\";\n                return false;\n            }\n        }\n    }\n\n    if(CGLCreateContext(_pixelFormat, nullptr, &_glContext) != kCGLNoError) {\n        Error() << \"Platform::WindowlessCglApplication::tryCreateContext(): cannot create context\";\n        return false;\n    }\n\n    if(CGLSetCurrentContext(_glContext) != kCGLNoError) {\n        Error() << \"Platform::WindowlessCglApplication::tryCreateContext(): cannot make context current\";\n        return false;\n    }\n\n    _context.reset(new Platform::Context);\n    return true;\n}\n\nWindowlessCglApplication::~WindowlessCglApplication() {\n    _context.reset();\n\n    CGLDestroyContext(_glContext);\n    CGLDestroyPixelFormat(_pixelFormat);\n}\n\n}}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n#include \"ast.h\"\n\n\nnamespace ny {\nnamespace AST {\n\n\ninline yuni::Ref<Node> createNodeIdentifier(const AnyString& name) {\n\treturn yuni::make_ref<Node>(rgIdentifier, name);\n}\n\n\ntemplate<class S> bool appendEntityAsString(S& out, const Node& node) {\n\tassert(node.rule == rgEntity);\n\tassert(node.children.size() > 0);\n\tout += node.children.front().text;\n\tif (node.children.size() != 1) {\n\t\tfor (uint32_t i = 1; i != node.children.size(); ++i) {\n\t\t\tauto& child = node.children[i];\n\t\t\tif (YUNI_UNLIKELY(child.rule != rgIdentifier))\n\t\t\t\treturn false;\n\t\t\tout += '.';\n\t\t\tout += child.text;\n\t\t}\n\t}\n\treturn true;\n}\n\ninline void nodeCopyOffsetText(AST::Node& dest, const AST::Node& source) {\n\tdest.offset    = source.offset;\n\tdest.offsetEnd = source.offsetEnd;\n\tdest.text      = source.text;\n}\n\ninline void nodeCopyOffsetAndOriginalNode(AST::Node& dest, const AST::Node& source) {\n\tdest.offset    = source.offset;\n\tdest.offsetEnd = source.offsetEnd;\n}\n\ninline void nodeCopyOffsetTextAndOriginalNode(AST::Node& dest, const AST::Node& source) {\n\tdest.offset    = source.offset;\n\tdest.offsetEnd = source.offsetEnd;\n\tdest.text      = source.text;\n}\n\ntemplate<class T>\nvoid nodeEachParent(AST::Node& node, const T& callback) {\n\tauto* parent = node.parent;\n\twhile (parent) {\n\t\tif (not callback(*parent))\n\t\t\tbreak;\n\t\tparent = parent->parent;\n\t}\n}\n\ntemplate<class T>\nvoid nodeEachItemInXPath(AST::Node& node, const T& callback) {\n\tenum {\n\t\trevStackHardCodedSize = 64,\n\t};\n\tAST::Node* reverseStack[revStackHardCodedSize];\n\tuint index = 0;\n\t\/\/ when the stack size is greater than `revStackHardCodedSize`\n\tstd::vector<AST::Node*> reverseDynStack;\n\tauto* parent = node.parent;\n\twhile (parent) {\n\t\treverseStack[index] = parent;\n\t\tif (YUNI_UNLIKELY(++index >= revStackHardCodedSize)) {\n\t\t\t\/\/ switching to dynamic stack mode\n\t\t\treverseDynStack.reserve(32);\n\t\t\tparent = parent->parent;\n\t\t\twhile (parent) {\n\t\t\t\treverseDynStack.push_back(parent);\n\t\t\t\tparent = parent->parent;\n\t\t\t}\n\t\t\tfor (auto it = reverseDynStack.rbegin(); it != reverseDynStack.rend(); ++it) {\n\t\t\t\tif (not callback(*(*it)))\n\t\t\t\t\treturn;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tparent = parent->parent;\n\t}\n\tif (index) {\n\t\tdo {\n\t\t\t--index;\n\t\t\tif (not callback(*reverseStack[index]))\n\t\t\t\tbreak;\n\t\t\tif (0 == index)\n\t\t\t\tbreak;\n\t\t}\n\t\twhile (true);\n\t}\n}\n\ninline AST::Node* nodeAppend(AST::Node& parent, enum AST::Rule rule) {\n\tauto* node = new AST::Node(rule);\n\tnode->offset = parent.offset;\n\tnode->offsetEnd = parent.offsetEnd;\n\tnode->parent = &parent;\n\tparent.children.push_back(node);\n\treturn node;\n}\n\ninline AST::Node* nodeAppend(AST::Node& parent, std::initializer_list<enum AST::Rule> list) {\n\tAST::Node* node = &parent;\n\tfor (auto it : list)\n\t\tnode = nodeAppend(*node, it);\n\treturn node;\n}\n\ninline void nodeRulePromote(AST::Node& node, enum AST::Rule rule) {\n\tnode.rule = rule;\n}\n\ninline AST::Node* nodeAppendAsOriginal(AST::Node& parent, enum AST::Rule rule) {\n\treturn nodeAppend(parent, rule);\n}\n\n} \/\/ namespace AST\n} \/\/ namespace ny\n<commit_msg>ast: add temporary local variable to ensure optimization in debug<commit_after>#pragma once\n#include \"ast.h\"\n\n\nnamespace ny {\nnamespace AST {\n\n\ninline yuni::Ref<Node> createNodeIdentifier(const AnyString& name) {\n\treturn yuni::make_ref<Node>(rgIdentifier, name);\n}\n\n\ntemplate<class S> bool appendEntityAsString(S& out, const Node& node) {\n\tassert(node.rule == rgEntity);\n\tuint32_t count = node.children.size();\n\tassert(count > 0);\n\tout += node.children.front().text;\n\tif (count != 1) {\n\t\tfor (uint32_t i = 1; i != count; ++i) {\n\t\t\tauto& child = node.children[i];\n\t\t\tif (YUNI_UNLIKELY(child.rule != rgIdentifier))\n\t\t\t\treturn false;\n\t\t\tout += '.';\n\t\t\tout += child.text;\n\t\t}\n\t}\n\treturn true;\n}\n\ninline void nodeCopyOffsetText(AST::Node& dest, const AST::Node& source) {\n\tdest.offset    = source.offset;\n\tdest.offsetEnd = source.offsetEnd;\n\tdest.text      = source.text;\n}\n\ninline void nodeCopyOffsetAndOriginalNode(AST::Node& dest, const AST::Node& source) {\n\tdest.offset    = source.offset;\n\tdest.offsetEnd = source.offsetEnd;\n}\n\ninline void nodeCopyOffsetTextAndOriginalNode(AST::Node& dest, const AST::Node& source) {\n\tdest.offset    = source.offset;\n\tdest.offsetEnd = source.offsetEnd;\n\tdest.text      = source.text;\n}\n\ntemplate<class T>\nvoid nodeEachParent(AST::Node& node, const T& callback) {\n\tauto* parent = node.parent;\n\twhile (parent) {\n\t\tif (not callback(*parent))\n\t\t\tbreak;\n\t\tparent = parent->parent;\n\t}\n}\n\ntemplate<class T>\nvoid nodeEachItemInXPath(AST::Node& node, const T& callback) {\n\tenum {\n\t\trevStackHardCodedSize = 64,\n\t};\n\tAST::Node* reverseStack[revStackHardCodedSize];\n\tuint index = 0;\n\t\/\/ when the stack size is greater than `revStackHardCodedSize`\n\tstd::vector<AST::Node*> reverseDynStack;\n\tauto* parent = node.parent;\n\twhile (parent) {\n\t\treverseStack[index] = parent;\n\t\tif (YUNI_UNLIKELY(++index >= revStackHardCodedSize)) {\n\t\t\t\/\/ switching to dynamic stack mode\n\t\t\treverseDynStack.reserve(32);\n\t\t\tparent = parent->parent;\n\t\t\twhile (parent) {\n\t\t\t\treverseDynStack.push_back(parent);\n\t\t\t\tparent = parent->parent;\n\t\t\t}\n\t\t\tfor (auto it = reverseDynStack.rbegin(); it != reverseDynStack.rend(); ++it) {\n\t\t\t\tif (not callback(*(*it)))\n\t\t\t\t\treturn;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tparent = parent->parent;\n\t}\n\tif (index) {\n\t\tdo {\n\t\t\t--index;\n\t\t\tif (not callback(*reverseStack[index]))\n\t\t\t\tbreak;\n\t\t\tif (0 == index)\n\t\t\t\tbreak;\n\t\t}\n\t\twhile (true);\n\t}\n}\n\ninline AST::Node* nodeAppend(AST::Node& parent, enum AST::Rule rule) {\n\tauto* node = new AST::Node(rule);\n\tnode->offset = parent.offset;\n\tnode->offsetEnd = parent.offsetEnd;\n\tnode->parent = &parent;\n\tparent.children.push_back(node);\n\treturn node;\n}\n\ninline AST::Node* nodeAppend(AST::Node& parent, std::initializer_list<enum AST::Rule> list) {\n\tAST::Node* node = &parent;\n\tfor (auto it : list)\n\t\tnode = nodeAppend(*node, it);\n\treturn node;\n}\n\ninline void nodeRulePromote(AST::Node& node, enum AST::Rule rule) {\n\tnode.rule = rule;\n}\n\ninline AST::Node* nodeAppendAsOriginal(AST::Node& parent, enum AST::Rule rule) {\n\treturn nodeAppend(parent, rule);\n}\n\n} \/\/ namespace AST\n} \/\/ namespace ny\n<|endoftext|>"}
{"text":"<commit_before>#include \"ofAppRunner.h\"\n\n\/\/========================================================================\n\/\/ static variables:\n\nofBaseApp\t*\t\t\t\tOFSAptr = NULL;\nbool \t\t\t\t\t\tbMousePressed;\nbool\t\t\t\t\t\tbRightButton;\nint\t\t\t\t\t\t\twidth, height;\n\nofAppBaseWindow *\t\t\twindow = NULL;\n\n\/\/========================================================================\n\/\/ core events instance & arguments\n#ifdef OF_USING_POCO\nofCoreEvents \t\t\t\tofEvents;\nofEventArgs\t\t\t\t\tvoidEventArgs;\n#endif\n\n\/\/========================================================================\n\/\/ default windowing\n#ifdef TARGET_OF_IPHONE\n\t#include \"ofAppiPhoneWindow.h\"\n#else\n\t#include \"ofAppGlutWindow.h\"\n#endif\n\n\n\/\/--------------------------------------\nvoid ofSetupOpenGL(ofAppBaseWindow * windowPtr, int w, int h, int screenMode){\n\twindow = windowPtr;\n\twindow->setupOpenGL(w, h, screenMode);\n}\n\n\n\/\/--------------------------------------\nvoid ofSetupOpenGL(int w, int h, int screenMode){\n\t#ifdef TARGET_OF_IPHONE\n\t\twindow = new ofAppiPhoneWindow();\n\t#else\n\t\twindow = new ofAppGlutWindow();\n\t#endif\n\n\twindow->setupOpenGL(w, h, screenMode);\n}\n\n\/\/----------------------- \tgets called when the app exits\n\/\/ \t\t\t\t\t\t\tcurrently looking at who to turn off\n\/\/\t\t\t\t\t\t\tat the end of the application\n\nvoid ofExitCallback();\nvoid ofExitCallback(){\n\n\t\/\/------------------------\n\t\/\/ try to close FMOD:\n\tofSoundPlayer::closeFmod();\n\t\/\/------------------------\n\t\/\/ try to close quicktime, for non-linux systems:\n\n\t#if defined( TARGET_OSX ) || defined( TARGET_WIN32 )\n\tcloseQuicktime();\n\t#endif\n\n\n\t\/\/------------------------\n\t\/\/ try to close freeImage:\n\tofCloseFreeImage();\n\t\/\/------------------------\n\t\/\/ try to close free type:\n\t\/\/ ....\n\n\t#ifdef WIN32_HIGH_RES_TIMING\n\t\ttimeEndPeriod(1);\n\t#endif\n\n\tif(OFSAptr)OFSAptr->exit();\n\n\t#ifdef OF_USING_POCO\n\t\tofNotifyEvent( ofEvents.exit, voidEventArgs );\n\t#endif\n\n\tif(OFSAptr)delete OFSAptr;\n}\n\n\/\/--------------------------------------\nvoid ofRunApp(ofBaseApp * OFSA){\n\n\tOFSAptr = OFSA;\n\tif(OFSAptr){\n\tOFSAptr->mouseX = 0;\n\tOFSAptr->mouseY = 0;\n\t}\n\n\tatexit(ofExitCallback);\n\n\t#ifdef WIN32_HIGH_RES_TIMING\n\t\ttimeBeginPeriod(1);\t\t\/\/ ! experimental, sets high res time\n\t\t\t\t\t\t\t\t\/\/ you need to call timeEndPeriod.\n\t\t\t\t\t\t\t\t\/\/ if you quit the app other than \"esc\"\n\t\t\t\t\t\t\t\t\/\/ (ie, close the console, kill the process, etc)\n\t\t\t\t\t\t\t\t\/\/ at exit wont get called, and the time will\n\t\t\t\t\t\t\t\t\/\/ remain high res, that could mess things\n\t\t\t\t\t\t\t\t\/\/ up on your system.\n\t\t\t\t\t\t\t\t\/\/ info here:http:\/\/www.geisswerks.com\/ryan\/FAQS\/timing.html\n\n\t#endif\n\n\twindow->initializeWindow();\n\n\tofSeedRandom();\n\tofResetElapsedTimeCounter();\n\n\twindow->runAppViaInfiniteLoop(OFSAptr);\n\n}\n\n\/\/--------------------------------------\nint ofGetFrameNum(){\n\treturn window->getFrameNum();\n}\n\n\/\/--------------------------------------\nfloat ofGetFrameRate(){\n\treturn window->getFrameRate();\n}\n\n\/\/--------------------------------------\nvoid ofSetFrameRate(int targetRate){\n\n\twindow->setFrameRate(targetRate);\n}\n\n\/\/--------------------------------------\nvoid ofSleepMillis(int millis){\n\t#ifdef TARGET_WIN32\n\t\tSleep(millis);\t\t\t\/\/windows sleep in milliseconds\n\t#else\n\t\tusleep(millis * 1000);\t\/\/mac sleep in microseconds - cooler :)\n\t#endif\n}\n\n\/\/--------------------------------------\nvoid ofHideCursor(){\n\twindow->hideCursor();\n}\n\n\/\/--------------------------------------\nvoid ofShowCursor(){\n\twindow->showCursor();\n}\n\n\n\/\/--------------------------------------\nvoid ofSetWindowPosition(int x, int y){\n\twindow->setWindowPosition(x,y);\n}\n\n\/\/--------------------------------------\nvoid ofSetWindowShape(int width, int height){\n\twindow->setWindowShape(width, height);\n}\n\n\/\/--------------------------------------\nint ofGetWindowPositionX(){\n\treturn (int)window->getWindowPosition().x;\n}\n\n\/\/--------------------------------------\nint ofGetWindowPositionY(){\n\treturn (int)window->getWindowPosition().y;\n}\n\n\/\/--------------------------------------\nint ofGetScreenWidth(){\n\treturn (int)window->getScreenSize().x;\n}\n\n\/\/--------------------------------------\nint ofGetScreenHeight(){\n\treturn (int)window->getScreenSize().y;\n}\n\n\/\/--------------------------------------------------\nint ofGetWidth(){\n\treturn (int)window->getWindowSize().x;\n}\n\/\/--------------------------------------------------\nint ofGetHeight(){\n\treturn (int)window->getWindowSize().y;\n}\n\n\/\/--------------------------------------\nvoid ofSetWindowTitle(string title){\n\twindow->setWindowTitle(title);\n}\n\n\/\/----------------------------------------------------------\nvoid ofEnableSetupScreen(){\n\twindow->enableSetupScreen();\n}\n\n\/\/----------------------------------------------------------\nvoid ofDisableSetupScreen(){\n\twindow->disableSetupScreen();\n}\n\n\/\/--------------------------------------\nvoid ofToggleFullscreen(){\n\twindow->toggleFullscreen();\n}\n\n\/\/--------------------------------------\nvoid ofSetFullscreen(bool fullscreen){\n\twindow->setFullscreen(fullscreen);\n}\n\n\/\/--------------------------------------\nint ofGetWindowMode(){\n\treturn window->getWindowMode();\n}\n\n\/\/--------------------------------------\nvoid ofSetVerticalSync(bool bSync){\n\t\/\/----------------------------\n\t#ifdef TARGET_WIN32\n\t\/\/----------------------------\n\t\tif (bSync) {\n\t\t\tif (GLEE_WGL_EXT_swap_control) wglSwapIntervalEXT (1);\n\t\t} else {\n\t\t\tif (GLEE_WGL_EXT_swap_control) wglSwapIntervalEXT (0);\n\t\t}\n\t\/\/----------------------------\n\t#endif\n\t\/\/----------------------------\n\n\t\/\/--------------------------------------\n\t#ifdef TARGET_OSX\n\t\/\/--------------------------------------\n\t\tGLint sync = bSync == true ? 1 : 0;\n\t\tCGLSetParameter (CGLGetCurrentContext(), kCGLCPSwapInterval, &sync);\n\t\/\/--------------------------------------\n\t#endif\n\t\/\/--------------------------------------\n\n\n\t\/\/ linux ofSetVerticalSync needed -- anyone want to help w\/ this?\n\t\/\/ http:\/\/www.inb.uni-luebeck.de\/~boehme\/xvideo_sync.html\n\t\/\/ glXGetVideoSyncSGI(&count); \/\/ but needs to be at the end of every \"draw?\n\t\/\/ also, see this:\n   \t\/\/ glXWaitVideoSyncSGI(2,0,&count);\n}\n\n\n<commit_msg>linux vertical sync<commit_after>#include \"ofAppRunner.h\"\n\n\/\/========================================================================\n\/\/ static variables:\n\nofBaseApp\t*\t\t\t\tOFSAptr = NULL;\nbool \t\t\t\t\t\tbMousePressed;\nbool\t\t\t\t\t\tbRightButton;\nint\t\t\t\t\t\t\twidth, height;\n\nofAppBaseWindow *\t\t\twindow = NULL;\n\n\/\/========================================================================\n\/\/ core events instance & arguments\n#ifdef OF_USING_POCO\nofCoreEvents \t\t\t\tofEvents;\nofEventArgs\t\t\t\t\tvoidEventArgs;\n#endif\n\n\/\/========================================================================\n\/\/ default windowing\n#ifdef TARGET_OF_IPHONE\n\t#include \"ofAppiPhoneWindow.h\"\n#else\n\t#include \"ofAppGlutWindow.h\"\n#endif\n\n\n\/\/--------------------------------------\nvoid ofSetupOpenGL(ofAppBaseWindow * windowPtr, int w, int h, int screenMode){\n\twindow = windowPtr;\n\twindow->setupOpenGL(w, h, screenMode);\n}\n\n\n\/\/--------------------------------------\nvoid ofSetupOpenGL(int w, int h, int screenMode){\n\t#ifdef TARGET_OF_IPHONE\n\t\twindow = new ofAppiPhoneWindow();\n\t#else\n\t\twindow = new ofAppGlutWindow();\n\t#endif\n\n\twindow->setupOpenGL(w, h, screenMode);\n}\n\n\/\/----------------------- \tgets called when the app exits\n\/\/ \t\t\t\t\t\t\tcurrently looking at who to turn off\n\/\/\t\t\t\t\t\t\tat the end of the application\n\nvoid ofExitCallback();\nvoid ofExitCallback(){\n\n\t\/\/------------------------\n\t\/\/ try to close FMOD:\n\tofSoundPlayer::closeFmod();\n\t\/\/------------------------\n\t\/\/ try to close quicktime, for non-linux systems:\n\n\t#if defined( TARGET_OSX ) || defined( TARGET_WIN32 )\n\tcloseQuicktime();\n\t#endif\n\n\n\t\/\/------------------------\n\t\/\/ try to close freeImage:\n\tofCloseFreeImage();\n\t\/\/------------------------\n\t\/\/ try to close free type:\n\t\/\/ ....\n\n\t#ifdef WIN32_HIGH_RES_TIMING\n\t\ttimeEndPeriod(1);\n\t#endif\n\n\tif(OFSAptr)OFSAptr->exit();\n\n\t#ifdef OF_USING_POCO\n\t\tofNotifyEvent( ofEvents.exit, voidEventArgs );\n\t#endif\n\n\tif(OFSAptr)delete OFSAptr;\n}\n\n\/\/--------------------------------------\nvoid ofRunApp(ofBaseApp * OFSA){\n\n\tOFSAptr = OFSA;\n\tif(OFSAptr){\n\tOFSAptr->mouseX = 0;\n\tOFSAptr->mouseY = 0;\n\t}\n\n\tatexit(ofExitCallback);\n\n\t#ifdef WIN32_HIGH_RES_TIMING\n\t\ttimeBeginPeriod(1);\t\t\/\/ ! experimental, sets high res time\n\t\t\t\t\t\t\t\t\/\/ you need to call timeEndPeriod.\n\t\t\t\t\t\t\t\t\/\/ if you quit the app other than \"esc\"\n\t\t\t\t\t\t\t\t\/\/ (ie, close the console, kill the process, etc)\n\t\t\t\t\t\t\t\t\/\/ at exit wont get called, and the time will\n\t\t\t\t\t\t\t\t\/\/ remain high res, that could mess things\n\t\t\t\t\t\t\t\t\/\/ up on your system.\n\t\t\t\t\t\t\t\t\/\/ info here:http:\/\/www.geisswerks.com\/ryan\/FAQS\/timing.html\n\n\t#endif\n\n\twindow->initializeWindow();\n\n\tofSeedRandom();\n\tofResetElapsedTimeCounter();\n\n\twindow->runAppViaInfiniteLoop(OFSAptr);\n\n}\n\n\/\/--------------------------------------\nint ofGetFrameNum(){\n\treturn window->getFrameNum();\n}\n\n\/\/--------------------------------------\nfloat ofGetFrameRate(){\n\treturn window->getFrameRate();\n}\n\n\/\/--------------------------------------\nvoid ofSetFrameRate(int targetRate){\n\n\twindow->setFrameRate(targetRate);\n}\n\n\/\/--------------------------------------\nvoid ofSleepMillis(int millis){\n\t#ifdef TARGET_WIN32\n\t\tSleep(millis);\t\t\t\/\/windows sleep in milliseconds\n\t#else\n\t\tusleep(millis * 1000);\t\/\/mac sleep in microseconds - cooler :)\n\t#endif\n}\n\n\/\/--------------------------------------\nvoid ofHideCursor(){\n\twindow->hideCursor();\n}\n\n\/\/--------------------------------------\nvoid ofShowCursor(){\n\twindow->showCursor();\n}\n\n\n\/\/--------------------------------------\nvoid ofSetWindowPosition(int x, int y){\n\twindow->setWindowPosition(x,y);\n}\n\n\/\/--------------------------------------\nvoid ofSetWindowShape(int width, int height){\n\twindow->setWindowShape(width, height);\n}\n\n\/\/--------------------------------------\nint ofGetWindowPositionX(){\n\treturn (int)window->getWindowPosition().x;\n}\n\n\/\/--------------------------------------\nint ofGetWindowPositionY(){\n\treturn (int)window->getWindowPosition().y;\n}\n\n\/\/--------------------------------------\nint ofGetScreenWidth(){\n\treturn (int)window->getScreenSize().x;\n}\n\n\/\/--------------------------------------\nint ofGetScreenHeight(){\n\treturn (int)window->getScreenSize().y;\n}\n\n\/\/--------------------------------------------------\nint ofGetWidth(){\n\treturn (int)window->getWindowSize().x;\n}\n\/\/--------------------------------------------------\nint ofGetHeight(){\n\treturn (int)window->getWindowSize().y;\n}\n\n\/\/--------------------------------------\nvoid ofSetWindowTitle(string title){\n\twindow->setWindowTitle(title);\n}\n\n\/\/----------------------------------------------------------\nvoid ofEnableSetupScreen(){\n\twindow->enableSetupScreen();\n}\n\n\/\/----------------------------------------------------------\nvoid ofDisableSetupScreen(){\n\twindow->disableSetupScreen();\n}\n\n\/\/--------------------------------------\nvoid ofToggleFullscreen(){\n\twindow->toggleFullscreen();\n}\n\n\/\/--------------------------------------\nvoid ofSetFullscreen(bool fullscreen){\n\twindow->setFullscreen(fullscreen);\n}\n\n\/\/--------------------------------------\nint ofGetWindowMode(){\n\treturn window->getWindowMode();\n}\n\n\/\/--------------------------------------\nvoid ofSetVerticalSync(bool bSync){\n\t\/\/----------------------------\n\t#ifdef TARGET_WIN32\n\t\/\/----------------------------\n\t\tif (bSync) {\n\t\t\tif (GLEE_WGL_EXT_swap_control) wglSwapIntervalEXT (1);\n\t\t} else {\n\t\t\tif (GLEE_WGL_EXT_swap_control) wglSwapIntervalEXT (0);\n\t\t}\n\t\/\/----------------------------\n\t#endif\n\t\/\/----------------------------\n\n\t\/\/--------------------------------------\n\t#ifdef TARGET_OSX\n\t\/\/--------------------------------------\n\t\tGLint sync = bSync == true ? 1 : 0;\n\t\tCGLSetParameter (CGLGetCurrentContext(), kCGLCPSwapInterval, &sync);\n\t\/\/--------------------------------------\n\t#endif\n\t\/\/--------------------------------------\n\n\t\/\/--------------------------------------\n\t#ifdef TARGET_LINUX\n\t\/\/--------------------------------------\n\t\tif (GLEE_GLX_SGI_swap_control) glXSwapIntervalSGI(bSync ? 1 : 0);\n\t\/\/--------------------------------------\n\t#endif\n\t\/\/--------------------------------------\n\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"content\/utility\/utility_thread_impl.h\"\n\n#include <stddef.h>\n\n#include \"base\/command_line.h\"\n#include \"base\/file_path.h\"\n#include \"base\/memory\/scoped_vector.h\"\n#include \"content\/common\/child_process.h\"\n#include \"content\/common\/child_process_messages.h\"\n#include \"content\/common\/indexed_db_key.h\"\n#include \"content\/common\/utility_messages.h\"\n#include \"content\/common\/webkitplatformsupport_impl.h\"\n#include \"content\/public\/utility\/content_utility_client.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebIDBKey.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebKit.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/platform\/WebSerializedScriptValue.h\"\n#include \"webkit\/glue\/idb_bindings.h\"\n#include \"webkit\/plugins\/npapi\/plugin_list.h\"\n\n#if defined(TOOLKIT_USES_GTK)\n#include <gtk\/gtk.h>\n\n#include \"ui\/gfx\/gtk_util.h\"\n#endif\n\nnamespace {\n\ntemplate<typename SRC, typename DEST>\nvoid ConvertVector(const SRC& src, DEST* dest) {\n  dest->reserve(src.size());\n  for (typename SRC::const_iterator i = src.begin(); i != src.end(); ++i)\n    dest->push_back(typename DEST::value_type(*i));\n}\n\n}  \/\/ namespace\n\nUtilityThreadImpl::UtilityThreadImpl()\n    : batch_mode_(false) {\n  ChildProcess::current()->AddRefProcess();\n  webkit_platform_support_.reset(new content::WebKitPlatformSupportImpl);\n  WebKit::initialize(webkit_platform_support_.get());\n  content::GetContentClient()->utility()->UtilityThreadStarted();\n}\n\nUtilityThreadImpl::~UtilityThreadImpl() {\n  WebKit::shutdown();\n}\n\nbool UtilityThreadImpl::Send(IPC::Message* msg) {\n  return ChildThread::Send(msg);\n}\n\nvoid UtilityThreadImpl::ReleaseProcessIfNeeded() {\n  if (!batch_mode_)\n    ChildProcess::current()->ReleaseProcess();\n}\n\n#if defined(OS_WIN)\n\nvoid UtilityThreadImpl::PreCacheFont(const LOGFONT& log_font) {\n  Send(new ChildProcessHostMsg_PreCacheFont(log_font));\n}\n\nvoid UtilityThreadImpl::ReleaseCachedFonts() {\n  Send(new ChildProcessHostMsg_ReleaseCachedFonts());\n}\n\n#endif  \/\/ OS_WIN\n\n\nbool UtilityThreadImpl::OnControlMessageReceived(const IPC::Message& msg) {\n  if (content::GetContentClient()->utility()->OnMessageReceived(msg))\n    return true;\n\n  bool handled = true;\n  IPC_BEGIN_MESSAGE_MAP(UtilityThreadImpl, msg)\n    IPC_MESSAGE_HANDLER(UtilityMsg_IDBKeysFromValuesAndKeyPath,\n                        OnIDBKeysFromValuesAndKeyPath)\n    IPC_MESSAGE_HANDLER(UtilityMsg_InjectIDBKey, OnInjectIDBKey)\n    IPC_MESSAGE_HANDLER(UtilityMsg_BatchMode_Started, OnBatchModeStarted)\n    IPC_MESSAGE_HANDLER(UtilityMsg_BatchMode_Finished, OnBatchModeFinished)\n#if defined(OS_POSIX)\n    IPC_MESSAGE_HANDLER(UtilityMsg_LoadPlugins, OnLoadPlugins)\n#endif  \/\/ OS_POSIX\n    IPC_MESSAGE_UNHANDLED(handled = false)\n  IPC_END_MESSAGE_MAP()\n  return handled;\n}\n\nvoid UtilityThreadImpl::OnIDBKeysFromValuesAndKeyPath(\n    int id,\n    const std::vector<content::SerializedScriptValue>& serialized_script_values,\n    const string16& idb_key_path) {\n  std::vector<WebKit::WebSerializedScriptValue> web_values;\n  ConvertVector(serialized_script_values, &web_values);\n  std::vector<WebKit::WebIDBKey> web_keys;\n  bool error = webkit_glue::IDBKeysFromValuesAndKeyPath(\n      web_values, idb_key_path, &web_keys);\n  if (error) {\n    Send(new UtilityHostMsg_IDBKeysFromValuesAndKeyPath_Failed(id));\n    return;\n  }\n  std::vector<IndexedDBKey> keys;\n  ConvertVector(web_keys, &keys);\n  Send(new UtilityHostMsg_IDBKeysFromValuesAndKeyPath_Succeeded(id, keys));\n  ReleaseProcessIfNeeded();\n}\n\nvoid UtilityThreadImpl::OnInjectIDBKey(\n    const IndexedDBKey& key,\n    const content::SerializedScriptValue& value,\n    const string16& key_path) {\n  content::SerializedScriptValue new_value(\n      webkit_glue::InjectIDBKey(key, value, key_path));\n  Send(new UtilityHostMsg_InjectIDBKey_Finished(new_value));\n  ReleaseProcessIfNeeded();\n}\n\nvoid UtilityThreadImpl::OnBatchModeStarted() {\n  batch_mode_ = true;\n}\n\nvoid UtilityThreadImpl::OnBatchModeFinished() {\n  ChildProcess::current()->ReleaseProcess();\n}\n\n#if defined(OS_POSIX)\nvoid UtilityThreadImpl::OnLoadPlugins(\n    const std::vector<FilePath>& plugin_paths) {\n  webkit::npapi::PluginList* plugin_list =\n      webkit::npapi::PluginList::Singleton();\n\n  \/\/ On Linux, some plugins expect the browser to have loaded glib\/gtk. Do that\n  \/\/ before attempting to call into the plugin.\n#if defined(TOOLKIT_USES_GTK)\n  CHECK(!g_thread_get_initialized());\n  g_thread_init(NULL);\n  gfx::GtkInitFromCommandLine(*CommandLine::ForCurrentProcess());\n#endif\n\n  for (size_t i = 0; i < plugin_paths.size(); ++i) {\n    ScopedVector<webkit::npapi::PluginGroup> plugin_groups;\n    plugin_list->LoadPlugin(plugin_paths[i], &plugin_groups);\n\n    if (plugin_groups.empty()) {\n      Send(new UtilityHostMsg_LoadPluginFailed(i, plugin_paths[i]));\n      continue;\n    }\n\n    const webkit::npapi::PluginGroup* group = plugin_groups[0];\n    DCHECK_EQ(group->web_plugin_infos().size(), 1u);\n\n    Send(new UtilityHostMsg_LoadedPlugin(i, group->web_plugin_infos().front()));\n  }\n\n  ReleaseProcessIfNeeded();\n}\n#endif\n\n<commit_msg>Don't abort() if GLib\/GTK have been initialized in the utility process.<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 \"content\/utility\/utility_thread_impl.h\"\n\n#include <stddef.h>\n\n#include \"base\/command_line.h\"\n#include \"base\/file_path.h\"\n#include \"base\/memory\/scoped_vector.h\"\n#include \"content\/common\/child_process.h\"\n#include \"content\/common\/child_process_messages.h\"\n#include \"content\/common\/indexed_db_key.h\"\n#include \"content\/common\/utility_messages.h\"\n#include \"content\/common\/webkitplatformsupport_impl.h\"\n#include \"content\/public\/utility\/content_utility_client.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebIDBKey.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebKit.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/platform\/WebSerializedScriptValue.h\"\n#include \"webkit\/glue\/idb_bindings.h\"\n#include \"webkit\/plugins\/npapi\/plugin_list.h\"\n\n#if defined(TOOLKIT_USES_GTK)\n#include <gtk\/gtk.h>\n\n#include \"ui\/gfx\/gtk_util.h\"\n#endif\n\nnamespace {\n\ntemplate<typename SRC, typename DEST>\nvoid ConvertVector(const SRC& src, DEST* dest) {\n  dest->reserve(src.size());\n  for (typename SRC::const_iterator i = src.begin(); i != src.end(); ++i)\n    dest->push_back(typename DEST::value_type(*i));\n}\n\n}  \/\/ namespace\n\nUtilityThreadImpl::UtilityThreadImpl()\n    : batch_mode_(false) {\n  ChildProcess::current()->AddRefProcess();\n  webkit_platform_support_.reset(new content::WebKitPlatformSupportImpl);\n  WebKit::initialize(webkit_platform_support_.get());\n  content::GetContentClient()->utility()->UtilityThreadStarted();\n}\n\nUtilityThreadImpl::~UtilityThreadImpl() {\n  WebKit::shutdown();\n}\n\nbool UtilityThreadImpl::Send(IPC::Message* msg) {\n  return ChildThread::Send(msg);\n}\n\nvoid UtilityThreadImpl::ReleaseProcessIfNeeded() {\n  if (!batch_mode_)\n    ChildProcess::current()->ReleaseProcess();\n}\n\n#if defined(OS_WIN)\n\nvoid UtilityThreadImpl::PreCacheFont(const LOGFONT& log_font) {\n  Send(new ChildProcessHostMsg_PreCacheFont(log_font));\n}\n\nvoid UtilityThreadImpl::ReleaseCachedFonts() {\n  Send(new ChildProcessHostMsg_ReleaseCachedFonts());\n}\n\n#endif  \/\/ OS_WIN\n\n\nbool UtilityThreadImpl::OnControlMessageReceived(const IPC::Message& msg) {\n  if (content::GetContentClient()->utility()->OnMessageReceived(msg))\n    return true;\n\n  bool handled = true;\n  IPC_BEGIN_MESSAGE_MAP(UtilityThreadImpl, msg)\n    IPC_MESSAGE_HANDLER(UtilityMsg_IDBKeysFromValuesAndKeyPath,\n                        OnIDBKeysFromValuesAndKeyPath)\n    IPC_MESSAGE_HANDLER(UtilityMsg_InjectIDBKey, OnInjectIDBKey)\n    IPC_MESSAGE_HANDLER(UtilityMsg_BatchMode_Started, OnBatchModeStarted)\n    IPC_MESSAGE_HANDLER(UtilityMsg_BatchMode_Finished, OnBatchModeFinished)\n#if defined(OS_POSIX)\n    IPC_MESSAGE_HANDLER(UtilityMsg_LoadPlugins, OnLoadPlugins)\n#endif  \/\/ OS_POSIX\n    IPC_MESSAGE_UNHANDLED(handled = false)\n  IPC_END_MESSAGE_MAP()\n  return handled;\n}\n\nvoid UtilityThreadImpl::OnIDBKeysFromValuesAndKeyPath(\n    int id,\n    const std::vector<content::SerializedScriptValue>& serialized_script_values,\n    const string16& idb_key_path) {\n  std::vector<WebKit::WebSerializedScriptValue> web_values;\n  ConvertVector(serialized_script_values, &web_values);\n  std::vector<WebKit::WebIDBKey> web_keys;\n  bool error = webkit_glue::IDBKeysFromValuesAndKeyPath(\n      web_values, idb_key_path, &web_keys);\n  if (error) {\n    Send(new UtilityHostMsg_IDBKeysFromValuesAndKeyPath_Failed(id));\n    return;\n  }\n  std::vector<IndexedDBKey> keys;\n  ConvertVector(web_keys, &keys);\n  Send(new UtilityHostMsg_IDBKeysFromValuesAndKeyPath_Succeeded(id, keys));\n  ReleaseProcessIfNeeded();\n}\n\nvoid UtilityThreadImpl::OnInjectIDBKey(\n    const IndexedDBKey& key,\n    const content::SerializedScriptValue& value,\n    const string16& key_path) {\n  content::SerializedScriptValue new_value(\n      webkit_glue::InjectIDBKey(key, value, key_path));\n  Send(new UtilityHostMsg_InjectIDBKey_Finished(new_value));\n  ReleaseProcessIfNeeded();\n}\n\nvoid UtilityThreadImpl::OnBatchModeStarted() {\n  batch_mode_ = true;\n}\n\nvoid UtilityThreadImpl::OnBatchModeFinished() {\n  ChildProcess::current()->ReleaseProcess();\n}\n\n#if defined(OS_POSIX)\nvoid UtilityThreadImpl::OnLoadPlugins(\n    const std::vector<FilePath>& plugin_paths) {\n  webkit::npapi::PluginList* plugin_list =\n      webkit::npapi::PluginList::Singleton();\n\n  \/\/ On Linux, some plugins expect the browser to have loaded glib\/gtk. Do that\n  \/\/ before attempting to call into the plugin.\n#if defined(TOOLKIT_USES_GTK)\n  if (!g_thread_get_initialized()) {\n    g_thread_init(NULL);\n    gfx::GtkInitFromCommandLine(*CommandLine::ForCurrentProcess());\n  }\n#endif\n\n  for (size_t i = 0; i < plugin_paths.size(); ++i) {\n    ScopedVector<webkit::npapi::PluginGroup> plugin_groups;\n    plugin_list->LoadPlugin(plugin_paths[i], &plugin_groups);\n\n    if (plugin_groups.empty()) {\n      Send(new UtilityHostMsg_LoadPluginFailed(i, plugin_paths[i]));\n      continue;\n    }\n\n    const webkit::npapi::PluginGroup* group = plugin_groups[0];\n    DCHECK_EQ(group->web_plugin_infos().size(), 1u);\n\n    Send(new UtilityHostMsg_LoadedPlugin(i, group->web_plugin_infos().front()));\n  }\n\n  ReleaseProcessIfNeeded();\n}\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/* \n * TTObject to handle xml file reading and writing\n * to be able to store \/ recall state of an object \n * into\/from xml files.\n *\n * Copyright © 2010, Théo de la Hogue\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 \"TTXmlHandler.h\"\n#include <libxml\/encoding.h>\n#include <libxml\/xmlwriter.h>\n#include <libxml\/xmlreader.h>\n\n#define thisTTClass\t\t\tTTXmlHandler\n#define thisTTClassName\t\t\"XmlHandler\"\n#define thisTTClassTags\t\t\"xml, handler\"\n\nTT_MODULAR_CONSTRUCTOR,\nmObject(NULL),\nmFilePath(kTTSymEmpty),\nmHeaderNodeName(TTSymbol(\"jamoma\")),\nmVersion(TTSymbol(\"0.6\")),\nmXmlSchemaInstance(TTSymbol(\"'http:\/\/www.w3.org\/2001\/XMLSchema-instance'\")),\nmXmlSchemaLocation(TTSymbol(\"'http:\/\/jamoma.org\/ file:jamoma.xsd'\")),\nmWriter(NULL),\nmReader(NULL),\nmXmlNodeName(kTTSymEmpty),\nmXmlNodeValue(kTTValNONE),\nmIsWriting(false),\nmIsReading(false)\n{\n\tTT_ASSERT(\"Correct number of args to create TTXmlHandler\", arguments.size() == 0);\n\t\n\taddAttribute(Object, kTypeObject);\n\n\taddAttribute(HeaderNodeName, kTypeSymbol);\n\taddAttribute(Version, kTypeSymbol);\n\taddAttribute(XmlSchemaLocation, kTypeSymbol);\n\t\n\taddMessageWithArguments(Write);\n\taddMessageWithArguments(Read);\n\t\n\taddMessage(WriteAgain);\n\taddMessage(ReadAgain);\n}\n\nTTXmlHandler::~TTXmlHandler()\n{\n\t;\n}\n\nTTErr TTXmlHandler::Write(const TTValue& args, TTValue& outputValue)\n{\n    TTValue\t\t\tv;\n\tTTObjectBasePtr\taTTObject;\n\tint\t\t\t\tret;\n\t\n\t\/\/ an object have to be selected\n\tif (mObject == NULL)\n\t\treturn kTTErrGeneric;\n\t\n\t\/\/ memorize this object because it could change if the handler is used recursively\n\taTTObject = mObject;\n\t\n\t\/\/ if the first argument is kTypeSymbol : this is an *absolute* file path\n\t\/\/ start an xml file reading from the given file\n\tif (args.size() == 1) {\n        \n\t\tif (args[0].type() == kTypeSymbol) {\n\t\t\t\n\t\t\tmFilePath = args[0];\n\t\t\t\n\t\t\t\/\/ Init the xml library\n\t\t\tLIBXML_TEST_VERSION\n\t\t\t\n\t\t\t\/\/ Create a new XmlWriter for filePath, with no compression.\n\t\t\tmWriter = xmlNewTextWriterFilename(mFilePath.c_str(), 0);\n\t\t\tif (mWriter == NULL) {\n\t\t\t\tTT_ASSERT(\"testXmlwriterFilename: Error creating the xml writer\\n\", true);\n\t\t\t\treturn kTTErrGeneric;\n\t\t\t}\n\t\t\t\n\t\t\t\/* Start the document with the xml default for the version,\n\t\t\t * encoding ISO 8859-1 and the default for the standalone\n\t\t\t * declaration. *\/\n\t\t\tret = xmlTextWriterStartDocument((xmlTextWriterPtr)mWriter, NULL, TTMODULAR_XML_ENCODING, \"yes\");\n\t\t\tif (ret < 0) {\n\t\t\t\tTT_ASSERT(\"testXmlwriterFilename: Error at xmlTextWriterStartDocument\\n\", true);\n\t\t\t\treturn kTTErrGeneric;\n\t\t\t}\n\t\t\t\n\t\t\tmIsWriting = true;\n\t\t\t\n\t\t\t\/\/ to write a human readable file\n\t\t\txmlTextWriterSetIndent((xmlTextWriterPtr)mWriter, 1);\n\t\t\t\n\t\t\t\/\/ Start Header information\n\t\t\txmlTextWriterStartElement((xmlTextWriterPtr)mWriter, BAD_CAST mHeaderNodeName.c_str());\n\t\t\txmlTextWriterWriteAttribute((xmlTextWriterPtr)mWriter, BAD_CAST \"version\",\t\t\tBAD_CAST mVersion.c_str());\n\t\t\txmlTextWriterWriteAttribute((xmlTextWriterPtr)mWriter, BAD_CAST \"xmlns:xsi\",\t\t\tBAD_CAST mXmlSchemaInstance.c_str());\n\t\t\txmlTextWriterWriteAttribute((xmlTextWriterPtr)mWriter, BAD_CAST \"xsi:schemaLocation\", BAD_CAST mXmlSchemaLocation.c_str());\n\t\t\t\n\t\t\t\/\/ Write data of the given TTObject (which have to implement a WriteAsXml message)\n\t\t\tv.clear();\n\t\t\tv.append(TTObjectBasePtr(this));\n\t\t\taTTObject->sendMessage(TTSymbol(\"WriteAsXml\"), v, kTTValNONE);\n\t\t\t\n\t\t\t\/\/ End Header information\n\t\t\txmlTextWriterEndElement((xmlTextWriterPtr)mWriter);\n\t\t\t\n\t\t\t\/* Here we could close the elements ORDER and EXAMPLE using the\n\t\t\t * function xmlTextWriterEndElement, but since we do not want to\n\t\t\t * write any other elements, we simply call xmlTextWriterEndDocument,\n\t\t\t * which will do all the work. *\/\n\t\t\txmlTextWriterEndDocument((xmlTextWriterPtr)mWriter);\n\t\t\t\n\t\t\txmlFreeTextWriter((xmlTextWriterPtr)mWriter);\n\t\t\t\n\t\t\tmIsWriting = false;\n\t\t\t\n\t\t\t\/\/ memorize the TTObject as the last handled object\n\t\t\tmObject = aTTObject;\n\t\t\t\n\t\t\treturn kTTErrNone;\n\t\t}\n\t}\n\t\n\t\/\/ else\n\tv.append(TTObjectBasePtr(this));\n\treturn aTTObject->sendMessage(TTSymbol(\"WriteAsXml\"), v, kTTValNONE);\n}\n\nTTErr TTXmlHandler::WriteAgain()\n{\n\tTTValue args;\n\t\n\targs.append(mFilePath);\n\treturn Write(args, kTTValNONE);\n}\n\nTTErr TTXmlHandler::Read(const TTValue& args, TTValue& outputValue)\n{\n\tTTUInt8\t\t\t\txType;\n\tconst xmlChar\t\t*xName = 0;\n\tconst xmlChar\t\t*xValue = 0;\n\tTTObjectBasePtr\t\taTTObject;\n\tTTSymbol\t\t\tlastNodeName;\n\tTTValue\t\t\t\tv;\n\tint\t\t\t\t\tret;\n\t\n\t\/\/ an object have to be selected\n\tif (mObject == NULL)\n\t\treturn kTTErrGeneric;\n\t\n\t\/\/ memorize this object because it could change if the handler is used recursively\n\taTTObject = mObject;\n\t\n\t\/\/ if the first argument is kTypeSymbol : this is an *absolute* file path\n\t\/\/ start an xml file reading from the given file\n\tif (args.size() == 1) {\n        \n\t\tif (args[0].type() == kTypeSymbol) {\n\t\t\t\n\t\t\tmFilePath = args[0];\n\t\t\t\n\t\t\t\/\/ Init the xml library\n\t\t\tLIBXML_TEST_VERSION\n\t\t\t\n\t\t\t\/\/ Parse the file\n\t\t\tmReader = xmlReaderForFile(mFilePath.c_str(), NULL, 0);\n\t\t\tif (mReader != NULL) {\n\t\t\t\t\n\t\t\t\t\/\/ Start reading\n\t\t\t\tmIsReading = true;\n\t\t\t\t\n\t\t\t\tret = xmlTextReaderRead((xmlTextReaderPtr)mReader);\n\t\t\t\twhile (ret == 1) {\n                    \n                    mXmlNodeIsEmpty = xmlTextReaderIsEmptyElement((xmlTextReaderPtr)mReader);\n\t\t\t\t\t\n\t\t\t\t\t\/\/ Get the type of the XML node\n\t\t\t\t\txType = xmlTextReaderNodeType((xmlTextReaderPtr)mReader);\n\t\t\t\t\t\n\t\t\t\t\t\/\/ Keep element (1) and comment (8) and end element (15) nodes\n\t\t\t\t\tif (xType == 1 || xType == 8 || xType == 15) {\n\t\t\t\t\t\t\n\t\t\t\t\t\tswitch (xType) {\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tcase 1: \/\/ For element node\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\/\/ Start to read a node\n\t\t\t\t\t\t\t\tmXmlNodeStart = YES;\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\/\/ Get the node name\n\t\t\t\t\t\t\t\txName = xmlTextReaderName((xmlTextReaderPtr)mReader);\n\t\t\t\t\t\t\t\tif (xName == NULL)\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\tmXmlNodeName = TTSymbol((char*)xName);\n\t\t\t\t\t\t\t\txmlFree((void*)xName);\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\/\/ to filter one line element\n\t\t\t\t\t\t\t\tlastNodeName = mXmlNodeName;\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\/\/ replace header node name by start\n\t\t\t\t\t\t\t\tif (mXmlNodeName == mHeaderNodeName) mXmlNodeName = kTTSym_start;\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\/\/ Get the node value\n\t\t\t\t\t\t\t\txValue = xmlTextReaderReadString((xmlTextReaderPtr)mReader);\n\t\t\t\t\t\t\t\tfromXmlChar(xValue, mXmlNodeValue);\n\t\t\t\t\t\t\t\tif (xValue)\txmlFree((void*)xValue);\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tcase 15: \/\/ For end element node\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\/\/ Get the node name\n\t\t\t\t\t\t\t\txName = xmlTextReaderName((xmlTextReaderPtr)mReader);\n\t\t\t\t\t\t\t\tif (xName == NULL)\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\tmXmlNodeName = TTSymbol((char*)xName);\n\t\t\t\t\t\t\t\txmlFree((void*)xName);\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\/\/ End to read a node\n\t\t\t\t\t\t\t\tmXmlNodeStart = NO;\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\/\/ replace header node name by stop\n\t\t\t\t\t\t\t\tif (mXmlNodeName == mHeaderNodeName) mXmlNodeName = kTTSym_stop;\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\/\/ Set the node value\n\t\t\t\t\t\t\t\tmXmlNodeValue = kTTValNONE;\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tcase 8: \/\/ For comment node\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\/\/ Set the node name\n\t\t\t\t\t\t\t\tmXmlNodeName = kTTSym_comment;\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\/\/ Get the node value\n\t\t\t\t\t\t\t\txValue = xmlTextReaderValue((xmlTextReaderPtr)mReader);\n\t\t\t\t\t\t\t\tfromXmlChar(xValue, mXmlNodeValue, YES);\n\t\t\t\t\t\t\t\t\/\/ if (xValue)\txmlFree((void*)xValue);         \/\/ to - this create a malloc error during parsing\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tdefault:\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\t\/\/ process the mObject parsing on this node\n\t\t\t\t\t\tv.append(TTObjectBasePtr(this));\n\t\t\t\t\t\taTTObject->sendMessage(TTSymbol(\"ReadFromXml\"), v, kTTValNONE);\n\t\t\t\t\t}\n\t\t\t\t\t\t\n\t\t\t\t\t\/\/ next node\n\t\t\t\t\tret = xmlTextReaderRead((xmlTextReaderPtr)mReader);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif (ret != 0)\n\t\t\t\t\t;\/\/ TODO : failed to parse\n\t\t\t\t\n\t\t\t\t\/\/ End reading\n\t\t\t\txmlFreeTextReader((xmlTextReaderPtr)mReader);\n\t\t\t\tmIsReading = false;\n\t\t\t\t\n\t\t\t\t\/\/ memorize the TTObject as the last handled object\n\t\t\t\tmObject = aTTObject;\n\t\t\t}\n\t\t\telse\n\t\t\t\treturn kTTErrGeneric;\n\t\t\t\n\t\t\treturn kTTErrNone;\n\t\t}\n\t}\n\t\n\t\/\/ else\n\tv.append(TTObjectBasePtr(this));\n\treturn aTTObject->sendMessage(TTSymbol(\"ReadFromXml\"), v, kTTValNONE);\n}\n\nTTErr TTXmlHandler::ReadAgain()\n{\n\tTTValue args;\n\t\n\targs.append(mFilePath);\n\treturn Read(args, kTTValNONE);\n}\n\nTTErr TTXmlHandler::fromXmlChar(const void* axCh, TTValue& v, TTBoolean addQuote, TTBoolean numberAsSymbol)\n{\n\tTTString cString;\n\tconst xmlChar* xCh = (const xmlChar*)axCh;\n\t\n\tv.clear();\n\t\n\tif (xCh) {\n\t\t\n\t\tif (xCh[0] != '\\n' && xCh[0] != '\\0') {\n\t\t\n\t\t\tif (addQuote) {\n\t\t\t\tcString = TTString(\"\\\"\");\n\t\t\t\tcString += (char*)xCh;\n\t\t\t\tcString += \"\\\"\";\n\t\t\t}\n\t\t\telse\n\t\t\t\tcString = TTString((char*)xCh);\n\t\t\t\n\t\t\tv = cString;\n\t\t\tv.fromString();\n\t\t\txmlFree((void*)xCh);\n\t\t\treturn kTTErrNone;\n\t\t}\n\t}\n\t\n\treturn kTTErrGeneric;\n}\n\nTTErr TTXmlHandler::getXmlAttribute(TTSymbol attributeName, TTValue& returnedValue, TTBoolean addQuote, TTBoolean numberAsSymbol)\n{\n\/\/\tTTErr err;\n\t\n\tif (xmlTextReaderMoveToAttribute((xmlTextReaderPtr)mReader, BAD_CAST attributeName.c_str()) == 1) {\n\t\t\n\t\treturn fromXmlChar(xmlTextReaderValue((xmlTextReaderPtr)mReader), returnedValue, addQuote, numberAsSymbol);\n\t}\n\t\n\treturn kTTErrGeneric;\n}\n\nTTErr TTXmlHandler::getXmlNextAttribute(TTSymbol returnedAttributeName, TTValue& returnedValue, TTBoolean addQuote, TTBoolean numberAsSymbol)\n{\n\tTTValue v;\n\/\/\tTTErr\terr;\n\t\n\tif (xmlTextReaderMoveToNextAttribute((xmlTextReaderPtr)mReader) == 1) {\n\t\t\n\t\tfromXmlChar(xmlTextReaderName((xmlTextReaderPtr)mReader), v);\n\t\t\n        if (v.size() == 1) {\n            \n            if (v[0].type() == kTypeSymbol) {\n                \n                returnedAttributeName = v[0];\n                return fromXmlChar(xmlTextReaderValue((xmlTextReaderPtr)mReader), returnedValue, addQuote, numberAsSymbol);\n            }\n        }\n\t}\n\t\n\treturn kTTErrGeneric;\n}\n<commit_msg>Commenting out a line where xmlFree() used to create a malloc error<commit_after>\/* \n * TTObject to handle xml file reading and writing\n * to be able to store \/ recall state of an object \n * into\/from xml files.\n *\n * Copyright © 2010, Théo de la Hogue\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 \"TTXmlHandler.h\"\n#include <libxml\/encoding.h>\n#include <libxml\/xmlwriter.h>\n#include <libxml\/xmlreader.h>\n\n#define thisTTClass\t\t\tTTXmlHandler\n#define thisTTClassName\t\t\"XmlHandler\"\n#define thisTTClassTags\t\t\"xml, handler\"\n\nTT_MODULAR_CONSTRUCTOR,\nmObject(NULL),\nmFilePath(kTTSymEmpty),\nmHeaderNodeName(TTSymbol(\"jamoma\")),\nmVersion(TTSymbol(\"0.6\")),\nmXmlSchemaInstance(TTSymbol(\"http:\/\/www.w3.org\/2001\/XMLSchema-instance\")),\nmXmlSchemaLocation(TTSymbol(\"http:\/\/jamoma.org\/ file:jamoma.xsd\")),\nmWriter(NULL),\nmReader(NULL),\nmXmlNodeName(kTTSymEmpty),\nmXmlNodeValue(kTTValNONE),\nmIsWriting(false),\nmIsReading(false)\n{\n\tTT_ASSERT(\"Correct number of args to create TTXmlHandler\", arguments.size() == 0);\n\t\n\taddAttribute(Object, kTypeObject);\n\n\taddAttribute(HeaderNodeName, kTypeSymbol);\n\taddAttribute(Version, kTypeSymbol);\n\taddAttribute(XmlSchemaLocation, kTypeSymbol);\n\t\n\taddMessageWithArguments(Write);\n\taddMessageWithArguments(Read);\n\t\n\taddMessage(WriteAgain);\n\taddMessage(ReadAgain);\n}\n\nTTXmlHandler::~TTXmlHandler()\n{\n\t;\n}\n\nTTErr TTXmlHandler::Write(const TTValue& args, TTValue& outputValue)\n{\n    TTValue\t\t\tv;\n\tTTObjectBasePtr\taTTObject;\n\tint\t\t\t\tret;\n\t\n\t\/\/ an object have to be selected\n\tif (mObject == NULL)\n\t\treturn kTTErrGeneric;\n\t\n\t\/\/ memorize this object because it could change if the handler is used recursively\n\taTTObject = mObject;\n\t\n\t\/\/ if the first argument is kTypeSymbol : this is an *absolute* file path\n\t\/\/ start an xml file reading from the given file\n\tif (args.size() == 1) {\n        \n\t\tif (args[0].type() == kTypeSymbol) {\n\t\t\t\n\t\t\tmFilePath = args[0];\n\t\t\t\n\t\t\t\/\/ Init the xml library\n\t\t\tLIBXML_TEST_VERSION\n\t\t\t\n\t\t\t\/\/ Create a new XmlWriter for filePath, with no compression.\n\t\t\tmWriter = xmlNewTextWriterFilename(mFilePath.c_str(), 0);\n\t\t\tif (mWriter == NULL) {\n\t\t\t\tTT_ASSERT(\"testXmlwriterFilename: Error creating the xml writer\\n\", true);\n\t\t\t\treturn kTTErrGeneric;\n\t\t\t}\n\t\t\t\n\t\t\t\/* Start the document with the xml default for the version,\n\t\t\t * encoding ISO 8859-1 and the default for the standalone\n\t\t\t * declaration. *\/\n\t\t\tret = xmlTextWriterStartDocument((xmlTextWriterPtr)mWriter, NULL, TTMODULAR_XML_ENCODING, \"yes\");\n\t\t\tif (ret < 0) {\n\t\t\t\tTT_ASSERT(\"testXmlwriterFilename: Error at xmlTextWriterStartDocument\\n\", true);\n\t\t\t\treturn kTTErrGeneric;\n\t\t\t}\n\t\t\t\n\t\t\tmIsWriting = true;\n\t\t\t\n\t\t\t\/\/ to write a human readable file\n\t\t\txmlTextWriterSetIndent((xmlTextWriterPtr)mWriter, 1);\n\t\t\t\n\t\t\t\/\/ Start Header information\n\t\t\txmlTextWriterStartElement((xmlTextWriterPtr)mWriter, BAD_CAST mHeaderNodeName.c_str());\n\t\t\txmlTextWriterWriteAttribute((xmlTextWriterPtr)mWriter, BAD_CAST \"version\",\t\t\tBAD_CAST mVersion.c_str());\n\t\t\txmlTextWriterWriteAttribute((xmlTextWriterPtr)mWriter, BAD_CAST \"xmlns:xsi\",\t\t\tBAD_CAST mXmlSchemaInstance.c_str());\n\t\t\txmlTextWriterWriteAttribute((xmlTextWriterPtr)mWriter, BAD_CAST \"xsi:schemaLocation\", BAD_CAST mXmlSchemaLocation.c_str());\n\t\t\t\n\t\t\t\/\/ Write data of the given TTObject (which have to implement a WriteAsXml message)\n\t\t\tv.clear();\n\t\t\tv.append(TTObjectBasePtr(this));\n\t\t\taTTObject->sendMessage(TTSymbol(\"WriteAsXml\"), v, kTTValNONE);\n\t\t\t\n\t\t\t\/\/ End Header information\n\t\t\txmlTextWriterEndElement((xmlTextWriterPtr)mWriter);\n\t\t\t\n\t\t\t\/* Here we could close the elements ORDER and EXAMPLE using the\n\t\t\t * function xmlTextWriterEndElement, but since we do not want to\n\t\t\t * write any other elements, we simply call xmlTextWriterEndDocument,\n\t\t\t * which will do all the work. *\/\n\t\t\txmlTextWriterEndDocument((xmlTextWriterPtr)mWriter);\n\t\t\t\n\t\t\txmlFreeTextWriter((xmlTextWriterPtr)mWriter);\n\t\t\t\n\t\t\tmIsWriting = false;\n\t\t\t\n\t\t\t\/\/ memorize the TTObject as the last handled object\n\t\t\tmObject = aTTObject;\n\t\t\t\n\t\t\treturn kTTErrNone;\n\t\t}\n\t}\n\t\n\t\/\/ else\n\tv.append(TTObjectBasePtr(this));\n\treturn aTTObject->sendMessage(TTSymbol(\"WriteAsXml\"), v, kTTValNONE);\n}\n\nTTErr TTXmlHandler::WriteAgain()\n{\n\tTTValue args;\n\t\n\targs.append(mFilePath);\n\treturn Write(args, kTTValNONE);\n}\n\nTTErr TTXmlHandler::Read(const TTValue& args, TTValue& outputValue)\n{\n\tTTUInt8\t\t\t\txType;\n\tconst xmlChar\t\t*xName = 0;\n\tconst xmlChar\t\t*xValue = 0;\n\tTTObjectBasePtr\t\taTTObject;\n\tTTSymbol\t\t\tlastNodeName;\n\tTTValue\t\t\t\tv;\n\tint\t\t\t\t\tret;\n\t\n\t\/\/ an object have to be selected\n\tif (mObject == NULL)\n\t\treturn kTTErrGeneric;\n\t\n\t\/\/ memorize this object because it could change if the handler is used recursively\n\taTTObject = mObject;\n\t\n\t\/\/ if the first argument is kTypeSymbol : this is an *absolute* file path\n\t\/\/ start an xml file reading from the given file\n\tif (args.size() == 1) {\n        \n\t\tif (args[0].type() == kTypeSymbol) {\n\t\t\t\n\t\t\tmFilePath = args[0];\n\t\t\t\n\t\t\t\/\/ Init the xml library\n\t\t\tLIBXML_TEST_VERSION\n\t\t\t\n\t\t\t\/\/ Parse the file\n\t\t\tmReader = xmlReaderForFile(mFilePath.c_str(), NULL, 0);\n\t\t\tif (mReader != NULL) {\n\t\t\t\t\n\t\t\t\t\/\/ Start reading\n\t\t\t\tmIsReading = true;\n\t\t\t\t\n\t\t\t\tret = xmlTextReaderRead((xmlTextReaderPtr)mReader);\n\t\t\t\twhile (ret == 1) {\n                    \n                    mXmlNodeIsEmpty = xmlTextReaderIsEmptyElement((xmlTextReaderPtr)mReader);\n\t\t\t\t\t\n\t\t\t\t\t\/\/ Get the type of the XML node\n\t\t\t\t\txType = xmlTextReaderNodeType((xmlTextReaderPtr)mReader);\n\t\t\t\t\t\n\t\t\t\t\t\/\/ Keep element (1) and comment (8) and end element (15) nodes\n\t\t\t\t\tif (xType == 1 || xType == 8 || xType == 15) {\n\t\t\t\t\t\t\n\t\t\t\t\t\tswitch (xType) {\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tcase 1: \/\/ For element node\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\/\/ Start to read a node\n\t\t\t\t\t\t\t\tmXmlNodeStart = YES;\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\/\/ Get the node name\n\t\t\t\t\t\t\t\txName = xmlTextReaderName((xmlTextReaderPtr)mReader);\n\t\t\t\t\t\t\t\tif (xName == NULL)\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\tmXmlNodeName = TTSymbol((char*)xName);\n\t\t\t\t\t\t\t\txmlFree((void*)xName);\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\/\/ to filter one line element\n\t\t\t\t\t\t\t\tlastNodeName = mXmlNodeName;\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\/\/ replace header node name by start\n\t\t\t\t\t\t\t\tif (mXmlNodeName == mHeaderNodeName) mXmlNodeName = kTTSym_start;\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\/\/ Get the node value\n\t\t\t\t\t\t\t\txValue = xmlTextReaderReadString((xmlTextReaderPtr)mReader);\n\t\t\t\t\t\t\t\tfromXmlChar(xValue, mXmlNodeValue);\n\t\t\t\t\t\t\t\t\/\/if (xValue)\txmlFree((void*)xValue);         \/\/ to - commented out because of \"pointer being freed was not allocated\" error\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tcase 15: \/\/ For end element node\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\/\/ Get the node name\n\t\t\t\t\t\t\t\txName = xmlTextReaderName((xmlTextReaderPtr)mReader);\n\t\t\t\t\t\t\t\tif (xName == NULL)\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\tmXmlNodeName = TTSymbol((char*)xName);\n\t\t\t\t\t\t\t\txmlFree((void*)xName);\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\/\/ End to read a node\n\t\t\t\t\t\t\t\tmXmlNodeStart = NO;\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\/\/ replace header node name by stop\n\t\t\t\t\t\t\t\tif (mXmlNodeName == mHeaderNodeName) mXmlNodeName = kTTSym_stop;\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\/\/ Set the node value\n\t\t\t\t\t\t\t\tmXmlNodeValue = kTTValNONE;\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tcase 8: \/\/ For comment node\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\/\/ Set the node name\n\t\t\t\t\t\t\t\tmXmlNodeName = kTTSym_comment;\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\/\/ Get the node value\n\t\t\t\t\t\t\t\txValue = xmlTextReaderValue((xmlTextReaderPtr)mReader);\n\t\t\t\t\t\t\t\tfromXmlChar(xValue, mXmlNodeValue, YES);\n\t\t\t\t\t\t\t\t\/\/ if (xValue)\txmlFree((void*)xValue);         \/\/ to - commented out because of \"pointer being freed was not allocated\" error\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tdefault:\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\t\/\/ process the mObject parsing on this node\n\t\t\t\t\t\tv.append(TTObjectBasePtr(this));\n\t\t\t\t\t\taTTObject->sendMessage(TTSymbol(\"ReadFromXml\"), v, kTTValNONE);\n\t\t\t\t\t}\n\t\t\t\t\t\t\n\t\t\t\t\t\/\/ next node\n\t\t\t\t\tret = xmlTextReaderRead((xmlTextReaderPtr)mReader);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif (ret != 0)\n\t\t\t\t\t;\/\/ TODO : failed to parse\n\t\t\t\t\n\t\t\t\t\/\/ End reading\n\t\t\t\txmlFreeTextReader((xmlTextReaderPtr)mReader);\n\t\t\t\tmIsReading = false;\n\t\t\t\t\n\t\t\t\t\/\/ memorize the TTObject as the last handled object\n\t\t\t\tmObject = aTTObject;\n\t\t\t}\n\t\t\telse\n\t\t\t\treturn kTTErrGeneric;\n\t\t\t\n\t\t\treturn kTTErrNone;\n\t\t}\n\t}\n\t\n\t\/\/ else\n\tv.append(TTObjectBasePtr(this));\n\treturn aTTObject->sendMessage(TTSymbol(\"ReadFromXml\"), v, kTTValNONE);\n}\n\nTTErr TTXmlHandler::ReadAgain()\n{\n\tTTValue args;\n\t\n\targs.append(mFilePath);\n\treturn Read(args, kTTValNONE);\n}\n\nTTErr TTXmlHandler::fromXmlChar(const void* axCh, TTValue& v, TTBoolean addQuote, TTBoolean numberAsSymbol)\n{\n\tTTString cString;\n\tconst xmlChar* xCh = (const xmlChar*)axCh;\n\t\n\tv.clear();\n\t\n\tif (xCh) {\n\t\t\n\t\tif (xCh[0] != '\\n' && xCh[0] != '\\0') {\n\t\t\n\t\t\tif (addQuote) {\n\t\t\t\tcString = TTString(\"\\\"\");\n\t\t\t\tcString += (char*)xCh;\n\t\t\t\tcString += \"\\\"\";\n\t\t\t}\n\t\t\telse\n\t\t\t\tcString = TTString((char*)xCh);\n\t\t\t\n\t\t\tv = cString;\n\t\t\tv.fromString();\n\t\t\txmlFree((void*)xCh);\n\t\t\treturn kTTErrNone;\n\t\t}\n\t}\n\t\n\treturn kTTErrGeneric;\n}\n\nTTErr TTXmlHandler::getXmlAttribute(TTSymbol attributeName, TTValue& returnedValue, TTBoolean addQuote, TTBoolean numberAsSymbol)\n{\n\/\/\tTTErr err;\n\t\n\tif (xmlTextReaderMoveToAttribute((xmlTextReaderPtr)mReader, BAD_CAST attributeName.c_str()) == 1) {\n\t\t\n\t\treturn fromXmlChar(xmlTextReaderValue((xmlTextReaderPtr)mReader), returnedValue, addQuote, numberAsSymbol);\n\t}\n\t\n\treturn kTTErrGeneric;\n}\n\nTTErr TTXmlHandler::getXmlNextAttribute(TTSymbol returnedAttributeName, TTValue& returnedValue, TTBoolean addQuote, TTBoolean numberAsSymbol)\n{\n\tTTValue v;\n\/\/\tTTErr\terr;\n\t\n\tif (xmlTextReaderMoveToNextAttribute((xmlTextReaderPtr)mReader) == 1) {\n\t\t\n\t\tfromXmlChar(xmlTextReaderName((xmlTextReaderPtr)mReader), v);\n\t\t\n        if (v.size() == 1) {\n            \n            if (v[0].type() == kTypeSymbol) {\n                \n                returnedAttributeName = v[0];\n                return fromXmlChar(xmlTextReaderValue((xmlTextReaderPtr)mReader), returnedValue, addQuote, numberAsSymbol);\n            }\n        }\n\t}\n\t\n\treturn kTTErrGeneric;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  File:  Geometry.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:  This file contains the base class implementation for the\n\/\/                Geometry class.\n\/\/\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#include \"pchSpatialDomains.h\"\n\n#include <SpatialDomains\/Geometry.h>\n\nnamespace Nektar\n{\n    namespace SpatialDomains\n    {\n        Geometry::Geometry():\n            m_coordim(0), \n            m_state(eNotFilled),\n            m_GeomShapeType(eNoShapeType)\n        {\n        }\n\n        Geometry::Geometry(const int coordim):\n            m_coordim(coordim),\n            m_state(eNotFilled),\n            m_GeomShapeType(eNoShapeType)\n        {\n        }\n\n        Geometry::~Geometry()\n        {\n        }\n        \n        GeomFactorsVector Geometry::m_RegGeomFactorsManager;\n        GeomFactorsSharedPtr Geometry::ValidateRegGeomFactor(GeomFactorsSharedPtr geomFactor)\n        {\n            GeomFactorsSharedPtr returnval = geomFactor;\n            bool found = false;\n            if (geomFactor->GetGtype() == eRegular)\n            {\n                for (GeomFactorsVectorIter iter = m_RegGeomFactorsManager.begin();\n                    iter != m_RegGeomFactorsManager.end();\n                    ++iter)\n                {\n                    if (**iter == *geomFactor)\n                    {\n                        returnval = *iter;\n                        found = true;\n                        break;\n                    }\n                }\n\n                if (!found)\n                {\n                    m_RegGeomFactorsManager.push_back(geomFactor);\n                    returnval = geomFactor;\n                }\n            }\n\n            return returnval;\n        }\n\n    }; \/\/end of namespace\n}; \/\/end of namespace\n\n\/\/\n\/\/ $Log: Geometry.cpp,v $\n\/\/ Revision 1.9  2007\/07\/26 19:38:47  jfrazier\n\/\/ Added general equation evaluation.\n\/\/\n\/\/ Revision 1.8  2007\/07\/26 18:02:42  jfrazier\n\/\/ Manage the storage of geofactors.\n\/\/\n\/\/ Revision 1.7  2007\/07\/20 02:15:08  bnelson\n\/\/ Replaced boost::shared_ptr with Nektar::ptr\n\/\/\n\/\/ Revision 1.6  2007\/07\/10 22:21:00  jfrazier\n\/\/ Revision of geo fac manager to test for equality.\n\/\/\n\/\/ Revision 1.5  2007\/07\/10 17:06:31  jfrazier\n\/\/ Added method and underlying structure to manage geomfactors.\n\/\/\n\/\/ Revision 1.4  2007\/03\/14 21:24:08  sherwin\n\/\/ Update for working version of MultiRegions up to ExpList1D\n\/\/\n\/\/ Revision 1.3  2006\/08\/24 18:50:00  jfrazier\n\/\/ Completed error checking on permissable composite item combinations.\n\/\/\n\/\/ Revision 1.2  2006\/06\/01 14:15:30  sherwin\n\/\/ Added typdef of boost wrappers and made GeoFac a boost shared pointer.\n\/\/\n\/\/ Revision 1.1  2006\/05\/04 18:59:00  kirby\n\/\/ *** empty log message ***\n\/\/\n\/\/ Revision 1.14  2006\/04\/09 02:08:34  jfrazier\n\/\/ Added precompiled header.\n\/\/\n\/\/ Revision 1.13  2006\/03\/13 11:17:03  sherwin\n\/\/\n\/\/ First compiing version of Demos in SpatialDomains and LocalRegions. However they do not currently seem to execute properly\n\/\/\n\/\/ Revision 1.12  2006\/03\/12 14:20:42  sherwin\n\/\/\n\/\/ First compiling version of SpatialDomains and associated modifications\n\/\/\n\/\/ Revision 1.11  2006\/03\/12 07:42:02  sherwin\n\/\/\n\/\/ Updated member names and StdRegions call. Still has not been compiled\n\/\/\n\/\/ Revision 1.10  2006\/02\/19 01:37:33  jfrazier\n\/\/ Initial attempt at bringing into conformance with the coding standard.  Still more work to be done.  Has not been compiled.\n\/\/\n\/\/\n<commit_msg>Constructors initialize m_GlobalID to -1.<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  File:  Geometry.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:  This file contains the base class implementation for the\n\/\/                Geometry class.\n\/\/\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#include \"pchSpatialDomains.h\"\n\n#include <SpatialDomains\/Geometry.h>\n\nnamespace Nektar\n{\n    namespace SpatialDomains\n    {\n        Geometry::Geometry():\n            m_coordim(0), \n            m_state(eNotFilled),\n            m_GeomShapeType(eNoShapeType),\n\t\t\tm_GlobalID(-1)\n        {\n        }\n\n        Geometry::Geometry(const int coordim):\n            m_coordim(coordim),\n            m_state(eNotFilled),\n            m_GeomShapeType(eNoShapeType),\n\t\t\tm_GlobalID(-1)\n        {\n        }\n\n        Geometry::~Geometry()\n        {\n        }\n        \n        GeomFactorsVector Geometry::m_RegGeomFactorsManager;\n        GeomFactorsSharedPtr Geometry::ValidateRegGeomFactor(GeomFactorsSharedPtr geomFactor)\n        {\n            GeomFactorsSharedPtr returnval = geomFactor;\n            bool found = false;\n            if (geomFactor->GetGtype() == eRegular)\n            {\n                for (GeomFactorsVectorIter iter = m_RegGeomFactorsManager.begin();\n                    iter != m_RegGeomFactorsManager.end();\n                    ++iter)\n                {\n                    if (**iter == *geomFactor)\n                    {\n                        returnval = *iter;\n                        found = true;\n                        break;\n                    }\n                }\n\n                if (!found)\n                {\n                    m_RegGeomFactorsManager.push_back(geomFactor);\n                    returnval = geomFactor;\n                }\n            }\n\n            return returnval;\n        }\n\n    }; \/\/end of namespace\n}; \/\/end of namespace\n\n\/\/\n\/\/ $Log: Geometry.cpp,v $\n\/\/ Revision 1.10  2008\/05\/28 21:52:27  jfrazier\n\/\/ Added GeomShapeType initialization for the different shapes.\n\/\/\n\/\/ Revision 1.9  2007\/07\/26 19:38:47  jfrazier\n\/\/ Added general equation evaluation.\n\/\/\n\/\/ Revision 1.8  2007\/07\/26 18:02:42  jfrazier\n\/\/ Manage the storage of geofactors.\n\/\/\n\/\/ Revision 1.7  2007\/07\/20 02:15:08  bnelson\n\/\/ Replaced boost::shared_ptr with Nektar::ptr\n\/\/\n\/\/ Revision 1.6  2007\/07\/10 22:21:00  jfrazier\n\/\/ Revision of geo fac manager to test for equality.\n\/\/\n\/\/ Revision 1.5  2007\/07\/10 17:06:31  jfrazier\n\/\/ Added method and underlying structure to manage geomfactors.\n\/\/\n\/\/ Revision 1.4  2007\/03\/14 21:24:08  sherwin\n\/\/ Update for working version of MultiRegions up to ExpList1D\n\/\/\n\/\/ Revision 1.3  2006\/08\/24 18:50:00  jfrazier\n\/\/ Completed error checking on permissable composite item combinations.\n\/\/\n\/\/ Revision 1.2  2006\/06\/01 14:15:30  sherwin\n\/\/ Added typdef of boost wrappers and made GeoFac a boost shared pointer.\n\/\/\n\/\/ Revision 1.1  2006\/05\/04 18:59:00  kirby\n\/\/ *** empty log message ***\n\/\/\n\/\/ Revision 1.14  2006\/04\/09 02:08:34  jfrazier\n\/\/ Added precompiled header.\n\/\/\n\/\/ Revision 1.13  2006\/03\/13 11:17:03  sherwin\n\/\/\n\/\/ First compiing version of Demos in SpatialDomains and LocalRegions. However they do not currently seem to execute properly\n\/\/\n\/\/ Revision 1.12  2006\/03\/12 14:20:42  sherwin\n\/\/\n\/\/ First compiling version of SpatialDomains and associated modifications\n\/\/\n\/\/ Revision 1.11  2006\/03\/12 07:42:02  sherwin\n\/\/\n\/\/ Updated member names and StdRegions call. Still has not been compiled\n\/\/\n\/\/ Revision 1.10  2006\/02\/19 01:37:33  jfrazier\n\/\/ Initial attempt at bringing into conformance with the coding standard.  Still more work to be done.  Has not been compiled.\n\/\/\n\/\/\n<|endoftext|>"}
{"text":"<commit_before>#include <fstream>\n#include <lemon\/lgf_writer.h>\n#include <cassert>\n#include \"..\/lib\/parse_trace.h\"\n#include \"..\/lib\/solve_mcf.h\"\n\nusing namespace lemon;\n\nint main(int argc, char* argv[]) {\n\n    if (argc != 5) {\n        std::cerr << argv[0] << \" traceFile cacheSize solverParam resultPath\" << std::endl;\n        return 1;\n    }\n\n    std::string path(argv[1]);\n    uint64_t cacheSize(atoll(argv[2]));\n    int solverPar(atoi(argv[3]));\n    std::string resultPath(argv[4]);\n\n    \/\/ parse trace file\n    std::vector<traceEntry> trace;\n    uint64_t totalUniqC = parseTraceFile(trace, path);\n    uint64_t totalReqc = trace.size();\n    std::cerr << \"scanned trace n=\" << totalReqc << \" m=\" << totalUniqC << std::endl;\n\n    \/\/ create mcf instance\n    SmartDigraph g; \/\/ mcf graph\n    SmartDigraph::ArcMap<int64_t> cap(g); \/\/ mcf capacities\n    SmartDigraph::ArcMap<double> cost(g); \/\/ mcf costs\n    SmartDigraph::NodeMap<int64_t> supplies(g); \/\/ mcf demands\/supplies\n\n    createMCF(g, trace, cacheSize, cap, cost, supplies);\n    \n    std::cerr << \"created graph with \";\n    uint64_t nodes=0, vertices=0;\n    for (SmartDigraph::NodeIt n(g); n!=INVALID; ++n) ++nodes;\n    std::cerr << nodes << \" nodes \";\n    for (SmartDigraph::ArcIt a(g); a != INVALID; ++a) ++vertices;\n    std::cerr << vertices << \" arcs \" << std::endl;\n\n    SmartDigraph::ArcMap<uint64_t> flow(g);\n    double solval = solveMCF(g, cap, cost, supplies, flow, solverPar);\n    \/\/    assert(solval>0);\n\n    std::cerr << \"solution par \" << solverPar << \" cost \" << solval << \" teqs \" << totalReqc << \" OHR \" << 1.0-(static_cast<double>(solval)+totalUniqC)\/totalReqc << std::endl;\n    std::cout << \"solution par \" << solverPar << \" cost \" << solval << \" teqs \" << totalReqc << \" OHR \" << 1.0-(static_cast<double>(solval)+totalUniqC)\/totalReqc << std::endl;\n    \n    std::ofstream resultfile(resultPath);\n\n    for(auto & it: trace) {\n        const uint64_t id=std::get<0>(it);\n        const uint64_t size=std::get<1>(it);\n        const uint64_t time=std::get<3>(it);\n        const int arcId=std::get<4>(it);\n        resultfile << time << \" \" << id << \" \" << size << \" \";\n        if(arcId==-1) \n            resultfile << \"0\\n\";\n        else\n            resultfile << (size-flow[g.arcFromId(arcId)])\/static_cast<double>(size) << \"\\n\";\n    }\n\n\n    return 0;\n}\n<commit_msg>more specific output name for exact<commit_after>#include <fstream>\n#include <lemon\/lgf_writer.h>\n#include <cassert>\n#include \"..\/lib\/parse_trace.h\"\n#include \"..\/lib\/solve_mcf.h\"\n\nusing namespace lemon;\n\nint main(int argc, char* argv[]) {\n\n    if (argc != 5) {\n        std::cerr << argv[0] << \" traceFile cacheSize solverParam resultPath\" << std::endl;\n        return 1;\n    }\n\n    std::string path(argv[1]);\n    uint64_t cacheSize(atoll(argv[2]));\n    int solverPar(atoi(argv[3]));\n    std::string resultPath(argv[4]);\n\n    \/\/ parse trace file\n    std::vector<traceEntry> trace;\n    uint64_t totalUniqC = parseTraceFile(trace, path);\n    uint64_t totalReqc = trace.size();\n    std::cerr << \"scanned trace n=\" << totalReqc << \" m=\" << totalUniqC << std::endl;\n\n    \/\/ create mcf instance\n    SmartDigraph g; \/\/ mcf graph\n    SmartDigraph::ArcMap<int64_t> cap(g); \/\/ mcf capacities\n    SmartDigraph::ArcMap<double> cost(g); \/\/ mcf costs\n    SmartDigraph::NodeMap<int64_t> supplies(g); \/\/ mcf demands\/supplies\n\n    createMCF(g, trace, cacheSize, cap, cost, supplies);\n    \n    std::cerr << \"created graph with \";\n    uint64_t nodes=0, vertices=0;\n    for (SmartDigraph::NodeIt n(g); n!=INVALID; ++n) ++nodes;\n    std::cerr << nodes << \" nodes \";\n    for (SmartDigraph::ArcIt a(g); a != INVALID; ++a) ++vertices;\n    std::cerr << vertices << \" arcs \" << std::endl;\n\n    SmartDigraph::ArcMap<uint64_t> flow(g);\n    double solval = solveMCF(g, cap, cost, supplies, flow, solverPar);\n    \/\/    assert(solval>0);\n\n    std::cerr << \"ExLP\" << solverPar << \" \" << cacheSize << \" hitc \" << totalReqc-totalUniqC-solval << \" reqc \" << totalReqc << \" OHR \" << 1.0-(static_cast<double>(solval)+totalUniqC)\/totalReqc << std::endl;\n    std::cout << \"ExLP\" << solverPar << \" \" << cacheSize << \" hitc \" << totalReqc-totalUniqC-solval << \" reqc \" << totalReqc << \" OHR \" << 1.0-(static_cast<double>(solval)+totalUniqC)\/totalReqc << std::endl;\n    \n    std::ofstream resultfile(resultPath);\n\n    for(auto & it: trace) {\n        const uint64_t id=std::get<0>(it);\n        const uint64_t size=std::get<1>(it);\n        const uint64_t time=std::get<3>(it);\n        const int arcId=std::get<4>(it);\n        resultfile << time << \" \" << id << \" \" << size << \" \";\n        if(arcId==-1) \n            resultfile << \"0\\n\";\n        else\n            resultfile << (size-flow[g.arcFromId(arcId)])\/static_cast<double>(size) << \"\\n\";\n    }\n\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Begin CVS Header\n\/\/   $Source: \/Volumes\/Home\/Users\/shoops\/cvs\/copasi_dev\/copasi\/report\/CCopasiRootContainer.cpp,v $\n\/\/   $Revision: 1.9 $\n\/\/   $Name:  $\n\/\/   $Author: gauges $\n\/\/   $Date: 2009\/07\/20 11:50:04 $\n\/\/ End CVS Header\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#include \"copasi.h\"\n\n#include \"CCopasiRootContainer.h\"\n\n#include \"copasi\/function\/CFunctionDB.h\"\n#include \"copasi\/commandline\/CConfigurationFile.h\"\n#include \"copasi\/commandline\/COptions.h\"\n#include \"copasi\/function\/CFunction.h\"\n#include \"copasi\/function\/CEvaluationNodeOperator.h\"\n#include \"copasi\/function\/CEvaluationNodeVariable.h\"\n#include \"copasi\/function\/CEvaluationNodeConstant.h\"\n\nextern CCopasiRootContainer * pRootContainer;\n\n\/**\n * The default constructor should be private so that nobody can create\n * new instances of the root container.\n * The only way to create a root container is through the static init\n * method.\n *\/\nCCopasiRootContainer::CCopasiRootContainer(const bool & withGUI):\n    CCopasiContainer(\"Root\", NULL, \"CN\", CCopasiObject::Root),\n    mpFunctionList(NULL),\n    mpConfiguration(NULL),\n    mpDataModelList(NULL),\n    mWithGUI(withGUI),\n    mpUnsupportedDelay(NULL),\n    mpUndefined(NULL)\n{}\n\n\/\/ Destructor\nCCopasiRootContainer::~CCopasiRootContainer()\n{\n  \/\/ save and delete the configuration\n  if (mpConfiguration != NULL)\n    mpConfiguration->save();\n\n  pdelete(mpConfiguration);\n  \/\/ delete the function list\n  pdelete(mpFunctionList);\n  \/\/ delete the model list\n  pdelete(mpDataModelList);\n  \/\/ delete the undefined and the unsupported delay function\n  pdelete(mpUndefined);\n  \/\/ unsupported delay is owned by the function database\n  \/\/ and will be destroyed by it\n  \/\/pdelete(this->mpUnsupportedDelay);\n}\n\n\/**\n * This method creates the only root container.\n *\/\nvoid CCopasiRootContainer::init(int argc, char** argv, const bool & withGUI)\n{\n  COptions::init(argc, argv);\n\n  if (pRootContainer == NULL)\n    pRootContainer = new CCopasiRootContainer(withGUI);\n\n  if (pRootContainer != NULL)\n    pRootContainer->initializeChildren();\n}\n\n\/\/ static\nvoid CCopasiRootContainer::destroy()\n{\n  if (pRootContainer != NULL)\n    {\n      delete pRootContainer;\n      pRootContainer = NULL;\n    }\n\n  COptions::cleanup();\n}\n\nvoid CCopasiRootContainer::initializeChildren()\n{\n  mpFunctionList = new CFunctionDB(\"FunctionDB\", this);\n  mpConfiguration = new CConfigurationFile;\n  mpDataModelList = new CCopasiVector<CCopasiDataModel>(\"ModelList\", this);\n\n  mpFunctionList->load();\n  mpConfiguration->load();\n\n  mpUndefined = new CFunction(\"undefined\");\n  mpUndefined->setInfix(\"nan\");\n  mpUndefined->compile();\n\n  mKeyFactory.remove(mpUndefined->getKey());\n  mKeyFactory.addFix(\"UndefinedFunction_0\", mpUndefined);\n\n  mpUnsupportedDelay = new CFunction(\"delay\");\n  mpUnsupportedDelay->addVariable(\"variable\");\n  mpUnsupportedDelay->addVariable(\"timeDelay\");\n\n  CEvaluationNodeOperator* pTmpNode = new CEvaluationNodeOperator(CEvaluationNodeOperator::MULTIPLY, \"*\");\n  pTmpNode->addChild(new CEvaluationNodeVariable(CEvaluationNodeVariable::ANY, \"variable\"));\n  pTmpNode->addChild(new CEvaluationNodeVariable(CEvaluationNodeVariable::ANY, \"timeDelay\"));\n  CEvaluationNodeOperator* pRoot = new CEvaluationNodeOperator(CEvaluationNodeOperator::MULTIPLY, \"*\");\n  pRoot->addChild(pTmpNode);\n  pRoot->addChild(new CEvaluationNodeConstant(CEvaluationNodeConstant::_NaN, \"NAN\"));\n\n  mpUnsupportedDelay->setRoot(pRoot);\n  mpUnsupportedDelay->compile();\n\n  if (mpFunctionList != NULL)\n    mpFunctionList->addAndAdaptName(mpUnsupportedDelay);\n}\n\n\/\/ static\nconst CCopasiContainer * CCopasiRootContainer::getRoot()\n{\n  return pRootContainer;\n}\n\n\/\/ static\nCConfigurationFile * CCopasiRootContainer::getConfiguration()\n{\n  return pRootContainer->mpConfiguration;\n}\n\n\/\/ static\nCFunctionDB * CCopasiRootContainer::getFunctionList()\n{\n  return pRootContainer->mpFunctionList;\n}\n\n\/\/ static\nCCopasiVector< CCopasiDataModel > * CCopasiRootContainer::getDatamodelList()\n{\n  return pRootContainer->mpDataModelList;\n}\n\n\/\/ static\nCCopasiDataModel * CCopasiRootContainer::addDatamodel()\n{\n  CCopasiDataModel* pDataModel = new CCopasiDataModel(pRootContainer->mWithGUI);\n  assert(pRootContainer->mpDataModelList->add(pDataModel, true));\n  return pDataModel;\n}\n\n\/\/ static\nCFunction * CCopasiRootContainer::getUnsupportedDelay()\n{\n  return pRootContainer->mpUnsupportedDelay;\n}\n\n\/\/ static\nCFunction * CCopasiRootContainer::getUndefinedFunction()\n{\n  return pRootContainer->mpUndefined;\n}\n\n\/\/static\nCKeyFactory* CCopasiRootContainer::getKeyFactory()\n{\n  return &pRootContainer->mKeyFactory;\n}\n\nbool CCopasiRootContainer::removeDatamodel(const CCopasiDataModel * pDatamodel)\n{\n  if (!pDatamodel)\n    {\n      return false;\n    }\n\n  pRootContainer->mpDataModelList->remove((CCopasiDataModel *)pDatamodel);\n  pdelete(pDatamodel);\n\n  return true;\n}\n\nbool CCopasiRootContainer::removeDatamodel(const unsigned C_INT32 index)\n{\n  const CCopasiDataModel* pDatamodel = (*CCopasiRootContainer::getDatamodelList())[index];\n  return CCopasiRootContainer::removeDatamodel(pDatamodel);\n}\n<commit_msg>The configuration file is only saved by the GUI.<commit_after>\/\/ Begin CVS Header\n\/\/   $Source: \/Volumes\/Home\/Users\/shoops\/cvs\/copasi_dev\/copasi\/report\/CCopasiRootContainer.cpp,v $\n\/\/   $Revision: 1.10 $\n\/\/   $Name:  $\n\/\/   $Author: shoops $\n\/\/   $Date: 2009\/08\/01 00:30:25 $\n\/\/ End CVS Header\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#include \"copasi.h\"\n\n#include \"CCopasiRootContainer.h\"\n\n#include \"copasi\/function\/CFunctionDB.h\"\n#include \"copasi\/commandline\/CConfigurationFile.h\"\n#include \"copasi\/commandline\/COptions.h\"\n#include \"copasi\/function\/CFunction.h\"\n#include \"copasi\/function\/CEvaluationNodeOperator.h\"\n#include \"copasi\/function\/CEvaluationNodeVariable.h\"\n#include \"copasi\/function\/CEvaluationNodeConstant.h\"\n\nextern CCopasiRootContainer * pRootContainer;\n\n\/**\n * The default constructor should be private so that nobody can create\n * new instances of the root container.\n * The only way to create a root container is through the static init\n * method.\n *\/\nCCopasiRootContainer::CCopasiRootContainer(const bool & withGUI):\n    CCopasiContainer(\"Root\", NULL, \"CN\", CCopasiObject::Root),\n    mpFunctionList(NULL),\n    mpConfiguration(NULL),\n    mpDataModelList(NULL),\n    mWithGUI(withGUI),\n    mpUnsupportedDelay(NULL),\n    mpUndefined(NULL)\n{}\n\n\/\/ Destructor\nCCopasiRootContainer::~CCopasiRootContainer()\n{\n  \/\/ save and delete the configuration\n  if (mpConfiguration != NULL &&\n      mWithGUI)\n    {\n      mpConfiguration->save();\n    }\n\n  pdelete(mpConfiguration);\n  \/\/ delete the function list\n  pdelete(mpFunctionList);\n  \/\/ delete the model list\n  pdelete(mpDataModelList);\n  \/\/ delete the undefined and the unsupported delay function\n  pdelete(mpUndefined);\n  \/\/ unsupported delay is owned by the function database\n  \/\/ and will be destroyed by it\n  \/\/pdelete(this->mpUnsupportedDelay);\n}\n\n\/**\n * This method creates the only root container.\n *\/\nvoid CCopasiRootContainer::init(int argc, char** argv, const bool & withGUI)\n{\n  COptions::init(argc, argv);\n\n  if (pRootContainer == NULL)\n    pRootContainer = new CCopasiRootContainer(withGUI);\n\n  if (pRootContainer != NULL)\n    pRootContainer->initializeChildren();\n}\n\n\/\/ static\nvoid CCopasiRootContainer::destroy()\n{\n  if (pRootContainer != NULL)\n    {\n      delete pRootContainer;\n      pRootContainer = NULL;\n    }\n\n  COptions::cleanup();\n}\n\nvoid CCopasiRootContainer::initializeChildren()\n{\n  mpFunctionList = new CFunctionDB(\"FunctionDB\", this);\n  mpFunctionList->load();\n\n  mpDataModelList = new CCopasiVector<CCopasiDataModel>(\"ModelList\", this);\n\n  mpConfiguration = new CConfigurationFile;\n  mpConfiguration->load();\n\n  mpUndefined = new CFunction(\"undefined\");\n  mpUndefined->setInfix(\"nan\");\n  mpUndefined->compile();\n\n  mKeyFactory.remove(mpUndefined->getKey());\n  mKeyFactory.addFix(\"UndefinedFunction_0\", mpUndefined);\n\n  mpUnsupportedDelay = new CFunction(\"delay\");\n  mpUnsupportedDelay->addVariable(\"variable\");\n  mpUnsupportedDelay->addVariable(\"timeDelay\");\n\n  CEvaluationNodeOperator* pTmpNode = new CEvaluationNodeOperator(CEvaluationNodeOperator::MULTIPLY, \"*\");\n  pTmpNode->addChild(new CEvaluationNodeVariable(CEvaluationNodeVariable::ANY, \"variable\"));\n  pTmpNode->addChild(new CEvaluationNodeVariable(CEvaluationNodeVariable::ANY, \"timeDelay\"));\n  CEvaluationNodeOperator* pRoot = new CEvaluationNodeOperator(CEvaluationNodeOperator::MULTIPLY, \"*\");\n  pRoot->addChild(pTmpNode);\n  pRoot->addChild(new CEvaluationNodeConstant(CEvaluationNodeConstant::_NaN, \"NAN\"));\n\n  mpUnsupportedDelay->setRoot(pRoot);\n  mpUnsupportedDelay->compile();\n\n  if (mpFunctionList != NULL)\n    mpFunctionList->addAndAdaptName(mpUnsupportedDelay);\n}\n\n\/\/ static\nconst CCopasiContainer * CCopasiRootContainer::getRoot()\n{\n  return pRootContainer;\n}\n\n\/\/ static\nCConfigurationFile * CCopasiRootContainer::getConfiguration()\n{\n  return pRootContainer->mpConfiguration;\n}\n\n\/\/ static\nCFunctionDB * CCopasiRootContainer::getFunctionList()\n{\n  return pRootContainer->mpFunctionList;\n}\n\n\/\/ static\nCCopasiVector< CCopasiDataModel > * CCopasiRootContainer::getDatamodelList()\n{\n  return pRootContainer->mpDataModelList;\n}\n\n\/\/ static\nCCopasiDataModel * CCopasiRootContainer::addDatamodel()\n{\n  CCopasiDataModel* pDataModel = new CCopasiDataModel(pRootContainer->mWithGUI);\n  assert(pRootContainer->mpDataModelList->add(pDataModel, true));\n  return pDataModel;\n}\n\n\/\/ static\nCFunction * CCopasiRootContainer::getUnsupportedDelay()\n{\n  return pRootContainer->mpUnsupportedDelay;\n}\n\n\/\/ static\nCFunction * CCopasiRootContainer::getUndefinedFunction()\n{\n  return pRootContainer->mpUndefined;\n}\n\n\/\/static\nCKeyFactory* CCopasiRootContainer::getKeyFactory()\n{\n  return &pRootContainer->mKeyFactory;\n}\n\nbool CCopasiRootContainer::removeDatamodel(const CCopasiDataModel * pDatamodel)\n{\n  if (!pDatamodel)\n    {\n      return false;\n    }\n\n  pRootContainer->mpDataModelList->remove((CCopasiDataModel *)pDatamodel);\n  pdelete(pDatamodel);\n\n  return true;\n}\n\nbool CCopasiRootContainer::removeDatamodel(const unsigned C_INT32 index)\n{\n  const CCopasiDataModel* pDatamodel = (*CCopasiRootContainer::getDatamodelList())[index];\n  return CCopasiRootContainer::removeDatamodel(pDatamodel);\n}\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\/system\/column_index.hpp\"\n\n#include \"vast\/expression_visitors.hpp\"\n#include \"vast\/load.hpp\"\n#include \"vast\/logger.hpp\"\n#include \"vast\/save.hpp\"\n\nnamespace vast::system {\n\n\/\/ -- free functions -----------------------------------------------------------\n\nnamespace {\n\n\/\/\/ Tries to initialize `res` and returns it on success, otherwise returns the\n\/\/\/ initialization error.\ncaf::expected<column_index_ptr> init_res(column_index_ptr res) {\n  auto err = res->init();\n  if (err)\n    return err;\n  return res;\n}\n\n} \/\/ namespace <anonymous>\n\ncaf::expected<column_index_ptr> make_time_index(path filename) {\n  struct impl : column_index {\n    impl(path&& fname) : column_index(timespan_type{}, std::move(fname)) {\n      \/\/ nop\n    }\n\n    void add(const event& x) override {\n      VAST_TRACE(VAST_ARG(x));\n      idx_->push_back(x.timestamp());\n    }\n  };\n  return init_res(std::make_unique<impl>(std::move(filename)));\n}\n\ncaf::expected<column_index_ptr> make_type_index(path filename) {\n  struct impl : column_index {\n    impl(path&& fname) : column_index(string_type{}, std::move(fname)) {\n      \/\/ nop\n    }\n\n    void add(const event& x) override {\n      VAST_TRACE(VAST_ARG(x));\n      idx_->push_back(x.type().name());\n    }\n  };\n  return init_res(std::make_unique<impl>(std::move(filename)));\n}\n\ncaf::expected<column_index_ptr> make_flat_data_index(path filename,\n                                                     type event_type) {\n  struct impl : column_index {\n    impl(type&& etype, path&& fname)\n      : column_index(std::move(etype), std::move(fname)) {\n        \/\/ nop\n    }\n\n    void add(const event& x) override {\n      VAST_TRACE(VAST_ARG(x));\n      if (x.type() == index_type_)\n        idx_->push_back(x.data());\n    }\n  };\n  return init_res(std::make_unique<impl>(std::move(event_type),\n                                         std::move(filename)));\n}\n\ncaf::expected<column_index_ptr> make_field_data_index(path filename,\n                                                      type field_type,\n                                                      offset off) {\n  struct impl : column_index {\n    impl(type&& ftype, path&& fname, offset o)\n      : column_index(std::move(ftype), std::move(fname)),\n        o_(o) {\n      \/\/ nop\n    }\n\n    void add(const event& x) override {\n      VAST_TRACE(VAST_ARG(x));\n      auto v = get_if<vector>(x.data());\n      if (!v)\n        return;\n      if (auto y = get(*v, o_)) {\n        idx_->push_back(*y);\n        return;\n      }\n      \/\/ If there is no data at a given offset, it means that an intermediate\n      \/\/ record is nil but we're trying to access a deeper field.\n      static const auto nil_data = data{nil};\n      idx_->push_back(nil_data);\n    }\n\n    offset o_;\n  };\n  auto res = std::make_unique<impl>(std::move(field_type), std::move(filename),\n                                    off);\n  return init_res(std::move(res));\n}\n\n\/\/ -- constructors, destructors, and assignment operators ----------------------\n\ncolumn_index::~column_index() {\n  \/\/ nop\n}\n\n\/\/ -- persistency --------------------------------------------------------------\n\ncaf::error column_index::init() {\n  VAST_TRACE(\"\");\n  if (exists(filename_)) {\n    \/\/ Materialize the index when encountering persistent state.\n    detail::value_index_inspect_helper tmp{index_type_, idx_};\n    auto result = load(filename_, last_flush_, tmp);\n    if (!result) {\n      return result.error();\n    } else {\n      VAST_DEBUG(\"loaded value index with offset\", idx_->offset());\n    }\n  } else {\n    \/\/ Otherwise construct a new one.\n    idx_ = value_index::make(index_type_);\n    if (!idx_)\n      return make_error(ec::unspecified, \"failed to construct index\");\n  }\n  return caf::none;\n}\n\ncaf::error column_index::flush_to_disk() {\n  VAST_TRACE(\"\");\n  \/\/ Check whether there's something to write.\n  auto offset = idx_->offset();\n  if (offset == last_flush_)\n    return caf::none;\n  \/\/ Create parent directory if it doesn't exist.\n  auto dir = filename_.parent();\n  if (!exists(dir)) {\n    auto result = mkdir(dir);\n    if (!result)\n      return result.error();\n  }\n  VAST_DEBUG(\"flush index (\" << (offset - last_flush_) << '\/' << offset,\n             \"new\/total bits)\");\n  last_flush_ = offset;\n  detail::value_index_inspect_helper tmp{index_type_, idx_};\n  auto result = save(filename_, last_flush_, tmp);\n  if (!result)\n    return result.error();\n  return caf::none;\n}\n\n\/\/ -- properties -------------------------------------------------------------\n\ncaf::expected<bitmap> column_index::lookup(const predicate& pred) {\n  VAST_TRACE(VAST_ARG(pred));\n  VAST_ASSERT(idx_ != nullptr);\n  auto result = idx_->lookup(pred.op, get<data>(pred.rhs));\n  VAST_DEBUG(VAST_ARG(result));\n  return result;\n}\n\n\/\/ -- constructors, destructors, and assignment operators ----------------------\n\ncolumn_index::column_index(type index_type, path filename)\n  : index_type_(std::move(index_type)),\n    filename_(std::move(filename)) {\n}\n\n} \/\/ namespace vast::system\n<commit_msg>Fix bitmap computation in column index<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\/system\/column_index.hpp\"\n\n#include \"vast\/expression_visitors.hpp\"\n#include \"vast\/load.hpp\"\n#include \"vast\/logger.hpp\"\n#include \"vast\/save.hpp\"\n\nnamespace vast::system {\n\n\/\/ -- free functions -----------------------------------------------------------\n\nnamespace {\n\n\/\/\/ Tries to initialize `res` and returns it on success, otherwise returns the\n\/\/\/ initialization error.\ncaf::expected<column_index_ptr> init_res(column_index_ptr res) {\n  auto err = res->init();\n  if (err)\n    return err;\n  return res;\n}\n\n} \/\/ namespace <anonymous>\n\ncaf::expected<column_index_ptr> make_time_index(path filename) {\n  struct impl : column_index {\n    impl(path&& fname) : column_index(timespan_type{}, std::move(fname)) {\n      \/\/ nop\n    }\n\n    void add(const event& x) override {\n      VAST_TRACE(VAST_ARG(x));\n      idx_->push_back(x.timestamp(), x.id());\n    }\n  };\n  return init_res(std::make_unique<impl>(std::move(filename)));\n}\n\ncaf::expected<column_index_ptr> make_type_index(path filename) {\n  struct impl : column_index {\n    impl(path&& fname) : column_index(string_type{}, std::move(fname)) {\n      \/\/ nop\n    }\n\n    void add(const event& x) override {\n      VAST_TRACE(VAST_ARG(x));\n      idx_->push_back(x.type().name(), x.id());\n    }\n  };\n  return init_res(std::make_unique<impl>(std::move(filename)));\n}\n\ncaf::expected<column_index_ptr> make_flat_data_index(path filename,\n                                                     type event_type) {\n  struct impl : column_index {\n    impl(type&& etype, path&& fname)\n      : column_index(std::move(etype), std::move(fname)) {\n        \/\/ nop\n    }\n\n    void add(const event& x) override {\n      VAST_TRACE(VAST_ARG(x));\n      if (x.type() == index_type_)\n        idx_->push_back(x.data(), x.id());\n    }\n  };\n  return init_res(std::make_unique<impl>(std::move(event_type),\n                                         std::move(filename)));\n}\n\ncaf::expected<column_index_ptr> make_field_data_index(path filename,\n                                                      type field_type,\n                                                      offset off) {\n  struct impl : column_index {\n    impl(type&& ftype, path&& fname, offset o)\n      : column_index(std::move(ftype), std::move(fname)),\n        o_(o) {\n      \/\/ nop\n    }\n\n    void add(const event& x) override {\n      VAST_TRACE(VAST_ARG(x));\n      auto v = get_if<vector>(x.data());\n      if (!v)\n        return;\n      if (auto y = get(*v, o_)) {\n        idx_->push_back(*y, x.id());\n        return;\n      }\n      \/\/ If there is no data at a given offset, it means that an intermediate\n      \/\/ record is nil but we're trying to access a deeper field.\n      static const auto nil_data = data{nil};\n      idx_->push_back(nil_data, x.id());\n    }\n\n    offset o_;\n  };\n  auto res = std::make_unique<impl>(std::move(field_type), std::move(filename),\n                                    off);\n  return init_res(std::move(res));\n}\n\n\/\/ -- constructors, destructors, and assignment operators ----------------------\n\ncolumn_index::~column_index() {\n  \/\/ nop\n}\n\n\/\/ -- persistency --------------------------------------------------------------\n\ncaf::error column_index::init() {\n  VAST_TRACE(\"\");\n  if (exists(filename_)) {\n    \/\/ Materialize the index when encountering persistent state.\n    detail::value_index_inspect_helper tmp{index_type_, idx_};\n    auto result = load(filename_, last_flush_, tmp);\n    if (!result) {\n      return result.error();\n    } else {\n      VAST_DEBUG(\"loaded value index with offset\", idx_->offset());\n    }\n  } else {\n    \/\/ Otherwise construct a new one.\n    idx_ = value_index::make(index_type_);\n    if (!idx_)\n      return make_error(ec::unspecified, \"failed to construct index\");\n  }\n  return caf::none;\n}\n\ncaf::error column_index::flush_to_disk() {\n  VAST_TRACE(\"\");\n  \/\/ Check whether there's something to write.\n  auto offset = idx_->offset();\n  if (offset == last_flush_)\n    return caf::none;\n  \/\/ Create parent directory if it doesn't exist.\n  auto dir = filename_.parent();\n  if (!exists(dir)) {\n    auto result = mkdir(dir);\n    if (!result)\n      return result.error();\n  }\n  VAST_DEBUG(\"flush index (\" << (offset - last_flush_) << '\/' << offset,\n             \"new\/total bits)\");\n  last_flush_ = offset;\n  detail::value_index_inspect_helper tmp{index_type_, idx_};\n  auto result = save(filename_, last_flush_, tmp);\n  if (!result)\n    return result.error();\n  return caf::none;\n}\n\n\/\/ -- properties -------------------------------------------------------------\n\ncaf::expected<bitmap> column_index::lookup(const predicate& pred) {\n  VAST_TRACE(VAST_ARG(pred));\n  VAST_ASSERT(idx_ != nullptr);\n  auto result = idx_->lookup(pred.op, get<data>(pred.rhs));\n  VAST_DEBUG(VAST_ARG(result));\n  return result;\n}\n\n\/\/ -- constructors, destructors, and assignment operators ----------------------\n\ncolumn_index::column_index(type index_type, path filename)\n  : index_type_(std::move(index_type)),\n    filename_(std::move(filename)) {\n}\n\n} \/\/ namespace vast::system\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Poly2Tri Copyright (c) 2009-2010, Poly2Tri Contributors\n * http:\/\/code.google.com\/p\/poly2tri\/\n *\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 * * Neither the name of Poly2Tri 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\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 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#include \"sweep_context.h\"\n#include <algorithm>\n#include \"advancing_front.h\"\n\nnamespace p2t {\n\nSweepContext::SweepContext(std::vector<Point*> polyline)\n{\n  basin = Basin();\n  edge_event = EdgeEvent();\n\n  points_ = polyline;\n\n  InitEdges(points_);\n}\n\nvoid SweepContext::AddHole(std::vector<Point*> polyline)\n{\n  InitEdges(polyline);\n  for(unsigned int i = 0; i < polyline.size(); i++) {\n    points_.push_back(polyline[i]);\n  }\n}\n\nvoid SweepContext::AddPoint(Point* point) {\n  points_.push_back(point);\n}\n\nstd::vector<Triangle*> SweepContext::GetTriangles()\n{\n  return triangles_;\n}\n\nstd::list<Triangle*> SweepContext::GetMap()\n{\n  return map_;\n}\n\nvoid SweepContext::InitTriangulation()\n{\n  double xmax(points_[0]->x), xmin(points_[0]->x);\n  double ymax(points_[0]->y), ymin(points_[0]->y);\n\n  \/\/ Calculate bounds.\n  for (unsigned int i = 0; i < points_.size(); i++) {\n    Point& p = *points_[i];\n    if (p.x > xmax)\n      xmax = p.x;\n    if (p.x < xmin)\n      xmin = p.x;\n    if (p.y > ymax)\n      ymax = p.y;\n    if (p.y < ymin)\n      ymin = p.y;\n  }\n\n  double dx = kAlpha * (xmax - xmin);\n  double dy = kAlpha * (ymax - ymin);\n  head_ = new Point(xmax + dx, ymin - dy);\n  tail_ = new Point(xmin - dx, ymin - dy);\n\n  \/\/ Sort points along y-axis\n  std::sort(points_.begin(), points_.end(), cmp);\n\n}\n\nvoid SweepContext::InitEdges(std::vector<Point*> polyline)\n{\n  int num_points = polyline.size();\n  for (int i = 0; i < num_points; i++) {\n    int j = i < num_points - 1 ? i + 1 : 0;\n    edge_list.push_back(new Edge(*polyline[i], *polyline[j]));\n  }\n}\n\nPoint* SweepContext::GetPoint(const int& index)\n{\n  return points_[index];\n}\n\nvoid SweepContext::AddToMap(Triangle* triangle)\n{\n  map_.push_back(triangle);\n}\n\nNode& SweepContext::LocateNode(Point& point)\n{\n  \/\/ TODO implement search tree\n  return *front_->LocateNode(point.x);\n}\n\nvoid SweepContext::CreateAdvancingFront(std::vector<Node*> nodes)\n{\n\n  (void) nodes;\n  \/\/ Initial triangle\n  Triangle* triangle = new Triangle(*points_[0], *tail_, *head_);\n\n  map_.push_back(triangle);\n\n  af_head_ = new Node(*triangle->GetPoint(1), *triangle);\n  af_middle_ = new Node(*triangle->GetPoint(0), *triangle);\n  af_tail_ = new Node(*triangle->GetPoint(2));\n  front_ = new AdvancingFront(*af_head_, *af_tail_);\n\n  \/\/ TODO: More intuitive if head is middles next and not previous?\n  \/\/       so swap head and tail\n  af_head_->next = af_middle_;\n  af_middle_->next = af_tail_;\n  af_middle_->prev = af_head_;\n  af_tail_->prev = af_middle_;\n}\n\nvoid SweepContext::RemoveNode(Node* node)\n{\n  delete node;\n}\n\nvoid SweepContext::MapTriangleToNodes(Triangle& t)\n{\n  for (int i = 0; i < 3; i++) {\n    if (!t.GetNeighbor(i)) {\n      Node* n = front_->LocatePoint(t.PointCW(*t.GetPoint(i)));\n      if (n)\n        n->triangle = &t;\n    }\n  }\n}\n\nvoid SweepContext::RemoveFromMap(Triangle* triangle)\n{\n  map_.remove(triangle);\n}\n\nvoid SweepContext::MeshClean(Triangle& triangle)\n{\n  std::vector<Triangle *> triangles;\n  triangles.push_back(&triangle);\n\n  while(!triangles.empty()){\n\tTriangle *t = triangles.back();\n\ttriangles.pop_back();\n\n    if (t != NULL && !t->IsInterior()) {\n      t->IsInterior(true);\n      triangles_.push_back(t);\n      for (int i = 0; i < 3; i++) {\n        if (!t->constrained_edge[i])\n          triangles.push_back(t->GetNeighbor(i));\n      }\n    }\n  }\n}\n\nSweepContext::~SweepContext()\n{\n\n    \/\/ Clean up memory\n\n    delete head_;\n    delete tail_;\n    delete front_;\n    delete af_head_;\n    delete af_middle_;\n    delete af_tail_;\n\n    typedef std::list<Triangle*> type_list;\n\n    for(type_list::iterator iter = map_.begin(); iter != map_.end(); ++iter) {\n        Triangle* ptr = *iter;\n        delete ptr;\n    }\n\n     for(unsigned int i = 0; i < edge_list.size(); i++) {\n        delete edge_list[i];\n    }\n\n}\n\n}\n<commit_msg>fixed SweepContext ctor<commit_after>\/*\n * Poly2Tri Copyright (c) 2009-2010, Poly2Tri Contributors\n * http:\/\/code.google.com\/p\/poly2tri\/\n *\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 * * Neither the name of Poly2Tri 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\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 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#include \"sweep_context.h\"\n#include <algorithm>\n#include \"advancing_front.h\"\n\nnamespace p2t {\n\nSweepContext::SweepContext(std::vector<Point*> polyline) :\n  front_(0),\n  head_(0),\n  tail_(0),\n  af_head_(0),\n  af_middle_(0),\n  af_tail_(0)\n{\n  basin = Basin();\n  edge_event = EdgeEvent();\n\n  points_ = polyline;\n\n  InitEdges(points_);\n}\n\nvoid SweepContext::AddHole(std::vector<Point*> polyline)\n{\n  InitEdges(polyline);\n  for(unsigned int i = 0; i < polyline.size(); i++) {\n    points_.push_back(polyline[i]);\n  }\n}\n\nvoid SweepContext::AddPoint(Point* point) {\n  points_.push_back(point);\n}\n\nstd::vector<Triangle*> SweepContext::GetTriangles()\n{\n  return triangles_;\n}\n\nstd::list<Triangle*> SweepContext::GetMap()\n{\n  return map_;\n}\n\nvoid SweepContext::InitTriangulation()\n{\n  double xmax(points_[0]->x), xmin(points_[0]->x);\n  double ymax(points_[0]->y), ymin(points_[0]->y);\n\n  \/\/ Calculate bounds.\n  for (unsigned int i = 0; i < points_.size(); i++) {\n    Point& p = *points_[i];\n    if (p.x > xmax)\n      xmax = p.x;\n    if (p.x < xmin)\n      xmin = p.x;\n    if (p.y > ymax)\n      ymax = p.y;\n    if (p.y < ymin)\n      ymin = p.y;\n  }\n\n  double dx = kAlpha * (xmax - xmin);\n  double dy = kAlpha * (ymax - ymin);\n  head_ = new Point(xmax + dx, ymin - dy);\n  tail_ = new Point(xmin - dx, ymin - dy);\n\n  \/\/ Sort points along y-axis\n  std::sort(points_.begin(), points_.end(), cmp);\n\n}\n\nvoid SweepContext::InitEdges(std::vector<Point*> polyline)\n{\n  int num_points = polyline.size();\n  for (int i = 0; i < num_points; i++) {\n    int j = i < num_points - 1 ? i + 1 : 0;\n    edge_list.push_back(new Edge(*polyline[i], *polyline[j]));\n  }\n}\n\nPoint* SweepContext::GetPoint(const int& index)\n{\n  return points_[index];\n}\n\nvoid SweepContext::AddToMap(Triangle* triangle)\n{\n  map_.push_back(triangle);\n}\n\nNode& SweepContext::LocateNode(Point& point)\n{\n  \/\/ TODO implement search tree\n  return *front_->LocateNode(point.x);\n}\n\nvoid SweepContext::CreateAdvancingFront(std::vector<Node*> nodes)\n{\n\n  (void) nodes;\n  \/\/ Initial triangle\n  Triangle* triangle = new Triangle(*points_[0], *tail_, *head_);\n\n  map_.push_back(triangle);\n\n  af_head_ = new Node(*triangle->GetPoint(1), *triangle);\n  af_middle_ = new Node(*triangle->GetPoint(0), *triangle);\n  af_tail_ = new Node(*triangle->GetPoint(2));\n  front_ = new AdvancingFront(*af_head_, *af_tail_);\n\n  \/\/ TODO: More intuitive if head is middles next and not previous?\n  \/\/       so swap head and tail\n  af_head_->next = af_middle_;\n  af_middle_->next = af_tail_;\n  af_middle_->prev = af_head_;\n  af_tail_->prev = af_middle_;\n}\n\nvoid SweepContext::RemoveNode(Node* node)\n{\n  delete node;\n}\n\nvoid SweepContext::MapTriangleToNodes(Triangle& t)\n{\n  for (int i = 0; i < 3; i++) {\n    if (!t.GetNeighbor(i)) {\n      Node* n = front_->LocatePoint(t.PointCW(*t.GetPoint(i)));\n      if (n)\n        n->triangle = &t;\n    }\n  }\n}\n\nvoid SweepContext::RemoveFromMap(Triangle* triangle)\n{\n  map_.remove(triangle);\n}\n\nvoid SweepContext::MeshClean(Triangle& triangle)\n{\n  std::vector<Triangle *> triangles;\n  triangles.push_back(&triangle);\n\n  while(!triangles.empty()){\n\tTriangle *t = triangles.back();\n\ttriangles.pop_back();\n\n    if (t != NULL && !t->IsInterior()) {\n      t->IsInterior(true);\n      triangles_.push_back(t);\n      for (int i = 0; i < 3; i++) {\n        if (!t->constrained_edge[i])\n          triangles.push_back(t->GetNeighbor(i));\n      }\n    }\n  }\n}\n\nSweepContext::~SweepContext()\n{\n\n    \/\/ Clean up memory\n\n    delete head_;\n    delete tail_;\n    delete front_;\n    delete af_head_;\n    delete af_middle_;\n    delete af_tail_;\n\n    typedef std::list<Triangle*> type_list;\n\n    for(type_list::iterator iter = map_.begin(); iter != map_.end(); ++iter) {\n        Triangle* ptr = *iter;\n        delete ptr;\n    }\n\n     for(unsigned int i = 0; i < edge_list.size(); i++) {\n        delete edge_list[i];\n    }\n\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/base:$Id$\n\/\/ Author: Rene Brun   05\/02\/2007\n\/*************************************************************************\n * Copyright (C) 1995-2007, 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\/\/ TVirtualStreamerInfo   Abstract Interface class                      \/\/\n\/\/                                                                      \/\/\n\/\/ Abstract Interface describing Streamer information for one class.    \/\/\n\/\/                                                                      \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"TROOT.h\"\n#include \"TSystem.h\"\n#include \"TClass.h\"\n#include \"TVirtualMutex.h\"\n#include \"TInterpreter.h\"\n#include \"TVirtualStreamerInfo.h\"\n#include \"TPluginManager.h\"\n#include \"TStreamerElement.h\"\n#include \"TError.h\"\n\n\nTVirtualStreamerInfo *TVirtualStreamerInfo::fgInfoFactory    = 0;\n\nBool_t  TVirtualStreamerInfo::fgCanDelete        = kTRUE;\nBool_t  TVirtualStreamerInfo::fgOptimize         = kTRUE;\nBool_t  TVirtualStreamerInfo::fgStreamMemberWise = kTRUE;\n\nClassImp(TVirtualStreamerInfo)\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Default constructor.\n\nTVirtualStreamerInfo::TVirtualStreamerInfo() : fOptimized(kFALSE), fIsBuilt(kFALSE), fIsCompiled(kFALSE)\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Default constructor.\n\nTVirtualStreamerInfo::TVirtualStreamerInfo(TClass *cl)\n   : TNamed(cl->GetName(),\"\"), fOptimized(kFALSE), fIsBuilt(kFALSE), fIsCompiled(kFALSE)\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/copy constructor\n\nTVirtualStreamerInfo::TVirtualStreamerInfo(const TVirtualStreamerInfo& info)\n  : TNamed(info), fOptimized(kFALSE), fIsBuilt(kFALSE), fIsCompiled(kFALSE)\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/assignment operator\n\nTVirtualStreamerInfo& TVirtualStreamerInfo::operator=(const TVirtualStreamerInfo& info)\n{\n   if(this!=&info) {\n      TNamed::operator=(info);\n   }\n   return *this;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Destructor\n\nTVirtualStreamerInfo::~TVirtualStreamerInfo()\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ static function returning true if ReadBuffer can delete object\n\nBool_t TVirtualStreamerInfo::CanDelete()\n{\n   return fgCanDelete;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ static function returning true if optimization can be on\n\nBool_t TVirtualStreamerInfo::CanOptimize()\n{\n   return fgOptimize;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Given a comment\/title declaring an array counter, for example:\n\/\/\/    \/\/[fArraySize] array of size fArraySize\n\/\/\/ return the start of the array dimension declaration start in the string\n\/\/\/ (so the location of the 'f'.\n\nconst char *TVirtualStreamerInfo::GetElementCounterStart(const char *dmTitle)\n{\n   for (const char *lbracket = dmTitle; *lbracket; ++lbracket) {\n      \/\/ = ::strchr(dmTitle, '[');\n      if ( (*lbracket) == '[' ) return lbracket;\n      if ( (*lbracket) != '\/' && !isspace(*lbracket) ) {\n         \/\/ Allow only comment delimiters and white spaces\n         \/\/ before the array information.\n         return 0;\n      }\n   }\n   return 0;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Get pointer to a TStreamerBasicType in TClass *cl\n\/\/\/static function\n\nTStreamerBasicType *TVirtualStreamerInfo::GetElementCounter(const char *countName, TClass *cl)\n{\n   TVirtualStreamerInfo *info;\n   {\n      R__LOCKGUARD(gInterpreterMutex);\n      const TObjArray *sinfos = cl->GetStreamerInfos();\n      info = (TVirtualStreamerInfo *)sinfos->At(cl->GetClassVersion());\n   }\n\n   if (!info || !info->IsCompiled()) {\n      \/\/ Even if the streamerInfo exist, it could still need to be 'build'\n      \/\/ It is important to figure this out, because\n      \/\/   a) if it is not build, we need to build\n      \/\/   b) if is build, we should not build it (or we could end up in an\n      \/\/      infinite loop, if the element and its counter are in the same\n      \/\/      class!\n      \/\/ Checking IsCompiled is sufficint here even-though it is set only at\n      \/\/ the end of the call to Build as this function has an\n      \/\/ internal recursion prevention (setting and testing kBuildRunning).\n      info = cl->GetStreamerInfo();\n   }\n   if (!info) return 0;\n   TStreamerElement *element = (TStreamerElement *)info->GetElements()->FindObject(countName);\n   if (!element) return 0;\n   if (element->IsA() == TStreamerBasicType::Class()) return (TStreamerBasicType*)element;\n   return 0;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Return whether the TStreamerInfos will save the collections in\n\/\/\/ \"member-wise\" order whenever possible.    The default is to store member-wise.\n\/\/\/ kTRUE indicates member-wise storing\n\/\/\/ kFALSE inddicates object-wise storing\n\/\/\/\n\/\/\/ A collection can be saved member wise when it contain is guaranteed to be\n\/\/\/ homogeneous.  For example std::vector<THit> can be stored member wise,\n\/\/\/ while std::vector<THit*> can not (possible use of polymorphism).\n\nBool_t TVirtualStreamerInfo::GetStreamMemberWise()\n{\n   return fgStreamMemberWise;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/  This is a static function.\n\/\/\/  Set optimization option.\n\/\/\/  When this option is activated (default), consecutive data members\n\/\/\/  of the same type are merged into an array (faster).\n\/\/\/  Optimization must be off in TTree split mode.\n\nvoid TVirtualStreamerInfo::Optimize(Bool_t opt)\n{\n   fgOptimize = opt;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Static function returning a pointer to a new TVirtualStreamerInfo object.\n\/\/\/ If the Info factory does not exist, it is created via the plugin manager.\n\/\/\/ In reality the factory is an empty TStreamerInfo object.\n\nTVirtualStreamerInfo *TVirtualStreamerInfo::Factory()\n{\n   if (!fgInfoFactory) {\n      TPluginHandler *h;\n      if ((h = gROOT->GetPluginManager()->FindHandler(\"TVirtualStreamerInfo\",\"TStreamerInfo\"))) {\n         if (h->LoadPlugin() == -1) {\n            ::Fatal(\"TVirtualStreamerInfo::Factory\",\n                    \"The plugin handler for TVirtualStreamerInfo was found but failed to load!\");\n         }\n         fgInfoFactory = (TVirtualStreamerInfo*) h->ExecPlugin(0);\n         if (fgInfoFactory == 0) {\n            ::Fatal(\"TVirtualStreamerInfo::Factory\",\n                    \"The plugin handler for TVirtualStreamerInfo was found but failed to create the factory object!\");\n         }\n      } else {\n         TString filename(\"$ROOTSYS\/etc\/plugins\/TVirtualStreamerInfo\");\n         gSystem->ExpandPathName(filename);\n         if (gSystem->AccessPathName(filename)) {\n            ::Fatal(\"TVirtualStreamerInfo::Factory\",\n                    \"Cannot find the plugin handler for TVirtualStreamerInfo! \"\n                    \"$ROOTSYS\/etc\/plugins\/TVirtualStreamerInfo does not exist \"\n                    \"or is inaccessible.\");\n         } else {\n            ::Fatal(\"TVirtualStreamerInfo::Factory\",\n                    \"Cannot find the plugin handler for TVirtualStreamerInfo! \"\n                    \"However $ROOTSYS\/etc\/plugins\/TVirtualStreamerInfo is accessible, \"\n                    \"Check the content of this directory!\");\n         }\n      }\n   }\n\n   return fgInfoFactory;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/  This is a static function.\n\/\/\/  Set object delete option.\n\/\/\/  When this option is activated (default), ReadBuffer automatically\n\/\/\/  delete objects when a data member is a pointer to an object.\n\/\/\/  If your constructor is not presetting pointers to 0, you must\n\/\/\/  call this static function TStreamerInfo::SetCanDelete(kFALSE);\n\nvoid TVirtualStreamerInfo::SetCanDelete(Bool_t opt)\n{\n   fgCanDelete = opt;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/static function: Set the StreamerInfo factory\n\nvoid TVirtualStreamerInfo::SetFactory(TVirtualStreamerInfo *factory)\n{\n   fgInfoFactory = factory;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Set whether the TStreamerInfos will save the collections in\n\/\/\/ \"member-wise\" order whenever possible.  The default is to store member-wise.\n\/\/\/ kTRUE indicates member-wise storing\n\/\/\/ kFALSE inddicates object-wise storing\n\/\/\/ This function returns the previous value of fgStreamMemberWise.\n\nBool_t TVirtualStreamerInfo::SetStreamMemberWise(Bool_t enable)\n{\n   \/\/ A collection can be saved member wise when it contain is guaranteed to be\n   \/\/ homogeneous.  For example std::vector<THit> can be stored member wise,\n   \/\/ while std::vector<THit*> can not (possible use of polymorphism).\n\n   Bool_t prev = fgStreamMemberWise;\n   fgStreamMemberWise = enable;\n   return prev;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Stream an object of class TVirtualStreamerInfo.\n\nvoid TVirtualStreamerInfo::Streamer(TBuffer &R__b)\n{\n   TNamed::Streamer(R__b);\n}\n<commit_msg>Doxygen<commit_after>\/\/ @(#)root\/base:$Id$\n\/\/ Author: Rene Brun   05\/02\/2007\n\/*************************************************************************\n * Copyright (C) 1995-2007, 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\/** \\class TVirtualStreamerInfo\nAbstract Interface class describing Streamer information for one class.\n*\/\n\n#include \"TROOT.h\"\n#include \"TSystem.h\"\n#include \"TClass.h\"\n#include \"TVirtualMutex.h\"\n#include \"TInterpreter.h\"\n#include \"TVirtualStreamerInfo.h\"\n#include \"TPluginManager.h\"\n#include \"TStreamerElement.h\"\n#include \"TError.h\"\n\n\nTVirtualStreamerInfo *TVirtualStreamerInfo::fgInfoFactory    = 0;\n\nBool_t  TVirtualStreamerInfo::fgCanDelete        = kTRUE;\nBool_t  TVirtualStreamerInfo::fgOptimize         = kTRUE;\nBool_t  TVirtualStreamerInfo::fgStreamMemberWise = kTRUE;\n\nClassImp(TVirtualStreamerInfo)\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Default constructor.\n\nTVirtualStreamerInfo::TVirtualStreamerInfo() : fOptimized(kFALSE), fIsBuilt(kFALSE), fIsCompiled(kFALSE)\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Default constructor.\n\nTVirtualStreamerInfo::TVirtualStreamerInfo(TClass *cl)\n   : TNamed(cl->GetName(),\"\"), fOptimized(kFALSE), fIsBuilt(kFALSE), fIsCompiled(kFALSE)\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/copy constructor\n\nTVirtualStreamerInfo::TVirtualStreamerInfo(const TVirtualStreamerInfo& info)\n  : TNamed(info), fOptimized(kFALSE), fIsBuilt(kFALSE), fIsCompiled(kFALSE)\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/assignment operator\n\nTVirtualStreamerInfo& TVirtualStreamerInfo::operator=(const TVirtualStreamerInfo& info)\n{\n   if(this!=&info) {\n      TNamed::operator=(info);\n   }\n   return *this;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Destructor\n\nTVirtualStreamerInfo::~TVirtualStreamerInfo()\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ static function returning true if ReadBuffer can delete object\n\nBool_t TVirtualStreamerInfo::CanDelete()\n{\n   return fgCanDelete;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ static function returning true if optimization can be on\n\nBool_t TVirtualStreamerInfo::CanOptimize()\n{\n   return fgOptimize;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Given a comment\/title declaring an array counter, for example:\n\/\/\/ ~~~ {.cpp}\n\/\/\/    \/\/[fArraySize] array of size fArraySize\n\/\/\/ ~~~\n\/\/\/ return the start of the array dimension declaration start in the string\n\/\/\/ (so the location of the 'f'.\n\nconst char *TVirtualStreamerInfo::GetElementCounterStart(const char *dmTitle)\n{\n   for (const char *lbracket = dmTitle; *lbracket; ++lbracket) {\n      \/\/ = ::strchr(dmTitle, '[');\n      if ( (*lbracket) == '[' ) return lbracket;\n      if ( (*lbracket) != '\/' && !isspace(*lbracket) ) {\n         \/\/ Allow only comment delimiters and white spaces\n         \/\/ before the array information.\n         return 0;\n      }\n   }\n   return 0;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Get pointer to a TStreamerBasicType in TClass *cl\n\/\/\/static function\n\nTStreamerBasicType *TVirtualStreamerInfo::GetElementCounter(const char *countName, TClass *cl)\n{\n   TVirtualStreamerInfo *info;\n   {\n      R__LOCKGUARD(gInterpreterMutex);\n      const TObjArray *sinfos = cl->GetStreamerInfos();\n      info = (TVirtualStreamerInfo *)sinfos->At(cl->GetClassVersion());\n   }\n\n   if (!info || !info->IsCompiled()) {\n      \/\/ Even if the streamerInfo exist, it could still need to be 'build'\n      \/\/ It is important to figure this out, because\n      \/\/   a) if it is not build, we need to build\n      \/\/   b) if is build, we should not build it (or we could end up in an\n      \/\/      infinite loop, if the element and its counter are in the same\n      \/\/      class!\n      \/\/ Checking IsCompiled is sufficient here even-though it is set only at\n      \/\/ the end of the call to Build as this function has an\n      \/\/ internal recursion prevention (setting and testing kBuildRunning).\n      info = cl->GetStreamerInfo();\n   }\n   if (!info) return 0;\n   TStreamerElement *element = (TStreamerElement *)info->GetElements()->FindObject(countName);\n   if (!element) return 0;\n   if (element->IsA() == TStreamerBasicType::Class()) return (TStreamerBasicType*)element;\n   return 0;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Return whether the TStreamerInfos will save the collections in\n\/\/\/ \"member-wise\" order whenever possible.    The default is to store member-wise.\n\/\/\/  --kTRUE indicates member-wise storing\n\/\/\/  - kFALSE inddicates object-wise storing\n\/\/\/\n\/\/\/ A collection can be saved member wise when it contain is guaranteed to be\n\/\/\/ homogeneous.  For example std::vector<THit> can be stored member wise,\n\/\/\/ while std::vector<THit*> can not (possible use of polymorphism).\n\nBool_t TVirtualStreamerInfo::GetStreamMemberWise()\n{\n   return fgStreamMemberWise;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/  This is a static function.\n\/\/\/  Set optimization option.\n\/\/\/  When this option is activated (default), consecutive data members\n\/\/\/  of the same type are merged into an array (faster).\n\/\/\/  Optimization must be off in TTree split mode.\n\nvoid TVirtualStreamerInfo::Optimize(Bool_t opt)\n{\n   fgOptimize = opt;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Static function returning a pointer to a new TVirtualStreamerInfo object.\n\/\/\/ If the Info factory does not exist, it is created via the plugin manager.\n\/\/\/ In reality the factory is an empty TStreamerInfo object.\n\nTVirtualStreamerInfo *TVirtualStreamerInfo::Factory()\n{\n   if (!fgInfoFactory) {\n      TPluginHandler *h;\n      if ((h = gROOT->GetPluginManager()->FindHandler(\"TVirtualStreamerInfo\",\"TStreamerInfo\"))) {\n         if (h->LoadPlugin() == -1) {\n            ::Fatal(\"TVirtualStreamerInfo::Factory\",\n                    \"The plugin handler for TVirtualStreamerInfo was found but failed to load!\");\n         }\n         fgInfoFactory = (TVirtualStreamerInfo*) h->ExecPlugin(0);\n         if (fgInfoFactory == 0) {\n            ::Fatal(\"TVirtualStreamerInfo::Factory\",\n                    \"The plugin handler for TVirtualStreamerInfo was found but failed to create the factory object!\");\n         }\n      } else {\n         TString filename(\"$ROOTSYS\/etc\/plugins\/TVirtualStreamerInfo\");\n         gSystem->ExpandPathName(filename);\n         if (gSystem->AccessPathName(filename)) {\n            ::Fatal(\"TVirtualStreamerInfo::Factory\",\n                    \"Cannot find the plugin handler for TVirtualStreamerInfo! \"\n                    \"$ROOTSYS\/etc\/plugins\/TVirtualStreamerInfo does not exist \"\n                    \"or is inaccessible.\");\n         } else {\n            ::Fatal(\"TVirtualStreamerInfo::Factory\",\n                    \"Cannot find the plugin handler for TVirtualStreamerInfo! \"\n                    \"However $ROOTSYS\/etc\/plugins\/TVirtualStreamerInfo is accessible, \"\n                    \"Check the content of this directory!\");\n         }\n      }\n   }\n\n   return fgInfoFactory;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/  This is a static function.\n\/\/\/  Set object delete option.\n\/\/\/  When this option is activated (default), ReadBuffer automatically\n\/\/\/  delete objects when a data member is a pointer to an object.\n\/\/\/  If your constructor is not presetting pointers to 0, you must\n\/\/\/  call this static function TStreamerInfo::SetCanDelete(kFALSE);\n\nvoid TVirtualStreamerInfo::SetCanDelete(Bool_t opt)\n{\n   fgCanDelete = opt;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/static function: Set the StreamerInfo factory\n\nvoid TVirtualStreamerInfo::SetFactory(TVirtualStreamerInfo *factory)\n{\n   fgInfoFactory = factory;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Set whether the TStreamerInfos will save the collections in\n\/\/\/ \"member-wise\" order whenever possible.  The default is to store member-wise.\n\/\/\/  - kTRUE indicates member-wise storing\n\/\/\/  - kFALSE indicates object-wise storing\n\/\/\/ This function returns the previous value of fgStreamMemberWise.\n\nBool_t TVirtualStreamerInfo::SetStreamMemberWise(Bool_t enable)\n{\n   \/\/ A collection can be saved member wise when it contain is guaranteed to be\n   \/\/ homogeneous.  For example std::vector<THit> can be stored member wise,\n   \/\/ while std::vector<THit*> can not (possible use of polymorphism).\n\n   Bool_t prev = fgStreamMemberWise;\n   fgStreamMemberWise = enable;\n   return prev;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Stream an object of class TVirtualStreamerInfo.\n\nvoid TVirtualStreamerInfo::Streamer(TBuffer &R__b)\n{\n   TNamed::Streamer(R__b);\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef CEREAL_BINARY_ARCHIVE_SET_HPP_\n#define CEREAL_BINARY_ARCHIVE_SET_HPP_\n\n#include <cereal\/binary_archive\/binary_archive.hpp>\n#include <set>\n\nnamespace cereal\n{\n  \/\/! Saving for std::set to binary\n  template <class K, class H, class KE, class A>\n  void save( BinaryOutputArchive & ar, std::set<K, H, KE, A> const & set )\n  {\n    ar & set.size();\n\n    for( const auto & i : set )\n      ar & i;\n  }\n\n  \/\/! Loading for std::set to binary\n  template <class K, class H, class KE, class A>\n  void load( BinaryInputArchive & ar, std::set<K, H, KE, A> & set )\n  {\n    size_t size;\n    ar & size;\n\n    for( size_t i = 0; i < size; ++i )\n    {\n      K key;\n\n      ar & key;\n      set.insert( key );\n    }\n  }\n\n  \/\/! Saving for std::multiset to binary\n  template <class K, class H, class KE, class A>\n  void save( BinaryOutputArchive & ar, std::multiset<K, H, KE, A> const & multiset )\n  {\n    ar & multiset.size();\n\n    for( const auto & i : multiset )\n      ar & i;\n  }\n\n  \/\/! Loading for std::multiset to binary\n  template <class K, class H, class KE, class A>\n  void load( BinaryInputArchive & ar, std::multiset<K, H, KE, A> & multiset )\n  {\n    size_t size;\n    ar & size;\n\n    for( size_t i = 0; i < size; ++i )\n    {\n      K key;\n\n      ar & key;\n      multiset.insert( key );\n    }\n  }\n} \/\/ namespace cereal\n\n#endif \/\/ CEREAL_BINARY_ARCHIVE_SET_HPP_\n<commit_msg>Fixed template arguments in set<commit_after>#ifndef CEREAL_BINARY_ARCHIVE_SET_HPP_\n#define CEREAL_BINARY_ARCHIVE_SET_HPP_\n\n#include <cereal\/binary_archive\/binary_archive.hpp>\n#include <set>\n\nnamespace cereal\n{\n  \/\/! Saving for std::set to binary\n  template <class K, class C, class A>\n  void save( BinaryOutputArchive & ar, std::set<K, C, A> const & set )\n  {\n    ar & set.size();\n\n    for( const auto & i : set )\n      ar & i;\n  }\n\n  \/\/! Loading for std::set to binary\n  template <class K, class C, class A>\n  void load( BinaryInputArchive & ar, std::set<K, C, A> & set )\n  {\n    size_t size;\n    ar & size;\n\n    for( size_t i = 0; i < size; ++i )\n    {\n      K key;\n\n      ar & key;\n      set.insert( key );\n    }\n  }\n\n  \/\/! Saving for std::multiset to binary\n  template <class K, class C, class A>\n  void save( BinaryOutputArchive & ar, std::multiset<K, C, A> const & multiset )\n  {\n    ar & multiset.size();\n\n    for( const auto & i : multiset )\n      ar & i;\n  }\n\n  \/\/! Loading for std::multiset to binary\n  template <class K, class C, class A>\n  void load( BinaryInputArchive & ar, std::multiset<K, C, A> & multiset )\n  {\n    size_t size;\n    ar & size;\n\n    for( size_t i = 0; i < size; ++i )\n    {\n      K key;\n\n      ar & key;\n      multiset.insert( key );\n    }\n  }\n} \/\/ namespace cereal\n\n#endif \/\/ CEREAL_BINARY_ARCHIVE_SET_HPP_\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>End to end tests for constants.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/***************************************************************************\r\n *   Copyright (c) 2012 Jan Rheinländer                                    *\r\n *                                   <jrheinlaender@users.sourceforge.net> *\r\n *                                                                         *\r\n *   This file is part of the FreeCAD CAx development system.              *\r\n *                                                                         *\r\n *   This library is free software; you can redistribute it and\/or         *\r\n *   modify it under the terms of the GNU Library General Public           *\r\n *   License as published by the Free Software Foundation; either          *\r\n *   version 2 of the License, or (at your option) any later version.      *\r\n *                                                                         *\r\n *   This library  is distributed in the hope that it will be useful,      *\r\n *   but WITHOUT ANY WARRANTY; without even the implied warranty of        *\r\n *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the         *\r\n *   GNU Library General Public License for more details.                  *\r\n *                                                                         *\r\n *   You should have received a copy of the GNU Library General Public     *\r\n *   License along with this library; see the file COPYING.LIB. If not,    *\r\n *   write to the Free Software Foundation, Inc., 59 Temple Place,         *\r\n *   Suite 330, Boston, MA  02111-1307, USA                                *\r\n *                                                                         *\r\n ***************************************************************************\/\r\n\r\n\r\n#include \"PreCompiled.h\"\r\n\r\n#ifndef _PreComp_\r\n# include <QListWidgetItem>\r\n#endif\r\n\r\n#include <boost\/algorithm\/string\/predicate.hpp>\r\n#include \"TaskDressUpParameters.h\"\r\n#include <App\/Application.h>\r\n#include <App\/Document.h>\r\n#include <Gui\/Application.h>\r\n#include <Gui\/Document.h>\r\n#include <Gui\/BitmapFactory.h>\r\n#include <Gui\/ViewProvider.h>\r\n#include <Gui\/WaitCursor.h>\r\n#include <Base\/Console.h>\r\n#include <Gui\/Selection.h>\r\n#include <Gui\/Command.h>\r\n#include <Gui\/MainWindow.h>\r\n#include <Mod\/PartDesign\/App\/FeatureDressUp.h>\r\n#include <Mod\/PartDesign\/Gui\/ReferenceSelection.h>\r\n\r\nFC_LOG_LEVEL_INIT(\"PartDesign\",true,true)\r\n\r\nusing namespace PartDesignGui;\r\nusing namespace Gui;\r\n\r\n\/* TRANSLATOR PartDesignGui::TaskDressUpParameters *\/\r\n\r\nTaskDressUpParameters::TaskDressUpParameters(ViewProviderDressUp *DressUpView, bool selectEdges, bool selectFaces, QWidget *parent)\r\n    : TaskBox(Gui::BitmapFactory().pixmap((std::string(\"PartDesign_\") + DressUpView->featureName()).c_str()),\r\n              QString::fromLatin1((DressUpView->featureName() + \" parameters\").c_str()),\r\n              true,\r\n              parent)\r\n    , proxy(0)\r\n    , DressUpView(DressUpView)\r\n    , allowFaces(selectFaces)\r\n    , allowEdges(selectEdges)\r\n{\r\n    selectionMode = none;\r\n    showObject();\r\n}\r\n\r\nTaskDressUpParameters::~TaskDressUpParameters()\r\n{\r\n    \/\/ make sure to remove selection gate in all cases\r\n    Gui::Selection().rmvSelectionGate();\r\n}\r\n\r\nvoid TaskDressUpParameters::setupTransaction() {\r\n    int tid = 0;\r\n    const char *name = App::GetApplication().getActiveTransaction(&tid);\r\n    std::string n(\"Edit \");\r\n    n += DressUpView->getObject()->Label.getValue();\r\n    if(!name || n != name)\r\n        App::GetApplication().setActiveTransaction(n.c_str());\r\n}\r\n\r\nbool TaskDressUpParameters::referenceSelected(const Gui::SelectionChanges& msg)\r\n{\r\n    if ((msg.Type == Gui::SelectionChanges::AddSelection) && (\r\n                (selectionMode == refAdd) || (selectionMode == refRemove))) {\r\n\r\n        if (strcmp(msg.pDocName, DressUpView->getObject()->getDocument()->getName()) != 0)\r\n            return false;\r\n\r\n        PartDesign::DressUp* pcDressUp = static_cast<PartDesign::DressUp*>(DressUpView->getObject());\r\n        App::DocumentObject* base = this->getBase();\r\n\r\n        \/\/ TODO: Must we make a copy here instead of assigning to const char* ?\r\n        const char* fname = base->getNameInDocument();        \r\n        if (strcmp(msg.pObjectName, fname) != 0)\r\n            return false;\r\n\r\n        std::string subName(msg.pSubName);\r\n        std::vector<std::string> refs = pcDressUp->Base.getSubValues();\r\n        std::vector<std::string>::iterator f = std::find(refs.begin(), refs.end(), subName);\r\n\r\n        if (selectionMode == refAdd) {\r\n            if (f == refs.end())\r\n                refs.push_back(subName);\r\n            else\r\n                return false; \/\/ duplicate selection\r\n        } else {\r\n            if (f != refs.end())\r\n                refs.erase(f);\r\n            else\r\n                return false;\r\n        }\r\n        DressUpView->highlightReferences(false);\r\n        setupTransaction();\r\n        pcDressUp->Base.setValue(base, refs);        \r\n        pcDressUp->getDocument()->recomputeFeature(pcDressUp);\r\n\r\n        return true;\r\n    }\r\n\r\n    return false;\r\n}\r\n\r\nvoid TaskDressUpParameters::onButtonRefAdd(bool checked)\r\n{\r\n    if (checked) {\r\n        clearButtons(refAdd);\r\n        hideObject();\r\n        selectionMode = refAdd;\r\n        Gui::Selection().clearSelection();\r\n        Gui::Selection().addSelectionGate(new ReferenceSelection(this->getBase(), allowEdges, allowFaces, false));\r\n        DressUpView->highlightReferences(true);\r\n    } else {\r\n        clearButtons(none); \r\n        exitSelectionMode();\r\n        showObject();\r\n        DressUpView->highlightReferences(false);\r\n    }\r\n}\r\n\r\nvoid TaskDressUpParameters::onButtonRefRemove(const bool checked)\r\n{\r\n    if (checked) {\r\n        clearButtons(refRemove);\r\n        hideObject();\r\n        selectionMode = refRemove;\r\n        Gui::Selection().clearSelection();        \r\n        Gui::Selection().addSelectionGate(new ReferenceSelection(this->getBase(), allowEdges, allowFaces, false));\r\n        DressUpView->highlightReferences(true);\r\n    }\r\n    else {\r\n        clearButtons(none);\r\n        exitSelectionMode();\r\n        showObject();\r\n        DressUpView->highlightReferences(false);\r\n    }\r\n}\r\n\r\nconst std::vector<std::string> TaskDressUpParameters::getReferences() const\r\n{\r\n    PartDesign::DressUp* pcDressUp = static_cast<PartDesign::DressUp*>(DressUpView->getObject());\r\n    std::vector<std::string> result = pcDressUp->Base.getSubValues();\r\n    return result;\r\n}\r\n\r\n\/\/ TODO: This code is identical with TaskTransformedParameters::removeItemFromListWidget()\r\nvoid TaskDressUpParameters::removeItemFromListWidget(QListWidget* widget, const char* itemstr)\r\n{\r\n    QList<QListWidgetItem*> items = widget->findItems(QString::fromLatin1(itemstr), Qt::MatchExactly);\r\n    if (!items.empty()) {\r\n        for (QList<QListWidgetItem*>::const_iterator i = items.begin(); i != items.end(); i++) {\r\n            QListWidgetItem* it = widget->takeItem(widget->row(*i));\r\n            delete it;\r\n        }\r\n    }\r\n}\r\n\r\nvoid TaskDressUpParameters::hideObject()\r\n{\r\n    App::DocumentObject* base = getBase();\r\n    if(base) {\r\n        DressUpView->getObject()->Visibility.setValue(false);\r\n        base->Visibility.setValue(true);\r\n    }\r\n}\r\n\r\nvoid TaskDressUpParameters::showObject()\r\n{\r\n    DressUpView->getObject()->Visibility.setValue(true);\r\n    App::DocumentObject* base = getBase();\r\n    if (base) \r\n        base->Visibility.setValue(false);\r\n}\r\n\r\nPart::Feature* TaskDressUpParameters::getBase(void) const\r\n{\r\n    PartDesign::DressUp* pcDressUp = static_cast<PartDesign::DressUp*>(DressUpView->getObject());\r\n    \/\/ Unlikely but this may throw an exception in case we are started to edit an object which base feature\r\n    \/\/ was deleted. This exception will be likely unhandled inside the dialog and pass upper, But an error\r\n    \/\/ message inside the report view is better than a SEGFAULT.\r\n    \/\/ Generally this situation should be prevented in ViewProviderDressUp::setEdit()\r\n    return pcDressUp->getBaseObject();\r\n}\r\n\r\nvoid TaskDressUpParameters::exitSelectionMode()\r\n{\r\n    selectionMode = none;\r\n    Gui::Selection().rmvSelectionGate();\r\n    Gui::Selection().clearSelection();\r\n    showObject();\r\n}\r\n\r\n\/\/**************************************************************************\r\n\/\/**************************************************************************\r\n\/\/ TaskDialog\r\n\/\/++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\r\n\r\nTaskDlgDressUpParameters::TaskDlgDressUpParameters(ViewProviderDressUp *DressUpView)\r\n    : TaskDlgFeatureParameters(DressUpView)\r\n    , parameter(0)\r\n{\r\n    assert(DressUpView);\r\n}\r\n\r\nTaskDlgDressUpParameters::~TaskDlgDressUpParameters()\r\n{\r\n\r\n}\r\n\r\n\/\/==== calls from the TaskView ===============================================================\r\n\r\nbool TaskDlgDressUpParameters::accept()\r\n{\r\n    getDressUpView()->highlightReferences(false);\r\n\r\n    std::vector<std::string> refs = parameter->getReferences();\r\n    std::stringstream str;\r\n    str << Gui::Command::getObjectCmd(vp->getObject()) << \".Base = (\" \r\n        << Gui::Command::getObjectCmd(parameter->getBase()) << \",[\";\r\n    for (std::vector<std::string>::const_iterator it = refs.begin(); it != refs.end(); ++it)\r\n        str << \"\\\"\" << *it << \"\\\",\";\r\n    str << \"])\";\r\n    Gui::Command::runCommand(Gui::Command::Doc,str.str().c_str());\r\n    return TaskDlgFeatureParameters::accept();\r\n}\r\n\r\nbool TaskDlgDressUpParameters::reject()\r\n{\r\n    getDressUpView()->highlightReferences(false);\r\n    return TaskDlgFeatureParameters::reject();\r\n}\r\n\r\n#include \"moc_TaskDressUpParameters.cpp\"\r\n<commit_msg>fix logic<commit_after>\/***************************************************************************\r\n *   Copyright (c) 2012 Jan Rheinländer                                    *\r\n *                                   <jrheinlaender@users.sourceforge.net> *\r\n *                                                                         *\r\n *   This file is part of the FreeCAD CAx development system.              *\r\n *                                                                         *\r\n *   This library is free software; you can redistribute it and\/or         *\r\n *   modify it under the terms of the GNU Library General Public           *\r\n *   License as published by the Free Software Foundation; either          *\r\n *   version 2 of the License, or (at your option) any later version.      *\r\n *                                                                         *\r\n *   This library  is distributed in the hope that it will be useful,      *\r\n *   but WITHOUT ANY WARRANTY; without even the implied warranty of        *\r\n *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the         *\r\n *   GNU Library General Public License for more details.                  *\r\n *                                                                         *\r\n *   You should have received a copy of the GNU Library General Public     *\r\n *   License along with this library; see the file COPYING.LIB. If not,    *\r\n *   write to the Free Software Foundation, Inc., 59 Temple Place,         *\r\n *   Suite 330, Boston, MA  02111-1307, USA                                *\r\n *                                                                         *\r\n ***************************************************************************\/\r\n\r\n\r\n#include \"PreCompiled.h\"\r\n\r\n#ifndef _PreComp_\r\n# include <QListWidgetItem>\r\n#endif\r\n\r\n#include <boost\/algorithm\/string\/predicate.hpp>\r\n#include \"TaskDressUpParameters.h\"\r\n#include <App\/Application.h>\r\n#include <App\/Document.h>\r\n#include <Gui\/Application.h>\r\n#include <Gui\/Document.h>\r\n#include <Gui\/BitmapFactory.h>\r\n#include <Gui\/ViewProvider.h>\r\n#include <Gui\/WaitCursor.h>\r\n#include <Base\/Console.h>\r\n#include <Gui\/Selection.h>\r\n#include <Gui\/Command.h>\r\n#include <Gui\/MainWindow.h>\r\n#include <Mod\/PartDesign\/App\/FeatureDressUp.h>\r\n#include <Mod\/PartDesign\/Gui\/ReferenceSelection.h>\r\n\r\nFC_LOG_LEVEL_INIT(\"PartDesign\",true,true)\r\n\r\nusing namespace PartDesignGui;\r\nusing namespace Gui;\r\n\r\n\/* TRANSLATOR PartDesignGui::TaskDressUpParameters *\/\r\n\r\nTaskDressUpParameters::TaskDressUpParameters(ViewProviderDressUp *DressUpView, bool selectEdges, bool selectFaces, QWidget *parent)\r\n    : TaskBox(Gui::BitmapFactory().pixmap((std::string(\"PartDesign_\") + DressUpView->featureName()).c_str()),\r\n              QString::fromLatin1((DressUpView->featureName() + \" parameters\").c_str()),\r\n              true,\r\n              parent)\r\n    , proxy(0)\r\n    , DressUpView(DressUpView)\r\n    , allowFaces(selectFaces)\r\n    , allowEdges(selectEdges)\r\n{\r\n    selectionMode = none;\r\n    showObject();\r\n}\r\n\r\nTaskDressUpParameters::~TaskDressUpParameters()\r\n{\r\n    \/\/ make sure to remove selection gate in all cases\r\n    Gui::Selection().rmvSelectionGate();\r\n}\r\n\r\nvoid TaskDressUpParameters::setupTransaction() {\r\n    int tid = 0;\r\n    const char *name = App::GetApplication().getActiveTransaction(&tid);\r\n    std::string n(\"Edit \");\r\n    n += DressUpView->getObject()->Label.getValue();\r\n    if(!name || n != name)\r\n        App::GetApplication().setActiveTransaction(n.c_str());\r\n}\r\n\r\nbool TaskDressUpParameters::referenceSelected(const Gui::SelectionChanges& msg)\r\n{\r\n    if ((msg.Type == Gui::SelectionChanges::AddSelection) && (\r\n                (selectionMode == refAdd) || (selectionMode == refRemove))) {\r\n\r\n        if (strcmp(msg.pDocName, DressUpView->getObject()->getDocument()->getName()) != 0)\r\n            return false;\r\n\r\n        PartDesign::DressUp* pcDressUp = static_cast<PartDesign::DressUp*>(DressUpView->getObject());\r\n        App::DocumentObject* base = this->getBase();\r\n\r\n        \/\/ TODO: Must we make a copy here instead of assigning to const char* ?\r\n        const char* fname = base->getNameInDocument();        \r\n        if (strcmp(msg.pObjectName, fname) != 0)\r\n            return false;\r\n\r\n        std::string subName(msg.pSubName);\r\n        std::vector<std::string> refs = pcDressUp->Base.getSubValues();\r\n        std::vector<std::string>::iterator f = std::find(refs.begin(), refs.end(), subName);\r\n\r\n        if (selectionMode == refAdd) {\r\n            if (f == refs.end())\r\n                refs.push_back(subName);\r\n            else\r\n                return false; \/\/ duplicate selection\r\n        } else {\r\n            if (f != refs.end())\r\n                refs.erase(f);\r\n            else\r\n                return false;\r\n        }\r\n        DressUpView->highlightReferences(false);\r\n        setupTransaction();\r\n        pcDressUp->Base.setValue(base, refs);        \r\n        pcDressUp->getDocument()->recomputeFeature(pcDressUp);\r\n\r\n        return true;\r\n    }\r\n\r\n    return false;\r\n}\r\n\r\nvoid TaskDressUpParameters::onButtonRefAdd(bool checked)\r\n{\r\n    if (checked) {\r\n        clearButtons(refAdd);\r\n        hideObject();\r\n        selectionMode = refAdd;\r\n        Gui::Selection().clearSelection();\r\n        Gui::Selection().addSelectionGate(new ReferenceSelection(this->getBase(), allowEdges, allowFaces, false));\r\n        DressUpView->highlightReferences(true);\r\n    } else {\r\n        exitSelectionMode();\r\n        DressUpView->highlightReferences(false);\r\n    }\r\n}\r\n\r\nvoid TaskDressUpParameters::onButtonRefRemove(const bool checked)\r\n{\r\n    if (checked) {\r\n        clearButtons(refRemove);\r\n        hideObject();\r\n        selectionMode = refRemove;\r\n        Gui::Selection().clearSelection();        \r\n        Gui::Selection().addSelectionGate(new ReferenceSelection(this->getBase(), allowEdges, allowFaces, false));\r\n        DressUpView->highlightReferences(true);\r\n    }\r\n    else {\r\n        exitSelectionMode();\r\n        DressUpView->highlightReferences(false);\r\n    }\r\n}\r\n\r\nconst std::vector<std::string> TaskDressUpParameters::getReferences() const\r\n{\r\n    PartDesign::DressUp* pcDressUp = static_cast<PartDesign::DressUp*>(DressUpView->getObject());\r\n    std::vector<std::string> result = pcDressUp->Base.getSubValues();\r\n    return result;\r\n}\r\n\r\n\/\/ TODO: This code is identical with TaskTransformedParameters::removeItemFromListWidget()\r\nvoid TaskDressUpParameters::removeItemFromListWidget(QListWidget* widget, const char* itemstr)\r\n{\r\n    QList<QListWidgetItem*> items = widget->findItems(QString::fromLatin1(itemstr), Qt::MatchExactly);\r\n    if (!items.empty()) {\r\n        for (QList<QListWidgetItem*>::const_iterator i = items.begin(); i != items.end(); i++) {\r\n            QListWidgetItem* it = widget->takeItem(widget->row(*i));\r\n            delete it;\r\n        }\r\n    }\r\n}\r\n\r\nvoid TaskDressUpParameters::hideObject()\r\n{\r\n    App::DocumentObject* base = getBase();\r\n    if(base) {\r\n        DressUpView->getObject()->Visibility.setValue(false);\r\n        base->Visibility.setValue(true);\r\n    }\r\n}\r\n\r\nvoid TaskDressUpParameters::showObject()\r\n{\r\n    DressUpView->getObject()->Visibility.setValue(true);\r\n    App::DocumentObject* base = getBase();\r\n    if (base) \r\n        base->Visibility.setValue(false);\r\n}\r\n\r\nPart::Feature* TaskDressUpParameters::getBase(void) const\r\n{\r\n    PartDesign::DressUp* pcDressUp = static_cast<PartDesign::DressUp*>(DressUpView->getObject());\r\n    \/\/ Unlikely but this may throw an exception in case we are started to edit an object which base feature\r\n    \/\/ was deleted. This exception will be likely unhandled inside the dialog and pass upper, But an error\r\n    \/\/ message inside the report view is better than a SEGFAULT.\r\n    \/\/ Generally this situation should be prevented in ViewProviderDressUp::setEdit()\r\n    return pcDressUp->getBaseObject();\r\n}\r\n\r\nvoid TaskDressUpParameters::exitSelectionMode()\r\n{\r\n    selectionMode = none;\r\n    Gui::Selection().rmvSelectionGate();\r\n    Gui::Selection().clearSelection();\r\n    showObject();\r\n}\r\n\r\n\/\/**************************************************************************\r\n\/\/**************************************************************************\r\n\/\/ TaskDialog\r\n\/\/++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\r\n\r\nTaskDlgDressUpParameters::TaskDlgDressUpParameters(ViewProviderDressUp *DressUpView)\r\n    : TaskDlgFeatureParameters(DressUpView)\r\n    , parameter(0)\r\n{\r\n    assert(DressUpView);\r\n}\r\n\r\nTaskDlgDressUpParameters::~TaskDlgDressUpParameters()\r\n{\r\n\r\n}\r\n\r\n\/\/==== calls from the TaskView ===============================================================\r\n\r\nbool TaskDlgDressUpParameters::accept()\r\n{\r\n    getDressUpView()->highlightReferences(false);\r\n\r\n    std::vector<std::string> refs = parameter->getReferences();\r\n    std::stringstream str;\r\n    str << Gui::Command::getObjectCmd(vp->getObject()) << \".Base = (\" \r\n        << Gui::Command::getObjectCmd(parameter->getBase()) << \",[\";\r\n    for (std::vector<std::string>::const_iterator it = refs.begin(); it != refs.end(); ++it)\r\n        str << \"\\\"\" << *it << \"\\\",\";\r\n    str << \"])\";\r\n    Gui::Command::runCommand(Gui::Command::Doc,str.str().c_str());\r\n    return TaskDlgFeatureParameters::accept();\r\n}\r\n\r\nbool TaskDlgDressUpParameters::reject()\r\n{\r\n    getDressUpView()->highlightReferences(false);\r\n    return TaskDlgFeatureParameters::reject();\r\n}\r\n\r\n#include \"moc_TaskDressUpParameters.cpp\"\r\n<|endoftext|>"}
{"text":"<commit_before>#include \"ConnectCallChecker.h\"\n\n#include \"clang\/AST\/Decl.h\"\n#include \"clang\/AST\/DeclCXX.h\"\n#include \"clang\/AST\/Expr.h\"\n\n#include \"clang\/Frontend\/CompilerInstance.h\"\n\n#include \"ConnectCall.h\"\n\nnamespace \n{\n\tTypeDeclaration connectNormalizedType(const TypeDeclaration &decl)\n\t{\n\t\t\/\/ This converts \"const Foo &\" in to just \"Foo\"\n\t\tif (decl.isConst() && (decl.indirections().size() == 1) &&\n\t\t    decl.indirections().front() == Indirection::Reference)\n\t\t{\n\t\t\treturn TypeDeclaration(false, decl.typeName(), std::vector<Indirection>()); \n\t\t}\n\n\t\treturn decl;\n\t}\n\n\tbool argumentsMatch(const MetaMethodSignature &connectRef, const MetaMethodSignature &methodDecl)\n\t{\n\t\tauto methodDeclArgIt = methodDecl.arguments().begin();\n\n\t\tfor(const MetaMethodArgument &connectRefArg : connectRef.arguments())\n\t\t{\n\t\t\tif (methodDeclArgIt == methodDecl.arguments().end())\n\t\t\t{\n\t\t\t\t\/\/ We have more args than the method decl\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tif (connectNormalizedType(connectRefArg.type()) != connectNormalizedType(methodDeclArgIt->type()))\n\t\t\t{\n\t\t\t\t\/\/ Incompatible arguments\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tmethodDeclArgIt++;\n\t\t}\n\n\t\t\/\/ Any remaining args on the method decl must have defaults\n\t\tfor(; methodDeclArgIt != methodDecl.arguments().end(); methodDeclArgIt++)\n\t\t{\n\t\t\tif (!methodDeclArgIt->hasDefault())\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tbool signaturesConnectable(const MetaMethodSignature &sender, const MetaMethodSignature &receiver)\n\t{\n\t\tauto senderArgIt = sender.arguments().begin();\n\n\t\tfor(const MetaMethodArgument &receiverArg : receiver.arguments())\n\t\t{\n\t\t\tif (senderArgIt == sender.arguments().end())\n\t\t\t{\n\t\t\t\t\/\/ We're trying to receive more args than are being sent\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tif (connectNormalizedType(senderArgIt->type()) != connectNormalizedType(receiverArg.type()))\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tsenderArgIt++;\n\t\t}\n\n\t\t\/\/ Looks good\n\t\treturn true;\n\t}\n}\n\nConnectCallChecker::ConnectCallChecker(clang::CompilerInstance &instance) : \n\tConnectCallVisitor(instance),\n\tmReporter(instance.getSourceManager())\n{\n}\n\nbool ConnectCallChecker::VisitConnectCall(const ConnectCall &call)\n{\n\tconst MetaMethodRef sendMethod(call.sendMethod()); \n\tconst MetaMethodRef receiveMethod(call.receiveMethod()); \n\n\tif (!sendMethod.isValid())\n\t{\n\t\tmReporter.report(call) << \"Can't parse raw slot reference\" << (\"\\\"\" + sendMethod.rawString() + \"\\\"\");\n\t}\n\t\n\tif (!receiveMethod.isValid())\n\t{\n\t\tmReporter.report(call) << \"Can't parse raw signal or slot reference\" << (\"\\\"\" + receiveMethod.rawString() + \"\\\"\");\n\t}\n\n\tif (!sendMethod.isValid() || !receiveMethod.isValid())\n\t{\n\t\t\/\/ Doesn't make sense to continue\n\t\treturn true;\n\t}\n\n\tif (!referencedMethodExists(call.sender(), sendMethod))\n\t{\n\t\tmReporter.report(call) << \"Can't find sender\" << sendMethod.spelling() << \"on\" << call.sender()->getQualifiedNameAsString();\n\t}\n\n\tif (!referencedMethodExists(call.receiver(), receiveMethod))\n\t{\n\t\tmReporter.report(call) << \"Can't find receiver\" << receiveMethod.spelling() << \"on\" << call.receiver()->getQualifiedNameAsString();\n\t}\n\n\tif (sendMethod.type() != MetaMethodType::Signal)\n\t{\n\t\tmReporter.report(call) << \"Sender\" << sendMethod.spelling() << \"is not a signal\";\n\t}\n\n\tif (!signaturesConnectable(sendMethod.signature(), receiveMethod.signature()))\n\t{\n\t\tmReporter.report(call) << \"Sender\" << sendMethod.spelling() << \"not compatible with receiver\" << receiveMethod.spelling();\n\t}\n\n\treturn true;\n}\n\t\nbool ConnectCallChecker::referencedMethodExists(const clang::CXXRecordDecl *recordDecl, const MetaMethodRef &ref)\n{\n\t\/\/ Try all our methods\n\tfor(auto it = recordDecl->method_begin(); it != recordDecl->method_end(); it++)\n\t{\n\t\tif (it->getNameAsString() == ref.signature().methodName())\n\t\t{\n\t\t\tconst clang::CXXMethodDecl *decl = *it;\n\t\t\n\t\t\t\/\/ Signals are always protected\n\t\t\tif ((ref.type() == MetaMethodType::Signal) && (decl->getAccess() != clang::AS_protected))\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t\/\/ Parse the declaration\n\t\t\tMetaMethodSignature parsedDecl(decl, compilerInstance());\n\n\t\t\tif (!parsedDecl.isValid())\n\t\t\t{\n\t\t\t\t\/\/ Dump the source text\n\t\t\t\tconst clang::SourceManager &sm = compilerInstance().getSourceManager();\n\t\t\t\tconst clang::SourceRange range = decl->getSourceRange();\n\n\t\t\t\tconst std::string sourceText(\n\t\t\t\t\tsm.getCharacterData(range.getBegin()),\n\t\t\t\t\tsm.getCharacterData(range.getEnd()) + 1);\n\n\t\t\t\tmReporter.report(decl) << \"Can't parse signal or slot declaration\" << (\"\\\"\" + sourceText + \"\\\"\");\n\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t\/\/ Close enough\n\t\t\treturn argumentsMatch(ref.signature(), parsedDecl);\n\t\t}\n\t}\n\n\t\/\/ Try our superclasses recursively\n\tfor(auto it = recordDecl->bases_begin(); it != recordDecl->bases_end(); it++)\n\t{\n\t\tclang::CXXRecordDecl *baseDecl = it->getType()->getAsCXXRecordDecl();\n\n\t\tif (baseDecl && referencedMethodExists(baseDecl, ref))\n\t\t{\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n<commit_msg>Fix for overloaded meta methods<commit_after>#include \"ConnectCallChecker.h\"\n\n#include \"clang\/AST\/Decl.h\"\n#include \"clang\/AST\/DeclCXX.h\"\n#include \"clang\/AST\/Expr.h\"\n\n#include \"clang\/Frontend\/CompilerInstance.h\"\n\n#include \"ConnectCall.h\"\n\nnamespace \n{\n\tTypeDeclaration connectNormalizedType(const TypeDeclaration &decl)\n\t{\n\t\t\/\/ This converts \"const Foo &\" in to just \"Foo\"\n\t\tif (decl.isConst() && (decl.indirections().size() == 1) &&\n\t\t    decl.indirections().front() == Indirection::Reference)\n\t\t{\n\t\t\treturn TypeDeclaration(false, decl.typeName(), std::vector<Indirection>()); \n\t\t}\n\n\t\treturn decl;\n\t}\n\n\tbool argumentsMatch(const MetaMethodSignature &connectRef, const MetaMethodSignature &methodDecl)\n\t{\n\t\tauto methodDeclArgIt = methodDecl.arguments().begin();\n\n\t\tfor(const MetaMethodArgument &connectRefArg : connectRef.arguments())\n\t\t{\n\t\t\tif (methodDeclArgIt == methodDecl.arguments().end())\n\t\t\t{\n\t\t\t\t\/\/ We have more args than the method decl\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tif (connectNormalizedType(connectRefArg.type()) != connectNormalizedType(methodDeclArgIt->type()))\n\t\t\t{\n\t\t\t\t\/\/ Incompatible arguments\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tmethodDeclArgIt++;\n\t\t}\n\n\t\t\/\/ Any remaining args on the method decl must have defaults\n\t\tfor(; methodDeclArgIt != methodDecl.arguments().end(); methodDeclArgIt++)\n\t\t{\n\t\t\tif (!methodDeclArgIt->hasDefault())\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tbool signaturesConnectable(const MetaMethodSignature &sender, const MetaMethodSignature &receiver)\n\t{\n\t\tauto senderArgIt = sender.arguments().begin();\n\n\t\tfor(const MetaMethodArgument &receiverArg : receiver.arguments())\n\t\t{\n\t\t\tif (senderArgIt == sender.arguments().end())\n\t\t\t{\n\t\t\t\t\/\/ We're trying to receive more args than are being sent\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tif (connectNormalizedType(senderArgIt->type()) != connectNormalizedType(receiverArg.type()))\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tsenderArgIt++;\n\t\t}\n\n\t\t\/\/ Looks good\n\t\treturn true;\n\t}\n}\n\nConnectCallChecker::ConnectCallChecker(clang::CompilerInstance &instance) : \n\tConnectCallVisitor(instance),\n\tmReporter(instance.getSourceManager())\n{\n}\n\nbool ConnectCallChecker::VisitConnectCall(const ConnectCall &call)\n{\n\tconst MetaMethodRef sendMethod(call.sendMethod()); \n\tconst MetaMethodRef receiveMethod(call.receiveMethod()); \n\n\tif (!sendMethod.isValid())\n\t{\n\t\tmReporter.report(call) << \"Can't parse raw slot reference\" << (\"\\\"\" + sendMethod.rawString() + \"\\\"\");\n\t}\n\t\n\tif (!receiveMethod.isValid())\n\t{\n\t\tmReporter.report(call) << \"Can't parse raw signal or slot reference\" << (\"\\\"\" + receiveMethod.rawString() + \"\\\"\");\n\t}\n\n\tif (!sendMethod.isValid() || !receiveMethod.isValid())\n\t{\n\t\t\/\/ Doesn't make sense to continue\n\t\treturn true;\n\t}\n\n\tif (!referencedMethodExists(call.sender(), sendMethod))\n\t{\n\t\tmReporter.report(call) << \"Can't find sender\" << sendMethod.spelling() << \"on\" << call.sender()->getQualifiedNameAsString();\n\t}\n\n\tif (!referencedMethodExists(call.receiver(), receiveMethod))\n\t{\n\t\tmReporter.report(call) << \"Can't find receiver\" << receiveMethod.spelling() << \"on\" << call.receiver()->getQualifiedNameAsString();\n\t}\n\n\tif (sendMethod.type() != MetaMethodType::Signal)\n\t{\n\t\tmReporter.report(call) << \"Sender\" << sendMethod.spelling() << \"is not a signal\";\n\t}\n\n\tif (!signaturesConnectable(sendMethod.signature(), receiveMethod.signature()))\n\t{\n\t\tmReporter.report(call) << \"Sender\" << sendMethod.spelling() << \"not compatible with receiver\" << receiveMethod.spelling();\n\t}\n\n\treturn true;\n}\n\t\nbool ConnectCallChecker::referencedMethodExists(const clang::CXXRecordDecl *recordDecl, const MetaMethodRef &ref)\n{\n\t\/\/ Try all our methods\n\tfor(auto it = recordDecl->method_begin(); it != recordDecl->method_end(); it++)\n\t{\n\t\tif (it->getNameAsString() == ref.signature().methodName())\n\t\t{\n\t\t\tconst clang::CXXMethodDecl *decl = *it;\n\t\t\n\t\t\t\/\/ Signals are always protected\n\t\t\tif ((ref.type() == MetaMethodType::Signal) && (decl->getAccess() != clang::AS_protected))\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t\/\/ Parse the declaration\n\t\t\tMetaMethodSignature parsedDecl(decl, compilerInstance());\n\n\t\t\tif (!parsedDecl.isValid())\n\t\t\t{\n\t\t\t\t\/\/ Dump the source text\n\t\t\t\tconst clang::SourceManager &sm = compilerInstance().getSourceManager();\n\t\t\t\tconst clang::SourceRange range = decl->getSourceRange();\n\n\t\t\t\tconst std::string sourceText(\n\t\t\t\t\tsm.getCharacterData(range.getBegin()),\n\t\t\t\t\tsm.getCharacterData(range.getEnd()) + 1);\n\n\t\t\t\tmReporter.report(decl) << \"Can't parse signal or slot declaration\" << (\"\\\"\" + sourceText + \"\\\"\");\n\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (argumentsMatch(ref.signature(), parsedDecl))\n\t\t\t{\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ Try our superclasses recursively\n\tfor(auto it = recordDecl->bases_begin(); it != recordDecl->bases_end(); it++)\n\t{\n\t\tclang::CXXRecordDecl *baseDecl = it->getType()->getAsCXXRecordDecl();\n\n\t\tif (baseDecl && referencedMethodExists(baseDecl, ref))\n\t\t{\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ This file is distributed under the BSD License.\n\/\/ See \"license.txt\" for details.\n\/\/ Copyright 2009-2010, Jonathan Turner (jonathan@emptycrate.com)\n\/\/ and Jason Turner (jason@emptycrate.com)\n\/\/ http:\/\/www.chaiscript.com\n\n#include <iostream>\n\n#include <chaiscript\/chaiscript.hpp>\n#include <chaiscript\/dispatchkit\/function_call.hpp>\n#include <boost\/function.hpp>\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n#include <boost\/regex.hpp>\n\nvoid log(const std::string &msg)\n{\n  std::cout << \"[\" << boost::posix_time::microsec_clock::local_time() << \"] \" << msg << std::endl;\n}\n\nvoid log(const std::string &module, const std::string &msg)\n{\n  std::cout << \"[\" << boost::posix_time::microsec_clock::local_time() << \"] <\" << module << \"> \" << msg << std::endl;\n}\n\nvoid bound_log(const std::string &msg)\n{\n  log(msg);\n}\n\nvoid hello_world(const chaiscript::Boxed_Value & \/*o*\/)\n{\n  std::cout << \"Hello World\" << std::endl;\n}\n\nvoid hello_constructor(const chaiscript::Boxed_Value & \/*o*\/)\n{\n  std::cout << \"Hello Constructor\" << std::endl;\n}\n\n\nstruct System\n{\n  std::map<std::string, boost::function<std::string (const std::string &) > > m_callbacks;\n\n  void add_callback(const std::string &t_name, \n      const chaiscript::Proxy_Function &t_func)\n  {\n    m_callbacks[t_name] = chaiscript::dispatch::functor<std::string (const std::string &)>(t_func);\n  }\n\n\n  void do_callbacks(const std::string &inp)\n  {\n    log(\"Running Callbacks: \" + inp);\n    for (std::map<std::string, boost::function<std::string (const std::string &)> >::iterator itr = m_callbacks.begin();\n         itr != m_callbacks.end();\n         ++itr)\n    {\n      log(\"Callback: \" + itr->first, itr->second(inp));\n    }\n  }\n};\n\nvoid take_shared_ptr(const boost::shared_ptr<const std::string> &p)\n{\n  std::cout << *p << std::endl;\n}\n\nint main(int \/*argc*\/, char * \/*argv*\/[]) {\n  using namespace chaiscript;\n\n  ChaiScript chai;\n\n  \/\/Create a new system object and share it with the chaiscript engine\n  System system;\n  chai.add(var(&system), \"system\");\n\n  \/\/Add a bound callback method\n  chai.add(fun(&System::add_callback, system), \"add_callback_bound\");\n\n  \/\/Register the two methods of the System structure.\n  chai.add(fun(&System::add_callback), \"add_callback\");\n  chai.add(fun(&System::do_callbacks), \"do_callbacks\");\n\n  chai.add(fun(&take_shared_ptr), \"take_shared_ptr\");\n\n  \/\/ Let's use chaiscript to add a new lambda callback to our system. \n  \/\/ The function \"{ 'Callback1' + x }\" is created in chaiscript and passed into our C++ application\n  \/\/ in the \"add_callback\" function of struct System the chaiscript function is converted into a \n  \/\/ boost::function, so it can be handled and called easily and type-safely\n  chai.eval(\"system.add_callback(\\\"#1\\\", fun(x) { \\\"Callback1 \\\" + x });\");\n  \n  \/\/ Because we are sharing the \"system\" object with the chaiscript engine we have equal\n  \/\/ access to it both from within chaiscript and from C++ code\n  system.do_callbacks(\"TestString\");\n  chai.eval(\"system.do_callbacks(\\\"TestString\\\");\");\n\n  \/\/ The log function is overloaded, therefore we have to give the C++ compiler a hint as to which\n  \/\/ version we want to register. One way to do this is to create a typedef of the function pointer\n  \/\/ then cast your function to that typedef.\n  typedef void (*PlainLog)(const std::string &);\n  typedef void (*ModuleLog)(const std::string &, const std::string &);\n  chai.add(fun(PlainLog(&log)), \"log\");\n  chai.add(fun(ModuleLog(&log)), \"log\");\n\n  chai.eval(\"log(\\\"Test Message\\\")\");\n\n  \/\/ A shortcut to using eval is just to use the chai operator()\n  chai(\"log(\\\"Test Module\\\", \\\"Test Message\\\");\");\n\n  \/\/Finally, it is possible to register any boost::function as a system function, in this \n  \/\/way, we can, for instance add a bound member function to the system\n  chai.add(fun(&System::do_callbacks, boost::ref(system), std::string(\"Bound Test\")), \"do_callbacks\");\n\n  \/\/Call bound version of do_callbacks\n  chai(\"do_callbacks()\");\n\n  boost::function<void ()> caller = chai.eval<boost::function<void ()> >(\"fun() { system.do_callbacks(\\\"From Functor\\\"); }\");\n  caller();\n\n\n  \/\/If we would like a type-safe return value from all call, we can use\n  \/\/the templated version of eval:\n  int i = chai.eval<int>(\"5+5\");\n\n  std::cout << \"5+5: \" << i << std::endl;\n\n  \/\/Add a new variable\n  chai(\"var scripti = 15\");\n\n  \/\/We can even get a handle to the variables in the system\n  int &scripti = chai.eval<int &>(\"scripti\");\n\n  std::cout << \"scripti: \" << scripti << std::endl;\n  scripti *= 2;\n  std::cout << \"scripti (updated): \" << scripti << std::endl;\n  chai(\"print(\\\"Scripti from chai: \\\" + to_string(scripti))\");\n\n  \/\/To do: Add examples of handling Boxed_Values directly when needed\n\n  \/\/Creating a functor on the stack and using it immediatly \n  int x = chai.eval<boost::function<int (int, int)> >(\"fun (x, y) { return x + y; }\")(5, 6);\n\n  log(\"Functor test output\", boost::lexical_cast<std::string>(x));\n\n  chai.add(var(boost::shared_ptr<int>()), \"nullvar\");\n  chai(\"print(\\\"This should be true.\\\"); print(nullvar.is_var_null())\");\n\n  \/\/ test the global const action\n  chai.add_global_const(const_var(1), \"constvar\");\n  chai(\"def getvar() { return constvar; }\");\n  chai(\"print( getvar() )\");\n\n\n  \/\/Ability to create our own container types when needed. std::vector and std::map are\n  \/\/mostly supported currently\n  chai.add(bootstrap::standard_library::vector_type<std::vector<int> >(\"IntVector\"));\n\n\n  \/\/ Test ability to register a function that excepts a shared_ptr version of a type\n  chai(\"take_shared_ptr(\\\"Hello World as a shared_ptr\\\");\");\n\n  chai.add(fun(&bound_log, std::string(\"Msg\")), \"BoundFun\");\n\n  \/\/Dynamic objects test\n  chai.add(chaiscript::Proxy_Function(new dispatch::detail::Dynamic_Object_Function(\"TestType\", fun(&hello_world))), \"hello_world\");\n  chai.add(chaiscript::Proxy_Function(new dispatch::detail::Dynamic_Object_Constructor(\"TestType\", fun(&hello_constructor))), \"TestType\");\n  chai.add(fun(boost::function<Boxed_Value (dispatch::Dynamic_Object &)>(boost::bind(&dispatch::detail::Dynamic_Object_Attribute::func, \"TestType\", \"attr\", _1))), \"attr\");\n\n  chai.eval(\"var x = TestType()\");\n\/\/  chai.eval(\"x.attr = \\\"hi\\\"\");\n\/\/  chai.eval(\"print(x.attr)\");\n  chai.eval(\"x.hello_world()\");\n}\n\n<commit_msg>Fix broken example.cpp<commit_after>\/\/ This file is distributed under the BSD License.\n\/\/ See \"license.txt\" for details.\n\/\/ Copyright 2009-2010, Jonathan Turner (jonathan@emptycrate.com)\n\/\/ and Jason Turner (jason@emptycrate.com)\n\/\/ http:\/\/www.chaiscript.com\n\n#include <iostream>\n\n#include <chaiscript\/chaiscript.hpp>\n#include <chaiscript\/dispatchkit\/function_call.hpp>\n#include <boost\/function.hpp>\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n#include <boost\/regex.hpp>\n\nvoid log(const std::string &msg)\n{\n  std::cout << \"[\" << boost::posix_time::microsec_clock::local_time() << \"] \" << msg << std::endl;\n}\n\nvoid log(const std::string &module, const std::string &msg)\n{\n  std::cout << \"[\" << boost::posix_time::microsec_clock::local_time() << \"] <\" << module << \"> \" << msg << std::endl;\n}\n\nvoid bound_log(const std::string &msg)\n{\n  log(msg);\n}\n\nvoid hello_world(const chaiscript::Boxed_Value & \/*o*\/)\n{\n  std::cout << \"Hello World\" << std::endl;\n}\n\nvoid hello_constructor(const chaiscript::Boxed_Value & \/*o*\/)\n{\n  std::cout << \"Hello Constructor\" << std::endl;\n}\n\n\nstruct System\n{\n  std::map<std::string, boost::function<std::string (const std::string &) > > m_callbacks;\n\n  void add_callback(const std::string &t_name, \n      const chaiscript::Proxy_Function &t_func)\n  {\n    m_callbacks[t_name] = chaiscript::dispatch::functor<std::string (const std::string &)>(t_func);\n  }\n\n\n  void do_callbacks(const std::string &inp)\n  {\n    log(\"Running Callbacks: \" + inp);\n    for (std::map<std::string, boost::function<std::string (const std::string &)> >::iterator itr = m_callbacks.begin();\n         itr != m_callbacks.end();\n         ++itr)\n    {\n      log(\"Callback: \" + itr->first, itr->second(inp));\n    }\n  }\n};\n\nvoid take_shared_ptr(const boost::shared_ptr<const std::string> &p)\n{\n  std::cout << *p << std::endl;\n}\n\nint main(int \/*argc*\/, char * \/*argv*\/[]) {\n  using namespace chaiscript;\n\n  ChaiScript chai;\n\n  \/\/Create a new system object and share it with the chaiscript engine\n  System system;\n  chai.add(var(&system), \"system\");\n\n  \/\/Add a bound callback method\n  chai.add(fun(&System::add_callback, system), \"add_callback_bound\");\n\n  \/\/Register the two methods of the System structure.\n  chai.add(fun(&System::add_callback), \"add_callback\");\n  chai.add(fun(&System::do_callbacks), \"do_callbacks\");\n\n  chai.add(fun(&take_shared_ptr), \"take_shared_ptr\");\n\n  \/\/ Let's use chaiscript to add a new lambda callback to our system. \n  \/\/ The function \"{ 'Callback1' + x }\" is created in chaiscript and passed into our C++ application\n  \/\/ in the \"add_callback\" function of struct System the chaiscript function is converted into a \n  \/\/ boost::function, so it can be handled and called easily and type-safely\n  chai.eval(\"system.add_callback(\\\"#1\\\", fun(x) { \\\"Callback1 \\\" + x });\");\n  \n  \/\/ Because we are sharing the \"system\" object with the chaiscript engine we have equal\n  \/\/ access to it both from within chaiscript and from C++ code\n  system.do_callbacks(\"TestString\");\n  chai.eval(\"system.do_callbacks(\\\"TestString\\\");\");\n\n  \/\/ The log function is overloaded, therefore we have to give the C++ compiler a hint as to which\n  \/\/ version we want to register. One way to do this is to create a typedef of the function pointer\n  \/\/ then cast your function to that typedef.\n  typedef void (*PlainLog)(const std::string &);\n  typedef void (*ModuleLog)(const std::string &, const std::string &);\n  chai.add(fun(PlainLog(&log)), \"log\");\n  chai.add(fun(ModuleLog(&log)), \"log\");\n\n  chai.eval(\"log(\\\"Test Message\\\")\");\n\n  \/\/ A shortcut to using eval is just to use the chai operator()\n  chai(\"log(\\\"Test Module\\\", \\\"Test Message\\\");\");\n\n  \/\/Finally, it is possible to register any boost::function as a system function, in this \n  \/\/way, we can, for instance add a bound member function to the system\n  chai.add(fun(&System::do_callbacks, boost::ref(system), std::string(\"Bound Test\")), \"do_callbacks\");\n\n  \/\/Call bound version of do_callbacks\n  chai(\"do_callbacks()\");\n\n  boost::function<void ()> caller = chai.eval<boost::function<void ()> >(\"fun() { system.do_callbacks(\\\"From Functor\\\"); }\");\n  caller();\n\n\n  \/\/If we would like a type-safe return value from all call, we can use\n  \/\/the templated version of eval:\n  int i = chai.eval<int>(\"5+5\");\n\n  std::cout << \"5+5: \" << i << std::endl;\n\n  \/\/Add a new variable\n  chai(\"var scripti = 15\");\n\n  \/\/We can even get a handle to the variables in the system\n  int &scripti = chai.eval<int &>(\"scripti\");\n\n  std::cout << \"scripti: \" << scripti << std::endl;\n  scripti *= 2;\n  std::cout << \"scripti (updated): \" << scripti << std::endl;\n  chai(\"print(\\\"Scripti from chai: \\\" + to_string(scripti))\");\n\n  \/\/To do: Add examples of handling Boxed_Values directly when needed\n\n  \/\/Creating a functor on the stack and using it immediatly \n  int x = chai.eval<boost::function<int (int, int)> >(\"fun (x, y) { return x + y; }\")(5, 6);\n\n  log(\"Functor test output\", boost::lexical_cast<std::string>(x));\n\n  chai.add(var(boost::shared_ptr<int>()), \"nullvar\");\n  chai(\"print(\\\"This should be true.\\\"); print(nullvar.is_var_null())\");\n\n  \/\/ test the global const action\n  chai.add_global_const(const_var(1), \"constvar\");\n  chai(\"def getvar() { return constvar; }\");\n  chai(\"print( getvar() )\");\n\n\n  \/\/Ability to create our own container types when needed. std::vector and std::map are\n  \/\/mostly supported currently\n  chai.add(bootstrap::standard_library::vector_type<std::vector<int> >(\"IntVector\"));\n\n\n  \/\/ Test ability to register a function that excepts a shared_ptr version of a type\n  chai(\"take_shared_ptr(\\\"Hello World as a shared_ptr\\\");\");\n\n  chai.add(fun(&bound_log, std::string(\"Msg\")), \"BoundFun\");\n\n  \/\/Dynamic objects test\n  chai.add(chaiscript::Proxy_Function(new dispatch::detail::Dynamic_Object_Function(\"TestType\", fun(&hello_world))), \"hello_world\");\n  chai.add(chaiscript::Proxy_Function(new dispatch::detail::Dynamic_Object_Constructor(\"TestType\", fun(&hello_constructor))), \"TestType\");\n\/\/  chai.add(fun(boost::function<Boxed_Value (dispatch::Dynamic_Object &)>(boost::bind(&dispatch::detail::Dynamic_Object_Attribute::func, \"TestType\", \"attr\", _1))), \"attr\");\n\n  chai.eval(\"var x = TestType()\");\n\/\/  chai.eval(\"x.attr = \\\"hi\\\"\");\n\/\/  chai.eval(\"print(x.attr)\");\n  chai.eval(\"x.hello_world()\");\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2021 ASMlover. All rights reserved.\n\/\/\n\/\/  ______             __                  ___\n\/\/ \/\\__  _\\           \/\\ \\                \/\\_ \\\n\/\/ \\\/_\/\\ \\\/    __     \\_\\ \\  _____     ___\\\/\/\\ \\      __\n\/\/    \\ \\ \\  \/'__`\\   \/'_` \\\/\\ '__`\\  \/ __`\\\\ \\ \\   \/'__`\\\n\/\/     \\ \\ \\\/\\ \\L\\.\\_\/\\ \\L\\ \\ \\ \\L\\ \\\/\\ \\L\\ \\\\_\\ \\_\/\\  __\/\n\/\/      \\ \\_\\ \\__\/.\\_\\ \\___,_\\ \\ ,__\/\\ \\____\/\/\\____\\ \\____\\\n\/\/       \\\/_\/\\\/__\/\\\/_\/\\\/__,_ \/\\ \\ \\\/  \\\/___\/ \\\/____\/\\\/____\/\n\/\/                             \\ \\_\\\n\/\/                              \\\/_\/\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 <chrono>\n#include <iostream>\n#include <Common\/Colorful.hh>\n#include <Common\/Harness.hh>\n#include <Setting\/Setting.hh>\n#include <Core\/TadpoleVM.hh>\n#include <GC\/GC.hh>\n#include <Builtin\/Builtins.hh>\n\nnamespace Tadpole::Builtin {\n\nvoid register_builtins(Core::TadpoleVM& vm) noexcept {\n  \/\/ fn help() -> Nil\n  vm.define_native(\"help\", [](sz_t, Value::Value*) -> Value::Value {\n        std::cout\n          << Common::Colorful::fg::lightcyan << \"Welcome To Tadpole! This is the help utility.\"\n          << Common::Colorful::reset << std::endl << std::endl;\n\n          std::cout << \"print(...)        Prints the values to stdout stream\" << std::endl;\n          std::cout << \"exit()            Exit the Tadpole terminal\" << std::endl;\n          std::cout << \"time()            Return the current time in seconds since the Epoch\" << std::endl;\n          std::cout << \"clock()           Return the CPU time since the start of the process\" << std::endl;\n          std::cout << \"gc_count()        Return number of objects tracked by GC\" << std::endl;\n          std::cout << \"gc_threshold()    Return the current collection threshold\" << std::endl;\n          std::cout << \"gc_threshold(n)   Sets the collection threshold\" << std::endl;\n          std::cout << \"gc_collect()      Run a full collection\" << std::endl;\n          std::cout << \"gc_isenabled()    Return true if automatic collection is enabled\" << std::endl;\n          std::cout << \"gc_enable()       Enable automatic garbage collection\" << std::endl;\n          std::cout << \"gc_disable()      Disable automatic garbage collection\" << std::endl;\n          std::cout << \"test_isenabled()  Return true if running test cases is enabled\" << std::endl;\n          std::cout << \"test_enable()     Enable running test cases\" << std::endl;\n          std::cout << \"test_disable()    Disable running test cases\" << std::endl;\n          std::cout << \"test_run(name)    Run the test case with specified name\" << std::endl;\n          std::cout << \"test_run_all()    Run all test cases\" << std::endl;\n\n          return nullptr;\n      });\n\n  \/\/ fn print(arg1: Value, arg2: Value, arg3: Value, ...) -> Nil\n  vm.define_native(\"print\", [](sz_t nargs, Value::Value* args) -> Value::Value {\n        for (sz_t i = 0; i < nargs; ++i)\n          std::cout << args[i] << \" \";\n        std::cout << std::endl;\n\n        return nullptr;\n      });\n\n  \/\/ fn exit() -> Nil\n  vm.define_native(\"exit\", [&vm](sz_t, Value::Value*) -> Value::Value {\n        vm.terminate();\n        return nullptr;\n      });\n\n  \/\/ fn time() -> Numeric\n  \/\/\n  \/\/ @returns\n  \/\/    Returns the current time in seconds since the Epoch.\n  vm.define_native(\"time\", [](sz_t, Value::Value*) -> Value::Value {\n        return std::chrono::duration_cast<std::chrono::milliseconds>(\n            std::chrono::system_clock::now().time_since_epoch()).count() \/ 1000.0;\n      });\n\n  \/\/ fn clock() -> Numeric\n  \/\/\n  \/\/ @returns\n  \/\/    Return the current processor time as a Numeric expressed in microseconds.\n  vm.define_native(\"clock\", [](sz_t, Value::Value*) -> Value::Value {\n        return std::chrono::duration_cast<std::chrono::microseconds>(\n            std::chrono::steady_clock::now().time_since_epoch()).count();\n      });\n\n  \/\/ fn gc_count() -> Numeric\n  \/\/\n  \/\/ @returns\n  \/\/    Return the current collection counts.\n  vm.define_native(\"gc_count\", [](sz_t, Value::Value*) -> Value::Value {\n        return GC::GC::get_instance().get_count();\n      });\n\n  \/\/ fn gc_threshold() -> Numeric\n  \/\/\n  \/\/ @returns\n  \/\/    Returns the current collection threshold.\n  \/\/\n  \/\/\n  \/\/ fn gc_threshold(threshold: Numeric) -> Numeric\n  \/\/\n  \/\/ @args\n  \/\/    threshold: Numeric -> Number of collection threshold will be setted.\n  \/\/\n  \/\/ @returns\n  \/\/    Returns the current collection threshold.\n  vm.define_native(\"gc_threshold\", [](sz_t nargs, Value::Value* args) -> Value::Value {\n        if (nargs == 1 && args != nullptr && args[0].as_numeric())\n          GC::GC::get_instance().set_threshold(args[0].as_integer<sz_t>());\n        return GC::GC::get_instance().get_threshold();\n      });\n\n  \/\/ fn gc_collect() -> Nil\n  vm.define_native(\"gc_collect\", [](sz_t, Value::Value*) -> Value::Value {\n        GC::GC::get_instance().collect();\n        return nullptr;\n      });\n\n  \/\/ fn gc_isenabled() -> Boolean\n  \/\/\n  \/\/ @returns\n  \/\/    Returns `true` if automatic collection is enabled.\n  vm.define_native(\"gc_isenabled\", [](sz_t, Value::Value*) -> Value::Value {\n        return GC::GC::get_instance().is_enabled();\n      });\n\n  \/\/ fn gc_enable() -> Nil\n  \/\/\n  \/\/ Enable automatic garbage collection.\n  vm.define_native(\"gc_enable\", [](sz_t, Value::Value*) -> Value::Value {\n        GC::GC::get_instance().enable();\n        return nullptr;\n      });\n\n  \/\/ fn gc_disable() -> Nil\n  \/\/\n  \/\/ Disable automatic garbage collection.\n  vm.define_native(\"gc_disable\", [](sz_t, Value::Value*) -> Value::Value {\n        GC::GC::get_instance().disable();\n        return nullptr;\n      });\n\n  \/\/ fn test_isenabled() -> Boolean\n  \/\/\n  \/\/ @returns\n  \/\/    Returns `true` if running test cases is enabled.\n  vm.define_native(\"test_isenabled\", [](sz_t, Value::Value*) -> Value::Value {\n        return Setting::Setting::get_instance().enabled_run_harness();\n      });\n\n  \/\/ fn test_enable() -> Nil\n  \/\/\n  \/\/ Enable running test cases.\n  vm.define_native(\"test_enable\", [](sz_t, Value::Value*) -> Value::Value {\n        Setting::Setting::get_instance().enable_run_harness();\n        return nullptr;\n      });\n\n  \/\/ fn test_disable() -> Nil\n  \/\/\n  \/\/ Disable running test cases.\n  vm.define_native(\"test_disable\", [](sz_t, Value::Value*) -> Value::Value {\n        Setting::Setting::get_instance().disable_run_harness();\n        return nullptr;\n      });\n\n  \/\/ fn test_run(name: String) -> Nil\n  \/\/\n  \/\/ Run test case with specified name.\n  \/\/\n  \/\/ @args\n  \/\/    name: String -> Name of tese case.\n  vm.define_native(\"test_run\", [](sz_t nargs, Value::Value* args) -> Value::Value {\n        if (nargs == 1 && args != nullptr && args[0].is_string())\n          Common::Harness::run_harness_with(args[0].as_cstring());\n        return nullptr;\n      });\n\n  \/\/ fn test_run_all() -> Nil\n  \/\/\n  \/\/ Run all test cases for Tadpole.\n  vm.define_native(\"test_run_all\", [](sz_t, Value::Value*) -> Value::Value {\n        Common::Harness::run_all_harness();\n        return nullptr;\n      });\n}\n\n}\n<commit_msg>:construction: chore(builtin): add new doc helps for builtin functions<commit_after>\/\/ Copyright (c) 2021 ASMlover. All rights reserved.\n\/\/\n\/\/  ______             __                  ___\n\/\/ \/\\__  _\\           \/\\ \\                \/\\_ \\\n\/\/ \\\/_\/\\ \\\/    __     \\_\\ \\  _____     ___\\\/\/\\ \\      __\n\/\/    \\ \\ \\  \/'__`\\   \/'_` \\\/\\ '__`\\  \/ __`\\\\ \\ \\   \/'__`\\\n\/\/     \\ \\ \\\/\\ \\L\\.\\_\/\\ \\L\\ \\ \\ \\L\\ \\\/\\ \\L\\ \\\\_\\ \\_\/\\  __\/\n\/\/      \\ \\_\\ \\__\/.\\_\\ \\___,_\\ \\ ,__\/\\ \\____\/\/\\____\\ \\____\\\n\/\/       \\\/_\/\\\/__\/\\\/_\/\\\/__,_ \/\\ \\ \\\/  \\\/___\/ \\\/____\/\\\/____\/\n\/\/                             \\ \\_\\\n\/\/                              \\\/_\/\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 <chrono>\n#include <iostream>\n#include <Common\/Colorful.hh>\n#include <Common\/Harness.hh>\n#include <Setting\/Setting.hh>\n#include <Core\/TadpoleVM.hh>\n#include <GC\/GC.hh>\n#include <Builtin\/Builtins.hh>\n\nnamespace Tadpole::Builtin {\n\nvoid register_builtins(Core::TadpoleVM& vm) noexcept {\n  \/\/ fn help() -> Nil\n  vm.define_native(\"help\", [](sz_t, Value::Value*) -> Value::Value {\n        std::cout\n          << Common::Colorful::fg::lightcyan << \"Welcome To Tadpole! This is the help utility.\"\n          << Common::Colorful::reset << std::endl << std::endl;\n\n          std::cout << \"print(...)          Prints the values to stdout stream\" << std::endl;\n          std::cout << \"exit()              Exit the Tadpole terminal\" << std::endl;\n          std::cout << \"time()              Return the current time in seconds since the Epoch\" << std::endl;\n          std::cout << \"clock()             Return the CPU time since the start of the process\" << std::endl;\n          std::cout << \"gc_count()          Return number of objects tracked by GC\" << std::endl;\n          std::cout << \"gc_threshold()      Return the current collection threshold\" << std::endl;\n          std::cout << \"gc_threshold(n)     Sets the collection threshold\" << std::endl;\n          std::cout << \"gc_collect()        Run a full collection\" << std::endl;\n          std::cout << \"gc_isenabled()      Return true if automatic collection is enabled\" << std::endl;\n          std::cout << \"gc_enable()         Enable automatic garbage collection\" << std::endl;\n          std::cout << \"gc_disable()        Disable automatic garbage collection\" << std::endl;\n          std::cout << \"test_isenabled()    Return true if running test cases is enabled\" << std::endl;\n          std::cout << \"test_enable()       Enable running test cases\" << std::endl;\n          std::cout << \"test_disable()      Disable running test cases\" << std::endl;\n          std::cout << \"test_run(name)      Run the test case with specified name\" << std::endl;\n          std::cout << \"test_run_all()      Run all test cases\" << std::endl;\n          std::cout << \"debug_isenabled(n)  Return true if debug mode of <n> is enabled\" << std::endl;\n\n          return nullptr;\n      });\n\n  \/\/ fn print(arg1: Value, arg2: Value, arg3: Value, ...) -> Nil\n  vm.define_native(\"print\", [](sz_t nargs, Value::Value* args) -> Value::Value {\n        for (sz_t i = 0; i < nargs; ++i)\n          std::cout << args[i] << \" \";\n        std::cout << std::endl;\n\n        return nullptr;\n      });\n\n  \/\/ fn exit() -> Nil\n  vm.define_native(\"exit\", [&vm](sz_t, Value::Value*) -> Value::Value {\n        vm.terminate();\n        return nullptr;\n      });\n\n  \/\/ fn time() -> Numeric\n  \/\/\n  \/\/ @returns\n  \/\/    Returns the current time in seconds since the Epoch.\n  vm.define_native(\"time\", [](sz_t, Value::Value*) -> Value::Value {\n        return std::chrono::duration_cast<std::chrono::milliseconds>(\n            std::chrono::system_clock::now().time_since_epoch()).count() \/ 1000.0;\n      });\n\n  \/\/ fn clock() -> Numeric\n  \/\/\n  \/\/ @returns\n  \/\/    Return the current processor time as a Numeric expressed in microseconds.\n  vm.define_native(\"clock\", [](sz_t, Value::Value*) -> Value::Value {\n        return std::chrono::duration_cast<std::chrono::microseconds>(\n            std::chrono::steady_clock::now().time_since_epoch()).count();\n      });\n\n  \/\/ fn gc_count() -> Numeric\n  \/\/\n  \/\/ @returns\n  \/\/    Return the current collection counts.\n  vm.define_native(\"gc_count\", [](sz_t, Value::Value*) -> Value::Value {\n        return GC::GC::get_instance().get_count();\n      });\n\n  \/\/ fn gc_threshold() -> Numeric\n  \/\/\n  \/\/ @returns\n  \/\/    Returns the current collection threshold.\n  \/\/\n  \/\/\n  \/\/ fn gc_threshold(threshold: Numeric) -> Numeric\n  \/\/\n  \/\/ @args\n  \/\/    threshold: Numeric -> Number of collection threshold will be setted.\n  \/\/\n  \/\/ @returns\n  \/\/    Returns the current collection threshold.\n  vm.define_native(\"gc_threshold\", [](sz_t nargs, Value::Value* args) -> Value::Value {\n        if (nargs == 1 && args != nullptr && args[0].as_numeric())\n          GC::GC::get_instance().set_threshold(args[0].as_integer<sz_t>());\n        return GC::GC::get_instance().get_threshold();\n      });\n\n  \/\/ fn gc_collect() -> Nil\n  vm.define_native(\"gc_collect\", [](sz_t, Value::Value*) -> Value::Value {\n        GC::GC::get_instance().collect();\n        return nullptr;\n      });\n\n  \/\/ fn gc_isenabled() -> Boolean\n  \/\/\n  \/\/ @returns\n  \/\/    Returns `true` if automatic collection is enabled.\n  vm.define_native(\"gc_isenabled\", [](sz_t, Value::Value*) -> Value::Value {\n        return GC::GC::get_instance().is_enabled();\n      });\n\n  \/\/ fn gc_enable() -> Nil\n  \/\/\n  \/\/ Enable automatic garbage collection.\n  vm.define_native(\"gc_enable\", [](sz_t, Value::Value*) -> Value::Value {\n        GC::GC::get_instance().enable();\n        return nullptr;\n      });\n\n  \/\/ fn gc_disable() -> Nil\n  \/\/\n  \/\/ Disable automatic garbage collection.\n  vm.define_native(\"gc_disable\", [](sz_t, Value::Value*) -> Value::Value {\n        GC::GC::get_instance().disable();\n        return nullptr;\n      });\n\n  \/\/ fn test_isenabled() -> Boolean\n  \/\/\n  \/\/ @returns\n  \/\/    Returns `true` if running test cases is enabled.\n  vm.define_native(\"test_isenabled\", [](sz_t, Value::Value*) -> Value::Value {\n        return Setting::Setting::get_instance().enabled_run_harness();\n      });\n\n  \/\/ fn test_enable() -> Nil\n  \/\/\n  \/\/ Enable running test cases.\n  vm.define_native(\"test_enable\", [](sz_t, Value::Value*) -> Value::Value {\n        Setting::Setting::get_instance().enable_run_harness();\n        return nullptr;\n      });\n\n  \/\/ fn test_disable() -> Nil\n  \/\/\n  \/\/ Disable running test cases.\n  vm.define_native(\"test_disable\", [](sz_t, Value::Value*) -> Value::Value {\n        Setting::Setting::get_instance().disable_run_harness();\n        return nullptr;\n      });\n\n  \/\/ fn test_run(name: String) -> Nil\n  \/\/\n  \/\/ Run test case with specified name.\n  \/\/\n  \/\/ @args\n  \/\/    name: String -> Name of tese case.\n  vm.define_native(\"test_run\", [](sz_t nargs, Value::Value* args) -> Value::Value {\n        if (nargs == 1 && args != nullptr && args[0].is_string())\n          Common::Harness::run_harness_with(args[0].as_cstring());\n        return nullptr;\n      });\n\n  \/\/ fn test_run_all() -> Nil\n  \/\/\n  \/\/ Run all test cases for Tadpole.\n  vm.define_native(\"test_run_all\", [](sz_t, Value::Value*) -> Value::Value {\n        Common::Harness::run_all_harness();\n        return nullptr;\n      });\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Licensed to the Apache Software Foundation (ASF) under one\n\/\/ or more contributor license agreements.  See the NOTICE file\n\/\/ distributed with this work for additional information\n\/\/ regarding copyright ownership.  The ASF licenses this file\n\/\/ to you under the Apache License, Version 2.0 (the\n\/\/ \"License\"); you may not use this file except in compliance\n\/\/ with the License.  You may obtain a copy of the License at\n\/\/\n\/\/   http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing,\n\/\/ software distributed under the License is distributed on an\n\/\/ \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n\/\/ KIND, either express or implied.  See the License for the\n\/\/ specific language governing permissions and limitations\n\/\/ under the License.\n\n#include \"arrow\/dataset\/file_orc.h\"\n\n#include <memory>\n#include <utility>\n\n#include \"arrow\/adapters\/orc\/adapter.h\"\n#include \"arrow\/dataset\/dataset_internal.h\"\n#include \"arrow\/dataset\/discovery.h\"\n#include \"arrow\/dataset\/file_base.h\"\n#include \"arrow\/dataset\/partition.h\"\n#include \"arrow\/dataset\/test_util.h\"\n#include \"arrow\/io\/memory.h\"\n#include \"arrow\/record_batch.h\"\n#include \"arrow\/table.h\"\n#include \"arrow\/testing\/gtest_util.h\"\n#include \"arrow\/testing\/util.h\"\n\nnamespace arrow {\nnamespace dataset {\n\nclass OrcFormatHelper {\n public:\n  using FormatType = OrcFileFormat;\n  static Result<std::shared_ptr<Buffer>> Write(RecordBatchReader* reader) {\n    ARROW_ASSIGN_OR_RAISE(auto sink, io::BufferOutputStream::Create());\n    ARROW_ASSIGN_OR_RAISE(auto writer, adapters::orc::ORCFileWriter::Open(sink.get()));\n    std::shared_ptr<Table> table;\n    RETURN_NOT_OK(reader->ReadAll(&table));\n    RETURN_NOT_OK(writer->Write(*table));\n    RETURN_NOT_OK(writer->Close());\n    return sink->Finish();\n  }\n\n  static std::shared_ptr<OrcFileFormat> MakeFormat() {\n    return std::make_shared<OrcFileFormat>();\n  }\n};\n\nclass TestOrcFileFormat : public FileFormatFixtureMixin<OrcFormatHelper> {};\n\n\/\/ TEST_F(TestOrcFileFormat, WriteRecordBatchReader) { TestWrite(); }\n\nTEST_F(TestOrcFileFormat, InspectFailureWithRelevantError) {\n  TestInspectFailureWithRelevantError(StatusCode::IOError, \"ORC\");\n}\nTEST_F(TestOrcFileFormat, Inspect) { TestInspect(); }\nTEST_F(TestOrcFileFormat, IsSupported) { TestIsSupported(); }\nTEST_F(TestOrcFileFormat, CountRows) { TestCountRows(); }\n\n\/\/ TODO add TestOrcFileSystemDataset if write support is added\n\nclass TestOrcFileFormatScan : public FileFormatScanMixin<OrcFormatHelper> {};\n\nTEST_P(TestOrcFileFormatScan, ScanRecordBatchReader) { TestScan(); }\nTEST_P(TestOrcFileFormatScan, ScanBatchSize) { TestScanBatchSize(); }\nTEST_P(TestOrcFileFormatScan, ScanRecordBatchReaderProjected) { TestScanProjected(); }\nTEST_P(TestOrcFileFormatScan, ScanRecordBatchReaderProjectedNested) {\n  TestScanProjectedNested();\n}\nTEST_P(TestOrcFileFormatScan, ScanRecordBatchReaderProjectedMissingCols) {\n  TestScanProjectedMissingCols();\n}\nTEST_P(TestOrcFileFormatScan, ScanRecordBatchReaderWithVirtualColumn) {\n  TestScanWithVirtualColumn();\n}\nTEST_P(TestOrcFileFormatScan, ScanRecordBatchReaderWithDuplicateColumn) {\n  TestScanWithDuplicateColumn();\n}\nTEST_P(TestOrcFileFormatScan, ScanRecordBatchReaderWithDuplicateColumnError) {\n  TestScanWithDuplicateColumnError();\n}\nINSTANTIATE_TEST_SUITE_P(TestScan, TestOrcFileFormatScan,\n                         ::testing::ValuesIn(TestFormatParams::Values()),\n                         TestFormatParams::ToTestNameString);\n\n}  \/\/ namespace dataset\n}  \/\/ namespace arrow\n<commit_msg>MINOR: [C++] Avoid using deprecated RecordBatchReader::ReadAll<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 \"arrow\/dataset\/file_orc.h\"\n\n#include <memory>\n#include <utility>\n\n#include \"arrow\/adapters\/orc\/adapter.h\"\n#include \"arrow\/dataset\/dataset_internal.h\"\n#include \"arrow\/dataset\/discovery.h\"\n#include \"arrow\/dataset\/file_base.h\"\n#include \"arrow\/dataset\/partition.h\"\n#include \"arrow\/dataset\/test_util.h\"\n#include \"arrow\/io\/memory.h\"\n#include \"arrow\/record_batch.h\"\n#include \"arrow\/table.h\"\n#include \"arrow\/testing\/gtest_util.h\"\n#include \"arrow\/testing\/util.h\"\n\nnamespace arrow {\nnamespace dataset {\n\nclass OrcFormatHelper {\n public:\n  using FormatType = OrcFileFormat;\n  static Result<std::shared_ptr<Buffer>> Write(RecordBatchReader* reader) {\n    ARROW_ASSIGN_OR_RAISE(auto sink, io::BufferOutputStream::Create());\n    ARROW_ASSIGN_OR_RAISE(auto writer, adapters::orc::ORCFileWriter::Open(sink.get()));\n    ARROW_ASSIGN_OR_RAISE(auto table, reader->ToTable());\n    RETURN_NOT_OK(writer->Write(*table));\n    RETURN_NOT_OK(writer->Close());\n    return sink->Finish();\n  }\n\n  static std::shared_ptr<OrcFileFormat> MakeFormat() {\n    return std::make_shared<OrcFileFormat>();\n  }\n};\n\nclass TestOrcFileFormat : public FileFormatFixtureMixin<OrcFormatHelper> {};\n\n\/\/ TEST_F(TestOrcFileFormat, WriteRecordBatchReader) { TestWrite(); }\n\nTEST_F(TestOrcFileFormat, InspectFailureWithRelevantError) {\n  TestInspectFailureWithRelevantError(StatusCode::IOError, \"ORC\");\n}\nTEST_F(TestOrcFileFormat, Inspect) { TestInspect(); }\nTEST_F(TestOrcFileFormat, IsSupported) { TestIsSupported(); }\nTEST_F(TestOrcFileFormat, CountRows) { TestCountRows(); }\n\n\/\/ TODO add TestOrcFileSystemDataset if write support is added\n\nclass TestOrcFileFormatScan : public FileFormatScanMixin<OrcFormatHelper> {};\n\nTEST_P(TestOrcFileFormatScan, ScanRecordBatchReader) { TestScan(); }\nTEST_P(TestOrcFileFormatScan, ScanBatchSize) { TestScanBatchSize(); }\nTEST_P(TestOrcFileFormatScan, ScanRecordBatchReaderProjected) { TestScanProjected(); }\nTEST_P(TestOrcFileFormatScan, ScanRecordBatchReaderProjectedNested) {\n  TestScanProjectedNested();\n}\nTEST_P(TestOrcFileFormatScan, ScanRecordBatchReaderProjectedMissingCols) {\n  TestScanProjectedMissingCols();\n}\nTEST_P(TestOrcFileFormatScan, ScanRecordBatchReaderWithVirtualColumn) {\n  TestScanWithVirtualColumn();\n}\nTEST_P(TestOrcFileFormatScan, ScanRecordBatchReaderWithDuplicateColumn) {\n  TestScanWithDuplicateColumn();\n}\nTEST_P(TestOrcFileFormatScan, ScanRecordBatchReaderWithDuplicateColumnError) {\n  TestScanWithDuplicateColumnError();\n}\nINSTANTIATE_TEST_SUITE_P(TestScan, TestOrcFileFormatScan,\n                         ::testing::ValuesIn(TestFormatParams::Values()),\n                         TestFormatParams::ToTestNameString);\n\n}  \/\/ namespace dataset\n}  \/\/ namespace arrow\n<|endoftext|>"}
{"text":"<commit_before>\/\/  \n\/\/ Copyright (c) articy Software GmbH & Co. KG. All rights reserved.  \n\/\/ Licensed under the MIT license. See LICENSE file in the project root for full license information.  \n\/\/\n\n#include \"ArticyImporterCommands.h\"\n\n#define LOCTEXT_NAMESPACE \"FArticyImporterModule\"\n\nvoid FArticyImporterCommands::RegisterCommands()\n{\n\tUI_COMMAND(OpenPluginWindow, \"ArticyImporter\", \"Bring up ArticyImporter window\", EUserInterfaceActionType::Button, FInputGesture());\n}\n\n#undef LOCTEXT_NAMESPACE\n<commit_msg>Replaced deprecated FInputGesture wird FInputChord<commit_after>\/\/  \n\/\/ Copyright (c) articy Software GmbH & Co. KG. All rights reserved.  \n\/\/ Licensed under the MIT license. See LICENSE file in the project root for full license information.  \n\/\/\n\n#include \"ArticyImporterCommands.h\"\n\n#define LOCTEXT_NAMESPACE \"FArticyImporterModule\"\n\nvoid FArticyImporterCommands::RegisterCommands()\n{\n\tUI_COMMAND(OpenPluginWindow, \"ArticyImporter\", \"Bring up ArticyImporter window\", EUserInterfaceActionType::Button, FInputChord());\n}\n\n#undef LOCTEXT_NAMESPACE\n<|endoftext|>"}
{"text":"<commit_before>#include <tabulate\/table.hpp>\nusing namespace tabulate;\n\nint main() {\n  Table table;\n\n  table.format().corner(\"♥\").font_style({FontStyle::bold});\n\n  table.add_row({\"English\", \"I love you\"});\n  table.add_row({\"French\", \"Je t’aime\"});\n  table.add_row({\"Spanish\", \"Te amo\"});\n  table.add_row({\"German\", \"Ich liebe Dich\"});\n  table.add_row({\"Mandarin Chinese\", \"我爱你\"});\n  table.add_row({\"Japanese\", \"愛してる\"});\n  table.add_row({\"Korean\", \"사랑해 (Saranghae)\"});\n  table.add_row({\"Greek\", \"Σ΄αγαπώ (Se agapo)\"});\n  table.add_row({\"Italian\", \"Ti amo\"});\n  table.add_row({\"Russian\", \"Я тебя люблю (Ya tebya liubliu)\"});\n  table.add_row({\"Hebrew\", \"אני אוהב אותך (Ani ohev otakh)\"});\n\n  \/\/ Column 1 is using mult-byte characters\n  table.column(1).format().multi_byte_characters(true);\n\n  \/\/ Set the table-level locale\n  table.column(0).format().locale(\"en_US.UTF-8\");\n\n  \/\/ Set English-US locale for first column\n  table[0][1].format().locale(\"en_US.UTF-8\");\n\n  \/\/ Set locale for individual cells\n  table[1][1].format().locale(\"fr_FR.UTF-8\");  \/\/ French\n  table[2][1].format().locale(\"es_ES.UTF-8\");  \/\/ Spanish\n  table[3][1].format().locale(\"de_DE.UTF-8\");  \/\/ German\n  table[4][1].format().locale(\"zh_CN.UTF-8\");  \/\/ Chinese\n  table[5][1].format().locale(\"ja_JP.UTF-8\");  \/\/ Japanese\n  table[6][1].format().locale(\"ko_KR.UTF-8\");  \/\/ Korean\n  table[7][1].format().locale(\"el_GR.UTF-8\");  \/\/ Greek\n  table[8][1].format().locale(\"it_IT.UTF-8\");  \/\/ Italian\n  table[9][1].format().locale(\"ru_RU.UTF-8\");  \/\/ Russian\n  table[10][1].format().locale(\"he_IL.UTF-8\"); \/\/ Hebrew\n\n  std::cout << table << std::endl;\n}<commit_msg>Updated comments<commit_after>#include <tabulate\/table.hpp>\nusing namespace tabulate;\n\nint main() {\n  Table table;\n\n  table.format().corner(\"♥\").font_style({FontStyle::bold});\n\n  table.add_row({\"English\", \"I love you\"});\n  table.add_row({\"French\", \"Je t’aime\"});\n  table.add_row({\"Spanish\", \"Te amo\"});\n  table.add_row({\"German\", \"Ich liebe Dich\"});\n  table.add_row({\"Mandarin Chinese\", \"我爱你\"});\n  table.add_row({\"Japanese\", \"愛してる\"});\n  table.add_row({\"Korean\", \"사랑해 (Saranghae)\"});\n  table.add_row({\"Greek\", \"Σ΄αγαπώ (Se agapo)\"});\n  table.add_row({\"Italian\", \"Ti amo\"});\n  table.add_row({\"Russian\", \"Я тебя люблю (Ya tebya liubliu)\"});\n  table.add_row({\"Hebrew\", \"אני אוהב אותך (Ani ohev otakh)\"});\n\n  \/\/ Column 1 is using mult-byte characters\n  table.column(1).format().multi_byte_characters(true);\n\n  \/\/ Set English-US locale for first column\n  table.column(0).format().locale(\"en_US.UTF-8\");\n  table[0][1].format().locale(\"en_US.UTF-8\");\n\n  \/\/ Set locale for individual cells\n  table[1][1].format().locale(\"fr_FR.UTF-8\");  \/\/ French\n  table[2][1].format().locale(\"es_ES.UTF-8\");  \/\/ Spanish\n  table[3][1].format().locale(\"de_DE.UTF-8\");  \/\/ German\n  table[4][1].format().locale(\"zh_CN.UTF-8\");  \/\/ Chinese\n  table[5][1].format().locale(\"ja_JP.UTF-8\");  \/\/ Japanese\n  table[6][1].format().locale(\"ko_KR.UTF-8\");  \/\/ Korean\n  table[7][1].format().locale(\"el_GR.UTF-8\");  \/\/ Greek\n  table[8][1].format().locale(\"it_IT.UTF-8\");  \/\/ Italian\n  table[9][1].format().locale(\"ru_RU.UTF-8\");  \/\/ Russian\n  table[10][1].format().locale(\"he_IL.UTF-8\"); \/\/ Hebrew\n\n  std::cout << table << std::endl;\n}<|endoftext|>"}
{"text":"<commit_before>#include \"LuaStack.h\"\n\n#include <stdexcept>\n#include <string.h>\n\nLuaStack::LuaStack()\n\t: L(NULL) {\n\n}\n\nLuaStack::~LuaStack() {\n\tif(L) {\n\t\tlua_close(L);\n\t\tL = NULL;\n\t}\n}\n\nLuaStack* LuaStack::create() {\n\tLuaStack* luastack = new (std::nothrow) LuaStack();\n\tif (luastack && luastack->init()) {\n\t\treturn luastack;\n\t}\n\n\tif (luastack) {\n\t\tdelete luastack;\n\t\tluastack = NULL;\n\t}\n\treturn NULL;\n}\n\nvoid LuaStack::destroy(LuaStack* luastack) {\n\tif (luastack) {\n\t\tdelete luastack;\n\t\tluastack = NULL;\n\t}\n}\n\nbool LuaStack::init() {\n\tdo\n\t{\n\t\tL = luaL_newstate();\n\t\tif (L == NULL)\n\t\t\tbreak;\n\t\tluaL_openlibs(L);\n\t\ttolua_open(L);\n\t\t\/\/ FIXME: reg func\n\n\t\treturn true;\n\t}while(false);\n\n\treturn false;\n}\n\nvoid LuaStack::addSearchPath(const char* path) {\n    lua_getglobal(L, \"package\");\n    lua_getfield(L, -1, \"path\");\n    const char* cur_path =  lua_tostring(L, -1);\n    lua_pushfstring(L, \"%s;%s\/?.lua\", cur_path, path);\n    lua_setfield(L, -3, \"path\");\n    lua_pop(L, 2);\n}\n\nvoid LuaStack::load(const char* modname) {\n\tif (modname == NULL || strlen(modname) == 0) {\n        return;\n    }\n\n    std::string name = modname;\n    std::string require = \"require \\'\" + name + \"\\'\";\n    return executeString(require.c_str());\n}\n\nvoid LuaStack::reload(const char* modname) {\n\tif (modname == NULL || strlen(modname) == 0) {\n        return;\n    }\n\n    lua_getglobal(L, \"package\");\n    lua_getfield(L, -1, \"loaded\");\n    lua_pushstring(L, modname);\n    lua_gettable(L, -2);\n    if (!lua_isnil(L, -1)) {\n        lua_pushstring(L, modname);\n        lua_pushnil(L);\n        lua_settable(L, -4);\n    }\n    lua_pop(L, 3);\n\n\tstd::string name = modname;\n    std::string require = \"require \\'\" + name + \"\\'\";\n    return executeString(require.c_str());\n}\n\nvoid LuaStack::unload(const char* modname) {\n\tif (modname == NULL || strlen(modname) == 0) {\n        return;\n    }\n\n    lua_getglobal(L, \"package\");\n    lua_getfield(L, -1, \"loaded\");\n    lua_pushstring(L, modname);\n    lua_gettable(L, -2);\n    if (!lua_isnil(L, -1)) {\n        lua_pushstring(L, modname);\n        lua_pushnil(L);\n        lua_settable(L, -4);\n    }\n    lua_pop(L, 3);\n}\n\n\/\/\n\/\/ push value\n\/\/\nvoid LuaStack::pushBool(bool boolValue) {\n\tlua_pushboolean(L, boolValue);\n}\n\nvoid LuaStack::pushInt(int intValue) {\n\tlua_pushinteger(L, static_cast<lua_Integer>(intValue));\n}\n\nvoid LuaStack::pushLong(long longValue) {\n\tlua_pushnumber(L, static_cast<lua_Number>(longValue));\n}\n\nvoid LuaStack::pushFloat(float floatValue) {\n\tlua_pushnumber(L, static_cast<lua_Number>(floatValue));\n}\n\nvoid LuaStack::pushDouble(double doubleValue) {\n\tlua_pushnumber(L, doubleValue);\n}\n\nvoid LuaStack::pushString(const char* stringValue) {\n\tlua_pushstring(L, stringValue);\n}\n\nvoid LuaStack::pushString(const char* stringValue, size_t length) {\n\tlua_pushlstring(L, stringValue, length);\n}\n\nvoid LuaStack::pushString(const std::string& stringValue) {\n\tlua_pushstring(L, stringValue.c_str());\n}\n\nvoid LuaStack::pushUserType(void* p, const char* name) {\n\ttolua_pushusertype(L, p, name);\n}\n\nvoid LuaStack::pushUserType(void* p, const std::string& name) {\n\ttolua_pushusertype(L, p, name.c_str());\n}\n\nvoid LuaStack::pushSharedUserType(const std::tr1::shared_ptr<void>& ptr, const char* name) {\n\ttolua_pushsharedusertype(L, ptr, name);\n}\n\nvoid LuaStack::pushSharedUserType(const std::tr1::shared_ptr<void>& ptr, const std::string& name) {\n\ttolua_pushsharedusertype(L, ptr, name.c_str());\n}\n\n\/\/\n\/\/ to value\n\/\/\nbool LuaStack::toBool(int index) {\n\treturn lua_toboolean(L, index);\n}\n\nint LuaStack::toInt(int index) {\n\treturn static_cast<int>(lua_tointeger(L, index));\n}\n\nlong LuaStack::toLong(int index) {\n\treturn static_cast<long>(lua_tonumber(L, index));\n}\n\nfloat LuaStack::toFloat(int index) {\n\treturn static_cast<float>(lua_tonumber(L, index));\n}\n\ndouble LuaStack::toDouble(int index) {\n\treturn lua_tonumber(L, index);\n}\n\nconst char* LuaStack::toString(int index) {\n\treturn lua_tostring(L, index);\n}\n\nconst char* LuaStack::toString(int index, size_t& length) {\n\treturn lua_tolstring(L, index, &length);\n}\n\nvoid* LuaStack::toUserType(int index, const char* name) {\n\treturn tolua_tousertype(L, index, name);\n}\n\nvoid* LuaStack::toUserType(int index, const std::string& name) {\n\treturn tolua_tousertype(L, index, name.c_str());\n}\n\nstd::tr1::shared_ptr<void> LuaStack::toSharedUserType(int index, const char* name) {\n\treturn tolua_tosharedusertype(L, index, name);\n}\n\nstd::tr1::shared_ptr<void> LuaStack::toSharedUserType(int index, const std::string& name) {\n\treturn tolua_tosharedusertype(L, index, name.c_str());\n}\n\n\/\/\nint LuaStack::gettop() {\n\treturn lua_gettop(L);\n}\n\nvoid LuaStack::clean(void) {\n\tlua_settop(L, 0);\n}\n\nint LuaStack::formatIndex(int index) {\n\treturn index >= 0 ? index : (lua_gettop(L) + 1 + index);\n}\n\n\/\/\n\/\/ execute\n\/\/\nvoid LuaStack::executeGlobalFunction(const char* functionName, int nargs, int nresults) {\n\tlua_getglobal(L, functionName);\n\tif (nargs > 0) {\n\t\tlua_insert(L, -(nargs + 1));\n\t}\n\texecute(nargs, nresults);\n}\n\nvoid LuaStack::executeGlobalFunction(const std::string& functionName, int nargs, int nresults) {\n\tlua_getglobal(L, functionName.c_str());\n\tif (nargs > 0) {\n\t\tlua_insert(L, -(nargs + 1));\n\t}\n\texecute(nargs, nresults);\n}\n\nvoid LuaStack::executeString(const char* codes) {\n\tluaL_loadstring(L, codes);\n    execute(0, 0);\n}\n\nvoid LuaStack::execute(int nargs, int nresults) {\n\tint functionIndex = formatIndex(-(nargs + 1));\n\tint traceback = 0;\n\tlua_getglobal(L, \"__TRACKBACK__\");\n\tif (!lua_isfunction(L, -1)) {\n\t    lua_pop(L, 1);\n\t} else {\n\t    lua_insert(L, functionIndex);\n\t    traceback = functionIndex;\n\t}\n\n\tif(lua_pcall(L, nargs, nresults, traceback) != 0) {\n\t\tstd::string error = lua_tostring(L, -1);\n\t\tlua_pop(L, traceback ? 2 : 1);\n\t\tthrow std::runtime_error(error);\n\t} else if (traceback) {\n\t\tlua_remove(L, traceback);\n\t}\n}<commit_msg>fix pushstring<commit_after>#include \"LuaStack.h\"\n\n#include <stdexcept>\n#include <string.h>\n\nLuaStack::LuaStack()\n\t: L(NULL) {\n\n}\n\nLuaStack::~LuaStack() {\n\tif(L) {\n\t\tlua_close(L);\n\t\tL = NULL;\n\t}\n}\n\nLuaStack* LuaStack::create() {\n\tLuaStack* luastack = new (std::nothrow) LuaStack();\n\tif (luastack && luastack->init()) {\n\t\treturn luastack;\n\t}\n\n\tif (luastack) {\n\t\tdelete luastack;\n\t\tluastack = NULL;\n\t}\n\treturn NULL;\n}\n\nvoid LuaStack::destroy(LuaStack* luastack) {\n\tif (luastack) {\n\t\tdelete luastack;\n\t\tluastack = NULL;\n\t}\n}\n\nbool LuaStack::init() {\n\tdo\n\t{\n\t\tL = luaL_newstate();\n\t\tif (L == NULL)\n\t\t\tbreak;\n\t\tluaL_openlibs(L);\n\t\ttolua_open(L);\n\t\t\/\/ FIXME: reg func\n\n\t\treturn true;\n\t}while(false);\n\n\treturn false;\n}\n\nvoid LuaStack::addSearchPath(const char* path) {\n    lua_getglobal(L, \"package\");\n    lua_getfield(L, -1, \"path\");\n    const char* cur_path =  lua_tostring(L, -1);\n    lua_pushfstring(L, \"%s;%s\/?.lua\", cur_path, path);\n    lua_setfield(L, -3, \"path\");\n    lua_pop(L, 2);\n}\n\nvoid LuaStack::load(const char* modname) {\n\tif (modname == NULL || strlen(modname) == 0) {\n        return;\n    }\n\n    std::string name = modname;\n    std::string require = \"require \\'\" + name + \"\\'\";\n    return executeString(require.c_str());\n}\n\nvoid LuaStack::reload(const char* modname) {\n\tif (modname == NULL || strlen(modname) == 0) {\n        return;\n    }\n\n    lua_getglobal(L, \"package\");\n    lua_getfield(L, -1, \"loaded\");\n    lua_pushstring(L, modname);\n    lua_gettable(L, -2);\n    if (!lua_isnil(L, -1)) {\n        lua_pushstring(L, modname);\n        lua_pushnil(L);\n        lua_settable(L, -4);\n    }\n    lua_pop(L, 3);\n\n\tstd::string name = modname;\n    std::string require = \"require \\'\" + name + \"\\'\";\n    return executeString(require.c_str());\n}\n\nvoid LuaStack::unload(const char* modname) {\n\tif (modname == NULL || strlen(modname) == 0) {\n        return;\n    }\n\n    lua_getglobal(L, \"package\");\n    lua_getfield(L, -1, \"loaded\");\n    lua_pushstring(L, modname);\n    lua_gettable(L, -2);\n    if (!lua_isnil(L, -1)) {\n        lua_pushstring(L, modname);\n        lua_pushnil(L);\n        lua_settable(L, -4);\n    }\n    lua_pop(L, 3);\n}\n\n\/\/\n\/\/ push value\n\/\/\nvoid LuaStack::pushBool(bool boolValue) {\n\tlua_pushboolean(L, boolValue);\n}\n\nvoid LuaStack::pushInt(int intValue) {\n\tlua_pushinteger(L, static_cast<lua_Integer>(intValue));\n}\n\nvoid LuaStack::pushLong(long longValue) {\n\tlua_pushnumber(L, static_cast<lua_Number>(longValue));\n}\n\nvoid LuaStack::pushFloat(float floatValue) {\n\tlua_pushnumber(L, static_cast<lua_Number>(floatValue));\n}\n\nvoid LuaStack::pushDouble(double doubleValue) {\n\tlua_pushnumber(L, doubleValue);\n}\n\nvoid LuaStack::pushString(const char* stringValue) {\n\tlua_pushstring(L, stringValue);\n}\n\nvoid LuaStack::pushString(const char* stringValue, size_t length) {\n\tlua_pushlstring(L, stringValue, length);\n}\n\nvoid LuaStack::pushString(const std::string& stringValue) {\n\tlua_pushlstring(L, stringValue.c_str(), stringValue.size());\n}\n\nvoid LuaStack::pushUserType(void* p, const char* name) {\n\ttolua_pushusertype(L, p, name);\n}\n\nvoid LuaStack::pushUserType(void* p, const std::string& name) {\n\ttolua_pushusertype(L, p, name.c_str());\n}\n\nvoid LuaStack::pushSharedUserType(const std::tr1::shared_ptr<void>& ptr, const char* name) {\n\ttolua_pushsharedusertype(L, ptr, name);\n}\n\nvoid LuaStack::pushSharedUserType(const std::tr1::shared_ptr<void>& ptr, const std::string& name) {\n\ttolua_pushsharedusertype(L, ptr, name.c_str());\n}\n\n\/\/\n\/\/ to value\n\/\/\nbool LuaStack::toBool(int index) {\n\treturn lua_toboolean(L, index);\n}\n\nint LuaStack::toInt(int index) {\n\treturn static_cast<int>(lua_tointeger(L, index));\n}\n\nlong LuaStack::toLong(int index) {\n\treturn static_cast<long>(lua_tonumber(L, index));\n}\n\nfloat LuaStack::toFloat(int index) {\n\treturn static_cast<float>(lua_tonumber(L, index));\n}\n\ndouble LuaStack::toDouble(int index) {\n\treturn lua_tonumber(L, index);\n}\n\nconst char* LuaStack::toString(int index) {\n\treturn lua_tostring(L, index);\n}\n\nconst char* LuaStack::toString(int index, size_t& length) {\n\treturn lua_tolstring(L, index, &length);\n}\n\nvoid* LuaStack::toUserType(int index, const char* name) {\n\treturn tolua_tousertype(L, index, name);\n}\n\nvoid* LuaStack::toUserType(int index, const std::string& name) {\n\treturn tolua_tousertype(L, index, name.c_str());\n}\n\nstd::tr1::shared_ptr<void> LuaStack::toSharedUserType(int index, const char* name) {\n\treturn tolua_tosharedusertype(L, index, name);\n}\n\nstd::tr1::shared_ptr<void> LuaStack::toSharedUserType(int index, const std::string& name) {\n\treturn tolua_tosharedusertype(L, index, name.c_str());\n}\n\n\/\/\nint LuaStack::gettop() {\n\treturn lua_gettop(L);\n}\n\nvoid LuaStack::clean(void) {\n\tlua_settop(L, 0);\n}\n\nint LuaStack::formatIndex(int index) {\n\treturn index >= 0 ? index : (lua_gettop(L) + 1 + index);\n}\n\n\/\/\n\/\/ execute\n\/\/\nvoid LuaStack::executeGlobalFunction(const char* functionName, int nargs, int nresults) {\n\tlua_getglobal(L, functionName);\n\tif (nargs > 0) {\n\t\tlua_insert(L, -(nargs + 1));\n\t}\n\texecute(nargs, nresults);\n}\n\nvoid LuaStack::executeGlobalFunction(const std::string& functionName, int nargs, int nresults) {\n\tlua_getglobal(L, functionName.c_str());\n\tif (nargs > 0) {\n\t\tlua_insert(L, -(nargs + 1));\n\t}\n\texecute(nargs, nresults);\n}\n\nvoid LuaStack::executeString(const char* codes) {\n\tluaL_loadstring(L, codes);\n    execute(0, 0);\n}\n\nvoid LuaStack::execute(int nargs, int nresults) {\n\tint functionIndex = formatIndex(-(nargs + 1));\n\tint traceback = 0;\n\tlua_getglobal(L, \"__TRACKBACK__\");\n\tif (!lua_isfunction(L, -1)) {\n\t    lua_pop(L, 1);\n\t} else {\n\t    lua_insert(L, functionIndex);\n\t    traceback = functionIndex;\n\t}\n\n\tif(lua_pcall(L, nargs, nresults, traceback) != 0) {\n\t\tstd::string error = lua_tostring(L, -1);\n\t\tlua_pop(L, traceback ? 2 : 1);\n\t\tthrow std::runtime_error(error);\n\t} else if (traceback) {\n\t\tlua_remove(L, traceback);\n\t}\n}<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: editutil.hxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: nn $ $Date: 2002-09-23 14:12: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#ifndef SC_EDITUTIL_HXX\n#define SC_EDITUTIL_HXX\n\n\n#ifndef _MyEDITENG_HXX \/\/autogen\n#include <svx\/editeng.hxx>\n#endif\n\n#ifndef _SVX_PAGEITEM_HXX \/\/autogen\n#include <svx\/pageitem.hxx>\n#endif\n\n#ifndef _DATE_HXX \/\/autogen\n#include <tools\/date.hxx>\n#endif\n\n#ifndef _TIME_HXX \/\/autogen\n#include <tools\/time.hxx>\n#endif\n\n#ifndef _GEN_HXX \/\/autogen\n#include <tools\/gen.hxx>\n#endif\n\n#ifndef _FRACT_HXX \/\/autogen\n#include <tools\/fract.hxx>\n#endif\n\n\nclass OutputDevice;\nclass ScDocument;\nclass ScPatternAttr;\n\nclass ScEditUtil\n{\n    ScDocument*     pDoc;\n    USHORT          nCol;\n    USHORT          nRow;\n    USHORT          nTab;\n    Point           aScrPos;\n    OutputDevice*   pDev;           \/\/ MapMode muss eingestellt sein\n    double          nPPTX;\n    double          nPPTY;\n    Fraction        aZoomX;\n    Fraction        aZoomY;\n\n    static const char __FAR_DATA pCalcDelimiters[];\n\npublic:\n    static String ModifyDelimiters( const String& rOld );\n    static String GetSpaceDelimitedString( const EditEngine& rEngine );\n\npublic:\n                ScEditUtil( ScDocument* pDocument, USHORT nX, USHORT nY, USHORT nZ,\n                            const Point& rScrPosPixel,\n                            OutputDevice* pDevice, double nScaleX, double nScaleY,\n                            const Fraction& rX, const Fraction& rY ) :\n                    pDoc(pDocument),nCol(nX),nRow(nY),nTab(nZ),\n                    aScrPos(rScrPosPixel),pDev(pDevice),\n                    nPPTX(nScaleX),nPPTY(nScaleY),aZoomX(rX),aZoomY(rY) {}\n\n    Rectangle   GetEditArea( const ScPatternAttr* pPattern, BOOL bForceToTop );\n};\n\n\nclass ScEditAttrTester\n{\n    EditEngine* pEngine;\n    SfxItemSet* pEditAttrs;\n    BOOL        bNeedsObject;\n    BOOL        bNeedsCellAttr;\n\npublic:\n                ScEditAttrTester( EditEngine* pEng );\n                ~ScEditAttrTester();\n\n    BOOL                NeedsObject() const     { return bNeedsObject; }\n    BOOL                NeedsCellAttr() const   { return bNeedsCellAttr; }\n    const SfxItemSet&   GetAttribs() const      { return *pEditAttrs; }\n};\n\n\n\/\/ construct pool before constructing EditEngine, destroy pool after EditEngine\nclass ScEnginePoolHelper\n{\nprotected:\n    SfxItemPool*    pEnginePool;\n    SfxItemSet*     pDefaults;\n    BOOL            bDeleteEnginePool;\n    BOOL            bDeleteDefaults;\n\n                    ScEnginePoolHelper( SfxItemPool* pEnginePool,\n                        BOOL bDeleteEnginePool = FALSE );\n                    ScEnginePoolHelper( const ScEnginePoolHelper& rOrg );\n    virtual         ~ScEnginePoolHelper();\n};\n\n\nclass ScEditEngineDefaulter : public ScEnginePoolHelper, public EditEngine\n{\npublic:\n                    \/\/\/ bDeleteEnginePool: Engine becomes the owner of the pool\n                    \/\/\/ and deletes it on destruction\n                    ScEditEngineDefaulter( SfxItemPool* pEnginePool,\n                        BOOL bDeleteEnginePool = FALSE );\n                    \/\/\/ If rOrg.bDeleteEnginePool: pool gets cloned and will be\n                    \/\/\/ deleted on destruction. Defaults are not set.\n                    ScEditEngineDefaulter( const ScEditEngineDefaulter& rOrg );\n    virtual         ~ScEditEngineDefaulter();\n\n                    \/\/\/ Creates a copy of SfxItemSet if bRememberCopy set\n    void            SetDefaults( const SfxItemSet& rDefaults, BOOL bRememberCopy = TRUE );\n\n                    \/\/\/ Becomes the owner of the SfxItemSet if bTakeOwnership set\n    void            SetDefaults( SfxItemSet* pDefaults, BOOL bTakeOwnership = TRUE );\n\n                    \/\/\/ Set the item in the default ItemSet which is created\n                    \/\/\/ if it doesn't exist yet.\n                    \/\/\/ The default ItemSet is then applied to each paragraph.\n    void            SetDefaultItem( const SfxPoolItem& rItem );\n\n                    \/\/\/ Overwritten method to be able to apply defaults already set\n    void            SetText( const EditTextObject& rTextObject );\n                    \/\/\/ Current defaults are not applied, new defaults are applied\n    void            SetTextNewDefaults( const EditTextObject& rTextObject,\n                        const SfxItemSet& rDefaults, BOOL bRememberCopy = TRUE );\n                    \/\/\/ Current defaults are not applied, new defaults are applied\n    void            SetTextNewDefaults( const EditTextObject& rTextObject,\n                        SfxItemSet* pDefaults, BOOL bTakeOwnership = TRUE );\n\n                    \/\/\/ Overwritten method to be able to apply defaults already set\n    void            SetText( const String& rText );\n                    \/\/\/ Current defaults are not applied, new defaults are applied\n    void            SetTextNewDefaults( const String& rText,\n                        const SfxItemSet& rDefaults, BOOL bRememberCopy = TRUE );\n                    \/\/\/ Current defaults are not applied, new defaults are applied\n    void            SetTextNewDefaults( const String& rText,\n                        SfxItemSet* pDefaults, BOOL bTakeOwnership = TRUE );\n\n                    \/\/\/ Paragraph attributes that are not defaults are copied to\n                    \/\/\/ character attributes and all paragraph attributes reset\n    void            RemoveParaAttribs();\n\n                    \/\/\/ Re-apply existing defaults if set, same as in SetText,\n                    \/\/\/ but without EnableUndo\/SetUpdateMode.\n    void            RepeatDefaults();\n};\n\n\n\/\/ 1\/100 mm\nclass ScTabEditEngine : public ScEditEngineDefaulter\n{\nprivate:\n    void    Init(const ScPatternAttr& rPattern);\npublic:\n    ScTabEditEngine( ScDocument* pDoc );            \/\/ Default\n    \/\/ pEnginePool = ScDocument.GetEnginePool()\n    \/\/ pTextObjectPool = ScDocument.GetEditPool()\n    ScTabEditEngine( const ScPatternAttr& rPattern,\n                    SfxItemPool* pEnginePool,\n                    SfxItemPool* pTextObjectPool = NULL );\n};\n\n\nstruct ScHeaderFieldData\n{\n    String      aTitle;             \/\/ Titel oder Dateiname wenn kein Titel\n    String      aLongDocName;       \/\/ Pfad und Dateiname\n    String      aShortDocName;      \/\/ nur Dateiname\n    String      aTabName;\n    Date        aDate;\n    Time        aTime;\n    long        nPageNo;\n    long        nTotalPages;\n    SvxNumType  eNumType;\n\n    ScHeaderFieldData();\n};\n\n\n\/\/ fuer Feldbefehle in der Tabelle\nclass ScFieldEditEngine : public ScEditEngineDefaulter\n{\nprivate:\n    BOOL    bExecuteURL;\n\npublic:\n    \/\/ pEnginePool = ScDocument.GetEnginePool()\n    \/\/ pTextObjectPool = ScDocument.GetEditPool()\n    ScFieldEditEngine( SfxItemPool* pEnginePool,\n                        SfxItemPool* pTextObjectPool = NULL,\n                        BOOL bDeleteEnginePool = FALSE );\n\n    void    SetExecuteURL(BOOL bSet)    { bExecuteURL = bSet; }\n\n    virtual void    FieldClicked( const SvxFieldItem& rField, USHORT, USHORT );\n    virtual String  CalcFieldValue( const SvxFieldItem& rField, USHORT nPara, USHORT nPos, Color*& rTxtColor, Color*& rFldColor );\n};\n\n\n\/\/ for headers\/footers with fields\nclass ScHeaderEditEngine : public ScEditEngineDefaulter\n{\nprivate:\n    ScHeaderFieldData   aData;\n\npublic:\n    ScHeaderEditEngine( SfxItemPool* pEnginePool, BOOL bDeleteEnginePool = FALSE );\n    virtual String CalcFieldValue( const SvxFieldItem& rField, USHORT nPara, USHORT nPos, Color*& rTxtColor, Color*& rFldColor );\n\n    void SetTitle(const String& rNew)               { aData.aTitle = rNew; }\n    void SetLongDocName(const String& rNew)         { aData.aLongDocName = rNew; }\n    void SetShortDocName(const String& rNew)        { aData.aShortDocName = rNew; }\n    void SetTabName(const String& rNew)             { aData.aTabName = rNew; }\n    void SetDate(const Date& rNew)                  { aData.aDate = rNew; }\n    void SetTime(const Time& rNew)                  { aData.aTime = rNew; }\n    void SetPageNo(long nNew)                       { aData.nPageNo = nNew; }\n    void SetTotalPages(long nNew)                   { aData.nTotalPages = nNew; }\n    void SetNumType(SvxNumType eNew)                { aData.eNumType = eNew; }\n    void SetData(const ScHeaderFieldData& rNew)     { aData = rNew; }\n};\n\n\/\/  SvxFieldData-Ableitungen sind nach Svx verschoben\n\n\n#endif\n\n\n<commit_msg>INTEGRATION: CWS rowlimit (1.5.302); FILE MERGED 2004\/01\/16 17:39:45 er 1.5.302.2: #i1967# SCCOL,SCROW,SCTAB replace USHORT; SCsCOL,SCsROW,SCsTAB replace short 2004\/01\/12 17:14:59 er 1.5.302.1: #i1967# SCCOL,SCROW,SCTAB replace USHORT; SCsCOL,SCsROW,SCsTAB replace short<commit_after>\/*************************************************************************\n *\n *  $RCSfile: editutil.hxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: obo $ $Date: 2004-06-04 10:09: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 SC_EDITUTIL_HXX\n#define SC_EDITUTIL_HXX\n\n\n#ifndef SC_ADDRESS_HXX\n#include \"address.hxx\"\n#endif\n\n#ifndef _MyEDITENG_HXX \/\/autogen\n#include <svx\/editeng.hxx>\n#endif\n\n#ifndef _SVX_PAGEITEM_HXX \/\/autogen\n#include <svx\/pageitem.hxx>\n#endif\n\n#ifndef _DATE_HXX \/\/autogen\n#include <tools\/date.hxx>\n#endif\n\n#ifndef _TIME_HXX \/\/autogen\n#include <tools\/time.hxx>\n#endif\n\n#ifndef _GEN_HXX \/\/autogen\n#include <tools\/gen.hxx>\n#endif\n\n#ifndef _FRACT_HXX \/\/autogen\n#include <tools\/fract.hxx>\n#endif\n\n\nclass OutputDevice;\nclass ScDocument;\nclass ScPatternAttr;\n\nclass ScEditUtil\n{\n    ScDocument*     pDoc;\n    SCCOL           nCol;\n    SCROW           nRow;\n    SCTAB           nTab;\n    Point           aScrPos;\n    OutputDevice*   pDev;           \/\/ MapMode muss eingestellt sein\n    double          nPPTX;\n    double          nPPTY;\n    Fraction        aZoomX;\n    Fraction        aZoomY;\n\n    static const char __FAR_DATA pCalcDelimiters[];\n\npublic:\n    static String ModifyDelimiters( const String& rOld );\n    static String GetSpaceDelimitedString( const EditEngine& rEngine );\n\npublic:\n                ScEditUtil( ScDocument* pDocument, SCCOL nX, SCROW nY, SCTAB nZ,\n                            const Point& rScrPosPixel,\n                            OutputDevice* pDevice, double nScaleX, double nScaleY,\n                            const Fraction& rX, const Fraction& rY ) :\n                    pDoc(pDocument),nCol(nX),nRow(nY),nTab(nZ),\n                    aScrPos(rScrPosPixel),pDev(pDevice),\n                    nPPTX(nScaleX),nPPTY(nScaleY),aZoomX(rX),aZoomY(rY) {}\n\n    Rectangle   GetEditArea( const ScPatternAttr* pPattern, BOOL bForceToTop );\n};\n\n\nclass ScEditAttrTester\n{\n    EditEngine* pEngine;\n    SfxItemSet* pEditAttrs;\n    BOOL        bNeedsObject;\n    BOOL        bNeedsCellAttr;\n\npublic:\n                ScEditAttrTester( EditEngine* pEng );\n                ~ScEditAttrTester();\n\n    BOOL                NeedsObject() const     { return bNeedsObject; }\n    BOOL                NeedsCellAttr() const   { return bNeedsCellAttr; }\n    const SfxItemSet&   GetAttribs() const      { return *pEditAttrs; }\n};\n\n\n\/\/ construct pool before constructing EditEngine, destroy pool after EditEngine\nclass ScEnginePoolHelper\n{\nprotected:\n    SfxItemPool*    pEnginePool;\n    SfxItemSet*     pDefaults;\n    BOOL            bDeleteEnginePool;\n    BOOL            bDeleteDefaults;\n\n                    ScEnginePoolHelper( SfxItemPool* pEnginePool,\n                        BOOL bDeleteEnginePool = FALSE );\n                    ScEnginePoolHelper( const ScEnginePoolHelper& rOrg );\n    virtual         ~ScEnginePoolHelper();\n};\n\n\nclass ScEditEngineDefaulter : public ScEnginePoolHelper, public EditEngine\n{\npublic:\n                    \/\/\/ bDeleteEnginePool: Engine becomes the owner of the pool\n                    \/\/\/ and deletes it on destruction\n                    ScEditEngineDefaulter( SfxItemPool* pEnginePool,\n                        BOOL bDeleteEnginePool = FALSE );\n                    \/\/\/ If rOrg.bDeleteEnginePool: pool gets cloned and will be\n                    \/\/\/ deleted on destruction. Defaults are not set.\n                    ScEditEngineDefaulter( const ScEditEngineDefaulter& rOrg );\n    virtual         ~ScEditEngineDefaulter();\n\n                    \/\/\/ Creates a copy of SfxItemSet if bRememberCopy set\n    void            SetDefaults( const SfxItemSet& rDefaults, BOOL bRememberCopy = TRUE );\n\n                    \/\/\/ Becomes the owner of the SfxItemSet if bTakeOwnership set\n    void            SetDefaults( SfxItemSet* pDefaults, BOOL bTakeOwnership = TRUE );\n\n                    \/\/\/ Set the item in the default ItemSet which is created\n                    \/\/\/ if it doesn't exist yet.\n                    \/\/\/ The default ItemSet is then applied to each paragraph.\n    void            SetDefaultItem( const SfxPoolItem& rItem );\n\n                    \/\/\/ Overwritten method to be able to apply defaults already set\n    void            SetText( const EditTextObject& rTextObject );\n                    \/\/\/ Current defaults are not applied, new defaults are applied\n    void            SetTextNewDefaults( const EditTextObject& rTextObject,\n                        const SfxItemSet& rDefaults, BOOL bRememberCopy = TRUE );\n                    \/\/\/ Current defaults are not applied, new defaults are applied\n    void            SetTextNewDefaults( const EditTextObject& rTextObject,\n                        SfxItemSet* pDefaults, BOOL bTakeOwnership = TRUE );\n\n                    \/\/\/ Overwritten method to be able to apply defaults already set\n    void            SetText( const String& rText );\n                    \/\/\/ Current defaults are not applied, new defaults are applied\n    void            SetTextNewDefaults( const String& rText,\n                        const SfxItemSet& rDefaults, BOOL bRememberCopy = TRUE );\n                    \/\/\/ Current defaults are not applied, new defaults are applied\n    void            SetTextNewDefaults( const String& rText,\n                        SfxItemSet* pDefaults, BOOL bTakeOwnership = TRUE );\n\n                    \/\/\/ Paragraph attributes that are not defaults are copied to\n                    \/\/\/ character attributes and all paragraph attributes reset\n    void            RemoveParaAttribs();\n\n                    \/\/\/ Re-apply existing defaults if set, same as in SetText,\n                    \/\/\/ but without EnableUndo\/SetUpdateMode.\n    void            RepeatDefaults();\n};\n\n\n\/\/ 1\/100 mm\nclass ScTabEditEngine : public ScEditEngineDefaulter\n{\nprivate:\n    void    Init(const ScPatternAttr& rPattern);\npublic:\n    ScTabEditEngine( ScDocument* pDoc );            \/\/ Default\n    \/\/ pEnginePool = ScDocument.GetEnginePool()\n    \/\/ pTextObjectPool = ScDocument.GetEditPool()\n    ScTabEditEngine( const ScPatternAttr& rPattern,\n                    SfxItemPool* pEnginePool,\n                    SfxItemPool* pTextObjectPool = NULL );\n};\n\n\nstruct ScHeaderFieldData\n{\n    String      aTitle;             \/\/ Titel oder Dateiname wenn kein Titel\n    String      aLongDocName;       \/\/ Pfad und Dateiname\n    String      aShortDocName;      \/\/ nur Dateiname\n    String      aTabName;\n    Date        aDate;\n    Time        aTime;\n    long        nPageNo;\n    long        nTotalPages;\n    SvxNumType  eNumType;\n\n    ScHeaderFieldData();\n};\n\n\n\/\/ fuer Feldbefehle in der Tabelle\nclass ScFieldEditEngine : public ScEditEngineDefaulter\n{\nprivate:\n    BOOL    bExecuteURL;\n\npublic:\n    \/\/ pEnginePool = ScDocument.GetEnginePool()\n    \/\/ pTextObjectPool = ScDocument.GetEditPool()\n    ScFieldEditEngine( SfxItemPool* pEnginePool,\n                        SfxItemPool* pTextObjectPool = NULL,\n                        BOOL bDeleteEnginePool = FALSE );\n\n    void    SetExecuteURL(BOOL bSet)    { bExecuteURL = bSet; }\n\n    virtual void    FieldClicked( const SvxFieldItem& rField, USHORT, USHORT );\n    virtual String  CalcFieldValue( const SvxFieldItem& rField, USHORT nPara, USHORT nPos, Color*& rTxtColor, Color*& rFldColor );\n};\n\n\n\/\/ for headers\/footers with fields\nclass ScHeaderEditEngine : public ScEditEngineDefaulter\n{\nprivate:\n    ScHeaderFieldData   aData;\n\npublic:\n    ScHeaderEditEngine( SfxItemPool* pEnginePool, BOOL bDeleteEnginePool = FALSE );\n    virtual String CalcFieldValue( const SvxFieldItem& rField, USHORT nPara, USHORT nPos, Color*& rTxtColor, Color*& rFldColor );\n\n    void SetTitle(const String& rNew)               { aData.aTitle = rNew; }\n    void SetLongDocName(const String& rNew)         { aData.aLongDocName = rNew; }\n    void SetShortDocName(const String& rNew)        { aData.aShortDocName = rNew; }\n    void SetTabName(const String& rNew)             { aData.aTabName = rNew; }\n    void SetDate(const Date& rNew)                  { aData.aDate = rNew; }\n    void SetTime(const Time& rNew)                  { aData.aTime = rNew; }\n    void SetPageNo(long nNew)                       { aData.nPageNo = nNew; }\n    void SetTotalPages(long nNew)                   { aData.nTotalPages = nNew; }\n    void SetNumType(SvxNumType eNew)                { aData.eNumType = eNew; }\n    void SetData(const ScHeaderFieldData& rNew)     { aData = rNew; }\n};\n\n\/\/  SvxFieldData-Ableitungen sind nach Svx verschoben\n\n\n#endif\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: olinetab.hxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 17:46: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 SC_OUTLINETAB_HXX\n#define SC_OUTLINETAB_HXX\n\n\n#ifndef SC_COLLECT_HXX\n#include \"collect.hxx\"\n#endif\n#ifndef SC_COMPRESSEDARRAY_HXX\n#include \"compressedarray.hxx\"\n#endif\n\n\n#define SC_OL_MAXDEPTH      7\n\nclass SvStream;\nclass ScMultipleReadHeader;\nclass ScMultipleWriteHeader;\n\n\nclass ScOutlineEntry : public DataObject\n{\n    SCCOLROW    nStart;\n    SCSIZE      nSize;\n    BOOL        bHidden;\n    BOOL        bVisible;\n\npublic:\n                            ScOutlineEntry( SCCOLROW nNewStart, SCCOLROW nNewSize,\n                                                BOOL bNewHidden = FALSE );\n                            ScOutlineEntry( const ScOutlineEntry& rEntry );\n                            ScOutlineEntry( SvStream& rStream, ScMultipleReadHeader& rHdr );\n\n    void                    Store( SvStream& rStream, ScMultipleWriteHeader& rHdr );\n\n    virtual DataObject*     Clone() const;\n\n    SCCOLROW                GetStart() const    { return nStart; }\n    SCSIZE                  GetSize() const     { return nSize; }\n    SCCOLROW                GetEnd() const      { return nStart+nSize-1; }\n    BOOL                    IsHidden() const    { return bHidden; }             \/\/ Gruppe versteckt\n    BOOL                    IsVisible() const   { return bVisible; }            \/\/ Control sichtbar?\n\n    void                    Move( SCsCOLROW nDelta );\n    void                    SetSize( SCSIZE nNewSize );\n    void                    SetPosSize( SCCOLROW nNewPos, SCSIZE nNewSize );\n    void                    SetHidden( BOOL bNewHidden );\n    void                    SetVisible( BOOL bNewVisible );\n};\n\n\nclass ScOutlineCollection : public SortedCollection\n{\npublic:\n                            ScOutlineCollection();\n\n    virtual short           Compare(DataObject* pKey1, DataObject* pKey2) const;\n\n    USHORT                  FindStart( SCCOLROW nMinStart );\n};\n\n\nclass ScOutlineArray\n{\nfriend class ScSubOutlineIterator;\n\nprivate:\n    USHORT                  nDepth;\n    ScOutlineCollection     aCollections[SC_OL_MAXDEPTH];\n\n    BOOL                    DecDepth();\n    void                    FindEntry( SCCOLROW nSearchPos, USHORT& rFindLevel, USHORT& rFindIndex,\n                                        USHORT nMaxLevel = SC_OL_MAXDEPTH );\n    void                    RemoveSub( SCCOLROW nStartPos, SCCOLROW nEndPos, USHORT nLevel );\n    void                    PromoteSub( SCCOLROW nStartPos, SCCOLROW nEndPos, USHORT nStartLevel );\n\npublic:\n                            ScOutlineArray();\n                            ScOutlineArray( const ScOutlineArray& rArray );\n\n    USHORT                  GetDepth() const         { return nDepth; }\n\n    BOOL                    FindTouchedLevel( SCCOLROW nBlockStart, SCCOLROW nBlockEnd,\n                                                USHORT& rFindLevel ) const;\n\n    BOOL                    Insert( SCCOLROW nStartPos, SCCOLROW nEndPos, BOOL& rSizeChanged,\n                                    BOOL bHidden = FALSE, BOOL bVisible = TRUE );\n    BOOL                    Remove( SCCOLROW nBlockStart, SCCOLROW nBlockEnd, BOOL& rSizeChanged );\n\n    ScOutlineEntry*         GetEntry( USHORT nLevel, USHORT nIndex ) const;\n    USHORT                  GetCount( USHORT nLevel ) const;\n    ScOutlineEntry*         GetEntryByPos( USHORT nLevel, SCCOLROW nPos ) const;\n\n    BOOL                    GetEntryIndex( USHORT nLevel, SCCOLROW nPos, USHORT& rnIndex ) const;\n    BOOL                    GetEntryIndexInRange(\n                                USHORT nLevel, SCCOLROW nBlockStart, SCCOLROW nBlockEnd,\n                                USHORT& rnIndex ) const;\n\n    void                    SetVisibleBelow( USHORT nLevel, USHORT nEntry, BOOL bValue,\n                                                BOOL bSkipHidden = FALSE );\n\n    void                    GetRange( SCCOLROW& rStart, SCCOLROW& rEnd ) const;\n    void                    ExtendBlock( USHORT nLevel, SCCOLROW& rBlkStart, SCCOLROW& rBlkEnd );\n\n    BOOL                    TestInsertSpace( SCSIZE nSize, SCCOLROW nMaxVal ) const;\n    void                    InsertSpace( SCCOLROW nStartPos, SCSIZE nSize );\n    BOOL                    DeleteSpace( SCCOLROW nStartPos, SCSIZE nSize );\n\n    BOOL                    ManualAction( SCCOLROW nStartPos, SCCOLROW nEndPos,\n                                BOOL bShow,\n                                const ScBitMaskCompressedArray< SCCOLROW, BYTE>& rHiddenFlags );\n\n    void                    Load( SvStream& rStream );\n    void                    Store( SvStream& rStream );\n\n    void                    RemoveAll();\n};\n\n\nclass ScOutlineTable\n{\nprivate:\n    ScOutlineArray          aColOutline;\n    ScOutlineArray          aRowOutline;\n\npublic:\n                            ScOutlineTable();\n                            ScOutlineTable( const ScOutlineTable& rOutline );\n\n    const ScOutlineArray*   GetColArray() const     { return &aColOutline; }\n    ScOutlineArray*         GetColArray()           { return &aColOutline; }\n    const ScOutlineArray*   GetRowArray() const     { return &aRowOutline; }\n    ScOutlineArray*         GetRowArray()           { return &aRowOutline; }\n\n    BOOL                    TestInsertCol( SCSIZE nSize );\n    void                    InsertCol( SCCOL nStartCol, SCSIZE nSize );\n    BOOL                    DeleteCol( SCCOL nStartCol, SCSIZE nSize ); \/\/ TRUE: Undo nur ueber Original\n    BOOL                    TestInsertRow( SCSIZE nSize );\n    void                    InsertRow( SCROW nStartRow, SCSIZE nSize );\n    BOOL                    DeleteRow( SCROW nStartRow, SCSIZE nSize );\n\n    void                    Load( SvStream& rStream );\n    void                    Store( SvStream& rStream );\n};\n\n\nclass ScSubOutlineIterator\n{\nprivate:\n    ScOutlineArray*         pArray;\n    SCCOLROW                nStart;\n    SCCOLROW                nEnd;\n    USHORT                  nSubLevel;\n    USHORT                  nSubEntry;\n    USHORT                  nCount;\n    USHORT                  nDepth;\n\npublic:\n                            ScSubOutlineIterator( ScOutlineArray* pOutlineArray );\n                            ScSubOutlineIterator( ScOutlineArray* pOutlineArray,\n                                                    USHORT nLevel, USHORT nEntry );\n    ScOutlineEntry*         GetNext();\n    USHORT                  LastLevel() const;\n    USHORT                  LastEntry() const;\n    void                    DeleteLast();\n};\n\n#endif\n\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.5.700); FILE MERGED 2008\/04\/01 12:35:59 thb 1.5.700.2: #i85898# Stripping all external header guards 2008\/03\/31 17:13:32 rt 1.5.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: olinetab.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 SC_OUTLINETAB_HXX\n#define SC_OUTLINETAB_HXX\n\n\n#include \"collect.hxx\"\n#include \"compressedarray.hxx\"\n\n\n#define SC_OL_MAXDEPTH      7\n\nclass SvStream;\nclass ScMultipleReadHeader;\nclass ScMultipleWriteHeader;\n\n\nclass ScOutlineEntry : public DataObject\n{\n    SCCOLROW    nStart;\n    SCSIZE      nSize;\n    BOOL        bHidden;\n    BOOL        bVisible;\n\npublic:\n                            ScOutlineEntry( SCCOLROW nNewStart, SCCOLROW nNewSize,\n                                                BOOL bNewHidden = FALSE );\n                            ScOutlineEntry( const ScOutlineEntry& rEntry );\n                            ScOutlineEntry( SvStream& rStream, ScMultipleReadHeader& rHdr );\n\n    void                    Store( SvStream& rStream, ScMultipleWriteHeader& rHdr );\n\n    virtual DataObject*     Clone() const;\n\n    SCCOLROW                GetStart() const    { return nStart; }\n    SCSIZE                  GetSize() const     { return nSize; }\n    SCCOLROW                GetEnd() const      { return nStart+nSize-1; }\n    BOOL                    IsHidden() const    { return bHidden; }             \/\/ Gruppe versteckt\n    BOOL                    IsVisible() const   { return bVisible; }            \/\/ Control sichtbar?\n\n    void                    Move( SCsCOLROW nDelta );\n    void                    SetSize( SCSIZE nNewSize );\n    void                    SetPosSize( SCCOLROW nNewPos, SCSIZE nNewSize );\n    void                    SetHidden( BOOL bNewHidden );\n    void                    SetVisible( BOOL bNewVisible );\n};\n\n\nclass ScOutlineCollection : public SortedCollection\n{\npublic:\n                            ScOutlineCollection();\n\n    virtual short           Compare(DataObject* pKey1, DataObject* pKey2) const;\n\n    USHORT                  FindStart( SCCOLROW nMinStart );\n};\n\n\nclass ScOutlineArray\n{\nfriend class ScSubOutlineIterator;\n\nprivate:\n    USHORT                  nDepth;\n    ScOutlineCollection     aCollections[SC_OL_MAXDEPTH];\n\n    BOOL                    DecDepth();\n    void                    FindEntry( SCCOLROW nSearchPos, USHORT& rFindLevel, USHORT& rFindIndex,\n                                        USHORT nMaxLevel = SC_OL_MAXDEPTH );\n    void                    RemoveSub( SCCOLROW nStartPos, SCCOLROW nEndPos, USHORT nLevel );\n    void                    PromoteSub( SCCOLROW nStartPos, SCCOLROW nEndPos, USHORT nStartLevel );\n\npublic:\n                            ScOutlineArray();\n                            ScOutlineArray( const ScOutlineArray& rArray );\n\n    USHORT                  GetDepth() const         { return nDepth; }\n\n    BOOL                    FindTouchedLevel( SCCOLROW nBlockStart, SCCOLROW nBlockEnd,\n                                                USHORT& rFindLevel ) const;\n\n    BOOL                    Insert( SCCOLROW nStartPos, SCCOLROW nEndPos, BOOL& rSizeChanged,\n                                    BOOL bHidden = FALSE, BOOL bVisible = TRUE );\n    BOOL                    Remove( SCCOLROW nBlockStart, SCCOLROW nBlockEnd, BOOL& rSizeChanged );\n\n    ScOutlineEntry*         GetEntry( USHORT nLevel, USHORT nIndex ) const;\n    USHORT                  GetCount( USHORT nLevel ) const;\n    ScOutlineEntry*         GetEntryByPos( USHORT nLevel, SCCOLROW nPos ) const;\n\n    BOOL                    GetEntryIndex( USHORT nLevel, SCCOLROW nPos, USHORT& rnIndex ) const;\n    BOOL                    GetEntryIndexInRange(\n                                USHORT nLevel, SCCOLROW nBlockStart, SCCOLROW nBlockEnd,\n                                USHORT& rnIndex ) const;\n\n    void                    SetVisibleBelow( USHORT nLevel, USHORT nEntry, BOOL bValue,\n                                                BOOL bSkipHidden = FALSE );\n\n    void                    GetRange( SCCOLROW& rStart, SCCOLROW& rEnd ) const;\n    void                    ExtendBlock( USHORT nLevel, SCCOLROW& rBlkStart, SCCOLROW& rBlkEnd );\n\n    BOOL                    TestInsertSpace( SCSIZE nSize, SCCOLROW nMaxVal ) const;\n    void                    InsertSpace( SCCOLROW nStartPos, SCSIZE nSize );\n    BOOL                    DeleteSpace( SCCOLROW nStartPos, SCSIZE nSize );\n\n    BOOL                    ManualAction( SCCOLROW nStartPos, SCCOLROW nEndPos,\n                                BOOL bShow,\n                                const ScBitMaskCompressedArray< SCCOLROW, BYTE>& rHiddenFlags );\n\n    void                    Load( SvStream& rStream );\n    void                    Store( SvStream& rStream );\n\n    void                    RemoveAll();\n};\n\n\nclass ScOutlineTable\n{\nprivate:\n    ScOutlineArray          aColOutline;\n    ScOutlineArray          aRowOutline;\n\npublic:\n                            ScOutlineTable();\n                            ScOutlineTable( const ScOutlineTable& rOutline );\n\n    const ScOutlineArray*   GetColArray() const     { return &aColOutline; }\n    ScOutlineArray*         GetColArray()           { return &aColOutline; }\n    const ScOutlineArray*   GetRowArray() const     { return &aRowOutline; }\n    ScOutlineArray*         GetRowArray()           { return &aRowOutline; }\n\n    BOOL                    TestInsertCol( SCSIZE nSize );\n    void                    InsertCol( SCCOL nStartCol, SCSIZE nSize );\n    BOOL                    DeleteCol( SCCOL nStartCol, SCSIZE nSize ); \/\/ TRUE: Undo nur ueber Original\n    BOOL                    TestInsertRow( SCSIZE nSize );\n    void                    InsertRow( SCROW nStartRow, SCSIZE nSize );\n    BOOL                    DeleteRow( SCROW nStartRow, SCSIZE nSize );\n\n    void                    Load( SvStream& rStream );\n    void                    Store( SvStream& rStream );\n};\n\n\nclass ScSubOutlineIterator\n{\nprivate:\n    ScOutlineArray*         pArray;\n    SCCOLROW                nStart;\n    SCCOLROW                nEnd;\n    USHORT                  nSubLevel;\n    USHORT                  nSubEntry;\n    USHORT                  nCount;\n    USHORT                  nDepth;\n\npublic:\n                            ScSubOutlineIterator( ScOutlineArray* pOutlineArray );\n                            ScSubOutlineIterator( ScOutlineArray* pOutlineArray,\n                                                    USHORT nLevel, USHORT nEntry );\n    ScOutlineEntry*         GetNext();\n    USHORT                  LastLevel() const;\n    USHORT                  LastEntry() const;\n    void                    DeleteLast();\n};\n\n#endif\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: rangeseq.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 17:50: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_RANGESEQ_HXX\n#define SC_RANGESEQ_HXX\n\n#ifndef _SOLAR_H\n#include <tools\/solar.h>\n#endif\n\n#ifndef _COM_SUN_STAR_UNO_ANY_H_\n#include <com\/sun\/star\/uno\/Any.h>\n#endif\n\nclass SvNumberFormatter;\nclass ScDocument;\nclass ScRange;\nclass ScMatrix;\n\nclass ScRangeToSequence\n{\npublic:\n    static BOOL FillLongArray( com::sun::star::uno::Any& rAny,\n                                ScDocument* pDoc, const ScRange& rRange );\n    static BOOL FillLongArray( com::sun::star::uno::Any& rAny,\n                                const ScMatrix* pMatrix );\n    static BOOL FillDoubleArray( com::sun::star::uno::Any& rAny,\n                                ScDocument* pDoc, const ScRange& rRange );\n    static BOOL FillDoubleArray( com::sun::star::uno::Any& rAny,\n                                const ScMatrix* pMatrix );\n    static BOOL FillStringArray( com::sun::star::uno::Any& rAny,\n                                ScDocument* pDoc, const ScRange& rRange );\n    static BOOL FillStringArray( com::sun::star::uno::Any& rAny,\n                                const ScMatrix* pMatrix, SvNumberFormatter* pFormatter );\n    static BOOL FillMixedArray( com::sun::star::uno::Any& rAny,\n                                ScDocument* pDoc, const ScRange& rRange,\n                                BOOL bAllowNV = FALSE );\n    static BOOL FillMixedArray( com::sun::star::uno::Any& rAny,\n                                const ScMatrix* pMatrix );\n};\n\n\nclass ScByteSequenceToString\n{\npublic:\n    \/\/  rAny must contain Sequence<sal_Int8>,\n    \/\/  may or may not contain 0-bytes at the end\n    static BOOL GetString( String& rString, const com::sun::star::uno::Any& rAny,\n                            sal_uInt16 nEncoding );\n};\n\n#endif\n\n<commit_msg>INTEGRATION: CWS xmlfilter02 (1.4.402); FILE MERGED 2007\/08\/30 09:24:13 er 1.4.402.1: #i75682# generalize uno::Sequence to ScMatrix conversion<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: rangeseq.hxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: obo $ $Date: 2008-01-10 13:09:27 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n#ifndef SC_RANGESEQ_HXX\n#define SC_RANGESEQ_HXX\n\n#ifndef _SOLAR_H\n#include <tools\/solar.h>\n#endif\n\n#ifndef _COM_SUN_STAR_UNO_ANY_H_\n#include <com\/sun\/star\/uno\/Any.h>\n#endif\n\n#ifndef SC_MATRIX_HXX\n#include \"scmatrix.hxx\"\n#endif\n\nclass SvNumberFormatter;\nclass ScDocument;\nclass ScRange;\n\nclass ScRangeToSequence\n{\npublic:\n    static BOOL FillLongArray( com::sun::star::uno::Any& rAny,\n                                ScDocument* pDoc, const ScRange& rRange );\n    static BOOL FillLongArray( com::sun::star::uno::Any& rAny,\n                                const ScMatrix* pMatrix );\n    static BOOL FillDoubleArray( com::sun::star::uno::Any& rAny,\n                                ScDocument* pDoc, const ScRange& rRange );\n    static BOOL FillDoubleArray( com::sun::star::uno::Any& rAny,\n                                const ScMatrix* pMatrix );\n    static BOOL FillStringArray( com::sun::star::uno::Any& rAny,\n                                ScDocument* pDoc, const ScRange& rRange );\n    static BOOL FillStringArray( com::sun::star::uno::Any& rAny,\n                                const ScMatrix* pMatrix, SvNumberFormatter* pFormatter );\n    static BOOL FillMixedArray( com::sun::star::uno::Any& rAny,\n                                ScDocument* pDoc, const ScRange& rRange,\n                                BOOL bAllowNV = FALSE );\n\n    \/** @param bDataTypes\n            Additionally to the differentiation between string and double allow\n            differentiation between other types such as as boolean. Needed for\n            implementation of XFormulaParser. If <FALSE\/>, boolean values are\n            treated as ordinary double values 1 (true) and 0 (false).\n     *\/\n    static BOOL FillMixedArray( com::sun::star::uno::Any& rAny,\n                                const ScMatrix* pMatrix, bool bDataTypes = false );\n};\n\n\nclass ScApiTypeConversion\n{\npublic:\n\n    \/** Convert an uno::Any to double if possible, including integer types.\n        @param o_fVal\n            Out: the double value on successful conversion.\n        @param o_eClass\n            Out: the uno::TypeClass of rAny.\n        @returns <TRUE\/> if successfully converted.\n     *\/\n    static  bool        ConvertAnyToDouble(\n                            double & o_fVal,\n                            com::sun::star::uno::TypeClass & o_eClass,\n                            const com::sun::star::uno::Any & rAny );\n\n};\n\n\nclass ScSequenceToMatrix\n{\npublic:\n\n    \/** Convert a sequence of mixed elements to ScMatrix.\n\n        Precondition: rAny.getValueType().equals( getCppuType( (uno::Sequence< uno::Sequence< uno::Any > > *)0))\n\n        @returns a new'd ScMatrix as ScMatrixRef, NULL if rAny couldn't be read\n        as type Sequence<Sequence<Any>>\n     *\/\n    static  ScMatrixRef CreateMixedMatrix( const com::sun::star::uno::Any & rAny );\n\n};\n\n\nclass ScByteSequenceToString\n{\npublic:\n    \/\/  rAny must contain Sequence<sal_Int8>,\n    \/\/  may or may not contain 0-bytes at the end\n    static BOOL GetString( String& rString, const com::sun::star::uno::Any& rAny,\n                            sal_uInt16 nEncoding );\n};\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: shapeuno.hxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: nn $ $Date: 2002-11-27 18:21:48 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef SC_SHAPEUNO_HXX\n#define SC_SHAPEUNO_HXX\n\n#ifndef _COM_SUN_STAR_BEANS_XPROPERTYSTATE_HPP_\n#include <com\/sun\/star\/beans\/XPropertyState.hpp>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_XPROPERTYSET_HPP_\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#endif\n#ifndef _COM_SUN_STAR_TEXT_XTEXTCONTENT_HPP_\n#include <com\/sun\/star\/text\/XTextContent.hpp>\n#endif\n#ifndef _COM_SUN_STAR_TEXT_XTEXT_HPP_\n#include <com\/sun\/star\/text\/XText.hpp>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XTYPEPROVIDER_HPP_\n#include <com\/sun\/star\/lang\/XTypeProvider.hpp>\n#endif\n\n#ifndef _CPPUHELPER_WEAK_HXX_\n#include <cppuhelper\/weak.hxx>\n#endif\n\nnamespace com { namespace sun { namespace star {\n    namespace uno {\n        class XAggregation;\n    }\n    namespace drawing {\n        class XShape;\n    }\n}}}\n\nclass SdrObject;\nstruct SvEventDescription;\n\n\/\/------------------------------------------------------------------------\n\n\/\/  object which aggregates all svx shape objects,\n\/\/  to add own properties\n\nclass ScShapeObj : public ::cppu::OWeakObject,\n                    public ::com::sun::star::beans::XPropertySet,\n                    public ::com::sun::star::beans::XPropertyState,\n                    public ::com::sun::star::text::XTextContent,\n                    public ::com::sun::star::text::XText,\n                    public ::com::sun::star::lang::XTypeProvider\n{\nprivate:\n    ::com::sun::star::uno::Reference< ::com::sun::star::uno::XAggregation > mxShapeAgg;\n    com::sun::star::uno::Sequence< sal_Int8 >*                              pImplementationId;\n    BOOL                                                                    bIsTextShape;\n\n    SdrObject* GetSdrObject() const throw();\n\npublic:\n    static const SvEventDescription* GetSupportedMacroItems();\n\n                            \/\/ ctor modifies xShape parameter\n                            ScShapeObj( ::com::sun::star::uno::Reference<\n                                            ::com::sun::star::drawing::XShape > & xShape );\n    virtual                 ~ScShapeObj();\n\n                            \/\/ XInterface\n    virtual ::com::sun::star::uno::Any SAL_CALL queryInterface(\n                                const ::com::sun::star::uno::Type & rType )\n                                    throw(::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL   acquire() throw();\n    virtual void SAL_CALL   release() throw();\n\n                            \/\/ XPropertySet\n    virtual ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySetInfo >\n                            SAL_CALL getPropertySetInfo()\n                                throw(::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL   setPropertyValue( const ::rtl::OUString& aPropertyName,\n                                    const ::com::sun::star::uno::Any& aValue )\n                                throw(::com::sun::star::beans::UnknownPropertyException,\n                                    ::com::sun::star::beans::PropertyVetoException,\n                                    ::com::sun::star::lang::IllegalArgumentException,\n                                    ::com::sun::star::lang::WrappedTargetException,\n                                    ::com::sun::star::uno::RuntimeException);\n    virtual ::com::sun::star::uno::Any SAL_CALL getPropertyValue(\n                                    const ::rtl::OUString& PropertyName )\n                                throw(::com::sun::star::beans::UnknownPropertyException,\n                                    ::com::sun::star::lang::WrappedTargetException,\n                                    ::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL   addPropertyChangeListener( const ::rtl::OUString& aPropertyName,\n                                    const ::com::sun::star::uno::Reference<\n                                        ::com::sun::star::beans::XPropertyChangeListener >& xListener )\n                                throw(::com::sun::star::beans::UnknownPropertyException,\n                                    ::com::sun::star::lang::WrappedTargetException,\n                                    ::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL   removePropertyChangeListener( const ::rtl::OUString& aPropertyName,\n                                    const ::com::sun::star::uno::Reference<\n                                        ::com::sun::star::beans::XPropertyChangeListener >& aListener )\n                                throw(::com::sun::star::beans::UnknownPropertyException,\n                                    ::com::sun::star::lang::WrappedTargetException,\n                                    ::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL   addVetoableChangeListener( const ::rtl::OUString& PropertyName,\n                                    const ::com::sun::star::uno::Reference<\n                                        ::com::sun::star::beans::XVetoableChangeListener >& aListener )\n                                throw(::com::sun::star::beans::UnknownPropertyException,\n                                    ::com::sun::star::lang::WrappedTargetException,\n                                    ::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL   removeVetoableChangeListener( const ::rtl::OUString& PropertyName,\n                                    const ::com::sun::star::uno::Reference<\n                                        ::com::sun::star::beans::XVetoableChangeListener >& aListener )\n                                throw(::com::sun::star::beans::UnknownPropertyException,\n                                    ::com::sun::star::lang::WrappedTargetException,\n                                    ::com::sun::star::uno::RuntimeException);\n\n                            \/\/ XPropertyState\n    virtual ::com::sun::star::beans::PropertyState SAL_CALL getPropertyState(\n                                    const ::rtl::OUString& PropertyName )\n                                throw(::com::sun::star::beans::UnknownPropertyException,\n                                    ::com::sun::star::uno::RuntimeException);\n    virtual ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyState > SAL_CALL\n                            getPropertyStates( const ::com::sun::star::uno::Sequence<\n                                        ::rtl::OUString >& aPropertyName )\n                                throw(::com::sun::star::beans::UnknownPropertyException,\n                                    ::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL   setPropertyToDefault( const ::rtl::OUString& PropertyName )\n                                throw(::com::sun::star::beans::UnknownPropertyException,\n                                    ::com::sun::star::uno::RuntimeException);\n    virtual ::com::sun::star::uno::Any SAL_CALL getPropertyDefault(\n                                    const ::rtl::OUString& aPropertyName )\n                                throw(::com::sun::star::beans::UnknownPropertyException,\n                                    ::com::sun::star::lang::WrappedTargetException,\n                                    ::com::sun::star::uno::RuntimeException);\n\n                            \/\/ XTextContent\n    virtual void SAL_CALL   attach(const ::com::sun::star::uno::Reference<\n                                    ::com::sun::star::text::XTextRange > & xTextRange)\n                                throw( ::com::sun::star::lang::IllegalArgumentException,\n                                        ::com::sun::star::uno::RuntimeException );\n    virtual ::com::sun::star::uno::Reference< ::com::sun::star::text::XTextRange > SAL_CALL\n                            getAnchor(void) throw( ::com::sun::star::uno::RuntimeException );\n\n                            \/\/ XComponent\n    virtual void SAL_CALL   dispose(void) throw( ::com::sun::star::uno::RuntimeException );\n    virtual void SAL_CALL   addEventListener(const ::com::sun::star::uno::Reference<\n                                    ::com::sun::star::lang::XEventListener > & aListener)\n                                throw( ::com::sun::star::uno::RuntimeException );\n    virtual void SAL_CALL   removeEventListener(const ::com::sun::star::uno::Reference<\n                                    ::com::sun::star::lang::XEventListener > & aListener)\n                                throw( ::com::sun::star::uno::RuntimeException );\n\n                            \/\/ XText\n    virtual void SAL_CALL   insertTextContent( const ::com::sun::star::uno::Reference<\n                                    ::com::sun::star::text::XTextRange >& xRange,\n                                const ::com::sun::star::uno::Reference<\n                                    ::com::sun::star::text::XTextContent >& xContent,\n                                sal_Bool bAbsorb )\n                                    throw(::com::sun::star::lang::IllegalArgumentException,\n                                    ::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL   removeTextContent( const ::com::sun::star::uno::Reference<\n                                ::com::sun::star::text::XTextContent >& xContent )\n                                    throw(::com::sun::star::container::NoSuchElementException,\n                                            ::com::sun::star::uno::RuntimeException);\n\n                            \/\/ XSimpleText\n    virtual ::com::sun::star::uno::Reference< ::com::sun::star::text::XTextCursor > SAL_CALL\n                            createTextCursor() throw(::com::sun::star::uno::RuntimeException);\n    virtual ::com::sun::star::uno::Reference< ::com::sun::star::text::XTextCursor > SAL_CALL\n                            createTextCursorByRange( const ::com::sun::star::uno::Reference<\n                                        ::com::sun::star::text::XTextRange >& aTextPosition )\n                                    throw(::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL   insertString( const ::com::sun::star::uno::Reference<\n                                        ::com::sun::star::text::XTextRange >& xRange,\n                                        const ::rtl::OUString& aString, sal_Bool bAbsorb )\n                                    throw(::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL   insertControlCharacter( const ::com::sun::star::uno::Reference<\n                                        ::com::sun::star::text::XTextRange >& xRange,\n                                        sal_Int16 nControlCharacter, sal_Bool bAbsorb )\n                                    throw(::com::sun::star::lang::IllegalArgumentException,\n                                        ::com::sun::star::uno::RuntimeException);\n\n                            \/\/ XTextRange\n    virtual ::com::sun::star::uno::Reference< ::com::sun::star::text::XText > SAL_CALL\n                            getText() throw(::com::sun::star::uno::RuntimeException);\n    virtual ::com::sun::star::uno::Reference< ::com::sun::star::text::XTextRange > SAL_CALL\n                            getStart() throw(::com::sun::star::uno::RuntimeException);\n    virtual ::com::sun::star::uno::Reference< ::com::sun::star::text::XTextRange > SAL_CALL\n                            getEnd() throw(::com::sun::star::uno::RuntimeException);\n    virtual ::rtl::OUString SAL_CALL getString() throw(::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL   setString( const ::rtl::OUString& aString )\n                                    throw(::com::sun::star::uno::RuntimeException);\n\n                            \/\/ XTypeProvider\n    virtual ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > SAL_CALL getTypes()\n                                throw(::com::sun::star::uno::RuntimeException);\n    virtual ::com::sun::star::uno::Sequence< sal_Int8 > SAL_CALL getImplementationId()\n                                throw(::com::sun::star::uno::RuntimeException);\n};\n\n#endif\n\n<commit_msg>INTEGRATION: CWS rowlimit (1.6.302); FILE MERGED 2003\/11\/28 19:47:27 er 1.6.302.1: #i1967# move ScAddress, ScRange from global.hxx to address.hxx<commit_after>\/*************************************************************************\n *\n *  $RCSfile: shapeuno.hxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: obo $ $Date: 2004-06-04 10:15: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 SC_SHAPEUNO_HXX\n#define SC_SHAPEUNO_HXX\n\n#ifndef _SOLAR_H\n#include <tools\/solar.h>\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_XPROPERTYSTATE_HPP_\n#include <com\/sun\/star\/beans\/XPropertyState.hpp>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_XPROPERTYSET_HPP_\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#endif\n#ifndef _COM_SUN_STAR_TEXT_XTEXTCONTENT_HPP_\n#include <com\/sun\/star\/text\/XTextContent.hpp>\n#endif\n#ifndef _COM_SUN_STAR_TEXT_XTEXT_HPP_\n#include <com\/sun\/star\/text\/XText.hpp>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XTYPEPROVIDER_HPP_\n#include <com\/sun\/star\/lang\/XTypeProvider.hpp>\n#endif\n\n#ifndef _CPPUHELPER_WEAK_HXX_\n#include <cppuhelper\/weak.hxx>\n#endif\n\nnamespace com { namespace sun { namespace star {\n    namespace uno {\n        class XAggregation;\n    }\n    namespace drawing {\n        class XShape;\n    }\n}}}\n\nclass SdrObject;\nstruct SvEventDescription;\n\n\/\/------------------------------------------------------------------------\n\n\/\/  object which aggregates all svx shape objects,\n\/\/  to add own properties\n\nclass ScShapeObj : public ::cppu::OWeakObject,\n                    public ::com::sun::star::beans::XPropertySet,\n                    public ::com::sun::star::beans::XPropertyState,\n                    public ::com::sun::star::text::XTextContent,\n                    public ::com::sun::star::text::XText,\n                    public ::com::sun::star::lang::XTypeProvider\n{\nprivate:\n    ::com::sun::star::uno::Reference< ::com::sun::star::uno::XAggregation > mxShapeAgg;\n    com::sun::star::uno::Sequence< sal_Int8 >*                              pImplementationId;\n    BOOL                                                                    bIsTextShape;\n\n    SdrObject* GetSdrObject() const throw();\n\npublic:\n    static const SvEventDescription* GetSupportedMacroItems();\n\n                            \/\/ ctor modifies xShape parameter\n                            ScShapeObj( ::com::sun::star::uno::Reference<\n                                            ::com::sun::star::drawing::XShape > & xShape );\n    virtual                 ~ScShapeObj();\n\n                            \/\/ XInterface\n    virtual ::com::sun::star::uno::Any SAL_CALL queryInterface(\n                                const ::com::sun::star::uno::Type & rType )\n                                    throw(::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL   acquire() throw();\n    virtual void SAL_CALL   release() throw();\n\n                            \/\/ XPropertySet\n    virtual ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySetInfo >\n                            SAL_CALL getPropertySetInfo()\n                                throw(::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL   setPropertyValue( const ::rtl::OUString& aPropertyName,\n                                    const ::com::sun::star::uno::Any& aValue )\n                                throw(::com::sun::star::beans::UnknownPropertyException,\n                                    ::com::sun::star::beans::PropertyVetoException,\n                                    ::com::sun::star::lang::IllegalArgumentException,\n                                    ::com::sun::star::lang::WrappedTargetException,\n                                    ::com::sun::star::uno::RuntimeException);\n    virtual ::com::sun::star::uno::Any SAL_CALL getPropertyValue(\n                                    const ::rtl::OUString& PropertyName )\n                                throw(::com::sun::star::beans::UnknownPropertyException,\n                                    ::com::sun::star::lang::WrappedTargetException,\n                                    ::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL   addPropertyChangeListener( const ::rtl::OUString& aPropertyName,\n                                    const ::com::sun::star::uno::Reference<\n                                        ::com::sun::star::beans::XPropertyChangeListener >& xListener )\n                                throw(::com::sun::star::beans::UnknownPropertyException,\n                                    ::com::sun::star::lang::WrappedTargetException,\n                                    ::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL   removePropertyChangeListener( const ::rtl::OUString& aPropertyName,\n                                    const ::com::sun::star::uno::Reference<\n                                        ::com::sun::star::beans::XPropertyChangeListener >& aListener )\n                                throw(::com::sun::star::beans::UnknownPropertyException,\n                                    ::com::sun::star::lang::WrappedTargetException,\n                                    ::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL   addVetoableChangeListener( const ::rtl::OUString& PropertyName,\n                                    const ::com::sun::star::uno::Reference<\n                                        ::com::sun::star::beans::XVetoableChangeListener >& aListener )\n                                throw(::com::sun::star::beans::UnknownPropertyException,\n                                    ::com::sun::star::lang::WrappedTargetException,\n                                    ::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL   removeVetoableChangeListener( const ::rtl::OUString& PropertyName,\n                                    const ::com::sun::star::uno::Reference<\n                                        ::com::sun::star::beans::XVetoableChangeListener >& aListener )\n                                throw(::com::sun::star::beans::UnknownPropertyException,\n                                    ::com::sun::star::lang::WrappedTargetException,\n                                    ::com::sun::star::uno::RuntimeException);\n\n                            \/\/ XPropertyState\n    virtual ::com::sun::star::beans::PropertyState SAL_CALL getPropertyState(\n                                    const ::rtl::OUString& PropertyName )\n                                throw(::com::sun::star::beans::UnknownPropertyException,\n                                    ::com::sun::star::uno::RuntimeException);\n    virtual ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyState > SAL_CALL\n                            getPropertyStates( const ::com::sun::star::uno::Sequence<\n                                        ::rtl::OUString >& aPropertyName )\n                                throw(::com::sun::star::beans::UnknownPropertyException,\n                                    ::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL   setPropertyToDefault( const ::rtl::OUString& PropertyName )\n                                throw(::com::sun::star::beans::UnknownPropertyException,\n                                    ::com::sun::star::uno::RuntimeException);\n    virtual ::com::sun::star::uno::Any SAL_CALL getPropertyDefault(\n                                    const ::rtl::OUString& aPropertyName )\n                                throw(::com::sun::star::beans::UnknownPropertyException,\n                                    ::com::sun::star::lang::WrappedTargetException,\n                                    ::com::sun::star::uno::RuntimeException);\n\n                            \/\/ XTextContent\n    virtual void SAL_CALL   attach(const ::com::sun::star::uno::Reference<\n                                    ::com::sun::star::text::XTextRange > & xTextRange)\n                                throw( ::com::sun::star::lang::IllegalArgumentException,\n                                        ::com::sun::star::uno::RuntimeException );\n    virtual ::com::sun::star::uno::Reference< ::com::sun::star::text::XTextRange > SAL_CALL\n                            getAnchor(void) throw( ::com::sun::star::uno::RuntimeException );\n\n                            \/\/ XComponent\n    virtual void SAL_CALL   dispose(void) throw( ::com::sun::star::uno::RuntimeException );\n    virtual void SAL_CALL   addEventListener(const ::com::sun::star::uno::Reference<\n                                    ::com::sun::star::lang::XEventListener > & aListener)\n                                throw( ::com::sun::star::uno::RuntimeException );\n    virtual void SAL_CALL   removeEventListener(const ::com::sun::star::uno::Reference<\n                                    ::com::sun::star::lang::XEventListener > & aListener)\n                                throw( ::com::sun::star::uno::RuntimeException );\n\n                            \/\/ XText\n    virtual void SAL_CALL   insertTextContent( const ::com::sun::star::uno::Reference<\n                                    ::com::sun::star::text::XTextRange >& xRange,\n                                const ::com::sun::star::uno::Reference<\n                                    ::com::sun::star::text::XTextContent >& xContent,\n                                sal_Bool bAbsorb )\n                                    throw(::com::sun::star::lang::IllegalArgumentException,\n                                    ::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL   removeTextContent( const ::com::sun::star::uno::Reference<\n                                ::com::sun::star::text::XTextContent >& xContent )\n                                    throw(::com::sun::star::container::NoSuchElementException,\n                                            ::com::sun::star::uno::RuntimeException);\n\n                            \/\/ XSimpleText\n    virtual ::com::sun::star::uno::Reference< ::com::sun::star::text::XTextCursor > SAL_CALL\n                            createTextCursor() throw(::com::sun::star::uno::RuntimeException);\n    virtual ::com::sun::star::uno::Reference< ::com::sun::star::text::XTextCursor > SAL_CALL\n                            createTextCursorByRange( const ::com::sun::star::uno::Reference<\n                                        ::com::sun::star::text::XTextRange >& aTextPosition )\n                                    throw(::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL   insertString( const ::com::sun::star::uno::Reference<\n                                        ::com::sun::star::text::XTextRange >& xRange,\n                                        const ::rtl::OUString& aString, sal_Bool bAbsorb )\n                                    throw(::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL   insertControlCharacter( const ::com::sun::star::uno::Reference<\n                                        ::com::sun::star::text::XTextRange >& xRange,\n                                        sal_Int16 nControlCharacter, sal_Bool bAbsorb )\n                                    throw(::com::sun::star::lang::IllegalArgumentException,\n                                        ::com::sun::star::uno::RuntimeException);\n\n                            \/\/ XTextRange\n    virtual ::com::sun::star::uno::Reference< ::com::sun::star::text::XText > SAL_CALL\n                            getText() throw(::com::sun::star::uno::RuntimeException);\n    virtual ::com::sun::star::uno::Reference< ::com::sun::star::text::XTextRange > SAL_CALL\n                            getStart() throw(::com::sun::star::uno::RuntimeException);\n    virtual ::com::sun::star::uno::Reference< ::com::sun::star::text::XTextRange > SAL_CALL\n                            getEnd() throw(::com::sun::star::uno::RuntimeException);\n    virtual ::rtl::OUString SAL_CALL getString() throw(::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL   setString( const ::rtl::OUString& aString )\n                                    throw(::com::sun::star::uno::RuntimeException);\n\n                            \/\/ XTypeProvider\n    virtual ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > SAL_CALL getTypes()\n                                throw(::com::sun::star::uno::RuntimeException);\n    virtual ::com::sun::star::uno::Sequence< sal_Int8 > SAL_CALL getImplementationId()\n                                throw(::com::sun::star::uno::RuntimeException);\n};\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"app.h\"\n#include \"application.h\"\n#include \"connectionsettings.h\"\n#include \"filestream.h\"\n#include \"structs.h\"\n#include \"uuid.h\"\n\n#include <fstream>\n\nnamespace RabidSQL {\n\n\/**\n *\n * Construct the ConnectionSettings class\n *\n * @param parent The parent settings, if applicable\n * @return void\n *\/\nConnectionSettings::ConnectionSettings(ConnectionSettings *parent) :\n    SmartObject(parent)\n{\n    if (parent != nullptr) {\n        set(\"parent\", parent->get(\"uuid\"));\n    } else {\n        remove(\"parent\");\n    }\n}\n\n\/**\n *\n * Returns our parent object. This is just a helper function so we don't have\n * to re-cast outside of the class every time we need to get the parent.\n *\n * @return The parent of these settings\n *\/\nConnectionSettings *ConnectionSettings::getParent()\n{\n    return (ConnectionSettings *) SmartObject::getParent();\n}\n\n\/**\n *\n * Sets the parent ConnectionSettings object\n *\n * @param parent The parent to set to, or nullptr to not set a parent\n * @return void\n *\/\nvoid ConnectionSettings::setParent(ConnectionSettings *parent)\n{\n    SmartObject::setParent(parent);\n\n    if (parent != nullptr) {\n        set(\"parent\", parent->get(\"uuid\"));\n    } else {\n        remove(\"parent\");\n    }\n}\n\n\/**\n *\n * Returns true if the given key is associated with a setting. Else false.\n *\n * @param key The key to check\n * @return True if the given key is associated with a settings\n *\/\nbool ConnectionSettings::contains(std::string key)\n{\n    return settings.find(key) != settings.end();\n}\n\n\/**\n *\n * Gets a setting identified by key. If it doesn't exist, we'll recursively try\n * each parent until we hit the top level. If this happens we'll return null.\n *\n * @param key The (std::string) key to lookup\n * @param bubble true to bubble up to parents if we don't have the given setting\n * @return The result, or nullptr if there was none\n *\/\nVariant ConnectionSettings::get(std::string key, bool bubble)\n{\n    ConnectionSettings *parent;\n\n    \/\/ We've got this key, send it back!\n    if (contains(key)) {\n        return settings[key];\n    }\n\n    \/\/ uuid and name are handled specially. UUID needs to be generated if it\n    \/\/ is missing and name mustn't bubble.\n    if (key == \"uuid\") {\n\n        \/\/ Generate UUID\n        settings[\"uuid\"] = UUID::makeUUID();\n\n        return settings[\"uuid\"];\n    } else if (key == \"name\" or key == \"parent\") {\n\n        \/\/ Name and parent should not climb the tree\n        bubble = false;\n    }\n\n    \/\/ If bubble is true, we need to look for the first parent that has this\n    \/\/ setting set.\n    if (bubble && (parent = (ConnectionSettings*) this->getParent()) != nullptr) {\n        return parent->get(key, true);\n    }\n\n    \/\/ Couldn't find it :(\n    return Variant();\n}\n\n\/**\n *\n * Sets the setting for key to value\n *\n * @param key The key to add or replace\n * @param value The value to set\n * @return void\n *\/\nvoid ConnectionSettings::set(std::string key, const Variant value)\n{\n    settings[key] = value;\n}\n\n\/**\n *\n * Removes a setting identified by key\n *\n * @param key The key to remove\n * @return void\n *\/\nvoid ConnectionSettings::remove(std::string key)\n{\n    Settings::iterator it = settings.find(key);\n    if (it != settings.end()) {\n\n        \/\/ Remove from map\n        settings.erase(it);\n    }\n}\n\n\/**\n *\n * Loads all connection settings from a configuration file formatted as format\n *\n * @param format The format of the file\n * @param filename The filename to load\n * @return An array of connection settings pointers\n *\/\nstd::vector<ConnectionSettings *> ConnectionSettings::load(\n        FileFormat::format format, std::string filename)\n{\n    std::vector<ConnectionSettings *> connectionList;\n    ConnectionSettings *connectionSettings;\n    FileStream *stream;\n    Variant data;\n\n    switch (format) {\n    case FileFormat::BINARY:\n\n        stream = new BinaryStream();\n        break;\n    case FileFormat::JSON:\n\n        stream = new JsonStream();\n        break;\n    }\n\n    \/\/ Open the file\n    if (!stream->open(filename, std::ios::in)) {\n\n        \/\/ Failed to open file\n        return connectionList;\n    }\n\n    \/\/ Load stream\n    *stream >> data;\n\n    if (data.getType() == Variant::VARIANTVECTOR) {\n\n        auto connections = data.toVariantVector();\n\n        for (auto it = connections.begin(); it != connections.end(); ++it) {\n\n            if (it->getType() == Variant::VARIANTMAP) {\n                \/\/ Initialize settings\n                connectionSettings = new ConnectionSettings();\n\n                \/\/ Load from map\n                *connectionSettings << it->toVariantMap();\n\n                \/\/ Add to collection\n                connectionList.push_back(connectionSettings);\n\n                \/\/ Reparent the children and add to the connectionList\n                \/\/ connection\n                reparentChildren(connectionList, connectionSettings);\n            }\n        }\n    }\n\n    \/\/ Close stream\n    stream->close();\n\n    \/\/ Free memory\n    delete stream;\n\n    if (connectionList.size() == 0) {\n\n        \/\/ Add default group\n        connectionSettings = new ConnectionSettings();\n        connectionSettings->set(\"name\", \"Default\");\n        connectionSettings->set(\"type\", MYSQL);\n        connectionList.push_back(connectionSettings);\n    }\n\n    return connectionList;\n}\n\n\/**\n *\n * Recursively finds children in the connection list and re-parents them\n *\n * @return void\n *\/\nvoid ConnectionSettings::reparentChildren(\n        std::vector<ConnectionSettings *> &connectionList,\n        ConnectionSettings *currentSettings)\n{\n    if (!currentSettings->contains(\"children\")) {\n\n        \/\/ This connection has no children. Look no further.\n        return;\n    }\n\n    \/\/ Get children for the current connection settings\n    auto children = currentSettings->get(\"children\").toVariantVector();\n\n    \/\/ Iterate collection\n    for (auto it = children.begin(); it != children.end(); ++it) {\n\n        \/\/ Initialize settings\n        auto connectionSettings = new ConnectionSettings();\n\n        \/\/ Load from map\n        *connectionSettings << it->toVariantMap();\n\n        \/\/ Set the parent for this connection to the correct parent\n        connectionSettings->setParent(currentSettings);\n\n        \/\/ Add to collection\n        connectionList.push_back(connectionSettings);\n\n        \/\/ Extract children\n        reparentChildren(connectionList, connectionSettings);\n    }\n}\n\n\/**\n *\n * Saves connection settings given an array of settings. This also destroys\n * their pointers if destroy is true\n *\n * @param settings An array of connection settings\n * @param format The file format to use\n * @param filename The filename to save to\n * @return void\n *\/\nvoid ConnectionSettings::save(\n        std::vector<ConnectionSettings *> &settings, FileFormat::format format,\n        std::string filename)\n{\n    VariantVector connections;\n    FileStream *stream;\n\n    for (auto it = settings.cbegin(); it != settings.cend(); ++it) {\n\n        auto connection = (*it);\n\n        if (connection->getParent() == nullptr) {\n\n            \/\/ Add to collection\n            connections.push_back(connection->toVariantMap());\n        }\n    }\n\n    switch (format) {\n        case FileFormat::BINARY:\n\n            stream = new BinaryStream();\n            break;\n        case FileFormat::JSON:\n\n            stream = new JsonStream();\n    }\n\n    \/\/ Open stream\n    stream->open(filename, std::ios::out);\n\n    \/\/ Save connections\n    *stream << connections;\n\n    \/\/ Close stream\n    stream->close();\n\n    \/\/ Free memory\n    delete stream;\n}\n\nVariantMap ConnectionSettings::toVariantMap()\n{\n    VariantMap map;\n\n    \/\/ Ensure UUID is generated already in the event this is a new\n    \/\/ connection\n    get(\"uuid\");\n\n    for (auto it = settings.begin(); it != settings.end(); ++it) {\n\n        if (it->first == \"parent\") {\n\n            \/\/ Do not store parent\n            continue;\n        }\n\n        \/\/ Add to variant map\n        map[it->first] = it->second;\n    }\n\n    \/\/ Get children\n    auto children = getChildren(this);\n\n    if (children.size() > 0) {\n\n        \/\/ Add children\n        map[\"children\"] = children;\n    }\n\n    return map;\n}\n\nVariantVector ConnectionSettings::getChildren(ConnectionSettings *parent)\n{\n    VariantVector vector;\n\n    \/\/ Get children\n    auto children = SmartObject::getChildren();\n\n    for (auto it = children.begin(); it != children.end(); ++it) {\n\n        auto child = static_cast<ConnectionSettings *>(*it);\n\n        \/\/ Add to collection\n        vector.push_back(child->toVariantMap());\n    }\n\n    return vector;\n}\n\nvoid ConnectionSettings::operator<<(const VariantMap &value)\n{\n    for (auto it = value.begin(); it != value.end(); ++it) {\n        std::string key = it->first;\n        Variant value = it->second;\n\n        \/\/ Set the key-value pair\n        set(key, value);\n    }\n}\n\n\/**\n *\n * Gets the type of settings\n *\n * @return type The type of connection these settings belong to\n *\/\nConnectionSettings::type ConnectionSettings::getType()\n{\n    return static_cast<type>(get(\"type\").toUInt());\n}\n\n\/**\n *\n * Destructor for the class\n *\/\nConnectionSettings::~ConnectionSettings()\n{\n}\n\n} \/\/ namespace RabidSQL\n<commit_msg>Remove children vector from connection settings after decoding it<commit_after>#include \"app.h\"\n#include \"application.h\"\n#include \"connectionsettings.h\"\n#include \"filestream.h\"\n#include \"structs.h\"\n#include \"uuid.h\"\n\n#include <fstream>\n\nnamespace RabidSQL {\n\n\/**\n *\n * Construct the ConnectionSettings class\n *\n * @param parent The parent settings, if applicable\n * @return void\n *\/\nConnectionSettings::ConnectionSettings(ConnectionSettings *parent) :\n    SmartObject(parent)\n{\n    if (parent != nullptr) {\n        set(\"parent\", parent->get(\"uuid\"));\n    } else {\n        remove(\"parent\");\n    }\n}\n\n\/**\n *\n * Returns our parent object. This is just a helper function so we don't have\n * to re-cast outside of the class every time we need to get the parent.\n *\n * @return The parent of these settings\n *\/\nConnectionSettings *ConnectionSettings::getParent()\n{\n    return (ConnectionSettings *) SmartObject::getParent();\n}\n\n\/**\n *\n * Sets the parent ConnectionSettings object\n *\n * @param parent The parent to set to, or nullptr to not set a parent\n * @return void\n *\/\nvoid ConnectionSettings::setParent(ConnectionSettings *parent)\n{\n    SmartObject::setParent(parent);\n\n    if (parent != nullptr) {\n        set(\"parent\", parent->get(\"uuid\"));\n    } else {\n        remove(\"parent\");\n    }\n}\n\n\/**\n *\n * Returns true if the given key is associated with a setting. Else false.\n *\n * @param key The key to check\n * @return True if the given key is associated with a settings\n *\/\nbool ConnectionSettings::contains(std::string key)\n{\n    return settings.find(key) != settings.end();\n}\n\n\/**\n *\n * Gets a setting identified by key. If it doesn't exist, we'll recursively try\n * each parent until we hit the top level. If this happens we'll return null.\n *\n * @param key The (std::string) key to lookup\n * @param bubble true to bubble up to parents if we don't have the given setting\n * @return The result, or nullptr if there was none\n *\/\nVariant ConnectionSettings::get(std::string key, bool bubble)\n{\n    ConnectionSettings *parent;\n\n    \/\/ We've got this key, send it back!\n    if (contains(key)) {\n        return settings[key];\n    }\n\n    \/\/ uuid and name are handled specially. UUID needs to be generated if it\n    \/\/ is missing and name mustn't bubble.\n    if (key == \"uuid\") {\n\n        \/\/ Generate UUID\n        settings[\"uuid\"] = UUID::makeUUID();\n\n        return settings[\"uuid\"];\n    } else if (key == \"name\" or key == \"parent\") {\n\n        \/\/ Name and parent should not climb the tree\n        bubble = false;\n    }\n\n    \/\/ If bubble is true, we need to look for the first parent that has this\n    \/\/ setting set.\n    if (bubble && (parent = (ConnectionSettings*) this->getParent()) != nullptr) {\n        return parent->get(key, true);\n    }\n\n    \/\/ Couldn't find it :(\n    return Variant();\n}\n\n\/**\n *\n * Sets the setting for key to value\n *\n * @param key The key to add or replace\n * @param value The value to set\n * @return void\n *\/\nvoid ConnectionSettings::set(std::string key, const Variant value)\n{\n    settings[key] = value;\n}\n\n\/**\n *\n * Removes a setting identified by key\n *\n * @param key The key to remove\n * @return void\n *\/\nvoid ConnectionSettings::remove(std::string key)\n{\n    Settings::iterator it = settings.find(key);\n    if (it != settings.end()) {\n\n        \/\/ Remove from map\n        settings.erase(it);\n    }\n}\n\n\/**\n *\n * Loads all connection settings from a configuration file formatted as format\n *\n * @param format The format of the file\n * @param filename The filename to load\n * @return An array of connection settings pointers\n *\/\nstd::vector<ConnectionSettings *> ConnectionSettings::load(\n        FileFormat::format format, std::string filename)\n{\n    std::vector<ConnectionSettings *> connectionList;\n    ConnectionSettings *connectionSettings;\n    FileStream *stream;\n    Variant data;\n\n    switch (format) {\n    case FileFormat::BINARY:\n\n        stream = new BinaryStream();\n        break;\n    case FileFormat::JSON:\n\n        stream = new JsonStream();\n        break;\n    }\n\n    \/\/ Open the file\n    if (!stream->open(filename, std::ios::in)) {\n\n        \/\/ Failed to open file\n        return connectionList;\n    }\n\n    \/\/ Load stream\n    *stream >> data;\n\n    if (data.getType() == Variant::VARIANTVECTOR) {\n\n        auto connections = data.toVariantVector();\n\n        for (auto it = connections.begin(); it != connections.end(); ++it) {\n\n            if (it->getType() == Variant::VARIANTMAP) {\n                \/\/ Initialize settings\n                connectionSettings = new ConnectionSettings();\n\n                \/\/ Load from map\n                *connectionSettings << it->toVariantMap();\n\n                \/\/ Add to collection\n                connectionList.push_back(connectionSettings);\n\n                \/\/ Reparent the children and add to the connectionList\n                \/\/ connection\n                reparentChildren(connectionList, connectionSettings);\n            }\n        }\n    }\n\n    \/\/ Close stream\n    stream->close();\n\n    \/\/ Free memory\n    delete stream;\n\n    if (connectionList.size() == 0) {\n\n        \/\/ Add default group\n        connectionSettings = new ConnectionSettings();\n        connectionSettings->set(\"name\", \"Default\");\n        connectionSettings->set(\"type\", MYSQL);\n        connectionList.push_back(connectionSettings);\n    }\n\n    return connectionList;\n}\n\n\/**\n *\n * Recursively finds children in the connection list and re-parents them\n *\n * @return void\n *\/\nvoid ConnectionSettings::reparentChildren(\n        std::vector<ConnectionSettings *> &connectionList,\n        ConnectionSettings *currentSettings)\n{\n    if (!currentSettings->contains(\"children\")) {\n\n        \/\/ This connection has no children. Look no further.\n        return;\n    }\n\n    \/\/ Get children for the current connection settings\n    auto children = currentSettings->get(\"children\").toVariantVector();\n\n    \/\/ Remove children vector\n    currentSettings->remove(\"children\");\n\n    \/\/ Iterate collection\n    for (auto it = children.begin(); it != children.end(); ++it) {\n\n        \/\/ Initialize settings\n        auto connectionSettings = new ConnectionSettings();\n\n        \/\/ Load from map\n        *connectionSettings << it->toVariantMap();\n\n        \/\/ Set the parent for this connection to the correct parent\n        connectionSettings->setParent(currentSettings);\n\n        \/\/ Add to collection\n        connectionList.push_back(connectionSettings);\n\n        \/\/ Extract children\n        reparentChildren(connectionList, connectionSettings);\n    }\n}\n\n\/**\n *\n * Saves connection settings given an array of settings. This also destroys\n * their pointers if destroy is true\n *\n * @param settings An array of connection settings\n * @param format The file format to use\n * @param filename The filename to save to\n * @return void\n *\/\nvoid ConnectionSettings::save(\n        std::vector<ConnectionSettings *> &settings, FileFormat::format format,\n        std::string filename)\n{\n    VariantVector connections;\n    FileStream *stream;\n\n    for (auto it = settings.cbegin(); it != settings.cend(); ++it) {\n\n        auto connection = (*it);\n\n        if (connection->getParent() == nullptr) {\n\n            \/\/ Add to collection\n            connections.push_back(connection->toVariantMap());\n        }\n    }\n\n    switch (format) {\n        case FileFormat::BINARY:\n\n            stream = new BinaryStream();\n            break;\n        case FileFormat::JSON:\n\n            stream = new JsonStream();\n    }\n\n    \/\/ Open stream\n    stream->open(filename, std::ios::out);\n\n    \/\/ Save connections\n    *stream << connections;\n\n    \/\/ Close stream\n    stream->close();\n\n    \/\/ Free memory\n    delete stream;\n}\n\nVariantMap ConnectionSettings::toVariantMap()\n{\n    VariantMap map;\n\n    \/\/ Ensure UUID is generated already in the event this is a new\n    \/\/ connection\n    get(\"uuid\");\n\n    for (auto it = settings.begin(); it != settings.end(); ++it) {\n\n        if (it->first == \"parent\") {\n\n            \/\/ Do not store parent\n            continue;\n        }\n\n        \/\/ Add to variant map\n        map[it->first] = it->second;\n    }\n\n    \/\/ Get children\n    auto children = getChildren(this);\n\n    if (children.size() > 0) {\n\n        \/\/ Add children\n        map[\"children\"] = children;\n    }\n\n    return map;\n}\n\nVariantVector ConnectionSettings::getChildren(ConnectionSettings *parent)\n{\n    VariantVector vector;\n\n    \/\/ Get children\n    auto children = SmartObject::getChildren();\n\n    for (auto it = children.begin(); it != children.end(); ++it) {\n\n        auto child = static_cast<ConnectionSettings *>(*it);\n\n        \/\/ Add to collection\n        vector.push_back(child->toVariantMap());\n    }\n\n    return vector;\n}\n\nvoid ConnectionSettings::operator<<(const VariantMap &value)\n{\n    for (auto it = value.begin(); it != value.end(); ++it) {\n        std::string key = it->first;\n        Variant value = it->second;\n\n        \/\/ Set the key-value pair\n        set(key, value);\n    }\n}\n\n\/**\n *\n * Gets the type of settings\n *\n * @return type The type of connection these settings belong to\n *\/\nConnectionSettings::type ConnectionSettings::getType()\n{\n    return static_cast<type>(get(\"type\").toUInt());\n}\n\n\/**\n *\n * Destructor for the class\n *\/\nConnectionSettings::~ConnectionSettings()\n{\n}\n\n} \/\/ namespace RabidSQL\n<|endoftext|>"}
{"text":"<commit_before>\/*\n** Author(s):\n**  - Chris Kilner <ckilner@aldebaran-robotics.com>\n**\n** Copyright (C) 2010 Aldebaran Robotics\n*\/\n\n#include <qi\/messaging\/node.hpp>\n\nnamespace qi {\n  \/\/\/ <summary> Default constructor. <\/summary>\n  Node::Node(): Server(), Client() {}\n  Node::~Node() {}\n\n  \/\/\/ <summary> Full constructor. <\/summary>\n  \/\/\/ <param name=\"name\"> Name of the node. <\/param>\n  \/\/\/ <param name=\"serverAddress\"> The server address. <\/param>\n  \/\/\/ <param name=\"masterAddress\"> The master address. <\/param>\n  Node::Node(\n    const std::string& name,\n    const std::string& serverAddress,\n    const std::string& masterAddress) :\n        Server(name, serverAddress, masterAddress),\n        Client(name, masterAddress) {}\n}\n<commit_msg>remove node cpp doc<commit_after>\/*\n** Author(s):\n**  - Chris Kilner <ckilner@aldebaran-robotics.com>\n**\n** Copyright (C) 2010 Aldebaran Robotics\n*\/\n\n#include <qi\/messaging\/node.hpp>\n\nnamespace qi {\n  Node::Node(): Server(), Client() {}\n\n  Node::~Node() {}\n\n  Node::Node(\n    const std::string& name,\n    const std::string& serverAddress,\n    const std::string& masterAddress) :\n        Server(name, serverAddress, masterAddress),\n        Client(name, masterAddress) {}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright 2007-2015 QReal Research Group, Dmitry Mordvinov\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 \"smartDock.h\"\n\n#include <QtCore\/QTimer>\n#include <QtCore\/QPropertyAnimation>\n#include <QtGui\/QMouseEvent>\n#include <QtWidgets\/QStyle>\n#include <QtWidgets\/QApplication>\n#include <QtWidgets\/QMainWindow>\n#include <QtWidgets\/QVBoxLayout>\n#include <QtWidgets\/QPushButton>\n\n#include <qrutils\/qRealDialog.h>\n\nusing namespace utils;\n\nSmartDock::SmartDock(const QString &objectName, QWidget *innerWidget, QMainWindow *parent)\n\t: mMainWindow(parent ? parent : findMainWindow())\n\t, mInnerWidget(innerWidget)\n\t, mDialog(new QRealDialog(objectName))\n\t, mCurrentMode(Mode::Docked)\n{\n\tsetObjectName(objectName);\n\n\tinitDock();\n\tinitDialog();\n}\n\nSmartDock::~SmartDock()\n{\n\tdelete mDialog;\n}\n\nvoid SmartDock::switchToDocked()\n{\n\tif (mCurrentMode == Mode::Docked) {\n\t\treturn;\n\t}\n\n\tswitchToDockedQuietly();\n\tshow();\n\tcheckCentralWidget();\n\temit dockedChanged(true);\n}\n\nvoid SmartDock::switchToDockedQuietly()\n{\n\tmCurrentMode = Mode::Docked;\n\tmDialog->close();\n\tmDialog->layout()->removeWidget(mInnerWidget);\n\tsetWidget(mInnerWidget);\n\tsetFloating(false);\n}\n\nvoid SmartDock::switchToFloating()\n{\n\tif (mCurrentMode == Mode::Floats) {\n\t\treturn;\n\t}\n\n\tswitchToFloatingQuietly();\n\tmDialog->show();\n\tcheckCentralWidget();\n\temit dockedChanged(false);\n}\n\nvoid SmartDock::switchToFloatingQuietly()\n{\n\tmCurrentMode = Mode::Floats;\n\tsetWidget(nullptr);\n\tclose();\n\tstatic_cast<QVBoxLayout *>(mDialog->layout())->addWidget(mInnerWidget);\n\tmInnerWidget->show();\n}\n\nvoid SmartDock::attachToMainWindow(Qt::DockWidgetArea area)\n{\n\tif (!mMainWindow) {\n\t\treturn;\n\t}\n\n\tmDialog->resumeSerialization();\n\tsetParent(mMainWindow);\n\tmMainWindow->addDockWidget(area, this);\n\tif (mCurrentMode == Mode::Docked) {\n\t\tmCurrentMode = Mode::Floats;\n\t\tswitchToDockedQuietly();\n\t} else {\n\t\tmCurrentMode = Mode::Docked;\n\t\tswitchToFloatingQuietly();\n\t}\n}\n\nvoid SmartDock::detachFromMainWindow()\n{\n\tmDialog->suspendSerialization();\n\tclose();\n\tmDialog->close();\n\tif (mMainWindow) {\n\t\tmMainWindow->removeDockWidget(this);\n\t\tsetParent(nullptr);\n\t}\n}\n\nvoid SmartDock::checkFloating()\n{\n\t\/\/ Mouse button releasing may cause dock animation into some dock area.\n\t\/\/ topLevelChanged() will be emitted only when animation is finished, so\n\t\/\/ we must not change dock state when animation is running.\n\tif (isFloating() && !mDragged && !isAnimating()) {\n\t\tswitchToFloating();\n\t}\n}\n\nvoid SmartDock::checkCentralWidget()\n{\n\tconst bool tabsVisible = isFloating() || !isVisible() || mMainWindow->dockWidgetArea(this) != Qt::TopDockWidgetArea;\n\tfor (QTabWidget * const centralWidget : mMainWindow->centralWidget()->findChildren<QTabWidget *>()) {\n\t\tcentralWidget->setVisible(tabsVisible);\n\t}\n\n\tmMainWindow->centralWidget()->setSizePolicy(QSizePolicy::Preferred\n\t\t\t, tabsVisible ? QSizePolicy::Preferred : QSizePolicy::Maximum);\n}\n\nbool SmartDock::isAnimating()\n{\n\t\/\/ A bit hacky way to know dialog animation state. If user repositions dock\n\tif (!mMainWindow->isAnimated()) {\n\t\treturn false;\n\t}\n\n\tfor (QPropertyAnimation *animation : findChildren<QPropertyAnimation *>()) {\n\t\tif (animation->state() == QAbstractAnimation::Running && animation->propertyName() == \"geometry\") {\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\nQMainWindow *SmartDock::findMainWindow() const\n{\n\tfor (QWidget * const topLevelWidget : QApplication::topLevelWidgets()) {\n\t\tif (QMainWindow * const window = dynamic_cast<QMainWindow *>(topLevelWidget)) {\n\t\t\treturn window;\n\t\t}\n\t}\n\n\treturn nullptr;\n}\n\nbool SmartDock::event(QEvent *event)\n{\n\tswitch (event->type()) {\n\tcase QEvent::MouseButtonPress:\n\tcase QEvent::MouseButtonRelease:\n\t\tif (static_cast<QMouseEvent *>(event)->button() == Qt::LeftButton) {\n\t\t\tmDragged = event->type() == QEvent::MouseButtonPress;\n\t\t\tif (QEvent::MouseButtonRelease == event->type()) {\n\t\t\t\t\/\/ Mouse button releasing may cause dock animation into some dock area.\n\t\t\t\t\/\/ This animation is not started immediately, so checking for it when all handlers worked out.\n\t\t\t\tQTimer::singleShot(0, this, SLOT(checkFloating()));\n\t\t\t}\n\t\t}\n\t\tbreak;\n\tcase QEvent::MouseButtonDblClick:\n\t\tmDragged = false;\n\t\tbreak;\n\tcase QEvent::Show:\n\t\tif (!widget()) {\n\t\t\tclose();\n\t\t}\n\t\tcheckCentralWidget();\n\t\tbreak;\n\tcase QEvent::Hide:\n\t\tcheckCentralWidget();\n\t\tbreak;\n\tdefault:\n\t\tbreak;\n\t}\n\n\treturn QDockWidget::event(event);\n}\n\nvoid SmartDock::initDock()\n{\n\tif (!mMainWindow) {\n\t\treturn;\n\t}\n\n\tsetWindowTitle(mInnerWidget->windowTitle());\n\tsetWidget(mInnerWidget);\n\tsetFeatures(QDockWidget::DockWidgetMovable | QDockWidget::DockWidgetFloatable);\n\tconnect(this, &QDockWidget::topLevelChanged, this, &SmartDock::checkFloating);\n\tconnect(this, &QDockWidget::dockLocationChanged, this, &SmartDock::checkCentralWidget);\n}\n\nvoid SmartDock::initDialog()\n{\n\tmDialog->setWindowTitle(mInnerWidget->windowTitle());\n\tmDialog->setWindowIcon(mInnerWidget->windowIcon());\n\tmDialog->setWindowFlags(mDialog->windowFlags() | Qt::WindowMinMaxButtonsHint);\n\tQVBoxLayout * const layout = new QVBoxLayout;\n\tlayout->setMargin(0);\n\tlayout->setSpacing(0);\n\tlayout->setContentsMargins(0, 0, 0, 0);\n\tmDialog->setLayout(layout);\n\tmDialog->setVisible(false);\n\tconnect(mDialog, &QDialog::finished, [=]() {\n\t\tif (mMainWindow) {\n\t\t\tswitchToDocked();\n\t\t} else {\n\t\t\tmInnerWidget->close();\n\t\t}\n\t});\n\tif (!mMainWindow) {\n\t\tswitchToFloating();\n\t}\n}\n<commit_msg>Fixed checker starter segfault<commit_after>\/* Copyright 2007-2015 QReal Research Group, Dmitry Mordvinov\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 \"smartDock.h\"\n\n#include <QtCore\/QTimer>\n#include <QtCore\/QPropertyAnimation>\n#include <QtGui\/QMouseEvent>\n#include <QtWidgets\/QStyle>\n#include <QtWidgets\/QApplication>\n#include <QtWidgets\/QMainWindow>\n#include <QtWidgets\/QVBoxLayout>\n#include <QtWidgets\/QPushButton>\n\n#include <qrutils\/qRealDialog.h>\n\nusing namespace utils;\n\nSmartDock::SmartDock(const QString &objectName, QWidget *innerWidget, QMainWindow *parent)\n\t: mMainWindow(parent ? parent : findMainWindow())\n\t, mInnerWidget(innerWidget)\n\t, mDialog(new QRealDialog(objectName))\n\t, mCurrentMode(Mode::Docked)\n{\n\tsetObjectName(objectName);\n\n\tinitDock();\n\tinitDialog();\n}\n\nSmartDock::~SmartDock()\n{\n\tdelete mDialog;\n}\n\nvoid SmartDock::switchToDocked()\n{\n\tif (mCurrentMode == Mode::Docked) {\n\t\treturn;\n\t}\n\n\tswitchToDockedQuietly();\n\tshow();\n\tcheckCentralWidget();\n\temit dockedChanged(true);\n}\n\nvoid SmartDock::switchToDockedQuietly()\n{\n\tmCurrentMode = Mode::Docked;\n\tmDialog->close();\n\tmDialog->layout()->removeWidget(mInnerWidget);\n\tsetWidget(mInnerWidget);\n\tsetFloating(false);\n}\n\nvoid SmartDock::switchToFloating()\n{\n\tif (mCurrentMode == Mode::Floats) {\n\t\treturn;\n\t}\n\n\tswitchToFloatingQuietly();\n\tmDialog->show();\n\tcheckCentralWidget();\n\temit dockedChanged(false);\n}\n\nvoid SmartDock::switchToFloatingQuietly()\n{\n\tmCurrentMode = Mode::Floats;\n\tsetWidget(nullptr);\n\tclose();\n\tstatic_cast<QVBoxLayout *>(mDialog->layout())->addWidget(mInnerWidget);\n\tmInnerWidget->show();\n}\n\nvoid SmartDock::attachToMainWindow(Qt::DockWidgetArea area)\n{\n\tif (!mMainWindow) {\n\t\treturn;\n\t}\n\n\tmDialog->resumeSerialization();\n\tsetParent(mMainWindow);\n\tmMainWindow->addDockWidget(area, this);\n\tif (mCurrentMode == Mode::Docked) {\n\t\tmCurrentMode = Mode::Floats;\n\t\tswitchToDockedQuietly();\n\t} else {\n\t\tmCurrentMode = Mode::Docked;\n\t\tswitchToFloatingQuietly();\n\t}\n}\n\nvoid SmartDock::detachFromMainWindow()\n{\n\tmDialog->suspendSerialization();\n\tclose();\n\tmDialog->close();\n\tif (mMainWindow) {\n\t\tmMainWindow->removeDockWidget(this);\n\t\tsetParent(nullptr);\n\t}\n}\n\nvoid SmartDock::checkFloating()\n{\n\t\/\/ Mouse button releasing may cause dock animation into some dock area.\n\t\/\/ topLevelChanged() will be emitted only when animation is finished, so\n\t\/\/ we must not change dock state when animation is running.\n\tif (isFloating() && !mDragged && !isAnimating()) {\n\t\tswitchToFloating();\n\t}\n}\n\nvoid SmartDock::checkCentralWidget()\n{\n\tconst bool tabsVisible = isFloating() || !isVisible() || mMainWindow->dockWidgetArea(this) != Qt::TopDockWidgetArea;\n\tfor (QTabWidget * const centralWidget : mMainWindow->centralWidget()->findChildren<QTabWidget *>()) {\n\t\tcentralWidget->setVisible(tabsVisible);\n\t}\n\n\tmMainWindow->centralWidget()->setSizePolicy(QSizePolicy::Preferred\n\t\t\t, tabsVisible ? QSizePolicy::Preferred : QSizePolicy::Maximum);\n}\n\nbool SmartDock::isAnimating()\n{\n\t\/\/ A bit hacky way to know dialog animation state. If user repositions dock\n\tif (!mMainWindow->isAnimated()) {\n\t\treturn false;\n\t}\n\n\tfor (QPropertyAnimation *animation : findChildren<QPropertyAnimation *>()) {\n\t\tif (animation->state() == QAbstractAnimation::Running && animation->propertyName() == \"geometry\") {\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\nQMainWindow *SmartDock::findMainWindow() const\n{\n\tfor (QWidget * const topLevelWidget : QApplication::topLevelWidgets()) {\n\t\tif (QMainWindow * const window = dynamic_cast<QMainWindow *>(topLevelWidget)) {\n\t\t\treturn window;\n\t\t}\n\t}\n\n\treturn nullptr;\n}\n\nbool SmartDock::event(QEvent *event)\n{\n\tswitch (event->type()) {\n\tcase QEvent::MouseButtonPress:\n\tcase QEvent::MouseButtonRelease:\n\t\tif (static_cast<QMouseEvent *>(event)->button() == Qt::LeftButton) {\n\t\t\tmDragged = event->type() == QEvent::MouseButtonPress;\n\t\t\tif (QEvent::MouseButtonRelease == event->type()) {\n\t\t\t\t\/\/ Mouse button releasing may cause dock animation into some dock area.\n\t\t\t\t\/\/ This animation is not started immediately, so checking for it when all handlers worked out.\n\t\t\t\tQTimer::singleShot(0, this, SLOT(checkFloating()));\n\t\t\t}\n\t\t}\n\t\tbreak;\n\tcase QEvent::MouseButtonDblClick:\n\t\tmDragged = false;\n\t\tbreak;\n\tcase QEvent::Show:\n\t\tif (!widget()) {\n\t\t\tclose();\n\t\t}\n\t\tcheckCentralWidget();\n\t\tbreak;\n\tcase QEvent::Hide:\n\t\tcheckCentralWidget();\n\t\tbreak;\n\tdefault:\n\t\tbreak;\n\t}\n\n\treturn QDockWidget::event(event);\n}\n\nvoid SmartDock::initDock()\n{\n\tif (!mMainWindow) {\n\t\treturn;\n\t}\n\n\tsetWindowTitle(mInnerWidget->windowTitle());\n\tsetWidget(mInnerWidget);\n\tsetFeatures(QDockWidget::DockWidgetMovable | QDockWidget::DockWidgetFloatable);\n\tconnect(this, &QDockWidget::topLevelChanged, this, &SmartDock::checkFloating);\n\tconnect(this, &QDockWidget::dockLocationChanged, this, &SmartDock::checkCentralWidget);\n}\n\nvoid SmartDock::initDialog()\n{\n\tmDialog->setWindowTitle(mInnerWidget->windowTitle());\n\tmDialog->setWindowIcon(mInnerWidget->windowIcon());\n\tmDialog->setWindowFlags(mDialog->windowFlags() | Qt::WindowMinMaxButtonsHint);\n\tQVBoxLayout * const layout = new QVBoxLayout;\n\tlayout->setMargin(0);\n\tlayout->setSpacing(0);\n\tlayout->setContentsMargins(0, 0, 0, 0);\n\tmDialog->setLayout(layout);\n\tmDialog->setVisible(false);\n\tconnect(mDialog, &QDialog::finished, [=]() {\n\t\tif (mMainWindow) {\n\t\t\tswitchToDocked();\n\t\t} else {\n\t\t\tmInnerWidget->close();\n\t\t}\n\t});\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"QPlayControl.h\"\n\n#include <QtWidgets\/QToolButton>\n#include <QtWidgets\/QWidget>\n#include <QtWidgets\/QComboBox>\n#include <QtWidgets\/QBoxLayout>\n\n#include \"xo\/system\/log.h\"\n\n#include <math.h>\n\nQPlayControl::QPlayControl( QWidget *parent ) :\nQWidget( parent ),\ncurrentTime( 0.0 ),\nstepTime( 0.01 ),\npageTime( 0.1 ),\nslomoFactor( 1.0 ),\nminTime( 0.0 ),\nmaxTime( 1.0 ),\nautoExtendRange_( false ),\ntimer_delta( 0 ),\ndecimals_( 2 )\n{\n\tplayButton = new QToolButton( this );\n\tplayButton->setIcon( style()->standardIcon( QStyle::SP_MediaPlay ) );\n\tconnect( playButton, SIGNAL( clicked() ), this, SLOT( togglePlay() ) );\n\n\tresetButton = new QToolButton( this );\n\tresetButton->setIcon( style()->standardIcon( QStyle::SP_MediaSkipBackward ) );\n\tconnect( resetButton, SIGNAL( clicked() ), this, SLOT( reset() ) );\n\n\tnextButton = new QToolButton( this );\n\tnextButton->setIcon( style()->standardIcon( QStyle::SP_MediaSeekForward) );\n\tnextButton->setStyleSheet( \"border: 0px\" );\n\tconnect( nextButton, SIGNAL( clicked() ), this, SLOT( stepForward() ) );\n\n\tpreviousButton = new QToolButton( this );\n\tpreviousButton->setIcon( style()->standardIcon( QStyle::SP_MediaSeekBackward ) );\n\tpreviousButton->setStyleSheet( \"border: 0px\" );\n\tconnect( previousButton, SIGNAL( clicked() ), this, SLOT( stepBack() ) );\n\n\tloopButton = new QToolButton( this );\n\tloopButton->setCheckable( true );\n\tloopButton->setIcon( style()->standardIcon( QStyle::SP_BrowserReload ) );\n\n\tlcdNumber = new QLCDNumber( this );\n\tlcdNumber->setDigitCount( 6 );\n\tlcdNumber->setSmallDecimalPoint( true );\n\tlcdNumber->setFrameStyle( QFrame::NoFrame );\n\tlcdNumber->setSegmentStyle( QLCDNumber::Flat );\n\tlcdNumber->display( \"0.000\" );\n\n\tslider = new QSlider( Qt::Horizontal, this );\n\tslider->setSingleStep( 10 );\n\tslider->setPageStep( 100 );\n\tconnect( slider, SIGNAL( valueChanged( int ) ), this, SLOT( updateSlider( int ) ) );\n\tconnect( slider, SIGNAL( sliderReleased() ), this, SIGNAL( sliderReleased() ) );\n\n\tslomoBox = new QComboBox( this );\n\tfor ( int slomo = 2; slomo >= -5; --slomo )\n\t{\n\t\tQString label = slomo >= 0 ? QString().sprintf( \"%d x\", (int)pow( 2, slomo ) ) : QString().sprintf( \"1\/%d x\", (int)pow( 2, -slomo ) );\n\t\tslomoBox->addItem( label, QVariant( pow( 2, slomo ) ) );\n\t}\n\tslomoBox->setCurrentIndex( 2 );\n\tconnect( slomoBox, SIGNAL( currentIndexChanged( int ) ), this, SLOT( updateSlowMotion( int ) ) );\n\n\tQBoxLayout *lo = new QHBoxLayout;\n\tlo->setMargin( 0 );\n\tlo->setSpacing( 2 );\n\tlo->addWidget( playButton );\n\tlo->addWidget( resetButton );\n\tlo->addWidget( lcdNumber );\n\tlo->addWidget( previousButton );\n\tlo->addWidget( slider );\n\tlo->addWidget( nextButton );\n\tlo->addWidget( loopButton );\n\tlo->addWidget( slomoBox );\n\tsetLayout( lo );\n\n\tconnect( &qtimer, &QTimer::timeout, this, &QPlayControl::updateTime );\n}\n\nvoid QPlayControl::setRange( double min, double max )\n{\n\tminTime = min;\n\tmaxTime = max;\n\tslider->setRange( static_cast< int >( 1000 * minTime + 0.5 ), static_cast< int >( 1000 * maxTime + 0.5 ) );\n}\n\nvoid QPlayControl::setTime( double time )\n{\n\tif ( time > maxTime )\n\t{\n\t\tif ( autoExtendRange() ) \/\/ adjust maximum\n\t\t{\n\t\t\tsetRange( minTime, time );\n\t\t\tcurrentTime = time;\n\t\t}\n\t\telse if ( isPlaying() && loop() ) \/\/ loop\n\t\t{\n\t\t\tcurrentTime = minTime;\n\t\t}\n\t\telse \/\/ clamp to maximum and stop playing\n\t\t{\n\t\t\tcurrentTime = maxTime;\n\t\t\tif ( isPlaying() )\n\t\t\t\tstop();\n\t\t}\n\t}\n\telse if ( time < minTime )\n\t{\n\t\tcurrentTime = minTime;\n\t}\n\telse currentTime = time;\n\n\tslider->blockSignals( true );\n\tslider->setValue( int( currentTime * 1000 ) );\n\tslider->blockSignals( false );\n\n\tlcdNumber->display( QString().sprintf( \"%.*f\", decimals_, currentTime ) );\n\t\n\temit timeChanged( currentTime );\n}\n\nvoid QPlayControl::setDigits( int digits, int decimals )\n{\n\tdecimals_ = decimals;\n\tlcdNumber->setDigitCount( digits );\n\tlcdNumber->display( QString().sprintf( \"%.*f\", decimals_, currentTime ) );\n}\n\nbool QPlayControl::loop() const\n{\n\treturn loopButton->isChecked();\n}\n\nbool QPlayControl::isPlaying() const\n{\n\treturn qtimer.isActive();\n}\n\nvoid QPlayControl::setLoop( bool b )\n{\n\tloopButton->setChecked( b );\n}\n\nvoid QPlayControl::play()\n{\n\tif ( !isPlaying() )\n\t{\n\t\tif ( currentTime >= maxTime )\n\t\t\treset();\n\t\tqtimer.start( 10 );\n\t\ttimer.reset();\n\t\ttimer_delta( 0 );\n\t\tplayButton->setIcon( style()->standardIcon( QStyle::SP_MediaPause ) );\n\t\temit playTriggered();\n\t}\n}\n\nvoid QPlayControl::stop()\n{\n\tqtimer.stop();\n\tupdateTime();\n\tplayButton->setIcon( style()->standardIcon( QStyle::SP_MediaPlay ) );\n\temit stopTriggered();\n}\n\nvoid QPlayControl::stopReset()\n{\n\tif ( isPlaying() )\n\t\tstop();\n\telse reset();\n}\n\nvoid QPlayControl::togglePlay()\n{\n\tif ( isPlaying() )\n\t\tstop();\n\telse play();\n}\n\nvoid QPlayControl::reset()\n{\n\tif ( isPlaying() )\n\t\tstop();\n\tsetTime( minTime );\n\temit resetTriggered();\n}\n\nvoid QPlayControl::end()\n{\n\tif ( isPlaying() )\n\t\tstop();\n\tsetTime( maxTime );\n}\n\nvoid QPlayControl::stepBack()\n{\n\tsetTime( currentTime - stepTime );\n}\n\nvoid QPlayControl::stepForward()\n{\n\tsetTime( currentTime + stepTime );\n}\n\nvoid QPlayControl::pageBack()\n{\n\tsetTime( currentTime - pageTime );\n}\n\nvoid QPlayControl::pageForward()\n{\n\tsetTime( currentTime + pageTime );\n}\n\nvoid QPlayControl::faster()\n{\n\tslomoBox->setCurrentIndex( std::max( 0, slomoBox->currentIndex() - 1 ) );\n}\n\nvoid QPlayControl::slower()\n{\n\tslomoBox->setCurrentIndex( std::min( slomoBox->count() - 1, slomoBox->currentIndex() + 1 ) );\n}\n\nvoid QPlayControl::updateSlowMotion( int idx )\n{\n\tslomoFactor = slomoBox->itemData( idx ).toDouble();\n\temit slowMotionChanged( slomoBox->itemData( idx ).toInt() );\n}\n\nvoid QPlayControl::updateSlider( int value )\n{\n\tsetTime( value \/ 1000.0 );\n\temit sliderChanged( value );\n}\n\nvoid QPlayControl::updateTime()\n{\n\tsetTime( currentTime + slomoFactor * timer_delta( timer.seconds() ) );\n}\n<commit_msg>F: QPlayControl::stop() does not change time when not playing<commit_after>#include \"QPlayControl.h\"\n\n#include <QtWidgets\/QToolButton>\n#include <QtWidgets\/QWidget>\n#include <QtWidgets\/QComboBox>\n#include <QtWidgets\/QBoxLayout>\n\n#include \"xo\/system\/log.h\"\n\n#include <math.h>\n#include \"scone\/core\/Log.h\"\n\nQPlayControl::QPlayControl( QWidget *parent ) :\nQWidget( parent ),\ncurrentTime( 0.0 ),\nstepTime( 0.01 ),\npageTime( 0.1 ),\nslomoFactor( 1.0 ),\nminTime( 0.0 ),\nmaxTime( 1.0 ),\nautoExtendRange_( false ),\ntimer_delta( 0 ),\ndecimals_( 2 )\n{\n\tplayButton = new QToolButton( this );\n\tplayButton->setIcon( style()->standardIcon( QStyle::SP_MediaPlay ) );\n\tconnect( playButton, SIGNAL( clicked() ), this, SLOT( togglePlay() ) );\n\n\tresetButton = new QToolButton( this );\n\tresetButton->setIcon( style()->standardIcon( QStyle::SP_MediaSkipBackward ) );\n\tconnect( resetButton, SIGNAL( clicked() ), this, SLOT( reset() ) );\n\n\tnextButton = new QToolButton( this );\n\tnextButton->setIcon( style()->standardIcon( QStyle::SP_MediaSeekForward) );\n\tnextButton->setStyleSheet( \"border: 0px\" );\n\tconnect( nextButton, SIGNAL( clicked() ), this, SLOT( stepForward() ) );\n\n\tpreviousButton = new QToolButton( this );\n\tpreviousButton->setIcon( style()->standardIcon( QStyle::SP_MediaSeekBackward ) );\n\tpreviousButton->setStyleSheet( \"border: 0px\" );\n\tconnect( previousButton, SIGNAL( clicked() ), this, SLOT( stepBack() ) );\n\n\tloopButton = new QToolButton( this );\n\tloopButton->setCheckable( true );\n\tloopButton->setIcon( style()->standardIcon( QStyle::SP_BrowserReload ) );\n\n\tlcdNumber = new QLCDNumber( this );\n\tlcdNumber->setDigitCount( 6 );\n\tlcdNumber->setSmallDecimalPoint( true );\n\tlcdNumber->setFrameStyle( QFrame::NoFrame );\n\tlcdNumber->setSegmentStyle( QLCDNumber::Flat );\n\tlcdNumber->display( \"0.000\" );\n\n\tslider = new QSlider( Qt::Horizontal, this );\n\tslider->setSingleStep( 10 );\n\tslider->setPageStep( 100 );\n\tconnect( slider, SIGNAL( valueChanged( int ) ), this, SLOT( updateSlider( int ) ) );\n\tconnect( slider, SIGNAL( sliderReleased() ), this, SIGNAL( sliderReleased() ) );\n\n\tslomoBox = new QComboBox( this );\n\tfor ( int slomo = 2; slomo >= -5; --slomo )\n\t{\n\t\tQString label = slomo >= 0 ? QString().sprintf( \"%d x\", (int)pow( 2, slomo ) ) : QString().sprintf( \"1\/%d x\", (int)pow( 2, -slomo ) );\n\t\tslomoBox->addItem( label, QVariant( pow( 2, slomo ) ) );\n\t}\n\tslomoBox->setCurrentIndex( 2 );\n\tconnect( slomoBox, SIGNAL( currentIndexChanged( int ) ), this, SLOT( updateSlowMotion( int ) ) );\n\n\tQBoxLayout *lo = new QHBoxLayout;\n\tlo->setMargin( 0 );\n\tlo->setSpacing( 2 );\n\tlo->addWidget( playButton );\n\tlo->addWidget( resetButton );\n\tlo->addWidget( lcdNumber );\n\tlo->addWidget( previousButton );\n\tlo->addWidget( slider );\n\tlo->addWidget( nextButton );\n\tlo->addWidget( loopButton );\n\tlo->addWidget( slomoBox );\n\tsetLayout( lo );\n\n\tconnect( &qtimer, &QTimer::timeout, this, &QPlayControl::updateTime );\n}\n\nvoid QPlayControl::setRange( double min, double max )\n{\n\tminTime = min;\n\tmaxTime = max;\n\tslider->setRange( static_cast< int >( 1000 * minTime + 0.5 ), static_cast< int >( 1000 * maxTime + 0.5 ) );\n}\n\nvoid QPlayControl::setTime( double time )\n{\n\tif ( time > maxTime )\n\t{\n\t\tif ( autoExtendRange() ) \/\/ adjust maximum\n\t\t{\n\t\t\tsetRange( minTime, time );\n\t\t\tcurrentTime = time;\n\t\t}\n\t\telse if ( isPlaying() && loop() ) \/\/ loop\n\t\t{\n\t\t\tcurrentTime = minTime;\n\t\t}\n\t\telse \/\/ clamp to maximum and stop playing\n\t\t{\n\t\t\tcurrentTime = maxTime;\n\t\t\tif ( isPlaying() )\n\t\t\t\tstop();\n\t\t}\n\t}\n\telse if ( time < minTime )\n\t{\n\t\tcurrentTime = minTime;\n\t}\n\telse currentTime = time;\n\n\tslider->blockSignals( true );\n\tslider->setValue( int( currentTime * 1000 ) );\n\tslider->blockSignals( false );\n\n\tlcdNumber->display( QString().sprintf( \"%.*f\", decimals_, currentTime ) );\n\t\n\temit timeChanged( currentTime );\n}\n\nvoid QPlayControl::setDigits( int digits, int decimals )\n{\n\tdecimals_ = decimals;\n\tlcdNumber->setDigitCount( digits );\n\tlcdNumber->display( QString().sprintf( \"%.*f\", decimals_, currentTime ) );\n}\n\nbool QPlayControl::loop() const\n{\n\treturn loopButton->isChecked();\n}\n\nbool QPlayControl::isPlaying() const\n{\n\treturn qtimer.isActive();\n}\n\nvoid QPlayControl::setLoop( bool b )\n{\n\tloopButton->setChecked( b );\n}\n\nvoid QPlayControl::play()\n{\n\tif ( !isPlaying() )\n\t{\n\t\tif ( currentTime >= maxTime )\n\t\t\treset();\n\t\tqtimer.start( 10 );\n\t\ttimer.reset();\n\t\ttimer_delta( 0 );\n\t\tplayButton->setIcon( style()->standardIcon( QStyle::SP_MediaPause ) );\n\t\temit playTriggered();\n\t}\n}\n\nvoid QPlayControl::stop()\n{\n\tif ( isPlaying() )\n\t{\n\t\tqtimer.stop();\n\t\tupdateTime();\n\t\tplayButton->setIcon( style()->standardIcon( QStyle::SP_MediaPlay ) );\n\t\temit stopTriggered();\n\t}\n}\n\nvoid QPlayControl::stopReset()\n{\n\tif ( isPlaying() )\n\t\tstop();\n\telse reset();\n}\n\nvoid QPlayControl::togglePlay()\n{\n\tif ( isPlaying() )\n\t\tstop();\n\telse play();\n}\n\nvoid QPlayControl::reset()\n{\n\tif ( isPlaying() )\n\t\tstop();\n\tsetTime( minTime );\n\temit resetTriggered();\n}\n\nvoid QPlayControl::end()\n{\n\tif ( isPlaying() )\n\t\tstop();\n\tsetTime( maxTime );\n}\n\nvoid QPlayControl::stepBack()\n{\n\tsetTime( currentTime - stepTime );\n}\n\nvoid QPlayControl::stepForward()\n{\n\tsetTime( currentTime + stepTime );\n}\n\nvoid QPlayControl::pageBack()\n{\n\tsetTime( currentTime - pageTime );\n}\n\nvoid QPlayControl::pageForward()\n{\n\tsetTime( currentTime + pageTime );\n}\n\nvoid QPlayControl::faster()\n{\n\tslomoBox->setCurrentIndex( std::max( 0, slomoBox->currentIndex() - 1 ) );\n}\n\nvoid QPlayControl::slower()\n{\n\tslomoBox->setCurrentIndex( std::min( slomoBox->count() - 1, slomoBox->currentIndex() + 1 ) );\n}\n\nvoid QPlayControl::updateSlowMotion( int idx )\n{\n\tslomoFactor = slomoBox->itemData( idx ).toDouble();\n\temit slowMotionChanged( slomoBox->itemData( idx ).toInt() );\n}\n\nvoid QPlayControl::updateSlider( int value )\n{\n\tsetTime( value \/ 1000.0 );\n\temit sliderChanged( value );\n}\n\nvoid QPlayControl::updateTime()\n{\n\tsetTime( currentTime + slomoFactor * timer_delta( timer.seconds() ) );\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: XMLStylesImportHelper.hxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: rt $ $Date: 2008-01-29 15:35:45 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n#ifndef _SC_XMLSTYLESIMPORTHELPER_HXX\n#define _SC_XMLSTYLESIMPORTHELPER_HXX\n\n#ifndef SC_RANGELST_HXX\n#include \"rangelst.hxx\"\n#endif\n\n#ifndef _RTL_USTRING_HXX_\n#include <rtl\/ustring.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_TABLE_CELLRANGEADDRESS_HPP_\n#include <com\/sun\/star\/table\/CellRangeAddress.hpp>\n#endif\n#ifndef _COM_SUN_STAR_TABLE_CELLADDRESS_HPP_\n#include <com\/sun\/star\/table\/CellAddress.hpp>\n#endif\n\n#include <set>\n#include <vector>\n\nclass ScXMLImport;\n\nstruct ScMyStyleNumberFormat\n{\n    rtl::OUString       sStyleName;\n    sal_Int32           nNumberFormat;\n\n    ScMyStyleNumberFormat() : nNumberFormat(-1) {}\n    ScMyStyleNumberFormat(const rtl::OUString& rStyleName) :\n        sStyleName(rStyleName), nNumberFormat(-1) {}\n    ScMyStyleNumberFormat(const rtl::OUString& rStyleName, const sal_Int32 nFormat) :\n        sStyleName(rStyleName), nNumberFormat(nFormat) {}\n};\n\nstruct LessStyleNumberFormat\n{\n    sal_Bool operator() (const ScMyStyleNumberFormat& rValue1, const ScMyStyleNumberFormat& rValue2) const\n    {\n        return rValue1.sStyleName < rValue2.sStyleName;\n    }\n};\n\ntypedef std::set< ScMyStyleNumberFormat, LessStyleNumberFormat >    ScMyStyleNumberFormatSet;\n\nclass ScMyStyleNumberFormats\n{\n    ScMyStyleNumberFormatSet    aSet;\n\npublic:\n    void AddStyleNumberFormat(const rtl::OUString& rStyleName, const sal_Int32 nNumberFormat);\n    sal_Int32 GetStyleNumberFormat(const rtl::OUString& rStyleName);\n};\n\nstruct ScMyCurrencyStyle\n{\n    rtl::OUString       sCurrency;\n    ScRangeListRef      xRanges;\n\n    ScMyCurrencyStyle() : xRanges(new ScRangeList()) {}\n    ~ScMyCurrencyStyle() {}\n};\n\nstruct LessCurrencyStyle\n{\n    sal_Bool operator() (const ScMyCurrencyStyle& rValue1, const ScMyCurrencyStyle& rValue2) const\n    {\n        return rValue1.sCurrency < rValue2.sCurrency;\n    }\n};\n\ntypedef std::set<ScMyCurrencyStyle, LessCurrencyStyle>  ScMyCurrencyStylesSet;\n\nclass ScMyStyleRanges : public SvRefBase\n{\n    ScRangeList*            pTextList;\n    ScRangeList*            pNumberList;\n    ScRangeList*            pTimeList;\n    ScRangeList*            pDateTimeList;\n    ScRangeList*            pPercentList;\n    ScRangeList*            pLogicalList;\n    ScRangeList*            pUndefinedList;\n    ScMyCurrencyStylesSet*  pCurrencyList;\n\n    void AddRange(const ScRange& rRange, ScRangeList* pList,\n        const rtl::OUString* pStyleName, const sal_Int16 nType,\n        ScXMLImport& rImport, const sal_uInt32 nMaxRanges);\n    void AddCurrencyRange(const ScRange& rRange, ScRangeListRef xList,\n        const rtl::OUString* pStyleName, const rtl::OUString* pCurrency,\n        ScXMLImport& rImport, const sal_uInt32 nMaxRanges);\n    void InsertColRow(const ScRange& rRange, const SCsCOL nDx, const SCsROW nDy,\n        const SCsTAB nDz, ScDocument* pDoc);\n    void SetStylesToRanges(ScRangeList* pList,\n        const rtl::OUString* pStyleName, const sal_Int16 nCellType,\n        const rtl::OUString* pCurrency, ScXMLImport& rImport);\n    void SetStylesToRanges(ScRangeListRef xList,\n        const rtl::OUString* pStyleName, const sal_Int16 nCellType,\n        const rtl::OUString* pCurrency, ScXMLImport& rImport);\npublic:\n    ScMyStyleRanges();\n    ~ScMyStyleRanges();\n    void AddRange(const ScRange& rRange,\n        const rtl::OUString* pStyleName, const sal_Int16 nType,\n        ScXMLImport& rImport, const sal_uInt32 nMaxRanges);\n    void AddCurrencyRange(const ScRange& rRange,\n        const rtl::OUString* pStyleName, const rtl::OUString* pCurrency,\n        ScXMLImport& rImport, const sal_uInt32 nMaxRanges);\n    void InsertRow(const sal_Int32 nRow, const sal_Int32 nTab, ScDocument* pDoc);\n    void InsertCol(const sal_Int32 nCol, const sal_Int32 nTab, ScDocument* pDoc);\n    void SetStylesToRanges(const rtl::OUString* pStyleName, ScXMLImport& rImport);\n};\nSV_DECL_IMPL_REF( ScMyStyleRanges );\n\nstruct ScMyStyle\n{\n    rtl::OUString       sStyleName;\n    ScMyStyleRangesRef  xRanges;\n\n    ScMyStyle() : xRanges(new ScMyStyleRanges()) {}\n    ~ScMyStyle() {}\n};\n\nstruct LessStyle\n{\n    sal_Bool operator() (const ScMyStyle& rValue1, const ScMyStyle& rValue2) const\n    {\n        return rValue1.sStyleName < rValue2.sStyleName;\n    }\n};\n\ntypedef std::set<ScMyStyle, LessStyle>  ScMyStylesSet;\ntypedef std::vector<ScMyStylesSet::iterator> ScMyStyles;\n\nclass ScMyStylesImportHelper\n{\n    ScMyStylesSet       aCellStyles;\n    ScMyStyles          aColDefaultStyles;\n    ScMyStylesSet::iterator aRowDefaultStyle;\n    ScXMLImport&        rImport;\n    rtl::OUString*      pStyleName;\n    rtl::OUString*      pPrevStyleName;\n    rtl::OUString*      pCurrency;\n    rtl::OUString*      pPrevCurrency;\n    ScRange             aPrevRange;\n    sal_uInt32          nMaxRanges;\n    sal_Int16           nCellType;\n    sal_Int16           nPrevCellType;\n    sal_Bool            bPrevRangeAdded;\n\n    void ResetAttributes();\n    ScMyStylesSet::iterator GetIterator(const rtl::OUString* pStyleName);\n    void AddDefaultRange(const ScRange& rRange);\n    void AddSingleRange(const ScRange& rRange);\n    void AddRange();\n    sal_Bool IsEqual(const rtl::OUString* pFirst, const rtl::OUString* pSecond)\n    {\n        return ((pFirst && pSecond && pFirst->equals(*pSecond)) ||\n                (!pFirst && !pSecond) ||\n                (!pFirst && pSecond && !pSecond->getLength()) ||\n                (!pSecond &&  pFirst && !pFirst->getLength()));\n    }\npublic:\n    ScMyStylesImportHelper(ScXMLImport& rImport);\n    ~ScMyStylesImportHelper();\n    void AddColumnStyle(const rtl::OUString& rStyleName, const sal_Int32 nColumn, const sal_Int32 nRepeat);\n    void SetRowStyle(const rtl::OUString& rStyleName);\n    void SetAttributes(rtl::OUString* pStyleName,\n        rtl::OUString* pCurrency, const sal_Int16 nCellType);\n    void AddRange(const ScRange& rRange);\n    void AddRange(const com::sun::star::table::CellRangeAddress& rRange);\n    void AddCell(const ScAddress& rAddress);\n    void AddCell(const com::sun::star::table::CellAddress& rAddress);\n    void InsertRow(const sal_Int32 nRow, const sal_Int32 nTab, ScDocument* pDoc); \/\/ a row is inserted before nRow\n    void InsertCol(const sal_Int32 nCol, const sal_Int32 nTab, ScDocument* pDoc); \/\/ a col is inserted before nCol\n    void EndTable();\n    void SetStylesToRanges();\n};\n\n#endif\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.9.88); FILE MERGED 2008\/04\/01 15:30:28 thb 1.9.88.3: #i85898# Stripping all external header guards 2008\/04\/01 12:36:31 thb 1.9.88.2: #i85898# Stripping all external header guards 2008\/03\/31 17:14:56 rt 1.9.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: XMLStylesImportHelper.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 _SC_XMLSTYLESIMPORTHELPER_HXX\n#define _SC_XMLSTYLESIMPORTHELPER_HXX\n\n#include \"rangelst.hxx\"\n#include <rtl\/ustring.hxx>\n#include <com\/sun\/star\/table\/CellRangeAddress.hpp>\n#include <com\/sun\/star\/table\/CellAddress.hpp>\n\n#include <set>\n#include <vector>\n\nclass ScXMLImport;\n\nstruct ScMyStyleNumberFormat\n{\n    rtl::OUString       sStyleName;\n    sal_Int32           nNumberFormat;\n\n    ScMyStyleNumberFormat() : nNumberFormat(-1) {}\n    ScMyStyleNumberFormat(const rtl::OUString& rStyleName) :\n        sStyleName(rStyleName), nNumberFormat(-1) {}\n    ScMyStyleNumberFormat(const rtl::OUString& rStyleName, const sal_Int32 nFormat) :\n        sStyleName(rStyleName), nNumberFormat(nFormat) {}\n};\n\nstruct LessStyleNumberFormat\n{\n    sal_Bool operator() (const ScMyStyleNumberFormat& rValue1, const ScMyStyleNumberFormat& rValue2) const\n    {\n        return rValue1.sStyleName < rValue2.sStyleName;\n    }\n};\n\ntypedef std::set< ScMyStyleNumberFormat, LessStyleNumberFormat >    ScMyStyleNumberFormatSet;\n\nclass ScMyStyleNumberFormats\n{\n    ScMyStyleNumberFormatSet    aSet;\n\npublic:\n    void AddStyleNumberFormat(const rtl::OUString& rStyleName, const sal_Int32 nNumberFormat);\n    sal_Int32 GetStyleNumberFormat(const rtl::OUString& rStyleName);\n};\n\nstruct ScMyCurrencyStyle\n{\n    rtl::OUString       sCurrency;\n    ScRangeListRef      xRanges;\n\n    ScMyCurrencyStyle() : xRanges(new ScRangeList()) {}\n    ~ScMyCurrencyStyle() {}\n};\n\nstruct LessCurrencyStyle\n{\n    sal_Bool operator() (const ScMyCurrencyStyle& rValue1, const ScMyCurrencyStyle& rValue2) const\n    {\n        return rValue1.sCurrency < rValue2.sCurrency;\n    }\n};\n\ntypedef std::set<ScMyCurrencyStyle, LessCurrencyStyle>  ScMyCurrencyStylesSet;\n\nclass ScMyStyleRanges : public SvRefBase\n{\n    ScRangeList*            pTextList;\n    ScRangeList*            pNumberList;\n    ScRangeList*            pTimeList;\n    ScRangeList*            pDateTimeList;\n    ScRangeList*            pPercentList;\n    ScRangeList*            pLogicalList;\n    ScRangeList*            pUndefinedList;\n    ScMyCurrencyStylesSet*  pCurrencyList;\n\n    void AddRange(const ScRange& rRange, ScRangeList* pList,\n        const rtl::OUString* pStyleName, const sal_Int16 nType,\n        ScXMLImport& rImport, const sal_uInt32 nMaxRanges);\n    void AddCurrencyRange(const ScRange& rRange, ScRangeListRef xList,\n        const rtl::OUString* pStyleName, const rtl::OUString* pCurrency,\n        ScXMLImport& rImport, const sal_uInt32 nMaxRanges);\n    void InsertColRow(const ScRange& rRange, const SCsCOL nDx, const SCsROW nDy,\n        const SCsTAB nDz, ScDocument* pDoc);\n    void SetStylesToRanges(ScRangeList* pList,\n        const rtl::OUString* pStyleName, const sal_Int16 nCellType,\n        const rtl::OUString* pCurrency, ScXMLImport& rImport);\n    void SetStylesToRanges(ScRangeListRef xList,\n        const rtl::OUString* pStyleName, const sal_Int16 nCellType,\n        const rtl::OUString* pCurrency, ScXMLImport& rImport);\npublic:\n    ScMyStyleRanges();\n    ~ScMyStyleRanges();\n    void AddRange(const ScRange& rRange,\n        const rtl::OUString* pStyleName, const sal_Int16 nType,\n        ScXMLImport& rImport, const sal_uInt32 nMaxRanges);\n    void AddCurrencyRange(const ScRange& rRange,\n        const rtl::OUString* pStyleName, const rtl::OUString* pCurrency,\n        ScXMLImport& rImport, const sal_uInt32 nMaxRanges);\n    void InsertRow(const sal_Int32 nRow, const sal_Int32 nTab, ScDocument* pDoc);\n    void InsertCol(const sal_Int32 nCol, const sal_Int32 nTab, ScDocument* pDoc);\n    void SetStylesToRanges(const rtl::OUString* pStyleName, ScXMLImport& rImport);\n};\nSV_DECL_IMPL_REF( ScMyStyleRanges );\n\nstruct ScMyStyle\n{\n    rtl::OUString       sStyleName;\n    ScMyStyleRangesRef  xRanges;\n\n    ScMyStyle() : xRanges(new ScMyStyleRanges()) {}\n    ~ScMyStyle() {}\n};\n\nstruct LessStyle\n{\n    sal_Bool operator() (const ScMyStyle& rValue1, const ScMyStyle& rValue2) const\n    {\n        return rValue1.sStyleName < rValue2.sStyleName;\n    }\n};\n\ntypedef std::set<ScMyStyle, LessStyle>  ScMyStylesSet;\ntypedef std::vector<ScMyStylesSet::iterator> ScMyStyles;\n\nclass ScMyStylesImportHelper\n{\n    ScMyStylesSet       aCellStyles;\n    ScMyStyles          aColDefaultStyles;\n    ScMyStylesSet::iterator aRowDefaultStyle;\n    ScXMLImport&        rImport;\n    rtl::OUString*      pStyleName;\n    rtl::OUString*      pPrevStyleName;\n    rtl::OUString*      pCurrency;\n    rtl::OUString*      pPrevCurrency;\n    ScRange             aPrevRange;\n    sal_uInt32          nMaxRanges;\n    sal_Int16           nCellType;\n    sal_Int16           nPrevCellType;\n    sal_Bool            bPrevRangeAdded;\n\n    void ResetAttributes();\n    ScMyStylesSet::iterator GetIterator(const rtl::OUString* pStyleName);\n    void AddDefaultRange(const ScRange& rRange);\n    void AddSingleRange(const ScRange& rRange);\n    void AddRange();\n    sal_Bool IsEqual(const rtl::OUString* pFirst, const rtl::OUString* pSecond)\n    {\n        return ((pFirst && pSecond && pFirst->equals(*pSecond)) ||\n                (!pFirst && !pSecond) ||\n                (!pFirst && pSecond && !pSecond->getLength()) ||\n                (!pSecond &&  pFirst && !pFirst->getLength()));\n    }\npublic:\n    ScMyStylesImportHelper(ScXMLImport& rImport);\n    ~ScMyStylesImportHelper();\n    void AddColumnStyle(const rtl::OUString& rStyleName, const sal_Int32 nColumn, const sal_Int32 nRepeat);\n    void SetRowStyle(const rtl::OUString& rStyleName);\n    void SetAttributes(rtl::OUString* pStyleName,\n        rtl::OUString* pCurrency, const sal_Int16 nCellType);\n    void AddRange(const ScRange& rRange);\n    void AddRange(const com::sun::star::table::CellRangeAddress& rRange);\n    void AddCell(const ScAddress& rAddress);\n    void AddCell(const com::sun::star::table::CellAddress& rAddress);\n    void InsertRow(const sal_Int32 nRow, const sal_Int32 nTab, ScDocument* pDoc); \/\/ a row is inserted before nRow\n    void InsertCol(const sal_Int32 nCol, const sal_Int32 nTab, ScDocument* pDoc); \/\/ a col is inserted before nCol\n    void EndTable();\n    void SetStylesToRanges();\n};\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Modify errata<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2008-2015 John Connor (BM-NC49AxAjcqVcF5jNPu85Rb8MJ2d9JqZt)\n *\n * This 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#ifndef DATABASE_PROTOCOL_HPP\n#define DATABASE_PROTOCOL_HPP\n\n#include <cstdint>\n\nnamespace database {\n\n    \/**\n     * The protocol.\n     *\/\n    class protocol\n    {\n        public:\n        \n            \/**\n             * If true UDP packets will be encrypted by use of ECDHE and\n             * HC256 using a Whirlpool derived shared secret.\n             *\/\n            enum { udp_ecdhe_enabled = 1 };\n        \n            \/**\n             * The header.\n             *\/\n            typedef struct header\n            {\n                std::uint8_t flags;\n                std::uint8_t code;\n                std::uint16_t transaction_id;\n            } header_t;\n            \n            \/**\n             * The message codes.\n             *\/\n            typedef enum message_codes\n            {\n                message_code_none = 0,\n                message_code_ack = 2,\n                message_code_nack = 4,\n                message_code_ping = 8,\n                message_code_store = 9,\n                message_code_find = 10,\n                message_code_reserved_11 = 11,\n                message_code_probe = 12,\n                message_code_public_key_ping = 13,\n                message_code_public_key_pong = 14,\n                message_code_error = 0xfe,\n            } message_code_t;\n            \n            \/**\n             * The message flags.\n             * 0x01|1|00000001\n             * 0x02|2|00000010\n             * 0x04|4|00000100\n             * 0x08|8|00001000\n             * 0x10|16|00010000\n             * 0x20|32|00100000\n             * 0x40|64|01000000\n             * 0x80|128|10000000\n             *\/\n            typedef enum message_flags\n            {\n                message_flag_0x01 = 0x01,\n                message_flag_0x02 = 0x02,\n                message_flag_dontroute = 0x04,\n                message_flag_compressed = 0x08,\n                message_flag_encrypted = 0x10,\n                message_flag_0x20 = 0x20,\n                message_flag_0x40 = 0x40,\n                message_flag_0x80 = 0x80,\n            } message_flag_t;\n        \n        private:\n        \n            \/\/ ...\n            \n        protected:\n        \n            \/\/ ...\n    };\n    \n} \/\/ namespace database\n\n#endif \/\/ DATABASE_PROTOCOL_HPP\n<commit_msg>integrating broadcast algorithm<commit_after>\/*\n * Copyright (c) 2008-2015 John Connor (BM-NC49AxAjcqVcF5jNPu85Rb8MJ2d9JqZt)\n *\n * This 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#ifndef DATABASE_PROTOCOL_HPP\n#define DATABASE_PROTOCOL_HPP\n\n#include <cstdint>\n\nnamespace database {\n\n    \/**\n     * The protocol.\n     *\/\n    class protocol\n    {\n        public:\n        \n            \/**\n             * If true UDP packets will be encrypted by use of ECDHE and\n             * HC256 using a Whirlpool derived shared secret.\n             *\/\n            enum { udp_ecdhe_enabled = 1 };\n        \n            \/**\n             * The header.\n             *\/\n            typedef struct header\n            {\n                std::uint8_t flags;\n                std::uint8_t code;\n                std::uint16_t transaction_id;\n            } header_t;\n            \n            \/**\n             * The message codes.\n             *\/\n            typedef enum message_codes\n            {\n                message_code_none = 0,\n                message_code_ack = 2,\n                message_code_nack = 4,\n                message_code_ping = 8,\n                message_code_store = 9,\n                message_code_find = 10,\n                message_code_reserved_11 = 11,\n                message_code_probe = 12,\n                message_code_public_key_ping = 13,\n                message_code_public_key_pong = 14,\n                message_code_broadcast = 22,\n                message_code_error = 0xfe,\n            } message_code_t;\n            \n            \/**\n             * The message flags.\n             * 0x01|1|00000001\n             * 0x02|2|00000010\n             * 0x04|4|00000100\n             * 0x08|8|00001000\n             * 0x10|16|00010000\n             * 0x20|32|00100000\n             * 0x40|64|01000000\n             * 0x80|128|10000000\n             *\/\n            typedef enum message_flags\n            {\n                message_flag_0x01 = 0x01,\n                message_flag_0x02 = 0x02,\n                message_flag_dontroute = 0x04,\n                message_flag_compressed = 0x08,\n                message_flag_encrypted = 0x10,\n                message_flag_0x20 = 0x20,\n                message_flag_0x40 = 0x40,\n                message_flag_0x80 = 0x80,\n            } message_flag_t;\n        \n        private:\n        \n            \/\/ ...\n            \n        protected:\n        \n            \/\/ ...\n    };\n    \n} \/\/ namespace database\n\n#endif \/\/ DATABASE_PROTOCOL_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/*\n** Copyright (C) 2012 Aldebaran Robotics\n*\/\n\n#include <boost\/make_shared.hpp>\n#include <boost\/mpl\/for_each.hpp>\n#include <boost\/mpl\/transform_view.hpp>\n#include <boost\/type_traits\/remove_reference.hpp>\n#include <boost\/type_traits\/add_pointer.hpp>\n#include <boost\/type_traits\/remove_const.hpp>\n#include <boost\/function_types\/function_arity.hpp>\n#include <boost\/function_types\/function_type.hpp>\n#include <boost\/function_types\/result_type.hpp>\n#include <boost\/function_types\/parameter_types.hpp>\n\n#include <boost\/fusion\/container\/vector\/convert.hpp>\n#include <boost\/fusion\/include\/as_vector.hpp>\n#include <boost\/fusion\/algorithm\/transformation\/transform.hpp>\n#include <boost\/fusion\/include\/transform.hpp>\n#include <boost\/fusion\/functional\/invocation\/invoke_function_object.hpp>\n#include <boost\/fusion\/container\/generation\/make_vector.hpp>\n#include <boost\/fusion\/include\/make_vector.hpp>\n\n#include <qimessaging\/metafunction.hpp>\n\nnamespace qi {\n\nMetaStorage::~MetaStorage()\n{\n  if (deleteOnDestruction)\n  {\n    for (unsigned i=0; i<parameterValues.size(); ++i)\n      parameterValues[i].destroy();\n  }\n}\n\nMetaFunctionParameters::MetaFunctionParameters()\n: invalidateOnDestruction(false)\n{\n}\n\nMetaFunctionParameters::~MetaFunctionParameters()\n{\n  \/\/ Invalidate storage if asked to and storage has something to invalidate\n  if (invalidateOnDestruction && storage && !storage->parameterValues.empty())\n  {\n    \/\/ There can be only one invalidator, assert it\n    assert(storage->hasInvalidator);\n    storage->valid = false;\n    storage->hasInvalidator = false;\n    \/\/ Clear values as they are no longer valid.\n    \/\/ buffer is still there, so if it was filled it will be used.\n    storage->parameterValues.clear();\n  }\n}\n\nMetaFunctionParameters::MetaFunctionParameters(const MetaFunctionParameters& b)\n: invalidateOnDestruction(false)\n{\n  storage = b.storage;\n}\n\n\nMetaFunctionParameters& MetaFunctionParameters::operator=(const MetaFunctionParameters& b)\n{\n  storage = b.storage;\n  invalidateOnDestruction = false;\n  return *this;\n}\n\nMetaFunctionParameters MetaFunctionParameters::copy() const\n{\n  if (!storage)\n    return MetaFunctionParameters();\n  \/\/ If storage cannot be invalidated or has only a buffer , no need to copy\n  if (!storage->hasInvalidator || storage->parameterValues.empty())\n    return MetaFunctionParameters(*this);\n  \/\/ Create a new storage, clone data in it\n  if (!storage->valid && !storage->parameterBuffer.size())\n    qiLogError(\"qi.meta\") << \"FunctionParameters were invalidated\";\n  qiLogDebug(\"qi.meta\") << \"Copying function parameters\";\n  MetaFunctionParameters res;\n  res._initStorage();\n  \/\/ We will copy values, mark for destruction\n  res.storage->deleteOnDestruction = true;\n  \/\/ Buffer is refcounted, no need to clone\n  res.storage->parameterBuffer = storage->parameterBuffer;\n  for (unsigned i=0; i<storage->parameterValues.size(); ++i)\n    res.storage->parameterValues.push_back(storage->parameterValues[i].clone());\n  return res;\n}\n\nMetaFunctionParameters::MetaFunctionParameters(Buffer b)\n: invalidateOnDestruction(false)\n{\n  _initStorage();\n  storage->parameterBuffer = b;\n}\n\nMetaFunctionParameters::MetaFunctionParameters(const std::vector<MetaValue>& value, bool invalidate)\n: invalidateOnDestruction(false)\n{\n  _initStorage();\n  storage->parameterValues = value;\n  invalidateOnDestruction = invalidate;\n  storage->hasInvalidator = invalidate;\n}\n\nvoid MetaFunctionParameters::_initStorage()\n{\n  storage = boost::make_shared<MetaStorage>();\n  storage->hasInvalidator = false;\n  storage->valid = true;\n  storage->deleteOnDestruction = false;\n}\n\nconst std::vector<MetaValue>& MetaFunctionParameters::getValues() const\n{\n  if (!storage || !storage->valid)\n  {\n    if (!storage)\n      qiLogError(\"qi.meta\") << \"getValues() on uninitialized storage\";\n    else\n      qiLogError(\"qi.meta\") << \"getValues() on invalidated storage\";\n    static std::vector<MetaValue> dummy;\n    return dummy;\n  }\n  if (storage->parameterValues.empty() && storage->parameterBuffer.size())\n  {\n    qiLogDebug(\"qi.meta\") << \"Generating values from serialization\";\n    convertToValues();\n  }\n  return storage->parameterValues;\n}\n\nconst Buffer& MetaFunctionParameters::getBuffer() const\n{\n  if (!storage)\n  {\n    qiLogError(\"qi.meta\") << \"getBuffer() on uninitialized storage.\";\n    static Buffer b;\n    return b;\n  }\n  if (!storage->parameterValues.empty() && !storage->parameterBuffer.size())\n  {\n    qiLogDebug(\"qi.meta\") << \"Generating serialization from values.\";\n    convertToBuffer();\n  }\n  return storage->parameterBuffer;\n}\n\nvoid MetaFunctionParameters::setSignature(const std::string& s)\n{\n  if (!storage)\n    qiLogError(\"qi.meta\") << \"setSignature() on uninitialized storage\";\n  storage->signature = s;\n}\n\nvoid MetaFunctionParameters::convertToValues() const\n{\n  if (!storage || storage->signature.empty())\n  {\n    qiLogError(\"qi.meta\") << \"Signature data unavailable, cannot convert to values.\";\n    return;\n  }\n  if (!storage->parameterValues.empty() || !storage->parameterBuffer.size())\n    return; \/\/ already done or nothing to do\n  Signature s(storage->signature);\n  qi::IDataStream in(storage->parameterBuffer);\n  Signature::iterator i;\n  for (i = s.begin(); i!= s.end(); ++i)\n  {\n    MetaType* m = MetaType::getCompatibleTypeWithSignature(*i);\n    if (!m)\n    {\n      qiLogError(\"qi.meta\") << \"Unable to find MetaType compatible with \" << *i;\n      storage->parameterValues.push_back(MetaValue());\n    }\n    else\n    {\n      void* val = m->deserialize(in);\n      MetaValue mv;\n      mv.type = m;\n      mv.value = val;\n      storage->parameterValues.push_back(mv);\n    }\n  }\n  storage->deleteOnDestruction = true;\n  assert (!storage->hasInvalidator);\n}\n\nvoid MetaFunctionParameters::convertToBuffer() const\n{\n  if (!storage || storage->parameterBuffer.size() || storage->parameterValues.empty())\n    return; \/\/ Already done or nothing to do\n  qi::ODataStream out(storage->parameterBuffer);\n  for (unsigned i=0; i<storage->parameterValues.size(); ++i)\n    storage->parameterValues[i].serialize(out);\n}\n\nMetaFunctionParameters::Mode MetaFunctionParameters::getMode() const\n{\n  if (storage && !storage->parameterValues.empty())\n    return MODE_METAVALUE;\n  else\n    return MODE_BUFFER;\n}\n\n\nMetaFunctionResult::MetaFunctionResult()\n{\n}\n\nMetaFunctionResult::MetaFunctionResult(Buffer buffer)\n:MetaFunctionParameters(buffer)\n{}\n\nMetaFunctionResult::MetaFunctionResult(const MetaValue& mv)\n: MetaFunctionParameters(std::vector<MetaValue>(&mv, &mv+1))\n{\n  storage->deleteOnDestruction = true;\n}\n\nMetaValue MetaFunctionResult::getValue() const\n{\n  const std::vector<MetaValue>& v = getValues();\n  if (!v.empty())\n    return v[0];\n  else\n    return MetaValue();\n}\n\n}\n\nQI_REGISTER_MAPPING(\"i\", qi::int32_t);\nQI_REGISTER_MAPPING(\"I\", qi::uint32_t);\nQI_REGISTER_MAPPING(\"d\", double);\nQI_REGISTER_MAPPING(\"[d]\", std::vector<double>);\nQI_REGISTER_MAPPING(\"[i]\", std::vector<int>);\nQI_REGISTER_MAPPING(\"s\", std::string);\nQI_REGISTER_MAPPING(\"[s]\", std::vector<std::string>);\nQI_REGISTER_MAPPING(\"r\", qi::Buffer);\n<commit_msg>Meta: Register mappings for float.<commit_after>\/*\n** Copyright (C) 2012 Aldebaran Robotics\n*\/\n\n#include <boost\/make_shared.hpp>\n#include <boost\/mpl\/for_each.hpp>\n#include <boost\/mpl\/transform_view.hpp>\n#include <boost\/type_traits\/remove_reference.hpp>\n#include <boost\/type_traits\/add_pointer.hpp>\n#include <boost\/type_traits\/remove_const.hpp>\n#include <boost\/function_types\/function_arity.hpp>\n#include <boost\/function_types\/function_type.hpp>\n#include <boost\/function_types\/result_type.hpp>\n#include <boost\/function_types\/parameter_types.hpp>\n\n#include <boost\/fusion\/container\/vector\/convert.hpp>\n#include <boost\/fusion\/include\/as_vector.hpp>\n#include <boost\/fusion\/algorithm\/transformation\/transform.hpp>\n#include <boost\/fusion\/include\/transform.hpp>\n#include <boost\/fusion\/functional\/invocation\/invoke_function_object.hpp>\n#include <boost\/fusion\/container\/generation\/make_vector.hpp>\n#include <boost\/fusion\/include\/make_vector.hpp>\n\n#include <qimessaging\/metafunction.hpp>\n\nnamespace qi {\n\nMetaStorage::~MetaStorage()\n{\n  if (deleteOnDestruction)\n  {\n    for (unsigned i=0; i<parameterValues.size(); ++i)\n      parameterValues[i].destroy();\n  }\n}\n\nMetaFunctionParameters::MetaFunctionParameters()\n: invalidateOnDestruction(false)\n{\n}\n\nMetaFunctionParameters::~MetaFunctionParameters()\n{\n  \/\/ Invalidate storage if asked to and storage has something to invalidate\n  if (invalidateOnDestruction && storage && !storage->parameterValues.empty())\n  {\n    \/\/ There can be only one invalidator, assert it\n    assert(storage->hasInvalidator);\n    storage->valid = false;\n    storage->hasInvalidator = false;\n    \/\/ Clear values as they are no longer valid.\n    \/\/ buffer is still there, so if it was filled it will be used.\n    storage->parameterValues.clear();\n  }\n}\n\nMetaFunctionParameters::MetaFunctionParameters(const MetaFunctionParameters& b)\n: invalidateOnDestruction(false)\n{\n  storage = b.storage;\n}\n\n\nMetaFunctionParameters& MetaFunctionParameters::operator=(const MetaFunctionParameters& b)\n{\n  storage = b.storage;\n  invalidateOnDestruction = false;\n  return *this;\n}\n\nMetaFunctionParameters MetaFunctionParameters::copy() const\n{\n  if (!storage)\n    return MetaFunctionParameters();\n  \/\/ If storage cannot be invalidated or has only a buffer , no need to copy\n  if (!storage->hasInvalidator || storage->parameterValues.empty())\n    return MetaFunctionParameters(*this);\n  \/\/ Create a new storage, clone data in it\n  if (!storage->valid && !storage->parameterBuffer.size())\n    qiLogError(\"qi.meta\") << \"FunctionParameters were invalidated\";\n  qiLogDebug(\"qi.meta\") << \"Copying function parameters\";\n  MetaFunctionParameters res;\n  res._initStorage();\n  \/\/ We will copy values, mark for destruction\n  res.storage->deleteOnDestruction = true;\n  \/\/ Buffer is refcounted, no need to clone\n  res.storage->parameterBuffer = storage->parameterBuffer;\n  for (unsigned i=0; i<storage->parameterValues.size(); ++i)\n    res.storage->parameterValues.push_back(storage->parameterValues[i].clone());\n  return res;\n}\n\nMetaFunctionParameters::MetaFunctionParameters(Buffer b)\n: invalidateOnDestruction(false)\n{\n  _initStorage();\n  storage->parameterBuffer = b;\n}\n\nMetaFunctionParameters::MetaFunctionParameters(const std::vector<MetaValue>& value, bool invalidate)\n: invalidateOnDestruction(false)\n{\n  _initStorage();\n  storage->parameterValues = value;\n  invalidateOnDestruction = invalidate;\n  storage->hasInvalidator = invalidate;\n}\n\nvoid MetaFunctionParameters::_initStorage()\n{\n  storage = boost::make_shared<MetaStorage>();\n  storage->hasInvalidator = false;\n  storage->valid = true;\n  storage->deleteOnDestruction = false;\n}\n\nconst std::vector<MetaValue>& MetaFunctionParameters::getValues() const\n{\n  if (!storage || !storage->valid)\n  {\n    if (!storage)\n      qiLogError(\"qi.meta\") << \"getValues() on uninitialized storage\";\n    else\n      qiLogError(\"qi.meta\") << \"getValues() on invalidated storage\";\n    static std::vector<MetaValue> dummy;\n    return dummy;\n  }\n  if (storage->parameterValues.empty() && storage->parameterBuffer.size())\n  {\n    qiLogDebug(\"qi.meta\") << \"Generating values from serialization\";\n    convertToValues();\n  }\n  return storage->parameterValues;\n}\n\nconst Buffer& MetaFunctionParameters::getBuffer() const\n{\n  if (!storage)\n  {\n    qiLogError(\"qi.meta\") << \"getBuffer() on uninitialized storage.\";\n    static Buffer b;\n    return b;\n  }\n  if (!storage->parameterValues.empty() && !storage->parameterBuffer.size())\n  {\n    qiLogDebug(\"qi.meta\") << \"Generating serialization from values.\";\n    convertToBuffer();\n  }\n  return storage->parameterBuffer;\n}\n\nvoid MetaFunctionParameters::setSignature(const std::string& s)\n{\n  if (!storage)\n    qiLogError(\"qi.meta\") << \"setSignature() on uninitialized storage\";\n  storage->signature = s;\n}\n\nvoid MetaFunctionParameters::convertToValues() const\n{\n  if (!storage || storage->signature.empty())\n  {\n    qiLogError(\"qi.meta\") << \"Signature data unavailable, cannot convert to values.\";\n    return;\n  }\n  if (!storage->parameterValues.empty() || !storage->parameterBuffer.size())\n    return; \/\/ already done or nothing to do\n  Signature s(storage->signature);\n  qi::IDataStream in(storage->parameterBuffer);\n  Signature::iterator i;\n  for (i = s.begin(); i!= s.end(); ++i)\n  {\n    MetaType* m = MetaType::getCompatibleTypeWithSignature(*i);\n    if (!m)\n    {\n      qiLogError(\"qi.meta\") << \"Unable to find MetaType compatible with \" << *i;\n      storage->parameterValues.push_back(MetaValue());\n    }\n    else\n    {\n      void* val = m->deserialize(in);\n      MetaValue mv;\n      mv.type = m;\n      mv.value = val;\n      storage->parameterValues.push_back(mv);\n    }\n  }\n  storage->deleteOnDestruction = true;\n  assert (!storage->hasInvalidator);\n}\n\nvoid MetaFunctionParameters::convertToBuffer() const\n{\n  if (!storage || storage->parameterBuffer.size() || storage->parameterValues.empty())\n    return; \/\/ Already done or nothing to do\n  qi::ODataStream out(storage->parameterBuffer);\n  for (unsigned i=0; i<storage->parameterValues.size(); ++i)\n    storage->parameterValues[i].serialize(out);\n}\n\nMetaFunctionParameters::Mode MetaFunctionParameters::getMode() const\n{\n  if (storage && !storage->parameterValues.empty())\n    return MODE_METAVALUE;\n  else\n    return MODE_BUFFER;\n}\n\n\nMetaFunctionResult::MetaFunctionResult()\n{\n}\n\nMetaFunctionResult::MetaFunctionResult(Buffer buffer)\n:MetaFunctionParameters(buffer)\n{}\n\nMetaFunctionResult::MetaFunctionResult(const MetaValue& mv)\n: MetaFunctionParameters(std::vector<MetaValue>(&mv, &mv+1))\n{\n  storage->deleteOnDestruction = true;\n}\n\nMetaValue MetaFunctionResult::getValue() const\n{\n  const std::vector<MetaValue>& v = getValues();\n  if (!v.empty())\n    return v[0];\n  else\n    return MetaValue();\n}\n\n}\n\nQI_REGISTER_MAPPING(\"i\", qi::int32_t);\nQI_REGISTER_MAPPING(\"I\", qi::uint32_t);\nQI_REGISTER_MAPPING(\"d\", double);\nQI_REGISTER_MAPPING(\"f\", float);\nQI_REGISTER_MAPPING(\"[d]\", std::vector<double>);\nQI_REGISTER_MAPPING(\"[f]\", std::vector<float>);\nQI_REGISTER_MAPPING(\"[i]\", std::vector<int>);\nQI_REGISTER_MAPPING(\"s\", std::string);\nQI_REGISTER_MAPPING(\"[s]\", std::vector<std::string>);\nQI_REGISTER_MAPPING(\"r\", qi::Buffer);\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\/*\n**  Copyright (C) 2012 Aldebaran Robotics\n**  See COPYING for the license\n*\/\n\n#ifndef _SRC_SERVERCLIENT_HPP_\n#define _SRC_SERVERCLIENT_HPP_\n\n#include <qimessaging\/future.hpp>\n#include <qimessaging\/genericobject.hpp>\n#include \"remoteobject_p.hpp\"\n\nnamespace qi {\n\n  class TransportSocket;\n  class ServerClient {\n  public:\n    ServerClient(TransportSocketPtr socket);\n    ~ServerClient();\n    qi::Future<unsigned int>   registerEvent(unsigned int serviceId, unsigned eventId, unsigned int linkId);\n    qi::Future<bool>           unregisterEvent(unsigned int serviceId, unsigned eventId, unsigned linkId);\n    qi::Future<qi::MetaObject> metaObject(unsigned int serviceId, unsigned int objectId);\n    \/\/ metaobject bootstrap hack\n    unsigned int   _registerEvent(unsigned int serviceId, unsigned eventId, unsigned int linkId){};\n    bool           _unregisterEvent(unsigned int serviceId, unsigned eventId, unsigned linkId){};\n    qi::MetaObject _metaObject(unsigned int serviceId, unsigned int objectId){};\n\n  public:\n    qi::RemoteObject _remoteObject;\n    qi::ObjectPtr    _object;\n  };\n}\n\n#endif  \/\/ _SRC_SERVERCLIENT_HPP_\n<commit_msg>Dummy return value for dummy functions.<commit_after>#pragma once\n\/*\n**  Copyright (C) 2012 Aldebaran Robotics\n**  See COPYING for the license\n*\/\n\n#ifndef _SRC_SERVERCLIENT_HPP_\n#define _SRC_SERVERCLIENT_HPP_\n\n#include <qimessaging\/future.hpp>\n#include <qimessaging\/genericobject.hpp>\n#include \"remoteobject_p.hpp\"\n\nnamespace qi {\n\n  class TransportSocket;\n  class ServerClient {\n  public:\n    ServerClient(TransportSocketPtr socket);\n    ~ServerClient();\n    qi::Future<unsigned int>   registerEvent(unsigned int serviceId, unsigned eventId, unsigned int linkId);\n    qi::Future<bool>           unregisterEvent(unsigned int serviceId, unsigned eventId, unsigned linkId);\n    qi::Future<qi::MetaObject> metaObject(unsigned int serviceId, unsigned int objectId);\n    \/\/ metaobject bootstrap hack\n    unsigned int   _registerEvent(unsigned int serviceId, unsigned eventId, unsigned int linkId){return 0;};\n    bool           _unregisterEvent(unsigned int serviceId, unsigned eventId, unsigned linkId){return false;};\n    qi::MetaObject _metaObject(unsigned int serviceId, unsigned int objectId){return qi::MetaObject();};\n\n  public:\n    qi::RemoteObject _remoteObject;\n    qi::ObjectPtr    _object;\n  };\n}\n\n#endif  \/\/ _SRC_SERVERCLIENT_HPP_\n<|endoftext|>"}
{"text":"<commit_before>#include <vector>\n#include <string>\n#include <sstream>\n#include <stdlib.h>\n#include <stdio.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <time.h>\n\n#include \"CameraLogger.h\"\n#include \"bumblebee_xb3.h\"\n#include \"VideoRecorder.h\"\n\nusing namespace FlyCapture2;\n\nvoid checkError(Error error) {\n  if (error != PGRERROR_OK)\n    {\n      error.PrintErrorTrace();\n      exit(-1);\n    }        \n}\n\nvoid ImageCallback(const Image& raw, SyncBuffer* camBuff) {\n  Image* img = new Image;\n  raw.Convert( PIXEL_FORMAT_BGR, img );\n  if (!camBuff->getBuffer()->pushBack(img)) {\n    boost::mutex::scoped_lock io_lock ( *(camBuff->getMutex()) );\n    cerr << \"Warning! Buffer full, overwriting data!\" << endl;\n  }\n}\n\n\/\/ Get current date\/time, format is YYYY-MM-DD_HH:mm\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_%R\", &tstruct);\n\n  return buf;\n}\n\nint main( int argc, char* argv[] ) {\n  std::string outdir=\".\/recordings\/\";\n  mkdir(outdir.c_str(), 0755);\n\n  std::vector<std::string> names(3);\n  names[0] = \"left\"; names[1] = \"center\"; names[2] = \"right\";\n\n  float frameRate = 3.75f;\n  unsigned int recordingSize = 500;\n  \n  \/\/ create and connect to camera\n  BumblebeeXb3 cam;\n  Error error;\n  cam.format7AllCameras();\n  cam.setFrameRate(frameRate);\n  cam.StartCapture();\n\n  const unsigned int camBuffSize = 3;\n  SyncBuffer camBuff[camBuffSize];\n  for (int c = 0; c < camBuffSize; c++)\n    camBuff[c].getBuffer()->setCapacity(1000);\n\n  std::vector<Consumer<Image>* > camConsumer(3);\n  for (int c = 0; c < camBuffSize; c++)\n    camConsumer[c] = new Consumer<Image>(camBuff[c].getBuffer(),\n\t\t\t\t\t outdir+\"\/\"+currentDateTime()+\"_\"+names[c]+\".avi\",\n\t\t\t\t\t camBuff[c].getMutex(), frameRate, 1280, 960);\n\t\t\t      \n  std::vector<Image> rawImgs(camBuffSize);\n  for ( int imageCnt=0; imageCnt < recordingSize; imageCnt++ ) {\n    \/\/ Retrieve an image\n    cam.RetrieveBuffer( &rawImgs[0], &rawImgs[1], &rawImgs[2] );\n    for (int i = 0; i < rawImgs.size(); i++) \n      ImageCallback(rawImgs[i], &camBuff[i]);\n    printf( \"Grabbed image %d\\n\", imageCnt );\n  }\n\n  for (int c = 0; c < camConsumer.size(); c++) \n    camConsumer[c]->stop();\n  \n  printf( \"Done! \\n\" );\n  return 0;\n}\n<commit_msg>Fix to ensure prefixes are always the same<commit_after>#include <vector>\n#include <string>\n#include <sstream>\n#include <stdlib.h>\n#include <stdio.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <time.h>\n\n#include \"CameraLogger.h\"\n#include \"bumblebee_xb3.h\"\n#include \"VideoRecorder.h\"\n\nusing namespace FlyCapture2;\n\nvoid checkError(Error error) {\n  if (error != PGRERROR_OK)\n    {\n      error.PrintErrorTrace();\n      exit(-1);\n    }        \n}\n\nvoid ImageCallback(const Image& raw, SyncBuffer* camBuff) {\n  Image* img = new Image;\n  raw.Convert( PIXEL_FORMAT_BGR, img );\n  if (!camBuff->getBuffer()->pushBack(img)) {\n    boost::mutex::scoped_lock io_lock ( *(camBuff->getMutex()) );\n    cerr << \"Warning! Buffer full, overwriting data!\" << endl;\n  }\n}\n\n\/\/ Get current date\/time, format is YYYY-MM-DD_HH:mm\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_%R\", &tstruct);\n\n  return buf;\n}\n\nint main( int argc, char* argv[] ) {\n  std::string outdir=\".\/recordings\/\";\n  mkdir(outdir.c_str(), 0755);\n\n  std::vector<std::string> names(3);\n  names[0] = \"left\"; names[1] = \"center\"; names[2] = \"right\";\n\n  float frameRate = 3.75f;\n  unsigned int recordingSize = 500;\n  \n  \/\/ create and connect to camera\n  BumblebeeXb3 cam;\n  Error error;\n  cam.format7AllCameras();\n  cam.setFrameRate(frameRate);\n  cam.StartCapture();\n\n  const unsigned int camBuffSize = 3;\n  SyncBuffer camBuff[camBuffSize];\n  for (int c = 0; c < camBuffSize; c++)\n    camBuff[c].getBuffer()->setCapacity(1000);\n\n  std::vector<Consumer<Image>* > camConsumer(3);\n  std::string currentTime = currentDateTime();\n  for (int c = 0; c < camBuffSize; c++)\n    camConsumer[c] = new Consumer<Image>(camBuff[c].getBuffer(),\n\t\t\t\t\t outdir+\"\/\"+currentTime+\"_\"+names[c]+\".avi\",\n\t\t\t\t\t camBuff[c].getMutex(), frameRate, 1280, 960);\n\t\t\t      \n  std::vector<Image> rawImgs(camBuffSize);\n  for ( int imageCnt=0; imageCnt < recordingSize; imageCnt++ ) {\n    \/\/ Retrieve an image\n    cam.RetrieveBuffer( &rawImgs[0], &rawImgs[1], &rawImgs[2] );\n    for (int i = 0; i < rawImgs.size(); i++) \n      ImageCallback(rawImgs[i], &camBuff[i]);\n    printf( \"Grabbed image %d\\n\", imageCnt );\n  }\n\n  for (int c = 0; c < camConsumer.size(); c++) \n    camConsumer[c]->stop();\n  \n  printf( \"Done! \\n\" );\n  return 0;\n}\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\/system\/column_index.hpp\"\n\n#include \"vast\/expression_visitors.hpp\"\n#include \"vast\/load.hpp\"\n#include \"vast\/logger.hpp\"\n#include \"vast\/save.hpp\"\n\nnamespace vast::system {\n\n\/\/ -- free functions -----------------------------------------------------------\n\nnamespace {\n\n\/\/\/ Tries to initialize `res` and returns it on success, otherwise returns the\n\/\/\/ initialization error.\ncaf::expected<column_index_ptr> init_res(column_index_ptr res) {\n  auto err = res->init();\n  if (err)\n    return err;\n  return res;\n}\n\n} \/\/ namespace <anonymous>\n\ncaf::expected<column_index_ptr> make_time_index(path filename) {\n  struct impl : column_index {\n    impl(path&& fname) : column_index(timespan_type{}, std::move(fname)) {\n      \/\/ nop\n    }\n\n    void add(const event& x) override {\n      VAST_TRACE(VAST_ARG(x));\n      idx_->push_back(x.timestamp());\n    }\n  };\n  return init_res(std::make_unique<impl>(std::move(filename)));\n}\n\ncaf::expected<column_index_ptr> make_type_index(path filename) {\n  struct impl : column_index {\n    impl(path&& fname) : column_index(string_type{}, std::move(fname)) {\n      \/\/ nop\n    }\n\n    void add(const event& x) override {\n      VAST_TRACE(VAST_ARG(x));\n      idx_->push_back(x.type().name());\n    }\n  };\n  return init_res(std::make_unique<impl>(std::move(filename)));\n}\n\ncaf::expected<column_index_ptr> make_flat_data_index(path filename,\n                                                     type event_type) {\n  struct impl : column_index {\n    impl(type&& etype, path&& fname)\n      : column_index(std::move(etype), std::move(fname)) {\n        \/\/ nop\n    }\n\n    void add(const event& x) override {\n      VAST_TRACE(VAST_ARG(x));\n      if (x.type() == index_type_)\n        idx_->push_back(x.data());\n    }\n  };\n  return init_res(std::make_unique<impl>(std::move(event_type),\n                                         std::move(filename)));\n}\n\ncaf::expected<column_index_ptr> make_field_data_index(path filename,\n                                                      type field_type,\n                                                      offset off) {\n  struct impl : column_index {\n    impl(type&& ftype, path&& fname, offset o)\n      : column_index(std::move(ftype), std::move(fname)),\n        o_(o) {\n      \/\/ nop\n    }\n\n    void add(const event& x) override {\n      VAST_TRACE(VAST_ARG(x));\n      auto v = get_if<vector>(x.data());\n      if (!v)\n        return;\n      if (auto y = get(*v, o_)) {\n        idx_->push_back(*y);\n        return;\n      }\n      \/\/ If there is no data at a given offset, it means that an intermediate\n      \/\/ record is nil but we're trying to access a deeper field.\n      static const auto nil_data = data{nil};\n      idx_->push_back(nil_data);\n    }\n\n    offset o_;\n  };\n  auto res = std::make_unique<impl>(std::move(field_type), std::move(filename),\n                                    off);\n  return init_res(std::move(res));\n}\n\n\/*\ncaf::expected<bitmap> lookup(column_index::owning_pointer_vec columns,\n                             const type& event_type,\n                             const predicate& x) {\n  \/\/ For now, we require that the predicate is part of a normalized expression,\n  \/\/ i.e., LHS an extractor type and RHS of type data.\n  auto rhs = get_if<data>(pred.rhs);\n  if (!rhs)\n    return ec::invalid_query;\n  \/\/ Specialize the predicate for the type.\n  auto resolved = type_resolver{event_type}(pred);\n  if (!resolved)\n    return std::move(resolved.error());\n  auto indexers = visit(loader{self}, *resolved);\n  \/\/ Forward predicate to all available indexers.\n  if (indexers.empty()) {\n    VAST_DEBUG(self, \"did not find matching indexers for\", pred);\n    rp.deliver(bitmap{});\n    return;\n  }\n  VAST_DEBUG(self, \"asks\", indexers.size(), \"indexers\");\n  \/\/ Manual map-reduce over the indexers.\n  auto n = std::make_shared<size_t>(indexers.size());\n  auto reducer = self->system().spawn([=]() mutable -> behavior {\n    auto result = std::make_shared<bitmap>();\n    return {\n      [=](const bitmap& bm) mutable {\n        if (!bm.empty())\n          *result |= bm;\n        if (--*n == 0)\n          rp.deliver(std::move(*result));\n      },\n      [=](error& e) mutable {\n        rp.deliver(std::move(e));\n      }\n    };\n  });\n  auto msg = self->current_mailbox_element()->move_content_to_message();\n  for (auto& x : indexers)\n    send_as(reducer, x, msg);\n}\n*\/\n\n\/\/ -- constructors, destructors, and assignment operators ----------------------\n\ncolumn_index::~column_index() {\n  \/\/ nop\n}\n\n\/\/ -- persistency --------------------------------------------------------------\n\ncaf::error column_index::init() {\n  VAST_TRACE(\"\");\n  if (exists(filename_)) {\n    \/\/ Materialize the index when encountering persistent state.\n    detail::value_index_inspect_helper tmp{index_type_, idx_};\n    auto result = load(filename_, last_flush_, tmp);\n    if (!result) {\n      return result.error();\n    } else {\n      VAST_DEBUG(\"loaded value index with offset\", idx_->offset());\n    }\n  } else {\n    \/\/ Otherwise construct a new one.\n    idx_ = value_index::make(index_type_);\n    if (!idx_)\n      return make_error(ec::unspecified, \"failed to construct index\");\n  }\n  return caf::none;\n}\n\ncaf::error column_index::flush_to_disk() {\n  VAST_TRACE(\"\");\n  \/\/ Check whether there's something to write.\n  auto offset = idx_->offset();\n  if (offset == last_flush_)\n    return caf::none;\n  \/\/ Create parent directory if it doesn't exist.\n  auto dir = filename_.parent();\n  if (!exists(dir)) {\n    auto result = mkdir(dir);\n    if (!result)\n      return result.error();\n  }\n  VAST_DEBUG(\"flush index (\" << (offset - last_flush_) << '\/' << offset,\n             \"new\/total bits)\");\n  last_flush_ = offset;\n  detail::value_index_inspect_helper tmp{index_type_, idx_};\n  auto result = save(filename_, last_flush_, tmp);\n  if (!result)\n    return result.error();\n  return caf::none;\n}\n\n\/\/ -- properties -------------------------------------------------------------\n\ncaf::expected<bitmap> column_index::lookup(const predicate& pred) {\n  VAST_TRACE(VAST_ARG(pred));\n  VAST_ASSERT(idx_ != nullptr);\n  auto result = idx_->lookup(pred.op, get<data>(pred.rhs));\n  VAST_DEBUG(VAST_ARG(result));\n  return result;\n}\n\n\/\/ -- constructors, destructors, and assignment operators ----------------------\n\ncolumn_index::column_index(type index_type, path filename)\n  : index_type_(std::move(index_type)),\n    filename_(std::move(filename)) {\n}\n\n} \/\/ namespace vast::system\n<commit_msg>Remove legacy code<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\/system\/column_index.hpp\"\n\n#include \"vast\/expression_visitors.hpp\"\n#include \"vast\/load.hpp\"\n#include \"vast\/logger.hpp\"\n#include \"vast\/save.hpp\"\n\nnamespace vast::system {\n\n\/\/ -- free functions -----------------------------------------------------------\n\nnamespace {\n\n\/\/\/ Tries to initialize `res` and returns it on success, otherwise returns the\n\/\/\/ initialization error.\ncaf::expected<column_index_ptr> init_res(column_index_ptr res) {\n  auto err = res->init();\n  if (err)\n    return err;\n  return res;\n}\n\n} \/\/ namespace <anonymous>\n\ncaf::expected<column_index_ptr> make_time_index(path filename) {\n  struct impl : column_index {\n    impl(path&& fname) : column_index(timespan_type{}, std::move(fname)) {\n      \/\/ nop\n    }\n\n    void add(const event& x) override {\n      VAST_TRACE(VAST_ARG(x));\n      idx_->push_back(x.timestamp());\n    }\n  };\n  return init_res(std::make_unique<impl>(std::move(filename)));\n}\n\ncaf::expected<column_index_ptr> make_type_index(path filename) {\n  struct impl : column_index {\n    impl(path&& fname) : column_index(string_type{}, std::move(fname)) {\n      \/\/ nop\n    }\n\n    void add(const event& x) override {\n      VAST_TRACE(VAST_ARG(x));\n      idx_->push_back(x.type().name());\n    }\n  };\n  return init_res(std::make_unique<impl>(std::move(filename)));\n}\n\ncaf::expected<column_index_ptr> make_flat_data_index(path filename,\n                                                     type event_type) {\n  struct impl : column_index {\n    impl(type&& etype, path&& fname)\n      : column_index(std::move(etype), std::move(fname)) {\n        \/\/ nop\n    }\n\n    void add(const event& x) override {\n      VAST_TRACE(VAST_ARG(x));\n      if (x.type() == index_type_)\n        idx_->push_back(x.data());\n    }\n  };\n  return init_res(std::make_unique<impl>(std::move(event_type),\n                                         std::move(filename)));\n}\n\ncaf::expected<column_index_ptr> make_field_data_index(path filename,\n                                                      type field_type,\n                                                      offset off) {\n  struct impl : column_index {\n    impl(type&& ftype, path&& fname, offset o)\n      : column_index(std::move(ftype), std::move(fname)),\n        o_(o) {\n      \/\/ nop\n    }\n\n    void add(const event& x) override {\n      VAST_TRACE(VAST_ARG(x));\n      auto v = get_if<vector>(x.data());\n      if (!v)\n        return;\n      if (auto y = get(*v, o_)) {\n        idx_->push_back(*y);\n        return;\n      }\n      \/\/ If there is no data at a given offset, it means that an intermediate\n      \/\/ record is nil but we're trying to access a deeper field.\n      static const auto nil_data = data{nil};\n      idx_->push_back(nil_data);\n    }\n\n    offset o_;\n  };\n  auto res = std::make_unique<impl>(std::move(field_type), std::move(filename),\n                                    off);\n  return init_res(std::move(res));\n}\n\n\/\/ -- constructors, destructors, and assignment operators ----------------------\n\ncolumn_index::~column_index() {\n  \/\/ nop\n}\n\n\/\/ -- persistency --------------------------------------------------------------\n\ncaf::error column_index::init() {\n  VAST_TRACE(\"\");\n  if (exists(filename_)) {\n    \/\/ Materialize the index when encountering persistent state.\n    detail::value_index_inspect_helper tmp{index_type_, idx_};\n    auto result = load(filename_, last_flush_, tmp);\n    if (!result) {\n      return result.error();\n    } else {\n      VAST_DEBUG(\"loaded value index with offset\", idx_->offset());\n    }\n  } else {\n    \/\/ Otherwise construct a new one.\n    idx_ = value_index::make(index_type_);\n    if (!idx_)\n      return make_error(ec::unspecified, \"failed to construct index\");\n  }\n  return caf::none;\n}\n\ncaf::error column_index::flush_to_disk() {\n  VAST_TRACE(\"\");\n  \/\/ Check whether there's something to write.\n  auto offset = idx_->offset();\n  if (offset == last_flush_)\n    return caf::none;\n  \/\/ Create parent directory if it doesn't exist.\n  auto dir = filename_.parent();\n  if (!exists(dir)) {\n    auto result = mkdir(dir);\n    if (!result)\n      return result.error();\n  }\n  VAST_DEBUG(\"flush index (\" << (offset - last_flush_) << '\/' << offset,\n             \"new\/total bits)\");\n  last_flush_ = offset;\n  detail::value_index_inspect_helper tmp{index_type_, idx_};\n  auto result = save(filename_, last_flush_, tmp);\n  if (!result)\n    return result.error();\n  return caf::none;\n}\n\n\/\/ -- properties -------------------------------------------------------------\n\ncaf::expected<bitmap> column_index::lookup(const predicate& pred) {\n  VAST_TRACE(VAST_ARG(pred));\n  VAST_ASSERT(idx_ != nullptr);\n  auto result = idx_->lookup(pred.op, get<data>(pred.rhs));\n  VAST_DEBUG(VAST_ARG(result));\n  return result;\n}\n\n\/\/ -- constructors, destructors, and assignment operators ----------------------\n\ncolumn_index::column_index(type index_type, path filename)\n  : index_type_(std::move(index_type)),\n    filename_(std::move(filename)) {\n}\n\n} \/\/ namespace vast::system\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file utils\/filesystem.hpp\n * @brief Filesystem utility functions\n * @author Paolo D'Apice\n *\/\n\n#ifndef VIS_UTILS_FILESYSTEM_HPP\n#define VIS_UTILS_FILESYSTEM_HPP\n\n#include <boost\/filesystem.hpp>\n#include <boost\/iterator\/filter_iterator.hpp>\n#include <functional>\n#include <string>\n#include <vector>\n\nnamespace vis {\n\n\/\/\/ Match image file paths.\nstruct has_image_extension {\n    bool operator()(const boost::filesystem::path& p) {\n        const boost::filesystem::path ext = p.extension();\n        return ext == \".png\" || ext == \".jpg\";\n    }\n};\n\n\/\/\/ Get image files in given directory.\nstd::vector<boost::filesystem::path>\ngetImageFiles(const boost::filesystem::path& dir) {\n    std::vector<boost::filesystem::path> files;\n\n    boost::filesystem::directory_iterator it = boost::filesystem::directory_iterator(dir),\n                           end = boost::filesystem::directory_iterator();\n\n    std::copy(boost::make_filter_iterator<has_image_extension>(it, end),\n              boost::make_filter_iterator<has_image_extension>(end, end),\n              std::back_inserter(files));\n\n    return files;\n}\n\n\/\/ TODO unit test for this\nvoid path2string(const std::vector<boost::filesystem::path>& paths, std::vector<std::string>& names) {\n    std::transform(paths.begin(), paths.end(), std::back_inserter(names),\n                   std::mem_fun_ref<std::string,boost::filesystem::path>(&boost::filesystem::path::string));\n}\n\n} \/* namespace vis *\/\n\n#endif \/* VIS_UTILS_FILESYSTEM_HPP *\/\n\n<commit_msg>Minor refactoring<commit_after>\/**\n * @file utils\/filesystem.hpp\n * @brief Filesystem utility functions\n * @author Paolo D'Apice\n *\/\n\n#ifndef VIS_UTILS_FILESYSTEM_HPP\n#define VIS_UTILS_FILESYSTEM_HPP\n\n#include <boost\/filesystem.hpp>\n#include <boost\/iterator\/filter_iterator.hpp>\n#include <functional>\n#include <string>\n#include <vector>\n\nnamespace vis {\n\n\/\/\/ Match image file paths.\nstruct has_image_extension {\n    bool operator()(const boost::filesystem::path& p) {\n        const boost::filesystem::path ext = p.extension();\n        return ext == \".png\" || ext == \".jpg\";\n    }\n};\n\n\/\/\/ Get image files in given directory.\nstd::vector<boost::filesystem::path>\ngetImageFiles(const boost::filesystem::path& dir) {\n    std::vector<boost::filesystem::path> files;\n\n    boost::filesystem::directory_iterator\n            it = boost::filesystem::directory_iterator(dir),\n            end = boost::filesystem::directory_iterator();\n\n    std::copy(boost::make_filter_iterator<has_image_extension>(it, end),\n              boost::make_filter_iterator<has_image_extension>(end, end),\n              std::back_inserter(files));\n\n    return files;\n}\n\n\/\/ TODO unit test for this\nvoid\npath2string(const std::vector<boost::filesystem::path>& paths,\n        std::vector<std::string>& names) {\n    using boost::filesystem::path;\n    std::transform(paths.begin(), paths.end(),\n                   std::back_inserter(names),\n                   std::mem_fun_ref<std::string, path>(&path::string));\n}\n\n} \/* namespace vis *\/\n\n#endif \/* VIS_UTILS_FILESYSTEM_HPP *\/\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/sync\/sync_setup_flow.h\"\n\n#include \"base\/callback.h\"\n#include \"base\/command_line.h\"\n#include \"base\/json\/json_reader.h\"\n#include \"base\/json\/json_writer.h\"\n#include \"base\/metrics\/histogram.h\"\n#include \"base\/string_util.h\"\n#include \"base\/utf_string_conversions.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\/profiles\/profile.h\"\n#include \"chrome\/browser\/sync\/profile_sync_service.h\"\n#include \"chrome\/browser\/sync\/syncable\/model_type.h\"\n#include \"chrome\/browser\/sync\/sync_setup_flow_handler.h\"\n#include \"chrome\/browser\/ui\/browser_list.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/net\/gaia\/google_service_auth_error.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"grit\/generated_resources.h\"\n\nnamespace {\n\n\/\/ Helper function to disable password sync.\nvoid DisablePasswordSync(ProfileSyncService* service) {\n  syncable::ModelTypeSet types;\n  service->GetPreferredDataTypes(&types);\n  types.erase(syncable::PASSWORDS);\n  service->OnUserChoseDatatypes(false, types);\n}\n\n\/\/ Fills |args| for the enter passphrase screen.\nvoid GetArgsForEnterPassphrase(bool tried_creating_explicit_passphrase,\n                               bool tried_setting_explicit_passphrase,\n                               DictionaryValue* args) {\n  args->SetBoolean(\"show_passphrase\", true);\n  args->SetBoolean(\"passphrase_creation_rejected\",\n                   tried_creating_explicit_passphrase);\n  args->SetBoolean(\"passphrase_setting_rejected\",\n                   tried_setting_explicit_passphrase);\n}\n\n\/\/ Returns the next step for the non-fatal error case.\nSyncSetupWizard::State GetStepForNonFatalError(ProfileSyncService* service) {\n  if (service->IsPassphraseRequired() && service->IsUsingSecondaryPassphrase())\n      return SyncSetupWizard::ENTER_PASSPHRASE;\n\n  const GoogleServiceAuthError& error = service->GetAuthError();\n  if (error.state() == GoogleServiceAuthError::INVALID_GAIA_CREDENTIALS ||\n      error.state() == GoogleServiceAuthError::CAPTCHA_REQUIRED ||\n      error.state() == GoogleServiceAuthError::ACCOUNT_DELETED ||\n      error.state() == GoogleServiceAuthError::ACCOUNT_DISABLED ||\n      error.state() == GoogleServiceAuthError::SERVICE_UNAVAILABLE)\n    return SyncSetupWizard::GAIA_LOGIN;\n\n  NOTREACHED();\n  return SyncSetupWizard::FATAL_ERROR;\n}\n\n}  \/\/ namespace\n\nSyncConfiguration::SyncConfiguration()\n    : encrypt_all(false),\n      sync_everything(false),\n      use_secondary_passphrase(false) {\n}\n\nSyncConfiguration::~SyncConfiguration() {}\n\nSyncSetupFlow::~SyncSetupFlow() {\n  flow_handler_->SetFlow(NULL);\n}\n\n\/\/ static\nSyncSetupFlow* SyncSetupFlow::Run(ProfileSyncService* service,\n                                  SyncSetupFlowContainer* container,\n                                  SyncSetupWizard::State start,\n                                  SyncSetupWizard::State end) {\n  if (start == SyncSetupWizard::NONFATAL_ERROR)\n    start = GetStepForNonFatalError(service);\n\n  DictionaryValue args;\n  if (start == SyncSetupWizard::GAIA_LOGIN)\n    SyncSetupFlow::GetArgsForGaiaLogin(service, &args);\n  else if (start == SyncSetupWizard::CONFIGURE)\n    SyncSetupFlow::GetArgsForConfigure(service, &args);\n  else if (start == SyncSetupWizard::ENTER_PASSPHRASE)\n    GetArgsForEnterPassphrase(false, false, &args);\n\n  std::string json_args;\n  base::JSONWriter::Write(&args, false, &json_args);\n\n  return new SyncSetupFlow(start, end, json_args, container, service);\n}\n\n\/\/ static\nvoid SyncSetupFlow::GetArgsForGaiaLogin(const ProfileSyncService* service,\n                                        DictionaryValue* args) {\n  const GoogleServiceAuthError& error = service->GetAuthError();\n  if (!service->last_attempted_user_email().empty()) {\n    args->SetString(\"user\", service->last_attempted_user_email());\n    args->SetInteger(\"error\", error.state());\n    args->SetBoolean(\"editable_user\", true);\n  } else {\n    string16 user;\n    if (!service->cros_user().empty())\n      user = UTF8ToUTF16(service->cros_user());\n    else\n      user = service->GetAuthenticatedUsername();\n    args->SetString(\"user\", user);\n    args->SetInteger(\"error\", 0);\n    args->SetBoolean(\"editable_user\", user.empty());\n  }\n\n  args->SetString(\"captchaUrl\", error.captcha().image_url.spec());\n}\n\n\/\/ static\nvoid SyncSetupFlow::GetArgsForConfigure(ProfileSyncService* service,\n                                        DictionaryValue* args) {\n  \/\/ The SYNC_EVERYTHING case will set this to true.\n  args->SetBoolean(\"showSyncEverythingPage\", false);\n\n  args->SetBoolean(\"keepEverythingSynced\",\n      service->profile()->GetPrefs()->GetBoolean(prefs::kKeepEverythingSynced));\n\n  \/\/ Bookmarks, Preferences, and Themes are launched for good, there's no\n  \/\/ going back now.  Check if the other data types are registered though.\n  syncable::ModelTypeSet registered_types;\n  service->GetRegisteredDataTypes(&registered_types);\n  args->SetBoolean(\"passwordsRegistered\",\n      registered_types.count(syncable::PASSWORDS) > 0);\n  args->SetBoolean(\"autofillRegistered\",\n      registered_types.count(syncable::AUTOFILL) > 0);\n  args->SetBoolean(\"extensionsRegistered\",\n      registered_types.count(syncable::EXTENSIONS) > 0);\n  args->SetBoolean(\"typedUrlsRegistered\",\n      registered_types.count(syncable::TYPED_URLS) > 0);\n  args->SetBoolean(\"appsRegistered\",\n      registered_types.count(syncable::APPS) > 0);\n  args->SetBoolean(\"sessionsRegistered\",\n      registered_types.count(syncable::SESSIONS) > 0);\n  args->SetBoolean(\"syncBookmarks\",\n      service->profile()->GetPrefs()->GetBoolean(prefs::kSyncBookmarks));\n  args->SetBoolean(\"syncPreferences\",\n      service->profile()->GetPrefs()->GetBoolean(prefs::kSyncPreferences));\n  args->SetBoolean(\"syncThemes\",\n      service->profile()->GetPrefs()->GetBoolean(prefs::kSyncThemes));\n  args->SetBoolean(\"syncPasswords\",\n      service->profile()->GetPrefs()->GetBoolean(prefs::kSyncPasswords));\n  args->SetBoolean(\"syncAutofill\",\n      service->profile()->GetPrefs()->GetBoolean(prefs::kSyncAutofill));\n  args->SetBoolean(\"syncExtensions\",\n      service->profile()->GetPrefs()->GetBoolean(prefs::kSyncExtensions));\n  args->SetBoolean(\"syncSessions\",\n      service->profile()->GetPrefs()->GetBoolean(prefs::kSyncSessions));\n  args->SetBoolean(\"syncTypedUrls\",\n      service->profile()->GetPrefs()->GetBoolean(prefs::kSyncTypedUrls));\n  args->SetBoolean(\"syncApps\",\n      service->profile()->GetPrefs()->GetBoolean(prefs::kSyncApps));\n  args->SetBoolean(\"encryptionEnabled\",\n      CommandLine::ForCurrentProcess()->HasSwitch(\n          switches::kEnableSyncEncryption));\n\n  syncable::ModelTypeSet encrypted_types;\n  service->GetEncryptedDataTypes(&encrypted_types);\n  bool encrypt_all =\n      encrypted_types.upper_bound(syncable::PASSWORDS) != encrypted_types.end();\n  args->SetBoolean(\"encryptAllData\", encrypt_all);\n\n  \/\/ Load the parameters for the encryption tab.\n  args->SetBoolean(\"usePassphrase\", service->IsUsingSecondaryPassphrase());\n}\n\nbool SyncSetupFlow::AttachSyncSetupHandler(SyncSetupFlowHandler* handler) {\n  if (flow_handler_)\n    return false;\n\n  flow_handler_ = handler;\n  handler->SetFlow(this);\n  ActivateState(current_state_);\n  return true;\n}\n\nvoid SyncSetupFlow::Advance(SyncSetupWizard::State advance_state) {\n  if (!ShouldAdvance(advance_state)) {\n    LOG(WARNING) << \"Invalid state change from \"\n                 << current_state_ << \" to \" << advance_state;\n    return;\n  }\n\n  ActivateState(advance_state);\n}\n\nvoid SyncSetupFlow::Focus() {\n  DCHECK(flow_handler_);\n  flow_handler_->Focus();\n}\n\n\/\/ A callback to notify the delegate that the dialog closed.\nvoid SyncSetupFlow::OnDialogClosed(const std::string& json_retval) {\n  DCHECK(json_retval.empty());\n  container_->set_flow(NULL);  \/\/ Sever ties from the wizard.\n  if (current_state_ == SyncSetupWizard::DONE)\n    service_->SetSyncSetupCompleted();\n\n  \/\/ Record the state at which the user cancelled the signon dialog.\n  switch (current_state_) {\n    case SyncSetupWizard::GAIA_LOGIN:\n      ProfileSyncService::SyncEvent(\n          ProfileSyncService::CANCEL_FROM_SIGNON_WITHOUT_AUTH);\n      break;\n    case SyncSetupWizard::GAIA_SUCCESS:\n      ProfileSyncService::SyncEvent(\n          ProfileSyncService::CANCEL_DURING_SIGNON);\n      break;\n    case SyncSetupWizard::CONFIGURE:\n    case SyncSetupWizard::ENTER_PASSPHRASE:\n    case SyncSetupWizard::SETTING_UP:\n      \/\/ TODO(atwilson): Treat a close during ENTER_PASSPHRASE like a\n      \/\/ Cancel + Skip (i.e. call OnPassphraseCancel()). http:\/\/crbug.com\/74645\n      ProfileSyncService::SyncEvent(\n          ProfileSyncService::CANCEL_DURING_CONFIGURE);\n      break;\n    case SyncSetupWizard::DONE:\n      \/\/ TODO(sync): rename this histogram; it's tracking authorization AND\n      \/\/ initial sync download time.\n      UMA_HISTOGRAM_MEDIUM_TIMES(\"Sync.UserPerceivedAuthorizationTime\",\n                                 base::TimeTicks::Now() - login_start_time_);\n      break;\n    default:\n      break;\n  }\n\n  service_->OnUserCancelledDialog();\n  delete this;\n}\n\nvoid SyncSetupFlow::OnUserSubmittedAuth(const std::string& username,\n                                        const std::string& password,\n                                        const std::string& captcha,\n                                        const std::string& access_code) {\n  service_->OnUserSubmittedAuth(username, password, captcha, access_code);\n}\n\nvoid SyncSetupFlow::OnUserConfigured(const SyncConfiguration& configuration) {\n  \/\/ Go to the \"loading...\" screen.\n  Advance(SyncSetupWizard::SETTING_UP);\n\n  if (configuration.encrypt_all) {\n    syncable::ModelTypeSet data_types;\n    service_->GetRegisteredDataTypes(&data_types);\n    service_->EncryptDataTypes(data_types);\n  }\n\n  \/\/ If we are activating the passphrase, we need to have one supplied.\n  DCHECK(service_->IsUsingSecondaryPassphrase() ||\n         !configuration.use_secondary_passphrase ||\n         configuration.secondary_passphrase.length() > 0);\n\n  if (configuration.use_secondary_passphrase &&\n      !service_->IsUsingSecondaryPassphrase()) {\n    service_->SetPassphrase(configuration.secondary_passphrase, true, true);\n    tried_creating_explicit_passphrase_ = true;\n  }\n\n  service_->OnUserChoseDatatypes(configuration.sync_everything,\n                                 configuration.data_types);\n}\n\nvoid SyncSetupFlow::OnPassphraseEntry(const std::string& passphrase) {\n  Advance(SyncSetupWizard::SETTING_UP);\n  service_->SetPassphrase(passphrase, true, false);\n  tried_setting_explicit_passphrase_ = true;\n}\n\nvoid SyncSetupFlow::OnPassphraseCancel() {\n  \/\/ If the user cancels when being asked for the passphrase,\n  \/\/ just disable encrypted sync and continue setting up.\n  if (current_state_ == SyncSetupWizard::ENTER_PASSPHRASE)\n    DisablePasswordSync(service_);\n\n  Advance(SyncSetupWizard::SETTING_UP);\n}\n\n\/\/ Use static Run method to get an instance.\nSyncSetupFlow::SyncSetupFlow(SyncSetupWizard::State start_state,\n                             SyncSetupWizard::State end_state,\n                             const std::string& args,\n                             SyncSetupFlowContainer* container,\n                             ProfileSyncService* service)\n    : container_(container),\n      dialog_start_args_(args),\n      current_state_(start_state),\n      end_state_(end_state),\n      login_start_time_(base::TimeTicks::Now()),\n      flow_handler_(NULL),\n      service_(service),\n      tried_creating_explicit_passphrase_(false),\n      tried_setting_explicit_passphrase_(false) {\n}\n\n\/\/ Returns true if the flow should advance to |state| based on |current_state_|.\nbool SyncSetupFlow::ShouldAdvance(SyncSetupWizard::State state) {\n  switch (state) {\n    case SyncSetupWizard::GAIA_LOGIN:\n      return current_state_ == SyncSetupWizard::FATAL_ERROR ||\n             current_state_ == SyncSetupWizard::GAIA_LOGIN ||\n             current_state_ == SyncSetupWizard::SETTING_UP;\n    case SyncSetupWizard::GAIA_SUCCESS:\n      return current_state_ == SyncSetupWizard::GAIA_LOGIN;\n    case SyncSetupWizard::SYNC_EVERYTHING:\n    case SyncSetupWizard::CONFIGURE:\n      return current_state_ == SyncSetupWizard::GAIA_SUCCESS;\n    case SyncSetupWizard::ENTER_PASSPHRASE:\n      return current_state_ == SyncSetupWizard::SYNC_EVERYTHING ||\n             current_state_ == SyncSetupWizard::CONFIGURE ||\n             current_state_ == SyncSetupWizard::SETTING_UP;\n    case SyncSetupWizard::SETUP_ABORTED_BY_PENDING_CLEAR:\n      return (current_state_ != SyncSetupWizard::GAIA_LOGIN &&\n              current_state_ != SyncSetupWizard::GAIA_SUCCESS);\n    case SyncSetupWizard::SETTING_UP:\n      return current_state_ == SyncSetupWizard::SYNC_EVERYTHING ||\n             current_state_ == SyncSetupWizard::CONFIGURE ||\n             current_state_ == SyncSetupWizard::ENTER_PASSPHRASE;\n    case SyncSetupWizard::NONFATAL_ERROR:\n    case SyncSetupWizard::FATAL_ERROR:\n      return true;  \/\/ You can always hit the panic button.\n    case SyncSetupWizard::DONE:\n      return current_state_ == SyncSetupWizard::SETTING_UP ||\n             current_state_ == SyncSetupWizard::ENTER_PASSPHRASE;\n    default:\n      NOTREACHED() << \"Unhandled State: \" << state;\n      return false;\n  }\n}\n\nvoid SyncSetupFlow::ActivateState(SyncSetupWizard::State state) {\n  DCHECK(flow_handler_);\n\n  if (state == SyncSetupWizard::NONFATAL_ERROR)\n    state = GetStepForNonFatalError(service_);\n\n  current_state_ = state;\n\n  switch (state) {\n    case SyncSetupWizard::GAIA_LOGIN: {\n      DictionaryValue args;\n      SyncSetupFlow::GetArgsForGaiaLogin(service_, &args);\n      flow_handler_->ShowGaiaLogin(args);\n      break;\n    }\n    case SyncSetupWizard::GAIA_SUCCESS:\n      if (end_state_ == SyncSetupWizard::GAIA_SUCCESS) {\n        flow_handler_->ShowGaiaSuccessAndClose();\n        break;\n      }\n      flow_handler_->ShowGaiaSuccessAndSettingUp();\n      break;\n    case SyncSetupWizard::SYNC_EVERYTHING: {\n      DictionaryValue args;\n      SyncSetupFlow::GetArgsForConfigure(service_, &args);\n      args.SetBoolean(\"showSyncEverythingPage\", true);\n      flow_handler_->ShowConfigure(args);\n      break;\n    }\n    case SyncSetupWizard::CONFIGURE: {\n      DictionaryValue args;\n      SyncSetupFlow::GetArgsForConfigure(service_, &args);\n      flow_handler_->ShowConfigure(args);\n      break;\n    }\n    case SyncSetupWizard::ENTER_PASSPHRASE: {\n      DictionaryValue args;\n      SyncSetupFlow::GetArgsForConfigure(service_, &args);\n      GetArgsForEnterPassphrase(tried_creating_explicit_passphrase_,\n                                tried_setting_explicit_passphrase_,\n                                &args);\n      flow_handler_->ShowPassphraseEntry(args);\n      break;\n    }\n    case SyncSetupWizard::SETUP_ABORTED_BY_PENDING_CLEAR: {\n      DictionaryValue args;\n      SyncSetupFlow::GetArgsForConfigure(service_, &args);\n      args.SetBoolean(\"was_aborted\", true);\n      flow_handler_->ShowConfigure(args);\n      break;\n    }\n    case SyncSetupWizard::SETTING_UP: {\n      flow_handler_->ShowSettingUp();\n      break;\n    }\n    case SyncSetupWizard::FATAL_ERROR: {\n      \/\/ This shows the user the \"Could not connect to server\" error.\n      \/\/ TODO(sync): Update this error messaging.\n      DictionaryValue args;\n      SyncSetupFlow::GetArgsForGaiaLogin(service_, &args);\n      args.SetInteger(\"error\", GoogleServiceAuthError::CONNECTION_FAILED);\n      flow_handler_->ShowGaiaLogin(args);\n      break;\n    }\n    case SyncSetupWizard::DONE:\n      flow_handler_->ShowSetupDone(\n          UTF16ToWide(service_->GetAuthenticatedUsername()));\n      break;\n    default:\n      NOTREACHED() << \"Invalid advance state: \" << state;\n  }\n}\n<commit_msg>Check flow_handler_ before calling SyncSetupFlow::Focus()<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\/sync\/sync_setup_flow.h\"\n\n#include \"base\/callback.h\"\n#include \"base\/command_line.h\"\n#include \"base\/json\/json_reader.h\"\n#include \"base\/json\/json_writer.h\"\n#include \"base\/metrics\/histogram.h\"\n#include \"base\/string_util.h\"\n#include \"base\/utf_string_conversions.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\/profiles\/profile.h\"\n#include \"chrome\/browser\/sync\/profile_sync_service.h\"\n#include \"chrome\/browser\/sync\/syncable\/model_type.h\"\n#include \"chrome\/browser\/sync\/sync_setup_flow_handler.h\"\n#include \"chrome\/browser\/ui\/browser_list.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/net\/gaia\/google_service_auth_error.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"grit\/generated_resources.h\"\n\nnamespace {\n\n\/\/ Helper function to disable password sync.\nvoid DisablePasswordSync(ProfileSyncService* service) {\n  syncable::ModelTypeSet types;\n  service->GetPreferredDataTypes(&types);\n  types.erase(syncable::PASSWORDS);\n  service->OnUserChoseDatatypes(false, types);\n}\n\n\/\/ Fills |args| for the enter passphrase screen.\nvoid GetArgsForEnterPassphrase(bool tried_creating_explicit_passphrase,\n                               bool tried_setting_explicit_passphrase,\n                               DictionaryValue* args) {\n  args->SetBoolean(\"show_passphrase\", true);\n  args->SetBoolean(\"passphrase_creation_rejected\",\n                   tried_creating_explicit_passphrase);\n  args->SetBoolean(\"passphrase_setting_rejected\",\n                   tried_setting_explicit_passphrase);\n}\n\n\/\/ Returns the next step for the non-fatal error case.\nSyncSetupWizard::State GetStepForNonFatalError(ProfileSyncService* service) {\n  if (service->IsPassphraseRequired() && service->IsUsingSecondaryPassphrase())\n      return SyncSetupWizard::ENTER_PASSPHRASE;\n\n  const GoogleServiceAuthError& error = service->GetAuthError();\n  if (error.state() == GoogleServiceAuthError::INVALID_GAIA_CREDENTIALS ||\n      error.state() == GoogleServiceAuthError::CAPTCHA_REQUIRED ||\n      error.state() == GoogleServiceAuthError::ACCOUNT_DELETED ||\n      error.state() == GoogleServiceAuthError::ACCOUNT_DISABLED ||\n      error.state() == GoogleServiceAuthError::SERVICE_UNAVAILABLE)\n    return SyncSetupWizard::GAIA_LOGIN;\n\n  NOTREACHED();\n  return SyncSetupWizard::FATAL_ERROR;\n}\n\n}  \/\/ namespace\n\nSyncConfiguration::SyncConfiguration()\n    : encrypt_all(false),\n      sync_everything(false),\n      use_secondary_passphrase(false) {\n}\n\nSyncConfiguration::~SyncConfiguration() {}\n\nSyncSetupFlow::~SyncSetupFlow() {\n  flow_handler_->SetFlow(NULL);\n}\n\n\/\/ static\nSyncSetupFlow* SyncSetupFlow::Run(ProfileSyncService* service,\n                                  SyncSetupFlowContainer* container,\n                                  SyncSetupWizard::State start,\n                                  SyncSetupWizard::State end) {\n  if (start == SyncSetupWizard::NONFATAL_ERROR)\n    start = GetStepForNonFatalError(service);\n\n  DictionaryValue args;\n  if (start == SyncSetupWizard::GAIA_LOGIN)\n    SyncSetupFlow::GetArgsForGaiaLogin(service, &args);\n  else if (start == SyncSetupWizard::CONFIGURE)\n    SyncSetupFlow::GetArgsForConfigure(service, &args);\n  else if (start == SyncSetupWizard::ENTER_PASSPHRASE)\n    GetArgsForEnterPassphrase(false, false, &args);\n\n  std::string json_args;\n  base::JSONWriter::Write(&args, false, &json_args);\n\n  return new SyncSetupFlow(start, end, json_args, container, service);\n}\n\n\/\/ static\nvoid SyncSetupFlow::GetArgsForGaiaLogin(const ProfileSyncService* service,\n                                        DictionaryValue* args) {\n  const GoogleServiceAuthError& error = service->GetAuthError();\n  if (!service->last_attempted_user_email().empty()) {\n    args->SetString(\"user\", service->last_attempted_user_email());\n    args->SetInteger(\"error\", error.state());\n    args->SetBoolean(\"editable_user\", true);\n  } else {\n    string16 user;\n    if (!service->cros_user().empty())\n      user = UTF8ToUTF16(service->cros_user());\n    else\n      user = service->GetAuthenticatedUsername();\n    args->SetString(\"user\", user);\n    args->SetInteger(\"error\", 0);\n    args->SetBoolean(\"editable_user\", user.empty());\n  }\n\n  args->SetString(\"captchaUrl\", error.captcha().image_url.spec());\n}\n\n\/\/ static\nvoid SyncSetupFlow::GetArgsForConfigure(ProfileSyncService* service,\n                                        DictionaryValue* args) {\n  \/\/ The SYNC_EVERYTHING case will set this to true.\n  args->SetBoolean(\"showSyncEverythingPage\", false);\n\n  args->SetBoolean(\"keepEverythingSynced\",\n      service->profile()->GetPrefs()->GetBoolean(prefs::kKeepEverythingSynced));\n\n  \/\/ Bookmarks, Preferences, and Themes are launched for good, there's no\n  \/\/ going back now.  Check if the other data types are registered though.\n  syncable::ModelTypeSet registered_types;\n  service->GetRegisteredDataTypes(&registered_types);\n  args->SetBoolean(\"passwordsRegistered\",\n      registered_types.count(syncable::PASSWORDS) > 0);\n  args->SetBoolean(\"autofillRegistered\",\n      registered_types.count(syncable::AUTOFILL) > 0);\n  args->SetBoolean(\"extensionsRegistered\",\n      registered_types.count(syncable::EXTENSIONS) > 0);\n  args->SetBoolean(\"typedUrlsRegistered\",\n      registered_types.count(syncable::TYPED_URLS) > 0);\n  args->SetBoolean(\"appsRegistered\",\n      registered_types.count(syncable::APPS) > 0);\n  args->SetBoolean(\"sessionsRegistered\",\n      registered_types.count(syncable::SESSIONS) > 0);\n  args->SetBoolean(\"syncBookmarks\",\n      service->profile()->GetPrefs()->GetBoolean(prefs::kSyncBookmarks));\n  args->SetBoolean(\"syncPreferences\",\n      service->profile()->GetPrefs()->GetBoolean(prefs::kSyncPreferences));\n  args->SetBoolean(\"syncThemes\",\n      service->profile()->GetPrefs()->GetBoolean(prefs::kSyncThemes));\n  args->SetBoolean(\"syncPasswords\",\n      service->profile()->GetPrefs()->GetBoolean(prefs::kSyncPasswords));\n  args->SetBoolean(\"syncAutofill\",\n      service->profile()->GetPrefs()->GetBoolean(prefs::kSyncAutofill));\n  args->SetBoolean(\"syncExtensions\",\n      service->profile()->GetPrefs()->GetBoolean(prefs::kSyncExtensions));\n  args->SetBoolean(\"syncSessions\",\n      service->profile()->GetPrefs()->GetBoolean(prefs::kSyncSessions));\n  args->SetBoolean(\"syncTypedUrls\",\n      service->profile()->GetPrefs()->GetBoolean(prefs::kSyncTypedUrls));\n  args->SetBoolean(\"syncApps\",\n      service->profile()->GetPrefs()->GetBoolean(prefs::kSyncApps));\n  args->SetBoolean(\"encryptionEnabled\",\n      CommandLine::ForCurrentProcess()->HasSwitch(\n          switches::kEnableSyncEncryption));\n\n  syncable::ModelTypeSet encrypted_types;\n  service->GetEncryptedDataTypes(&encrypted_types);\n  bool encrypt_all =\n      encrypted_types.upper_bound(syncable::PASSWORDS) != encrypted_types.end();\n  args->SetBoolean(\"encryptAllData\", encrypt_all);\n\n  \/\/ Load the parameters for the encryption tab.\n  args->SetBoolean(\"usePassphrase\", service->IsUsingSecondaryPassphrase());\n}\n\nbool SyncSetupFlow::AttachSyncSetupHandler(SyncSetupFlowHandler* handler) {\n  if (flow_handler_)\n    return false;\n\n  flow_handler_ = handler;\n  handler->SetFlow(this);\n  ActivateState(current_state_);\n  return true;\n}\n\nvoid SyncSetupFlow::Advance(SyncSetupWizard::State advance_state) {\n  if (!ShouldAdvance(advance_state)) {\n    LOG(WARNING) << \"Invalid state change from \"\n                 << current_state_ << \" to \" << advance_state;\n    return;\n  }\n\n  ActivateState(advance_state);\n}\n\nvoid SyncSetupFlow::Focus() {\n  \/\/ This gets called from SyncSetupWizard::Focus(), and might get called\n  \/\/ before flow_handler_ is set in AttachSyncSetupHandler() (which gets\n  \/\/ called asynchronously after the UI initializes).\n  if (flow_handler_)\n    flow_handler_->Focus();\n}\n\n\/\/ A callback to notify the delegate that the dialog closed.\nvoid SyncSetupFlow::OnDialogClosed(const std::string& json_retval) {\n  DCHECK(json_retval.empty());\n  container_->set_flow(NULL);  \/\/ Sever ties from the wizard.\n  if (current_state_ == SyncSetupWizard::DONE)\n    service_->SetSyncSetupCompleted();\n\n  \/\/ Record the state at which the user cancelled the signon dialog.\n  switch (current_state_) {\n    case SyncSetupWizard::GAIA_LOGIN:\n      ProfileSyncService::SyncEvent(\n          ProfileSyncService::CANCEL_FROM_SIGNON_WITHOUT_AUTH);\n      break;\n    case SyncSetupWizard::GAIA_SUCCESS:\n      ProfileSyncService::SyncEvent(\n          ProfileSyncService::CANCEL_DURING_SIGNON);\n      break;\n    case SyncSetupWizard::CONFIGURE:\n    case SyncSetupWizard::ENTER_PASSPHRASE:\n    case SyncSetupWizard::SETTING_UP:\n      \/\/ TODO(atwilson): Treat a close during ENTER_PASSPHRASE like a\n      \/\/ Cancel + Skip (i.e. call OnPassphraseCancel()). http:\/\/crbug.com\/74645\n      ProfileSyncService::SyncEvent(\n          ProfileSyncService::CANCEL_DURING_CONFIGURE);\n      break;\n    case SyncSetupWizard::DONE:\n      \/\/ TODO(sync): rename this histogram; it's tracking authorization AND\n      \/\/ initial sync download time.\n      UMA_HISTOGRAM_MEDIUM_TIMES(\"Sync.UserPerceivedAuthorizationTime\",\n                                 base::TimeTicks::Now() - login_start_time_);\n      break;\n    default:\n      break;\n  }\n\n  service_->OnUserCancelledDialog();\n  delete this;\n}\n\nvoid SyncSetupFlow::OnUserSubmittedAuth(const std::string& username,\n                                        const std::string& password,\n                                        const std::string& captcha,\n                                        const std::string& access_code) {\n  service_->OnUserSubmittedAuth(username, password, captcha, access_code);\n}\n\nvoid SyncSetupFlow::OnUserConfigured(const SyncConfiguration& configuration) {\n  \/\/ Go to the \"loading...\" screen.\n  Advance(SyncSetupWizard::SETTING_UP);\n\n  if (configuration.encrypt_all) {\n    syncable::ModelTypeSet data_types;\n    service_->GetRegisteredDataTypes(&data_types);\n    service_->EncryptDataTypes(data_types);\n  }\n\n  \/\/ If we are activating the passphrase, we need to have one supplied.\n  DCHECK(service_->IsUsingSecondaryPassphrase() ||\n         !configuration.use_secondary_passphrase ||\n         configuration.secondary_passphrase.length() > 0);\n\n  if (configuration.use_secondary_passphrase &&\n      !service_->IsUsingSecondaryPassphrase()) {\n    service_->SetPassphrase(configuration.secondary_passphrase, true, true);\n    tried_creating_explicit_passphrase_ = true;\n  }\n\n  service_->OnUserChoseDatatypes(configuration.sync_everything,\n                                 configuration.data_types);\n}\n\nvoid SyncSetupFlow::OnPassphraseEntry(const std::string& passphrase) {\n  Advance(SyncSetupWizard::SETTING_UP);\n  service_->SetPassphrase(passphrase, true, false);\n  tried_setting_explicit_passphrase_ = true;\n}\n\nvoid SyncSetupFlow::OnPassphraseCancel() {\n  \/\/ If the user cancels when being asked for the passphrase,\n  \/\/ just disable encrypted sync and continue setting up.\n  if (current_state_ == SyncSetupWizard::ENTER_PASSPHRASE)\n    DisablePasswordSync(service_);\n\n  Advance(SyncSetupWizard::SETTING_UP);\n}\n\n\/\/ Use static Run method to get an instance.\nSyncSetupFlow::SyncSetupFlow(SyncSetupWizard::State start_state,\n                             SyncSetupWizard::State end_state,\n                             const std::string& args,\n                             SyncSetupFlowContainer* container,\n                             ProfileSyncService* service)\n    : container_(container),\n      dialog_start_args_(args),\n      current_state_(start_state),\n      end_state_(end_state),\n      login_start_time_(base::TimeTicks::Now()),\n      flow_handler_(NULL),\n      service_(service),\n      tried_creating_explicit_passphrase_(false),\n      tried_setting_explicit_passphrase_(false) {\n}\n\n\/\/ Returns true if the flow should advance to |state| based on |current_state_|.\nbool SyncSetupFlow::ShouldAdvance(SyncSetupWizard::State state) {\n  switch (state) {\n    case SyncSetupWizard::GAIA_LOGIN:\n      return current_state_ == SyncSetupWizard::FATAL_ERROR ||\n             current_state_ == SyncSetupWizard::GAIA_LOGIN ||\n             current_state_ == SyncSetupWizard::SETTING_UP;\n    case SyncSetupWizard::GAIA_SUCCESS:\n      return current_state_ == SyncSetupWizard::GAIA_LOGIN;\n    case SyncSetupWizard::SYNC_EVERYTHING:\n    case SyncSetupWizard::CONFIGURE:\n      return current_state_ == SyncSetupWizard::GAIA_SUCCESS;\n    case SyncSetupWizard::ENTER_PASSPHRASE:\n      return current_state_ == SyncSetupWizard::SYNC_EVERYTHING ||\n             current_state_ == SyncSetupWizard::CONFIGURE ||\n             current_state_ == SyncSetupWizard::SETTING_UP;\n    case SyncSetupWizard::SETUP_ABORTED_BY_PENDING_CLEAR:\n      return (current_state_ != SyncSetupWizard::GAIA_LOGIN &&\n              current_state_ != SyncSetupWizard::GAIA_SUCCESS);\n    case SyncSetupWizard::SETTING_UP:\n      return current_state_ == SyncSetupWizard::SYNC_EVERYTHING ||\n             current_state_ == SyncSetupWizard::CONFIGURE ||\n             current_state_ == SyncSetupWizard::ENTER_PASSPHRASE;\n    case SyncSetupWizard::NONFATAL_ERROR:\n    case SyncSetupWizard::FATAL_ERROR:\n      return true;  \/\/ You can always hit the panic button.\n    case SyncSetupWizard::DONE:\n      return current_state_ == SyncSetupWizard::SETTING_UP ||\n             current_state_ == SyncSetupWizard::ENTER_PASSPHRASE;\n    default:\n      NOTREACHED() << \"Unhandled State: \" << state;\n      return false;\n  }\n}\n\nvoid SyncSetupFlow::ActivateState(SyncSetupWizard::State state) {\n  DCHECK(flow_handler_);\n\n  if (state == SyncSetupWizard::NONFATAL_ERROR)\n    state = GetStepForNonFatalError(service_);\n\n  current_state_ = state;\n\n  switch (state) {\n    case SyncSetupWizard::GAIA_LOGIN: {\n      DictionaryValue args;\n      SyncSetupFlow::GetArgsForGaiaLogin(service_, &args);\n      flow_handler_->ShowGaiaLogin(args);\n      break;\n    }\n    case SyncSetupWizard::GAIA_SUCCESS:\n      if (end_state_ == SyncSetupWizard::GAIA_SUCCESS) {\n        flow_handler_->ShowGaiaSuccessAndClose();\n        break;\n      }\n      flow_handler_->ShowGaiaSuccessAndSettingUp();\n      break;\n    case SyncSetupWizard::SYNC_EVERYTHING: {\n      DictionaryValue args;\n      SyncSetupFlow::GetArgsForConfigure(service_, &args);\n      args.SetBoolean(\"showSyncEverythingPage\", true);\n      flow_handler_->ShowConfigure(args);\n      break;\n    }\n    case SyncSetupWizard::CONFIGURE: {\n      DictionaryValue args;\n      SyncSetupFlow::GetArgsForConfigure(service_, &args);\n      flow_handler_->ShowConfigure(args);\n      break;\n    }\n    case SyncSetupWizard::ENTER_PASSPHRASE: {\n      DictionaryValue args;\n      SyncSetupFlow::GetArgsForConfigure(service_, &args);\n      GetArgsForEnterPassphrase(tried_creating_explicit_passphrase_,\n                                tried_setting_explicit_passphrase_,\n                                &args);\n      flow_handler_->ShowPassphraseEntry(args);\n      break;\n    }\n    case SyncSetupWizard::SETUP_ABORTED_BY_PENDING_CLEAR: {\n      DictionaryValue args;\n      SyncSetupFlow::GetArgsForConfigure(service_, &args);\n      args.SetBoolean(\"was_aborted\", true);\n      flow_handler_->ShowConfigure(args);\n      break;\n    }\n    case SyncSetupWizard::SETTING_UP: {\n      flow_handler_->ShowSettingUp();\n      break;\n    }\n    case SyncSetupWizard::FATAL_ERROR: {\n      \/\/ This shows the user the \"Could not connect to server\" error.\n      \/\/ TODO(sync): Update this error messaging.\n      DictionaryValue args;\n      SyncSetupFlow::GetArgsForGaiaLogin(service_, &args);\n      args.SetInteger(\"error\", GoogleServiceAuthError::CONNECTION_FAILED);\n      flow_handler_->ShowGaiaLogin(args);\n      break;\n    }\n    case SyncSetupWizard::DONE:\n      flow_handler_->ShowSetupDone(\n          UTF16ToWide(service_->GetAuthenticatedUsername()));\n      break;\n    default:\n      NOTREACHED() << \"Invalid advance state: \" << state;\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  yas_processing_compare_modules.cpp\n\/\/\n\n#include \"yas_processing_compare_modules.h\"\n#include \"yas_processing_send_signal_processor.h\"\n#include \"yas_processing_receive_signal_processor.h\"\n#include \"yas_processing_module.h\"\n#include \"yas_processing_signal_event.h\"\n#include \"yas_processing_constants.h\"\n#include \"yas_fast_each.h\"\n#include \"yas_boolean.h\"\n\nusing namespace yas;\n\nnamespace yas {\nnamespace processing {\n    namespace compare {\n        struct context {\n            signal_event left_signal;\n            signal_event right_signal;\n            time left_time;\n            time right_time;\n\n            context(signal_event &&left_signal, signal_event &&right_signal)\n                : left_signal(std::move(left_signal)), right_signal(std::move(right_signal)) {\n            }\n\n            void reset(std::size_t const reserve_size) {\n                this->left_signal.reserve(reserve_size);\n                this->right_signal.reserve(reserve_size);\n                this->left_signal.resize(0);\n                this->right_signal.resize(0);\n                this->left_time = nullptr;\n                this->right_time = nullptr;\n            }\n        };\n\n        using context_sptr = std::shared_ptr<context>;\n\n        template <typename T>\n        context_sptr make_context() {\n            return std::make_shared<context>(make_signal_event<T>(0), make_signal_event<T>(0));\n        }\n\n        processor_f make_prepare_processor(context_sptr &context) {\n            return [context](time::range const &, connector_map_t const &, connector_map_t const &,\n                             stream &stream) mutable { context->reset(stream.sync_source().slice_length); };\n        }\n\n        template <typename T>\n        processor_f make_receive_signal_processor(context_sptr const &context) {\n            return processing::make_receive_signal_processor<T>(\n                [context](time::range const &time_range, sync_source const &, channel_index_t const,\n                          connector_index_t const con_idx, T const *const signal_ptr) mutable {\n                    if (con_idx == to_connector_index(input::left)) {\n                        context->left_time = time_range;\n                        context->left_signal.copy_from(signal_ptr, time_range.length);\n                    } else if (con_idx == to_connector_index(input::right)) {\n                        context->right_time = time_range;\n                        context->right_signal.copy_from(signal_ptr, time_range.length);\n                    }\n                });\n        }\n    }\n}\n}\n\ntemplate <typename T>\nprocessing::module processing::make_signal_module(compare::kind const kind) {\n    using namespace yas::processing::compare;\n\n    auto context = make_context<T>();\n\n    auto prepare_processor = make_prepare_processor(context);\n\n    auto receive_processor = make_receive_signal_processor<T>(context);\n\n    auto send_processor = processing::make_send_signal_processor<boolean>(\n        [context, kind](processing::time::range const &time_range, sync_source const &, channel_index_t const,\n                        connector_index_t const con_idx, boolean *const signal_ptr) {\n            if (con_idx == to_connector_index(output::result)) {\n                auto out_each = make_fast_each(signal_ptr, time_range.length);\n                processing::signal_event &left_signal = context->left_signal;\n                processing::signal_event &right_signal = context->right_signal;\n                auto const *left_ptr = left_signal.data<T>();\n                auto const *right_ptr = right_signal.data<T>();\n                processing::time const &left_time = context->left_time;\n                processing::time const &right_time = context->right_time;\n                auto const left_offset = left_time ? time_range.frame - left_time.get<time::range>().frame : 0;\n                auto const right_offset = right_time ? time_range.frame - right_time.get<time::range>().frame : 0;\n                auto const &left_length = left_time ? left_time.get<time::range>().length : constant::zero_length;\n                auto const &right_length = right_time ? right_time.get<time::range>().length : constant::zero_length;\n\n                while (yas_fast_each_next(out_each)) {\n                    auto const &idx = yas_fast_each_index(out_each);\n                    auto const left_idx = idx + left_offset;\n                    auto const right_idx = idx + right_offset;\n                    auto const &left_value = (left_idx >= 0 && left_idx < left_length) ? left_ptr[left_idx] : 0;\n                    auto const &right_value = (right_idx >= 0 && right_idx < right_length) ? right_ptr[right_idx] : 0;\n\n                    switch (kind) {\n                        case kind::is_equal:\n                            yas_fast_each_value(out_each) = left_value == right_value;\n                            break;\n                        case kind::is_not_equal:\n                            yas_fast_each_value(out_each) = left_value != right_value;\n                            break;\n\n                        case kind::is_greater:\n                            yas_fast_each_value(out_each) = left_value > right_value;\n                            break;\n                        case kind::is_greater_equal:\n                            yas_fast_each_value(out_each) = left_value >= right_value;\n                            break;\n                        case kind::is_less:\n                            yas_fast_each_value(out_each) = left_value < right_value;\n                            break;\n                        case kind::is_less_equal:\n                            yas_fast_each_value(out_each) = left_value <= right_value;\n                            break;\n                    }\n                }\n            }\n        });\n\n    return processing::module{{std::move(prepare_processor), std::move(receive_processor), std::move(send_processor)}};\n}\n\ntemplate processing::module processing::make_signal_module<double>(compare::kind const);\ntemplate processing::module processing::make_signal_module<float>(compare::kind const);\ntemplate processing::module processing::make_signal_module<int64_t>(compare::kind const);\ntemplate processing::module processing::make_signal_module<int32_t>(compare::kind const);\ntemplate processing::module processing::make_signal_module<int16_t>(compare::kind const);\ntemplate processing::module processing::make_signal_module<int8_t>(compare::kind const);\ntemplate processing::module processing::make_signal_module<uint64_t>(compare::kind const);\ntemplate processing::module processing::make_signal_module<uint32_t>(compare::kind const);\ntemplate processing::module processing::make_signal_module<uint16_t>(compare::kind const);\ntemplate processing::module processing::make_signal_module<uint8_t>(compare::kind const);\n<commit_msg>compare boolean<commit_after>\/\/\n\/\/  yas_processing_compare_modules.cpp\n\/\/\n\n#include \"yas_processing_compare_modules.h\"\n#include \"yas_processing_send_signal_processor.h\"\n#include \"yas_processing_receive_signal_processor.h\"\n#include \"yas_processing_module.h\"\n#include \"yas_processing_signal_event.h\"\n#include \"yas_processing_constants.h\"\n#include \"yas_fast_each.h\"\n#include \"yas_boolean.h\"\n\nusing namespace yas;\n\nnamespace yas {\nnamespace processing {\n    namespace compare {\n        struct context {\n            signal_event left_signal;\n            signal_event right_signal;\n            time left_time;\n            time right_time;\n\n            context(signal_event &&left_signal, signal_event &&right_signal)\n                : left_signal(std::move(left_signal)), right_signal(std::move(right_signal)) {\n            }\n\n            void reset(std::size_t const reserve_size) {\n                this->left_signal.reserve(reserve_size);\n                this->right_signal.reserve(reserve_size);\n                this->left_signal.resize(0);\n                this->right_signal.resize(0);\n                this->left_time = nullptr;\n                this->right_time = nullptr;\n            }\n        };\n\n        using context_sptr = std::shared_ptr<context>;\n\n        template <typename T>\n        context_sptr make_context() {\n            return std::make_shared<context>(make_signal_event<T>(0), make_signal_event<T>(0));\n        }\n\n        processor_f make_prepare_processor(context_sptr &context) {\n            return [context](time::range const &, connector_map_t const &, connector_map_t const &,\n                             stream &stream) mutable { context->reset(stream.sync_source().slice_length); };\n        }\n\n        template <typename T>\n        processor_f make_receive_signal_processor(context_sptr const &context) {\n            return processing::make_receive_signal_processor<T>(\n                [context](time::range const &time_range, sync_source const &, channel_index_t const,\n                          connector_index_t const con_idx, T const *const signal_ptr) mutable {\n                    if (con_idx == to_connector_index(input::left)) {\n                        context->left_time = time_range;\n                        context->left_signal.copy_from(signal_ptr, time_range.length);\n                    } else if (con_idx == to_connector_index(input::right)) {\n                        context->right_time = time_range;\n                        context->right_signal.copy_from(signal_ptr, time_range.length);\n                    }\n                });\n        }\n    }\n}\n}\n\ntemplate <typename T>\nprocessing::module processing::make_signal_module(compare::kind const kind) {\n    using namespace yas::processing::compare;\n\n    auto context = make_context<T>();\n\n    auto prepare_processor = make_prepare_processor(context);\n\n    auto receive_processor = make_receive_signal_processor<T>(context);\n\n    auto send_processor = processing::make_send_signal_processor<boolean>(\n        [context, kind](processing::time::range const &time_range, sync_source const &, channel_index_t const,\n                        connector_index_t const con_idx, boolean *const signal_ptr) {\n            if (con_idx == to_connector_index(output::result)) {\n                auto out_each = make_fast_each(signal_ptr, time_range.length);\n                processing::signal_event &left_signal = context->left_signal;\n                processing::signal_event &right_signal = context->right_signal;\n                auto const *left_ptr = left_signal.data<T>();\n                auto const *right_ptr = right_signal.data<T>();\n                processing::time const &left_time = context->left_time;\n                processing::time const &right_time = context->right_time;\n                auto const left_offset = left_time ? time_range.frame - left_time.get<time::range>().frame : 0;\n                auto const right_offset = right_time ? time_range.frame - right_time.get<time::range>().frame : 0;\n                auto const &left_length = left_time ? left_time.get<time::range>().length : constant::zero_length;\n                auto const &right_length = right_time ? right_time.get<time::range>().length : constant::zero_length;\n\n                while (yas_fast_each_next(out_each)) {\n                    auto const &idx = yas_fast_each_index(out_each);\n                    auto const left_idx = idx + left_offset;\n                    auto const right_idx = idx + right_offset;\n                    auto const &left_value = (left_idx >= 0 && left_idx < left_length) ? left_ptr[left_idx] : 0;\n                    auto const &right_value = (right_idx >= 0 && right_idx < right_length) ? right_ptr[right_idx] : 0;\n\n                    switch (kind) {\n                        case kind::is_equal:\n                            yas_fast_each_value(out_each) = left_value == right_value;\n                            break;\n                        case kind::is_not_equal:\n                            yas_fast_each_value(out_each) = left_value != right_value;\n                            break;\n\n                        case kind::is_greater:\n                            yas_fast_each_value(out_each) = left_value > right_value;\n                            break;\n                        case kind::is_greater_equal:\n                            yas_fast_each_value(out_each) = left_value >= right_value;\n                            break;\n                        case kind::is_less:\n                            yas_fast_each_value(out_each) = left_value < right_value;\n                            break;\n                        case kind::is_less_equal:\n                            yas_fast_each_value(out_each) = left_value <= right_value;\n                            break;\n                    }\n                }\n            }\n        });\n\n    return processing::module{{std::move(prepare_processor), std::move(receive_processor), std::move(send_processor)}};\n}\n\ntemplate processing::module processing::make_signal_module<double>(compare::kind const);\ntemplate processing::module processing::make_signal_module<float>(compare::kind const);\ntemplate processing::module processing::make_signal_module<int64_t>(compare::kind const);\ntemplate processing::module processing::make_signal_module<int32_t>(compare::kind const);\ntemplate processing::module processing::make_signal_module<int16_t>(compare::kind const);\ntemplate processing::module processing::make_signal_module<int8_t>(compare::kind const);\ntemplate processing::module processing::make_signal_module<uint64_t>(compare::kind const);\ntemplate processing::module processing::make_signal_module<uint32_t>(compare::kind const);\ntemplate processing::module processing::make_signal_module<uint16_t>(compare::kind const);\ntemplate processing::module processing::make_signal_module<uint8_t>(compare::kind const);\ntemplate processing::module processing::make_signal_module<boolean>(compare::kind const);\n<|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/gui:$Name:  $:$Id: TGComboBox.cxx,v 1.2 2000\/09\/29 08:57:05 rdm Exp $\n\/\/ Author: Fons Rademakers   13\/01\/98\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    This source is based on Xclass95, a Win95-looking GUI toolkit.\n    Copyright (C) 1996, 1997 David Barth, Ricky Ralston, Hector Peraza.\n\n    Xclass95 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**************************************************************************\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/                                                                      \/\/\n\/\/ TGComboBox, TGComboBoxPopup                                          \/\/\n\/\/                                                                      \/\/\n\/\/ A combobox (also known as a drop down listbox) allows the selection  \/\/\n\/\/ of one item out of a list of items. The selected item is visible in  \/\/\n\/\/ a little window. To view the list of possible items one has to click \/\/\n\/\/ on a button on the right of the little window. This will drop down   \/\/\n\/\/ a listbox. After selecting an item from the listbox the box will     \/\/\n\/\/ disappear and the newly selected item will be shown in the little    \/\/\n\/\/ window.                                                              \/\/\n\/\/                                                                      \/\/\n\/\/ The TGComboBox is user callable. The TGComboBoxPopup is a service    \/\/\n\/\/ class of the combobox.                                               \/\/\n\/\/                                                                      \/\/\n\/\/ Selecting an item in the combobox will generate the event:           \/\/\n\/\/ kC_COMMAND, kCM_COMBOBOX, combobox id, item id.                      \/\/\n\/\/                                                                      \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"TGComboBox.h\"\n#include \"TGScrollBar.h\"\n#include \"TGPicture.h\"\n\nClassImp(TGComboBoxPopup)\nClassImp(TGComboBox)\n\n\n\/\/______________________________________________________________________________\nTGComboBoxPopup::TGComboBoxPopup(const TGWindow *p, UInt_t w, UInt_t h,\n                                 UInt_t options, ULong_t back) :\n   TGCompositeFrame (p, w, h, options, back)\n{\n   \/\/ Create a combo box popup frame.\n\n   SetWindowAttributes_t wattr;\n\n   wattr.fMask = kWAOverrideRedirect | kWASaveUnder |\n                 kWABorderPixel      | kWABorderWidth;\n   wattr.fOverrideRedirect = kTRUE;\n   wattr.fSaveUnder = kTRUE;\n   wattr.fBorderPixel = fgBlackPixel;\n   wattr.fBorderWidth = 1;\n   gVirtualX->ChangeWindowAttributes(fId, &wattr);\n\n   gVirtualX->SelectInput(fId, kStructureNotifyMask);\n}\n\n\/\/______________________________________________________________________________\nBool_t TGComboBoxPopup::HandleButton(Event_t *event)\n{\n   \/\/ Handle mouse button event in combo box popup.\n\n   if (event->fType == kButtonRelease) EndPopup();\n   return kTRUE;\n}\n\n\/\/______________________________________________________________________________\nvoid TGComboBoxPopup::EndPopup()\n{\n   \/\/ Ungrab pointer and unmap popup window.\n\n   gVirtualX->GrabPointer(0, 0, 0, 0, kFALSE);\n   UnmapWindow();\n}\n\n\/\/______________________________________________________________________________\nvoid TGComboBoxPopup::PlacePopup(Int_t x, Int_t y, UInt_t w, UInt_t h)\n{\n   \/\/ Popup combo box popup window at the specified place.\n\n   Int_t  rx, ry;\n   UInt_t rw, rh;\n\n   \/\/ Parent is root window for the popup:\n   gVirtualX->GetWindowSize(fParent->GetId(), rx, ry, rw, rh);\n\n   if (x < 0) x = 0;\n   if (x + fWidth > rw) x = rw - fWidth;\n   if (y < 0) y = 0;\n   if (y + fHeight > rh) y = rh - fHeight;\n\n   MoveResize(x, y, w, h);\n   MapSubwindows();\n   Layout();\n   MapRaised();\n\n   gVirtualX->GrabPointer(fId, kButtonPressMask | kButtonReleaseMask |\n                     kPointerMotionMask, kNone, fgDefaultCursor);\n\n   fClient->WaitForUnmap(this);\n   EndPopup();\n}\n\n\n\/\/______________________________________________________________________________\nTGComboBox::TGComboBox(const TGWindow *p, Int_t id, UInt_t options,\n                       ULong_t back) :\n   TGCompositeFrame (p, 10, 10, options | kOwnBackground, back)\n{\n   \/\/ Create a combo box widget.\n\n   fComboBoxId = id;\n   fMsgWindow = p;\n   fBpic = fClient->GetPicture(\"arrow_down.xpm\");\n\n   if (!fBpic)\n      Error(\"TGComboBox\", \"arrow_down.xpm not found\");\n\n   fSelEntry = new TGTextLBEntry(this, new TGString(\"\"), 0, TGTextLBEntry::GetDefaultGC()());\n   fDDButton = new TGScrollBarElement(this, fBpic, kDefaultScrollBarWidth,\n                                      kDefaultScrollBarWidth, kRaisedFrame);\n\n   fSelEntry->ChangeOptions(fSelEntry->GetOptions() | kOwnBackground);\n\n   AddFrame(fSelEntry, fLhs = new TGLayoutHints(kLHintsLeft |\n                                                kLHintsExpandY | kLHintsExpandX));\n                                                \/\/0, 0, 1, 0));\n   AddFrame(fDDButton, fLhb = new TGLayoutHints(kLHintsRight |\n                                                kLHintsExpandY));\n\n   fComboFrame = new TGComboBoxPopup(fClient->GetRoot(), 100, 100, kVerticalFrame);\n\n   fListBox = new TGListBox(fComboFrame, fComboBoxId, kChildFrame);\n   fListBox->Resize(100, 100);\n   fListBox->Associate(this);\n\n   fComboFrame->AddFrame(fListBox, fLhdd = new TGLayoutHints(kLHintsExpandX |\n                                                             kLHintsExpandY));\n   fComboFrame->MapSubwindows();\n   fComboFrame->Resize(fComboFrame->GetDefaultSize());\n\n   gVirtualX->GrabButton(fId, kButton1, kAnyModifier, kButtonPressMask |\n                    kButtonReleaseMask, kNone, kNone);\n\n   \/\/ Drop down listbox of combo box should react to pointer motion\n   \/\/ so it will be able to Activate() (i.e. highlight) the different\n   \/\/ items when the mouse crosses.\n   gVirtualX->SelectInput(fListBox->GetContainer()->GetId(), kButtonPressMask |\n                     kButtonReleaseMask | kPointerMotionMask);\n}\n\n\/\/______________________________________________________________________________\nTGComboBox::~TGComboBox()\n{\n   \/\/ Delete a combo box widget.\n\n   delete fDDButton;\n   delete fSelEntry;\n   delete fListBox;\n   delete fComboFrame;\n   delete fLhs;\n   delete fLhb;\n   delete fLhdd;\n}\n\n\/\/______________________________________________________________________________\nvoid TGComboBox::DrawBorder()\n{\n   \/\/ Draw border of combo box widget.\n\n   switch (fOptions & (kSunkenFrame | kRaisedFrame | kDoubleBorder)) {\n      case kSunkenFrame | kDoubleBorder:\n         gVirtualX->DrawLine(fId, fgShadowGC(), 0, 0, fWidth-2, 0);\n         gVirtualX->DrawLine(fId, fgShadowGC(), 0, 0, 0, fHeight-2);\n         gVirtualX->DrawLine(fId, fgBlackGC(), 1, 1, fWidth-3, 1);\n         gVirtualX->DrawLine(fId, fgBlackGC(), 1, 1, 1, fHeight-3);\n\n         gVirtualX->DrawLine(fId, fgHilightGC(), 0, fHeight-1, fWidth-1, fHeight-1);\n         gVirtualX->DrawLine(fId, fgHilightGC(), fWidth-1, fHeight-1, fWidth-1, 0);\n         gVirtualX->DrawLine(fId, fgBckgndGC(),  1, fHeight-2, fWidth-2, fHeight-2);\n         gVirtualX->DrawLine(fId, fgBckgndGC(),  fWidth-2, 1, fWidth-2, fHeight-2);\n         break;\n\n      default:\n         TGCompositeFrame::DrawBorder();\n         break;\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TGComboBox::SetTopEntry(TGLBEntry *e, TGLayoutHints *lh)\n{\n   \/\/ Set a new combo box value (normally update of text string in\n   \/\/ fSelEntry is done via fSelEntry::Update()).\n\n   RemoveFrame(fSelEntry);\n   fSelEntry->DestroyWindow();\n   delete fSelEntry;\n   delete fLhs;\n   fSelEntry = e;\n   fLhs = lh;\n   AddFrame(fSelEntry, fLhs);\n   Layout();\n}\n\n\/\/______________________________________________________________________________\nvoid TGComboBox::Select(Int_t id)\n{\n   \/\/ Make the selected item visible in the combo box window.\n\n   TGLBEntry *e;\n\n   e = fListBox->Select(id);\n   if (e) {\n      fSelEntry->Update(e);\n      Layout();\n   }\n}\n\n\/\/______________________________________________________________________________\nBool_t TGComboBox::HandleButton(Event_t *event)\n{\n   \/\/ Handle mouse button events in the combo box.\n\n   if (event->fType == kButtonPress) {\n      if ((Window_t)event->fUser[0] == fDDButton->GetId())   \/\/ fUser[0] = child window\n         fDDButton->SetState(kButtonDown);\n   } else {\n      int      ax, ay;\n      Window_t wdummy;\n\n      fDDButton->SetState(kButtonUp);\n      gVirtualX->TranslateCoordinates(fId, (fComboFrame->GetParent())->GetId(),\n                                 0, fHeight, ax, ay, wdummy);\n\n      fComboFrame->PlacePopup(ax, ay, fWidth-2, fComboFrame->GetDefaultHeight());\n   }\n   return kTRUE;\n}\n\n\/\/______________________________________________________________________________\nBool_t TGComboBox::ProcessMessage(Long_t msg, Long_t, Long_t parm2)\n{\n   \/\/ Process messages generated by the listbox and forward\n   \/\/ messages to the combobox message handling window. Parm2 contains\n   \/\/ the id of the selected listbox entry.\n\n   TGLBEntry *e;\n\n   switch (GET_MSG(msg)) {\n      case kC_COMMAND:\n         switch (GET_SUBMSG(msg)) {\n            case kCM_LISTBOX:\n               e = fListBox->GetSelectedEntry();\n               fSelEntry->Update(e);\n               Layout();\n               fComboFrame->EndPopup();\n               SendMessage(fMsgWindow, MK_MSG(kC_COMMAND, kCM_COMBOBOX),\n                           fComboBoxId, parm2);\n            break;\n         }\n         break;\n\n      default:\n         break;\n   }\n   return kTRUE;\n}\n<commit_msg>remove workaround for Sun CC compiler bug.<commit_after>\/\/ @(#)root\/gui:$Name:  $:$Id: TGComboBox.cxx,v 1.3 2000\/09\/29 13:55:24 rdm Exp $\n\/\/ Author: Fons Rademakers   13\/01\/98\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    This source is based on Xclass95, a Win95-looking GUI toolkit.\n    Copyright (C) 1996, 1997 David Barth, Ricky Ralston, Hector Peraza.\n\n    Xclass95 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**************************************************************************\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/                                                                      \/\/\n\/\/ TGComboBox, TGComboBoxPopup                                          \/\/\n\/\/                                                                      \/\/\n\/\/ A combobox (also known as a drop down listbox) allows the selection  \/\/\n\/\/ of one item out of a list of items. The selected item is visible in  \/\/\n\/\/ a little window. To view the list of possible items one has to click \/\/\n\/\/ on a button on the right of the little window. This will drop down   \/\/\n\/\/ a listbox. After selecting an item from the listbox the box will     \/\/\n\/\/ disappear and the newly selected item will be shown in the little    \/\/\n\/\/ window.                                                              \/\/\n\/\/                                                                      \/\/\n\/\/ The TGComboBox is user callable. The TGComboBoxPopup is a service    \/\/\n\/\/ class of the combobox.                                               \/\/\n\/\/                                                                      \/\/\n\/\/ Selecting an item in the combobox will generate the event:           \/\/\n\/\/ kC_COMMAND, kCM_COMBOBOX, combobox id, item id.                      \/\/\n\/\/                                                                      \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"TGComboBox.h\"\n#include \"TGScrollBar.h\"\n#include \"TGPicture.h\"\n\nClassImp(TGComboBoxPopup)\nClassImp(TGComboBox)\n\n\n\/\/______________________________________________________________________________\nTGComboBoxPopup::TGComboBoxPopup(const TGWindow *p, UInt_t w, UInt_t h,\n                                 UInt_t options, ULong_t back) :\n   TGCompositeFrame (p, w, h, options, back)\n{\n   \/\/ Create a combo box popup frame.\n\n   SetWindowAttributes_t wattr;\n\n   wattr.fMask = kWAOverrideRedirect | kWASaveUnder |\n                 kWABorderPixel      | kWABorderWidth;\n   wattr.fOverrideRedirect = kTRUE;\n   wattr.fSaveUnder = kTRUE;\n   wattr.fBorderPixel = fgBlackPixel;\n   wattr.fBorderWidth = 1;\n   gVirtualX->ChangeWindowAttributes(fId, &wattr);\n\n   gVirtualX->SelectInput(fId, kStructureNotifyMask);\n}\n\n\/\/______________________________________________________________________________\nBool_t TGComboBoxPopup::HandleButton(Event_t *event)\n{\n   \/\/ Handle mouse button event in combo box popup.\n\n   if (event->fType == kButtonRelease) EndPopup();\n   return kTRUE;\n}\n\n\/\/______________________________________________________________________________\nvoid TGComboBoxPopup::EndPopup()\n{\n   \/\/ Ungrab pointer and unmap popup window.\n\n   gVirtualX->GrabPointer(0, 0, 0, 0, kFALSE);\n   UnmapWindow();\n}\n\n\/\/______________________________________________________________________________\nvoid TGComboBoxPopup::PlacePopup(Int_t x, Int_t y, UInt_t w, UInt_t h)\n{\n   \/\/ Popup combo box popup window at the specified place.\n\n   Int_t  rx, ry;\n   UInt_t rw, rh;\n\n   \/\/ Parent is root window for the popup:\n   gVirtualX->GetWindowSize(fParent->GetId(), rx, ry, rw, rh);\n\n   if (x < 0) x = 0;\n   if (x + fWidth > rw) x = rw - fWidth;\n   if (y < 0) y = 0;\n   if (y + fHeight > rh) y = rh - fHeight;\n\n   MoveResize(x, y, w, h);\n   MapSubwindows();\n   Layout();\n   MapRaised();\n\n   gVirtualX->GrabPointer(fId, kButtonPressMask | kButtonReleaseMask |\n                     kPointerMotionMask, kNone, fgDefaultCursor);\n\n   fClient->WaitForUnmap(this);\n   EndPopup();\n}\n\n\n\/\/______________________________________________________________________________\nTGComboBox::TGComboBox(const TGWindow *p, Int_t id, UInt_t options,\n                       ULong_t back) :\n   TGCompositeFrame (p, 10, 10, options | kOwnBackground, back)\n{\n   \/\/ Create a combo box widget.\n\n   fComboBoxId = id;\n   fMsgWindow = p;\n   fBpic = fClient->GetPicture(\"arrow_down.xpm\");\n\n   if (!fBpic)\n      Error(\"TGComboBox\", \"arrow_down.xpm not found\");\n\n   fSelEntry = new TGTextLBEntry(this, new TGString(\"\"), 0);\n   fDDButton = new TGScrollBarElement(this, fBpic, kDefaultScrollBarWidth,\n                                      kDefaultScrollBarWidth, kRaisedFrame);\n\n   fSelEntry->ChangeOptions(fSelEntry->GetOptions() | kOwnBackground);\n\n   AddFrame(fSelEntry, fLhs = new TGLayoutHints(kLHintsLeft |\n                                                kLHintsExpandY | kLHintsExpandX));\n                                                \/\/0, 0, 1, 0));\n   AddFrame(fDDButton, fLhb = new TGLayoutHints(kLHintsRight |\n                                                kLHintsExpandY));\n\n   fComboFrame = new TGComboBoxPopup(fClient->GetRoot(), 100, 100, kVerticalFrame);\n\n   fListBox = new TGListBox(fComboFrame, fComboBoxId, kChildFrame);\n   fListBox->Resize(100, 100);\n   fListBox->Associate(this);\n\n   fComboFrame->AddFrame(fListBox, fLhdd = new TGLayoutHints(kLHintsExpandX |\n                                                             kLHintsExpandY));\n   fComboFrame->MapSubwindows();\n   fComboFrame->Resize(fComboFrame->GetDefaultSize());\n\n   gVirtualX->GrabButton(fId, kButton1, kAnyModifier, kButtonPressMask |\n                    kButtonReleaseMask, kNone, kNone);\n\n   \/\/ Drop down listbox of combo box should react to pointer motion\n   \/\/ so it will be able to Activate() (i.e. highlight) the different\n   \/\/ items when the mouse crosses.\n   gVirtualX->SelectInput(fListBox->GetContainer()->GetId(), kButtonPressMask |\n                     kButtonReleaseMask | kPointerMotionMask);\n}\n\n\/\/______________________________________________________________________________\nTGComboBox::~TGComboBox()\n{\n   \/\/ Delete a combo box widget.\n\n   delete fDDButton;\n   delete fSelEntry;\n   delete fListBox;\n   delete fComboFrame;\n   delete fLhs;\n   delete fLhb;\n   delete fLhdd;\n}\n\n\/\/______________________________________________________________________________\nvoid TGComboBox::DrawBorder()\n{\n   \/\/ Draw border of combo box widget.\n\n   switch (fOptions & (kSunkenFrame | kRaisedFrame | kDoubleBorder)) {\n      case kSunkenFrame | kDoubleBorder:\n         gVirtualX->DrawLine(fId, fgShadowGC(), 0, 0, fWidth-2, 0);\n         gVirtualX->DrawLine(fId, fgShadowGC(), 0, 0, 0, fHeight-2);\n         gVirtualX->DrawLine(fId, fgBlackGC(), 1, 1, fWidth-3, 1);\n         gVirtualX->DrawLine(fId, fgBlackGC(), 1, 1, 1, fHeight-3);\n\n         gVirtualX->DrawLine(fId, fgHilightGC(), 0, fHeight-1, fWidth-1, fHeight-1);\n         gVirtualX->DrawLine(fId, fgHilightGC(), fWidth-1, fHeight-1, fWidth-1, 0);\n         gVirtualX->DrawLine(fId, fgBckgndGC(),  1, fHeight-2, fWidth-2, fHeight-2);\n         gVirtualX->DrawLine(fId, fgBckgndGC(),  fWidth-2, 1, fWidth-2, fHeight-2);\n         break;\n\n      default:\n         TGCompositeFrame::DrawBorder();\n         break;\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TGComboBox::SetTopEntry(TGLBEntry *e, TGLayoutHints *lh)\n{\n   \/\/ Set a new combo box value (normally update of text string in\n   \/\/ fSelEntry is done via fSelEntry::Update()).\n\n   RemoveFrame(fSelEntry);\n   fSelEntry->DestroyWindow();\n   delete fSelEntry;\n   delete fLhs;\n   fSelEntry = e;\n   fLhs = lh;\n   AddFrame(fSelEntry, fLhs);\n   Layout();\n}\n\n\/\/______________________________________________________________________________\nvoid TGComboBox::Select(Int_t id)\n{\n   \/\/ Make the selected item visible in the combo box window.\n\n   TGLBEntry *e;\n\n   e = fListBox->Select(id);\n   if (e) {\n      fSelEntry->Update(e);\n      Layout();\n   }\n}\n\n\/\/______________________________________________________________________________\nBool_t TGComboBox::HandleButton(Event_t *event)\n{\n   \/\/ Handle mouse button events in the combo box.\n\n   if (event->fType == kButtonPress) {\n      if ((Window_t)event->fUser[0] == fDDButton->GetId())   \/\/ fUser[0] = child window\n         fDDButton->SetState(kButtonDown);\n   } else {\n      int      ax, ay;\n      Window_t wdummy;\n\n      fDDButton->SetState(kButtonUp);\n      gVirtualX->TranslateCoordinates(fId, (fComboFrame->GetParent())->GetId(),\n                                 0, fHeight, ax, ay, wdummy);\n\n      fComboFrame->PlacePopup(ax, ay, fWidth-2, fComboFrame->GetDefaultHeight());\n   }\n   return kTRUE;\n}\n\n\/\/______________________________________________________________________________\nBool_t TGComboBox::ProcessMessage(Long_t msg, Long_t, Long_t parm2)\n{\n   \/\/ Process messages generated by the listbox and forward\n   \/\/ messages to the combobox message handling window. Parm2 contains\n   \/\/ the id of the selected listbox entry.\n\n   TGLBEntry *e;\n\n   switch (GET_MSG(msg)) {\n      case kC_COMMAND:\n         switch (GET_SUBMSG(msg)) {\n            case kCM_LISTBOX:\n               e = fListBox->GetSelectedEntry();\n               fSelEntry->Update(e);\n               Layout();\n               fComboFrame->EndPopup();\n               SendMessage(fMsgWindow, MK_MSG(kC_COMMAND, kCM_COMBOBOX),\n                           fComboBoxId, parm2);\n            break;\n         }\n         break;\n\n      default:\n         break;\n   }\n   return kTRUE;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: XMLStylesExportHelper.hxx,v $\n *\n *  $Revision: 1.28 $\n *\n *  last change: $Author: rt $ $Date: 2008-01-29 15:35:18 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n#ifndef _SC_XMLSTYLESEXPORTHELPER_HXX\n#define _SC_XMLSTYLESEXPORTHELPER_HXX\n\n#include <vector>\n#include <list>\n\n#ifndef _COM_SUN_STAR_UNO_ANY_H_\n#include <com\/sun\/star\/uno\/Any.h>\n#endif\n#ifndef _COM_SUN_STAR_TABLE_CELLRANGEADDRESS_HPP_\n#include <com\/sun\/star\/table\/CellRangeAddress.hpp>\n#endif\n#ifndef _COM_SUN_STAR_TABLE_CELLADDRESS_HPP_\n#include <com\/sun\/star\/table\/CellAddress.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SHEET_CONDITIONOPERATOR_HPP_\n#include <com\/sun\/star\/sheet\/ConditionOperator.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SHEET_VALIDATIONALERTSTYLE_HPP_\n#include <com\/sun\/star\/sheet\/ValidationAlertStyle.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SHEET_VALIDATIONTYPE_HPP_\n#include <com\/sun\/star\/sheet\/ValidationType.hpp>\n#endif\n\nclass ScDocument;\nclass ScXMLExport;\n\nstruct ScMyValidation\n{\n    rtl::OUString               sName;\n    rtl::OUString               sErrorMessage;\n    rtl::OUString               sErrorTitle;\n    rtl::OUString               sImputMessage;\n    rtl::OUString               sImputTitle;\n    rtl::OUString               sFormula1;\n    rtl::OUString               sFormula2;\n    com::sun::star::table::CellAddress          aBaseCell;\n    com::sun::star::sheet::ValidationAlertStyle aAlertStyle;\n    com::sun::star::sheet::ValidationType       aValidationType;\n    com::sun::star::sheet::ConditionOperator    aOperator;\n    sal_Int16                   nShowList;\n    sal_Bool                    bShowErrorMessage;\n    sal_Bool                    bShowImputMessage;\n    sal_Bool                    bIgnoreBlanks;\n\n                                ScMyValidation();\n                                ~ScMyValidation();\n\n    sal_Bool                    IsEqual(const ScMyValidation& aVal) const;\n};\n\ntypedef std::vector<ScMyValidation>         ScMyValidationVec;\n\nclass ScMyValidationsContainer\n{\nprivate:\n    ScMyValidationVec           aValidationVec;\n    const rtl::OUString         sEmptyString;\n    const rtl::OUString         sERRALSTY;\n    const rtl::OUString         sIGNOREBL;\n    const rtl::OUString         sSHOWLIST;\n    const rtl::OUString         sTYPE;\n    const rtl::OUString         sSHOWINP;\n    const rtl::OUString         sSHOWERR;\n    const rtl::OUString         sINPTITLE;\n    const rtl::OUString         sINPMESS;\n    const rtl::OUString         sERRTITLE;\n    const rtl::OUString         sERRMESS;\n    const rtl::OUString         sOnError;\n    const rtl::OUString         sEventType;\n    const rtl::OUString         sStarBasic;\n    const rtl::OUString         sScript;\n    const rtl::OUString         sLibrary;\n    const rtl::OUString         sMacroName;\n\npublic:\n                                ScMyValidationsContainer();\n                                ~ScMyValidationsContainer();\n    sal_Bool                    AddValidation(const com::sun::star::uno::Any& aAny,\n                                    sal_Int32& nValidationIndex);\n    rtl::OUString               GetCondition(ScXMLExport& rExport, const ScMyValidation& aValidation);\n    rtl::OUString               GetBaseCellAddress(ScDocument* pDoc, const com::sun::star::table::CellAddress& aCell);\n    void                        WriteMessage(ScXMLExport& rExport,\n                                    const rtl::OUString& sTitle, const rtl::OUString& sMessage,\n                                    const sal_Bool bShowMessage, const sal_Bool bIsHelpMessage);\n    void                        WriteValidations(ScXMLExport& rExport);\n    const rtl::OUString&        GetValidationName(const sal_Int32 nIndex);\n};\n\n\/\/==============================================================================\n\nstruct ScMyDefaultStyle\n{\n    sal_Int32   nIndex;\n    sal_Int32   nRepeat;\n    sal_Bool    bIsAutoStyle;\n\n    ScMyDefaultStyle() : nIndex(-1), nRepeat(1),\n        bIsAutoStyle(sal_True) {}\n};\n\ntypedef std::vector<ScMyDefaultStyle> ScMyDefaultStyleList;\n\nclass ScFormatRangeStyles;\n\nclass ScMyDefaultStyles\n{\n    ScMyDefaultStyleList* pRowDefaults;\n    ScMyDefaultStyleList* pColDefaults;\n\n    sal_Int32 GetStyleNameIndex(const ScFormatRangeStyles* pCellStyles,\n        const sal_Int32 nTable, const sal_Int32 nPos,\n        const sal_Int32 i, const sal_Bool bRow, sal_Bool& bIsAutoStyle);\n    void FillDefaultStyles(const sal_Int32 nTable,\n        const sal_Int32 nLastRow, const sal_Int32 nLastCol,\n        const ScFormatRangeStyles* pCellStyles, ScDocument* pDoc,\n        const sal_Bool bRow);\npublic:\n    ScMyDefaultStyles() : pRowDefaults(NULL), pColDefaults(NULL) {}\n    ~ScMyDefaultStyles();\n\n    void FillDefaultStyles(const sal_Int32 nTable,\n        const sal_Int32 nLastRow, const sal_Int32 nLastCol,\n        const ScFormatRangeStyles* pCellStyles, ScDocument* pDoc);\n\n    const ScMyDefaultStyleList* GetRowDefaults() { return pRowDefaults; }\n    const ScMyDefaultStyleList* GetColDefaults() { return pColDefaults; }\n};\n\nstruct ScMyRowFormatRange\n{\n    sal_Int32   nStartColumn;\n    sal_Int32   nRepeatColumns;\n    sal_Int32   nRepeatRows;\n    sal_Int32   nIndex;\n    sal_Int32   nValidationIndex;\n    sal_Bool    bIsAutoStyle;\n\n    ScMyRowFormatRange();\n    sal_Bool operator<(const ScMyRowFormatRange& rRange) const;\n};\n\ntypedef std::list<ScMyRowFormatRange> ScMyRowFormatRangesList;\n\nclass ScRowFormatRanges\n{\n    ScMyRowFormatRangesList     aRowFormatRanges;\n    const ScMyDefaultStyleList* pRowDefaults;\n    const ScMyDefaultStyleList* pColDefaults;\n    sal_uInt32                  nSize;\n\n    void AddRange(const sal_Int32 nPrevStartCol, const sal_Int32 nRepeat, const sal_Int32 nPrevIndex,\n        const sal_Bool bPrevAutoStyle, const ScMyRowFormatRange& rFormatRange);\n\npublic:\n    ScRowFormatRanges();\n    ScRowFormatRanges(const ScRowFormatRanges* pRanges);\n    ~ScRowFormatRanges();\n\n    void SetRowDefaults(const ScMyDefaultStyleList* pDefaults) { pRowDefaults = pDefaults; }\n    void SetColDefaults(const ScMyDefaultStyleList* pDefaults) { pColDefaults = pDefaults; }\n    void Clear();\n    void AddRange(ScMyRowFormatRange& rFormatRange, const sal_Int32 nStartRow);\n    sal_Bool GetNext(ScMyRowFormatRange& rFormatRange);\n    sal_Int32 GetMaxRows();\n    sal_Int32 GetSize();\n    void Sort();\n};\n\ntypedef std::vector<rtl::OUString*>     ScMyOUStringVec;\n\nstruct ScMyFormatRange\n{\n    com::sun::star::table::CellRangeAddress aRangeAddress;\n    sal_Int32                               nStyleNameIndex;\n    sal_Int32                               nValidationIndex;\n    sal_Int32                               nNumberFormat;\n    sal_Bool                                bIsAutoStyle;\n\n    ScMyFormatRange();\n    sal_Bool operator< (const ScMyFormatRange& rRange) const;\n};\n\ntypedef std::list<ScMyFormatRange>          ScMyFormatRangeAddresses;\ntypedef std::vector<ScMyFormatRangeAddresses*>  ScMyFormatRangeListVec;\n\nclass ScFormatRangeStyles\n{\n    ScMyFormatRangeListVec      aTables;\n    ScMyOUStringVec             aStyleNames;\n    ScMyOUStringVec             aAutoStyleNames;\n    const ScMyDefaultStyleList* pRowDefaults;\n    const ScMyDefaultStyleList* pColDefaults;\n\npublic:\n    ScFormatRangeStyles();\n    ~ScFormatRangeStyles();\n\n    void SetRowDefaults(const ScMyDefaultStyleList* pDefaults) { pRowDefaults = pDefaults; }\n    void SetColDefaults(const ScMyDefaultStyleList* pDefaults) { pColDefaults = pDefaults; }\n    void AddNewTable(const sal_Int32 nTable);\n    sal_Bool AddStyleName(rtl::OUString* pString, sal_Int32& rIndex, const sal_Bool bIsAutoStyle = sal_True);\n    sal_Int32 GetIndexOfStyleName(const rtl::OUString& rString, const rtl::OUString& rPrefix, sal_Bool& bIsAutoStyle);\n    \/\/ does not delete ranges\n    sal_Int32 GetStyleNameIndex(const sal_Int32 nTable, const sal_Int32 nColumn, const sal_Int32 nRow,\n        sal_Bool& bIsAutoStyle) const;\n    \/\/ deletes not necessary ranges if wanted\n    sal_Int32 GetStyleNameIndex(const sal_Int32 nTable, const sal_Int32 nColumn, const sal_Int32 nRow,\n        sal_Bool& bIsAutoStyle, sal_Int32& nValidationIndex, sal_Int32& nNumberFormat, const sal_Bool bRemoveRange = sal_True );\n    void GetFormatRanges(const sal_Int32 nStartColumn, const sal_Int32 nEndColumn, const sal_Int32 nRow,\n                    const sal_Int32 nTable, ScRowFormatRanges* pFormatRanges);\n    void AddRangeStyleName(const com::sun::star::table::CellRangeAddress aCellRangeAddress, const sal_Int32 nStringIndex,\n                    const sal_Bool bIsAutoStyle, const sal_Int32 nValidationIndex, const sal_Int32 nNumberFormat);\n    rtl::OUString* GetStyleNameByIndex(const sal_Int32 nIndex, const sal_Bool bIsAutoStyle);\n    void Sort();\n};\n\nclass ScColumnRowStylesBase\n{\n    ScMyOUStringVec             aStyleNames;\n\npublic:\n    ScColumnRowStylesBase();\n    virtual ~ScColumnRowStylesBase();\n\n    virtual void AddNewTable(const sal_Int32 nTable, const sal_Int32 nFields) = 0;\n    sal_Int32 AddStyleName(rtl::OUString* pString);\n    sal_Int32 GetIndexOfStyleName(const rtl::OUString& rString, const rtl::OUString& rPrefix);\n    virtual rtl::OUString* GetStyleName(const sal_Int32 nTable, const sal_Int32 nField) = 0;\n    rtl::OUString* GetStyleNameByIndex(const sal_Int32 nIndex);\n};\n\nstruct ScColumnStyle\n{\n    sal_Int32   nIndex;\n    sal_Bool    bIsVisible;\n\n    ScColumnStyle() : nIndex(-1), bIsVisible(sal_True) {}\n};\n\n\ntypedef std::vector<ScColumnStyle>  ScMyColumnStyleVec;\ntypedef std::vector<ScMyColumnStyleVec> ScMyColumnVectorVec;\n\nclass ScColumnStyles : public ScColumnRowStylesBase\n{\n    ScMyColumnVectorVec             aTables;\n\npublic:\n    ScColumnStyles();\n    ~ScColumnStyles();\n\n    virtual void AddNewTable(const sal_Int32 nTable, const sal_Int32 nFields);\n    sal_Int32 GetStyleNameIndex(const sal_Int32 nTable, const sal_Int32 nField,\n        sal_Bool& bIsVisible);\n    void AddFieldStyleName(const sal_Int32 nTable, const sal_Int32 nField, const sal_Int32 nStringIndex, const sal_Bool bIsVisible);\n    virtual rtl::OUString* GetStyleName(const sal_Int32 nTable, const sal_Int32 nField);\n};\n\ntypedef std::vector<sal_Int32>  ScMysalInt32Vec;\ntypedef std::vector<ScMysalInt32Vec>    ScMyRowVectorVec;\n\nclass ScRowStyles : public ScColumnRowStylesBase\n{\n    ScMyRowVectorVec                aTables;\n\npublic:\n    ScRowStyles();\n    ~ScRowStyles();\n\n    virtual void AddNewTable(const sal_Int32 nTable, const sal_Int32 nFields);\n    sal_Int32 GetStyleNameIndex(const sal_Int32 nTable, const sal_Int32 nField);\n    void AddFieldStyleName(const sal_Int32 nTable, const sal_Int32 nField, const sal_Int32 nStringIndex);\n    virtual rtl::OUString* GetStyleName(const sal_Int32 nTable, const sal_Int32 nField);\n};\n\n#endif\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.28.88); FILE MERGED 2008\/04\/01 15:30:28 thb 1.28.88.3: #i85898# Stripping all external header guards 2008\/04\/01 12:36:31 thb 1.28.88.2: #i85898# Stripping all external header guards 2008\/03\/31 17:14:56 rt 1.28.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: XMLStylesExportHelper.hxx,v $\n * $Revision: 1.29 $\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_XMLSTYLESEXPORTHELPER_HXX\n#define _SC_XMLSTYLESEXPORTHELPER_HXX\n\n#include <vector>\n#include <list>\n#include <com\/sun\/star\/uno\/Any.h>\n#include <com\/sun\/star\/table\/CellRangeAddress.hpp>\n#include <com\/sun\/star\/table\/CellAddress.hpp>\n#include <com\/sun\/star\/sheet\/ConditionOperator.hpp>\n#include <com\/sun\/star\/sheet\/ValidationAlertStyle.hpp>\n#include <com\/sun\/star\/sheet\/ValidationType.hpp>\n\nclass ScDocument;\nclass ScXMLExport;\n\nstruct ScMyValidation\n{\n    rtl::OUString               sName;\n    rtl::OUString               sErrorMessage;\n    rtl::OUString               sErrorTitle;\n    rtl::OUString               sImputMessage;\n    rtl::OUString               sImputTitle;\n    rtl::OUString               sFormula1;\n    rtl::OUString               sFormula2;\n    com::sun::star::table::CellAddress          aBaseCell;\n    com::sun::star::sheet::ValidationAlertStyle aAlertStyle;\n    com::sun::star::sheet::ValidationType       aValidationType;\n    com::sun::star::sheet::ConditionOperator    aOperator;\n    sal_Int16                   nShowList;\n    sal_Bool                    bShowErrorMessage;\n    sal_Bool                    bShowImputMessage;\n    sal_Bool                    bIgnoreBlanks;\n\n                                ScMyValidation();\n                                ~ScMyValidation();\n\n    sal_Bool                    IsEqual(const ScMyValidation& aVal) const;\n};\n\ntypedef std::vector<ScMyValidation>         ScMyValidationVec;\n\nclass ScMyValidationsContainer\n{\nprivate:\n    ScMyValidationVec           aValidationVec;\n    const rtl::OUString         sEmptyString;\n    const rtl::OUString         sERRALSTY;\n    const rtl::OUString         sIGNOREBL;\n    const rtl::OUString         sSHOWLIST;\n    const rtl::OUString         sTYPE;\n    const rtl::OUString         sSHOWINP;\n    const rtl::OUString         sSHOWERR;\n    const rtl::OUString         sINPTITLE;\n    const rtl::OUString         sINPMESS;\n    const rtl::OUString         sERRTITLE;\n    const rtl::OUString         sERRMESS;\n    const rtl::OUString         sOnError;\n    const rtl::OUString         sEventType;\n    const rtl::OUString         sStarBasic;\n    const rtl::OUString         sScript;\n    const rtl::OUString         sLibrary;\n    const rtl::OUString         sMacroName;\n\npublic:\n                                ScMyValidationsContainer();\n                                ~ScMyValidationsContainer();\n    sal_Bool                    AddValidation(const com::sun::star::uno::Any& aAny,\n                                    sal_Int32& nValidationIndex);\n    rtl::OUString               GetCondition(ScXMLExport& rExport, const ScMyValidation& aValidation);\n    rtl::OUString               GetBaseCellAddress(ScDocument* pDoc, const com::sun::star::table::CellAddress& aCell);\n    void                        WriteMessage(ScXMLExport& rExport,\n                                    const rtl::OUString& sTitle, const rtl::OUString& sMessage,\n                                    const sal_Bool bShowMessage, const sal_Bool bIsHelpMessage);\n    void                        WriteValidations(ScXMLExport& rExport);\n    const rtl::OUString&        GetValidationName(const sal_Int32 nIndex);\n};\n\n\/\/==============================================================================\n\nstruct ScMyDefaultStyle\n{\n    sal_Int32   nIndex;\n    sal_Int32   nRepeat;\n    sal_Bool    bIsAutoStyle;\n\n    ScMyDefaultStyle() : nIndex(-1), nRepeat(1),\n        bIsAutoStyle(sal_True) {}\n};\n\ntypedef std::vector<ScMyDefaultStyle> ScMyDefaultStyleList;\n\nclass ScFormatRangeStyles;\n\nclass ScMyDefaultStyles\n{\n    ScMyDefaultStyleList* pRowDefaults;\n    ScMyDefaultStyleList* pColDefaults;\n\n    sal_Int32 GetStyleNameIndex(const ScFormatRangeStyles* pCellStyles,\n        const sal_Int32 nTable, const sal_Int32 nPos,\n        const sal_Int32 i, const sal_Bool bRow, sal_Bool& bIsAutoStyle);\n    void FillDefaultStyles(const sal_Int32 nTable,\n        const sal_Int32 nLastRow, const sal_Int32 nLastCol,\n        const ScFormatRangeStyles* pCellStyles, ScDocument* pDoc,\n        const sal_Bool bRow);\npublic:\n    ScMyDefaultStyles() : pRowDefaults(NULL), pColDefaults(NULL) {}\n    ~ScMyDefaultStyles();\n\n    void FillDefaultStyles(const sal_Int32 nTable,\n        const sal_Int32 nLastRow, const sal_Int32 nLastCol,\n        const ScFormatRangeStyles* pCellStyles, ScDocument* pDoc);\n\n    const ScMyDefaultStyleList* GetRowDefaults() { return pRowDefaults; }\n    const ScMyDefaultStyleList* GetColDefaults() { return pColDefaults; }\n};\n\nstruct ScMyRowFormatRange\n{\n    sal_Int32   nStartColumn;\n    sal_Int32   nRepeatColumns;\n    sal_Int32   nRepeatRows;\n    sal_Int32   nIndex;\n    sal_Int32   nValidationIndex;\n    sal_Bool    bIsAutoStyle;\n\n    ScMyRowFormatRange();\n    sal_Bool operator<(const ScMyRowFormatRange& rRange) const;\n};\n\ntypedef std::list<ScMyRowFormatRange> ScMyRowFormatRangesList;\n\nclass ScRowFormatRanges\n{\n    ScMyRowFormatRangesList     aRowFormatRanges;\n    const ScMyDefaultStyleList* pRowDefaults;\n    const ScMyDefaultStyleList* pColDefaults;\n    sal_uInt32                  nSize;\n\n    void AddRange(const sal_Int32 nPrevStartCol, const sal_Int32 nRepeat, const sal_Int32 nPrevIndex,\n        const sal_Bool bPrevAutoStyle, const ScMyRowFormatRange& rFormatRange);\n\npublic:\n    ScRowFormatRanges();\n    ScRowFormatRanges(const ScRowFormatRanges* pRanges);\n    ~ScRowFormatRanges();\n\n    void SetRowDefaults(const ScMyDefaultStyleList* pDefaults) { pRowDefaults = pDefaults; }\n    void SetColDefaults(const ScMyDefaultStyleList* pDefaults) { pColDefaults = pDefaults; }\n    void Clear();\n    void AddRange(ScMyRowFormatRange& rFormatRange, const sal_Int32 nStartRow);\n    sal_Bool GetNext(ScMyRowFormatRange& rFormatRange);\n    sal_Int32 GetMaxRows();\n    sal_Int32 GetSize();\n    void Sort();\n};\n\ntypedef std::vector<rtl::OUString*>     ScMyOUStringVec;\n\nstruct ScMyFormatRange\n{\n    com::sun::star::table::CellRangeAddress aRangeAddress;\n    sal_Int32                               nStyleNameIndex;\n    sal_Int32                               nValidationIndex;\n    sal_Int32                               nNumberFormat;\n    sal_Bool                                bIsAutoStyle;\n\n    ScMyFormatRange();\n    sal_Bool operator< (const ScMyFormatRange& rRange) const;\n};\n\ntypedef std::list<ScMyFormatRange>          ScMyFormatRangeAddresses;\ntypedef std::vector<ScMyFormatRangeAddresses*>  ScMyFormatRangeListVec;\n\nclass ScFormatRangeStyles\n{\n    ScMyFormatRangeListVec      aTables;\n    ScMyOUStringVec             aStyleNames;\n    ScMyOUStringVec             aAutoStyleNames;\n    const ScMyDefaultStyleList* pRowDefaults;\n    const ScMyDefaultStyleList* pColDefaults;\n\npublic:\n    ScFormatRangeStyles();\n    ~ScFormatRangeStyles();\n\n    void SetRowDefaults(const ScMyDefaultStyleList* pDefaults) { pRowDefaults = pDefaults; }\n    void SetColDefaults(const ScMyDefaultStyleList* pDefaults) { pColDefaults = pDefaults; }\n    void AddNewTable(const sal_Int32 nTable);\n    sal_Bool AddStyleName(rtl::OUString* pString, sal_Int32& rIndex, const sal_Bool bIsAutoStyle = sal_True);\n    sal_Int32 GetIndexOfStyleName(const rtl::OUString& rString, const rtl::OUString& rPrefix, sal_Bool& bIsAutoStyle);\n    \/\/ does not delete ranges\n    sal_Int32 GetStyleNameIndex(const sal_Int32 nTable, const sal_Int32 nColumn, const sal_Int32 nRow,\n        sal_Bool& bIsAutoStyle) const;\n    \/\/ deletes not necessary ranges if wanted\n    sal_Int32 GetStyleNameIndex(const sal_Int32 nTable, const sal_Int32 nColumn, const sal_Int32 nRow,\n        sal_Bool& bIsAutoStyle, sal_Int32& nValidationIndex, sal_Int32& nNumberFormat, const sal_Bool bRemoveRange = sal_True );\n    void GetFormatRanges(const sal_Int32 nStartColumn, const sal_Int32 nEndColumn, const sal_Int32 nRow,\n                    const sal_Int32 nTable, ScRowFormatRanges* pFormatRanges);\n    void AddRangeStyleName(const com::sun::star::table::CellRangeAddress aCellRangeAddress, const sal_Int32 nStringIndex,\n                    const sal_Bool bIsAutoStyle, const sal_Int32 nValidationIndex, const sal_Int32 nNumberFormat);\n    rtl::OUString* GetStyleNameByIndex(const sal_Int32 nIndex, const sal_Bool bIsAutoStyle);\n    void Sort();\n};\n\nclass ScColumnRowStylesBase\n{\n    ScMyOUStringVec             aStyleNames;\n\npublic:\n    ScColumnRowStylesBase();\n    virtual ~ScColumnRowStylesBase();\n\n    virtual void AddNewTable(const sal_Int32 nTable, const sal_Int32 nFields) = 0;\n    sal_Int32 AddStyleName(rtl::OUString* pString);\n    sal_Int32 GetIndexOfStyleName(const rtl::OUString& rString, const rtl::OUString& rPrefix);\n    virtual rtl::OUString* GetStyleName(const sal_Int32 nTable, const sal_Int32 nField) = 0;\n    rtl::OUString* GetStyleNameByIndex(const sal_Int32 nIndex);\n};\n\nstruct ScColumnStyle\n{\n    sal_Int32   nIndex;\n    sal_Bool    bIsVisible;\n\n    ScColumnStyle() : nIndex(-1), bIsVisible(sal_True) {}\n};\n\n\ntypedef std::vector<ScColumnStyle>  ScMyColumnStyleVec;\ntypedef std::vector<ScMyColumnStyleVec> ScMyColumnVectorVec;\n\nclass ScColumnStyles : public ScColumnRowStylesBase\n{\n    ScMyColumnVectorVec             aTables;\n\npublic:\n    ScColumnStyles();\n    ~ScColumnStyles();\n\n    virtual void AddNewTable(const sal_Int32 nTable, const sal_Int32 nFields);\n    sal_Int32 GetStyleNameIndex(const sal_Int32 nTable, const sal_Int32 nField,\n        sal_Bool& bIsVisible);\n    void AddFieldStyleName(const sal_Int32 nTable, const sal_Int32 nField, const sal_Int32 nStringIndex, const sal_Bool bIsVisible);\n    virtual rtl::OUString* GetStyleName(const sal_Int32 nTable, const sal_Int32 nField);\n};\n\ntypedef std::vector<sal_Int32>  ScMysalInt32Vec;\ntypedef std::vector<ScMysalInt32Vec>    ScMyRowVectorVec;\n\nclass ScRowStyles : public ScColumnRowStylesBase\n{\n    ScMyRowVectorVec                aTables;\n\npublic:\n    ScRowStyles();\n    ~ScRowStyles();\n\n    virtual void AddNewTable(const sal_Int32 nTable, const sal_Int32 nFields);\n    sal_Int32 GetStyleNameIndex(const sal_Int32 nTable, const sal_Int32 nField);\n    void AddFieldStyleName(const sal_Int32 nTable, const sal_Int32 nField, const sal_Int32 nStringIndex);\n    virtual rtl::OUString* GetStyleName(const sal_Int32 nTable, const sal_Int32 nField);\n};\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Test for RooBernstein\n\/\/ Authors: Rahul Balasubramanian, CERN  10\/2019\n\n#include \"RooRealVar.h\"\n#include \"RooNumIntConfig.h\"\n#include \"RooBernstein.h\"\n#include \"TMath.h\"\n#include \"RooPlot.h\"\n#include \"TAxis.h\"\n\n#include \"gtest\/gtest.h\"\n\nusing namespace RooFit;\n\nvoid simpleIntegration(double a0, double a1, double a2, double a3)\n{\n  RooRealVar x(\"x\", \"x\", 0., 100.);\n\n  \/\/ Set ranges for the variable\n  x.setRange(\"range1\", 0., 30.);\n  x.setRange(\"range2\", 30., 70.);\n  x.setRange(\"range3\", 70., 100.);\n  x.setRange(\"FULL\", 0., 100.);\n\n  \/\/ Define coefficients for a bernstein polynomial of order 3\n  RooRealVar c0(\"c0\", \"c1 coeff\", a0, 0., 10.);\n  RooRealVar c1(\"c1\", \"c1 coeff\", a1, 0., 10.);\n  RooRealVar c2(\"c2\", \"c2 coeff\", a2, 0., 10.);\n  RooRealVar c3(\"c3\", \"c3 coeff\", a3, 0., 10.);\n\n  \/\/ Build bernstein p.d.f in terms of coefficients\n  RooBernstein bern(\"bern\", \"bernstein PDF\", x, RooArgList(c0, c1, c2, c3));\n  RooBernstein bernNumInt(bern);\n  \/\/ Set normalization range\n  bern.selectNormalizationRange(\"FULL\",kTRUE);\n  bernNumInt.selectNormalizationRange(\"FULL\",kTRUE);\n\n  RooNumIntConfig intConfig(*RooAbsReal::defaultIntegratorConfig());\n  intConfig.setEpsAbs(1.E-15);\n  intConfig.setEpsRel(1.E-12);\n\n  intConfig.getConfigSection(\"RooIntegrator1D\").setRealValue(\"maxSteps\", 100);\n  bernNumInt.setIntegratorConfig(intConfig);\n  bernNumInt.forceNumInt(true);\n\n  \/\/ Test ranged integration\n  auto int_range1 = bern.createIntegral(x, \"range1\");\n  auto int_range2 = bern.createIntegral(x, \"range2\");\n  auto int_range3 = bern.createIntegral(x, \"range3\");\n  auto int_full = bern.createIntegral(x, \"FULL\");\n\n  auto numInt_range1 = bern.createIntegral(x, \"range1\");\n  auto numInt_range2 = bern.createIntegral(x, \"range2\");\n  auto numInt_range3 = bern.createIntegral(x, \"range3\");\n  auto numInt_full = bern.createIntegral(x, \"FULL\");\n\n  \/\/ closure\n  EXPECT_LT(fabs(int_full->getVal() - int_range1->getVal() - int_range2->getVal() - int_range3->getVal()), 1e-10);\n  EXPECT_LT(fabs(numInt_full->getVal() - numInt_range1->getVal() - numInt_range2->getVal() - numInt_range3->getVal()), 1e-10);\n\n  \/\/ comparision with polynomial\n  double accAnaVsNum = 1.;\n  EXPECT_NEAR(int_range1->getVal(), numInt_range1->getVal(),\n      accAnaVsNum\/100.*numInt_range1->getVal())\n  << \"Analytical vs numerical integral\"\n  << \" within \" << accAnaVsNum << \"%. With \";\n  \n  EXPECT_NEAR(int_range1->getVal(), numInt_range1->getVal(),\n      accAnaVsNum\/100.*numInt_range2->getVal())\n  << \"Analytical vs numerical integral\"\n  << \" within \" << accAnaVsNum << \"%. With \";\n\n  EXPECT_NEAR(int_range1->getVal(), numInt_range1->getVal(),\n      accAnaVsNum\/100.*numInt_range3->getVal())\n  << \"Analytical vs numerical integral\"\n  << \" within \" << accAnaVsNum << \"%. With \";\n\n  EXPECT_NEAR(int_full->getVal(), numInt_full->getVal(),\n      accAnaVsNum\/100.*numInt_full->getVal())\n  << \"Analytical vs numerical integral\"\n  << \" within \" << accAnaVsNum << \"%. With \";\n}\n\nTEST(RooBernstein, NumInt)\n{\n  simpleIntegration(0.3, 0.7, 0.2, 0.5);\n}\n<commit_msg>[RF] typos in bernstein test<commit_after>\/\/ Test for RooBernstein\n\/\/ Authors: Rahul Balasubramanian, CERN  05\/2020\n\n#include \"RooRealVar.h\"\n#include \"RooNumIntConfig.h\"\n#include \"RooBernstein.h\"\n#include \"TMath.h\"\n#include \"RooPlot.h\"\n#include \"TAxis.h\"\n\n#include \"gtest\/gtest.h\"\n\nusing namespace RooFit;\n\nvoid simpleIntegration(double a0, double a1, double a2, double a3)\n{\n  RooRealVar x(\"x\", \"x\", 0., 100.);\n\n  \/\/ Set ranges for the variable\n  x.setRange(\"range1\", 0., 30.);\n  x.setRange(\"range2\", 30., 70.);\n  x.setRange(\"range3\", 70., 100.);\n  x.setRange(\"FULL\", 0., 100.);\n\n  \/\/ Define coefficients for a bernstein polynomial of order 3\n  RooRealVar c0(\"c0\", \"c1 coeff\", a0, 0., 10.);\n  RooRealVar c1(\"c1\", \"c1 coeff\", a1, 0., 10.);\n  RooRealVar c2(\"c2\", \"c2 coeff\", a2, 0., 10.);\n  RooRealVar c3(\"c3\", \"c3 coeff\", a3, 0., 10.);\n\n  \/\/ Build bernstein p.d.f in terms of coefficients\n  RooBernstein bern(\"bern\", \"bernstein PDF\", x, RooArgList(c0, c1, c2, c3));\n  RooBernstein bernNumInt(bern);\n  \/\/ Set normalization range\n  bern.selectNormalizationRange(\"FULL\",kTRUE);\n  bernNumInt.selectNormalizationRange(\"FULL\",kTRUE);\n\n  RooNumIntConfig intConfig(*RooAbsReal::defaultIntegratorConfig());\n  intConfig.setEpsAbs(1.E-15);\n  intConfig.setEpsRel(1.E-12);\n\n  intConfig.getConfigSection(\"RooIntegrator1D\").setRealValue(\"maxSteps\", 100);\n  bernNumInt.setIntegratorConfig(intConfig);\n  bernNumInt.forceNumInt(true);\n\n  \/\/ Test ranged integration\n  auto int_range1 = bern.createIntegral(x, \"range1\");\n  auto int_range2 = bern.createIntegral(x, \"range2\");\n  auto int_range3 = bern.createIntegral(x, \"range3\");\n  auto int_full = bern.createIntegral(x, \"FULL\");\n\n  auto numInt_range1 = bern.createIntegral(x, \"range1\");\n  auto numInt_range2 = bern.createIntegral(x, \"range2\");\n  auto numInt_range3 = bern.createIntegral(x, \"range3\");\n  auto numInt_full = bern.createIntegral(x, \"FULL\");\n\n  \/\/ closure\n  EXPECT_LT(fabs(int_full->getVal() - int_range1->getVal() - int_range2->getVal() - int_range3->getVal()), 1e-10);\n  EXPECT_LT(fabs(numInt_full->getVal() - numInt_range1->getVal() - numInt_range2->getVal() - numInt_range3->getVal()), 1e-10);\n\n  \/\/ comparision with polynomial\n  double accAnaVsNum = 1.;\n  EXPECT_NEAR(int_range1->getVal(), numInt_range1->getVal(),\n      accAnaVsNum\/100.*numInt_range1->getVal())\n  << \"Analytical vs numerical integral\"\n  << \" within \" << accAnaVsNum << \"%. \";\n  \n  EXPECT_NEAR(int_range1->getVal(), numInt_range1->getVal(),\n      accAnaVsNum\/100.*numInt_range2->getVal())\n  << \"Analytical vs numerical integral\"\n  << \" within \" << accAnaVsNum << \"%. \";\n\n  EXPECT_NEAR(int_range1->getVal(), numInt_range1->getVal(),\n      accAnaVsNum\/100.*numInt_range3->getVal())\n  << \"Analytical vs numerical integral\"\n  << \" within \" << accAnaVsNum << \"%. \";\n\n  EXPECT_NEAR(int_full->getVal(), numInt_full->getVal(),\n      accAnaVsNum\/100.*numInt_full->getVal())\n  << \"Analytical vs numerical integral\"\n  << \" within \" << accAnaVsNum << \"%. \";\n}\n\nTEST(RooBernstein, NumInt)\n{\n  simpleIntegration(0.3, 0.7, 0.2, 0.5);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * rational.cpp\n *\n *  Created on: 07.03.2014\n *      Author: trifon\n *\/\n\n#include \"rational.h\"\n#include <iostream>\nusing namespace std;\n\nvoid reduce() {\n\tcout << \"Аз съм функцията reduce()!\" << endl;\n}\n\nRational::Rational(int n, int d) : numer(n), denom(d) {\n\tcout << \"Конструктор Rational с параметри: \" << n << ',' << d << endl;\n\treduce();\n\t\/\/ ::reduce();\n}\n\nRational::Rational(Rational const &r) : numer(r.numer),\n\t\t\t\t\t\t\t\t\t\tdenom(r.denom) {\n\tcout << \"Конструктор за копиране Rational: \";\n\tr.print();cout << endl;\n}\n\ninline int Rational::getNumerator() const {\n\t\/\/ Rational const * const this;\n\t\/\/ !!! Rational q; this = &q;\n\t\/\/ !!! this->numer = 5;\n\treturn this->numer;\n}\n\ninline int Rational::getDenominator() const {\n\treturn denom;\n}\n\nvoid Rational::print(ostream& os) const {\n\tos << numer << '\/' << denom;\n}\n\nvoid Rational::read(istream& is) {\n\t\/\/ можем да въвеждаме във формата 1\/5\n\tis >> numer;\n\tis.ignore();\n\tis >> denom;\n\treduce();\n}\n\nRational add(Rational p, Rational q) {\n\tint rN = p.getNumerator() * q.getDenominator() +\n\t\t\t q.getNumerator() * p.getDenominator();\n\tint rD = p.getDenominator() * q.getDenominator();\n\tp.invert();\n\tq.invert();\n\tRational r(rN, rD);\n\treturn r;\n}\n\n\/\/ !!! Rational* add_pointers(Rational const* p, Rational const* q) {\nRational add_pointers(Rational const* p, Rational const* q) {\n\tint rN = p->getNumerator() * q->getDenominator() +\n\t\t\t q->getNumerator() * p->getDenominator();\n\tint rD = p->getDenominator() * q->getDenominator();\n\t\/\/ не можем да викаме мутатори\n\t\/\/ !!! p->invert();\n\t\/\/ !!! q->invert();\n\t\/\/ !!! return new Rational(rN, rD);\n\tRational r(rN, rD);\n\t\/\/ !!! return & r;\n\treturn r;\n}\n\nRational add_ref(Rational const& p, Rational const& q) {\n\tint rN = p.getNumerator() * q.getDenominator() +\n\t\t\t q.getNumerator() * p.getDenominator();\n\tint rD = p.getDenominator() * q.getDenominator();\n\t\/\/ не можем да викаме мутатори\n\t\/\/ !!! p.invert();\n\t\/\/ !!! q.invert();\n\tRational r(rN, rD);\n\treturn r;\n}\n\nvoid Rational::reduce() {\n\tint g = gcd(numer, denom);\n\tnumer \/= g;\n\tdenom \/= g;\n\tif (denom < 0) {\n\t\tnumer = -numer;\n\t\tdenom = -denom;\n\t}\n}\n\nint Rational::gcd(int x, int y) {\n\tif (x == 0 || y == 0)\n\t\treturn 1;\n\twhile (x != y) {\n\t\tif (x > y)\n\t\t\tx -= y;\n\t\telse\n\t\t\ty -= x;\n\t}\n\treturn x; \/\/ == y;\n}\n\nbool Rational::equals(Rational other) const {\n\t\/\/ Не е грешка!\n\t\/\/ return numer == other.numer && denom == other.denom;\n\treturn getNumerator() == other.getNumerator() &&\n\t\t   getDenominator() == other.getDenominator();\n}\n\nRational::Rational(double x) : numer(x * 10000), denom(10000) {\n\treduce();\n}\n\nRational operator+(int x, Rational const& r) {\n\treturn Rational(x * r.denom + r.numer,\n\t\t\t        r.denom);\n}\n\nRational Rational::operator+(Rational const& r) const {\n\treturn Rational(r.numer * denom + numer * r.denom,\n\t\t\tr.denom * denom);\n}\n\nRational Rational::operator-() const {\n\treturn Rational(-numer, -denom);\n}\n\nRational Rational::operator-(Rational const& r) const {\n\treturn *this + -r;\n\t\/\/return this->operator+(r.operator-());\n\t\/\/return operator+(-r);\n}\n\nRational Rational::operator*(Rational const& r) const {\n\treturn Rational(numer * r.numer, denom * r.denom);\n}\n\nRational Rational::operator\/(Rational const& r) const {\n\tRational ri = r;\n\tri.invert();\n\treturn *this * ri;\n\t\/\/ return operator*(Rational(r).invert());\n}\n\nostream& operator<<(ostream& os, Rational const& r) {\n\tr.print(os);\n\treturn os;\n}\n\nistream& operator>>(istream& is, Rational & r) {\n\tr.read(is);\n\treturn is;\n}\n\nRational::operator int() const {\n\treturn numer \/ denom;\n}\n\nRational::operator double() const {\n\treturn (double) numer \/ denom;\n}\n<commit_msg>Поправка на унарния -, трябва да взема противоположния числител и същия знаменател.<commit_after>\/*\n * rational.cpp\n *\n *  Created on: 07.03.2014\n *      Author: trifon\n *\/\n\n#include \"rational.h\"\n#include <iostream>\nusing namespace std;\n\nvoid reduce() {\n\tcout << \"Аз съм функцията reduce()!\" << endl;\n}\n\nRational::Rational(int n, int d) : numer(n), denom(d) {\n\tcout << \"Конструктор Rational с параметри: \" << n << ',' << d << endl;\n\treduce();\n\t\/\/ ::reduce();\n}\n\nRational::Rational(Rational const &r) : numer(r.numer),\n\t\t\t\t\t\t\t\t\t\tdenom(r.denom) {\n\tcout << \"Конструктор за копиране Rational: \";\n\tr.print();cout << endl;\n}\n\ninline int Rational::getNumerator() const {\n\t\/\/ Rational const * const this;\n\t\/\/ !!! Rational q; this = &q;\n\t\/\/ !!! this->numer = 5;\n\treturn this->numer;\n}\n\ninline int Rational::getDenominator() const {\n\treturn denom;\n}\n\nvoid Rational::print(ostream& os) const {\n\tos << numer << '\/' << denom;\n}\n\nvoid Rational::read(istream& is) {\n\t\/\/ можем да въвеждаме във формата 1\/5\n\tis >> numer;\n\tis.ignore();\n\tis >> denom;\n\treduce();\n}\n\nRational add(Rational p, Rational q) {\n\tint rN = p.getNumerator() * q.getDenominator() +\n\t\t\t q.getNumerator() * p.getDenominator();\n\tint rD = p.getDenominator() * q.getDenominator();\n\tp.invert();\n\tq.invert();\n\tRational r(rN, rD);\n\treturn r;\n}\n\n\/\/ !!! Rational* add_pointers(Rational const* p, Rational const* q) {\nRational add_pointers(Rational const* p, Rational const* q) {\n\tint rN = p->getNumerator() * q->getDenominator() +\n\t\t\t q->getNumerator() * p->getDenominator();\n\tint rD = p->getDenominator() * q->getDenominator();\n\t\/\/ не можем да викаме мутатори\n\t\/\/ !!! p->invert();\n\t\/\/ !!! q->invert();\n\t\/\/ !!! return new Rational(rN, rD);\n\tRational r(rN, rD);\n\t\/\/ !!! return & r;\n\treturn r;\n}\n\nRational add_ref(Rational const& p, Rational const& q) {\n\tint rN = p.getNumerator() * q.getDenominator() +\n\t\t\t q.getNumerator() * p.getDenominator();\n\tint rD = p.getDenominator() * q.getDenominator();\n\t\/\/ не можем да викаме мутатори\n\t\/\/ !!! p.invert();\n\t\/\/ !!! q.invert();\n\tRational r(rN, rD);\n\treturn r;\n}\n\nvoid Rational::reduce() {\n\tint g = gcd(numer, denom);\n\tnumer \/= g;\n\tdenom \/= g;\n\tif (denom < 0) {\n\t\tnumer = -numer;\n\t\tdenom = -denom;\n\t}\n}\n\nint Rational::gcd(int x, int y) {\n\tif (x == 0 || y == 0)\n\t\treturn 1;\n\twhile (x != y) {\n\t\tif (x > y)\n\t\t\tx -= y;\n\t\telse\n\t\t\ty -= x;\n\t}\n\treturn x; \/\/ == y;\n}\n\nbool Rational::equals(Rational other) const {\n\t\/\/ Не е грешка!\n\t\/\/ return numer == other.numer && denom == other.denom;\n\treturn getNumerator() == other.getNumerator() &&\n\t\t   getDenominator() == other.getDenominator();\n}\n\nRational::Rational(double x) : numer(x * 10000), denom(10000) {\n\treduce();\n}\n\nRational operator+(int x, Rational const& r) {\n\treturn Rational(x * r.denom + r.numer,\n\t\t\t        r.denom);\n}\n\nRational Rational::operator+(Rational const& r) const {\n\treturn Rational(r.numer * denom + numer * r.denom,\n\t\t\tr.denom * denom);\n}\n\nRational Rational::operator-() const {\n\treturn Rational(-numer, denom);\n}\n\nRational Rational::operator-(Rational const& r) const {\n\treturn *this + -r;\n\t\/\/return this->operator+(r.operator-());\n\t\/\/return operator+(-r);\n}\n\nRational Rational::operator*(Rational const& r) const {\n\treturn Rational(numer * r.numer, denom * r.denom);\n}\n\nRational Rational::operator\/(Rational const& r) const {\n\tRational ri = r;\n\tri.invert();\n\treturn *this * ri;\n\t\/\/ return operator*(Rational(r).invert());\n}\n\nostream& operator<<(ostream& os, Rational const& r) {\n\tr.print(os);\n\treturn os;\n}\n\nistream& operator>>(istream& is, Rational & r) {\n\tr.read(is);\n\treturn is;\n}\n\nRational::operator int() const {\n\treturn numer \/ denom;\n}\n\nRational::operator double() const {\n\treturn (double) numer \/ denom;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifdef ENGINE_EXPORTS\n#define ENGINE_API __declspec(dllexport)\n#else\n#define ENGINE_API __declspec(dllimport)\n#endif\n\n#include \"stdafx.h\"\n#include \"Engine.h\"\n#include \"DirectoryProperties.h\"\n#include \"Mtu.h\"\n\n#define N_BANDS 4\n\n#define N_INPUT N_BANDS*2\n#define N_OUTPUT 2\n#define N_FILES N_INPUT\n\nint main()\n{\n\t\/\/ INPUTS\n\tTS_TO_FFT_TYPE ts2fft_type = FIXED_WINDOW_LENGTH;\n\tESTIMATOR_TYPE estimator_type = LEAST_SQUARES;\n\tRR_OR_SS_TYPE rrorss_type = SINGLE_SITE;\n\t\/\/std::string inputPath = \"C:\\\\Users\\\\Usuario\\\\Google Drive\\\\Documentos\\\\MT data\\\\mtu ss\";\n\tstd::string inputPath = \"C:\\\\Users\\\\leonardo\\\\Google Drive\\\\Documentos\\\\MT data\\\\mtu ss\";\n\t\/\/std::string inputPath = \"C:\\\\Users\\\\leonardo\\\\Google Drive\\\\Documentos\\\\MT data\\\\mtu ts5\";\n\n\t\/\/ object to explore the main path and its subfolders\n\tDirectoryProperties dirInfo( inputPath );\n\n\t\/\/ get stations name, path and type\n\tstd::vector<StationBase> station = dirInfo.initialize_stations();\n\n\t\/\/ read raw time-series\n\t\/\/ TODO - define timeVector properly for RR\n\tfor( int i = 0; i < station.size(); i++ )\n\t\tstation[i].read_time_series( &dirInfo );\n\n\t\/\/ build the draft for the time vector, considering all continuous acquisition\n\t\/\/ TODO - do it correctly\n\t\/\/Utils::draft_build_time_vector( station );\n\n\t\/\/ checkouts\n\tfor( int istn = 0; istn < station.size(); istn++ ) {\n\t\tfor( int its = 0; its < station[istn].ts.size(); its++ ) {\t\t\n\t\t\t\/\/station[istn].ts[its].timeVector[0].print();\n\t\t\t\/\/std::cout << endl << istn << \" \" << its << endl;\n\t\t\t\/\/for( int irow = 0; irow < station[istn].ts[its].ch[0].systemResponseFreqs[0].getDim(0); irow++ ) {\n\t\t\t\/\/\t\/\/std::cout << station[istn].ts[its].ch[0].systemResponseFreqs[0](irow) << \" \";\n\t\t\t\/\/\tfor( int ich = 0; ich < station[istn].ts[its].ch.size(); ich++ )\t{\n\t\t\t\/\/\t\tstation[istn].ts[its].ch[ich].gain = 1;\n\t\t\t\/\/\t\tstd::cout << station[istn].ts[its].ch[ich].gain << \" \";\n\t\t\t\/\/\t}\n\t\t\t\/\/\tstd::cout << std::endl;\n\t\t\t\/\/}\n\n\t\t\tcout << station[istn].ts[its].timeVector[station[istn].ts[its].timeVector.size() - 2] << \" \"\n\t\t\t\t<< station[istn].ts[its].timeVector[station[istn].ts[its].timeVector.size() - 1] << \" \"\n\t\t\t\t<< station[istn].ts[its].pTimeVector[station[istn].ts[its].pTimeVector.size() - 1] << endl;\n\t\t}\n\t\t\t\tstd::cout << std::endl;\n\t}\n\n\t\/\/ extract corrected (to physical units) Fourier coefficients \n\tStationBase::get_all_FCs( station, ts2fft_type, rrorss_type );\n\n\t\/\/ evaluate Z \n\tStationBase::get_Z( station, estimator_type );\n\n\t\/\/\/\/ checkouts\n\t\/\/for( int istn = 0; istn < station.size(); istn++ ) {\n\t\/\/\tfor( int its = 0; its < station[istn].ts.size(); its++ ) {\t\t\n\t\/\/\t\tcout << station[istn].ts[its].combination[0].idxStn[0] << endl;\t\n\t\/\/\t\tcout << station[istn].ts[its].combination[0].idxTs[0] << endl;\t\t\n\t\/\/\t\tstation[istn].ts[its].combination[0].idxBgn[0].print();\n\t\/\/\t\tstation[istn].ts[its].combination[0].idxEnd[0].print();\n\t\/\/\t}\n\t\/\/\tstd::cout << std::endl;\n\t\/\/}\n\n\t\/\/\t\t\t\/\/ checkout\n\t\/\/for( int istn = 0; istn < station.size(); istn++ )\n\t\/\/\tfor( int its = 0; its < station[istn].ts.size(); its++ )\n\t\/\/\t\tfor( int icomb = 0; icomb < station[istn].ts[its].combination.size(); icomb++ ) {\n\t\/\/\t\t\tfor( int ifreq = 0; ifreq < station[istn].ts[its].combination[icomb].fr.size(); ifreq++ ) \n\t\/\/\t\t\t\tcout << istn << \" \" << its << \" \" << icomb << \" \" << ifreq << \" \" << station[istn].ts[its].combination[icomb].fr[ifreq].frequency << endl;\n\t\/\/\t\t\tcout << endl;\n\t\/\/\t\t}\n\n\tWriteOutputs::WriteOutputs( station );\n\n\t\/\/ delete everything allocated\n\t\/\/ TODO\n\tUtils::delete_all( &station );\n\n\n\n\t\n\t\/\/int inputc;\n\t\/\/int outputc;\n\t\/\/char *input;\n\t\/\/char *output;\n\t\/\/unsigned int type = FILE_TYPE_MTU;\n\t\/\/int decimation = 5;\n\t\/\/BOOL robust = true;\n\n\t\/\/CEngineBase *engine = NULL;\n\t\/\/if(robust)\n\t\/\/\tengine = new CEngineRobust(\tinputc,\n\t\/\/\t\t\t\t\t\t\t\toutputc,\n\t\/\/\t\t\t\t\t\t\t\t&input,\n\t\/\/\t\t\t\t\t\t\t\t&output,\n\t\/\/\t\t\t\t\t\t\t\tstatic_cast<FILE_TYPE>(type),\n\t\/\/\t\t\t\t\t\t\t\tdecimation);\n\t\/\/else\n\t\/\/\tengine = new CEngine(\tinputc,\n\t\/\/\t\t\t\t\t\t\toutputc,\n\t\/\/\t\t\t\t\t\t\t&input,\n\t\/\/\t\t\t\t\t\t\t&output,\n\t\/\/\t\t\t\t\t\t\tstatic_cast<FILE_TYPE>(type),\n\t\/\/\t\t\t\t\t\t\tdecimation);\n\n\t\/\/int ret = engine->process();\n\t\/\/delete engine;\n\n\t\/\/return ret;\n}<commit_msg>update<commit_after>#ifdef ENGINE_EXPORTS\n#define ENGINE_API __declspec(dllexport)\n#else\n#define ENGINE_API __declspec(dllimport)\n#endif\n\n#include \"stdafx.h\"\n#include \"Engine.h\"\n#include \"DirectoryProperties.h\"\n#include \"Mtu.h\"\n\n#define N_BANDS 4\n\n#define N_INPUT N_BANDS*2\n#define N_OUTPUT 2\n#define N_FILES N_INPUT\n\nint main()\n{\n\t\/\/ INPUTS\n\tTS_TO_FFT_TYPE ts2fft_type = FIXED_WINDOW_LENGTH;\n\tESTIMATOR_TYPE estimator_type = LEAST_SQUARES;\n\tRR_OR_SS_TYPE rrorss_type = SINGLE_SITE;\n\tstd::string inputPath = \"C:\\\\Users\\\\Usuario\\\\Google Drive\\\\Documentos\\\\MT data\\\\mtu ss\";\n\t\/\/std::string inputPath = \"C:\\\\Users\\\\leonardo\\\\Google Drive\\\\Documentos\\\\MT data\\\\mtu ss\";\n\t\/\/std::string inputPath = \"C:\\\\Users\\\\leonardo\\\\Google Drive\\\\Documentos\\\\MT data\\\\mtu ts5\";\n\n\t\/\/ object to explore the main path and its subfolders\n\tDirectoryProperties dirInfo( inputPath );\n\n\t\/\/ get stations name, path and type\n\tstd::vector<StationBase> station = dirInfo.initialize_stations();\n\n\t\/\/ read raw time-series\n\t\/\/ TODO - define timeVector properly for RR\n\tfor( int i = 0; i < station.size(); i++ )\n\t\tstation[i].read_time_series( &dirInfo );\n\n\t\/\/ build the draft for the time vector, considering all continuous acquisition\n\t\/\/ TODO - do it correctly\n\t\/\/Utils::draft_build_time_vector( station );\n\n\t\/\/ checkouts\n\tfor( int istn = 0; istn < station.size(); istn++ ) {\n\t\tfor( int its = 0; its < station[istn].ts.size(); its++ ) {\t\t\n\t\t\t\/\/station[istn].ts[its].timeVector[0].print();\n\t\t\t\/\/std::cout << endl << istn << \" \" << its << endl;\n\t\t\t\/\/for( int irow = 0; irow < station[istn].ts[its].ch[0].systemResponseFreqs[0].getDim(0); irow++ ) {\n\t\t\t\/\/\t\/\/std::cout << station[istn].ts[its].ch[0].systemResponseFreqs[0](irow) << \" \";\n\t\t\t\/\/\tfor( int ich = 0; ich < station[istn].ts[its].ch.size(); ich++ )\t{\n\t\t\t\/\/\t\tstation[istn].ts[its].ch[ich].gain = 1;\n\t\t\t\/\/\t\tstd::cout << station[istn].ts[its].ch[ich].gain << \" \";\n\t\t\t\/\/\t}\n\t\t\t\/\/\tstd::cout << std::endl;\n\t\t\t\/\/}\n\n\t\t\tcout << station[istn].ts[its].timeVector[station[istn].ts[its].timeVector.size() - 2] << \" \"\n\t\t\t\t<< station[istn].ts[its].timeVector[station[istn].ts[its].timeVector.size() - 1] << \" \"\n\t\t\t\t<< station[istn].ts[its].pTimeVector[station[istn].ts[its].pTimeVector.size() - 1] << endl;\n\t\t}\n\t\t\t\tstd::cout << std::endl;\n\t}\n\n\t\/\/ extract corrected (to physical units) Fourier coefficients \n\tStationBase::get_all_FCs( station, ts2fft_type, rrorss_type );\n\n\t\/\/ evaluate Z \n\tStationBase::get_Z( station, estimator_type );\n\n\t\/\/\/\/ checkouts\n\t\/\/for( int istn = 0; istn < station.size(); istn++ ) {\n\t\/\/\tfor( int its = 0; its < station[istn].ts.size(); its++ ) {\t\t\n\t\/\/\t\tcout << station[istn].ts[its].combination[0].idxStn[0] << endl;\t\n\t\/\/\t\tcout << station[istn].ts[its].combination[0].idxTs[0] << endl;\t\t\n\t\/\/\t\tstation[istn].ts[its].combination[0].idxBgn[0].print();\n\t\/\/\t\tstation[istn].ts[its].combination[0].idxEnd[0].print();\n\t\/\/\t}\n\t\/\/\tstd::cout << std::endl;\n\t\/\/}\n\n\t\/\/\t\t\t\/\/ checkout\n\t\/\/for( int istn = 0; istn < station.size(); istn++ )\n\t\/\/\tfor( int its = 0; its < station[istn].ts.size(); its++ )\n\t\/\/\t\tfor( int icomb = 0; icomb < station[istn].ts[its].combination.size(); icomb++ ) {\n\t\/\/\t\t\tfor( int ifreq = 0; ifreq < station[istn].ts[its].combination[icomb].fr.size(); ifreq++ ) \n\t\/\/\t\t\t\tcout << istn << \" \" << its << \" \" << icomb << \" \" << ifreq << \" \" << station[istn].ts[its].combination[icomb].fr[ifreq].frequency << endl;\n\t\/\/\t\t\tcout << endl;\n\t\/\/\t\t}\n\n\tWriteOutputs::WriteOutputs( station );\n\n\t\/\/ delete everything allocated\n\t\/\/ TODO\n\tUtils::delete_all( &station );\n\n\n\n\t\n\t\/\/int inputc;\n\t\/\/int outputc;\n\t\/\/char *input;\n\t\/\/char *output;\n\t\/\/unsigned int type = FILE_TYPE_MTU;\n\t\/\/int decimation = 5;\n\t\/\/BOOL robust = true;\n\n\t\/\/CEngineBase *engine = NULL;\n\t\/\/if(robust)\n\t\/\/\tengine = new CEngineRobust(\tinputc,\n\t\/\/\t\t\t\t\t\t\t\toutputc,\n\t\/\/\t\t\t\t\t\t\t\t&input,\n\t\/\/\t\t\t\t\t\t\t\t&output,\n\t\/\/\t\t\t\t\t\t\t\tstatic_cast<FILE_TYPE>(type),\n\t\/\/\t\t\t\t\t\t\t\tdecimation);\n\t\/\/else\n\t\/\/\tengine = new CEngine(\tinputc,\n\t\/\/\t\t\t\t\t\t\toutputc,\n\t\/\/\t\t\t\t\t\t\t&input,\n\t\/\/\t\t\t\t\t\t\t&output,\n\t\/\/\t\t\t\t\t\t\tstatic_cast<FILE_TYPE>(type),\n\t\/\/\t\t\t\t\t\t\tdecimation);\n\n\t\/\/int ret = engine->process();\n\t\/\/delete engine;\n\n\t\/\/return ret;\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#ifndef _SC_ACCESSIBLECELLBASE_HXX\n#define _SC_ACCESSIBLECELLBASE_HXX\n\n#include \"AccessibleContextBase.hxx\"\n#include \"global.hxx\"\n#include \"address.hxx\"\n#include <com\/sun\/star\/accessibility\/XAccessibleValue.hpp>\n#include <cppuhelper\/implbase1.hxx>\n\ntypedef cppu::ImplHelper1< ::com::sun::star::accessibility::XAccessibleValue>\n                    ScAccessibleCellBaseImpl;\n\nclass ScAccessibleCellBase\n    :   public ScAccessibleContextBase,\n        public ScAccessibleCellBaseImpl\n{\npublic:\n    \/\/=====  internal  ========================================================\n    ScAccessibleCellBase(\n        const ::com::sun::star::uno::Reference<\n        ::com::sun::star::accessibility::XAccessible>& rxParent,\n        ScDocument* pDoc,\n        const ScAddress& rCellAddress,\n        sal_Int32 nIndex);\nprotected:\n    virtual ~ScAccessibleCellBase();\npublic:\n\n    \/\/\/=====  XInterface  =====================================================\n\n    virtual ::com::sun::star::uno::Any SAL_CALL queryInterface(\n        ::com::sun::star::uno::Type const & rType )\n        throw (::com::sun::star::uno::RuntimeException);\n\n    virtual void SAL_CALL acquire() throw ();\n\n    virtual void SAL_CALL release() throw ();\n\n    \/\/\/=====  XAccessibleComponent  ============================================\n\n    virtual sal_Bool SAL_CALL isVisible()\n        throw (::com::sun::star::uno::RuntimeException, std::exception);\n\n    virtual sal_Int32 SAL_CALL getForeground(  )\n        throw (::com::sun::star::uno::RuntimeException);\n\n    virtual sal_Int32 SAL_CALL getBackground(  )\n        throw (::com::sun::star::uno::RuntimeException);\n\n    \/\/\/=====  XAccessibleContext  ==============================================\n\n    \/\/\/ Return this objects index among the parents children.\n    virtual sal_Int32 SAL_CALL\n        getAccessibleIndexInParent(void)\n        throw (::com::sun::star::uno::RuntimeException);\n\nprotected:\n    \/\/\/ Return this object's description.\n    virtual OUString SAL_CALL\n        createAccessibleDescription(void)\n        throw (::com::sun::star::uno::RuntimeException);\n\n    \/\/\/ Return the object's current name.\n    virtual OUString SAL_CALL\n        createAccessibleName(void)\n        throw (::com::sun::star::uno::RuntimeException);\n\npublic:\n    \/\/\/=====  XAccessibleValue  ================================================\n\n    virtual ::com::sun::star::uno::Any SAL_CALL\n        getCurrentValue()\n        throw (::com::sun::star::uno::RuntimeException,\n               std::exception);\n\n    virtual sal_Bool SAL_CALL\n        setCurrentValue( const ::com::sun::star::uno::Any& aNumber )\n        throw (::com::sun::star::uno::RuntimeException);\n\n    virtual ::com::sun::star::uno::Any SAL_CALL\n        getMaximumValue(  )\n        throw (::com::sun::star::uno::RuntimeException);\n\n    virtual ::com::sun::star::uno::Any SAL_CALL\n        getMinimumValue(  )\n        throw (::com::sun::star::uno::RuntimeException);\n\n    \/\/\/=====  XServiceInfo  ====================================================\n\n    \/** Returns an identifier for the implementation of this object.\n    *\/\n    virtual OUString SAL_CALL\n        getImplementationName(void)\n        throw (::com::sun::star::uno::RuntimeException);\n\n    \/\/\/=====  XTypeProvider  ===================================================\n\n    \/\/\/ returns the possible types\n    virtual ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > SAL_CALL\n        getTypes()\n        throw (::com::sun::star::uno::RuntimeException);\n\n    \/** Returns a implementation id.\n    *\/\n    virtual ::com::sun::star::uno::Sequence<sal_Int8> SAL_CALL\n        getImplementationId(void)\n        throw (::com::sun::star::uno::RuntimeException);\n\nprotected:\n    ScAddress maCellAddress;\n\n    ScDocument* mpDoc;\n\n    sal_Int32 mnIndex;\n\nprivate:\n    virtual bool IsEditable(\n        const com::sun::star::uno::Reference<\n        ::com::sun::star::accessibility::XAccessibleStateSet>& rxParentStates);\nprotected:\n    virtual OUString SAL_CALL GetNote(void)\n        throw (::com::sun::star::uno::RuntimeException);\n\n    virtual OUString SAL_CALL GetAllDisplayNote(void)\n        throw (::com::sun::star::uno::RuntimeException);\n    virtual OUString SAL_CALL getShadowAttrs(void)\n        throw (::com::sun::star::uno::RuntimeException);\n    virtual OUString SAL_CALL getBorderAttrs(void)\n        throw (::com::sun::star::uno::RuntimeException);\npublic:\n    const ScAddress& GetCellAddress() const { return maCellAddress; }\n    sal_Bool IsCellInChangeTrack(const ScAddress &cell,Color *pColCellBoder);\n};\n\n\n\n#endif\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>sal_Bool->bool<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#ifndef _SC_ACCESSIBLECELLBASE_HXX\n#define _SC_ACCESSIBLECELLBASE_HXX\n\n#include \"AccessibleContextBase.hxx\"\n#include \"global.hxx\"\n#include \"address.hxx\"\n#include <com\/sun\/star\/accessibility\/XAccessibleValue.hpp>\n#include <cppuhelper\/implbase1.hxx>\n\ntypedef cppu::ImplHelper1< ::com::sun::star::accessibility::XAccessibleValue>\n                    ScAccessibleCellBaseImpl;\n\nclass ScAccessibleCellBase\n    :   public ScAccessibleContextBase,\n        public ScAccessibleCellBaseImpl\n{\npublic:\n    \/\/=====  internal  ========================================================\n    ScAccessibleCellBase(\n        const ::com::sun::star::uno::Reference<\n        ::com::sun::star::accessibility::XAccessible>& rxParent,\n        ScDocument* pDoc,\n        const ScAddress& rCellAddress,\n        sal_Int32 nIndex);\nprotected:\n    virtual ~ScAccessibleCellBase();\npublic:\n\n    \/\/\/=====  XInterface  =====================================================\n\n    virtual ::com::sun::star::uno::Any SAL_CALL queryInterface(\n        ::com::sun::star::uno::Type const & rType )\n        throw (::com::sun::star::uno::RuntimeException);\n\n    virtual void SAL_CALL acquire() throw ();\n\n    virtual void SAL_CALL release() throw ();\n\n    \/\/\/=====  XAccessibleComponent  ============================================\n\n    virtual sal_Bool SAL_CALL isVisible()\n        throw (::com::sun::star::uno::RuntimeException, std::exception);\n\n    virtual sal_Int32 SAL_CALL getForeground(  )\n        throw (::com::sun::star::uno::RuntimeException);\n\n    virtual sal_Int32 SAL_CALL getBackground(  )\n        throw (::com::sun::star::uno::RuntimeException);\n\n    \/\/\/=====  XAccessibleContext  ==============================================\n\n    \/\/\/ Return this objects index among the parents children.\n    virtual sal_Int32 SAL_CALL\n        getAccessibleIndexInParent(void)\n        throw (::com::sun::star::uno::RuntimeException);\n\nprotected:\n    \/\/\/ Return this object's description.\n    virtual OUString SAL_CALL\n        createAccessibleDescription(void)\n        throw (::com::sun::star::uno::RuntimeException);\n\n    \/\/\/ Return the object's current name.\n    virtual OUString SAL_CALL\n        createAccessibleName(void)\n        throw (::com::sun::star::uno::RuntimeException);\n\npublic:\n    \/\/\/=====  XAccessibleValue  ================================================\n\n    virtual ::com::sun::star::uno::Any SAL_CALL\n        getCurrentValue()\n        throw (::com::sun::star::uno::RuntimeException,\n               std::exception);\n\n    virtual sal_Bool SAL_CALL\n        setCurrentValue( const ::com::sun::star::uno::Any& aNumber )\n        throw (::com::sun::star::uno::RuntimeException);\n\n    virtual ::com::sun::star::uno::Any SAL_CALL\n        getMaximumValue(  )\n        throw (::com::sun::star::uno::RuntimeException);\n\n    virtual ::com::sun::star::uno::Any SAL_CALL\n        getMinimumValue(  )\n        throw (::com::sun::star::uno::RuntimeException);\n\n    \/\/\/=====  XServiceInfo  ====================================================\n\n    \/** Returns an identifier for the implementation of this object.\n    *\/\n    virtual OUString SAL_CALL\n        getImplementationName(void)\n        throw (::com::sun::star::uno::RuntimeException);\n\n    \/\/\/=====  XTypeProvider  ===================================================\n\n    \/\/\/ returns the possible types\n    virtual ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > SAL_CALL\n        getTypes()\n        throw (::com::sun::star::uno::RuntimeException);\n\n    \/** Returns a implementation id.\n    *\/\n    virtual ::com::sun::star::uno::Sequence<sal_Int8> SAL_CALL\n        getImplementationId(void)\n        throw (::com::sun::star::uno::RuntimeException);\n\nprotected:\n    ScAddress maCellAddress;\n\n    ScDocument* mpDoc;\n\n    sal_Int32 mnIndex;\n\nprivate:\n    virtual bool IsEditable(\n        const com::sun::star::uno::Reference<\n        ::com::sun::star::accessibility::XAccessibleStateSet>& rxParentStates);\nprotected:\n    virtual OUString SAL_CALL GetNote(void)\n        throw (::com::sun::star::uno::RuntimeException);\n\n    virtual OUString SAL_CALL GetAllDisplayNote(void)\n        throw (::com::sun::star::uno::RuntimeException);\n    virtual OUString SAL_CALL getShadowAttrs(void)\n        throw (::com::sun::star::uno::RuntimeException);\n    virtual OUString SAL_CALL getBorderAttrs(void)\n        throw (::com::sun::star::uno::RuntimeException);\npublic:\n    const ScAddress& GetCellAddress() const { return maCellAddress; }\n    bool IsCellInChangeTrack(const ScAddress &cell,Color *pColCellBoder);\n};\n\n\n\n#endif\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Kopete Oscar Protocol\n    oscartypeclasses.cpp - Oscar Type Definitions\n\n    Copyright (c) 2004 Matt Rogers <mattr@kde.org>\n\n    Kopete (c) 2002-2004 by the Kopete developers <kopete-devel@kde.org>\n\n    *************************************************************************\n    *                                                                       *\n    * This library is free software; you can redistribute it and\/or         *\n    * modify it under the terms of the GNU Lesser General Public            *\n    * License as published by the Free Software Foundation; either          *\n    * version 2 of the License, or (at your option) any later version.      *\n    *                                                                       *\n    *************************************************************************\n*\/\n\n#include \"oscartypeclasses.h\"\n#include <q3deepcopy.h>\n#include <q3valuelist.h>\n#include <kdebug.h>\n#include \"oscarutils.h\"\n#include \"buffer.h\"\n\n\n\/\/ using namespace Oscar;\n\nOscar::TLV::TLV()\n:type(0), length(0)\n{\n}\n\nOscar::TLV::TLV( quint16 newType, quint16 newLength, char* newData )\n:type( newType ), length( newLength ), data( QByteArray( newData, length ) )\n{\n}\n\nOscar::TLV::TLV( quint16 newType, quint16 newLength, const QByteArray& newData )\n:type( newType ), length( newLength ), data( newData )\n{\n}\n\nOscar::TLV::TLV( const TLV& t )\n{\n\ttype = t.type;\n\tlength = t.length;\n\tdata = t.data;\n}\n\nOscar::TLV::operator bool() const\n{\n\treturn type != 0;\n}\n\n\nOscar::SSI::SSI()\n{\n\tm_gid = 0;\n\tm_bid = 0;\n\tm_type = 0xFFFF;\n\tm_tlvLength = 0;\n\tm_waitingAuth = false;\n}\n\nOscar::SSI::SSI( const QString &name, int gid, int bid, int type, const Q3ValueList<TLV> &tlvlist, int tlvLength )\n{\n\tm_name = name;\n\tm_gid = gid;\n\tm_bid = bid;\n\tm_type = type;\n\tm_tlvLength = tlvLength;\n\n\t\/\/deepcopy the tlvs\n\tm_tlvList = tlvlist;\n\tif ( m_tlvLength == 0 && !m_tlvList.isEmpty() )\n\t\trefreshTLVLength();\n\n\tcheckTLVs();\n}\n\nOscar::SSI::SSI( const Oscar::SSI& other )\n{\n\tm_name = other.m_name;\n\tm_gid = other.m_gid;\n\tm_bid = other.m_bid;\n\tm_type = other.m_type;\n\tm_tlvLength = other.m_tlvLength;\n\tm_alias = other.m_alias;\n\tm_waitingAuth = other.m_waitingAuth;\n\n\t\/\/deepcopy the tlvs\n\tm_tlvList = other.m_tlvList;\n\tif ( m_tlvLength == 0 && !m_tlvList.isEmpty() )\n\t\trefreshTLVLength();\n}\n\nbool Oscar::SSI::isValid() const\n{\n\treturn m_type != 0xFFFF;\n}\n\nQString Oscar::SSI::name() const\n{\n\treturn m_name;\n}\n\nquint16 Oscar::SSI::gid() const\n{\n\treturn m_gid;\n}\n\nquint16 Oscar::SSI::bid() const\n{\n\treturn m_bid;\n}\n\nquint16 Oscar::SSI::type() const\n{\n\treturn m_type;\n}\n\nconst Q3ValueList<TLV>& Oscar::SSI::tlvList() const\n{\n\treturn m_tlvList;\n}\n\nvoid Oscar::SSI::setTLVListLength( quint16 newLength )\n{\n\tm_tlvLength = newLength;\n}\n\nquint16 Oscar::SSI::tlvListLength() const\n{\n\treturn m_tlvLength;\n}\n\nvoid Oscar::SSI::setTLVList( Q3ValueList<TLV> list )\n{\n\t\/\/deepcopy the tlvs\n\tm_tlvList = list;\n\trefreshTLVLength();\n\tcheckTLVs();\n}\n\nvoid Oscar::SSI::refreshTLVLength()\n{\n\tm_tlvLength = 0;\n\tQ3ValueList<TLV>::iterator it = m_tlvList.begin();\n\tfor( ; it != m_tlvList.end(); ++it )\n\t{\n\t\tm_tlvLength += 4;\n\t\tm_tlvLength += (*it).length;\n\t}\n}\n\nvoid Oscar::SSI::checkTLVs()\n{\n\t\/\/check for the auth TLV\n\tTLV authTLV = findTLV( m_tlvList, 0x0066 );\n\tif ( authTLV )\n\t{\n\t\tkDebug(14151) << k_funcinfo << \"Need auth for contact \" << m_name << endl;\n\t\tm_waitingAuth = true;\n\t}\n\telse\n\t\tm_waitingAuth = false;\n\n\t\/\/check for the alias TLV\n\tTLV aliasTLV = findTLV( m_tlvList, 0x0131 );\n\tif ( aliasTLV )\n\t{\n\t\tm_alias = QString::fromUtf8( aliasTLV.data, aliasTLV.length );\n\t\tkDebug( 14151 ) << k_funcinfo << \"Got an alias '\" << m_alias << \"' for contact '\" << m_name << \"'\" << endl;\n\t}\n\n\tTLV privacyTLV = findTLV( m_tlvList, 0x00CA );\n\tif ( privacyTLV )\n\t\tkDebug(14151) << k_funcinfo << \"Found privacy settings \" << privacyTLV.data << endl;\n\n\tTLV infoTLV = findTLV( m_tlvList, 0x00CC );\n\tif ( infoTLV )\n\t\tkDebug(14151) << k_funcinfo << \"Found 'allow others to see...' options \" << infoTLV.data << endl;\n}\n\nQString Oscar::SSI::alias() const\n{\n\treturn m_alias;\n}\n\nvoid Oscar::SSI::setAlias( const QString& newAlias )\n{\n\tm_alias = newAlias;\n}\n\nbool Oscar::SSI::waitingAuth() const\n{\n\treturn m_waitingAuth;\n}\n\nvoid Oscar::SSI::setWaitingAuth( bool waiting )\n{\n\tm_waitingAuth = waiting;\n}\n\nvoid Oscar::SSI::setIconHash( QByteArray hash )\n{\n\tm_hash = hash;\n}\n\nQByteArray Oscar::SSI::iconHash( ) const\n{\n\treturn m_hash;\n}\n\nQString Oscar::SSI::toString() const\n{\n\tQString ssiString = QString::fromLatin1( \"name: \" );\n\tssiString += m_name;\n\tssiString += \" gid: \";\n\tssiString += QString::number( m_gid );\n\tssiString += \" bid: \";\n\tssiString += QString::number( m_bid );\n\tssiString += \" type: \";\n\tssiString += QString::number( m_type );\n\tssiString += \" tlv length: \";\n\tssiString += QString::number( m_tlvLength );\n\treturn ssiString;\n}\n\nbool Oscar::SSI::operator==( const SSI& item ) const\n{\n\tif ( m_name == item.name() && m_gid == item.gid() && m_bid == item.bid() && m_type == item.type() )\n\t\treturn true;\n\telse\n\t\treturn false;\n}\n\nOscar::SSI::operator bool() const\n{\n\treturn isValid();\n}\n\nOscar::SSI::operator QByteArray() const\n{\n\tBuffer b;\n\tQ3CString name( m_name.utf8() );\n\tuint namelen = name.length();\n\tconst char *namedata = name;\n\tb.addWord( namelen );\n\t\/\/ Using namedata instead of name because\n\t\/\/ Buffer::addString(QByteArray, DWORD) ignores it's second argument,\n\t\/\/ while Buffer::addString(const char*, DWORD) does not ignore it.\n\t\/\/ We must provide the explicit length argument to addString() because\n\t\/\/ we don't need trailing null byte to be added when automatic\n\t\/\/ conversion from QCString to QByteArray is performed.\n\t\/\/ This hack will not be needed with Qt 4.\n\tb.addString( namedata, namelen );\n\tb.addWord( m_gid );\n\tb.addWord( m_bid );\n\tb.addWord( m_type );\n\tb.addWord( m_tlvLength );\n\tQ3ValueList<Oscar::TLV>::const_iterator it = m_tlvList.begin();\n\tfor( ; it != m_tlvList.end(); ++it )\n\t{\n\t\tb.addWord( (*it).type );\n\t\tb.addWord( (*it).length );\n\t\tb.addString( (*it).data, (*it).data.size() );\n\t}\n\n\treturn (QByteArray) b;\n}\n\n\n\/\/kate: indent-mode csands;\n<commit_msg>I forgot to save the file before my last commit :)<commit_after>\/*\n    Kopete Oscar Protocol\n    oscartypeclasses.cpp - Oscar Type Definitions\n\n    Copyright (c) 2004 Matt Rogers <mattr@kde.org>\n\n    Kopete (c) 2002-2004 by the Kopete developers <kopete-devel@kde.org>\n\n    *************************************************************************\n    *                                                                       *\n    * This library is free software; you can redistribute it and\/or         *\n    * modify it under the terms of the GNU Lesser General Public            *\n    * License as published by the Free Software Foundation; either          *\n    * version 2 of the License, or (at your option) any later version.      *\n    *                                                                       *\n    *************************************************************************\n*\/\n\n#include \"oscartypeclasses.h\"\n#include <q3deepcopy.h>\n#include <q3valuelist.h>\n#include <kdebug.h>\n#include \"oscarutils.h\"\n#include \"buffer.h\"\n\n\n\/\/ using namespace Oscar;\n\nOscar::TLV::TLV()\n:type(0), length(0)\n{\n}\n\nOscar::TLV::TLV( quint16 newType, quint16 newLength, char* newData )\n:type( newType ), length( newLength ), data( QByteArray( newData, length ) )\n{\n}\n\nOscar::TLV::TLV( quint16 newType, quint16 newLength, const QByteArray& newData )\n:type( newType ), length( newLength ), data( newData )\n{\n}\n\nOscar::TLV::TLV( const TLV& t )\n:type( t.type ), length( t.length ), data( t.data )\n{\n}\n\nOscar::TLV::operator bool() const\n{\n\treturn type != 0;\n}\n\n\nOscar::SSI::SSI()\n{\n\tm_gid = 0;\n\tm_bid = 0;\n\tm_type = 0xFFFF;\n\tm_tlvLength = 0;\n\tm_waitingAuth = false;\n}\n\nOscar::SSI::SSI( const QString &name, int gid, int bid, int type, const Q3ValueList<TLV> &tlvlist, int tlvLength )\n{\n\tm_name = name;\n\tm_gid = gid;\n\tm_bid = bid;\n\tm_type = type;\n\tm_tlvLength = tlvLength;\n\n\t\/\/deepcopy the tlvs\n\tm_tlvList = tlvlist;\n\tif ( m_tlvLength == 0 && !m_tlvList.isEmpty() )\n\t\trefreshTLVLength();\n\n\tcheckTLVs();\n}\n\nOscar::SSI::SSI( const Oscar::SSI& other )\n{\n\tm_name = other.m_name;\n\tm_gid = other.m_gid;\n\tm_bid = other.m_bid;\n\tm_type = other.m_type;\n\tm_tlvLength = other.m_tlvLength;\n\tm_alias = other.m_alias;\n\tm_waitingAuth = other.m_waitingAuth;\n\n\t\/\/deepcopy the tlvs\n\tm_tlvList = other.m_tlvList;\n\tif ( m_tlvLength == 0 && !m_tlvList.isEmpty() )\n\t\trefreshTLVLength();\n}\n\nbool Oscar::SSI::isValid() const\n{\n\treturn m_type != 0xFFFF;\n}\n\nQString Oscar::SSI::name() const\n{\n\treturn m_name;\n}\n\nquint16 Oscar::SSI::gid() const\n{\n\treturn m_gid;\n}\n\nquint16 Oscar::SSI::bid() const\n{\n\treturn m_bid;\n}\n\nquint16 Oscar::SSI::type() const\n{\n\treturn m_type;\n}\n\nconst Q3ValueList<TLV>& Oscar::SSI::tlvList() const\n{\n\treturn m_tlvList;\n}\n\nvoid Oscar::SSI::setTLVListLength( quint16 newLength )\n{\n\tm_tlvLength = newLength;\n}\n\nquint16 Oscar::SSI::tlvListLength() const\n{\n\treturn m_tlvLength;\n}\n\nvoid Oscar::SSI::setTLVList( Q3ValueList<TLV> list )\n{\n\t\/\/deepcopy the tlvs\n\tm_tlvList = list;\n\trefreshTLVLength();\n\tcheckTLVs();\n}\n\nvoid Oscar::SSI::refreshTLVLength()\n{\n\tm_tlvLength = 0;\n\tQ3ValueList<TLV>::iterator it = m_tlvList.begin();\n\tfor( ; it != m_tlvList.end(); ++it )\n\t{\n\t\tm_tlvLength += 4;\n\t\tm_tlvLength += (*it).length;\n\t}\n}\n\nvoid Oscar::SSI::checkTLVs()\n{\n\t\/\/check for the auth TLV\n\tTLV authTLV = findTLV( m_tlvList, 0x0066 );\n\tif ( authTLV )\n\t{\n\t\tkDebug(14151) << k_funcinfo << \"Need auth for contact \" << m_name << endl;\n\t\tm_waitingAuth = true;\n\t}\n\telse\n\t\tm_waitingAuth = false;\n\n\t\/\/check for the alias TLV\n\tTLV aliasTLV = findTLV( m_tlvList, 0x0131 );\n\tif ( aliasTLV )\n\t{\n\t\tm_alias = QString::fromUtf8( aliasTLV.data, aliasTLV.length );\n\t\tkDebug( 14151 ) << k_funcinfo << \"Got an alias '\" << m_alias << \"' for contact '\" << m_name << \"'\" << endl;\n\t}\n\n\tTLV privacyTLV = findTLV( m_tlvList, 0x00CA );\n\tif ( privacyTLV )\n\t\tkDebug(14151) << k_funcinfo << \"Found privacy settings \" << privacyTLV.data << endl;\n\n\tTLV infoTLV = findTLV( m_tlvList, 0x00CC );\n\tif ( infoTLV )\n\t\tkDebug(14151) << k_funcinfo << \"Found 'allow others to see...' options \" << infoTLV.data << endl;\n}\n\nQString Oscar::SSI::alias() const\n{\n\treturn m_alias;\n}\n\nvoid Oscar::SSI::setAlias( const QString& newAlias )\n{\n\tm_alias = newAlias;\n}\n\nbool Oscar::SSI::waitingAuth() const\n{\n\treturn m_waitingAuth;\n}\n\nvoid Oscar::SSI::setWaitingAuth( bool waiting )\n{\n\tm_waitingAuth = waiting;\n}\n\nvoid Oscar::SSI::setIconHash( QByteArray hash )\n{\n\tm_hash = hash;\n}\n\nQByteArray Oscar::SSI::iconHash( ) const\n{\n\treturn m_hash;\n}\n\nQString Oscar::SSI::toString() const\n{\n\tQString ssiString = QString::fromLatin1( \"name: \" );\n\tssiString += m_name;\n\tssiString += \" gid: \";\n\tssiString += QString::number( m_gid );\n\tssiString += \" bid: \";\n\tssiString += QString::number( m_bid );\n\tssiString += \" type: \";\n\tssiString += QString::number( m_type );\n\tssiString += \" tlv length: \";\n\tssiString += QString::number( m_tlvLength );\n\treturn ssiString;\n}\n\nbool Oscar::SSI::operator==( const SSI& item ) const\n{\n\tif ( m_name == item.name() && m_gid == item.gid() && m_bid == item.bid() && m_type == item.type() )\n\t\treturn true;\n\telse\n\t\treturn false;\n}\n\nOscar::SSI::operator bool() const\n{\n\treturn isValid();\n}\n\nOscar::SSI::operator QByteArray() const\n{\n\tBuffer b;\n\tQ3CString name( m_name.utf8() );\n\tuint namelen = name.length();\n\tconst char *namedata = name;\n\tb.addWord( namelen );\n\t\/\/ Using namedata instead of name because\n\t\/\/ Buffer::addString(QByteArray, DWORD) ignores it's second argument,\n\t\/\/ while Buffer::addString(const char*, DWORD) does not ignore it.\n\t\/\/ We must provide the explicit length argument to addString() because\n\t\/\/ we don't need trailing null byte to be added when automatic\n\t\/\/ conversion from QCString to QByteArray is performed.\n\t\/\/ This hack will not be needed with Qt 4.\n\tb.addString( namedata, namelen );\n\tb.addWord( m_gid );\n\tb.addWord( m_bid );\n\tb.addWord( m_type );\n\tb.addWord( m_tlvLength );\n\tQ3ValueList<Oscar::TLV>::const_iterator it = m_tlvList.begin();\n\tfor( ; it != m_tlvList.end(); ++it )\n\t{\n\t\tb.addWord( (*it).type );\n\t\tb.addWord( (*it).length );\n\t\tb.addString( (*it).data, (*it).data.size() );\n\t}\n\n\treturn (QByteArray) b;\n}\n\n\n\/\/kate: indent-mode csands;\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Kopete Yahoo Protocol\n    Send a message\n\n    Copyright (c) 2005 André Duffeck <andre.duffeck@kdemail.net>\n\n    *************************************************************************\n    *                                                                       *\n    * This library is free software; you can redistribute it and\/or         *\n    * modify it under the terms of the GNU Lesser General Public            *\n    * License as published by the Free Software Foundation; either          *\n    * version 2 of the License, or (at your option) any later version.      *\n    *                                                                       *\n    *************************************************************************\n*\/\n\n#include \"sendmessagetask.h\"\n#include \"transfer.h\"\n#include \"ymsgtransfer.h\"\n#include \"yahootypes.h\"\n#include \"client.h\"\n#include <qstring.h>\n#include <kdebug.h>\n\nSendMessageTask::SendMessageTask(Task* parent) : Task(parent)\n{\n\tkdDebug(YAHOO_RAW_DEBUG) << k_funcinfo << endl;\n}\n\nSendMessageTask::~SendMessageTask()\n{\n}\n\nvoid SendMessageTask::onGo()\n{\n\tkdDebug(YAHOO_RAW_DEBUG) << k_funcinfo << endl;\n\n\tif( m_text.isEmpty() )\n\t{\n\t\tkdDebug(YAHOO_RAW_DEBUG) << k_funcinfo << \"Text to send is empty.\" << endl;\n\t\treturn;\n\t}\t\n\n\tYMSGTransfer *t = new YMSGTransfer(Yahoo::ServiceMessage, Yahoo::StatusOffline);\n\tt->setId( client()->sessionID() );\n\tt->setParam( 1, client()->userId().local8Bit() );\n\tt->setParam( 5, m_target.local8Bit() );\n\tt->setParam( 14, m_text.utf8() );\n\tt->setParam( 63, \";0\" );\n\tt->setParam( 64, \"0\"  );\t\n\tt->setParam( 97, 1 );\t\/\/ UTF-8\n\tt->setParam( 206, client()->pictureFlag() );\t\n\tsend( t );\n\t\n\tsetSuccess( true );\n}\n\nvoid SendMessageTask::setTarget( const QString &to )\n{\n\tm_target = to;\n}\n\nvoid SendMessageTask::setText( const QString &text )\n{\n\tm_text = text;\n}\n\nvoid SendMessageTask::setPicureFlag( int flag )\n{\n\tm_pictureFlag = flag;\n}\n<commit_msg>Split messages that are too long to be accepted by the server.<commit_after>\/*\n    Kopete Yahoo Protocol\n    Send a message\n\n    Copyright (c) 2005 André Duffeck <andre.duffeck@kdemail.net>\n\n    *************************************************************************\n    *                                                                       *\n    * This library is free software; you can redistribute it and\/or         *\n    * modify it under the terms of the GNU Lesser General Public            *\n    * License as published by the Free Software Foundation; either          *\n    * version 2 of the License, or (at your option) any later version.      *\n    *                                                                       *\n    *************************************************************************\n*\/\n\n#include \"sendmessagetask.h\"\n#include \"transfer.h\"\n#include \"ymsgtransfer.h\"\n#include \"yahootypes.h\"\n#include \"client.h\"\n#include <qstring.h>\n#include <kdebug.h>\n\nSendMessageTask::SendMessageTask(Task* parent) : Task(parent)\n{\n\tkdDebug(YAHOO_RAW_DEBUG) << k_funcinfo << endl;\n}\n\nSendMessageTask::~SendMessageTask()\n{\n}\n\nvoid SendMessageTask::onGo()\n{\n\tkdDebug(YAHOO_RAW_DEBUG) << k_funcinfo << endl;\n\n\tif( m_text.isEmpty() )\n\t{\n\t\tkdDebug(YAHOO_RAW_DEBUG) << k_funcinfo << \"Text to send is empty.\" << endl;\n\t\treturn;\n\t}\t\n\tuint pos=0;\n\t\n\t\/\/ split messages that are longer than 800 chars. they get dropped otherwise\n\twhile( pos < m_text.length() )\n\t{\n\t\tYMSGTransfer *t = new YMSGTransfer(Yahoo::ServiceMessage, Yahoo::StatusOffline);\n\t\tt->setId( client()->sessionID() );\n\t\tt->setParam( 1, client()->userId().local8Bit() );\n\t\tt->setParam( 5, m_target.local8Bit() );\n\t\tt->setParam( 14, m_text.mid( pos, 700).utf8() );\n\t\tt->setParam( 63, \";0\" );\n\t\tt->setParam( 64, \"0\"  );\t\n\t\tt->setParam( 97, 1 );\t\/\/ UTF-8\n\t\tt->setParam( 206, client()->pictureFlag() );\t\n\t\tsend( t );\n\n\t\tpos += 700;\n\t}\n\t\n\tsetSuccess( true );\n}\n\nvoid SendMessageTask::setTarget( const QString &to )\n{\n\tm_target = to;\n}\n\nvoid SendMessageTask::setText( const QString &text )\n{\n\tm_text = text;\n}\n\nvoid SendMessageTask::setPicureFlag( int flag )\n{\n\tm_pictureFlag = flag;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/new:$Name$:$Id$\n\/\/ Author: M.Ivanov   18\/06\/2007  -- Anar Manafov (A.Manafov@gsi.de) 28\/04\/2008\n\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\/\/\n\/\/  TMemStatDepend - non standard C++ functions - Needed to make\n\/\/  memory statistic (Used by TMemStatManager)\n\/\/\n\/\/  To be implemented for differnt platforms.\n\/\/______________________________________________________________________________\n\n\n\/\/STD\n#include <string>\n#include <vector>\n\/\/ ROOT\n#include \"TString.h\"\n\/\/ API\n#if defined(MAC_OS_X_VERSION_10_5)\n#include <malloc\/malloc.h>\n#else\n#include <malloc.h>\n#endif\n#include <execinfo.h>\n#include <cxxabi.h>\n\/\/ MemStat\n#include \"TMemStatDepend.h\"\n\n#if defined(R__GNU) && (defined(R__LINUX) || defined(R__HURD)) && !defined(__alpha__)\n#define SUPPORTS_MEMSTAT\n#endif\n\n\/\/ This is a global variable set at MSManager init time.\n\/\/ It marks the highest used stack address.\nvoid *g_global_stack_end = NULL;\n\n#if defined(SUPPORTS_MEMSTAT)\n\/\/ Comment from Anar:\n\/\/ HACK: there is an ugly bug in gcc (Bug#8743): http:\/\/gcc.gnu.org\/bugzilla\/show_bug.cgi?id=8743\n\/\/ \"receiving result from __builtin_return_address() beyond stack top causes segfault\"\n\/\/ NOTE that __builtin_return_address should only be used with a non-zero argument for\n\/\/ debugging purposes. So we use it on our risk.\n\/\/ A workaround:\n\/\/ This means the address is out of range.  Note that for the\n\/\/ toplevel we see a frame pointer with value NULL which clearly is out of range.\n\/\/ NOTE 2: With gcc 4.1, some optimization levels (e.g., -O, -Os, -O2) have started to imply -fomit-frame-pointer.\n\/\/ One should use GCC builtin function with -fno-omit-frame-pointer option.\n#define G__builtin_return_address(N) \\\n ((__builtin_frame_address(N) == NULL)  || \\\n  (__builtin_frame_address(N) >= g_global_stack_end) || \\\n  (__builtin_frame_address(N) < __builtin_frame_address(0))) ? \\\n  NULL : __builtin_return_address(N)\n\/\/ __builtin_return_address(0) yields the address to which the current\n\/\/ function will return.  __builtin_return_address(1) yields the address to\n\/\/ which the caller will return, and so on up the stack.\n#define _RET_ADDR(x)   case x: return G__builtin_return_address(x);\n\n#endif\n\nusing namespace std;\n\nClassImp(TMemStatDepend)\n\n\n\/\/______________________________________________________________________________\nstatic void *return_address(int _frame)\n{\n   \/\/ we have a limit on the depth = 35\n\n#if defined(SUPPORTS_MEMSTAT)\n   switch (_frame) {\n      _RET_ADDR(0);_RET_ADDR(1);_RET_ADDR(2);_RET_ADDR(3);_RET_ADDR(4);_RET_ADDR(5);_RET_ADDR(6);_RET_ADDR(7);\n      _RET_ADDR(8);_RET_ADDR(9);_RET_ADDR(10);_RET_ADDR(11);_RET_ADDR(12);_RET_ADDR(13);_RET_ADDR(14);\n      _RET_ADDR(15);_RET_ADDR(16);_RET_ADDR(17);_RET_ADDR(18);_RET_ADDR(19);_RET_ADDR(20);_RET_ADDR(21);\n      _RET_ADDR(22);_RET_ADDR(23);_RET_ADDR(24);_RET_ADDR(25);_RET_ADDR(26);_RET_ADDR(27);_RET_ADDR(28);\n      _RET_ADDR(29);_RET_ADDR(30);_RET_ADDR(31);_RET_ADDR(32);_RET_ADDR(33);_RET_ADDR(34);_RET_ADDR(35);\n   default:\n      return 0;\n   }\n#else\n   if (_frame) { }\n   return 0;\n#endif\n}\n\n\/\/______________________________________________________________________________\nsize_t builtin_return_address(void **_Container, size_t _limit)\n{\n   size_t i(0);\n   void *addr;\n   for (i = 0; (i < _limit) && (addr = return_address(i)); ++i)\n      _Container[i] = addr;\n   return i;\n}\n\n\/\/______________________________________________________________________________\nTMemStatDepend::MallocHookFunc_t TMemStatDepend::GetMallocHook()\n{\n   \/\/malloc function getter\n\n#if defined(SUPPORTS_MEMSTAT)\n   return __malloc_hook;\n#else\n   return 0;\n#endif\n}\n\n\/\/______________________________________________________________________________\nTMemStatDepend::FreeHookFunc_t TMemStatDepend::GetFreeHook()\n{\n   \/\/free function   getter\n\n#if defined(SUPPORTS_MEMSTAT)\n   return __free_hook;\n#else\n   return 0;\n#endif\n}\n\n\/\/______________________________________________________________________________\nvoid TMemStatDepend::SetMallocHook(MallocHookFunc_t p)\n{\n   \/\/ Set pointer to function replacing alloc function\n\n#if defined(SUPPORTS_MEMSTAT)\n   __malloc_hook = p;\n#else\n   if (p) { }\n#endif\n}\n\n\/\/______________________________________________________________________________\nvoid TMemStatDepend::SetFreeHook(FreeHookFunc_t p)\n{\n   \/\/ Set pointer to function replacing free function\n\n#if defined(SUPPORTS_MEMSTAT)\n   __free_hook = p;\n#else\n   if (p) { }\n#endif\n}\n\n\/\/______________________________________________________________________________\nsize_t TMemStatDepend::Backtrace(void **trace, size_t dsize, Bool_t _bUseGNUBuildinBacktrace)\n{\n   \/\/ Get the backtrace\n   \/\/ dsize - maximal deepness of stack information\n   \/\/ trace - array of pointers\n   \/\/ return value =  min(stack deepness, dsize)\n\n   if ( _bUseGNUBuildinBacktrace )\n   {\n#if defined(SUPPORTS_MEMSTAT)\n      \/\/ Initialize the stack end variable.\n      return builtin_return_address(trace, dsize);\n#else\n      if (trace || dsize) { }\n      return 0;\n#endif\n   }\n#if defined(R__MACOSX)\n#if defined(MAC_OS_X_VERSION_10_5)\n   return backtrace(trace, dsize);\n#else\n   if (trace || dsize) { }\n   return 0;\n#endif\n#else\n   return backtrace(trace, dsize);\n#endif\n}\n\n\/\/______________________________________________________________________________\nchar** TMemStatDepend::BacktraceSymbols(void **trace, size_t size)\n{\n   \/\/ TODO: Comment me\n\n#if defined(SUPPORTS_MEMSTAT)\n   return backtrace_symbols(trace, size);\n#else\n   if (trace || size) { }\n#endif\n   return 0;\n}\n\n\/\/______________________________________________________________________________\nvoid TMemStatDepend::GetSymbols(void *_pFunction,\n                                TString &_strInfo, TString &_strLib, TString &_strFun, TString &\/*_strLine*\/)\n{\n   \/\/ get the name of the function and library\n\n#if defined(SUPPORTS_MEMSTAT)\n   char ** code = backtrace_symbols(&_pFunction, 1);\n   if (!code || !code[0])\n      return;\n   const string codeInfo(code[0]);\n   \/\/ it is the responsibility of the caller to free that pointer\n   free(code);\n\n   \/\/ information about the call\n   _strInfo = codeInfo.c_str();\n\n   \/\/ Resolving a library name\n   const string::size_type pos_begin = codeInfo.find_first_of(\"( [\");\n   if (string::npos == pos_begin) {\n      _strLib = codeInfo;\n      return;\n   }\n   _strLib = codeInfo.substr(0, pos_begin);\n\n   \/\/ Resolving a function name\n   string::size_type pos_end = codeInfo.find('+', pos_begin);\n   if (string::npos == pos_end) {\n      pos_end = codeInfo.find(')', pos_begin);\n      if (string::npos == pos_end)\n         return; \/\/ TODO: log me!\n   }\n   const string func(codeInfo.substr(pos_begin + 1, pos_end - pos_begin - 1));\n\n   \/\/ Demangling the function name\n   int status(0);\n   char *ch = abi::__cxa_demangle(func.c_str(), 0, 0, &status);\n   if (!ch)\n      return;\n   _strFun = (!status) ? ch : func.c_str();\n   \/\/ it is the responsibility of the caller to free that pointer\n   free(ch);\n#else\n   if (!_pFunction) { _strInfo = \"\"; _strLib = \"\"; _strFun = \"\"; }\n#endif\n}\n\n\/\/______________________________________________________________________________\nvoid TMemStatDepend::Demangle(char *codeInfo, TString &str)\n{\n   \/\/    get the name of the function and library\n\n#if defined(SUPPORTS_MEMSTAT)\n   int status = 0;\n   char *ch = abi::__cxa_demangle(codeInfo, 0, 0, &status);\n   if (ch) {\n      str = ch;\n      free(ch);\n   } else {\n      str = \"unknown\";\n   }\n#else\n   if (!codeInfo) { str = \"\"; }\n#endif\n}\n<commit_msg>fix compilation failure on Mac OS X 10.4.<commit_after>\/\/ @(#)root\/new:$Name$:$Id$\n\/\/ Author: M.Ivanov   18\/06\/2007  -- Anar Manafov (A.Manafov@gsi.de) 28\/04\/2008\n\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\/\/\n\/\/  TMemStatDepend - non standard C++ functions - Needed to make\n\/\/  memory statistic (Used by TMemStatManager)\n\/\/\n\/\/  To be implemented for differnt platforms.\n\/\/______________________________________________________________________________\n\n\n\/\/STD\n#include <string>\n#include <vector>\n\/\/ ROOT\n#include \"TString.h\"\n\/\/ API\n#if defined(R__MACOSX)\n#if defined(MAC_OS_X_VERSION_10_5)\n#include <malloc\/malloc.h>\n#include <execinfo.h>\n#endif\n#else\n#include <malloc.h>\n#include <execinfo.h>\n#endif\n#include <cxxabi.h>\n\/\/ MemStat\n#include \"TMemStatDepend.h\"\n\n#if defined(R__GNU) && (defined(R__LINUX) || defined(R__HURD)) && !defined(__alpha__)\n#define SUPPORTS_MEMSTAT\n#endif\n\n\/\/ This is a global variable set at MSManager init time.\n\/\/ It marks the highest used stack address.\nvoid *g_global_stack_end = NULL;\n\n#if defined(SUPPORTS_MEMSTAT)\n\/\/ Comment from Anar:\n\/\/ HACK: there is an ugly bug in gcc (Bug#8743): http:\/\/gcc.gnu.org\/bugzilla\/show_bug.cgi?id=8743\n\/\/ \"receiving result from __builtin_return_address() beyond stack top causes segfault\"\n\/\/ NOTE that __builtin_return_address should only be used with a non-zero argument for\n\/\/ debugging purposes. So we use it on our risk.\n\/\/ A workaround:\n\/\/ This means the address is out of range.  Note that for the\n\/\/ toplevel we see a frame pointer with value NULL which clearly is out of range.\n\/\/ NOTE 2: With gcc 4.1, some optimization levels (e.g., -O, -Os, -O2) have started to imply -fomit-frame-pointer.\n\/\/ One should use GCC builtin function with -fno-omit-frame-pointer option.\n#define G__builtin_return_address(N) \\\n ((__builtin_frame_address(N) == NULL)  || \\\n  (__builtin_frame_address(N) >= g_global_stack_end) || \\\n  (__builtin_frame_address(N) < __builtin_frame_address(0))) ? \\\n  NULL : __builtin_return_address(N)\n\/\/ __builtin_return_address(0) yields the address to which the current\n\/\/ function will return.  __builtin_return_address(1) yields the address to\n\/\/ which the caller will return, and so on up the stack.\n#define _RET_ADDR(x)   case x: return G__builtin_return_address(x);\n\n#endif\n\nusing namespace std;\n\nClassImp(TMemStatDepend)\n\n\n\/\/______________________________________________________________________________\nstatic void *return_address(int _frame)\n{\n   \/\/ we have a limit on the depth = 35\n\n#if defined(SUPPORTS_MEMSTAT)\n   switch (_frame) {\n      _RET_ADDR(0);_RET_ADDR(1);_RET_ADDR(2);_RET_ADDR(3);_RET_ADDR(4);_RET_ADDR(5);_RET_ADDR(6);_RET_ADDR(7);\n      _RET_ADDR(8);_RET_ADDR(9);_RET_ADDR(10);_RET_ADDR(11);_RET_ADDR(12);_RET_ADDR(13);_RET_ADDR(14);\n      _RET_ADDR(15);_RET_ADDR(16);_RET_ADDR(17);_RET_ADDR(18);_RET_ADDR(19);_RET_ADDR(20);_RET_ADDR(21);\n      _RET_ADDR(22);_RET_ADDR(23);_RET_ADDR(24);_RET_ADDR(25);_RET_ADDR(26);_RET_ADDR(27);_RET_ADDR(28);\n      _RET_ADDR(29);_RET_ADDR(30);_RET_ADDR(31);_RET_ADDR(32);_RET_ADDR(33);_RET_ADDR(34);_RET_ADDR(35);\n   default:\n      return 0;\n   }\n#else\n   if (_frame) { }\n   return 0;\n#endif\n}\n\n\/\/______________________________________________________________________________\nsize_t builtin_return_address(void **_Container, size_t _limit)\n{\n   size_t i(0);\n   void *addr;\n   for (i = 0; (i < _limit) && (addr = return_address(i)); ++i)\n      _Container[i] = addr;\n   return i;\n}\n\n\/\/______________________________________________________________________________\nTMemStatDepend::MallocHookFunc_t TMemStatDepend::GetMallocHook()\n{\n   \/\/malloc function getter\n\n#if defined(SUPPORTS_MEMSTAT)\n   return __malloc_hook;\n#else\n   return 0;\n#endif\n}\n\n\/\/______________________________________________________________________________\nTMemStatDepend::FreeHookFunc_t TMemStatDepend::GetFreeHook()\n{\n   \/\/free function   getter\n\n#if defined(SUPPORTS_MEMSTAT)\n   return __free_hook;\n#else\n   return 0;\n#endif\n}\n\n\/\/______________________________________________________________________________\nvoid TMemStatDepend::SetMallocHook(MallocHookFunc_t p)\n{\n   \/\/ Set pointer to function replacing alloc function\n\n#if defined(SUPPORTS_MEMSTAT)\n   __malloc_hook = p;\n#else\n   if (p) { }\n#endif\n}\n\n\/\/______________________________________________________________________________\nvoid TMemStatDepend::SetFreeHook(FreeHookFunc_t p)\n{\n   \/\/ Set pointer to function replacing free function\n\n#if defined(SUPPORTS_MEMSTAT)\n   __free_hook = p;\n#else\n   if (p) { }\n#endif\n}\n\n\/\/______________________________________________________________________________\nsize_t TMemStatDepend::Backtrace(void **trace, size_t dsize, Bool_t _bUseGNUBuildinBacktrace)\n{\n   \/\/ Get the backtrace\n   \/\/ dsize - maximal deepness of stack information\n   \/\/ trace - array of pointers\n   \/\/ return value =  min(stack deepness, dsize)\n\n   if ( _bUseGNUBuildinBacktrace )\n   {\n#if defined(SUPPORTS_MEMSTAT)\n      \/\/ Initialize the stack end variable.\n      return builtin_return_address(trace, dsize);\n#else\n      if (trace || dsize) { }\n      return 0;\n#endif\n   }\n#if defined(R__MACOSX)\n#if defined(MAC_OS_X_VERSION_10_5)\n   return backtrace(trace, dsize);\n#else\n   if (trace || dsize) { }\n   return 0;\n#endif\n#else\n   return backtrace(trace, dsize);\n#endif\n}\n\n\/\/______________________________________________________________________________\nchar** TMemStatDepend::BacktraceSymbols(void **trace, size_t size)\n{\n   \/\/ TODO: Comment me\n\n#if defined(SUPPORTS_MEMSTAT)\n   return backtrace_symbols(trace, size);\n#else\n   if (trace || size) { }\n#endif\n   return 0;\n}\n\n\/\/______________________________________________________________________________\nvoid TMemStatDepend::GetSymbols(void *_pFunction,\n                                TString &_strInfo, TString &_strLib, TString &_strFun, TString &\/*_strLine*\/)\n{\n   \/\/ get the name of the function and library\n\n#if defined(SUPPORTS_MEMSTAT)\n   char ** code = backtrace_symbols(&_pFunction, 1);\n   if (!code || !code[0])\n      return;\n   const string codeInfo(code[0]);\n   \/\/ it is the responsibility of the caller to free that pointer\n   free(code);\n\n   \/\/ information about the call\n   _strInfo = codeInfo.c_str();\n\n   \/\/ Resolving a library name\n   const string::size_type pos_begin = codeInfo.find_first_of(\"( [\");\n   if (string::npos == pos_begin) {\n      _strLib = codeInfo;\n      return;\n   }\n   _strLib = codeInfo.substr(0, pos_begin);\n\n   \/\/ Resolving a function name\n   string::size_type pos_end = codeInfo.find('+', pos_begin);\n   if (string::npos == pos_end) {\n      pos_end = codeInfo.find(')', pos_begin);\n      if (string::npos == pos_end)\n         return; \/\/ TODO: log me!\n   }\n   const string func(codeInfo.substr(pos_begin + 1, pos_end - pos_begin - 1));\n\n   \/\/ Demangling the function name\n   int status(0);\n   char *ch = abi::__cxa_demangle(func.c_str(), 0, 0, &status);\n   if (!ch)\n      return;\n   _strFun = (!status) ? ch : func.c_str();\n   \/\/ it is the responsibility of the caller to free that pointer\n   free(ch);\n#else\n   if (!_pFunction) { _strInfo = \"\"; _strLib = \"\"; _strFun = \"\"; }\n#endif\n}\n\n\/\/______________________________________________________________________________\nvoid TMemStatDepend::Demangle(char *codeInfo, TString &str)\n{\n   \/\/    get the name of the function and library\n\n#if defined(SUPPORTS_MEMSTAT)\n   int status = 0;\n   char *ch = abi::__cxa_demangle(codeInfo, 0, 0, &status);\n   if (ch) {\n      str = ch;\n      free(ch);\n   } else {\n      str = \"unknown\";\n   }\n#else\n   if (!codeInfo) { str = \"\"; }\n#endif\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 <atlbase.h>\n#include <iostream>\n\n#include \"base\/path_service.h\"\n#include \"base\/platform_thread.h\"\n#include \"base\/process_util.h\"\n#include \"base\/sys_info.h\"\n#include \"chrome\/common\/env_vars.h\"\n#include \"base\/test\/test_suite.h\"\n#include \"base\/command_line.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n\n#include \"chrome_frame\/test\/chrome_frame_test_utils.h\"\n#include \"chrome_frame\/test\/http_server.h\"\n#include \"chrome_frame\/test_utils.h\"\n#include \"chrome_frame\/utils.h\"\n\n\/\/ To enable ATL-based code to run in this module\nclass ChromeFrameUnittestsModule\n    : public CAtlExeModuleT<ChromeFrameUnittestsModule> {\n public:\n  static HRESULT InitializeCom() {\n    return CoInitializeEx(NULL, COINIT_APARTMENTTHREADED);\n  }\n};\n\nChromeFrameUnittestsModule _AtlModule;\n\nconst wchar_t kNoRegistrationSwitch[] = L\"no-registration\";\n\n\/\/ Causes the test executable to just run the web server and quit when the\n\/\/ server is killed. Useful for debugging tests.\nconst wchar_t kRunAsServer[] = L\"server\";\n\nvoid PureCall() {\n  __debugbreak();\n}\n\nint main(int argc, char **argv) {\n  base::EnableTerminationOnHeapCorruption();\n  PlatformThread::SetName(\"ChromeFrame tests\");\n\n  _set_purecall_handler(PureCall);\n\n  TestSuite test_suite(argc, argv);\n\n  if (CommandLine::ForCurrentProcess()->HasSwitch(kRunAsServer)) {\n    ChromeFrameHTTPServer server;\n    server.SetUp();\n    GURL server_url(server.test_server()->GetURL(\"\"));\n    std::cout << std::endl\n              << \"Server waiting on \" << server_url.spec().c_str()\n              << std::endl << std::endl\n              << \"Test output will be written to \"\n              << server.test_server()->document_root().value() << \"\\\\dump\"\n              << std::endl << std::endl\n              << \"Hit Ctrl-C or navigate to \"\n              << server_url.spec().c_str() << \"kill to shut down the server.\"\n              << std::endl;\n    server.WaitToFinish(INFINITE);\n    server.TearDown();\n    std::cout << \"Server stopped.\";\n    return 0;\n  }\n\n  SetConfigBool(kChromeFrameHeadlessMode, true);\n\n  \/\/ Pretend that a screenreader is in use to cause Chrome to generate the\n  \/\/ accessibility tree during page load. Otherwise, Chrome will send back\n  \/\/ an unpopulated tree for the first request while it fetches the tree\n  \/\/ from the renderer.\n  BOOL is_screenreader_on = FALSE;\n  SystemParametersInfo(SPI_SETSCREENREADER, TRUE, NULL, 0);\n  SystemParametersInfo(SPI_GETSCREENREADER, 0, &is_screenreader_on, 0);\n  if (!is_screenreader_on) {\n    LOG(ERROR) << \"Could not set screenreader property. Tests depending on \"\n               << \"MSAA in CF will likely fail...\";\n  }\n\n  base::ProcessHandle crash_service = chrome_frame_test::StartCrashService();\n  int ret = -1;\n  \/\/ If mini_installer is used to register CF, we use the switch\n  \/\/ --no-registration to avoid repetitive registration.\n  if (CommandLine::ForCurrentProcess()->HasSwitch(kNoRegistrationSwitch)) {\n    ret = test_suite.Run();\n  } else {\n    \/\/ Register paths needed by the ScopedChromeFrameRegistrar.\n    chrome::RegisterPathProvider();\n\n    \/\/ This will register the chrome frame in the build directory. It currently\n    \/\/ leaves that chrome frame registered once the tests are done. It must be\n    \/\/ constructed AFTER the TestSuite is created since TestSuites create THE\n    \/\/ AtExitManager.\n    \/\/ TODO(robertshield): Make these tests restore the original registration\n    \/\/ once done.\n    ScopedChromeFrameRegistrar registrar;\n    ret = test_suite.Run();\n  }\n\n  DeleteConfigValue(kChromeFrameHeadlessMode);\n\n  if (crash_service)\n    base::KillProcess(crash_service, 0, false);\n}\n<commit_msg>Remove the last usage of the python web server from chrome frame tests<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 <atlbase.h>\n\n#include \"base\/process_util.h\"\n#include \"base\/test\/test_suite.h\"\n#include \"base\/command_line.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome_frame\/test\/chrome_frame_test_utils.h\"\n#include \"chrome_frame\/test_utils.h\"\n#include \"chrome_frame\/utils.h\"\n\n\/\/ To enable ATL-based code to run in this module\nclass ChromeFrameUnittestsModule\n    : public CAtlExeModuleT<ChromeFrameUnittestsModule> {\n public:\n  static HRESULT InitializeCom() {\n    return CoInitializeEx(NULL, COINIT_APARTMENTTHREADED);\n  }\n};\n\nChromeFrameUnittestsModule _AtlModule;\n\nconst wchar_t kNoRegistrationSwitch[] = L\"no-registration\";\n\nvoid PureCall() {\n  __debugbreak();\n}\n\nint main(int argc, char **argv) {\n  base::EnableTerminationOnHeapCorruption();\n  PlatformThread::SetName(\"ChromeFrame tests\");\n\n  _set_purecall_handler(PureCall);\n\n  TestSuite test_suite(argc, argv);\n\n  SetConfigBool(kChromeFrameHeadlessMode, true);\n\n  \/\/ Pretend that a screenreader is in use to cause Chrome to generate the\n  \/\/ accessibility tree during page load. Otherwise, Chrome will send back\n  \/\/ an unpopulated tree for the first request while it fetches the tree\n  \/\/ from the renderer.\n  BOOL is_screenreader_on = FALSE;\n  SystemParametersInfo(SPI_SETSCREENREADER, TRUE, NULL, 0);\n  SystemParametersInfo(SPI_GETSCREENREADER, 0, &is_screenreader_on, 0);\n  if (!is_screenreader_on) {\n    LOG(ERROR) << \"Could not set screenreader property. Tests depending on \"\n               << \"MSAA in CF will likely fail...\";\n  }\n\n  base::ProcessHandle crash_service = chrome_frame_test::StartCrashService();\n  int ret = -1;\n  \/\/ If mini_installer is used to register CF, we use the switch\n  \/\/ --no-registration to avoid repetitive registration.\n  if (CommandLine::ForCurrentProcess()->HasSwitch(kNoRegistrationSwitch)) {\n    ret = test_suite.Run();\n  } else {\n    \/\/ Register paths needed by the ScopedChromeFrameRegistrar.\n    chrome::RegisterPathProvider();\n\n    \/\/ This will register the chrome frame in the build directory. It currently\n    \/\/ leaves that chrome frame registered once the tests are done. It must be\n    \/\/ constructed AFTER the TestSuite is created since TestSuites create THE\n    \/\/ AtExitManager.\n    \/\/ TODO(robertshield): Make these tests restore the original registration\n    \/\/ once done.\n    ScopedChromeFrameRegistrar registrar;\n    ret = test_suite.Run();\n  }\n\n  DeleteConfigValue(kChromeFrameHeadlessMode);\n\n  if (crash_service)\n    base::KillProcess(crash_service, 0, false);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\/\n\/*  register_types.cpp                                                   *\/\n\/*************************************************************************\/\n\/*                       This file is part of:                           *\/\n\/*                           GODOT ENGINE                                *\/\n\/*                      https:\/\/godotengine.org                          *\/\n\/*************************************************************************\/\n\/* Copyright (c) 2007-2020 Juan Linietsky, Ariel Manzur.                 *\/\n\/* Copyright (c) 2014-2020 Godot Engine contributors (cf. AUTHORS.md).   *\/\n\/*                                                                       *\/\n\/* Permission is hereby granted, free of charge, to any person obtaining *\/\n\/* a copy of this software and associated documentation files (the       *\/\n\/* \"Software\"), to deal in the Software without restriction, including   *\/\n\/* without limitation the rights to use, copy, modify, merge, publish,   *\/\n\/* distribute, sublicense, and\/or sell copies of the Software, and to    *\/\n\/* permit persons to whom the Software is furnished to do so, subject to *\/\n\/* the following conditions:                                             *\/\n\/*                                                                       *\/\n\/* The above copyright notice and this permission notice shall be        *\/\n\/* included in all copies or substantial portions of the Software.       *\/\n\/*                                                                       *\/\n\/* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,       *\/\n\/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF    *\/\n\/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*\/\n\/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY  *\/\n\/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,  *\/\n\/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE     *\/\n\/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.                *\/\n\/*************************************************************************\/\n\n#include \"register_types.h\"\n\n#include \"core\/io\/file_access_encrypted.h\"\n#include \"core\/io\/resource_loader.h\"\n#include \"core\/os\/dir_access.h\"\n#include \"core\/os\/file_access.h\"\n#include \"gdscript.h\"\n#include \"gdscript_cache.h\"\n#include \"gdscript_tokenizer.h\"\n\nGDScriptLanguage *script_language_gd = nullptr;\nRef<ResourceFormatLoaderGDScript> resource_loader_gd;\nRef<ResourceFormatSaverGDScript> resource_saver_gd;\nGDScriptCache *gdscript_cache = nullptr;\n\n#ifdef TOOLS_ENABLED\n\n#include \"editor\/editor_export.h\"\n#include \"editor\/editor_node.h\"\n#include \"editor\/editor_settings.h\"\n#include \"editor\/editor_translation_parser.h\"\n#include \"editor\/gdscript_highlighter.h\"\n#include \"editor\/gdscript_translation_parser_plugin.h\"\n\n#ifndef GDSCRIPT_NO_LSP\n#include \"core\/engine.h\"\n#include \"language_server\/gdscript_language_server.h\"\n#endif \/\/ !GDSCRIPT_NO_LSP\n\nclass EditorExportGDScript : public EditorExportPlugin {\n\tGDCLASS(EditorExportGDScript, EditorExportPlugin);\n\npublic:\n\tvirtual void _export_file(const String &p_path, const String &p_type, const Set<String> &p_features) override {\n\t\tint script_mode = EditorExportPreset::MODE_SCRIPT_COMPILED;\n\t\tString script_key;\n\n\t\tconst Ref<EditorExportPreset> &preset = get_export_preset();\n\n\t\tif (preset.is_valid()) {\n\t\t\tscript_mode = preset->get_script_export_mode();\n\t\t\tscript_key = preset->get_script_encryption_key().to_lower();\n\t\t}\n\n\t\tif (!p_path.ends_with(\".gd\") || script_mode == EditorExportPreset::MODE_SCRIPT_TEXT) {\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ TODO: Readd compiled\/encrypted GDScript on export.\n\t\treturn;\n\t}\n};\n\nstatic void _editor_init() {\n\tRef<EditorExportGDScript> gd_export;\n\tgd_export.instance();\n\tEditorExport::get_singleton()->add_export_plugin(gd_export);\n\n#ifdef TOOLS_ENABLED\n\tRef<GDScriptSyntaxHighlighter> gdscript_syntax_highlighter;\n\tgdscript_syntax_highlighter.instance();\n\tScriptEditor::get_singleton()->register_syntax_highlighter(gdscript_syntax_highlighter);\n#endif\n\n#ifndef GDSCRIPT_NO_LSP\n\tregister_lsp_types();\n\tGDScriptLanguageServer *lsp_plugin = memnew(GDScriptLanguageServer);\n\tEditorNode::get_singleton()->add_editor_plugin(lsp_plugin);\n\tEngine::get_singleton()->add_singleton(Engine::Singleton(\"GDScriptLanguageProtocol\", GDScriptLanguageProtocol::get_singleton()));\n#endif \/\/ !GDSCRIPT_NO_LSP\n}\n\n#endif \/\/ TOOLS_ENABLED\n\nvoid register_gdscript_types() {\n\tClassDB::register_class<GDScript>();\n\tClassDB::register_virtual_class<GDScriptFunctionState>();\n\n\tscript_language_gd = memnew(GDScriptLanguage);\n\tScriptServer::register_language(script_language_gd);\n\n\tresource_loader_gd.instance();\n\tResourceLoader::add_resource_format_loader(resource_loader_gd);\n\n\tresource_saver_gd.instance();\n\tResourceSaver::add_resource_format_saver(resource_saver_gd);\n\n\tgdscript_cache = memnew(GDScriptCache);\n\n#ifdef TOOLS_ENABLED\n\tEditorNode::add_init_callback(_editor_init);\n\n\tRef<GDScriptEditorTranslationParserPlugin> gdscript_translation_parser_plugin;\n\tgdscript_translation_parser_plugin.instance();\n\tEditorTranslationParser::get_singleton()->add_parser(gdscript_translation_parser_plugin, EditorTranslationParser::STANDARD);\n#endif \/\/ TOOLS_ENABLED\n}\n\nvoid unregister_gdscript_types() {\n\tScriptServer::unregister_language(script_language_gd);\n\n\tif (gdscript_cache) {\n\t\tmemdelete(gdscript_cache);\n\t}\n\n\tif (script_language_gd) {\n\t\tmemdelete(script_language_gd);\n\t}\n\n\tResourceLoader::remove_resource_format_loader(resource_loader_gd);\n\tresource_loader_gd.unref();\n\n\tResourceSaver::remove_resource_format_saver(resource_saver_gd);\n\tresource_saver_gd.unref();\n}\n<commit_msg>Refix GDScriptTranslationParser leak<commit_after>\/*************************************************************************\/\n\/*  register_types.cpp                                                   *\/\n\/*************************************************************************\/\n\/*                       This file is part of:                           *\/\n\/*                           GODOT ENGINE                                *\/\n\/*                      https:\/\/godotengine.org                          *\/\n\/*************************************************************************\/\n\/* Copyright (c) 2007-2020 Juan Linietsky, Ariel Manzur.                 *\/\n\/* Copyright (c) 2014-2020 Godot Engine contributors (cf. AUTHORS.md).   *\/\n\/*                                                                       *\/\n\/* Permission is hereby granted, free of charge, to any person obtaining *\/\n\/* a copy of this software and associated documentation files (the       *\/\n\/* \"Software\"), to deal in the Software without restriction, including   *\/\n\/* without limitation the rights to use, copy, modify, merge, publish,   *\/\n\/* distribute, sublicense, and\/or sell copies of the Software, and to    *\/\n\/* permit persons to whom the Software is furnished to do so, subject to *\/\n\/* the following conditions:                                             *\/\n\/*                                                                       *\/\n\/* The above copyright notice and this permission notice shall be        *\/\n\/* included in all copies or substantial portions of the Software.       *\/\n\/*                                                                       *\/\n\/* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,       *\/\n\/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF    *\/\n\/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*\/\n\/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY  *\/\n\/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,  *\/\n\/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE     *\/\n\/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.                *\/\n\/*************************************************************************\/\n\n#include \"register_types.h\"\n\n#include \"core\/io\/file_access_encrypted.h\"\n#include \"core\/io\/resource_loader.h\"\n#include \"core\/os\/dir_access.h\"\n#include \"core\/os\/file_access.h\"\n#include \"gdscript.h\"\n#include \"gdscript_cache.h\"\n#include \"gdscript_tokenizer.h\"\n\nGDScriptLanguage *script_language_gd = nullptr;\nRef<ResourceFormatLoaderGDScript> resource_loader_gd;\nRef<ResourceFormatSaverGDScript> resource_saver_gd;\nGDScriptCache *gdscript_cache = nullptr;\n\n#ifdef TOOLS_ENABLED\n\n#include \"editor\/editor_export.h\"\n#include \"editor\/editor_node.h\"\n#include \"editor\/editor_settings.h\"\n#include \"editor\/editor_translation_parser.h\"\n#include \"editor\/gdscript_highlighter.h\"\n#include \"editor\/gdscript_translation_parser_plugin.h\"\n\n#ifndef GDSCRIPT_NO_LSP\n#include \"core\/engine.h\"\n#include \"language_server\/gdscript_language_server.h\"\n#endif \/\/ !GDSCRIPT_NO_LSP\n\nRef<GDScriptEditorTranslationParserPlugin> gdscript_translation_parser_plugin;\n\nclass EditorExportGDScript : public EditorExportPlugin {\n\tGDCLASS(EditorExportGDScript, EditorExportPlugin);\n\npublic:\n\tvirtual void _export_file(const String &p_path, const String &p_type, const Set<String> &p_features) override {\n\t\tint script_mode = EditorExportPreset::MODE_SCRIPT_COMPILED;\n\t\tString script_key;\n\n\t\tconst Ref<EditorExportPreset> &preset = get_export_preset();\n\n\t\tif (preset.is_valid()) {\n\t\t\tscript_mode = preset->get_script_export_mode();\n\t\t\tscript_key = preset->get_script_encryption_key().to_lower();\n\t\t}\n\n\t\tif (!p_path.ends_with(\".gd\") || script_mode == EditorExportPreset::MODE_SCRIPT_TEXT) {\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ TODO: Readd compiled\/encrypted GDScript on export.\n\t\treturn;\n\t}\n};\n\nstatic void _editor_init() {\n\tRef<EditorExportGDScript> gd_export;\n\tgd_export.instance();\n\tEditorExport::get_singleton()->add_export_plugin(gd_export);\n\n#ifdef TOOLS_ENABLED\n\tRef<GDScriptSyntaxHighlighter> gdscript_syntax_highlighter;\n\tgdscript_syntax_highlighter.instance();\n\tScriptEditor::get_singleton()->register_syntax_highlighter(gdscript_syntax_highlighter);\n#endif\n\n#ifndef GDSCRIPT_NO_LSP\n\tregister_lsp_types();\n\tGDScriptLanguageServer *lsp_plugin = memnew(GDScriptLanguageServer);\n\tEditorNode::get_singleton()->add_editor_plugin(lsp_plugin);\n\tEngine::get_singleton()->add_singleton(Engine::Singleton(\"GDScriptLanguageProtocol\", GDScriptLanguageProtocol::get_singleton()));\n#endif \/\/ !GDSCRIPT_NO_LSP\n}\n\n#endif \/\/ TOOLS_ENABLED\n\nvoid register_gdscript_types() {\n\tClassDB::register_class<GDScript>();\n\tClassDB::register_virtual_class<GDScriptFunctionState>();\n\n\tscript_language_gd = memnew(GDScriptLanguage);\n\tScriptServer::register_language(script_language_gd);\n\n\tresource_loader_gd.instance();\n\tResourceLoader::add_resource_format_loader(resource_loader_gd);\n\n\tresource_saver_gd.instance();\n\tResourceSaver::add_resource_format_saver(resource_saver_gd);\n\n\tgdscript_cache = memnew(GDScriptCache);\n\n#ifdef TOOLS_ENABLED\n\tEditorNode::add_init_callback(_editor_init);\n\n\tgdscript_translation_parser_plugin.instance();\n\tEditorTranslationParser::get_singleton()->add_parser(gdscript_translation_parser_plugin, EditorTranslationParser::STANDARD);\n#endif \/\/ TOOLS_ENABLED\n}\n\nvoid unregister_gdscript_types() {\n\tScriptServer::unregister_language(script_language_gd);\n\n\tif (gdscript_cache) {\n\t\tmemdelete(gdscript_cache);\n\t}\n\n\tif (script_language_gd) {\n\t\tmemdelete(script_language_gd);\n\t}\n\n\tResourceLoader::remove_resource_format_loader(resource_loader_gd);\n\tresource_loader_gd.unref();\n\n\tResourceSaver::remove_resource_format_saver(resource_saver_gd);\n\tresource_saver_gd.unref();\n\n#ifdef TOOLS_ENABLED\n\tEditorTranslationParser::get_singleton()->remove_parser(gdscript_translation_parser_plugin, EditorTranslationParser::STANDARD);\n\tgdscript_translation_parser_plugin.unref();\n#endif \/\/ TOOLS_ENABLED\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>coverity: protect against buffer overflow<commit_after><|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"EntityManager.hpp\"\n#include \"data\/NameComponent.hpp\"\n\nnamespace kengine::SortHelper {\n\t\/\/ Returns a container of tuple<Entity, Comps *...>\n\t\/\/ Pred: bool(tuple<Entity, Comps*...> lhs, tuple<Entity, Comps*...> rhs) = lhs < rhs \n\ttemplate<typename ... Comps, typename Pred>\n\tauto getSortedEntities(EntityManager & em, Pred && pred);\n\n\ttemplate<typename ... Comps>\n\tauto getNameSortedEntities(EntityManager & em);\n}\n\nnamespace kengine::SortHelper {\n\tnamespace detail {\n\t\ttemplate<typename PointerTuple, typename RefTuple, size_t I, size_t ...Is>\n\t\tvoid setImpl(PointerTuple & p, const RefTuple & r, std::index_sequence<I, Is...>) {\n\t\t\tstd::get<I + 1>(p) = &std::get<I + 1>(r);\n\t\t\tsetImpl(p, r, std::index_sequence<Is...>());\n\t\t}\n\n\t\ttemplate<typename PointerTuple, typename RefTuple>\n\t\tvoid setImpl(PointerTuple & p, const RefTuple & r, std::index_sequence<>) {}\n\n\t\ttemplate<typename PointerTuple, typename RefTuple, size_t ...Is>\n\t\tvoid set(PointerTuple & p, const RefTuple & r, std::index_sequence<Is...> is) {\n\t\t\tstd::get<0>(p) = std::get<0>(r); \/\/ 0 is Entity\n\t\t\tsetImpl(p, r, is);\n\t\t}\n\t}\n\n\ttemplate<typename ... Comps, typename Pred>\n\tauto getSortedEntities(EntityManager & em, Pred && pred) { \n\t\tusing Type = std::tuple<Entity, const Comps *...>;\n\n\t\tputils::vector<Type, KENGINE_COMPONENT_COUNT> ret;\n\n\t\tfor (const auto & t : em.getEntities<Comps...>()) {\n\t\t\tret.emplace_back();\n\t\t\tdetail::set(ret.back(), t, std::make_index_sequence<sizeof...(Comps)>());\n\t\t}\n\t\tstd::sort(ret.begin(), ret.end(), FWD(pred));\n\n\t\treturn ret;\n\t}\n\n\ttemplate<typename ... Comps>\n\tauto getNameSortedEntities(EntityManager & em) {\n\t\treturn getSortedEntities<NameComponent, Comps...>(em,\n\t\t\t[](const auto & lhs, const auto & rhs) {\n\t\t\t\treturn strcmp(std::get<1>(lhs)->name, std::get<1>(rhs)->name) < 0;\n\t\t\t}\n\t\t);\n\t}\n}<commit_msg>fix SortHelper still assuming it was only used for \"component entities\", added MaxCount template parameter<commit_after>#pragma once\n\n#include \"EntityManager.hpp\"\n#include \"data\/NameComponent.hpp\"\n\nnamespace kengine::SortHelper {\n\t\/\/ Returns a container of tuple<Entity, Comps *...>\n\t\/\/ Pred: bool(tuple<Entity, Comps*...> lhs, tuple<Entity, Comps*...> rhs) = lhs < rhs \n\ttemplate<size_t MaxCount, typename ... Comps, typename Pred>\n\tauto getSortedEntities(EntityManager & em, Pred && pred);\n\n\ttemplate<size_t MaxCount, typename ... Comps>\n\tauto getNameSortedEntities(EntityManager & em);\n}\n\nnamespace kengine::SortHelper {\n\tnamespace detail {\n\t\ttemplate<typename PointerTuple, typename RefTuple, size_t I, size_t ...Is>\n\t\tvoid setImpl(PointerTuple & p, const RefTuple & r, std::index_sequence<I, Is...>) {\n\t\t\tstd::get<I + 1>(p) = &std::get<I + 1>(r);\n\t\t\tsetImpl(p, r, std::index_sequence<Is...>());\n\t\t}\n\n\t\ttemplate<typename PointerTuple, typename RefTuple>\n\t\tvoid setImpl(PointerTuple & p, const RefTuple & r, std::index_sequence<>) {}\n\n\t\ttemplate<typename PointerTuple, typename RefTuple, size_t ...Is>\n\t\tvoid set(PointerTuple & p, const RefTuple & r, std::index_sequence<Is...> is) {\n\t\t\tstd::get<0>(p) = std::get<0>(r); \/\/ 0 is Entity\n\t\t\tsetImpl(p, r, is);\n\t\t}\n\t}\n\n\ttemplate<size_t MaxCount, typename ... Comps, typename Pred>\n\tauto getSortedEntities(EntityManager & em, Pred && pred) { \n\t\tusing Type = std::tuple<Entity, const Comps *...>;\n\n\t\tputils::vector<Type, MaxCount> ret;\n\n\t\tfor (const auto & t : em.getEntities<Comps...>()) {\n\t\t\tif (ret.full())\n\t\t\t\tbreak;\n\t\t\tret.emplace_back();\n\t\t\tdetail::set(ret.back(), t, std::make_index_sequence<sizeof...(Comps)>());\n\t\t}\n\t\tstd::sort(ret.begin(), ret.end(), FWD(pred));\n\n\t\treturn ret;\n\t}\n\n\ttemplate<size_t MaxCount, typename ... Comps>\n\tauto getNameSortedEntities(EntityManager & em) {\n\t\treturn getSortedEntities<MaxCount, NameComponent, Comps...>(em,\n\t\t\t[](const auto & lhs, const auto & rhs) {\n\t\t\t\treturn strcmp(std::get<1>(lhs)->name, std::get<1>(rhs)->name) < 0;\n\t\t\t}\n\t\t);\n\t}\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 \"qgstreamervideooverlay.h\"\n#include \"qvideosurfacegstsink.h\"\n\n#include <QtMultimedia\/qvideosurfaceformat.h>\n\n#include \"qx11videosurface.h\"\n\n#ifndef QT_NO_XVIDEO\n\nQGstreamerVideoOverlay::QGstreamerVideoOverlay(QObject *parent)\n    : QVideoWindowControl(parent)\n    , m_surface(new QX11VideoSurface)\n    , m_videoSink(reinterpret_cast<GstElement*>(QVideoSurfaceGstSink::createSink(m_surface)))\n    , m_aspectRatioMode(Qt::KeepAspectRatio)\n    , m_fullScreen(false)\n{\n    if (m_videoSink) {\n        gst_object_ref(GST_OBJECT(m_videoSink)); \/\/Take ownership\n        gst_object_sink(GST_OBJECT(m_videoSink));\n    }\n\n    connect(m_surface, SIGNAL(surfaceFormatChanged(QVideoSurfaceFormat)),\n            this, SLOT(surfaceFormatChanged()));\n}\n\nQGstreamerVideoOverlay::~QGstreamerVideoOverlay()\n{\n    if (m_videoSink)\n        gst_object_unref(GST_OBJECT(m_videoSink));\n\n    delete m_surface;\n}\n\nWId QGstreamerVideoOverlay::winId() const\n{\n    return m_surface->winId();\n}\n\nvoid QGstreamerVideoOverlay::setWinId(WId id)\n{\n    m_surface->setWinId(id);\n}\n\nQRect QGstreamerVideoOverlay::displayRect() const\n{\n    return m_displayRect;\n}\n\nvoid QGstreamerVideoOverlay::setDisplayRect(const QRect &rect)\n{\n    m_displayRect = rect;\n\n    setScaledDisplayRect();\n}\n\nQt::AspectRatioMode QGstreamerVideoOverlay::aspectRatioMode() const\n{\n    return m_aspectRatioMode;\n}\n\nvoid QGstreamerVideoOverlay::setAspectRatioMode(Qt::AspectRatioMode mode)\n{\n    m_aspectRatioMode = mode;\n\n    setScaledDisplayRect();\n}\n\nvoid QGstreamerVideoOverlay::repaint()\n{\n}\n\nint QGstreamerVideoOverlay::brightness() const\n{\n    return m_surface->brightness();\n}\n\nvoid QGstreamerVideoOverlay::setBrightness(int brightness)\n{\n    m_surface->setBrightness(brightness);\n\n    emit brightnessChanged(m_surface->brightness());\n}\n\nint QGstreamerVideoOverlay::contrast() const\n{\n    return m_surface->contrast();\n}\n\nvoid QGstreamerVideoOverlay::setContrast(int contrast)\n{\n    m_surface->setContrast(contrast);\n\n    emit contrastChanged(m_surface->contrast());\n}\n\nint QGstreamerVideoOverlay::hue() const\n{\n    return m_surface->hue();\n}\n\nvoid QGstreamerVideoOverlay::setHue(int hue)\n{\n    m_surface->setHue(hue);\n\n    emit hueChanged(m_surface->hue());\n}\n\nint QGstreamerVideoOverlay::saturation() const\n{\n    return m_surface->saturation();\n}\n\nvoid QGstreamerVideoOverlay::setSaturation(int saturation)\n{\n    m_surface->setSaturation(saturation);\n\n    emit saturationChanged(m_surface->saturation());\n}\n\nbool QGstreamerVideoOverlay::isFullScreen() const\n{\n    return m_fullScreen;\n}\n\nvoid QGstreamerVideoOverlay::setFullScreen(bool fullScreen)\n{\n    emit fullScreenChanged(m_fullScreen = fullScreen);\n}\n\nQSize QGstreamerVideoOverlay::nativeSize() const\n{\n    return m_surface->surfaceFormat().sizeHint();\n}\n\nQAbstractVideoSurface *QGstreamerVideoOverlay::surface() const\n{\n    return m_surface;\n}\n\nGstElement *QGstreamerVideoOverlay::videoSink()\n{\n    return m_videoSink;\n}\n\nvoid QGstreamerVideoOverlay::surfaceFormatChanged()\n{\n    setScaledDisplayRect();\n\n    emit nativeSizeChanged();\n}\n\nvoid QGstreamerVideoOverlay::setScaledDisplayRect()\n{\n    QRect formatViewport = m_surface->surfaceFormat().viewport();\n\n    switch (m_aspectRatioMode) {\n    case Qt::KeepAspectRatio:\n        {\n            QSize size = formatViewport.size();\n            size.scale(m_displayRect.size(), Qt::KeepAspectRatio);\n\n            QRect rect(QPoint(0, 0), size);\n            rect.moveCenter(m_displayRect.center());\n\n            m_surface->setDisplayRect(rect);\n            m_surface->setViewport(formatViewport);\n        }\n        break;\n    case Qt::IgnoreAspectRatio:\n        m_surface->setDisplayRect(m_displayRect);\n        m_surface->setViewport(formatViewport);\n        break;\n    case Qt::KeepAspectRatioByExpanding:\n        {\n            QSize size = m_displayRect.size();\n            size.scale(formatViewport.size(), Qt::KeepAspectRatio);\n\n            QRect viewport(QPoint(0, 0), size);\n            viewport.moveCenter(formatViewport.center());\n            m_surface->setDisplayRect(m_displayRect);\n            m_surface->setViewport(viewport);\n        }\n        break;\n    };\n}\n\n#endif \/\/QT_NO_XVIDEO\n<commit_msg>Fixed gst video overlay geometry calculation if pixel aspect ratio != 1<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 \"qgstreamervideooverlay.h\"\n#include \"qvideosurfacegstsink.h\"\n\n#include <QtMultimedia\/qvideosurfaceformat.h>\n\n#include \"qx11videosurface.h\"\n\n#ifndef QT_NO_XVIDEO\n\nQGstreamerVideoOverlay::QGstreamerVideoOverlay(QObject *parent)\n    : QVideoWindowControl(parent)\n    , m_surface(new QX11VideoSurface)\n    , m_videoSink(reinterpret_cast<GstElement*>(QVideoSurfaceGstSink::createSink(m_surface)))\n    , m_aspectRatioMode(Qt::KeepAspectRatio)\n    , m_fullScreen(false)\n{\n    if (m_videoSink) {\n        gst_object_ref(GST_OBJECT(m_videoSink)); \/\/Take ownership\n        gst_object_sink(GST_OBJECT(m_videoSink));\n    }\n\n    connect(m_surface, SIGNAL(surfaceFormatChanged(QVideoSurfaceFormat)),\n            this, SLOT(surfaceFormatChanged()));\n}\n\nQGstreamerVideoOverlay::~QGstreamerVideoOverlay()\n{\n    if (m_videoSink)\n        gst_object_unref(GST_OBJECT(m_videoSink));\n\n    delete m_surface;\n}\n\nWId QGstreamerVideoOverlay::winId() const\n{\n    return m_surface->winId();\n}\n\nvoid QGstreamerVideoOverlay::setWinId(WId id)\n{\n    m_surface->setWinId(id);\n}\n\nQRect QGstreamerVideoOverlay::displayRect() const\n{\n    return m_displayRect;\n}\n\nvoid QGstreamerVideoOverlay::setDisplayRect(const QRect &rect)\n{\n    m_displayRect = rect;\n\n    setScaledDisplayRect();\n}\n\nQt::AspectRatioMode QGstreamerVideoOverlay::aspectRatioMode() const\n{\n    return m_aspectRatioMode;\n}\n\nvoid QGstreamerVideoOverlay::setAspectRatioMode(Qt::AspectRatioMode mode)\n{\n    m_aspectRatioMode = mode;\n\n    setScaledDisplayRect();\n}\n\nvoid QGstreamerVideoOverlay::repaint()\n{\n}\n\nint QGstreamerVideoOverlay::brightness() const\n{\n    return m_surface->brightness();\n}\n\nvoid QGstreamerVideoOverlay::setBrightness(int brightness)\n{\n    m_surface->setBrightness(brightness);\n\n    emit brightnessChanged(m_surface->brightness());\n}\n\nint QGstreamerVideoOverlay::contrast() const\n{\n    return m_surface->contrast();\n}\n\nvoid QGstreamerVideoOverlay::setContrast(int contrast)\n{\n    m_surface->setContrast(contrast);\n\n    emit contrastChanged(m_surface->contrast());\n}\n\nint QGstreamerVideoOverlay::hue() const\n{\n    return m_surface->hue();\n}\n\nvoid QGstreamerVideoOverlay::setHue(int hue)\n{\n    m_surface->setHue(hue);\n\n    emit hueChanged(m_surface->hue());\n}\n\nint QGstreamerVideoOverlay::saturation() const\n{\n    return m_surface->saturation();\n}\n\nvoid QGstreamerVideoOverlay::setSaturation(int saturation)\n{\n    m_surface->setSaturation(saturation);\n\n    emit saturationChanged(m_surface->saturation());\n}\n\nbool QGstreamerVideoOverlay::isFullScreen() const\n{\n    return m_fullScreen;\n}\n\nvoid QGstreamerVideoOverlay::setFullScreen(bool fullScreen)\n{\n    emit fullScreenChanged(m_fullScreen = fullScreen);\n}\n\nQSize QGstreamerVideoOverlay::nativeSize() const\n{\n    return m_surface->surfaceFormat().sizeHint();\n}\n\nQAbstractVideoSurface *QGstreamerVideoOverlay::surface() const\n{\n    return m_surface;\n}\n\nGstElement *QGstreamerVideoOverlay::videoSink()\n{\n    return m_videoSink;\n}\n\nvoid QGstreamerVideoOverlay::surfaceFormatChanged()\n{\n    setScaledDisplayRect();\n\n    emit nativeSizeChanged();\n}\n\nvoid QGstreamerVideoOverlay::setScaledDisplayRect()\n{\n    QRect formatViewport = m_surface->surfaceFormat().viewport();\n\n    switch (m_aspectRatioMode) {\n    case Qt::KeepAspectRatio:\n        {\n            QSize size = m_surface->surfaceFormat().sizeHint();\n            size.scale(m_displayRect.size(), Qt::KeepAspectRatio);\n\n            QRect rect(QPoint(0, 0), size);\n            rect.moveCenter(m_displayRect.center());\n\n            m_surface->setDisplayRect(rect);\n            m_surface->setViewport(formatViewport);\n        }\n        break;\n    case Qt::IgnoreAspectRatio:\n        m_surface->setDisplayRect(m_displayRect);\n        m_surface->setViewport(formatViewport);\n        break;\n    case Qt::KeepAspectRatioByExpanding:\n        {\n            QSize size = m_displayRect.size();\n            size.scale(m_surface->surfaceFormat().sizeHint(), Qt::KeepAspectRatio);\n\n            QRect viewport(QPoint(0, 0), size);\n            viewport.moveCenter(formatViewport.center());\n            m_surface->setDisplayRect(m_displayRect);\n            m_surface->setViewport(viewport);\n        }\n        break;\n    };\n}\n\n#endif \/\/QT_NO_XVIDEO\n<|endoftext|>"}
{"text":"<commit_before>#include \"masternodemanager.h\"\n#include \"ui_masternodemanager.h\"\n#include \"addeditadrenalinenode.h\"\n#include \"adrenalinenodeconfigdialog.h\"\n\n#include \"sync.h\"\n#include \"clientmodel.h\"\n#include \"walletmodel.h\"\n#include \"activemasternode.h\"\n#include \"masternodeconfig.h\"\n#include \"masternodeman.h\"\n#include \"walletdb.h\"\n#include \"wallet.h\"\n#include \"init.h\"\n\n#include <QAbstractItemDelegate>\n#include <QPainter>\n#include <QTimer>\n#include <QDebug>\n#include <QScrollArea>\n#include <QScroller>\n#include <QDateTime>\n#include <QApplication>\n#include <QClipboard>\n#include <QMessageBox>\n\nMasternodeManager::MasternodeManager(QWidget *parent) :\n    QWidget(parent),\n    ui(new Ui::MasternodeManager),\n    clientModel(0),\n    walletModel(0)\n{\n    ui->setupUi(this);\n\n    ui->editButton->setEnabled(false);\n    ui->getConfigButton->setEnabled(false);\n    ui->startButton->setEnabled(false);\n    ui->stopButton->setEnabled(false);\n    ui->copyAddressButton->setEnabled(false);\n\n    ui->tableWidget->horizontalHeader()->setSectionResizeMode(QHeaderView::ResizeToContents);\n    ui->tableWidget_2->horizontalHeader()->setSectionResizeMode(QHeaderView::ResizeToContents);\n\n    subscribeToCoreSignals();\n\n    timer = new QTimer(this);\n    connect(timer, SIGNAL(timeout()), this, SLOT(updateNodeList()));\n    if(!GetBoolArg(\"-reindexaddr\", false))\n        timer->start(30000);\n\n    \n\n    updateNodeList();\n}\n\nMasternodeManager::~MasternodeManager()\n{\n    delete ui;\n}\n\nstatic void NotifyAdrenalineNodeUpdated(MasternodeManager *page, CAdrenalineNodeConfig nodeConfig)\n{\n    \/\/ alias, address, privkey, collateral address\n    QString alias = QString::fromStdString(nodeConfig.sAlias);\n    QString addr = QString::fromStdString(nodeConfig.sAddress);\n    QString privkey = QString::fromStdString(nodeConfig.sMasternodePrivKey);\n    QString collateral = QString::fromStdString(nodeConfig.sCollateralAddress);\n    \n    QMetaObject::invokeMethod(page, \"updateAdrenalineNode\", Qt::QueuedConnection,\n                              Q_ARG(QString, alias),\n                              Q_ARG(QString, addr),\n                              Q_ARG(QString, privkey),\n                              Q_ARG(QString, collateral)\n                              );\n}\n\nvoid MasternodeManager::subscribeToCoreSignals()\n{\n    \/\/ Connect signals to core\n    uiInterface.NotifyAdrenalineNodeChanged.connect(boost::bind(&NotifyAdrenalineNodeUpdated, this, _1));\n}\n\nvoid MasternodeManager::unsubscribeFromCoreSignals()\n{\n    \/\/ Disconnect signals from core\n    uiInterface.NotifyAdrenalineNodeChanged.disconnect(boost::bind(&NotifyAdrenalineNodeUpdated, this, _1));\n}\n\nvoid MasternodeManager::on_tableWidget_2_itemSelectionChanged()\n{\n    if(ui->tableWidget_2->selectedItems().count() > 0)\n    {\n        ui->editButton->setEnabled(true);\n        ui->getConfigButton->setEnabled(true);\n        ui->startButton->setEnabled(true);\n        ui->stopButton->setEnabled(true);\n\tui->copyAddressButton->setEnabled(true);\n    }\n}\n\nvoid MasternodeManager::updateAdrenalineNode(QString alias, QString addr, QString privkey, QString collateral)\n{\n    LOCK(cs_adrenaline);\n    bool bFound = false;\n    int nodeRow = 0;\n    for(int i=0; i < ui->tableWidget_2->rowCount(); i++)\n    {\n        if(ui->tableWidget_2->item(i, 0)->text() == alias)\n        {\n            bFound = true;\n            nodeRow = i;\n            break;\n        }\n    }\n\n    if(nodeRow == 0 && !bFound)\n        ui->tableWidget_2->insertRow(0);\n\n    QTableWidgetItem *aliasItem = new QTableWidgetItem(alias);\n    QTableWidgetItem *addrItem = new QTableWidgetItem(addr);\n    QTableWidgetItem *statusItem = new QTableWidgetItem(\"\");\n    QTableWidgetItem *collateralItem = new QTableWidgetItem(collateral);\n\n    ui->tableWidget_2->setItem(nodeRow, 0, aliasItem);\n    ui->tableWidget_2->setItem(nodeRow, 1, addrItem);\n    ui->tableWidget_2->setItem(nodeRow, 2, statusItem);\n    ui->tableWidget_2->setItem(nodeRow, 3, collateralItem);\n}\n\nstatic QString seconds_to_DHMS(quint32 duration)\n{\n  QString res;\n  int seconds = (int) (duration % 60);\n  duration \/= 60;\n  int minutes = (int) (duration % 60);\n  duration \/= 60;\n  int hours = (int) (duration % 24);\n  int days = (int) (duration \/ 24);\n  if((hours == 0)&&(days == 0))\n      return res.sprintf(\"%02dm:%02ds\", minutes, seconds);\n  if (days == 0)\n      return res.sprintf(\"%02dh:%02dm:%02ds\", hours, minutes, seconds);\n  return res.sprintf(\"%dd %02dh:%02dm:%02ds\", days, hours, minutes, seconds);\n}\n\nvoid MasternodeManager::updateNodeList()\n{\n    TRY_LOCK(cs_masternodes, lockMasternodes);\n    if(!lockMasternodes)\n        return;\n\n    ui->countLabel->setText(\"Updating...\");\n    ui->tableWidget->clearContents();\n    ui->tableWidget->setRowCount(0);\n    CMasternode* mn = mnodeman.Find(activeMasternode.vin);\n    if(mn)\n    {\n        int mnRow = 0;\n        ui->tableWidget->insertRow(0);\n\n        \/\/ populate list\n        \/\/ Address, Rank, Active, Active Seconds, Last Seen, Pub Key\n        QTableWidgetItem *activeItem = new QTableWidgetItem(QString::number(mn.IsEnabled()));\n        QTableWidgetItem *addressItem = new QTableWidgetItem(QString::fromStdString(mn.addr.ToString()));\n        QTableWidgetItem *rankItem = new QTableWidgetItem(QString::number(mnodeman.GetMasternodeRank(mn.vin, pindexBest->nHeight)));\n        QTableWidgetItem *activeSecondsItem = new QTableWidgetItem(seconds_to_DHMS((qint64)(mn.lastTimeSeen - mn.now)));\n        QTableWidgetItem *lastSeenItem = new QTableWidgetItem(QString::fromStdString(DateTimeStrFormat(mn.lastTimeSeen)));\n\t\n        CScript pubkey;\n        pubkey =GetScriptForDestination(mn.pubkey.GetID());\n        CTxDestination address1;\n        ExtractDestination(pubkey, address1);\n        CBitcoinAddress address2(address1);\n        QTableWidgetItem *pubkeyItem = new QTableWidgetItem(QString::fromStdString(address2.ToString()));\n\t\n        ui->tableWidget->setItem(mnRow, 0, addressItem);\n        ui->tableWidget->setItem(mnRow, 1, rankItem);\n        ui->tableWidget->setItem(mnRow, 2, activeItem);\n        ui->tableWidget->setItem(mnRow, 3, activeSecondsItem);\n        ui->tableWidget->setItem(mnRow, 4, lastSeenItem);\n        ui->tableWidget->setItem(mnRow, 5, pubkeyItem);\n    }\n\n    ui->countLabel->setText(QString::number(ui->tableWidget->rowCount()));\n\n    if(pwalletMain)\n    {\n        LOCK(cs_adrenaline);\n        BOOST_FOREACH(PAIRTYPE(std::string, CAdrenalineNodeConfig) adrenaline, pwalletMain->mapMyAdrenalineNodes)\n        {\n            updateAdrenalineNode(QString::fromStdString(adrenaline.second.sAlias), QString::fromStdString(adrenaline.second.sAddress), QString::fromStdString(adrenaline.second.sMasternodePrivKey), QString::fromStdString(adrenaline.second.sCollateralAddress));\n        }\n    }\n}\n\n\nvoid MasternodeManager::setClientModel(ClientModel *model)\n{\n    this->clientModel = model;\n    if(model)\n    {\n    }\n}\n\nvoid MasternodeManager::setWalletModel(WalletModel *model)\n{\n    this->walletModel = model;\n    if(model && model->getOptionsModel())\n    {\n    }\n\n}\n\nvoid MasternodeManager::on_createButton_clicked()\n{\n    AddEditAdrenalineNode* aenode = new AddEditAdrenalineNode();\n    aenode->exec();\n}\n\nvoid MasternodeManager::on_copyAddressButton_clicked()\n{\n    QItemSelectionModel* selectionModel = ui->tableWidget_2->selectionModel();\n    QModelIndexList selected = selectionModel->selectedRows();\n    if(selected.count() == 0)\n        return;\n\n    QModelIndex index = selected.at(0);\n    int r = index.row();\n    std::string sCollateralAddress = ui->tableWidget_2->item(r, 3)->text().toStdString();\n\n    QApplication::clipboard()->setText(QString::fromStdString(sCollateralAddress));\n}\n\nvoid MasternodeManager::on_editButton_clicked()\n{\n    QItemSelectionModel* selectionModel = ui->tableWidget_2->selectionModel();\n    QModelIndexList selected = selectionModel->selectedRows();\n    if(selected.count() == 0)\n        return;\n\n    QModelIndex index = selected.at(0);\n    int r = index.row();\n    std::string sAddress = ui->tableWidget_2->item(r, 1)->text().toStdString();\n\n    \/\/ get existing config entry\n\n}\n\nvoid MasternodeManager::on_getConfigButton_clicked()\n{\n    QItemSelectionModel* selectionModel = ui->tableWidget_2->selectionModel();\n    QModelIndexList selected = selectionModel->selectedRows();\n    if(selected.count() == 0)\n        return;\n\n    QModelIndex index = selected.at(0);\n    int r = index.row();\n    std::string sAddress = ui->tableWidget_2->item(r, 1)->text().toStdString();\n    CAdrenalineNodeConfig c = pwalletMain->mapMyAdrenalineNodes[sAddress];\n    std::string sPrivKey = c.sMasternodePrivKey;\n    AdrenalineNodeConfigDialog* d = new AdrenalineNodeConfigDialog(this, QString::fromStdString(sAddress), QString::fromStdString(sPrivKey));\n    d->exec();\n}\n\nvoid MasternodeManager::on_removeButton_clicked()\n{\n    QItemSelectionModel* selectionModel = ui->tableWidget_2->selectionModel();\n    QModelIndexList selected = selectionModel->selectedRows();\n    if(selected.count() == 0)\n        return;\n\n    QMessageBox::StandardButton confirm;\n    confirm = QMessageBox::question(this, \"Delete Adrenaline Node?\", \"Are you sure you want to delete this adrenaline node configuration?\", QMessageBox::Yes|QMessageBox::No);\n\n    if(confirm == QMessageBox::Yes)\n    {\n        QModelIndex index = selected.at(0);\n        int r = index.row();\n        std::string sAddress = ui->tableWidget_2->item(r, 1)->text().toStdString();\n        CAdrenalineNodeConfig c = pwalletMain->mapMyAdrenalineNodes[sAddress];\n        CWalletDB walletdb(pwalletMain->strWalletFile);\n        pwalletMain->mapMyAdrenalineNodes.erase(sAddress);\n        walletdb.EraseAdrenalineNodeConfig(c.sAddress);\n        ui->tableWidget_2->clearContents();\n        ui->tableWidget_2->setRowCount(0);\n        BOOST_FOREACH(PAIRTYPE(std::string, CAdrenalineNodeConfig) adrenaline, pwalletMain->mapMyAdrenalineNodes)\n        {\n            updateAdrenalineNode(QString::fromStdString(adrenaline.second.sAlias), QString::fromStdString(adrenaline.second.sAddress), QString::fromStdString(adrenaline.second.sMasternodePrivKey), QString::fromStdString(adrenaline.second.sCollateralAddress));\n        }\n    }\n}\n\nvoid MasternodeManager::on_startButton_clicked()\n{\n    \/\/ start the node\n    QItemSelectionModel* selectionModel = ui->tableWidget_2->selectionModel();\n    QModelIndexList selected = selectionModel->selectedRows();\n    if(selected.count() == 0)\n        return;\n\n    QModelIndex index = selected.at(0);\n    int r = index.row();\n    std::string sAddress = ui->tableWidget_2->item(r, 1)->text().toStdString();\n    CAdrenalineNodeConfig c = pwalletMain->mapMyAdrenalineNodes[sAddress];\n\n    std::string errorMessage;\n    bool result = activeMasternode.RegisterByPubKey(c.sAddress, c.sMasternodePrivKey, c.sCollateralAddress, errorMessage);\n\n    QMessageBox msg;\n    if(result)\n        msg.setText(\"Adrenaline Node at \" + QString::fromStdString(c.sAddress) + \" started.\");\n    else\n        msg.setText(\"Error: \" + QString::fromStdString(errorMessage));\n\n    msg.exec();\n}\n\nvoid MasternodeManager::on_stopButton_clicked()\n{\n    \/\/ start the node\n    QItemSelectionModel* selectionModel = ui->tableWidget_2->selectionModel();\n    QModelIndexList selected = selectionModel->selectedRows();\n    if(selected.count() == 0)\n        return;\n\n    QModelIndex index = selected.at(0);\n    int r = index.row();\n    std::string sAddress = ui->tableWidget_2->item(r, 1)->text().toStdString();\n    CAdrenalineNodeConfig c = pwalletMain->mapMyAdrenalineNodes[sAddress];\n\n    std::string errorMessage;\n    bool result = activeMasternode.StopMasterNode(c.sAddress, c.sMasternodePrivKey, errorMessage);\n    QMessageBox msg;\n    if(result)\n    {\n        msg.setText(\"Adrenaline Node at \" + QString::fromStdString(c.sAddress) + \" stopped.\");\n    }\n    else\n    {\n        msg.setText(\"Error: \" + QString::fromStdString(errorMessage));\n    }\n    msg.exec();\n}\n\nvoid MasternodeManager::on_startAllButton_clicked()\n{\n    std::string results;\n    BOOST_FOREACH(PAIRTYPE(std::string, CAdrenalineNodeConfig) adrenaline, pwalletMain->mapMyAdrenalineNodes)\n    {\n        CAdrenalineNodeConfig c = adrenaline.second;\n\tstd::string errorMessage;\n        bool result = activeMasternode.RegisterByPubKey(c.sAddress, c.sMasternodePrivKey, c.sCollateralAddress, errorMessage);\n\tif(result)\n\t{\n   \t    results += c.sAddress + \": STARTED\\n\";\n\t}\t\n\telse\n\t{\n\t    results += c.sAddress + \": ERROR: \" + errorMessage + \"\\n\";\n\t}\n    }\n\n    QMessageBox msg;\n    msg.setText(QString::fromStdString(results));\n    msg.exec();\n}\n\nvoid MasternodeManager::on_stopAllButton_clicked()\n{\n    std::string results;\n    BOOST_FOREACH(PAIRTYPE(std::string, CAdrenalineNodeConfig) adrenaline, pwalletMain->mapMyAdrenalineNodes)\n    {\n        CAdrenalineNodeConfig c = adrenaline.second;\n\tstd::string errorMessage;\n        bool result = activeMasternode.StopMasterNode(c.sAddress, c.sMasternodePrivKey, errorMessage);\n\tif(result)\n\t{\n   \t    results += c.sAddress + \": STOPPED\\n\";\n\t}\t\n\telse\n\t{\n\t    results += c.sAddress + \": ERROR: \" + errorMessage + \"\\n\";\n\t}\n    }\n\n    QMessageBox msg;\n    msg.setText(QString::fromStdString(results));\n    msg.exec();\n}\n<commit_msg>mn -> activeMasternode<commit_after>#include \"masternodemanager.h\"\n#include \"ui_masternodemanager.h\"\n#include \"addeditadrenalinenode.h\"\n#include \"adrenalinenodeconfigdialog.h\"\n\n#include \"sync.h\"\n#include \"clientmodel.h\"\n#include \"walletmodel.h\"\n#include \"activemasternode.h\"\n#include \"masternodeconfig.h\"\n#include \"masternodeman.h\"\n#include \"walletdb.h\"\n#include \"wallet.h\"\n#include \"init.h\"\n\n#include <QAbstractItemDelegate>\n#include <QPainter>\n#include <QTimer>\n#include <QDebug>\n#include <QScrollArea>\n#include <QScroller>\n#include <QDateTime>\n#include <QApplication>\n#include <QClipboard>\n#include <QMessageBox>\n\nMasternodeManager::MasternodeManager(QWidget *parent) :\n    QWidget(parent),\n    ui(new Ui::MasternodeManager),\n    clientModel(0),\n    walletModel(0)\n{\n    ui->setupUi(this);\n\n    ui->editButton->setEnabled(false);\n    ui->getConfigButton->setEnabled(false);\n    ui->startButton->setEnabled(false);\n    ui->stopButton->setEnabled(false);\n    ui->copyAddressButton->setEnabled(false);\n\n    ui->tableWidget->horizontalHeader()->setSectionResizeMode(QHeaderView::ResizeToContents);\n    ui->tableWidget_2->horizontalHeader()->setSectionResizeMode(QHeaderView::ResizeToContents);\n\n    subscribeToCoreSignals();\n\n    timer = new QTimer(this);\n    connect(timer, SIGNAL(timeout()), this, SLOT(updateNodeList()));\n    if(!GetBoolArg(\"-reindexaddr\", false))\n        timer->start(30000);\n\n    \n\n    updateNodeList();\n}\n\nMasternodeManager::~MasternodeManager()\n{\n    delete ui;\n}\n\nstatic void NotifyAdrenalineNodeUpdated(MasternodeManager *page, CAdrenalineNodeConfig nodeConfig)\n{\n    \/\/ alias, address, privkey, collateral address\n    QString alias = QString::fromStdString(nodeConfig.sAlias);\n    QString addr = QString::fromStdString(nodeConfig.sAddress);\n    QString privkey = QString::fromStdString(nodeConfig.sMasternodePrivKey);\n    QString collateral = QString::fromStdString(nodeConfig.sCollateralAddress);\n    \n    QMetaObject::invokeMethod(page, \"updateAdrenalineNode\", Qt::QueuedConnection,\n                              Q_ARG(QString, alias),\n                              Q_ARG(QString, addr),\n                              Q_ARG(QString, privkey),\n                              Q_ARG(QString, collateral)\n                              );\n}\n\nvoid MasternodeManager::subscribeToCoreSignals()\n{\n    \/\/ Connect signals to core\n    uiInterface.NotifyAdrenalineNodeChanged.connect(boost::bind(&NotifyAdrenalineNodeUpdated, this, _1));\n}\n\nvoid MasternodeManager::unsubscribeFromCoreSignals()\n{\n    \/\/ Disconnect signals from core\n    uiInterface.NotifyAdrenalineNodeChanged.disconnect(boost::bind(&NotifyAdrenalineNodeUpdated, this, _1));\n}\n\nvoid MasternodeManager::on_tableWidget_2_itemSelectionChanged()\n{\n    if(ui->tableWidget_2->selectedItems().count() > 0)\n    {\n        ui->editButton->setEnabled(true);\n        ui->getConfigButton->setEnabled(true);\n        ui->startButton->setEnabled(true);\n        ui->stopButton->setEnabled(true);\n\tui->copyAddressButton->setEnabled(true);\n    }\n}\n\nvoid MasternodeManager::updateAdrenalineNode(QString alias, QString addr, QString privkey, QString collateral)\n{\n    LOCK(cs_adrenaline);\n    bool bFound = false;\n    int nodeRow = 0;\n    for(int i=0; i < ui->tableWidget_2->rowCount(); i++)\n    {\n        if(ui->tableWidget_2->item(i, 0)->text() == alias)\n        {\n            bFound = true;\n            nodeRow = i;\n            break;\n        }\n    }\n\n    if(nodeRow == 0 && !bFound)\n        ui->tableWidget_2->insertRow(0);\n\n    QTableWidgetItem *aliasItem = new QTableWidgetItem(alias);\n    QTableWidgetItem *addrItem = new QTableWidgetItem(addr);\n    QTableWidgetItem *statusItem = new QTableWidgetItem(\"\");\n    QTableWidgetItem *collateralItem = new QTableWidgetItem(collateral);\n\n    ui->tableWidget_2->setItem(nodeRow, 0, aliasItem);\n    ui->tableWidget_2->setItem(nodeRow, 1, addrItem);\n    ui->tableWidget_2->setItem(nodeRow, 2, statusItem);\n    ui->tableWidget_2->setItem(nodeRow, 3, collateralItem);\n}\n\nstatic QString seconds_to_DHMS(quint32 duration)\n{\n  QString res;\n  int seconds = (int) (duration % 60);\n  duration \/= 60;\n  int minutes = (int) (duration % 60);\n  duration \/= 60;\n  int hours = (int) (duration % 24);\n  int days = (int) (duration \/ 24);\n  if((hours == 0)&&(days == 0))\n      return res.sprintf(\"%02dm:%02ds\", minutes, seconds);\n  if (days == 0)\n      return res.sprintf(\"%02dh:%02dm:%02ds\", hours, minutes, seconds);\n  return res.sprintf(\"%dd %02dh:%02dm:%02ds\", days, hours, minutes, seconds);\n}\n\nvoid MasternodeManager::updateNodeList()\n{\n    TRY_LOCK(cs_masternodes, lockMasternodes);\n    if(!lockMasternodes)\n        return;\n\n    ui->countLabel->setText(\"Updating...\");\n    ui->tableWidget->clearContents();\n    ui->tableWidget->setRowCount(0);\n    CMasternode* mn = mnodeman.Find(activeMasternode.vin);\n    if(mn)\n    {\n        int mnRow = 0;\n        ui->tableWidget->insertRow(0);\n\n        \/\/ populate list\n        \/\/ Address, Rank, Active, Active Seconds, Last Seen, Pub Key\n        QTableWidgetItem *activeItem = new QTableWidgetItem(QString::number(activeMasternode.IsEnabled()));\n        QTableWidgetItem *addressItem = new QTableWidgetItem(QString::fromStdString(activeMasternode.addr.ToString()));\n        QTableWidgetItem *rankItem = new QTableWidgetItem(QString::number(mnodeman.GetMasternodeRank(activeMasternode.vin, pindexBest->nHeight)));\n        QTableWidgetItem *activeSecondsItem = new QTableWidgetItem(seconds_to_DHMS((qint64)(activeMasternode.lastTimeSeen - mn.now)));\n        QTableWidgetItem *lastSeenItem = new QTableWidgetItem(QString::fromStdString(DateTimeStrFormat(activeMasternode.lastTimeSeen)));\n\t\n        CScript pubkey;\n        pubkey =GetScriptForDestination(activeMasternode.pubkey.GetID());\n        CTxDestination address1;\n        ExtractDestination(pubkey, address1);\n        CBitcoinAddress address2(address1);\n        QTableWidgetItem *pubkeyItem = new QTableWidgetItem(QString::fromStdString(address2.ToString()));\n\t\n        ui->tableWidget->setItem(mnRow, 0, addressItem);\n        ui->tableWidget->setItem(mnRow, 1, rankItem);\n        ui->tableWidget->setItem(mnRow, 2, activeItem);\n        ui->tableWidget->setItem(mnRow, 3, activeSecondsItem);\n        ui->tableWidget->setItem(mnRow, 4, lastSeenItem);\n        ui->tableWidget->setItem(mnRow, 5, pubkeyItem);\n    }\n\n    ui->countLabel->setText(QString::number(ui->tableWidget->rowCount()));\n\n    if(pwalletMain)\n    {\n        LOCK(cs_adrenaline);\n        BOOST_FOREACH(PAIRTYPE(std::string, CAdrenalineNodeConfig) adrenaline, pwalletMain->mapMyAdrenalineNodes)\n        {\n            updateAdrenalineNode(QString::fromStdString(adrenaline.second.sAlias), QString::fromStdString(adrenaline.second.sAddress), QString::fromStdString(adrenaline.second.sMasternodePrivKey), QString::fromStdString(adrenaline.second.sCollateralAddress));\n        }\n    }\n}\n\n\nvoid MasternodeManager::setClientModel(ClientModel *model)\n{\n    this->clientModel = model;\n    if(model)\n    {\n    }\n}\n\nvoid MasternodeManager::setWalletModel(WalletModel *model)\n{\n    this->walletModel = model;\n    if(model && model->getOptionsModel())\n    {\n    }\n\n}\n\nvoid MasternodeManager::on_createButton_clicked()\n{\n    AddEditAdrenalineNode* aenode = new AddEditAdrenalineNode();\n    aenode->exec();\n}\n\nvoid MasternodeManager::on_copyAddressButton_clicked()\n{\n    QItemSelectionModel* selectionModel = ui->tableWidget_2->selectionModel();\n    QModelIndexList selected = selectionModel->selectedRows();\n    if(selected.count() == 0)\n        return;\n\n    QModelIndex index = selected.at(0);\n    int r = index.row();\n    std::string sCollateralAddress = ui->tableWidget_2->item(r, 3)->text().toStdString();\n\n    QApplication::clipboard()->setText(QString::fromStdString(sCollateralAddress));\n}\n\nvoid MasternodeManager::on_editButton_clicked()\n{\n    QItemSelectionModel* selectionModel = ui->tableWidget_2->selectionModel();\n    QModelIndexList selected = selectionModel->selectedRows();\n    if(selected.count() == 0)\n        return;\n\n    QModelIndex index = selected.at(0);\n    int r = index.row();\n    std::string sAddress = ui->tableWidget_2->item(r, 1)->text().toStdString();\n\n    \/\/ get existing config entry\n\n}\n\nvoid MasternodeManager::on_getConfigButton_clicked()\n{\n    QItemSelectionModel* selectionModel = ui->tableWidget_2->selectionModel();\n    QModelIndexList selected = selectionModel->selectedRows();\n    if(selected.count() == 0)\n        return;\n\n    QModelIndex index = selected.at(0);\n    int r = index.row();\n    std::string sAddress = ui->tableWidget_2->item(r, 1)->text().toStdString();\n    CAdrenalineNodeConfig c = pwalletMain->mapMyAdrenalineNodes[sAddress];\n    std::string sPrivKey = c.sMasternodePrivKey;\n    AdrenalineNodeConfigDialog* d = new AdrenalineNodeConfigDialog(this, QString::fromStdString(sAddress), QString::fromStdString(sPrivKey));\n    d->exec();\n}\n\nvoid MasternodeManager::on_removeButton_clicked()\n{\n    QItemSelectionModel* selectionModel = ui->tableWidget_2->selectionModel();\n    QModelIndexList selected = selectionModel->selectedRows();\n    if(selected.count() == 0)\n        return;\n\n    QMessageBox::StandardButton confirm;\n    confirm = QMessageBox::question(this, \"Delete Adrenaline Node?\", \"Are you sure you want to delete this adrenaline node configuration?\", QMessageBox::Yes|QMessageBox::No);\n\n    if(confirm == QMessageBox::Yes)\n    {\n        QModelIndex index = selected.at(0);\n        int r = index.row();\n        std::string sAddress = ui->tableWidget_2->item(r, 1)->text().toStdString();\n        CAdrenalineNodeConfig c = pwalletMain->mapMyAdrenalineNodes[sAddress];\n        CWalletDB walletdb(pwalletMain->strWalletFile);\n        pwalletMain->mapMyAdrenalineNodes.erase(sAddress);\n        walletdb.EraseAdrenalineNodeConfig(c.sAddress);\n        ui->tableWidget_2->clearContents();\n        ui->tableWidget_2->setRowCount(0);\n        BOOST_FOREACH(PAIRTYPE(std::string, CAdrenalineNodeConfig) adrenaline, pwalletMain->mapMyAdrenalineNodes)\n        {\n            updateAdrenalineNode(QString::fromStdString(adrenaline.second.sAlias), QString::fromStdString(adrenaline.second.sAddress), QString::fromStdString(adrenaline.second.sMasternodePrivKey), QString::fromStdString(adrenaline.second.sCollateralAddress));\n        }\n    }\n}\n\nvoid MasternodeManager::on_startButton_clicked()\n{\n    \/\/ start the node\n    QItemSelectionModel* selectionModel = ui->tableWidget_2->selectionModel();\n    QModelIndexList selected = selectionModel->selectedRows();\n    if(selected.count() == 0)\n        return;\n\n    QModelIndex index = selected.at(0);\n    int r = index.row();\n    std::string sAddress = ui->tableWidget_2->item(r, 1)->text().toStdString();\n    CAdrenalineNodeConfig c = pwalletMain->mapMyAdrenalineNodes[sAddress];\n\n    std::string errorMessage;\n    bool result = activeMasternode.RegisterByPubKey(c.sAddress, c.sMasternodePrivKey, c.sCollateralAddress, errorMessage);\n\n    QMessageBox msg;\n    if(result)\n        msg.setText(\"Adrenaline Node at \" + QString::fromStdString(c.sAddress) + \" started.\");\n    else\n        msg.setText(\"Error: \" + QString::fromStdString(errorMessage));\n\n    msg.exec();\n}\n\nvoid MasternodeManager::on_stopButton_clicked()\n{\n    \/\/ start the node\n    QItemSelectionModel* selectionModel = ui->tableWidget_2->selectionModel();\n    QModelIndexList selected = selectionModel->selectedRows();\n    if(selected.count() == 0)\n        return;\n\n    QModelIndex index = selected.at(0);\n    int r = index.row();\n    std::string sAddress = ui->tableWidget_2->item(r, 1)->text().toStdString();\n    CAdrenalineNodeConfig c = pwalletMain->mapMyAdrenalineNodes[sAddress];\n\n    std::string errorMessage;\n    bool result = activeMasternode.StopMasterNode(c.sAddress, c.sMasternodePrivKey, errorMessage);\n    QMessageBox msg;\n    if(result)\n    {\n        msg.setText(\"Adrenaline Node at \" + QString::fromStdString(c.sAddress) + \" stopped.\");\n    }\n    else\n    {\n        msg.setText(\"Error: \" + QString::fromStdString(errorMessage));\n    }\n    msg.exec();\n}\n\nvoid MasternodeManager::on_startAllButton_clicked()\n{\n    std::string results;\n    BOOST_FOREACH(PAIRTYPE(std::string, CAdrenalineNodeConfig) adrenaline, pwalletMain->mapMyAdrenalineNodes)\n    {\n        CAdrenalineNodeConfig c = adrenaline.second;\n\tstd::string errorMessage;\n        bool result = activeMasternode.RegisterByPubKey(c.sAddress, c.sMasternodePrivKey, c.sCollateralAddress, errorMessage);\n\tif(result)\n\t{\n   \t    results += c.sAddress + \": STARTED\\n\";\n\t}\t\n\telse\n\t{\n\t    results += c.sAddress + \": ERROR: \" + errorMessage + \"\\n\";\n\t}\n    }\n\n    QMessageBox msg;\n    msg.setText(QString::fromStdString(results));\n    msg.exec();\n}\n\nvoid MasternodeManager::on_stopAllButton_clicked()\n{\n    std::string results;\n    BOOST_FOREACH(PAIRTYPE(std::string, CAdrenalineNodeConfig) adrenaline, pwalletMain->mapMyAdrenalineNodes)\n    {\n        CAdrenalineNodeConfig c = adrenaline.second;\n\tstd::string errorMessage;\n        bool result = activeMasternode.StopMasterNode(c.sAddress, c.sMasternodePrivKey, errorMessage);\n\tif(result)\n\t{\n   \t    results += c.sAddress + \": STOPPED\\n\";\n\t}\t\n\telse\n\t{\n\t    results += c.sAddress + \": ERROR: \" + errorMessage + \"\\n\";\n\t}\n    }\n\n    QMessageBox msg;\n    msg.setText(QString::fromStdString(results));\n    msg.exec();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n * REALM CONFIDENTIAL\n * __________________\n *\n *  [2011] - [2012] Realm Inc\n *  All Rights Reserved.\n *\n * NOTICE:  All information contained herein is, and remains\n * the property of Realm Incorporated and its suppliers,\n * if any.  The intellectual and technical concepts contained\n * herein are proprietary to Realm Incorporated\n * and its suppliers and may be covered by U.S. and Foreign Patents,\n * patents in process, and are protected by trade secret or copyright law.\n * Dissemination of this information or reproduction of this material\n * is strictly forbidden unless prior written permission is obtained\n * from Realm Incorporated.\n *\n **************************************************************************\/\n#ifndef REALM_UTIL_TERMINATE_HPP\n#define REALM_UTIL_TERMINATE_HPP\n\n#include <cstdlib>\n#include <sstream>\n#include <string>\n\n#include <realm\/util\/features.h>\n#include <realm\/version.hpp>\n\n#define REALM_TERMINATE(msg) realm::util::terminate((msg), __FILE__, __LINE__)\n\nnamespace realm {\nnamespace util {\nREALM_NORETURN void terminate_internal(std::stringstream&) noexcept;\n\nREALM_NORETURN inline void terminate(const char* message, const char* file, long line) noexcept {\n    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<commit_msg>Reindented terminate.hpp<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{\n    std::stringstream ss;\n    ss << file << \":\" << line << \": \" REALM_VER_CHUNK \" \" << message << \"\\n\";\n    terminate_internal(ss);\n}\n\ntemplate <typename T1, typename T2>\nREALM_NORETURN void terminate(const char* message, const char* file, long line, T1 info1, T2 info2) noexcept\n{\n    std::stringstream ss;\n    ss << file << \":\" << line << \": \" REALM_VER_CHUNK \" \" << message << \" [\" << info1 << \", \" << info2 << \"]\\n\";\n    terminate_internal(ss);\n}\n\ntemplate <typename T1, typename T2, typename T3, typename T4>\nREALM_NORETURN void terminate(const char* message, const char* file, long line, T1 info1, T2 info2, T3 info3,\n                              T4 info4) noexcept\n{\n    std::stringstream ss;\n    ss << file << \":\" << line << \": \" REALM_VER_CHUNK \" \" << message\n        << \" [\" << info1 << \", \" << info2 << \", \" << info3 << \", \" << info4 << \"]\\n\";\n    terminate_internal(ss);\n}\n\ntemplate <typename T1, typename T2, typename T3, typename T4, typename T5, typename T6>\nREALM_NORETURN void terminate(const char* message, const char* file, long line, T1 info1, T2 info2, T3 info3,\n                              T4 info4, T5 info5, T6 info6) noexcept\n{\n    std::stringstream ss;\n    ss << file << \":\" << line << \": \" REALM_VER_CHUNK \" \" << message\n        << \" [\" << info1 << \", \" << info2 << \", \" << info3 << \", \"\n        << info4 << \", \" << info5 << \", \" << info6 << \"]\\n\";\n    terminate_internal(ss);\n}\n\n} \/\/ namespace util\n} \/\/ namespace realm\n\n#endif \/\/ REALM_UTIL_TERMINATE_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2017 Dariusz Stojaczyk. All Rights Reserved.\n * The following source code is released under an MIT-style license,\n * that can be found in the LICENSE file.\n *\/\n\n#include \"ShaderProgram.h\"\n#include \"Shader.h\"\n\nShaderProgram::ShaderProgram()\n    : m_id(glCreateProgram()) {}\n\nGLuint ShaderProgram::id() {\n    return m_id;\n}\n\nint ShaderProgram::addShader(const Shader &shader) {\n    if (!shader.compiled()) {\n        return -1;\n    }\n\n    GLuint shader_id = shader.id();\n    glAttachShader(m_id, shader_id);\n    m_boundShaders.push_back(shader_id);\n\n    return 0;\n}\n\nint ShaderProgram::linkProgram() {\n    glLinkProgram(m_id);\n\n    int linked;\n    glGetProgramiv(m_id, GL_LINK_STATUS, &linked);\n    m_linked = (linked == GL_TRUE);\n\n    for (GLuint shader_id : m_boundShaders) {\n        glDetachShader(m_id, shader_id);\n    }\n\n    m_boundShaders.clear();\n\n    return m_linked ? 0 : -1;\n}\n\nint ShaderProgram::useProgram() {\n    if (!m_linked) {\n        return -1;\n    }\n\n    glUseProgram(m_id);\n    return 0;\n}\n\nint ShaderProgram::setUniform(const std::string &name, float val) {\n    int loc = glGetUniformLocation(m_id, name.c_str());\n    \n    if (loc >= 0) {\n        glUniform1fv(loc, 1, &val);\n        return 0;\n    } else {\n        return -1;\n    }\n}\n\nint ShaderProgram::setUniform(const std::string &name, const glm::vec4 &val) {\n    int loc = glGetUniformLocation(m_id, name.c_str());\n    \n    if (loc >= 0) {\n        glUniform4fv(loc, 1, reinterpret_cast<const GLfloat *>(&val));\n        return 0;\n    } else {\n        return -1;\n    }\n}\n\nint ShaderProgram::setUniform(const std::string &name, const glm::mat4 &val) {\n    int loc = glGetUniformLocation(m_id, name.c_str());\n\n    if (loc >= 0) {\n        glUniformMatrix4fv(loc, 1, GL_FALSE, reinterpret_cast<const GLfloat *>(&val));\n        return 0;\n    } else {\n        return -1;\n    }\n}\n\nint ShaderProgram::setUniform(const std::string &name, int val) {\n    int loc = glGetUniformLocation(m_id, name.c_str());\n\n    if (loc >= 0) {\n        glUniform1i(loc, val);\n        return 0;\n    } else {\n        return -1;\n    }\n}\n\nShaderProgram::~ShaderProgram() {\n    glDeleteProgram(m_id);\n}<commit_msg>Prevent linking the same program twice<commit_after>\/*\n * Copyright (c) 2017 Dariusz Stojaczyk. All Rights Reserved.\n * The following source code is released under an MIT-style license,\n * that can be found in the LICENSE file.\n *\/\n\n#include \"ShaderProgram.h\"\n#include \"Shader.h\"\n#include \"util\/log.h\"\n\nShaderProgram::ShaderProgram()\n    : m_id(glCreateProgram()) {}\n\nGLuint ShaderProgram::id() {\n    return m_id;\n}\n\nint ShaderProgram::addShader(const Shader &shader) {\n    if (!shader.compiled()) {\n        return -1;\n    }\n\n    GLuint shader_id = shader.id();\n    glAttachShader(m_id, shader_id);\n    m_boundShaders.push_back(shader_id);\n\n    return 0;\n}\n\nint ShaderProgram::linkProgram() {\n    if (m_linked) {\n        Log::error(\"Trying to link the same ShaderProgram twice.\");\n        return -1;\n    }\n    \n    glLinkProgram(m_id);\n\n    int linked;\n    glGetProgramiv(m_id, GL_LINK_STATUS, &linked);\n    m_linked = (linked == GL_TRUE);\n\n    for (GLuint shader_id : m_boundShaders) {\n        glDetachShader(m_id, shader_id);\n    }\n\n    m_boundShaders.clear();\n\n    return m_linked ? 0 : -1;\n}\n\nint ShaderProgram::useProgram() {\n    if (!m_linked) {\n        return -1;\n    }\n\n    glUseProgram(m_id);\n    return 0;\n}\n\nint ShaderProgram::setUniform(const std::string &name, float val) {\n    int loc = glGetUniformLocation(m_id, name.c_str());\n    \n    if (loc >= 0) {\n        glUniform1fv(loc, 1, &val);\n        return 0;\n    } else {\n        return -1;\n    }\n}\n\nint ShaderProgram::setUniform(const std::string &name, const glm::vec4 &val) {\n    int loc = glGetUniformLocation(m_id, name.c_str());\n    \n    if (loc >= 0) {\n        glUniform4fv(loc, 1, reinterpret_cast<const GLfloat *>(&val));\n        return 0;\n    } else {\n        return -1;\n    }\n}\n\nint ShaderProgram::setUniform(const std::string &name, const glm::mat4 &val) {\n    int loc = glGetUniformLocation(m_id, name.c_str());\n\n    if (loc >= 0) {\n        glUniformMatrix4fv(loc, 1, GL_FALSE, reinterpret_cast<const GLfloat *>(&val));\n        return 0;\n    } else {\n        return -1;\n    }\n}\n\nint ShaderProgram::setUniform(const std::string &name, int val) {\n    int loc = glGetUniformLocation(m_id, name.c_str());\n\n    if (loc >= 0) {\n        glUniform1i(loc, val);\n        return 0;\n    } else {\n        return -1;\n    }\n}\n\nShaderProgram::~ShaderProgram() {\n    glDeleteProgram(m_id);\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2016 Dariusz Stojaczyk. All Rights Reserved.\n * The following source code is released under an MIT-style license,\n * that can be found in the LICENSE file.\n *\/\n\n\/**\n * NOTE: This class requires heavy exception handling.\n * If something goes wrong it would be a real hell to debug\n *\/\n\n#include <memory>\n#include <regex>\n#include <unordered_map>\n#include <cstdlib>\n\n#include \"Atlas.h\"\n#include \"TexData.h\"\n#include \"util\/collection.h\"\n#include \"util\/file.h\"\n#include \"Resampler.h\"\n#include \"util\/Packer.h\"\n#include \"exceptions.h\"\n#include \"util\/log.h\"\n#include \"util\/prof.h\"\n\nusing namespace texture;\n\n\/**\n * The following state may not be available on some devices (e.g. OpenGL ES 2.0)\n *\/\n#ifdef GL_TEXTURE_MAX_LEVEL\n#define USES_MANUAL_MIPMAPS\n#endif\n\n#ifndef USES_MANUAL_MIPMAPS\n#include <SOIL.h>\n#endif\n\nstruct Atlas::impl {\n    impl(std::vector<std::string> tiles)\n        : m_tiles(util::collection::filter(tiles, FILE_EXTENSION_REGEX)) {\n\n    }\n\n    \/**\n     * OpenGL uses enum to determine a number (and type) of texture channels.\n     * Since we don't handle different types of texture channels in Atlas class,\n     * just a pure int number of channels is passed between methods.\n     *\/\n    GLenum getTexGLFormat(uint32_t channels) {\n        GLenum ret;\n\n        switch (channels) {\n            case 1:\n                ret = GL_LUMINANCE; \/**< If L was converted into RGBA, it would be R=L, G=L, B=L, A=1 *\/\n                break;\n            case 2:\n                ret = GL_LUMINANCE_ALPHA; \/**< If LA' was converted into RGBA, it would be R=L, G=L, B=L, A=A' *\/\n                break;\n            case 3:\n                ret = GL_RGB; \/**< A=1 *\/\n                break;\n            case 4:\n                ret = GL_RGBA;\n                break;\n            default:\n                char msg[100];\n                snprintf(msg, sizeof(msg), \"Trying to convert invalid channel number into an OpenGL texture format (channels:%d).\", channels);\n                throw invalid_texture_error(msg);\n        }\n\n        return ret;\n    }\n\n    void writeTexToGPU(TexData &tex, uint32_t level) {\n        uint32_t channels = tex.channels();\n\n        if (channels < 1 || channels > 4) {\n            char msg[90];\n            snprintf(msg, sizeof(msg), \"Trying to write to GPU texture with invalid amount of channels (channels:%d).\", channels);\n            throw invalid_texture_error(msg);\n        }\n\n#ifdef DBG_COLORMIPMAPS\n        \/\/ color mipmaps in scheme: red (biggest) -> yellow (smallest)\n        if (channels >= 3) {\n            for (int i = 0; i < tex.width() * tex.height(); ++i) {\n                resampled[channels * i + 0] = 255 - level * 40;\n                resampled[channels * i + 1] = level * 40;\n                resampled[channels * i + 2] = 0;\n                if (channels >= 4) {\n                    resampled[channels * i + 3] = 255;\n                }\n            }\n        }\n#endif \/\/ DBG_COLORMIPMAPS\n\n        if (channels == 4) {\n            \/\/ burn alpha into RGB channels\n            for (int i = 0; i < tex.width() * tex.height(); ++i) {\n                tex[channels * i + 0] = (uint8_t) ((tex[channels * i + 0] * tex[channels * i + 3] + 128) >> 8);\n                tex[channels * i + 1] = (uint8_t) ((tex[channels * i + 1] * tex[channels * i + 3] + 128) >> 8);\n                tex[channels * i + 2] = (uint8_t) ((tex[channels * i + 2] * tex[channels * i + 3] + 128) >> 8);\n            }\n        }\n\n        glTexImage2D(GL_TEXTURE_2D, level, tex.channels(), tex.width(), tex.height(), 0, getTexGLFormat(tex.channels()), GL_UNSIGNED_BYTE, tex.get());\n    }\n\n    util::Packer m_packer;\n    std::hash<std::string> m_hash;\n    std::unordered_map<uint64_t, TexData> m_texData;\n\n    std::vector<std::string> m_tiles;\n    static const std::regex FILE_EXTENSION_REGEX;\n};\n\nconst std::regex Atlas::impl::FILE_EXTENSION_REGEX = std::regex(\"(.*)(\\\\.(jpg|png|gif))\", std::regex::ECMAScript | std::regex::icase);\n\nAtlas::Atlas(const std::string &name)\n    : Texture(name),\n      m_impl(std::make_unique<Atlas::impl>(util::file::list(util::file::path<util::file::type::texture>(name).c_str()))) {\n\n}\n\nvoid Atlas::load() {\n    PROF_START(load);\n    for (const std::string &tile : m_impl->m_tiles) {\n        loadTile(tile);\n    }\n\n    m_impl->m_packer.pack();\n\n    m_width = m_impl->m_packer.size().width();\n    m_height = m_impl->m_packer.size().height();\n    m_channels = 4;\n\n    Log::debug(\"Preparing the texture atlas \\\"%s\\\" took %f sec.\", m_path.c_str(), PROF_DURATION_PREV(load));\n\n#ifdef USES_MANUAL_MIPMAPS\n    glGenTextures(1, &m_id);\n    bindTexture();\n\n    uint32_t mipmapLevels = (uint32_t) ceil(log(std::max(width(), height())) \/ log(2));\n\n    glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAX_LEVEL, mipmapLevels - 1);\n\n    Log::debug(\"Preparing the OpenGL texture \\\"%s\\\" took %f sec.\", m_path.c_str(), PROF_DURATION_PREV(load));\n\n    for (uint8_t level = 0; level < mipmapLevels; ++level) {\n#else\n        uint8_t level = 0;\n#endif\n        uint32_t downsample = 1u << level;\n        TexData atlas(width() \/ downsample, height() \/ downsample, channels());\n\n        \/\/TODO it's totally unreadable\n        for (auto &el : m_impl->m_packer.elements()) {\n            TexData &inTile = m_impl->m_texData.find(el.first)->second;\n            TexData outTile = texture::Resampler::downsample(inTile, downsample);\n            util::Rectangle rect(el.second.x() \/ downsample, el.second.y() \/ downsample, el.second.width() \/ downsample, el.second.height() \/ downsample);\n\n            uint32_t inWidth = inTile.width() \/ downsample;\n            uint32_t inHeight = inTile.height() \/ downsample;\n            uint32_t outWidth = m_impl->m_packer.size().width() \/ downsample;\n\n            for (int yIn = 0; yIn < inHeight; ++yIn) {\n                for (int xIn = 0; xIn < inWidth; ++xIn) {\n                    uint32_t inPixelPos = xIn + yIn * inWidth;\n                    uint32_t outPixelPos = rect.x() + xIn + (rect.y() + yIn) * outWidth;\n                    for (int channel = 0; channel < channels(); ++channel) {\n                        atlas[4 * outPixelPos + channel] = outTile[channels() * inPixelPos + channel];\n                    }\n                }\n            }\n        }\n\n        Log::debug(\"\\tResampling of level %d of the texture atlas \\\"%s\\\" took %f sec.\", level, m_path.c_str(), PROF_DURATION_PREV(load));\n\n#ifdef USES_MANUAL_MIPMAPS\n        m_impl->writeTexToGPU(atlas, level);\n    }\n#else\n    \/\/TODO create additional writeTexToGPU overload (?)\n    m_id = SOIL_create_OGL_texture(atlas.get(), m_width, m_height, m_channels, 0, SOIL_FLAG_MULTIPLY_ALPHA);\n    glGenerateMipmap(GL_TEXTURE_2D);\n#endif\n\n    Log::debug(\"Generating the texture atlas \\\"%s\\\" took %f sec.\", m_path.c_str(), PROF_DURATION_START(load));\n}\n\nvoid Atlas::loadTile(const std::string &fileName) {\n    TexData tex(m_path + util::file::file_separator_str + fileName);\n    uint64_t id = m_impl->m_hash(fileName.substr(0, fileName.find_last_of('.')));\n\n    m_impl->m_packer.add({id, util::Rectangle(tex.width(), tex.height())});\n    m_impl->m_texData.emplace(id, std::move(tex));\n}\n\nconst util::Rectangle Atlas::element(const std::string &name) const {\n    uint64_t id = m_impl->m_hash(name);\n    auto elements = m_impl->m_packer.elements();\n\n    auto it = std::find_if(elements.begin(), elements.end(), [id](const util::Packer::Element &element) {\n        return element.first == id;\n    });\n\n    if (it == elements.end()) {\n        char msg[100];\n        snprintf(msg, sizeof(msg), \"Trying to get inexistent element (\\\"%d\\\") from texture atlas.\", name.c_str());\n        throw invalid_texture_error(msg);\n    }\n\n    return it->second;\n}\n\nconst uint64_t Atlas::getElementsNum() const {\n    return m_impl->m_texData.size();\n}\n\nAtlas::~Atlas() {}<commit_msg>Cleanup. Removed texture resampling for mipmap level 0 (original)<commit_after>\/*\n * Copyright (c) 2016 Dariusz Stojaczyk. All Rights Reserved.\n * The following source code is released under an MIT-style license,\n * that can be found in the LICENSE file.\n *\/\n\n\/**\n * NOTE: This class requires heavy exception handling.\n * If something goes wrong it would be a real hell to debug\n *\/\n\n#include <memory>\n#include <regex>\n#include <unordered_map>\n#include <cstdlib>\n\n#include \"Atlas.h\"\n#include \"TexData.h\"\n#include \"util\/collection.h\"\n#include \"util\/file.h\"\n#include \"Resampler.h\"\n#include \"util\/Packer.h\"\n#include \"exceptions.h\"\n#include \"util\/log.h\"\n#include \"util\/prof.h\"\n\nusing namespace texture;\n\n\/**\n * The following state may not be available on some devices (e.g. OpenGL ES 2.0)\n *\/\n#ifdef GL_TEXTURE_MAX_LEVEL\n#define USES_MANUAL_MIPMAPS\n#endif\n\n#ifndef USES_MANUAL_MIPMAPS\n#include <SOIL.h>\n#endif\n\nstruct Atlas::impl {\n    impl(std::vector<std::string> tiles)\n        : m_tiles(util::collection::filter(tiles, FILE_EXTENSION_REGEX)) {\n\n    }\n\n    \/**\n     * OpenGL uses enum to determine a number (and type) of texture channels.\n     * Since we don't handle different types of texture channels in Atlas class,\n     * just a pure int number of channels is passed between methods.\n     *\/\n    GLenum getTexGLFormat(uint32_t channels) {\n        GLenum ret;\n\n        switch (channels) {\n            case 1:\n                ret = GL_LUMINANCE; \/**< If L was converted into RGBA, it would be R=L, G=L, B=L, A=1 *\/\n                break;\n            case 2:\n                ret = GL_LUMINANCE_ALPHA; \/**< If LA' was converted into RGBA, it would be R=L, G=L, B=L, A=A' *\/\n                break;\n            case 3:\n                ret = GL_RGB; \/**< A=1 *\/\n                break;\n            case 4:\n                ret = GL_RGBA;\n                break;\n            default:\n                char msg[100];\n                snprintf(msg, sizeof(msg), \"Trying to convert invalid channel number into an OpenGL texture format (channels:%d).\", channels);\n                throw invalid_texture_error(msg);\n        }\n\n        return ret;\n    }\n\n    void writeToCanvas(const TexData &inData, TexData &outBuffer, const std::pair<uint32_t, uint32_t> &pos, uint32_t level = 0) {\n        uint32_t inWidth = inData.width();\n        uint32_t inHeight = inData.height();\n        uint32_t outWidth = m_packer.size().width() \/ (1u << level);\n        uint32_t outChannels = std::min<uint32_t>(outBuffer.channels(), inData.channels());\n\n        for (int yIn = 0; yIn < inHeight; ++yIn) {\n            for (int xIn = 0; xIn < inWidth; ++xIn) {\n                uint32_t inPixelPos = xIn + yIn * inWidth;\n                uint32_t outPixelPos = pos.first + xIn + (pos.second + yIn) * outWidth;\n                for (int channel = 0; channel < outChannels; ++channel) {\n                    outBuffer[outBuffer.channels() * outPixelPos + channel] = inData[inData.channels() * inPixelPos + channel];\n                }\n            }\n        }\n    }\n\n    void writeTexToGPU(TexData &tex, uint32_t level) {\n        uint32_t width = tex.width() \/ (1u << level);\n        uint32_t height = tex.height() \/ (1u << level);\n        uint32_t channels = tex.channels();\n\n        if (channels < 1 || channels > 4) {\n            char msg[90];\n            snprintf(msg, sizeof(msg), \"Trying to write to GPU texture with invalid amount of channels (channels:%d).\", channels);\n            throw invalid_texture_error(msg);\n        }\n\n#ifdef DBG_COLORMIPMAPS\n        \/\/ color mipmaps in scheme: red (biggest) -> yellow (smallest)\n        if (channels >= 3) {\n            for (int i = 0; i < tex.width() * tex.height(); ++i) {\n                resampled[channels * i + 0] = 255 - level * 40;\n                resampled[channels * i + 1] = level * 40;\n                resampled[channels * i + 2] = 0;\n                if (channels >= 4) {\n                    resampled[channels * i + 3] = 255;\n                }\n            }\n        }\n#endif \/\/ DBG_COLORMIPMAPS\n\n        if (channels == 4) {\n            \/\/ burn alpha into RGB channels\n            for (int i = 0; i < width * height; ++i) {\n                tex[channels * i + 0] = (uint8_t) ((tex[channels * i + 0] * tex[channels * i + 3] + 128) >> 8);\n                tex[channels * i + 1] = (uint8_t) ((tex[channels * i + 1] * tex[channels * i + 3] + 128) >> 8);\n                tex[channels * i + 2] = (uint8_t) ((tex[channels * i + 2] * tex[channels * i + 3] + 128) >> 8);\n            }\n        }\n\n        glTexImage2D(GL_TEXTURE_2D, level, getTexGLFormat(channels), width, height, 0, getTexGLFormat(channels), GL_UNSIGNED_BYTE, tex.get());\n    }\n\n    util::Packer m_packer;\n    std::hash<std::string> m_hash;\n    std::unordered_map<uint64_t, TexData> m_texData;\n\n    std::vector<std::string> m_tiles;\n    static const std::regex FILE_EXTENSION_REGEX;\n};\n\nconst std::regex Atlas::impl::FILE_EXTENSION_REGEX = std::regex(\"(.*)(\\\\.(jpg|png|gif))\", std::regex::ECMAScript | std::regex::icase);\n\nAtlas::Atlas(const std::string &name)\n    : Texture(name),\n      m_impl(std::make_unique<Atlas::impl>(util::file::list(util::file::path<util::file::type::texture>(name).c_str()))) {\n\n}\n\nvoid Atlas::load() {\n    PROF_START(load);\n    for (const std::string &tile : m_impl->m_tiles) {\n        loadTile(tile);\n    }\n\n    m_impl->m_packer.pack();\n\n    m_width = m_impl->m_packer.size().width();\n    m_height = m_impl->m_packer.size().height();\n    m_channels = 4;\n\n    Log::debug(\"Preparing the texture atlas \\\"%s\\\" took %f sec.\", m_path.c_str(), PROF_DURATION_PREV(load));\n\n    glGenTextures(1, &m_id);\n    bindTexture();\n\n\n    \/**\n     * Texture canvas for all mipmap levels of this atlas.\n     * This is a temporary container, since all data gets uploaded to the GPU right away.\n     *\/\n    TexData buffer(width(), height(), channels());\n\n    for (const util::Packer::Element &el : m_impl->m_packer.elements()) {\n        const TexData &inTile = m_impl->m_texData.find(el.first)->second;\n        m_impl->writeToCanvas(inTile, buffer, std::make_pair<uint32_t, uint32_t>(el.second.x(), el.second.y()));\n    }\n\n    m_impl->writeTexToGPU(buffer, 0);\n\n    Log::debug(\"\\tResampling of level 0 of the texture atlas \\\"%s\\\" took %f sec.\", m_path.c_str(), PROF_DURATION_PREV(load));\n\n#ifdef USES_MANUAL_MIPMAPS\n    uint32_t mipmapLevels = (uint32_t) ceil(log(std::max(width(), height())) \/ log(2));\n    glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAX_LEVEL, mipmapLevels - 1);\n\n    for (uint8_t level = 1; level < mipmapLevels; ++level) {\n        uint32_t downsample = 1u << level;\n\n        \/\/TODO it's totally unreadable\n        for (const util::Packer::Element &el : m_impl->m_packer.elements()) {\n            const TexData &inTile = m_impl->m_texData.find(el.first)->second;\n            TexData resampledData = texture::Resampler::downsample(inTile, downsample);\n            auto pos = std::make_pair<uint32_t, uint32_t>(el.second.x() \/ downsample, el.second.y() \/ downsample);\n            m_impl->writeToCanvas(resampledData, buffer, pos, level);\n        }\n\n        Log::debug(\"\\tResampling of level %d of the texture atlas \\\"%s\\\" took %f sec.\", level, m_path.c_str(), PROF_DURATION_PREV(load));\n        m_impl->writeTexToGPU(buffer, level);\n    }\n#else\n    glGenerateMipmap(GL_TEXTURE_2D);\n#endif\n\n    Log::debug(\"Generating the texture atlas \\\"%s\\\" took %f sec.\", m_path.c_str(), PROF_DURATION_START(load));\n}\n\nvoid Atlas::loadTile(const std::string &fileName) {\n    TexData tex(m_path + util::file::file_separator_str + fileName);\n    uint64_t id = m_impl->m_hash(fileName.substr(0, fileName.find_last_of('.')));\n\n    m_impl->m_packer.add({id, util::Rectangle(tex.width(), tex.height())});\n    m_impl->m_texData.emplace(id, std::move(tex));\n}\n\nconst util::Rectangle Atlas::element(const std::string &name) const {\n    uint64_t id = m_impl->m_hash(name);\n    auto elements = m_impl->m_packer.elements();\n\n    auto it = std::find_if(elements.begin(), elements.end(), [id](const util::Packer::Element &element) {\n        return element.first == id;\n    });\n\n    if (it == elements.end()) {\n        char msg[100];\n        snprintf(msg, sizeof(msg), \"Trying to get inexistent element (\\\"%d\\\") from texture atlas.\", name.c_str());\n        throw invalid_texture_error(msg);\n    }\n\n    return it->second;\n}\n\nconst uint64_t Atlas::getElementsNum() const {\n    return m_impl->m_texData.size();\n}\n\nAtlas::~Atlas() {}<|endoftext|>"}
{"text":"<commit_before>\/* -------------------------------------------------------------------------- *\/\n\/* Copyright 2002-2014, 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 \"RequestManagerInfo.h\"\n#include \"RequestManagerPoolInfoFilter.h\"\n\nusing namespace std;\n\n\/* ------------------------------------------------------------------------- *\/\n\/* ------------------------------------------------------------------------- *\/\n\nvoid RequestManagerInfo::request_execute(xmlrpc_c::paramList const& paramList,\n                                         RequestAttributes& att)\n{\n    int             oid = xmlrpc_c::value_int(paramList.getInt(1));\n    PoolObjectSQL * object;\n    string          str;\n\n    if ( oid == -1 )\n    {\n        if ( auth_object == PoolObjectSQL::USER )\n        {\n            oid = att.uid;\n        }\n        else if ( auth_object == PoolObjectSQL::GROUP )\n        {\n            oid = att.gid;\n        }\n    }\n\n    if ( basic_authorization(oid, att) == false )\n    {\n        return;\n    }\n\n    object = pool->get(oid,true);\n\n    if ( object == 0 )\n    {\n        failure_response(NO_EXISTS,\n                get_error(object_name(auth_object),oid),\n                att);\n        return;\n    }\n\n    to_xml(att, object, str);\n\n    object->unlock();\n\n    success_response(str, att);\n\n    return;\n}\n\n\/* ------------------------------------------------------------------------- *\/\n\/* ------------------------------------------------------------------------- *\/\n\nvoid VirtualNetworkInfo::to_xml(RequestAttributes& att, PoolObjectSQL * object,\n    string& str)\n{\n    vector<int> vms;\n    vector<int> vnets;\n\n    string where_vnets;\n    string where_vms;\n\n    bool all_reservations = RequestManagerPoolInfoFilter::use_filter(att,\n            PoolObjectSQL::NET, true, true, false, \"(pid != -1)\", where_vnets);\n\n    bool all_vms = RequestManagerPoolInfoFilter::use_filter(att,\n            PoolObjectSQL::VM, false, false, false, \"\", where_vms);\n\n    if ( all_reservations == true )\n    {\n        vnets.push_back(-1);\n    }\n    else\n    {\n        Nebula::instance().get_vnpool()->search(vnets, where_vnets);\n    }\n\n    if ( all_vms == true )\n    {\n        vms.push_back(-1);\n    }\n    else\n    {\n        Nebula::instance().get_vmpool()->search(vms, where_vms);\n    }\n\n    static_cast<VirtualNetwork*>(object)->to_xml_extended(str, vms, vnets);\n};\n<commit_msg>Feature #3588: Users with vnet manage can see all leases<commit_after>\/* -------------------------------------------------------------------------- *\/\n\/* Copyright 2002-2014, 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 \"RequestManagerInfo.h\"\n#include \"RequestManagerPoolInfoFilter.h\"\n\nusing namespace std;\n\n\/* ------------------------------------------------------------------------- *\/\n\/* ------------------------------------------------------------------------- *\/\n\nvoid RequestManagerInfo::request_execute(xmlrpc_c::paramList const& paramList,\n                                         RequestAttributes& att)\n{\n    int             oid = xmlrpc_c::value_int(paramList.getInt(1));\n    PoolObjectSQL * object;\n    string          str;\n\n    if ( oid == -1 )\n    {\n        if ( auth_object == PoolObjectSQL::USER )\n        {\n            oid = att.uid;\n        }\n        else if ( auth_object == PoolObjectSQL::GROUP )\n        {\n            oid = att.gid;\n        }\n    }\n\n    if ( basic_authorization(oid, att) == false )\n    {\n        return;\n    }\n\n    object = pool->get(oid,true);\n\n    if ( object == 0 )\n    {\n        failure_response(NO_EXISTS,\n                get_error(object_name(auth_object),oid),\n                att);\n        return;\n    }\n\n    to_xml(att, object, str);\n\n    object->unlock();\n\n    success_response(str, att);\n\n    return;\n}\n\n\/* ------------------------------------------------------------------------- *\/\n\/* ------------------------------------------------------------------------- *\/\n\nvoid VirtualNetworkInfo::to_xml(RequestAttributes& att, PoolObjectSQL * object,\n    string& str)\n{\n    vector<int> vms;\n    vector<int> vnets;\n\n    string where_vnets;\n    string where_vms;\n\n    bool all_reservations;\n    bool all_vms;\n\n    PoolObjectAuth perms;\n\n    object->get_permissions(perms);\n\n    AuthRequest ar(att.uid, att.group_ids);\n\n    ar.add_auth(AuthRequest::MANAGE, perms);\n\n    if (UserPool::authorize(ar) == 0)\n    {\n        all_reservations = true;\n        all_vms = true;\n    }\n    else\n    {\n        all_reservations = RequestManagerPoolInfoFilter::use_filter(att,\n                PoolObjectSQL::NET, true, true, false, \"(pid != -1)\", where_vnets);\n\n        all_vms = RequestManagerPoolInfoFilter::use_filter(att,\n                PoolObjectSQL::VM, false, false, false, \"\", where_vms);\n    }\n\n    if ( all_reservations == true )\n    {\n        vnets.push_back(-1);\n    }\n    else\n    {\n        Nebula::instance().get_vnpool()->search(vnets, where_vnets);\n    }\n\n    if ( all_vms == true )\n    {\n        vms.push_back(-1);\n    }\n    else\n    {\n        Nebula::instance().get_vmpool()->search(vms, where_vms);\n    }\n\n    static_cast<VirtualNetwork*>(object)->to_xml_extended(str, vms, vnets);\n};\n<|endoftext|>"}
{"text":"<commit_before>\/\/ kfileio.cpp\n\/\/ Author: Stefan Taferner <taferner@kde.org>\n\/\/ License: GPL\n\n#ifdef HAVE_CONFIG_H\n#include <config.h>\n#endif\n\n#include <kmessagebox.h>\n#include <kdebug.h>\n\n#include <assert.h>\n#include <qdir.h>\n\n#include <klocale.h>\n#include <kstdguiitem.h>\n\n#include <qwidget.h>\n#include <qfile.h>\n#include <qfileinfo.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n\nnamespace KPIM {\n\n\/\/-----------------------------------------------------------------------------\nstatic void msgDialog(const QString &msg)\n{\n  KMessageBox::sorry(0, msg, i18n(\"File I\/O Error\"));\n}\n\n\n\/\/-----------------------------------------------------------------------------\nQCString kFileToString(const QString &aFileName, bool aEnsureNL, bool aVerbose)\n{\n  QCString result;\n  QFileInfo info(aFileName);\n  unsigned int readLen;\n  unsigned int len = info.size();\n  QFile file(aFileName);\n\n  \/\/assert(aFileName!=0);\n  if( aFileName.isEmpty() )\n    return \"\";\n\n  if (!info.exists())\n  {\n    if (aVerbose)\n      msgDialog(i18n(\"The specified file does not exist:\\n%1\").arg(aFileName));\n    return QCString();\n  }\n  if (info.isDir())\n  {\n    if (aVerbose)\n      msgDialog(i18n(\"This is a folder and not a file:\\n%1\").arg(aFileName));\n    return QCString();\n  }\n  if (!info.isReadable())\n  {\n    if (aVerbose)\n      msgDialog(i18n(\"You do not have read permissions \"\n\t\t\t\t   \"to the file:\\n%1\").arg(aFileName));\n    return QCString();\n  }\n  if (len <= 0) return QCString();\n\n  if (!file.open(IO_Raw|IO_ReadOnly))\n  {\n    if (aVerbose) switch(file.status())\n    {\n    case IO_ReadError:\n      msgDialog(i18n(\"Could not read file:\\n%1\").arg(aFileName));\n      break;\n    case IO_OpenError:\n      msgDialog(i18n(\"Could not open file:\\n%1\").arg(aFileName));\n      break;\n    default:\n      msgDialog(i18n(\"Error while reading file:\\n%1\").arg(aFileName));\n    }\n    return QCString();\n  }\n\n  result.resize(len + (int)aEnsureNL + 1);\n  readLen = file.readBlock(result.data(), len);\n  if (aEnsureNL && result[len-1]!='\\n')\n  {\n    result[len++] = '\\n';\n    readLen++;\n  }\n  result[len] = '\\0';\n\n  if (readLen < len)\n  {\n    QString msg = i18n(\"Could only read %1 bytes of %2.\")\n\t\t.arg(readLen).arg(len);\n    msgDialog(msg);\n    return QCString();\n  }\n\n  return result;\n}\n\n\/\/-----------------------------------------------------------------------------\n#if 0 \/\/ unused\nQByteArray kFileToBytes(const QString &aFileName, bool aVerbose)\n{\n  QByteArray result;\n  QFileInfo info(aFileName);\n  unsigned int readLen;\n  unsigned int len = info.size();\n  QFile file(aFileName);\n\n  \/\/assert(aFileName!=0);\n  if( aFileName.isEmpty() )\n    return result;\n\n  if (!info.exists())\n  {\n    if (aVerbose)\n      msgDialog(i18n(\"The specified file does not exist:\\n%1\")\n\t\t.arg(aFileName));\n    return result;\n  }\n  if (info.isDir())\n  {\n    if (aVerbose)\n      msgDialog(i18n(\"This is a folder and not a file:\\n%1\")\n\t\t.arg(aFileName));\n    return result;\n  }\n  if (!info.isReadable())\n  {\n    if (aVerbose)\n      msgDialog(i18n(\"You do not have read permissions \"\n\t\t\t\t   \"to the file:\\n%1\").arg(aFileName));\n    return result;\n  }\n  if (len <= 0) return result;\n\n  if (!file.open(IO_Raw|IO_ReadOnly))\n  {\n    if (aVerbose) switch(file.status())\n    {\n    case IO_ReadError:\n      msgDialog(i18n(\"Could not read file:\\n%1\").arg(aFileName));\n      break;\n    case IO_OpenError:\n      msgDialog(i18n(\"Could not open file:\\n%1\").arg(aFileName));\n      break;\n    default:\n      msgDialog(i18n(\"Error while reading file:\\n%1\").arg(aFileName));\n    }\n    return result;\n  }\n\n  result.resize(len);\n  readLen = file.readBlock(result.data(), len);\n  kdDebug(5300) << QString( \"len %1\" ).arg(len) << endl;\n\n  if (readLen < len)\n  {\n    QString msg;\n    msg = i18n(\"Could only read %1 bytes of %2.\")\n\t\t.arg(readLen).arg(len);\n    msgDialog(msg);\n    return result;\n  }\n\n  return result;\n}\n#endif\n\n\/\/-----------------------------------------------------------------------------\nbool kBytesToFile(const char* aBuffer, int len,\n\t\t   const QString &aFileName,\n\t\t   bool aAskIfExists, bool aBackup, bool aVerbose)\n{\n  \/\/ TODO: use KSaveFile\n  QFile file(aFileName);\n  int writeLen, rc;\n\n  \/\/assert(aFileName!=0);\n  if(aFileName.isEmpty())\n    return FALSE;\n\n  if (file.exists())\n  {\n    if (aAskIfExists)\n    {\n      QString str;\n      str = i18n(\"File %1 exists.\\nDo you want to replace it?\")\n\t\t  .arg(aFileName);\n      rc = KMessageBox::warningContinueCancel(0,\n\t   str, i18n(\"Save to File\"), i18n(\"&Replace\"));\n      if (rc != KMessageBox::Continue) return FALSE;\n    }\n    if (aBackup)\n    {\n      \/\/ make a backup copy\n      \/\/ TODO: use KSaveFile::backupFile()\n      QString bakName = aFileName;\n      bakName += '~';\n      QFile::remove(bakName);\n      if( !QDir::current().rename(aFileName, bakName) )\n      {\n\t\/\/ failed to rename file\n\tif (!aVerbose) return FALSE;\n\trc = KMessageBox::warningContinueCancel(0,\n\t     i18n(\"Failed to make a backup copy of %1.\\nContinue anyway?\")\n\t     .arg(aFileName),\n             i18n(\"Save to File\"), KStdGuiItem::save() );\n\tif (rc != KMessageBox::Continue) return FALSE;\n      }\n    }\n  }\n\n  if (!file.open(IO_Raw|IO_WriteOnly|IO_Truncate))\n  {\n    if (aVerbose) switch(file.status())\n    {\n    case IO_WriteError:\n      msgDialog(i18n(\"Could not write to file:\\n%1\").arg(aFileName));\n      break;\n    case IO_OpenError:\n      msgDialog(i18n(\"Could not open file for writing:\\n%1\")\n\t\t.arg(aFileName));\n      break;\n    default:\n      msgDialog(i18n(\"Error while writing file:\\n%1\").arg(aFileName));\n    }\n    return FALSE;\n  }\n\n  writeLen = file.writeBlock(aBuffer, len);\n\n  if (writeLen < 0)\n  {\n    if (aVerbose)\n      msgDialog(i18n(\"Could not write to file:\\n%1\").arg(aFileName));\n    return FALSE;\n  }\n  else if (writeLen < len)\n  {\n    QString msg = i18n(\"Could only write %1 bytes of %2.\")\n\t\t.arg(writeLen).arg(len);\n    if (aVerbose)\n      msgDialog(msg);\n    return FALSE;\n  }\n\n  return TRUE;\n}\n\nbool kCStringToFile(const QCString& aBuffer, const QString &aFileName,\n\t\t   bool aAskIfExists, bool aBackup, bool aVerbose)\n{\n    return kBytesToFile(aBuffer, aBuffer.length(), aFileName, aAskIfExists,\n\taBackup, aVerbose);\n}\n\nbool kByteArrayToFile(const QByteArray& aBuffer, const QString &aFileName,\n\t\t   bool aAskIfExists, bool aBackup, bool aVerbose)\n{\n    return kBytesToFile(aBuffer, aBuffer.size(), aFileName, aAskIfExists,\n\taBackup, aVerbose);\n}\n\n\nQString checkAndCorrectPermissionsIfPossible(const QString &toCheck,\n  const bool &recursive, const bool &wantItReadable,\n  const bool &wantItWritable)\n{\n  \/\/ First we have to find out which type the toCheck is. This can be\n  \/\/ a directory (follow if recursive) or a file (check permissions).\n  \/\/ Symlinks are followed as expected.\n  QFileInfo fiToCheck(toCheck);\n  fiToCheck.setCaching(false);\n  QCString toCheckEnc = QFile::encodeName(toCheck);\n  QString error;\n\n  if ( !fiToCheck.exists() ) {\n    error.append( i18n(\"%1 does not exist\")\n                  .arg(toCheck) + \"\\n\");\n  }\n    \n  \/\/ For each file or folder  we can check if the file is readable \n  \/\/ and writable, as requested.\n  if ( fiToCheck.isFile() || fiToCheck.isDir() ){\n    struct stat statbuffer;\n\n    if ( !fiToCheck.isReadable() && wantItReadable ){\n      \/\/ Get the current permissions. No need to do anything with an \n      \/\/ error, it will het added to errors anyhow, later on.\n      if (stat(toCheckEnc,&statbuffer) != 0) {\n        kdDebug() << \"wantItR: Can't read perms of \" << toCheck << endl;\n      }\n\n      \/\/ Lets try changing it.\n      if ( chmod( toCheckEnc, statbuffer.st_mode + S_IRUSR ) != 0 ){\n        error.append( i18n(\"%1 is not readable and that is unchangeable.\")\n                           .arg(toCheck) + \"\\n\");\n      } else {\n        kdDebug() << \"Changed the read bit for \" << toCheck << endl;\n      }\n    }\n\n    if ( !fiToCheck.isWritable() && wantItWritable ){\n      \/\/ Gets the current persmissions. Needed because it can be changed\n      \/\/ curing previous operation.\n      if (stat(toCheckEnc,&statbuffer) != 0) {\n        kdDebug() << \"wantItW: Can't read perms of \" << toCheck << endl;\n      }\n\n      \/\/ Lets try changing it.\n      if ( chmod (toCheckEnc, statbuffer.st_mode + S_IWUSR ) != 0 ) {\n        error.append( i18n(\"%1 is not writable and that is unchangeable.\")\n                           .arg(toCheck) + \"\\n\");\n      } else {\n        kdDebug() << \"Changed the write bit for \" << toCheck << endl;\n      }\n    }\n  }\n\n  \/\/ If it is a folder and recursive is true, then we check the contents of \n  \/\/ the folder.\n  if ( fiToCheck.isDir() && recursive ){\n    QDir g(toCheck);\n    \/\/ First check if the folder is readable for us. If not, we get\n    \/\/ some ugly crashes.\n    if ( !g.isReadable() ){\n      error.append(i18n(\"Folder %1 is inaccessible.\").arg(toCheck) + \"\\n\");\n    } else {\n      const QFileInfoList *list = g.entryInfoList();\n      QFileInfoListIterator it( *list );\n      QFileInfo *fi;\n      while ((fi = it.current()) != 0) {\n        QString newToCheck = toCheck + \"\/\" + fi->fileName();\n        QFileInfo fiNewToCheck(newToCheck);\n        if ( fi->fileName() != \".\" && fi->fileName() != \"..\" ) {\n          error.append ( checkAndCorrectPermissionsIfPossible( newToCheck, \n                                recursive, wantItReadable, wantItWritable) );\n        }\n        ++it;\n      }\n    }\n  }\n  return error;\n}\n\nbool checkAndCorrectPermissionsIfPossibleWithErrorHandling( QWidget *parent,\n  const QString &toCheck, const bool &recursive, const bool &wantItReadable,\n  const bool &wantItWritable)\n{\n  QString error = checkAndCorrectPermissionsIfPossible(toCheck, recursive, \n                                           wantItReadable, wantItWritable);\n  \/\/ There is no KMessageBox with Retry, Cancel and Details. \n  \/\/ so, I can't provide a functionality to recheck. So it now \n  \/\/ it is just a warning.\n  if ( !error.isEmpty() ) {\n    kdDebug() << \"checkPermissions found:\" << error << endl;\n    KMessageBox::detailedSorry(parent, \n                               i18n(\"Some files or folders do not have \"\n                               \"the right permissions, please correct them \"\n                               \"manually.\"),\n                               error, i18n(\"Permissions Check\"), false);\n    return false;\n  } else {\n    return true;\n  }\n}\n\n}\n<commit_msg>If someone owns the file, it is possible to change the access bit if it is missing.<commit_after>\/\/ kfileio.cpp\n\/\/ Author: Stefan Taferner <taferner@kde.org>\n\/\/ License: GPL\n\n#ifdef HAVE_CONFIG_H\n#include <config.h>\n#endif\n\n#include <kmessagebox.h>\n#include <kdebug.h>\n\n#include <assert.h>\n#include <qdir.h>\n\n#include <klocale.h>\n#include <kstdguiitem.h>\n\n#include <qwidget.h>\n#include <qfile.h>\n#include <qfileinfo.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n\nnamespace KPIM {\n\n\/\/-----------------------------------------------------------------------------\nstatic void msgDialog(const QString &msg)\n{\n  KMessageBox::sorry(0, msg, i18n(\"File I\/O Error\"));\n}\n\n\n\/\/-----------------------------------------------------------------------------\nQCString kFileToString(const QString &aFileName, bool aEnsureNL, bool aVerbose)\n{\n  QCString result;\n  QFileInfo info(aFileName);\n  unsigned int readLen;\n  unsigned int len = info.size();\n  QFile file(aFileName);\n\n  \/\/assert(aFileName!=0);\n  if( aFileName.isEmpty() )\n    return \"\";\n\n  if (!info.exists())\n  {\n    if (aVerbose)\n      msgDialog(i18n(\"The specified file does not exist:\\n%1\").arg(aFileName));\n    return QCString();\n  }\n  if (info.isDir())\n  {\n    if (aVerbose)\n      msgDialog(i18n(\"This is a folder and not a file:\\n%1\").arg(aFileName));\n    return QCString();\n  }\n  if (!info.isReadable())\n  {\n    if (aVerbose)\n      msgDialog(i18n(\"You do not have read permissions \"\n\t\t\t\t   \"to the file:\\n%1\").arg(aFileName));\n    return QCString();\n  }\n  if (len <= 0) return QCString();\n\n  if (!file.open(IO_Raw|IO_ReadOnly))\n  {\n    if (aVerbose) switch(file.status())\n    {\n    case IO_ReadError:\n      msgDialog(i18n(\"Could not read file:\\n%1\").arg(aFileName));\n      break;\n    case IO_OpenError:\n      msgDialog(i18n(\"Could not open file:\\n%1\").arg(aFileName));\n      break;\n    default:\n      msgDialog(i18n(\"Error while reading file:\\n%1\").arg(aFileName));\n    }\n    return QCString();\n  }\n\n  result.resize(len + (int)aEnsureNL + 1);\n  readLen = file.readBlock(result.data(), len);\n  if (aEnsureNL && result[len-1]!='\\n')\n  {\n    result[len++] = '\\n';\n    readLen++;\n  }\n  result[len] = '\\0';\n\n  if (readLen < len)\n  {\n    QString msg = i18n(\"Could only read %1 bytes of %2.\")\n\t\t.arg(readLen).arg(len);\n    msgDialog(msg);\n    return QCString();\n  }\n\n  return result;\n}\n\n\/\/-----------------------------------------------------------------------------\n#if 0 \/\/ unused\nQByteArray kFileToBytes(const QString &aFileName, bool aVerbose)\n{\n  QByteArray result;\n  QFileInfo info(aFileName);\n  unsigned int readLen;\n  unsigned int len = info.size();\n  QFile file(aFileName);\n\n  \/\/assert(aFileName!=0);\n  if( aFileName.isEmpty() )\n    return result;\n\n  if (!info.exists())\n  {\n    if (aVerbose)\n      msgDialog(i18n(\"The specified file does not exist:\\n%1\")\n\t\t.arg(aFileName));\n    return result;\n  }\n  if (info.isDir())\n  {\n    if (aVerbose)\n      msgDialog(i18n(\"This is a folder and not a file:\\n%1\")\n\t\t.arg(aFileName));\n    return result;\n  }\n  if (!info.isReadable())\n  {\n    if (aVerbose)\n      msgDialog(i18n(\"You do not have read permissions \"\n\t\t\t\t   \"to the file:\\n%1\").arg(aFileName));\n    return result;\n  }\n  if (len <= 0) return result;\n\n  if (!file.open(IO_Raw|IO_ReadOnly))\n  {\n    if (aVerbose) switch(file.status())\n    {\n    case IO_ReadError:\n      msgDialog(i18n(\"Could not read file:\\n%1\").arg(aFileName));\n      break;\n    case IO_OpenError:\n      msgDialog(i18n(\"Could not open file:\\n%1\").arg(aFileName));\n      break;\n    default:\n      msgDialog(i18n(\"Error while reading file:\\n%1\").arg(aFileName));\n    }\n    return result;\n  }\n\n  result.resize(len);\n  readLen = file.readBlock(result.data(), len);\n  kdDebug(5300) << QString( \"len %1\" ).arg(len) << endl;\n\n  if (readLen < len)\n  {\n    QString msg;\n    msg = i18n(\"Could only read %1 bytes of %2.\")\n\t\t.arg(readLen).arg(len);\n    msgDialog(msg);\n    return result;\n  }\n\n  return result;\n}\n#endif\n\n\/\/-----------------------------------------------------------------------------\nbool kBytesToFile(const char* aBuffer, int len,\n\t\t   const QString &aFileName,\n\t\t   bool aAskIfExists, bool aBackup, bool aVerbose)\n{\n  \/\/ TODO: use KSaveFile\n  QFile file(aFileName);\n  int writeLen, rc;\n\n  \/\/assert(aFileName!=0);\n  if(aFileName.isEmpty())\n    return FALSE;\n\n  if (file.exists())\n  {\n    if (aAskIfExists)\n    {\n      QString str;\n      str = i18n(\"File %1 exists.\\nDo you want to replace it?\")\n\t\t  .arg(aFileName);\n      rc = KMessageBox::warningContinueCancel(0,\n\t   str, i18n(\"Save to File\"), i18n(\"&Replace\"));\n      if (rc != KMessageBox::Continue) return FALSE;\n    }\n    if (aBackup)\n    {\n      \/\/ make a backup copy\n      \/\/ TODO: use KSaveFile::backupFile()\n      QString bakName = aFileName;\n      bakName += '~';\n      QFile::remove(bakName);\n      if( !QDir::current().rename(aFileName, bakName) )\n      {\n\t\/\/ failed to rename file\n\tif (!aVerbose) return FALSE;\n\trc = KMessageBox::warningContinueCancel(0,\n\t     i18n(\"Failed to make a backup copy of %1.\\nContinue anyway?\")\n\t     .arg(aFileName),\n             i18n(\"Save to File\"), KStdGuiItem::save() );\n\tif (rc != KMessageBox::Continue) return FALSE;\n      }\n    }\n  }\n\n  if (!file.open(IO_Raw|IO_WriteOnly|IO_Truncate))\n  {\n    if (aVerbose) switch(file.status())\n    {\n    case IO_WriteError:\n      msgDialog(i18n(\"Could not write to file:\\n%1\").arg(aFileName));\n      break;\n    case IO_OpenError:\n      msgDialog(i18n(\"Could not open file for writing:\\n%1\")\n\t\t.arg(aFileName));\n      break;\n    default:\n      msgDialog(i18n(\"Error while writing file:\\n%1\").arg(aFileName));\n    }\n    return FALSE;\n  }\n\n  writeLen = file.writeBlock(aBuffer, len);\n\n  if (writeLen < 0)\n  {\n    if (aVerbose)\n      msgDialog(i18n(\"Could not write to file:\\n%1\").arg(aFileName));\n    return FALSE;\n  }\n  else if (writeLen < len)\n  {\n    QString msg = i18n(\"Could only write %1 bytes of %2.\")\n\t\t.arg(writeLen).arg(len);\n    if (aVerbose)\n      msgDialog(msg);\n    return FALSE;\n  }\n\n  return TRUE;\n}\n\nbool kCStringToFile(const QCString& aBuffer, const QString &aFileName,\n\t\t   bool aAskIfExists, bool aBackup, bool aVerbose)\n{\n    return kBytesToFile(aBuffer, aBuffer.length(), aFileName, aAskIfExists,\n\taBackup, aVerbose);\n}\n\nbool kByteArrayToFile(const QByteArray& aBuffer, const QString &aFileName,\n\t\t   bool aAskIfExists, bool aBackup, bool aVerbose)\n{\n    return kBytesToFile(aBuffer, aBuffer.size(), aFileName, aAskIfExists,\n\taBackup, aVerbose);\n}\n\n\nQString checkAndCorrectPermissionsIfPossible(const QString &toCheck,\n  const bool &recursive, const bool &wantItReadable,\n  const bool &wantItWritable)\n{\n  \/\/ First we have to find out which type the toCheck is. This can be\n  \/\/ a directory (follow if recursive) or a file (check permissions).\n  \/\/ Symlinks are followed as expected.\n  QFileInfo fiToCheck(toCheck);\n  fiToCheck.setCaching(false);\n  QCString toCheckEnc = QFile::encodeName(toCheck);\n  QString error;\n  struct stat statbuffer;\n\n  if ( !fiToCheck.exists() ) {\n    error.append( i18n(\"%1 does not exist\")\n                  .arg(toCheck) + \"\\n\");\n  }\n\n  \/\/ check the access bit of a folder.\n  if ( fiToCheck.isDir() ) {\n    if ( stat( toCheckEnc,&statbuffer ) != 0 ) {\n      kdDebug() << \"wantItA: Can't read perms of \" << toCheck << endl;\n    }\n    QDir g( toCheck );\n    if ( !g.isReadable() ) {\n      if ( chmod( toCheckEnc, statbuffer.st_mode + S_IXUSR ) != 0 ) {\n        error.append( i18n(\"%1 is not accessible and that is \"\n                           \"unchangeable.\").arg(toCheck) + \"\\n\");\n      } else {\n        kdDebug() << \"Changed access bit for \" << toCheck << endl;\n      }\n    }\n  }\n\n  \/\/ For each file or folder  we can check if the file is readable \n  \/\/ and writable, as requested.\n  if ( fiToCheck.isFile() || fiToCheck.isDir() ) {\n\n    if ( !fiToCheck.isReadable() && wantItReadable ) {\n      \/\/ Get the current permissions. No need to do anything with an \n      \/\/ error, it will het added to errors anyhow, later on.\n      if ( stat(toCheckEnc,&statbuffer) != 0 ) {\n        kdDebug() << \"wantItR: Can't read perms of \" << toCheck << endl;\n      }\n\n      \/\/ Lets try changing it.\n      if ( chmod( toCheckEnc, statbuffer.st_mode + S_IRUSR ) != 0 ) {\n        error.append( i18n(\"%1 is not readable and that is unchangeable.\")\n                           .arg(toCheck) + \"\\n\");\n      } else {\n        kdDebug() << \"Changed the read bit for \" << toCheck << endl;\n      }\n    }\n\n    if ( !fiToCheck.isWritable() && wantItWritable ) {\n      \/\/ Gets the current persmissions. Needed because it can be changed\n      \/\/ curing previous operation.\n      if (stat(toCheckEnc,&statbuffer) != 0) {\n        kdDebug() << \"wantItW: Can't read perms of \" << toCheck << endl;\n      }\n\n      \/\/ Lets try changing it.\n      if ( chmod (toCheckEnc, statbuffer.st_mode + S_IWUSR ) != 0 ) {\n        error.append( i18n(\"%1 is not writable and that is unchangeable.\")\n                           .arg(toCheck) + \"\\n\");\n      } else {\n        kdDebug() << \"Changed the write bit for \" << toCheck << endl;\n      }\n    }\n  }\n\n  \/\/ If it is a folder and recursive is true, then we check the contents of \n  \/\/ the folder.\n  if ( fiToCheck.isDir() && recursive ){\n    QDir g(toCheck);\n    \/\/ First check if the folder is readable for us. If not, we get\n    \/\/ some ugly crashes.\n    if ( !g.isReadable() ){\n      error.append(i18n(\"Folder %1 is inaccessible.\").arg(toCheck) + \"\\n\");\n    } else {\n      const QFileInfoList *list = g.entryInfoList();\n      QFileInfoListIterator it( *list );\n      QFileInfo *fi;\n      while ((fi = it.current()) != 0) {\n        QString newToCheck = toCheck + \"\/\" + fi->fileName();\n        QFileInfo fiNewToCheck(newToCheck);\n        if ( fi->fileName() != \".\" && fi->fileName() != \"..\" ) {\n          error.append ( checkAndCorrectPermissionsIfPossible( newToCheck, \n                                recursive, wantItReadable, wantItWritable) );\n        }\n        ++it;\n      }\n    }\n  }\n  return error;\n}\n\nbool checkAndCorrectPermissionsIfPossibleWithErrorHandling( QWidget *parent,\n  const QString &toCheck, const bool &recursive, const bool &wantItReadable,\n  const bool &wantItWritable)\n{\n  QString error = checkAndCorrectPermissionsIfPossible(toCheck, recursive, \n                                           wantItReadable, wantItWritable);\n  \/\/ There is no KMessageBox with Retry, Cancel and Details. \n  \/\/ so, I can't provide a functionality to recheck. So it now \n  \/\/ it is just a warning.\n  if ( !error.isEmpty() ) {\n    kdDebug() << \"checkPermissions found:\" << error << endl;\n    KMessageBox::detailedSorry(parent, \n                               i18n(\"Some files or folders do not have \"\n                               \"the right permissions, please correct them \"\n                               \"manually.\"),\n                               error, i18n(\"Permissions Check\"), false);\n    return false;\n  } else {\n    return true;\n  }\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\r\n\/*!\r\n\t\\file\r\n\t\\brief Excel parser.\r\n\r\n\t\\author Gennadii Marianychenko (argent dot genesis at gmail dot com).\r\n\r\n\tCopyright (c) 2021 Gennadii Marianychenko\r\n\r\n\tPermission is hereby granted, free of charge, to any person\r\n\tobtaining a copy of this software and associated documentation\r\n\tfiles (the \"Software\"), to deal in the Software without\r\n\trestriction, including without limitation the rights to use,\r\n\tcopy, modify, merge, publish, distribute, sublicense, and\/or sell\r\n\tcopies of the Software, and to permit persons to whom the\r\n\tSoftware is furnished to do so, subject to the following\r\n\tconditions:\r\n\r\n\tThe above copyright notice and this permission notice shall be\r\n\tincluded in all copies or substantial portions of the Software.\r\n\r\n\tTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\r\n\tEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\r\n\tOF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\r\n\tNONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\r\n\tHOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\r\n\tWHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\r\n\tFROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\r\n\tOTHER DEALINGS IN THE SOFTWARE.\r\n*\/\r\n\r\n#pragma once\r\n\r\n\/\/ C++ include.\r\n#include <string>\r\n\r\n\/\/ Excel include.\r\n#include \"storage.hpp\"\r\n#include \"sheet.hpp\"\r\n\r\n#include \"compoundfile\/compoundfile.hpp\"\r\n#include \"compoundfile\/compoundfile_exceptions.hpp\"\r\n\r\nnamespace Excel {\r\n\r\n\/\/\r\n\/\/ Parser\r\n\/\/\r\n\r\n\/\/! Parser of XLS file.\r\nclass Parser final {\r\npublic:\r\n\t\/\/! Load WorkBook from stream.\r\n\tstatic void loadBook( std::istream & fileStream, IStorage & storage,\r\n\t\tconst std::string & fileName = \"<custom-stream>\" );\r\n\r\n\t\/\/! Store document date mode.\r\n\tstatic void handleDateMode( Record & r, IStorage & storage );\r\n\r\n\t\/\/! Load sheets from file.\r\n\tstatic void loadGlobals( std::vector< BoundSheet > & boundSheets, \r\n\t\tStream & stream, IStorage & storage );\r\n\r\n\t\/\/! Load boundsheet.\r\n\tstatic BoundSheet parseBoundSheet( Record & record );\r\n\r\n\t\/\/! Load WorkSheets.\r\n\tstatic void loadWorkSheets( const std::vector< BoundSheet > & boundSheets,\r\n\t\tStream & stream, IStorage& storage );\r\n\r\n\t\/\/! Parse shared string table.\r\n\tstatic void parseSST( Record & record, IStorage & storage );\r\n\r\n\t\/\/! Load WorkSheet.\r\n\tstatic void loadSheet( size_t sheetIdx, const BoundSheet & boundSheet,\r\n\t\tStream & stream, IStorage & storage );\r\n\r\n\t\/\/! Handle label SST.\r\n\tstatic void handleLabelSST( Record & record, size_t sheetIdx, IStorage & storage );\r\n\r\n\t\/\/! Handle label.\r\n\tstatic void handleLabel( Record & record, size_t sheetIdx, IStorage & storage );\r\n\r\n\t\/\/! Handle RK.\r\n\tstatic void handleRK( Record & record, size_t sheetIdx, IStorage & storage );\r\n\r\n\t\/\/! Handle MULRK.\r\n\tstatic void handleMULRK( Record & record, size_t sheetIdx, IStorage & storage );\r\n\r\n\t\/\/! Handle NUMBER.\r\n\tstatic void handleNUMBER( Record & record, size_t sheetIdx, IStorage & storage );\r\n\r\n\t\/\/! Handle FORMULA.\r\n\tstatic void handleFORMULA( Record & record, Stream & stream, size_t sheetIdx,\r\n\t\tIStorage & storage );\r\n}; \/\/ class Parser\r\n\r\ninline void\r\nParser::loadBook( std::istream & fileStream, IStorage & storage,\r\n\tconst std::string & fileName )\r\n{\r\n\tstatic_assert( sizeof( double ) == 8,\r\n\t\t\"Unsupported platform: double has to be 8 bytes.\" );\r\n\r\n\ttry {\r\n\t\tCompoundFile::File file( fileStream, fileName );\r\n\t\tauto stream = file.stream( \r\n\t\t\tfile.hasDirectory( L\"Workbook\" ) ? file.directory( L\"Workbook\" ) \r\n\t\t\t                                 : file.directory( L\"Book\") );\r\n\r\n\t\tstd::vector< BoundSheet > boundSheets;\r\n\r\n\t\tParser::loadGlobals( boundSheets, *stream, storage );\r\n\r\n\t\tloadWorkSheets( boundSheets, *stream, storage );\r\n\t}\r\n\tcatch( const CompoundFile::Exception & x )\r\n\t{\r\n\t\tthrow Exception( x.whatAsWString() );\r\n\t}\r\n}\r\n\r\ninline void\r\nParser::handleDateMode( Record & r, IStorage & storage )\r\n{\r\n\tuint16_t mode = 0;\r\n\r\n\tr.dataStream().read( mode, 2 );\r\n\r\n\tstorage.onDateMode( mode );\r\n}\r\n\r\ninline void\r\nParser::loadGlobals( std::vector< BoundSheet > & boundSheets, \r\n\tStream & stream, IStorage & storage )\r\n{\r\n\twhile( true )\r\n\t{\r\n\t\tRecord r( stream );\r\n\r\n\t\tswitch( r.code() )\r\n\t\t{\r\n\t\t\tcase XL_SST :\r\n\t\t\t\tparseSST( r, storage );\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase XL_BOUNDSHEET :\r\n\t\t\t\tboundSheets.push_back( parseBoundSheet( r ) );\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase XL_DATEMODE :\r\n\t\t\t\thandleDateMode( r, storage );\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase XL_EOF :\r\n\t\t\t\treturn;\r\n\r\n\t\t\tdefault:\r\n\t\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n}\r\n\r\ninline BoundSheet\r\nParser::parseBoundSheet( Record & record )\r\n{\r\n\tint32_t pos = 0;\r\n\tint16_t sheetType = 0;\r\n\tstd::wstring sheetName;\r\n\r\n\trecord.dataStream().read( pos, 4 );\r\n\r\n\trecord.dataStream().read( sheetType, 2 );\r\n\r\n\tsheetName = loadString( record.dataStream(), record.borders(), 1 );\r\n\r\n\treturn BoundSheet( pos,\r\n\t\tBoundSheet::convertSheetType( sheetType ),\r\n\t\tsheetName );\r\n}\r\n\r\ninline void\r\nParser::loadWorkSheets( const std::vector< BoundSheet > & boundSheets,\r\n\tStream & stream, IStorage& storage )\r\n{\r\n\tfor( size_t i = 0; i < boundSheets.size(); ++i )\r\n\t{\r\n\t\tif( boundSheets[i].sheetType() == BoundSheet::WorkSheet )\r\n\t\t{\r\n\t\t\tstorage.onSheet( i, boundSheets[i].sheetName() );\r\n\t\t\tloadSheet( i, boundSheets[i], stream, storage );\r\n\t\t}\r\n\t}\r\n}\r\n\r\ninline void\r\nParser::parseSST( Record & record, IStorage & storage )\r\n{\r\n\tint32_t totalStrings = 0;\r\n\tint32_t uniqueStrings = 0;\r\n\r\n\trecord.dataStream().read( totalStrings, 4 );\r\n\trecord.dataStream().read( uniqueStrings, 4 );\r\n\r\n\tstd::vector< std::wstring > sst( uniqueStrings );\r\n\r\n\tfor( int32_t i = 0; i < uniqueStrings; ++i )\r\n\t\tstorage.onSharedString( uniqueStrings, i,\r\n\t\t\tloadString( record.dataStream(), record.borders() ) );\r\n}\r\n\r\ninline void\r\nParser::loadSheet( size_t sheetIdx, const BoundSheet & boundSheet,\r\n\tStream & stream, IStorage & storage )\r\n{\r\n\tstream.seek( boundSheet.BOFPosition(), Stream::FromBeginning );\r\n\tBOF bof;\r\n\r\n\t{\r\n\t\tRecord record( stream );\r\n\r\n\t\tbof.parse( record );\r\n\t}\r\n\r\n\tif( bof.version() != BOF::BIFF8 )\r\n\t\tthrow Exception( L\"Unsupported BIFF version. BIFF8 is supported only.\" );\r\n\r\n\twhile( true )\r\n\t{\r\n\t\tRecord record( stream );\r\n\r\n\t\tswitch( record.code() )\r\n\t\t{\r\n\t\t\tcase XL_LABELSST:\r\n\t\t\t\thandleLabelSST( record, sheetIdx, storage );\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase XL_LABEL:\r\n\t\t\t\thandleLabel( record, sheetIdx, storage );\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase XL_RK:\r\n\t\t\tcase XL_RK2:\r\n\t\t\t\thandleRK( record, sheetIdx, storage );\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase XL_MULRK:\r\n\t\t\t\thandleMULRK( record, sheetIdx, storage );\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase XL_NUMBER:\r\n\t\t\t\thandleNUMBER( record, sheetIdx, storage );\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase XL_FORMULA:\r\n\t\t\t\thandleFORMULA( record, stream, sheetIdx, storage );\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase XL_EOF:\r\n\t\t\t\treturn;\r\n\r\n\t\t\tdefault:\r\n\t\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n}\r\n\r\ninline void\r\nParser::handleLabelSST( Record & record, size_t sheetIdx, IStorage & storage )\r\n{\r\n\tint16_t row = 0;\r\n\tint16_t column = 0;\r\n\tint16_t xfIndex = 0;\r\n\tint32_t sstIndex = 0;\r\n\r\n\trecord.dataStream().read( row, 2 );\r\n\trecord.dataStream().read( column, 2 );\r\n\trecord.dataStream().read( xfIndex, 2 );\r\n\trecord.dataStream().read( sstIndex, 4 );\r\n\r\n\tstorage.onCellSharedString( sheetIdx, row, column, sstIndex );\r\n}\r\n\r\ninline void\r\nParser::handleLabel( Record & record, size_t sheetIdx, IStorage & storage )\r\n{\r\n\tint16_t row = 0;\r\n\tint16_t column = 0;\r\n\r\n\trecord.dataStream().read( row, 2 );\r\n\trecord.dataStream().read( column, 2 );\r\n\trecord.dataStream().seek( 2, Excel::Stream::FromCurrent );\r\n\tconst auto data = loadString( record.dataStream(), record.borders(), 1 );\r\n\r\n\tstorage.onCell( sheetIdx, row, column, data );\r\n}\r\n\r\n\/\/\r\n\/\/ doubleFromRK\r\n\/\/\r\n\r\ninline double\r\ndoubleFromRK( uint32_t rk )\r\n{\r\n\tdouble num = 0;\r\n\r\n\tif( rk & 0x02 )\r\n\t{\r\n\t\t\/\/ int32_t\r\n\t\tnum = (double) (rk >> 2);\r\n\t}\r\n\telse\r\n\t{\r\n\t\t\/\/ hi words of IEEE num\r\n\t\t*((uint32_t *)&num+1) = rk & 0xFFFFFFFC;\r\n\t\t*((uint32_t *)&num) = 0;\r\n\t}\r\n\r\n\tif( rk & 0x01 )\r\n\t\t\/\/ divide by 100\r\n\t\tnum \/= 100;\r\n\r\n\treturn num;\r\n} \/\/ doubleFromRK\r\n\r\ninline void\r\nParser::handleRK( Record & record, size_t sheetIdx, IStorage & storage )\r\n{\r\n\tint16_t row = 0;\r\n\tint16_t column = 0;\r\n\tuint32_t rk = 0;\r\n\r\n\trecord.dataStream().read( row, 2 );\r\n\trecord.dataStream().read( column, 2 );\r\n\r\n\trecord.dataStream().seek( 2, Stream::FromCurrent );\r\n\trecord.dataStream().read( rk, 4 );\r\n\r\n\tstorage.onCell( sheetIdx, row, column, doubleFromRK( rk ) );\r\n}\r\n\r\ninline void\r\nParser::handleMULRK( Record & record, size_t sheetIdx, IStorage & storage )\r\n{\r\n\tint16_t row = 0;\r\n\tint16_t colFirst = 0;\r\n\tint16_t colLast = 0;\r\n\r\n\trecord.dataStream().read( row, 2 );\r\n\trecord.dataStream().read( colFirst, 2 );\r\n\r\n\tint32_t pos = record.dataStream().pos();\r\n\r\n\trecord.dataStream().seek( -2, Stream::FromEnd );\r\n\r\n\trecord.dataStream().read( colLast, 2 );\r\n\r\n\trecord.dataStream().seek( pos, Stream::FromBeginning );\r\n\r\n\tconst int16_t rkCount = colLast - colFirst + 1;\r\n\r\n\tfor( int16_t i = 0; i < rkCount; ++i )\r\n\t{\r\n\t\tuint32_t rk = 0;\r\n\r\n\t\trecord.dataStream().seek( 2, Stream::FromCurrent );\r\n\r\n\t\trecord.dataStream().read( rk, 4 );\r\n\r\n\t\tstorage.onCell( sheetIdx, row, colFirst + i, doubleFromRK( rk ) );\r\n\t}\r\n}\r\n\r\ninline void\r\nParser::handleNUMBER( Record & record, size_t sheetIdx, IStorage & storage )\r\n{\r\n\tint16_t row = 0;\r\n\tint16_t column = 0;\r\n\r\n\trecord.dataStream().read( row, 2 );\r\n\trecord.dataStream().read( column, 2 );\r\n\r\n\trecord.dataStream().seek( 2, Stream::FromCurrent );\r\n\r\n\tunion {\r\n\t\tdouble m_asDouble;\r\n\t\tuint64_t m_asLongLong;\r\n\t} doubleAndLongLong;\r\n\r\n\trecord.dataStream().read( doubleAndLongLong.m_asLongLong, 8 );\r\n\r\n\tstorage.onCell( sheetIdx, row, column, doubleAndLongLong.m_asDouble );\r\n}\r\n\r\ninline void\r\nParser::handleFORMULA( Record & record, Stream & stream, size_t sheetIdx, IStorage & storage )\r\n{\r\n\tFormula formula( record );\r\n\r\n\tif( formula.valueType() == Formula::StringValue )\r\n\t{\r\n\t\tRecord stringRecord( stream );\r\n\r\n\t\tstd::vector< int32_t > borders;\r\n\r\n\t\tformula.setString( loadString( stringRecord.dataStream(), borders ) );\r\n\t}\r\n\r\n\tstorage.onCell( sheetIdx, formula );\r\n}\r\n\r\n} \/* namespace Excel *\/\r\n<commit_msg>Remove not necessary code.<commit_after>\r\n\/*!\r\n\t\\file\r\n\t\\brief Excel parser.\r\n\r\n\t\\author Gennadii Marianychenko (argent dot genesis at gmail dot com).\r\n\r\n\tCopyright (c) 2021 Gennadii Marianychenko\r\n\r\n\tPermission is hereby granted, free of charge, to any person\r\n\tobtaining a copy of this software and associated documentation\r\n\tfiles (the \"Software\"), to deal in the Software without\r\n\trestriction, including without limitation the rights to use,\r\n\tcopy, modify, merge, publish, distribute, sublicense, and\/or sell\r\n\tcopies of the Software, and to permit persons to whom the\r\n\tSoftware is furnished to do so, subject to the following\r\n\tconditions:\r\n\r\n\tThe above copyright notice and this permission notice shall be\r\n\tincluded in all copies or substantial portions of the Software.\r\n\r\n\tTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\r\n\tEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\r\n\tOF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\r\n\tNONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\r\n\tHOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\r\n\tWHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\r\n\tFROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\r\n\tOTHER DEALINGS IN THE SOFTWARE.\r\n*\/\r\n\r\n#pragma once\r\n\r\n\/\/ C++ include.\r\n#include <string>\r\n\r\n\/\/ Excel include.\r\n#include \"storage.hpp\"\r\n#include \"sheet.hpp\"\r\n\r\n#include \"compoundfile\/compoundfile.hpp\"\r\n#include \"compoundfile\/compoundfile_exceptions.hpp\"\r\n\r\nnamespace Excel {\r\n\r\n\/\/\r\n\/\/ Parser\r\n\/\/\r\n\r\n\/\/! Parser of XLS file.\r\nclass Parser final {\r\npublic:\r\n\t\/\/! Load WorkBook from stream.\r\n\tstatic void loadBook( std::istream & fileStream, IStorage & storage,\r\n\t\tconst std::string & fileName = \"<custom-stream>\" );\r\n\r\n\t\/\/! Store document date mode.\r\n\tstatic void handleDateMode( Record & r, IStorage & storage );\r\n\r\n\t\/\/! Load sheets from file.\r\n\tstatic void loadGlobals( std::vector< BoundSheet > & boundSheets, \r\n\t\tStream & stream, IStorage & storage );\r\n\r\n\t\/\/! Load boundsheet.\r\n\tstatic BoundSheet parseBoundSheet( Record & record );\r\n\r\n\t\/\/! Load WorkSheets.\r\n\tstatic void loadWorkSheets( const std::vector< BoundSheet > & boundSheets,\r\n\t\tStream & stream, IStorage& storage );\r\n\r\n\t\/\/! Parse shared string table.\r\n\tstatic void parseSST( Record & record, IStorage & storage );\r\n\r\n\t\/\/! Load WorkSheet.\r\n\tstatic void loadSheet( size_t sheetIdx, const BoundSheet & boundSheet,\r\n\t\tStream & stream, IStorage & storage );\r\n\r\n\t\/\/! Handle label SST.\r\n\tstatic void handleLabelSST( Record & record, size_t sheetIdx, IStorage & storage );\r\n\r\n\t\/\/! Handle label.\r\n\tstatic void handleLabel( Record & record, size_t sheetIdx, IStorage & storage );\r\n\r\n\t\/\/! Handle RK.\r\n\tstatic void handleRK( Record & record, size_t sheetIdx, IStorage & storage );\r\n\r\n\t\/\/! Handle MULRK.\r\n\tstatic void handleMULRK( Record & record, size_t sheetIdx, IStorage & storage );\r\n\r\n\t\/\/! Handle NUMBER.\r\n\tstatic void handleNUMBER( Record & record, size_t sheetIdx, IStorage & storage );\r\n\r\n\t\/\/! Handle FORMULA.\r\n\tstatic void handleFORMULA( Record & record, Stream & stream, size_t sheetIdx,\r\n\t\tIStorage & storage );\r\n}; \/\/ class Parser\r\n\r\ninline void\r\nParser::loadBook( std::istream & fileStream, IStorage & storage,\r\n\tconst std::string & fileName )\r\n{\r\n\tstatic_assert( sizeof( double ) == 8,\r\n\t\t\"Unsupported platform: double has to be 8 bytes.\" );\r\n\r\n\ttry {\r\n\t\tCompoundFile::File file( fileStream, fileName );\r\n\t\tauto stream = file.stream( \r\n\t\t\tfile.hasDirectory( L\"Workbook\" ) ? file.directory( L\"Workbook\" ) \r\n\t\t\t                                 : file.directory( L\"Book\") );\r\n\r\n\t\tstd::vector< BoundSheet > boundSheets;\r\n\r\n\t\tloadGlobals( boundSheets, *stream, storage );\r\n\r\n\t\tloadWorkSheets( boundSheets, *stream, storage );\r\n\t}\r\n\tcatch( const CompoundFile::Exception & x )\r\n\t{\r\n\t\tthrow Exception( x.whatAsWString() );\r\n\t}\r\n}\r\n\r\ninline void\r\nParser::handleDateMode( Record & r, IStorage & storage )\r\n{\r\n\tuint16_t mode = 0;\r\n\r\n\tr.dataStream().read( mode, 2 );\r\n\r\n\tstorage.onDateMode( mode );\r\n}\r\n\r\ninline void\r\nParser::loadGlobals( std::vector< BoundSheet > & boundSheets, \r\n\tStream & stream, IStorage & storage )\r\n{\r\n\twhile( true )\r\n\t{\r\n\t\tRecord r( stream );\r\n\r\n\t\tswitch( r.code() )\r\n\t\t{\r\n\t\t\tcase XL_SST :\r\n\t\t\t\tparseSST( r, storage );\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase XL_BOUNDSHEET :\r\n\t\t\t\tboundSheets.push_back( parseBoundSheet( r ) );\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase XL_DATEMODE :\r\n\t\t\t\thandleDateMode( r, storage );\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase XL_EOF :\r\n\t\t\t\treturn;\r\n\r\n\t\t\tdefault:\r\n\t\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n}\r\n\r\ninline BoundSheet\r\nParser::parseBoundSheet( Record & record )\r\n{\r\n\tint32_t pos = 0;\r\n\tint16_t sheetType = 0;\r\n\tstd::wstring sheetName;\r\n\r\n\trecord.dataStream().read( pos, 4 );\r\n\r\n\trecord.dataStream().read( sheetType, 2 );\r\n\r\n\tsheetName = loadString( record.dataStream(), record.borders(), 1 );\r\n\r\n\treturn BoundSheet( pos,\r\n\t\tBoundSheet::convertSheetType( sheetType ),\r\n\t\tsheetName );\r\n}\r\n\r\ninline void\r\nParser::loadWorkSheets( const std::vector< BoundSheet > & boundSheets,\r\n\tStream & stream, IStorage& storage )\r\n{\r\n\tfor( size_t i = 0; i < boundSheets.size(); ++i )\r\n\t{\r\n\t\tif( boundSheets[i].sheetType() == BoundSheet::WorkSheet )\r\n\t\t{\r\n\t\t\tstorage.onSheet( i, boundSheets[i].sheetName() );\r\n\t\t\tloadSheet( i, boundSheets[i], stream, storage );\r\n\t\t}\r\n\t}\r\n}\r\n\r\ninline void\r\nParser::parseSST( Record & record, IStorage & storage )\r\n{\r\n\tint32_t totalStrings = 0;\r\n\tint32_t uniqueStrings = 0;\r\n\r\n\trecord.dataStream().read( totalStrings, 4 );\r\n\trecord.dataStream().read( uniqueStrings, 4 );\r\n\r\n\tstd::vector< std::wstring > sst( uniqueStrings );\r\n\r\n\tfor( int32_t i = 0; i < uniqueStrings; ++i )\r\n\t\tstorage.onSharedString( uniqueStrings, i,\r\n\t\t\tloadString( record.dataStream(), record.borders() ) );\r\n}\r\n\r\ninline void\r\nParser::loadSheet( size_t sheetIdx, const BoundSheet & boundSheet,\r\n\tStream & stream, IStorage & storage )\r\n{\r\n\tstream.seek( boundSheet.BOFPosition(), Stream::FromBeginning );\r\n\tBOF bof;\r\n\r\n\t{\r\n\t\tRecord record( stream );\r\n\r\n\t\tbof.parse( record );\r\n\t}\r\n\r\n\tif( bof.version() != BOF::BIFF8 )\r\n\t\tthrow Exception( L\"Unsupported BIFF version. BIFF8 is supported only.\" );\r\n\r\n\twhile( true )\r\n\t{\r\n\t\tRecord record( stream );\r\n\r\n\t\tswitch( record.code() )\r\n\t\t{\r\n\t\t\tcase XL_LABELSST:\r\n\t\t\t\thandleLabelSST( record, sheetIdx, storage );\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase XL_LABEL:\r\n\t\t\t\thandleLabel( record, sheetIdx, storage );\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase XL_RK:\r\n\t\t\tcase XL_RK2:\r\n\t\t\t\thandleRK( record, sheetIdx, storage );\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase XL_MULRK:\r\n\t\t\t\thandleMULRK( record, sheetIdx, storage );\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase XL_NUMBER:\r\n\t\t\t\thandleNUMBER( record, sheetIdx, storage );\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase XL_FORMULA:\r\n\t\t\t\thandleFORMULA( record, stream, sheetIdx, storage );\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase XL_EOF:\r\n\t\t\t\treturn;\r\n\r\n\t\t\tdefault:\r\n\t\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n}\r\n\r\ninline void\r\nParser::handleLabelSST( Record & record, size_t sheetIdx, IStorage & storage )\r\n{\r\n\tint16_t row = 0;\r\n\tint16_t column = 0;\r\n\tint16_t xfIndex = 0;\r\n\tint32_t sstIndex = 0;\r\n\r\n\trecord.dataStream().read( row, 2 );\r\n\trecord.dataStream().read( column, 2 );\r\n\trecord.dataStream().read( xfIndex, 2 );\r\n\trecord.dataStream().read( sstIndex, 4 );\r\n\r\n\tstorage.onCellSharedString( sheetIdx, row, column, sstIndex );\r\n}\r\n\r\ninline void\r\nParser::handleLabel( Record & record, size_t sheetIdx, IStorage & storage )\r\n{\r\n\tint16_t row = 0;\r\n\tint16_t column = 0;\r\n\r\n\trecord.dataStream().read( row, 2 );\r\n\trecord.dataStream().read( column, 2 );\r\n\trecord.dataStream().seek( 2, Excel::Stream::FromCurrent );\r\n\tconst auto data = loadString( record.dataStream(), record.borders(), 1 );\r\n\r\n\tstorage.onCell( sheetIdx, row, column, data );\r\n}\r\n\r\n\/\/\r\n\/\/ doubleFromRK\r\n\/\/\r\n\r\ninline double\r\ndoubleFromRK( uint32_t rk )\r\n{\r\n\tdouble num = 0;\r\n\r\n\tif( rk & 0x02 )\r\n\t{\r\n\t\t\/\/ int32_t\r\n\t\tnum = (double) (rk >> 2);\r\n\t}\r\n\telse\r\n\t{\r\n\t\t\/\/ hi words of IEEE num\r\n\t\t*((uint32_t *)&num+1) = rk & 0xFFFFFFFC;\r\n\t\t*((uint32_t *)&num) = 0;\r\n\t}\r\n\r\n\tif( rk & 0x01 )\r\n\t\t\/\/ divide by 100\r\n\t\tnum \/= 100;\r\n\r\n\treturn num;\r\n} \/\/ doubleFromRK\r\n\r\ninline void\r\nParser::handleRK( Record & record, size_t sheetIdx, IStorage & storage )\r\n{\r\n\tint16_t row = 0;\r\n\tint16_t column = 0;\r\n\tuint32_t rk = 0;\r\n\r\n\trecord.dataStream().read( row, 2 );\r\n\trecord.dataStream().read( column, 2 );\r\n\r\n\trecord.dataStream().seek( 2, Stream::FromCurrent );\r\n\trecord.dataStream().read( rk, 4 );\r\n\r\n\tstorage.onCell( sheetIdx, row, column, doubleFromRK( rk ) );\r\n}\r\n\r\ninline void\r\nParser::handleMULRK( Record & record, size_t sheetIdx, IStorage & storage )\r\n{\r\n\tint16_t row = 0;\r\n\tint16_t colFirst = 0;\r\n\tint16_t colLast = 0;\r\n\r\n\trecord.dataStream().read( row, 2 );\r\n\trecord.dataStream().read( colFirst, 2 );\r\n\r\n\tint32_t pos = record.dataStream().pos();\r\n\r\n\trecord.dataStream().seek( -2, Stream::FromEnd );\r\n\r\n\trecord.dataStream().read( colLast, 2 );\r\n\r\n\trecord.dataStream().seek( pos, Stream::FromBeginning );\r\n\r\n\tconst int16_t rkCount = colLast - colFirst + 1;\r\n\r\n\tfor( int16_t i = 0; i < rkCount; ++i )\r\n\t{\r\n\t\tuint32_t rk = 0;\r\n\r\n\t\trecord.dataStream().seek( 2, Stream::FromCurrent );\r\n\r\n\t\trecord.dataStream().read( rk, 4 );\r\n\r\n\t\tstorage.onCell( sheetIdx, row, colFirst + i, doubleFromRK( rk ) );\r\n\t}\r\n}\r\n\r\ninline void\r\nParser::handleNUMBER( Record & record, size_t sheetIdx, IStorage & storage )\r\n{\r\n\tint16_t row = 0;\r\n\tint16_t column = 0;\r\n\r\n\trecord.dataStream().read( row, 2 );\r\n\trecord.dataStream().read( column, 2 );\r\n\r\n\trecord.dataStream().seek( 2, Stream::FromCurrent );\r\n\r\n\tunion {\r\n\t\tdouble m_asDouble;\r\n\t\tuint64_t m_asLongLong;\r\n\t} doubleAndLongLong;\r\n\r\n\trecord.dataStream().read( doubleAndLongLong.m_asLongLong, 8 );\r\n\r\n\tstorage.onCell( sheetIdx, row, column, doubleAndLongLong.m_asDouble );\r\n}\r\n\r\ninline void\r\nParser::handleFORMULA( Record & record, Stream & stream, size_t sheetIdx, IStorage & storage )\r\n{\r\n\tFormula formula( record );\r\n\r\n\tif( formula.valueType() == Formula::StringValue )\r\n\t{\r\n\t\tRecord stringRecord( stream );\r\n\r\n\t\tstd::vector< int32_t > borders;\r\n\r\n\t\tformula.setString( loadString( stringRecord.dataStream(), borders ) );\r\n\t}\r\n\r\n\tstorage.onCell( sheetIdx, formula );\r\n}\r\n\r\n} \/* namespace Excel *\/\r\n<|endoftext|>"}
{"text":"<commit_before>\/* * This file is part of meego-keyboard *\n *\n * Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n * All rights reserved.\n * Contact: Nokia Corporation (directui@nokia.com)\n *\n * If you have questions regarding the use of this file, please contact\n * Nokia at directui@nokia.com.\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1 as published by the Free Software Foundation\n * and appearing in the file LICENSE.LGPL included in the packaging\n * of this file.\n *\/\n\n#include \"regiontracker.h\"\n#include \"regiontracker_p.h\"\n\n#include <mabstractinputmethodhost.h>\n\n#include <QDebug>\n#include <QGraphicsWidget>\n\n\nRegionStore::RegionStore()\n    : lastRegion(-2, -2, -1, -1), \/\/ unrealistic region\n      dirty(false),\n      enabled(true)\n{\n}\n\nvoid RegionStore::addWidget(const QObject &widget)\n{\n    regions[&widget] = QRect();\n}\n\nvoid RegionStore::handleGeometryChange(const QObject &widget, const QRegion &region)\n{\n    if (!regions.contains(&widget)) {\n        return;\n    }\n    regions[&widget] = region;\n    dirty = true;\n    maybeNotify();\n}\n\nvoid RegionStore::maybeNotify()\n{\n    if (enabled && dirty) {\n        const QRegion newRegion(combineRegions());\n        if (newRegion != lastRegion) {\n            lastRegion = newRegion;\n            emit regionChanged(newRegion);\n        }\n        dirty = false;\n    }\n}\n\nQRegion RegionStore::combineRegions() const\n{\n    QRegion combinedRegion;\n    foreach (const QRegion &partialRegion, regions) {\n        combinedRegion |= partialRegion;\n    }\n\n    return combinedRegion;\n}\n\nvoid RegionStore::handleDestroy(const QObject &widget)\n{\n    regions.remove(&widget);\n    dirty = true;\n    maybeNotify();\n}\n\nvoid RegionStore::enable(bool newEnabled, bool flush)\n{\n    enabled = newEnabled;\n    if (flush) {\n        maybeNotify();\n    }\n}\n\n\n\/\/ RegionTrackerPrivate......................................................\n\nRegionTrackerPrivate::RegionTrackerPrivate()\n    : enabled(true)\n{\n}\n\nvoid RegionTrackerPrivate::addWidgetCommon(const QGraphicsWidget &widget)\n{\n    changeGeometry(widget);\n    connect(&widget, SIGNAL(geometryChanged()),\n            this, SLOT(handleGeometryChange()), Qt::UniqueConnection);\n    connect(&widget, SIGNAL(destroyed(QObject *)),\n            this, SLOT(handleDestroy(QObject *)), Qt::UniqueConnection);\n    connect(&widget, SIGNAL(visibleChanged()),\n            this, SLOT(handleVisibilityChange()), Qt::UniqueConnection);\n}\n\nvoid RegionTrackerPrivate::handleGeometryChange()\n{\n    const QGraphicsWidget *widget(dynamic_cast<const QGraphicsWidget *>(QObject::sender()));\n    if (!widget->isVisible()) {\n        return;\n    }\n    changeGeometry(*widget);\n}\n\nvoid RegionTrackerPrivate::changeGeometry(const QGraphicsWidget &widget)\n{\n    const QRegion region(widget.isVisible() ? widget.mapRectToScene(widget.rect()).toRect()\n                         : QRect());\n    widgetRegions.handleGeometryChange(widget, region);\n    inputMethodAreaWidgetRegions.handleGeometryChange(widget, region);\n}\n\n\nvoid RegionTrackerPrivate::handleDestroy(QObject *widget)\n{\n    widgetRegions.handleDestroy(*widget);\n    inputMethodAreaWidgetRegions.handleDestroy(*widget);\n}\n\nvoid RegionTrackerPrivate::handleVisibilityChange()\n{\n    const QGraphicsWidget *widget(dynamic_cast<const QGraphicsWidget *>(QObject::sender()));\n    changeGeometry(*widget);\n}\n\n\n\/\/ RegionTracker.............................................................\n\nRegionTracker *RegionTracker::Instance = 0;\n\n\nRegionTracker::RegionTracker()\n    : d_ptr(new RegionTrackerPrivate)\n{\n    Q_D(RegionTracker);\n\n    connect(&d->widgetRegions, SIGNAL(regionChanged(const QRegion &)),\n            this, SIGNAL(regionChanged(const QRegion &)));\n    connect(&d->inputMethodAreaWidgetRegions, SIGNAL(regionChanged(const QRegion &)),\n            this, SIGNAL(inputMethodAreaChanged(const QRegion &)));\n    connect(this, SIGNAL(regionChanged(const QRegion &)),\n            this, SIGNAL(reactionMapUpdateNeeded()));\n}\n\nRegionTracker::~RegionTracker()\n{\n    delete d_ptr;\n}\n\n\nvoid RegionTracker::createInstance()\n{\n    Q_ASSERT(!Instance);\n    if (!Instance) {\n        Instance = new RegionTracker();\n    }\n}\n\nvoid RegionTracker::destroyInstance()\n{\n    Q_ASSERT(Instance);\n    delete Instance;\n    Instance = 0;\n}\n\n\nvoid RegionTracker::addRegion(const QGraphicsWidget &widget)\n{\n    Q_D(RegionTracker);\n    d->widgetRegions.addWidget(widget);\n    d->addWidgetCommon(widget);\n}\n\nvoid RegionTracker::addInputMethodArea(const QGraphicsWidget &widget)\n{\n    Q_D(RegionTracker);\n    d->inputMethodAreaWidgetRegions.addWidget(widget);\n    d->addWidgetCommon(widget);\n}\n\nbool RegionTracker::enableSignals(bool newEnabled, bool flush)\n{\n    Q_D(RegionTracker);\n    const bool wasEnabled(d->enabled);\n    d->enabled = newEnabled;\n    d->widgetRegions.enable(newEnabled, flush);\n    d->inputMethodAreaWidgetRegions.enable(newEnabled, flush);\n    return wasEnabled;\n}\n\nvoid RegionTracker::requestReactionMapUpdate()\n{\n    emit reactionMapUpdateNeeded();\n}\n\nvoid RegionTracker::sendInputMethodAreaEstimate(const QRegion &region)\n{\n    Q_D(RegionTracker);\n    d->inputMethodAreaWidgetRegions.lastRegion = region;\n    d->inputMethodAreaWidgetRegions.dirty = false;\n    emit inputMethodAreaChanged(region);\n}\n\nvoid RegionTracker::sendRegionEstimate(const QRegion &region)\n{\n    Q_D(RegionTracker);\n    d->widgetRegions.lastRegion = region;\n    d->widgetRegions.dirty = false;\n    emit regionChanged(region);\n}\n<commit_msg>Changes: Consider regions with same area the same.<commit_after>\/* * This file is part of meego-keyboard *\n *\n * Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n * All rights reserved.\n * Contact: Nokia Corporation (directui@nokia.com)\n *\n * If you have questions regarding the use of this file, please contact\n * Nokia at directui@nokia.com.\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1 as published by the Free Software Foundation\n * and appearing in the file LICENSE.LGPL included in the packaging\n * of this file.\n *\/\n\n#include \"regiontracker.h\"\n#include \"regiontracker_p.h\"\n\n#include <mabstractinputmethodhost.h>\n\n#include <QDebug>\n#include <QGraphicsWidget>\n\n\nRegionStore::RegionStore()\n    : lastRegion(-2, -2, -1, -1), \/\/ unrealistic region\n      dirty(false),\n      enabled(true)\n{\n}\n\nvoid RegionStore::addWidget(const QObject &widget)\n{\n    regions[&widget] = QRect();\n}\n\nvoid RegionStore::handleGeometryChange(const QObject &widget, const QRegion &region)\n{\n    if (!regions.contains(&widget)) {\n        return;\n    }\n    regions[&widget] = region;\n    dirty = true;\n    maybeNotify();\n}\n\nvoid RegionStore::maybeNotify()\n{\n    if (enabled && dirty) {\n        const QRegion newRegion(combineRegions());\n        if (!(newRegion ^ lastRegion).isEmpty()) {\n            lastRegion = newRegion;\n            emit regionChanged(newRegion);\n        }\n        dirty = false;\n    }\n}\n\nQRegion RegionStore::combineRegions() const\n{\n    QRegion combinedRegion;\n    foreach (const QRegion &partialRegion, regions) {\n        combinedRegion |= partialRegion;\n    }\n\n    return combinedRegion;\n}\n\nvoid RegionStore::handleDestroy(const QObject &widget)\n{\n    regions.remove(&widget);\n    dirty = true;\n    maybeNotify();\n}\n\nvoid RegionStore::enable(bool newEnabled, bool flush)\n{\n    enabled = newEnabled;\n    if (flush) {\n        maybeNotify();\n    }\n}\n\n\n\/\/ RegionTrackerPrivate......................................................\n\nRegionTrackerPrivate::RegionTrackerPrivate()\n    : enabled(true)\n{\n}\n\nvoid RegionTrackerPrivate::addWidgetCommon(const QGraphicsWidget &widget)\n{\n    changeGeometry(widget);\n    connect(&widget, SIGNAL(geometryChanged()),\n            this, SLOT(handleGeometryChange()), Qt::UniqueConnection);\n    connect(&widget, SIGNAL(destroyed(QObject *)),\n            this, SLOT(handleDestroy(QObject *)), Qt::UniqueConnection);\n    connect(&widget, SIGNAL(visibleChanged()),\n            this, SLOT(handleVisibilityChange()), Qt::UniqueConnection);\n}\n\nvoid RegionTrackerPrivate::handleGeometryChange()\n{\n    const QGraphicsWidget *widget(dynamic_cast<const QGraphicsWidget *>(QObject::sender()));\n    if (!widget->isVisible()) {\n        return;\n    }\n    changeGeometry(*widget);\n}\n\nvoid RegionTrackerPrivate::changeGeometry(const QGraphicsWidget &widget)\n{\n    const QRegion region(widget.isVisible() ? widget.mapRectToScene(widget.rect()).toRect()\n                         : QRect());\n    widgetRegions.handleGeometryChange(widget, region);\n    inputMethodAreaWidgetRegions.handleGeometryChange(widget, region);\n}\n\n\nvoid RegionTrackerPrivate::handleDestroy(QObject *widget)\n{\n    widgetRegions.handleDestroy(*widget);\n    inputMethodAreaWidgetRegions.handleDestroy(*widget);\n}\n\nvoid RegionTrackerPrivate::handleVisibilityChange()\n{\n    const QGraphicsWidget *widget(dynamic_cast<const QGraphicsWidget *>(QObject::sender()));\n    changeGeometry(*widget);\n}\n\n\n\/\/ RegionTracker.............................................................\n\nRegionTracker *RegionTracker::Instance = 0;\n\n\nRegionTracker::RegionTracker()\n    : d_ptr(new RegionTrackerPrivate)\n{\n    Q_D(RegionTracker);\n\n    connect(&d->widgetRegions, SIGNAL(regionChanged(const QRegion &)),\n            this, SIGNAL(regionChanged(const QRegion &)));\n    connect(&d->inputMethodAreaWidgetRegions, SIGNAL(regionChanged(const QRegion &)),\n            this, SIGNAL(inputMethodAreaChanged(const QRegion &)));\n    connect(this, SIGNAL(regionChanged(const QRegion &)),\n            this, SIGNAL(reactionMapUpdateNeeded()));\n}\n\nRegionTracker::~RegionTracker()\n{\n    delete d_ptr;\n}\n\n\nvoid RegionTracker::createInstance()\n{\n    Q_ASSERT(!Instance);\n    if (!Instance) {\n        Instance = new RegionTracker();\n    }\n}\n\nvoid RegionTracker::destroyInstance()\n{\n    Q_ASSERT(Instance);\n    delete Instance;\n    Instance = 0;\n}\n\n\nvoid RegionTracker::addRegion(const QGraphicsWidget &widget)\n{\n    Q_D(RegionTracker);\n    d->widgetRegions.addWidget(widget);\n    d->addWidgetCommon(widget);\n}\n\nvoid RegionTracker::addInputMethodArea(const QGraphicsWidget &widget)\n{\n    Q_D(RegionTracker);\n    d->inputMethodAreaWidgetRegions.addWidget(widget);\n    d->addWidgetCommon(widget);\n}\n\nbool RegionTracker::enableSignals(bool newEnabled, bool flush)\n{\n    Q_D(RegionTracker);\n    const bool wasEnabled(d->enabled);\n    d->enabled = newEnabled;\n    d->widgetRegions.enable(newEnabled, flush);\n    d->inputMethodAreaWidgetRegions.enable(newEnabled, flush);\n    return wasEnabled;\n}\n\nvoid RegionTracker::requestReactionMapUpdate()\n{\n    emit reactionMapUpdateNeeded();\n}\n\nvoid RegionTracker::sendInputMethodAreaEstimate(const QRegion &region)\n{\n    Q_D(RegionTracker);\n    d->inputMethodAreaWidgetRegions.lastRegion = region;\n    d->inputMethodAreaWidgetRegions.dirty = false;\n    emit inputMethodAreaChanged(region);\n}\n\nvoid RegionTracker::sendRegionEstimate(const QRegion &region)\n{\n    Q_D(RegionTracker);\n    d->widgetRegions.lastRegion = region;\n    d->widgetRegions.dirty = false;\n    emit regionChanged(region);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <array>\n#include <stdexcept>\n#include <string>\n\n#include <ros\/ros.h>\n#include <controller_manager\/controller_manager.h>\n#include <hardware_interface\/joint_command_interface.h>\n#include <hardware_interface\/joint_state_interface.h>\n#include <hardware_interface\/robot_hw.h>\n\n#include <ics3\/ics>\n\nstruct JointData\n{\n  std::string name_;\n  double cmd_;\n  double pos_;\n  double vel_;\n  double eff_;\n};\n\ntemplate<class JntCmdIF>\nstruct JointControlBuildData\n{\n  std::string joint_name_;\n  hardware_interface::JointStateInterface& jnt_stat_;\n  JntCmdIF& jnt_cmd_;\n};\n\nclass JointControlInterface\n{\npublic:\n  virtual void fetch() = 0;\n  virtual void move() = 0;\n};\n\nclass ICSControl\n  : public JointControlInterface\n{\npublic:\n  using JntCmdType = hardware_interface::PositionJointInterface;\n  using BuildDataType = JointControlBuildData<JntCmdType>;\n  ICSControl(BuildDataType&, ics::ICS3&, const ics::ID&);\n  void fetch() override;\n  void move() override;\nprivate:\n  JointData data_;\n  ics::ICS3& driver_;\n  ics::ID id_;\n};\n\ntemplate<class JntCmdIF>\nclass DammyControl\n  : public JointControlInterface\n{\npublic:\n  using JntCmdType = JntCmdIF;\n  using BuildDataType = JointControlBuildData<JntCmdType>;\n  DammyControl(BuildDataType&);\n  void fetch() override;\n  void move() override;\nprivate:\n  JointData data_;\n};\n\nusing DammyPositionControl = DammyControl<hardware_interface::PositionJointInterface>;\nusing DammyVelocityControl = DammyControl<hardware_interface::VelocityJointInterface>;\n\nclass Arcsys2HW\n  : public hardware_interface::RobotHW\n{\npublic:\n  static constexpr std::size_t JOINT_COUNT {6};\n  using JointControlContainer = std::array<JointControlInterface*, JOINT_COUNT>;\n  Arcsys2HW(hardware_interface::JointStateInterface*);\n  void registerControl(JointControlInterface*);\n  void read();\n  void write();\n  ros::Time getTime();\n  ros::Duration getPeriod();\nprivate:\n  JointControlContainer controls;\n};\n\ntemplate<class JntCmdIF>\nvoid registerJoint(\n    JointData&,\n    hardware_interface::JointStateInterface&,\n    JntCmdIF&);\n\ntemplate<class JntCmdIF>\nvoid registerJoint(\n    JointData&,\n    JointControlBuildData<JntCmdIF>&);\n\nint main(int argc, char *argv[])\n{\n  ros::init(argc, argv, \"arcsys2_control_node\");\n  hardware_interface::JointStateInterface joint_state_interface {};\n  hardware_interface::PositionJointInterface position_joint_interface {};\n  hardware_interface::VelocityJointInterface velocity_joint_interface {};\n\n  DammyVelocityControl::BuildDataType shaft_builder {\"rail_to_shaft_joint\", joint_state_interface, velocity_joint_interface};\n  DammyVelocityControl shaft_control {shaft_builder};\n  DammyVelocityControl::BuildDataType arm0_builder {\"shaft_to_arm0_joint\", joint_state_interface, velocity_joint_interface};\n  DammyVelocityControl arm0_control {arm0_builder};\n  DammyPositionControl::BuildDataType arm1_builder {\"arm0_to_arm1_joint\", joint_state_interface, position_joint_interface};\n  DammyPositionControl arm1_control {arm1_builder};\n  DammyPositionControl::BuildDataType arm2_builder {\"arm1_to_arm2_joint\", joint_state_interface, position_joint_interface};\n  DammyPositionControl arm2_control {arm2_builder};\n  DammyPositionControl::BuildDataType effector_base_builder {\"arm2_to_effector_base_joint\", joint_state_interface, position_joint_interface};\n  DammyPositionControl effector_base_control {effector_base_builder};\n  DammyPositionControl::BuildDataType effector_end_builder {\"effector_base_to_effector_end_joint\", joint_state_interface, position_joint_interface};\n  DammyPositionControl effector_end_control {effector_end_builder};\n\n  Arcsys2HW robot {&joint_state_interface};\n  robot.registerInterface(&position_joint_interface);\n  robot.registerInterface(&velocity_joint_interface);\n  robot.registerControl(&shaft_control);\n  robot.registerControl(&arm0_control);\n  robot.registerControl(&arm1_control);\n  robot.registerControl(&arm2_control);\n  robot.registerControl(&effector_base_control);\n  robot.registerControl(&effector_end_control);\n  controller_manager::ControllerManager cm {&robot};\n\n  ros::Rate rate(1.0 \/ robot.getPeriod().toSec());\n  ros::AsyncSpinner spinner {1};\n\n  spinner.start();\n  while(ros::ok())\n  {\n    robot.read();\n    cm.update(robot.getTime(), robot.getPeriod());\n    robot.write();\n    rate.sleep();\n  }\n  spinner.stop();\n\n  return 0;\n}\n\ninline ICSControl::ICSControl(BuildDataType& build_data, ics::ICS3& driver, const ics::ID& id)\n  : data_ {build_data.joint_name_},\n    driver_ {driver},\n    id_ {id}\n{\n  registerJoint(data_, build_data);\n}\n\ninline void ICSControl::fetch()\n{\n}\n\ninline void ICSControl::move()\n{\n  data_.pos_ = driver_.move(id_, ics::Angle::newRadian(data_.cmd_));\n}\n\ntemplate<class JntCmdIF>\ninline DammyControl<JntCmdIF>::DammyControl(BuildDataType& build_data)\n  : data_ {build_data.joint_name_}\n{\n  registerJoint(data_, build_data);\n}\n\ntemplate<>\ninline void DammyPositionControl::fetch()\n{\n  data_.pos_ = data_.cmd_;\n}\n\ntemplate<>\ninline void DammyVelocityControl::fetch()\n{\n  data_.pos_ += data_.cmd_ * 0.01; \/\/ FIXME: test code\n  data_.vel_ = data_.cmd_;\n}\n\ntemplate<class JntCmdIF>\ninline void DammyControl<JntCmdIF>::move()\n{\n}\n\ninline Arcsys2HW::Arcsys2HW(hardware_interface::JointStateInterface* jnt_stat)\n  : controls {}\n{\n  registerInterface(jnt_stat);\n}\n\ninline void Arcsys2HW::registerControl(JointControlInterface* jnt_cntr)\n{\n  static auto inserter = controls.begin();\n  if (inserter == controls.cend()) throw std::out_of_range {\"Too many JointControl\"};\n  *inserter = jnt_cntr;\n  ++inserter;\n}\n\ninline void Arcsys2HW::read()\n{\n  for (auto control : controls) control->fetch();\n}\n\ninline void Arcsys2HW::write()\n{\n  for (auto control : controls) control->move();\n}\n\ninline ros::Time Arcsys2HW::getTime()\n{\n  return ros::Time::now();\n}\n\ninline ros::Duration Arcsys2HW::getPeriod()\n{\n  return ros::Duration {0.01};\n}\n\ntemplate<class JntCmdIF>\ninline void registerJoint(\n    JointData& joint,\n    hardware_interface::JointStateInterface& jnt_stat,\n    JntCmdIF& jnt_cmd)\n{\n  jnt_stat.registerHandle(hardware_interface::JointStateHandle {joint.name_, &joint.pos_, &joint.vel_, &joint.eff_});\n  jnt_cmd.registerHandle(hardware_interface::JointHandle {jnt_stat.getHandle(joint.name_), &joint.cmd_});\n}\n\ntemplate<class JntCmdIF>\ninline void registerJoint(\n    JointData& joint,\n    JointControlBuildData<JntCmdIF>& build_data)\n{\n  registerJoint(joint, build_data.jnt_stat_, build_data.jnt_cmd_);\n}\n<commit_msg>Use ICSControl<commit_after>#include <array>\n#include <stdexcept>\n#include <string>\n\n#include <ros\/ros.h>\n#include <controller_manager\/controller_manager.h>\n#include <hardware_interface\/joint_command_interface.h>\n#include <hardware_interface\/joint_state_interface.h>\n#include <hardware_interface\/robot_hw.h>\n\n#include <ics3\/ics>\n\nstruct JointData\n{\n  std::string name_;\n  double cmd_;\n  double pos_;\n  double vel_;\n  double eff_;\n};\n\ntemplate<class JntCmdIF>\nstruct JointControlBuildData\n{\n  std::string joint_name_;\n  hardware_interface::JointStateInterface& jnt_stat_;\n  JntCmdIF& jnt_cmd_;\n};\n\nclass JointControlInterface\n{\npublic:\n  virtual void fetch() = 0;\n  virtual void move() = 0;\n};\n\nclass ICSControl\n  : public JointControlInterface\n{\npublic:\n  using JntCmdType = hardware_interface::PositionJointInterface;\n  using BuildDataType = JointControlBuildData<JntCmdType>;\n  ICSControl(BuildDataType&, ics::ICS3&, const ics::ID&);\n  void fetch() override;\n  void move() override;\nprivate:\n  JointData data_;\n  ics::ICS3& driver_;\n  ics::ID id_;\n};\n\ntemplate<class JntCmdIF>\nclass DammyControl\n  : public JointControlInterface\n{\npublic:\n  using JntCmdType = JntCmdIF;\n  using BuildDataType = JointControlBuildData<JntCmdType>;\n  DammyControl(BuildDataType&);\n  void fetch() override;\n  void move() override;\nprivate:\n  JointData data_;\n};\n\nusing DammyPositionControl = DammyControl<hardware_interface::PositionJointInterface>;\nusing DammyVelocityControl = DammyControl<hardware_interface::VelocityJointInterface>;\n\nclass Arcsys2HW\n  : public hardware_interface::RobotHW\n{\npublic:\n  static constexpr std::size_t JOINT_COUNT {6};\n  using JointControlContainer = std::array<JointControlInterface*, JOINT_COUNT>;\n  Arcsys2HW(hardware_interface::JointStateInterface*);\n  void registerControl(JointControlInterface*);\n  void read();\n  void write();\n  ros::Time getTime();\n  ros::Duration getPeriod();\nprivate:\n  JointControlContainer controls;\n};\n\ntemplate<class JntCmdIF>\nvoid registerJoint(\n    JointData&,\n    hardware_interface::JointStateInterface&,\n    JntCmdIF&);\n\ntemplate<class JntCmdIF>\nvoid registerJoint(\n    JointData&,\n    JointControlBuildData<JntCmdIF>&);\n\nint main(int argc, char *argv[])\n{\n  ros::init(argc, argv, \"arcsys2_control_node\");\n  ros::NodeHandle pnh {\"~\"};\n\n  std::string ics_device_path {\"\/dev\/ttyUSB0\"};\n  pnh.param<std::string>(\"ics_device_path\", ics_device_path, ics_device_path);\n  ics::ICS3 ics_driver {std::move(ics_device_path)};\n  std::vector<int> ics_id_vec {};\n  pnh.getParam(\"ics_id_vec\", ics_id_vec);\n  std::vector<ics::ID> ics_ids(ics_id_vec.cbegin(), ics_id_vec.cend());\n\n  hardware_interface::JointStateInterface joint_state_interface {};\n  hardware_interface::PositionJointInterface position_joint_interface {};\n  hardware_interface::VelocityJointInterface velocity_joint_interface {};\n\n  DammyVelocityControl::BuildDataType shaft_builder {\"rail_to_shaft_joint\", joint_state_interface, velocity_joint_interface};\n  DammyVelocityControl shaft_control {shaft_builder};\n  DammyVelocityControl::BuildDataType arm0_builder {\"shaft_to_arm0_joint\", joint_state_interface, velocity_joint_interface};\n  DammyVelocityControl arm0_control {arm0_builder};\n  auto ics_id_it = ics_ids.cbegin();\n  ICSControl::BuildDataType arm1_builder {\"arm0_to_arm1_joint\", joint_state_interface, position_joint_interface};\n  ICSControl arm1_control {arm1_builder, ics_driver, *ics_id_it++};\n  ICSControl::BuildDataType arm2_builder {\"arm1_to_arm2_joint\", joint_state_interface, position_joint_interface};\n  ICSControl arm2_control {arm2_builder, ics_driver, *ics_id_it++};\n  ICSControl::BuildDataType effector_base_builder {\"arm2_to_effector_base_joint\", joint_state_interface, position_joint_interface};\n  ICSControl effector_base_control {effector_base_builder, ics_driver, *ics_id_it++};\n  ICSControl::BuildDataType effector_end_builder {\"effector_base_to_effector_end_joint\", joint_state_interface, position_joint_interface};\n  ICSControl effector_end_control {effector_end_builder, ics_driver, *ics_id_it};\n\n  Arcsys2HW robot {&joint_state_interface};\n  robot.registerInterface(&position_joint_interface);\n  robot.registerInterface(&velocity_joint_interface);\n  robot.registerControl(&shaft_control);\n  robot.registerControl(&arm0_control);\n  robot.registerControl(&arm1_control);\n  robot.registerControl(&arm2_control);\n  robot.registerControl(&effector_base_control);\n  robot.registerControl(&effector_end_control);\n  controller_manager::ControllerManager cm {&robot};\n\n  ros::Rate rate(1.0 \/ robot.getPeriod().toSec());\n  ros::AsyncSpinner spinner {1};\n\n  spinner.start();\n  while(ros::ok())\n  {\n    robot.read();\n    cm.update(robot.getTime(), robot.getPeriod());\n    robot.write();\n    rate.sleep();\n  }\n  spinner.stop();\n\n  return 0;\n}\n\ninline ICSControl::ICSControl(BuildDataType& build_data, ics::ICS3& driver, const ics::ID& id)\n  : data_ {build_data.joint_name_},\n    driver_ {driver},\n    id_ {id}\n{\n  registerJoint(data_, build_data);\n}\n\ninline void ICSControl::fetch()\n{\n}\n\ninline void ICSControl::move()\n{\n  data_.pos_ = driver_.move(id_, ics::Angle::newRadian(data_.cmd_));\n}\n\ntemplate<class JntCmdIF>\ninline DammyControl<JntCmdIF>::DammyControl(BuildDataType& build_data)\n  : data_ {build_data.joint_name_}\n{\n  registerJoint(data_, build_data);\n}\n\ntemplate<>\ninline void DammyPositionControl::fetch()\n{\n  data_.pos_ = data_.cmd_;\n}\n\ntemplate<>\ninline void DammyVelocityControl::fetch()\n{\n  data_.pos_ += data_.cmd_ * 0.01; \/\/ FIXME: test code\n  data_.vel_ = data_.cmd_;\n}\n\ntemplate<class JntCmdIF>\ninline void DammyControl<JntCmdIF>::move()\n{\n}\n\ninline Arcsys2HW::Arcsys2HW(hardware_interface::JointStateInterface* jnt_stat)\n  : controls {}\n{\n  registerInterface(jnt_stat);\n}\n\ninline void Arcsys2HW::registerControl(JointControlInterface* jnt_cntr)\n{\n  static auto inserter = controls.begin();\n  if (inserter == controls.cend()) throw std::out_of_range {\"Too many JointControl\"};\n  *inserter = jnt_cntr;\n  ++inserter;\n}\n\ninline void Arcsys2HW::read()\n{\n  for (auto control : controls) control->fetch();\n}\n\ninline void Arcsys2HW::write()\n{\n  for (auto control : controls) control->move();\n}\n\ninline ros::Time Arcsys2HW::getTime()\n{\n  return ros::Time::now();\n}\n\ninline ros::Duration Arcsys2HW::getPeriod()\n{\n  return ros::Duration {0.01};\n}\n\ntemplate<class JntCmdIF>\ninline void registerJoint(\n    JointData& joint,\n    hardware_interface::JointStateInterface& jnt_stat,\n    JntCmdIF& jnt_cmd)\n{\n  jnt_stat.registerHandle(hardware_interface::JointStateHandle {joint.name_, &joint.pos_, &joint.vel_, &joint.eff_});\n  jnt_cmd.registerHandle(hardware_interface::JointHandle {jnt_stat.getHandle(joint.name_), &joint.cmd_});\n}\n\ntemplate<class JntCmdIF>\ninline void registerJoint(\n    JointData& joint,\n    JointControlBuildData<JntCmdIF>& build_data)\n{\n  registerJoint(joint, build_data.jnt_stat_, build_data.jnt_cmd_);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"stdafx.h\"\n#include \"Camera.h\"\n#include \"TimeMgr.h\"\n#include \"Info.h\"\n#include \"Input.h\"\n#include \"SceneMgr.h\"\n#include \"Player.h\"\n\nIMPLEMENT_SINGLETON(CCamera)\n\nCCamera::CCamera()\n{\n\tD3DXMatrixIdentity(&m_matView);\n\tD3DXMatrixIdentity(&m_matProj);\n\n}\n\n\nCCamera::~CCamera()\n{\n\tRelease();\n}\n\nHRESULT CCamera::Initialize(void)\n{\n\t\/\/m_vEye = D3DXVECTOR3(0.0f, 20.f, -20.0f);\n\tm_vEye = D3DXVECTOR3(86.0f, 20.f, -14.0f);\n\tm_vAt = D3DXVECTOR3(0.f, 0.f, 0.f);\n\tm_vUp = D3DXVECTOR3(0.f, 1.f, 0.f);\n\n\tm_vDirZ = D3DXVECTOR3(0.f, 0.f, -1.f);\n\n\n\tm_dwTime = GetTickCount();\n\tm_dwTime = GetTickCount();\n\n\tm_bMouseFix = true;\n\tm_bDebugCam = false;\n\n\tm_pInfo = CInfo::Create(D3DXVECTOR3(0.f, 0.f, 1.f));\n\t\n\tm_fFovY = D3DXToRadian(45.f);\n\tm_fAspect = float(WINCX) \/ static_cast<float>(WINCY);\n\tm_fNear = 1.f;\n\tm_fFar = 1000.f;\n\tMakeView();\n\tMakeProjection();\n\n\tm_fCameraDistance = 10.f;\n\tm_fCameraSpeed = 70.f;\n\n\tm_fAngle = 0.f;\n\n\tm_vTarget = D3DXVECTOR3(-6.f, 8.f, 6.f);\n\t\n\treturn S_OK;\n}\n\nint CCamera::Update(void)\n{\n\t\/\/cout << m_vEye.x << \"\/\" << m_vEye.y << \"\/\" << m_vEye.z << endl;\n\n\tm_pInfo->Update();\n\n\tif (CSceneMgr::GetInstance()->m_eType != SCENE_LOGO)\n\t{\n\t\tKeyState();\n\n\t\tif (m_bDebugCam == true)\n\t\t{\n\t\t\tMouseMove();\n\t\t\tFixMouse();\n\t\t}\n\t\telse if (m_bDebugCam == false)\n\t\t{\n\t\t\tTargetRenewal();\n\t\t}\n\t}\n\tMakeView();\n\tMakeProjection();\n\treturn 0;\n}\n\nD3DXVECTOR3 CCamera::GetWorldAhead()\n{\n\tD3DXMATRIX matCamWorld;\n\tD3DXMatrixInverse(&matCamWorld, NULL, &m_matView);\n\treturn D3DXVECTOR3(matCamWorld._31, matCamWorld._32, matCamWorld._33);\n}\n\nD3DXVECTOR3 CCamera::GetWorldRight()\n{\n\tD3DXMATRIX matCamWorld;\n\tD3DXMatrixInverse(&matCamWorld, NULL, &m_matView);\n\treturn D3DXVECTOR3(matCamWorld._11, matCamWorld._12, matCamWorld._13);\n}\n\nD3DXVECTOR3 CCamera::GetWorldUp()\n{\n\tD3DXMATRIX matCamWorld;\n\tD3DXMatrixInverse(&matCamWorld, NULL, &m_matView);\n\treturn D3DXVECTOR3(matCamWorld._21, matCamWorld._22, matCamWorld._23);\n}\n\nvoid CCamera::MakeView(void)\n{\n\tD3DXMatrixLookAtLH(&m_matView, &m_vEye, &m_vAt, &m_vUp);\n}\n\nvoid CCamera::MakeProjection(void)\n{\n\tD3DXMatrixPerspectiveFovLH(&m_matProj, m_fFovY, m_fAspect, m_fNear, m_fFar);\n}\n\nvoid CCamera::SetCameraTarget(CInfo* pInfo)\n{\n\tm_pTargetInfo = pInfo;\n}\n\nvoid CCamera::Release(void)\n{\n\t::Safe_Delete(m_pInfo);\n}\n\nvoid CCamera::KeyState(void)\n{\n\tfloat fTime = CTimeMgr::GetInstance()->GetTime();\n\n\tif (CInput::GetInstance()->GetDIKeyState(DIK_O) & 0x80)\n\t{\n\t\tif (m_bMouseFix == true)\n\t\t\tm_bMouseFix = false;\n\n\t\t\t\n\t}\n\n\tif (CInput::GetInstance()->GetDIKeyState(DIK_P) & 0x80)\n\t{\n\t\tif(m_bMouseFix == false)\n\t\t\tm_bMouseFix = true;\n\t}\n\n\tif (CInput::GetInstance()->GetDIKeyState(DIK_A) & 0x80)\n\t{\n\t\tD3DXVECTOR3\t\tvRight;\n\t\tD3DXMATRIX\t\tmatCamState;\n\n\t\tD3DXMatrixInverse(&matCamState, NULL, &m_matView);\n\t\tmemcpy(&vRight, &matCamState.m[0][0], sizeof(D3DXVECTOR3));\n\t\tD3DXVec3Normalize(&vRight, &vRight);\n\n\t\tm_vEye -= vRight * m_fCameraSpeed * fTime;\n\t\tm_vAt -= vRight * m_fCameraSpeed * fTime;\n\t\t\/\/m_vAt.x -= m_fCameraSpeed * fTime;\n\t}\n\n\tif (CInput::GetInstance()->GetDIKeyState(DIK_D) & 0x80)\n\t{\n\t\tD3DXVECTOR3\t\tvRight;\n\t\tD3DXMATRIX\t\tmatCamState;\n\n\t\tD3DXMatrixInverse(&matCamState, NULL, &m_matView);\n\t\tmemcpy(&vRight, &matCamState.m[0][0], sizeof(D3DXVECTOR3));\n\t\tD3DXVec3Normalize(&vRight, &vRight);\n\n\t\tm_vEye += vRight * m_fCameraSpeed * fTime;\n\t\tm_vAt += vRight * m_fCameraSpeed * fTime;\n\n\t\t\/\/m_vAt.x += m_fCameraSpeed * fTime;\n\t}\n\n\tif (CInput::GetInstance()->GetDIKeyState(DIK_W) & 0x80)\n\t{\n\t\tD3DXVECTOR3\t\tvLook;\n\t\tvLook = m_vAt - m_vEye;\n\t\tD3DXVec3Normalize(&vLook, &vLook);\n\n\t\tm_vEye += vLook * m_fCameraSpeed * fTime;\n\t\tm_vAt += vLook * m_fCameraSpeed * fTime;\n\n\t\t\/\/m_pInfo->m_vDir.y = 0.f;\n\t\t\/\/m_vAt += m_pInfo->m_vDir * fTime * m_fCameraSpeed * -1.f;\n\t}\n\n\tif (CInput::GetInstance()->GetDIKeyState(DIK_S) & 0x80)\n\t{\n\t\tD3DXVECTOR3\t\tvLook;\n\t\tvLook = m_vAt - m_vEye;\n\t\tD3DXVec3Normalize(&vLook, &vLook);\n\n\t\tm_vEye -= vLook * m_fCameraSpeed * fTime;\n\t\tm_vAt -= vLook * m_fCameraSpeed * fTime;\n\n\t\t\/\/m_pInfo->m_vDir.y = 0.f;\n\t\t\/\/m_vAt -= m_pInfo->m_vDir * fTime * m_fCameraSpeed * -1.f;\n\t}\n\n\tif (CInput::GetInstance()->GetDIKeyState(DIK_F11) & 0x80)\n\t{\n\t\tif (m_bDebugCam == true)\n\t\t\tm_bDebugCam = false;\n\n\n\t}\n\n\tif (CInput::GetInstance()->GetDIKeyState(DIK_F12) & 0x80)\n\t{\n\t\tif (m_bDebugCam == false)\n\t\t\tm_bDebugCam = true;\n\t}\n\n\n}\n\nvoid CCamera::FixMouse(void)\n{\n\tPOINT ptMouse;\n\tZeroMemory(&ptMouse, sizeof(POINT));\n\tptMouse.x;\n\n\tptMouse.x = WINCX >> 1;\n\tptMouse.y = WINCY >> 1;\n\n\n\tClientToScreen(g_hWnd, &ptMouse);\n\n\t\n\tif (m_bMouseFix == true)\n\t\tSetCursorPos(ptMouse.x, ptMouse.y);\n\n}\n\nvoid CCamera::MouseMove(void)\n{\n\tint iInput = 0;\n\n\tif (m_bMouseFix == false)\n\t\treturn;\n\n\n\tfloat\tfTime = CTimeMgr::GetInstance()->GetTime();\n\tint\t\tiDistance = 0;\n\n\tif (iDistance = CInput::GetInstance()->GetDIMouseMove(CInput::DIM_X))\n\t{\n\t\tD3DXMATRIX\t\tmatAxis;\n\t\tD3DXMatrixRotationAxis(&matAxis, &D3DXVECTOR3(0.f, 1.f, 0.f), D3DXToRadian(iDistance \/ 10.f));\n\n\t\tD3DXVECTOR3\t\tvDir;\n\t\tvDir = m_vAt - m_vEye;\n\t\tD3DXVec3TransformNormal(&vDir, &vDir, &matAxis);\n\n\t\tm_vAt = m_vEye + vDir;\n\n\t}\n\n\tif (iDistance = CInput::GetInstance()->GetDIMouseMove(CInput::DIM_Y))\n\t{\n\t\tD3DXVECTOR3\t\tvRight;\n\t\tD3DXMATRIX\t\tmatCamState;\n\n\t\tD3DXMatrixInverse(&matCamState, NULL, &m_matView);\n\t\tmemcpy(&vRight, &matCamState.m[0][0], sizeof(D3DXVECTOR3));\n\t\tD3DXVec3Normalize(&vRight, &vRight);\n\n\t\tD3DXMATRIX\t\tmatAxis;\n\t\tD3DXMatrixRotationAxis(&matAxis, &vRight, D3DXToRadian(iDistance \/ 10.f));\n\n\t\tD3DXVECTOR3\t\tvDir;\n\t\tvDir = m_vAt - m_vEye;\n\t\tD3DXVec3TransformNormal(&vDir, &vDir, &matAxis);\n\n\t\tm_vAt = m_vEye + vDir;\n\t}\n}\n\nvoid CCamera::TargetRenewal(void)\n{\n\t\/\/m_vEye = m_pTargetInfo->m_vDir * (-1);\n\t\/\/D3DXVec3Normalize(&m_vEye, &m_vEye);\n\n\t\/\/m_vEye *= m_fCameraDistance;\n\n\tD3DXVECTOR3\t\tvRight;\n\tmemcpy(&vRight, &m_pTargetInfo->m_matWorld.m[0][0], sizeof(float) * 3);\n\n\tD3DXMATRIX\t\tmatRotAxis;\n\n\t\/\/m_fAngle = m_pTargetInfo->m_fAngle[ANGLE_Y];\n\n\tD3DXMatrixRotationAxis(&matRotAxis, &vRight, m_fAngle);\n\tD3DXVec3TransformNormal(&m_vEye, &m_vEye, &matRotAxis);\n\n\tm_vEye.x = m_pTargetInfo->m_vPos.x + m_vTarget.x;\n\tm_vEye.y = m_pTargetInfo->m_vPos.y + m_vTarget.y;\n\tm_vEye.z = m_pTargetInfo->m_vPos.z + m_vTarget.z;\n\n\tm_vAt = m_pTargetInfo->m_vPos;\n\n\tMakeView();\n}\n\n<commit_msg>[허지훈]Camera<commit_after>#include \"stdafx.h\"\n#include \"Camera.h\"\n#include \"TimeMgr.h\"\n#include \"Info.h\"\n#include \"Input.h\"\n#include \"SceneMgr.h\"\n#include \"Player.h\"\n\nIMPLEMENT_SINGLETON(CCamera)\n\nCCamera::CCamera()\n{\n\tD3DXMatrixIdentity(&m_matView);\n\tD3DXMatrixIdentity(&m_matProj);\n\n}\n\n\nCCamera::~CCamera()\n{\n\tRelease();\n}\n\nHRESULT CCamera::Initialize(void)\n{\n\t\/\/m_vEye = D3DXVECTOR3(0.0f, 20.f, -20.0f);\n\tm_vEye = D3DXVECTOR3(86.0f, 20.f, -14.0f);\n\tm_vAt = D3DXVECTOR3(0.f, 0.f, 0.f);\n\tm_vUp = D3DXVECTOR3(0.f, 1.f, 0.f);\n\n\tm_vDirZ = D3DXVECTOR3(0.f, 0.f, -1.f);\n\n\n\tm_dwTime = GetTickCount();\n\tm_dwTime = GetTickCount();\n\n\tm_bMouseFix = true;\n\tm_bDebugCam = false;\n\n\tm_pInfo = CInfo::Create(D3DXVECTOR3(0.f, 0.f, 1.f));\n\t\n\tm_fFovY = D3DXToRadian(45.f);\n\tm_fAspect = float(WINCX) \/ static_cast<float>(WINCY);\n\tm_fNear = 0.1f;\n\tm_fFar = 500.f;\n\tMakeView();\n\tMakeProjection();\n\n\tm_fCameraDistance = 10.f;\n\tm_fCameraSpeed = 70.f;\n\n\tm_fAngle = 0.f;\n\n\tm_vTarget = D3DXVECTOR3(-6.f, 8.f, 6.f);\n\t\n\treturn S_OK;\n}\n\nint CCamera::Update(void)\n{\n\t\/\/cout << m_vEye.x << \"\/\" << m_vEye.y << \"\/\" << m_vEye.z << endl;\n\n\tm_pInfo->Update();\n\n\tif (CSceneMgr::GetInstance()->m_eType != SCENE_LOGO)\n\t{\n\t\tKeyState();\n\n\t\tif (m_bDebugCam == true)\n\t\t{\n\t\t\tMouseMove();\n\t\t\tFixMouse();\n\t\t}\n\t\telse if (m_bDebugCam == false)\n\t\t{\n\t\t\tTargetRenewal();\n\t\t}\n\t}\n\tMakeView();\n\tMakeProjection();\n\treturn 0;\n}\n\nD3DXVECTOR3 CCamera::GetWorldAhead()\n{\n\tD3DXMATRIX matCamWorld;\n\tD3DXMatrixInverse(&matCamWorld, NULL, &m_matView);\n\treturn D3DXVECTOR3(matCamWorld._31, matCamWorld._32, matCamWorld._33);\n}\n\nD3DXVECTOR3 CCamera::GetWorldRight()\n{\n\tD3DXMATRIX matCamWorld;\n\tD3DXMatrixInverse(&matCamWorld, NULL, &m_matView);\n\treturn D3DXVECTOR3(matCamWorld._11, matCamWorld._12, matCamWorld._13);\n}\n\nD3DXVECTOR3 CCamera::GetWorldUp()\n{\n\tD3DXMATRIX matCamWorld;\n\tD3DXMatrixInverse(&matCamWorld, NULL, &m_matView);\n\treturn D3DXVECTOR3(matCamWorld._21, matCamWorld._22, matCamWorld._23);\n}\n\nvoid CCamera::MakeView(void)\n{\n\tD3DXMatrixLookAtLH(&m_matView, &m_vEye, &m_vAt, &m_vUp);\n}\n\nvoid CCamera::MakeProjection(void)\n{\n\tD3DXMatrixPerspectiveFovLH(&m_matProj, m_fFovY, m_fAspect, m_fNear, m_fFar);\n}\n\nvoid CCamera::SetCameraTarget(CInfo* pInfo)\n{\n\tm_pTargetInfo = pInfo;\n}\n\nvoid CCamera::Release(void)\n{\n\t::Safe_Delete(m_pInfo);\n}\n\nvoid CCamera::KeyState(void)\n{\n\tfloat fTime = CTimeMgr::GetInstance()->GetTime();\n\n\tif (CInput::GetInstance()->GetDIKeyState(DIK_O) & 0x80)\n\t{\n\t\tif (m_bMouseFix == true)\n\t\t\tm_bMouseFix = false;\n\n\t\t\t\n\t}\n\n\tif (CInput::GetInstance()->GetDIKeyState(DIK_P) & 0x80)\n\t{\n\t\tif(m_bMouseFix == false)\n\t\t\tm_bMouseFix = true;\n\t}\n\n\tif (CInput::GetInstance()->GetDIKeyState(DIK_A) & 0x80)\n\t{\n\t\tD3DXVECTOR3\t\tvRight;\n\t\tD3DXMATRIX\t\tmatCamState;\n\n\t\tD3DXMatrixInverse(&matCamState, NULL, &m_matView);\n\t\tmemcpy(&vRight, &matCamState.m[0][0], sizeof(D3DXVECTOR3));\n\t\tD3DXVec3Normalize(&vRight, &vRight);\n\n\t\tm_vEye -= vRight * m_fCameraSpeed * fTime;\n\t\tm_vAt -= vRight * m_fCameraSpeed * fTime;\n\t\t\/\/m_vAt.x -= m_fCameraSpeed * fTime;\n\t}\n\n\tif (CInput::GetInstance()->GetDIKeyState(DIK_D) & 0x80)\n\t{\n\t\tD3DXVECTOR3\t\tvRight;\n\t\tD3DXMATRIX\t\tmatCamState;\n\n\t\tD3DXMatrixInverse(&matCamState, NULL, &m_matView);\n\t\tmemcpy(&vRight, &matCamState.m[0][0], sizeof(D3DXVECTOR3));\n\t\tD3DXVec3Normalize(&vRight, &vRight);\n\n\t\tm_vEye += vRight * m_fCameraSpeed * fTime;\n\t\tm_vAt += vRight * m_fCameraSpeed * fTime;\n\n\t\t\/\/m_vAt.x += m_fCameraSpeed * fTime;\n\t}\n\n\tif (CInput::GetInstance()->GetDIKeyState(DIK_W) & 0x80)\n\t{\n\t\tD3DXVECTOR3\t\tvLook;\n\t\tvLook = m_vAt - m_vEye;\n\t\tD3DXVec3Normalize(&vLook, &vLook);\n\n\t\tm_vEye += vLook * m_fCameraSpeed * fTime;\n\t\tm_vAt += vLook * m_fCameraSpeed * fTime;\n\n\t\t\/\/m_pInfo->m_vDir.y = 0.f;\n\t\t\/\/m_vAt += m_pInfo->m_vDir * fTime * m_fCameraSpeed * -1.f;\n\t}\n\n\tif (CInput::GetInstance()->GetDIKeyState(DIK_S) & 0x80)\n\t{\n\t\tD3DXVECTOR3\t\tvLook;\n\t\tvLook = m_vAt - m_vEye;\n\t\tD3DXVec3Normalize(&vLook, &vLook);\n\n\t\tm_vEye -= vLook * m_fCameraSpeed * fTime;\n\t\tm_vAt -= vLook * m_fCameraSpeed * fTime;\n\n\t\t\/\/m_pInfo->m_vDir.y = 0.f;\n\t\t\/\/m_vAt -= m_pInfo->m_vDir * fTime * m_fCameraSpeed * -1.f;\n\t}\n\n\tif (CInput::GetInstance()->GetDIKeyState(DIK_F11) & 0x80)\n\t{\n\t\tif (m_bDebugCam == true)\n\t\t\tm_bDebugCam = false;\n\n\n\t}\n\n\tif (CInput::GetInstance()->GetDIKeyState(DIK_F12) & 0x80)\n\t{\n\t\tif (m_bDebugCam == false)\n\t\t\tm_bDebugCam = true;\n\t}\n\n\n}\n\nvoid CCamera::FixMouse(void)\n{\n\tPOINT ptMouse;\n\tZeroMemory(&ptMouse, sizeof(POINT));\n\tptMouse.x;\n\n\tptMouse.x = WINCX >> 1;\n\tptMouse.y = WINCY >> 1;\n\n\n\tClientToScreen(g_hWnd, &ptMouse);\n\n\t\n\tif (m_bMouseFix == true)\n\t\tSetCursorPos(ptMouse.x, ptMouse.y);\n\n}\n\nvoid CCamera::MouseMove(void)\n{\n\tint iInput = 0;\n\n\tif (m_bMouseFix == false)\n\t\treturn;\n\n\n\tfloat\tfTime = CTimeMgr::GetInstance()->GetTime();\n\tint\t\tiDistance = 0;\n\n\tif (iDistance = CInput::GetInstance()->GetDIMouseMove(CInput::DIM_X))\n\t{\n\t\tD3DXMATRIX\t\tmatAxis;\n\t\tD3DXMatrixRotationAxis(&matAxis, &D3DXVECTOR3(0.f, 1.f, 0.f), D3DXToRadian(iDistance \/ 10.f));\n\n\t\tD3DXVECTOR3\t\tvDir;\n\t\tvDir = m_vAt - m_vEye;\n\t\tD3DXVec3TransformNormal(&vDir, &vDir, &matAxis);\n\n\t\tm_vAt = m_vEye + vDir;\n\n\t}\n\n\tif (iDistance = CInput::GetInstance()->GetDIMouseMove(CInput::DIM_Y))\n\t{\n\t\tD3DXVECTOR3\t\tvRight;\n\t\tD3DXMATRIX\t\tmatCamState;\n\n\t\tD3DXMatrixInverse(&matCamState, NULL, &m_matView);\n\t\tmemcpy(&vRight, &matCamState.m[0][0], sizeof(D3DXVECTOR3));\n\t\tD3DXVec3Normalize(&vRight, &vRight);\n\n\t\tD3DXMATRIX\t\tmatAxis;\n\t\tD3DXMatrixRotationAxis(&matAxis, &vRight, D3DXToRadian(iDistance \/ 10.f));\n\n\t\tD3DXVECTOR3\t\tvDir;\n\t\tvDir = m_vAt - m_vEye;\n\t\tD3DXVec3TransformNormal(&vDir, &vDir, &matAxis);\n\n\t\tm_vAt = m_vEye + vDir;\n\t}\n}\n\nvoid CCamera::TargetRenewal(void)\n{\n\t\/\/m_vEye = m_pTargetInfo->m_vDir * (-1);\n\t\/\/D3DXVec3Normalize(&m_vEye, &m_vEye);\n\n\t\/\/m_vEye *= m_fCameraDistance;\n\n\tD3DXVECTOR3\t\tvRight;\n\tmemcpy(&vRight, &m_pTargetInfo->m_matWorld.m[0][0], sizeof(float) * 3);\n\n\tD3DXMATRIX\t\tmatRotAxis;\n\n\t\/\/m_fAngle = m_pTargetInfo->m_fAngle[ANGLE_Y];\n\n\tD3DXMatrixRotationAxis(&matRotAxis, &vRight, m_fAngle);\n\tD3DXVec3TransformNormal(&m_vEye, &m_vEye, &matRotAxis);\n\n\tm_vEye.x = m_pTargetInfo->m_vPos.x + m_vTarget.x;\n\tm_vEye.y = m_pTargetInfo->m_vPos.y + m_vTarget.y;\n\tm_vEye.z = m_pTargetInfo->m_vPos.z + m_vTarget.z;\n\n\tm_vAt = m_pTargetInfo->m_vPos;\n\n\tMakeView();\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\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 \"ConvProjection.h\"\n#include \"paddle\/utils\/Stat.h\"\n\nnamespace paddle {\n\nREGISTER_PROJECTION(conv, ConvProjection);\n\nThreadLocalD<std::vector<MemoryHandle *>> ConvProjection::convMem_;\n\nConvProjection::ConvProjection(const ProjectionConfig &config,\n                               ParameterPtr parameter,\n                               bool useGpu)\n    : Projection(config, parameter, useGpu) {\n  CHECK(useGpu);  \/\/ only support GPU\n  getConvParams();\n  initCudnn();\n\n  size_t height = filterH_ * filterW_ * channels_ \/ groups_;\n  size_t width = numFilters_;\n  weight_.reset(new Weight(height, width, parameter));\n  weightOffset_ = height * width \/ groups_;\n}\n\nvoid ConvProjection::getConvParams() {\n  const ConvConfig &conf = config_.conv_conf();\n  paddingH_ = conf.padding_y();\n  paddingW_ = conf.padding();\n\n  strideH_ = conf.stride_y();\n  strideW_ = conf.stride();\n\n  filterH_ = conf.filter_size_y();\n  filterW_ = conf.filter_size();\n\n  configImgH_ = conf.has_img_size_y() ? conf.img_size_y() : conf.img_size();\n  configImgW_ = conf.img_size();\n\n  channels_ = conf.channels();\n  numFilters_ = config_.num_filters();\n\n  groups_ = conf.groups();\n  CHECK_EQ(channels_ % groups_, 0);\n  CHECK_EQ(numFilters_ % groups_, 0);\n}\n\nvoid ConvProjection::initCudnn() {\n  hl_create_filter_descriptor(&filterDesc_,\n                              channels_ \/ groups_,\n                              numFilters_ \/ groups_,\n                              filterH_,\n                              filterW_);\n  hl_create_tensor_descriptor(&inputDesc_);\n  hl_create_tensor_descriptor(&outputDesc_);\n  hl_create_convolution_descriptor(&convDesc_,\n                                   inputDesc_,\n                                   filterDesc_,\n                                   paddingH_,\n                                   paddingW_,\n                                   strideH_,\n                                   strideW_);\n\n  \/\/ initialize all to default algorithms\n  fwdAlgo_ = 0;\n  bwdFilterAlgo_ = 0;\n  bwdDataAlgo_ = 0;\n  fwdLimitBytes_ = 0;\n  bwdDataLimitBytes_ = 0;\n  bwdFilterLimitBytes_ = 0;\n  workSpaceInBytes_ = 0;\n\n  batchNum_ = 0;\n  isSelectAlgo_ = false;\n}\n\nvoid ConvProjection::reshapeTensorDesc(int batchSize) {\n  hl_tensor_reshape(inputDesc_,\n                    batchSize,\n                    channels_ \/ groups_,\n                    imageH_,\n                    imageW_,\n                    channels_ * imageH_ * imageW_,\n                    imageH_ * imageW_,\n                    imageW_,\n                    1);\n  hl_reset_convolution_descriptor(convDesc_,\n                                  inputDesc_,\n                                  filterDesc_,\n                                  paddingH_,\n                                  paddingW_,\n                                  strideH_,\n                                  strideW_);\n\n  \/\/ The stride between two consecutive images in ConvProjection may not be 1,\n  \/\/ for example, in the case of layer ConcatenateLayer2 with two\n  \/\/ ConvProjection, the stride is the output_size of layer ConcatenateLayer2.\n  \/\/ So the calculation of nStride is different from CudnnConvLayer.\n  \/\/ In fact, only \"nStride = out_->value->getStride()\" is ok.\n  size_t nStride = numFilters_ * outputH_ * outputW_;\n  if (out_->value->isContiguous()) {\n    CHECK_EQ(nStride, out_->value->getWidth());\n  } else {\n    nStride = out_->value->getStride();\n  }\n\n  hl_tensor_reshape(outputDesc_,\n                    batchSize,\n                    numFilters_ \/ groups_,\n                    outputH_,\n                    outputW_,\n                    nStride,\n                    outputH_ * outputW_,\n                    outputW_,\n                    1);\n}\n\nvoid ConvProjection::reshape(int batchSize) {\n  size_t width = calOutputSize();\n  CHECK_EQ(width, out_->value->getWidth());\n\n  isSelectAlgo_ = (batchSize == batchNum_);\n  batchNum_ = batchSize;\n\n  if (!isSelectAlgo_) {\n    reshapeTensorDesc(batchSize);\n    hl_conv_workspace(inputDesc_,\n                      outputDesc_,\n                      filterDesc_,\n                      convDesc_,\n                      &fwdAlgo_,\n                      &fwdLimitBytes_,\n                      &bwdDataAlgo_,\n                      &bwdDataLimitBytes_,\n                      &bwdFilterAlgo_,\n                      &bwdFilterLimitBytes_);\n\n    size_t maxWorkSpace = 0;\n    maxWorkSpace = std::max(fwdLimitBytes_, bwdDataLimitBytes_);\n    maxWorkSpace = std::max(maxWorkSpace, bwdFilterLimitBytes_);\n    workSpaceInBytes_ = maxWorkSpace;\n\n    VLOG(3) << getName() << \" Fwd \/ BwdData \/ BwdFilter algo: \" << fwdAlgo_\n            << \" \/ \" << bwdDataAlgo_ << \" \/ \" << bwdFilterAlgo_;\n  }\n\n  isSelectAlgo_ = true;\n}\n\nvoid ConvProjection::forward() {\n  int batchSize = in_->value->getHeight();\n  reshape(batchSize);\n\n  void *workSpace = NULL;\n  if (workSpaceInBytes_ > 0) {\n    workSpace = getSpaceBytes(workSpaceInBytes_);\n  }\n\n  for (int g = 0; g < groups_; ++g) {\n    REGISTER_TIMER_INFO(\"CudnnConvFwTimer\", getName().c_str());\n\n    real *inputData = in_->value->getData() + g * inputOffset_;\n    real *wgtData = weight_->getW()->getData() + g * weightOffset_;\n    real *outData = out_->value->getData() + g * outputOffset_;\n    hl_convolution_forward(inputDesc_,\n                           inputData,\n                           outputDesc_,\n                           outData,\n                           filterDesc_,\n                           wgtData,\n                           convDesc_,\n                           workSpace,\n                           fwdLimitBytes_,\n                           fwdAlgo_);\n  }\n}\n\nvoid ConvProjection::backward(const UpdateCallback &callback) {\n  REGISTER_TIMER_INFO(\"CudnnConvBpTimer\", getName().c_str());\n\n  void *workSpace = NULL;\n  if (workSpaceInBytes_ > 0) {\n    workSpace = getSpaceBytes(workSpaceInBytes_);\n  }\n\n  for (int g = 0; g < groups_; ++g) {\n    real *outGrad = out_->grad->getData() + g * outputOffset_;\n    if (weight_->getWGrad()) {\n      real *inputData = in_->value->getData() + g * inputOffset_;\n      real *weightGrad = weight_->getWGrad()->getData() + g * weightOffset_;\n      hl_convolution_backward_filter(inputDesc_,\n                                     inputData,\n                                     outputDesc_,\n                                     outGrad,\n                                     filterDesc_,\n                                     weightGrad,\n                                     convDesc_,\n                                     workSpace,\n                                     bwdFilterLimitBytes_,\n                                     bwdFilterAlgo_);\n    }\n\n    MatrixPtr preGrad = in_->grad;\n    if (NULL != preGrad) {\n      real *inputGrad = preGrad->getData() + g * inputOffset_;\n      real *wgtData = weight_->getW()->getData() + g * weightOffset_;\n      hl_convolution_backward_data(inputDesc_,\n                                   inputGrad,\n                                   outputDesc_,\n                                   outGrad,\n                                   filterDesc_,\n                                   wgtData,\n                                   convDesc_,\n                                   workSpace,\n                                   bwdDataLimitBytes_,\n                                   bwdDataAlgo_);\n    }\n  }\n\n  weight_->getParameterPtr()->incUpdate(callback);\n}\n\nvoid *ConvProjection::getSpaceBytes(size_t size) {\n  std::vector<MemoryHandle *> &convMem = *convMem_;\n  if (convMem.empty()) {\n    int numDevices = hl_get_device_count();\n    convMem.resize(numDevices);\n  }\n\n  int devId = hl_get_device();\n  MemoryHandle **localMem = &(convMem[devId]);\n  if (NULL == *localMem || size > (*localMem)->getAllocSize()) {\n    *localMem = new GpuMemoryHandle(size);\n  }\n  return (*localMem)->getBuf();\n}\n\nConvProjection::~ConvProjection() {\n  hl_destroy_tensor_descriptor(inputDesc_);\n  hl_destroy_tensor_descriptor(outputDesc_);\n  hl_destroy_filter_descriptor(filterDesc_);\n  hl_destroy_convolution_descriptor(convDesc_);\n}\n\n}  \/\/ namespace paddle\n<commit_msg>Check the input size for convolution.<commit_after>\/* Copyright (c) 2016 PaddlePaddle Authors. All Rights Reserve.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License. *\/\n\n#include \"ConvProjection.h\"\n#include \"paddle\/utils\/Stat.h\"\n\nnamespace paddle {\n\nREGISTER_PROJECTION(conv, ConvProjection);\n\nThreadLocalD<std::vector<MemoryHandle *>> ConvProjection::convMem_;\n\nConvProjection::ConvProjection(const ProjectionConfig &config,\n                               ParameterPtr parameter,\n                               bool useGpu)\n    : Projection(config, parameter, useGpu) {\n  CHECK(useGpu);  \/\/ only support GPU\n  getConvParams();\n  initCudnn();\n\n  size_t height = filterH_ * filterW_ * channels_ \/ groups_;\n  size_t width = numFilters_;\n  weight_.reset(new Weight(height, width, parameter));\n  weightOffset_ = height * width \/ groups_;\n}\n\nvoid ConvProjection::getConvParams() {\n  const ConvConfig &conf = config_.conv_conf();\n  paddingH_ = conf.padding_y();\n  paddingW_ = conf.padding();\n\n  strideH_ = conf.stride_y();\n  strideW_ = conf.stride();\n\n  filterH_ = conf.filter_size_y();\n  filterW_ = conf.filter_size();\n\n  configImgH_ = conf.has_img_size_y() ? conf.img_size_y() : conf.img_size();\n  configImgW_ = conf.img_size();\n\n  channels_ = conf.channels();\n  numFilters_ = config_.num_filters();\n\n  groups_ = conf.groups();\n  CHECK_EQ(channels_ % groups_, 0);\n  CHECK_EQ(numFilters_ % groups_, 0);\n}\n\nvoid ConvProjection::initCudnn() {\n  hl_create_filter_descriptor(&filterDesc_,\n                              channels_ \/ groups_,\n                              numFilters_ \/ groups_,\n                              filterH_,\n                              filterW_);\n  hl_create_tensor_descriptor(&inputDesc_);\n  hl_create_tensor_descriptor(&outputDesc_);\n  hl_create_convolution_descriptor(&convDesc_,\n                                   inputDesc_,\n                                   filterDesc_,\n                                   paddingH_,\n                                   paddingW_,\n                                   strideH_,\n                                   strideW_);\n\n  \/\/ initialize all to default algorithms\n  fwdAlgo_ = 0;\n  bwdFilterAlgo_ = 0;\n  bwdDataAlgo_ = 0;\n  fwdLimitBytes_ = 0;\n  bwdDataLimitBytes_ = 0;\n  bwdFilterLimitBytes_ = 0;\n  workSpaceInBytes_ = 0;\n\n  batchNum_ = 0;\n  isSelectAlgo_ = false;\n}\n\nvoid ConvProjection::reshapeTensorDesc(int batchSize) {\n  hl_tensor_reshape(inputDesc_,\n                    batchSize,\n                    channels_ \/ groups_,\n                    imageH_,\n                    imageW_,\n                    channels_ * imageH_ * imageW_,\n                    imageH_ * imageW_,\n                    imageW_,\n                    1);\n  hl_reset_convolution_descriptor(convDesc_,\n                                  inputDesc_,\n                                  filterDesc_,\n                                  paddingH_,\n                                  paddingW_,\n                                  strideH_,\n                                  strideW_);\n\n  \/\/ The stride between two consecutive images in ConvProjection may not be 1,\n  \/\/ for example, in the case of layer ConcatenateLayer2 with two\n  \/\/ ConvProjection, the stride is the output_size of layer ConcatenateLayer2.\n  \/\/ So the calculation of nStride is different from CudnnConvLayer.\n  \/\/ In fact, only \"nStride = out_->value->getStride()\" is ok.\n  size_t nStride = numFilters_ * outputH_ * outputW_;\n  if (out_->value->isContiguous()) {\n    CHECK_EQ(nStride, out_->value->getWidth());\n  } else {\n    nStride = out_->value->getStride();\n  }\n\n  hl_tensor_reshape(outputDesc_,\n                    batchSize,\n                    numFilters_ \/ groups_,\n                    outputH_,\n                    outputW_,\n                    nStride,\n                    outputH_ * outputW_,\n                    outputW_,\n                    1);\n}\n\nvoid ConvProjection::reshape(int batchSize) {\n  size_t width = calOutputSize();\n  CHECK_EQ(width, out_->value->getWidth());\n  CHECK_EQ(channels_ * imageH_ * imageW_, in_->value->getWidth())\n          << \"Wrong input size for convolution\"\n          << \" channels=\" << channels_\n          << \" imageH=\" << imageH_\n          << \" imageW=\" << imageW_\n          << \" inputSize=\" << in_->value->getWidth();\n\n  isSelectAlgo_ = (batchSize == batchNum_);\n  batchNum_ = batchSize;\n\n  if (!isSelectAlgo_) {\n    reshapeTensorDesc(batchSize);\n    hl_conv_workspace(inputDesc_,\n                      outputDesc_,\n                      filterDesc_,\n                      convDesc_,\n                      &fwdAlgo_,\n                      &fwdLimitBytes_,\n                      &bwdDataAlgo_,\n                      &bwdDataLimitBytes_,\n                      &bwdFilterAlgo_,\n                      &bwdFilterLimitBytes_);\n\n    size_t maxWorkSpace = 0;\n    maxWorkSpace = std::max(fwdLimitBytes_, bwdDataLimitBytes_);\n    maxWorkSpace = std::max(maxWorkSpace, bwdFilterLimitBytes_);\n    workSpaceInBytes_ = maxWorkSpace;\n\n    VLOG(3) << getName() << \" Fwd \/ BwdData \/ BwdFilter algo: \" << fwdAlgo_\n            << \" \/ \" << bwdDataAlgo_ << \" \/ \" << bwdFilterAlgo_;\n  }\n\n  isSelectAlgo_ = true;\n}\n\nvoid ConvProjection::forward() {\n  int batchSize = in_->value->getHeight();\n  reshape(batchSize);\n\n  void *workSpace = NULL;\n  if (workSpaceInBytes_ > 0) {\n    workSpace = getSpaceBytes(workSpaceInBytes_);\n  }\n\n  for (int g = 0; g < groups_; ++g) {\n    REGISTER_TIMER_INFO(\"CudnnConvFwTimer\", getName().c_str());\n\n    real *inputData = in_->value->getData() + g * inputOffset_;\n    real *wgtData = weight_->getW()->getData() + g * weightOffset_;\n    real *outData = out_->value->getData() + g * outputOffset_;\n    hl_convolution_forward(inputDesc_,\n                           inputData,\n                           outputDesc_,\n                           outData,\n                           filterDesc_,\n                           wgtData,\n                           convDesc_,\n                           workSpace,\n                           fwdLimitBytes_,\n                           fwdAlgo_);\n  }\n}\n\nvoid ConvProjection::backward(const UpdateCallback &callback) {\n  REGISTER_TIMER_INFO(\"CudnnConvBpTimer\", getName().c_str());\n\n  void *workSpace = NULL;\n  if (workSpaceInBytes_ > 0) {\n    workSpace = getSpaceBytes(workSpaceInBytes_);\n  }\n\n  for (int g = 0; g < groups_; ++g) {\n    real *outGrad = out_->grad->getData() + g * outputOffset_;\n    if (weight_->getWGrad()) {\n      real *inputData = in_->value->getData() + g * inputOffset_;\n      real *weightGrad = weight_->getWGrad()->getData() + g * weightOffset_;\n      hl_convolution_backward_filter(inputDesc_,\n                                     inputData,\n                                     outputDesc_,\n                                     outGrad,\n                                     filterDesc_,\n                                     weightGrad,\n                                     convDesc_,\n                                     workSpace,\n                                     bwdFilterLimitBytes_,\n                                     bwdFilterAlgo_);\n    }\n\n    MatrixPtr preGrad = in_->grad;\n    if (NULL != preGrad) {\n      real *inputGrad = preGrad->getData() + g * inputOffset_;\n      real *wgtData = weight_->getW()->getData() + g * weightOffset_;\n      hl_convolution_backward_data(inputDesc_,\n                                   inputGrad,\n                                   outputDesc_,\n                                   outGrad,\n                                   filterDesc_,\n                                   wgtData,\n                                   convDesc_,\n                                   workSpace,\n                                   bwdDataLimitBytes_,\n                                   bwdDataAlgo_);\n    }\n  }\n\n  weight_->getParameterPtr()->incUpdate(callback);\n}\n\nvoid *ConvProjection::getSpaceBytes(size_t size) {\n  std::vector<MemoryHandle *> &convMem = *convMem_;\n  if (convMem.empty()) {\n    int numDevices = hl_get_device_count();\n    convMem.resize(numDevices);\n  }\n\n  int devId = hl_get_device();\n  MemoryHandle **localMem = &(convMem[devId]);\n  if (NULL == *localMem || size > (*localMem)->getAllocSize()) {\n    *localMem = new GpuMemoryHandle(size);\n  }\n  return (*localMem)->getBuf();\n}\n\nConvProjection::~ConvProjection() {\n  hl_destroy_tensor_descriptor(inputDesc_);\n  hl_destroy_tensor_descriptor(outputDesc_);\n  hl_destroy_filter_descriptor(filterDesc_);\n  hl_destroy_convolution_descriptor(convDesc_);\n}\n\n}  \/\/ namespace paddle\n<|endoftext|>"}
{"text":"<commit_before>#ifndef GUARD_ROCBLAS_MANAGE_PTR_HPP\r\n#define GUARD_ROCBLAS_MANAGE_PTR_HPP\r\n\r\n#include <memory>\r\n\r\n#define PRINT_IF_HIP_ERROR(INPUT_STATUS_FOR_CHECK) {\\\r\n    hipError_t TMP_STATUS_FOR_CHECK = INPUT_STATUS_FOR_CHECK; \\\r\n    if (TMP_STATUS_FOR_CHECK != hipSuccess) { \\\r\n        fprintf(stderr, \"hip error code: %d at %s:%d\\n\",  TMP_STATUS_FOR_CHECK,__FILE__, __LINE__); \\\r\n} }\r\n\r\n\r\nnamespace hipblas\r\n{\r\n    \/\/ device_malloc wraps hipMalloc and provides same API as malloc\r\n    static void* device_malloc(size_t byte_size)\r\n    {\r\n        void *pointer;\r\n        PRINT_IF_HIP_ERROR(hipMalloc(&pointer, byte_size));\r\n        return pointer;\r\n    }\r\n\r\n    \/\/ device_free wraps hipFree and provides same API as free\r\n    static void device_free(void *ptr)\r\n    {   \r\n        PRINT_IF_HIP_ERROR(hipFree(ptr));\r\n    }\r\n\r\n} \/\/ namespace hipblas\r\n\r\nusing hipblas_unique_ptr = std::unique_ptr<void, void(*)(void*)>;\r\n\r\n#endif\r\n<commit_msg>correct typo (#44)<commit_after>#ifndef GUARD_HIPBLAS_MANAGE_PTR_HPP\r\n#define GUARD_HIPBLAS_MANAGE_PTR_HPP\r\n\r\n#include <memory>\r\n\r\n#define PRINT_IF_HIP_ERROR(INPUT_STATUS_FOR_CHECK) {\\\r\n    hipError_t TMP_STATUS_FOR_CHECK = INPUT_STATUS_FOR_CHECK; \\\r\n    if (TMP_STATUS_FOR_CHECK != hipSuccess) { \\\r\n        fprintf(stderr, \"hip error code: %d at %s:%d\\n\",  TMP_STATUS_FOR_CHECK,__FILE__, __LINE__); \\\r\n} }\r\n\r\n\r\nnamespace hipblas\r\n{\r\n    \/\/ device_malloc wraps hipMalloc and provides same API as malloc\r\n    static void* device_malloc(size_t byte_size)\r\n    {\r\n        void *pointer;\r\n        PRINT_IF_HIP_ERROR(hipMalloc(&pointer, byte_size));\r\n        return pointer;\r\n    }\r\n\r\n    \/\/ device_free wraps hipFree and provides same API as free\r\n    static void device_free(void *ptr)\r\n    {   \r\n        PRINT_IF_HIP_ERROR(hipFree(ptr));\r\n    }\r\n\r\n} \/\/ namespace hipblas\r\n\r\nusing hipblas_unique_ptr = std::unique_ptr<void, void(*)(void*)>;\r\n\r\n#endif\r\n<|endoftext|>"}
{"text":"<commit_before>#include \"ros\/ros.h\"\n#include <sensor_msgs\/JointState.h>\n\/\/ include lib_franka ...\n\n\nint main(int argc, char **argv)\n{\n    ros::init(argc, argv, \"simple_viz_node\");\n    ros::NodeHandle nh(\"~\");\n    ros::NodeHandle nhp;\n    ros::Rate rate(1000);\n    ros::Publisher joint_pub = nhp.advertise<sensor_msgs::JointState>(\"joint_state\", 1);\n    std::vector<std::string> joint_names;\n    sensor_msgs::JointState states;\n\n    \/\/ parse yaml with joint names into joint_names..\n    XmlRpc::XmlRpcValue params;\n    nh.getParam(\"joint_names\", params);\n    joint_names.resize(params.size());\n    for (int i=0; i<params.size(); ++i)\n    {\n        joint_names[i]= static_cast<std::string>(params[i]);\n        ROS_INFO(\"joint %d: %s\", i, joint_names[i].c_str());\n    }\n\n    states.effort.resize(joint_names.size());\n    states.name.resize(joint_names.size());\n    states.position.resize(joint_names.size());\n    states.velocity.resize(joint_names.size());\n\n    std::vector<double> dummy;\n    dummy.resize(joint_names.size());\n    for (int i=0; i<dummy.size(); ++i)\n    {\n        dummy[i]= 0.0f;\n    }\n\n    while(ros::ok())\n    {\n        \/\/ read sensors from franka using libfranka\n\n        \/\/ update joint_states to msgs\n        states.header.stamp = ros::Time::now();\n        for (int i=0; i<joint_names.size(); ++i)\n        {\n            states.name.at(i) = joint_names.at(i);\n            states.position.at(i) = dummy.at(i);\n            states.velocity.at(i) = dummy.at(i);\n            states.effort.at(i) = dummy.at(i);\n        }\n\n        joint_pub.publish(states);\n        ros::spinOnce();\n        rate.sleep();\n    }\n\n    return 0;\n}\n<commit_msg>format for google style<commit_after>#include <sensor_msgs\/JointState.h>\n#include \"ros\/ros.h\"\n\/\/ include lib_franka ...\n\nint main(int argc, char **argv) {\n  ros::init(argc, argv, \"simple_viz_node\");\n  ros::NodeHandle nh(\"~\");\n  ros::NodeHandle nhp;\n  ros::Rate rate(1000);\n  ros::Publisher joint_pub =\n      nhp.advertise<sensor_msgs::JointState>(\"joint_state\", 1);\n  std::vector<std::string> joint_names;\n  sensor_msgs::JointState states;\n\n  \/\/ parse yaml with joint names into joint_names..\n  XmlRpc::XmlRpcValue params;\n  nh.getParam(\"joint_names\", params);\n  joint_names.resize(params.size());\n  for (int i = 0; i < params.size(); ++i) {\n    joint_names[i] = static_cast<std::string>(params[i]);\n    ROS_INFO(\"joint %d: %s\", i, joint_names[i].c_str());\n  }\n\n  states.effort.resize(joint_names.size());\n  states.name.resize(joint_names.size());\n  states.position.resize(joint_names.size());\n  states.velocity.resize(joint_names.size());\n\n  std::vector<double> dummy;\n  dummy.resize(joint_names.size());\n  for (int i = 0; i < dummy.size(); ++i) {\n    dummy[i] = 0.0f;\n  }\n\n  while (ros::ok()) {\n    \/\/ read sensors from franka using libfranka\n\n    \/\/ update joint_states to msgs\n    states.header.stamp = ros::Time::now();\n    for (int i = 0; i < joint_names.size(); ++i) {\n      states.name.at(i) = joint_names.at(i);\n      states.position.at(i) = dummy.at(i);\n      states.velocity.at(i) = dummy.at(i);\n      states.effort.at(i) = dummy.at(i);\n    }\n\n    joint_pub.publish(states);\n    ros::spinOnce();\n    rate.sleep();\n  }\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * File    : T.cpp\n * Author  : Kazune Takahashi\n * Created : 2\/4\/2019, 11:51:23 AM\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>\n#include <numeric>\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;\nconst ll MOD = 1000000007;\n\n\/\/ https:\/\/atcoder.jp\/contests\/tdpc\/submissions\/4169434 を参考にする。\n\ntypedef vector<ll> Poly;\n\nll mod_power(ll x, ll k)\n{\n  if (k == 0)\n  {\n    return 1;\n  }\n  if (k % 2 == 0)\n  {\n    ll t = mod_power(x, k \/ 2);\n    return (t * t) % MOD;\n  }\n  return (mod_power(x, k - 1) * x) % MOD;\n}\n\nll mod_rev(ll x)\n{\n  return mod_power(x, MOD - 2);\n}\n\nvoid reduce(Poly &v)\n{\n  while (!v.empty() && v.back() % MOD != 0)\n  {\n    v.pop_back();\n  }\n}\n\nPoly X_k(int k, ll a)\n{\n  vector<ll> p(k + 1, 0);\n  p[k] = a % MOD;\n  return p;\n}\n\nPoly X_k(int k)\n{\n  vector<ll> p(k + 1, 0);\n  p[k] = 1;\n  return p;\n}\n\nbool is_zero(Poly p)\n{\n  reduce(p);\n  return p.empty();\n}\n\nPoly operator+(Poly p, Poly q)\n{\n  reduce(p);\n  reduce(q);\n  if (p.size() < q.size())\n  {\n    return q + p;\n  }\n  else\n  {\n    for (auto i = 0; i < (int)q.size(); i++)\n    {\n      p[i] += q[i];\n      p[i] %= MOD;\n    }\n  }\n  reduce(p);\n  return p;\n}\n\nPoly operator-(Poly p)\n{\n  reduce(p);\n  for (auto i = 0; i < (int)p.size(); i++)\n  {\n    p[i] %= MOD;\n    p[i] = MOD - p[i];\n    p[i] %= MOD;\n  }\n  reduce(p);\n  return p;\n}\n\nPoly operator-(Poly p, Poly q)\n{\n  return p + (-q);\n}\n\nPoly operator*(Poly p, Poly q)\n{\n  reduce(p);\n  reduce(q);\n  Poly res(p.size() + q.size() - 1, 0);\n  for (auto i = 0; i < (int)res.size(); i++)\n  {\n    for (auto j = 0; j <= i; j++)\n    {\n      if (j < (int)p.size() && i - j < (int)q.size())\n      {\n        res[i] += (p[j] * q[i - j]) % MOD;\n        res[i] %= MOD;\n      }\n    }\n  }\n  reduce(res);\n  return res;\n}\n\nPoly operator*(Poly p, ll k)\n{\n  reduce(p);\n  Poly res(p.size());\n  for (auto i = 0; i < (int)p.size(); i++)\n  {\n    res[i] = (p[i] * k) % MOD;\n  }\n  reduce(res);\n  return res;\n}\n\nPoly operator*(ll k, Poly p)\n{\n  return p * k;\n}\n\nPoly monic(Poly p)\n{\n  reduce(p);\n  if (is_zero(p))\n  {\n    return p;\n  }\n  ll m = p.back();\n  ll rev_m = mod_rev(m);\n  return rev_m * p;\n}\n\nbool is_monic(const Poly &p)\n{\n  return (p.back() == 1);\n}\n\nPoly shift(Poly &p, int k)\n{\n  reduce(p);\n  Poly res(p.size() + k);\n  for (auto i = 0; i < k; i++)\n  {\n    res[i] = 0;\n  }\n  for (auto i = k; i < (int)res.size(); i++)\n  {\n    res[i] = p[i - k];\n  }\n  return res;\n}\n\nPoly operator%(Poly p, Poly q)\n{\n  reduce(p);\n  reduce(q);\n  if (p.size() < q.size())\n  {\n    return p;\n  }\n  if (!is_monic(q))\n  {\n    return p % monic(q);\n  }\n  Poly s_q = shift(q, p.size() - q.size());\n  Poly res = (p - p.back() * s_q);\n  reduce(res);\n  return res % q;\n}\n\nPoly mod_power(Poly q, ll k)\n{\n  if (k == 0)\n  {\n    return {1};\n  }\n  if (k % 2 == 0)\n  {\n    Poly t = mod_power(q, k \/ 2);\n    return (t * t) % q;\n  }\n  return (mod_power(q, k - 1) * X_k(1)) % q;\n}\n\nll K, N;\nPoly k;\nvector<ll> a;\n\nint main()\n{\n  cin >> K >> N;\n  if (N <= K)\n  {\n    return 1;\n  }\n  k = Poly(K + 1);\n  for (auto i = 0; i < K; i++)\n  {\n    k[i] = 1;\n  }\n  k[K] = 1;\n  for (auto i = 0; i < K; i++)\n  {\n    a[i] = 1;\n  }\n  for (auto i = K; i < 2 * K - 1; i++)\n  {\n    a[i] = 0;\n    for (auto j = 0; j < K; j++)\n    {\n      a[i] += (a[i - 1 - j] * k[K - 1 - j]) % MOD;\n      a[i] %= MOD;\n    }\n  }\n  cerr << \"aaa\" << endl;\n  for (auto i = 0; i < K; i++)\n  {\n    k[i] = MOD - k[i];\n    k[i] %= MOD;\n  }\n  Poly f = mod_power(k, N - 1 - K);\n  ll ans = 0;\n  for (auto i = 0; i < min(K, (ll)f.size()); i++)\n  {\n    ans += f[i] * a[K - 1 + i];\n    ans %= MOD;\n  }\n  cout << ans << endl;\n}<commit_msg>tried T.cpp to 'T'<commit_after>\/**\n * File    : T.cpp\n * Author  : Kazune Takahashi\n * Created : 2\/4\/2019, 11:51:23 AM\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>\n#include <numeric>\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;\nconst ll MOD = 1000000007;\n\n\/\/ https:\/\/atcoder.jp\/contests\/tdpc\/submissions\/4169434 を参考にする。\n\ntypedef vector<ll> Poly;\n\nll mod_power(ll x, ll k)\n{\n  if (k == 0)\n  {\n    return 1;\n  }\n  if (k % 2 == 0)\n  {\n    ll t = mod_power(x, k \/ 2);\n    return (t * t) % MOD;\n  }\n  return (mod_power(x, k - 1) * x) % MOD;\n}\n\nll mod_rev(ll x)\n{\n  return mod_power(x, MOD - 2);\n}\n\nvoid reduce(Poly &v)\n{\n  while (!v.empty() && v.back() % MOD != 0)\n  {\n    v.pop_back();\n  }\n}\n\nPoly X_k(int k, ll a)\n{\n  vector<ll> p(k + 1, 0);\n  p[k] = a % MOD;\n  return p;\n}\n\nPoly X_k(int k)\n{\n  vector<ll> p(k + 1, 0);\n  p[k] = 1;\n  return p;\n}\n\nbool is_zero(Poly p)\n{\n  reduce(p);\n  return p.empty();\n}\n\nPoly operator+(Poly p, Poly q)\n{\n  reduce(p);\n  reduce(q);\n  if (p.size() < q.size())\n  {\n    return q + p;\n  }\n  else\n  {\n    for (auto i = 0; i < (int)q.size(); i++)\n    {\n      p[i] += q[i];\n      p[i] %= MOD;\n    }\n  }\n  reduce(p);\n  return p;\n}\n\nPoly operator-(Poly p)\n{\n  reduce(p);\n  for (auto i = 0; i < (int)p.size(); i++)\n  {\n    p[i] %= MOD;\n    p[i] = MOD - p[i];\n    p[i] %= MOD;\n  }\n  reduce(p);\n  return p;\n}\n\nPoly operator-(Poly p, Poly q)\n{\n  return p + (-q);\n}\n\nPoly operator*(Poly p, Poly q)\n{\n  reduce(p);\n  reduce(q);\n  Poly res(p.size() + q.size() - 1, 0);\n  for (auto i = 0; i < (int)res.size(); i++)\n  {\n    for (auto j = 0; j <= i; j++)\n    {\n      if (j < (int)p.size() && i - j < (int)q.size())\n      {\n        res[i] += (p[j] * q[i - j]) % MOD;\n        res[i] %= MOD;\n      }\n    }\n  }\n  reduce(res);\n  return res;\n}\n\nPoly operator*(Poly p, ll k)\n{\n  reduce(p);\n  Poly res(p.size());\n  for (auto i = 0; i < (int)p.size(); i++)\n  {\n    res[i] = (p[i] * k) % MOD;\n  }\n  reduce(res);\n  return res;\n}\n\nPoly operator*(ll k, Poly p)\n{\n  return p * k;\n}\n\nPoly monic(Poly p)\n{\n  reduce(p);\n  if (is_zero(p))\n  {\n    return p;\n  }\n  ll m = p.back();\n  ll rev_m = mod_rev(m);\n  return rev_m * p;\n}\n\nbool is_monic(const Poly &p)\n{\n  return (p.back() == 1);\n}\n\nPoly shift(Poly &p, int k)\n{\n  reduce(p);\n  Poly res(p.size() + k);\n  for (auto i = 0; i < k; i++)\n  {\n    res[i] = 0;\n  }\n  for (auto i = k; i < (int)res.size(); i++)\n  {\n    res[i] = p[i - k];\n  }\n  return res;\n}\n\nPoly operator%(Poly p, Poly q)\n{\n  reduce(p);\n  reduce(q);\n  if (p.size() < q.size())\n  {\n    return p;\n  }\n  if (!is_monic(q))\n  {\n    return p % monic(q);\n  }\n  Poly s_q = shift(q, p.size() - q.size());\n  Poly res = (p - p.back() * s_q);\n  reduce(res);\n  return res % q;\n}\n\nPoly mod_power(Poly q, ll k)\n{\n  if (k == 0)\n  {\n    return {1};\n  }\n  if (k % 2 == 0)\n  {\n    Poly t = mod_power(q, k \/ 2);\n    return (t * t) % q;\n  }\n  return (mod_power(q, k - 1) * X_k(1)) % q;\n}\n\nll K, N;\nPoly k;\nvector<ll> a;\n\nint main()\n{\n  cin >> K >> N;\n  if (N <= K)\n  {\n    cout << 1 << endl;\n    return 0;\n  }\n  cerr << \"aaa\" << endl;\n  k = Poly(K + 1);\n  for (auto i = 0; i < K; i++)\n  {\n    k[i] = 1;\n  }\n  k[K] = 1;\n  for (auto i = 0; i < K; i++)\n  {\n    a[i] = 1;\n  }\n  for (auto i = K; i < 2 * K - 1; i++)\n  {\n    a[i] = 0;\n    for (auto j = 0; j < K; j++)\n    {\n      a[i] += (a[i - 1 - j] * k[K - 1 - j]) % MOD;\n      a[i] %= MOD;\n    }\n  }\n  for (auto i = 0; i < K; i++)\n  {\n    k[i] = MOD - k[i];\n    k[i] %= MOD;\n  }\n  Poly f = mod_power(k, N - 1 - K);\n  ll ans = 0;\n  for (auto i = 0; i < min(K, (ll)f.size()); i++)\n  {\n    ans += f[i] * a[K - 1 + i];\n    ans %= MOD;\n  }\n  cout << ans << endl;\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2009-2011, 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#include <cstdarg>\n#include <typeinfo>\n\n#include <libport\/cstdio>\n#include <libport\/debug.hh>\n\n#include <boost\/thread.hpp>\n\n#include <libport\/containers.hh>\n#include <libport\/foreach.hh>\n#include <libport\/utime.hh>\n\n#include <urbi\/uobject.hh>\n#include <urbi\/ustarter.hh>\n#include <urbi\/ucontext-factory.hh>\n\nGD_CATEGORY(Urbi.UObject);\n\nnamespace urbi\n{\n  namespace impl\n  {\n    std::vector<std::string> listModules()\n    {\n      std::vector<std::string> res;\n      foreach(baseURBIStarter* s, baseURBIStarter::list())\n      {\n        res.push_back(s->name);\n      }\n      return res;\n    }\n  }\n\n  static void noop(impl::UContextImpl*)\n  {\n  }\n\n  static boost::thread_specific_ptr<impl::UContextImpl> current_context(&noop);\n  static impl::UContextImpl* default_context = 0;\n  impl::UContextImpl* getCurrentContext()\n  {\n    impl::UContextImpl* res = current_context.get();\n    return res ? res : default_context;\n  }\n\n  void setCurrentContext(impl::UContextImpl* impl)\n  {\n    if (!default_context)\n      default_context = impl;\n    current_context.reset(impl);\n  }\n\n\n  \/*-------------------.\n  | UGenericCallback.  |\n  `-------------------*\/\n\n  UGenericCallback::UGenericCallback(UObject& owner,\n                                     UVar* target,\n\t\t\t\t     const std::string& type,\n\t\t\t\t     const std::string& name,\n\t\t\t\t     int size,\n                                     impl::UContextImpl* ctx)\n    : UContext(ctx)\n    , nbparam(size)\n    , objname(&owner?owner.__name:\"dummy\")\n    , type(type)\n    , name(name)\n    , target(target)\n    , owner(owner)\n    , synchronous_(true)\n  {\n    if (target)\n      target->check();\n    impl_ = ctx_->getGenericCallbackImpl();\n    impl_->initialize(this, target?target->owned:false);\n  }\n\n  UGenericCallback::UGenericCallback(UObject& owner,\n                                     UVar* target,\n\t\t\t\t     const std::string& type,\n\t\t\t\t     const std::string& name,\n                                     impl::UContextImpl* ctx)\n    : UContext(ctx)\n    , objname(&owner?owner.__name:\"dummy\")\n    , type(type)\n    , name(name)\n    , target(target)\n    , owner(owner)\n    , synchronous_(true)\n  {\n    if (target)\n      target->check();\n    impl_ = ctx_->getGenericCallbackImpl();\n    impl_->initialize(this);\n  }\n\n  UGenericCallback::~UGenericCallback()\n  {\n    impl_->clear();\n    delete impl_;\n  }\n\n  void\n  UGenericCallback::registerCallback()\n  {\n    impl_->registerCallback();\n  }\n\n  bool\n  UGenericCallback::isSynchronous() const\n  {\n    return synchronous_;\n  }\n\n  void\n  UGenericCallback::syncEval(UList& params, OnDone onDone)\n  {\n    UValue res;\n    try {\n      res = __evalcall(params);\n      if (onDone)\n        onDone(res, 0);\n    }\n    catch(const std::exception& e)\n    {\n      if (onDone)\n        onDone(res, &e);\n    }\n    catch(...)\n    {\n      if (onDone)\n      {\n        std::runtime_error e(\"invalid exception\");\n        onDone(res, &e);\n      }\n    }\n  }\n\n  void\n  UGenericCallback::eval(UList& params, OnDone onDone)\n  {\n    if (synchronous_)\n    {\n      syncEval(params, onDone);\n    }\n    else\n    {\n      libport::ThreadPool::rTaskHandle h\n       = threadPool().queueTask(\n                             boost::function0<void>(\n        boost::bind(&UGenericCallback::syncEval, this, params, onDone)),\n        taskLock);\n       GD_FINFO_TRACE(\"Queued async op: with lock %s: %s\", taskLock.get(),\n                      h->getState());\n      if (h->getState() == libport::ThreadPool::TaskHandle::DROPPED)\n      {\n        UValue res;\n        onDone(res, 0);\n      }\n    }\n  }\n\n  \/* Note: to implement the LOCK_MODULE mode, we must delegate search of the\n   * TaskLock to use to a function within the calling module.\n   * That is why we take the TaskLock here and we do not find it ourselve.\n   *\/\n  void\n  UGenericCallback::setAsync(libport::ThreadPool::rTaskLock l)\n  {\n    synchronous_ = false;\n    taskLock = l;\n  }\n\n  libport::ThreadPool&\n  UGenericCallback::threadPool()\n  {\n    static libport::ThreadPool tp;\n    return tp;\n  }\n\n  void\n  setThreadLimit(size_t nThreads)\n  {\n    UGenericCallback::threadPool().resize(nThreads);\n  }\n\n  \/*----------.\n  | UObject.  |\n  `----------*\/\n\n  UObject::UObject(impl::UContextImpl* impl)\n   : UContext(impl)\n   , derived(false)\n   , autogroup(false)\n   , remote(true)\n   , cloner(0)\n   , impl_(ctx_->getObjectImpl())\n   , taskLock_(new libport::ThreadPool::TaskLock)\n {\n   impl_->initialize(this);\n    objecthub = 0;\n  }\n\n  UObject::UObject(int, impl::UContextImpl* impl)\n    : UContext(impl)\n    , __name(\"_dummy\")\n    , classname(\"_dummy\")\n    , derived(false)\n    , autogroup(false)\n    , remote(true)\n    , cloner(0)\n    , impl_(ctx_->getObjectImpl())\n    , taskLock_(new libport::ThreadPool::TaskLock)\n  {\n    impl_->initialize(this);\n    objecthub = 0;\n  }\n\n  \/\/! UObject constructor.\n  UObject::UObject(const std::string& s, impl::UContextImpl* impl)\n    : UContext(impl)\n    , __name(s)\n    , classname(s)\n    , derived(false)\n    , autogroup(false)\n    , remote(true)\n    , cloner(0)\n    , impl_(ctx_->getObjectImpl())\n    , taskLock_(new libport::ThreadPool::TaskLock)\n  {\n    impl_->initialize(this);\n    objecthub = 0;\n    autogroup = false;\n    \/\/ Do not replace this call to init by a `, load(s, \"load\")' as\n    \/\/ both result in \"var <__name>.load = 1\", which is not valid\n    \/\/ until the two above lines actually create <__name>.\n    load.init(__name, \"load\");\n    \/\/ default\n    load = 1;\n  }\n\n  void\n  UObject::addAutoGroup()\n  {\n    UJoinGroup(classname + \"s\");\n  }\n\n  void\n  UObject::UAutoGroup()\n  {\n    autogroup = true;\n  }\n\n  \/\/! UObject destructor.\n  UObject::~UObject()\n  {\n    clean();\n    delete impl_;\n  }\n\n  void\n  UObject::UJoinGroup(const std::string& gpname)\n  {\n    std::string groupregister = \"addgroup \" + gpname +\" { \"+__name+\"};\";\n    send(groupregister);\n  }\n\n  ATTRIBUTE_NORETURN\n  libport::ThreadPool::rTaskLock\n  UObject::getClassTaskLock()\n  {\n    throw std::runtime_error(\"You must redefine getClassTaskLock to use\"\n                             \" asynchronous calls with LOCK_CLASS locking\");\n  }\n\n\n  \/*---------------.\n  | UContextImpl.  |\n  `---------------*\/\n  namespace impl\n  {\n# define GENERIC_TRY(Desc, Code)                                \\\n    do {                                                        \\\n      std::string estr_;                                        \\\n      try                                                       \\\n      {                                                         \\\n        Code;                                                   \\\n      }                                                         \\\n      catch(const std::exception& e)                            \\\n      {                                                         \\\n        estr_ = e.what();                                       \\\n      }                                                         \\\n      catch(...)                                                \\\n      {                                                         \\\n        estr_ = \"unknown exception\";                            \\\n      }                                                         \\\n      if (!estr_.empty())                                       \\\n        GD_SERROR(\"Exception \" << Desc << \": \" << estr_);       \\\n    } while(0)\n\n\n    void\n    UContextImpl::init()\n    {\n      setCurrentContext(this);\n      foreach (baseURBIStarterHub* s, baseURBIStarterHub::list())\n      {\n        if (!libport::has(initialized, s))\n        {\n          GD_FINFO_TRACE(\"initializing UObject hub: %s\", s->name);\n          GENERIC_TRY(\"Instanciating hub\" << s,\n                      newUObjectHubClass(s);\n                      initialized.insert(s);\n                      );\n        }\n      }\n      foreach (baseURBIStarter* s, baseURBIStarter::list())\n      {\n        if (!libport::has(initialized, s))\n        {\n          GD_FINFO_TRACE(\"initializing UObject: %s\", s->name);\n          GENERIC_TRY(\"Instanciating object\" << s,\n                      newUObjectClass(s);\n                      initialized.insert(s);\n                      );\n        }\n      }\n    }\n#undef GENERIC_TRY\n\n    bool\n    UContextImpl::bind(const std::string& n, std::string rename)\n    {\n      foreach(baseURBIStarter* s, baseURBIStarter::list())\n      {\n        if (s->name == n)\n        {\n          s->instanciate(this, rename);\n          return true;\n        }\n      }\n      return false;\n    }\n\n    void\n    UContextImpl::registerObject(UObject*o)\n    {\n      objects[o->__name] = o;\n      const std::type_info& ti = typeid(*o);\n      if (!o->cloner)\n      {\n        \/\/ Object was instanciated from C++ and has no cloner, try to find one.\n        foreach(objects_type::value_type& v, objects)\n        {\n          GD_FINFO_TRACE(\"    Scanning %s (%s)\",  v.second->__name,\n                         typeid(*v.second).name());\n          if (typeid(*v.second) == ti && o != v.second)\n          {\n            GD_FINFO_TRACE(\"Found parent of %s: %s\", o->__name,\n                           v.second->__name);\n            o->cloner = v.second->cloner;\n            return;\n          }\n        }\n        GD_FINFO_TRACE(\"No parent fonud for %s\", o->__name);\n      }\n    }\n\n    void\n    UContextImpl::registerHub(UObjectHub*u)\n    {\n      hubs[u->get_name()] = u;\n    }\n\n    UObjectHub*\n    UContextImpl::getUObjectHub(const std::string& n)\n    {\n      return libport::find0(hubs, n);\n    }\n\n    UObject*\n    UContextImpl::getUObject(const std::string& n)\n    {\n      return libport::find0(objects, n);\n    }\n  }\n\n  \/*--------------------------.\n  | Free standing functions.  |\n  `--------------------------*\/\n\n  \/\/! echo method\n  void\n  echo(const char* format, ...)\n  {\n    if (format)\n    {\n      \/\/ This method is deprecated, there's no good reason to\n      \/\/ make it perfect.\n      char buf[BUFSIZ];\n      va_list arg;\n      va_start(arg, format);\n      \/\/ Don't print if we overflow the buffer.  It would be nice to\n      \/\/ rely on the behavior of the GNU LibC which accepts 0 as\n      \/\/ destination buffer to query the space needed.  But it is not\n      \/\/ portable (e.g., segv on OS X).  So rather, try to vsnprintf,\n      \/\/ and upon failure, revert the buffer in its previous state.\n      int r = vsnprintf(buf, sizeof buf, format, arg);\n      va_end(arg);\n      \/\/ vsnprintf returns the number of characters to write.  Check\n      \/\/ that it fits.  Don't forget the ending '\\0' that it does not\n      \/\/ count, but wants to add.\n      if (r < 0 || static_cast<int>(sizeof buf) <= r)\n        \/\/ Don't produce partial input.\n        buf[sizeof buf - 1] = 0;\n      GD_INFO_TRACE(buf);\n    }\n  }\n\n  UTimerCallback::UTimerCallback(const std::string& objname,\n\t\t\t\t ufloat period,\n                                 impl::UContextImpl* ctx)\n    : period(period)\n    , objname(objname)\n    , ctx_(ctx)\n  {\n    lastTimeCalled = -9999999;\n  }\n\n  void\n  UTimerCallback::registerCallback()\n  {\n     handle_ = ctx_->setTimer(this);\n  }\n\n  UTimerCallback::~UTimerCallback()\n  {\n  }\n\n  std::string getFilteredHostname()\n  {\n    char hn[1024];\n    gethostname(hn, 1024);\n    std::string res = hn;\n    if (!isalpha(res[0]))\n      res = \"_\" + res;\n    foreach(char& c, res)\n      if (!isalnum(c) && c != '_')\n        c = '_';\n    return res;\n  }\n}\n<commit_msg>Compiler: remove noreturn attribute that does not please MSVC.<commit_after>\/*\n * Copyright (C) 2009-2011, 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#include <cstdarg>\n#include <typeinfo>\n\n#include <libport\/cstdio>\n#include <libport\/debug.hh>\n\n#include <boost\/thread.hpp>\n\n#include <libport\/containers.hh>\n#include <libport\/foreach.hh>\n#include <libport\/utime.hh>\n\n#include <urbi\/uobject.hh>\n#include <urbi\/ustarter.hh>\n#include <urbi\/ucontext-factory.hh>\n\nGD_CATEGORY(Urbi.UObject);\n\nnamespace urbi\n{\n  namespace impl\n  {\n    std::vector<std::string> listModules()\n    {\n      std::vector<std::string> res;\n      foreach(baseURBIStarter* s, baseURBIStarter::list())\n      {\n        res.push_back(s->name);\n      }\n      return res;\n    }\n  }\n\n  static void noop(impl::UContextImpl*)\n  {\n  }\n\n  static boost::thread_specific_ptr<impl::UContextImpl> current_context(&noop);\n  static impl::UContextImpl* default_context = 0;\n  impl::UContextImpl* getCurrentContext()\n  {\n    impl::UContextImpl* res = current_context.get();\n    return res ? res : default_context;\n  }\n\n  void setCurrentContext(impl::UContextImpl* impl)\n  {\n    if (!default_context)\n      default_context = impl;\n    current_context.reset(impl);\n  }\n\n\n  \/*-------------------.\n  | UGenericCallback.  |\n  `-------------------*\/\n\n  UGenericCallback::UGenericCallback(UObject& owner,\n                                     UVar* target,\n\t\t\t\t     const std::string& type,\n\t\t\t\t     const std::string& name,\n\t\t\t\t     int size,\n                                     impl::UContextImpl* ctx)\n    : UContext(ctx)\n    , nbparam(size)\n    , objname(&owner?owner.__name:\"dummy\")\n    , type(type)\n    , name(name)\n    , target(target)\n    , owner(owner)\n    , synchronous_(true)\n  {\n    if (target)\n      target->check();\n    impl_ = ctx_->getGenericCallbackImpl();\n    impl_->initialize(this, target?target->owned:false);\n  }\n\n  UGenericCallback::UGenericCallback(UObject& owner,\n                                     UVar* target,\n\t\t\t\t     const std::string& type,\n\t\t\t\t     const std::string& name,\n                                     impl::UContextImpl* ctx)\n    : UContext(ctx)\n    , objname(&owner?owner.__name:\"dummy\")\n    , type(type)\n    , name(name)\n    , target(target)\n    , owner(owner)\n    , synchronous_(true)\n  {\n    if (target)\n      target->check();\n    impl_ = ctx_->getGenericCallbackImpl();\n    impl_->initialize(this);\n  }\n\n  UGenericCallback::~UGenericCallback()\n  {\n    impl_->clear();\n    delete impl_;\n  }\n\n  void\n  UGenericCallback::registerCallback()\n  {\n    impl_->registerCallback();\n  }\n\n  bool\n  UGenericCallback::isSynchronous() const\n  {\n    return synchronous_;\n  }\n\n  void\n  UGenericCallback::syncEval(UList& params, OnDone onDone)\n  {\n    UValue res;\n    try {\n      res = __evalcall(params);\n      if (onDone)\n        onDone(res, 0);\n    }\n    catch(const std::exception& e)\n    {\n      if (onDone)\n        onDone(res, &e);\n    }\n    catch(...)\n    {\n      if (onDone)\n      {\n        std::runtime_error e(\"invalid exception\");\n        onDone(res, &e);\n      }\n    }\n  }\n\n  void\n  UGenericCallback::eval(UList& params, OnDone onDone)\n  {\n    if (synchronous_)\n    {\n      syncEval(params, onDone);\n    }\n    else\n    {\n      libport::ThreadPool::rTaskHandle h\n       = threadPool().queueTask(\n                             boost::function0<void>(\n        boost::bind(&UGenericCallback::syncEval, this, params, onDone)),\n        taskLock);\n       GD_FINFO_TRACE(\"Queued async op: with lock %s: %s\", taskLock.get(),\n                      h->getState());\n      if (h->getState() == libport::ThreadPool::TaskHandle::DROPPED)\n      {\n        UValue res;\n        onDone(res, 0);\n      }\n    }\n  }\n\n  \/* Note: to implement the LOCK_MODULE mode, we must delegate search of the\n   * TaskLock to use to a function within the calling module.\n   * That is why we take the TaskLock here and we do not find it ourselve.\n   *\/\n  void\n  UGenericCallback::setAsync(libport::ThreadPool::rTaskLock l)\n  {\n    synchronous_ = false;\n    taskLock = l;\n  }\n\n  libport::ThreadPool&\n  UGenericCallback::threadPool()\n  {\n    static libport::ThreadPool tp;\n    return tp;\n  }\n\n  void\n  setThreadLimit(size_t nThreads)\n  {\n    UGenericCallback::threadPool().resize(nThreads);\n  }\n\n  \/*----------.\n  | UObject.  |\n  `----------*\/\n\n  UObject::UObject(impl::UContextImpl* impl)\n   : UContext(impl)\n   , derived(false)\n   , autogroup(false)\n   , remote(true)\n   , cloner(0)\n   , impl_(ctx_->getObjectImpl())\n   , taskLock_(new libport::ThreadPool::TaskLock)\n {\n   impl_->initialize(this);\n    objecthub = 0;\n  }\n\n  UObject::UObject(int, impl::UContextImpl* impl)\n    : UContext(impl)\n    , __name(\"_dummy\")\n    , classname(\"_dummy\")\n    , derived(false)\n    , autogroup(false)\n    , remote(true)\n    , cloner(0)\n    , impl_(ctx_->getObjectImpl())\n    , taskLock_(new libport::ThreadPool::TaskLock)\n  {\n    impl_->initialize(this);\n    objecthub = 0;\n  }\n\n  \/\/! UObject constructor.\n  UObject::UObject(const std::string& s, impl::UContextImpl* impl)\n    : UContext(impl)\n    , __name(s)\n    , classname(s)\n    , derived(false)\n    , autogroup(false)\n    , remote(true)\n    , cloner(0)\n    , impl_(ctx_->getObjectImpl())\n    , taskLock_(new libport::ThreadPool::TaskLock)\n  {\n    impl_->initialize(this);\n    objecthub = 0;\n    autogroup = false;\n    \/\/ Do not replace this call to init by a `, load(s, \"load\")' as\n    \/\/ both result in \"var <__name>.load = 1\", which is not valid\n    \/\/ until the two above lines actually create <__name>.\n    load.init(__name, \"load\");\n    \/\/ default\n    load = 1;\n  }\n\n  void\n  UObject::addAutoGroup()\n  {\n    UJoinGroup(classname + \"s\");\n  }\n\n  void\n  UObject::UAutoGroup()\n  {\n    autogroup = true;\n  }\n\n  \/\/! UObject destructor.\n  UObject::~UObject()\n  {\n    clean();\n    delete impl_;\n  }\n\n  void\n  UObject::UJoinGroup(const std::string& gpname)\n  {\n    std::string groupregister = \"addgroup \" + gpname +\" { \"+__name+\"};\";\n    send(groupregister);\n  }\n\n  libport::ThreadPool::rTaskLock\n  UObject::getClassTaskLock()\n  {\n    throw std::runtime_error(\"You must redefine getClassTaskLock to use\"\n                             \" asynchronous calls with LOCK_CLASS locking\");\n  }\n\n\n  \/*---------------.\n  | UContextImpl.  |\n  `---------------*\/\n  namespace impl\n  {\n# define GENERIC_TRY(Desc, Code)                                \\\n    do {                                                        \\\n      std::string estr_;                                        \\\n      try                                                       \\\n      {                                                         \\\n        Code;                                                   \\\n      }                                                         \\\n      catch(const std::exception& e)                            \\\n      {                                                         \\\n        estr_ = e.what();                                       \\\n      }                                                         \\\n      catch(...)                                                \\\n      {                                                         \\\n        estr_ = \"unknown exception\";                            \\\n      }                                                         \\\n      if (!estr_.empty())                                       \\\n        GD_SERROR(\"Exception \" << Desc << \": \" << estr_);       \\\n    } while(0)\n\n\n    void\n    UContextImpl::init()\n    {\n      setCurrentContext(this);\n      foreach (baseURBIStarterHub* s, baseURBIStarterHub::list())\n      {\n        if (!libport::has(initialized, s))\n        {\n          GD_FINFO_TRACE(\"initializing UObject hub: %s\", s->name);\n          GENERIC_TRY(\"Instanciating hub\" << s,\n                      newUObjectHubClass(s);\n                      initialized.insert(s);\n                      );\n        }\n      }\n      foreach (baseURBIStarter* s, baseURBIStarter::list())\n      {\n        if (!libport::has(initialized, s))\n        {\n          GD_FINFO_TRACE(\"initializing UObject: %s\", s->name);\n          GENERIC_TRY(\"Instanciating object\" << s,\n                      newUObjectClass(s);\n                      initialized.insert(s);\n                      );\n        }\n      }\n    }\n#undef GENERIC_TRY\n\n    bool\n    UContextImpl::bind(const std::string& n, std::string rename)\n    {\n      foreach(baseURBIStarter* s, baseURBIStarter::list())\n      {\n        if (s->name == n)\n        {\n          s->instanciate(this, rename);\n          return true;\n        }\n      }\n      return false;\n    }\n\n    void\n    UContextImpl::registerObject(UObject*o)\n    {\n      objects[o->__name] = o;\n      const std::type_info& ti = typeid(*o);\n      if (!o->cloner)\n      {\n        \/\/ Object was instanciated from C++ and has no cloner, try to find one.\n        foreach(objects_type::value_type& v, objects)\n        {\n          GD_FINFO_TRACE(\"    Scanning %s (%s)\",  v.second->__name,\n                         typeid(*v.second).name());\n          if (typeid(*v.second) == ti && o != v.second)\n          {\n            GD_FINFO_TRACE(\"Found parent of %s: %s\", o->__name,\n                           v.second->__name);\n            o->cloner = v.second->cloner;\n            return;\n          }\n        }\n        GD_FINFO_TRACE(\"No parent fonud for %s\", o->__name);\n      }\n    }\n\n    void\n    UContextImpl::registerHub(UObjectHub*u)\n    {\n      hubs[u->get_name()] = u;\n    }\n\n    UObjectHub*\n    UContextImpl::getUObjectHub(const std::string& n)\n    {\n      return libport::find0(hubs, n);\n    }\n\n    UObject*\n    UContextImpl::getUObject(const std::string& n)\n    {\n      return libport::find0(objects, n);\n    }\n  }\n\n  \/*--------------------------.\n  | Free standing functions.  |\n  `--------------------------*\/\n\n  \/\/! echo method\n  void\n  echo(const char* format, ...)\n  {\n    if (format)\n    {\n      \/\/ This method is deprecated, there's no good reason to\n      \/\/ make it perfect.\n      char buf[BUFSIZ];\n      va_list arg;\n      va_start(arg, format);\n      \/\/ Don't print if we overflow the buffer.  It would be nice to\n      \/\/ rely on the behavior of the GNU LibC which accepts 0 as\n      \/\/ destination buffer to query the space needed.  But it is not\n      \/\/ portable (e.g., segv on OS X).  So rather, try to vsnprintf,\n      \/\/ and upon failure, revert the buffer in its previous state.\n      int r = vsnprintf(buf, sizeof buf, format, arg);\n      va_end(arg);\n      \/\/ vsnprintf returns the number of characters to write.  Check\n      \/\/ that it fits.  Don't forget the ending '\\0' that it does not\n      \/\/ count, but wants to add.\n      if (r < 0 || static_cast<int>(sizeof buf) <= r)\n        \/\/ Don't produce partial input.\n        buf[sizeof buf - 1] = 0;\n      GD_INFO_TRACE(buf);\n    }\n  }\n\n  UTimerCallback::UTimerCallback(const std::string& objname,\n\t\t\t\t ufloat period,\n                                 impl::UContextImpl* ctx)\n    : period(period)\n    , objname(objname)\n    , ctx_(ctx)\n  {\n    lastTimeCalled = -9999999;\n  }\n\n  void\n  UTimerCallback::registerCallback()\n  {\n     handle_ = ctx_->setTimer(this);\n  }\n\n  UTimerCallback::~UTimerCallback()\n  {\n  }\n\n  std::string getFilteredHostname()\n  {\n    char hn[1024];\n    gethostname(hn, 1024);\n    std::string res = hn;\n    if (!isalpha(res[0]))\n      res = \"_\" + res;\n    foreach(char& c, res)\n      if (!isalnum(c) && c != '_')\n        c = '_';\n    return res;\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 \"include\/core\/SkCanvas.h\"\n#include \"include\/core\/SkGraphics.h\"\n#include \"include\/core\/SkPictureRecorder.h\"\n#include \"include\/core\/SkStream.h\"\n#include \"include\/core\/SkSurface.h\"\n#include \"include\/encode\/SkPngEncoder.h\"\n#include \"modules\/skottie\/include\/Skottie.h\"\n#include \"modules\/skottie\/utils\/SkottieUtils.h\"\n#include \"modules\/skresources\/include\/SkResources.h\"\n#include \"src\/core\/SkOSFile.h\"\n#include \"src\/core\/SkTaskGroup.h\"\n#include \"src\/utils\/SkOSPath.h\"\n#include \"tools\/flags\/CommandLineFlags.h\"\n\n#include <algorithm>\n#include <chrono>\n#include <future>\n#include <numeric>\n#include <vector>\n\n#if defined(HAVE_VIDEO_ENCODER)\n    #include \"experimental\/ffmpeg\/SkVideoEncoder.h\"\n    const char* formats_help = \"Output format (png, skp, mp4, or null)\";\n#else\n    const char* formats_help = \"Output format (png, skp, or null)\";\n#endif\n\nstatic DEFINE_string2(input    , i, nullptr, \"Input .json file.\");\nstatic DEFINE_string2(writePath, w, nullptr, \"Output directory.  Frames are names [0-9]{6}.png.\");\nstatic DEFINE_string2(format   , f, \"png\"  , formats_help);\n\nstatic DEFINE_double(t0,    0, \"Timeline start [0..1].\");\nstatic DEFINE_double(t1,    1, \"Timeline stop [0..1].\");\nstatic DEFINE_double(fps,   0, \"Decode frames per second (default is animation native fps).\");\n\nstatic DEFINE_int(width , 800, \"Render width.\");\nstatic DEFINE_int(height, 600, \"Render height.\");\nstatic DEFINE_int(threads,  0, \"Number of worker threads (0 -> cores count).\");\n\nnamespace {\n\nstatic constexpr SkColor kClearColor = SK_ColorWHITE;\n\nstd::unique_ptr<SkFILEWStream> MakeFrameStream(size_t idx, const char* ext) {\n    const auto frame_file = SkStringPrintf(\"0%06zu.%s\", idx, ext);\n    auto stream = std::make_unique<SkFILEWStream>(SkOSPath::Join(FLAGS_writePath[0],\n                                                                   frame_file.c_str()).c_str());\n    if (!stream->isValid()) {\n        return nullptr;\n    }\n\n    return stream;\n}\n\nclass Sink {\npublic:\n    Sink() = default;\n    virtual ~Sink() = default;\n    Sink(const Sink&) = delete;\n    Sink& operator=(const Sink&) = delete;\n\n    virtual SkCanvas* beginFrame(size_t idx) = 0;\n    virtual bool endFrame(size_t idx) = 0;\n};\n\nclass PNGSink final : public Sink {\npublic:\n    static std::unique_ptr<Sink> Make(const SkMatrix& scale_matrix) {\n        auto surface = SkSurface::MakeRasterN32Premul(FLAGS_width, FLAGS_height);\n        if (!surface) {\n            SkDebugf(\"Could not allocate a %d x %d surface.\\n\", FLAGS_width, FLAGS_height);\n            return nullptr;\n        }\n\n        return std::unique_ptr<Sink>(new PNGSink(std::move(surface), scale_matrix));\n    }\n\nprivate:\n    PNGSink(sk_sp<SkSurface> surface, const SkMatrix& scale_matrix)\n        : fSurface(std::move(surface)) {\n        fSurface->getCanvas()->concat(scale_matrix);\n    }\n\n    SkCanvas* beginFrame(size_t) override {\n        auto* canvas = fSurface->getCanvas();\n        canvas->clear(kClearColor);\n        return canvas;\n    }\n\n    bool endFrame(size_t idx) override {\n        auto stream = MakeFrameStream(idx, \"png\");\n        if (!stream) {\n            return false;\n        }\n\n        \/\/ Set encoding options to favor speed over size.\n        SkPngEncoder::Options options;\n        options.fZLibLevel   = 1;\n        options.fFilterFlags = SkPngEncoder::FilterFlag::kNone;\n\n        sk_sp<SkImage> img = fSurface->makeImageSnapshot();\n        SkPixmap pixmap;\n        return img->peekPixels(&pixmap)\n            && SkPngEncoder::Encode(stream.get(), pixmap, options);\n    }\n\n    const sk_sp<SkSurface> fSurface;\n};\n\nclass SKPSink final : public Sink {\npublic:\n    static std::unique_ptr<Sink> Make(const SkMatrix& scale_matrix) {\n        return std::unique_ptr<Sink>(new SKPSink(scale_matrix));\n    }\n\nprivate:\n    explicit SKPSink(const SkMatrix& scale_matrix)\n        : fScaleMatrix(scale_matrix) {}\n\n    SkCanvas* beginFrame(size_t) override {\n        auto canvas = fRecorder.beginRecording(FLAGS_width, FLAGS_height);\n        canvas->concat(fScaleMatrix);\n        return canvas;\n    }\n\n    bool endFrame(size_t idx) override {\n        auto stream = MakeFrameStream(idx, \"skp\");\n        if (!stream) {\n            return false;\n        }\n\n        fRecorder.finishRecordingAsPicture()->serialize(stream.get());\n        return true;\n    }\n\n    const SkMatrix    fScaleMatrix;\n    SkPictureRecorder fRecorder;\n};\n\nclass NullSink final : public Sink {\npublic:\n    static std::unique_ptr<Sink> Make(const SkMatrix& scale_matrix) {\n        auto surface = SkSurface::MakeRasterN32Premul(FLAGS_width, FLAGS_height);\n        if (!surface) {\n            SkDebugf(\"Could not allocate a %d x %d surface.\\n\", FLAGS_width, FLAGS_height);\n            return nullptr;\n        }\n\n        return std::unique_ptr<Sink>(new NullSink(std::move(surface), scale_matrix));\n    }\n\nprivate:\n    NullSink(sk_sp<SkSurface> surface, const SkMatrix& scale_matrix)\n        : fSurface(std::move(surface)) {\n        fSurface->getCanvas()->concat(scale_matrix);\n    }\n\n    SkCanvas* beginFrame(size_t) override {\n        auto* canvas = fSurface->getCanvas();\n        canvas->clear(kClearColor);\n        return canvas;\n    }\n\n    bool endFrame(size_t) override {\n        return true;\n    }\n\n    const sk_sp<SkSurface> fSurface;\n};\n\nstatic std::vector<std::promise<sk_sp<SkImage>>> gMP4Frames;\n\nstruct MP4Sink final : public Sink {\n    explicit MP4Sink(const SkMatrix& scale_matrix)\n        : fSurface(SkSurface::MakeRasterN32Premul(FLAGS_width, FLAGS_height)) {\n        fSurface->getCanvas()->concat(scale_matrix);\n    }\n\n    SkCanvas* beginFrame(size_t) override {\n        SkCanvas* canvas = fSurface->getCanvas();\n        canvas->clear(kClearColor);\n        return canvas;\n    }\n\n    bool endFrame(size_t i) override {\n        if (sk_sp<SkImage> img = fSurface->makeImageSnapshot()) {\n            gMP4Frames[i].set_value(std::move(img));\n            return true;\n        }\n        return false;\n    }\n\n    const sk_sp<SkSurface> fSurface;\n};\n\nclass Logger final : public skottie::Logger {\npublic:\n    struct LogEntry {\n        SkString fMessage,\n                 fJSON;\n    };\n\n    void log(skottie::Logger::Level lvl, const char message[], const char json[]) override {\n        auto& log = lvl == skottie::Logger::Level::kError ? fErrors : fWarnings;\n        log.push_back({ SkString(message), json ? SkString(json) : SkString() });\n    }\n\n    void report() const {\n        SkDebugf(\"Animation loaded with %lu error%s, %lu warning%s.\\n\",\n                 fErrors.size(), fErrors.size() == 1 ? \"\" : \"s\",\n                 fWarnings.size(), fWarnings.size() == 1 ? \"\" : \"s\");\n\n        const auto& show = [](const LogEntry& log, const char prefix[]) {\n            SkDebugf(\"%s%s\", prefix, log.fMessage.c_str());\n            if (!log.fJSON.isEmpty())\n                SkDebugf(\" : %s\", log.fJSON.c_str());\n            SkDebugf(\"\\n\");\n        };\n\n        for (const auto& err : fErrors)   show(err, \"  !! \");\n        for (const auto& wrn : fWarnings) show(wrn, \"  ?? \");\n    }\n\nprivate:\n    std::vector<LogEntry> fErrors,\n                          fWarnings;\n};\n\nstd::unique_ptr<Sink> MakeSink(const char* fmt, const SkMatrix& scale_matrix) {\n    if (0 == strcmp(fmt,  \"png\")) return  PNGSink::Make(scale_matrix);\n    if (0 == strcmp(fmt,  \"skp\")) return  SKPSink::Make(scale_matrix);\n    if (0 == strcmp(fmt, \"null\")) return NullSink::Make(scale_matrix);\n    if (0 == strcmp(fmt,  \"mp4\")) return std::make_unique<MP4Sink>(scale_matrix);\n\n    SkDebugf(\"Unknown format: %s\\n\", FLAGS_format[0]);\n    return nullptr;\n}\n\n} \/\/ namespace\n\nextern bool gSkUseThreadLocalStrikeCaches_IAcknowledgeThisIsIncrediblyExperimental;\n\nint main(int argc, char** argv) {\n    gSkUseThreadLocalStrikeCaches_IAcknowledgeThisIsIncrediblyExperimental = true;\n    CommandLineFlags::Parse(argc, argv);\n    SkAutoGraphics ag;\n\n    if (FLAGS_input.isEmpty() || FLAGS_writePath.isEmpty()) {\n        SkDebugf(\"Missing required 'input' and 'writePath' args.\\n\");\n        return 1;\n    }\n\n    if (!FLAGS_format.contains(\"mp4\") && !sk_mkdir(FLAGS_writePath[0])) {\n        return 1;\n    }\n\n    auto logger = sk_make_sp<Logger>();\n    auto     rp = skresources::CachingResourceProvider::Make(\n                    skresources::DataURIResourceProviderProxy::Make(\n                      skresources::FileResourceProvider::Make(SkOSPath::Dirname(FLAGS_input[0]),\n                                                                \/*predecode=*\/true),\n                      \/*predecode=*\/true));\n    auto data   = SkData::MakeFromFileName(FLAGS_input[0]);\n    auto precomp_interceptor =\n            sk_make_sp<skottie_utils::ExternalAnimationPrecompInterceptor>(rp, \"__\");\n\n    if (!data) {\n        SkDebugf(\"Could not load %s.\\n\", FLAGS_input[0]);\n        return 1;\n    }\n\n    \/\/ Instantiate an animation on the main thread for two reasons:\n    \/\/   - we need to know its duration upfront\n    \/\/   - we want to only report parsing errors once\n    auto anim = skottie::Animation::Builder()\n            .setLogger(logger)\n            .setResourceProvider(rp)\n            .make(static_cast<const char*>(data->data()), data->size());\n    if (!anim) {\n        SkDebugf(\"Could not parse animation: '%s'.\\n\", FLAGS_input[0]);\n        return 1;\n    }\n\n    const auto scale_matrix = SkMatrix::MakeRectToRect(SkRect::MakeSize(anim->size()),\n                                                       SkRect::MakeIWH(FLAGS_width, FLAGS_height),\n                                                       SkMatrix::kCenter_ScaleToFit);\n    logger->report();\n\n    const auto t0 = SkTPin(FLAGS_t0, 0.0, 1.0),\n               t1 = SkTPin(FLAGS_t1,  t0, 1.0),\n       native_fps = anim->fps(),\n           frame0 = anim->duration() * t0 * native_fps,\n         duration = anim->duration() * (t1 - t0);\n\n    double fps = FLAGS_fps > 0 ? FLAGS_fps : native_fps;\n    if (fps <= 0) {\n        SkDebugf(\"Invalid fps: %f.\\n\", fps);\n        return 1;\n    }\n\n    auto frame_count = static_cast<int>(duration * fps);\n    static constexpr int kMaxFrames = 10000;\n    if (frame_count > kMaxFrames) {\n        frame_count = kMaxFrames;\n        fps = frame_count \/ duration;\n    }\n    const auto fps_scale = native_fps \/ fps;\n\n    SkDebugf(\"Rendering %f seconds (%d frames @%f fps).\\n\", duration, frame_count, fps);\n\n    if (FLAGS_format.contains(\"mp4\")) {\n        gMP4Frames.resize(frame_count);\n    }\n\n    std::vector<double> frames_ms(frame_count);\n\n    auto ms_since = [](auto start) {\n        const auto elapsed = std::chrono::steady_clock::now() - start;\n        return std::chrono::duration_cast<std::chrono::milliseconds>(elapsed).count();\n    };\n\n    SkTaskGroup::Enabler enabler(FLAGS_threads - 1);\n\n    SkTaskGroup tg;\n    tg.batch(frame_count, [&](int i) {\n        \/\/ SkTaskGroup::Enabler creates a LIFO work pool,\n        \/\/ but we want our early frames to start first.\n        i = frame_count - 1 - i;\n\n        const auto start = std::chrono::steady_clock::now();\n#if defined(SK_BUILD_FOR_IOS)\n        \/\/ iOS doesn't support thread_local on versions less than 9.0.\n        auto anim = skottie::Animation::Builder()\n                            .setResourceProvider(rp)\n                            .setPrecompInterceptor(precomp_interceptor)\n                            .make(static_cast<const char*>(data->data()), data->size());\n        auto sink = MakeSink(FLAGS_format[0], scale_matrix);\n#else\n        thread_local static auto* anim =\n                skottie::Animation::Builder()\n                    .setResourceProvider(rp)\n                    .setPrecompInterceptor(precomp_interceptor)\n                    .make(static_cast<const char*>(data->data()), data->size())\n                    .release();\n        thread_local static auto* sink = MakeSink(FLAGS_format[0], scale_matrix).release();\n#endif\n\n        if (sink && anim) {\n            anim->seekFrame(frame0 + i * fps_scale);\n            anim->render(sink->beginFrame(i));\n            sink->endFrame(i);\n        }\n\n        frames_ms[i] = ms_since(start);\n    });\n\n#if defined(HAVE_VIDEO_ENCODER)\n    if (FLAGS_format.contains(\"mp4\")) {\n        SkVideoEncoder enc;\n        if (!enc.beginRecording({FLAGS_width, FLAGS_height}, fps)) {\n            SkDEBUGF(\"Invalid video stream configuration.\\n\");\n            return -1;\n        }\n\n        std::vector<double> starved_ms;\n        for (std::promise<sk_sp<SkImage>>& frame : gMP4Frames) {\n            const auto start = std::chrono::steady_clock::now();\n            sk_sp<SkImage> img = frame.get_future().get();\n            starved_ms.push_back(ms_since(start));\n\n            SkPixmap pm;\n            SkAssertResult(img->peekPixels(&pm));\n            enc.addFrame(pm);\n        }\n        sk_sp<SkData> mp4 = enc.endRecording();\n\n        SkFILEWStream{FLAGS_writePath[0]}\n            .write(mp4->data(), mp4->size());\n\n        \/\/ If everything's going well, the first frame should account for the most,\n        \/\/ and ideally nearly all, starvation.\n        double first = starved_ms[0];\n        std::sort(starved_ms.begin(), starved_ms.end());\n        double sum = std::accumulate(starved_ms.begin(), starved_ms.end(), 0);\n        SkDebugf(\"starved min %gms, med %gms, avg %gms, max %gms, sum %gms, first %gms (%s)\\n\",\n                 starved_ms[0], starved_ms[frame_count\/2], sum\/frame_count, starved_ms.back(), sum,\n                 first, first == starved_ms.back() ? \"ok\" : \"BAD\");\n    }\n#endif\n    tg.wait();\n\n    std::sort(frames_ms.begin(), frames_ms.end());\n    double sum = std::accumulate(frames_ms.begin(), frames_ms.end(), 0);\n    SkDebugf(\"frame time min %gms, med %gms, avg %gms, max %gms, sum %gms\\n\",\n             frames_ms[0], frames_ms[frame_count\/2], sum\/frame_count, frames_ms.back(), sum);\n    return 0;\n}\n<commit_msg>Revert \"[skottie] skottie_tool updates\"<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 \"include\/core\/SkCanvas.h\"\n#include \"include\/core\/SkGraphics.h\"\n#include \"include\/core\/SkPictureRecorder.h\"\n#include \"include\/core\/SkStream.h\"\n#include \"include\/core\/SkSurface.h\"\n#include \"include\/encode\/SkPngEncoder.h\"\n#include \"modules\/skottie\/include\/Skottie.h\"\n#include \"modules\/skresources\/include\/SkResources.h\"\n#include \"src\/core\/SkOSFile.h\"\n#include \"src\/core\/SkTaskGroup.h\"\n#include \"src\/utils\/SkOSPath.h\"\n#include \"tools\/flags\/CommandLineFlags.h\"\n\n#include <algorithm>\n#include <chrono>\n#include <future>\n#include <numeric>\n#include <vector>\n\n#if defined(HAVE_VIDEO_ENCODER)\n    #include \"experimental\/ffmpeg\/SkVideoEncoder.h\"\n    const char* formats_help = \"Output format (png, skp, mp4, or null)\";\n#else\n    const char* formats_help = \"Output format (png, skp, or null)\";\n#endif\n\nstatic DEFINE_string2(input    , i, nullptr, \"Input .json file.\");\nstatic DEFINE_string2(writePath, w, nullptr, \"Output directory.  Frames are names [0-9]{6}.png.\");\nstatic DEFINE_string2(format   , f, \"png\"  , formats_help);\n\nstatic DEFINE_double(t0,    0, \"Timeline start [0..1].\");\nstatic DEFINE_double(t1,    1, \"Timeline stop [0..1].\");\nstatic DEFINE_double(fps,   0, \"Decode frames per second (default is animation native fps).\");\n\nstatic DEFINE_int(width , 800, \"Render width.\");\nstatic DEFINE_int(height, 600, \"Render height.\");\nstatic DEFINE_int(threads,  0, \"Number of worker threads (0 -> cores count).\");\n\nnamespace {\n\nstd::unique_ptr<SkFILEWStream> MakeFrameStream(size_t idx, const char* ext) {\n    const auto frame_file = SkStringPrintf(\"0%06zu.%s\", idx, ext);\n    auto stream = std::make_unique<SkFILEWStream>(SkOSPath::Join(FLAGS_writePath[0],\n                                                                   frame_file.c_str()).c_str());\n    if (!stream->isValid()) {\n        return nullptr;\n    }\n\n    return stream;\n}\n\nclass Sink {\npublic:\n    Sink() = default;\n    virtual ~Sink() = default;\n    Sink(const Sink&) = delete;\n    Sink& operator=(const Sink&) = delete;\n\n    virtual SkCanvas* beginFrame(size_t idx) = 0;\n    virtual bool endFrame(size_t idx) = 0;\n};\n\nclass PNGSink final : public Sink {\npublic:\n    static std::unique_ptr<Sink> Make(const SkMatrix& scale_matrix) {\n        auto surface = SkSurface::MakeRasterN32Premul(FLAGS_width, FLAGS_height);\n        if (!surface) {\n            SkDebugf(\"Could not allocate a %d x %d surface.\\n\", FLAGS_width, FLAGS_height);\n            return nullptr;\n        }\n\n        return std::unique_ptr<Sink>(new PNGSink(std::move(surface), scale_matrix));\n    }\n\nprivate:\n    PNGSink(sk_sp<SkSurface> surface, const SkMatrix& scale_matrix)\n        : fSurface(std::move(surface)) {\n        fSurface->getCanvas()->concat(scale_matrix);\n    }\n\n    SkCanvas* beginFrame(size_t) override {\n        auto* canvas = fSurface->getCanvas();\n        canvas->clear(SK_ColorTRANSPARENT);\n        return canvas;\n    }\n\n    bool endFrame(size_t idx) override {\n        auto stream = MakeFrameStream(idx, \"png\");\n        if (!stream) {\n            return false;\n        }\n\n        \/\/ Set encoding options to favor speed over size.\n        SkPngEncoder::Options options;\n        options.fZLibLevel   = 1;\n        options.fFilterFlags = SkPngEncoder::FilterFlag::kNone;\n\n        sk_sp<SkImage> img = fSurface->makeImageSnapshot();\n        SkPixmap pixmap;\n        return img->peekPixels(&pixmap)\n            && SkPngEncoder::Encode(stream.get(), pixmap, options);\n    }\n\n    const sk_sp<SkSurface> fSurface;\n};\n\nclass SKPSink final : public Sink {\npublic:\n    static std::unique_ptr<Sink> Make(const SkMatrix& scale_matrix) {\n        return std::unique_ptr<Sink>(new SKPSink(scale_matrix));\n    }\n\nprivate:\n    explicit SKPSink(const SkMatrix& scale_matrix)\n        : fScaleMatrix(scale_matrix) {}\n\n    SkCanvas* beginFrame(size_t) override {\n        auto canvas = fRecorder.beginRecording(FLAGS_width, FLAGS_height);\n        canvas->concat(fScaleMatrix);\n        return canvas;\n    }\n\n    bool endFrame(size_t idx) override {\n        auto stream = MakeFrameStream(idx, \"skp\");\n        if (!stream) {\n            return false;\n        }\n\n        fRecorder.finishRecordingAsPicture()->serialize(stream.get());\n        return true;\n    }\n\n    const SkMatrix    fScaleMatrix;\n    SkPictureRecorder fRecorder;\n};\n\nclass NullSink final : public Sink {\npublic:\n    static std::unique_ptr<Sink> Make(const SkMatrix& scale_matrix) {\n        auto surface = SkSurface::MakeRasterN32Premul(FLAGS_width, FLAGS_height);\n        if (!surface) {\n            SkDebugf(\"Could not allocate a %d x %d surface.\\n\", FLAGS_width, FLAGS_height);\n            return nullptr;\n        }\n\n        return std::unique_ptr<Sink>(new NullSink(std::move(surface), scale_matrix));\n    }\n\nprivate:\n    NullSink(sk_sp<SkSurface> surface, const SkMatrix& scale_matrix)\n        : fSurface(std::move(surface)) {\n        fSurface->getCanvas()->concat(scale_matrix);\n    }\n\n    SkCanvas* beginFrame(size_t) override {\n        auto* canvas = fSurface->getCanvas();\n        canvas->clear(SK_ColorTRANSPARENT);\n        return canvas;\n    }\n\n    bool endFrame(size_t) override {\n        return true;\n    }\n\n    const sk_sp<SkSurface> fSurface;\n};\n\nstatic std::vector<std::promise<sk_sp<SkImage>>> gMP4Frames;\n\nstruct MP4Sink final : public Sink {\n    explicit MP4Sink(const SkMatrix& scale_matrix)\n        : fSurface(SkSurface::MakeRasterN32Premul(FLAGS_width, FLAGS_height)) {\n        fSurface->getCanvas()->concat(scale_matrix);\n    }\n\n    SkCanvas* beginFrame(size_t) override {\n        SkCanvas* canvas = fSurface->getCanvas();\n        canvas->clear(SK_ColorTRANSPARENT);\n        return canvas;\n    }\n\n    bool endFrame(size_t i) override {\n        if (sk_sp<SkImage> img = fSurface->makeImageSnapshot()) {\n            gMP4Frames[i].set_value(std::move(img));\n            return true;\n        }\n        return false;\n    }\n\n    const sk_sp<SkSurface> fSurface;\n};\n\nclass Logger final : public skottie::Logger {\npublic:\n    struct LogEntry {\n        SkString fMessage,\n                 fJSON;\n    };\n\n    void log(skottie::Logger::Level lvl, const char message[], const char json[]) override {\n        auto& log = lvl == skottie::Logger::Level::kError ? fErrors : fWarnings;\n        log.push_back({ SkString(message), json ? SkString(json) : SkString() });\n    }\n\n    void report() const {\n        SkDebugf(\"Animation loaded with %lu error%s, %lu warning%s.\\n\",\n                 fErrors.size(), fErrors.size() == 1 ? \"\" : \"s\",\n                 fWarnings.size(), fWarnings.size() == 1 ? \"\" : \"s\");\n\n        const auto& show = [](const LogEntry& log, const char prefix[]) {\n            SkDebugf(\"%s%s\", prefix, log.fMessage.c_str());\n            if (!log.fJSON.isEmpty())\n                SkDebugf(\" : %s\", log.fJSON.c_str());\n            SkDebugf(\"\\n\");\n        };\n\n        for (const auto& err : fErrors)   show(err, \"  !! \");\n        for (const auto& wrn : fWarnings) show(wrn, \"  ?? \");\n    }\n\nprivate:\n    std::vector<LogEntry> fErrors,\n                          fWarnings;\n};\n\nstd::unique_ptr<Sink> MakeSink(const char* fmt, const SkMatrix& scale_matrix) {\n    if (0 == strcmp(fmt,  \"png\")) return  PNGSink::Make(scale_matrix);\n    if (0 == strcmp(fmt,  \"skp\")) return  SKPSink::Make(scale_matrix);\n    if (0 == strcmp(fmt, \"null\")) return NullSink::Make(scale_matrix);\n    if (0 == strcmp(fmt,  \"mp4\")) return std::make_unique<MP4Sink>(scale_matrix);\n\n    SkDebugf(\"Unknown format: %s\\n\", FLAGS_format[0]);\n    return nullptr;\n}\n\n} \/\/ namespace\n\nextern bool gSkUseThreadLocalStrikeCaches_IAcknowledgeThisIsIncrediblyExperimental;\n\nint main(int argc, char** argv) {\n    gSkUseThreadLocalStrikeCaches_IAcknowledgeThisIsIncrediblyExperimental = true;\n    CommandLineFlags::Parse(argc, argv);\n    SkAutoGraphics ag;\n\n    if (FLAGS_input.isEmpty() || FLAGS_writePath.isEmpty()) {\n        SkDebugf(\"Missing required 'input' and 'writePath' args.\\n\");\n        return 1;\n    }\n\n    if (!FLAGS_format.contains(\"mp4\") && !sk_mkdir(FLAGS_writePath[0])) {\n        return 1;\n    }\n\n    auto logger = sk_make_sp<Logger>();\n    auto     rp = skresources::CachingResourceProvider::Make(\n                    skresources::DataURIResourceProviderProxy::Make(\n                      skresources::FileResourceProvider::Make(SkOSPath::Dirname(FLAGS_input[0]),\n                                                                \/*predecode=*\/true),\n                      \/*predecode=*\/true));\n    auto data   = SkData::MakeFromFileName(FLAGS_input[0]);\n\n    if (!data) {\n        SkDebugf(\"Could not load %s.\\n\", FLAGS_input[0]);\n        return 1;\n    }\n\n    \/\/ Instantiate an animation on the main thread for two reasons:\n    \/\/   - we need to know its duration upfront\n    \/\/   - we want to only report parsing errors once\n    auto anim = skottie::Animation::Builder()\n            .setLogger(logger)\n            .setResourceProvider(rp)\n            .make(static_cast<const char*>(data->data()), data->size());\n    if (!anim) {\n        SkDebugf(\"Could not parse animation: '%s'.\\n\", FLAGS_input[0]);\n        return 1;\n    }\n\n    const auto scale_matrix = SkMatrix::MakeRectToRect(SkRect::MakeSize(anim->size()),\n                                                       SkRect::MakeIWH(FLAGS_width, FLAGS_height),\n                                                       SkMatrix::kCenter_ScaleToFit);\n    logger->report();\n\n    const auto t0 = SkTPin(FLAGS_t0, 0.0, 1.0),\n               t1 = SkTPin(FLAGS_t1,  t0, 1.0),\n       native_fps = anim->fps(),\n           frame0 = anim->duration() * t0 * native_fps,\n         duration = anim->duration() * (t1 - t0);\n\n    double fps = FLAGS_fps > 0 ? FLAGS_fps : native_fps;\n    if (fps <= 0) {\n        SkDebugf(\"Invalid fps: %f.\\n\", fps);\n        return 1;\n    }\n\n    auto frame_count = static_cast<int>(duration * fps);\n    static constexpr int kMaxFrames = 10000;\n    if (frame_count > kMaxFrames) {\n        frame_count = kMaxFrames;\n        fps = frame_count \/ duration;\n    }\n    const auto fps_scale = native_fps \/ fps;\n\n    SkDebugf(\"Rendering %f seconds (%d frames @%f fps).\\n\", duration, frame_count, fps);\n\n    if (FLAGS_format.contains(\"mp4\")) {\n        gMP4Frames.resize(frame_count);\n    }\n\n    std::vector<double> frames_ms(frame_count);\n\n    auto ms_since = [](auto start) {\n        const auto elapsed = std::chrono::steady_clock::now() - start;\n        return std::chrono::duration_cast<std::chrono::milliseconds>(elapsed).count();\n    };\n\n    SkTaskGroup::Enabler enabler(FLAGS_threads - 1);\n\n    SkTaskGroup tg;\n    tg.batch(frame_count, [&](int i) {\n        \/\/ SkTaskGroup::Enabler creates a LIFO work pool,\n        \/\/ but we want our early frames to start first.\n        i = frame_count - 1 - i;\n\n        const auto start = std::chrono::steady_clock::now();\n#if defined(SK_BUILD_FOR_IOS)\n        \/\/ iOS doesn't support thread_local on versions less than 9.0.\n        auto anim = skottie::Animation::Builder()\n                            .setResourceProvider(rp)\n                            .make(static_cast<const char*>(data->data()), data->size());\n        auto sink = MakeSink(FLAGS_format[0], scale_matrix);\n#else\n        thread_local static auto* anim =\n                skottie::Animation::Builder()\n                    .setResourceProvider(rp)\n                    .make(static_cast<const char*>(data->data()), data->size())\n                    .release();\n        thread_local static auto* sink = MakeSink(FLAGS_format[0], scale_matrix).release();\n#endif\n\n        if (sink && anim) {\n            anim->seekFrame(frame0 + i * fps_scale);\n            anim->render(sink->beginFrame(i));\n            sink->endFrame(i);\n        }\n\n        frames_ms[i] = ms_since(start);\n    });\n\n#if defined(HAVE_VIDEO_ENCODER)\n    if (FLAGS_format.contains(\"mp4\")) {\n        SkVideoEncoder enc;\n        if (!enc.beginRecording({FLAGS_width, FLAGS_height}, fps)) {\n            SkDEBUGF(\"Invalid video stream configuration.\\n\");\n            return -1;\n        }\n\n        std::vector<double> starved_ms;\n        for (std::promise<sk_sp<SkImage>>& frame : gMP4Frames) {\n            const auto start = std::chrono::steady_clock::now();\n            sk_sp<SkImage> img = frame.get_future().get();\n            starved_ms.push_back(ms_since(start));\n\n            SkPixmap pm;\n            SkAssertResult(img->peekPixels(&pm));\n            enc.addFrame(pm);\n        }\n        sk_sp<SkData> mp4 = enc.endRecording();\n\n        SkFILEWStream{FLAGS_writePath[0]}\n            .write(mp4->data(), mp4->size());\n\n        \/\/ If everything's going well, the first frame should account for the most,\n        \/\/ and ideally nearly all, starvation.\n        double first = starved_ms[0];\n        std::sort(starved_ms.begin(), starved_ms.end());\n        double sum = std::accumulate(starved_ms.begin(), starved_ms.end(), 0);\n        SkDebugf(\"starved min %gms, med %gms, avg %gms, max %gms, sum %gms, first %gms (%s)\\n\",\n                 starved_ms[0], starved_ms[frame_count\/2], sum\/frame_count, starved_ms.back(), sum,\n                 first, first == starved_ms.back() ? \"ok\" : \"BAD\");\n    }\n#endif\n    tg.wait();\n\n    std::sort(frames_ms.begin(), frames_ms.end());\n    double sum = std::accumulate(frames_ms.begin(), frames_ms.end(), 0);\n    SkDebugf(\"frame time min %gms, med %gms, avg %gms, max %gms, sum %gms\\n\",\n             frames_ms[0], frames_ms[frame_count\/2], sum\/frame_count, frames_ms.back(), sum);\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"TranslationRequest.h\"\n#include <boost\/foreach.hpp>\n\nnamespace MosesServer\n{\nusing namespace std;\nusing Moses::Hypothesis;\nusing Moses::StaticData;\nusing Moses::WordsRange;\nusing Moses::ChartHypothesis;\nusing Moses::Phrase;\nusing Moses::Manager;\nusing Moses::SearchGraphNode;\nusing Moses::TrellisPathList;\nusing Moses::TranslationOptionCollection;\nusing Moses::TranslationOptionList;\nusing Moses::TranslationOption;\nusing Moses::TargetPhrase;\nusing Moses::FValue;\nusing Moses::PhraseDictionaryMultiModel;\nusing Moses::FindPhraseDictionary;\nusing Moses::Sentence;\n\nboost::shared_ptr<TranslationRequest>\nTranslationRequest::\ncreate(xmlrpc_c::paramList const& paramList,\n       boost::condition_variable& cond,\n       boost::mutex& mut)\n{\n  boost::shared_ptr<TranslationRequest> ret;\n  ret.reset(new TranslationRequest(paramList,cond, mut));\n  ret->m_self = ret;\n  return ret;\n}\n\nvoid\nTranslationRequest::\nRun()\n{\n  parse_request(m_paramList.getStruct(0));\n\n  Moses::StaticData const& SD = Moses::StaticData::Instance();\n\n  \/\/Make sure alternative paths are retained, if necessary\n  if (m_withGraphInfo || m_nbestSize>0)\n    \/\/ why on earth is this a global variable? Is this even thread-safe???? UG\n    (const_cast<Moses::StaticData&>(SD)).SetOutputSearchGraph(true);\n\n  std::stringstream out, graphInfo, transCollOpts;\n\n  if (SD.IsSyntax())\n    run_chart_decoder();\n  else\n    run_phrase_decoder();\n\n  XVERBOSE(1,\"Output: \" << out.str() << endl);\n  {\n    boost::lock_guard<boost::mutex> lock(m_mutex);\n    m_done = true;\n  }\n  m_cond.notify_one();\n\n}\n\n\/\/\/ add phrase alignment information from a Hypothesis\nvoid\nTranslationRequest::\nadd_phrase_aln_info(Hypothesis const& h, vector<xmlrpc_c::value>& aInfo) const\n{\n  if (!m_withAlignInfo) return;\n  WordsRange const& trg = h.GetCurrTargetWordsRange();\n  WordsRange const& src = h.GetCurrSourceWordsRange();\n\n  std::map<std::string, xmlrpc_c::value> pAlnInfo;\n  pAlnInfo[\"tgt-start\"] = xmlrpc_c::value_int(trg.GetStartPos());\n  pAlnInfo[\"src-start\"] = xmlrpc_c::value_int(src.GetStartPos());\n  pAlnInfo[\"src-end\"]   = xmlrpc_c::value_int(src.GetEndPos());\n  aInfo.push_back(xmlrpc_c::value_struct(pAlnInfo));\n}\n\nvoid\nTranslationRequest::\noutputChartHypo(ostream& out, const ChartHypothesis* hypo)\n{\n  Phrase outPhrase(20);\n  hypo->GetOutputPhrase(outPhrase);\n\n  \/\/ delete 1st & last\n  assert(outPhrase.GetSize() >= 2);\n  outPhrase.RemoveWord(0);\n  outPhrase.RemoveWord(outPhrase.GetSize() - 1);\n  for (size_t pos = 0 ; pos < outPhrase.GetSize() ; pos++)\n    out << *outPhrase.GetFactor(pos, 0) << \" \";\n}\n\nbool\nTranslationRequest::\ncompareSearchGraphNode(const Moses::SearchGraphNode& a,\n                       const Moses::SearchGraphNode& b)\n{\n  return a.hypo->GetId() < b.hypo->GetId();\n}\n\nvoid\nTranslationRequest::\ninsertGraphInfo(Manager& manager, map<string, xmlrpc_c::value>& retData)\n{\n  using xmlrpc_c::value_int;\n  using xmlrpc_c::value_double;\n  using xmlrpc_c::value_struct;\n  using xmlrpc_c::value_string;\n  vector<xmlrpc_c::value> searchGraphXml;\n  vector<SearchGraphNode> searchGraph;\n  manager.GetSearchGraph(searchGraph);\n  std::sort(searchGraph.begin(), searchGraph.end());\n  BOOST_FOREACH(Moses::SearchGraphNode const& n, searchGraph) {\n    map<string, xmlrpc_c::value> x; \/\/ search graph xml node\n    x[\"forward\"] = value_double(n.forward);\n    x[\"fscore\"] = value_double(n.fscore);\n    const Hypothesis* hypo = n.hypo;\n    x[\"hyp\"] = value_int(hypo->GetId());\n    x[\"stack\"] = value_int(hypo->GetWordsBitmap().GetNumWordsCovered());\n    if (hypo->GetId() != 0) {\n      const Hypothesis *prevHypo = hypo->GetPrevHypo();\n      x[\"back\"] = value_int(prevHypo->GetId());\n      x[\"score\"] = value_double(hypo->GetScore());\n      x[\"transition\"] = value_double(hypo->GetScore() - prevHypo->GetScore());\n      if (n.recombinationHypo)\n        x[\"recombined\"] = value_int(n.recombinationHypo->GetId());\n      x[\"cover-start\"] = value_int(hypo->GetCurrSourceWordsRange().GetStartPos());\n      x[\"cover-end\"] = value_int(hypo->GetCurrSourceWordsRange().GetEndPos());\n      x[\"out\"] = value_string(hypo->GetCurrTargetPhrase().GetStringRep(StaticData::Instance().GetOutputFactorOrder()));\n    }\n    searchGraphXml.push_back(value_struct(x));\n  }\n  retData[\"sg\"] = xmlrpc_c::value_array(searchGraphXml);\n}\n\nvoid\nTranslationRequest::\noutput_phrase(ostream& out, Phrase const& phrase) const\n{\n  if (!m_reportAllFactors) {\n    for (size_t i = 0 ; i < phrase.GetSize(); ++i)\n      out << *phrase.GetFactor(i, 0) << \" \";\n  } else out << phrase;\n}\n\nvoid\nTranslationRequest::\noutputNBest(const Manager& manager, map<string, xmlrpc_c::value>& retData)\n{\n  TrellisPathList nBestList;\n  vector<xmlrpc_c::value> nBestXml;\n  manager.CalcNBest(m_nbestSize, nBestList, m_nbestDistinct);\n\n  BOOST_FOREACH(Moses::TrellisPath const* path, nBestList) {\n    vector<const Hypothesis *> const& E = path->GetEdges();\n    if (!E.size()) continue;\n    std::map<std::string, xmlrpc_c::value> nBestXmlItem;\n    pack_hypothesis(E, \"hyp\", nBestXmlItem);\n    if (m_withScoreBreakdown) {\n      \/\/ should the score breakdown be reported in a more structured manner?\n      ostringstream buf;\n      path->GetScoreBreakdown()->OutputAllFeatureScores(buf);\n      nBestXmlItem[\"fvals\"] = xmlrpc_c::value_string(buf.str());\n    }\n\n    \/\/ weighted score\n    nBestXmlItem[\"totalScore\"] = xmlrpc_c::value_double(path->GetTotalScore());\n    nBestXml.push_back(xmlrpc_c::value_struct(nBestXmlItem));\n  }\n  retData[\"nbest\"] = xmlrpc_c::value_array(nBestXml);\n}\n\nvoid\nTranslationRequest::\ninsertTranslationOptions(Moses::Manager& manager,\n                         std::map<std::string, xmlrpc_c::value>& retData)\n{\n  const TranslationOptionCollection* toptsColl\n  = manager.getSntTranslationOptions();\n  vector<xmlrpc_c::value> toptsXml;\n  size_t const stop = toptsColl->GetSource().GetSize();\n  TranslationOptionList const* tol;\n  for (size_t s = 0 ; s < stop ; ++s) {\n    for (size_t e = s;\n         (tol = toptsColl->GetTranslationOptionList(s,e)) != NULL;\n         ++e) {\n      BOOST_FOREACH(TranslationOption const* topt, *tol) {\n        std::map<std::string, xmlrpc_c::value> toptXml;\n        TargetPhrase const& tp = topt->GetTargetPhrase();\n        StaticData const& GLOBAL = StaticData::Instance();\n        std::string tphrase = tp.GetStringRep(GLOBAL.GetOutputFactorOrder());\n        toptXml[\"phrase\"] = xmlrpc_c::value_string(tphrase);\n        toptXml[\"fscore\"] = xmlrpc_c::value_double(topt->GetFutureScore());\n        toptXml[\"start\"]  = xmlrpc_c::value_int(s);\n        toptXml[\"end\"]    = xmlrpc_c::value_int(e);\n        vector<xmlrpc_c::value> scoresXml;\n        const std::valarray<FValue> &scores\n        = topt->GetScoreBreakdown().getCoreFeatures();\n        for (size_t j = 0; j < scores.size(); ++j)\n          scoresXml.push_back(xmlrpc_c::value_double(scores[j]));\n\n        toptXml[\"scores\"] = xmlrpc_c::value_array(scoresXml);\n        toptsXml.push_back(xmlrpc_c::value_struct(toptXml));\n      }\n    }\n  }\n  retData[\"topt\"] = xmlrpc_c::value_array(toptsXml);\n}\n\nbool\ncheck(std::map<std::string, xmlrpc_c::value> const& params, std::string const key)\n{\n  std::map<std::string, xmlrpc_c::value>::const_iterator m;\n  return (params.find(key) != params.end());\n}\n\nTranslationRequest::\nTranslationRequest(xmlrpc_c::paramList const& paramList,\n                   boost::condition_variable& cond, boost::mutex& mut)\n  : m_cond(cond), m_mutex(mut), m_done(false), m_paramList(paramList)\n{ }\n\nvoid\nTranslationRequest::\nparse_request(std::map<std::string, xmlrpc_c::value> const& params)\n{\n  \/\/ parse XMLRPC request\n  \/\/ params_t const params = m_paramList.getStruct(0);\n  m_paramList.verifyEnd(1); \/\/ ??? UG\n\n  \/\/ source text must be given, or we don't know what to translate\n  typedef std::map<std::string, xmlrpc_c::value> params_t;\n  params_t::const_iterator si = params.find(\"text\");\n  if (si == params.end())\n    throw xmlrpc_c::fault(\"Missing source text\", xmlrpc_c::fault::CODE_PARSE);\n  m_source_string = xmlrpc_c::value_string(si->second);\n  XVERBOSE(1,\"Input: \" << m_source_string << endl);\n\n  m_withAlignInfo       = check(params, \"align\");\n  m_withWordAlignInfo   = check(params, \"word-align\");\n  m_withGraphInfo       = check(params, \"sg\");\n  m_withTopts           = check(params, \"topt\");\n  m_reportAllFactors    = check(params, \"report-all-factors\");\n  m_nbestDistinct       = check(params, \"nbest-distinct\");\n  m_withScoreBreakdown  = check(params, \"add-score-breakdown\");\n  m_source.reset(new Sentence(0,m_source_string));\n  si = params.find(\"lambda\");\n  if (si != params.end()) {\n    \/\/ muMo = multiModel\n    xmlrpc_c::value_array muMoArray = xmlrpc_c::value_array(si->second);\n    vector<xmlrpc_c::value> muMoValVec(muMoArray.vectorValueValue());\n    vector<float> w(muMoValVec.size());\n    for (size_t i = 0; i < muMoValVec.size(); ++i)\n      w[i] = xmlrpc_c::value_double(muMoValVec[i]);\n    if (w.size() && (si = params.find(\"model_name\")) != params.end()) {\n      string const model_name = xmlrpc_c::value_string(si->second);\n      PhraseDictionaryMultiModel* pdmm\n      = (PhraseDictionaryMultiModel*) FindPhraseDictionary(model_name);\n      \/\/ Moses::PhraseDictionaryMultiModel* pdmm\n      \/\/ = FindPhraseDictionary(model_name);\n      pdmm->SetTemporaryMultiModelWeightsVector(w);\n    }\n  }\n\n  \/\/ \/\/ biased sampling for suffix-array-based sampling phrase table?\n  \/\/ if ((si = params.find(\"bias\")) != params.end())\n  \/\/   {\n  \/\/ \tstd::vector<xmlrpc_c::value> tmp\n  \/\/ \t  = xmlrpc_c::value_array(si->second).cvalue();\n  \/\/ \tfor (size_t i = 1; i < tmp.size(); i += 2)\n  \/\/ \t  m_bias[xmlrpc_c::value_int(tmp[i-1])] = xmlrpc_c::value_double(tmp[i]);\n  \/\/   }\n} \/\/ end of Translationtask::parse_request()\n\n\nvoid\nTranslationRequest::\nrun_chart_decoder()\n{\n  Moses::TreeInput tinput;\n  istringstream buf(m_source_string + \"\\n\");\n  tinput.Read(buf, StaticData::Instance().GetInputFactorOrder());\n\n  Moses::ChartManager manager(this->self());\n  manager.Decode();\n\n  const Moses::ChartHypothesis *hypo = manager.GetBestHypothesis();\n  ostringstream out;\n  outputChartHypo(out,hypo);\n\n  m_target_string = out.str();\n  m_retData[\"text\"] = xmlrpc_c::value_string(m_target_string);\n\n  if (m_withGraphInfo) {\n    std::ostringstream sgstream;\n    manager.OutputSearchGraphMoses(sgstream);\n    m_retData[\"sg\"] =  xmlrpc_c::value_string(sgstream.str());\n  }\n} \/\/ end of TranslationRequest::run_chart_decoder()\n\nvoid\nTranslationRequest::\npack_hypothesis(vector<Hypothesis const* > const& edges, string const& key,\n                map<string, xmlrpc_c::value> & dest) const\n{\n  \/\/ target string\n  ostringstream target;\n  BOOST_REVERSE_FOREACH(Hypothesis const* e, edges)\n  output_phrase(target, e->GetCurrTargetPhrase());\n  dest[key] = xmlrpc_c::value_string(target.str());\n\n  if (m_withAlignInfo) {\n    \/\/ phrase alignment, if requested\n\n    vector<xmlrpc_c::value> p_aln;\n    BOOST_REVERSE_FOREACH(Hypothesis const* e, edges)\n    add_phrase_aln_info(*e, p_aln);\n    dest[\"align\"] = xmlrpc_c::value_array(p_aln);\n  }\n\n  if (m_withWordAlignInfo) {\n    \/\/ word alignment, if requested\n    vector<xmlrpc_c::value> w_aln;\n    BOOST_FOREACH(Hypothesis const* e, edges)\n    e->OutputLocalWordAlignment(w_aln);\n    dest[\"word-align\"] = xmlrpc_c::value_array(w_aln);\n  }\n}\n\nvoid\nTranslationRequest::\npack_hypothesis(Hypothesis const* h, string const& key,\n                map<string, xmlrpc_c::value>& dest) const\n{\n  using namespace std;\n  vector<Hypothesis const*> edges;\n  for (; h; h = h->GetPrevHypo())\n    edges.push_back(h);\n  pack_hypothesis(edges, key, dest);\n}\n\n\nvoid\nTranslationRequest::\nrun_phrase_decoder()\n{\n  Manager manager(this->self());\n  \/\/ if (m_bias.size()) manager.SetBias(&m_bias);\n  manager.Decode();\n\n  pack_hypothesis(manager.GetBestHypothesis(), \"text\", m_retData);\n\n  if (m_withGraphInfo) insertGraphInfo(manager,m_retData);\n  if (m_withTopts) insertTranslationOptions(manager,m_retData);\n  if (m_nbestSize) outputNBest(manager, m_retData);\n\n  (const_cast<StaticData&>(Moses::StaticData::Instance()))\n  .SetOutputSearchGraph(false);\n  \/\/ WTF? one more reason not to have this as global variable! --- UG\n\n}\n}\n<commit_msg>Bug fix: m_nbestSize wasn't initialized in class TranslationRequest.<commit_after>#include \"TranslationRequest.h\"\n#include <boost\/foreach.hpp>\n\nnamespace MosesServer\n{\nusing namespace std;\nusing Moses::Hypothesis;\nusing Moses::StaticData;\nusing Moses::WordsRange;\nusing Moses::ChartHypothesis;\nusing Moses::Phrase;\nusing Moses::Manager;\nusing Moses::SearchGraphNode;\nusing Moses::TrellisPathList;\nusing Moses::TranslationOptionCollection;\nusing Moses::TranslationOptionList;\nusing Moses::TranslationOption;\nusing Moses::TargetPhrase;\nusing Moses::FValue;\nusing Moses::PhraseDictionaryMultiModel;\nusing Moses::FindPhraseDictionary;\nusing Moses::Sentence;\n\nboost::shared_ptr<TranslationRequest>\nTranslationRequest::\ncreate(xmlrpc_c::paramList const& paramList,\n       boost::condition_variable& cond,\n       boost::mutex& mut)\n{\n  boost::shared_ptr<TranslationRequest> ret;\n  ret.reset(new TranslationRequest(paramList,cond, mut));\n  ret->m_self = ret;\n  return ret;\n}\n\nvoid\nTranslationRequest::\nRun()\n{\n  parse_request(m_paramList.getStruct(0));\n\n  Moses::StaticData const& SD = Moses::StaticData::Instance();\n\n  \/\/Make sure alternative paths are retained, if necessary\n  if (m_withGraphInfo || m_nbestSize>0)\n    \/\/ why on earth is this a global variable? Is this even thread-safe???? UG\n    (const_cast<Moses::StaticData&>(SD)).SetOutputSearchGraph(true);\n\n  std::stringstream out, graphInfo, transCollOpts;\n\n  if (SD.IsSyntax())\n    run_chart_decoder();\n  else\n    run_phrase_decoder();\n\n  XVERBOSE(1,\"Output: \" << out.str() << endl);\n  {\n    boost::lock_guard<boost::mutex> lock(m_mutex);\n    m_done = true;\n  }\n  m_cond.notify_one();\n\n}\n\n\/\/\/ add phrase alignment information from a Hypothesis\nvoid\nTranslationRequest::\nadd_phrase_aln_info(Hypothesis const& h, vector<xmlrpc_c::value>& aInfo) const\n{\n  if (!m_withAlignInfo) return;\n  WordsRange const& trg = h.GetCurrTargetWordsRange();\n  WordsRange const& src = h.GetCurrSourceWordsRange();\n\n  std::map<std::string, xmlrpc_c::value> pAlnInfo;\n  pAlnInfo[\"tgt-start\"] = xmlrpc_c::value_int(trg.GetStartPos());\n  pAlnInfo[\"src-start\"] = xmlrpc_c::value_int(src.GetStartPos());\n  pAlnInfo[\"src-end\"]   = xmlrpc_c::value_int(src.GetEndPos());\n  aInfo.push_back(xmlrpc_c::value_struct(pAlnInfo));\n}\n\nvoid\nTranslationRequest::\noutputChartHypo(ostream& out, const ChartHypothesis* hypo)\n{\n  Phrase outPhrase(20);\n  hypo->GetOutputPhrase(outPhrase);\n\n  \/\/ delete 1st & last\n  assert(outPhrase.GetSize() >= 2);\n  outPhrase.RemoveWord(0);\n  outPhrase.RemoveWord(outPhrase.GetSize() - 1);\n  for (size_t pos = 0 ; pos < outPhrase.GetSize() ; pos++)\n    out << *outPhrase.GetFactor(pos, 0) << \" \";\n}\n\nbool\nTranslationRequest::\ncompareSearchGraphNode(const Moses::SearchGraphNode& a,\n                       const Moses::SearchGraphNode& b)\n{\n  return a.hypo->GetId() < b.hypo->GetId();\n}\n\nvoid\nTranslationRequest::\ninsertGraphInfo(Manager& manager, map<string, xmlrpc_c::value>& retData)\n{\n  using xmlrpc_c::value_int;\n  using xmlrpc_c::value_double;\n  using xmlrpc_c::value_struct;\n  using xmlrpc_c::value_string;\n  vector<xmlrpc_c::value> searchGraphXml;\n  vector<SearchGraphNode> searchGraph;\n  manager.GetSearchGraph(searchGraph);\n  std::sort(searchGraph.begin(), searchGraph.end());\n  BOOST_FOREACH(Moses::SearchGraphNode const& n, searchGraph) {\n    map<string, xmlrpc_c::value> x; \/\/ search graph xml node\n    x[\"forward\"] = value_double(n.forward);\n    x[\"fscore\"] = value_double(n.fscore);\n    const Hypothesis* hypo = n.hypo;\n    x[\"hyp\"] = value_int(hypo->GetId());\n    x[\"stack\"] = value_int(hypo->GetWordsBitmap().GetNumWordsCovered());\n    if (hypo->GetId() != 0) {\n      const Hypothesis *prevHypo = hypo->GetPrevHypo();\n      x[\"back\"] = value_int(prevHypo->GetId());\n      x[\"score\"] = value_double(hypo->GetScore());\n      x[\"transition\"] = value_double(hypo->GetScore() - prevHypo->GetScore());\n      if (n.recombinationHypo)\n        x[\"recombined\"] = value_int(n.recombinationHypo->GetId());\n      x[\"cover-start\"] = value_int(hypo->GetCurrSourceWordsRange().GetStartPos());\n      x[\"cover-end\"] = value_int(hypo->GetCurrSourceWordsRange().GetEndPos());\n      x[\"out\"] = value_string(hypo->GetCurrTargetPhrase().GetStringRep(StaticData::Instance().GetOutputFactorOrder()));\n    }\n    searchGraphXml.push_back(value_struct(x));\n  }\n  retData[\"sg\"] = xmlrpc_c::value_array(searchGraphXml);\n}\n\nvoid\nTranslationRequest::\noutput_phrase(ostream& out, Phrase const& phrase) const\n{\n  if (!m_reportAllFactors) {\n    for (size_t i = 0 ; i < phrase.GetSize(); ++i)\n      out << *phrase.GetFactor(i, 0) << \" \";\n  } else out << phrase;\n}\n\nvoid\nTranslationRequest::\noutputNBest(const Manager& manager, map<string, xmlrpc_c::value>& retData)\n{\n  TrellisPathList nBestList;\n  vector<xmlrpc_c::value> nBestXml;\n  manager.CalcNBest(m_nbestSize, nBestList, m_nbestDistinct);\n\n  BOOST_FOREACH(Moses::TrellisPath const* path, nBestList) {\n    vector<const Hypothesis *> const& E = path->GetEdges();\n    if (!E.size()) continue;\n    std::map<std::string, xmlrpc_c::value> nBestXmlItem;\n    pack_hypothesis(E, \"hyp\", nBestXmlItem);\n    if (m_withScoreBreakdown) {\n      \/\/ should the score breakdown be reported in a more structured manner?\n      ostringstream buf;\n      path->GetScoreBreakdown()->OutputAllFeatureScores(buf);\n      nBestXmlItem[\"fvals\"] = xmlrpc_c::value_string(buf.str());\n    }\n\n    \/\/ weighted score\n    nBestXmlItem[\"totalScore\"] = xmlrpc_c::value_double(path->GetTotalScore());\n    nBestXml.push_back(xmlrpc_c::value_struct(nBestXmlItem));\n  }\n  retData[\"nbest\"] = xmlrpc_c::value_array(nBestXml);\n}\n\nvoid\nTranslationRequest::\ninsertTranslationOptions(Moses::Manager& manager,\n                         std::map<std::string, xmlrpc_c::value>& retData)\n{\n  const TranslationOptionCollection* toptsColl\n  = manager.getSntTranslationOptions();\n  vector<xmlrpc_c::value> toptsXml;\n  size_t const stop = toptsColl->GetSource().GetSize();\n  TranslationOptionList const* tol;\n  for (size_t s = 0 ; s < stop ; ++s) {\n    for (size_t e = s;\n         (tol = toptsColl->GetTranslationOptionList(s,e)) != NULL;\n         ++e) {\n      BOOST_FOREACH(TranslationOption const* topt, *tol) {\n        std::map<std::string, xmlrpc_c::value> toptXml;\n        TargetPhrase const& tp = topt->GetTargetPhrase();\n        StaticData const& GLOBAL = StaticData::Instance();\n        std::string tphrase = tp.GetStringRep(GLOBAL.GetOutputFactorOrder());\n        toptXml[\"phrase\"] = xmlrpc_c::value_string(tphrase);\n        toptXml[\"fscore\"] = xmlrpc_c::value_double(topt->GetFutureScore());\n        toptXml[\"start\"]  = xmlrpc_c::value_int(s);\n        toptXml[\"end\"]    = xmlrpc_c::value_int(e);\n        vector<xmlrpc_c::value> scoresXml;\n        const std::valarray<FValue> &scores\n        = topt->GetScoreBreakdown().getCoreFeatures();\n        for (size_t j = 0; j < scores.size(); ++j)\n          scoresXml.push_back(xmlrpc_c::value_double(scores[j]));\n\n        toptXml[\"scores\"] = xmlrpc_c::value_array(scoresXml);\n        toptsXml.push_back(xmlrpc_c::value_struct(toptXml));\n      }\n    }\n  }\n  retData[\"topt\"] = xmlrpc_c::value_array(toptsXml);\n}\n\nbool\ncheck(std::map<std::string, xmlrpc_c::value> const& params, std::string const key)\n{\n  std::map<std::string, xmlrpc_c::value>::const_iterator m;\n  return (params.find(key) != params.end());\n}\n\nTranslationRequest::\nTranslationRequest(xmlrpc_c::paramList const& paramList,\n                   boost::condition_variable& cond, boost::mutex& mut)\n  : m_cond(cond), m_mutex(mut), m_done(false), m_paramList(paramList)\n  , m_nbestSize(0)\n{ }\n\nvoid\nTranslationRequest::\nparse_request(std::map<std::string, xmlrpc_c::value> const& params)\n{\n  \/\/ parse XMLRPC request\n  \/\/ params_t const params = m_paramList.getStruct(0);\n  m_paramList.verifyEnd(1); \/\/ ??? UG\n\n  \/\/ source text must be given, or we don't know what to translate\n  typedef std::map<std::string, xmlrpc_c::value> params_t;\n  params_t::const_iterator si = params.find(\"text\");\n  if (si == params.end())\n    throw xmlrpc_c::fault(\"Missing source text\", xmlrpc_c::fault::CODE_PARSE);\n  m_source_string = xmlrpc_c::value_string(si->second);\n  XVERBOSE(1,\"Input: \" << m_source_string << endl);\n\n  m_withAlignInfo       = check(params, \"align\");\n  m_withWordAlignInfo   = check(params, \"word-align\");\n  m_withGraphInfo       = check(params, \"sg\");\n  m_withTopts           = check(params, \"topt\");\n  m_reportAllFactors    = check(params, \"report-all-factors\");\n  m_nbestDistinct       = check(params, \"nbest-distinct\");\n  m_withScoreBreakdown  = check(params, \"add-score-breakdown\");\n  m_source.reset(new Sentence(0,m_source_string));\n  si = params.find(\"lambda\");\n  if (si != params.end()) {\n    \/\/ muMo = multiModel\n    xmlrpc_c::value_array muMoArray = xmlrpc_c::value_array(si->second);\n    vector<xmlrpc_c::value> muMoValVec(muMoArray.vectorValueValue());\n    vector<float> w(muMoValVec.size());\n    for (size_t i = 0; i < muMoValVec.size(); ++i)\n      w[i] = xmlrpc_c::value_double(muMoValVec[i]);\n    if (w.size() && (si = params.find(\"model_name\")) != params.end()) {\n      string const model_name = xmlrpc_c::value_string(si->second);\n      PhraseDictionaryMultiModel* pdmm\n      = (PhraseDictionaryMultiModel*) FindPhraseDictionary(model_name);\n      \/\/ Moses::PhraseDictionaryMultiModel* pdmm\n      \/\/ = FindPhraseDictionary(model_name);\n      pdmm->SetTemporaryMultiModelWeightsVector(w);\n    }\n  }\n  \n  si = params.find(\"nbest\");\n  if (si != params.end())\n    m_nbestSize = xmlrpc_c::value_int(si->second);\n  \n  \n  \/\/ \/\/ biased sampling for suffix-array-based sampling phrase table?\n  \/\/ if ((si = params.find(\"bias\")) != params.end())\n  \/\/   {\n  \/\/ \tstd::vector<xmlrpc_c::value> tmp\n  \/\/ \t  = xmlrpc_c::value_array(si->second).cvalue();\n  \/\/ \tfor (size_t i = 1; i < tmp.size(); i += 2)\n  \/\/ \t  m_bias[xmlrpc_c::value_int(tmp[i-1])] = xmlrpc_c::value_double(tmp[i]);\n  \/\/   }\n} \/\/ end of Translationtask::parse_request()\n\n\nvoid\nTranslationRequest::\nrun_chart_decoder()\n{\n  Moses::TreeInput tinput;\n  istringstream buf(m_source_string + \"\\n\");\n  tinput.Read(buf, StaticData::Instance().GetInputFactorOrder());\n\n  Moses::ChartManager manager(this->self());\n  manager.Decode();\n\n  const Moses::ChartHypothesis *hypo = manager.GetBestHypothesis();\n  ostringstream out;\n  outputChartHypo(out,hypo);\n\n  m_target_string = out.str();\n  m_retData[\"text\"] = xmlrpc_c::value_string(m_target_string);\n\n  if (m_withGraphInfo) {\n    std::ostringstream sgstream;\n    manager.OutputSearchGraphMoses(sgstream);\n    m_retData[\"sg\"] =  xmlrpc_c::value_string(sgstream.str());\n  }\n} \/\/ end of TranslationRequest::run_chart_decoder()\n\nvoid\nTranslationRequest::\npack_hypothesis(vector<Hypothesis const* > const& edges, string const& key,\n                map<string, xmlrpc_c::value> & dest) const\n{\n  \/\/ target string\n  ostringstream target;\n  BOOST_REVERSE_FOREACH(Hypothesis const* e, edges)\n  output_phrase(target, e->GetCurrTargetPhrase());\n  dest[key] = xmlrpc_c::value_string(target.str());\n\n  if (m_withAlignInfo) {\n    \/\/ phrase alignment, if requested\n\n    vector<xmlrpc_c::value> p_aln;\n    BOOST_REVERSE_FOREACH(Hypothesis const* e, edges)\n    add_phrase_aln_info(*e, p_aln);\n    dest[\"align\"] = xmlrpc_c::value_array(p_aln);\n  }\n\n  if (m_withWordAlignInfo) {\n    \/\/ word alignment, if requested\n    vector<xmlrpc_c::value> w_aln;\n    BOOST_FOREACH(Hypothesis const* e, edges)\n    e->OutputLocalWordAlignment(w_aln);\n    dest[\"word-align\"] = xmlrpc_c::value_array(w_aln);\n  }\n}\n\nvoid\nTranslationRequest::\npack_hypothesis(Hypothesis const* h, string const& key,\n                map<string, xmlrpc_c::value>& dest) const\n{\n  using namespace std;\n  vector<Hypothesis const*> edges;\n  for (; h; h = h->GetPrevHypo())\n    edges.push_back(h);\n  pack_hypothesis(edges, key, dest);\n}\n\n\nvoid\nTranslationRequest::\nrun_phrase_decoder()\n{\n  Manager manager(this->self());\n  \/\/ if (m_bias.size()) manager.SetBias(&m_bias);\n  manager.Decode();\n\n  pack_hypothesis(manager.GetBestHypothesis(), \"text\", m_retData);\n\n  if (m_withGraphInfo) insertGraphInfo(manager,m_retData);\n  if (m_withTopts) insertTranslationOptions(manager,m_retData);\n  if (m_nbestSize) outputNBest(manager, m_retData);\n\n  (const_cast<StaticData&>(Moses::StaticData::Instance()))\n  .SetOutputSearchGraph(false);\n  \/\/ WTF? one more reason not to have this as global variable! --- UG\n\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\n\/*\n    Copyright 2011 Aevum Software aevum @ aevumlab.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    @author Victor Vicente de Carvalho victor.carvalho@aevumlab.com\n    @author Ozires Bortolon de Faria ozires@aevumlab.com\n*\/\n\n#include \"FileTextureData.hpp\"\n\n#include \"gdx-cpp\/graphics\/Pixmap.hpp\"\n#include \"gdx-cpp\/files\/FileHandle.hpp\"\n#include \"gdx-cpp\/Gdx.hpp\"\n\n#include <stdexcept>\n\nusing namespace gdx;\n\ngdx::Pixmap::ptr FileTextureData::getPixmap () {\n    if (pixmap) {\n        Pixmap::ptr tmp = pixmap;\n        this->pixmap.reset();\n        return tmp;\n    } else {\n        Pixmap::ptr pixmap = Pixmap::newFromFile(file);\n        width = pixmap->getWidth();\n        height = pixmap->getHeight();\n        if (format == NULL) format = &pixmap->getFormat();\n        return pixmap;\n    }\n}\n\nbool FileTextureData::disposePixmap () {\n    return true;\n}\n\nint FileTextureData::getWidth () {\n    return width;\n}\n\nint FileTextureData::getHeight () {\n    return height;\n}\n\nconst gdx::Pixmap::Format* FileTextureData::getFormat () {\n    return format;\n}\n\nbool FileTextureData::useMipMaps () {\n    return _useMipMaps;\n}\n\nbool FileTextureData::isManaged () {\n    return true;\n}\n\ngdx::FileHandle::ptr FileTextureData::getFileHandle () {\n    return file;\n}\n\nconst TextureData::TextureDataType& FileTextureData::getType () {\n    return TextureData::TextureDataType::Pixmap;\n}\n\nvoid FileTextureData::uploadCompressedData () {\n    throw std::runtime_error(\"This TextureData implementation does not upload data itself\");\n}\n\nFileTextureData::FileTextureData(FileHandle::ptr file, gdx::Pixmap::ptr preloadedPixmap,\n                                 const Pixmap::Format* format, bool useMipMaps)\n:\nfile(file)\n, _useMipMaps(useMipMaps)\n, format(format)\n, pixmap(preloadedPixmap)\n{\n    if (!pixmap) {\n        width = pixmap->getWidth();\n        height = pixmap->getHeight();\n        if (format == NULL)\n            this->format = &pixmap->getFormat();\n    }\n}\n\n\n<commit_msg>Fixed a little error from the previous pull request<commit_after>\n\/*\n    Copyright 2011 Aevum Software aevum @ aevumlab.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    @author Victor Vicente de Carvalho victor.carvalho@aevumlab.com\n    @author Ozires Bortolon de Faria ozires@aevumlab.com\n*\/\n\n#include \"FileTextureData.hpp\"\n\n#include \"gdx-cpp\/graphics\/Pixmap.hpp\"\n#include \"gdx-cpp\/files\/FileHandle.hpp\"\n#include \"gdx-cpp\/Gdx.hpp\"\n\n#include <stdexcept>\n\nusing namespace gdx;\n\ngdx::Pixmap::ptr FileTextureData::getPixmap () {\n    if (pixmap) {\n        Pixmap::ptr tmp = pixmap;\n        this->pixmap.reset();\n        return tmp;\n    } else {\n        Pixmap::ptr pixmap = Pixmap::newFromFile(file);\n        width = pixmap->getWidth();\n        height = pixmap->getHeight();\n        if (format == NULL) format = &pixmap->getFormat();\n        return pixmap;\n    }\n}\n\nbool FileTextureData::disposePixmap () {\n    return true;\n}\n\nint FileTextureData::getWidth () {\n    return width;\n}\n\nint FileTextureData::getHeight () {\n    return height;\n}\n\nconst gdx::Pixmap::Format* FileTextureData::getFormat () {\n    return format;\n}\n\nbool FileTextureData::useMipMaps () {\n    return _useMipMaps;\n}\n\nbool FileTextureData::isManaged () {\n    return true;\n}\n\ngdx::FileHandle::ptr FileTextureData::getFileHandle () {\n    return file;\n}\n\nconst TextureData::TextureDataType& FileTextureData::getType () {\n    return TextureData::TextureDataType::Pixmap;\n}\n\nvoid FileTextureData::uploadCompressedData () {\n    throw std::runtime_error(\"This TextureData implementation does not upload data itself\");\n}\n\nFileTextureData::FileTextureData(FileHandle::ptr file, gdx::Pixmap::ptr preloadedPixmap,\n                                 const Pixmap::Format* format, bool useMipMaps)\n:\nfile(file)\n, _useMipMaps(useMipMaps)\n, format(format)\n, pixmap(preloadedPixmap)\n{\n    if (pixmap) {\n        width = pixmap->getWidth();\n        height = pixmap->getHeight();\n        if (format == NULL)\n            this->format = &pixmap->getFormat();\n    }\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * (C) Copyright 2014 Kurento (http:\/\/kurento.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#ifdef HAVE_CONFIG_H\n#include \"config.h\"\n#endif\n\n#include \"kmsopencvfilter.h\"\n\n#include <gst\/gst.h>\n#include <gst\/video\/video.h>\n#include <gst\/video\/gstvideofilter.h>\n#include <glib\/gstdio.h>\n#include <opencv2\/opencv.hpp>\n#include <memory>\n#include \"OpenCVProcess.hpp\"\n#include <KurentoException.hpp>\n\n#define PLUGIN_NAME \"opencvfilter\"\n\nusing namespace cv;\n\n#define KMS_OPENCV_FILTER_LOCK(opencv_filter) \\\n  (g_rec_mutex_lock (&( (KmsOpenCVFilter *) opencv_filter)->priv->mutex))\n\n#define KMS_OPENCV_FILTER_UNLOCK(opencv_filter) \\\n  (g_rec_mutex_unlock (&( (KmsOpenCVFilter *) opencv_filter)->priv->mutex))\n\nGST_DEBUG_CATEGORY_STATIC (kms_opencv_filter_debug_category);\n#define GST_CAT_DEFAULT kms_opencv_filter_debug_category\n\n#define KMS_OPENCV_FILTER_GET_PRIVATE(obj) (    \\\n    G_TYPE_INSTANCE_GET_PRIVATE (               \\\n        (obj),                                  \\\n        KMS_TYPE_OPENCV_FILTER,                 \\\n        KmsOpenCVFilterPrivate                  \\\n                                )               \\\n                                           )\n\nenum {\n  PROP_0,\n  PROP_TARGET_OBJECT,\n  N_PROPERTIES\n};\n\nstruct _KmsOpenCVFilterPrivate {\n  GRecMutex mutex;\n  Mat *cv_image;\n  kurento::OpenCVProcess *object;\n};\n\n\/* pad templates *\/\n\n#define VIDEO_SRC_CAPS \\\n  GST_VIDEO_CAPS_MAKE(\"{ BGRA }\")\n\n#define VIDEO_SINK_CAPS \\\n  GST_VIDEO_CAPS_MAKE(\"{ BGRA }\")\n\n\/* class initialization *\/\n\nG_DEFINE_TYPE_WITH_CODE (KmsOpenCVFilter, kms_opencv_filter,\n                         GST_TYPE_VIDEO_FILTER,\n                         GST_DEBUG_CATEGORY_INIT (kms_opencv_filter_debug_category,\n                             PLUGIN_NAME, 0,\n                             \"debug category for opencv_filter element\") );\n\nstatic void\nkms_opencv_filter_set_property (GObject *object, guint property_id,\n                                const GValue *value, GParamSpec *pspec)\n{\n  KmsOpenCVFilter *opencv_filter = KMS_OPENCV_FILTER (object);\n\n  KMS_OPENCV_FILTER_LOCK (opencv_filter);\n\n  switch (property_id) {\n  case PROP_TARGET_OBJECT:\n    try {\n      opencv_filter->priv->object = dynamic_cast<kurento::OpenCVProcess *> ( (\n                                      kurento::OpenCVProcess *) g_value_get_pointer (value) );\n    } catch (std::bad_cast &e) {\n      opencv_filter->priv->object = nullptr;\n      GST_ERROR ( \"Object type not valid\");\n    }\n\n    break;\n\n  default:\n    G_OBJECT_WARN_INVALID_PROPERTY_ID (object, property_id, pspec);\n    break;\n  }\n\n  KMS_OPENCV_FILTER_UNLOCK (opencv_filter);\n}\n\nstatic void\nkms_opencv_filter_get_property (GObject *object, guint property_id,\n                                GValue *value, GParamSpec *pspec)\n{\n  KmsOpenCVFilter *opencv_filter = KMS_OPENCV_FILTER (object);\n\n  KMS_OPENCV_FILTER_LOCK (opencv_filter);\n\n  switch (property_id) {\n  case PROP_TARGET_OBJECT:\n    g_value_set_pointer (value, (gpointer) opencv_filter->priv->object);\n    break;\n\n  default:\n    G_OBJECT_WARN_INVALID_PROPERTY_ID (object, property_id, pspec);\n    break;\n  }\n\n  KMS_OPENCV_FILTER_UNLOCK (opencv_filter);\n}\n\nstatic void\nkms_opencv_filter_initialize_images (KmsOpenCVFilter *opencv_filter,\n                                     GstVideoFrame *frame, GstMapInfo &info)\n{\n  if (opencv_filter->priv->cv_image == nullptr) {\n\n    opencv_filter->priv->cv_image = new Mat (frame->info.height,\n        frame->info.width, CV_8UC4, info.data);\n\n  } else if ( (opencv_filter->priv->cv_image->cols != frame->info.width)\n              || (opencv_filter->priv->cv_image->rows != frame->info.height) ) {\n\n    delete opencv_filter->priv->cv_image;\n\n    opencv_filter->priv->cv_image = new Mat (frame->info.height,\n        frame->info.width, CV_8UC4, info.data);\n\n  } else {\n    opencv_filter->priv->cv_image->data = info.data;\n  }\n}\n\nstatic GstFlowReturn\nkms_opencv_filter_transform_frame_ip (GstVideoFilter *filter,\n                                      GstVideoFrame *frame)\n{\n  KmsOpenCVFilter *opencv_filter = KMS_OPENCV_FILTER (filter);\n  GstMapInfo info{};\n\n  if (opencv_filter->priv->object == nullptr) {\n    return GST_FLOW_OK;\n  }\n\n  gst_buffer_map (frame->buffer, &info, GST_MAP_READ);\n\n  kms_opencv_filter_initialize_images (opencv_filter, frame, info);\n\n  try {\n    opencv_filter->priv->object->process (* (opencv_filter->priv->cv_image) );\n  } catch (kurento::KurentoException &e) {\n    GstMessage *message;\n    GError *err = g_error_new (g_quark_from_string (e.getType ().c_str () ),\n                               e.getCode (), \"%s\", GST_ELEMENT_NAME (opencv_filter) );\n\n    message = gst_message_new_error (GST_OBJECT (opencv_filter),\n                                     err, e.getMessage ().c_str () );\n\n    gst_element_post_message (GST_ELEMENT (opencv_filter),\n                              message);\n\n    g_clear_error (&err);\n  } catch (...) {\n    GstMessage *message;\n    GError *err = g_error_new (g_quark_from_string (\"UNDEFINED_EXCEPTION\"),\n                               0, \"%s\", GST_ELEMENT_NAME (opencv_filter) );\n\n    message = gst_message_new_error (GST_OBJECT (opencv_filter),\n                                     err, \"Undefined filter error\");\n\n    gst_element_post_message (GST_ELEMENT (opencv_filter),\n                              message);\n\n    g_clear_error (&err);\n  }\n\n  gst_buffer_unmap (frame->buffer, &info);\n  return GST_FLOW_OK;\n}\n\nstatic void\nkms_opencv_filter_dispose (GObject *object)\n{\n}\n\nstatic void\nkms_opencv_filter_finalize (GObject *object)\n{\n  KmsOpenCVFilter *opencv_filter = KMS_OPENCV_FILTER (object);\n\n  if (opencv_filter->priv->cv_image != nullptr) {\n    delete opencv_filter->priv->cv_image;\n  }\n\n  g_rec_mutex_clear (&opencv_filter->priv->mutex);\n}\n\nstatic void\nkms_opencv_filter_init (KmsOpenCVFilter *\n                        opencv_filter)\n{\n  opencv_filter->priv = KMS_OPENCV_FILTER_GET_PRIVATE (opencv_filter);\n  g_rec_mutex_init (&opencv_filter->priv->mutex);\n}\n\nstatic void\nkms_opencv_filter_class_init (KmsOpenCVFilterClass *klass)\n{\n  GObjectClass *gobject_class = G_OBJECT_CLASS (klass);\n  GstVideoFilterClass *video_filter_class = GST_VIDEO_FILTER_CLASS (klass);\n\n  GST_DEBUG_CATEGORY_INIT (GST_CAT_DEFAULT, PLUGIN_NAME, 0, PLUGIN_NAME);\n\n  gst_element_class_add_pad_template (GST_ELEMENT_CLASS (klass),\n                                      gst_pad_template_new (\"src\", GST_PAD_SRC,\n                                          GST_PAD_ALWAYS,\n                                          gst_caps_from_string (VIDEO_SRC_CAPS) ) );\n  gst_element_class_add_pad_template (GST_ELEMENT_CLASS (klass),\n                                      gst_pad_template_new (\"sink\", GST_PAD_SINK,\n                                          GST_PAD_ALWAYS,\n                                          gst_caps_from_string (VIDEO_SINK_CAPS) ) );\n\n  gst_element_class_set_static_metadata (GST_ELEMENT_CLASS (klass),\n                                         \"generic opencv element\", \"Video\/Filter\",\n                                         \"Create a generic opencv filter to process images\",\n                                         \"David Fernandez <d.fernandezlop@gmail.com>\");\n\n  gobject_class->set_property = kms_opencv_filter_set_property;\n  gobject_class->get_property = kms_opencv_filter_get_property;\n  gobject_class->dispose = kms_opencv_filter_dispose;\n  gobject_class->finalize = kms_opencv_filter_finalize;\n\n  g_object_class_install_property (gobject_class, PROP_TARGET_OBJECT,\n                                   g_param_spec_pointer (\"target-object\", \"target object\",\n                                       \"Reference to target object\",\n                                       (GParamFlags) G_PARAM_READWRITE) );\n\n  video_filter_class->transform_frame_ip =\n    GST_DEBUG_FUNCPTR (kms_opencv_filter_transform_frame_ip);\n\n  \/* Properties initialization *\/\n  g_type_class_add_private (klass, sizeof (KmsOpenCVFilterPrivate) );\n}\n\ngboolean\nkms_opencv_filter_plugin_init (GstPlugin *plugin)\n{\n  return gst_element_register (plugin, PLUGIN_NAME, GST_RANK_NONE,\n                               KMS_TYPE_OPENCV_FILTER);\n}\n<commit_msg>clang-tidy-9 fix: [bugprone-*]<commit_after>\/*\n * (C) Copyright 2014 Kurento (http:\/\/kurento.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#ifdef HAVE_CONFIG_H\n#include \"config.h\"\n#endif\n\n#include \"kmsopencvfilter.h\"\n\n#include <gst\/gst.h>\n#include <gst\/video\/video.h>\n#include <gst\/video\/gstvideofilter.h>\n#include <glib\/gstdio.h>\n#include <opencv2\/opencv.hpp>\n#include <memory>\n#include \"OpenCVProcess.hpp\"\n#include <KurentoException.hpp>\n\n#define PLUGIN_NAME \"opencvfilter\"\n\nusing namespace cv;\n\n#define KMS_OPENCV_FILTER_LOCK(opencv_filter) \\\n  (g_rec_mutex_lock (&( (KmsOpenCVFilter *) (opencv_filter))->priv->mutex))\n\n#define KMS_OPENCV_FILTER_UNLOCK(opencv_filter) \\\n  (g_rec_mutex_unlock (&( (KmsOpenCVFilter *) (opencv_filter))->priv->mutex))\n\nGST_DEBUG_CATEGORY_STATIC (kms_opencv_filter_debug_category);\n#define GST_CAT_DEFAULT kms_opencv_filter_debug_category\n\n#define KMS_OPENCV_FILTER_GET_PRIVATE(obj) (    \\\n    G_TYPE_INSTANCE_GET_PRIVATE (               \\\n        (obj),                                  \\\n        KMS_TYPE_OPENCV_FILTER,                 \\\n        KmsOpenCVFilterPrivate                  \\\n                                )               \\\n                                           )\n\nenum {\n  PROP_0,\n  PROP_TARGET_OBJECT,\n  N_PROPERTIES\n};\n\nstruct _KmsOpenCVFilterPrivate {\n  GRecMutex mutex;\n  Mat *cv_image;\n  kurento::OpenCVProcess *object;\n};\n\n\/* pad templates *\/\n\n#define VIDEO_SRC_CAPS \\\n  GST_VIDEO_CAPS_MAKE(\"{ BGRA }\")\n\n#define VIDEO_SINK_CAPS \\\n  GST_VIDEO_CAPS_MAKE(\"{ BGRA }\")\n\n\/* class initialization *\/\n\nG_DEFINE_TYPE_WITH_CODE (KmsOpenCVFilter, kms_opencv_filter,\n                         GST_TYPE_VIDEO_FILTER,\n                         GST_DEBUG_CATEGORY_INIT (kms_opencv_filter_debug_category,\n                             PLUGIN_NAME, 0,\n                             \"debug category for opencv_filter element\") );\n\nstatic void\nkms_opencv_filter_set_property (GObject *object, guint property_id,\n                                const GValue *value, GParamSpec *pspec)\n{\n  KmsOpenCVFilter *opencv_filter = KMS_OPENCV_FILTER (object);\n\n  KMS_OPENCV_FILTER_LOCK (opencv_filter);\n\n  switch (property_id) {\n  case PROP_TARGET_OBJECT:\n    try {\n      opencv_filter->priv->object = dynamic_cast<kurento::OpenCVProcess *> ( (\n                                      kurento::OpenCVProcess *) g_value_get_pointer (value) );\n    } catch (std::bad_cast &e) {\n      opencv_filter->priv->object = nullptr;\n      GST_ERROR ( \"Object type not valid\");\n    }\n\n    break;\n\n  default:\n    G_OBJECT_WARN_INVALID_PROPERTY_ID (object, property_id, pspec);\n    break;\n  }\n\n  KMS_OPENCV_FILTER_UNLOCK (opencv_filter);\n}\n\nstatic void\nkms_opencv_filter_get_property (GObject *object, guint property_id,\n                                GValue *value, GParamSpec *pspec)\n{\n  KmsOpenCVFilter *opencv_filter = KMS_OPENCV_FILTER (object);\n\n  KMS_OPENCV_FILTER_LOCK (opencv_filter);\n\n  switch (property_id) {\n  case PROP_TARGET_OBJECT:\n    g_value_set_pointer (value, (gpointer) opencv_filter->priv->object);\n    break;\n\n  default:\n    G_OBJECT_WARN_INVALID_PROPERTY_ID (object, property_id, pspec);\n    break;\n  }\n\n  KMS_OPENCV_FILTER_UNLOCK (opencv_filter);\n}\n\nstatic void\nkms_opencv_filter_initialize_images (KmsOpenCVFilter *opencv_filter,\n                                     GstVideoFrame *frame, GstMapInfo &info)\n{\n  if (opencv_filter->priv->cv_image == nullptr) {\n\n    opencv_filter->priv->cv_image = new Mat (frame->info.height,\n        frame->info.width, CV_8UC4, info.data);\n\n  } else if ( (opencv_filter->priv->cv_image->cols != frame->info.width)\n              || (opencv_filter->priv->cv_image->rows != frame->info.height) ) {\n\n    delete opencv_filter->priv->cv_image;\n\n    opencv_filter->priv->cv_image = new Mat (frame->info.height,\n        frame->info.width, CV_8UC4, info.data);\n\n  } else {\n    opencv_filter->priv->cv_image->data = info.data;\n  }\n}\n\nstatic GstFlowReturn\nkms_opencv_filter_transform_frame_ip (GstVideoFilter *filter,\n                                      GstVideoFrame *frame)\n{\n  KmsOpenCVFilter *opencv_filter = KMS_OPENCV_FILTER (filter);\n  GstMapInfo info{};\n\n  if (opencv_filter->priv->object == nullptr) {\n    return GST_FLOW_OK;\n  }\n\n  gst_buffer_map (frame->buffer, &info, GST_MAP_READ);\n\n  kms_opencv_filter_initialize_images (opencv_filter, frame, info);\n\n  try {\n    opencv_filter->priv->object->process (* (opencv_filter->priv->cv_image) );\n  } catch (kurento::KurentoException &e) {\n    GstMessage *message;\n    GError *err = g_error_new (g_quark_from_string (e.getType ().c_str () ),\n                               e.getCode (), \"%s\", GST_ELEMENT_NAME (opencv_filter) );\n\n    message = gst_message_new_error (GST_OBJECT (opencv_filter),\n                                     err, e.getMessage ().c_str () );\n\n    gst_element_post_message (GST_ELEMENT (opencv_filter),\n                              message);\n\n    g_clear_error (&err);\n  } catch (...) {\n    GstMessage *message;\n    GError *err = g_error_new (g_quark_from_string (\"UNDEFINED_EXCEPTION\"),\n                               0, \"%s\", GST_ELEMENT_NAME (opencv_filter) );\n\n    message = gst_message_new_error (GST_OBJECT (opencv_filter),\n                                     err, \"Undefined filter error\");\n\n    gst_element_post_message (GST_ELEMENT (opencv_filter),\n                              message);\n\n    g_clear_error (&err);\n  }\n\n  gst_buffer_unmap (frame->buffer, &info);\n  return GST_FLOW_OK;\n}\n\nstatic void\nkms_opencv_filter_dispose (GObject *object)\n{\n}\n\nstatic void\nkms_opencv_filter_finalize (GObject *object)\n{\n  KmsOpenCVFilter *opencv_filter = KMS_OPENCV_FILTER (object);\n\n  if (opencv_filter->priv->cv_image != nullptr) {\n    delete opencv_filter->priv->cv_image;\n  }\n\n  g_rec_mutex_clear (&opencv_filter->priv->mutex);\n}\n\nstatic void\nkms_opencv_filter_init (KmsOpenCVFilter *\n                        opencv_filter)\n{\n  opencv_filter->priv = KMS_OPENCV_FILTER_GET_PRIVATE (opencv_filter);\n  g_rec_mutex_init (&opencv_filter->priv->mutex);\n}\n\nstatic void\nkms_opencv_filter_class_init (KmsOpenCVFilterClass *klass)\n{\n  GObjectClass *gobject_class = G_OBJECT_CLASS (klass);\n  GstVideoFilterClass *video_filter_class = GST_VIDEO_FILTER_CLASS (klass);\n\n  GST_DEBUG_CATEGORY_INIT (GST_CAT_DEFAULT, PLUGIN_NAME, 0, PLUGIN_NAME);\n\n  gst_element_class_add_pad_template (GST_ELEMENT_CLASS (klass),\n                                      gst_pad_template_new (\"src\", GST_PAD_SRC,\n                                          GST_PAD_ALWAYS,\n                                          gst_caps_from_string (VIDEO_SRC_CAPS) ) );\n  gst_element_class_add_pad_template (GST_ELEMENT_CLASS (klass),\n                                      gst_pad_template_new (\"sink\", GST_PAD_SINK,\n                                          GST_PAD_ALWAYS,\n                                          gst_caps_from_string (VIDEO_SINK_CAPS) ) );\n\n  gst_element_class_set_static_metadata (GST_ELEMENT_CLASS (klass),\n                                         \"generic opencv element\", \"Video\/Filter\",\n                                         \"Create a generic opencv filter to process images\",\n                                         \"David Fernandez <d.fernandezlop@gmail.com>\");\n\n  gobject_class->set_property = kms_opencv_filter_set_property;\n  gobject_class->get_property = kms_opencv_filter_get_property;\n  gobject_class->dispose = kms_opencv_filter_dispose;\n  gobject_class->finalize = kms_opencv_filter_finalize;\n\n  g_object_class_install_property (gobject_class, PROP_TARGET_OBJECT,\n                                   g_param_spec_pointer (\"target-object\", \"target object\",\n                                       \"Reference to target object\",\n                                       (GParamFlags) G_PARAM_READWRITE) );\n\n  video_filter_class->transform_frame_ip =\n    GST_DEBUG_FUNCPTR (kms_opencv_filter_transform_frame_ip);\n\n  \/* Properties initialization *\/\n  g_type_class_add_private (klass, sizeof (KmsOpenCVFilterPrivate) );\n}\n\ngboolean\nkms_opencv_filter_plugin_init (GstPlugin *plugin)\n{\n  return gst_element_register (plugin, PLUGIN_NAME, GST_RANK_NONE,\n                               KMS_TYPE_OPENCV_FILTER);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\tCopyright (C) 1998, 1999 by Nathaniel 'NooTe' Saint Martin\n\tCopyright (C) 1998, 1999 by Jorrit Tyberghein\n\tWritten by Nathaniel 'NooTe' Saint Martin\n\n\tThis library is free software; you can redistribute it and\/or\n\tmodify it under the terms of the GNU Library General Public\n\tLicense as published by the Free Software Foundation; either\n\tversion 2 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\tLibrary General Public License for more details.\n\n\tYou should have received a copy of the GNU Library General Public\n\tLicense along with this library; if not, write to the Free\n\tSoftware Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.\n*\/\n\n#include \"cssysdef.h\"\n#include <stdio.h>\n#include <mmsystem.h>\n\n#include \"csutil\/scf.h\"\n#include \"isystem.h\"\n#include \"isndrdr.h\"\n#include \"icfgfile.h\"\n#include \"wodrv.h\"\n\n#define MYMMSYSERR_NOCREATETHREAD 12\n\ntypedef struct\n{\n\tcsSoundDriverWaveOut *driver;\n\tHGLOBAL hHeader;\n  LPBYTE lpSoundData;\n} SoundBlock;\n\n#define NUM_ThreadPriority 3\nstruct\n{\n  int  priority;\n  char *name;\n} ThreadPriority[NUM_ThreadPriority]=\n{\n  { THREAD_PRIORITY_LOWEST, \"lowest\"},\n  { THREAD_PRIORITY_NORMAL, \"normal\"},\n  { THREAD_PRIORITY_HIGHEST, \"highest\"}\n};\n\nIMPLEMENT_FACTORY (csSoundDriverWaveOut)\n\nEXPORT_CLASS_TABLE (sndwaveout)\n  EXPORT_CLASS (csSoundDriverWaveOut, \"crystalspace.sound.driver.waveout\",\n    \"Software Sound Driver for Crystal Space\")\nEXPORT_CLASS_TABLE_END\n\nIMPLEMENT_IBASE(csSoundDriverWaveOut)\n\tIMPLEMENTS_INTERFACE(iPlugIn)\n\tIMPLEMENTS_INTERFACE(iSoundDriver)\nIMPLEMENT_IBASE_END\n\ncsSoundDriverWaveOut::csSoundDriverWaveOut(iBase *piBase)\n{\n  CONSTRUCT_IBASE(piBase);\n\n  m_piSystem = NULL;\n  m_piSoundRender = NULL;\n  MemorySize = 0;\n  Memory = NULL;\n  volume = 1.0;\n  hwo = NULL;\n  hThread = NULL;\n  dwThread = 0;\n}\n\ncsSoundDriverWaveOut::~csSoundDriverWaveOut()\n{\n  m_piSystem->Printf (MSG_CONSOLE, \"\\nSoundDriver Destructor !!!!\\n\");\n}\n\nbool csSoundDriverWaveOut::Initialize (iSystem *iSys)\n{\n  m_piSystem = iSys;\n  return true;\n}\n\nbool csSoundDriverWaveOut::Open(iSoundRender *render, int frequency, bool bit16, bool stereo)\n{\n  m_piSystem->Printf (MSG_INITIALIZATION, \"SoundDriver waveOut selected\\n\");\n\n  m_piSystem->Printf (MSG_INITIALIZATION,\n    \"trying to init sound driver to freq=%d, bit16=%d, stereo=%d\\n\",frequency,bit16,stereo);\n\n  if (!render) return false;\n  m_piSoundRender = render;\n  m_piSoundRender->IncRef();\n\n  Config = m_piSystem->CreateConfig (\"\/config\/sound.cfg\");\n\n  MMRESULT res;\n  WAVEFORMATEX format;\n  memset(&format, 0, sizeof(WAVEFORMATEX));\n  format.wFormatTag = WAVE_FORMAT_PCM;\n  if(stereo)\n    format.nChannels = 2;\n  else\n    format.nChannels = 1;\n  format.nSamplesPerSec = frequency;\n  if(bit16)\n    format.wBitsPerSample = 16;\n  else\n    format.wBitsPerSample = 8;\n  format.nBlockAlign = format.nChannels * format.wBitsPerSample \/ 8;\n  format.nAvgBytesPerSec = format.nBlockAlign * format.nSamplesPerSec;\n  format.cbSize = 0;\n\n  m_nFrequency = frequency;\n  m_b16Bits = bit16;\n  m_bStereo = stereo;\n\n  const char *callback_func=Config->GetStr\n    (\"SoundDriver.WaveOut\", \"CALLBACK\", \"function\");\n  const char *thread_func=Config->GetStr\n    (\"SoundDriver.WaveOut\", \"THREAD_PRIORITY\", \"normal\");\n  bool threading = false;\n\n  if(stricmp(callback_func, \"thread\")==0)\n    threading = true;\n\n  unsigned int refresh=Config->GetInt(\"SoundDriver.WaveOut\", \"REFRESH\", 5);\n\n\/\/  if(refresh>format.nAvgBytesPerSec) refresh=format.nAvgBytesPerSec;\n\n  MemorySize = format.nAvgBytesPerSec\/refresh;\n  MemorySize -=(MemorySize%format.nBlockAlign);\n  Memory = NULL;\n\n  \/\/ Open the playback device\n  if(threading)\n  {\n    m_piSystem->Printf (MSG_INITIALIZATION, \"SoundDriver use thread method\\n\");\n    hThread = CreateThread(NULL, 0, &waveOutThreadProc, this, 0, &dwThread);\n    if(hThread)\n    {\n      for(int p=0; p<NUM_ThreadPriority; p++)\n        if(stricmp(ThreadPriority[p].name, thread_func) == 0)\n        {\n          if(SetThreadPriority(hThread, ThreadPriority[p].priority)!=0)\n            m_piSystem->Printf (MSG_INITIALIZATION, \"SoundDriver thread set to %s priority\\n\", ThreadPriority[p].name);\n          break;\n        }\n      res = waveOutOpen(&hwo, WAVE_MAPPER, &format, (LONG)dwThread, 0L, CALLBACK_THREAD);\n    }\n    else\n      res = MYMMSYSERR_NOCREATETHREAD;\n  }\n  else\n  {\n    m_piSystem->Printf (MSG_INITIALIZATION, \"SoundDriver use function callback method\\n\");\n    res=waveOutOpen(&hwo, WAVE_MAPPER, &format, (LONG)&waveOutProc, 0L, CALLBACK_FUNCTION);\n  }\n  if(res!=MMSYSERR_NOERROR)\n  {\n    switch(res)\n    {\n      case MYMMSYSERR_NOCREATETHREAD:\n        m_piSystem->Printf (MSG_FATAL_ERROR, \"WaveOut error : Cannot create thread !\");\n        break;\n\n      case MMSYSERR_ALLOCATED:\n        m_piSystem->Printf (MSG_FATAL_ERROR, \"WaveOut error : Ressource already allocated by an other program !\");\n        break;\n\n      case MMSYSERR_BADDEVICEID:\n        m_piSystem->Printf (MSG_FATAL_ERROR, \"WaveOut error : Bad device !\");\n        break;\n\n      case MMSYSERR_NODRIVER:\n        m_piSystem->Printf (MSG_FATAL_ERROR, \"WaveOut error : there is no device !\");\n        break;\n\n      case MMSYSERR_NOMEM:\n        m_piSystem->Printf (MSG_FATAL_ERROR, \"WaveOut error : Unable to allocate memory !\");\n        break;\n\n      case WAVERR_BADFORMAT:\n        m_piSystem->Printf (MSG_FATAL_ERROR, \"WaveOut error : Unsupported audio format !\");\n        break;\n\n      default:\n        m_piSystem->Printf (MSG_FATAL_ERROR, \"WaveOut error : Inknown Error !\");\n        break;\n    }\n    return E_FAIL;\n  }\n\n  waveOutGetVolume(hwo, &old_Volume);\n  int old_v2=old_Volume&0xffff;\n  SetVolume((float)old_v2\/(float)65535.0);\n\t\n  SoundProc(NULL);\n  m_piSystem->Printf (MSG_INITIALIZATION, \"SoundDriver initialized to %d Hz %d bits %s\\n\",\n    m_nFrequency, (m_b16Bits)?16:8, (m_bStereo)?\"Stereo\":\"Mono\");\n  return S_OK;\n}\n\nvoid csSoundDriverWaveOut::Close()\n{\n  if (hwo)\n  {\n    waveOutSetVolume(hwo, old_Volume);\n    waveOutReset(hwo);\n    waveOutClose(hwo);\n    hwo=NULL;\n  }\n\n  if( m_piSoundRender ) \n  {\n    m_piSoundRender->DecRef();\n    m_piSoundRender = NULL;\n  }\n\n  Memory = NULL;\n}\n\nvoid csSoundDriverWaveOut::SetVolume(float vol)\n{\n  if(vol<0)\n    vol = 0;\n  else if (vol>1)\n    vol = 1;\n\n  if(hwo)\n  {\n    unsigned long av=(unsigned long)(vol*65535.0);\n    av=(av<<16)|av;\n    waveOutSetVolume(hwo, av);\n  }\n\n  volume = vol;\n}\n\nfloat csSoundDriverWaveOut::GetVolume()\n{\n  return volume;\n}\n\nvoid csSoundDriverWaveOut::LockMemory(void **mem, int *memsize)\n{\n  *mem = Memory;\n  *memsize = MemorySize;\n}\n\nvoid csSoundDriverWaveOut::UnlockMemory()\n{\n}\n\nbool csSoundDriverWaveOut::IsBackground()\n{\n  return true;\n}\n\nbool csSoundDriverWaveOut::Is16Bits()\n{\n  return m_b16Bits;\n}\n\nbool csSoundDriverWaveOut::IsStereo()\n{\n  return m_bStereo;\n}\n\nbool csSoundDriverWaveOut::IsHandleVoidSound()\n{\n  return false;\n}\n\nint csSoundDriverWaveOut::GetFrequency()\n{\n  return m_nFrequency;\n}\n\nstatic bool are_you_playing = false;\n\nDWORD WINAPI csSoundDriverWaveOut::waveOutThreadProc( LPVOID dwParam)\n{\n  csSoundDriverWaveOut *snd = (csSoundDriverWaveOut *)dwParam;\n  MSG msg;\n\n  while(1) {\n    WaitMessage();\n    if(GetMessage( &msg, NULL, 0, 0 ) ) {\n      if(msg.message==MM_WOM_DONE) {\n        if(snd==NULL || snd->hwo==NULL) continue;\n        LPWAVEHDR OldHeader=(LPWAVEHDR)(msg.lParam);\n        snd->SoundProc(OldHeader);\n      }\n      TranslateMessage(&msg); \n      DispatchMessage(&msg);\n    } else return msg.wParam;\n  }\n  return 0xFFFFFFFF;\n}\n\nvoid CALLBACK csSoundDriverWaveOut::waveOutProc(HWAVEOUT \/*hwo*\/, UINT uMsg, DWORD \/*dwInstance*\/, \n                                                DWORD dwParam1, DWORD \/*dwParam2*\/)\n{\n  if (uMsg==MM_WOM_DONE) {\n    LPWAVEHDR OldHeader = (LPWAVEHDR)dwParam1;\n    \/\/ void data ?\n    if(OldHeader->dwUser==NULL || OldHeader->dwUser==0xcdcdcdcd ) return;\n    SoundBlock *block = (SoundBlock *)OldHeader->dwUser;\n    csSoundDriverWaveOut *Driver = block->driver;\n    Driver->SoundProc(OldHeader);\n  }\n}\n\nvoid csSoundDriverWaveOut::SoundProc(LPWAVEHDR OldHeader) {\n  \/\/ wait for the previous call to exit\n  while (are_you_playing);\n  \/\/ lock this function\n  are_you_playing = true;\n\n  SoundBlock *Block;\n\n  if (OldHeader) {\n    \/\/ get the previous sound block\n    Block = (SoundBlock *)(OldHeader->dwUser);\n\n    \/\/ Free this block up\n    waveOutUnprepareHeader(hwo, OldHeader, sizeof(WAVEHDR));\n    GlobalUnlock(Block->hHeader);\n    GlobalFree(Block->hHeader);\n    delete Block;\n  }\n\n  \/\/ create a new block\n  Block = new SoundBlock();\n  Block->driver = this;\n  Block->hHeader = GlobalAlloc(GMEM_MOVEABLE | GMEM_SHARE, sizeof(WAVEHDR)+MemorySize);\n  Block->lpSoundData = (LPBYTE)GlobalLock(Block->hHeader);\n\n  \/\/ Set up various pointers\n  LPWAVEHDR lpWaveHdr = (LPWAVEHDR)Block->lpSoundData;\n  Memory = (unsigned char *)&Block->lpSoundData[sizeof(WAVEHDR)];\n  if(Memory == NULL) return;\n\n  \/\/ call the sound renderer mixing function\n  m_piSoundRender->MixingFunction();\n  \n  \/\/ Set up and prepare header. \n  lpWaveHdr->lpData = (char *)Memory;\n  lpWaveHdr->dwBufferLength = MemorySize;\n  lpWaveHdr->dwFlags = 0L;\n  lpWaveHdr->dwLoops = 0L;\n  lpWaveHdr->dwUser = (DWORD)Block;\n  waveOutPrepareHeader(hwo, lpWaveHdr, sizeof(WAVEHDR));\n\n  \/\/ Now the data block can be sent to the output device. The \n  \/\/ waveOutWrite function returns immediately and waveform \n  \/\/ data is sent to the output device in the background.\n  MMRESULT result = waveOutWrite(hwo, lpWaveHdr, sizeof(WAVEHDR)); \n  if (result != 0) { \n    waveOutUnprepareHeader(hwo, lpWaveHdr, sizeof(WAVEHDR)); \n    GlobalUnlock(Block->hHeader);\n    GlobalFree(Block->hHeader);\n    delete Block;\n  }\n  \n  \/\/ unlock this function\n  are_you_playing = false;\n}\n<commit_msg>Fixed bug: Was leaking iConfigFile.<commit_after>\/*\n\tCopyright (C) 1998, 1999 by Nathaniel 'NooTe' Saint Martin\n\tCopyright (C) 1998, 1999 by Jorrit Tyberghein\n\tWritten by Nathaniel 'NooTe' Saint Martin\n\n\tThis library is free software; you can redistribute it and\/or\n\tmodify it under the terms of the GNU Library General Public\n\tLicense as published by the Free Software Foundation; either\n\tversion 2 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\tLibrary General Public License for more details.\n\n\tYou should have received a copy of the GNU Library General Public\n\tLicense along with this library; if not, write to the Free\n\tSoftware Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.\n*\/\n\n#include \"cssysdef.h\"\n#include <stdio.h>\n#include <mmsystem.h>\n\n#include \"csutil\/scf.h\"\n#include \"isystem.h\"\n#include \"isndrdr.h\"\n#include \"icfgfile.h\"\n#include \"wodrv.h\"\n\n#define MYMMSYSERR_NOCREATETHREAD 12\n\ntypedef struct\n{\n\tcsSoundDriverWaveOut *driver;\n\tHGLOBAL hHeader;\n  LPBYTE lpSoundData;\n} SoundBlock;\n\n#define NUM_ThreadPriority 3\nstruct\n{\n  int  priority;\n  char *name;\n} ThreadPriority[NUM_ThreadPriority]=\n{\n  { THREAD_PRIORITY_LOWEST, \"lowest\"},\n  { THREAD_PRIORITY_NORMAL, \"normal\"},\n  { THREAD_PRIORITY_HIGHEST, \"highest\"}\n};\n\nIMPLEMENT_FACTORY (csSoundDriverWaveOut)\n\nEXPORT_CLASS_TABLE (sndwaveout)\n  EXPORT_CLASS (csSoundDriverWaveOut, \"crystalspace.sound.driver.waveout\",\n    \"Software Sound Driver for Crystal Space\")\nEXPORT_CLASS_TABLE_END\n\nIMPLEMENT_IBASE(csSoundDriverWaveOut)\n\tIMPLEMENTS_INTERFACE(iPlugIn)\n\tIMPLEMENTS_INTERFACE(iSoundDriver)\nIMPLEMENT_IBASE_END\n\ncsSoundDriverWaveOut::csSoundDriverWaveOut(iBase *piBase)\n{\n  CONSTRUCT_IBASE(piBase);\n\n  m_piSystem = NULL;\n  m_piSoundRender = NULL;\n  MemorySize = 0;\n  Memory = NULL;\n  volume = 1.0;\n  hwo = NULL;\n  hThread = NULL;\n  dwThread = 0;\n  Config = 0;\n}\n\ncsSoundDriverWaveOut::~csSoundDriverWaveOut()\n{\n  m_piSystem->Printf (MSG_CONSOLE, \"\\nSoundDriver Destructor !!!!\\n\");\n  if (Config)\n    Config->DecRef();\n}\n\nbool csSoundDriverWaveOut::Initialize (iSystem *iSys)\n{\n  m_piSystem = iSys;\n  return true;\n}\n\nbool csSoundDriverWaveOut::Open(iSoundRender *render, int frequency, bool bit16, bool stereo)\n{\n  m_piSystem->Printf (MSG_INITIALIZATION, \"SoundDriver waveOut selected\\n\");\n\n  m_piSystem->Printf (MSG_INITIALIZATION,\n    \"trying to init sound driver to freq=%d, bit16=%d, stereo=%d\\n\",frequency,bit16,stereo);\n\n  if (!render) return false;\n  m_piSoundRender = render;\n  m_piSoundRender->IncRef();\n\n  Config = m_piSystem->CreateConfig (\"\/config\/sound.cfg\");\n\n  MMRESULT res;\n  WAVEFORMATEX format;\n  memset(&format, 0, sizeof(WAVEFORMATEX));\n  format.wFormatTag = WAVE_FORMAT_PCM;\n  if(stereo)\n    format.nChannels = 2;\n  else\n    format.nChannels = 1;\n  format.nSamplesPerSec = frequency;\n  if(bit16)\n    format.wBitsPerSample = 16;\n  else\n    format.wBitsPerSample = 8;\n  format.nBlockAlign = format.nChannels * format.wBitsPerSample \/ 8;\n  format.nAvgBytesPerSec = format.nBlockAlign * format.nSamplesPerSec;\n  format.cbSize = 0;\n\n  m_nFrequency = frequency;\n  m_b16Bits = bit16;\n  m_bStereo = stereo;\n\n  const char *callback_func=Config->GetStr\n    (\"SoundDriver.WaveOut\", \"CALLBACK\", \"function\");\n  const char *thread_func=Config->GetStr\n    (\"SoundDriver.WaveOut\", \"THREAD_PRIORITY\", \"normal\");\n  bool threading = false;\n\n  if(stricmp(callback_func, \"thread\")==0)\n    threading = true;\n\n  unsigned int refresh=Config->GetInt(\"SoundDriver.WaveOut\", \"REFRESH\", 5);\n\n\/\/  if(refresh>format.nAvgBytesPerSec) refresh=format.nAvgBytesPerSec;\n\n  MemorySize = format.nAvgBytesPerSec\/refresh;\n  MemorySize -=(MemorySize%format.nBlockAlign);\n  Memory = NULL;\n\n  \/\/ Open the playback device\n  if(threading)\n  {\n    m_piSystem->Printf (MSG_INITIALIZATION, \"SoundDriver use thread method\\n\");\n    hThread = CreateThread(NULL, 0, &waveOutThreadProc, this, 0, &dwThread);\n    if(hThread)\n    {\n      for(int p=0; p<NUM_ThreadPriority; p++)\n        if(stricmp(ThreadPriority[p].name, thread_func) == 0)\n        {\n          if(SetThreadPriority(hThread, ThreadPriority[p].priority)!=0)\n            m_piSystem->Printf (MSG_INITIALIZATION, \"SoundDriver thread set to %s priority\\n\", ThreadPriority[p].name);\n          break;\n        }\n      res = waveOutOpen(&hwo, WAVE_MAPPER, &format, (LONG)dwThread, 0L, CALLBACK_THREAD);\n    }\n    else\n      res = MYMMSYSERR_NOCREATETHREAD;\n  }\n  else\n  {\n    m_piSystem->Printf (MSG_INITIALIZATION, \"SoundDriver use function callback method\\n\");\n    res=waveOutOpen(&hwo, WAVE_MAPPER, &format, (LONG)&waveOutProc, 0L, CALLBACK_FUNCTION);\n  }\n  if(res!=MMSYSERR_NOERROR)\n  {\n    switch(res)\n    {\n      case MYMMSYSERR_NOCREATETHREAD:\n        m_piSystem->Printf (MSG_FATAL_ERROR, \"WaveOut error : Cannot create thread !\");\n        break;\n\n      case MMSYSERR_ALLOCATED:\n        m_piSystem->Printf (MSG_FATAL_ERROR, \"WaveOut error : Ressource already allocated by an other program !\");\n        break;\n\n      case MMSYSERR_BADDEVICEID:\n        m_piSystem->Printf (MSG_FATAL_ERROR, \"WaveOut error : Bad device !\");\n        break;\n\n      case MMSYSERR_NODRIVER:\n        m_piSystem->Printf (MSG_FATAL_ERROR, \"WaveOut error : there is no device !\");\n        break;\n\n      case MMSYSERR_NOMEM:\n        m_piSystem->Printf (MSG_FATAL_ERROR, \"WaveOut error : Unable to allocate memory !\");\n        break;\n\n      case WAVERR_BADFORMAT:\n        m_piSystem->Printf (MSG_FATAL_ERROR, \"WaveOut error : Unsupported audio format !\");\n        break;\n\n      default:\n        m_piSystem->Printf (MSG_FATAL_ERROR, \"WaveOut error : Inknown Error !\");\n        break;\n    }\n    return E_FAIL;\n  }\n\n  waveOutGetVolume(hwo, &old_Volume);\n  int old_v2=old_Volume&0xffff;\n  SetVolume((float)old_v2\/(float)65535.0);\n\t\n  SoundProc(NULL);\n  m_piSystem->Printf (MSG_INITIALIZATION, \"SoundDriver initialized to %d Hz %d bits %s\\n\",\n    m_nFrequency, (m_b16Bits)?16:8, (m_bStereo)?\"Stereo\":\"Mono\");\n  return S_OK;\n}\n\nvoid csSoundDriverWaveOut::Close()\n{\n  if (hwo)\n  {\n    waveOutSetVolume(hwo, old_Volume);\n    waveOutReset(hwo);\n    waveOutClose(hwo);\n    hwo=NULL;\n  }\n\n  if( m_piSoundRender ) \n  {\n    m_piSoundRender->DecRef();\n    m_piSoundRender = NULL;\n  }\n\n  Memory = NULL;\n}\n\nvoid csSoundDriverWaveOut::SetVolume(float vol)\n{\n  if(vol<0)\n    vol = 0;\n  else if (vol>1)\n    vol = 1;\n\n  if(hwo)\n  {\n    unsigned long av=(unsigned long)(vol*65535.0);\n    av=(av<<16)|av;\n    waveOutSetVolume(hwo, av);\n  }\n\n  volume = vol;\n}\n\nfloat csSoundDriverWaveOut::GetVolume()\n{\n  return volume;\n}\n\nvoid csSoundDriverWaveOut::LockMemory(void **mem, int *memsize)\n{\n  *mem = Memory;\n  *memsize = MemorySize;\n}\n\nvoid csSoundDriverWaveOut::UnlockMemory()\n{\n}\n\nbool csSoundDriverWaveOut::IsBackground()\n{\n  return true;\n}\n\nbool csSoundDriverWaveOut::Is16Bits()\n{\n  return m_b16Bits;\n}\n\nbool csSoundDriverWaveOut::IsStereo()\n{\n  return m_bStereo;\n}\n\nbool csSoundDriverWaveOut::IsHandleVoidSound()\n{\n  return false;\n}\n\nint csSoundDriverWaveOut::GetFrequency()\n{\n  return m_nFrequency;\n}\n\nstatic bool are_you_playing = false;\n\nDWORD WINAPI csSoundDriverWaveOut::waveOutThreadProc( LPVOID dwParam)\n{\n  csSoundDriverWaveOut *snd = (csSoundDriverWaveOut *)dwParam;\n  MSG msg;\n\n  while(1) {\n    WaitMessage();\n    if(GetMessage( &msg, NULL, 0, 0 ) ) {\n      if(msg.message==MM_WOM_DONE) {\n        if(snd==NULL || snd->hwo==NULL) continue;\n        LPWAVEHDR OldHeader=(LPWAVEHDR)(msg.lParam);\n        snd->SoundProc(OldHeader);\n      }\n      TranslateMessage(&msg); \n      DispatchMessage(&msg);\n    } else return msg.wParam;\n  }\n  return 0xFFFFFFFF;\n}\n\nvoid CALLBACK csSoundDriverWaveOut::waveOutProc(HWAVEOUT \/*hwo*\/, UINT uMsg, DWORD \/*dwInstance*\/, \n                                                DWORD dwParam1, DWORD \/*dwParam2*\/)\n{\n  if (uMsg==MM_WOM_DONE) {\n    LPWAVEHDR OldHeader = (LPWAVEHDR)dwParam1;\n    \/\/ void data ?\n    if(OldHeader->dwUser==NULL || OldHeader->dwUser==0xcdcdcdcd ) return;\n    SoundBlock *block = (SoundBlock *)OldHeader->dwUser;\n    csSoundDriverWaveOut *Driver = block->driver;\n    Driver->SoundProc(OldHeader);\n  }\n}\n\nvoid csSoundDriverWaveOut::SoundProc(LPWAVEHDR OldHeader) {\n  \/\/ wait for the previous call to exit\n  while (are_you_playing);\n  \/\/ lock this function\n  are_you_playing = true;\n\n  SoundBlock *Block;\n\n  if (OldHeader) {\n    \/\/ get the previous sound block\n    Block = (SoundBlock *)(OldHeader->dwUser);\n\n    \/\/ Free this block up\n    waveOutUnprepareHeader(hwo, OldHeader, sizeof(WAVEHDR));\n    GlobalUnlock(Block->hHeader);\n    GlobalFree(Block->hHeader);\n    delete Block;\n  }\n\n  \/\/ create a new block\n  Block = new SoundBlock();\n  Block->driver = this;\n  Block->hHeader = GlobalAlloc(GMEM_MOVEABLE | GMEM_SHARE, sizeof(WAVEHDR)+MemorySize);\n  Block->lpSoundData = (LPBYTE)GlobalLock(Block->hHeader);\n\n  \/\/ Set up various pointers\n  LPWAVEHDR lpWaveHdr = (LPWAVEHDR)Block->lpSoundData;\n  Memory = (unsigned char *)&Block->lpSoundData[sizeof(WAVEHDR)];\n  if(Memory == NULL) return;\n\n  \/\/ call the sound renderer mixing function\n  m_piSoundRender->MixingFunction();\n  \n  \/\/ Set up and prepare header. \n  lpWaveHdr->lpData = (char *)Memory;\n  lpWaveHdr->dwBufferLength = MemorySize;\n  lpWaveHdr->dwFlags = 0L;\n  lpWaveHdr->dwLoops = 0L;\n  lpWaveHdr->dwUser = (DWORD)Block;\n  waveOutPrepareHeader(hwo, lpWaveHdr, sizeof(WAVEHDR));\n\n  \/\/ Now the data block can be sent to the output device. The \n  \/\/ waveOutWrite function returns immediately and waveform \n  \/\/ data is sent to the output device in the background.\n  MMRESULT result = waveOutWrite(hwo, lpWaveHdr, sizeof(WAVEHDR)); \n  if (result != 0) { \n    waveOutUnprepareHeader(hwo, lpWaveHdr, sizeof(WAVEHDR)); \n    GlobalUnlock(Block->hHeader);\n    GlobalFree(Block->hHeader);\n    delete Block;\n  }\n  \n  \/\/ unlock this function\n  are_you_playing = false;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    highlightconfig.cpp\n\n    Copyright (c) 2003      by Olivier Goffart       <ogoffart@tiscalinet.be>\n    Copyright (c) 2003      by Matt Rogers           <matt@matt.rogers.name>\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 <qfile.h>\n#include <qstylesheet.h>\n#include <qregexp.h>\n#include <qdir.h>\n#include <qdom.h>\n\n#include <ksavefile.h>\n#include <kstandarddirs.h>\n#include <klocale.h>\n\n#include \"filter.h\"\n#include \"highlightconfig.h\"\n\n\nHighlightConfig::HighlightConfig()\n{\n\tload();\n\tm_filters.setAutoDelete(true);\n}\n\nHighlightConfig::~HighlightConfig()\n{\n\tm_filters.clear();\n}\n\nvoid HighlightConfig::removeFilter(Filter *f)\n{\n\tm_filters.remove(f);\n\tdelete f;\n}\n\nvoid HighlightConfig::appendFilter(Filter *f)\n{\n\tm_filters.append(f);\n}\n\nQPtrList<Filter> HighlightConfig::filters() const\n{\n\treturn m_filters;\n}\n\nFilter* HighlightConfig::newFilter()\n{\n\tFilter *filtre=new Filter();\n\tfiltre->caseSensitive=false;\n\tfiltre->isRegExp=false;\n\tfiltre->setImportance=false;\n\tfiltre->importance=1;\n\tfiltre->setBG=false;\n\tfiltre->setFG=false;\n\tfiltre->playSound=false;\n\tfiltre->displayName=i18n(\"-New filter-\");\n\tm_filters.append(filtre);\n\treturn filtre;\n}\n\nvoid HighlightConfig::load()\n{\n\tm_filters.clear(); \/\/clear filters\n\n\tQString filename = locateLocal( \"appdata\", QString::fromLatin1( \"highlight.xml\" ) );\n\tif( filename.isEmpty() )\n\t\treturn ;\n\n\tQDomDocument filterList( QString::fromLatin1( \"highlight-plugin\" ) );\n\n\tQFile filterListFile( filename );\n\tfilterListFile.open( IO_ReadOnly );\n\tfilterList.setContent( &filterListFile );\n\n\tQDomElement list = filterList.documentElement();\n\n\tQDomNode node = list.firstChild();\n\twhile( !node.isNull() )\n\t{\n\t\tQDomElement element = node.toElement();\n\t\tif( !element.isNull() )\n\t\t{\n\/\/\t\t\tif( element.tagName() == QString::fromLatin1(\"filter\")\n\/\/\t\t\t{\n\t\t\t\tFilter *filtre=newFilter();\n\t\t\t\tQDomNode filterNode = node.firstChild();\n\n\t\t\t\twhile( !filterNode.isNull() )\n\t\t\t\t{\n\t\t\t\t\tQDomElement filterElement = filterNode.toElement();\n\t\t\t\t\tif( !filterElement.isNull() )\n\t\t\t\t\t{\n\t\t\t\t\t\tif( filterElement.tagName() == QString::fromLatin1( \"display-name\" ) )\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tfiltre->displayName = filterElement.text();\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if( filterElement.tagName() == QString::fromLatin1( \"search\" ) )\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tfiltre->search = filterElement.text();\n\n\t\t\t\t\t\t\tfiltre->caseSensitive= ( filterElement.attribute( QString::fromLatin1( \"caseSensitive\" ), QString::fromLatin1( \"1\" ) ) == QString::fromLatin1( \"1\" ) );\n\t\t\t\t\t\t\tfiltre->isRegExp= ( filterElement.attribute( QString::fromLatin1( \"regExp\" ), QString::fromLatin1( \"0\" ) ) == QString::fromLatin1( \"1\" ) );\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if( filterElement.tagName() == QString::fromLatin1( \"FG\" ) )\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tfiltre->FG = filterElement.text();\n\t\t\t\t\t\t\tfiltre->setFG= ( filterElement.attribute( QString::fromLatin1( \"set\" ), QString::fromLatin1( \"0\" ) ) == QString::fromLatin1( \"1\" ) );\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if( filterElement.tagName() == QString::fromLatin1( \"BG\" ) )\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tfiltre->BG = filterElement.text();\n\t\t\t\t\t\t\tfiltre->setBG= ( filterElement.attribute( QString::fromLatin1( \"set\" ), QString::fromLatin1( \"0\" ) ) == QString::fromLatin1( \"1\" ) );\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if( filterElement.tagName() == QString::fromLatin1( \"importance\" ) )\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tfiltre->importance = filterElement.text().toUInt();\n\t\t\t\t\t\t\tfiltre->setImportance= ( filterElement.attribute( QString::fromLatin1( \"set\" ), QString::fromLatin1( \"0\" ) ) == QString::fromLatin1( \"1\" ) );\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if( filterElement.tagName() == QString::fromLatin1( \"sound\" ) )\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tfiltre->soundFN = filterElement.text();\n\t\t\t\t\t\t\tfiltre->playSound = ( filterElement.attribute( QString::fromLatin1( \"set\" ), QString::fromLatin1( \"0\" ) ) == QString::fromLatin1( \"1\" ) );\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tfilterNode = filterNode.nextSibling();\n\t\t\t\t}\n\/\/\t\t\t}\n\t\t}\n\t\tnode = node.nextSibling();\n\t}\n\tfilterListFile.close();\n}\n\nvoid HighlightConfig::save()\n{\n\n\tQString fileName = locateLocal( \"appdata\", QString::fromLatin1( \"highlight.xml\" ) );\n\n\tKSaveFile file( fileName );\n\tif( file.status() == 0 )\n\t{\n\t\tQTextStream *stream = file.textStream();\n\t\tstream->setEncoding( QTextStream::UnicodeUTF8 );\n\n\t\tQString xml = QString::fromLatin1(\n\t\t\t\"<?xml version=\\\"1.0\\\"?>\\n\"\n\t\t\t\"<!DOCTYPE kopete-highlight-plugin>\\n\"\n\t\t\t\"<highlight-plugin>\\n\" );\n\n\t\t\t\/\/ Save metafilter information.\n\t\tQPtrListIterator<Filter> filtreIt( m_filters );\n\t\tfor( ; filtreIt.current(); ++filtreIt )\n\t\t{\n\t\t\tFilter *filtre = *filtreIt;\n\t\t\txml += QString::fromLatin1( \"  <filter>\\n    <display-name>\" )\n\t\t\t\t+ QStyleSheet::escape(filtre->displayName)\n\t\t\t\t+ QString::fromLatin1( \"<\/display-name>\\n\" );\n\n\t\t\txml += QString::fromLatin1(\"    <search caseSensitive=\\\"\") + QString::number( static_cast<int>( filtre->caseSensitive ) ) +\n\t\t\t\tQString::fromLatin1(\"\\\" regExp=\\\"\") + QString::number( static_cast<int>( filtre->isRegExp ) ) +\n\t\t\t\tQString::fromLatin1( \"\\\">\" ) + QStyleSheet::escape( filtre->search ) + QString::fromLatin1( \"<\/search>\\n\" );\n\n\t\t\txml += QString::fromLatin1(\"    <BG set=\\\"\") + QString::number( static_cast<int>( filtre->setBG ) ) +\n\t\t\t\tQString::fromLatin1( \"\\\">\" ) + QStyleSheet::escape( filtre->BG.name() ) + QString::fromLatin1( \"<\/BG>\\n\" );\n\t\t\txml += QString::fromLatin1(\"    <FG set=\\\"\") + QString::number( static_cast<int>( filtre->setFG ) ) +\n\t\t\t\tQString::fromLatin1( \"\\\">\" ) + QStyleSheet::escape( filtre->FG.name() ) + QString::fromLatin1( \"<\/FG>\\n\" );\n\n\t\t\txml += QString::fromLatin1(\"    <importance set=\\\"\") + QString::number( static_cast<int>( filtre->setImportance ) ) +\n\t\t\t\tQString::fromLatin1( \"\\\">\" ) + QString::number( filtre->importance ) + QString::fromLatin1( \"<\/importance>\\n\" );\n\n\t\t\txml += QString::fromLatin1(\"    <sound set=\\\"\") + QString::number( static_cast<int>( filtre->playSound ) ) +\n\t\t\t\tQString::fromLatin1( \"\\\">\" ) + QStyleSheet::escape( filtre->soundFN ) + QString::fromLatin1( \"<\/sound>\\n\" );\n\n\t\t\txml += QString::fromLatin1( \"  <\/filter>\\n\" );\n\t\t}\n\n\t\txml += QString::fromLatin1( \"<\/highlight-plugin>\\n\" );\n\n\t\t*stream << xml;\n\t}\n}\n\n\/\/ vim: set noet ts=4 sts=4 sw=4:\n<commit_msg>Fix crash when we remove a filter<commit_after>\/*\n    highlightconfig.cpp\n\n    Copyright (c) 2003      by Olivier Goffart       <ogoffart@tiscalinet.be>\n    Copyright (c) 2003      by Matt Rogers           <matt@matt.rogers.name>\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 <qfile.h>\n#include <qstylesheet.h>\n#include <qregexp.h>\n#include <qdir.h>\n#include <qdom.h>\n\n#include <ksavefile.h>\n#include <kstandarddirs.h>\n#include <klocale.h>\n\n#include \"filter.h\"\n#include \"highlightconfig.h\"\n\n\nHighlightConfig::HighlightConfig()\n{\n\tload();\n\tm_filters.setAutoDelete(true);\n}\n\nHighlightConfig::~HighlightConfig()\n{\n\tm_filters.clear();\n}\n\nvoid HighlightConfig::removeFilter(Filter *f)\n{\n    \/\/m_filters is \"autodelete (true) so when we use remove(...) it deleted f\n    \/\/so don't use (delete (f) after otherwise ot crash\n\tm_filters.remove(f);\n}\n\nvoid HighlightConfig::appendFilter(Filter *f)\n{\n\tm_filters.append(f);\n}\n\nQPtrList<Filter> HighlightConfig::filters() const\n{\n\treturn m_filters;\n}\n\nFilter* HighlightConfig::newFilter()\n{\n\tFilter *filtre=new Filter();\n\tfiltre->caseSensitive=false;\n\tfiltre->isRegExp=false;\n\tfiltre->setImportance=false;\n\tfiltre->importance=1;\n\tfiltre->setBG=false;\n\tfiltre->setFG=false;\n\tfiltre->playSound=false;\n\tfiltre->displayName=i18n(\"-New filter-\");\n\tm_filters.append(filtre);\n\treturn filtre;\n}\n\nvoid HighlightConfig::load()\n{\n\tm_filters.clear(); \/\/clear filters\n\n\tQString filename = locateLocal( \"appdata\", QString::fromLatin1( \"highlight.xml\" ) );\n\tif( filename.isEmpty() )\n\t\treturn ;\n\n\tQDomDocument filterList( QString::fromLatin1( \"highlight-plugin\" ) );\n\n\tQFile filterListFile( filename );\n\tfilterListFile.open( IO_ReadOnly );\n\tfilterList.setContent( &filterListFile );\n\n\tQDomElement list = filterList.documentElement();\n\n\tQDomNode node = list.firstChild();\n\twhile( !node.isNull() )\n\t{\n\t\tQDomElement element = node.toElement();\n\t\tif( !element.isNull() )\n\t\t{\n\/\/\t\t\tif( element.tagName() == QString::fromLatin1(\"filter\")\n\/\/\t\t\t{\n\t\t\t\tFilter *filtre=newFilter();\n\t\t\t\tQDomNode filterNode = node.firstChild();\n\n\t\t\t\twhile( !filterNode.isNull() )\n\t\t\t\t{\n\t\t\t\t\tQDomElement filterElement = filterNode.toElement();\n\t\t\t\t\tif( !filterElement.isNull() )\n\t\t\t\t\t{\n\t\t\t\t\t\tif( filterElement.tagName() == QString::fromLatin1( \"display-name\" ) )\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tfiltre->displayName = filterElement.text();\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if( filterElement.tagName() == QString::fromLatin1( \"search\" ) )\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tfiltre->search = filterElement.text();\n\n\t\t\t\t\t\t\tfiltre->caseSensitive= ( filterElement.attribute( QString::fromLatin1( \"caseSensitive\" ), QString::fromLatin1( \"1\" ) ) == QString::fromLatin1( \"1\" ) );\n\t\t\t\t\t\t\tfiltre->isRegExp= ( filterElement.attribute( QString::fromLatin1( \"regExp\" ), QString::fromLatin1( \"0\" ) ) == QString::fromLatin1( \"1\" ) );\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if( filterElement.tagName() == QString::fromLatin1( \"FG\" ) )\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tfiltre->FG = filterElement.text();\n\t\t\t\t\t\t\tfiltre->setFG= ( filterElement.attribute( QString::fromLatin1( \"set\" ), QString::fromLatin1( \"0\" ) ) == QString::fromLatin1( \"1\" ) );\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if( filterElement.tagName() == QString::fromLatin1( \"BG\" ) )\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tfiltre->BG = filterElement.text();\n\t\t\t\t\t\t\tfiltre->setBG= ( filterElement.attribute( QString::fromLatin1( \"set\" ), QString::fromLatin1( \"0\" ) ) == QString::fromLatin1( \"1\" ) );\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if( filterElement.tagName() == QString::fromLatin1( \"importance\" ) )\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tfiltre->importance = filterElement.text().toUInt();\n\t\t\t\t\t\t\tfiltre->setImportance= ( filterElement.attribute( QString::fromLatin1( \"set\" ), QString::fromLatin1( \"0\" ) ) == QString::fromLatin1( \"1\" ) );\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if( filterElement.tagName() == QString::fromLatin1( \"sound\" ) )\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tfiltre->soundFN = filterElement.text();\n\t\t\t\t\t\t\tfiltre->playSound = ( filterElement.attribute( QString::fromLatin1( \"set\" ), QString::fromLatin1( \"0\" ) ) == QString::fromLatin1( \"1\" ) );\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tfilterNode = filterNode.nextSibling();\n\t\t\t\t}\n\/\/\t\t\t}\n\t\t}\n\t\tnode = node.nextSibling();\n\t}\n\tfilterListFile.close();\n}\n\nvoid HighlightConfig::save()\n{\n\n\tQString fileName = locateLocal( \"appdata\", QString::fromLatin1( \"highlight.xml\" ) );\n\n\tKSaveFile file( fileName );\n\tif( file.status() == 0 )\n\t{\n\t\tQTextStream *stream = file.textStream();\n\t\tstream->setEncoding( QTextStream::UnicodeUTF8 );\n\n\t\tQString xml = QString::fromLatin1(\n\t\t\t\"<?xml version=\\\"1.0\\\"?>\\n\"\n\t\t\t\"<!DOCTYPE kopete-highlight-plugin>\\n\"\n\t\t\t\"<highlight-plugin>\\n\" );\n\n\t\t\t\/\/ Save metafilter information.\n\t\tQPtrListIterator<Filter> filtreIt( m_filters );\n\t\tfor( ; filtreIt.current(); ++filtreIt )\n\t\t{\n\t\t\tFilter *filtre = *filtreIt;\n\t\t\txml += QString::fromLatin1( \"  <filter>\\n    <display-name>\" )\n\t\t\t\t+ QStyleSheet::escape(filtre->displayName)\n\t\t\t\t+ QString::fromLatin1( \"<\/display-name>\\n\" );\n\n\t\t\txml += QString::fromLatin1(\"    <search caseSensitive=\\\"\") + QString::number( static_cast<int>( filtre->caseSensitive ) ) +\n\t\t\t\tQString::fromLatin1(\"\\\" regExp=\\\"\") + QString::number( static_cast<int>( filtre->isRegExp ) ) +\n\t\t\t\tQString::fromLatin1( \"\\\">\" ) + QStyleSheet::escape( filtre->search ) + QString::fromLatin1( \"<\/search>\\n\" );\n\n\t\t\txml += QString::fromLatin1(\"    <BG set=\\\"\") + QString::number( static_cast<int>( filtre->setBG ) ) +\n\t\t\t\tQString::fromLatin1( \"\\\">\" ) + QStyleSheet::escape( filtre->BG.name() ) + QString::fromLatin1( \"<\/BG>\\n\" );\n\t\t\txml += QString::fromLatin1(\"    <FG set=\\\"\") + QString::number( static_cast<int>( filtre->setFG ) ) +\n\t\t\t\tQString::fromLatin1( \"\\\">\" ) + QStyleSheet::escape( filtre->FG.name() ) + QString::fromLatin1( \"<\/FG>\\n\" );\n\n\t\t\txml += QString::fromLatin1(\"    <importance set=\\\"\") + QString::number( static_cast<int>( filtre->setImportance ) ) +\n\t\t\t\tQString::fromLatin1( \"\\\">\" ) + QString::number( filtre->importance ) + QString::fromLatin1( \"<\/importance>\\n\" );\n\n\t\t\txml += QString::fromLatin1(\"    <sound set=\\\"\") + QString::number( static_cast<int>( filtre->playSound ) ) +\n\t\t\t\tQString::fromLatin1( \"\\\">\" ) + QStyleSheet::escape( filtre->soundFN ) + QString::fromLatin1( \"<\/sound>\\n\" );\n\n\t\t\txml += QString::fromLatin1( \"  <\/filter>\\n\" );\n\t\t}\n\n\t\txml += QString::fromLatin1( \"<\/highlight-plugin>\\n\" );\n\n\t\t*stream << xml;\n\t}\n}\n\n\/\/ vim: set noet ts=4 sts=4 sw=4:\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2010-2013 RethinkDB, all rights reserved.\n#include \"serializer\/translator.hpp\"\n\n#include \"errors.hpp\"\n#include <boost\/bind.hpp>\n\n#include \"concurrency\/pmap.hpp\"\n#include \"serializer\/types.hpp\"\n#include \"serializer\/config.hpp\"\n\n\/* serializer_multiplexer_t *\/\n\n\/* The multiplexing serializer slices up the serializers as follows:\n\n- Each proxy is assigned to a serializer. The formula is (proxy_id % n_files)\n- Block ID 0 on each serializer is for static configuration information.\n- Each proxy uses block IDs of the form (1 + (n * (number of proxies on serializer) +\n    (proxy_id \/ n_files))).\n*\/\n\nconst block_magic_t multiplexer_config_block_t::expected_magic = { { 'c', 'f', 'g', '_' } };\n\nvoid prep_serializer(\n        const std::vector<standard_serializer_t *>& serializers,\n        creation_timestamp_t creation_timestamp,\n        int n_proxies,\n        int i) {\n\n    standard_serializer_t *ser = serializers[i];\n\n    \/* Go to the thread the serializer is running on because it can only be accessed safely from\n    that thread *\/\n    on_thread_t thread_switcher(ser->home_thread());\n\n    \/* Write the initial configuration block *\/\n    scoped_malloc_t<ser_buffer_t> buf = ser->malloc();\n    multiplexer_config_block_t *c\n        = reinterpret_cast<multiplexer_config_block_t *>(buf->cache_data);\n\n    bzero(c, ser->get_block_size().value());\n    c->magic = multiplexer_config_block_t::expected_magic;\n    c->creation_timestamp = creation_timestamp;\n    c->n_files = serializers.size();\n    c->this_serializer = i;\n    c->n_proxies = n_proxies;\n\n    index_write_op_t op(CONFIG_BLOCK_ID.ser_id);\n    op.token = ser->block_write(c, CONFIG_BLOCK_ID.ser_id, DEFAULT_DISK_ACCOUNT);\n    op.recency = repli_timestamp_t::invalid;\n    serializer_index_write(ser, op, DEFAULT_DISK_ACCOUNT);\n}\n\n\/* static *\/\nvoid serializer_multiplexer_t::create(const std::vector<standard_serializer_t *>& underlying, int n_proxies) {\n    \/* Choose a more-or-less unique ID so that we can hopefully catch the case where files are\n    mixed and mismatched. *\/\n    creation_timestamp_t creation_timestamp = time(NULL);\n\n    \/* Write a configuration block for each one *\/\n    pmap(underlying.size(), boost::bind(&prep_serializer,\n        underlying, creation_timestamp, n_proxies, _1));\n}\n\nvoid create_proxies(const std::vector<standard_serializer_t *>& underlying,\n    creation_timestamp_t creation_timestamp, std::vector<translator_serializer_t *> *proxies, int i) {\n\n    standard_serializer_t *ser = underlying[i];\n\n    \/* Go to the thread the serializer is running on because it is only safe to access on that\n    thread and because the pseudoserializers must be created on that thread *\/\n    on_thread_t thread_switcher(ser->home_thread());\n\n    \/* Load config block *\/\n    scoped_malloc_t<ser_buffer_t> buf = ser->malloc();\n    multiplexer_config_block_t *c\n        = reinterpret_cast<multiplexer_config_block_t *>(buf->cache_data);\n    ser->block_read(ser->index_read(CONFIG_BLOCK_ID.ser_id), c, DEFAULT_DISK_ACCOUNT);\n\n    \/* Verify that stuff is sane *\/\n    if (c->magic != multiplexer_config_block_t::expected_magic) {\n        fail_due_to_user_error(\"File did not come from 'rethinkdb create'.\");\n    }\n    if (c->creation_timestamp != creation_timestamp) {\n        fail_due_to_user_error(\"The files that the server was started with didn't all come from \"\n            \"the same call to 'rethinkdb create'.\");\n    }\n    if (c->n_files > static_cast<int>(underlying.size())) {\n        fail_due_to_user_error(\"You forgot to include one of the files\/devices that you included \"\n            \"when the database was first created.\");\n    }\n    if (c->n_files < static_cast<int>(underlying.size())) {\n        fail_due_to_user_error(\"Got more files than expected. Did you give a file that wasn't\"\n            \"included in the call to 'rethinkdb create'? Did you duplicate one of the files?\");\n    }\n    guarantee(c->this_serializer >= 0 && c->this_serializer < static_cast<int>(underlying.size()));\n    guarantee(c->n_proxies == static_cast<int>(proxies->size()));\n\n    \/* Figure out which serializer we are (in case files were specified to 'rethinkdb serve' in a\n    different order than they were specified to 'rethinkdb create') *\/\n    int j = c->this_serializer;\n\n    int num_on_this_serializer = serializer_multiplexer_t::compute_mod_count(\n        j, underlying.size(), c->n_proxies);\n\n    \/* This is a slightly weird way of phrasing this; it's done this way so I can be sure it's\n    equivalent to the old way of doing things *\/\n    for (int k = 0; k < c->n_proxies; k++) {\n        \/* Are we responsible for creating this proxy? *\/\n        if (k % static_cast<int>(underlying.size()) != j)\n            continue;\n\n        rassert(!(*proxies)[k]);\n        (*proxies)[k] = new translator_serializer_t(\n            ser,\n            num_on_this_serializer,\n            k \/ underlying.size(),\n            CONFIG_BLOCK_ID   \/* Reserve block ID 0 *\/);\n    }\n}\n\nserializer_multiplexer_t::serializer_multiplexer_t(const std::vector<standard_serializer_t *>& underlying) {\n    rassert(!underlying.empty());\n    for (int i = 0; i < static_cast<int>(underlying.size()); ++i) {\n        rassert(underlying[i]);\n    }\n\n    \/* Figure out how many slices there are gonna be and figure out what the creation magic is *\/\n    {\n        on_thread_t thread_switcher(underlying[0]->home_thread());\n\n        \/* Load config block *\/\n        scoped_malloc_t<ser_buffer_t> buf = underlying[0]->malloc();\n\n        multiplexer_config_block_t *c\n            = reinterpret_cast<multiplexer_config_block_t *>(buf->cache_data);\n        underlying[0]->block_read(underlying[0]->index_read(CONFIG_BLOCK_ID.ser_id), c, DEFAULT_DISK_ACCOUNT);\n\n        rassert(c->magic == multiplexer_config_block_t::expected_magic);\n        creation_timestamp = c->creation_timestamp;\n        proxies.resize(c->n_proxies);\n    }\n\n    \/* Now go to each serializer and verify it individually. We visit the first serializer twice\n    (because we already visited it to get the creation magic and stuff) but that's OK. Also, create\n    proxies for the serializers (populate the 'proxies' vector) *\/\n    pmap(underlying.size(), boost::bind(&create_proxies,\n        underlying, creation_timestamp, &proxies, _1));\n\n    for (int i = 0; i < static_cast<int>(proxies.size()); ++i) rassert(proxies[i]);\n}\n\nvoid destroy_proxy(std::vector<translator_serializer_t *> *proxies, int i) {\n    on_thread_t thread_switcher((*proxies)[i]->home_thread());\n    delete (*proxies)[i];\n}\n\nserializer_multiplexer_t::~serializer_multiplexer_t() {\n    pmap(proxies.size(), boost::bind(&destroy_proxy, &proxies, _1));\n}\n\nint serializer_multiplexer_t::compute_mod_count(int32_t file_number, int32_t n_files, int32_t n_slices) {\n    \/* If we have 'n_files', and we distribute 'n_slices' over those 'n_files' such that slice 'n'\n    is on file 'n % n_files', then how many slices will be on file 'file_number'? *\/\n    return n_slices \/ n_files + (n_slices % n_files > file_number);\n}\n\n\/* translator_serializer_t *\/\n\nblock_id_t translator_serializer_t::translate_block_id(block_id_t id, int mod_count, int mod_id, config_block_id_t cfgid) {\n    return id * mod_count + mod_id + cfgid.subsequent_ser_id();\n}\n\nint translator_serializer_t::untranslate_block_id_to_mod_id(block_id_t inner_id, int mod_count, config_block_id_t cfgid) {\n    \/\/ We know that inner_id == id * mod_count + mod_id + min.\n    \/\/ Thus inner_id - min == id * mod_count + mod_id.\n    \/\/ It follows that inner_id - min === mod_id (modulo mod_count).\n    \/\/ So (inner_id - min) % mod_count == mod_id (since 0 <= mod_id < mod_count).\n    \/\/ (And inner_id - min >= 0, so '%' works as expected.)\n    return (inner_id - cfgid.subsequent_ser_id()) % mod_count;\n}\n\nblock_id_t translator_serializer_t::untranslate_block_id_to_id(block_id_t inner_id, int mod_count, int mod_id, config_block_id_t cfgid) {\n    \/\/ (simply dividing by mod_count should be sufficient, but this is cleaner)\n    return (inner_id - cfgid.subsequent_ser_id() - mod_id) \/ mod_count;\n}\n\nblock_id_t translator_serializer_t::translate_block_id(block_id_t id) const {\n    rassert(id != NULL_BLOCK_ID);\n    return translate_block_id(id, mod_count, mod_id, cfgid);\n}\n\ntranslator_serializer_t::translator_serializer_t(standard_serializer_t *_inner, int _mod_count, int _mod_id, config_block_id_t _cfgid)\n    : inner(_inner), mod_count(_mod_count), mod_id(_mod_id), cfgid(_cfgid), read_ahead_callback(NULL) {\n    rassert(mod_count > 0);\n    rassert(mod_id >= 0);\n    rassert(mod_id < mod_count);\n}\n\nscoped_malloc_t<ser_buffer_t> translator_serializer_t::malloc() {\n    return inner->malloc();\n}\n\nscoped_malloc_t<ser_buffer_t> translator_serializer_t::clone(const ser_buffer_t *data) {\n    return inner->clone(data);\n}\n\nfile_account_t *translator_serializer_t::make_io_account(int priority, int outstanding_requests_limit) {\n    return inner->make_io_account(priority, outstanding_requests_limit);\n}\n\nvoid translator_serializer_t::index_write(const std::vector<index_write_op_t>& write_ops, file_account_t *io_account) {\n    std::vector<index_write_op_t> translated_ops(write_ops);\n    for (std::vector<index_write_op_t>::iterator it = translated_ops.begin(); it < translated_ops.end(); ++it)\n        it->block_id = translate_block_id(it->block_id);\n    inner->index_write(translated_ops, io_account);\n}\n\ncounted_t<standard_block_token_t>\ntranslator_serializer_t::block_write(const void *buf, block_id_t block_id, file_account_t *io_account, iocallback_t *cb) {\n    \/\/ NULL_BLOCK_ID is special: it indicates no block id specified.  Right now only the\n    \/\/ log_serializer_t ever sees a NULL_BLOCK_ID, passed in from its data block manager in some\n    \/\/ ugly circular code.\n    if (block_id != NULL_BLOCK_ID)\n        block_id = translate_block_id(block_id);\n    return inner->block_write(buf, block_id, io_account, cb);\n}\n\nvoid translator_serializer_t::block_read(const counted_t<standard_block_token_t>& token, void *buf, file_account_t *io_account, iocallback_t *cb) {\n    return inner->block_read(token, buf, io_account, cb);\n}\n\nvoid translator_serializer_t::block_read(const counted_t<standard_block_token_t>& token, void *buf, file_account_t *io_account) {\n    return inner->block_read(token, buf, io_account);\n}\n\ncounted_t<standard_block_token_t> translator_serializer_t::index_read(block_id_t block_id) {\n    return inner->index_read(translate_block_id(block_id));\n}\n\nblock_size_t translator_serializer_t::get_block_size()  const {\n    return inner->get_block_size();\n}\n\nbool translator_serializer_t::coop_lock_and_check() {\n    return inner->coop_lock_and_check();\n}\n\nblock_id_t translator_serializer_t::max_block_id() {\n    int64_t x = inner->max_block_id() - cfgid.subsequent_ser_id();\n    if (x <= 0) {\n        x = 0;\n    } else {\n        while (x % mod_count != mod_id) x++;\n        x \/= mod_count;\n    }\n    rassert(translate_block_id(x) >= inner->max_block_id());\n\n    while (x > 0) {\n        --x;\n        if (!get_delete_bit(x)) {\n            ++x;\n            break;\n        }\n    }\n    return x;\n}\n\nrepli_timestamp_t translator_serializer_t::get_recency(block_id_t id) {\n    return inner->get_recency(translate_block_id(id));\n}\n\nbool translator_serializer_t::get_delete_bit(block_id_t id) {\n    return inner->get_delete_bit(translate_block_id(id));\n}\n\nbool translator_serializer_t::offer_read_ahead_buf(\n        block_id_t block_id,\n        ser_buffer_t *buf,\n        block_size_t block_size,\n        const counted_t<standard_block_token_t> &token,\n        repli_timestamp_t recency_timestamp) {\n    inner->assert_thread();\n\n    if (block_id == 0) {\n        \/\/ Serializer multiplexer config block is not of interest.\n        return false;\n    }\n\n    \/\/ Offer the buffer if we are the correct shard\n    const int buf_mod_id = untranslate_block_id_to_mod_id(block_id, mod_count, cfgid);\n    if (buf_mod_id != this->mod_id) {\n        \/\/ We are not responsible...\n        return false;\n    }\n\n    if (read_ahead_callback) {\n        const block_id_t inner_block_id = untranslate_block_id_to_id(block_id, mod_count, mod_id, cfgid);\n        if (!read_ahead_callback->offer_read_ahead_buf(inner_block_id, buf, block_size,\n                                                       token, recency_timestamp)) {\n            \/\/ They aren't going to free the buffer, so we do.\n            free(buf);\n        }\n    } else {\n        \/\/ Discard the buffer\n        free(buf);\n    }\n    return true;\n}\n\nvoid translator_serializer_t::register_read_ahead_cb(serializer_read_ahead_callback_t *cb) {\n    on_thread_t t(inner->home_thread());\n\n    rassert(!read_ahead_callback);\n    inner->register_read_ahead_cb(this);\n    read_ahead_callback = cb;\n}\nvoid translator_serializer_t::unregister_read_ahead_cb(DEBUG_VAR serializer_read_ahead_callback_t *cb) {\n    on_thread_t t(inner->home_thread());\n\n    rassert(read_ahead_callback == NULL || cb == read_ahead_callback);\n    inner->unregister_read_ahead_cb(this);\n    read_ahead_callback = NULL;\n}\n<commit_msg>Made translator serializer actually look for config block id, instead of 0, in offer_read_ahead_buf.<commit_after>\/\/ Copyright 2010-2013 RethinkDB, all rights reserved.\n#include \"serializer\/translator.hpp\"\n\n#include \"errors.hpp\"\n#include <boost\/bind.hpp>\n\n#include \"concurrency\/pmap.hpp\"\n#include \"serializer\/types.hpp\"\n#include \"serializer\/config.hpp\"\n\n\/* serializer_multiplexer_t *\/\n\n\/* The multiplexing serializer slices up the serializers as follows:\n\n- Each proxy is assigned to a serializer. The formula is (proxy_id % n_files)\n- Block ID 0 on each serializer is for static configuration information.\n- Each proxy uses block IDs of the form (1 + (n * (number of proxies on serializer) +\n    (proxy_id \/ n_files))).\n*\/\n\nconst block_magic_t multiplexer_config_block_t::expected_magic = { { 'c', 'f', 'g', '_' } };\n\nvoid prep_serializer(\n        const std::vector<standard_serializer_t *>& serializers,\n        creation_timestamp_t creation_timestamp,\n        int n_proxies,\n        int i) {\n\n    standard_serializer_t *ser = serializers[i];\n\n    \/* Go to the thread the serializer is running on because it can only be accessed safely from\n    that thread *\/\n    on_thread_t thread_switcher(ser->home_thread());\n\n    \/* Write the initial configuration block *\/\n    scoped_malloc_t<ser_buffer_t> buf = ser->malloc();\n    multiplexer_config_block_t *c\n        = reinterpret_cast<multiplexer_config_block_t *>(buf->cache_data);\n\n    bzero(c, ser->get_block_size().value());\n    c->magic = multiplexer_config_block_t::expected_magic;\n    c->creation_timestamp = creation_timestamp;\n    c->n_files = serializers.size();\n    c->this_serializer = i;\n    c->n_proxies = n_proxies;\n\n    index_write_op_t op(CONFIG_BLOCK_ID.ser_id);\n    op.token = ser->block_write(c, CONFIG_BLOCK_ID.ser_id, DEFAULT_DISK_ACCOUNT);\n    op.recency = repli_timestamp_t::invalid;\n    serializer_index_write(ser, op, DEFAULT_DISK_ACCOUNT);\n}\n\n\/* static *\/\nvoid serializer_multiplexer_t::create(const std::vector<standard_serializer_t *>& underlying, int n_proxies) {\n    \/* Choose a more-or-less unique ID so that we can hopefully catch the case where files are\n    mixed and mismatched. *\/\n    creation_timestamp_t creation_timestamp = time(NULL);\n\n    \/* Write a configuration block for each one *\/\n    pmap(underlying.size(), boost::bind(&prep_serializer,\n        underlying, creation_timestamp, n_proxies, _1));\n}\n\nvoid create_proxies(const std::vector<standard_serializer_t *>& underlying,\n    creation_timestamp_t creation_timestamp, std::vector<translator_serializer_t *> *proxies, int i) {\n\n    standard_serializer_t *ser = underlying[i];\n\n    \/* Go to the thread the serializer is running on because it is only safe to access on that\n    thread and because the pseudoserializers must be created on that thread *\/\n    on_thread_t thread_switcher(ser->home_thread());\n\n    \/* Load config block *\/\n    scoped_malloc_t<ser_buffer_t> buf = ser->malloc();\n    multiplexer_config_block_t *c\n        = reinterpret_cast<multiplexer_config_block_t *>(buf->cache_data);\n    ser->block_read(ser->index_read(CONFIG_BLOCK_ID.ser_id), c, DEFAULT_DISK_ACCOUNT);\n\n    \/* Verify that stuff is sane *\/\n    if (c->magic != multiplexer_config_block_t::expected_magic) {\n        fail_due_to_user_error(\"File did not come from 'rethinkdb create'.\");\n    }\n    if (c->creation_timestamp != creation_timestamp) {\n        fail_due_to_user_error(\"The files that the server was started with didn't all come from \"\n            \"the same call to 'rethinkdb create'.\");\n    }\n    if (c->n_files > static_cast<int>(underlying.size())) {\n        fail_due_to_user_error(\"You forgot to include one of the files\/devices that you included \"\n            \"when the database was first created.\");\n    }\n    if (c->n_files < static_cast<int>(underlying.size())) {\n        fail_due_to_user_error(\"Got more files than expected. Did you give a file that wasn't\"\n            \"included in the call to 'rethinkdb create'? Did you duplicate one of the files?\");\n    }\n    guarantee(c->this_serializer >= 0 && c->this_serializer < static_cast<int>(underlying.size()));\n    guarantee(c->n_proxies == static_cast<int>(proxies->size()));\n\n    \/* Figure out which serializer we are (in case files were specified to 'rethinkdb serve' in a\n    different order than they were specified to 'rethinkdb create') *\/\n    int j = c->this_serializer;\n\n    int num_on_this_serializer = serializer_multiplexer_t::compute_mod_count(\n        j, underlying.size(), c->n_proxies);\n\n    \/* This is a slightly weird way of phrasing this; it's done this way so I can be sure it's\n    equivalent to the old way of doing things *\/\n    for (int k = 0; k < c->n_proxies; k++) {\n        \/* Are we responsible for creating this proxy? *\/\n        if (k % static_cast<int>(underlying.size()) != j)\n            continue;\n\n        rassert(!(*proxies)[k]);\n        (*proxies)[k] = new translator_serializer_t(\n            ser,\n            num_on_this_serializer,\n            k \/ underlying.size(),\n            CONFIG_BLOCK_ID   \/* Reserve block ID 0 *\/);\n    }\n}\n\nserializer_multiplexer_t::serializer_multiplexer_t(const std::vector<standard_serializer_t *>& underlying) {\n    rassert(!underlying.empty());\n    for (int i = 0; i < static_cast<int>(underlying.size()); ++i) {\n        rassert(underlying[i]);\n    }\n\n    \/* Figure out how many slices there are gonna be and figure out what the creation magic is *\/\n    {\n        on_thread_t thread_switcher(underlying[0]->home_thread());\n\n        \/* Load config block *\/\n        scoped_malloc_t<ser_buffer_t> buf = underlying[0]->malloc();\n\n        multiplexer_config_block_t *c\n            = reinterpret_cast<multiplexer_config_block_t *>(buf->cache_data);\n        underlying[0]->block_read(underlying[0]->index_read(CONFIG_BLOCK_ID.ser_id), c, DEFAULT_DISK_ACCOUNT);\n\n        rassert(c->magic == multiplexer_config_block_t::expected_magic);\n        creation_timestamp = c->creation_timestamp;\n        proxies.resize(c->n_proxies);\n    }\n\n    \/* Now go to each serializer and verify it individually. We visit the first serializer twice\n    (because we already visited it to get the creation magic and stuff) but that's OK. Also, create\n    proxies for the serializers (populate the 'proxies' vector) *\/\n    pmap(underlying.size(), boost::bind(&create_proxies,\n        underlying, creation_timestamp, &proxies, _1));\n\n    for (int i = 0; i < static_cast<int>(proxies.size()); ++i) rassert(proxies[i]);\n}\n\nvoid destroy_proxy(std::vector<translator_serializer_t *> *proxies, int i) {\n    on_thread_t thread_switcher((*proxies)[i]->home_thread());\n    delete (*proxies)[i];\n}\n\nserializer_multiplexer_t::~serializer_multiplexer_t() {\n    pmap(proxies.size(), boost::bind(&destroy_proxy, &proxies, _1));\n}\n\nint serializer_multiplexer_t::compute_mod_count(int32_t file_number, int32_t n_files, int32_t n_slices) {\n    \/* If we have 'n_files', and we distribute 'n_slices' over those 'n_files' such that slice 'n'\n    is on file 'n % n_files', then how many slices will be on file 'file_number'? *\/\n    return n_slices \/ n_files + (n_slices % n_files > file_number);\n}\n\n\/* translator_serializer_t *\/\n\nblock_id_t translator_serializer_t::translate_block_id(block_id_t id, int mod_count, int mod_id, config_block_id_t cfgid) {\n    return id * mod_count + mod_id + cfgid.subsequent_ser_id();\n}\n\nint translator_serializer_t::untranslate_block_id_to_mod_id(block_id_t inner_id, int mod_count, config_block_id_t cfgid) {\n    \/\/ We know that inner_id == id * mod_count + mod_id + min.\n    \/\/ Thus inner_id - min == id * mod_count + mod_id.\n    \/\/ It follows that inner_id - min === mod_id (modulo mod_count).\n    \/\/ So (inner_id - min) % mod_count == mod_id (since 0 <= mod_id < mod_count).\n    \/\/ (And inner_id - min >= 0, so '%' works as expected.)\n    return (inner_id - cfgid.subsequent_ser_id()) % mod_count;\n}\n\nblock_id_t translator_serializer_t::untranslate_block_id_to_id(block_id_t inner_id, int mod_count, int mod_id, config_block_id_t cfgid) {\n    \/\/ (simply dividing by mod_count should be sufficient, but this is cleaner)\n    return (inner_id - cfgid.subsequent_ser_id() - mod_id) \/ mod_count;\n}\n\nblock_id_t translator_serializer_t::translate_block_id(block_id_t id) const {\n    rassert(id != NULL_BLOCK_ID);\n    return translate_block_id(id, mod_count, mod_id, cfgid);\n}\n\ntranslator_serializer_t::translator_serializer_t(standard_serializer_t *_inner, int _mod_count, int _mod_id, config_block_id_t _cfgid)\n    : inner(_inner), mod_count(_mod_count), mod_id(_mod_id), cfgid(_cfgid), read_ahead_callback(NULL) {\n    rassert(mod_count > 0);\n    rassert(mod_id >= 0);\n    rassert(mod_id < mod_count);\n}\n\nscoped_malloc_t<ser_buffer_t> translator_serializer_t::malloc() {\n    return inner->malloc();\n}\n\nscoped_malloc_t<ser_buffer_t> translator_serializer_t::clone(const ser_buffer_t *data) {\n    return inner->clone(data);\n}\n\nfile_account_t *translator_serializer_t::make_io_account(int priority, int outstanding_requests_limit) {\n    return inner->make_io_account(priority, outstanding_requests_limit);\n}\n\nvoid translator_serializer_t::index_write(const std::vector<index_write_op_t>& write_ops, file_account_t *io_account) {\n    std::vector<index_write_op_t> translated_ops(write_ops);\n    for (std::vector<index_write_op_t>::iterator it = translated_ops.begin(); it < translated_ops.end(); ++it)\n        it->block_id = translate_block_id(it->block_id);\n    inner->index_write(translated_ops, io_account);\n}\n\ncounted_t<standard_block_token_t>\ntranslator_serializer_t::block_write(const void *buf, block_id_t block_id, file_account_t *io_account, iocallback_t *cb) {\n    \/\/ NULL_BLOCK_ID is special: it indicates no block id specified.  Right now only the\n    \/\/ log_serializer_t ever sees a NULL_BLOCK_ID, passed in from its data block manager in some\n    \/\/ ugly circular code.\n    if (block_id != NULL_BLOCK_ID)\n        block_id = translate_block_id(block_id);\n    return inner->block_write(buf, block_id, io_account, cb);\n}\n\nvoid translator_serializer_t::block_read(const counted_t<standard_block_token_t>& token, void *buf, file_account_t *io_account, iocallback_t *cb) {\n    return inner->block_read(token, buf, io_account, cb);\n}\n\nvoid translator_serializer_t::block_read(const counted_t<standard_block_token_t>& token, void *buf, file_account_t *io_account) {\n    return inner->block_read(token, buf, io_account);\n}\n\ncounted_t<standard_block_token_t> translator_serializer_t::index_read(block_id_t block_id) {\n    return inner->index_read(translate_block_id(block_id));\n}\n\nblock_size_t translator_serializer_t::get_block_size()  const {\n    return inner->get_block_size();\n}\n\nbool translator_serializer_t::coop_lock_and_check() {\n    return inner->coop_lock_and_check();\n}\n\nblock_id_t translator_serializer_t::max_block_id() {\n    int64_t x = inner->max_block_id() - cfgid.subsequent_ser_id();\n    if (x <= 0) {\n        x = 0;\n    } else {\n        while (x % mod_count != mod_id) x++;\n        x \/= mod_count;\n    }\n    rassert(translate_block_id(x) >= inner->max_block_id());\n\n    while (x > 0) {\n        --x;\n        if (!get_delete_bit(x)) {\n            ++x;\n            break;\n        }\n    }\n    return x;\n}\n\nrepli_timestamp_t translator_serializer_t::get_recency(block_id_t id) {\n    return inner->get_recency(translate_block_id(id));\n}\n\nbool translator_serializer_t::get_delete_bit(block_id_t id) {\n    return inner->get_delete_bit(translate_block_id(id));\n}\n\nbool translator_serializer_t::offer_read_ahead_buf(\n        block_id_t block_id,\n        ser_buffer_t *buf,\n        block_size_t block_size,\n        const counted_t<standard_block_token_t> &token,\n        repli_timestamp_t recency_timestamp) {\n    inner->assert_thread();\n\n    if (block_id <= CONFIG_BLOCK_ID.ser_id) {\n        \/\/ Serializer multiplexer config block is not of interest.\n        return false;\n    }\n\n    \/\/ Offer the buffer if we are the correct shard\n    const int buf_mod_id = untranslate_block_id_to_mod_id(block_id, mod_count, cfgid);\n    if (buf_mod_id != this->mod_id) {\n        \/\/ We are not responsible...\n        return false;\n    }\n\n    if (read_ahead_callback) {\n        const block_id_t inner_block_id = untranslate_block_id_to_id(block_id, mod_count, mod_id, cfgid);\n        if (!read_ahead_callback->offer_read_ahead_buf(inner_block_id, buf, block_size,\n                                                       token, recency_timestamp)) {\n            \/\/ They aren't going to free the buffer, so we do.\n            free(buf);\n        }\n    } else {\n        \/\/ Discard the buffer\n        free(buf);\n    }\n    return true;\n}\n\nvoid translator_serializer_t::register_read_ahead_cb(serializer_read_ahead_callback_t *cb) {\n    on_thread_t t(inner->home_thread());\n\n    rassert(!read_ahead_callback);\n    inner->register_read_ahead_cb(this);\n    read_ahead_callback = cb;\n}\nvoid translator_serializer_t::unregister_read_ahead_cb(DEBUG_VAR serializer_read_ahead_callback_t *cb) {\n    on_thread_t t(inner->home_thread());\n\n    rassert(read_ahead_callback == NULL || cb == read_ahead_callback);\n    inner->unregister_read_ahead_cb(this);\n    read_ahead_callback = NULL;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\nThe default runner expects:\n\n- to have TEST_FUNC defined to the Halide pipeline name being tested\n- to have TEST_IN_T\/TEST_OUT_T defined to the type name for the input\/output buffer of TEST_FUNC\n    e.g. `float` or `uint8_t`\n- to have libpng in the include path, and linked into the resulting binary:\n    e.g. `$(libpng-config --cflags --ldflags)`\n- to be compiled in the same directory with <TEST_FUNC>.h\n- to have the Halide\/support directory in its include path, for static_image.h\/image_io.h\n*\/\n\n#ifndef TEST_FUNC\n#error default_runner must be compiled with TEST_FUNC defined\n#endif\n#define TEST_HEADER TEST_FUNC.h\n\n\/\/ Utilities to paste a macro as a string constant in another macro.\n\/\/ via: http:\/\/gcc.gnu.org\/onlinedocs\/cpp\/Stringification.html\n#define str(s) xstr(s)\n#define xstr(s) #s\n\nextern \"C\" {\n#include str(TEST_HEADER)\n}\n#include <static_image.h>\n#include <image_io.h>\n\n#include <sys\/time.h>\n\n#include <string>\nusing std::string;\n\nstatic const string usage = \"Usage:\\n\\\n\\trunner <test iterations> <input_image.png> [reference_output.png] [w|-1] [h|-1] [channels|-1] [save_output.png]\";\n\ntemplate<class T>\nbool images_equal(Image<T> &a, Image<T> &b, T eps) {\n    if (a.width() != b.width() || a.height() != b.height() || a.channels() != b.channels()) {\n        return false;\n    }\n    for (int c = 0; c < a.channels(); c++) {\n        for (int y = 0; y < a.height(); y++) {\n            for (int x = 0; x < a.width(); x++) {\n                T ac = a(x,y,c);\n                T bc = b(x,y,c);\n                T delta = ac > bc ? ac - bc: bc - ac;\n                if (delta > eps) { return false; }\n            }\n        }\n    }\n    return true;\n}\n\nint main(int argc, char const *argv[])\n{\n    if (argc < 3) {\n        fprintf(stderr, \"%s\\n\", usage.c_str());\n        return -1;\n    }\n\n    int test_iterations = atoi(argv[1]);\n    \n    Image<TEST_IN_T> input = load<TEST_IN_T>(argv[2]);\n    int w        = argc > 4 ? atoi(argv[4]): -1;\n    int h        = argc > 5 ? atoi(argv[5]): -1;\n    int channels = argc > 6 ? atoi(argv[6]): -1;\n    char const *save_output = argc > 7 ? argv[7]: NULL;\n    \n    if (w < 0) { w = input.width(); }\n    if (h < 0) { h = input.height(); }\n    if (channels < 0) { channels = input.channels(); }\n    \n    Image<TEST_OUT_T> output(w, h, channels);\n    Image<TEST_OUT_T> ref_output(1,1,1);\n    bool has_ref = false;\n    if (argc > 3 && strcmp(argv[3], \"\") != 0) {\n        ref_output = load<TEST_OUT_T>(argv[3]);\n        has_ref = true;\n    }\n\n    \/\/ Timing code\n    timeval t1, t2;\n    unsigned int bestT = 0xffffffff;\n    for (int i = 0; i < test_iterations; i++) {\n        gettimeofday(&t1, NULL);\n        TEST_FUNC(input, output);\n        gettimeofday(&t2, NULL);\n        unsigned int t = (t2.tv_sec - t1.tv_sec) * 1000000 + (t2.tv_usec - t1.tv_usec);\n        if (t < bestT) bestT = t;\n    }\n\n    \/\/ Saving large PNGs is expensive. Only do it if enabled.\n    if (save_output != NULL && strcmp(save_output, \"\") != 0) {\n        save(output, save_output);\n    }\n\n    if (has_ref) {\n        if (!images_equal<TEST_OUT_T>(ref_output, output, 0.01)) {\n            printf(\"RUN_CHECK_FAIL\\n\");\n            exit(1);\n        }\n    }\n    printf(\"Success %f\\n\", bestT\/1000000.0);\n\n    return 0;\n}\n<commit_msg>py bindings -- time load in runner<commit_after>\/*\nThe default runner expects:\n\n- to have TEST_FUNC defined to the Halide pipeline name being tested\n- to have TEST_IN_T\/TEST_OUT_T defined to the type name for the input\/output buffer of TEST_FUNC\n    e.g. `float` or `uint8_t`\n- to have libpng in the include path, and linked into the resulting binary:\n    e.g. `$(libpng-config --cflags --ldflags)`\n- to be compiled in the same directory with <TEST_FUNC>.h\n- to have the Halide\/support directory in its include path, for static_image.h\/image_io.h\n*\/\n\n#ifndef TEST_FUNC\n#error default_runner must be compiled with TEST_FUNC defined\n#endif\n#define TEST_HEADER TEST_FUNC.h\n\n\/\/ Utilities to paste a macro as a string constant in another macro.\n\/\/ via: http:\/\/gcc.gnu.org\/onlinedocs\/cpp\/Stringification.html\n#define str(s) xstr(s)\n#define xstr(s) #s\n\nextern \"C\" {\n#include str(TEST_HEADER)\n}\n#include <static_image.h>\n#include <image_io.h>\n\n#include <sys\/time.h>\n\n#include <string>\nusing std::string;\n\nstatic const string usage = \"Usage:\\n\\\n\\trunner <test iterations> <input_image.png> [reference_output.png] [w|-1] [h|-1] [channels|-1] [save_output.png]\";\n\ntemplate<class T>\nbool images_equal(Image<T> &a, Image<T> &b, T eps) {\n    if (a.width() != b.width() || a.height() != b.height() || a.channels() != b.channels()) {\n        return false;\n    }\n    for (int c = 0; c < a.channels(); c++) {\n        for (int y = 0; y < a.height(); y++) {\n            for (int x = 0; x < a.width(); x++) {\n                T ac = a(x,y,c);\n                T bc = b(x,y,c);\n                T delta = ac > bc ? ac - bc: bc - ac;\n                if (delta > eps) { return false; }\n            }\n        }\n    }\n    return true;\n}\n\nint main(int argc, char const *argv[])\n{\n    if (argc < 3) {\n        fprintf(stderr, \"%s\\n\", usage.c_str());\n        return -1;\n    }\n\n    int test_iterations = atoi(argv[1]);\n    \n    timeval t1, t2;\n    unsigned int t;\n    gettimeofday(&t1, NULL);\n    Image<TEST_IN_T> input = load<TEST_IN_T>(argv[2]);\n    gettimeofday(&t2, NULL);\n    t = (t2.tv_sec - t1.tv_sec) * 1000000 + (t2.tv_usec - t1.tv_usec);\n    printf(\"load time input: %.4f secs\\n\", t);\n    int w        = argc > 4 ? atoi(argv[4]): -1;\n    int h        = argc > 5 ? atoi(argv[5]): -1;\n    int channels = argc > 6 ? atoi(argv[6]): -1;\n    char const *save_output = argc > 7 ? argv[7]: NULL;\n    \n    if (w < 0) { w = input.width(); }\n    if (h < 0) { h = input.height(); }\n    if (channels < 0) { channels = input.channels(); }\n    \n    Image<TEST_OUT_T> output(w, h, channels);\n    Image<TEST_OUT_T> ref_output(1,1,1);\n    bool has_ref = false;\n    if (argc > 3 && strcmp(argv[3], \"\") != 0) {\n        gettimeofday(&t1, NULL);\n        ref_output = load<TEST_OUT_T>(argv[3]);\n        gettimeofday(&t2, NULL);\n        t = (t2.tv_sec - t1.tv_sec) * 1000000 + (t2.tv_usec - t1.tv_usec);\n        printf(\"load time output: %.4f secs\\n\", t);\n        has_ref = true;\n    }\n\n    \/\/ Timing code\n    unsigned int bestT = 0xffffffff;\n    for (int i = 0; i < test_iterations; i++) {\n        gettimeofday(&t1, NULL);\n        TEST_FUNC(input, output);\n        gettimeofday(&t2, NULL);\n        t = (t2.tv_sec - t1.tv_sec) * 1000000 + (t2.tv_usec - t1.tv_usec);\n        if (t < bestT) bestT = t;\n    }\n\n    \/\/ Saving large PNGs is expensive. Only do it if enabled.\n    if (save_output != NULL && strcmp(save_output, \"\") != 0) {\n        save(output, save_output);\n    }\n\n    if (has_ref) {\n        if (!images_equal<TEST_OUT_T>(ref_output, output, 0.01)) {\n            printf(\"RUN_CHECK_FAIL\\n\");\n            exit(1);\n        }\n    }\n    printf(\"Success %f\\n\", bestT\/1000000.0);\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"sl_field.h\"\r\n\r\n#include <algorithm>\r\n#include <iostream>\r\n\r\n#include \"sl_problem.h\"\r\n#include \"sl_database.h\"\r\n\r\nnamespace penciloid\r\n{\r\nnamespace slitherlink\r\n{\r\nField::Field() : GridLoop<Field>(), field_clue_(nullptr), database_(nullptr)\r\n{\r\n}\r\nField::Field(Y height, X width, Database *database) : GridLoop<Field>(height, width), field_clue_(nullptr), database_(database)\r\n{\r\n\tint cell_count = static_cast<int>(height) * static_cast<int>(width);\r\n\tfield_clue_ = new Clue[cell_count];\r\n\tstd::fill(field_clue_, field_clue_ + cell_count, kNoClue);\r\n}\r\nField::Field(const Field& other) : GridLoop<Field>(other), field_clue_(nullptr), database_(other.database_)\r\n{\r\n\tint cell_count = static_cast<int>(height()) * static_cast<int>(width());\r\n\tfield_clue_ = new Clue[cell_count];\r\n\tmemcpy(field_clue_, other.field_clue_, cell_count * sizeof(Clue));\r\n}\r\nField::Field(Field&& other) : GridLoop<Field>(other), field_clue_(other.field_clue_), database_(other.database_)\r\n{\r\n\tother.field_clue_ = nullptr;\r\n}\r\nField &Field::operator=(const Field& other)\r\n{\r\n\tGridLoop<Field>::operator=(other);\r\n\r\n\tif (field_clue_) delete[] field_clue_;\r\n\tint cell_count = static_cast<int>(height()) * static_cast<int>(width());\r\n\tfield_clue_ = new Clue[cell_count];\r\n\tmemcpy(field_clue_, other.field_clue_, cell_count * sizeof(Clue));\r\n\r\n\tdatabase_ = other.database_;\r\n\r\n\treturn *this;\r\n}\r\nField &Field::operator=(Field&& other)\r\n{\r\n\tGridLoop<Field>::operator=(other);\r\n\r\n\tfield_clue_ = other.field_clue_;\r\n\tother.field_clue_ = nullptr;\r\n\tdatabase_ = other.database_;\r\n\r\n\treturn *this;\r\n}\r\nField::Field(const Problem& problem, Database *database) : GridLoop<Field>(problem.height(), problem.width()), field_clue_(nullptr), database_(database)\r\n{\r\n\tint cell_count = static_cast<int>(height()) * static_cast<int>(width());\r\n\tfield_clue_ = new Clue[cell_count];\r\n\tstd::fill(field_clue_, field_clue_ + cell_count, kNoClue);\r\n\r\n\tfor (Y y(0); y < height(); ++y) {\r\n\t\tfor (X x(0); x < width(); ++x) {\r\n\t\t\tif (problem.GetClue(CellPosition(y, x)) != kNoClue) AddClue(CellPosition(y, x), problem.GetClue(CellPosition(y, x)));\r\n\t\t}\r\n\t}\r\n}\r\nField::~Field()\r\n{\r\n\tif (field_clue_) delete[] field_clue_;\r\n}\r\nvoid Field::AddClue(CellPosition pos, Clue clue)\r\n{\r\n\tif (GetClue(pos) != kNoClue) {\r\n\t\tif (GetClue(pos) != clue) {\r\n\t\t\tSetInconsistent();\r\n\t\t}\r\n\t\treturn;\r\n\t}\r\n\r\n\tfield_clue_[CellId(pos)] = clue;\r\n\tApplyTheorem(LoopPosition(pos.y * 2 + 1, pos.x * 2 + 1));\r\n\tCheck(LoopPosition(pos.y * 2 + 1, pos.x * 2 + 1));\r\n}\r\nvoid Field::Inspect(LoopPosition pos)\r\n{\r\n\tif (database_ == nullptr) return;\r\n\tif (!(pos.y % 2 == 1 && pos.x % 2 == 1)) return;\r\n\tif (GetClue(CellPosition(pos.y \/ 2, pos.x \/ 2)) == kNoClue) return;\r\n\r\n\tunsigned int db_id = 0;\r\n\tfor (int i = 11; i >= 0; --i) {\r\n\t\tEdgeState status = GetEdgeSafe(pos + Database::kNeighbor[i]);\r\n\t\t\r\n\t\tif (status == EDGE_UNDECIDED) db_id = db_id * 3 + Database::kUndecided;\r\n\t\telse if (status == EDGE_LINE) db_id = db_id * 3 + Database::kLine;\r\n\t\telse if (status == EDGE_BLANK) db_id = db_id * 3 + Database::kBlank;\r\n\t}\r\n\r\n\tClue c = GetClue(CellPosition(pos.y \/ 2, pos.x \/ 2));\r\n\tunsigned int db_result = database_->Get(db_id, GetClue(CellPosition(pos.y \/ 2, pos.x \/ 2)));\r\n\tif (db_result == 0xffffffffU) {\r\n\t\tSetInconsistent();\r\n\t\treturn;\r\n\t}\r\n\r\n\tfor (int i = 0; i < 12; ++i) {\r\n\t\tint new_status = (db_result >> (2 * i)) & 3;\r\n\t\tif (new_status == Database::kLine) {\r\n\t\t\tDecideEdge(pos + Database::kNeighbor[i], EDGE_LINE);\r\n\t\t}\r\n\t\tif (new_status == Database::kBlank) {\r\n\t\t\tLoopPosition edge_pos = pos + Database::kNeighbor[i];\r\n\t\t\tif (0 <= edge_pos.y && edge_pos.y <= 2 * height() && 0 <= edge_pos.x && edge_pos.x <= 2 * width()) {\r\n\t\t\t\tDecideEdge(pos + Database::kNeighbor[i], EDGE_BLANK);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\nvoid Field::ApplyTheorem(LoopPosition pos)\r\n{\r\n\t\/\/ pos: coordinate of GridLoop\r\n\tstatic const Direction dir[] = {\r\n\t\tDirection(Y(1), X(0)),\r\n\t\tDirection(Y(0), X(1)),\r\n\t\tDirection(Y(-1), X(0)),\r\n\t\tDirection(Y(0), X(-1))\r\n\t};\r\n\r\n\tif (GetClue(CellPosition(pos.y \/ 2, pos.x \/ 2)) == 3) {\r\n\t\t\/\/ Adjacent 3s\r\n\t\tfor (int i = 0; i < 4; ++i) {\r\n\t\t\tCellPosition pos2 = CellPosition(pos.y \/ 2, pos.x \/ 2) + dir[i];\r\n\t\t\tif (0 <= pos2.y && pos2.y < height() && 0 <= pos2.x && pos2.x < width() && GetClue(pos2) == 3) {\r\n\t\t\t\tDecideEdge(pos + dir[i], EDGE_LINE);\r\n\t\t\t\tDecideEdge(pos + dir[i] + dir[i] + dir[i], EDGE_LINE);\r\n\t\t\t\tDecideEdge(pos - dir[i], EDGE_LINE);\r\n\t\t\t\tDecideEdge(pos + dir[i] + dir[i ^ 1] + dir[i ^ 1], EDGE_BLANK);\r\n\t\t\t\tDecideEdge(pos + dir[i] - dir[i ^ 1] - dir[i ^ 1], EDGE_BLANK);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t\/\/ Diagonal 3s\r\n\t\tfor (int i = 0; i < 4; ++i) {\r\n\t\t\tCellPosition pos2 = CellPosition(pos.y \/ 2, pos.x \/ 2) + dir[i] + dir[(i + 1) & 3];\r\n\t\t\tif (0 <= pos2.y && pos2.y < height() && 0 <= pos2.x && pos2.x < width() && GetClue(pos2) == 3) {\r\n\t\t\t\tDecideEdge(pos - dir[i], EDGE_LINE);\r\n\t\t\t\tDecideEdge(pos - dir[(i + 1) & 3], EDGE_LINE);\r\n\t\t\t\tDecideEdge(pos + dir[i] + dir[i] + dir[i] + dir[(i + 1) & 3] + dir[(i + 1) & 3], EDGE_LINE);\r\n\t\t\t\tDecideEdge(pos + dir[i] + dir[i] + dir[(i + 1) & 3] + dir[(i + 1) & 3] + dir[(i + 1) & 3], EDGE_LINE);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\n\r\nstd::ostream& operator<<(std::ostream &stream, Field &field)\r\n{\r\n\tfor (Y y(0); y <= 2 * field.height(); ++y) {\r\n\t\tfor (X x(0); x <= 2 * field.width(); ++x) {\r\n\t\t\tif (y % 2 == 0 && x % 2 == 0) {\r\n\t\t\t\tstream << \"+\";\r\n\t\t\t} else if (y % 2 == 0 && x % 2 == 1) {\r\n\t\t\t\tField::EdgeState status = field.GetEdge(LoopPosition(y, x));\r\n\t\t\t\tif (status == Field::EDGE_UNDECIDED) stream << \"   \";\r\n\t\t\t\telse if (status == Field::EDGE_LINE) stream << \"---\";\r\n\t\t\t\telse if (status == Field::EDGE_BLANK) stream << \" X \";\r\n\t\t\t} else if (y % 2 == 1 && x % 2 == 0) {\r\n\t\t\t\tField::EdgeState status = field.GetEdge(LoopPosition(y, x));\r\n\t\t\t\tif (status == Field::EDGE_UNDECIDED) stream << \" \";\r\n\t\t\t\telse if (status == Field::EDGE_LINE) stream << \"|\";\r\n\t\t\t\telse if (status == Field::EDGE_BLANK) stream << \"X\";\r\n\t\t\t} else if (y % 2 == 1 && x % 2 == 1) {\r\n\t\t\t\tClue clue = field.GetClue(CellPosition(y \/ 2, x \/ 2));\r\n\t\t\t\tif (clue == kNoClue) stream << \"   \";\r\n\t\t\t\telse stream << \" \" << clue << \" \";\r\n\t\t\t}\r\n\t\t}\r\n\t\tstream << \"\\n\";\r\n\t}\r\n\treturn stream;\r\n}\r\n}\r\n}\r\n<commit_msg>Slitherlink: implement DiagonalChain<commit_after>#include \"sl_field.h\"\r\n\r\n#include <algorithm>\r\n#include <iostream>\r\n\r\n#include \"sl_problem.h\"\r\n#include \"sl_database.h\"\r\n\r\nnamespace penciloid\r\n{\r\nnamespace slitherlink\r\n{\r\nField::Field() : GridLoop<Field>(), field_clue_(nullptr), database_(nullptr)\r\n{\r\n}\r\nField::Field(Y height, X width, Database *database) : GridLoop<Field>(height, width), field_clue_(nullptr), database_(database)\r\n{\r\n\tint cell_count = static_cast<int>(height) * static_cast<int>(width);\r\n\tfield_clue_ = new Clue[cell_count];\r\n\tstd::fill(field_clue_, field_clue_ + cell_count, kNoClue);\r\n}\r\nField::Field(const Field& other) : GridLoop<Field>(other), field_clue_(nullptr), database_(other.database_)\r\n{\r\n\tint cell_count = static_cast<int>(height()) * static_cast<int>(width());\r\n\tfield_clue_ = new Clue[cell_count];\r\n\tmemcpy(field_clue_, other.field_clue_, cell_count * sizeof(Clue));\r\n}\r\nField::Field(Field&& other) : GridLoop<Field>(other), field_clue_(other.field_clue_), database_(other.database_)\r\n{\r\n\tother.field_clue_ = nullptr;\r\n}\r\nField &Field::operator=(const Field& other)\r\n{\r\n\tGridLoop<Field>::operator=(other);\r\n\r\n\tif (field_clue_) delete[] field_clue_;\r\n\tint cell_count = static_cast<int>(height()) * static_cast<int>(width());\r\n\tfield_clue_ = new Clue[cell_count];\r\n\tmemcpy(field_clue_, other.field_clue_, cell_count * sizeof(Clue));\r\n\r\n\tdatabase_ = other.database_;\r\n\r\n\treturn *this;\r\n}\r\nField &Field::operator=(Field&& other)\r\n{\r\n\tGridLoop<Field>::operator=(other);\r\n\r\n\tfield_clue_ = other.field_clue_;\r\n\tother.field_clue_ = nullptr;\r\n\tdatabase_ = other.database_;\r\n\r\n\treturn *this;\r\n}\r\nField::Field(const Problem& problem, Database *database) : GridLoop<Field>(problem.height(), problem.width()), field_clue_(nullptr), database_(database)\r\n{\r\n\tint cell_count = static_cast<int>(height()) * static_cast<int>(width());\r\n\tfield_clue_ = new Clue[cell_count];\r\n\tstd::fill(field_clue_, field_clue_ + cell_count, kNoClue);\r\n\r\n\tfor (Y y(0); y < height(); ++y) {\r\n\t\tfor (X x(0); x < width(); ++x) {\r\n\t\t\tif (problem.GetClue(CellPosition(y, x)) != kNoClue) AddClue(CellPosition(y, x), problem.GetClue(CellPosition(y, x)));\r\n\t\t}\r\n\t}\r\n}\r\nField::~Field()\r\n{\r\n\tif (field_clue_) delete[] field_clue_;\r\n}\r\nvoid Field::AddClue(CellPosition pos, Clue clue)\r\n{\r\n\tif (GetClue(pos) != kNoClue) {\r\n\t\tif (GetClue(pos) != clue) {\r\n\t\t\tSetInconsistent();\r\n\t\t}\r\n\t\treturn;\r\n\t}\r\n\r\n\tfield_clue_[CellId(pos)] = clue;\r\n\tApplyTheorem(LoopPosition(pos.y * 2 + 1, pos.x * 2 + 1));\r\n\tCheck(LoopPosition(pos.y * 2 + 1, pos.x * 2 + 1));\r\n}\r\nvoid Field::Inspect(LoopPosition pos)\r\n{\r\n\tif (database_ == nullptr) return;\r\n\tif (!(pos.y % 2 == 1 && pos.x % 2 == 1)) return;\r\n\tif (GetClue(CellPosition(pos.y \/ 2, pos.x \/ 2)) == kNoClue) return;\r\n\r\n\tunsigned int db_id = 0;\r\n\tfor (int i = 11; i >= 0; --i) {\r\n\t\tEdgeState status = GetEdgeSafe(pos + Database::kNeighbor[i]);\r\n\t\t\r\n\t\tif (status == EDGE_UNDECIDED) db_id = db_id * 3 + Database::kUndecided;\r\n\t\telse if (status == EDGE_LINE) db_id = db_id * 3 + Database::kLine;\r\n\t\telse if (status == EDGE_BLANK) db_id = db_id * 3 + Database::kBlank;\r\n\t}\r\n\r\n\tClue c = GetClue(CellPosition(pos.y \/ 2, pos.x \/ 2));\r\n\tunsigned int db_result = database_->Get(db_id, GetClue(CellPosition(pos.y \/ 2, pos.x \/ 2)));\r\n\tif (db_result == 0xffffffffU) {\r\n\t\tSetInconsistent();\r\n\t\treturn;\r\n\t}\r\n\r\n\tfor (int i = 0; i < 12; ++i) {\r\n\t\tint new_status = (db_result >> (2 * i)) & 3;\r\n\t\tif (new_status == Database::kLine) {\r\n\t\t\tDecideEdge(pos + Database::kNeighbor[i], EDGE_LINE);\r\n\t\t}\r\n\t\tif (new_status == Database::kBlank) {\r\n\t\t\tLoopPosition edge_pos = pos + Database::kNeighbor[i];\r\n\t\t\tif (0 <= edge_pos.y && edge_pos.y <= 2 * height() && 0 <= edge_pos.x && edge_pos.x <= 2 * width()) {\r\n\t\t\t\tDecideEdge(pos + Database::kNeighbor[i], EDGE_BLANK);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tCheckDiagonalChain(pos);\r\n}\r\nvoid Field::ApplyTheorem(LoopPosition pos)\r\n{\r\n\t\/\/ pos: coordinate of GridLoop\r\n\tstatic const Direction dir[] = {\r\n\t\tDirection(Y(1), X(0)),\r\n\t\tDirection(Y(0), X(1)),\r\n\t\tDirection(Y(-1), X(0)),\r\n\t\tDirection(Y(0), X(-1))\r\n\t};\r\n\r\n\tif (GetClue(CellPosition(pos.y \/ 2, pos.x \/ 2)) == 3) {\r\n\t\t\/\/ Adjacent 3s\r\n\t\tfor (int i = 0; i < 4; ++i) {\r\n\t\t\tCellPosition pos2 = CellPosition(pos.y \/ 2, pos.x \/ 2) + dir[i];\r\n\t\t\tif (0 <= pos2.y && pos2.y < height() && 0 <= pos2.x && pos2.x < width() && GetClue(pos2) == 3) {\r\n\t\t\t\tDecideEdge(pos + dir[i], EDGE_LINE);\r\n\t\t\t\tDecideEdge(pos + dir[i] + dir[i] + dir[i], EDGE_LINE);\r\n\t\t\t\tDecideEdge(pos - dir[i], EDGE_LINE);\r\n\t\t\t\tDecideEdge(pos + dir[i] + dir[i ^ 1] + dir[i ^ 1], EDGE_BLANK);\r\n\t\t\t\tDecideEdge(pos + dir[i] - dir[i ^ 1] - dir[i ^ 1], EDGE_BLANK);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t\/\/ Diagonal 3s\r\n\t\tfor (int i = 0; i < 4; ++i) {\r\n\t\t\tCellPosition pos2 = CellPosition(pos.y \/ 2, pos.x \/ 2) + dir[i] + dir[(i + 1) & 3];\r\n\t\t\tif (0 <= pos2.y && pos2.y < height() && 0 <= pos2.x && pos2.x < width() && GetClue(pos2) == 3) {\r\n\t\t\t\tDecideEdge(pos - dir[i], EDGE_LINE);\r\n\t\t\t\tDecideEdge(pos - dir[(i + 1) & 3], EDGE_LINE);\r\n\t\t\t\tDecideEdge(pos + dir[i] + dir[i] + dir[i] + dir[(i + 1) & 3] + dir[(i + 1) & 3], EDGE_LINE);\r\n\t\t\t\tDecideEdge(pos + dir[i] + dir[i] + dir[(i + 1) & 3] + dir[(i + 1) & 3] + dir[(i + 1) & 3], EDGE_LINE);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\nvoid Field::CheckDiagonalChain(LoopPosition pos)\r\n{\r\n\tstatic const Direction kDirs[] = {\r\n\t\tDirection(Y(1), X(0)),\r\n\t\tDirection(Y(0), X(1)),\r\n\t\tDirection(Y(-1), X(0)),\r\n\t\tDirection(Y(0), X(-1))\r\n\t};\r\n\r\n\tif (GetClue(CellPosition(pos.y \/ 2, pos.x \/ 2)) == kNoClue) return;\r\n\r\n\tstatic const auto check_and_update_parity = [](EdgeState s1, EdgeState s2, int prev_parity) {\r\n\t\tif (s1 == EDGE_UNDECIDED || s2 == EDGE_UNDECIDED) return prev_parity;\r\n\t\tif (s1 == s2) return 0;\r\n\t\treturn 1;\r\n\t};\r\n\tstatic const auto edge_state_by_parity = [](EdgeState s1, int parity) {\r\n\t\tif (parity == 1) {\r\n\t\t\tif (s1 == EDGE_LINE) return EDGE_BLANK;\r\n\t\t\telse return EDGE_LINE;\r\n\t\t}\r\n\t\treturn s1;\r\n\t};\r\n\r\n\tfor (int d = 0; d < 4; ++d) {\r\n\t\tDirection dir1 = kDirs[d], dir2 = kDirs[(d + 1) % 4];\r\n\t\tLoopPosition cell_loop_pos = pos;\r\n\t\tCellPosition cell_pos(pos.y \/ 2, pos.x \/ 2);\r\n\r\n\t\tint vertex_parity = -1;\r\n\t\tvertex_parity = check_and_update_parity(\r\n\t\t\tGetEdgeSafe(cell_loop_pos - dir1),\r\n\t\t\tGetEdgeSafe(cell_loop_pos - dir2),\r\n\t\t\tvertex_parity\r\n\t\t\t);\r\n\t\tvertex_parity = check_and_update_parity(\r\n\t\t\tGetEdgeSafe(cell_loop_pos - dir1 - dir2 * 2),\r\n\t\t\tGetEdgeSafe(cell_loop_pos - dir2 - dir1 * 2),\r\n\t\t\tvertex_parity\r\n\t\t\t);\r\n\r\n\t\tif (vertex_parity == -1) continue;\r\n\r\n\t\twhile (0 <= cell_pos.y && cell_pos.y < height() && 0 <= cell_pos.x && cell_pos.x < width()) {\r\n\t\t\tif (GetClue(cell_pos) == kNoClue || GetClue(cell_pos) == 0) break;\r\n\r\n\t\t\tif (GetClue(cell_pos) == 1) {\r\n\t\t\t\tif (vertex_parity == 0) {\r\n\t\t\t\t\tDecideEdge(cell_loop_pos - dir1, EDGE_BLANK);\r\n\t\t\t\t\tDecideEdge(cell_loop_pos - dir2, EDGE_BLANK);\r\n\t\t\t\t} else if (vertex_parity == 1) {\r\n\t\t\t\t\tDecideEdge(cell_loop_pos + dir1, EDGE_BLANK);\r\n\t\t\t\t\tDecideEdge(cell_loop_pos + dir2, EDGE_BLANK);\r\n\t\t\t\t}\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t\tif (GetClue(cell_pos) == 3) {\r\n\t\t\t\tif (vertex_parity == 0) {\r\n\t\t\t\t\tDecideEdge(cell_loop_pos - dir1, EDGE_LINE);\r\n\t\t\t\t\tDecideEdge(cell_loop_pos - dir2, EDGE_LINE);\r\n\t\t\t\t} else if (vertex_parity == 1) {\r\n\t\t\t\t\tDecideEdge(cell_loop_pos + dir1, EDGE_LINE);\r\n\t\t\t\t\tDecideEdge(cell_loop_pos + dir2, EDGE_LINE);\r\n\t\t\t\t}\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t\tif (GetClue(cell_pos) == 2) {\r\n\t\t\t\tif (GetEdgeSafe(cell_loop_pos + dir1) != EDGE_UNDECIDED) {\r\n\t\t\t\t\tDecideEdge(cell_loop_pos + dir2, edge_state_by_parity(GetEdgeSafe(cell_loop_pos + dir1), vertex_parity));\r\n\t\t\t\t}\r\n\t\t\t\tif (GetEdgeSafe(cell_loop_pos + dir2) != EDGE_UNDECIDED) {\r\n\t\t\t\t\tDecideEdge(cell_loop_pos + dir1, edge_state_by_parity(GetEdgeSafe(cell_loop_pos + dir2), vertex_parity));\r\n\t\t\t\t}\r\n\t\t\t\tif (GetEdgeSafe(cell_loop_pos + dir1 + dir2 * 2) != EDGE_UNDECIDED) {\r\n\t\t\t\t\tDecideEdge(cell_loop_pos + dir2 + dir1 * 2, edge_state_by_parity(GetEdgeSafe(cell_loop_pos + dir1 + dir2 * 2), vertex_parity));\r\n\t\t\t\t}\r\n\t\t\t\tif (GetEdgeSafe(cell_loop_pos + dir2 + dir1 * 2) != EDGE_UNDECIDED) {\r\n\t\t\t\t\tDecideEdge(cell_loop_pos + dir1 + dir2 * 2, edge_state_by_parity(GetEdgeSafe(cell_loop_pos + dir2 + dir1 * 2), vertex_parity));\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tcell_pos = cell_pos + dir1 + dir2;\r\n\t\t\tcell_loop_pos = cell_loop_pos + (dir1 + dir2) * 2;\r\n\t\t}\r\n\t}\r\n}\r\nstd::ostream& operator<<(std::ostream &stream, Field &field)\r\n{\r\n\tfor (Y y(0); y <= 2 * field.height(); ++y) {\r\n\t\tfor (X x(0); x <= 2 * field.width(); ++x) {\r\n\t\t\tif (y % 2 == 0 && x % 2 == 0) {\r\n\t\t\t\tstream << \"+\";\r\n\t\t\t} else if (y % 2 == 0 && x % 2 == 1) {\r\n\t\t\t\tField::EdgeState status = field.GetEdge(LoopPosition(y, x));\r\n\t\t\t\tif (status == Field::EDGE_UNDECIDED) stream << \"   \";\r\n\t\t\t\telse if (status == Field::EDGE_LINE) stream << \"---\";\r\n\t\t\t\telse if (status == Field::EDGE_BLANK) stream << \" X \";\r\n\t\t\t} else if (y % 2 == 1 && x % 2 == 0) {\r\n\t\t\t\tField::EdgeState status = field.GetEdge(LoopPosition(y, x));\r\n\t\t\t\tif (status == Field::EDGE_UNDECIDED) stream << \" \";\r\n\t\t\t\telse if (status == Field::EDGE_LINE) stream << \"|\";\r\n\t\t\t\telse if (status == Field::EDGE_BLANK) stream << \"X\";\r\n\t\t\t} else if (y % 2 == 1 && x % 2 == 1) {\r\n\t\t\t\tClue clue = field.GetClue(CellPosition(y \/ 2, x \/ 2));\r\n\t\t\t\tif (clue == kNoClue) stream << \"   \";\r\n\t\t\t\telse stream << \" \" << clue << \" \";\r\n\t\t\t}\r\n\t\t}\r\n\t\tstream << \"\\n\";\r\n\t}\r\n\treturn stream;\r\n}\r\n}\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>#include <pthread.h>\n#include <stdio.h>\n#include <string>\n#include <vector>\n#include <queue>\n#include \"zmq.hpp\"\n#include \"canna_core.h\"\n\n#define CLIENT_NUM 5\n#define WORKER_NUM 3\n#define WORKER_READY \"READY\"\n\nstatic char *self;\nstatic char *cloud;\n\nstatic void * client_task(void *args)\n{\n    printf(\"client thread start\\n\");\n    zmq::context_t context(1);\n    zmq::socket_t client(context, ZMQ_REQ);\n    char client_ipc[64] = {0};\n    sprintf(client_ipc, \"ipc:\/\/%s-localfe.ipc\", self);\n    client.connect(client_ipc);\n\n    while (true) {\n        canna_send(client, \"HELLO\");\n        std::string reply = canna_recv(client);\n        printf(\"CLIENT: %s\\n\", reply.c_str());\n        \/\/canna_sleep(1000);\n    }\n\n    return nullptr;\n}\n\nstatic void * worker_task(void *args)\n{\n    printf(\"worker thread start\\n\");\n    zmq::context_t context(1);\n    zmq::socket_t worker(context, ZMQ_REQ);\n    char worker_ipc[64] = {0};\n    sprintf(worker_ipc, \"ipc:\/\/%s-localbe.ipc\", self);\n    printf(\"worker task ipc: %s\\n\", worker_ipc);\n    worker.connect(worker_ipc);\n\n    \/\/canna_sleep(1000);\n\n    canna_send(worker, WORKER_READY);\n\n    while (true) {\n        std::string address = canna_recv(worker);\n        std::string empty = canna_recv(worker);\n        std::string reply = canna_recv(worker);\n        printf(\"WORKER: %s\\n\", reply.c_str());\n        canna_sendmore(worker, address);\n        canna_sendmore(worker, \"\");\n        canna_send(worker, reply);\n    }\n\n    return nullptr;\n}\n\nint main(int argc, char **argv)\n{\n    if (argc < 2) {\n        printf(\"usage: peering1 me {you}...\\n\");\n        return 0;\n    }\n    self = argv[1];\n    printf(\"I: preparing broker at: %s\\n\", self);\n\n    zmq::context_t context(1);\n\n    zmq::socket_t cloudfe(context, ZMQ_ROUTER);\n    cloudfe.setsockopt(ZMQ_IDENTITY, self, strlen(self));\n    char cloudfe_ipc[64] = {0};\n    sprintf(cloudfe_ipc, \"ipc:\/\/%s-cloud.ipc\", self);\n    cloudfe.bind(cloudfe_ipc);\n    \n    zmq::socket_t cloudbe(context, ZMQ_ROUTER);\n    cloudbe.setsockopt(ZMQ_IDENTITY, self, strlen(self));\n    for (int i = 2; i < argc; i++) {\n        cloud = argv[i];\n        char *peer = argv[i];\n        char peer_ipc[64] = {0};\n        sprintf(peer_ipc, \"ipc:\/\/%s-cloud.ipc\", peer_ipc);\n        printf(\"I: connecting to cloud frontend at %s \\n\", peer);\n        cloudbe.connect(peer_ipc);\n    }\n\n    zmq::socket_t localfe(context, ZMQ_ROUTER);\n    char localfe_ipc[64] = {0};\n    sprintf(localfe_ipc, \"ipc:\/\/%s-localfe.ipc\", self);\n    localfe.bind(localfe_ipc);\n\n    zmq::socket_t localbe(context, ZMQ_ROUTER);\n    char localbe_ipc[64] = {0};\n    sprintf(localbe_ipc, \"ipc:\/\/%s-localbe.ipc\", self);\n    printf(\"localbe ipc: %s\\n\", localbe_ipc);\n    localbe.bind(localbe_ipc);\n\n    printf(\"Press enter when all broker are started: \");\n    getchar();\n\n    for (int i = 0; i < WORKER_NUM; i++) {\n        pthread_t pid;\n        pthread_create(&pid, nullptr, worker_task, nullptr);\n    }\n\n    for (int i = 0; i < CLIENT_NUM; i++) {\n        pthread_t pid;\n        pthread_create(&pid, nullptr, client_task, nullptr);\n    }\n\n    int capacity = 0;\n    std::queue<std::string> worker_queue;\n    while (true) {\n        zmq::pollitem_t pollset[] = {\n            {(void *)localbe, 0, ZMQ_POLLIN, 0},\n            {(void *)cloudbe, 0, ZMQ_POLLIN, 0}\n        };\n\n        zmq::poll(pollset, 2, 0);\n\n        if (pollset[0].revents & ZMQ_POLLIN) {\n            std::string work_identity = canna_recv(localbe);\n            std::string empty = canna_recv(localbe);\n            worker_queue.push(work_identity);\n            capacity++;\n            \n            printf(\"\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\\n\");\n            std::string client_addr = canna_recv(localbe);\n            if (client_addr == WORKER_READY) {\n            } else\n            {\n                {\n                    std::string empty = canna_recv(localbe);\n                }\n                std::string reply = canna_recv(localbe);\n                printf(\"===============================:%s\\n\", reply.c_str());\n                canna_sendmore(localfe, client_addr);\n                canna_sendmore(localfe, \"\");\n                canna_send(localfe, \"SUCCESS\");\n            }\n        }\n\n        if (pollset[1].revents & ZMQ_POLLIN) {\n            std::string cloud_identity = canna_recv(cloudbe);\n            std::string empty = canna_recv(cloudbe);\n            std::string reply = canna_recv(cloudbe);\n            printf(\"***********************************************************\");\n            printf(\"CLOUD INFO: %s, %s\\n\", cloud_identity.c_str(), reply.c_str());\n            printf(\"***********************************************************\");\n        }\n\n        while (capacity) {\n            zmq::pollitem_t frontends[] = {\n                {(void *)localfe, 0, ZMQ_POLLIN, 0},\n                {(void *)cloudfe, 0, ZMQ_POLLIN, 0}\n            };\n            zmq::poll(frontends, 2, 0);\n            int reroutable = 0;\n            std::string msg;\n            \/*\n            if (frontends[1].revents & ZMQ_POLLIN) {\n                msg = canna_recv(cloudfe);\n                reroutable = 0;\n            } else \n            *\/\n            if (frontends[0].revents & ZMQ_POLLIN) {\n                std::string identity = canna_recv(localfe);\n                std::string empty = canna_recv(localfe);\n                std::string reply = canna_recv(localfe);\n                printf(\"RECV msg: %s from client, capacity: %d\\n\", reply.c_str(), capacity);\n                reroutable = 1;\n            \n                \/\/if (CANNA_RAND(5) == 0) {\n                    canna_sendmore(cloudbe, cloud);\n                    canna_sendmore(cloudbe, \"\");\n                    canna_sendmore(cloudbe, \"CLOUD\");\n                \/\/} else {\n                    std::string worker_addr = worker_queue.front();\n                    worker_queue.pop();\n                    canna_sendmore(localbe, worker_addr);\n                    canna_sendmore(localbe, \"\");\n                    canna_sendmore(localbe, identity);\n                    canna_sendmore(localbe, \"\");\n                    canna_send(localbe, \"WORLD\");\n                    reroutable--;\n                    capacity--;\n                \/\/}\n            } else {\n                break;\n            }\n\n            \/*\n            if (reroutable) {\n                canna_sendmore(localbe, identity);\n                canna_sendmore(localbe, \"\");\n                canna_send(localbe, \"WORLD\");\n                reroutable--;\n                capacity--;\n            }\n            *\/\n        }\n    }\n\n    return 0;\n}\n<commit_msg>cloud<commit_after>#include <pthread.h>\n#include <stdio.h>\n#include <string>\n#include <vector>\n#include <queue>\n#include \"zmq.hpp\"\n#include \"canna_core.h\"\n\n#define CLIENT_NUM 5\n#define WORKER_NUM 3\n#define WORKER_READY \"READY\"\n\nstatic char *self;\nstatic char *cloud;\n\nstatic void * client_task(void *args)\n{\n    printf(\"client thread start\\n\");\n    zmq::context_t context(1);\n    zmq::socket_t client(context, ZMQ_REQ);\n    char client_ipc[64] = {0};\n    sprintf(client_ipc, \"ipc:\/\/%s-localfe.ipc\", self);\n    client.connect(client_ipc);\n\n    while (true) {\n        canna_send(client, \"HELLO\");\n        std::string reply = canna_recv(client);\n        printf(\"CLIENT: %s\\n\", reply.c_str());\n        \/\/canna_sleep(1000);\n    }\n\n    return nullptr;\n}\n\nstatic void * worker_task(void *args)\n{\n    printf(\"worker thread start\\n\");\n    zmq::context_t context(1);\n    zmq::socket_t worker(context, ZMQ_REQ);\n    char worker_ipc[64] = {0};\n    sprintf(worker_ipc, \"ipc:\/\/%s-localbe.ipc\", self);\n    printf(\"worker task ipc: %s\\n\", worker_ipc);\n    worker.connect(worker_ipc);\n\n    \/\/canna_sleep(1000);\n\n    canna_send(worker, WORKER_READY);\n\n    while (true) {\n        std::string address = canna_recv(worker);\n        std::string empty = canna_recv(worker);\n        std::string reply = canna_recv(worker);\n        printf(\"WORKER: %s\\n\", reply.c_str());\n        canna_sendmore(worker, address);\n        canna_sendmore(worker, \"\");\n        canna_send(worker, reply);\n    }\n\n    return nullptr;\n}\n\nint main(int argc, char **argv)\n{\n    if (argc < 2) {\n        printf(\"usage: peering1 me {you}...\\n\");\n        return 0;\n    }\n    self = argv[1];\n    printf(\"I: preparing broker at: %s\\n\", self);\n\n    zmq::context_t context(1);\n\n    zmq::socket_t cloudfe(context, ZMQ_ROUTER);\n    cloudfe.setsockopt(ZMQ_IDENTITY, self, strlen(self));\n    char cloudfe_ipc[64] = {0};\n    sprintf(cloudfe_ipc, \"ipc:\/\/%s-cloud.ipc\", self);\n    cloudfe.bind(cloudfe_ipc);\n    \n    zmq::socket_t cloudbe(context, ZMQ_ROUTER);\n    cloudbe.setsockopt(ZMQ_IDENTITY, self, strlen(self));\n    for (int i = 2; i < argc; i++) {\n        cloud = argv[i];\n        char *peer = argv[i];\n        char peer_ipc[64] = {0};\n        sprintf(peer_ipc, \"ipc:\/\/%s-cloud.ipc\", peer_ipc);\n        printf(\"I: connecting to cloud frontend at %s \\n\", peer);\n        cloudbe.connect(peer_ipc);\n    }\n\n    zmq::socket_t localfe(context, ZMQ_ROUTER);\n    char localfe_ipc[64] = {0};\n    sprintf(localfe_ipc, \"ipc:\/\/%s-localfe.ipc\", self);\n    localfe.bind(localfe_ipc);\n\n    zmq::socket_t localbe(context, ZMQ_ROUTER);\n    char localbe_ipc[64] = {0};\n    sprintf(localbe_ipc, \"ipc:\/\/%s-localbe.ipc\", self);\n    printf(\"localbe ipc: %s\\n\", localbe_ipc);\n    localbe.bind(localbe_ipc);\n\n    printf(\"Press enter when all broker are started: \");\n    getchar();\n\n    for (int i = 0; i < WORKER_NUM; i++) {\n        pthread_t pid;\n        pthread_create(&pid, nullptr, worker_task, nullptr);\n    }\n\n    for (int i = 0; i < CLIENT_NUM; i++) {\n        pthread_t pid;\n        pthread_create(&pid, nullptr, client_task, nullptr);\n    }\n\n    int capacity = 0;\n    std::queue<std::string> worker_queue;\n    while (true) {\n        zmq::pollitem_t pollset[] = {\n            {(void *)localbe, 0, ZMQ_POLLIN, 0},\n            {(void *)cloudbe, 0, ZMQ_POLLIN, 0}\n        };\n\n        zmq::poll(pollset, 2, 0);\n\n        if (pollset[0].revents & ZMQ_POLLIN) {\n            std::string work_identity = canna_recv(localbe);\n            std::string empty = canna_recv(localbe);\n            worker_queue.push(work_identity);\n            capacity++;\n            \n            printf(\"\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\\n\");\n            std::string client_addr = canna_recv(localbe);\n            if (client_addr == WORKER_READY) {\n            } else\n            {\n                {\n                    std::string empty = canna_recv(localbe);\n                }\n                std::string reply = canna_recv(localbe);\n                printf(\"===============================:%s\\n\", reply.c_str());\n                canna_sendmore(localfe, client_addr);\n                canna_sendmore(localfe, \"\");\n                canna_send(localfe, \"SUCCESS\");\n            }\n        }\n\n        if (pollset[1].revents & ZMQ_POLLIN) {\n            printf(\"***********************************************************\");\n            std::string cloud_identity = canna_recv(cloudbe);\n            std::string empty = canna_recv(cloudbe);\n            std::string reply = canna_recv(cloudbe);\n            printf(\"***********************************************************\");\n            printf(\"CLOUD INFO: %s, %s\\n\", cloud_identity.c_str(), reply.c_str());\n            printf(\"***********************************************************\");\n        }\n\n        while (capacity) {\n            zmq::pollitem_t frontends[] = {\n                {(void *)localfe, 0, ZMQ_POLLIN, 0},\n                {(void *)cloudfe, 0, ZMQ_POLLIN, 0}\n            };\n            zmq::poll(frontends, 2, 0);\n            int reroutable = 0;\n            std::string msg;\n            if (frontends[1].revents & ZMQ_POLLIN) {\n                printf(\"***********************************************************\");\n                std::string cloud_identity = canna_recv(cloudfe);\n                std::string empty = canna_recv(cloudfe);\n                std::string reply = canna_recv(cloudfe);\n                printf(\"***********************************************************\");\n                printf(\"CLOUD INFO: %s, %s\\n\", cloud_identity.c_str(), reply.c_str());\n                printf(\"***********************************************************\");\n            }\n            if (frontends[0].revents & ZMQ_POLLIN) {\n                std::string identity = canna_recv(localfe);\n                std::string empty = canna_recv(localfe);\n                std::string reply = canna_recv(localfe);\n                printf(\"RECV msg: %s from client, capacity: %d\\n\", reply.c_str(), capacity);\n                reroutable = 1;\n            \n                \/\/if (CANNA_RAND(5) == 0) {\n                    canna_sendmore(cloudbe, cloud);\n                    canna_sendmore(cloudbe, \"\");\n                    canna_send(cloudbe, \"CLOUD\");\n                \/\/} else {\n                    std::string worker_addr = worker_queue.front();\n                    worker_queue.pop();\n                    canna_sendmore(localbe, worker_addr);\n                    canna_sendmore(localbe, \"\");\n                    canna_sendmore(localbe, identity);\n                    canna_sendmore(localbe, \"\");\n                    canna_send(localbe, \"WORLD\");\n                    reroutable--;\n                    capacity--;\n                \/\/}\n            } else {\n                break;\n            }\n\n            \/*\n            if (reroutable) {\n                canna_sendmore(localbe, identity);\n                canna_sendmore(localbe, \"\");\n                canna_send(localbe, \"WORLD\");\n                reroutable--;\n                capacity--;\n            }\n            *\/\n        }\n    }\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/***********************************************************************************************************************\n*                                                                                                                      *\n* SPLASH build system v0.2                                                                                             *\n*                                                                                                                      *\n* Copyright (c) 2016 Andrew D. Zonenberg                                                                               *\n* All rights reserved.                                                                                                 *\n*                                                                                                                      *\n* Redistribution and use in source and binary forms, with or without modification, are permitted provided that the     *\n* following conditions are met:                                                                                        *\n*                                                                                                                      *\n*    * Redistributions of source code must retain the above copyright notice, this list of conditions, and the         *\n*      following disclaimer.                                                                                           *\n*                                                                                                                      *\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*                                                                                                                      *\n*    * Neither the name of the author nor the names of any 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 AUTHORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED   *\n* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL *\n* THE AUTHORS BE HELD LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES        *\n* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR       *\n* BUSINESS INTERRUPTION) HOWEVER CAUSED AND 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 SOFTWARE, EVEN IF ADVISED OF THE       *\n* POSSIBILITY OF SUCH DAMAGE.                                                                                          *\n*                                                                                                                      *\n***********************************************************************************************************************\/\n\n#include \"splashcore.h\"\n\nusing namespace std;\n\nScheduler* g_scheduler = NULL;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Construction \/ destruction\n\nScheduler::Scheduler()\n{\n\tm_tStart = GetTime();\n\tm_running = false;\n}\n\nScheduler::~Scheduler()\n{\n\t\/\/LogDebug(\"destroying scheduler\\n\");\n\n\tfor(auto it : m_pendingScanJobs)\n\t{\n\t\tfor(auto job : it.second)\n\t\t\tjob->Unref();\n\t\tit.second.clear();\n\t}\n\n\tfor(auto it : m_runnableJobs)\n\t{\n\t\tfor(auto job : it.second)\n\t\t\tjob->Unref();\n\t\tit.second.clear();\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ General scheduling\n\n\/**\n\t@brief TODO: Cancel pending jobs for that node\n *\/\nvoid Scheduler::RemoveNode(clientID \/*id*\/)\n{\n\tLogWarning(\"Scheduler::RemoveNode() not implemented\\n\");\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Dependency scanning\n\n\/**\n\t@brief Get the next available scan job for a given node, if there is one available.\n\n\t@return A scan job, or NULL if none are available.\n *\/\nDependencyScanJob* Scheduler::PopScanJob(clientID id)\n{\n\tlock_guard<recursive_mutex> lock(m_mutex);\n\tif(m_pendingScanJobs[id].empty())\n\t\treturn NULL;\n\n\t\/\/TODO: Check if the job is runnable and wait if it's not\n\n\tauto ret = *m_pendingScanJobs[id].begin();\n\tm_pendingScanJobs[id].pop_front();\n\n\tret->Ref();\n\treturn ret;\n}\n\n\/**\n\t@brief Get the next available job for a given node, if there is one available.\n\n\t@return A job, or NULL if none are available.\n *\/\nJob* Scheduler::PopJob(clientID id)\n{\n\tlock_guard<recursive_mutex> lock(m_mutex);\n\n\t\/\/Attempt to pop the job queue from each priority, from max to min priority\n\tfor(int i=0; i<Job::PRIO_COUNT; i++)\n\t{\n\t\tJob* job = PopJob(id, static_cast<Job::Priority>(i));\n\t\tif(job)\n\t\t\treturn job;\n\t}\n\n\treturn NULL;\n}\n\n\/**\n\t@brief Get the next available job for a given node and priority, if there is one available.\n\n\t@return A job, or NULL if none are available.\n *\/\nJob* Scheduler::PopJob(clientID id, Job::Priority prio)\n{\n\tlock_guard<recursive_mutex> lock(m_mutex);\n\n\t\/\/Look up the toolchains for this node\n\tset<string> toolchains;\n\tg_nodeManager->ListToolchainsForClient(toolchains, id);\n\n\t\/\/Go over the list from oldest to newest\n\tjobqueue& jobs = m_runnableJobs[prio];\n\tfor(auto it = jobs.begin(); it != jobs.end(); it++)\n\t{\n\t\tauto job = *it;\n\n\t\t\/\/See if we have the toolchain this job needs\n\t\tif(toolchains.find(job->GetToolchain()) == toolchains.end())\n\t\t{\n\t\t\t\/\/LogDebug(\"PopJob rejecting job %p b\/c toolchain %s not offered by client %s\\n\",\n\t\t\t\/\/\tjob, job->GetToolchain().c_str(), id.c_str());\n\t\t\tcontinue;\n\t\t}\n\n\t\t\/\/If we can't run the job b\/c of dependencies, keep looking\n\t\tif(!job->IsRunnable())\n\t\t{\n\t\t\t\/\/LogDebug(\"PopJob rejecting job %p (%s) b\/c not runnable\\n\",\n\t\t\t\/\/\tjob, dynamic_cast<BuildJob*>(job)->GetOutputNode()->GetFilePath().c_str());\n\t\t\tcontinue;\n\t\t}\n\n\t\t\/\/TODO: If the job was canceled, delete it from the queue and cancel everything\n\n\t\t\/\/We're good, use this job\n\t\tjobs.erase(it);\n\t\treturn job;\n\t}\n\n\treturn NULL;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Dependency scanning\n\n\/**\n\t@brief Schedules a dependency-scan job and returns immediately after submitting it.\n\n\t@return\t\tThe newly scheduled job\n *\/\nDependencyScanJob* Scheduler::ScanDependenciesNonblocking(\n\tstring fname,\n\tstring arch,\n\tstring toolchain,\n\tset<BuildFlag> flags,\n\tWorkingCopy* wc)\n{\n\t\/\/If this is our first job, reset the timer for clean profiling\n\tif(!m_running)\n\t{\n\t\tm_tStart = GetTime();\n\t\tm_running = true;\n\t}\n\n\tLogDebug(\"[%7.3f] Scheduler::ScanDependencies (for source file %s, arch %s, toolchain %s)\\n\",\n\t\tGetDT(), fname.c_str(), arch.c_str(), toolchain.c_str() );\n\tLogIndenter li;\n\n\t\/\/Need mutex locked during scheduling so that if the golden node leaves halfway through\n\t\/\/we remain in a consistent state\n\tlock_guard<NodeManager> lock(*g_nodeManager);\n\n\t\/\/Look up the hash for the job\n\tauto hash = g_nodeManager->GetToolchainHash(arch, toolchain);\n\tif(hash == \"\")\n\t\treturn NULL;\n\tauto chain = g_nodeManager->GetAnyToolchainForHash(hash);\n\tif(chain == NULL)\n\t\treturn NULL;\n\t\/\/LogDebug(\"Compiler hash is %s (%s)\\n\", hash.c_str(), chain->GetVersionString().c_str());\n\n\t\/\/Find which node is supposed to run this job\n\tauto id = g_nodeManager->GetGoldenNodeForToolchain(hash);\n\tif(id.empty())\n\t\treturn NULL;\n\tauto build_wc = g_nodeManager->GetWorkingCopy(id);\n\tstring hostname = build_wc->GetHostname();\n\t\/\/LogDebug(\"Golden node for this toolchain is %s (%s)\\n\", id.c_str(), hostname.c_str());\n\n\t\/\/Create the scan job and submit it\n\tDependencyScanJob* job = new DependencyScanJob(fname, wc, hash, arch, flags);\n\tSubmitScanJob(id, job);\n\treturn job;\n}\n\n\/**\n\t@brief Waits for a scan job to complete, then crunches the results\n *\/\nbool Scheduler::BlockOnScanResults(\n\tDependencyScanJob* job,\n\tWorkingCopy* wc,\n\tset<string>& deps,\n\tset<BuildFlag>& foundflags,\n\tstring& errors)\n{\n\t\/\/Block until the job is done\n\t\/\/TODO: make this more efficient\n\tJob::Status status = Job::STATUS_PENDING;\n\twhile(status != Job::STATUS_DONE)\n\t{\n\t\t\/\/If the job was canceled, our scan isn't going to happen so die\n\t\tstatus = job->GetStatus();\n\t\tif(status == Job::STATUS_CANCELED)\n\t\t{\n\t\t\terrors = job->GetErrors();\n\n\t\t\tLogError(\"Dependency scan canceled: %s\\n\",\n\t\t\t\tjob->GetErrors().c_str());\n\t\t\tjob->Unref();\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/Block for 2 ms (most jobs take way longer than this, the impact of waiting is miniscule)\n\t\t\/\/TODO: have some kind of true block vs busy-polling\n\t\tusleep(2 * 1000);\n\t}\n\t\/\/LogDebug(\"[%7.3f] Scan done\\n\", GetDT());\n\n\t\/\/If we're done, but with errors, fail\n\tif(!job->IsSuccessful())\n\t{\n\t\terrors = job->GetErrors();\n\t\tjob->Unref();\n\t\treturn false;\n\t}\n\n\t\/\/Add dependencies to the working copy as needed\n\t\/\/Don't worry about changing anything with newly added files\n\tauto output = job->GetOutput();\n\tset<string> ignored;\n\tfor(auto it : output)\n\t\twc->UpdateFile(it.first, it.second, false, false, ignored);\n\n\t\/\/Return the list of dependencies\n\tfor(auto it : output)\n\t\tdeps.emplace(it.first);\n\n\t\/\/Save the set of flags\n\tauto ffg = job->GetFoundFlags();\n\tfor(auto flag : ffg)\n\t\tfoundflags.emplace(flag);\n\n\t\/\/Clean up so we don't leak memory\n\tjob->Unref();\n\n\t\/\/LogDebug(\"[%7.3f] Post-processing done\\n\", GetDT());\n\n\t\/\/Done\n\treturn true;\n}\n\n\/**\n\t@brief Submit a dependency scan job for a particular node\n *\/\nvoid Scheduler::SubmitScanJob(clientID id, DependencyScanJob* job)\n{\n\tlock_guard<recursive_mutex> lock(m_mutex);\n\tm_pendingScanJobs[id].push_back(job);\n}\n\n\/**\n\t@brief Submit a job for a general build step\n *\/\nvoid Scheduler::SubmitJob(Job* job)\n{\n\tlock_guard<recursive_mutex> lock(m_mutex);\n\tjob->Ref();\n\n\tLogDebug(\"[%6.3f] Submit job %p (%s)\\n\",\n\t\tGetDT(), job, dynamic_cast<BuildJob*>(job)->GetOutputNode()->GetFilePath().c_str());\n\n\tm_runnableJobs[job->GetPriority()].push_back(job);\n}\n<commit_msg>splashcore: Better reporting of internal errors where we submit malformed jobs<commit_after>\/***********************************************************************************************************************\n*                                                                                                                      *\n* SPLASH build system v0.2                                                                                             *\n*                                                                                                                      *\n* Copyright (c) 2016 Andrew D. Zonenberg                                                                               *\n* All rights reserved.                                                                                                 *\n*                                                                                                                      *\n* Redistribution and use in source and binary forms, with or without modification, are permitted provided that the     *\n* following conditions are met:                                                                                        *\n*                                                                                                                      *\n*    * Redistributions of source code must retain the above copyright notice, this list of conditions, and the         *\n*      following disclaimer.                                                                                           *\n*                                                                                                                      *\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*                                                                                                                      *\n*    * Neither the name of the author nor the names of any 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 AUTHORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED   *\n* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL *\n* THE AUTHORS BE HELD LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES        *\n* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR       *\n* BUSINESS INTERRUPTION) HOWEVER CAUSED AND 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 SOFTWARE, EVEN IF ADVISED OF THE       *\n* POSSIBILITY OF SUCH DAMAGE.                                                                                          *\n*                                                                                                                      *\n***********************************************************************************************************************\/\n\n#include \"splashcore.h\"\n\nusing namespace std;\n\nScheduler* g_scheduler = NULL;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Construction \/ destruction\n\nScheduler::Scheduler()\n{\n\tm_tStart = GetTime();\n\tm_running = false;\n}\n\nScheduler::~Scheduler()\n{\n\t\/\/LogDebug(\"destroying scheduler\\n\");\n\n\tfor(auto it : m_pendingScanJobs)\n\t{\n\t\tfor(auto job : it.second)\n\t\t\tjob->Unref();\n\t\tit.second.clear();\n\t}\n\n\tfor(auto it : m_runnableJobs)\n\t{\n\t\tfor(auto job : it.second)\n\t\t\tjob->Unref();\n\t\tit.second.clear();\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ General scheduling\n\n\/**\n\t@brief TODO: Cancel pending jobs for that node\n *\/\nvoid Scheduler::RemoveNode(clientID \/*id*\/)\n{\n\tLogWarning(\"Scheduler::RemoveNode() not implemented\\n\");\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Dependency scanning\n\n\/**\n\t@brief Get the next available scan job for a given node, if there is one available.\n\n\t@return A scan job, or NULL if none are available.\n *\/\nDependencyScanJob* Scheduler::PopScanJob(clientID id)\n{\n\tlock_guard<recursive_mutex> lock(m_mutex);\n\tif(m_pendingScanJobs[id].empty())\n\t\treturn NULL;\n\n\t\/\/TODO: Check if the job is runnable and wait if it's not\n\n\tauto ret = *m_pendingScanJobs[id].begin();\n\tm_pendingScanJobs[id].pop_front();\n\n\tret->Ref();\n\treturn ret;\n}\n\n\/**\n\t@brief Get the next available job for a given node, if there is one available.\n\n\t@return A job, or NULL if none are available.\n *\/\nJob* Scheduler::PopJob(clientID id)\n{\n\tlock_guard<recursive_mutex> lock(m_mutex);\n\n\t\/\/Attempt to pop the job queue from each priority, from max to min priority\n\tfor(int i=0; i<Job::PRIO_COUNT; i++)\n\t{\n\t\tJob* job = PopJob(id, static_cast<Job::Priority>(i));\n\t\tif(job)\n\t\t\treturn job;\n\t}\n\n\treturn NULL;\n}\n\n\/**\n\t@brief Get the next available job for a given node and priority, if there is one available.\n\n\t@return A job, or NULL if none are available.\n *\/\nJob* Scheduler::PopJob(clientID id, Job::Priority prio)\n{\n\tlock_guard<recursive_mutex> lock(m_mutex);\n\n\t\/\/Look up the toolchains for this node\n\tset<string> toolchains;\n\tg_nodeManager->ListToolchainsForClient(toolchains, id);\n\n\t\/\/Go over the list from oldest to newest\n\tjobqueue& jobs = m_runnableJobs[prio];\n\tfor(auto it = jobs.begin(); it != jobs.end(); it++)\n\t{\n\t\tauto job = *it;\n\n\t\t\/\/See if we have the toolchain this job needs\n\t\tif(toolchains.find(job->GetToolchain()) == toolchains.end())\n\t\t{\n\t\t\tLogDebug(\"PopJob rejecting job %p b\/c toolchain %s not offered by client %s\\n\",\n\t\t\t\tjob, job->GetToolchain().c_str(), id.c_str());\n\t\t\tcontinue;\n\t\t}\n\n\t\t\/\/If the job was canceled, delete it from the queue rather than wasting time spinning\n\t\tif(job->IsCanceledByDeps())\n\t\t{\n\t\t\tjobs.erase(it);\n\t\t\tjob->Unref();\n\t\t\tcontinue;\n\t\t}\n\n\t\t\/\/If we can't run the job b\/c of dependencies, keep looking\n\t\tif(!job->IsRunnable())\n\t\t{\n\t\t\tLogDebug(\"PopJob rejecting job %p (%s) b\/c not runnable\\n\",\n\t\t\t\tjob, dynamic_cast<BuildJob*>(job)->GetOutputNode()->GetFilePath().c_str());\n\t\t\tcontinue;\n\t\t}\n\n\t\t\/\/We're good, use this job\n\t\tjobs.erase(it);\n\t\treturn job;\n\t}\n\n\treturn NULL;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Dependency scanning\n\n\/**\n\t@brief Schedules a dependency-scan job and returns immediately after submitting it.\n\n\t@return\t\tThe newly scheduled job\n *\/\nDependencyScanJob* Scheduler::ScanDependenciesNonblocking(\n\tstring fname,\n\tstring arch,\n\tstring toolchain,\n\tset<BuildFlag> flags,\n\tWorkingCopy* wc)\n{\n\t\/\/If this is our first job, reset the timer for clean profiling\n\tif(!m_running)\n\t{\n\t\tm_tStart = GetTime();\n\t\tm_running = true;\n\t}\n\n\tLogDebug(\"[%7.3f] Scheduler::ScanDependencies (for source file %s, arch %s, toolchain %s)\\n\",\n\t\tGetDT(), fname.c_str(), arch.c_str(), toolchain.c_str() );\n\tLogIndenter li;\n\n\t\/\/Need mutex locked during scheduling so that if the golden node leaves halfway through\n\t\/\/we remain in a consistent state\n\tlock_guard<NodeManager> lock(*g_nodeManager);\n\n\t\/\/Look up the hash for the job\n\tauto hash = g_nodeManager->GetToolchainHash(arch, toolchain);\n\tif(hash == \"\")\n\t\treturn NULL;\n\tauto chain = g_nodeManager->GetAnyToolchainForHash(hash);\n\tif(chain == NULL)\n\t\treturn NULL;\n\t\/\/LogDebug(\"Compiler hash is %s (%s)\\n\", hash.c_str(), chain->GetVersionString().c_str());\n\n\t\/\/Find which node is supposed to run this job\n\tauto id = g_nodeManager->GetGoldenNodeForToolchain(hash);\n\tif(id.empty())\n\t\treturn NULL;\n\tauto build_wc = g_nodeManager->GetWorkingCopy(id);\n\tstring hostname = build_wc->GetHostname();\n\t\/\/LogDebug(\"Golden node for this toolchain is %s (%s)\\n\", id.c_str(), hostname.c_str());\n\n\t\/\/Create the scan job and submit it\n\tDependencyScanJob* job = new DependencyScanJob(fname, wc, hash, arch, flags);\n\tSubmitScanJob(id, job);\n\treturn job;\n}\n\n\/**\n\t@brief Waits for a scan job to complete, then crunches the results\n *\/\nbool Scheduler::BlockOnScanResults(\n\tDependencyScanJob* job,\n\tWorkingCopy* wc,\n\tset<string>& deps,\n\tset<BuildFlag>& foundflags,\n\tstring& errors)\n{\n\t\/\/Block until the job is done\n\t\/\/TODO: make this more efficient\n\tJob::Status status = Job::STATUS_PENDING;\n\twhile(status != Job::STATUS_DONE)\n\t{\n\t\t\/\/If the job was canceled, our scan isn't going to happen so die\n\t\tstatus = job->GetStatus();\n\t\tif(status == Job::STATUS_CANCELED)\n\t\t{\n\t\t\terrors = job->GetErrors();\n\n\t\t\tLogError(\"Dependency scan canceled: %s\\n\",\n\t\t\t\tjob->GetErrors().c_str());\n\t\t\tjob->Unref();\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/Block for 2 ms (most jobs take way longer than this, the impact of waiting is miniscule)\n\t\t\/\/TODO: have some kind of true block vs busy-polling\n\t\tusleep(2 * 1000);\n\t}\n\t\/\/LogDebug(\"[%7.3f] Scan done\\n\", GetDT());\n\n\t\/\/If we're done, but with errors, fail\n\tif(!job->IsSuccessful())\n\t{\n\t\terrors = job->GetErrors();\n\t\tjob->Unref();\n\t\treturn false;\n\t}\n\n\t\/\/Add dependencies to the working copy as needed\n\t\/\/Don't worry about changing anything with newly added files\n\tauto output = job->GetOutput();\n\tset<string> ignored;\n\tfor(auto it : output)\n\t\twc->UpdateFile(it.first, it.second, false, false, ignored);\n\n\t\/\/Return the list of dependencies\n\tfor(auto it : output)\n\t\tdeps.emplace(it.first);\n\n\t\/\/Save the set of flags\n\tauto ffg = job->GetFoundFlags();\n\tfor(auto flag : ffg)\n\t\tfoundflags.emplace(flag);\n\n\t\/\/Clean up so we don't leak memory\n\tjob->Unref();\n\n\t\/\/LogDebug(\"[%7.3f] Post-processing done\\n\", GetDT());\n\n\t\/\/Done\n\treturn true;\n}\n\n\/**\n\t@brief Submit a dependency scan job for a particular node\n *\/\nvoid Scheduler::SubmitScanJob(clientID id, DependencyScanJob* job)\n{\n\tlock_guard<recursive_mutex> lock(m_mutex);\n\tm_pendingScanJobs[id].push_back(job);\n}\n\n\/**\n\t@brief Submit a job for a general build step\n *\/\nvoid Scheduler::SubmitJob(Job* job)\n{\n\tlock_guard<recursive_mutex> lock(m_mutex);\n\n\tif(job == NULL)\n\t\tLogFatal(\"Submitted null job\\n\");\n\t\n\tjob->Ref();\n\n\tLogDebug(\"[%6.3f] Submit job %p (%s)\\n\",\n\t\tGetDT(), job, dynamic_cast<BuildJob*>(job)->GetOutputNode()->GetFilePath().c_str());\n\n\tif(job->GetToolchain() == \"\")\n\t\tLogFatal(\"Submitted job with bad toolchain\\n\");\n\n\tm_runnableJobs[job->GetPriority()].push_back(job);\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#include \"libmesh\/dg_fem_context.h\"\n#include \"libmesh\/dof_map.h\"\n#include \"libmesh\/elem.h\"\n#include \"libmesh\/fe_base.h\"\n#include \"libmesh\/fe_interface.h\"\n#include \"libmesh\/quadrature.h\"\n#include \"libmesh\/system.h\"\n\nnamespace libMesh\n{\n\nDGFEMContext::DGFEMContext (const System &sys)\n  : FEMContext(sys),\n    _neighbor(NULL),\n    _dg_terms_active(false)\n{\n  unsigned int nv = sys.n_vars();\n  libmesh_assert (nv);\n\n  _neighbor_subresiduals.reserve(nv);\n  _elem_elem_subjacobians.resize(nv);\n  _elem_neighbor_subjacobians.resize(nv);\n  _neighbor_elem_subjacobians.resize(nv);\n  _neighbor_neighbor_subjacobians.resize(nv);\n\n  for (unsigned int i=0; i != nv; ++i)\n  {\n    _neighbor_subresiduals.push_back(new DenseSubVector<Number>(_neighbor_residual));\n    _elem_elem_subjacobians[i].reserve(nv);\n    _elem_neighbor_subjacobians[i].reserve(nv);\n    _neighbor_elem_subjacobians[i].reserve(nv);\n    _neighbor_neighbor_subjacobians[i].reserve(nv);\n\n    for (unsigned int j=0; j != nv; ++j)\n    {\n      _elem_elem_subjacobians[i].push_back\n        (new DenseSubMatrix<Number>(_elem_elem_jacobian));\n      _elem_neighbor_subjacobians[i].push_back\n        (new DenseSubMatrix<Number>(_elem_neighbor_jacobian));\n      _neighbor_elem_subjacobians[i].push_back\n        (new DenseSubMatrix<Number>(_neighbor_elem_jacobian));\n      _neighbor_neighbor_subjacobians[i].push_back\n        (new DenseSubMatrix<Number>(_neighbor_neighbor_jacobian));\n    }\n  }\n\n  _neighbor_side_fe_var.resize(nv);\n  for (unsigned int i=0; i != nv; ++i)\n  {\n    FEType fe_type = sys.variable_type(i);\n\n    if ( _neighbor_side_fe[fe_type] == NULL )\n    {\n      _neighbor_side_fe[fe_type] = FEAbstract::build(dim, fe_type).release();\n    }\n    _neighbor_side_fe_var[i] = _neighbor_side_fe[fe_type];\n  }\n}\n\nDGFEMContext::~DGFEMContext()\n{\n\n  for (std::size_t i=0; i != _neighbor_subresiduals.size(); ++i)\n  {\n    delete _neighbor_subresiduals[i];\n\n    for (std::size_t j=0; j != _elem_elem_subjacobians[i].size(); ++j)\n    {\n      delete _elem_elem_subjacobians[i][j];\n      delete _elem_neighbor_subjacobians[i][j];\n      delete _neighbor_elem_subjacobians[i][j];\n      delete _neighbor_neighbor_subjacobians[i][j];\n    }\n  }\n\n  \/\/ Delete the FE objects\n  for (std::map<FEType, FEAbstract *>::iterator i = _neighbor_side_fe.begin();\n       i != _neighbor_side_fe.end(); ++i)\n    delete i->second;\n  _neighbor_side_fe.clear();\n}\n\nvoid DGFEMContext::side_fe_reinit()\n{\n  FEMContext::side_fe_reinit();\n\n  \/\/ By default we assume that the DG terms are inactive\n  \/\/ They are only active if neighbor_side_fe_reinit is called\n  _dg_terms_active = false;\n}\n\nvoid DGFEMContext::neighbor_side_fe_reinit ()\n{\n  \/\/ Call this *after* side_fe_reinit\n\n  \/\/ Initialize all the neighbor side FE objects based on inverse mapping\n  \/\/ the quadrature points on the current side\n  std::vector<Point> qface_side_points;\n  std::vector<Point> qface_neighbor_points;\n  std::map<FEType, FEAbstract *>::iterator local_fe_end = _neighbor_side_fe.end();\n  for (std::map<FEType, FEAbstract *>::iterator i = _neighbor_side_fe.begin();\n       i != local_fe_end; ++i)\n    {\n      FEType neighbor_side_fe_type = i->first;\n      FEAbstract* side_fe = _side_fe[neighbor_side_fe_type];\n      qface_side_points = side_fe->get_xyz();\n      \n      FEInterface::inverse_map (dim,\n                                neighbor_side_fe_type,\n                                &get_neighbor(),\n                                qface_side_points,\n                                qface_neighbor_points);\n\n      i->second->reinit(&get_neighbor(), &qface_neighbor_points);\n    }\n  \n  \/\/ Set boolean flag to indicate that the DG terms are active on this element\n  _dg_terms_active = true;\n\n  \/\/ Also, initialize data required for DG assembly on the current side,\n  \/\/ analogously to FEMContext::pre_fe_reinit\n\n  \/\/ Initialize the per-element data for elem.\n  get_system().get_dof_map().dof_indices (&get_neighbor(), _neighbor_dof_indices);\n  \n  const unsigned int n_dofs = dof_indices.size();\n  const unsigned int n_neighbor_dofs = libmesh_cast_int<unsigned int>\n    (_neighbor_dof_indices.size());\n\n  \/\/ These resize calls also zero out the residual and jacobian\n  _neighbor_residual.resize(n_neighbor_dofs);\n  _elem_neighbor_jacobian.resize(n_dofs, n_neighbor_dofs);\n  _neighbor_elem_jacobian.resize(n_neighbor_dofs, n_dofs);\n  _neighbor_neighbor_jacobian.resize(n_neighbor_dofs, n_neighbor_dofs);\n  \n  \/\/ Initialize the per-variable data for elem.\n  {\n    unsigned int sub_dofs = 0;\n    for (unsigned int i=0; i != get_system().n_vars(); ++i)\n      {\n        get_system().get_dof_map().dof_indices (&get_neighbor(), _neighbor_dof_indices_var[i], i);\n\n        const unsigned int n_dofs_var = libmesh_cast_int<unsigned int>\n          (_neighbor_dof_indices_var[i].size());\n\n        _neighbor_subresiduals[i]->reposition\n          (sub_dofs, n_dofs_var);\n\n        for (unsigned int j=0; j != i; ++j)\n          {\n            const unsigned int n_dofs_var_j =\n\t      libmesh_cast_int<unsigned int>\n                (dof_indices_var[j].size());\n\n            _elem_neighbor_subjacobians[i][j]->reposition\n              (sub_dofs, _neighbor_subresiduals[j]->i_off(),\n               n_dofs_var, n_dofs_var_j);\n            _elem_neighbor_subjacobians[j][i]->reposition\n              (_neighbor_subresiduals[j]->i_off(), sub_dofs,\n               n_dofs_var_j, n_dofs_var);\n\n            _neighbor_elem_subjacobians[i][j]->reposition\n              (sub_dofs, _neighbor_subresiduals[j]->i_off(),\n               n_dofs_var, n_dofs_var_j);\n            _neighbor_elem_subjacobians[j][i]->reposition\n              (_neighbor_subresiduals[j]->i_off(), sub_dofs,\n               n_dofs_var_j, n_dofs_var);\n\n            _neighbor_neighbor_subjacobians[i][j]->reposition\n              (sub_dofs, _neighbor_subresiduals[j]->i_off(),\n               n_dofs_var, n_dofs_var_j);\n            _neighbor_neighbor_subjacobians[j][i]->reposition\n              (_neighbor_subresiduals[j]->i_off(), sub_dofs,\n               n_dofs_var_j, n_dofs_var);\n          }\n        _elem_neighbor_subjacobians[i][i]->reposition\n          (sub_dofs, sub_dofs,\n           n_dofs_var,\n           n_dofs_var);\n        _neighbor_elem_subjacobians[i][i]->reposition\n          (sub_dofs, sub_dofs,\n           n_dofs_var,\n           n_dofs_var);\n        _neighbor_neighbor_subjacobians[i][i]->reposition\n          (sub_dofs, sub_dofs,\n           n_dofs_var,\n           n_dofs_var);\n        sub_dofs += n_dofs_var;\n      }\n    libmesh_assert_equal_to (sub_dofs, n_dofs);\n  }\n\n}\n\n}\n\n<commit_msg>Added libmesh_experimental() in the DGFEMContext constructor.<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#include \"libmesh\/dg_fem_context.h\"\n#include \"libmesh\/dof_map.h\"\n#include \"libmesh\/elem.h\"\n#include \"libmesh\/fe_base.h\"\n#include \"libmesh\/fe_interface.h\"\n#include \"libmesh\/quadrature.h\"\n#include \"libmesh\/system.h\"\n\nnamespace libMesh\n{\n\nDGFEMContext::DGFEMContext (const System &sys)\n  : FEMContext(sys),\n    _neighbor(NULL),\n    _dg_terms_active(false)\n{\n  libmesh_experimental();\n\n  unsigned int nv = sys.n_vars();\n  libmesh_assert (nv);\n\n  _neighbor_subresiduals.reserve(nv);\n  _elem_elem_subjacobians.resize(nv);\n  _elem_neighbor_subjacobians.resize(nv);\n  _neighbor_elem_subjacobians.resize(nv);\n  _neighbor_neighbor_subjacobians.resize(nv);\n\n  for (unsigned int i=0; i != nv; ++i)\n  {\n    _neighbor_subresiduals.push_back(new DenseSubVector<Number>(_neighbor_residual));\n    _elem_elem_subjacobians[i].reserve(nv);\n    _elem_neighbor_subjacobians[i].reserve(nv);\n    _neighbor_elem_subjacobians[i].reserve(nv);\n    _neighbor_neighbor_subjacobians[i].reserve(nv);\n\n    for (unsigned int j=0; j != nv; ++j)\n    {\n      _elem_elem_subjacobians[i].push_back\n        (new DenseSubMatrix<Number>(_elem_elem_jacobian));\n      _elem_neighbor_subjacobians[i].push_back\n        (new DenseSubMatrix<Number>(_elem_neighbor_jacobian));\n      _neighbor_elem_subjacobians[i].push_back\n        (new DenseSubMatrix<Number>(_neighbor_elem_jacobian));\n      _neighbor_neighbor_subjacobians[i].push_back\n        (new DenseSubMatrix<Number>(_neighbor_neighbor_jacobian));\n    }\n  }\n\n  _neighbor_side_fe_var.resize(nv);\n  for (unsigned int i=0; i != nv; ++i)\n  {\n    FEType fe_type = sys.variable_type(i);\n\n    if ( _neighbor_side_fe[fe_type] == NULL )\n    {\n      _neighbor_side_fe[fe_type] = FEAbstract::build(dim, fe_type).release();\n    }\n    _neighbor_side_fe_var[i] = _neighbor_side_fe[fe_type];\n  }\n}\n\nDGFEMContext::~DGFEMContext()\n{\n\n  for (std::size_t i=0; i != _neighbor_subresiduals.size(); ++i)\n  {\n    delete _neighbor_subresiduals[i];\n\n    for (std::size_t j=0; j != _elem_elem_subjacobians[i].size(); ++j)\n    {\n      delete _elem_elem_subjacobians[i][j];\n      delete _elem_neighbor_subjacobians[i][j];\n      delete _neighbor_elem_subjacobians[i][j];\n      delete _neighbor_neighbor_subjacobians[i][j];\n    }\n  }\n\n  \/\/ Delete the FE objects\n  for (std::map<FEType, FEAbstract *>::iterator i = _neighbor_side_fe.begin();\n       i != _neighbor_side_fe.end(); ++i)\n    delete i->second;\n  _neighbor_side_fe.clear();\n}\n\nvoid DGFEMContext::side_fe_reinit()\n{\n  FEMContext::side_fe_reinit();\n\n  \/\/ By default we assume that the DG terms are inactive\n  \/\/ They are only active if neighbor_side_fe_reinit is called\n  _dg_terms_active = false;\n}\n\nvoid DGFEMContext::neighbor_side_fe_reinit ()\n{\n  \/\/ Call this *after* side_fe_reinit\n\n  \/\/ Initialize all the neighbor side FE objects based on inverse mapping\n  \/\/ the quadrature points on the current side\n  std::vector<Point> qface_side_points;\n  std::vector<Point> qface_neighbor_points;\n  std::map<FEType, FEAbstract *>::iterator local_fe_end = _neighbor_side_fe.end();\n  for (std::map<FEType, FEAbstract *>::iterator i = _neighbor_side_fe.begin();\n       i != local_fe_end; ++i)\n    {\n      FEType neighbor_side_fe_type = i->first;\n      FEAbstract* side_fe = _side_fe[neighbor_side_fe_type];\n      qface_side_points = side_fe->get_xyz();\n      \n      FEInterface::inverse_map (dim,\n                                neighbor_side_fe_type,\n                                &get_neighbor(),\n                                qface_side_points,\n                                qface_neighbor_points);\n\n      i->second->reinit(&get_neighbor(), &qface_neighbor_points);\n    }\n  \n  \/\/ Set boolean flag to indicate that the DG terms are active on this element\n  _dg_terms_active = true;\n\n  \/\/ Also, initialize data required for DG assembly on the current side,\n  \/\/ analogously to FEMContext::pre_fe_reinit\n\n  \/\/ Initialize the per-element data for elem.\n  get_system().get_dof_map().dof_indices (&get_neighbor(), _neighbor_dof_indices);\n  \n  const unsigned int n_dofs = dof_indices.size();\n  const unsigned int n_neighbor_dofs = libmesh_cast_int<unsigned int>\n    (_neighbor_dof_indices.size());\n\n  \/\/ These resize calls also zero out the residual and jacobian\n  _neighbor_residual.resize(n_neighbor_dofs);\n  _elem_neighbor_jacobian.resize(n_dofs, n_neighbor_dofs);\n  _neighbor_elem_jacobian.resize(n_neighbor_dofs, n_dofs);\n  _neighbor_neighbor_jacobian.resize(n_neighbor_dofs, n_neighbor_dofs);\n  \n  \/\/ Initialize the per-variable data for elem.\n  {\n    unsigned int sub_dofs = 0;\n    for (unsigned int i=0; i != get_system().n_vars(); ++i)\n      {\n        get_system().get_dof_map().dof_indices (&get_neighbor(), _neighbor_dof_indices_var[i], i);\n\n        const unsigned int n_dofs_var = libmesh_cast_int<unsigned int>\n          (_neighbor_dof_indices_var[i].size());\n\n        _neighbor_subresiduals[i]->reposition\n          (sub_dofs, n_dofs_var);\n\n        for (unsigned int j=0; j != i; ++j)\n          {\n            const unsigned int n_dofs_var_j =\n\t      libmesh_cast_int<unsigned int>\n                (dof_indices_var[j].size());\n\n            _elem_neighbor_subjacobians[i][j]->reposition\n              (sub_dofs, _neighbor_subresiduals[j]->i_off(),\n               n_dofs_var, n_dofs_var_j);\n            _elem_neighbor_subjacobians[j][i]->reposition\n              (_neighbor_subresiduals[j]->i_off(), sub_dofs,\n               n_dofs_var_j, n_dofs_var);\n\n            _neighbor_elem_subjacobians[i][j]->reposition\n              (sub_dofs, _neighbor_subresiduals[j]->i_off(),\n               n_dofs_var, n_dofs_var_j);\n            _neighbor_elem_subjacobians[j][i]->reposition\n              (_neighbor_subresiduals[j]->i_off(), sub_dofs,\n               n_dofs_var_j, n_dofs_var);\n\n            _neighbor_neighbor_subjacobians[i][j]->reposition\n              (sub_dofs, _neighbor_subresiduals[j]->i_off(),\n               n_dofs_var, n_dofs_var_j);\n            _neighbor_neighbor_subjacobians[j][i]->reposition\n              (_neighbor_subresiduals[j]->i_off(), sub_dofs,\n               n_dofs_var_j, n_dofs_var);\n          }\n        _elem_neighbor_subjacobians[i][i]->reposition\n          (sub_dofs, sub_dofs,\n           n_dofs_var,\n           n_dofs_var);\n        _neighbor_elem_subjacobians[i][i]->reposition\n          (sub_dofs, sub_dofs,\n           n_dofs_var,\n           n_dofs_var);\n        _neighbor_neighbor_subjacobians[i][i]->reposition\n          (sub_dofs, sub_dofs,\n           n_dofs_var,\n           n_dofs_var);\n        sub_dofs += n_dofs_var;\n      }\n    libmesh_assert_equal_to (sub_dofs, n_dofs);\n  }\n\n}\n\n}\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\n#ifndef __ARCH_ALPHA_ISA_TRAITS_HH__\n#define __ARCH_ALPHA_ISA_TRAITS_HH__\n\nnamespace LittleEndianGuest {}\nusing namespace LittleEndianGuest;\n\n\/\/#include \"arch\/alpha\/faults.hh\"\n#include \"base\/misc.hh\"\n#include \"config\/full_system.hh\"\n#include \"sim\/host.hh\"\n#include \"sim\/faults.hh\"\n\nclass ExecContext;\nclass FastCPU;\nclass FullCPU;\nclass Checkpoint;\n\n#define TARGET_ALPHA\n\nclass StaticInst;\nclass StaticInstPtr;\n\nnamespace EV5 {\nint DTB_ASN_ASN(uint64_t reg);\nint ITB_ASN_ASN(uint64_t reg);\n}\n\nnamespace AlphaISA\n{\n\n    typedef uint32_t MachInst;\n\/\/    typedef uint64_t Addr;\n    typedef uint8_t  RegIndex;\n\n    enum {\n        MemoryEnd = 0xffffffffffffffffULL,\n\n        NumIntRegs = 32,\n        NumFloatRegs = 32,\n        \/\/ @todo: Figure out what this number really should be.\n        NumMiscRegs = 32,\n\n        MaxRegsOfAnyType = 32,\n        \/\/ Static instruction parameters\n        MaxInstSrcRegs = 3,\n        MaxInstDestRegs = 2,\n\n        \/\/ semantically meaningful register indices\n        ZeroReg = 31,\t\/\/ architecturally meaningful\n        \/\/ the rest of these depend on the ABI\n        StackPointerReg = 30,\n        GlobalPointerReg = 29,\n        ProcedureValueReg = 27,\n        ReturnAddressReg = 26,\n        ReturnValueReg = 0,\n        FramePointerReg = 15,\n        ArgumentReg0 = 16,\n        ArgumentReg1 = 17,\n        ArgumentReg2 = 18,\n        ArgumentReg3 = 19,\n        ArgumentReg4 = 20,\n        ArgumentReg5 = 21,\n\n        LogVMPageSize = 13,\t\/\/ 8K bytes\n        VMPageSize = (1 << LogVMPageSize),\n\n        BranchPredAddrShiftAmt = 2, \/\/ instructions are 4-byte aligned\n\n        WordBytes = 4,\n        HalfwordBytes = 2,\n        ByteBytes = 1,\n        DepNA = 0,\n    };\n\n    \/\/ These enumerate all the registers for dependence tracking.\n    enum DependenceTags {\n        \/\/ 0..31 are the integer regs 0..31\n        \/\/ 32..63 are the FP regs 0..31, i.e. use (reg + FP_Base_DepTag)\n        FP_Base_DepTag = 32,\n        Ctrl_Base_DepTag = 64,\n        Fpcr_DepTag = 64,\t\t\/\/ floating point control register\n        Uniq_DepTag = 65,\n        Lock_Flag_DepTag = 66,\n        Lock_Addr_DepTag = 67,\n        IPR_Base_DepTag = 68\n    };\n\n    typedef uint64_t IntReg;\n    typedef IntReg IntRegFile[NumIntRegs];\n\n    \/\/ floating point register file entry type\n    typedef union {\n        uint64_t q;\n        double d;\n    } FloatReg;\n\n    typedef union {\n        uint64_t q[NumFloatRegs];\t\/\/ integer qword view\n        double d[NumFloatRegs];\t\t\/\/ double-precision floating point view\n    } FloatRegFile;\n\nextern const Addr PageShift;\nextern const Addr PageBytes;\nextern const Addr PageMask;\nextern const Addr PageOffset;\n\n#if FULL_SYSTEM\n\n    typedef uint64_t InternalProcReg;\n\n#include \"arch\/alpha\/isa_fullsys_traits.hh\"\n\n#else\n    enum {\n        NumInternalProcRegs = 0\n    };\n#endif\n\n    \/\/ control register file contents\n    typedef uint64_t MiscReg;\n    class MiscRegFile {\n      protected:\n        uint64_t\tfpcr;\t\t\/\/ floating point condition codes\n        uint64_t\tuniq;\t\t\/\/ process-unique register\n        bool\t\tlock_flag;\t\/\/ lock flag for LL\/SC\n        Addr\t\tlock_addr;\t\/\/ lock address for LL\/SC\n\n      public:\n        MiscReg readReg(int misc_reg);\n\n        MiscReg readRegWithEffect(int misc_reg, Fault &fault, ExecContext *xc);\n\n        Fault setReg(int misc_reg, const MiscReg &val);\n\n        Fault setRegWithEffect(int misc_reg, const MiscReg &val,\n                               ExecContext *xc);\n\n#if FULL_SYSTEM\n        void clearIprs();\n\n      protected:\n        InternalProcReg ipr[NumInternalProcRegs]; \/\/ Internal processor regs\n\n      private:\n        MiscReg readIpr(int idx, Fault &fault, ExecContext *xc);\n\n        Fault setIpr(int idx, uint64_t val, ExecContext *xc);\n#endif\n        friend class RegFile;\n    };\n\n    enum {\n        TotalNumRegs =\n        NumIntRegs + NumFloatRegs + NumMiscRegs + NumInternalProcRegs\n    };\n\n    enum {\n        TotalDataRegs = NumIntRegs + NumFloatRegs\n    };\n\n    typedef union {\n        IntReg  intreg;\n        FloatReg   fpreg;\n        MiscReg ctrlreg;\n    } AnyReg;\n\n    struct RegFile {\n        IntRegFile intRegFile;\t\t\/\/ (signed) integer register file\n        FloatRegFile floatRegFile;\t\/\/ floating point register file\n        MiscRegFile miscRegs;\t\t\/\/ control register file\n        Addr pc;\t\t\t\/\/ program counter\n        Addr npc;\t\t\t\/\/ next-cycle program counter\n#if FULL_SYSTEM\n        IntReg palregs[NumIntRegs];\t\/\/ PAL shadow registers\n        int intrflag;\t\t\t\/\/ interrupt flag\n        bool pal_shadow;\t\t\/\/ using pal_shadow registers\n        inline int instAsid()\n        { return EV5::ITB_ASN_ASN(miscRegs.ipr[IPR_ITB_ASN]); }\n        inline int dataAsid()\n        { return EV5::DTB_ASN_ASN(miscRegs.ipr[IPR_DTB_ASN]); }\n#endif \/\/ FULL_SYSTEM\n\n        void serialize(std::ostream &os);\n        void unserialize(Checkpoint *cp, const std::string &section);\n    };\n\n    StaticInstPtr decodeInst(MachInst);\n\n    \/\/ return a no-op instruction... used for instruction fetch faults\n    extern const MachInst NoopMachInst;\n\n    enum annotes {\n        ANNOTE_NONE = 0,\n        \/\/ An impossible number for instruction annotations\n        ITOUCH_ANNOTE = 0xffffffff,\n    };\n\n    static inline bool isCallerSaveIntegerRegister(unsigned int reg) {\n        panic(\"register classification not implemented\");\n        return (reg >= 1 && reg <= 8 || reg >= 22 && reg <= 25 || reg == 27);\n    }\n\n    static inline bool isCalleeSaveIntegerRegister(unsigned int reg) {\n        panic(\"register classification not implemented\");\n        return (reg >= 9 && reg <= 15);\n    }\n\n    static inline bool isCallerSaveFloatRegister(unsigned int reg) {\n        panic(\"register classification not implemented\");\n        return false;\n    }\n\n    static inline bool isCalleeSaveFloatRegister(unsigned int reg) {\n        panic(\"register classification not implemented\");\n        return false;\n    }\n\n    static inline Addr alignAddress(const Addr &addr,\n                                         unsigned int nbytes) {\n        return (addr & ~(nbytes - 1));\n    }\n\n    \/\/ Instruction address compression hooks\n    static inline Addr realPCToFetchPC(const Addr &addr) {\n        return addr;\n    }\n\n    static inline Addr fetchPCToRealPC(const Addr &addr) {\n        return addr;\n    }\n\n    \/\/ the size of \"fetched\" instructions (not necessarily the size\n    \/\/ of real instructions for PISA)\n    static inline size_t fetchInstSize() {\n        return sizeof(MachInst);\n    }\n\n    static inline MachInst makeRegisterCopy(int dest, int src) {\n        panic(\"makeRegisterCopy not implemented\");\n        return 0;\n    }\n\n    \/\/ Machine operations\n\n    void saveMachineReg(AnyReg &savereg, const RegFile &reg_file,\n                               int regnum);\n\n    void restoreMachineReg(RegFile &regs, const AnyReg &reg,\n                                  int regnum);\n\n#if 0\n    static void serializeSpecialRegs(const Serializable::Proxy &proxy,\n                                     const RegFile &regs);\n\n    static void unserializeSpecialRegs(const IniFile *db,\n                                       const std::string &category,\n                                       ConfigNode *node,\n                                       RegFile &regs);\n#endif\n\n    \/**\n     * Function to insure ISA semantics about 0 registers.\n     * @param xc The execution context.\n     *\/\n    template <class XC>\n    void zeroRegisters(XC *xc);\n\n\n\/\/typedef AlphaISA TheISA;\n\n\/\/typedef TheISA::MachInst MachInst;\n\/\/typedef TheISA::Addr Addr;\n\/\/typedef TheISA::RegIndex RegIndex;\n\/\/typedef TheISA::IntReg IntReg;\n\/\/typedef TheISA::IntRegFile IntRegFile;\n\/\/typedef TheISA::FloatReg FloatReg;\n\/\/typedef TheISA::FloatRegFile FloatRegFile;\n\/\/typedef TheISA::MiscReg MiscReg;\n\/\/typedef TheISA::MiscRegFile MiscRegFile;\n\/\/typedef TheISA::AnyReg AnyReg;\n\/\/typedef TheISA::RegFile RegFile;\n\n\/\/const int NumIntRegs   = TheISA::NumIntRegs;\n\/\/const int NumFloatRegs = TheISA::NumFloatRegs;\n\/\/const int NumMiscRegs  = TheISA::NumMiscRegs;\n\/\/const int TotalNumRegs = TheISA::TotalNumRegs;\n\/\/const int VMPageSize   = TheISA::VMPageSize;\n\/\/const int LogVMPageSize   = TheISA::LogVMPageSize;\n\/\/const int ZeroReg = TheISA::ZeroReg;\n\/\/const int StackPointerReg = TheISA::StackPointerReg;\n\/\/const int GlobalPointerReg = TheISA::GlobalPointerReg;\n\/\/const int ReturnAddressReg = TheISA::ReturnAddressReg;\n\/\/const int ReturnValueReg = TheISA::ReturnValueReg;\n\/\/const int ArgumentReg0 = TheISA::ArgumentReg0;\n\/\/const int ArgumentReg1 = TheISA::ArgumentReg1;\n\/\/const int ArgumentReg2 = TheISA::ArgumentReg2;\n\/\/const int BranchPredAddrShiftAmt = TheISA::BranchPredAddrShiftAmt;\nconst Addr MaxAddr = (Addr)-1;\n};\n\n#if !FULL_SYSTEM\nclass SyscallReturn {\n        public:\n           template <class T>\n           SyscallReturn(T v, bool s)\n           {\n               retval = (uint64_t)v;\n               success = s;\n           }\n\n           template <class T>\n           SyscallReturn(T v)\n           {\n               success = (v >= 0);\n               retval = (uint64_t)v;\n           }\n\n           ~SyscallReturn() {}\n\n           SyscallReturn& operator=(const SyscallReturn& s) {\n               retval = s.retval;\n               success = s.success;\n               return *this;\n           }\n\n           bool successful() { return success; }\n           uint64_t value() { return retval; }\n\n\n       private:\n           uint64_t retval;\n           bool success;\n};\n\n#endif\n\n\n#if FULL_SYSTEM\n\/\/typedef TheISA::InternalProcReg InternalProcReg;\n\/\/const int NumInternalProcRegs  = TheISA::NumInternalProcRegs;\n\/\/const int NumInterruptLevels = TheISA::NumInterruptLevels;\n\n#include \"arch\/alpha\/ev5.hh\"\n#endif\n\n#endif \/\/ __ARCH_ALPHA_ISA_TRAITS_HH__\n<commit_msg>Removed the commented out declaration of the Addr type.<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\n#ifndef __ARCH_ALPHA_ISA_TRAITS_HH__\n#define __ARCH_ALPHA_ISA_TRAITS_HH__\n\nnamespace LittleEndianGuest {}\nusing namespace LittleEndianGuest;\n\n\/\/#include \"arch\/alpha\/faults.hh\"\n#include \"base\/misc.hh\"\n#include \"config\/full_system.hh\"\n#include \"sim\/host.hh\"\n#include \"sim\/faults.hh\"\n\nclass ExecContext;\nclass FastCPU;\nclass FullCPU;\nclass Checkpoint;\n\n#define TARGET_ALPHA\n\nclass StaticInst;\nclass StaticInstPtr;\n\nnamespace EV5 {\nint DTB_ASN_ASN(uint64_t reg);\nint ITB_ASN_ASN(uint64_t reg);\n}\n\nnamespace AlphaISA\n{\n\n    typedef uint32_t MachInst;\n    typedef uint8_t  RegIndex;\n\n    enum {\n        MemoryEnd = 0xffffffffffffffffULL,\n\n        NumIntRegs = 32,\n        NumFloatRegs = 32,\n        \/\/ @todo: Figure out what this number really should be.\n        NumMiscRegs = 32,\n\n        MaxRegsOfAnyType = 32,\n        \/\/ Static instruction parameters\n        MaxInstSrcRegs = 3,\n        MaxInstDestRegs = 2,\n\n        \/\/ semantically meaningful register indices\n        ZeroReg = 31,\t\/\/ architecturally meaningful\n        \/\/ the rest of these depend on the ABI\n        StackPointerReg = 30,\n        GlobalPointerReg = 29,\n        ProcedureValueReg = 27,\n        ReturnAddressReg = 26,\n        ReturnValueReg = 0,\n        FramePointerReg = 15,\n        ArgumentReg0 = 16,\n        ArgumentReg1 = 17,\n        ArgumentReg2 = 18,\n        ArgumentReg3 = 19,\n        ArgumentReg4 = 20,\n        ArgumentReg5 = 21,\n\n        LogVMPageSize = 13,\t\/\/ 8K bytes\n        VMPageSize = (1 << LogVMPageSize),\n\n        BranchPredAddrShiftAmt = 2, \/\/ instructions are 4-byte aligned\n\n        WordBytes = 4,\n        HalfwordBytes = 2,\n        ByteBytes = 1,\n        DepNA = 0,\n    };\n\n    \/\/ These enumerate all the registers for dependence tracking.\n    enum DependenceTags {\n        \/\/ 0..31 are the integer regs 0..31\n        \/\/ 32..63 are the FP regs 0..31, i.e. use (reg + FP_Base_DepTag)\n        FP_Base_DepTag = 32,\n        Ctrl_Base_DepTag = 64,\n        Fpcr_DepTag = 64,\t\t\/\/ floating point control register\n        Uniq_DepTag = 65,\n        Lock_Flag_DepTag = 66,\n        Lock_Addr_DepTag = 67,\n        IPR_Base_DepTag = 68\n    };\n\n    typedef uint64_t IntReg;\n    typedef IntReg IntRegFile[NumIntRegs];\n\n    \/\/ floating point register file entry type\n    typedef union {\n        uint64_t q;\n        double d;\n    } FloatReg;\n\n    typedef union {\n        uint64_t q[NumFloatRegs];\t\/\/ integer qword view\n        double d[NumFloatRegs];\t\t\/\/ double-precision floating point view\n    } FloatRegFile;\n\nextern const Addr PageShift;\nextern const Addr PageBytes;\nextern const Addr PageMask;\nextern const Addr PageOffset;\n\n#if FULL_SYSTEM\n\n    typedef uint64_t InternalProcReg;\n\n#include \"arch\/alpha\/isa_fullsys_traits.hh\"\n\n#else\n    enum {\n        NumInternalProcRegs = 0\n    };\n#endif\n\n    \/\/ control register file contents\n    typedef uint64_t MiscReg;\n    class MiscRegFile {\n      protected:\n        uint64_t\tfpcr;\t\t\/\/ floating point condition codes\n        uint64_t\tuniq;\t\t\/\/ process-unique register\n        bool\t\tlock_flag;\t\/\/ lock flag for LL\/SC\n        Addr\t\tlock_addr;\t\/\/ lock address for LL\/SC\n\n      public:\n        MiscReg readReg(int misc_reg);\n\n        MiscReg readRegWithEffect(int misc_reg, Fault &fault, ExecContext *xc);\n\n        Fault setReg(int misc_reg, const MiscReg &val);\n\n        Fault setRegWithEffect(int misc_reg, const MiscReg &val,\n                               ExecContext *xc);\n\n#if FULL_SYSTEM\n        void clearIprs();\n\n      protected:\n        InternalProcReg ipr[NumInternalProcRegs]; \/\/ Internal processor regs\n\n      private:\n        MiscReg readIpr(int idx, Fault &fault, ExecContext *xc);\n\n        Fault setIpr(int idx, uint64_t val, ExecContext *xc);\n#endif\n        friend class RegFile;\n    };\n\n    enum {\n        TotalNumRegs =\n        NumIntRegs + NumFloatRegs + NumMiscRegs + NumInternalProcRegs\n    };\n\n    enum {\n        TotalDataRegs = NumIntRegs + NumFloatRegs\n    };\n\n    typedef union {\n        IntReg  intreg;\n        FloatReg   fpreg;\n        MiscReg ctrlreg;\n    } AnyReg;\n\n    struct RegFile {\n        IntRegFile intRegFile;\t\t\/\/ (signed) integer register file\n        FloatRegFile floatRegFile;\t\/\/ floating point register file\n        MiscRegFile miscRegs;\t\t\/\/ control register file\n        Addr pc;\t\t\t\/\/ program counter\n        Addr npc;\t\t\t\/\/ next-cycle program counter\n#if FULL_SYSTEM\n        IntReg palregs[NumIntRegs];\t\/\/ PAL shadow registers\n        int intrflag;\t\t\t\/\/ interrupt flag\n        bool pal_shadow;\t\t\/\/ using pal_shadow registers\n        inline int instAsid()\n        { return EV5::ITB_ASN_ASN(miscRegs.ipr[IPR_ITB_ASN]); }\n        inline int dataAsid()\n        { return EV5::DTB_ASN_ASN(miscRegs.ipr[IPR_DTB_ASN]); }\n#endif \/\/ FULL_SYSTEM\n\n        void serialize(std::ostream &os);\n        void unserialize(Checkpoint *cp, const std::string &section);\n    };\n\n    StaticInstPtr decodeInst(MachInst);\n\n    \/\/ return a no-op instruction... used for instruction fetch faults\n    extern const MachInst NoopMachInst;\n\n    enum annotes {\n        ANNOTE_NONE = 0,\n        \/\/ An impossible number for instruction annotations\n        ITOUCH_ANNOTE = 0xffffffff,\n    };\n\n    static inline bool isCallerSaveIntegerRegister(unsigned int reg) {\n        panic(\"register classification not implemented\");\n        return (reg >= 1 && reg <= 8 || reg >= 22 && reg <= 25 || reg == 27);\n    }\n\n    static inline bool isCalleeSaveIntegerRegister(unsigned int reg) {\n        panic(\"register classification not implemented\");\n        return (reg >= 9 && reg <= 15);\n    }\n\n    static inline bool isCallerSaveFloatRegister(unsigned int reg) {\n        panic(\"register classification not implemented\");\n        return false;\n    }\n\n    static inline bool isCalleeSaveFloatRegister(unsigned int reg) {\n        panic(\"register classification not implemented\");\n        return false;\n    }\n\n    static inline Addr alignAddress(const Addr &addr,\n                                         unsigned int nbytes) {\n        return (addr & ~(nbytes - 1));\n    }\n\n    \/\/ Instruction address compression hooks\n    static inline Addr realPCToFetchPC(const Addr &addr) {\n        return addr;\n    }\n\n    static inline Addr fetchPCToRealPC(const Addr &addr) {\n        return addr;\n    }\n\n    \/\/ the size of \"fetched\" instructions (not necessarily the size\n    \/\/ of real instructions for PISA)\n    static inline size_t fetchInstSize() {\n        return sizeof(MachInst);\n    }\n\n    static inline MachInst makeRegisterCopy(int dest, int src) {\n        panic(\"makeRegisterCopy not implemented\");\n        return 0;\n    }\n\n    \/\/ Machine operations\n\n    void saveMachineReg(AnyReg &savereg, const RegFile &reg_file,\n                               int regnum);\n\n    void restoreMachineReg(RegFile &regs, const AnyReg &reg,\n                                  int regnum);\n\n#if 0\n    static void serializeSpecialRegs(const Serializable::Proxy &proxy,\n                                     const RegFile &regs);\n\n    static void unserializeSpecialRegs(const IniFile *db,\n                                       const std::string &category,\n                                       ConfigNode *node,\n                                       RegFile &regs);\n#endif\n\n    \/**\n     * Function to insure ISA semantics about 0 registers.\n     * @param xc The execution context.\n     *\/\n    template <class XC>\n    void zeroRegisters(XC *xc);\n\n\n\/\/typedef AlphaISA TheISA;\n\n\/\/typedef TheISA::MachInst MachInst;\n\/\/typedef TheISA::Addr Addr;\n\/\/typedef TheISA::RegIndex RegIndex;\n\/\/typedef TheISA::IntReg IntReg;\n\/\/typedef TheISA::IntRegFile IntRegFile;\n\/\/typedef TheISA::FloatReg FloatReg;\n\/\/typedef TheISA::FloatRegFile FloatRegFile;\n\/\/typedef TheISA::MiscReg MiscReg;\n\/\/typedef TheISA::MiscRegFile MiscRegFile;\n\/\/typedef TheISA::AnyReg AnyReg;\n\/\/typedef TheISA::RegFile RegFile;\n\n\/\/const int NumIntRegs   = TheISA::NumIntRegs;\n\/\/const int NumFloatRegs = TheISA::NumFloatRegs;\n\/\/const int NumMiscRegs  = TheISA::NumMiscRegs;\n\/\/const int TotalNumRegs = TheISA::TotalNumRegs;\n\/\/const int VMPageSize   = TheISA::VMPageSize;\n\/\/const int LogVMPageSize   = TheISA::LogVMPageSize;\n\/\/const int ZeroReg = TheISA::ZeroReg;\n\/\/const int StackPointerReg = TheISA::StackPointerReg;\n\/\/const int GlobalPointerReg = TheISA::GlobalPointerReg;\n\/\/const int ReturnAddressReg = TheISA::ReturnAddressReg;\n\/\/const int ReturnValueReg = TheISA::ReturnValueReg;\n\/\/const int ArgumentReg0 = TheISA::ArgumentReg0;\n\/\/const int ArgumentReg1 = TheISA::ArgumentReg1;\n\/\/const int ArgumentReg2 = TheISA::ArgumentReg2;\n\/\/const int BranchPredAddrShiftAmt = TheISA::BranchPredAddrShiftAmt;\nconst Addr MaxAddr = (Addr)-1;\n};\n\n#if !FULL_SYSTEM\nclass SyscallReturn {\n        public:\n           template <class T>\n           SyscallReturn(T v, bool s)\n           {\n               retval = (uint64_t)v;\n               success = s;\n           }\n\n           template <class T>\n           SyscallReturn(T v)\n           {\n               success = (v >= 0);\n               retval = (uint64_t)v;\n           }\n\n           ~SyscallReturn() {}\n\n           SyscallReturn& operator=(const SyscallReturn& s) {\n               retval = s.retval;\n               success = s.success;\n               return *this;\n           }\n\n           bool successful() { return success; }\n           uint64_t value() { return retval; }\n\n\n       private:\n           uint64_t retval;\n           bool success;\n};\n\n#endif\n\n\n#if FULL_SYSTEM\n\/\/typedef TheISA::InternalProcReg InternalProcReg;\n\/\/const int NumInternalProcRegs  = TheISA::NumInternalProcRegs;\n\/\/const int NumInterruptLevels = TheISA::NumInterruptLevels;\n\n#include \"arch\/alpha\/ev5.hh\"\n#endif\n\n#endif \/\/ __ARCH_ALPHA_ISA_TRAITS_HH__\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2012-2018 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <random.h>\n#include <scheduler.h>\n\n#include <test\/test_bitcoin.h>\n\n#include <boost\/bind.hpp>\n#include <boost\/thread.hpp>\n#include <boost\/test\/unit_test.hpp>\n\nBOOST_AUTO_TEST_SUITE(scheduler_tests)\n\nstatic void microTask(CScheduler& s, boost::mutex& mutex, int& counter, int delta, boost::chrono::system_clock::time_point rescheduleTime)\n{\n    {\n        boost::unique_lock<boost::mutex> lock(mutex);\n        counter += delta;\n    }\n    boost::chrono::system_clock::time_point noTime = boost::chrono::system_clock::time_point::min();\n    if (rescheduleTime != noTime) {\n        CScheduler::Function f = boost::bind(&microTask, boost::ref(s), boost::ref(mutex), boost::ref(counter), -delta + 1, noTime);\n        s.schedule(f, rescheduleTime);\n    }\n}\n\nstatic void MicroSleep(uint64_t n)\n{\n#if defined(HAVE_WORKING_BOOST_SLEEP_FOR)\n    boost::this_thread::sleep_for(boost::chrono::microseconds(n));\n#elif defined(HAVE_WORKING_BOOST_SLEEP)\n    boost::this_thread::sleep(boost::posix_time::microseconds(n));\n#else\n    \/\/should never get here\n    #error missing boost sleep implementation\n#endif\n}\n\nBOOST_AUTO_TEST_CASE(manythreads)\n{\n    \/\/ Stress test: hundreds of microsecond-scheduled tasks,\n    \/\/ serviced by 10 threads.\n    \/\/\n    \/\/ So... ten shared counters, which if all the tasks execute\n    \/\/ properly will sum to the number of tasks done.\n    \/\/ Each task adds or subtracts a random amount from one of the\n    \/\/ counters, and then schedules another task 0-1000\n    \/\/ microseconds in the future to subtract or add from\n    \/\/ the counter -random_amount+1, so in the end the shared\n    \/\/ counters should sum to the number of initial tasks performed.\n    CScheduler microTasks;\n\n    boost::mutex counterMutex[10];\n    int counter[10] = { 0 };\n    FastRandomContext rng(42);\n    auto zeroToNine = [](FastRandomContext& rc) -> int { return rc.randrange(10); }; \/\/ [0, 9]\n    auto randomMsec = [](FastRandomContext& rc) -> int { return -11 + (int)rc.randrange(1012); }; \/\/ [-11, 1000]\n    auto randomDelta = [](FastRandomContext& rc) -> int { return -1000 + (int)rc.randrange(2001); }; \/\/ [-1000, 1000]\n\n    boost::chrono::system_clock::time_point start = boost::chrono::system_clock::now();\n    boost::chrono::system_clock::time_point now = start;\n    boost::chrono::system_clock::time_point first, last;\n    size_t nTasks = microTasks.getQueueInfo(first, last);\n    BOOST_CHECK(nTasks == 0);\n\n    for (int i = 0; i < 100; ++i) {\n        boost::chrono::system_clock::time_point t = now + boost::chrono::microseconds(randomMsec(rng));\n        boost::chrono::system_clock::time_point tReschedule = now + boost::chrono::microseconds(500 + randomMsec(rng));\n        int whichCounter = zeroToNine(rng);\n        CScheduler::Function f = boost::bind(&microTask, boost::ref(microTasks),\n                                             boost::ref(counterMutex[whichCounter]), boost::ref(counter[whichCounter]),\n                                             randomDelta(rng), tReschedule);\n        microTasks.schedule(f, t);\n    }\n    nTasks = microTasks.getQueueInfo(first, last);\n    BOOST_CHECK(nTasks == 100);\n    BOOST_CHECK(first < last);\n    BOOST_CHECK(last > now);\n\n    \/\/ As soon as these are created they will start running and servicing the queue\n    boost::thread_group microThreads;\n    for (int i = 0; i < 5; i++)\n        microThreads.create_thread(boost::bind(&CScheduler::serviceQueue, &microTasks));\n\n    MicroSleep(600);\n    now = boost::chrono::system_clock::now();\n\n    \/\/ More threads and more tasks:\n    for (int i = 0; i < 5; i++)\n        microThreads.create_thread(boost::bind(&CScheduler::serviceQueue, &microTasks));\n    for (int i = 0; i < 100; i++) {\n        boost::chrono::system_clock::time_point t = now + boost::chrono::microseconds(randomMsec(rng));\n        boost::chrono::system_clock::time_point tReschedule = now + boost::chrono::microseconds(500 + randomMsec(rng));\n        int whichCounter = zeroToNine(rng);\n        CScheduler::Function f = boost::bind(&microTask, boost::ref(microTasks),\n                                             boost::ref(counterMutex[whichCounter]), boost::ref(counter[whichCounter]),\n                                             randomDelta(rng), tReschedule);\n        microTasks.schedule(f, t);\n    }\n\n    \/\/ Drain the task queue then exit threads\n    microTasks.stop(true);\n    microThreads.join_all(); \/\/ ... wait until all the threads are done\n\n    int counterSum = 0;\n    for (int i = 0; i < 10; i++) {\n        BOOST_CHECK(counter[i] != 0);\n        counterSum += counter[i];\n    }\n    BOOST_CHECK_EQUAL(counterSum, 200);\n}\n\nBOOST_AUTO_TEST_CASE(singlethreadedscheduler_ordered)\n{\n    CScheduler scheduler;\n\n    \/\/ each queue should be well ordered with respect to itself but not other queues\n    SingleThreadedSchedulerClient queue1(&scheduler);\n    SingleThreadedSchedulerClient queue2(&scheduler);\n\n    \/\/ create more threads than queues\n    \/\/ if the queues only permit execution of one task at once then\n    \/\/ the extra threads should effectively be doing nothing\n    \/\/ if they don't we'll get out of order behaviour\n    boost::thread_group threads;\n    for (int i = 0; i < 5; ++i) {\n        threads.create_thread(boost::bind(&CScheduler::serviceQueue, &scheduler));\n    }\n\n    \/\/ these are not atomic, if SinglethreadedSchedulerClient prevents\n    \/\/ parallel execution at the queue level no synchronization should be required here\n    int counter1 = 0;\n    int counter2 = 0;\n\n    \/\/ just simply count up on each queue - if execution is properly ordered then\n    \/\/ the callbacks should run in exactly the order in which they were enqueued\n    for (int i = 0; i < 100; ++i) {\n        queue1.AddToProcessQueue([i, &counter1]() {\n            BOOST_CHECK_EQUAL(i, counter1++);\n        });\n\n        queue2.AddToProcessQueue([i, &counter2]() {\n            BOOST_CHECK_EQUAL(i, counter2++);\n        });\n    }\n\n    \/\/ finish up\n    scheduler.stop(true);\n    threads.join_all();\n\n    BOOST_CHECK_EQUAL(counter1, 100);\n    BOOST_CHECK_EQUAL(counter2, 100);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<commit_msg>Use assert when running from multithreaded code as BOOST_CHECK_* are not thread safe<commit_after>\/\/ Copyright (c) 2012-2018 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <random.h>\n#include <scheduler.h>\n\n#include <test\/test_bitcoin.h>\n\n#include <boost\/bind.hpp>\n#include <boost\/thread.hpp>\n#include <boost\/test\/unit_test.hpp>\n\nBOOST_AUTO_TEST_SUITE(scheduler_tests)\n\nstatic void microTask(CScheduler& s, boost::mutex& mutex, int& counter, int delta, boost::chrono::system_clock::time_point rescheduleTime)\n{\n    {\n        boost::unique_lock<boost::mutex> lock(mutex);\n        counter += delta;\n    }\n    boost::chrono::system_clock::time_point noTime = boost::chrono::system_clock::time_point::min();\n    if (rescheduleTime != noTime) {\n        CScheduler::Function f = boost::bind(&microTask, boost::ref(s), boost::ref(mutex), boost::ref(counter), -delta + 1, noTime);\n        s.schedule(f, rescheduleTime);\n    }\n}\n\nstatic void MicroSleep(uint64_t n)\n{\n#if defined(HAVE_WORKING_BOOST_SLEEP_FOR)\n    boost::this_thread::sleep_for(boost::chrono::microseconds(n));\n#elif defined(HAVE_WORKING_BOOST_SLEEP)\n    boost::this_thread::sleep(boost::posix_time::microseconds(n));\n#else\n    \/\/should never get here\n    #error missing boost sleep implementation\n#endif\n}\n\nBOOST_AUTO_TEST_CASE(manythreads)\n{\n    \/\/ Stress test: hundreds of microsecond-scheduled tasks,\n    \/\/ serviced by 10 threads.\n    \/\/\n    \/\/ So... ten shared counters, which if all the tasks execute\n    \/\/ properly will sum to the number of tasks done.\n    \/\/ Each task adds or subtracts a random amount from one of the\n    \/\/ counters, and then schedules another task 0-1000\n    \/\/ microseconds in the future to subtract or add from\n    \/\/ the counter -random_amount+1, so in the end the shared\n    \/\/ counters should sum to the number of initial tasks performed.\n    CScheduler microTasks;\n\n    boost::mutex counterMutex[10];\n    int counter[10] = { 0 };\n    FastRandomContext rng(42);\n    auto zeroToNine = [](FastRandomContext& rc) -> int { return rc.randrange(10); }; \/\/ [0, 9]\n    auto randomMsec = [](FastRandomContext& rc) -> int { return -11 + (int)rc.randrange(1012); }; \/\/ [-11, 1000]\n    auto randomDelta = [](FastRandomContext& rc) -> int { return -1000 + (int)rc.randrange(2001); }; \/\/ [-1000, 1000]\n\n    boost::chrono::system_clock::time_point start = boost::chrono::system_clock::now();\n    boost::chrono::system_clock::time_point now = start;\n    boost::chrono::system_clock::time_point first, last;\n    size_t nTasks = microTasks.getQueueInfo(first, last);\n    BOOST_CHECK(nTasks == 0);\n\n    for (int i = 0; i < 100; ++i) {\n        boost::chrono::system_clock::time_point t = now + boost::chrono::microseconds(randomMsec(rng));\n        boost::chrono::system_clock::time_point tReschedule = now + boost::chrono::microseconds(500 + randomMsec(rng));\n        int whichCounter = zeroToNine(rng);\n        CScheduler::Function f = boost::bind(&microTask, boost::ref(microTasks),\n                                             boost::ref(counterMutex[whichCounter]), boost::ref(counter[whichCounter]),\n                                             randomDelta(rng), tReschedule);\n        microTasks.schedule(f, t);\n    }\n    nTasks = microTasks.getQueueInfo(first, last);\n    BOOST_CHECK(nTasks == 100);\n    BOOST_CHECK(first < last);\n    BOOST_CHECK(last > now);\n\n    \/\/ As soon as these are created they will start running and servicing the queue\n    boost::thread_group microThreads;\n    for (int i = 0; i < 5; i++)\n        microThreads.create_thread(boost::bind(&CScheduler::serviceQueue, &microTasks));\n\n    MicroSleep(600);\n    now = boost::chrono::system_clock::now();\n\n    \/\/ More threads and more tasks:\n    for (int i = 0; i < 5; i++)\n        microThreads.create_thread(boost::bind(&CScheduler::serviceQueue, &microTasks));\n    for (int i = 0; i < 100; i++) {\n        boost::chrono::system_clock::time_point t = now + boost::chrono::microseconds(randomMsec(rng));\n        boost::chrono::system_clock::time_point tReschedule = now + boost::chrono::microseconds(500 + randomMsec(rng));\n        int whichCounter = zeroToNine(rng);\n        CScheduler::Function f = boost::bind(&microTask, boost::ref(microTasks),\n                                             boost::ref(counterMutex[whichCounter]), boost::ref(counter[whichCounter]),\n                                             randomDelta(rng), tReschedule);\n        microTasks.schedule(f, t);\n    }\n\n    \/\/ Drain the task queue then exit threads\n    microTasks.stop(true);\n    microThreads.join_all(); \/\/ ... wait until all the threads are done\n\n    int counterSum = 0;\n    for (int i = 0; i < 10; i++) {\n        BOOST_CHECK(counter[i] != 0);\n        counterSum += counter[i];\n    }\n    BOOST_CHECK_EQUAL(counterSum, 200);\n}\n\nBOOST_AUTO_TEST_CASE(singlethreadedscheduler_ordered)\n{\n    CScheduler scheduler;\n\n    \/\/ each queue should be well ordered with respect to itself but not other queues\n    SingleThreadedSchedulerClient queue1(&scheduler);\n    SingleThreadedSchedulerClient queue2(&scheduler);\n\n    \/\/ create more threads than queues\n    \/\/ if the queues only permit execution of one task at once then\n    \/\/ the extra threads should effectively be doing nothing\n    \/\/ if they don't we'll get out of order behaviour\n    boost::thread_group threads;\n    for (int i = 0; i < 5; ++i) {\n        threads.create_thread(boost::bind(&CScheduler::serviceQueue, &scheduler));\n    }\n\n    \/\/ these are not atomic, if SinglethreadedSchedulerClient prevents\n    \/\/ parallel execution at the queue level no synchronization should be required here\n    int counter1 = 0;\n    int counter2 = 0;\n\n    \/\/ just simply count up on each queue - if execution is properly ordered then\n    \/\/ the callbacks should run in exactly the order in which they were enqueued\n    for (int i = 0; i < 100; ++i) {\n        queue1.AddToProcessQueue([i, &counter1]() {\n            assert(i == counter1++);\n        });\n\n        queue2.AddToProcessQueue([i, &counter2]() {\n            assert(i == counter2++);\n        });\n    }\n\n    \/\/ finish up\n    scheduler.stop(true);\n    threads.join_all();\n\n    BOOST_CHECK_EQUAL(counter1, 100);\n    BOOST_CHECK_EQUAL(counter2, 100);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<|endoftext|>"}
{"text":"<commit_before>#line 2 \"togo\/utility\/utility.hpp\"\n\/**\n@copyright MIT license; see @ref index or the accompanying LICENSE file.\n\n@file\n@brief Utilities.\n@ingroup utility\n*\/\n\n#pragma once\n\n#include <togo\/config.hpp>\n#include <togo\/types.hpp>\n#include <togo\/utility\/types.hpp>\n#include <togo\/utility\/traits.hpp>\n#include <togo\/utility\/constraints.hpp>\n\n#include <type_traits>\n\nnamespace togo {\n\n\/**\n\t@addtogroup utility\n\t@{\n*\/\n\n\/** @name Type utilities *\/ \/\/\/ @{\n\n\/\/\/ Cast unsigned integral to signed integral.\ntemplate<class T>\ninline constexpr typename std::make_signed<T>::type\nsigned_cast(T const value) noexcept {\n\treturn static_cast<typename std::make_signed<T>::type>(value);\n}\n\n\/\/\/ Cast signed integral to unsigned integral.\ntemplate<class T>\ninline constexpr typename std::make_unsigned<T>::type\nunsigned_cast(T const value) noexcept {\n\treturn static_cast<typename std::make_unsigned<T>::type>(value);\n}\n\n\/\/\/ Get number of elements in bounded array.\ntemplate<class T, unsigned N>\ninline constexpr unsigned\narray_extent(T const (&)[N]) noexcept {\n\treturn N;\n}\n\n\/\/\/ Get number of elements in bounded array.\ntemplate<class T, class U, unsigned N>\ninline constexpr unsigned\narray_extent(T const (U::* const)[N]) noexcept {\n\treturn N;\n}\n\n\/\/\/ Get sizeof type or 0 if the type is empty.\ntemplate<class T>\ninline constexpr unsigned\nsizeof_empty() noexcept {\n\treturn std::is_empty<T>::value ? 0 : sizeof(T);\n}\n\n\/\/\/ @}\n\n\/** @name Misc utilities *\/ \/\/\/ @{\n\n\/\/\/ Make an rvalue reference.\n\/\/\/\n\/\/\/ This is equivalent to std::move(), whose name is totally bonkers.\ntemplate<class T>\ninline constexpr remove_ref<T>&& rvalue_ref(T&& x) noexcept {\n\treturn static_cast<remove_ref<T>&&>(x);\n}\n\n\/\/\/ Retain value category when passing to another function.\n\/\/\/\n\/\/\/ This is equivalent to std::forward().\ntemplate<class T>\ninline constexpr T&& forward(remove_ref<T>& x) noexcept {\n\treturn static_cast<T&&>(x);\n}\n\ntemplate<class T>\ninline constexpr T&& forward(remove_ref<T>&& x) noexcept {\n\tstatic_assert(\n\t\t!is_lvalue_reference<T>::value,\n\t\t\"rvalue cannot be forwarded as an lvalue\"\n\t);\n\treturn static_cast<T&&>(x);\n}\n\n\/\/\/ A type as an unevaluated value.\n\/\/\/\n\/\/\/ This is equivalent to std::declval().\ntemplate<class T>\ninline add_rvalue_ref<T> type_value() noexcept;\n\n\/\/\/ Swap the values of two references.\ntemplate<class T>\ninline void swap(T& x, T& y) {\n\tT temp = x;\n\tx = y;\n\ty = temp;\n}\n\n\/\/\/ Less-than comparison operator wrapper.\ntemplate<class T>\ninline bool less(T const& x, T const& y) {\n\treturn x < y;\n}\n\n\/\/\/ Greater-than comparison operator wrapper.\ntemplate<class T>\ninline bool greater(T const& x, T const& y) {\n\treturn x > y;\n}\n\n\/\/\/ @}\n\n\/** @name Arithmetic utilities *\/ \/\/\/ @{\n\n\/\/\/ Get the smallest of two values.\ntemplate<class T>\ninline constexpr T min(T const x, T const y) noexcept {\n\tTOGO_CONSTRAIN_INTEGRAL(T);\n\treturn x < y ? x : y;\n}\n\n\/\/\/ Get the largest of two values.\ntemplate<class T>\ninline constexpr T max(T const x, T const y) noexcept {\n\tTOGO_CONSTRAIN_INTEGRAL(T);\n\treturn x > y ? x : y;\n}\n\n\/\/\/ Clamp a value between a minimum and maximum.\ntemplate<class T>\ninline constexpr T clamp(T const x, T const minimum, T const maximum) noexcept {\n\tTOGO_CONSTRAIN_INTEGRAL(T);\n\treturn\n\t\t  x < minimum\n\t\t? minimum\n\t\t: x > maximum\n\t\t? maximum\n\t\t: x\n\t;\n}\n\n\/\/\/ @}\n\n\/** @name Memory utilities *\/ \/\/\/ @{\n\n\/\/\/ Advance pointer by bytes.\n\/\/\/ @warning This advances by bytes, not sizeof(T).\ntemplate<class T>\ninline T* pointer_add(T* p, u32 const bytes) noexcept {\n\treturn reinterpret_cast<T*>(reinterpret_cast<char*>(p) + bytes);\n}\n\n\/\/\/ Aligns a pointer by moving it forward.\ntemplate<class T>\ninline T* pointer_align(T* p, u32 const align) noexcept {\n\tu32 const m = reinterpret_cast<std::uintptr_t>(p) % align;\n\tif (m) {\n\t\tp = pointer_add(p, align - m);\n\t}\n\treturn p;\n}\n\n\/\/\/ @}\n\n\/** @name Enum utilities *\/ \/\/\/ @{\n\n\/\/\/ Return true whether an enum value is non-zero.\ntemplate<class T>\ninline constexpr bool enum_bool(T const value) {\n\tstatic_assert(\n\t\tstd::is_enum<T>::value,\n\t\t\"T must be an enum\"\n\t);\n\treturn static_cast<typename std::underlying_type<T>::type>(value);\n}\n\n\/** @cond INTERNAL *\/\ntemplate<class FlagT, class = enable_if<enable_enum_bitwise_ops<FlagT>::value>>\ninline constexpr FlagT operator|(FlagT const& x, FlagT const& y) noexcept {\n\treturn static_cast<FlagT>(\n\t\tstatic_cast<unsigned>(x) | static_cast<unsigned>(y)\n\t);\n}\n\ntemplate<class FlagT, class = enable_if<enable_enum_bitwise_ops<FlagT>::value>>\ninline constexpr FlagT operator&(FlagT const& x, FlagT const& y) noexcept {\n\treturn static_cast<FlagT>(\n\t\tstatic_cast<unsigned>(x) & static_cast<unsigned>(y)\n\t);\n}\n\ntemplate<class FlagT, class = enable_if<enable_enum_bitwise_ops<FlagT>::value>>\ninline constexpr FlagT operator~(FlagT const& x) noexcept {\n\treturn static_cast<FlagT>(\n\t\t~static_cast<unsigned>(x)\n\t);\n}\n\ntemplate<class FlagT, class = enable_if<enable_enum_bitwise_ops<FlagT>::value>>\ninline constexpr FlagT& operator|=(FlagT& x, FlagT const& y) noexcept {\n\treturn x = static_cast<FlagT>(\n\t\tstatic_cast<unsigned>(x) | static_cast<unsigned>(y)\n\t);\n}\n\ntemplate<class FlagT, class = enable_if<enable_enum_bitwise_ops<FlagT>::value>>\ninline constexpr FlagT& operator&=(FlagT& x, FlagT const& y) noexcept {\n\treturn x = static_cast<FlagT>(\n\t\tstatic_cast<unsigned>(x) & static_cast<unsigned>(y)\n\t);\n}\n\/** @endcond *\/ \/\/ INTERNAL\n\n\/\/\/ @}\n\n\/** @name Collection utilities *\/ \/\/\/ @{\n\ntemplate<class T>\nstruct ArrayRef {\n\tT* _begin;\n\tT* _end;\n\n\tinline ArrayRef(T* const begin, T* const end)\n\t\t: _begin(begin)\n\t\t, _end(end)\n\t{}\n\n\ttemplate<class U, class = enable_if<std::is_convertible<U, T>::value>>\n\tinline ArrayRef(ArrayRef<U> const& other)\n\t\t: _begin(other._begin)\n\t\t, _end(other._end)\n\t{}\n\n\t\/\/\/ Number of items.\n\tunsigned size() const {\n\t\treturn _end - _begin;\n\t}\n};\n\n\/\/\/ Make reference to array.\ntemplate<class T>\ninline ArrayRef<T> array_ref(unsigned const size, T* const data) {\n\treturn ArrayRef<T>{data, data + size};\n}\n\n\/** @cond INTERNAL *\/\ntemplate<class T>\ninline T* begin(ArrayRef<T> const& ar) { return ar._begin; }\n\ntemplate<class T>\ninline T const* cbegin(ArrayRef<T> const& ar) { return ar._begin; }\n\ntemplate<class T>\ninline T* end(ArrayRef<T> const& ar) { return ar._end; }\n\ntemplate<class T>\ninline T const* cend(ArrayRef<T> const& ar) { return ar._end; }\n\/** @endcond *\/ \/\/ INTERNAL\n\n\/\/\/ @}\n\n\/** @} *\/ \/\/ end of doc-group utility\n\n} \/\/ namespace togo\n<commit_msg>utility: cast to correct constness in pointer_add().<commit_after>#line 2 \"togo\/utility\/utility.hpp\"\n\/**\n@copyright MIT license; see @ref index or the accompanying LICENSE file.\n\n@file\n@brief Utilities.\n@ingroup utility\n*\/\n\n#pragma once\n\n#include <togo\/config.hpp>\n#include <togo\/types.hpp>\n#include <togo\/utility\/types.hpp>\n#include <togo\/utility\/traits.hpp>\n#include <togo\/utility\/constraints.hpp>\n\n#include <type_traits>\n\nnamespace togo {\n\n\/**\n\t@addtogroup utility\n\t@{\n*\/\n\n\/** @name Type utilities *\/ \/\/\/ @{\n\n\/\/\/ Cast unsigned integral to signed integral.\ntemplate<class T>\ninline constexpr typename std::make_signed<T>::type\nsigned_cast(T const value) noexcept {\n\treturn static_cast<typename std::make_signed<T>::type>(value);\n}\n\n\/\/\/ Cast signed integral to unsigned integral.\ntemplate<class T>\ninline constexpr typename std::make_unsigned<T>::type\nunsigned_cast(T const value) noexcept {\n\treturn static_cast<typename std::make_unsigned<T>::type>(value);\n}\n\n\/\/\/ Get number of elements in bounded array.\ntemplate<class T, unsigned N>\ninline constexpr unsigned\narray_extent(T const (&)[N]) noexcept {\n\treturn N;\n}\n\n\/\/\/ Get number of elements in bounded array.\ntemplate<class T, class U, unsigned N>\ninline constexpr unsigned\narray_extent(T const (U::* const)[N]) noexcept {\n\treturn N;\n}\n\n\/\/\/ Get sizeof type or 0 if the type is empty.\ntemplate<class T>\ninline constexpr unsigned\nsizeof_empty() noexcept {\n\treturn std::is_empty<T>::value ? 0 : sizeof(T);\n}\n\n\/\/\/ @}\n\n\/** @name Misc utilities *\/ \/\/\/ @{\n\n\/\/\/ Make an rvalue reference.\n\/\/\/\n\/\/\/ This is equivalent to std::move(), whose name is totally bonkers.\ntemplate<class T>\ninline constexpr remove_ref<T>&& rvalue_ref(T&& x) noexcept {\n\treturn static_cast<remove_ref<T>&&>(x);\n}\n\n\/\/\/ Retain value category when passing to another function.\n\/\/\/\n\/\/\/ This is equivalent to std::forward().\ntemplate<class T>\ninline constexpr T&& forward(remove_ref<T>& x) noexcept {\n\treturn static_cast<T&&>(x);\n}\n\ntemplate<class T>\ninline constexpr T&& forward(remove_ref<T>&& x) noexcept {\n\tstatic_assert(\n\t\t!is_lvalue_reference<T>::value,\n\t\t\"rvalue cannot be forwarded as an lvalue\"\n\t);\n\treturn static_cast<T&&>(x);\n}\n\n\/\/\/ A type as an unevaluated value.\n\/\/\/\n\/\/\/ This is equivalent to std::declval().\ntemplate<class T>\ninline add_rvalue_ref<T> type_value() noexcept;\n\n\/\/\/ Swap the values of two references.\ntemplate<class T>\ninline void swap(T& x, T& y) {\n\tT temp = x;\n\tx = y;\n\ty = temp;\n}\n\n\/\/\/ Less-than comparison operator wrapper.\ntemplate<class T>\ninline bool less(T const& x, T const& y) {\n\treturn x < y;\n}\n\n\/\/\/ Greater-than comparison operator wrapper.\ntemplate<class T>\ninline bool greater(T const& x, T const& y) {\n\treturn x > y;\n}\n\n\/\/\/ @}\n\n\/** @name Arithmetic utilities *\/ \/\/\/ @{\n\n\/\/\/ Get the smallest of two values.\ntemplate<class T>\ninline constexpr T min(T const x, T const y) noexcept {\n\tTOGO_CONSTRAIN_INTEGRAL(T);\n\treturn x < y ? x : y;\n}\n\n\/\/\/ Get the largest of two values.\ntemplate<class T>\ninline constexpr T max(T const x, T const y) noexcept {\n\tTOGO_CONSTRAIN_INTEGRAL(T);\n\treturn x > y ? x : y;\n}\n\n\/\/\/ Clamp a value between a minimum and maximum.\ntemplate<class T>\ninline constexpr T clamp(T const x, T const minimum, T const maximum) noexcept {\n\tTOGO_CONSTRAIN_INTEGRAL(T);\n\treturn\n\t\t  x < minimum\n\t\t? minimum\n\t\t: x > maximum\n\t\t? maximum\n\t\t: x\n\t;\n}\n\n\/\/\/ @}\n\n\/** @name Memory utilities *\/ \/\/\/ @{\n\n\/\/\/ Advance pointer by bytes.\n\/\/\/ @warning This advances by bytes, not sizeof(T).\ntemplate<class T>\ninline T* pointer_add(T* p, u32 const bytes) noexcept {\n\treturn reinterpret_cast<T*>(\n\t\treinterpret_cast<type_if<is_const<T>::value, char const*, char*>>(p) + bytes\n\t);\n}\n\n\/\/\/ Aligns a pointer by moving it forward.\ntemplate<class T>\ninline T* pointer_align(T* p, u32 const align) noexcept {\n\tu32 const m = reinterpret_cast<std::uintptr_t>(p) % align;\n\tif (m) {\n\t\tp = pointer_add(p, align - m);\n\t}\n\treturn p;\n}\n\n\/\/\/ @}\n\n\/** @name Enum utilities *\/ \/\/\/ @{\n\n\/\/\/ Return true whether an enum value is non-zero.\ntemplate<class T>\ninline constexpr bool enum_bool(T const value) {\n\tstatic_assert(\n\t\tstd::is_enum<T>::value,\n\t\t\"T must be an enum\"\n\t);\n\treturn static_cast<typename std::underlying_type<T>::type>(value);\n}\n\n\/** @cond INTERNAL *\/\ntemplate<class FlagT, class = enable_if<enable_enum_bitwise_ops<FlagT>::value>>\ninline constexpr FlagT operator|(FlagT const& x, FlagT const& y) noexcept {\n\treturn static_cast<FlagT>(\n\t\tstatic_cast<unsigned>(x) | static_cast<unsigned>(y)\n\t);\n}\n\ntemplate<class FlagT, class = enable_if<enable_enum_bitwise_ops<FlagT>::value>>\ninline constexpr FlagT operator&(FlagT const& x, FlagT const& y) noexcept {\n\treturn static_cast<FlagT>(\n\t\tstatic_cast<unsigned>(x) & static_cast<unsigned>(y)\n\t);\n}\n\ntemplate<class FlagT, class = enable_if<enable_enum_bitwise_ops<FlagT>::value>>\ninline constexpr FlagT operator~(FlagT const& x) noexcept {\n\treturn static_cast<FlagT>(\n\t\t~static_cast<unsigned>(x)\n\t);\n}\n\ntemplate<class FlagT, class = enable_if<enable_enum_bitwise_ops<FlagT>::value>>\ninline constexpr FlagT& operator|=(FlagT& x, FlagT const& y) noexcept {\n\treturn x = static_cast<FlagT>(\n\t\tstatic_cast<unsigned>(x) | static_cast<unsigned>(y)\n\t);\n}\n\ntemplate<class FlagT, class = enable_if<enable_enum_bitwise_ops<FlagT>::value>>\ninline constexpr FlagT& operator&=(FlagT& x, FlagT const& y) noexcept {\n\treturn x = static_cast<FlagT>(\n\t\tstatic_cast<unsigned>(x) & static_cast<unsigned>(y)\n\t);\n}\n\/** @endcond *\/ \/\/ INTERNAL\n\n\/\/\/ @}\n\n\/** @name Collection utilities *\/ \/\/\/ @{\n\ntemplate<class T>\nstruct ArrayRef {\n\tT* _begin;\n\tT* _end;\n\n\tinline ArrayRef(T* const begin, T* const end)\n\t\t: _begin(begin)\n\t\t, _end(end)\n\t{}\n\n\ttemplate<class U, class = enable_if<std::is_convertible<U, T>::value>>\n\tinline ArrayRef(ArrayRef<U> const& other)\n\t\t: _begin(other._begin)\n\t\t, _end(other._end)\n\t{}\n\n\t\/\/\/ Number of items.\n\tunsigned size() const {\n\t\treturn _end - _begin;\n\t}\n};\n\n\/\/\/ Make reference to array.\ntemplate<class T>\ninline ArrayRef<T> array_ref(unsigned const size, T* const data) {\n\treturn ArrayRef<T>{data, data + size};\n}\n\n\/** @cond INTERNAL *\/\ntemplate<class T>\ninline T* begin(ArrayRef<T> const& ar) { return ar._begin; }\n\ntemplate<class T>\ninline T const* cbegin(ArrayRef<T> const& ar) { return ar._begin; }\n\ntemplate<class T>\ninline T* end(ArrayRef<T> const& ar) { return ar._end; }\n\ntemplate<class T>\ninline T const* cend(ArrayRef<T> const& ar) { return ar._end; }\n\/** @endcond *\/ \/\/ INTERNAL\n\n\/\/\/ @}\n\n\/** @} *\/ \/\/ end of doc-group utility\n\n} \/\/ namespace togo\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2012 - 2013 Jolla Ltd.\n** Contact: http:\/\/jolla.com\/\n**\n** This file is part of Qt Creator.\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** 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 Digia.\n**\n****************************************************************************\/\n\n#include \"command.h\"\n#include <QFile>\n#include <QDir>\n\nCommand::Command()\n{\n}\n\nCommand::~Command()\n{\n}\n\nQString Command::sharedHomePath() const\n{\n    return m_sharedHomePath;\n}\n\nvoid Command::setSharedHomePath(const QString& path)\n{\n    m_sharedHomePath = path;\n}\n\nQString Command::targetName() const\n{\n    return m_targetName;\n}\n\nvoid Command::setTargetName(const QString& name)\n{\n    m_targetName = name;\n}\n\nQString Command::sharedSourcePath() const\n{\n    return m_sharedSourcePath;\n}\n\nvoid Command::setSharedSourcePath(const QString& path)\n{\n    m_sharedSourcePath = path;\n}\n\nQString Command::sharedTargetPath() const\n{\n    return m_sharedSourcePath;\n}\n\nvoid Command::setSharedTargetPath(const QString& path)\n{\n    m_sharedSourcePath = path;\n}\n\nQString Command::sdkToolsPath() const\n{\n    return m_toolsPath;\n}\n\nvoid Command::setProjectPath(const QString& path)\n{\n    m_projectPath = path;\n}\n\nQString Command::projectPath() const\n{\n    return m_projectPath;\n}\n\nvoid Command::setSdkToolsPath(const QString& path)\n{\n    m_toolsPath = path;\n}\n\nvoid Command::setArguments(const QStringList &args)\n{\n    m_args.clear();\n    foreach (const QString& arg,args)\n        m_args.append(shellSafeArgument(arg));\n}\n\nQStringList Command::arguments() const\n{\n    return m_args;\n}\n\nvoid Command::setSshParameters(const QSsh::SshConnectionParameters& params)\n{\n    m_sshConnectionParams = params;\n}\n\nQSsh::SshConnectionParameters Command::sshParameters() const\n{\n    return m_sshConnectionParams;\n}\n\nQString Command::deviceName() const\n{\n    return m_deviceName;\n}\n\nvoid Command::setDeviceName(const QString& device)\n{\n    m_deviceName = device;\n}\n\nQString Command::shellSafeArgument(const QString &argument) const\n{\n    QString safeArgument = argument;\n    if (QFile::exists(safeArgument))\n        safeArgument = QDir::fromNativeSeparators(safeArgument);\n    if (safeArgument.indexOf(QLatin1Char(' ')) > -1)\n        safeArgument = QLatin1Char('\\'') + safeArgument + QLatin1Char('\\'');\n    return safeArgument;\n}\n\nQString Command::remotePathMapping(const QString& command) const\n{\n    QString result = command;\n\n    result.prepend(QLatin1String(\"cd '\") + QDir::currentPath()\n                   + QLatin1String(\"' && \"));\n\n    \/\/ First replace shared home and then shared src (error prone!)\n    if (!sharedHomePath().isEmpty())\n    result.replace(sharedHomePath(), QLatin1String(\"\/home\/mersdk\"));\n    if (!sharedSourcePath().isEmpty())\n        result.replace(sharedSourcePath(), QLatin1String(\"\/home\/src1\"));\n    result = result.trimmed();\n    return result;\n}\n\nbool Command::isValid() const\n{\n    const QString currentPath = QDir::currentPath();\n    const QString cleanSharedHome = QDir::fromNativeSeparators(QDir::cleanPath(sharedHomePath()));\n    const QString cleanSharedSrc = QDir::fromNativeSeparators(QDir::cleanPath(sharedSourcePath()));\n\n    if (!currentPath.startsWith(cleanSharedHome) && (sharedSourcePath().isEmpty() ||\n                                                     !currentPath.startsWith(cleanSharedSrc))) {\n        QString message = QString::fromLatin1(\"Project ERROR: Project is outside of shared home '%1' and shared src '%2'.\")\n                .arg(QDir::toNativeSeparators(sharedHomePath())).arg(QDir::toNativeSeparators(sharedSourcePath()));\n        fprintf(stderr, \"%s\", qPrintable(message));\n        fflush(stderr);\n        return false;\n    }\n    return true;\n}\n<commit_msg>Jolla: Make sure paths are qt style in merrssh<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2012 - 2013 Jolla Ltd.\n** Contact: http:\/\/jolla.com\/\n**\n** This file is part of Qt Creator.\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** 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 Digia.\n**\n****************************************************************************\/\n\n#include \"command.h\"\n#include <QFile>\n#include <QDir>\n\nCommand::Command()\n{\n}\n\nCommand::~Command()\n{\n}\n\nQString Command::sharedHomePath() const\n{\n    return m_sharedHomePath;\n}\n\nvoid Command::setSharedHomePath(const QString& path)\n{\n    m_sharedHomePath = QDir::fromNativeSeparators(path);\n}\n\nQString Command::targetName() const\n{\n    return m_targetName;\n}\n\nvoid Command::setTargetName(const QString& name)\n{\n    m_targetName = name;\n}\n\nQString Command::sharedSourcePath() const\n{\n    return m_sharedSourcePath;\n}\n\nvoid Command::setSharedSourcePath(const QString& path)\n{\n    m_sharedSourcePath = QDir::fromNativeSeparators(path);\n}\n\nQString Command::sharedTargetPath() const\n{\n    return m_sharedSourcePath;\n}\n\nvoid Command::setSharedTargetPath(const QString& path)\n{\n    m_sharedSourcePath = QDir::fromNativeSeparators(path);\n}\n\nQString Command::sdkToolsPath() const\n{\n    return m_toolsPath;\n}\n\nvoid Command::setProjectPath(const QString& path)\n{\n    m_projectPath =  QDir::fromNativeSeparators(path);\n}\n\nQString Command::projectPath() const\n{\n    return m_projectPath;\n}\n\nvoid Command::setSdkToolsPath(const QString& path)\n{\n    m_toolsPath = QDir::fromNativeSeparators(path);\n}\n\nvoid Command::setArguments(const QStringList &args)\n{\n    m_args.clear();\n    foreach (const QString& arg,args)\n        m_args.append(shellSafeArgument(arg));\n}\n\nQStringList Command::arguments() const\n{\n    return m_args;\n}\n\nvoid Command::setSshParameters(const QSsh::SshConnectionParameters& params)\n{\n    m_sshConnectionParams = params;\n}\n\nQSsh::SshConnectionParameters Command::sshParameters() const\n{\n    return m_sshConnectionParams;\n}\n\nQString Command::deviceName() const\n{\n    return m_deviceName;\n}\n\nvoid Command::setDeviceName(const QString& device)\n{\n    m_deviceName = device;\n}\n\nQString Command::shellSafeArgument(const QString &argument) const\n{\n    QString safeArgument = argument;\n    if (QFile::exists(safeArgument))\n        safeArgument = QDir::fromNativeSeparators(safeArgument);\n    if (safeArgument.indexOf(QLatin1Char(' ')) > -1)\n        safeArgument = QLatin1Char('\\'') + safeArgument + QLatin1Char('\\'');\n    return safeArgument;\n}\n\nQString Command::remotePathMapping(const QString& command) const\n{\n    QString result = command;\n\n    result.prepend(QLatin1String(\"cd '\") + QDir::currentPath()\n                   + QLatin1String(\"' && \"));\n\n    \/\/ First replace shared home and then shared src (error prone!)\n    if (!sharedHomePath().isEmpty())\n    result.replace(sharedHomePath(), QLatin1String(\"\/home\/mersdk\"));\n    if (!sharedSourcePath().isEmpty())\n        result.replace(sharedSourcePath(), QLatin1String(\"\/home\/src1\"));\n    result = result.trimmed();\n    return result;\n}\n\nbool Command::isValid() const\n{\n    const QString currentPath = QDir::currentPath();\n    const QString cleanSharedHome = QDir::fromNativeSeparators(QDir::cleanPath(sharedHomePath()));\n    const QString cleanSharedSrc = QDir::fromNativeSeparators(QDir::cleanPath(sharedSourcePath()));\n\n    if (!currentPath.startsWith(cleanSharedHome) && (sharedSourcePath().isEmpty() ||\n                                                     !currentPath.startsWith(cleanSharedSrc))) {\n        QString message = QString::fromLatin1(\"Project ERROR: Project is outside of shared home '%1' and shared src '%2'.\")\n                .arg(QDir::toNativeSeparators(sharedHomePath())).arg(QDir::toNativeSeparators(sharedSourcePath()));\n        fprintf(stderr, \"%s\", qPrintable(message));\n        fflush(stderr);\n        return false;\n    }\n    return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*! @file mix_stereo.cc\n *  @brief Mix audio channels together.\n *  @author Markovtsev Vadim <v.markovtsev@samsung.com>\n *  @version 1.0\n *\n *  @section Notes\n *  This code partially conforms to <a href=\"http:\/\/google-styleguide.googlecode.com\/svn\/trunk\/cppguide.xml\">Google C++ Style Guide<\/a>.\n *\n *  @section Copyright\n *  Copyright 2013 Samsung R&D Institute Russia\n *\/\n\n#include \"src\/transforms\/mix_stereo.h\"\n#ifdef __AVX__\n#include <immintrin.h>  \/\/ NOLINT(build\/include_order)\n#elif defined(__ARM_NEON__)\n#include <arm_neon.h>  \/\/ NOLINT(build\/include_order)\n#endif\n\nnamespace SoundFeatureExtraction {\nnamespace Transforms {\n\nsize_t MixStereo::OnFormatChanged(size_t buffersCount) {\n  outputFormat_->SetSize(inputFormat_->Size() \/ 2);\n  return buffersCount;\n}\n\nvoid MixStereo::Do(const int16_t* in, int16_t* out) const noexcept {\n  int length = inputFormat_->Size();\n  if (UseSimd()) {\n#ifdef __AVX__\n    for (int i = 0; i < length - 15; i += 16) {\n      __m128i vec1 = _mm_load_si128(\n          reinterpret_cast<const __m128i*>(in + i));\n      __m128i vec2 = _mm_load_si128(\n          reinterpret_cast<const __m128i*>(in + i + 8));\n      vec1 = _mm_srai_epi16(vec1, 1);\n      vec2 = _mm_srai_epi16(vec2, 1);\n      __m128i res = _mm_hadd_epi16(vec1, vec2);\n      _mm_store_si128(reinterpret_cast<__m128i*>(out + i \/ 2), res);\n    }\n    for (int i = (length & ~0xF); i < length; i += 2) {\n      int16_t l = in[i] \/ 2;\n      int16_t r = in[i + 1] \/ 2;\n      out[i \/ 2] = l + r;\n    }\n  } else {\n#elif defined(__ARM_NEON__)\n    for (int i = 0; i < length - 15; i += 16) {\n      int16x8x2_t vec = vld2q_s16(input + i);\n      int16x8_t res = vshrq_n_s16(vec.val[0], 1);\n      res = vsraq(res, vec.val[1], 1);\n      vst1q_s16(out + i \/ 2, res);\n    }\n    for (int i = (length & ~0xF); i < length; i += 2) {\n      int16_t l = in[i] \/ 2;\n      int16_t r = in[i + 1] \/ 2;\n      out[i \/ 2] = l + r;\n    }\n  } else {\n#else\n  } {\n#endif\n    for (int i = 0; i < length; i += 2) {\n      int16_t l = in[i] \/ 2;\n      int16_t r = in[i + 1] \/ 2;\n      out[i \/ 2] = l + r;\n    }\n  }\n}\n\n\nREGISTER_TRANSFORM(MixStereo);\n\n}  \/\/ namespace Transforms\n}  \/\/ namespace SoundFeatureExtraction\n<commit_msg>Fixed build on ARM<commit_after>\/*! @file mix_stereo.cc\n *  @brief Mix audio channels together.\n *  @author Markovtsev Vadim <v.markovtsev@samsung.com>\n *  @version 1.0\n *\n *  @section Notes\n *  This code partially conforms to <a href=\"http:\/\/google-styleguide.googlecode.com\/svn\/trunk\/cppguide.xml\">Google C++ Style Guide<\/a>.\n *\n *  @section Copyright\n *  Copyright 2013 Samsung R&D Institute Russia\n *\/\n\n#include \"src\/transforms\/mix_stereo.h\"\n#ifdef __AVX__\n#include <immintrin.h>  \/\/ NOLINT(build\/include_order)\n#elif defined(__ARM_NEON__)\n#include <arm_neon.h>  \/\/ NOLINT(build\/include_order)\n#endif\n\nnamespace SoundFeatureExtraction {\nnamespace Transforms {\n\nsize_t MixStereo::OnFormatChanged(size_t buffersCount) {\n  outputFormat_->SetSize(inputFormat_->Size() \/ 2);\n  return buffersCount;\n}\n\nvoid MixStereo::Do(const int16_t* in, int16_t* out) const noexcept {\n  int length = inputFormat_->Size();\n  if (UseSimd()) {\n#ifdef __AVX__\n    for (int i = 0; i < length - 15; i += 16) {\n      __m128i vec1 = _mm_load_si128(\n          reinterpret_cast<const __m128i*>(in + i));\n      __m128i vec2 = _mm_load_si128(\n          reinterpret_cast<const __m128i*>(in + i + 8));\n      vec1 = _mm_srai_epi16(vec1, 1);\n      vec2 = _mm_srai_epi16(vec2, 1);\n      __m128i res = _mm_hadd_epi16(vec1, vec2);\n      _mm_store_si128(reinterpret_cast<__m128i*>(out + i \/ 2), res);\n    }\n    for (int i = (length & ~0xF); i < length; i += 2) {\n      int16_t l = in[i] \/ 2;\n      int16_t r = in[i + 1] \/ 2;\n      out[i \/ 2] = l + r;\n    }\n  } else {\n#elif defined(__ARM_NEON__)\n    for (int i = 0; i < length - 15; i += 16) {\n      int16x8x2_t vec = vld2q_s16(in + i);\n      int16x8_t res = vshrq_n_s16(vec.val[0], 1);\n      res = vsraq_n_s16(res, vec.val[1], 1);\n      vst1q_s16(out + i \/ 2, res);\n    }\n    for (int i = (length & ~0xF); i < length; i += 2) {\n      int16_t l = in[i] \/ 2;\n      int16_t r = in[i + 1] \/ 2;\n      out[i \/ 2] = l + r;\n    }\n  } else {\n#else\n  } {\n#endif\n    for (int i = 0; i < length; i += 2) {\n      int16_t l = in[i] \/ 2;\n      int16_t r = in[i + 1] \/ 2;\n      out[i \/ 2] = l + r;\n    }\n  }\n}\n\n\nREGISTER_TRANSFORM(MixStereo);\n\n}  \/\/ namespace Transforms\n}  \/\/ namespace SoundFeatureExtraction\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, 2020 —\n            Vladimír Vondruš <mosra@centrum.cz>\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\/Array.h>\n#include <Corrade\/Containers\/StringView.h>\n#include <Corrade\/Utility\/Assert.h>\n#include <Corrade\/PluginManager\/Manager.h>\n#include <Magnum\/Magnum.h>\n#include <Magnum\/ImageView.h>\n#include <Magnum\/PixelFormat.h>\n#include <Magnum\/Math\/Color.h>\n#include <Magnum\/ShaderTools\/AbstractConverter.h>\n#include <Magnum\/Trade\/AbstractImageConverter.h>\n#include <Magnum\/Vk\/Assert.h>\n#include <Magnum\/Vk\/BufferCreateInfo.h>\n#include <Magnum\/Vk\/CommandBuffer.h>\n#include <Magnum\/Vk\/CommandPoolCreateInfo.h>\n#include <Magnum\/Vk\/DeviceCreateInfo.h>\n#include <Magnum\/Vk\/DeviceProperties.h>\n#include <Magnum\/Vk\/Fence.h>\n#include <Magnum\/Vk\/FramebufferCreateInfo.h>\n#include <Magnum\/Vk\/ImageCreateInfo.h>\n#include <Magnum\/Vk\/ImageViewCreateInfo.h>\n#include <Magnum\/Vk\/InstanceCreateInfo.h>\n#include <Magnum\/Vk\/Memory.h>\n#include <Magnum\/Vk\/Queue.h>\n#include <Magnum\/Vk\/RenderPassCreateInfo.h>\n#include <Magnum\/Vk\/ShaderCreateInfo.h>\n#include <MagnumExternal\/Vulkan\/flextVkGlobal.h>\n\nusing namespace Corrade::Containers::Literals;\nusing namespace Magnum;\nusing namespace Magnum::Math::Literals;\n\nint main(int argc, char** argv) {\n    \/* Create an instance *\/\n    Vk::Instance instance{Vk::InstanceCreateInfo{argc, argv}\n        .setApplicationInfo(\"Magnum Vulkan Triangle Example\"_s, {})};\n\n    \/* Create a device with a graphics queue *\/\n    Vk::Queue queue{NoCreate};\n    Vk::Device device{instance, Vk::DeviceCreateInfo{Vk::pickDevice(instance)}\n        .addQueues(Vk::QueueFlag::Graphics, {0.0f}, {queue})};\n\n    \/* Allocate a command buffer *\/\n    Vk::CommandPool commandPool{device, Vk::CommandPoolCreateInfo{\n        device.properties().pickQueueFamily(Vk::QueueFlag::Graphics)}};\n    Vk::CommandBuffer cmd = commandPool.allocate();\n\n    device.populateGlobalFunctionPointers();\n\n    \/* Render pass *\/\n    Vk::RenderPass renderPass{device, Vk::RenderPassCreateInfo{}\n        .setAttachments({\n            {VK_FORMAT_R8G8B8A8_SRGB, Vk::AttachmentLoadOperation::Clear, {}}\n        })\n        .addSubpass(Vk::SubpassDescription{}\n            .setColorAttachments({0})\n        )\n    };\n\n    \/* Framebuffer image. Allocate with linear tiling as we want to download it\n       later. *\/\n    Vk::Image image{NoCreate};\n    {\n        Vk::ImageCreateInfo2D info{Vk::ImageUsage::ColorAttachment,\n        VK_FORMAT_R8G8B8A8_SRGB, {800, 600}, 1};\n        info->tiling = VK_IMAGE_TILING_LINEAR;\n        image = Vk::Image{device, info, Vk::MemoryFlag::HostVisible};\n    }\n\n    Vk::ImageView color{device, Vk::ImageViewCreateInfo2D{image}};\n\n    \/* Vertex buffer *\/\n    Vk::Buffer buffer{device, Vk::BufferCreateInfo{\n            Vk::BufferUsage::VertexBuffer,\n            3*2*4*4 \/* Three vertices, each is four-element pos & color *\/\n        }, Vk::MemoryFlag::HostVisible};\n    {\n        \/* Fill the data *\/\n        \/** @todo arrayCast for an array rvalue *\/\n        Containers::Array<char, Vk::MemoryMapDeleter> data = buffer.dedicatedMemory().map();\n        auto view = Containers::arrayCast<Vector4>(data);\n        view[0] = {-0.5f, -0.5f, 0.0f, 1.0f}; \/* Left vertex, red color *\/\n        view[1] = 0xff0000ff_srgbaf;\n        view[2] = { 0.5f, -0.5f, 0.0f, 1.0f}; \/* Right vertex, green color *\/\n        view[3] = 0x00ff00ff_srgbaf;\n        view[4] = { 0.0f,  0.5f, 0.0f, 1.0f}; \/* Top vertex, blue color *\/\n        view[5] = 0x0000ffff_srgbaf;\n    }\n\n    \/* Framebuffer *\/\n    Vk::Framebuffer framebuffer{device, Vk::FramebufferCreateInfo{renderPass, {\n        color\n    }, {800, 600}}};\n\n    \/* Create the shader *\/\n    constexpr Containers::StringView assembly = R\"(\n               OpCapability Shader\n               OpMemoryModel Logical GLSL450\n\n; Function %1 is vertex shader and has %12, %13 as input and %15, %16 as output\n               OpEntryPoint Vertex %1 \"ver\" %12 %13 %gl_Position %16\n; Function %2 is fragment shader and has %5 as input and %6 as output\n               OpEntryPoint Fragment %2 \"fra\" %5 %6\n\n; Input\/output layouts\n               OpDecorate %12 Location 0\n               OpDecorate %13 Location 1\n               OpDecorate %gl_Position BuiltIn Position\n               OpDecorate %16 Location 0\n               OpDecorate %5 Location 0\n               OpDecorate %6 Location 0\n\n; Types\n       %void = OpTypeVoid\n          %8 = OpTypeFunction %void\n      %float = OpTypeFloat 32\n    %v4float = OpTypeVector %float 4\n%_ptr_Input_v4float = OpTypePointer Input %v4float\n         %12 = OpVariable %_ptr_Input_v4float Input\n         %13 = OpVariable %_ptr_Input_v4float Input\n%_ptr_Output_v4float = OpTypePointer Output %v4float\n%gl_Position = OpVariable %_ptr_Output_v4float Output\n         %16 = OpVariable %_ptr_Output_v4float Output\n          %5 = OpVariable %_ptr_Input_v4float Input\n          %6 = OpVariable %_ptr_Output_v4float Output\n\n; %1 = void ver()\n          %1 = OpFunction %void None %8\n         %33 = OpLabel\n         %30 = OpLoad %v4float %12\n         %31 = OpLoad %v4float %13\n               OpStore %gl_Position %30\n               OpStore %16 %31\n               OpReturn\n               OpFunctionEnd\n\n; %2 = void fra()\n          %2 = OpFunction %void None %8\n         %34 = OpLabel\n         %32 = OpLoad %v4float %5\n               OpStore %6 %32\n               OpReturn\n               OpFunctionEnd\n)\"_s;\n    Vk::Shader shader{device, Vk::ShaderCreateInfo{\n        CORRADE_INTERNAL_ASSERT_EXPRESSION(CORRADE_INTERNAL_ASSERT_EXPRESSION(\n            PluginManager::Manager<ShaderTools::AbstractConverter>{}.loadAndInstantiate(\"SpirvAssemblyToSpirvShaderConverter\")\n        )->convertDataToData({}, assembly))}};\n\n    \/* Pipeline layout *\/\n    VkPipelineLayout pipelineLayout;\n    {\n        VkPipelineLayoutCreateInfo info{};\n        info.sType = VK_STRUCTURE_TYPE_PIPELINE_LAYOUT_CREATE_INFO;\n        info.setLayoutCount = 0;\n        info.pushConstantRangeCount = 0;\n        MAGNUM_VK_INTERNAL_ASSERT_SUCCESS(vkCreatePipelineLayout(device, &info, nullptr, &pipelineLayout));\n    }\n\n    \/* Create a graphics pipeline *\/\n    VkPipeline pipeline;\n    {\n        VkVertexInputBindingDescription binding{};\n        binding.binding = 0;\n        binding.stride = 2*4*4;\n\n        VkVertexInputAttributeDescription attributes[2]{};\n        attributes[0].location = 0; \/* position attribute *\/\n        attributes[0].binding = binding.binding;\n        attributes[0].format = VK_FORMAT_R32G32B32A32_SFLOAT;\n        attributes[0].offset = 0;\n        attributes[1].location = 1; \/* color attribute *\/\n        attributes[1].binding = binding.binding;\n        attributes[1].format = VK_FORMAT_R32G32B32A32_SFLOAT;\n        attributes[1].offset = 4*4;\n\n        VkPipelineVertexInputStateCreateInfo vertexInputInfo{};\n        vertexInputInfo.sType = VK_STRUCTURE_TYPE_PIPELINE_VERTEX_INPUT_STATE_CREATE_INFO;\n        vertexInputInfo.vertexBindingDescriptionCount = 1;\n        vertexInputInfo.pVertexBindingDescriptions = &binding;\n        vertexInputInfo.vertexAttributeDescriptionCount = 2;\n        vertexInputInfo.pVertexAttributeDescriptions = attributes;\n\n        VkPipelineInputAssemblyStateCreateInfo inputAssemblyInfo{};\n        inputAssemblyInfo.sType = VK_STRUCTURE_TYPE_PIPELINE_INPUT_ASSEMBLY_STATE_CREATE_INFO;\n        inputAssemblyInfo.topology = VK_PRIMITIVE_TOPOLOGY_TRIANGLE_LIST;\n\n        VkViewport viewport{};\n        viewport.width = 800.0f;\n        viewport.height = 600.0f;\n        viewport.maxDepth = 1.0f;\n\n        VkRect2D scissor{{}, {800, 600}};\n\n        VkPipelineViewportStateCreateInfo viewportInfo{};\n        viewportInfo.sType = VK_STRUCTURE_TYPE_PIPELINE_VIEWPORT_STATE_CREATE_INFO;\n        viewportInfo.viewportCount = 1;\n        viewportInfo.pViewports = &viewport;\n        viewportInfo.scissorCount = 1;\n        viewportInfo.pScissors = &scissor;\n\n        VkPipelineRasterizationStateCreateInfo rasterizationInfo{};\n        rasterizationInfo.sType = VK_STRUCTURE_TYPE_PIPELINE_RASTERIZATION_STATE_CREATE_INFO;\n        rasterizationInfo.lineWidth = 1.0f;\n        \/* the zero-filled defaults are good enough apparently *\/\n\n        VkPipelineMultisampleStateCreateInfo multisampleInfo{};\n        multisampleInfo.sType = VK_STRUCTURE_TYPE_PIPELINE_MULTISAMPLE_STATE_CREATE_INFO;\n        multisampleInfo.rasterizationSamples = VK_SAMPLE_COUNT_1_BIT;\n\n        VkPipelineColorBlendAttachmentState blend{};\n        blend.colorWriteMask = VK_COLOR_COMPONENT_R_BIT|\n                               VK_COLOR_COMPONENT_G_BIT|\n                               VK_COLOR_COMPONENT_B_BIT|\n                               VK_COLOR_COMPONENT_A_BIT;\n        VkPipelineColorBlendStateCreateInfo colorBlendInfo{};\n        colorBlendInfo.sType = VK_STRUCTURE_TYPE_PIPELINE_COLOR_BLEND_STATE_CREATE_INFO;\n        colorBlendInfo.attachmentCount = 1;\n        colorBlendInfo.pAttachments = &blend;\n\n        VkPipelineShaderStageCreateInfo stages[2]{};\n        stages[0].sType = VK_STRUCTURE_TYPE_PIPELINE_SHADER_STAGE_CREATE_INFO;\n        stages[0].stage = VK_SHADER_STAGE_VERTEX_BIT;\n        stages[0].module = shader;\n        stages[0].pName = \"ver\";\n        stages[1].sType = VK_STRUCTURE_TYPE_PIPELINE_SHADER_STAGE_CREATE_INFO;\n        stages[1].stage = VK_SHADER_STAGE_FRAGMENT_BIT;\n        stages[1].module = shader;\n        stages[1].pName = \"fra\";\n\n        VkGraphicsPipelineCreateInfo info{};\n        info.sType = VK_STRUCTURE_TYPE_GRAPHICS_PIPELINE_CREATE_INFO;\n        info.stageCount = 2;\n        info.pStages = stages;\n        info.pVertexInputState = &vertexInputInfo;\n        info.pInputAssemblyState = &inputAssemblyInfo;\n        info.pViewportState = &viewportInfo;\n        info.pRasterizationState = &rasterizationInfo;\n        info.pMultisampleState = &multisampleInfo;\n        info.pColorBlendState = &colorBlendInfo;\n        info.layout = pipelineLayout;\n        info.renderPass = renderPass;\n        info.subpass = 0;\n        MAGNUM_VK_INTERNAL_ASSERT_SUCCESS(vkCreateGraphicsPipelines(device, nullptr, 1, &info, nullptr, &pipeline));\n    }\n\n    \/* Begin recording *\/\n    cmd.begin();\n\n    \/* Convert the image to the proper layout *\/\n    {\n        VkImageMemoryBarrier barrier{};\n        barrier.sType = VK_STRUCTURE_TYPE_IMAGE_MEMORY_BARRIER;\n        barrier.dstAccessMask = VK_ACCESS_COLOR_ATTACHMENT_WRITE_BIT;\n        barrier.oldLayout = VK_IMAGE_LAYOUT_UNDEFINED;\n        barrier.newLayout = VK_IMAGE_LAYOUT_GENERAL;\n        barrier.srcQueueFamilyIndex = VK_QUEUE_FAMILY_IGNORED;\n        barrier.dstQueueFamilyIndex = VK_QUEUE_FAMILY_IGNORED;\n        barrier.image = image;\n        barrier.subresourceRange.aspectMask = VK_IMAGE_ASPECT_COLOR_BIT;\n        barrier.subresourceRange.baseMipLevel = 0;\n        barrier.subresourceRange.levelCount = 1;\n        barrier.subresourceRange.baseArrayLayer = 0;\n        barrier.subresourceRange.layerCount = 1;\n        vkCmdPipelineBarrier(cmd, VK_PIPELINE_STAGE_ALL_COMMANDS_BIT, VK_PIPELINE_STAGE_ALL_COMMANDS_BIT, 0, 0, nullptr, 0, nullptr, 1, &barrier);\n    }\n\n    \/* Begin a render pass *\/\n    cmd.beginRenderPass(Vk::RenderPassBeginInfo{renderPass, framebuffer}\n           .clearColor(0, 0x1f1f1f_srgbf));\n\n    \/* Bind the pipeline *\/\n    vkCmdBindPipeline(cmd, VK_PIPELINE_BIND_POINT_GRAPHICS, pipeline);\n\n    \/* Bind the vertex buffer *\/\n    {\n        const VkDeviceSize offset = 0;\n        const VkBuffer handle = buffer;\n        vkCmdBindVertexBuffers(cmd, 0, 1, &handle, &offset);\n    }\n\n    \/* Draw the triangle *\/\n    vkCmdDraw(cmd, 3, 1, 0, 0);\n\n    \/* End recording *\/\n    cmd.endRenderPass()\n       .end();\n\n    \/* Submit the command buffer and wait until done *\/\n    Vk::Fence fence{device};\n    queue.submit({Vk::SubmitInfo{}.setCommandBuffers({cmd})}, fence);\n    fence.wait();\n\n    \/* Read the image back *\/\n    CORRADE_INTERNAL_ASSERT_EXPRESSION(\n        PluginManager::Manager<Trade::AbstractImageConverter>{}\n            .loadAndInstantiate(\"AnyImageConverter\")\n    )->exportToFile(ImageView2D{\n        PixelFormat::RGBA8Unorm, {800, 600},\n        image.dedicatedMemory().mapRead()}, \"image.png\");\n    Debug{} << \"Saved an image to image.png\";\n\n    \/* Clean up *\/\n    vkDestroyPipeline(device, pipeline, nullptr);\n    vkDestroyPipelineLayout(device, pipelineLayout, nullptr);\n}\n<commit_msg>triangle-vulkan: we can use sane pixel format names now!<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, 2020 —\n            Vladimír Vondruš <mosra@centrum.cz>\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\/Array.h>\n#include <Corrade\/Containers\/StringView.h>\n#include <Corrade\/Utility\/Assert.h>\n#include <Corrade\/PluginManager\/Manager.h>\n#include <Magnum\/Magnum.h>\n#include <Magnum\/ImageView.h>\n#include <Magnum\/PixelFormat.h>\n#include <Magnum\/Math\/Color.h>\n#include <Magnum\/ShaderTools\/AbstractConverter.h>\n#include <Magnum\/Trade\/AbstractImageConverter.h>\n#include <Magnum\/Vk\/Assert.h>\n#include <Magnum\/Vk\/BufferCreateInfo.h>\n#include <Magnum\/Vk\/CommandBuffer.h>\n#include <Magnum\/Vk\/CommandPoolCreateInfo.h>\n#include <Magnum\/Vk\/DeviceCreateInfo.h>\n#include <Magnum\/Vk\/DeviceProperties.h>\n#include <Magnum\/Vk\/Fence.h>\n#include <Magnum\/Vk\/FramebufferCreateInfo.h>\n#include <Magnum\/Vk\/ImageCreateInfo.h>\n#include <Magnum\/Vk\/ImageViewCreateInfo.h>\n#include <Magnum\/Vk\/InstanceCreateInfo.h>\n#include <Magnum\/Vk\/Memory.h>\n#include <Magnum\/Vk\/Queue.h>\n#include <Magnum\/Vk\/RenderPassCreateInfo.h>\n#include <Magnum\/Vk\/ShaderCreateInfo.h>\n#include <MagnumExternal\/Vulkan\/flextVkGlobal.h>\n\nusing namespace Corrade::Containers::Literals;\nusing namespace Magnum;\nusing namespace Magnum::Math::Literals;\n\nint main(int argc, char** argv) {\n    \/* Create an instance *\/\n    Vk::Instance instance{Vk::InstanceCreateInfo{argc, argv}\n        .setApplicationInfo(\"Magnum Vulkan Triangle Example\"_s, {})};\n\n    \/* Create a device with a graphics queue *\/\n    Vk::Queue queue{NoCreate};\n    Vk::Device device{instance, Vk::DeviceCreateInfo{Vk::pickDevice(instance)}\n        .addQueues(Vk::QueueFlag::Graphics, {0.0f}, {queue})};\n\n    \/* Allocate a command buffer *\/\n    Vk::CommandPool commandPool{device, Vk::CommandPoolCreateInfo{\n        device.properties().pickQueueFamily(Vk::QueueFlag::Graphics)}};\n    Vk::CommandBuffer cmd = commandPool.allocate();\n\n    device.populateGlobalFunctionPointers();\n\n    \/* Render pass *\/\n    Vk::RenderPass renderPass{device, Vk::RenderPassCreateInfo{}\n        .setAttachments({\n            {PixelFormat::RGBA8Srgb, Vk::AttachmentLoadOperation::Clear, {}}\n        })\n        .addSubpass(Vk::SubpassDescription{}\n            .setColorAttachments({0})\n        )\n    };\n\n    \/* Framebuffer image. Allocate with linear tiling as we want to download it\n       later. *\/\n    Vk::Image image{NoCreate};\n    {\n        Vk::ImageCreateInfo2D info{Vk::ImageUsage::ColorAttachment,\n            PixelFormat::RGBA8Srgb, {800, 600}, 1};\n        info->tiling = VK_IMAGE_TILING_LINEAR;\n        image = Vk::Image{device, info, Vk::MemoryFlag::HostVisible};\n    }\n\n    Vk::ImageView color{device, Vk::ImageViewCreateInfo2D{image}};\n\n    \/* Vertex buffer *\/\n    Vk::Buffer buffer{device, Vk::BufferCreateInfo{\n            Vk::BufferUsage::VertexBuffer,\n            3*2*4*4 \/* Three vertices, each is four-element pos & color *\/\n        }, Vk::MemoryFlag::HostVisible};\n    {\n        \/* Fill the data *\/\n        \/** @todo arrayCast for an array rvalue *\/\n        Containers::Array<char, Vk::MemoryMapDeleter> data = buffer.dedicatedMemory().map();\n        auto view = Containers::arrayCast<Vector4>(data);\n        view[0] = {-0.5f, -0.5f, 0.0f, 1.0f}; \/* Left vertex, red color *\/\n        view[1] = 0xff0000ff_srgbaf;\n        view[2] = { 0.5f, -0.5f, 0.0f, 1.0f}; \/* Right vertex, green color *\/\n        view[3] = 0x00ff00ff_srgbaf;\n        view[4] = { 0.0f,  0.5f, 0.0f, 1.0f}; \/* Top vertex, blue color *\/\n        view[5] = 0x0000ffff_srgbaf;\n    }\n\n    \/* Framebuffer *\/\n    Vk::Framebuffer framebuffer{device, Vk::FramebufferCreateInfo{renderPass, {\n        color\n    }, {800, 600}}};\n\n    \/* Create the shader *\/\n    constexpr Containers::StringView assembly = R\"(\n               OpCapability Shader\n               OpMemoryModel Logical GLSL450\n\n; Function %1 is vertex shader and has %12, %13 as input and %15, %16 as output\n               OpEntryPoint Vertex %1 \"ver\" %12 %13 %gl_Position %16\n; Function %2 is fragment shader and has %5 as input and %6 as output\n               OpEntryPoint Fragment %2 \"fra\" %5 %6\n\n; Input\/output layouts\n               OpDecorate %12 Location 0\n               OpDecorate %13 Location 1\n               OpDecorate %gl_Position BuiltIn Position\n               OpDecorate %16 Location 0\n               OpDecorate %5 Location 0\n               OpDecorate %6 Location 0\n\n; Types\n       %void = OpTypeVoid\n          %8 = OpTypeFunction %void\n      %float = OpTypeFloat 32\n    %v4float = OpTypeVector %float 4\n%_ptr_Input_v4float = OpTypePointer Input %v4float\n         %12 = OpVariable %_ptr_Input_v4float Input\n         %13 = OpVariable %_ptr_Input_v4float Input\n%_ptr_Output_v4float = OpTypePointer Output %v4float\n%gl_Position = OpVariable %_ptr_Output_v4float Output\n         %16 = OpVariable %_ptr_Output_v4float Output\n          %5 = OpVariable %_ptr_Input_v4float Input\n          %6 = OpVariable %_ptr_Output_v4float Output\n\n; %1 = void ver()\n          %1 = OpFunction %void None %8\n         %33 = OpLabel\n         %30 = OpLoad %v4float %12\n         %31 = OpLoad %v4float %13\n               OpStore %gl_Position %30\n               OpStore %16 %31\n               OpReturn\n               OpFunctionEnd\n\n; %2 = void fra()\n          %2 = OpFunction %void None %8\n         %34 = OpLabel\n         %32 = OpLoad %v4float %5\n               OpStore %6 %32\n               OpReturn\n               OpFunctionEnd\n)\"_s;\n    Vk::Shader shader{device, Vk::ShaderCreateInfo{\n        CORRADE_INTERNAL_ASSERT_EXPRESSION(CORRADE_INTERNAL_ASSERT_EXPRESSION(\n            PluginManager::Manager<ShaderTools::AbstractConverter>{}.loadAndInstantiate(\"SpirvAssemblyToSpirvShaderConverter\")\n        )->convertDataToData({}, assembly))}};\n\n    \/* Pipeline layout *\/\n    VkPipelineLayout pipelineLayout;\n    {\n        VkPipelineLayoutCreateInfo info{};\n        info.sType = VK_STRUCTURE_TYPE_PIPELINE_LAYOUT_CREATE_INFO;\n        info.setLayoutCount = 0;\n        info.pushConstantRangeCount = 0;\n        MAGNUM_VK_INTERNAL_ASSERT_SUCCESS(vkCreatePipelineLayout(device, &info, nullptr, &pipelineLayout));\n    }\n\n    \/* Create a graphics pipeline *\/\n    VkPipeline pipeline;\n    {\n        VkVertexInputBindingDescription binding{};\n        binding.binding = 0;\n        binding.stride = 2*4*4;\n\n        VkVertexInputAttributeDescription attributes[2]{};\n        attributes[0].location = 0; \/* position attribute *\/\n        attributes[0].binding = binding.binding;\n        attributes[0].format = VK_FORMAT_R32G32B32A32_SFLOAT;\n        attributes[0].offset = 0;\n        attributes[1].location = 1; \/* color attribute *\/\n        attributes[1].binding = binding.binding;\n        attributes[1].format = VK_FORMAT_R32G32B32A32_SFLOAT;\n        attributes[1].offset = 4*4;\n\n        VkPipelineVertexInputStateCreateInfo vertexInputInfo{};\n        vertexInputInfo.sType = VK_STRUCTURE_TYPE_PIPELINE_VERTEX_INPUT_STATE_CREATE_INFO;\n        vertexInputInfo.vertexBindingDescriptionCount = 1;\n        vertexInputInfo.pVertexBindingDescriptions = &binding;\n        vertexInputInfo.vertexAttributeDescriptionCount = 2;\n        vertexInputInfo.pVertexAttributeDescriptions = attributes;\n\n        VkPipelineInputAssemblyStateCreateInfo inputAssemblyInfo{};\n        inputAssemblyInfo.sType = VK_STRUCTURE_TYPE_PIPELINE_INPUT_ASSEMBLY_STATE_CREATE_INFO;\n        inputAssemblyInfo.topology = VK_PRIMITIVE_TOPOLOGY_TRIANGLE_LIST;\n\n        VkViewport viewport{};\n        viewport.width = 800.0f;\n        viewport.height = 600.0f;\n        viewport.maxDepth = 1.0f;\n\n        VkRect2D scissor{{}, {800, 600}};\n\n        VkPipelineViewportStateCreateInfo viewportInfo{};\n        viewportInfo.sType = VK_STRUCTURE_TYPE_PIPELINE_VIEWPORT_STATE_CREATE_INFO;\n        viewportInfo.viewportCount = 1;\n        viewportInfo.pViewports = &viewport;\n        viewportInfo.scissorCount = 1;\n        viewportInfo.pScissors = &scissor;\n\n        VkPipelineRasterizationStateCreateInfo rasterizationInfo{};\n        rasterizationInfo.sType = VK_STRUCTURE_TYPE_PIPELINE_RASTERIZATION_STATE_CREATE_INFO;\n        rasterizationInfo.lineWidth = 1.0f;\n        \/* the zero-filled defaults are good enough apparently *\/\n\n        VkPipelineMultisampleStateCreateInfo multisampleInfo{};\n        multisampleInfo.sType = VK_STRUCTURE_TYPE_PIPELINE_MULTISAMPLE_STATE_CREATE_INFO;\n        multisampleInfo.rasterizationSamples = VK_SAMPLE_COUNT_1_BIT;\n\n        VkPipelineColorBlendAttachmentState blend{};\n        blend.colorWriteMask = VK_COLOR_COMPONENT_R_BIT|\n                               VK_COLOR_COMPONENT_G_BIT|\n                               VK_COLOR_COMPONENT_B_BIT|\n                               VK_COLOR_COMPONENT_A_BIT;\n        VkPipelineColorBlendStateCreateInfo colorBlendInfo{};\n        colorBlendInfo.sType = VK_STRUCTURE_TYPE_PIPELINE_COLOR_BLEND_STATE_CREATE_INFO;\n        colorBlendInfo.attachmentCount = 1;\n        colorBlendInfo.pAttachments = &blend;\n\n        VkPipelineShaderStageCreateInfo stages[2]{};\n        stages[0].sType = VK_STRUCTURE_TYPE_PIPELINE_SHADER_STAGE_CREATE_INFO;\n        stages[0].stage = VK_SHADER_STAGE_VERTEX_BIT;\n        stages[0].module = shader;\n        stages[0].pName = \"ver\";\n        stages[1].sType = VK_STRUCTURE_TYPE_PIPELINE_SHADER_STAGE_CREATE_INFO;\n        stages[1].stage = VK_SHADER_STAGE_FRAGMENT_BIT;\n        stages[1].module = shader;\n        stages[1].pName = \"fra\";\n\n        VkGraphicsPipelineCreateInfo info{};\n        info.sType = VK_STRUCTURE_TYPE_GRAPHICS_PIPELINE_CREATE_INFO;\n        info.stageCount = 2;\n        info.pStages = stages;\n        info.pVertexInputState = &vertexInputInfo;\n        info.pInputAssemblyState = &inputAssemblyInfo;\n        info.pViewportState = &viewportInfo;\n        info.pRasterizationState = &rasterizationInfo;\n        info.pMultisampleState = &multisampleInfo;\n        info.pColorBlendState = &colorBlendInfo;\n        info.layout = pipelineLayout;\n        info.renderPass = renderPass;\n        info.subpass = 0;\n        MAGNUM_VK_INTERNAL_ASSERT_SUCCESS(vkCreateGraphicsPipelines(device, nullptr, 1, &info, nullptr, &pipeline));\n    }\n\n    \/* Begin recording *\/\n    cmd.begin();\n\n    \/* Convert the image to the proper layout *\/\n    {\n        VkImageMemoryBarrier barrier{};\n        barrier.sType = VK_STRUCTURE_TYPE_IMAGE_MEMORY_BARRIER;\n        barrier.dstAccessMask = VK_ACCESS_COLOR_ATTACHMENT_WRITE_BIT;\n        barrier.oldLayout = VK_IMAGE_LAYOUT_UNDEFINED;\n        barrier.newLayout = VK_IMAGE_LAYOUT_GENERAL;\n        barrier.srcQueueFamilyIndex = VK_QUEUE_FAMILY_IGNORED;\n        barrier.dstQueueFamilyIndex = VK_QUEUE_FAMILY_IGNORED;\n        barrier.image = image;\n        barrier.subresourceRange.aspectMask = VK_IMAGE_ASPECT_COLOR_BIT;\n        barrier.subresourceRange.baseMipLevel = 0;\n        barrier.subresourceRange.levelCount = 1;\n        barrier.subresourceRange.baseArrayLayer = 0;\n        barrier.subresourceRange.layerCount = 1;\n        vkCmdPipelineBarrier(cmd, VK_PIPELINE_STAGE_ALL_COMMANDS_BIT, VK_PIPELINE_STAGE_ALL_COMMANDS_BIT, 0, 0, nullptr, 0, nullptr, 1, &barrier);\n    }\n\n    \/* Begin a render pass *\/\n    cmd.beginRenderPass(Vk::RenderPassBeginInfo{renderPass, framebuffer}\n           .clearColor(0, 0x1f1f1f_srgbf));\n\n    \/* Bind the pipeline *\/\n    vkCmdBindPipeline(cmd, VK_PIPELINE_BIND_POINT_GRAPHICS, pipeline);\n\n    \/* Bind the vertex buffer *\/\n    {\n        const VkDeviceSize offset = 0;\n        const VkBuffer handle = buffer;\n        vkCmdBindVertexBuffers(cmd, 0, 1, &handle, &offset);\n    }\n\n    \/* Draw the triangle *\/\n    vkCmdDraw(cmd, 3, 1, 0, 0);\n\n    \/* End recording *\/\n    cmd.endRenderPass()\n       .end();\n\n    \/* Submit the command buffer and wait until done *\/\n    Vk::Fence fence{device};\n    queue.submit({Vk::SubmitInfo{}.setCommandBuffers({cmd})}, fence);\n    fence.wait();\n\n    \/* Read the image back *\/\n    CORRADE_INTERNAL_ASSERT_EXPRESSION(\n        PluginManager::Manager<Trade::AbstractImageConverter>{}\n            .loadAndInstantiate(\"AnyImageConverter\")\n    )->exportToFile(ImageView2D{\n        PixelFormat::RGBA8Unorm, {800, 600},\n        image.dedicatedMemory().mapRead()}, \"image.png\");\n    Debug{} << \"Saved an image to image.png\";\n\n    \/* Clean up *\/\n    vkDestroyPipeline(device, pipeline, nullptr);\n    vkDestroyPipelineLayout(device, pipelineLayout, nullptr);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ CDFRequestHandler.cc\n\n\/\/ -*- mode: c++; c-basic-offset:4 -*-\n\n\/\/ This file is part of cdf_handler, a C++ server of OPeNDAP for access to cdf\n\/\/ data\n\n\/\/ Copyright (c) 2004,2005 University Corporation for Atmospheric Research\n\/\/ Author: Patrick West <pwest@ucar.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., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA\n\/\/\n\/\/ You can contact University Corporation for Atmospheric Research at\n\/\/ 3080 Center Green Drive, Boulder, CO 80301\n \n\/\/ (c) COPYRIGHT University Corporation for Atmostpheric Research 2004-2005\n\/\/ Please read the full copyright statement in the file COPYRIGHT_UCAR.\n\/\/\n\/\/ Authors:\n\/\/      pwest       Patrick West <pwest@ucar.edu>\n \n#ifdef __GNUG__\n#pragma implementation\n#endif\n\n#include <iostream>\n#include <fstream>\n\nusing std::ifstream ;\nusing std::cerr ;\nusing std::endl ;\n\n#include \"CDFRequestHandler.h\"\n#include \"CDFTypeFactory.h\"\n#include \"BESResponseHandler.h\"\n#include \"BESResponseNames.h\"\n#include \"BESDataNames.h\"\n#include \"CDFreadAttributes.h\"\n#include \"BESDASResponse.h\"\n#include \"CDFreadDescriptors.h\"\n#include \"BESDDSResponse.h\"\n#include \"BESDataDDSResponse.h\"\n#include \"BESConstraintFuncs.h\"\n#include \"BESVersionInfo.h\"\n#include \"TheBESKeys.h\"\n#include \"BESInternalError.h\"\n#include \"Ancillary.h\"\n#include \"config_cdf.h\"\n\nCDFRequestHandler::CDFRequestHandler( const string &name )\n    : BESRequestHandler( name )\n{\n    add_handler( DAS_RESPONSE, CDFRequestHandler::cdf_build_das ) ;\n    add_handler( DDS_RESPONSE, CDFRequestHandler::cdf_build_dds ) ;\n    add_handler( DATA_RESPONSE, CDFRequestHandler::cdf_build_data ) ;\n    add_handler( HELP_RESPONSE, CDFRequestHandler::cdf_build_help ) ;\n    add_handler( VERS_RESPONSE, CDFRequestHandler::cdf_build_version ) ;\n}\n\nCDFRequestHandler::~CDFRequestHandler()\n{\n}\n\nbool\nCDFRequestHandler::cdf_build_das( BESDataHandlerInterface &dhi )\n{\n    BESResponseObject *response =\n        dhi.response_handler->get_response_object() ;\n    BESDASResponse *bdas = dynamic_cast < BESDASResponse * >(response) ;\n    DAS *das = 0 ;\n    if (bdas)\n\tdas = bdas->get_das() ;\n    else\n\tthrow BESInternalError( \"cast error\", __FILE__, __LINE__ ) ;\n\n    \/\/ read the attributes for this container, including ancillary\n    \/\/ attributes\n    string accessed = dhi.container->access() ;\n    if( !readAttributes( *das, accessed ) )\n    {\n\tstring s = \"CDF could not build the DAS response\" ;\n\tthrow BESInternalError( s, __FILE__, __LINE__ ) ;\n    }\n\n    Ancillary::read_ancillary_das( *das, accessed ) ;\n\n    return true ;\n}\n\nbool\nCDFRequestHandler::cdf_build_dds( BESDataHandlerInterface &dhi )\n{\n    BESResponseObject *response =\n        dhi.response_handler->get_response_object();\n    BESDDSResponse *bdds = dynamic_cast < BESDDSResponse * >(response);\n    DDS *dds = 0 ;\n    if (bdds)\n\tdds = bdds->get_dds();\n    else\n\tthrow BESInternalError( \"cast error\", __FILE__, __LINE__ ) ;\n  \n\n    \/\/ read the data structure including any ancillary structure\n    CDFTypeFactory *factory = new CDFTypeFactory ;\n    dds->set_factory( factory ) ;\n    string accessed = dhi.container->access() ;\n    string symbolic = dhi.container->get_symbolic_name() ;\n    dds->filename( accessed );\n    if( !readDescriptors( *dds, accessed, symbolic ) )\n    {\n\tstring s = \"CDF could not build the DDS response\" ;\n\tthrow BESInternalError( s, __FILE__, __LINE__ ) ;\n    }\n    Ancillary::read_ancillary_dds( *dds, accessed ) ;\n\n    \/\/ The dds now includes attribute information. Grab the attributes and\n    \/\/ any ancillary attributes.\n    DAS das;\n    if( !readAttributes( das, accessed ) )\n    {\n\tstring s = \"CDF could not build the DAS response\" ;\n\tthrow BESInternalError( s, __FILE__, __LINE__ ) ;\n    }\n    Ancillary::read_ancillary_das( das, accessed ) ;\n\n    \/\/ transfer the attributes to the dds.\n    dds->transfer_attributes(&das);\n\n    dhi.data[POST_CONSTRAINT] = dhi.container->get_constraint();\n\n    dds->set_factory( NULL ) ;\n\n    return true ;\n}\n\nbool\nCDFRequestHandler::cdf_build_data( BESDataHandlerInterface &dhi )\n{\n    BESResponseObject *response =\n        dhi.response_handler->get_response_object();\n    BESDataDDSResponse *bdds =\n        dynamic_cast < BESDataDDSResponse * >(response);\n    DataDDS *dds = 0 ;\n    if (bdds)\n\tdds = bdds->get_dds();\n    else\n\tthrow BESInternalError( \"cast error\", __FILE__, __LINE__ ) ;\n  \n\n    \/\/ read the data structure including any ancillary structure\n    CDFTypeFactory *factory = new CDFTypeFactory ;\n    dds->set_factory( factory ) ;\n    string accessed = dhi.container->access() ;\n    string symbolic = dhi.container->get_symbolic_name() ;\n    dds->filename( accessed );\n    if( !readDescriptors( *dds, accessed, symbolic ) )\n    {\n\tstring s = \"CDF could not build the Data DDS response\" ;\n\tthrow BESInternalError( s, __FILE__, __LINE__ ) ;\n    }\n    Ancillary::read_ancillary_dds( *dds, accessed ) ;\n\n    \/\/ The dds now includes attribute information. Grab the attributes and\n    \/\/ any ancillary attributes.\n    DAS das;\n    if( !readAttributes( das, accessed ) )\n    {\n\tstring s = \"CDF could not build the DAS response\" ;\n\tthrow BESInternalError( s, __FILE__, __LINE__ ) ;\n    }\n    Ancillary::read_ancillary_das( das, accessed ) ;\n\n    \/\/ transfer the attributes to the dds.\n    dds->transfer_attributes(&das);\n\n    dhi.data[POST_CONSTRAINT] = dhi.container->get_constraint();\n\n    dds->set_factory( NULL ) ;\n\n    return true ;\n}\n\nbool\nCDFRequestHandler::cdf_build_help( BESDataHandlerInterface &dhi )\n{\n    BESInfo *info =\n\tdynamic_cast<BESInfo *>(dhi.response_handler->get_response_object());\n    if( !info )\n\tthrow BESInternalError( \"cast error\", __FILE__, __LINE__ ) ;\n\n    info->begin_tag( \"Handler\" ) ;\n    info->add_tag( \"name\", PACKAGE_NAME ) ;\n    string handles = (string)DAS_RESPONSE\n                     + \",\" + DDS_RESPONSE\n                     + \",\" + DATA_RESPONSE\n                     + \",\" + HELP_RESPONSE\n                     + \",\" + VERS_RESPONSE ;\n    info->add_tag( \"handles\", handles ) ;\n    info->add_tag( \"version\", PACKAGE_STRING ) ;\n    info->end_tag( \"Handler\" ) ;\n    return true ;\n}\n\nbool\nCDFRequestHandler::cdf_build_version( BESDataHandlerInterface &dhi )\n{\n    BESResponseObject *response =\n        dhi.response_handler->get_response_object();\n    BESVersionInfo *info = dynamic_cast < BESVersionInfo * >(response);\n    if( !info )\n\tthrow BESInternalError( \"cast error\", __FILE__, __LINE__ ) ;\n  \n    info->addHandlerVersion( PACKAGE_NAME, PACKAGE_VERSION ) ;\n    return true ;\n}\n\n\/** @brief dumps information about this object\n *\n * Displays the pointer value of this instance, the name of the request\n * handler, and the names of all registered handler functions\n *\n * @param strm C++ i\/o stream to dump the information to\n *\/\nvoid\nCDFRequestHandler::dump( ostream &strm ) const\n{\n    strm << BESIndent::LMarg << \"CDFRequestHandler::dump - (\"\n\t\t\t     << (void *)this << \")\" << endl ;\n    BESIndent::Indent() ;\n    BESRequestHandler::dump( strm ) ;\n    BESIndent::UnIndent() ;\n}\n\n<commit_msg>Simplied the dynamic_cast checks M    CDFRequestHandler.cc<commit_after>\/\/ CDFRequestHandler.cc\n\n\/\/ -*- mode: c++; c-basic-offset:4 -*-\n\n\/\/ This file is part of cdf_handler, a C++ server of OPeNDAP for access to cdf\n\/\/ data\n\n\/\/ Copyright (c) 2004,2005 University Corporation for Atmospheric Research\n\/\/ Author: Patrick West <pwest@ucar.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., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA\n\/\/\n\/\/ You can contact University Corporation for Atmospheric Research at\n\/\/ 3080 Center Green Drive, Boulder, CO 80301\n \n\/\/ (c) COPYRIGHT University Corporation for Atmostpheric Research 2004-2005\n\/\/ Please read the full copyright statement in the file COPYRIGHT_UCAR.\n\/\/\n\/\/ Authors:\n\/\/      pwest       Patrick West <pwest@ucar.edu>\n \n#ifdef __GNUG__\n#pragma implementation\n#endif\n\n#include <iostream>\n#include <fstream>\n\nusing std::ifstream ;\nusing std::cerr ;\nusing std::endl ;\n\n#include \"CDFRequestHandler.h\"\n#include \"CDFTypeFactory.h\"\n#include \"BESResponseHandler.h\"\n#include \"BESResponseNames.h\"\n#include \"BESDataNames.h\"\n#include \"CDFreadAttributes.h\"\n#include \"BESDASResponse.h\"\n#include \"CDFreadDescriptors.h\"\n#include \"BESDDSResponse.h\"\n#include \"BESDataDDSResponse.h\"\n#include \"BESConstraintFuncs.h\"\n#include \"BESVersionInfo.h\"\n#include \"TheBESKeys.h\"\n#include \"BESInternalError.h\"\n#include \"Ancillary.h\"\n#include \"config_cdf.h\"\n\nCDFRequestHandler::CDFRequestHandler( const string &name )\n    : BESRequestHandler( name )\n{\n    add_handler( DAS_RESPONSE, CDFRequestHandler::cdf_build_das ) ;\n    add_handler( DDS_RESPONSE, CDFRequestHandler::cdf_build_dds ) ;\n    add_handler( DATA_RESPONSE, CDFRequestHandler::cdf_build_data ) ;\n    add_handler( HELP_RESPONSE, CDFRequestHandler::cdf_build_help ) ;\n    add_handler( VERS_RESPONSE, CDFRequestHandler::cdf_build_version ) ;\n}\n\nCDFRequestHandler::~CDFRequestHandler()\n{\n}\n\nbool\nCDFRequestHandler::cdf_build_das( BESDataHandlerInterface &dhi )\n{\n    BESResponseObject *response = dhi.response_handler->get_response_object() ;\n    BESDASResponse *bdas = dynamic_cast < BESDASResponse * >(response) ;\n    if( !bdas )\n\tthrow BESInternalError( \"cast error\", __FILE__, __LINE__ ) ;\n\n    DAS *das = bdas->get_das() ;\n\n    \/\/ read the attributes for this container, including ancillary\n    \/\/ attributes\n    string accessed = dhi.container->access() ;\n    if( !readAttributes( *das, accessed ) )\n    {\n\tstring s = \"CDF could not build the DAS response\" ;\n\tthrow BESInternalError( s, __FILE__, __LINE__ ) ;\n    }\n\n    Ancillary::read_ancillary_das( *das, accessed ) ;\n\n    return true ;\n}\n\nbool\nCDFRequestHandler::cdf_build_dds( BESDataHandlerInterface &dhi )\n{\n    BESResponseObject *response = dhi.response_handler->get_response_object();\n    BESDDSResponse *bdds = dynamic_cast < BESDDSResponse * >(response);\n    if( !bdds )\n\tthrow BESInternalError( \"cast error\", __FILE__, __LINE__ ) ;\n  \n    DDS *dds = bdds->get_dds();\n\n    \/\/ read the data structure including any ancillary structure\n    CDFTypeFactory *factory = new CDFTypeFactory ;\n    dds->set_factory( factory ) ;\n    string accessed = dhi.container->access() ;\n    string symbolic = dhi.container->get_symbolic_name() ;\n    dds->filename( accessed );\n    if( !readDescriptors( *dds, accessed, symbolic ) )\n    {\n\tstring s = \"CDF could not build the DDS response\" ;\n\tthrow BESInternalError( s, __FILE__, __LINE__ ) ;\n    }\n    Ancillary::read_ancillary_dds( *dds, accessed ) ;\n\n    \/\/ The dds now includes attribute information. Grab the attributes and\n    \/\/ any ancillary attributes.\n    DAS das;\n    if( !readAttributes( das, accessed ) )\n    {\n\tstring s = \"CDF could not build the DAS response\" ;\n\tthrow BESInternalError( s, __FILE__, __LINE__ ) ;\n    }\n    Ancillary::read_ancillary_das( das, accessed ) ;\n\n    \/\/ transfer the attributes to the dds.\n    dds->transfer_attributes(&das);\n\n    dhi.data[POST_CONSTRAINT] = dhi.container->get_constraint();\n\n    dds->set_factory( NULL ) ;\n\n    return true ;\n}\n\nbool\nCDFRequestHandler::cdf_build_data( BESDataHandlerInterface &dhi )\n{\n    BESResponseObject *response = dhi.response_handler->get_response_object();\n    BESDataDDSResponse *bdds = dynamic_cast < BESDataDDSResponse * >(response);\n    if( !bdds )\n\tthrow BESInternalError( \"cast error\", __FILE__, __LINE__ ) ;\n  \n    DataDDS *dds = bdds->get_dds();\n\n    \/\/ read the data structure including any ancillary structure\n    CDFTypeFactory *factory = new CDFTypeFactory ;\n    dds->set_factory( factory ) ;\n    string accessed = dhi.container->access() ;\n    string symbolic = dhi.container->get_symbolic_name() ;\n    dds->filename( accessed );\n    if( !readDescriptors( *dds, accessed, symbolic ) )\n    {\n\tstring s = \"CDF could not build the Data DDS response\" ;\n\tthrow BESInternalError( s, __FILE__, __LINE__ ) ;\n    }\n    Ancillary::read_ancillary_dds( *dds, accessed ) ;\n\n    \/\/ The dds now includes attribute information. Grab the attributes and\n    \/\/ any ancillary attributes.\n    DAS das;\n    if( !readAttributes( das, accessed ) )\n    {\n\tstring s = \"CDF could not build the DAS response\" ;\n\tthrow BESInternalError( s, __FILE__, __LINE__ ) ;\n    }\n    Ancillary::read_ancillary_das( das, accessed ) ;\n\n    \/\/ transfer the attributes to the dds.\n    dds->transfer_attributes(&das);\n\n    dhi.data[POST_CONSTRAINT] = dhi.container->get_constraint();\n\n    dds->set_factory( NULL ) ;\n\n    return true ;\n}\n\nbool\nCDFRequestHandler::cdf_build_help( BESDataHandlerInterface &dhi )\n{\n    BESInfo *info =\n\tdynamic_cast<BESInfo *>(dhi.response_handler->get_response_object());\n    if( !info )\n\tthrow BESInternalError( \"cast error\", __FILE__, __LINE__ ) ;\n\n    info->begin_tag( \"Handler\" ) ;\n    info->add_tag( \"name\", PACKAGE_NAME ) ;\n    string handles = (string)DAS_RESPONSE\n                     + \",\" + DDS_RESPONSE\n                     + \",\" + DATA_RESPONSE\n                     + \",\" + HELP_RESPONSE\n                     + \",\" + VERS_RESPONSE ;\n    info->add_tag( \"handles\", handles ) ;\n    info->add_tag( \"version\", PACKAGE_STRING ) ;\n    info->end_tag( \"Handler\" ) ;\n    return true ;\n}\n\nbool\nCDFRequestHandler::cdf_build_version( BESDataHandlerInterface &dhi )\n{\n    BESResponseObject *response = dhi.response_handler->get_response_object();\n    BESVersionInfo *info = dynamic_cast < BESVersionInfo * >(response);\n    if( !info )\n\tthrow BESInternalError( \"cast error\", __FILE__, __LINE__ ) ;\n  \n    info->addHandlerVersion( PACKAGE_NAME, PACKAGE_VERSION ) ;\n    return true ;\n}\n\n\/** @brief dumps information about this object\n *\n * Displays the pointer value of this instance, the name of the request\n * handler, and the names of all registered handler functions\n *\n * @param strm C++ i\/o stream to dump the information to\n *\/\nvoid\nCDFRequestHandler::dump( ostream &strm ) const\n{\n    strm << BESIndent::LMarg << \"CDFRequestHandler::dump - (\"\n\t\t\t     << (void *)this << \")\" << endl ;\n    BESIndent::Indent() ;\n    BESRequestHandler::dump( strm ) ;\n    BESIndent::UnIndent() ;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2015-2016, The University of Texas at Austin\n\/\/ All 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 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\" AND\n\/\/ ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n\/\/ WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\/\/ DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE FOR ANY\n\/\/ DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n\/\/ (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\/\/ LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n\/\/ ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n\/** @file move_robot.cpp\n * \n *  @brief ROS server that acts as an interface for ROS MoveIt! and publishes end-effector pose.\n * \n *  @author karl.kruusamae(at)utexas.edu\n *\/\n\n#include \"temoto\/move_robot.h\"\n\n\/** This method is executed when temoto\/move_robot_service service is called.\n *  It updates target_pose_stamped based on the client's request and sets the new_move_req flag to let main() know that moving of the robot has been requested.\n *  @param req temoto::Goal service request.\n *  @param res temoto::Goal service response.\n *  @return always true.\n *\/\nbool MoveRobotInterface::serviceUpdate(temoto::Goal::Request  &req,\n\t\t\t\t       temoto::Goal::Response &res)\n{\n\/\/  ROS_INFO(\"New service update requested.\");\n  if (req.action_type == temoto::GoalRequest::CARTESIAN_COMPUTE)\n  {\n    \/\/ Set current state as the start state for planner. For some reason the actual built-in function doesn't do that.\n    movegroup_.setStartState( *(movegroup_.getCurrentState()) );\n    \n    \/\/ waypoints are interpreted in the \"leap_motion\" ref.frame\n    movegroup_.setPoseReferenceFrame(req.cartesian_frame);\n    \n    \/\/ Computed Cartesian trajectory.\n    moveit_msgs::RobotTrajectory trajectory;\n    res.cartesian_fraction = movegroup_.computeCartesianPath(req.cartesian_wayposes,\n                                             0.01,  \/\/ eef_step\n                                             0.0,   \/\/ jump_threshold\n                                             trajectory);\n    ROS_INFO(\"[MoveRobotInterface::serviceUpdate] Cartesian path %.2f%% acheived\", res.cartesian_fraction * 100.0);\n  \n    latest_plan_.trajectory_ = trajectory;\n    new_plan_available_ = true;\n  }\n  else\n  {\n    \/\/ sets the action associated to target pose\n    req_action_type_ = req.action_type;\n    \n    \/\/ sets target requested pose\n    target_pose_stamped_ = req.goal;\n    \n    \/\/ check for named target\n    use_named_target_ = false;\t\t\t\t\t\/\/ by default do not use named_target.\n    named_target_ = req.named_target;\t\t\t\t\/\/ get named_target from the service request.\n    ROS_INFO(\"[MoveRobotInterface::serviceUpdate] named_target_='%s'\", named_target_.c_str());\n    if (!named_target_.empty()) use_named_target_ = true;\t\/\/ if a named target was specified, set use_named_target_ to true.\n    if (use_named_target_) ROS_INFO(\"[MoveRobotInterface::serviceUpdate] use_named_target is set TRUE\");\n    \n    \/\/ Set new_move_requested_ TRUE for main() to see it\n    new_move_requested_ = true;\n    ROS_INFO(\"[MoveRobotInterface::serviceUpdate] new_move_requested_ is set TRUE\");\n  }\n  return true;\n} \/\/ end serviceUpdate\n\n\/** Plans and\/or executes the motion of the robot.\n *  @param robot MoveGroup object of the robot.\n *\/\nvoid MoveRobotInterface::requestMove()\n{\n\n  \/\/ Set current state as the start state for planner. For some reason the actual built-in function doesn't do that.\n  movegroup_.setStartState( *(movegroup_.getCurrentState()) );\n  \n  \/\/ Get and print current position of the end effector\n  geometry_msgs::PoseStamped current_pose = movegroup_.getCurrentPose();\n  ROS_INFO(\"[move_robot\/requestMove] === CURRENT POSE ( as given by MoveGroup::getCurrentPose() ) ===\");\n  ROS_INFO(\"[move_robot\/requestMove] Current pose frame: %s\", current_pose.header.frame_id.c_str());\n  ROS_INFO(\"[move_robot\/requestMove] Current pose (posit x, y, z): (%f, %f, %f)\", current_pose.pose.position.x, current_pose.pose.position.y, current_pose.pose.position.z);\n  ROS_INFO(\"[move_robot\/requestMove] Current pose (orien x, y, z, w): (%f, %f, %f, %f)\", current_pose.pose.orientation.x, current_pose.pose.orientation.y, current_pose.pose.orientation.z, current_pose.pose.orientation.w);\n \n  \/\/ Use either named or pose target (named target takes the priority over regular pose target).\n  if (use_named_target_)\t\t\t\t\t\t\/\/ if use_named_target is true\n  {\n    bool set_target_ok = movegroup_.setNamedTarget(named_target_);\t\/\/ set target pose as a named target\n    if (!set_target_ok)\t\t\t\t\t\t\t\/\/ check if setting named target was successful\n    {\n      ROS_INFO(\"[move_robot\/requestMove] Failed to set named target. Please retry.\");\n      return;\t\t\t\t\t\t\t\t\/\/ return if setNamedTarget failed\n    }\n    else\n      ROS_INFO(\"[move_robot\/requestMove] Using NAMED TARGET for planning and\/or moving.\");\n  } \/\/ end if (use_named_target_)\n  else\n  {\n\/\/     robot.setEndEffectorLink(\"leap_motion_on_robot\");\n    ROS_INFO(\"[move_robot\/requestMove] Found end effector link: %s\", movegroup_.getEndEffectorLink().c_str());\n    \/\/ use the stamped target pose to set the target pose for robot\n    bool set_target_ok = movegroup_.setPoseTarget(target_pose_stamped_\/*, \"leap_motion_inv\"*\/);\n    if (!set_target_ok)\t\t\t\t\t\t\t\/\/ check if set target pose failed\n    {\n      ROS_INFO(\"[move_robot\/requestMove] Failed to set pose target. Please retry.\");\n      return;\t\t\t\t\t\t\t\t\/\/ return if setPoseTarget failed\n    }\n    else\n      ROS_INFO(\"[move_robot\/requestMove] Using POSE TARGET for planning and\/or moving.\");\n  }\n\n  \/\/ TODO\n\/\/   \/\/ Set goal tolerance based on the actual shift from current positio to target position\n\/\/   std::vector <geometry_msgs::Point> current_and_target;\t\t\/\/ Vector that contains current and target points\n\/\/   current_and_target.push_back(current_pose.pose.position);\t\t\/\/ Add current position\n\/\/   current_and_target.push_back(target_pose.position);\t\t\t\/\/ Add target position\n\/\/   double shift = calculateDistance(current_and_target);\t\t\t\/\/ Calculate the linear distance between the two positions\n\/\/   \/\/ CALCULATE DISTNACE BETWEEN CURRENT AND TARGET\n\/\/   \/\/ CALCULATE TOLERANCE AS A PERCENTAGE OF DISTANCE && CONSIDER SOME MIN\/MAX LIMITS\n\/\/   \/\/ SET TOLERANCE FOR PLANNING\n  \n  \/\/ Just checking what is the target pose\n  geometry_msgs::PoseStamped current_target = movegroup_.getPoseTarget();\n  ROS_INFO(\"[move_robot\/requestMove] Target pose frame: %s\", current_target.header.frame_id.c_str());\n  ROS_INFO(\"[move_robot\/requestMove] Target pose (posit x, y, z): (%f, %f, %f)\", current_target.pose.position.x, current_target.pose.position.y, current_target.pose.position.z);\n  ROS_INFO(\"[move_robot\/requestMove] Target pose (orien x, y, z, w): (%f, %f, %f, %f)\", current_target.pose.orientation.x, current_target.pose.orientation.y, current_target.pose.orientation.z, current_target.pose.orientation.w);\n\n  \/\/ Based on action type: PLAN (0x01), EXECUTE PLAN (0x02), or PLAN&EXECUTE (0x03)\n  if ( req_action_type_ == temoto::GoalRequest::PLAN )\n  {\n    ROS_INFO(\"[move_robot\/requestMove] Starting to plan ...\");\n    ROS_INFO(\"[move_robot\/requestMove] Planning frame: %s\", movegroup_.getPlanningFrame().c_str());\n    movegroup_.plan( latest_plan_ );\t\t\t\t\/\/ Calculate plan and store it in latest_plan_.\n    new_plan_available_ = true;\t\t\t\t\t\/\/ Set new_plan_available_ to TRUE.\n    ROS_INFO(\"[move_robot\/requestMove] DONE planning.\");\n  }\n  else if ( req_action_type_ == temoto::GoalRequest::EXECUTE )\n  {\n    ROS_INFO(\"[move_robot\/requestMove] Starting to execute last plan ...\");\n    if ( new_plan_available_ ) movegroup_.execute( latest_plan_ );\t\/\/ If there is a new plan, execute latest_plan_.\n    else ROS_INFO(\"[move_robot\/requestMove] No plan to execute.\");\t\/\/ Else do nothing but printout \"no plan\"\n    new_plan_available_ = false;\t\t\t\t\t\/\/ Either case, set new_plan_available_ to FALSE.\n    ROS_INFO(\"[move_robot\/requestMove] DONE executing the plan\");\n  }\n  else if ( req_action_type_ == temoto::GoalRequest::GO )\n  {\n    ROS_INFO(\"[move_robot\/requestMove] Starting to move (i.e. plan & execute) ...\");\n\/\/     robot.move();\t\t\t\t\t\t\/\/ Plan and execute.\n    \/\/ Since move() has a bug of start state not being current state, I am going to plan and execute sequentally.\n    moveit::planning_interface::MoveGroup::Plan move_plan;\n    printf(\"[move_robot\/requestMove] Planning ...\");\n    movegroup_.plan( move_plan );\n    printf(\"[DONE] \\n[move_robot\/requestMove] and Executing ...\\n\");\n    movegroup_.execute( move_plan );\n    ROS_INFO(\"[move_robot\/requestMove] DONE moving.\");\n    new_plan_available_ = false;\t\t\t\t\t\/\/ As any previous plan has become invalid, set new_plan_available_ to FALSE.\n  }\n\n  return;\n} \/\/ end requestMove\n\n\/** Main method. *\/\nint main(int argc, char **argv)\n{\n  \/\/ ROS init\n  ros::init(argc, argv, \"move_robot\");\n  \/\/ ROS Nodehandle for public namespace\n  ros::NodeHandle n;\n  \/\/ ROS NodeHandle for accessing private parameters\n  ros::NodeHandle pn(\"~\");\n\n  \/\/ Using an async spinner\n  ros::AsyncSpinner spinner(1);\n  spinner.start();\n  \n  \/\/ get user-specified name for the movegroup as a private parameter\n  std::string move_group_name;\n  pn.getParam(\"movegroup\", move_group_name);\n  if ( move_group_name.empty() )\n  {\n    ROS_ERROR(\"[move_robot\/main] No movegroup name was specified. Aborting.\");\n    return -1;\n  }\n  ROS_INFO(\"[move_robot\/main] Retrieved '%s' from parameter server as a movegroup name.\", move_group_name.c_str());\n  \n  \/\/ Create MoveRobotInterface for user-specified movegroup\n  MoveRobotInterface moveIF(move_group_name);\n  \/\/ Using RRTConnectkConfigDefault planner for motion planning\n  moveIF.movegroup_.setPlannerId(\"RRTConnectkConfigDefault\");\n  \n  \/\/ FYI\n  ROS_INFO(\"[move_robot\/main] Planning frame: %s\", moveIF.movegroup_.getPlanningFrame().c_str());\n  ROS_INFO(\"[move_robot\/main] End effector link: %s\", moveIF.movegroup_.getEndEffectorLink().c_str());\n  ROS_INFO(\"[move_robot\/main] End effector: %s\", moveIF.movegroup_.getEndEffector().c_str());\n  ROS_INFO(\"[move_robot\/main] Goal position tolerance is: %.6f\", moveIF.movegroup_.getGoalPositionTolerance());\n  ROS_INFO(\"[move_robot\/main] Goal orientation tolerance is: %.6f\", moveIF.movegroup_.getGoalOrientationTolerance());\n  ROS_INFO(\"[move_robot\/main] Goal joint tolerance is: %.6f\", moveIF.movegroup_.getGoalJointTolerance());\n  \n  \/\/ Set up service for move_robot_service; if there's a service request, executes serviceUpdate() function\n  ros::ServiceServer service = n.advertiseService(\"temoto\/move_robot_service\", &MoveRobotInterface::serviceUpdate, &moveIF);\n  ROS_INFO(\"[move_robot\/main] Service 'temoto\/move_robot_service' up and going. Ready to send move commands to %s.\", move_group_name.c_str());\n  \n  \/\/ Set up publisher for the end effector location\n  ros::Publisher pub_end_effector = n.advertise<geometry_msgs::PoseStamped>( \"temoto\/end_effector_pose\", 1 );\n  \n  \/\/ ROS client for \/temoto\/adjust_rviz_camera\n  ros::ServiceClient client_visual = n.serviceClient<std_srvs::Empty>(\"temoto\/adjust_rviz_camera\");\n  std_srvs::Empty empty_srv;\t\t\t\/\/ Empty service.\n\n  while ( ros::ok() )\n  {\n    \/\/ check if there has been a service request for a new move\n    if ( moveIF.new_move_requested_ && moveIF.req_action_type_ < 0x04 )\n    {\n      moveIF.requestMove();\t\t\t\/\/ plan and execute move using move_group\n      moveIF.new_move_requested_ = false;\t\/\/ set request flag to false\n      moveIF.new_end_effector_pose_ = true;\t\/\/ assumes that request move resulted in new pose for end effector and sets the corresponding flag\n    }\n    \n    \/\/ get and publish current end effector pose;\n    pub_end_effector.publish( moveIF.movegroup_.getCurrentPose() );\n\n    \/\/ If pose of the end effector has changed. Update camera position if the end effector has moved since the last time camera was positioned.\n    if ( moveIF.new_end_effector_pose_ )\n    {\n      client_visual.call(empty_srv);\n      moveIF.new_end_effector_pose_ = false;\t\/\/ set new_end_effector_pose to zero\n    } \/\/ end if\n    \n  } \/\/ end while\n\n  return 0;\n} \/\/ end main\n<commit_msg>minor clean-up<commit_after>\/\/ Copyright (c) 2015-2016, The University of Texas at Austin\n\/\/ All 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 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\" AND\n\/\/ ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n\/\/ WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\/\/ DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE FOR ANY\n\/\/ DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n\/\/ (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\/\/ LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n\/\/ ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n\/** @file move_robot.cpp\n * \n *  @brief ROS server that acts as an interface for ROS MoveIt! and publishes end-effector pose.\n * \n *  @author karl.kruusamae(at)utexas.edu\n *\/\n\n#include \"temoto\/move_robot.h\"\n\n\/** This method is executed when temoto\/move_robot_service service is called.\n *  It updates target_pose_stamped based on the client's request and sets the new_move_req flag to let main() know that moving of the robot has been requested.\n *  @param req temoto::Goal service request.\n *  @param res temoto::Goal service response.\n *  @return always true.\n *\/\nbool MoveRobotInterface::serviceUpdate(temoto::Goal::Request  &req,\n\t\t\t\t       temoto::Goal::Response &res)\n{\n\/\/  ROS_INFO(\"New service update requested.\");\n  if (req.action_type == temoto::GoalRequest::CARTESIAN_COMPUTE)\n  {\n    \/\/ Set current state as the start state for planner. For some reason the actual built-in function doesn't do that.\n    movegroup_.setStartState( *(movegroup_.getCurrentState()) );\n    \n    \/\/ waypoints are interpreted in the \"leap_motion\" ref.frame\n    movegroup_.setPoseReferenceFrame(req.cartesian_frame);\n    \n    \/\/ Computed Cartesian trajectory.\n    moveit_msgs::RobotTrajectory trajectory;\n    res.cartesian_fraction = movegroup_.computeCartesianPath(req.cartesian_wayposes,\n                                             0.01,  \/\/ eef_step\n                                             0.0,   \/\/ jump_threshold\n                                             trajectory);\n    ROS_INFO(\"[MoveRobotInterface::serviceUpdate] Cartesian path %.2f%% acheived\", res.cartesian_fraction * 100.0);\n  \n    latest_plan_.trajectory_ = trajectory;\n    new_plan_available_ = true;\n  }\n  else\n  {\n    \/\/ sets the action associated to target pose\n    req_action_type_ = req.action_type;\n    \n    \/\/ sets target requested pose\n    target_pose_stamped_ = req.goal;\n    \n    \/\/ check for named target\n    use_named_target_ = false;\t\t\t\t\t\/\/ by default do not use named_target.\n    named_target_ = req.named_target;\t\t\t\t\/\/ get named_target from the service request.\n    ROS_INFO(\"[MoveRobotInterface::serviceUpdate] named_target_='%s'\", named_target_.c_str());\n    if (!named_target_.empty()) use_named_target_ = true;\t\/\/ if a named target was specified, set use_named_target_ to true.\n    if (use_named_target_) ROS_INFO(\"[MoveRobotInterface::serviceUpdate] use_named_target is set TRUE\");\n    \n    \/\/ Set new_move_requested_ TRUE for main() to see it\n    new_move_requested_ = true;\n    ROS_INFO(\"[MoveRobotInterface::serviceUpdate] new_move_requested_ is set TRUE\");\n  }\n  return true;\n} \/\/ end serviceUpdate\n\n\/** Plans and\/or executes the motion of the robot.\n *  @param robot MoveGroup object of the robot.\n *\/\nvoid MoveRobotInterface::requestMove()\n{\n\n  \/\/ Set current state as the start state for planner. For some reason the actual built-in function doesn't do that.\n  movegroup_.setStartState( *(movegroup_.getCurrentState()) );\n  \n  \/\/ Get and print current position of the end effector\n  geometry_msgs::PoseStamped current_pose = movegroup_.getCurrentPose();\n  ROS_INFO(\"[move_robot\/requestMove] === CURRENT POSE ( as given by MoveGroup::getCurrentPose() ) ===\");\n  ROS_INFO(\"[move_robot\/requestMove] Current pose frame: %s\", current_pose.header.frame_id.c_str());\n  ROS_INFO(\"[move_robot\/requestMove] Current pose (posit x, y, z): (%f, %f, %f)\", current_pose.pose.position.x, current_pose.pose.position.y, current_pose.pose.position.z);\n  ROS_INFO(\"[move_robot\/requestMove] Current pose (orien x, y, z, w): (%f, %f, %f, %f)\", current_pose.pose.orientation.x, current_pose.pose.orientation.y, current_pose.pose.orientation.z, current_pose.pose.orientation.w);\n \n  \/\/ Use either named or pose target (named target takes the priority over regular pose target).\n  if (use_named_target_)\t\t\t\t\t\t\/\/ if use_named_target is true\n  {\n    bool set_target_ok = movegroup_.setNamedTarget(named_target_);\t\/\/ set target pose as a named target\n    if (!set_target_ok)\t\t\t\t\t\t\t\/\/ check if setting named target was successful\n    {\n      ROS_INFO(\"[move_robot\/requestMove] Failed to set named target. Please retry.\");\n      return;\t\t\t\t\t\t\t\t\/\/ return if setNamedTarget failed\n    }\n    else\n      ROS_INFO(\"[move_robot\/requestMove] Using NAMED TARGET for planning and\/or moving.\");\n  } \/\/ end if (use_named_target_)\n  else\n  {\n\/\/     movegroup_.setEndEffectorLink( \"temoto_end_effector\" );\n    ROS_INFO(\"[move_robot\/requestMove] Found end effector link: %s\", movegroup_.getEndEffectorLink().c_str());\n    \/\/ use the stamped target pose to set the target pose for robot\n    bool set_target_ok = movegroup_.setPoseTarget(target_pose_stamped_ \/*, \"temoto_end_effector\"*\/);\n    if (!set_target_ok)\t\t\t\t\t\t\t\/\/ check if set target pose failed\n    {\n      ROS_INFO(\"[move_robot\/requestMove] Failed to set pose target. Please retry.\");\n      return;\t\t\t\t\t\t\t\t\/\/ return if setPoseTarget failed\n    }\n    else\n      ROS_INFO(\"[move_robot\/requestMove] Using POSE TARGET for planning and\/or moving.\");\n  }\n\n  \/\/ TODO\n\/\/   \/\/ Set goal tolerance based on the actual shift from current positio to target position\n\/\/   std::vector <geometry_msgs::Point> current_and_target;\t\t\/\/ Vector that contains current and target points\n\/\/   current_and_target.push_back(current_pose.pose.position);\t\t\/\/ Add current position\n\/\/   current_and_target.push_back(target_pose.position);\t\t\t\/\/ Add target position\n\/\/   double shift = calculateDistance(current_and_target);\t\t\t\/\/ Calculate the linear distance between the two positions\n\/\/   \/\/ CALCULATE DISTNACE BETWEEN CURRENT AND TARGET\n\/\/   \/\/ CALCULATE TOLERANCE AS A PERCENTAGE OF DISTANCE && CONSIDER SOME MIN\/MAX LIMITS\n\/\/   \/\/ SET TOLERANCE FOR PLANNING\n  \n  \/\/ Just checking what is the target pose\n  geometry_msgs::PoseStamped current_target = movegroup_.getPoseTarget();\n  ROS_INFO(\"[move_robot\/requestMove] Target pose frame: %s\", current_target.header.frame_id.c_str());\n  ROS_INFO(\"[move_robot\/requestMove] Target pose (posit x, y, z): (%f, %f, %f)\", current_target.pose.position.x, current_target.pose.position.y, current_target.pose.position.z);\n  ROS_INFO(\"[move_robot\/requestMove] Target pose (orien x, y, z, w): (%f, %f, %f, %f)\", current_target.pose.orientation.x, current_target.pose.orientation.y, current_target.pose.orientation.z, current_target.pose.orientation.w);\n\n  \/\/ Based on action type: PLAN (0x01), EXECUTE PLAN (0x02), or PLAN&EXECUTE (0x03)\n  if ( req_action_type_ == temoto::GoalRequest::PLAN )\n  {\n    ROS_INFO(\"[move_robot\/requestMove] Starting to plan ...\");\n    ROS_INFO(\"[move_robot\/requestMove] Planning frame: %s\", movegroup_.getPlanningFrame().c_str());\n    movegroup_.plan( latest_plan_ );\t\t\t\t\/\/ Calculate plan and store it in latest_plan_.\n    new_plan_available_ = true;\t\t\t\t\t\/\/ Set new_plan_available_ to TRUE.\n    ROS_INFO(\"[move_robot\/requestMove] DONE planning.\");\n  }\n  else if ( req_action_type_ == temoto::GoalRequest::EXECUTE )\n  {\n    ROS_INFO(\"[move_robot\/requestMove] Starting to execute last plan ...\");\n    if ( new_plan_available_ ) movegroup_.execute( latest_plan_ );\t\/\/ If there is a new plan, execute latest_plan_.\n    else ROS_INFO(\"[move_robot\/requestMove] No plan to execute.\");\t\/\/ Else do nothing but printout \"no plan\"\n    new_plan_available_ = false;\t\t\t\t\t\/\/ Either case, set new_plan_available_ to FALSE.\n    ROS_INFO(\"[move_robot\/requestMove] DONE executing the plan\");\n  }\n  else if ( req_action_type_ == temoto::GoalRequest::GO )\n  {\n    ROS_INFO(\"[move_robot\/requestMove] Starting to move (i.e. plan & execute) ...\");\n\/\/     robot.move();\t\t\t\t\t\t\/\/ Plan and execute.\n    \/\/ Since move() has a bug of start state not being current state, I am going to plan and execute sequentally.\n    moveit::planning_interface::MoveGroup::Plan move_plan;\n    printf(\"[move_robot\/requestMove] Planning ...\");\n    movegroup_.plan( move_plan );\n    printf(\"[DONE] \\n[move_robot\/requestMove] and Executing ...\\n\");\n    movegroup_.execute( move_plan );\n    ROS_INFO(\"[move_robot\/requestMove] DONE moving.\");\n    new_plan_available_ = false;\t\t\t\t\t\/\/ As any previous plan has become invalid, set new_plan_available_ to FALSE.\n  }\n\n  return;\n} \/\/ end requestMove\n\n\/** Main method. *\/\nint main(int argc, char **argv)\n{\n  \/\/ ROS init\n  ros::init(argc, argv, \"move_robot\");\n  \/\/ ROS Nodehandle for public namespace\n  ros::NodeHandle n;\n  \/\/ ROS NodeHandle for accessing private parameters\n  ros::NodeHandle pn(\"~\");\n\n  \/\/ Using an async spinner\n  ros::AsyncSpinner spinner(1);\n  spinner.start();\n  \n  \/\/ get user-specified name for the movegroup as a private parameter\n  std::string move_group_name;\n  pn.getParam(\"movegroup\", move_group_name);\n  if ( move_group_name.empty() )\n  {\n    ROS_ERROR(\"[move_robot\/main] No movegroup name was specified. Aborting.\");\n    return -1;\n  }\n  ROS_INFO(\"[move_robot\/main] Retrieved '%s' from parameter server as a movegroup name.\", move_group_name.c_str());\n  \n  \/\/ Create MoveRobotInterface for user-specified movegroup\n  MoveRobotInterface moveIF(move_group_name);\n  \/\/ Using RRTConnectkConfigDefault planner for motion planning\n  moveIF.movegroup_.setPlannerId(\"RRTConnectkConfigDefault\");\n  \n  \/\/ FYI\n  ROS_INFO(\"[move_robot\/main] Planning frame: %s\", moveIF.movegroup_.getPlanningFrame().c_str());\n  ROS_INFO(\"[move_robot\/main] End effector link: %s\", moveIF.movegroup_.getEndEffectorLink().c_str());\n  ROS_INFO(\"[move_robot\/main] End effector: %s\", moveIF.movegroup_.getEndEffector().c_str());\n  ROS_INFO(\"[move_robot\/main] Goal position tolerance is: %.6f\", moveIF.movegroup_.getGoalPositionTolerance());\n  ROS_INFO(\"[move_robot\/main] Goal orientation tolerance is: %.6f\", moveIF.movegroup_.getGoalOrientationTolerance());\n  ROS_INFO(\"[move_robot\/main] Goal joint tolerance is: %.6f\", moveIF.movegroup_.getGoalJointTolerance());\n  \n  \/\/ Set up service for move_robot_service; if there's a service request, executes serviceUpdate() function\n  ros::ServiceServer service = n.advertiseService(\"temoto\/move_robot_service\", &MoveRobotInterface::serviceUpdate, &moveIF);\n  ROS_INFO(\"[move_robot\/main] Service 'temoto\/move_robot_service' up and going. Ready to send move commands to %s.\", move_group_name.c_str());\n  \n  \/\/ Set up publisher for the end effector location\n  ros::Publisher pub_end_effector = n.advertise<geometry_msgs::PoseStamped>( \"temoto\/end_effector_pose\", 1 );\n  \n  \/\/ ROS client for \/temoto\/adjust_rviz_camera\n  ros::ServiceClient client_visual = n.serviceClient<std_srvs::Empty>(\"temoto\/adjust_rviz_camera\");\n  std_srvs::Empty empty_srv;\t\t\t\/\/ Empty service.\n\n  while ( ros::ok() )\n  {\n    \/\/ check if there has been a service request for a new move\n    if ( moveIF.new_move_requested_ && moveIF.req_action_type_ < 0x04 )\n    {\n      moveIF.requestMove();\t\t\t\/\/ plan and execute move using move_group\n      moveIF.new_move_requested_ = false;\t\/\/ set request flag to false\n      moveIF.new_end_effector_pose_ = true;\t\/\/ assumes that request move resulted in new pose for end effector and sets the corresponding flag\n    }\n    \n    \/\/ get and publish current end effector pose;\n    pub_end_effector.publish( moveIF.movegroup_.getCurrentPose() );\n\n    \/\/ If pose of the end effector has changed. Update camera position if the end effector has moved since the last time camera was positioned.\n    if ( moveIF.new_end_effector_pose_ )\n    {\n      client_visual.call(empty_srv);\n      moveIF.new_end_effector_pose_ = false;\t\/\/ set new_end_effector_pose to zero\n    } \/\/ end if\n    \n  } \/\/ end while\n\n  return 0;\n} \/\/ end main\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2016 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 <stddef.h>\n#include <stdint.h>\n#include <vector>\n\n#include \"archive.h\"\n#include \"archive_entry.h\"\n\nextern \"C\" int LLVMFuzzerTestOneInput(const uint8_t *buf, size_t len) {\n  struct archive *a = archive_read_new();\n\n  archive_read_support_filter_all(a);\n  archive_read_support_format_all(a);\n  archive_read_support_format_empty(a);\n  archive_read_support_format_raw(a);\n  archive_read_support_format_gnutar(a);\n\n  if (ARCHIVE_OK != archive_read_set_options(a, \"zip:ignorecrc32,tar:read_concatenated_archives,tar:mac-ext\")) {\n    return 0;\n  }\n\n  archive_read_open_memory(a, buf, len);\n\n  while(1) {\n    std::vector<uint8_t> data_buffer(getpagesize(), 0);\n    struct archive_entry *entry;\n    int ret = archive_read_next_header(a, &entry);\n    if (ret == ARCHIVE_EOF || ret == ARCHIVE_FATAL)\n      break;\n    if (ret == ARCHIVE_RETRY)\n      continue;\n\n    (void)archive_entry_pathname(entry);\n    (void)archive_entry_pathname_utf8(entry);\n    (void)archive_entry_pathname_w(entry);\n\n    (void)archive_entry_atime(entry);\n    (void)archive_entry_birthtime(entry);\n    (void)archive_entry_ctime(entry);\n    (void)archive_entry_dev(entry);\n    (void)archive_entry_digest(entry, ARCHIVE_ENTRY_DIGEST_SHA1);\n    (void)archive_entry_filetype(entry);\n    (void)archive_entry_is_encrypted(entry);\n    (void)archive_entry_mode(entry);\n    (void)archive_entry_size(entry);\n    (void)archive_entry_uid(entry);\n    (void)archive_entry_mtime(entry);\n\n    ssize_t r;\n    while ((r = archive_read_data(a, data_buffer.data(),\n            data_buffer.size())) > 0)\n      ;\n    if (r == ARCHIVE_FATAL)\n      break;\n  }\n\n  archive_read_free(a);\n  return 0;\n}\n<commit_msg>Exercises even more codepaths in libarchive (#9003)<commit_after>\/\/ Copyright 2016 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 <stddef.h>\n#include <stdint.h>\n#include <vector>\n\n#include \"archive.h\"\n#include \"archive_entry.h\"\n\nextern \"C\" int LLVMFuzzerTestOneInput(const uint8_t *buf, size_t len) {\n  struct archive *a = archive_read_new();\n\n  archive_read_support_filter_all(a);\n  archive_read_support_format_all(a);\n  archive_read_support_format_empty(a);\n  archive_read_support_format_raw(a);\n  archive_read_support_format_gnutar(a);\n\n  if (ARCHIVE_OK != archive_read_set_options(a, \"zip:ignorecrc32,tar:read_concatenated_archives,tar:mac-ext\")) {\n    return 0;\n  }\n\n  archive_read_open_memory(a, buf, len);\n  archive_read_add_passphrase(a, \"secret\");\n\n  while(1) {\n    std::vector<uint8_t> data_buffer(getpagesize(), 0);\n    struct archive_entry *entry;\n    int ret = archive_read_next_header(a, &entry);\n    if (ret == ARCHIVE_EOF || ret == ARCHIVE_FATAL)\n      break;\n    if (ret == ARCHIVE_RETRY)\n      continue;\n\n    (void)archive_entry_pathname(entry);\n    (void)archive_entry_pathname_utf8(entry);\n    (void)archive_entry_pathname_w(entry);\n\n    (void)archive_entry_atime(entry);\n    (void)archive_entry_birthtime(entry);\n    (void)archive_entry_ctime(entry);\n    (void)archive_entry_dev(entry);\n    (void)archive_entry_digest(entry, ARCHIVE_ENTRY_DIGEST_SHA1);\n    (void)archive_entry_filetype(entry);\n    (void)archive_entry_gid(entry);\n    (void)archive_entry_is_data_encrypted(entry);\n    (void)archive_entry_is_encrypted(entry);\n    (void)archive_entry_is_metadata_encrypted(entry);\n    (void)archive_entry_mode(entry);\n    (void)archive_entry_mtime(entry);\n    (void)archive_entry_size(entry);\n    (void)archive_entry_uid(entry);\n\n    ssize_t r;\n    while ((r = archive_read_data(a, data_buffer.data(),\n            data_buffer.size())) > 0)\n      ;\n    if (r == ARCHIVE_FATAL)\n      break;\n  }\n\n  archive_read_has_encrypted_entries(a);\n  archive_read_format_capabilities(a);\n  archive_file_count(a);\n  archive_seek_data(a, 0, SEEK_SET);\n\n  archive_read_free(a);\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>ParseUint8() was not working, fixed wrong data type<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: bufferedfile.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-10-19 14:44:47 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n#include <string.h>\n#include \"bufferedfile.hxx\"\n\n#include \"filehelper.hxx\"\n\n#include <algorithm>\n\n\nnamespace configmgr\n{\n\nBufferedInputFile::BufferedInputFile( rtl::OUString const& aFileURL)\n: m_aFileURL(aFileURL)\n, m_pBuffer(0)\n, m_nPointer(0)\n, m_nSize(0)\n{\n}\n\n\/** D'tor\n *\/\n\nBufferedInputFile::~BufferedInputFile()\n{\n    delete [] m_pBuffer;\n}\n\nBufferedInputFile::RC BufferedInputFile::open( sal_uInt32 uFlags )\n{\n    OSL_ENSURE(!m_pBuffer,\"File already open\");\n\n    osl::File theFile(m_aFileURL);\n    RC rc = theFile.open(uFlags);\n    if (rc != E_None)\n        return rc;\n\n    sal_uInt64 theSize;\n    rc = theFile.getSize(theSize);\n    if (rc != E_None)\n        return rc;\n\n    \/\/ still prevent leaks in case of misuse\n    delete [] m_pBuffer, m_pBuffer = 0;\n\n    m_pBuffer = new sal_Int8[theSize];\n\n    sal_uInt64 nReallyRead = 0;\n    rc = theFile.read(m_pBuffer, theSize, nReallyRead);\n    if (rc != E_None)\n    {\n        delete [] m_pBuffer, m_pBuffer = 0;\n        return rc;\n    }\n\n    OSL_ENSURE(nReallyRead == m_nSize, \"Error, read file can't get it's complete file data\");\n    m_nSize = nReallyRead;\n    m_nPointer = 0;\n\n    return E_None;\n}\n\nBufferedInputFile::RC BufferedInputFile::close()\n{\n    if (m_pBuffer == 0)\n        return E_BADF;\n\n    delete [] m_pBuffer, m_pBuffer = 0;\n    m_nSize = 0;\n    return E_None;\n}\n\nBufferedInputFile::RC BufferedInputFile::setPos( sal_uInt32 uHow, sal_uInt64 uPos )\n{\n    if (m_pBuffer == 0)\n        return E_BADF;\n\n    switch (uHow)\n    {\n    case osl_Pos_Absolut:\n        m_nPointer = uPos;\n        break;\n    case osl_Pos_Current:\n        m_nPointer += uPos;\n        break;\n    case osl_Pos_End:\n        m_nPointer = m_nSize + uPos;\n        break;\n    default:\n        return E_INVAL;\n    }\n    return E_None;\n}\n\nBufferedInputFile::RC BufferedInputFile::getPos( sal_uInt64& uPos )\n{\n    if (m_pBuffer == 0)\n        return E_BADF;\n\n    uPos = m_nPointer;\n    return E_None;\n}\n\nBufferedInputFile::RC BufferedInputFile::available( sal_uInt64& nAvail) const\n{\n    if (m_pBuffer == 0)\n        return E_BADF;\n\n    if (m_nPointer < m_nSize)\n        nAvail = m_nSize-m_nPointer;\n    else\n        nAvail = 0;\n\n    return E_None;\n}\n\nBufferedInputFile::RC BufferedInputFile::read( void *pBuffer, sal_uInt64 uBytesRequested, sal_uInt64& rBytesRead )\n{\n    if (m_pBuffer == 0)\n        return E_BADF;\n\n    if (m_nPointer < m_nSize)\n    {\n        \/\/ requested size may be greater than the real file size\n        rBytesRead = std::min(m_nSize - m_nPointer, uBytesRequested);\n\n        memcpy(pBuffer, m_pBuffer + m_nPointer, rBytesRead);\n        m_nPointer += rBytesRead;\n    }\n    else\n    {\n        \/\/ EOF\n        rBytesRead = 0;\n    }\n    return E_None;\n}\n\nBufferedOutputFile::BufferedOutputFile( rtl::OUString const& aFileURL, sal_uInt32 nBufferSizeHint )\n: m_pFile(new osl::File(aFileURL))\n, m_buffer()\n{\n    m_buffer.reserve( nBufferSizeHint ? nBufferSizeHint : 512 );\n}\n\nBufferedOutputFile::~BufferedOutputFile ()\n{\n    delete m_pFile;\n}\n\n\nBufferedOutputFile::RC BufferedOutputFile::open( sal_uInt32 uFlags )\n{\n    if (!m_pFile) return E_BADF;\n\n    return m_pFile->open(uFlags);\n}\n\nBufferedOutputFile::RC BufferedOutputFile::close()\n{\n    if (!m_pFile) return E_BADF;\n\n    RC rc = this->sync();\n    RC rc2 = m_pFile->close();\n\n    delete m_pFile, m_pFile = 0;\n    if (rc == E_None)\n        rc = rc2;\n    return rc;\n}\n\n\n\/\/BufferedOutputFile::RC BufferedOutputFile::getPos( sal_uInt64& uPos )\n\nBufferedOutputFile::RC BufferedOutputFile::write(const void *pBuffer, sal_uInt64 uBytesToWrite, sal_uInt64& rBytesWritten)\n{\n    if (!m_pFile) return E_BADF;\n\n    if (uBytesToWrite > m_buffer.max_size()-m_buffer.size())\n    {\n        \/\/ write big chunks natively\n        RC rc = this->sync();\n        if (rc == E_None)\n        {\n            OSL_ASSERT(m_buffer.empty());\n            rc = m_pFile->write(pBuffer, uBytesToWrite, rBytesWritten);\n        }\n        return rc;\n    }\n\n    \/\/ FIXME: handle out-out-memory here\n    const sal_uInt8 * data = static_cast<const sal_uInt8 *>(pBuffer);\n    m_buffer.insert(m_buffer.end(), data, data + uBytesToWrite);\n    rBytesWritten = uBytesToWrite;\n\n    return E_None;\n}\n\nBufferedOutputFile::RC BufferedOutputFile::sync()\n{\n    if (!m_pFile) return E_BADF;\n\n    sal_uInt64 size = m_buffer.size();\n    sal_uInt64 written = 0;\n\n    RC rc = m_pFile->write(&m_buffer.front(),size,written);\n\n    if (rc != E_None)\n        return rc;\n\n    \/\/ we don't support special files where multiple write passes are needed\n    if (written < size)\n    {\n        \/\/ but we try our best to stay consistent\n        m_buffer.erase(m_buffer.begin(),m_buffer.begin()+written);\n\n        return E_IO;\n    }\n\n    m_buffer.clear();\n\n    return E_None;\n}\n\n} \/\/ namespace configmgr\n\n<commit_msg>INTEGRATION: CWS warnings01 (1.3.6); FILE MERGED 2006\/02\/14 10:17:35 cd 1.3.6.2: #i55991# Fix warnings for ms c++ compiler 2005\/11\/10 08:22:09 pl 1.3.6.1: #i53898# removed warnings<commit_after>\/*************************************************************************\n *\n *  $RCSfile: bufferedfile.cxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: hr $ $Date: 2006-06-19 23:27: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#include <string.h>\n#include \"bufferedfile.hxx\"\n\n#include \"filehelper.hxx\"\n\n#include <algorithm>\n\n\nnamespace configmgr\n{\n\nBufferedInputFile::BufferedInputFile( rtl::OUString const& aFileURL)\n: m_aFileURL(aFileURL)\n, m_pBuffer(0)\n, m_nPointer(0)\n, m_nSize(0)\n{\n}\n\n\/** D'tor\n *\/\n\nBufferedInputFile::~BufferedInputFile()\n{\n    delete [] m_pBuffer;\n}\n\nBufferedInputFile::RC BufferedInputFile::open( sal_uInt32 uFlags )\n{\n    OSL_ENSURE(!m_pBuffer,\"File already open\");\n\n    osl::File theFile(m_aFileURL);\n    RC rc = theFile.open(uFlags);\n    if (rc != E_None)\n        return rc;\n\n    sal_uInt64 theSize;\n    rc = theFile.getSize(theSize);\n    if (rc != E_None)\n        return rc;\n\n    \/\/ still prevent leaks in case of misuse\n    delete [] m_pBuffer, m_pBuffer = 0;\n\n    m_pBuffer = new sal_Int8[sal::static_int_cast<sal_Int32>(theSize)];\n\n    sal_uInt64 nReallyRead = 0;\n    rc = theFile.read(m_pBuffer, theSize, nReallyRead);\n    if (rc != E_None)\n    {\n        delete [] m_pBuffer, m_pBuffer = 0;\n        return rc;\n    }\n\n    OSL_ENSURE(nReallyRead == m_nSize, \"Error, read file can't get it's complete file data\");\n    m_nSize = nReallyRead;\n    m_nPointer = 0;\n\n    return E_None;\n}\n\nBufferedInputFile::RC BufferedInputFile::close()\n{\n    if (m_pBuffer == 0)\n        return E_BADF;\n\n    delete [] m_pBuffer, m_pBuffer = 0;\n    m_nSize = 0;\n    return E_None;\n}\n\nBufferedInputFile::RC BufferedInputFile::setPos( sal_uInt32 uHow, sal_uInt64 uPos )\n{\n    if (m_pBuffer == 0)\n        return E_BADF;\n\n    switch (uHow)\n    {\n    case osl_Pos_Absolut:\n        m_nPointer = uPos;\n        break;\n    case osl_Pos_Current:\n        m_nPointer += uPos;\n        break;\n    case osl_Pos_End:\n        m_nPointer = m_nSize + uPos;\n        break;\n    default:\n        return E_INVAL;\n    }\n    return E_None;\n}\n\nBufferedInputFile::RC BufferedInputFile::getPos( sal_uInt64& uPos )\n{\n    if (m_pBuffer == 0)\n        return E_BADF;\n\n    uPos = m_nPointer;\n    return E_None;\n}\n\nBufferedInputFile::RC BufferedInputFile::available( sal_uInt64& nAvail) const\n{\n    if (m_pBuffer == 0)\n        return E_BADF;\n\n    if (m_nPointer < m_nSize)\n        nAvail = m_nSize-m_nPointer;\n    else\n        nAvail = 0;\n\n    return E_None;\n}\n\nBufferedInputFile::RC BufferedInputFile::read( void *pBuffer, sal_uInt64 uBytesRequested, sal_uInt64& rBytesRead )\n{\n    if (m_pBuffer == 0)\n        return E_BADF;\n\n    if (m_nPointer < m_nSize)\n    {\n        \/\/ requested size may be greater than the real file size\n        rBytesRead = std::min(m_nSize - m_nPointer, uBytesRequested);\n\n        memcpy(pBuffer, m_pBuffer + m_nPointer, sal::static_int_cast<sal_Int32>(rBytesRead));\n        m_nPointer += rBytesRead;\n    }\n    else\n    {\n        \/\/ EOF\n        rBytesRead = 0;\n    }\n    return E_None;\n}\n\nBufferedOutputFile::BufferedOutputFile( rtl::OUString const& aFileURL, sal_uInt32 nBufferSizeHint )\n: m_pFile(new osl::File(aFileURL))\n, m_buffer()\n{\n    m_buffer.reserve( nBufferSizeHint ? nBufferSizeHint : 512 );\n}\n\nBufferedOutputFile::~BufferedOutputFile ()\n{\n    delete m_pFile;\n}\n\n\nBufferedOutputFile::RC BufferedOutputFile::open( sal_uInt32 uFlags )\n{\n    if (!m_pFile) return E_BADF;\n\n    return m_pFile->open(uFlags);\n}\n\nBufferedOutputFile::RC BufferedOutputFile::close()\n{\n    if (!m_pFile) return E_BADF;\n\n    RC rc = this->sync();\n    RC rc2 = m_pFile->close();\n\n    delete m_pFile, m_pFile = 0;\n    if (rc == E_None)\n        rc = rc2;\n    return rc;\n}\n\n\n\/\/BufferedOutputFile::RC BufferedOutputFile::getPos( sal_uInt64& uPos )\n\nBufferedOutputFile::RC BufferedOutputFile::write(const void *pBuffer, sal_uInt64 uBytesToWrite, sal_uInt64& rBytesWritten)\n{\n    if (!m_pFile) return E_BADF;\n\n    if (uBytesToWrite > m_buffer.max_size()-m_buffer.size())\n    {\n        \/\/ write big chunks natively\n        RC rc = this->sync();\n        if (rc == E_None)\n        {\n            OSL_ASSERT(m_buffer.empty());\n            rc = m_pFile->write(pBuffer, uBytesToWrite, rBytesWritten);\n        }\n        return rc;\n    }\n\n    \/\/ FIXME: handle out-out-memory here\n    const sal_uInt8 * data = static_cast<const sal_uInt8 *>(pBuffer);\n    m_buffer.insert(m_buffer.end(), data, data + uBytesToWrite);\n    rBytesWritten = uBytesToWrite;\n\n    return E_None;\n}\n\nBufferedOutputFile::RC BufferedOutputFile::sync()\n{\n    if (!m_pFile) return E_BADF;\n\n    sal_uInt64 size = m_buffer.size();\n    sal_uInt64 written = 0;\n\n    RC rc = m_pFile->write(&m_buffer.front(),size,written);\n\n    if (rc != E_None)\n        return rc;\n\n    \/\/ we don't support special files where multiple write passes are needed\n    if (written < size)\n    {\n        \/\/ but we try our best to stay consistent\n        m_buffer.erase(m_buffer.begin(),\n                       m_buffer.end() + sal::static_int_cast<sal_uInt32>( written ));\n\n        return E_IO;\n    }\n\n    m_buffer.clear();\n\n    return E_None;\n}\n\n} \/\/ namespace configmgr\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * AscEmu Framework based on ArcEmu MMORPG Server\n * Copyright (c) 2014-2017 AscEmu Team <http:\/\/www.ascemu.org\/>\n * Copyright (C) 2008-2012 ArcEmu Team <http:\/\/www.ArcEmu.org\/>\n * Copyright (C) 2005-2007 Ascent Team\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\n *\/\n\n#include \"StdAfx.h\"\n#include \"Server\/Console\/BaseConsole.h\"\n#include \"Server\/Console\/CConsole.h\"\n#include \"Log.hpp\"\n\nLocalConsole g_localConsole;\n\n#ifndef WIN32\n#include <poll.h>\n#endif\n\nvoid ConsoleThread::terminate()\n{\n    m_killSwitch = true;\n#ifdef WIN32\n    \/* write the return keydown\/keyup event *\/\n    DWORD dwTmp;\n    INPUT_RECORD ir[2];\n    ir[0].EventType = KEY_EVENT;\n    ir[0].Event.KeyEvent.bKeyDown = TRUE;\n    ir[0].Event.KeyEvent.dwControlKeyState = 288;\n    ir[0].Event.KeyEvent.uChar.AsciiChar = 13;\n    ir[0].Event.KeyEvent.wRepeatCount = 1;\n    ir[0].Event.KeyEvent.wVirtualKeyCode = 13;\n    ir[0].Event.KeyEvent.wVirtualScanCode = 28;\n    ir[1].EventType = KEY_EVENT;\n    ir[1].Event.KeyEvent.bKeyDown = FALSE;\n    ir[1].Event.KeyEvent.dwControlKeyState = 288;\n    ir[1].Event.KeyEvent.uChar.AsciiChar = 13;\n    ir[1].Event.KeyEvent.wRepeatCount = 1;\n    ir[1].Event.KeyEvent.wVirtualKeyCode = 13;\n    ir[1].Event.KeyEvent.wVirtualScanCode = 28;\n    WriteConsoleInput(GetStdHandle(STD_INPUT_HANDLE), ir, 2, &dwTmp);\n#endif\n    LOG_BASIC(\"Waiting for console thread to terminate....\");\n    while (m_isRunning)\n    {\n        Arcemu::Sleep(100);\n    }\n    LOG_BASIC(\"Console shut down.\");\n}\n\nbool ConsoleThread::run()\n{\n    SetThreadName(\"Console Interpreter\");\n    size_t i = 0;\n    size_t len;\n    char cmd[300];\n#ifndef WIN32\n    struct pollfd input;\n\n    input.fd      = 0;\n    input.events  = POLLIN | POLLPRI;\n    input.revents = 0;\n#endif\n\n    m_killSwitch = false;\n    m_isRunning = true;\n    while (m_killSwitch != true)\n    {\n#ifdef WIN32\n\n        \/\/ Read in single line from \"stdin\"\n        memset(cmd, 0, sizeof(cmd));\n        if (fgets(cmd, 300, stdin) == NULL)\n            continue;\n\n        if (m_killSwitch)\n            break;\n\n#else\n        int ret = poll(&input, 1, 1000);\n        if (ret < 0)\n        {\n            break;\n        }\n        else if (ret == 0)\n        {\n            if (!m_killSwitch)    \/\/ timeout\n                continue;\n            else\n                break;\n        }\n\n        \/\/ null terminate string before call read\n        size_t size = strlen(cmd) + sizeof(char);\n        char* cmd2 = (char*)malloc(size);\n        strncpy(cmd2, cmd, sizet);\n\n        ret = read(0, cmd2, sizeof(cmd));\n        if (ret <= 0)\n        {\n            break;\n        }\n#endif\n\n        len = strlen(cmd);\n        for (i = 0; i < len; ++i)\n        {\n            if (cmd[i] == '\\n' || cmd[i] == '\\r')\n                cmd[i] = '\\0';\n        }\n\n        HandleConsoleInput(&g_localConsole, cmd);\n    }\n    m_isRunning = false;\n    return false;\n}\n<commit_msg>Resolved error: ‘sizet’ was not declared in this scope<commit_after>\/*\n * AscEmu Framework based on ArcEmu MMORPG Server\n * Copyright (c) 2014-2017 AscEmu Team <http:\/\/www.ascemu.org\/>\n * Copyright (C) 2008-2012 ArcEmu Team <http:\/\/www.ArcEmu.org\/>\n * Copyright (C) 2005-2007 Ascent Team\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\n *\/\n\n#include \"StdAfx.h\"\n#include \"Server\/Console\/BaseConsole.h\"\n#include \"Server\/Console\/CConsole.h\"\n#include \"Log.hpp\"\n\nLocalConsole g_localConsole;\n\n#ifndef WIN32\n#include <poll.h>\n#endif\n\nvoid ConsoleThread::terminate()\n{\n    m_killSwitch = true;\n#ifdef WIN32\n    \/* write the return keydown\/keyup event *\/\n    DWORD dwTmp;\n    INPUT_RECORD ir[2];\n    ir[0].EventType = KEY_EVENT;\n    ir[0].Event.KeyEvent.bKeyDown = TRUE;\n    ir[0].Event.KeyEvent.dwControlKeyState = 288;\n    ir[0].Event.KeyEvent.uChar.AsciiChar = 13;\n    ir[0].Event.KeyEvent.wRepeatCount = 1;\n    ir[0].Event.KeyEvent.wVirtualKeyCode = 13;\n    ir[0].Event.KeyEvent.wVirtualScanCode = 28;\n    ir[1].EventType = KEY_EVENT;\n    ir[1].Event.KeyEvent.bKeyDown = FALSE;\n    ir[1].Event.KeyEvent.dwControlKeyState = 288;\n    ir[1].Event.KeyEvent.uChar.AsciiChar = 13;\n    ir[1].Event.KeyEvent.wRepeatCount = 1;\n    ir[1].Event.KeyEvent.wVirtualKeyCode = 13;\n    ir[1].Event.KeyEvent.wVirtualScanCode = 28;\n    WriteConsoleInput(GetStdHandle(STD_INPUT_HANDLE), ir, 2, &dwTmp);\n#endif\n    LOG_BASIC(\"Waiting for console thread to terminate....\");\n    while (m_isRunning)\n    {\n        Arcemu::Sleep(100);\n    }\n    LOG_BASIC(\"Console shut down.\");\n}\n\nbool ConsoleThread::run()\n{\n    SetThreadName(\"Console Interpreter\");\n    size_t i = 0;\n    size_t len;\n    char cmd[300];\n#ifndef WIN32\n    struct pollfd input;\n\n    input.fd      = 0;\n    input.events  = POLLIN | POLLPRI;\n    input.revents = 0;\n#endif\n\n    m_killSwitch = false;\n    m_isRunning = true;\n    while (m_killSwitch != true)\n    {\n#ifdef WIN32\n\n        \/\/ Read in single line from \"stdin\"\n        memset(cmd, 0, sizeof(cmd));\n        if (fgets(cmd, 300, stdin) == NULL)\n            continue;\n\n        if (m_killSwitch)\n            break;\n\n#else\n        int ret = poll(&input, 1, 1000);\n        if (ret < 0)\n        {\n            break;\n        }\n        else if (ret == 0)\n        {\n            if (!m_killSwitch)    \/\/ timeout\n                continue;\n            else\n                break;\n        }\n\n        \/\/ null terminate string before call read\n        size_t size = strlen(cmd) + sizeof(char);\n        char* cmd2 = (char*)malloc(size);\n        strncpy(cmd2, cmd, size);\n\n        ret = read(0, cmd2, sizeof(cmd));\n        if (ret <= 0)\n        {\n            break;\n        }\n#endif\n\n        len = strlen(cmd);\n        for (i = 0; i < len; ++i)\n        {\n            if (cmd[i] == '\\n' || cmd[i] == '\\r')\n                cmd[i] = '\\0';\n        }\n\n        HandleConsoleInput(&g_localConsole, cmd);\n    }\n    m_isRunning = false;\n    return false;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/usr\/mmio\/test\/mmiotest.H $                                *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2011,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 mmiotest.H\n *\n *  @brief Test cases for MMIO code\n *\/\n\n#include <cxxtest\/TestSuite.H>\n#include <errl\/errlmanager.H>\n#include <errl\/errlentry.H>\n#include <limits.h>\n#include <devicefw\/driverif.H>\n#include \"..\/mmio.H\"\n#include <targeting\/common\/utilFilter.H>\n#include <explorer_scom_addresses.H>\n#include <exp_oc_regs.H>\n#include <sys\/mmio.h>\n#include <utils\/chipids.H>\n#include <test\/exptest_utils.H>\n\n#define SCOM2MMIO_ADDR(_ADDR) (EXPLR_IB_MMIO_OFFSET | (_ADDR << 3))\n#define CNFG2MMIO_ADDR(_ADDR) (EXPLR_IB_CONFIG_OFFSET | _ADDR)\n#define BYTESWAP64(_DATA) (__builtin_bswap64(_DATA))\n\nstatic const uint64_t EXPLR_IB_CONFIG_OFFSET = 0x0000000000000000ull;\nstatic const uint64_t EXPLR_IB_MMIO_OFFSET   = 0x0000000100000000ull; \/\/ 4GB\n\n\/\/ NOTE: changing this address requires changes\n\/\/       to src\/build\/simics\/standalone.simics\nstatic const uint64_t EXPLR_INVALID_SCOM_ADDR =\n                            EXPLR_TP_MB_UNIT_TOP_TRACE_TRDATA_CONFIG_0;\n\nusing namespace TARGETING;\n\nclass MmioTest : public CxxTest::TestSuite\n{\n  public:\n\n    \/**\n     * @brief Test MMIO calls\n     *\/\n    void testExplrMMIO(void)\n    {\n        TS_INFO(\"testExplrMMIO> Start\" );\n\n        errlHndl_t l_err = nullptr;\n        uint32_t regdata4 = 0;\n        size_t op_size = 0;\n\n        \/\/ Needed since the device operations could be using inband communication in error path\n        HB_MUTEX_SERIALIZE_TEST_LOCK_ATTR l_mutex = exptest::getTestMutex();\n        if (l_mutex == nullptr)\n        {\n            TS_FAIL(\"testExplrMMIO: unable to get test mutex\");\n            return;\n        }\n\n        \/\/ >> atomic section\n        mutex_lock(l_mutex);\n\n        TargetHandle_t   explr_target = nullptr;\n\n        do {\n\n            \/\/ Get OCMB target, return if there is no OCMB\n            TargetHandleList ocmb_target_list;\n            getAllChips(ocmb_target_list, TYPE_OCMB_CHIP);\n            if (ocmb_target_list.size() == 0)\n            {\n                TS_INFO(\"testExplrMMIO> No OCMB targets found.  Exiting.\");\n                break;\n            }\n            explr_target = ocmb_target_list[0];\n            if(explr_target->getAttr<ATTR_CHIP_ID>() !=\n                                                     POWER_CHIPID::EXPLORER_16)\n            {\n                TS_INFO(\"testExplrMMIO> No explorer targets found.  Exiting.\");\n                break;\n            }\n\n            \/\/ Make sure we're using MMIO to this explorer chip\n            exptest::enableInbandScomsOcmb(explr_target);\n\n            \/\/ valid read from config space register\n            op_size = sizeof(regdata4);\n            l_err = DeviceFW::deviceRead(\n                              explr_target,\n                              &regdata4,\n                              op_size,\n                              DEVICE_MMIO_ADDRESS(\n                                  CNFG2MMIO_ADDR(EXPLR_OC_O0MBIT_O0DID_LSB),\n                                  op_size));\n\n            if(l_err != nullptr)\n            {\n                errlCommit(l_err, CXXTEST_COMP_ID);\n                TS_FAIL(\"testExplrMMIO> Error for config read, RC=0x%04X\",\n                        ERRL_GETRC_SAFE(l_err));\n            }\n\n            \/\/ valid write to config space register\n            op_size = sizeof(regdata4);\n            l_err = DeviceFW::deviceWrite(\n                              explr_target,\n                              &regdata4,\n                              op_size,\n                              DEVICE_MMIO_ADDRESS(\n                                  CNFG2MMIO_ADDR(EXPLR_OC_O0CCD_LSB),\n                                  op_size));\n            if(l_err != nullptr)\n            {\n                errlCommit(l_err, CXXTEST_COMP_ID);\n                TS_FAIL(\"testExplrMMIO> Error for config write, RC=0x%04X\",\n                        ERRL_GETRC_SAFE(l_err));\n            }\n\n            \/\/ 1st valid write to SCOM register (also sets up\n            \/\/ tests for forcing HW read\/write failures)\n            \/\/ EXPLR_TP_MB_UNIT_TOP_GIF2PCB_ERROR_REG = 0x080F0000\n            \/\/ Set the PCB error bits (8:10) to binary 100, which means\n            \/\/ 'invalid address'\n            \/\/ NOTE: must byteswap to little endian before writing\n            uint64_t GIF2PCB_INVALID_SCOM_ADDR_ERROR = 0x0080000000000000ull;\n            uint64_t l_buffer64 = BYTESWAP64(GIF2PCB_INVALID_SCOM_ADDR_ERROR);\n            op_size = sizeof(l_buffer64);\n            l_err = DeviceFW::deviceWrite(\n                              explr_target,\n                              &l_buffer64,\n                              op_size,\n                              DEVICE_MMIO_ADDRESS(\n                                 SCOM2MMIO_ADDR(\n                                     EXPLR_TP_MB_UNIT_TOP_GIF2PCB_ERROR_REG),\n                                 op_size));\n\n            if(l_err != nullptr)\n            {\n                errlCommit(l_err, CXXTEST_COMP_ID);\n                TS_FAIL(\"testExplrMMIO> Error for gif2pcb write, RC=0x%04X\",\n                        ERRL_GETRC_SAFE(l_err));\n                break;\n            }\n\n            \/\/ 2nd valid write to SCOM register (also sets up\n            \/\/ tests for forcing HW read\/write failures)\n            \/\/ EXPLR_TP_MB_UNIT_TOP_PIB2GIF_ERROR_REG = 0x080E0000\n            \/\/ This register should contain a copy of the GIF2PCB error register\n            \/\/ starting at bit 32\n            \/\/ NOTE: must byteswap to little endian before writing data\n            uint64_t PIB2GIF_INVALID_SCOM_ADDR_ERROR =\n                            0x0000000000000000ull |\n                            ((GIF2PCB_INVALID_SCOM_ADDR_ERROR &\n                              0xffffc00000000000ull) >> 32);\n            l_buffer64 = BYTESWAP64(PIB2GIF_INVALID_SCOM_ADDR_ERROR);\n            op_size = sizeof(l_buffer64);\n            l_err = DeviceFW::deviceWrite(\n                              explr_target,\n                              &l_buffer64,\n                              op_size,\n                              DEVICE_MMIO_ADDRESS(\n                                    SCOM2MMIO_ADDR(\n                                        EXPLR_TP_MB_UNIT_TOP_PIB2GIF_ERROR_REG),\n                                    op_size));\n\n            if(l_err != nullptr)\n            {\n                errlCommit(l_err, CXXTEST_COMP_ID);\n                TS_FAIL(\"testExplrMMIO> Error for pib2gif write, RC=0x%04X\",\n                        ERRL_GETRC_SAFE(l_err));\n                break;\n            }\n\n            \/\/ Write to an \"invalid\" scom address.  Should\n            \/\/ return with failure (now that we've set up the error regs).\n            \/\/ EXPLR_INVALID_SCOM_ADDR =\n            \/\/   EXPLR_TP_MB_UNIT_TOP_TRACE_TRDATA_CONFIG_0 = 0x08010403\n            \/\/ NOTE: Also, writing MMIO_OCMB_UE_DETECTED to this register\n            \/\/       sets up the following read to the same register\n            \/\/       to fail.\n            l_buffer64 = MMIO_OCMB_UE_DETECTED;\n            op_size = sizeof(l_buffer64);\n            l_err = DeviceFW::deviceWrite(\n                              explr_target,\n                              &l_buffer64,\n                              op_size,\n                              DEVICE_MMIO_ADDRESS(\n                                  SCOM2MMIO_ADDR(EXPLR_INVALID_SCOM_ADDR),\n                                  op_size));\n            if(l_err == nullptr)\n            {\n                ScomSwitches l_switches =\n                    explr_target->getAttr<ATTR_SCOM_SWITCHES>();\n                TS_INFO(\"testExplrMMIO: Current SCOM mode: %s\",\n                        (l_switches.useInbandScom)? \"MMIO\": \"I2C\");\n                TS_FAIL(\"testExplrMMIO> \"\n                        \"did not recieve expected failure on mmio write\");\n                break;\n            }\n            else\n            {\n                TS_INFO(\"testExplrMMIO> \"\n                        \"received expected failure on mmio write\");\n                errlCommit(l_err, CXXTEST_COMP_ID);\n            }\n\n            \/\/ Re-enable inband scoms after failure disables it\n            exptest::enableInbandScomsOcmb(explr_target);\n\n            \/\/ Read from an \"invalid\" scom address.  Should\n            \/\/ return with failure (now that we've set up the error regs).\n            op_size = sizeof(l_buffer64);\n            l_err = DeviceFW::deviceRead(\n                              explr_target,\n                              &l_buffer64,\n                              op_size,\n                              DEVICE_MMIO_ADDRESS(\n                                  SCOM2MMIO_ADDR(EXPLR_INVALID_SCOM_ADDR),\n                                  op_size));\n\n            if(l_err == nullptr)\n            {\n                ScomSwitches l_switches =\n                    explr_target->getAttr<ATTR_SCOM_SWITCHES>();\n                TS_INFO(\"testExplrMMIO> \"\n                        \"data read from invalid address: 0x%016llx\",\n                        l_buffer64);\n                TS_INFO(\"testExplrMMIO: Current SCOM mode: %s\",\n                        (l_switches.useInbandScom)? \"MMIO\": \"I2C\");\n                TS_FAIL(\"testExplrMMIO> \"\n                        \"did not recieve expected failure on mmio read\");\n            }\n            else\n            {\n                TS_INFO(\"testExplrMMIO> \"\n                        \"received expected failure on mmio read\");\n                errlCommit(l_err, CXXTEST_COMP_ID);\n            }\n\n        } while (0);\n\n        \/\/ Re-enable inband scoms after failure disables it\n        if(explr_target != nullptr)\n        {\n            exptest::enableInbandScomsOcmb(explr_target);\n        }\n\n        \/\/ << atomic section\n        mutex_unlock(l_mutex);\n        TS_INFO(\"testExplrMMIO> Done\");\n    };\n};\n<commit_msg>Don't commit expected errors in testExplrMMIO<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/usr\/mmio\/test\/mmiotest.H $                                *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2011,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 mmiotest.H\n *\n *  @brief Test cases for MMIO code\n *\/\n\n#include <cxxtest\/TestSuite.H>\n#include <errl\/errlmanager.H>\n#include <errl\/errlentry.H>\n#include <limits.h>\n#include <devicefw\/driverif.H>\n#include \"..\/mmio.H\"\n#include <targeting\/common\/utilFilter.H>\n#include <explorer_scom_addresses.H>\n#include <exp_oc_regs.H>\n#include <sys\/mmio.h>\n#include <utils\/chipids.H>\n#include <test\/exptest_utils.H>\n\n#define SCOM2MMIO_ADDR(_ADDR) (EXPLR_IB_MMIO_OFFSET | (_ADDR << 3))\n#define CNFG2MMIO_ADDR(_ADDR) (EXPLR_IB_CONFIG_OFFSET | _ADDR)\n#define BYTESWAP64(_DATA) (__builtin_bswap64(_DATA))\n\nstatic const uint64_t EXPLR_IB_CONFIG_OFFSET = 0x0000000000000000ull;\nstatic const uint64_t EXPLR_IB_MMIO_OFFSET   = 0x0000000100000000ull; \/\/ 4GB\n\n\/\/ NOTE: changing this address requires changes\n\/\/       to src\/build\/simics\/standalone.simics\nstatic const uint64_t EXPLR_INVALID_SCOM_ADDR =\n                            EXPLR_TP_MB_UNIT_TOP_TRACE_TRDATA_CONFIG_0;\n\nusing namespace TARGETING;\n\nclass MmioTest : public CxxTest::TestSuite\n{\n  public:\n\n    \/**\n     * @brief Test MMIO calls\n     *\/\n    void testExplrMMIO(void)\n    {\n        TS_INFO(\"testExplrMMIO> Start\" );\n\n        errlHndl_t l_err = nullptr;\n        uint32_t regdata4 = 0;\n        size_t op_size = 0;\n\n        \/\/ Needed since the device operations could be using inband communication in error path\n        HB_MUTEX_SERIALIZE_TEST_LOCK_ATTR l_mutex = exptest::getTestMutex();\n        if (l_mutex == nullptr)\n        {\n            TS_FAIL(\"testExplrMMIO: unable to get test mutex\");\n            return;\n        }\n\n        \/\/ >> atomic section\n        mutex_lock(l_mutex);\n\n        TargetHandle_t   explr_target = nullptr;\n\n        do {\n\n            \/\/ Get OCMB target, return if there is no OCMB\n            TargetHandleList ocmb_target_list;\n            getAllChips(ocmb_target_list, TYPE_OCMB_CHIP);\n            if (ocmb_target_list.size() == 0)\n            {\n                TS_INFO(\"testExplrMMIO> No OCMB targets found.  Exiting.\");\n                break;\n            }\n            explr_target = ocmb_target_list[0];\n            if(explr_target->getAttr<ATTR_CHIP_ID>() !=\n                                                     POWER_CHIPID::EXPLORER_16)\n            {\n                TS_INFO(\"testExplrMMIO> No explorer targets found.  Exiting.\");\n                break;\n            }\n\n            \/\/ Make sure we're using MMIO to this explorer chip\n            exptest::enableInbandScomsOcmb(explr_target);\n\n            \/\/ valid read from config space register\n            op_size = sizeof(regdata4);\n            l_err = DeviceFW::deviceRead(\n                              explr_target,\n                              &regdata4,\n                              op_size,\n                              DEVICE_MMIO_ADDRESS(\n                                  CNFG2MMIO_ADDR(EXPLR_OC_O0MBIT_O0DID_LSB),\n                                  op_size));\n\n            if(l_err != nullptr)\n            {\n                errlCommit(l_err, CXXTEST_COMP_ID);\n                TS_FAIL(\"testExplrMMIO> Error for config read, RC=0x%04X\",\n                        ERRL_GETRC_SAFE(l_err));\n            }\n\n            \/\/ valid write to config space register\n            op_size = sizeof(regdata4);\n            l_err = DeviceFW::deviceWrite(\n                              explr_target,\n                              &regdata4,\n                              op_size,\n                              DEVICE_MMIO_ADDRESS(\n                                  CNFG2MMIO_ADDR(EXPLR_OC_O0CCD_LSB),\n                                  op_size));\n            if(l_err != nullptr)\n            {\n                errlCommit(l_err, CXXTEST_COMP_ID);\n                TS_FAIL(\"testExplrMMIO> Error for config write, RC=0x%04X\",\n                        ERRL_GETRC_SAFE(l_err));\n            }\n\n            \/\/ 1st valid write to SCOM register (also sets up\n            \/\/ tests for forcing HW read\/write failures)\n            \/\/ EXPLR_TP_MB_UNIT_TOP_GIF2PCB_ERROR_REG = 0x080F0000\n            \/\/ Set the PCB error bits (8:10) to binary 100, which means\n            \/\/ 'invalid address'\n            \/\/ NOTE: must byteswap to little endian before writing\n            uint64_t GIF2PCB_INVALID_SCOM_ADDR_ERROR = 0x0080000000000000ull;\n            uint64_t l_buffer64 = BYTESWAP64(GIF2PCB_INVALID_SCOM_ADDR_ERROR);\n            op_size = sizeof(l_buffer64);\n            l_err = DeviceFW::deviceWrite(\n                              explr_target,\n                              &l_buffer64,\n                              op_size,\n                              DEVICE_MMIO_ADDRESS(\n                                 SCOM2MMIO_ADDR(\n                                     EXPLR_TP_MB_UNIT_TOP_GIF2PCB_ERROR_REG),\n                                 op_size));\n\n            if(l_err != nullptr)\n            {\n                errlCommit(l_err, CXXTEST_COMP_ID);\n                TS_FAIL(\"testExplrMMIO> Error for gif2pcb write, RC=0x%04X\",\n                        ERRL_GETRC_SAFE(l_err));\n                break;\n            }\n\n            \/\/ 2nd valid write to SCOM register (also sets up\n            \/\/ tests for forcing HW read\/write failures)\n            \/\/ EXPLR_TP_MB_UNIT_TOP_PIB2GIF_ERROR_REG = 0x080E0000\n            \/\/ This register should contain a copy of the GIF2PCB error register\n            \/\/ starting at bit 32\n            \/\/ NOTE: must byteswap to little endian before writing data\n            uint64_t PIB2GIF_INVALID_SCOM_ADDR_ERROR =\n                            0x0000000000000000ull |\n                            ((GIF2PCB_INVALID_SCOM_ADDR_ERROR &\n                              0xffffc00000000000ull) >> 32);\n            l_buffer64 = BYTESWAP64(PIB2GIF_INVALID_SCOM_ADDR_ERROR);\n            op_size = sizeof(l_buffer64);\n            l_err = DeviceFW::deviceWrite(\n                              explr_target,\n                              &l_buffer64,\n                              op_size,\n                              DEVICE_MMIO_ADDRESS(\n                                    SCOM2MMIO_ADDR(\n                                        EXPLR_TP_MB_UNIT_TOP_PIB2GIF_ERROR_REG),\n                                    op_size));\n\n            if(l_err != nullptr)\n            {\n                errlCommit(l_err, CXXTEST_COMP_ID);\n                TS_FAIL(\"testExplrMMIO> Error for pib2gif write, RC=0x%04X\",\n                        ERRL_GETRC_SAFE(l_err));\n                break;\n            }\n\n            \/\/ Write to an \"invalid\" scom address.  Should\n            \/\/ return with failure (now that we've set up the error regs).\n            \/\/ EXPLR_INVALID_SCOM_ADDR =\n            \/\/   EXPLR_TP_MB_UNIT_TOP_TRACE_TRDATA_CONFIG_0 = 0x08010403\n            \/\/ NOTE: Also, writing MMIO_OCMB_UE_DETECTED to this register\n            \/\/       sets up the following read to the same register\n            \/\/       to fail.\n            l_buffer64 = MMIO_OCMB_UE_DETECTED;\n            op_size = sizeof(l_buffer64);\n            l_err = DeviceFW::deviceWrite(\n                              explr_target,\n                              &l_buffer64,\n                              op_size,\n                              DEVICE_MMIO_ADDRESS(\n                                  SCOM2MMIO_ADDR(EXPLR_INVALID_SCOM_ADDR),\n                                  op_size));\n            if(l_err == nullptr)\n            {\n                ScomSwitches l_switches =\n                    explr_target->getAttr<ATTR_SCOM_SWITCHES>();\n                TS_INFO(\"testExplrMMIO: Current SCOM mode: %s\",\n                        (l_switches.useInbandScom)? \"MMIO\": \"I2C\");\n                TS_FAIL(\"testExplrMMIO> \"\n                        \"did not recieve expected failure on mmio write\");\n                break;\n            }\n            else\n            {\n                TS_INFO(\"testExplrMMIO> \"\n                        \"received expected failure on mmio write\");\n                delete l_err;\n                l_err = nullptr;\n            }\n\n            \/\/ Re-enable inband scoms after failure disables it\n            exptest::enableInbandScomsOcmb(explr_target);\n\n            \/\/ Read from an \"invalid\" scom address.  Should\n            \/\/ return with failure (now that we've set up the error regs).\n            op_size = sizeof(l_buffer64);\n            l_err = DeviceFW::deviceRead(\n                              explr_target,\n                              &l_buffer64,\n                              op_size,\n                              DEVICE_MMIO_ADDRESS(\n                                  SCOM2MMIO_ADDR(EXPLR_INVALID_SCOM_ADDR),\n                                  op_size));\n\n            if(l_err == nullptr)\n            {\n                ScomSwitches l_switches =\n                    explr_target->getAttr<ATTR_SCOM_SWITCHES>();\n                TS_INFO(\"testExplrMMIO> \"\n                        \"data read from invalid address: 0x%016llx\",\n                        l_buffer64);\n                TS_INFO(\"testExplrMMIO: Current SCOM mode: %s\",\n                        (l_switches.useInbandScom)? \"MMIO\": \"I2C\");\n                TS_FAIL(\"testExplrMMIO> \"\n                        \"did not recieve expected failure on mmio read\");\n            }\n            else\n            {\n                TS_INFO(\"testExplrMMIO> \"\n                        \"received expected failure on mmio read\");\n                delete l_err;\n                l_err = nullptr;\n            }\n\n        } while (0);\n\n        \/\/ Re-enable inband scoms after failure disables it\n        if(explr_target != nullptr)\n        {\n            exptest::enableInbandScomsOcmb(explr_target);\n        }\n\n        \/\/ << atomic section\n        mutex_unlock(l_mutex);\n        TS_INFO(\"testExplrMMIO> Done\");\n    };\n};\n<|endoftext|>"}
{"text":"<commit_before>#include \"util\/bitmap.h\"\n#include \"util\/trans-bitmap.h\"\n\n#include \"context-box.h\"\n#include \"util\/font.h\"\n#include <math.h>\n\n#include \"util\/token.h\"\n\nstatic const double FONT_SPACER = 1.3;\nstatic const int GradientMax = 50;\n\nstatic Graphics::Color selectedGradientStart(){\n    static Graphics::Color color = Graphics::makeColor(19, 167, 168);\n    return color;\n}\n\nstatic Graphics::Color selectedGradientEnd(){\n    static Graphics::Color color = Graphics::makeColor(27, 237, 239);\n    return color;\n}\n\nusing namespace std;\n\nnamespace Gui{\n\nEffects::Gradient standardGradient(int max){\n    Effects::Gradient standard(max, selectedGradientStart(), selectedGradientEnd());\n    return standard;\n}\n\nEffects::Gradient modifiedGradient(Graphics::Color low, Graphics::Color high, int max){\n    Effects::Gradient modified(max, low, high);\n    return modified;\n}\n\nListValues::ListValues():\ninterpolate(true),\nlowColor(selectedGradientStart()),\nhighColor(selectedGradientEnd()),\nmaxGradient(GradientMax),\nselectedColor(selectedGradientStart()),\nselectedAlpha(255),\notherColor(Graphics::makeColor(255, 255, 255)),\notherAlpha(255),\nfade(true){\n}\n\nListValues::ListValues(const ListValues & copy):\ninterpolate(copy.interpolate),\nlowColor(copy.lowColor),\nhighColor(copy.highColor),\nmaxGradient(copy.maxGradient),\nselectedColor(copy.selectedColor),\nselectedAlpha(copy.selectedAlpha),\notherColor(copy.otherColor),\notherAlpha(copy.otherAlpha),\nfade(copy.fade){\n}\n\nListValues::~ListValues(){\n}\n\nconst ListValues & ListValues::operator=(const ListValues & copy){\n    interpolate = copy.interpolate;\n    lowColor = copy.lowColor;\n    highColor = copy.highColor;\n    maxGradient = copy.maxGradient;\n    selectedColor = copy.selectedColor;\n    selectedAlpha = copy.selectedAlpha;\n    otherColor = copy.otherColor;\n    otherAlpha = copy.otherAlpha;\n    fade = copy.fade;\n    \n    return *this;\n}\n\nstatic int clamp(int in, int low=0, int high=255){\n    if (in < low){\n        return low;\n    }\n    if (in > high){\n        return high;\n    }\n    return in;\n}\n\nvoid ListValues::getValues(const Token * token){\n    TokenView view = token->view();\n    while (view.hasMore()){\n        const Token * token;\n        view >> token;\n        try{\n            int red = 0, green = 0, blue = 0, alpha = 0, gradient=1;\n            if (token->match(\"interpolate-selected\", interpolate)){\n            } else if (token->match(\"color-low\", red, green, blue)){\n                lowColor = Graphics::makeColor(clamp(red), clamp(green), clamp(blue));\n            } else if (token->match(\"color-high\", red, green, blue)){\n                highColor = Graphics::makeColor(clamp(red), clamp(green), clamp(blue));\n            } else if (token->match(\"max-gradient\", gradient)){\n                maxGradient = clamp(gradient, 1, 1000);\n            } else if (token->match(\"selected-color\", red, green, blue)){\n                selectedColor = Graphics::makeColor(clamp(red), clamp(green), clamp(blue));\n            } else if (token->match(\"selected-color-alpha\", alpha)){\n                selectedAlpha = clamp(alpha);\n            } else if (token->match(\"other-color\", red, green, blue)){\n                otherColor = Graphics::makeColor(clamp(red), clamp(green), clamp(blue));\n            } else if (token->match(\"other-color-alpha\", alpha)){\n                otherAlpha = clamp(alpha);\n            } else if (token->match(\"distance-fade\", fade)){\n            }\n        } catch (const TokenException & ex){\n            \/\/ Output something\n        }\n    }\n}\n\nContextItem::ContextItem(const std::string & name, const ContextBox & parent):\ntext(name),\nparent(parent){\n}\n\nContextItem::~ContextItem(){\n}\n\nvoid ContextItem::draw(int x, int y, const Graphics::Bitmap & where, const Font & font, int distance) const {\n    if (distance == 0){\n        if (parent.getListValues().getInterpolate()){\n            Graphics::Bitmap::transBlender(0, 0, 0, parent.getFadeAlpha());\n            font.printf(x, y, parent.getSelectedColor(), where.translucent(), getText(), 0);\n        } else {\n            Graphics::Bitmap::transBlender(0, 0, 0, parent.getListValues().getSelectedAlpha());\n            font.printf(x, y, parent.getListValues().getSelectedColor(), where.translucent(), getText(), 0);\n        }\n    } else {\n        if (parent.getListValues().getDistanceFade()){\n            int alpha = parent.getFadeAlpha() - fabs((double) distance) * 35;\n            if (alpha < 0){\n                alpha = 0;\n            }\n            Graphics::Bitmap::transBlender(0, 0, 0, alpha);\n            font.printf(x, y, parent.getListValues().getOtherColor(), where.translucent(), getText(), 0);\n        } else {\n            Graphics::Bitmap::transBlender(0, 0, 0, parent.getListValues().getOtherAlpha());\n            font.printf(x, y, parent.getListValues().getOtherColor(), where.translucent(), getText(), 0);\n        }\n    }\n}\n    \nvoid ContextItem::setText(const LanguageString & t){\n    text = t;\n}\n\nint ContextItem::size(const Font & font) const {\n    return font.textLength(getText().c_str());\n}\n\nContextBox::ContextBox():\nfadeState(NotActive),\nlist(new ScrollList()),\nfadeSpeed(12),\nfadeAlpha(0),\ncursorCenter(0),\ncursorLocation(0),\nscrollWait(4),\nselectedGradient(standardGradient(GradientMax)),\nrenderOnlyText(false){\n}\nContextBox::ContextBox( const ContextBox & copy ):\nfadeState(NotActive),\nlist(new ScrollList()),\nselectedGradient(standardGradient(GradientMax)),\nrenderOnlyText(false){\n    this->list = copy.list;\n    this->fadeSpeed = copy.fadeSpeed;\n    this->fadeAlpha = copy.fadeAlpha;\n    this->cursorCenter = copy.cursorCenter;\n    this->cursorLocation = copy.cursorLocation;\n    this->scrollWait = copy.scrollWait;\n    this->renderOnlyText = copy.renderOnlyText;\n}\nContextBox::~ContextBox(){\n}\nContextBox & ContextBox::operator=( const ContextBox & copy){\n    this->fadeState = NotActive;\n    this->list = copy.list;\n    this->fadeSpeed = copy.fadeSpeed;\n    this->fadeAlpha = copy.fadeAlpha;\n    this->cursorCenter = copy.cursorCenter;\n    this->cursorLocation = copy.cursorLocation;\n    this->scrollWait = copy.scrollWait;\n    this->renderOnlyText = copy.renderOnlyText;\n    return *this;\n}\n\nvoid ContextBox::act(const Font & font){\n    \/\/ update board\n    board.act(font);\n    \n    \/\/ Calculate text info\n    list->act();\n    \n    \/\/ do fade\n    doFade();\n    \n    \/\/ Update gradient\n    selectedGradient.update();\n}\n\nvoid ContextBox::render(const Graphics::Bitmap & work){\n}\n\nvoid ContextBox::render(const Graphics::Bitmap & work, const Font & font){\n    if (!renderOnlyText){\n\tboard.render(work);\n    }\n    drawText(work, font);\n}\n\nbool ContextBox::next(const Font & font){\n    if (fadeState == FadeOut){\n        return false;\n    }\n\n    list->next();\n\n    return true;\n}\n\nbool ContextBox::previous(const Font & font){\n    if (fadeState == FadeOut){\n        return false;\n    }\n\n    list->previous();\n\n    return true;\n}\n        \nGraphics::Color ContextBox::getSelectedColor() const {\n    return values.getInterpolate() ? selectedGradient.current() : values.getSelectedColor();\n}\n\nvoid ContextBox::setListValues(const Gui::ListValues & values){\n    this->values = values;\n    selectedGradient = modifiedGradient(values.getLowColor(), values.getHighColor(), values.getMaxGradient());\n}\n\nvoid ContextBox::adjustLeft(){\n}\n\nvoid ContextBox::adjustRight(){\n}\n\nvoid ContextBox::open(){\n    \/\/ Set the fade stuff\n    fadeState = FadeIn;\n    \/\/board.position = position;\n    board.location = location;\n    board.transforms = transforms;\n    board.colors = colors;\n    board.open();\n    fadeAlpha = 0;\n    cursorLocation = 0;\n}\n\nvoid ContextBox::close(){\n    fadeState = FadeOut;\n    board.close();\n    fadeAlpha = 255;\n    cursorLocation = 480;\n}\n\n\nvoid ContextBox::doFade(){\n    switch (fadeState){\n        case FadeIn: {\n            if (fadeAlpha < 255){\n                fadeAlpha += (fadeSpeed+2);\n            }\n\n            if (fadeAlpha >= 255){\n                fadeAlpha = 255;\n                if (board.isActive()){\n                    fadeState = Active;\n                }\n            }\n            break;\n        }\n        case FadeOut: {\n            if (fadeAlpha > 0){\n                fadeAlpha -= (fadeSpeed+2);\n            }\n\n            if (fadeAlpha <= 0){\n                fadeAlpha = 0;\n                if (!board.isActive()){\n                    fadeState = NotActive;\n                }\n            }\n            break;\n        }\n        case Active:\n        case NotActive:\n        default:\n            break;\n    }\n}\n\nvoid ContextBox::setList(const std::vector<Util::ReferenceCount<ContextItem> > & list){\n    this->list->clearItems();\n    for (vector<Util::ReferenceCount<ContextItem> >::const_iterator it = list.begin(); it != list.end(); it++){\n        const Util::ReferenceCount<ContextItem> & item = *it;\n        this->list->addItem(item.convert<ScrollItem>());\n    }\n}\n        \nvoid ContextBox::addItem(const Util::ReferenceCount<ContextItem> & item){\n    this->list->addItem(item.convert<ScrollItem>());\n}\n\nvoid ContextBox::setListType(const ListType & type){\n    switch (type){\n        case Normal:{\n            Util::ReferenceCount<ScrollListInterface> newList = new NormalList();\n            newList->addItems(list->getItems());\n            list = newList;\n            break;\n        }\n        case Scroll:{\n            Util::ReferenceCount<ScrollListInterface> newList = new ScrollList();\n            newList->addItems(list->getItems());\n            list = newList;\n            break;\n        }\n        default:\n            break;\n    }\n}\n\nvoid ContextBox::setListWrap(bool wrap){\n    list->setWrap(wrap);\n}\n\nvoid ContextBox::drawText(const Graphics::Bitmap & bmp, const Font & font){\n    const int x1 = board.getArea().getX()+(int)(board.getTransforms().getRadius()\/2);\n    const int y1 = board.getArea().getY()+2;\/\/(board.getArea().radius\/2);\n    const int x2 = board.getArea().getX2()-(int)(board.getTransforms().getRadius()\/2);\n    const int y2 = board.getArea().getY2()-2;\/\/(board.getArea().radius\/2);\n            \n    Graphics::Bitmap area(bmp, x1, y1, x2 - x1, y2 - y1);\n\n    list->render(area, font);\n}\n\n}\n<commit_msg>rename gradient size<commit_after>#include \"util\/bitmap.h\"\n#include \"util\/trans-bitmap.h\"\n\n#include \"context-box.h\"\n#include \"util\/font.h\"\n#include <math.h>\n\n#include \"util\/token.h\"\n\nstatic const double FONT_SPACER = 1.3;\nstatic const int GradientMax = 50;\n\nstatic Graphics::Color selectedGradientStart(){\n    static Graphics::Color color = Graphics::makeColor(19, 167, 168);\n    return color;\n}\n\nstatic Graphics::Color selectedGradientEnd(){\n    static Graphics::Color color = Graphics::makeColor(27, 237, 239);\n    return color;\n}\n\nusing namespace std;\n\nnamespace Gui{\n\nEffects::Gradient standardGradient(int max){\n    Effects::Gradient standard(max, selectedGradientStart(), selectedGradientEnd());\n    return standard;\n}\n\nEffects::Gradient modifiedGradient(Graphics::Color low, Graphics::Color high, int max){\n    Effects::Gradient modified(max, low, high);\n    return modified;\n}\n\nListValues::ListValues():\ninterpolate(true),\nlowColor(selectedGradientStart()),\nhighColor(selectedGradientEnd()),\nmaxGradient(GradientMax),\nselectedColor(selectedGradientStart()),\nselectedAlpha(255),\notherColor(Graphics::makeColor(255, 255, 255)),\notherAlpha(255),\nfade(true){\n}\n\nListValues::ListValues(const ListValues & copy):\ninterpolate(copy.interpolate),\nlowColor(copy.lowColor),\nhighColor(copy.highColor),\nmaxGradient(copy.maxGradient),\nselectedColor(copy.selectedColor),\nselectedAlpha(copy.selectedAlpha),\notherColor(copy.otherColor),\notherAlpha(copy.otherAlpha),\nfade(copy.fade){\n}\n\nListValues::~ListValues(){\n}\n\nconst ListValues & ListValues::operator=(const ListValues & copy){\n    interpolate = copy.interpolate;\n    lowColor = copy.lowColor;\n    highColor = copy.highColor;\n    maxGradient = copy.maxGradient;\n    selectedColor = copy.selectedColor;\n    selectedAlpha = copy.selectedAlpha;\n    otherColor = copy.otherColor;\n    otherAlpha = copy.otherAlpha;\n    fade = copy.fade;\n    \n    return *this;\n}\n\nstatic int clamp(int in, int low = 0, int high = 255){\n    if (in < low){\n        return low;\n    }\n    if (in > high){\n        return high;\n    }\n    return in;\n}\n\nvoid ListValues::getValues(const Token * token){\n    TokenView view = token->view();\n    while (view.hasMore()){\n        const Token * token;\n        view >> token;\n        try{\n            int red = 0, green = 0, blue = 0, alpha = 0, gradient=1;\n            if (token->match(\"interpolate-selected\", interpolate)){\n            } else if (token->match(\"color-low\", red, green, blue)){\n                lowColor = Graphics::makeColor(clamp(red), clamp(green), clamp(blue));\n            } else if (token->match(\"color-high\", red, green, blue)){\n                highColor = Graphics::makeColor(clamp(red), clamp(green), clamp(blue));\n            } else if (token->match(\"interpolate-distance\", gradient)){\n                maxGradient = clamp(gradient, 1, 1000);\n            } else if (token->match(\"selected-color\", red, green, blue)){\n                selectedColor = Graphics::makeColor(clamp(red), clamp(green), clamp(blue));\n            } else if (token->match(\"selected-color-alpha\", alpha)){\n                selectedAlpha = clamp(alpha);\n            } else if (token->match(\"other-color\", red, green, blue)){\n                otherColor = Graphics::makeColor(clamp(red), clamp(green), clamp(blue));\n            } else if (token->match(\"other-color-alpha\", alpha)){\n                otherAlpha = clamp(alpha);\n            } else if (token->match(\"distance-fade\", fade)){\n            }\n        } catch (const TokenException & ex){\n            \/\/ Output something\n        }\n    }\n}\n\nContextItem::ContextItem(const std::string & name, const ContextBox & parent):\ntext(name),\nparent(parent){\n}\n\nContextItem::~ContextItem(){\n}\n\nvoid ContextItem::draw(int x, int y, const Graphics::Bitmap & where, const Font & font, int distance) const {\n    if (distance == 0){\n        if (parent.getListValues().getInterpolate()){\n            Graphics::Bitmap::transBlender(0, 0, 0, parent.getFadeAlpha());\n            font.printf(x, y, parent.getSelectedColor(), where.translucent(), getText(), 0);\n        } else {\n            Graphics::Bitmap::transBlender(0, 0, 0, parent.getListValues().getSelectedAlpha());\n            font.printf(x, y, parent.getListValues().getSelectedColor(), where.translucent(), getText(), 0);\n        }\n    } else {\n        if (parent.getListValues().getDistanceFade()){\n            int alpha = parent.getFadeAlpha() - fabs((double) distance) * 35;\n            if (alpha < 0){\n                alpha = 0;\n            }\n            Graphics::Bitmap::transBlender(0, 0, 0, alpha);\n            font.printf(x, y, parent.getListValues().getOtherColor(), where.translucent(), getText(), 0);\n        } else {\n            Graphics::Bitmap::transBlender(0, 0, 0, parent.getListValues().getOtherAlpha());\n            font.printf(x, y, parent.getListValues().getOtherColor(), where.translucent(), getText(), 0);\n        }\n    }\n}\n    \nvoid ContextItem::setText(const LanguageString & t){\n    text = t;\n}\n\nint ContextItem::size(const Font & font) const {\n    return font.textLength(getText().c_str());\n}\n\nContextBox::ContextBox():\nfadeState(NotActive),\nlist(new ScrollList()),\nfadeSpeed(12),\nfadeAlpha(0),\ncursorCenter(0),\ncursorLocation(0),\nscrollWait(4),\nselectedGradient(standardGradient(GradientMax)),\nrenderOnlyText(false){\n}\nContextBox::ContextBox( const ContextBox & copy ):\nfadeState(NotActive),\nlist(new ScrollList()),\nselectedGradient(standardGradient(GradientMax)),\nrenderOnlyText(false){\n    this->list = copy.list;\n    this->fadeSpeed = copy.fadeSpeed;\n    this->fadeAlpha = copy.fadeAlpha;\n    this->cursorCenter = copy.cursorCenter;\n    this->cursorLocation = copy.cursorLocation;\n    this->scrollWait = copy.scrollWait;\n    this->renderOnlyText = copy.renderOnlyText;\n}\nContextBox::~ContextBox(){\n}\nContextBox & ContextBox::operator=( const ContextBox & copy){\n    this->fadeState = NotActive;\n    this->list = copy.list;\n    this->fadeSpeed = copy.fadeSpeed;\n    this->fadeAlpha = copy.fadeAlpha;\n    this->cursorCenter = copy.cursorCenter;\n    this->cursorLocation = copy.cursorLocation;\n    this->scrollWait = copy.scrollWait;\n    this->renderOnlyText = copy.renderOnlyText;\n    return *this;\n}\n\nvoid ContextBox::act(const Font & font){\n    \/\/ update board\n    board.act(font);\n    \n    \/\/ Calculate text info\n    list->act();\n    \n    \/\/ do fade\n    doFade();\n    \n    \/\/ Update gradient\n    selectedGradient.update();\n}\n\nvoid ContextBox::render(const Graphics::Bitmap & work){\n}\n\nvoid ContextBox::render(const Graphics::Bitmap & work, const Font & font){\n    if (!renderOnlyText){\n\tboard.render(work);\n    }\n    drawText(work, font);\n}\n\nbool ContextBox::next(const Font & font){\n    if (fadeState == FadeOut){\n        return false;\n    }\n\n    list->next();\n\n    return true;\n}\n\nbool ContextBox::previous(const Font & font){\n    if (fadeState == FadeOut){\n        return false;\n    }\n\n    list->previous();\n\n    return true;\n}\n        \nGraphics::Color ContextBox::getSelectedColor() const {\n    return values.getInterpolate() ? selectedGradient.current() : values.getSelectedColor();\n}\n\nvoid ContextBox::setListValues(const Gui::ListValues & values){\n    this->values = values;\n    selectedGradient = modifiedGradient(values.getLowColor(), values.getHighColor(), values.getMaxGradient());\n}\n\nvoid ContextBox::adjustLeft(){\n}\n\nvoid ContextBox::adjustRight(){\n}\n\nvoid ContextBox::open(){\n    \/\/ Set the fade stuff\n    fadeState = FadeIn;\n    \/\/board.position = position;\n    board.location = location;\n    board.transforms = transforms;\n    board.colors = colors;\n    board.open();\n    fadeAlpha = 0;\n    cursorLocation = 0;\n}\n\nvoid ContextBox::close(){\n    fadeState = FadeOut;\n    board.close();\n    fadeAlpha = 255;\n    cursorLocation = 480;\n}\n\n\nvoid ContextBox::doFade(){\n    switch (fadeState){\n        case FadeIn: {\n            if (fadeAlpha < 255){\n                fadeAlpha += (fadeSpeed+2);\n            }\n\n            if (fadeAlpha >= 255){\n                fadeAlpha = 255;\n                if (board.isActive()){\n                    fadeState = Active;\n                }\n            }\n            break;\n        }\n        case FadeOut: {\n            if (fadeAlpha > 0){\n                fadeAlpha -= (fadeSpeed+2);\n            }\n\n            if (fadeAlpha <= 0){\n                fadeAlpha = 0;\n                if (!board.isActive()){\n                    fadeState = NotActive;\n                }\n            }\n            break;\n        }\n        case Active:\n        case NotActive:\n        default:\n            break;\n    }\n}\n\nvoid ContextBox::setList(const std::vector<Util::ReferenceCount<ContextItem> > & list){\n    this->list->clearItems();\n    for (vector<Util::ReferenceCount<ContextItem> >::const_iterator it = list.begin(); it != list.end(); it++){\n        const Util::ReferenceCount<ContextItem> & item = *it;\n        this->list->addItem(item.convert<ScrollItem>());\n    }\n}\n        \nvoid ContextBox::addItem(const Util::ReferenceCount<ContextItem> & item){\n    this->list->addItem(item.convert<ScrollItem>());\n}\n\nvoid ContextBox::setListType(const ListType & type){\n    switch (type){\n        case Normal:{\n            Util::ReferenceCount<ScrollListInterface> newList = new NormalList();\n            newList->addItems(list->getItems());\n            list = newList;\n            break;\n        }\n        case Scroll:{\n            Util::ReferenceCount<ScrollListInterface> newList = new ScrollList();\n            newList->addItems(list->getItems());\n            list = newList;\n            break;\n        }\n        default:\n            break;\n    }\n}\n\nvoid ContextBox::setListWrap(bool wrap){\n    list->setWrap(wrap);\n}\n\nvoid ContextBox::drawText(const Graphics::Bitmap & bmp, const Font & font){\n    const int x1 = board.getArea().getX()+(int)(board.getTransforms().getRadius()\/2);\n    const int y1 = board.getArea().getY()+2;\/\/(board.getArea().radius\/2);\n    const int x2 = board.getArea().getX2()-(int)(board.getTransforms().getRadius()\/2);\n    const int y2 = board.getArea().getY2()-2;\/\/(board.getArea().radius\/2);\n            \n    Graphics::Bitmap area(bmp, x1, y1, x2 - x1, y2 - y1);\n\n    list->render(area, font);\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright 2009 SPARTA, Inc., dba Cobham Analytic Solutions\n * \n * This file is part of WATCHER.\n * \n *     WATCHER 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 *     WATCHER is distributed in the hope that it will be 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 Watcher.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"singletonConfig.h\"\n#include \"logger.h\"\n\nusing namespace watcher;\nusing namespace libconfig;\n\npthread_mutex_t SingletonConfig::accessMutex=PTHREAD_MUTEX_INITIALIZER;\nstd::string SingletonConfig::filename=\"\"; \n\nnamespace watcher {\n    INIT_LOGGER(SingletonConfig, \"SingletonConfig\");\n}\n\n\/\/ static\nConfig &SingletonConfig::instance()\n{\n    TRACE_ENTER();\n    static Config theInstance;\n    TRACE_EXIT();\n    return theInstance;\n}\n\nvoid SingletonConfig::lock()\n{\n    TRACE_ENTER();\n    pthread_mutex_lock(&accessMutex);\n    TRACE_EXIT();\n}\n\nvoid SingletonConfig::unlock()\n{\n    TRACE_ENTER();\n    pthread_mutex_unlock(&accessMutex);\n    TRACE_EXIT();\n}\n\nvoid SingletonConfig::setConfigFile(const std::string &filename_)\n{\n    TRACE_ENTER();\n    filename=filename_;\n    TRACE_EXIT();\n}\n\nvoid SingletonConfig::saveConfig()\n{\n    TRACE_ENTER();\n    if (0!=access(filename.c_str(), W_OK)) { \n        LOG_WARN(\"--------------------------------------------------------------------------\"); \n        LOG_WARN(\"--- Not saving configuration changes as the cfg file, \" << filename << \" is read only --------\"); \n        LOG_WARN(\"--------------------------------------------------------------------------\"); \n    }\n    else \n        instance().writeFile(filename.data());\n    TRACE_EXIT();\n}\n\n<commit_msg>Was failing to write initial watcher.cfg file as the file didn't exist, and thus was not writable. :) Added check for non-existance.<commit_after>\/* Copyright 2009 SPARTA, Inc., dba Cobham Analytic Solutions\n * \n * This file is part of WATCHER.\n * \n *     WATCHER 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 *     WATCHER is distributed in the hope that it will be 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 Watcher.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"singletonConfig.h\"\n#include \"logger.h\"\n\nusing namespace watcher;\nusing namespace libconfig;\n\npthread_mutex_t SingletonConfig::accessMutex=PTHREAD_MUTEX_INITIALIZER;\nstd::string SingletonConfig::filename=\"\"; \n\nnamespace watcher {\n    INIT_LOGGER(SingletonConfig, \"SingletonConfig\");\n}\n\n\/\/ static\nConfig &SingletonConfig::instance()\n{\n    TRACE_ENTER();\n    static Config theInstance;\n    TRACE_EXIT();\n    return theInstance;\n}\n\nvoid SingletonConfig::lock()\n{\n    TRACE_ENTER();\n    pthread_mutex_lock(&accessMutex);\n    TRACE_EXIT();\n}\n\nvoid SingletonConfig::unlock()\n{\n    TRACE_ENTER();\n    pthread_mutex_unlock(&accessMutex);\n    TRACE_EXIT();\n}\n\nvoid SingletonConfig::setConfigFile(const std::string &filename_)\n{\n    TRACE_ENTER();\n    filename=filename_;\n    TRACE_EXIT();\n}\n\nvoid SingletonConfig::saveConfig()\n{\n    TRACE_ENTER();\n    if (0!=access(filename.c_str(), F_OK)) { \/\/ File doesn't exist \n\tLOG_DEBUG(\"Writing new configuration file, \\\"\" << filename << \"\\\"\");\n    }\n    else if (0!=access(filename.c_str(), W_OK)) { \n        LOG_WARN(\"--------------------------------------------------------------------------\"); \n        LOG_WARN(\"--- Not saving configuration changes as the cfg file, \" << filename << \" is read only --------\"); \n        LOG_WARN(\"--------------------------------------------------------------------------\"); \n\tTRACE_EXIT();\n\treturn;\n    }\n    instance().writeFile(filename.data());\n    TRACE_EXIT();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ __BEGIN_LICENSE__\n\/\/ Copyright (C) 2006-2011 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\/\/\/ \\file StereoSessionPinhole.cc\n\/\/\/\n\n\/\/ Ames Stereo Pipeline\n#include <asp\/Core\/StereoSettings.h>\n#include <asp\/Sessions\/Pinhole\/StereoSessionPinhole.h>\n\n\/\/ Vision Workbench\n#include <vw\/FileIO\/DiskImageView.h>\n#include <vw\/Camera\/PinholeModel.h>\n#include <vw\/Camera\/CAHVModel.h>\n#include <vw\/Camera\/CAHVORModel.h>\n#include <vw\/Camera\/CAHVOREModel.h>\n#include <vw\/Camera\/CameraTransform.h>\n#include <vw\/Image\/ImageViewRef.h>\n#include <vw\/Stereo\/DisparityMap.h>\n#include <vw\/Math.h>\n\n\/\/ Boost\n#include <boost\/shared_ptr.hpp>\n#include <boost\/filesystem\/operations.hpp>\nnamespace fs = boost::filesystem;\n\nusing namespace vw;\nusing namespace vw::ip;\nusing namespace vw::camera;\n\n\/\/ Allows FileIO to correctly read\/write these pixel types\nnamespace vw {\n  template<> struct PixelFormatID<Vector3>   { static const PixelFormatEnum value = VW_PIXEL_GENERIC_3_CHANNEL; };\n}\n\nboost::shared_ptr<vw::camera::CameraModel>\nasp::StereoSessionPinhole::camera_model(std::string const& \/*image_file*\/,\n                                        std::string const& camera_file) {\n  \/\/ Epipolar Alignment\n  if ( stereo_settings().epipolar_alignment ) {\n    \/\/ Load the image\n    DiskImageView<PixelGray<float> > left_image(m_left_image_file);\n    DiskImageView<PixelGray<float> > right_image(m_right_image_file);\n    Vector2i left_image_size( left_image.cols(), left_image.rows() ),\n      right_image_size( right_image.cols(), right_image.rows() );\n\n    bool is_left_camera = true;\n    if (camera_file == m_left_camera_file)\n      is_left_camera = true;\n    else if (camera_file == m_right_camera_file)\n      is_left_camera = false;\n    else\n      (ArgumentErr() << \"StereoSessionPinhole: supplied camera model filename does not match the name supplied in the constructor.\");\n\n    \/\/ Return the appropriate camera model object\n    std::string lcase_file = boost::to_lower_copy(m_left_camera_file);\n    CAHVModel left_cahv, right_cahv;\n    if (boost::ends_with(lcase_file, \".cahvore\") ) {\n      CAHVOREModel left_cahvore(m_left_camera_file);\n      CAHVOREModel right_cahvore(m_right_camera_file);\n      left_cahv =\n        linearize_camera(left_cahvore, left_image_size, left_image_size);\n      right_cahv =\n        linearize_camera(right_cahvore, right_image_size, right_image_size);\n    } else if (boost::ends_with(lcase_file, \".cahvor\")  ||\n               boost::ends_with(lcase_file, \".cmod\") ) {\n      CAHVORModel left_cahvor(m_left_camera_file);\n      CAHVORModel right_cahvor(m_right_camera_file);\n      left_cahv =\n        linearize_camera(left_cahvor, left_image_size, left_image_size);\n      right_cahv =\n        linearize_camera(right_cahvor, right_image_size, right_image_size);\n    } else if ( boost::ends_with(lcase_file, \".cahv\") ||\n                boost::ends_with(lcase_file, \".pin\" )) {\n      left_cahv = CAHVModel(m_left_camera_file);\n      right_cahv = CAHVModel(m_right_camera_file);\n\n    } else if ( boost::ends_with(lcase_file, \".pinhole\") ||\n                boost::ends_with(lcase_file, \".tsai\") ) {\n      PinholeModel left_pin(m_left_camera_file);\n      PinholeModel right_pin(m_right_camera_file);\n      left_cahv = linearize_camera(left_pin);\n      right_cahv = linearize_camera(right_pin);\n    } else {\n      vw_throw(ArgumentErr() << \"PinholeStereoSession: unsupported camera file type.\\n\");\n    }\n\n    \/\/ Create epipolar recitified camera views\n    boost::shared_ptr<CAHVModel> epipolar_left_cahv(new CAHVModel);\n    boost::shared_ptr<CAHVModel> epipolar_right_cahv(new CAHVModel);\n    epipolar(left_cahv, right_cahv, *epipolar_left_cahv, *epipolar_right_cahv);\n\n    if (is_left_camera)\n      return epipolar_left_cahv;\n    else\n      return epipolar_right_cahv;\n  } else {\n    \/\/ Keypoint alignment and everything else just gets camera models\n    std::string lcase_file = boost::to_lower_copy(camera_file);\n    if (boost::ends_with(lcase_file,\".cahvore\") ) {\n      return boost::shared_ptr<vw::camera::CameraModel>( new CAHVOREModel(camera_file) );\n    } else if (boost::ends_with(lcase_file,\".cahvor\") ||\n               boost::ends_with(lcase_file,\".cmod\") ) {\n      return boost::shared_ptr<vw::camera::CameraModel>( new CAHVORModel(camera_file) );\n    } else if ( boost::ends_with(lcase_file,\".cahv\") ||\n                boost::ends_with(lcase_file,\".pin\") ) {\n      return boost::shared_ptr<vw::camera::CameraModel>( new CAHVModel(camera_file) );\n    } else if ( boost::ends_with(lcase_file,\".pinhole\") ||\n                boost::ends_with(lcase_file,\".tsai\") ) {\n      return boost::shared_ptr<vw::camera::CameraModel> ( new PinholeModel(camera_file) );\n    } else {\n      vw_throw(ArgumentErr() << \"PinholeStereoSession: unsupported camera file type.\\n\");\n    }\n\n\n  }\n  return boost::shared_ptr<vw::camera::CameraModel>(); \/\/ Never reached\n}\n\nvoid asp::StereoSessionPinhole::pre_preprocessing_hook(std::string const& input_file1,\n                                                       std::string const& input_file2,\n                                                       std::string &output_file1,\n                                                       std::string &output_file2) {\n\n  \/\/ Load the images\n  DiskImageView<PixelGray<float> > left_disk_image(m_left_image_file);\n  DiskImageView<PixelGray<float> > right_disk_image(m_right_image_file);\n  ImageViewRef<PixelGray<float> > Limg, Rimg;\n  std::string lcase_file = boost::to_lower_copy(m_left_camera_file);\n\n  if ( stereo_settings().epipolar_alignment ) {\n\n    vw_out() << \"\\t--> Performing epipolar alignment\\n\";\n\n    \/\/ Load the two images and fetch the two camera models\n    boost::shared_ptr<camera::CameraModel> left_camera =\n      this->camera_model(input_file1, m_left_camera_file);\n    boost::shared_ptr<camera::CameraModel> right_camera =\n      this->camera_model(input_file2, m_right_camera_file);\n    CAHVModel* left_epipolar_cahv = dynamic_cast<CAHVModel*>(&(*left_camera));\n    CAHVModel* right_epipolar_cahv = dynamic_cast<CAHVModel*>(&(*right_camera));\n\n    \/\/ Remove lens distortion and create epipolar rectified images.\n    if (boost::ends_with(lcase_file, \".cahvore\")) {\n      CAHVOREModel left_cahvore(m_left_camera_file);\n      CAHVOREModel right_cahvore(m_right_camera_file);\n      Limg = transform(left_disk_image, CameraTransform<CAHVOREModel, CAHVModel>(left_cahvore, *left_epipolar_cahv));\n\n      Rimg = transform(right_disk_image, CameraTransform<CAHVOREModel, CAHVModel>(right_cahvore, *right_epipolar_cahv));\n    } else if (boost::ends_with(lcase_file, \".cahvor\") ||\n               boost::ends_with(lcase_file, \".cmod\") ) {\n      CAHVORModel left_cahvor(m_left_camera_file);\n      CAHVORModel right_cahvor(m_right_camera_file);\n      Limg = transform(left_disk_image, CameraTransform<CAHVORModel, CAHVModel>(left_cahvor, *left_epipolar_cahv));\n      Rimg = transform(right_disk_image, CameraTransform<CAHVORModel, CAHVModel>(right_cahvor, *right_epipolar_cahv));\n\n    } else if ( boost::ends_with(lcase_file, \".cahv\") ||\n                boost::ends_with(lcase_file, \".pin\" )) {\n      CAHVModel left_cahv(m_left_camera_file);\n      CAHVModel right_cahv(m_right_camera_file);\n      Limg = transform(left_disk_image, CameraTransform<CAHVModel, CAHVModel>(left_cahv, *left_epipolar_cahv));\n      Rimg = transform(right_disk_image, CameraTransform<CAHVModel, CAHVModel>(right_cahv, *right_epipolar_cahv));\n\n    } else if ( boost::ends_with(lcase_file, \".pinhole\") ||\n                boost::ends_with(lcase_file, \".tsai\") ) {\n      PinholeModel left_pin(m_left_camera_file);\n      PinholeModel right_pin(m_right_camera_file);\n      Limg = transform(left_disk_image, CameraTransform<PinholeModel, CAHVModel>(left_pin, *left_epipolar_cahv));\n      Rimg = transform(right_disk_image, CameraTransform<PinholeModel, CAHVModel>(right_pin, *right_epipolar_cahv));\n\n    } else {\n      vw_throw(ArgumentErr() << \"PinholeStereoSession: unsupported camera file type.\\n\");\n    }\n\n  } else if ( stereo_settings().keypoint_alignment ) {\n\n    Matrix<double> align_matrix;\n    align_matrix = determine_image_align( input_file1, input_file2,\n                                          left_disk_image, right_disk_image);\n    write_matrix( m_out_prefix + \"-align.exr\", align_matrix );\n\n    \/\/ Applying alignment transform\n    Limg = left_disk_image;\n    Rimg = transform(right_disk_image,\n                     HomographyTransform(align_matrix),\n                     left_disk_image.cols(), left_disk_image.rows());\n\n  } else {\n    \/\/ Do nothing just provide the original files.\n    Limg = left_disk_image;\n    Rimg = right_disk_image;\n  }\n\n  output_file1 = m_out_prefix + \"-L.tif\";\n  output_file2 = m_out_prefix + \"-R.tif\";\n  vw_out() << \"\\t--> Writing pre-aligned images.\\n\";\n  write_image(output_file1, Limg);\n  write_image(output_file2, Rimg);\n}\n\n\/\/ Reverse any pre-alignment that might have been done to the disparity map\nvoid asp::StereoSessionPinhole::pre_pointcloud_hook(std::string const& input_file,\n                                                    std::string & output_file ) {\n\n  if ( stereo_settings().keypoint_alignment ) {\n\n    DiskImageView<PixelMask<Vector2f> > disparity_map( input_file );\n    output_file = m_out_prefix + \"-F-corrected.tif\";\n\n    vw::Matrix<double> align_matrix;\n    try {\n      read_matrix(align_matrix, m_out_prefix + \"-align.exr\");\n      vw_out(DebugMessage) << \"Alignment Matrix: \" << align_matrix << \"\\n\";\n    } catch ( vw::IOErr const& e ) {\n      vw_out() << \"\\nCould not read in alignment matrix: \" << m_out_prefix\n               << \"-align.exr. Exiting. \\n\\n\";\n      exit(1);\n    }\n\n    \/\/ Remove pixels that are outside the bounds of the second image\n    DiskImageView<PixelGray<float> > right_disk_image( m_right_image_file );\n    ImageViewRef<PixelMask<Vector2f> > result =\n      stereo::disparity_range_mask( stereo::transform_disparities( disparity_map,\n                                             HomographyTransform(align_matrix)),\n                                    Vector2f(0,0),\n                                    Vector2f( right_disk_image.cols(),\n                                              right_disk_image.rows()) );\n\n    write_image(output_file, result,\n                TerminalProgressCallback(\"asp\", \"\\t    Saving: \") );\n\n  } else {\n    output_file = input_file;\n  }\n}\n<commit_msg>Added parallel writing to StereoSessionPinhole<commit_after>\/\/ __BEGIN_LICENSE__\n\/\/ Copyright (C) 2006-2011 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\/\/\/ \\file StereoSessionPinhole.cc\n\/\/\/\n\n\/\/ Ames Stereo Pipeline\n#include <asp\/Core\/StereoSettings.h>\n#include <asp\/Sessions\/Pinhole\/StereoSessionPinhole.h>\n\n\/\/ Vision Workbench\n#include <vw\/FileIO\/DiskImageView.h>\n#include <vw\/Camera\/PinholeModel.h>\n#include <vw\/Camera\/CAHVModel.h>\n#include <vw\/Camera\/CAHVORModel.h>\n#include <vw\/Camera\/CAHVOREModel.h>\n#include <vw\/Camera\/CameraTransform.h>\n#include <vw\/Image\/ImageViewRef.h>\n#include <vw\/Stereo\/DisparityMap.h>\n#include <vw\/Math.h>\n\n\/\/ Boost\n#include <boost\/shared_ptr.hpp>\n#include <boost\/filesystem\/operations.hpp>\nnamespace fs = boost::filesystem;\n\nusing namespace vw;\nusing namespace vw::ip;\nusing namespace vw::camera;\n\n\/\/ Allows FileIO to correctly read\/write these pixel types\nnamespace vw {\n  template<> struct PixelFormatID<Vector3>   { static const PixelFormatEnum value = VW_PIXEL_GENERIC_3_CHANNEL; };\n}\n\nboost::shared_ptr<vw::camera::CameraModel>\nasp::StereoSessionPinhole::camera_model(std::string const& \/*image_file*\/,\n                                        std::string const& camera_file) {\n  \/\/ Epipolar Alignment\n  if ( stereo_settings().epipolar_alignment ) {\n    \/\/ Load the image\n    DiskImageView<PixelGray<float> > left_image(m_left_image_file);\n    DiskImageView<PixelGray<float> > right_image(m_right_image_file);\n    Vector2i left_image_size( left_image.cols(), left_image.rows() ),\n      right_image_size( right_image.cols(), right_image.rows() );\n\n    bool is_left_camera = true;\n    if (camera_file == m_left_camera_file)\n      is_left_camera = true;\n    else if (camera_file == m_right_camera_file)\n      is_left_camera = false;\n    else\n      (ArgumentErr() << \"StereoSessionPinhole: supplied camera model filename does not match the name supplied in the constructor.\");\n\n    \/\/ Return the appropriate camera model object\n    std::string lcase_file = boost::to_lower_copy(m_left_camera_file);\n    CAHVModel left_cahv, right_cahv;\n    if (boost::ends_with(lcase_file, \".cahvore\") ) {\n      CAHVOREModel left_cahvore(m_left_camera_file);\n      CAHVOREModel right_cahvore(m_right_camera_file);\n      left_cahv =\n        linearize_camera(left_cahvore, left_image_size, left_image_size);\n      right_cahv =\n        linearize_camera(right_cahvore, right_image_size, right_image_size);\n    } else if (boost::ends_with(lcase_file, \".cahvor\")  ||\n               boost::ends_with(lcase_file, \".cmod\") ) {\n      CAHVORModel left_cahvor(m_left_camera_file);\n      CAHVORModel right_cahvor(m_right_camera_file);\n      left_cahv =\n        linearize_camera(left_cahvor, left_image_size, left_image_size);\n      right_cahv =\n        linearize_camera(right_cahvor, right_image_size, right_image_size);\n    } else if ( boost::ends_with(lcase_file, \".cahv\") ||\n                boost::ends_with(lcase_file, \".pin\" )) {\n      left_cahv = CAHVModel(m_left_camera_file);\n      right_cahv = CAHVModel(m_right_camera_file);\n\n    } else if ( boost::ends_with(lcase_file, \".pinhole\") ||\n                boost::ends_with(lcase_file, \".tsai\") ) {\n      PinholeModel left_pin(m_left_camera_file);\n      PinholeModel right_pin(m_right_camera_file);\n      left_cahv = linearize_camera(left_pin);\n      right_cahv = linearize_camera(right_pin);\n    } else {\n      vw_throw(ArgumentErr() << \"PinholeStereoSession: unsupported camera file type.\\n\");\n    }\n\n    \/\/ Create epipolar recitified camera views\n    boost::shared_ptr<CAHVModel> epipolar_left_cahv(new CAHVModel);\n    boost::shared_ptr<CAHVModel> epipolar_right_cahv(new CAHVModel);\n    epipolar(left_cahv, right_cahv, *epipolar_left_cahv, *epipolar_right_cahv);\n\n    if (is_left_camera)\n      return epipolar_left_cahv;\n    else\n      return epipolar_right_cahv;\n  } else {\n    \/\/ Keypoint alignment and everything else just gets camera models\n    std::string lcase_file = boost::to_lower_copy(camera_file);\n    if (boost::ends_with(lcase_file,\".cahvore\") ) {\n      return boost::shared_ptr<vw::camera::CameraModel>( new CAHVOREModel(camera_file) );\n    } else if (boost::ends_with(lcase_file,\".cahvor\") ||\n               boost::ends_with(lcase_file,\".cmod\") ) {\n      return boost::shared_ptr<vw::camera::CameraModel>( new CAHVORModel(camera_file) );\n    } else if ( boost::ends_with(lcase_file,\".cahv\") ||\n                boost::ends_with(lcase_file,\".pin\") ) {\n      return boost::shared_ptr<vw::camera::CameraModel>( new CAHVModel(camera_file) );\n    } else if ( boost::ends_with(lcase_file,\".pinhole\") ||\n                boost::ends_with(lcase_file,\".tsai\") ) {\n      return boost::shared_ptr<vw::camera::CameraModel> ( new PinholeModel(camera_file) );\n    } else {\n      vw_throw(ArgumentErr() << \"PinholeStereoSession: unsupported camera file type.\\n\");\n    }\n\n\n  }\n  return boost::shared_ptr<vw::camera::CameraModel>(); \/\/ Never reached\n}\n\nvoid asp::StereoSessionPinhole::pre_preprocessing_hook(std::string const& input_file1,\n                                                       std::string const& input_file2,\n                                                       std::string &output_file1,\n                                                       std::string &output_file2) {\n\n  \/\/ Load the images\n  DiskImageView<PixelGray<float> > left_disk_image(m_left_image_file);\n  DiskImageView<PixelGray<float> > right_disk_image(m_right_image_file);\n  ImageViewRef<PixelGray<float> > Limg, Rimg;\n  std::string lcase_file = boost::to_lower_copy(m_left_camera_file);\n\n  if ( stereo_settings().epipolar_alignment ) {\n\n    vw_out() << \"\\t--> Performing epipolar alignment\\n\";\n\n    \/\/ Load the two images and fetch the two camera models\n    boost::shared_ptr<camera::CameraModel> left_camera =\n      this->camera_model(input_file1, m_left_camera_file);\n    boost::shared_ptr<camera::CameraModel> right_camera =\n      this->camera_model(input_file2, m_right_camera_file);\n    CAHVModel* left_epipolar_cahv = dynamic_cast<CAHVModel*>(&(*left_camera));\n    CAHVModel* right_epipolar_cahv = dynamic_cast<CAHVModel*>(&(*right_camera));\n\n    \/\/ Remove lens distortion and create epipolar rectified images.\n    if (boost::ends_with(lcase_file, \".cahvore\")) {\n      CAHVOREModel left_cahvore(m_left_camera_file);\n      CAHVOREModel right_cahvore(m_right_camera_file);\n      Limg = transform(left_disk_image, CameraTransform<CAHVOREModel, CAHVModel>(left_cahvore, *left_epipolar_cahv));\n\n      Rimg = transform(right_disk_image, CameraTransform<CAHVOREModel, CAHVModel>(right_cahvore, *right_epipolar_cahv));\n    } else if (boost::ends_with(lcase_file, \".cahvor\") ||\n               boost::ends_with(lcase_file, \".cmod\") ) {\n      CAHVORModel left_cahvor(m_left_camera_file);\n      CAHVORModel right_cahvor(m_right_camera_file);\n      Limg = transform(left_disk_image, CameraTransform<CAHVORModel, CAHVModel>(left_cahvor, *left_epipolar_cahv));\n      Rimg = transform(right_disk_image, CameraTransform<CAHVORModel, CAHVModel>(right_cahvor, *right_epipolar_cahv));\n\n    } else if ( boost::ends_with(lcase_file, \".cahv\") ||\n                boost::ends_with(lcase_file, \".pin\" )) {\n      CAHVModel left_cahv(m_left_camera_file);\n      CAHVModel right_cahv(m_right_camera_file);\n      Limg = transform(left_disk_image, CameraTransform<CAHVModel, CAHVModel>(left_cahv, *left_epipolar_cahv));\n      Rimg = transform(right_disk_image, CameraTransform<CAHVModel, CAHVModel>(right_cahv, *right_epipolar_cahv));\n\n    } else if ( boost::ends_with(lcase_file, \".pinhole\") ||\n                boost::ends_with(lcase_file, \".tsai\") ) {\n      PinholeModel left_pin(m_left_camera_file);\n      PinholeModel right_pin(m_right_camera_file);\n      Limg = transform(left_disk_image, CameraTransform<PinholeModel, CAHVModel>(left_pin, *left_epipolar_cahv));\n      Rimg = transform(right_disk_image, CameraTransform<PinholeModel, CAHVModel>(right_pin, *right_epipolar_cahv));\n\n    } else {\n      vw_throw(ArgumentErr() << \"PinholeStereoSession: unsupported camera file type.\\n\");\n    }\n\n  } else if ( stereo_settings().keypoint_alignment ) {\n\n    Matrix<double> align_matrix;\n    align_matrix = determine_image_align( input_file1, input_file2,\n                                          left_disk_image, right_disk_image);\n    write_matrix( m_out_prefix + \"-align.exr\", align_matrix );\n\n    \/\/ Applying alignment transform\n    Limg = left_disk_image;\n    Rimg = transform(right_disk_image,\n                     HomographyTransform(align_matrix),\n                     left_disk_image.cols(), left_disk_image.rows());\n\n  } else {\n    \/\/ Do nothing just provide the original files.\n    Limg = left_disk_image;\n    Rimg = right_disk_image;\n  }\n\n  output_file1 = m_out_prefix + \"-L.tif\";\n  output_file2 = m_out_prefix + \"-R.tif\";\n  vw_out() << \"\\t--> Writing pre-aligned images.\\n\";\n  block_write_gdal_image( output_file1, Limg, m_options,\n                          TerminalProgressCallback(\"asp\",\"\\t  L:  \") );\n  block_write_gdal_image( output_file2, Rimg, m_options,\n                          TerminalProgressCallback(\"asp\",\"\\t  R:  \") );\n}\n\n\/\/ Reverse any pre-alignment that might have been done to the disparity map\nvoid asp::StereoSessionPinhole::pre_pointcloud_hook(std::string const& input_file,\n                                                    std::string & output_file ) {\n\n  if ( stereo_settings().keypoint_alignment ) {\n\n    DiskImageView<PixelMask<Vector2f> > disparity_map( input_file );\n    output_file = m_out_prefix + \"-F-corrected.tif\";\n\n    vw::Matrix<double> align_matrix;\n    try {\n      read_matrix(align_matrix, m_out_prefix + \"-align.exr\");\n      vw_out(DebugMessage) << \"Alignment Matrix: \" << align_matrix << \"\\n\";\n    } catch ( vw::IOErr const& e ) {\n      vw_out() << \"\\nCould not read in alignment matrix: \" << m_out_prefix\n               << \"-align.exr. Exiting. \\n\\n\";\n      exit(1);\n    }\n\n    \/\/ Remove pixels that are outside the bounds of the second image\n    DiskImageView<PixelGray<float> > right_disk_image( m_right_image_file );\n    ImageViewRef<PixelMask<Vector2f> > result =\n      stereo::disparity_range_mask( stereo::transform_disparities( disparity_map,\n                                             HomographyTransform(align_matrix)),\n                                    Vector2f(0,0),\n                                    Vector2f( right_disk_image.cols(),\n                                              right_disk_image.rows()) );\n\n    block_write_gdal_image( output_file, result, m_options,\n                            TerminalProgressCallback(\"asp\", \"\\t    Saving: \") );\n  } else {\n    output_file = input_file;\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Apply patch for xercesc-1591 contributed by Anton Nikolaevsky.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ ChiCheMongo.cpp\r\n\r\n#include \"ChiCheMongo.h\"\r\n#include <rapidjson\/document.h>\r\n#include <rapidjson\/writer.h>\r\n#include <wx\/string.h>\r\n#include <wx\/utils.h>\r\n#pragma warning( push )\r\n#pragma warning( disable : 4005 )\t\t\/\/ Not sure how to fix this problem.\r\n#\tinclude <bson.h>\r\n#\tinclude <mongoc.h>\r\n#pragma warning( pop )\r\n\r\nusing namespace ChiChe;\r\n\r\n\/\/=====================================================================================\r\n_bson_t* json_as_bson( const char* jsonDoc )\r\n{\r\n\tbson_t* bsonDoc = bson_new();\r\n\tbson_error_t error;\r\n\tif( !bson_init_from_json( bsonDoc, jsonDoc, strlen( jsonDoc ), &error ) )\r\n\t{\r\n\t\tbson_free( bsonDoc );\r\n\t\tbsonDoc = nullptr;\r\n\t}\r\n\treturn bsonDoc;\r\n}\r\n\r\n\/\/=====================================================================================\r\nMongo::Mongo( void )\r\n{\r\n\tclient = nullptr;\r\n\twin_collection = nullptr;\r\n}\r\n\r\n\/\/=====================================================================================\r\n\/*virtual*\/ Mongo::~Mongo( void )\r\n{\r\n\tDisconnect();\r\n}\r\n\r\n\/\/=====================================================================================\r\n\/*static*\/ bool Mongo::Init( void )\r\n{\r\n\tmongoc_init();\r\n\treturn true;\r\n}\r\n\r\n\/\/=====================================================================================\r\n\/*static*\/ bool Mongo::CleanUp( void )\r\n{\r\n\tmongoc_cleanup();\r\n\treturn true;\r\n}\r\n\r\n\/\/=====================================================================================\r\nbool Mongo::Connect( void )\r\n{\r\n\tif( client )\r\n\t\treturn false;\r\n\r\n\t\/\/ Here it is; plain as day!  If I find that someone has corrupted the database,\r\n\t\/\/ I'll have to revisit this code and switch over to a better authentication mechanism.\r\n\twxString userName = \"chiche\";\r\n\twxString passWord = \"chiche\";\r\n\twxString uri = \"mongodb:\/\/\" + userName + \":\" + passWord + \"@ds057066.mlab.com\/57066\/chiche\";\r\n\r\n\tclient = mongoc_client_new( uri );\r\n\tif( !client )\r\n\t\treturn false;\r\n\r\n\twin_collection = mongoc_client_get_collection( client, \"chiche\", \"win_collection\" );\r\n\tif( !win_collection )\r\n\t\treturn false;\r\n\r\n\treturn true;\r\n}\r\n\r\n\/\/=====================================================================================\r\nbool Mongo::Disconnect( void )\r\n{\r\n\tif( win_collection )\r\n\t{\r\n\t\tmongoc_collection_destroy( win_collection );\r\n\t\twin_collection = nullptr;\r\n\t}\r\n\r\n\tif( client )\r\n\t{\r\n\t\tmongoc_client_destroy( client );\r\n\t\tclient = nullptr;\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\n\/\/=====================================================================================\r\nbool Mongo::WinEntryToBson( const WinEntry& winEntry, _bson_t*& bsonDoc )\r\n{\r\n\tbool success = false;\r\n\r\n\tdo\r\n\t{\r\n\t\tbsonDoc = nullptr;\r\n\r\n\t\trapidjson::Document doc;\r\n\t\tdoc.SetObject();\r\n\r\n\t\tconst char* winnerName = winEntry.winnerName.c_str();\r\n\t\trapidjson::Value winnerNameValue;\r\n\t\twinnerNameValue.SetString( winnerName, strlen( winnerName ), doc.GetAllocator() );\r\n\t\tdoc.AddMember( \"winnerName\", winnerNameValue, doc.GetAllocator() );\r\n\t\t\r\n\t\tdoc.AddMember( \"score\", rapidjson::Value().SetInt64( winEntry.score ), doc.GetAllocator() );\r\n\t\tdoc.AddMember( \"turnCount\", winEntry.turnCount, doc.GetAllocator() );\r\n\r\n\t\tconst char* dateOfWin = winEntry.dateOfWin.Format();\r\n\t\trapidjson::Value dateOfWinValue;\r\n\t\tdateOfWinValue.SetString( dateOfWin, strlen( dateOfWin ), doc.GetAllocator() );\r\n\t\tdoc.AddMember( \"dateOfWin\", dateOfWinValue, doc.GetAllocator() );\r\n\r\n\t\trapidjson::StringBuffer buffer;\r\n\t\trapidjson::Writer< rapidjson::StringBuffer > writer( buffer );\r\n\t\tif( !doc.Accept( writer ) )\r\n\t\t\tbreak;\r\n\r\n\t\tconst char* jsonDoc = buffer.GetString();\r\n\t\tbsonDoc = json_as_bson( jsonDoc );\r\n\t\tif( !bsonDoc )\r\n\t\t\tbreak;\r\n\r\n\t\tsuccess = true;\r\n\t}\r\n\twhile( false );\r\n\r\n\treturn success;\r\n}\r\n\r\n\/\/=====================================================================================\r\nbool Mongo::WinEntryFromBson( WinEntry& winEntry, const _bson_t* bsonDoc )\r\n{\r\n\tbool success = false;\r\n\tchar* jsonDoc = nullptr;\r\n\t\r\n\tdo\r\n\t{\r\n\t\tjsonDoc = bson_as_json( bsonDoc, NULL );\r\n\r\n\t\trapidjson::Document doc;\r\n\t\tdoc.Parse( jsonDoc );\r\n\t\tif( !doc.IsObject() )\r\n\t\t\tbreak;\r\n\r\n\t\twinEntry.winnerName = doc[ \"winnerName\" ].GetString();\r\n\t\twinEntry.score = doc[ \"score\" ].GetInt64();\r\n\t\twinEntry.turnCount = doc[ \"turnCount\" ].GetInt();\r\n\t\twxString dateOfWin = doc[ \"dateOfWin\" ].GetString();\r\n\t\twinEntry.dateOfWin.ParseDateTime( dateOfWin );\r\n\r\n\t\tsuccess = true;\r\n\t}\r\n\twhile( false );\r\n\r\n\tif( jsonDoc )\r\n\t\tbson_free( jsonDoc );\r\n\r\n\treturn success;\r\n}\r\n\r\n\/\/=====================================================================================\r\nbool Mongo::InsertWinEntry( const WinEntry& winEntry )\r\n{\r\n\tbool success = false;\r\n\tbson_t* bsonDoc = nullptr;\r\n\r\n\tdo\r\n\t{\r\n\t\twxBusyCursor busyCursor;\r\n\r\n\t\tif( !WinEntryToBson( winEntry, bsonDoc ) )\r\n\t\t\tbreak;\r\n\r\n\t\t\/\/ Note that a cap has been put on the collection, we we can add to it without bound and not worry about overflowing our quota.\r\n\t\t\/\/ Oldest documents are kicked out to make room for new documents.  There is room for a very large number of documents!\r\n\t\tif( !mongoc_collection_insert( win_collection, MONGOC_INSERT_NONE, bsonDoc, NULL, NULL ) )\r\n\t\t\tbreak;\r\n\r\n\t\tsuccess = true;\r\n\t}\r\n\twhile( false );\r\n\r\n\tif( bsonDoc )\r\n\t\tbson_free( bsonDoc );\r\n\r\n\treturn success;\r\n}\r\n\r\n\/\/=====================================================================================\r\n\/*static*\/ bool Mongo::FreeWinEntryList( WinEntryList& winEntryList )\r\n{\r\n\twhile( winEntryList.size() > 0 )\r\n\t{\r\n\t\tWinEntryList::iterator iter = winEntryList.begin();\r\n\t\tWinEntry* winEntry = *iter;\r\n\t\tdelete winEntry;\r\n\t\twinEntryList.erase( iter );\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\n\/\/=====================================================================================\r\nbool Mongo::GetTopHighScoresList( WinEntryList& winEntryList, int winEntryListSize )\r\n{\r\n\twxString jsonQuery = \"{ \\\"$query\\\" : { \\\"$sort\\\" : { \\\"score\\\" : 1 } } }\";\r\n\treturn GetWinEntryList( winEntryList, winEntryListSize, jsonQuery );\r\n}\r\n\r\n\/\/=====================================================================================\r\nbool Mongo::GetFastestWinList( WinEntryList& winEntryList, int winEntryListSize )\r\n{\r\n\twxString jsonQuery = \"{ \\\"$query\\\" : { \\\"$sort\\\" : { \\\"turnCount\\\" : -1 } } }\";\r\n\treturn GetWinEntryList( winEntryList, winEntryListSize, jsonQuery );\r\n}\r\n\r\n\/\/=====================================================================================\r\nbool Mongo::GetWinEntryList( WinEntryList& winEntryList, int winEntryListSize, const wxString& jsonQuery )\r\n{\r\n\tbool success = false;\r\n\tmongoc_cursor_t* cursor = nullptr;\r\n\tbson_t* bsonQuery = nullptr;\r\n\r\n\tdo\r\n\t{\r\n\t\twxBusyCursor busyCursor;\r\n\r\n\t\tFreeWinEntryList( winEntryList );\r\n\r\n\t\t\/\/bsonQuery = json_as_bson( jsonQuery );\r\n\r\n\t\tcursor = mongoc_collection_find( win_collection, MONGOC_QUERY_NONE, 0, winEntryListSize, 0, bsonQuery, NULL, NULL );\r\n\t\tif( !cursor )\r\n\t\t\tbreak;\r\n\r\n\t\tconst bson_t* bsonDoc = nullptr;\r\n\t\twhile( mongoc_cursor_next( cursor, &bsonDoc ) )\r\n\t\t{\r\n\t\t\tWinEntry* winEntry = new WinEntry();\r\n\t\t\tif( WinEntryFromBson( *winEntry, bsonDoc ) )\r\n\t\t\t\twinEntryList.push_back( winEntry );\r\n\t\t}\r\n\r\n\t\tsuccess = true;\r\n\t}\r\n\twhile( false );\r\n\r\n\tif( cursor )\r\n\t\tmongoc_cursor_destroy( cursor );\r\n\r\n\tif( bsonQuery )\r\n\t\tbson_free( bsonQuery );\r\n\r\n\treturn true;\r\n}\r\n\r\n\/\/ ChiCheMongo.cpp<commit_msg>forgot this<commit_after>\/\/ ChiCheMongo.cpp\r\n\r\n#include \"ChiCheMongo.h\"\r\n#include <rapidjson\/document.h>\r\n#include <rapidjson\/writer.h>\r\n#include <wx\/string.h>\r\n#include <wx\/utils.h>\r\n#pragma warning( push )\r\n#pragma warning( disable : 4005 )\t\t\/\/ Not sure how to fix this problem.\r\n#\tinclude <bson.h>\r\n#\tinclude <mongoc.h>\r\n#pragma warning( pop )\r\n\r\nusing namespace ChiChe;\r\n\r\n\/\/=====================================================================================\r\n_bson_t* json_as_bson( const char* jsonDoc )\r\n{\r\n\tbson_t* bsonDoc = bson_new();\r\n\tbson_error_t error;\r\n\tif( !bson_init_from_json( bsonDoc, jsonDoc, strlen( jsonDoc ), &error ) )\r\n\t{\r\n\t\tbson_free( bsonDoc );\r\n\t\tbsonDoc = nullptr;\r\n\t}\r\n\treturn bsonDoc;\r\n}\r\n\r\n\/\/=====================================================================================\r\nMongo::Mongo( void )\r\n{\r\n\tclient = nullptr;\r\n\twin_collection = nullptr;\r\n}\r\n\r\n\/\/=====================================================================================\r\n\/*virtual*\/ Mongo::~Mongo( void )\r\n{\r\n\tDisconnect();\r\n}\r\n\r\n\/\/=====================================================================================\r\n\/*static*\/ bool Mongo::Init( void )\r\n{\r\n\tmongoc_init();\r\n\treturn true;\r\n}\r\n\r\n\/\/=====================================================================================\r\n\/*static*\/ bool Mongo::CleanUp( void )\r\n{\r\n\tmongoc_cleanup();\r\n\treturn true;\r\n}\r\n\r\n\/\/=====================================================================================\r\nbool Mongo::Connect( void )\r\n{\r\n\tif( client )\r\n\t\treturn false;\r\n\r\n\t\/\/ Here it is; plain as day!  If I find that someone has corrupted the database,\r\n\t\/\/ I'll have to revisit this code and switch over to a better authentication mechanism.\r\n\twxString userName = \"chiche\";\r\n\twxString passWord = \"chiche\";\r\n\twxString uri = \"mongodb:\/\/\" + userName + \":\" + passWord + \"@ds057066.mlab.com\/57066\/chiche\";\r\n\r\n\tclient = mongoc_client_new( uri );\r\n\tif( !client )\r\n\t\treturn false;\r\n\r\n\twin_collection = mongoc_client_get_collection( client, \"chiche\", \"win_collection\" );\r\n\tif( !win_collection )\r\n\t\treturn false;\r\n\r\n\treturn true;\r\n}\r\n\r\n\/\/=====================================================================================\r\nbool Mongo::Disconnect( void )\r\n{\r\n\tif( win_collection )\r\n\t{\r\n\t\tmongoc_collection_destroy( win_collection );\r\n\t\twin_collection = nullptr;\r\n\t}\r\n\r\n\tif( client )\r\n\t{\r\n\t\tmongoc_client_destroy( client );\r\n\t\tclient = nullptr;\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\n\/\/=====================================================================================\r\nbool Mongo::WinEntryToBson( const WinEntry& winEntry, _bson_t*& bsonDoc )\r\n{\r\n\tbool success = false;\r\n\r\n\tdo\r\n\t{\r\n\t\tbsonDoc = nullptr;\r\n\r\n\t\trapidjson::Document doc;\r\n\t\tdoc.SetObject();\r\n\r\n\t\tconst char* winnerName = winEntry.winnerName.c_str();\r\n\t\trapidjson::Value winnerNameValue;\r\n\t\twinnerNameValue.SetString( winnerName, strlen( winnerName ), doc.GetAllocator() );\r\n\t\tdoc.AddMember( \"winnerName\", winnerNameValue, doc.GetAllocator() );\r\n\t\t\r\n\t\tdoc.AddMember( \"score\", rapidjson::Value().SetInt64( winEntry.score ), doc.GetAllocator() );\r\n\t\tdoc.AddMember( \"turnCount\", winEntry.turnCount, doc.GetAllocator() );\r\n\r\n\t\tconst char* dateOfWin = winEntry.dateOfWin.Format();\r\n\t\trapidjson::Value dateOfWinValue;\r\n\t\tdateOfWinValue.SetString( dateOfWin, strlen( dateOfWin ), doc.GetAllocator() );\r\n\t\tdoc.AddMember( \"dateOfWin\", dateOfWinValue, doc.GetAllocator() );\r\n\r\n\t\trapidjson::StringBuffer buffer;\r\n\t\trapidjson::Writer< rapidjson::StringBuffer > writer( buffer );\r\n\t\tif( !doc.Accept( writer ) )\r\n\t\t\tbreak;\r\n\r\n\t\tconst char* jsonDoc = buffer.GetString();\r\n\t\tbsonDoc = json_as_bson( jsonDoc );\r\n\t\tif( !bsonDoc )\r\n\t\t\tbreak;\r\n\r\n\t\tsuccess = true;\r\n\t}\r\n\twhile( false );\r\n\r\n\treturn success;\r\n}\r\n\r\n\/\/=====================================================================================\r\nbool Mongo::WinEntryFromBson( WinEntry& winEntry, const _bson_t* bsonDoc )\r\n{\r\n\tbool success = false;\r\n\tchar* jsonDoc = nullptr;\r\n\t\r\n\tdo\r\n\t{\r\n\t\tjsonDoc = bson_as_json( bsonDoc, NULL );\r\n\r\n\t\trapidjson::Document doc;\r\n\t\tdoc.Parse( jsonDoc );\r\n\t\tif( !doc.IsObject() )\r\n\t\t\tbreak;\r\n\r\n\t\twinEntry.winnerName = doc[ \"winnerName\" ].GetString();\r\n\t\twinEntry.score = doc[ \"score\" ].GetInt64();\r\n\t\twinEntry.turnCount = doc[ \"turnCount\" ].GetInt();\r\n\t\twxString dateOfWin = doc[ \"dateOfWin\" ].GetString();\r\n\t\twinEntry.dateOfWin.ParseDateTime( dateOfWin );\r\n\r\n\t\tsuccess = true;\r\n\t}\r\n\twhile( false );\r\n\r\n\tif( jsonDoc )\r\n\t\tbson_free( jsonDoc );\r\n\r\n\treturn success;\r\n}\r\n\r\n\/\/=====================================================================================\r\nbool Mongo::InsertWinEntry( const WinEntry& winEntry )\r\n{\r\n\tbool success = false;\r\n\tbson_t* bsonDoc = nullptr;\r\n\r\n\tdo\r\n\t{\r\n\t\twxBusyCursor busyCursor;\r\n\r\n\t\tif( !WinEntryToBson( winEntry, bsonDoc ) )\r\n\t\t\tbreak;\r\n\r\n\t\t\/\/ Note that a cap has been put on the collection, we we can add to it without bound and not worry about overflowing our quota.\r\n\t\t\/\/ Oldest documents are kicked out to make room for new documents.  There is room for a very large number of documents!\r\n\t\tif( !mongoc_collection_insert( win_collection, MONGOC_INSERT_NONE, bsonDoc, NULL, NULL ) )\r\n\t\t\tbreak;\r\n\r\n\t\tsuccess = true;\r\n\t}\r\n\twhile( false );\r\n\r\n\tif( bsonDoc )\r\n\t\tbson_free( bsonDoc );\r\n\r\n\treturn success;\r\n}\r\n\r\n\/\/=====================================================================================\r\n\/*static*\/ bool Mongo::FreeWinEntryList( WinEntryList& winEntryList )\r\n{\r\n\twhile( winEntryList.size() > 0 )\r\n\t{\r\n\t\tWinEntryList::iterator iter = winEntryList.begin();\r\n\t\tWinEntry* winEntry = *iter;\r\n\t\tdelete winEntry;\r\n\t\twinEntryList.erase( iter );\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\n\/\/=====================================================================================\r\nbool Mongo::GetTopHighScoresList( WinEntryList& winEntryList, int winEntryListSize )\r\n{\r\n\twxString jsonQuery = \"{ \\\"$query\\\" : { \\\"$sort\\\" : { \\\"score\\\" : 1 } } }\";\r\n\treturn GetWinEntryList( winEntryList, winEntryListSize, jsonQuery );\r\n}\r\n\r\n\/\/=====================================================================================\r\nbool Mongo::GetFastestWinList( WinEntryList& winEntryList, int winEntryListSize )\r\n{\r\n\twxString jsonQuery = \"{ \\\"$query\\\" : { \\\"$sort\\\" : { \\\"turnCount\\\" : -1 } } }\";\r\n\treturn GetWinEntryList( winEntryList, winEntryListSize, jsonQuery );\r\n}\r\n\r\n\/\/=====================================================================================\r\nbool Mongo::GetWinEntryList( WinEntryList& winEntryList, int winEntryListSize, const wxString& jsonQuery )\r\n{\r\n\tbool success = false;\r\n\tmongoc_cursor_t* cursor = nullptr;\r\n\tbson_t* bsonQuery = nullptr;\r\n\r\n\tdo\r\n\t{\r\n\t\twxBusyCursor busyCursor;\r\n\r\n\t\tFreeWinEntryList( winEntryList );\r\n\r\n\t\tbsonQuery = json_as_bson( jsonQuery );\r\n\t\tif( !bsonQuery )\r\n\t\t\tbreak;\r\n\r\n\t\tcursor = mongoc_collection_find( win_collection, MONGOC_QUERY_NONE, 0, winEntryListSize, 0, bsonQuery, NULL, NULL );\r\n\t\tif( !cursor )\r\n\t\t\tbreak;\r\n\r\n\t\tconst bson_t* bsonDoc = nullptr;\r\n\t\twhile( mongoc_cursor_next( cursor, &bsonDoc ) )\r\n\t\t{\r\n\t\t\tWinEntry* winEntry = new WinEntry();\r\n\t\t\tif( WinEntryFromBson( *winEntry, bsonDoc ) )\r\n\t\t\t\twinEntryList.push_back( winEntry );\r\n\t\t}\r\n\r\n\t\tsuccess = true;\r\n\t}\r\n\twhile( false );\r\n\r\n\tif( cursor )\r\n\t\tmongoc_cursor_destroy( cursor );\r\n\r\n\tif( bsonQuery )\r\n\t\tbson_free( bsonQuery );\r\n\r\n\treturn true;\r\n}\r\n\r\n\/\/ ChiCheMongo.cpp<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) Facebook Inc. and Microsoft Corporation.\n\/\/ Licensed under the MIT license.\n\n#include \"onnx\/defs\/schema.h\"\n\nusing AttrType = onnx::OpSchema::AttrType;\n\n\/\/ CuDNN parameters not included yet:\n\/\/ - dropout (as we primarily target inference)\n\/\/ Description below is borrowed from CuDNN and TensorRT docs\n\nOPERATOR_SCHEMA(OptimizedRNN)\n    .NumInputs(2, 6)\n    .NumOutputs(1, 3)\n    .SetDoc(R\"DOC(\nComputes a stack of several RNNs in optimized fashion. This operator is usually\nimplemented via CuDNN and thus most of the attributes and weights layout matches\ndirectly.\n)DOC\")\n    .Attr(\"cell_type\", R\"DOC(\nTypes of the cell: `simple`, `gru`, `lstm`, `lstm_peephole`, `lstm_input_forget`\n\nEquation definitions:\n`i` - input gate\n`o` - output gate\n`f` - forget gate\n`z` - update gate\n`r` - reset gate\n`c` - cell gate\n`h` - hidden gate\n`t` - time step (t-1 means previous time step)\n`Xi` - input tensor\n`W[izrfcohp]` - W parameter weight matrices for the corresponding gates\n`R[izrfcohp]` - R parameter weight matrices for the corresponding gates\n`Wb[izrfcohp]` - W parameter bias vectors for the corresponding gates\n`Rb[izrfcohp]` - R parameter bias vectors for the corresponding gates\n`ReLU(X)` - max(X, 0)\n`tanh` - hyperbolic tangent of X\n`sigmoid(X)` - 1 \/ (1 + e^-X)\n`[C|H]` - Cell\/Hidden state\n\n- Equations:\n  `simple(relu)`\n  - Ht = ReLU(Wi*Xt + Ri*Ht-1 + Wbi + Rbi)\n\n  `simple(tanh)`\n  - Ht = tanh(Wi*Xt + Ri*Ht-1 + Wbi + Rbi)\n\n  `lstm with default activations`\n  - it = sigmoid(Wi*Xt + Ri*Ht-1 + Wbi + Rbi)\n  - ft = sigmoid(Wf*Xt + Rf*Ht-1 + Wbf + Rbf)\n  - ot = sigmoid(Wo*Xt + Ro*Ht-1 + Wbo + Rbo)\n  - ct = tanh(Wc*Xt + Rc*Ht-1 + Wbc + Rbc)\n  - Ct = ft (.) Ct-1 + it (.) ct\n  - H = ot (.) tanh(C)\n\n  `gru with default activations`\n  - zt = sigmoid(Wz*Xt + Rz*Ht-1 + Wbz + Rbz)\n  - rt = sigmoid(Wr*Xt + Rr*Ht-1 + Wbr + Rbr)\n  - ht = tanh(Wh*Xt + rt *(Rh*Ht-1 + Rbh) + Wbh)\n  - H = (1 - zt) (.) ht + it (.) Ht-1\n\n  `lstm_peephole with default activations`\n  - it = sigmoid(Wi*Xt + Ri*Ht-1 + Pi(.)Ct-1 + Wbi + Rbi)\n  - ft = sigmoid(Wf*Xt + Rf*Ht-1 + Pf(.)Ct-1 + Wbf + Rbf)\n  - ot = sigmoid(Wo*Xt + Ro*Ht-1 + Po(.)Ct-1 + Wbo + Rbo)\n  - ct = tanh(Wc*Xt + Rc*Ht-1 + Wbc + Rbc)\n  - Ct = ft (.) Ct-1 + it (.) ct\n  - H = ot (.) tanh(C)\n\n  `lstm_input_forget with default activations`\n  - it = sigmoid(Wi*Xt + Ri*Ht-1 + Wbi + Rbi)\n  - ot = sigmoid(Wo*Xt + Ro*Ht-1 + Wbo + Rbo)\n  - ct = tanh(Wc*Xt + Rc*Ht-1 + Wbc + Rbc)\n  - Ct = (1 - it) (.) Ct-1 + it (.) ct\n  - H = ot (.) tanh(C)\n\nNote, that for LSTM and 2 out of 3 gates for GRU, there are duplicate biases for\nthe gates (model is overparametrized). It follows CuDNN\/TensorRT convention and\nallows to make spec more uniform.\n)DOC\", AttrType::STRING, true)\n    .Attr(\"directions\",\n          \"Number of directions: 1 for unidirectional (default) and 2 for \"\n          \"bidirectional\",\n          AttrType::INT)\n    .Attr(\"skip_input_transform\",\n          \"If set, skips linear transformation on the input of the first layer\",\n          AttrType::INT)\n    .Attr(\"num_layers\", \"Numbers of RNN layers in the stack, default 1\",\n          AttrType::INT)\n    .Attr(\"hidden_size\", \"Number of neurons in the hidden layer\", AttrType::INT)\n    .Attr(\"activations\", \"A list of activation functions for the gates in the order \"\n          \"`iofzrch`. Typical activation functions are sigmoid and tanh. For each \"\n          \"cell type, the default is given in the above equations.\",\n          AttrType::STRINGS)\n    .Attr(\"use_bias\", \"Use the bias tensors for the gates if 1. Default 1.\",\n          AttrType::INT)\n    .Attr(\"reverse\", \"Process the sequences in reverse order, default 0\",\n          AttrType::INT)\n    .Attr(\"clip\", \"Cell clip threshold. Clipping bounds the elements of a tensor \"\n          \"in the range of [-threshold, +threshold] and is applied to the inputs \"\n          \"of activations. Default to no clip if not specified.\",\n          AttrType::FLOAT)\n    .Input(0, \"weights\", R\"DOC(\nAll parameters of the stack packed together in the opaque tensor. The size must\nbe compatible with input attributes passed to the op.\n\nThe layout format is the one used by CuDNN and very similar to TensorRT:\n\nThe weight structure holds weights and biases for each layer of the network.\nEach parameter matrix is linearly appended after the previous parameter matrix\nwithout padding.\n\nThe order of matrixes `{K, L, D, R, N, C}` is defined as:\n - K - type of the matrix: `weight` (first) or `bias` (second)\n - L - The number of layers in the RNN - `num_layers`\n - D - The direction of the layer: normal (first) or reverse (second).\n                                   (in case of `directions=2`)\n - R - The type of the connection: `input-hidden` (first) or\n                                   `hidden-hidden` (second)\n - N - The number of gates matrices in the RNN, dependent on the `cell_type`:\n -- For `simple(relu)` or `simple(tanh)` there is one gate\n -- For `gru` there are 3 gates ordered as `reset`, `update`, `hidden`\n -- For `lstm` there are 4 gates ordered as `input`, `forget`, `cell`, `output`\n - C - The size of each matrix, which varies.\n -- If the linear layer on the input is skipped (`skip_input_transform=1`)\n    and then for the first layer (`L=1`) the weight matrix (`K=weight`)\n    on the input connection (`R=input-hidden`) is skipped,\n    i.e. has 0 parameters in the list\n -- For the first layer (`L=1`) weight matrix (`K=weight`) on input connection\n    (`R=input-hidden`), dimensions are `{hidden_size, input_size}`\n -- For other layers (`L>1`) weight matrix (`K=weight`) on input connection\n    (`R=input-hidden`), dimensions are `{hidden_size, directions * hidden_size}`\n -- For weight matrix (`K=weight`) on recurrent connection (`R=hidden-hidden`),\n    dimensions are `{hidden_size, hidden_size}`\n -- For all biases (`K=bias`), dimensions are `{hidden_size}`\n)DOC\")\n    .Input(1, \"input\",\n           \"The input sequences packed (and potentially padded) into one 3-D \"\n           \"tensor with the shape of `[seq_length, batch_size, input_size]`.\")\n    .Input(2, \"initial_h\",\n           \"Optional initial value of the hidden. If not specified - assumed \"\n           \"to be 0. Dimensions `[num_layers * directions, batch_size, \"\n           \"hidden_size]`\")\n    .Input(3, \"initial_c\",\n           \"For LSTM only: optional initial value of the cell. If not \"\n           \"specified - assumed to be 0. Dimensions `[num_layers * directions, \"\n           \"batch_size, hidden_size]`\")\n    .Input(4, \"seq_lens\",\n           \"Optional tensor specifying lengths of the sequences in a batch.\"\n           \"Has shape `[batch_size]`.\")\n    .Input(5, \"peephole_w\",\n           \"For LSTM-peephole only: weight for peepholes. Dimensions \"\n           \"`[3 * num_layers * directions, hidden_size]`\")    \n    .Output(0, \"output\", \"The output 3-dim sequence.\")\n    .Output(1, \"output_h\",\n            \"Optional output value of the hidden. Same shape as input_h\")\n    .Output(2, \"output_c\",\n            \"For LSTM only: optional output value of the cell. Same shape as \"\n            \"input_h\");\n<commit_msg>Updated: Removed OptimizedRNN, divided into 4 RNN ops: SimpleRNN, GRU, LSTM, BirectionalLSTM.<commit_after>\/\/ Copyright (c) Facebook Inc. and Microsoft Corporation.\n\/\/ Licensed under the MIT license.\n\n#include \"onnx\/defs\/schema.h\"\n\nusing AttrType = onnx::OpSchema::AttrType;\n\nOPERATOR_SCHEMA(SimpleRNN)\n    .NumInputs(3, 6)\n    .NumOutputs(1, 2)\n    .SetDoc(R\"DOC(\nComputes an one-layer simple RNN. This operator is usually supported\nvia some custom implementation such as CuDNN.\n\nNotations:\n`X` - input tensor\n`i` - input gate\n`t` - time step (t-1 means previous time step)\n`Wi` - W parameter weight matrix for input gate\n`Ri` - R recurrence weight matrix for input gate\n`Wbi` - W parameter bias vector for input gate\n`Rbi` - R parameter bias vector for input gate\n`ReLU(X)` - max(X, 0)\n`tanh(X)` - hyperbolic tangent of X\n`H` - Hidden state\n\nEquations:\n  - Ht = Activation(Wi*Xt + Ri*Ht-1 + Wbi + Rbi)\n)DOC\")\n    .Attr(\"activation\", \"The activation function for input gate. Typical \"\n\t  \"activation functions are tanh and ReLU. Default `tanh`.\",\n          AttrType::STRING)\n    .Attr(\"hidden_size\", \"Number of neurons in the hidden layer\", AttrType::INT)\n    .Attr(\"reverse\", \"Process the sequences in reverse order, default 0.\",\n          AttrType::INT)\n    .Attr(\"clip\", \"Cell clip threshold. Clipping bounds the elements of a tensor \"\n          \"in the range of [-threshold, +threshold] and is applied to the input \"\n          \"of activations. No clip if not specified.\",\n          AttrType::FLOAT)\n    .Input(0, \"input\",\n           \"The input sequences packed (and potentially padded) into one 3-D \"\n           \"tensor with the shape of `[seq_length, batch_size, input_size]`.\")\n    .Input(1, \"W\", \n\t   \"The weight tensor for input gate. The tensor has shape \"\n\t   \"`[hidden_size, input_size]`.\")\n    .Input(2, \"R\",\n\t   \"The recurrence weight tensor. The tensor has shape \"\n\t   \"`[hidden_size, hidden_size}`.\")\n    .Input(3, \"B\",\n\t   \"The bias tensor for input gate. The tensor is a concatenation of\"\n\t   \"`Wbi` and `Rbi`, and has shape `[2*hidden_size]`, Optional: If not \"\n\t   \"specified - assumed to be 0.\",\n\t   true \/*optional*\/)\n    .Input(4, \"initial_h\",\n\t   \"Optional initial value of the hidden. If not specified - assumed \"\n\t   \"to be 0. It has shape `[batch_size, hidden_size]`.\",\n\t   true \/*optional*\/)\t   \n    .Input(5, \"seq_lens\",\n           \"Optional tensor specifying lengths of the sequences in a batch. \"\n           \"If not specified - assumed all sequences in the batch to have \"\n\t   \"length `seq_length`. It has shape `[batch_size]`.\",\n\t   true \/*optional*\/)\t   \n    .Output(0, \"output\",\n\t    \"A tensor that concats all the intermediate output values of the \"\n\t    \"hidden. It has shape `[seq_length, batch_size, hidden_size]`.\")\n    .Output(1, \"output_h\",\n            \"The last output value of the hidden. It has shape \"\n\t    \"`[batch_size, hidden_size]`.\");\n\n\nOPERATOR_SCHEMA(GRU)\n    .NumInputs(3, 6)\n    .NumOutputs(1, 2)\n    .SetDoc(R\"DOC(\nComputes an one-layer GRU in optimized fashion.\n\nNotations:\n`X` - input tensor\n`z` - update gate\n`r` - reset gate\n`h` - hidden gate\n`t` - time step (t-1 means previous time step)\n`W[zrh]` - W parameter weight matrix for update, reset, and hidden gates\n`R[zrh]` - R recurrence weight matrix for update, reset, and hidden gates\n`Wb[zrh]` - W bias vectors for update, reset, and hidden gates\n`Rb[zrh]` - R bias vectors for update, reset, and hidden gates\n`tanh(X)` - hyperbolic tangent of X\n`sigmoid(X)` - 1 \/ (1 + e^-X)\n`H` - Hidden state\n\nEquations (GRU with default activations):\n  - zt = sigmoid(Wz*Xt + Rz*Ht-1 + Wbz + Rbz)\n  - rt = sigmoid(Wr*Xt + Rr*Ht-1 + Wbr + Rbr)\n  - ht = tanh(Wh*Xt + rt*(Rh*Ht-1 + Rbh) + Wbh)\n  - H = (1 - zt) (.) ht + it (.) Ht-1\n)DOC\")\n    .Attr(\"activations\", \"A list of 3 activation functions for update, reset, and \"\n\t  \"hidden gates. Typical activation functions are sigmoid and tanh. See the \"\n\t  \"equations for default if not specified.\",\n          AttrType::STRINGS)\n    .Attr(\"hidden_size\", \"Number of neurons in the hidden layer\", AttrType::INT)\n    .Attr(\"reverse\", \"Process the sequences in reverse order if 1, default 0.\",\n          AttrType::INT)\n    .Attr(\"clip\", \"Cell clip threshold. Clipping bounds the elements of a tensor \"\n          \"in the range of [-threshold, +threshold] and is applied to the input \"\n          \"of activations. No clip if not specified.\",\n          AttrType::FLOAT)\n    .Input(0, \"input\",\n           \"The input sequences packed (and potentially padded) into one 3-D \"\n           \"tensor with the shape of `[seq_length, batch_size, input_size]`.\")\n    .Input(1, \"W\",\n\t   \"The weight tensor for the gates. The weights W[zrh] are \"\n\t   \"concatenated along dimension 0. This tensor has shape \"\n\t   \"`[3 * hidden_size, input_size]`.\")\n    .Input(2, \"R\",\n\t   \"The recurrence weight tensor. The recurrence weights R[zrh] are \"\n\t   \"concatenated along dimension 0. This tensor has shape \"\n\t   \"`[3 * hidden_size, hidden_size}`.\")\n    .Input(3, \"B\",\n\t   \"The bias tensor for the gates. The biases Wb[zrh] and Rb[zrh] are \"\n\t   \"concatenated along dimension 0. This tensor has shape \"\n\t   \"`[6 * hidden_size]`. Optional: If not specified - assumed to be 0\",\n\t   true \/*optional*\/)\n    .Input(4, \"initial_h\",\n\t   \"Optional initial value of the hidden. If not specified - assumed \"\n\t   \"to be 0. It has shape `[batch_size, hidden_size]`.\",\n\t   true \/*optional*\/)\n    .Input(5, \"seq_lens\",\n           \"Optional tensor specifying lengths of the sequences in a batch. \"\n           \"If not specified - assumed all sequences in the batch to have \"\n\t   \"length `seq_length`. It has shape `[batch_size]`.\",\n\t   true \/*optional*\/)\n    .Output(0, \"output\",\n\t    \"A tensor that concats all the intermediate output values of the \"\n\t    \"hidden. It has shape `[seq_length, batch_size, hidden_size]`.\")\t    \n    .Output(1, \"output_h\",\n            \"The last output value of the hidden. It has shape \"\n\t    \"`[batch_size, hidden_size]`.\");\n\n\nOPERATOR_SCHEMA(LSTM)\n    .NumInputs(3, 8)\n    .NumOutputs(1, 2)\n    .SetDoc(R\"DOC(\nComputes an one-layer LSTM. This operator is usually supported via some\ncustom implementation such as CuDNN.\n\nNotations:\n`X` - input tensor\n`i` - input gate\n`o` - output gate\n`f` - forget gate\n`c` - cell gate\n`t` - time step (t-1 means previous time step)\n`W[iofc]` - W parameter weight matrix for input, output, forget, and cell gates\n`R[iofc]` - R recurrence weight matrix for input, output, forget, and cell gates\n`Wb[iofc]` - W bias vectors for input, output, forget, and cell gates\n`Rb[iofc]` - R bias vectors for input, output, forget, and cell gates\n`P[iof]`  - P peephole weight matrix for input, output, and forget gates\n`tanh(X)` - hyperbolic tangent of X\n`sigmoid(X)` - 1 \/ (1 + e^-X)\n`H` - Hidden state\n\nEquations (LSTM with default activations):\n  - it = sigmoid(Wi*Xt + Ri*Ht-1 + Wbi + Rbi)\n  - ft = sigmoid(Wf*Xt + Rf*Ht-1 + Wbf + Rbf)\n  - ot = sigmoid(Wo*Xt + Ro*Ht-1 + Wbo + Rbo)\n  - ct = tanh(Wc*Xt + Rc*Ht-1 + Wbc + Rbc)\n  - Ct = ft (.) Ct-1 + it (.) ct\n  - H = ot (.) tanh(Ct)\n)DOC\")\n    .Attr(\"activations\", \"A list of 4 activation functions for input, output, \"\n\t  \"forget, and cell gates. Typical activation functions are sigmoid \"\n\t  \"and tanh. See the equations for default if not specified\",\n          AttrType::STRINGS)\n    .Attr(\"hidden_size\", \"Number of neurons in the hidden layer\", AttrType::INT)\n    .Attr(\"reverse\", \"Process the sequences in reverse order if 1, default 0.\",\n          AttrType::INT)\n    .Attr(\"input_forget\", \"Couple the input and forget gates if 1, default 0.\",\n          AttrType::INT)\t  \n    .Attr(\"clip\", \"Cell clip threshold. Clipping bounds the elements of a tensor \"\n          \"in the range of [-threshold, +threshold] and is applied to the input \"\n          \"of activations. No clip if not specified.\",\n          AttrType::FLOAT)\n    .Input(0, \"input\",\n           \"The input sequences packed (and potentially padded) into one 3-D \"\n           \"tensor with the shape of `[seq_length, batch_size, input_size]`.\")\n    .Input(1, \"W\",\n\t   \"The weight tensor for the gates. The weights W[iofc] are concatenated \"\n\t   \"along dimension 0. This tensor has shape `[4 * hidden_size, input_size]`.\")\n    .Input(2, \"R\", \n\t   \"The recurrence weight tensor. The recurrence weights R[iofc] are \"\n\t   \"concatenated along dimension 0. This tensor has shape \"\n\t   \"`[4 * hidden_size, hidden_size}`.\")\n    .Input(3, \"B\",\n\t   \"The bias tensor for input gate. The biases Wb[iofc] and Rb[iofc] are \"\n\t   \"concatenated along dimension 0. This tensor has shape \"\n\t   \"`[8 * hidden_size]`. Optional: If not specified - assumed to be 0.\",\n\t   true \/*optional*\/)\n    .Input(4, \"P\",\n\t   \"The weight tensor for peepholes. The peephole weights P[iof] are \"\n\t   \"concatenated along dimension 0. It has shape `[3 * hidde_size, hidden_size]`. \"\n\t   \"Optional: If not specified - assumed to be 0.\",\n\t   true \/*optional*\/)\n    .Input(5, \"initial_h\",\n           \"Optional initial value of the hidden. If not specified - assumed \"\n           \"to be 0. It has shape `[batch_size, hidden_size]`.\",\n\t   true \/*optional*\/)\t   \n    .Input(6, \"initial_c\",\n           \"Optional initial value of the cell. If not specified - assumed \"\n\t   \"to be 0. It has shape `[batch_size, hidden_size]`.\",\n\t   true \/*optional*\/)\n    .Input(7, \"seq_lens\",\n           \"Optional tensor specifying lengths of the sequences in a batch. \"\n           \"If not specified - assumed all sequences in the batch to have \"\n\t   \"length `seq_length`. It has shape `[batch_size]`.\",\n\t   true \/*optional*\/)\t   \n    .Output(0, \"output\",\n\t    \"A tensor that concats all the intermediate output values of the \"\n\t    \"hidden. It has shape `[seq_length, batch_size, hidden_size]`.\")\t    \n    .Output(1, \"output_h\",\n            \"The last output value of the hidden. It has shape \"\n\t    \"`[batch_size, hidden_size]`.\");\n\n\nOPERATOR_SCHEMA(BidirectionalLSTM)\n    .NumInputs(3, 8)\n    .NumOutputs(1, 2)\n    .SetDoc(R\"DOC(\nComputes an one-layer bidirectional LSTM. This operator is usually\nsupported via some custom implementation such as CuDNN.\n\nNotations:\n`X` - input tensor\n`i` - input gate\n`o` - output gate\n`f` - forget gate\n`c` - cell gate\n`t` - time step (t-1 means previous time step)\n`W[iofc]` - W parameter weight matrix for input, output, forget, and cell gates\n`R[iofc]` - R recurrence weight matrix for input, output, forget, and cell gates\n`Wb[iofc]` - W bias vectors for input, output, forget, and cell gates\n`Rb[iofc]` - R bias vectors for input, output, forget, and cell gates\n`P[iof]`  - P peephole weight matrix for input, output, and forget gates\n`WR[iofc]` - WR parameter weight matrix for reverse direction input, output, forget, and cell gates\n`RR[iofc]` - RR recurrence weight matrix for reverse direction input, output, forget, and cell gates\n`WRb[iofc]` - WR bias vectors for reverse direction input, output, forget, and cell gates\n`RRb[iofc]` - RR bias vectors for reverse direction input, output, forget, and cell gates\n`PR[iof]`  - PR peephole weight matrix for reverse direction input, output, and forget gates\n`tanh(X)` - hyperbolic tangent of X\n`sigmoid(X)` - 1 \/ (1 + e^-X)\n`H` - Hidden state\n\nEquations (forward direction LSTM with default activations):\n  - it = sigmoid(Wi*Xt + Ri*Ht-1 + Wbi + Rbi)\n  - ft = sigmoid(Wf*Xt + Rf*Ht-1 + Wbf + Rbf)\n  - ot = sigmoid(Wo*Xt + Ro*Ht-1 + Wbo + Rbo)\n  - ct = tanh(Wc*Xt + Rc*Ht-1 + Wbc + Rbc)\n  - Ct = ft (.) Ct-1 + it (.) ct\n  - H = ot (.) tanh(Ct)\n)DOC\")\n    .Attr(\"activations\", \"A list of 4 activation functions for input, output, \"\n\t  \"forget, and cell gates. Typical activation functions are sigmoid \"\n\t  \"and tanh. See the equations for default if not specified.\",\n          AttrType::STRINGS)\n    .Attr(\"hidden_size\", \"Number of neurons in the hidden layer\", AttrType::INT)\n    .Attr(\"input_forget\", \"Couple the input and forget gates if 1, default 0.\",\n          AttrType::INT)\t  \n    .Attr(\"clip\", \"Cell clip threshold. Clipping bounds the elements of a tensor \"\n          \"in the range of [-threshold, +threshold] and is applied to the input \"\n          \"of activations. No clip if not specified.\",\n          AttrType::FLOAT)\n    .Input(0, \"input\",\n           \"The input sequences packed (and potentially padded) into one 3-D \"\n           \"tensor with the shape of `[seq_length, batch_size, input_size]`.\")\n    .Input(1, \"W\",\n\t   \"The weight tensor for the gates. The weights W[iofc] and WR[iofc] \"\n\t   \"are concatenated along dimension 0. This tensor has shape \"\n\t   \"`[8 * hidden_size, input_size]`.\")\n    .Input(2, \"R\",\n\t   \"The recurrence weight tensor. The recurrence weights R[iofc] \"\n\t   \"and RR[iofc] are concatenated along dimension 0. This tensor has \"\n\t   \"shape `[8 * hidden_size, hidden_size}`.\")\n    .Input(3, \"B\",\n\t   \"The bias tensor for input gate. The biases Wb[iofc], Rb[iofc], \"\n\t   \"WRb[iofc], and RRb[iofc] are concatenated along dimension 0. \"\n\t   \"This tensor has shape `[16 * hidden_size]`. Optional: If not \"\n\t   \"specified - assumed to be 0.\",\n\t   true \/*optional*\/)\n    .Input(4, \"P\",\n\t   \"The weight tensor for peepholes. The peephole weights P[iof] and \"\n\t   \"PR[iof] are concatenated along dimension 0. It has shape \"\n\t   \"`[6 * hidde_size, hidden_size]`. Optional: If not specified - \"\n\t   \"assumed to be 0.\",\n\t   true \/*optional*\/)\n    .Input(5, \"initial_h\",\n           \"Optional initial value of the hidden. If not specified - assumed \"\n           \"to be 0. It has shape `[2, batch_size, hidden_size]`\",\n\t   true \/*optional*\/)\n    .Input(6, \"initial_c\",\n           \"Optional initial value of the cell. If not specified - assumed \"\n\t   \"to be 0. It has shape `[2, batch_size, hidden_size]`\",\n\t   true \/*optional*\/)\n    .Input(7, \"seq_lens\",\n           \"Optional tensor specifying lengths of the sequences in a batch. \"\n           \"If not specified - assumed all sequences in the batch to have \"\n\t   \"length `seq_length`. It has shape `[batch_size]`.\",\n\t   true \/*optional*\/)\n    .Output(0, \"output\",\n\t    \"A tensor that concats all the intermediate output values of the \"\n\t    \"hidden. It has shape `[seq_length, batch_size, hidden_size]`.\")\t    \n    .Output(1, \"output_h\",\n            \"The last output value of the hidden. It has shape \"\n\t    \"`[batch_size, hidden_size]`.\");\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file\n * @author  Mamadou Babaei <info@babaei.net>\n * @version 0.1.0\n *\n * @section LICENSE\n *\n * (The MIT License)\n *\n * Copyright (c) 2016 - 2020 Mamadou Babaei\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *\n * @section DESCRIPTION\n *\n * Contains necessary functions to uncompress a file.\n *\/\n\n\n#include <algorithm>\n#include <fstream>\n#include <iterator>\n#include <vector>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <unistd.h>\n#include <boost\/filesystem.hpp>\n#include <boost\/format.hpp>\n#include <archive.h>\n#include <archive_entry.h>\n#include <zip.h>\n#include \"Archiver.hpp\"\n#include \"Compression.hpp\"\n#include \"FileSystem.hpp\"\n#include \"System.hpp\"\n\nusing namespace std;\nusing namespace boost;\nusing namespace CoreLib;\n\nstatic int UnTarCopyData(archive *ar, archive *aw)\n{\n    int r;\n    const void *buffer;\n\n    size_t size;\n\n#if ARCHIVE_VERSION_NUMBER >= 3000000\n    int64_t offset;\n#else\n    off_t offset;\n#endif\n\n    for (;;) {\n        r = archive_read_data_block(ar, &buffer, &size, &offset);\n\n        if (r == ARCHIVE_EOF) {\n            return (ARCHIVE_OK);\n        }\n\n        if (r != ARCHIVE_OK) {\n            return r;\n        }\n\n        r = static_cast<int>(\n                    archive_write_data_block(aw, buffer, size, offset));\n\n        if (r != ARCHIVE_OK) {\n            \/\/\/ archive_write_data_block() failed!\n            \/\/archive_error_string(aw));\n            return r;\n        }\n    }\n}\n\nbool Archiver::UnGzip(const std::string &archive, const std::string &extractedFile)\n{\n    string error;\n    return UnGzip(archive, extractedFile, error);\n}\n\nbool Archiver::UnGzip(const std::string &archive, const std::string &extractedFile,\n                      std::string &out_error)\n{\n    out_error.clear();\n\n    ifstream ifs(archive, ios::binary);\n    if (!ifs.is_open()) {\n        out_error.assign((format(\"Archiver::UnGzip: Could not extract '%1%' as %2%!\")\n                          % archive % extractedFile).str());\n        return false;\n    }\n    Compression::Buffer compressedContents((std::istreambuf_iterator<char>(ifs)),\n                                           std::istreambuf_iterator<char>());\n    ifs.close();\n\n    Compression::Buffer uncompressedContents;\n    Compression::Decompress(compressedContents, uncompressedContents,\n                            Compression::Algorithm::Gzip);\n\n    ofstream ofs(extractedFile, ios::binary);\n    if (!ofs.is_open()) {\n        out_error.assign((format(\"Archiver::UnGzip: Could not extract '%1%' as %2%!\")\n                          % archive % extractedFile).str());\n        return false;\n    }\n    copy(uncompressedContents.begin(), uncompressedContents.end(),\n         ostreambuf_iterator<char>(ofs));\n    ofs.flush();\n    ofs.close();\n\n    return true;\n}\n\nbool Archiver::UnTar(const std::string &archivePath, const std::string &extractDirectory)\n{\n    string error;\n    return UnTar(archivePath, extractDirectory, error);\n}\n\nbool Archiver::UnTar(const std::string &archivePath, const std::string &extractDirectory,\n                     std::string &out_error)\n{\n    out_error.clear();\n    bool success = false;\n\n    int flags = ARCHIVE_EXTRACT_TIME;\n    \/\/    flags |= ARCHIVE_EXTRACT_PERM;\n    \/\/    flags |= ARCHIVE_EXTRACT_ACL;\n    \/\/    flags |= ARCHIVE_EXTRACT_FFLAGS;\n\n    archive *a = archive_read_new();\n    archive *ext = archive_write_disk_new();\n\n    archive_write_disk_set_options(ext, flags);\n    archive_read_support_format_tar(a);\n\n    int r;\n    if ((r = archive_read_open_filename(a, archivePath.c_str(), 10240))) {\n        out_error.assign(\n                    (format(\"Archiver::UnTar: archive_read_open_filename() failed: %1%; %2\")\n                     % r % archive_error_string(a)).str());\n    } else {\n        archive_entry *entry;\n\n        for (;;) {\n            r = archive_read_next_header(a, &entry);\n\n            if (r == ARCHIVE_EOF) {\n                success = true;\n                break;\n            }\n\n            if (r != ARCHIVE_OK) {\n                out_error.assign(\n                            (format(\"Archiver::UnTar: archive_read_next_header() failed: %1%; %2\")\n                             % 1 % archive_error_string(a)).str());\n            } else {\n                const char *file = archive_entry_pathname(entry);\n                const std::string filePath =\n                        (boost::filesystem::path(extractDirectory)\n                        \/ boost::filesystem::path(file)).string();\n                archive_entry_set_pathname(entry, filePath.c_str());\n\n                r = archive_write_header(ext, entry);\n\n                if (r != ARCHIVE_OK) {\n                    out_error +=\n                            (format(\"Archiver::UnTar: archive_write_header() failed: %1%; %2\\n\")\n                             % archive_error_string(ext)).str();\n                } else {\n                    (void)UnTarCopyData(a, ext);\n\n                    r = archive_write_finish_entry(ext);\n\n                    if (r != ARCHIVE_OK) {\n                        out_error +=\n                                (format(\"Archiver::UnTar: archive_write_finish_entry() failed: %1%; %2\\n\")\n                                 % 1 % archive_error_string(ext)).str();\n                    }\n                }\n            }\n        }\n    }\n\n    archive_read_close(a);\n    archive_read_free(a);\n\n    archive_write_close(ext);\n    archive_write_free(ext);\n\n    return success;\n}\n\nbool Archiver::UnZip(const std::string &archive, const std::string &extractionPath)\n{\n    string error;\n    return UnZip(archive, extractionPath, error);\n}\n\nbool Archiver::UnZip(const std::string &archive, const std::string &extractionPath,\n                     std::string &out_error)\n{\n    out_error.clear();\n\n    struct zip *za;\n    char buf[100];\n    int err;\n\n    if ((za = zip_open(archive.c_str(), 0, &err)) == NULL) {\n        zip_error_to_str(buf, sizeof(buf), err, errno);\n        out_error.assign((format(\"Archiver::UnZip: Can't open zip archive `%1%': %2%!\")\n                          % archive % buf).str());\n        return false;\n    }\n\n    struct zip_file *zf;\n    struct zip_stat sb;\n    zip_int64_t len;\n    int fd;\n    zip_uint64_t sum;\n\n    for (zip_int64_t i = 0; i < zip_get_num_entries(za, 0); ++i) {\n        if (zip_stat_index(za, static_cast<zip_uint64_t>(i), 0, &sb) != 0) {\n            out_error.assign((format(\"Archiver::UnZip: Corrupted zip archive `%1%'!\")\n                              % archive).str());\n            return false;\n        }\n\n        len = static_cast<zip_int64_t>(strlen(sb.name));\n        if (sb.name[len - 1] == '\/') {\n            string dir((filesystem::path(extractionPath)\n                        \/ sb.name).string());\n            if (!FileSystem::CreateDir(dir, true)) {\n                out_error.assign((format(\"Archiver::UnZip: Failed to create directory `%1%'!\")\n                                  % dir).str());\n                return false;\n            }\n            continue;\n        }\n\n        boost::filesystem::path p(sb.name);\n        if (p.parent_path().string() != \"\") {\n            string dir((filesystem::path(extractionPath)\n                        \/ p.parent_path()).string());\n            if (!FileSystem::CreateDir(dir, true)) {\n                out_error.assign((format(\"Archiver::UnZip: Failed to create directory `%1%'!\")\n                                  % dir).str());\n                return false;\n            }\n        }\n\n        zf = zip_fopen_index(za, static_cast<zip_uint64_t>(i), 0);\n        if (!zf) {\n            out_error.assign((format(\"Archiver::UnZip: Corrupted zip archive `%1%'!\")\n                              % archive).str());\n            return false;\n        }\n\n#if ! defined ( _WIN32 )\n        fd = open((filesystem::path(extractionPath)\n                   \/ filesystem::path(sb.name)).string().c_str(),\n                  O_RDWR | O_TRUNC | O_CREAT, 0644);\n#else\n        fd = open((filesystem::path(extractionPath)\n                   \/ filesystem::path(sb.name)).string().c_str(),\n                  O_RDWR | O_TRUNC | O_CREAT | O_BINARY, 0644);\n#endif  \/\/ ! defined ( _WIN32 )\n\n        if (fd < 0) {\n            out_error.assign((format(\"Archiver::UnZip: Cannot open file `%1%' for writing!\")\n                              % sb.name).str());\n            return false;\n        }\n\n        sum = 0;\n        while (sum != sb.size) {\n            len = zip_fread(zf, buf, 100);\n            if (len < 0) {\n                out_error.assign((format(\"Archiver::UnZip: Corrupted zip archive `%1%'!\")\n                                  % archive).str());\n                return false;\n            }\n            write(fd, buf, static_cast<size_t>(len));\n            sum += static_cast<zip_uint64_t>(len);\n        }\n        close(fd);\n        zip_fclose(zf);\n    }\n\n    if (zip_close(za) == -1) {\n        out_error.assign((format(\"Archiver::UnZip: Can't close zip archive `%1%'!\")\n                          % archive).str());\n        return false;\n    }\n\n    return true;\n}\n<commit_msg>add boost prefix to filesystem in order to avoid build issues in c++17 mode on clang<commit_after>\/**\n * @file\n * @author  Mamadou Babaei <info@babaei.net>\n * @version 0.1.0\n *\n * @section LICENSE\n *\n * (The MIT License)\n *\n * Copyright (c) 2016 - 2020 Mamadou Babaei\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *\n * @section DESCRIPTION\n *\n * Contains necessary functions to uncompress a file.\n *\/\n\n\n#include <algorithm>\n#include <fstream>\n#include <iterator>\n#include <vector>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <unistd.h>\n#include <boost\/filesystem.hpp>\n#include <boost\/format.hpp>\n#include <archive.h>\n#include <archive_entry.h>\n#include <zip.h>\n#include \"Archiver.hpp\"\n#include \"Compression.hpp\"\n#include \"FileSystem.hpp\"\n#include \"System.hpp\"\n\nusing namespace std;\nusing namespace boost;\nusing namespace CoreLib;\n\nstatic int UnTarCopyData(archive *ar, archive *aw)\n{\n    int r;\n    const void *buffer;\n\n    size_t size;\n\n#if ARCHIVE_VERSION_NUMBER >= 3000000\n    int64_t offset;\n#else\n    off_t offset;\n#endif\n\n    for (;;) {\n        r = archive_read_data_block(ar, &buffer, &size, &offset);\n\n        if (r == ARCHIVE_EOF) {\n            return (ARCHIVE_OK);\n        }\n\n        if (r != ARCHIVE_OK) {\n            return r;\n        }\n\n        r = static_cast<int>(\n                    archive_write_data_block(aw, buffer, size, offset));\n\n        if (r != ARCHIVE_OK) {\n            \/\/\/ archive_write_data_block() failed!\n            \/\/archive_error_string(aw));\n            return r;\n        }\n    }\n}\n\nbool Archiver::UnGzip(const std::string &archive, const std::string &extractedFile)\n{\n    string error;\n    return UnGzip(archive, extractedFile, error);\n}\n\nbool Archiver::UnGzip(const std::string &archive, const std::string &extractedFile,\n                      std::string &out_error)\n{\n    out_error.clear();\n\n    ifstream ifs(archive, ios::binary);\n    if (!ifs.is_open()) {\n        out_error.assign((format(\"Archiver::UnGzip: Could not extract '%1%' as %2%!\")\n                          % archive % extractedFile).str());\n        return false;\n    }\n    Compression::Buffer compressedContents((std::istreambuf_iterator<char>(ifs)),\n                                           std::istreambuf_iterator<char>());\n    ifs.close();\n\n    Compression::Buffer uncompressedContents;\n    Compression::Decompress(compressedContents, uncompressedContents,\n                            Compression::Algorithm::Gzip);\n\n    ofstream ofs(extractedFile, ios::binary);\n    if (!ofs.is_open()) {\n        out_error.assign((format(\"Archiver::UnGzip: Could not extract '%1%' as %2%!\")\n                          % archive % extractedFile).str());\n        return false;\n    }\n    copy(uncompressedContents.begin(), uncompressedContents.end(),\n         ostreambuf_iterator<char>(ofs));\n    ofs.flush();\n    ofs.close();\n\n    return true;\n}\n\nbool Archiver::UnTar(const std::string &archivePath, const std::string &extractDirectory)\n{\n    string error;\n    return UnTar(archivePath, extractDirectory, error);\n}\n\nbool Archiver::UnTar(const std::string &archivePath, const std::string &extractDirectory,\n                     std::string &out_error)\n{\n    out_error.clear();\n    bool success = false;\n\n    int flags = ARCHIVE_EXTRACT_TIME;\n    \/\/    flags |= ARCHIVE_EXTRACT_PERM;\n    \/\/    flags |= ARCHIVE_EXTRACT_ACL;\n    \/\/    flags |= ARCHIVE_EXTRACT_FFLAGS;\n\n    archive *a = archive_read_new();\n    archive *ext = archive_write_disk_new();\n\n    archive_write_disk_set_options(ext, flags);\n    archive_read_support_format_tar(a);\n\n    int r;\n    if ((r = archive_read_open_filename(a, archivePath.c_str(), 10240))) {\n        out_error.assign(\n                    (format(\"Archiver::UnTar: archive_read_open_filename() failed: %1%; %2\")\n                     % r % archive_error_string(a)).str());\n    } else {\n        archive_entry *entry;\n\n        for (;;) {\n            r = archive_read_next_header(a, &entry);\n\n            if (r == ARCHIVE_EOF) {\n                success = true;\n                break;\n            }\n\n            if (r != ARCHIVE_OK) {\n                out_error.assign(\n                            (format(\"Archiver::UnTar: archive_read_next_header() failed: %1%; %2\")\n                             % 1 % archive_error_string(a)).str());\n            } else {\n                const char *file = archive_entry_pathname(entry);\n                const std::string filePath =\n                        (boost::filesystem::path(extractDirectory)\n                        \/ boost::filesystem::path(file)).string();\n                archive_entry_set_pathname(entry, filePath.c_str());\n\n                r = archive_write_header(ext, entry);\n\n                if (r != ARCHIVE_OK) {\n                    out_error +=\n                            (format(\"Archiver::UnTar: archive_write_header() failed: %1%; %2\\n\")\n                             % archive_error_string(ext)).str();\n                } else {\n                    (void)UnTarCopyData(a, ext);\n\n                    r = archive_write_finish_entry(ext);\n\n                    if (r != ARCHIVE_OK) {\n                        out_error +=\n                                (format(\"Archiver::UnTar: archive_write_finish_entry() failed: %1%; %2\\n\")\n                                 % 1 % archive_error_string(ext)).str();\n                    }\n                }\n            }\n        }\n    }\n\n    archive_read_close(a);\n    archive_read_free(a);\n\n    archive_write_close(ext);\n    archive_write_free(ext);\n\n    return success;\n}\n\nbool Archiver::UnZip(const std::string &archive, const std::string &extractionPath)\n{\n    string error;\n    return UnZip(archive, extractionPath, error);\n}\n\nbool Archiver::UnZip(const std::string &archive, const std::string &extractionPath,\n                     std::string &out_error)\n{\n    out_error.clear();\n\n    struct zip *za;\n    char buf[100];\n    int err;\n\n    if ((za = zip_open(archive.c_str(), 0, &err)) == NULL) {\n        zip_error_to_str(buf, sizeof(buf), err, errno);\n        out_error.assign((format(\"Archiver::UnZip: Can't open zip archive `%1%': %2%!\")\n                          % archive % buf).str());\n        return false;\n    }\n\n    struct zip_file *zf;\n    struct zip_stat sb;\n    zip_int64_t len;\n    int fd;\n    zip_uint64_t sum;\n\n    for (zip_int64_t i = 0; i < zip_get_num_entries(za, 0); ++i) {\n        if (zip_stat_index(za, static_cast<zip_uint64_t>(i), 0, &sb) != 0) {\n            out_error.assign((format(\"Archiver::UnZip: Corrupted zip archive `%1%'!\")\n                              % archive).str());\n            return false;\n        }\n\n        len = static_cast<zip_int64_t>(strlen(sb.name));\n        if (sb.name[len - 1] == '\/') {\n            string dir((boost::filesystem::path(extractionPath)\n                        \/ sb.name).string());\n            if (!FileSystem::CreateDir(dir, true)) {\n                out_error.assign((format(\"Archiver::UnZip: Failed to create directory `%1%'!\")\n                                  % dir).str());\n                return false;\n            }\n            continue;\n        }\n\n        boost::filesystem::path p(sb.name);\n        if (p.parent_path().string() != \"\") {\n            string dir((boost::filesystem::path(extractionPath)\n                        \/ p.parent_path()).string());\n            if (!FileSystem::CreateDir(dir, true)) {\n                out_error.assign((format(\"Archiver::UnZip: Failed to create directory `%1%'!\")\n                                  % dir).str());\n                return false;\n            }\n        }\n\n        zf = zip_fopen_index(za, static_cast<zip_uint64_t>(i), 0);\n        if (!zf) {\n            out_error.assign((format(\"Archiver::UnZip: Corrupted zip archive `%1%'!\")\n                              % archive).str());\n            return false;\n        }\n\n#if ! defined ( _WIN32 )\n        fd = open((boost::filesystem::path(extractionPath)\n                   \/ boost::filesystem::path(sb.name)).string().c_str(),\n                  O_RDWR | O_TRUNC | O_CREAT, 0644);\n#else\n        fd = open((boost::filesystem::path(extractionPath)\n                   \/ boost::filesystem::path(sb.name)).string().c_str(),\n                  O_RDWR | O_TRUNC | O_CREAT | O_BINARY, 0644);\n#endif  \/\/ ! defined ( _WIN32 )\n\n        if (fd < 0) {\n            out_error.assign((format(\"Archiver::UnZip: Cannot open file `%1%' for writing!\")\n                              % sb.name).str());\n            return false;\n        }\n\n        sum = 0;\n        while (sum != sb.size) {\n            len = zip_fread(zf, buf, 100);\n            if (len < 0) {\n                out_error.assign((format(\"Archiver::UnZip: Corrupted zip archive `%1%'!\")\n                                  % archive).str());\n                return false;\n            }\n            write(fd, buf, static_cast<size_t>(len));\n            sum += static_cast<zip_uint64_t>(len);\n        }\n        close(fd);\n        zip_fclose(zf);\n    }\n\n    if (zip_close(za) == -1) {\n        out_error.assign((format(\"Archiver::UnZip: Can't close zip archive `%1%'!\")\n                          % archive).str());\n        return false;\n    }\n\n    return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/************************************************************************************\n**  \n* @copyright (c) 2013-2100, ChengDu Duyer Technology Co., LTD. All Right Reserved.\n*\n*************************************************************************************\/\n\/**\n* @GFile\t\tg_file.cpp\n* @version     \n* @brief      \n* @author   duye\n* @date     2013-06-20\n* @note \n*\n*  1. 2013-06-20 duye Created this GFile\n* \n*\/\n#include <stdarg.h>\n#include <fcntl.h>\n#include <unistd.h>\n#include <string.h>\n#include <g_file.h>\n\n\/\/ default create GFile permissions\nstatic const GUint32 G_CREATE_MODE = 0x775;\n\nGResult GFileUtil::createFile(const GInt8* filePath)\n{\n    GInt32 fd = creat(filePath, G_CREATE_MODE);\n    if (fd != -1)\n    {\n        close(fd);\n        return G_YES;\n    }\n    \n    return G_NO;\n}\n\nGResult GFileUtil::createFile(const GInt8* filePath, const GUint64& initSize)\n{\n    return G_NO;\n}\n\nGFile::GFile() : m_fd(-1), m_flags(0), m_pathLen(0)\n{\n    m_error[0] = 0;\n    m_path[0] = 0;\n}\n\nGFile::GFile(const GInt8* filePath) : m_fd(-1), m_flags(0), m_pathLen(0)\n{\n    GUint32 len = strlen(filePath);\n    if (len < G_PATH_MAX)\n    {\n        memcpy(m_path, filePath, len);\n        m_path[len] = 0;\n        m_pathLen = len;\n    }\n\n    m_error[0] = 0;\n}\n\nGFile::~GFile() \n{\n    closeFile();\n}\n\nGResult GFile::setFilePath(const GInt8* filePath)\n{\n    if (m_pathLen > 0)\n    {   \n        setError(\"file path has exist\");\n        return G_NO;\n    }\n    \n    GUint32 len = strlen(filePath);\n    if (len < G_PATH_MAX)\n    {\n        memcpy(m_path, filePath, len);\n        m_path[len] = 0;\n        m_pathLen = len;\n    }    \n    else\n    {\n        setError(\"file path too long\");\n        return G_NO;   \n    }\n\n    return G_YES;\n}\n\nGResult GFile::openFile(const GUint64 flags)\n{\n    GInt32 openFlags = 0;\n    if (flags | G_OPEN_READ)\n    {\n        openFlags = O_RDONLY;\n    }\n    else if (flags | G_OPEN_WRITE)\n    {\n        openFlags = O_WRONLY | O_CREAT;\n    }\n    else if (flags | G_OPEN_RDWR)\n    {\n        openFlags = O_RDWR | O_CREAT;        \n    }\n    else if (flags | G_OPEN_APPEND)\n    {\n        if (openFlags == 0)\n        {\n            return G_NO;\n        }\n\n        openFlags |= O_APPEND;\n    }\n\n    if (openFlags == 0)\n    {\n        setError(\"input open mode error\");\n        return G_NO;\n    }\n    \n    return orgOpen(openFlags, G_CREATE_MODE);          \n}\n\nGResult GFile::closeFile()\n{\n    if (m_fd < 0)\n    {\n        setError(\"file don't open\");\n        return G_NO;\n    }\n\n    GResult ret = (close(m_fd) != -1 ? G_YES : G_NO);\n    \n    m_fd = -1;\n    m_path[0] = 0;\n    m_flags = 0;\n\n    return ret;\n}\n\nGInt64 GFile::getFileSize()\n{\n    if (m_fd <= 0)\n    {\n        setError(\"file don't open\");\n        return G_NO;\n    }    \n\n    return (GInt64)(m_fileStat.st_size);\n}\n\nGInt64 GFile::setSeek(const GUint64 offset, const SeekFlags& flags)\n{\n    if (m_fd <= 0)\n    {\n        setError(\"file don't open\");\n        return G_NO;\n    }  \n\n    GInt32 sysFlags = -1;\n    \n    switch(flags)\n    {\n    case G_SEEK_BEG:\n        sysFlags = SEEK_SET;\n        break;\n    case G_SEEK_CUR:\n        sysFlags = SEEK_CUR;\n        break;\n    case G_SEEK_END:\n        sysFlags = SEEK_END;\n        break;\n    default:\n        return G_NO;\n        break;\n    }\n    \n    return lseek(m_fd, offset, sysFlags);\n}\n\nGInt64 GFile::readFile(GInt8* buffer, const GUint64 size)\n{\n    if (buffer == NULL || size <= 0)\n    {\n        setError(\"input parameter is error\");\n        return G_NO;        \n    }\n\n    if (m_fd <= 0)\n    {\n        setError(\"file don't open\");\n        return G_NO;\n    }\n    \n    return read(m_fd, buffer, size);\n}\n\nGInt64 GFile::writeFile(const GInt8* data, const GUint64 length)\n{\n    if (data == NULL || length <= 0)\n    {\n        setError(\"input parameter is error\");\n        return G_NO;        \n    }\n\n    if (m_fd <= 0)\n    {\n        setError(\"file don't open\");\n        return G_NO;\n    }\n    \n    return write(m_fd, data, length);\n}\n\nGResult GFile::getLastError(GInt8* error, const GUint32 size)\n{\n    GUint32 len = (size <= strlen(m_error) ? size - 1 : strlen(m_error));\n    memcpy(error, m_error, len); \n    error[len] = 0;\n    return G_YES;\n}\n\nGResult GFile::orgOpen(const GInt32 flags, const GUint32 mode)\n{    \n    if (m_fd > 0)\n    {\n        setError(\"file had opened\");\n        return G_NO;\n    }\n\n    if (m_pathLen == 0)\n    {\n        setError(\"hasn't set file path\");\n        return G_NO;   \n    }\n    \n    m_fd = open(m_path, flags, mode);\n    if (m_fd > 0)\n    {\n        m_flags = flags;\n        fstat(m_fd, &m_fileStat);\n    }\n    else\n    {\n        setError(\"open file failed, check whether exist this file path\");\n    }\n\n    return (m_fd != -1 ? true : false);\n}\n\nvoid GFile::setError(const GInt8* args, ...)\n{\n\tGSys::gvsnprintf(m_error, G_ERROR_BUF_SIZE, args);\n}\n<commit_msg>Update g_file.cpp<commit_after>\/************************************************************************************\n**  \n* @copyright (c) 2013-2100, ChengDu Duyer Technology Co., LTD. All Right Reserved.\n*\n*************************************************************************************\/\n\/**\n* @GFile\t\tg_file.cpp\n* @version     \n* @brief      \n* @author   duye\n* @date     2013-06-20\n* @note \n*\n*  1. 2013-06-20 duye Created this GFile\n* \n*\/\n#include <stdarg.h>\n#include <fcntl.h>\n#include <unistd.h>\n#include <string.h>\n#include <g_file.h>\n\n\/\/ default create GFile permissions\nstatic const GUint32 G_CREATE_MODE = 0x775;\n\nGResult GFileUtil::createFile(const GInt8* filePath)\n{\n    GInt32 fd = creat(filePath, G_CREATE_MODE);\n    if (fd != -1)\n    {\n        close(fd);\n        return G_YES;\n    }\n    \n    return G_NO;\n}\n\nGResult GFileUtil::createFile(const GInt8* filePath, const GUint64& initSize)\n{\n    return G_NO;\n}\n\nGFile::GFile() : m_fd(-1), m_flags(0), m_pathLen(0)\n{\n    m_error[0] = 0;\n    m_path[0] = 0;\n}\n\nGFile::GFile(const GInt8* filePath) : m_fd(-1), m_flags(0), m_pathLen(0)\n{\n    GUint32 len = strlen(filePath);\n    if (len < G_PATH_MAX)\n    {\n        memcpy(m_path, filePath, len);\n        m_path[len] = 0;\n        m_pathLen = len;\n    }\n\n    m_error[0] = 0;\n}\n\nGFile::~GFile() \n{\n    closeFile();\n}\n\nGResult GFile::setPath(const GInt8* filePath)\n{\n    if (m_pathLen > 0)\n    {   \n        setError(\"file path has exist\");\n        return G_NO;\n    }\n    \n    GUint32 len = strlen(filePath);\n    if (len < G_PATH_MAX)\n    {\n        memcpy(m_path, filePath, len);\n        m_path[len] = 0;\n        m_pathLen = len;\n    }    \n    else\n    {\n        setError(\"file path too long\");\n        return G_NO;   \n    }\n\n    return G_YES;\n}\n\nGResult GFile::open(const GUint64 flags)\n{\n    GInt32 openFlags = 0;\n    if (flags | G_OPEN_READ)\n    {\n        openFlags = O_RDONLY;\n    }\n    else if (flags | G_OPEN_WRITE)\n    {\n        openFlags = O_WRONLY | O_CREAT;\n    }\n    else if (flags | G_OPEN_RDWR)\n    {\n        openFlags = O_RDWR | O_CREAT;        \n    }\n    else if (flags | G_OPEN_APPEND)\n    {\n        if (openFlags == 0)\n        {\n            return G_NO;\n        }\n\n        openFlags |= O_APPEND;\n    }\n\n    if (openFlags == 0)\n    {\n        setError(\"input open mode error\");\n        return G_NO;\n    }\n    \n    return orgOpen(openFlags, G_CREATE_MODE);          \n}\n\nGResult GFile::close()\n{\n    if (m_fd < 0)\n    {\n        setError(\"file don't open\");\n        return G_NO;\n    }\n\n    GResult ret = (::close(m_fd) != -1 ? G_YES : G_NO);\n    \n    m_fd = -1;\n    m_path[0] = 0;\n    m_flags = 0;\n\n    return ret;\n}\n\nGInt64 GFile::getSize()\n{\n    if (m_fd <= 0)\n    {\n        setError(\"file don't open\");\n        return G_NO;\n    }    \n\n    return (GInt64)(m_fileStat.st_size);\n}\n\nGInt64 GFile::setSeek(const GUint64 offset, const SeekFlags& flags)\n{\n    if (m_fd <= 0)\n    {\n        setError(\"file don't open\");\n        return G_NO;\n    }  \n\n    GInt32 sysFlags = -1;\n    \n    switch(flags)\n    {\n    case G_SEEK_BEG:\n        sysFlags = SEEK_SET;\n        break;\n    case G_SEEK_CUR:\n        sysFlags = SEEK_CUR;\n        break;\n    case G_SEEK_END:\n        sysFlags = SEEK_END;\n        break;\n    default:\n        return G_NO;\n        break;\n    }\n    \n    return lseek(m_fd, offset, sysFlags);\n}\n\nGInt64 GFile::read(GInt8* buffer, const GUint64 size)\n{\n    if (buffer == NULL || size <= 0)\n    {\n        setError(\"input parameter is error\");\n        return G_NO;        \n    }\n\n    if (m_fd <= 0)\n    {\n        setError(\"file don't open\");\n        return G_NO;\n    }\n    \n    return read(m_fd, buffer, size);\n}\n\nGInt64 GFile::writeFile(const GInt8* data, const GUint64 length)\n{\n    if (data == NULL || length <= 0)\n    {\n        setError(\"input parameter is error\");\n        return G_NO;        \n    }\n\n    if (m_fd <= 0)\n    {\n        setError(\"file don't open\");\n        return G_NO;\n    }\n    \n    return write(m_fd, data, length);\n}\n\nGResult GFile::getError(GInt8* error, const GUint32 size)\n{\n    GUint32 len = (size <= strlen(m_error) ? size - 1 : strlen(m_error));\n    memcpy(error, m_error, len); \n    error[len] = 0;\n    return G_YES;\n}\n\nGResult GFile::orgOpen(const GInt32 flags, const GUint32 mode)\n{    \n    if (m_fd > 0)\n    {\n        setError(\"file had opened\");\n        return G_NO;\n    }\n\n    if (m_pathLen == 0)\n    {\n        setError(\"hasn't set file path\");\n        return G_NO;   \n    }\n    \n    m_fd = open(m_path, flags, mode);\n    if (m_fd > 0)\n    {\n        m_flags = flags;\n        fstat(m_fd, &m_fileStat);\n    }\n    else\n    {\n        setError(\"open file failed, check whether exist this file path\");\n    }\n\n    return (m_fd != -1 ? true : false);\n}\n\nvoid GFile::setError(const GInt8* args, ...)\n{\n\tGSys::gvsnprintf(m_error, G_ERROR_BUF_SIZE, args);\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 \"jscommandexecutor.h\"\n\n#include \"artifact.h\"\n#include \"buildgraph.h\"\n#include \"rulecommands.h\"\n#include \"transformer.h\"\n\n#include <language\/language.h>\n#include <language\/preparescriptobserver.h>\n#include <language\/scriptengine.h>\n#include <logging\/logger.h>\n#include <tools\/codelocation.h>\n#include <tools\/error.h>\n#include <tools\/qbsassert.h>\n\n#include <QtCore\/qeventloop.h>\n#include <QtCore\/qthread.h>\n#include <QtCore\/qtimer.h>\n\nnamespace qbs {\nnamespace Internal {\n\nstruct JavaScriptCommandResult\n{\n    bool success;\n    QString errorMessage;\n    CodeLocation errorLocation;\n};\n\nclass JsCommandExecutorThreadObject : public QObject\n{\n    Q_OBJECT\npublic:\n    JsCommandExecutorThreadObject(const Logger &logger)\n        : m_logger(logger)\n        , m_scriptEngine(0)\n    {\n    }\n\n    const JavaScriptCommandResult &result() const\n    {\n        return m_result;\n    }\n\n    void cancel()\n    {\n        QBS_ASSERT(m_scriptEngine, return);\n        m_scriptEngine->abortEvaluation();\n    }\n\nsignals:\n    void finished();\n\npublic:\n    void start(const JavaScriptCommand *cmd, Transformer *transformer)\n    {\n        try {\n            doStart(cmd, transformer);\n        } catch (const qbs::ErrorInfo &error) {\n            setError(error.toString(), cmd->codeLocation());\n        }\n\n        emit finished();\n    }\n\nprivate:\n    void doStart(const JavaScriptCommand *cmd, Transformer *transformer)\n    {\n        m_result.success = true;\n        m_result.errorMessage.clear();\n        ScriptEngine * const scriptEngine = provideScriptEngine();\n        QScriptValue scope = scriptEngine->newObject();\n        scope.setPrototype(scriptEngine->globalObject());\n        PrepareScriptObserver observer(scriptEngine);\n        setupScriptEngineForFile(scriptEngine, transformer->rule->prepareScript->fileContext, scope);\n\n        QScriptValue importScopeForSourceCode;\n        if (!cmd->scopeName().isEmpty())\n            importScopeForSourceCode = scope.property(cmd->scopeName());\n\n        setupScriptEngineForProduct(scriptEngine, transformer->product(), transformer->rule->module, scope,\n                                    &observer);\n        transformer->setupInputs(scope);\n        transformer->setupOutputs(scope);\n        transformer->setupExplicitlyDependsOn(scope);\n\n        for (QVariantMap::const_iterator it = cmd->properties().constBegin();\n                it != cmd->properties().constEnd(); ++it) {\n            scope.setProperty(it.key(), scriptEngine->toScriptValue(it.value()));\n        }\n\n        scriptEngine->setGlobalObject(scope);\n        if (importScopeForSourceCode.isObject())\n            scriptEngine->currentContext()->pushScope(importScopeForSourceCode);\n        scriptEngine->evaluate(cmd->sourceCode());\n        if (importScopeForSourceCode.isObject())\n            scriptEngine->currentContext()->popScope();\n        scriptEngine->setGlobalObject(scope.prototype());\n        transformer->propertiesRequestedInCommands\n                += scriptEngine->propertiesRequestedInScript();\n        transformer->propertiesRequestedFromArtifactInCommands\n                = scriptEngine->propertiesRequestedFromArtifact();\n        scriptEngine->clearRequestedProperties();\n        if (scriptEngine->hasUncaughtException()) {\n            \/\/ ### We don't know the line number of the command's sourceCode property assignment.\n            setError(scriptEngine->uncaughtException().toString(), cmd->codeLocation());\n        }\n    }\n\n    void setError(const QString &errorMessage, const CodeLocation &codeLocation)\n    {\n        m_result.success = false;\n        m_result.errorMessage = errorMessage;\n        m_result.errorLocation = codeLocation;\n    }\n\n    ScriptEngine *provideScriptEngine()\n    {\n        if (!m_scriptEngine)\n            m_scriptEngine = new ScriptEngine(m_logger, EvalContext::JsCommand, this);\n        return m_scriptEngine;\n    }\n\n    Logger m_logger;\n    ScriptEngine *m_scriptEngine;\n    JavaScriptCommandResult m_result;\n};\n\n\nJsCommandExecutor::JsCommandExecutor(const Logger &logger, QObject *parent)\n    : AbstractCommandExecutor(logger, parent)\n    , m_thread(new QThread(this))\n    , m_objectInThread(new JsCommandExecutorThreadObject(logger))\n    , m_running(false)\n{\n    m_objectInThread->moveToThread(m_thread);\n    connect(m_objectInThread, &JsCommandExecutorThreadObject::finished,\n            this, &JsCommandExecutor::onJavaScriptCommandFinished);\n    connect(this, &JsCommandExecutor::startRequested,\n            m_objectInThread, &JsCommandExecutorThreadObject::start);\n}\n\nJsCommandExecutor::~JsCommandExecutor()\n{\n    waitForFinished();\n    delete m_objectInThread;\n    m_thread->quit();\n    m_thread->wait();\n}\n\nvoid JsCommandExecutor::doReportCommandDescription()\n{\n    if ((m_echoMode == CommandEchoModeCommandLine\n         || m_echoMode == CommandEchoModeCommandLineWithEnvironment)\n            && !command()->extendedDescription().isEmpty()) {\n        emit reportCommandDescription(command()->highlight(), command()->extendedDescription());\n        return;\n    }\n\n    AbstractCommandExecutor::doReportCommandDescription();\n}\n\nvoid JsCommandExecutor::waitForFinished()\n{\n    if (!m_running)\n        return;\n    QEventLoop loop;\n    connect(m_objectInThread, &JsCommandExecutorThreadObject::finished, &loop, &QEventLoop::quit);\n    loop.exec();\n}\n\nvoid JsCommandExecutor::doStart()\n{\n    QBS_ASSERT(!m_running, return);\n    m_thread->start();\n\n    if (dryRun() && !command()->ignoreDryRun()) {\n        QTimer::singleShot(0, this, [this] { emit finished(); }); \/\/ Don't call back on the caller.\n        return;\n    }\n\n    m_running = true;\n    emit startRequested(jsCommand(), transformer());\n}\n\nvoid JsCommandExecutor::cancel()\n{\n    if (!dryRun())\n        QTimer::singleShot(0, m_objectInThread, [this] { m_objectInThread->cancel(); });\n}\n\nvoid JsCommandExecutor::onJavaScriptCommandFinished()\n{\n    m_running = false;\n    const JavaScriptCommandResult &result = m_objectInThread->result();\n    ErrorInfo err;\n    if (!result.success) {\n        logger().qbsDebug() << \"JS context:\\n\" << jsCommand()->properties();\n        logger().qbsDebug() << \"JS code:\\n\" << jsCommand()->sourceCode();\n        err.append(result.errorMessage);\n        \/\/ ### We don't know the line number of the command's sourceCode property assignment.\n        err.appendBacktrace(QStringLiteral(\"JavaScriptCommand.sourceCode\"));\n        err.appendBacktrace(QStringLiteral(\"Rule.prepare\"), result.errorLocation);\n    }\n    emit finished(err);\n}\n\nconst JavaScriptCommand *JsCommandExecutor::jsCommand() const\n{\n    return static_cast<const JavaScriptCommand *>(command());\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace qbs\n\n#include \"jscommandexecutor.moc\"\n<commit_msg>JsCommandExecutor: Try harder not to cancel non-running commands<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 \"jscommandexecutor.h\"\n\n#include \"artifact.h\"\n#include \"buildgraph.h\"\n#include \"rulecommands.h\"\n#include \"transformer.h\"\n\n#include <language\/language.h>\n#include <language\/preparescriptobserver.h>\n#include <language\/scriptengine.h>\n#include <logging\/logger.h>\n#include <tools\/codelocation.h>\n#include <tools\/error.h>\n#include <tools\/qbsassert.h>\n\n#include <QtCore\/qeventloop.h>\n#include <QtCore\/qthread.h>\n#include <QtCore\/qtimer.h>\n\nnamespace qbs {\nnamespace Internal {\n\nstruct JavaScriptCommandResult\n{\n    bool success;\n    QString errorMessage;\n    CodeLocation errorLocation;\n};\n\nclass JsCommandExecutorThreadObject : public QObject\n{\n    Q_OBJECT\npublic:\n    JsCommandExecutorThreadObject(const Logger &logger)\n        : m_logger(logger)\n        , m_scriptEngine(0)\n    {\n    }\n\n    const JavaScriptCommandResult &result() const\n    {\n        return m_result;\n    }\n\n    void cancel()\n    {\n        QBS_ASSERT(m_scriptEngine, return);\n        m_scriptEngine->abortEvaluation();\n    }\n\nsignals:\n    void finished();\n\npublic:\n    void start(const JavaScriptCommand *cmd, Transformer *transformer)\n    {\n        m_running = true;\n        try {\n            doStart(cmd, transformer);\n        } catch (const qbs::ErrorInfo &error) {\n            setError(error.toString(), cmd->codeLocation());\n        }\n\n        m_running = false;\n        emit finished();\n    }\n\nprivate:\n    void doStart(const JavaScriptCommand *cmd, Transformer *transformer)\n    {\n        m_result.success = true;\n        m_result.errorMessage.clear();\n        ScriptEngine * const scriptEngine = provideScriptEngine();\n        QScriptValue scope = scriptEngine->newObject();\n        scope.setPrototype(scriptEngine->globalObject());\n        PrepareScriptObserver observer(scriptEngine);\n        setupScriptEngineForFile(scriptEngine, transformer->rule->prepareScript->fileContext, scope);\n\n        QScriptValue importScopeForSourceCode;\n        if (!cmd->scopeName().isEmpty())\n            importScopeForSourceCode = scope.property(cmd->scopeName());\n\n        setupScriptEngineForProduct(scriptEngine, transformer->product(), transformer->rule->module, scope,\n                                    &observer);\n        transformer->setupInputs(scope);\n        transformer->setupOutputs(scope);\n        transformer->setupExplicitlyDependsOn(scope);\n\n        for (QVariantMap::const_iterator it = cmd->properties().constBegin();\n                it != cmd->properties().constEnd(); ++it) {\n            scope.setProperty(it.key(), scriptEngine->toScriptValue(it.value()));\n        }\n\n        scriptEngine->setGlobalObject(scope);\n        if (importScopeForSourceCode.isObject())\n            scriptEngine->currentContext()->pushScope(importScopeForSourceCode);\n        scriptEngine->evaluate(cmd->sourceCode());\n        if (importScopeForSourceCode.isObject())\n            scriptEngine->currentContext()->popScope();\n        scriptEngine->setGlobalObject(scope.prototype());\n        transformer->propertiesRequestedInCommands\n                += scriptEngine->propertiesRequestedInScript();\n        transformer->propertiesRequestedFromArtifactInCommands\n                = scriptEngine->propertiesRequestedFromArtifact();\n        scriptEngine->clearRequestedProperties();\n        if (scriptEngine->hasUncaughtException()) {\n            \/\/ ### We don't know the line number of the command's sourceCode property assignment.\n            setError(scriptEngine->uncaughtException().toString(), cmd->codeLocation());\n        }\n    }\n\n    void setError(const QString &errorMessage, const CodeLocation &codeLocation)\n    {\n        m_result.success = false;\n        m_result.errorMessage = errorMessage;\n        m_result.errorLocation = codeLocation;\n    }\n\n    ScriptEngine *provideScriptEngine()\n    {\n        if (!m_scriptEngine)\n            m_scriptEngine = new ScriptEngine(m_logger, EvalContext::JsCommand, this);\n        return m_scriptEngine;\n    }\n\n    Logger m_logger;\n    ScriptEngine *m_scriptEngine;\n    JavaScriptCommandResult m_result;\n    bool m_running = false;\n};\n\n\nJsCommandExecutor::JsCommandExecutor(const Logger &logger, QObject *parent)\n    : AbstractCommandExecutor(logger, parent)\n    , m_thread(new QThread(this))\n    , m_objectInThread(new JsCommandExecutorThreadObject(logger))\n    , m_running(false)\n{\n    m_objectInThread->moveToThread(m_thread);\n    connect(m_objectInThread, &JsCommandExecutorThreadObject::finished,\n            this, &JsCommandExecutor::onJavaScriptCommandFinished);\n    connect(this, &JsCommandExecutor::startRequested,\n            m_objectInThread, &JsCommandExecutorThreadObject::start);\n}\n\nJsCommandExecutor::~JsCommandExecutor()\n{\n    waitForFinished();\n    delete m_objectInThread;\n    m_thread->quit();\n    m_thread->wait();\n}\n\nvoid JsCommandExecutor::doReportCommandDescription()\n{\n    if ((m_echoMode == CommandEchoModeCommandLine\n         || m_echoMode == CommandEchoModeCommandLineWithEnvironment)\n            && !command()->extendedDescription().isEmpty()) {\n        emit reportCommandDescription(command()->highlight(), command()->extendedDescription());\n        return;\n    }\n\n    AbstractCommandExecutor::doReportCommandDescription();\n}\n\nvoid JsCommandExecutor::waitForFinished()\n{\n    if (!m_running)\n        return;\n    QEventLoop loop;\n    connect(m_objectInThread, &JsCommandExecutorThreadObject::finished, &loop, &QEventLoop::quit);\n    loop.exec();\n}\n\nvoid JsCommandExecutor::doStart()\n{\n    QBS_ASSERT(!m_running, return);\n    m_thread->start();\n\n    if (dryRun() && !command()->ignoreDryRun()) {\n        QTimer::singleShot(0, this, [this] { emit finished(); }); \/\/ Don't call back on the caller.\n        return;\n    }\n\n    m_running = true;\n    emit startRequested(jsCommand(), transformer());\n}\n\nvoid JsCommandExecutor::cancel()\n{\n    if (m_running && !dryRun())\n        QTimer::singleShot(0, m_objectInThread, [this] { m_objectInThread->cancel(); });\n}\n\nvoid JsCommandExecutor::onJavaScriptCommandFinished()\n{\n    m_running = false;\n    const JavaScriptCommandResult &result = m_objectInThread->result();\n    ErrorInfo err;\n    if (!result.success) {\n        logger().qbsDebug() << \"JS context:\\n\" << jsCommand()->properties();\n        logger().qbsDebug() << \"JS code:\\n\" << jsCommand()->sourceCode();\n        err.append(result.errorMessage);\n        \/\/ ### We don't know the line number of the command's sourceCode property assignment.\n        err.appendBacktrace(QStringLiteral(\"JavaScriptCommand.sourceCode\"));\n        err.appendBacktrace(QStringLiteral(\"Rule.prepare\"), result.errorLocation);\n    }\n    emit finished(err);\n}\n\nconst JavaScriptCommand *JsCommandExecutor::jsCommand() const\n{\n    return static_cast<const JavaScriptCommand *>(command());\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace qbs\n\n#include \"jscommandexecutor.moc\"\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (C) 2016 Elviss Strazdins\n\/\/ This file is part of the Ouzel engine.\n\n#include <algorithm>\n#include \"Engine.h\"\n#include \"CompileConfig.h\"\n#include \"Window.h\"\n#include \"utils\/Log.h\"\n#include \"graphics\/Renderer.h\"\n#include \"audio\/Audio.h\"\n\n#if OUZEL_PLATFORM_MACOS\n#include \"macos\/WindowMacOS.h\"\n#include \"graphics\/macos\/RendererOGLMacOS.h\"\n#elif OUZEL_PLATFORM_IOS\n#include \"ios\/WindowIOS.h\"\n#include \"graphics\/ios\/RendererOGLIOS.h\"\n#elif OUZEL_PLATFORM_TVOS\n#include \"tvos\/WindowTVOS.h\"\n#include \"graphics\/tvos\/RendererOGLTVOS.h\"\n#elif OUZEL_PLATFORM_ANDROID\n#include \"android\/WindowAndroid.h\"\n#include \"graphics\/android\/RendererOGLAndroid.h\"\n#include \"input\/android\/InputAndroid.h\"\n#elif OUZEL_PLATFORM_LINUX\n#include \"linux\/WindowLinux.h\"\n#include \"graphics\/linux\/RendererOGLLinux.h\"\n#include \"input\/linux\/InputLinux.h\"\n#elif OUZEL_PLATFORM_WINDOWS\n#include \"windows\/WindowWin.h\"\n#elif OUZEL_PLATFORM_RASPBIAN\n#include \"raspbian\/WindowRasp.h\"\n#include \"graphics\/raspbian\/RendererOGLRasp.h\"\n#include \"input\/raspbian\/InputRasp.h\"\n#elif OUZEL_PLATFORM_EMSCRIPTEN\n#include \"emscripten\/WindowEm.h\"\n#include \"graphics\/emscripten\/RendererOGLEm.h\"\n#include \"input\/emscripten\/InputEm.h\"\n#endif\n\n#include \"graphics\/empty\/RendererEmpty.h\"\n\n#if OUZEL_SUPPORTS_OPENGL || OUZEL_SUPPORTS_OPENGLES\n#include \"graphics\/opengl\/RendererOGL.h\"\n#endif\n\n#if OUZEL_SUPPORTS_DIRECT3D11\n#include \"graphics\/direct3d11\/RendererD3D11.h\"\n#endif\n\n#if OUZEL_SUPPORTS_METAL\n#include \"graphics\/metal\/RendererMetal.h\"\n#endif\n\n#include \"audio\/empty\/AudioEmpty.h\"\n\n#if OUZEL_SUPPORTS_OPENAL\n#include \"audio\/openal\/AudioAL.h\"\n#endif\n\n#if OUZEL_SUPPORTS_XAUDIO2\n#include \"audio\/xaudio2\/AudioXA2.h\"\n#endif\n\n#if OUZEL_SUPPORTS_OPENSL\n#include \"audio\/opensl\/AudioSL.h\"\n#endif\n\n#if OUZEL_PLATFORM_MACOS || OUZEL_PLATFORM_IOS || OUZEL_PLATFORM_TVOS\n#include \"audio\/apple\/AudioALApple.h\"\n#include \"input\/apple\/InputApple.h\"\n#elif OUZEL_PLATFORM_WINDOWS\n#include \"input\/windows\/InputWin.h\"\n#endif\n\n#ifdef OPENAL\n#undef OPENAL\n#endif\n\nnamespace ouzel\n{\n    ouzel::Engine* sharedEngine = nullptr;\n\n    Engine::Engine():\n        currentFPS(0.0f), accumulatedFPS(0.0f), running(false), active(false)\n    {\n        sharedEngine = this;\n    }\n\n    Engine::~Engine()\n    {\n        running = false;\n        active = false;\n\n#if OUZEL_MULTITHREADED\n        if (updateThread.joinable()) updateThread.join();\n#endif\n    }\n\n    std::set<graphics::Renderer::Driver> Engine::getAvailableRenderDrivers()\n    {\n        static std::set<graphics::Renderer::Driver> availableDrivers;\n\n        if (availableDrivers.empty())\n        {\n            availableDrivers.insert(graphics::Renderer::Driver::EMPTY);\n\n#if OUZEL_SUPPORTS_OPENGL || OUZEL_SUPPORTS_OPENGLES\n            availableDrivers.insert(graphics::Renderer::Driver::OPENGL);\n#endif\n\n#if OUZEL_SUPPORTS_DIRECT3D11\n            availableDrivers.insert(graphics::Renderer::Driver::DIRECT3D11);\n#endif\n\n#if OUZEL_SUPPORTS_METAL\n            if (graphics::RendererMetal::available())\n            {\n                availableDrivers.insert(graphics::Renderer::Driver::METAL);\n            }\n#endif\n        }\n\n        return availableDrivers;\n    }\n\n    std::set<audio::Audio::Driver> Engine::getAvailableAudioDrivers()\n    {\n        static std::set<audio::Audio::Driver> availableDrivers;\n\n        if (availableDrivers.empty())\n        {\n            availableDrivers.insert(audio::Audio::Driver::EMPTY);\n\n#if OUZEL_SUPPORTS_OPENAL\n            availableDrivers.insert(audio::Audio::Driver::OPENAL);\n#endif\n\n#if OUZEL_SUPPORTS_XAUDIO2\n            availableDrivers.insert(audio::Audio::Driver::XAUDIO2);\n#endif\n\n#if OUZEL_SUPPORTS_OPENSL\n            availableDrivers.insert(audio::Audio::Driver::OPENSL);\n#endif\n        }\n\n        return availableDrivers;\n    }\n\n    bool Engine::init(Settings& newSettings)\n    {\n        settings = newSettings;\n\n        if (settings.renderDriver == graphics::Renderer::Driver::DEFAULT)\n        {\n            auto availableDrivers = getAvailableRenderDrivers();\n\n            if (availableDrivers.find(graphics::Renderer::Driver::METAL) != availableDrivers.end())\n            {\n                settings.renderDriver = graphics::Renderer::Driver::METAL;\n            }\n            else if (availableDrivers.find(graphics::Renderer::Driver::DIRECT3D11) != availableDrivers.end())\n            {\n                settings.renderDriver = graphics::Renderer::Driver::DIRECT3D11;\n            }\n            else if (availableDrivers.find(graphics::Renderer::Driver::OPENGL) != availableDrivers.end())\n            {\n                settings.renderDriver = graphics::Renderer::Driver::OPENGL;\n            }\n            else\n            {\n                settings.renderDriver = graphics::Renderer::Driver::EMPTY;\n            }\n        }\n\n#if OUZEL_PLATFORM_MACOS\n        window.reset(new WindowMacOS(settings.size, settings.resizable, settings.fullscreen, settings.title));\n#elif OUZEL_PLATFORM_IOS\n        window.reset(new WindowIOS(settings.size, settings.resizable, settings.fullscreen, settings.title));\n#elif OUZEL_PLATFORM_TVOS\n        window.reset(new WindowTVOS(settings.size, settings.resizable, settings.fullscreen, settings.title));\n#elif OUZEL_PLATFORM_ANDROID\n        window.reset(new WindowAndroid(settings.size, settings.resizable, settings.fullscreen, settings.title));\n#elif OUZEL_PLATFORM_LINUX\n        window.reset(new WindowLinux(settings.size, settings.resizable, settings.fullscreen, settings.title));\n#elif OUZEL_PLATFORM_WINDOWS\n        window.reset(new WindowWin(settings.size, settings.resizable, settings.fullscreen, settings.title));\n#elif OUZEL_PLATFORM_RASPBIAN\n        window.reset(new WindowRasp(settings.size, settings.resizable, settings.fullscreen, settings.title));\n#elif OUZEL_PLATFORM_EMSCRIPTEN\n        window.reset(new WindowEm(settings.size, settings.resizable, settings.fullscreen, settings.title));\n#else\n        window.reset(new Window(settings.size, settings.resizable, settings.fullscreen, settings.title));\n#endif\n\n        switch (settings.renderDriver)\n        {\n            case graphics::Renderer::Driver::EMPTY:\n                Log(Log::Level::INFO) << \"Not using render driver\";\n                renderer.reset(new graphics::RendererEmpty());\n                break;\n#if OUZEL_SUPPORTS_OPENGL || OUZEL_SUPPORTS_OPENGLES\n            case graphics::Renderer::Driver::OPENGL:\n                Log(Log::Level::INFO) << \"Using OpenGL render driver\";\n    #if OUZEL_PLATFORM_MACOS\n                renderer.reset(new graphics::RendererOGLMacOS());\n    #elif OUZEL_PLATFORM_IOS\n                renderer.reset(new graphics::RendererOGLIOS());\n    #elif OUZEL_PLATFORM_TVOS\n                renderer.reset(new graphics::RendererOGLTVOS());\n    #elif OUZEL_PLATFORM_ANDROID\n                renderer.reset(new graphics::RendererOGLAndroid());\n    #elif OUZEL_PLATFORM_LINUX\n                renderer.reset(new graphics::RendererOGLLinux());\n    #elif OUZEL_PLATFORM_RASPBIAN\n                renderer.reset(new graphics::RendererOGLRasp());\n    #elif OUZEL_PLATFORM_EMSCRIPTEN\n                renderer.reset(new graphics::RendererOGLEm());\n    #else\n                renderer.reset(new graphics::RendererOGL());\n    #endif\n                break;\n#endif\n#if OUZEL_SUPPORTS_DIRECT3D11\n            case graphics::Renderer::Driver::DIRECT3D11:\n                Log(Log::Level::INFO) << \"Using Direct3D 11 render driver\";\n                renderer.reset(new graphics::RendererD3D11());\n                break;\n#endif\n#if OUZEL_SUPPORTS_METAL\n            case graphics::Renderer::Driver::METAL:\n                Log(Log::Level::INFO) << \"Using Metal render driver\";\n                renderer.reset(new graphics::RendererMetal());\n                break;\n#endif\n            default:\n                Log(Log::Level::ERR) << \"Unsupported render driver\";\n                return false;\n        }\n\n        if (!window->init())\n        {\n            return false;\n        }\n\n        if (!renderer->init(window.get(),\n                            window->getSize() * window->getContentScale(),\n                            settings.sampleCount,\n                            settings.textureFilter,\n                            settings.backBufferFormat,\n                            settings.verticalSync,\n                            settings.depthBits))\n        {\n            return false;\n        }\n\n        if (settings.audioDriver == audio::Audio::Driver::DEFAULT)\n        {\n            auto availableDrivers = getAvailableAudioDrivers();\n\n            if (availableDrivers.find(audio::Audio::Driver::OPENAL) != availableDrivers.end())\n            {\n                settings.audioDriver = audio::Audio::Driver::OPENAL;\n            }\n            else if (availableDrivers.find(audio::Audio::Driver::XAUDIO2) != availableDrivers.end())\n            {\n                settings.audioDriver = audio::Audio::Driver::XAUDIO2;\n            }\n            else if (availableDrivers.find(audio::Audio::Driver::OPENSL) != availableDrivers.end())\n            {\n                settings.audioDriver = audio::Audio::Driver::OPENSL;\n            }\n            else\n            {\n                settings.audioDriver = audio::Audio::Driver::EMPTY;\n            }\n        }\n\n        switch (settings.audioDriver)\n        {\n            case audio::Audio::Driver::EMPTY:\n                Log(Log::Level::INFO) << \"Not using audio driver\";\n                audio.reset(new audio::AudioEmpty());\n                break;\n#if OUZEL_SUPPORTS_OPENAL\n            case audio::Audio::Driver::OPENAL:\n                Log(Log::Level::INFO) << \"Using OpenAL audio driver\";\n    #if OUZEL_PLATFORM_MACOS || OUZEL_PLATFORM_IOS || OUZEL_PLATFORM_TVOS\n                audio.reset(new audio::AudioALApple());\n    #else\n                audio.reset(new audio::AudioAL());\n    #endif\n                break;\n#endif\n#if OUZEL_SUPPORTS_XAUDIO2\n            case audio::Audio::Driver::XAUDIO2:\n                Log(Log::Level::INFO) << \"Using XAudio 2 audio driver\";\n                audio.reset(new audio::AudioXA2());\n                break;\n#endif\n#if OUZEL_SUPPORTS_OPENSL\n            case audio::Audio::Driver::OPENSL:\n                Log(Log::Level::INFO) << \"Using OpenSL ES audio driver\";\n                audio.reset(new audio::AudioSL());\n                break;\n#endif\n            default:\n                Log(Log::Level::ERR) << \"Unsupported audio driver\";\n                return false;\n        }\n\n        if (!audio->init())\n        {\n            return false;\n        }\n\n#if OUZEL_PLATFORM_MACOS || OUZEL_PLATFORM_IOS || OUZEL_PLATFORM_TVOS\n        input.reset(new input::InputApple());\n#elif OUZEL_PLATFORM_ANDROID\n        input.reset(new input::InputAndroid());\n#elif OUZEL_PLATFORM_LINUX\n        input.reset(new input::InputLinux());\n#elif OUZEL_PLATFORM_WINDOWS\n        input.reset(new input::InputWin());\n#elif OUZEL_PLATFORM_RASPBIAN\n        input.reset(new input::InputRasp());\n#elif OUZEL_PLATFORM_EMSCRIPTEN\n        input.reset(new input::InputEm());\n#else\n        input.reset(new input::Input());\n#endif\n\n        active = true;\n\n        return true;\n    }\n\n    void Engine::begin()\n    {\n        previousUpdateTime = previousFrameTime = std::chrono::steady_clock::now();\n        running = true;\n\n#if OUZEL_MULTITHREADED\n        updateThread = std::thread(&Engine::run, this);\n#endif\n    }\n\n    void Engine::end()\n    {\n        running = false;\n        active = false;\n    }\n\n    void Engine::pause()\n    {\n        running = false;\n    }\n\n    void Engine::resume()\n    {\n        previousUpdateTime = previousFrameTime = std::chrono::steady_clock::now();\n        running = true;\n    }\n\n    void Engine::run()\n    {\n#if OUZEL_MULTITHREADED\n        while (active)\n        {\n#endif\n            if (running)\n            {\n                std::chrono::steady_clock::time_point currentTime = std::chrono::steady_clock::now();\n                auto diff = currentTime - previousUpdateTime;\n\n                if (diff > std::chrono::milliseconds(1)) \/\/ at least one millisecond has passed\n                {\n                    previousUpdateTime = currentTime;\n                    float delta = std::chrono::duration_cast<std::chrono::microseconds>(diff).count() \/ 1000000.0f;\n\n                    eventDispatcher.dispatchEvents();\n\n                    if (sharedEngine->getRenderer()->getRefillDrawQueue())\n                    {\n                        sceneManager.draw();\n                        renderer->flushDrawCommands();\n                    }\n\n                    \/\/ erase all null update callbacks from the list\n                    for (auto i = updateCallbacks.begin(); i != updateCallbacks.end();)\n                    {\n                        i = (*i) ? ++i : updateCallbacks.erase(i);\n                    }\n\n                    if (!updateCallbackAddSet.empty())\n                    {\n                        for (const UpdateCallback* updateCallback : updateCallbackAddSet)\n                        {\n                            auto i = std::find(updateCallbacks.begin(), updateCallbacks.end(), updateCallback);\n\n                            if (i == updateCallbacks.end())\n                            {\n                                updateCallbacks.push_back(updateCallback);\n                            }\n                        }\n\n                        std::stable_sort(updateCallbacks.begin(), updateCallbacks.end(), [](const UpdateCallback* a, const UpdateCallback* b) {\n                            return a->priority > b->priority;\n                        });\n                    }\n\n                    for (const UpdateCallback* updateCallback : updateCallbacks)\n                    {\n                        if (updateCallback && updateCallback->callback)\n                        {\n                            updateCallback->callback(delta);\n                        }\n                    }\n                }\n            }\n#if OUZEL_MULTITHREADED\n        }\n#endif\n    }\n\n    bool Engine::draw()\n    {\n#if !OUZEL_MULTITHREADED\n        Engine::run();\n#endif\n\n        std::chrono::steady_clock::time_point currentTime = std::chrono::steady_clock::now();\n        auto diff = std::chrono::duration_cast<std::chrono::nanoseconds>(currentTime - previousFrameTime);\n        previousFrameTime = currentTime;\n\n        float delta = diff.count() \/ 1000000000.0f;\n\n        if (delta > 0.0f)\n        {\n            currentFPS = 1.0f \/ delta;\n        }\n\n        accumulatedTime += delta;\n        currentAccumulatedFPS += 1.0f;\n\n        if (accumulatedTime > 1.0f)\n        {\n            accumulatedFPS = currentAccumulatedFPS;\n            accumulatedTime = 0.0f;\n            currentAccumulatedFPS = 0.0f;\n        }\n\n        if (!renderer->present())\n        {\n            return false;\n        }\n\n        return active;\n    }\n\n    void Engine::scheduleUpdate(const UpdateCallback* callback)\n    {\n        updateCallbackAddSet.insert(callback);\n    }\n\n    void Engine::unscheduleUpdate(const UpdateCallback* callback)\n    {\n        auto vectorIterator = std::find(updateCallbacks.begin(), updateCallbacks.end(), callback);\n\n        if (vectorIterator != updateCallbacks.end())\n        {\n            *vectorIterator = nullptr;\n        }\n\n        auto setIterator = updateCallbackAddSet.find(callback);\n\n        if (setIterator != updateCallbackAddSet.end())\n        {\n            updateCallbackAddSet.erase(setIterator);\n        }\n    }\n}\n<commit_msg>Join the game thread in engine' s end() so that it exits before main()<commit_after>\/\/ Copyright (C) 2016 Elviss Strazdins\n\/\/ This file is part of the Ouzel engine.\n\n#include <algorithm>\n#include \"Engine.h\"\n#include \"CompileConfig.h\"\n#include \"Window.h\"\n#include \"utils\/Log.h\"\n#include \"graphics\/Renderer.h\"\n#include \"audio\/Audio.h\"\n\n#if OUZEL_PLATFORM_MACOS\n#include \"macos\/WindowMacOS.h\"\n#include \"graphics\/macos\/RendererOGLMacOS.h\"\n#elif OUZEL_PLATFORM_IOS\n#include \"ios\/WindowIOS.h\"\n#include \"graphics\/ios\/RendererOGLIOS.h\"\n#elif OUZEL_PLATFORM_TVOS\n#include \"tvos\/WindowTVOS.h\"\n#include \"graphics\/tvos\/RendererOGLTVOS.h\"\n#elif OUZEL_PLATFORM_ANDROID\n#include \"android\/WindowAndroid.h\"\n#include \"graphics\/android\/RendererOGLAndroid.h\"\n#include \"input\/android\/InputAndroid.h\"\n#elif OUZEL_PLATFORM_LINUX\n#include \"linux\/WindowLinux.h\"\n#include \"graphics\/linux\/RendererOGLLinux.h\"\n#include \"input\/linux\/InputLinux.h\"\n#elif OUZEL_PLATFORM_WINDOWS\n#include \"windows\/WindowWin.h\"\n#elif OUZEL_PLATFORM_RASPBIAN\n#include \"raspbian\/WindowRasp.h\"\n#include \"graphics\/raspbian\/RendererOGLRasp.h\"\n#include \"input\/raspbian\/InputRasp.h\"\n#elif OUZEL_PLATFORM_EMSCRIPTEN\n#include \"emscripten\/WindowEm.h\"\n#include \"graphics\/emscripten\/RendererOGLEm.h\"\n#include \"input\/emscripten\/InputEm.h\"\n#endif\n\n#include \"graphics\/empty\/RendererEmpty.h\"\n\n#if OUZEL_SUPPORTS_OPENGL || OUZEL_SUPPORTS_OPENGLES\n#include \"graphics\/opengl\/RendererOGL.h\"\n#endif\n\n#if OUZEL_SUPPORTS_DIRECT3D11\n#include \"graphics\/direct3d11\/RendererD3D11.h\"\n#endif\n\n#if OUZEL_SUPPORTS_METAL\n#include \"graphics\/metal\/RendererMetal.h\"\n#endif\n\n#include \"audio\/empty\/AudioEmpty.h\"\n\n#if OUZEL_SUPPORTS_OPENAL\n#include \"audio\/openal\/AudioAL.h\"\n#endif\n\n#if OUZEL_SUPPORTS_XAUDIO2\n#include \"audio\/xaudio2\/AudioXA2.h\"\n#endif\n\n#if OUZEL_SUPPORTS_OPENSL\n#include \"audio\/opensl\/AudioSL.h\"\n#endif\n\n#if OUZEL_PLATFORM_MACOS || OUZEL_PLATFORM_IOS || OUZEL_PLATFORM_TVOS\n#include \"audio\/apple\/AudioALApple.h\"\n#include \"input\/apple\/InputApple.h\"\n#elif OUZEL_PLATFORM_WINDOWS\n#include \"input\/windows\/InputWin.h\"\n#endif\n\n#ifdef OPENAL\n#undef OPENAL\n#endif\n\nnamespace ouzel\n{\n    ouzel::Engine* sharedEngine = nullptr;\n\n    Engine::Engine():\n        currentFPS(0.0f), accumulatedFPS(0.0f), running(false), active(false)\n    {\n        sharedEngine = this;\n    }\n\n    Engine::~Engine()\n    {\n        running = false;\n        active = false;\n\n#if OUZEL_MULTITHREADED\n        if (updateThread.joinable()) updateThread.join();\n#endif\n    }\n\n    std::set<graphics::Renderer::Driver> Engine::getAvailableRenderDrivers()\n    {\n        static std::set<graphics::Renderer::Driver> availableDrivers;\n\n        if (availableDrivers.empty())\n        {\n            availableDrivers.insert(graphics::Renderer::Driver::EMPTY);\n\n#if OUZEL_SUPPORTS_OPENGL || OUZEL_SUPPORTS_OPENGLES\n            availableDrivers.insert(graphics::Renderer::Driver::OPENGL);\n#endif\n\n#if OUZEL_SUPPORTS_DIRECT3D11\n            availableDrivers.insert(graphics::Renderer::Driver::DIRECT3D11);\n#endif\n\n#if OUZEL_SUPPORTS_METAL\n            if (graphics::RendererMetal::available())\n            {\n                availableDrivers.insert(graphics::Renderer::Driver::METAL);\n            }\n#endif\n        }\n\n        return availableDrivers;\n    }\n\n    std::set<audio::Audio::Driver> Engine::getAvailableAudioDrivers()\n    {\n        static std::set<audio::Audio::Driver> availableDrivers;\n\n        if (availableDrivers.empty())\n        {\n            availableDrivers.insert(audio::Audio::Driver::EMPTY);\n\n#if OUZEL_SUPPORTS_OPENAL\n            availableDrivers.insert(audio::Audio::Driver::OPENAL);\n#endif\n\n#if OUZEL_SUPPORTS_XAUDIO2\n            availableDrivers.insert(audio::Audio::Driver::XAUDIO2);\n#endif\n\n#if OUZEL_SUPPORTS_OPENSL\n            availableDrivers.insert(audio::Audio::Driver::OPENSL);\n#endif\n        }\n\n        return availableDrivers;\n    }\n\n    bool Engine::init(Settings& newSettings)\n    {\n        settings = newSettings;\n\n        if (settings.renderDriver == graphics::Renderer::Driver::DEFAULT)\n        {\n            auto availableDrivers = getAvailableRenderDrivers();\n\n            if (availableDrivers.find(graphics::Renderer::Driver::METAL) != availableDrivers.end())\n            {\n                settings.renderDriver = graphics::Renderer::Driver::METAL;\n            }\n            else if (availableDrivers.find(graphics::Renderer::Driver::DIRECT3D11) != availableDrivers.end())\n            {\n                settings.renderDriver = graphics::Renderer::Driver::DIRECT3D11;\n            }\n            else if (availableDrivers.find(graphics::Renderer::Driver::OPENGL) != availableDrivers.end())\n            {\n                settings.renderDriver = graphics::Renderer::Driver::OPENGL;\n            }\n            else\n            {\n                settings.renderDriver = graphics::Renderer::Driver::EMPTY;\n            }\n        }\n\n#if OUZEL_PLATFORM_MACOS\n        window.reset(new WindowMacOS(settings.size, settings.resizable, settings.fullscreen, settings.title));\n#elif OUZEL_PLATFORM_IOS\n        window.reset(new WindowIOS(settings.size, settings.resizable, settings.fullscreen, settings.title));\n#elif OUZEL_PLATFORM_TVOS\n        window.reset(new WindowTVOS(settings.size, settings.resizable, settings.fullscreen, settings.title));\n#elif OUZEL_PLATFORM_ANDROID\n        window.reset(new WindowAndroid(settings.size, settings.resizable, settings.fullscreen, settings.title));\n#elif OUZEL_PLATFORM_LINUX\n        window.reset(new WindowLinux(settings.size, settings.resizable, settings.fullscreen, settings.title));\n#elif OUZEL_PLATFORM_WINDOWS\n        window.reset(new WindowWin(settings.size, settings.resizable, settings.fullscreen, settings.title));\n#elif OUZEL_PLATFORM_RASPBIAN\n        window.reset(new WindowRasp(settings.size, settings.resizable, settings.fullscreen, settings.title));\n#elif OUZEL_PLATFORM_EMSCRIPTEN\n        window.reset(new WindowEm(settings.size, settings.resizable, settings.fullscreen, settings.title));\n#else\n        window.reset(new Window(settings.size, settings.resizable, settings.fullscreen, settings.title));\n#endif\n\n        switch (settings.renderDriver)\n        {\n            case graphics::Renderer::Driver::EMPTY:\n                Log(Log::Level::INFO) << \"Not using render driver\";\n                renderer.reset(new graphics::RendererEmpty());\n                break;\n#if OUZEL_SUPPORTS_OPENGL || OUZEL_SUPPORTS_OPENGLES\n            case graphics::Renderer::Driver::OPENGL:\n                Log(Log::Level::INFO) << \"Using OpenGL render driver\";\n    #if OUZEL_PLATFORM_MACOS\n                renderer.reset(new graphics::RendererOGLMacOS());\n    #elif OUZEL_PLATFORM_IOS\n                renderer.reset(new graphics::RendererOGLIOS());\n    #elif OUZEL_PLATFORM_TVOS\n                renderer.reset(new graphics::RendererOGLTVOS());\n    #elif OUZEL_PLATFORM_ANDROID\n                renderer.reset(new graphics::RendererOGLAndroid());\n    #elif OUZEL_PLATFORM_LINUX\n                renderer.reset(new graphics::RendererOGLLinux());\n    #elif OUZEL_PLATFORM_RASPBIAN\n                renderer.reset(new graphics::RendererOGLRasp());\n    #elif OUZEL_PLATFORM_EMSCRIPTEN\n                renderer.reset(new graphics::RendererOGLEm());\n    #else\n                renderer.reset(new graphics::RendererOGL());\n    #endif\n                break;\n#endif\n#if OUZEL_SUPPORTS_DIRECT3D11\n            case graphics::Renderer::Driver::DIRECT3D11:\n                Log(Log::Level::INFO) << \"Using Direct3D 11 render driver\";\n                renderer.reset(new graphics::RendererD3D11());\n                break;\n#endif\n#if OUZEL_SUPPORTS_METAL\n            case graphics::Renderer::Driver::METAL:\n                Log(Log::Level::INFO) << \"Using Metal render driver\";\n                renderer.reset(new graphics::RendererMetal());\n                break;\n#endif\n            default:\n                Log(Log::Level::ERR) << \"Unsupported render driver\";\n                return false;\n        }\n\n        if (!window->init())\n        {\n            return false;\n        }\n\n        if (!renderer->init(window.get(),\n                            window->getSize() * window->getContentScale(),\n                            settings.sampleCount,\n                            settings.textureFilter,\n                            settings.backBufferFormat,\n                            settings.verticalSync,\n                            settings.depthBits))\n        {\n            return false;\n        }\n\n        if (settings.audioDriver == audio::Audio::Driver::DEFAULT)\n        {\n            auto availableDrivers = getAvailableAudioDrivers();\n\n            if (availableDrivers.find(audio::Audio::Driver::OPENAL) != availableDrivers.end())\n            {\n                settings.audioDriver = audio::Audio::Driver::OPENAL;\n            }\n            else if (availableDrivers.find(audio::Audio::Driver::XAUDIO2) != availableDrivers.end())\n            {\n                settings.audioDriver = audio::Audio::Driver::XAUDIO2;\n            }\n            else if (availableDrivers.find(audio::Audio::Driver::OPENSL) != availableDrivers.end())\n            {\n                settings.audioDriver = audio::Audio::Driver::OPENSL;\n            }\n            else\n            {\n                settings.audioDriver = audio::Audio::Driver::EMPTY;\n            }\n        }\n\n        switch (settings.audioDriver)\n        {\n            case audio::Audio::Driver::EMPTY:\n                Log(Log::Level::INFO) << \"Not using audio driver\";\n                audio.reset(new audio::AudioEmpty());\n                break;\n#if OUZEL_SUPPORTS_OPENAL\n            case audio::Audio::Driver::OPENAL:\n                Log(Log::Level::INFO) << \"Using OpenAL audio driver\";\n    #if OUZEL_PLATFORM_MACOS || OUZEL_PLATFORM_IOS || OUZEL_PLATFORM_TVOS\n                audio.reset(new audio::AudioALApple());\n    #else\n                audio.reset(new audio::AudioAL());\n    #endif\n                break;\n#endif\n#if OUZEL_SUPPORTS_XAUDIO2\n            case audio::Audio::Driver::XAUDIO2:\n                Log(Log::Level::INFO) << \"Using XAudio 2 audio driver\";\n                audio.reset(new audio::AudioXA2());\n                break;\n#endif\n#if OUZEL_SUPPORTS_OPENSL\n            case audio::Audio::Driver::OPENSL:\n                Log(Log::Level::INFO) << \"Using OpenSL ES audio driver\";\n                audio.reset(new audio::AudioSL());\n                break;\n#endif\n            default:\n                Log(Log::Level::ERR) << \"Unsupported audio driver\";\n                return false;\n        }\n\n        if (!audio->init())\n        {\n            return false;\n        }\n\n#if OUZEL_PLATFORM_MACOS || OUZEL_PLATFORM_IOS || OUZEL_PLATFORM_TVOS\n        input.reset(new input::InputApple());\n#elif OUZEL_PLATFORM_ANDROID\n        input.reset(new input::InputAndroid());\n#elif OUZEL_PLATFORM_LINUX\n        input.reset(new input::InputLinux());\n#elif OUZEL_PLATFORM_WINDOWS\n        input.reset(new input::InputWin());\n#elif OUZEL_PLATFORM_RASPBIAN\n        input.reset(new input::InputRasp());\n#elif OUZEL_PLATFORM_EMSCRIPTEN\n        input.reset(new input::InputEm());\n#else\n        input.reset(new input::Input());\n#endif\n\n        active = true;\n\n        return true;\n    }\n\n    void Engine::begin()\n    {\n        previousUpdateTime = previousFrameTime = std::chrono::steady_clock::now();\n        running = true;\n\n#if OUZEL_MULTITHREADED\n        updateThread = std::thread(&Engine::run, this);\n#endif\n    }\n\n    void Engine::end()\n    {\n        running = false;\n        active = false;\n\n#if OUZEL_MULTITHREADED\n        if (updateThread.joinable()) updateThread.join();\n#endif\n    }\n\n    void Engine::pause()\n    {\n        running = false;\n    }\n\n    void Engine::resume()\n    {\n        previousUpdateTime = previousFrameTime = std::chrono::steady_clock::now();\n        running = true;\n    }\n\n    void Engine::run()\n    {\n#if OUZEL_MULTITHREADED\n        while (active)\n        {\n#endif\n            if (running)\n            {\n                std::chrono::steady_clock::time_point currentTime = std::chrono::steady_clock::now();\n                auto diff = currentTime - previousUpdateTime;\n\n                if (diff > std::chrono::milliseconds(1)) \/\/ at least one millisecond has passed\n                {\n                    previousUpdateTime = currentTime;\n                    float delta = std::chrono::duration_cast<std::chrono::microseconds>(diff).count() \/ 1000000.0f;\n\n                    eventDispatcher.dispatchEvents();\n\n                    if (sharedEngine->getRenderer()->getRefillDrawQueue())\n                    {\n                        sceneManager.draw();\n                        renderer->flushDrawCommands();\n                    }\n\n                    \/\/ erase all null update callbacks from the list\n                    for (auto i = updateCallbacks.begin(); i != updateCallbacks.end();)\n                    {\n                        i = (*i) ? ++i : updateCallbacks.erase(i);\n                    }\n\n                    if (!updateCallbackAddSet.empty())\n                    {\n                        for (const UpdateCallback* updateCallback : updateCallbackAddSet)\n                        {\n                            auto i = std::find(updateCallbacks.begin(), updateCallbacks.end(), updateCallback);\n\n                            if (i == updateCallbacks.end())\n                            {\n                                updateCallbacks.push_back(updateCallback);\n                            }\n                        }\n\n                        std::stable_sort(updateCallbacks.begin(), updateCallbacks.end(), [](const UpdateCallback* a, const UpdateCallback* b) {\n                            return a->priority > b->priority;\n                        });\n                    }\n\n                    for (const UpdateCallback* updateCallback : updateCallbacks)\n                    {\n                        if (updateCallback && updateCallback->callback)\n                        {\n                            updateCallback->callback(delta);\n                        }\n                    }\n                }\n            }\n#if OUZEL_MULTITHREADED\n        }\n#endif\n    }\n\n    bool Engine::draw()\n    {\n#if !OUZEL_MULTITHREADED\n        Engine::run();\n#endif\n\n        std::chrono::steady_clock::time_point currentTime = std::chrono::steady_clock::now();\n        auto diff = std::chrono::duration_cast<std::chrono::nanoseconds>(currentTime - previousFrameTime);\n        previousFrameTime = currentTime;\n\n        float delta = diff.count() \/ 1000000000.0f;\n\n        if (delta > 0.0f)\n        {\n            currentFPS = 1.0f \/ delta;\n        }\n\n        accumulatedTime += delta;\n        currentAccumulatedFPS += 1.0f;\n\n        if (accumulatedTime > 1.0f)\n        {\n            accumulatedFPS = currentAccumulatedFPS;\n            accumulatedTime = 0.0f;\n            currentAccumulatedFPS = 0.0f;\n        }\n\n        if (!renderer->present())\n        {\n            return false;\n        }\n\n        return active;\n    }\n\n    void Engine::scheduleUpdate(const UpdateCallback* callback)\n    {\n        updateCallbackAddSet.insert(callback);\n    }\n\n    void Engine::unscheduleUpdate(const UpdateCallback* callback)\n    {\n        auto vectorIterator = std::find(updateCallbacks.begin(), updateCallbacks.end(), callback);\n\n        if (vectorIterator != updateCallbacks.end())\n        {\n            *vectorIterator = nullptr;\n        }\n\n        auto setIterator = updateCallbackAddSet.find(callback);\n\n        if (setIterator != updateCallbackAddSet.end())\n        {\n            updateCallbackAddSet.erase(setIterator);\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ @(#) $Id: AliHLTTPCCATracker.cxx 34611 2009-09-04 00:22:05Z sgorbuno $\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 <sergey.gorbunov@kip.uni-heidelberg.de> *\n\/\/                  Ivan Kisel <kisel@kip.uni-heidelberg.de>                *\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\n#include \"AliHLTTPCCADef.h\"\n#include \"AliHLTTPCCAGPUConfig.h\"\n#include \"AliHLTTPCCATrackerFramework.h\"\n#include \"AliHLTTPCCAGPUTracker.h\"\n#include \"AliHLTTPCCATracker.h\"\n#include \"AliHLTTPCCAMath.h\"\n#include \"AliHLTTPCCAClusterData.h\"\n\n#include <windows.h>\n#include <winbase.h>\n\n#ifdef HLTCA_STANDALONE\n#include <omp.h>\n#endif\n\nint AliHLTTPCCATrackerFramework::InitGPU(int sliceCount, int forceDeviceID)\n{\n\t\/\/Initialize GPU Tracker and determine if GPU available\n\tint retVal;\n\tif (!fGPULibAvailable)\n\t{\n\t\tprintf(\"GPU Library not loaded\\n\");\n\t\treturn(1);\n\t}\n\tif (fGPUTrackerAvailable && (retVal = ExitGPU())) return(retVal);\n\tretVal = fGPUTracker->InitGPU(sliceCount, forceDeviceID);\n\tfUseGPUTracker = fGPUTrackerAvailable = retVal == 0;\n\tfGPUSliceCount = sliceCount;\n\treturn(retVal);\n}\n\nint AliHLTTPCCATrackerFramework::ExitGPU()\n{\n\t\/\/Uninitialize GPU Tracker\n\tif (!fGPUTrackerAvailable) return(0);\n\tfUseGPUTracker = false;\n\tfGPUTrackerAvailable = false;\n\treturn(fGPUTracker->ExitGPU());\n}\n\nvoid AliHLTTPCCATrackerFramework::SetGPUDebugLevel(int Level, std::ostream *OutFile, std::ostream *GPUOutFile)\n{\n\t\/\/Set Debug Level for GPU Tracker and also for CPU Tracker for comparison reasons\n\tfGPUTracker->SetDebugLevel(Level, GPUOutFile);\n\tfGPUDebugLevel = Level;\n\tfor (int i = 0;i < fgkNSlices;i++)\n\t{\n\t\tfCPUTrackers[i].SetGPUDebugLevel(Level, OutFile);\n\t}\n}\n\nint AliHLTTPCCATrackerFramework::SetGPUTracker(bool enable)\n{\n\t\/\/Enable \/ disable GPU Tracker\n\tif (enable && !fGPUTrackerAvailable)\n\t{\n\t\tfUseGPUTracker = false;\n\t\treturn(1);\n\t}\n\tfUseGPUTracker = enable;\n\treturn(0);\n}\n\nGPUhd() void AliHLTTPCCATrackerFramework::SetOutputControl( AliHLTTPCCASliceOutput::outputControlStruct* val)\n{\n\t\/\/Set Output Control Pointers\n\tfOutputControl = val;\n\tfGPUTracker->SetOutputControl(val);\n\tfor (int i = 0;i < fgkNSlices;i++)\n\t{\n\t\tfCPUTrackers[i].SetOutputControl(val);\n\t}\n}\n\nint AliHLTTPCCATrackerFramework::ProcessSlices(int firstSlice, int sliceCount, AliHLTTPCCAClusterData* pClusterData, AliHLTTPCCASliceOutput** pOutput)\n{\n\t\/\/Process sliceCount slices starting from firstslice, in is pClusterData array, out pOutput array\n\tif (fUseGPUTracker)\n\t{\n\t\tif (fGPUTracker->Reconstruct(pOutput, pClusterData, firstSlice, CAMath::Min(sliceCount, fgkNSlices - firstSlice))) return(1);\n\t}\n\telse\n\t{\n#ifdef HLTCA_STANDALONE\n\t\tif (fOutputControl->fOutputPtr && omp_get_max_threads() > 1)\n\t\t{\n\t\t\tprintf(\"fOutputPtr must not be used with OpenMP\\n\");\n\t\t\treturn(1);\n\t\t}\n\n#pragma omp parallel for\n#endif\n\t\tfor (int iSlice = 0;iSlice < CAMath::Min(sliceCount, fgkNSlices - firstSlice);iSlice++)\n\t\t{\n\t\t\tfCPUTrackers[firstSlice + iSlice].ReadEvent(&pClusterData[iSlice]);\n\t\t\tfCPUTrackers[firstSlice + iSlice].SetOutput(&pOutput[iSlice]);\n\t\t\tfCPUTrackers[firstSlice + iSlice].Reconstruct();\n\t\t\tfCPUTrackers[firstSlice + iSlice].SetupCommonMemory();\n\t\t}\n\t}\n\t\n\tif (fGPUDebugLevel >= 6 && fUseGPUTracker)\n\t{\n\t    fUseGPUTracker = 0;\n\t    ProcessSlices(firstSlice, sliceCount, pClusterData, pOutput);\n\t    fUseGPUTracker = 1;\n\t}\n\n\t\/\/printf(\"Slice Tracks Output: %d\\n\", pOutput[0].NTracks());\n\treturn(0);\n}\n\nunsigned long long int* AliHLTTPCCATrackerFramework::PerfTimer(int GPU, int iSlice, int iTimer)\n{\n\t\/\/Performance information for slice trackers\n\treturn(GPU ? fGPUTracker->PerfTimer(iSlice, iTimer) : fCPUTrackers[iSlice].PerfTimer(iTimer));\n}\n\nint AliHLTTPCCATrackerFramework::InitializeSliceParam(int iSlice, AliHLTTPCCAParam &param)\n{\n\t\/\/Initialize Tracker Parameters for a slice\n\tif (fGPUTrackerAvailable && fGPUTracker->InitializeSliceParam(iSlice, param)) return(1);\n\tfCPUTrackers[iSlice].Initialize(param);\n\treturn(0);\n}\n\nAliHLTTPCCATrackerFramework::AliHLTTPCCATrackerFramework(int allowGPU) :\tfGPULibAvailable(false), fGPUTrackerAvailable(false), fUseGPUTracker(false), fGPUDebugLevel(0), fGPUSliceCount(0), fGPUTracker(NULL), fGPULib(NULL), fOutputControl( NULL ), fCPUSliceCount(fgkNSlices)\n{\n\t\/\/Constructor\n\tHMODULE hGPULib = LoadLibraryEx(\"cagpu.dll\", NULL, NULL);\n\tif (hGPULib == NULL)\n\t{\n\t\tprintf(\"Error Opening cagpu library\\n\");\n\t\tfGPUTracker = new AliHLTTPCCAGPUTracker;\n\t}\n\telse\n\t{\n\t\tFARPROC createFunc = GetProcAddress(hGPULib, \"AliHLTTPCCAGPUTrackerNVCCCreate\");\n\t\tif (createFunc == NULL)\n\t\t{\n\t\t\tprintf(\"Error Creating GPU Tracker\\n\");\n\t\t\tFreeLibrary(hGPULib);\n\t\t\tfGPUTracker = new AliHLTTPCCAGPUTracker;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tAliHLTTPCCAGPUTracker* (*tmp)() = (AliHLTTPCCAGPUTracker* (*)()) createFunc;\n\t\t\tfGPUTracker = tmp();\n\t\t\tfGPULibAvailable = true;\n\t\t\tfGPULib = (void*) (size_t) hGPULib;\n\t\t}\n\t}\n\n\tif (allowGPU && fGPULibAvailable)\n\t{\n\t\tfUseGPUTracker = (fGPUTrackerAvailable= (fGPUTracker->InitGPU() == 0));\n\t\tfGPUSliceCount = fGPUTrackerAvailable ? fGPUTracker->GetSliceCount() : 0;\n\t}\n}\n\nAliHLTTPCCATrackerFramework::~AliHLTTPCCATrackerFramework()\n{\n\tHMODULE hGPULib = (HMODULE) (size_t) fGPULib;\n\tif (fGPULib)\n\t{\n\t\tif (fGPUTracker)\n\t\t{\n\t\t\tFARPROC destroyFunc = GetProcAddress(hGPULib, \"AliHLTTPCCAGPUTrackerNVCCDestroy\");\n\t\t\tif (destroyFunc == NULL) printf(\"Error Freeing GPU Tracker\\n\");\n\t\t\telse\n\t\t\t{\n\t\t\t\tvoid (*tmp)(AliHLTTPCCAGPUTracker*) =  (void (*)(AliHLTTPCCAGPUTracker*)) destroyFunc;\n\t\t\t\ttmp(fGPUTracker);\n\t\t\t}\n\t\t}\n\n\t\tFreeLibrary(hGPULib);\n\t}\n\telse if (fGPUTracker)\n\t{\n\t\tdelete fGPUTracker;\n\t}\n\tfGPULib = NULL;\n\tfGPUTracker = NULL;\n}\n<commit_msg>added linux support for lib<commit_after>\/\/ @(#) $Id: AliHLTTPCCATracker.cxx 34611 2009-09-04 00:22:05Z sgorbuno $\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 <sergey.gorbunov@kip.uni-heidelberg.de> *\n\/\/                  Ivan Kisel <kisel@kip.uni-heidelberg.de>                *\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\n#include \"AliHLTTPCCADef.h\"\n#include \"AliHLTTPCCAGPUConfig.h\"\n#include \"AliHLTTPCCATrackerFramework.h\"\n#include \"AliHLTTPCCAGPUTracker.h\"\n#include \"AliHLTTPCCATracker.h\"\n#include \"AliHLTTPCCAMath.h\"\n#include \"AliHLTTPCCAClusterData.h\"\n\n#ifdef R__WIN32\n#include <windows.h>\n#include <winbase.h>\n#else\n#include <dlfcn.h>\n#endif\n\n#ifdef HLTCA_STANDALONE\n#include <omp.h>\n#endif\n\nint AliHLTTPCCATrackerFramework::InitGPU(int sliceCount, int forceDeviceID)\n{\n\t\/\/Initialize GPU Tracker and determine if GPU available\n\tint retVal;\n\tif (!fGPULibAvailable)\n\t{\n\t\tprintf(\"GPU Library not loaded\\n\");\n\t\treturn(1);\n\t}\n\tif (fGPUTrackerAvailable && (retVal = ExitGPU())) return(retVal);\n\tretVal = fGPUTracker->InitGPU(sliceCount, forceDeviceID);\n\tfUseGPUTracker = fGPUTrackerAvailable = retVal == 0;\n\tfGPUSliceCount = sliceCount;\n\treturn(retVal);\n}\n\nint AliHLTTPCCATrackerFramework::ExitGPU()\n{\n\t\/\/Uninitialize GPU Tracker\n\tif (!fGPUTrackerAvailable) return(0);\n\tfUseGPUTracker = false;\n\tfGPUTrackerAvailable = false;\n\treturn(fGPUTracker->ExitGPU());\n}\n\nvoid AliHLTTPCCATrackerFramework::SetGPUDebugLevel(int Level, std::ostream *OutFile, std::ostream *GPUOutFile)\n{\n\t\/\/Set Debug Level for GPU Tracker and also for CPU Tracker for comparison reasons\n\tfGPUTracker->SetDebugLevel(Level, GPUOutFile);\n\tfGPUDebugLevel = Level;\n\tfor (int i = 0;i < fgkNSlices;i++)\n\t{\n\t\tfCPUTrackers[i].SetGPUDebugLevel(Level, OutFile);\n\t}\n}\n\nint AliHLTTPCCATrackerFramework::SetGPUTracker(bool enable)\n{\n\t\/\/Enable \/ disable GPU Tracker\n\tif (enable && !fGPUTrackerAvailable)\n\t{\n\t\tfUseGPUTracker = false;\n\t\treturn(1);\n\t}\n\tfUseGPUTracker = enable;\n\treturn(0);\n}\n\nGPUhd() void AliHLTTPCCATrackerFramework::SetOutputControl( AliHLTTPCCASliceOutput::outputControlStruct* val)\n{\n\t\/\/Set Output Control Pointers\n\tfOutputControl = val;\n\tfGPUTracker->SetOutputControl(val);\n\tfor (int i = 0;i < fgkNSlices;i++)\n\t{\n\t\tfCPUTrackers[i].SetOutputControl(val);\n\t}\n}\n\nint AliHLTTPCCATrackerFramework::ProcessSlices(int firstSlice, int sliceCount, AliHLTTPCCAClusterData* pClusterData, AliHLTTPCCASliceOutput** pOutput)\n{\n\t\/\/Process sliceCount slices starting from firstslice, in is pClusterData array, out pOutput array\n\tif (fUseGPUTracker)\n\t{\n\t\tif (fGPUTracker->Reconstruct(pOutput, pClusterData, firstSlice, CAMath::Min(sliceCount, fgkNSlices - firstSlice))) return(1);\n\t}\n\telse\n\t{\n#ifdef HLTCA_STANDALONE\n\t\tif (fOutputControl->fOutputPtr && omp_get_max_threads() > 1)\n\t\t{\n\t\t\tprintf(\"fOutputPtr must not be used with OpenMP\\n\");\n\t\t\treturn(1);\n\t\t}\n\n#pragma omp parallel for\n#endif\n\t\tfor (int iSlice = 0;iSlice < CAMath::Min(sliceCount, fgkNSlices - firstSlice);iSlice++)\n\t\t{\n\t\t\tfCPUTrackers[firstSlice + iSlice].ReadEvent(&pClusterData[iSlice]);\n\t\t\tfCPUTrackers[firstSlice + iSlice].SetOutput(&pOutput[iSlice]);\n\t\t\tfCPUTrackers[firstSlice + iSlice].Reconstruct();\n\t\t\tfCPUTrackers[firstSlice + iSlice].SetupCommonMemory();\n\t\t}\n\t}\n\t\n\tif (fGPUDebugLevel >= 6 && fUseGPUTracker)\n\t{\n\t    fUseGPUTracker = 0;\n\t    ProcessSlices(firstSlice, sliceCount, pClusterData, pOutput);\n\t    fUseGPUTracker = 1;\n\t}\n\n\t\/\/printf(\"Slice Tracks Output: %d\\n\", pOutput[0].NTracks());\n\treturn(0);\n}\n\nunsigned long long int* AliHLTTPCCATrackerFramework::PerfTimer(int GPU, int iSlice, int iTimer)\n{\n\t\/\/Performance information for slice trackers\n\treturn(GPU ? fGPUTracker->PerfTimer(iSlice, iTimer) : fCPUTrackers[iSlice].PerfTimer(iTimer));\n}\n\nint AliHLTTPCCATrackerFramework::InitializeSliceParam(int iSlice, AliHLTTPCCAParam &param)\n{\n\t\/\/Initialize Tracker Parameters for a slice\n\tif (fGPUTrackerAvailable && fGPUTracker->InitializeSliceParam(iSlice, param)) return(1);\n\tfCPUTrackers[iSlice].Initialize(param);\n\treturn(0);\n}\n\nAliHLTTPCCATrackerFramework::AliHLTTPCCATrackerFramework(int allowGPU) :\tfGPULibAvailable(false), fGPUTrackerAvailable(false), fUseGPUTracker(false), fGPUDebugLevel(0), fGPUSliceCount(0), fGPUTracker(NULL), fGPULib(NULL), fOutputControl( NULL ), fCPUSliceCount(fgkNSlices)\n{\n\t\/\/Constructor\n#ifdef R__WIN32\n\tHMODULE hGPULib = LoadLibraryEx(\"cagpu.dll\", NULL, NULL);\n#else\n\tvoid* hGPULib = dlopen(\"cagpu.so\", RTLD_NOW);\n#endif\n\tif (hGPULib == NULL)\n\t{\n\t\tprintf(\"Error Opening cagpu library\\n\");\n\t\tfGPUTracker = new AliHLTTPCCAGPUTracker;\n\t}\n\telse\n\t{\n#ifdef R__WIN32\n\t\tFARPROC createFunc = GetProcAddress(hGPULib, \"AliHLTTPCCAGPUTrackerNVCCCreate\");\n#else\n\t\tvoid* createFunc = (void*) dlsym(hGPULib, \"AliHLTTPCCAGPUTrackerNVCCCreate\");\n#endif\n\t\tif (createFunc == NULL)\n\t\t{\n\t\t\tprintf(\"Error Creating GPU Tracker\\n\");\n#ifdef R__WIN32\n\t\t\tFreeLibrary(hGPULib);\n#else\n\t\t\tdlclose(hGPULib);\n#endif\n\t\t\tfGPUTracker = new AliHLTTPCCAGPUTracker;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tAliHLTTPCCAGPUTracker* (*tmp)() = (AliHLTTPCCAGPUTracker* (*)()) createFunc;\n\t\t\tfGPUTracker = tmp();\n\t\t\tfGPULibAvailable = true;\n\t\t\tfGPULib = (void*) (size_t) hGPULib;\n\t\t}\n\t}\n\n\tif (allowGPU && fGPULibAvailable)\n\t{\n\t\tfUseGPUTracker = (fGPUTrackerAvailable= (fGPUTracker->InitGPU() == 0));\n\t\tfGPUSliceCount = fGPUTrackerAvailable ? fGPUTracker->GetSliceCount() : 0;\n\t}\n}\n\nAliHLTTPCCATrackerFramework::~AliHLTTPCCATrackerFramework()\n{\n#ifdef R__WIN32\n\tHMODULE hGPULib = (HMODULE) (size_t) fGPULib;\n#else\n\tvoid* hGPULib = fGPULib;\n#endif\n\tif (fGPULib)\n\t{\n\t\tif (fGPUTracker)\n\t\t{\n#ifdef R__WIN32\n\t\t\tFARPROC destroyFunc = GetProcAddress(hGPULib, \"AliHLTTPCCAGPUTrackerNVCCDestroy\");\n#else\n\t\t\tvoid* destroyFunc = (void*) dlsym(hGPULib, \"AliHLTTPCCAGPUTrackerNVCCDestroy\");\n#endif\n\t\t\tif (destroyFunc == NULL) printf(\"Error Freeing GPU Tracker\\n\");\n\t\t\telse\n\t\t\t{\n\t\t\t\tvoid (*tmp)(AliHLTTPCCAGPUTracker*) =  (void (*)(AliHLTTPCCAGPUTracker*)) destroyFunc;\n\t\t\t\ttmp(fGPUTracker);\n\t\t\t}\n\t\t}\n\n#ifdef R__WIN32\n\t\tFreeLibrary(hGPULib);\n#else\n\t\tdlclose(hGPULib);\n#endif\n\t}\n\telse if (fGPUTracker)\n\t{\n\t\tdelete fGPUTracker;\n\t}\n\tfGPULib = NULL;\n\tfGPUTracker = NULL;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2016.  All rights reserved\n *\/\n#include    \"..\/..\/StroikaPreComp.h\"\n\n#if     qPlatform_Windows\n#include    <windows.h>\n#elif   qPlatform_POSIX\n#include    <dirent.h>\n#endif\n\n#include    \"..\/..\/Characters\/CString\/Utilities.h\"\n#include    \"..\/..\/Debug\/AssertExternallySynchronizedLock.h\"\n#include    \"..\/..\/Debug\/Trace.h\"\n#include    \"..\/..\/Execution\/ErrNoException.h\"\n#if     qPlatform_Windows\n#include    \"..\/..\/Execution\/Platform\/Windows\/Exception.h\"\n#endif\n#include    \"..\/..\/IO\/FileAccessException.h\"\n\n#include    \"DirectoryIterator.h\"\n\n\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\nusing   namespace   Stroika::Foundation;\nusing   namespace   Stroika::Foundation::Characters;\nusing   namespace   Stroika::Foundation::IO;\nusing   namespace   Stroika::Foundation::IO::FileSystem;\nusing   namespace   Stroika::Foundation::Traversal;\n\n#if     qPlatform_Windows\nusing   Execution::Platform::Windows::ThrowIfFalseGetLastError;\n#endif\nusing   Execution::ThrowIfError_errno_t;\nusing   Execution::ThrowErrNoIfNull;\n\n\nclass   DirectoryIterator::Rep_ : public Iterator<String>::IRep, private Debug::AssertExternallySynchronizedLock {\nprivate:\n#if     qPlatform_POSIX\n    DIR*            fDirIt_             { nullptr };\n    dirent*         fCur_               { nullptr };\n#elif   qPlatform_Windows\n    String          fDirName_;\n    HANDLE          fHandle_            { INVALID_HANDLE_VALUE };\n    WIN32_FIND_DATA fFindFileData_;\n    int             fSeekOffset_        { 0 };\n#endif\n\npublic:\n    Rep_ (const String& dir)\n#if     qPlatform_POSIX\n        : fDirIt_ { ::opendir (dir.AsSDKString ().c_str ()) }\n#elif   qPlatform_Windows\n        :\n        fDirName_ (dir)\n#endif\n    {\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n        DbgTrace (L\"Entering DirectoryIterator::Rep_::CTOR('%s')\", dir.c_str ());\n#endif\n        try {\n#if     qPlatform_POSIX\n            if (fDirIt_ == nullptr) {\n                Execution::ThrowIfError_errno_t ();\n            }\n            else {\n                ThrowErrNoIfNull (fCur_ = ::readdir (fDirIt_));\n            }\n            if (fCur_ != nullptr and fCur_->d_name[0] == '.' and (CString::Equals (fCur_->d_name, SDKSTR (\".\")) or CString::Equals (fCur_->d_name, SDKSTR (\"..\")))) {\n                Memory::Optional<String>    tmphack;\n                More (&tmphack, true);\n            }\n#elif   qPlatform_Windows\n            (void)::memset (&fFindFileData_, 0, sizeof (fFindFileData_));\n            fHandle_ = ::FindFirstFile ((dir + L\"\\\\*\").AsSDKString ().c_str (), &fFindFileData_);\n            if (fHandle_ != INVALID_HANDLE_VALUE and fFindFileData_.cFileName[0] == '.' and (CString::Equals (fFindFileData_.cFileName, SDKSTR (\".\")) or CString::Equals (fFindFileData_.cFileName, SDKSTR (\"..\")))) {\n                Memory::Optional<String>    tmphack;\n                More (&tmphack, true);\n            }\n#endif\n        }\n        Stroika_Foundation_IO_FileAccessException_CATCH_REBIND_FILENAMESONLY_HELPER(dir);\n    }\n#if     qPlatform_POSIX\n    Rep_ (DIR* dirObj)\n        : fDirIt_ { dirObj }\n    {\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n        DbgTrace (L\"Entering DirectoryIterator::Rep_::CTOR(dirObj=%x)\", int(dirObj));\n#endif\n        if (fDirIt_ != nullptr) {\n            ThrowErrNoIfNull (fCur_ = ::readdir (fDirIt_));\n            if (fCur_ != nullptr and fCur_->d_name[0] == '.' and (CString::Equals (fCur_->d_name, SDKSTR (\".\")) or CString::Equals (fCur_->d_name, SDKSTR (\"..\")))) {\n                Memory::Optional<String>    tmphack;\n                More (&tmphack, true);\n            }\n        }\n    }\n#elif   qPlatform_Windows\n    Rep_ (const String& dir, int seekPos)\n        : fDirName_ (dir)\n    {\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n        DbgTrace (L\"Entering DirectoryIterator::Rep_::CTOR('%s',seekPos=%d)\", dir.c_str (), seekPos);\n#endif\n        (void)::memset (&fFindFileData_, 0, sizeof (fFindFileData_));\n        fHandle_ = ::FindFirstFile ((dir + L\"\\\\*\").AsSDKString ().c_str (), &fFindFileData_);\n        for (int i = 0; i < seekPos; ++i) {\n            if (::FindNextFile (fHandle_, &fFindFileData_) == 0) {\n                ::FindClose (fHandle_);\n                fHandle_ = INVALID_HANDLE_VALUE;\n            }\n            else {\n                fSeekOffset_++;\n            }\n        }\n        if (fHandle_ != INVALID_HANDLE_VALUE and fFindFileData_.cFileName[0] == '.' and (CString::Equals (fFindFileData_.cFileName, SDKSTR (\".\")) or CString::Equals (fFindFileData_.cFileName, SDKSTR (\"..\"))) ) {\n            Memory::Optional<String>    tmphack;\n            More (&tmphack, true);\n        }\n    }\n#endif\n    virtual ~Rep_ ()\n    {\n#if     qPlatform_POSIX\n        if (fDirIt_ != nullptr) {\n            ::closedir (fDirIt_);\n        }\n#elif   qPlatform_Windows\n        if (fHandle_ != INVALID_HANDLE_VALUE) {\n            ::FindClose (fHandle_);\n        }\n#endif\n    }\n    virtual void    More (Memory::Optional<String>* result, bool advance) override\n    {\n        lock_guard<const AssertExternallySynchronizedLock> critSec { *this };\n        RequireNotNull (result);\n        result->clear ();\n#if     qPlatform_POSIX\n        if (advance) {\nAgain:\n            RequireNotNull (fCur_);\n            RequireNotNull (fDirIt_);\n            fCur_ = ::readdir (fDirIt_);\n            if (fCur_ == nullptr) {\n                if (errno != EBADF) {\n                    ThrowIfError_errno_t ();\n                }\n            }\n            if (fCur_ != nullptr and fCur_->d_name[0] == '.' and (CString::Equals (fCur_->d_name, SDKSTR (\".\")) or CString::Equals (fCur_->d_name, SDKSTR (\"..\")))) {\n                goto Again;\n            }\n        }\n        if (fCur_ != nullptr) {\n            *result = String::FromSDKString (fCur_->d_name);\n        }\n#elif   qPlatform_Windows\n        if (advance) {\nAgain:\n            Require (fHandle_ != INVALID_HANDLE_VALUE);\n            (void)::memset (&fFindFileData_, 0, sizeof (fFindFileData_));\n            if (::FindNextFile (fHandle_, &fFindFileData_) == 0) {\n                ::FindClose (fHandle_);\n                fHandle_ = INVALID_HANDLE_VALUE;\n            }\n            if (fHandle_ != INVALID_HANDLE_VALUE and fFindFileData_.cFileName[0] == '.' and (CString::Equals (fFindFileData_.cFileName, SDKSTR (\".\")) or CString::Equals (fFindFileData_.cFileName, SDKSTR (\"..\"))) ) {\n                goto Again;\n            }\n        }\n        if (fHandle_ != INVALID_HANDLE_VALUE) {\n            *result = String::FromSDKString (fFindFileData_.cFileName);\n        }\n#endif\n    }\n    virtual bool    Equals (const Iterator<String>::IRep* rhs) const override\n    {\n        shared_lock<const AssertExternallySynchronizedLock> critSec { *this };\n        RequireNotNull (rhs);\n        RequireMember (rhs, Rep_);\n        const Rep_&  rrhs = *dynamic_cast<const Rep_*> (rhs);\n#if     qPlatform_POSIX\n        return fDirIt_ == rrhs.fDirIt_;\n#elif   qPlatform_Windows\n        return fHandle_ == rrhs.fHandle_;\n#endif\n    }\n    virtual SharedIRepPtr    Clone () const override\n    {\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n        DbgTrace (L\"Entering DirectoryIterator::Rep_::Clone\");\n#endif\n        shared_lock<const AssertExternallySynchronizedLock> critSec { *this };\n#if     qPlatform_POSIX\n        if (fDirIt_ == nullptr) {\n            return SharedIRepPtr (MakeSharedPtr<Rep_> (nullptr));\n        }\n        \/*\n         *  must find telldir() returns the location of the NEXT read. We must pass along the value of telldir as\n         *  of the PREVIOUS read. Essentially (seek CUR_OFF, -1);\n         *\n         *  But - this API doesn't support that.\n         *\n         *  This leaves us with several weak alternatives:\n         *      o   save the telldir, and seek to the start of the dir, and repeatedly seek until\n         *          we get the same telldir, and then return the previous stored value.\n         *\n         *      o   substract 1 from the value of telldir()\n         *\n         *      o   Before each 'readdir() - do a telldir() to capture its value.\n         *\n         *      o   When cloning - compute offset in file#s by rewinding and seeking til we find the same value by\n         *          name or some such, and then use that same process to re-seek in the cloned dirEnt.\n         *\n         *  The 'subtract 1' approach, though cheap and simple, appears not supported by the telldir documentation,\n         *  and looking at values in the current linux\/gcc, seems unpromising.\n         *\n         *  Between the 'telldir' before each read, and re-seek approaches, the former adds overhead even when not cloning\n         *  iterators, and the later only when you use the feature. Moreover, the seek-to-start and keep looking\n         *  for telldir() approach probably works out efficeintly, as the most likely time to Clone () an iterator is\n         *  when it is 'at start' anyhow (DirectoryIterable). So we'll start with that...\n         *          -- LGP 2014-07-10\n         *\/\n        \/\/ Note - NOT 100% sure its OK to look for identical value telldir in another dir...\n        DIR*        dirObj          =   ::fdopendir (::dirfd (fDirIt_));\n        if (dirObj == nullptr) {\n            Execution::ThrowIfError_errno_t ();\n        }\n        try {\n            if (fCur_ == nullptr) {\n                \/\/ then we're past end end, the cloned fdopen dir one SB too!\n                Assert (::readdir (dirObj) == nullptr);\n            }\n            else {\n                ino_t   aBridgeTooFar   =   fCur_->d_ino;\n                ::rewinddir (dirObj);\n                long useOffset = ::telldir (dirObj);\n                for (;;) {\n                    dirent* tmp = ::readdir (dirObj);\n                    if (tmp == nullptr) {\n                        \/\/ somehow the file went away, so no idea where to start, and the end is as reasonable as anywhere else???\n                        useOffset = ::telldir (dirObj);\n                        DbgTrace (L\"WARN: possible bug? - ususual, and not handled well, but this can happen if the file disappears while we're cloning\");\n                        break;\n                    }\n                    else if (tmp->d_ino == aBridgeTooFar) {\n                        \/\/ then we are now pointing at the right elt, and want to seek to the PRECEEDING one so when it does a readdir it gets that item\n                        \/\/ so DONT update useOffset - just break!\n                        break;\n                    }\n                    else {\n                        \/\/ update to this reflects the last offset before we find d_ino\n                        useOffset = ::telldir (dirObj);\n                    }\n                }\n                ::seekdir (dirObj, useOffset);\n            }\n            return SharedIRepPtr (MakeSharedPtr<Rep_> (dirObj));\n        }\n        catch (...) {\n            ::closedir (dirObj);    \/\/ avoid leak\n            Execution::ReThrow ();\n        }\n#elif   qPlatform_Windows\n        return SharedIRepPtr (MakeSharedPtr<Rep_> (fDirName_, fSeekOffset_));\n#endif\n    }\n    virtual IteratorOwnerID GetOwner () const override\n    {\n        \/*\n         *  This return value allows any two DiscreteRange iterators (of the same type) to be compared.\n         *\/\n        return typeid (*this).name ();\n    }\n};\n\n\n\n\n\n\n\n\n\/*\n ********************************************************************************\n ******************** IO::FileSystem::DirectoryIterator *************************\n ********************************************************************************\n *\/\nDirectoryIterator::DirectoryIterator (const String& directoryName)\n    : Iterator<String> (MakeSharedPtr<Rep_> (directoryName))\n{\n}\n<commit_msg>DbgTrace tweaks to FileSystem\/DirectoryIterator<commit_after>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2016.  All rights reserved\n *\/\n#include    \"..\/..\/StroikaPreComp.h\"\n\n#if     qPlatform_Windows\n#include    <windows.h>\n#elif   qPlatform_POSIX\n#include    <dirent.h>\n#endif\n\n#include    \"..\/..\/Characters\/CString\/Utilities.h\"\n#include    \"..\/..\/Debug\/AssertExternallySynchronizedLock.h\"\n#include    \"..\/..\/Debug\/Trace.h\"\n#include    \"..\/..\/Execution\/ErrNoException.h\"\n#if     qPlatform_Windows\n#include    \"..\/..\/Execution\/Platform\/Windows\/Exception.h\"\n#endif\n#include    \"..\/..\/IO\/FileAccessException.h\"\n\n#include    \"DirectoryIterator.h\"\n\n\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\nusing   namespace   Stroika::Foundation;\nusing   namespace   Stroika::Foundation::Characters;\nusing   namespace   Stroika::Foundation::IO;\nusing   namespace   Stroika::Foundation::IO::FileSystem;\nusing   namespace   Stroika::Foundation::Traversal;\n\n#if     qPlatform_Windows\nusing   Execution::Platform::Windows::ThrowIfFalseGetLastError;\n#endif\nusing   Execution::ThrowIfError_errno_t;\nusing   Execution::ThrowErrNoIfNull;\n\n\nclass   DirectoryIterator::Rep_ : public Iterator<String>::IRep, private Debug::AssertExternallySynchronizedLock {\nprivate:\n#if     qPlatform_POSIX\n    DIR*            fDirIt_             { nullptr };\n    dirent*         fCur_               { nullptr };\n#elif   qPlatform_Windows\n    String          fDirName_;\n    HANDLE          fHandle_            { INVALID_HANDLE_VALUE };\n    WIN32_FIND_DATA fFindFileData_;\n    int             fSeekOffset_        { 0 };\n#endif\n\npublic:\n    Rep_ (const String& dir)\n#if     qPlatform_POSIX\n        : fDirIt_ { ::opendir (dir.AsSDKString ().c_str ()) }\n#elif   qPlatform_Windows\n        :\n        fDirName_ (dir)\n#endif\n    {\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n        Debug::TraceContextBumper ctx { L\"DirectoryIterator::Rep_::CTOR\" };\n        DbgTrace (L\"('%s')\", dir.c_str ());\n#endif\n        try {\n#if     qPlatform_POSIX\n            if (fDirIt_ == nullptr) {\n                Execution::ThrowIfError_errno_t ();\n            }\n            else {\n                ThrowErrNoIfNull (fCur_ = ::readdir (fDirIt_));\n            }\n            if (fCur_ != nullptr and fCur_->d_name[0] == '.' and (CString::Equals (fCur_->d_name, SDKSTR (\".\")) or CString::Equals (fCur_->d_name, SDKSTR (\"..\")))) {\n                Memory::Optional<String>    tmphack;\n                More (&tmphack, true);\n            }\n#elif   qPlatform_Windows\n            (void)::memset (&fFindFileData_, 0, sizeof (fFindFileData_));\n            fHandle_ = ::FindFirstFile ((dir + L\"\\\\*\").AsSDKString ().c_str (), &fFindFileData_);\n            if (fHandle_ != INVALID_HANDLE_VALUE and fFindFileData_.cFileName[0] == '.' and (CString::Equals (fFindFileData_.cFileName, SDKSTR (\".\")) or CString::Equals (fFindFileData_.cFileName, SDKSTR (\"..\")))) {\n                Memory::Optional<String>    tmphack;\n                More (&tmphack, true);\n            }\n#endif\n        }\n        Stroika_Foundation_IO_FileAccessException_CATCH_REBIND_FILENAMESONLY_HELPER(dir);\n    }\n#if     qPlatform_POSIX\n    Rep_ (DIR* dirObj)\n        : fDirIt_ { dirObj }\n    {\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n        Debug::TraceContextBumper ctx { L\"DirectoryIterator::Rep_::CTOR\" };\n        DbgTrace (L\"(dirObj=%x)\", int(dirObj));\n#endif\n        if (fDirIt_ != nullptr) {\n            ThrowErrNoIfNull (fCur_ = ::readdir (fDirIt_));\n            if (fCur_ != nullptr and fCur_->d_name[0] == '.' and (CString::Equals (fCur_->d_name, SDKSTR (\".\")) or CString::Equals (fCur_->d_name, SDKSTR (\"..\")))) {\n                Memory::Optional<String>    tmphack;\n                More (&tmphack, true);\n            }\n        }\n    }\n#elif   qPlatform_Windows\n    Rep_ (const String& dir, int seekPos)\n        : fDirName_ (dir)\n    {\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n        Debug::TraceContextBumper ctx { L\"DirectoryIterator::Rep_::CTOR\" };\n        DbgTrace (L\"('%s',seekPos=%d)\", dir.c_str (), seekPos);\n#endif\n        (void)::memset (&fFindFileData_, 0, sizeof (fFindFileData_));\n        fHandle_ = ::FindFirstFile ((dir + L\"\\\\*\").AsSDKString ().c_str (), &fFindFileData_);\n        for (int i = 0; i < seekPos; ++i) {\n            if (::FindNextFile (fHandle_, &fFindFileData_) == 0) {\n                ::FindClose (fHandle_);\n                fHandle_ = INVALID_HANDLE_VALUE;\n            }\n            else {\n                fSeekOffset_++;\n            }\n        }\n        if (fHandle_ != INVALID_HANDLE_VALUE and fFindFileData_.cFileName[0] == '.' and (CString::Equals (fFindFileData_.cFileName, SDKSTR (\".\")) or CString::Equals (fFindFileData_.cFileName, SDKSTR (\"..\"))) ) {\n            Memory::Optional<String>    tmphack;\n            More (&tmphack, true);\n        }\n    }\n#endif\n    virtual ~Rep_ ()\n    {\n#if     qPlatform_POSIX\n        if (fDirIt_ != nullptr) {\n            ::closedir (fDirIt_);\n        }\n#elif   qPlatform_Windows\n        if (fHandle_ != INVALID_HANDLE_VALUE) {\n            ::FindClose (fHandle_);\n        }\n#endif\n    }\n    virtual void    More (Memory::Optional<String>* result, bool advance) override\n    {\n        lock_guard<const AssertExternallySynchronizedLock> critSec { *this };\n        RequireNotNull (result);\n        result->clear ();\n#if     qPlatform_POSIX\n        if (advance) {\nAgain:\n            RequireNotNull (fCur_);\n            RequireNotNull (fDirIt_);\n            fCur_ = ::readdir (fDirIt_);\n            if (fCur_ == nullptr) {\n                if (errno != EBADF) {\n                    ThrowIfError_errno_t ();\n                }\n            }\n            if (fCur_ != nullptr and fCur_->d_name[0] == '.' and (CString::Equals (fCur_->d_name, SDKSTR (\".\")) or CString::Equals (fCur_->d_name, SDKSTR (\"..\")))) {\n                goto Again;\n            }\n        }\n        if (fCur_ != nullptr) {\n            *result = String::FromSDKString (fCur_->d_name);\n        }\n#elif   qPlatform_Windows\n        if (advance) {\nAgain:\n            Require (fHandle_ != INVALID_HANDLE_VALUE);\n            (void)::memset (&fFindFileData_, 0, sizeof (fFindFileData_));\n            if (::FindNextFile (fHandle_, &fFindFileData_) == 0) {\n                ::FindClose (fHandle_);\n                fHandle_ = INVALID_HANDLE_VALUE;\n            }\n            if (fHandle_ != INVALID_HANDLE_VALUE and fFindFileData_.cFileName[0] == '.' and (CString::Equals (fFindFileData_.cFileName, SDKSTR (\".\")) or CString::Equals (fFindFileData_.cFileName, SDKSTR (\"..\"))) ) {\n                goto Again;\n            }\n        }\n        if (fHandle_ != INVALID_HANDLE_VALUE) {\n            *result = String::FromSDKString (fFindFileData_.cFileName);\n        }\n#endif\n    }\n    virtual bool    Equals (const Iterator<String>::IRep* rhs) const override\n    {\n        shared_lock<const AssertExternallySynchronizedLock> critSec { *this };\n        RequireNotNull (rhs);\n        RequireMember (rhs, Rep_);\n        const Rep_&  rrhs = *dynamic_cast<const Rep_*> (rhs);\n#if     qPlatform_POSIX\n        return fDirIt_ == rrhs.fDirIt_;\n#elif   qPlatform_Windows\n        return fHandle_ == rrhs.fHandle_;\n#endif\n    }\n    virtual SharedIRepPtr    Clone () const override\n    {\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n        Debug::TraceContextBumper ctx (L\"Entering DirectoryIterator::Rep_::Clone\");\n#endif\n        shared_lock<const AssertExternallySynchronizedLock> critSec { *this };\n#if     qPlatform_POSIX\n        if (fDirIt_ == nullptr) {\n            return SharedIRepPtr (MakeSharedPtr<Rep_> (nullptr));\n        }\n        \/*\n         *  must find telldir() returns the location of the NEXT read. We must pass along the value of telldir as\n         *  of the PREVIOUS read. Essentially (seek CUR_OFF, -1);\n         *\n         *  But - this API doesn't support that.\n         *\n         *  This leaves us with several weak alternatives:\n         *      o   save the telldir, and seek to the start of the dir, and repeatedly seek until\n         *          we get the same telldir, and then return the previous stored value.\n         *\n         *      o   substract 1 from the value of telldir()\n         *\n         *      o   Before each 'readdir() - do a telldir() to capture its value.\n         *\n         *      o   When cloning - compute offset in file#s by rewinding and seeking til we find the same value by\n         *          name or some such, and then use that same process to re-seek in the cloned dirEnt.\n         *\n         *  The 'subtract 1' approach, though cheap and simple, appears not supported by the telldir documentation,\n         *  and looking at values in the current linux\/gcc, seems unpromising.\n         *\n         *  Between the 'telldir' before each read, and re-seek approaches, the former adds overhead even when not cloning\n         *  iterators, and the later only when you use the feature. Moreover, the seek-to-start and keep looking\n         *  for telldir() approach probably works out efficeintly, as the most likely time to Clone () an iterator is\n         *  when it is 'at start' anyhow (DirectoryIterable). So we'll start with that...\n         *          -- LGP 2014-07-10\n         *\/\n        \/\/ Note - NOT 100% sure its OK to look for identical value telldir in another dir...\n        DIR*        dirObj          =   ::fdopendir (::dirfd (fDirIt_));\n        if (dirObj == nullptr) {\n            Execution::ThrowIfError_errno_t ();\n        }\n        try {\n            if (fCur_ == nullptr) {\n                \/\/ then we're past end end, the cloned fdopen dir one SB too!\n                Assert (::readdir (dirObj) == nullptr);\n            }\n            else {\n                ino_t   aBridgeTooFar   =   fCur_->d_ino;\n                ::rewinddir (dirObj);\n                long useOffset = ::telldir (dirObj);\n                for (;;) {\n                    dirent* tmp = ::readdir (dirObj);\n                    if (tmp == nullptr) {\n                        \/\/ somehow the file went away, so no idea where to start, and the end is as reasonable as anywhere else???\n                        useOffset = ::telldir (dirObj);\n                        DbgTrace (L\"WARN: possible bug? - ususual, and not handled well, but this can happen if the file disappears while we're cloning\");\n                        break;\n                    }\n                    else if (tmp->d_ino == aBridgeTooFar) {\n                        \/\/ then we are now pointing at the right elt, and want to seek to the PRECEEDING one so when it does a readdir it gets that item\n                        \/\/ so DONT update useOffset - just break!\n                        break;\n                    }\n                    else {\n                        \/\/ update to this reflects the last offset before we find d_ino\n                        useOffset = ::telldir (dirObj);\n                    }\n                }\n                ::seekdir (dirObj, useOffset);\n            }\n            return SharedIRepPtr (MakeSharedPtr<Rep_> (dirObj));\n        }\n        catch (...) {\n            ::closedir (dirObj);    \/\/ avoid leak\n            Execution::ReThrow ();\n        }\n#elif   qPlatform_Windows\n        return SharedIRepPtr (MakeSharedPtr<Rep_> (fDirName_, fSeekOffset_));\n#endif\n    }\n    virtual IteratorOwnerID GetOwner () const override\n    {\n        \/*\n         *  This return value allows any two DiscreteRange iterators (of the same type) to be compared.\n         *\/\n        return typeid (*this).name ();\n    }\n};\n\n\n\n\n\n\n\n\n\/*\n ********************************************************************************\n ******************** IO::FileSystem::DirectoryIterator *************************\n ********************************************************************************\n *\/\nDirectoryIterator::DirectoryIterator (const String& directoryName)\n    : Iterator<String> (MakeSharedPtr<Rep_> (directoryName))\n{\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2018.  All rights reserved\n *\/\n#ifndef _Stroika_Foundation_Traversal_DisjointDiscreteRange_inl_\n#define _Stroika_Foundation_Traversal_DisjointDiscreteRange_inl_\n\n#include \"Generator.h\"\n\nnamespace Stroika {\n    namespace Foundation {\n        namespace Traversal {\n\n            \/*\n             ********************************************************************************\n             ************* DisjointDiscreteRange<T, RANGE_TYPE>::FindHints ******************\n             ********************************************************************************\n             *\/\n            template <typename T, typename RANGE_TYPE>\n            inline DisjointDiscreteRange<T, RANGE_TYPE>::FindHints::FindHints (value_type seedPosition, bool forwardFirst)\n                : fSeedPosition (seedPosition)\n                , fForwardFirst (forwardFirst)\n            {\n            }\n\n            \/*\n             ********************************************************************************\n             ********************* DisjointDiscreteRange<T, RANGE_TYPE> *********************\n             ********************************************************************************\n             *\/\n            template <typename T, typename RANGE_TYPE>\n            inline DisjointDiscreteRange<T, RANGE_TYPE>::DisjointDiscreteRange (const RangeType& from)\n                : inherited (from)\n            {\n            }\n            template <typename T, typename RANGE_TYPE>\n            inline DisjointDiscreteRange<T, RANGE_TYPE>::DisjointDiscreteRange (const initializer_list<RangeType>& from)\n                : inherited (from)\n            {\n            }\n            template <typename T, typename RANGE_TYPE>\n            template <typename CONTAINER_OF_DISCRETERANGE_OF_T>\n            DisjointDiscreteRange<T, RANGE_TYPE>::DisjointDiscreteRange (const CONTAINER_OF_DISCRETERANGE_OF_T& from)\n                : DisjointDiscreteRange (from.begin (), from.end ())\n            {\n            }\n            template <typename T, typename RANGE_TYPE>\n            template <typename COPY_FROM_ITERATOR_OF_DISCRETERANGE_OF_T>\n            DisjointDiscreteRange<T, RANGE_TYPE>::DisjointDiscreteRange (COPY_FROM_ITERATOR_OF_DISCRETERANGE_OF_T start, COPY_FROM_ITERATOR_OF_DISCRETERANGE_OF_T end, typename enable_if<is_convertible<typename COPY_FROM_ITERATOR_OF_DISCRETERANGE_OF_T::value_type, RangeType>::value, int>::type*)\n                : inherited (start, end)\n            {\n            }\n            template <typename T, typename RANGE_TYPE>\n            template <typename COPY_FROM_ITERATOR_OF_DISCRETERANGE_OF_T>\n            DisjointDiscreteRange<T, RANGE_TYPE>::DisjointDiscreteRange (COPY_FROM_ITERATOR_OF_DISCRETERANGE_OF_T start, COPY_FROM_ITERATOR_OF_DISCRETERANGE_OF_T end, typename enable_if<is_convertible<typename COPY_FROM_ITERATOR_OF_DISCRETERANGE_OF_T::value_type, value_type>::value, int>::type*)\n                : inherited ()\n            {\n                Containers::Sequence<RangeType> srs{};\n                \/\/ @todo DEBUG why this initializer syntax produces wrong overload call ???\n                \/\/ --2015-01-02\n                \/\/Containers::SortedSet<value_type> ss { start, end };\n                Containers::SortedSet<value_type> ss = Containers::SortedSet<value_type> (start, end);\n                value_type                        startAt{};\n                Optional<value_type>              endAt;\n                for (value_type i : ss) {\n                    if (not endAt.has_value ()) {\n                        startAt = i;\n                        endAt   = i;\n                    }\n                    else if (RangeType::TraitsType::GetNext (*endAt) == i) {\n                        endAt = i;\n                    }\n                    else {\n                        Assert (startAt <= *endAt);\n                        srs.Append (RangeType (startAt, *endAt));\n                        startAt = i;\n                        endAt   = i;\n                    }\n                }\n                if (endAt) {\n                    Assert (startAt <= *endAt);\n                    srs.Append (RangeType (startAt, *endAt));\n                }\n                *this = move (THIS_CLASS_{srs});\n            }\n            template <typename T, typename RANGE_TYPE>\n            void DisjointDiscreteRange<T, RANGE_TYPE>::Add (value_type elt)\n            {\n                Containers::Sequence<RangeType> srs{this->SubRanges ()};\n                \/\/ Walk list, and if new item < than a given, either extend or insert. If contained, we have nothing todo\n                for (Iterator<RangeType> i = srs.begin (); i != srs.end (); ++i) {\n                    if (i->Contains (elt)) {\n                        return;\n                    }\n                    else if (elt == i->GetLowerBound () - 1) {\n                        srs.Update (i, DiscreteRange<value_type> (elt, i->GetUpperBound ()));\n                        \/\/ No need to check for merge adjacent cuz done by constructor\n                        *this = move (THIS_CLASS_{srs});\n                        return;\n                    }\n                    else if (elt == i->GetUpperBound () + 1) {\n                        srs.Update (i, DiscreteRange<value_type> (i->GetLowerBound (), elt));\n                        \/\/ No need to check for merge adjacent cuz done by constructor\n                        *this = move (THIS_CLASS_{srs});\n                        return;\n                    }\n                    else if (elt < i->GetLowerBound ()) {\n                        \/\/ wont be found later, so break now, and add the point\n                        break;\n                    }\n                }\n                \/\/ if not less than any there, we must append new item\n                srs.push_back (DiscreteRange<value_type> (elt, elt));\n                *this = move (THIS_CLASS_{srs});\n            }\n            template <typename T, typename RANGE_TYPE>\n            auto DisjointDiscreteRange<T, RANGE_TYPE>::Intersection (const RangeType& rhs) const -> DisjointDiscreteRange\n            {\n                \/\/ @todo could do more efficiently\n                return DisjointDiscreteRange{inherited::Intersection (rhs).SubRanges ()};\n            }\n            template <typename T, typename RANGE_TYPE>\n            auto DisjointDiscreteRange<T, RANGE_TYPE>::Intersection (const DisjointDiscreteRange& rhs) const -> DisjointDiscreteRange\n            {\n                \/\/ @todo could do more efficiently\n                return DisjointDiscreteRange{inherited::Intersection (rhs).SubRanges ()};\n            }\n            template <typename T, typename RANGE_TYPE>\n            auto DisjointDiscreteRange<T, RANGE_TYPE>::GetNext (value_type elt) const -> Optional<value_type>\n            {\n                Containers::Sequence<RangeType> subRanges{this->SubRanges ()};\n                \/\/ Find the first subrange which might contain elt, or successors\n                value_type          next = RANGE_TYPE::TraitsType::GetNext (elt);\n                Iterator<RangeType> i{subRanges.FindFirstThat ([next](const RangeType& r) -> bool { return r.GetUpperBound () >= next; })};\n                if (i) {\n                    return max (next, i->GetLowerBound ());\n                }\n                return Optional<value_type> ();\n            }\n            template <typename T, typename RANGE_TYPE>\n            auto DisjointDiscreteRange<T, RANGE_TYPE>::GetPrevious (value_type elt) const -> Optional<value_type>\n            {\n                Containers::Sequence<RangeType> subRanges{this->SubRanges ()};\n                \/\/ Find the first subrange which might contain elt, or predecessors\n                value_type          prev = RANGE_TYPE::TraitsType::GetPrevious (elt);\n                Iterator<RangeType> i{subRanges.FindFirstThat ([prev](const RangeType& r) -> bool { return r.GetUpperBound () >= prev; })};\n                if (i) {\n                    if (i->Contains (prev)) {\n                        return prev;\n                    }\n                }\n\n                \/\/ tmphack - need random-access iterators !!! for sequence at least!\n                auto prevOfIterator = [&subRanges](const Iterator<RangeType>& pOfI) -> Iterator<RangeType> {\n                    Iterator<RangeType> result = Iterator<RangeType>::GetEmptyIterator ();\n                    for (Iterator<RangeType> i = subRanges.begin (); i != subRanges.end (); ++i) {\n                        if (i == pOfI) {\n                            return result;\n                        }\n                        result = i;\n                    }\n                    return result;\n                };\n\n                \/\/ if none contain next, find the last before we pass prev\n                i = prevOfIterator (subRanges.FindFirstThat ([prev](const RangeType& r) -> bool { return r.GetUpperBound () > prev; }));\n                if (i) {\n                    Ensure (i->GetUpperBound () < prev);\n                    return i->GetUpperBound ();\n                }\n                return Optional<value_type> ();\n            }\n            template <typename T, typename RANGE_TYPE>\n            auto DisjointDiscreteRange<T, RANGE_TYPE>::Elements () const -> Iterable<value_type>\n            {\n                using UnsignedDifferenceType = typename RANGE_TYPE::UnsignedDifferenceType;\n                Containers::Sequence<RangeType> subRanges{this->SubRanges ()};\n                struct context_ {\n                    Containers::Sequence<RangeType> fSubRanges;\n                    size_t                          fSubRangeIdx{};\n                    value_type                      fCurrentSubRangeIteratorAt{};\n                    context_ () = delete;\n                    context_ (const Containers::Sequence<RangeType>& sr)\n                        : fSubRanges (sr)\n                    {\n                    }\n                    context_ (const context_& from) = default;\n                };\n                auto myContext = make_shared<context_> (context_{subRanges});\n                auto getNext   = [myContext]() -> Optional<value_type> {\n                    if (myContext->fSubRangeIdx < myContext->fSubRanges.size ()) {\n                        RangeType              curRange{myContext->fSubRanges[myContext->fSubRangeIdx]};\n                        UnsignedDifferenceType nEltsPerRange{curRange.GetDistanceSpanned ()};\n                        Assert (static_cast<UnsignedDifferenceType> (myContext->fCurrentSubRangeIteratorAt) <= nEltsPerRange);\n                        value_type result{curRange.GetLowerBound () + myContext->fCurrentSubRangeIteratorAt};\n                        if (myContext->fCurrentSubRangeIteratorAt == nEltsPerRange) {\n                            myContext->fSubRangeIdx++;\n                            myContext->fCurrentSubRangeIteratorAt = 0;\n                        }\n                        else {\n                            myContext->fCurrentSubRangeIteratorAt++;\n                        }\n                        return result;\n                    }\n                    return Optional<value_type> ();\n                };\n                return Traversal::CreateGenerator<value_type> (getNext);\n            }\n            template <typename T, typename RANGE_TYPE>\n            auto DisjointDiscreteRange<T, RANGE_TYPE>::FindFirstThat (const function<bool(value_type)>& testF) const -> Optional<value_type>\n            {\n                return this->empty () ? Optional<value_type> () : FindFirstThat (testF, FindHints (this->GetBounds ().GetLowerBound (), true));\n            }\n            template <typename T, typename RANGE_TYPE>\n            auto DisjointDiscreteRange<T, RANGE_TYPE>::FindFirstThat (const function<bool(value_type)>& testF, const FindHints& hints) const -> Optional<value_type>\n            {\n                Require (this->Contains (hints.fSeedPosition));\n                Optional<value_type> o = ScanFindAny_ (testF, hints.fSeedPosition, hints.fForwardFirst);\n                if (o) {\n                    \/\/ If we found any, then there is a first, so find scan back to find it...\n                    value_type firstTrueFor{*o};\n                    value_type i{firstTrueFor};\n                    while (testF (i)) {\n                        firstTrueFor           = i;\n                        Optional<value_type> o = GetPrevious (i);\n                        if (o) {\n                            i = *o;\n                        }\n                        else {\n                            break;\n                        }\n                    }\n                    return firstTrueFor;\n                }\n                else {\n                    return Optional<value_type> ();\n                }\n            }\n            template <typename T, typename RANGE_TYPE>\n            auto DisjointDiscreteRange<T, RANGE_TYPE>::FindLastThat (const function<bool(value_type)>& testF) const -> Optional<value_type>\n            {\n                return this->empty () ? Optional<value_type> () : FindLastThat (testF, FindHints (this->GetBounds ().GetUpperBound (), false));\n            }\n            template <typename T, typename RANGE_TYPE>\n            auto DisjointDiscreteRange<T, RANGE_TYPE>::FindLastThat (const function<bool(value_type)>& testF, const FindHints& hints) const -> Optional<value_type>\n            {\n                Require (this->Contains (hints.fSeedPosition));\n                Optional<value_type> o = ScanFindAny_ (testF, hints.fSeedPosition, hints.fForwardFirst);\n                if (o) {\n                    \/\/ If we found any, then there is a last, so find scan forwards to find it...\n                    value_type lastTrueFor{*o};\n                    value_type i{lastTrueFor};\n                    while (testF (i)) {\n                        lastTrueFor            = i;\n                        Optional<value_type> o = GetNext (i);\n                        if (o) {\n                            i = *o;\n                        }\n                        else {\n                            break;\n                        }\n                    }\n                    return lastTrueFor;\n                }\n                else {\n                    return Optional<value_type> ();\n                }\n            }\n            template <typename T, typename RANGE_TYPE>\n            auto DisjointDiscreteRange<T, RANGE_TYPE>::ScanTil_ (const function<bool(value_type)>& testF, const function<Optional<value_type> (value_type)>& iterNext, value_type seedPosition) const -> Optional<value_type>\n            {\n                value_type i{seedPosition};\n                while (not testF (i)) {\n                    Optional<value_type> o = iterNext (i);\n                    if (o) {\n                        i = *o;\n                    }\n                    else {\n                        return Optional<value_type> ();\n                    }\n                }\n                Ensure (testF (i));\n                return i;\n            }\n            template <typename T, typename RANGE_TYPE>\n            auto DisjointDiscreteRange<T, RANGE_TYPE>::ScanFindAny_ (const function<bool(value_type)>& testF, value_type seedPosition, bool forwardFirst) const -> Optional<value_type>\n            {\n                \/*\n                 *  First we must find a value\/position where testF is true. It could be forward or backward from our start hint.\n                 *  Try one direction, and then the other.\n                 *\n                 *  Only return 'IsIMissing()' if there are no values from which testF is true.\n                 *\/\n                function<Optional<value_type> (value_type)> backwardNext = [this](value_type i) { return GetPrevious (i); };\n                function<Optional<value_type> (value_type)> forwardNext  = [this](value_type i) { return GetNext (i); };\n                value_type                                  i{seedPosition};\n                Optional<value_type>                        o{ScanTil_ (testF, forwardFirst ? forwardNext : backwardNext, i)};\n                if (o) {\n                    \/\/ then we found a value scanning back for which testF is true\n                    i = *o;\n                }\n                else {\n                    \/\/ scan the other way and see if its found\n                    o = ScanTil_ (testF, forwardFirst ? backwardNext : forwardNext, i);\n                    if (o) {\n                        i = *o;\n                    }\n                    else {\n                        \/\/ if not found scanning forward, or backward, its not there!\n                        return Optional<value_type> ();\n                    }\n                }\n                Assert (testF (i));\n                return i;\n            }\n        }\n    }\n}\n#endif \/* _Stroika_Foundation_Traversal_DisjointDiscreteRange_inl_ *\/\n<commit_msg>Minor cleanup to DisjointDiscreteRange iterator implementation - fCurrentSubRangeIteratorAt unsigned offset<commit_after>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2018.  All rights reserved\n *\/\n#ifndef _Stroika_Foundation_Traversal_DisjointDiscreteRange_inl_\n#define _Stroika_Foundation_Traversal_DisjointDiscreteRange_inl_\n\n#include \"Generator.h\"\n\nnamespace Stroika {\n    namespace Foundation {\n        namespace Traversal {\n\n            \/*\n             ********************************************************************************\n             ************* DisjointDiscreteRange<T, RANGE_TYPE>::FindHints ******************\n             ********************************************************************************\n             *\/\n            template <typename T, typename RANGE_TYPE>\n            inline DisjointDiscreteRange<T, RANGE_TYPE>::FindHints::FindHints (value_type seedPosition, bool forwardFirst)\n                : fSeedPosition (seedPosition)\n                , fForwardFirst (forwardFirst)\n            {\n            }\n\n            \/*\n             ********************************************************************************\n             ********************* DisjointDiscreteRange<T, RANGE_TYPE> *********************\n             ********************************************************************************\n             *\/\n            template <typename T, typename RANGE_TYPE>\n            inline DisjointDiscreteRange<T, RANGE_TYPE>::DisjointDiscreteRange (const RangeType& from)\n                : inherited (from)\n            {\n            }\n            template <typename T, typename RANGE_TYPE>\n            inline DisjointDiscreteRange<T, RANGE_TYPE>::DisjointDiscreteRange (const initializer_list<RangeType>& from)\n                : inherited (from)\n            {\n            }\n            template <typename T, typename RANGE_TYPE>\n            template <typename CONTAINER_OF_DISCRETERANGE_OF_T>\n            DisjointDiscreteRange<T, RANGE_TYPE>::DisjointDiscreteRange (const CONTAINER_OF_DISCRETERANGE_OF_T& from)\n                : DisjointDiscreteRange (from.begin (), from.end ())\n            {\n            }\n            template <typename T, typename RANGE_TYPE>\n            template <typename COPY_FROM_ITERATOR_OF_DISCRETERANGE_OF_T>\n            DisjointDiscreteRange<T, RANGE_TYPE>::DisjointDiscreteRange (COPY_FROM_ITERATOR_OF_DISCRETERANGE_OF_T start, COPY_FROM_ITERATOR_OF_DISCRETERANGE_OF_T end, typename enable_if<is_convertible<typename COPY_FROM_ITERATOR_OF_DISCRETERANGE_OF_T::value_type, RangeType>::value, int>::type*)\n                : inherited (start, end)\n            {\n            }\n            template <typename T, typename RANGE_TYPE>\n            template <typename COPY_FROM_ITERATOR_OF_DISCRETERANGE_OF_T>\n            DisjointDiscreteRange<T, RANGE_TYPE>::DisjointDiscreteRange (COPY_FROM_ITERATOR_OF_DISCRETERANGE_OF_T start, COPY_FROM_ITERATOR_OF_DISCRETERANGE_OF_T end, typename enable_if<is_convertible<typename COPY_FROM_ITERATOR_OF_DISCRETERANGE_OF_T::value_type, value_type>::value, int>::type*)\n                : inherited ()\n            {\n                Containers::Sequence<RangeType> srs{};\n                \/\/ @todo DEBUG why this initializer syntax produces wrong overload call ???\n                \/\/ --2015-01-02\n                \/\/Containers::SortedSet<value_type> ss { start, end };\n                Containers::SortedSet<value_type> ss = Containers::SortedSet<value_type> (start, end);\n                value_type                        startAt{};\n                Optional<value_type>              endAt;\n                for (value_type i : ss) {\n                    if (not endAt.has_value ()) {\n                        startAt = i;\n                        endAt   = i;\n                    }\n                    else if (RangeType::TraitsType::GetNext (*endAt) == i) {\n                        endAt = i;\n                    }\n                    else {\n                        Assert (startAt <= *endAt);\n                        srs.Append (RangeType (startAt, *endAt));\n                        startAt = i;\n                        endAt   = i;\n                    }\n                }\n                if (endAt) {\n                    Assert (startAt <= *endAt);\n                    srs.Append (RangeType (startAt, *endAt));\n                }\n                *this = move (THIS_CLASS_{srs});\n            }\n            template <typename T, typename RANGE_TYPE>\n            void DisjointDiscreteRange<T, RANGE_TYPE>::Add (value_type elt)\n            {\n                Containers::Sequence<RangeType> srs{this->SubRanges ()};\n                \/\/ Walk list, and if new item < than a given, either extend or insert. If contained, we have nothing todo\n                for (Iterator<RangeType> i = srs.begin (); i != srs.end (); ++i) {\n                    if (i->Contains (elt)) {\n                        return;\n                    }\n                    else if (elt == i->GetLowerBound () - 1) {\n                        srs.Update (i, DiscreteRange<value_type> (elt, i->GetUpperBound ()));\n                        \/\/ No need to check for merge adjacent cuz done by constructor\n                        *this = move (THIS_CLASS_{srs});\n                        return;\n                    }\n                    else if (elt == i->GetUpperBound () + 1) {\n                        srs.Update (i, DiscreteRange<value_type> (i->GetLowerBound (), elt));\n                        \/\/ No need to check for merge adjacent cuz done by constructor\n                        *this = move (THIS_CLASS_{srs});\n                        return;\n                    }\n                    else if (elt < i->GetLowerBound ()) {\n                        \/\/ wont be found later, so break now, and add the point\n                        break;\n                    }\n                }\n                \/\/ if not less than any there, we must append new item\n                srs.push_back (DiscreteRange<value_type> (elt, elt));\n                *this = move (THIS_CLASS_{srs});\n            }\n            template <typename T, typename RANGE_TYPE>\n            auto DisjointDiscreteRange<T, RANGE_TYPE>::Intersection (const RangeType& rhs) const -> DisjointDiscreteRange\n            {\n                \/\/ @todo could do more efficiently\n                return DisjointDiscreteRange{inherited::Intersection (rhs).SubRanges ()};\n            }\n            template <typename T, typename RANGE_TYPE>\n            auto DisjointDiscreteRange<T, RANGE_TYPE>::Intersection (const DisjointDiscreteRange& rhs) const -> DisjointDiscreteRange\n            {\n                \/\/ @todo could do more efficiently\n                return DisjointDiscreteRange{inherited::Intersection (rhs).SubRanges ()};\n            }\n            template <typename T, typename RANGE_TYPE>\n            auto DisjointDiscreteRange<T, RANGE_TYPE>::GetNext (value_type elt) const -> Optional<value_type>\n            {\n                Containers::Sequence<RangeType> subRanges{this->SubRanges ()};\n                \/\/ Find the first subrange which might contain elt, or successors\n                value_type          next = RANGE_TYPE::TraitsType::GetNext (elt);\n                Iterator<RangeType> i{subRanges.FindFirstThat ([next](const RangeType& r) -> bool { return r.GetUpperBound () >= next; })};\n                if (i) {\n                    return max (next, i->GetLowerBound ());\n                }\n                return Optional<value_type> ();\n            }\n            template <typename T, typename RANGE_TYPE>\n            auto DisjointDiscreteRange<T, RANGE_TYPE>::GetPrevious (value_type elt) const -> Optional<value_type>\n            {\n                Containers::Sequence<RangeType> subRanges{this->SubRanges ()};\n                \/\/ Find the first subrange which might contain elt, or predecessors\n                value_type          prev = RANGE_TYPE::TraitsType::GetPrevious (elt);\n                Iterator<RangeType> i{subRanges.FindFirstThat ([prev](const RangeType& r) -> bool { return r.GetUpperBound () >= prev; })};\n                if (i) {\n                    if (i->Contains (prev)) {\n                        return prev;\n                    }\n                }\n\n                \/\/ tmphack - need random-access iterators !!! for sequence at least!\n                auto prevOfIterator = [&subRanges](const Iterator<RangeType>& pOfI) -> Iterator<RangeType> {\n                    Iterator<RangeType> result = Iterator<RangeType>::GetEmptyIterator ();\n                    for (Iterator<RangeType> i = subRanges.begin (); i != subRanges.end (); ++i) {\n                        if (i == pOfI) {\n                            return result;\n                        }\n                        result = i;\n                    }\n                    return result;\n                };\n\n                \/\/ if none contain next, find the last before we pass prev\n                i = prevOfIterator (subRanges.FindFirstThat ([prev](const RangeType& r) -> bool { return r.GetUpperBound () > prev; }));\n                if (i) {\n                    Ensure (i->GetUpperBound () < prev);\n                    return i->GetUpperBound ();\n                }\n                return Optional<value_type> ();\n            }\n            template <typename T, typename RANGE_TYPE>\n            auto DisjointDiscreteRange<T, RANGE_TYPE>::Elements () const -> Iterable<value_type>\n            {\n                using UnsignedDifferenceType = typename RANGE_TYPE::UnsignedDifferenceType;\n                Containers::Sequence<RangeType> subRanges{this->SubRanges ()};\n                struct context_ {\n                    Containers::Sequence<RangeType> fSubRanges;\n                    size_t                          fSubRangeIdx{};\n                    UnsignedDifferenceType          fCurrentSubRangeIteratorAt{};\n                    context_ () = delete;\n                    context_ (const Containers::Sequence<RangeType>& sr)\n                        : fSubRanges (sr)\n                    {\n                    }\n                    context_ (const context_& from) = default;\n                };\n                auto myContext = make_shared<context_> (context_{subRanges});\n                auto getNext   = [myContext]() -> Optional<value_type> {\n                    if (myContext->fSubRangeIdx < myContext->fSubRanges.size ()) {\n                        RangeType              curRange{myContext->fSubRanges[myContext->fSubRangeIdx]};\n                        UnsignedDifferenceType nEltsPerRange{curRange.GetDistanceSpanned ()};\n                        Assert (myContext->fCurrentSubRangeIteratorAt <= nEltsPerRange);\n                        value_type result{curRange.GetLowerBound () + myContext->fCurrentSubRangeIteratorAt};\n                        if (myContext->fCurrentSubRangeIteratorAt == nEltsPerRange) {\n                            myContext->fSubRangeIdx++;\n                            myContext->fCurrentSubRangeIteratorAt = 0;\n                        }\n                        else {\n                            myContext->fCurrentSubRangeIteratorAt++;\n                        }\n                        return result;\n                    }\n                    return Optional<value_type> ();\n                };\n                return Traversal::CreateGenerator<value_type> (getNext);\n            }\n            template <typename T, typename RANGE_TYPE>\n            auto DisjointDiscreteRange<T, RANGE_TYPE>::FindFirstThat (const function<bool(value_type)>& testF) const -> Optional<value_type>\n            {\n                return this->empty () ? Optional<value_type> () : FindFirstThat (testF, FindHints (this->GetBounds ().GetLowerBound (), true));\n            }\n            template <typename T, typename RANGE_TYPE>\n            auto DisjointDiscreteRange<T, RANGE_TYPE>::FindFirstThat (const function<bool(value_type)>& testF, const FindHints& hints) const -> Optional<value_type>\n            {\n                Require (this->Contains (hints.fSeedPosition));\n                Optional<value_type> o = ScanFindAny_ (testF, hints.fSeedPosition, hints.fForwardFirst);\n                if (o) {\n                    \/\/ If we found any, then there is a first, so find scan back to find it...\n                    value_type firstTrueFor{*o};\n                    value_type i{firstTrueFor};\n                    while (testF (i)) {\n                        firstTrueFor           = i;\n                        Optional<value_type> o = GetPrevious (i);\n                        if (o) {\n                            i = *o;\n                        }\n                        else {\n                            break;\n                        }\n                    }\n                    return firstTrueFor;\n                }\n                else {\n                    return Optional<value_type> ();\n                }\n            }\n            template <typename T, typename RANGE_TYPE>\n            auto DisjointDiscreteRange<T, RANGE_TYPE>::FindLastThat (const function<bool(value_type)>& testF) const -> Optional<value_type>\n            {\n                return this->empty () ? Optional<value_type> () : FindLastThat (testF, FindHints (this->GetBounds ().GetUpperBound (), false));\n            }\n            template <typename T, typename RANGE_TYPE>\n            auto DisjointDiscreteRange<T, RANGE_TYPE>::FindLastThat (const function<bool(value_type)>& testF, const FindHints& hints) const -> Optional<value_type>\n            {\n                Require (this->Contains (hints.fSeedPosition));\n                Optional<value_type> o = ScanFindAny_ (testF, hints.fSeedPosition, hints.fForwardFirst);\n                if (o) {\n                    \/\/ If we found any, then there is a last, so find scan forwards to find it...\n                    value_type lastTrueFor{*o};\n                    value_type i{lastTrueFor};\n                    while (testF (i)) {\n                        lastTrueFor            = i;\n                        Optional<value_type> o = GetNext (i);\n                        if (o) {\n                            i = *o;\n                        }\n                        else {\n                            break;\n                        }\n                    }\n                    return lastTrueFor;\n                }\n                else {\n                    return Optional<value_type> ();\n                }\n            }\n            template <typename T, typename RANGE_TYPE>\n            auto DisjointDiscreteRange<T, RANGE_TYPE>::ScanTil_ (const function<bool(value_type)>& testF, const function<Optional<value_type> (value_type)>& iterNext, value_type seedPosition) const -> Optional<value_type>\n            {\n                value_type i{seedPosition};\n                while (not testF (i)) {\n                    Optional<value_type> o = iterNext (i);\n                    if (o) {\n                        i = *o;\n                    }\n                    else {\n                        return Optional<value_type> ();\n                    }\n                }\n                Ensure (testF (i));\n                return i;\n            }\n            template <typename T, typename RANGE_TYPE>\n            auto DisjointDiscreteRange<T, RANGE_TYPE>::ScanFindAny_ (const function<bool(value_type)>& testF, value_type seedPosition, bool forwardFirst) const -> Optional<value_type>\n            {\n                \/*\n                 *  First we must find a value\/position where testF is true. It could be forward or backward from our start hint.\n                 *  Try one direction, and then the other.\n                 *\n                 *  Only return 'IsIMissing()' if there are no values from which testF is true.\n                 *\/\n                function<Optional<value_type> (value_type)> backwardNext = [this](value_type i) { return GetPrevious (i); };\n                function<Optional<value_type> (value_type)> forwardNext  = [this](value_type i) { return GetNext (i); };\n                value_type                                  i{seedPosition};\n                Optional<value_type>                        o{ScanTil_ (testF, forwardFirst ? forwardNext : backwardNext, i)};\n                if (o) {\n                    \/\/ then we found a value scanning back for which testF is true\n                    i = *o;\n                }\n                else {\n                    \/\/ scan the other way and see if its found\n                    o = ScanTil_ (testF, forwardFirst ? backwardNext : forwardNext, i);\n                    if (o) {\n                        i = *o;\n                    }\n                    else {\n                        \/\/ if not found scanning forward, or backward, its not there!\n                        return Optional<value_type> ();\n                    }\n                }\n                Assert (testF (i));\n                return i;\n            }\n        }\n    }\n}\n#endif \/* _Stroika_Foundation_Traversal_DisjointDiscreteRange_inl_ *\/\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * CityRegionImplementation.cpp\n *\n *  Created on: Feb 9, 2012\n *      Author: xyborn\n *\/\n\n#include \"CityRegion.h\"\n#include \"events\/CityUpdateEvent.h\"\n#include \"server\/zone\/Zone.h\"\n#include \"server\/zone\/objects\/area\/ActiveArea.h\"\n#include \"server\/chat\/StringIdChatParameter.h\"\n#include \"server\/zone\/objects\/scene\/SceneObject.h\"\n#include \"server\/zone\/objects\/creature\/CreatureObject.h\"\n#include \"server\/zone\/objects\/structure\/StructureObject.h\"\n#include \"server\/zone\/objects\/region\/Region.h\"\n#include \"server\/zone\/managers\/stringid\/StringIdManager.h\"\n#include \"server\/ServerCore.h\"\n#include \"server\/zone\/managers\/city\/CityManager.h\"\n#include \"server\/zone\/managers\/planet\/PlanetManager.h\"\n#include \"server\/zone\/managers\/planet\/PlanetTravelPoint.h\"\n\nvoid CityRegionImplementation::initializeTransientMembers() {\n\tManagedObjectImplementation::initializeTransientMembers();\n}\n\nvoid CityRegionImplementation::notifyLoadFromDatabase() {\n\tManagedObjectImplementation::notifyLoadFromDatabase();\n\n\tif (cityRank == CityManager::CLIENT)\n\t\treturn;\n\n\t\/\/if (zone !=)\n\n\tZone* zone = getZone();\n\n\tif (zone == NULL)\n\t\treturn;\n\n\n\tzone->addCityRegionToUpdate(_this);\n\n\tif (isRegistered())\n\t\tzone->getPlanetManager()->addRegion(_this);\n\n\t\/*\n\tint seconds = -1 * round(nextUpdateTime.miliDifference() \/ 1000.f);\n\n\tif (seconds < 0) \/\/If the update occurred in the past, force an immediate update.\n\t\tseconds = 0;\n\n\trescheduleUpdateEvent(seconds);\n\t*\/\n\n\tif (hasShuttle){\n\t\tCreatureObject* shuttle = cast<CreatureObject*>( zone->getZoneServer()->getObject(shuttleID, false));\n\n\t\tif (shuttle == NULL) {\n\t\t\thasShuttle = false;\n\t\t\tshuttleID = 0;\n\t\t\treturn;\n\t\t}\n\n\t\tfloat x = shuttle->getWorldPositionX();\n\t\tfloat y = shuttle->getWorldPositionY();\n\t\tfloat z = shuttle->getWorldPositionZ();\n\n\t\tVector3 arrivalVector(x, y, z);\n\t\tPlanetTravelPoint* planetTravelPoint = new PlanetTravelPoint(zone->getZoneName(), getRegionName(), arrivalVector, arrivalVector, shuttle);\n\t\tzone->getPlanetManager()->addPlayerCityTravelPoint(planetTravelPoint);\n\n\t\tif (shuttle != NULL)\n\t\t\tzone->getPlanetManager()->scheduleShuttle(shuttle);\n\t}\n}\n\nvoid CityRegionImplementation::initialize() {\n\tzoningEnabled = true;\n\n\tregistered = false;\n\n\tcityTreasury = 0;\n\n\tcityRank = RANK_CLIENT; \/\/Default to client city\n\n\tcityHall = NULL;\n\n\tmayorID = 0;\n\n\tshuttleID = 0;\n\n\thasShuttle = false;\n\n\tzone = NULL;\n\n\tcityUpdateEvent = NULL;\n\n\tzoningRights.setAllowOverwriteInsertPlan();\n\tzoningRights.setNullValue(0);\n\n\tcityStructureInventory.put(uint8(1), Vector<ManagedReference<SceneObject*> >());\n\tcityStructureInventory.put(uint8(2), Vector<ManagedReference<SceneObject*> >());\n\tcityStructureInventory.put(uint8(3), Vector<ManagedReference<SceneObject*> >());\n\tcityStructureInventory.put(uint8(4), Vector<ManagedReference<SceneObject*> >());\n\n\tsetLoggingName(\"CityRegion\");\n\tsetLogging(true);\n}\n\nRegion* CityRegionImplementation::addRegion(float x, float y, float radius, bool persistent) {\n\tif (zone == NULL) {\n\t\treturn NULL;\n\t}\n\n\tString temp = \"object\/region_area.iff\";\n\tSceneObject* obj = zone->getZoneServer()->createObject(temp.hashCode(), persistent ? 1 : 0);\n\n\tif (obj == NULL || !obj->isRegion()) {\n\t\treturn NULL;\n\t}\n\n\tManagedReference<Region*> region = cast<Region*>(obj);\n\tregion->setCityRegion(_this);\n\tregion->setRadius(radius);\n\tregion->initializePosition(x, 0, y);\n\tregion->setObjectName(regionName);\n\n\tif (isClientRegion())\n\t\tregion->setNoBuildArea(true);\n\n\tzone->transferObject(region, -1, false);\n\n\tregions.put(region);\n\n\treturn region;\n}\n\nvoid CityRegionImplementation::rescheduleUpdateEvent(uint32 seconds) {\n\tif (cityRank == CityManager::CLIENT)\n\t\treturn;\n\n\tif (cityUpdateEvent == NULL) {\n\t\tcityUpdateEvent = new CityUpdateEvent(_this, ServerCore::getZoneServer());\n\t} else if (cityUpdateEvent->isScheduled()) {\n\t\tcityUpdateEvent->cancel();\n\t}\n\n\tcityUpdateEvent->schedule(seconds * 1000);\n\tCore::getTaskManager()->getNextExecutionTime(cityUpdateEvent, nextUpdateTime);\n}\n\nint CityRegionImplementation::getTimeToUpdate() {\n\treturn round(nextUpdateTime.miliDifference() \/ -1000.f);\n}\n\nvoid CityRegionImplementation::notifyEnter(SceneObject* object) {\n\tobject->setCityRegion(_this);\n\n\tif (isClientRegion())\n\t\treturn;\n\n\tif (!object->isCreatureObject())\n\t\t\treturn;\n\n\tCreatureObject* creature = cast<CreatureObject*>(object);\n\n\tStringIdChatParameter params(\"city\/city\", \"city_enter_city\"); \/\/You have entered %TT (%TO).\n\tparams.setTT(getRegionName());\n\n\tUnicodeString strRank = StringIdManager::instance()->getStringId(String(\"@city\/city:rank\" + String::valueOf(cityRank)).hashCode());\n\n\tif (citySpecialization.isEmpty()) {\n\t\tparams.setTO(strRank);\n\t} else {\n\t\tUnicodeString citySpec = StringIdManager::instance()->getStringId(citySpecialization.hashCode());\n\t\tparams.setTO(strRank + \", \" + citySpec);\n\t}\n\n\tcreature->sendSystemMessage(params);\n\n\t\/\/Apply skillmods for specialization\n}\n\nvoid CityRegionImplementation::notifyExit(SceneObject* object) {\n\tobject->setCityRegion(NULL);\n\n\tif (isClientRegion())\n\t\treturn;\n\n\tif (!object->isCreatureObject())\n\t\treturn;\n\n\tCreatureObject* creature = cast<CreatureObject*>(object);\n\n\tStringIdChatParameter params(\"city\/city\", \"city_leave_city\"); \/\/You have left %TO.\n\tparams.setTO(getRegionName());\n\n\tcreature->sendSystemMessage(params);\n\n\t\/\/Remove skillmods for specialization\n}\n\nvoid CityRegionImplementation::setRegionName(const StringId& name) {\n\tregionName = name;\n}\n\nVector<ManagedReference<SceneObject*> >* CityRegionImplementation::getVendorsInCity() {\n\tVector<ManagedReference<SceneObject*> >* vendors = new Vector<ManagedReference<SceneObject*> >();\n\n\treturn vendors;\n}\n\nvoid CityRegionImplementation::addZoningRights(uint64 objectid, uint32 duration) {\n\tTime now;\n\n\tzoningRights.put(objectid, duration + now.getTime());\n}\n\nbool CityRegionImplementation::hasZoningRights(uint64 objectid) {\n\tif (isMilitiaMember(objectid))\n\t\treturn true;\n\n\tuint32 timestamp = zoningRights.get(objectid);\n\n\tif (timestamp == 0)\n\t\treturn false;\n\n\tTime now;\n\treturn (now.getTime() <= timestamp);\n}\n\nvoid CityRegionImplementation::setZone(Zone* zne) {\n\tzone = zne;\n}\n\nvoid CityRegionImplementation::setRadius(float rad) {\n\tif (regions.size() <= 0)\n\t\treturn;\n\n\tManagedReference<ActiveArea*> aa = regions.get(0).get();\n\taa->setRadius(rad);\n\n\tzone->removeObject(aa, NULL, false);\n\tzone->transferObject(aa, -1, false);\n}\n\nvoid CityRegionImplementation::destroyActiveAreas() {\n\tfor (int i = 0; i < regions.size(); ++i) {\n\t\tManagedReference<Region*> aa = regions.get(i);\n\n\t\tif (aa != NULL) {\n\t\t\taa->destroyObjectFromWorld(false);\n\t\t\taa->destroyObjectFromDatabase(true);\n\n\t\t\tregions.drop(aa);\n\t\t}\n\t}\n}\n\nString CityRegionImplementation::getRegionName() {\n\tif(!customRegionName.isEmpty())\n\t\treturn customRegionName;\n\n\treturn regionName.getFullPath();\n}\n\nvoid CityRegionImplementation::addToCityStructureInventory(uint8 rankRequired, SceneObject* structure){\n\tLocker locker(_this);\n\n\tif(cityStructureInventory.contains(rankRequired)){\n\t\tcityStructureInventory.get(rankRequired).add(structure);\n\n\t}\n\n\n}\n\nvoid CityRegionImplementation::removeFromCityStructureInventory(SceneObject* structure){\n\tLocker locker(_this);\n\n\tif(cityStructureInventory.get(uint8(1)).contains(structure))\n\t\tcityStructureInventory.get(uint8(1)).removeElement(structure);\n\n\telse if(cityStructureInventory.get(uint8(2)).contains(structure))\n\t\tcityStructureInventory.get(uint8(2)).removeElement(structure);\n\n\telse if(cityStructureInventory.get(uint8(3)).contains(structure))\n\t\t\tcityStructureInventory.get(uint8(3)).removeElement(structure);\n\n\telse if(cityStructureInventory.get(uint8(4)).contains(structure))\n\t\t\tcityStructureInventory.get(uint8(4)).removeElement(structure);\n\n\n}\n\nbool CityRegionImplementation::checkLimitedPlacementStucture(uint32 id){\n\tLocker locker(_this);\n\n\tif (limitedPlacementStructures.contains(id))\n\t\treturn true;\n\n\treturn false;\n}\n\nbool CityRegionImplementation::addLimitedPlacementStructure(uint32 id){\n\tLocker locker(_this);\n\n\tif (!limitedPlacementStructures.contains(id)){\n\t\tlimitedPlacementStructures.add(id);\n\t\treturn true;\n\t}\n\n\treturn false;\n}\n\nvoid CityRegionImplementation::removeLimitedPlacementStructure(uint32 id){\n\tLocker locker(_this);\n\n\tlimitedPlacementStructures.removeElement(id);\n\n}\n\nvoid CityRegionImplementation::destroyAllStructuresForRank(uint8 rank){\n\tLocker locker(_this);\n\n\tVector<ManagedReference<SceneObject*> >* sceneObjects = &cityStructureInventory.get(rank);\n\n\tint structureCount = sceneObjects->size();\n\tint i;\n\n\tif (structureCount > 0){\n\n\t\tfor(i = structureCount - 1; i >= 0; i--){\n\n\t\t\tManagedReference<SceneObject*> sceo = sceneObjects->get(i);\n\n\t\t\tLocker locker(sceo, _this);\n\n\t\t\tsceo->destroyObjectFromWorld(false);\n\t\t\tsceo->destroyObjectFromDatabase(true);\n\n\t\t}\n\t}\n\n\n}\n\n<commit_msg>[fixed] structures not being destroyed correctly when removing a city hall<commit_after>\/*\n * CityRegionImplementation.cpp\n *\n *  Created on: Feb 9, 2012\n *      Author: xyborn\n *\/\n\n#include \"CityRegion.h\"\n#include \"events\/CityUpdateEvent.h\"\n#include \"server\/zone\/Zone.h\"\n#include \"server\/zone\/objects\/area\/ActiveArea.h\"\n#include \"server\/chat\/StringIdChatParameter.h\"\n#include \"server\/zone\/objects\/scene\/SceneObject.h\"\n#include \"server\/zone\/objects\/creature\/CreatureObject.h\"\n#include \"server\/zone\/objects\/structure\/StructureObject.h\"\n#include \"server\/zone\/objects\/region\/Region.h\"\n#include \"server\/zone\/managers\/stringid\/StringIdManager.h\"\n#include \"server\/ServerCore.h\"\n#include \"server\/zone\/managers\/city\/CityManager.h\"\n#include \"server\/zone\/managers\/planet\/PlanetManager.h\"\n#include \"server\/zone\/managers\/planet\/PlanetTravelPoint.h\"\n#include \"server\/zone\/managers\/structure\/StructureManager.h\"\n\nvoid CityRegionImplementation::initializeTransientMembers() {\n\tManagedObjectImplementation::initializeTransientMembers();\n}\n\nvoid CityRegionImplementation::notifyLoadFromDatabase() {\n\tManagedObjectImplementation::notifyLoadFromDatabase();\n\n\tif (cityRank == CityManager::CLIENT)\n\t\treturn;\n\n\t\/\/if (zone !=)\n\n\tZone* zone = getZone();\n\n\tif (zone == NULL)\n\t\treturn;\n\n\n\tzone->addCityRegionToUpdate(_this);\n\n\tif (isRegistered())\n\t\tzone->getPlanetManager()->addRegion(_this);\n\n\t\/*\n\tint seconds = -1 * round(nextUpdateTime.miliDifference() \/ 1000.f);\n\n\tif (seconds < 0) \/\/If the update occurred in the past, force an immediate update.\n\t\tseconds = 0;\n\n\trescheduleUpdateEvent(seconds);\n\t*\/\n\n\tif (hasShuttle){\n\t\tCreatureObject* shuttle = cast<CreatureObject*>( zone->getZoneServer()->getObject(shuttleID, false));\n\n\t\tif (shuttle == NULL) {\n\t\t\thasShuttle = false;\n\t\t\tshuttleID = 0;\n\t\t\treturn;\n\t\t}\n\n\t\tfloat x = shuttle->getWorldPositionX();\n\t\tfloat y = shuttle->getWorldPositionY();\n\t\tfloat z = shuttle->getWorldPositionZ();\n\n\t\tVector3 arrivalVector(x, y, z);\n\t\tPlanetTravelPoint* planetTravelPoint = new PlanetTravelPoint(zone->getZoneName(), getRegionName(), arrivalVector, arrivalVector, shuttle);\n\t\tzone->getPlanetManager()->addPlayerCityTravelPoint(planetTravelPoint);\n\n\t\tif (shuttle != NULL)\n\t\t\tzone->getPlanetManager()->scheduleShuttle(shuttle);\n\t}\n}\n\nvoid CityRegionImplementation::initialize() {\n\tzoningEnabled = true;\n\n\tregistered = false;\n\n\tcityTreasury = 0;\n\n\tcityRank = RANK_CLIENT; \/\/Default to client city\n\n\tcityHall = NULL;\n\n\tmayorID = 0;\n\n\tshuttleID = 0;\n\n\thasShuttle = false;\n\n\tzone = NULL;\n\n\tcityUpdateEvent = NULL;\n\n\tzoningRights.setAllowOverwriteInsertPlan();\n\tzoningRights.setNullValue(0);\n\n\tcityStructureInventory.put(uint8(1), Vector<ManagedReference<SceneObject*> >());\n\tcityStructureInventory.put(uint8(2), Vector<ManagedReference<SceneObject*> >());\n\tcityStructureInventory.put(uint8(3), Vector<ManagedReference<SceneObject*> >());\n\tcityStructureInventory.put(uint8(4), Vector<ManagedReference<SceneObject*> >());\n\n\tsetLoggingName(\"CityRegion\");\n\tsetLogging(true);\n}\n\nRegion* CityRegionImplementation::addRegion(float x, float y, float radius, bool persistent) {\n\tif (zone == NULL) {\n\t\treturn NULL;\n\t}\n\n\tString temp = \"object\/region_area.iff\";\n\tSceneObject* obj = zone->getZoneServer()->createObject(temp.hashCode(), persistent ? 1 : 0);\n\n\tif (obj == NULL || !obj->isRegion()) {\n\t\treturn NULL;\n\t}\n\n\tManagedReference<Region*> region = cast<Region*>(obj);\n\tregion->setCityRegion(_this);\n\tregion->setRadius(radius);\n\tregion->initializePosition(x, 0, y);\n\tregion->setObjectName(regionName);\n\n\tif (isClientRegion())\n\t\tregion->setNoBuildArea(true);\n\n\tzone->transferObject(region, -1, false);\n\n\tregions.put(region);\n\n\treturn region;\n}\n\nvoid CityRegionImplementation::rescheduleUpdateEvent(uint32 seconds) {\n\tif (cityRank == CityManager::CLIENT)\n\t\treturn;\n\n\tif (cityUpdateEvent == NULL) {\n\t\tcityUpdateEvent = new CityUpdateEvent(_this, ServerCore::getZoneServer());\n\t} else if (cityUpdateEvent->isScheduled()) {\n\t\tcityUpdateEvent->cancel();\n\t}\n\n\tcityUpdateEvent->schedule(seconds * 1000);\n\tCore::getTaskManager()->getNextExecutionTime(cityUpdateEvent, nextUpdateTime);\n}\n\nint CityRegionImplementation::getTimeToUpdate() {\n\treturn round(nextUpdateTime.miliDifference() \/ -1000.f);\n}\n\nvoid CityRegionImplementation::notifyEnter(SceneObject* object) {\n\tobject->setCityRegion(_this);\n\n\tif (isClientRegion())\n\t\treturn;\n\n\tif (!object->isCreatureObject())\n\t\t\treturn;\n\n\tCreatureObject* creature = cast<CreatureObject*>(object);\n\n\tStringIdChatParameter params(\"city\/city\", \"city_enter_city\"); \/\/You have entered %TT (%TO).\n\tparams.setTT(getRegionName());\n\n\tUnicodeString strRank = StringIdManager::instance()->getStringId(String(\"@city\/city:rank\" + String::valueOf(cityRank)).hashCode());\n\n\tif (citySpecialization.isEmpty()) {\n\t\tparams.setTO(strRank);\n\t} else {\n\t\tUnicodeString citySpec = StringIdManager::instance()->getStringId(citySpecialization.hashCode());\n\t\tparams.setTO(strRank + \", \" + citySpec);\n\t}\n\n\tcreature->sendSystemMessage(params);\n\n\t\/\/Apply skillmods for specialization\n}\n\nvoid CityRegionImplementation::notifyExit(SceneObject* object) {\n\tobject->setCityRegion(NULL);\n\n\tif (isClientRegion())\n\t\treturn;\n\n\tif (!object->isCreatureObject())\n\t\treturn;\n\n\tCreatureObject* creature = cast<CreatureObject*>(object);\n\n\tStringIdChatParameter params(\"city\/city\", \"city_leave_city\"); \/\/You have left %TO.\n\tparams.setTO(getRegionName());\n\n\tcreature->sendSystemMessage(params);\n\n\t\/\/Remove skillmods for specialization\n}\n\nvoid CityRegionImplementation::setRegionName(const StringId& name) {\n\tregionName = name;\n}\n\nVector<ManagedReference<SceneObject*> >* CityRegionImplementation::getVendorsInCity() {\n\tVector<ManagedReference<SceneObject*> >* vendors = new Vector<ManagedReference<SceneObject*> >();\n\n\treturn vendors;\n}\n\nvoid CityRegionImplementation::addZoningRights(uint64 objectid, uint32 duration) {\n\tTime now;\n\n\tzoningRights.put(objectid, duration + now.getTime());\n}\n\nbool CityRegionImplementation::hasZoningRights(uint64 objectid) {\n\tif (isMilitiaMember(objectid))\n\t\treturn true;\n\n\tuint32 timestamp = zoningRights.get(objectid);\n\n\tif (timestamp == 0)\n\t\treturn false;\n\n\tTime now;\n\treturn (now.getTime() <= timestamp);\n}\n\nvoid CityRegionImplementation::setZone(Zone* zne) {\n\tzone = zne;\n}\n\nvoid CityRegionImplementation::setRadius(float rad) {\n\tif (regions.size() <= 0)\n\t\treturn;\n\n\tManagedReference<ActiveArea*> aa = regions.get(0).get();\n\taa->setRadius(rad);\n\n\tzone->removeObject(aa, NULL, false);\n\tzone->transferObject(aa, -1, false);\n}\n\nvoid CityRegionImplementation::destroyActiveAreas() {\n\tfor (int i = 0; i < regions.size(); ++i) {\n\t\tManagedReference<Region*> aa = regions.get(i);\n\n\t\tif (aa != NULL) {\n\t\t\taa->destroyObjectFromWorld(false);\n\t\t\taa->destroyObjectFromDatabase(true);\n\n\t\t\tregions.drop(aa);\n\t\t}\n\t}\n}\n\nString CityRegionImplementation::getRegionName() {\n\tif(!customRegionName.isEmpty())\n\t\treturn customRegionName;\n\n\treturn regionName.getFullPath();\n}\n\nvoid CityRegionImplementation::addToCityStructureInventory(uint8 rankRequired, SceneObject* structure){\n\tLocker locker(_this);\n\n\tif(cityStructureInventory.contains(rankRequired)){\n\t\tcityStructureInventory.get(rankRequired).add(structure);\n\n\t}\n\n\n}\n\nvoid CityRegionImplementation::removeFromCityStructureInventory(SceneObject* structure){\n\tLocker locker(_this);\n\n\tif(cityStructureInventory.get(uint8(1)).contains(structure))\n\t\tcityStructureInventory.get(uint8(1)).removeElement(structure);\n\n\telse if(cityStructureInventory.get(uint8(2)).contains(structure))\n\t\tcityStructureInventory.get(uint8(2)).removeElement(structure);\n\n\telse if(cityStructureInventory.get(uint8(3)).contains(structure))\n\t\t\tcityStructureInventory.get(uint8(3)).removeElement(structure);\n\n\telse if(cityStructureInventory.get(uint8(4)).contains(structure))\n\t\t\tcityStructureInventory.get(uint8(4)).removeElement(structure);\n\n\n}\n\nbool CityRegionImplementation::checkLimitedPlacementStucture(uint32 id){\n\tLocker locker(_this);\n\n\tif (limitedPlacementStructures.contains(id))\n\t\treturn true;\n\n\treturn false;\n}\n\nbool CityRegionImplementation::addLimitedPlacementStructure(uint32 id){\n\tLocker locker(_this);\n\n\tif (!limitedPlacementStructures.contains(id)){\n\t\tlimitedPlacementStructures.add(id);\n\t\treturn true;\n\t}\n\n\treturn false;\n}\n\nvoid CityRegionImplementation::removeLimitedPlacementStructure(uint32 id){\n\tLocker locker(_this);\n\n\tlimitedPlacementStructures.removeElement(id);\n\n}\n\nvoid CityRegionImplementation::destroyAllStructuresForRank(uint8 rank){\n\tLocker locker(_this);\n\n\tVector<ManagedReference<SceneObject*> >* sceneObjects = &cityStructureInventory.get(rank);\n\n\tint structureCount = sceneObjects->size();\n\tint i;\n\n\tStructureManager* manager = zone->getStructureManager();\n\n\tif (structureCount > 0){\n\n\t\tfor(i = structureCount - 1; i >= 0; i--){\n\n\t\t\tManagedReference<SceneObject*> sceo = sceneObjects->get(i);\n\n\t\t\tLocker locker(sceo, _this);\n\n\t\t\tmanager->destroyStructure(sceo);\n\t\t}\n\t}\n\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * CityRegionImplementation.cpp\n *\n *  Created on: Feb 9, 2012\n *      Author: xyborn\n *\/\n\n#include \"CityRegion.h\"\n#include \"events\/CityUpdateEvent.h\"\n#include \"server\/zone\/Zone.h\"\n#include \"server\/zone\/objects\/area\/ActiveArea.h\"\n#include \"server\/chat\/StringIdChatParameter.h\"\n#include \"server\/zone\/objects\/scene\/SceneObject.h\"\n#include \"server\/zone\/objects\/creature\/CreatureObject.h\"\n#include \"server\/zone\/objects\/structure\/StructureObject.h\"\n#include \"server\/zone\/objects\/region\/Region.h\"\n#include \"server\/zone\/managers\/stringid\/StringIdManager.h\"\n#include \"server\/ServerCore.h\"\n#include \"server\/zone\/managers\/city\/CityManager.h\"\n#include \"server\/zone\/managers\/planet\/PlanetManager.h\"\n#include \"server\/zone\/managers\/planet\/PlanetTravelPoint.h\"\n#include \"server\/zone\/managers\/structure\/StructureManager.h\"\n#include \"server\/zone\/objects\/building\/BuildingObject.h\"\n#include \"server\/zone\/objects\/player\/PlayerObject.h\"\n#include \"server\/zone\/objects\/tangible\/terminal\/vendor\/bazaar\/BazaarTerminal.h\"\n\nvoid CityRegionImplementation::initializeTransientMembers() {\n\tManagedObjectImplementation::initializeTransientMembers();\n}\n\nvoid CityRegionImplementation::notifyLoadFromDatabase() {\n\tManagedObjectImplementation::notifyLoadFromDatabase();\n\n\tif (cityRank == CityManager::CLIENT)\n\t\treturn;\n\n\t\/\/if (zone !=)\n\n\tZone* zone = getZone();\n\n\tif (zone == NULL)\n\t\treturn;\n\n\n\tzone->addCityRegionToUpdate(_this);\n\n\tif (isRegistered())\n\t\tzone->getPlanetManager()->addRegion(_this);\n\n\t\/*\n\tint seconds = -1 * round(nextUpdateTime.miliDifference() \/ 1000.f);\n\n\tif (seconds < 0) \/\/If the update occurred in the past, force an immediate update.\n\t\tseconds = 0;\n\n\trescheduleUpdateEvent(seconds);\n\t *\/\n\n\tif (hasShuttle){\n\t\tCreatureObject* shuttle = cast<CreatureObject*>( zone->getZoneServer()->getObject(shuttleID, false));\n\n\t\tif (shuttle == NULL) {\n\t\t\thasShuttle = false;\n\t\t\tshuttleID = 0;\n\t\t\treturn;\n\t\t}\n\n\t\tfloat x = shuttle->getWorldPositionX();\n\t\tfloat y = shuttle->getWorldPositionY();\n\t\tfloat z = shuttle->getWorldPositionZ();\n\n\t\tVector3 arrivalVector(x, y, z);\n\t\tPlanetTravelPoint* planetTravelPoint = new PlanetTravelPoint(zone->getZoneName(), getRegionName(), arrivalVector, arrivalVector, shuttle);\n\t\tzone->getPlanetManager()->addPlayerCityTravelPoint(planetTravelPoint);\n\n\t\tif (shuttle != NULL)\n\t\t\tzone->getPlanetManager()->scheduleShuttle(shuttle);\n\t}\n}\n\nvoid CityRegionImplementation::initialize() {\n\tzoningEnabled = true;\n\n\tregistered = false;\n\n\tcityTreasury = 0;\n\n\tcityRank = RANK_CLIENT; \/\/Default to client city\n\n\tcityHall = NULL;\n\n\tmayorID = 0;\n\n\tshuttleID = 0;\n\n\thasShuttle = false;\n\n\tzone = NULL;\n\n\tcityUpdateEvent = NULL;\n\n\tzoningRights.setAllowOverwriteInsertPlan();\n\tzoningRights.setNullValue(0);\n\n\tlimitedPlacementStructures.setNoDuplicateInsertPlan();\n\n\tcityStructureInventory.put(uint8(1), SortedVector<ManagedReference<SceneObject*> >());\n\tcityStructureInventory.put(uint8(2), SortedVector<ManagedReference<SceneObject*> >());\n\tcityStructureInventory.put(uint8(3), SortedVector<ManagedReference<SceneObject*> >());\n\tcityStructureInventory.put(uint8(4), SortedVector<ManagedReference<SceneObject*> >());\n\n\tcityStructureInventory.get(0).setNoDuplicateInsertPlan();\n\tcityStructureInventory.get(1).setNoDuplicateInsertPlan();\n\tcityStructureInventory.get(2).setNoDuplicateInsertPlan();\n\tcityStructureInventory.get(3).setNoDuplicateInsertPlan();\n\n\tcityMissionTerminals.setNoDuplicateInsertPlan();\n\tcityDecorations.setNoDuplicateInsertPlan();\n\tcitySkillTrainers.setNoDuplicateInsertPlan();\n\n\tbazaars.setNoDuplicateInsertPlan();\n\tbazaars.setNullValue(NULL);\n\n\tnoBuildArea = NULL;\n\n\tsetLoggingName(\"CityRegion\");\n\tsetLogging(true);\n\n}\n\nRegion* CityRegionImplementation::addRegion(float x, float y, float radius, bool persistent) {\n\tif (zone == NULL) {\n\t\treturn NULL;\n\t}\n\n\tString temp = \"object\/region_area.iff\";\n\tSceneObject* obj = zone->getZoneServer()->createObject(temp.hashCode(), persistent ? 1 : 0);\n\n\tif (obj == NULL || !obj->isRegion()) {\n\t\treturn NULL;\n\t}\n\n\tManagedReference<Region*> region = cast<Region*>(obj);\n\tregion->setCityRegion(_this);\n\tregion->setRadius(radius);\n\tregion->initializePosition(x, 0, y);\n\tregion->setObjectName(regionName);\n\n\tif (isClientRegion())\n\t\tregion->setNoBuildArea(true);\n\n\tzone->transferObject(region, -1, false);\n\n\tregions.put(region);\n\n\treturn region;\n}\n\nvoid CityRegionImplementation::rescheduleUpdateEvent(uint32 seconds) {\n\tif (cityRank == CityManager::CLIENT)\n\t\treturn;\n\n\tif (cityUpdateEvent == NULL) {\n\t\tcityUpdateEvent = new CityUpdateEvent(_this, ServerCore::getZoneServer());\n\t} else if (cityUpdateEvent->isScheduled()) {\n\t\tcityUpdateEvent->cancel();\n\t}\n\n\tcityUpdateEvent->schedule(seconds * 1000);\n\tCore::getTaskManager()->getNextExecutionTime(cityUpdateEvent, nextUpdateTime);\n}\n\nint CityRegionImplementation::getTimeToUpdate() {\n\treturn round(nextUpdateTime.miliDifference() \/ -1000.f);\n}\n\nvoid CityRegionImplementation::notifyEnter(SceneObject* object) {\n\tobject->setCityRegion(_this);\n\n\tBazaarTerminal* term = cast<BazaarTerminal*>(object);\n\n\tif (term != NULL) {\n\t\tbazaars.put(term->getObjectID(), term);\n\t}\n\n\tif (isClientRegion())\n\t\treturn;\n\n\tif (object->isCreatureObject()){\n\t\tCreatureObject* creature = cast<CreatureObject*>(object);\n\n\t\tStringIdChatParameter params(\"city\/city\", \"city_enter_city\"); \/\/You have entered %TT (%TO).\n\t\tparams.setTT(getRegionName());\n\n\t\tUnicodeString strRank = StringIdManager::instance()->getStringId(String(\"@city\/city:rank\" + String::valueOf(cityRank)).hashCode());\n\n\t\tif (citySpecialization.isEmpty()) {\n\t\t\tparams.setTO(strRank);\n\t\t}\n\t\telse {\n\t\t\tUnicodeString citySpec = StringIdManager::instance()->getStringId(citySpecialization.hashCode());\n\t\t\tparams.setTO(strRank + \", \" + citySpec);\n\t\t}\n\n\t\tcreature->sendSystemMessage(params);\n\t}\n\n\tif (object->isBuildingObject()){\n\t\tBuildingObject* building = cast<BuildingObject*>(object);\n\n\t\tuint64 creatureID = building->getOwnerObjectID();\n\n\t\tif (!citizenList.contains(creatureID)) {\n\t\t\tCreatureObject* owner = building->getOwnerCreatureObject();\n\n\t\t\tif (owner != NULL) {\n\t\t\t\tPlayerObject* playerObject = owner->getPlayerObject();\n\n\t\t\t\tif (playerObject != NULL && playerObject->getDeclaredResidence() == building) {\n\t\t\t\t\taddCitizen(creatureID);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/Apply skillmods for specialization\n}\n\nvoid CityRegionImplementation::notifyExit(SceneObject* object) {\n\tobject->setCityRegion(NULL);\n\n\tBazaarTerminal* term = cast<BazaarTerminal*>(object);\n\n\tif (term != NULL) {\n\t\tbazaars.drop(term->getObjectID());\n\t}\n\n\tif (isClientRegion())\n\t\treturn;\n\n\tif (object->isCreatureObject()){\n\n\t\tCreatureObject* creature = cast<CreatureObject*>(object);\n\n\t\tStringIdChatParameter params(\"city\/city\", \"city_leave_city\"); \/\/You have left %TO.\n\t\tparams.setTO(getRegionName());\n\n\t\tcreature->sendSystemMessage(params);\n\n\t\t\/\/Remove skillmods for specialization\n\t}\n\n\n\tif (object->isBuildingObject()){\n\n\t\tfloat x = object->getWorldPositionX();\n\t\tfloat y = object->getWorldPositionY();\n\n\t\t\/\/StructureObject* structure = cast<StructureObject*>(object);\n\n\t\tBuildingObject* building = cast<BuildingObject*>(object);\n\n\t\tuint64 creatureID = building->getOwnerObjectID();\n\n\t\tif (citizenList.contains(creatureID)) {\n\t\t\tCreatureObject* owner = building->getOwnerCreatureObject();\n\n\t\t\tif (owner != NULL) {\n\t\t\t\tPlayerObject* playerObject = owner->getPlayerObject();\n\n\t\t\t\tif (playerObject != NULL && playerObject->getDeclaredResidence() == building){\n\t\t\t\t\tremoveCitizen(creatureID);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t}\n}\n\nvoid CityRegionImplementation::setRegionName(const StringId& name) {\n\tregionName = name;\n}\n\nVector<ManagedReference<SceneObject*> >* CityRegionImplementation::getVendorsInCity() {\n\tVector<ManagedReference<SceneObject*> >* vendors = new Vector<ManagedReference<SceneObject*> >();\n\n\treturn vendors;\n}\n\nvoid CityRegionImplementation::addZoningRights(uint64 objectid, uint32 duration) {\n\tTime now;\n\n\tzoningRights.put(objectid, duration + now.getTime());\n}\n\nbool CityRegionImplementation::hasZoningRights(uint64 objectid) {\n\tif (isMilitiaMember(objectid))\n\t\treturn true;\n\n\tuint32 timestamp = zoningRights.get(objectid);\n\n\tif (timestamp == 0)\n\t\treturn false;\n\n\tTime now;\n\treturn (now.getTime() <= timestamp);\n}\n\nvoid CityRegionImplementation::setZone(Zone* zne) {\n\tzone = zne;\n}\n\nvoid CityRegionImplementation::setRadius(float rad) {\n\tif (regions.size() <= 0)\n\t\treturn;\n\n\tManagedReference<ActiveArea*> aa = regions.get(0).get();\n\taa->setRadius(rad);\n\n\tzone->removeObject(aa, NULL, false);\n\tzone->transferObject(aa, -1, false);\n\n\tupdateNoBuildArea(getPositionX(), getPositionY(), rad * 2);\n}\n\nvoid CityRegionImplementation::destroyActiveAreas() {\n\tfor (int i = 0; i < regions.size(); ++i) {\n\t\tManagedReference<Region*> aa = regions.get(i);\n\n\t\tif (aa != NULL) {\n\t\t\taa->destroyObjectFromWorld(false);\n\t\t\taa->destroyObjectFromDatabase(true);\n\n\t\t\tregions.drop(aa);\n\t\t}\n\t}\n}\n\nString CityRegionImplementation::getRegionName() {\n\tif(!customRegionName.isEmpty())\n\t\treturn customRegionName;\n\n\treturn regionName.getFullPath();\n}\n\nvoid CityRegionImplementation::addToCityStructureInventory(uint8 rankRequired, SceneObject* structure){\n\tLocker locker(_this);\n\n\tif(cityStructureInventory.contains(rankRequired)){\n\t\tcityStructureInventory.get(rankRequired).put(structure);\n\n\t}\n\n\n}\n\nvoid CityRegionImplementation::removeFromCityStructureInventory(SceneObject* structure){\n\tLocker locker(_this);\n\n\tif(cityStructureInventory.get(uint8(1)).contains(structure))\n\t\tcityStructureInventory.get(uint8(1)).drop(structure);\n\n\telse if(cityStructureInventory.get(uint8(2)).contains(structure))\n\t\tcityStructureInventory.get(uint8(2)).drop(structure);\n\n\telse if(cityStructureInventory.get(uint8(3)).contains(structure))\n\t\tcityStructureInventory.get(uint8(3)).drop(structure);\n\n\telse if(cityStructureInventory.get(uint8(4)).contains(structure))\n\t\tcityStructureInventory.get(uint8(4)).drop(structure);\n\n\n}\n\nbool CityRegionImplementation::checkLimitedPlacementStucture(uint32 id){\n\tLocker locker(_this);\n\n\tif (limitedPlacementStructures.contains(id))\n\t\treturn true;\n\n\treturn false;\n}\n\nbool CityRegionImplementation::addLimitedPlacementStructure(uint32 id){\n\tLocker locker(_this);\n\n\tif (!limitedPlacementStructures.contains(id)){\n\t\tlimitedPlacementStructures.put(id);\n\t\treturn true;\n\t}\n\n\treturn false;\n}\n\nvoid CityRegionImplementation::removeLimitedPlacementStructure(uint32 id){\n\tLocker locker(_this);\n\n\tlimitedPlacementStructures.drop(id);\n\n}\n\nvoid CityRegionImplementation::destroyAllStructuresForRank(uint8 rank){\n\tLocker locker(_this);\n\n\tSortedVector<ManagedReference<SceneObject*> >* sceneObjects = &cityStructureInventory.get(rank);\n\n\tint structureCount = sceneObjects->size();\n\tint i;\n\n\n\tif (structureCount > 0) {\n\t\tfor (i = structureCount - 1; i >= 0; i--) {\n\t\t\tManagedReference<SceneObject*> sceo = sceneObjects->get(i);\n\n\t\t\tLocker locker(sceo, _this);\n\n\t\t\tZone* zoneObject = sceo->getZone();\n\n\t\t\tif (zoneObject != NULL) {\n\t\t\t\tStructureManager* manager = zoneObject->getStructureManager();\n\n\t\t\t\tif (manager != NULL) {\n\t\t\t\t\tif (sceo->isStructureObject()) {\n\t\t\t\t\t\tmanager->destroyStructure(cast<StructureObject*>(sceo.get()));\n\t\t\t\t\t} else {\n\t\t\t\t\t\tsceo->destroyObjectFromWorld(true);\n\t\t\t\t\t\tsceo->destroyObjectFromDatabase(true);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\tsceneObjects->drop(sceo);\n\t\t}\n\t}\n}\n\nvoid CityRegionImplementation::updateMilitia(){\n\n\tLocker locker (_this);\n\n\tuint64 objectID;\n\n\tfor (int i = militiaMembers.size() - 1;i >= 0; --i){\n\n\t\tobjectID = militiaMembers.get(i);\n\n\t\tif (!isCitizen(objectID))\n\t\t\tremoveMilitiaMember(objectID);\n\t}\n}\n\nvoid CityRegionImplementation::removeAllTerminals(){\n\tfor (int i = 0; i < cityMissionTerminals.size(); i++){\n\t\tcityMissionTerminals.get(i)->destroyObjectFromWorld(false);\n\t\tcityMissionTerminals.get(i)->destroyObjectFromDatabase(false);\n\t}\n\n\tcityMissionTerminals.removeAll();\n}\n\nvoid CityRegionImplementation::removeAllSkillTrainers(){\n\n\tfor (int i = 0; i < citySkillTrainers.size(); i++){\n\t\tcitySkillTrainers.get(i)->destroyObjectFromWorld(false);\n\t\tcitySkillTrainers.get(i)->destroyObjectFromDatabase(false);\n\t}\n\n\tcitySkillTrainers.removeAll();\n}\n\nvoid CityRegionImplementation::updateNoBuildArea(float x, float y, float radius) {\n\n\tif(noBuildArea != NULL)\n\t\tzone->removeObject(noBuildArea, NULL, false);\n\telse {\n\t\tuint32 crc = String(\"object\/active_area.iff\").hashCode();\n\t\tnoBuildArea = cast<ActiveArea*>(zone->getZoneServer()->createObject(crc, 1));\n\t\tnoBuildArea->setNoBuildArea(true);\n\t}\n\tnoBuildArea->initializePosition(x, 0, y);\n\tnoBuildArea->setRadius(radius);\n\tzone->transferObject(noBuildArea, -1, false);\n}\n\n<commit_msg>(unstable)[Fixed] City regions to remove nobuild<commit_after>\/*\n * CityRegionImplementation.cpp\n *\n *  Created on: Feb 9, 2012\n *      Author: xyborn\n *\/\n\n#include \"CityRegion.h\"\n#include \"events\/CityUpdateEvent.h\"\n#include \"server\/zone\/Zone.h\"\n#include \"server\/zone\/objects\/area\/ActiveArea.h\"\n#include \"server\/chat\/StringIdChatParameter.h\"\n#include \"server\/zone\/objects\/scene\/SceneObject.h\"\n#include \"server\/zone\/objects\/creature\/CreatureObject.h\"\n#include \"server\/zone\/objects\/structure\/StructureObject.h\"\n#include \"server\/zone\/objects\/region\/Region.h\"\n#include \"server\/zone\/managers\/stringid\/StringIdManager.h\"\n#include \"server\/ServerCore.h\"\n#include \"server\/zone\/managers\/city\/CityManager.h\"\n#include \"server\/zone\/managers\/planet\/PlanetManager.h\"\n#include \"server\/zone\/managers\/planet\/PlanetTravelPoint.h\"\n#include \"server\/zone\/managers\/structure\/StructureManager.h\"\n#include \"server\/zone\/objects\/building\/BuildingObject.h\"\n#include \"server\/zone\/objects\/player\/PlayerObject.h\"\n#include \"server\/zone\/objects\/tangible\/terminal\/vendor\/bazaar\/BazaarTerminal.h\"\n\nvoid CityRegionImplementation::initializeTransientMembers() {\n\tManagedObjectImplementation::initializeTransientMembers();\n}\n\nvoid CityRegionImplementation::notifyLoadFromDatabase() {\n\tManagedObjectImplementation::notifyLoadFromDatabase();\n\n\tif (cityRank == CityManager::CLIENT)\n\t\treturn;\n\n\t\/\/if (zone !=)\n\n\tZone* zone = getZone();\n\n\tif (zone == NULL)\n\t\treturn;\n\n\n\tzone->addCityRegionToUpdate(_this);\n\n\tif (isRegistered())\n\t\tzone->getPlanetManager()->addRegion(_this);\n\n\t\/*\n\tint seconds = -1 * round(nextUpdateTime.miliDifference() \/ 1000.f);\n\n\tif (seconds < 0) \/\/If the update occurred in the past, force an immediate update.\n\t\tseconds = 0;\n\n\trescheduleUpdateEvent(seconds);\n\t *\/\n\n\tif (hasShuttle){\n\t\tCreatureObject* shuttle = cast<CreatureObject*>( zone->getZoneServer()->getObject(shuttleID, false));\n\n\t\tif (shuttle == NULL) {\n\t\t\thasShuttle = false;\n\t\t\tshuttleID = 0;\n\t\t\treturn;\n\t\t}\n\n\t\tfloat x = shuttle->getWorldPositionX();\n\t\tfloat y = shuttle->getWorldPositionY();\n\t\tfloat z = shuttle->getWorldPositionZ();\n\n\t\tVector3 arrivalVector(x, y, z);\n\t\tPlanetTravelPoint* planetTravelPoint = new PlanetTravelPoint(zone->getZoneName(), getRegionName(), arrivalVector, arrivalVector, shuttle);\n\t\tzone->getPlanetManager()->addPlayerCityTravelPoint(planetTravelPoint);\n\n\t\tif (shuttle != NULL)\n\t\t\tzone->getPlanetManager()->scheduleShuttle(shuttle);\n\t}\n}\n\nvoid CityRegionImplementation::initialize() {\n\tzoningEnabled = true;\n\n\tregistered = false;\n\n\tcityTreasury = 0;\n\n\tcityRank = RANK_CLIENT; \/\/Default to client city\n\n\tcityHall = NULL;\n\n\tmayorID = 0;\n\n\tshuttleID = 0;\n\n\thasShuttle = false;\n\n\tzone = NULL;\n\n\tcityUpdateEvent = NULL;\n\n\tzoningRights.setAllowOverwriteInsertPlan();\n\tzoningRights.setNullValue(0);\n\n\tlimitedPlacementStructures.setNoDuplicateInsertPlan();\n\n\tcityStructureInventory.put(uint8(1), SortedVector<ManagedReference<SceneObject*> >());\n\tcityStructureInventory.put(uint8(2), SortedVector<ManagedReference<SceneObject*> >());\n\tcityStructureInventory.put(uint8(3), SortedVector<ManagedReference<SceneObject*> >());\n\tcityStructureInventory.put(uint8(4), SortedVector<ManagedReference<SceneObject*> >());\n\n\tcityStructureInventory.get(0).setNoDuplicateInsertPlan();\n\tcityStructureInventory.get(1).setNoDuplicateInsertPlan();\n\tcityStructureInventory.get(2).setNoDuplicateInsertPlan();\n\tcityStructureInventory.get(3).setNoDuplicateInsertPlan();\n\n\tcityMissionTerminals.setNoDuplicateInsertPlan();\n\tcityDecorations.setNoDuplicateInsertPlan();\n\tcitySkillTrainers.setNoDuplicateInsertPlan();\n\n\tbazaars.setNoDuplicateInsertPlan();\n\tbazaars.setNullValue(NULL);\n\n\tnoBuildArea = NULL;\n\n\tsetLoggingName(\"CityRegion\");\n\tsetLogging(true);\n\n}\n\nRegion* CityRegionImplementation::addRegion(float x, float y, float radius, bool persistent) {\n\tif (zone == NULL) {\n\t\treturn NULL;\n\t}\n\n\tString temp = \"object\/region_area.iff\";\n\tSceneObject* obj = zone->getZoneServer()->createObject(temp.hashCode(), persistent ? 1 : 0);\n\n\tif (obj == NULL || !obj->isRegion()) {\n\t\treturn NULL;\n\t}\n\n\tManagedReference<Region*> region = cast<Region*>(obj);\n\tregion->setCityRegion(_this);\n\tregion->setRadius(radius);\n\tregion->initializePosition(x, 0, y);\n\tregion->setObjectName(regionName);\n\n\tif (isClientRegion())\n\t\tregion->setNoBuildArea(true);\n\n\tzone->transferObject(region, -1, false);\n\n\tregions.put(region);\n\n\treturn region;\n}\n\nvoid CityRegionImplementation::rescheduleUpdateEvent(uint32 seconds) {\n\tif (cityRank == CityManager::CLIENT)\n\t\treturn;\n\n\tif (cityUpdateEvent == NULL) {\n\t\tcityUpdateEvent = new CityUpdateEvent(_this, ServerCore::getZoneServer());\n\t} else if (cityUpdateEvent->isScheduled()) {\n\t\tcityUpdateEvent->cancel();\n\t}\n\n\tcityUpdateEvent->schedule(seconds * 1000);\n\tCore::getTaskManager()->getNextExecutionTime(cityUpdateEvent, nextUpdateTime);\n}\n\nint CityRegionImplementation::getTimeToUpdate() {\n\treturn round(nextUpdateTime.miliDifference() \/ -1000.f);\n}\n\nvoid CityRegionImplementation::notifyEnter(SceneObject* object) {\n\tobject->setCityRegion(_this);\n\n\tBazaarTerminal* term = cast<BazaarTerminal*>(object);\n\n\tif (term != NULL) {\n\t\tbazaars.put(term->getObjectID(), term);\n\t}\n\n\tif (isClientRegion())\n\t\treturn;\n\n\tif (object->isCreatureObject()){\n\t\tCreatureObject* creature = cast<CreatureObject*>(object);\n\n\t\tStringIdChatParameter params(\"city\/city\", \"city_enter_city\"); \/\/You have entered %TT (%TO).\n\t\tparams.setTT(getRegionName());\n\n\t\tUnicodeString strRank = StringIdManager::instance()->getStringId(String(\"@city\/city:rank\" + String::valueOf(cityRank)).hashCode());\n\n\t\tif (citySpecialization.isEmpty()) {\n\t\t\tparams.setTO(strRank);\n\t\t}\n\t\telse {\n\t\t\tUnicodeString citySpec = StringIdManager::instance()->getStringId(citySpecialization.hashCode());\n\t\t\tparams.setTO(strRank + \", \" + citySpec);\n\t\t}\n\n\t\tcreature->sendSystemMessage(params);\n\t}\n\n\tif (object->isBuildingObject()){\n\t\tBuildingObject* building = cast<BuildingObject*>(object);\n\n\t\tuint64 creatureID = building->getOwnerObjectID();\n\n\t\tif (!citizenList.contains(creatureID)) {\n\t\t\tCreatureObject* owner = building->getOwnerCreatureObject();\n\n\t\t\tif (owner != NULL) {\n\t\t\t\tPlayerObject* playerObject = owner->getPlayerObject();\n\n\t\t\t\tif (playerObject != NULL && playerObject->getDeclaredResidence() == building) {\n\t\t\t\t\taddCitizen(creatureID);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/Apply skillmods for specialization\n}\n\nvoid CityRegionImplementation::notifyExit(SceneObject* object) {\n\tobject->setCityRegion(NULL);\n\n\tBazaarTerminal* term = cast<BazaarTerminal*>(object);\n\n\tif (term != NULL) {\n\t\tbazaars.drop(term->getObjectID());\n\t}\n\n\tif (isClientRegion())\n\t\treturn;\n\n\tif (object->isCreatureObject()){\n\n\t\tCreatureObject* creature = cast<CreatureObject*>(object);\n\n\t\tStringIdChatParameter params(\"city\/city\", \"city_leave_city\"); \/\/You have left %TO.\n\t\tparams.setTO(getRegionName());\n\n\t\tcreature->sendSystemMessage(params);\n\n\t\t\/\/Remove skillmods for specialization\n\t}\n\n\n\tif (object->isBuildingObject()){\n\n\t\tfloat x = object->getWorldPositionX();\n\t\tfloat y = object->getWorldPositionY();\n\n\t\t\/\/StructureObject* structure = cast<StructureObject*>(object);\n\n\t\tBuildingObject* building = cast<BuildingObject*>(object);\n\n\t\tuint64 creatureID = building->getOwnerObjectID();\n\n\t\tif (citizenList.contains(creatureID)) {\n\t\t\tCreatureObject* owner = building->getOwnerCreatureObject();\n\n\t\t\tif (owner != NULL) {\n\t\t\t\tPlayerObject* playerObject = owner->getPlayerObject();\n\n\t\t\t\tif (playerObject != NULL && playerObject->getDeclaredResidence() == building){\n\t\t\t\t\tremoveCitizen(creatureID);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t}\n}\n\nvoid CityRegionImplementation::setRegionName(const StringId& name) {\n\tregionName = name;\n}\n\nVector<ManagedReference<SceneObject*> >* CityRegionImplementation::getVendorsInCity() {\n\tVector<ManagedReference<SceneObject*> >* vendors = new Vector<ManagedReference<SceneObject*> >();\n\n\treturn vendors;\n}\n\nvoid CityRegionImplementation::addZoningRights(uint64 objectid, uint32 duration) {\n\tTime now;\n\n\tzoningRights.put(objectid, duration + now.getTime());\n}\n\nbool CityRegionImplementation::hasZoningRights(uint64 objectid) {\n\tif (isMilitiaMember(objectid))\n\t\treturn true;\n\n\tuint32 timestamp = zoningRights.get(objectid);\n\n\tif (timestamp == 0)\n\t\treturn false;\n\n\tTime now;\n\treturn (now.getTime() <= timestamp);\n}\n\nvoid CityRegionImplementation::setZone(Zone* zne) {\n\tzone = zne;\n}\n\nvoid CityRegionImplementation::setRadius(float rad) {\n\tif (regions.size() <= 0)\n\t\treturn;\n\n\tManagedReference<ActiveArea*> aa = regions.get(0).get();\n\taa->setRadius(rad);\n\n\tzone->removeObject(aa, NULL, false);\n\tzone->transferObject(aa, -1, false);\n\n\tupdateNoBuildArea(getPositionX(), getPositionY(), rad * 2);\n}\n\nvoid CityRegionImplementation::destroyActiveAreas() {\n\tfor (int i = 0; i < regions.size(); ++i) {\n\t\tManagedReference<Region*> aa = regions.get(i);\n\n\t\tif (aa != NULL) {\n\t\t\taa->destroyObjectFromWorld(false);\n\t\t\taa->destroyObjectFromDatabase(true);\n\n\t\t\tregions.drop(aa);\n\t\t}\n\t}\n\n\tif(noBuildArea != NULL) {\n\t\tnoBuildArea->destroyObjectFromWorld(false);\n\t\tnoBuildArea->destroyObjectFromDatabase(true);\n\t}\n}\n\nString CityRegionImplementation::getRegionName() {\n\tif(!customRegionName.isEmpty())\n\t\treturn customRegionName;\n\n\treturn regionName.getFullPath();\n}\n\nvoid CityRegionImplementation::addToCityStructureInventory(uint8 rankRequired, SceneObject* structure){\n\tLocker locker(_this);\n\n\tif(cityStructureInventory.contains(rankRequired)){\n\t\tcityStructureInventory.get(rankRequired).put(structure);\n\n\t}\n\n\n}\n\nvoid CityRegionImplementation::removeFromCityStructureInventory(SceneObject* structure){\n\tLocker locker(_this);\n\n\tif(cityStructureInventory.get(uint8(1)).contains(structure))\n\t\tcityStructureInventory.get(uint8(1)).drop(structure);\n\n\telse if(cityStructureInventory.get(uint8(2)).contains(structure))\n\t\tcityStructureInventory.get(uint8(2)).drop(structure);\n\n\telse if(cityStructureInventory.get(uint8(3)).contains(structure))\n\t\tcityStructureInventory.get(uint8(3)).drop(structure);\n\n\telse if(cityStructureInventory.get(uint8(4)).contains(structure))\n\t\tcityStructureInventory.get(uint8(4)).drop(structure);\n\n\n}\n\nbool CityRegionImplementation::checkLimitedPlacementStucture(uint32 id){\n\tLocker locker(_this);\n\n\tif (limitedPlacementStructures.contains(id))\n\t\treturn true;\n\n\treturn false;\n}\n\nbool CityRegionImplementation::addLimitedPlacementStructure(uint32 id){\n\tLocker locker(_this);\n\n\tif (!limitedPlacementStructures.contains(id)){\n\t\tlimitedPlacementStructures.put(id);\n\t\treturn true;\n\t}\n\n\treturn false;\n}\n\nvoid CityRegionImplementation::removeLimitedPlacementStructure(uint32 id){\n\tLocker locker(_this);\n\n\tlimitedPlacementStructures.drop(id);\n\n}\n\nvoid CityRegionImplementation::destroyAllStructuresForRank(uint8 rank){\n\tLocker locker(_this);\n\n\tSortedVector<ManagedReference<SceneObject*> >* sceneObjects = &cityStructureInventory.get(rank);\n\n\tint structureCount = sceneObjects->size();\n\tint i;\n\n\n\tif (structureCount > 0) {\n\t\tfor (i = structureCount - 1; i >= 0; i--) {\n\t\t\tManagedReference<SceneObject*> sceo = sceneObjects->get(i);\n\n\t\t\tLocker locker(sceo, _this);\n\n\t\t\tZone* zoneObject = sceo->getZone();\n\n\t\t\tif (zoneObject != NULL) {\n\t\t\t\tStructureManager* manager = zoneObject->getStructureManager();\n\n\t\t\t\tif (manager != NULL) {\n\t\t\t\t\tif (sceo->isStructureObject()) {\n\t\t\t\t\t\tmanager->destroyStructure(cast<StructureObject*>(sceo.get()));\n\t\t\t\t\t} else {\n\t\t\t\t\t\tsceo->destroyObjectFromWorld(true);\n\t\t\t\t\t\tsceo->destroyObjectFromDatabase(true);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\tsceneObjects->drop(sceo);\n\t\t}\n\t}\n}\n\nvoid CityRegionImplementation::updateMilitia(){\n\n\tLocker locker (_this);\n\n\tuint64 objectID;\n\n\tfor (int i = militiaMembers.size() - 1;i >= 0; --i){\n\n\t\tobjectID = militiaMembers.get(i);\n\n\t\tif (!isCitizen(objectID))\n\t\t\tremoveMilitiaMember(objectID);\n\t}\n}\n\nvoid CityRegionImplementation::removeAllTerminals(){\n\tfor (int i = 0; i < cityMissionTerminals.size(); i++){\n\t\tcityMissionTerminals.get(i)->destroyObjectFromWorld(false);\n\t\tcityMissionTerminals.get(i)->destroyObjectFromDatabase(false);\n\t}\n\n\tcityMissionTerminals.removeAll();\n}\n\nvoid CityRegionImplementation::removeAllSkillTrainers(){\n\n\tfor (int i = 0; i < citySkillTrainers.size(); i++){\n\t\tcitySkillTrainers.get(i)->destroyObjectFromWorld(false);\n\t\tcitySkillTrainers.get(i)->destroyObjectFromDatabase(false);\n\t}\n\n\tcitySkillTrainers.removeAll();\n}\n\nvoid CityRegionImplementation::updateNoBuildArea(float x, float y, float radius) {\n\n\tif(noBuildArea != NULL)\n\t\tzone->removeObject(noBuildArea, NULL, false);\n\telse {\n\t\tuint32 crc = String(\"object\/active_area.iff\").hashCode();\n\t\tnoBuildArea = cast<ActiveArea*>(zone->getZoneServer()->createObject(crc, 1));\n\t\tnoBuildArea->setNoBuildArea(true);\n\t}\n\tnoBuildArea->initializePosition(x, 0, y);\n\tnoBuildArea->setRadius(radius);\n\tzone->transferObject(noBuildArea, -1, false);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\n * wxwidgets.hpp: Common headers for the wxwidges interface\n *****************************************************************************\n * Copyright (C) 1999-2005 the VideoLAN team\n * $Id$\n *\n * Authors: Gildas Bazin <gbazin@videolan.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#ifndef _WXVLC_WIDGETS_H_\n#define _WXVLC_WIDGETS_H_\n\n#ifdef WIN32                                                 \/* mingw32 hack *\/\n#undef Yield\n#undef CreateDialog\n#endif\n\n#ifdef _MSC_VER\n\/\/ turn off 'identifier was truncated to '255' characters in the debug info'\n#   pragma warning( disable:4786 )\n#endif\n\n\/* Let vlc take care of the i18n stuff *\/\n#define WXINTL_NO_GETTEXT_MACRO\n\n#include <vlc\/vlc.h>\n#include <vlc\/intf.h>\n#include \"charset.h\"\n\n#include <wx\/wx.h>\n#define SLIDER_MAX_POS 10000\n\n\/*\n#include <wx\/listctrl.h>\n#include <wx\/textctrl.h>\n#include <wx\/notebook.h>\n#include <wx\/spinctrl.h>\n#include <wx\/dnd.h>\n#include <wx\/treectrl.h>\n#include <wx\/gauge.h>\n#include <wx\/accel.h>\n#include <wx\/checkbox.h>\n#include <wx\/wizard.h>\n#include <wx\/taskbar.h>\n#include \"vlc_keys.h\"\n*\/\n#if (!wxCHECK_VERSION(2,5,0))\ntypedef long wxTreeItemIdValue;\n#endif\n\nDECLARE_LOCAL_EVENT_TYPE( wxEVT_DIALOG, 0 );\nDECLARE_LOCAL_EVENT_TYPE( wxEVT_INTF, 1 );\n\n\/***************************************************************************\n * I18N macros\n ***************************************************************************\/\n\n\/*\n * wxU() is used to convert UTF-8 strings (typically from gettext)\n * to unicode strings (wchar_t).\n *\/\n#if wxUSE_UNICODE\n#   define wxU(utf8) wxString(utf8, wxConvUTF8)\n#else\n#   define wxU(utf8) wxString(wxConvUTF8.cMB2WC(utf8), *wxConvCurrent)\n#endif\n\n\/*\n * wxL2U() use to convert localized “data” strings (while wxU() would convert\n * strings from gettext messages). Nowadays, the core use UTF-8 internally\n * and wxL2U() is only an obsoleted name for wxU().\n *\/\n#define wxL2U(utf8) wxU(utf8)\n\n\/*\n * wxFromLocale() is a replacement for LibVLC FromLocale() that accepts\n * a wxString. It was originally introduced because wxString::mb_str()\n * sucks on Linux with Unicode wxWidgets. It then turned out wxWidgets\n * did not support wc_str() when Unicode was not enabled.\n *\n * But heh, that's wxWidgets; you can't really expect it to actually\n * work, let alone work like its documentation says.\n *\n * Did it work, we would be able to catch non-ANSI characters on Windows\n * through wxString::wc_str(); while they are lost when using mb_str().\n * This would be particularly useful to open files whose names contain\n * non-ACP characters.\n *\/\n#if wxUSE_UNICODE\n#   define wxFromLocale(wxstring) FromWide(wxstring.wc_str())\n#   define wxLocaleFree(string) free(string)\n#else\n#   define wxFromLocale(wxstring) FromLocale(wxstring.mb_str())\n#   define wxLocaleFree(string) LocaleFree(string)\n#endif\n\t\n\/* From Locale functions to use for File Drop targets ... go figure *\/\n#ifdef wxUSE_UNICODE\nstatic inline char *wxDnDFromLocale( const wxChar *stupid )\n{\n    \/*\n     * In Unicode mode, wxWidgets will encode file names in the locale\n     * encoding with each **bytes** (rather than characters) represented\n     * by a 32 bits unsigned integer. If you are lucky enough to be using\n     * ISO-8859-1 as your local character encoding, that lame encoding\n     * scheme happens to be identical to UTF-32 with your arch native\n     * byte-endianess. If you are using anything else, including not only\n     * UTF-8 but also Windows-1252(!) and ISO-8859-15(!) or any\n     * non-western encoding, it obviously fails.\n     *\/\n    size_t i = 0;\n    while (stupid[i])\n        i++;\n\n    char psz_local[i + 1];\n    if ((i >= 1) && (stupid[i - 1] == '\\n'))\n        i--;\n\n    do\n        psz_local[i] = stupid[i];\n    while (n--);\n\n    return FromLocaleDup( psz_local );\n}\n#   define wxDnDLocaleFree( string ) free( string )\n#else\n#   define wxDnDFromLocale( string ) wxFromLocale( string )\n#   define wxDnDLocaleFree( string ) wxLocaleFree( string )\n#endif\n\n#define WRAPCOUNT 80\n\n#define OPEN_NORMAL 0\n#define OPEN_STREAM 1\n\nenum\n{\n  ID_CONTROLS_TIMER,\n  ID_SLIDER_TIMER,\n};\n\nnamespace wxvlc {\n    class WindowSettings;\n    class VideoWindow;\n};\n\nusing namespace wxvlc;\n\n\/*****************************************************************************\n * intf_sys_t: description and status of wxwindows interface\n *****************************************************************************\/\nstruct intf_sys_t\n{\n    \/* the wx parent window *\/\n    wxWindow            *p_wxwindow;\n    wxIcon              *p_icon;\n\n    \/* window settings *\/\n    WindowSettings      *p_window_settings;\n\n    \/* special actions *\/\n    vlc_bool_t          b_playing;\n    vlc_bool_t          b_intf_show;                \/* interface to be shown *\/\n\n    \/* The input thread *\/\n    input_thread_t *    p_input;\n\n    \/* The messages window *\/\n    msg_subscription_t* p_sub;                  \/* message bank subscription *\/\n\n    \/* Playlist management *\/\n    int                 i_playing;                 \/* playlist selected item *\/\n    unsigned            i_playlist_usage;\n\n    \/* Send an event to show a dialog *\/\n    void (*pf_show_dialog) ( intf_thread_t *p_intf, int i_dialog, int i_arg,\n                             intf_dialog_args_t *p_arg );\n\n    \/* Popup menu *\/\n    wxMenu              *p_popup_menu;\n\n    \/* Hotkeys *\/\n    int                 i_first_hotkey_event;\n    int                 i_hotkeys;\n\n    \/* Embedded vout *\/\n    VideoWindow         *p_video_window;\n    wxBoxSizer          *p_video_sizer;\n    vlc_bool_t          b_video_autosize;\n\n    \/* Aout *\/\n    aout_instance_t     *p_aout;\n};\n\n\n\nwxArrayString SeparateEntries( wxString );\nwxWindow *CreateDialogsProvider( intf_thread_t *p_intf, wxWindow *p_parent );\n\n\/*\n * wxWindows keeps dead locking because the timer tries to lock the playlist\n * when it's already locked somewhere else in the very wxWindows interface\n * module. Unless someone implements a \"vlc_mutex_trylock\", we need that.\n *\/\ninline void LockPlaylist( intf_sys_t *p_sys, playlist_t *p_pl )\n{\n    if( p_sys->i_playlist_usage++ == 0)\n        vlc_mutex_lock( &p_pl->object_lock );\n}\n\ninline void UnlockPlaylist( intf_sys_t *p_sys, playlist_t *p_pl )\n{\n    if( --p_sys->i_playlist_usage == 0)\n        vlc_mutex_unlock( &p_pl->object_lock );\n}\n\n#endif\n<commit_msg>typo<commit_after>\/*****************************************************************************\n * wxwidgets.hpp: Common headers for the wxwidges interface\n *****************************************************************************\n * Copyright (C) 1999-2005 the VideoLAN team\n * $Id$\n *\n * Authors: Gildas Bazin <gbazin@videolan.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#ifndef _WXVLC_WIDGETS_H_\n#define _WXVLC_WIDGETS_H_\n\n#ifdef WIN32                                                 \/* mingw32 hack *\/\n#undef Yield\n#undef CreateDialog\n#endif\n\n#ifdef _MSC_VER\n\/\/ turn off 'identifier was truncated to '255' characters in the debug info'\n#   pragma warning( disable:4786 )\n#endif\n\n\/* Let vlc take care of the i18n stuff *\/\n#define WXINTL_NO_GETTEXT_MACRO\n\n#include <vlc\/vlc.h>\n#include <vlc\/intf.h>\n#include \"charset.h\"\n\n#include <wx\/wx.h>\n#define SLIDER_MAX_POS 10000\n\n\/*\n#include <wx\/listctrl.h>\n#include <wx\/textctrl.h>\n#include <wx\/notebook.h>\n#include <wx\/spinctrl.h>\n#include <wx\/dnd.h>\n#include <wx\/treectrl.h>\n#include <wx\/gauge.h>\n#include <wx\/accel.h>\n#include <wx\/checkbox.h>\n#include <wx\/wizard.h>\n#include <wx\/taskbar.h>\n#include \"vlc_keys.h\"\n*\/\n#if (!wxCHECK_VERSION(2,5,0))\ntypedef long wxTreeItemIdValue;\n#endif\n\nDECLARE_LOCAL_EVENT_TYPE( wxEVT_DIALOG, 0 );\nDECLARE_LOCAL_EVENT_TYPE( wxEVT_INTF, 1 );\n\n\/***************************************************************************\n * I18N macros\n ***************************************************************************\/\n\n\/*\n * wxU() is used to convert UTF-8 strings (typically from gettext)\n * to unicode strings (wchar_t).\n *\/\n#if wxUSE_UNICODE\n#   define wxU(utf8) wxString(utf8, wxConvUTF8)\n#else\n#   define wxU(utf8) wxString(wxConvUTF8.cMB2WC(utf8), *wxConvCurrent)\n#endif\n\n\/*\n * wxL2U() use to convert localized “data” strings (while wxU() would convert\n * strings from gettext messages). Nowadays, the core use UTF-8 internally\n * and wxL2U() is only an obsoleted name for wxU().\n *\/\n#define wxL2U(utf8) wxU(utf8)\n\n\/*\n * wxFromLocale() is a replacement for LibVLC FromLocale() that accepts\n * a wxString. It was originally introduced because wxString::mb_str()\n * sucks on Linux with Unicode wxWidgets. It then turned out wxWidgets\n * did not support wc_str() when Unicode was not enabled.\n *\n * But heh, that's wxWidgets; you can't really expect it to actually\n * work, let alone work like its documentation says.\n *\n * Did it work, we would be able to catch non-ANSI characters on Windows\n * through wxString::wc_str(); while they are lost when using mb_str().\n * This would be particularly useful to open files whose names contain\n * non-ACP characters.\n *\/\n#if wxUSE_UNICODE\n#   define wxFromLocale(wxstring) FromWide(wxstring.wc_str())\n#   define wxLocaleFree(string) free(string)\n#else\n#   define wxFromLocale(wxstring) FromLocale(wxstring.mb_str())\n#   define wxLocaleFree(string) LocaleFree(string)\n#endif\n\t\n\/* From Locale functions to use for File Drop targets ... go figure *\/\n#ifdef wxUSE_UNICODE\nstatic inline char *wxDnDFromLocale( const wxChar *stupid )\n{\n    \/*\n     * In Unicode mode, wxWidgets will encode file names in the locale\n     * encoding with each **bytes** (rather than characters) represented\n     * by a 32 bits unsigned integer. If you are lucky enough to be using\n     * ISO-8859-1 as your local character encoding, that lame encoding\n     * scheme happens to be identical to UTF-32 with your arch native\n     * byte-endianess. If you are using anything else, including not only\n     * UTF-8 but also Windows-1252(!) and ISO-8859-15(!) or any\n     * non-western encoding, it obviously fails.\n     *\/\n    size_t i = 0;\n    while (stupid[i])\n        i++;\n\n    char psz_local[i + 1];\n    if ((i >= 1) && (stupid[i - 1] == '\\n'))\n        i--;\n\n    do\n        psz_local[i] = stupid[i];\n    while (i--);\n\n    return FromLocaleDup( psz_local );\n}\n#   define wxDnDLocaleFree( string ) free( string )\n#else\n#   define wxDnDFromLocale( string ) wxFromLocale( string )\n#   define wxDnDLocaleFree( string ) wxLocaleFree( string )\n#endif\n\n#define WRAPCOUNT 80\n\n#define OPEN_NORMAL 0\n#define OPEN_STREAM 1\n\nenum\n{\n  ID_CONTROLS_TIMER,\n  ID_SLIDER_TIMER,\n};\n\nnamespace wxvlc {\n    class WindowSettings;\n    class VideoWindow;\n};\n\nusing namespace wxvlc;\n\n\/*****************************************************************************\n * intf_sys_t: description and status of wxwindows interface\n *****************************************************************************\/\nstruct intf_sys_t\n{\n    \/* the wx parent window *\/\n    wxWindow            *p_wxwindow;\n    wxIcon              *p_icon;\n\n    \/* window settings *\/\n    WindowSettings      *p_window_settings;\n\n    \/* special actions *\/\n    vlc_bool_t          b_playing;\n    vlc_bool_t          b_intf_show;                \/* interface to be shown *\/\n\n    \/* The input thread *\/\n    input_thread_t *    p_input;\n\n    \/* The messages window *\/\n    msg_subscription_t* p_sub;                  \/* message bank subscription *\/\n\n    \/* Playlist management *\/\n    int                 i_playing;                 \/* playlist selected item *\/\n    unsigned            i_playlist_usage;\n\n    \/* Send an event to show a dialog *\/\n    void (*pf_show_dialog) ( intf_thread_t *p_intf, int i_dialog, int i_arg,\n                             intf_dialog_args_t *p_arg );\n\n    \/* Popup menu *\/\n    wxMenu              *p_popup_menu;\n\n    \/* Hotkeys *\/\n    int                 i_first_hotkey_event;\n    int                 i_hotkeys;\n\n    \/* Embedded vout *\/\n    VideoWindow         *p_video_window;\n    wxBoxSizer          *p_video_sizer;\n    vlc_bool_t          b_video_autosize;\n\n    \/* Aout *\/\n    aout_instance_t     *p_aout;\n};\n\n\n\nwxArrayString SeparateEntries( wxString );\nwxWindow *CreateDialogsProvider( intf_thread_t *p_intf, wxWindow *p_parent );\n\n\/*\n * wxWindows keeps dead locking because the timer tries to lock the playlist\n * when it's already locked somewhere else in the very wxWindows interface\n * module. Unless someone implements a \"vlc_mutex_trylock\", we need that.\n *\/\ninline void LockPlaylist( intf_sys_t *p_sys, playlist_t *p_pl )\n{\n    if( p_sys->i_playlist_usage++ == 0)\n        vlc_mutex_lock( &p_pl->object_lock );\n}\n\ninline void UnlockPlaylist( intf_sys_t *p_sys, playlist_t *p_pl )\n{\n    if( --p_sys->i_playlist_usage == 0)\n        vlc_mutex_unlock( &p_pl->object_lock );\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#ifndef K3_RUNTIME_QUEUE_H\n#define K3_RUNTIME_QUEUE_H\n\n#include <list>\n#include <map>\n#include <memory>\n#include <queue>\n#include <tuple>\n#include <boost\/lockfree\/queue.hpp>\n#include <boost\/log\/sources\/record_ostream.hpp>\n#include <boost\/thread\/mutex.hpp>\n#include <boost\/thread\/lockable_adapter.hpp>\n#include <boost\/thread\/externally_locked.hpp>\n#include <runtime\/cpp\/Common.hpp>\n\nnamespace K3 {\n\n  using namespace std;\n  using namespace boost;\n\n  template<typename T> using shared_ptr = std::shared_ptr<T>;\n  using mutex = boost::mutex;\n\n  \/\/-------------\n  \/\/ Queue types.\n\n  template<typename Value>\n  class MsgQueue {\n  public:\n    virtual bool push(Value& v) = 0;\n    virtual bool pop(Value& v) = 0;\n    virtual bool empty() = 0;\n    virtual size_t size() = 0;\n  };\n\n  template<typename Value>\n  class LockfreeMsgQueue : public MsgQueue<Value> {\n  public:\n    LockfreeMsgQueue() {}    \n    bool empty()        { return queue.empty(); }\n    bool push(Value& v) { ++qSize; return queue.push(v); }\n    bool pop(Value& v)  { --qSize; return queue.pop(v); }\n    size_t size()       { return qSize; }\n  protected:\n    boost::lockfree::queue<Value> queue;\n    size_t qSize; \/\/ TODO: synchronize.\n  };\n\n\n  template<typename Value>\n  class LockingMsgQueue\n    : public MsgQueue<Value>, public basic_lockable_adapter<mutex>\n  {\n  public:\n    typedef basic_lockable_adapter<mutex> qlockable;\n    LockingMsgQueue () : qlockable(), queue(*this) {}\n\n    bool empty() {\n      strict_lock<LockingMsgQueue> guard(*this);\n      return queue.get(guard).empty();\n    }\n\n    bool push(Value& v) {\n      strict_lock<LockingMsgQueue> guard(*this);\n      ++qSize;\n      queue.get(guard).push(v);\n      return true;\n    }\n    \n    bool pop(Value& v) {\n      strict_lock<LockingMsgQueue> guard(*this);\n      bool r = false;\n      if ( !queue.get(guard).empty() ) {\n        --qSize;\n        v = queue.get(guard).front();\n        queue.get(guard).pop();\n        r = true;\n      }\n      return r;\n    }\n\n    size_t size() { return qSize; }\n\n  protected:\n    externally_locked<queue<Value>, LockingMsgQueue> queue;\n    size_t qSize; \/\/ TODO: synchronize\n  };\n\n\n  \/\/------------------\n  \/\/ Queue containers.\n\n  class MessageQueues : public virtual LogMT {\n  public:\n    MessageQueues() : LogMT(\"queue\") {}\n    virtual void enqueue(Message m) = 0; \/\/ TODO: use a ref \/ rvalue ref to avoid copying\n    virtual shared_ptr<Message> dequeue() = 0;\n  };\n\n\n  template<typename QueueIndex, typename Queue>\n  class IndexedMessageQueues : public MessageQueues\n  {\n  public:\n    IndexedMessageQueues() : LogMT(\"IndexedMessageQueues\") {}\n\n    \/\/ TODO: use a ref \/ rvalue ref to avoid copying\n    void enqueue(Message m)\n    {\n      if ( validTarget(m) ) { enqueue(m, queue(m)); }\n      else {\n        BOOST_LOG(*this) << \"Invalid message target: \" << addressAsString(m.address()) << \":\" << m.id();\n      }\n    }\n\n    \/\/ TODO: fair queueing policy.\n    shared_ptr<Message> dequeue()\n    {\n      shared_ptr<Message> r;\n      tuple<QueueIndex, shared_ptr<Queue> > idxQ = nonEmptyQueue();\n      if ( get<1>(idxQ) ) { r = dequeue(idxQ); }\n      else {\n        BOOST_LOG(*this) << \"Invalid non-empty queue on dequeue\";\n      }\n      return r;\n    }\n\n    virtual size_t size() = 0;\n\n  protected:\n    virtual bool validTarget(Message& m) = 0;\n    \n    virtual shared_ptr<Queue> queue(Message& m) = 0;\n    virtual tuple<QueueIndex, shared_ptr<Queue> > nonEmptyQueue() = 0;\n\n    virtual void enqueue(Message& m, shared_ptr<Queue> q) = 0;\n    virtual shared_ptr<Message> dequeue(const tuple<QueueIndex, shared_ptr<Queue> >& q) = 0;\n  };\n\n\n  class SinglePeerQueue\n    : public IndexedMessageQueues<Address, MsgQueue<tuple<Identifier, Value> > >\n  {\n  public:\n    typedef Address QueueKey;\n    \/\/typedef LockfreeMsgQueue<tuple<Identifier, Value> > Queue;\n    typedef LockingMsgQueue<tuple<Identifier, Value> > Queue;\n    typedef tuple<QueueKey, shared_ptr<Queue> > PeerMessages;\n\n    SinglePeerQueue() : LogMT(\"SinglePeerQueue\") {}\n    SinglePeerQueue(Address addr) : LogMT(\"SinglePeerQueue\"), peerMsgs(addr, shared_ptr<Queue>(new Queue())) {}\n\n    size_t size() { return get<1>(peerMsgs)->size(); }\n\n  protected:\n    typedef MsgQueue<tuple<Identifier, Value> > BaseQueue;\n    PeerMessages peerMsgs;\n    \n    bool validTarget(Message& m) { return m.address() == get<0>(peerMsgs); }\n    \n    shared_ptr<BaseQueue> queue(Message& m) { return dynamic_pointer_cast<BaseQueue, Queue>(get<1>(peerMsgs)); }\n    \n    tuple<QueueKey, shared_ptr<BaseQueue> > nonEmptyQueue()\n    {\n      shared_ptr<Queue> r = get<1>(peerMsgs);\n      shared_ptr<BaseQueue> br =\n        r->empty()? shared_ptr<BaseQueue>() : dynamic_pointer_cast<BaseQueue, Queue>(r);\n      return make_tuple(get<0>(peerMsgs), br);\n    }\n\n    void enqueue(Message& m, shared_ptr<BaseQueue> q)\n    {\n      tuple<Identifier, Value> entry = make_tuple(m.id(), m.contents());\n      if ( !(q && q->push(entry)) ) {\n        BOOST_LOG(*this) << \"Invalid destination queue during enqueue\";\n      }\n    }\n\n    shared_ptr<Message> dequeue(const tuple<QueueKey, shared_ptr<BaseQueue> >& idxQ)\n    {\n      shared_ptr<Message>  r;\n      tuple<Identifier, Value> entry;\n      \n      shared_ptr<BaseQueue> q = get<1>(idxQ);\n      if ( q && q->pop(entry) ) {\n        const Address& addr  = get<0>(idxQ);\n        const Identifier& id = get<0>(entry);\n        const Value& v       = get<1>(entry);        \n        r = shared_ptr<Message>(new Message(addr, id, v));\n      } else {\n        BOOST_LOG(*this) << \"Invalid source queue during dequeue\";\n      }\n      return r;\n    }\n  };\n\n  \/\/ TODO: for dynamic changes to the queues container, use a shared lock\n  class MultiPeerQueue\n    : public IndexedMessageQueues<Address, MsgQueue<tuple<Identifier, Value> > >\n  {\n  public:\n    typedef Address QueueKey;\n    \/\/typedef LockfreeMsgQueue<tuple<Identifier, Value> > Queue;\n    typedef LockingMsgQueue<tuple<Identifier, Value> > Queue;\n    typedef map<QueueKey, shared_ptr<Queue> > MultiPeerMessages;\n\n    MultiPeerQueue() : LogMT(\"MultiPeerQueue\") {}\n    MultiPeerQueue(const list<Address>& addresses) : LogMT(\"MultiPeerQueue\") {\n      for ( auto x : addresses ) {\n        multiPeerMsgs.insert(make_pair(x, shared_ptr<Queue>(new Queue())));\n      }\n    }\n\n    size_t size() {\n      size_t r = 0;\n      for ( auto x : multiPeerMsgs ) { r += x.second? x.second->size() : 0; }\n      return r;\n    }\n\n  protected:\n    typedef MsgQueue<tuple<Identifier, Value> > BaseQueue;\n    MultiPeerMessages multiPeerMsgs;\n    \n    bool validTarget(Message& m) {\n      return multiPeerMsgs.find(m.address()) != multiPeerMsgs.end();\n    }\n\n    shared_ptr<BaseQueue> queue(Message& m) { \n      return dynamic_pointer_cast<BaseQueue, Queue>(multiPeerMsgs[m.address()]);\n    }\n\n    tuple<QueueKey, shared_ptr<BaseQueue> > nonEmptyQueue()\n    {\n      tuple<QueueKey, shared_ptr<BaseQueue> > r;\n\n      MultiPeerMessages::iterator it =\n        find_if(multiPeerMsgs.begin(), multiPeerMsgs.end(),\n          [](MultiPeerMessages::value_type& x){ return x.second->empty(); });\n\n      if ( it != multiPeerMsgs.end() ) { \n        r = make_tuple(it->first, dynamic_pointer_cast<BaseQueue, Queue>(it->second));\n      }\n      return r;\n    }\n    \n    void enqueue(Message& m, shared_ptr<BaseQueue> q) \n    {\n      tuple<Identifier, Value> entry = make_tuple(m.id(), m.contents());\n      if ( !(q && q->push(entry)) ) {\n        BOOST_LOG(*this) << \"Invalid destination queue during enqueue\";\n      }\n    }\n    \n    shared_ptr<Message> dequeue(const tuple<QueueKey, shared_ptr<BaseQueue> >& idxQ)\n    {\n      shared_ptr<Message> r;\n      tuple<Identifier, Value> entry;\n      \n      shared_ptr<BaseQueue> q = get<1>(idxQ);\n      if ( q && q->pop(entry) ) {\n        const Address& addr  = get<0>(idxQ);\n        const Identifier& id = get<0>(entry);\n        const Value& v       = get<1>(entry);\n        r = shared_ptr<Message >(new Message(addr, id, v));\n      } else {\n        BOOST_LOG(*this) << \"Invalid source queue during dequeue\";\n      }\n      return r;\n    }\n  };\n\n\n  \/\/ TODO: for dynamic changes to the queues container, use a shared lock\n  class MultiTriggerQueue\n    : public IndexedMessageQueues<tuple<Address, Identifier>, MsgQueue<Value> >\n  {\n  public:\n    typedef tuple<Address, Identifier> QueueKey;\n    \/\/typedef LockfreeMsgQueue<Value> Queue;\n    typedef LockingMsgQueue<Value> Queue;\n    typedef map<QueueKey, shared_ptr<Queue> > MultiTriggerMessages;\n\n    MultiTriggerQueue() : LogMT(\"MultiTriggerQueue\") {}\n\n    MultiTriggerQueue(const list<Address>& addresses, const list<Identifier>& triggerIds)\n      : LogMT(\"MultiTriggerQueue\")\n    {\n      for ( auto addr : addresses ) {\n        for ( auto id : triggerIds ) {\n          multiTriggerMsgs.insert(\n            make_pair(make_tuple(addr, id), shared_ptr<Queue>(new Queue())));\n        }\n      }\n    }\n\n    size_t size() {\n      size_t r = 0;\n      for ( auto x : multiTriggerMsgs ) { r += x.second? x.second->size() : 0; }\n      return r;\n    }\n\n  protected:\n    typedef MsgQueue<Value> BaseQueue;\n    MultiTriggerMessages multiTriggerMsgs;\n    \n    bool validTarget(Message& m) {\n      return multiTriggerMsgs.find(make_tuple(m.address(), m.id())) != multiTriggerMsgs.end();\n    }\n\n    shared_ptr<BaseQueue> queue(Message& m) {\n      return dynamic_pointer_cast<BaseQueue, Queue>(multiTriggerMsgs[make_tuple(m.address(), m.id())]);\n    }\n\n    tuple<QueueKey, shared_ptr<BaseQueue> > nonEmptyQueue()\n    {\n      tuple<QueueKey, shared_ptr<BaseQueue> > r;\n    \n      MultiTriggerMessages::iterator it =\n        find_if(multiTriggerMsgs.begin(), multiTriggerMsgs.end(), \n          [](MultiTriggerMessages::value_type& x) { return x.second->empty(); });\n      \n      if ( it != multiTriggerMsgs.end() ) {\n        r = make_tuple(it->first, dynamic_pointer_cast<BaseQueue, Queue>(it->second));\n      }\n      return r;      \n    }\n\n    void enqueue(Message& m, shared_ptr<BaseQueue> q) {\n      if ( !(q && q->push(m.contents())) ) {\n        BOOST_LOG(*this) << \"Invalid destination queue during enqueue\";\n      }\n    }\n    \n    shared_ptr<Message > dequeue(const tuple<QueueKey, shared_ptr<BaseQueue> >& idxQ)\n    {\n      shared_ptr<Message > r;\n      Value entry;\n      \n      shared_ptr<BaseQueue> q = get<1>(idxQ);\n      if ( q && q->pop(entry) ) {\n        const Address& addr  = get<0>(get<0>(idxQ));\n        const Identifier& id = get<1>(get<0>(idxQ));\n        r = shared_ptr<Message >(new Message(addr, id, entry));\n      } else {\n        BOOST_LOG(*this) << \"Invalid source queue during dequeue\";\n      }\n      return r;\n    }    \n  };\n\n\n  \/\/--------------------\n  \/\/ Queue constructors.\n\n  shared_ptr<MessageQueues> simpleQueues(Address addr)\n  {\n    return shared_ptr<MessageQueues>(new SinglePeerQueue(addr));\n  }\n\n  shared_ptr<MessageQueues> perPeerQueues(const list<Address>& addresses)\n  {\n    return shared_ptr<MessageQueues>(new MultiPeerQueue(addresses));\n  }\n\n  shared_ptr<MessageQueues>\n  perTriggerQueues(const list<Address>& addresses, const list<Identifier>& triggerIds)\n  {\n    return shared_ptr<MessageQueues>(new MultiTriggerQueue(addresses, triggerIds));\n  }\n}\n\n#endif\n<commit_msg>Fix queue issues with g++ by disambiguating std::queue.<commit_after>#ifndef K3_RUNTIME_QUEUE_H\n#define K3_RUNTIME_QUEUE_H\n\n#include <list>\n#include <map>\n#include <memory>\n#include <queue>\n#include <tuple>\n#include <boost\/lockfree\/queue.hpp>\n#include <boost\/log\/sources\/record_ostream.hpp>\n#include <boost\/thread\/mutex.hpp>\n#include <boost\/thread\/lockable_adapter.hpp>\n#include <boost\/thread\/externally_locked.hpp>\n#include <runtime\/cpp\/Common.hpp>\n\nnamespace K3 {\n\n  \/\/ using namespace std;\n  using namespace boost;\n  using std::shared_ptr;\n\n  using mutex = boost::mutex;\n\n  \/\/-------------\n  \/\/ Queue types.\n\n  template<typename Value>\n  class MsgQueue {\n  public:\n    virtual bool push(Value& v) = 0;\n    virtual bool pop(Value& v) = 0;\n    virtual bool empty() = 0;\n    virtual size_t size() = 0;\n  };\n\n  template<typename Value>\n  class LockfreeMsgQueue : public MsgQueue<Value> {\n  public:\n    LockfreeMsgQueue() {}    \n    bool empty()        { return queue.empty(); }\n    bool push(Value& v) { ++qSize; return queue.push(v); }\n    bool pop(Value& v)  { --qSize; return queue.pop(v); }\n    size_t size()       { return qSize; }\n  protected:\n    boost::lockfree::queue<Value> queue;\n    size_t qSize; \/\/ TODO: synchronize.\n  };\n\n\n  template<typename Value>\n  class LockingMsgQueue\n    : public MsgQueue<Value>, public basic_lockable_adapter<mutex>\n  {\n  public:\n    typedef basic_lockable_adapter<mutex> qlockable;\n    LockingMsgQueue () : qlockable(), queue(*this) {}\n\n    bool empty() {\n      strict_lock<LockingMsgQueue> guard(*this);\n      return queue.get(guard).empty();\n    }\n\n    bool push(Value& v) {\n      strict_lock<LockingMsgQueue> guard(*this);\n      ++qSize;\n      queue.get(guard).push(v);\n      return true;\n    }\n    \n    bool pop(Value& v) {\n      strict_lock<LockingMsgQueue> guard(*this);\n      bool r = false;\n      if ( !queue.get(guard).empty() ) {\n        --qSize;\n        v = queue.get(guard).front();\n        queue.get(guard).pop();\n        r = true;\n      }\n      return r;\n    }\n\n    size_t size() { return qSize; }\n\n  protected:\n    externally_locked<std::queue<Value>, LockingMsgQueue> queue;\n    size_t qSize; \/\/ TODO: synchronize\n  };\n\n\n  \/\/------------------\n  \/\/ Queue containers.\n\n  class MessageQueues : public virtual LogMT {\n  public:\n    MessageQueues() : LogMT(\"queue\") {}\n    virtual void enqueue(Message m) = 0; \/\/ TODO: use a ref \/ rvalue ref to avoid copying\n    virtual shared_ptr<Message> dequeue() = 0;\n  };\n\n\n  template<typename QueueIndex, typename Queue>\n  class IndexedMessageQueues : public MessageQueues\n  {\n  public:\n    IndexedMessageQueues() : LogMT(\"IndexedMessageQueues\") {}\n\n    \/\/ TODO: use a ref \/ rvalue ref to avoid copying\n    void enqueue(Message m)\n    {\n      if ( validTarget(m) ) { enqueue(m, queue(m)); }\n      else {\n        BOOST_LOG(*this) << \"Invalid message target: \" << addressAsString(m.address()) << \":\" << m.id();\n      }\n    }\n\n    \/\/ TODO: fair queueing policy.\n    shared_ptr<Message> dequeue()\n    {\n      shared_ptr<Message> r;\n      tuple<QueueIndex, shared_ptr<Queue> > idxQ = nonEmptyQueue();\n      if ( get<1>(idxQ) ) { r = dequeue(idxQ); }\n      else {\n        BOOST_LOG(*this) << \"Invalid non-empty queue on dequeue\";\n      }\n      return r;\n    }\n\n    virtual size_t size() = 0;\n\n  protected:\n    virtual bool validTarget(Message& m) = 0;\n    \n    virtual shared_ptr<Queue> queue(Message& m) = 0;\n    virtual tuple<QueueIndex, shared_ptr<Queue> > nonEmptyQueue() = 0;\n\n    virtual void enqueue(Message& m, shared_ptr<Queue> q) = 0;\n    virtual shared_ptr<Message> dequeue(const tuple<QueueIndex, shared_ptr<Queue> >& q) = 0;\n  };\n\n\n  class SinglePeerQueue\n    : public IndexedMessageQueues<Address, MsgQueue<tuple<Identifier, Value> > >\n  {\n  public:\n    typedef Address QueueKey;\n    \/\/typedef LockfreeMsgQueue<tuple<Identifier, Value> > Queue;\n    typedef LockingMsgQueue<tuple<Identifier, Value> > Queue;\n    typedef tuple<QueueKey, shared_ptr<Queue> > PeerMessages;\n\n    SinglePeerQueue() : LogMT(\"SinglePeerQueue\") {}\n    SinglePeerQueue(Address addr) : LogMT(\"SinglePeerQueue\"), peerMsgs(addr, shared_ptr<Queue>(new Queue())) {}\n\n    size_t size() { return get<1>(peerMsgs)->size(); }\n\n  protected:\n    typedef MsgQueue<tuple<Identifier, Value> > BaseQueue;\n    PeerMessages peerMsgs;\n    \n    bool validTarget(Message& m) { return m.address() == get<0>(peerMsgs); }\n    \n    shared_ptr<BaseQueue> queue(Message& m) { return dynamic_pointer_cast<BaseQueue, Queue>(get<1>(peerMsgs)); }\n    \n    tuple<QueueKey, shared_ptr<BaseQueue> > nonEmptyQueue()\n    {\n      shared_ptr<Queue> r = get<1>(peerMsgs);\n      shared_ptr<BaseQueue> br =\n        r->empty()? shared_ptr<BaseQueue>() : dynamic_pointer_cast<BaseQueue, Queue>(r);\n      return make_tuple(get<0>(peerMsgs), br);\n    }\n\n    void enqueue(Message& m, shared_ptr<BaseQueue> q)\n    {\n      tuple<Identifier, Value> entry = make_tuple(m.id(), m.contents());\n      if ( !(q && q->push(entry)) ) {\n        BOOST_LOG(*this) << \"Invalid destination queue during enqueue\";\n      }\n    }\n\n    shared_ptr<Message> dequeue(const tuple<QueueKey, shared_ptr<BaseQueue> >& idxQ)\n    {\n      shared_ptr<Message>  r;\n      tuple<Identifier, Value> entry;\n      \n      shared_ptr<BaseQueue> q = get<1>(idxQ);\n      if ( q && q->pop(entry) ) {\n        const Address& addr  = get<0>(idxQ);\n        const Identifier& id = get<0>(entry);\n        const Value& v       = get<1>(entry);        \n        r = shared_ptr<Message>(new Message(addr, id, v));\n      } else {\n        BOOST_LOG(*this) << \"Invalid source queue during dequeue\";\n      }\n      return r;\n    }\n  };\n\n  \/\/ TODO: for dynamic changes to the queues container, use a shared lock\n  class MultiPeerQueue\n    : public IndexedMessageQueues<Address, MsgQueue<tuple<Identifier, Value> > >\n  {\n  public:\n    typedef Address QueueKey;\n    \/\/typedef LockfreeMsgQueue<tuple<Identifier, Value> > Queue;\n    typedef LockingMsgQueue<tuple<Identifier, Value> > Queue;\n    typedef map<QueueKey, shared_ptr<Queue> > MultiPeerMessages;\n\n    MultiPeerQueue() : LogMT(\"MultiPeerQueue\") {}\n    MultiPeerQueue(const list<Address>& addresses) : LogMT(\"MultiPeerQueue\") {\n      for ( auto x : addresses ) {\n        multiPeerMsgs.insert(make_pair(x, shared_ptr<Queue>(new Queue())));\n      }\n    }\n\n    size_t size() {\n      size_t r = 0;\n      for ( auto x : multiPeerMsgs ) { r += x.second? x.second->size() : 0; }\n      return r;\n    }\n\n  protected:\n    typedef MsgQueue<tuple<Identifier, Value> > BaseQueue;\n    MultiPeerMessages multiPeerMsgs;\n    \n    bool validTarget(Message& m) {\n      return multiPeerMsgs.find(m.address()) != multiPeerMsgs.end();\n    }\n\n    shared_ptr<BaseQueue> queue(Message& m) { \n      return dynamic_pointer_cast<BaseQueue, Queue>(multiPeerMsgs[m.address()]);\n    }\n\n    tuple<QueueKey, shared_ptr<BaseQueue> > nonEmptyQueue()\n    {\n      tuple<QueueKey, shared_ptr<BaseQueue> > r;\n\n      MultiPeerMessages::iterator it =\n        find_if(multiPeerMsgs.begin(), multiPeerMsgs.end(),\n          [](MultiPeerMessages::value_type& x){ return x.second->empty(); });\n\n      if ( it != multiPeerMsgs.end() ) { \n        r = make_tuple(it->first, dynamic_pointer_cast<BaseQueue, Queue>(it->second));\n      }\n      return r;\n    }\n    \n    void enqueue(Message& m, shared_ptr<BaseQueue> q) \n    {\n      tuple<Identifier, Value> entry = make_tuple(m.id(), m.contents());\n      if ( !(q && q->push(entry)) ) {\n        BOOST_LOG(*this) << \"Invalid destination queue during enqueue\";\n      }\n    }\n    \n    shared_ptr<Message> dequeue(const tuple<QueueKey, shared_ptr<BaseQueue> >& idxQ)\n    {\n      shared_ptr<Message> r;\n      tuple<Identifier, Value> entry;\n      \n      shared_ptr<BaseQueue> q = get<1>(idxQ);\n      if ( q && q->pop(entry) ) {\n        const Address& addr  = get<0>(idxQ);\n        const Identifier& id = get<0>(entry);\n        const Value& v       = get<1>(entry);\n        r = shared_ptr<Message >(new Message(addr, id, v));\n      } else {\n        BOOST_LOG(*this) << \"Invalid source queue during dequeue\";\n      }\n      return r;\n    }\n  };\n\n\n  \/\/ TODO: for dynamic changes to the queues container, use a shared lock\n  class MultiTriggerQueue\n    : public IndexedMessageQueues<tuple<Address, Identifier>, MsgQueue<Value> >\n  {\n  public:\n    typedef tuple<Address, Identifier> QueueKey;\n    \/\/typedef LockfreeMsgQueue<Value> Queue;\n    typedef LockingMsgQueue<Value> Queue;\n    typedef map<QueueKey, shared_ptr<Queue> > MultiTriggerMessages;\n\n    MultiTriggerQueue() : LogMT(\"MultiTriggerQueue\") {}\n\n    MultiTriggerQueue(const list<Address>& addresses, const list<Identifier>& triggerIds)\n      : LogMT(\"MultiTriggerQueue\")\n    {\n      for ( auto addr : addresses ) {\n        for ( auto id : triggerIds ) {\n          multiTriggerMsgs.insert(\n            make_pair(make_tuple(addr, id), shared_ptr<Queue>(new Queue())));\n        }\n      }\n    }\n\n    size_t size() {\n      size_t r = 0;\n      for ( auto x : multiTriggerMsgs ) { r += x.second? x.second->size() : 0; }\n      return r;\n    }\n\n  protected:\n    typedef MsgQueue<Value> BaseQueue;\n    MultiTriggerMessages multiTriggerMsgs;\n    \n    bool validTarget(Message& m) {\n      return multiTriggerMsgs.find(make_tuple(m.address(), m.id())) != multiTriggerMsgs.end();\n    }\n\n    shared_ptr<BaseQueue> queue(Message& m) {\n      return dynamic_pointer_cast<BaseQueue, Queue>(multiTriggerMsgs[make_tuple(m.address(), m.id())]);\n    }\n\n    tuple<QueueKey, shared_ptr<BaseQueue> > nonEmptyQueue()\n    {\n      tuple<QueueKey, shared_ptr<BaseQueue> > r;\n    \n      MultiTriggerMessages::iterator it =\n        find_if(multiTriggerMsgs.begin(), multiTriggerMsgs.end(), \n          [](MultiTriggerMessages::value_type& x) { return x.second->empty(); });\n      \n      if ( it != multiTriggerMsgs.end() ) {\n        r = make_tuple(it->first, dynamic_pointer_cast<BaseQueue, Queue>(it->second));\n      }\n      return r;      \n    }\n\n    void enqueue(Message& m, shared_ptr<BaseQueue> q) {\n      if ( !(q && q->push(m.contents())) ) {\n        BOOST_LOG(*this) << \"Invalid destination queue during enqueue\";\n      }\n    }\n    \n    shared_ptr<Message > dequeue(const tuple<QueueKey, shared_ptr<BaseQueue> >& idxQ)\n    {\n      shared_ptr<Message > r;\n      Value entry;\n      \n      shared_ptr<BaseQueue> q = get<1>(idxQ);\n      if ( q && q->pop(entry) ) {\n        const Address& addr  = get<0>(get<0>(idxQ));\n        const Identifier& id = get<1>(get<0>(idxQ));\n        r = shared_ptr<Message >(new Message(addr, id, entry));\n      } else {\n        BOOST_LOG(*this) << \"Invalid source queue during dequeue\";\n      }\n      return r;\n    }    \n  };\n\n\n  \/\/--------------------\n  \/\/ Queue constructors.\n\n  shared_ptr<MessageQueues> simpleQueues(Address addr)\n  {\n    return shared_ptr<MessageQueues>(new SinglePeerQueue(addr));\n  }\n\n  shared_ptr<MessageQueues> perPeerQueues(const list<Address>& addresses)\n  {\n    return shared_ptr<MessageQueues>(new MultiPeerQueue(addresses));\n  }\n\n  shared_ptr<MessageQueues>\n  perTriggerQueues(const list<Address>& addresses, const list<Identifier>& triggerIds)\n  {\n    return shared_ptr<MessageQueues>(new MultiTriggerQueue(addresses, triggerIds));\n  }\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\n * dash.cpp: DASH module\n *****************************************************************************\n * Copyright © 2010 - 2011 Klagenfurt University\n *\n * Created on: Aug 10, 2010\n * Authors: Christopher Mueller <christopher.mueller@itec.uni-klu.ac.at>\n *          Christian Timmerer  <christian.timmerer@itec.uni-klu.ac.at>\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\n * by 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\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.\n *****************************************************************************\/\n\n\/*****************************************************************************\n * Preamble\n *****************************************************************************\/\n#ifdef HAVE_CONFIG_H\n# include \"config.h\"\n#endif\n\n#include <vlc_common.h>\n#include <vlc_plugin.h>\n\n#include <errno.h>\n\n#include \"DASHManager.h\"\n#include \"xml\/DOMParser.h\"\n#include \"http\/HTTPConnectionManager.h\"\n#include \"adaptationlogic\/IAdaptationLogic.h\"\n#include \"mpd\/BasicCMParser.h\"\n\n#define SEEK 0\n\n\/*****************************************************************************\n * Module descriptor\n *****************************************************************************\/\nstatic int  Open    (vlc_object_t *);\nstatic void Close   (vlc_object_t *);\n\nvlc_module_begin ()\n        set_shortname( N_(\"DASH\"))\n        set_description( N_(\"Dynamic Adaptive Streaming over HTTP\") )\n        set_capability( \"stream_filter\", 19 )\n        set_category( CAT_INPUT )\n        set_subcategory( SUBCAT_INPUT_STREAM_FILTER )\n        set_callbacks( Open, Close )\nvlc_module_end ()\n\n\/*****************************************************************************\n * Local prototypes\n *****************************************************************************\/\nstruct stream_sys_t\n{\n        dash::DASHManager                   *p_dashManager;\n        dash::http::HTTPConnectionManager   *p_conManager;\n        dash::mpd::MPD                      *p_mpd;\n        int                                 position;\n        bool                                isLive;\n};\n\nstatic int  Read            (stream_t *p_stream, void *p_buffer, unsigned int i_len);\nstatic int  Peek            (stream_t *p_stream, const uint8_t **pp_peek, unsigned int i_peek);\nstatic int  Control         (stream_t *p_stream, int i_query, va_list args);\n\n\/*****************************************************************************\n * Open:\n *****************************************************************************\/\nstatic int Open(vlc_object_t *p_obj)\n{\n    stream_t *p_stream = (stream_t*) p_obj;\n\n    if(!dash::xml::DOMParser::isDash(p_stream->p_source))\n        return VLC_EGENERIC;\n\n    \/\/Build a XML tree\n    dash::xml::DOMParser        parser(p_stream->p_source);\n    if( !parser.parse() )\n    {\n        msg_Dbg( p_stream, \"Could not parse mpd file.\" );\n        return VLC_EGENERIC;\n    }\n    \/\/Begin the actual MPD parsing:\n    dash::mpd::BasicCMParser    mpdParser( parser.getRootNode(), p_stream->p_source );\n    if ( mpdParser.parse() == false || mpdParser.getMPD() == NULL )\n    {\n        msg_Err( p_obj, \"MPD file parsing failed.\" );\n        return VLC_EGENERIC;\n    }\n\n    stream_sys_t        *p_sys = (stream_sys_t *) malloc(sizeof(stream_sys_t));\n    if (unlikely(p_sys == NULL))\n        return VLC_ENOMEM;\n\n    p_sys->p_mpd = mpdParser.getMPD();\n    dash::http::HTTPConnectionManager *p_conManager =\n                              new dash::http::HTTPConnectionManager( p_stream );\n    dash::DASHManager*p_dashManager =\n            new dash::DASHManager( p_conManager, p_sys->p_mpd,\n                                   dash::logic::IAdaptationLogic::RateBased );\n\n    if ( p_dashManager->getMpdManager() == NULL ||\n         p_dashManager->getMpdManager()->getMPD() == NULL ||\n         p_dashManager->getAdaptionLogic() == NULL )\n    {\n        delete p_conManager;\n        delete p_dashManager;\n        free( p_sys );\n        return VLC_EGENERIC;\n    }\n    p_sys->p_dashManager    = p_dashManager;\n    p_sys->p_conManager     = p_conManager;\n    p_sys->position         = 0;\n    p_sys->isLive           = p_dashManager->getMpdManager()->getMPD()->isLive();\n    p_stream->p_sys         = p_sys;\n    p_stream->pf_read       = Read;\n    p_stream->pf_peek       = Peek;\n    p_stream->pf_control    = Control;\n\n    msg_Dbg(p_obj,\"opening mpd file (%s)\", p_stream->psz_path);\n\n    return VLC_SUCCESS;\n}\n\/*****************************************************************************\n * Close:\n *****************************************************************************\/\nstatic void Close(vlc_object_t *p_obj)\n{\n    stream_t                            *p_stream       = (stream_t*) p_obj;\n    stream_sys_t                        *p_sys          = (stream_sys_t *) p_stream->p_sys;\n    dash::DASHManager                   *p_dashManager  = p_sys->p_dashManager;\n    dash::http::HTTPConnectionManager   *p_conManager   = p_sys->p_conManager;\n\n    delete(p_conManager);\n    delete(p_dashManager);\n    free(p_sys);\n}\n\/*****************************************************************************\n * Callbacks:\n *****************************************************************************\/\nstatic int  Read            (stream_t *p_stream, void *p_buffer, unsigned int i_len)\n{\n    stream_sys_t        *p_sys          = (stream_sys_t *) p_stream->p_sys;\n    dash::DASHManager   *p_dashManager  = p_sys->p_dashManager;\n    int                 i_ret           = 0;\n\n    i_ret = p_dashManager->read(p_buffer, i_len );\n\n    if (i_ret < 0)\n    {\n        switch (errno)\n        {\n            case EINTR:\n            case EAGAIN:\n                break;\n            default:\n                msg_Dbg(p_stream, \"DASH Read: failed to read (%m)\");\n                return 0;\n        }\n        return 0;\n    }\n\n    p_sys->position += i_ret;\n\n    return i_ret;\n}\n\nstatic int  Peek            (stream_t *p_stream, const uint8_t **pp_peek, unsigned int i_peek)\n{\n    stream_sys_t        *p_sys          = (stream_sys_t *) p_stream->p_sys;\n    dash::DASHManager   *p_dashManager  = p_sys->p_dashManager;\n\n    return p_dashManager->peek( pp_peek, i_peek );\n}\n\nstatic int  Control         (stream_t *p_stream, int i_query, va_list args)\n{\n    stream_sys_t *p_sys = p_stream->p_sys;\n\n    switch (i_query)\n    {\n        case STREAM_CAN_SEEK:\n        case STREAM_CAN_FASTSEEK:\n            \/*TODO Support Seek *\/\n            *(va_arg (args, bool *)) = SEEK;\n            break;\n        case STREAM_GET_POSITION:\n            *(va_arg (args, uint64_t *)) = p_sys->position;\n            break;\n        case STREAM_SET_POSITION:\n            return VLC_EGENERIC;\n        case STREAM_GET_SIZE:\n            if(p_sys->isLive)\n                *(va_arg (args, uint64_t *)) = 0;\n            break;\n        default:\n            return VLC_EGENERIC;\n    }\n    return VLC_SUCCESS;\n}\n<commit_msg>dash: added generic mpd generation<commit_after>\/*****************************************************************************\n * dash.cpp: DASH module\n *****************************************************************************\n * Copyright © 2010 - 2011 Klagenfurt University\n *\n * Created on: Aug 10, 2010\n * Authors: Christopher Mueller <christopher.mueller@itec.uni-klu.ac.at>\n *          Christian Timmerer  <christian.timmerer@itec.uni-klu.ac.at>\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\n * by 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\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.\n *****************************************************************************\/\n\n\/*****************************************************************************\n * Preamble\n *****************************************************************************\/\n#ifdef HAVE_CONFIG_H\n# include \"config.h\"\n#endif\n\n#include <vlc_common.h>\n#include <vlc_plugin.h>\n\n#include <errno.h>\n\n#include \"DASHManager.h\"\n#include \"xml\/DOMParser.h\"\n#include \"http\/HTTPConnectionManager.h\"\n#include \"adaptationlogic\/IAdaptationLogic.h\"\n#include \"mpd\/MPDFactory.h\"\n\n#define SEEK 0\n\n\/*****************************************************************************\n * Module descriptor\n *****************************************************************************\/\nstatic int  Open    (vlc_object_t *);\nstatic void Close   (vlc_object_t *);\n\nvlc_module_begin ()\n        set_shortname( N_(\"DASH\"))\n        set_description( N_(\"Dynamic Adaptive Streaming over HTTP\") )\n        set_capability( \"stream_filter\", 19 )\n        set_category( CAT_INPUT )\n        set_subcategory( SUBCAT_INPUT_STREAM_FILTER )\n        set_callbacks( Open, Close )\nvlc_module_end ()\n\n\/*****************************************************************************\n * Local prototypes\n *****************************************************************************\/\nstruct stream_sys_t\n{\n        dash::DASHManager                   *p_dashManager;\n        dash::http::HTTPConnectionManager   *p_conManager;\n        dash::mpd::MPD                      *p_mpd;\n        int                                 position;\n        bool                                isLive;\n};\n\nstatic int  Read            (stream_t *p_stream, void *p_buffer, unsigned int i_len);\nstatic int  Peek            (stream_t *p_stream, const uint8_t **pp_peek, unsigned int i_peek);\nstatic int  Control         (stream_t *p_stream, int i_query, va_list args);\n\n\/*****************************************************************************\n * Open:\n *****************************************************************************\/\nstatic int Open(vlc_object_t *p_obj)\n{\n    stream_t *p_stream = (stream_t*) p_obj;\n\n    if(!dash::xml::DOMParser::isDash(p_stream->p_source))\n        return VLC_EGENERIC;\n\n    \/\/Build a XML tree\n    dash::xml::DOMParser        parser(p_stream->p_source);\n    if( !parser.parse() )\n    {\n        msg_Dbg( p_stream, \"Could not parse mpd file.\" );\n        return VLC_EGENERIC;\n    }\n\n    \/\/Begin the actual MPD parsing:\n    dash::mpd::MPD *mpd = dash::mpd::MPDFactory::create(parser.getRootNode(), p_stream->p_source, parser.getProfile());\n\n    if(mpd == NULL)\n        return VLC_EGENERIC;\n\n    stream_sys_t        *p_sys = (stream_sys_t *) malloc(sizeof(stream_sys_t));\n    if (unlikely(p_sys == NULL))\n        return VLC_ENOMEM;\n\n    p_sys->p_mpd = mpd;\n    dash::http::HTTPConnectionManager *p_conManager =\n                              new dash::http::HTTPConnectionManager( p_stream );\n    dash::DASHManager*p_dashManager =\n            new dash::DASHManager( p_conManager, p_sys->p_mpd,\n                                   dash::logic::IAdaptationLogic::RateBased );\n\n    if ( p_dashManager->getMpdManager() == NULL ||\n         p_dashManager->getMpdManager()->getMPD() == NULL ||\n         p_dashManager->getAdaptionLogic() == NULL )\n    {\n        delete p_conManager;\n        delete p_dashManager;\n        free( p_sys );\n        return VLC_EGENERIC;\n    }\n    p_sys->p_dashManager    = p_dashManager;\n    p_sys->p_conManager     = p_conManager;\n    p_sys->position         = 0;\n    p_sys->isLive           = p_dashManager->getMpdManager()->getMPD()->isLive();\n    p_stream->p_sys         = p_sys;\n    p_stream->pf_read       = Read;\n    p_stream->pf_peek       = Peek;\n    p_stream->pf_control    = Control;\n\n    msg_Dbg(p_obj,\"opening mpd file (%s)\", p_stream->psz_path);\n\n    return VLC_SUCCESS;\n}\n\/*****************************************************************************\n * Close:\n *****************************************************************************\/\nstatic void Close(vlc_object_t *p_obj)\n{\n    stream_t                            *p_stream       = (stream_t*) p_obj;\n    stream_sys_t                        *p_sys          = (stream_sys_t *) p_stream->p_sys;\n    dash::DASHManager                   *p_dashManager  = p_sys->p_dashManager;\n    dash::http::HTTPConnectionManager   *p_conManager   = p_sys->p_conManager;\n\n    delete(p_conManager);\n    delete(p_dashManager);\n    free(p_sys);\n}\n\/*****************************************************************************\n * Callbacks:\n *****************************************************************************\/\nstatic int  Read            (stream_t *p_stream, void *p_buffer, unsigned int i_len)\n{\n    stream_sys_t        *p_sys          = (stream_sys_t *) p_stream->p_sys;\n    dash::DASHManager   *p_dashManager  = p_sys->p_dashManager;\n    int                 i_ret           = 0;\n\n    i_ret = p_dashManager->read(p_buffer, i_len );\n\n    if (i_ret < 0)\n    {\n        switch (errno)\n        {\n            case EINTR:\n            case EAGAIN:\n                break;\n            default:\n                msg_Dbg(p_stream, \"DASH Read: failed to read (%m)\");\n                return 0;\n        }\n        return 0;\n    }\n\n    p_sys->position += i_ret;\n\n    return i_ret;\n}\n\nstatic int  Peek            (stream_t *p_stream, const uint8_t **pp_peek, unsigned int i_peek)\n{\n    stream_sys_t        *p_sys          = (stream_sys_t *) p_stream->p_sys;\n    dash::DASHManager   *p_dashManager  = p_sys->p_dashManager;\n\n    return p_dashManager->peek( pp_peek, i_peek );\n}\n\nstatic int  Control         (stream_t *p_stream, int i_query, va_list args)\n{\n    stream_sys_t *p_sys = p_stream->p_sys;\n\n    switch (i_query)\n    {\n        case STREAM_CAN_SEEK:\n        case STREAM_CAN_FASTSEEK:\n            \/*TODO Support Seek *\/\n            *(va_arg (args, bool *)) = SEEK;\n            break;\n        case STREAM_GET_POSITION:\n            *(va_arg (args, uint64_t *)) = p_sys->position;\n            break;\n        case STREAM_SET_POSITION:\n            return VLC_EGENERIC;\n        case STREAM_GET_SIZE:\n            if(p_sys->isLive)\n                *(va_arg (args, uint64_t *)) = 0;\n            break;\n        default:\n            return VLC_EGENERIC;\n    }\n    return VLC_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"config.h\"\n\n#include \"host-cmd-manager.hpp\"\n\n#include \"systemintfcmds.hpp\"\n\n#include <chrono>\n#include <ipmid\/utils.hpp>\n#include <phosphor-logging\/elog-errors.hpp>\n#include <phosphor-logging\/log.hpp>\n#include <sdbusplus\/message\/types.hpp>\n#include <sdbusplus\/timer.hpp>\n#include <xyz\/openbmc_project\/Common\/error.hpp>\n#include <xyz\/openbmc_project\/State\/Host\/server.hpp>\n\nnamespace phosphor\n{\nnamespace host\n{\nnamespace command\n{\n\nconstexpr auto HOST_STATE_PATH = \"\/xyz\/openbmc_project\/state\/host0\";\nconstexpr auto HOST_STATE_INTERFACE = \"xyz.openbmc_project.State.Host\";\nconstexpr auto HOST_TRANS_PROP = \"RequestedHostTransition\";\n\n\/\/ For throwing exceptions\nusing namespace phosphor::logging;\nusing InternalFailure =\n    sdbusplus::xyz::openbmc_project::Common::Error::InternalFailure;\n\nnamespace sdbusRule = sdbusplus::bus::match::rules;\n\nManager::Manager(sdbusplus::bus::bus& bus) :\n    bus(bus), timer(std::bind(&Manager::hostTimeout, this)),\n    hostTransitionMatch(\n        bus,\n        sdbusRule::propertiesChanged(HOST_STATE_PATH, HOST_STATE_INTERFACE),\n        std::bind(&Manager::clearQueueOnPowerOn, this, std::placeholders::_1))\n{\n    \/\/ Nothing to do here.\n}\n\n\/\/ Called as part of READ_MSG_DATA command\nIpmiCmdData Manager::getNextCommand()\n{\n    \/\/ Stop the timer. Don't have to Err failure doing so.\n    auto r = timer.stop();\n    if (r < 0)\n    {\n        log<level::ERR>(\"Failure to STOP the timer\",\n                        entry(\"ERROR=%s\", strerror(-r)));\n    }\n\n    if (this->workQueue.empty())\n    {\n        \/\/ Just return a heartbeat in this case.  A spurious SMS_ATN was\n        \/\/ asserted for the host (probably from a previous boot).\n        log<level::DEBUG>(\"Control Host work queue is empty!\");\n\n        return std::make_pair(CMD_HEARTBEAT, 0x00);\n    }\n\n    \/\/ Pop the processed entry off the queue\n    auto command = this->workQueue.front();\n    this->workQueue.pop();\n\n    \/\/ IPMI command is the first element in pair\n    auto ipmiCmdData = std::get<0>(command);\n\n    \/\/ Now, call the user registered functions so that\n    \/\/ implementation specific CommandComplete signals\n    \/\/ can be sent. `true` indicating Success.\n    std::get<CallBack>(command)(ipmiCmdData, true);\n\n    \/\/ Check for another entry in the queue and kick it off\n    this->checkQueueAndAlertHost();\n\n    \/\/ Tuple of command and data\n    return ipmiCmdData;\n}\n\n\/\/ Called when initial timer goes off post sending SMS_ATN\nvoid Manager::hostTimeout()\n{\n    log<level::ERR>(\"Host control timeout hit!\");\n\n    clearQueue();\n}\n\nvoid Manager::clearQueue()\n{\n    \/\/ Dequeue all entries and send fail signal\n    while (!this->workQueue.empty())\n    {\n        auto command = this->workQueue.front();\n        this->workQueue.pop();\n\n        \/\/ IPMI command is the first element in pair\n        auto ipmiCmdData = std::get<0>(command);\n\n        \/\/ Call the implementation specific Command Failure.\n        \/\/ `false` indicating Failure\n        std::get<CallBack>(command)(ipmiCmdData, false);\n    }\n}\n\n\/\/ Called for alerting the host\nvoid Manager::checkQueueAndAlertHost()\n{\n    if (this->workQueue.size() >= 1)\n    {\n        log<level::DEBUG>(\"Asserting SMS Attention\");\n\n        std::string IPMI_PATH(\"\/org\/openbmc\/HostIpmi\/1\");\n        std::string IPMI_INTERFACE(\"org.openbmc.HostIpmi\");\n\n        auto host = ::ipmi::getService(this->bus, IPMI_INTERFACE, IPMI_PATH);\n\n        \/\/ Start the timer for this transaction\n        auto time = std::chrono::duration_cast<std::chrono::microseconds>(\n            std::chrono::seconds(IPMI_SMS_ATN_ACK_TIMEOUT_SECS));\n\n        auto r = timer.start(time);\n        if (r < 0)\n        {\n            log<level::ERR>(\"Error starting timer for control host\");\n            return;\n        }\n\n        auto method =\n            this->bus.new_method_call(host.c_str(), IPMI_PATH.c_str(),\n                                      IPMI_INTERFACE.c_str(), \"setAttention\");\n        auto reply = this->bus.call(method);\n\n        if (reply.is_method_error())\n        {\n            log<level::ERR>(\"Error in setting SMS attention\");\n            elog<InternalFailure>();\n        }\n        log<level::DEBUG>(\"SMS Attention asserted\");\n    }\n}\n\n\/\/ Called by specific implementations that provide commands\nvoid Manager::execute(CommandHandler command)\n{\n    log<level::DEBUG>(\"Pushing cmd on to queue\",\n                      entry(\"COMMAND=%d\", std::get<0>(command).first));\n\n    this->workQueue.emplace(command);\n\n    \/\/ Alert host if this is only command in queue otherwise host will\n    \/\/ be notified of next message after processing the current one\n    if (this->workQueue.size() == 1)\n    {\n        this->checkQueueAndAlertHost();\n    }\n    else\n    {\n        log<level::INFO>(\"Command in process, no attention\");\n    }\n\n    return;\n}\n\nvoid Manager::clearQueueOnPowerOn(sdbusplus::message::message& msg)\n{\n    namespace server = sdbusplus::xyz::openbmc_project::State::server;\n\n    ::ipmi::DbusInterface interface;\n    ::ipmi::PropertyMap properties;\n\n    msg.read(interface, properties);\n\n    if (properties.find(HOST_TRANS_PROP) == properties.end())\n    {\n        return;\n    }\n\n    auto& requestedState =\n        std::get<std::string>(properties.at(HOST_TRANS_PROP));\n\n    if (server::Host::convertTransitionFromString(requestedState) ==\n        server::Host::Transition::On)\n    {\n        clearQueue();\n    }\n}\n\n} \/\/ namespace command\n} \/\/ namespace host\n} \/\/ namespace phosphor\n<commit_msg>mapper: remove mapper from host attention path<commit_after>#include \"config.h\"\n\n#include \"host-cmd-manager.hpp\"\n\n#include \"systemintfcmds.hpp\"\n\n#include <chrono>\n#include <ipmid\/utils.hpp>\n#include <phosphor-logging\/elog-errors.hpp>\n#include <phosphor-logging\/log.hpp>\n#include <sdbusplus\/message\/types.hpp>\n#include <sdbusplus\/timer.hpp>\n#include <xyz\/openbmc_project\/Common\/error.hpp>\n#include <xyz\/openbmc_project\/State\/Host\/server.hpp>\n\nnamespace phosphor\n{\nnamespace host\n{\nnamespace command\n{\n\nconstexpr auto HOST_STATE_PATH = \"\/xyz\/openbmc_project\/state\/host0\";\nconstexpr auto HOST_STATE_INTERFACE = \"xyz.openbmc_project.State.Host\";\nconstexpr auto HOST_TRANS_PROP = \"RequestedHostTransition\";\n\n\/\/ For throwing exceptions\nusing namespace phosphor::logging;\nusing InternalFailure =\n    sdbusplus::xyz::openbmc_project::Common::Error::InternalFailure;\n\nnamespace sdbusRule = sdbusplus::bus::match::rules;\n\nManager::Manager(sdbusplus::bus::bus& bus) :\n    bus(bus), timer(std::bind(&Manager::hostTimeout, this)),\n    hostTransitionMatch(\n        bus,\n        sdbusRule::propertiesChanged(HOST_STATE_PATH, HOST_STATE_INTERFACE),\n        std::bind(&Manager::clearQueueOnPowerOn, this, std::placeholders::_1))\n{\n    \/\/ Nothing to do here.\n}\n\n\/\/ Called as part of READ_MSG_DATA command\nIpmiCmdData Manager::getNextCommand()\n{\n    \/\/ Stop the timer. Don't have to Err failure doing so.\n    auto r = timer.stop();\n    if (r < 0)\n    {\n        log<level::ERR>(\"Failure to STOP the timer\",\n                        entry(\"ERROR=%s\", strerror(-r)));\n    }\n\n    if (this->workQueue.empty())\n    {\n        \/\/ Just return a heartbeat in this case.  A spurious SMS_ATN was\n        \/\/ asserted for the host (probably from a previous boot).\n        log<level::DEBUG>(\"Control Host work queue is empty!\");\n\n        return std::make_pair(CMD_HEARTBEAT, 0x00);\n    }\n\n    \/\/ Pop the processed entry off the queue\n    auto command = this->workQueue.front();\n    this->workQueue.pop();\n\n    \/\/ IPMI command is the first element in pair\n    auto ipmiCmdData = std::get<0>(command);\n\n    \/\/ Now, call the user registered functions so that\n    \/\/ implementation specific CommandComplete signals\n    \/\/ can be sent. `true` indicating Success.\n    std::get<CallBack>(command)(ipmiCmdData, true);\n\n    \/\/ Check for another entry in the queue and kick it off\n    this->checkQueueAndAlertHost();\n\n    \/\/ Tuple of command and data\n    return ipmiCmdData;\n}\n\n\/\/ Called when initial timer goes off post sending SMS_ATN\nvoid Manager::hostTimeout()\n{\n    log<level::ERR>(\"Host control timeout hit!\");\n\n    clearQueue();\n}\n\nvoid Manager::clearQueue()\n{\n    \/\/ Dequeue all entries and send fail signal\n    while (!this->workQueue.empty())\n    {\n        auto command = this->workQueue.front();\n        this->workQueue.pop();\n\n        \/\/ IPMI command is the first element in pair\n        auto ipmiCmdData = std::get<0>(command);\n\n        \/\/ Call the implementation specific Command Failure.\n        \/\/ `false` indicating Failure\n        std::get<CallBack>(command)(ipmiCmdData, false);\n    }\n}\n\n\/\/ Called for alerting the host\nvoid Manager::checkQueueAndAlertHost()\n{\n    if (this->workQueue.size() >= 1)\n    {\n        log<level::DEBUG>(\"Asserting SMS Attention\");\n\n        std::string HOST_IPMI_SVC(\"org.openbmc.HostIpmi\");\n        std::string IPMI_PATH(\"\/org\/openbmc\/HostIpmi\/1\");\n        std::string IPMI_INTERFACE(\"org.openbmc.HostIpmi\");\n\n        \/\/ Start the timer for this transaction\n        auto time = std::chrono::duration_cast<std::chrono::microseconds>(\n            std::chrono::seconds(IPMI_SMS_ATN_ACK_TIMEOUT_SECS));\n\n        auto r = timer.start(time);\n        if (r < 0)\n        {\n            log<level::ERR>(\"Error starting timer for control host\");\n            return;\n        }\n\n        auto method =\n            this->bus.new_method_call(HOST_IPMI_SVC.c_str(), IPMI_PATH.c_str(),\n                                      IPMI_INTERFACE.c_str(), \"setAttention\");\n        auto reply = this->bus.call(method);\n\n        if (reply.is_method_error())\n        {\n            log<level::ERR>(\"Error in setting SMS attention\");\n            elog<InternalFailure>();\n        }\n        log<level::DEBUG>(\"SMS Attention asserted\");\n    }\n}\n\n\/\/ Called by specific implementations that provide commands\nvoid Manager::execute(CommandHandler command)\n{\n    log<level::DEBUG>(\"Pushing cmd on to queue\",\n                      entry(\"COMMAND=%d\", std::get<0>(command).first));\n\n    this->workQueue.emplace(command);\n\n    \/\/ Alert host if this is only command in queue otherwise host will\n    \/\/ be notified of next message after processing the current one\n    if (this->workQueue.size() == 1)\n    {\n        this->checkQueueAndAlertHost();\n    }\n    else\n    {\n        log<level::INFO>(\"Command in process, no attention\");\n    }\n\n    return;\n}\n\nvoid Manager::clearQueueOnPowerOn(sdbusplus::message::message& msg)\n{\n    namespace server = sdbusplus::xyz::openbmc_project::State::server;\n\n    ::ipmi::DbusInterface interface;\n    ::ipmi::PropertyMap properties;\n\n    msg.read(interface, properties);\n\n    if (properties.find(HOST_TRANS_PROP) == properties.end())\n    {\n        return;\n    }\n\n    auto& requestedState =\n        std::get<std::string>(properties.at(HOST_TRANS_PROP));\n\n    if (server::Host::convertTransitionFromString(requestedState) ==\n        server::Host::Transition::On)\n    {\n        clearQueue();\n    }\n}\n\n} \/\/ namespace command\n} \/\/ namespace host\n} \/\/ namespace phosphor\n<|endoftext|>"}
{"text":"<commit_before>#include <SensorDatabase\/SensorDatabase.h>\n#include <TempReader\/TempReader.h>\n#include <pthread.h>\n#include <iostream>\n#include \"Timer.h\"\n#include \"logger.h\"\n#include <glib.h>\n#include <unistd.h>\n#include <CommunicationService\/SensorLoggerCommunicationServer.h>\n\n#ifdef DEBUG\n    #define CONFPATH \"..\/templog.conf\"\n#else\n    #define CONFPATH \"\/etc\/templog.conf\"\n#endif\n\nvoid dbg_db_fake(SensorDatabase &db) {\n    db.reset();\n    std::string image_data = \"abcdef\";\n    db.addSetting(\"basement\", image_data.data(), image_data.size());\n    db.addSensor(\"pipe\", \"67C6697351FF\", \"28\", \"DS18B20\", \"°C\", \"basement\");\n    db.addSensor(\"oven\", \"4AEC29CDBAAB\", \"10\", \"DS18B20\", \"°C\", \"basement\");\n    db.addSensor(\"watertank\", \"F2FBE3467CC2\", \"10\", \"DS18B20\", \"°C\", \"basement\");\n}\n\nvoid dbg_reader_fake(TempReader &reader) {\n    reader.addFake(\"10\");\n    reader.addFake(\"10\");\n    reader.addFake(\"28\");\n}\n\nint main() {\n    std::cout<<\"reading config from: \"<<CONFPATH<<std::endl;\n    \/\/ read configuration\n    GKeyFile *conf_file = g_key_file_new ();\n    GKeyFileFlags conffile_flags;\n    GError *conffile_error = NULL;\n\n    if(!g_key_file_load_from_file(conf_file, CONFPATH, conffile_flags, &conffile_error)) {\n        g_error(conffile_error->message);\n    }\n\n    const char *db_path = g_key_file_get_string(conf_file, \"database\", \"db_file\", &conffile_error);\n    const time_t period = g_key_file_get_integer(conf_file, \"logging\", \"period\", &conffile_error);\n    const unsigned int port = g_key_file_get_integer(conf_file, \"communication\", \"port\", &conffile_error);\n    const char *device = g_key_file_get_string(conf_file, \"logging\", \"device\", &conffile_error);\n\n    std::cout<<\"db path: \"<<std::string(db_path)<<std::endl;\n    std::cout<<\"period: \"<<period<<std::endl;\n\n    if(db_path == NULL)\n        g_error(conffile_error->message);\n\n    SensorDatabase db;\n    TempReader reader;\n\n    const int db_init = access(db_path, F_OK);\n\n    db.open(db_path);\n\n    if(db_init!=0 && errno==ENOENT) {\n        std::cout<<\"initiliazing database\"<<std::endl;\n        db.init();\n    }\n\n    std::cout<<\"addr db: \"<<&db<<std::endl;\n    std::cout<<\"addr reader: \"<<&reader<<std::endl;\n\n    if(std::string(device)==\"fake\") {\n        \/\/ init with example data\n        std::cout<<\"feeding fake data\"<<std::endl;\n        dbg_db_fake(db);\n        dbg_reader_fake(reader);\n    }\n    else {\n        reader.setDevice(device);\n    }\n\n    reader.open();\n\n    LoggerConfig conf = {.period=period, .db=&db, .reader=&reader};\n\n    pthread_t th_logger;\n\n    std::cout<<\"addr per: \"<<&period<<std::endl;\n    std::cout<<\"addr conf: \"<<&conf<<std::endl;\n\n    \/\/pthread_create(&th_logger, NULL, logger, (void*)period);\n    pthread_create(&th_logger, NULL, logger, &conf);\n    \/\/pthread_create(&th_logger, NULL, logger, NULL);\n\n    SensorLoggerCommunicationServer s(port, db, reader);\n\n    s.start();\n\n    pthread_join(th_logger, NULL);\n\n    std::cout<<\"exit...\"<<std::endl;\n}\n<commit_msg>GKeyFile cleanup<commit_after>#include <SensorDatabase\/SensorDatabase.h>\n#include <TempReader\/TempReader.h>\n#include <pthread.h>\n#include <iostream>\n#include \"Timer.h\"\n#include \"logger.h\"\n#include <glib.h>\n#include <unistd.h>\n#include <CommunicationService\/SensorLoggerCommunicationServer.h>\n\n#ifdef DEBUG\n    #define CONFPATH \"..\/templog.conf\"\n#else\n    #define CONFPATH \"\/etc\/templog.conf\"\n#endif\n\nvoid dbg_db_fake(SensorDatabase &db) {\n    db.reset();\n    std::string image_data = \"abcdef\";\n    db.addSetting(\"basement\", image_data.data(), image_data.size());\n    db.addSensor(\"pipe\", \"67C6697351FF\", \"28\", \"DS18B20\", \"°C\", \"basement\");\n    db.addSensor(\"oven\", \"4AEC29CDBAAB\", \"10\", \"DS18B20\", \"°C\", \"basement\");\n    db.addSensor(\"watertank\", \"F2FBE3467CC2\", \"10\", \"DS18B20\", \"°C\", \"basement\");\n}\n\nvoid dbg_reader_fake(TempReader &reader) {\n    reader.addFake(\"10\");\n    reader.addFake(\"10\");\n    reader.addFake(\"28\");\n}\n\nint main() {\n    std::cout<<\"reading config from: \"<<CONFPATH<<std::endl;\n    \/\/ read configuration\n    GKeyFile *conf_file = g_key_file_new();\n    GError *conffile_error = NULL;\n\n    if(!g_key_file_load_from_file(conf_file, CONFPATH, G_KEY_FILE_NONE, &conffile_error)) {\n        g_error(conffile_error->message);\n    }\n\n    const char *db_path = g_key_file_get_string(conf_file, \"database\", \"db_file\", &conffile_error);\n    const time_t period = g_key_file_get_integer(conf_file, \"logging\", \"period\", &conffile_error);\n    const unsigned int port = g_key_file_get_integer(conf_file, \"communication\", \"port\", &conffile_error);\n    const char *device = g_key_file_get_string(conf_file, \"logging\", \"device\", &conffile_error);\n\n    std::cout<<\"db path: \"<<std::string(db_path)<<std::endl;\n    std::cout<<\"period: \"<<period<<std::endl;\n\n    if(db_path == NULL)\n        g_error(conffile_error->message);\n\n    SensorDatabase db;\n    TempReader reader;\n\n    const int db_init = access(db_path, F_OK);\n\n    db.open(db_path);\n\n    if(db_init!=0 && errno==ENOENT) {\n        std::cout<<\"initiliazing database\"<<std::endl;\n        db.init();\n    }\n\n    std::cout<<\"addr db: \"<<&db<<std::endl;\n    std::cout<<\"addr reader: \"<<&reader<<std::endl;\n\n    if(std::string(device)==\"fake\") {\n        \/\/ init with example data\n        std::cout<<\"feeding fake data\"<<std::endl;\n        dbg_db_fake(db);\n        dbg_reader_fake(reader);\n    }\n    else {\n        reader.setDevice(device);\n    }\n\n    reader.open();\n\n    LoggerConfig conf = {.period=period, .db=&db, .reader=&reader};\n\n    pthread_t th_logger;\n\n    std::cout<<\"addr per: \"<<&period<<std::endl;\n    std::cout<<\"addr conf: \"<<&conf<<std::endl;\n\n    \/\/pthread_create(&th_logger, NULL, logger, (void*)period);\n    pthread_create(&th_logger, NULL, logger, &conf);\n    \/\/pthread_create(&th_logger, NULL, logger, NULL);\n\n    SensorLoggerCommunicationServer s(port, db, reader);\n\n    s.start();\n\n    pthread_join(th_logger, NULL);\n\n    std::cout<<\"exit...\"<<std::endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include<iostream>\n\nusing namespace std;\n\nint * shady()\n{\n    int a = 1337;\n    return &a;\n}\n\nint innocent(int x)\n{\n    int b = 42;\n    return x * b;\n}\n\nint main()\n{\n    int x = 3;\n    int &y = x;\n\n    int * b = shady();\n    cout << *b << endl;\n    innocent(4);\n    cout << *b << endl;\n\n\treturn 0;\n}\n<commit_msg>Removed unused code<commit_after>#include <iostream>\n\nusing namespace std;\n\nint * shady()\n{\n    int a = 1337;\n    return &a;\n}\n\nint innocent(int x)\n{\n    int b = 42;\n    return x * b;\n}\n\nint main()\n{\n    int * b = shady();\n    cout << *b << endl;\n    innocent(4);\n    cout << *b << endl;\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\r\nComputes the (magnetic) scattering form sld (n and m) profile\r\n *\/\r\n#include \"sld2i.hh\"\r\n#include <stdio.h>\r\n#include <math.h>\r\nusing namespace std;\r\nextern \"C\" {\r\n\t#include \"libmultifunc\/libfunc.h\"\r\n\t#include \"libmultifunc\/librefl.h\"\r\n}\r\n\/**\r\n * Constructor for GenI\r\n *\r\n * binning\r\n * \/\/@param qx: array of Qx values\r\n * \/\/@param qy: array of Qy values\r\n * \/\/@param qz: array of Qz values\r\n * @param x: array of x values\r\n * @param y: array of y values\r\n * @param z: array of z values\r\n * @param sldn: array of sld n\r\n * @param mx: array of sld mx\r\n * @param my: array of sld my\r\n * @param mz: array of sld mz\r\n * @param in_spin: ratio of up spin in Iin\r\n * @param out_spin: ratio of up spin in Iout\r\n * @param s_theta: angle (from x-axis) of the up spin in degree\r\n *\/\r\nGenI :: GenI(int npix, double* x, double* y, double* z, double* sldn,\r\n\t\t\tdouble* mx, double* my, double* mz, double* voli,\r\n\t\t\tdouble in_spin, double out_spin,\r\n\t\t\tdouble s_theta) {\r\n\t\/\/this->qx_val = qx;\r\n\t\/\/this->qy_val = qy;\r\n\t\/\/this->qz_val = qz;\r\n\tthis->n_pix = npix;\r\n\tthis->x_val = x;\r\n\tthis->y_val = y;\r\n\tthis->z_val = z;\r\n\tthis->sldn_val = sldn;\r\n\tthis->mx_val = mx;\r\n\tthis->my_val = my;\r\n\tthis->mz_val = mz;\r\n\tthis->vol_pix = voli;\r\n\tthis->inspin = in_spin;\r\n\tthis->outspin = out_spin;\r\n\tthis->stheta = s_theta;\r\n};\r\n\r\n\/**\r\n * Compute 2D anisotropic\r\n *\/\r\nvoid GenI :: genicomXY(int npoints, double *qx, double *qy, double *I_out){\r\n\t\/\/npoints is given negative for angular averaging \r\n\t\/\/ Assumes that q doesn't have qz component and sld_n is all real\r\n\t\/\/double q = 0.0;\r\n\t\/\/double Pi = 4.0*atan(1.0);\r\n\tpolar_sld b_sld;\r\n\tdouble qr = 0.0;\r\n\tcomplex iqr = cassign(0.0, 0.0);\r\n\tcomplex ephase = cassign(0.0, 0.0);\r\n\tcomplex comp_sld = cassign(0.0, 0.0);\r\n\r\n\tcomplex sumj_uu;\r\n\tcomplex sumj_ud;\r\n\tcomplex sumj_du;\r\n\tcomplex sumj_dd;\r\n\tcomplex temp_fi;\r\n\r\n\tdouble count = 0.0;\r\n\t\/\/check if this computation is for averaging\r\n\r\n\t\/\/Assume that pixel volumes are given in vol_pix in A^3 unit\r\n\t\/\/int x_size = 0; \/\/in Ang\r\n\t\/\/int y_size = 0; \/\/in Ang\r\n\t\/\/int z_size = 0; \/\/in Ang\r\n\t\r\n\t\/\/ Loop over q-values and multiply apply matrix\r\n\t\r\n\tfor(int i=0; i<npoints; i++){\r\n\t\t\/\/I_out[i] = 0.0;\r\n\t\tsumj_uu = cassign(0.0, 0.0);\r\n\t\tsumj_ud = cassign(0.0, 0.0);\r\n\t\tsumj_du = cassign(0.0, 0.0);\r\n\t\tsumj_dd = cassign(0.0, 0.0);\t\t\r\n\t\t\/\/printf (\"%d \", i);\r\n\t\t\/\/q = sqrt(qx[i]*qx[i] + qy[i]*qy[i]); \/\/ + qz[i]*qz[i]);\r\n\r\n\t\tfor(int j=0; j<n_pix; j++){\r\n\t\t\tif (sldn_val[j]!=0.0||mx_val[j]!=0.0||my_val[j]!=0.0||mz_val[j]!=0.0)\r\n\t\t\t{\t\r\n\t\t\t\t\/\/anisotropic\r\n\t\t\t\ttemp_fi = cassign(0.0, 0.0);\r\n\t\t\t\tb_sld = cal_msld(0, qx[i], qy[i], sldn_val[j],\r\n\t\t\t\t\t\t\t mx_val[j], my_val[j], mz_val[j],\r\n\t\t\t \t\t\t\t inspin, outspin, stheta);\r\n\t\t\t\tqr = (qx[i]*x_val[j] + qy[i]*y_val[j]);\r\n\t\t\t\tiqr = cassign(0.0, qr);\r\n\t\t\t\tephase = cplx_exp(iqr);\r\n\t\t\t\t\r\n\t\t\t\t\/\/Let's multiply pixel(atomic) volume here\r\n\t\t\t\tephase = rcmult(vol_pix[j], ephase);\r\n\t\t\t\t\/\/up_up\r\n\t\t\t\tif (inspin > 0.0 && outspin > 0.0){\r\n\t\t\t\t\tcomp_sld = cassign(b_sld.uu, 0.0);\r\n\t\t\t\t\ttemp_fi = cplx_mult(comp_sld, ephase);\r\n\t\t\t\t\tsumj_uu = cplx_add(sumj_uu, temp_fi);\r\n\t\t\t\t}\r\n\t\t\t\t\/\/down_down\r\n\t\t\t\tif (inspin < 1.0 && outspin < 1.0){\r\n\t\t\t\t\tcomp_sld = cassign(b_sld.dd, 0.0);\r\n\t\t\t\t\ttemp_fi = cplx_mult(comp_sld, ephase);\r\n\t\t\t\t\tsumj_dd = cplx_add(sumj_dd, temp_fi);\r\n\t\t\t\t}\r\n\t\t\t\t\/\/up_down\r\n\t\t\t\tif (inspin > 0.0 && outspin < 1.0){\r\n\t\t\t\t\tcomp_sld = cassign(b_sld.re_ud, b_sld.im_ud);\r\n\t\t\t\t\ttemp_fi = cplx_mult(comp_sld, ephase);\r\n\t\t\t\t\tsumj_ud = cplx_add(sumj_ud, temp_fi);\r\n\t\t\t\t}\r\n\t\t\t\t\/\/down_up\r\n\t\t\t\tif (inspin < 1.0 && outspin > 0.0){\r\n\t\t\t\t\tcomp_sld = cassign(b_sld.re_du, b_sld.im_du);\r\n\t\t\t\t\ttemp_fi = cplx_mult(comp_sld, ephase);\r\n\t\t\t\t\tsumj_du = cplx_add(sumj_du, temp_fi);\r\n\t\t\t\t}\r\n\r\n\r\n\t\t\t\tif (i == 0){\r\n\t\t\t\t\tcount += vol_pix[j];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\t\/\/printf(\"aa%d=%g %g %d\\n\", i, (sumj_uu.re*sumj_uu.re + sumj_uu.im*sumj_uu.im), (sumj_dd.re*sumj_dd.re + sumj_dd.im*sumj_dd.im), count);\r\n\r\n\t\tI_out[i] = (sumj_uu.re*sumj_uu.re + sumj_uu.im*sumj_uu.im);\r\n\t\tI_out[i] += (sumj_ud.re*sumj_ud.re + sumj_ud.im*sumj_ud.im);\r\n\t\tI_out[i] += (sumj_du.re*sumj_du.re + sumj_du.im*sumj_du.im);\r\n\t\tI_out[i] += (sumj_dd.re*sumj_dd.re + sumj_dd.im*sumj_dd.im);\r\n\r\n\t\tI_out[i] *= (1.0E+8 \/ count); \/\/in cm (unit) \/ number; \/\/to be multiplied by vol_pix\r\n\t}\r\n\t\/\/printf (\"count = %d %g %g %g %g\\n\", count, sldn_val[0],mx_val[0], my_val[0], mz_val[0]);\r\n}\r\n\/**\r\n * Compute 1D isotropic\r\n * Isotropic: Assumes all slds are real (no magnetic)\r\n * Also assumes there is no polarization: No dependency on spin\r\n *\/\r\nvoid GenI :: genicom(int npoints, double *q, double *I_out){\r\n\t\/\/npoints is given negative for angular averaging \r\n\t\/\/ Assumes that q doesn't have qz component and sld_n is all real\r\n\t\/\/double Pi = 4.0*atan(1.0);\r\n\tint is_sym = 0;\r\n\tdouble qr = 0.0;\r\n\tdouble sumj;\r\n\tdouble sld_j = 0.0;\r\n\tdouble count = 0.0;\r\n\tif (n_pix < 0 ){\r\n\t\tis_sym = 1;\r\n\t\tn_pix = n_pix * -1;\r\n\t}\r\n\t\/\/Assume that pixel volumes are given in vol_pix in A^3 unit\r\n\t\/\/ Loop over q-values and multiply apply matrix\r\n\tfor(int i=0; i<npoints; i++){\r\n\t\tsumj =0.0;\t\t\r\n\t\tfor(int j=0; j<n_pix; j++){\r\n\t\t\t\/\/Isotropic: Assumes all slds are real (no magnetic)\r\n\t\t\t\/\/Also assumes there is no polarization: No dependency on spin\r\n\t\t\tif (is_sym == 1){\r\n\t\t\t\t\/\/ approximation for a spherical symmetric particle\r\n\t\t\t\tqr = sqrt(x_val[j]*x_val[j]+y_val[j]*y_val[j]+z_val[j]*z_val[j])*q[i];\r\n\t\t\t\tif (qr > 0.0){\r\n\t\t\t\t\tqr = sin(qr) \/ qr;\r\n\t\t\t\t\tsumj += sldn_val[j] * vol_pix[j] * qr;\r\n\t\t\t\t}\r\n\t\t\t\telse{\r\n\t\t\t\t\tsumj += sldn_val[j] * vol_pix[j];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse{\r\n\t\t\t\t\/\/full calculation\r\n\t\t\t\t#pragma omp parallel for\r\n\t\t\t\tfor(int k=0; k<n_pix; k++){\r\n\t\t\t\t\tsld_j =  sldn_val[j] * sldn_val[k] * vol_pix[j] * vol_pix[k];\r\n\t\t\t\t\tqr = (x_val[j]-x_val[k])*(x_val[j]-x_val[k])+\r\n\t\t\t\t\t\t      (y_val[j]-y_val[k])*(y_val[j]-y_val[k])+ \r\n\t\t\t\t\t\t      (z_val[j]-z_val[k])*(z_val[j]-z_val[k]);\r\n\t\t\t\t\tqr = sqrt(qr) * q[i];\r\n\t\t\t\t\tif (qr > 0.0){\r\n\t\t\t\t\t\tsumj += sld_j*sin(qr)\/qr;\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse{\r\n\t\t\t\t\t\tsumj += sld_j;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tif (i == 0){\r\n\t\t\t\tcount += vol_pix[j];\r\n\t\t\t}\r\n\t\t}\r\n\t\tI_out[i] = sumj;\r\n\t\tif (is_sym == 1){\r\n\t\t\tI_out[i] *= sumj;\r\n\t\t}\r\n\t\tI_out[i] *= (1.0E+8 \/ count); \/\/in cm (unit) \/ number; \/\/to be multiplied by vol_pix\r\n\t}\r\n\t\/\/printf (\"count = %d %g %g %g %g\\n\", count, sldn_val[0],mx_val[0], my_val[0], mz_val[0]);\r\n}\r\n<commit_msg>missing file to commit last time<commit_after>\/**\r\nComputes the (magnetic) scattering form sld (n and m) profile\r\n *\/\r\n#include \"sld2i.hh\"\r\n#include <stdio.h>\r\n#include <math.h>\r\nusing namespace std;\r\nextern \"C\" {\r\n\t#include \"libmultifunc\/libfunc.h\"\r\n\t#include \"libmultifunc\/librefl.h\"\r\n}\r\n\/**\r\n * Constructor for GenI\r\n *\r\n * binning\r\n * \/\/@param qx: array of Qx values\r\n * \/\/@param qy: array of Qy values\r\n * \/\/@param qz: array of Qz values\r\n * @param x: array of x values\r\n * @param y: array of y values\r\n * @param z: array of z values\r\n * @param sldn: array of sld n\r\n * @param mx: array of sld mx\r\n * @param my: array of sld my\r\n * @param mz: array of sld mz\r\n * @param in_spin: ratio of up spin in Iin\r\n * @param out_spin: ratio of up spin in Iout\r\n * @param s_theta: angle (from x-axis) of the up spin in degree\r\n *\/\r\nGenI :: GenI(int npix, double* x, double* y, double* z, double* sldn,\r\n\t\t\tdouble* mx, double* my, double* mz, double* voli,\r\n\t\t\tdouble in_spin, double out_spin,\r\n\t\t\tdouble s_theta) {\r\n\t\/\/this->qx_val = qx;\r\n\t\/\/this->qy_val = qy;\r\n\t\/\/this->qz_val = qz;\r\n\tthis->n_pix = npix;\r\n\tthis->x_val = x;\r\n\tthis->y_val = y;\r\n\tthis->z_val = z;\r\n\tthis->sldn_val = sldn;\r\n\tthis->mx_val = mx;\r\n\tthis->my_val = my;\r\n\tthis->mz_val = mz;\r\n\tthis->vol_pix = voli;\r\n\tthis->inspin = in_spin;\r\n\tthis->outspin = out_spin;\r\n\tthis->stheta = s_theta;\r\n};\r\n\r\n\/**\r\n * Compute 2D anisotropic\r\n *\/\r\nvoid GenI :: genicomXY(int npoints, double *qx, double *qy, double *I_out){\r\n\t\/\/npoints is given negative for angular averaging \r\n\t\/\/ Assumes that q doesn't have qz component and sld_n is all real\r\n\t\/\/double q = 0.0;\r\n\t\/\/double Pi = 4.0*atan(1.0);\r\n\tpolar_sld b_sld;\r\n\tdouble qr = 0.0;\r\n\tcomplex iqr = cassign(0.0, 0.0);\r\n\tcomplex ephase = cassign(0.0, 0.0);\r\n\tcomplex comp_sld = cassign(0.0, 0.0);\r\n\r\n\tcomplex sumj_uu;\r\n\tcomplex sumj_ud;\r\n\tcomplex sumj_du;\r\n\tcomplex sumj_dd;\r\n\tcomplex temp_fi;\r\n\r\n\tdouble count = 0.0;\r\n\t\/\/check if this computation is for averaging\r\n\r\n\t\/\/Assume that pixel volumes are given in vol_pix in A^3 unit\r\n\t\/\/int x_size = 0; \/\/in Ang\r\n\t\/\/int y_size = 0; \/\/in Ang\r\n\t\/\/int z_size = 0; \/\/in Ang\r\n\t\r\n\t\/\/ Loop over q-values and multiply apply matrix\r\n\t\r\n\tfor(int i=0; i<npoints; i++){\r\n\t\t\/\/I_out[i] = 0.0;\r\n\t\tsumj_uu = cassign(0.0, 0.0);\r\n\t\tsumj_ud = cassign(0.0, 0.0);\r\n\t\tsumj_du = cassign(0.0, 0.0);\r\n\t\tsumj_dd = cassign(0.0, 0.0);\t\t\r\n\t\t\/\/printf (\"%d \", i);\r\n\t\t\/\/q = sqrt(qx[i]*qx[i] + qy[i]*qy[i]); \/\/ + qz[i]*qz[i]);\r\n\r\n\t\tfor(int j=0; j<n_pix; j++){\r\n\t\t\tif (sldn_val[j]!=0.0||mx_val[j]!=0.0||my_val[j]!=0.0||mz_val[j]!=0.0)\r\n\t\t\t{\t\r\n\t\t\t\t\/\/anisotropic\r\n\t\t\t\ttemp_fi = cassign(0.0, 0.0);\r\n\t\t\t\tb_sld = cal_msld(0, qx[i], qy[i], sldn_val[j],\r\n\t\t\t\t\t\t\t mx_val[j], my_val[j], mz_val[j],\r\n\t\t\t \t\t\t\t inspin, outspin, stheta);\r\n\t\t\t\tqr = (qx[i]*x_val[j] + qy[i]*y_val[j]);\r\n\t\t\t\tiqr = cassign(0.0, qr);\r\n\t\t\t\tephase = cplx_exp(iqr);\r\n\t\t\t\t\r\n\t\t\t\t\/\/Let's multiply pixel(atomic) volume here\r\n\t\t\t\tephase = rcmult(vol_pix[j], ephase);\r\n\t\t\t\t\/\/up_up\r\n\t\t\t\tif (inspin > 0.0 && outspin > 0.0){\r\n\t\t\t\t\tcomp_sld = cassign(b_sld.uu, 0.0);\r\n\t\t\t\t\ttemp_fi = cplx_mult(comp_sld, ephase);\r\n\t\t\t\t\tsumj_uu = cplx_add(sumj_uu, temp_fi);\r\n\t\t\t\t}\r\n\t\t\t\t\/\/down_down\r\n\t\t\t\tif (inspin < 1.0 && outspin < 1.0){\r\n\t\t\t\t\tcomp_sld = cassign(b_sld.dd, 0.0);\r\n\t\t\t\t\ttemp_fi = cplx_mult(comp_sld, ephase);\r\n\t\t\t\t\tsumj_dd = cplx_add(sumj_dd, temp_fi);\r\n\t\t\t\t}\r\n\t\t\t\t\/\/up_down\r\n\t\t\t\tif (inspin > 0.0 && outspin < 1.0){\r\n\t\t\t\t\tcomp_sld = cassign(b_sld.re_ud, b_sld.im_ud);\r\n\t\t\t\t\ttemp_fi = cplx_mult(comp_sld, ephase);\r\n\t\t\t\t\tsumj_ud = cplx_add(sumj_ud, temp_fi);\r\n\t\t\t\t}\r\n\t\t\t\t\/\/down_up\r\n\t\t\t\tif (inspin < 1.0 && outspin > 0.0){\r\n\t\t\t\t\tcomp_sld = cassign(b_sld.re_du, b_sld.im_du);\r\n\t\t\t\t\ttemp_fi = cplx_mult(comp_sld, ephase);\r\n\t\t\t\t\tsumj_du = cplx_add(sumj_du, temp_fi);\r\n\t\t\t\t}\r\n\r\n\r\n\t\t\t\tif (i == 0){\r\n\t\t\t\t\tcount += vol_pix[j];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\t\/\/printf(\"aa%d=%g %g %d\\n\", i, (sumj_uu.re*sumj_uu.re + sumj_uu.im*sumj_uu.im), (sumj_dd.re*sumj_dd.re + sumj_dd.im*sumj_dd.im), count);\r\n\r\n\t\tI_out[i] = (sumj_uu.re*sumj_uu.re + sumj_uu.im*sumj_uu.im);\r\n\t\tI_out[i] += (sumj_ud.re*sumj_ud.re + sumj_ud.im*sumj_ud.im);\r\n\t\tI_out[i] += (sumj_du.re*sumj_du.re + sumj_du.im*sumj_du.im);\r\n\t\tI_out[i] += (sumj_dd.re*sumj_dd.re + sumj_dd.im*sumj_dd.im);\r\n\r\n\t\tI_out[i] *= (1.0E+8 \/ count); \/\/in cm (unit) \/ number; \/\/to be multiplied by vol_pix\r\n\t}\r\n\t\/\/printf (\"count = %d %g %g %g %g\\n\", count, sldn_val[0],mx_val[0], my_val[0], mz_val[0]);\r\n}\r\n\/**\r\n * Compute 1D isotropic\r\n * Isotropic: Assumes all slds are real (no magnetic)\r\n * Also assumes there is no polarization: No dependency on spin\r\n *\/\r\nvoid GenI :: genicom(int npoints, double *q, double *I_out){\r\n\t\/\/npoints is given negative for angular averaging \r\n\t\/\/ Assumes that q doesn't have qz component and sld_n is all real\r\n\t\/\/double Pi = 4.0*atan(1.0);\r\n\tint is_sym = 0;\r\n\tdouble qr = 0.0;\r\n\tdouble sumj;\r\n\tdouble sld_j = 0.0;\r\n\tdouble count = 0.0;\r\n\tif (n_pix < 0 ){\r\n\t\tis_sym = 1;\r\n\t\tn_pix = n_pix * -1;\r\n\t}\r\n\t\/\/Assume that pixel volumes are given in vol_pix in A^3 unit\r\n\t\/\/ Loop over q-values and multiply apply matrix\r\n\tfor(size_t i=0; i<npoints; i++){\r\n\t\tsumj =0.0;\t\t\r\n\t\tfor(size_t j=0; j<n_pix; j++){\r\n\t\t\t\/\/Isotropic: Assumes all slds are real (no magnetic)\r\n\t\t\t\/\/Also assumes there is no polarization: No dependency on spin\r\n\t\t\tif (is_sym == 1){\r\n\t\t\t\t\/\/ approximation for a spherical symmetric particle\r\n\t\t\t\tqr = sqrt(x_val[j]*x_val[j]+y_val[j]*y_val[j]+z_val[j]*z_val[j])*q[i];\r\n\t\t\t\tif (qr > 0.0){\r\n\t\t\t\t\tqr = sin(qr) \/ qr;\r\n\t\t\t\t\tsumj += sldn_val[j] * vol_pix[j] * qr;\r\n\t\t\t\t}\r\n\t\t\t\telse{\r\n\t\t\t\t\tsumj += sldn_val[j] * vol_pix[j];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse{\r\n\t\t\t\t\/\/full calculation\r\n\t\t\t\t#pragma omp parallel for\r\n\t\t\t\tfor(size_t k=0; k<n_pix; k++){\r\n\t\t\t\t\tsld_j =  sldn_val[j] * sldn_val[k] * vol_pix[j] * vol_pix[k];\r\n\t\t\t\t\tqr = (x_val[j]-x_val[k])*(x_val[j]-x_val[k])+\r\n\t\t\t\t\t\t      (y_val[j]-y_val[k])*(y_val[j]-y_val[k])+ \r\n\t\t\t\t\t\t      (z_val[j]-z_val[k])*(z_val[j]-z_val[k]);\r\n\t\t\t\t\tqr = sqrt(qr) * q[i];\r\n\t\t\t\t\tif (qr > 0.0){\r\n\t\t\t\t\t\tsumj += sld_j*sin(qr)\/qr;\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse{\r\n\t\t\t\t\t\tsumj += sld_j;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tif (i == 0){\r\n\t\t\t\tcount += vol_pix[j];\r\n\t\t\t}\r\n\t\t}\r\n\t\tI_out[i] = sumj;\r\n\t\tif (is_sym == 1){\r\n\t\t\tI_out[i] *= sumj;\r\n\t\t}\r\n\t\tI_out[i] *= (1.0E+8 \/ count); \/\/in cm (unit) \/ number; \/\/to be multiplied by vol_pix\r\n\t}\r\n\t\/\/printf (\"count = %d %g %g %g %g\\n\", count, sldn_val[0],mx_val[0], my_val[0], mz_val[0]);\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\/\n\/*  texture_progress.cpp                                                 *\/\n\/*************************************************************************\/\n\/*                       This file is part of:                           *\/\n\/*                           GODOT ENGINE                                *\/\n\/*                    http:\/\/www.godotengine.org                         *\/\n\/*************************************************************************\/\n\/* Copyright (c) 2007-2015 Juan Linietsky, Ariel Manzur.                 *\/\n\/*                                                                       *\/\n\/* Permission is hereby granted, free of charge, to any person obtaining *\/\n\/* a copy of this software and associated documentation files (the       *\/\n\/* \"Software\"), to deal in the Software without restriction, including   *\/\n\/* without limitation the rights to use, copy, modify, merge, publish,   *\/\n\/* distribute, sublicense, and\/or sell copies of the Software, and to    *\/\n\/* permit persons to whom the Software is furnished to do so, subject to *\/\n\/* the following conditions:                                             *\/\n\/*                                                                       *\/\n\/* The above copyright notice and this permission notice shall be        *\/\n\/* included in all copies or substantial portions of the Software.       *\/\n\/*                                                                       *\/\n\/* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,       *\/\n\/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF    *\/\n\/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*\/\n\/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY  *\/\n\/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,  *\/\n\/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE     *\/\n\/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.                *\/\n\/*************************************************************************\/\n#include \"texture_progress.h\"\n\n\nvoid TextureProgress::set_under_texture(const Ref<Texture>& p_texture) {\n\n\tunder=p_texture;\n\tupdate();\n\tminimum_size_changed();\n}\n\nRef<Texture> TextureProgress::get_under_texture() const{\n\n\treturn under;\n\n}\n\nvoid TextureProgress::set_over_texture(const Ref<Texture>& p_texture) {\n\n\tover=p_texture;\n\tupdate();\n\tminimum_size_changed();\n}\n\nRef<Texture> TextureProgress::get_over_texture() const{\n\n\treturn over;\n\n}\n\nSize2 TextureProgress::get_minimum_size() const {\n\n\tif (under.is_valid())\n\t\treturn under->get_size();\n\telse if (over.is_valid())\n\t\treturn over->get_size();\n\telse if (progress.is_valid())\n\t\treturn progress->get_size();\n\n\treturn Size2(1,1);\n}\n\nvoid TextureProgress::set_progress_texture(const Ref<Texture>& p_texture) {\n\n\tprogress=p_texture;\n\tupdate();\n\tminimum_size_changed();\n}\n\nRef<Texture> TextureProgress::get_progress_texture() const{\n\n\treturn progress;\n\n}\n\nPoint2 TextureProgress::unit_val_to_uv(float val) {\n\tif (progress.is_null())\n\t\treturn Point2();\n\n\tif (val<0)\n\t\tval+=1;\n\tif (val>1)\n\t\tval-=1;\n\n\tPoint2 p=get_relative_center();\n\n\tif (val<0.125)\n\t\treturn Point2(p.x+(1-p.x)*val*8,0);\n\tif (val<0.25)\n\t\treturn Point2(1,p.y*(val-0.125)*8);\n\tif (val<0.375)\n\t\treturn Point2(1,p.y+(1-p.y)*(val-0.25)*8);\n\tif (val<0.5)\n\t\treturn Point2(1-(1-p.x)*(val-0.375)*8,1);\n\tif (val<0.625)\n\t\treturn Point2(p.x*(1-(val-0.5)*8),1);\n\tif (val<0.75)\n\t\treturn Point2(0,1-((1-p.y)*(val-0.625)*8));\n\tif (val<0.875)\n\t\treturn Point2(0,p.y-p.y*(val-0.75)*8);\n\telse\n\t\treturn Point2(p.x*(val-0.875)*8,0);\n}\n\nPoint2 TextureProgress::get_relative_center()\n{\n\tif (progress.is_null())\n\t\treturn Point2();\n\tPoint2 p = progress->get_size()\/2;\n\tp+=rad_center_off;\n\tp.x\/=progress->get_width();\n\tp.y\/=progress->get_height();\n\tp.x=CLAMP(p.x,0,1);\n\tp.y=CLAMP(p.y,0,1);\n\treturn p;\n}\n\nvoid TextureProgress::_notification(int p_what){\n\tconst float corners[12]={-0.125,-0.375,-0.625,-0.875,0.125,0.375,0.625,0.875,1.125,1.375,1.625,1.875};\n\tswitch(p_what) {\n\n\t\tcase NOTIFICATION_DRAW: {\n\n\n\t\t\tif (under.is_valid())\n\t\t\t\tdraw_texture(under,Point2());\n\t\t\tif (progress.is_valid()) {\n\t\t\t\tSize2 s = progress->get_size();\n\t\t\t\tswitch (mode) {\n\t\t\t\tcase FILL_LEFT_TO_RIGHT: {\n\t\t\t\t\tRect2 region=Rect2(Point2(),Size2(s.x*get_unit_value(),s.y));\n\t\t\t\t\tdraw_texture_rect_region(progress,region,region);\n\t\t\t\t} break;\n\t\t\t\tcase FILL_RIGHT_TO_LEFT: {\n\t\t\t\t\tRect2 region=Rect2(Point2(s.x-s.x*get_unit_value(),0),Size2(s.x*get_unit_value(),s.y));\n\t\t\t\t\tdraw_texture_rect_region(progress,region,region);\n\t\t\t\t} break;\n\t\t\t\tcase FILL_TOP_TO_BOTTOM: {\n\t\t\t\t\tRect2 region=Rect2(Point2(),Size2(s.x,s.y*get_unit_value()));\n\t\t\t\t\tdraw_texture_rect_region(progress,region,region);\n\t\t\t\t} break;\n\t\t\t\tcase FILL_BOTTOM_TO_TOP: {\n\t\t\t\t\tRect2 region=Rect2(Point2(0,s.y-s.y*get_unit_value()),Size2(s.x,s.y*get_unit_value()));\n\t\t\t\t\tdraw_texture_rect_region(progress,region,region);\n\t\t\t\t} break;\n\t\t\t\tcase FILL_CLOCKWISE:\n\t\t\t\tcase FILL_COUNTER_CLOCKWISE: {\n\t\t\t\t\tfloat val=get_unit_value()*rad_max_degrees\/360;\n\t\t\t\t\tif (val==1) {\n\t\t\t\t\t\tRect2 region=Rect2(Point2(),s);\n\t\t\t\t\t\tdraw_texture_rect_region(progress,region,region);\n\t\t\t\t\t} else if (val!=0) {\n\t\t\t\t\t\tArray pts;\n\t\t\t\t\t\tfloat direction=mode==FILL_CLOCKWISE?1:-1;\n\t\t\t\t\t\tfloat start=rad_init_angle\/360;\n\t\t\t\t\t\tfloat end=start+direction*val;\n\t\t\t\t\t\tpts.append(start);\n\t\t\t\t\t\tpts.append(end);\n\t\t\t\t\t\tfloat from=MIN(start,end);\n\t\t\t\t\t\tfloat to=MAX(start,end);\n\t\t\t\t\t\tfor (int i=0;i<12;i++)\n\t\t\t\t\t\t\tif (corners[i]>from&&corners[i]<to)\n\t\t\t\t\t\t\t\tpts.append(corners[i]);\n\t\t\t\t\t\tpts.sort();\n\t\t\t\t\t\tVector<Point2> uvs;\n\t\t\t\t\t\tVector<Point2> points;\n\t\t\t\t\t\tuvs.push_back(get_relative_center());\n\t\t\t\t\t\tpoints.push_back(Point2(s.x*get_relative_center().x,s.y*get_relative_center().y));\n\t\t\t\t\t\tfor (int i=0;i<pts.size();i++) {\n\t\t\t\t\t\t\tPoint2 uv=unit_val_to_uv(pts[i]);\n\t\t\t\t\t\t\tif (uvs.find(uv)>=0)\n\t\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t\tuvs.push_back(uv);\n\t\t\t\t\t\t\tpoints.push_back(Point2(uv.x*s.x,uv.y*s.y));\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdraw_polygon(points,Vector<Color>(),uvs,progress);\n\t\t\t\t\t}\n\t\t\t\t\tif (get_tree()->is_editor_hint()) {\n\t\t\t\t\t\tPoint2 p=progress->get_size();\n\t\t\t\t\t\tp.x*=get_relative_center().x;\n\t\t\t\t\t\tp.y*=get_relative_center().y;\n\t\t\t\t\t\tp=p.floor();\n\t\t\t\t\t\tdraw_line(p-Point2(8,0),p+Point2(8,0),Color(0.9,0.5,0.5),2);\n\t\t\t\t\t\tdraw_line(p-Point2(0,8),p+Point2(0,8),Color(0.9,0.5,0.5),2);\n\t\t\t\t\t}\n\t\t\t\t} break;\n\t\t\t\tdefault:\n\t\t\t\t\tdraw_texture_rect_region(progress,Rect2(Point2(),Size2(s.x*get_unit_value(),s.y)),Rect2(Point2(),Size2(s.x*get_unit_value(),s.y)));\n\t\t\t\t}\n\n\t\t\t\t\n\t\t\t}\n\t\t\tif (over.is_valid())\n\t\t\t\tdraw_texture(over,Point2());\n\n\t\t} break;\n\t}\n}\n\nvoid TextureProgress::set_fill_mode(int p_fill)\n{\n\tERR_FAIL_INDEX(p_fill,6);\n\tmode=(FillMode)p_fill;\n\tupdate();\n}\n\nint TextureProgress::get_fill_mode()\n{\n\treturn mode;\n}\n\nvoid TextureProgress::set_radial_initial_angle(float p_angle)\n{\n\twhile(p_angle>360)\n\t\tp_angle-=360;\n\twhile (p_angle<0)\n\t\tp_angle+=360;\n\trad_init_angle=p_angle;\n\tupdate();\n}\n\nfloat TextureProgress::get_radial_initial_angle()\n{\n\treturn rad_init_angle;\n}\n\nvoid TextureProgress::set_fill_degrees(float p_angle)\n{\n\twhile(p_angle>360)\n\t\tp_angle-=360;\n\twhile (p_angle<0)\n\t\tp_angle+=360;\n\trad_max_degrees=p_angle;\n\tupdate();\n}\n\nfloat TextureProgress::get_fill_degrees()\n{\n\treturn rad_max_degrees;\n}\n\nvoid TextureProgress::set_radial_center_offset(const Point2 &p_off)\n{\n\trad_center_off=p_off;\n\tupdate();\n}\n\nPoint2 TextureProgress::get_radial_center_offset()\n{\n\treturn rad_center_off;\n}\n\nvoid TextureProgress::_bind_methods() {\n\n\tObjectTypeDB::bind_method(_MD(\"set_under_texture\",\"tex\"),&TextureProgress::set_under_texture);\n\tObjectTypeDB::bind_method(_MD(\"get_under_texture\"),&TextureProgress::get_under_texture);\n\n\tObjectTypeDB::bind_method(_MD(\"set_progress_texture\",\"tex\"),&TextureProgress::set_progress_texture);\n\tObjectTypeDB::bind_method(_MD(\"get_progress_texture\"),&TextureProgress::get_progress_texture);\n\n\tObjectTypeDB::bind_method(_MD(\"set_over_texture\",\"tex\"),&TextureProgress::set_over_texture);\n\tObjectTypeDB::bind_method(_MD(\"get_over_texture\"),&TextureProgress::get_over_texture);\n\n\tObjectTypeDB::bind_method(_MD(\"set_fill_mode\",\"mode\"),&TextureProgress::set_fill_mode);\n\tObjectTypeDB::bind_method(_MD(\"get_fill_mode\"), &TextureProgress::get_fill_mode);\n\n\tObjectTypeDB::bind_method(_MD(\"set_radial_initial_angle\",\"mode\"),&TextureProgress::set_radial_initial_angle);\n\tObjectTypeDB::bind_method(_MD(\"get_radial_initial_angle\"), &TextureProgress::get_radial_initial_angle);\n\t\n\tObjectTypeDB::bind_method(_MD(\"set_radial_center_offset\",\"mode\"),&TextureProgress::set_radial_center_offset);\n\tObjectTypeDB::bind_method(_MD(\"get_radial_center_offset\"), &TextureProgress::get_radial_center_offset);\n\t\n\tObjectTypeDB::bind_method(_MD(\"set_fill_degrees\",\"mode\"),&TextureProgress::set_fill_degrees);\n\tObjectTypeDB::bind_method(_MD(\"get_fill_degrees\"), &TextureProgress::get_fill_degrees);\n\n\tADD_PROPERTY( PropertyInfo(Variant::OBJECT,\"texture\/under\",PROPERTY_HINT_RESOURCE_TYPE,\"Texture\"),_SCS(\"set_under_texture\"),_SCS(\"get_under_texture\"));\n\tADD_PROPERTY( PropertyInfo(Variant::OBJECT,\"texture\/over\",PROPERTY_HINT_RESOURCE_TYPE,\"Texture\"),_SCS(\"set_over_texture\"),_SCS(\"get_over_texture\"));\n\tADD_PROPERTY( PropertyInfo(Variant::OBJECT,\"texture\/progress\",PROPERTY_HINT_RESOURCE_TYPE,\"Texture\"),_SCS(\"set_progress_texture\"),_SCS(\"get_progress_texture\"));\n\tADD_PROPERTYNZ( PropertyInfo(Variant::INT,\"mode\",PROPERTY_HINT_ENUM,\"Left to Right,Right to Left,Top to Bottom,Bottom to Top,Clockwise,Counter Clockwise\"),_SCS(\"set_fill_mode\"),_SCS(\"get_fill_mode\"));\n\tADD_PROPERTYNZ( PropertyInfo(Variant::REAL,\"radial_fill\/initial_angle\",PROPERTY_HINT_RANGE,\"0.0,360.0,0.1,slider\"),_SCS(\"set_radial_initial_angle\"),_SCS(\"get_radial_initial_angle\"));\n\tADD_PROPERTYNZ( PropertyInfo(Variant::REAL,\"radial_fill\/fill_degrees\",PROPERTY_HINT_RANGE,\"0.0,360.0,0.1,slider\"),_SCS(\"set_fill_degrees\"),_SCS(\"get_fill_degrees\"));\n\tADD_PROPERTY( PropertyInfo(Variant::VECTOR2,\"radial_fill\/center_offset\"),_SCS(\"set_radial_center_offset\"),_SCS(\"get_radial_center_offset\"));\n\n\tBIND_CONSTANT( FILL_LEFT_TO_RIGHT );\n\tBIND_CONSTANT( FILL_RIGHT_TO_LEFT );\n\tBIND_CONSTANT( FILL_TOP_TO_BOTTOM );\n\tBIND_CONSTANT( FILL_BOTTOM_TO_TOP );\n\tBIND_CONSTANT( FILL_CLOCKWISE );\n\tBIND_CONSTANT( FILL_COUNTER_CLOCKWISE );\n\n}\n\n\nTextureProgress::TextureProgress()\n{\n\tmode=FILL_LEFT_TO_RIGHT;\n\trad_center_off=Point2();\n\trad_max_degrees=360;\n}\n<commit_msg>Clamp filling angle instead of normalize<commit_after>\/*************************************************************************\/\n\/*  texture_progress.cpp                                                 *\/\n\/*************************************************************************\/\n\/*                       This file is part of:                           *\/\n\/*                           GODOT ENGINE                                *\/\n\/*                    http:\/\/www.godotengine.org                         *\/\n\/*************************************************************************\/\n\/* Copyright (c) 2007-2015 Juan Linietsky, Ariel Manzur.                 *\/\n\/*                                                                       *\/\n\/* Permission is hereby granted, free of charge, to any person obtaining *\/\n\/* a copy of this software and associated documentation files (the       *\/\n\/* \"Software\"), to deal in the Software without restriction, including   *\/\n\/* without limitation the rights to use, copy, modify, merge, publish,   *\/\n\/* distribute, sublicense, and\/or sell copies of the Software, and to    *\/\n\/* permit persons to whom the Software is furnished to do so, subject to *\/\n\/* the following conditions:                                             *\/\n\/*                                                                       *\/\n\/* The above copyright notice and this permission notice shall be        *\/\n\/* included in all copies or substantial portions of the Software.       *\/\n\/*                                                                       *\/\n\/* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,       *\/\n\/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF    *\/\n\/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*\/\n\/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY  *\/\n\/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,  *\/\n\/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE     *\/\n\/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.                *\/\n\/*************************************************************************\/\n#include \"texture_progress.h\"\n\n\nvoid TextureProgress::set_under_texture(const Ref<Texture>& p_texture) {\n\n\tunder=p_texture;\n\tupdate();\n\tminimum_size_changed();\n}\n\nRef<Texture> TextureProgress::get_under_texture() const{\n\n\treturn under;\n\n}\n\nvoid TextureProgress::set_over_texture(const Ref<Texture>& p_texture) {\n\n\tover=p_texture;\n\tupdate();\n\tminimum_size_changed();\n}\n\nRef<Texture> TextureProgress::get_over_texture() const{\n\n\treturn over;\n\n}\n\nSize2 TextureProgress::get_minimum_size() const {\n\n\tif (under.is_valid())\n\t\treturn under->get_size();\n\telse if (over.is_valid())\n\t\treturn over->get_size();\n\telse if (progress.is_valid())\n\t\treturn progress->get_size();\n\n\treturn Size2(1,1);\n}\n\nvoid TextureProgress::set_progress_texture(const Ref<Texture>& p_texture) {\n\n\tprogress=p_texture;\n\tupdate();\n\tminimum_size_changed();\n}\n\nRef<Texture> TextureProgress::get_progress_texture() const{\n\n\treturn progress;\n\n}\n\nPoint2 TextureProgress::unit_val_to_uv(float val) {\n\tif (progress.is_null())\n\t\treturn Point2();\n\n\tif (val<0)\n\t\tval+=1;\n\tif (val>1)\n\t\tval-=1;\n\n\tPoint2 p=get_relative_center();\n\n\tif (val<0.125)\n\t\treturn Point2(p.x+(1-p.x)*val*8,0);\n\tif (val<0.25)\n\t\treturn Point2(1,p.y*(val-0.125)*8);\n\tif (val<0.375)\n\t\treturn Point2(1,p.y+(1-p.y)*(val-0.25)*8);\n\tif (val<0.5)\n\t\treturn Point2(1-(1-p.x)*(val-0.375)*8,1);\n\tif (val<0.625)\n\t\treturn Point2(p.x*(1-(val-0.5)*8),1);\n\tif (val<0.75)\n\t\treturn Point2(0,1-((1-p.y)*(val-0.625)*8));\n\tif (val<0.875)\n\t\treturn Point2(0,p.y-p.y*(val-0.75)*8);\n\telse\n\t\treturn Point2(p.x*(val-0.875)*8,0);\n}\n\nPoint2 TextureProgress::get_relative_center()\n{\n\tif (progress.is_null())\n\t\treturn Point2();\n\tPoint2 p = progress->get_size()\/2;\n\tp+=rad_center_off;\n\tp.x\/=progress->get_width();\n\tp.y\/=progress->get_height();\n\tp.x=CLAMP(p.x,0,1);\n\tp.y=CLAMP(p.y,0,1);\n\treturn p;\n}\n\nvoid TextureProgress::_notification(int p_what){\n\tconst float corners[12]={-0.125,-0.375,-0.625,-0.875,0.125,0.375,0.625,0.875,1.125,1.375,1.625,1.875};\n\tswitch(p_what) {\n\n\t\tcase NOTIFICATION_DRAW: {\n\n\n\t\t\tif (under.is_valid())\n\t\t\t\tdraw_texture(under,Point2());\n\t\t\tif (progress.is_valid()) {\n\t\t\t\tSize2 s = progress->get_size();\n\t\t\t\tswitch (mode) {\n\t\t\t\tcase FILL_LEFT_TO_RIGHT: {\n\t\t\t\t\tRect2 region=Rect2(Point2(),Size2(s.x*get_unit_value(),s.y));\n\t\t\t\t\tdraw_texture_rect_region(progress,region,region);\n\t\t\t\t} break;\n\t\t\t\tcase FILL_RIGHT_TO_LEFT: {\n\t\t\t\t\tRect2 region=Rect2(Point2(s.x-s.x*get_unit_value(),0),Size2(s.x*get_unit_value(),s.y));\n\t\t\t\t\tdraw_texture_rect_region(progress,region,region);\n\t\t\t\t} break;\n\t\t\t\tcase FILL_TOP_TO_BOTTOM: {\n\t\t\t\t\tRect2 region=Rect2(Point2(),Size2(s.x,s.y*get_unit_value()));\n\t\t\t\t\tdraw_texture_rect_region(progress,region,region);\n\t\t\t\t} break;\n\t\t\t\tcase FILL_BOTTOM_TO_TOP: {\n\t\t\t\t\tRect2 region=Rect2(Point2(0,s.y-s.y*get_unit_value()),Size2(s.x,s.y*get_unit_value()));\n\t\t\t\t\tdraw_texture_rect_region(progress,region,region);\n\t\t\t\t} break;\n\t\t\t\tcase FILL_CLOCKWISE:\n\t\t\t\tcase FILL_COUNTER_CLOCKWISE: {\n\t\t\t\t\tfloat val=get_unit_value()*rad_max_degrees\/360;\n\t\t\t\t\tif (val==1) {\n\t\t\t\t\t\tRect2 region=Rect2(Point2(),s);\n\t\t\t\t\t\tdraw_texture_rect_region(progress,region,region);\n\t\t\t\t\t} else if (val!=0) {\n\t\t\t\t\t\tArray pts;\n\t\t\t\t\t\tfloat direction=mode==FILL_CLOCKWISE?1:-1;\n\t\t\t\t\t\tfloat start=rad_init_angle\/360;\n\t\t\t\t\t\tfloat end=start+direction*val;\n\t\t\t\t\t\tpts.append(start);\n\t\t\t\t\t\tpts.append(end);\n\t\t\t\t\t\tfloat from=MIN(start,end);\n\t\t\t\t\t\tfloat to=MAX(start,end);\n\t\t\t\t\t\tfor (int i=0;i<12;i++)\n\t\t\t\t\t\t\tif (corners[i]>from&&corners[i]<to)\n\t\t\t\t\t\t\t\tpts.append(corners[i]);\n\t\t\t\t\t\tpts.sort();\n\t\t\t\t\t\tVector<Point2> uvs;\n\t\t\t\t\t\tVector<Point2> points;\n\t\t\t\t\t\tuvs.push_back(get_relative_center());\n\t\t\t\t\t\tpoints.push_back(Point2(s.x*get_relative_center().x,s.y*get_relative_center().y));\n\t\t\t\t\t\tfor (int i=0;i<pts.size();i++) {\n\t\t\t\t\t\t\tPoint2 uv=unit_val_to_uv(pts[i]);\n\t\t\t\t\t\t\tif (uvs.find(uv)>=0)\n\t\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t\tuvs.push_back(uv);\n\t\t\t\t\t\t\tpoints.push_back(Point2(uv.x*s.x,uv.y*s.y));\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdraw_polygon(points,Vector<Color>(),uvs,progress);\n\t\t\t\t\t}\n\t\t\t\t\tif (get_tree()->is_editor_hint()) {\n\t\t\t\t\t\tPoint2 p=progress->get_size();\n\t\t\t\t\t\tp.x*=get_relative_center().x;\n\t\t\t\t\t\tp.y*=get_relative_center().y;\n\t\t\t\t\t\tp=p.floor();\n\t\t\t\t\t\tdraw_line(p-Point2(8,0),p+Point2(8,0),Color(0.9,0.5,0.5),2);\n\t\t\t\t\t\tdraw_line(p-Point2(0,8),p+Point2(0,8),Color(0.9,0.5,0.5),2);\n\t\t\t\t\t}\n\t\t\t\t} break;\n\t\t\t\tdefault:\n\t\t\t\t\tdraw_texture_rect_region(progress,Rect2(Point2(),Size2(s.x*get_unit_value(),s.y)),Rect2(Point2(),Size2(s.x*get_unit_value(),s.y)));\n\t\t\t\t}\n\n\t\t\t\t\n\t\t\t}\n\t\t\tif (over.is_valid())\n\t\t\t\tdraw_texture(over,Point2());\n\n\t\t} break;\n\t}\n}\n\nvoid TextureProgress::set_fill_mode(int p_fill)\n{\n\tERR_FAIL_INDEX(p_fill,6);\n\tmode=(FillMode)p_fill;\n\tupdate();\n}\n\nint TextureProgress::get_fill_mode()\n{\n\treturn mode;\n}\n\nvoid TextureProgress::set_radial_initial_angle(float p_angle)\n{\n\twhile(p_angle>360)\n\t\tp_angle-=360;\n\twhile (p_angle<0)\n\t\tp_angle+=360;\n\trad_init_angle=p_angle;\n\tupdate();\n}\n\nfloat TextureProgress::get_radial_initial_angle()\n{\n\treturn rad_init_angle;\n}\n\nvoid TextureProgress::set_fill_degrees(float p_angle)\n{\n\trad_max_degrees=CLAMP(p_angle,0,360);\n\tupdate();\n}\n\nfloat TextureProgress::get_fill_degrees()\n{\n\treturn rad_max_degrees;\n}\n\nvoid TextureProgress::set_radial_center_offset(const Point2 &p_off)\n{\n\trad_center_off=p_off;\n\tupdate();\n}\n\nPoint2 TextureProgress::get_radial_center_offset()\n{\n\treturn rad_center_off;\n}\n\nvoid TextureProgress::_bind_methods() {\n\n\tObjectTypeDB::bind_method(_MD(\"set_under_texture\",\"tex\"),&TextureProgress::set_under_texture);\n\tObjectTypeDB::bind_method(_MD(\"get_under_texture\"),&TextureProgress::get_under_texture);\n\n\tObjectTypeDB::bind_method(_MD(\"set_progress_texture\",\"tex\"),&TextureProgress::set_progress_texture);\n\tObjectTypeDB::bind_method(_MD(\"get_progress_texture\"),&TextureProgress::get_progress_texture);\n\n\tObjectTypeDB::bind_method(_MD(\"set_over_texture\",\"tex\"),&TextureProgress::set_over_texture);\n\tObjectTypeDB::bind_method(_MD(\"get_over_texture\"),&TextureProgress::get_over_texture);\n\n\tObjectTypeDB::bind_method(_MD(\"set_fill_mode\",\"mode\"),&TextureProgress::set_fill_mode);\n\tObjectTypeDB::bind_method(_MD(\"get_fill_mode\"), &TextureProgress::get_fill_mode);\n\n\tObjectTypeDB::bind_method(_MD(\"set_radial_initial_angle\",\"mode\"),&TextureProgress::set_radial_initial_angle);\n\tObjectTypeDB::bind_method(_MD(\"get_radial_initial_angle\"), &TextureProgress::get_radial_initial_angle);\n\t\n\tObjectTypeDB::bind_method(_MD(\"set_radial_center_offset\",\"mode\"),&TextureProgress::set_radial_center_offset);\n\tObjectTypeDB::bind_method(_MD(\"get_radial_center_offset\"), &TextureProgress::get_radial_center_offset);\n\t\n\tObjectTypeDB::bind_method(_MD(\"set_fill_degrees\",\"mode\"),&TextureProgress::set_fill_degrees);\n\tObjectTypeDB::bind_method(_MD(\"get_fill_degrees\"), &TextureProgress::get_fill_degrees);\n\n\tADD_PROPERTY( PropertyInfo(Variant::OBJECT,\"texture\/under\",PROPERTY_HINT_RESOURCE_TYPE,\"Texture\"),_SCS(\"set_under_texture\"),_SCS(\"get_under_texture\"));\n\tADD_PROPERTY( PropertyInfo(Variant::OBJECT,\"texture\/over\",PROPERTY_HINT_RESOURCE_TYPE,\"Texture\"),_SCS(\"set_over_texture\"),_SCS(\"get_over_texture\"));\n\tADD_PROPERTY( PropertyInfo(Variant::OBJECT,\"texture\/progress\",PROPERTY_HINT_RESOURCE_TYPE,\"Texture\"),_SCS(\"set_progress_texture\"),_SCS(\"get_progress_texture\"));\n\tADD_PROPERTYNZ( PropertyInfo(Variant::INT,\"mode\",PROPERTY_HINT_ENUM,\"Left to Right,Right to Left,Top to Bottom,Bottom to Top,Clockwise,Counter Clockwise\"),_SCS(\"set_fill_mode\"),_SCS(\"get_fill_mode\"));\n\tADD_PROPERTYNZ( PropertyInfo(Variant::REAL,\"radial_fill\/initial_angle\",PROPERTY_HINT_RANGE,\"0.0,360.0,0.1,slider\"),_SCS(\"set_radial_initial_angle\"),_SCS(\"get_radial_initial_angle\"));\n\tADD_PROPERTYNZ( PropertyInfo(Variant::REAL,\"radial_fill\/fill_degrees\",PROPERTY_HINT_RANGE,\"0.0,360.0,0.1,slider\"),_SCS(\"set_fill_degrees\"),_SCS(\"get_fill_degrees\"));\n\tADD_PROPERTY( PropertyInfo(Variant::VECTOR2,\"radial_fill\/center_offset\"),_SCS(\"set_radial_center_offset\"),_SCS(\"get_radial_center_offset\"));\n\n\tBIND_CONSTANT( FILL_LEFT_TO_RIGHT );\n\tBIND_CONSTANT( FILL_RIGHT_TO_LEFT );\n\tBIND_CONSTANT( FILL_TOP_TO_BOTTOM );\n\tBIND_CONSTANT( FILL_BOTTOM_TO_TOP );\n\tBIND_CONSTANT( FILL_CLOCKWISE );\n\tBIND_CONSTANT( FILL_COUNTER_CLOCKWISE );\n\n}\n\n\nTextureProgress::TextureProgress()\n{\n\tmode=FILL_LEFT_TO_RIGHT;\n\trad_center_off=Point2();\n\trad_max_degrees=360;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/@author A0097630B\n#include \"stdafx.h\"\n#include \"You-NLP\/parse_tree\/task_priority.h\"\n#include \"internal\/query_executor.h\"\n#include \"internal\/query_executor_builder_visitor.h\"\n#include \"exceptions\/context_index_out_of_range_exception.h\"\n\n#include \"..\/mocks\/task_list.h\"\n#include \"..\/mocks\/query.h\"\n\nusing Assert = Microsoft::VisualStudio::CppUnitTestFramework::Assert;\n\nnamespace Microsoft {\nnamespace VisualStudio {\nnamespace CppUnitTestFramework {\n\nstd::wstring ToString(You::Controller::Task::Priority priority) {\n\treturn ToString(static_cast<int>(priority));\n}\n\n}  \/\/ namespace CppUnitTestFramework\n}  \/\/ namespace VisualStudio\n}  \/\/ namespace Microsoft\n\nnamespace You {\nnamespace Controller {\nnamespace Internal {\nnamespace UnitTests {\n\nnamespace Mocks {\n\t\/\/ NOLINTNEXTLINE(build\/namespaces)\n\tusing namespace You::Controller::UnitTests::Mocks;\n}\n\nusing Task = You::Controller::Task;\nusing TaskPriority = You::NLP::TaskPriority;\n\nTEST_CLASS(QueryExecutorBuilderVisitorTests) {\n\tTEST_METHOD(getsCorrectTypeForAddQueries) {\n\t\tMocks::TaskList taskList;\n\t\tQueryExecutorBuilderVisitor visitor(taskList);\n\n\t\tYou::NLP::QUERY query(Mocks::Queries::ADD_QUERY);\n\t\tstd::unique_ptr<QueryExecutor> executor(\n\t\t\tboost::apply_visitor(visitor, query));\n\t\tADD_RESULT result(\n\t\t\tboost::get<ADD_RESULT>(executor->execute()));\n\n\t\tAssert::AreEqual(\n\t\t\tMocks::Queries::ADD_QUERY.description,\n\t\t\tresult.task.getDescription());\n\t\tAssert::AreEqual(\n\t\t\tTask::Priority::NORMAL,\n\t\t\tresult.task.getPriority());\n\t\tAssert::AreEqual(\n\t\t\tMocks::Queries::ADD_QUERY.deadline.get(),\n\t\t\tresult.task.getDeadline());\n\n\t\tYou::NLP::ADD_QUERY queryWithoutDeadline(Mocks::Queries::ADD_QUERY);\n\t\tqueryWithoutDeadline.deadline =\n\t\t\tYou::Utils::Option<boost::posix_time::ptime>();\n\t\tquery = queryWithoutDeadline;\n\t\texecutor = boost::apply_visitor(visitor, query);\n\t\tresult = boost::get<ADD_RESULT>(executor->execute());\n\n\t\tAssert::AreEqual(\n\t\t\tMocks::Queries::ADD_QUERY.description,\n\t\t\tresult.task.getDescription());\n\t\tAssert::AreEqual(\n\t\t\tTask::Priority::NORMAL,\n\t\t\tresult.task.getPriority());\n\t\tAssert::AreEqual(\n\t\t\tTask::DEFAULT_DEADLINE,\n\t\t\tresult.task.getDeadline());\n\n\t\tYou::NLP::ADD_QUERY queryWithPriority(Mocks::Queries::ADD_QUERY);\n\t\tqueryWithPriority.priority = TaskPriority::HIGH;\n\t\tquery = queryWithPriority;\n\t\texecutor = boost::apply_visitor(visitor, query);\n\t\tresult = boost::get<ADD_RESULT>(executor->execute());\n\n\t\tAssert::AreEqual(\n\t\t\tMocks::Queries::ADD_QUERY.description,\n\t\t\tresult.task.getDescription());\n\t\tAssert::AreEqual(\n\t\t\tTask::Priority::HIGH,\n\t\t\tresult.task.getPriority());\n\t\tAssert::AreEqual(\n\t\t\tMocks::Queries::ADD_QUERY.deadline.get(),\n\t\t\tresult.task.getDeadline());\n\t}\n\n\tTEST_METHOD(getsCorrectTypeForShowQueries) {\n\t\tSHOW_RESULT result(\n\t\t\trunShowQuery(Mocks::Queries::SHOW_QUERY));\n\t\tAssert::IsTrue(\n\t\t\tstd::all_of(begin(result.tasks), end(result.tasks),\n\t\t\t[](const Task& task) {\n\t\t\treturn task.getDeadline() >\n\t\t\t\tboost::posix_time::second_clock::local_time() +\n\t\t\t\tboost::posix_time::hours(1);\n\t\t}));\n\t\tAssert::IsTrue(\n\t\t\tstd::is_sorted(begin(result.tasks), end(result.tasks),\n\t\t\t[](const Task& left, const Task& right) {\n\t\t\treturn left.getDeadline() > right.getDeadline();\n\t\t}));\n\n\t\tresult = runShowQuery(\n\t\t\tYou::NLP::SHOW_QUERY {\n\t\t\t\t{\n\t\t\t\t\t{\n\t\t\t\t\t\tYou::NLP::TaskField::PRIORITY,\n\t\t\t\t\t\tYou::NLP::SHOW_QUERY::Predicate::EQ,\n\t\t\t\t\t\tYou::NLP::TaskPriority::NORMAL\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\t{\n\t\t\t\t\t\tYou::NLP::TaskField::DESCRIPTION,\n\t\t\t\t\t\tYou::NLP::SHOW_QUERY::Order::ASCENDING\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t});\n\t\tAssert::IsTrue(\n\t\t\tstd::all_of(begin(result.tasks), end(result.tasks),\n\t\t\t[](const Task& task) {\n\t\t\treturn task.getPriority() ==\n\t\t\t\tYou::QueryEngine::Task::Priority::NORMAL;\n\t\t}));\n\t\tAssert::IsTrue(\n\t\t\tstd::is_sorted(begin(result.tasks), end(result.tasks),\n\t\t\t[](const Task& left, const Task& right) {\n\t\t\treturn left.getDescription() < right.getDescription();\n\t\t}));\n\n\t\tresult = runShowQuery(\n\t\t\tYou::NLP::SHOW_QUERY {\n\t\t\t\t{\n\t\t\t\t\t{\n\t\t\t\t\t\tYou::NLP::TaskField::COMPLETE,\n\t\t\t\t\t\tYou::NLP::SHOW_QUERY::Predicate::EQ,\n\t\t\t\t\t\tfalse\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\t{\n\t\t\t\t\t\tYou::NLP::TaskField::PRIORITY,\n\t\t\t\t\t\tYou::NLP::SHOW_QUERY::Order::DESCENDING\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t});\n\t\tAssert::IsTrue(\n\t\t\tstd::all_of(begin(result.tasks), end(result.tasks),\n\t\t\t[](const Task& task) {\n\t\t\treturn !task.isCompleted();\n\t\t}));\n\t\tAssert::IsTrue(\n\t\t\tstd::is_sorted(begin(result.tasks), end(result.tasks),\n\t\t\t[](const Task& left, const Task& right) {\n\t\t\treturn left.getPriority() > right.getPriority();\n\t\t}));\n\n\t\tappliesCorrectFilters();\n\t}\n\n\tvoid appliesCorrectFilters() {\n\t\t\/\/ Test filters more rigourously\n\t\tappliesCorrectFilters<You::NLP::TaskField::DESCRIPTION>(\n\t\t\tstd::bind(&Task::getDescription, std::placeholders::_1),\n\t\t\tstd::wstring(L\"meh 1\"));\n\n\t\tauto runTime = boost::posix_time::second_clock::local_time();\n\t\tappliesCorrectFilters<You::NLP::TaskField::DEADLINE>(\n\t\t\tstd::bind(&Task::getDeadline, std::placeholders::_1),\n\t\t\trunTime + boost::posix_time::hours(1));\n\n\t\tappliesCorrectFilters<You::NLP::TaskField::DEADLINE>(\n\t\t\tstd::bind(&Task::isCompleted, std::placeholders::_1), true);\n\t}\n\n\t\/\/\/ This is a very useful template function. Because it tests all 7\n\t\/\/\/ operators: equality, inequality, less than, less than or equal,\n\t\/\/\/ greater than, greater or equal on a type all at once.\n\t\/\/\/\n\t\/\/\/ \\tparam field The field to access\n\t\/\/\/ \\param getter The getter to access the record in the object.\n\t\/\/\/ \\param value The value to compare against.\n\ttemplate<You::NLP::TaskField field, typename TGetter, typename TValue>\n\tvoid appliesCorrectFilters(TGetter getter, const TValue& value) {\n\t\tSHOW_RESULT result(runShowQuery(You::NLP::SHOW_QUERY {\n\t\t\t\t{ { field, You::NLP::SHOW_QUERY::Predicate::EQ, value } }, {}\n\t\t\t}));\n\t\tAssert::IsTrue(\n\t\t\tstd::all_of(begin(result.tasks), end(result.tasks),\n\t\t\t[&getter, &value](const Task& task) {\n\t\t\treturn getter(task) == value;\n\t\t}));\n\n\t\tresult = runShowQuery(You::NLP::SHOW_QUERY {\n\t\t\t{ { field, You::NLP::SHOW_QUERY::Predicate::NOT_EQ, value } }, {}\n\t\t});\n\t\tAssert::IsTrue(\n\t\t\tstd::all_of(begin(result.tasks), end(result.tasks),\n\t\t\t[&getter, &value](const Task& task) {\n\t\t\treturn getter(task) != value;\n\t\t}));\n\n\t\tresult = runShowQuery(You::NLP::SHOW_QUERY {\n\t\t\t{ { field, You::NLP::SHOW_QUERY::Predicate::LESS_THAN, value } }, {}\n\t\t});\n\t\tAssert::IsTrue(\n\t\t\tstd::all_of(begin(result.tasks), end(result.tasks),\n\t\t\t[&getter, &value](const Task& task) {\n\t\t\treturn getter(task) < value;\n\t\t}));\n\n\t\tresult = runShowQuery(You::NLP::SHOW_QUERY {\n\t\t\t{ {\n\t\t\t\tfield,\n\t\t\t\tYou::NLP::SHOW_QUERY::Predicate::LESS_THAN_EQ,\n\t\t\t\tvalue\n\t\t\t} }, {}\n\t\t});\n\t\tAssert::IsTrue(\n\t\t\tstd::all_of(begin(result.tasks), end(result.tasks),\n\t\t\t[&getter, &value](const Task& task) {\n\t\t\treturn getter(task) <= value;\n\t\t}));\n\n\t\tresult = runShowQuery(You::NLP::SHOW_QUERY {\n\t\t\t{ {\n\t\t\t\tfield,\n\t\t\t\tYou::NLP::SHOW_QUERY::Predicate::GREATER_THAN,\n\t\t\t\tvalue }\n\t\t\t}, {}\n\t\t});\n\t\tAssert::IsTrue(\n\t\t\tstd::all_of(begin(result.tasks), end(result.tasks),\n\t\t\t[&getter, &value](const Task& task) {\n\t\t\treturn getter(task) > value;\n\t\t}));\n\n\t\tresult = runShowQuery(You::NLP::SHOW_QUERY {\n\t\t\t{ {\n\t\t\t\tfield,\n\t\t\t\tYou::NLP::SHOW_QUERY::Predicate::GREATER_THAN_EQ,\n\t\t\t\tvalue\n\t\t\t} }, {}\n\t\t});\n\t\tAssert::IsTrue(\n\t\t\tstd::all_of(begin(result.tasks), end(result.tasks),\n\t\t\t[&getter, &value](const Task& task) {\n\t\t\treturn getter(task) >= value;\n\t\t}));\n\t}\n\n\tSHOW_RESULT runShowQuery(const You::NLP::QUERY& query) {\n\t\tMocks::TaskList taskList(5);\n\t\tQueryExecutorBuilderVisitor visitor(taskList);\n\n\t\tstd::unique_ptr<QueryExecutor> executor =\n\t\t\tboost::apply_visitor(visitor, query);\n\t\treturn boost::get<SHOW_RESULT>(executor->execute());\n\t}\n\n\tTEST_METHOD(getsCorrectTypeForEditQueries) {\n\t\tgetsCorrectTypeForEditQueries1();\n\t\tgetsCorrectTypeForEditQueries2();\n\t\tgetsCorrectTypeForEditQueries3();\n\t\tgetsCorrectTypeForEditQueries4();\n\t}\n\n\tvoid getsCorrectTypeForEditQueries1() {\n\t\tMocks::TaskList taskList;\n\t\tQueryExecutorBuilderVisitor visitor(taskList);\n\n\t\tYou::NLP::QUERY query(Mocks::Queries::EDIT_QUERY);\n\t\tstd::unique_ptr<QueryExecutor> executor(\n\t\t\tboost::apply_visitor(visitor, query));\n\t\tEDIT_RESULT result(\n\t\t\tboost::get<EDIT_RESULT>(executor->execute()));\n\n\t\tAssert::AreEqual(taskList.front().getID(),\n\t\t\tresult.task.getID());\n\t\tAssert::AreEqual(Mocks::Queries::EDIT_QUERY.description.get(),\n\t\t\tresult.task.getDescription());\n\t\tAssert::AreEqual(Controller::nlpToQueryEnginePriority(\n\t\t\tMocks::Queries::EDIT_QUERY.priority.get()),\n\t\t\tresult.task.getPriority());\n\t\tAssert::AreEqual(Mocks::Queries::EDIT_QUERY.deadline.get(),\n\t\t\tresult.task.getDeadline());\n\t}\n\n\tvoid getsCorrectTypeForEditQueries2() {\n\t\tMocks::TaskList taskList;\n\t\tQueryExecutorBuilderVisitor visitor(taskList);\n\n\t\tYou::NLP::EDIT_QUERY query2(Mocks::Queries::EDIT_QUERY);\n\t\tquery2.deadline =\n\t\t\tYou::Utils::Option<boost::posix_time::ptime>();\n\t\tYou::NLP::QUERY query(query2);\n\t\tstd::unique_ptr<QueryExecutor> executor(\n\t\t\tboost::apply_visitor(visitor, query));\n\t\tEDIT_RESULT result(\n\t\t\tboost::get<EDIT_RESULT>(executor->execute()));\n\n\t\tAssert::AreEqual(taskList.front().getID(),\n\t\t\tresult.task.getID());\n\t\tAssert::AreEqual(Mocks::Queries::EDIT_QUERY.description.get(),\n\t\t\tresult.task.getDescription());\n\t\tAssert::AreEqual(Controller::nlpToQueryEnginePriority(\n\t\t\tMocks::Queries::EDIT_QUERY.priority.get()),\n\t\t\tresult.task.getPriority());\n\t\tAssert::AreEqual(taskList.front().getDeadline(),\n\t\t\tresult.task.getDeadline());\n\t}\n\n\tvoid getsCorrectTypeForEditQueries3() {\n\t\tMocks::TaskList taskList;\n\t\tQueryExecutorBuilderVisitor visitor(taskList);\n\n\t\tYou::NLP::EDIT_QUERY query2(Mocks::Queries::EDIT_QUERY);\n\t\tquery2.description =\n\t\t\tYou::Utils::Option<std::wstring>();\n\t\tYou::NLP::QUERY query(query2);\n\t\tstd::unique_ptr<QueryExecutor> executor(\n\t\t\tboost::apply_visitor(visitor, query));\n\t\tEDIT_RESULT result(\n\t\t\tboost::get<EDIT_RESULT>(executor->execute()));\n\n\t\tAssert::AreEqual(taskList.front().getID(),\n\t\t\tresult.task.getID());\n\t\tAssert::AreEqual(taskList.front().getDescription(),\n\t\t\tresult.task.getDescription());\n\t\tAssert::AreEqual(Controller::nlpToQueryEnginePriority(\n\t\t\tMocks::Queries::EDIT_QUERY.priority.get()),\n\t\t\tresult.task.getPriority());\n\t\tAssert::AreEqual(Mocks::Queries::EDIT_QUERY.deadline.get(),\n\t\t\tresult.task.getDeadline());\n\t}\n\n\tvoid getsCorrectTypeForEditQueries4() {\n\t\tMocks::TaskList taskList;\n\t\tQueryExecutorBuilderVisitor visitor(taskList);\n\n\t\tYou::NLP::EDIT_QUERY query2(Mocks::Queries::EDIT_QUERY);\n\t\tquery2.priority =\n\t\t\tYou::Utils::Option<You::NLP::TaskPriority>();\n\t\tYou::NLP::QUERY query(query2);\n\t\tstd::unique_ptr<QueryExecutor> executor(\n\t\t\tboost::apply_visitor(visitor, query));\n\t\tEDIT_RESULT result(\n\t\t\tboost::get<EDIT_RESULT>(executor->execute()));\n\n\t\tAssert::AreEqual(taskList.front().getID(),\n\t\t\tresult.task.getID());\n\t\tAssert::AreEqual(Mocks::Queries::EDIT_QUERY.description.get(),\n\t\t\tresult.task.getDescription());\n\t\tAssert::AreEqual(taskList.front().getPriority(),\n\t\t\tresult.task.getPriority());\n\t\tAssert::AreEqual(Mocks::Queries::EDIT_QUERY.deadline.get(),\n\t\t\tresult.task.getDeadline());\n\t}\n\n\tTEST_METHOD(editQueriesOutOfBoundsThrowsContextOutOfRange) {\n\t\tMocks::TaskList taskList(0);\n\t\tQueryExecutorBuilderVisitor visitor(taskList);\n\n\t\tYou::NLP::QUERY query(Mocks::Queries::EDIT_QUERY);\n\t\tAssert::ExpectException<ContextIndexOutOfRangeException>([&]() {\n\t\t\tboost::apply_visitor(visitor, query);\n\t\t});\n\t}\n\n\tTEST_METHOD(getsCorrectTypeForDeleteQueries) {\n\t\tMocks::TaskList taskList;\n\t\tQueryExecutorBuilderVisitor visitor(taskList);\n\n\t\tYou::NLP::QUERY query(Mocks::Queries::DELETE_QUERY);\n\t\tstd::unique_ptr<QueryExecutor> executor(\n\t\t\tboost::apply_visitor(visitor, query));\n\t\tDELETE_RESULT result(\n\t\t\tboost::get<DELETE_RESULT>(executor->execute()));\n\n\t\tAssert::AreEqual(taskList.front().getID(),\n\t\t\tresult.task);\n\t}\n\n\tTEST_METHOD(deleteQueriesOutOfBoundsThrowsContextOutOfRange) {\n\t\tMocks::TaskList taskList(0);\n\t\tQueryExecutorBuilderVisitor visitor(taskList);\n\n\t\tYou::NLP::QUERY query(Mocks::Queries::DELETE_QUERY);\n\t\tAssert::ExpectException<ContextIndexOutOfRangeException>([&]() {\n\t\t\tboost::apply_visitor(visitor, query);\n\t\t});\n\t}\n\n\tTEST_METHOD(getsCorrectTypeForUndoQueries) {\n\t\tMocks::TaskList taskList;\n\t\tQueryExecutorBuilderVisitor visitor(taskList);\n\n\t\tYou::NLP::QUERY query(Mocks::Queries::UNDO_QUERY);\n\t\tstd::unique_ptr<QueryExecutor> executor(\n\t\t\tboost::apply_visitor(visitor, query));\n\t\tUNDO_RESULT result(\n\t\t\tboost::get<UNDO_RESULT>(executor->execute()));\n\n\t\t\/\/ TODO(lowjoel): test for..?\n\t}\n};\n\n}  \/\/ namespace UnitTests\n}  \/\/ namespace Internal\n}  \/\/ namespace Controller\n}  \/\/ namespace You\n<commit_msg>Fix time drifting during tests.<commit_after>\/\/@author A0097630B\n#include \"stdafx.h\"\n#include \"You-NLP\/parse_tree\/task_priority.h\"\n#include \"internal\/query_executor.h\"\n#include \"internal\/query_executor_builder_visitor.h\"\n#include \"exceptions\/context_index_out_of_range_exception.h\"\n\n#include \"..\/mocks\/task_list.h\"\n#include \"..\/mocks\/query.h\"\n\nusing Assert = Microsoft::VisualStudio::CppUnitTestFramework::Assert;\n\nnamespace Microsoft {\nnamespace VisualStudio {\nnamespace CppUnitTestFramework {\n\nstd::wstring ToString(You::Controller::Task::Priority priority) {\n\treturn ToString(static_cast<int>(priority));\n}\n\n}  \/\/ namespace CppUnitTestFramework\n}  \/\/ namespace VisualStudio\n}  \/\/ namespace Microsoft\n\nnamespace You {\nnamespace Controller {\nnamespace Internal {\nnamespace UnitTests {\n\nnamespace Mocks {\n\t\/\/ NOLINTNEXTLINE(build\/namespaces)\n\tusing namespace You::Controller::UnitTests::Mocks;\n}\n\nusing Task = You::Controller::Task;\nusing TaskPriority = You::NLP::TaskPriority;\n\nTEST_CLASS(QueryExecutorBuilderVisitorTests) {\n\tTEST_METHOD(getsCorrectTypeForAddQueries) {\n\t\tMocks::TaskList taskList;\n\t\tQueryExecutorBuilderVisitor visitor(taskList);\n\n\t\tYou::NLP::QUERY query(Mocks::Queries::ADD_QUERY);\n\t\tstd::unique_ptr<QueryExecutor> executor(\n\t\t\tboost::apply_visitor(visitor, query));\n\t\tADD_RESULT result(\n\t\t\tboost::get<ADD_RESULT>(executor->execute()));\n\n\t\tAssert::AreEqual(\n\t\t\tMocks::Queries::ADD_QUERY.description,\n\t\t\tresult.task.getDescription());\n\t\tAssert::AreEqual(\n\t\t\tTask::Priority::NORMAL,\n\t\t\tresult.task.getPriority());\n\t\tAssert::AreEqual(\n\t\t\tMocks::Queries::ADD_QUERY.deadline.get(),\n\t\t\tresult.task.getDeadline());\n\n\t\tYou::NLP::ADD_QUERY queryWithoutDeadline(Mocks::Queries::ADD_QUERY);\n\t\tqueryWithoutDeadline.deadline =\n\t\t\tYou::Utils::Option<boost::posix_time::ptime>();\n\t\tquery = queryWithoutDeadline;\n\t\texecutor = boost::apply_visitor(visitor, query);\n\t\tresult = boost::get<ADD_RESULT>(executor->execute());\n\n\t\tAssert::AreEqual(\n\t\t\tMocks::Queries::ADD_QUERY.description,\n\t\t\tresult.task.getDescription());\n\t\tAssert::AreEqual(\n\t\t\tTask::Priority::NORMAL,\n\t\t\tresult.task.getPriority());\n\t\tAssert::AreEqual(\n\t\t\tTask::DEFAULT_DEADLINE,\n\t\t\tresult.task.getDeadline());\n\n\t\tYou::NLP::ADD_QUERY queryWithPriority(Mocks::Queries::ADD_QUERY);\n\t\tqueryWithPriority.priority = TaskPriority::HIGH;\n\t\tquery = queryWithPriority;\n\t\texecutor = boost::apply_visitor(visitor, query);\n\t\tresult = boost::get<ADD_RESULT>(executor->execute());\n\n\t\tAssert::AreEqual(\n\t\t\tMocks::Queries::ADD_QUERY.description,\n\t\t\tresult.task.getDescription());\n\t\tAssert::AreEqual(\n\t\t\tTask::Priority::HIGH,\n\t\t\tresult.task.getPriority());\n\t\tAssert::AreEqual(\n\t\t\tMocks::Queries::ADD_QUERY.deadline.get(),\n\t\t\tresult.task.getDeadline());\n\t}\n\n\tTEST_METHOD(getsCorrectTypeForShowQueries) {\n\t\tSHOW_RESULT result(\n\t\t\trunShowQuery(Mocks::Queries::SHOW_QUERY));\n\t\tAssert::IsTrue(\n\t\t\tstd::all_of(begin(result.tasks), end(result.tasks),\n\t\t\t[](const Task& task) {\n\t\t\treturn task.getDeadline() >\n\t\t\t\tboost::get<boost::posix_time::ptime>(\n\t\t\t\t\tMocks::Queries::SHOW_QUERY.predicates[0].value);\n\t\t}));\n\t\tAssert::IsTrue(\n\t\t\tstd::is_sorted(begin(result.tasks), end(result.tasks),\n\t\t\t[](const Task& left, const Task& right) {\n\t\t\treturn left.getDeadline() > right.getDeadline();\n\t\t}));\n\n\t\tresult = runShowQuery(\n\t\t\tYou::NLP::SHOW_QUERY {\n\t\t\t\t{\n\t\t\t\t\t{\n\t\t\t\t\t\tYou::NLP::TaskField::PRIORITY,\n\t\t\t\t\t\tYou::NLP::SHOW_QUERY::Predicate::EQ,\n\t\t\t\t\t\tYou::NLP::TaskPriority::NORMAL\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\t{\n\t\t\t\t\t\tYou::NLP::TaskField::DESCRIPTION,\n\t\t\t\t\t\tYou::NLP::SHOW_QUERY::Order::ASCENDING\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t});\n\t\tAssert::IsTrue(\n\t\t\tstd::all_of(begin(result.tasks), end(result.tasks),\n\t\t\t[](const Task& task) {\n\t\t\treturn task.getPriority() ==\n\t\t\t\tYou::QueryEngine::Task::Priority::NORMAL;\n\t\t}));\n\t\tAssert::IsTrue(\n\t\t\tstd::is_sorted(begin(result.tasks), end(result.tasks),\n\t\t\t[](const Task& left, const Task& right) {\n\t\t\treturn left.getDescription() < right.getDescription();\n\t\t}));\n\n\t\tresult = runShowQuery(\n\t\t\tYou::NLP::SHOW_QUERY {\n\t\t\t\t{\n\t\t\t\t\t{\n\t\t\t\t\t\tYou::NLP::TaskField::COMPLETE,\n\t\t\t\t\t\tYou::NLP::SHOW_QUERY::Predicate::EQ,\n\t\t\t\t\t\tfalse\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\t{\n\t\t\t\t\t\tYou::NLP::TaskField::PRIORITY,\n\t\t\t\t\t\tYou::NLP::SHOW_QUERY::Order::DESCENDING\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t});\n\t\tAssert::IsTrue(\n\t\t\tstd::all_of(begin(result.tasks), end(result.tasks),\n\t\t\t[](const Task& task) {\n\t\t\treturn !task.isCompleted();\n\t\t}));\n\t\tAssert::IsTrue(\n\t\t\tstd::is_sorted(begin(result.tasks), end(result.tasks),\n\t\t\t[](const Task& left, const Task& right) {\n\t\t\treturn left.getPriority() > right.getPriority();\n\t\t}));\n\n\t\tappliesCorrectFilters();\n\t}\n\n\tvoid appliesCorrectFilters() {\n\t\t\/\/ Test filters more rigourously\n\t\tappliesCorrectFilters<You::NLP::TaskField::DESCRIPTION>(\n\t\t\tstd::bind(&Task::getDescription, std::placeholders::_1),\n\t\t\tstd::wstring(L\"meh 1\"));\n\n\t\tauto runTime = boost::posix_time::second_clock::local_time();\n\t\tappliesCorrectFilters<You::NLP::TaskField::DEADLINE>(\n\t\t\tstd::bind(&Task::getDeadline, std::placeholders::_1),\n\t\t\trunTime + boost::posix_time::hours(1));\n\n#if 0\n\t\t\/\/ TODO(lowjoel): Implement comparators for priorities.\n\t\tappliesCorrectFilters<You::NLP::TaskField::PRIORITY>(\n\t\t\tstd::bind(&Task::getPriority, std::placeholders::_1),\n\t\t\tYou::NLP::TaskPriority::HIGH);\n#endif\n\t}\n\n\t\/\/\/ This is a very useful template function. Because it tests all 7\n\t\/\/\/ operators: equality, inequality, less than, less than or equal,\n\t\/\/\/ greater than, greater or equal on a type all at once.\n\t\/\/\/\n\t\/\/\/ \\tparam field The field to access\n\t\/\/\/ \\param getter The getter to access the record in the object.\n\t\/\/\/ \\param value The value to compare against.\n\ttemplate<You::NLP::TaskField field, typename TGetter, typename TValue>\n\tvoid appliesCorrectFilters(TGetter getter, const TValue& value) {\n\t\tSHOW_RESULT result(runShowQuery(You::NLP::SHOW_QUERY {\n\t\t\t\t{ { field, You::NLP::SHOW_QUERY::Predicate::EQ, value } }, {}\n\t\t\t}));\n\t\tAssert::IsTrue(\n\t\t\tstd::all_of(begin(result.tasks), end(result.tasks),\n\t\t\t[&getter, &value](const Task& task) {\n\t\t\treturn getter(task) == value;\n\t\t}));\n\n\t\tresult = runShowQuery(You::NLP::SHOW_QUERY {\n\t\t\t{ { field, You::NLP::SHOW_QUERY::Predicate::NOT_EQ, value } }, {}\n\t\t});\n\t\tAssert::IsTrue(\n\t\t\tstd::all_of(begin(result.tasks), end(result.tasks),\n\t\t\t[&getter, &value](const Task& task) {\n\t\t\treturn getter(task) != value;\n\t\t}));\n\n\t\tresult = runShowQuery(You::NLP::SHOW_QUERY {\n\t\t\t{ { field, You::NLP::SHOW_QUERY::Predicate::LESS_THAN, value } }, {}\n\t\t});\n\t\tAssert::IsTrue(\n\t\t\tstd::all_of(begin(result.tasks), end(result.tasks),\n\t\t\t[&getter, &value](const Task& task) {\n\t\t\treturn getter(task) < value;\n\t\t}));\n\n\t\tresult = runShowQuery(You::NLP::SHOW_QUERY {\n\t\t\t{ {\n\t\t\t\tfield,\n\t\t\t\tYou::NLP::SHOW_QUERY::Predicate::LESS_THAN_EQ,\n\t\t\t\tvalue\n\t\t\t} }, {}\n\t\t});\n\t\tAssert::IsTrue(\n\t\t\tstd::all_of(begin(result.tasks), end(result.tasks),\n\t\t\t[&getter, &value](const Task& task) {\n\t\t\treturn getter(task) <= value;\n\t\t}));\n\n\t\tresult = runShowQuery(You::NLP::SHOW_QUERY {\n\t\t\t{ {\n\t\t\t\tfield,\n\t\t\t\tYou::NLP::SHOW_QUERY::Predicate::GREATER_THAN,\n\t\t\t\tvalue }\n\t\t\t}, {}\n\t\t});\n\t\tAssert::IsTrue(\n\t\t\tstd::all_of(begin(result.tasks), end(result.tasks),\n\t\t\t[&getter, &value](const Task& task) {\n\t\t\treturn getter(task) > value;\n\t\t}));\n\n\t\tresult = runShowQuery(You::NLP::SHOW_QUERY {\n\t\t\t{ {\n\t\t\t\tfield,\n\t\t\t\tYou::NLP::SHOW_QUERY::Predicate::GREATER_THAN_EQ,\n\t\t\t\tvalue\n\t\t\t} }, {}\n\t\t});\n\t\tAssert::IsTrue(\n\t\t\tstd::all_of(begin(result.tasks), end(result.tasks),\n\t\t\t[&getter, &value](const Task& task) {\n\t\t\treturn getter(task) >= value;\n\t\t}));\n\t}\n\n\tSHOW_RESULT runShowQuery(const You::NLP::QUERY& query) {\n\t\tMocks::TaskList taskList(5);\n\t\tQueryExecutorBuilderVisitor visitor(taskList);\n\n\t\tstd::unique_ptr<QueryExecutor> executor =\n\t\t\tboost::apply_visitor(visitor, query);\n\t\treturn boost::get<SHOW_RESULT>(executor->execute());\n\t}\n\n\tTEST_METHOD(getsCorrectTypeForEditQueries) {\n\t\tgetsCorrectTypeForEditQueries1();\n\t\tgetsCorrectTypeForEditQueries2();\n\t\tgetsCorrectTypeForEditQueries3();\n\t\tgetsCorrectTypeForEditQueries4();\n\t}\n\n\tvoid getsCorrectTypeForEditQueries1() {\n\t\tMocks::TaskList taskList;\n\t\tQueryExecutorBuilderVisitor visitor(taskList);\n\n\t\tYou::NLP::QUERY query(Mocks::Queries::EDIT_QUERY);\n\t\tstd::unique_ptr<QueryExecutor> executor(\n\t\t\tboost::apply_visitor(visitor, query));\n\t\tEDIT_RESULT result(\n\t\t\tboost::get<EDIT_RESULT>(executor->execute()));\n\n\t\tAssert::AreEqual(taskList.front().getID(),\n\t\t\tresult.task.getID());\n\t\tAssert::AreEqual(Mocks::Queries::EDIT_QUERY.description.get(),\n\t\t\tresult.task.getDescription());\n\t\tAssert::AreEqual(Controller::nlpToQueryEnginePriority(\n\t\t\tMocks::Queries::EDIT_QUERY.priority.get()),\n\t\t\tresult.task.getPriority());\n\t\tAssert::AreEqual(Mocks::Queries::EDIT_QUERY.deadline.get(),\n\t\t\tresult.task.getDeadline());\n\t}\n\n\tvoid getsCorrectTypeForEditQueries2() {\n\t\tMocks::TaskList taskList;\n\t\tQueryExecutorBuilderVisitor visitor(taskList);\n\n\t\tYou::NLP::EDIT_QUERY query2(Mocks::Queries::EDIT_QUERY);\n\t\tquery2.deadline =\n\t\t\tYou::Utils::Option<boost::posix_time::ptime>();\n\t\tYou::NLP::QUERY query(query2);\n\t\tstd::unique_ptr<QueryExecutor> executor(\n\t\t\tboost::apply_visitor(visitor, query));\n\t\tEDIT_RESULT result(\n\t\t\tboost::get<EDIT_RESULT>(executor->execute()));\n\n\t\tAssert::AreEqual(taskList.front().getID(),\n\t\t\tresult.task.getID());\n\t\tAssert::AreEqual(Mocks::Queries::EDIT_QUERY.description.get(),\n\t\t\tresult.task.getDescription());\n\t\tAssert::AreEqual(Controller::nlpToQueryEnginePriority(\n\t\t\tMocks::Queries::EDIT_QUERY.priority.get()),\n\t\t\tresult.task.getPriority());\n\t\tAssert::AreEqual(taskList.front().getDeadline(),\n\t\t\tresult.task.getDeadline());\n\t}\n\n\tvoid getsCorrectTypeForEditQueries3() {\n\t\tMocks::TaskList taskList;\n\t\tQueryExecutorBuilderVisitor visitor(taskList);\n\n\t\tYou::NLP::EDIT_QUERY query2(Mocks::Queries::EDIT_QUERY);\n\t\tquery2.description =\n\t\t\tYou::Utils::Option<std::wstring>();\n\t\tYou::NLP::QUERY query(query2);\n\t\tstd::unique_ptr<QueryExecutor> executor(\n\t\t\tboost::apply_visitor(visitor, query));\n\t\tEDIT_RESULT result(\n\t\t\tboost::get<EDIT_RESULT>(executor->execute()));\n\n\t\tAssert::AreEqual(taskList.front().getID(),\n\t\t\tresult.task.getID());\n\t\tAssert::AreEqual(taskList.front().getDescription(),\n\t\t\tresult.task.getDescription());\n\t\tAssert::AreEqual(Controller::nlpToQueryEnginePriority(\n\t\t\tMocks::Queries::EDIT_QUERY.priority.get()),\n\t\t\tresult.task.getPriority());\n\t\tAssert::AreEqual(Mocks::Queries::EDIT_QUERY.deadline.get(),\n\t\t\tresult.task.getDeadline());\n\t}\n\n\tvoid getsCorrectTypeForEditQueries4() {\n\t\tMocks::TaskList taskList;\n\t\tQueryExecutorBuilderVisitor visitor(taskList);\n\n\t\tYou::NLP::EDIT_QUERY query2(Mocks::Queries::EDIT_QUERY);\n\t\tquery2.priority =\n\t\t\tYou::Utils::Option<You::NLP::TaskPriority>();\n\t\tYou::NLP::QUERY query(query2);\n\t\tstd::unique_ptr<QueryExecutor> executor(\n\t\t\tboost::apply_visitor(visitor, query));\n\t\tEDIT_RESULT result(\n\t\t\tboost::get<EDIT_RESULT>(executor->execute()));\n\n\t\tAssert::AreEqual(taskList.front().getID(),\n\t\t\tresult.task.getID());\n\t\tAssert::AreEqual(Mocks::Queries::EDIT_QUERY.description.get(),\n\t\t\tresult.task.getDescription());\n\t\tAssert::AreEqual(taskList.front().getPriority(),\n\t\t\tresult.task.getPriority());\n\t\tAssert::AreEqual(Mocks::Queries::EDIT_QUERY.deadline.get(),\n\t\t\tresult.task.getDeadline());\n\t}\n\n\tTEST_METHOD(editQueriesOutOfBoundsThrowsContextOutOfRange) {\n\t\tMocks::TaskList taskList(0);\n\t\tQueryExecutorBuilderVisitor visitor(taskList);\n\n\t\tYou::NLP::QUERY query(Mocks::Queries::EDIT_QUERY);\n\t\tAssert::ExpectException<ContextIndexOutOfRangeException>([&]() {\n\t\t\tboost::apply_visitor(visitor, query);\n\t\t});\n\t}\n\n\tTEST_METHOD(getsCorrectTypeForDeleteQueries) {\n\t\tMocks::TaskList taskList;\n\t\tQueryExecutorBuilderVisitor visitor(taskList);\n\n\t\tYou::NLP::QUERY query(Mocks::Queries::DELETE_QUERY);\n\t\tstd::unique_ptr<QueryExecutor> executor(\n\t\t\tboost::apply_visitor(visitor, query));\n\t\tDELETE_RESULT result(\n\t\t\tboost::get<DELETE_RESULT>(executor->execute()));\n\n\t\tAssert::AreEqual(taskList.front().getID(),\n\t\t\tresult.task);\n\t}\n\n\tTEST_METHOD(deleteQueriesOutOfBoundsThrowsContextOutOfRange) {\n\t\tMocks::TaskList taskList(0);\n\t\tQueryExecutorBuilderVisitor visitor(taskList);\n\n\t\tYou::NLP::QUERY query(Mocks::Queries::DELETE_QUERY);\n\t\tAssert::ExpectException<ContextIndexOutOfRangeException>([&]() {\n\t\t\tboost::apply_visitor(visitor, query);\n\t\t});\n\t}\n\n\tTEST_METHOD(getsCorrectTypeForUndoQueries) {\n\t\tMocks::TaskList taskList;\n\t\tQueryExecutorBuilderVisitor visitor(taskList);\n\n\t\tYou::NLP::QUERY query(Mocks::Queries::UNDO_QUERY);\n\t\tstd::unique_ptr<QueryExecutor> executor(\n\t\t\tboost::apply_visitor(visitor, query));\n\t\tUNDO_RESULT result(\n\t\t\tboost::get<UNDO_RESULT>(executor->execute()));\n\n\t\t\/\/ TODO(lowjoel): test for..?\n\t}\n};\n\n}  \/\/ namespace UnitTests\n}  \/\/ namespace Internal\n}  \/\/ namespace Controller\n}  \/\/ namespace You\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright © 2014 German Neuroinformatics Node (G-Node)\n\/\/\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted under the terms of the BSD License. See\n\/\/ LICENSE file in the root of the Project.\n\/\/\n\/\/ Author: Christian Kellner <kellner@bio.lmu.de>\n\n#include <ctime>\n#include <iostream>\n#include <sstream>\n#include <iterator>\n#include <stdexcept>\n#include <limits>\n\n#include <boost\/math\/constants\/constants.hpp>\n#include <boost\/iterator\/zip_iterator.hpp>\n\n#include <nix\/util\/util.hpp>\n#include <nix\/valid\/validate.hpp>\n\n#include \"BaseTestProperty.hpp\"\n\n#include <cppunit\/extensions\/HelperMacros.h>\n#include <cppunit\/CompilerOutputter.h>\n#include <cppunit\/TestResult.h>\n#include <cppunit\/TestResultCollector.h>\n#include <cppunit\/TestRunner.h>\n#include <cppunit\/BriefTestProgressListener.h>\n\n\nusing namespace nix;\nusing namespace valid;\n\n\nvoid BaseTestProperty::testValidate() {\n    \/\/ values are set but unit is missing: 1 warning\n    valid::Result result = validate(property);\n    CPPUNIT_ASSERT(result.getErrors().size() == 0);\n    CPPUNIT_ASSERT(result.getWarnings().size() == 1);\n}\n\n\nvoid BaseTestProperty::testId() {\n    CPPUNIT_ASSERT(property.id().size() == 36);\n}\n\n\nvoid BaseTestProperty::testName() {\n    CPPUNIT_ASSERT(property.name() == \"prop\");\n}\n\n\nvoid BaseTestProperty::testDefinition() {\n    std::string def = \"some_str\";\n    property.definition(def);\n    CPPUNIT_ASSERT(*property.definition() == def);\n    property.definition(nix::none);\n    CPPUNIT_ASSERT(property.definition() == nix::none);\n    CPPUNIT_ASSERT_THROW(property.definition(\"\"), EmptyString);\n}\n\n\nvoid BaseTestProperty::testMapping() {\n    std::string map = \"some_str\";\n    CPPUNIT_ASSERT_THROW(property.mapping(\"\"), EmptyString);\n    property.mapping(map);\n    CPPUNIT_ASSERT(*property.mapping() == map);\n    property.mapping(boost::none);\n    CPPUNIT_ASSERT(!property.mapping());\n}\n\n\nvoid BaseTestProperty::testValues()\n{\n    nix::Section section = file.createSection(\"Area51\", \"Boolean\");\n    nix::Property p1 = section.createProperty(\"strProperty\", str_dummy);\n    std::vector<nix::Value> strValues = { nix::Value(\"Freude\"),\n                                          nix::Value(\"schoener\"),\n                                          nix::Value(\"Goetterfunken\") };\n    p1.values(strValues);\n    CPPUNIT_ASSERT_EQUAL(p1.valueCount(), static_cast<ndsize_t>(strValues.size()));\n\n    std::vector<nix::Value> ctrlValues = p1.values();\n    for(size_t i = 0; i < ctrlValues.size(); ++i) {\n        CPPUNIT_ASSERT_EQUAL(strValues[i], ctrlValues[i]);\n    }\n\n    strValues.emplace_back(\"Tochter\");\n    strValues.emplace_back(\"aus\");\n    strValues.emplace_back(\"Elysium\");\n    strValues.emplace_back(\"Wir betreten feuertrunken\");\n\n    p1.values(strValues);\n    CPPUNIT_ASSERT_EQUAL(p1.valueCount(), static_cast<ndsize_t>(strValues.size()));\n\n    strValues.erase(strValues.begin()+6);\n    p1.values(strValues);\n    CPPUNIT_ASSERT_EQUAL(p1.valueCount(), static_cast<ndsize_t>(strValues.size()));\n\n    nix::Property p2 = section.createProperty(\"toDelete\", str_dummy);\n    CPPUNIT_ASSERT(p2.valueCount() == 1);\n    CPPUNIT_ASSERT_EQUAL(p2.values()[0], str_dummy);\n\n    strValues.clear();\n    p2.values(strValues);\n    CPPUNIT_ASSERT_EQUAL(p2.valueCount(), static_cast<ndsize_t>(strValues.size()));\n    p2.deleteValues();\n    CPPUNIT_ASSERT(p2.values().empty() == true);\n    p2.values(strValues);\n    p2.values(none);\n    CPPUNIT_ASSERT(p2.values().empty() == true);\n}\n\n\nvoid BaseTestProperty::testDataType() {\n    nix::Section section = file.createSection(\"Area51\", \"Boolean\");\n    std::vector<nix::Value> strValues = { nix::Value(\"Freude\"),\n                                          nix::Value(\"schoener\"),\n                                          nix::Value(\"Goetterfunken\") };\n    std::vector<nix::Value> doubleValues = { nix::Value(1.0),\n                                             nix::Value(2.0),\n                                             nix::Value(-99.99) };\n    nix::Property p1 = section.createProperty(\"strProperty\", strValues);\n    nix::Property p2 = section.createProperty(\"doubleProperty\", doubleValues);\n\n    CPPUNIT_ASSERT(p1.dataType() == DataType::String);\n    CPPUNIT_ASSERT(p2.dataType() == DataType::Double);\n\n    file.deleteSection(section.id());\n}\n\n\nvoid BaseTestProperty::testUnit(){\n    nix::Section section = file.createSection(\"testSection\", \"test\");\n    nix::Value v(22.2);\n    v.uncertainty = 1.2;\n    std::vector<Value> values = {v};\n    nix::Property p1 = section.createProperty(\"testProperty\", int_dummy);\n\n    std::string inv_unit = \"invalid unit\";\n    std::string valid_unit = \"mV*cm^-2\";\n    std::string second_unit = \"mV\";\n\n    CPPUNIT_ASSERT_THROW(property.unit(\"\"), nix::EmptyString);\n    CPPUNIT_ASSERT_THROW(property.unit(inv_unit), nix::InvalidUnit);\n    CPPUNIT_ASSERT(!property.unit());\n\n    property.unit(valid_unit);\n    CPPUNIT_ASSERT(property.unit() && *property.unit() == valid_unit);\n\n    property.unit(none);\n    CPPUNIT_ASSERT(!property.unit());\n    CPPUNIT_ASSERT_NO_THROW(property.unit(second_unit));\n    CPPUNIT_ASSERT(property.unit() && *property.unit() == second_unit);\n}\n\n\nvoid BaseTestProperty::testOperators() {\n    CPPUNIT_ASSERT(property_null == false);\n    CPPUNIT_ASSERT(property_null == none);\n\n    CPPUNIT_ASSERT(property != false);\n    CPPUNIT_ASSERT(property != none);\n\n    CPPUNIT_ASSERT(property == property);\n    CPPUNIT_ASSERT(property != property_other);\n    CPPUNIT_ASSERT(property.compare(property_other) != 0);\n\n    property_other = property;\n    CPPUNIT_ASSERT(property == property_other);\n    CPPUNIT_ASSERT(property.compare(property_other) == 0);\n\n    property_other = none;\n    CPPUNIT_ASSERT(property_other == false);\n    CPPUNIT_ASSERT(property_other == none);\n\n    CPPUNIT_ASSERT(property_null == false);\n    CPPUNIT_ASSERT(property_null == none);\n    \n    std::stringstream s;\n    s << property;\n    CPPUNIT_ASSERT(s.str() == \"Property: {name = \" + property.name() + \"}\");\n}\n\n\nvoid BaseTestProperty::testCreatedAt() {\n    CPPUNIT_ASSERT(property.createdAt() >= startup_time);\n    time_t past_time = time(NULL) - 10000000;\n    property.forceCreatedAt(past_time);\n    CPPUNIT_ASSERT(property.createdAt() == past_time);\n}\n\n\nvoid BaseTestProperty::testUpdatedAt() {\n    CPPUNIT_ASSERT(property.updatedAt() >= startup_time);\n}\n\nvoid BaseTestProperty::testIsValidEntity() {\n    Property p = section.createProperty(\"testProperty\", DataType::Double);\n    CPPUNIT_ASSERT(p.isValidEntity());\n    section.deleteProperty(p.name());\n    CPPUNIT_ASSERT(!p.isValidEntity());\n}\n<commit_msg>[test] Property: add more datatytpe tests<commit_after>\/\/ Copyright © 2014 German Neuroinformatics Node (G-Node)\n\/\/\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted under the terms of the BSD License. See\n\/\/ LICENSE file in the root of the Project.\n\/\/\n\/\/ Author: Christian Kellner <kellner@bio.lmu.de>\n\n#include <ctime>\n#include <iostream>\n#include <sstream>\n#include <iterator>\n#include <stdexcept>\n#include <limits>\n\n#include <boost\/math\/constants\/constants.hpp>\n#include <boost\/iterator\/zip_iterator.hpp>\n\n#include <nix\/util\/util.hpp>\n#include <nix\/valid\/validate.hpp>\n\n#include \"BaseTestProperty.hpp\"\n\n#include <cppunit\/extensions\/HelperMacros.h>\n#include <cppunit\/CompilerOutputter.h>\n#include <cppunit\/TestResult.h>\n#include <cppunit\/TestResultCollector.h>\n#include <cppunit\/TestRunner.h>\n#include <cppunit\/BriefTestProgressListener.h>\n\n\nusing namespace nix;\nusing namespace valid;\n\n\nvoid BaseTestProperty::testValidate() {\n    \/\/ values are set but unit is missing: 1 warning\n    valid::Result result = validate(property);\n    CPPUNIT_ASSERT(result.getErrors().size() == 0);\n    CPPUNIT_ASSERT(result.getWarnings().size() == 1);\n}\n\n\nvoid BaseTestProperty::testId() {\n    CPPUNIT_ASSERT(property.id().size() == 36);\n}\n\n\nvoid BaseTestProperty::testName() {\n    CPPUNIT_ASSERT(property.name() == \"prop\");\n}\n\n\nvoid BaseTestProperty::testDefinition() {\n    std::string def = \"some_str\";\n    property.definition(def);\n    CPPUNIT_ASSERT(*property.definition() == def);\n    property.definition(nix::none);\n    CPPUNIT_ASSERT(property.definition() == nix::none);\n    CPPUNIT_ASSERT_THROW(property.definition(\"\"), EmptyString);\n}\n\n\nvoid BaseTestProperty::testMapping() {\n    std::string map = \"some_str\";\n    CPPUNIT_ASSERT_THROW(property.mapping(\"\"), EmptyString);\n    property.mapping(map);\n    CPPUNIT_ASSERT(*property.mapping() == map);\n    property.mapping(boost::none);\n    CPPUNIT_ASSERT(!property.mapping());\n}\n\n\nvoid BaseTestProperty::testValues()\n{\n    nix::Section section = file.createSection(\"Area51\", \"Boolean\");\n    nix::Property p1 = section.createProperty(\"strProperty\", str_dummy);\n    std::vector<nix::Value> strValues = { nix::Value(\"Freude\"),\n                                          nix::Value(\"schoener\"),\n                                          nix::Value(\"Goetterfunken\") };\n    p1.values(strValues);\n    CPPUNIT_ASSERT_EQUAL(p1.valueCount(), static_cast<ndsize_t>(strValues.size()));\n\n    std::vector<nix::Value> ctrlValues = p1.values();\n    for(size_t i = 0; i < ctrlValues.size(); ++i) {\n        CPPUNIT_ASSERT_EQUAL(strValues[i], ctrlValues[i]);\n    }\n\n    strValues.emplace_back(\"Tochter\");\n    strValues.emplace_back(\"aus\");\n    strValues.emplace_back(\"Elysium\");\n    strValues.emplace_back(\"Wir betreten feuertrunken\");\n\n    p1.values(strValues);\n    CPPUNIT_ASSERT_EQUAL(p1.valueCount(), static_cast<ndsize_t>(strValues.size()));\n\n    strValues.erase(strValues.begin()+6);\n    p1.values(strValues);\n    CPPUNIT_ASSERT_EQUAL(p1.valueCount(), static_cast<ndsize_t>(strValues.size()));\n\n    nix::Property p2 = section.createProperty(\"toDelete\", str_dummy);\n    CPPUNIT_ASSERT(p2.valueCount() == 1);\n    CPPUNIT_ASSERT_EQUAL(p2.values()[0], str_dummy);\n\n    strValues.clear();\n    p2.values(strValues);\n    CPPUNIT_ASSERT_EQUAL(p2.valueCount(), static_cast<ndsize_t>(strValues.size()));\n    p2.deleteValues();\n    CPPUNIT_ASSERT(p2.values().empty() == true);\n    p2.values(strValues);\n    p2.values(none);\n    CPPUNIT_ASSERT(p2.values().empty() == true);\n}\n\n\nvoid BaseTestProperty::testDataType() {\n    nix::Section section = file.createSection(\"Area51\", \"Boolean\");\n    std::vector<nix::Value> strValues = { nix::Value(\"Freude\"),\n                                          nix::Value(\"schoener\"),\n                                          nix::Value(\"Goetterfunken\") };\n    std::vector<nix::Value> doubleValues = { nix::Value(1.0),\n                                             nix::Value(2.0),\n                                             nix::Value(-99.99) };\n    std::vector<nix::Value> intValues = {nix::Value(int32_t(1)), nix::Value(int32_t(2)), nix::Value(int32_t(3))};\n    std::vector<nix::Value> uintValues = {nix::Value(uint32_t(1)), nix::Value(uint32_t(2)), nix::Value(uint32_t(3))};\n    std::vector<nix::Value> int64Values = {nix::Value(int64_t(1)), nix::Value(int64_t(2)), nix::Value(int64_t(3))};\n    std::vector<nix::Value> uint64Values = {nix::Value(uint64_t(1)), nix::Value(uint64_t(2)), nix::Value(uint64_t(3))};\n    std::vector<nix::Value> boolValues = {nix::Value(true), nix::Value(false), nix::Value(true)};\n\n\n    nix::Property p1 = section.createProperty(\"strProperty\", strValues);\n    nix::Property p2 = section.createProperty(\"doubleProperty\", doubleValues);\n    nix::Property p3 = section.createProperty(\"int32Property\", intValues);\n    nix::Property p4 = section.createProperty(\"uint32Property\", uintValues);\n    nix::Property p5 = section.createProperty(\"int64Property\", int64Values);\n    nix::Property p6 = section.createProperty(\"uint64Property\", uint64Values);\n    nix::Property p7 = section.createProperty(\"boolProperty\", boolValues);\n\n\n    CPPUNIT_ASSERT(p1.dataType() == DataType::String);\n    CPPUNIT_ASSERT(p2.dataType() == DataType::Double);\n    CPPUNIT_ASSERT(p3.dataType() == DataType::Int32);\n    CPPUNIT_ASSERT(p4.dataType() == DataType::UInt32);\n    CPPUNIT_ASSERT(p5.dataType() == DataType::Int64);\n    CPPUNIT_ASSERT(p6.dataType() == DataType::UInt64);\n    CPPUNIT_ASSERT(p7.dataType() == DataType::Bool);\n    \n    file.deleteSection(section.id());\n}\n\n\nvoid BaseTestProperty::testUnit(){\n    nix::Section section = file.createSection(\"testSection\", \"test\");\n    nix::Value v(22.2);\n    v.uncertainty = 1.2;\n    std::vector<Value> values = {v};\n    nix::Property p1 = section.createProperty(\"testProperty\", int_dummy);\n\n    std::string inv_unit = \"invalid unit\";\n    std::string valid_unit = \"mV*cm^-2\";\n    std::string second_unit = \"mV\";\n\n    CPPUNIT_ASSERT_THROW(property.unit(\"\"), nix::EmptyString);\n    CPPUNIT_ASSERT_THROW(property.unit(inv_unit), nix::InvalidUnit);\n    CPPUNIT_ASSERT(!property.unit());\n\n    property.unit(valid_unit);\n    CPPUNIT_ASSERT(property.unit() && *property.unit() == valid_unit);\n\n    property.unit(none);\n    CPPUNIT_ASSERT(!property.unit());\n    CPPUNIT_ASSERT_NO_THROW(property.unit(second_unit));\n    CPPUNIT_ASSERT(property.unit() && *property.unit() == second_unit);\n}\n\n\nvoid BaseTestProperty::testOperators() {\n    CPPUNIT_ASSERT(property_null == false);\n    CPPUNIT_ASSERT(property_null == none);\n\n    CPPUNIT_ASSERT(property != false);\n    CPPUNIT_ASSERT(property != none);\n\n    CPPUNIT_ASSERT(property == property);\n    CPPUNIT_ASSERT(property != property_other);\n    CPPUNIT_ASSERT(property.compare(property_other) != 0);\n\n    property_other = property;\n    CPPUNIT_ASSERT(property == property_other);\n    CPPUNIT_ASSERT(property.compare(property_other) == 0);\n\n    property_other = none;\n    CPPUNIT_ASSERT(property_other == false);\n    CPPUNIT_ASSERT(property_other == none);\n\n    CPPUNIT_ASSERT(property_null == false);\n    CPPUNIT_ASSERT(property_null == none);\n    \n    std::stringstream s;\n    s << property;\n    CPPUNIT_ASSERT(s.str() == \"Property: {name = \" + property.name() + \"}\");\n}\n\n\nvoid BaseTestProperty::testCreatedAt() {\n    CPPUNIT_ASSERT(property.createdAt() >= startup_time);\n    time_t past_time = time(NULL) - 10000000;\n    property.forceCreatedAt(past_time);\n    CPPUNIT_ASSERT(property.createdAt() == past_time);\n}\n\n\nvoid BaseTestProperty::testUpdatedAt() {\n    CPPUNIT_ASSERT(property.updatedAt() >= startup_time);\n}\n\nvoid BaseTestProperty::testIsValidEntity() {\n    Property p = section.createProperty(\"testProperty\", DataType::Double);\n    CPPUNIT_ASSERT(p.isValidEntity());\n    section.deleteProperty(p.name());\n    CPPUNIT_ASSERT(!p.isValidEntity());\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * 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\n\/\/ Author: pulkitg@google.com (Pulkit Goyal)\n\/\/\n\/\/ Contains implementation of DelayImagesFilter, which delays all the high\n\/\/ quality images whose low quality inlined data url are available within their\n\/\/ respective image tag.\n\n#include \"net\/instaweb\/rewriter\/public\/delay_images_filter.h\"\n\n#include <map>\n#include <utility>\n\n#include \"net\/instaweb\/htmlparse\/public\/html_element.h\"\n#include \"net\/instaweb\/htmlparse\/public\/html_name.h\"\n#include \"net\/instaweb\/http\/public\/log_record.h\"\n#include \"net\/instaweb\/http\/public\/semantic_type.h\"\n#include \"net\/instaweb\/rewriter\/public\/server_context.h\"\n#include \"net\/instaweb\/rewriter\/public\/resource_tag_scanner.h\"\n#include \"net\/instaweb\/rewriter\/public\/rewrite_driver.h\"\n#include \"net\/instaweb\/rewriter\/public\/rewrite_options.h\"\n#include \"net\/instaweb\/rewriter\/public\/static_javascript_manager.h\"\n#include \"net\/instaweb\/util\/public\/string.h\"\n\nnamespace net_instaweb {\n\nconst char DelayImagesFilter::kDelayImagesSuffix[] =\n    \"\\npagespeed.delayImagesInit()\";\n\nconst char DelayImagesFilter::kDelayImagesInlineSuffix[] =\n    \"\\npagespeed.delayImagesInlineInit();\";\n\nconst char DelayImagesFilter::kOnloadFunction[] =\n    \"var elem=this;\"\n    \"setTimeout(function(){elem.removeAttribute('onload');\"\n    \"elem.src=elem.getAttribute('pagespeed_high_res_src');}, 0);\";\n\nDelayImagesFilter::DelayImagesFilter(RewriteDriver* driver)\n    : driver_(driver),\n      static_js_manager_(\n          driver->server_context()->static_javascript_manager()),\n      low_res_map_inserted_(false),\n      num_low_res_inlined_images_(0),\n      is_experimental_enabled_(\n          driver_->options()->enable_inline_preview_images_experimental()) {\n  \/\/ Low res images will be placed inside the respective image tag if any one of\n  \/\/ kDeferJavascript or kLazyloadImages is turned off or\n  \/\/ enable_inline_preview_images_experimental is set to true. Otherwise, low\n  \/\/ res images will be blocked by javascript or images which are not critical.\n  insert_low_res_images_inplace_ =\n      is_experimental_enabled_ ||\n      !driver_->options()->Enabled(RewriteOptions::kDeferJavascript) ||\n      !driver_->options()->Enabled(RewriteOptions::kLazyloadImages);\n}\n\nDelayImagesFilter::~DelayImagesFilter() {}\n\nvoid DelayImagesFilter::StartDocument() {\n  low_res_map_inserted_ = false;\n  num_low_res_inlined_images_ = 0;\n}\n\nvoid DelayImagesFilter::EndDocument() {\n  low_res_data_map_.clear();\n}\n\nvoid DelayImagesFilter::EndElement(HtmlElement* element) {\n  if (element->keyword() == HtmlName::kBody && !low_res_map_inserted_ &&\n      !low_res_data_map_.empty()) {\n    InsertDelayImagesInlineJS(element);\n  } else if (driver_->IsRewritable(element) &&\n             (element->keyword() == HtmlName::kImg ||\n              element->keyword() == HtmlName::kInput)) {\n    \/\/ We only handle img and input tag images.  Note that delay_images.js and\n    \/\/ delay_images_inline.js must be modified to handle other possible tags.\n    \/\/ We should probably specifically *not* include low res images for link\n    \/\/ tags of various sorts (favicons, mobile desktop icons, etc.).  Use of low\n    \/\/ res for explicit background images is a more interesting case, but the\n    \/\/ current DOM walk in the above js files would need to be modified to\n    \/\/ handle the large number of tags that we can identify in\n    \/\/ resource_tag_scanner::ScanElement.\n    semantic_type::Category category;\n    HtmlElement::Attribute* src = resource_tag_scanner::ScanElement(\n        element, driver_, &category);\n\n    if (src != NULL && src->DecodedValueOrNull() != NULL &&\n        category == semantic_type::kImage) {\n      \/\/ Remove the inline_src which is low quality base64 encoded data url and\n      \/\/ add them to a map so that all inline data urls will be available at the\n      \/\/ end of body tag.\n      HtmlElement::Attribute* low_res_src =\n          element->FindAttribute(HtmlName::kPagespeedLowResSrc);\n      if ((low_res_src != NULL) &&\n          (low_res_src->DecodedValueOrNull() != NULL)) {\n        ++num_low_res_inlined_images_;\n        \/\/ Experimental mode adds an onload attribute of the image tag. So, low\n        \/\/ res image is only added if onload function is not already present.\n        if (!is_experimental_enabled_ ||\n            element->FindAttribute(HtmlName::kOnload) == NULL) {\n          \/\/ Low res image data is collected in low_res_data_map_ map. This\n          \/\/ low_res_src will be moved just after last low res image in the html\n          \/\/ DOM.\n          \/\/ It is better to move inlined low resolution data later in the DOM,\n          \/\/ otherwise they will block further parsing and rendering of the html\n          \/\/ page.\n          \/\/ High res src is added and original img src attribute is removed\n          \/\/ from img tag.\n          driver_->log_record()->LogAppliedRewriter(\n              RewriteOptions::FilterId(RewriteOptions::kDelayImages));\n          driver_->SetAttributeName(src, HtmlName::kPagespeedHighResSrc);\n          if (insert_low_res_images_inplace_) {\n            driver_->AddAttribute(element, HtmlName::kSrc,\n                                  low_res_src->DecodedValueOrNull());\n            if (is_experimental_enabled_) {\n              driver_->AddEscapedAttribute(\n                  element, HtmlName::kOnload, kOnloadFunction);\n            }\n          } else {\n            const GoogleString& src_content = src->DecodedValueOrNull();\n            low_res_data_map_[src_content] =\n                low_res_src->DecodedValueOrNull();\n          }\n        }\n        if (num_low_res_inlined_images_ ==\n            driver_->num_inline_preview_images()) {\n          if (insert_low_res_images_inplace_) {\n            InsertDelayImagesJS(element);\n          } else {\n            InsertDelayImagesInlineJS(element);\n          }\n        }\n      }\n      element->DeleteAttribute(HtmlName::kPagespeedLowResSrc);\n    }\n  }\n}\n\nvoid DelayImagesFilter::InsertDelayImagesInlineJS(HtmlElement* element) {\n  \/\/ Generate javascript map for inline data urls where key is url and\n  \/\/ base64 encoded data url as its value. This map is added to the\n  \/\/ html at the end of last low res image.\n  GoogleString inline_data_script;\n  for (StringStringMap::iterator it = low_res_data_map_.begin();\n      it != low_res_data_map_.end(); ++it) {\n    StrAppend(&inline_data_script,\n              \"\\npagespeed.delayImagesInline.addLowResImages('\",\n              it->first, \"', '\", it->second, \"');\");\n  }\n  low_res_data_map_.clear();\n  GoogleString inline_script;\n  \/\/ Check script for changing src to low res data url is inserted once.\n  if (!low_res_map_inserted_) {\n    inline_script = StrCat(\n        static_js_manager_->GetJsSnippet(\n            StaticJavascriptManager::kDelayImagesInlineJs,\n            driver_->options()),\n        kDelayImagesInlineSuffix);\n  }\n  StrAppend(&inline_script,\n            inline_data_script,\n            \"\\npagespeed.delayImagesInline.replaceWithLowRes();\\n\");\n  HtmlElement* script = driver_->NewElement(element, HtmlName::kScript);\n  driver_->InsertElementAfterElement(element, script);\n  static_js_manager_->AddJsToElement(inline_script, script, driver_);\n  InsertDelayImagesJS(script);\n}\n\nvoid DelayImagesFilter::InsertDelayImagesJS(HtmlElement* element) {\n  if (is_experimental_enabled_) {\n    return;\n  }\n  GoogleString delay_images_js;\n  \/\/ Check script for changing src to high res src is inserted once.\n  if (!low_res_map_inserted_) {\n  delay_images_js = StrCat(\n      static_js_manager_->GetJsSnippet(\n          StaticJavascriptManager::kDelayImagesJs,\n          driver_->options()),\n      kDelayImagesSuffix);\n  } else {\n    delay_images_js = \"\\npagespeed.delayImages.replaceWithHighRes();\\n\";\n  }\n  HtmlElement* script = driver_->NewElement(element, HtmlName::kScript);\n  driver_->InsertElementAfterElement(element, script);\n  static_js_manager_->AddJsToElement(delay_images_js, script, driver_);\n  low_res_map_inserted_ = true;\n}\n\n}  \/\/ namespace net_instaweb\n<commit_msg>Fix split_html problem on IE9.<commit_after>\/*\n * 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\n\/\/ Author: pulkitg@google.com (Pulkit Goyal)\n\/\/\n\/\/ Contains implementation of DelayImagesFilter, which delays all the high\n\/\/ quality images whose low quality inlined data url are available within their\n\/\/ respective image tag.\n\n#include \"net\/instaweb\/rewriter\/public\/delay_images_filter.h\"\n\n#include <map>\n#include <utility>\n\n#include \"net\/instaweb\/htmlparse\/public\/html_element.h\"\n#include \"net\/instaweb\/htmlparse\/public\/html_name.h\"\n#include \"net\/instaweb\/http\/public\/log_record.h\"\n#include \"net\/instaweb\/http\/public\/semantic_type.h\"\n#include \"net\/instaweb\/rewriter\/public\/server_context.h\"\n#include \"net\/instaweb\/rewriter\/public\/resource_tag_scanner.h\"\n#include \"net\/instaweb\/rewriter\/public\/rewrite_driver.h\"\n#include \"net\/instaweb\/rewriter\/public\/rewrite_options.h\"\n#include \"net\/instaweb\/rewriter\/public\/static_javascript_manager.h\"\n#include \"net\/instaweb\/util\/public\/string.h\"\n\nnamespace net_instaweb {\n\nconst char DelayImagesFilter::kDelayImagesSuffix[] =\n    \"\\npagespeed.delayImagesInit()\";\n\nconst char DelayImagesFilter::kDelayImagesInlineSuffix[] =\n    \"\\npagespeed.delayImagesInlineInit();\";\n\nconst char DelayImagesFilter::kOnloadFunction[] =\n    \"var elem=this;\"\n    \"setTimeout(function(){elem.onload = null;\"\n    \"elem.src=elem.getAttribute('pagespeed_high_res_src');}, 0);\";\n\nDelayImagesFilter::DelayImagesFilter(RewriteDriver* driver)\n    : driver_(driver),\n      static_js_manager_(\n          driver->server_context()->static_javascript_manager()),\n      low_res_map_inserted_(false),\n      num_low_res_inlined_images_(0),\n      is_experimental_enabled_(\n          driver_->options()->enable_inline_preview_images_experimental()) {\n  \/\/ Low res images will be placed inside the respective image tag if any one of\n  \/\/ kDeferJavascript or kLazyloadImages is turned off or\n  \/\/ enable_inline_preview_images_experimental is set to true. Otherwise, low\n  \/\/ res images will be blocked by javascript or images which are not critical.\n  insert_low_res_images_inplace_ =\n      is_experimental_enabled_ ||\n      !driver_->options()->Enabled(RewriteOptions::kDeferJavascript) ||\n      !driver_->options()->Enabled(RewriteOptions::kLazyloadImages);\n}\n\nDelayImagesFilter::~DelayImagesFilter() {}\n\nvoid DelayImagesFilter::StartDocument() {\n  low_res_map_inserted_ = false;\n  num_low_res_inlined_images_ = 0;\n}\n\nvoid DelayImagesFilter::EndDocument() {\n  low_res_data_map_.clear();\n}\n\nvoid DelayImagesFilter::EndElement(HtmlElement* element) {\n  if (element->keyword() == HtmlName::kBody && !low_res_map_inserted_ &&\n      !low_res_data_map_.empty()) {\n    InsertDelayImagesInlineJS(element);\n  } else if (driver_->IsRewritable(element) &&\n             (element->keyword() == HtmlName::kImg ||\n              element->keyword() == HtmlName::kInput)) {\n    \/\/ We only handle img and input tag images.  Note that delay_images.js and\n    \/\/ delay_images_inline.js must be modified to handle other possible tags.\n    \/\/ We should probably specifically *not* include low res images for link\n    \/\/ tags of various sorts (favicons, mobile desktop icons, etc.).  Use of low\n    \/\/ res for explicit background images is a more interesting case, but the\n    \/\/ current DOM walk in the above js files would need to be modified to\n    \/\/ handle the large number of tags that we can identify in\n    \/\/ resource_tag_scanner::ScanElement.\n    semantic_type::Category category;\n    HtmlElement::Attribute* src = resource_tag_scanner::ScanElement(\n        element, driver_, &category);\n\n    if (src != NULL && src->DecodedValueOrNull() != NULL &&\n        category == semantic_type::kImage) {\n      \/\/ Remove the inline_src which is low quality base64 encoded data url and\n      \/\/ add them to a map so that all inline data urls will be available at the\n      \/\/ end of body tag.\n      HtmlElement::Attribute* low_res_src =\n          element->FindAttribute(HtmlName::kPagespeedLowResSrc);\n      if ((low_res_src != NULL) &&\n          (low_res_src->DecodedValueOrNull() != NULL)) {\n        ++num_low_res_inlined_images_;\n        \/\/ Experimental mode adds an onload attribute of the image tag. So, low\n        \/\/ res image is only added if onload function is not already present.\n        if (!is_experimental_enabled_ ||\n            element->FindAttribute(HtmlName::kOnload) == NULL) {\n          \/\/ Low res image data is collected in low_res_data_map_ map. This\n          \/\/ low_res_src will be moved just after last low res image in the html\n          \/\/ DOM.\n          \/\/ It is better to move inlined low resolution data later in the DOM,\n          \/\/ otherwise they will block further parsing and rendering of the html\n          \/\/ page.\n          \/\/ High res src is added and original img src attribute is removed\n          \/\/ from img tag.\n          driver_->log_record()->LogAppliedRewriter(\n              RewriteOptions::FilterId(RewriteOptions::kDelayImages));\n          driver_->SetAttributeName(src, HtmlName::kPagespeedHighResSrc);\n          if (insert_low_res_images_inplace_) {\n            driver_->AddAttribute(element, HtmlName::kSrc,\n                                  low_res_src->DecodedValueOrNull());\n            if (is_experimental_enabled_) {\n              driver_->AddEscapedAttribute(\n                  element, HtmlName::kOnload, kOnloadFunction);\n            }\n          } else {\n            const GoogleString& src_content = src->DecodedValueOrNull();\n            low_res_data_map_[src_content] =\n                low_res_src->DecodedValueOrNull();\n          }\n        }\n        if (num_low_res_inlined_images_ ==\n            driver_->num_inline_preview_images()) {\n          if (insert_low_res_images_inplace_) {\n            InsertDelayImagesJS(element);\n          } else {\n            InsertDelayImagesInlineJS(element);\n          }\n        }\n      }\n      element->DeleteAttribute(HtmlName::kPagespeedLowResSrc);\n    }\n  }\n}\n\nvoid DelayImagesFilter::InsertDelayImagesInlineJS(HtmlElement* element) {\n  \/\/ Generate javascript map for inline data urls where key is url and\n  \/\/ base64 encoded data url as its value. This map is added to the\n  \/\/ html at the end of last low res image.\n  GoogleString inline_data_script;\n  for (StringStringMap::iterator it = low_res_data_map_.begin();\n      it != low_res_data_map_.end(); ++it) {\n    StrAppend(&inline_data_script,\n              \"\\npagespeed.delayImagesInline.addLowResImages('\",\n              it->first, \"', '\", it->second, \"');\");\n  }\n  low_res_data_map_.clear();\n  GoogleString inline_script;\n  \/\/ Check script for changing src to low res data url is inserted once.\n  if (!low_res_map_inserted_) {\n    inline_script = StrCat(\n        static_js_manager_->GetJsSnippet(\n            StaticJavascriptManager::kDelayImagesInlineJs,\n            driver_->options()),\n        kDelayImagesInlineSuffix);\n  }\n  StrAppend(&inline_script,\n            inline_data_script,\n            \"\\npagespeed.delayImagesInline.replaceWithLowRes();\\n\");\n  HtmlElement* script = driver_->NewElement(element, HtmlName::kScript);\n  driver_->InsertElementAfterElement(element, script);\n  static_js_manager_->AddJsToElement(inline_script, script, driver_);\n  InsertDelayImagesJS(script);\n}\n\nvoid DelayImagesFilter::InsertDelayImagesJS(HtmlElement* element) {\n  if (is_experimental_enabled_) {\n    return;\n  }\n  GoogleString delay_images_js;\n  \/\/ Check script for changing src to high res src is inserted once.\n  if (!low_res_map_inserted_) {\n  delay_images_js = StrCat(\n      static_js_manager_->GetJsSnippet(\n          StaticJavascriptManager::kDelayImagesJs,\n          driver_->options()),\n      kDelayImagesSuffix);\n  } else {\n    delay_images_js = \"\\npagespeed.delayImages.replaceWithHighRes();\\n\";\n  }\n  HtmlElement* script = driver_->NewElement(element, HtmlName::kScript);\n  driver_->InsertElementAfterElement(element, script);\n  static_js_manager_->AddJsToElement(delay_images_js, script, driver_);\n  low_res_map_inserted_ = true;\n}\n\n}  \/\/ namespace net_instaweb\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 <string>\n\n#include \"Options.hpp\"\n#include \"Compiler.hpp\"\n#include \"Utils.hpp\"\n#include \"Platform.hpp\"\n\n#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MODULE Eddic Tests\n#include <boost\/test\/unit_test.hpp>\n\n#define TEST_SAMPLE(file)\\\nBOOST_AUTO_TEST_CASE( samples_##file ){\\\n    assertCompiles(\"samples\/\" #file \".eddi\", \"-32\");\\\n    assertCompiles(\"samples\/\" #file \".eddi\", \"-64\");\\\n}\n\nvoid assertCompiles(const std::string& file, const std::string& param){\n    const char* options[1] = {param.c_str()};\n    eddic::parseOptions(1, options);\n\n    eddic::Compiler compiler;\n\n    eddic::Platform platform = eddic::Platform::INTEL_X86;\n    int code = compiler.compileOnly(file, platform);\n\n    BOOST_CHECK_EQUAL (code, 0);\n}\n\nvoid assertOutputEquals(const std::string& file, const std::string& output, const std::string& param){\n    assertCompiles(\"test\/cases\/\" + file, param);\n\n    std::string out = eddic::execCommand(\".\/a.out\"); \n    \n    BOOST_CHECK_EQUAL (output, out);\n}\n\n\/* Compiles all the samples *\/\n\nTEST_SAMPLE(arrays)\nTEST_SAMPLE(asm)\nTEST_SAMPLE(assembly)\nTEST_SAMPLE(bool)\nTEST_SAMPLE(compound)\nTEST_SAMPLE(concat)\nTEST_SAMPLE(const)\nTEST_SAMPLE(functions)\nTEST_SAMPLE(inc)\nTEST_SAMPLE(includes)\nTEST_SAMPLE(optimize)\nTEST_SAMPLE(problem)\nTEST_SAMPLE(sort)\nTEST_SAMPLE(identifiers)\n\n\/* Specific tests *\/ \n\nBOOST_AUTO_TEST_CASE( if_ ){\n    assertOutputEquals(\"if.eddi\", \"Cool\", \"-32\");\n    assertOutputEquals(\"if.eddi\", \"Cool\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( while_ ){\n    assertOutputEquals(\"while.eddi\", \"01234\", \"-32\");\n    assertOutputEquals(\"while.eddi\", \"01234\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( do_while_ ){\n    assertOutputEquals(\"do_while.eddi\", \"01234\", \"-32\");\n    assertOutputEquals(\"do_while.eddi\", \"01234\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( for_ ){\n    assertOutputEquals(\"for.eddi\", \"01234\", \"-32\");\n    assertOutputEquals(\"for.eddi\", \"01234\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( foreach_ ){\n    assertOutputEquals(\"foreach.eddi\", \"012345\", \"-32\");\n    assertOutputEquals(\"foreach.eddi\", \"012345\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( globals_ ){\n    assertOutputEquals(\"globals.eddi\", \"1000a2000aa\", \"-32\");\n    assertOutputEquals(\"globals.eddi\", \"1000a2000aa\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( void_functions ){\n    assertOutputEquals(\"void.eddi\", \"4445\", \"-32\");\n    assertOutputEquals(\"void.eddi\", \"4445\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( string_functions ){\n    assertOutputEquals(\"return_string.eddi\", \"abcdef\", \"-32\");\n    assertOutputEquals(\"return_string.eddi\", \"abcdef\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( int_functions ){\n    assertOutputEquals(\"return_int.eddi\", \"484\", \"-32\");\n    assertOutputEquals(\"return_int.eddi\", \"484\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( recursive_functions ){\n    assertOutputEquals(\"recursive.eddi\", \"362880\", \"-32\");\n    assertOutputEquals(\"recursive.eddi\", \"362880\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( math ){\n    assertOutputEquals(\"math.eddi\", \"333|111|-111|0|24642|2|-2|-1|1|2|0|-111|\", \"-32\");\n    assertOutputEquals(\"math.eddi\", \"333|111|-111|0|24642|2|-2|-1|1|2|0|-111|\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( builtin ){\n    assertOutputEquals(\"builtin.eddi\", \"10|11|12|13|12|13|10|11|4|8|13|8|0|3|\", \"-32\");\n    assertOutputEquals(\"builtin.eddi\", \"10|11|12|13|12|13|10|11|4|8|13|8|0|3|\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( assign_value ){\n    assertOutputEquals(\"assign_value.eddi\", \"66779921\", \"-32\");\n    assertOutputEquals(\"assign_value.eddi\", \"66779921\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( args ){\n    assertCompiles(\"test\/cases\/args.eddi\", \"-32\");\n\n    std::string out = eddic::execCommand(\".\/a.out\"); \n    BOOST_CHECK_EQUAL (\".\/a.out|\", out);\n    \n    out = eddic::execCommand(\".\/a.out arg1 arg2 arg3\"); \n    BOOST_CHECK_EQUAL (\".\/a.out|arg1|arg2|arg3|\", out);\n    \n    assertCompiles(\"test\/cases\/args.eddi\", \"-64\");\n\n    out = eddic::execCommand(\".\/a.out\"); \n    BOOST_CHECK_EQUAL (\".\/a.out|\", out);\n    \n    out = eddic::execCommand(\".\/a.out arg1 arg2 arg3\"); \n    BOOST_CHECK_EQUAL (\".\/a.out|arg1|arg2|arg3|\", out);\n}\n    \n\/* Unit test for bug fixes regression *\/\nBOOST_AUTO_TEST_CASE( while_bug ){\n    assertOutputEquals(\"while_bug.eddi\", \"W1W2W3W4W5\", \"-32\");\n    assertOutputEquals(\"while_bug.eddi\", \"W1W2W3W4W5\", \"-64\");\n}\n<commit_msg>Add the float samples to the integration tests<commit_after>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2011.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/  http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/=======================================================================\n\n#include <string>\n\n#include \"Options.hpp\"\n#include \"Compiler.hpp\"\n#include \"Utils.hpp\"\n#include \"Platform.hpp\"\n\n#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MODULE Eddic Tests\n#include <boost\/test\/unit_test.hpp>\n\n#define TEST_SAMPLE(file)\\\nBOOST_AUTO_TEST_CASE( samples_##file ){\\\n    assertCompiles(\"samples\/\" #file \".eddi\", \"-32\");\\\n    assertCompiles(\"samples\/\" #file \".eddi\", \"-64\");\\\n}\n\nvoid assertCompiles(const std::string& file, const std::string& param){\n    const char* options[1] = {param.c_str()};\n    eddic::parseOptions(1, options);\n\n    eddic::Compiler compiler;\n\n    eddic::Platform platform = eddic::Platform::INTEL_X86;\n    int code = compiler.compileOnly(file, platform);\n\n    BOOST_CHECK_EQUAL (code, 0);\n}\n\nvoid assertOutputEquals(const std::string& file, const std::string& output, const std::string& param){\n    assertCompiles(\"test\/cases\/\" + file, param);\n\n    std::string out = eddic::execCommand(\".\/a.out\"); \n    \n    BOOST_CHECK_EQUAL (output, out);\n}\n\n\/* Compiles all the samples *\/\n\nTEST_SAMPLE(arrays)\nTEST_SAMPLE(asm)\nTEST_SAMPLE(assembly)\nTEST_SAMPLE(bool)\nTEST_SAMPLE(compound)\nTEST_SAMPLE(concat)\nTEST_SAMPLE(const)\nTEST_SAMPLE(functions)\nTEST_SAMPLE(float)\nTEST_SAMPLE(inc)\nTEST_SAMPLE(includes)\nTEST_SAMPLE(optimize)\nTEST_SAMPLE(problem)\nTEST_SAMPLE(sort)\nTEST_SAMPLE(identifiers)\n\n\/* Specific tests *\/ \n\nBOOST_AUTO_TEST_CASE( if_ ){\n    assertOutputEquals(\"if.eddi\", \"Cool\", \"-32\");\n    assertOutputEquals(\"if.eddi\", \"Cool\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( while_ ){\n    assertOutputEquals(\"while.eddi\", \"01234\", \"-32\");\n    assertOutputEquals(\"while.eddi\", \"01234\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( do_while_ ){\n    assertOutputEquals(\"do_while.eddi\", \"01234\", \"-32\");\n    assertOutputEquals(\"do_while.eddi\", \"01234\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( for_ ){\n    assertOutputEquals(\"for.eddi\", \"01234\", \"-32\");\n    assertOutputEquals(\"for.eddi\", \"01234\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( foreach_ ){\n    assertOutputEquals(\"foreach.eddi\", \"012345\", \"-32\");\n    assertOutputEquals(\"foreach.eddi\", \"012345\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( globals_ ){\n    assertOutputEquals(\"globals.eddi\", \"1000a2000aa\", \"-32\");\n    assertOutputEquals(\"globals.eddi\", \"1000a2000aa\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( void_functions ){\n    assertOutputEquals(\"void.eddi\", \"4445\", \"-32\");\n    assertOutputEquals(\"void.eddi\", \"4445\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( string_functions ){\n    assertOutputEquals(\"return_string.eddi\", \"abcdef\", \"-32\");\n    assertOutputEquals(\"return_string.eddi\", \"abcdef\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( int_functions ){\n    assertOutputEquals(\"return_int.eddi\", \"484\", \"-32\");\n    assertOutputEquals(\"return_int.eddi\", \"484\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( recursive_functions ){\n    assertOutputEquals(\"recursive.eddi\", \"362880\", \"-32\");\n    assertOutputEquals(\"recursive.eddi\", \"362880\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( math ){\n    assertOutputEquals(\"math.eddi\", \"333|111|-111|0|24642|2|-2|-1|1|2|0|-111|\", \"-32\");\n    assertOutputEquals(\"math.eddi\", \"333|111|-111|0|24642|2|-2|-1|1|2|0|-111|\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( builtin ){\n    assertOutputEquals(\"builtin.eddi\", \"10|11|12|13|12|13|10|11|4|8|13|8|0|3|\", \"-32\");\n    assertOutputEquals(\"builtin.eddi\", \"10|11|12|13|12|13|10|11|4|8|13|8|0|3|\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( assign_value ){\n    assertOutputEquals(\"assign_value.eddi\", \"66779921\", \"-32\");\n    assertOutputEquals(\"assign_value.eddi\", \"66779921\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( args ){\n    assertCompiles(\"test\/cases\/args.eddi\", \"-32\");\n\n    std::string out = eddic::execCommand(\".\/a.out\"); \n    BOOST_CHECK_EQUAL (\".\/a.out|\", out);\n    \n    out = eddic::execCommand(\".\/a.out arg1 arg2 arg3\"); \n    BOOST_CHECK_EQUAL (\".\/a.out|arg1|arg2|arg3|\", out);\n    \n    assertCompiles(\"test\/cases\/args.eddi\", \"-64\");\n\n    out = eddic::execCommand(\".\/a.out\"); \n    BOOST_CHECK_EQUAL (\".\/a.out|\", out);\n    \n    out = eddic::execCommand(\".\/a.out arg1 arg2 arg3\"); \n    BOOST_CHECK_EQUAL (\".\/a.out|arg1|arg2|arg3|\", out);\n}\n    \n\/* Unit test for bug fixes regression *\/\nBOOST_AUTO_TEST_CASE( while_bug ){\n    assertOutputEquals(\"while_bug.eddi\", \"W1W2W3W4W5\", \"-32\");\n    assertOutputEquals(\"while_bug.eddi\", \"W1W2W3W4W5\", \"-64\");\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <silicium\/optional.hpp>\n#include <silicium\/noexcept_string.hpp>\n#include <boost\/test\/unit_test.hpp>\n\nnamespace Si\n{\n\ttemplate <class Policy>\n\tstruct compact_optional\n\t{\n\t\ttypedef typename Policy::value_type value_type;\n\n\t\tcompact_optional()\n\t\t\t: m_storage(Policy::get_none())\n\t\t{\n\t\t\tassert(!*this);\n\t\t}\n\n\t\ttemplate <class ...Args>\n\t\tcompact_optional(some_t, Args &&...args)\n\t\t\t: m_storage(std::forward<Args>(args)...)\n\t\t{\n\t\t\tassert(*this);\n\t\t}\n\n\t\tcompact_optional(none_t)\n\t\t\t: m_storage(Policy::get_none())\n\t\t{\n\t\t\tassert(!*this);\n\t\t}\n\n\t\tcompact_optional(value_type value)\n\t\t\t: m_storage(std::move(value))\n\t\t{\n\t\t\tassert(*this);\n\t\t}\n\n\t\tbool operator !() const BOOST_NOEXCEPT\n\t\t{\n\t\t\treturn Policy::is_none(m_storage);\n\t\t}\n\n\t\tSILICIUM_EXPLICIT_OPERATOR_BOOL()\n\n\t\tvalue_type &operator *() BOOST_NOEXCEPT\n\t\t{\n\t\t\tassert(*this);\n\t\t\treturn m_storage;\n\t\t}\n\n\t\tvalue_type const &operator *() const BOOST_NOEXCEPT\n\t\t{\n\t\t\tassert(*this);\n\t\t\treturn m_storage;\n\t\t}\n\n\t\tvalue_type *operator ->() BOOST_NOEXCEPT\n\t\t{\n\t\t\tassert(*this);\n\t\t\treturn &m_storage;\n\t\t}\n\n\t\tvalue_type const *operator ->() const BOOST_NOEXCEPT\n\t\t{\n\t\t\tassert(*this);\n\t\t\treturn &m_storage;\n\t\t}\n\n\tprivate:\n\n\t\tvalue_type m_storage;\n\t};\n\n\ttemplate <class Policy>\n\tbool operator == (compact_optional<Policy> const &left, compact_optional<Policy> const &right)\n\t{\n\t\tif (left)\n\t\t{\n\t\t\tif (right)\n\t\t\t{\n\t\t\t\treturn *left == *right;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif (right)\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\t}\n\n\ttemplate <class Policy>\n\tbool operator == (compact_optional<Policy> const &left, none_t)\n\t{\n\t\treturn !left;\n\t}\n\n\ttemplate <class Policy>\n\tbool operator == (none_t, compact_optional<Policy> const &right)\n\t{\n\t\treturn !right;\n\t}\n\n\ttemplate <class Policy>\n\tbool operator != (compact_optional<Policy> const &left, compact_optional<Policy> const &right)\n\t{\n\t\treturn !(left == right);\n\t}\n\n\ttemplate <class Policy>\n\tbool operator != (compact_optional<Policy> const &left, none_t)\n\t{\n\t\treturn !!left;\n\t}\n\n\ttemplate <class Policy>\n\tbool operator != (none_t, compact_optional<Policy> const &right)\n\t{\n\t\treturn !!right;\n\t}\n\n\ttemplate <class Policy>\n\tstd::ostream &operator << (std::ostream &out, compact_optional<Policy> const &value)\n\t{\n\t\tif (value)\n\t\t{\n\t\t\treturn out << *value;\n\t\t}\n\t\treturn out << none;\n\t}\n\n\ttemplate <class Number>\n\tstruct positive_number\n\t{\n\t\ttypedef Number value_type;\n\t\tstatic bool is_none(value_type value)\n\t\t{\n\t\t\treturn value < 0;\n\t\t}\n\t\tstatic value_type get_none()\n\t\t{\n\t\t\treturn -1;\n\t\t}\n\t};\n\n\ttemplate <class String>\n\tstruct non_empty_string\n\t{\n\t\ttypedef String value_type;\n\t\tstatic bool is_none(value_type const &value)\n\t\t{\n\t\t\treturn value.empty();\n\t\t}\n\t\tstatic value_type get_none()\n\t\t{\n\t\t\treturn {};\n\t\t}\n\t};\n\n\ttypedef compact_optional<positive_number<boost::int32_t>> optional_int31;\n\tBOOST_STATIC_ASSERT(sizeof(optional_int31) == sizeof(boost::uint32_t));\n\n\ttypedef compact_optional<non_empty_string<noexcept_string>> optional_non_empty_string;\n\tBOOST_STATIC_ASSERT(sizeof(optional_non_empty_string) == sizeof(noexcept_string));\n}\n\nBOOST_AUTO_TEST_CASE(compact_optional_none_equal)\n{\n\tSi::optional_int31 a, b;\n\tBOOST_CHECK_EQUAL(a, b);\n\tBOOST_CHECK_EQUAL(a, Si::none);\n\tBOOST_CHECK_EQUAL(Si::none, b);\n\tBOOST_CHECK_EQUAL(Si::none, Si::none);\n}\n\nBOOST_AUTO_TEST_CASE(compact_optional_construct)\n{\n\tSi::optional_non_empty_string a;\n\tSi::optional_non_empty_string b(\"1\");\n\tBOOST_CHECK_EQUAL(b, b);\n\tSi::optional_non_empty_string c(Si::noexcept_string(\"2\"));\n\tBOOST_CHECK_EQUAL(c, c);\n\tSi::optional_non_empty_string d(Si::some, \"3\");\n\tBOOST_CHECK_EQUAL(d, d);\n\tSi::optional_non_empty_string e(Si::some, Si::noexcept_string(\"2\"));\n\tSi::optional_non_empty_string f(Si::none);\n\tBOOST_CHECK_EQUAL(e, e);\n\tBOOST_CHECK_NE(a, b);\n\tBOOST_CHECK_NE(a, c);\n\tBOOST_CHECK_NE(a, d);\n\tBOOST_CHECK_EQUAL(c, e);\n\tBOOST_CHECK_EQUAL(a, f);\n}\n<commit_msg>test boundary value<commit_after>#include <silicium\/optional.hpp>\n#include <silicium\/noexcept_string.hpp>\n#include <boost\/test\/unit_test.hpp>\n\nnamespace Si\n{\n\ttemplate <class Policy>\n\tstruct compact_optional\n\t{\n\t\ttypedef typename Policy::value_type value_type;\n\n\t\tcompact_optional()\n\t\t\t: m_storage(Policy::get_none())\n\t\t{\n\t\t\tassert(!*this);\n\t\t}\n\n\t\ttemplate <class ...Args>\n\t\tcompact_optional(some_t, Args &&...args)\n\t\t\t: m_storage(std::forward<Args>(args)...)\n\t\t{\n\t\t\tassert(*this);\n\t\t}\n\n\t\tcompact_optional(none_t)\n\t\t\t: m_storage(Policy::get_none())\n\t\t{\n\t\t\tassert(!*this);\n\t\t}\n\n\t\tcompact_optional(value_type value)\n\t\t\t: m_storage(std::move(value))\n\t\t{\n\t\t\tassert(*this);\n\t\t}\n\n\t\tbool operator !() const BOOST_NOEXCEPT\n\t\t{\n\t\t\treturn Policy::is_none(m_storage);\n\t\t}\n\n\t\tSILICIUM_EXPLICIT_OPERATOR_BOOL()\n\n\t\tvalue_type &operator *() BOOST_NOEXCEPT\n\t\t{\n\t\t\tassert(*this);\n\t\t\treturn m_storage;\n\t\t}\n\n\t\tvalue_type const &operator *() const BOOST_NOEXCEPT\n\t\t{\n\t\t\tassert(*this);\n\t\t\treturn m_storage;\n\t\t}\n\n\t\tvalue_type *operator ->() BOOST_NOEXCEPT\n\t\t{\n\t\t\tassert(*this);\n\t\t\treturn &m_storage;\n\t\t}\n\n\t\tvalue_type const *operator ->() const BOOST_NOEXCEPT\n\t\t{\n\t\t\tassert(*this);\n\t\t\treturn &m_storage;\n\t\t}\n\n\tprivate:\n\n\t\tvalue_type m_storage;\n\t};\n\n\ttemplate <class Policy>\n\tbool operator == (compact_optional<Policy> const &left, compact_optional<Policy> const &right)\n\t{\n\t\tif (left)\n\t\t{\n\t\t\tif (right)\n\t\t\t{\n\t\t\t\treturn *left == *right;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif (right)\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\t}\n\n\ttemplate <class Policy>\n\tbool operator == (compact_optional<Policy> const &left, typename Policy::value_type const &right)\n\t{\n\t\tif (left)\n\t\t{\n\t\t\treturn *left == right;\n\t\t}\n\t\treturn false;\n\t}\n\n\ttemplate <class Policy>\n\tbool operator == (typename Policy::value_type const &left, compact_optional<Policy> const &right)\n\t{\n\t\tif (right)\n\t\t{\n\t\t\treturn left == *right;\n\t\t}\n\t\treturn false;\n\t}\n\n\ttemplate <class Policy>\n\tbool operator == (compact_optional<Policy> const &left, none_t)\n\t{\n\t\treturn !left;\n\t}\n\n\ttemplate <class Policy>\n\tbool operator == (none_t, compact_optional<Policy> const &right)\n\t{\n\t\treturn !right;\n\t}\n\n\ttemplate <class Policy>\n\tbool operator != (compact_optional<Policy> const &left, compact_optional<Policy> const &right)\n\t{\n\t\treturn !(left == right);\n\t}\n\n\ttemplate <class Policy>\n\tbool operator != (compact_optional<Policy> const &left, none_t)\n\t{\n\t\treturn !!left;\n\t}\n\n\ttemplate <class Policy>\n\tbool operator != (none_t, compact_optional<Policy> const &right)\n\t{\n\t\treturn !!right;\n\t}\n\n\ttemplate <class Policy>\n\tstd::ostream &operator << (std::ostream &out, compact_optional<Policy> const &value)\n\t{\n\t\tif (value)\n\t\t{\n\t\t\treturn out << *value;\n\t\t}\n\t\treturn out << none;\n\t}\n\n\ttemplate <class Number>\n\tstruct positive_number\n\t{\n\t\ttypedef Number value_type;\n\t\tstatic bool is_none(value_type value)\n\t\t{\n\t\t\treturn value < 0;\n\t\t}\n\t\tstatic value_type get_none()\n\t\t{\n\t\t\treturn -1;\n\t\t}\n\t};\n\n\ttemplate <class String>\n\tstruct non_empty_string\n\t{\n\t\ttypedef String value_type;\n\t\tstatic bool is_none(value_type const &value)\n\t\t{\n\t\t\treturn value.empty();\n\t\t}\n\t\tstatic value_type get_none()\n\t\t{\n\t\t\treturn {};\n\t\t}\n\t};\n\n\ttemplate <class Pointee>\n\tstruct pointer\n\t{\n\t\ttypedef Pointee *value_type;\n\t\tstatic bool is_none(value_type value)\n\t\t{\n\t\t\treturn (value == get_none());\n\t\t}\n\t\tstatic value_type get_none()\n\t\t{\n\t\t\tstatic union\n\t\t\t{\n\t\t\t\tPointee a, b;\n\t\t\t}\n\t\t\tnone_dummy;\n\t\t\treturn &none_dummy.a;\n\t\t}\n\t};\n\n\ttypedef compact_optional<positive_number<boost::int32_t>> optional_int31;\n\tBOOST_STATIC_ASSERT(sizeof(optional_int31) == sizeof(boost::uint32_t));\n\n\ttypedef compact_optional<non_empty_string<noexcept_string>> optional_non_empty_string;\n\tBOOST_STATIC_ASSERT(sizeof(optional_non_empty_string) == sizeof(noexcept_string));\n\n\ttemplate <class Pointee>\n\tusing optional_ptr = compact_optional<pointer<Pointee>>;\n\tBOOST_STATIC_ASSERT(sizeof(optional_ptr<int>) == sizeof(int *));\n}\n\nBOOST_AUTO_TEST_CASE(compact_optional_none_equal)\n{\n\tSi::optional_int31 a, b;\n\tBOOST_CHECK_EQUAL(a, b);\n\tBOOST_CHECK_EQUAL(a, Si::none);\n\tBOOST_CHECK_EQUAL(Si::none, b);\n\tBOOST_CHECK_EQUAL(Si::none, Si::none);\n\tBOOST_CHECK_NE(a, std::numeric_limits<boost::int32_t>::max());\n\tBOOST_CHECK_NE(std::numeric_limits<boost::int32_t>::max(), a);\n}\n\nBOOST_AUTO_TEST_CASE(compact_optional_construct)\n{\n\tSi::optional_non_empty_string a;\n\tSi::optional_non_empty_string b(\"1\");\n\tBOOST_CHECK_EQUAL(b, b);\n\tSi::optional_non_empty_string c(Si::noexcept_string(\"2\"));\n\tBOOST_CHECK_EQUAL(c, c);\n\tSi::optional_non_empty_string d(Si::some, \"3\");\n\tBOOST_CHECK_EQUAL(d, d);\n\tSi::optional_non_empty_string e(Si::some, Si::noexcept_string(\"2\"));\n\tSi::optional_non_empty_string f(Si::none);\n\tBOOST_CHECK_EQUAL(e, e);\n\tBOOST_CHECK_NE(a, b);\n\tBOOST_CHECK_NE(a, c);\n\tBOOST_CHECK_NE(a, d);\n\tBOOST_CHECK_EQUAL(c, e);\n\tBOOST_CHECK_EQUAL(a, f);\n}\n\nBOOST_AUTO_TEST_CASE(optional_ptr)\n{\n\tSi::optional_ptr<long> a, b;\n\tBOOST_CHECK_EQUAL(a, b);\n\tBOOST_CHECK_EQUAL(b, Si::none);\n\tlong pointee = 2;\n\tb = &pointee;\n\tBOOST_CHECK_EQUAL(a, Si::none);\n\tBOOST_CHECK_NE(b, Si::none);\n\t**b = 3;\n\tBOOST_CHECK_EQUAL(3, pointee);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\n* Copyright (c) 2003-2008 Rony Shapiro <ronys@users.sourceforge.net>.\r\n* All rights reserved. Use of the code is allowed under the\r\n* Artistic License 2.0 terms, as specified in the LICENSE file\r\n* distributed with this code, or available from\r\n* http:\/\/www.opensource.org\/licenses\/artistic-license-2.0.php\r\n*\/\r\n\r\n\/**\r\n * \\file Windows-specific implementation of dir.h\r\n *\/\r\n#include <afx.h>\r\n#include <Windows.h>\r\n#include \"..\/dir.h\"\r\n#include <direct.h>\r\nstringT pws_os::getexecdir()\r\n{\r\n  \/\/ returns the directory part of ::GetModuleFileName()\r\n  TCHAR acPath[MAX_PATH + 1];\r\n\r\n  if (GetModuleFileName( NULL, acPath, MAX_PATH + 1) != 0) {\r\n    \/\/ guaranteed file name of at least one character after path '\\'\r\n    *(_tcsrchr(acPath, _T('\\\\')) + 1) = _T('\\0');\r\n  } else {\r\n    acPath[0] = TCHAR('\\\\'); acPath[1] = TCHAR('\\0');\r\n  }\r\n  return stringT(acPath);\r\n}\r\n\r\nstringT pws_os::getcwd()\r\n{\r\n  charT *curdir = _tgetcwd(NULL, 512); \/\/ NULL means 512 doesn't matter\r\n  stringT CurDir(curdir);\r\n  free(curdir);\r\n  return CurDir;\r\n}\r\n\r\nbool pws_os::chdir(const stringT &dir)\r\n{\r\n  ASSERT(!dir.empty());\r\n  return (_tchdir(dir.c_str()) == 0);\r\n}\r\n\r\n  \/\/ In following, drive will be empty on non-Windows platforms\r\nbool pws_os::splitpath(const stringT &path,\r\n                       stringT &drive, stringT &dir,\r\n                       stringT &file, stringT &ext)\r\n{\r\n  TCHAR tdrv[_MAX_DRIVE];\r\n  TCHAR tdir[_MAX_DIR];\r\n  TCHAR tname[_MAX_FNAME];\r\n  TCHAR text[_MAX_EXT];\r\n\r\n  memset(tdrv, 0x00, sizeof(tdrv));\r\n  memset(tdir, 0x00, sizeof(tdir));\r\n  memset(tname, 0x00, sizeof(tname));\r\n  memset(text, 0x00, sizeof(text));\r\n\r\n  if (_tsplitpath_s(path.c_str(), tdrv, tdir, tname, text) == 0) {\r\n    drive = tdrv;\r\n    dir = tdir;\r\n    file = tname;\r\n    ext = text;\r\n    return true;\r\n  } else\r\n    return false;\r\n}\r\n\r\nstringT pws_os::makepath(const stringT &drive, const stringT &dir,\r\n                         const stringT &file, const stringT &ext)\r\n{\r\n  stringT retval;\r\n  TCHAR path[_MAX_PATH];\r\n\r\n  if (_tmakepath_s(path, drive.c_str(), dir.c_str(),\r\n                   file.c_str(), ext.c_str()) == 0)\r\n    retval = path;\r\n  return retval;\r\n}\r\n<commit_msg>nanonit<commit_after>\/*\r\n* Copyright (c) 2003-2008 Rony Shapiro <ronys@users.sourceforge.net>.\r\n* All rights reserved. Use of the code is allowed under the\r\n* Artistic License 2.0 terms, as specified in the LICENSE file\r\n* distributed with this code, or available from\r\n* http:\/\/www.opensource.org\/licenses\/artistic-license-2.0.php\r\n*\/\r\n\r\n\/**\r\n * \\file Windows-specific implementation of dir.h\r\n *\/\r\n#include <afx.h>\r\n#include <Windows.h>\r\n#include \"..\/dir.h\"\r\n#include <direct.h>\r\nstringT pws_os::getexecdir()\r\n{\r\n  \/\/ returns the directory part of ::GetModuleFileName()\r\n  TCHAR acPath[MAX_PATH + 1];\r\n\r\n  if (GetModuleFileName( NULL, acPath, MAX_PATH + 1) != 0) {\r\n    \/\/ guaranteed file name of at least one character after path '\\'\r\n    *(_tcsrchr(acPath, _T('\\\\')) + 1) = _T('\\0');\r\n  } else {\r\n    acPath[0] = TCHAR('\\\\'); acPath[1] = TCHAR('\\0');\r\n  }\r\n  return stringT(acPath);\r\n}\r\n\r\nstringT pws_os::getcwd()\r\n{\r\n  charT *curdir = _tgetcwd(NULL, 512); \/\/ NULL means 512 doesn't matter\r\n  stringT CurDir(curdir);\r\n  free(curdir);\r\n  return CurDir;\r\n}\r\n\r\nbool pws_os::chdir(const stringT &dir)\r\n{\r\n  ASSERT(!dir.empty());\r\n  return (_tchdir(dir.c_str()) == 0);\r\n}\r\n\r\n  \/\/ In following, drive will be empty on non-Windows platforms\r\nbool pws_os::splitpath(const stringT &path,\r\n                       stringT &drive, stringT &dir,\r\n                       stringT &file, stringT &ext)\r\n{\r\n  TCHAR tdrv[_MAX_DRIVE];\r\n  TCHAR tdir[_MAX_DIR];\r\n  TCHAR tname[_MAX_FNAME];\r\n  TCHAR text[_MAX_EXT];\r\n\r\n  memset(tdrv, 0, sizeof(tdrv));\r\n  memset(tdir, 0, sizeof(tdir));\r\n  memset(tname, 0, sizeof(tname));\r\n  memset(text, 0, sizeof(text));\r\n\r\n  if (_tsplitpath_s(path.c_str(), tdrv, tdir, tname, text) == 0) {\r\n    drive = tdrv;\r\n    dir = tdir;\r\n    file = tname;\r\n    ext = text;\r\n    return true;\r\n  } else\r\n    return false;\r\n}\r\n\r\nstringT pws_os::makepath(const stringT &drive, const stringT &dir,\r\n                         const stringT &file, const stringT &ext)\r\n{\r\n  stringT retval;\r\n  TCHAR path[_MAX_PATH];\r\n\r\n  memset(path, 0, sizeof(path));\r\n  if (_tmakepath_s(path, drive.c_str(), dir.c_str(),\r\n                   file.c_str(), ext.c_str()) == 0)\r\n    retval = path;\r\n  return retval;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * string file porter2_stemmer.cpp\n *\/\n\n#include <boost\/regex.hpp>\n#include \"porter2_stemmer.h\"\n\nusing namespace Porter2Stemmer::internal;\nusing std::string;\nusing boost::regex;\nusing boost::smatch;\n\n#include <iostream>\nusing std::cout;\nusing std::endl;\n\nstring Porter2Stemmer::stem(const string & toStem)\n{\n    string word = prepareWord(toStem);\n\n    if(returnImmediately(word))\n        return finalStem(word);\n\n    changeY(word);\n    int startR1 = getStartR1(word);\n    int startR2 = getStartR2(word, startR1);\n    removeApostrophe(word);\n    step1A(word);\n    step1B(word, startR1);\n    step1C(word);\n    step2(word, startR1);\n    step3(word, startR1, startR2);\n    step4(word, startR2);\n    step5(word, startR1, startR2);\n\n    return finalStem(word);\n}\n\nstring Porter2Stemmer::internal::finalStem(string & word)\n{\n    word = regex_replace(word, regex(\"Y\"), \"y\");\n    word = regex_replace(word, regex(\"'\"), \"\");\n    return word;\n}\n\nstring Porter2Stemmer::internal::prepareWord(const string & toStem)\n{\n    string word = \"\";\n    for(auto ch: toStem)\n    {\n        if(ch > 'A' && ch < 'Z')\n            ch += 32;\n        if((ch > 'a' && ch < 'z') || ch == '\\'')\n            word += ch;\n    }\n    return word;\n}\n\nbool Porter2Stemmer::internal::returnImmediately(const string & word)\n{\n    return word.size() <= 2;\n}\n\nint Porter2Stemmer::internal::getStartR1(const string & word)\n{\n    smatch results;\n    if(regex_search(word, results, regex(\"[aeiouy][^aeiouy]\")))\n        return results.position() + 2;\n    else\n        return word.size();\n}\n\nint Porter2Stemmer::internal::getStartR2(const string & word, int startR1)\n{\n    if(startR1 == word.size())\n        return startR1;\n\n    string split = word.substr(startR1, word.size() - startR1);\n\n    smatch results;\n    if(regex_search(split, results, regex(\"[aeiouy][^aeiouy]\")))\n        return results.position() + startR1 + 2;\n    else\n        return word.size();\n}\n\nvoid Porter2Stemmer::internal::changeY(string & word)\n{\n    if(word.find_first_of(\"y\") == string::npos)\n        return;\n\n    if(word[0] == 'y')\n        word[0] = 'Y';\n\n    word = regex_replace(word, regex(\"([aeiou])y\"), \"$1Y\");\n}\n\nvoid Porter2Stemmer::internal::removeApostrophe(string & word)\n{\n    smatch results;\n    word = regex_replace(word, regex(\"'s.*$\"), \"\");\n}\n\nvoid Porter2Stemmer::internal::step1A(string & word)\n{\n    smatch results;\n    if(regex_search(word, results, regex(\"sses$\")))\n    {\n        regex_replace(word, regex(\"(.*)sses$\"), \"$1ss\");\n        return;\n    }\n\n    if(regex_search(word, results, regex(\".*(ied|ies)\")))\n    {\n        if(results.position() > 1)\n        {\n            regex_replace(word, regex(\".*(ied|ies)$\"), \"$1i\");\n            return;\n        }\n    }\n    else\n    {\n        regex_replace(word, regex(\".*(ied|ies)$\"), \"$1ie\");\n        return;\n    }\n\n    if(regex_search(word, results, regex(\".*(u|s)s$\")))\n        return;\n\n    if(regex_search(word, results, regex(\".*[aeiouy](.*)+s$\")))\n        word = word.substr(0, word.size() - 1);\n}\n\nvoid Porter2Stemmer::internal::step1B(string & word, int startR1)\n{\n  \/\/if word.search(\/(eed|eedly)$\/) >= startR1\n  \/\/return word.replace(\/(\\w*)(eed|eedly)\/, \"$1ee\")\n  \/\/if word.match(\/\\w*?[aeiouy]\\w+(ed|edly|ing|ingly)$\/)\n  \/\/word = word.match(\/^(\\w*?[aeiouy]\\w+)(ed|edly|ing|ingly)$\/)[1]\n  \/\/return word + \"e\" if word.match(\/(at|bl|iz)$\/)\n  \/\/if word.match(\/(bb|dd|ff|gg|mm|nn|pp|rr|tt)$\/)\n  \/\/return word.slice(0, word.length - 1)\n  \/\/return word + \"e\" if string isShort(word, startR1)\n}\n\nvoid Porter2Stemmer::internal::step1C(string & word)\n{\n    word = regex_replace(word, regex(\"(.+[^aeiouy])(y|Y)$\"), \"$1i\");\n}\n\nvoid Porter2Stemmer::internal::step2(string & word, int startR1)\n{\n  \/\/if word.search(\/ational$\/) >= startR1\n  \/\/return word.replace \/(\\w*)ational$\/, \"$1ate\"\n  \/\/if word.search(\/tional$\/) >= startR1\n  \/\/return word.replace \/(\\w*)tional$\/, \"$1tion\"\n  \/\/if word.search(\/ization$\/) >= startR1\n  \/\/return word.replace \/(\\w*)ization$\/, \"$1ize\"\n  \/\/if word.search(\/(ation|ator)$\/) >= startR1\n  \/\/return word.replace \/(\\w*)(ation|ator)$\/, \"$1ate\"\n  \/\/if word.search(\/(alism|aliti|alli)$\/) >= startR1\n  \/\/return word.replace \/(\\w*)(alism|aliti|alli)$\/, \"$1al\"\n  \/\/if word.search(\/enci$\/) >= startR1\n  \/\/return word.replace \/(\\w*)enci$\/, \"$1ence\"\n  \/\/if word.search(\/anci$\/) >= startR1\n  \/\/return word.replace \/(\\w*)anci$\/, \"$1ance\"\n  \/\/if word.search(\/abli$\/) >= startR1\n  \/\/return word.replace \/(\\w*)abli$\/, \"$1able\"\n  \/\/if word.search(\/entli$\/) >= startR1\n  \/\/return word.replace \/(\\w*)entli$\/, \"$1ent\"\n  \/\/if word.search(\/fulness$\/) >= startR1\n  \/\/return word.replace \/(\\w*)fulness$\/, \"$1ful\"\n  \/\/if word.search(\/(ousli|ousness)$\/) >= startR1\n  \/\/return word.replace \/(\\w*)(ousli|ousness)$\/, \"$1ous\"\n  \/\/if word.search(\/(iveness|iviti)$\/) >= startR1\n  \/\/return word.replace \/(\\w*)(iveness|iviti)$\/, \"$1ive\"\n  \/\/if word.search(\/(biliti|bli)$\/) >= startR1\n  \/\/return word.replace \/(\\w*)(biliti|bli)$\/, \"$1ble\"\n  \/\/if word.search(\/logi$\/) >= startR1\n  \/\/return word.replace \/(\\w*l)ogi$\/, \"$1og\"\n  \/\/if word.search(\/fulli$\/) >= startR1\n  \/\/return word.replace \/(\\w*)fulli$\/, \"$1ful\"\n  \/\/if word.search(\/lessli$\/) >= startR1\n  \/\/return word.replace \/(\\w*)lessli$\/, \"$1less\"\n  \/\/if word.search(\/[cdeghkmnrt]li$\/) >= startR1\n  \/\/return word.replace \/(\\w*)li$\/, \"$1\"\n}\n\nvoid Porter2Stemmer::internal::step3(string & word, int startR1, int startR2)\n{\n  \/\/if word.search(\/ational$\/) >= startR1\n  \/\/return word.replace \/(\\w*)ational$\/, \"$1ate\"\n  \/\/if word.search(\/tional$\/) >= startR1\n  \/\/return word.replace \/(\\w*)tional$\/, \"$1tion\"\n  \/\/if word.search(\/alize$\/) >= startR1\n  \/\/return word.replace \/(\\w*)alize$\/, \"$1al\"\n  \/\/if word.search(\/(icate|iciti|ical)$\/) >= startR1\n  \/\/return word.replace \/(\\w*)(icate|iciti|ical)$\/, \"$1ic\"\n  \/\/if word.search(\/(ful|ness)$\/) >= startR1\n  \/\/return word.replace \/(\\w*)(ful|ness)$\/, \"$1\"\n  \/\/if word.search(\/ative$\/) >= startR2\n  \/\/return word.replace \/(\\w*)ative$\/, \"$1\"\n}\n\nvoid Porter2Stemmer::internal::step4(string & word, int startR2)\n{\n  \/\/if word.search(\/ement$\/) >= startR2\n  \/\/return word.replace \/(\\w*)ement$\/, \"$1\"\n  \/\/if word.search(\/ment$\/) >= startR2\n  \/\/return word.replace \/(\\w*)ment$\/, \"$1\"\n  \/\/if word.search(\/(al|ance|ence|er|ic|able|ible|ant|ent|ism|ate|iti|ous|ive|ize)$\/) >= startR2\n  \/\/return word.replace \/(\\w*)(al|ance|ence|er|ic|able|ible|ant|ent|ism|ate|iti|ous|ive|ize)$\/, \"$1\"\n  \/\/if word.search(\/(s|t)ion$\/) >= startR2\n  \/\/return word.replace \/(\\w*)(s|t)ion$\/, \"$1\"\n}\n\nvoid Porter2Stemmer::internal::step5(string & word, int startR1, int startR2)\n{\n  \/\/if word.search(\/e$\/) >= startR2\n  \/\/return word.slice(0, word.length - 1)\n  \/\/if word.search(\/e$\/) >= startR1 and (not string isShort(word.match(\/(\\w*)e$\/)[1], startR1))\n  \/\/return word.slice(0, word.length - 1)\n  \/\/if word.search(\/ll$\/) >= startR2\n  \/\/return word.slice(0, word.length - 1)\n}\n\nbool Porter2Stemmer::internal::isShort(const string & word, int startR1)\n{\n    \/\/word.match(\/^([aeouiy][^aeouiy]|\\w*[^aeiouy][aeouiy][^aeouiyYwx])$\/) != null and startR1 >= word.length\n    return false;\n}\n<commit_msg>more work on stemmer (again)<commit_after>\/**\n * string file porter2_stemmer.cpp\n *\/\n\n#include <boost\/regex.hpp>\n#include \"porter2_stemmer.h\"\n\nusing namespace Porter2Stemmer::internal;\nusing std::string;\nusing boost::regex;\nusing boost::smatch;\n\n#include <iostream>\nusing std::cout;\nusing std::endl;\n\nstring Porter2Stemmer::stem(const string & toStem)\n{\n    string word = prepareWord(toStem);\n\n    if(returnImmediately(word))\n        return finalStem(word);\n\n    changeY(word);\n    int startR1 = getStartR1(word);\n    int startR2 = getStartR2(word, startR1);\n    removeApostrophe(word);\n    step1A(word);\n    step1B(word, startR1);\n    step1C(word);\n    step2(word, startR1);\n    step3(word, startR1, startR2);\n    step4(word, startR2);\n    step5(word, startR1, startR2);\n\n    return finalStem(word);\n}\n\nstring Porter2Stemmer::internal::finalStem(string & word)\n{\n    word = regex_replace(word, regex(\"Y\"), \"y\");\n    word = regex_replace(word, regex(\"'\"), \"\");\n    return word;\n}\n\nstring Porter2Stemmer::internal::prepareWord(const string & toStem)\n{\n    string word = \"\";\n    for(auto ch: toStem)\n    {\n        if(ch > 'A' && ch < 'Z')\n            ch += 32;\n        if((ch > 'a' && ch < 'z') || ch == '\\'')\n            word += ch;\n    }\n    return word;\n}\n\nbool Porter2Stemmer::internal::returnImmediately(const string & word)\n{\n    return word.size() <= 2;\n}\n\nint Porter2Stemmer::internal::getStartR1(const string & word)\n{\n    smatch results;\n    if(regex_search(word, results, regex(\"[aeiouy][^aeiouy]\")))\n        return results.position() + 2;\n    else\n        return word.size();\n}\n\nint Porter2Stemmer::internal::getStartR2(const string & word, int startR1)\n{\n    if(startR1 == word.size())\n        return startR1;\n\n    string split = word.substr(startR1, word.size() - startR1);\n\n    smatch results;\n    if(regex_search(split, results, regex(\"[aeiouy][^aeiouy]\")))\n        return results.position() + startR1 + 2;\n    else\n        return word.size();\n}\n\nvoid Porter2Stemmer::internal::changeY(string & word)\n{\n    if(word.find_first_of(\"y\") == string::npos)\n        return;\n\n    if(word[0] == 'y')\n        word[0] = 'Y';\n\n    word = regex_replace(word, regex(\"([aeiou])y\"), \"$1Y\");\n}\n\nvoid Porter2Stemmer::internal::removeApostrophe(string & word)\n{\n    smatch results;\n    word = regex_replace(word, regex(\"'s.*$\"), \"\");\n}\n\nvoid Porter2Stemmer::internal::step1A(string & word)\n{\n    smatch results;\n    if(regex_search(word, results, regex(\"sses$\")))\n        word = regex_replace(word, regex(\"(.*)sses$\"), \"$1ss\");\n    else if(regex_search(word, results, regex(\"(.+)(ied|ies)$\")))\n        word = regex_replace(word, regex(\"(.+)(ied|ies)$\"), \"$1i\");\n    else if(regex_search(word, results, regex(\"(.*)(ied|ies)$\")))\n        word = regex_replace(word, regex(\"(.*)(ied|ies)$\"), \"$1ie\");\n    else if(regex_search(word, results, regex(\"(u|s)s$\")))\n        return;\n    else if(regex_search(word, results, regex(\".*[aeiouy].+s$\")))\n        word = word.substr(0, word.size() - 1);\n}\n\nvoid Porter2Stemmer::internal::step1B(string & word, int startR1)\n{\n  \/\/if word.search(\/(eed|eedly)$\/) >= startR1\n  \/\/return word.replace(\/(\\w*)(eed|eedly)\/, \"$1ee\")\n  \/\/if word.match(\/\\w*?[aeiouy]\\w+(ed|edly|ing|ingly)$\/)\n  \/\/word = word.match(\/^(\\w*?[aeiouy]\\w+)(ed|edly|ing|ingly)$\/)[1]\n  \/\/return word + \"e\" if word.match(\/(at|bl|iz)$\/)\n  \/\/if word.match(\/(bb|dd|ff|gg|mm|nn|pp|rr|tt)$\/)\n  \/\/return word.slice(0, word.length - 1)\n  \/\/return word + \"e\" if string isShort(word, startR1)\n}\n\nvoid Porter2Stemmer::internal::step1C(string & word)\n{\n    word = regex_replace(word, regex(\"(.+[^aeiouy])(y|Y)$\"), \"$1i\");\n}\n\nvoid Porter2Stemmer::internal::step2(string & word, int startR1)\n{\n    smatch results;\n    if(regex_search(word, results, regex(\"ational$\")) && results.position() >= startR1)\n        word = regex_replace(word, regex(\"(.+)ational$\"), \"$1ate\");\n    else if(regex_search(word, results, regex(\"tional$\")) && results.position() >= startR1)\n        word = regex_replace(word, regex(\"(.+)tional$\"), \"$1tion\");\n    else if(regex_search(word, results, regex(\"ization$\")) && results.position() >= startR1)\n        word = regex_replace(word, regex(\"(.+)ization$\"), \"$1ize\");\n    else if(regex_search(word, results, regex(\"(.+)(ation|ator)$\")) && results.position() >= startR1)\n        word = regex_replace(word, regex(\"(.+)(ation|ator)$\"), \"$1ate\");\n    else if(regex_search(word, results, regex(\"(alism|aliti|alli)$\")) && results.position() >= startR1)\n        word = regex_replace(word, regex(\"(.+)(alism|aliti|alli)$\"), \"$1al\");\n    else if(regex_search(word, results, regex(\"enci$\")) && results.position() >= startR1)\n        word = regex_replace(word, regex(\"(.+)enci$\"), \"$1ence\");\n    else if(regex_search(word, results, regex(\"anci$\")) && results.position() >= startR1)\n        word = regex_replace(word, regex(\"(.+)anci$\"), \"$1ance\");\n    else if(regex_search(word, results, regex(\"abli$\")) && results.position() >= startR1)\n        word = regex_replace(word, regex(\"(.+)abli$\"), \"$1able\");\n    else if(regex_search(word, results, regex(\"entli$\")) && results.position() >= startR1)\n        word = regex_replace(word, regex(\"(.+)entli$\"), \"$1ent\");\n    else if(regex_search(word, results, regex(\"fulness$\")) && results.position() >= startR1)\n        word = regex_replace(word, regex(\"(.+)fulness$\"), \"$1ful\");\n    else if(regex_search(word, results, regex(\"(ousli|ousness)$\")) && results.position() >= startR1)\n        word = regex_replace(word, regex(\"(.+)(ousli|ousness)$\"), \"$1ous\");\n    else if(regex_search(word, results, regex(\"(iveness|iviti)$\")) && results.position() >= startR1)\n        word = regex_replace(word, regex(\"(.+)(iveness|iviti)$\"), \"$1ive\");\n    else if(regex_search(word, results, regex(\"(biliti|bli)$\")) && results.position() >= startR1)\n        word = regex_replace(word, regex(\"(.+)(biliti|bli)$\"), \"$1ble\");\n    else if(regex_search(word, results, regex(\"logi$\")) && results.position() >= startR1)\n        word = regex_replace(word, regex(\"(.*l)ogi$\"), \"$1og\");\n    else if(regex_search(word, results, regex(\"fulli$\")) && results.position() >= startR1)\n        word = regex_replace(word, regex(\"(.+)fulli$\"), \"$1ful\");\n    else if(regex_search(word, results, regex(\"lessli$\")) && results.position() >= startR1)\n        word = regex_replace(word, regex(\"(.+)(lessli)$\"), \"$1less\");\n    else if(regex_search(word, results, regex(\"[cdeghkmnrt]li$\")) && results.position() >= startR1)\n        word = regex_replace(word, regex(\"(.+)li$\"), \"$1\");\n}\n\nvoid Porter2Stemmer::internal::step3(string & word, int startR1, int startR2)\n{\n  \/\/if word.search(\/ational$\/) >= startR1\n  \/\/return word.replace \/(\\w*)ational$\/, \"$1ate\"\n  \/\/if word.search(\/tional$\/) >= startR1\n  \/\/return word.replace \/(\\w*)tional$\/, \"$1tion\"\n  \/\/if word.search(\/alize$\/) >= startR1\n  \/\/return word.replace \/(\\w*)alize$\/, \"$1al\"\n  \/\/if word.search(\/(icate|iciti|ical)$\/) >= startR1\n  \/\/return word.replace \/(\\w*)(icate|iciti|ical)$\/, \"$1ic\"\n  \/\/if word.search(\/(ful|ness)$\/) >= startR1\n  \/\/return word.replace \/(\\w*)(ful|ness)$\/, \"$1\"\n  \/\/if word.search(\/ative$\/) >= startR2\n  \/\/return word.replace \/(\\w*)ative$\/, \"$1\"\n}\n\nvoid Porter2Stemmer::internal::step4(string & word, int startR2)\n{\n  \/\/if word.search(\/ement$\/) >= startR2\n  \/\/return word.replace \/(\\w*)ement$\/, \"$1\"\n  \/\/if word.search(\/ment$\/) >= startR2\n  \/\/return word.replace \/(\\w*)ment$\/, \"$1\"\n  \/\/if word.search(\/(al|ance|ence|er|ic|able|ible|ant|ent|ism|ate|iti|ous|ive|ize)$\/) >= startR2\n  \/\/return word.replace \/(\\w*)(al|ance|ence|er|ic|able|ible|ant|ent|ism|ate|iti|ous|ive|ize)$\/, \"$1\"\n  \/\/if word.search(\/(s|t)ion$\/) >= startR2\n  \/\/return word.replace \/(\\w*)(s|t)ion$\/, \"$1\"\n}\n\nvoid Porter2Stemmer::internal::step5(string & word, int startR1, int startR2)\n{\n  \/\/if word.search(\/e$\/) >= startR2\n  \/\/return word.slice(0, word.length - 1)\n  \/\/if word.search(\/e$\/) >= startR1 and (not string isShort(word.match(\/(\\w*)e$\/)[1], startR1))\n  \/\/return word.slice(0, word.length - 1)\n  \/\/if word.search(\/ll$\/) >= startR2\n  \/\/return word.slice(0, word.length - 1)\n}\n\nbool Porter2Stemmer::internal::isShort(const string & word, int startR1)\n{\n    \/\/word.match(\/^([aeouiy][^aeouiy]|\\w*[^aeiouy][aeouiy][^aeouiyYwx])$\/) != null and startR1 >= word.length\n    return false;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n *\n *   Copyright (c) 2015 Mark Charlebois. All 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 px4_posix_impl.cpp\n *\n * PX4 Middleware Wrapper Linux Implementation\n *\/\n\n#include <px4_defines.h>\n#include <px4_middleware.h>\n#include <px4_workqueue.h>\n#include <stdint.h>\n#include <stdio.h>\n#include <signal.h>\n#include <errno.h>\n#include <unistd.h>\n#include \"systemlib\/param\/param.h\"\n#include \"hrt_work.h\"\n#include <drivers\/drv_hrt.h>\n#include \"px4_time.h\"\n\nextern pthread_t _shell_task_id;\n\n__BEGIN_DECLS\n\nlong PX4_TICKS_PER_SEC = sysconf(_SC_CLK_TCK);\n\n__END_DECLS\n\nnamespace px4\n{\n\nvoid init_once(void);\n\nvoid init_once(void)\n{\n\t_shell_task_id = pthread_self();\n\tprintf(\"[init] shell id: %lu\\n\", (unsigned long)_shell_task_id);\n\twork_queues_init();\n\thrt_work_queue_init();\n\thrt_init();\n}\n\nvoid init(int argc, char *argv[], const char *app_name)\n{\n\tprintf(\"[init] task name: %s\\n\", app_name);\n\tprintf(\"\\n\");\n\tprintf(\"______  __   __    ___ \\n\");\n\tprintf(\"| ___ \\\\ \\\\ \\\\ \/ \/   \/   |\\n\");\n\tprintf(\"| |_\/ \/  \\\\ V \/   \/ \/| |\\n\");\n\tprintf(\"|  __\/   \/   \\\\  \/ \/_| |\\n\");\n\tprintf(\"| |     \/ \/^\\\\ \\\\ \\\\___  |\\n\");\n\tprintf(\"\\\\_|     \\\\\/   \\\\\/     |_\/\\n\");\n\tprintf(\"\\n\");\n\tprintf(\"Ready to fly.\\n\");\n\tprintf(\"\\n\");\n\tprintf(\"\\n\");\n}\n\nuint64_t get_time_micros()\n{\n\treturn hrt_absolute_time();\n}\n\n}\n\n<commit_msg>Main app: set thread name<commit_after>\/****************************************************************************\n *\n *   Copyright (c) 2015 Mark Charlebois. All 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 px4_posix_impl.cpp\n *\n * PX4 Middleware Wrapper Linux Implementation\n *\/\n\n#include <px4_defines.h>\n#include <px4_middleware.h>\n#include <px4_workqueue.h>\n#include <stdint.h>\n#include <stdio.h>\n#include <signal.h>\n#include <errno.h>\n#include <unistd.h>\n#include \"systemlib\/param\/param.h\"\n#include \"hrt_work.h\"\n#include <drivers\/drv_hrt.h>\n#include \"px4_time.h\"\n#include <pthread.h>\n\nextern pthread_t _shell_task_id;\n\n__BEGIN_DECLS\n\nlong PX4_TICKS_PER_SEC = sysconf(_SC_CLK_TCK);\n\n__END_DECLS\n\nnamespace px4\n{\n\nvoid init_once(void);\n\nvoid init_once(void)\n{\n\t_shell_task_id = pthread_self();\n\tprintf(\"[init] shell id: %lu\\n\", (unsigned long)_shell_task_id);\n\twork_queues_init();\n\thrt_work_queue_init();\n\thrt_init();\n}\n\nvoid init(int argc, char *argv[], const char *app_name)\n{\n\tprintf(\"[init] task name: %s\\n\", app_name);\n\tprintf(\"\\n\");\n\tprintf(\"______  __   __    ___ \\n\");\n\tprintf(\"| ___ \\\\ \\\\ \\\\ \/ \/   \/   |\\n\");\n\tprintf(\"| |_\/ \/  \\\\ V \/   \/ \/| |\\n\");\n\tprintf(\"|  __\/   \/   \\\\  \/ \/_| |\\n\");\n\tprintf(\"| |     \/ \/^\\\\ \\\\ \\\\___  |\\n\");\n\tprintf(\"\\\\_|     \\\\\/   \\\\\/     |_\/\\n\");\n\tprintf(\"\\n\");\n\tprintf(\"Ready to fly.\\n\");\n\tprintf(\"\\n\");\n\tprintf(\"\\n\");\n\n\t\/\/ set the threads name\n\t#ifdef __PX4_DARWIN\n\t(void)pthread_setname_np(app_name);\n\t#else\n\t(void)pthread_setname_np(pthread_self(), app_name);\n\t#endif\n}\n\nuint64_t get_time_micros()\n{\n\treturn hrt_absolute_time();\n}\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2015 Las Venturas Playground. All rights reserved.\n\/\/ Use of this source code is governed by the MIT license, a copy of which can\n\/\/ be found in the LICENSE file.\n\n#include \"plugin\/native_function_manager.h\"\n\n#include <set>\n#include <string.h>\n\n#include \"base\/logging.h\"\n#include \"plugin\/fake_amx.h\"\n#include \"plugin\/sdk\/amx.h\"\n#include \"plugin\/sdk\/plugincommon.h\"\n#include \"third_party\/subhook\/subhook.h\"\n\nnamespace plugin {\n\nnamespace {\n\nconst std::set<std::string> kDynamicEntityFunctions{\n  \"CreateDynamic3DTextLabelEx\",\n  \"CreateDynamicActorEx\",\n  \"CreateDynamicCPEx\",\n  \"CreateDynamicMapIconEx\",\n  \"CreateDynamicObjectEx\",\n  \"CreateDynamicPickupEx\",\n  \"CreateDynamicRaceCPEx\"\n};\n\nconst std::set<std::string> kDynamicAreaFunctions{\n  \"CreateDynamicCircleEx\",\n  \"CreateDynamicCubeEx\",\n  \"CreateDynamicCuboidEx\",\n  \"CreateDynamicCylinderEx\",\n  \"CreateDynamicPolygonEx\",\n  \"CreateDynamicRectangleEx\",\n  \"CreateDynamicSphereEx\"\n};\n\n\/\/ The Incognito streamer unfortunately derives from the [array][array_size] parameters being right\n\/\/ next to each other-paradigm, so we need to special case those.\nsize_t GetArraySizeOffsetForFunctionName(const std::string& function_name) {\n  if (function_name.rfind(\"CreateDynamic\") != 0)\n    return 1;\n\n  if (kDynamicEntityFunctions.find(function_name) != kDynamicEntityFunctions.end())\n    return 5;\n\n  if (kDynamicAreaFunctions.find(function_name) != kDynamicAreaFunctions.end())\n    return 4;\n\n  return 1;\n}\n\n\/\/ Type definition of the original amx_Register_t function that is being intercepted.\ntypedef int AMXAPI(*amx_Register_t)(AMX* amx, const AMX_NATIVE_INFO* nativelist, int number);\n\n\/\/ Global instance of the NativeFunctionManager instance, only to be used by amx_Register_hook().\nNativeFunctionManager* g_native_function_manager = nullptr;\n\nint amx_Register_hook(AMX* amx, const AMX_NATIVE_INFO* nativelist, int number) {\n  return g_native_function_manager->OnRegister(amx, nativelist, number);\n}\n\n}  \/\/ namespace\n\nNativeFunctionManager::NativeFunctionManager()\n    : fake_amx_(new FakeAMX) {\n  g_native_function_manager = this;\n}\n\nNativeFunctionManager::~NativeFunctionManager() {\n  g_native_function_manager = nullptr;\n}\n\nbool NativeFunctionManager::Install() {\n  if (!pAMXFunctions)\n    return true;  \/\/ testing\n\n  void* current_address = static_cast<void**>(pAMXFunctions)[PLUGIN_AMX_EXPORT_Register];\n  if (current_address == nullptr) {\n    LOG(ERROR) << \"Invalid address found for the amx_Register() function.\";\n    return false;\n  }\n\n  hook_.reset(new SubHook(current_address, (void*) amx_Register_hook));\n  if (!hook_->Install()) {\n    LOG(ERROR) << \"Unable to install a SubHook for the amx_Register() function.\";\n    return false;\n  }\n\n  return true;\n}\n\nint NativeFunctionManager::OnRegister(AMX* amx, const AMX_NATIVE_INFO* nativelist, int number) {\n  if (nativelist != nullptr) {\n    for (size_t index = 0; ; ++index) {\n      if (number > 0 && static_cast<int>(index) >= number)\n        break;\n\n      if (nativelist[index].func == nullptr || nativelist[index].name == nullptr)\n        break;\n\n      const std::string native_name(nativelist[index].name);\n\n      \/\/ The Pawn interpreter iterates over unresolved functions in the gamemode, and finds them in\n      \/\/ the functions that are being registered in the amx_Register() call. This means that the first\n      \/\/ function registered for a given name will be used, rather than having later registrations\n      \/\/ override previous ones. Simply drop out if a double-registration is observed.\n      if (!FunctionExists(native_name))\n        native_functions_[native_name] = static_cast<NativeFn*>(nativelist[index].func);\n    }\n  }\n\n  \/\/ Trampoline back to the original amx_Register function that we intercepted.\n  return ((amx_Register_t) hook_->GetTrampoline())(amx, nativelist, number);\n}\n\nbool NativeFunctionManager::FunctionExists(const std::string& function_name) const {\n  return native_functions_.find(function_name) != native_functions_.end();\n}\n\nint NativeFunctionManager::CallFunction(const std::string& function_name,\n                                        const char* format, void** arguments) {\n  auto function_iter = native_functions_.find(function_name);\n  if (function_iter == native_functions_.end()) {\n    LOG(WARNING) << \"Attempting to invoke unknown Pawn native \" << function_name << \". Ignoring.\";\n    return -1;\n  }\n\n  AMX* amx = fake_amx_->amx();\n\n  size_t param_count = format ? strlen(format) : 0;\n\n  params_.resize(param_count + 1);\n  params_[0] = param_count * sizeof(cell);\n\n  \/\/ Early-return if there are no arguments required for this native invication.\n  if (!param_count)\n    return function_iter->second(amx, params_.data());\n\n  size_t arraySizeParamOffset = GetArraySizeOffsetForFunctionName(function_name);\n\n  auto amx_stack = fake_amx_->GetScopedStackModifier();\n  DCHECK(arguments);\n\n  \/\/ Process the existing parameters, either store them in |params_| or push them on the stack.\n  for (size_t i = 0; i < param_count; ++i) {\n    switch (format[i]) {\n    case 'i':\n      params_[i + 1] = *reinterpret_cast<cell*>(arguments[i]);\n      break;\n    case 'f':\n      params_[i + 1] = amx_ftoc(*reinterpret_cast<float*>(arguments[i]));\n      break;\n    case 'r':\n      params_[i + 1] = amx_stack.PushCell(*reinterpret_cast<cell*>(arguments[i]));\n      break;\n    case 's':\n      params_[i + 1] = amx_stack.PushString(reinterpret_cast<char*>(arguments[i]));\n      break;\n    case 'a':\n      if (format[i + arraySizeParamOffset] != 'i') {\n        LOG(WARNING) << \"Cannot invoke \" << function_name << \": 'a' parameter must be followed by a 'i'.\";\n        return -1;\n      }\n\n      {\n        int32_t size = *reinterpret_cast<int32_t*>(arguments[i + arraySizeParamOffset]);\n\n        params_[i + 1] = amx_stack.PushArray(reinterpret_cast<cell*>(arguments[i]), size);\n        if (arraySizeParamOffset == 1)\n          params_[i + 1 + arraySizeParamOffset] = size;\n      }\n\n      if (arraySizeParamOffset == 1)\n        ++i;\n\n      break;\n    }\n  }\n\n  const int return_value = function_iter->second(amx, params_.data());\n\n  \/\/ Read back the values which may have been modified by the SA-MP server.\n  for (size_t i = 0; i < param_count; ++i) {\n    switch (format[i]) {\n    case 'r':\n      amx_stack.ReadCell(params_[i + 1], reinterpret_cast<cell*>(arguments[i]));\n      break;\n    case 'a':\n      {\n        char* data = reinterpret_cast<char*>(arguments[i]);\n        int32_t size = *reinterpret_cast<int32_t*>(arguments[i + arraySizeParamOffset]);\n\n        amx_stack.ReadArray(params_[i + 1], data, size);\n      }\n      break;\n    }\n  }\n\n  return return_value;\n}\n\n}  \/\/ namespace plugin\n<commit_msg>Special-case CreateDynamicPolygonEx even more<commit_after>\/\/ Copyright 2015 Las Venturas Playground. All rights reserved.\n\/\/ Use of this source code is governed by the MIT license, a copy of which can\n\/\/ be found in the LICENSE file.\n\n#include \"plugin\/native_function_manager.h\"\n\n#include <set>\n#include <string.h>\n\n#include \"base\/logging.h\"\n#include \"plugin\/fake_amx.h\"\n#include \"plugin\/sdk\/amx.h\"\n#include \"plugin\/sdk\/plugincommon.h\"\n#include \"third_party\/subhook\/subhook.h\"\n\nnamespace plugin {\n\nnamespace {\n\nconst std::set<std::string> kDynamicEntityFunctions{\n  \"CreateDynamic3DTextLabelEx\",\n  \"CreateDynamicActorEx\",\n  \"CreateDynamicCPEx\",\n  \"CreateDynamicMapIconEx\",\n  \"CreateDynamicObjectEx\",\n  \"CreateDynamicPickupEx\",\n  \"CreateDynamicRaceCPEx\"\n};\n\nconst std::set<std::string> kDynamicAreaFunctions{\n  \"CreateDynamicCircleEx\",\n  \"CreateDynamicCubeEx\",\n  \"CreateDynamicCuboidEx\",\n  \"CreateDynamicCylinderEx\",\n  \"CreateDynamicRectangleEx\",\n  \"CreateDynamicSphereEx\"\n};\n\n\/\/ The Incognito streamer unfortunately derives from the [array][array_size] parameters being right\n\/\/ next to each other-paradigm, so we need to special case those.\nsize_t GetArraySizeOffsetForFunctionName(const std::string& function_name) {\n  if (function_name.rfind(\"CreateDynamic\") != 0)\n    return 1;\n\n  if (kDynamicEntityFunctions.find(function_name) != kDynamicEntityFunctions.end())\n    return 5;\n\n  if (kDynamicAreaFunctions.find(function_name) != kDynamicAreaFunctions.end())\n    return 4;\n\n  return 1;\n}\n\n\/\/ Type definition of the original amx_Register_t function that is being intercepted.\ntypedef int AMXAPI(*amx_Register_t)(AMX* amx, const AMX_NATIVE_INFO* nativelist, int number);\n\n\/\/ Global instance of the NativeFunctionManager instance, only to be used by amx_Register_hook().\nNativeFunctionManager* g_native_function_manager = nullptr;\n\nint amx_Register_hook(AMX* amx, const AMX_NATIVE_INFO* nativelist, int number) {\n  return g_native_function_manager->OnRegister(amx, nativelist, number);\n}\n\n}  \/\/ namespace\n\nNativeFunctionManager::NativeFunctionManager()\n    : fake_amx_(new FakeAMX) {\n  g_native_function_manager = this;\n}\n\nNativeFunctionManager::~NativeFunctionManager() {\n  g_native_function_manager = nullptr;\n}\n\nbool NativeFunctionManager::Install() {\n  if (!pAMXFunctions)\n    return true;  \/\/ testing\n\n  void* current_address = static_cast<void**>(pAMXFunctions)[PLUGIN_AMX_EXPORT_Register];\n  if (current_address == nullptr) {\n    LOG(ERROR) << \"Invalid address found for the amx_Register() function.\";\n    return false;\n  }\n\n  hook_.reset(new SubHook(current_address, (void*) amx_Register_hook));\n  if (!hook_->Install()) {\n    LOG(ERROR) << \"Unable to install a SubHook for the amx_Register() function.\";\n    return false;\n  }\n\n  return true;\n}\n\nint NativeFunctionManager::OnRegister(AMX* amx, const AMX_NATIVE_INFO* nativelist, int number) {\n  if (nativelist != nullptr) {\n    for (size_t index = 0; ; ++index) {\n      if (number > 0 && static_cast<int>(index) >= number)\n        break;\n\n      if (nativelist[index].func == nullptr || nativelist[index].name == nullptr)\n        break;\n\n      const std::string native_name(nativelist[index].name);\n\n      \/\/ The Pawn interpreter iterates over unresolved functions in the gamemode, and finds them in\n      \/\/ the functions that are being registered in the amx_Register() call. This means that the first\n      \/\/ function registered for a given name will be used, rather than having later registrations\n      \/\/ override previous ones. Simply drop out if a double-registration is observed.\n      if (!FunctionExists(native_name))\n        native_functions_[native_name] = static_cast<NativeFn*>(nativelist[index].func);\n    }\n  }\n\n  \/\/ Trampoline back to the original amx_Register function that we intercepted.\n  return ((amx_Register_t) hook_->GetTrampoline())(amx, nativelist, number);\n}\n\nbool NativeFunctionManager::FunctionExists(const std::string& function_name) const {\n  return native_functions_.find(function_name) != native_functions_.end();\n}\n\nint NativeFunctionManager::CallFunction(const std::string& function_name,\n                                        const char* format, void** arguments) {\n  auto function_iter = native_functions_.find(function_name);\n  if (function_iter == native_functions_.end()) {\n    LOG(WARNING) << \"Attempting to invoke unknown Pawn native \" << function_name << \". Ignoring.\";\n    return -1;\n  }\n\n  AMX* amx = fake_amx_->amx();\n\n  size_t param_count = format ? strlen(format) : 0;\n\n  params_.resize(param_count + 1);\n  params_[0] = param_count * sizeof(cell);\n\n  \/\/ Early-return if there are no arguments required for this native invication.\n  if (!param_count)\n    return function_iter->second(amx, params_.data());\n\n  bool isCreateDynamicPolygonEx = function_name == \"CreateDynamicPolygonEx\";\n  size_t arraySizeParamOffset = GetArraySizeOffsetForFunctionName(function_name);\n\n  auto amx_stack = fake_amx_->GetScopedStackModifier();\n  DCHECK(arguments);\n\n  \/\/ Process the existing parameters, either store them in |params_| or push them on the stack.\n  for (size_t i = 0; i < param_count; ++i) {\n    switch (format[i]) {\n    case 'i':\n      params_[i + 1] = *reinterpret_cast<cell*>(arguments[i]);\n      break;\n    case 'f':\n      params_[i + 1] = amx_ftoc(*reinterpret_cast<float*>(arguments[i]));\n      break;\n    case 'r':\n      params_[i + 1] = amx_stack.PushCell(*reinterpret_cast<cell*>(arguments[i]));\n      break;\n    case 's':\n      params_[i + 1] = amx_stack.PushString(reinterpret_cast<char*>(arguments[i]));\n      break;\n    case 'a':\n      if (isCreateDynamicPolygonEx) {\n        if (i == 0 \/* points *\/)\n          arraySizeParamOffset = 3;\n        else\n          arraySizeParamOffset = 4;\n      }\n\n      if (format[i + arraySizeParamOffset] != 'i') {\n        LOG(WARNING) << \"Cannot invoke \" << function_name << \": 'a' parameter must be followed by a 'i'.\";\n        return -1;\n      }\n\n      {\n        int32_t size = *reinterpret_cast<int32_t*>(arguments[i + arraySizeParamOffset]);\n\n        params_[i + 1] = amx_stack.PushArray(reinterpret_cast<cell*>(arguments[i]), size);\n        if (arraySizeParamOffset == 1)\n          params_[i + 1 + arraySizeParamOffset] = size;\n      }\n\n      if (arraySizeParamOffset == 1)\n        ++i;\n\n      break;\n    }\n  }\n\n  const int return_value = function_iter->second(amx, params_.data());\n\n  \/\/ Read back the values which may have been modified by the SA-MP server.\n  for (size_t i = 0; i < param_count; ++i) {\n    switch (format[i]) {\n    case 'r':\n      amx_stack.ReadCell(params_[i + 1], reinterpret_cast<cell*>(arguments[i]));\n      break;\n    case 'a':\n      {\n        char* data = reinterpret_cast<char*>(arguments[i]);\n        int32_t size = *reinterpret_cast<int32_t*>(arguments[i + arraySizeParamOffset]);\n\n        amx_stack.ReadArray(params_[i + 1], data, size);\n      }\n      break;\n    }\n  }\n\n  return return_value;\n}\n\n}  \/\/ namespace plugin\n<|endoftext|>"}
{"text":"<commit_before>\/**\n Problema: wow\n Solutie: Algoritmul lui Lee pentru fiecare punct de plecare. Suma de distanta.\n Autor: Robert Hasna\n *\/\n#include <cstdio>\n#include <vector>\n#include <utility>\n#include <queue>\n\nusing namespace std;\n\ntypedef pair<int,int> Punct;\n\nstatic const int NMAX = 100;\nstatic const int dx[] = { 0, 1, 0, -1 };\nstatic const int dy[] = { 1, 0, -1, 0 };\n\nint N, M; \/\/ Latura labirintului\nint nr_pers; \/\/ Numarul de persoane\nint labirint[ NMAX ][ NMAX ]; \/\/ Labirintul\nint drumuri[ NMAX ][ NMAX ]; \/\/ Suma drumurilor\nint vizitat[ NMAX ][ NMAX ]; \/\/ Matrice de locuri vizitate, pentru Lee\nint vizitatTotal[ NMAX ][ NMAX ]; \/\/ Matrice in care stochez de cate ori a fost vizitat un punct in total.\nvector< Punct > oameni;\nqueue< pair<Punct,int> > Q; \/\/ Coada pentru Lee. Punctul vizitat si costul de a ajunge la el\n\n\/\/ Curata matricea de vizite. Pregatire pentru urmatoarea rulare a algoritmului lui lee.\nvoid stergeVizite() {\n    for (int i = 0; i < N; ++i) {\n        for (int j = 0; j < M; ++j) {\n            vizitat[i][j] = 0;\n        }\n    }\n}\n\n\/\/ Verifica daca un punct este in interiorul labirintului\ninline bool inLabirint(Punct punct) {\n    return !(punct.first < 0 || punct.first >= N || punct.second < 0 || punct.second >= M);\n}\n\n\/\/ Face un pas in algoritmul lui Lee. Primeste un puct si viziteaza toate cele 4 puncte adiacente.\ninline void pas(Punct punct, int cost) {\n    for (int i = 0; i < 4; ++i) {\n        Punct punctNou = make_pair(punct.first + dx[i], punct.second + dy[i]);\n        if (inLabirint(punctNou) && !vizitat[punctNou.first][punctNou.second] && labirint[punctNou.first][punctNou.second] == 0) {\n            vizitat[punctNou.first][punctNou.second] = 1;\n            vizitatTotal[punctNou.first][punctNou.second]++;\n            drumuri[punctNou.first][punctNou.second]+= cost + 1;\n            Q.push(make_pair(punctNou, cost + 1));\n        }\n    }\n}\n\n\/\/ Algoritmul lui lee\nvoid lee(Punct start) {\n    stergeVizite();\n    while(!Q.empty()) {\n        Q.pop();\n    }\n    Q.push(make_pair(start, 0));\n    vizitat[start.first][start.second] = 1;\n    vizitatTotal[start.first][start.second]++;\n\n    while (!Q.empty()) {\n        pair< Punct, int > q = Q.front();\n        Q.pop();\n        pas(q.first, q.second);\n    }\n}\n\nint main() {\n    freopen(\"wow.in\", \"r\", stdin);\n    freopen(\"wow.out\", \"w\", stdout);\n\n    \/\/ Citirea datelor\n    scanf(\"%d %d\\n\", &N, &M, &nr_pers);\n    for (int i = 0; i < N; ++i) {\n        for (int j = 0; j < M; ++j) {\n            scanf(\"%d\", &labirint[i][j]);\n        }\n    }\n\n    for (int i = 0; i < nr_pers; ++i) {\n        int x, y;\n        scanf(\"%d %d\", &x, &y);\n        oameni.push_back(make_pair(x, y));\n    }\n\n    \/\/ Rularea algoritmului lui Lee pentru fiecare om din labirint\n    for (vector<Punct>::iterator it = oameni.begin(); it != oameni.end(); it++) {\n        lee(*it);\n    }\n\n    \/\/ Extragerea rezultatului\n    int minim = -1;\n    Punct loculIntalnirii;\n    for (int i = 0; i < N; ++i) {\n        for (int j = 0; j < M; ++j) {          \n            if (labirint[i][j] == 0 && vizitatTotal[i][j] == nr_pers && (drumuri[i][j] < minim || minim == -1)) {\n                minim = drumuri[i][j];\n                loculIntalnirii = make_pair(i, j);\n            }\n        }\n    }\n\n    \/\/ Afisarea rezultatului\n    printf(\"%d\\n%d %d\\n\", minim, loculIntalnirii.first, loculIntalnirii.second);\n    \n    return 0;\n}\n<commit_msg>fixed wow<commit_after>\/**\n Problema: wow\n Solutie: Algoritmul lui Lee pentru fiecare punct de plecare. Suma de distanta.\n Autor: Robert Hasna\n *\/\n#include <cstdio>\n#include <vector>\n#include <utility>\n#include <queue>\n\nusing namespace std;\n\ntypedef pair<int,int> Punct;\n\nstatic const int NMAX = 100;\nstatic const int dx[] = { 0, 1, 0, -1 };\nstatic const int dy[] = { 1, 0, -1, 0 };\n\nint N, M; \/\/ Latura labirintului\nint nr_pers; \/\/ Numarul de persoane\nint labirint[ NMAX ][ NMAX ]; \/\/ Labirintul\nint drumuri[ NMAX ][ NMAX ]; \/\/ Suma drumurilor\nint vizitat[ NMAX ][ NMAX ]; \/\/ Matrice de locuri vizitate, pentru Lee\nint vizitatTotal[ NMAX ][ NMAX ]; \/\/ Matrice in care stochez de cate ori a fost vizitat un punct in total.\nvector< Punct > oameni;\nqueue< pair<Punct,int> > Q; \/\/ Coada pentru Lee. Punctul vizitat si costul de a ajunge la el\n\n\/\/ Curata matricea de vizite. Pregatire pentru urmatoarea rulare a algoritmului lui lee.\nvoid stergeVizite() {\n    for (int i = 0; i < N; ++i) {\n        for (int j = 0; j < M; ++j) {\n            vizitat[i][j] = 0;\n        }\n    }\n}\n\n\/\/ Verifica daca un punct este in interiorul labirintului\ninline bool inLabirint(Punct punct) {\n    return !(punct.first < 0 || punct.first >= N || punct.second < 0 || punct.second >= M);\n}\n\n\/\/ Face un pas in algoritmul lui Lee. Primeste un puct si viziteaza toate cele 4 puncte adiacente.\ninline void pas(Punct punct, int cost) {\n    for (int i = 0; i < 4; ++i) {\n        Punct punctNou = make_pair(punct.first + dx[i], punct.second + dy[i]);\n        if (inLabirint(punctNou) && !vizitat[punctNou.first][punctNou.second] && labirint[punctNou.first][punctNou.second] == 0) {\n            vizitat[punctNou.first][punctNou.second] = 1;\n            vizitatTotal[punctNou.first][punctNou.second]++;\n            drumuri[punctNou.first][punctNou.second]+= cost + 1;\n            Q.push(make_pair(punctNou, cost + 1));\n        }\n    }\n}\n\n\/\/ Algoritmul lui lee\nvoid lee(Punct start) {\n    stergeVizite();\n    while(!Q.empty()) {\n        Q.pop();\n    }\n    Q.push(make_pair(start, 0));\n    vizitat[start.first][start.second] = 1;\n    vizitatTotal[start.first][start.second]++;\n\n    while (!Q.empty()) {\n        pair< Punct, int > q = Q.front();\n        Q.pop();\n        pas(q.first, q.second);\n    }\n}\n\nint main() {\n    freopen(\"wow.in\", \"r\", stdin);\n    freopen(\"wow.out\", \"w\", stdout);\n\n    \/\/ Citirea datelor\n    scanf(\"%d %d %d\\n\", &N, &M, &nr_pers);\n    for (int i = 0; i < N; ++i) {\n        for (int j = 0; j < M; ++j) {\n            scanf(\"%d\", &labirint[i][j]);\n        }\n    }\n\n    for (int i = 0; i < nr_pers; ++i) {\n        int x, y;\n        scanf(\"%d %d\", &x, &y);\n        oameni.push_back(make_pair(x, y));\n    }\n\n    \/\/ Rularea algoritmului lui Lee pentru fiecare om din labirint\n    for (vector<Punct>::iterator it = oameni.begin(); it != oameni.end(); it++) {\n        lee(*it);\n    }\n\n    \/\/ Extragerea rezultatului\n    int minim = -1;\n    Punct loculIntalnirii;\n    for (int i = 0; i < N; ++i) {\n        for (int j = 0; j < M; ++j) {\n            if (labirint[i][j] == 0 && vizitatTotal[i][j] == nr_pers && (drumuri[i][j] < minim || minim == -1)) {\n                minim = drumuri[i][j];\n                loculIntalnirii = make_pair(i, j);\n            }\n        }\n    }\n\n    \/\/ Afisarea rezultatului\n    printf(\"%d\\n%d %d\\n\", minim, loculIntalnirii.first, loculIntalnirii.second);\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>GLES2: prevent crash on shutdown<commit_after><|endoftext|>"}
{"text":"<commit_before>\/***********************************************************************\n simple2.cpp - Example showing how to use the 'use' method of retrieving\n\ta table, as opposed to the more common 'store' method.\n\n Copyright (c) 2005 by Educational Technology Resources, Inc.\n Others may also hold copyrights on code in this file.  See the CREDITS\n file 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 \"util.h\"\n\n#include <mysql++.h>\n\nint\nmain(int argc, char *argv[])\n{\n\t\/\/ Connect to the sample database\n\tmysqlpp::Connection con;\n\tmysqlpp::NoExceptions ne(con);\n\tif (!connect_to_db(argc, argv, con)) {\n\t\treturn 1;\n\t}\n\n\t\/\/ Retrieve the entire stock table\n\tmysqlpp::Query query = con.query();\n\tquery << \"select * from stock\";\n\n\t\/\/ Execute the query, but don't save results in memory\n\tmysqlpp::ResUse res = query.use();\n\n\t\/\/ Iterate through result set, printing each row\n\tmysqlpp::Row r;\n\twhile (r = res.fetch_row()) {\n\t\tprint_stock_row(r[0], r[1], r[2], r[3], r[4]);\n\t}\n\n\treturn 0;\n}\n<commit_msg>simple2 example now handles empty result sets correctly.<commit_after>\/***********************************************************************\n simple2.cpp - Example showing how to use the 'use' method of retrieving\n\ta table, as opposed to the more common 'store' method.\n\n Copyright (c) 2005 by Educational Technology Resources, Inc.\n Others may also hold copyrights on code in this file.  See the CREDITS\n file 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 \"util.h\"\n\n#include <mysql++.h>\n\n#include <iostream>\n\nint\nmain(int argc, char *argv[])\n{\n\t\/\/ Connect to the sample database\n\tmysqlpp::Connection con;\n\tmysqlpp::NoExceptions ne(con);\n\tif (!connect_to_db(argc, argv, con)) {\n\t\treturn 1;\n\t}\n\n\t\/\/ Retrieve the entire stock table\n\tmysqlpp::Query query = con.query();\n\tquery << \"select * from stock\";\n\n\t\/\/ Execute the query, but don't save results in memory\n\tmysqlpp::ResUse res = query.use();\n\tif (!res) {\n\t\tstd::cerr << \"Result set is empty!\" << std::endl;\n\t\treturn 1;\n\t}\n\n\t\/\/ Iterate through result set, printing each row\n\tmysqlpp::Row r;\n\twhile (r = res.fetch_row()) {\n\t\tprint_stock_row(r[0], r[1], r[2], r[3], r[4]);\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- Error.cpp - system_error extensions for Object -----------*- C++ -*-===\/\/\n\/\/\n\/\/                     The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This defines a new error_category for the Object library.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Object\/Error.h\"\n#include \"llvm\/Support\/ErrorHandling.h\"\n\nusing namespace llvm;\nusing namespace object;\n\nnamespace {\nclass _object_error_category : public std::error_category {\npublic:\n  const char* name() const LLVM_NOEXCEPT override;\n  std::string message(int ev) const override;\n};\n}\n\nconst char *_object_error_category::name() const {\n  return \"llvm.object\";\n}\n\nstd::string _object_error_category::message(int EV) const {\n  object_error E = static_cast<object_error>(EV);\n  switch (E) {\n  case object_error::success: return \"Success\";\n  case object_error::arch_not_found:\n    return \"No object file for requested architecture\";\n  case object_error::invalid_file_type:\n    return \"The file was not recognized as a valid object file\";\n  case object_error::parse_failed:\n    return \"Invalid data was encountered while parsing the file\";\n  case object_error::unexpected_eof:\n    return \"The end of the file was unexpectedly encountered\";\n  }\n  llvm_unreachable(\"An enumerator of object_error does not have a message \"\n                   \"defined.\");\n}\n\nconst std::error_category &object::object_category() {\n  static _object_error_category o;\n  return o;\n}\n<commit_msg>Some work on upgrading LLVM (incl. Clang) from version 3.4.2 to version 3.5 (#460) [ci skip].<commit_after>\/\/===- Error.cpp - system_error extensions for Object -----------*- C++ -*-===\/\/\n\/\/\n\/\/                     The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This defines a new error_category for the Object library.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Object\/Error.h\"\n#include \"llvm\/Support\/ErrorHandling.h\"\n\nusing namespace llvm;\nusing namespace object;\n\nnamespace {\nclass _object_error_category : public std::error_category {\npublic:\n  const char* name() const LLVM_NOEXCEPT override;\n  std::string message(int ev) const override;\n};\n}\n\n\/*---OPENCOR---\nconst char *_object_error_category::name() const {\n*\/\n\/\/---OPENCOR--- BEGIN\nconst char *_object_error_category::name() const LLVM_NOEXCEPT {\n\/\/---OPENCOR--- END\n  return \"llvm.object\";\n}\n\nstd::string _object_error_category::message(int EV) const {\n  object_error E = static_cast<object_error>(EV);\n  switch (E) {\n  case object_error::success: return \"Success\";\n  case object_error::arch_not_found:\n    return \"No object file for requested architecture\";\n  case object_error::invalid_file_type:\n    return \"The file was not recognized as a valid object file\";\n  case object_error::parse_failed:\n    return \"Invalid data was encountered while parsing the file\";\n  case object_error::unexpected_eof:\n    return \"The end of the file was unexpectedly encountered\";\n  }\n  llvm_unreachable(\"An enumerator of object_error does not have a message \"\n                   \"defined.\");\n}\n\nconst std::error_category &object::object_category() {\n  static _object_error_category o;\n  return o;\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 \"flutter\/shell\/platform\/windows\/flutter_windows_view.h\"\n\n#include <chrono>\n\nnamespace flutter {\n\nFlutterWindowsView::FlutterWindowsView(\n    std::unique_ptr<WindowBindingHandler> window_binding) {\n  surface_manager_ = std::make_unique<AngleSurfaceManager>();\n\n  \/\/ Take the binding handler, and give it a pointer back to self.\n  binding_handler_ = std::move(window_binding);\n  binding_handler_->SetView(this);\n\n  render_target_ = std::make_unique<WindowsRenderTarget>(\n      binding_handler_->GetRenderTarget());\n}\n\nFlutterWindowsView::~FlutterWindowsView() {\n  DestroyRenderSurface();\n}\n\nvoid FlutterWindowsView::SetEngine(\n    std::unique_ptr<FlutterWindowsEngine> engine) {\n  engine_ = std::move(engine);\n\n  engine_->SetView(this);\n\n  internal_plugin_registrar_ =\n      std::make_unique<flutter::PluginRegistrar>(engine_->GetRegistrar());\n\n  \/\/ Set up the system channel handlers.\n  auto internal_plugin_messenger = internal_plugin_registrar_->messenger();\n  RegisterKeyboardHookHandlers(internal_plugin_messenger);\n  platform_handler_ = PlatformHandler::Create(internal_plugin_messenger, this);\n  cursor_handler_ = std::make_unique<flutter::CursorHandler>(\n      internal_plugin_messenger, binding_handler_.get());\n\n  PhysicalWindowBounds bounds = binding_handler_->GetPhysicalWindowBounds();\n\n  SendWindowMetrics(bounds.width, bounds.height,\n                    binding_handler_->GetDpiScale());\n}\n\nvoid FlutterWindowsView::RegisterKeyboardHookHandlers(\n    flutter::BinaryMessenger* messenger) {\n  AddKeyboardHookHandler(std::make_unique<flutter::KeyEventHandler>(messenger));\n  AddKeyboardHookHandler(\n      std::make_unique<flutter::TextInputPlugin>(messenger, this));\n}\n\nvoid FlutterWindowsView::AddKeyboardHookHandler(\n    std::unique_ptr<flutter::KeyboardHookHandler> handler) {\n  keyboard_hook_handlers_.push_back(std::move(handler));\n}\n\nuint32_t FlutterWindowsView::GetFrameBufferId(size_t width, size_t height) {\n  \/\/ Called on an engine-controlled (non-platform) thread.\n  std::unique_lock<std::mutex> lock(resize_mutex_);\n\n  if (resize_status_ != ResizeState::kResizeStarted) {\n    return kWindowFrameBufferID;\n  }\n\n  if (resize_target_width_ == width && resize_target_height_ == height) {\n    \/\/ Platform thread is blocked for the entire duration until the\n    \/\/ resize_status_ is set to kDone.\n    surface_manager_->ResizeSurface(GetRenderTarget(), width, height);\n    surface_manager_->MakeCurrent();\n    resize_status_ = ResizeState::kFrameGenerated;\n  }\n\n  return kWindowFrameBufferID;\n}\n\nvoid FlutterWindowsView::OnWindowSizeChanged(size_t width, size_t height) {\n  \/\/ Called on the platform thread.\n  std::unique_lock<std::mutex> lock(resize_mutex_);\n  resize_status_ = ResizeState::kResizeStarted;\n  resize_target_width_ = width;\n  resize_target_height_ = height;\n  SendWindowMetrics(width, height, binding_handler_->GetDpiScale());\n\n  if (width > 0 && height > 0) {\n    \/\/ Block the platform thread until:\n    \/\/   1. GetFrameBufferId is called with the right frame size.\n    \/\/   2. Any pending SwapBuffers calls have been invoked.\n    resize_cv_.wait(lock, [&resize_status = resize_status_] {\n      return resize_status == ResizeState::kDone;\n    });\n  }\n}\n\nvoid FlutterWindowsView::OnPointerMove(double x, double y) {\n  SendPointerMove(x, y);\n}\n\nvoid FlutterWindowsView::OnPointerDown(\n    double x,\n    double y,\n    FlutterPointerMouseButtons flutter_button) {\n  if (flutter_button != 0) {\n    uint64_t mouse_buttons = mouse_state_.buttons | flutter_button;\n    SetMouseButtons(mouse_buttons);\n    SendPointerDown(x, y);\n  }\n}\n\nvoid FlutterWindowsView::OnPointerUp(\n    double x,\n    double y,\n    FlutterPointerMouseButtons flutter_button) {\n  if (flutter_button != 0) {\n    uint64_t mouse_buttons = mouse_state_.buttons & ~flutter_button;\n    SetMouseButtons(mouse_buttons);\n    SendPointerUp(x, y);\n  }\n}\n\nvoid FlutterWindowsView::OnPointerLeave() {\n  SendPointerLeave();\n}\n\nvoid FlutterWindowsView::OnText(const std::u16string& text) {\n  SendText(text);\n}\n\nbool FlutterWindowsView::OnKey(int key,\n                               int scancode,\n                               int action,\n                               char32_t character,\n                               bool extended) {\n  return SendKey(key, scancode, action, character, extended);\n}\n\nvoid FlutterWindowsView::OnComposeBegin() {\n  SendComposeBegin();\n}\n\nvoid FlutterWindowsView::OnComposeEnd() {\n  SendComposeEnd();\n}\n\nvoid FlutterWindowsView::OnComposeChange(const std::u16string& text,\n                                         int cursor_pos) {\n  SendComposeChange(text, cursor_pos);\n}\n\nvoid FlutterWindowsView::OnScroll(double x,\n                                  double y,\n                                  double delta_x,\n                                  double delta_y,\n                                  int scroll_offset_multiplier) {\n  SendScroll(x, y, delta_x, delta_y, scroll_offset_multiplier);\n}\n\nvoid FlutterWindowsView::OnCursorRectUpdated(const Rect& rect) {\n  binding_handler_->UpdateCursorRect(rect);\n}\n\n\/\/ Sends new size  information to FlutterEngine.\nvoid FlutterWindowsView::SendWindowMetrics(size_t width,\n                                           size_t height,\n                                           double dpiScale) const {\n  FlutterWindowMetricsEvent event = {};\n  event.struct_size = sizeof(event);\n  event.width = width;\n  event.height = height;\n  event.pixel_ratio = dpiScale;\n  engine_->SendWindowMetricsEvent(event);\n}\n\nvoid FlutterWindowsView::SendInitialBounds() {\n  PhysicalWindowBounds bounds = binding_handler_->GetPhysicalWindowBounds();\n\n  SendWindowMetrics(bounds.width, bounds.height,\n                    binding_handler_->GetDpiScale());\n}\n\n\/\/ Set's |event_data|'s phase to either kMove or kHover depending on the current\n\/\/ primary mouse button state.\nvoid FlutterWindowsView::SetEventPhaseFromCursorButtonState(\n    FlutterPointerEvent* event_data) const {\n  \/\/ For details about this logic, see FlutterPointerPhase in the embedder.h\n  \/\/ file.\n  if (mouse_state_.buttons == 0) {\n    event_data->phase = mouse_state_.flutter_state_is_down\n                            ? FlutterPointerPhase::kUp\n                            : FlutterPointerPhase::kHover;\n  } else {\n    event_data->phase = mouse_state_.flutter_state_is_down\n                            ? FlutterPointerPhase::kMove\n                            : FlutterPointerPhase::kDown;\n  }\n}\n\nvoid FlutterWindowsView::SendPointerMove(double x, double y) {\n  FlutterPointerEvent event = {};\n  event.x = x;\n  event.y = y;\n  SetEventPhaseFromCursorButtonState(&event);\n  SendPointerEventWithData(event);\n}\n\nvoid FlutterWindowsView::SendPointerDown(double x, double y) {\n  FlutterPointerEvent event = {};\n  SetEventPhaseFromCursorButtonState(&event);\n  event.x = x;\n  event.y = y;\n  SendPointerEventWithData(event);\n  SetMouseFlutterStateDown(true);\n}\n\nvoid FlutterWindowsView::SendPointerUp(double x, double y) {\n  FlutterPointerEvent event = {};\n  SetEventPhaseFromCursorButtonState(&event);\n  event.x = x;\n  event.y = y;\n  SendPointerEventWithData(event);\n  if (event.phase == FlutterPointerPhase::kUp) {\n    SetMouseFlutterStateDown(false);\n  }\n}\n\nvoid FlutterWindowsView::SendPointerLeave() {\n  FlutterPointerEvent event = {};\n  event.phase = FlutterPointerPhase::kRemove;\n  SendPointerEventWithData(event);\n}\n\nvoid FlutterWindowsView::SendText(const std::u16string& text) {\n  for (const auto& handler : keyboard_hook_handlers_) {\n    handler->TextHook(this, text);\n  }\n}\n\nbool FlutterWindowsView::SendKey(int key,\n                                 int scancode,\n                                 int action,\n                                 char32_t character,\n                                 bool extended) {\n  for (const auto& handler : keyboard_hook_handlers_) {\n    if (handler->KeyboardHook(this, key, scancode, action, character,\n                              extended)) {\n      \/\/ key event was handled, so don't send to other handlers.\n      return true;\n    }\n  }\n  return false;\n}\n\nvoid FlutterWindowsView::SendComposeBegin() {\n  for (const auto& handler : keyboard_hook_handlers_) {\n    handler->ComposeBeginHook();\n  }\n}\n\nvoid FlutterWindowsView::SendComposeEnd() {\n  for (const auto& handler : keyboard_hook_handlers_) {\n    handler->ComposeEndHook();\n  }\n}\n\nvoid FlutterWindowsView::SendComposeChange(const std::u16string& text,\n                                           int cursor_pos) {\n  for (const auto& handler : keyboard_hook_handlers_) {\n    handler->ComposeChangeHook(text, cursor_pos);\n  }\n}\n\nvoid FlutterWindowsView::SendScroll(double x,\n                                    double y,\n                                    double delta_x,\n                                    double delta_y,\n                                    int scroll_offset_multiplier) {\n  FlutterPointerEvent event = {};\n  SetEventPhaseFromCursorButtonState(&event);\n  event.signal_kind = FlutterPointerSignalKind::kFlutterPointerSignalKindScroll;\n  event.x = x;\n  event.y = y;\n  event.scroll_delta_x = delta_x * scroll_offset_multiplier;\n  event.scroll_delta_y = delta_y * scroll_offset_multiplier;\n  SendPointerEventWithData(event);\n}\n\nvoid FlutterWindowsView::SendPointerEventWithData(\n    const FlutterPointerEvent& event_data) {\n  \/\/ If sending anything other than an add, and the pointer isn't already added,\n  \/\/ synthesize an add to satisfy Flutter's expectations about events.\n  if (!mouse_state_.flutter_state_is_added &&\n      event_data.phase != FlutterPointerPhase::kAdd) {\n    FlutterPointerEvent event = {};\n    event.phase = FlutterPointerPhase::kAdd;\n    event.x = event_data.x;\n    event.y = event_data.y;\n    event.buttons = 0;\n    SendPointerEventWithData(event);\n  }\n  \/\/ Don't double-add (e.g., if events are delivered out of order, so an add has\n  \/\/ already been synthesized).\n  if (mouse_state_.flutter_state_is_added &&\n      event_data.phase == FlutterPointerPhase::kAdd) {\n    return;\n  }\n\n  FlutterPointerEvent event = event_data;\n  event.device_kind = kFlutterPointerDeviceKindMouse;\n  event.buttons = mouse_state_.buttons;\n\n  \/\/ Set metadata that's always the same regardless of the event.\n  event.struct_size = sizeof(event);\n  event.timestamp =\n      std::chrono::duration_cast<std::chrono::microseconds>(\n          std::chrono::high_resolution_clock::now().time_since_epoch())\n          .count();\n\n  engine_->SendPointerEvent(event);\n\n  if (event_data.phase == FlutterPointerPhase::kAdd) {\n    SetMouseFlutterStateAdded(true);\n  } else if (event_data.phase == FlutterPointerPhase::kRemove) {\n    SetMouseFlutterStateAdded(false);\n    ResetMouseState();\n  }\n}\n\nbool FlutterWindowsView::MakeCurrent() {\n  return surface_manager_->MakeCurrent();\n}\n\nbool FlutterWindowsView::MakeResourceCurrent() {\n  return surface_manager_->MakeResourceCurrent();\n}\n\nbool FlutterWindowsView::ClearContext() {\n  return surface_manager_->ClearContext();\n}\n\nbool FlutterWindowsView::SwapBuffers() {\n  \/\/ Called on an engine-controlled (non-platform) thread.\n  std::unique_lock<std::mutex> lock(resize_mutex_);\n\n  switch (resize_status_) {\n    \/\/ SwapBuffer requests during resize are ignored until the frame with the\n    \/\/ right dimensions has been generated. This is marked with\n    \/\/ kFrameGenerated resize status.\n    case ResizeState::kResizeStarted:\n      return false;\n    case ResizeState::kFrameGenerated: {\n      bool swap_buffers_result = surface_manager_->SwapBuffers();\n      resize_status_ = ResizeState::kDone;\n      lock.unlock();\n      resize_cv_.notify_all();\n      binding_handler_->OnWindowResized();\n      return swap_buffers_result;\n    }\n    case ResizeState::kDone:\n    default:\n      return surface_manager_->SwapBuffers();\n  }\n}\n\nvoid FlutterWindowsView::CreateRenderSurface() {\n  PhysicalWindowBounds bounds = binding_handler_->GetPhysicalWindowBounds();\n  surface_manager_->CreateSurface(GetRenderTarget(), bounds.width,\n                                  bounds.height);\n}\n\nvoid FlutterWindowsView::DestroyRenderSurface() {\n  if (surface_manager_) {\n    surface_manager_->DestroySurface();\n  }\n}\n\nWindowsRenderTarget* FlutterWindowsView::GetRenderTarget() const {\n  return render_target_.get();\n}\n\nFlutterWindowsEngine* FlutterWindowsView::GetEngine() {\n  return engine_.get();\n}\n\n}  \/\/ namespace flutter\n<commit_msg>[windows] Honor only valid resize requests (#23990)<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 \"flutter\/shell\/platform\/windows\/flutter_windows_view.h\"\n\n#include <chrono>\n\nnamespace flutter {\n\n\/\/\/ Returns true if the surface will be updated as part of the resize process.\n\/\/\/\n\/\/\/ This is called on window resize to determine if the platform thread needs\n\/\/\/ to be blocked until the frame with the right size has been rendered. It\n\/\/\/ should be kept in-sync with how the engine deals with a new surface request\n\/\/\/ as seen in `CreateOrUpdateSurface` in `GPUSurfaceGL`.\nstatic bool SurfaceWillUpdate(size_t cur_width,\n                              size_t cur_height,\n                              size_t target_width,\n                              size_t target_height) {\n  \/\/ TODO (https:\/\/github.com\/flutter\/flutter\/issues\/65061) : Avoid special\n  \/\/ handling for zero dimensions.\n  bool non_zero_dims = target_height > 0 && target_width > 0;\n  bool not_same_size =\n      (cur_height != target_height) || (cur_width != target_width);\n  return non_zero_dims && not_same_size;\n}\n\nFlutterWindowsView::FlutterWindowsView(\n    std::unique_ptr<WindowBindingHandler> window_binding) {\n  surface_manager_ = std::make_unique<AngleSurfaceManager>();\n\n  \/\/ Take the binding handler, and give it a pointer back to self.\n  binding_handler_ = std::move(window_binding);\n  binding_handler_->SetView(this);\n\n  render_target_ = std::make_unique<WindowsRenderTarget>(\n      binding_handler_->GetRenderTarget());\n}\n\nFlutterWindowsView::~FlutterWindowsView() {\n  DestroyRenderSurface();\n}\n\nvoid FlutterWindowsView::SetEngine(\n    std::unique_ptr<FlutterWindowsEngine> engine) {\n  engine_ = std::move(engine);\n\n  engine_->SetView(this);\n\n  internal_plugin_registrar_ =\n      std::make_unique<flutter::PluginRegistrar>(engine_->GetRegistrar());\n\n  \/\/ Set up the system channel handlers.\n  auto internal_plugin_messenger = internal_plugin_registrar_->messenger();\n  RegisterKeyboardHookHandlers(internal_plugin_messenger);\n  platform_handler_ = PlatformHandler::Create(internal_plugin_messenger, this);\n  cursor_handler_ = std::make_unique<flutter::CursorHandler>(\n      internal_plugin_messenger, binding_handler_.get());\n\n  PhysicalWindowBounds bounds = binding_handler_->GetPhysicalWindowBounds();\n\n  SendWindowMetrics(bounds.width, bounds.height,\n                    binding_handler_->GetDpiScale());\n}\n\nvoid FlutterWindowsView::RegisterKeyboardHookHandlers(\n    flutter::BinaryMessenger* messenger) {\n  AddKeyboardHookHandler(std::make_unique<flutter::KeyEventHandler>(messenger));\n  AddKeyboardHookHandler(\n      std::make_unique<flutter::TextInputPlugin>(messenger, this));\n}\n\nvoid FlutterWindowsView::AddKeyboardHookHandler(\n    std::unique_ptr<flutter::KeyboardHookHandler> handler) {\n  keyboard_hook_handlers_.push_back(std::move(handler));\n}\n\nuint32_t FlutterWindowsView::GetFrameBufferId(size_t width, size_t height) {\n  \/\/ Called on an engine-controlled (non-platform) thread.\n  std::unique_lock<std::mutex> lock(resize_mutex_);\n\n  if (resize_status_ != ResizeState::kResizeStarted) {\n    return kWindowFrameBufferID;\n  }\n\n  if (resize_target_width_ == width && resize_target_height_ == height) {\n    \/\/ Platform thread is blocked for the entire duration until the\n    \/\/ resize_status_ is set to kDone.\n    surface_manager_->ResizeSurface(GetRenderTarget(), width, height);\n    surface_manager_->MakeCurrent();\n    resize_status_ = ResizeState::kFrameGenerated;\n  }\n\n  return kWindowFrameBufferID;\n}\n\nvoid FlutterWindowsView::OnWindowSizeChanged(size_t width, size_t height) {\n  \/\/ Called on the platform thread.\n  std::unique_lock<std::mutex> lock(resize_mutex_);\n\n  bool surface_will_update = SurfaceWillUpdate(\n      resize_target_width_, resize_target_height_, width, height);\n  if (surface_will_update) {\n    resize_status_ = ResizeState::kResizeStarted;\n    resize_target_width_ = width;\n    resize_target_height_ = height;\n  }\n\n  SendWindowMetrics(width, height, binding_handler_->GetDpiScale());\n\n  if (surface_will_update) {\n    \/\/ Block the platform thread until:\n    \/\/   1. GetFrameBufferId is called with the right frame size.\n    \/\/   2. Any pending SwapBuffers calls have been invoked.\n    resize_cv_.wait(lock, [&resize_status = resize_status_] {\n      return resize_status == ResizeState::kDone;\n    });\n  }\n}\n\nvoid FlutterWindowsView::OnPointerMove(double x, double y) {\n  SendPointerMove(x, y);\n}\n\nvoid FlutterWindowsView::OnPointerDown(\n    double x,\n    double y,\n    FlutterPointerMouseButtons flutter_button) {\n  if (flutter_button != 0) {\n    uint64_t mouse_buttons = mouse_state_.buttons | flutter_button;\n    SetMouseButtons(mouse_buttons);\n    SendPointerDown(x, y);\n  }\n}\n\nvoid FlutterWindowsView::OnPointerUp(\n    double x,\n    double y,\n    FlutterPointerMouseButtons flutter_button) {\n  if (flutter_button != 0) {\n    uint64_t mouse_buttons = mouse_state_.buttons & ~flutter_button;\n    SetMouseButtons(mouse_buttons);\n    SendPointerUp(x, y);\n  }\n}\n\nvoid FlutterWindowsView::OnPointerLeave() {\n  SendPointerLeave();\n}\n\nvoid FlutterWindowsView::OnText(const std::u16string& text) {\n  SendText(text);\n}\n\nbool FlutterWindowsView::OnKey(int key,\n                               int scancode,\n                               int action,\n                               char32_t character,\n                               bool extended) {\n  return SendKey(key, scancode, action, character, extended);\n}\n\nvoid FlutterWindowsView::OnComposeBegin() {\n  SendComposeBegin();\n}\n\nvoid FlutterWindowsView::OnComposeEnd() {\n  SendComposeEnd();\n}\n\nvoid FlutterWindowsView::OnComposeChange(const std::u16string& text,\n                                         int cursor_pos) {\n  SendComposeChange(text, cursor_pos);\n}\n\nvoid FlutterWindowsView::OnScroll(double x,\n                                  double y,\n                                  double delta_x,\n                                  double delta_y,\n                                  int scroll_offset_multiplier) {\n  SendScroll(x, y, delta_x, delta_y, scroll_offset_multiplier);\n}\n\nvoid FlutterWindowsView::OnCursorRectUpdated(const Rect& rect) {\n  binding_handler_->UpdateCursorRect(rect);\n}\n\n\/\/ Sends new size  information to FlutterEngine.\nvoid FlutterWindowsView::SendWindowMetrics(size_t width,\n                                           size_t height,\n                                           double dpiScale) const {\n  FlutterWindowMetricsEvent event = {};\n  event.struct_size = sizeof(event);\n  event.width = width;\n  event.height = height;\n  event.pixel_ratio = dpiScale;\n  engine_->SendWindowMetricsEvent(event);\n}\n\nvoid FlutterWindowsView::SendInitialBounds() {\n  PhysicalWindowBounds bounds = binding_handler_->GetPhysicalWindowBounds();\n\n  SendWindowMetrics(bounds.width, bounds.height,\n                    binding_handler_->GetDpiScale());\n}\n\n\/\/ Set's |event_data|'s phase to either kMove or kHover depending on the current\n\/\/ primary mouse button state.\nvoid FlutterWindowsView::SetEventPhaseFromCursorButtonState(\n    FlutterPointerEvent* event_data) const {\n  \/\/ For details about this logic, see FlutterPointerPhase in the embedder.h\n  \/\/ file.\n  if (mouse_state_.buttons == 0) {\n    event_data->phase = mouse_state_.flutter_state_is_down\n                            ? FlutterPointerPhase::kUp\n                            : FlutterPointerPhase::kHover;\n  } else {\n    event_data->phase = mouse_state_.flutter_state_is_down\n                            ? FlutterPointerPhase::kMove\n                            : FlutterPointerPhase::kDown;\n  }\n}\n\nvoid FlutterWindowsView::SendPointerMove(double x, double y) {\n  FlutterPointerEvent event = {};\n  event.x = x;\n  event.y = y;\n  SetEventPhaseFromCursorButtonState(&event);\n  SendPointerEventWithData(event);\n}\n\nvoid FlutterWindowsView::SendPointerDown(double x, double y) {\n  FlutterPointerEvent event = {};\n  SetEventPhaseFromCursorButtonState(&event);\n  event.x = x;\n  event.y = y;\n  SendPointerEventWithData(event);\n  SetMouseFlutterStateDown(true);\n}\n\nvoid FlutterWindowsView::SendPointerUp(double x, double y) {\n  FlutterPointerEvent event = {};\n  SetEventPhaseFromCursorButtonState(&event);\n  event.x = x;\n  event.y = y;\n  SendPointerEventWithData(event);\n  if (event.phase == FlutterPointerPhase::kUp) {\n    SetMouseFlutterStateDown(false);\n  }\n}\n\nvoid FlutterWindowsView::SendPointerLeave() {\n  FlutterPointerEvent event = {};\n  event.phase = FlutterPointerPhase::kRemove;\n  SendPointerEventWithData(event);\n}\n\nvoid FlutterWindowsView::SendText(const std::u16string& text) {\n  for (const auto& handler : keyboard_hook_handlers_) {\n    handler->TextHook(this, text);\n  }\n}\n\nbool FlutterWindowsView::SendKey(int key,\n                                 int scancode,\n                                 int action,\n                                 char32_t character,\n                                 bool extended) {\n  for (const auto& handler : keyboard_hook_handlers_) {\n    if (handler->KeyboardHook(this, key, scancode, action, character,\n                              extended)) {\n      \/\/ key event was handled, so don't send to other handlers.\n      return true;\n    }\n  }\n  return false;\n}\n\nvoid FlutterWindowsView::SendComposeBegin() {\n  for (const auto& handler : keyboard_hook_handlers_) {\n    handler->ComposeBeginHook();\n  }\n}\n\nvoid FlutterWindowsView::SendComposeEnd() {\n  for (const auto& handler : keyboard_hook_handlers_) {\n    handler->ComposeEndHook();\n  }\n}\n\nvoid FlutterWindowsView::SendComposeChange(const std::u16string& text,\n                                           int cursor_pos) {\n  for (const auto& handler : keyboard_hook_handlers_) {\n    handler->ComposeChangeHook(text, cursor_pos);\n  }\n}\n\nvoid FlutterWindowsView::SendScroll(double x,\n                                    double y,\n                                    double delta_x,\n                                    double delta_y,\n                                    int scroll_offset_multiplier) {\n  FlutterPointerEvent event = {};\n  SetEventPhaseFromCursorButtonState(&event);\n  event.signal_kind = FlutterPointerSignalKind::kFlutterPointerSignalKindScroll;\n  event.x = x;\n  event.y = y;\n  event.scroll_delta_x = delta_x * scroll_offset_multiplier;\n  event.scroll_delta_y = delta_y * scroll_offset_multiplier;\n  SendPointerEventWithData(event);\n}\n\nvoid FlutterWindowsView::SendPointerEventWithData(\n    const FlutterPointerEvent& event_data) {\n  \/\/ If sending anything other than an add, and the pointer isn't already added,\n  \/\/ synthesize an add to satisfy Flutter's expectations about events.\n  if (!mouse_state_.flutter_state_is_added &&\n      event_data.phase != FlutterPointerPhase::kAdd) {\n    FlutterPointerEvent event = {};\n    event.phase = FlutterPointerPhase::kAdd;\n    event.x = event_data.x;\n    event.y = event_data.y;\n    event.buttons = 0;\n    SendPointerEventWithData(event);\n  }\n  \/\/ Don't double-add (e.g., if events are delivered out of order, so an add has\n  \/\/ already been synthesized).\n  if (mouse_state_.flutter_state_is_added &&\n      event_data.phase == FlutterPointerPhase::kAdd) {\n    return;\n  }\n\n  FlutterPointerEvent event = event_data;\n  event.device_kind = kFlutterPointerDeviceKindMouse;\n  event.buttons = mouse_state_.buttons;\n\n  \/\/ Set metadata that's always the same regardless of the event.\n  event.struct_size = sizeof(event);\n  event.timestamp =\n      std::chrono::duration_cast<std::chrono::microseconds>(\n          std::chrono::high_resolution_clock::now().time_since_epoch())\n          .count();\n\n  engine_->SendPointerEvent(event);\n\n  if (event_data.phase == FlutterPointerPhase::kAdd) {\n    SetMouseFlutterStateAdded(true);\n  } else if (event_data.phase == FlutterPointerPhase::kRemove) {\n    SetMouseFlutterStateAdded(false);\n    ResetMouseState();\n  }\n}\n\nbool FlutterWindowsView::MakeCurrent() {\n  return surface_manager_->MakeCurrent();\n}\n\nbool FlutterWindowsView::MakeResourceCurrent() {\n  return surface_manager_->MakeResourceCurrent();\n}\n\nbool FlutterWindowsView::ClearContext() {\n  return surface_manager_->ClearContext();\n}\n\nbool FlutterWindowsView::SwapBuffers() {\n  \/\/ Called on an engine-controlled (non-platform) thread.\n  std::unique_lock<std::mutex> lock(resize_mutex_);\n\n  switch (resize_status_) {\n    \/\/ SwapBuffer requests during resize are ignored until the frame with the\n    \/\/ right dimensions has been generated. This is marked with\n    \/\/ kFrameGenerated resize status.\n    case ResizeState::kResizeStarted:\n      return false;\n    case ResizeState::kFrameGenerated: {\n      bool swap_buffers_result = surface_manager_->SwapBuffers();\n      resize_status_ = ResizeState::kDone;\n      lock.unlock();\n      resize_cv_.notify_all();\n      binding_handler_->OnWindowResized();\n      return swap_buffers_result;\n    }\n    case ResizeState::kDone:\n    default:\n      return surface_manager_->SwapBuffers();\n  }\n}\n\nvoid FlutterWindowsView::CreateRenderSurface() {\n  PhysicalWindowBounds bounds = binding_handler_->GetPhysicalWindowBounds();\n  surface_manager_->CreateSurface(GetRenderTarget(), bounds.width,\n                                  bounds.height);\n}\n\nvoid FlutterWindowsView::DestroyRenderSurface() {\n  if (surface_manager_) {\n    surface_manager_->DestroySurface();\n  }\n}\n\nWindowsRenderTarget* FlutterWindowsView::GetRenderTarget() const {\n  return render_target_.get();\n}\n\nFlutterWindowsEngine* FlutterWindowsView::GetEngine() {\n  return engine_.get();\n}\n\n}  \/\/ namespace flutter\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>set annconsole destructor virtual<commit_after><|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\tNode<T> * prev = nullptr;\r\n\t\tNode<T> * cur = nullptr;\r\n\t\tif (check_search(x))\r\n\t\t{\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}\r\n\t\treturn prev;\r\n\t}\r\n\t\r\n\tvoid deleteX(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<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)const\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\tNode<T> * prev = nullptr;\r\n\t\tif (check_search(x))\r\n\t\t{\r\n\t\t\tif (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\tnode = node->left;\r\n\t\t\t\t\tprev_(node, 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\tnode = node->right;\r\n\t\t\t\t\tprev_(node, x);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn prev;\r\n\t}\r\n\t\r\n\tvoid deleteX(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 * @file matrix_inv.hpp\n *\n * @date Oct 26, 2016\n *\n * @author Jaroslaw Wiosna\n *\n * @par Licence\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#ifndef MATRIX_MATRIX_INV_HPP_\n#define MATRIX_MATRIX_INV_HPP_\n\n#include \"matrix_det.hpp\"\n#include \"matrix_trans.hpp\"\n\nnamespace mlib\n{\n\n\n\/**\n * @brief Minor of A - A with crossed-out i-th column and j-th row\n *\n * @param [in] Square Matrix A with nxn size\n *\n * @return Minor of A matrix\n *\/\ntemplate<typename T, std::size_t n>\nstatic Matrix<T, (n-1), (n-1)> getminor(const Matrix<T, n, n>& A, std::size_t i, std::size_t j)\n{\n  Matrix<T, (n-1), (n-1)> minor{};\n  std::size_t colCount {0},rowCount {0};\n  for(std::size_t k = 0; k < n; k++)\n  {\n    if (k != i)\n    {\n      colCount = 0;\n      for(std::size_t l = 0; l < n; l++)\n      {\n        if (l != j)\n        {\n          minor[rowCount][colCount] = A[k][l];\n          colCount++;\n        }\n      }\n      rowCount++;\n    }\n  }\n  return minor;\n}\n\n\n\/**\n * @brief Inverse of matrix 1x1\n *\n * @param [in] Square Matrix A with 1x1 size\n *\n * @return Inverse of matrix A\n *\/\ntemplate<typename T>\nMatrix<T, 1, 1> inv(const Matrix<T, 1, 1>& A)\n{\n  return Matrix<T, 1, 1>{ 1\/det(A) };\n}\n\n\n\/**\n * @brief Inverse of matrix 2x2\n *\n * @param [in] Square Matrix A with 2x2 size\n *\n * @return Inverse of matrix A\n *         error with the A is zero\n *\/\ntemplate<typename T>\nMatrix<T, 2, 2> inv(const Matrix<T, 2, 2>& A)\n{\n  Matrix<T, 2, 2> invA{};\n  const auto detA { det(A) };\n  if (detA == 0)\n  {\n    throw std::overflow_error(\"Divide by zero exception\");\n  }\n  invA = {A[1][1], -A[0][1],\n         -A[1][0],  A[0][0]};\n  invA = invA \/ detA;\n  return invA;\n}\n\n\n\/**\n * @brief Inverse of matrix 3x3\n *\n * @param [in] Square Matrix A with 3x3 size\n *\n * @return Inverse of matrix A\n *         error with the A is zero\n *\/\ntemplate<typename T>\nMatrix<T, 3, 3> inv(const Matrix<T, 3, 3>& A)\n{\n  const auto detA { det(A) };\n  if (detA == 0)\n  {\n    throw std::overflow_error(\"Divide by zero exception\");\n  }\n\n  auto&& a = A[0][0]; auto&& b = A[0][1]; auto&& c = A[0][2];\n  auto&& d = A[1][0]; auto&& e = A[1][1]; auto&& f = A[1][2];\n  auto&& g = A[2][0]; auto&& h = A[2][1]; auto&& i = A[2][2];\n\n  const Matrix<T, 3, 3> invA\n  { e*i - f*h, c*h - b*i, b*f - c*e,\n    f*g - d*i, a*i - c*g, c*d - a*f,\n    d*h - e*g, b*g - a*h, a*e - b*d };\n\n  return invA \/ detA;\n}\n\n\/**\n * @brief Inverse of matrix nxn\n *\n * @param [in] Square Matrix A with nxn size\n *\n * @return Inverse of matrix A\n *\/\ntemplate<typename T, std::size_t n>\nMatrix<T, n, n> inv(const Matrix<T, n, n>& A)\n{\n  Matrix<T, n, n> invA{};\n  const auto detA { det(A) };\n  for(std::size_t i = 0; i < n; i++)\n  {\n    for(std::size_t j = 0; j < n; j++)\n    {\n      invA[i][j] = (((i+j) % 2) ? -1 : 1) * det(getminor(A, i, j));\n    }\n  }\n  return trans(invA)\/ detA;\n}\n\n\n} \/* namespace mlib *\/\n\n#endif \/* MATRIX_MATRIX_INV_HPP_ *\/\n<commit_msg>fix clang compilation error<commit_after>\/**\n * @file matrix_inv.hpp\n *\n * @date Oct 26, 2016\n *\n * @author Jaroslaw Wiosna\n *\n * @par Licence\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#ifndef MATRIX_MATRIX_INV_HPP_\n#define MATRIX_MATRIX_INV_HPP_\n\n#include \"matrix_div.hpp\"\n#include \"matrix_det.hpp\"\n#include \"matrix_trans.hpp\"\n\nnamespace mlib\n{\n\n\n\/**\n * @brief Minor of A - A with crossed-out i-th column and j-th row\n *\n * @param [in] Square Matrix A with nxn size\n *\n * @return Minor of A matrix\n *\/\ntemplate<typename T, std::size_t n>\nstatic Matrix<T, (n-1), (n-1)> getminor(const Matrix<T, n, n>& A, std::size_t i, std::size_t j)\n{\n  Matrix<T, (n-1), (n-1)> minor{};\n  std::size_t colCount {0},rowCount {0};\n  for(std::size_t k = 0; k < n; k++)\n  {\n    if (k != i)\n    {\n      colCount = 0;\n      for(std::size_t l = 0; l < n; l++)\n      {\n        if (l != j)\n        {\n          minor[rowCount][colCount] = A[k][l];\n          colCount++;\n        }\n      }\n      rowCount++;\n    }\n  }\n  return minor;\n}\n\n\n\/**\n * @brief Inverse of matrix 1x1\n *\n * @param [in] Square Matrix A with 1x1 size\n *\n * @return Inverse of matrix A\n *\/\ntemplate<typename T>\nMatrix<T, 1, 1> inv(const Matrix<T, 1, 1>& A)\n{\n  return Matrix<T, 1, 1>{ 1\/det(A) };\n}\n\n\n\/**\n * @brief Inverse of matrix 2x2\n *\n * @param [in] Square Matrix A with 2x2 size\n *\n * @return Inverse of matrix A\n *         error with the A is zero\n *\/\ntemplate<typename T>\nMatrix<T, 2, 2> inv(const Matrix<T, 2, 2>& A)\n{\n  Matrix<T, 2, 2> invA{};\n  const auto detA { det(A) };\n  if (detA == 0)\n  {\n    throw std::overflow_error(\"Divide by zero exception\");\n  }\n  invA = {A[1][1], -A[0][1],\n         -A[1][0],  A[0][0]};\n  invA = invA \/ detA;\n  return invA;\n}\n\n\n\/**\n * @brief Inverse of matrix 3x3\n *\n * @param [in] Square Matrix A with 3x3 size\n *\n * @return Inverse of matrix A\n *         error with the A is zero\n *\/\ntemplate<typename T>\nMatrix<T, 3, 3> inv(const Matrix<T, 3, 3>& A)\n{\n  const auto detA { det(A) };\n  if (detA == 0)\n  {\n    throw std::overflow_error(\"Divide by zero exception\");\n  }\n\n  auto&& a = A[0][0]; auto&& b = A[0][1]; auto&& c = A[0][2];\n  auto&& d = A[1][0]; auto&& e = A[1][1]; auto&& f = A[1][2];\n  auto&& g = A[2][0]; auto&& h = A[2][1]; auto&& i = A[2][2];\n\n  const Matrix<T, 3, 3> invA\n  { e*i - f*h, c*h - b*i, b*f - c*e,\n    f*g - d*i, a*i - c*g, c*d - a*f,\n    d*h - e*g, b*g - a*h, a*e - b*d };\n\n  return invA \/ detA;\n}\n\n\/**\n * @brief Inverse of matrix nxn\n *\n * @param [in] Square Matrix A with nxn size\n *\n * @return Inverse of matrix A\n *\/\ntemplate<typename T, std::size_t n>\nMatrix<T, n, n> inv(const Matrix<T, n, n>& A)\n{\n  Matrix<T, n, n> invA{};\n  const auto detA { det(A) };\n  for(std::size_t i = 0; i < n; i++)\n  {\n    for(std::size_t j = 0; j < n; j++)\n    {\n      invA[i][j] = (((i+j) % 2) ? -1 : 1) * det(getminor(A, i, j));\n    }\n  }\n  return trans(invA)\/ detA;\n}\n\n\n} \/* namespace mlib *\/\n\n#endif \/* MATRIX_MATRIX_INV_HPP_ *\/\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2014 Open Connectome Project (http:\/\/openconnecto.me)\n * Written by Da Zheng (zhengda1936@gmail.com)\n *\n * This file is part of FlashMatrix.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 <assert.h>\n\n#include <vector>\n#include <string>\n\n#include \"native_file.h\"\n#include \"log.h\"\n#include \"FG_basic_types.h\"\n#include \"vertex.h\"\n#include \"graph_file_header.h\"\n#include \"vertex_index.h\"\n#include \"in_mem_storage.h\"\n\n#include \"generic_type.h\"\n#include \"data_io.h\"\n#include \"data_frame.h\"\n#include \"vector.h\"\n#include \"vector_vector.h\"\n#include \"fm_utils.h\"\n#include \"matrix_config.h\"\n#include \"sparse_matrix.h\"\n\nusing namespace fm;\n\n\/*\n * This class parses a line into an edge (source, destination).\n *\/\nclass edge_parser: public line_parser\n{\npublic:\n\tsize_t parse(const std::vector<std::string> &lines, data_frame &df) const;\n\tsize_t get_num_cols() const {\n\t\treturn 2;\n\t}\n\n\tstd::string get_col_name(off_t idx) const {\n\t\tif (idx == 0)\n\t\t\treturn \"source\";\n\t\telse\n\t\t\treturn \"dest\";\n\t}\n\n\tconst scalar_type &get_col_type(off_t idx) const {\n\t\treturn get_scalar_type<fg::vertex_id_t>();\n\t}\n};\n\nsize_t edge_parser::parse(const std::vector<std::string> &lines,\n\t\tdata_frame &df) const\n{\n\tdetail::smp_vec_store::ptr froms = detail::smp_vec_store::create(lines.size(),\n\t\t\tget_scalar_type<fg::vertex_id_t>());\n\tdetail::smp_vec_store::ptr tos = detail::smp_vec_store::create(lines.size(),\n\t\t\tget_scalar_type<fg::vertex_id_t>());\n\tfor (size_t i = 0; i < lines.size(); i++) {\n\t\tconst char *line = lines[i].c_str();\n\t\tint len = strlen(line);\n\t\tconst char *first = line;\n\t\t\/\/ Skip space\n\t\tfor (; isspace(*first); first++);\n\t\tif (*first == '#')\n\t\t\tcontinue;\n\n\t\t\/\/ Make sure we get a number.\n\t\tif (!isdigit(*first)) {\n\t\t\tBOOST_LOG_TRIVIAL(error)\n\t\t\t\t<< std::string(\"the first entry isn't a number: \") + first;\n\t\t\tcontinue;\n\t\t}\n\t\tfg::vertex_id_t from = atol(first);\n\t\tassert(from >= 0 && from < fg::MAX_VERTEX_ID);\n\n\t\tconst char *second = first;\n\t\t\/\/ Go to the end of the first number.\n\t\tfor (; isdigit(*second); second++);\n\t\tif (second - line == len) {\n\t\t\tBOOST_LOG_TRIVIAL(error)\n\t\t\t\t<< std::string(\"there isn't second entry: \") + line;\n\t\t\tcontinue;\n\t\t}\n\t\t\/\/ Skip space between two numbers.\n\t\tfor (; isspace(*second); second++);\n\t\t\/\/ Make sure we get a number.\n\t\tif (!isdigit(*second)) {\n\t\t\tBOOST_LOG_TRIVIAL(error)\n\t\t\t\t<< std::string(\"the second entry isn't a number: \") + second;\n\t\t\tcontinue;\n\t\t}\n\t\tfg::vertex_id_t to = atol(second);\n\t\tassert(to >= 0 && to < fg::MAX_VERTEX_ID);\n\n\t\tfroms->set(i, from);\n\t\ttos->set(i, to);\n\t}\n\n\tdf.get_vec(0)->append(*froms);\n\tdf.get_vec(1)->append(*tos);\n\treturn froms->get_length();\n}\n\nvoid print_usage()\n{\n\tfprintf(stderr, \"convert an edge list to adjacency lists\\n\");\n\tfprintf(stderr, \"el2al [options] conf_file edge_file graph_name\\n\");\n\tfprintf(stderr, \"-u: undirected graph\\n\");\n\tfprintf(stderr, \"-e: use external memory\\n\");\n\tfprintf(stderr, \"-s size: sort buffer size\\n\");\n}\n\nint main(int argc, char *argv[])\n{\n\tbool directed = true;\n\tbool in_mem = true;\n\tsize_t sort_buf_size = 1UL * 1024 * 1024 * 1024;\n\tint opt;\n\tint num_opts = 0;\n\twhile ((opt = getopt(argc, argv, \"ues:\")) != -1) {\n\t\tnum_opts++;\n\t\tswitch (opt) {\n\t\t\tcase 'u':\n\t\t\t\tdirected = false;\n\t\t\t\tbreak;\n\t\t\tcase 'e':\n\t\t\t\tin_mem = false;\n\t\t\t\tbreak;\n\t\t\tcase 's':\n\t\t\t\tsort_buf_size = atol(optarg);\n\t\t\t\tnum_opts++;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tprint_usage();\n\t\t\t\texit(1);\n\t\t}\n\t}\n\n\targv += 1 + num_opts;\n\targc -= 1 + num_opts;\n\tif (argc < 2) {\n\t\tprint_usage();\n\t\texit(1);\n\t}\n\n\tstd::string conf_file = argv[0];\n\tstd::string file_name = argv[1];\n\tstd::string graph_name = argv[2];\n\tstd::string adj_file = graph_name + \".adj\";\n\tstd::string index_file = graph_name + \".index\";\n\n\tstd::vector<std::string> files;\n\tsafs::native_file f(file_name);\n\tif (f.exist() && !f.is_dir())\n\t\tfiles.push_back(file_name);\n\telse if (f.exist() && f.is_dir()) {\n\t\tsafs::native_dir d(file_name);\n\t\td.read_all_files(files);\n\t\tfor (size_t i = 0; i < files.size(); i++)\n\t\t\tfiles[i] = file_name + \"\/\" + files[i];\n\t}\n\telse {\n\t\tfprintf(stderr, \"The input file %s doesn't exist\\n\", file_name.c_str());\n\t\treturn -1;\n\t}\n\tprintf(\"read edges from %ld files\\n\", files.size());\n\n\tconfig_map::ptr configs = config_map::create(conf_file);\n\tinit_flash_matrix(configs);\n\tmatrix_conf.set_sort_buf_size(sort_buf_size);\n\n\tstruct timeval start, end;\n\tedge_parser parser;\n\t\/*\n\t * We only need to indicate here whether we use external memory or not.\n\t * If the columns in the data frame are in external memory, it'll always\n\t * use external data containers for the remaining of processing.\n\t *\/\n\tprintf(\"start to read and parse edge list\\n\");\n\tgettimeofday(&start, NULL);\n\tdata_frame::ptr df = read_lines(files, parser, in_mem);\n\tgettimeofday(&end, NULL);\n\tprintf(\"It takes %.3f seconds to parse the edge lists\\n\",\n\t\t\ttime_diff(start, end));\n\tprintf(\"There are %ld edges\\n\", df->get_num_entries());\n\n\tfg::vertex_id_t max_vid = 0;\n\tgettimeofday(&start, NULL);\n\tfor (size_t i = 0; i < df->get_num_vecs(); i++) {\n\t\tvector::ptr vec = vector::create(df->get_vec(i));\n\t\tmax_vid = std::max(max_vid, vec->max<fg::vertex_id_t>());\n\t}\n\tgettimeofday(&end, NULL);\n\tprintf(\"It takes %.3f seconds to get the maximal vertex ID\\n\",\n\t\t\ttime_diff(start, end));\n\tprintf(\"max id: %d\\n\", max_vid);\n\tdetail::vec_store::ptr seq_vec = detail::create_vec_store<fg::vertex_id_t>(\n\t\t\t0, max_vid, 1);\n\tdetail::vec_store::ptr rep_vec = detail::create_vec_store<fg::vertex_id_t>(\n\t\t\tmax_vid + 1, fg::INVALID_VERTEX_ID);\n\tassert(seq_vec->get_length() == rep_vec->get_length());\n\n\tfg::FG_graph::ptr graph;\n\tif (directed) {\n\t\tgettimeofday(&start, NULL);\n\t\t\/\/ I artificially add an invalid out-edge for each vertex, so it's\n\t\t\/\/ guaranteed that each vertex exists in the adjacency lists.\n\t\tdata_frame::ptr new_df = data_frame::create();\n\t\tnew_df->add_vec(df->get_vec_name(0), seq_vec);\n\t\tnew_df->add_vec(df->get_vec_name(1), rep_vec);\n\t\tdf->append(new_df);\n\n\t\t\/\/ I artificially add an invalid in-edge for each vertex.\n\t\tnew_df = data_frame::create();\n\t\tnew_df->add_vec(df->get_vec_name(1), seq_vec);\n\t\tnew_df->add_vec(df->get_vec_name(0), rep_vec);\n\t\tdf->append(new_df);\n\t\tgettimeofday(&end, NULL);\n\t\tprintf(\"It takes %.3f seconds to prepare for constructing a graph\\n\",\n\t\t\t\ttime_diff(start, end));\n\n\t\tprintf(\"start to construct FlashGraph graph\\n\");\n\t\tgraph = create_fg_graph(graph_name, df, true);\n\t}\n\telse {\n\t\tgettimeofday(&start, NULL);\n\t\t\/\/ I artificially add an invalid out-edge for each vertex, so it's\n\t\t\/\/ guaranteed that each vertex exists in the adjacency lists.\n\t\tdata_frame::ptr new_df = data_frame::create();\n\t\tnew_df->add_vec(df->get_vec_name(0), seq_vec);\n\t\tnew_df->add_vec(df->get_vec_name(1), rep_vec);\n\t\tdf->append(new_df);\n\n\t\tdetail::vec_store::ptr vec0 = df->get_vec(0)->deep_copy();\n\t\tdetail::vec_store::ptr vec1 = df->get_vec(1)->deep_copy();\n\t\tvec0->append(df->get_vec_ref(1));\n\t\tvec1->append(df->get_vec_ref(0));\n\t\tnew_df = data_frame::create();\n\t\tnew_df->add_vec(df->get_vec_name(0), vec0);\n\t\tnew_df->add_vec(df->get_vec_name(1), vec1);\n\t\tdf = new_df;\n\t\tgettimeofday(&end, NULL);\n\t\tprintf(\"It takes %.3f seconds to prepare for constructing a graph\\n\",\n\t\t\t\ttime_diff(start, end));\n\n\t\tprintf(\"start to construct FlashGraph graph\\n\");\n\t\tgraph = create_fg_graph(graph_name, df, false);\n\t}\n\n\tif (graph->get_index_data())\n\t\tgraph->get_index_data()->dump(index_file);\n\tif (graph->get_graph_data())\n\t\tgraph->get_graph_data()->dump(adj_file);\n\n\tdf = NULL;\n\tdestroy_flash_matrix();\n\n\treturn 0;\n}\n<commit_msg>[Matrix]: accept more user-friendly number in el2al.<commit_after>\/*\n * Copyright 2014 Open Connectome Project (http:\/\/openconnecto.me)\n * Written by Da Zheng (zhengda1936@gmail.com)\n *\n * This file is part of FlashMatrix.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 <assert.h>\n\n#include <vector>\n#include <string>\n\n#include \"common.h\"\n\n#include \"native_file.h\"\n#include \"log.h\"\n#include \"FG_basic_types.h\"\n#include \"vertex.h\"\n#include \"graph_file_header.h\"\n#include \"vertex_index.h\"\n#include \"in_mem_storage.h\"\n\n#include \"generic_type.h\"\n#include \"data_io.h\"\n#include \"data_frame.h\"\n#include \"vector.h\"\n#include \"vector_vector.h\"\n#include \"fm_utils.h\"\n#include \"matrix_config.h\"\n#include \"sparse_matrix.h\"\n\nusing namespace fm;\n\n\/*\n * This class parses a line into an edge (source, destination).\n *\/\nclass edge_parser: public line_parser\n{\npublic:\n\tsize_t parse(const std::vector<std::string> &lines, data_frame &df) const;\n\tsize_t get_num_cols() const {\n\t\treturn 2;\n\t}\n\n\tstd::string get_col_name(off_t idx) const {\n\t\tif (idx == 0)\n\t\t\treturn \"source\";\n\t\telse\n\t\t\treturn \"dest\";\n\t}\n\n\tconst scalar_type &get_col_type(off_t idx) const {\n\t\treturn get_scalar_type<fg::vertex_id_t>();\n\t}\n};\n\nsize_t edge_parser::parse(const std::vector<std::string> &lines,\n\t\tdata_frame &df) const\n{\n\tdetail::smp_vec_store::ptr froms = detail::smp_vec_store::create(lines.size(),\n\t\t\tget_scalar_type<fg::vertex_id_t>());\n\tdetail::smp_vec_store::ptr tos = detail::smp_vec_store::create(lines.size(),\n\t\t\tget_scalar_type<fg::vertex_id_t>());\n\tfor (size_t i = 0; i < lines.size(); i++) {\n\t\tconst char *line = lines[i].c_str();\n\t\tint len = strlen(line);\n\t\tconst char *first = line;\n\t\t\/\/ Skip space\n\t\tfor (; isspace(*first); first++);\n\t\tif (*first == '#')\n\t\t\tcontinue;\n\n\t\t\/\/ Make sure we get a number.\n\t\tif (!isdigit(*first)) {\n\t\t\tBOOST_LOG_TRIVIAL(error)\n\t\t\t\t<< std::string(\"the first entry isn't a number: \") + first;\n\t\t\tcontinue;\n\t\t}\n\t\tfg::vertex_id_t from = atol(first);\n\t\tassert(from >= 0 && from < fg::MAX_VERTEX_ID);\n\n\t\tconst char *second = first;\n\t\t\/\/ Go to the end of the first number.\n\t\tfor (; isdigit(*second); second++);\n\t\tif (second - line == len) {\n\t\t\tBOOST_LOG_TRIVIAL(error)\n\t\t\t\t<< std::string(\"there isn't second entry: \") + line;\n\t\t\tcontinue;\n\t\t}\n\t\t\/\/ Skip space between two numbers.\n\t\tfor (; isspace(*second); second++);\n\t\t\/\/ Make sure we get a number.\n\t\tif (!isdigit(*second)) {\n\t\t\tBOOST_LOG_TRIVIAL(error)\n\t\t\t\t<< std::string(\"the second entry isn't a number: \") + second;\n\t\t\tcontinue;\n\t\t}\n\t\tfg::vertex_id_t to = atol(second);\n\t\tassert(to >= 0 && to < fg::MAX_VERTEX_ID);\n\n\t\tfroms->set(i, from);\n\t\ttos->set(i, to);\n\t}\n\n\tdf.get_vec(0)->append(*froms);\n\tdf.get_vec(1)->append(*tos);\n\treturn froms->get_length();\n}\n\nvoid print_usage()\n{\n\tfprintf(stderr, \"convert an edge list to adjacency lists\\n\");\n\tfprintf(stderr, \"el2al [options] conf_file edge_file graph_name\\n\");\n\tfprintf(stderr, \"-u: undirected graph\\n\");\n\tfprintf(stderr, \"-e: use external memory\\n\");\n\tfprintf(stderr, \"-s size: sort buffer size\\n\");\n}\n\nint main(int argc, char *argv[])\n{\n\tbool directed = true;\n\tbool in_mem = true;\n\tsize_t sort_buf_size = 1UL * 1024 * 1024 * 1024;\n\tint opt;\n\tint num_opts = 0;\n\twhile ((opt = getopt(argc, argv, \"ues:\")) != -1) {\n\t\tnum_opts++;\n\t\tswitch (opt) {\n\t\t\tcase 'u':\n\t\t\t\tdirected = false;\n\t\t\t\tbreak;\n\t\t\tcase 'e':\n\t\t\t\tin_mem = false;\n\t\t\t\tbreak;\n\t\t\tcase 's':\n\t\t\t\tsort_buf_size = str2size(optarg);\n\t\t\t\tnum_opts++;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tprint_usage();\n\t\t\t\texit(1);\n\t\t}\n\t}\n\n\targv += 1 + num_opts;\n\targc -= 1 + num_opts;\n\tif (argc < 2) {\n\t\tprint_usage();\n\t\texit(1);\n\t}\n\n\tstd::string conf_file = argv[0];\n\tstd::string file_name = argv[1];\n\tstd::string graph_name = argv[2];\n\tstd::string adj_file = graph_name + \".adj\";\n\tstd::string index_file = graph_name + \".index\";\n\n\tstd::vector<std::string> files;\n\tsafs::native_file f(file_name);\n\tif (f.exist() && !f.is_dir())\n\t\tfiles.push_back(file_name);\n\telse if (f.exist() && f.is_dir()) {\n\t\tsafs::native_dir d(file_name);\n\t\td.read_all_files(files);\n\t\tfor (size_t i = 0; i < files.size(); i++)\n\t\t\tfiles[i] = file_name + \"\/\" + files[i];\n\t}\n\telse {\n\t\tfprintf(stderr, \"The input file %s doesn't exist\\n\", file_name.c_str());\n\t\treturn -1;\n\t}\n\tprintf(\"read edges from %ld files\\n\", files.size());\n\n\tconfig_map::ptr configs = config_map::create(conf_file);\n\tinit_flash_matrix(configs);\n\tmatrix_conf.set_sort_buf_size(sort_buf_size);\n\n\tstruct timeval start, end;\n\tedge_parser parser;\n\t\/*\n\t * We only need to indicate here whether we use external memory or not.\n\t * If the columns in the data frame are in external memory, it'll always\n\t * use external data containers for the remaining of processing.\n\t *\/\n\tprintf(\"start to read and parse edge list\\n\");\n\tgettimeofday(&start, NULL);\n\tdata_frame::ptr df = read_lines(files, parser, in_mem);\n\tgettimeofday(&end, NULL);\n\tprintf(\"It takes %.3f seconds to parse the edge lists\\n\",\n\t\t\ttime_diff(start, end));\n\tprintf(\"There are %ld edges\\n\", df->get_num_entries());\n\n\tfg::vertex_id_t max_vid = 0;\n\tgettimeofday(&start, NULL);\n\tfor (size_t i = 0; i < df->get_num_vecs(); i++) {\n\t\tvector::ptr vec = vector::create(df->get_vec(i));\n\t\tmax_vid = std::max(max_vid, vec->max<fg::vertex_id_t>());\n\t}\n\tgettimeofday(&end, NULL);\n\tprintf(\"It takes %.3f seconds to get the maximal vertex ID\\n\",\n\t\t\ttime_diff(start, end));\n\tprintf(\"max id: %d\\n\", max_vid);\n\tdetail::vec_store::ptr seq_vec = detail::create_vec_store<fg::vertex_id_t>(\n\t\t\t0, max_vid, 1);\n\tdetail::vec_store::ptr rep_vec = detail::create_vec_store<fg::vertex_id_t>(\n\t\t\tmax_vid + 1, fg::INVALID_VERTEX_ID);\n\tassert(seq_vec->get_length() == rep_vec->get_length());\n\n\tfg::FG_graph::ptr graph;\n\tif (directed) {\n\t\tgettimeofday(&start, NULL);\n\t\t\/\/ I artificially add an invalid out-edge for each vertex, so it's\n\t\t\/\/ guaranteed that each vertex exists in the adjacency lists.\n\t\tdata_frame::ptr new_df = data_frame::create();\n\t\tnew_df->add_vec(df->get_vec_name(0), seq_vec);\n\t\tnew_df->add_vec(df->get_vec_name(1), rep_vec);\n\t\tdf->append(new_df);\n\n\t\t\/\/ I artificially add an invalid in-edge for each vertex.\n\t\tnew_df = data_frame::create();\n\t\tnew_df->add_vec(df->get_vec_name(1), seq_vec);\n\t\tnew_df->add_vec(df->get_vec_name(0), rep_vec);\n\t\tdf->append(new_df);\n\t\tgettimeofday(&end, NULL);\n\t\tprintf(\"It takes %.3f seconds to prepare for constructing a graph\\n\",\n\t\t\t\ttime_diff(start, end));\n\n\t\tprintf(\"start to construct FlashGraph graph\\n\");\n\t\tgraph = create_fg_graph(graph_name, df, true);\n\t}\n\telse {\n\t\tgettimeofday(&start, NULL);\n\t\t\/\/ I artificially add an invalid out-edge for each vertex, so it's\n\t\t\/\/ guaranteed that each vertex exists in the adjacency lists.\n\t\tdata_frame::ptr new_df = data_frame::create();\n\t\tnew_df->add_vec(df->get_vec_name(0), seq_vec);\n\t\tnew_df->add_vec(df->get_vec_name(1), rep_vec);\n\t\tdf->append(new_df);\n\n\t\tdetail::vec_store::ptr vec0 = df->get_vec(0)->deep_copy();\n\t\tdetail::vec_store::ptr vec1 = df->get_vec(1)->deep_copy();\n\t\tvec0->append(df->get_vec_ref(1));\n\t\tvec1->append(df->get_vec_ref(0));\n\t\tnew_df = data_frame::create();\n\t\tnew_df->add_vec(df->get_vec_name(0), vec0);\n\t\tnew_df->add_vec(df->get_vec_name(1), vec1);\n\t\tdf = new_df;\n\t\tgettimeofday(&end, NULL);\n\t\tprintf(\"It takes %.3f seconds to prepare for constructing a graph\\n\",\n\t\t\t\ttime_diff(start, end));\n\n\t\tprintf(\"start to construct FlashGraph graph\\n\");\n\t\tgraph = create_fg_graph(graph_name, df, false);\n\t}\n\n\tif (graph->get_index_data())\n\t\tgraph->get_index_data()->dump(index_file);\n\tif (graph->get_graph_data())\n\t\tgraph->get_graph_data()->dump(adj_file);\n\n\tdf = NULL;\n\tdestroy_flash_matrix();\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*******************************************************************************\n * c7a\/net\/dispatcher.hpp\n *\n * Asynchronous callback wrapper around select(), epoll(), or other kernel-level\n * dispatchers.\n *\n * Part of Project c7a.\n *\n * Copyright (C) 2015 Timo Bingmann <tb@panthema.net>\n *\n * This file has no license. Only Chuck Norris can compile it.\n ******************************************************************************\/\n\n#pragma once\n#ifndef C7A_NET_DISPATCHER_HEADER\n#define C7A_NET_DISPATCHER_HEADER\n\n#include <c7a\/net\/connection.hpp>\n#include <c7a\/net\/buffer.hpp>\n#include <c7a\/net\/lowlevel\/socket.hpp>\n#include <c7a\/net\/lowlevel\/select_dispatcher.hpp>\n\/\/TODO(tb) can we use a os switch? Do we want that? -tb: yes, later.\n\/\/#include <c7a\/net\/lowlevel\/epoll-dispatcher.hpp>\n\n#if defined(_LIBCPP_VERSION) || defined(__clang__)\n#include <c7a\/common\/delegate.hpp>\n#endif\n\n#include <string>\n#include <deque>\n#include <queue>\n#include <ctime>\n#include <chrono>\n#include <atomic>\n\nnamespace c7a {\nnamespace net {\n\n\/\/! \\addtogroup net Network Communication\n\/\/! \\{\n\n\/**\n * Dispatcher is a high level wrapper for asynchronous callback\n * processing.. One can register Connection objects for readability and\n * writability checks, buffered reads and writes with completion callbacks, and\n * also timer functions.\n *\/\nclass Dispatcher\n{\n    static const bool debug = false;\n\nprotected:\n    \/\/! switch between different low-level dispatchers\n    typedef lowlevel::SelectDispatcher SubDispatcher;\n    \/\/typedef lowlevel::EPollDispatcher SubDispatcher;\n\n    \/\/! import into class namespace\n    typedef lowlevel::Socket Socket;\n\n    \/\/! import into class namespace\n    typedef std::chrono::steady_clock steady_clock;\n\n    \/\/! import into class namespace\n    typedef std::chrono::milliseconds milliseconds;\n\n#if defined(_LIBCPP_VERSION) || defined(__clang__)\n    template <typename Signature>\n    using function = common::delegate<Signature>;\n#else\n    template <typename Signature>\n    using function = std::function<Signature>;\n#endif\n\n    \/\/! for access to terminate_\n    friend class DispatcherThread;\n\npublic:\n    \/\/! default constructor\n    Dispatcher() { }\n\n    \/\/! non-copyable: delete copy-constructor\n    Dispatcher(const Dispatcher&) = delete;\n    \/\/! non-copyable: delete assignment operator\n    Dispatcher& operator = (const Dispatcher&) = delete;\n    \/\/! move-constructor\n    Dispatcher(Dispatcher&& d)\n        : dispatcher_(std::move(d.dispatcher_)),\n          terminate_(d.terminate_.load()),\n          timer_pq_(std::move(d.timer_pq_)),\n          async_read_(std::move(async_read_)),\n          async_write_(std::move(async_write_))\n    { }\n    \/\/! move-assignment\n    Dispatcher& operator = (Dispatcher&& d) {\n        dispatcher_ = std::move(d.dispatcher_);\n        terminate_ = d.terminate_.load();\n        timer_pq_ = std::move(timer_pq_);\n        async_read_ = std::move(async_read_);\n        async_write_ = std::move(async_write_);\n        return *this;\n    }\n\n    \/\/! \\name Timeout Callbacks\n    \/\/! \\{\n\n    \/\/! callback signature for timer events\n    typedef function<bool ()> TimerCallback;\n\n    \/\/! Register a relative timeout callback\n    template <class Rep, class Period>\n    void AddRelativeTimeout(const std::chrono::duration<Rep, Period>& timeout,\n                            const TimerCallback& cb) {\n        timer_pq_.emplace(steady_clock::now() + timeout,\n                          std::chrono::duration_cast<milliseconds>(timeout),\n                          cb);\n    }\n\n    \/\/! \\}\n\n    \/\/! \\name Connection Callbacks\n    \/\/! \\{\n\n    \/\/! callback signature for socket readable\/writable events\n    typedef function<bool ()> ConnectionCallback;\n\n    \/\/! Register a buffered read callback and a default exception callback.\n    void AddRead(Connection& c, const ConnectionCallback& read_cb) {\n        return dispatcher_.AddRead(c.GetSocket().fd(), read_cb);\n    }\n\n    \/\/! Register a buffered write callback and a default exception callback.\n    void AddWrite(Connection& c, const ConnectionCallback& write_cb) {\n        return dispatcher_.AddWrite(c.GetSocket().fd(), write_cb);\n    }\n\n    \/\/! Cancel all callbacks on a given connection.\n    void Cancel(int fd) {\n        return dispatcher_.Cancel(fd);\n    }\n\n    \/\/! \\}\n\n    \/\/! \\name Asynchronous Data Reader\/Writer Callbacks\n    \/\/! \\{\n\n    \/\/! callback signature for async read callbacks, they may acquire the buffer\n    typedef function<void (Connection& c,\n                           Buffer&& buffer)> AsyncReadCallback;\n\n    \/\/! asynchronously read n bytes and deliver them to the callback\n    void AsyncRead(Connection& c, size_t n, AsyncReadCallback done_cb) {\n        assert(c.GetSocket().IsValid());\n\n        LOG << \"async read on read dispatcher\";\n        if (n == 0) {\n            if (done_cb) done_cb(c, Buffer());\n            return;\n        }\n\n        \/\/ add new async reader object\n        async_read_.emplace_back(n, done_cb);\n\n        \/\/ register read callback\n        AsyncReadBuffer& arb = async_read_.back();\n        AddRead(c, [&arb, &c]() { return arb(c); });\n    }\n\n    \/\/! callback signature for async write callbacks\n    typedef function<void (Connection&)> AsyncWriteCallback;\n\n    \/\/! asynchronously write buffer and callback when delivered. The buffer is\n    \/\/! MOVED into the async writer.\n    void AsyncWrite(Connection& c, Buffer&& buffer,\n                    AsyncWriteCallback done_cb = nullptr) {\n        assert(c.GetSocket().IsValid());\n\n        if (buffer.size() == 0) {\n            if (done_cb) done_cb(c);\n            return;\n        }\n\n        \/\/ add new async writer object\n        async_write_.emplace_back(std::move(buffer), done_cb);\n\n        \/\/ register write callback\n        AsyncWriteBuffer& awb = async_write_.back();\n        AddWrite(c, [&awb, &c]() { return awb(c); });\n    }\n\n    \/\/! asynchronously write buffer and callback when delivered. COPIES the data\n    \/\/! into a Buffer!\n    void AsyncWriteCopy(Connection& c, const void* buffer, size_t size,\n                        AsyncWriteCallback done_cb = nullptr) {\n        return AsyncWrite(c, Buffer(buffer, size), done_cb);\n    }\n\n    \/\/! asynchronously write buffer and callback when delivered. COPIES the data\n    \/\/! into a Buffer!\n    void AsyncWriteCopy(Connection& c, const std::string& str,\n                        AsyncWriteCallback done_cb = nullptr) {\n        return AsyncWriteCopy(c, str.data(), str.size(), done_cb);\n    }\n\n    \/\/! \\}\n\n    \/\/! \\name Dispatch\n    \/\/! \\{\n\n    \/\/! Dispatch one or more events\n    void Dispatch() {\n        \/\/ process timer events that lie in the past\n        steady_clock::time_point now = steady_clock::now();\n\n        while (!terminate_ &&\n               !timer_pq_.empty() &&\n               timer_pq_.top().next_timeout <= now)\n        {\n            const Timer& top = timer_pq_.top();\n            if (top.cb()) {\n                \/\/ requeue timeout event again.\n                timer_pq_.emplace(top.next_timeout + top.timeout,\n                                  top.timeout, top.cb);\n            }\n            timer_pq_.pop();\n        }\n\n        if (terminate_) return;\n\n        \/\/ calculate time until next timer event\n        if (timer_pq_.empty()) {\n            LOG << \"Dispatch(): empty timer queue - selecting for 10s\";\n            dispatcher_.Dispatch(milliseconds(10000));\n        }\n        else {\n            auto diff = std::chrono::duration_cast<milliseconds>(\n                timer_pq_.top().next_timeout - now);\n\n            sLOG << \"Dispatch(): waiting\" << diff.count() << \"ms\";\n            dispatcher_.Dispatch(diff);\n        }\n\n        \/\/ clean up finished AsyncRead\/Writes\n        while (async_read_.size() && async_read_.front().IsDone()) {\n            async_read_.pop_front();\n        }\n\n        while (async_write_.size() && async_write_.front().IsDone()) {\n            async_write_.pop_front();\n        }\n    }\n\n    \/\/! Loop over Dispatch() until terminate_ flag is set.\n    void Loop() {\n        while (!terminate_) {\n            Dispatch();\n        }\n    }\n\n    \/\/! Causes the dispatcher to break out after the next timeout occurred\n    \/\/! Does not interrupt the currently running read\/write operation, but\n    \/\/! breaks after the operation finished or timed out.\n    void Terminate() {\n        terminate_ = true;\n    }\n\n    \/\/! Check whether there are still AsyncWrite()s in the queue.\n    bool HasAsyncWrites() const {\n        sLOG << \"HasAsyncWrites()\" << async_write_.size();\n        return (async_write_.size() != 0);\n    }\n\n    \/\/! \\}\n\nprotected:\n    \/\/! low-level file descriptor async processing\n    SubDispatcher dispatcher_;\n\n    \/\/! true if dispatcher needs to stop\n    std::atomic<bool> terminate_ { false };\n\n    \/\/! struct for timer callbacks\n    struct Timer\n    {\n        \/\/! timepoint of next timeout\n        steady_clock::time_point next_timeout;\n        \/\/! relative timeout for restarting\n        milliseconds             timeout;\n        \/\/! callback\n        TimerCallback            cb;\n\n        Timer(const steady_clock::time_point& _next_timeout,\n              const milliseconds& _timeout,\n              const TimerCallback& _cb)\n            : next_timeout(_next_timeout),\n              timeout(_timeout),\n              cb(_cb)\n        { }\n\n        bool operator < (const Timer& b) const\n        { return next_timeout < b.next_timeout; }\n    };\n\n    \/\/! priority queue of timer callbacks\n    typedef std::priority_queue<Timer> TimerPQ;\n\n    \/\/! priority queue of timer callbacks, obviously kept in timeout\n    \/\/! order. Currently not addressable.\n    TimerPQ timer_pq_;\n\n    \/**************************************************************************\/\n\n    class AsyncReadBuffer\n    {\n    public:\n        \/\/! Construct buffered reader with callback\n        AsyncReadBuffer(size_t buffer_size, const AsyncReadCallback& callback)\n            : callback_(callback),\n              buffer_(buffer_size)\n        { }\n\n        \/\/! Should be called when the socket is readable\n        bool operator () (Connection& c) {\n            int r = c.GetSocket().recv_one(\n                buffer_.data() + size_, buffer_.size() - size_);\n\n            if (r <= 0) {\n                \/\/ these errors are acceptable: just redo the recv later.\n                if (errno == EINTR || errno == EAGAIN) return true;\n\n                \/\/ signal artificial IsDone, for clean up.\n                size_ = buffer_.size();\n\n                \/\/ these errors are end-of-file indications (both good and bad)\n                if (errno == 0 || errno == EPIPE || errno == ECONNRESET) {\n                    if (callback_) callback_(c, Buffer());\n                    return false;\n                }\n                throw Exception(\"AsyncReadBuffer() error in recv\", errno);\n            }\n\n            size_ += r;\n\n            if (size_ == buffer_.size()) {\n                if (callback_) callback_(c, std::move(buffer_));\n                return false;\n            }\n            else {\n                return true;\n            }\n        }\n\n        bool IsDone() const { return size_ == buffer_.size(); }\n\n    private:\n        \/\/! total size currently read\n        size_t size_ = 0;\n\n        \/\/! functional object to call once data is complete\n        AsyncReadCallback callback_;\n\n        \/\/! Receive buffer\n        Buffer buffer_;\n    };\n\n    \/\/! deque of asynchronous readers\n    std::deque<AsyncReadBuffer> async_read_;\n\n    \/**************************************************************************\/\n\n    class AsyncWriteBuffer\n    {\n    public:\n        \/\/! Construct buffered writer with callback\n        AsyncWriteBuffer(Buffer&& buffer,\n                         const AsyncWriteCallback& callback)\n            : callback_(callback),\n              buffer_(std::move(buffer))\n        { }\n\n        \/\/! Should be called when the socket is writable\n        bool operator () (Connection& c) {\n            int r = c.GetSocket().send_one(\n                buffer_.data() + size_, buffer_.size() - size_);\n\n            if (r <= 0) {\n                if (errno == EINTR || errno == EAGAIN) return true;\n\n                \/\/ signal artificial IsDone, for clean up.\n                size_ = buffer_.size();\n\n                if (errno == EPIPE) {\n                    LOG1 << \"AsyncWriteBuffer() got SIGPIPE\";\n                    if (callback_) callback_(c);\n                    return false;\n                }\n                throw Exception(\"AsyncWriteBuffer() error in send\", errno);\n            }\n\n            size_ += r;\n\n            if (size_ == buffer_.size()) {\n                if (callback_) callback_(c);\n                return false;\n            }\n            else {\n                return true;\n            }\n        }\n\n        bool IsDone() const { return size_ == buffer_.size(); }\n\n    private:\n        \/\/! total size currently written\n        size_t size_ = 0;\n\n        \/\/! functional object to call once data is complete\n        AsyncWriteCallback callback_;\n\n        \/\/! Receive buffer\n        Buffer buffer_;\n    };\n\n    \/\/! deque of asynchronous writers\n    std::deque<AsyncWriteBuffer> async_write_;\n\n    \/**************************************************************************\/\n\n    \/\/! Default exception handler\n    static bool ExceptionCallback(Connection& s) {\n        \/\/ exception on listen socket ?\n        throw Exception(\n                  \"Dispatcher() exception on socket fd \"\n                  + std::to_string(s.GetSocket().fd()) + \"!\", errno);\n    }\n};\n\n\/\/! \\}\n\n} \/\/ namespace net\n} \/\/ namespace c7a\n\n#endif \/\/ !C7A_NET_DISPATCHER_HEADER\n\n\/******************************************************************************\/\n<commit_msg>Fixing some wrong moves in Dispatcher.<commit_after>\/*******************************************************************************\n * c7a\/net\/dispatcher.hpp\n *\n * Asynchronous callback wrapper around select(), epoll(), or other kernel-level\n * dispatchers.\n *\n * Part of Project c7a.\n *\n * Copyright (C) 2015 Timo Bingmann <tb@panthema.net>\n *\n * This file has no license. Only Chuck Norris can compile it.\n ******************************************************************************\/\n\n#pragma once\n#ifndef C7A_NET_DISPATCHER_HEADER\n#define C7A_NET_DISPATCHER_HEADER\n\n#include <c7a\/net\/connection.hpp>\n#include <c7a\/net\/buffer.hpp>\n#include <c7a\/net\/lowlevel\/socket.hpp>\n#include <c7a\/net\/lowlevel\/select_dispatcher.hpp>\n\/\/TODO(tb) can we use a os switch? Do we want that? -tb: yes, later.\n\/\/#include <c7a\/net\/lowlevel\/epoll-dispatcher.hpp>\n\n#if defined(_LIBCPP_VERSION) || defined(__clang__)\n#include <c7a\/common\/delegate.hpp>\n#endif\n\n#include <string>\n#include <deque>\n#include <queue>\n#include <ctime>\n#include <chrono>\n#include <atomic>\n\nnamespace c7a {\nnamespace net {\n\n\/\/! \\addtogroup net Network Communication\n\/\/! \\{\n\n\/**\n * Dispatcher is a high level wrapper for asynchronous callback\n * processing.. One can register Connection objects for readability and\n * writability checks, buffered reads and writes with completion callbacks, and\n * also timer functions.\n *\/\nclass Dispatcher\n{\n    static const bool debug = false;\n\nprotected:\n    \/\/! switch between different low-level dispatchers\n    typedef lowlevel::SelectDispatcher SubDispatcher;\n    \/\/typedef lowlevel::EPollDispatcher SubDispatcher;\n\n    \/\/! import into class namespace\n    typedef lowlevel::Socket Socket;\n\n    \/\/! import into class namespace\n    typedef std::chrono::steady_clock steady_clock;\n\n    \/\/! import into class namespace\n    typedef std::chrono::milliseconds milliseconds;\n\n#if defined(_LIBCPP_VERSION) || defined(__clang__)\n    template <typename Signature>\n    using function = common::delegate<Signature>;\n#else\n    template <typename Signature>\n    using function = std::function<Signature>;\n#endif\n\n    \/\/! for access to terminate_\n    friend class DispatcherThread;\n\npublic:\n    \/\/! default constructor\n    Dispatcher() { }\n\n    \/\/! non-copyable: delete copy-constructor\n    Dispatcher(const Dispatcher&) = delete;\n    \/\/! non-copyable: delete assignment operator\n    Dispatcher& operator = (const Dispatcher&) = delete;\n    \/\/! move-constructor\n    Dispatcher(Dispatcher&& d)\n        : dispatcher_(std::move(d.dispatcher_)),\n          terminate_(d.terminate_.load()),\n          timer_pq_(std::move(d.timer_pq_)),\n          async_read_(std::move(d.async_read_)),\n          async_write_(std::move(d.async_write_))\n    { }\n    \/\/! move-assignment\n    Dispatcher& operator = (Dispatcher&& d) {\n        dispatcher_ = std::move(d.dispatcher_);\n        terminate_ = d.terminate_.load();\n        timer_pq_ = std::move(d.timer_pq_);\n        async_read_ = std::move(d.async_read_);\n        async_write_ = std::move(d.async_write_);\n        return *this;\n    }\n\n    \/\/! \\name Timeout Callbacks\n    \/\/! \\{\n\n    \/\/! callback signature for timer events\n    typedef function<bool ()> TimerCallback;\n\n    \/\/! Register a relative timeout callback\n    template <class Rep, class Period>\n    void AddRelativeTimeout(const std::chrono::duration<Rep, Period>& timeout,\n                            const TimerCallback& cb) {\n        timer_pq_.emplace(steady_clock::now() + timeout,\n                          std::chrono::duration_cast<milliseconds>(timeout),\n                          cb);\n    }\n\n    \/\/! \\}\n\n    \/\/! \\name Connection Callbacks\n    \/\/! \\{\n\n    \/\/! callback signature for socket readable\/writable events\n    typedef function<bool ()> ConnectionCallback;\n\n    \/\/! Register a buffered read callback and a default exception callback.\n    void AddRead(Connection& c, const ConnectionCallback& read_cb) {\n        return dispatcher_.AddRead(c.GetSocket().fd(), read_cb);\n    }\n\n    \/\/! Register a buffered write callback and a default exception callback.\n    void AddWrite(Connection& c, const ConnectionCallback& write_cb) {\n        return dispatcher_.AddWrite(c.GetSocket().fd(), write_cb);\n    }\n\n    \/\/! Cancel all callbacks on a given connection.\n    void Cancel(int fd) {\n        return dispatcher_.Cancel(fd);\n    }\n\n    \/\/! \\}\n\n    \/\/! \\name Asynchronous Data Reader\/Writer Callbacks\n    \/\/! \\{\n\n    \/\/! callback signature for async read callbacks, they may acquire the buffer\n    typedef function<void (Connection& c,\n                           Buffer&& buffer)> AsyncReadCallback;\n\n    \/\/! asynchronously read n bytes and deliver them to the callback\n    void AsyncRead(Connection& c, size_t n, AsyncReadCallback done_cb) {\n        assert(c.GetSocket().IsValid());\n\n        LOG << \"async read on read dispatcher\";\n        if (n == 0) {\n            if (done_cb) done_cb(c, Buffer());\n            return;\n        }\n\n        \/\/ add new async reader object\n        async_read_.emplace_back(n, done_cb);\n\n        \/\/ register read callback\n        AsyncReadBuffer& arb = async_read_.back();\n        AddRead(c, [&arb, &c]() { return arb(c); });\n    }\n\n    \/\/! callback signature for async write callbacks\n    typedef function<void (Connection&)> AsyncWriteCallback;\n\n    \/\/! asynchronously write buffer and callback when delivered. The buffer is\n    \/\/! MOVED into the async writer.\n    void AsyncWrite(Connection& c, Buffer&& buffer,\n                    AsyncWriteCallback done_cb = nullptr) {\n        assert(c.GetSocket().IsValid());\n\n        if (buffer.size() == 0) {\n            if (done_cb) done_cb(c);\n            return;\n        }\n\n        \/\/ add new async writer object\n        async_write_.emplace_back(std::move(buffer), done_cb);\n\n        \/\/ register write callback\n        AsyncWriteBuffer& awb = async_write_.back();\n        AddWrite(c, [&awb, &c]() { return awb(c); });\n    }\n\n    \/\/! asynchronously write buffer and callback when delivered. COPIES the data\n    \/\/! into a Buffer!\n    void AsyncWriteCopy(Connection& c, const void* buffer, size_t size,\n                        AsyncWriteCallback done_cb = nullptr) {\n        return AsyncWrite(c, Buffer(buffer, size), done_cb);\n    }\n\n    \/\/! asynchronously write buffer and callback when delivered. COPIES the data\n    \/\/! into a Buffer!\n    void AsyncWriteCopy(Connection& c, const std::string& str,\n                        AsyncWriteCallback done_cb = nullptr) {\n        return AsyncWriteCopy(c, str.data(), str.size(), done_cb);\n    }\n\n    \/\/! \\}\n\n    \/\/! \\name Dispatch\n    \/\/! \\{\n\n    \/\/! Dispatch one or more events\n    void Dispatch() {\n        \/\/ process timer events that lie in the past\n        steady_clock::time_point now = steady_clock::now();\n\n        while (!terminate_ &&\n               !timer_pq_.empty() &&\n               timer_pq_.top().next_timeout <= now)\n        {\n            const Timer& top = timer_pq_.top();\n            if (top.cb()) {\n                \/\/ requeue timeout event again.\n                timer_pq_.emplace(top.next_timeout + top.timeout,\n                                  top.timeout, top.cb);\n            }\n            timer_pq_.pop();\n        }\n\n        if (terminate_) return;\n\n        \/\/ calculate time until next timer event\n        if (timer_pq_.empty()) {\n            LOG << \"Dispatch(): empty timer queue - selecting for 10s\";\n            dispatcher_.Dispatch(milliseconds(10000));\n        }\n        else {\n            auto diff = std::chrono::duration_cast<milliseconds>(\n                timer_pq_.top().next_timeout - now);\n\n            sLOG << \"Dispatch(): waiting\" << diff.count() << \"ms\";\n            dispatcher_.Dispatch(diff);\n        }\n\n        \/\/ clean up finished AsyncRead\/Writes\n        while (async_read_.size() && async_read_.front().IsDone()) {\n            async_read_.pop_front();\n        }\n\n        while (async_write_.size() && async_write_.front().IsDone()) {\n            async_write_.pop_front();\n        }\n    }\n\n    \/\/! Loop over Dispatch() until terminate_ flag is set.\n    void Loop() {\n        while (!terminate_) {\n            Dispatch();\n        }\n    }\n\n    \/\/! Causes the dispatcher to break out after the next timeout occurred\n    \/\/! Does not interrupt the currently running read\/write operation, but\n    \/\/! breaks after the operation finished or timed out.\n    void Terminate() {\n        terminate_ = true;\n    }\n\n    \/\/! Check whether there are still AsyncWrite()s in the queue.\n    bool HasAsyncWrites() const {\n        sLOG << \"HasAsyncWrites()\" << async_write_.size();\n        return (async_write_.size() != 0);\n    }\n\n    \/\/! \\}\n\nprotected:\n    \/\/! low-level file descriptor async processing\n    SubDispatcher dispatcher_;\n\n    \/\/! true if dispatcher needs to stop\n    std::atomic<bool> terminate_ { false };\n\n    \/\/! struct for timer callbacks\n    struct Timer\n    {\n        \/\/! timepoint of next timeout\n        steady_clock::time_point next_timeout;\n        \/\/! relative timeout for restarting\n        milliseconds             timeout;\n        \/\/! callback\n        TimerCallback            cb;\n\n        Timer(const steady_clock::time_point& _next_timeout,\n              const milliseconds& _timeout,\n              const TimerCallback& _cb)\n            : next_timeout(_next_timeout),\n              timeout(_timeout),\n              cb(_cb)\n        { }\n\n        bool operator < (const Timer& b) const\n        { return next_timeout < b.next_timeout; }\n    };\n\n    \/\/! priority queue of timer callbacks\n    typedef std::priority_queue<Timer> TimerPQ;\n\n    \/\/! priority queue of timer callbacks, obviously kept in timeout\n    \/\/! order. Currently not addressable.\n    TimerPQ timer_pq_;\n\n    \/**************************************************************************\/\n\n    class AsyncReadBuffer\n    {\n    public:\n        \/\/! Construct buffered reader with callback\n        AsyncReadBuffer(size_t buffer_size, const AsyncReadCallback& callback)\n            : callback_(callback),\n              buffer_(buffer_size)\n        { }\n\n        \/\/! Should be called when the socket is readable\n        bool operator () (Connection& c) {\n            int r = c.GetSocket().recv_one(\n                buffer_.data() + size_, buffer_.size() - size_);\n\n            if (r <= 0) {\n                \/\/ these errors are acceptable: just redo the recv later.\n                if (errno == EINTR || errno == EAGAIN) return true;\n\n                \/\/ signal artificial IsDone, for clean up.\n                size_ = buffer_.size();\n\n                \/\/ these errors are end-of-file indications (both good and bad)\n                if (errno == 0 || errno == EPIPE || errno == ECONNRESET) {\n                    if (callback_) callback_(c, Buffer());\n                    return false;\n                }\n                throw Exception(\"AsyncReadBuffer() error in recv\", errno);\n            }\n\n            size_ += r;\n\n            if (size_ == buffer_.size()) {\n                if (callback_) callback_(c, std::move(buffer_));\n                return false;\n            }\n            else {\n                return true;\n            }\n        }\n\n        bool IsDone() const { return size_ == buffer_.size(); }\n\n    private:\n        \/\/! total size currently read\n        size_t size_ = 0;\n\n        \/\/! functional object to call once data is complete\n        AsyncReadCallback callback_;\n\n        \/\/! Receive buffer\n        Buffer buffer_;\n    };\n\n    \/\/! deque of asynchronous readers\n    std::deque<AsyncReadBuffer> async_read_;\n\n    \/**************************************************************************\/\n\n    class AsyncWriteBuffer\n    {\n    public:\n        \/\/! Construct buffered writer with callback\n        AsyncWriteBuffer(Buffer&& buffer,\n                         const AsyncWriteCallback& callback)\n            : callback_(callback),\n              buffer_(std::move(buffer))\n        { }\n\n        \/\/! Should be called when the socket is writable\n        bool operator () (Connection& c) {\n            int r = c.GetSocket().send_one(\n                buffer_.data() + size_, buffer_.size() - size_);\n\n            if (r <= 0) {\n                if (errno == EINTR || errno == EAGAIN) return true;\n\n                \/\/ signal artificial IsDone, for clean up.\n                size_ = buffer_.size();\n\n                if (errno == EPIPE) {\n                    LOG1 << \"AsyncWriteBuffer() got SIGPIPE\";\n                    if (callback_) callback_(c);\n                    return false;\n                }\n                throw Exception(\"AsyncWriteBuffer() error in send\", errno);\n            }\n\n            size_ += r;\n\n            if (size_ == buffer_.size()) {\n                if (callback_) callback_(c);\n                return false;\n            }\n            else {\n                return true;\n            }\n        }\n\n        bool IsDone() const { return size_ == buffer_.size(); }\n\n    private:\n        \/\/! total size currently written\n        size_t size_ = 0;\n\n        \/\/! functional object to call once data is complete\n        AsyncWriteCallback callback_;\n\n        \/\/! Receive buffer\n        Buffer buffer_;\n    };\n\n    \/\/! deque of asynchronous writers\n    std::deque<AsyncWriteBuffer> async_write_;\n\n    \/**************************************************************************\/\n\n    \/\/! Default exception handler\n    static bool ExceptionCallback(Connection& s) {\n        \/\/ exception on listen socket ?\n        throw Exception(\n                  \"Dispatcher() exception on socket fd \"\n                  + std::to_string(s.GetSocket().fd()) + \"!\", errno);\n    }\n};\n\n\/\/! \\}\n\n} \/\/ namespace net\n} \/\/ namespace c7a\n\n#endif \/\/ !C7A_NET_DISPATCHER_HEADER\n\n\/******************************************************************************\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/ kate: indent-mode cstyle; indent-width 4; tab-width 4; space-indent false;\n\/\/ vim:ai ts=4 et\n\n\/\/FIXME - The rules allow for changing the goalie only in certain circumstances.  Make sure we do this right.\n\n#include \"Goalie.hpp\"\n\n#include <gameplay\/Play.hpp>\n#include <gameplay\/Window.hpp>\n#include <Geometry2d\/util.h>\n\n#include <boost\/foreach.hpp>\n\n#include <Constants.hpp>\n\n#include <iostream>\n\nusing namespace std;\nusing namespace Geometry2d;\n\nstatic const float MaxX = Field_GoalWidth \/ 2.0f;\n\nvoid Gameplay::Behaviors::Goalie::createConfiguration(Configuration *cfg) {\n\n}\n\nGameplay::Behaviors::Goalie::Goalie(GameplayModule *gameplay) :\n\t\t\t\tSingleRobotBehavior(gameplay), _kick(gameplay) {\n\t_win = new WindowEvaluator(_gameplay->state());\n\t_win->debug = true;\n\n\t_state = None;\n\t_previousState = None;\n\trobot = 0;\n\t_index = 0;\n\n}\n\nGameplay::Behaviors::Goalie::~Goalie() {\n\tdelete _win;\n}\n\nvoid Gameplay::Behaviors::Goalie::assign(set<OurRobot *> &available) {\n\tif (!robot) {\n\t\t\/\/ Take the robot nearest the goal\n\t\tassignNearest(robot, available, Geometry2d::Point());\n\t\tif (robot) {\n\t\t\tprintf(\"Goalie: no robot, took %d\\n\", robot->shell());\n\t\t} else {\n\t\t\t\/\/ \t\t\tprintf(\"Goalie: not assigned\\n\");\n\t\t}\n\t\t\/*\t} else if (robot && !robot->visible)\n\t\t{\n\t\t \/\/FIXME - Goalie replacement\n\t\t available.erase(robot);*\/\n\t} else {\n\t\t\/\/ Keep the current goalie, and prevent it from being used in a play\n\t\tavailable.erase(robot);\n\t}\n}\n\nbool Gameplay::Behaviors::Goalie::opponentsHavePossession() {\n\tif(opponentWithBall())\n\t\treturn true;\n\telse\n\t\treturn false;\n}\n\nfloat angleBetweenThreePoints(Point a, Point b, Point vertex)\n{\n\tfloat VA = sqrt(powf(vertex.x-a.x,2) + powf(vertex.y-a.y,2));\n\tfloat VB = sqrt(powf(vertex.x-b.x,2) + powf(vertex.y-b.y,2));\n\tfloat AB = sqrt(powf(a.x-b.x,2) + powf(a.y-b.y,2));\n\treturn acosf((VA*VA + VB*VB - AB*AB)\/(2*VA*VB));\n}\n\nRobot* Gameplay::Behaviors::Goalie::opponentWithBall()\n{\n\tRobot* closest = 0;\n\tfloat bestDist = 0;\n\tBOOST_FOREACH(Robot *r, state()->opp){\n\t\tfloat dist = r->pos.distTo(ball().pos);\n\t\tif (!closest || dist < bestDist)\n\t\t{\n\t\t\tclosest = r;\n\t\t\tbestDist = dist;\n\t\t}\n\t}\n\tfloat angle = 3.14 * (closest->angle \/ 180);\n\tfloat theta = angleBetweenThreePoints(Point(closest->pos.x + cos(angle), closest->pos.y + sin(angle)),ball().pos,closest->pos);\n\tfloat maxRadius = Robot_Diameter + Robot_Diameter*cos(theta);\n\t\/\/std::cout << theta << std::endl;\n\tif(closest && closest->pos.nearPoint(ball().pos, maxRadius))\n\t\treturn closest;\n\telse\n\t\treturn 0;\n}\n\nbool Gameplay::Behaviors::Goalie::ballIsMovingTowardsGoal()\n{\n\tSegment goalLine(Point(-MaxX, 0), Point(MaxX, 0));\n\tSegment ballPath(ball().pos, (ball().pos + 5*ball().vel.normalized()));\n\t\/\/if the ball is traveling towards the goal\n\treturn (ball().vel.magsq() > 0.02 && ballPath.intersects(goalLine));\n}\n\nbool Gameplay::Behaviors::Goalie::run()\n{\n\tif (!robot || !robot->visible)\n\t{\n\t\treturn true;\n\t}\n\n\t_kick.robot = robot;\n\n\tif(!ball().valid)\n\t\t_state = None;\n\telse if(gameState().theirPenalty() && !gameState().playing())\n\t\t_state = SetupPenalty;\n\telse if (ballIsMovingTowardsGoal())\n\t\t_state=Intercept;\n\telse if(ballIsInGoalieBox(ball().pos))\n\t\t_state = Clear;\n\telse if (opponentsHavePossession())\n\t\t_state = Block;\n\telse\n\t\t_state = Defend;\n\n\tif(_state != _previousState)\n\t\t_kick.restart();\n\n\t_previousState = _state;\n\n\n\trobot->face(ball().pos, true);\n\n\n\tswitch (_state)\n\t{\n\n\tcase Defend:\n\t{\n\t\trobot->addText(QString(\"State: Defend\"));\n\n\t\tfloat destx = ( ball().pos.x \/ Field_Width ) * MaxX;\n\n\t\trobot->move(Point(destx, Robot_Radius), true);\n\n\t}\n\tbreak;\n\n\tcase Block:\n\t{\n\t\trobot->addText(QString(\"State: Block\"));\n\n\t\tRobot* opposingKicker = opponentWithBall();\n\t\tLine shotLine = Line(opposingKicker->pos, ball().pos);\n\n\t\tCircle blockCircle = Circle(Point(0,0), Field_GoalWidth\/2.0f);\n\n\t\tPoint dest;\n\t\tif(blockCircle.intersects(shotLine, &dest)) {\n\t\t\t\/\/ shotLine intersects blockCircle\n\t\t\trobot->move(dest, true);\n\t\t} else {\n\t\t\t\/\/ shotLine does not intersect blockCircle\n\t\t\tLine blockLine = Line(Point(-MaxX,Robot_Radius), Point(MaxX,Robot_Radius));\n\t\t\tblockLine.intersects(shotLine, &dest);\n\t\t\tdest.x = min(MaxX, dest.x);\n\t\t\tdest.x = max(-MaxX, dest.x);\n\t\t\trobot->move(dest, true);\n\t\t}\n\t}\n\tbreak;\n\n\tcase Intercept:\n\t{\n\t\trobot->addText(QString(\"State: Intercept\"));\n\n\t\tSegment ballPath(ball().pos, (ball().pos + 10*ball().vel.normalized()));\n\t\tPoint dest;\n\t\tdest = ballPath.nearestPoint(robot->pos);\n\t\trobot->move(dest, true);\n\t}\n\tbreak;\n\n\tcase Clear:\n\t{\n\t\tif(_kick.done())\n\t\t\t_kick.restart();\n\t\trobot->addText(QString(\"State: Clear\"));\n\t\t\/\/Ball is in defense area, get it out of there.\n\t\trobot->dribble(50);\n\n\t\t_kick.forceChip = true;\n\n\t\t_kick.enableGoalLineShot = true;\n\t\t_kick.enableLeftDownfieldShot = true;\n\t\t_kick.enableRightDownfieldShot = true;\n\n\t\t_kick.run();\n\t}\n\tbreak;\n\n\tcase SetupPenalty:\n\t{\n\t\trobot->addText(QString(\"State: setupPenalty\"));\n\t\t\/\/ Touch the goal line, as required by the rules, and move to block the shot.\n\t\tRobot *penaltyKicker = 0;\n\t\tfloat smallestDist = 0;\n\t\tBOOST_FOREACH(Robot *r, state()->opp)\n\t\t{\n\t\t\tfloat dist = r->pos.distTo(Point(0,Field_PenaltyDist));\n\t\t\tif(!penaltyKicker || dist < smallestDist)\n\t\t\t{\n\t\t\t\tpenaltyKicker = r;\n\t\t\t\tsmallestDist = dist;\n\t\t\t}\n\t\t}\n\t\tfloat angle = 3.14 * (penaltyKicker->angle \/ 180);\n\t\tLine shotLine = Line(penaltyKicker->pos, Point(penaltyKicker->pos.x + cos(angle), penaltyKicker->pos.y + sin(angle)));\n\t\tSegment robotSegment = Segment(Point(-MaxX,Robot_Radius), Point(MaxX,Robot_Radius));\n\t\tPoint dest;\n\n\t\tif(shotLine.intersects(robotSegment, &dest))\n\t\t{\n\t\t\tdest.x = max(-MaxX + Robot_Radius, dest.x);\n\t\t\tdest.x = min( MaxX - Robot_Radius, dest.x);\n\t\t\trobot->move(dest, true);\n\t\t} else {\n\t\t\trobot->move(Point(0, Robot_Radius), true);\n\t\t}\n\t}\n\tbreak;\n\n\tcase None:\n\t{\n\t\trobot->addText(QString(\"State: None\"));\n\t\tif(abs(robot->pos.x) > Field_GoalWidth\/2.0f || robot->pos.y > Robot_Radius) {\n\t\t\trobot->move(Geometry2d::Point(0, Robot_Radius));\n\t\t}\n\t}\n\tbreak;\n\t}\n\n\/\/ ---------------------------------------------------------------------------------------------------------------------------------\n\n\t\/*\tif (!ball().valid) {\n\t\t\/\/FIXME - Stay where we are, if we are near the goal (done @matt)\n\t\tif(abs(robot->pos.x) > Field_GoalWidth\/2.0f || robot->pos.y > Robot_Radius + margin) {\n\t\t\trobot->move(Geometry2d::Point(0, Robot_Radius));\n\t\t}\n\t\treturn true;\n\t}\n\n\trobot->addText(QString(\"state %1\").arg(_state));\n\t\/\/if the ball is in the defense area, clear it\n\tif (_state == Clear) {\n\t\trobot->dribble(50);\n\n\t\tbool done = !_kick.run();\n\n\t\t\/\/If I've finished kicking, the ball rolled out of the goalie box, or the ball went into the goal, end \"Clear\" state\n\t\tif (done || !ballIsInGoalieBox(ball())) {\n\t\t\t_state = Defend;\n\t\t}\n\t} else if (_state == Defend) {\n\t\trobot->face(ball().pos);\n\n\t\tRobot* closest = 0;\n\t\tfloat bestDist = 0;\n\t\tBOOST_FOREACH(Robot *r, state()->opp){\n\t\t\tfloat dist = r->pos.distTo(ball().pos);\n\t\t\tif (!closest || dist < bestDist)\n\t\t\t{\n\t\t\t\tclosest = r;\n\t\t\t\tbestDist = dist;\n\t\t\t}\n\t\t}\n\n\t\t\/\/const Point goalBack(0,-Field_GoalDepth);\n\n\t\t\/\/goal line, for intersection detection\n\t\tSegment goalLine(Point(-MaxX, 0), Point(MaxX, 0));\n\n\t\t\/\/ Pick the largest available window between the ball and our goal, ignoring our goalie as an obstacle.\n\t\t_win->exclude.clear();\n\t\t_win->exclude.push_back(robot->pos);\n\t\t_win->run(ball().pos, goalLine);\n\t\tSegment shootWindow = (_win->best()) ? _win->best()->segment : _win->target();\n\n\t\tbool noShot = !_win->best(); \/\/ If true, then all possibilities have already been blocked\n\n\t\t\/\/default shot line\n\t\tSegment shootLine(shootWindow.center(), ball().pos);\n\n\t\tPoint windowCenter = shootWindow.center();\n\n\t\tSegment robotLine(Point(-Field_Width \/ 2.0, Robot_Radius), Point(Field_Width \/ 2.0, Robot_Radius));\n\n\t\tPoint dest;\n\t\trobotLine.intersects(shootLine, &dest);\n\n\t\tSegment seg1(shootWindow.pt[0], ball().pos);\n\t\tSegment seg2(shootWindow.pt[1], ball().pos);\n\n\t\tPoint pt[2];\n\t\trobotLine.intersects(seg1, &pt[0]);\n\t\trobotLine.intersects(seg2, &pt[1]);\n\n\t\tbool useCenter = noShot || (robot->pos.nearPoint(pt[0], .25) && robot->pos.nearPoint(pt[1], .25));\n\t\tbool setupPenalty = gameState().theirPenalty() && !gameState().playing();\n\t\tuseCenter |= setupPenalty;\n\n\t\tif (!useCenter) {\n\t\t\tdest = pt[_index];\n\n\t\t\tif (dest.nearPoint(robot->pos, .25)) {\n\t\t\t\t_index++;\n\t\t\t\t_index %= 2;\n\t\t\t}\n\n\t\t\tdest = pt[_index];\n\t\t\trobot->addText(\"useCenter\");\n\t\t}\n\n\t\tif (!setupPenalty) {\n\t\t\t\/\/if the ball is traveling towards the goal\n\t\t\tif (ball().vel.magsq() > 0.02 && ball().vel.dot(windowCenter - ball().pos) > 0) {\n\t\t\t\tshootLine = Segment(ball().pos, ball().pos + ball().vel.normalized() * 7.0);\n\t\t\t\trobot->faceNone();\n\n\n\t\t\t\tif (shootLine.intersects(shootWindow)) {\n\t\t\t\t\trobot->addText(\"case 1\");\n\t\t\t\t\t\/\/dest = shootLine.nearestPoint(robot->pos);\n\t\t\t\t\t\/\/ Move forward along the shotLine to block a narrower window.\n\t\t\t\t\tCircle circle = Circle(windowCenter, 0.5f);\n\t\t\t\t\tcircle.intersects(shootLine, &dest);\n\t\t\t\t}\n\n\t\t\t\trobot->dribble(50);\n\n\t\t\t} else if (ballIsInGoalieBox(ball())) {\n\t\t\t\t_state = Clear;\n\n\t\t\t} else if (closest && closest->pos.nearPoint(ball().pos, Robot_Diameter)) {\n\t\t\t\tPoint shootDir = Point::direction( closest->angle * DegreesToRadians);\n\n\t\t\t\tSegment closestShootLine = Segment(closest->pos, closest->pos + shootDir * 7.0);\n\n\t\t\t\tbool closestIntersect = closestShootLine.intersects(goalLine);\n\n\t\t\t\tshootLine = closestShootLine;\n\n\t\t\t\t\/\/dribble to catch just in case\n\t\t\t\trobot->dribble(20);\n\n\t\t\t\t\/\/if the shot will not go in the goal\n\t\t\t\t\/\/tend toward the side it will go to\n\t\t\t\tif (!closestIntersect) {\n\t\t\t\t\t\/\/no need to dribble yet\n\t\t\t\t\trobot->dribble(0);\n\n\t\t\t\t\t\/\/the shoot line does not intersect\n\t\t\t\t\t\/\/but we still want to protect the left or right side\n\t\t\t\t\tSegment baseLine(Point(-Field_Width \/ 2.0, 0), Point(Field_Width \/ 2.0, 0));\n\n\t\t\t\t\tPoint intersectPoint;\n\t\t\t\t\tif (baseLine.intersects(closestShootLine, &intersectPoint)) {\n\t\t\t\t\t\tintersectPoint.y += Robot_Radius;\n\n\t\t\t\t\t\tif (intersectPoint.x > MaxX) {\n\t\t\t\t\t\t\tintersectPoint.x = MaxX;\n\t\t\t\t\t\t} else if (intersectPoint.x < -MaxX) {\n\t\t\t\t\t\t\tintersectPoint.x = -MaxX;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif (shootLine.intersects(goalLine)) {\n\t\t\t\t\trobot->addText(\"case 2\");\n\t\t\t\t\tdest = shootLine.nearestPoint(robot->pos);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t\/\/goalie should not go into the goal\n\t\t\/\/vision can loose sight\n\t\tif (dest.y < Robot_Radius + margin) {\n\t\t\trobot->addText(\"case 3\");\n\t\t\tdest.y = Robot_Radius + margin;\n\t\t}\n\n\t\tif (dest.x > MaxX) {\n\t\t\trobot->addText(\"case 4\");\n\t\t\tdest.x = MaxX;\n\t\t} else if (dest.x < -MaxX) {\n\t\t\trobot->addText(\"case 5\");\n\t\t\tdest.x = -MaxX;\n\t\t}\n\n\t\tstate()->drawLine(robot->pos, dest, Qt::white);\n\t\trobot->move(dest);\n\n\t\t\/\/clear the kick behavior\n\t\t_kick.restart();\n\t}\n\t *\/\n\treturn true;\n}\n<commit_msg>Fixes bugs in Goalie's clear state.<commit_after>\/\/ kate: indent-mode cstyle; indent-width 4; tab-width 4; space-indent false;\n\/\/ vim:ai ts=4 et\n\n\/\/FIXME - The rules allow for changing the goalie only in certain circumstances.  Make sure we do this right.\n\n#include \"Goalie.hpp\"\n\n#include <gameplay\/Play.hpp>\n#include <gameplay\/Window.hpp>\n#include <Geometry2d\/util.h>\n\n#include <boost\/foreach.hpp>\n\n#include <Constants.hpp>\n\n#include <iostream>\n\nusing namespace std;\nusing namespace Geometry2d;\n\nstatic const float MaxX = Field_GoalWidth \/ 2.0f;\n\nvoid Gameplay::Behaviors::Goalie::createConfiguration(Configuration *cfg) {\n\n}\n\nGameplay::Behaviors::Goalie::Goalie(GameplayModule *gameplay) :\n\t\t\t\tSingleRobotBehavior(gameplay), _kick(gameplay) {\n\t_win = new WindowEvaluator(_gameplay->state());\n\t_win->debug = true;\n\n\t_state = None;\n\t_previousState = None;\n\trobot = 0;\n\t_index = 0;\n\n}\n\nGameplay::Behaviors::Goalie::~Goalie() {\n\tdelete _win;\n}\n\nvoid Gameplay::Behaviors::Goalie::assign(set<OurRobot *> &available) {\n\tif (!robot) {\n\t\t\/\/ Take the robot nearest the goal\n\t\tassignNearest(robot, available, Geometry2d::Point());\n\t\tif (robot) {\n\t\t\tprintf(\"Goalie: no robot, took %d\\n\", robot->shell());\n\t\t} else {\n\t\t\t\/\/ \t\t\tprintf(\"Goalie: not assigned\\n\");\n\t\t}\n\t\t\/*\t} else if (robot && !robot->visible)\n\t\t{\n\t\t \/\/FIXME - Goalie replacement\n\t\t available.erase(robot);*\/\n\t} else {\n\t\t\/\/ Keep the current goalie, and prevent it from being used in a play\n\t\tavailable.erase(robot);\n\t}\n}\n\nbool Gameplay::Behaviors::Goalie::opponentsHavePossession() {\n\tif(opponentWithBall())\n\t\treturn true;\n\telse\n\t\treturn false;\n}\n\nfloat angleBetweenThreePoints(Point a, Point b, Point vertex)\n{\n\tfloat VA = sqrt(powf(vertex.x-a.x,2) + powf(vertex.y-a.y,2));\n\tfloat VB = sqrt(powf(vertex.x-b.x,2) + powf(vertex.y-b.y,2));\n\tfloat AB = sqrt(powf(a.x-b.x,2) + powf(a.y-b.y,2));\n\treturn acosf((VA*VA + VB*VB - AB*AB)\/(2*VA*VB));\n}\n\nRobot* Gameplay::Behaviors::Goalie::opponentWithBall()\n{\n\tRobot* closest = 0;\n\tfloat bestDist = 0;\n\tBOOST_FOREACH(Robot *r, state()->opp){\n\t\tfloat dist = r->pos.distTo(ball().pos);\n\t\tif (!closest || dist < bestDist)\n\t\t{\n\t\t\tclosest = r;\n\t\t\tbestDist = dist;\n\t\t}\n\t}\n\tfloat angle = 3.14 * (closest->angle \/ 180);\n\tfloat theta = angleBetweenThreePoints(Point(closest->pos.x + cos(angle), closest->pos.y + sin(angle)),ball().pos,closest->pos);\n\tfloat maxRadius = Robot_Diameter + Robot_Diameter*cos(theta);\n\t\/\/std::cout << theta << std::endl;\n\tif(closest && closest->pos.nearPoint(ball().pos, maxRadius))\n\t\treturn closest;\n\telse\n\t\treturn 0;\n}\n\nbool Gameplay::Behaviors::Goalie::ballIsMovingTowardsGoal()\n{\n\tSegment goalLine(Point(-MaxX, 0), Point(MaxX, 0));\n\tSegment ballPath(ball().pos, (ball().pos + 5*ball().vel.normalized()));\n\t\/\/if the ball is traveling towards the goal\n\treturn (ball().vel.magsq() > 0.02 && ballPath.intersects(goalLine));\n}\n\nbool Gameplay::Behaviors::Goalie::run()\n{\n\tif (!robot || !robot->visible)\n\t{\n\t\treturn true;\n\t}\n\n\t_kick.robot = robot;\n\n\tif(!ball().valid)\n\t\t_state = None;\n\telse if(gameState().theirPenalty() && !gameState().playing())\n\t\t_state = SetupPenalty;\n\telse if (ballIsMovingTowardsGoal())\n\t\t_state=Intercept;\n\telse if(ballIsInGoalieBox(ball().pos))\n\t\t_state = Clear;\n\telse if (opponentsHavePossession())\n\t\t_state = Block;\n\telse\n\t\t_state = Defend;\n\n\tif(_state != _previousState)\n\t\t_kick.restart();\n\n\t_previousState = _state;\n\n\n\trobot->face(ball().pos, true);\n\n\n\tswitch (_state)\n\t{\n\n\tcase Defend:\n\t{\n\t\trobot->addText(QString(\"State: Defend\"));\n\n\t\tfloat destx = ( ball().pos.x \/ Field_Width ) * MaxX;\n\n\t\trobot->move(Point(destx, Robot_Radius), true);\n\n\t}\n\tbreak;\n\n\tcase Block:\n\t{\n\t\trobot->addText(QString(\"State: Block\"));\n\n\t\tRobot* opposingKicker = opponentWithBall();\n\t\tLine shotLine = Line(opposingKicker->pos, ball().pos);\n\n\t\tCircle blockCircle = Circle(Point(0,0), Field_GoalWidth\/2.0f);\n\n\t\tPoint dest;\n\t\tif(blockCircle.intersects(shotLine, &dest)) {\n\t\t\t\/\/ shotLine intersects blockCircle\n\t\t\trobot->move(dest, true);\n\t\t} else {\n\t\t\t\/\/ shotLine does not intersect blockCircle\n\t\t\tLine blockLine = Line(Point(-MaxX,Robot_Radius), Point(MaxX,Robot_Radius));\n\t\t\tblockLine.intersects(shotLine, &dest);\n\t\t\tdest.x = min(MaxX, dest.x);\n\t\t\tdest.x = max(-MaxX, dest.x);\n\t\t\trobot->move(dest, true);\n\t\t}\n\t}\n\tbreak;\n\n\tcase Intercept:\n\t{\n\t\trobot->addText(QString(\"State: Intercept\"));\n\n\t\tSegment ballPath(ball().pos, (ball().pos + 10*ball().vel.normalized()));\n\t\tPoint dest;\n\t\tdest = ballPath.nearestPoint(robot->pos);\n\t\trobot->move(dest, true);\n\t}\n\tbreak;\n\n\tcase Clear:\n\t{\n\t\tPoint target = ball().pos.normalized() * 10;\n\t\tif(_kick.done())\n\t\t\t_kick.restart();\n\t\trobot->addText(QString(\"State: Clear\"));\n\t\t\/\/Ball is in defense area, get it out of there.\n\t\trobot->dribble(50);\n\n\t\t_kick.setTarget(Segment(target, target));\n\t\tif(robot->chipper_available())\n\t\t{\n\t\t\t_kick.forceChip = true;\n\t\t\t_kick.use_chipper = true;\n\t\t}\n\t\t_kick.use_line_kick = true;\n\n\t\t_kick.enableGoalLineShot = true;\n\t\t_kick.enableLeftDownfieldShot = true;\n\t\t_kick.enableRightDownfieldShot = true;\n\n\t\t_kick.run();\n\t}\n\tbreak;\n\n\tcase SetupPenalty:\n\t{\n\t\trobot->addText(QString(\"State: setupPenalty\"));\n\t\t\/\/ Touch the goal line, as required by the rules, and move to block the shot.\n\t\tRobot *penaltyKicker = 0;\n\t\tfloat smallestDist = 0;\n\t\tBOOST_FOREACH(Robot *r, state()->opp)\n\t\t{\n\t\t\tfloat dist = r->pos.distTo(Point(0,Field_PenaltyDist));\n\t\t\tif(!penaltyKicker || dist < smallestDist)\n\t\t\t{\n\t\t\t\tpenaltyKicker = r;\n\t\t\t\tsmallestDist = dist;\n\t\t\t}\n\t\t}\n\t\tfloat angle = 3.14 * (penaltyKicker->angle \/ 180);\n\t\tLine shotLine = Line(penaltyKicker->pos, Point(penaltyKicker->pos.x + cos(angle), penaltyKicker->pos.y + sin(angle)));\n\t\tSegment robotSegment = Segment(Point(-MaxX,Robot_Radius), Point(MaxX,Robot_Radius));\n\t\tPoint dest;\n\n\t\tif(shotLine.intersects(robotSegment, &dest))\n\t\t{\n\t\t\tdest.x = max(-MaxX + Robot_Radius, dest.x);\n\t\t\tdest.x = min( MaxX - Robot_Radius, dest.x);\n\t\t\trobot->move(dest, true);\n\t\t} else {\n\t\t\trobot->move(Point(0, Robot_Radius), true);\n\t\t}\n\t}\n\tbreak;\n\n\tcase None:\n\t{\n\t\trobot->addText(QString(\"State: None\"));\n\t\tif(abs(robot->pos.x) > Field_GoalWidth\/2.0f || robot->pos.y > Robot_Radius) {\n\t\t\trobot->move(Geometry2d::Point(0, Robot_Radius));\n\t\t}\n\t}\n\tbreak;\n\t}\n\n\/\/ ---------------------------------------------------------------------------------------------------------------------------------\n\n\t\/*\tif (!ball().valid) {\n\t\t\/\/FIXME - Stay where we are, if we are near the goal (done @matt)\n\t\tif(abs(robot->pos.x) > Field_GoalWidth\/2.0f || robot->pos.y > Robot_Radius + margin) {\n\t\t\trobot->move(Geometry2d::Point(0, Robot_Radius));\n\t\t}\n\t\treturn true;\n\t}\n\n\trobot->addText(QString(\"state %1\").arg(_state));\n\t\/\/if the ball is in the defense area, clear it\n\tif (_state == Clear) {\n\t\trobot->dribble(50);\n\n\t\tbool done = !_kick.run();\n\n\t\t\/\/If I've finished kicking, the ball rolled out of the goalie box, or the ball went into the goal, end \"Clear\" state\n\t\tif (done || !ballIsInGoalieBox(ball())) {\n\t\t\t_state = Defend;\n\t\t}\n\t} else if (_state == Defend) {\n\t\trobot->face(ball().pos);\n\n\t\tRobot* closest = 0;\n\t\tfloat bestDist = 0;\n\t\tBOOST_FOREACH(Robot *r, state()->opp){\n\t\t\tfloat dist = r->pos.distTo(ball().pos);\n\t\t\tif (!closest || dist < bestDist)\n\t\t\t{\n\t\t\t\tclosest = r;\n\t\t\t\tbestDist = dist;\n\t\t\t}\n\t\t}\n\n\t\t\/\/const Point goalBack(0,-Field_GoalDepth);\n\n\t\t\/\/goal line, for intersection detection\n\t\tSegment goalLine(Point(-MaxX, 0), Point(MaxX, 0));\n\n\t\t\/\/ Pick the largest available window between the ball and our goal, ignoring our goalie as an obstacle.\n\t\t_win->exclude.clear();\n\t\t_win->exclude.push_back(robot->pos);\n\t\t_win->run(ball().pos, goalLine);\n\t\tSegment shootWindow = (_win->best()) ? _win->best()->segment : _win->target();\n\n\t\tbool noShot = !_win->best(); \/\/ If true, then all possibilities have already been blocked\n\n\t\t\/\/default shot line\n\t\tSegment shootLine(shootWindow.center(), ball().pos);\n\n\t\tPoint windowCenter = shootWindow.center();\n\n\t\tSegment robotLine(Point(-Field_Width \/ 2.0, Robot_Radius), Point(Field_Width \/ 2.0, Robot_Radius));\n\n\t\tPoint dest;\n\t\trobotLine.intersects(shootLine, &dest);\n\n\t\tSegment seg1(shootWindow.pt[0], ball().pos);\n\t\tSegment seg2(shootWindow.pt[1], ball().pos);\n\n\t\tPoint pt[2];\n\t\trobotLine.intersects(seg1, &pt[0]);\n\t\trobotLine.intersects(seg2, &pt[1]);\n\n\t\tbool useCenter = noShot || (robot->pos.nearPoint(pt[0], .25) && robot->pos.nearPoint(pt[1], .25));\n\t\tbool setupPenalty = gameState().theirPenalty() && !gameState().playing();\n\t\tuseCenter |= setupPenalty;\n\n\t\tif (!useCenter) {\n\t\t\tdest = pt[_index];\n\n\t\t\tif (dest.nearPoint(robot->pos, .25)) {\n\t\t\t\t_index++;\n\t\t\t\t_index %= 2;\n\t\t\t}\n\n\t\t\tdest = pt[_index];\n\t\t\trobot->addText(\"useCenter\");\n\t\t}\n\n\t\tif (!setupPenalty) {\n\t\t\t\/\/if the ball is traveling towards the goal\n\t\t\tif (ball().vel.magsq() > 0.02 && ball().vel.dot(windowCenter - ball().pos) > 0) {\n\t\t\t\tshootLine = Segment(ball().pos, ball().pos + ball().vel.normalized() * 7.0);\n\t\t\t\trobot->faceNone();\n\n\n\t\t\t\tif (shootLine.intersects(shootWindow)) {\n\t\t\t\t\trobot->addText(\"case 1\");\n\t\t\t\t\t\/\/dest = shootLine.nearestPoint(robot->pos);\n\t\t\t\t\t\/\/ Move forward along the shotLine to block a narrower window.\n\t\t\t\t\tCircle circle = Circle(windowCenter, 0.5f);\n\t\t\t\t\tcircle.intersects(shootLine, &dest);\n\t\t\t\t}\n\n\t\t\t\trobot->dribble(50);\n\n\t\t\t} else if (ballIsInGoalieBox(ball())) {\n\t\t\t\t_state = Clear;\n\n\t\t\t} else if (closest && closest->pos.nearPoint(ball().pos, Robot_Diameter)) {\n\t\t\t\tPoint shootDir = Point::direction( closest->angle * DegreesToRadians);\n\n\t\t\t\tSegment closestShootLine = Segment(closest->pos, closest->pos + shootDir * 7.0);\n\n\t\t\t\tbool closestIntersect = closestShootLine.intersects(goalLine);\n\n\t\t\t\tshootLine = closestShootLine;\n\n\t\t\t\t\/\/dribble to catch just in case\n\t\t\t\trobot->dribble(20);\n\n\t\t\t\t\/\/if the shot will not go in the goal\n\t\t\t\t\/\/tend toward the side it will go to\n\t\t\t\tif (!closestIntersect) {\n\t\t\t\t\t\/\/no need to dribble yet\n\t\t\t\t\trobot->dribble(0);\n\n\t\t\t\t\t\/\/the shoot line does not intersect\n\t\t\t\t\t\/\/but we still want to protect the left or right side\n\t\t\t\t\tSegment baseLine(Point(-Field_Width \/ 2.0, 0), Point(Field_Width \/ 2.0, 0));\n\n\t\t\t\t\tPoint intersectPoint;\n\t\t\t\t\tif (baseLine.intersects(closestShootLine, &intersectPoint)) {\n\t\t\t\t\t\tintersectPoint.y += Robot_Radius;\n\n\t\t\t\t\t\tif (intersectPoint.x > MaxX) {\n\t\t\t\t\t\t\tintersectPoint.x = MaxX;\n\t\t\t\t\t\t} else if (intersectPoint.x < -MaxX) {\n\t\t\t\t\t\t\tintersectPoint.x = -MaxX;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif (shootLine.intersects(goalLine)) {\n\t\t\t\t\trobot->addText(\"case 2\");\n\t\t\t\t\tdest = shootLine.nearestPoint(robot->pos);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t\/\/goalie should not go into the goal\n\t\t\/\/vision can loose sight\n\t\tif (dest.y < Robot_Radius + margin) {\n\t\t\trobot->addText(\"case 3\");\n\t\t\tdest.y = Robot_Radius + margin;\n\t\t}\n\n\t\tif (dest.x > MaxX) {\n\t\t\trobot->addText(\"case 4\");\n\t\t\tdest.x = MaxX;\n\t\t} else if (dest.x < -MaxX) {\n\t\t\trobot->addText(\"case 5\");\n\t\t\tdest.x = -MaxX;\n\t\t}\n\n\t\tstate()->drawLine(robot->pos, dest, Qt::white);\n\t\trobot->move(dest);\n\n\t\t\/\/clear the kick behavior\n\t\t_kick.restart();\n\t}\n\t *\/\n\treturn true;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef HUMPConfig_HPP\n#define HUMPConfig_HPP\n\n#include <string>\n#include <cstring>\n#include <cstdlib>\n#include <stdexcept>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n#include <list>\n#include <vector>\n#include <cmath>\n#include <boost\/smart_ptr.hpp>\n#include <boost\/numeric\/ublas\/storage.hpp>\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/algorithm\/string\/replace.hpp>\n#include <boost\/format.hpp>\n#include <fstream>\n#include <eigen3\/Eigen\/Dense>\n\n#include \"..\/config\/config.hpp\"\n#include \"object.hpp\"\n\n\n\n\/** version of the library *\/\n#define HUMP_VERSION_MAJOR 2\n#define HUMP_VERSION_MINOR 0\n\n\n\/\/definition of the macro ASSERT\n#ifndef DEBUG\n    #define ASSERT(x)\n#else\n    #define ASSERT(x) \\\n             if (! (x)) \\\n            { \\\n               cout << \"ERROR!! Assert \" << #x << \" failed\\n\"; \\\n               cout << \" on line \" << __LINE__  << \"\\n\"; \\\n               cout << \" in file \" << __FILE__ << \"\\n\";  \\\n            }\n#endif\n\n\nusing namespace std;\nusing namespace Eigen;\n\n\/** This is the main namespace of the library *\/\nnamespace HUMotion{\n\ntypedef boost::shared_ptr<Object> objectPtr;\/**< shared pointer to an object in the scenario *\/\n\nconst double PHI = (-log(2.0)\/log(TB));\/**< parameter to control when the bounce posture is reached *\/\nconst double AP = 30.0*static_cast<double>(M_PI)\/180; \/**< aperture of the fingers when approaching to pick [rad] *\/\n\nconst double BLANK_PERCENTAGE = 0.15; \/**< percentage of steps to eliminate when either reaching to grasp an object OR move at the beginning of a move movement [0,1]*\/\n\nconst int N_STEP_MIN = 5; \/**< minimum number of steps *\/\nconst int N_STEP_MAX = 100; \/**< maximum number of steps *\/\n\nconst double W_RED_MIN = 1; \/**< minimum value of angular velocity reduction when approaching *\/\nconst double W_RED_MAX = 15; \/**< maximum value of angular velocity reduction when approaching *\/\n\n\/** this struct defines the Denavit-Hartenberg kinematic parameters *\/\ntypedef struct{\n    vector<double> d; \/**< distances between consecutive frames along the y axes in [mm] *\/\n    vector<double> a; \/**< distances between concecutive frames along the z axes in [mm] *\/\n    vector<double> alpha; \/**< angle around the x axes between consecutive z axes in [rad] *\/\n    vector<double> theta; \/**< angle around the z axes between consecutive x axes in [rad] *\/\n} DHparameters;\n\n\/** this struct defines the barrett hand *\/\ntypedef struct{\n    double maxAperture; \/**< [mm] max aperture of the hand in [mm] *\/\n    double Aw; \/**< smallest distance between F1 and F2 in [mm] *\/\n    double A1; \/**< length of the 1st part of the finger in [mm] *\/\n    double A2; \/**< length of the first phalax in [mm] *\/\n    double A3; \/**< length of the second phalax in [mm] *\/\n    double D3; \/**< depth of the fingertip in [mm] *\/\n    double phi2; \/**< angular displacement between the 1st part of the finger and the 1st phalax in [rad] *\/\n    double phi3; \/**< angular displacement between the 1st and the 2nd phalax in [rad] *\/\n    vector<int> rk; \/**< r parameters of the barrett hand *\/\n    vector<int> jk; \/**< j parameters of the barrett hand *\/\n} BarrettHand;\n\n\/** this struct defines a human finger *\/\ntypedef struct{\n    double ux; \/**<  position of the finger with respect to the center of the palm along the x axis in [mm] *\/\n    double uy; \/**<  position of the finger with respect to the center of the palm along the y axis in [mm] *\/\n    double uz; \/**<  position of the finger with respect to the center of the palm along the z axis in [mm] *\/\n    DHparameters finger_specs; \/**< the Denavit-Hartenberg parameters of the finger *\/\n} HumanFinger;\n\n\/** this struct defines a human thumb *\/\ntypedef struct{\n    double uTx; \/**<  position of the thumb with respect to the center of the palm along the x axis in [mm] *\/\n    double uTy; \/**<  position of the thumb with respect to the center of the palm along the y axis in [mm] *\/\n    double uTz; \/**<  position of the thumb with respect to the center of the palm along the z axis in [mm] *\/\n    DHparameters thumb_specs; \/**< the Denavit-Hartenberg parameters of the thumb *\/\n} HumanThumb;\n\n\/** this struct defines a human hand *\/\ntypedef struct{\n  vector<HumanFinger> fingers; \/**< fingers of the hand *\/\n  HumanThumb thumb; \/**<  thumb of the hand *\/\n  double maxAperture; \/**< max aperture of the hand in [mm] *\/\n} HumanHand;\n\n\/** this struct defines the parameters of the movement *\/\ntypedef struct{\n    int arm_code; \/**< the code of the arm: 0 = both arms, 1 = right arm, 2 = left arm *\/\n    int hand_code;\/**< the code of the hand: 0 = human hand, 1 = barrett hand *\/\n    int griptype; \/**< the type of the grip *\/\n    string mov_infoline; \/**< description of the movement *\/\n    double dHO;\/**< distanche hand-target*\/\n    std::vector<double> finalHand;\/**< final posture of the hand *\/\n    std::vector<double> target;\/**< target \/ location to reach: target(0)=x, target(1)=y, target(2)=z, target(3)=roll, target(4)=pitch, target(6)=yaw,*\/\n    objectPtr obj; \/**< object involved in the movement. The info of the object have to be updated according to the selected movement *\/\n    bool approach;\/**< true to use the approach options, false otherwise  *\/\n    bool retreat;\/**< true to use the retreat options, false otherwise *\/\n    std::vector<double> pre_grasp_approach; \/**< (0)= x component, (1)= y component, (2)= z component, (3)= distance from the target*\/\n    std::vector<double> post_grasp_retreat; \/**< (0)= x component, (1)= y component, (2)= z component, (3)= distance from the target*\/\n    std::vector<double> pre_place_approach; \/**< (0)= x component, (1)= y component, (2)= z component, (3)= distance from the target*\/\n    std::vector<double> post_place_retreat; \/**< (0)= x component, (1)= y component, (2)= z component, (3)= distance from the target*\/\n    bool rand_init; \/**< true to select randon initialization in \"plan\" stages *\/\n    bool coll; \/**< true to enable collisions with the environment (body of the robot included) *\/\n    bool use_move_plane; \/**< true to constrain the end-effector to move on a plane in move movements, false otherwise*\/\n    std::vector<double> plane_params; \/**< plane cartesian parameters in move movements: a*x+b*y+c*z+d=0. a=plane_params(0), b=plane_params(1), c=plane_params(2), d=plane_params(3) *\/\n}mov_params;\n\/** this struct defines the boundary conditions of the movement*\/\ntypedef struct{\n    vector<double> vel_0; \/**< initial velocity of the joints in [rad\/s] *\/\n    vector<double> vel_f; \/**< final velocity of the joints in [rad\/s] *\/\n    vector<double> acc_0; \/**< initial acceleration of the joints in [rad\/s²] *\/\n    vector<double> acc_f; \/**< final acceleration of the joints in [rad\/s²] *\/\n} boundaryConditions;\n\n\/** this struct defines the tolerances that have to be set before planning the trajectory*\/\ntypedef struct{\n    mov_params mov_specs; \/**< specifications of the movement *\/\n    vector<double> tolsArm; \/**< radius of the spheres along the arm in [mm] *\/\n    MatrixXd tolsHand; \/**< radius of the spheres along the fingers in [mm] *\/\n    MatrixXd final_tolsObstacles; \/**< tolerances of the final posture against the obstacles in [mm] *\/\n    vector< MatrixXd > singleArm_tolsTarget; \/**< tolerances of the trajectory against the target in [mm] *\/\n    vector< MatrixXd > singleArm_tolsObstacles; \/**< tolerances of the trajectory against the obstacles in [mm] *\/\n    double tolTarPos; \/**< tolerance of the final position of the hand against the target in [mm] *\/\n    double tolTarOr; \/**< tolerance of the final orientation of the hand against the target in [mm] *\/\n    boundaryConditions bounds; \/**< boundary condistions of the bounce problem *\/\n    vector<double> vel_approach; \/**< velocity of the joints in [rad\/s] at the beginning of the approach stage *\/\n    vector<double> acc_approach; \/**< acceleration of the joints in [rad\/s²] at the beginning of the approach stage *\/\n    vector<double> lambda_final; \/**< weights for the final posture optimization *\/\n    vector<double> lambda_bounce; \/**< weights for the bounce posture optimization *\/\n    vector<double> w_max; \/**< maximum angular velocity for each joint [rad\/s] *\/\n    bool obstacle_avoidance; \/**< true to avoid obstacle *\/\n    bool target_avoidance; \/**< true to avoid the target during the motion *\/\n} hump_params;\n\n\/** This struct defines the result of the planned trajectory *\/\ntypedef struct{\n    int mov_type;\/**< type of the planned movement *\/\n    int status;\/**< status code of the planning *\/\n    string status_msg;\/**< status message of the planning *\/\n    string object_id;\/**< identity of the object involved in the movement *\/\n    vector<MatrixXd> trajectory_stages;\/**< sequence of the trajectories *\/\n    vector<MatrixXd> velocity_stages;\/**< sequence of the velocities *\/\n    vector<MatrixXd> acceleration_stages;\/**< sequence of the accelerations *\/\n    vector<double> time_steps; \/**< sequence of each time steps for each trajectory *\/\n    vector<string> trajectory_descriptions;\/**< description of the trajectories *\/\n}planning_result;\n\n\n\n} \/\/ namespace HUMotion\n\n\n\n\n#endif \/\/ HUMPConfig_HPP\n<commit_msg>minor changes<commit_after>#ifndef HUMPConfig_HPP\n#define HUMPConfig_HPP\n\n#include <string>\n#include <cstring>\n#include <cstdlib>\n#include <stdexcept>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n#include <list>\n#include <vector>\n#include <cmath>\n#include <boost\/smart_ptr.hpp>\n#include <boost\/numeric\/ublas\/storage.hpp>\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/algorithm\/string\/replace.hpp>\n#include <boost\/format.hpp>\n#include <fstream>\n#include <eigen3\/Eigen\/Dense>\n\n#include \"..\/config\/config.hpp\"\n#include \"object.hpp\"\n\n\n\n\/** version of the library *\/\n#define HUMP_VERSION_MAJOR 2\n#define HUMP_VERSION_MINOR 0\n\n\n\/\/definition of the macro ASSERT\n#ifndef DEBUG\n    #define ASSERT(x)\n#else\n    #define ASSERT(x) \\\n             if (! (x)) \\\n            { \\\n               cout << \"ERROR!! Assert \" << #x << \" failed\\n\"; \\\n               cout << \" on line \" << __LINE__  << \"\\n\"; \\\n               cout << \" in file \" << __FILE__ << \"\\n\";  \\\n            }\n#endif\n\n\nusing namespace std;\nusing namespace Eigen;\n\n\/** This is the main namespace of the library *\/\nnamespace HUMotion{\n\ntypedef boost::shared_ptr<Object> objectPtr;\/**< shared pointer to an object in the scenario *\/\n\nconst double PHI = (-log(2.0)\/log(TB));\/**< parameter to control when the bounce posture is reached *\/\nconst double AP = 30.0*static_cast<double>(M_PI)\/180; \/**< aperture of the fingers when approaching to pick [rad] *\/\n\nconst double BLANK_PERCENTAGE = 0.15; \/**< percentage of steps to eliminate when either reaching to grasp an object OR move at the beginning of a move movement [0,1]*\/\n\nconst int N_STEP_MIN = 5; \/**< minimum number of steps *\/\nconst int N_STEP_MAX = 50; \/**< maximum number of steps *\/\n\nconst double W_RED_MIN = 1; \/**< minimum value of angular velocity reduction when approaching *\/\nconst double W_RED_MAX = 15; \/**< maximum value of angular velocity reduction when approaching *\/\n\n\/** this struct defines the Denavit-Hartenberg kinematic parameters *\/\ntypedef struct{\n    vector<double> d; \/**< distances between consecutive frames along the y axes in [mm] *\/\n    vector<double> a; \/**< distances between concecutive frames along the z axes in [mm] *\/\n    vector<double> alpha; \/**< angle around the x axes between consecutive z axes in [rad] *\/\n    vector<double> theta; \/**< angle around the z axes between consecutive x axes in [rad] *\/\n} DHparameters;\n\n\/** this struct defines the barrett hand *\/\ntypedef struct{\n    double maxAperture; \/**< [mm] max aperture of the hand in [mm] *\/\n    double Aw; \/**< smallest distance between F1 and F2 in [mm] *\/\n    double A1; \/**< length of the 1st part of the finger in [mm] *\/\n    double A2; \/**< length of the first phalax in [mm] *\/\n    double A3; \/**< length of the second phalax in [mm] *\/\n    double D3; \/**< depth of the fingertip in [mm] *\/\n    double phi2; \/**< angular displacement between the 1st part of the finger and the 1st phalax in [rad] *\/\n    double phi3; \/**< angular displacement between the 1st and the 2nd phalax in [rad] *\/\n    vector<int> rk; \/**< r parameters of the barrett hand *\/\n    vector<int> jk; \/**< j parameters of the barrett hand *\/\n} BarrettHand;\n\n\/** this struct defines a human finger *\/\ntypedef struct{\n    double ux; \/**<  position of the finger with respect to the center of the palm along the x axis in [mm] *\/\n    double uy; \/**<  position of the finger with respect to the center of the palm along the y axis in [mm] *\/\n    double uz; \/**<  position of the finger with respect to the center of the palm along the z axis in [mm] *\/\n    DHparameters finger_specs; \/**< the Denavit-Hartenberg parameters of the finger *\/\n} HumanFinger;\n\n\/** this struct defines a human thumb *\/\ntypedef struct{\n    double uTx; \/**<  position of the thumb with respect to the center of the palm along the x axis in [mm] *\/\n    double uTy; \/**<  position of the thumb with respect to the center of the palm along the y axis in [mm] *\/\n    double uTz; \/**<  position of the thumb with respect to the center of the palm along the z axis in [mm] *\/\n    DHparameters thumb_specs; \/**< the Denavit-Hartenberg parameters of the thumb *\/\n} HumanThumb;\n\n\/** this struct defines a human hand *\/\ntypedef struct{\n  vector<HumanFinger> fingers; \/**< fingers of the hand *\/\n  HumanThumb thumb; \/**<  thumb of the hand *\/\n  double maxAperture; \/**< max aperture of the hand in [mm] *\/\n} HumanHand;\n\n\/** this struct defines the parameters of the movement *\/\ntypedef struct{\n    int arm_code; \/**< the code of the arm: 0 = both arms, 1 = right arm, 2 = left arm *\/\n    int hand_code;\/**< the code of the hand: 0 = human hand, 1 = barrett hand *\/\n    int griptype; \/**< the type of the grip *\/\n    string mov_infoline; \/**< description of the movement *\/\n    double dHO;\/**< distanche hand-target*\/\n    std::vector<double> finalHand;\/**< final posture of the hand *\/\n    std::vector<double> target;\/**< target \/ location to reach: target(0)=x, target(1)=y, target(2)=z, target(3)=roll, target(4)=pitch, target(6)=yaw,*\/\n    objectPtr obj; \/**< object involved in the movement. The info of the object have to be updated according to the selected movement *\/\n    bool approach;\/**< true to use the approach options, false otherwise  *\/\n    bool retreat;\/**< true to use the retreat options, false otherwise *\/\n    std::vector<double> pre_grasp_approach; \/**< (0)= x component, (1)= y component, (2)= z component, (3)= distance from the target*\/\n    std::vector<double> post_grasp_retreat; \/**< (0)= x component, (1)= y component, (2)= z component, (3)= distance from the target*\/\n    std::vector<double> pre_place_approach; \/**< (0)= x component, (1)= y component, (2)= z component, (3)= distance from the target*\/\n    std::vector<double> post_place_retreat; \/**< (0)= x component, (1)= y component, (2)= z component, (3)= distance from the target*\/\n    bool rand_init; \/**< true to select randon initialization in \"plan\" stages *\/\n    bool coll; \/**< true to enable collisions with the environment (body of the robot included) *\/\n    bool use_move_plane; \/**< true to constrain the end-effector to move on a plane in move movements, false otherwise*\/\n    std::vector<double> plane_params; \/**< plane cartesian parameters in move movements: a*x+b*y+c*z+d=0. a=plane_params(0), b=plane_params(1), c=plane_params(2), d=plane_params(3) *\/\n}mov_params;\n\/** this struct defines the boundary conditions of the movement*\/\ntypedef struct{\n    vector<double> vel_0; \/**< initial velocity of the joints in [rad\/s] *\/\n    vector<double> vel_f; \/**< final velocity of the joints in [rad\/s] *\/\n    vector<double> acc_0; \/**< initial acceleration of the joints in [rad\/s²] *\/\n    vector<double> acc_f; \/**< final acceleration of the joints in [rad\/s²] *\/\n} boundaryConditions;\n\n\/** this struct defines the tolerances that have to be set before planning the trajectory*\/\ntypedef struct{\n    mov_params mov_specs; \/**< specifications of the movement *\/\n    vector<double> tolsArm; \/**< radius of the spheres along the arm in [mm] *\/\n    MatrixXd tolsHand; \/**< radius of the spheres along the fingers in [mm] *\/\n    MatrixXd final_tolsObstacles; \/**< tolerances of the final posture against the obstacles in [mm] *\/\n    vector< MatrixXd > singleArm_tolsTarget; \/**< tolerances of the trajectory against the target in [mm] *\/\n    vector< MatrixXd > singleArm_tolsObstacles; \/**< tolerances of the trajectory against the obstacles in [mm] *\/\n    double tolTarPos; \/**< tolerance of the final position of the hand against the target in [mm] *\/\n    double tolTarOr; \/**< tolerance of the final orientation of the hand against the target in [mm] *\/\n    boundaryConditions bounds; \/**< boundary condistions of the bounce problem *\/\n    vector<double> vel_approach; \/**< velocity of the joints in [rad\/s] at the beginning of the approach stage *\/\n    vector<double> acc_approach; \/**< acceleration of the joints in [rad\/s²] at the beginning of the approach stage *\/\n    vector<double> lambda_final; \/**< weights for the final posture optimization *\/\n    vector<double> lambda_bounce; \/**< weights for the bounce posture optimization *\/\n    vector<double> w_max; \/**< maximum angular velocity for each joint [rad\/s] *\/\n    bool obstacle_avoidance; \/**< true to avoid obstacle *\/\n    bool target_avoidance; \/**< true to avoid the target during the motion *\/\n} hump_params;\n\n\/** This struct defines the result of the planned trajectory *\/\ntypedef struct{\n    int mov_type;\/**< type of the planned movement *\/\n    int status;\/**< status code of the planning *\/\n    string status_msg;\/**< status message of the planning *\/\n    string object_id;\/**< identity of the object involved in the movement *\/\n    vector<MatrixXd> trajectory_stages;\/**< sequence of the trajectories *\/\n    vector<MatrixXd> velocity_stages;\/**< sequence of the velocities *\/\n    vector<MatrixXd> acceleration_stages;\/**< sequence of the accelerations *\/\n    vector<double> time_steps; \/**< sequence of each time steps for each trajectory *\/\n    vector<string> trajectory_descriptions;\/**< description of the trajectories *\/\n}planning_result;\n\n\n\n} \/\/ namespace HUMotion\n\n\n\n\n#endif \/\/ HUMPConfig_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: Sequence.hxx,v $\n *\n *  $Revision: 1.20 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 08:34: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 _COM_SUN_STAR_UNO_SEQUENCE_HXX_\n#define _COM_SUN_STAR_UNO_SEQUENCE_HXX_\n\n#ifndef _OSL_DIAGNOSE_H_\n#include \"osl\/diagnose.h\"\n#endif\n#ifndef _OSL_INTERLCK_H_\n#include \"osl\/interlck.h\"\n#endif\n#ifndef _COM_SUN_STAR_UNO_SEQUENCE_H_\n#include \"com\/sun\/star\/uno\/Sequence.h\"\n#endif\n#ifndef _TYPELIB_TYPEDESCRIPTION_H_\n#include \"typelib\/typedescription.h\"\n#endif\n#ifndef _UNO_DATA_H_\n#include \"uno\/data.h\"\n#endif\n#ifndef _COM_SUN_STAR_UNO_GENFUNC_HXX_\n#include \"com\/sun\/star\/uno\/genfunc.hxx\"\n#endif\n\n\nnamespace com\n{\nnamespace sun\n{\nnamespace star\n{\nnamespace uno\n{\n\n\/\/______________________________________________________________________________\ntemplate< class E >\ntypelib_TypeDescriptionReference * Sequence< E >::s_pType = 0;\n\n\/\/______________________________________________________________________________\ntemplate< class E >\ninline Sequence< E >::Sequence() SAL_THROW( () )\n{\n    const Type & rType = getCppuType( this );\n    ::uno_type_sequence_construct(\n        &_pSequence, rType.getTypeLibType(),\n        0, 0, (uno_AcquireFunc)cpp_acquire );\n    \/\/ no bad_alloc, because empty sequence is statically allocated in cppu\n}\n\n\/\/______________________________________________________________________________\ntemplate< class E >\ninline Sequence< E >::Sequence( const Sequence< E > & rSeq ) SAL_THROW( () )\n{\n    ::osl_incrementInterlockedCount( &rSeq._pSequence->nRefCount );\n    _pSequence = rSeq._pSequence;\n}\n\n\/\/______________________________________________________________________________\ntemplate< class E >\ninline Sequence< E >::Sequence(\n    uno_Sequence * pSequence, __sal_NoAcquire ) SAL_THROW( () )\n        : _pSequence( pSequence )\n{\n}\n\n\/\/______________________________________________________________________________\ntemplate< class E >\ninline Sequence< E >::Sequence( const E * pElements, sal_Int32 len )\n{\n    const Type & rType = getCppuType( this );\n#if ! defined EXCEPTIONS_OFF\n    sal_Bool success =\n#endif\n    ::uno_type_sequence_construct(\n        &_pSequence, rType.getTypeLibType(),\n        const_cast< E * >( pElements ), len, (uno_AcquireFunc)cpp_acquire );\n#if ! defined EXCEPTIONS_OFF\n    if (! success)\n        throw ::std::bad_alloc();\n#endif\n}\n\n\/\/______________________________________________________________________________\ntemplate< class E >\ninline Sequence< E >::Sequence( sal_Int32 len )\n{\n    const Type & rType = getCppuType( this );\n#if ! defined EXCEPTIONS_OFF\n    sal_Bool success =\n#endif\n    ::uno_type_sequence_construct(\n        &_pSequence, rType.getTypeLibType(),\n        0, len, (uno_AcquireFunc)cpp_acquire );\n#if ! defined EXCEPTIONS_OFF\n    if (! success)\n        throw ::std::bad_alloc();\n#endif\n}\n\n\/\/______________________________________________________________________________\ntemplate< class E >\ninline Sequence< E >::~Sequence() SAL_THROW( () )\n{\n    const Type & rType = getCppuType( this );\n    ::uno_type_destructData(\n        this, rType.getTypeLibType(), (uno_ReleaseFunc)cpp_release );\n}\n\n\/\/______________________________________________________________________________\ntemplate< class E >\ninline Sequence< E > & Sequence< E >::operator = ( const Sequence< E > & rSeq ) SAL_THROW( () )\n{\n    const Type & rType = getCppuType( this );\n    ::uno_type_sequence_assign(\n        &_pSequence, rSeq._pSequence, rType.getTypeLibType(), (uno_ReleaseFunc)cpp_release );\n    return *this;\n}\n\n\/\/______________________________________________________________________________\ntemplate< class E >\ninline sal_Bool Sequence< E >::operator == ( const Sequence< E > & rSeq ) const\n    SAL_THROW( () )\n{\n    if (_pSequence == rSeq._pSequence)\n        return sal_True;\n    const Type & rType = getCppuType( this );\n    return ::uno_type_equalData(\n        const_cast< Sequence< E > * >( this ), rType.getTypeLibType(),\n        const_cast< Sequence< E > * >( &rSeq ), rType.getTypeLibType(),\n        (uno_QueryInterfaceFunc)cpp_queryInterface,\n        (uno_ReleaseFunc)cpp_release );\n}\n\n\/\/______________________________________________________________________________\ntemplate< class E >\ninline sal_Bool Sequence< E >::operator != ( const Sequence< E > & rSeq ) const\n    SAL_THROW( () )\n{\n    return (! operator == ( rSeq ));\n}\n\n\/\/______________________________________________________________________________\ntemplate< class E >\ninline E * Sequence< E >::getArray()\n{\n    const Type & rType = getCppuType( this );\n#if ! defined EXCEPTIONS_OFF\n    sal_Bool success =\n#endif\n    ::uno_type_sequence_reference2One(\n        &_pSequence, rType.getTypeLibType(),\n        (uno_AcquireFunc)cpp_acquire, (uno_ReleaseFunc)cpp_release );\n#if ! defined EXCEPTIONS_OFF\n    if (! success)\n        throw ::std::bad_alloc();\n#endif\n    return reinterpret_cast< E * >( _pSequence->elements );\n}\n\n\/\/______________________________________________________________________________\ntemplate< class E >\ninline E & Sequence< E >::operator [] ( sal_Int32 nIndex )\n{\n    OSL_ENSURE(\n        nIndex >= 0 && nIndex < getLength(),\n        \"### illegal index of sequence!\" );\n    return getArray()[ nIndex ];\n}\n\n\/\/______________________________________________________________________________\ntemplate< class E >\ninline const E & Sequence< E >::operator [] ( sal_Int32 nIndex ) const\n    SAL_THROW( () )\n{\n    OSL_ENSURE(\n        nIndex >= 0 && nIndex < getLength(),\n        \"### illegal index of sequence!\" );\n    return reinterpret_cast< const E * >( _pSequence->elements )[ nIndex ];\n}\n\n\/\/______________________________________________________________________________\ntemplate< class E >\ninline void Sequence< E >::realloc( sal_Int32 nSize )\n{\n    const Type & rType = getCppuType( this );\n#if !defined EXCEPTIONS_OFF\n    sal_Bool success =\n#endif\n    ::uno_type_sequence_realloc(\n        &_pSequence, rType.getTypeLibType(), nSize,\n        (uno_AcquireFunc)cpp_acquire, (uno_ReleaseFunc)cpp_release );\n#if !defined EXCEPTIONS_OFF\n    if (!success)\n        throw ::std::bad_alloc();\n#endif\n}\n\n\/\/------------------------------------------------------------------------------\ninline ::com::sun::star::uno::Sequence< sal_Int8 > SAL_CALL toUnoSequence(\n    const ::rtl::ByteSequence & rByteSequence ) SAL_THROW( () )\n{\n    return ::com::sun::star::uno::Sequence< sal_Int8 >(\n        * reinterpret_cast< const ::com::sun::star::uno::Sequence< sal_Int8 > * >( &rByteSequence ) );\n}\n\n}\n}\n}\n}\n\n\/\/ generic sequence template\ntemplate< class E >\ninline const ::com::sun::star::uno::Type &\nSAL_CALL getCppuType( const ::com::sun::star::uno::Sequence< E > * )\n    SAL_THROW( () )\n{\n    if (! ::com::sun::star::uno::Sequence< E >::s_pType)\n    {\n        const ::com::sun::star::uno::Type & rElementType = getCppuType(\n            (typename ::com::sun::star::uno::Sequence< E >::ElementType const *)0 );\n        ::typelib_static_sequence_type_init(\n            & ::com::sun::star::uno::Sequence< E >::s_pType,\n            rElementType.getTypeLibType() );\n    }\n    return * reinterpret_cast< const ::com::sun::star::uno::Type * >(\n        & ::com::sun::star::uno::Sequence< E >::s_pType );\n}\n\n\/\/ generic sequence template for given element type (e.g. C++ arrays)\ntemplate< class E >\ninline const ::com::sun::star::uno::Type &\nSAL_CALL getCppuSequenceType( const ::com::sun::star::uno::Type & rElementType )\n    SAL_THROW( () )\n{\n    if (! ::com::sun::star::uno::Sequence< E >::s_pType)\n    {\n        ::typelib_static_sequence_type_init(\n            & ::com::sun::star::uno::Sequence< E >::s_pType,\n            rElementType.getTypeLibType() );\n    }\n    return * reinterpret_cast< const ::com::sun::star::uno::Type * >(\n        & ::com::sun::star::uno::Sequence< E >::s_pType );\n}\n\n#if (defined(__SUNPRO_CC) && (__SUNPRO_CC == 0x500))\nstatic typelib_TypeDescriptionReference * s_pType_com_sun_star_uno_Sequence_Char = 0;\n#endif\n\n\/\/ char sequence\ninline const ::com::sun::star::uno::Type &\nSAL_CALL getCharSequenceCppuType() SAL_THROW( () )\n{\n#if !( defined(__SUNPRO_CC) && (__SUNPRO_CC == 0x500))\n    static typelib_TypeDescriptionReference * s_pType_com_sun_star_uno_Sequence_Char = 0;\n#endif\n    if (! s_pType_com_sun_star_uno_Sequence_Char)\n    {\n        const ::com::sun::star::uno::Type & rElementType = ::getCharCppuType();\n        ::typelib_static_sequence_type_init(\n            & s_pType_com_sun_star_uno_Sequence_Char,\n            rElementType.getTypeLibType() );\n    }\n    return * reinterpret_cast< const ::com::sun::star::uno::Type * >(\n        & s_pType_com_sun_star_uno_Sequence_Char );\n}\n\n#endif\n<commit_msg>INTEGRATION: CWS sb41 (1.20.18); FILE MERGED 2005\/11\/24 08:18:09 sb 1.20.18.1: #i57855# Replaced getCppuType (which is still there for backwards compatibility) with new cppu::UnoType and helper cppu::getTypeFavourUnsigned, as GCC 4.1 started to complain about non-conforming uses of getCppuType in template code.<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: Sequence.hxx,v $\n *\n *  $Revision: 1.21 $\n *\n *  last change: $Author: rt $ $Date: 2006-01-10 15:53:33 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n#ifndef _COM_SUN_STAR_UNO_SEQUENCE_HXX_\n#define _COM_SUN_STAR_UNO_SEQUENCE_HXX_\n\n#ifndef _OSL_DIAGNOSE_H_\n#include \"osl\/diagnose.h\"\n#endif\n#ifndef _OSL_INTERLCK_H_\n#include \"osl\/interlck.h\"\n#endif\n#ifndef _COM_SUN_STAR_UNO_SEQUENCE_H_\n#include \"com\/sun\/star\/uno\/Sequence.h\"\n#endif\n#ifndef _TYPELIB_TYPEDESCRIPTION_H_\n#include \"typelib\/typedescription.h\"\n#endif\n#ifndef _UNO_DATA_H_\n#include \"uno\/data.h\"\n#endif\n#ifndef _COM_SUN_STAR_UNO_GENFUNC_HXX_\n#include \"com\/sun\/star\/uno\/genfunc.hxx\"\n#endif\n#ifndef INCLUDED_CPPU_UNOTYPE_HXX\n#include \"cppu\/unotype.hxx\"\n#endif\n\nnamespace com\n{\nnamespace sun\n{\nnamespace star\n{\nnamespace uno\n{\n\n\/\/______________________________________________________________________________\ntemplate< class E >\ntypelib_TypeDescriptionReference * Sequence< E >::s_pType = 0;\n\n\/\/______________________________________________________________________________\ntemplate< class E >\ninline Sequence< E >::Sequence() SAL_THROW( () )\n{\n    const Type & rType = ::cppu::getTypeFavourUnsigned( this );\n    ::uno_type_sequence_construct(\n        &_pSequence, rType.getTypeLibType(),\n        0, 0, (uno_AcquireFunc)cpp_acquire );\n    \/\/ no bad_alloc, because empty sequence is statically allocated in cppu\n}\n\n\/\/______________________________________________________________________________\ntemplate< class E >\ninline Sequence< E >::Sequence( const Sequence< E > & rSeq ) SAL_THROW( () )\n{\n    ::osl_incrementInterlockedCount( &rSeq._pSequence->nRefCount );\n    _pSequence = rSeq._pSequence;\n}\n\n\/\/______________________________________________________________________________\ntemplate< class E >\ninline Sequence< E >::Sequence(\n    uno_Sequence * pSequence, __sal_NoAcquire ) SAL_THROW( () )\n        : _pSequence( pSequence )\n{\n}\n\n\/\/______________________________________________________________________________\ntemplate< class E >\ninline Sequence< E >::Sequence( const E * pElements, sal_Int32 len )\n{\n    const Type & rType = ::cppu::getTypeFavourUnsigned( this );\n#if ! defined EXCEPTIONS_OFF\n    sal_Bool success =\n#endif\n    ::uno_type_sequence_construct(\n        &_pSequence, rType.getTypeLibType(),\n        const_cast< E * >( pElements ), len, (uno_AcquireFunc)cpp_acquire );\n#if ! defined EXCEPTIONS_OFF\n    if (! success)\n        throw ::std::bad_alloc();\n#endif\n}\n\n\/\/______________________________________________________________________________\ntemplate< class E >\ninline Sequence< E >::Sequence( sal_Int32 len )\n{\n    const Type & rType = ::cppu::getTypeFavourUnsigned( this );\n#if ! defined EXCEPTIONS_OFF\n    sal_Bool success =\n#endif\n    ::uno_type_sequence_construct(\n        &_pSequence, rType.getTypeLibType(),\n        0, len, (uno_AcquireFunc)cpp_acquire );\n#if ! defined EXCEPTIONS_OFF\n    if (! success)\n        throw ::std::bad_alloc();\n#endif\n}\n\n\/\/______________________________________________________________________________\ntemplate< class E >\ninline Sequence< E >::~Sequence() SAL_THROW( () )\n{\n    const Type & rType = ::cppu::getTypeFavourUnsigned( this );\n    ::uno_type_destructData(\n        this, rType.getTypeLibType(), (uno_ReleaseFunc)cpp_release );\n}\n\n\/\/______________________________________________________________________________\ntemplate< class E >\ninline Sequence< E > & Sequence< E >::operator = ( const Sequence< E > & rSeq ) SAL_THROW( () )\n{\n    const Type & rType = ::cppu::getTypeFavourUnsigned( this );\n    ::uno_type_sequence_assign(\n        &_pSequence, rSeq._pSequence, rType.getTypeLibType(), (uno_ReleaseFunc)cpp_release );\n    return *this;\n}\n\n\/\/______________________________________________________________________________\ntemplate< class E >\ninline sal_Bool Sequence< E >::operator == ( const Sequence< E > & rSeq ) const\n    SAL_THROW( () )\n{\n    if (_pSequence == rSeq._pSequence)\n        return sal_True;\n    const Type & rType = ::cppu::getTypeFavourUnsigned( this );\n    return ::uno_type_equalData(\n        const_cast< Sequence< E > * >( this ), rType.getTypeLibType(),\n        const_cast< Sequence< E > * >( &rSeq ), rType.getTypeLibType(),\n        (uno_QueryInterfaceFunc)cpp_queryInterface,\n        (uno_ReleaseFunc)cpp_release );\n}\n\n\/\/______________________________________________________________________________\ntemplate< class E >\ninline sal_Bool Sequence< E >::operator != ( const Sequence< E > & rSeq ) const\n    SAL_THROW( () )\n{\n    return (! operator == ( rSeq ));\n}\n\n\/\/______________________________________________________________________________\ntemplate< class E >\ninline E * Sequence< E >::getArray()\n{\n    const Type & rType = ::cppu::getTypeFavourUnsigned( this );\n#if ! defined EXCEPTIONS_OFF\n    sal_Bool success =\n#endif\n    ::uno_type_sequence_reference2One(\n        &_pSequence, rType.getTypeLibType(),\n        (uno_AcquireFunc)cpp_acquire, (uno_ReleaseFunc)cpp_release );\n#if ! defined EXCEPTIONS_OFF\n    if (! success)\n        throw ::std::bad_alloc();\n#endif\n    return reinterpret_cast< E * >( _pSequence->elements );\n}\n\n\/\/______________________________________________________________________________\ntemplate< class E >\ninline E & Sequence< E >::operator [] ( sal_Int32 nIndex )\n{\n    OSL_ENSURE(\n        nIndex >= 0 && nIndex < getLength(),\n        \"### illegal index of sequence!\" );\n    return getArray()[ nIndex ];\n}\n\n\/\/______________________________________________________________________________\ntemplate< class E >\ninline const E & Sequence< E >::operator [] ( sal_Int32 nIndex ) const\n    SAL_THROW( () )\n{\n    OSL_ENSURE(\n        nIndex >= 0 && nIndex < getLength(),\n        \"### illegal index of sequence!\" );\n    return reinterpret_cast< const E * >( _pSequence->elements )[ nIndex ];\n}\n\n\/\/______________________________________________________________________________\ntemplate< class E >\ninline void Sequence< E >::realloc( sal_Int32 nSize )\n{\n    const Type & rType = ::cppu::getTypeFavourUnsigned( this );\n#if !defined EXCEPTIONS_OFF\n    sal_Bool success =\n#endif\n    ::uno_type_sequence_realloc(\n        &_pSequence, rType.getTypeLibType(), nSize,\n        (uno_AcquireFunc)cpp_acquire, (uno_ReleaseFunc)cpp_release );\n#if !defined EXCEPTIONS_OFF\n    if (!success)\n        throw ::std::bad_alloc();\n#endif\n}\n\n\/\/------------------------------------------------------------------------------\ninline ::com::sun::star::uno::Sequence< sal_Int8 > SAL_CALL toUnoSequence(\n    const ::rtl::ByteSequence & rByteSequence ) SAL_THROW( () )\n{\n    return ::com::sun::star::uno::Sequence< sal_Int8 >(\n        * reinterpret_cast< const ::com::sun::star::uno::Sequence< sal_Int8 > * >( &rByteSequence ) );\n}\n\n}\n}\n}\n}\n\nnamespace cppu {\n\ntemplate< typename T > inline ::com::sun::star::uno::Type const &\ngetTypeFavourUnsigned(::com::sun::star::uno::Sequence< T > const *) {\n    if (::com::sun::star::uno::Sequence< T >::s_pType == 0) {\n        ::typelib_static_sequence_type_init(\n            &::com::sun::star::uno::Sequence< T >::s_pType,\n            (::cppu::getTypeFavourUnsigned(\n                static_cast<\n                typename ::com::sun::star::uno::Sequence< T >::ElementType * >(\n                    0)).\n             getTypeLibType()));\n    }\n    return detail::getTypeFromTypeDescriptionReference(\n        &::com::sun::star::uno::Sequence< T >::s_pType);\n}\n\n}\n\n\/\/ generic sequence template\ntemplate< class E >\ninline const ::com::sun::star::uno::Type &\nSAL_CALL getCppuType( const ::com::sun::star::uno::Sequence< E > * )\n    SAL_THROW( () )\n{\n    return ::cppu::getTypeFavourUnsigned(\n        static_cast< ::com::sun::star::uno::Sequence< E > * >(0));\n}\n\n\/\/ generic sequence template for given element type (e.g. C++ arrays)\ntemplate< class E >\ninline const ::com::sun::star::uno::Type &\nSAL_CALL getCppuSequenceType( const ::com::sun::star::uno::Type & rElementType )\n    SAL_THROW( () )\n{\n    if (! ::com::sun::star::uno::Sequence< E >::s_pType)\n    {\n        ::typelib_static_sequence_type_init(\n            & ::com::sun::star::uno::Sequence< E >::s_pType,\n            rElementType.getTypeLibType() );\n    }\n    return * reinterpret_cast< const ::com::sun::star::uno::Type * >(\n        & ::com::sun::star::uno::Sequence< E >::s_pType );\n}\n\n#if (defined(__SUNPRO_CC) && (__SUNPRO_CC == 0x500))\nstatic typelib_TypeDescriptionReference * s_pType_com_sun_star_uno_Sequence_Char = 0;\n#endif\n\n\/\/ char sequence\ninline const ::com::sun::star::uno::Type &\nSAL_CALL getCharSequenceCppuType() SAL_THROW( () )\n{\n#if !( defined(__SUNPRO_CC) && (__SUNPRO_CC == 0x500))\n    static typelib_TypeDescriptionReference * s_pType_com_sun_star_uno_Sequence_Char = 0;\n#endif\n    if (! s_pType_com_sun_star_uno_Sequence_Char)\n    {\n        const ::com::sun::star::uno::Type & rElementType = ::getCharCppuType();\n        ::typelib_static_sequence_type_init(\n            & s_pType_com_sun_star_uno_Sequence_Char,\n            rElementType.getTypeLibType() );\n    }\n    return * reinterpret_cast< const ::com::sun::star::uno::Type * >(\n        & s_pType_com_sun_star_uno_Sequence_Char );\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- ProcessLauncherLinux.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\/posix\/ProcessLauncherPosixFork.h\"\n#include \"lldb\/Host\/Host.h\"\n#include \"lldb\/Host\/HostProcess.h\"\n#include \"lldb\/Host\/Pipe.h\"\n#include \"lldb\/Target\/ProcessLaunchInfo.h\"\n#include \"lldb\/Utility\/FileSpec.h\"\n#include \"lldb\/Utility\/Log.h\"\n#include \"llvm\/Support\/Errno.h\"\n\n#include <limits.h>\n#include <sys\/ptrace.h>\n#include <sys\/wait.h>\n#include <unistd.h>\n\n#include <sstream>\n#include <csignal>\n\n#ifdef __ANDROID__\n#include <android\/api-level.h>\n#define PT_TRACE_ME PTRACE_TRACEME\n#endif\n\n#if defined(__ANDROID_API__) && __ANDROID_API__ < 15\n#include <linux\/personality.h>\n#elif defined(__linux__)\n#include <sys\/personality.h>\n#endif\n\nusing namespace lldb;\nusing namespace lldb_private;\n\nstatic void FixupEnvironment(Environment &env) {\n#ifdef __ANDROID__\n  \/\/ If there is no PATH variable specified inside the environment then set the\n  \/\/ path to \/system\/bin. It is required because the default path used by\n  \/\/ execve() is wrong on android.\n  env.try_emplace(\"PATH\", \"\/system\/bin\");\n#endif\n}\n\nstatic void LLVM_ATTRIBUTE_NORETURN ExitWithError(int error_fd,\n                                                  const char *operation) {\n  int err = errno;\n  llvm::raw_fd_ostream os(error_fd, true);\n  os << operation << \" failed: \" << llvm::sys::StrError(err);\n  os.flush();\n  _exit(1);\n}\n\nstatic void DisableASLRIfRequested(int error_fd, const ProcessLaunchInfo &info) {\n#if defined(__linux__)\n  if (info.GetFlags().Test(lldb::eLaunchFlagDisableASLR)) {\n    const unsigned long personality_get_current = 0xffffffff;\n    int value = personality(personality_get_current);\n    if (value == -1)\n      ExitWithError(error_fd, \"personality get\");\n\n    value = personality(ADDR_NO_RANDOMIZE | value);\n    if (value == -1)\n      ExitWithError(error_fd, \"personality set\");\n  }\n#endif\n}\n\nstatic void DupDescriptor(int error_fd, const FileSpec &file_spec, int fd,\n                          int flags) {\n  int target_fd = ::open(file_spec.GetCString(), flags, 0666);\n\n  if (target_fd == -1)\n    ExitWithError(error_fd, \"DupDescriptor-open\");\n\n  if (target_fd == fd)\n    return;\n\n  if (::dup2(target_fd, fd) == -1)\n    ExitWithError(error_fd, \"DupDescriptor-dup2\");\n\n  ::close(target_fd);\n  return;\n}\n\nstatic void LLVM_ATTRIBUTE_NORETURN ChildFunc(int error_fd,\n                                              const ProcessLaunchInfo &info) {\n  \/\/ Do not inherit setgid powers.\n  if (setgid(getgid()) != 0)\n    ExitWithError(error_fd, \"setgid\");\n\n  if (info.GetFlags().Test(eLaunchFlagLaunchInSeparateProcessGroup)) {\n    if (setpgid(0, 0) != 0)\n      ExitWithError(error_fd, \"setpgid\");\n  }\n\n  for (size_t i = 0; i < info.GetNumFileActions(); ++i) {\n    const FileAction &action = *info.GetFileActionAtIndex(i);\n    switch (action.GetAction()) {\n    case FileAction::eFileActionClose:\n      if (close(action.GetFD()) != 0)\n        ExitWithError(error_fd, \"close\");\n      break;\n    case FileAction::eFileActionDuplicate:\n      if (dup2(action.GetFD(), action.GetActionArgument()) == -1)\n        ExitWithError(error_fd, \"dup2\");\n      break;\n    case FileAction::eFileActionOpen:\n      DupDescriptor(error_fd, action.GetFileSpec(), action.GetFD(),\n                    action.GetActionArgument());\n      break;\n    case FileAction::eFileActionNone:\n      break;\n    }\n  }\n\n  const char **argv = info.GetArguments().GetConstArgumentVector();\n\n  \/\/ Change working directory\n  if (info.GetWorkingDirectory() &&\n      0 != ::chdir(info.GetWorkingDirectory().GetCString()))\n    ExitWithError(error_fd, \"chdir\");\n\n  DisableASLRIfRequested(error_fd, info);\n  Environment env = info.GetEnvironment();\n  FixupEnvironment(env);\n  Environment::Envp envp = env.getEnvp();\n\n  \/\/ Clear the signal mask to prevent the child from being affected by any\n  \/\/ masking done by the parent.\n  sigset_t set;\n  if (sigemptyset(&set) != 0 ||\n      pthread_sigmask(SIG_SETMASK, &set, nullptr) != 0)\n    ExitWithError(error_fd, \"pthread_sigmask\");\n\n  if (info.GetFlags().Test(eLaunchFlagDebug)) {\n    \/\/ HACK:\n    \/\/ Close everything besides stdin, stdout, and stderr that has no file\n    \/\/ action to avoid leaking. Only do this when debugging, as elsewhere we\n    \/\/ actually rely on passing open descriptors to child processes.\n    for (int fd = 3; fd < sysconf(_SC_OPEN_MAX); ++fd)\n      if (!info.GetFileActionForFD(fd) && fd != error_fd)\n        close(fd);\n\n    \/\/ Start tracing this child that is about to exec.\n    if (ptrace(PT_TRACE_ME, 0, nullptr, 0) == -1)\n      ExitWithError(error_fd, \"ptrace\");\n  }\n\n  \/\/ Execute.  We should never return...\n  execve(argv[0], const_cast<char *const *>(argv), envp);\n\n#if defined(__linux__)\n  if (errno == ETXTBSY) {\n    \/\/ On android M and earlier we can get this error because the adb deamon\n    \/\/ can hold a write handle on the executable even after it has finished\n    \/\/ uploading it. This state lasts only a short time and happens only when\n    \/\/ there are many concurrent adb commands being issued, such as when\n    \/\/ running the test suite. (The file remains open when someone does an \"adb\n    \/\/ shell\" command in the fork() child before it has had a chance to exec.)\n    \/\/ Since this state should clear up quickly, wait a while and then give it\n    \/\/ one more go.\n    usleep(50000);\n    execve(argv[0], const_cast<char *const *>(argv), envp);\n  }\n#endif\n\n  \/\/ ...unless exec fails.  In which case we definitely need to end the child\n  \/\/ here.\n  ExitWithError(error_fd, \"execve\");\n}\n\nHostProcess\nProcessLauncherPosixFork::LaunchProcess(const ProcessLaunchInfo &launch_info,\n                                        Status &error) {\n  char exe_path[PATH_MAX];\n  launch_info.GetExecutableFile().GetPath(exe_path, sizeof(exe_path));\n\n  \/\/ A pipe used by the child process to report errors.\n  PipePosix pipe;\n  const bool child_processes_inherit = false;\n  error = pipe.CreateNew(child_processes_inherit);\n  if (error.Fail())\n    return HostProcess();\n\n  ::pid_t pid = ::fork();\n  if (pid == -1) {\n    \/\/ Fork failed\n    error.SetErrorStringWithFormatv(\"Fork failed with error message: {0}\",\n                                    llvm::sys::StrError());\n    return HostProcess(LLDB_INVALID_PROCESS_ID);\n  }\n  if (pid == 0) {\n    \/\/ child process\n    pipe.CloseReadFileDescriptor();\n    ChildFunc(pipe.ReleaseWriteFileDescriptor(), launch_info);\n  }\n\n  \/\/ parent process\n\n  pipe.CloseWriteFileDescriptor();\n  char buf[1000];\n  int r = read(pipe.GetReadFileDescriptor(), buf, sizeof buf);\n\n  if (r == 0)\n    return HostProcess(pid); \/\/ No error. We're done.\n\n  error.SetErrorString(buf);\n\n  waitpid(pid, nullptr, 0);\n\n  return HostProcess();\n}\n<commit_msg>ProcessLauncherPosixFork: move setgid call into the if(debug) branch<commit_after>\/\/===-- ProcessLauncherLinux.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\/posix\/ProcessLauncherPosixFork.h\"\n#include \"lldb\/Host\/Host.h\"\n#include \"lldb\/Host\/HostProcess.h\"\n#include \"lldb\/Host\/Pipe.h\"\n#include \"lldb\/Target\/ProcessLaunchInfo.h\"\n#include \"lldb\/Utility\/FileSpec.h\"\n#include \"lldb\/Utility\/Log.h\"\n#include \"llvm\/Support\/Errno.h\"\n\n#include <limits.h>\n#include <sys\/ptrace.h>\n#include <sys\/wait.h>\n#include <unistd.h>\n\n#include <sstream>\n#include <csignal>\n\n#ifdef __ANDROID__\n#include <android\/api-level.h>\n#define PT_TRACE_ME PTRACE_TRACEME\n#endif\n\n#if defined(__ANDROID_API__) && __ANDROID_API__ < 15\n#include <linux\/personality.h>\n#elif defined(__linux__)\n#include <sys\/personality.h>\n#endif\n\nusing namespace lldb;\nusing namespace lldb_private;\n\nstatic void FixupEnvironment(Environment &env) {\n#ifdef __ANDROID__\n  \/\/ If there is no PATH variable specified inside the environment then set the\n  \/\/ path to \/system\/bin. It is required because the default path used by\n  \/\/ execve() is wrong on android.\n  env.try_emplace(\"PATH\", \"\/system\/bin\");\n#endif\n}\n\nstatic void LLVM_ATTRIBUTE_NORETURN ExitWithError(int error_fd,\n                                                  const char *operation) {\n  int err = errno;\n  llvm::raw_fd_ostream os(error_fd, true);\n  os << operation << \" failed: \" << llvm::sys::StrError(err);\n  os.flush();\n  _exit(1);\n}\n\nstatic void DisableASLRIfRequested(int error_fd, const ProcessLaunchInfo &info) {\n#if defined(__linux__)\n  if (info.GetFlags().Test(lldb::eLaunchFlagDisableASLR)) {\n    const unsigned long personality_get_current = 0xffffffff;\n    int value = personality(personality_get_current);\n    if (value == -1)\n      ExitWithError(error_fd, \"personality get\");\n\n    value = personality(ADDR_NO_RANDOMIZE | value);\n    if (value == -1)\n      ExitWithError(error_fd, \"personality set\");\n  }\n#endif\n}\n\nstatic void DupDescriptor(int error_fd, const FileSpec &file_spec, int fd,\n                          int flags) {\n  int target_fd = ::open(file_spec.GetCString(), flags, 0666);\n\n  if (target_fd == -1)\n    ExitWithError(error_fd, \"DupDescriptor-open\");\n\n  if (target_fd == fd)\n    return;\n\n  if (::dup2(target_fd, fd) == -1)\n    ExitWithError(error_fd, \"DupDescriptor-dup2\");\n\n  ::close(target_fd);\n  return;\n}\n\nstatic void LLVM_ATTRIBUTE_NORETURN ChildFunc(int error_fd,\n                                              const ProcessLaunchInfo &info) {\n  if (info.GetFlags().Test(eLaunchFlagLaunchInSeparateProcessGroup)) {\n    if (setpgid(0, 0) != 0)\n      ExitWithError(error_fd, \"setpgid\");\n  }\n\n  for (size_t i = 0; i < info.GetNumFileActions(); ++i) {\n    const FileAction &action = *info.GetFileActionAtIndex(i);\n    switch (action.GetAction()) {\n    case FileAction::eFileActionClose:\n      if (close(action.GetFD()) != 0)\n        ExitWithError(error_fd, \"close\");\n      break;\n    case FileAction::eFileActionDuplicate:\n      if (dup2(action.GetFD(), action.GetActionArgument()) == -1)\n        ExitWithError(error_fd, \"dup2\");\n      break;\n    case FileAction::eFileActionOpen:\n      DupDescriptor(error_fd, action.GetFileSpec(), action.GetFD(),\n                    action.GetActionArgument());\n      break;\n    case FileAction::eFileActionNone:\n      break;\n    }\n  }\n\n  const char **argv = info.GetArguments().GetConstArgumentVector();\n\n  \/\/ Change working directory\n  if (info.GetWorkingDirectory() &&\n      0 != ::chdir(info.GetWorkingDirectory().GetCString()))\n    ExitWithError(error_fd, \"chdir\");\n\n  DisableASLRIfRequested(error_fd, info);\n  Environment env = info.GetEnvironment();\n  FixupEnvironment(env);\n  Environment::Envp envp = env.getEnvp();\n\n  \/\/ Clear the signal mask to prevent the child from being affected by any\n  \/\/ masking done by the parent.\n  sigset_t set;\n  if (sigemptyset(&set) != 0 ||\n      pthread_sigmask(SIG_SETMASK, &set, nullptr) != 0)\n    ExitWithError(error_fd, \"pthread_sigmask\");\n\n  if (info.GetFlags().Test(eLaunchFlagDebug)) {\n    \/\/ Do not inherit setgid powers.\n    if (setgid(getgid()) != 0)\n      ExitWithError(error_fd, \"setgid\");\n\n    \/\/ HACK:\n    \/\/ Close everything besides stdin, stdout, and stderr that has no file\n    \/\/ action to avoid leaking. Only do this when debugging, as elsewhere we\n    \/\/ actually rely on passing open descriptors to child processes.\n    for (int fd = 3; fd < sysconf(_SC_OPEN_MAX); ++fd)\n      if (!info.GetFileActionForFD(fd) && fd != error_fd)\n        close(fd);\n\n    \/\/ Start tracing this child that is about to exec.\n    if (ptrace(PT_TRACE_ME, 0, nullptr, 0) == -1)\n      ExitWithError(error_fd, \"ptrace\");\n  }\n\n  \/\/ Execute.  We should never return...\n  execve(argv[0], const_cast<char *const *>(argv), envp);\n\n#if defined(__linux__)\n  if (errno == ETXTBSY) {\n    \/\/ On android M and earlier we can get this error because the adb deamon\n    \/\/ can hold a write handle on the executable even after it has finished\n    \/\/ uploading it. This state lasts only a short time and happens only when\n    \/\/ there are many concurrent adb commands being issued, such as when\n    \/\/ running the test suite. (The file remains open when someone does an \"adb\n    \/\/ shell\" command in the fork() child before it has had a chance to exec.)\n    \/\/ Since this state should clear up quickly, wait a while and then give it\n    \/\/ one more go.\n    usleep(50000);\n    execve(argv[0], const_cast<char *const *>(argv), envp);\n  }\n#endif\n\n  \/\/ ...unless exec fails.  In which case we definitely need to end the child\n  \/\/ here.\n  ExitWithError(error_fd, \"execve\");\n}\n\nHostProcess\nProcessLauncherPosixFork::LaunchProcess(const ProcessLaunchInfo &launch_info,\n                                        Status &error) {\n  char exe_path[PATH_MAX];\n  launch_info.GetExecutableFile().GetPath(exe_path, sizeof(exe_path));\n\n  \/\/ A pipe used by the child process to report errors.\n  PipePosix pipe;\n  const bool child_processes_inherit = false;\n  error = pipe.CreateNew(child_processes_inherit);\n  if (error.Fail())\n    return HostProcess();\n\n  ::pid_t pid = ::fork();\n  if (pid == -1) {\n    \/\/ Fork failed\n    error.SetErrorStringWithFormatv(\"Fork failed with error message: {0}\",\n                                    llvm::sys::StrError());\n    return HostProcess(LLDB_INVALID_PROCESS_ID);\n  }\n  if (pid == 0) {\n    \/\/ child process\n    pipe.CloseReadFileDescriptor();\n    ChildFunc(pipe.ReleaseWriteFileDescriptor(), launch_info);\n  }\n\n  \/\/ parent process\n\n  pipe.CloseWriteFileDescriptor();\n  char buf[1000];\n  int r = read(pipe.GetReadFileDescriptor(), buf, sizeof buf);\n\n  if (r == 0)\n    return HostProcess(pid); \/\/ No error. We're done.\n\n  error.SetErrorString(buf);\n\n  waitpid(pid, nullptr, 0);\n\n  return HostProcess();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * Implementation of a mock mutex and a mock thread class\n * for testing purposes.\n *\/\n\n#include \"mock.hpp\"\n#include <d2\/detail\/basic_atomic.hpp>\n#include <d2\/logging.hpp>\n\n#include <boost\/assert.hpp>\n#include <boost\/filesystem.hpp>\n#include <boost\/function.hpp>\n#include <boost\/functional\/hash.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/move\/move.hpp>\n#include <boost\/thread\/thread.hpp>\n#include <cstddef>\n#include <iostream>\n#include <string>\n\n\nnamespace mock {\n\nnamespace {\nstd::string create_tmp_directory(std::string const& path_to_test_source) {\n    namespace fs = boost::filesystem;\n    fs::path tmp = fs::temp_directory_path();\n    fs::create_directory(tmp \/= \"d2_integration_tests_for_deadlock_analysis\");\n    tmp \/= fs::path(path_to_test_source).stem();\n\n    unsigned int i = 0;\n    while (fs::exists(tmp))\n        tmp.replace_extension(boost::lexical_cast<std::string>(i++));\n    fs::create_directory(tmp);\n\n    return tmp.string();\n}\n} \/\/ end anonymous namespace\n\n\/**\n * Setup a small environment for the integration test to take place.\n *\n * @return Whether setting the environment succeeded. If the function reports\n *         a failure, the test should not take place.\n *\/\nextern bool begin_integration_test(int argc, char const* argv[],\n                                   std::string const& test_source) {\n    std::string log_repo(argc > 1 ? argv[1] :\n                                    create_tmp_directory(test_source));\n    \/\/ If setting the repo fails, we just don't enable logging and we won't\n    \/\/ have any results for the test.\n    if (d2::set_log_repository(log_repo)) {\n        std::cerr << \"setting the repository at \\\"\"\n                  << log_repo << \"\\\" failed\\n\";\n        return false;\n    }\n    std::cout << \"repository is at \\\"\" << log_repo << \"\\\"\\n\";\n    d2::enable_event_logging();\n    return true;\n}\n\nextern void end_integration_test() {\n    d2::disable_event_logging();\n}\n\nnamespace detail {\nclass thread_functor_wrapper {\n    thread::id parent_;\n    boost::function<void()> f_;\n\npublic:\n    explicit thread_functor_wrapper(boost::function<void()> const& f)\n        : parent_(this_thread::get_id()), f_(f)\n    { }\n\n    void operator()() const {\n        thread::id child = this_thread::get_id();\n        d2::notify_start(parent_, child);\n        f_();\n        d2::notify_join(parent_, child);\n    }\n};\n} \/\/ end namespace detail\n\nthread::thread(boost::function<void()> const& f)\n    : f_(detail::thread_functor_wrapper(f))\n{ }\n\nthread::thread(BOOST_RV_REF(thread) other) : f_(boost::move(other.f_)) {\n    swap(actual_, other.actual_);\n}\n\nvoid swap(thread& a, thread& b) {\n    using std::swap;\n    swap(a.f_, b.f_);\n    swap(a.actual_, b.actual_);\n}\n\nvoid thread::start() {\n    BOOST_ASSERT_MSG(!actual_, \"starting an already started thread\");\n    actual_.reset(new boost::thread(f_));\n}\n\nvoid thread::join() {\n    BOOST_ASSERT_MSG(actual_, \"joining a thread that is not started\");\n    actual_->join();\n    actual_.reset();\n}\n\n\nthread::id::id(boost::thread::id const& thread_id)\n    : id_(thread_id)\n{ }\n\nextern std::size_t unique_id(thread::id const& self) {\n    using boost::hash_value;\n    return hash_value(self.id_);\n}\n\n\nnamespace this_thread {\n    extern thread::id get_id() {\n        return thread::id(boost::this_thread::get_id());\n    }\n}\n\n\nmutex::mutex()\n    : id_(counter++)\n{ }\n\nvoid mutex::lock() const {\n    d2::notify_acquire(this_thread::get_id(), *this);\n}\n\nvoid mutex::unlock() const {\n    d2::notify_release(this_thread::get_id(), *this);\n}\n\nextern std::size_t unique_id(mutex const& self) {\n    return self.id_;\n}\n\nd2::detail::basic_atomic<std::size_t> mutex::counter(0);\n\n\nvoid recursive_mutex::lock() const {\n    d2::notify_recursive_acquire(this_thread::get_id(), *this);\n}\n\nvoid recursive_mutex::unlock() const {\n    d2::notify_recursive_release(this_thread::get_id(), *this);\n}\n\n} \/\/ end namespace mock\n<commit_msg>Use boost::format in the mock library.<commit_after>\/**\n * Implementation of a mock mutex and a mock thread class\n * for testing purposes.\n *\/\n\n#include \"mock.hpp\"\n#include <d2\/detail\/basic_atomic.hpp>\n#include <d2\/logging.hpp>\n\n#include <boost\/assert.hpp>\n#include <boost\/filesystem.hpp>\n#include <boost\/format.hpp>\n#include <boost\/function.hpp>\n#include <boost\/functional\/hash.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/move\/move.hpp>\n#include <boost\/thread\/thread.hpp>\n#include <cstddef>\n#include <iostream>\n#include <string>\n\n\nnamespace mock {\n\nnamespace {\nstd::string create_tmp_directory(std::string const& path_to_test_source) {\n    namespace fs = boost::filesystem;\n    fs::path tmp = fs::temp_directory_path();\n    fs::create_directory(tmp \/= \"d2_integration_tests_for_deadlock_analysis\");\n    tmp \/= fs::path(path_to_test_source).stem();\n\n    unsigned int i = 0;\n    while (fs::exists(tmp))\n        tmp.replace_extension(boost::lexical_cast<std::string>(i++));\n    fs::create_directory(tmp);\n\n    return tmp.string();\n}\n} \/\/ end anonymous namespace\n\n\/**\n * Setup a small environment for the integration test to take place.\n *\n * @return Whether setting the environment succeeded. If the function reports\n *         a failure, the test should not take place.\n *\/\nextern bool begin_integration_test(int argc, char const* argv[],\n                                   std::string const& test_source) {\n    std::string log_repo(argc > 1 ? argv[1] :\n                                    create_tmp_directory(test_source));\n    \/\/ If setting the repo fails, we just don't enable logging and we won't\n    \/\/ have any results for the test.\n    if (d2::set_log_repository(log_repo)) {\n        std::cerr <<boost::format(\"setting the repository at \\\"%1%\\\" failed\\n\")\n                                                                    % log_repo;\n        return false;\n    }\n    std::cout << boost::format(\"repository is at \\\"%1%\\\"\\n\") % log_repo;\n    d2::enable_event_logging();\n    return true;\n}\n\nextern void end_integration_test() {\n    d2::disable_event_logging();\n}\n\nnamespace detail {\nclass thread_functor_wrapper {\n    thread::id parent_;\n    boost::function<void()> f_;\n\npublic:\n    explicit thread_functor_wrapper(boost::function<void()> const& f)\n        : parent_(this_thread::get_id()), f_(f)\n    { }\n\n    void operator()() const {\n        thread::id child = this_thread::get_id();\n        d2::notify_start(parent_, child);\n        f_();\n        d2::notify_join(parent_, child);\n    }\n};\n} \/\/ end namespace detail\n\nthread::thread(boost::function<void()> const& f)\n    : f_(detail::thread_functor_wrapper(f))\n{ }\n\nthread::thread(BOOST_RV_REF(thread) other) : f_(boost::move(other.f_)) {\n    swap(actual_, other.actual_);\n}\n\nvoid swap(thread& a, thread& b) {\n    using std::swap;\n    swap(a.f_, b.f_);\n    swap(a.actual_, b.actual_);\n}\n\nvoid thread::start() {\n    BOOST_ASSERT_MSG(!actual_, \"starting an already started thread\");\n    actual_.reset(new boost::thread(f_));\n}\n\nvoid thread::join() {\n    BOOST_ASSERT_MSG(actual_, \"joining a thread that is not started\");\n    actual_->join();\n    actual_.reset();\n}\n\n\nthread::id::id(boost::thread::id const& thread_id)\n    : id_(thread_id)\n{ }\n\nextern std::size_t unique_id(thread::id const& self) {\n    using boost::hash_value;\n    return hash_value(self.id_);\n}\n\n\nnamespace this_thread {\n    extern thread::id get_id() {\n        return thread::id(boost::this_thread::get_id());\n    }\n}\n\n\nmutex::mutex()\n    : id_(counter++)\n{ }\n\nvoid mutex::lock() const {\n    d2::notify_acquire(this_thread::get_id(), *this);\n}\n\nvoid mutex::unlock() const {\n    d2::notify_release(this_thread::get_id(), *this);\n}\n\nextern std::size_t unique_id(mutex const& self) {\n    return self.id_;\n}\n\nd2::detail::basic_atomic<std::size_t> mutex::counter(0);\n\n\nvoid recursive_mutex::lock() const {\n    d2::notify_recursive_acquire(this_thread::get_id(), *this);\n}\n\nvoid recursive_mutex::unlock() const {\n    d2::notify_recursive_release(this_thread::get_id(), *this);\n}\n\n} \/\/ end namespace mock\n<|endoftext|>"}
{"text":"<commit_before>#include \"joystick.hpp\"\n#include \"constants.hpp\"\n\n#include <ros\/ros.h>\n#include <geometry_msgs\/Twist.h>\n#include <vector>\n#include <string>\n#include <math.h>\n\nusing namespace ros;\nusing namespace std;\n\nconst int AXIS_MAX = 32767;\nJoystick joystick;\nPublisher pub;\n\n\/\/ Used to send a \"stop\" message after the safety button was released. Otherwise\n\/\/ the robot could continue driving with the current speed in case the button\n\/\/ was released while in motion.\nbool safetyButtonWasPressed = false;\n\nvoid updateRemote(const TimerEvent&) {\n\t\/\/ get axis values\n\t\/\/ use axis.0 for left\/right\n\t\/\/ and axis.1 for up\/down\n\tJoystickEvent event = joystick.getEvent();\n\tvector<short> axis = event.getAxis();\n\tvector<bool> buttons = event.getButtons();\n\n\t\/\/ calculate position values\n\tdouble angular = (-1.0) * axis.at(0) \/ AXIS_MAX;\n\tdouble linear  = (-1.0) * axis.at(1) \/ AXIS_MAX;\n\tdouble stick2y = (-1.0) * axis.at(2) \/ AXIS_MAX;\n\n\tangular = min(max(angular, -1.0), 1.0);\n\tlinear = min(max(linear, -1.0), 1.0);\n\tstick2y = min(max(stick2y, -1.0), 1.0);\n\n\t\/\/ Don't send commands if we're not supposed to do so.\n\t\/\/ This is necessary as the remote *must not* permanently send \"stop\"\n\t\/\/ commands while not in use. This will make the robot winch crazily.\n\tif(!buttons.at(4) && !buttons.at(6)) {\n\t\tif(!safetyButtonWasPressed) {\n\t\t\treturn;\n\t\t} else {\n\t\t\tangular = 0.0;\n\t\t\tlinear  = 0.0;\n\t\t\tstick2y = 0.0;\n\t\t}\n\t}\n\tsafetyButtonWasPressed = true;\n\n\t\/\/ SPEEED-BUTTON!\n\tif (!buttons.at(0)) {\n\t\tlinear *= 0.25;\n\t} else {\n\t\t\/\/ Safety measures...\n\t\tlinear *= 0.75;\n\t}\n\tif (!buttons.at(1)) {\n\t\tstick2y *= 0.2; \/\/ Scale wheel rotation nice and slow\n\t} else {\n\t\tstick2y *= 0.5;\n\t}\n\n\t\/\/ if (linear < 0) {\n\t\/\/ \tangular *= (-1.0);\n\t\/\/ }\n\n\t\/\/ Twist is supposed to contain desired speeds in m\/s\n\tgeometry_msgs::Twist twist;\n\ttwist.linear.x = linear * MAX_DRV_SPEED;\n\ttwist.angular.y = stick2y * MAX_ROT_SPEED;\n\ttwist.angular.z = angular * MAX_TURN_SPEED;\n\n\tpub.publish(twist);\n}\n\nint main(int argc, char **argv) {\n\t\/\/ init sdl and connect to controller\n\tSDL_Init(SDL_INIT_JOYSTICK);\n\tif(!joystick.init()) {\n\t\tcout << \"Could not find a joystick!\\n\";\n\t\treturn 1;\n\t}\n\tstring name = joystick.getName();\n\tcout << \"Used controller: \" << name.c_str() << endl;\n\t\n\t\/\/ init ros\n\tinit(argc, argv, \"remotecontrol\");\n\tNodeHandle n;\n\tpub = n.advertise<geometry_msgs::Twist>(\"cmd_vel\", 1);\n\n\t\/\/ startup main loop\n\tTimer remoteTimer = n.createTimer(Duration(0.0166 \/*60 Hz*\/), updateRemote);\n\tspin();\n\treturn 0;\n}\n<commit_msg>remote: more power for rotate engines<commit_after>#include \"joystick.hpp\"\n#include \"constants.hpp\"\n\n#include <ros\/ros.h>\n#include <geometry_msgs\/Twist.h>\n#include <vector>\n#include <string>\n#include <math.h>\n\nusing namespace ros;\nusing namespace std;\n\nconst int AXIS_MAX = 32767;\nJoystick joystick;\nPublisher pub;\n\n\/\/ Used to send a \"stop\" message after the safety button was released. Otherwise\n\/\/ the robot could continue driving with the current speed in case the button\n\/\/ was released while in motion.\nbool safetyButtonWasPressed = false;\n\nvoid updateRemote(const TimerEvent&) {\n\t\/\/ get axis values\n\t\/\/ use axis.0 for left\/right\n\t\/\/ and axis.1 for up\/down\n\tJoystickEvent event = joystick.getEvent();\n\tvector<short> axis = event.getAxis();\n\tvector<bool> buttons = event.getButtons();\n\n\t\/\/ calculate position values\n\tdouble angular = (-1.0) * axis.at(0) \/ AXIS_MAX;\n\tdouble linear  = (-1.0) * axis.at(1) \/ AXIS_MAX;\n\tdouble stick2y = (-1.0) * axis.at(2) \/ AXIS_MAX;\n\n\tangular = min(max(angular, -1.0), 1.0);\n\tlinear = min(max(linear, -1.0), 1.0);\n\tstick2y = min(max(stick2y, -1.0), 1.0);\n\n\t\/\/ Don't send commands if we're not supposed to do so.\n\t\/\/ This is necessary as the remote *must not* permanently send \"stop\"\n\t\/\/ commands while not in use. This will make the robot winch crazily.\n\tif(!buttons.at(4) && !buttons.at(6)) {\n\t\tif(!safetyButtonWasPressed) {\n\t\t\treturn;\n\t\t} else {\n\t\t\tangular = 0.0;\n\t\t\tlinear  = 0.0;\n\t\t\tstick2y = 0.0;\n\t\t}\n\t}\n\tsafetyButtonWasPressed = true;\n\n\t\/\/ SPEEED-BUTTON!\n\tif (!buttons.at(0)) {\n\t\tlinear *= 0.25;\n\t} else {\n\t\t\/\/ Safety measures...\n\t\tlinear *= 0.75;\n\t}\n\t\/*if (!buttons.at(1)) {\n\t\tstick2y *= 0.; \/\/ Scale wheel rotation nice and slow\n\t} else {\n\t\tstick2y *= 0.7;\n\t}*\/\n\n\t\/\/ if (linear < 0) {\n\t\/\/ \tangular *= (-1.0);\n\t\/\/ }\n\n\t\/\/ Twist is supposed to contain desired speeds in m\/s\n\tgeometry_msgs::Twist twist;\n\ttwist.linear.x = linear * MAX_DRV_SPEED;\n\ttwist.angular.y = stick2y * MAX_ROT_SPEED;\n\ttwist.angular.z = angular * MAX_TURN_SPEED;\n\n\tpub.publish(twist);\n}\n\nint main(int argc, char **argv) {\n\t\/\/ init sdl and connect to controller\n\tSDL_Init(SDL_INIT_JOYSTICK);\n\tif(!joystick.init()) {\n\t\tcout << \"Could not find a joystick!\\n\";\n\t\treturn 1;\n\t}\n\tstring name = joystick.getName();\n\tcout << \"Used controller: \" << name.c_str() << endl;\n\t\n\t\/\/ init ros\n\tinit(argc, argv, \"remotecontrol\");\n\tNodeHandle n;\n\tpub = n.advertise<geometry_msgs::Twist>(\"cmd_vel\", 1);\n\n\t\/\/ startup main loop\n\tTimer remoteTimer = n.createTimer(Duration(0.0166 \/*60 Hz*\/), updateRemote);\n\tspin();\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: paramdialog.hxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: hr $ $Date: 2006-06-20 03:18:14 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n#ifndef _DBAUI_PARAMDIALOG_HXX_\n#define _DBAUI_PARAMDIALOG_HXX_\n\n#ifndef _DBAUI_COMMON_TYPES_HXX_\n#include \"commontypes.hxx\"\n#endif\n\n#ifndef _DIALOG_HXX\n#include <vcl\/dialog.hxx>\n#endif\n#ifndef _BUTTON_HXX\n#include <vcl\/button.hxx>\n#endif\n#ifndef _FIXED_HXX\n#include <vcl\/fixed.hxx>\n#endif\n#ifndef _EDIT_HXX\n#include <vcl\/edit.hxx>\n#endif\n#ifndef _SV_GROUP_HXX\n#include <vcl\/group.hxx>\n#endif\n#ifndef _SV_LSTBOX_HXX\n#include <vcl\/lstbox.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_UTIL_XNUMBERFORMATTER_HPP_\n#include <com\/sun\/star\/util\/XNumberFormatter.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_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#ifndef _COM_SUN_STAR_BEANS_PROPERTYVALUE_HPP_\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#endif\n#ifndef CONNECTIVITY_PREDICATEINPUT_HXX\n#include <connectivity\/predicateinput.hxx>\n#endif\n#ifndef SVX_QUERYDESIGNCONTEXT_HXX\n#include \"svx\/ParseContext.hxx\"\n#endif\n\nnamespace connectivity\n{\n    class OSQLParseNode;\n}\n\n\/\/.........................................................................\nnamespace dbaui\n{\n\/\/.........................................................................\n\n    \/\/==================================================================\n    \/\/= OParameterDialog\n    \/\/==================================================================\n    class OParameterDialog\n            :public ModalDialog\n            ,public ::svxform::OParseContextClient\n    {\n    protected:\n        \/\/ the controls\n        FixedLine       m_aNamesFrame;\n        ListBox         m_aAllParams;\n        FixedText       m_aValueFrame;\n        Edit            m_aParam;\n        PushButton      m_aTravelNext;\n        OKButton        m_aOKBtn;\n        CancelButton    m_aCancelBtn;\n\n        sal_uInt16          m_nCurrentlySelected;\n\n        ::com::sun::star::uno::Reference< ::com::sun::star::container::XIndexAccess >\n                        m_xParams;\n        ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection >\n                        m_xConnection;\n        ::com::sun::star::uno::Reference< ::com::sun::star::util::XNumberFormatter >\n                        m_xFormatter;\n        ::dbtools::OPredicateInputController\n                        m_aPredicateInput;\n\n        ByteVector      m_aVisitedParams;\n        Timer       m_aResetVisitFlag;\n            \/\/ we reset the \"visited flag\" 1 second after and entry has been selected\n\n        sal_Bool    m_bNeedErrorOnCurrent;\n\n        ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >\n                    m_aFinalValues;     \/\/\/ the final values as entered by the user\n\n    public:\n        OParameterDialog(Window* _pParent,\n            const ::com::sun::star::uno::Reference< ::com::sun::star::container::XIndexAccess > & _rParamContainer,\n            const ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection > & _rxConnection,\n            const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rxORB);\n        ~OParameterDialog();\n\n        ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >\n                    getValues() const { return m_aFinalValues; }\n\n\n    protected:\n        void Construct();\n\n        ::connectivity::OSQLParseNode* implPredicateTree(::rtl::OUString& _rErrorMessage, const UniString& _rStatement, const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet > & _rxField);\n\n    private:\n        DECL_LINK(OnVisitedTimeout, Timer*);\n        DECL_LINK(OnValueModified, Control*);\n        DECL_LINK(OnEntrySelected, ListBox*);\n        DECL_LINK(OnButtonClicked, PushButton*);\n        DECL_LINK(OnValueLoseFocus, Control*);\n    };\n\n\/\/.........................................................................\n}   \/\/ namespace dbaui\n\/\/.........................................................................\n\n#endif \/\/ _DBAUI_PARAMDIALOG_HXX_\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.8.308); FILE MERGED 2008\/03\/31 13:27:47 rt 1.8.308.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: paramdialog.hxx,v $\n * $Revision: 1.9 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org.  If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#ifndef _DBAUI_PARAMDIALOG_HXX_\n#define _DBAUI_PARAMDIALOG_HXX_\n\n#ifndef _DBAUI_COMMON_TYPES_HXX_\n#include \"commontypes.hxx\"\n#endif\n\n#ifndef _DIALOG_HXX\n#include <vcl\/dialog.hxx>\n#endif\n#ifndef _BUTTON_HXX\n#include <vcl\/button.hxx>\n#endif\n#ifndef _FIXED_HXX\n#include <vcl\/fixed.hxx>\n#endif\n#ifndef _EDIT_HXX\n#include <vcl\/edit.hxx>\n#endif\n#ifndef _SV_GROUP_HXX\n#include <vcl\/group.hxx>\n#endif\n#ifndef _SV_LSTBOX_HXX\n#include <vcl\/lstbox.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_UTIL_XNUMBERFORMATTER_HPP_\n#include <com\/sun\/star\/util\/XNumberFormatter.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_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#ifndef _COM_SUN_STAR_BEANS_PROPERTYVALUE_HPP_\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#endif\n#ifndef CONNECTIVITY_PREDICATEINPUT_HXX\n#include <connectivity\/predicateinput.hxx>\n#endif\n#ifndef SVX_QUERYDESIGNCONTEXT_HXX\n#include \"svx\/ParseContext.hxx\"\n#endif\n\nnamespace connectivity\n{\n    class OSQLParseNode;\n}\n\n\/\/.........................................................................\nnamespace dbaui\n{\n\/\/.........................................................................\n\n    \/\/==================================================================\n    \/\/= OParameterDialog\n    \/\/==================================================================\n    class OParameterDialog\n            :public ModalDialog\n            ,public ::svxform::OParseContextClient\n    {\n    protected:\n        \/\/ the controls\n        FixedLine       m_aNamesFrame;\n        ListBox         m_aAllParams;\n        FixedText       m_aValueFrame;\n        Edit            m_aParam;\n        PushButton      m_aTravelNext;\n        OKButton        m_aOKBtn;\n        CancelButton    m_aCancelBtn;\n\n        sal_uInt16          m_nCurrentlySelected;\n\n        ::com::sun::star::uno::Reference< ::com::sun::star::container::XIndexAccess >\n                        m_xParams;\n        ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection >\n                        m_xConnection;\n        ::com::sun::star::uno::Reference< ::com::sun::star::util::XNumberFormatter >\n                        m_xFormatter;\n        ::dbtools::OPredicateInputController\n                        m_aPredicateInput;\n\n        ByteVector      m_aVisitedParams;\n        Timer       m_aResetVisitFlag;\n            \/\/ we reset the \"visited flag\" 1 second after and entry has been selected\n\n        sal_Bool    m_bNeedErrorOnCurrent;\n\n        ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >\n                    m_aFinalValues;     \/\/\/ the final values as entered by the user\n\n    public:\n        OParameterDialog(Window* _pParent,\n            const ::com::sun::star::uno::Reference< ::com::sun::star::container::XIndexAccess > & _rParamContainer,\n            const ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection > & _rxConnection,\n            const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rxORB);\n        ~OParameterDialog();\n\n        ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >\n                    getValues() const { return m_aFinalValues; }\n\n\n    protected:\n        void Construct();\n\n        ::connectivity::OSQLParseNode* implPredicateTree(::rtl::OUString& _rErrorMessage, const UniString& _rStatement, const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet > & _rxField);\n\n    private:\n        DECL_LINK(OnVisitedTimeout, Timer*);\n        DECL_LINK(OnValueModified, Control*);\n        DECL_LINK(OnEntrySelected, ListBox*);\n        DECL_LINK(OnButtonClicked, PushButton*);\n        DECL_LINK(OnValueLoseFocus, Control*);\n    };\n\n\/\/.........................................................................\n}   \/\/ namespace dbaui\n\/\/.........................................................................\n\n#endif \/\/ _DBAUI_PARAMDIALOG_HXX_\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: uiservices.cxx,v $\n *\n *  $Revision: 1.12 $\n *\n *  last change: $Author: oj $ $Date: 2002-03-04 13:12: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 WARRUNTY OF ANY KIND, EITHER EXPRESS OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRUNTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc..\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _CPPUHELPER_FACTORY_HXX_\n#include <cppuhelper\/factory.hxx>\n#endif\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n#ifndef _DBU_REGHELPER_HXX_\n#include \"dbu_reghelper.hxx\"\n#endif\n\n\/********************************************************************************************\/\n\nusing namespace ::rtl;\nusing namespace ::dbaui;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::registry;\n\n\/\/***************************************************************************************\n\/\/\n\/\/ registry functions\nextern \"C\" void SAL_CALL createRegistryInfo_ODatabaseAdministrationDialog();\nextern \"C\" void SAL_CALL createRegistryInfo_OSQLMessageDialog();\nextern \"C\" void SAL_CALL createRegistryInfo_OBrowser();\nextern \"C\" void SAL_CALL createRegistryInfo_OFormGridView();\nextern \"C\" void SAL_CALL createRegistryInfo_DBContentLoader();\nextern \"C\" void SAL_CALL writeDBLoaderInfo(void* pRegistryKey);\nextern \"C\" void SAL_CALL createRegistryInfo_OInteractionHandler();\nextern \"C\" void SAL_CALL createRegistryInfo_SbaXGridControl();\nextern \"C\" void SAL_CALL createRegistryInfo_OQueryControl();\nextern \"C\" void SAL_CALL createRegistryInfo_OTableControl();\nextern \"C\" void SAL_CALL createRegistryInfo_ORelationControl();\nextern \"C\" void SAL_CALL createRegistryInfo_ORowsetFilterDialog();\nextern \"C\" void SAL_CALL createRegistryInfo_ORowsetOrderDialog();\n\n\/\/***************************************************************************************\nextern \"C\" void SAL_CALL createRegistryInfo_DBU()\n{\n    static sal_Bool bInit = sal_False;\n    if (!bInit)\n    {\n        createRegistryInfo_ODatabaseAdministrationDialog();\n        createRegistryInfo_OSQLMessageDialog();\n        createRegistryInfo_OBrowser();\n        createRegistryInfo_OFormGridView();\n        createRegistryInfo_DBContentLoader();\n        createRegistryInfo_OInteractionHandler();\n        createRegistryInfo_SbaXGridControl();\n        createRegistryInfo_OQueryControl();\n        createRegistryInfo_OTableControl();\n        createRegistryInfo_ORelationControl();\n        createRegistryInfo_ORowsetFilterDialog();\n        createRegistryInfo_ORowsetOrderDialog();\n        bInit = sal_True;\n    }\n}\n\n\/\/---------------------------------------------------------------------------------------\n\nextern \"C\" void SAL_CALL component_getImplementationEnvironment(\n                const sal_Char  **ppEnvTypeName,\n                uno_Environment **ppEnv\n            )\n{\n    createRegistryInfo_DBU();\n    *ppEnvTypeName = CPPU_CURRENT_LANGUAGE_BINDING_NAME;\n}\n\n\/\/---------------------------------------------------------------------------------------\nextern \"C\" sal_Bool SAL_CALL component_writeInfo(\n                void* pServiceManager,\n                void* pRegistryKey\n            )\n{\n    if (pRegistryKey)\n    try\n    {\n        writeDBLoaderInfo(pRegistryKey);\n        return ::dbaui::OModuleRegistration::writeComponentInfos(\n            static_cast<XMultiServiceFactory*>(pServiceManager),\n            static_cast<XRegistryKey*>(pRegistryKey));\n    }\n    catch (InvalidRegistryException& )\n    {\n        OSL_ENSURE(sal_False, \"DBA::component_writeInfo : could not create a registry key ! ## InvalidRegistryException !\");\n    }\n\n    return sal_False;\n}\n\n\/\/---------------------------------------------------------------------------------------\nextern \"C\" void* SAL_CALL component_getFactory(\n                    const sal_Char* pImplementationName,\n                    void* pServiceManager,\n                    void* pRegistryKey)\n{\n    Reference< XInterface > xRet;\n    if (pServiceManager && pImplementationName)\n    {\n        xRet = ::dbaui::OModuleRegistration::getComponentFactory(\n            ::rtl::OUString::createFromAscii(pImplementationName),\n            static_cast< XMultiServiceFactory* >(pServiceManager));\n    }\n\n    if (xRet.is())\n        xRet->acquire();\n    return xRet.get();\n};\n<commit_msg>INTEGRATION: CWS qwizards1 (1.12.192); FILE MERGED 2004\/01\/14 09:16:04 oj 1.12.192.1: #i24380# new services for column descriptor control and model<commit_after>\/*************************************************************************\n *\n *  $RCSfile: uiservices.cxx,v $\n *\n *  $Revision: 1.13 $\n *\n *  last change: $Author: kz $ $Date: 2004-05-19 13:56: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 WARRUNTY OF ANY KIND, EITHER EXPRESS OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRUNTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc..\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _CPPUHELPER_FACTORY_HXX_\n#include <cppuhelper\/factory.hxx>\n#endif\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n#ifndef _DBU_REGHELPER_HXX_\n#include \"dbu_reghelper.hxx\"\n#endif\n\n\/********************************************************************************************\/\n\nusing namespace ::rtl;\nusing namespace ::dbaui;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::registry;\n\n\/\/***************************************************************************************\n\/\/\n\/\/ registry functions\nextern \"C\" void SAL_CALL createRegistryInfo_ODatabaseAdministrationDialog();\nextern \"C\" void SAL_CALL createRegistryInfo_OSQLMessageDialog();\nextern \"C\" void SAL_CALL createRegistryInfo_OBrowser();\nextern \"C\" void SAL_CALL createRegistryInfo_OFormGridView();\nextern \"C\" void SAL_CALL createRegistryInfo_DBContentLoader();\nextern \"C\" void SAL_CALL writeDBLoaderInfo(void* pRegistryKey);\nextern \"C\" void SAL_CALL createRegistryInfo_OInteractionHandler();\nextern \"C\" void SAL_CALL createRegistryInfo_SbaXGridControl();\nextern \"C\" void SAL_CALL createRegistryInfo_OQueryControl();\nextern \"C\" void SAL_CALL createRegistryInfo_OTableControl();\nextern \"C\" void SAL_CALL createRegistryInfo_ORelationControl();\nextern \"C\" void SAL_CALL createRegistryInfo_ORowsetFilterDialog();\nextern \"C\" void SAL_CALL createRegistryInfo_ORowsetOrderDialog();\nextern \"C\" void SAL_CALL createRegistryInfo_OColumnControlModel();\nextern \"C\" void SAL_CALL createRegistryInfo_OColumnControl();\n\n\/\/***************************************************************************************\nextern \"C\" void SAL_CALL createRegistryInfo_DBU()\n{\n    static sal_Bool bInit = sal_False;\n    if (!bInit)\n    {\n        createRegistryInfo_ODatabaseAdministrationDialog();\n        createRegistryInfo_OSQLMessageDialog();\n        createRegistryInfo_OBrowser();\n        createRegistryInfo_OFormGridView();\n        createRegistryInfo_DBContentLoader();\n        createRegistryInfo_OInteractionHandler();\n        createRegistryInfo_SbaXGridControl();\n        createRegistryInfo_OQueryControl();\n        createRegistryInfo_OTableControl();\n        createRegistryInfo_ORelationControl();\n        createRegistryInfo_ORowsetFilterDialog();\n        createRegistryInfo_ORowsetOrderDialog();\n        createRegistryInfo_OColumnControlModel();\n        createRegistryInfo_OColumnControl();\n        bInit = sal_True;\n    }\n}\n\n\/\/---------------------------------------------------------------------------------------\n\nextern \"C\" void SAL_CALL component_getImplementationEnvironment(\n                const sal_Char  **ppEnvTypeName,\n                uno_Environment **ppEnv\n            )\n{\n    createRegistryInfo_DBU();\n    *ppEnvTypeName = CPPU_CURRENT_LANGUAGE_BINDING_NAME;\n}\n\n\/\/---------------------------------------------------------------------------------------\nextern \"C\" sal_Bool SAL_CALL component_writeInfo(\n                void* pServiceManager,\n                void* pRegistryKey\n            )\n{\n    if (pRegistryKey)\n    try\n    {\n        writeDBLoaderInfo(pRegistryKey);\n        return ::dbaui::OModuleRegistration::writeComponentInfos(\n            static_cast<XMultiServiceFactory*>(pServiceManager),\n            static_cast<XRegistryKey*>(pRegistryKey));\n    }\n    catch (InvalidRegistryException& )\n    {\n        OSL_ENSURE(sal_False, \"DBA::component_writeInfo : could not create a registry key ! ## InvalidRegistryException !\");\n    }\n\n    return sal_False;\n}\n\n\/\/---------------------------------------------------------------------------------------\nextern \"C\" void* SAL_CALL component_getFactory(\n                    const sal_Char* pImplementationName,\n                    void* pServiceManager,\n                    void* pRegistryKey)\n{\n    Reference< XInterface > xRet;\n    if (pServiceManager && pImplementationName)\n    {\n        xRet = ::dbaui::OModuleRegistration::getComponentFactory(\n            ::rtl::OUString::createFromAscii(pImplementationName),\n            static_cast< XMultiServiceFactory* >(pServiceManager));\n    }\n\n    if (xRet.is())\n        xRet->acquire();\n    return xRet.get();\n};\n<|endoftext|>"}
{"text":"<commit_before>#include <SFML\/Graphics.hpp>\n#include <Astra\/Astra.h>\n#include <AstraUL\/AstraUL.h>\n#include \"..\/..\/common\/LitDepthVisualizer.h\"\n#include <chrono>\n#include <iostream>\n#include <iomanip>\n\nclass MultiFrameListener : public astra::FrameReadyListener\n{\npublic:\n    using BufferPtr = std::unique_ptr<uint8_t[]>;\n\n    struct stream_view\n    {\n        sf::Sprite sprite;\n        sf::Texture texture;\n        BufferPtr buffer;\n        int width{0};\n        int height{0};\n    };\n\n    MultiFrameListener()\n    {\n        m_lastTimepoint = clock_type::now();\n    }\n\n    void init_texture(int width, int height, stream_view& view)\n    {\n        if (view.buffer == nullptr || width != view.width || height != view.height)\n        {\n            view.width = width;\n            view.height = height;\n\n            \/\/ texture is RGBA\n            int byteLength = width * height * 4;\n\n            view.buffer = BufferPtr(new uint8_t[byteLength]);\n            memset(view.buffer.get(), 0, byteLength);\n\n            view.texture.create(width, height);\n            view.sprite.setTexture(view.texture);\n            view.sprite.setPosition(0, 0);\n        }\n    }\n\n    void check_fps()\n    {\n        const double frameWeight = 0.2;\n\n        auto newTimepoint = clock_type::now();\n        auto frameDuration = std::chrono::duration_cast<duration_type>(newTimepoint - m_lastTimepoint);\n\n        m_frameDuration = frameDuration * frameWeight + m_frameDuration * (1 - frameWeight);\n        m_lastTimepoint = newTimepoint;\n\n        double fps = 1.0 \/ m_frameDuration.count();\n\n        auto precision = std::cout.precision();\n        std::cout << std::fixed\n                  << std::setprecision(1)\n                  << fps << \" fps (\"\n                  << std::setprecision(2)\n                  << frameDuration.count() * 1000 << \" ms)\"\n                  << std::setprecision(precision)\n                  << std::endl;\n    }\n\n    virtual void on_frame_ready(astra::StreamReader& reader,\n                                astra::Frame& frame) override\n    {\n        astra::PointFrame pointFrame = frame.get<astra::PointFrame>();\n        astra::ColorFrame colorFrame = frame.get<astra::ColorFrame>();\n\n        int depthWidth = pointFrame.resolutionX();\n        int depthHeight = pointFrame.resolutionY();\n        int colorWidth = colorFrame.resolutionX();\n        int colorHeight = colorFrame.resolutionY();\n\n        init_texture(depthWidth, depthHeight, m_depthView);\n        init_texture(colorWidth, colorHeight, m_colorView);\n\n        m_visualizer.update(pointFrame);\n\n        astra_rgb_pixel_t* vizBuffer = m_visualizer.get_output();\n        for(int i = 0; i < depthWidth * depthHeight; i++)\n        {\n            int rgbaOffset = i * 4;\n            m_depthView.buffer[rgbaOffset] = vizBuffer[i].r;\n            m_depthView.buffer[rgbaOffset + 1] = vizBuffer[i].g;\n            m_depthView.buffer[rgbaOffset + 2] = vizBuffer[i].b;\n            m_depthView.buffer[rgbaOffset + 3] = 255;\n        }\n\n        const astra::RGBPixel* color = colorFrame.data();\n        for(int i = 0; i < colorWidth * colorHeight; i++)\n        {\n            int rgbaOffset = i * 4;\n            m_colorView.buffer[rgbaOffset] = color[i].r;\n            m_colorView.buffer[rgbaOffset + 1] = color[i].g;\n            m_colorView.buffer[rgbaOffset + 2] = color[i].b;\n            m_colorView.buffer[rgbaOffset + 3] = 255;\n        }\n\n        m_depthView.texture.update(m_depthView.buffer.get());\n        m_colorView.texture.update(m_colorView.buffer.get());\n\n        check_fps();\n    }\n\n    void drawTo(sf::RenderWindow& window)\n    {\n        int viewSize = (int)(window.getView().getSize().x \/ 2.0f);\n\n        if (m_depthView.buffer != nullptr)\n        {\n            float depthScale = viewSize \/ (float)m_depthView.width;\n            float height = m_depthView.height * depthScale;\n            int horzCenter = window.getView().getCenter().y - height \/ 2.0f;\n            m_depthView.sprite.setScale(depthScale, depthScale);\n            m_depthView.sprite.setPosition(0, horzCenter);\n            window.draw(m_depthView.sprite);\n        }\n\n        if (m_colorView.buffer != nullptr)\n        {\n            float colorScale = viewSize \/ (float)m_colorView.width;\n            float height = m_depthView.height * colorScale;\n            int horzCenter = window.getView().getCenter().y - height \/ 2.0f;\n            m_colorView.sprite.setScale(colorScale, colorScale);\n            m_colorView.sprite.setPosition(viewSize, horzCenter);\n            window.draw(m_colorView.sprite);\n        }\n    }\n\nprivate:\n    samples::common::LitDepthVisualizer m_visualizer;\n\n    using duration_type = std::chrono::duration<double>;\n    duration_type m_frameDuration{0.0};\n\n    using clock_type = std::chrono::system_clock;\n    std::chrono::time_point<clock_type> m_lastTimepoint;\n\n    stream_view m_depthView;\n    stream_view m_colorView;\n};\n\nint main(int argc, char** argv)\n{\n    astra::Astra::initialize();\n\n    sf::VideoMode mode = sf::VideoMode::getFullscreenModes()[0];\n    sf::RenderWindow window(mode, \"Stream Viewer\", sf::Style::Fullscreen);\n\n    astra::Sensor sensor;\n    astra::StreamReader reader = sensor.create_reader();\n\n    reader.stream<astra::PointStream>().start();\n    reader.stream<astra::DepthStream>().start();\n\n    astra::ImageStreamMode depthMode;\n\n    depthMode.set_height(320);\n    depthMode.set_width(240);\n    depthMode.set_pixelFormat(astra_pixel_formats::ASTRA_PIXEL_FORMAT_DEPTH_MM);\n    depthMode.set_fps(30);\n\n    reader.stream<astra::DepthStream>().set_mode(depthMode);\n    reader.stream<astra::ColorStream>().start();\n\n    astra::ImageStreamMode colorMode;\n\n    colorMode.set_height(320);\n    colorMode.set_width(240);\n    colorMode.set_pixelFormat(astra_pixel_formats::ASTRA_PIXEL_FORMAT_RGB888);\n    colorMode.set_fps(30);\n\n    reader.stream<astra::ColorStream>().set_mode(colorMode);\n\n    MultiFrameListener listener;\n\n    reader.addListener(listener);\n\n    while (window.isOpen())\n    {\n        astra_temp_update();\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::KeyPressed) && (event.key.code == sf::Keyboard::Escape))\n                window.close();\n        }\n\n        \/\/ clear the window with black color\n        window.clear(sf::Color::Black);\n\n        listener.drawTo(window);\n        window.display();\n    }\n\n    astra::Astra::terminate();\n    return 0;\n}\n<commit_msg>Fix position of color view in SimpleStreamViewer<commit_after>#include <SFML\/Graphics.hpp>\n#include <Astra\/Astra.h>\n#include <AstraUL\/AstraUL.h>\n#include \"..\/..\/common\/LitDepthVisualizer.h\"\n#include <chrono>\n#include <iostream>\n#include <iomanip>\n\nclass MultiFrameListener : public astra::FrameReadyListener\n{\npublic:\n    using BufferPtr = std::unique_ptr<uint8_t[]>;\n\n    struct stream_view\n    {\n        sf::Sprite sprite;\n        sf::Texture texture;\n        BufferPtr buffer;\n        int width{0};\n        int height{0};\n    };\n\n    MultiFrameListener()\n    {\n        m_lastTimepoint = clock_type::now();\n    }\n\n    void init_texture(int width, int height, stream_view& view)\n    {\n        if (view.buffer == nullptr || width != view.width || height != view.height)\n        {\n            view.width = width;\n            view.height = height;\n\n            \/\/ texture is RGBA\n            int byteLength = width * height * 4;\n\n            view.buffer = BufferPtr(new uint8_t[byteLength]);\n            memset(view.buffer.get(), 0, byteLength);\n\n            view.texture.create(width, height);\n            view.sprite.setTexture(view.texture);\n            view.sprite.setPosition(0, 0);\n        }\n    }\n\n    void check_fps()\n    {\n        const double frameWeight = 0.2;\n\n        auto newTimepoint = clock_type::now();\n        auto frameDuration = std::chrono::duration_cast<duration_type>(newTimepoint - m_lastTimepoint);\n\n        m_frameDuration = frameDuration * frameWeight + m_frameDuration * (1 - frameWeight);\n        m_lastTimepoint = newTimepoint;\n\n        double fps = 1.0 \/ m_frameDuration.count();\n\n        auto precision = std::cout.precision();\n        std::cout << std::fixed\n                  << std::setprecision(1)\n                  << fps << \" fps (\"\n                  << std::setprecision(2)\n                  << frameDuration.count() * 1000 << \" ms)\"\n                  << std::setprecision(precision)\n                  << std::endl;\n    }\n\n    virtual void on_frame_ready(astra::StreamReader& reader,\n                                astra::Frame& frame) override\n    {\n        astra::PointFrame pointFrame = frame.get<astra::PointFrame>();\n        astra::ColorFrame colorFrame = frame.get<astra::ColorFrame>();\n\n        int depthWidth = pointFrame.resolutionX();\n        int depthHeight = pointFrame.resolutionY();\n        int colorWidth = colorFrame.resolutionX();\n        int colorHeight = colorFrame.resolutionY();\n\n        init_texture(depthWidth, depthHeight, m_depthView);\n        init_texture(colorWidth, colorHeight, m_colorView);\n\n        m_visualizer.update(pointFrame);\n\n        astra_rgb_pixel_t* vizBuffer = m_visualizer.get_output();\n        for(int i = 0; i < depthWidth * depthHeight; i++)\n        {\n            int rgbaOffset = i * 4;\n            m_depthView.buffer[rgbaOffset] = vizBuffer[i].r;\n            m_depthView.buffer[rgbaOffset + 1] = vizBuffer[i].g;\n            m_depthView.buffer[rgbaOffset + 2] = vizBuffer[i].b;\n            m_depthView.buffer[rgbaOffset + 3] = 255;\n        }\n\n        const astra::RGBPixel* color = colorFrame.data();\n        for(int i = 0; i < colorWidth * colorHeight; i++)\n        {\n            int rgbaOffset = i * 4;\n            m_colorView.buffer[rgbaOffset] = color[i].r;\n            m_colorView.buffer[rgbaOffset + 1] = color[i].g;\n            m_colorView.buffer[rgbaOffset + 2] = color[i].b;\n            m_colorView.buffer[rgbaOffset + 3] = 255;\n        }\n\n        m_depthView.texture.update(m_depthView.buffer.get());\n        m_colorView.texture.update(m_colorView.buffer.get());\n\n        check_fps();\n    }\n\n    void drawTo(sf::RenderWindow& window)\n    {\n        int viewSize = (int)(window.getView().getSize().x \/ 2.0f);\n\n        if (m_depthView.buffer != nullptr)\n        {\n            float depthScale = viewSize \/ (float)m_depthView.width;\n            float height = m_depthView.height * depthScale;\n            int horzCenter = window.getView().getCenter().y - height \/ 2.0f;\n            m_depthView.sprite.setScale(depthScale, depthScale);\n            m_depthView.sprite.setPosition(0, horzCenter);\n            window.draw(m_depthView.sprite);\n        }\n\n        if (m_colorView.buffer != nullptr)\n        {\n            float colorScale = viewSize \/ (float)m_colorView.width;\n            float height = m_colorView.height * colorScale;\n            int horzCenter = window.getView().getCenter().y - height \/ 2.0f;\n            m_colorView.sprite.setScale(colorScale, colorScale);\n            m_colorView.sprite.setPosition(viewSize, horzCenter);\n            window.draw(m_colorView.sprite);\n        }\n    }\n\nprivate:\n    samples::common::LitDepthVisualizer m_visualizer;\n\n    using duration_type = std::chrono::duration<double>;\n    duration_type m_frameDuration{0.0};\n\n    using clock_type = std::chrono::system_clock;\n    std::chrono::time_point<clock_type> m_lastTimepoint;\n\n    stream_view m_depthView;\n    stream_view m_colorView;\n};\n\nint main(int argc, char** argv)\n{\n    astra::Astra::initialize();\n\n    sf::VideoMode mode = sf::VideoMode::getFullscreenModes()[0];\n    sf::RenderWindow window(mode, \"Stream Viewer\", sf::Style::Fullscreen);\n\n    astra::Sensor sensor;\n    astra::StreamReader reader = sensor.create_reader();\n\n    reader.stream<astra::PointStream>().start();\n    reader.stream<astra::DepthStream>().start();\n\n    astra::ImageStreamMode depthMode;\n\n    depthMode.set_height(320);\n    depthMode.set_width(240);\n    depthMode.set_pixelFormat(astra_pixel_formats::ASTRA_PIXEL_FORMAT_DEPTH_MM);\n    depthMode.set_fps(30);\n\n    reader.stream<astra::DepthStream>().set_mode(depthMode);\n    reader.stream<astra::ColorStream>().start();\n\n    astra::ImageStreamMode colorMode;\n\n    colorMode.set_height(320);\n    colorMode.set_width(240);\n    colorMode.set_pixelFormat(astra_pixel_formats::ASTRA_PIXEL_FORMAT_RGB888);\n    colorMode.set_fps(30);\n\n    reader.stream<astra::ColorStream>().set_mode(colorMode);\n\n    MultiFrameListener listener;\n\n    reader.addListener(listener);\n\n    while (window.isOpen())\n    {\n        astra_temp_update();\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::KeyPressed) && (event.key.code == sf::Keyboard::Escape))\n                window.close();\n        }\n\n        \/\/ clear the window with black color\n        window.clear(sf::Color::Black);\n\n        listener.drawTo(window);\n        window.display();\n    }\n\n    astra::Astra::terminate();\n    return 0;\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) 2009 Benoit Jacob <jacob.benoit.1@gmail.com>\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\/LU>\n#include <algorithm>\n\nMatrix4f inverse(const Matrix4f& m)\n{\n  Matrix4f r;\n  r(0,0) = m.minor(0,0).determinant();\n  r(1,0) = -m.minor(0,1).determinant();\n  r(2,0) = m.minor(0,2).determinant();\n  r(3,0) = -m.minor(0,3).determinant();\n  r(0,2) = m.minor(2,0).determinant();\n  r(1,2) = -m.minor(2,1).determinant();\n  r(2,2) = m.minor(2,2).determinant();\n  r(3,2) = -m.minor(2,3).determinant();\n  r(0,1) = -m.minor(1,0).determinant();\n  r(1,1) = m.minor(1,1).determinant();\n  r(2,1) = -m.minor(1,2).determinant();\n  r(3,1) = m.minor(1,3).determinant();\n  r(0,3) = -m.minor(3,0).determinant();\n  r(1,3) = m.minor(3,1).determinant();\n  r(2,3) = -m.minor(3,2).determinant();\n  r(3,3) = m.minor(3,3).determinant();\n  return r \/ (m(0,0)*r(0,0) + m(1,0)*r(0,1) + m(2,0)*r(0,2) + m(3,0)*r(0,3));\n}\n\ntemplate<typename MatrixType> void inverse_permutation_4x4()\n{\n  typedef typename MatrixType::Scalar Scalar;\n  typedef typename MatrixType::RealScalar RealScalar;\n  double error_max = 0.;\n  Vector4i indices(0,1,2,3);\n  for(int i = 0; i < 24; ++i)\n  {\n    MatrixType m = PermutationMatrix<4>(indices);\n    MatrixType inv = m.inverse();\n    double error = double( (m*inv-MatrixType::Identity()).norm() \/ epsilon<Scalar>() );\n    error_max = std::max(error_max, error);\n    std::next_permutation(indices.data(),indices.data()+4);\n  }\n  std::cerr << \"inverse_permutation_4x4, Scalar = \" << type_name<Scalar>() << std::endl;\n  EIGEN_DEBUG_VAR(error_max);\n  VERIFY(error_max < 1. );\n}\n\ntemplate<typename MatrixType> void inverse_general_4x4(int repeat)\n{\n  typedef typename MatrixType::Scalar Scalar;\n  typedef typename MatrixType::RealScalar RealScalar;\n  double error_sum = 0., error_max = 0.;\n  for(int i = 0; i < repeat; ++i)\n  {\n    MatrixType m;\n    RealScalar absdet;\n    do {\n      m = MatrixType::Random();\n      absdet = ei_abs(m.determinant());\n    } while(absdet < 2*epsilon<Scalar>() );\n    MatrixType inv = m.inverse();\n    double error = double( (m*inv-MatrixType::Identity()).norm() * absdet \/ epsilon<Scalar>() );\n    error_sum += error;\n    error_max = std::max(error_max, error);\n  }\n  std::cerr << \"inverse_general_4x4, Scalar = \" << type_name<Scalar>() << std::endl;\n  double error_avg = error_sum \/ repeat;\n  EIGEN_DEBUG_VAR(error_avg);\n  EIGEN_DEBUG_VAR(error_max);\n  VERIFY(error_avg < (NumTraits<Scalar>::IsComplex ? 8.4 : 1.4) );\n  VERIFY(error_max < (NumTraits<Scalar>::IsComplex ? 150.0 : 75.) );\n}\n\nvoid test_prec_inverse_4x4()\n{\n  CALL_SUBTEST_1((inverse_permutation_4x4<Matrix4f>()));\n  CALL_SUBTEST_1(( inverse_general_4x4<Matrix4f>(200000 * g_repeat) ));\n\n  CALL_SUBTEST_2((inverse_permutation_4x4<Matrix<double,4,4,RowMajor> >()));\n  CALL_SUBTEST_2(( inverse_general_4x4<Matrix<double,4,4,RowMajor> >(200000 * g_repeat) ));\n\n  CALL_SUBTEST_3((inverse_permutation_4x4<Matrix4cf>()));\n  CALL_SUBTEST_3((inverse_general_4x4<Matrix4cf>(50000 * g_repeat)));\n}\n<commit_msg>forward port slight changes in the 4x4 inverse test<commit_after>\/\/ This file is part of Eigen, a lightweight C++ template library\n\/\/ for linear algebra.\n\/\/\n\/\/ Copyright (C) 2009 Benoit Jacob <jacob.benoit.1@gmail.com>\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\/LU>\n#include <algorithm>\n\nMatrix4f inverse(const Matrix4f& m)\n{\n  Matrix4f r;\n  r(0,0) = m.minor(0,0).determinant();\n  r(1,0) = -m.minor(0,1).determinant();\n  r(2,0) = m.minor(0,2).determinant();\n  r(3,0) = -m.minor(0,3).determinant();\n  r(0,2) = m.minor(2,0).determinant();\n  r(1,2) = -m.minor(2,1).determinant();\n  r(2,2) = m.minor(2,2).determinant();\n  r(3,2) = -m.minor(2,3).determinant();\n  r(0,1) = -m.minor(1,0).determinant();\n  r(1,1) = m.minor(1,1).determinant();\n  r(2,1) = -m.minor(1,2).determinant();\n  r(3,1) = m.minor(1,3).determinant();\n  r(0,3) = -m.minor(3,0).determinant();\n  r(1,3) = m.minor(3,1).determinant();\n  r(2,3) = -m.minor(3,2).determinant();\n  r(3,3) = m.minor(3,3).determinant();\n  return r \/ (m(0,0)*r(0,0) + m(1,0)*r(0,1) + m(2,0)*r(0,2) + m(3,0)*r(0,3));\n}\n\ntemplate<typename MatrixType> void inverse_permutation_4x4()\n{\n  typedef typename MatrixType::Scalar Scalar;\n  typedef typename MatrixType::RealScalar RealScalar;\n  double error_max = 0.;\n  Vector4i indices(0,1,2,3);\n  for(int i = 0; i < 24; ++i)\n  {\n    MatrixType m = PermutationMatrix<4>(indices);\n    MatrixType inv = m.inverse();\n    double error = double( (m*inv-MatrixType::Identity()).norm() \/ epsilon<Scalar>() );\n    error_max = std::max(error_max, error);\n    std::next_permutation(indices.data(),indices.data()+4);\n  }\n  std::cerr << \"inverse_permutation_4x4, Scalar = \" << type_name<Scalar>() << std::endl;\n  EIGEN_DEBUG_VAR(error_max);\n  VERIFY(error_max < 1. );\n}\n\ntemplate<typename MatrixType> void inverse_general_4x4(int repeat)\n{\n  typedef typename MatrixType::Scalar Scalar;\n  typedef typename MatrixType::RealScalar RealScalar;\n  double error_sum = 0., error_max = 0.;\n  for(int i = 0; i < repeat; ++i)\n  {\n    MatrixType m;\n    RealScalar absdet;\n    do {\n      m = MatrixType::Random();\n      absdet = ei_abs(m.determinant());\n    } while(absdet < 10 * epsilon<Scalar>());\n    MatrixType inv = m.inverse();\n    double error = double( (m*inv-MatrixType::Identity()).norm() * absdet \/ epsilon<Scalar>() );\n    error_sum += error;\n    error_max = std::max(error_max, error);\n  }\n  std::cerr << \"inverse_general_4x4, Scalar = \" << type_name<Scalar>() << std::endl;\n  double error_avg = error_sum \/ repeat;\n  EIGEN_DEBUG_VAR(error_avg);\n  EIGEN_DEBUG_VAR(error_max);\n  VERIFY(error_avg < (NumTraits<Scalar>::IsComplex ? 8.4 : 1.4) );\n  VERIFY(error_max < (NumTraits<Scalar>::IsComplex ? 160.0 : 75.) );\n}\n\nvoid test_prec_inverse_4x4()\n{\n  CALL_SUBTEST_1((inverse_permutation_4x4<Matrix4f>()));\n  CALL_SUBTEST_1(( inverse_general_4x4<Matrix4f>(200000 * g_repeat) ));\n\n  CALL_SUBTEST_2((inverse_permutation_4x4<Matrix<double,4,4,RowMajor> >()));\n  CALL_SUBTEST_2(( inverse_general_4x4<Matrix<double,4,4,RowMajor> >(200000 * g_repeat) ));\n\n  CALL_SUBTEST_3((inverse_permutation_4x4<Matrix4cf>()));\n  CALL_SUBTEST_3((inverse_general_4x4<Matrix4cf>(50000 * g_repeat)));\n}\n<|endoftext|>"}
{"text":"<commit_before>#define DOCTEST_CONFIG_IMPLEMENT_WITH_MAIN\n#include \"doctest.h\"\n\n#include <duck\/range\/combinator.h>\n#include <duck\/range\/range.h>\n#include <list>\n#include <vector>\n\n\/\/ FIXME\n#include <iostream>\ntemplate <typename Derived>\nstatic std::ostream & operator<< (std::ostream & os, const duck::Range::Base<Derived> & r) {\n\tos << \"Range(\";\n\tfor (const auto & v : r.derived ())\n\t\tos << v << \",\";\n\treturn os << \")\";\n}\n\nTYPE_TO_STRING (std::vector<int>);\nTYPE_TO_STRING (std::list<int>);\nusing TestedContainerTypes = doctest::Types<std::vector<int>, std::list<int>>;\n\nTEST_CASE_TEMPLATE (\"reverse, counted, filter, apply\", Container, TestedContainerTypes) {\n\tusing namespace duck::Range::Combinator;\n\tContainer vec{0, 1, 2, 3, 4};\n\tauto r = duck::range (vec);\n\n\tauto reversed_range = r | reversed ();\n\tCHECK (reversed_range.size () == r.size ());\n\tCHECK (reversed_range == duck::range (vec.rbegin (), vec.rend ()));\n\n\tauto counted_range = r | counted<int> ();\n\tfor (auto & iv : counted_range) {\n\t\tCHECK (iv.index == iv.value ());\n\t}\n\n\tauto filtered_range = r | filter ([](int i) { return i % 2 == 0; });\n\tCHECK (filtered_range.size () == 3);\n\tCHECK (filtered_range == duck::range ({0, 2, 4}));\n\tauto chained_filtered_range =\n\t    r | filter ([](int i) { return i < 2; }) | filter ([](int i) { return i > 0; });\n\tCHECK (chained_filtered_range.size () == 1);\n\tCHECK (chained_filtered_range.front () == 1);\n\n\tauto applied_range =\n\t    r | apply ([](int i) { return i - 2; }) | filter ([](int i) { return i >= 0; });\n\tCHECK (applied_range.size () == 3);\n\tCHECK (applied_range == duck::range (0, 3));\n}\n<commit_msg>Range combinator: betters tests<commit_after>#define DOCTEST_CONFIG_IMPLEMENT_WITH_MAIN\n#include \"doctest.h\"\n\n#include <duck\/range\/combinator.h>\n#include <duck\/range\/range.h>\n#include <forward_list>\n#include <iterator>\n#include <list>\n#include <vector>\n\n\/\/ FIXME\n#include <iostream>\ntemplate <typename Derived>\nstatic std::ostream & operator<< (std::ostream & os, const duck::Range::Base<Derived> & r) {\n\tos << \"Range(\";\n\tfor (const auto & v : r.derived ())\n\t\tos << v << \",\";\n\treturn os << \")\";\n}\n\nTYPE_TO_STRING (std::vector<int>);\nTYPE_TO_STRING (std::list<int>);\nTYPE_TO_STRING (std::forward_list<int>);\n\nusing BidirContainers = doctest::Types<std::vector<int>, std::list<int>>;\nusing ForwardContainers = doctest::Types<std::vector<int>, std::list<int>, std::forward_list<int>>;\n\nnamespace DRC = duck::Range::Combinator;\nconst auto values = {0, 1, 2, 3, 4};\n\nTEST_CASE_TEMPLATE (\"reverse\", Container, BidirContainers) {\n\tauto range = duck::range (Container{values}) | DRC::reversed ();\n\tCHECK (range.size () == values.size ());\n\tusing RevIt = std::reverse_iterator<typename std::initializer_list<int>::iterator>;\n\tCHECK (range == duck::range (RevIt{values.end ()}, RevIt{values.begin ()}));\n\n\tCHECK ((duck::range (Container{}) | DRC::reversed ()).empty ());\n}\n\nTEST_CASE_TEMPLATE (\"counted\", Container, ForwardContainers) {\n\tfor (auto & iv : duck::range (Container{values}) | DRC::counted<int> ()) {\n\t\tCHECK (iv.index == iv.value ());\n\t}\n\tCHECK ((duck::range (Container{}) | DRC::counted<int> ()).empty ());\n}\n\nTEST_CASE_TEMPLATE (\"filter\", Container, ForwardContainers) {\n\tauto r = duck::range (Container{values});\n\n\tauto filtered_range = r | DRC::filter ([](int i) { return i % 2 == 0; });\n\tCHECK (filtered_range.size () == 3);\n\tCHECK (filtered_range == duck::range ({0, 2, 4}));\n\n\tauto chained_filtered_range =\n\t    r | DRC::filter ([](int i) { return i < 2; }) | DRC::filter ([](int i) { return i > 0; });\n\tCHECK (chained_filtered_range.size () == 1);\n\tCHECK (chained_filtered_range.front () == 1);\n\n\tCHECK ((duck::range (Container{}) | DRC::filter ([](int) { return true; })).empty ());\n}\n\nTEST_CASE_TEMPLATE (\"apply\", Container, ForwardContainers) {\n\tauto applied_range = duck::range (Container{values}) | DRC::apply ([](int i) { return i - 2; }) |\n\t                     DRC::filter ([](int i) { return i >= 0; });\n\tCHECK (applied_range.size () == 3);\n\tCHECK (applied_range == duck::range (0, 3));\n\n\tCHECK ((duck::range (Container{}) | DRC::apply ([](int i) { return i; })).empty ());\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <babylon\/sprites\/sprite_renderer.h>\n\n#include <babylon\/engines\/constants.h>\n#include <babylon\/engines\/engine.h>\n#include <babylon\/engines\/scene.h>\n#include <babylon\/engines\/thin_engine.h>\n#include <babylon\/materials\/effect.h>\n#include <babylon\/materials\/ieffect_creation_options.h>\n#include <babylon\/materials\/textures\/thin_texture.h>\n#include <babylon\/meshes\/buffer.h>\n#include <babylon\/meshes\/vertex_buffer.h>\n#include <babylon\/sprites\/thin_sprite.h>\n#include <babylon\/states\/depth_culling_state.h>\n\nnamespace BABYLON {\n\nSpriteRenderer::SpriteRenderer(ThinEngine* engine, size_t capacity, float epsilon, Scene* scene)\n    : texture{nullptr}\n    , cellWidth{0}\n    , cellHeight{0}\n    , blendMode{Constants::ALPHA_COMBINE}\n    , autoResetAlpha{true}\n    , disableDepthWrite{false}\n    , fogEnabled{true}\n    , capacity{this, &SpriteRenderer::get_capacity}\n    , _engine{nullptr}\n    , _useVAO{false}\n    , _useInstancing{false}\n    , _scene{nullptr}\n    , _buffer{nullptr}\n    , _spriteBuffer{nullptr}\n    , _indexBuffer{nullptr}\n    , _effectBase{nullptr}\n    , _effectFog{nullptr}\n    , _vertexArrayObject{nullptr}\n{\n  _capacity = capacity;\n  _epsilon  = epsilon;\n\n  _engine        = engine;\n  _useInstancing = engine->getCaps().instancedArrays;\n  _useVAO        = engine->getCaps().vertexArrayObject && !engine->disableVertexArrayObjects;\n  _scene         = scene;\n\n  if (!_useInstancing) {\n    IndicesArray indices;\n    auto index = 0;\n    for (unsigned int count = 0; count < capacity; ++count) {\n      indices.emplace_back(index + 0);\n      indices.emplace_back(index + 1);\n      indices.emplace_back(index + 2);\n      indices.emplace_back(index + 0);\n      indices.emplace_back(index + 2);\n      indices.emplace_back(index + 3);\n      index += 4;\n    }\n\n    _indexBuffer = engine->createIndexBuffer(indices);\n  }\n\n  \/\/ VBO\n  \/\/ 18 floats per sprite (x, y, z, angle, sizeX, sizeY, offsetX, offsetY, invertU, invertV,\n  \/\/ cellLeft, cellTop, cellWidth, cellHeight, color r, color g, color b, color a)\n  \/\/ 16 when using instances\n  _vertexBufferSize = _useInstancing ? 16 : 18;\n  _vertexData       = Float32Array(capacity * _vertexBufferSize * (_useInstancing ? 1 : 4), 0.f);\n  _buffer           = std::make_unique<Buffer>(engine, _vertexData, true, _vertexBufferSize);\n\n  auto positions = _buffer->createVertexBuffer(VertexBuffer::PositionKind, 0, 4, _vertexBufferSize,\n                                               _useInstancing);\n  auto options   = _buffer->createVertexBuffer(\"options\", 4, 2, _vertexBufferSize, _useInstancing);\n\n  auto offset                           = 6ull;\n  std::unique_ptr<VertexBuffer> offsets = nullptr;\n\n  if (_useInstancing) {\n    const Float32Array spriteData{0.f, 0.f, 1.f, 0.f, 1.f, 1.f, 0.f, 1.f};\n    _spriteBuffer = std::make_unique<Buffer>(engine, spriteData, false, 2);\n    offsets       = _spriteBuffer->createVertexBuffer(\"offsets\", 0, 2);\n  }\n  else {\n    offsets = _buffer->createVertexBuffer(\"offsets\", offset, 2, _vertexBufferSize, _useInstancing);\n    offset += 2;\n  }\n\n  auto inverts\n    = _buffer->createVertexBuffer(\"inverts\", offset, 2, _vertexBufferSize, _useInstancing);\n  auto cellInfo\n    = _buffer->createVertexBuffer(\"cellInfo\", offset + 2, 4, _vertexBufferSize, _useInstancing);\n  auto colors = _buffer->createVertexBuffer(VertexBuffer::ColorKind, offset + 6, 4,\n                                            _vertexBufferSize, _useInstancing);\n\n  _vertexBuffers[VertexBuffer::PositionKind] = std::move(positions);\n  _vertexBuffers[VertexBuffer::OptionsKind]  = std::move(options);\n  _vertexBuffers[VertexBuffer::OffsetsKind]  = std::move(offsets);\n  _vertexBuffers[VertexBuffer::InvertsKind]  = std::move(inverts);\n  _vertexBuffers[VertexBuffer::CellInfoKind] = std::move(cellInfo);\n  _vertexBuffers[VertexBuffer::ColorKind]    = std::move(colors);\n\n  \/\/ Effects\n\n  {\n    IEffectCreationOptions spriteOptions;\n    spriteOptions.attributes\n      = {VertexBuffer::PositionKind, \"options\", \"offsets\", \"inverts\", \"cellInfo\",\n         VertexBuffer::ColorKind};\n    spriteOptions.uniformsNames = {\"view\", \"projection\", \"textureInfos\", \"alphaTest\"};\n    spriteOptions.samplers      = {\"diffuseSampler\"};\n\n    _effectBase = _engine->createEffect(\"sprites\", spriteOptions, _scene->getEngine());\n  }\n\n  if (_scene) {\n    IEffectCreationOptions spriteOptions;\n    spriteOptions.attributes\n      = {VertexBuffer::PositionKind, \"options\", \"offsets\", \"inverts\", \"cellInfo\",\n         VertexBuffer::ColorKind};\n    spriteOptions.uniformsNames\n      = {\"view\", \"projection\", \"textureInfos\", \"alphaTest\", \"vFogInfos\", \"vFogColor\"};\n    spriteOptions.samplers = {\"diffuseSampler\"};\n    spriteOptions.defines  = \"#define FOG\";\n\n    _effectFog = _scene->getEngine()->createEffect(\"sprites\", spriteOptions, _scene->getEngine());\n  }\n}\n\nSpriteRenderer::~SpriteRenderer() = default;\n\nsize_t SpriteRenderer::get_capacity() const\n{\n  return _capacity;\n}\n\nvoid SpriteRenderer::render(\n  const std::vector<ThinSpritePtr>& sprites, float deltaTime, const Matrix& viewMatrix,\n  const Matrix& projectionMatrix,\n  const std::function<void(ThinSprite* sprite, const ISize& baseSize)>& customSpriteUpdate)\n{\n  if (!texture || !texture->isReady() || sprites.empty()) {\n    return;\n  }\n\n  auto effect          = _effectBase;\n  auto shouldRenderFog = false;\n  if (fogEnabled && _scene && _scene->fogEnabled() && _scene->fogMode() != 0) {\n    effect          = _effectFog;\n    shouldRenderFog = true;\n  }\n\n  \/\/ Check\n  if (!effect->isReady()) {\n    return;\n  }\n  auto engine                     = _scene->getEngine();\n  const auto useRightHandedSystem = !!(_scene && _scene->useRightHandedSystem());\n  const auto baseSize             = texture->getBaseSize();\n\n  \/\/ Sprites\n  auto max = std::min(_capacity, sprites.size());\n\n  auto offset   = 0u;\n  auto noSprite = true;\n  for (size_t index = 0; index < max; index++) {\n    const auto& sprite = sprites[index];\n    if (!sprite || !sprite->isVisible) {\n      continue;\n    }\n\n    noSprite = false;\n    sprite->_animate(deltaTime);\n\n    _appendSpriteVertex(offset++, sprite, 0, 0, baseSize, useRightHandedSystem, customSpriteUpdate);\n    if (!_useInstancing) {\n      _appendSpriteVertex(offset++, sprite, 1, 0, baseSize, useRightHandedSystem,\n                          customSpriteUpdate);\n      _appendSpriteVertex(offset++, sprite, 1, 1, baseSize, useRightHandedSystem,\n                          customSpriteUpdate);\n      _appendSpriteVertex(offset++, sprite, 0, 1, baseSize, useRightHandedSystem,\n                          customSpriteUpdate);\n    }\n  }\n\n  if (noSprite) {\n    return;\n  }\n\n  _buffer->update(_vertexData);\n\n  const auto culling = engine->depthCullingState()->cull().value_or(true);\n  const auto zOffset = engine->depthCullingState()->zOffset();\n\n  \/\/ Handle Right Handed\n  if (useRightHandedSystem && _scene) {\n    _scene->getEngine()->setState(culling, zOffset, false, false);\n  }\n\n  \/\/ Render\n  engine->enableEffect(effect);\n\n  effect->setTexture(\"diffuseSampler\", texture);\n  effect->setMatrix(\"view\", viewMatrix);\n  effect->setMatrix(\"projection\", projectionMatrix);\n\n  \/\/ Scene Info\n  if (shouldRenderFog && _scene) {\n    const auto scene = _scene;\n\n    \/\/ Fog\n    effect->setFloat4(\"vFogInfos\", static_cast<float>(scene->fogMode()), scene->fogStart,\n                      scene->fogEnd, scene->fogDensity);\n    effect->setColor3(\"vFogColor\", scene->fogColor);\n  }\n\n  if (_useVAO) {\n    if (!_vertexArrayObject) {\n      _vertexArrayObject = engine->recordVertexArrayObject(_vertexBuffers, _indexBuffer, effect);\n    }\n    engine->bindVertexArrayObject(_vertexArrayObject, _indexBuffer);\n  }\n  else {\n    \/\/ VBOs\n    engine->bindBuffers(_vertexBuffers, _indexBuffer, effect);\n  }\n\n  \/\/ Draw order\n  engine->depthCullingState()->depthFunc = Constants::LEQUAL;\n  if (!disableDepthWrite) {\n    effect->setBool(\"alphaTest\", true);\n    engine->setColorWrite(false);\n    if (_useInstancing) {\n      engine->drawArraysType(Constants::MATERIAL_TriangleFanDrawMode, 0, 4, offset);\n    }\n    else {\n      engine->drawElementsType(Constants::MATERIAL_TriangleFillMode, 0, (offset \/ 4) * 6);\n    }\n    engine->setColorWrite(true);\n    effect->setBool(\"alphaTest\", false);\n  }\n\n  engine->setAlphaMode(blendMode);\n  if (_useInstancing) {\n    engine->drawArraysType(Constants::MATERIAL_TriangleFanDrawMode, 0, 4, offset);\n  }\n  else {\n    engine->drawElementsType(Constants::MATERIAL_TriangleFillMode, 0, (offset \/ 4) * 6);\n  }\n\n  if (autoResetAlpha) {\n    engine->setAlphaMode(Constants::ALPHA_DISABLE);\n  }\n\n  \/\/ Restore Right Handed\n  if (useRightHandedSystem && _scene) {\n    _scene->getEngine()->setState(culling, zOffset, false, true);\n  }\n\n  engine->unbindInstanceAttributes();\n}\n\nvoid SpriteRenderer::_appendSpriteVertex(\n  size_t index, const ThinSpritePtr& sprite, int offsetX, int offsetY, const ISize& baseSize,\n  bool useRightHandedSystem,\n  const std::function<void(ThinSprite* sprite, const ISize& baseSize)>& customSpriteUpdate)\n{\n  size_t arrayOffset = index * _vertexBufferSize;\n\n  auto offsetXVal = static_cast<float>(offsetX);\n  auto offsetYVal = static_cast<float>(offsetY);\n\n  if (offsetX == 0) {\n    offsetXVal = _epsilon;\n  }\n  else if (offsetX == 1) {\n    offsetXVal = 1.f - _epsilon;\n  }\n\n  if (offsetY == 0) {\n    offsetYVal = _epsilon;\n  }\n  else if (offsetY == 1) {\n    offsetYVal = 1.f - _epsilon;\n  }\n\n  if (customSpriteUpdate) {\n    customSpriteUpdate(sprite.get(), baseSize);\n  }\n  else {\n    if (!sprite->cellIndex) {\n      sprite->cellIndex = 0;\n    }\n\n    const auto rowSize = baseSize.width \/ cellWidth;\n    const auto offset  = (sprite->cellIndex \/ rowSize) >> 0;\n    sprite->_xOffset   = (sprite->cellIndex - offset * rowSize) * cellWidth \/ baseSize.width;\n    sprite->_yOffset   = offset * cellHeight \/ baseSize.height;\n    sprite->_xSize     = cellWidth;\n    sprite->_ySize     = cellHeight;\n  }\n\n  \/\/ Positions\n  _vertexData[arrayOffset + 0] = sprite->position.x;\n  _vertexData[arrayOffset + 1] = sprite->position.y;\n  _vertexData[arrayOffset + 2] = sprite->position.z;\n  _vertexData[arrayOffset + 3] = sprite->angle;\n  \/\/ Options\n  _vertexData[arrayOffset + 4] = static_cast<float>(sprite->width);\n  _vertexData[arrayOffset + 5] = static_cast<float>(sprite->height);\n\n  if (!_useInstancing) {\n    _vertexData[arrayOffset + 6] = offsetXVal;\n    _vertexData[arrayOffset + 7] = offsetYVal;\n  }\n  else {\n    arrayOffset -= 2;\n  }\n\n  \/\/ Inverts according to Right Handed\n  if (useRightHandedSystem) {\n    _vertexData[arrayOffset + 8] = sprite->invertU ? 0.f : 1.f;\n  }\n  else {\n    _vertexData[arrayOffset + 8] = sprite->invertU ? 1.f : 0.f;\n  }\n\n  _vertexData[arrayOffset + 9] = sprite->invertV ? 1.f : 0.f;\n\n  _vertexData[arrayOffset + 10] = static_cast<float>(sprite->_xOffset);\n  _vertexData[arrayOffset + 11] = static_cast<float>(sprite->_yOffset);\n  _vertexData[arrayOffset + 12] = static_cast<float>(sprite->_xSize) \/ baseSize.width;\n  _vertexData[arrayOffset + 13] = static_cast<float>(sprite->_ySize) \/ baseSize.height;\n\n  \/\/ Color\n  _vertexData[arrayOffset + 14] = sprite->color.r;\n  _vertexData[arrayOffset + 15] = sprite->color.g;\n  _vertexData[arrayOffset + 16] = sprite->color.b;\n  _vertexData[arrayOffset + 17] = sprite->color.a;\n}\n\nvoid SpriteRenderer::dispose()\n{\n  if (_buffer) {\n    _buffer->dispose();\n    _buffer = nullptr;\n  }\n\n  if (_spriteBuffer) {\n    _spriteBuffer->dispose();\n    _spriteBuffer = nullptr;\n  }\n\n  if (_indexBuffer) {\n    _engine->_releaseBuffer(_indexBuffer);\n    _indexBuffer = nullptr;\n  }\n\n  if (_vertexArrayObject) {\n    _engine->releaseVertexArrayObject(_vertexArrayObject);\n    _vertexArrayObject = nullptr;\n  }\n\n  if (texture) {\n    texture->dispose();\n    texture = nullptr;\n  }\n}\n\n} \/\/ end of namespace BABYLON\n<commit_msg>Changed sprite data and draw mode when using instancing<commit_after>#include <babylon\/sprites\/sprite_renderer.h>\n\n#include <babylon\/engines\/constants.h>\n#include <babylon\/engines\/engine.h>\n#include <babylon\/engines\/scene.h>\n#include <babylon\/engines\/thin_engine.h>\n#include <babylon\/materials\/effect.h>\n#include <babylon\/materials\/ieffect_creation_options.h>\n#include <babylon\/materials\/textures\/thin_texture.h>\n#include <babylon\/meshes\/buffer.h>\n#include <babylon\/meshes\/vertex_buffer.h>\n#include <babylon\/sprites\/thin_sprite.h>\n#include <babylon\/states\/depth_culling_state.h>\n\nnamespace BABYLON {\n\nSpriteRenderer::SpriteRenderer(ThinEngine* engine, size_t capacity, float epsilon, Scene* scene)\n    : texture{nullptr}\n    , cellWidth{0}\n    , cellHeight{0}\n    , blendMode{Constants::ALPHA_COMBINE}\n    , autoResetAlpha{true}\n    , disableDepthWrite{false}\n    , fogEnabled{true}\n    , capacity{this, &SpriteRenderer::get_capacity}\n    , _engine{nullptr}\n    , _useVAO{false}\n    , _useInstancing{false}\n    , _scene{nullptr}\n    , _buffer{nullptr}\n    , _spriteBuffer{nullptr}\n    , _indexBuffer{nullptr}\n    , _effectBase{nullptr}\n    , _effectFog{nullptr}\n    , _vertexArrayObject{nullptr}\n{\n  _capacity = capacity;\n  _epsilon  = epsilon;\n\n  _engine        = engine;\n  _useInstancing = engine->getCaps().instancedArrays;\n  _useVAO        = engine->getCaps().vertexArrayObject && !engine->disableVertexArrayObjects;\n  _scene         = scene;\n\n  if (!_useInstancing) {\n    IndicesArray indices;\n    auto index = 0;\n    for (unsigned int count = 0; count < capacity; ++count) {\n      indices.emplace_back(index + 0);\n      indices.emplace_back(index + 1);\n      indices.emplace_back(index + 2);\n      indices.emplace_back(index + 0);\n      indices.emplace_back(index + 2);\n      indices.emplace_back(index + 3);\n      index += 4;\n    }\n\n    _indexBuffer = engine->createIndexBuffer(indices);\n  }\n\n  \/\/ VBO\n  \/\/ 18 floats per sprite (x, y, z, angle, sizeX, sizeY, offsetX, offsetY, invertU, invertV,\n  \/\/ cellLeft, cellTop, cellWidth, cellHeight, color r, color g, color b, color a)\n  \/\/ 16 when using instances\n  _vertexBufferSize = _useInstancing ? 16 : 18;\n  _vertexData       = Float32Array(capacity * _vertexBufferSize * (_useInstancing ? 1 : 4), 0.f);\n  _buffer           = std::make_unique<Buffer>(engine, _vertexData, true, _vertexBufferSize);\n\n  auto positions = _buffer->createVertexBuffer(VertexBuffer::PositionKind, 0, 4, _vertexBufferSize,\n                                               _useInstancing);\n  auto options   = _buffer->createVertexBuffer(\"options\", 4, 2, _vertexBufferSize, _useInstancing);\n\n  auto offset                           = 6ull;\n  std::unique_ptr<VertexBuffer> offsets = nullptr;\n\n  if (_useInstancing) {\n    const Float32Array spriteData{0.f, 0.f, 1.f, 0.f, 0.f, 1.f, 1.f, 1.f};\n    _spriteBuffer = std::make_unique<Buffer>(engine, spriteData, false, 2);\n    offsets       = _spriteBuffer->createVertexBuffer(\"offsets\", 0, 2);\n  }\n  else {\n    offsets = _buffer->createVertexBuffer(\"offsets\", offset, 2, _vertexBufferSize, _useInstancing);\n    offset += 2;\n  }\n\n  auto inverts\n    = _buffer->createVertexBuffer(\"inverts\", offset, 2, _vertexBufferSize, _useInstancing);\n  auto cellInfo\n    = _buffer->createVertexBuffer(\"cellInfo\", offset + 2, 4, _vertexBufferSize, _useInstancing);\n  auto colors = _buffer->createVertexBuffer(VertexBuffer::ColorKind, offset + 6, 4,\n                                            _vertexBufferSize, _useInstancing);\n\n  _vertexBuffers[VertexBuffer::PositionKind] = std::move(positions);\n  _vertexBuffers[VertexBuffer::OptionsKind]  = std::move(options);\n  _vertexBuffers[VertexBuffer::OffsetsKind]  = std::move(offsets);\n  _vertexBuffers[VertexBuffer::InvertsKind]  = std::move(inverts);\n  _vertexBuffers[VertexBuffer::CellInfoKind] = std::move(cellInfo);\n  _vertexBuffers[VertexBuffer::ColorKind]    = std::move(colors);\n\n  \/\/ Effects\n\n  {\n    IEffectCreationOptions spriteOptions;\n    spriteOptions.attributes\n      = {VertexBuffer::PositionKind, \"options\", \"offsets\", \"inverts\", \"cellInfo\",\n         VertexBuffer::ColorKind};\n    spriteOptions.uniformsNames = {\"view\", \"projection\", \"textureInfos\", \"alphaTest\"};\n    spriteOptions.samplers      = {\"diffuseSampler\"};\n\n    _effectBase = _engine->createEffect(\"sprites\", spriteOptions, _scene->getEngine());\n  }\n\n  if (_scene) {\n    IEffectCreationOptions spriteOptions;\n    spriteOptions.attributes\n      = {VertexBuffer::PositionKind, \"options\", \"offsets\", \"inverts\", \"cellInfo\",\n         VertexBuffer::ColorKind};\n    spriteOptions.uniformsNames\n      = {\"view\", \"projection\", \"textureInfos\", \"alphaTest\", \"vFogInfos\", \"vFogColor\"};\n    spriteOptions.samplers = {\"diffuseSampler\"};\n    spriteOptions.defines  = \"#define FOG\";\n\n    _effectFog = _scene->getEngine()->createEffect(\"sprites\", spriteOptions, _scene->getEngine());\n  }\n}\n\nSpriteRenderer::~SpriteRenderer() = default;\n\nsize_t SpriteRenderer::get_capacity() const\n{\n  return _capacity;\n}\n\nvoid SpriteRenderer::render(\n  const std::vector<ThinSpritePtr>& sprites, float deltaTime, const Matrix& viewMatrix,\n  const Matrix& projectionMatrix,\n  const std::function<void(ThinSprite* sprite, const ISize& baseSize)>& customSpriteUpdate)\n{\n  if (!texture || !texture->isReady() || sprites.empty()) {\n    return;\n  }\n\n  auto effect          = _effectBase;\n  auto shouldRenderFog = false;\n  if (fogEnabled && _scene && _scene->fogEnabled() && _scene->fogMode() != 0) {\n    effect          = _effectFog;\n    shouldRenderFog = true;\n  }\n\n  \/\/ Check\n  if (!effect->isReady()) {\n    return;\n  }\n  auto engine                     = _scene->getEngine();\n  const auto useRightHandedSystem = !!(_scene && _scene->useRightHandedSystem());\n  const auto baseSize             = texture->getBaseSize();\n\n  \/\/ Sprites\n  auto max = std::min(_capacity, sprites.size());\n\n  auto offset   = 0u;\n  auto noSprite = true;\n  for (size_t index = 0; index < max; index++) {\n    const auto& sprite = sprites[index];\n    if (!sprite || !sprite->isVisible) {\n      continue;\n    }\n\n    noSprite = false;\n    sprite->_animate(deltaTime);\n\n    _appendSpriteVertex(offset++, sprite, 0, 0, baseSize, useRightHandedSystem, customSpriteUpdate);\n    if (!_useInstancing) {\n      _appendSpriteVertex(offset++, sprite, 1, 0, baseSize, useRightHandedSystem,\n                          customSpriteUpdate);\n      _appendSpriteVertex(offset++, sprite, 1, 1, baseSize, useRightHandedSystem,\n                          customSpriteUpdate);\n      _appendSpriteVertex(offset++, sprite, 0, 1, baseSize, useRightHandedSystem,\n                          customSpriteUpdate);\n    }\n  }\n\n  if (noSprite) {\n    return;\n  }\n\n  _buffer->update(_vertexData);\n\n  const auto culling = engine->depthCullingState()->cull().value_or(true);\n  const auto zOffset = engine->depthCullingState()->zOffset();\n\n  \/\/ Handle Right Handed\n  if (useRightHandedSystem && _scene) {\n    _scene->getEngine()->setState(culling, zOffset, false, false);\n  }\n\n  \/\/ Render\n  engine->enableEffect(effect);\n\n  effect->setTexture(\"diffuseSampler\", texture);\n  effect->setMatrix(\"view\", viewMatrix);\n  effect->setMatrix(\"projection\", projectionMatrix);\n\n  \/\/ Scene Info\n  if (shouldRenderFog && _scene) {\n    const auto scene = _scene;\n\n    \/\/ Fog\n    effect->setFloat4(\"vFogInfos\", static_cast<float>(scene->fogMode()), scene->fogStart,\n                      scene->fogEnd, scene->fogDensity);\n    effect->setColor3(\"vFogColor\", scene->fogColor);\n  }\n\n  if (_useVAO) {\n    if (!_vertexArrayObject) {\n      _vertexArrayObject = engine->recordVertexArrayObject(_vertexBuffers, _indexBuffer, effect);\n    }\n    engine->bindVertexArrayObject(_vertexArrayObject, _indexBuffer);\n  }\n  else {\n    \/\/ VBOs\n    engine->bindBuffers(_vertexBuffers, _indexBuffer, effect);\n  }\n\n  \/\/ Draw order\n  engine->depthCullingState()->depthFunc = Constants::LEQUAL;\n  if (!disableDepthWrite) {\n    effect->setBool(\"alphaTest\", true);\n    engine->setColorWrite(false);\n    if (_useInstancing) {\n      engine->drawArraysType(Constants::MATERIAL_TriangleStripDrawMode, 0, 4, offset);\n    }\n    else {\n      engine->drawElementsType(Constants::MATERIAL_TriangleFillMode, 0, (offset \/ 4) * 6);\n    }\n    engine->setColorWrite(true);\n    effect->setBool(\"alphaTest\", false);\n  }\n\n  engine->setAlphaMode(blendMode);\n  if (_useInstancing) {\n    engine->drawArraysType(Constants::MATERIAL_TriangleStripDrawMode, 0, 4, offset);\n  }\n  else {\n    engine->drawElementsType(Constants::MATERIAL_TriangleFillMode, 0, (offset \/ 4) * 6);\n  }\n\n  if (autoResetAlpha) {\n    engine->setAlphaMode(Constants::ALPHA_DISABLE);\n  }\n\n  \/\/ Restore Right Handed\n  if (useRightHandedSystem && _scene) {\n    _scene->getEngine()->setState(culling, zOffset, false, true);\n  }\n\n  engine->unbindInstanceAttributes();\n}\n\nvoid SpriteRenderer::_appendSpriteVertex(\n  size_t index, const ThinSpritePtr& sprite, int offsetX, int offsetY, const ISize& baseSize,\n  bool useRightHandedSystem,\n  const std::function<void(ThinSprite* sprite, const ISize& baseSize)>& customSpriteUpdate)\n{\n  size_t arrayOffset = index * _vertexBufferSize;\n\n  auto offsetXVal = static_cast<float>(offsetX);\n  auto offsetYVal = static_cast<float>(offsetY);\n\n  if (offsetX == 0) {\n    offsetXVal = _epsilon;\n  }\n  else if (offsetX == 1) {\n    offsetXVal = 1.f - _epsilon;\n  }\n\n  if (offsetY == 0) {\n    offsetYVal = _epsilon;\n  }\n  else if (offsetY == 1) {\n    offsetYVal = 1.f - _epsilon;\n  }\n\n  if (customSpriteUpdate) {\n    customSpriteUpdate(sprite.get(), baseSize);\n  }\n  else {\n    if (!sprite->cellIndex) {\n      sprite->cellIndex = 0;\n    }\n\n    const auto rowSize = baseSize.width \/ cellWidth;\n    const auto offset  = (sprite->cellIndex \/ rowSize) >> 0;\n    sprite->_xOffset   = (sprite->cellIndex - offset * rowSize) * cellWidth \/ baseSize.width;\n    sprite->_yOffset   = offset * cellHeight \/ baseSize.height;\n    sprite->_xSize     = cellWidth;\n    sprite->_ySize     = cellHeight;\n  }\n\n  \/\/ Positions\n  _vertexData[arrayOffset + 0] = sprite->position.x;\n  _vertexData[arrayOffset + 1] = sprite->position.y;\n  _vertexData[arrayOffset + 2] = sprite->position.z;\n  _vertexData[arrayOffset + 3] = sprite->angle;\n  \/\/ Options\n  _vertexData[arrayOffset + 4] = static_cast<float>(sprite->width);\n  _vertexData[arrayOffset + 5] = static_cast<float>(sprite->height);\n\n  if (!_useInstancing) {\n    _vertexData[arrayOffset + 6] = offsetXVal;\n    _vertexData[arrayOffset + 7] = offsetYVal;\n  }\n  else {\n    arrayOffset -= 2;\n  }\n\n  \/\/ Inverts according to Right Handed\n  if (useRightHandedSystem) {\n    _vertexData[arrayOffset + 8] = sprite->invertU ? 0.f : 1.f;\n  }\n  else {\n    _vertexData[arrayOffset + 8] = sprite->invertU ? 1.f : 0.f;\n  }\n\n  _vertexData[arrayOffset + 9] = sprite->invertV ? 1.f : 0.f;\n\n  _vertexData[arrayOffset + 10] = static_cast<float>(sprite->_xOffset);\n  _vertexData[arrayOffset + 11] = static_cast<float>(sprite->_yOffset);\n  _vertexData[arrayOffset + 12] = static_cast<float>(sprite->_xSize) \/ baseSize.width;\n  _vertexData[arrayOffset + 13] = static_cast<float>(sprite->_ySize) \/ baseSize.height;\n\n  \/\/ Color\n  _vertexData[arrayOffset + 14] = sprite->color.r;\n  _vertexData[arrayOffset + 15] = sprite->color.g;\n  _vertexData[arrayOffset + 16] = sprite->color.b;\n  _vertexData[arrayOffset + 17] = sprite->color.a;\n}\n\nvoid SpriteRenderer::dispose()\n{\n  if (_buffer) {\n    _buffer->dispose();\n    _buffer = nullptr;\n  }\n\n  if (_spriteBuffer) {\n    _spriteBuffer->dispose();\n    _spriteBuffer = nullptr;\n  }\n\n  if (_indexBuffer) {\n    _engine->_releaseBuffer(_indexBuffer);\n    _indexBuffer = nullptr;\n  }\n\n  if (_vertexArrayObject) {\n    _engine->releaseVertexArrayObject(_vertexArrayObject);\n    _vertexArrayObject = nullptr;\n  }\n\n  if (texture) {\n    texture->dispose();\n    texture = nullptr;\n  }\n}\n\n} \/\/ end of namespace BABYLON\n<|endoftext|>"}
{"text":"<commit_before>#include <babylon\/GL\/framebuffer_canvas.h>\n#include <babylon\/GL\/gl_rendering_context.h>\n#include <glad\/glad.h>\n\n#define STB_IMAGE_WRITE_IMPLEMENTATION\n#include <stb_image\/stb_image_write.h>\n#define STB_IMAGE_RESIZE_IMPLEMENTATION\n#include <stb_image\/\/stb_image_resize.h>\n\nnamespace BABYLON {\nnamespace GL {\n\nFramebufferCanvas::FramebufferCanvas()\n  : mFrameBuffer{nullptr}\n  , mTextureColorBuffer{nullptr}\n  , mRenderbuffer{nullptr}\n{\n  _renderingContext = std::make_unique<GL::GLRenderingContext>();\n  _renderingContext->initialize();\n  _boundingClientRect.bottom = clientHeight;\n  _boundingClientRect.height = clientHeight;\n  _boundingClientRect.left   = 0;\n  _boundingClientRect.right  = clientWidth;\n  _boundingClientRect.top    = 0;\n  _boundingClientRect.width  = clientWidth;\n}\n\nFramebufferCanvas::~FramebufferCanvas()\n{\n  _renderingContext->deleteFramebuffer(mFrameBuffer.get());\n  _renderingContext->deleteTexture(mTextureColorBuffer.get());\n  _renderingContext->deleteRenderbuffer(mRenderbuffer.get());\n}\n\nvoid FramebufferCanvas::initializeFrameBuffer()\n{\n  _renderingContext->drawingBufferWidth  = clientWidth;\n  _renderingContext->drawingBufferHeight = clientHeight;\n\n  \/\/ Create a frame buffer\n  mFrameBuffer = _renderingContext->createFramebuffer();\n  _renderingContext->bindFramebuffer(GL_FRAMEBUFFER, mFrameBuffer.get());\n\n  \/\/ Create a color attachment texture\n  mTextureColorBuffer = _renderingContext->createTexture();\n  _renderingContext->bindTexture(GL_TEXTURE_2D, mTextureColorBuffer.get());\n  _renderingContext->texImage2D(GL_TEXTURE_2D, 0, GL_RGB, clientWidth, clientHeight, 0, GL_RGB,\n                                GL_UNSIGNED_BYTE, nullptr);\n  _renderingContext->texParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\n  _renderingContext->texParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n\n  \/\/ Create a renderbuffer object for depth and stencil attachment\n  mRenderbuffer = _renderingContext->createRenderbuffer();\n  _renderingContext->bindRenderbuffer(GL_RENDERBUFFER, mRenderbuffer);\n  _renderingContext->renderbufferStorage(GL_RENDERBUFFER, DEPTH24_STENCIL8, clientWidth,\n                                         clientHeight);\n  _renderingContext->framebufferRenderbuffer(GL_FRAMEBUFFER, DEPTH_STENCIL_ATTACHMENT,\n                                             GL_RENDERBUFFER, mRenderbuffer.get());\n\n  \/\/ Set \"renderedTexture\" as our colour attachement #0\n  _renderingContext->framebufferTexture2D(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0, GL_TEXTURE_2D,\n                                          mTextureColorBuffer.get(), 0);\n\n  \/\/ Set the list of draw buffers.\n  std::vector<GLenum> drawBuffers{GL_COLOR_ATTACHMENT0};\n  _renderingContext->drawBuffers(drawBuffers); \/\/ \"1\" is the size of DrawBuffers\n\n  if (_renderingContext->checkFramebufferStatus(GL_FRAMEBUFFER) != GL_FRAMEBUFFER_COMPLETE) {\n    throw std::runtime_error(\"ERROR::FRAMEBUFFER:: Framebuffer is not complete!\");\n  }\n\n  _renderingContext->bindTexture(GL_TEXTURE_2D, nullptr);\n  _renderingContext->bindFramebuffer(GL_FRAMEBUFFER, nullptr);\n}\n\nvoid FramebufferCanvas::resize(int iWidth, int iHeight)\n{\n  if (clientWidth != iWidth || clientHeight != iHeight) {\n    clientWidth = iWidth;\n    clientHeight = iHeight;\n    _renderingContext->drawingBufferWidth  = iWidth;\n    _renderingContext->drawingBufferHeight = iHeight;\n\n    \/\/ Resize texture\n    _renderingContext->activeTexture(GL_TEXTURE0);\n    _renderingContext->bindTexture(GL_TEXTURE_2D, mTextureColorBuffer.get());\n    _renderingContext->texImage2D(GL_TEXTURE_2D, 0, GL_RGB, clientWidth, clientHeight, 0, GL_RGB,\n                                  GL_UNSIGNED_BYTE, nullptr);\n\n    \/\/ Bind the frame buffer\n    _renderingContext->bindFramebuffer(GL_FRAMEBUFFER, mFrameBuffer.get());\n\n    \/\/ Resize renderbuffer\n    _renderingContext->bindRenderbuffer(GL_RENDERBUFFER, mRenderbuffer);\n    _renderingContext->renderbufferStorage(GL_RENDERBUFFER, GL_DEPTH24_STENCIL8, clientWidth,\n                                           clientHeight);\n\n    \/\/ Set \"renderedTexture\" as our colour attachement #0\n    _renderingContext->framebufferTexture2D(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0, GL_TEXTURE_2D,\n                                            mTextureColorBuffer.get(), 0);\n\n    \/\/ Unbind the buffers and texture\n    _renderingContext->bindFramebuffer(GL_FRAMEBUFFER, nullptr);\n    _renderingContext->bindRenderbuffer(GL_RENDERBUFFER, nullptr);\n    _renderingContext->bindTexture(GL_TEXTURE_2D, nullptr);\n  }\n}\n\nbool FramebufferCanvas::initializeContext3d()\n{\n  if (!_initialized) {\n    _initialized = _renderingContext->initialize();\n  }\n\n  return _initialized;\n}\n\nClientRect& FramebufferCanvas::getBoundingClientRect()\n{\n  return _boundingClientRect;\n}\n\nICanvasRenderingContext2D* FramebufferCanvas::getContext2d()\n{\n  return nullptr;\n}\n\nGL::IGLRenderingContext*\nFramebufferCanvas::getContext3d(const EngineOptions& \/*options*\/)\n{\n  return _renderingContext.get();\n}\n\nvoid FramebufferCanvas::bind()\n{\n  _renderingContext->bindFramebuffer(GL_FRAMEBUFFER, mFrameBuffer.get());\n}\n\nvoid FramebufferCanvas::unbind()\n{\n  _renderingContext->bindFramebuffer(GL_FRAMEBUFFER, nullptr);\n}\n\nunsigned int FramebufferCanvas::textureId()\n{\n  return mTextureColorBuffer->value;\n  \/\/ return mFrameBuffer->value;\n}\n\nUint8Array reverse_pixels_rows(const Uint8Array& pixels, int width, int height,\n                               int nbChannels)\n{\n  Uint8Array pixels_reverse_rows;\n  pixels_reverse_rows.resize(width * height * 3, 0);\n  for (int row = 0; row < height; row++) {\n    const uint8_t* src = &(pixels[(height - 1 - row) * nbChannels * width]);\n    uint8_t* dst       = &(pixels_reverse_rows[row * nbChannels * width]);\n    for (int col = 0; col < width; col++) {\n      for (int channel = 0; channel < nbChannels; channel++) {\n        *dst++ = *src++;\n      }\n    }\n  }\n  return pixels_reverse_rows;\n}\n\nUint8Array FramebufferCanvas::readPixelsRgb()\n{\n  Uint8Array pixels;\n  pixels.resize(clientWidth * clientHeight * 3, 0);\n  _renderingContext->readPixels(0, 0, clientWidth, clientHeight, GL_RGB,\n                                GL_UNSIGNED_BYTE, pixels);\n  \/\/ rows are inversed in the framebuffer: invert them now\n  auto pixels_reverse_rows\n    = reverse_pixels_rows(pixels, clientWidth, clientHeight, 3);\n  return pixels_reverse_rows;\n}\n\nvoid FramebufferCanvas::saveScreenshotJpg(const char* filename, int quality,\n                                          int imageWidth)\n{\n  bind();\n  auto pixels = readPixelsRgb();\n  unbind();\n  int nbChannels = 3;\n\n  if (imageWidth == -1)\n    stbi_write_jpg(filename, clientWidth, clientHeight, nbChannels,\n                   pixels.data(), quality);\n  else {\n    Uint8Array pixels_resized;\n    int imageHeight\n      = (int)((double)clientHeight * (double)imageWidth \/ (double)clientWidth\n              + 0.5);\n    pixels_resized.resize(imageWidth * imageHeight * 3);\n    stbir_resize_uint8(pixels.data(), clientWidth, clientHeight, 0,\n                       pixels_resized.data(), imageWidth, imageHeight, 0, 3);\n    stbi_write_jpg(filename, imageWidth, imageHeight, nbChannels,\n                   pixels_resized.data(), quality);\n  }\n}\n\nvoid FramebufferCanvas::saveScreenshotPng(const char* filename)\n{\n  bind();\n  auto pixels = readPixelsRgb();\n  unbind();\n  int nbChannels      = 3;\n  int stride_in_bytes = clientWidth * nbChannels;\n  stbi_write_png(filename, clientWidth, clientHeight, nbChannels, pixels.data(),\n                 stride_in_bytes);\n}\n\n} \/\/ end of namespace GL\n} \/\/ end of namespace BABYLON\n<commit_msg>Correct gl calls<commit_after>#include <babylon\/GL\/framebuffer_canvas.h>\n#include <babylon\/GL\/gl_rendering_context.h>\n#include <glad\/glad.h>\n\n#define STB_IMAGE_WRITE_IMPLEMENTATION\n#include <stb_image\/stb_image_write.h>\n#define STB_IMAGE_RESIZE_IMPLEMENTATION\n#include <stb_image\/\/stb_image_resize.h>\n\nnamespace BABYLON {\nnamespace GL {\n\nFramebufferCanvas::FramebufferCanvas()\n  : mFrameBuffer{nullptr}\n  , mTextureColorBuffer{nullptr}\n  , mRenderbuffer{nullptr}\n{\n  _renderingContext = std::make_unique<GL::GLRenderingContext>();\n  _renderingContext->initialize();\n  _boundingClientRect.bottom = clientHeight;\n  _boundingClientRect.height = clientHeight;\n  _boundingClientRect.left   = 0;\n  _boundingClientRect.right  = clientWidth;\n  _boundingClientRect.top    = 0;\n  _boundingClientRect.width  = clientWidth;\n}\n\nFramebufferCanvas::~FramebufferCanvas()\n{\n  _renderingContext->deleteFramebuffer(mFrameBuffer.get());\n  _renderingContext->deleteTexture(mTextureColorBuffer.get());\n  _renderingContext->deleteRenderbuffer(mRenderbuffer.get());\n}\n\nvoid FramebufferCanvas::initializeFrameBuffer()\n{\n  _renderingContext->drawingBufferWidth  = clientWidth;\n  _renderingContext->drawingBufferHeight = clientHeight;\n\n  \/\/ Create a frame buffer\n  mFrameBuffer = _renderingContext->createFramebuffer();\n  _renderingContext->bindFramebuffer(GL_FRAMEBUFFER, mFrameBuffer.get());\n\n  \/\/ Create a color attachment texture\n  mTextureColorBuffer = _renderingContext->createTexture();\n  _renderingContext->bindTexture(GL_TEXTURE_2D, mTextureColorBuffer.get());\n  _renderingContext->texImage2D(GL_TEXTURE_2D, 0, GL_RGB, clientWidth, clientHeight, 0, GL_RGB,\n                                GL_UNSIGNED_BYTE, nullptr);\n  _renderingContext->texParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\n  _renderingContext->texParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n\n  \/\/ Create a renderbuffer object for depth and stencil attachment\n  mRenderbuffer = _renderingContext->createRenderbuffer();\n  _renderingContext->bindRenderbuffer(GL_RENDERBUFFER, mRenderbuffer);\n  _renderingContext->renderbufferStorage(GL_RENDERBUFFER, DEPTH24_STENCIL8, clientWidth,\n                                         clientHeight);\n  _renderingContext->framebufferRenderbuffer(GL_FRAMEBUFFER, DEPTH_STENCIL_ATTACHMENT,\n                                             GL_RENDERBUFFER, mRenderbuffer.get());\n\n  \/\/ Set \"renderedTexture\" as our colour attachement #0\n  _renderingContext->framebufferTexture2D(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0, GL_TEXTURE_2D,\n                                          mTextureColorBuffer.get(), 0);\n\n  \/\/ Set the list of draw buffers.\n  std::vector<GLenum> drawBuffers{GL_COLOR_ATTACHMENT0};\n  _renderingContext->drawBuffers(drawBuffers); \/\/ \"1\" is the size of DrawBuffers\n\n  if (_renderingContext->checkFramebufferStatus(GL_FRAMEBUFFER) != GL_FRAMEBUFFER_COMPLETE) {\n    throw std::runtime_error(\"ERROR::FRAMEBUFFER:: Framebuffer is not complete!\");\n  }\n\n  _renderingContext->bindTexture(GL_TEXTURE_2D, nullptr);\n  _renderingContext->bindFramebuffer(GL_FRAMEBUFFER, nullptr);\n}\n\nvoid FramebufferCanvas::resize(int iWidth, int iHeight)\n{\n  if (clientWidth != iWidth || clientHeight != iHeight) {\n    clientWidth = iWidth;\n    clientHeight = iHeight;\n    _renderingContext->drawingBufferWidth  = iWidth;\n    _renderingContext->drawingBufferHeight = iHeight;\n\n    \/\/ Resize texture\n    _renderingContext->activeTexture(GL_TEXTURE0);\n    _renderingContext->bindTexture(GL_TEXTURE_2D, mTextureColorBuffer.get());\n    _renderingContext->texImage2D(GL_TEXTURE_2D, 0, GL_RGB, clientWidth, clientHeight, 0, GL_RGB,\n                                  GL_UNSIGNED_BYTE, nullptr);\n\n    \/\/ Bind the frame buffer\n    _renderingContext->bindFramebuffer(GL_FRAMEBUFFER, mFrameBuffer.get());\n\n    \/\/ Resize renderbuffer\n    _renderingContext->bindRenderbuffer(GL_RENDERBUFFER, mRenderbuffer);\n    _renderingContext->renderbufferStorage(GL_RENDERBUFFER, DEPTH24_STENCIL8, clientWidth,\n                                           clientHeight);\n\n    \/\/ Set \"renderedTexture\" as our colour attachement #0\n    _renderingContext->framebufferTexture2D(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0, GL_TEXTURE_2D,\n                                            mTextureColorBuffer.get(), 0);\n\n    \/\/ Unbind the buffers and texture\n    _renderingContext->bindFramebuffer(GL_FRAMEBUFFER, nullptr);\n    _renderingContext->bindRenderbuffer(GL_RENDERBUFFER, nullptr);\n    _renderingContext->bindTexture(GL_TEXTURE_2D, nullptr);\n  }\n}\n\nbool FramebufferCanvas::initializeContext3d()\n{\n  if (!_initialized) {\n    _initialized = _renderingContext->initialize();\n  }\n\n  return _initialized;\n}\n\nClientRect& FramebufferCanvas::getBoundingClientRect()\n{\n  return _boundingClientRect;\n}\n\nICanvasRenderingContext2D* FramebufferCanvas::getContext2d()\n{\n  return nullptr;\n}\n\nGL::IGLRenderingContext*\nFramebufferCanvas::getContext3d(const EngineOptions& \/*options*\/)\n{\n  return _renderingContext.get();\n}\n\nvoid FramebufferCanvas::bind()\n{\n  _renderingContext->bindFramebuffer(GL_FRAMEBUFFER, mFrameBuffer.get());\n}\n\nvoid FramebufferCanvas::unbind()\n{\n  _renderingContext->bindFramebuffer(GL_FRAMEBUFFER, nullptr);\n}\n\nunsigned int FramebufferCanvas::textureId()\n{\n  return mTextureColorBuffer->value;\n  \/\/ return mFrameBuffer->value;\n}\n\nUint8Array reverse_pixels_rows(const Uint8Array& pixels, int width, int height,\n                               int nbChannels)\n{\n  Uint8Array pixels_reverse_rows;\n  pixels_reverse_rows.resize(width * height * 3, 0);\n  for (int row = 0; row < height; row++) {\n    const uint8_t* src = &(pixels[(height - 1 - row) * nbChannels * width]);\n    uint8_t* dst       = &(pixels_reverse_rows[row * nbChannels * width]);\n    for (int col = 0; col < width; col++) {\n      for (int channel = 0; channel < nbChannels; channel++) {\n        *dst++ = *src++;\n      }\n    }\n  }\n  return pixels_reverse_rows;\n}\n\nUint8Array FramebufferCanvas::readPixelsRgb()\n{\n  Uint8Array pixels;\n  pixels.resize(clientWidth * clientHeight * 3, 0);\n  _renderingContext->readPixels(0, 0, clientWidth, clientHeight, GL_RGB,\n                                GL_UNSIGNED_BYTE, pixels);\n  \/\/ rows are inversed in the framebuffer: invert them now\n  auto pixels_reverse_rows\n    = reverse_pixels_rows(pixels, clientWidth, clientHeight, 3);\n  return pixels_reverse_rows;\n}\n\nvoid FramebufferCanvas::saveScreenshotJpg(const char* filename, int quality,\n                                          int imageWidth)\n{\n  bind();\n  auto pixels = readPixelsRgb();\n  unbind();\n  int nbChannels = 3;\n\n  if (imageWidth == -1)\n    stbi_write_jpg(filename, clientWidth, clientHeight, nbChannels,\n                   pixels.data(), quality);\n  else {\n    Uint8Array pixels_resized;\n    int imageHeight\n      = (int)((double)clientHeight * (double)imageWidth \/ (double)clientWidth\n              + 0.5);\n    pixels_resized.resize(imageWidth * imageHeight * 3);\n    stbir_resize_uint8(pixels.data(), clientWidth, clientHeight, 0,\n                       pixels_resized.data(), imageWidth, imageHeight, 0, 3);\n    stbi_write_jpg(filename, imageWidth, imageHeight, nbChannels,\n                   pixels_resized.data(), quality);\n  }\n}\n\nvoid FramebufferCanvas::saveScreenshotPng(const char* filename)\n{\n  bind();\n  auto pixels = readPixelsRgb();\n  unbind();\n  int nbChannels      = 3;\n  int stride_in_bytes = clientWidth * nbChannels;\n  stbi_write_png(filename, clientWidth, clientHeight, nbChannels, pixels.data(),\n                 stride_in_bytes);\n}\n\n} \/\/ end of namespace GL\n} \/\/ end of namespace BABYLON\n<|endoftext|>"}
{"text":"<commit_before>#include <cmath>\n\n#include <glm\/gtc\/matrix_transform.hpp>\n#include <SDL2\/SDL.h>\n\n#include <zombye\/core\/game.hpp>\n#include <zombye\/ecs\/entity_manager.hpp>\n#include <zombye\/gameplay\/states\/play_state.hpp>\n#include <zombye\/input\/input_manager.hpp>\n#include <zombye\/input\/input_system.hpp>\n#include <zombye\/input\/joystick.hpp>\n#include <zombye\/input\/mouse.hpp>\n#include <zombye\/physics\/shapes\/box_shape.hpp>\n#include <zombye\/physics\/physics_component.hpp>\n#include <zombye\/rendering\/animation_component.hpp>\n#include <zombye\/rendering\/camera_component.hpp>\n#include <zombye\/rendering\/rendering_system.hpp>\n#include <zombye\/scripting\/scripting_system.hpp>\n#include <zombye\/utils\/logger.hpp>\n#include <zombye\/utils\/state_machine.hpp>\n\nzombye::play_state::play_state(zombye::state_machine *sm) : sm_(sm) {\n    auto input = sm->get_game()->input();\n    input_ = input->create_manager();\n\n    input_->register_action(\"FIRE\", []() {\n        zombye::log(\"Peng Peng!\");\n    });\n\n    input_->register_action(\"FIRE_END\", []() {\n        zombye::log(\"No more peng :(\");\n    });\n\n    auto first_joystick = input->first_joystick();\n\n    if(first_joystick) {\n        input_->register_event(\"FIRE\", first_joystick->button_A());\n        input_->register_event(\"FIRE\", first_joystick->button_B());\n\n        input_->register_up_event(\"FIRE_END\", first_joystick->button_A());\n        input_->register_up_event(\"FIRE_END\", first_joystick->button_B());\n    }\n\n    input_->register_event(\"FIRE\", input->mouse()->left_button());\n    input_->register_keyboard_event(\"FIRE\", \"space\");\n\n    input_->register_up_event(\"FIRE_END\", input->mouse()->left_button());\n    input_->register_keyboard_up_event(\"FIRE_END\", \"space\");\n}\n\nvoid zombye::play_state::enter() {\n    zombye::log(\"enter play state\");\n\n    auto& game = *sm_->get_game();\n\n    auto& scripting_system = game.scripting_system();\n    scripting_system.begin_module(\"MyModule\");\n    scripting_system.load_script(\"scripts\/test.as\");\n    scripting_system.end_module();\n    scripting_system.exec(\"void main()\", \"MyModule\");\n}\n\nvoid zombye::play_state::leave() {\n    zombye::log(\"leave play state\");\n}\n\nvoid zombye::play_state::update(float delta_time) {\n    input_->handle_input();\n}\n<commit_msg>Register test actions for play state and connect them to the input.<commit_after>#include <cmath>\n\n#include <glm\/gtc\/matrix_transform.hpp>\n#include <SDL2\/SDL.h>\n\n#include <zombye\/core\/game.hpp>\n#include <zombye\/ecs\/entity_manager.hpp>\n#include <zombye\/gameplay\/states\/play_state.hpp>\n#include <zombye\/input\/input_manager.hpp>\n#include <zombye\/input\/input_system.hpp>\n#include <zombye\/input\/joystick.hpp>\n#include <zombye\/input\/mouse.hpp>\n#include <zombye\/physics\/shapes\/box_shape.hpp>\n#include <zombye\/physics\/physics_component.hpp>\n#include <zombye\/rendering\/animation_component.hpp>\n#include <zombye\/rendering\/camera_component.hpp>\n#include <zombye\/rendering\/rendering_system.hpp>\n#include <zombye\/scripting\/scripting_system.hpp>\n#include <zombye\/utils\/logger.hpp>\n#include <zombye\/utils\/state_machine.hpp>\n\nzombye::play_state::play_state(zombye::state_machine *sm) : sm_(sm) {\n    auto input = sm->get_game()->input();\n    input_ = input->create_manager();\n\n    \/*input_->register_action(\"FIRE\", []() {\n        zombye::log(\"Peng Peng!\");\n    });*\/\n    input_->register_actions(*sm->get_game(), \"scripts\/input\/play_state.as\");\n\n    input_->register_action(\"FIRE_END\", []() {\n        zombye::log(\"No more peng :(\");\n    });\n\n    auto first_joystick = input->first_joystick();\n\n    if(first_joystick) {\n        input_->register_event(\"FIRE\", first_joystick->button_A());\n        input_->register_event(\"FIRE\", first_joystick->button_B());\n\n        input_->register_up_event(\"FIRE_END\", first_joystick->button_A());\n        input_->register_up_event(\"FIRE_END\", first_joystick->button_B());\n    }\n\n    input_->register_event(\"FIRE\", input->mouse()->left_button());\n    input_->register_keyboard_event(\"FIRE\", \"space\");\n    input_->register_up_event(\"FIRE_END\", input->mouse()->left_button());\n    input_->register_keyboard_up_event(\"FIRE_END\", \"space\");\n\n    input_->register_keyboard_event(\"move_forward_begin\", \"w\");\n    input_->register_keyboard_up_event(\"move_forward_end\", \"w\");\n    input_->register_keyboard_event(\"move_backward_begin\", \"s\");\n    input_->register_keyboard_up_event(\"move_backward_end\", \"s\");\n    input_->register_keyboard_event(\"move_right_begin\", \"d\");\n    input_->register_keyboard_up_event(\"move_right_end\", \"d\");\n    input_->register_keyboard_event(\"move_left_begin\", \"a\");\n    input_->register_keyboard_up_event(\"move_left_end\", \"a\");\n}\n\nvoid zombye::play_state::enter() {\n    zombye::log(\"enter play state\");\n\n    auto& game = *sm_->get_game();\n\n    auto& scripting_system = game.scripting_system();\n    scripting_system.begin_module(\"MyModule\");\n    scripting_system.load_script(\"scripts\/test.as\");\n    scripting_system.end_module();\n    scripting_system.exec(\"void main()\", \"MyModule\");\n}\n\nvoid zombye::play_state::leave() {\n    zombye::log(\"leave play state\");\n}\n\nvoid zombye::play_state::update(float delta_time) {\n    input_->handle_input();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * The MIT License (MIT)\n *\n * Copyright (c) 2016 Julian Ganz\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#ifndef CMOH_UTILS_HPP__\n#define CMOH_UTILS_HPP__\n\n#include <type_traits>\n\n\nnamespace cmoh {\nnamespace util {\n\n\n\/**\n * Count the number of arguments in a template parameter pack\n *\n * Instantiations of this struct will contain a static member `value`, which\n * will hold the number of arguments supplied to the template.\n *\/\ntemplate <\n    typename ...Args\n>\nstruct count;\n\n\/\/ Specialization for lists of at least one argument\ntemplate <\n    typename Arg0,\n    typename ...Args\n>\nstruct count<Arg0, Args...> {\n    static constexpr unsigned long int value = count<Args...>::value + 1;\n};\n\n\/\/ Recursion terminator\/specialization for zero arguments\ntemplate <>\nstruct count<> {\n    static constexpr unsigned long int value = 0;\n};\n\n\n\/**\n * Logical conjunction of type traits `Items`\n *\n * Providing that each of the `Items` types provides a member `value` of type\n * bool, this type provides a member `value` of type bool with the value of the\n * logical conjunction of each of the values taken from the parameters.\n *\n * This template mirrors a utility which is expected to ship with C++17\n * compliant STL implementations.\n *\/\ntemplate <\n    typename ...Items\n>\nstruct conjunction : std::true_type {};\n\ntemplate <\n    typename Item0,\n    typename ...Items\n>\nstruct conjunction<Item0, Items...> {\n    static constexpr bool value = Item0::value && conjunction<Items...>::value;\n};\n\n\n\/**\n * Logical disjunction of type traits `Items`\n *\n * Providing that each of the `Items` types provides a member `value` of type\n * bool, this type provides a member `value` of type bool with the value of the\n * logical disjunction of each of the values taken from the parameters.\n *\n * This template mirrors a utility which is expected to ship with C++17\n * compliant STL implementations.\n *\/\ntemplate <\n    typename ...Items\n>\nstruct disjunction : std::false_type {};\n\ntemplate <\n    typename Item0,\n    typename ...Items\n>\nstruct disjunction<Item0, Items...> {\n    static constexpr bool value = Item0::value || disjunction<Items...>::value;\n};\n\n\n\/**\n * Test whether a type occurs in a template parameter pack\n *\n * Instantiations of this struct contain a static member `value`, which will\n * be `true` if `Compare` occurs in `Types` and false otherwise.\n *\/\ntemplate <\n    typename Compare, \/\/\/< Type to compare against items in `Types`\n    typename ...Types \/\/\/< Types against which to compare `Compare` against\n>\nusing contains = disjunction<std::is_same<Compare, Types>...>;\n\n\n\/**\n * Predeclaration of the C++17 std::void_t\n *\n * Used for SFINAE.\n *\/\ntemplate <\n    typename...\n>\nusing void_t = void;\n\n\n\/**\n * Meta type extracting the common type of a parameter pack\n *\n * If all `Types` are identical, the type will be exported as the member `type`.\n * If not all parameters are identical, a compile time error will be issued.\n *\/\ntemplate <\n    typename ...Types \/\/\/< types to unify\n>\nstruct common_type {\n    static_assert(count<Types...>::value > 0, \"Parameter pack is empty\");\n};\n\n\/\/ Specialization for more than one parameter\ntemplate <\n    typename Type0,\n    typename ...Types\n>\nstruct common_type<Type0, Types...> {\n    typedef Type0 type;\n    static_assert(\n        std::is_same<type, typename common_type<Types...>::type>::value,\n        \"Types are not identical\"\n    );\n};\n\n\/\/ Specialization for exactly one parameter\ntemplate <\n    typename Type\n>\nstruct common_type<Type> {\n    typedef Type type;\n};\n\n\n}\n}\n\n\n#endif\n<commit_msg>Modify cmoh::utils::common_type to ignore void type<commit_after>\/*\n * The MIT License (MIT)\n *\n * Copyright (c) 2016 Julian Ganz\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#ifndef CMOH_UTILS_HPP__\n#define CMOH_UTILS_HPP__\n\n#include <type_traits>\n\n\nnamespace cmoh {\nnamespace util {\n\n\n\/**\n * Count the number of arguments in a template parameter pack\n *\n * Instantiations of this struct will contain a static member `value`, which\n * will hold the number of arguments supplied to the template.\n *\/\ntemplate <\n    typename ...Args\n>\nstruct count;\n\n\/\/ Specialization for lists of at least one argument\ntemplate <\n    typename Arg0,\n    typename ...Args\n>\nstruct count<Arg0, Args...> {\n    static constexpr unsigned long int value = count<Args...>::value + 1;\n};\n\n\/\/ Recursion terminator\/specialization for zero arguments\ntemplate <>\nstruct count<> {\n    static constexpr unsigned long int value = 0;\n};\n\n\n\/**\n * Logical conjunction of type traits `Items`\n *\n * Providing that each of the `Items` types provides a member `value` of type\n * bool, this type provides a member `value` of type bool with the value of the\n * logical conjunction of each of the values taken from the parameters.\n *\n * This template mirrors a utility which is expected to ship with C++17\n * compliant STL implementations.\n *\/\ntemplate <\n    typename ...Items\n>\nstruct conjunction : std::true_type {};\n\ntemplate <\n    typename Item0,\n    typename ...Items\n>\nstruct conjunction<Item0, Items...> {\n    static constexpr bool value = Item0::value && conjunction<Items...>::value;\n};\n\n\n\/**\n * Logical disjunction of type traits `Items`\n *\n * Providing that each of the `Items` types provides a member `value` of type\n * bool, this type provides a member `value` of type bool with the value of the\n * logical disjunction of each of the values taken from the parameters.\n *\n * This template mirrors a utility which is expected to ship with C++17\n * compliant STL implementations.\n *\/\ntemplate <\n    typename ...Items\n>\nstruct disjunction : std::false_type {};\n\ntemplate <\n    typename Item0,\n    typename ...Items\n>\nstruct disjunction<Item0, Items...> {\n    static constexpr bool value = Item0::value || disjunction<Items...>::value;\n};\n\n\n\/**\n * Test whether a type occurs in a template parameter pack\n *\n * Instantiations of this struct contain a static member `value`, which will\n * be `true` if `Compare` occurs in `Types` and false otherwise.\n *\/\ntemplate <\n    typename Compare, \/\/\/< Type to compare against items in `Types`\n    typename ...Types \/\/\/< Types against which to compare `Compare` against\n>\nusing contains = disjunction<std::is_same<Compare, Types>...>;\n\n\n\/**\n * Predeclaration of the C++17 std::void_t\n *\n * Used for SFINAE.\n *\/\ntemplate <\n    typename...\n>\nusing void_t = void;\n\n\n\/**\n * Meta type extracting the common type of a parameter pack\n *\n * All `Types` that are identical to `void` are ignored. If all the remaining\n * `Types` are identical, the type will be exported as the member `type`.\n * If not all parameters are identical or `void`, a compile time error will be\n * issued.\n *\/\ntemplate <\n    typename ...Types \/\/\/< types to unify\n>\nstruct common_type {\n    static_assert(count<Types...>::value > 0, \"Parameter pack is empty\");\n};\n\n\/\/ Specialization for more than one parameter\ntemplate <\n    typename Type0,\n    typename ...Types\n>\nstruct common_type<Type0, Types...> {\n    typedef Type0 type;\n    static_assert(\n        std::is_same<typename common_type<Types...>::type, type>::value ||\n        std::is_void<typename common_type<Types...>::type>::value,\n        \"Types are not identical\"\n    );\n};\n\n\/\/ Specialization for the void type\ntemplate <\n    typename ...Types\n>\nstruct common_type<void, Types...> {\n    typedef typename common_type<Types...>::type type;\n};\n\n\/\/ Specialization for exactly one parameter\ntemplate <\n    typename Type\n>\nstruct common_type<Type> {\n    typedef Type type;\n};\n\n\/\/ Otherwise pointless specialization to avoid \"ambogious specialization\"\ntemplate <>\nstruct common_type<void> {\n    typedef void type;\n};\n\n\n}\n}\n\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"stan\/math\/functions\/Phi_approx.hpp\"\r\n#include \"stan\/math\/functions\/Phi.hpp\"\r\n#include <gtest\/gtest.h>\r\n\r\nTEST(MathFunctions, Phi_approx) {\r\n  EXPECT_EQ(0.5, stan::math::Phi_approx(0.0));\r\n  EXPECT_NEAR(stan::math::Phi(0.9), stan::math::Phi_approx(0.9), 0.00014);\r\n  EXPECT_NEAR(stan::math::Phi(-5.0), stan::math::Phi_approx(-5.0), 0.00014);\r\n}\r\n<commit_msg>added NaN test for Phi_approx<commit_after>#include <stan\/math\/functions\/Phi_approx.hpp>\r\n#include <stan\/math\/functions\/Phi.hpp>\r\n#include <boost\/math\/special_functions\/fpclassify.hpp>\r\n#include <gtest\/gtest.h>\r\n\r\nbool IsNan(double x) {\r\n  return (boost::math::isnan)(x);\r\n}\r\n\r\nTEST(MathFunctions, Phi_approx) {\r\n  EXPECT_EQ(0.5, stan::math::Phi_approx(0.0));\r\n  EXPECT_NEAR(stan::math::Phi(0.9), stan::math::Phi_approx(0.9), 0.00014);\r\n  EXPECT_NEAR(stan::math::Phi(-5.0), stan::math::Phi_approx(-5.0), 0.00014);\r\n}\r\n\r\nTEST(MathFunctions, Phi_approx_nan) {\r\n  double nan = std::numeric_limits<double>::quiet_NaN();\r\n  \r\n  EXPECT_PRED1(boost::math::isnan<double>,\r\n               stan::math::Phi_approx(nan));\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>#include \"ChLcpSolverParallel.h\"\n#include \"math\/ChThrustLinearAlgebra.h\"\n\n\nusing namespace chrono;\n\n\n\/\/\/\/ TODO:  For now, this is hard-coded for Hunt-Crossley with Simple Sliding Friction.\n__host__ __device__\nvoid function_CalcContactForces(int&       index,           \/\/ index of this contact pair\n                                real&      dT,              \/\/ integration time step\n                                real3*     pos,             \/\/ body positions\n                                real4*     rot,             \/\/ body orientations\n                                real3*     vel,             \/\/ body linear velocity (global frame)\n                                real3*     omg,             \/\/ body angular velocity (local frame)\n                                real2*     elastic_moduli,  \/\/ Young's modulus (per body)\n                                real*      mu,              \/\/ coefficient of friction (per body)\n                                real*      alpha,           \/\/ disipation coefficient (per body)\n                                real*      cr,              \/\/ coefficient of restitution (per body)\n                                real*      cohesion,        \/\/ cohesion force (per body)\n                                long long* pairs,           \/\/ shape IDs (per contact pairs)\n                                uint*      body_id,         \/\/ body IDs (per shape)\n                                real3*     pt1,             \/\/ point on shape 1 (per contact)\n                                real3*     pt2,             \/\/ point on shape 2 (per contact)\n                                real3*     normal,          \/\/ contact normal (per contact)\n                                real*      depth,           \/\/ penetration depth (per contact)\n                                real*      eff_radius,      \/\/ effective contact radius (per contact)\n                                int*       ext_body_id,     \/\/ [output] body IDs (two per contact)\n                                real3*     ext_body_force,  \/\/ [output] body force (two per contact)\n                                real3*     ext_body_torque) \/\/ [output] body torque (two per contact)\n{\n\t\/\/ Identify the two bodies in contact. First, find the IDs of the shapes in\n\t\/\/ contact, then find the IDs of the associated bodies.\n\tint2 pair = I2(int(pairs[index] >> 32), int(pairs[index] & 0xffffffff));\n\tint body1 = body_id[pair.x];\n\tint body2 = body_id[pair.y];\n\n\t\/\/ If the two contact shapes are actually separated, set zero forces and torques\n\tif (depth[index] >= 0) {\n\t\text_body_id[2*index] = body1;\n\t\text_body_id[2*index+1] = body2;\n\t\text_body_force[2*index] = ZERO_VECTOR;\n\t\text_body_force[2*index+1] = ZERO_VECTOR;\n\t\text_body_torque[2*index] = ZERO_VECTOR;\n\t\text_body_torque[2*index+1] = ZERO_VECTOR;\n\n\t\treturn;\n\t}\n\n\t\/\/ Kinematic information\n\t\/\/ ---------------------\n\n\t\/\/ Express contact point locations in local frames\n\t\/\/   s' = At * s = At * (rP - r)\n\treal3 pt1_loc = TransformParentToLocal(pos[body1], rot[body1], pt1[index]);\n\treal3 pt2_loc = TransformParentToLocal(pos[body2], rot[body2], pt2[index]);\n\n\t\/\/ Calculate relative velocity (in global frame)\n\t\/\/   vP = v + omg x s = v + A * (omg' x s')\n\treal3 vel1 = vel[body1] + quatRotateMat(cross(omg[body1], pt1_loc), rot[body1]);\n\treal3 vel2 = vel[body2] + quatRotateMat(cross(omg[body2], pt2_loc), rot[body2]);\n\treal3 relvel = vel2 - vel1;\n\treal  relvel_n_mag = dot(relvel, normal[index]);\n\treal3 relvel_n = relvel_n_mag * normal[index];\n\treal3 relvel_t = relvel - relvel_n;\n\treal  relvel_t_mag = length(relvel_t);\n\n\t\/\/ Calculate composite material properties\n\t\/\/ ---------------------------------------\n\n\treal Y1 = elastic_moduli[body1].x;\n\treal Y2 = elastic_moduli[body2].x;\n\treal nu1 = elastic_moduli[body1].y;\n\treal nu2 = elastic_moduli[body2].y;\n\treal inv_E = (1 - nu1 * nu1) \/ Y1 + (1 - nu2 * nu2) \/ Y2;\n\treal inv_G = 2 * (2 + nu1) * (1 - nu1) \/ Y1 + 2 * (2 + nu2) * (1 - nu2) \/ Y2;\n\n\treal E_eff = 1 \/ inv_E;\n\treal G_eff = 1 \/ inv_G;\n\n\treal mu_eff = min(mu[body1], mu[body2]);\n\t\/\/real cr_eff = (cr[body1] + cr[body2]) \/ 2;\n\treal alpha_eff = (alpha[body1] + alpha[body2]) \/ 2;\n\n\treal cohesion_eff = min(cohesion[body1], cohesion[body2]);\n\n\t\/\/ Contact force\n\t\/\/ -------------\n\n\t\/\/ Normal force: Hunt-Crossley\n\treal delta = -depth[index];\n\treal kn = (4.0 \/ 3) * E_eff * sqrt(eff_radius[index]);\n\treal forceN_elastic = kn * delta * sqrt(delta);\n\treal forceN_dissipation = 1.5 * alpha_eff * forceN_elastic * relvel_n_mag;\n\treal forceN = forceN_elastic - forceN_dissipation;\n\n\t\/\/ Cohesion force\n\tforceN -= cohesion_eff;\n\n\treal3 force = forceN * normal[index];\n\n\t\/\/ Tangential force: Simple Coulomb Sliding\n\tif (relvel_t_mag > 1e-4) {\n\t\treal forceT = mu_eff * abs(forceN);\n\t\n\t\tforce -= (forceT \/ relvel_t_mag) * relvel_t;\n\t}\n\n\t\/\/ Body forces (in global frame) & torques (in local frame)\n\t\/\/ --------------------------------------------------------\n\n\t\/\/ Convert force into the local body frames and calculate induced torques\n\t\/\/    n' = s' x F' = s' x (A*F)\n\treal3 torque1_loc = cross(pt1_loc, quatRotateMatT(force, rot[body1]));\n\treal3 torque2_loc = cross(pt2_loc, quatRotateMatT(force, rot[body2]));\n\n\t\/\/ Store body forces and torques\n\text_body_id[2*index]   = body1;\n\text_body_id[2*index+1] = body2;\n\text_body_force[2*index]   = -force;\n\text_body_force[2*index+1] =  force;\n\text_body_torque[2*index]   = -torque1_loc;\n\text_body_torque[2*index+1] =  torque2_loc;\n}\n\n\nvoid ChLcpSolverParallelDEM::host_CalcContactForces(custom_vector<int>&   ext_body_id,\n                                                    custom_vector<real3>& ext_body_force,\n                                                    custom_vector<real3>& ext_body_torque)\n{\n#pragma omp parallel for\n\tfor (int index = 0; index < data_container->number_of_rigid_rigid; index++) {\n\t\tfunction_CalcContactForces(\n\t\t\tindex,\n\t\t\tstep_size,\n\t\t\tdata_container->host_data.pos_data.data(),\n\t\t\tdata_container->host_data.rot_data.data(),\n\t\t\tdata_container->host_data.vel_data.data(),\n\t\t\tdata_container->host_data.omg_data.data(),\n\t\t\tdata_container->host_data.elastic_moduli.data(),\n\t\t\tdata_container->host_data.mu.data(),\n\t\t\tdata_container->host_data.alpha.data(),\n\t\t\tdata_container->host_data.cr.data(),\n\t\t\tdata_container->host_data.cohesion_data.data(),\n\t\t\tdata_container->host_data.pair_rigid_rigid.data(),\n\t\t\tdata_container->host_data.id_rigid.data(),\n\t\t\tdata_container->host_data.cpta_rigid_rigid.data(),\n\t\t\tdata_container->host_data.cptb_rigid_rigid.data(),\n\t\t\tdata_container->host_data.norm_rigid_rigid.data(),\n\t\t\tdata_container->host_data.dpth_rigid_rigid.data(),\n\t\t\tdata_container->host_data.erad_rigid_rigid.data(),\n\t\t\text_body_id.data(),\n\t\t\text_body_force.data(),\n\t\t\text_body_torque.data());\n\t}\n}\n\n\nvoid ChLcpSolverParallelDEM::host_AddContactForces(uint                        ct_body_count,\n                                                   const custom_vector<int>&   ct_body_id,\n                                                   const custom_vector<real3>& ct_body_force,\n                                                   const custom_vector<real3>& ct_body_torque)\n{\n#pragma omp parallel for\n\tfor (int index = 0; index < ct_body_count; index++) {\n\t\tdata_container->host_data.frc_data[ct_body_id[index]] += step_size * ct_body_force[index];\n\t\tdata_container->host_data.trq_data[ct_body_id[index]] += step_size * ct_body_torque[index];\n\t}\n}\n\n\nvoid ChLcpSolverParallelDEM::ProcessContacts()\n{\n\t\/\/ 0. If the narrowphase collision detection does not set the effective contact\n\t\/\/    radius, fill it with the value 1.\n\tif (!data_container->erad_is_set)\n\t\tdata_container->host_data.erad_rigid_rigid.resize(data_container->number_of_rigid_rigid, 1.0);\n\n\t\/\/ 1. Calculate contact forces and torques - per contact basis\n\t\/\/    For each pair of contact shapes that overlap, we calculate and store\n\t\/\/    the IDs of the two corresponding bodies and the resulting contact\n\t\/\/    forces and torques on the two bodies.\n\tcustom_vector<int>   ext_body_id(2 * data_container->number_of_rigid_rigid);\n\tcustom_vector<real3> ext_body_force(2 * data_container->number_of_rigid_rigid);\n\tcustom_vector<real3> ext_body_torque(2 * data_container->number_of_rigid_rigid);\n\n\thost_CalcContactForces(ext_body_id, ext_body_force, ext_body_torque);\n\n\t\/\/ 2. Calculate contact forces and torques - per body basis\n\t\/\/    Accumulate the contact forces and torques for all bodies that are involved\n\t\/\/    in at least one contact, by reducing the contact forces and torques from\n\t\/\/    all contacts these bodies are involved in. The number of bodies that\n\t\/\/    experience at least one contact is calculated in 'ct_body_count'.\n\tthrust::sort_by_key(\n\t\text_body_id.begin(), ext_body_id.end(),\n\t\tthrust::make_zip_iterator(thrust::make_tuple(ext_body_force.begin(), ext_body_torque.begin())));\n\n\tcustom_vector<int>   ct_body_id(data_container->number_of_rigid);\n\tcustom_vector<real3> ct_body_force(data_container->number_of_rigid);\n\tcustom_vector<real3> ct_body_torque(data_container->number_of_rigid);\n\n\t\/\/ Reduce contact forces from all contacts and count bodies currently involved in contact\n\tuint ct_body_count = thrust::reduce_by_key(\n\t\text_body_id.begin(),\n\t\text_body_id.end(),\n\t\tthrust::make_zip_iterator(thrust::make_tuple(ext_body_force.begin(), ext_body_torque.begin())),\n\t\tct_body_id.begin(),\n\t\tthrust::make_zip_iterator(thrust::make_tuple(ct_body_force.begin(), ct_body_torque.begin())),\n\t\tthrust::equal_to<int>(),\n\t\tsum_tuples()\n\t\t).first - ct_body_id.begin();\n\n\t\/\/ 3. Add contact forces and torques to existing forces (impulses)\n\t\/\/    For all bodies involved in a contact, update the body forces and torques,\n\t\/\/    scaled by the integration time step.\n\thost_AddContactForces(ct_body_count, ct_body_id, ct_body_force, ct_body_torque);\n}\n\n\nvoid ChLcpSolverParallelDEM::RunTimeStep(real step)\n{\n\tstep_size = step;\n\tdata_container->step_size = step;\n\n\tnumber_of_constraints = data_container->number_of_bilaterals;\n\tnumber_of_objects = data_container->number_of_rigid;\n\n\t\/\/ Calculate contact forces (impulses) and append them to the body forces\n\tif (data_container->number_of_rigid_rigid)\n\t\tProcessContacts();\n\n\t\/\/ Include forces and torques (update derivatives: v += m_inv * h * f)\n\tPreprocess();\n\n\n\t\/\/\/\/ TODO:  check and clean up everything that has to do with bilateral constraints...\n\n\n\tdata_container->host_data.rhs_data.resize(number_of_constraints);\n\tdata_container->host_data.diag.resize(number_of_constraints);\n\n\tdata_container->host_data.gamma_data.resize((number_of_constraints));\n\n#pragma omp parallel for\n\tfor (int i = 0; i < number_of_constraints; i++) {\n\t\tdata_container->host_data.gamma_data[i] = 0;\n\t}\n\n\tbilateral.Setup(data_container);\n\n\tsolver.current_iteration = 0;\n\tsolver.total_iteration = 0;\n\tsolver.maxd_hist.clear();\n\tsolver.maxdeltalambda_hist.clear();\n\tsolver.iter_hist.clear();\n\n\tsolver.SetMaxIterations(max_iteration);\n\tsolver.SetTolerance(tolerance);\n\n\t\/\/solver.SetComplianceAlpha(alpha);\n\tsolver.SetContactRecoverySpeed(contact_recovery_speed);\n\tsolver.lcp_omega_bilateral = lcp_omega_bilateral;\n\t\/\/solver.rigid_rigid = &rigid_rigid;\n\tsolver.bilateral = &bilateral;\n\t\/\/solver.lcp_omega_contact = lcp_omega_contact;\n\tsolver.do_stab = do_stab;\n\tsolver.collision_inside = collision_inside;\n\tsolver.Initial(step, data_container);\n\n\tbilateral.ComputeJacobians();\n\tbilateral.ComputeRHS();\n\n\tif (max_iter_bilateral > 0) {\n\t\tcustom_vector<real> rhs_bilateral(data_container->number_of_bilaterals);\n\t\tthrust::copy_n(data_container->host_data.rhs_data.begin(), data_container->number_of_bilaterals, rhs_bilateral.begin());\n\t\tsolver.SolveStab(data_container->host_data.gamma_bilateral, rhs_bilateral, max_iter_bilateral);\n\t}\n\n\tthrust::copy_n(data_container->host_data.gamma_bilateral.begin(), data_container->number_of_bilaterals, data_container->host_data.gamma_data.begin());\n}\n\n<commit_msg>More direct way of obtaining the body IDs for a contact.<commit_after>#include \"ChLcpSolverParallel.h\"\n#include \"math\/ChThrustLinearAlgebra.h\"\n\n\nusing namespace chrono;\n\n\n\/\/\/\/ TODO:  For now, this is hard-coded for Hunt-Crossley with Simple Sliding Friction.\n__host__ __device__\nvoid function_CalcContactForces(int&       index,           \/\/ index of this contact pair\n                                real&      dT,              \/\/ integration time step\n                                real3*     pos,             \/\/ body positions\n                                real4*     rot,             \/\/ body orientations\n                                real3*     vel,             \/\/ body linear velocity (global frame)\n                                real3*     omg,             \/\/ body angular velocity (local frame)\n                                real2*     elastic_moduli,  \/\/ Young's modulus (per body)\n                                real*      mu,              \/\/ coefficient of friction (per body)\n                                real*      alpha,           \/\/ disipation coefficient (per body)\n                                real*      cr,              \/\/ coefficient of restitution (per body)\n                                real*      cohesion,        \/\/ cohesion force (per body)\n                                int2*      body_id,         \/\/ body IDs (per contact)\n                                real3*     pt1,             \/\/ point on shape 1 (per contact)\n                                real3*     pt2,             \/\/ point on shape 2 (per contact)\n                                real3*     normal,          \/\/ contact normal (per contact)\n                                real*      depth,           \/\/ penetration depth (per contact)\n                                real*      eff_radius,      \/\/ effective contact radius (per contact)\n                                int*       ext_body_id,     \/\/ [output] body IDs (two per contact)\n                                real3*     ext_body_force,  \/\/ [output] body force (two per contact)\n                                real3*     ext_body_torque) \/\/ [output] body torque (two per contact)\n{\n\t\/\/ Identify the two bodies in contact.\n\tint body1 = body_id[index].x;\n\tint body2 = body_id[index].y;\n\n\t\/\/ If the two contact shapes are actually separated, set zero forces and torques\n\tif (depth[index] >= 0) {\n\t\text_body_id[2*index] = body1;\n\t\text_body_id[2*index+1] = body2;\n\t\text_body_force[2*index] = ZERO_VECTOR;\n\t\text_body_force[2*index+1] = ZERO_VECTOR;\n\t\text_body_torque[2*index] = ZERO_VECTOR;\n\t\text_body_torque[2*index+1] = ZERO_VECTOR;\n\n\t\treturn;\n\t}\n\n\t\/\/ Kinematic information\n\t\/\/ ---------------------\n\n\t\/\/ Express contact point locations in local frames\n\t\/\/   s' = At * s = At * (rP - r)\n\treal3 pt1_loc = TransformParentToLocal(pos[body1], rot[body1], pt1[index]);\n\treal3 pt2_loc = TransformParentToLocal(pos[body2], rot[body2], pt2[index]);\n\n\t\/\/ Calculate relative velocity (in global frame)\n\t\/\/   vP = v + omg x s = v + A * (omg' x s')\n\treal3 vel1 = vel[body1] + quatRotateMat(cross(omg[body1], pt1_loc), rot[body1]);\n\treal3 vel2 = vel[body2] + quatRotateMat(cross(omg[body2], pt2_loc), rot[body2]);\n\treal3 relvel = vel2 - vel1;\n\treal  relvel_n_mag = dot(relvel, normal[index]);\n\treal3 relvel_n = relvel_n_mag * normal[index];\n\treal3 relvel_t = relvel - relvel_n;\n\treal  relvel_t_mag = length(relvel_t);\n\n\t\/\/ Calculate composite material properties\n\t\/\/ ---------------------------------------\n\n\treal Y1 = elastic_moduli[body1].x;\n\treal Y2 = elastic_moduli[body2].x;\n\treal nu1 = elastic_moduli[body1].y;\n\treal nu2 = elastic_moduli[body2].y;\n\treal inv_E = (1 - nu1 * nu1) \/ Y1 + (1 - nu2 * nu2) \/ Y2;\n\treal inv_G = 2 * (2 + nu1) * (1 - nu1) \/ Y1 + 2 * (2 + nu2) * (1 - nu2) \/ Y2;\n\n\treal E_eff = 1 \/ inv_E;\n\treal G_eff = 1 \/ inv_G;\n\n\treal mu_eff = min(mu[body1], mu[body2]);\n\t\/\/real cr_eff = (cr[body1] + cr[body2]) \/ 2;\n\treal alpha_eff = (alpha[body1] + alpha[body2]) \/ 2;\n\n\treal cohesion_eff = min(cohesion[body1], cohesion[body2]);\n\n\t\/\/ Contact force\n\t\/\/ -------------\n\n\t\/\/ Normal force: Hunt-Crossley\n\treal delta = -depth[index];\n\treal kn = (4.0 \/ 3) * E_eff * sqrt(eff_radius[index]);\n\treal forceN_elastic = kn * delta * sqrt(delta);\n\treal forceN_dissipation = 1.5 * alpha_eff * forceN_elastic * relvel_n_mag;\n\treal forceN = forceN_elastic - forceN_dissipation;\n\n\t\/\/ Cohesion force\n\tforceN -= cohesion_eff;\n\n\treal3 force = forceN * normal[index];\n\n\t\/\/ Tangential force: Simple Coulomb Sliding\n\tif (relvel_t_mag > 1e-4) {\n\t\treal forceT = mu_eff * abs(forceN);\n\t\n\t\tforce -= (forceT \/ relvel_t_mag) * relvel_t;\n\t}\n\n\t\/\/ Body forces (in global frame) & torques (in local frame)\n\t\/\/ --------------------------------------------------------\n\n\t\/\/ Convert force into the local body frames and calculate induced torques\n\t\/\/    n' = s' x F' = s' x (A*F)\n\treal3 torque1_loc = cross(pt1_loc, quatRotateMatT(force, rot[body1]));\n\treal3 torque2_loc = cross(pt2_loc, quatRotateMatT(force, rot[body2]));\n\n\t\/\/ Store body forces and torques\n\text_body_id[2*index]   = body1;\n\text_body_id[2*index+1] = body2;\n\text_body_force[2*index]   = -force;\n\text_body_force[2*index+1] =  force;\n\text_body_torque[2*index]   = -torque1_loc;\n\text_body_torque[2*index+1] =  torque2_loc;\n}\n\n\nvoid ChLcpSolverParallelDEM::host_CalcContactForces(custom_vector<int>&   ext_body_id,\n                                                    custom_vector<real3>& ext_body_force,\n                                                    custom_vector<real3>& ext_body_torque)\n{\n#pragma omp parallel for\n\tfor (int index = 0; index < data_container->number_of_rigid_rigid; index++) {\n\t\tfunction_CalcContactForces(\n\t\t\tindex,\n\t\t\tstep_size,\n\t\t\tdata_container->host_data.pos_data.data(),\n\t\t\tdata_container->host_data.rot_data.data(),\n\t\t\tdata_container->host_data.vel_data.data(),\n\t\t\tdata_container->host_data.omg_data.data(),\n\t\t\tdata_container->host_data.elastic_moduli.data(),\n\t\t\tdata_container->host_data.mu.data(),\n\t\t\tdata_container->host_data.alpha.data(),\n\t\t\tdata_container->host_data.cr.data(),\n\t\t\tdata_container->host_data.cohesion_data.data(),\n\t\t\tdata_container->host_data.bids_rigid_rigid.data(),\n\t\t\tdata_container->host_data.cpta_rigid_rigid.data(),\n\t\t\tdata_container->host_data.cptb_rigid_rigid.data(),\n\t\t\tdata_container->host_data.norm_rigid_rigid.data(),\n\t\t\tdata_container->host_data.dpth_rigid_rigid.data(),\n\t\t\tdata_container->host_data.erad_rigid_rigid.data(),\n\t\t\text_body_id.data(),\n\t\t\text_body_force.data(),\n\t\t\text_body_torque.data());\n\t}\n}\n\n\nvoid ChLcpSolverParallelDEM::host_AddContactForces(uint                        ct_body_count,\n                                                   const custom_vector<int>&   ct_body_id,\n                                                   const custom_vector<real3>& ct_body_force,\n                                                   const custom_vector<real3>& ct_body_torque)\n{\n#pragma omp parallel for\n\tfor (int index = 0; index < ct_body_count; index++) {\n\t\tdata_container->host_data.frc_data[ct_body_id[index]] += step_size * ct_body_force[index];\n\t\tdata_container->host_data.trq_data[ct_body_id[index]] += step_size * ct_body_torque[index];\n\t}\n}\n\n\nvoid ChLcpSolverParallelDEM::ProcessContacts()\n{\n\t\/\/ 0. If the narrowphase collision detection does not set the effective contact\n\t\/\/    radius, fill it with the value 1.\n\tif (!data_container->erad_is_set)\n\t\tdata_container->host_data.erad_rigid_rigid.resize(data_container->number_of_rigid_rigid, 1.0);\n\n\t\/\/ 1. Calculate contact forces and torques - per contact basis\n\t\/\/    For each pair of contact shapes that overlap, we calculate and store\n\t\/\/    the IDs of the two corresponding bodies and the resulting contact\n\t\/\/    forces and torques on the two bodies.\n\tcustom_vector<int>   ext_body_id(2 * data_container->number_of_rigid_rigid);\n\tcustom_vector<real3> ext_body_force(2 * data_container->number_of_rigid_rigid);\n\tcustom_vector<real3> ext_body_torque(2 * data_container->number_of_rigid_rigid);\n\n\thost_CalcContactForces(ext_body_id, ext_body_force, ext_body_torque);\n\n\t\/\/ 2. Calculate contact forces and torques - per body basis\n\t\/\/    Accumulate the contact forces and torques for all bodies that are involved\n\t\/\/    in at least one contact, by reducing the contact forces and torques from\n\t\/\/    all contacts these bodies are involved in. The number of bodies that\n\t\/\/    experience at least one contact is calculated in 'ct_body_count'.\n\tthrust::sort_by_key(\n\t\text_body_id.begin(), ext_body_id.end(),\n\t\tthrust::make_zip_iterator(thrust::make_tuple(ext_body_force.begin(), ext_body_torque.begin())));\n\n\tcustom_vector<int>   ct_body_id(data_container->number_of_rigid);\n\tcustom_vector<real3> ct_body_force(data_container->number_of_rigid);\n\tcustom_vector<real3> ct_body_torque(data_container->number_of_rigid);\n\n\t\/\/ Reduce contact forces from all contacts and count bodies currently involved in contact\n\tuint ct_body_count = thrust::reduce_by_key(\n\t\text_body_id.begin(),\n\t\text_body_id.end(),\n\t\tthrust::make_zip_iterator(thrust::make_tuple(ext_body_force.begin(), ext_body_torque.begin())),\n\t\tct_body_id.begin(),\n\t\tthrust::make_zip_iterator(thrust::make_tuple(ct_body_force.begin(), ct_body_torque.begin())),\n\t\tthrust::equal_to<int>(),\n\t\tsum_tuples()\n\t\t).first - ct_body_id.begin();\n\n\t\/\/ 3. Add contact forces and torques to existing forces (impulses)\n\t\/\/    For all bodies involved in a contact, update the body forces and torques,\n\t\/\/    scaled by the integration time step.\n\thost_AddContactForces(ct_body_count, ct_body_id, ct_body_force, ct_body_torque);\n}\n\n\nvoid ChLcpSolverParallelDEM::RunTimeStep(real step)\n{\n\tstep_size = step;\n\tdata_container->step_size = step;\n\n\tnumber_of_constraints = data_container->number_of_bilaterals;\n\tnumber_of_objects = data_container->number_of_rigid;\n\n\t\/\/ Calculate contact forces (impulses) and append them to the body forces\n\tif (data_container->number_of_rigid_rigid)\n\t\tProcessContacts();\n\n\t\/\/ Include forces and torques (update derivatives: v += m_inv * h * f)\n\tPreprocess();\n\n\n\t\/\/\/\/ TODO:  check and clean up everything that has to do with bilateral constraints...\n\n\n\tdata_container->host_data.rhs_data.resize(number_of_constraints);\n\tdata_container->host_data.diag.resize(number_of_constraints);\n\n\tdata_container->host_data.gamma_data.resize((number_of_constraints));\n\n#pragma omp parallel for\n\tfor (int i = 0; i < number_of_constraints; i++) {\n\t\tdata_container->host_data.gamma_data[i] = 0;\n\t}\n\n\tbilateral.Setup(data_container);\n\n\tsolver.current_iteration = 0;\n\tsolver.total_iteration = 0;\n\tsolver.maxd_hist.clear();\n\tsolver.maxdeltalambda_hist.clear();\n\tsolver.iter_hist.clear();\n\n\tsolver.SetMaxIterations(max_iteration);\n\tsolver.SetTolerance(tolerance);\n\n\t\/\/solver.SetComplianceAlpha(alpha);\n\tsolver.SetContactRecoverySpeed(contact_recovery_speed);\n\tsolver.lcp_omega_bilateral = lcp_omega_bilateral;\n\t\/\/solver.rigid_rigid = &rigid_rigid;\n\tsolver.bilateral = &bilateral;\n\t\/\/solver.lcp_omega_contact = lcp_omega_contact;\n\tsolver.do_stab = do_stab;\n\tsolver.collision_inside = collision_inside;\n\tsolver.Initial(step, data_container);\n\n\tbilateral.ComputeJacobians();\n\tbilateral.ComputeRHS();\n\n\tif (max_iter_bilateral > 0) {\n\t\tcustom_vector<real> rhs_bilateral(data_container->number_of_bilaterals);\n\t\tthrust::copy_n(data_container->host_data.rhs_data.begin(), data_container->number_of_bilaterals, rhs_bilateral.begin());\n\t\tsolver.SolveStab(data_container->host_data.gamma_bilateral, rhs_bilateral, max_iter_bilateral);\n\t}\n\n\tthrust::copy_n(data_container->host_data.gamma_bilateral.begin(), data_container->number_of_bilaterals, data_container->host_data.gamma_data.begin());\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_Number::FormatNative___STATIC__STRING__OBJECT__CHAR__I4( CLR_RT_StackFrame& stack )\n{\n    NATIVE_PROFILE_CLR_CORE();\n    NANOCLR_HEADER();\n\n    CLR_RT_HeapBlock*     pArgs = &(stack.Arg0());\n    CLR_RT_HeapBlock*     value = pArgs;\n    CLR_DataType          dt;\n    CLR_RT_TypeDescriptor desc;\n    char result[ 256 ];\n    \/\/ This is temporary buffer to create proper format string.  \n    char formatStr[ 8 ];\n    char formatCh  = (char)pArgs[ 1 ].NumericByRef().u1;\n    int  precision =       pArgs[ 2 ].NumericByRef().s4;\n\n    NANOCLR_CHECK_HRESULT(desc.InitializeFromObject( *value ));\n    NANOCLR_CHECK_HRESULT(value->PerformUnboxing( desc.m_handlerCls ));\n\n    dt = value->DataType();\n\n    if(formatCh == 'X')\n    {\n        \n        switch(dt)\n        {\n        case DATATYPE_I1: \n            \/\/ have to converted to char to put it as 8 bit data. Otherwise it won't keep 8bit.\n            hal_snprintf( result, ARRAYSIZE(result), \"%.*X\", precision, (char)value->NumericByRef().s1 ); \n            break;\n        case DATATYPE_U1: \n            hal_snprintf( result, ARRAYSIZE(result), \"%.*X\", precision, (char)value->NumericByRef().u1 ); \n            break;\n        case DATATYPE_I2: \n            hal_snprintf( result, ARRAYSIZE(result), \"%.*hX\", precision,(CLR_INT16) value->NumericByRef().s2 ); \n            break;\n        case DATATYPE_U2: \n            hal_snprintf( result, ARRAYSIZE(result), \"%.*hX\", precision,(CLR_UINT16)value->NumericByRef().u2 ); \n            break;\n        case DATATYPE_I4: \n            hal_snprintf( result, ARRAYSIZE(result), \"%.*X\", precision, (CLR_INT32)value->NumericByRef().s4 ); \n            break;\n        case DATATYPE_U4: \n            hal_snprintf( result, ARRAYSIZE(result), \"%.*X\", precision, (CLR_UINT32)value->NumericByRef().u4 ); \n            break;\n#if defined(_WIN32)\n        case DATATYPE_I8: \n            hal_snprintf( result, ARRAYSIZE(result), \"%I64X\",(CLR_INT64_TEMP_CAST)value->NumericByRef().s8 ); \n            break;\n        case DATATYPE_U8:\n            hal_snprintf( result, ARRAYSIZE(result), \"%I64X\",(CLR_UINT64_TEMP_CAST)value->NumericByRef().u8 ); \n            break;\n#else\n        case DATATYPE_I8: \n            hal_snprintf( result, ARRAYSIZE(result), \"%.*X\", precision, (CLR_INT64_TEMP_CAST)value->NumericByRef().s8); \n            break;\n        case DATATYPE_U8:\n            hal_snprintf( result, ARRAYSIZE(result), \"%.*X\", precision, (CLR_UINT64_TEMP_CAST)value->NumericByRef().u8 ); \n            break;\n#endif\n\n        default:\n            NANOCLR_SET_AND_LEAVE(CLR_E_FAIL);\n        }\n        \n    }\n    else\n    {\n        if(formatCh == 'G' && precision == 0)\n        {\n            precision = 1;\n        }\n        \n        switch(dt)\n        {\n        case DATATYPE_I1: \n            hal_snprintf( result, ARRAYSIZE(result), formatCh == 'N' ? \"%d\" : \"%.*d\", formatCh == 'N' ? value->NumericByRef().s1 : precision, value->NumericByRef().s1 );\n            break;\n        case DATATYPE_U1: \n            hal_snprintf( result, ARRAYSIZE(result), formatCh == 'N' ? \"%u\" : \"%.*u\", formatCh == 'N' ? value->NumericByRef().u1 : precision, value->NumericByRef().u1 );\n            break;\n        case DATATYPE_I2: \n            hal_snprintf( result, ARRAYSIZE(result), formatCh == 'N' ? \"%d\" : \"%.*d\", formatCh == 'N' ? value->NumericByRef().s2 : precision, value->NumericByRef().s2 );\n            break;\n        case DATATYPE_U2: \n            hal_snprintf( result, ARRAYSIZE(result), formatCh == 'N' ? \"%u\" : \"%.*u\", formatCh == 'N' ? value->NumericByRef().u2 : precision, value->NumericByRef().u2 );\n            break;\n        case DATATYPE_I4: \n            hal_snprintf( result, ARRAYSIZE(result), formatCh == 'N' ? \"%d\" : \"%.*d\", formatCh == 'N' ? value->NumericByRef().s4 : precision, value->NumericByRef().s4 );\n            break;\n        case DATATYPE_U4: \n            hal_snprintf( result, ARRAYSIZE(result), formatCh == 'N' ? \"%u\" : \"%.*u\", formatCh == 'N' ? value->NumericByRef().u4 : precision, value->NumericByRef().u4 );\n            break;\n#if defined(_WIN32)\n        case DATATYPE_I8: \n            hal_snprintf( result, ARRAYSIZE(result), \"%I64d\",(CLR_INT64_TEMP_CAST)value->NumericByRef().s8 ); \n            break;\n        case DATATYPE_U8:\n            hal_snprintf( result, ARRAYSIZE(result), \"%I64u\",(CLR_UINT64_TEMP_CAST)value->NumericByRef().u8 ); \n            break;\n#else\n        case DATATYPE_I8: \n            {   \/\/ use local 64 bit variable to assure 8-byte boundary.\n                signed __int64 i64 = (CLR_INT64_TEMP_CAST)value->NumericByRef().s8;\n                hal_snprintf( result, ARRAYSIZE(result), \"%.*ld\", precision, i64); \n            }\n            break;\n        case DATATYPE_U8: \n            {   \/\/ use local 64 bit variable to assure 8-byte boundary.\n                unsigned __int64 ui64 = (CLR_UINT64_TEMP_CAST)value->NumericByRef().u8;\n                hal_snprintf( result, ARRAYSIZE(result), \"%.*lu\", precision, ui64 ); \n            }\n            break;\n#endif\n        case DATATYPE_R4:\n        case DATATYPE_R8:\n            {\n                \/\/ All the formatCh have been converted to upper case in the managed layer\n                _ASSERTE(formatCh == 'G' || formatCh == 'N' || formatCh == 'F' || formatCh == 'D');\n\n                if (precision < 0 || precision > 99) \n                {\n                    NANOCLR_SET_AND_LEAVE( CLR_E_INVALID_PARAMETER );\n                }\n\n                if (formatCh == 'G') \n                {\n                    hal_snprintf( formatStr, ARRAYSIZE(formatStr), \"%%.%dg\", (dt == DATATYPE_R4) ? 9 : 17 ); \/\/ \"%.9g\" for float, \"%.17g\" for double\n                }\n                else\n                {\n                    hal_snprintf( formatStr, ARRAYSIZE(formatStr), \"%%.%df\", precision ); \/\/ i.e. \"%#.2f\" when precision is 2\n                }\n\n                if(dt == DATATYPE_R4)\n                {\n#if defined(_WIN32) || defined(WIN32) || defined(_WIN32_WCE)\n                    hal_snprintf( result, ARRAYSIZE(result), formatStr, value->NumericByRef().r4 );\n#else\n\n#if !defined(NANOCLR_EMULATED_FLOATINGPOINT)\n                    float f = value->NumericByRef().r4;\n                    hal_snprintf_float( result, ARRAYSIZE(result), formatStr, f); \n#else\n                    CLR_INT32 f = value->NumericByRef().r4;\n                    hal_snprintf_float( result, ARRAYSIZE(result), formatStr, f); \n#endif\n\n#endif\n                }\n                else\n                {\n#if defined(_WIN32) || defined(WIN32) || defined(_WIN32_WCE)\n                    hal_snprintf( result, ARRAYSIZE(result), formatStr, (CLR_DOUBLE_TEMP_CAST)value->NumericByRef().r8 );\n#else\n#if !defined(NANOCLR_EMULATED_FLOATINGPOINT)\n                    double d = (CLR_DOUBLE_TEMP_CAST)value->NumericByRef().r8;\n                    hal_snprintf_double( result, ARRAYSIZE(result), formatStr, d ); \n\n#else\n                    CLR_INT64 d = (CLR_DOUBLE_TEMP_CAST)value->NumericByRef().r8;\n                    hal_snprintf_double( result, ARRAYSIZE(result), formatStr, d ); \n#endif\n\n#endif                \n                }\n            }\n            break;\n        default:\n            NANOCLR_SET_AND_LEAVE(CLR_E_FAIL);\n        }\n    }\n\n    NANOCLR_SET_AND_LEAVE(stack.SetResult_String( result ));\n\n    NANOCLR_NOCLEANUP();\n}\n<commit_msg>Fix format specifier for double printf (#743)<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_Number::FormatNative___STATIC__STRING__OBJECT__CHAR__I4( CLR_RT_StackFrame& stack )\n{\n    NATIVE_PROFILE_CLR_CORE();\n    NANOCLR_HEADER();\n\n    CLR_RT_HeapBlock*     pArgs = &(stack.Arg0());\n    CLR_RT_HeapBlock*     value = pArgs;\n    CLR_DataType          dt;\n    CLR_RT_TypeDescriptor desc;\n    char result[ 256 ];\n    \/\/ This is temporary buffer to create proper format string.  \n    char formatStr[ 8 ];\n    char formatCh  = (char)pArgs[ 1 ].NumericByRef().u1;\n    int  precision =       pArgs[ 2 ].NumericByRef().s4;\n\n    NANOCLR_CHECK_HRESULT(desc.InitializeFromObject( *value ));\n    NANOCLR_CHECK_HRESULT(value->PerformUnboxing( desc.m_handlerCls ));\n\n    dt = value->DataType();\n\n    if(formatCh == 'X')\n    {\n        \n        switch(dt)\n        {\n        case DATATYPE_I1: \n            \/\/ have to converted to char to put it as 8 bit data. Otherwise it won't keep 8bit.\n            hal_snprintf( result, ARRAYSIZE(result), \"%.*X\", precision, (char)value->NumericByRef().s1 ); \n            break;\n        case DATATYPE_U1: \n            hal_snprintf( result, ARRAYSIZE(result), \"%.*X\", precision, (char)value->NumericByRef().u1 ); \n            break;\n        case DATATYPE_I2: \n            hal_snprintf( result, ARRAYSIZE(result), \"%.*hX\", precision,(CLR_INT16) value->NumericByRef().s2 ); \n            break;\n        case DATATYPE_U2: \n            hal_snprintf( result, ARRAYSIZE(result), \"%.*hX\", precision,(CLR_UINT16)value->NumericByRef().u2 ); \n            break;\n        case DATATYPE_I4: \n            hal_snprintf( result, ARRAYSIZE(result), \"%.*X\", precision, (CLR_INT32)value->NumericByRef().s4 ); \n            break;\n        case DATATYPE_U4: \n            hal_snprintf( result, ARRAYSIZE(result), \"%.*X\", precision, (CLR_UINT32)value->NumericByRef().u4 ); \n            break;\n#if defined(_WIN32)\n        case DATATYPE_I8: \n            hal_snprintf( result, ARRAYSIZE(result), \"%I64X\",(CLR_INT64_TEMP_CAST)value->NumericByRef().s8 ); \n            break;\n        case DATATYPE_U8:\n            hal_snprintf( result, ARRAYSIZE(result), \"%I64X\",(CLR_UINT64_TEMP_CAST)value->NumericByRef().u8 ); \n            break;\n#else\n        case DATATYPE_I8: \n            hal_snprintf( result, ARRAYSIZE(result), \"%.*X\", precision, (CLR_INT64_TEMP_CAST)value->NumericByRef().s8); \n            break;\n        case DATATYPE_U8:\n            hal_snprintf( result, ARRAYSIZE(result), \"%.*X\", precision, (CLR_UINT64_TEMP_CAST)value->NumericByRef().u8 ); \n            break;\n#endif\n\n        default:\n            NANOCLR_SET_AND_LEAVE(CLR_E_FAIL);\n        }\n        \n    }\n    else\n    {\n        if(formatCh == 'G' && precision == 0)\n        {\n            precision = 1;\n        }\n        \n        switch(dt)\n        {\n        case DATATYPE_I1: \n            hal_snprintf( result, ARRAYSIZE(result), formatCh == 'N' ? \"%d\" : \"%.*d\", formatCh == 'N' ? value->NumericByRef().s1 : precision, value->NumericByRef().s1 );\n            break;\n        case DATATYPE_U1: \n            hal_snprintf( result, ARRAYSIZE(result), formatCh == 'N' ? \"%u\" : \"%.*u\", formatCh == 'N' ? value->NumericByRef().u1 : precision, value->NumericByRef().u1 );\n            break;\n        case DATATYPE_I2: \n            hal_snprintf( result, ARRAYSIZE(result), formatCh == 'N' ? \"%d\" : \"%.*d\", formatCh == 'N' ? value->NumericByRef().s2 : precision, value->NumericByRef().s2 );\n            break;\n        case DATATYPE_U2: \n            hal_snprintf( result, ARRAYSIZE(result), formatCh == 'N' ? \"%u\" : \"%.*u\", formatCh == 'N' ? value->NumericByRef().u2 : precision, value->NumericByRef().u2 );\n            break;\n        case DATATYPE_I4: \n            hal_snprintf( result, ARRAYSIZE(result), formatCh == 'N' ? \"%d\" : \"%.*d\", formatCh == 'N' ? value->NumericByRef().s4 : precision, value->NumericByRef().s4 );\n            break;\n        case DATATYPE_U4: \n            hal_snprintf( result, ARRAYSIZE(result), formatCh == 'N' ? \"%u\" : \"%.*u\", formatCh == 'N' ? value->NumericByRef().u4 : precision, value->NumericByRef().u4 );\n            break;\n#if defined(_WIN32)\n        case DATATYPE_I8: \n            hal_snprintf( result, ARRAYSIZE(result), \"%I64d\",(CLR_INT64_TEMP_CAST)value->NumericByRef().s8 ); \n            break;\n        case DATATYPE_U8:\n            hal_snprintf( result, ARRAYSIZE(result), \"%I64u\",(CLR_UINT64_TEMP_CAST)value->NumericByRef().u8 ); \n            break;\n#else\n        case DATATYPE_I8: \n            {   \/\/ use local 64 bit variable to assure 8-byte boundary.\n                signed __int64 i64 = (CLR_INT64_TEMP_CAST)value->NumericByRef().s8;\n                hal_snprintf( result, ARRAYSIZE(result), \"%.*ld\", precision, i64); \n            }\n            break;\n        case DATATYPE_U8: \n            {   \/\/ use local 64 bit variable to assure 8-byte boundary.\n                unsigned __int64 ui64 = (CLR_UINT64_TEMP_CAST)value->NumericByRef().u8;\n                hal_snprintf( result, ARRAYSIZE(result), \"%.*lu\", precision, ui64 ); \n            }\n            break;\n#endif\n        case DATATYPE_R4:\n        case DATATYPE_R8:\n            {\n                \/\/ All the formatCh have been converted to upper case in the managed layer\n                _ASSERTE(formatCh == 'G' || formatCh == 'N' || formatCh == 'F' || formatCh == 'D');\n\n                if (precision < 0 || precision > 99) \n                {\n                    NANOCLR_SET_AND_LEAVE( CLR_E_INVALID_PARAMETER );\n                }\n\n                if (formatCh == 'G') \n                {\n                    hal_snprintf( formatStr, ARRAYSIZE(formatStr), \"%%.%dg\", (dt == DATATYPE_R4) ? 9 : 15 ); \/\/ \"%.9g\" for float, \"%.15g\" for double\n                }\n                else\n                {\n                    hal_snprintf( formatStr, ARRAYSIZE(formatStr), \"%%.%df\", precision ); \/\/ i.e. \"%#.2f\" when precision is 2\n                }\n\n                if(dt == DATATYPE_R4)\n                {\n#if defined(_WIN32) || defined(WIN32) || defined(_WIN32_WCE)\n                    hal_snprintf( result, ARRAYSIZE(result), formatStr, value->NumericByRef().r4 );\n#else\n\n#if !defined(NANOCLR_EMULATED_FLOATINGPOINT)\n                    float f = value->NumericByRef().r4;\n                    hal_snprintf_float( result, ARRAYSIZE(result), formatStr, f); \n#else\n                    CLR_INT32 f = value->NumericByRef().r4;\n                    hal_snprintf_float( result, ARRAYSIZE(result), formatStr, f); \n#endif\n\n#endif\n                }\n                else\n                {\n#if defined(_WIN32) || defined(WIN32) || defined(_WIN32_WCE)\n                    hal_snprintf( result, ARRAYSIZE(result), formatStr, (CLR_DOUBLE_TEMP_CAST)value->NumericByRef().r8 );\n#else\n#if !defined(NANOCLR_EMULATED_FLOATINGPOINT)\n                    double d = (CLR_DOUBLE_TEMP_CAST)value->NumericByRef().r8;\n                    hal_snprintf_double( result, ARRAYSIZE(result), formatStr, d ); \n\n#else\n                    CLR_INT64 d = (CLR_DOUBLE_TEMP_CAST)value->NumericByRef().r8;\n                    hal_snprintf_double( result, ARRAYSIZE(result), formatStr, d ); \n#endif\n\n#endif                \n                }\n            }\n            break;\n        default:\n            NANOCLR_SET_AND_LEAVE(CLR_E_FAIL);\n        }\n    }\n\n    NANOCLR_SET_AND_LEAVE(stack.SetResult_String( result ));\n\n    NANOCLR_NOCLEANUP();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/-----------------------------------------------------------------------bl-\n\/\/--------------------------------------------------------------------------\n\/\/ \n\/\/ GRINS - General Reacting Incompressible Navier-Stokes \n\/\/\n\/\/ Copyright (C) 2010-2012 The PECOS Development Team\n\/\/\n\/\/ This program is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the Version 2 GNU General\n\/\/ Public License 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 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 library; if not, write to the Free Software\n\/\/ Foundation, Inc. 51 Franklin Street, Fifth Floor, Boston, MA\n\/\/ 02110-1301 USA\n\/\/\n\/\/-----------------------------------------------------------------------el-\n\/\/\n\/\/ $Id:$\n\/\/\n\/\/--------------------------------------------------------------------------\n\/\/--------------------------------------------------------------------------\n\n#include \"config.h\"\n\n#include <iostream>\n\n\/\/ GRINS\n#include \"simulation.h\"\n#include \"multiphysics_sys.h\"\n#include \"parabolic_profile.h\"\n\n\/\/libMesh\n#include \"exact_solution.h\"\n\n\/\/ GRVY\n#ifdef HAVE_GRVY\n#include \"grvy.h\"\n#endif\n\nint main(int argc, char* argv[]) \n{\n\n#ifdef USE_GRVY_TIMERS\n  GRVY::GRVY_Timer_Class grvy_timer;\n  grvy_timer.Init(\"GRINS Timer\");\n#endif\n\n  \/\/ Check command line count.\n  if( argc < 2 )\n    {\n      \/\/ TODO: Need more consistent error handling.\n      std::cerr << \"Error: Must specify libMesh input file.\" << std::endl;\n      exit(1); \/\/ TODO: something more sophisticated for parallel runs?\n    }\n\n  \/\/ libMesh input file should be first argument\n  std::string libMesh_input_filename = argv[1];\n  \n  \/\/ Create our GetPot object.\n  GetPot libMesh_inputfile( libMesh_input_filename );\n\n#ifdef USE_GRVY_TIMERS\n  grvy_timer.BeginTimer(\"Initialize Solver\");\n#endif\n\n  \/\/ Initialize libMesh library.\n  LibMeshInit libmesh_init(argc, argv);\n \n  GRINS::SimulationBuilder sim_builder;\n\n  GRINS::Simulation grins( libMesh_inputfile,\n\t\t\t   sim_builder );\n\n#ifdef USE_GRVY_TIMERS\n  grvy_timer.EndTimer(\"Initialize Solver\");\n\n  \/\/ Attach GRVY timer to solver\n  grins.attach_grvy_timer( &grvy_timer );\n#endif\n\n  \/\/ Solve\n  grins.run();\n\n  Number qoi = grins.get_qoi( 0 );\n\n  int return_flag = 0;\n  const Number exact_value = -0.5;\n  const Number rel_error = std::fabs( (qoi - exact_value )\/exact_value );\n  const Number tol = 1.0e-15;\n  if( rel_error > tol )\n    {\n      std::cerr << \"Computed voriticity QoI mismatch greater than tolerance.\" << std::endl\n\t\t<< \"Computed value = \" << qoi << std::endl\n\t\t<< \"Exact value = \" << exact_value << std::endl\n\t\t<< \"Relative error = \" << rel_error << std::endl\n\t\t<< \"Tolerance = \" << tol << std::endl;\n      return_flag = 1;\n    }\n\n  return return_flag;\n}\n<commit_msg>[GRINS]: propset Id<commit_after>\/\/-----------------------------------------------------------------------bl-\n\/\/--------------------------------------------------------------------------\n\/\/ \n\/\/ GRINS - General Reacting Incompressible Navier-Stokes \n\/\/\n\/\/ Copyright (C) 2010-2012 The PECOS Development Team\n\/\/\n\/\/ This program is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the Version 2 GNU General\n\/\/ Public License 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 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 library; if not, write to the Free Software\n\/\/ Foundation, Inc. 51 Franklin Street, Fifth Floor, Boston, MA\n\/\/ 02110-1301 USA\n\/\/\n\/\/-----------------------------------------------------------------------el-\n\/\/\n\/\/ $Id$\n\/\/\n\/\/--------------------------------------------------------------------------\n\/\/--------------------------------------------------------------------------\n\n#include \"config.h\"\n\n#include <iostream>\n\n\/\/ GRINS\n#include \"simulation.h\"\n#include \"multiphysics_sys.h\"\n#include \"parabolic_profile.h\"\n\n\/\/libMesh\n#include \"exact_solution.h\"\n\n\/\/ GRVY\n#ifdef HAVE_GRVY\n#include \"grvy.h\"\n#endif\n\nint main(int argc, char* argv[]) \n{\n\n#ifdef USE_GRVY_TIMERS\n  GRVY::GRVY_Timer_Class grvy_timer;\n  grvy_timer.Init(\"GRINS Timer\");\n#endif\n\n  \/\/ Check command line count.\n  if( argc < 2 )\n    {\n      \/\/ TODO: Need more consistent error handling.\n      std::cerr << \"Error: Must specify libMesh input file.\" << std::endl;\n      exit(1); \/\/ TODO: something more sophisticated for parallel runs?\n    }\n\n  \/\/ libMesh input file should be first argument\n  std::string libMesh_input_filename = argv[1];\n  \n  \/\/ Create our GetPot object.\n  GetPot libMesh_inputfile( libMesh_input_filename );\n\n#ifdef USE_GRVY_TIMERS\n  grvy_timer.BeginTimer(\"Initialize Solver\");\n#endif\n\n  \/\/ Initialize libMesh library.\n  LibMeshInit libmesh_init(argc, argv);\n \n  GRINS::SimulationBuilder sim_builder;\n\n  GRINS::Simulation grins( libMesh_inputfile,\n\t\t\t   sim_builder );\n\n#ifdef USE_GRVY_TIMERS\n  grvy_timer.EndTimer(\"Initialize Solver\");\n\n  \/\/ Attach GRVY timer to solver\n  grins.attach_grvy_timer( &grvy_timer );\n#endif\n\n  \/\/ Solve\n  grins.run();\n\n  Number qoi = grins.get_qoi( 0 );\n\n  int return_flag = 0;\n  const Number exact_value = -0.5;\n  const Number rel_error = std::fabs( (qoi - exact_value )\/exact_value );\n  const Number tol = 1.0e-15;\n  if( rel_error > tol )\n    {\n      std::cerr << \"Computed voriticity QoI mismatch greater than tolerance.\" << std::endl\n\t\t<< \"Computed value = \" << qoi << std::endl\n\t\t<< \"Exact value = \" << exact_value << std::endl\n\t\t<< \"Relative error = \" << rel_error << std::endl\n\t\t<< \"Tolerance = \" << tol << std::endl;\n      return_flag = 1;\n    }\n\n  return return_flag;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <cmath>\n#include <unistd.h>\n#include <iostream>\n#include <sstream>\n\n#define NX 50\n#define NY 50\n#define NZ 50\n\n#define SX 34\n#define SY 34\n#define SZ 34\n\n#define T_MAX 1000\n\ntypedef double Real;\n\nconst Real Fu = 1.0\/86400, Fv = 6.0\/86400, Fe = 1.0\/900, Du = 0.1*2.3e-9, Dv = 12.2e-11;\nconst Real dt = 0*200, dx = 0.001;\n\nReal U[NX][NY][NZ], V[NX][NY][NZ];\nReal U_other[NX][NY][NZ], V_other[NX][NY][NZ];\nint global_clock;\n\n\nReal Uwx[T_MAX][2][SY][SZ], Uwy[T_MAX][SX][2][SZ], Uwz[T_MAX][SX][SY][2];\nReal Vwx[T_MAX][2][SY][SZ], Vwy[T_MAX][SX][2][SZ], Vwz[T_MAX][SX][SY][2];\n\nReal sU0[SX][SY][SZ], sV0[SX][SY][SZ];\nReal sU[SX][SY][SZ], sV[SX][SY][SZ];\nReal sU_1[SX][SY][SZ], sV_1[SX][SY][SZ];\n\n\nvoid fill_initial_condition() {\n  global_clock=0;\n  for (int x=0;x<NX;++x) {\n    for (int y=0;y<NY;++y) {\n      for (int z=0;z<NZ;++z) {\n        U[x][y][z] = 1;\n        V[x][y][z] = 0;\n      }\n    }\n  }\n  int bx = std::max(NX\/4,NX\/2-8),  ex = std::min(3*NX\/4+1,NX\/2+8);\n  int by = std::max(NY\/4,NY\/2-8),  ey = std::min(3*NY\/4+1,NY\/2+8);\n  int bz = std::max(NZ\/4,NZ\/2-8),  ez = std::min(3*NZ\/4+1,NZ\/2+8);\n  for (int x=bx;x<ex;++x){\n    for (int y=by;y<ey;++y){\n      for (int z=bz;z<ez;++z){\n        U[x][y][z] = 0.5;\n        V[x][y][z] = 0.25+0.1*sin(x+sqrt(y)+cos(z));\n      }\n    }\n  }\n}\n\n\ninline Real periodic(Real ar[NX][NY][NZ],int x, int y, int z) {\n    x = ((x+100*NX)%NX+NX)%NX;\n    y = ((y+100*NY)%NY+NY)%NY;\n    z = ((z+100*NZ)%NZ+NZ)%NZ;\n    \/\/x = (x+NX)%NX;\n    \/\/y = (y+NY)%NY;\n    \/\/z = (z+NZ)%NZ;\n  return ar[x][y][z];\n}\n\n\nvoid naive_proceed() {\n  ++global_clock;\n\n  auto lap = [](Real ar[NX][NY][NZ],int x, int y, int z) {\n    auto ret = periodic(ar, x-1, y, z) + periodic(ar, x+1, y, z)\n    + periodic(ar, x, y-1, z) + periodic(ar, x, y+1, z)\n    + periodic(ar, x, y, z-1) + periodic(ar, x, y, z+1)\n    - 6*ar[x][y][z];\n    return ret \/ dx \/ dx;\n  };\n\n#pragma omp parallel for collapse(2)\n  for (int x=0;x<NX;++x) {\n    for (int y=0;y<NY;++y) {\n      for (int z=0;z<NZ;++z) {\n        auto u = U[x][y][z],  v = V[x][y][z];\n        auto du_dt = -Fe * u*v*v + Fu*(1-u) + Du * lap(U,x,y,z);\n        auto dv_dt =  Fe * u*v*v - Fv*v     + Dv * lap(V,x,y,z);\n        U_other[x][y][z] = U[x][y][z] + dt*du_dt;\n        V_other[x][y][z] = V[x][y][z] + dt*dv_dt;\n      }\n    }\n  }\n\n  for (int x=0;x<NX;++x) {\n    for (int y=0;y<NY;++y) {\n      for (int z=0;z<NZ;++z) {\n        U[x][y][z]=U_other[x][y][z];\n      }\n    }\n  }\n  for (int x=0;x<NX;++x) {\n    for (int y=0;y<NY;++y) {\n      for (int z=0;z<NZ;++z) {\n        V[x][y][z]=V_other[x][y][z];\n      }\n    }\n  }\n}\n\nvoid get_solution_at(int t, int x, int y, int z, Real &u, Real &v) {\n  if(global_clock > t) fill_initial_condition();\n  while(global_clock < t) naive_proceed();\n  u = periodic(U,x,y,z);\n  v = periodic(V,x,y,z);\n}\n\nint main () {\n\n  fill_initial_condition();\n  for(int x=0;x<SX;++x) {\n    for(int y=0;y<SY;++y) {\n      for(int z=0;z<SZ;++z) {\n        double u,v; get_solution_at(0,x,y,z, u,v);\n        sU0[x][y][z]=u;\n        sV0[x][y][z]=v;\n      }\n    }\n  }\n\n  std::cerr << \"Setting up wall values...\" << std::endl;\n  for(int t = 0;t<T_MAX;++t){\n    for(int x=SX-2;x<SX;++x) {\n      for(int y=0;y<SY;++y) {\n        for(int z=0;z<SZ;++z) {\n          double u,v; get_solution_at(t,x+t,y+t,z+t, u,v);\n          Uwx[t][x-(SX-2)][y][z] = u;\n          Vwx[t][x-(SX-2)][y][z] = v;\n        }\n      }\n    }\n\n    for(int x=0;x<SX;++x) {\n      for(int y=SY-2;y<SY;++y) {\n        for(int z=0;z<SZ;++z) {\n          double u,v; get_solution_at(t,x+t,y+t,z+t, u,v);\n          Uwy[t][x][y-(SY-2)][z] = u;\n          Vwy[t][x][y-(SY-2)][z] = v;\n        }\n      }\n    }\n\n    for(int x=0;x<SX;++x) {\n      for(int y=0;y<SY;++y) {\n        for(int z=SZ-2;z<SZ;++z) {\n          double u,v; get_solution_at(t,x+t,y+t,z+t, u,v);\n          Uwz[t][x][y][z-(SZ-2)] = u;\n          Vwz[t][x][y][z-(SZ-2)] = v;\n        }\n      }\n    }\n  }\n\n\n  std::cerr << \"Carrying out simulation...\" << std::endl;\n  \/\/ set initial condition\n  for(int x=0;x<SX;++x) {\n    for(int y=0;y<SY;++y) {\n      for(int z=0;z<SZ;++z) {\n        sU[x][y][z]=sU0[x][y][z];\n        sV[x][y][z]=sV0[x][y][z];\n      }\n    }\n  }\n\n  for(int t = 0; t < T_MAX; ++t){\n    \/\/ load communication values\n#pragma omp parallel for collapse(3)\n    for(int x=SX-2;x<SX;++x) {\n      for(int y=0;y<SY;++y) {\n        for(int z=0;z<SZ;++z) {\n          sU[x][y][z] = Uwx[t][x-(SX-2)][y][z];\n          sV[x][y][z] = Vwx[t][x-(SX-2)][y][z];\n        }\n      }\n    }\n\n#pragma omp parallel for collapse(3)\n    for(int x=0;x<SX-2;++x) {\n      for(int y=SY-2;y<SY;++y) {\n        for(int z=0;z<SZ;++z) {\n          sU[x][y][z] = Uwy[t][x][y-(SY-2)][z];\n          sV[x][y][z] = Vwy[t][x][y-(SY-2)][z];\n        }\n      }\n    }\n\n#pragma omp parallel for collapse(3)\n    for(int x=0;x<SX-2;++x) {\n      for(int y=0;y<SY-2;++y) {\n        for(int z=SZ-2;z<SZ;++z) {\n          sU[x][y][z] = Uwz[t][x][y][z-(SZ-2)];\n          sV[x][y][z] = Vwz[t][x][y][z-(SZ-2)];\n        }\n      }\n    }\n\n\n\n    \/\/ destructively update the state\n    const auto lap = [](Real ar[SX][SY][SZ],int x, int y, int z) {\n      auto ret = ar[x][y+1][z+1] + ar[x+2][y+1][z+1]\n      + ar[x+1][y][z+1] + ar[x+1][y+2][z+1]\n      + ar[x+1][y+1][z] + ar[x+1][y+1][z+2]\n      - 6*ar[x+1][y+1][z+1];\n      return ret \/ dx \/ dx;\n    };\n\n#pragma omp parallel for collapse(2)\n    for(int x=0;x<SX-2;++x) {\n      for(int y=0;y<SY-2;++y) {\n        for(int z=0;z<SZ-2;++z) {\n          Real u=sU[x+1][y+1][z+1] ;\n          Real v=sV[x+1][y+1][z+1] ;\n\n          auto du_dt = -Fe * u*v*v + Fu*(1-u) + Du * lap(sU,x,y,z);\n          auto dv_dt =  Fe * u*v*v - Fv*v     + Dv * lap(sV,x,y,z);\n          sU_1[x][y][z] = u+dt*du_dt;\n          sV_1[x][y][z] = v+dt*dv_dt;\n        }\n      }\n    }\n#pragma omp parallel for collapse(2)\n    for(int x=0;x<SX-2;++x) {\n      for(int y=0;y<SY-2;++y) {\n        for(int z=0;z<SZ-2;++z) {\n          sU[x][y][z] = sU_1[x][y][z];\n          sV[x][y][z] = sV_1[x][y][z];\n        }\n      }\n    }\n  }\n\n  {\n    const int t = T_MAX;\n    double num=0,den=0;\n    for(int x=0;x<SX-2;++x) {\n      for(int y=0;y<SY-2;++y) {\n        for(int z=0;z<SZ-2;++z) {\n          double u,v; get_solution_at(t,x+t,y+t,z+t, u,v);\n          num += std::abs(u-sU[x][y][z]);\n          den += 1;\n        }\n      }\n    }\n    std::cout << \"average error: \" << (num\/den) << std::endl;\n  }\n\n}\n<commit_msg>Add logging for benchmark<commit_after>#include <cmath>\n#include <unistd.h>\n#include <fstream>\n#include <iostream>\n#include <sstream>\n#include <sys\/time.h>\n\n#define NX 50\n#define NY 50\n#define NZ 50\n\n#define SX 34\n#define SY 34\n#define SZ 34\n\n#define T_MAX 3000\n\ntypedef double Real;\n\nconst Real Fu = 1.0\/86400, Fv = 6.0\/86400, Fe = 1.0\/900, Du = 0.1*2.3e-9, Dv = 12.2e-11;\nconst Real dt = 0*200, dx = 0.001;\n\nReal U[NX][NY][NZ], V[NX][NY][NZ];\nReal U_other[NX][NY][NZ], V_other[NX][NY][NZ];\nint global_clock;\n\n\nReal Uwx[T_MAX][2][SY][SZ], Uwy[T_MAX][SX][2][SZ], Uwz[T_MAX][SX][SY][2];\nReal Vwx[T_MAX][2][SY][SZ], Vwy[T_MAX][SX][2][SZ], Vwz[T_MAX][SX][SY][2];\n\nReal sU0[SX][SY][SZ], sV0[SX][SY][SZ];\nReal sU[SX][SY][SZ], sV[SX][SY][SZ];\nReal sU_1[SX][SY][SZ], sV_1[SX][SY][SZ];\n\ndouble wctime() {\n  struct timeval tv;\n  gettimeofday(&tv,NULL);\n  return (double)tv.tv_sec + (double)tv.tv_usec*1e-6;\n}\n\n\n\nvoid fill_initial_condition() {\n  global_clock=0;\n  for (int x=0;x<NX;++x) {\n    for (int y=0;y<NY;++y) {\n      for (int z=0;z<NZ;++z) {\n        U[x][y][z] = 1;\n        V[x][y][z] = 0;\n      }\n    }\n  }\n  int bx = std::max(NX\/4,NX\/2-8),  ex = std::min(3*NX\/4+1,NX\/2+8);\n  int by = std::max(NY\/4,NY\/2-8),  ey = std::min(3*NY\/4+1,NY\/2+8);\n  int bz = std::max(NZ\/4,NZ\/2-8),  ez = std::min(3*NZ\/4+1,NZ\/2+8);\n  for (int x=bx;x<ex;++x){\n    for (int y=by;y<ey;++y){\n      for (int z=bz;z<ez;++z){\n        U[x][y][z] = 0.5;\n        V[x][y][z] = 0.25+0.1*sin(x+sqrt(y)+cos(z));\n      }\n    }\n  }\n}\n\n\ninline Real periodic(Real ar[NX][NY][NZ],int x, int y, int z) {\n    x = ((x+100*NX)%NX+NX)%NX;\n    y = ((y+100*NY)%NY+NY)%NY;\n    z = ((z+100*NZ)%NZ+NZ)%NZ;\n    \/\/x = (x+NX)%NX;\n    \/\/y = (y+NY)%NY;\n    \/\/z = (z+NZ)%NZ;\n  return ar[x][y][z];\n}\n\n\nvoid naive_proceed() {\n  ++global_clock;\n\n  auto lap = [](Real ar[NX][NY][NZ],int x, int y, int z) {\n    auto ret = periodic(ar, x-1, y, z) + periodic(ar, x+1, y, z)\n    + periodic(ar, x, y-1, z) + periodic(ar, x, y+1, z)\n    + periodic(ar, x, y, z-1) + periodic(ar, x, y, z+1)\n    - 6*ar[x][y][z];\n    return ret \/ dx \/ dx;\n  };\n\n#pragma omp parallel for collapse(2)\n  for (int x=0;x<NX;++x) {\n    for (int y=0;y<NY;++y) {\n      for (int z=0;z<NZ;++z) {\n        auto u = U[x][y][z],  v = V[x][y][z];\n        auto du_dt = -Fe * u*v*v + Fu*(1-u) + Du * lap(U,x,y,z);\n        auto dv_dt =  Fe * u*v*v - Fv*v     + Dv * lap(V,x,y,z);\n        U_other[x][y][z] = U[x][y][z] + dt*du_dt;\n        V_other[x][y][z] = V[x][y][z] + dt*dv_dt;\n      }\n    }\n  }\n\n  for (int x=0;x<NX;++x) {\n    for (int y=0;y<NY;++y) {\n      for (int z=0;z<NZ;++z) {\n        U[x][y][z]=U_other[x][y][z];\n      }\n    }\n  }\n  for (int x=0;x<NX;++x) {\n    for (int y=0;y<NY;++y) {\n      for (int z=0;z<NZ;++z) {\n        V[x][y][z]=V_other[x][y][z];\n      }\n    }\n  }\n}\n\nvoid get_solution_at(int t, int x, int y, int z, Real &u, Real &v) {\n  if(global_clock > t) fill_initial_condition();\n  while(global_clock < t) naive_proceed();\n  u = periodic(U,x,y,z);\n  v = periodic(V,x,y,z);\n}\n\nint main () {\n\n  fill_initial_condition();\n  for(int x=0;x<SX;++x) {\n    for(int y=0;y<SY;++y) {\n      for(int z=0;z<SZ;++z) {\n        double u,v; get_solution_at(0,x,y,z, u,v);\n        sU0[x][y][z]=u;\n        sV0[x][y][z]=v;\n      }\n    }\n  }\n\n  std::cerr << \"Setting up wall values...\" << std::endl;\n  for(int t = 0;t<T_MAX;++t){\n    for(int x=SX-2;x<SX;++x) {\n      for(int y=0;y<SY;++y) {\n        for(int z=0;z<SZ;++z) {\n          double u,v; get_solution_at(t,x+t,y+t,z+t, u,v);\n          Uwx[t][x-(SX-2)][y][z] = u;\n          Vwx[t][x-(SX-2)][y][z] = v;\n        }\n      }\n    }\n\n    for(int x=0;x<SX;++x) {\n      for(int y=SY-2;y<SY;++y) {\n        for(int z=0;z<SZ;++z) {\n          double u,v; get_solution_at(t,x+t,y+t,z+t, u,v);\n          Uwy[t][x][y-(SY-2)][z] = u;\n          Vwy[t][x][y-(SY-2)][z] = v;\n        }\n      }\n    }\n\n    for(int x=0;x<SX;++x) {\n      for(int y=0;y<SY;++y) {\n        for(int z=SZ-2;z<SZ;++z) {\n          double u,v; get_solution_at(t,x+t,y+t,z+t, u,v);\n          Uwz[t][x][y][z-(SZ-2)] = u;\n          Vwz[t][x][y][z-(SZ-2)] = v;\n        }\n      }\n    }\n  }\n\n\n  for(int trial=0;trial<10;++trial) {\n  std::cerr << \"Carrying out simulation...\" << std::endl;\n  \/\/ set initial condition\n  for(int x=0;x<SX;++x) {\n    for(int y=0;y<SY;++y) {\n      for(int z=0;z<SZ;++z) {\n        sU[x][y][z]=sU0[x][y][z];\n        sV[x][y][z]=sV0[x][y][z];\n      }\n    }\n  }\n\n  double time_begin = wctime();\n  for(int t = 0; t < T_MAX; ++t){\n    \/\/ load communication values\n#pragma omp parallel for collapse(3)\n    for(int x=SX-2;x<SX;++x) {\n      for(int y=0;y<SY;++y) {\n        for(int z=0;z<SZ;++z) {\n          sU[x][y][z] = Uwx[t][x-(SX-2)][y][z];\n          sV[x][y][z] = Vwx[t][x-(SX-2)][y][z];\n        }\n      }\n    }\n\n#pragma omp parallel for collapse(3)\n    for(int x=0;x<SX-2;++x) {\n      for(int y=SY-2;y<SY;++y) {\n        for(int z=0;z<SZ;++z) {\n          sU[x][y][z] = Uwy[t][x][y-(SY-2)][z];\n          sV[x][y][z] = Vwy[t][x][y-(SY-2)][z];\n        }\n      }\n    }\n\n#pragma omp parallel for collapse(3)\n    for(int x=0;x<SX-2;++x) {\n      for(int y=0;y<SY-2;++y) {\n        for(int z=SZ-2;z<SZ;++z) {\n          sU[x][y][z] = Uwz[t][x][y][z-(SZ-2)];\n          sV[x][y][z] = Vwz[t][x][y][z-(SZ-2)];\n        }\n      }\n    }\n\n\n\n    \/\/ destructively update the state\n    const auto lap = [](Real ar[SX][SY][SZ],int x, int y, int z) {\n      auto ret = ar[x][y+1][z+1] + ar[x+2][y+1][z+1]\n      + ar[x+1][y][z+1] + ar[x+1][y+2][z+1]\n      + ar[x+1][y+1][z] + ar[x+1][y+1][z+2]\n      - 6*ar[x+1][y+1][z+1];\n      return ret \/ dx \/ dx;\n    };\n\n#pragma omp parallel for collapse(2)\n    for(int x=0;x<SX-2;++x) {\n      for(int y=0;y<SY-2;++y) {\n        for(int z=0;z<SZ-2;++z) {\n          Real u=sU[x+1][y+1][z+1] ;\n          Real v=sV[x+1][y+1][z+1] ;\n\n          auto du_dt = -Fe * u*v*v + Fu*(1-u) + Du * lap(sU,x,y,z);\n          auto dv_dt =  Fe * u*v*v - Fv*v     + Dv * lap(sV,x,y,z);\n          sU_1[x][y][z] = u+dt*du_dt;\n          sV_1[x][y][z] = v+dt*dv_dt;\n        }\n      }\n    }\n#pragma omp parallel for collapse(2)\n    for(int x=0;x<SX-2;++x) {\n      for(int y=0;y<SY-2;++y) {\n        for(int z=0;z<SZ-2;++z) {\n          sU[x][y][z] = sU_1[x][y][z];\n          sV[x][y][z] = sV_1[x][y][z];\n        }\n      }\n    }\n  }\n  double time_end = wctime();\n\n  double flop = 29.0 * (SX-2)*(SY-2)*(SZ-2) *T_MAX;\n  double time_elapse = time_end-time_begin;\n\n  {\n    const int t = T_MAX;\n    double num=0,den=0;\n    for(int x=0;x<SX-2;++x) {\n      for(int y=0;y<SY-2;++y) {\n        for(int z=0;z<SZ-2;++z) {\n          double u,v; get_solution_at(t,x+t,y+t,z+t, u,v);\n          num += std::abs(u-sU[x][y][z]);\n          den += 1;\n        }\n      }\n    }\n    std::ostringstream msg;\n    msg << SX << \" \" << SY << \" \" << SZ << \" \" << T_MAX << \" \"\n        << \" t: \" << time_elapse << \" GFlops: \" << flop\/time_elapse\/1e9<< \" error: \" << (num\/den);\n    std::ofstream log_file(\"benchmark.txt\", std::ios::app);\n    std::cout << msg.str() << std::endl;\n    log_file << msg.str() << std::endl;\n  }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: lzwdecom.cxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: hr $ $Date: 2006-06-19 21:49: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#include \"lzwdecom.hxx\"\n\nLZWDecompressor::LZWDecompressor()\n{\n    USHORT i;\n\n    pTable=new LZWTableEntry[4096];\n    pOutBuf=new BYTE[4096];\n    for (i=0; i<4096; i++)\n    {\n        pTable[i].nPrevCode=0;\n        pTable[i].nDataCount=1;\n        pTable[i].nData=(BYTE)i;\n    }\n    pIStream=NULL;\n    bFirst = TRUE;\n    nOldCode = 0;\n}\n\n\nLZWDecompressor::~LZWDecompressor()\n{\n    delete[] pOutBuf;\n    delete[] pTable;\n}\n\n\nvoid LZWDecompressor::StartDecompression(SvStream & rIStream)\n{\n    pIStream=&rIStream;\n\n    nTableSize=258;\n\n    bEOIFound=FALSE;\n\n    nOutBufDataLen=0;\n\n    *pIStream >> nInputBitsBuf;\n\n    nInputBitsBufSize=8;\n\n    if ( bFirst )\n    {\n        bInvert = nInputBitsBuf == 1;\n        bFirst = FALSE;\n    }\n\n    if ( bInvert )\n        nInputBitsBuf = ( ( nInputBitsBuf & 1 ) << 7 ) | ( ( nInputBitsBuf & 2 ) << 5 ) | ( ( nInputBitsBuf & 4 ) << 3 ) | ( ( nInputBitsBuf & 8 ) << 1 ) | ( ( nInputBitsBuf & 16 ) >> 1 ) | ( ( nInputBitsBuf & 32 ) >> 3 ) | ( ( nInputBitsBuf & 64 ) >> 5 ) | ( (nInputBitsBuf & 128 ) >> 7 );\n}\n\n\nULONG LZWDecompressor::Decompress(BYTE * pTarget, ULONG nMaxCount)\n{\n    ULONG nCount;\n\n    if (pIStream==NULL) return 0;\n\n    nCount=0;\n    for (;;) {\n\n        if (pIStream->GetError()) break;\n\n        if (((ULONG)nOutBufDataLen)>=nMaxCount) {\n            nOutBufDataLen-=(USHORT)nMaxCount;\n            nCount+=nMaxCount;\n            while (nMaxCount>0) {\n                *(pTarget++)=*(pOutBufData++);\n                nMaxCount--;\n            }\n            break;\n        }\n\n        nMaxCount-=(ULONG)nOutBufDataLen;\n        nCount+=nOutBufDataLen;\n        while (nOutBufDataLen>0) {\n            *(pTarget++)=*(pOutBufData++);\n            nOutBufDataLen--;\n        }\n\n        if (bEOIFound==TRUE) break;\n\n        DecompressSome();\n\n    }\n\n    return nCount;\n}\n\n\nUSHORT LZWDecompressor::GetNextCode()\n{\n    USHORT nBits,nCode;\n\n    if      (nTableSize<511)  nBits=9;\n    else if (nTableSize<1023) nBits=10;\n    else if (nTableSize<2047) nBits=11;\n    else                      nBits=12;\n\n    nCode=0;\n    do {\n        if (nInputBitsBufSize<=nBits)\n        {\n            nCode=(nCode<<nInputBitsBufSize) | nInputBitsBuf;\n            nBits-=nInputBitsBufSize;\n            *pIStream >> nInputBitsBuf;\n            if ( bInvert )\n                nInputBitsBuf = ( ( nInputBitsBuf & 1 ) << 7 ) | ( ( nInputBitsBuf & 2 ) << 5 ) | ( ( nInputBitsBuf & 4 ) << 3 ) | ( ( nInputBitsBuf & 8 ) << 1 ) | ( ( nInputBitsBuf & 16 ) >> 1 ) | ( ( nInputBitsBuf & 32 ) >> 3 ) | ( ( nInputBitsBuf & 64 ) >> 5 ) | ( (nInputBitsBuf & 128 ) >> 7 );\n            nInputBitsBufSize=8;\n        }\n        else\n        {\n            nCode=(nCode<<nBits) | (nInputBitsBuf>>(nInputBitsBufSize-nBits));\n            nInputBitsBufSize-=nBits;\n            nInputBitsBuf&=0x00ff>>(8-nInputBitsBufSize);\n            nBits=0;\n        }\n    } while (nBits>0);\n\n    return nCode;\n}\n\n\nvoid LZWDecompressor::AddToTable(USHORT nPrevCode, USHORT nCodeFirstData)\n{\n    while (pTable[nCodeFirstData].nDataCount>1)\n        nCodeFirstData=pTable[nCodeFirstData].nPrevCode;\n\n    pTable[nTableSize].nPrevCode=nPrevCode;\n    pTable[nTableSize].nDataCount=pTable[nPrevCode].nDataCount+1;\n    pTable[nTableSize].nData=pTable[nCodeFirstData].nData;\n\n    nTableSize++;\n}\n\n\nvoid LZWDecompressor::DecompressSome()\n{\n    USHORT i,nCode;\n\n    nCode=GetNextCode();\n    if (nCode==256) {\n        nTableSize=258;\n        nCode=GetNextCode();\n        if (nCode==257) { bEOIFound=TRUE; return; }\n    }\n    else if (nCode<nTableSize) AddToTable(nOldCode,nCode);\n    else if (nCode==nTableSize) AddToTable(nOldCode,nOldCode);\n    else { bEOIFound=TRUE; return; }\n\n    nOldCode=nCode;\n\n    nOutBufDataLen=pTable[nCode].nDataCount;\n    pOutBufData=pOutBuf+nOutBufDataLen;\n    for (i=0; i<nOutBufDataLen; i++) {\n        *(--pOutBufData)=pTable[nCode].nData;\n        nCode=pTable[nCode].nPrevCode;\n    }\n}\n\n\n\n<commit_msg>INTEGRATION: CWS pchfix02 (1.4.26); FILE MERGED 2006\/09\/01 17:30:14 kaib 1.4.26.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: lzwdecom.cxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 15:53:31 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_goodies.hxx\"\n\n#include \"lzwdecom.hxx\"\n\nLZWDecompressor::LZWDecompressor()\n{\n    USHORT i;\n\n    pTable=new LZWTableEntry[4096];\n    pOutBuf=new BYTE[4096];\n    for (i=0; i<4096; i++)\n    {\n        pTable[i].nPrevCode=0;\n        pTable[i].nDataCount=1;\n        pTable[i].nData=(BYTE)i;\n    }\n    pIStream=NULL;\n    bFirst = TRUE;\n    nOldCode = 0;\n}\n\n\nLZWDecompressor::~LZWDecompressor()\n{\n    delete[] pOutBuf;\n    delete[] pTable;\n}\n\n\nvoid LZWDecompressor::StartDecompression(SvStream & rIStream)\n{\n    pIStream=&rIStream;\n\n    nTableSize=258;\n\n    bEOIFound=FALSE;\n\n    nOutBufDataLen=0;\n\n    *pIStream >> nInputBitsBuf;\n\n    nInputBitsBufSize=8;\n\n    if ( bFirst )\n    {\n        bInvert = nInputBitsBuf == 1;\n        bFirst = FALSE;\n    }\n\n    if ( bInvert )\n        nInputBitsBuf = ( ( nInputBitsBuf & 1 ) << 7 ) | ( ( nInputBitsBuf & 2 ) << 5 ) | ( ( nInputBitsBuf & 4 ) << 3 ) | ( ( nInputBitsBuf & 8 ) << 1 ) | ( ( nInputBitsBuf & 16 ) >> 1 ) | ( ( nInputBitsBuf & 32 ) >> 3 ) | ( ( nInputBitsBuf & 64 ) >> 5 ) | ( (nInputBitsBuf & 128 ) >> 7 );\n}\n\n\nULONG LZWDecompressor::Decompress(BYTE * pTarget, ULONG nMaxCount)\n{\n    ULONG nCount;\n\n    if (pIStream==NULL) return 0;\n\n    nCount=0;\n    for (;;) {\n\n        if (pIStream->GetError()) break;\n\n        if (((ULONG)nOutBufDataLen)>=nMaxCount) {\n            nOutBufDataLen-=(USHORT)nMaxCount;\n            nCount+=nMaxCount;\n            while (nMaxCount>0) {\n                *(pTarget++)=*(pOutBufData++);\n                nMaxCount--;\n            }\n            break;\n        }\n\n        nMaxCount-=(ULONG)nOutBufDataLen;\n        nCount+=nOutBufDataLen;\n        while (nOutBufDataLen>0) {\n            *(pTarget++)=*(pOutBufData++);\n            nOutBufDataLen--;\n        }\n\n        if (bEOIFound==TRUE) break;\n\n        DecompressSome();\n\n    }\n\n    return nCount;\n}\n\n\nUSHORT LZWDecompressor::GetNextCode()\n{\n    USHORT nBits,nCode;\n\n    if      (nTableSize<511)  nBits=9;\n    else if (nTableSize<1023) nBits=10;\n    else if (nTableSize<2047) nBits=11;\n    else                      nBits=12;\n\n    nCode=0;\n    do {\n        if (nInputBitsBufSize<=nBits)\n        {\n            nCode=(nCode<<nInputBitsBufSize) | nInputBitsBuf;\n            nBits-=nInputBitsBufSize;\n            *pIStream >> nInputBitsBuf;\n            if ( bInvert )\n                nInputBitsBuf = ( ( nInputBitsBuf & 1 ) << 7 ) | ( ( nInputBitsBuf & 2 ) << 5 ) | ( ( nInputBitsBuf & 4 ) << 3 ) | ( ( nInputBitsBuf & 8 ) << 1 ) | ( ( nInputBitsBuf & 16 ) >> 1 ) | ( ( nInputBitsBuf & 32 ) >> 3 ) | ( ( nInputBitsBuf & 64 ) >> 5 ) | ( (nInputBitsBuf & 128 ) >> 7 );\n            nInputBitsBufSize=8;\n        }\n        else\n        {\n            nCode=(nCode<<nBits) | (nInputBitsBuf>>(nInputBitsBufSize-nBits));\n            nInputBitsBufSize-=nBits;\n            nInputBitsBuf&=0x00ff>>(8-nInputBitsBufSize);\n            nBits=0;\n        }\n    } while (nBits>0);\n\n    return nCode;\n}\n\n\nvoid LZWDecompressor::AddToTable(USHORT nPrevCode, USHORT nCodeFirstData)\n{\n    while (pTable[nCodeFirstData].nDataCount>1)\n        nCodeFirstData=pTable[nCodeFirstData].nPrevCode;\n\n    pTable[nTableSize].nPrevCode=nPrevCode;\n    pTable[nTableSize].nDataCount=pTable[nPrevCode].nDataCount+1;\n    pTable[nTableSize].nData=pTable[nCodeFirstData].nData;\n\n    nTableSize++;\n}\n\n\nvoid LZWDecompressor::DecompressSome()\n{\n    USHORT i,nCode;\n\n    nCode=GetNextCode();\n    if (nCode==256) {\n        nTableSize=258;\n        nCode=GetNextCode();\n        if (nCode==257) { bEOIFound=TRUE; return; }\n    }\n    else if (nCode<nTableSize) AddToTable(nOldCode,nCode);\n    else if (nCode==nTableSize) AddToTable(nOldCode,nOldCode);\n    else { bEOIFound=TRUE; return; }\n\n    nOldCode=nCode;\n\n    nOutBufDataLen=pTable[nCode].nDataCount;\n    pOutBufData=pOutBuf+nOutBufDataLen;\n    for (i=0; i<nOutBufDataLen; i++) {\n        *(--pOutBufData)=pTable[nCode].nData;\n        nCode=pTable[nCode].nPrevCode;\n    }\n}\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2016 AUV-IITK\n#include <ros\/ros.h>\n#include <std_msgs\/Float64.h>\n#include <std_msgs\/Float32.h>\n#include <std_msgs\/Int32.h>\n#include <std_msgs\/String.h>\n#include <std_msgs\/Float64MultiArray.h>\n#include <std_msgs\/Bool.h>\n#include <actionlib\/server\/simple_action_server.h>\n#include <actionlib\/client\/simple_action_client.h>\n#include <actionlib\/client\/terminal_state.h>\n#include <task_commons\/lineAction.h>\n#include <motion_commons\/ForwardAction.h>\n#include <motion_commons\/SidewardAction.h>\n#include <motion_commons\/TurnAction.h>\n#include <motion_commons\/SidewardActionFeedback.h>\n#include <motion_commons\/ForwardActionFeedback.h>\n#include <motion_commons\/TurnActionFeedback.h>\n#include <motion_commons\/SidewardActionResult.h>\n#include <motion_commons\/ForwardActionResult.h>\n#include <motion_commons\/TurnActionResult.h>\n#include <string>\n\ntypedef actionlib::SimpleActionServer<task_commons::lineAction> Server;\ntypedef actionlib::SimpleActionClient<motion_commons::ForwardAction> Client_Forward;\ntypedef actionlib::SimpleActionClient<motion_commons::SidewardAction> Client_Sideward;\ntypedef actionlib::SimpleActionClient<motion_commons::TurnAction> Client_Turn;\n\nclass TaskLineInnerClass\n{\nprivate:\n  ros::NodeHandle nh_;\n  Server line_server_;\n  std::string action_name_;\n  task_commons::lineFeedback feedback_;\n  task_commons::lineResult result_;\n  ros::Subscriber detection_data;\n  ros::Subscriber yaw_sub;\n  ros::Subscriber centralize_data;\n  ros::Subscriber angle_data;\n  ros::Publisher switch_centralize;\n  ros::Publisher switch_angle;\n  ros::Publisher switch_detection;\n  ros::Publisher present_X_;\n  ros::Publisher present_Y_;\n  ros::Publisher yaw_pub_;\n  Client_Forward ForwardClient_;\n  Client_Sideward SidewardClient_;\n  Client_Turn TurnClient_;\n  motion_commons::ForwardGoal forwardgoal;\n  motion_commons::SidewardGoal sidewardgoal;\n  motion_commons::TurnGoal turngoal;\n  std_msgs::Float64 data_X_;\n  std_msgs::Float64 data_Y_;\n  std_msgs::Float64 angle_goal;\n  bool isOrange, success, FrontCenter, SideCenter, LineAlign;\n\npublic:\n  TaskLineInnerClass(std::string name, std::string node, std::string node1,\n                     std::string node2)\n    :  \/\/ here we are defining the server, third argument is optional\n    line_server_(nh_, name, boost::bind(&TaskLineInnerClass::analysisCB, this, _1), false)\n    , action_name_(name)\n    , ForwardClient_(node)\n    , TurnClient_(node1)\n    , SidewardClient_(node2)\n  {\n    ROS_INFO(\"inside constructor\");\n    line_server_.registerPreemptCallback(boost::bind(&TaskLineInnerClass::preemptCB, this));\n    present_X_ = nh_.advertise<std_msgs::Float64>(\"\/varun\/motion\/y_distance\", 1000);\n    present_Y_ = nh_.advertise<std_msgs::Float64>(\"\/varun\/motion\/x_distance\", 1000);\n    switch_detection = nh_.advertise<std_msgs::Bool>(\"line_detection_switch\", 1000);\n    switch_angle = nh_.advertise<std_msgs::Bool>(\"line_angle_switch\", 1000);\n    switch_centralize = nh_.advertise<std_msgs::Bool>(\"line_centralize_switch\", 1000);\n    yaw_pub_ = nh_.advertise<std_msgs::Float64>(\"\/varun\/motion\/yaw\", 1000);\n\n    detection_data = nh_.subscribe<std_msgs::Bool>(\"\/varun\/ip\/line_detection\", 1000,\n                                                   &TaskLineInnerClass::lineDetectedListener, this);\n    yaw_sub = nh_.subscribe<std_msgs::Float64>(\"\/varun\/sensors\/imu\/yaw\", 1000, &TaskLineInnerClass::yawCB, this);\n    centralize_data = nh_.subscribe<std_msgs::Float64MultiArray>(\"\/varun\/ip\/line_centralize\", 1000,\n                                                                 &TaskLineInnerClass::lineCentralizeListener, this);\n    angle_data =\n        nh_.subscribe<std_msgs::Float64>(\"\/varun\/ip\/line_angle\", 1000, &TaskLineInnerClass::lineAngleListener, this);\n\n    line_server_.start();\n  }\n\n  ~TaskLineInnerClass(void)\n  {\n  }\n\n  void yawCB(std_msgs::Float64 imu_data)\n  {\n    yaw_pub_.publish(imu_data);\n  }\n\n  void lineDetectedListener(std_msgs::Bool msg)\n  {\n    if (msg.data)\n      isOrange = true;\n    else\n      isOrange = false;\n  }\n\n  void lineCentralizeListener(std_msgs::Float64MultiArray array)\n  {\n    data_X_.data = array.data[0];\n    data_Y_.data = array.data[1];\n    present_X_.publish(data_X_);\n    present_Y_.publish(data_Y_);\n  }\n\n  void lineAngleListener(std_msgs::Float64 msg)\n  {\n    angle_goal.data = msg.data;\n  }\n\n  void spinThreadSidewardCamera()\n  {\n    Client_Sideward &tempSideward = SidewardClient_;\n    tempSideward.waitForResult();\n    SideCenter = (*(tempSideward.getResult())).Result;\n    if (SideCenter)\n    {\n      ROS_INFO(\"%s: Bot is at side center\", action_name_.c_str());\n    }\n    else\n    {\n      ROS_INFO(\"%s: Bot is not at side center, something went wrong\", action_name_.c_str());\n      ros::shutdown();\n    }\n  }\n\n  void spinThreadForwardCamera()\n  {\n    Client_Forward &tempForward = ForwardClient_;\n    tempForward.waitForResult();\n    FrontCenter = (*(tempForward.getResult())).Result;\n    if (FrontCenter)\n    {\n      ROS_INFO(\"%s Bot is at Front center\", action_name_.c_str());\n    }\n    else\n    {\n      ROS_INFO(\"%s: Bot is not at Front center, something went wrong\", action_name_.c_str());\n      ros::shutdown();\n    }\n  }\n\n  void spinThreadTurnCamera()\n  {\n    Client_Turn &tempTurn = TurnClient_;\n    tempTurn.waitForResult();\n    LineAlign = (*(tempTurn.getResult())).Result;\n    if (LineAlign)\n    {\n      ROS_INFO(\"%s: Bot is at side center\", action_name_.c_str());\n    }\n  }\n\n  void preemptCB(void)\n  {\n    \/\/ Not actually preempting the goal because Shibhansh did it in analysisCB\n    ROS_INFO(\"%s: Called when preempted from the client\", action_name_.c_str());\n  }\n\n  void analysisCB(const task_commons::lineGoalConstPtr goal)\n  {\n    ROS_INFO(\"Inside analysisCB\");\n    success = true;\n    isOrange = false;\n    LineAlign = false;\n    FrontCenter = false;\n    SideCenter = false;\n    ros::Rate looprate(12);\n\n    if (!line_server_.isActive())\n      return;\n\n    ROS_INFO(\"%s Waiting for Forward server to start.\", action_name_.c_str());\n    ForwardClient_.waitForServer();\n    SidewardClient_.waitForServer();\n    TurnClient_.waitForServer();\n\n    TaskLineInnerClass::detection_switch_on();\n\n    \/\/ Stabilization of yaw\n    turngoal.AngleToTurn = 0;\n    turngoal.loop = 100000;\n    TurnClient_.sendGoal(turngoal);\n    \/\/ start moving forward.\n    \/\/ send initial data to forward.\n    forwardgoal.Goal = 100;\n    forwardgoal.loop = 10;\n    ForwardClient_.sendGoal(forwardgoal);\n\n    while (goal->order)\n    {\n      if (line_server_.isPreemptRequested() || !ros::ok())\n      {\n        ROS_INFO(\"%s: Preempted\", action_name_.c_str());\n        \/\/ set the action state to preempted\n        line_server_.setPreempted();\n        success = false;\n        break;\n      }\n      looprate.sleep();\n\n      if (isOrange)\n      {\n        \/\/ stop will happen outside while loop so if preempted then too it will\n        \/\/ stop\n        break;\n      }\n      \/\/ publish the feedback\n\n      feedback_.AngleRemaining = angle_goal.data;\n      line_server_.publishFeedback(feedback_);\n      ROS_INFO(\"%s: searching line\", action_name_.c_str());\n      ros::spinOnce();\n    }\n\n    ForwardClient_.cancelGoal();  \/\/ stop motion here\n    TaskLineInnerClass::detection_switch_off();\n\n    TaskLineInnerClass::centralize_switch_on();\n\n    sidewardgoal.Goal = 0;\n    sidewardgoal.loop = 10;\n    SidewardClient_.sendGoal(sidewardgoal);\n    boost::thread spin_thread_sideward_camera(&TaskLineInnerClass::spinThreadSidewardCamera, this);\n\n    forwardgoal.Goal = 0;\n    forwardgoal.loop = 10;\n    ForwardClient_.sendGoal(forwardgoal);\n    boost::thread spin_thread_forward_camera(&TaskLineInnerClass::spinThreadForwardCamera, this);\n\n    while (goal->order)\n    {\n      if (line_server_.isPreemptRequested() || !ros::ok())\n      {\n        ROS_INFO(\"%s: Preempted\", action_name_.c_str());\n        \/\/ set the action state to preempted\n        line_server_.setPreempted();\n        success = false;\n        break;\n      }\n      looprate.sleep();\n      if (FrontCenter && SideCenter)\n      {\n        ROS_INFO(\"%s: Line has been centralized.\", action_name_.c_str());\n        break;\n      }\n      \/\/ publish the feedback\n      feedback_.AngleRemaining = angle_goal.data;\n      line_server_.publishFeedback(feedback_);\n      ROS_INFO(\"%s:: x = %f, y = %f\", action_name_.c_str(), data_X_.data, data_Y_.data);\n      ros::spinOnce();\n    }\n\n    TaskLineInnerClass::centralize_switch_off();\n\n    TaskLineInnerClass::angle_switch_on();\n\n    TurnClient_.cancelGoal();  \/\/ stopped stablisation\n\n    turngoal.AngleToTurn = angle_goal.data;\n    turngoal.loop = 10;\n    TurnClient_.sendGoal(turngoal);\n    boost::thread spin_thread_turn_camera(&TaskLineInnerClass::spinThreadTurnCamera, this);\n\n    while (goal->order)\n    {\n      if (line_server_.isPreemptRequested() || !ros::ok())\n      {\n        ROS_INFO(\"%s: Preempted\", action_name_.c_str());\n        \/\/ set the action state to preempted\n        line_server_.setPreempted();\n        success = false;\n        break;\n      }\n      looprate.sleep();\n      if (LineAlign)\n      {\n        if (angle_goal.data <= 5.0 && angle_goal.data >= -5.0)\n        {\n          ROS_INFO(\"%s: line is aligned.\", action_name_.c_str());\n          break;\n        }\n        else\n        {\n          ROS_INFO(\"%s: resending the angle goal.\", action_name_.c_str());\n          turngoal.AngleToTurn = angle_goal.data;\n          turngoal.loop = 10;\n          TurnClient_.sendGoal(turngoal);\n        }\n      }\n      feedback_.AngleRemaining = angle_goal.data;\n      line_server_.publishFeedback(feedback_);\n      ROS_INFO(\"%s: angle remaining = %f\", action_name_.c_str(), angle_goal.data);\n      ros::spinOnce();\n    }\n\n    if (success)\n    {\n      isOrange = false;\n      result_.MotionCompleted = success;\n      ROS_INFO(\"%s: Succeeded\", action_name_.c_str());\n      line_server_.setSucceeded(result_);\n    }\n  }\n\n  void detection_switch_on()\n  {\n    std_msgs::Bool msg;\n    msg.data = false;\n    switch_detection.publish(msg);\n  }\n\n  void detection_switch_off()\n  {\n    std_msgs::Bool msg;\n    msg.data = true;\n    switch_detection.publish(msg);\n  }\n\n  void angle_switch_on()\n  {\n    std_msgs::Bool msg;\n    msg.data = false;\n    switch_angle.publish(msg);\n  }\n\n  void angle_switch_off()\n  {\n    std_msgs::Bool msg;\n    msg.data = true;\n    switch_angle.publish(msg);\n  }\n\n  void centralize_switch_on()\n  {\n    std_msgs::Bool msg;\n    msg.data = false;\n    switch_centralize.publish(msg);\n  }\n\n  void centralize_switch_off()\n  {\n    std_msgs::Bool msg;\n    msg.data = true;\n    switch_centralize.publish(msg);\n  }\n};\n\/\/***********************************************************************************\/\/\n\nint main(int argc, char **argv)\n{\n  ros::init(argc, argv, \"line_server\");\n\n  ROS_INFO(\"Waiting for Goal\");\n\n  TaskLineInnerClass taskLineObject(ros::this_node::getName(), \"forward\", \"turningXY\", \"sideward\");\n\n  ros::spin();\n  return 0;\n}\n<commit_msg>fixed reseding of goal problem<commit_after>\/\/ Copyright 2016 AUV-IITK\n#include <ros\/ros.h>\n#include <std_msgs\/Float64.h>\n#include <std_msgs\/Float32.h>\n#include <std_msgs\/Int32.h>\n#include <std_msgs\/String.h>\n#include <std_msgs\/Float64MultiArray.h>\n#include <std_msgs\/Bool.h>\n#include <actionlib\/server\/simple_action_server.h>\n#include <actionlib\/client\/simple_action_client.h>\n#include <actionlib\/client\/terminal_state.h>\n#include <task_commons\/lineAction.h>\n#include <motion_commons\/ForwardAction.h>\n#include <motion_commons\/SidewardAction.h>\n#include <motion_commons\/TurnAction.h>\n#include <motion_commons\/SidewardActionFeedback.h>\n#include <motion_commons\/ForwardActionFeedback.h>\n#include <motion_commons\/TurnActionFeedback.h>\n#include <motion_commons\/SidewardActionResult.h>\n#include <motion_commons\/ForwardActionResult.h>\n#include <motion_commons\/TurnActionResult.h>\n#include <string>\n\ntypedef actionlib::SimpleActionServer<task_commons::lineAction> Server;\ntypedef actionlib::SimpleActionClient<motion_commons::ForwardAction> Client_Forward;\ntypedef actionlib::SimpleActionClient<motion_commons::SidewardAction> Client_Sideward;\ntypedef actionlib::SimpleActionClient<motion_commons::TurnAction> Client_Turn;\n\nclass TaskLineInnerClass\n{\nprivate:\n  ros::NodeHandle nh_;\n  Server line_server_;\n  std::string action_name_;\n  task_commons::lineFeedback feedback_;\n  task_commons::lineResult result_;\n  ros::Subscriber detection_data;\n  ros::Subscriber yaw_sub;\n  ros::Subscriber centralize_data;\n  ros::Subscriber angle_data;\n  ros::Publisher switch_centralize;\n  ros::Publisher switch_angle;\n  ros::Publisher switch_detection;\n  ros::Publisher present_X_;\n  ros::Publisher present_Y_;\n  ros::Publisher yaw_pub_;\n  Client_Forward ForwardClient_;\n  Client_Sideward SidewardClient_;\n  Client_Turn TurnClient_;\n  motion_commons::ForwardGoal forwardgoal;\n  motion_commons::SidewardGoal sidewardgoal;\n  motion_commons::TurnGoal turngoal;\n  std_msgs::Float64 data_X_;\n  std_msgs::Float64 data_Y_;\n  std_msgs::Float64 angle_goal;\n  bool isOrange, success, FrontCenter, SideCenter, LineAlign;\n\npublic:\n  TaskLineInnerClass(std::string name, std::string node, std::string node1,\n                     std::string node2)\n    :  \/\/ here we are defining the server, third argument is optional\n    line_server_(nh_, name, boost::bind(&TaskLineInnerClass::analysisCB, this, _1), false)\n    , action_name_(name)\n    , ForwardClient_(node)\n    , TurnClient_(node1)\n    , SidewardClient_(node2)\n  {\n    ROS_INFO(\"inside constructor\");\n    line_server_.registerPreemptCallback(boost::bind(&TaskLineInnerClass::preemptCB, this));\n    present_X_ = nh_.advertise<std_msgs::Float64>(\"\/varun\/motion\/y_distance\", 1000);\n    present_Y_ = nh_.advertise<std_msgs::Float64>(\"\/varun\/motion\/x_distance\", 1000);\n    switch_detection = nh_.advertise<std_msgs::Bool>(\"line_detection_switch\", 1000);\n    switch_angle = nh_.advertise<std_msgs::Bool>(\"line_angle_switch\", 1000);\n    switch_centralize = nh_.advertise<std_msgs::Bool>(\"line_centralize_switch\", 1000);\n    yaw_pub_ = nh_.advertise<std_msgs::Float64>(\"\/varun\/motion\/yaw\", 1000);\n\n    detection_data = nh_.subscribe<std_msgs::Bool>(\"\/varun\/ip\/line_detection\", 1000,\n                                                   &TaskLineInnerClass::lineDetectedListener, this);\n    yaw_sub = nh_.subscribe<std_msgs::Float64>(\"\/varun\/sensors\/imu\/yaw\", 1000, &TaskLineInnerClass::yawCB, this);\n    centralize_data = nh_.subscribe<std_msgs::Float64MultiArray>(\"\/varun\/ip\/line_centralize\", 1000,\n                                                                 &TaskLineInnerClass::lineCentralizeListener, this);\n    angle_data =\n        nh_.subscribe<std_msgs::Float64>(\"\/varun\/ip\/line_angle\", 1000, &TaskLineInnerClass::lineAngleListener, this);\n\n    line_server_.start();\n  }\n\n  ~TaskLineInnerClass(void)\n  {\n  }\n\n  void yawCB(std_msgs::Float64 imu_data)\n  {\n    yaw_pub_.publish(imu_data);\n  }\n\n  void lineDetectedListener(std_msgs::Bool msg)\n  {\n    if (msg.data)\n      isOrange = true;\n    else\n      isOrange = false;\n  }\n\n  void lineCentralizeListener(std_msgs::Float64MultiArray array)\n  {\n    data_X_.data = array.data[0];\n    data_Y_.data = array.data[1];\n    present_X_.publish(data_X_);\n    present_Y_.publish(data_Y_);\n  }\n\n  void lineAngleListener(std_msgs::Float64 msg)\n  {\n    angle_goal.data = msg.data;\n  }\n\n  void spinThreadSidewardCamera()\n  {\n    Client_Sideward &tempSideward = SidewardClient_;\n    tempSideward.waitForResult();\n    SideCenter = (*(tempSideward.getResult())).Result;\n    if (SideCenter)\n    {\n      ROS_INFO(\"%s: Bot is at side center\", action_name_.c_str());\n    }\n    else\n    {\n      ROS_INFO(\"%s: Bot is not at side center, something went wrong\", action_name_.c_str());\n      success = false;\n    }\n  }\n\n  void spinThreadForwardCamera()\n  {\n    Client_Forward &tempForward = ForwardClient_;\n    tempForward.waitForResult();\n    FrontCenter = (*(tempForward.getResult())).Result;\n    if (FrontCenter)\n    {\n      ROS_INFO(\"%s Bot is at Front center\", action_name_.c_str());\n    }\n    else\n    {\n      ROS_INFO(\"%s: Bot is not at Front center, something went wrong\", action_name_.c_str());\n      success = false;\n    }\n  }\n\n  void spinThreadTurnCamera()\n  {\n    Client_Turn &tempTurn = TurnClient_;\n    tempTurn.waitForResult();\n    LineAlign = (*(tempTurn.getResult())).Result;\n    if (LineAlign)\n    {\n      ROS_INFO(\"%s: Bot is aligned\", action_name_.c_str());\n    }\n    else\n    {\n      ROS_INFO(\"%s: Bot is not aligned, something went wrong\", action_name_.c_str());\n      success = false;\n    }\n  }\n\n  void preemptCB(void)\n  {\n    \/\/ Not actually preempting the goal because Shibhansh did it in analysisCB\n    ROS_INFO(\"%s: Called when preempted from the client\", action_name_.c_str());\n  }\n\n  void analysisCB(const task_commons::lineGoalConstPtr goal)\n  {\n    ROS_INFO(\"Inside analysisCB\");\n    success = true;\n    isOrange = false;\n    LineAlign = false;\n    FrontCenter = false;\n    SideCenter = false;\n    ros::Rate looprate(12);\n\n    if (!line_server_.isActive())\n      return;\n\n    ROS_INFO(\"%s Waiting for Forward server to start.\", action_name_.c_str());\n    ForwardClient_.waitForServer();\n    SidewardClient_.waitForServer();\n    TurnClient_.waitForServer();\n\n    TaskLineInnerClass::detection_switch_on();\n\n    \/\/ Stabilization of yaw\n    turngoal.AngleToTurn = 0;\n    turngoal.loop = 100000;\n    TurnClient_.sendGoal(turngoal);\n    \/\/ start moving forward.\n    \/\/ send initial data to forward.\n    forwardgoal.Goal = 100;\n    forwardgoal.loop = 10;\n    ForwardClient_.sendGoal(forwardgoal);\n\n    while (goal->order && success)\n    {\n      if (line_server_.isPreemptRequested() || !ros::ok())\n      {\n        ROS_INFO(\"%s: Preempted\", action_name_.c_str());\n        \/\/ set the action state to preempted\n        line_server_.setPreempted();\n        success = false;\n        break;\n      }\n      looprate.sleep();\n\n      if (isOrange)\n      {\n        \/\/ stop will happen outside while loop so if preempted then too it will\n        \/\/ stop\n        break;\n      }\n      \/\/ publish the feedback\n\n      feedback_.AngleRemaining = angle_goal.data;\n      line_server_.publishFeedback(feedback_);\n      ROS_INFO(\"%s: searching line\", action_name_.c_str());\n      ros::spinOnce();\n    }\n\n    ForwardClient_.cancelGoal();  \/\/ stop motion here\n    TaskLineInnerClass::detection_switch_off();\n\n    TaskLineInnerClass::centralize_switch_on();\n\n    sidewardgoal.Goal = 0;\n    sidewardgoal.loop = 10;\n    SidewardClient_.sendGoal(sidewardgoal);\n    boost::thread spin_thread_sideward_camera(&TaskLineInnerClass::spinThreadSidewardCamera, this);\n\n    forwardgoal.Goal = 0;\n    forwardgoal.loop = 10;\n    ForwardClient_.sendGoal(forwardgoal);\n    boost::thread spin_thread_forward_camera(&TaskLineInnerClass::spinThreadForwardCamera, this);\n\n    while (goal->order && success)\n    {\n      if (line_server_.isPreemptRequested() || !ros::ok())\n      {\n        ROS_INFO(\"%s: Preempted\", action_name_.c_str());\n        \/\/ set the action state to preempted\n        line_server_.setPreempted();\n        success = false;\n        break;\n      }\n      looprate.sleep();\n      if (FrontCenter && SideCenter)\n      {\n        ROS_INFO(\"%s: Line has been centralized.\", action_name_.c_str());\n        break;\n      }\n      \/\/ publish the feedback\n      feedback_.AngleRemaining = angle_goal.data;\n      line_server_.publishFeedback(feedback_);\n      ROS_INFO(\"%s:: x = %f, y = %f\", action_name_.c_str(), data_X_.data, data_Y_.data);\n      ros::spinOnce();\n    }\n\n    TaskLineInnerClass::centralize_switch_off();\n\n    TaskLineInnerClass::angle_switch_on();\n\n    TurnClient_.cancelGoal();  \/\/ stopped stablisation\n\n    turngoal.AngleToTurn = angle_goal.data;\n    turngoal.loop = 10;\n    TurnClient_.sendGoal(turngoal);\n    boost::thread spin_thread_turn_camera(&TaskLineInnerClass::spinThreadTurnCamera, this);\n\n    while (goal->order && success)\n    {\n      if (line_server_.isPreemptRequested() || !ros::ok())\n      {\n        ROS_INFO(\"%s: Preempted\", action_name_.c_str());\n        \/\/ set the action state to preempted\n        line_server_.setPreempted();\n        success = false;\n        break;\n      }\n\n      looprate.sleep();\n      if (LineAlign)\n      {\n        ROS_INFO(\"%s: line is aligned.\", action_name_.c_str());\n        break;\n      }\n\n      feedback_.AngleRemaining = angle_goal.data;\n      line_server_.publishFeedback(feedback_);\n      ROS_INFO(\"%s: angle remaining = %f\", action_name_.c_str(), angle_goal.data);\n      ros::spinOnce();\n    }\n\n    result_.MotionCompleted = success;\n    ROS_INFO(\"%s: Success is %s\", action_name_.c_str(), success ? \"true\" : \"false\");\n    line_server_.setSucceeded(result_);\n  }\n\n  void detection_switch_on()\n  {\n    std_msgs::Bool msg;\n    msg.data = false;\n    switch_detection.publish(msg);\n  }\n\n  void detection_switch_off()\n  {\n    std_msgs::Bool msg;\n    msg.data = true;\n    switch_detection.publish(msg);\n  }\n\n  void angle_switch_on()\n  {\n    std_msgs::Bool msg;\n    msg.data = false;\n    switch_angle.publish(msg);\n  }\n\n  void angle_switch_off()\n  {\n    std_msgs::Bool msg;\n    msg.data = true;\n    switch_angle.publish(msg);\n  }\n\n  void centralize_switch_on()\n  {\n    std_msgs::Bool msg;\n    msg.data = false;\n    switch_centralize.publish(msg);\n  }\n\n  void centralize_switch_off()\n  {\n    std_msgs::Bool msg;\n    msg.data = true;\n    switch_centralize.publish(msg);\n  }\n};\n\/\/***********************************************************************************\/\/\n\nint main(int argc, char **argv)\n{\n  ros::init(argc, argv, \"line_server\");\n\n  ROS_INFO(\"Waiting for Goal\");\n\n  TaskLineInnerClass taskLineObject(ros::this_node::getName(), \"forward\", \"turningXY\", \"sideward\");\n\n  ros::spin();\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2016 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/  http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#pragma once\n\nnamespace etl {\n\n#ifdef ETL_VECTORIZE_FULL\n\n\/\/VECTORIZE_FULL enables VECTORIZE_EXPR\n#ifndef ETL_VECTORIZE_EXPR\n#define ETL_VECTORIZE_EXPR\n#endif\n\n\/\/VECTORIZE_FULL enables VECTORIZE_IMPL\n#ifndef ETL_VECTORIZE_IMPL\n#define ETL_VECTORIZE_IMPL\n#endif\n\n#endif \/\/ETL_VECTORIZE_FULL\n\n\/\/Flag to enable auto-vectorization of expressions\n#ifdef ETL_VECTORIZE_EXPR\nconstexpr const bool vectorize_expr = true;\n#else\nconstexpr const bool vectorize_expr   = false;                               \/\/\/< Boolean flag indicating if the expression are automatically vectorized\n#endif\n\n\/\/Flag to enable vectorized implementation of algorithms\n#ifdef ETL_VECTORIZE_IMPL\nconstexpr const bool vectorize_impl = true;\n#else\nconstexpr const bool vectorize_impl   = false;                               \/\/\/< Boolean flag indicating if the implementations are automatically vectorized\n#endif\n\n\/\/Flag to allow conv_valid_multi to use FFT\n#ifdef ETL_CONV_VALID_FFT\nconstexpr const bool conv_valid_fft = true;\n#else\nconstexpr const bool conv_valid_fft   = false;                               \/\/\/< Boolean flag indicating if temporaries are created\n#endif\n\n\/\/Select the number of threads\n#ifdef ETL_PARALLEL_THREADS\nconstexpr const std::size_t threads = ETL_PARALLEL_THREADS;\n#else\nconst std::size_t threads             = std::thread::hardware_concurrency(); \/\/\/< Number of threads\n#endif\n\n\/\/Indicate that ETL should run in parallel\n#ifdef ETL_PARALLEL\nconstexpr const bool is_parallel = true;\n#else\nconstexpr const bool is_parallel = false;                               \/\/\/< Boolean flag indicating if expressions and implementations are parallelized (alpha)\n#endif\n\n#ifdef ETL_MKL_MODE\n\n\/\/MKL mode enables BLAS mode\n#ifndef ETL_BLAS_MODE\n#define ETL_BLAS_MODE\n#endif\n\nconstexpr const bool is_mkl_enabled = true;\nconstexpr const bool has_fast_fft   = true;\n\n#else\n\nconstexpr const bool is_mkl_enabled              = false; \/\/\/< Boolean flag indicating if MKL is enabled\nconstexpr const bool has_fast_fft                = false; \/\/\/< Boolean flag indicating if a fast FFT implementation is available\n\n#endif\n\n\/\/Flag to enable the use of CBLAS library\n#ifdef ETL_BLAS_MODE\nconstexpr const bool is_cblas_enabled = true;\n#else\nconstexpr const bool is_cblas_enabled            = false; \/\/\/< Boolean flag indicating if CBLAS is available\n#endif\n\n\/\/Flag to indicate that blas is multithreaded\n#ifdef ETL_BLAS_THREADS\nconstexpr const bool is_blas_parallel = true;\n#else\nconstexpr const bool is_blas_parallel            = false; \/\/\/< Boolean flag indicating if CBLAS is running parallel\n#endif\n\n#ifdef ETL_CUDA\nstatic_assert(false, \"ETL_CUDA should never be set directly\");\n#endif\n\n#ifdef ETL_CUBLAS_MODE\nconstexpr const bool is_cublas_enabled = true;\n#define ETL_CUDA\n#else\nconstexpr const bool is_cublas_enabled           = false; \/\/\/< Boolean flag indicating if CUBLAS is available\n#endif\n\n#ifdef ETL_CUFFT_MODE\n#define ETL_CUDA\nconstexpr const bool is_cufft_enabled = true;\n#else\nconstexpr const bool is_cufft_enabled            = false; \/\/\/< Boolean flag indicating if CUFFT is available\n#endif\n\n#ifdef ETL_CUDNN_MODE\nconstexpr const bool is_cudnn_enabled = true;\n#define ETL_CUDA\n#else\nconstexpr const bool is_cudnn_enabled            = false; \/\/\/< Boolean flag indicating if CUDNN is available\n#endif\n\n\/\/Flag to perform elementwise multiplication by default (operator*)\n\/\/instead of matrix(vector) multiplication\n#ifdef ETL_ELEMENT_WISE_MULTIPLICATION\nconstexpr const bool is_element_wise_mul_default = true;\n#else\nconstexpr const bool is_element_wise_mul_default = false; \/\/\/< Boolean flag indicating if multiplication of two expression means matrix multiplication (false) or element-wise multiplication (true)\n#endif\n\n\/\/Flag to prevent division to be done by multiplication\n#ifdef ETL_STRICT_DIV\nconstexpr const bool is_div_strict = true;\n#else\nconstexpr const bool is_div_strict               = false; \/\/\/< Boolean flag indicating if division can be done by multiplication (false) or not (true)\n#endif\n\n\/\/Flag to disable unrolling of vectorized loops\n#ifdef ETL_NO_UNROLL_VECT\nconstexpr const bool unroll_vectorized_loops = false;\n#else\nconstexpr const bool unroll_vectorized_loops     = true;  \/\/\/< Boolean flag indicating if vectorized loops are getting unrolled\n#endif\n\n\/\/Flag to disable unrolling of non-vectorized loops\n#ifdef ETL_NO_UNROLL_NON_VECT\nconstexpr const bool unroll_normal_loops = false;\n#else\nconstexpr const bool unroll_normal_loops         = true;  \/\/\/< Boolean flag indicating if normal loops are getting unrolled\n#endif\n\n\/\/Flag to configure the maximum workspace size for CUDA\n#ifdef ETL_CUDNN_MAX_WORKSPACE\nconstexpr const std::size_t cudnn_max_workspace = ETL_CUDNN_MAX_WORKSPACE;\n#else\nconstexpr const std::size_t cudnn_max_workspace = 2UL * 1024 * 1024 * 1024; \/\/\/< The max workspace we allocate for CUDNN (2GiB by default)\n#endif\n\n\/*!\n * \\brief Vectorization mode\n *\/\nenum class vector_mode_t {\n    NONE,  \/\/\/< No vectorization is available\n    SSE3,  \/\/\/< SSE3 is the max vectorization available\n    AVX,   \/\/\/< AVX is the max vectorization available\n    AVX512 \/\/\/< AVX-512F is the max vectorization available\n};\n\n#ifdef __AVX512F__\nconstexpr const vector_mode_t vector_mode = vector_mode_t::AVX512;\n#elif defined(__AVX__)\nconstexpr const vector_mode_t vector_mode        = vector_mode_t::AVX;\n#elif defined(__SSE3__)\nconstexpr const vector_mode_t vector_mode = vector_mode_t::SSE3;\n#else\nconstexpr const vector_mode_t vector_mode = vector_mode_t::NONE; \/\/\/< The vector mode in use\n#endif\n\n#ifdef __AVX512F__\nconstexpr const bool avx512_enabled = true;\n#else\nconstexpr const bool avx512_enabled              = false; \/\/\/< Indicates if AVX512F is available\n#endif\n\n#ifdef __AVX__\nconstexpr const bool avx_enabled = true;\n#else\nconstexpr const bool avx_enabled                 = false; \/\/\/< Indicates if AVX is available\n#endif\n\n#ifdef __SSE3__\nconstexpr const bool sse3_enabled = true;\n#else\nconstexpr const bool sse3_enabled                = false; \/\/\/< Indicates if sse3 is available\n#endif\n\n#ifdef __INTEL_COMPILER\nconstexpr const bool intel_compiler = true;\n#else\nconstexpr const bool intel_compiler              = false; \/\/\/< Indicates if the project is compiled with intel\n#endif\n\n} \/\/end of namespace etl\n<commit_msg>Define a maximum workspace<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#pragma once\n\nnamespace etl {\n\n#ifdef ETL_VECTORIZE_FULL\n\n\/\/VECTORIZE_FULL enables VECTORIZE_EXPR\n#ifndef ETL_VECTORIZE_EXPR\n#define ETL_VECTORIZE_EXPR\n#endif\n\n\/\/VECTORIZE_FULL enables VECTORIZE_IMPL\n#ifndef ETL_VECTORIZE_IMPL\n#define ETL_VECTORIZE_IMPL\n#endif\n\n#endif \/\/ETL_VECTORIZE_FULL\n\n\/\/Flag to enable auto-vectorization of expressions\n#ifdef ETL_VECTORIZE_EXPR\nconstexpr const bool vectorize_expr = true;\n#else\nconstexpr const bool vectorize_expr   = false;                               \/\/\/< Boolean flag indicating if the expression are automatically vectorized\n#endif\n\n\/\/Flag to enable vectorized implementation of algorithms\n#ifdef ETL_VECTORIZE_IMPL\nconstexpr const bool vectorize_impl = true;\n#else\nconstexpr const bool vectorize_impl   = false;                               \/\/\/< Boolean flag indicating if the implementations are automatically vectorized\n#endif\n\n\/\/Flag to allow conv_valid_multi to use FFT\n#ifdef ETL_CONV_VALID_FFT\nconstexpr const bool conv_valid_fft = true;\n#else\nconstexpr const bool conv_valid_fft   = false;                               \/\/\/< Boolean flag indicating if temporaries are created\n#endif\n\n\/\/Select the number of threads\n#ifdef ETL_PARALLEL_THREADS\nconstexpr const std::size_t threads = ETL_PARALLEL_THREADS;\n#else\nconst std::size_t threads             = std::thread::hardware_concurrency(); \/\/\/< Number of threads\n#endif\n\n\/\/Indicate that ETL should run in parallel\n#ifdef ETL_PARALLEL\nconstexpr const bool is_parallel = true;\n#else\nconstexpr const bool is_parallel = false;                               \/\/\/< Boolean flag indicating if expressions and implementations are parallelized (alpha)\n#endif\n\n#ifdef ETL_MKL_MODE\n\n\/\/MKL mode enables BLAS mode\n#ifndef ETL_BLAS_MODE\n#define ETL_BLAS_MODE\n#endif\n\nconstexpr const bool is_mkl_enabled = true;\nconstexpr const bool has_fast_fft   = true;\n\n#else\n\nconstexpr const bool is_mkl_enabled              = false; \/\/\/< Boolean flag indicating if MKL is enabled\nconstexpr const bool has_fast_fft                = false; \/\/\/< Boolean flag indicating if a fast FFT implementation is available\n\n#endif\n\n\/\/Flag to enable the use of CBLAS library\n#ifdef ETL_BLAS_MODE\nconstexpr const bool is_cblas_enabled = true;\n#else\nconstexpr const bool is_cblas_enabled            = false; \/\/\/< Boolean flag indicating if CBLAS is available\n#endif\n\n\/\/Flag to indicate that blas is multithreaded\n#ifdef ETL_BLAS_THREADS\nconstexpr const bool is_blas_parallel = true;\n#else\nconstexpr const bool is_blas_parallel            = false; \/\/\/< Boolean flag indicating if CBLAS is running parallel\n#endif\n\n#ifdef ETL_CUDA\nstatic_assert(false, \"ETL_CUDA should never be set directly\");\n#endif\n\n#ifdef ETL_CUBLAS_MODE\nconstexpr const bool is_cublas_enabled = true;\n#define ETL_CUDA\n#else\nconstexpr const bool is_cublas_enabled           = false; \/\/\/< Boolean flag indicating if CUBLAS is available\n#endif\n\n#ifdef ETL_CUFFT_MODE\n#define ETL_CUDA\nconstexpr const bool is_cufft_enabled = true;\n#else\nconstexpr const bool is_cufft_enabled            = false; \/\/\/< Boolean flag indicating if CUFFT is available\n#endif\n\n#ifdef ETL_CUDNN_MODE\nconstexpr const bool is_cudnn_enabled = true;\n#define ETL_CUDA\n#else\nconstexpr const bool is_cudnn_enabled            = false; \/\/\/< Boolean flag indicating if CUDNN is available\n#endif\n\n\/\/Flag to perform elementwise multiplication by default (operator*)\n\/\/instead of matrix(vector) multiplication\n#ifdef ETL_ELEMENT_WISE_MULTIPLICATION\nconstexpr const bool is_element_wise_mul_default = true;\n#else\nconstexpr const bool is_element_wise_mul_default = false; \/\/\/< Boolean flag indicating if multiplication of two expression means matrix multiplication (false) or element-wise multiplication (true)\n#endif\n\n\/\/Flag to prevent division to be done by multiplication\n#ifdef ETL_STRICT_DIV\nconstexpr const bool is_div_strict = true;\n#else\nconstexpr const bool is_div_strict               = false; \/\/\/< Boolean flag indicating if division can be done by multiplication (false) or not (true)\n#endif\n\n\/\/Flag to disable unrolling of vectorized loops\n#ifdef ETL_NO_UNROLL_VECT\nconstexpr const bool unroll_vectorized_loops = false;\n#else\nconstexpr const bool unroll_vectorized_loops     = true;  \/\/\/< Boolean flag indicating if vectorized loops are getting unrolled\n#endif\n\n\/\/Flag to disable unrolling of non-vectorized loops\n#ifdef ETL_NO_UNROLL_NON_VECT\nconstexpr const bool unroll_normal_loops = false;\n#else\nconstexpr const bool unroll_normal_loops         = true;  \/\/\/< Boolean flag indicating if normal loops are getting unrolled\n#endif\n\n\/\/Flag to configure the maximum workspace size for ETL\n#ifdef ETL_MAX_WORKSPACE\nconstexpr const std::size_t max_workspace = ETL_MAX_WORKSPACE;\n#else\nconstexpr const std::size_t max_workspace = 2UL * 1024 * 1024 * 1024; \/\/\/< The max workspace we allocate for ETL (2GiB by default)\n#endif\n\n\/\/Flag to configure the maximum workspace size for CUDA\n#ifdef ETL_CUDNN_MAX_WORKSPACE\nconstexpr const std::size_t cudnn_max_workspace = ETL_CUDNN_MAX_WORKSPACE;\n#else\nconstexpr const std::size_t cudnn_max_workspace = 2UL * 1024 * 1024 * 1024; \/\/\/< The max workspace we allocate for CUDNN (2GiB by default)\n#endif\n\n\/*!\n * \\brief Vectorization mode\n *\/\nenum class vector_mode_t {\n    NONE,  \/\/\/< No vectorization is available\n    SSE3,  \/\/\/< SSE3 is the max vectorization available\n    AVX,   \/\/\/< AVX is the max vectorization available\n    AVX512 \/\/\/< AVX-512F is the max vectorization available\n};\n\n#ifdef __AVX512F__\nconstexpr const vector_mode_t vector_mode = vector_mode_t::AVX512;\n#elif defined(__AVX__)\nconstexpr const vector_mode_t vector_mode        = vector_mode_t::AVX;\n#elif defined(__SSE3__)\nconstexpr const vector_mode_t vector_mode = vector_mode_t::SSE3;\n#else\nconstexpr const vector_mode_t vector_mode = vector_mode_t::NONE; \/\/\/< The vector mode in use\n#endif\n\n#ifdef __AVX512F__\nconstexpr const bool avx512_enabled = true;\n#else\nconstexpr const bool avx512_enabled              = false; \/\/\/< Indicates if AVX512F is available\n#endif\n\n#ifdef __AVX__\nconstexpr const bool avx_enabled = true;\n#else\nconstexpr const bool avx_enabled                 = false; \/\/\/< Indicates if AVX is available\n#endif\n\n#ifdef __SSE3__\nconstexpr const bool sse3_enabled = true;\n#else\nconstexpr const bool sse3_enabled                = false; \/\/\/< Indicates if sse3 is available\n#endif\n\n#ifdef __INTEL_COMPILER\nconstexpr const bool intel_compiler = true;\n#else\nconstexpr const bool intel_compiler              = false; \/\/\/< Indicates if the project is compiled with intel\n#endif\n\n} \/\/end of namespace etl\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *  scope_ztsh_coords\n *  PHD Guiding\n *\n *  Module for ZTSH autogude system, Crimean astrophysical observatory\n *  All rights reserved.\n *\n *  Copyright (c) 2017 Oleg Kutkov\n *  All rights reserved.\n * \n *  This source code is distributed under the following \"BSD\" license\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\n *     documentation and\/or other materials provided with the distribution.\n *    Neither the name of Craig Stark, Stark Labs 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 <stdio.h>\n#include <string.h>\n#include <sys\/socket.h>\n#include <arpa\/inet.h>\n#include <unistd.h>\n#include <errno.h>\n\n#include \"scope_ztsh_coords.h\"\n\nScopeZtshPosition::ScopeZtshPosition()\n\t: sock (0)\n{\n}\n\nScopeZtshPosition::~ScopeZtshPosition()\n{\n\tDisconnect();\n}\n\nbool ScopeZtshPosition::Connect(std::string host, int port)\n{\n\/*\tstruct sockaddr_in server;\n \n\tsock = socket(AF_INET , SOCK_STREAM , 0);\n\n\tif (sock == -1) {\n\t\tlast_error = std::string(\"Failed to create socket, error:\\n\") + strerror(errno);\n\t\treturn false;\n\t}\n \n\tserver.sin_addr.s_addr = inet_addr(host.c_str());\n\tserver.sin_family = AF_INET;\n\tserver.sin_port = htons(port);\n\n\tstruct timeval tv = {5, 0};\n\tsetsockopt(sock, SOL_SOCKET, SO_RCVTIMEO, (char *) &tv, sizeof(tv));\n\tsetsockopt(sock, SOL_SOCKET, SO_SNDTIMEO, (char *) &tv, sizeof(tv));\n \n\tif (connect(sock, (struct sockaddr *)&server , sizeof(server)) < 0) {\n\t\tlast_error = std::string(\"Failed to connect to the coords server, error:\\n\") + strerror(errno);\n        return false;\n\t}\n\n\/\/\/\n\n\tWriteString(\"<HelloServer>\");\n\n\tstd::string srv_answer = ReadString();\n\n\tif (srv_answer != \"<HelloClient>:\") {\n\t\tlast_error = \"Bad answer from server: \" + srv_answer;\n\t\tDisconnect();\n\t\treturn false;\n\t}\n\n\tsrv_answer = ReadString();\n\n\tif (srv_answer != \"<NumberParameters>:[int32]\") {\n\t\tlast_error = \"Bad answer from server: \" + srv_answer;\n\t\tDisconnect();\n\n\t\treturn false;\n\t}\n\n\tint srv_answer_int = ReadInt32();\n\n\tfor (int i = 0; i < srv_answer_int; i++) {\n\t\tsrv_answer = ReadString();\n\n\t\tif (srv_answer == \"<ProtocolVersion>:[int32]\") {\n\t\t\tint version = ReadInt32();\n\t\t\t\/\/\/ log this in future...\n\t\t} else if (srv_answer == \"<InstrumentName>:[string]\") {\n\t\t\tinstrument_name = ReadString();\n\t\t}\n\t}\n*\/\n\treturn true;\n}\n\nbool ScopeZtshPosition::Disconnect()\n{\n\tif (!sock) {\n\t\treturn true;\n\t}\n\n\tWriteString(\"<ByeServer>\");  \n    close(sock);\n\n\tsock = 0;\n\n\treturn true;\n}\n\nvoid ScopeZtshPosition::GetCoordsAndSpeed(double &ha, double &ra, double &dec, double &ra_speed, double &dec_speed)\n{\n\tif (!sock) {\n\t\tha = 0;\n\t\tra = 0;\n\t\tdec = 0;\n\t\tra_speed = 0;\n\t\tdec_speed = 0;\n\n\t\treturn;\n\t}\n\n\tstd::string srv_answer;\n\n\tWriteString(\"<\" + instrument_name + \".Reflector.GetTelemetry>\");\n\n\tReadString();\n\tReadString();\n\tint count = ReadInt32();\n\n\tfor (int i = 0; i < count; i++) {\n\t\tsrv_answer = ReadString();\n\n\t\tif (srv_answer == \"<HourAngleDeg>:[float64]\") {\n\t\t\tha = ReadFloat64();\n\t\t} else if (srv_answer == \"<RightAscensionDeg>:[float64]\") {\n\t\t\tra = ReadFloat64();\n\t\t} else if (srv_answer == \"<DeclinationDeg>:[float64]\") {\n\t\t\tdec = (ReadFloat64());\n\t\t} else if (srv_answer == \"<HourAngleSpeedArcSecPerSec>:[float64]\") {\n\t\t\tra_speed = ReadFloat64();\n\t\t} else if (srv_answer == \"<DeclinationSpeedArcSecPerSec>:[float64]\") {\n\t\t\tdec_speed = ReadFloat64();\n\t\t}\n\t}\n}\n\nstd::string ScopeZtshPosition::GetErrorText()\n{\n\treturn last_error;\n}\n\nchar ScopeZtshPosition::SocketReadByte()\n{\n\tchar byte;\n\n\t\/\/recv(sock, &byte, sizeof(byte), 0);\n\n\treturn byte;\n}\n\nint ScopeZtshPosition::Read7BitEncodedInt()\n{\n\tint int32 = 0, shift = 0, byteval;\n\n\twhile (((byteval = SocketReadByte()) & 128) != 0 & shift != 35)\n\t{\n\t\tint32 |= ((byteval & 127) << shift);\n\t\tshift += 7;\n\t}\n\n\treturn (int32 | (byteval << shift));\n}\n\nstd::string ScopeZtshPosition::ReadString()\n{\n\tint bytes_count = Read7BitEncodedInt();\n\n\tchar *buf = new char[bytes_count + 1];\n\tmemset(buf, 0, bytes_count);\n\n\t\/\/recv(sock, (void*)buf, bytes_count, 0);\n\n\tbuf[bytes_count] = '\\0';\n\n\tstd::string res = buf;\n\n\tdelete[] buf;\n\n\treturn res;\n}\n\nshort ScopeZtshPosition::ReadInt16()\n{\n\tshort res;\n\t\/\/recv(sock, &res, sizeof(res), 0);\n\n\treturn res;\n}\n\nint ScopeZtshPosition::ReadInt32()\n{\n\tint res;\n\t\/\/recv(sock, &res, sizeof(res), 0);\n\n\treturn res;\n}\n\nlong ScopeZtshPosition::ReadInt64()\n{\n\tlong res;\n\t\/\/recv(sock, &res, sizeof(res), 0);\n\n\treturn res;\n}\n\nfloat ScopeZtshPosition::ReadFloat32()\n{\n\tfloat res;\n\t\/\/recv(sock, &res, sizeof(res), 0);\n\n\treturn res;\n}\n\ndouble ScopeZtshPosition::ReadFloat64()\n{\n\tunsigned char *buff = new unsigned char[8];\n\t\/\/recv(sock, buff, 8, 0);\n\tdouble res =  *(double*)buff;\n\tdelete buff;\n\n\treturn res;\n}\n\nbool ScopeZtshPosition::ReadBool()\n{\n\treturn SocketReadByte() == 1;\n}\n\nvoid ScopeZtshPosition::SockWriteByte(char byte)\n{\n\t\/\/send(sock, &byte, 1, 0);\n}\n\nvoid ScopeZtshPosition::Write7BitEncodedInt(int int32)\n{\n\tfor (; int32 >= 128; int32 >>= 7) {\n\t\tSockWriteByte((unsigned char)(int32 | 128));\n\t}\n\n\tSockWriteByte((unsigned char)int32);\n}\n\nvoid ScopeZtshPosition::WriteString(std::string str)\n{\n\tint str_len = str.length();\n\n\tWrite7BitEncodedInt(str_len);\n\n\t\/\/send(sock, (void*)str.c_str(), str_len, 0);\n}\n\n<commit_msg>uncomennt everything<commit_after>\/*\n *  scope_ztsh_coords\n *  PHD Guiding\n *\n *  Module for ZTSH autogude system, Crimean astrophysical observatory\n *  All rights reserved.\n *\n *  Copyright (c) 2017 Oleg Kutkov\n *  All rights reserved.\n * \n *  This source code is distributed under the following \"BSD\" license\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\n *     documentation and\/or other materials provided with the distribution.\n *    Neither the name of Craig Stark, Stark Labs 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 <stdio.h>\n#include <string.h>\n#include <sys\/socket.h>\n#include <arpa\/inet.h>\n#include <unistd.h>\n#include <errno.h>\n\n#include \"scope_ztsh_coords.h\"\n\nScopeZtshPosition::ScopeZtshPosition()\n\t: sock (0)\n{\n}\n\nScopeZtshPosition::~ScopeZtshPosition()\n{\n\tDisconnect();\n}\n\nbool ScopeZtshPosition::Connect(std::string host, int port)\n{\n\tstruct sockaddr_in server;\n \n\tsock = socket(AF_INET , SOCK_STREAM , 0);\n\n\tif (sock == -1) {\n\t\tlast_error = std::string(\"Failed to create socket, error:\\n\") + strerror(errno);\n\t\treturn false;\n\t}\n \n\tserver.sin_addr.s_addr = inet_addr(host.c_str());\n\tserver.sin_family = AF_INET;\n\tserver.sin_port = htons(port);\n\n\tstruct timeval tv = {5, 0};\n\tsetsockopt(sock, SOL_SOCKET, SO_RCVTIMEO, (char *) &tv, sizeof(tv));\n\tsetsockopt(sock, SOL_SOCKET, SO_SNDTIMEO, (char *) &tv, sizeof(tv));\n \n\tif (connect(sock, (struct sockaddr *)&server , sizeof(server)) < 0) {\n\t\tlast_error = std::string(\"Failed to connect to the coords server, error:\\n\") + strerror(errno);\n        return false;\n\t}\n\n\/\/\/\n\n\tWriteString(\"<HelloServer>\");\n\n\tstd::string srv_answer = ReadString();\n\n\tif (srv_answer != \"<HelloClient>:\") {\n\t\tlast_error = \"Bad answer from server: \" + srv_answer;\n\t\tDisconnect();\n\t\treturn false;\n\t}\n\n\tsrv_answer = ReadString();\n\n\tif (srv_answer != \"<NumberParameters>:[int32]\") {\n\t\tlast_error = \"Bad answer from server: \" + srv_answer;\n\t\tDisconnect();\n\n\t\treturn false;\n\t}\n\n\tint srv_answer_int = ReadInt32();\n\n\tfor (int i = 0; i < srv_answer_int; i++) {\n\t\tsrv_answer = ReadString();\n\n\t\tif (srv_answer == \"<ProtocolVersion>:[int32]\") {\n\t\t\tint version = ReadInt32();\n\t\t\t\/\/\/ log this in future...\n\t\t} else if (srv_answer == \"<InstrumentName>:[string]\") {\n\t\t\tinstrument_name = ReadString();\n\t\t}\n\t}\n\n\treturn true;\n}\n\nbool ScopeZtshPosition::Disconnect()\n{\n\tif (!sock) {\n\t\treturn true;\n\t}\n\n\tWriteString(\"<ByeServer>\");  \n    close(sock);\n\n\tsock = 0;\n\n\treturn true;\n}\n\nvoid ScopeZtshPosition::GetCoordsAndSpeed(double &ha, double &ra, double &dec, double &ra_speed, double &dec_speed)\n{\n\tif (!sock) {\n\t\tha = 0;\n\t\tra = 0;\n\t\tdec = 0;\n\t\tra_speed = 0;\n\t\tdec_speed = 0;\n\n\t\treturn;\n\t}\n\n\tstd::string srv_answer;\n\n\tWriteString(\"<\" + instrument_name + \".Reflector.GetTelemetry>\");\n\n\tReadString();\n\tReadString();\n\tint count = ReadInt32();\n\n\tfor (int i = 0; i < count; i++) {\n\t\tsrv_answer = ReadString();\n\n\t\tif (srv_answer == \"<HourAngleDeg>:[float64]\") {\n\t\t\tha = ReadFloat64();\n\t\t} else if (srv_answer == \"<RightAscensionDeg>:[float64]\") {\n\t\t\tra = ReadFloat64();\n\t\t} else if (srv_answer == \"<DeclinationDeg>:[float64]\") {\n\t\t\tdec = (ReadFloat64());\n\t\t} else if (srv_answer == \"<HourAngleSpeedArcSecPerSec>:[float64]\") {\n\t\t\tra_speed = ReadFloat64();\n\t\t} else if (srv_answer == \"<DeclinationSpeedArcSecPerSec>:[float64]\") {\n\t\t\tdec_speed = ReadFloat64();\n\t\t}\n\t}\n}\n\nstd::string ScopeZtshPosition::GetErrorText()\n{\n\treturn last_error;\n}\n\nchar ScopeZtshPosition::SocketReadByte()\n{\n\tchar byte;\n\n\trecv(sock, &byte, sizeof(byte), 0);\n\n\treturn byte;\n}\n\nint ScopeZtshPosition::Read7BitEncodedInt()\n{\n\tint int32 = 0, shift = 0, byteval;\n\n\twhile (((byteval = SocketReadByte()) & 128) != 0 & shift != 35)\n\t{\n\t\tint32 |= ((byteval & 127) << shift);\n\t\tshift += 7;\n\t}\n\n\treturn (int32 | (byteval << shift));\n}\n\nstd::string ScopeZtshPosition::ReadString()\n{\n\tint bytes_count = Read7BitEncodedInt();\n\n\tchar *buf = new char[bytes_count + 1];\n\tmemset(buf, 0, bytes_count);\n\n\trecv(sock, (void*)buf, bytes_count, 0);\n\n\tbuf[bytes_count] = '\\0';\n\n\tstd::string res = buf;\n\n\tdelete[] buf;\n\n\treturn res;\n}\n\nshort ScopeZtshPosition::ReadInt16()\n{\n\tshort res;\n\trecv(sock, &res, sizeof(res), 0);\n\n\treturn res;\n}\n\nint ScopeZtshPosition::ReadInt32()\n{\n\tint res;\n\trecv(sock, &res, sizeof(res), 0);\n\n\treturn res;\n}\n\nlong ScopeZtshPosition::ReadInt64()\n{\n\tlong res;\n\trecv(sock, &res, sizeof(res), 0);\n\n\treturn res;\n}\n\nfloat ScopeZtshPosition::ReadFloat32()\n{\n\tfloat res;\n\trecv(sock, &res, sizeof(res), 0);\n\n\treturn res;\n}\n\ndouble ScopeZtshPosition::ReadFloat64()\n{\n\tunsigned char *buff = new unsigned char[8];\n\trecv(sock, buff, 8, 0);\n\tdouble res =  *(double*)buff;\n\tdelete buff;\n\n\treturn res;\n}\n\nbool ScopeZtshPosition::ReadBool()\n{\n\treturn SocketReadByte() == 1;\n}\n\nvoid ScopeZtshPosition::SockWriteByte(char byte)\n{\n\tsend(sock, &byte, 1, 0);\n}\n\nvoid ScopeZtshPosition::Write7BitEncodedInt(int int32)\n{\n\tfor (; int32 >= 128; int32 >>= 7) {\n\t\tSockWriteByte((unsigned char)(int32 | 128));\n\t}\n\n\tSockWriteByte((unsigned char)int32);\n}\n\nvoid ScopeZtshPosition::WriteString(std::string str)\n{\n\tint str_len = str.length();\n\n\tWrite7BitEncodedInt(str_len);\n\n\tsend(sock, (void*)str.c_str(), str_len, 0);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <dwb_local_planner\/debug_dwb_local_planner.h>\n#include <nav_2d_utils\/conversions.h>\n\n#include <nav_msgs\/Odometry.h>\n#include <robot_move\/FollowSegment.h>\n#include <ros\/ros.h>\n\nstatic std::shared_ptr<dwb_local_planner::DebugDWBLocalPlanner> planner;\nstatic nav_msgs::OdometryConstPtr lastOdom;\nstatic TFListenerPtr transformer;\nstatic ros::Publisher velPub;\n\nvoid onNewOdometry(nav_msgs::OdometryConstPtr _odom) { lastOdom = _odom; }\n\nbool followPath(robot_move::FollowSegmentRequest& _req,\n                robot_move::FollowSegmentResponse& _resp)\n{\n    (void)_resp;\n    ros::Rate rate(20);\n    ROS_INFO(\"Starting following path\");\n    planner->setPlan(_req.path);\n    bool stop = false;\n    while(!stop)\n    {\n        if(!transformer->waitForTransform(\"odom\", \"base_link\", ros::Time(0),\n                                          ros::Duration(0.2)))\n        {\n            ROS_ERROR(\"Can't transform from base_link to odom\");\n            return false;\n        }\n        tf::StampedTransform odomToMap;\n        transformer->lookupTransform(\"odom\", \"base_link\", ros::Time(0),\n                                     odomToMap);\n        nav_2d_msgs::Pose2DStamped robotPoseInMapFrame;\n        robotPoseInMapFrame.header.stamp = odomToMap.stamp_;\n        robotPoseInMapFrame.header.frame_id = odomToMap.frame_id_;\n        robotPoseInMapFrame.pose.x = odomToMap.getOrigin().x();\n        robotPoseInMapFrame.pose.y = odomToMap.getOrigin().y();\n        robotPoseInMapFrame.pose.theta = tf::getYaw(odomToMap.getRotation());\n\n        if(!lastOdom)\n        {\n            ROS_ERROR(\"No last odom\");\n            return false;\n        }\n        if(fabs((lastOdom->header.stamp - ros::Time::now()).toSec()) > 0.5)\n        {\n            ROS_ERROR(\"Too old odometry !\");\n            return false;\n        }\n        ROS_INFO(\"Compute Velocities\");\n        nav_2d_msgs::Twist2D vel;\n        vel.x = lastOdom->twist.twist.linear.x;\n        vel.theta = lastOdom->twist.twist.angular.z;\n        nav_2d_msgs::Twist2DStamped res =\n            planner->computeVelocityCommands(robotPoseInMapFrame, vel);\n\n        geometry_msgs::Twist cmd = nav_2d_utils::twist2Dto3D(res.velocity);\n        velPub.publish(cmd);\n\n        stop = planner->isGoalReached(robotPoseInMapFrame, vel);\n        ros::spinOnce();\n        rate.sleep();\n    }\n    geometry_msgs::Twist zero;\n    velPub.publish(zero);\n    return true;\n}\n\nint main(int argc, char** argv)\n{\n    ros::init(argc, argv, \"plan_node\");\n    planner = std::make_shared<dwb_local_planner::DebugDWBLocalPlanner>();\n    ROS_INFO(\"Plan Node\");\n\n    transformer = std::make_shared<tf::TransformListener>();\n    CostmapROSPtr costmap_ros =\n        std::make_shared<costmap_2d::Costmap2DROS>(\"costmap\", *transformer);\n    planner->initialize(\"dwb_local_planner\", transformer, costmap_ros);\n\n    ros::NodeHandle nh;\n    ROS_INFO(\"Starting \/follow_path service\");\n    auto followTrajService = nh.advertiseService(\"\/follow_path\", &followPath);\n\n    velPub = nh.advertise<geometry_msgs::Twist>(\"\/cmd_vel\", 1);\n\n    ros::Subscriber sub = nh.subscribe(\"odom\", 1, &onNewOdometry);\n    ros::spin();\n}\n<commit_msg>clang-format<commit_after>#include <dwb_local_planner\/debug_dwb_local_planner.h>\n#include <nav_2d_utils\/conversions.h>\n\n#include <nav_msgs\/Odometry.h>\n#include <robot_move\/FollowSegment.h>\n#include <ros\/ros.h>\n\nstatic std::shared_ptr<dwb_local_planner::DebugDWBLocalPlanner> planner;\nstatic nav_msgs::OdometryConstPtr lastOdom;\nstatic TFListenerPtr transformer;\nstatic ros::Publisher velPub;\n\nvoid onNewOdometry(nav_msgs::OdometryConstPtr _odom)\n{\n  lastOdom = _odom;\n}\n\nbool followPath(robot_move::FollowSegmentRequest& _req,\n                robot_move::FollowSegmentResponse& _resp)\n{\n  (void)_resp;\n  ros::Rate rate(20);\n  ROS_INFO(\"Starting following path\");\n  planner->setPlan(_req.path);\n  bool stop = false;\n  while(!stop)\n  {\n    if(!transformer->waitForTransform(\"odom\", \"base_link\", ros::Time(0),\n                                      ros::Duration(0.2)))\n    {\n      ROS_ERROR(\"Can't transform from base_link to odom\");\n      return false;\n    }\n    tf::StampedTransform odomToMap;\n    transformer->lookupTransform(\"odom\", \"base_link\", ros::Time(0), odomToMap);\n    nav_2d_msgs::Pose2DStamped robotPoseInMapFrame;\n    robotPoseInMapFrame.header.stamp = odomToMap.stamp_;\n    robotPoseInMapFrame.header.frame_id = odomToMap.frame_id_;\n    robotPoseInMapFrame.pose.x = odomToMap.getOrigin().x();\n    robotPoseInMapFrame.pose.y = odomToMap.getOrigin().y();\n    robotPoseInMapFrame.pose.theta = tf::getYaw(odomToMap.getRotation());\n\n    if(!lastOdom)\n    {\n      ROS_ERROR(\"No last odom\");\n      return false;\n    }\n    if(fabs((lastOdom->header.stamp - ros::Time::now()).toSec()) > 0.5)\n    {\n      ROS_ERROR(\"Too old odometry !\");\n      return false;\n    }\n    ROS_INFO(\"Compute Velocities\");\n    nav_2d_msgs::Twist2D vel;\n    vel.x = lastOdom->twist.twist.linear.x;\n    vel.theta = lastOdom->twist.twist.angular.z;\n    nav_2d_msgs::Twist2DStamped res =\n      planner->computeVelocityCommands(robotPoseInMapFrame, vel);\n\n    geometry_msgs::Twist cmd = nav_2d_utils::twist2Dto3D(res.velocity);\n    velPub.publish(cmd);\n\n    stop = planner->isGoalReached(robotPoseInMapFrame, vel);\n    ros::spinOnce();\n    rate.sleep();\n  }\n  geometry_msgs::Twist zero;\n  velPub.publish(zero);\n  return true;\n}\n\nint main(int argc, char** argv)\n{\n  ros::init(argc, argv, \"plan_node\");\n  planner = std::make_shared<dwb_local_planner::DebugDWBLocalPlanner>();\n  ROS_INFO(\"Plan Node\");\n\n  transformer = std::make_shared<tf::TransformListener>();\n  CostmapROSPtr costmap_ros =\n    std::make_shared<costmap_2d::Costmap2DROS>(\"costmap\", *transformer);\n  planner->initialize(\"dwb_local_planner\", transformer, costmap_ros);\n\n  ros::NodeHandle nh;\n  ROS_INFO(\"Starting \/follow_path service\");\n  auto followTrajService = nh.advertiseService(\"\/follow_path\", &followPath);\n\n  velPub = nh.advertise<geometry_msgs::Twist>(\"\/cmd_vel\", 1);\n\n  ros::Subscriber sub = nh.subscribe(\"odom\", 1, &onNewOdometry);\n  ros::spin();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright 2020 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/core\/tpu\/tpu_api_dlsym_initializer.h\"\n\n#include <dlfcn.h>\n#include <sys\/mman.h>\n#include <sys\/types.h>\n#include <unistd.h>\n\n#include \"tensorflow\/core\/platform\/errors.h\"\n#include \"tensorflow\/core\/platform\/status.h\"\n#include \"tensorflow\/core\/tpu\/tpu_api_dlsym_set_fn.h\"\n\n#if !defined(PLATFORM_GOOGLE)\n#include \"tensorflow\/core\/platform\/cloud\/gcs_file_system.h\"\n#include \"tensorflow\/core\/platform\/env.h\"\n#include \"tensorflow\/core\/tpu\/tpu_api.h\"\n#include \"tensorflow\/core\/tpu\/tpu_initializer_helper.h\"\n#include \"tensorflow\/stream_executor\/tpu\/tpu_platform.h\"\n#endif\n\n\n\/\/ Reminder: Update tpu_library_loader_windows.cc if you are adding new publicly\n\/\/ visible methods.\n\nnamespace tensorflow {\nnamespace tpu {\nnamespace {\n#if defined(PLATFORM_GOOGLE)\nStatus InitializeTpuLibrary(void* library_handle) {\n  return errors::Unimplemented(\"You must statically link in a TPU library.\");\n}\n#else  \/\/ PLATFORM_GOOGLE\n#include \"tensorflow\/core\/tpu\/tpu_library_init_fns.inc\"\n\nStatus InitializeTpuLibrary(void* library_handle) {\n  Status s = InitializeTpuStructFns(library_handle);\n\n  \/\/ Retrieve arguments from environment if applicable\n  std::pair<std::vector<std::string>, std::vector<const char*> > args =\n      GetLibTpuInitArguments();\n\n  \/\/ TPU platform registration must only be performed after the library is\n  \/\/ loaded. We do not want to register a TPU platform in XLA without the\n  \/\/ supporting library providing the necessary APIs.\n  if (s.ok()) {\n    void (*initialize_fn)(bool init_library, int num_args, const char** args);\n    initialize_fn = reinterpret_cast<decltype(initialize_fn)>(\n        dlsym(library_handle, \"TfTpu_Initialize\"));\n    (*initialize_fn)(\/*init_library=*\/true, args.second.size(),\n                     args.second.data());\n\n    RegisterTpuPlatform();\n  }\n\n  return s;\n}\n\nvoid* CreateGcsFilesystemFn() {\n  return new tensorflow::RetryingGcsFileSystem();\n}\n\n\/\/ This is a temporary fix for including GCS file system on TPU builds.\n\/\/ Will be removed once b\/176954917 is fully resolved with the build fix.\nvoid InitializeCreateGcsFileSystemFnPtr() {\n  int fd = shm_open(absl::StrCat(\"\/tmp_tf_gcs_fs_pointer_\", getpid()).data(),\n                    O_CREAT | O_RDWR, S_IRUSR | S_IWUSR);\n  if (fd == -1) {\n    LOG(ERROR) << \"Unable to open shared memory for GCS file system creator.\";\n    return;\n  }\n\n  if (ftruncate(fd, sizeof(tensorflow::FileSystem*)) == -1) {\n    LOG(ERROR)\n        << \"Unable to allocate shared memory for GCS file system creator.\";\n    return;\n  }\n\n  void* (**fn)() = reinterpret_cast<void* (**)()>(mmap(\n      NULL, sizeof(void* (*)()), PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0));\n  if (fn == MAP_FAILED) {\n    LOG(ERROR) << \"Cannot mmap shared memory for GCS file system creator.\";\n    return;\n  }\n\n  *fn = &CreateGcsFilesystemFn;\n\n  munmap(fn, sizeof(void* (*)()));\n  close(fd);\n\n  \/\/ Clean up shared memory on a clean exit.\n  atexit([]() {\n    shm_unlink(absl::StrCat(\"\/tmp_tf_gcs_fs_pointer_\", getpid()).data());\n  });\n}\n\nbool FindAndLoadTpuLibrary() {\n  void* library = dlopen(\"libtpu.so\", RTLD_NOW);\n  if (library) {\n    \/\/ We can open the shared library which means we are in a TPU environment.\n    \/\/ Try to acquire exclusive access.\n    if (TryAcquireTpuLock()) {\n      InitializeTpuLibrary(library);\n    }\n  }\n\n  InitializeCreateGcsFileSystemFnPtr();\n  return true;\n}\n\nstatic bool tpu_library_finder = FindAndLoadTpuLibrary();\n#endif  \/\/ PLATFORM_GOOGLE\n}  \/\/ namespace\n}  \/\/ namespace tpu\n}  \/\/ namespace tensorflow\n<commit_msg>Add some missing headers to tpu_api_dlsym_initializer<commit_after>\/* Copyright 2020 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/core\/tpu\/tpu_api_dlsym_initializer.h\"\n\n#include <dlfcn.h>\n#include <fcntl.h>\n#include <sys\/mman.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <unistd.h>\n\n#include \"tensorflow\/core\/platform\/errors.h\"\n#include \"tensorflow\/core\/platform\/status.h\"\n#include \"tensorflow\/core\/tpu\/tpu_api_dlsym_set_fn.h\"\n\n#if !defined(PLATFORM_GOOGLE)\n#include \"tensorflow\/core\/platform\/cloud\/gcs_file_system.h\"\n#include \"tensorflow\/core\/platform\/env.h\"\n#include \"tensorflow\/core\/tpu\/tpu_api.h\"\n#include \"tensorflow\/core\/tpu\/tpu_initializer_helper.h\"\n#include \"tensorflow\/stream_executor\/tpu\/tpu_platform.h\"\n#endif\n\n\n\/\/ Reminder: Update tpu_library_loader_windows.cc if you are adding new publicly\n\/\/ visible methods.\n\nnamespace tensorflow {\nnamespace tpu {\nnamespace {\n#if defined(PLATFORM_GOOGLE)\nStatus InitializeTpuLibrary(void* library_handle) {\n  return errors::Unimplemented(\"You must statically link in a TPU library.\");\n}\n#else  \/\/ PLATFORM_GOOGLE\n#include \"tensorflow\/core\/tpu\/tpu_library_init_fns.inc\"\n\nStatus InitializeTpuLibrary(void* library_handle) {\n  Status s = InitializeTpuStructFns(library_handle);\n\n  \/\/ Retrieve arguments from environment if applicable\n  std::pair<std::vector<std::string>, std::vector<const char*> > args =\n      GetLibTpuInitArguments();\n\n  \/\/ TPU platform registration must only be performed after the library is\n  \/\/ loaded. We do not want to register a TPU platform in XLA without the\n  \/\/ supporting library providing the necessary APIs.\n  if (s.ok()) {\n    void (*initialize_fn)(bool init_library, int num_args, const char** args);\n    initialize_fn = reinterpret_cast<decltype(initialize_fn)>(\n        dlsym(library_handle, \"TfTpu_Initialize\"));\n    (*initialize_fn)(\/*init_library=*\/true, args.second.size(),\n                     args.second.data());\n\n    RegisterTpuPlatform();\n  }\n\n  return s;\n}\n\nvoid* CreateGcsFilesystemFn() {\n  return new tensorflow::RetryingGcsFileSystem();\n}\n\n\/\/ This is a temporary fix for including GCS file system on TPU builds.\n\/\/ Will be removed once b\/176954917 is fully resolved with the build fix.\nvoid InitializeCreateGcsFileSystemFnPtr() {\n  int fd = shm_open(absl::StrCat(\"\/tmp_tf_gcs_fs_pointer_\", getpid()).data(),\n                    O_CREAT | O_RDWR, S_IRUSR | S_IWUSR);\n  if (fd == -1) {\n    LOG(ERROR) << \"Unable to open shared memory for GCS file system creator.\";\n    return;\n  }\n\n  if (ftruncate(fd, sizeof(tensorflow::FileSystem*)) == -1) {\n    LOG(ERROR)\n        << \"Unable to allocate shared memory for GCS file system creator.\";\n    return;\n  }\n\n  void* (**fn)() = reinterpret_cast<void* (**)()>(mmap(\n      NULL, sizeof(void* (*)()), PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0));\n  if (fn == MAP_FAILED) {\n    LOG(ERROR) << \"Cannot mmap shared memory for GCS file system creator.\";\n    return;\n  }\n\n  *fn = &CreateGcsFilesystemFn;\n\n  munmap(fn, sizeof(void* (*)()));\n  close(fd);\n\n  \/\/ Clean up shared memory on a clean exit.\n  atexit([]() {\n    shm_unlink(absl::StrCat(\"\/tmp_tf_gcs_fs_pointer_\", getpid()).data());\n  });\n}\n\nbool FindAndLoadTpuLibrary() {\n  void* library = dlopen(\"libtpu.so\", RTLD_NOW);\n  if (library) {\n    \/\/ We can open the shared library which means we are in a TPU environment.\n    \/\/ Try to acquire exclusive access.\n    if (TryAcquireTpuLock()) {\n      InitializeTpuLibrary(library);\n    }\n  }\n\n  InitializeCreateGcsFileSystemFnPtr();\n  return true;\n}\n\nstatic bool tpu_library_finder = FindAndLoadTpuLibrary();\n#endif  \/\/ PLATFORM_GOOGLE\n}  \/\/ namespace\n}  \/\/ namespace tpu\n}  \/\/ namespace tensorflow\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: sdabstdlg.cxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-16 18:42: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_sd.hxx\"\n\n#include \"sdabstdlg.hxx\"\n#include \"sduilib.hxx\"\n\n#include <osl\/module.hxx>\n#include <tools\/string.hxx>\n\ntypedef SdAbstractDialogFactory* (__LOADONCALLAPI *SdFuncPtrCreateDialogFactory)();\n\nSdAbstractDialogFactory* SdAbstractDialogFactory::Create()\n{\n    SdFuncPtrCreateDialogFactory fp = 0;\n    static ::osl::Module aDialogLibrary;\n    if ( aDialogLibrary.is() || aDialogLibrary.load( String( RTL_CONSTASCII_USTRINGPARAM( DLL_NAME ) ) ) )\n        fp = ( SdAbstractDialogFactory* (__LOADONCALLAPI*)() )\n            aDialogLibrary.getSymbol( ::rtl::OUString::createFromAscii(\"CreateDialogFactory\") );\n    if ( fp )\n        return fp();\n    return 0;\n}\n\n\n<commit_msg>INTEGRATION: CWS sdwarningsbegone (1.4.38); FILE MERGED 2006\/11\/27 13:47:59 cl 1.4.38.1: #i69285# warning free code changes for sd project<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: sdabstdlg.cxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: kz $ $Date: 2006-12-12 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_sd.hxx\"\n\n#include \"sdabstdlg.hxx\"\n#include \"sduilib.hxx\"\n\n#include <osl\/module.hxx>\n#include <tools\/string.hxx>\n\ntypedef SdAbstractDialogFactory* (__LOADONCALLAPI *SdFuncPtrCreateDialogFactory)();\n\nSdAbstractDialogFactory* SdAbstractDialogFactory::Create()\n{\n    SdFuncPtrCreateDialogFactory fp = 0;\n    static ::osl::Module aDialogLibrary;\n    if ( aDialogLibrary.is() || aDialogLibrary.load( String( RTL_CONSTASCII_USTRINGPARAM( DLL_NAME ) ) ) )\n        fp = ( SdAbstractDialogFactory* (__LOADONCALLAPI*)() )\n            aDialogLibrary.getFunctionSymbol( ::rtl::OUString::createFromAscii(\"CreateDialogFactory\") );\n    if ( fp )\n        return fp();\n    return 0;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: fuconnct.cxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: rt $ $Date: 2007-04-26 08:37: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_sd.hxx\"\n\n\n\n#include \"fuconnct.hxx\"\n\n#ifndef _SFXREQUEST_HXX \/\/autogen\n#include <sfx2\/request.hxx>\n#endif\n#ifndef _SV_MSGBOX_HXX \/\/autogen\n#include <vcl\/msgbox.hxx>\n#endif\n\n#ifndef SD_VIEW_HXX\n#include \"View.hxx\"\n#endif\n#ifndef SD_VIEW_SHELL_HXX\n#include \"ViewShell.hxx\"\n#endif\n#include \"drawdoc.hxx\"\n#include <svx\/svxdlg.hxx>\n#include <svx\/dialogs.hrc>\n\nnamespace sd {\n\nTYPEINIT1( FuConnectionDlg, FuPoor );\n\n\/*************************************************************************\n|*\n|* Konstruktor\n|*\n\\************************************************************************\/\n\nFuConnectionDlg::FuConnectionDlg (\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}\n\nFunctionReference FuConnectionDlg::Create( ViewShell* pViewSh, ::sd::Window* pWin, ::sd::View* pView, SdDrawDocument* pDoc, SfxRequest& rReq )\n{\n    FunctionReference xFunc( new FuConnectionDlg( pViewSh, pWin, pView, pDoc, rReq ) );\n    xFunc->DoExecute(rReq);\n    return xFunc;\n}\n\nvoid FuConnectionDlg::DoExecute( SfxRequest& rReq )\n{\n    SfxItemSet aNewAttr( mpDoc->GetPool() );\n    mpView->GetAttributes( aNewAttr );\n\n    const SfxItemSet* pArgs = rReq.GetArgs();\n\n    if( !pArgs )\n    {\n        SvxAbstractDialogFactory* pFact = SvxAbstractDialogFactory::Create();\n        ::std::auto_ptr<AbstractSfxSingleTabDialog> pDlg( pFact ? pFact->CreateSfxSingleTabDialog( NULL, aNewAttr, mpView, RID_SVXPAGE_CONNECTION) : 0);\n\n        if( pDlg.get() && (pDlg->Execute() == RET_OK) )\n        {\n            rReq.Done( *pDlg->GetOutputItemSet() );\n            pArgs = rReq.GetArgs();\n        }\n    }\n    if( pArgs )\n        mpView->SetAttributes( *pArgs );\n}\n\n} \/\/ end of namespace sd\n<commit_msg>INTEGRATION: CWS changefileheader (1.9.222); FILE MERGED 2008\/04\/01 15:34:31 thb 1.9.222.3: #i85898# Stripping all external header guards 2008\/04\/01 12:38:52 thb 1.9.222.2: #i85898# Stripping all external header guards 2008\/03\/31 13:58:04 rt 1.9.222.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: fuconnct.cxx,v $\n * $Revision: 1.10 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org.  If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sd.hxx\"\n\n\n\n#include \"fuconnct.hxx\"\n#include <sfx2\/request.hxx>\n#include <vcl\/msgbox.hxx>\n#include \"View.hxx\"\n#include \"ViewShell.hxx\"\n#include \"drawdoc.hxx\"\n#include <svx\/svxdlg.hxx>\n#include <svx\/dialogs.hrc>\n\nnamespace sd {\n\nTYPEINIT1( FuConnectionDlg, FuPoor );\n\n\/*************************************************************************\n|*\n|* Konstruktor\n|*\n\\************************************************************************\/\n\nFuConnectionDlg::FuConnectionDlg (\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}\n\nFunctionReference FuConnectionDlg::Create( ViewShell* pViewSh, ::sd::Window* pWin, ::sd::View* pView, SdDrawDocument* pDoc, SfxRequest& rReq )\n{\n    FunctionReference xFunc( new FuConnectionDlg( pViewSh, pWin, pView, pDoc, rReq ) );\n    xFunc->DoExecute(rReq);\n    return xFunc;\n}\n\nvoid FuConnectionDlg::DoExecute( SfxRequest& rReq )\n{\n    SfxItemSet aNewAttr( mpDoc->GetPool() );\n    mpView->GetAttributes( aNewAttr );\n\n    const SfxItemSet* pArgs = rReq.GetArgs();\n\n    if( !pArgs )\n    {\n        SvxAbstractDialogFactory* pFact = SvxAbstractDialogFactory::Create();\n        ::std::auto_ptr<AbstractSfxSingleTabDialog> pDlg( pFact ? pFact->CreateSfxSingleTabDialog( NULL, aNewAttr, mpView, RID_SVXPAGE_CONNECTION) : 0);\n\n        if( pDlg.get() && (pDlg->Execute() == RET_OK) )\n        {\n            rReq.Done( *pDlg->GetOutputItemSet() );\n            pArgs = rReq.GetArgs();\n        }\n    }\n    if( pArgs )\n        mpView->SetAttributes( *pArgs );\n}\n\n} \/\/ end of namespace sd\n<|endoftext|>"}
{"text":"<commit_before>\/* This file is part of Mapnik (c++ mapping toolkit)\n * Copyright (C) 2005 Artem Pavlenko\n *\n * Mapnik 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 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\/\/$Id$\n\n#ifndef EXPRESSION_HPP\n#define EXPRESSION_HPP\n\n#include \"value.hpp\"\n#include \"filter_visitor.hpp\"\n\nnamespace mapnik\n{\n    template <typename FeatureT> class filter_visitor;\n    template <typename FeatureT>\n    struct expression\n    {\n\tvirtual value get_value(FeatureT const& feature) const=0;\n\tvirtual void accept(filter_visitor<FeatureT>& v)=0;\n\tvirtual expression<FeatureT>* clone() const=0;\n\tvirtual std::string to_string() const=0;\n\tvirtual ~expression() {}\n    };\n\n    template <typename FeatureT> \n    class literal : public expression<FeatureT>\n    {\n    public:\n\tliteral(int val)\n\t    : expression<FeatureT>(),\n\t      value_(val) {}\n\tliteral(double val)\n\t    : expression<FeatureT>(),\n\t      value_(val) {}\n\tliteral(std::string const& val)\n\t    : expression<FeatureT>(),\n\t      value_(val) {}\n\tliteral(literal const& other)\n\t    : expression<FeatureT>(),\n\t      value_(other.value_) {}\n\t\n\tvalue get_value(FeatureT const& \/*feature*\/) const\n\t{\n\t    return value_;\n\t}\n\tvoid accept(filter_visitor<FeatureT>& v)\n\t{\n\t    v.visit(*this);\n\t}\n\texpression<FeatureT>* clone() const\n\t{\n\t    return new literal(*this); \n\t}\n\tstd::string to_string() const\n\t{\n\t    return \"'\"+value_.to_string()+\"'\";\n\t}\n        ~literal() {}\n    private:\n\tvalue value_;\n\t\n    };\n  \n\n    template <typename FeatureT> \n    class property : public expression<FeatureT>\n    {\n    public:\n\tproperty(std::string const& name)\n\t    : expression<FeatureT>(),\n\t      name_(name),\n\t      index_(0),\n\t      valid_(false) {}\n\t\n\tproperty(property const& other)\n\t    : expression<FeatureT>(),\n\t      name_(other.name_),\n\t      index_(other.index_),\n\t      valid_(other.valid_) {}\n\n\tvalue get_value(FeatureT const& feature) const\n\t{\n\t    return feature.get_property(index_);\n\t}\n\tvoid accept(filter_visitor<FeatureT>& v)\n\t{\n\t    v.visit(*this);\n\t}\n\texpression<FeatureT>* clone() const\n\t{\n\t    return new property(*this); \n\t}\n\tstd::string const& name() const\n\t{\n\t    return name_;\n\t}\n\tvoid set_index(size_t index) \n\t{\n\t    index_=index;\n\t    valid_=true;\n\t}\n\tstd::string to_string() const\n\t{\n\t    return \"[\"+name_+\"]\";\n\t}\n        ~property() {}\n    private:\n\tstd::string name_;\n\tsize_t index_;\n\tbool valid_;\n    };\n}\n\n#endif \/\/EXPRESSION_HPP\n<commit_msg> fixed to_string() method for filter expressions<commit_after>\/* This file is part of Mapnik (c++ mapping toolkit)\n * Copyright (C) 2005 Artem Pavlenko\n *\n * Mapnik 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 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\/\/$Id$\n\n#ifndef EXPRESSION_HPP\n#define EXPRESSION_HPP\n\n#include \"value.hpp\"\n#include \"filter_visitor.hpp\"\n\nnamespace mapnik\n{\n    template <typename FeatureT> class filter_visitor;\n    template <typename FeatureT>\n    struct expression\n    {\n\tvirtual value get_value(FeatureT const& feature) const=0;\n\tvirtual void accept(filter_visitor<FeatureT>& v)=0;\n\tvirtual expression<FeatureT>* clone() const=0;\n\tvirtual std::string to_string() const=0;\n\tvirtual ~expression() {}\n    };\n\n    template <typename FeatureT> \n    class literal : public expression<FeatureT>\n    {\n    public:\n\tliteral(int val)\n\t    : expression<FeatureT>(),\n\t      value_(val) {}\n\tliteral(double val)\n\t    : expression<FeatureT>(),\n\t      value_(val) {}\n\tliteral(std::string const& val)\n\t    : expression<FeatureT>(),\n\t      value_(val) {}\n\tliteral(literal const& other)\n\t    : expression<FeatureT>(),\n\t      value_(other.value_) {}\n\t\n\tvalue get_value(FeatureT const& \/*feature*\/) const\n\t{\n\t    return value_;\n\t}\n\tvoid accept(filter_visitor<FeatureT>& v)\n\t{\n\t    v.visit(*this);\n\t}\n\texpression<FeatureT>* clone() const\n\t{\n\t    return new literal(*this); \n\t}\n\tstd::string to_string() const\n\t{\n\t    return value_.to_string();\n\t}\n        ~literal() {}\n    private:\n\tvalue value_;\n    };\n  \n\n    template <typename FeatureT> \n    class property : public expression<FeatureT>\n    {\n    public:\n\tproperty(std::string const& name)\n\t    : expression<FeatureT>(),\n\t      name_(name),\n\t      index_(0),\n\t      valid_(false) {}\n\t\n\tproperty(property const& other)\n\t    : expression<FeatureT>(),\n\t      name_(other.name_),\n\t      index_(other.index_),\n\t      valid_(other.valid_) {}\n\n\tvalue get_value(FeatureT const& feature) const\n\t{\n\t    return feature.get_property(index_);\n\t}\n\tvoid accept(filter_visitor<FeatureT>& v)\n\t{\n\t    v.visit(*this);\n\t}\n\texpression<FeatureT>* clone() const\n\t{\n\t    return new property(*this); \n\t}\n\tstd::string const& name() const\n\t{\n\t    return name_;\n\t}\n\tvoid set_index(size_t index) \n\t{\n\t    index_=index;\n\t    valid_=true;\n\t}\n\tstd::string to_string() const\n\t{\n\t    return \"[\"+name_+\"]\";\n\t}\n        ~property() {}\n    private:\n\tstd::string name_;\n\tsize_t index_;\n\tbool valid_;\n    };\n}\n\n#endif \/\/EXPRESSION_HPP\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 \"SkTypes.h\"\n\n#if SK_SUPPORT_GPU\n\n#include \"GrContext.h\"\n#include \"GrContextFactory.h\"\n#include \"SkBitmap.h\"\n#include \"SkCanvas.h\"\n#include \"SkColor.h\"\n#include \"SkPaint.h\"\n#include \"SkRRect.h\"\n#include \"SkRect.h\"\n#include \"SkSurface.h\"\n#include \"Test.h\"\n\nstatic void test_drawPathEmpty(skiatest::Reporter*, SkCanvas* canvas) {\n    \/\/ Filling an empty path should not crash.\n    SkPaint paint;\n    canvas->drawRect(SkRect(), paint);\n    canvas->drawPath(SkPath(), paint);\n    canvas->drawOval(SkRect(), paint);\n    canvas->drawRect(SkRect(), paint);\n    canvas->drawRRect(SkRRect(), paint);\n\n    \/\/ Stroking an empty path should not crash.\n    paint.setAntiAlias(true);\n    paint.setStyle(SkPaint::kStroke_Style);\n    paint.setColor(SK_ColorGRAY);\n    paint.setStrokeWidth(SkIntToScalar(20));\n    paint.setStrokeJoin(SkPaint::kRound_Join);\n    canvas->drawRect(SkRect(), paint);\n    canvas->drawPath(SkPath(), paint);\n    canvas->drawOval(SkRect(), paint);\n    canvas->drawRect(SkRect(), paint);\n    canvas->drawRRect(SkRRect(), paint);\n}\n\n\nDEF_GPUTEST(GpuDrawPath, reporter, factory) {\n    return;\n\n    for (int type = 0; type < GrContextFactory::kLastGLContextType; ++type) {\n        GrContextFactory::GLContextType glType = static_cast<GrContextFactory::GLContextType>(type);\n\n        GrContext* grContext = factory->get(glType);\n        if (nullptr == grContext) {\n            continue;\n        }\n        static const int sampleCounts[] = { 0, 4, 16 };\n\n        for (size_t i = 0; i < SK_ARRAY_COUNT(sampleCounts); ++i) {\n            SkImageInfo info = SkImageInfo::MakeN32Premul(255, 255);\n            \n            SkAutoTUnref<SkSurface> surface(\n                SkSurface::NewRenderTarget(grContext, SkSurface::kNo_Budgeted, info,\n                                           sampleCounts[i], nullptr));\n            test_drawPathEmpty(reporter, surface->getCanvas());\n        }\n    }\n}\n\n#endif\n<commit_msg>Enable temporarily disabled GpuDrawPathTest<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 \"SkTypes.h\"\n\n#if SK_SUPPORT_GPU\n\n#include \"GrContext.h\"\n#include \"GrContextFactory.h\"\n#include \"SkBitmap.h\"\n#include \"SkCanvas.h\"\n#include \"SkColor.h\"\n#include \"SkPaint.h\"\n#include \"SkRRect.h\"\n#include \"SkRect.h\"\n#include \"SkSurface.h\"\n#include \"Test.h\"\n\nstatic void test_drawPathEmpty(skiatest::Reporter*, SkCanvas* canvas) {\n    \/\/ Filling an empty path should not crash.\n    SkPaint paint;\n    canvas->drawRect(SkRect(), paint);\n    canvas->drawPath(SkPath(), paint);\n    canvas->drawOval(SkRect(), paint);\n    canvas->drawRect(SkRect(), paint);\n    canvas->drawRRect(SkRRect(), paint);\n\n    \/\/ Stroking an empty path should not crash.\n    paint.setAntiAlias(true);\n    paint.setStyle(SkPaint::kStroke_Style);\n    paint.setColor(SK_ColorGRAY);\n    paint.setStrokeWidth(SkIntToScalar(20));\n    paint.setStrokeJoin(SkPaint::kRound_Join);\n    canvas->drawRect(SkRect(), paint);\n    canvas->drawPath(SkPath(), paint);\n    canvas->drawOval(SkRect(), paint);\n    canvas->drawRect(SkRect(), paint);\n    canvas->drawRRect(SkRRect(), paint);\n}\n\n\nDEF_GPUTEST(GpuDrawPath, reporter, factory) {\n    for (int type = 0; type < GrContextFactory::kLastGLContextType; ++type) {\n        GrContextFactory::GLContextType glType = static_cast<GrContextFactory::GLContextType>(type);\n\n        GrContext* grContext = factory->get(glType);\n        if (nullptr == grContext) {\n            continue;\n        }\n        static const int sampleCounts[] = { 0, 4, 16 };\n\n        for (size_t i = 0; i < SK_ARRAY_COUNT(sampleCounts); ++i) {\n            SkImageInfo info = SkImageInfo::MakeN32Premul(255, 255);\n            \n            SkAutoTUnref<SkSurface> surface(\n                SkSurface::NewRenderTarget(grContext, SkSurface::kNo_Budgeted, info,\n                                           sampleCounts[i], nullptr));\n            test_drawPathEmpty(reporter, surface->getCanvas());\n        }\n    }\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>WaE: Fix bool sillyness<commit_after><|endoftext|>"}
{"text":"<commit_before>\/**\n * The MIT License (MIT)\n *\n * Copyright (c) 2015 Nathan Osman\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and\/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n *\/\n\n#include <QBuffer>\n#include <QList>\n#include <QPair>\n#include <QSignalSpy>\n#include <QTest>\n\n#include \"common\/qiodevicecounter.h\"\n#include \"common\/qsocketpair.h\"\n#include \"qhttpengine.h\"\n#include \"qhttpsocket.h\"\n#include \"qiodevicecopier.h\"\n\ntypedef QPair<QByteArray, QByteArray> Header;\ntypedef QList<Header> HeaderList;\n\nconst QByteArray TestData = \"test\";\n\nclass TestQHttpSocket : public QObject\n{\n    Q_OBJECT\n\nprivate Q_SLOTS:\n\n    void initTestCase();\n\n    void testRequestProperties_data();\n    void testRequestProperties();\n\n    void testResponseProperties_data();\n    void testResponseProperties();\n\n    void testRead();\n    void testWrite();\n\n};\n\nvoid TestQHttpSocket::initTestCase()\n{\n    qRegisterMetaType<QHttpSocket::Error>(\"Error\");\n}\n\nvoid TestQHttpSocket::testRequestProperties_data()\n{\n    QTest::addColumn<QByteArray>(\"data\");\n    QTest::addColumn<QHttpSocket::Error>(\"error\");\n    QTest::addColumn<QByteArray>(\"method\");\n    QTest::addColumn<QByteArray>(\"path\");\n    QTest::addColumn<HeaderList>(\"headers\");\n\n    QTest::newRow(\"simple GET\")\n            << QByteArray(\"GET \/test HTTP\/1.0\\r\\n\\r\\n\")\n            << QHttpSocket::NoError\n            << QByteArray(\"GET\")\n            << QByteArray(\"\/test\")\n            << HeaderList();\n\n    QTest::newRow(\"request header\")\n            << QByteArray(\"GET \/ HTTP\/1.0\\r\\nX-Test: test\\r\\n\\r\\n\")\n            << QHttpSocket::NoError\n            << QByteArray(\"GET\")\n            << QByteArray(\"\/\")\n            << (HeaderList() << Header(\"X-Test\", \"test\"));\n\n    QTest::newRow(\"malformed request line\")\n            << QByteArray(\"test\\r\\n\\r\\n\")\n            << QHttpSocket::MalformedRequestLine;\n\n    QTest::newRow(\"malformed request header\")\n            << QByteArray(\"GET \/ HTTP\/1.0\\r\\ntest\\r\\n\\r\\n\")\n            << QHttpSocket::MalformedRequestHeader;\n\n    QTest::newRow(\"invalid HTTP version\")\n            << QByteArray(\"GET \/ HTTP\/1.2\\r\\n\\r\\n\")\n            << QHttpSocket::InvalidHttpVersion;\n}\n\nvoid TestQHttpSocket::testRequestProperties()\n{\n    QFETCH(QByteArray, data);\n    QFETCH(QHttpSocket::Error, error);\n\n    QBuffer buffer(&data);\n    buffer.open(QIODevice::ReadOnly);\n\n    QHttpSocket socket(&buffer);\n\n    if(error == QHttpSocket::NoError) {\n\n        QFETCH(QByteArray, method);\n        QFETCH(QByteArray, path);\n        QFETCH(HeaderList, headers);\n\n        QTRY_VERIFY(socket.headersParsed());\n\n        QCOMPARE(socket.method(), method);\n        QCOMPARE(socket.path(), path);\n        QCOMPARE(socket.headers().count(), headers.count());\n        foreach(Header header, headers) {\n           QCOMPARE(socket.header(header.first), header.second);\n        }\n\n    } else {\n\n        QSignalSpy errorSpy(&socket, SIGNAL(errorChanged(Error)));\n\n        QTRY_COMPARE(errorSpy.count(), 1);\n        QCOMPARE(socket.error(), error);\n    }\n}\n\nvoid TestQHttpSocket::testResponseProperties_data()\n{\n    QTest::addColumn<QByteArray>(\"statusLine\");\n    QTest::addColumn<QByteArray>(\"statusCode\");\n    QTest::addColumn<HeaderList>(\"headers\");\n    QTest::addColumn<QByteArray>(\"data\");\n\n    QTest::newRow(\"default values\")\n            << QByteArray(\"HTTP\/1.0 200 OK\")\n            << QByteArray()\n            << HeaderList()\n            << QByteArray();\n\n    QTest::newRow(\"status code\")\n            << QByteArray(\"HTTP\/1.0 404 FILE NOT FOUND\")\n            << QByteArray(\"404 FILE NOT FOUND\")\n            << HeaderList()\n            << QByteArray();\n\n    QTest::newRow(\"response header\")\n            << QByteArray(\"HTTP\/1.0 200 OK\")\n            << QByteArray()\n            << (HeaderList() << Header(\"X-Test1\", \"test\") << Header(\"X-Test2\", \"test\"))\n            << QByteArray();\n\n    QTest::newRow(\"data\")\n            << QByteArray(\"HTTP\/1.0 200 OK\")\n            << QByteArray()\n            << HeaderList()\n            << TestData;\n}\n\nvoid TestQHttpSocket::testResponseProperties()\n{\n    QFETCH(QByteArray, statusLine);\n    QFETCH(QByteArray, statusCode);\n    QFETCH(HeaderList, headers);\n    QFETCH(QByteArray, data);\n\n    QSocketPair pair;\n    QTRY_VERIFY(pair.isConnected());\n    QHttpSocket socket(pair.server());\n\n    if(!statusCode.isNull()) {\n        socket.setStatusCode(statusCode);\n    }\n\n    foreach(Header header, headers) {\n        socket.setHeader(header.first, header.second);\n    }\n\n    \/\/ Create a buffer for storing data received by the HTTP client\n    QByteArray bufferData;\n    QBuffer buffer(&bufferData);\n    buffer.open(QIODevice::WriteOnly);\n\n    \/\/ Copy data from the client into the buffer as it becomes available\n    QIODeviceCopier copier(pair.client(), &buffer);\n    copier.start();\n\n    \/\/ Write the headers and wait until they are received by the client\n    socket.writeHeaders();\n    QTRY_VERIFY(bufferData.indexOf(\"\\r\\n\\r\\n\") != -1);\n\n    \/\/ If data was provided, write it and read it back from the client\n    if(!data.isNull()) {\n\n        \/\/ Store the length of the headers\n        qint64 headerLength = bufferData.length();\n\n        \/\/ Write the data to the socket, counting the amount written\n        QIODeviceCounter counter(&socket);\n        socket.write(data);\n\n        \/\/ Verify that the expected amount was written and read\n        QTRY_COMPARE(counter.bytesWritten(), data.length());\n        QTRY_COMPARE(bufferData.length(),  headerLength + data.length());\n    }\n\n    \/\/ Split the response into fragments and compare the expected values\n    QList<QByteArray> parts = QHttpEngine::split(bufferData, \"\\r\\n\\r\\n\", 1);\n    QList<QByteArray> lines = QHttpEngine::split(parts.at(0), \"\\r\\n\");\n\n    QCOMPARE(lines.takeFirst(), statusLine);\n    QCOMPARE(lines.count(), headers.count());\n\n    foreach(Header header, headers) {\n        QVERIFY(lines.contains(header.first + \": \" + header.second));\n    }\n\n    QCOMPARE(parts.at(1), data);\n}\n\nvoid TestQHttpSocket::testRead()\n{\n    QSocketPair pair;\n    QTRY_VERIFY(pair.isConnected());\n\n    QHttpSocket socket(pair.server());\n\n    QSignalSpy hPChangedSpy(&socket, SIGNAL(headersParsedChanged(bool)));\n    QSignalSpy readyReadSpy(&socket, SIGNAL(readyRead()));\n\n    pair.client()->write(\"POST \/test HTTP\/1.0\\r\\n\\r\\n\");\n\n    QTRY_COMPARE(hPChangedSpy.count(), 1);\n    QTRY_COMPARE(readyReadSpy.count(), 0);\n\n    pair.client()->write(TestData);\n\n    QTRY_COMPARE(readyReadSpy.count(), 1);\n\n    QCOMPARE(socket.bytesAvailable(), TestData.length());\n    QCOMPARE(socket.readAll(), TestData);\n}\n\nvoid TestQHttpSocket::testWrite()\n{\n    QByteArray data;\n    QBuffer buffer(&data);\n    buffer.open(QIODevice::ReadWrite);\n\n    QHttpSocket socket(&buffer);\n    QSignalSpy bytesWrittenSpy(&socket, SIGNAL(bytesWritten(qint64)));\n\n    socket.writeHeaders();\n    QCOMPARE(bytesWrittenSpy.count(), 0);\n\n    socket.write(TestData);\n\n    QTRY_COMPARE(bytesWrittenSpy.count(), 1);\n    QCOMPARE(bytesWrittenSpy.at(0).at(0).toLongLong(), TestData.length());\n}\n\nQTEST_MAIN(TestQHttpSocket)\n#include \"TestQHttpSocket.moc\"\n<commit_msg>Reorganized tests for QHttpSocket.<commit_after>\/**\n * The MIT License (MIT)\n *\n * Copyright (c) 2015 Nathan Osman\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and\/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n *\/\n\n#include <QBuffer>\n#include <QList>\n#include <QPair>\n#include <QSignalSpy>\n#include <QTest>\n\n#include \"common\/qiodevicecounter.h\"\n#include \"common\/qsocketpair.h\"\n#include \"qhttpengine.h\"\n#include \"qhttpsocket.h\"\n#include \"qiodevicecopier.h\"\n\ntypedef QPair<QByteArray, QByteArray> Header;\ntypedef QList<Header> HeaderList;\n\nconst QByteArray TestData = \"test\";\n\nclass TestQHttpSocket : public QObject\n{\n    Q_OBJECT\n\nprivate Q_SLOTS:\n\n    void initTestCase();\n\n    void testRequest_data();\n    void testRequest();\n\n    void testResponse_data();\n    void testResponse();\n};\n\nvoid TestQHttpSocket::initTestCase()\n{\n    qRegisterMetaType<QHttpSocket::Error>(\"Error\");\n}\n\nvoid TestQHttpSocket::testRequest_data()\n{\n    QTest::addColumn<QByteArray>(\"request\");\n    QTest::addColumn<QHttpSocket::Error>(\"error\");\n    QTest::addColumn<QByteArray>(\"method\");\n    QTest::addColumn<QByteArray>(\"path\");\n    QTest::addColumn<HeaderList>(\"headers\");\n    QTest::addColumn<QByteArray>(\"data\");\n\n    QTest::newRow(\"simple GET\")\n            << QByteArray(\"GET \/test HTTP\/1.0\\r\\n\\r\\n\")\n            << QHttpSocket::NoError\n            << QByteArray(\"GET\")\n            << QByteArray(\"\/test\")\n            << HeaderList()\n            << QByteArray();\n\n    QTest::newRow(\"request header\")\n            << QByteArray(\"GET \/ HTTP\/1.0\\r\\nX-Test1: test\\r\\nX-Test2: test\\r\\n\\r\\n\")\n            << QHttpSocket::NoError\n            << QByteArray(\"GET\")\n            << QByteArray(\"\/\")\n            << (HeaderList() << Header(\"X-Test1\", \"test\") << Header(\"X-Test2\", \"test\"))\n            << QByteArray();\n\n    QTest::newRow(\"data\")\n            << QByteArray(\"POST \/ HTTP\/1.0\\r\\n\\r\\n\")\n            << QHttpSocket::NoError\n            << QByteArray(\"POST\")\n            << QByteArray(\"\/\")\n            << HeaderList()\n            << TestData;\n\n    QTest::newRow(\"malformed request line\")\n            << QByteArray(\"test\\r\\n\\r\\n\")\n            << QHttpSocket::MalformedRequestLine;\n\n    QTest::newRow(\"malformed request header\")\n            << QByteArray(\"GET \/ HTTP\/1.0\\r\\ntest\\r\\n\\r\\n\")\n            << QHttpSocket::MalformedRequestHeader;\n\n    QTest::newRow(\"invalid HTTP version\")\n            << QByteArray(\"GET \/ HTTP\/1.2\\r\\n\\r\\n\")\n            << QHttpSocket::InvalidHttpVersion;\n}\n\nvoid TestQHttpSocket::testRequest()\n{\n    QFETCH(QByteArray, request);\n    QFETCH(QHttpSocket::Error, error);\n\n    QSocketPair pair;\n    QTRY_VERIFY(pair.isConnected());\n    QHttpSocket socket(pair.server());\n\n    pair.client()->write(request);\n\n    if(error == QHttpSocket::NoError) {\n\n        QFETCH(QByteArray, method);\n        QFETCH(QByteArray, path);\n        QFETCH(HeaderList, headers);\n        QFETCH(QByteArray, data);\n\n        \/\/ Ensure that the headersParsedChanged() signal is emitted\n        QSignalSpy hPChangedSpy(&socket, SIGNAL(headersParsedChanged(bool)));\n        QTRY_COMPARE(hPChangedSpy.count(), 1);\n\n        \/\/ Compare the parsed properties to their proper values\n        QCOMPARE(socket.method(), method);\n        QCOMPARE(socket.path(), path);\n        QCOMPARE(socket.headers().count(), headers.count());\n\n        foreach(Header header, headers) {\n           QCOMPARE(socket.header(header.first), header.second);\n        }\n\n        \/\/...\n        if(!data.isNull()) {\n\n            pair.client()->write(data);\n\n            QTRY_COMPARE(socket.bytesAvailable(), data.length());\n            QCOMPARE(socket.readAll(), data);\n        }\n\n    } else {\n\n        QSignalSpy errorSpy(&socket, SIGNAL(errorChanged(Error)));\n        QTRY_COMPARE(errorSpy.count(), 1);\n\n        QCOMPARE(socket.error(), error);\n    }\n}\n\nvoid TestQHttpSocket::testResponse_data()\n{\n    QTest::addColumn<QByteArray>(\"statusLine\");\n    QTest::addColumn<QByteArray>(\"statusCode\");\n    QTest::addColumn<HeaderList>(\"headers\");\n    QTest::addColumn<QByteArray>(\"data\");\n\n    QTest::newRow(\"default values\")\n            << QByteArray(\"HTTP\/1.0 200 OK\")\n            << QByteArray()\n            << HeaderList()\n            << QByteArray();\n\n    QTest::newRow(\"status code\")\n            << QByteArray(\"HTTP\/1.0 404 FILE NOT FOUND\")\n            << QByteArray(\"404 FILE NOT FOUND\")\n            << HeaderList()\n            << QByteArray();\n\n    QTest::newRow(\"response header\")\n            << QByteArray(\"HTTP\/1.0 200 OK\")\n            << QByteArray()\n            << (HeaderList() << Header(\"X-Test1\", \"test\") << Header(\"X-Test2\", \"test\"))\n            << QByteArray();\n\n    QTest::newRow(\"data\")\n            << QByteArray(\"HTTP\/1.0 200 OK\")\n            << QByteArray()\n            << HeaderList()\n            << TestData;\n}\n\nvoid TestQHttpSocket::testResponse()\n{\n    QFETCH(QByteArray, statusLine);\n    QFETCH(QByteArray, statusCode);\n    QFETCH(HeaderList, headers);\n    QFETCH(QByteArray, data);\n\n    QSocketPair pair;\n    QTRY_VERIFY(pair.isConnected());\n    QHttpSocket socket(pair.server());\n\n    if(!statusCode.isNull()) {\n        socket.setStatusCode(statusCode);\n    }\n\n    foreach(Header header, headers) {\n        socket.setHeader(header.first, header.second);\n    }\n\n    \/\/ Create a buffer for storing data received by the HTTP client\n    QByteArray bufferData;\n    QBuffer buffer(&bufferData);\n    buffer.open(QIODevice::WriteOnly);\n\n    \/\/ Copy data from the client into the buffer as it becomes available\n    QIODeviceCopier copier(pair.client(), &buffer);\n    copier.start();\n\n    \/\/ Write the headers and wait until they are received by the client\n    socket.writeHeaders();\n    QTRY_VERIFY(bufferData.indexOf(\"\\r\\n\\r\\n\") != -1);\n\n    \/\/ If data was provided, write it and read it back from the client\n    if(!data.isNull()) {\n\n        \/\/ Store the length of the headers\n        qint64 headerLength = bufferData.length();\n\n        \/\/ Write the data to the socket, counting the amount written\n        QIODeviceCounter counter(&socket);\n        socket.write(data);\n\n        \/\/ Verify that the expected amount was written and read\n        QTRY_COMPARE(counter.bytesWritten(), data.length());\n        QTRY_COMPARE(bufferData.length(),  headerLength + data.length());\n    }\n\n    \/\/ Split the response into fragments and compare the expected values\n    QList<QByteArray> parts = QHttpEngine::split(bufferData, \"\\r\\n\\r\\n\", 1);\n    QList<QByteArray> lines = QHttpEngine::split(parts.at(0), \"\\r\\n\");\n\n    QCOMPARE(lines.takeFirst(), statusLine);\n    QCOMPARE(lines.count(), headers.count());\n\n    foreach(Header header, headers) {\n        QVERIFY(lines.contains(header.first + \": \" + header.second));\n    }\n\n    if(!data.isNull()) {\n        QCOMPARE(parts.at(1), data);\n    }\n}\n\nQTEST_MAIN(TestQHttpSocket)\n#include \"TestQHttpSocket.moc\"\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Timers: install timer<commit_after><|endoftext|>"}
{"text":"<commit_before>#ifndef _SDD_HOM_SATURATION_FIXPOINT_HH_\n#define _SDD_HOM_SATURATION_FIXPOINT_HH_\n\n#include <algorithm>  \/\/ all_of, copy\n#include <iosfwd>\n#include <stdexcept>  \/\/invalid_argument\n#include <vector>\n\n#include <boost\/container\/flat_set.hpp>\n\n#include \"sdd\/dd\/definition.hh\"\n#include \"sdd\/hom\/context_fwd.hh\"\n#include \"sdd\/hom\/definition_fwd.hh\"\n#include \"sdd\/hom\/identity.hh\"\n#include \"sdd\/hom\/local.hh\"\n\nnamespace sdd { namespace hom {\n\n\/*-------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @cond INTERNAL_DOC\n\n\/\/\/ @brief Saturation Fixpoint homomorphism.\ntemplate <typename C>\nclass saturation_fixpoint\n{\npublic:\n\n  \/\/\/ @brief The variable type.\n  typedef typename C::Variable variable_type;\n\n  \/\/\/ @brief The type of the homomorphism G part.\n  typedef boost::container::flat_set<homomorphism<C>> g_type;\n\nprivate:\n\n  \/\/\/ @brief The variable on which this sum works.\n  const variable_type variable_;\n\n  \/\/\/ @brief The homomorphism's F part.\n  const homomorphism<C> F_;\n\n  \/\/\/ @brief The homomorphism's G part.\n  const g_type G_;\n\n  \/\/\/ @brief The homomorphism's L part.\n  const homomorphism<C> L_;\n\npublic:\n\n  \/\/\/ @brief Constructor.\n  saturation_fixpoint( const variable_type& var, const homomorphism<C>& f, g_type&& g\n                     , const homomorphism<C>& l)\n    : variable_(var)\n    , F_(f)\n    , G_(std::move(g))\n    , L_(l)\n  {\n  }\n\n  \/\/\/ @brief Evaluation.\n  SDD<C>\n  operator()(context<C>& cxt, const SDD<C>& s)\n  const\n  {\n    SDD<C> s1 = s;\n    SDD<C> s2 = s;\n\n    do\n    {\n      s1 = s2;\n\n      s2 = F_(cxt, s2); \/\/ apply (F + Id)*\n      s2 = L_(cxt, s2); \/\/ apply (L + Id)*\n\n      for (const auto& g : G_)\n      {\n\/\/        sum_builder<C, SDD<C>> sum_operands(2);\n\/\/        sum_operands.add(s2);\n\/\/        sum_operands.add(g(cxt, s2));\n        try\n        {\n          \/\/ chain applications of G\n          s2 = sdd::sum(cxt.sdd_context(), {s2, g(cxt, s2)});\n        }\n        catch (top<C>& t)\n        {\n          evaluation_error<C> e(s);\n          e.add_top(t);\n          throw e;\n        }\n      }\n\n    } while (s1 != s2);\n\n    return s1;\n  }\n\n  \/\/\/ @brief Skip variable predicate.\n  bool\n  skip(const typename C::Variable& v)\n  const noexcept\n  {\n    return variable_ != v;\n  }\n\n  \/\/\/ @brief Selector predicate.\n  bool\n  selector()\n  const noexcept\n  {\n    return F_.selector()\n       and L_.selector()\n       and std::all_of( G_.begin(), G_.end()\n                      , [](const homomorphism<C>& h){return h.selector();});\n  }\n\n  \/\/\/ @brief Get the targeted variable.\n  const variable_type&\n  variable()\n  const noexcept\n  {\n    return variable_;\n  }\n\n  \/\/\/ @brief Get the forwardable part.\n  homomorphism<C>\n  F()\n  const noexcept\n  {\n    return F_;\n  }\n\n  \/\/\/ @brief Get the global part.\n  const g_type&\n  G()\n  const noexcept\n  {\n    return G_;\n  }\n\n  \/\/\/ @brief Get the local part.\n  homomorphism<C>\n  L()\n  const noexcept\n  {\n    return L_;\n  }\n};\n\n\/*-------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @brief Equality of two saturation_fixpoint.\n\/\/\/ @related saturation_fixpoint\ntemplate <typename C>\ninline\nbool\noperator==(const saturation_fixpoint<C>& lhs, const saturation_fixpoint<C>& rhs)\nnoexcept\n{\n  return lhs.variable() == rhs.variable()\n     and lhs.F() == rhs.F()\n     and lhs.L() == rhs.L()\n     and lhs.G() == rhs.G();\n}\n\n\/\/\/ @related sum\ntemplate <typename C>\nstd::ostream&\noperator<<(std::ostream& os, const saturation_fixpoint<C>& s)\n{\n  os << \"Sat(@\" << s.variable() << \",  \" << s.F() << \" + \" << s.L();\n  if (not s.G().empty())\n  {\n    os << \" + \";\n    std::copy( s.G().begin(), std::prev(s.G().end())\n             , std::ostream_iterator<homomorphism<C>>(os, \" + \"));\n    os << *std::prev(s.G().end()) << \")*\";\n  }\n  return os;\n}\n\n\/\/\/ @endcond\n\n\/*-------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @brief Create the Saturation Fixpoint homomorphism.\n\/\/\/ @related homomorphism\n\/\/\/\n\/\/\/ We suppose that a saturation fixpoint is created in the rewriting process. Thus, we assume\n\/\/\/ that operands of the G part are already optimized (e.g. local merged and sums flatten).\ntemplate <typename C, typename InputIterator>\nhomomorphism<C>\nSaturationFixpoint( const typename C::Variable& var\n                  , const homomorphism<C>& f\n                  , InputIterator gbegin, InputIterator gend\n                  , const homomorphism<C>& l)\n{\n  return homomorphism<C>::create( internal::mem::construct<saturation_fixpoint<C>>()\n                                , var\n                                , f\n                                , typename saturation_fixpoint<C>::g_type(gbegin, gend)\n                                , l);\n}\n\n\/*-------------------------------------------------------------------------------------------*\/\n\n}} \/\/ namespace sdd::hom\n\nnamespace std {\n\n\/*-------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @cond INTERNAL_DOC\n\n\/\/\/ @brief Hash specialization for sdd::hom::saturation_fixpoint.\ntemplate <typename C>\nstruct hash<sdd::hom::saturation_fixpoint<C>>\n{\n  std::size_t\n  operator()(const sdd::hom::saturation_fixpoint<C>& s)\n  const noexcept\n  {\n    std::size_t seed = 0;\n    sdd::internal::util::hash_combine(seed, s.variable());\n    sdd::internal::util::hash_combine(seed, s.F());\n    sdd::internal::util::hash_combine(seed, s.L());\n    for (const auto& g : s.G())\n    {\n      sdd::internal::util::hash_combine(seed, g);\n    }\n    return seed;\n  }\n};\n\n\/\/\/ @endcond\n\n\/*-------------------------------------------------------------------------------------------*\/\n\n} \/\/ namespace std\n\n#endif \/\/ _SDD_HOM_SATURATION_FIXPOINT_HH_\n<commit_msg>Better Saturation Fixpoint creation.<commit_after>#ifndef _SDD_HOM_SATURATION_FIXPOINT_HH_\n#define _SDD_HOM_SATURATION_FIXPOINT_HH_\n\n#include <algorithm>  \/\/ all_of, copy\n#include <iosfwd>\n#include <stdexcept>  \/\/invalid_argument\n#include <vector>\n\n#include <boost\/container\/flat_set.hpp>\n\n#include \"sdd\/dd\/definition.hh\"\n#include \"sdd\/hom\/context_fwd.hh\"\n#include \"sdd\/hom\/definition_fwd.hh\"\n#include \"sdd\/hom\/identity.hh\"\n#include \"sdd\/hom\/local.hh\"\n\nnamespace sdd { namespace hom {\n\n\/*-------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @cond INTERNAL_DOC\n\n\/\/\/ @brief Saturation Fixpoint homomorphism.\ntemplate <typename C>\nclass saturation_fixpoint\n{\npublic:\n\n  \/\/\/ @brief The variable type.\n  typedef typename C::Variable variable_type;\n\n  \/\/\/ @brief The type of the homomorphism G part.\n  typedef boost::container::flat_set<homomorphism<C>> g_type;\n\nprivate:\n\n  \/\/\/ @brief The variable on which this sum works.\n  const variable_type variable_;\n\n  \/\/\/ @brief The homomorphism's F part.\n  const homomorphism<C> F_;\n\n  \/\/\/ @brief The homomorphism's G part.\n  const g_type G_;\n\n  \/\/\/ @brief The homomorphism's L part.\n  const homomorphism<C> L_;\n\npublic:\n\n  \/\/\/ @brief Constructor.\n  saturation_fixpoint( const variable_type& var, const homomorphism<C>& f, g_type&& g\n                     , const homomorphism<C>& l)\n    : variable_(var)\n    , F_(f)\n    , G_(std::move(g))\n    , L_(l)\n  {\n  }\n\n  \/\/\/ @brief Evaluation.\n  SDD<C>\n  operator()(context<C>& cxt, const SDD<C>& s)\n  const\n  {\n    SDD<C> s1 = s;\n    SDD<C> s2 = s;\n\n    do\n    {\n      s1 = s2;\n\n      s2 = F_(cxt, s2); \/\/ apply (F + Id)*\n      s2 = L_(cxt, s2); \/\/ apply (L + Id)*\n\n      for (const auto& g : G_)\n      {\n\/\/        sum_builder<C, SDD<C>> sum_operands(2);\n\/\/        sum_operands.add(s2);\n\/\/        sum_operands.add(g(cxt, s2));\n        try\n        {\n          \/\/ chain applications of G\n          s2 = sdd::sum(cxt.sdd_context(), {s2, g(cxt, s2)});\n        }\n        catch (top<C>& t)\n        {\n          evaluation_error<C> e(s);\n          e.add_top(t);\n          throw e;\n        }\n      }\n\n    } while (s1 != s2);\n\n    return s1;\n  }\n\n  \/\/\/ @brief Skip variable predicate.\n  bool\n  skip(const typename C::Variable& v)\n  const noexcept\n  {\n    return variable_ != v;\n  }\n\n  \/\/\/ @brief Selector predicate.\n  bool\n  selector()\n  const noexcept\n  {\n    return F_.selector()\n       and L_.selector()\n       and std::all_of( G_.begin(), G_.end()\n                      , [](const homomorphism<C>& h){return h.selector();});\n  }\n\n  \/\/\/ @brief Get the targeted variable.\n  const variable_type&\n  variable()\n  const noexcept\n  {\n    return variable_;\n  }\n\n  \/\/\/ @brief Get the forwardable part.\n  homomorphism<C>\n  F()\n  const noexcept\n  {\n    return F_;\n  }\n\n  \/\/\/ @brief Get the global part.\n  const g_type&\n  G()\n  const noexcept\n  {\n    return G_;\n  }\n\n  \/\/\/ @brief Get the local part.\n  homomorphism<C>\n  L()\n  const noexcept\n  {\n    return L_;\n  }\n};\n\n\/*-------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @brief Equality of two saturation_fixpoint.\n\/\/\/ @related saturation_fixpoint\ntemplate <typename C>\ninline\nbool\noperator==(const saturation_fixpoint<C>& lhs, const saturation_fixpoint<C>& rhs)\nnoexcept\n{\n  return lhs.variable() == rhs.variable()\n     and lhs.F() == rhs.F()\n     and lhs.L() == rhs.L()\n     and lhs.G() == rhs.G();\n}\n\n\/\/\/ @related sum\ntemplate <typename C>\nstd::ostream&\noperator<<(std::ostream& os, const saturation_fixpoint<C>& s)\n{\n  os << \"Sat(@\" << s.variable() << \",  \" << s.F() << \" + \" << s.L();\n  if (not s.G().empty())\n  {\n    os << \" + \";\n    std::copy( s.G().begin(), std::prev(s.G().end())\n             , std::ostream_iterator<homomorphism<C>>(os, \" + \"));\n    os << *std::prev(s.G().end()) << \")*\";\n  }\n  return os;\n}\n\n\/\/\/ @endcond\n\n\/*-------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @brief Create the Saturation Fixpoint homomorphism.\n\/\/\/ @related homomorphism\n\/\/\/\n\/\/\/ We suppose that a saturation fixpoint is created in the rewriting process. Thus, we assume\n\/\/\/ that operands of the G part are already optimized (e.g. local merged and sums flatten).\ntemplate <typename C, typename InputIterator>\nhomomorphism<C>\nSaturationFixpoint( const typename C::Variable& var\n                  , const homomorphism<C>& f\n                  , InputIterator gbegin, InputIterator gend\n                  , const homomorphism<C>& l)\n{\n  const std::size_t gsize = std::distance(gbegin, gend);\n\n  if (f != Id<C>() and gsize == 0 and l == Id<C>())\n  {\n    return f;\n  }\n\n  if (f == Id<C>() and gsize == 0 and l != Id<C>())\n  {\n    return l;\n  }\n\n  return homomorphism<C>::create( internal::mem::construct<saturation_fixpoint<C>>()\n                                , var\n                                , f\n                                , typename saturation_fixpoint<C>::g_type(gbegin, gend)\n                                , l);\n}\n\n\/*-------------------------------------------------------------------------------------------*\/\n\n}} \/\/ namespace sdd::hom\n\nnamespace std {\n\n\/*-------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @cond INTERNAL_DOC\n\n\/\/\/ @brief Hash specialization for sdd::hom::saturation_fixpoint.\ntemplate <typename C>\nstruct hash<sdd::hom::saturation_fixpoint<C>>\n{\n  std::size_t\n  operator()(const sdd::hom::saturation_fixpoint<C>& s)\n  const noexcept\n  {\n    std::size_t seed = 0;\n    sdd::internal::util::hash_combine(seed, s.variable());\n    sdd::internal::util::hash_combine(seed, s.F());\n    sdd::internal::util::hash_combine(seed, s.L());\n    for (const auto& g : s.G())\n    {\n      sdd::internal::util::hash_combine(seed, g);\n    }\n    return seed;\n  }\n};\n\n\/\/\/ @endcond\n\n\/*-------------------------------------------------------------------------------------------*\/\n\n} \/\/ namespace std\n\n#endif \/\/ _SDD_HOM_SATURATION_FIXPOINT_HH_\n<|endoftext|>"}
{"text":"<commit_before>#include \"acmacs-base\/rjson.hh\"\n#include \"acmacs-draw\/surface.hh\"\n#include \"acmacs-map-draw\/point-style-draw.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\nvoid PointStyleDraw::draw(Surface& aSurface, const acmacs::chart::Coordinates& aCoord) const\n{\n    if (shown_raw() == Shown::Shown && aCoord.not_nan()) {\n        switch (shape()) {\n          case Shape::NoChange:\n              THROW_OR_CERR(std::runtime_error(\"Invalid point shape NoChange\"));\n          case Shape::Circle:\n              aSurface.circle_filled(aCoord, size(), aspect(), rotation(), outline_raw(), outline_width(), fill_raw());\n              break;\n          case Shape::Box:\n              aSurface.square_filled(aCoord, size(), aspect(), rotation(), outline_raw(), outline_width(), fill_raw());\n              break;\n          case Shape::Triangle:\n              aSurface.triangle_filled(aCoord, size(), aspect(), rotation(), outline_raw(), outline_width(), fill_raw());\n              break;\n        }\n    }\n    else if (shown_raw() == Shown::NoChange)\n        THROW_OR_CERR(std::runtime_error(\"Invalid shown value NoChange\"));\n\n} \/\/ PointStyleDraw::draw\n\n\/\/ ----------------------------------------------------------------------\n\nacmacs::PointStyle point_style_from_json(const rjson::object& aSource)\n{\n    acmacs::PointStyle style;\n    for (auto [key, value]: aSource) {\n        if (key == \"fill\")\n            style.fill(value);\n        else if (key == \"outline\")\n            style.outline(value);\n        else if (key == \"show\")\n            style.show(value ? PointStyle::Shown::Shown : PointStyle::Shown::Hidden);\n        else if (key == \"hide\")\n            style.show(value ? PointStyle::Shown::Hidden : PointStyle::Shown::Shown);\n        else if (key == \"shape\")\n            style.shape(value);\n        else if (key == \"size\")\n            style.size(Pixels{value});\n        else if (key == \"outline_width\")\n            style.outline_width(Pixels{value});\n        else if (key == \"aspect\")\n            style.aspect(value);\n        else if (key == \"rotation\")\n            style.rotation(value);\n    }\n    return style;\n\n} \/\/ point_style_from_json\n\n\/\/ ----------------------------------------------------------------------\n\nPointDrawingOrder drawing_order_from_json(const rjson::object& aSource)\n{\n    PointDrawingOrder result{PointDrawingOrder::NoChange};\n    if (aSource.get_or_default(\"raise_\", false)) {\n        result = PointDrawingOrder::Raise;\n    }\n    else if (aSource.get_or_default(\"lower\", false)) {\n        result = PointDrawingOrder::Lower;\n    }\n    else {\n        const std::string order = aSource.get_or_default(\"order\", \"\");\n        if (order == \"raise\")\n            result = PointDrawingOrder::Raise;\n        else if (order == \"lower\")\n            result = PointDrawingOrder::Lower;\n    }\n    return result;\n\n} \/\/ drawing_order_from_json\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<commit_msg>switching to acmacs-chart-2 (in progress)<commit_after>#include \"acmacs-base\/rjson.hh\"\n#include \"acmacs-draw\/surface.hh\"\n#include \"acmacs-map-draw\/point-style-draw.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\nvoid PointStyleDraw::draw(Surface& aSurface, const acmacs::chart::Coordinates& aCoord) const\n{\n    if (*shown && aCoord.not_nan()) {\n        switch (*shape) {\n          case acmacs::PointShape::Circle:\n              aSurface.circle_filled(aCoord, Pixels{*size}, *aspect, *rotation, *outline, *outline_width, *fill);\n              break;\n          case acmacs::PointShape::Box:\n              aSurface.square_filled(aCoord, Pixels{*size}, *aspect, *rotation, *outline, *outline_width, *fill);\n              break;\n          case acmacs::PointShape::Triangle:\n              aSurface.triangle_filled(aCoord, Pixels{*size}, *aspect, *rotation, *outline, *outline_width, *fill);\n              break;\n        }\n    }\n\n} \/\/ PointStyleDraw::draw\n\n\/\/ ----------------------------------------------------------------------\n\nacmacs::PointStyle point_style_from_json(const rjson::object& aSource)\n{\n    acmacs::PointStyle style;\n    for (auto [key, value]: aSource) {\n        if (key == \"fill\")\n            style.fill = static_cast<std::string>(value);\n        else if (key == \"outline\")\n            style.outline = static_cast<std::string>(value);\n        else if (key == \"show\")\n            style.shown = value;\n        else if (key == \"hide\")\n            style.shown = !value;\n        else if (key == \"shape\")\n            style.shape = static_cast<std::string>(value);\n        else if (key == \"size\")\n            style.size = value;\n        else if (key == \"outline_width\")\n            style.outline_width = Pixels{value};\n        else if (key == \"aspect\")\n            style.aspect = Aspect{value};\n        else if (key == \"rotation\")\n            style.rotation = Rotation{value};\n    }\n    return style;\n\n} \/\/ point_style_from_json\n\n\/\/ ----------------------------------------------------------------------\n\nPointDrawingOrder drawing_order_from_json(const rjson::object& aSource)\n{\n    PointDrawingOrder result{PointDrawingOrder::NoChange};\n    if (aSource.get_or_default(\"raise_\", false)) {\n        result = PointDrawingOrder::Raise;\n    }\n    else if (aSource.get_or_default(\"lower\", false)) {\n        result = PointDrawingOrder::Lower;\n    }\n    else {\n        const std::string order = aSource.get_or_default(\"order\", \"\");\n        if (order == \"raise\")\n            result = PointDrawingOrder::Raise;\n        else if (order == \"lower\")\n            result = PointDrawingOrder::Lower;\n    }\n    return result;\n\n} \/\/ drawing_order_from_json\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<|endoftext|>"}
{"text":"<commit_before>\/\/ RUN: %clang_cc1 -fexceptions -emit-llvm %s -o - | grep nounwind | count 4\nint c(void) __attribute__((const));\nint p(void) __attribute__((pure));\nint t(void);\n\nint f(void) {\n  return c() + p() + t();\n}\n<commit_msg>FileCheckize this test.<commit_after>\/\/ RUN: %clang_cc1 -fexceptions -emit-llvm %s -o - | FileCheck %s\nint c(void) __attribute__((const));\nint p(void) __attribute__((pure));\nint t(void);\n\n\/\/ CHECK: define i32 @_Z1fv() {\nint f(void) {\n  \/\/ CHECK: call i32 @_Z1cv() nounwind readnone\n  \/\/ CHECK: call i32 @_Z1pv() nounwind readonly\n  return c() + p() + t();\n}\n\n\/\/ CHECK: declare i32 @_Z1cv() nounwind readnone\n\/\/ CHECK: declare i32 @_Z1pv() nounwind readonly\n\/\/ CHECK-NOT: declare i32 @_Z1tv() nounwind\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2013, 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#if defined(TARGET_OS_MACOS)\n\n#include \"bin\/file_system_watcher.h\"\n\n#include <errno.h>  \/\/ NOLINT\n#include <fcntl.h>  \/\/ NOLINT\n#include <unistd.h>  \/\/ NOLINT\n#include <CoreServices\/CoreServices.h>  \/\/ NOLINT\n\n#include \"bin\/eventhandler.h\"\n#include \"bin\/fdutils.h\"\n#include \"bin\/file.h\"\n#include \"bin\/socket.h\"\n#include \"bin\/thread.h\"\n\n\n#ifndef MAC_OS_X_VERSION_10_7\nenum {\n  kFSEventStreamCreateFlagFileEvents = 0x00000010\n};\nenum {\n  kFSEventStreamEventFlagItemCreated = 0x00000100,\n  kFSEventStreamEventFlagItemRemoved = 0x00000200,\n  kFSEventStreamEventFlagItemInodeMetaMod = 0x00000400,\n  kFSEventStreamEventFlagItemRenamed = 0x00000800,\n  kFSEventStreamEventFlagItemModified = 0x00001000,\n  kFSEventStreamEventFlagItemFinderInfoMod = 0x00002000,\n  kFSEventStreamEventFlagItemChangeOwner = 0x00004000,\n  kFSEventStreamEventFlagItemXattrMod = 0x00008000,\n  kFSEventStreamEventFlagItemIsFile = 0x00010000,\n  kFSEventStreamEventFlagItemIsDir = 0x00020000,\n  kFSEventStreamEventFlagItemIsSymlink = 0x00040000\n};\n#endif\n\n\nnamespace dart {\nnamespace bin {\n\nunion FSEvent {\n  struct {\n    uint32_t exists;\n    uint32_t flags;\n    char path[PATH_MAX];\n  } data;\n  uint8_t bytes[PATH_MAX + 8];\n};\n\nclass FSEventsWatcher {\n public:\n  class Node {\n   public:\n    Node(FSEventsWatcher* watcher, char* base_path, int read_fd,\n         int write_fd, bool recursive)\n        : watcher_(watcher),\n          ready_(false),\n          base_path_length_(strlen(base_path)),\n          path_ref_(CFStringCreateWithCString(\n              NULL, base_path, kCFStringEncodingUTF8)),\n          read_fd_(read_fd),\n          write_fd_(write_fd),\n          recursive_(recursive),\n          ref_(NULL) {\n      Start();\n    }\n\n    ~Node() {\n      Stop();\n      close(write_fd_);\n      CFRelease(path_ref_);\n    }\n\n    void set_ref(FSEventStreamRef ref) {\n      ref_ = ref;\n    }\n\n    void Start() {\n      \/\/ Schedule StartCallback to be executed in the RunLoop.\n      CFRunLoopTimerContext context;\n      memset(&context, 0, sizeof(context));\n      context.info = this;\n      CFRunLoopTimerRef timer = CFRunLoopTimerCreate(\n          NULL, 0, 0, 0, 0, Node::StartCallback, &context);\n      CFRunLoopAddTimer(watcher_->run_loop_, timer, kCFRunLoopCommonModes);\n      CFRelease(timer);\n      watcher_->monitor_.Enter();\n      while (!ready_) {\n        watcher_->monitor_.Wait(Monitor::kNoTimeout);\n      }\n      watcher_->monitor_.Exit();\n    }\n\n    static void StartCallback(CFRunLoopTimerRef timer, void* info) {\n      Node* node = reinterpret_cast<Node*>(info);\n#ifdef DEBUG\n      ASSERT(node->watcher_->threadId_ == Thread::GetCurrentThreadId());\n#endif\n      FSEventStreamContext context;\n      memset(&context, 0, sizeof(context));\n      context.info = reinterpret_cast<void*>(node);\n      CFArrayRef array = CFArrayCreate(\n          NULL, reinterpret_cast<const void**>(&node->path_ref_), 1, NULL);\n      FSEventStreamRef ref = FSEventStreamCreate(\n          NULL,\n          Callback,\n          &context,\n          array,\n          kFSEventStreamEventIdSinceNow,\n          0.10,\n          kFSEventStreamCreateFlagNoDefer | kFSEventStreamCreateFlagFileEvents);\n      CFRelease(array);\n\n      node->set_ref(ref);\n\n      FSEventStreamScheduleWithRunLoop(\n          node->ref_,\n          node->watcher_->run_loop_,\n          kCFRunLoopDefaultMode);\n\n      FSEventStreamStart(node->ref_);\n      FSEventStreamFlushSync(node->ref_);\n\n      node->watcher_->monitor_.Enter();\n      node->ready_ = true;\n      node->watcher_->monitor_.Notify();\n      node->watcher_->monitor_.Exit();\n    }\n\n    void Stop() {\n      \/\/ Schedule StopCallback to be executed in the RunLoop.\n      ASSERT(ready_);\n      CFRunLoopTimerContext context;\n      memset(&context, 0, sizeof(context));\n      context.info = this;\n      CFRunLoopTimerRef timer = CFRunLoopTimerCreate(\n          NULL, 0, 0, 0, 0, StopCallback, &context);\n      CFRunLoopAddTimer(watcher_->run_loop_, timer, kCFRunLoopCommonModes);\n      CFRelease(timer);\n      watcher_->monitor_.Enter();\n      while (ready_) {\n        watcher_->monitor_.Wait(Monitor::kNoTimeout);\n      }\n      watcher_->monitor_.Exit();\n    }\n\n    static void StopCallback(CFRunLoopTimerRef timer, void* info) {\n      Node* node = reinterpret_cast<Node*>(info);\n#ifdef DEBUG\n      ASSERT(node->watcher_->threadId_ == Thread::GetCurrentThreadId());\n#endif\n      FSEventStreamStop(node->ref_);\n      FSEventStreamInvalidate(node->ref_);\n      FSEventStreamRelease(node->ref_);\n      node->watcher_->monitor_.Enter();\n      node->ready_ = false;\n      node->watcher_->monitor_.Notify();\n      node->watcher_->monitor_.Exit();\n    }\n\n    FSEventsWatcher* watcher() const { return watcher_; }\n    bool ready() const { return ready_; }\n    intptr_t base_path_length() const { return base_path_length_; }\n    int read_fd() const { return read_fd_; }\n    int write_fd() const { return write_fd_; }\n    bool recursive() const { return recursive_; }\n\n   private:\n    FSEventsWatcher* watcher_;\n    bool ready_;\n    intptr_t base_path_length_;\n    CFStringRef path_ref_;\n    int read_fd_;\n    int write_fd_;\n    bool recursive_;\n    FSEventStreamRef ref_;\n  };\n\n\n  FSEventsWatcher() : run_loop_(0) {\n    Start();\n  }\n\n  void Start() {\n    Thread::Start(Run, reinterpret_cast<uword>(this));\n    monitor_.Enter();\n    while (run_loop_ == NULL) {\n      monitor_.Wait(Monitor::kNoTimeout);\n    }\n    monitor_.Exit();\n  }\n\n  static void Run(uword arg) {\n    FSEventsWatcher* watcher = reinterpret_cast<FSEventsWatcher*>(arg);\n#ifdef DEBUG\n    watcher->threadId_ = Thread::GetCurrentThreadId();\n#endif\n    watcher->run_loop_ = CFRunLoopGetCurrent();\n    CFRetain(watcher->run_loop_);\n\n    \/\/ Notify, as the run-loop is set.\n    watcher->monitor().Enter();\n    watcher->monitor().Notify();\n    watcher->monitor().Exit();\n\n    CFRunLoopTimerRef timer = CFRunLoopTimerCreate(\n        NULL,\n        CFAbsoluteTimeGetCurrent() + 1,\n        1,\n        0,\n        0,\n        TimerCallback,\n        NULL);\n    CFRunLoopAddTimer(watcher->run_loop_, timer, kCFRunLoopCommonModes);\n    CFRelease(timer);\n\n    CFRunLoopRun();\n\n    CFRelease(watcher->run_loop_);\n    watcher->monitor_.Enter();\n    watcher->run_loop_ = NULL;\n    watcher->monitor_.Notify();\n    watcher->monitor_.Exit();\n  }\n\n  void Stop() {\n    \/\/ Schedule StopCallback to be executed in the RunLoop.\n    CFRunLoopTimerContext context;\n    memset(&context, 0, sizeof(context));\n    context.info = this;\n    CFRunLoopTimerRef timer = CFRunLoopTimerCreate(\n        NULL, 0, 0, 0, 0, StopCallback, &context);\n    CFRunLoopAddTimer(run_loop_, timer, kCFRunLoopCommonModes);\n    CFRelease(timer);\n    monitor_.Enter();\n    while (run_loop_ != NULL) {\n      monitor_.Wait(Monitor::kNoTimeout);\n    }\n    monitor_.Exit();\n  }\n\n  static void StopCallback(CFRunLoopTimerRef timer, void* info) {\n    FSEventsWatcher* watcher = reinterpret_cast<FSEventsWatcher*>(info);\n#ifdef DEBUG\n    ASSERT(watcher->threadId_ == Thread::GetCurrentThreadId());\n#endif\n    CFRunLoopStop(watcher->run_loop_);\n  }\n\n  ~FSEventsWatcher() {\n    Stop();\n  }\n\n  Monitor& monitor() { return monitor_; }\n\n  bool has_run_loop() const { return run_loop_ != NULL; }\n\n  static void TimerCallback(CFRunLoopTimerRef timer, void* context) {\n    \/\/ Dummy callback to keep RunLoop alive.\n  }\n\n  Node* AddPath(const char* path, int events, bool recursive) {\n    int fds[2];\n    VOID_TEMP_FAILURE_RETRY(pipe(fds));\n    Socket::SetNonBlocking(fds[0]);\n    Socket::SetBlocking(fds[1]);\n\n    char base_path[PATH_MAX];\n    realpath(path, base_path);\n\n    return new Node(this, base_path, fds[0], fds[1], recursive);\n  }\n\n private:\n  static void Callback(ConstFSEventStreamRef ref,\n                       void* client,\n                       size_t num_events,\n                       void* event_paths,\n                       const FSEventStreamEventFlags event_flags[],\n                       const FSEventStreamEventId event_ids[]) {\n    Node* node = reinterpret_cast<Node*>(client);\n#ifdef DEBUG\n    ASSERT(node->watcher()->threadId_ == Thread::GetCurrentThreadId());\n#endif\n    \/\/ `ready` is set on same thread as this callback is invoked, so we don't\n    \/\/ need to lock here.\n    if (!node->ready()) return;\n    for (size_t i = 0; i < num_events; i++) {\n      char *path = reinterpret_cast<char**>(event_paths)[i];\n      FSEvent event;\n      event.data.exists = File::GetType(path, false) != File::kDoesNotExist;\n      path += node->base_path_length();\n      \/\/ If path is longer the base, skip next character ('\/').\n      if (path[0] != '\\0') path += 1;\n      if (!node->recursive() && strstr(path, \"\/\") != NULL) continue;\n      event.data.flags = event_flags[i];\n      memmove(event.data.path, path, strlen(path) + 1);\n      write(node->write_fd(), event.bytes, sizeof(event));\n    }\n  }\n\n  Monitor monitor_;\n  CFRunLoopRef run_loop_;\n#ifdef DEBUG\n  ThreadId threadId_;\n#endif\n};\n\n\n#define kCFCoreFoundationVersionNumber10_7      635.00\nbool FileSystemWatcher::IsSupported() {\n  return kCFCoreFoundationVersionNumber >= kCFCoreFoundationVersionNumber10_7;\n}\n\n\nintptr_t FileSystemWatcher::Init() {\n  return reinterpret_cast<intptr_t>(new FSEventsWatcher());\n}\n\n\nvoid FileSystemWatcher::Close(intptr_t id) {\n  delete reinterpret_cast<FSEventsWatcher*>(id);\n}\n\n\nintptr_t FileSystemWatcher::WatchPath(intptr_t id,\n                                      const char* path,\n                                      int events,\n                                      bool recursive) {\n  FSEventsWatcher* watcher = reinterpret_cast<FSEventsWatcher*>(id);\n  return reinterpret_cast<intptr_t>(watcher->AddPath(path, events, recursive));\n}\n\n\nvoid FileSystemWatcher::UnwatchPath(intptr_t id, intptr_t path_id) {\n  USE(id);\n  delete reinterpret_cast<FSEventsWatcher::Node*>(path_id);\n}\n\n\nintptr_t FileSystemWatcher::GetSocketId(intptr_t id, intptr_t path_id) {\n  return reinterpret_cast<FSEventsWatcher::Node*>(path_id)->read_fd();\n}\n\n\nDart_Handle FileSystemWatcher::ReadEvents(intptr_t id, intptr_t path_id) {\n  intptr_t fd = GetSocketId(id, path_id);\n  intptr_t avail = FDUtils::AvailableBytes(fd);\n  int count = avail \/ sizeof(FSEvent);\n  if (count <= 0) return Dart_NewList(0);\n  Dart_Handle events = Dart_NewList(count);\n  FSEvent e;\n  for (int i = 0; i < count; i++) {\n    intptr_t bytes = TEMP_FAILURE_RETRY(read(fd, e.bytes, sizeof(e)));\n    if (bytes < 0) {\n      return DartUtils::NewDartOSError();\n    }\n    size_t path_len = strlen(e.data.path);\n    Dart_Handle event = Dart_NewList(5);\n    int flags = e.data.flags;\n    int mask = 0;\n    if (flags & kFSEventStreamEventFlagItemRenamed) {\n      if (path_len == 0) {\n        \/\/ The moved path is the path being watched.\n        mask |= kDeleteSelf;\n      } else {\n        mask |= e.data.exists ? kCreate : kDelete;\n      }\n    }\n    if (flags & kFSEventStreamEventFlagItemModified) mask |= kModifyContent;\n    if (flags & kFSEventStreamEventFlagItemXattrMod) mask |= kModefyAttribute;\n    if (flags & kFSEventStreamEventFlagItemCreated) mask |= kCreate;\n    if (flags & kFSEventStreamEventFlagItemIsDir) mask |= kIsDir;\n    if (flags & kFSEventStreamEventFlagItemRemoved) {\n      if (path_len == 0) {\n        \/\/ The removed path is the path being watched.\n        mask |= kDeleteSelf;\n      } else {\n        mask |= kDelete;\n      }\n    }\n    Dart_ListSetAt(event, 0, Dart_NewInteger(mask));\n    Dart_ListSetAt(event, 1, Dart_NewInteger(1));\n    Dart_ListSetAt(event, 2, Dart_NewStringFromUTF8(\n        reinterpret_cast<uint8_t*>(e.data.path), path_len));\n    Dart_ListSetAt(event, 3, Dart_NewBoolean(true));\n    Dart_ListSetAt(event, 4, Dart_NewInteger(path_id));\n    Dart_ListSetAt(events, i, event);\n  }\n  return events;\n}\n\n}  \/\/ namespace bin\n}  \/\/ namespace dart\n\n#endif  \/\/ defined(TARGET_OS_MACOS)\n\n\n<commit_msg>Remove DEBUG ifdefs.<commit_after>\/\/ Copyright (c) 2013, 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#if defined(TARGET_OS_MACOS)\n\n#include \"bin\/file_system_watcher.h\"\n\n#include <errno.h>  \/\/ NOLINT\n#include <fcntl.h>  \/\/ NOLINT\n#include <unistd.h>  \/\/ NOLINT\n#include <CoreServices\/CoreServices.h>  \/\/ NOLINT\n\n#include \"bin\/eventhandler.h\"\n#include \"bin\/fdutils.h\"\n#include \"bin\/file.h\"\n#include \"bin\/socket.h\"\n#include \"bin\/thread.h\"\n\n\n#ifndef MAC_OS_X_VERSION_10_7\nenum {\n  kFSEventStreamCreateFlagFileEvents = 0x00000010\n};\nenum {\n  kFSEventStreamEventFlagItemCreated = 0x00000100,\n  kFSEventStreamEventFlagItemRemoved = 0x00000200,\n  kFSEventStreamEventFlagItemInodeMetaMod = 0x00000400,\n  kFSEventStreamEventFlagItemRenamed = 0x00000800,\n  kFSEventStreamEventFlagItemModified = 0x00001000,\n  kFSEventStreamEventFlagItemFinderInfoMod = 0x00002000,\n  kFSEventStreamEventFlagItemChangeOwner = 0x00004000,\n  kFSEventStreamEventFlagItemXattrMod = 0x00008000,\n  kFSEventStreamEventFlagItemIsFile = 0x00010000,\n  kFSEventStreamEventFlagItemIsDir = 0x00020000,\n  kFSEventStreamEventFlagItemIsSymlink = 0x00040000\n};\n#endif\n\n\nnamespace dart {\nnamespace bin {\n\nunion FSEvent {\n  struct {\n    uint32_t exists;\n    uint32_t flags;\n    char path[PATH_MAX];\n  } data;\n  uint8_t bytes[PATH_MAX + 8];\n};\n\nclass FSEventsWatcher {\n public:\n  class Node {\n   public:\n    Node(FSEventsWatcher* watcher, char* base_path, int read_fd,\n         int write_fd, bool recursive)\n        : watcher_(watcher),\n          ready_(false),\n          base_path_length_(strlen(base_path)),\n          path_ref_(CFStringCreateWithCString(\n              NULL, base_path, kCFStringEncodingUTF8)),\n          read_fd_(read_fd),\n          write_fd_(write_fd),\n          recursive_(recursive),\n          ref_(NULL) {\n      Start();\n    }\n\n    ~Node() {\n      Stop();\n      close(write_fd_);\n      CFRelease(path_ref_);\n    }\n\n    void set_ref(FSEventStreamRef ref) {\n      ref_ = ref;\n    }\n\n    void Start() {\n      \/\/ Schedule StartCallback to be executed in the RunLoop.\n      CFRunLoopTimerContext context;\n      memset(&context, 0, sizeof(context));\n      context.info = this;\n      CFRunLoopTimerRef timer = CFRunLoopTimerCreate(\n          NULL, 0, 0, 0, 0, Node::StartCallback, &context);\n      CFRunLoopAddTimer(watcher_->run_loop_, timer, kCFRunLoopCommonModes);\n      CFRelease(timer);\n      watcher_->monitor_.Enter();\n      while (!ready_) {\n        watcher_->monitor_.Wait(Monitor::kNoTimeout);\n      }\n      watcher_->monitor_.Exit();\n    }\n\n    static void StartCallback(CFRunLoopTimerRef timer, void* info) {\n      Node* node = reinterpret_cast<Node*>(info);\n      ASSERT(node->watcher_->threadId_ == Thread::GetCurrentThreadId());\n      FSEventStreamContext context;\n      memset(&context, 0, sizeof(context));\n      context.info = reinterpret_cast<void*>(node);\n      CFArrayRef array = CFArrayCreate(\n          NULL, reinterpret_cast<const void**>(&node->path_ref_), 1, NULL);\n      FSEventStreamRef ref = FSEventStreamCreate(\n          NULL,\n          Callback,\n          &context,\n          array,\n          kFSEventStreamEventIdSinceNow,\n          0.10,\n          kFSEventStreamCreateFlagNoDefer | kFSEventStreamCreateFlagFileEvents);\n      CFRelease(array);\n\n      node->set_ref(ref);\n\n      FSEventStreamScheduleWithRunLoop(\n          node->ref_,\n          node->watcher_->run_loop_,\n          kCFRunLoopDefaultMode);\n\n      FSEventStreamStart(node->ref_);\n      FSEventStreamFlushSync(node->ref_);\n\n      node->watcher_->monitor_.Enter();\n      node->ready_ = true;\n      node->watcher_->monitor_.Notify();\n      node->watcher_->monitor_.Exit();\n    }\n\n    void Stop() {\n      \/\/ Schedule StopCallback to be executed in the RunLoop.\n      ASSERT(ready_);\n      CFRunLoopTimerContext context;\n      memset(&context, 0, sizeof(context));\n      context.info = this;\n      CFRunLoopTimerRef timer = CFRunLoopTimerCreate(\n          NULL, 0, 0, 0, 0, StopCallback, &context);\n      CFRunLoopAddTimer(watcher_->run_loop_, timer, kCFRunLoopCommonModes);\n      CFRelease(timer);\n      watcher_->monitor_.Enter();\n      while (ready_) {\n        watcher_->monitor_.Wait(Monitor::kNoTimeout);\n      }\n      watcher_->monitor_.Exit();\n    }\n\n    static void StopCallback(CFRunLoopTimerRef timer, void* info) {\n      Node* node = reinterpret_cast<Node*>(info);\n      ASSERT(node->watcher_->threadId_ == Thread::GetCurrentThreadId());\n      FSEventStreamStop(node->ref_);\n      FSEventStreamInvalidate(node->ref_);\n      FSEventStreamRelease(node->ref_);\n      node->watcher_->monitor_.Enter();\n      node->ready_ = false;\n      node->watcher_->monitor_.Notify();\n      node->watcher_->monitor_.Exit();\n    }\n\n    FSEventsWatcher* watcher() const { return watcher_; }\n    bool ready() const { return ready_; }\n    intptr_t base_path_length() const { return base_path_length_; }\n    int read_fd() const { return read_fd_; }\n    int write_fd() const { return write_fd_; }\n    bool recursive() const { return recursive_; }\n\n   private:\n    FSEventsWatcher* watcher_;\n    bool ready_;\n    intptr_t base_path_length_;\n    CFStringRef path_ref_;\n    int read_fd_;\n    int write_fd_;\n    bool recursive_;\n    FSEventStreamRef ref_;\n  };\n\n\n  FSEventsWatcher() : run_loop_(0) {\n    Start();\n  }\n\n  void Start() {\n    Thread::Start(Run, reinterpret_cast<uword>(this));\n    monitor_.Enter();\n    while (run_loop_ == NULL) {\n      monitor_.Wait(Monitor::kNoTimeout);\n    }\n    monitor_.Exit();\n  }\n\n  static void Run(uword arg) {\n    FSEventsWatcher* watcher = reinterpret_cast<FSEventsWatcher*>(arg);\n    \/\/ Only checked in debug mode.\n    watcher->threadId_ = Thread::GetCurrentThreadId();\n    watcher->run_loop_ = CFRunLoopGetCurrent();\n    CFRetain(watcher->run_loop_);\n\n    \/\/ Notify, as the run-loop is set.\n    watcher->monitor().Enter();\n    watcher->monitor().Notify();\n    watcher->monitor().Exit();\n\n    CFRunLoopTimerRef timer = CFRunLoopTimerCreate(\n        NULL,\n        CFAbsoluteTimeGetCurrent() + 1,\n        1,\n        0,\n        0,\n        TimerCallback,\n        NULL);\n    CFRunLoopAddTimer(watcher->run_loop_, timer, kCFRunLoopCommonModes);\n    CFRelease(timer);\n\n    CFRunLoopRun();\n\n    CFRelease(watcher->run_loop_);\n    watcher->monitor_.Enter();\n    watcher->run_loop_ = NULL;\n    watcher->monitor_.Notify();\n    watcher->monitor_.Exit();\n  }\n\n  void Stop() {\n    \/\/ Schedule StopCallback to be executed in the RunLoop.\n    CFRunLoopTimerContext context;\n    memset(&context, 0, sizeof(context));\n    context.info = this;\n    CFRunLoopTimerRef timer = CFRunLoopTimerCreate(\n        NULL, 0, 0, 0, 0, StopCallback, &context);\n    CFRunLoopAddTimer(run_loop_, timer, kCFRunLoopCommonModes);\n    CFRelease(timer);\n    monitor_.Enter();\n    while (run_loop_ != NULL) {\n      monitor_.Wait(Monitor::kNoTimeout);\n    }\n    monitor_.Exit();\n  }\n\n  static void StopCallback(CFRunLoopTimerRef timer, void* info) {\n    FSEventsWatcher* watcher = reinterpret_cast<FSEventsWatcher*>(info);\n    ASSERT(watcher->threadId_ == Thread::GetCurrentThreadId());\n    CFRunLoopStop(watcher->run_loop_);\n  }\n\n  ~FSEventsWatcher() {\n    Stop();\n  }\n\n  Monitor& monitor() { return monitor_; }\n\n  bool has_run_loop() const { return run_loop_ != NULL; }\n\n  static void TimerCallback(CFRunLoopTimerRef timer, void* context) {\n    \/\/ Dummy callback to keep RunLoop alive.\n  }\n\n  Node* AddPath(const char* path, int events, bool recursive) {\n    int fds[2];\n    VOID_TEMP_FAILURE_RETRY(pipe(fds));\n    Socket::SetNonBlocking(fds[0]);\n    Socket::SetBlocking(fds[1]);\n\n    char base_path[PATH_MAX];\n    realpath(path, base_path);\n\n    return new Node(this, base_path, fds[0], fds[1], recursive);\n  }\n\n private:\n  static void Callback(ConstFSEventStreamRef ref,\n                       void* client,\n                       size_t num_events,\n                       void* event_paths,\n                       const FSEventStreamEventFlags event_flags[],\n                       const FSEventStreamEventId event_ids[]) {\n    Node* node = reinterpret_cast<Node*>(client);\n    ASSERT(node->watcher()->threadId_ == Thread::GetCurrentThreadId());\n    \/\/ `ready` is set on same thread as this callback is invoked, so we don't\n    \/\/ need to lock here.\n    if (!node->ready()) return;\n    for (size_t i = 0; i < num_events; i++) {\n      char *path = reinterpret_cast<char**>(event_paths)[i];\n      FSEvent event;\n      event.data.exists = File::GetType(path, false) != File::kDoesNotExist;\n      path += node->base_path_length();\n      \/\/ If path is longer the base, skip next character ('\/').\n      if (path[0] != '\\0') path += 1;\n      if (!node->recursive() && strstr(path, \"\/\") != NULL) continue;\n      event.data.flags = event_flags[i];\n      memmove(event.data.path, path, strlen(path) + 1);\n      write(node->write_fd(), event.bytes, sizeof(event));\n    }\n  }\n\n  Monitor monitor_;\n  CFRunLoopRef run_loop_;\n  ThreadId threadId_;\n};\n\n\n#define kCFCoreFoundationVersionNumber10_7      635.00\nbool FileSystemWatcher::IsSupported() {\n  return kCFCoreFoundationVersionNumber >= kCFCoreFoundationVersionNumber10_7;\n}\n\n\nintptr_t FileSystemWatcher::Init() {\n  return reinterpret_cast<intptr_t>(new FSEventsWatcher());\n}\n\n\nvoid FileSystemWatcher::Close(intptr_t id) {\n  delete reinterpret_cast<FSEventsWatcher*>(id);\n}\n\n\nintptr_t FileSystemWatcher::WatchPath(intptr_t id,\n                                      const char* path,\n                                      int events,\n                                      bool recursive) {\n  FSEventsWatcher* watcher = reinterpret_cast<FSEventsWatcher*>(id);\n  return reinterpret_cast<intptr_t>(watcher->AddPath(path, events, recursive));\n}\n\n\nvoid FileSystemWatcher::UnwatchPath(intptr_t id, intptr_t path_id) {\n  USE(id);\n  delete reinterpret_cast<FSEventsWatcher::Node*>(path_id);\n}\n\n\nintptr_t FileSystemWatcher::GetSocketId(intptr_t id, intptr_t path_id) {\n  return reinterpret_cast<FSEventsWatcher::Node*>(path_id)->read_fd();\n}\n\n\nDart_Handle FileSystemWatcher::ReadEvents(intptr_t id, intptr_t path_id) {\n  intptr_t fd = GetSocketId(id, path_id);\n  intptr_t avail = FDUtils::AvailableBytes(fd);\n  int count = avail \/ sizeof(FSEvent);\n  if (count <= 0) return Dart_NewList(0);\n  Dart_Handle events = Dart_NewList(count);\n  FSEvent e;\n  for (int i = 0; i < count; i++) {\n    intptr_t bytes = TEMP_FAILURE_RETRY(read(fd, e.bytes, sizeof(e)));\n    if (bytes < 0) {\n      return DartUtils::NewDartOSError();\n    }\n    size_t path_len = strlen(e.data.path);\n    Dart_Handle event = Dart_NewList(5);\n    int flags = e.data.flags;\n    int mask = 0;\n    if (flags & kFSEventStreamEventFlagItemRenamed) {\n      if (path_len == 0) {\n        \/\/ The moved path is the path being watched.\n        mask |= kDeleteSelf;\n      } else {\n        mask |= e.data.exists ? kCreate : kDelete;\n      }\n    }\n    if (flags & kFSEventStreamEventFlagItemModified) mask |= kModifyContent;\n    if (flags & kFSEventStreamEventFlagItemXattrMod) mask |= kModefyAttribute;\n    if (flags & kFSEventStreamEventFlagItemCreated) mask |= kCreate;\n    if (flags & kFSEventStreamEventFlagItemIsDir) mask |= kIsDir;\n    if (flags & kFSEventStreamEventFlagItemRemoved) {\n      if (path_len == 0) {\n        \/\/ The removed path is the path being watched.\n        mask |= kDeleteSelf;\n      } else {\n        mask |= kDelete;\n      }\n    }\n    Dart_ListSetAt(event, 0, Dart_NewInteger(mask));\n    Dart_ListSetAt(event, 1, Dart_NewInteger(1));\n    Dart_ListSetAt(event, 2, Dart_NewStringFromUTF8(\n        reinterpret_cast<uint8_t*>(e.data.path), path_len));\n    Dart_ListSetAt(event, 3, Dart_NewBoolean(true));\n    Dart_ListSetAt(event, 4, Dart_NewInteger(path_id));\n    Dart_ListSetAt(events, i, event);\n  }\n  return events;\n}\n\n}  \/\/ namespace bin\n}  \/\/ namespace dart\n\n#endif  \/\/ defined(TARGET_OS_MACOS)\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ File:        thresholder.cpp\n\/\/ Description: Base API for thresolding images in tesseract.\n\/\/ Author:      Ray Smith\n\/\/ Created:     Mon May 12 11:28:15 PDT 2008\n\/\/\n\/\/ (C) Copyright 2008, Google Inc.\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"allheaders.h\"\n\n#include \"thresholder.h\"\n\n#include <string.h>\n\n#include \"otsuthr.h\"\n\n#include \"openclwrapper.h\"\n\nnamespace tesseract {\n\nImageThresholder::ImageThresholder()\n  : pix_(NULL),\n    image_width_(0), image_height_(0),\n    pix_channels_(0), pix_wpl_(0),\n    scale_(1), yres_(300), estimated_res_(300) {\n  SetRectangle(0, 0, 0, 0);\n}\n\nImageThresholder::~ImageThresholder() {\n  Clear();\n}\n\n\/\/ Destroy the Pix if there is one, freeing memory.\nvoid ImageThresholder::Clear() {\n  pixDestroy(&pix_);\n}\n\n\/\/ Return true if no image has been set.\nbool ImageThresholder::IsEmpty() const {\n  return pix_ == NULL;\n}\n\n\/\/ SetImage makes a copy of all the image data, so it may be deleted\n\/\/ immediately after this call.\n\/\/ Greyscale of 8 and color of 24 or 32 bits per pixel may be given.\n\/\/ Palette color images will not work properly and must be converted to\n\/\/ 24 bit.\n\/\/ Binary images of 1 bit per pixel may also be given but they must be\n\/\/ byte packed with the MSB of the first byte being the first pixel, and a\n\/\/ one pixel is WHITE. For binary images set bytes_per_pixel=0.\nvoid ImageThresholder::SetImage(const unsigned char* imagedata,\n                                int width, int height,\n                                int bytes_per_pixel, int bytes_per_line) {\n  int bpp = bytes_per_pixel * 8;\n  if (bpp == 0) bpp = 1;\n  Pix* pix = pixCreate(width, height, bpp == 24 ? 32 : bpp);\n  l_uint32* data = pixGetData(pix);\n  int wpl = pixGetWpl(pix);\n  switch (bpp) {\n  case 1:\n    for (int y = 0; y < height; ++y, data += wpl, imagedata += bytes_per_line) {\n      for (int x = 0; x < width; ++x) {\n        if (imagedata[x \/ 8] & (0x80 >> (x % 8)))\n          CLEAR_DATA_BIT(data, x);\n        else\n          SET_DATA_BIT(data, x);\n      }\n    }\n    break;\n\n  case 8:\n    \/\/ Greyscale just copies the bytes in the right order.\n    for (int y = 0; y < height; ++y, data += wpl, imagedata += bytes_per_line) {\n      for (int x = 0; x < width; ++x)\n        SET_DATA_BYTE(data, x, imagedata[x]);\n    }\n    break;\n\n  case 24:\n    \/\/ Put the colors in the correct places in the line buffer.\n    for (int y = 0; y < height; ++y, imagedata += bytes_per_line) {\n      for (int x = 0; x < width; ++x, ++data) {\n        SET_DATA_BYTE(data, COLOR_RED, imagedata[3 * x]);\n        SET_DATA_BYTE(data, COLOR_GREEN, imagedata[3 * x + 1]);\n        SET_DATA_BYTE(data, COLOR_BLUE, imagedata[3 * x + 2]);\n      }\n    }\n    break;\n\n  case 32:\n    \/\/ Maintain byte order consistency across different endianness.\n    for (int y = 0; y < height; ++y, imagedata += bytes_per_line, data += wpl) {\n      for (int x = 0; x < width; ++x) {\n        data[x] = (imagedata[x * 4] << 24) | (imagedata[x * 4 + 1] << 16) |\n                  (imagedata[x * 4 + 2] << 8) | imagedata[x * 4 + 3];\n      }\n    }\n    break;\n\n  default:\n    tprintf(\"Cannot convert RAW image to Pix with bpp = %d\\n\", bpp);\n  }\n  pixSetYRes(pix, 300);\n  SetImage(pix);\n  pixDestroy(&pix);\n}\n\n\/\/ Store the coordinates of the rectangle to process for later use.\n\/\/ Doesn't actually do any thresholding.\nvoid ImageThresholder::SetRectangle(int left, int top, int width, int height) {\n  rect_left_ = left;\n  rect_top_ = top;\n  rect_width_ = width;\n  rect_height_ = height;\n}\n\n\/\/ Get enough parameters to be able to rebuild bounding boxes in the\n\/\/ original image (not just within the rectangle).\n\/\/ Left and top are enough with top-down coordinates, but\n\/\/ the height of the rectangle and the image are needed for bottom-up.\nvoid ImageThresholder::GetImageSizes(int* left, int* top,\n                                     int* width, int* height,\n                                     int* imagewidth, int* imageheight) {\n  *left = rect_left_;\n  *top = rect_top_;\n  *width = rect_width_;\n  *height = rect_height_;\n  *imagewidth = image_width_;\n  *imageheight = image_height_;\n}\n\n\/\/ Pix vs raw, which to use? Pix is the preferred input for efficiency,\n\/\/ since raw buffers are copied.\n\/\/ SetImage for Pix clones its input, so the source pix may be pixDestroyed\n\/\/ immediately after, but may not go away until after the Thresholder has\n\/\/ finished with it.\nvoid ImageThresholder::SetImage(const Pix* pix) {\n  if (pix_ != NULL)\n    pixDestroy(&pix_);\n  Pix* src = const_cast<Pix*>(pix);\n  int depth;\n  pixGetDimensions(src, &image_width_, &image_height_, &depth);\n  \/\/ Convert the image as necessary so it is one of binary, plain RGB, or\n  \/\/ 8 bit with no colormap. Guarantee that we always end up with our own copy,\n  \/\/ not just a clone of the input.\n  if (pixGetColormap(src)) {\n    Pix* tmp = pixRemoveColormap(src, REMOVE_CMAP_BASED_ON_SRC);\n    depth = pixGetDepth(tmp);\n    if (depth > 1 && depth < 8) {\n      pix_ = pixConvertTo8(tmp, false);\n      pixDestroy(&tmp);\n    } else {\n      pix_ = tmp;\n    }\n  } else if (depth > 1 && depth < 8) {\n    pix_ = pixConvertTo8(src, false);\n  } else {\n    pix_ = pixCopy(NULL, src);\n  }\n  depth = pixGetDepth(pix_);\n  pix_channels_ = depth \/ 8;\n  pix_wpl_ = pixGetWpl(pix_);\n  scale_ = 1;\n  estimated_res_ = yres_ = pixGetYRes(pix_);\n  Init();\n}\n\n\/\/ Threshold the source image as efficiently as possible to the output Pix.\n\/\/ Creates a Pix and sets pix to point to the resulting pointer.\n\/\/ Caller must use pixDestroy to free the created Pix.\nvoid ImageThresholder::ThresholdToPix(PageSegMode pageseg_mode, Pix** pix) {\n  if (pix_channels_ == 0) {\n    \/\/ We have a binary image, so it just has to be cloned.\n    *pix = GetPixRect();\n  } else {\n    OtsuThresholdRectToPix(pix_, pix);\n  }\n}\n\n\/\/ Gets a pix that contains an 8 bit threshold value at each pixel. The\n\/\/ returned pix may be an integer reduction of the binary image such that\n\/\/ the scale factor may be inferred from the ratio of the sizes, even down\n\/\/ to the extreme of a 1x1 pixel thresholds image.\n\/\/ Ideally the 8 bit threshold should be the exact threshold used to generate\n\/\/ the binary image in ThresholdToPix, but this is not a hard constraint.\n\/\/ Returns NULL if the input is binary. PixDestroy after use.\nPix* ImageThresholder::GetPixRectThresholds() {\n  if (IsBinary()) return NULL;\n  Pix* pix_grey = GetPixRectGrey();\n  int width = pixGetWidth(pix_grey);\n  int height = pixGetHeight(pix_grey);\n  int* thresholds;\n  int* hi_values;\n  OtsuThreshold(pix_grey, 0, 0, width, height, &thresholds, &hi_values);\n  pixDestroy(&pix_grey);\n  Pix* pix_thresholds = pixCreate(width, height, 8);\n  int threshold = thresholds[0] > 0 ? thresholds[0] : 128;\n  pixSetAllArbitrary(pix_thresholds, threshold);\n  delete [] thresholds;\n  delete [] hi_values;\n  return pix_thresholds;\n}\n\n\/\/ Common initialization shared between SetImage methods.\nvoid ImageThresholder::Init() {\n  SetRectangle(0, 0, image_width_, image_height_);\n}\n\n\/\/ Get a clone\/copy of the source image rectangle.\n\/\/ The returned Pix must be pixDestroyed.\n\/\/ This function will be used in the future by the page layout analysis, and\n\/\/ the layout analysis that uses it will only be available with Leptonica,\n\/\/ so there is no raw equivalent.\nPix* ImageThresholder::GetPixRect() {\n  if (IsFullImage()) {\n    \/\/ Just clone the whole thing.\n    return pixClone(pix_);\n  } else {\n    \/\/ Crop to the given rectangle.\n    Box* box = boxCreate(rect_left_, rect_top_, rect_width_, rect_height_);\n    Pix* cropped = pixClipRectangle(pix_, box, NULL);\n    boxDestroy(&box);\n    return cropped;\n  }\n}\n\n\/\/ Get a clone\/copy of the source image rectangle, reduced to greyscale,\n\/\/ and at the same resolution as the output binary.\n\/\/ The returned Pix must be pixDestroyed.\n\/\/ Provided to the classifier to extract features from the greyscale image.\nPix* ImageThresholder::GetPixRectGrey() {\n  Pix* pix = GetPixRect();  \/\/ May have to be reduced to grey.\n  int depth = pixGetDepth(pix);\n  if (depth != 8) {\n    Pix* result = depth < 8 ? pixConvertTo8(pix, false)\n                            : pixConvertRGBToLuminance(pix);\n    pixDestroy(&pix);\n    return result;\n  }\n  return pix;\n}\n\n\/\/ Otsu thresholds the rectangle, taking the rectangle from *this.\nvoid ImageThresholder::OtsuThresholdRectToPix(Pix* src_pix,\n                                              Pix** out_pix) const {\n  PERF_COUNT_START(\"OtsuThresholdRectToPix\")\n  int* thresholds;\n  int* hi_values;\n\n  int num_channels = OtsuThreshold(src_pix, rect_left_, rect_top_, rect_width_,\n                                   rect_height_, &thresholds, &hi_values);\n  \/\/ only use opencl if compiled w\/ OpenCL and selected device is opencl\n#ifdef USE_OPENCL\n  OpenclDevice od;\n  if ((num_channels == 4 || num_channels == 1) &&\n      od.selectedDeviceIsOpenCL() && rect_top_ == 0 && rect_left_ == 0 ) {\n    od.ThresholdRectToPixOCL((unsigned char*)pixGetData(src_pix),\n                             num_channels, pixGetWpl(src_pix) * 4,\n                             thresholds, hi_values, out_pix \/*pix_OCL*\/,\n                             rect_height_, rect_width_, rect_top_, rect_left_);\n  } else {\n#endif\n    ThresholdRectToPix(src_pix, num_channels, thresholds, hi_values, out_pix);\n#ifdef USE_OPENCL\n  }\n#endif\n  delete [] thresholds;\n  delete [] hi_values;\n\n  PERF_COUNT_END\n}\n\n\/\/\/ Threshold the rectangle, taking everything except the src_pix\n\/\/\/ from the class, using thresholds\/hi_values to the output pix.\n\/\/\/ NOTE that num_channels is the size of the thresholds and hi_values\n\/\/ arrays and also the bytes per pixel in src_pix.\nvoid ImageThresholder::ThresholdRectToPix(Pix* src_pix,\n                                          int num_channels,\n                                          const int* thresholds,\n                                          const int* hi_values,\n                                          Pix** pix) const {\n  PERF_COUNT_START(\"ThresholdRectToPix\")\n  *pix = pixCreate(rect_width_, rect_height_, 1);\n  uinT32* pixdata = pixGetData(*pix);\n  int wpl = pixGetWpl(*pix);\n  int src_wpl = pixGetWpl(src_pix);\n  uinT32* srcdata = pixGetData(src_pix);\n  for (int y = 0; y < rect_height_; ++y) {\n    const uinT32* linedata = srcdata + (y + rect_top_) * src_wpl;\n    uinT32* pixline = pixdata + y * wpl;\n    for (int x = 0; x < rect_width_; ++x) {\n      bool white_result = true;\n      for (int ch = 0; ch < num_channels; ++ch) {\n        int pixel = GET_DATA_BYTE(const_cast<void*>(\n                                  reinterpret_cast<const void *>(linedata)),\n                                  (x + rect_left_) * num_channels + ch);\n        if (hi_values[ch] >= 0 &&\n            (pixel > thresholds[ch]) == (hi_values[ch] == 0)) {\n          white_result = false;\n          break;\n        }\n      }\n      if (white_result)\n        CLEAR_DATA_BIT(pixline, x);\n      else\n        SET_DATA_BIT(pixline, x);\n    }\n  }\n\n  PERF_COUNT_END\n}\n\n}  \/\/ namespace tesseract.\n\n<commit_msg>Fixed damage to binary images when processing PDFs, issue #535<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ File:        thresholder.cpp\n\/\/ Description: Base API for thresolding images in tesseract.\n\/\/ Author:      Ray Smith\n\/\/ Created:     Mon May 12 11:28:15 PDT 2008\n\/\/\n\/\/ (C) Copyright 2008, Google Inc.\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"allheaders.h\"\n\n#include \"thresholder.h\"\n\n#include <string.h>\n\n#include \"otsuthr.h\"\n\n#include \"openclwrapper.h\"\n\nnamespace tesseract {\n\nImageThresholder::ImageThresholder()\n  : pix_(NULL),\n    image_width_(0), image_height_(0),\n    pix_channels_(0), pix_wpl_(0),\n    scale_(1), yres_(300), estimated_res_(300) {\n  SetRectangle(0, 0, 0, 0);\n}\n\nImageThresholder::~ImageThresholder() {\n  Clear();\n}\n\n\/\/ Destroy the Pix if there is one, freeing memory.\nvoid ImageThresholder::Clear() {\n  pixDestroy(&pix_);\n}\n\n\/\/ Return true if no image has been set.\nbool ImageThresholder::IsEmpty() const {\n  return pix_ == NULL;\n}\n\n\/\/ SetImage makes a copy of all the image data, so it may be deleted\n\/\/ immediately after this call.\n\/\/ Greyscale of 8 and color of 24 or 32 bits per pixel may be given.\n\/\/ Palette color images will not work properly and must be converted to\n\/\/ 24 bit.\n\/\/ Binary images of 1 bit per pixel may also be given but they must be\n\/\/ byte packed with the MSB of the first byte being the first pixel, and a\n\/\/ one pixel is WHITE. For binary images set bytes_per_pixel=0.\nvoid ImageThresholder::SetImage(const unsigned char* imagedata,\n                                int width, int height,\n                                int bytes_per_pixel, int bytes_per_line) {\n  int bpp = bytes_per_pixel * 8;\n  if (bpp == 0) bpp = 1;\n  Pix* pix = pixCreate(width, height, bpp == 24 ? 32 : bpp);\n  l_uint32* data = pixGetData(pix);\n  int wpl = pixGetWpl(pix);\n  switch (bpp) {\n  case 1:\n    for (int y = 0; y < height; ++y, data += wpl, imagedata += bytes_per_line) {\n      for (int x = 0; x < width; ++x) {\n        if (imagedata[x \/ 8] & (0x80 >> (x % 8)))\n          CLEAR_DATA_BIT(data, x);\n        else\n          SET_DATA_BIT(data, x);\n      }\n    }\n    break;\n\n  case 8:\n    \/\/ Greyscale just copies the bytes in the right order.\n    for (int y = 0; y < height; ++y, data += wpl, imagedata += bytes_per_line) {\n      for (int x = 0; x < width; ++x)\n        SET_DATA_BYTE(data, x, imagedata[x]);\n    }\n    break;\n\n  case 24:\n    \/\/ Put the colors in the correct places in the line buffer.\n    for (int y = 0; y < height; ++y, imagedata += bytes_per_line) {\n      for (int x = 0; x < width; ++x, ++data) {\n        SET_DATA_BYTE(data, COLOR_RED, imagedata[3 * x]);\n        SET_DATA_BYTE(data, COLOR_GREEN, imagedata[3 * x + 1]);\n        SET_DATA_BYTE(data, COLOR_BLUE, imagedata[3 * x + 2]);\n      }\n    }\n    break;\n\n  case 32:\n    \/\/ Maintain byte order consistency across different endianness.\n    for (int y = 0; y < height; ++y, imagedata += bytes_per_line, data += wpl) {\n      for (int x = 0; x < width; ++x) {\n        data[x] = (imagedata[x * 4] << 24) | (imagedata[x * 4 + 1] << 16) |\n                  (imagedata[x * 4 + 2] << 8) | imagedata[x * 4 + 3];\n      }\n    }\n    break;\n\n  default:\n    tprintf(\"Cannot convert RAW image to Pix with bpp = %d\\n\", bpp);\n  }\n  pixSetYRes(pix, 300);\n  SetImage(pix);\n  pixDestroy(&pix);\n}\n\n\/\/ Store the coordinates of the rectangle to process for later use.\n\/\/ Doesn't actually do any thresholding.\nvoid ImageThresholder::SetRectangle(int left, int top, int width, int height) {\n  rect_left_ = left;\n  rect_top_ = top;\n  rect_width_ = width;\n  rect_height_ = height;\n}\n\n\/\/ Get enough parameters to be able to rebuild bounding boxes in the\n\/\/ original image (not just within the rectangle).\n\/\/ Left and top are enough with top-down coordinates, but\n\/\/ the height of the rectangle and the image are needed for bottom-up.\nvoid ImageThresholder::GetImageSizes(int* left, int* top,\n                                     int* width, int* height,\n                                     int* imagewidth, int* imageheight) {\n  *left = rect_left_;\n  *top = rect_top_;\n  *width = rect_width_;\n  *height = rect_height_;\n  *imagewidth = image_width_;\n  *imageheight = image_height_;\n}\n\n\/\/ Pix vs raw, which to use? Pix is the preferred input for efficiency,\n\/\/ since raw buffers are copied.\n\/\/ SetImage for Pix clones its input, so the source pix may be pixDestroyed\n\/\/ immediately after, but may not go away until after the Thresholder has\n\/\/ finished with it.\nvoid ImageThresholder::SetImage(const Pix* pix) {\n  if (pix_ != NULL)\n    pixDestroy(&pix_);\n  Pix* src = const_cast<Pix*>(pix);\n  int depth;\n  pixGetDimensions(src, &image_width_, &image_height_, &depth);\n  \/\/ Convert the image as necessary so it is one of binary, plain RGB, or\n  \/\/ 8 bit with no colormap. Guarantee that we always end up with our own copy,\n  \/\/ not just a clone of the input.\n  if (pixGetColormap(src)) {\n    Pix* tmp = pixRemoveColormap(src, REMOVE_CMAP_BASED_ON_SRC);\n    depth = pixGetDepth(tmp);\n    if (depth > 1 && depth < 8) {\n      pix_ = pixConvertTo8(tmp, false);\n      pixDestroy(&tmp);\n    } else {\n      pix_ = tmp;\n    }\n  } else if (depth > 1 && depth < 8) {\n    pix_ = pixConvertTo8(src, false);\n  } else {\n    pix_ = pixCopy(NULL, src);\n  }\n  depth = pixGetDepth(pix_);\n  pix_channels_ = depth \/ 8;\n  pix_wpl_ = pixGetWpl(pix_);\n  scale_ = 1;\n  estimated_res_ = yres_ = pixGetYRes(pix_);\n  Init();\n}\n\n\/\/ Threshold the source image as efficiently as possible to the output Pix.\n\/\/ Creates a Pix and sets pix to point to the resulting pointer.\n\/\/ Caller must use pixDestroy to free the created Pix.\nvoid ImageThresholder::ThresholdToPix(PageSegMode pageseg_mode, Pix** pix) {\n  if (pix_channels_ == 0) {\n    \/\/ We have a binary image, but it still has to be copied, as this API\n    \/\/ allows the caller to modify the output.\n    Pix* original = GetPixRect();\n    *pix = pixCopy(nullptr, original);\n    pixDestroy(&original);\n  } else {\n    OtsuThresholdRectToPix(pix_, pix);\n  }\n}\n\n\/\/ Gets a pix that contains an 8 bit threshold value at each pixel. The\n\/\/ returned pix may be an integer reduction of the binary image such that\n\/\/ the scale factor may be inferred from the ratio of the sizes, even down\n\/\/ to the extreme of a 1x1 pixel thresholds image.\n\/\/ Ideally the 8 bit threshold should be the exact threshold used to generate\n\/\/ the binary image in ThresholdToPix, but this is not a hard constraint.\n\/\/ Returns NULL if the input is binary. PixDestroy after use.\nPix* ImageThresholder::GetPixRectThresholds() {\n  if (IsBinary()) return NULL;\n  Pix* pix_grey = GetPixRectGrey();\n  int width = pixGetWidth(pix_grey);\n  int height = pixGetHeight(pix_grey);\n  int* thresholds;\n  int* hi_values;\n  OtsuThreshold(pix_grey, 0, 0, width, height, &thresholds, &hi_values);\n  pixDestroy(&pix_grey);\n  Pix* pix_thresholds = pixCreate(width, height, 8);\n  int threshold = thresholds[0] > 0 ? thresholds[0] : 128;\n  pixSetAllArbitrary(pix_thresholds, threshold);\n  delete [] thresholds;\n  delete [] hi_values;\n  return pix_thresholds;\n}\n\n\/\/ Common initialization shared between SetImage methods.\nvoid ImageThresholder::Init() {\n  SetRectangle(0, 0, image_width_, image_height_);\n}\n\n\/\/ Get a clone\/copy of the source image rectangle.\n\/\/ The returned Pix must be pixDestroyed.\n\/\/ This function will be used in the future by the page layout analysis, and\n\/\/ the layout analysis that uses it will only be available with Leptonica,\n\/\/ so there is no raw equivalent.\nPix* ImageThresholder::GetPixRect() {\n  if (IsFullImage()) {\n    \/\/ Just clone the whole thing.\n    return pixClone(pix_);\n  } else {\n    \/\/ Crop to the given rectangle.\n    Box* box = boxCreate(rect_left_, rect_top_, rect_width_, rect_height_);\n    Pix* cropped = pixClipRectangle(pix_, box, NULL);\n    boxDestroy(&box);\n    return cropped;\n  }\n}\n\n\/\/ Get a clone\/copy of the source image rectangle, reduced to greyscale,\n\/\/ and at the same resolution as the output binary.\n\/\/ The returned Pix must be pixDestroyed.\n\/\/ Provided to the classifier to extract features from the greyscale image.\nPix* ImageThresholder::GetPixRectGrey() {\n  Pix* pix = GetPixRect();  \/\/ May have to be reduced to grey.\n  int depth = pixGetDepth(pix);\n  if (depth != 8) {\n    Pix* result = depth < 8 ? pixConvertTo8(pix, false)\n                            : pixConvertRGBToLuminance(pix);\n    pixDestroy(&pix);\n    return result;\n  }\n  return pix;\n}\n\n\/\/ Otsu thresholds the rectangle, taking the rectangle from *this.\nvoid ImageThresholder::OtsuThresholdRectToPix(Pix* src_pix,\n                                              Pix** out_pix) const {\n  PERF_COUNT_START(\"OtsuThresholdRectToPix\")\n  int* thresholds;\n  int* hi_values;\n\n  int num_channels = OtsuThreshold(src_pix, rect_left_, rect_top_, rect_width_,\n                                   rect_height_, &thresholds, &hi_values);\n  \/\/ only use opencl if compiled w\/ OpenCL and selected device is opencl\n#ifdef USE_OPENCL\n  OpenclDevice od;\n  if ((num_channels == 4 || num_channels == 1) &&\n      od.selectedDeviceIsOpenCL() && rect_top_ == 0 && rect_left_ == 0 ) {\n    od.ThresholdRectToPixOCL((unsigned char*)pixGetData(src_pix),\n                             num_channels, pixGetWpl(src_pix) * 4,\n                             thresholds, hi_values, out_pix \/*pix_OCL*\/,\n                             rect_height_, rect_width_, rect_top_, rect_left_);\n  } else {\n#endif\n    ThresholdRectToPix(src_pix, num_channels, thresholds, hi_values, out_pix);\n#ifdef USE_OPENCL\n  }\n#endif\n  delete [] thresholds;\n  delete [] hi_values;\n\n  PERF_COUNT_END\n}\n\n\/\/\/ Threshold the rectangle, taking everything except the src_pix\n\/\/\/ from the class, using thresholds\/hi_values to the output pix.\n\/\/\/ NOTE that num_channels is the size of the thresholds and hi_values\n\/\/ arrays and also the bytes per pixel in src_pix.\nvoid ImageThresholder::ThresholdRectToPix(Pix* src_pix,\n                                          int num_channels,\n                                          const int* thresholds,\n                                          const int* hi_values,\n                                          Pix** pix) const {\n  PERF_COUNT_START(\"ThresholdRectToPix\")\n  *pix = pixCreate(rect_width_, rect_height_, 1);\n  uinT32* pixdata = pixGetData(*pix);\n  int wpl = pixGetWpl(*pix);\n  int src_wpl = pixGetWpl(src_pix);\n  uinT32* srcdata = pixGetData(src_pix);\n  for (int y = 0; y < rect_height_; ++y) {\n    const uinT32* linedata = srcdata + (y + rect_top_) * src_wpl;\n    uinT32* pixline = pixdata + y * wpl;\n    for (int x = 0; x < rect_width_; ++x) {\n      bool white_result = true;\n      for (int ch = 0; ch < num_channels; ++ch) {\n        int pixel = GET_DATA_BYTE(const_cast<void*>(\n                                  reinterpret_cast<const void *>(linedata)),\n                                  (x + rect_left_) * num_channels + ch);\n        if (hi_values[ch] >= 0 &&\n            (pixel > thresholds[ch]) == (hi_values[ch] == 0)) {\n          white_result = false;\n          break;\n        }\n      }\n      if (white_result)\n        CLEAR_DATA_BIT(pixline, x);\n      else\n        SET_DATA_BIT(pixline, x);\n    }\n  }\n\n  PERF_COUNT_END\n}\n\n}  \/\/ namespace tesseract.\n\n<|endoftext|>"}
{"text":"<commit_before>#include <const_string\/const_string.h>\n\n#include <chrono>\n\n#include <algorithm>\n#include <numeric>\n\n#include <iostream>\n#include <random>\n#include <string>\n#include <vector>\n\nstd::vector<std::string> generate_random_strings()\n{\n\tstd::vector<std::string> ret;\n\n\tstd::string base(\n\t\t\":::::::::::::::::::::::: \"\n\t\t\"                                                                ,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,     \"\n\t\t\"sfladskjflasdjfslfslafdjlsadfjsafdsaljfdlsafdkjsaldfsadfsafowieuroquwreoqweurowqureowqieuroiwqeurouqwnfsalfvnn\"\n\t\t\"sa\"\n\t\t\"::::::::::::::::::::::::::\"\n\t\t\"safsaHHQWWEEERRTTZUIOPPPOLksdfkasdfasfdsafdljdflsafdoweroiequrwoieurqoureowquerwqorewqureiwKKJHGFDSASDFGHFDsaf\"\n\t\t\"dsaf\"\n\t\t\"d                                                                \"\n\t\t\"safdsafdsadfsadfsadfsadfsfasdfsadfsadfsadfsadfdsfafdafsfdsfwfwafs\"\n\t\t\"adfasfwafSAYXCVBVCXCVBNMNBVCXSDFGH          :::::::::,,,,,,,,,,,,,;;;;;;;;;;;\/\/\/\/\/\/\/\/\/\/\/\/\"\n\t\t\"1231231981239123129387129387129381239817239172398127398217398172398123918273981739127391828312938721\"\n\t\t\"91273198273192739182739812739821731287319823712938172398712931298371982317293127381928319273921319237129\" );\n\n\tbase = base + base + base + base + base + base + base;\n\n\tfor( int i = 0; i < 40; ++i ) {\n\t\tstd::shuffle( base.begin(), base.end(), std::random_device{} );\n\t\tret.push_back( base );\n\t}\n\treturn ret;\n}\n\nstd::vector<const_string> flatten( std::vector<std::vector<const_string>>& collections )\n{\n\tconst std::size_t total_size\n\t\t= std::accumulate( collections.begin(), collections.end(), size_t( 0 ), []( size_t size, const auto& e ) {\n\t\t\t  return size + e.size();\n\t\t  } );\n\tstd::vector<const_string> ret( total_size );\n\n\tauto out_it = ret.begin();\n\n\tfor( auto&& c : collections ) {\n\t\tout_it = std::move( c.begin(), c.end(), out_it );\n\t}\n\n\treturn ret;\n}\n\ntemplate<int Algo>\nconst_string run( const std::vector<const_string>& s, const std::vector<char>& split_chars )\n{\n\tauto cstrings = s;\n\tfor( char split_char : split_chars ) {\n\t\tstd::vector<std::vector<const_string>> tmp( cstrings.size() );\n\n\t\tsize_t i = 0;\n\n\t\tfor( auto&& s : cstrings ) {\n\t\t\tstatic_assert( 0 < Algo && Algo < 2 , \"No algorithm with that number available at the moment\" );\n\t\t\tif constexpr( Algo == 1 ) {\n\t\t\t\ttmp[i++] = s.split_full( split_char );\n\t\t\t} \/*else {\n\t\t\t\t\/\/ put other algorithm here\n\t\t\t} *\/\n\t\t}\n\t\tcstrings = flatten( tmp );\n\t}\n\n\treturn concat( cstrings );\n}\n\n\ntemplate<int Algo>\n\/\/ __declspec(noinline)\nvoid test_algo( const std::vector<const_string>& s, const std::vector<char>& split_chars )\n{\n\tusing namespace std::chrono;\n\tfor( int z = 0; z < 10; ++z ) {\n\t\tstd::chrono::nanoseconds total{};\n\t\tfor( int i = 0; i < 20; ++i ) {\n\n\t\t\tauto start = steady_clock::now();\n\n\t\t\trun<Algo>( s, split_chars );\n\n\t\t\tauto end = steady_clock::now();\n\t\t\ttotal += ( end - start );\n\t\t}\n\t\tstd::cout << total \/ std::chrono::milliseconds{1} \/ 20 << std::endl;\n\t}\n\n}\n\n\n\nint main()\n{\n\tconst auto my_strings = generate_random_strings();\n\n\tconst std::vector<char>   split_chars{' ', ':', '\/', ';', ','};\n\tstd::vector<const_string> cstrings;\n\tfor( const auto& s : my_strings ) {\n\t\tcstrings.push_back( const_string( s ) );\n\t}\n\n\ttest_algo<1>( cstrings, split_chars );\n\tstd::cout << \"========================================================\" << std::endl;\n\t\/\/test_algo<2>( cstrings, split_chars );\n\t\/\/std::cout << \"========================================================\" << std::endl;\n\t\/\/test_algo<3>( cstrings, split_chars );\n\t\/\/std::cout << \"========================================================\" << std::endl;\n\t\/\/test_algo<3>( cstrings, split_chars );\n\t\/\/std::cout << \"========================================================\" << std::endl;\n\t\/\/test_algo<2>( cstrings, split_chars );\n\t\/\/std::cout << \"========================================================\" << std::endl;\n\t\/\/test_algo<1>( cstrings, split_chars );\n\tstd::cout << detail::stats().get_total_allocs() << std::endl;\n\tstd::cout << \"========================================================\" << std::endl;\n}\n<commit_msg>[Benchmark] Make number of input strings configurable<commit_after>#include <const_string\/const_string.h>\n\n#include <chrono>\n\n#include <algorithm>\n#include <numeric>\n\n#include <iostream>\n#include <random>\n#include <string>\n#include <vector>\n\nstd::vector<std::string> generate_random_strings(int cnt)\n{\n\tstd::vector<std::string> ret;\n\n\tstd::string base(\n\t\t\":::::::::::::::::::::::: \"\n\t\t\"                                                                ,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,     \"\n\t\t\"sfladskjflasdjfslfslafdjlsadfjsafdsaljfdlsafdkjsaldfsadfsafowieuroquwreoqweurowqureowqieuroiwqeurouqwnfsalfvnn\"\n\t\t\"sa\"\n\t\t\"::::::::::::::::::::::::::\"\n\t\t\"safsaHHQWWEEERRTTZUIOPPPOLksdfkasdfasfdsafdljdflsafdoweroiequrwoieurqoureowquerwqorewqureiwKKJHGFDSASDFGHFDsaf\"\n\t\t\"dsaf\"\n\t\t\"d                                                                \"\n\t\t\"safdsafdsadfsadfsadfsadfsfasdfsadfsadfsadfsadfdsfafdafsfdsfwfwafs\"\n\t\t\"adfasfwafSAYXCVBVCXCVBNMNBVCXSDFGH          :::::::::,,,,,,,,,,,,,;;;;;;;;;;;\/\/\/\/\/\/\/\/\/\/\/\/\"\n\t\t\"1231231981239123129387129387129381239817239172398127398217398172398123918273981739127391828312938721\"\n\t\t\"91273198273192739182739812739821731287319823712938172398712931298371982317293127381928319273921319237129\" );\n\n\tbase = base + base + base + base + base + base + base;\n\n\tfor( int i = 0; i < cnt; ++i ) {\n\t\tstd::shuffle( base.begin(), base.end(), std::random_device{} );\n\t\tret.push_back( base );\n\t}\n\treturn ret;\n}\n\nstd::vector<const_string> flatten( std::vector<std::vector<const_string>>& collections )\n{\n\tconst std::size_t total_size\n\t\t= std::accumulate( collections.begin(), collections.end(), size_t( 0 ), []( size_t size, const auto& e ) {\n\t\t\t  return size + e.size();\n\t\t  } );\n\tstd::vector<const_string> ret( total_size );\n\n\tauto out_it = ret.begin();\n\n\tfor( auto&& c : collections ) {\n\t\tout_it = std::move( c.begin(), c.end(), out_it );\n\t}\n\n\treturn ret;\n}\n\ntemplate<int Algo>\nconst_string run( const std::vector<const_string>& s, const std::vector<char>& split_chars )\n{\n\tauto cstrings = s;\n\tfor( char split_char : split_chars ) {\n\t\tstd::vector<std::vector<const_string>> tmp( cstrings.size() );\n\n\t\tsize_t i = 0;\n\n\t\tfor( auto&& s : cstrings ) {\n\t\t\tstatic_assert( 0 < Algo && Algo < 2 , \"No algorithm with that number available at the moment\" );\n\t\t\tif constexpr( Algo == 1 ) {\n\t\t\t\ttmp[i++] = s.split_full( split_char );\n\t\t\t} \/*else {\n\t\t\t\t\/\/ put other algorithm here\n\t\t\t} *\/\n\t\t}\n\t\tcstrings = flatten( tmp );\n\t}\n\n\treturn concat( cstrings );\n}\n\n\ntemplate<int Algo>\n\/\/ __declspec(noinline)\nvoid test_algo( const std::vector<const_string>& s, const std::vector<char>& split_chars )\n{\n\tusing namespace std::chrono;\n\tfor( int z = 0; z < 10; ++z ) {\n\t\tstd::chrono::nanoseconds total{};\n\t\tfor( int i = 0; i < 20; ++i ) {\n\n\t\t\tauto start = steady_clock::now();\n\n\t\t\trun<Algo>( s, split_chars );\n\n\t\t\tauto end = steady_clock::now();\n\t\t\ttotal += ( end - start );\n\t\t}\n\t\tstd::cout << total \/ std::chrono::milliseconds{1} \/ 20 << std::endl;\n\t}\n\n}\n\n\n\nint main()\n{\n\tconst auto my_strings = generate_random_strings(40);\n\n\tconst std::vector<char>   split_chars{' ', ':', '\/', ';', ','};\n\tstd::vector<const_string> cstrings;\n\n\tfor( const auto& s : my_strings ) {\n\t\tcstrings.push_back( const_string( s ) );\n\t}\n\n\ttest_algo<1>( cstrings, split_chars );\n\tstd::cout << \"========================================================\" << std::endl;\n\t\/\/test_algo<2>( cstrings, split_chars );\n\t\/\/std::cout << \"========================================================\" << std::endl;\n\t\/\/test_algo<3>( cstrings, split_chars );\n\t\/\/std::cout << \"========================================================\" << std::endl;\n\t\/\/test_algo<3>( cstrings, split_chars );\n\t\/\/std::cout << \"========================================================\" << std::endl;\n\t\/\/test_algo<2>( cstrings, split_chars );\n\t\/\/std::cout << \"========================================================\" << std::endl;\n\t\/\/test_algo<1>( cstrings, split_chars );\n\tstd::cout << detail::stats().get_total_allocs() << std::endl;\n\tstd::cout << \"========================================================\" << std::endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2018 The Android Open Source Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <utils\/logging.h>\n#include <thread>\n#include <cinttypes>\n\n#include \"Game.h\"\n\nGame::Game(AAssetManager &assetManager): mAssetManager(assetManager) {\n}\n\nvoid Game::load() {\n\n    if (!openStream()) {\n        mGameState = GameState::FailedToLoad;\n        return;\n    }\n\n    if (!setupAudioSources()) {\n        mGameState = GameState::FailedToLoad;\n        return;\n    }\n\n    scheduleSongEvents();\n\n    Result result = mAudioStream->requestStart();\n    if (result != Result::OK){\n        LOGE(\"Failed to start stream. Error: %s\", convertToText(result));\n        mGameState = GameState::FailedToLoad;\n        return;\n    }\n\n    mGameState = GameState::Playing;\n}\n\nvoid Game::start() {\n\n    \/\/ async returns a future, we must store this future to avoid blocking. It's not sufficient\n    \/\/ to store this in a local variable as its destructor will block until Game::load completes.\n    mLoadingResult = std::async(&Game::load, this);\n}\n\nvoid Game::stop(){\n\n    if (mAudioStream != nullptr){\n        mAudioStream->close();\n        delete mAudioStream;\n        mAudioStream = nullptr;\n    }\n}\n\nvoid Game::tap(int64_t eventTimeAsUptime) {\n\n    if (mGameState != GameState::Playing){\n        LOGW(\"Game not in playing state, ignoring tap event\");\n    } else {\n        mClap->setPlaying(true);\n\n        int64_t nextClapWindowTimeMs;\n        if (mClapWindows.pop(nextClapWindowTimeMs)){\n\n            \/\/ Convert the tap time to a song position\n            int64_t tapTimeInSongMs = mSongPositionMs + (eventTimeAsUptime - mLastUpdateTime);\n            TapResult result = getTapResult(tapTimeInSongMs, nextClapWindowTimeMs);\n            mUiEvents.push(result);\n        }\n    }\n}\n\nvoid Game::tick(){\n\n    switch (mGameState){\n        case GameState::Playing:\n            TapResult r;\n            if (mUiEvents.pop(r)) {\n                renderEvent(r);\n            } else {\n                SetGLScreenColor(kPlayingColor);\n            }\n            break;\n\n        case GameState::Loading:\n            SetGLScreenColor(kLoadingColor);\n            break;\n\n        case GameState::FailedToLoad:\n            SetGLScreenColor(kLoadingFailedColor);\n            break;\n    }\n}\n\nvoid Game::onSurfaceCreated() {\n    SetGLScreenColor(kLoadingColor);\n}\n\nvoid Game::onSurfaceChanged(int widthInPixels, int heightInPixels) {\n}\n\nvoid Game::onSurfaceDestroyed() {\n}\n\nDataCallbackResult Game::onAudioReady(AudioStream *oboeStream, void *audioData, int32_t numFrames) {\n\n    \/\/ If our audio stream is expecting 16-bit samples we need to render our floats into a separate\n    \/\/ buffer then convert them into 16-bit ints\n    bool is16Bit = (oboeStream->getFormat() == AudioFormat::I16);\n    float *outputBuffer = (is16Bit) ? mConversionBuffer.get() : static_cast<float *>(audioData);\n\n    int64_t nextClapEventMs;\n\n    for (int i = 0; i < numFrames; ++i) {\n\n        mSongPositionMs = convertFramesToMillis(\n                mCurrentFrame,\n                mAudioStream->getSampleRate());\n\n        if (mClapEvents.peek(nextClapEventMs) && mSongPositionMs >= nextClapEventMs){\n            mClap->setPlaying(true);\n            mClapEvents.pop(nextClapEventMs);\n        }\n        mMixer.renderAudio(outputBuffer+(oboeStream->getChannelCount()*i), 1);\n        mCurrentFrame++;\n    }\n\n    if (is16Bit){\n        oboe::convertFloatToPcm16(outputBuffer,\n                                  static_cast<int16_t*>(audioData),\n                                  numFrames * oboeStream->getChannelCount());\n    }\n\n    mLastUpdateTime = nowUptimeMillis();\n\n    return DataCallbackResult::Continue;\n}\n\nvoid Game::onErrorAfterClose(AudioStream *oboeStream, Result error){\n    LOGE(\"The audio stream was closed, please restart the game. Error: %s\", convertToText(error));\n};\n\n\/**\n * Get the result of a tap\n *\n * @param tapTimeInMillis - The time the tap occurred in milliseconds\n * @param tapWindowInMillis - The time at the middle of the \"tap window\" in milliseconds\n * @return TapResult can be Early, Late or Success\n *\/\nTapResult Game::getTapResult(int64_t tapTimeInMillis, int64_t tapWindowInMillis){\n    LOGD(\"Tap time %\" PRId64 \", tap window time: %\" PRId64, tapTimeInMillis, tapWindowInMillis);\n    if (tapTimeInMillis <= tapWindowInMillis + kWindowCenterOffsetMs) {\n        if (tapTimeInMillis >= tapWindowInMillis - kWindowCenterOffsetMs) {\n            return TapResult::Success;\n        } else {\n            return TapResult::Early;\n        }\n    } else {\n        return TapResult::Late;\n    }\n}\n\nbool Game::openStream() {\n\n    \/\/ Create an audio stream\n    AudioStreamBuilder builder;\n    builder.setCallback(this);\n    builder.setPerformanceMode(PerformanceMode::LowLatency);\n    builder.setSharingMode(SharingMode::Exclusive);\n\n    Result result = builder.openStream(&mAudioStream);\n    if (result != Result::OK){\n        LOGE(\"Failed to open stream. Error: %s\", convertToText(result));\n        return false;\n    }\n\n    if (mAudioStream->getFormat() == AudioFormat::I16){\n        mConversionBuffer = std::make_unique<float[]>(\n                (size_t)mAudioStream->getBufferCapacityInFrames() *\n                mAudioStream->getChannelCount());\n    }\n\n    \/\/ Reduce stream latency by setting the buffer size to a multiple of the burst size\n    auto setBufferSizeResult = mAudioStream->setBufferSizeInFrames(\n            mAudioStream->getFramesPerBurst() * kBufferSizeInBursts);\n    if (setBufferSizeResult != Result::OK){\n        LOGW(\"Failed to set buffer size. Error: %s\", convertToText(setBufferSizeResult.error()));\n    }\n\n    return true;\n}\n\nbool Game::setupAudioSources() {\n\n    \/\/ Set the properties of our audio source(s) to match that of our audio stream\n    AudioProperties targetProperties {\n            .channelCount = mAudioStream->getChannelCount(),\n            .sampleRate = mAudioStream->getSampleRate()\n    };\n\n    \/\/ Create a data source and player for the clap sound\n    std::shared_ptr<AAssetDataSource> mClapSource {\n            AAssetDataSource::newFromCompressedAsset(mAssetManager, kClapFilename, targetProperties)\n    };\n    if (mClapSource == nullptr){\n        LOGE(\"Could not load source data for clap sound\");\n        return false;\n    }\n    mClap = std::make_shared<Player>(mClapSource);\n\n    \/\/ Create a data source and player for our backing track\n    std::shared_ptr<AAssetDataSource> backingTrackSource {\n            AAssetDataSource::newFromCompressedAsset(mAssetManager, kBackingTrackFilename, targetProperties)\n    };\n    if (backingTrackSource == nullptr){\n        LOGE(\"Could not load source data for backing track\");\n        return false;\n    }\n    mBackingTrack = std::make_shared<Player>(backingTrackSource);\n    mBackingTrack->setPlaying(true);\n    mBackingTrack->setLooping(true);\n\n    \/\/ Add both players to a mixer\n    mMixer.addTrack(mClap);\n    mMixer.addTrack(mBackingTrack);\n\n    return true;\n}\n\nvoid Game::scheduleSongEvents() {\n\n    for (auto t : kClapEvents) mClapEvents.push(t);\n    for (auto t : kClapWindows) mClapWindows.push(t);\n}\n<commit_msg>Fix stereo output. Fixes #505<commit_after>\/*\n * Copyright 2018 The Android Open Source Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <utils\/logging.h>\n#include <thread>\n#include <cinttypes>\n\n#include \"Game.h\"\n\nGame::Game(AAssetManager &assetManager): mAssetManager(assetManager) {\n}\n\nvoid Game::load() {\n\n    if (!openStream()) {\n        mGameState = GameState::FailedToLoad;\n        return;\n    }\n\n    if (!setupAudioSources()) {\n        mGameState = GameState::FailedToLoad;\n        return;\n    }\n\n    scheduleSongEvents();\n\n    Result result = mAudioStream->requestStart();\n    if (result != Result::OK){\n        LOGE(\"Failed to start stream. Error: %s\", convertToText(result));\n        mGameState = GameState::FailedToLoad;\n        return;\n    }\n\n    mGameState = GameState::Playing;\n}\n\nvoid Game::start() {\n\n    \/\/ async returns a future, we must store this future to avoid blocking. It's not sufficient\n    \/\/ to store this in a local variable as its destructor will block until Game::load completes.\n    mLoadingResult = std::async(&Game::load, this);\n}\n\nvoid Game::stop(){\n\n    if (mAudioStream != nullptr){\n        mAudioStream->close();\n        delete mAudioStream;\n        mAudioStream = nullptr;\n    }\n}\n\nvoid Game::tap(int64_t eventTimeAsUptime) {\n\n    if (mGameState != GameState::Playing){\n        LOGW(\"Game not in playing state, ignoring tap event\");\n    } else {\n        mClap->setPlaying(true);\n\n        int64_t nextClapWindowTimeMs;\n        if (mClapWindows.pop(nextClapWindowTimeMs)){\n\n            \/\/ Convert the tap time to a song position\n            int64_t tapTimeInSongMs = mSongPositionMs + (eventTimeAsUptime - mLastUpdateTime);\n            TapResult result = getTapResult(tapTimeInSongMs, nextClapWindowTimeMs);\n            mUiEvents.push(result);\n        }\n    }\n}\n\nvoid Game::tick(){\n\n    switch (mGameState){\n        case GameState::Playing:\n            TapResult r;\n            if (mUiEvents.pop(r)) {\n                renderEvent(r);\n            } else {\n                SetGLScreenColor(kPlayingColor);\n            }\n            break;\n\n        case GameState::Loading:\n            SetGLScreenColor(kLoadingColor);\n            break;\n\n        case GameState::FailedToLoad:\n            SetGLScreenColor(kLoadingFailedColor);\n            break;\n    }\n}\n\nvoid Game::onSurfaceCreated() {\n    SetGLScreenColor(kLoadingColor);\n}\n\nvoid Game::onSurfaceChanged(int widthInPixels, int heightInPixels) {\n}\n\nvoid Game::onSurfaceDestroyed() {\n}\n\nDataCallbackResult Game::onAudioReady(AudioStream *oboeStream, void *audioData, int32_t numFrames) {\n\n    \/\/ If our audio stream is expecting 16-bit samples we need to render our floats into a separate\n    \/\/ buffer then convert them into 16-bit ints\n    bool is16Bit = (oboeStream->getFormat() == AudioFormat::I16);\n    float *outputBuffer = (is16Bit) ? mConversionBuffer.get() : static_cast<float *>(audioData);\n\n    int64_t nextClapEventMs;\n\n    for (int i = 0; i < numFrames; ++i) {\n\n        mSongPositionMs = convertFramesToMillis(\n                mCurrentFrame,\n                mAudioStream->getSampleRate());\n\n        if (mClapEvents.peek(nextClapEventMs) && mSongPositionMs >= nextClapEventMs){\n            mClap->setPlaying(true);\n            mClapEvents.pop(nextClapEventMs);\n        }\n        mMixer.renderAudio(outputBuffer+(oboeStream->getChannelCount()*i), 1);\n        mCurrentFrame++;\n    }\n\n    if (is16Bit){\n        oboe::convertFloatToPcm16(outputBuffer,\n                                  static_cast<int16_t*>(audioData),\n                                  numFrames * oboeStream->getChannelCount());\n    }\n\n    mLastUpdateTime = nowUptimeMillis();\n\n    return DataCallbackResult::Continue;\n}\n\nvoid Game::onErrorAfterClose(AudioStream *oboeStream, Result error){\n    LOGE(\"The audio stream was closed, please restart the game. Error: %s\", convertToText(error));\n};\n\n\/**\n * Get the result of a tap\n *\n * @param tapTimeInMillis - The time the tap occurred in milliseconds\n * @param tapWindowInMillis - The time at the middle of the \"tap window\" in milliseconds\n * @return TapResult can be Early, Late or Success\n *\/\nTapResult Game::getTapResult(int64_t tapTimeInMillis, int64_t tapWindowInMillis){\n    LOGD(\"Tap time %\" PRId64 \", tap window time: %\" PRId64, tapTimeInMillis, tapWindowInMillis);\n    if (tapTimeInMillis <= tapWindowInMillis + kWindowCenterOffsetMs) {\n        if (tapTimeInMillis >= tapWindowInMillis - kWindowCenterOffsetMs) {\n            return TapResult::Success;\n        } else {\n            return TapResult::Early;\n        }\n    } else {\n        return TapResult::Late;\n    }\n}\n\nbool Game::openStream() {\n\n    \/\/ Create an audio stream\n    AudioStreamBuilder builder;\n    builder.setCallback(this);\n    builder.setPerformanceMode(PerformanceMode::LowLatency);\n    builder.setSharingMode(SharingMode::Exclusive);\n\n    Result result = builder.openStream(&mAudioStream);\n    if (result != Result::OK){\n        LOGE(\"Failed to open stream. Error: %s\", convertToText(result));\n        return false;\n    }\n\n    if (mAudioStream->getFormat() == AudioFormat::I16){\n        mConversionBuffer = std::make_unique<float[]>(\n                (size_t)mAudioStream->getBufferCapacityInFrames() *\n                mAudioStream->getChannelCount());\n    }\n\n    \/\/ Reduce stream latency by setting the buffer size to a multiple of the burst size\n    auto setBufferSizeResult = mAudioStream->setBufferSizeInFrames(\n            mAudioStream->getFramesPerBurst() * kBufferSizeInBursts);\n    if (setBufferSizeResult != Result::OK){\n        LOGW(\"Failed to set buffer size. Error: %s\", convertToText(setBufferSizeResult.error()));\n    }\n\n    mMixer.setChannelCount(mAudioStream->getChannelCount());\n\n    return true;\n}\n\nbool Game::setupAudioSources() {\n\n    \/\/ Set the properties of our audio source(s) to match that of our audio stream\n    AudioProperties targetProperties {\n            .channelCount = mAudioStream->getChannelCount(),\n            .sampleRate = mAudioStream->getSampleRate()\n    };\n\n    \/\/ Create a data source and player for the clap sound\n    std::shared_ptr<AAssetDataSource> mClapSource {\n            AAssetDataSource::newFromCompressedAsset(mAssetManager, kClapFilename, targetProperties)\n    };\n    if (mClapSource == nullptr){\n        LOGE(\"Could not load source data for clap sound\");\n        return false;\n    }\n    mClap = std::make_shared<Player>(mClapSource);\n\n    \/\/ Create a data source and player for our backing track\n    std::shared_ptr<AAssetDataSource> backingTrackSource {\n            AAssetDataSource::newFromCompressedAsset(mAssetManager, kBackingTrackFilename, targetProperties)\n    };\n    if (backingTrackSource == nullptr){\n        LOGE(\"Could not load source data for backing track\");\n        return false;\n    }\n    mBackingTrack = std::make_shared<Player>(backingTrackSource);\n    mBackingTrack->setPlaying(true);\n    mBackingTrack->setLooping(true);\n\n    \/\/ Add both players to a mixer\n    mMixer.addTrack(mClap);\n    mMixer.addTrack(mBackingTrack);\n\n    return true;\n}\n\nvoid Game::scheduleSongEvents() {\n\n    for (auto t : kClapEvents) mClapEvents.push(t);\n    for (auto t : kClapWindows) mClapWindows.push(t);\n}\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>shut up int\/unsigned warning complaint<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 = (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 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>\/***********************************************************************\n    filename:   CEGUIEventSet.cpp\n    created:    21\/2\/2004\n    author:     Paul D Turner\n\n    purpose:    Implements the EventSet class\n*************************************************************************\/\n\/***************************************************************************\n *   Copyright (C) 2004 - 2010 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\/EventSet.h\"\n#include \"CEGUI\/Exceptions.h\"\n#include \"CEGUI\/GlobalEventSet.h\"\n#include \"CEGUI\/ScriptModule.h\"\n#include \"CEGUI\/System.h\"\n\n\/\/ Start of CEGUI namespace section\nnamespace CEGUI\n{\n\/\/----------------------------------------------------------------------------\/\/\nEventSet::EventSet() :\n    d_muted(false)\n{\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nEventSet::~EventSet(void)\n{\n    removeAllEvents();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid EventSet::addEvent(const String& name)\n{\n    addEvent(*CEGUI_NEW_AO Event(name));\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid EventSet::addEvent(Event& event)\n{\n    const String name(event.getName());\n\n    if (isEventPresent(name))\n    {\n        CEGUI_DELETE_AO &event;\n\n        CEGUI_THROW(AlreadyExistsException(\"EventSet::addEvent: \"\n            \"An event named '\" + name + \"' already exists in the EventSet.\"));\n    }\n\n    d_events.insert(std::make_pair(name, &event));\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid EventSet::removeEvent(const String& name)\n{\n    EventMap::iterator pos = d_events.find(name);\n\n\tif (pos != d_events.end())\n\t{\n\t\tCEGUI_DELETE_AO pos->second;\n\t\td_events.erase(pos);\n\t}\n\n    \/\/ todo: shouldn't this throw exception if not found?\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid EventSet::removeEvent(Event& event)\n{\n    removeEvent(event.getName());\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid EventSet::removeAllEvents(void)\n{\n\tEventMap::const_iterator pos = d_events.begin();\n\tEventMap::const_iterator end = d_events.end()\t;\n\n\tfor (; pos != end; ++pos)\n\t\tCEGUI_DELETE_AO pos->second;\n\n    d_events.clear();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool EventSet::isEventPresent(const String& name)\n{\n    return (d_events.find(name) != d_events.end());\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nEvent::Connection EventSet::subscribeScriptedEvent(const String& name,\n                                                   const String& subscriber_name)\n{\n    return getScriptModule()->subscribeEvent(this, name, subscriber_name);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nEvent::Connection EventSet::subscribeScriptedEvent(const String& name,\n                                                   Event::Group group,\n                                                   const String& subscriber_name)\n{\n    return getScriptModule()->subscribeEvent(this, name, group, subscriber_name);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nScriptModule* EventSet::getScriptModule() const\n{\n    ScriptModule* sm = System::getSingletonPtr()->getScriptingModule();\n\n    if (sm)\n        return sm;\n\n    CEGUI_THROW(InvalidRequestException(\"EventSet::getScriptingModule: \"\n        \"No scripting module is available.\"));\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nEvent::Connection EventSet::subscribeEvent(const String& name,\n                                           Event::Subscriber subscriber)\n{\n    return getEventObject(name, true)->subscribe(subscriber);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nEvent::Connection EventSet::subscribeEvent(const String& name,\n                                           Event::Group group,\n                                           Event::Subscriber subscriber)\n{\n    return getEventObject(name, true)->subscribe(group, subscriber);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid EventSet::fireEvent(const String& name,\n                         EventArgs& args,\n                         const String& eventNamespace)\n{\n    if (GlobalEventSet* ges = GlobalEventSet::getSingletonPtr())\n        ges->fireEvent(name, args, eventNamespace);\n\n    fireEvent_impl(name, args);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool EventSet::isMuted(void) const\n{\n    return d_muted;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid EventSet::setMutedState(bool setting)\n{\n    d_muted = setting;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nEvent* EventSet::getEventObject(const String& name, bool autoAdd)\n{\n    EventMap::const_iterator pos = d_events.find(name);\n\n    \/\/ if event did not exist, add it as needed and then find it.\n    if (pos == d_events.end())\n    {\n        if (!autoAdd)\n            return 0;\n\n        addEvent(name);\n        pos = d_events.find(name);\n    }\n\n    return pos->second;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid EventSet::fireEvent_impl(const String& name, EventArgs& args)\n{\n    Event* ev = getEventObject(name);\n\n    if ((ev != 0) && !d_muted)\n        (*ev)(args);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nEventSet::EventIterator EventSet::getEventIterator(void) const\n{\n    return EventIterator(d_events.begin(), d_events.end());\n}\n\n\/\/----------------------------------------------------------------------------\/\/\n\n} \/\/ End of  CEGUI namespace section\n\n<commit_msg>removing 'todo' question comment: An exception is not to be thrown here (as per the documentation).  Since Event objects are usually added as-needed upon first subscription, it could be extremely difficult for anyone trying to manage calls to an EventSet::removeEvent function that throws - not throwing is definitely the Right Thing™ here.<commit_after>\/***********************************************************************\n    filename:   CEGUIEventSet.cpp\n    created:    21\/2\/2004\n    author:     Paul D Turner\n\n    purpose:    Implements the EventSet class\n*************************************************************************\/\n\/***************************************************************************\n *   Copyright (C) 2004 - 2010 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\/EventSet.h\"\n#include \"CEGUI\/Exceptions.h\"\n#include \"CEGUI\/GlobalEventSet.h\"\n#include \"CEGUI\/ScriptModule.h\"\n#include \"CEGUI\/System.h\"\n\n\/\/ Start of CEGUI namespace section\nnamespace CEGUI\n{\n\/\/----------------------------------------------------------------------------\/\/\nEventSet::EventSet() :\n    d_muted(false)\n{\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nEventSet::~EventSet(void)\n{\n    removeAllEvents();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid EventSet::addEvent(const String& name)\n{\n    addEvent(*CEGUI_NEW_AO Event(name));\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid EventSet::addEvent(Event& event)\n{\n    const String name(event.getName());\n\n    if (isEventPresent(name))\n    {\n        CEGUI_DELETE_AO &event;\n\n        CEGUI_THROW(AlreadyExistsException(\"EventSet::addEvent: \"\n            \"An event named '\" + name + \"' already exists in the EventSet.\"));\n    }\n\n    d_events.insert(std::make_pair(name, &event));\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid EventSet::removeEvent(const String& name)\n{\n    EventMap::iterator pos = d_events.find(name);\n\n\tif (pos != d_events.end())\n\t{\n\t\tCEGUI_DELETE_AO pos->second;\n\t\td_events.erase(pos);\n\t}\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid EventSet::removeEvent(Event& event)\n{\n    removeEvent(event.getName());\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid EventSet::removeAllEvents(void)\n{\n\tEventMap::const_iterator pos = d_events.begin();\n\tEventMap::const_iterator end = d_events.end()\t;\n\n\tfor (; pos != end; ++pos)\n\t\tCEGUI_DELETE_AO pos->second;\n\n    d_events.clear();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool EventSet::isEventPresent(const String& name)\n{\n    return (d_events.find(name) != d_events.end());\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nEvent::Connection EventSet::subscribeScriptedEvent(const String& name,\n                                                   const String& subscriber_name)\n{\n    return getScriptModule()->subscribeEvent(this, name, subscriber_name);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nEvent::Connection EventSet::subscribeScriptedEvent(const String& name,\n                                                   Event::Group group,\n                                                   const String& subscriber_name)\n{\n    return getScriptModule()->subscribeEvent(this, name, group, subscriber_name);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nScriptModule* EventSet::getScriptModule() const\n{\n    ScriptModule* sm = System::getSingletonPtr()->getScriptingModule();\n\n    if (sm)\n        return sm;\n\n    CEGUI_THROW(InvalidRequestException(\"EventSet::getScriptingModule: \"\n        \"No scripting module is available.\"));\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nEvent::Connection EventSet::subscribeEvent(const String& name,\n                                           Event::Subscriber subscriber)\n{\n    return getEventObject(name, true)->subscribe(subscriber);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nEvent::Connection EventSet::subscribeEvent(const String& name,\n                                           Event::Group group,\n                                           Event::Subscriber subscriber)\n{\n    return getEventObject(name, true)->subscribe(group, subscriber);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid EventSet::fireEvent(const String& name,\n                         EventArgs& args,\n                         const String& eventNamespace)\n{\n    if (GlobalEventSet* ges = GlobalEventSet::getSingletonPtr())\n        ges->fireEvent(name, args, eventNamespace);\n\n    fireEvent_impl(name, args);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nbool EventSet::isMuted(void) const\n{\n    return d_muted;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid EventSet::setMutedState(bool setting)\n{\n    d_muted = setting;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nEvent* EventSet::getEventObject(const String& name, bool autoAdd)\n{\n    EventMap::const_iterator pos = d_events.find(name);\n\n    \/\/ if event did not exist, add it as needed and then find it.\n    if (pos == d_events.end())\n    {\n        if (!autoAdd)\n            return 0;\n\n        addEvent(name);\n        pos = d_events.find(name);\n    }\n\n    return pos->second;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid EventSet::fireEvent_impl(const String& name, EventArgs& args)\n{\n    Event* ev = getEventObject(name);\n\n    if ((ev != 0) && !d_muted)\n        (*ev)(args);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nEventSet::EventIterator EventSet::getEventIterator(void) const\n{\n    return EventIterator(d_events.begin(), d_events.end());\n}\n\n\/\/----------------------------------------------------------------------------\/\/\n\n} \/\/ End of  CEGUI namespace section\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef ASTI_TESSELLATE_HPP\n#define ASTI_TESSELLATE_HPP\n\n#include \"special.hpp\"\n#include \"polyline.hpp\"\n#include \"spline_traits.hpp\"\n#include \"bspline_queries.hpp\"\n#include \"spline_norms.hpp\"\n\nnamespace geom\n{\n\ntemplate <class SplineCurve>\npolyline<typename spline_traits<SplineCurve>::point_t>\ntessellate(const SplineCurve& crv, double epsilon)\n{\n    double width = qry::param_range(crv).second;\n    width -= qry::param_range(crv).first;\n    assert(width > 0 );\n\n\tdouble twonrm =  two_norm_squared(crv);\n\n    double delta =\n        util::nroot( 24.0 * epsilon * epsilon * width\n                     \/ twonrm, 5 );\n\n    long num_segs = long (ceil(width\/delta) );\n    delta = width\/num_segs;\n\n    typedef typename spline_traits<SplineCurve>::point_t Point;\n\tARRAY_TYPE(Point) crvpts(num_segs+1);\n#pragma loop(hint_parallel(8))\n    for(long i = 0 ; i <= num_segs;++i)\n    {\n        double u = crv.param_range().first + i*delta;\n        crvpts[i] =  crv.eval(u);\n    }\n    return polyline<Point>(std::move(crvpts),\n                           crv.param_range().first,\n                           crv.param_range().second);\n}\n}\n#endif \/\/ ASTI_TESSELLATE_HPP\n<commit_msg>Update tessellate.hpp<commit_after>#ifndef ASTI_TESSELLATE_HPP\n#define ASTI_TESSELLATE_HPP\n\n#include \"special.hpp\"\n#include \"polyline.hpp\"\n#include \"spline_traits.hpp\"\n#include \"bspline_queries.hpp\"\n#include \"spline_norms.hpp\"\n\nnamespace geom\n{\n\ntemplate <class SplineCurve>\npolyline<typename spline_traits<SplineCurve>::point_t>\ntessellate(const SplineCurve& crv, double epsilon)\n{\n    double width = qry::param_range(crv).second;\n    width -= qry::param_range(crv).first;\n    assert(width > 0 );\n\n\tdouble twonrm =  two_norm_squared(crv);\n\n    double delta =  util::nroot( 24.0 * epsilon * epsilon * width\n                    \/ twonrm, 5 );\n\n    long num_segs = long (ceil(width\/delta) );\n    delta = width\/num_segs;\n\n    typedef typename spline_traits<SplineCurve>::point_t Point;\n\tARRAY_TYPE(Point) crvpts(num_segs+1);\n#pragma loop(hint_parallel(8))\n    for(long i = 0 ; i <= num_segs;++i)\n    {\n        double u = crv.param_range().first + i*delta;\n        crvpts[i] =  crv.eval(u);\n    }\n    return polyline<Point>(std::move(crvpts),\n                           crv.param_range().first,\n                           crv.param_range().second);\n}\n}\n#endif \/\/ ASTI_TESSELLATE_HPP\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>GPU Calc: implemented PI<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>vcl: remove System as friend of OutputDevice<commit_after><|endoftext|>"}
{"text":"<commit_before>#include <set>\n#include <apf.h>\n#include <PCU.h>\n#include \"parma_vtxSelector.h\"\n#include \"parma_targets.h\"\n#include \"parma_weights.h\"\n\nnamespace {\n  typedef std::set<apf::MeshEntity*> SetEnt;\n\n  class ElmLtVtxSelector : public parma::VtxSelector {\n    private:\n      parma::Mid sendingVtx;\n      double maxVtx;\n\n    public:\n      ElmLtVtxSelector(apf::Mesh* m, apf::MeshTag* w, double maxV)\n        : VtxSelector(m, w), maxVtx(maxV) {}\n\n      apf::Migration* run(parma::Targets* tgts) {\n        apf::Migration* plan = new apf::Migration(mesh);\n        double planW = 0;\n        for(int max=2; max <= 12; max+=2)\n          planW += select(tgts, plan, planW, max);\n        cancel(&plan, trim(tgts));\n        return plan;\n      }\n\n    protected:\n      void addCavityVtx(apf::MeshEntity* e, SetEnt& s) {\n        apf::Adjacent adjVtx;\n        mesh->getAdjacent(e, 0, adjVtx);\n        APF_ITERATE(apf::Adjacent, adjVtx, adjItr)\n          s.insert(*adjItr);\n      }\n\n      double cavityWeight(SetEnt& s) {\n        double w = 0;\n        APF_ITERATE(SetEnt, s, sItr)\n          w += getWeight(*sItr);\n        return w;\n      }\n\n      double cavityWeight(SetEnt& s, int dest) {\n        double w = 0;\n        APF_ITERATE(SetEnt, s, sItr) {\n          apf::Copies rmts;\n          mesh->getRemotes(*sItr,rmts);\n          bool shared = false;\n          APF_ITERATE(apf::Copies, rmts, r)\n            if( r->first == dest ) {\n              shared = true;\n              break;\n            }\n          if( !shared )\n            w += getWeight(*sItr);\n        }\n        return w;\n      }\n\n      void cancel(apf::Migration** plan, parma::Mid* order) {\n\n        apf::Migration* planA = *plan;\n        typedef std::pair<apf::MeshEntity*, int> PairEntInt;\n        std::vector<PairEntInt > keep;\n        const size_t planSz = static_cast<size_t>(planA->count());\n        keep.reserve(planSz);\n\n        std::map<int,SetEnt > peerSelections;\n        for(int i=0; i < planA->count(); i++) {\n           apf::MeshEntity* e = planA->get(i);\n           int dest = planA->sending(e);\n           SetEnt vset = peerSelections[dest];\n           addCavityVtx(e, vset);\n           if( cavityWeight(vset) <= (*order)[dest] ) {\n             keep.push_back(PairEntInt(e,dest));\n             peerSelections[dest] = vset;\n           }\n        }\n        delete order;\n        delete planA;\n        *plan = new apf::Migration(mesh);\n        for(size_t i=0; i < keep.size(); i++)\n          (*plan)->send(keep[i].first, keep[i].second);\n      }\n\n      typedef std::pair<int,double> Migr;\n      struct CompareMigr {\n        bool operator()(const Migr& a, const Migr& b) const {\n          if( a.second < b.second )\n            return true;\n          else\n            return false;\n        }\n      };\n\n      parma::Mid* trim(parma::Targets*) {\n        typedef std::set<Migr,CompareMigr> MigrComm;\n\n        PCU_Comm_Begin();\n        APF_ITERATE(parma::Mid, sendingVtx, s) {\n          PCU_COMM_PACK(s->first, s->second);\n        }\n        PCU_Comm_Send();\n\n        MigrComm incoming;\n        double w;\n        while (PCU_Comm_Listen()) {\n          PCU_COMM_UNPACK(w);\n          incoming.insert(Migr(PCU_Comm_Sender(),w));\n        }\n\n        double selfW = parma::getWeight(mesh,wtag,0);\n        parma::Mid accept;\n        double totW = selfW;\n        APF_ITERATE(MigrComm, incoming, in) {\n          double avail = maxVtx - totW;\n          if( avail > 0 )\n            if( in->second <= avail )\n              accept[in->first] = in->second;\n            else\n              accept[in->first] = avail;\n          else\n            accept[in->first] = 0;\n          totW += accept[in->first];\n        }\n\n        PCU_Comm_Begin();\n        APF_ITERATE(parma::Mid, accept, a)\n          PCU_COMM_PACK(a->first, a->second);\n        PCU_Comm_Send();\n        parma::Mid* order = new parma::Mid;\n        double outw;\n        while (PCU_Comm_Listen()) {\n          PCU_COMM_UNPACK(outw);\n          (*order)[PCU_Comm_Sender()] = outw;\n        }\n        return order;\n      }\n\n      virtual double add(apf::MeshEntity*, apf::Up& cavity,\n          const int destPid, apf::Migration* plan) {\n        SetEnt cav;\n        double w = 0;\n        for(int i=0; i < cavity.n; i++) {\n          addCavityVtx(cavity.e[i], cav);\n          plan->send(cavity.e[i], destPid);\n          w += getWeight(cavity.e[i]);\n        }\n        sendingVtx[destPid] += cavityWeight(cav);\n        return w;\n      }\n  };\n}\/\/end namespace \n\nnamespace parma {\n  Selector* makeElmLtVtxSelector(apf::Mesh* m, apf::MeshTag* w, double maxVtx) {\n    return new ElmLtVtxSelector(m, w, maxVtx);\n  }\n} \n<commit_msg>remove dead code - silences warning<commit_after>#include <set>\n#include <apf.h>\n#include <PCU.h>\n#include \"parma_vtxSelector.h\"\n#include \"parma_targets.h\"\n#include \"parma_weights.h\"\n\nnamespace {\n  typedef std::set<apf::MeshEntity*> SetEnt;\n\n  class ElmLtVtxSelector : public parma::VtxSelector {\n    private:\n      parma::Mid sendingVtx;\n      double maxVtx;\n\n    public:\n      ElmLtVtxSelector(apf::Mesh* m, apf::MeshTag* w, double maxV)\n        : VtxSelector(m, w), maxVtx(maxV) {}\n\n      apf::Migration* run(parma::Targets* tgts) {\n        apf::Migration* plan = new apf::Migration(mesh);\n        double planW = 0;\n        for(int max=2; max <= 12; max+=2)\n          planW += select(tgts, plan, planW, max);\n        cancel(&plan, trim(tgts));\n        return plan;\n      }\n\n    protected:\n      void addCavityVtx(apf::MeshEntity* e, SetEnt& s) {\n        apf::Adjacent adjVtx;\n        mesh->getAdjacent(e, 0, adjVtx);\n        APF_ITERATE(apf::Adjacent, adjVtx, adjItr)\n          s.insert(*adjItr);\n      }\n\n      double cavityWeight(SetEnt& s) {\n        double w = 0;\n        APF_ITERATE(SetEnt, s, sItr)\n          w += getWeight(*sItr);\n        return w;\n      }\n\n      void cancel(apf::Migration** plan, parma::Mid* order) {\n        apf::Migration* planA = *plan;\n        typedef std::pair<apf::MeshEntity*, int> PairEntInt;\n        std::vector<PairEntInt > keep;\n        const size_t planSz = static_cast<size_t>(planA->count());\n        keep.reserve(planSz);\n\n        std::map<int,SetEnt > peerSelections;\n        for(int i=0; i < planA->count(); i++) {\n           apf::MeshEntity* e = planA->get(i);\n           int dest = planA->sending(e);\n           SetEnt vset = peerSelections[dest];\n           addCavityVtx(e, vset);\n           if( cavityWeight(vset) <= (*order)[dest] ) {\n             keep.push_back(PairEntInt(e,dest));\n             peerSelections[dest] = vset;\n           }\n        }\n        delete order;\n        delete planA;\n        *plan = new apf::Migration(mesh);\n        for(size_t i=0; i < keep.size(); i++)\n          (*plan)->send(keep[i].first, keep[i].second);\n      }\n\n      typedef std::pair<int,double> Migr;\n      struct CompareMigr {\n        bool operator()(const Migr& a, const Migr& b) const {\n          if( a.second < b.second )\n            return true;\n          else\n            return false;\n        }\n      };\n\n      parma::Mid* trim(parma::Targets*) {\n        typedef std::set<Migr,CompareMigr> MigrComm;\n\n        PCU_Comm_Begin();\n        APF_ITERATE(parma::Mid, sendingVtx, s) {\n          PCU_COMM_PACK(s->first, s->second);\n        }\n        PCU_Comm_Send();\n\n        MigrComm incoming;\n        double w;\n        while (PCU_Comm_Listen()) {\n          PCU_COMM_UNPACK(w);\n          incoming.insert(Migr(PCU_Comm_Sender(),w));\n        }\n\n        double selfW = parma::getWeight(mesh,wtag,0);\n        parma::Mid accept;\n        double totW = selfW;\n        APF_ITERATE(MigrComm, incoming, in) {\n          double avail = maxVtx - totW;\n          if( avail > 0 )\n            if( in->second <= avail )\n              accept[in->first] = in->second;\n            else\n              accept[in->first] = avail;\n          else\n            accept[in->first] = 0;\n          totW += accept[in->first];\n        }\n\n        PCU_Comm_Begin();\n        APF_ITERATE(parma::Mid, accept, a)\n          PCU_COMM_PACK(a->first, a->second);\n        PCU_Comm_Send();\n        parma::Mid* order = new parma::Mid;\n        double outw;\n        while (PCU_Comm_Listen()) {\n          PCU_COMM_UNPACK(outw);\n          (*order)[PCU_Comm_Sender()] = outw;\n        }\n        return order;\n      }\n\n      virtual double add(apf::MeshEntity*, apf::Up& cavity,\n          const int destPid, apf::Migration* plan) {\n        SetEnt cav;\n        double w = 0;\n        for(int i=0; i < cavity.n; i++) {\n          addCavityVtx(cavity.e[i], cav);\n          plan->send(cavity.e[i], destPid);\n          w += getWeight(cavity.e[i]);\n        }\n        sendingVtx[destPid] += cavityWeight(cav);\n        return w;\n      }\n  };\n}\/\/end namespace \n\nnamespace parma {\n  Selector* makeElmLtVtxSelector(apf::Mesh* m, apf::MeshTag* w, double maxVtx) {\n    return new ElmLtVtxSelector(m, w, maxVtx);\n  }\n} \n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2022 The Centipede Authors.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/      https:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \".\/centipede_interface.h\"\n\n#include <signal.h>\n\n#include <cstddef>\n#include <cstdint>\n#include <cstdlib>\n#include <filesystem>\n#include <memory>\n#include <string>\n#include <thread>  \/\/ NOLINT(build\/c++11)\n#include <vector>\n\n#include \"absl\/status\/status.h\"\n#include \"absl\/strings\/str_replace.h\"\n#include \"absl\/types\/span.h\"\n#include \".\/blob_file.h\"\n#include \".\/centipede.h\"\n#include \".\/command.h\"\n#include \".\/coverage.h\"\n#include \".\/defs.h\"\n#include \".\/environment.h\"\n#include \".\/logging.h\"\n#include \".\/remote_file.h\"\n#include \".\/stats.h\"\n#include \".\/symbol_table.h\"\n#include \".\/util.h\"\n\nnamespace centipede {\n\nnamespace {\n\n\/\/ Sets signal handler for SIGINT.\nvoid SetSignalHandlers() {\n  struct sigaction sigact = {};\n  sigact.sa_handler = [](int) {\n    ABSL_RAW_LOG(INFO, \"SIGINT caught; cleaning up\\n\");\n    RequestEarlyExit(EXIT_FAILURE);\n  };\n  sigaction(SIGINT, &sigact, nullptr);\n}\n\n\/\/ Runs env.for_each_blob on every blob extracted from env.args.\n\/\/ Returns EXIT_SUCCESS on success, EXIT_FAILURE otherwise.\nint ForEachBlob(const Environment &env) {\n  auto tmpdir = TemporaryLocalDirPath();\n  CreateLocalDirRemovedAtExit(tmpdir);\n  std::string tmpfile = std::filesystem::path(tmpdir).append(\"t\");\n\n  for (const auto &arg : env.args) {\n    LOG(INFO) << \"Running '\" << env.for_each_blob << \"' on \" << arg;\n    auto blob_reader = DefaultBlobFileReaderFactory();\n    absl::Status open_status = blob_reader->Open(arg);\n    if (!open_status.ok()) {\n      LOG(INFO) << \"Failed to open \" << arg << \": \" << open_status;\n      return EXIT_FAILURE;\n    }\n    absl::Span<uint8_t> blob;\n    while (blob_reader->Read(blob) == absl::OkStatus()) {\n      ByteArray bytes;\n      bytes.insert(bytes.begin(), blob.data(), blob.end());\n      \/\/ TODO(kcc): [impl] add a variant of WriteToLocalFile that accepts Span.\n      WriteToLocalFile(tmpfile, bytes);\n      std::string command_line = absl::StrReplaceAll(\n          env.for_each_blob, {{\"%P\", tmpfile}, {\"%H\", Hash(bytes)}});\n      Command cmd(command_line);\n      \/\/ TODO(kcc): [as-needed] this creates one process per blob.\n      \/\/ If this flag gets active use, we may want to define special cases,\n      \/\/ e.g. if for_each_blob==\"cp %P \/some\/where\" we can do it in-process.\n      cmd.Execute();\n      if (EarlyExitRequested()) return ExitCode();\n    }\n  }\n  return EXIT_SUCCESS;\n}\n\n}  \/\/ namespace\n\nint CentipedeMain(const Environment &env,\n                  CentipedeCallbacksFactory &callbacks_factory) {\n  SetSignalHandlers();\n\n  if (!env.save_corpus_to_local_dir.empty())\n    return Centipede::SaveCorpusToLocalDir(env, env.save_corpus_to_local_dir);\n\n  if (!env.for_each_blob.empty()) return ForEachBlob(env);\n\n  \/\/ Just export the corpus from a local dir and exit.\n  if (!env.export_corpus_from_local_dir.empty())\n    return Centipede::ExportCorpusFromLocalDir(\n        env, env.export_corpus_from_local_dir);\n\n  \/\/ Export the corpus from a local dir and then fuzz.\n  if (!env.corpus_dir.empty()) {\n    for (const auto &corpus_dir : env.corpus_dir) {\n      Centipede::ExportCorpusFromLocalDir(env, corpus_dir);\n    }\n  }\n\n  \/\/ Create the coverage dir once, before creating any threads.\n  LOG(INFO) << \"Coverage dir \" << env.MakeCoverageDirPath();\n  RemoteMkdir(env.MakeCoverageDirPath());\n\n  auto one_time_callbacks = callbacks_factory.create(env);\n  Coverage::PCTable pc_table;\n  SymbolTable symbols;\n  one_time_callbacks->PopulateSymbolAndPcTables(symbols, pc_table);\n  callbacks_factory.destroy(one_time_callbacks);\n  if (env.use_pcpair_features) {\n    CHECK(!pc_table.empty())\n        << \"use_pcpair_features requires non-empty pc_table\";\n  }\n  CoverageLogger coverage_logger(pc_table, symbols);\n\n  auto thread_callback = [&](Environment &my_env, Stats &stats) {\n    CreateLocalDirRemovedAtExit(TemporaryLocalDirPath());  \/\/ creates temp dir.\n    my_env.seed = GetRandomSeed(env.seed);  \/\/ uses TID, call in this thread.\n    auto user_callbacks = callbacks_factory.create(my_env);\n    Centipede centipede(my_env, *user_callbacks, pc_table, symbols,\n                        coverage_logger, stats);\n    centipede.FuzzingLoop();\n    callbacks_factory.destroy(user_callbacks);\n  };\n\n  std::vector<Environment> envs(env.num_threads, env);\n  std::vector<Stats> stats_vec(env.num_threads);\n  std::vector<std::thread> threads(env.num_threads);\n\n  \/\/ Create threads.\n  for (size_t thread_idx = 0; thread_idx < env.num_threads; thread_idx++) {\n    Environment &my_env = envs[thread_idx];\n    my_env.my_shard_index = env.my_shard_index + thread_idx;\n    my_env.UpdateForExperiment();\n    threads[thread_idx] = std::thread(thread_callback, std::ref(my_env),\n                                      std::ref(stats_vec[thread_idx]));\n  }\n  \/\/ Join threads.\n  for (size_t thread_idx = 0; thread_idx < env.num_threads; thread_idx++) {\n    threads[thread_idx].join();\n  }\n\n  PrintExperimentStats(stats_vec, envs, std::cerr);\n\n  return ExitCode();\n}\n\n}  \/\/ namespace centipede\n<commit_msg>#Centipede Run PrintExperimentStats periodically in a separate thread.<commit_after>\/\/ Copyright 2022 The Centipede Authors.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/      https:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \".\/centipede_interface.h\"\n\n#include <signal.h>\n\n#include <cstddef>\n#include <cstdint>\n#include <cstdlib>\n#include <filesystem>\n#include <memory>\n#include <sstream>\n#include <string>\n#include <thread>  \/\/ NOLINT(build\/c++11)\n#include <vector>\n\n#include \"absl\/status\/status.h\"\n#include \"absl\/strings\/str_replace.h\"\n#include \"absl\/types\/span.h\"\n#include \".\/blob_file.h\"\n#include \".\/centipede.h\"\n#include \".\/command.h\"\n#include \".\/coverage.h\"\n#include \".\/defs.h\"\n#include \".\/environment.h\"\n#include \".\/logging.h\"\n#include \".\/remote_file.h\"\n#include \".\/stats.h\"\n#include \".\/symbol_table.h\"\n#include \".\/util.h\"\n\nnamespace centipede {\n\nnamespace {\n\n\/\/ Sets signal handler for SIGINT.\nvoid SetSignalHandlers() {\n  struct sigaction sigact = {};\n  sigact.sa_handler = [](int) {\n    ABSL_RAW_LOG(INFO, \"SIGINT caught; cleaning up\\n\");\n    RequestEarlyExit(EXIT_FAILURE);\n  };\n  sigaction(SIGINT, &sigact, nullptr);\n}\n\n\/\/ Runs env.for_each_blob on every blob extracted from env.args.\n\/\/ Returns EXIT_SUCCESS on success, EXIT_FAILURE otherwise.\nint ForEachBlob(const Environment &env) {\n  auto tmpdir = TemporaryLocalDirPath();\n  CreateLocalDirRemovedAtExit(tmpdir);\n  std::string tmpfile = std::filesystem::path(tmpdir).append(\"t\");\n\n  for (const auto &arg : env.args) {\n    LOG(INFO) << \"Running '\" << env.for_each_blob << \"' on \" << arg;\n    auto blob_reader = DefaultBlobFileReaderFactory();\n    absl::Status open_status = blob_reader->Open(arg);\n    if (!open_status.ok()) {\n      LOG(INFO) << \"Failed to open \" << arg << \": \" << open_status;\n      return EXIT_FAILURE;\n    }\n    absl::Span<uint8_t> blob;\n    while (blob_reader->Read(blob) == absl::OkStatus()) {\n      ByteArray bytes;\n      bytes.insert(bytes.begin(), blob.data(), blob.end());\n      \/\/ TODO(kcc): [impl] add a variant of WriteToLocalFile that accepts Span.\n      WriteToLocalFile(tmpfile, bytes);\n      std::string command_line = absl::StrReplaceAll(\n          env.for_each_blob, {{\"%P\", tmpfile}, {\"%H\", Hash(bytes)}});\n      Command cmd(command_line);\n      \/\/ TODO(kcc): [as-needed] this creates one process per blob.\n      \/\/ If this flag gets active use, we may want to define special cases,\n      \/\/ e.g. if for_each_blob==\"cp %P \/some\/where\" we can do it in-process.\n      cmd.Execute();\n      if (EarlyExitRequested()) return ExitCode();\n    }\n  }\n  return EXIT_SUCCESS;\n}\n\n\/\/ Runs in a dedicated thread, periodically calls PrintExperimentStats\n\/\/ on `stats_vec` and `envs`.\n\/\/ Stops when `continue_running` becomes false.\n\/\/ Exits immediately if --experiment flag is not used.\nvoid PrintExperimentStatsThread(const std::atomic<bool> &continue_running,\n                                const std::vector<Stats> &stats_vec,\n                                const std::vector<Environment> &envs) {\n  CHECK(!envs.empty());\n  if (envs.front().experiment.empty()) return;\n  for (int i = 0; continue_running; ++i) {\n    \/\/ Sleep at least a few seconds, and at most 600.\n    int seconds_to_sleep = std::clamp(i, 5, 600);\n    \/\/ Sleep(1) in a loop so that we check continue_running once a second.\n    while (--seconds_to_sleep && continue_running) {\n      sleep(1);\n    }\n    std::ostringstream os;\n    PrintExperimentStats(stats_vec, envs, os);\n    LOG(INFO) << \"Experiment:\\n\" << os.str();\n  }\n}\n\n}  \/\/ namespace\n\nint CentipedeMain(const Environment &env,\n                  CentipedeCallbacksFactory &callbacks_factory) {\n  SetSignalHandlers();\n\n  if (!env.save_corpus_to_local_dir.empty())\n    return Centipede::SaveCorpusToLocalDir(env, env.save_corpus_to_local_dir);\n\n  if (!env.for_each_blob.empty()) return ForEachBlob(env);\n\n  \/\/ Just export the corpus from a local dir and exit.\n  if (!env.export_corpus_from_local_dir.empty())\n    return Centipede::ExportCorpusFromLocalDir(\n        env, env.export_corpus_from_local_dir);\n\n  \/\/ Export the corpus from a local dir and then fuzz.\n  if (!env.corpus_dir.empty()) {\n    for (const auto &corpus_dir : env.corpus_dir) {\n      Centipede::ExportCorpusFromLocalDir(env, corpus_dir);\n    }\n  }\n\n  \/\/ Create the coverage dir once, before creating any threads.\n  LOG(INFO) << \"Coverage dir \" << env.MakeCoverageDirPath();\n  RemoteMkdir(env.MakeCoverageDirPath());\n\n  auto one_time_callbacks = callbacks_factory.create(env);\n  Coverage::PCTable pc_table;\n  SymbolTable symbols;\n  one_time_callbacks->PopulateSymbolAndPcTables(symbols, pc_table);\n  callbacks_factory.destroy(one_time_callbacks);\n  if (env.use_pcpair_features) {\n    CHECK(!pc_table.empty())\n        << \"use_pcpair_features requires non-empty pc_table\";\n  }\n  CoverageLogger coverage_logger(pc_table, symbols);\n\n  auto thread_callback = [&](Environment &my_env, Stats &stats) {\n    CreateLocalDirRemovedAtExit(TemporaryLocalDirPath());  \/\/ creates temp dir.\n    my_env.seed = GetRandomSeed(env.seed);  \/\/ uses TID, call in this thread.\n    auto user_callbacks = callbacks_factory.create(my_env);\n    Centipede centipede(my_env, *user_callbacks, pc_table, symbols,\n                        coverage_logger, stats);\n    centipede.FuzzingLoop();\n    callbacks_factory.destroy(user_callbacks);\n  };\n\n  std::vector<Environment> envs(env.num_threads, env);\n  std::vector<Stats> stats_vec(env.num_threads);\n  std::vector<std::thread> threads(env.num_threads);\n  std::atomic<bool> stats_thread_continue_running(true);\n\n  \/\/ Create threads.\n  for (size_t thread_idx = 0; thread_idx < env.num_threads; thread_idx++) {\n    Environment &my_env = envs[thread_idx];\n    my_env.my_shard_index = env.my_shard_index + thread_idx;\n    my_env.UpdateForExperiment();\n    threads[thread_idx] = std::thread(thread_callback, std::ref(my_env),\n                                      std::ref(stats_vec[thread_idx]));\n  }\n\n  std::thread stats_thread(PrintExperimentStatsThread,\n                           std::ref(stats_thread_continue_running),\n                           std::ref(stats_vec), std::ref(envs));\n\n  \/\/ Join threads.\n  for (size_t thread_idx = 0; thread_idx < env.num_threads; thread_idx++) {\n    threads[thread_idx].join();\n  }\n  stats_thread_continue_running = false;\n  stats_thread.join();\n\n  return ExitCode();\n}\n\n}  \/\/ namespace centipede\n<|endoftext|>"}
{"text":"<commit_before>\/**************************************************************************\n * Copyright(c) 2004, 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\/** @file    AliFMDGainDA.cxx\n    @author  Hans Hjersing Dalsgaard <canute@nbi.dk>\n    @date    Mon Mar 13 13:46:05 2008\n    @brief   Derived class for the pulse gain detector algorithm.\n*\/\n\/\/____________________________________________________________________\n\/\/\n\/\/ This class contains the implementation of the gain detector\n\/\/ algorithms (DA) for the FMD.  The data is collected in histograms\n\/\/ that are reset for each pulse length after the mean and standard\n\/\/ deviation are put into a TGraphErrors object. After a certain\n\/\/ number of pulses (usually 8) the graph is fitted to a straight\n\/\/ line. The gain is then slope of this line as it combines the known\n\/\/ pulse and the response of the detector.\n\/\/\n#include \"AliFMDGainDA.h\"\n#include \"iostream\"\n#include \"fstream\"\n#include \"AliLog.h\"\n#include \"TF1.h\"\n#include \"TH1.h\"\n#include \"TMath.h\"\n#include \"TGraphErrors.h\"\n#include \"AliFMDParameters.h\"\n\n\/\/_____________________________________________________________________\nClassImp(AliFMDGainDA)\n#if 0 \/\/ Do not delete - here to let Emacs indent properly\n;\n#endif\n\n\/\/_____________________________________________________________________\nAliFMDGainDA::AliFMDGainDA() \n  : AliFMDBaseDA(),\n    fGainArray(),\n    \/\/fPulseSize(32),\n    fHighPulse(256), \n    \/\/fPulseLength(100),\n    fEventsPerChannel(16),\n    fCurrentPulse(16),\n    fCurrentChannel(16),\n    fNumberOfStripsPerChip(128)\n{\n  fCurrentPulse.Reset(0);\n  fCurrentChannel.Reset(0);\n  fOutputFile.open(\"gains.csv\");\n  fGainArray.SetOwner(); \n}\n\n\/\/_____________________________________________________________________\nAliFMDGainDA::AliFMDGainDA(const AliFMDGainDA & gainDA) \n  :  AliFMDBaseDA(gainDA),\n     fGainArray(gainDA.fGainArray),\n     \/\/fPulseSize(gainDA.fPulseSize),\n     fHighPulse(gainDA.fHighPulse),\n     \/\/fPulseLength(gainDA.fPulseLength),\n     fEventsPerChannel(gainDA.fEventsPerChannel),\n     fCurrentPulse(gainDA.fCurrentPulse),\n     fCurrentChannel(gainDA.fCurrentChannel),\n     fNumberOfStripsPerChip(gainDA.fNumberOfStripsPerChip)\n{  \n  fCurrentPulse.Reset(0);\n  fCurrentChannel.Reset(0);\n}\n\n\/\/_____________________________________________________________________\nAliFMDGainDA::~AliFMDGainDA() \n{\n}\n\n\/\/_____________________________________________________________________\nvoid AliFMDGainDA::Init() \n{\n  \n \n  Int_t nEventsRequired = 0;\n  for(Int_t i=0;i<fEventsPerChannel.GetSize();i++)\n    {\n      Int_t nEvents = (fPulseLength.At(i)*fHighPulse) \/ fPulseSize.At(i);\n      fEventsPerChannel.AddAt(nEvents,i);\n      if(nEvents>nEventsRequired) nEventsRequired = nEvents * fNumberOfStripsPerChip;\n      \n    }\n  \n  std::cout<<nEventsRequired<<std::endl;\n  \/\/8 pulser values * 128 strips * 100 samples\n  \n  \n  SetRequiredEvents(nEventsRequired); \n  TObjArray* detArray;\n  TObjArray* ringArray;\n  TObjArray* sectorArray;\n  \n  for(UShort_t det=1;det<=3;det++) {\n    detArray = new TObjArray();\n    detArray->SetOwner();\n    fGainArray.AddAtAndExpand(detArray,det);\n    for (UShort_t ir = 0; ir < 2; ir++) {\n      Char_t   ring = (ir == 0 ? 'O' : 'I');\n      UShort_t nsec = (ir == 0 ? 40  : 20);\n      UShort_t nstr = (ir == 0 ? 2 : 4);\n      ringArray = new TObjArray();\n      ringArray->SetOwner();\n      detArray->AddAtAndExpand(ringArray,ir);\n      for(UShort_t sec =0; sec < nsec;  sec++)  {\n\tsectorArray = new TObjArray();\n\tsectorArray->SetOwner();\n\tringArray->AddAtAndExpand(sectorArray,sec);\n\tfor(UShort_t strip = 0; strip < nstr; strip++) {\n\t  TH1S* hChannel = new TH1S(Form(\"hFMD%d%c_%d_%d\",det,ring,sec,strip),\n\t\t\t\t    Form(\"hFMD%d%c_%d_%d\",det,ring,sec,strip),\n\t\t\t\t    1024,0,1023);\n\t  hChannel->SetDirectory(0);\n\t  sectorArray->AddAtAndExpand(hChannel,strip);\n\t}\n      }\n    }\n  }\n}\n\n\/\/_____________________________________________________________________\nvoid AliFMDGainDA::AddChannelContainer(TObjArray* sectorArray, \n\t\t\t\t       UShort_t det  , \n\t\t\t\t       Char_t   ring,  \n\t\t\t\t       UShort_t sec, \n\t\t\t\t       UShort_t strip) \n{  \n  TGraphErrors* hChannel  = new TGraphErrors();\n  hChannel->SetName(Form(\"FMD%d%c[%02d,%03d]\", det, ring, sec, strip));\n  hChannel->SetTitle(Form(\"FMD%d%c[%02d,%03d] ADC vs DAC\", \n\t\t\t  det, ring, sec, strip));\n  sectorArray->AddAtAndExpand(hChannel,strip);\n}\n\n\/\/_____________________________________________________________________\nvoid AliFMDGainDA::FillChannels(AliFMDDigit* digit) {\n\n  UShort_t det   = digit->Detector();\n  Char_t   ring  = digit->Ring();\n  UShort_t sec   = digit->Sector();\n  UShort_t strip = digit->Strip();\n  \n  \n  if(strip % fNumberOfStripsPerChip) return;\n  Int_t vaChip   = strip \/ fNumberOfStripsPerChip; \n  TH1S* hChannel = GetChannelHistogram(det, ring, sec, vaChip);\n  hChannel->Fill(digit->Counts());\n  UpdatePulseAndADC(det,ring,sec,strip);\n}\n\n\/\/_____________________________________________________________________\nvoid AliFMDGainDA::Analyse(UShort_t det, \n\t\t\t   Char_t   ring, \n\t\t\t   UShort_t sec, \n\t\t\t   UShort_t strip) {\n  TGraphErrors* grChannel = GetChannel(det,ring,sec,strip);\n  if(!grChannel->GetN()) {\n    \/\/ AliWarning(Form(\"No entries for FMD%d%c, sector %d, strip %d\",\n    \/\/                 det, ring , sec, strip));\n    return;\n  }\n  TF1 fitFunc(\"fitFunc\",\"pol1\",-10,280); \n  fitFunc.SetParameters(100,3);\n  grChannel->Fit(\"fitFunc\",\"Q0+\",\"\",0,fHighPulse);\n     \n  Float_t chi2ndf = 0;\n  if(fitFunc.GetNDF())\n    chi2ndf = fitFunc.GetChisquare() \/ fitFunc.GetNDF();\n   \n  fOutputFile << det                         << ','\n\t      << ring                        << ','\n\t      << sec                         << ','\n\t      << strip                       << ','\n\t      << fitFunc.GetParameter(1)     << ','\n\t      << fitFunc.GetParError(1)      << ','\n\t      << chi2ndf                     <<\"\\n\";\n  \n  \n  if(fSaveHistograms) {\n    gDirectory->cd(GetSectorPath(det,ring, sec, kTRUE));\n    \n    TH1F* summary = dynamic_cast<TH1F*>(gDirectory->Get(\"Summary\"));\n    if (!summary) { \n      Int_t nStr = (ring == 'I' ? 512 : 256);\n      summary = new TH1F(\"Summary\", Form(\"Summary of gains in FMD%d%c[%02d]\", \n\t\t\t\t\t det, ring, sec), \n\t\t\t nStr, -.5, nStr-.5);\n      summary->SetXTitle(\"Strip\");\n      summary->SetYTitle(\"Gain [ADC\/DAC]\");\n      summary->SetDirectory(gDirectory);\n    }\n    summary->SetBinContent(strip+1, fitFunc.GetParameter(1));\n    summary->SetBinError(strip+1, fitFunc.GetParError(1));\n    \n    gDirectory->cd(GetStripPath(det,ring,sec,strip, kTRUE));\n    grChannel->SetName(Form(\"FMD%d%c[%02d,%03d]\",det,ring,sec,strip));\n    \/\/ grChannel->SetDirectory(gDirectory);\n    grChannel->Write();\n    \/\/ grChannel->Write(Form(\"grFMD%d%c_%d_%d\",det,ring,sec,strip));\n  }  \n}\n\n\/\/_____________________________________________________________________\nvoid AliFMDGainDA::WriteHeaderToFile() \n{\n  AliFMDParameters* pars       = AliFMDParameters::Instance();\n  fOutputFile.write(Form(\"# %s \\n\",pars->GetGainShuttleID()),9);\n  fOutputFile.write(\"# Detector, \"\n\t\t    \"Ring, \"\n\t\t    \"Sector, \"\n\t\t    \"Strip, \"\n\t\t    \"Gain, \"\n\t\t    \"Error, \"\n\t\t    \"Chi2\/NDF \\n\",56);\n  \n}\n\n\/\/_____________________________________________________________________\nTH1S* AliFMDGainDA::GetChannelHistogram(UShort_t det, \n\t\t\t\t\tChar_t   ring, \n\t\t\t\t\tUShort_t sec, \n\t\t\t\t\tUShort_t strip) \n{\n  \n  UShort_t  Ring = 1;\n  if(ring == 'O')\n    Ring = 0;\n  \n  \n  TObjArray* detArray  = static_cast<TObjArray*>(fGainArray.At(det));\n  TObjArray* ringArray = static_cast<TObjArray*>(detArray->At(Ring));\n  TObjArray* secArray  = static_cast<TObjArray*>(ringArray->At(sec));\n  TH1S* hChannel       = static_cast<TH1S*>(secArray->At(strip));\n  \n  return hChannel;\n}\n\n\/\/_____________________________________________________________________\nTGraphErrors* AliFMDGainDA::GetChannel(UShort_t det, \n\t\t\t\t       Char_t   ring, \n\t\t\t\t       UShort_t sec, \n\t\t\t\t       UShort_t strip) \n{  \n  UShort_t      iring     = (ring == 'O' ? 0 : 1);\n  TObjArray*    detArray  = static_cast<TObjArray*>(fDetectorArray.At(det));\n  TObjArray*    ringArray = static_cast<TObjArray*>(detArray->At(iring));\n  TObjArray*    secArray  = static_cast<TObjArray*>(ringArray->At(sec));\n  TGraphErrors* hChannel  = static_cast<TGraphErrors*>(secArray->At(strip));\n  \n  return hChannel;\n}\n\n\/\/_____________________________________________________________________\nvoid AliFMDGainDA::UpdatePulseAndADC(UShort_t det, \n\t\t\t\t     Char_t ring, \n\t\t\t\t     UShort_t sec, \n\t\t\t\t     UShort_t strip) \n{\n  \n  AliFMDParameters* pars = AliFMDParameters::Instance();\n  UInt_t ddl, board,chip,ch;\n  pars->Detector2Hardware(det,ring,sec,strip,ddl,board,chip,ch);\n  Int_t halfring = GetHalfringIndex(det,ring,board%16);\n  if(GetCurrentEvent()> (fNumberOfStripsPerChip*fEventsPerChannel.At(halfring)))\n    return\n  if(strip % fNumberOfStripsPerChip) return;\n  if(((GetCurrentEvent()) % fPulseLength.At(halfring)) && GetCurrentEvent() > 0) return;\n     \n  Int_t vaChip = strip\/fNumberOfStripsPerChip; \n  TH1S* hChannel = GetChannelHistogram(det,ring,sec,vaChip);\n  \n  if(!hChannel->GetEntries()) {\n    AliWarning(Form(\"No entries for FMD%d%c, sector %d, strip %d\",\n\t\t    det, ring , sec, strip));\n    return;\n  }\n  Double_t mean      = hChannel->GetMean();\n  Double_t rms       = hChannel->GetRMS();\n  Double_t pulse     = Double_t(fCurrentPulse.At(halfring)) * fPulseSize.At(halfring);\n  Int_t    firstBin  = hChannel->GetXaxis()->GetFirst();\n  Int_t    lastBin   = hChannel->GetXaxis()->GetLast();\n  hChannel->GetXaxis()->SetRangeUser(mean-4*rms,mean+4*rms);\n  \n  mean               = hChannel->GetMean();\n  rms                = hChannel->GetRMS();\n  \n  hChannel->GetXaxis()->SetRange(firstBin,lastBin);\n  \n  Int_t channelNumber = strip + (GetCurrentEvent()-1)\/((fPulseLength.At(halfring)*fHighPulse)\/fPulseSize.At(halfring)); \n  \n  TGraphErrors* channel = GetChannel(det,ring,sec,channelNumber);\n  \n  channel->SetPoint(fCurrentPulse.At(halfring),pulse,mean);\n  channel->SetPointError(fCurrentPulse.At(halfring),0,rms);\n  \n  if(fSaveHistograms) {\n    gDirectory->cd(GetStripPath(det,ring,sec,channelNumber));\n    hChannel->Write(Form(\"%s_pulse_%03d\",hChannel->GetName(),(Int_t)pulse));\n    \n  }\n  \n  \n  \n  \n  hChannel->Reset();\n  \n}\n\n\/\/_____________________________________________________________________\nvoid AliFMDGainDA::ResetPulseAndUpdateChannel() \n{  \n  \/\/for(Int_t i=0; i<fCurrentPulse.GetSize();i++)\n  fCurrentPulse.Reset(0); \n}\n\n\/\/_____________________________________________________________________\nvoid AliFMDGainDA::FinishEvent() \n{\n  for(Int_t i = 0; i<fPulseLength.GetSize();i++) {\n    if(GetCurrentEvent()>0 && (GetCurrentEvent() % fPulseLength.At(i) == 0))\n      fCurrentPulse.AddAt(fCurrentPulse.At(i)+1,i);\n    \n    if(GetCurrentEvent()>0 && (GetCurrentEvent()) % fEventsPerChannel.At(i) == 0)\n      fCurrentPulse.AddAt(0,i);\n  }\n}\n\/\/_____________________________________________________________________\n\/\/\n\/\/EOF\n\/\/\n<commit_msg>Fixed a bug from previous checkin<commit_after>\/**************************************************************************\n * Copyright(c) 2004, 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\/** @file    AliFMDGainDA.cxx\n    @author  Hans Hjersing Dalsgaard <canute@nbi.dk>\n    @date    Mon Mar 13 13:46:05 2008\n    @brief   Derived class for the pulse gain detector algorithm.\n*\/\n\/\/____________________________________________________________________\n\/\/\n\/\/ This class contains the implementation of the gain detector\n\/\/ algorithms (DA) for the FMD.  The data is collected in histograms\n\/\/ that are reset for each pulse length after the mean and standard\n\/\/ deviation are put into a TGraphErrors object. After a certain\n\/\/ number of pulses (usually 8) the graph is fitted to a straight\n\/\/ line. The gain is then slope of this line as it combines the known\n\/\/ pulse and the response of the detector.\n\/\/\n#include \"AliFMDGainDA.h\"\n#include \"iostream\"\n#include \"fstream\"\n#include \"AliLog.h\"\n#include \"TF1.h\"\n#include \"TH1.h\"\n#include \"TMath.h\"\n#include \"TGraphErrors.h\"\n#include \"AliFMDParameters.h\"\n\n\/\/_____________________________________________________________________\nClassImp(AliFMDGainDA)\n#if 0 \/\/ Do not delete - here to let Emacs indent properly\n;\n#endif\n\n\/\/_____________________________________________________________________\nAliFMDGainDA::AliFMDGainDA() \n  : AliFMDBaseDA(),\n    fGainArray(),\n    \/\/fPulseSize(32),\n    fHighPulse(256), \n    \/\/fPulseLength(100),\n    fEventsPerChannel(16),\n    fCurrentPulse(16),\n    fCurrentChannel(16),\n    fNumberOfStripsPerChip(128)\n{\n  fCurrentPulse.Reset(0);\n  fCurrentChannel.Reset(0);\n  fOutputFile.open(\"gains.csv\");\n  fGainArray.SetOwner(); \n}\n\n\/\/_____________________________________________________________________\nAliFMDGainDA::AliFMDGainDA(const AliFMDGainDA & gainDA) \n  :  AliFMDBaseDA(gainDA),\n     fGainArray(gainDA.fGainArray),\n     \/\/fPulseSize(gainDA.fPulseSize),\n     fHighPulse(gainDA.fHighPulse),\n     \/\/fPulseLength(gainDA.fPulseLength),\n     fEventsPerChannel(gainDA.fEventsPerChannel),\n     fCurrentPulse(gainDA.fCurrentPulse),\n     fCurrentChannel(gainDA.fCurrentChannel),\n     fNumberOfStripsPerChip(gainDA.fNumberOfStripsPerChip)\n{  \n  fCurrentPulse.Reset(0);\n  fCurrentChannel.Reset(0);\n}\n\n\/\/_____________________________________________________________________\nAliFMDGainDA::~AliFMDGainDA() \n{\n}\n\n\/\/_____________________________________________________________________\nvoid AliFMDGainDA::Init() \n{\n  \n \n  Int_t nEventsRequired = 0;\n  for(Int_t i=0;i<fEventsPerChannel.GetSize();i++)\n    {\n      Int_t nEvents = (fPulseLength.At(i)*fHighPulse) \/ fPulseSize.At(i);\n      fEventsPerChannel.AddAt(nEvents,i);\n      if(nEvents>nEventsRequired) nEventsRequired = nEvents * fNumberOfStripsPerChip;\n      \n    }\n  \n  std::cout<<nEventsRequired<<std::endl;\n  \/\/8 pulser values * 128 strips * 100 samples\n  \n  \n  SetRequiredEvents(nEventsRequired); \n  TObjArray* detArray;\n  TObjArray* ringArray;\n  TObjArray* sectorArray;\n  \n  for(UShort_t det=1;det<=3;det++) {\n    detArray = new TObjArray();\n    detArray->SetOwner();\n    fGainArray.AddAtAndExpand(detArray,det);\n    for (UShort_t ir = 0; ir < 2; ir++) {\n      Char_t   ring = (ir == 0 ? 'O' : 'I');\n      UShort_t nsec = (ir == 0 ? 40  : 20);\n      UShort_t nstr = (ir == 0 ? 2 : 4);\n      ringArray = new TObjArray();\n      ringArray->SetOwner();\n      detArray->AddAtAndExpand(ringArray,ir);\n      for(UShort_t sec =0; sec < nsec;  sec++)  {\n\tsectorArray = new TObjArray();\n\tsectorArray->SetOwner();\n\tringArray->AddAtAndExpand(sectorArray,sec);\n\tfor(UShort_t strip = 0; strip < nstr; strip++) {\n\t  TH1S* hChannel = new TH1S(Form(\"hFMD%d%c_%d_%d\",det,ring,sec,strip),\n\t\t\t\t    Form(\"hFMD%d%c_%d_%d\",det,ring,sec,strip),\n\t\t\t\t    1024,0,1023);\n\t  hChannel->SetDirectory(0);\n\t  sectorArray->AddAtAndExpand(hChannel,strip);\n\t}\n      }\n    }\n  }\n}\n\n\/\/_____________________________________________________________________\nvoid AliFMDGainDA::AddChannelContainer(TObjArray* sectorArray, \n\t\t\t\t       UShort_t det  , \n\t\t\t\t       Char_t   ring,  \n\t\t\t\t       UShort_t sec, \n\t\t\t\t       UShort_t strip) \n{  \n  TGraphErrors* hChannel  = new TGraphErrors();\n  hChannel->SetName(Form(\"FMD%d%c[%02d,%03d]\", det, ring, sec, strip));\n  hChannel->SetTitle(Form(\"FMD%d%c[%02d,%03d] ADC vs DAC\", \n\t\t\t  det, ring, sec, strip));\n  sectorArray->AddAtAndExpand(hChannel,strip);\n}\n\n\/\/_____________________________________________________________________\nvoid AliFMDGainDA::FillChannels(AliFMDDigit* digit) {\n\n  UShort_t det   = digit->Detector();\n  Char_t   ring  = digit->Ring();\n  UShort_t sec   = digit->Sector();\n  UShort_t strip = digit->Strip();\n  \n  \n  if(strip % fNumberOfStripsPerChip) return;\n  Int_t vaChip   = strip \/ fNumberOfStripsPerChip; \n  TH1S* hChannel = GetChannelHistogram(det, ring, sec, vaChip);\n  hChannel->Fill(digit->Counts());\n  UpdatePulseAndADC(det,ring,sec,strip);\n}\n\n\/\/_____________________________________________________________________\nvoid AliFMDGainDA::Analyse(UShort_t det, \n\t\t\t   Char_t   ring, \n\t\t\t   UShort_t sec, \n\t\t\t   UShort_t strip) {\n  TGraphErrors* grChannel = GetChannel(det,ring,sec,strip);\n  if(!grChannel->GetN()) {\n    \/\/ AliWarning(Form(\"No entries for FMD%d%c, sector %d, strip %d\",\n    \/\/                 det, ring , sec, strip));\n    return;\n  }\n  TF1 fitFunc(\"fitFunc\",\"pol1\",-10,280); \n  fitFunc.SetParameters(100,3);\n  grChannel->Fit(\"fitFunc\",\"Q0+\",\"\",0,fHighPulse);\n     \n  Float_t chi2ndf = 0;\n  if(fitFunc.GetNDF())\n    chi2ndf = fitFunc.GetChisquare() \/ fitFunc.GetNDF();\n   \n  fOutputFile << det                         << ','\n\t      << ring                        << ','\n\t      << sec                         << ','\n\t      << strip                       << ','\n\t      << fitFunc.GetParameter(1)     << ','\n\t      << fitFunc.GetParError(1)      << ','\n\t      << chi2ndf                     <<\"\\n\";\n  \n  \n  if(fSaveHistograms) {\n    gDirectory->cd(GetSectorPath(det,ring, sec, kTRUE));\n    \n    TH1F* summary = dynamic_cast<TH1F*>(gDirectory->Get(\"Summary\"));\n    if (!summary) { \n      Int_t nStr = (ring == 'I' ? 512 : 256);\n      summary = new TH1F(\"Summary\", Form(\"Summary of gains in FMD%d%c[%02d]\", \n\t\t\t\t\t det, ring, sec), \n\t\t\t nStr, -.5, nStr-.5);\n      summary->SetXTitle(\"Strip\");\n      summary->SetYTitle(\"Gain [ADC\/DAC]\");\n      summary->SetDirectory(gDirectory);\n    }\n    summary->SetBinContent(strip+1, fitFunc.GetParameter(1));\n    summary->SetBinError(strip+1, fitFunc.GetParError(1));\n    \n    gDirectory->cd(GetStripPath(det,ring,sec,strip, kTRUE));\n    grChannel->SetName(Form(\"FMD%d%c[%02d,%03d]\",det,ring,sec,strip));\n    \/\/ grChannel->SetDirectory(gDirectory);\n    grChannel->Write();\n    \/\/ grChannel->Write(Form(\"grFMD%d%c_%d_%d\",det,ring,sec,strip));\n  }  \n}\n\n\/\/_____________________________________________________________________\nvoid AliFMDGainDA::WriteHeaderToFile() \n{\n  AliFMDParameters* pars       = AliFMDParameters::Instance();\n  fOutputFile.write(Form(\"# %s \\n\",pars->GetGainShuttleID()),9);\n  fOutputFile.write(\"# Detector, \"\n\t\t    \"Ring, \"\n\t\t    \"Sector, \"\n\t\t    \"Strip, \"\n\t\t    \"Gain, \"\n\t\t    \"Error, \"\n\t\t    \"Chi2\/NDF \\n\",56);\n  \n}\n\n\/\/_____________________________________________________________________\nTH1S* AliFMDGainDA::GetChannelHistogram(UShort_t det, \n\t\t\t\t\tChar_t   ring, \n\t\t\t\t\tUShort_t sec, \n\t\t\t\t\tUShort_t strip) \n{\n  \n  UShort_t  Ring = 1;\n  if(ring == 'O')\n    Ring = 0;\n  \n  \n  TObjArray* detArray  = static_cast<TObjArray*>(fGainArray.At(det));\n  TObjArray* ringArray = static_cast<TObjArray*>(detArray->At(Ring));\n  TObjArray* secArray  = static_cast<TObjArray*>(ringArray->At(sec));\n  TH1S* hChannel       = static_cast<TH1S*>(secArray->At(strip));\n  \n  return hChannel;\n}\n\n\/\/_____________________________________________________________________\nTGraphErrors* AliFMDGainDA::GetChannel(UShort_t det, \n\t\t\t\t       Char_t   ring, \n\t\t\t\t       UShort_t sec, \n\t\t\t\t       UShort_t strip) \n{  \n  UShort_t      iring     = (ring == 'O' ? 0 : 1);\n  TObjArray*    detArray  = static_cast<TObjArray*>(fDetectorArray.At(det));\n  TObjArray*    ringArray = static_cast<TObjArray*>(detArray->At(iring));\n  TObjArray*    secArray  = static_cast<TObjArray*>(ringArray->At(sec));\n  TGraphErrors* hChannel  = static_cast<TGraphErrors*>(secArray->At(strip));\n  \n  return hChannel;\n}\n\n\/\/_____________________________________________________________________\nvoid AliFMDGainDA::UpdatePulseAndADC(UShort_t det, \n\t\t\t\t     Char_t ring, \n\t\t\t\t     UShort_t sec, \n\t\t\t\t     UShort_t strip) \n{\n  \n  AliFMDParameters* pars = AliFMDParameters::Instance();\n  UInt_t ddl, board,chip,ch;\n  pars->Detector2Hardware(det,ring,sec,strip,ddl,board,chip,ch);\n  Int_t halfring = GetHalfringIndex(det,ring,board%16);\n  if(GetCurrentEvent()> (fNumberOfStripsPerChip*fEventsPerChannel.At(halfring)))\n    return;\n  if(strip % fNumberOfStripsPerChip) return;\n  if(((GetCurrentEvent()) % fPulseLength.At(halfring)) && GetCurrentEvent() > 0) return;\n     \n  Int_t vaChip = strip\/fNumberOfStripsPerChip; \n  TH1S* hChannel = GetChannelHistogram(det,ring,sec,vaChip);\n  \n  if(!hChannel->GetEntries()) {\n    AliWarning(Form(\"No entries for FMD%d%c, sector %d, strip %d\",\n\t\t    det, ring , sec, strip));\n    return;\n  }\n  Double_t mean      = hChannel->GetMean();\n  Double_t rms       = hChannel->GetRMS();\n  Double_t pulse     = Double_t(fCurrentPulse.At(halfring)) * fPulseSize.At(halfring);\n  Int_t    firstBin  = hChannel->GetXaxis()->GetFirst();\n  Int_t    lastBin   = hChannel->GetXaxis()->GetLast();\n  hChannel->GetXaxis()->SetRangeUser(mean-4*rms,mean+4*rms);\n  \n  mean               = hChannel->GetMean();\n  rms                = hChannel->GetRMS();\n  \n  hChannel->GetXaxis()->SetRange(firstBin,lastBin);\n  \n  Int_t channelNumber = strip + (GetCurrentEvent()-1)\/((fPulseLength.At(halfring)*fHighPulse)\/fPulseSize.At(halfring)); \n  \n  TGraphErrors* channel = GetChannel(det,ring,sec,channelNumber);\n  \n  channel->SetPoint(fCurrentPulse.At(halfring),pulse,mean);\n  channel->SetPointError(fCurrentPulse.At(halfring),0,rms);\n  \n  if(fSaveHistograms) {\n    gDirectory->cd(GetStripPath(det,ring,sec,channelNumber));\n    hChannel->Write(Form(\"%s_pulse_%03d\",hChannel->GetName(),(Int_t)pulse));\n    \n  }\n  \n  \n  \n  \n  hChannel->Reset();\n  \n}\n\n\/\/_____________________________________________________________________\nvoid AliFMDGainDA::ResetPulseAndUpdateChannel() \n{  \n  \/\/for(Int_t i=0; i<fCurrentPulse.GetSize();i++)\n  fCurrentPulse.Reset(0); \n}\n\n\/\/_____________________________________________________________________\nvoid AliFMDGainDA::FinishEvent() \n{\n  for(Int_t i = 0; i<fPulseLength.GetSize();i++) {\n    if(GetCurrentEvent()>0 && (GetCurrentEvent() % fPulseLength.At(i) == 0))\n      fCurrentPulse.AddAt(fCurrentPulse.At(i)+1,i);\n    \n    if(GetCurrentEvent()>0 && (GetCurrentEvent()) % fEventsPerChannel.At(i) == 0)\n      fCurrentPulse.AddAt(0,i);\n  }\n}\n\/\/_____________________________________________________________________\n\/\/\n\/\/EOF\n\/\/\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Prefer member initializers to (cascaded) assignments<commit_after><|endoftext|>"}
{"text":"<commit_before>#include <exception>\n#include <string>\n\n#include \"phonenumbers\/phonenumberutil.h\"\n\nextern \"C\" {\n\t#include \"postgres.h\"\n\t#include \"libpq\/pqformat.h\"\n\t#include \"fmgr.h\"\n}\n\nusing namespace i18n::phonenumbers;\n\nPhoneNumberUtil *phoneUtil = PhoneNumberUtil::GetInstance();\n\n\/\/Raised when a phone number can't be parsed\nclass ParseException : std::exception {\n\tpublic:\n\tParseException(PhoneNumberUtil::ErrorType et) : error_type(et) {}\n\n\tconst char* what() const throw() override {\n\t\tusing PNU = i18n::phonenumbers::PhoneNumberUtil;\n\t\tswitch(error_type) {\n\t\tcase PNU::NO_PARSING_ERROR:\n\t\t\t\/\/This case shouldn't occur in correctly-functioning code.\n\t\t\tassert(0);\n\t\t\treturn \"Parsed successfully\";\n\t\tcase PNU::NOT_A_NUMBER:\n\t\t\treturn \"String does not appear to contain a phone number.\";\n\t\tcase PNU::INVALID_COUNTRY_CODE_ERROR:\n\t\t\treturn \"Invalid country code\";\n\t\t\/\/TODO: handle more error cases specifically.\n\t\tdefault:\n\t\t\t\/\/We have some generic parsing error.\n\t\t\treturn \"Unrecognized number format\";\n\t\t}\n\t};\n\n\tprivate:\n\tPhoneNumberUtil::ErrorType error_type;\n};\n\n\/\/Utility functions for error handling\n\nvoid reportOutOfMemory() {\n\tereport(ERROR,\n\t\t(errcode(ERRCODE_OUT_OF_MEMORY)));\n}\n\nvoid reportParseError(const char* phone_number, ParseException& exception) {\n\tereport(ERROR,\n\t\t\t(errcode(ERRCODE_INVALID_TEXT_REPRESENTATION),\n\t\t\t errmsg(\"unable to parse '%s' as a phone number\", phone_number),\n\t\t\t errdetail(\"%s\", exception.what())));\n}\n\nvoid reportGenericError(std::exception& exception) {\n\tereport(ERROR,\n\t\t\t(errcode(ERRCODE_EXTERNAL_ROUTINE_INVOCATION_EXCEPTION),\n\t\t\t errmsg(\"C++ exception: %s\", typeid(exception).name()),\n\t\t\t errdetail(\"%s\", exception.what())));\n}\n\nvoid logInfo(const char* msg) {\n\tereport(INFO,\n\t\t\t(errcode(ERRCODE_SUCCESSFUL_COMPLETION),\n\t\t\terrmsg(\"%s\", msg)));\n}\n\n\/*\n * Utility functions\n *\/\n\n\/\/Internal function used by phone_number_in and parse_phone_number\nPhoneNumber* parsePhoneNumber(const char* number_str, const char* country) throw () {\n\tPhoneNumber *number;\n\n\tnumber = (PhoneNumber*)palloc0(sizeof(PhoneNumber));\n\t\/\/TODO: can this be removed? (palloc normally handles this, right?)\n\tif(number == nullptr) {\n\t\tthrow std::bad_alloc();\n\t}\n\tnew(number) PhoneNumber();\n\n\tPhoneNumberUtil::ErrorType error;\n\terror = phoneUtil->Parse(number_str, country, number);\n\tif(error != PhoneNumberUtil::NO_PARSING_ERROR) {\n\t\tthrow ParseException(error);\n\t}\n\t\/\/TODO: check number validity.\n\treturn number;\n}\n\n\/\/TODO: handle non-exception thrown types? (shouldn't happen, but you never know...)\n\/\/TODO: check null args? (PG_ARGISNULL). Make non-strict?\n\n\/*\n * Extension functions\n *\/\n\nextern \"C\" {\n\t#ifdef PG_MODULE_MAGIC\n\t\tPG_MODULE_MAGIC;\n\t#endif\n\n\tPGDLLEXPORT PG_FUNCTION_INFO_V1(phone_number_in);\n\n\tPGDLLEXPORT\n\tDatum\n\tphone_number_in(PG_FUNCTION_ARGS)\n\t{\n\t\tconst char *number_str = PG_GETARG_CSTRING(0);\n\n\t\ttry {\n\t\t\tPG_RETURN_POINTER(parsePhoneNumber(number_str, \"US\"));\n\t\t} catch(std::bad_alloc& e) {\n\t\t\treportOutOfMemory();\n\t\t} catch(ParseException e) {\n\t\t\treportParseError(number_str, e);\n\t\t} catch (std::exception& e) {\n\t\t\treportGenericError(e);\n\t\t}\n\n\t\tPG_RETURN_NULL();\n\t}\n\t\n\tPGDLLEXPORT PG_FUNCTION_INFO_V1(parse_phone_number);\n\n\tPGDLLEXPORT\n\tDatum\n\tparse_phone_number(PG_FUNCTION_ARGS)\n\t{\n\t\tconst char *number_str = PG_GETARG_CSTRING(0);\n\t\tconst char *country = PG_GETARG_CSTRING(1);\n\n\t\ttry {\n\t\t\tPG_RETURN_POINTER(parsePhoneNumber(number_str, country));\n\t\t} catch(std::bad_alloc& e) {\n\t\t\treportOutOfMemory();\n\t\t} catch(ParseException e) {\n\t\t\treportParseError(number_str, e);\n\t\t} catch (std::exception& e) {\n\t\t\treportGenericError(e);\n\t\t}\n\n\t\tPG_RETURN_NULL();\n\t}\n\n\tPGDLLEXPORT PG_FUNCTION_INFO_V1(phone_number_out);\n\n\tPGDLLEXPORT\n\tDatum\n\tphone_number_out(PG_FUNCTION_ARGS)\n\t{\n\t\ttry {\n\t\t\tconst PhoneNumber *number = (PhoneNumber*)PG_GETARG_POINTER(0);\n\t\t\tstd::string formatted;\n\t\t\tchar *result;\n\n\t\t\tphoneUtil->Format(*number, PhoneNumberUtil::INTERNATIONAL, &formatted);\n\n\t\t\t\/\/Copy the formatted number to a C-style string.\n\t\t\t\/\/We must use the PostgreSQL allocator, not new\/malloc.\n\t\t\tsize_t len = formatted.length();\n\t\t\tresult = (char*)palloc(len + 1);\n\t\t\tif(result == nullptr) {\n\t\t\t\treportOutOfMemory();\n\t\t\t\tPG_RETURN_NULL();\n\t\t\t}\n\t\t\tmemcpy(result, formatted.data(), len);\n\t\t\tresult[len] = '\\0';\n\n\t\t\tPG_RETURN_CSTRING(result);\n\t\t} catch(std::bad_alloc& e) {\n\t\t\treportOutOfMemory();\n\t\t} catch (std::exception& e) {\n\t\t\treportGenericError(e);\n\t\t}\n\n\t\tPG_RETURN_NULL();\n\t}\n\n\tPGDLLEXPORT PG_FUNCTION_INFO_V1(phone_number_recv);\n\n\t\/\/TODO: handle leading zeroes?\n\tPGDLLEXPORT\n\tDatum\n\tphone_number_recv(PG_FUNCTION_ARGS)\n\t{\n\t\tStringInfo buf = (StringInfo)PG_GETARG_POINTER(0);\n\t\tPhoneNumber *result;\n\n\t\t\/\/TODO: error handling?\n\t\tresult = (PhoneNumber*)palloc0(sizeof(PhoneNumber));\n\t\tresult->set_country_code(pq_getmsgint(buf, 4));\n\t\tresult->set_national_number(pq_getmsgint64(buf));\n\t\tPG_RETURN_POINTER(result);\n\t}\n\n\tPGDLLEXPORT PG_FUNCTION_INFO_V1(phone_number_send);\n\n\tPGDLLEXPORT\n\tDatum\n\tphone_number_send(PG_FUNCTION_ARGS)\n\t{\n\t\tPhoneNumber *number = (PhoneNumber*)PG_GETARG_POINTER(0);\n\t\tStringInfoData buf;\n\n\t\tpq_begintypsend(&buf);\n\t\tpq_sendint(&buf, number->country_code(), 4);\n\t\tpq_sendint64(&buf, number->national_number());\n\t\tPG_RETURN_BYTEA_P(pq_endtypsend(&buf));\n\t}\n}\n<commit_msg>Fixed bad exception specification<commit_after>#include <exception>\n#include <string>\n\n#include \"phonenumbers\/phonenumberutil.h\"\n\nextern \"C\" {\n\t#include \"postgres.h\"\n\t#include \"libpq\/pqformat.h\"\n\t#include \"fmgr.h\"\n}\n\nusing namespace i18n::phonenumbers;\n\nPhoneNumberUtil *phoneUtil = PhoneNumberUtil::GetInstance();\n\n\/\/Raised when a phone number can't be parsed\nclass ParseException : std::exception {\n\tpublic:\n\tParseException(PhoneNumberUtil::ErrorType et) : error_type(et) {}\n\n\tconst char* what() const throw() override {\n\t\tusing PNU = i18n::phonenumbers::PhoneNumberUtil;\n\t\tswitch(error_type) {\n\t\tcase PNU::NO_PARSING_ERROR:\n\t\t\t\/\/This case shouldn't occur in correctly-functioning code.\n\t\t\tassert(0);\n\t\t\treturn \"Parsed successfully\";\n\t\tcase PNU::NOT_A_NUMBER:\n\t\t\treturn \"String does not appear to contain a phone number.\";\n\t\tcase PNU::INVALID_COUNTRY_CODE_ERROR:\n\t\t\treturn \"Invalid country code\";\n\t\t\/\/TODO: handle more error cases specifically.\n\t\tdefault:\n\t\t\t\/\/We have some generic parsing error.\n\t\t\treturn \"Unrecognized number format\";\n\t\t}\n\t};\n\n\tprivate:\n\tPhoneNumberUtil::ErrorType error_type;\n};\n\n\/\/Utility functions for error handling\n\nvoid reportOutOfMemory() {\n\tereport(ERROR,\n\t\t(errcode(ERRCODE_OUT_OF_MEMORY)));\n}\n\nvoid reportParseError(const char* phone_number, ParseException& exception) {\n\tereport(ERROR,\n\t\t\t(errcode(ERRCODE_INVALID_TEXT_REPRESENTATION),\n\t\t\t errmsg(\"unable to parse '%s' as a phone number\", phone_number),\n\t\t\t errdetail(\"%s\", exception.what())));\n}\n\nvoid reportGenericError(std::exception& exception) {\n\tereport(ERROR,\n\t\t\t(errcode(ERRCODE_EXTERNAL_ROUTINE_INVOCATION_EXCEPTION),\n\t\t\t errmsg(\"C++ exception: %s\", typeid(exception).name()),\n\t\t\t errdetail(\"%s\", exception.what())));\n}\n\nvoid logInfo(const char* msg) {\n\tereport(INFO,\n\t\t\t(errcode(ERRCODE_SUCCESSFUL_COMPLETION),\n\t\t\terrmsg(\"%s\", msg)));\n}\n\n\/*\n * Utility functions\n *\/\n\n\/\/Internal function used by phone_number_in and parse_phone_number\nPhoneNumber* parsePhoneNumber(const char* number_str, const char* country) {\n\tPhoneNumber *number;\n\n\tnumber = (PhoneNumber*)palloc0(sizeof(PhoneNumber));\n\t\/\/TODO: can this be removed? (palloc normally handles this, right?)\n\tif(number == nullptr) {\n\t\tthrow std::bad_alloc();\n\t}\n\tnew(number) PhoneNumber();\n\n\tPhoneNumberUtil::ErrorType error;\n\terror = phoneUtil->Parse(number_str, country, number);\n\tif(error != PhoneNumberUtil::NO_PARSING_ERROR) {\n\t\tthrow ParseException(error);\n\t}\n\t\/\/TODO: check number validity.\n\treturn number;\n}\n\n\/\/TODO: handle non-exception thrown types? (shouldn't happen, but you never know...)\n\/\/TODO: check null args? (PG_ARGISNULL). Make non-strict?\n\n\/*\n * Extension functions\n *\/\n\nextern \"C\" {\n\t#ifdef PG_MODULE_MAGIC\n\t\tPG_MODULE_MAGIC;\n\t#endif\n\n\tPGDLLEXPORT PG_FUNCTION_INFO_V1(phone_number_in);\n\n\tPGDLLEXPORT\n\tDatum\n\tphone_number_in(PG_FUNCTION_ARGS)\n\t{\n\t\tconst char *number_str = PG_GETARG_CSTRING(0);\n\n\t\ttry {\n\t\t\tPG_RETURN_POINTER(parsePhoneNumber(number_str, \"US\"));\n\t\t} catch(std::bad_alloc& e) {\n\t\t\treportOutOfMemory();\n\t\t} catch(ParseException e) {\n\t\t\treportParseError(number_str, e);\n\t\t} catch (std::exception& e) {\n\t\t\treportGenericError(e);\n\t\t}\n\n\t\tPG_RETURN_NULL();\n\t}\n\t\n\tPGDLLEXPORT PG_FUNCTION_INFO_V1(parse_phone_number);\n\n\tPGDLLEXPORT\n\tDatum\n\tparse_phone_number(PG_FUNCTION_ARGS)\n\t{\n\t\tconst char *number_str = PG_GETARG_CSTRING(0);\n\t\tconst char *country = PG_GETARG_CSTRING(1);\n\n\t\ttry {\n\t\t\tPG_RETURN_POINTER(parsePhoneNumber(number_str, country));\n\t\t} catch(std::bad_alloc& e) {\n\t\t\treportOutOfMemory();\n\t\t} catch(ParseException e) {\n\t\t\treportParseError(number_str, e);\n\t\t} catch (std::exception& e) {\n\t\t\treportGenericError(e);\n\t\t}\n\n\t\tPG_RETURN_NULL();\n\t}\n\n\tPGDLLEXPORT PG_FUNCTION_INFO_V1(phone_number_out);\n\n\tPGDLLEXPORT\n\tDatum\n\tphone_number_out(PG_FUNCTION_ARGS)\n\t{\n\t\ttry {\n\t\t\tconst PhoneNumber *number = (PhoneNumber*)PG_GETARG_POINTER(0);\n\t\t\tstd::string formatted;\n\t\t\tchar *result;\n\n\t\t\tphoneUtil->Format(*number, PhoneNumberUtil::INTERNATIONAL, &formatted);\n\n\t\t\t\/\/Copy the formatted number to a C-style string.\n\t\t\t\/\/We must use the PostgreSQL allocator, not new\/malloc.\n\t\t\tsize_t len = formatted.length();\n\t\t\tresult = (char*)palloc(len + 1);\n\t\t\tif(result == nullptr) {\n\t\t\t\treportOutOfMemory();\n\t\t\t\tPG_RETURN_NULL();\n\t\t\t}\n\t\t\tmemcpy(result, formatted.data(), len);\n\t\t\tresult[len] = '\\0';\n\n\t\t\tPG_RETURN_CSTRING(result);\n\t\t} catch(std::bad_alloc& e) {\n\t\t\treportOutOfMemory();\n\t\t} catch (std::exception& e) {\n\t\t\treportGenericError(e);\n\t\t}\n\n\t\tPG_RETURN_NULL();\n\t}\n\n\tPGDLLEXPORT PG_FUNCTION_INFO_V1(phone_number_recv);\n\n\t\/\/TODO: handle leading zeroes?\n\tPGDLLEXPORT\n\tDatum\n\tphone_number_recv(PG_FUNCTION_ARGS)\n\t{\n\t\tStringInfo buf = (StringInfo)PG_GETARG_POINTER(0);\n\t\tPhoneNumber *result;\n\n\t\t\/\/TODO: error handling?\n\t\tresult = (PhoneNumber*)palloc0(sizeof(PhoneNumber));\n\t\tresult->set_country_code(pq_getmsgint(buf, 4));\n\t\tresult->set_national_number(pq_getmsgint64(buf));\n\t\tPG_RETURN_POINTER(result);\n\t}\n\n\tPGDLLEXPORT PG_FUNCTION_INFO_V1(phone_number_send);\n\n\tPGDLLEXPORT\n\tDatum\n\tphone_number_send(PG_FUNCTION_ARGS)\n\t{\n\t\tPhoneNumber *number = (PhoneNumber*)PG_GETARG_POINTER(0);\n\t\tStringInfoData buf;\n\n\t\tpq_begintypsend(&buf);\n\t\tpq_sendint(&buf, number->country_code(), 4);\n\t\tpq_sendint64(&buf, number->national_number());\n\t\tPG_RETURN_BYTEA_P(pq_endtypsend(&buf));\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ This file is distributed under the BSD License.\n\/\/ See \"license.txt\" for details.\n\/\/ Copyright 2009-2011, Jonathan Turner (jonathan@emptycrate.com)\n\/\/ and Jason Turner (jason@emptycrate.com)\n\/\/ http:\/\/www.chaiscript.com\n\n#ifndef CHAISCRIPT_TYPE_INFO_HPP_\n#define CHAISCRIPT_TYPE_INFO_HPP_\n\n#include <string>\n#include <typeinfo>\n#include <boost\/shared_ptr.hpp>\n#include <boost\/type_traits\/is_const.hpp>\n#include <boost\/type_traits\/is_void.hpp>\n#include <boost\/type_traits\/is_reference.hpp>\n#include <boost\/type_traits\/is_pointer.hpp>\n#include <boost\/type_traits\/remove_const.hpp>\n#include <boost\/type_traits\/remove_reference.hpp>\n#include <boost\/type_traits\/remove_pointer.hpp>\n#include <boost\/ref.hpp>\n\nnamespace chaiscript\n{\n\n  template<typename T>\n    struct Bare_Type\n    {\n      typedef typename boost::remove_const<typename boost::remove_pointer<typename boost::remove_reference<T>::type>::type>::type type;\n    };\n\n\n  \/**\n   * compile time deduced information about a type\n   *\/\n  class Type_Info\n  {\n    public:\n      Type_Info(bool t_is_const, bool t_is_reference, bool t_is_pointer, bool t_is_void, \n          const std::type_info *t_ti, const std::type_info *t_bareti)\n        : m_is_const(t_is_const), m_is_reference(t_is_reference), m_is_pointer(t_is_pointer),\n        m_is_void(t_is_void),\n        m_type_info(t_ti), m_bare_type_info(t_bareti),\n        m_is_undef(false)\n      {\n      }\n\n      Type_Info()\n        : m_is_const(false), m_is_reference(false), m_is_pointer(false),\n        m_is_void(false), m_type_info(0), m_bare_type_info(0),\n        m_is_undef(true)\n      {\n      }\n\n      Type_Info(const Type_Info &ti)\n        : m_is_const(ti.m_is_const), m_is_reference(ti.m_is_reference), \n        m_is_pointer(ti.m_is_pointer),\n        m_is_void(ti.m_is_void), m_type_info(ti.m_type_info), \n        m_bare_type_info(ti.m_bare_type_info),\n        m_is_undef(ti.m_is_undef)\n      {\n      }\n\n      Type_Info &operator=(const Type_Info &ti)\n      {\n        m_is_const = ti.m_is_const;\n        m_is_reference = ti.m_is_reference;\n        m_is_pointer = ti.m_is_pointer;\n        m_is_void = ti.m_is_void;\n        m_type_info = ti.m_type_info;\n        m_bare_type_info = ti.m_bare_type_info;\n        m_is_undef = ti.m_is_undef;\n        return *this;\n      }\n\n      bool operator<(const Type_Info &ti) const\n      {\n        return m_type_info < ti.m_type_info;\n      }\n\n      bool operator==(const Type_Info &ti) const\n      {\n        return ti.m_type_info == m_type_info \n          || (ti.m_type_info && m_type_info && *ti.m_type_info == *m_type_info);\n      }\n\n      bool operator==(const std::type_info &ti) const\n      {\n        return m_type_info != 0 && (*m_type_info) == ti;\n      }\n\n      bool bare_equal(const Type_Info &ti) const\n      {\n        return ti.m_bare_type_info == m_bare_type_info \n          || (ti.m_bare_type_info && m_bare_type_info && *ti.m_bare_type_info == *m_bare_type_info);\n      }\n\n      bool is_const() const { return m_is_const; }\n      bool is_reference() const { return m_is_reference; }\n      bool is_void() const { return m_is_void; }\n      bool is_undef() const { return m_is_undef || m_bare_type_info == 0; }\n      bool is_pointer() const { return m_is_pointer; }\n\n      std::string name() const\n      {\n        if (m_type_info)\n        {\n          return m_type_info->name();\n        } else {\n          return \"\";\n        }\n      }\n\n      std::string bare_name() const\n      {\n        if (m_bare_type_info)\n        {\n          return m_bare_type_info->name();\n        } else {\n          return \"\";\n        }\n      }\n\n    private:\n      bool m_is_const;\n      bool m_is_reference;\n      bool m_is_pointer;\n      bool m_is_void;\n      const std::type_info *m_type_info;\n      const std::type_info *m_bare_type_info;\n      bool m_is_undef;\n  };\n\n  namespace detail\n  {\n    \/**\n     * Helper used to create a Type_Info object\n     *\/\n    template<typename T>\n      struct Get_Type_Info\n      {\n        typedef T type;\n\n        static Type_Info get()\n        {\n          return Type_Info(boost::is_const<typename boost::remove_pointer<typename boost::remove_reference<T>::type>::type>::value, boost::is_reference<T>::value, boost::is_pointer<T>::value, \n              boost::is_void<T>::value,\n              &typeid(T), \n              &typeid(typename Bare_Type<T>::type));\n        }\n      };\n\n    template<typename T>\n      struct Get_Type_Info<boost::shared_ptr<T> >\n      {\n        typedef T type;\n\n        static Type_Info get()\n        {\n          return Type_Info(boost::is_const<T>::value, boost::is_reference<T>::value, boost::is_pointer<T>::value, \n              boost::is_void<T>::value,\n              &typeid(boost::shared_ptr<T> ), \n              &typeid(typename Bare_Type<T>::type));\n        }\n      };\n\n    template<typename T>\n      struct Get_Type_Info<const boost::shared_ptr<T> &>\n      {\n        typedef T type;\n\n        static Type_Info get()\n        {\n          return Type_Info(boost::is_const<T>::value, boost::is_reference<T>::value, boost::is_pointer<T>::value, \n              boost::is_void<T>::value,\n              &typeid(const boost::shared_ptr<T> &), \n              &typeid(typename Bare_Type<T>::type));\n        }\n      };\n\n    template<typename T>\n      struct Get_Type_Info<boost::reference_wrapper<T> >\n      {\n        typedef T type;\n\n        static Type_Info get()\n        {\n          return Type_Info(boost::is_const<T>::value, boost::is_reference<T>::value, boost::is_pointer<T>::value, \n              boost::is_void<T>::value,\n              &typeid(boost::reference_wrapper<T> ), \n              &typeid(typename Bare_Type<T>::type));\n        }\n      };\n\n    template<typename T>\n      struct Get_Type_Info<const boost::reference_wrapper<T> &>\n      {\n        typedef T type;\n\n        static Type_Info get()\n        {\n          return Type_Info(boost::is_const<T>::value, boost::is_reference<T>::value, boost::is_pointer<T>::value, \n              boost::is_void<T>::value,\n              &typeid(const boost::reference_wrapper<T> &), \n              &typeid(typename Bare_Type<T>::type));\n        }\n      };\n\n    template<typename T>\n      struct Stripped_Type\n      {\n        typedef typename Bare_Type<typename detail::Get_Type_Info<T>::type>::type type;\n      };\n  }\n\n  template<typename T>\n  Type_Info user_type(T)\n  {\n    return detail::Get_Type_Info<T>::get();\n  }\n\n\n  template<typename T>\n  Type_Info user_type()\n  {\n    return detail::Get_Type_Info<T>::get();\n  }\n\n}\n\n#endif\n\n<commit_msg>Hide Bare_Type in detail namespace<commit_after>\/\/ This file is distributed under the BSD License.\n\/\/ See \"license.txt\" for details.\n\/\/ Copyright 2009-2011, Jonathan Turner (jonathan@emptycrate.com)\n\/\/ and Jason Turner (jason@emptycrate.com)\n\/\/ http:\/\/www.chaiscript.com\n\n#ifndef CHAISCRIPT_TYPE_INFO_HPP_\n#define CHAISCRIPT_TYPE_INFO_HPP_\n\n#include <string>\n#include <typeinfo>\n#include <boost\/shared_ptr.hpp>\n#include <boost\/type_traits\/is_const.hpp>\n#include <boost\/type_traits\/is_void.hpp>\n#include <boost\/type_traits\/is_reference.hpp>\n#include <boost\/type_traits\/is_pointer.hpp>\n#include <boost\/type_traits\/remove_const.hpp>\n#include <boost\/type_traits\/remove_reference.hpp>\n#include <boost\/type_traits\/remove_pointer.hpp>\n#include <boost\/ref.hpp>\n\nnamespace chaiscript\n{\n\n  namespace detail\n  {\n    template<typename T>\n      struct Bare_Type\n      {\n        typedef typename boost::remove_const<typename boost::remove_pointer<typename boost::remove_reference<T>::type>::type>::type type;\n      };\n  }\n\n  \/**\n   * compile time deduced information about a type\n   *\/\n  class Type_Info\n  {\n    public:\n      Type_Info(bool t_is_const, bool t_is_reference, bool t_is_pointer, bool t_is_void, \n          const std::type_info *t_ti, const std::type_info *t_bareti)\n        : m_is_const(t_is_const), m_is_reference(t_is_reference), m_is_pointer(t_is_pointer),\n        m_is_void(t_is_void),\n        m_type_info(t_ti), m_bare_type_info(t_bareti),\n        m_is_undef(false)\n      {\n      }\n\n      Type_Info()\n        : m_is_const(false), m_is_reference(false), m_is_pointer(false),\n        m_is_void(false), m_type_info(0), m_bare_type_info(0),\n        m_is_undef(true)\n      {\n      }\n\n      Type_Info(const Type_Info &ti)\n        : m_is_const(ti.m_is_const), m_is_reference(ti.m_is_reference), \n        m_is_pointer(ti.m_is_pointer),\n        m_is_void(ti.m_is_void), m_type_info(ti.m_type_info), \n        m_bare_type_info(ti.m_bare_type_info),\n        m_is_undef(ti.m_is_undef)\n      {\n      }\n\n      Type_Info &operator=(const Type_Info &ti)\n      {\n        m_is_const = ti.m_is_const;\n        m_is_reference = ti.m_is_reference;\n        m_is_pointer = ti.m_is_pointer;\n        m_is_void = ti.m_is_void;\n        m_type_info = ti.m_type_info;\n        m_bare_type_info = ti.m_bare_type_info;\n        m_is_undef = ti.m_is_undef;\n        return *this;\n      }\n\n      bool operator<(const Type_Info &ti) const\n      {\n        return m_type_info < ti.m_type_info;\n      }\n\n      bool operator==(const Type_Info &ti) const\n      {\n        return ti.m_type_info == m_type_info \n          || (ti.m_type_info && m_type_info && *ti.m_type_info == *m_type_info);\n      }\n\n      bool operator==(const std::type_info &ti) const\n      {\n        return m_type_info != 0 && (*m_type_info) == ti;\n      }\n\n      bool bare_equal(const Type_Info &ti) const\n      {\n        return ti.m_bare_type_info == m_bare_type_info \n          || (ti.m_bare_type_info && m_bare_type_info && *ti.m_bare_type_info == *m_bare_type_info);\n      }\n\n      bool is_const() const { return m_is_const; }\n      bool is_reference() const { return m_is_reference; }\n      bool is_void() const { return m_is_void; }\n      bool is_undef() const { return m_is_undef || m_bare_type_info == 0; }\n      bool is_pointer() const { return m_is_pointer; }\n\n      std::string name() const\n      {\n        if (m_type_info)\n        {\n          return m_type_info->name();\n        } else {\n          return \"\";\n        }\n      }\n\n      std::string bare_name() const\n      {\n        if (m_bare_type_info)\n        {\n          return m_bare_type_info->name();\n        } else {\n          return \"\";\n        }\n      }\n\n    private:\n      bool m_is_const;\n      bool m_is_reference;\n      bool m_is_pointer;\n      bool m_is_void;\n      const std::type_info *m_type_info;\n      const std::type_info *m_bare_type_info;\n      bool m_is_undef;\n  };\n\n  namespace detail\n  {\n    \/**\n     * Helper used to create a Type_Info object\n     *\/\n    template<typename T>\n      struct Get_Type_Info\n      {\n        typedef T type;\n\n        static Type_Info get()\n        {\n          return Type_Info(boost::is_const<typename boost::remove_pointer<typename boost::remove_reference<T>::type>::type>::value, boost::is_reference<T>::value, boost::is_pointer<T>::value, \n              boost::is_void<T>::value,\n              &typeid(T), \n              &typeid(typename Bare_Type<T>::type));\n        }\n      };\n\n    template<typename T>\n      struct Get_Type_Info<boost::shared_ptr<T> >\n      {\n        typedef T type;\n\n        static Type_Info get()\n        {\n          return Type_Info(boost::is_const<T>::value, boost::is_reference<T>::value, boost::is_pointer<T>::value, \n              boost::is_void<T>::value,\n              &typeid(boost::shared_ptr<T> ), \n              &typeid(typename Bare_Type<T>::type));\n        }\n      };\n\n    template<typename T>\n      struct Get_Type_Info<const boost::shared_ptr<T> &>\n      {\n        typedef T type;\n\n        static Type_Info get()\n        {\n          return Type_Info(boost::is_const<T>::value, boost::is_reference<T>::value, boost::is_pointer<T>::value, \n              boost::is_void<T>::value,\n              &typeid(const boost::shared_ptr<T> &), \n              &typeid(typename Bare_Type<T>::type));\n        }\n      };\n\n    template<typename T>\n      struct Get_Type_Info<boost::reference_wrapper<T> >\n      {\n        typedef T type;\n\n        static Type_Info get()\n        {\n          return Type_Info(boost::is_const<T>::value, boost::is_reference<T>::value, boost::is_pointer<T>::value, \n              boost::is_void<T>::value,\n              &typeid(boost::reference_wrapper<T> ), \n              &typeid(typename Bare_Type<T>::type));\n        }\n      };\n\n    template<typename T>\n      struct Get_Type_Info<const boost::reference_wrapper<T> &>\n      {\n        typedef T type;\n\n        static Type_Info get()\n        {\n          return Type_Info(boost::is_const<T>::value, boost::is_reference<T>::value, boost::is_pointer<T>::value, \n              boost::is_void<T>::value,\n              &typeid(const boost::reference_wrapper<T> &), \n              &typeid(typename Bare_Type<T>::type));\n        }\n      };\n\n    template<typename T>\n      struct Stripped_Type\n      {\n        typedef typename Bare_Type<typename detail::Get_Type_Info<T>::type>::type type;\n      };\n  }\n\n  template<typename T>\n  Type_Info user_type(T)\n  {\n    return detail::Get_Type_Info<T>::get();\n  }\n\n\n  template<typename T>\n  Type_Info user_type()\n  {\n    return detail::Get_Type_Info<T>::get();\n  }\n\n}\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/   Copyright 2015 Patrick Putnam\n\/\/\n\/\/   Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/   you may not use this file except in compliance with the License.\n\/\/   You may obtain a copy of the License at\n\/\/\n\/\/       http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/   Unless required by applicable law or agreed to in writing, software\n\/\/   distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/   See the License for the specific language governing permissions and\n\/\/   limitations under the License.\n#ifndef CLOTHO_ADJACENCY_MATRIX_HPP_\n#define CLOTHO_ADJACENCY_MATRIX_HPP_\n\n#include <utility>\n\n#include \"clotho\/utility\/bit_helpers.hpp\"\n\n#define _DEBUGGING_\n\n#if _DEBUGGING_\n\n#include <cassert>\n#define INDEX_CHECK( idx ) assert( 0 < idx && idx < m_height );\n#define ALLOCATION_CHECK( ptr ) assert( ptr != NULL );\n\n#else\n\n#define INDEX_CHECK( idx )\n#define ALLOCATION_CHECK( ptr )\n\n#endif  \/\/ _DEBUGGING_\n\nnamespace clotho {\nnamespace powersets {\n\ntemplate < class BinaryType = unsigned long long, class SizeType = size_t >\nclass AdjacencyMatrix {\npublic:\n    typedef BinaryType  bit_block_type;\n    typedef SizeType    size_type;\n\n    typedef bit_block_type * row_pointer;\n\n    typedef clotho::utility::BitHelper< bit_block_type > bit_helper_type;\n\n\n    AdjacencyMatrix( size_type height, size_type bit_width ) :\n        m_data(NULL)\n        , m_soft_max(NULL)\n        , m_height(0)\n        , m_width(0)\n        , m_size(0)\n        , m_soft_size(0)\n    {\n        resize( height, bit_width );\n    }\n\n    row_pointer getRowStart( size_type index ) {\n        INDEX_CHECK( index )\n        return m_data + (index) * m_width;\n    }\n\n    row_pointer getRowEnd( size_type index ) {\n        INDEX_CHECK( index )\n        return m_data + (index + 1) * m_width;\n    }\n\n    std::pair< row_pointer, row_pointer > getRowRange( size_type index ) {\n        INDEX_CHECK( index )\n\n        row_pointer s = m_data + ( index * m_width );\n        row_pointer e = s + m_width;\n\n        return std::make_pair(s, e);\n    }\n\n    size_type getSoftMax( size_t index ) const {\n        INDEX_CHECK( index )\n\n        return m_soft_max[ index ];\n    }\n\n    size_type getHardMax( ) const {\n        return getBitWidth();\n    }\n\n    size_type getHeight() const {\n        return m_height;\n    }\n\n    size_type getBlockWidth() const {\n        return m_width;\n    }\n\n    size_type getBitWidth() const {\n        return m_width * bit_helper_type::BITS_PER_BLOCK;\n    }\n\n    virtual ~AdjacencyMatrix() {\n        if( m_data != NULL ) {\n            delete [] m_data;\n        }\n\n        if( m_soft_max != NULL ) {\n            delete [] m_soft_max;\n        }\n    }\n\nprotected:\n\n    size_type scale_bits_to_blocks( size_type bits ) {\n        return (bits \/ bit_helper_typer::BITS_PER_BLOCK ) + 1;\n    }\n\n    void resize( size_type height, size_type bit_width ) {\n        size_type _width = scale_bits_to_blocks( bit_width );\n\n        size_type new_size = height * _width;\n\n        if( new_size > m_size ) {\n\n            if( m_data != NULL ) {\n                delete [] m_data;\n            }\n\n            m_data = new bit_block_type[ new_size ];\n\n            ALLOCATION_CHECK( m_data )\n\n            m_size = new_size;\n        }\n\n        if( height > m_soft_size ) {\n\n            if( m_soft_size != NULL ) {\n                delete [] m_soft_size;\n            }\n\n            m_soft_size = new size_type[ height ];\n\n            m_soft_size = height;\n        }\n\n        m_height = height;\n        m_width = _width;\n    }\n\n    bit_block_type  * m_data;\n    soft_size_type  * m_soft_max;\n    size_type        m_height, m_width, m_size, m_soft_size;\n};\n\n}   \/\/ namespace powersets\n}   \/\/ namespace clotho\n\n#endif  \/\/ CLOTHO_ADJACENCY_MATRIX_HPP_\n<commit_msg>rename<commit_after>\/\/   Copyright 2015 Patrick Putnam\n\/\/\n\/\/   Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/   you may not use this file except in compliance with the License.\n\/\/   You may obtain a copy of the License at\n\/\/\n\/\/       http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/   Unless required by applicable law or agreed to in writing, software\n\/\/   distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/   See the License for the specific language governing permissions and\n\/\/   limitations under the License.\n#ifndef CLOTHO_ADJACENCY_MATRIX_HPP_\n#define CLOTHO_ADJACENCY_MATRIX_HPP_\n\n#include <utility>\n\n#include \"clotho\/utility\/bit_helper.hpp\"\n\n#define _DEBUGGING_\n\n#if _DEBUGGING_\n\n#include <cassert>\n#define INDEX_CHECK( idx ) assert( 0 < idx && idx < m_height );\n#define ALLOCATION_CHECK( ptr ) assert( ptr != NULL );\n\n#else\n\n#define INDEX_CHECK( idx )\n#define ALLOCATION_CHECK( ptr )\n\n#endif  \/\/ _DEBUGGING_\n\nnamespace clotho {\nnamespace powersets {\n\ntemplate < class BinaryType = unsigned long long, class SizeType = size_t >\nclass AdjacencyMatrix {\npublic:\n    typedef BinaryType  bit_block_type;\n    typedef SizeType    size_type;\n\n    typedef bit_block_type * row_pointer;\n\n    typedef clotho::utility::BitHelper< bit_block_type > bit_helper_type;\n\n\n    AdjacencyMatrix( size_type height, size_type bit_width ) :\n        m_data(NULL)\n        , m_soft_max(NULL)\n        , m_height(0)\n        , m_width(0)\n        , m_size(0)\n        , m_soft_size(0)\n    {\n        resize( height, bit_width );\n    }\n\n    row_pointer getRowStart( size_type index ) {\n        INDEX_CHECK( index )\n        return m_data + (index) * m_width;\n    }\n\n    row_pointer getRowEnd( size_type index ) {\n        INDEX_CHECK( index )\n        return m_data + (index + 1) * m_width;\n    }\n\n    std::pair< row_pointer, row_pointer > getRowRange( size_type index ) {\n        INDEX_CHECK( index )\n\n        row_pointer s = m_data + ( index * m_width );\n        row_pointer e = s + m_width;\n\n        return std::make_pair(s, e);\n    }\n\n    size_type getSoftMax( size_t index ) const {\n        INDEX_CHECK( index )\n\n        return m_soft_max[ index ];\n    }\n\n    size_type getHardMax( ) const {\n        return getBitWidth();\n    }\n\n    size_type getHeight() const {\n        return m_height;\n    }\n\n    size_type getBlockWidth() const {\n        return m_width;\n    }\n\n    size_type getBitWidth() const {\n        return m_width * bit_helper_type::BITS_PER_BLOCK;\n    }\n\n    virtual ~AdjacencyMatrix() {\n        if( m_data != NULL ) {\n            delete [] m_data;\n        }\n\n        if( m_soft_max != NULL ) {\n            delete [] m_soft_max;\n        }\n    }\n\nprotected:\n\n    size_type scale_bits_to_blocks( size_type bits ) {\n        return (bits \/ bit_helper_typer::BITS_PER_BLOCK ) + 1;\n    }\n\n    void resize( size_type height, size_type bit_width ) {\n        size_type _width = scale_bits_to_blocks( bit_width );\n\n        size_type new_size = height * _width;\n\n        if( new_size > m_size ) {\n\n            if( m_data != NULL ) {\n                delete [] m_data;\n            }\n\n            m_data = new bit_block_type[ new_size ];\n\n            ALLOCATION_CHECK( m_data )\n\n            m_size = new_size;\n        }\n\n        if( height > m_soft_size ) {\n\n            if( m_soft_size != NULL ) {\n                delete [] m_soft_size;\n            }\n\n            m_soft_size = new size_type[ height ];\n\n            m_soft_size = height;\n        }\n\n        m_height = height;\n        m_width = _width;\n    }\n\n    bit_block_type  * m_data;\n    soft_size_type  * m_soft_max;\n    size_type        m_height, m_width, m_size, m_soft_size;\n};\n\n}   \/\/ namespace powersets\n}   \/\/ namespace clotho\n\n#endif  \/\/ CLOTHO_ADJACENCY_MATRIX_HPP_\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        raw_ = new google::protobuf::io::FileInputStream(fid_);\n\n        if (endswith(filename, \".gz\")) {\n            gzip_ = new google::protobuf::io::GzipInputStream(raw_);\n            coded_ = new google::protobuf::io::CodedInputStream(gzip_);\n        } else {\n            gzip_ = nullptr;\n            coded_ = new google::protobuf::io::CodedInputStream(raw_);\n        }\n    }\n\n    ~InFile ()\n    {\n        delete coded_;\n        delete gzip_;\n        delete raw_;\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.ParseFromCodedStream(coded_);\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        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::ZeroCopyInputStream * raw_;\n    google::protobuf::io::GzipInputStream * gzip_;\n    google::protobuf::io::CodedInputStream * coded_;\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        raw_ = new google::protobuf::io::FileOutputStream(fid_);\n\n        if (endswith(filename, \".gz\")) {\n            gzip_ = new google::protobuf::io::GzipOutputStream(raw_);\n            coded_ = new google::protobuf::io::CodedOutputStream(gzip_);\n        } else {\n            gzip_ = nullptr;\n            coded_ = new google::protobuf::io::CodedOutputStream(raw_);\n        }\n    }\n\n    ~OutFile ()\n    {\n        delete coded_;\n        delete gzip_;\n        delete raw_;\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.SerializeToCodedStream(coded_);\n        DIST_ASSERT(success, \"failed to serialize message to \" << filename_);\n    }\n\n    template<class Message>\n    void write_stream (Message & message)\n    {\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::ZeroCopyOutputStream * raw_;\n    google::protobuf::io::GzipOutputStream * gzip_;\n    google::protobuf::io::CodedOutputStream * coded_;\n};\n\n} \/\/ namespace protobuf\n} \/\/ namespace distributions\n<commit_msg>Safer usage of protobuf stream api<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        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<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <microscopes\/common\/typedefs.hpp>\n#include <microscopes\/common\/macros.hpp>\n#include <microscopes\/common\/assert.hpp>\n#include <microscopes\/common\/util.hpp>\n#include <microscopes\/common\/runtime_value.hpp>\n#include <microscopes\/io\/schema.pb.h>\n#include <distributions\/special.hpp>\n#include <distributions\/io\/protobuf.hpp>\n\n#include <cmath>\n#include <vector>\n#include <set>\n#include <functional>\n#include <map>\n#include <memory>\n#include <sstream>\n#include <utility>\n#include <stdexcept>\n\nnamespace microscopes {\nnamespace common {\n\n\/\/ T needs default no-arg ctor\ntemplate <typename T>\nstruct gd {\n  gd() : count_(), data_() {}\n  gd(size_t count, const T& data) : count_(count), data_(data) {}\n  gd(size_t count, T&& data) : count_(count), data_(std::move(data)) {}\n\n  inline bool\n  operator==(const gd &that) const\n  {\n    return count_ == that.count_ && data_ == that.data_;\n  }\n\n  inline bool\n  operator!=(const gd &that) const\n  {\n    return !operator==(that);\n  }\n\n  size_t count_;\n  T data_;\n};\n\ntemplate <typename T>\nclass fixed_group_manager {\npublic:\n  typedef distributions::protobuf::DirichletDiscrete_Shared message_type;\n  typedef typename std::vector<std::pair<size_t, gd<T>>>::const_iterator const_iterator;\n\n  fixed_group_manager(size_t n, size_t k)\n    : alphas_(k),\n      assignments_(n, -1),\n      groups_(k)\n  {\n    for (size_t i = 0; i < k; i++)\n      groups_[i].first = i;\n  }\n\n  fixed_group_manager(\n      const serialized_t &repr,\n      std::function<T(const std::string &)> group_deserializer_fn)\n    : alphas_(), assignments_(), groups_()\n  {\n    io::FixedGroupManager m;\n    util::protobuf_from_string(m, repr);\n    MICROSCOPES_DCHECK(m.alphas_size() > 0, \"no alphas given\");\n    MICROSCOPES_DCHECK(m.assignments_size() > 0, \"no entities given\");\n    MICROSCOPES_DCHECK(m.alphas_size() == m.groups_size(), \"size discrepancy\");\n    for (size_t i = 0; i < m.alphas_size(); i++) {\n      MICROSCOPES_DCHECK(m.alphas(i) > 0., \"alphas can only be positive\");\n      alphas_.push_back(m.alphas(i));\n    }\n    std::vector<size_t> counts(alphas_.size());\n    for (size_t i = 0; i < m.assignments_size(); i++) {\n      MICROSCOPES_DCHECK(\n          m.assignments(i) == -1 ||\n          m.assignments(i) < alphas_.size(), \"invalid group id\");\n      assignments_.push_back(m.assignments(i));\n      if (assignments_.back() != -1)\n        counts[assignments_.back()]++;\n    }\n    for (size_t i = 0; i < m.groups_size(); i++) {\n      gd<T> g(counts[i], std::move(group_deserializer_fn(m.groups(i))));\n      groups_.emplace_back(i, std::move(g));\n    }\n  }\n\n  inline hyperparam_bag_t\n  get_hp() const\n  {\n    message_type m;\n    for (auto a : alphas_)\n      m.add_alphas(a);\n    return util::protobuf_to_string(m);\n  }\n\n  inline void\n  set_hp(const hyperparam_bag_t &hp)\n  {\n    message_type m;\n    util::protobuf_from_string(m, hp);\n    MICROSCOPES_DCHECK(m.alphas_size() == alphas_.size(), \"size doesn't match\");\n    for (size_t i = 0; i < alphas_.size(); i++) {\n      MICROSCOPES_DCHECK(m.alphas(i) > 0., \"alphas need to be positive\");\n      alphas_[i] = m.alphas(i);\n    }\n  }\n\n  inline value_mutator\n  get_hp_mutator(const std::string &key)\n  {\n    if (key == \"alphas\")\n      return value_mutator(\n          reinterpret_cast<uint8_t *>(&alphas_[0]),\n          runtime_type(TYPE_F32, alphas_.size()));\n    throw std::runtime_error(\"unknown key: \" + key);\n  }\n\n  inline const std::vector<ssize_t> &\n  assignments() const\n  {\n    return assignments_;\n  }\n\n  inline size_t nentities() const { return assignments_.size(); }\n  inline size_t ngroups() const { return groups_.size(); }\n\n  inline size_t\n  groupsize(size_t gid) const\n  {\n    return group(gid).count_;\n  }\n\n  inline const gd<T> &\n  group(size_t gid) const\n  {\n    MICROSCOPES_DCHECK(gid < ngroups(), \"invalid gid\");\n    return groups_[gid].second;\n  }\n\n  inline gd<T> &\n  group(size_t gid)\n  {\n    MICROSCOPES_DCHECK(gid < ngroups(), \"invalid gid\");\n    return groups_[gid].second;\n  }\n\n  inline std::vector<size_t>\n  groups() const\n  {\n    return util::range(ngroups());\n  }\n\n  inline const_iterator\n  begin() const\n  {\n    return groups_.begin();\n  }\n\n  inline const_iterator\n  end() const\n  {\n    return groups_.end();\n  }\n\n  inline T &\n  add_value(size_t gid, size_t eid)\n  {\n    MICROSCOPES_DCHECK(gid < ngroups(), \"invalid gid\");\n    MICROSCOPES_DCHECK(eid < nentities(), \"invalid eid\");\n    MICROSCOPES_DCHECK(assignments_[eid] == -1, \"entity already assigned\");\n    assignments_[eid] = gid;\n    auto &g = groups_[gid].second;\n    g.count_++;\n    return g.data_;\n  }\n\n  inline std::pair<size_t, T&>\n  remove_value(size_t eid)\n  {\n    MICROSCOPES_DCHECK(eid < nentities(), \"invalid eid\");\n    MICROSCOPES_DCHECK(assignments_[eid] != -1, \"entity not assigned\");\n    const size_t gid = assignments_[eid];\n    MICROSCOPES_ASSERT(gid < ngroups());\n    assignments_[eid] = -1;\n    auto &g = groups_[gid].second;\n    MICROSCOPES_ASSERT(g.count_);\n    g.count_--;\n    return std::pair<size_t, T&>(gid, g.data_);\n  }\n\n  inline float\n  score_assignment() const\n  {\n    using distributions::fast_lgamma;\n\n    float score = 0.;\n    float alpha_sum = 0.;\n    size_t count_sum = 0;\n\n    for (size_t i = 0; i < ngroups(); i++) {\n      const float alpha = alphas_[i];\n      const size_t count = groups_[i].second.count_;\n      alpha_sum += alpha;\n      count_sum += count;\n      score += fast_lgamma(alpha + float(count_sum)) - fast_lgamma(alpha);\n    }\n\n    score += fast_lgamma(alpha_sum)\n      - fast_lgamma(alpha_sum + float(count_sum));\n    return score;\n  }\n\n  inline float\n  pseudocount(size_t gid, const gd<T> &g) const\n  {\n    MICROSCOPES_DCHECK(gid < ngroups(), \"invalid gid\");\n    return alphas_[gid] + g.count_;\n  }\n\n  serialized_t\n  serialize(std::function<serialized_t(const T &)> group_serializer_fn) const\n  {\n    io::FixedGroupManager m;\n    for (auto a : alphas_)\n      m.add_alphas(a);\n    for (auto s : assignments_)\n      m.add_assignments(s);\n    for (auto &p : groups_)\n      m.add_groups(group_serializer_fn(p.second.data_));\n    return util::protobuf_to_string(m);\n  }\n\nprivate:\n  std::vector<float> alphas_;\n  std::vector<ssize_t> assignments_;\n  std::vector<std::pair<size_t, gd<T>>> groups_;\n};\n\ntemplate <typename T>\nclass group_manager {\npublic:\n  typedef io::CRP message_type;\n  typedef typename std::map<size_t, gd<T>>::const_iterator const_iterator;\n\n  group_manager(size_t n)\n    : alpha_(),\n      gcount_(),\n      gempty_(),\n      assignments_(n, -1),\n      groups_()\n  {}\n\n  group_manager(\n      const serialized_t &repr,\n      std::function<T(const std::string &)> group_deserializer_fn)\n    : alpha_(), gcount_(), gempty_(), assignments_(), groups_()\n  {\n    io::GroupManager m;\n    util::protobuf_from_string(m, repr);\n    MICROSCOPES_DCHECK(m.alpha() > 0., \"alphas can only be positive\");\n    MICROSCOPES_DCHECK(m.assignments_size() > 0, \"no entities given\");\n\n    alpha_ = m.alpha();\n    std::map<size_t, size_t> counts;\n    for (size_t i = 0; i < m.assignments_size(); i++) {\n      MICROSCOPES_DCHECK(\n          m.assignments(i) == -1 || m.assignments(i) >= 0,\n          \"invalid group id\");\n      assignments_.push_back(m.assignments(i));\n      if (assignments_.back() != -1)\n        counts[assignments_.back()]++;\n    }\n\n    for (size_t i = 0; i < m.groups_size(); i++) {\n      const auto &g = m.groups(i);\n      const auto it = counts.find(g.id());\n      const size_t count = (it == counts.end()) ? 0 : it->second;\n      gd<T> gdata(count, std::move(group_deserializer_fn(g.data())));\n      groups_[g.id()] = std::move(gdata);\n      if (!count)\n        gempty_.insert(g.id());\n    }\n\n    \/\/ gcount_ is 1+max group id seen\n    if (!groups_.empty())\n      gcount_ = groups_.crbegin()->first + 1;\n  }\n\n  inline hyperparam_bag_t\n  get_hp() const\n  {\n    message_type m;\n    m.set_alpha(alpha_);\n    return util::protobuf_to_string(m);\n  }\n\n  inline void\n  set_hp(const hyperparam_bag_t &hp)\n  {\n    message_type m;\n    util::protobuf_from_string(m, hp);\n    MICROSCOPES_DCHECK(m.alpha() > 0.0, \"alpha must be positive\");\n    alpha_ = m.alpha();\n  }\n\n  inline value_mutator\n  get_hp_mutator(const std::string &key)\n  {\n    if (key == \"alpha\")\n      return value_mutator(&alpha_);\n    throw std::runtime_error(\"unknown key: \" + key);\n  }\n\n  inline const std::vector<ssize_t> &\n  assignments() const\n  {\n    return assignments_;\n  }\n\n  inline const std::set<size_t> &\n  empty_groups() const\n  {\n    return gempty_;\n  }\n\n  inline size_t nentities() const { return assignments_.size(); }\n  inline size_t ngroups() const { return groups_.size(); }\n\n  inline bool\n  isactivegroup(size_t gid) const\n  {\n    return groups_.find(gid) != groups_.end();\n  }\n\n  inline size_t\n  groupsize(size_t gid) const\n  {\n    return group(gid).count_;\n  }\n\n  inline const gd<T> &\n  group(size_t gid) const\n  {\n    const auto it = groups_.find(gid);\n    MICROSCOPES_DCHECK(it != groups_.end(), \"invalid gid\");\n    return it->second;\n  }\n\n  inline gd<T> &\n  group(size_t gid)\n  {\n    auto it = groups_.find(gid);\n    MICROSCOPES_DCHECK(it != groups_.end(), \"invalid gid\");\n    return it->second;\n  }\n\n  inline std::vector<size_t>\n  groups() const\n  {\n    std::vector<size_t> ret;\n    ret.reserve(ngroups());\n    for (auto &g : groups_)\n      ret.push_back(g.first);\n    return ret;\n  }\n\n  inline const_iterator\n  begin() const\n  {\n    return groups_.begin();\n  }\n\n  inline const_iterator\n  end() const\n  {\n    return groups_.end();\n  }\n\n  inline std::pair<size_t, T&>\n  create_group()\n  {\n    const size_t gid = gcount_++;\n    auto &g = groups_[gid]; \/\/ create the group\n    MICROSCOPES_ASSERT(!gempty_.count(gid));\n    gempty_.insert(gid);\n    return std::pair<size_t, T&>(gid, g.data_);\n  }\n\n  inline void\n  delete_group(size_t gid)\n  {\n    auto it = groups_.find(gid);\n    MICROSCOPES_DCHECK(it != groups_.end(), \"invalid gid\");\n    MICROSCOPES_DCHECK(!it->second.count_, \"group not empty\");\n    MICROSCOPES_ASSERT(gempty_.count(gid));\n    groups_.erase(it);\n    gempty_.erase(gid);\n  }\n\n  inline T &\n  add_value(size_t gid, size_t eid)\n  {\n    MICROSCOPES_DCHECK(assignments_.at(eid) == -1, \"entity already assigned\");\n    auto it = groups_.find(gid);\n    MICROSCOPES_DCHECK(it != groups_.end(), \"invalid gid\");\n    if (!it->second.count_++) {\n      MICROSCOPES_ASSERT(gempty_.count(gid));\n      gempty_.erase(gid);\n      MICROSCOPES_ASSERT(!gempty_.count(gid));\n    } else {\n      MICROSCOPES_ASSERT(!gempty_.count(gid));\n    }\n    assignments_[eid] = gid;\n    return it->second.data_;\n  }\n\n  inline std::pair<size_t, T&>\n  remove_value(size_t eid)\n  {\n    MICROSCOPES_DCHECK(assignments_.at(eid) != -1, \"entity not assigned\");\n    const size_t gid = assignments_[eid];\n    auto it = groups_.find(gid);\n    MICROSCOPES_ASSERT(it != groups_.end());\n    MICROSCOPES_ASSERT(!gempty_.count(gid));\n    MICROSCOPES_ASSERT(it->second.count_);\n    if (!--it->second.count_)\n      gempty_.insert(gid);\n    assignments_[eid] = -1;\n    return std::pair<size_t, T&>(gid, it->second.data_);\n  }\n\n  inline float\n  score_assignment() const\n  {\n    using distributions::fast_log;\n    std::map<size_t, size_t> counts;\n    MICROSCOPES_DCHECK(assignments_[0] != -1, \"not assigned\");\n    counts[assignments_[0]] = 1;\n    float sum = 0.;\n    for (size_t i = 1; i < assignments_.size(); i++) {\n      const ssize_t gid = assignments_[i];\n      MICROSCOPES_DCHECK(gid != -1, \"not assigned\");\n      const auto it = counts.find(gid);\n      const bool found = (it != counts.end());\n      const float numer = (!found) ? alpha_ : it->second;\n      const float denom = float(i) + alpha_;\n      sum += fast_log(numer \/ denom);\n      if (found)\n        it->second++;\n      else\n        counts[gid] = 1;\n    }\n    return sum;\n  }\n\n  inline float\n  pseudocount(size_t gid, const gd<T> &g) const\n  {\n    if (g.count_)\n      return g.count_;\n    else {\n      MICROSCOPES_ASSERT(gempty_.size());\n      return alpha_ \/ float(gempty_.size());\n    }\n  }\n\n  serialized_t\n  serialize(std::function<serialized_t(const T &)> group_serializer_fn) const\n  {\n    io::GroupManager m;\n    m.set_alpha(alpha_);\n    for (auto s : assignments_)\n      m.add_assignments(s);\n    for (auto &p : groups_) {\n      io::GroupData &g = *m.add_groups();\n      g.set_id(p.first);\n      g.set_data(group_serializer_fn(p.second.data_));\n    }\n    return util::protobuf_to_string(m);\n  }\n\nprotected:\n  float alpha_;\n  size_t gcount_;\n  std::set<size_t> gempty_;\n  std::vector<ssize_t> assignments_;\n  std::map<size_t, gd<T>> groups_;\n};\n\n} \/\/ namespace common\n} \/\/ namespace microscopes\n<commit_msg>protobuf message size type is int<commit_after>#pragma once\n\n#include <microscopes\/common\/typedefs.hpp>\n#include <microscopes\/common\/macros.hpp>\n#include <microscopes\/common\/assert.hpp>\n#include <microscopes\/common\/util.hpp>\n#include <microscopes\/common\/runtime_value.hpp>\n#include <microscopes\/io\/schema.pb.h>\n#include <distributions\/special.hpp>\n#include <distributions\/io\/protobuf.hpp>\n\n#include <cmath>\n#include <vector>\n#include <set>\n#include <functional>\n#include <map>\n#include <memory>\n#include <sstream>\n#include <utility>\n#include <stdexcept>\n\nnamespace microscopes {\nnamespace common {\n\n\/\/ T needs default no-arg ctor\ntemplate <typename T>\nstruct gd {\n  gd() : count_(), data_() {}\n  gd(size_t count, const T& data) : count_(count), data_(data) {}\n  gd(size_t count, T&& data) : count_(count), data_(std::move(data)) {}\n\n  inline bool\n  operator==(const gd &that) const\n  {\n    return count_ == that.count_ && data_ == that.data_;\n  }\n\n  inline bool\n  operator!=(const gd &that) const\n  {\n    return !operator==(that);\n  }\n\n  size_t count_;\n  T data_;\n};\n\ntemplate <typename T>\nclass fixed_group_manager {\npublic:\n  typedef distributions::protobuf::DirichletDiscrete_Shared message_type;\n  typedef typename std::vector<std::pair<size_t, gd<T>>>::const_iterator const_iterator;\n\n  fixed_group_manager(size_t n, size_t k)\n    : alphas_(k),\n      assignments_(n, -1),\n      groups_(k)\n  {\n    for (size_t i = 0; i < k; i++)\n      groups_[i].first = i;\n  }\n\n  fixed_group_manager(\n      const serialized_t &repr,\n      std::function<T(const std::string &)> group_deserializer_fn)\n    : alphas_(), assignments_(), groups_()\n  {\n    io::FixedGroupManager m;\n    util::protobuf_from_string(m, repr);\n    MICROSCOPES_DCHECK(m.alphas_size() > 0, \"no alphas given\");\n    MICROSCOPES_DCHECK(m.assignments_size() > 0, \"no entities given\");\n    MICROSCOPES_DCHECK(m.alphas_size() == m.groups_size(), \"size discrepancy\");\n    for (size_t i = 0; i < (size_t)m.alphas_size(); i++) {\n      MICROSCOPES_DCHECK(m.alphas(i) > 0., \"alphas can only be positive\");\n      alphas_.push_back(m.alphas(i));\n    }\n    std::vector<size_t> counts(alphas_.size());\n    for (size_t i = 0; i < (size_t)m.assignments_size(); i++) {\n      MICROSCOPES_DCHECK(\n          m.assignments(i) == -1 ||\n          m.assignments(i) < alphas_.size(), \"invalid group id\");\n      assignments_.push_back(m.assignments(i));\n      if (assignments_.back() != -1)\n        counts[assignments_.back()]++;\n    }\n    for (size_t i = 0; i < (size_t)m.groups_size(); i++) {\n      gd<T> g(counts[i], std::move(group_deserializer_fn(m.groups(i))));\n      groups_.emplace_back(i, std::move(g));\n    }\n  }\n\n  inline hyperparam_bag_t\n  get_hp() const\n  {\n    message_type m;\n    for (auto a : alphas_)\n      m.add_alphas(a);\n    return util::protobuf_to_string(m);\n  }\n\n  inline void\n  set_hp(const hyperparam_bag_t &hp)\n  {\n    message_type m;\n    util::protobuf_from_string(m, hp);\n    MICROSCOPES_DCHECK(m.alphas_size() == alphas_.size(), \"size doesn't match\");\n    for (size_t i = 0; i < (size_t)m.alphas_size(); i++) {\n      MICROSCOPES_DCHECK(m.alphas(i) > 0., \"alphas need to be positive\");\n      alphas_[i] = m.alphas(i);\n    }\n  }\n\n  inline value_mutator\n  get_hp_mutator(const std::string &key)\n  {\n    if (key == \"alphas\")\n      return value_mutator(\n          reinterpret_cast<uint8_t *>(&alphas_[0]),\n          runtime_type(TYPE_F32, alphas_.size()));\n    throw std::runtime_error(\"unknown key: \" + key);\n  }\n\n  inline const std::vector<ssize_t> &\n  assignments() const\n  {\n    return assignments_;\n  }\n\n  inline size_t nentities() const { return assignments_.size(); }\n  inline size_t ngroups() const { return groups_.size(); }\n\n  inline size_t\n  groupsize(size_t gid) const\n  {\n    return group(gid).count_;\n  }\n\n  inline const gd<T> &\n  group(size_t gid) const\n  {\n    MICROSCOPES_DCHECK(gid < ngroups(), \"invalid gid\");\n    return groups_[gid].second;\n  }\n\n  inline gd<T> &\n  group(size_t gid)\n  {\n    MICROSCOPES_DCHECK(gid < ngroups(), \"invalid gid\");\n    return groups_[gid].second;\n  }\n\n  inline std::vector<size_t>\n  groups() const\n  {\n    return util::range(ngroups());\n  }\n\n  inline const_iterator\n  begin() const\n  {\n    return groups_.begin();\n  }\n\n  inline const_iterator\n  end() const\n  {\n    return groups_.end();\n  }\n\n  inline T &\n  add_value(size_t gid, size_t eid)\n  {\n    MICROSCOPES_DCHECK(gid < ngroups(), \"invalid gid\");\n    MICROSCOPES_DCHECK(eid < nentities(), \"invalid eid\");\n    MICROSCOPES_DCHECK(assignments_[eid] == -1, \"entity already assigned\");\n    assignments_[eid] = gid;\n    auto &g = groups_[gid].second;\n    g.count_++;\n    return g.data_;\n  }\n\n  inline std::pair<size_t, T&>\n  remove_value(size_t eid)\n  {\n    MICROSCOPES_DCHECK(eid < nentities(), \"invalid eid\");\n    MICROSCOPES_DCHECK(assignments_[eid] != -1, \"entity not assigned\");\n    const size_t gid = assignments_[eid];\n    MICROSCOPES_ASSERT(gid < ngroups());\n    assignments_[eid] = -1;\n    auto &g = groups_[gid].second;\n    MICROSCOPES_ASSERT(g.count_);\n    g.count_--;\n    return std::pair<size_t, T&>(gid, g.data_);\n  }\n\n  inline float\n  score_assignment() const\n  {\n    using distributions::fast_lgamma;\n\n    float score = 0.;\n    float alpha_sum = 0.;\n    size_t count_sum = 0;\n\n    for (size_t i = 0; i < ngroups(); i++) {\n      const float alpha = alphas_[i];\n      const size_t count = groups_[i].second.count_;\n      alpha_sum += alpha;\n      count_sum += count;\n      score += fast_lgamma(alpha + float(count_sum)) - fast_lgamma(alpha);\n    }\n\n    score += fast_lgamma(alpha_sum)\n      - fast_lgamma(alpha_sum + float(count_sum));\n    return score;\n  }\n\n  inline float\n  pseudocount(size_t gid, const gd<T> &g) const\n  {\n    MICROSCOPES_DCHECK(gid < ngroups(), \"invalid gid\");\n    return alphas_[gid] + g.count_;\n  }\n\n  serialized_t\n  serialize(std::function<serialized_t(const T &)> group_serializer_fn) const\n  {\n    io::FixedGroupManager m;\n    for (auto a : alphas_)\n      m.add_alphas(a);\n    for (auto s : assignments_)\n      m.add_assignments(s);\n    for (auto &p : groups_)\n      m.add_groups(group_serializer_fn(p.second.data_));\n    return util::protobuf_to_string(m);\n  }\n\nprivate:\n  std::vector<float> alphas_;\n  std::vector<ssize_t> assignments_;\n  std::vector<std::pair<size_t, gd<T>>> groups_;\n};\n\ntemplate <typename T>\nclass group_manager {\npublic:\n  typedef io::CRP message_type;\n  typedef typename std::map<size_t, gd<T>>::const_iterator const_iterator;\n\n  group_manager(size_t n)\n    : alpha_(),\n      gcount_(),\n      gempty_(),\n      assignments_(n, -1),\n      groups_()\n  {}\n\n  group_manager(\n      const serialized_t &repr,\n      std::function<T(const std::string &)> group_deserializer_fn)\n    : alpha_(), gcount_(), gempty_(), assignments_(), groups_()\n  {\n    io::GroupManager m;\n    util::protobuf_from_string(m, repr);\n    MICROSCOPES_DCHECK(m.alpha() > 0., \"alphas can only be positive\");\n    MICROSCOPES_DCHECK(m.assignments_size() > 0, \"no entities given\");\n\n    alpha_ = m.alpha();\n    std::map<size_t, size_t> counts;\n    for (size_t i = 0; i < (size_t)m.assignments_size(); i++) {\n      MICROSCOPES_DCHECK(\n          m.assignments(i) == -1 || m.assignments(i) >= 0,\n          \"invalid group id\");\n      assignments_.push_back(m.assignments(i));\n      if (assignments_.back() != -1)\n        counts[assignments_.back()]++;\n    }\n\n    for (size_t i = 0; i < (size_t)m.groups_size(); i++) {\n      const auto &g = m.groups(i);\n      const auto it = counts.find(g.id());\n      const size_t count = (it == counts.end()) ? 0 : it->second;\n      gd<T> gdata(count, std::move(group_deserializer_fn(g.data())));\n      groups_[g.id()] = std::move(gdata);\n      if (!count)\n        gempty_.insert(g.id());\n    }\n\n    \/\/ gcount_ is 1+max group id seen\n    if (!groups_.empty())\n      gcount_ = groups_.crbegin()->first + 1;\n  }\n\n  inline hyperparam_bag_t\n  get_hp() const\n  {\n    message_type m;\n    m.set_alpha(alpha_);\n    return util::protobuf_to_string(m);\n  }\n\n  inline void\n  set_hp(const hyperparam_bag_t &hp)\n  {\n    message_type m;\n    util::protobuf_from_string(m, hp);\n    MICROSCOPES_DCHECK(m.alpha() > 0.0, \"alpha must be positive\");\n    alpha_ = m.alpha();\n  }\n\n  inline value_mutator\n  get_hp_mutator(const std::string &key)\n  {\n    if (key == \"alpha\")\n      return value_mutator(&alpha_);\n    throw std::runtime_error(\"unknown key: \" + key);\n  }\n\n  inline const std::vector<ssize_t> &\n  assignments() const\n  {\n    return assignments_;\n  }\n\n  inline const std::set<size_t> &\n  empty_groups() const\n  {\n    return gempty_;\n  }\n\n  inline size_t nentities() const { return assignments_.size(); }\n  inline size_t ngroups() const { return groups_.size(); }\n\n  inline bool\n  isactivegroup(size_t gid) const\n  {\n    return groups_.find(gid) != groups_.end();\n  }\n\n  inline size_t\n  groupsize(size_t gid) const\n  {\n    return group(gid).count_;\n  }\n\n  inline const gd<T> &\n  group(size_t gid) const\n  {\n    const auto it = groups_.find(gid);\n    MICROSCOPES_DCHECK(it != groups_.end(), \"invalid gid\");\n    return it->second;\n  }\n\n  inline gd<T> &\n  group(size_t gid)\n  {\n    auto it = groups_.find(gid);\n    MICROSCOPES_DCHECK(it != groups_.end(), \"invalid gid\");\n    return it->second;\n  }\n\n  inline std::vector<size_t>\n  groups() const\n  {\n    std::vector<size_t> ret;\n    ret.reserve(ngroups());\n    for (auto &g : groups_)\n      ret.push_back(g.first);\n    return ret;\n  }\n\n  inline const_iterator\n  begin() const\n  {\n    return groups_.begin();\n  }\n\n  inline const_iterator\n  end() const\n  {\n    return groups_.end();\n  }\n\n  inline std::pair<size_t, T&>\n  create_group()\n  {\n    const size_t gid = gcount_++;\n    auto &g = groups_[gid]; \/\/ create the group\n    MICROSCOPES_ASSERT(!gempty_.count(gid));\n    gempty_.insert(gid);\n    return std::pair<size_t, T&>(gid, g.data_);\n  }\n\n  inline void\n  delete_group(size_t gid)\n  {\n    auto it = groups_.find(gid);\n    MICROSCOPES_DCHECK(it != groups_.end(), \"invalid gid\");\n    MICROSCOPES_DCHECK(!it->second.count_, \"group not empty\");\n    MICROSCOPES_ASSERT(gempty_.count(gid));\n    groups_.erase(it);\n    gempty_.erase(gid);\n  }\n\n  inline T &\n  add_value(size_t gid, size_t eid)\n  {\n    MICROSCOPES_DCHECK(assignments_.at(eid) == -1, \"entity already assigned\");\n    auto it = groups_.find(gid);\n    MICROSCOPES_DCHECK(it != groups_.end(), \"invalid gid\");\n    if (!it->second.count_++) {\n      MICROSCOPES_ASSERT(gempty_.count(gid));\n      gempty_.erase(gid);\n      MICROSCOPES_ASSERT(!gempty_.count(gid));\n    } else {\n      MICROSCOPES_ASSERT(!gempty_.count(gid));\n    }\n    assignments_[eid] = gid;\n    return it->second.data_;\n  }\n\n  inline std::pair<size_t, T&>\n  remove_value(size_t eid)\n  {\n    MICROSCOPES_DCHECK(assignments_.at(eid) != -1, \"entity not assigned\");\n    const size_t gid = assignments_[eid];\n    auto it = groups_.find(gid);\n    MICROSCOPES_ASSERT(it != groups_.end());\n    MICROSCOPES_ASSERT(!gempty_.count(gid));\n    MICROSCOPES_ASSERT(it->second.count_);\n    if (!--it->second.count_)\n      gempty_.insert(gid);\n    assignments_[eid] = -1;\n    return std::pair<size_t, T&>(gid, it->second.data_);\n  }\n\n  inline float\n  score_assignment() const\n  {\n    using distributions::fast_log;\n    std::map<size_t, size_t> counts;\n    MICROSCOPES_DCHECK(assignments_[0] != -1, \"not assigned\");\n    counts[assignments_[0]] = 1;\n    float sum = 0.;\n    for (size_t i = 1; i < assignments_.size(); i++) {\n      const ssize_t gid = assignments_[i];\n      MICROSCOPES_DCHECK(gid != -1, \"not assigned\");\n      const auto it = counts.find(gid);\n      const bool found = (it != counts.end());\n      const float numer = (!found) ? alpha_ : it->second;\n      const float denom = float(i) + alpha_;\n      sum += fast_log(numer \/ denom);\n      if (found)\n        it->second++;\n      else\n        counts[gid] = 1;\n    }\n    return sum;\n  }\n\n  inline float\n  pseudocount(size_t gid, const gd<T> &g) const\n  {\n    if (g.count_)\n      return g.count_;\n    else {\n      MICROSCOPES_ASSERT(gempty_.size());\n      return alpha_ \/ float(gempty_.size());\n    }\n  }\n\n  serialized_t\n  serialize(std::function<serialized_t(const T &)> group_serializer_fn) const\n  {\n    io::GroupManager m;\n    m.set_alpha(alpha_);\n    for (auto s : assignments_)\n      m.add_assignments(s);\n    for (auto &p : groups_) {\n      io::GroupData &g = *m.add_groups();\n      g.set_id(p.first);\n      g.set_data(group_serializer_fn(p.second.data_));\n    }\n    return util::protobuf_to_string(m);\n  }\n\nprotected:\n  float alpha_;\n  size_t gcount_;\n  std::set<size_t> gempty_;\n  std::vector<ssize_t> assignments_;\n  std::map<size_t, gd<T>> groups_;\n};\n\n} \/\/ namespace common\n} \/\/ namespace microscopes\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Created by Darren Otgaar on 2016\/04\/24.\n\/\/\n\n#ifndef SIMPLE_MP3_MP3_STREAM_HPP\n#define SIMPLE_MP3_MP3_STREAM_HPP\n\n#include \"audio_stream.hpp\"\n#include \"ring_buffer.hpp\"\n#include \"..\/log.hpp\"\n#include <lame\/lame.h>\n#include <fstream>\n#include <cassert>\n\nusing byte = unsigned char;\n\nstruct mp3_format {\n    int samplerate;\n    int bitrate;\n    int channels;\n    int total_frames;\n    int duration;   \/\/ In seconds\n};\n\nconstexpr size_t mp3_frame_size = 1152;\n\nclass mp3_stream : public audio_stream<short> {\npublic:\n    mp3_stream(const std::string& filename, size_t frame_size, audio_stream<short>* parent) : filename_(filename),\n            header_parsed_(false), processed_(0), frame_size_(frame_size), output_buffer_(100*mp3_frame_size),\n            input_buffer_(100*frame_size) {\n        read_buf.resize(frame_size);\n    }\n    virtual ~mp3_stream() { if(file_.is_open()) file_.close(); }\n\n    bool is_open() const { return file_.is_open(); }\n    const mp3_format& get_header() const { return header_; }\n\n    bool start() {\n        initialise();\n        file_ = std::ifstream(filename_, std::ios_base::in);\n\n        if(file_.is_open()) {\n            file_.seekg(0, std::ios::end);\n            filelen_ = file_.tellg();\n            file_.seekg(0, std::ios::beg);\n\n            fill_input_buffer();\n\n            \/\/ Load some data into the input buffer and try to strip the ID3 header\n            if(!strip_header()) {\n                if(is_open()) file_.close();\n                SM_LOG(\"Could not strip header\");\n                return false;\n            }\n\n            while(!header_parsed_ && is_open()) {\n                fill_output_buffer();\n            }\n        }\n        return true;\n    }\n\n    virtual size_t read(buffer_t& buffer, size_t len) {\n        if(output_buffer_.size() < len) fill_output_buffer();\n        auto l = output_buffer_.read(buffer.data(), len);\n        return l;\n    }\n\n    virtual size_t write(const buffer_t& buffer, size_t len) {\n        return 0;\n    }\n\nprotected:\n    std::vector<byte> read_buf;\n\n    bool initialise() {\n        lame_ = lame_init();\n        if(!lame_) {\n            SM_LOG(\"LAME failed to initialise\");\n            return false;\n        }\n\n        lame_set_decode_only(lame_, 1);\n        lame_set_num_samples(lame_, std::numeric_limits<unsigned int>::max());\n\n        hip_ = hip_decode_init();\n        if(!hip_) {\n            SM_LOG(\"LAME HIP failed to initialise\");\n            return false;\n        }\n        return true;\n    }\n\n    void shutdown() {\n        hip_decode_exit(hip_);\n        hip_ = nullptr;\n        lame_close(lame_);\n        lame_ = nullptr;\n    }\n\n    void fill_input_buffer() {\n        while(is_open() && (input_buffer_.size() < input_buffer_.capacity()\/2)) {\n            auto rd = std::min(size_t(filelen_ - file_.tellg()), frame_size_);\n            file_.read(reinterpret_cast<char*>(read_buf.data()), frame_size_);\n            processed_ += rd;\n            size_t off = file_.tellg();\n            if(off == -1) {\n                SM_LOG(\"Closing file\", filelen_, processed_);\n                file_.close();\n            }\n            else input_buffer_.write(read_buf.data(), rd);\n        }\n    }\n\n    int zip(short* left_pcm, short* right_pcm, int len) {\n        for(int i = 0; i != len; ++i) {\n            output_buffer_.write(left_pcm+i, 1);\n            output_buffer_.write(right_pcm+i, 1);\n        }\n        return len;\n    }\n\n    short left_pcm[mp3_frame_size];\n    short right_pcm[mp3_frame_size];\n\n    void fill_output_buffer() {\n        int ret = 0, len = 0;\n        while(output_buffer_.size() < output_buffer_.capacity()\/2 && input_buffer_.size() > 0) {\n            len = input_buffer_.read(read_buf.data(), frame_size_);\n            if(!header_parsed_) {\n                ret = hip_decode1_headers(hip_, read_buf.data(), len, left_pcm, right_pcm, &mp3data_);\n                if(mp3data_.header_parsed) {\n                    header_ = lame_2_header(mp3data_);\n                    header_parsed_ = true;\n                }\n            } else {\n                ret = hip_decode1_headers(hip_, read_buf.data(), len, left_pcm, right_pcm, &mp3data_);\n                if(ret > 0) zip(left_pcm, right_pcm, ret);\n                while(ret != 0) {\n                    ret = hip_decode1_headers(hip_, read_buf.data(), 0, left_pcm, right_pcm, &mp3data_);\n                    if(ret > 0) zip(left_pcm, right_pcm, ret);\n                }\n            }\n            fill_input_buffer();\n        }\n    }\n\n    bool strip_header() {\n        assert(input_buffer_.read_position() == 0 && \"buffer should be positioned at zero\");\n        byte header[100];\n        if(input_buffer_.read(header, 4) != 4) return false;\n\n        if(memcmp(header, \"ID3\", 3) == 0) { \/\/ Check ID3 Header\n            SM_LOG(\"ID3 found\");\n            \/\/ Read the length of the id3 header\n            if(input_buffer_.read(header, 6) != 6) return false;\n            header[2] &= 0x7f; header[3] &= 0x7f; header[4] &= 0x7f; header[5] &= 0x7f;\n            size_t skip = (((((header[2] << 7) + header[3]) << 7) + header[4] ) << 7) + header[5];\n            SM_LOG(\"skipping =\", skip);\n            if(input_buffer_.skip(skip) != skip) return false;\n            if(input_buffer_.read(header, 4) != 4) return false;   \/\/ Reposition buffer\n        }\n\n        if(memcmp(header, \"AiD\\1\", 4) == 0) { \/\/ Check for Album ID Header\n            SM_LOG(\"Album ID found\");\n            if(input_buffer_.read(header, 2) != 2) return false;\n            size_t skip = (size_t)header[0] + 256 * (size_t)header[1];\n            if(input_buffer_.skip(skip - 6) != (skip - 6)) return false;\n            if(input_buffer_.read(header, 4) != 4) return false;   \/\/ Reposition buffer\n        }\n\n        \/\/ Now scan to find the mp3 sync word\n        size_t skipped = 0;\n        while(!is_syncword_mp123(input_buffer_.read_ptr())) {\n            byte dummy;\n            if(input_buffer_.read(&dummy, 1) != 1) return false;\n            skipped++;\n            if(skipped >= 2048) {\n                SM_LOG(\"Corrupted file, more than 2048 bytes skipped after headers and still no sync word\");\n                return false;\n            }\n        }\n        return true;\n    }\n\n    bool is_syncword_mp123(const byte* ptr) {\n        static const char abl2[16] = { 0, 7, 7, 7, 0, 7, 0, 0, 0, 0, 0, 8, 8, 8, 8, 8 };\n        if((ptr[0] & 0xFF) != 0xFF) return false;\n        if((ptr[1] & 0xE0) != 0xE0) return false;\n        if((ptr[1] & 0x18) == 0x08) return false;\n        if((ptr[1] & 0x06) == 0x00) return false;\n        if((ptr[2] & 0xF0) == 0xF0) return false;\n        if((ptr[2] & 0x0C) == 0x0C) return false;\n        if((ptr[1] & 0x18) == 0x18 && (ptr[1] & 0x06) == 0x04 && abl2[ptr[2] >> 4] & (1 << (ptr[3] >> 6))) return false;\n        return (ptr[3] & 3) != 2;\n    }\n\n    static mp3_format lame_2_header(const mp3data_struct& mp3data) {\n        mp3_format fmt;\n        fmt.bitrate = mp3data.bitrate;\n        fmt.channels = mp3data.stereo;\n        fmt.samplerate = mp3data.samplerate;\n        fmt.duration = mp3data.totalframes \/ mp3data.samplerate;\n        fmt.total_frames = mp3data.totalframes;\n        return fmt;\n    }\n\nprivate:\n    std::string filename_;\n    bool header_parsed_;\n    size_t filelen_;\n    size_t processed_;  \/\/ Debug var for mp3 drop-out\n    size_t frame_size_;\n    ring_buffer<short> output_buffer_;\n    ring_buffer<byte> input_buffer_;\n    mp3_format header_;\n    std::ifstream file_;\n    lame_t lame_;\n    hip_t hip_;\n    mp3data_struct mp3data_;\n};\n\n#endif \/\/SIMPLE_MP3_MP3_STREAM_HPP\n<commit_msg>- Cleanup of buffering code - Refactoring - Restored binary mode file reading<commit_after>\/\/\n\/\/ Created by Darren Otgaar on 2016\/04\/24.\n\/\/\n\n#ifndef SIMPLE_MP3_MP3_STREAM_HPP\n#define SIMPLE_MP3_MP3_STREAM_HPP\n\n#include \"audio_stream.hpp\"\n#include \"ring_buffer.hpp\"\n#include \"..\/log.hpp\"\n#include <lame\/lame.h>\n#include <fstream>\n#include <cassert>\n\nusing byte = unsigned char;\n\nstruct mp3_format {\n    int samplerate;\n    int bitrate;\n    int channels;\n    int total_frames;\n    int duration;   \/\/ In seconds\n};\n\nconstexpr size_t mp3_frame_size = 1152;\n\nclass mp3_stream : public audio_stream<short> {\npublic:\n    mp3_stream(const std::string& filename, size_t frame_size, audio_stream<short>* parent) : filename_(filename),\n            header_parsed_(false), file_size_(0), processed_(0), frame_size_(frame_size),\n            output_buffer_(100*mp3_frame_size), input_buffer_(100*frame_size) {\n        read_buf.resize(frame_size);\n    }\n    virtual ~mp3_stream() { if(file_.is_open()) file_.close(); }\n\n    bool is_open() const { return file_.is_open(); }\n    const mp3_format& get_header() const { return header_; }\n\n    bool start() {\n        initialise();\n        file_ = std::ifstream(filename_, std::ios_base::binary | std::ios_base::in);\n\n        if(file_.is_open()) {\n            file_.seekg(0, std::ios::end);\n            file_size_ = file_.tellg();\n            file_.seekg(0, std::ios::beg);\n\n            fill_input_buffer();\n\n            \/\/ Load some data into the input buffer and try to strip the ID3 header\n            if(!strip_header()) {\n                if(is_open()) file_.close();\n                SM_LOG(\"Could not strip header\");\n                return false;\n            }\n\n            while(!header_parsed_ && is_open()) {\n                fill_output_buffer();\n            }\n        }\n        return true;\n    }\n\n    virtual size_t read(buffer_t& buffer, size_t len) {\n        if(output_buffer_.size() < len) fill_output_buffer();\n        auto l = output_buffer_.read(buffer.data(), len);\n        return l;\n    }\n\n    virtual size_t write(const buffer_t& buffer, size_t len) {\n        return 0;\n    }\n\nprotected:\n    std::vector<byte> read_buf;\n\n    bool initialise() {\n        lame_ = lame_init();\n        if(!lame_) {\n            SM_LOG(\"LAME failed to initialise\");\n            return false;\n        }\n\n        lame_set_decode_only(lame_, 1);\n        lame_set_num_samples(lame_, std::numeric_limits<unsigned int>::max());\n\n        hip_ = hip_decode_init();\n        if(!hip_) {\n            SM_LOG(\"LAME HIP failed to initialise\");\n            return false;\n        }\n        return true;\n    }\n\n    void shutdown() {\n        hip_decode_exit(hip_);\n        hip_ = nullptr;\n        lame_close(lame_);\n        lame_ = nullptr;\n    }\n\n    void fill_input_buffer() {\n        while(is_open() && (input_buffer_.size() < input_buffer_.capacity()\/2)) {\n            auto rd = std::min(size_t(file_size_ - file_.tellg()), frame_size_);\n            file_.read(reinterpret_cast<char*>(read_buf.data()), frame_size_);\n            processed_ += rd;\n            size_t off = file_.tellg();\n            if(off == -1) {\n                SM_LOG(\"Closing file\", file_size_, processed_);\n                file_.close();\n            }\n            else input_buffer_.write(read_buf.data(), rd);\n        }\n    }\n\n    int zip(short* left_pcm, short* right_pcm, int len) {\n        for(int i = 0; i != len; ++i) {\n            output_buffer_.write(left_pcm+i, 1);\n            output_buffer_.write(right_pcm+i, 1);\n        }\n        return len;\n    }\n\n    short left_pcm[mp3_frame_size];\n    short right_pcm[mp3_frame_size];\n\n    void fill_output_buffer() {\n        int ret = 0, len = 0;\n        while(output_buffer_.size() < output_buffer_.capacity()\/2 && input_buffer_.size() > 0) {\n            len = input_buffer_.read(read_buf.data(), frame_size_);\n            if(!header_parsed_) {\n                ret = hip_decode1_headers(hip_, read_buf.data(), len, left_pcm, right_pcm, &mp3data_);\n                if(mp3data_.header_parsed) {\n                    header_ = lame_2_header(mp3data_);\n                    header_parsed_ = true;\n                }\n            } else {\n                ret = hip_decode1_headers(hip_, read_buf.data(), len, left_pcm, right_pcm, &mp3data_);\n                while(ret != 0) {\n                    zip(left_pcm, right_pcm, ret);\n                    ret = hip_decode1_headers(hip_, read_buf.data(), 0, left_pcm, right_pcm, &mp3data_);\n                }\n            }\n            fill_input_buffer();\n        }\n    }\n\n    bool strip_header() {\n        assert(input_buffer_.read_position() == 0 && \"buffer should be positioned at zero\");\n        byte header[100];\n        if(input_buffer_.read(header, 4) != 4) return false;\n\n        if(memcmp(header, \"ID3\", 3) == 0) { \/\/ Check ID3 Header\n            SM_LOG(\"ID3 found\");\n            \/\/ Read the length of the id3 header\n            if(input_buffer_.read(header, 6) != 6) return false;\n            header[2] &= 0x7f; header[3] &= 0x7f; header[4] &= 0x7f; header[5] &= 0x7f;\n            size_t skip = (((((header[2] << 7) + header[3]) << 7) + header[4] ) << 7) + header[5];\n            SM_LOG(\"skipping =\", skip);\n            if(input_buffer_.skip(skip) != skip) return false;\n            if(input_buffer_.read(header, 4) != 4) return false;   \/\/ Reposition buffer\n        }\n\n        if(memcmp(header, \"AiD\\1\", 4) == 0) { \/\/ Check for Album ID Header\n            SM_LOG(\"Album ID found\");\n            if(input_buffer_.read(header, 2) != 2) return false;\n            size_t skip = (size_t)header[0] + 256 * (size_t)header[1];\n            if(input_buffer_.skip(skip - 6) != (skip - 6)) return false;\n            if(input_buffer_.read(header, 4) != 4) return false;   \/\/ Reposition buffer\n        }\n\n        \/\/ Now scan to find the mp3 sync word\n        size_t skipped = 0;\n        while(!is_syncword_mp123(input_buffer_.read_ptr())) {\n            byte dummy;\n            if(input_buffer_.read(&dummy, 1) != 1) return false;\n            skipped++;\n            if(skipped >= 2048) {\n                SM_LOG(\"Corrupted file, more than 2048 bytes skipped after headers and still no sync word\");\n                return false;\n            }\n        }\n        return true;\n    }\n\n    bool is_syncword_mp123(const byte* ptr) {\n        static const char abl2[16] = { 0, 7, 7, 7, 0, 7, 0, 0, 0, 0, 0, 8, 8, 8, 8, 8 };\n        if((ptr[0] & 0xFF) != 0xFF) return false;\n        if((ptr[1] & 0xE0) != 0xE0) return false;\n        if((ptr[1] & 0x18) == 0x08) return false;\n        if((ptr[1] & 0x06) == 0x00) return false;\n        if((ptr[2] & 0xF0) == 0xF0) return false;\n        if((ptr[2] & 0x0C) == 0x0C) return false;\n        if((ptr[1] & 0x18) == 0x18 && (ptr[1] & 0x06) == 0x04 && abl2[ptr[2] >> 4] & (1 << (ptr[3] >> 6))) return false;\n        return (ptr[3] & 3) != 2;\n    }\n\n    static mp3_format lame_2_header(const mp3data_struct& mp3data) {\n        mp3_format fmt;\n        fmt.bitrate = mp3data.bitrate;\n        fmt.channels = mp3data.stereo;\n        fmt.samplerate = mp3data.samplerate;\n        fmt.duration = mp3data.totalframes \/ mp3data.samplerate;\n        fmt.total_frames = mp3data.totalframes;\n        return fmt;\n    }\n\nprivate:\n    std::string filename_;\n    bool header_parsed_;\n    size_t file_size_;\n    size_t processed_;  \/\/ Debug var for mp3 drop-out\n    size_t frame_size_;\n    ring_buffer<short> output_buffer_;\n    ring_buffer<byte> input_buffer_;\n    mp3_format header_;\n    std::ifstream file_;\n    lame_t lame_;\n    hip_t hip_;\n    mp3data_struct mp3data_;\n};\n\n#endif \/\/SIMPLE_MP3_MP3_STREAM_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: scriptedtext.hxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: vg $ $Date: 2004-01-06 19:20: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 _SVTOOLS_SCRIPTEDTEXT_HXX\n#define _SVTOOLS_SCRIPTEDTEXT_HXX\n\n#ifndef _SV_GEN_HXX\n#include <tools\/gen.hxx>\n#endif\n#ifndef _COM_SUN_STAR_I18N_XBREAKITERATOR_HPP_\n#include <com\/sun\/star\/i18n\/XBreakIterator.hpp>\n#endif\n\n\nnamespace rtl { class OUString; }\nclass OutputDevice;\nclass Font;\nclass SvtScriptedTextHelper_Impl;\n\n\n\/\/_____________________________________________________________________________\n\n\/**\nThis class provides drawing text with different script types on any output devices.\n*\/\nclass SvtScriptedTextHelper\n{\nprivate:\n    SvtScriptedTextHelper_Impl* mpImpl;             \/\/\/ Implementation of class functionality.\n\n                                \/** Assignment operator not implemented to prevent usage. *\/\n    SvtScriptedTextHelper&      operator=( const SvtScriptedTextHelper& );\n\npublic:\n                                \/** Constructor sets an output device and no fonts.\n                                    @param  _rOutDevice\n                                    A reference to an output device. *\/\n                                SvtScriptedTextHelper( OutputDevice& _rOutDevice );\n\n                                \/** Constructor sets an output device and fonts for all script types.\n                                    @param  _rOutDevice\n                                    A reference to an output device.\n                                    @param  _pLatinFont\n                                    The font for latin characters.\n                                    @param  _pAsianFont\n                                    The font for asian characters.\n                                    @param  _pCmplxFont\n                                    The font for complex text layout. *\/\n                                SvtScriptedTextHelper(\n                                    OutputDevice& _rOutDevice,\n                                    Font* _pLatinFont,\n                                    Font* _pAsianFont,\n                                    Font* _pCmplxFont );\n\n                                \/** Copy constructor. *\/\n                                SvtScriptedTextHelper(\n                                    const SvtScriptedTextHelper& _rCopy );\n\n                                \/** Destructor. *\/\n    virtual                     ~SvtScriptedTextHelper();\n\n                                \/** Sets new fonts and recalculates the text width.\n                                    @param  _pLatinFont\n                                    The font for latin characters.\n                                    @param  _pAsianFont\n                                    The font for asian characters.\n                                    @param  _pCmplxFont\n                                    The font for complex text layout. *\/\n    void                        SetFonts( Font* _pLatinFont, Font* _pAsianFont, Font* _pCmplxFont );\n\n                                \/** Sets the default font of the current output device to all script types. *\/\n    void                        SetDefaultFont();\n\n                                \/** Sets a new text and calculates all script breaks and the text width.\n                                    @param  _rText\n                                    The new text.\n                                    @param  _xBreakIter\n                                    The break iterator for iterating through the script portions. *\/\n    void                        SetText(\n                                    const ::rtl::OUString& _rText,\n                                    const ::com::sun::star::uno::Reference< ::com::sun::star::i18n::XBreakIterator >& _xBreakIter );\n\n                                \/** Returns the previously set text.\n                                    @return  The current text. *\/\n    const ::rtl::OUString&      GetText() const;\n\n                                \/** Returns the calculated width the text will take in the current output device.\n                                    @return  The calculated text width. *\/\n    sal_Int32                   GetTextWidth() const;\n\n                                \/** Returns the maximum height the text will take in the current output device.\n                                    @return  The maximum text height. *\/\n    sal_Int32                   GetTextHeight() const;\n\n                                \/** Returns a size struct containing the width and height of the text in the current output device.\n                                    @return  A size struct with the text dimensions. *\/\n    const Size&                 GetTextSize() const;\n\n                                \/** Draws the text in the current output device.\n                                    @param _rPos\n                                    The position of the top left edge of the text. *\/\n    void                        DrawText( const Point& _rPos );\n};\n\n\/\/_____________________________________________________________________________\n\n#endif\n\n<commit_msg>INTEGRATION: CWS visibility03 (1.2.482); FILE MERGED 2005\/03\/24 14:13:57 mhu 1.2.482.1: #i45006# Include svtools\/(svl|svt)dllapi.h, declare symbol visibility with (SVL|SVT)_DLL(PUBLIC|PRIVATE) as appropriate; partial cleanup.<commit_after>\/*************************************************************************\n *\n *  $RCSfile: scriptedtext.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: obo $ $Date: 2005-04-13 10:30:15 $\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 _SVTOOLS_SCRIPTEDTEXT_HXX\n#define _SVTOOLS_SCRIPTEDTEXT_HXX\n\n#ifndef INCLUDED_SVTDLLAPI_H\n#include \"svtools\/svtdllapi.h\"\n#endif\n\n#ifndef _SV_GEN_HXX\n#include <tools\/gen.hxx>\n#endif\n#ifndef _COM_SUN_STAR_I18N_XBREAKITERATOR_HPP_\n#include <com\/sun\/star\/i18n\/XBreakIterator.hpp>\n#endif\n\n\nnamespace rtl { class OUString; }\nclass OutputDevice;\nclass Font;\nclass SvtScriptedTextHelper_Impl;\n\n\n\/\/_____________________________________________________________________________\n\n\/**\nThis class provides drawing text with different script types on any output devices.\n*\/\nclass SVT_DLLPUBLIC SvtScriptedTextHelper\n{\nprivate:\n    SvtScriptedTextHelper_Impl* mpImpl;             \/\/\/ Implementation of class functionality.\n\n                                \/** Assignment operator not implemented to prevent usage. *\/\n    SvtScriptedTextHelper&      operator=( const SvtScriptedTextHelper& );\n\npublic:\n                                \/** Constructor sets an output device and no fonts.\n                                    @param  _rOutDevice\n                                    A reference to an output device. *\/\n                                SvtScriptedTextHelper( OutputDevice& _rOutDevice );\n\n                                \/** Constructor sets an output device and fonts for all script types.\n                                    @param  _rOutDevice\n                                    A reference to an output device.\n                                    @param  _pLatinFont\n                                    The font for latin characters.\n                                    @param  _pAsianFont\n                                    The font for asian characters.\n                                    @param  _pCmplxFont\n                                    The font for complex text layout. *\/\n                                SvtScriptedTextHelper(\n                                    OutputDevice& _rOutDevice,\n                                    Font* _pLatinFont,\n                                    Font* _pAsianFont,\n                                    Font* _pCmplxFont );\n\n                                \/** Copy constructor. *\/\n                                SvtScriptedTextHelper(\n                                    const SvtScriptedTextHelper& _rCopy );\n\n                                \/** Destructor. *\/\n    virtual                     ~SvtScriptedTextHelper();\n\n                                \/** Sets new fonts and recalculates the text width.\n                                    @param  _pLatinFont\n                                    The font for latin characters.\n                                    @param  _pAsianFont\n                                    The font for asian characters.\n                                    @param  _pCmplxFont\n                                    The font for complex text layout. *\/\n    void                        SetFonts( Font* _pLatinFont, Font* _pAsianFont, Font* _pCmplxFont );\n\n                                \/** Sets the default font of the current output device to all script types. *\/\n    void                        SetDefaultFont();\n\n                                \/** Sets a new text and calculates all script breaks and the text width.\n                                    @param  _rText\n                                    The new text.\n                                    @param  _xBreakIter\n                                    The break iterator for iterating through the script portions. *\/\n    void                        SetText(\n                                    const ::rtl::OUString& _rText,\n                                    const ::com::sun::star::uno::Reference< ::com::sun::star::i18n::XBreakIterator >& _xBreakIter );\n\n                                \/** Returns the previously set text.\n                                    @return  The current text. *\/\n    const ::rtl::OUString&      GetText() const;\n\n                                \/** Returns the calculated width the text will take in the current output device.\n                                    @return  The calculated text width. *\/\n    sal_Int32                   GetTextWidth() const;\n\n                                \/** Returns the maximum height the text will take in the current output device.\n                                    @return  The maximum text height. *\/\n    sal_Int32                   GetTextHeight() const;\n\n                                \/** Returns a size struct containing the width and height of the text in the current output device.\n                                    @return  A size struct with the text dimensions. *\/\n    const Size&                 GetTextSize() const;\n\n                                \/** Draws the text in the current output device.\n                                    @param _rPos\n                                    The position of the top left edge of the text. *\/\n    void                        DrawText( const Point& _rPos );\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: xmlexport.cxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 01:15: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#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_XML_SAX_INPUTSOURCE_HPP_\n#include <com\/sun\/star\/xml\/sax\/InputSource.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_XML_SAX_XPARSER_HPP_\n#include <com\/sun\/star\/xml\/sax\/XParser.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_XMULTISERVICEFACTORY_HPP_\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_XML_SAX_XDOCUMENTHANDLER_HPP_\n#include <com\/sun\/star\/xml\/sax\/XDocumentHandler.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_XCOMPONENT_HPP_\n#include <com\/sun\/star\/lang\/XComponent.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_IO_XACTIVEDATASOURCE_HPP_\n#include <com\/sun\/star\/io\/XActiveDataSource.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_XML_SAX_SAXPARSEEXCEPTION_HPP_\n#include <com\/sun\/star\/xml\/sax\/SAXParseException.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_IO_XOUTPUTSTREAM_HPP_\n#include <com\/sun\/star\/io\/XOutputStream.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_DOCUMENT_XFILTER_HPP_\n#include <com\/sun\/star\/document\/XFilter.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_DOCUMENT_XEXPORTER_HPP_\n#include <com\/sun\/star\/document\/XExporter.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_DOCUMENT_XIMPORTER_HPP_\n#include <com\/sun\/star\/document\/XImporter.hpp>\n#endif\n\n#ifndef _COMPHELPER_PROCESSFACTORY_HXX_\n#include <comphelper\/processfactory.hxx>\n#endif\n\n#ifndef _UTL_STREAM_WRAPPER_HXX_\n#include <unotools\/streamwrap.hxx>\n#endif\n\n#ifndef _SOT_STORAGE_HXX\n#include <sot\/storage.hxx>\n#endif\n\n#ifndef _SVDMODEL_HXX\n#include <svdmodel.hxx>\n#endif\n\n#ifndef _XMLEOHLP_HXX\n#include <xmleohlp.hxx>\n#endif\n#ifndef _XMLGRHLP_HXX\n#include <xmlgrhlp.hxx>\n#endif\n\n#include \"unomodel.hxx\"\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\n\nsal_Bool SvxDrawingLayerExport( SdrModel* pModel, uno::Reference<io::XOutputStream> xOut, Reference< lang::XComponent > xComponent )\n{\n    return SvxDrawingLayerExport( pModel, xOut, xComponent, \"com.sun.star.comp.DrawingLayer.XMLExporter\" );\n}\n\nsal_Bool SvxDrawingLayerExport( SdrModel* pModel, uno::Reference<io::XOutputStream> xOut, Reference< lang::XComponent > xComponent, const char* pExportService )\n{\n    sal_Bool bDocRet = xOut.is();\n\n    Reference< document::XGraphicObjectResolver > xGraphicResolver;\n    SvXMLGraphicHelper *pGraphicHelper = 0;\n\n    Reference< document::XEmbeddedObjectResolver > xObjectResolver;\n    SvXMLEmbeddedObjectHelper *pObjectHelper = 0;\n\n    try\n    {\n        if( !xComponent.is() )\n        {\n            xComponent = new SvxUnoDrawingModel( pModel );\n            pModel->setUnoModel( Reference< XInterface >::query( xComponent ) );\n        }\n\n        uno::Reference< lang::XMultiServiceFactory> xServiceFactory( ::comphelper::getProcessServiceFactory() );\n        if( !xServiceFactory.is() )\n        {\n            DBG_ERROR( \"got no service manager\" );\n            bDocRet = sal_False;\n        }\n\n        if( bDocRet )\n        {\n            uno::Reference< uno::XInterface > xWriter( xServiceFactory->createInstance( OUString( RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.xml.sax.Writer\" ) ) ) );\n            if( !xWriter.is() )\n            {\n                DBG_ERROR( \"com.sun.star.xml.sax.Writer service missing\" );\n                bDocRet = sal_False;\n            }\n\n            SfxObjectShell *pPersist = pModel->GetPersist();\n            if( pPersist )\n            {\n                pObjectHelper = SvXMLEmbeddedObjectHelper::Create( *pPersist, EMBEDDEDOBJECTHELPER_MODE_WRITE );\n                xObjectResolver = pObjectHelper;\n            }\n\n            pGraphicHelper = SvXMLGraphicHelper::Create( GRAPHICHELPER_MODE_WRITE );\n            xGraphicResolver = pGraphicHelper;\n\n            if( bDocRet )\n            {\n                uno::Reference<xml::sax::XDocumentHandler>  xHandler( xWriter, uno::UNO_QUERY );\n\n                \/\/ doc export\n                uno::Reference< io::XActiveDataSource > xDocSrc( xWriter, uno::UNO_QUERY );\n                xDocSrc->setOutputStream( xOut );\n\n                uno::Sequence< uno::Any > aArgs( xObjectResolver.is() ? 3 : 2 );\n                aArgs[0] <<= xHandler;\n                aArgs[1] <<= xGraphicResolver;\n                if( xObjectResolver.is() )\n                    aArgs[2] <<= xObjectResolver;\n\n                uno::Reference< document::XFilter > xFilter( xServiceFactory->createInstanceWithArguments( OUString::createFromAscii( pExportService ), aArgs ), uno::UNO_QUERY );\n                if( !xFilter.is() )\n                {\n                    DBG_ERROR( \"com.sun.star.comp.Draw.XMLExporter service missing\" );\n                    bDocRet = sal_False;\n                }\n\n                if( bDocRet )\n                {\n                    uno::Reference< document::XExporter > xExporter( xFilter, uno::UNO_QUERY );\n                    if( xExporter.is() )\n                    {\n                        xExporter->setSourceDocument( xComponent );\n\n                        uno::Sequence< beans::PropertyValue > aDescriptor( 0 );\n                        bDocRet = xFilter->filter( aDescriptor );\n                    }\n                }\n            }\n        }\n    }\n    catch(uno::Exception e)\n    {\n#if OSL_DEBUG_LEVEL > 1\n        ByteString aError( \"uno Exception caught while exporting:\\n\" );\n        aError += ByteString( String( e.Message), RTL_TEXTENCODING_ASCII_US );\n        DBG_ERROR( aError.GetBuffer() );\n#endif\n        bDocRet = sal_False;\n    }\n\n    if( pGraphicHelper )\n        SvXMLGraphicHelper::Destroy( pGraphicHelper );\n    xGraphicResolver = 0;\n\n    if( pObjectHelper )\n        SvXMLEmbeddedObjectHelper::Destroy( pObjectHelper );\n    xObjectResolver = 0;\n\n    return bDocRet;\n}\n\nsal_Bool SvxDrawingLayerExport( SdrModel* pModel, uno::Reference<io::XOutputStream> xOut )\n{\n    Reference< lang::XComponent > xComponent;\n    return SvxDrawingLayerExport( pModel, xOut, xComponent );\n}\n\n\/\/-\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nsal_Bool SvxDrawingLayerImport( SdrModel* pModel, uno::Reference<io::XInputStream> xInputStream, Reference< lang::XComponent > xComponent )\n{\n    return SvxDrawingLayerImport( pModel, xInputStream, xComponent, \"com.sun.star.comp.Draw.XMLOasisImporter\" );\n}\n\nsal_Bool SvxDrawingLayerImport( SdrModel* pModel, uno::Reference<io::XInputStream> xInputStream, Reference< lang::XComponent > xComponent, const char* pImportService  )\n{\n    sal_uInt32  nRet = 0;\n\n    Reference< document::XGraphicObjectResolver > xGraphicResolver;\n    SvXMLGraphicHelper *pGraphicHelper = 0;\n\n    Reference< document::XEmbeddedObjectResolver > xObjectResolver;\n    SvXMLEmbeddedObjectHelper *pObjectHelper = 0;\n\n    if( !xComponent.is() )\n    {\n        xComponent = new SvxUnoDrawingModel( pModel );\n        pModel->setUnoModel( Reference< XInterface >::query( xComponent ) );\n    }\n\n    Reference< frame::XModel > xModel( xComponent, UNO_QUERY );\n\n    try\n    {\n        \/\/ Get service factory\n        Reference< lang::XMultiServiceFactory > xServiceFactory = comphelper::getProcessServiceFactory();\n        DBG_ASSERT( xServiceFactory.is(), \"XMLReader::Read: got no service manager\" );\n\n        if( !xServiceFactory.is() )\n            nRet = 1;\n\n        if( 0 == nRet )\n        {\n            xModel->lockControllers();\n\n            \/\/ -------------------------------------\n\n            pGraphicHelper = SvXMLGraphicHelper::Create( GRAPHICHELPER_MODE_READ );\n            xGraphicResolver = pGraphicHelper;\n\n            SfxObjectShell *pPersist = pModel->GetPersist();\n            if( pPersist )\n            {\n                pObjectHelper = SvXMLEmbeddedObjectHelper::Create(\n                                            *pPersist,\n                                            EMBEDDEDOBJECTHELPER_MODE_READ );\n                xObjectResolver = pObjectHelper;\n            }\n        }\n\n        \/\/ -------------------------------------\n\n        if( 0 == nRet )\n        {\n\n            \/\/ parse\n            \/\/ prepare ParserInputSrouce\n            xml::sax::InputSource aParserInput;\n            aParserInput.aInputStream = xInputStream;\n\n            \/\/ get parser\n            Reference< xml::sax::XParser > xParser( xServiceFactory->createInstance( OUString::createFromAscii(\"com.sun.star.xml.sax.Parser\") ), UNO_QUERY );\n            DBG_ASSERT( xParser.is(), \"Can't create parser\" );\n\n            \/\/ prepare filter arguments\n            Sequence<Any> aFilterArgs( 2 );\n            Any *pArgs = aFilterArgs.getArray();\n            *pArgs++ <<= xGraphicResolver;\n            *pArgs++ <<= xObjectResolver;\n\n            \/\/ get filter\n            Reference< xml::sax::XDocumentHandler > xFilter( xServiceFactory->createInstanceWithArguments( OUString::createFromAscii( pImportService ), aFilterArgs), UNO_QUERY );\n            DBG_ASSERT( xFilter.is(), \"Can't instantiate filter component.\" );\n\n            if( !xParser.is() || !xFilter.is() )\n            {\n                nRet = 1;\n            }\n            else\n            {\n                \/\/ connect parser and filter\n                xParser->setDocumentHandler( xFilter );\n\n                \/\/ connect model and filter\n                uno::Reference < document::XImporter > xImporter( xFilter, UNO_QUERY );\n                xImporter->setTargetDocument( xComponent );\n\n                \/\/ finally, parser the stream\n                xParser->parseStream( aParserInput );\n            }\n        }\n    }\n    catch( xml::sax::SAXParseException& r )\n    {\n#if OSL_DEBUG_LEVEL > 1\n        ByteString aError( \"SAX parse exception catched while importing:\\n\" );\n        aError += ByteString( String( r.Message), RTL_TEXTENCODING_ASCII_US );\n        DBG_ERROR( aError.GetBuffer() );\n#endif\n    }\n    catch( xml::sax::SAXException& r )\n    {\n#if OSL_DEBUG_LEVEL > 1\n        ByteString aError( \"SAX exception catched while importing:\\n\" );\n        aError += ByteString( String( r.Message), RTL_TEXTENCODING_ASCII_US );\n        DBG_ERROR( aError.GetBuffer() );\n#endif\n    }\n    catch( io::IOException& r )\n    {\n#if OSL_DEBUG_LEVEL > 1\n        ByteString aError( \"IO exception catched while importing:\\n\" );\n        aError += ByteString( String( r.Message), RTL_TEXTENCODING_ASCII_US );\n        DBG_ERROR( aError.GetBuffer() );\n#endif\n    }\n    catch( uno::Exception& r )\n    {\n#if OSL_DEBUG_LEVEL > 1\n        ByteString aError( \"uno exception catched while importing:\\n\" );\n        aError += ByteString( String( r.Message), RTL_TEXTENCODING_ASCII_US );\n        DBG_ERROR( aError.GetBuffer() );\n#endif\n    }\n\n    if( pGraphicHelper )\n        SvXMLGraphicHelper::Destroy( pGraphicHelper );\n    xGraphicResolver = 0;\n\n    if( pObjectHelper )\n        SvXMLEmbeddedObjectHelper::Destroy( pObjectHelper );\n    xObjectResolver = 0;\n\n    if( xModel.is() )\n        xModel->unlockControllers();\n\n    return nRet == 0;\n}\n\nsal_Bool SvxDrawingLayerImport( SdrModel* pModel, uno::Reference<io::XInputStream> xInputStream )\n{\n    Reference< lang::XComponent > xComponent;\n    return SvxDrawingLayerImport( pModel, xInputStream, xComponent );\n}\n<commit_msg>INTEGRATION: CWS pchfix02 (1.8.536); FILE MERGED 2006\/09\/01 17:47:44 kaib 1.8.536.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: xmlexport.cxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 06:20:12 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_svx.hxx\"\n\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_XML_SAX_INPUTSOURCE_HPP_\n#include <com\/sun\/star\/xml\/sax\/InputSource.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_XML_SAX_XPARSER_HPP_\n#include <com\/sun\/star\/xml\/sax\/XParser.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_XMULTISERVICEFACTORY_HPP_\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_XML_SAX_XDOCUMENTHANDLER_HPP_\n#include <com\/sun\/star\/xml\/sax\/XDocumentHandler.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_XCOMPONENT_HPP_\n#include <com\/sun\/star\/lang\/XComponent.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_IO_XACTIVEDATASOURCE_HPP_\n#include <com\/sun\/star\/io\/XActiveDataSource.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_XML_SAX_SAXPARSEEXCEPTION_HPP_\n#include <com\/sun\/star\/xml\/sax\/SAXParseException.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_IO_XOUTPUTSTREAM_HPP_\n#include <com\/sun\/star\/io\/XOutputStream.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_DOCUMENT_XFILTER_HPP_\n#include <com\/sun\/star\/document\/XFilter.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_DOCUMENT_XEXPORTER_HPP_\n#include <com\/sun\/star\/document\/XExporter.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_DOCUMENT_XIMPORTER_HPP_\n#include <com\/sun\/star\/document\/XImporter.hpp>\n#endif\n\n#ifndef _COMPHELPER_PROCESSFACTORY_HXX_\n#include <comphelper\/processfactory.hxx>\n#endif\n\n#ifndef _UTL_STREAM_WRAPPER_HXX_\n#include <unotools\/streamwrap.hxx>\n#endif\n\n#ifndef _SOT_STORAGE_HXX\n#include <sot\/storage.hxx>\n#endif\n\n#ifndef _SVDMODEL_HXX\n#include <svdmodel.hxx>\n#endif\n\n#ifndef _XMLEOHLP_HXX\n#include <xmleohlp.hxx>\n#endif\n#ifndef _XMLGRHLP_HXX\n#include <xmlgrhlp.hxx>\n#endif\n\n#include \"unomodel.hxx\"\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\n\nsal_Bool SvxDrawingLayerExport( SdrModel* pModel, uno::Reference<io::XOutputStream> xOut, Reference< lang::XComponent > xComponent )\n{\n    return SvxDrawingLayerExport( pModel, xOut, xComponent, \"com.sun.star.comp.DrawingLayer.XMLExporter\" );\n}\n\nsal_Bool SvxDrawingLayerExport( SdrModel* pModel, uno::Reference<io::XOutputStream> xOut, Reference< lang::XComponent > xComponent, const char* pExportService )\n{\n    sal_Bool bDocRet = xOut.is();\n\n    Reference< document::XGraphicObjectResolver > xGraphicResolver;\n    SvXMLGraphicHelper *pGraphicHelper = 0;\n\n    Reference< document::XEmbeddedObjectResolver > xObjectResolver;\n    SvXMLEmbeddedObjectHelper *pObjectHelper = 0;\n\n    try\n    {\n        if( !xComponent.is() )\n        {\n            xComponent = new SvxUnoDrawingModel( pModel );\n            pModel->setUnoModel( Reference< XInterface >::query( xComponent ) );\n        }\n\n        uno::Reference< lang::XMultiServiceFactory> xServiceFactory( ::comphelper::getProcessServiceFactory() );\n        if( !xServiceFactory.is() )\n        {\n            DBG_ERROR( \"got no service manager\" );\n            bDocRet = sal_False;\n        }\n\n        if( bDocRet )\n        {\n            uno::Reference< uno::XInterface > xWriter( xServiceFactory->createInstance( OUString( RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.xml.sax.Writer\" ) ) ) );\n            if( !xWriter.is() )\n            {\n                DBG_ERROR( \"com.sun.star.xml.sax.Writer service missing\" );\n                bDocRet = sal_False;\n            }\n\n            SfxObjectShell *pPersist = pModel->GetPersist();\n            if( pPersist )\n            {\n                pObjectHelper = SvXMLEmbeddedObjectHelper::Create( *pPersist, EMBEDDEDOBJECTHELPER_MODE_WRITE );\n                xObjectResolver = pObjectHelper;\n            }\n\n            pGraphicHelper = SvXMLGraphicHelper::Create( GRAPHICHELPER_MODE_WRITE );\n            xGraphicResolver = pGraphicHelper;\n\n            if( bDocRet )\n            {\n                uno::Reference<xml::sax::XDocumentHandler>  xHandler( xWriter, uno::UNO_QUERY );\n\n                \/\/ doc export\n                uno::Reference< io::XActiveDataSource > xDocSrc( xWriter, uno::UNO_QUERY );\n                xDocSrc->setOutputStream( xOut );\n\n                uno::Sequence< uno::Any > aArgs( xObjectResolver.is() ? 3 : 2 );\n                aArgs[0] <<= xHandler;\n                aArgs[1] <<= xGraphicResolver;\n                if( xObjectResolver.is() )\n                    aArgs[2] <<= xObjectResolver;\n\n                uno::Reference< document::XFilter > xFilter( xServiceFactory->createInstanceWithArguments( OUString::createFromAscii( pExportService ), aArgs ), uno::UNO_QUERY );\n                if( !xFilter.is() )\n                {\n                    DBG_ERROR( \"com.sun.star.comp.Draw.XMLExporter service missing\" );\n                    bDocRet = sal_False;\n                }\n\n                if( bDocRet )\n                {\n                    uno::Reference< document::XExporter > xExporter( xFilter, uno::UNO_QUERY );\n                    if( xExporter.is() )\n                    {\n                        xExporter->setSourceDocument( xComponent );\n\n                        uno::Sequence< beans::PropertyValue > aDescriptor( 0 );\n                        bDocRet = xFilter->filter( aDescriptor );\n                    }\n                }\n            }\n        }\n    }\n    catch(uno::Exception e)\n    {\n#if OSL_DEBUG_LEVEL > 1\n        ByteString aError( \"uno Exception caught while exporting:\\n\" );\n        aError += ByteString( String( e.Message), RTL_TEXTENCODING_ASCII_US );\n        DBG_ERROR( aError.GetBuffer() );\n#endif\n        bDocRet = sal_False;\n    }\n\n    if( pGraphicHelper )\n        SvXMLGraphicHelper::Destroy( pGraphicHelper );\n    xGraphicResolver = 0;\n\n    if( pObjectHelper )\n        SvXMLEmbeddedObjectHelper::Destroy( pObjectHelper );\n    xObjectResolver = 0;\n\n    return bDocRet;\n}\n\nsal_Bool SvxDrawingLayerExport( SdrModel* pModel, uno::Reference<io::XOutputStream> xOut )\n{\n    Reference< lang::XComponent > xComponent;\n    return SvxDrawingLayerExport( pModel, xOut, xComponent );\n}\n\n\/\/-\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nsal_Bool SvxDrawingLayerImport( SdrModel* pModel, uno::Reference<io::XInputStream> xInputStream, Reference< lang::XComponent > xComponent )\n{\n    return SvxDrawingLayerImport( pModel, xInputStream, xComponent, \"com.sun.star.comp.Draw.XMLOasisImporter\" );\n}\n\nsal_Bool SvxDrawingLayerImport( SdrModel* pModel, uno::Reference<io::XInputStream> xInputStream, Reference< lang::XComponent > xComponent, const char* pImportService  )\n{\n    sal_uInt32  nRet = 0;\n\n    Reference< document::XGraphicObjectResolver > xGraphicResolver;\n    SvXMLGraphicHelper *pGraphicHelper = 0;\n\n    Reference< document::XEmbeddedObjectResolver > xObjectResolver;\n    SvXMLEmbeddedObjectHelper *pObjectHelper = 0;\n\n    if( !xComponent.is() )\n    {\n        xComponent = new SvxUnoDrawingModel( pModel );\n        pModel->setUnoModel( Reference< XInterface >::query( xComponent ) );\n    }\n\n    Reference< frame::XModel > xModel( xComponent, UNO_QUERY );\n\n    try\n    {\n        \/\/ Get service factory\n        Reference< lang::XMultiServiceFactory > xServiceFactory = comphelper::getProcessServiceFactory();\n        DBG_ASSERT( xServiceFactory.is(), \"XMLReader::Read: got no service manager\" );\n\n        if( !xServiceFactory.is() )\n            nRet = 1;\n\n        if( 0 == nRet )\n        {\n            xModel->lockControllers();\n\n            \/\/ -------------------------------------\n\n            pGraphicHelper = SvXMLGraphicHelper::Create( GRAPHICHELPER_MODE_READ );\n            xGraphicResolver = pGraphicHelper;\n\n            SfxObjectShell *pPersist = pModel->GetPersist();\n            if( pPersist )\n            {\n                pObjectHelper = SvXMLEmbeddedObjectHelper::Create(\n                                            *pPersist,\n                                            EMBEDDEDOBJECTHELPER_MODE_READ );\n                xObjectResolver = pObjectHelper;\n            }\n        }\n\n        \/\/ -------------------------------------\n\n        if( 0 == nRet )\n        {\n\n            \/\/ parse\n            \/\/ prepare ParserInputSrouce\n            xml::sax::InputSource aParserInput;\n            aParserInput.aInputStream = xInputStream;\n\n            \/\/ get parser\n            Reference< xml::sax::XParser > xParser( xServiceFactory->createInstance( OUString::createFromAscii(\"com.sun.star.xml.sax.Parser\") ), UNO_QUERY );\n            DBG_ASSERT( xParser.is(), \"Can't create parser\" );\n\n            \/\/ prepare filter arguments\n            Sequence<Any> aFilterArgs( 2 );\n            Any *pArgs = aFilterArgs.getArray();\n            *pArgs++ <<= xGraphicResolver;\n            *pArgs++ <<= xObjectResolver;\n\n            \/\/ get filter\n            Reference< xml::sax::XDocumentHandler > xFilter( xServiceFactory->createInstanceWithArguments( OUString::createFromAscii( pImportService ), aFilterArgs), UNO_QUERY );\n            DBG_ASSERT( xFilter.is(), \"Can't instantiate filter component.\" );\n\n            if( !xParser.is() || !xFilter.is() )\n            {\n                nRet = 1;\n            }\n            else\n            {\n                \/\/ connect parser and filter\n                xParser->setDocumentHandler( xFilter );\n\n                \/\/ connect model and filter\n                uno::Reference < document::XImporter > xImporter( xFilter, UNO_QUERY );\n                xImporter->setTargetDocument( xComponent );\n\n                \/\/ finally, parser the stream\n                xParser->parseStream( aParserInput );\n            }\n        }\n    }\n    catch( xml::sax::SAXParseException& r )\n    {\n#if OSL_DEBUG_LEVEL > 1\n        ByteString aError( \"SAX parse exception catched while importing:\\n\" );\n        aError += ByteString( String( r.Message), RTL_TEXTENCODING_ASCII_US );\n        DBG_ERROR( aError.GetBuffer() );\n#endif\n    }\n    catch( xml::sax::SAXException& r )\n    {\n#if OSL_DEBUG_LEVEL > 1\n        ByteString aError( \"SAX exception catched while importing:\\n\" );\n        aError += ByteString( String( r.Message), RTL_TEXTENCODING_ASCII_US );\n        DBG_ERROR( aError.GetBuffer() );\n#endif\n    }\n    catch( io::IOException& r )\n    {\n#if OSL_DEBUG_LEVEL > 1\n        ByteString aError( \"IO exception catched while importing:\\n\" );\n        aError += ByteString( String( r.Message), RTL_TEXTENCODING_ASCII_US );\n        DBG_ERROR( aError.GetBuffer() );\n#endif\n    }\n    catch( uno::Exception& r )\n    {\n#if OSL_DEBUG_LEVEL > 1\n        ByteString aError( \"uno exception catched while importing:\\n\" );\n        aError += ByteString( String( r.Message), RTL_TEXTENCODING_ASCII_US );\n        DBG_ERROR( aError.GetBuffer() );\n#endif\n    }\n\n    if( pGraphicHelper )\n        SvXMLGraphicHelper::Destroy( pGraphicHelper );\n    xGraphicResolver = 0;\n\n    if( pObjectHelper )\n        SvXMLEmbeddedObjectHelper::Destroy( pObjectHelper );\n    xObjectResolver = 0;\n\n    if( xModel.is() )\n        xModel->unlockControllers();\n\n    return nRet == 0;\n}\n\nsal_Bool SvxDrawingLayerImport( SdrModel* pModel, uno::Reference<io::XInputStream> xInputStream )\n{\n    Reference< lang::XComponent > xComponent;\n    return SvxDrawingLayerImport( pModel, xInputStream, xComponent );\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: conrect.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: aw $ $Date: 2001-10-22 17:04:43 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _SW_CONRECT_HXX\n#define _SW_CONRECT_HXX\n\n#include \"drawbase.hxx\"\n\n\/*************************************************************************\n|*\n|* Rechteck zeichnen\n|*\n\\************************************************************************\/\n\nclass ConstRectangle : public SwDrawBase\n{\n    BOOL bMarquee;\n    BOOL bCapVertical;\n\n    \/\/ #93382#\n    sal_Bool                    mbVertical;\n\n public:\n    ConstRectangle(SwWrtShell* pSh, SwEditWin* pWin, SwView* pView);\n\n                                       \/\/ Mouse- & Key-Events\n    virtual BOOL MouseButtonUp(const MouseEvent& rMEvt);\n    virtual BOOL MouseButtonDown(const MouseEvent& rMEvt);\n\n    virtual void Activate(const USHORT nSlotId);    \/\/ Function aktivieren\n};\n\n\n\n#endif      \/\/ _SW_CONRECT_HXX\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.3.1438); FILE MERGED 2005\/09\/05 13:45:03 rt 1.3.1438.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: conrect.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 09:07: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 _SW_CONRECT_HXX\n#define _SW_CONRECT_HXX\n\n#include \"drawbase.hxx\"\n\n\/*************************************************************************\n|*\n|* Rechteck zeichnen\n|*\n\\************************************************************************\/\n\nclass ConstRectangle : public SwDrawBase\n{\n    BOOL bMarquee;\n    BOOL bCapVertical;\n\n    \/\/ #93382#\n    sal_Bool                    mbVertical;\n\n public:\n    ConstRectangle(SwWrtShell* pSh, SwEditWin* pWin, SwView* pView);\n\n                                       \/\/ Mouse- & Key-Events\n    virtual BOOL MouseButtonUp(const MouseEvent& rMEvt);\n    virtual BOOL MouseButtonDown(const MouseEvent& rMEvt);\n\n    virtual void Activate(const USHORT nSlotId);    \/\/ Function aktivieren\n};\n\n\n\n#endif      \/\/ _SW_CONRECT_HXX\n\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright 2017 R. Thomas\n * Copyright 2017 Quarkslab\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 \"LIEF\/BinaryStream\/BinaryStream.hpp\"\n#include \"LIEF\/utils.hpp\"\n#include \"LIEF\/utf8\/checked.h\"\n#include <iomanip>\n#include <sstream>\n#include <iostream>\n\nBinaryStream::~BinaryStream(void) = default;\nBinaryStream::BinaryStream(void) = default;\n\nvoid BinaryStream::setpos(size_t pos) const {\n  this->pos_ = pos;\n}\n\nvoid BinaryStream::increment_pos(size_t value) const {\n  this->pos_ += value;\n}\n\n\nBinaryStream::operator bool() const {\n  return this->pos_ < this->size();\n}\n\nsize_t BinaryStream::pos(void) const {\n  return this->pos_;\n}\n\n\n\nuint64_t BinaryStream::read_uleb128(void) const {\n  uint64_t value = 0;\n  unsigned shift = 0;\n  uint8_t byte_read;\n  do {\n    byte_read = this->read<uint8_t>();\n    value += static_cast<uint64_t>(byte_read & 0x7f) << shift;\n    shift += 7;\n  } while (byte_read >= 128);\n\n  return value;\n}\n\nuint64_t BinaryStream::read_sleb128(void) const {\n  int64_t  value = 0;\n  unsigned shift = 0;\n  uint8_t byte_read;\n  do {\n    byte_read = this->read<uint8_t>();\n    value += static_cast<uint64_t>(byte_read & 0x7f) << shift;\n    shift += 7;\n  } while (byte_read >= 128);\n\n\n  \/\/ Sign extend\n  if ((value & 0x40) != 0) {\n    value |= static_cast<int64_t>(-1) << shift;\n  }\n\n  return value;\n}\n\nstd::string BinaryStream::read_string(size_t maxsize) const {\n  std::string str = this->peek_string(maxsize);\n  this->increment_pos(str.size() + 1); \/\/ +1 for'\\0'\n  return str;\n}\n\nstd::string BinaryStream::peek_string(size_t maxsize) const {\n  std::string result;\n  result.reserve(10);\n  char c = '\\0';\n  size_t off = this->pos();\n\n  if (not this->can_read<char>()) {\n    return result.c_str();\n  }\n\n  size_t count = 0;\n  do {\n    c = this->peek<char>(off);\n    off += sizeof(char);\n    result.push_back(c);\n    ++count;\n  } while (count < maxsize and c != '\\0' and this->pos() < this->size());\n  result.back() = '\\0';\n  return result.c_str();\n\n}\n\nstd::string BinaryStream::peek_string_at(size_t offset, size_t maxsize) const {\n  size_t saved_offset = this->pos();\n  this->setpos(offset);\n  std::string tmp = this->peek_string(maxsize);\n  this->setpos(saved_offset);\n  return tmp;\n}\n\nstd::u16string BinaryStream::read_u16string(void) const {\n  std::u16string str = this->peek_u16string();\n  this->increment_pos((str.size() + 1) * sizeof(uint16_t)); \/\/ +1 for'\\0'\n  return str;\n}\n\nstd::u16string BinaryStream::peek_u16string(void) const {\n  std::u16string result;\n  result.reserve(10);\n  char16_t c = '\\0';\n  size_t off = this->pos();\n\n  if (not this->can_read<char16_t>()) {\n    return result;\n  }\n\n  size_t count = 0;\n  do {\n    c = this->peek<char16_t>(off);\n    off += sizeof(char16_t);\n    result.push_back(c);\n    ++count;\n  } while (c != 0 and this->pos() < this->size());\n  result.back() = '\\0';\n  return result.c_str();\n}\n\n\nstd::u16string BinaryStream::read_u16string(size_t length) const {\n  std::u16string str = this->peek_u16string(length);\n  this->increment_pos(length * sizeof(uint16_t)); \/\/ +1 for'\\0'\n  return str;\n}\n\nstd::u16string BinaryStream::peek_u16string(size_t length) const {\n  if (length == static_cast<size_t>(-1u)) {\n    return this->peek_u16string();\n  }\n  const char16_t* raw = this->peek_array<char16_t>(this->pos(), length, \/* check *\/false);\n  if (raw == nullptr) {\n    return {};\n  }\n  return {raw, length};\n}\n\nstd::u16string BinaryStream::peek_u16string_at(size_t offset, size_t length) const {\n  size_t saved_offset = this->pos();\n  this->setpos(offset);\n  std::u16string tmp = this->peek_u16string(length);\n  this->setpos(saved_offset);\n  return tmp;\n}\n\n\nsize_t BinaryStream::align(size_t align_on) const {\n  if (align_on == 0 or (this->pos() % align_on) == 0) {\n    return 0;\n  }\n  size_t padding = align_on - (this->pos() % align_on);\n  this->increment_pos(padding);\n  return padding;\n}\n\n\nstd::string BinaryStream::read_mutf8(size_t maxsize) const {\n  std::u32string u32str;\n\n  for (size_t i = 0; i < maxsize; ++i) {\n    uint8_t a = this->read<char>();\n\n    if (static_cast<uint8_t>(a) < 0x80) {\n      if (a == 0) {\n        break;\n      }\n      u32str.push_back(a);\n    } else if ((a & 0xe0) == 0xc0) {\n\n      uint8_t b = this->read<int8_t>() & 0xFF;\n\n      if ((b & 0xC0) != 0x80) {\n        break;\n      }\n      u32str.push_back(static_cast<char32_t>((((a & 0x1F) << 6) | (b & 0x3F))));\n    } else if ((a & 0xf0) == 0xe0) {\n        uint8_t b = this->read<uint8_t>() & 0xFF;\n        uint8_t c = this->read<uint8_t>() & 0xFF;\n\n        if (((b & 0xC0) != 0x80) or ((c & 0xC0) != 0x80)) {\n          break;\n        }\n        u32str.push_back(static_cast<char32_t>(((a & 0x1F) << 12) | ((b & 0x3F) << 6) | (c & 0x3F)));\n    } else {\n      break;\n    }\n  }\n\n  std::string u8str;\n  utf8::utf32to8(std::begin(u32str), std::end(u32str), std::back_inserter(u8str));\n\n  std::string u8str_clean;\n  for (size_t i = 0; i < u8str.size(); ++i) {\n    \/\/if (::isprint(u8str[i])) {\n    if (u8str[i] != -1) {\n      u8str_clean.push_back(u8str[i]);\n    } else {\n      std::stringstream ss;\n      ss << std::hex << \"\\\\x\" << std::setw(2) << std::setfill('0') << static_cast<uint32_t>(u8str[i] & 0xFF);\n      u8str_clean += ss.str();\n    }\n  }\n  return u8str_clean;\n}\n\nvoid BinaryStream::set_endian_swap(bool swap) {\n  this->endian_swap_ = swap;\n}\n\n<commit_msg>Replace unsupported code point<commit_after>\/* Copyright 2017 R. Thomas\n * Copyright 2017 Quarkslab\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 \"LIEF\/BinaryStream\/BinaryStream.hpp\"\n#include \"LIEF\/utils.hpp\"\n#include \"LIEF\/utf8\/checked.h\"\n\n#include <iomanip>\n#include <sstream>\n#include <algorithm>\n#include <iostream>\n\nBinaryStream::~BinaryStream(void) = default;\nBinaryStream::BinaryStream(void) = default;\n\nvoid BinaryStream::setpos(size_t pos) const {\n  this->pos_ = pos;\n}\n\nvoid BinaryStream::increment_pos(size_t value) const {\n  this->pos_ += value;\n}\n\n\nBinaryStream::operator bool() const {\n  return this->pos_ < this->size();\n}\n\nsize_t BinaryStream::pos(void) const {\n  return this->pos_;\n}\n\n\n\nuint64_t BinaryStream::read_uleb128(void) const {\n  uint64_t value = 0;\n  unsigned shift = 0;\n  uint8_t byte_read;\n  do {\n    byte_read = this->read<uint8_t>();\n    value += static_cast<uint64_t>(byte_read & 0x7f) << shift;\n    shift += 7;\n  } while (byte_read >= 128);\n\n  return value;\n}\n\nuint64_t BinaryStream::read_sleb128(void) const {\n  int64_t  value = 0;\n  unsigned shift = 0;\n  uint8_t byte_read;\n  do {\n    byte_read = this->read<uint8_t>();\n    value += static_cast<uint64_t>(byte_read & 0x7f) << shift;\n    shift += 7;\n  } while (byte_read >= 128);\n\n\n  \/\/ Sign extend\n  if ((value & 0x40) != 0) {\n    value |= static_cast<int64_t>(-1) << shift;\n  }\n\n  return value;\n}\n\nstd::string BinaryStream::read_string(size_t maxsize) const {\n  std::string str = this->peek_string(maxsize);\n  this->increment_pos(str.size() + 1); \/\/ +1 for'\\0'\n  return str;\n}\n\nstd::string BinaryStream::peek_string(size_t maxsize) const {\n  std::string result;\n  result.reserve(10);\n  char c = '\\0';\n  size_t off = this->pos();\n\n  if (not this->can_read<char>()) {\n    return result.c_str();\n  }\n\n  size_t count = 0;\n  do {\n    c = this->peek<char>(off);\n    off += sizeof(char);\n    result.push_back(c);\n    ++count;\n  } while (count < maxsize and c != '\\0' and this->pos() < this->size());\n  result.back() = '\\0';\n  return result.c_str();\n\n}\n\nstd::string BinaryStream::peek_string_at(size_t offset, size_t maxsize) const {\n  size_t saved_offset = this->pos();\n  this->setpos(offset);\n  std::string tmp = this->peek_string(maxsize);\n  this->setpos(saved_offset);\n  return tmp;\n}\n\nstd::u16string BinaryStream::read_u16string(void) const {\n  std::u16string str = this->peek_u16string();\n  this->increment_pos((str.size() + 1) * sizeof(uint16_t)); \/\/ +1 for'\\0'\n  return str;\n}\n\nstd::u16string BinaryStream::peek_u16string(void) const {\n  std::u16string result;\n  result.reserve(10);\n  char16_t c = '\\0';\n  size_t off = this->pos();\n\n  if (not this->can_read<char16_t>()) {\n    return result;\n  }\n\n  size_t count = 0;\n  do {\n    c = this->peek<char16_t>(off);\n    off += sizeof(char16_t);\n    result.push_back(c);\n    ++count;\n  } while (c != 0 and this->pos() < this->size());\n  result.back() = '\\0';\n  return result.c_str();\n}\n\n\nstd::u16string BinaryStream::read_u16string(size_t length) const {\n  std::u16string str = this->peek_u16string(length);\n  this->increment_pos(length * sizeof(uint16_t)); \/\/ +1 for'\\0'\n  return str;\n}\n\nstd::u16string BinaryStream::peek_u16string(size_t length) const {\n  if (length == static_cast<size_t>(-1u)) {\n    return this->peek_u16string();\n  }\n  const char16_t* raw = this->peek_array<char16_t>(this->pos(), length, \/* check *\/false);\n  if (raw == nullptr) {\n    return {};\n  }\n  return {raw, length};\n}\n\nstd::u16string BinaryStream::peek_u16string_at(size_t offset, size_t length) const {\n  size_t saved_offset = this->pos();\n  this->setpos(offset);\n  std::u16string tmp = this->peek_u16string(length);\n  this->setpos(saved_offset);\n  return tmp;\n}\n\n\nsize_t BinaryStream::align(size_t align_on) const {\n  if (align_on == 0 or (this->pos() % align_on) == 0) {\n    return 0;\n  }\n  size_t padding = align_on - (this->pos() % align_on);\n  this->increment_pos(padding);\n  return padding;\n}\n\n\nstd::string BinaryStream::read_mutf8(size_t maxsize) const {\n  std::u32string u32str;\n\n  for (size_t i = 0; i < maxsize; ++i) {\n    uint8_t a = this->read<char>();\n\n    if (static_cast<uint8_t>(a) < 0x80) {\n      if (a == 0) {\n        break;\n      }\n      u32str.push_back(a);\n    } else if ((a & 0xe0) == 0xc0) {\n\n      uint8_t b = this->read<int8_t>() & 0xFF;\n\n      if ((b & 0xC0) != 0x80) {\n        break;\n      }\n      u32str.push_back(static_cast<char32_t>((((a & 0x1F) << 6) | (b & 0x3F))));\n    } else if ((a & 0xf0) == 0xe0) {\n        uint8_t b = this->read<uint8_t>() & 0xFF;\n        uint8_t c = this->read<uint8_t>() & 0xFF;\n\n        if (((b & 0xC0) != 0x80) or ((c & 0xC0) != 0x80)) {\n          break;\n        }\n        u32str.push_back(static_cast<char32_t>(((a & 0x1F) << 12) | ((b & 0x3F) << 6) | (c & 0x3F)));\n    } else {\n      break;\n    }\n  }\n\n  std::string u8str;\n\n  std::replace_if(\n      std::begin(u32str),\n      std::end(u32str),\n      [] (const char32_t c) {\n        return not utf8::internal::is_code_point_valid(c);\n      }, '.');\n\n  utf8::utf32to8(std::begin(u32str), std::end(u32str), std::back_inserter(u8str));\n\n  std::string u8str_clean;\n  for (size_t i = 0; i < u8str.size(); ++i) {\n    if (u8str[i] != -1) {\n      u8str_clean.push_back(u8str[i]);\n    } else {\n      std::stringstream ss;\n      ss << std::hex << \"\\\\x\" << std::setw(2) << std::setfill('0') << static_cast<uint32_t>(u8str[i] & 0xFF);\n      u8str_clean += ss.str();\n    }\n  }\n  return u8str_clean;\n}\n\nvoid BinaryStream::set_endian_swap(bool swap) {\n  this->endian_swap_ = swap;\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 \"OrbitClientServices\/ProcessManager.h\"\n\n#include <absl\/synchronization\/mutex.h>\n\n#include <algorithm>\n#include <memory>\n#include <string>\n#include <thread>\n\n#include \"OrbitBase\/Logging.h\"\n#include \"OrbitBase\/Result.h\"\n#include \"OrbitClientServices\/ProcessClient.h\"\n\nnamespace {\n\nusing orbit_grpc_protos::ModuleInfo;\nusing orbit_grpc_protos::ProcessInfo;\n\nclass ProcessManagerImpl final : public ProcessManager {\n public:\n  explicit ProcessManagerImpl(const std::shared_ptr<grpc::Channel>& channel,\n                              absl::Duration refresh_timeout);\n  ProcessManagerImpl(ProcessManagerImpl&&) = default;\n  ProcessManagerImpl& operator=(ProcessManagerImpl&&) = default;\n  ~ProcessManagerImpl() override { ShutdownAndWait(); }\n\n  void SetProcessListUpdateListener(const std::function<void(ProcessManager*)>& listener) override;\n\n  std::vector<ProcessInfo> GetProcessList() const override;\n  ErrorMessageOr<std::vector<ModuleInfo>> LoadModuleList(int32_t pid) override;\n\n  ErrorMessageOr<std::string> LoadProcessMemory(int32_t pid, uint64_t address,\n                                                uint64_t size) override;\n\n  ErrorMessageOr<std::string> LoadNullTerminatedString(int32_t pid, uint64_t address) override;\n\n  ErrorMessageOr<std::string> FindDebugInfoFile(const std::string& module_path) override;\n\n  void Start();\n  void ShutdownAndWait() noexcept override;\n\n private:\n  void WorkerFunction();\n\n  std::unique_ptr<ProcessClient> process_client_;\n\n  absl::Duration refresh_timeout_;\n  absl::Mutex shutdown_mutex_;\n  bool shutdown_initiated_;\n\n  mutable absl::Mutex mutex_;\n  std::vector<ProcessInfo> process_list_;\n  std::function<void(ProcessManager*)> process_list_update_listener_;\n\n  std::thread worker_thread_;\n};\n\nProcessManagerImpl::ProcessManagerImpl(const std::shared_ptr<grpc::Channel>& channel,\n                                       absl::Duration refresh_timeout)\n    : refresh_timeout_(refresh_timeout), shutdown_initiated_(false) {\n  process_client_ = std::make_unique<ProcessClient>(channel);\n}\n\nvoid ProcessManagerImpl::SetProcessListUpdateListener(\n    const std::function<void(ProcessManager*)>& listener) {\n  absl::MutexLock lock(&mutex_);\n  process_list_update_listener_ = listener;\n}\n\nErrorMessageOr<std::vector<ModuleInfo>> ProcessManagerImpl::LoadModuleList(int32_t pid) {\n  return process_client_->LoadModuleList(pid);\n}\n\nstd::vector<ProcessInfo> ProcessManagerImpl::GetProcessList() const {\n  absl::MutexLock lock(&mutex_);\n  return process_list_;\n}\n\nErrorMessageOr<std::string> ProcessManagerImpl::FindDebugInfoFile(const std::string& module_path) {\n  return process_client_->FindDebugInfoFile(module_path);\n}\n\nvoid ProcessManagerImpl::Start() {\n  CHECK(!worker_thread_.joinable());\n  worker_thread_ = std::thread([this] { WorkerFunction(); });\n}\n\nvoid ProcessManagerImpl::ShutdownAndWait() noexcept {\n  shutdown_mutex_.Lock();\n  shutdown_initiated_ = true;\n  shutdown_mutex_.Unlock();\n  if (worker_thread_.joinable()) {\n    worker_thread_.join();\n  }\n}\n\nbool IsTrue(bool* var) { return *var; }\n\nvoid ProcessManagerImpl::WorkerFunction() {\n  while (true) {\n    if (shutdown_mutex_.LockWhenWithTimeout(absl::Condition(IsTrue, &shutdown_initiated_),\n                                            refresh_timeout_)) {\n      \/\/ Shutdown was initiated we need to exit\n      shutdown_mutex_.Unlock();\n      return;\n    }\n    shutdown_mutex_.Unlock();\n    \/\/ Timeout expired - refresh the list\n\n    ErrorMessageOr<std::vector<ProcessInfo>> result = process_client_->GetProcessList();\n    if (result.has_error()) {\n      continue;\n    }\n\n    absl::MutexLock callback_lock(&mutex_);\n    const auto& processes = result.value();\n    process_list_.assign(processes.begin(), processes.end());\n    if (process_list_update_listener_) {\n      process_list_update_listener_(this);\n    }\n  }\n}\n\nErrorMessageOr<std::string> ProcessManagerImpl::LoadProcessMemory(int32_t pid, uint64_t address,\n                                                                  uint64_t size) {\n  return process_client_->LoadProcessMemory(pid, address, size);\n}\n\nErrorMessageOr<std::string> ProcessManagerImpl::LoadNullTerminatedString(int32_t pid,\n                                                                         uint64_t address) {\n  constexpr uint64_t max_size = 256;\n  auto error_or_string = LoadProcessMemory(pid, address, max_size);\n  if (error_or_string.has_value()) {\n    const std::string& str = error_or_string.value();\n    if (str.find('\\0') == std::string::npos) {\n      const char* error_msg = \"Remote string is not null terminated\";\n      ERROR(\"%s: %s\", error_msg, str.c_str());\n      return ErrorMessage(error_msg);\n    }\n\n    \/\/ The string has a size of max_size at this point. Shrink it by assigning\n    \/\/ it its own str.c_str(). c_str() is guaranteed to be null terminated.\n    error_or_string = str.c_str();\n  }\n\n  return error_or_string;\n}\n\n}  \/\/ namespace\n\nstd::unique_ptr<ProcessManager> ProcessManager::Create(\n    const std::shared_ptr<grpc::Channel>& channel, absl::Duration refresh_timeout) {\n  std::unique_ptr<ProcessManagerImpl> impl =\n      std::make_unique<ProcessManagerImpl>(channel, refresh_timeout);\n  impl->Start();\n  return impl;\n}\n<commit_msg>[fixup] addressed review comments<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 \"OrbitClientServices\/ProcessManager.h\"\n\n#include <absl\/synchronization\/mutex.h>\n\n#include <algorithm>\n#include <memory>\n#include <string>\n#include <thread>\n\n#include \"OrbitBase\/Logging.h\"\n#include \"OrbitBase\/Result.h\"\n#include \"OrbitClientServices\/ProcessClient.h\"\n\nnamespace {\n\nusing orbit_grpc_protos::ModuleInfo;\nusing orbit_grpc_protos::ProcessInfo;\n\nclass ProcessManagerImpl final : public ProcessManager {\n public:\n  explicit ProcessManagerImpl(const std::shared_ptr<grpc::Channel>& channel,\n                              absl::Duration refresh_timeout);\n  ProcessManagerImpl(ProcessManagerImpl&&) = default;\n  ProcessManagerImpl& operator=(ProcessManagerImpl&&) = default;\n  ~ProcessManagerImpl() override { ShutdownAndWait(); }\n\n  void SetProcessListUpdateListener(const std::function<void(ProcessManager*)>& listener) override;\n\n  std::vector<ProcessInfo> GetProcessList() const override;\n  ErrorMessageOr<std::vector<ModuleInfo>> LoadModuleList(int32_t pid) override;\n\n  ErrorMessageOr<std::string> LoadProcessMemory(int32_t pid, uint64_t address,\n                                                uint64_t size) override;\n\n  ErrorMessageOr<std::string> LoadNullTerminatedString(int32_t pid, uint64_t address) override;\n\n  ErrorMessageOr<std::string> FindDebugInfoFile(const std::string& module_path) override;\n\n  void Start();\n  void ShutdownAndWait() noexcept override;\n\n private:\n  void WorkerFunction();\n\n  std::unique_ptr<ProcessClient> process_client_;\n\n  absl::Duration refresh_timeout_;\n  absl::Mutex shutdown_mutex_;\n  bool shutdown_initiated_;\n\n  mutable absl::Mutex mutex_;\n  std::vector<ProcessInfo> process_list_;\n  std::function<void(ProcessManager*)> process_list_update_listener_;\n\n  std::thread worker_thread_;\n};\n\nProcessManagerImpl::ProcessManagerImpl(const std::shared_ptr<grpc::Channel>& channel,\n                                       absl::Duration refresh_timeout)\n    : refresh_timeout_(refresh_timeout), shutdown_initiated_(false) {\n  process_client_ = std::make_unique<ProcessClient>(channel);\n}\n\nvoid ProcessManagerImpl::SetProcessListUpdateListener(\n    const std::function<void(ProcessManager*)>& listener) {\n  absl::MutexLock lock(&mutex_);\n  process_list_update_listener_ = listener;\n}\n\nErrorMessageOr<std::vector<ModuleInfo>> ProcessManagerImpl::LoadModuleList(int32_t pid) {\n  return process_client_->LoadModuleList(pid);\n}\n\nstd::vector<ProcessInfo> ProcessManagerImpl::GetProcessList() const {\n  absl::MutexLock lock(&mutex_);\n  return process_list_;\n}\n\nErrorMessageOr<std::string> ProcessManagerImpl::FindDebugInfoFile(const std::string& module_path) {\n  return process_client_->FindDebugInfoFile(module_path);\n}\n\nvoid ProcessManagerImpl::Start() {\n  CHECK(!worker_thread_.joinable());\n  worker_thread_ = std::thread([this] { WorkerFunction(); });\n}\n\nvoid ProcessManagerImpl::ShutdownAndWait() noexcept {\n  shutdown_mutex_.Lock();\n  shutdown_initiated_ = true;\n  shutdown_mutex_.Unlock();\n  if (worker_thread_.joinable()) {\n    try {\n      worker_thread_.join();\n    } catch (const std::exception& e) {\n      FATAL(\"Exception during call to worker_thread_.join: %s\", e.what());\n    }\n  }\n}\n\nbool IsTrue(bool* var) { return *var; }\n\nvoid ProcessManagerImpl::WorkerFunction() {\n  while (true) {\n    if (shutdown_mutex_.LockWhenWithTimeout(absl::Condition(IsTrue, &shutdown_initiated_),\n                                            refresh_timeout_)) {\n      \/\/ Shutdown was initiated we need to exit\n      shutdown_mutex_.Unlock();\n      return;\n    }\n    shutdown_mutex_.Unlock();\n    \/\/ Timeout expired - refresh the list\n\n    ErrorMessageOr<std::vector<ProcessInfo>> result = process_client_->GetProcessList();\n    if (result.has_error()) {\n      continue;\n    }\n\n    absl::MutexLock callback_lock(&mutex_);\n    const auto& processes = result.value();\n    process_list_.assign(processes.begin(), processes.end());\n    if (process_list_update_listener_) {\n      process_list_update_listener_(this);\n    }\n  }\n}\n\nErrorMessageOr<std::string> ProcessManagerImpl::LoadProcessMemory(int32_t pid, uint64_t address,\n                                                                  uint64_t size) {\n  return process_client_->LoadProcessMemory(pid, address, size);\n}\n\nErrorMessageOr<std::string> ProcessManagerImpl::LoadNullTerminatedString(int32_t pid,\n                                                                         uint64_t address) {\n  constexpr uint64_t max_size = 256;\n  auto error_or_string = LoadProcessMemory(pid, address, max_size);\n  if (error_or_string.has_value()) {\n    const std::string& str = error_or_string.value();\n    if (str.find('\\0') == std::string::npos) {\n      const char* error_msg = \"Remote string is not null terminated\";\n      ERROR(\"%s: %s\", error_msg, str.c_str());\n      return ErrorMessage(error_msg);\n    }\n\n    \/\/ The string has a size of max_size at this point. Shrink it by assigning\n    \/\/ it its own str.c_str(). c_str() is guaranteed to be null terminated.\n    error_or_string = str.c_str();\n  }\n\n  return error_or_string;\n}\n\n}  \/\/ namespace\n\nstd::unique_ptr<ProcessManager> ProcessManager::Create(\n    const std::shared_ptr<grpc::Channel>& channel, absl::Duration refresh_timeout) {\n  std::unique_ptr<ProcessManagerImpl> impl =\n      std::make_unique<ProcessManagerImpl>(channel, refresh_timeout);\n  impl->Start();\n  return impl;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ The MIT License (MIT)\n\n\/\/ Copyright (c) 2016, Microsoft\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 \"gtest\/gtest.h\"\n\n#include \"CacheLineRecorder.h\"\n\nnamespace BitFunnel\n{\n    TEST(CacheLineRecorder, Trivial)\n    {\n        const int c_lineSize = 8;\n        const int c_vectorSize = 128;\n        std::vector<uint64_t> tinyVector(c_vectorSize);\n\n        CacheLineRecorder recorder(8192);\n        recorder.Reset();\n\n        recorder.SetBase(&tinyVector[0]);\n\n        ASSERT_EQ(recorder.GetCacheLinesAccessed(), 0u);\n        for (unsigned i = 0; i < c_vectorSize \/ c_lineSize; ++i)\n        {\n            for (unsigned j = 0; j < c_lineSize; ++j)\n            {\n                recorder.RecordAccess(&tinyVector[i*c_lineSize+j]);\n                ASSERT_EQ(recorder.GetCacheLinesAccessed(), 1+i);\n            }\n        }\n    }\n}\n<commit_msg>More CacheLineRecorder testing.<commit_after>\/\/ The MIT License (MIT)\n\n\/\/ Copyright (c) 2016, Microsoft\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 \"gtest\/gtest.h\"\n\n#include \"CacheLineRecorder.h\"\n\nnamespace BitFunnel\n{\n    TEST(CacheLineRecorder, Trivial)\n    {\n        const int c_lineSize = 8;\n        const int c_vectorSize = 128;\n        std::vector<uint64_t> tinyVector(c_vectorSize);\n\n        CacheLineRecorder recorder(8192);\n        recorder.Reset();\n\n        recorder.SetBase(&tinyVector[0]);\n\n        ASSERT_EQ(recorder.GetCacheLinesAccessed(), 0u);\n        for (unsigned i = 0; i < c_vectorSize \/ c_lineSize; ++i)\n        {\n            for (unsigned j = 0; j < c_lineSize; ++j)\n            {\n                recorder.RecordAccess(&tinyVector[i*c_lineSize+j]);\n                ASSERT_EQ(recorder.GetCacheLinesAccessed(), 1+i);\n            }\n        }\n\n        for (unsigned j = 0; j < c_lineSize; ++j)\n        {\n            recorder.Reset();\n            for (unsigned i = 0; i < c_vectorSize \/ c_lineSize; ++i)\n            {\n                recorder.RecordAccess(&tinyVector[i*c_lineSize+j]);\n                ASSERT_EQ(recorder.GetCacheLinesAccessed(), 1+i);\n            }\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"decimal.hpp\"\n#include \"decimal_special_tests.hpp\"\n#include \"stopwatch.hpp\"\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/archive\/binary_iarchive.hpp>\n#include <boost\/archive\/binary_oarchive.hpp>\n#include <boost\/archive\/xml_iarchive.hpp>\n#include <boost\/archive\/xml_oarchive.hpp>\n#include <fstream>\n#include <iostream>\n#include <numeric>\n#include <string>\n#include <vector>\n\nusing boost::algorithm::split;\nusing std::accumulate;\nusing std::cout;\nusing std::endl;\nusing std::ifstream;\nusing std::ofstream;\nusing std::string;\nusing std::vector;\n\n\n\nnamespace jewel\n{\n\nnamespace detail\n{\n\nvoid decimal_speed_test()\n{\n\tint const lim = 1000000;\n\tvector<Decimal> vec;\n\tfor (int i = 0; i != lim; ++i)\n\t{\n\t\tvec.push_back(Decimal(\"3.20\"));\n\t\tvec.push_back(Decimal(\"98.35\"));\n\t}\n\n\t\/\/ Base case... we will factor this out when\n\t\/\/ measuring the speed of the arithmetic operations\n\tStopwatch sw_base_case;\n\tfor (int i = 0; i != lim; ++i)\n\t{\n\t\tDecimal d0 = vec[i];\n\t\tDecimal d1 = vec[i + 1];\n\t}\n\tdouble const base_case = sw_base_case.seconds_elapsed();\n\n\n\tStopwatch sw_multiplication;\n\tfor (int i = 0; i != lim; ++i)\n\t{\n\t\tDecimal d0 = vec[i];\n\t\tDecimal d1 = vec[i + 1];\n\t\td0 *= d1;\n\t}\n\tcout << lim << \" multiplications take \"\n\t     << sw_multiplication.seconds_elapsed() - base_case\n\t     << \" seconds.\" << endl;\n\n\tStopwatch sw_division;\n\tfor (int i = 0; i != lim; ++i)\n\t{\n\t\tDecimal d0 = vec[i];\n\t\tDecimal d1 = vec[i + 1];\n\t\td0 \/= d1;\n\t}\n\tcout << lim << \" divisions take \"\n\t     << sw_division.seconds_elapsed() - base_case\n\t\t << \" seconds.\" << endl;\n\n\t\n\tStopwatch sw_addition;\n\tfor (int i = 0; i != lim; ++i)\n\t{\n\t\tDecimal d0 = vec[i];\n\t\tDecimal d1 = vec[i + 1];\n\t\td0 += d1;\n\t}\n\tcout << lim << \" additions take \"\n\t     << sw_addition.seconds_elapsed() - base_case\n\t     << \" seconds.\" << endl;\n\n\t\t\n\tStopwatch sw_subtraction;\n\tfor (int i = 0; i != lim; ++i)\n\t{\n\t\tDecimal d0 = vec[i];\n\t\tDecimal d1 = vec[i + 1];\n\t\td0 -= d1;\n\t}\n\tcout << lim << \" subtractions take \"\n\t     << sw_subtraction.seconds_elapsed() - base_case\n\t     << \" seconds.\" << endl;\n\n\n\t\/\/ Measure construction\n\tint const ctest_lim = 1000000 \/ 5;\n\tvector<string> ctest_vec;\n\tfor (int i = 0; i != ctest_lim; ++i)\n\t{\n\t\tctest_vec.push_back(\"-0.9871967\");\n\t\tctest_vec.push_back(\"13987.870\");\n\t\tctest_vec.push_back(\"23.2\");\n\t\tctest_vec.push_back(\"19\");\n\t\tctest_vec.push_back(\"-1234.197423\");\n\t}\n\tStopwatch sw_ctest_base;\n\tfor (vector<string>::const_iterator it = ctest_vec.begin();\n\t  it != ctest_vec.end(); ++it)\n\t{\n\t\tstring s = *it;\n\t}\n\tdouble const ctest_base_case = sw_ctest_base.seconds_elapsed();\n\tStopwatch sw_ctest;\n\tfor (vector<string>::const_iterator it = ctest_vec.begin();\n\t  it != ctest_vec.end(); ++it)\n\t{\n\t\tDecimal d0(*it);\n\t}\n\tcout << ctest_lim * 5 << \" calls to Decimal constructor-from-string\"\n\t     << \" take \" << sw_ctest.seconds_elapsed() - ctest_base_case\n\t\t << \" seconds.\" << endl;\n\n\treturn;\n}\n\n\nbool is_dagger(char c)\n{\n\treturn c == '|';\n}\n\n\nvoid decimal_csv_test()\n{\n\tcout << \"Testing processing two columns of Decimals from a text file...\"\n\t     << endl;\n\tifstream data(\"testdata\");\n\tstring current_record;\n\tDecimal field_0_total(\"0\");\n\tDecimal field_1_total(\"0\");\n\twhile (getline(data, current_record))\n\t{\n\t\tvector<string> record_vec;\n\t\tsplit(record_vec, current_record, is_dagger);\n\t\tDecimal d0(record_vec[0]);\n\t\tDecimal d1(record_vec[1]);\n\t\tfield_0_total += d0;\n\t\tfield_1_total += d1; \n\t}\n\tif (field_0_total != Decimal(\"0\"))\n\t{\n\t\tcout << \"Test failed. First column should have summed to 0, but \"\n\t\t        \"instead summed to: \" << field_0_total << endl;\n\t}\n\tif (field_1_total != Decimal(\"0\"))\n\t{\n\t\tcout << \"Test failed. Second column should have summed to 0, but \"\n\t\t        \"instead summed to: \" << field_1_total << endl;\n\t}\n\tif (field_0_total == Decimal(\"0\") && field_1_total == Decimal(\"0\"))\n\t{\n\t\tcout << \"Test succeeded. Both columns of Decimals summed to 0, as \"\n\t\t        \"expected.\" << endl;\n\t}\n\treturn;\n}\n\nvoid decimal_serialization_test()\n{\n\t\/\/ Generate sample of Decimals\n\t\n\tcout << \"Generating 1,000,000 Decimals...\" << endl;\n\tvector<Decimal> vec;\n\tDecimal const lim(\"250000\");\n\tfor (Decimal dec(\"0\"); dec != lim; ++dec)\n\t{\n\t\tDecimal dec0 = -dec - Decimal(\"0.45\");\n\t\tDecimal dec1(\"23.03\");\n\t\tDecimal dec2 = dec + Decimal(\"0.89\");\n\t\tDecimal dec3 = dec * Decimal(\"2\");\n\t\tvec.push_back(dec0);\n\t\tvec.push_back(dec1);\n\t\tvec.push_back(dec2);\n\t\tvec.push_back(dec3);\n\t}\n\tcout << \"Decimals generated.\" << endl;\n\tDecimal const total_as_written =\n\t  accumulate(vec.begin(), vec.end(), Decimal(\"0\"));\n\n\n\t\/\/ Serialize in binary format\n\t\n\tofstream bofs(\"binary_store.archive\");\n\tboost::archive::binary_oarchive boa(bofs);\n\tcout << \"Writing 1,000,000 Decimals to binary archive...\"\n\t     << endl;\n\tStopwatch sw_write_binary;\n\tfor (vector<Decimal>::const_iterator it = vec.begin();\n\t  it != vec.end(); )\n\t{\n\t\tboa << *it;\n\t\t++it;\n\t\tboa << *it;\n\t\t++it;\n\t\tboa << *it;\n\t\t++it;\n\t\tboa << *it;\n\t\t++it;\n\t}\n\tbofs.flush();\n\tbofs.close();\n\tcout << \"Writing to binary archive took \"\n\t     << sw_write_binary.seconds_elapsed() << \" seconds.\"\n\t\t << endl;\n\n\n\t\/\/ Serialize in XML format\n\n\tofstream xofs(\"xml_store.xml\");\n\tboost::archive::xml_oarchive xoa(xofs);\n\tcout << \"Writing 1,000,000 Decimals to xml archive...\"\n\t     << endl;\n\tStopwatch sw_write_xml;\n\tfor (vector<Decimal>::const_iterator it = vec.begin();\n\t  it != vec.end(); )\n\t{\n\t\tDecimal d0 = *it;\n\t\t++it;\n\t\tDecimal d1 = *it;\n\t\t++it;\n\t\tDecimal d2 = *it;\n\t\t++it;\n\t\tDecimal d3 = *it;\n\t\t++it;\n\t\txoa << BOOST_SERIALIZATION_NVP(d0)\n\t\t    << BOOST_SERIALIZATION_NVP(d1)\n\t\t\t<< BOOST_SERIALIZATION_NVP(d2)\n\t\t\t<< BOOST_SERIALIZATION_NVP(d3);\n\t}\n\txofs.flush();\n\txofs.close();\n\tcout << \"Writing to xml archive took \"\n\t     << sw_write_xml.seconds_elapsed() << \" seconds.\"\n\t\t << endl;\n\n\n\t\/\/ Read back from binary format\n\tvector<Decimal> decs_read_back_from_binary_store;\n\tcout << \"Now reading 1,000,000 binary-serialized Decimals from \"\n\t        \"binary store, and pushing them onto a vector...\" << endl;\n\tStopwatch swbin;\n\tifstream bifs(\"binary_store.archive\");\n\tboost::archive::binary_iarchive bia(bifs);\n\tfor (int i = 0; i != 1000000; ++i)\n\t{\n\t\tDecimal d;\n\t\tbia >> d;\n\t\tdecs_read_back_from_binary_store.push_back(d);\n\t}\n\tcout << \"Done. Reading took \"\n\t\t << swbin.seconds_elapsed() << \" seconds.\" << endl;\n\t\n\tDecimal total_read_back_from_binary_store =\n\t  accumulate(decs_read_back_from_binary_store.begin(),\n\t  decs_read_back_from_binary_store.end(), Decimal(\"0\"));\n\n\tif (total_read_back_from_binary_store != total_as_written)\n\t{\n\t\tcout << \"Fail! Sum of Decimals read back from binary store \"\n\t\t        \"does not equal sum as written.\" << endl;\n\t}\n\telse\n\t{\n\t\tcout << \"Decimals successfully stored and read back from \"\n\t\t        \"binary store. Sum of Decimals read back equals \"\n\t\t\t\t\"sum of Decimals written.\" << endl;\n\t}\n\tbifs.close();\n\n\n\t\/\/ Read back from xml format\n\n\tvector<Decimal> decs_read_back_from_xml_store;\n\tcout << \"Now reading 1,000,000 xml-serialized Decimals from \"\n\t        \"xml store, and pushing them onto a vector...\" << endl;\n\tStopwatch swxml;\n\tifstream xifs(\"xml_store.xml\");\n\tboost::archive::xml_iarchive xia(xifs);\n\tfor (int i = 0; i != 1000000; ++i)\n\t{\n\t\tDecimal d;\n\t\txia >> BOOST_SERIALIZATION_NVP(d);\n\t\tdecs_read_back_from_xml_store.push_back(d);\n\t}\n\tcout << \"Done. Reading took \"\n\t\t << swxml.seconds_elapsed() << \" seconds.\" << endl;\n\t\n\tDecimal total_read_back_from_xml_store =\n\t  accumulate(decs_read_back_from_xml_store.begin(),\n\t  decs_read_back_from_xml_store.end(), Decimal(\"0\"));\n\n\tif (total_read_back_from_xml_store != total_as_written)\n\t{\n\t\tcout << \"Fail! Sum of Decimals read back from xml store \"\n\t\t        \"does not equal sum as written.\" << endl;\n\t}\n\telse\n\t{\n\t\tcout << \"Decimals successfully stored and read back from \"\n\t\t        \"xml store. Sum of Decimals read back equals \"\n\t\t\t\t\"sum of Decimals written.\" << endl;\n\t}\n\txifs.close();\n\n\n\n\treturn;\n\n}\n\n}  \/\/ namespace detail\n\n}  \/\/ namespace jewel\n\n<commit_msg>Tidied comments and output text in Decimal serialization test.<commit_after>#include \"decimal.hpp\"\n#include \"decimal_special_tests.hpp\"\n#include \"stopwatch.hpp\"\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/archive\/binary_iarchive.hpp>\n#include <boost\/archive\/binary_oarchive.hpp>\n#include <boost\/archive\/xml_iarchive.hpp>\n#include <boost\/archive\/xml_oarchive.hpp>\n#include <fstream>\n#include <iostream>\n#include <numeric>\n#include <string>\n#include <vector>\n\nusing boost::algorithm::split;\nusing std::accumulate;\nusing std::cout;\nusing std::endl;\nusing std::ifstream;\nusing std::ofstream;\nusing std::string;\nusing std::vector;\n\n\n\nnamespace jewel\n{\n\nnamespace detail\n{\n\nvoid decimal_speed_test()\n{\n\tint const lim = 1000000;\n\tvector<Decimal> vec;\n\tfor (int i = 0; i != lim; ++i)\n\t{\n\t\tvec.push_back(Decimal(\"3.20\"));\n\t\tvec.push_back(Decimal(\"98.35\"));\n\t}\n\n\t\/\/ Base case... we will factor this out when\n\t\/\/ measuring the speed of the arithmetic operations\n\tStopwatch sw_base_case;\n\tfor (int i = 0; i != lim; ++i)\n\t{\n\t\tDecimal d0 = vec[i];\n\t\tDecimal d1 = vec[i + 1];\n\t}\n\tdouble const base_case = sw_base_case.seconds_elapsed();\n\n\n\tStopwatch sw_multiplication;\n\tfor (int i = 0; i != lim; ++i)\n\t{\n\t\tDecimal d0 = vec[i];\n\t\tDecimal d1 = vec[i + 1];\n\t\td0 *= d1;\n\t}\n\tcout << lim << \" multiplications take \"\n\t     << sw_multiplication.seconds_elapsed() - base_case\n\t     << \" seconds.\" << endl;\n\n\tStopwatch sw_division;\n\tfor (int i = 0; i != lim; ++i)\n\t{\n\t\tDecimal d0 = vec[i];\n\t\tDecimal d1 = vec[i + 1];\n\t\td0 \/= d1;\n\t}\n\tcout << lim << \" divisions take \"\n\t     << sw_division.seconds_elapsed() - base_case\n\t\t << \" seconds.\" << endl;\n\n\t\n\tStopwatch sw_addition;\n\tfor (int i = 0; i != lim; ++i)\n\t{\n\t\tDecimal d0 = vec[i];\n\t\tDecimal d1 = vec[i + 1];\n\t\td0 += d1;\n\t}\n\tcout << lim << \" additions take \"\n\t     << sw_addition.seconds_elapsed() - base_case\n\t     << \" seconds.\" << endl;\n\n\t\t\n\tStopwatch sw_subtraction;\n\tfor (int i = 0; i != lim; ++i)\n\t{\n\t\tDecimal d0 = vec[i];\n\t\tDecimal d1 = vec[i + 1];\n\t\td0 -= d1;\n\t}\n\tcout << lim << \" subtractions take \"\n\t     << sw_subtraction.seconds_elapsed() - base_case\n\t     << \" seconds.\" << endl;\n\n\n\t\/\/ Measure construction\n\tint const ctest_lim = 1000000 \/ 5;\n\tvector<string> ctest_vec;\n\tfor (int i = 0; i != ctest_lim; ++i)\n\t{\n\t\tctest_vec.push_back(\"-0.9871967\");\n\t\tctest_vec.push_back(\"13987.870\");\n\t\tctest_vec.push_back(\"23.2\");\n\t\tctest_vec.push_back(\"19\");\n\t\tctest_vec.push_back(\"-1234.197423\");\n\t}\n\tStopwatch sw_ctest_base;\n\tfor (vector<string>::const_iterator it = ctest_vec.begin();\n\t  it != ctest_vec.end(); ++it)\n\t{\n\t\tstring s = *it;\n\t}\n\tdouble const ctest_base_case = sw_ctest_base.seconds_elapsed();\n\tStopwatch sw_ctest;\n\tfor (vector<string>::const_iterator it = ctest_vec.begin();\n\t  it != ctest_vec.end(); ++it)\n\t{\n\t\tDecimal d0(*it);\n\t}\n\tcout << ctest_lim * 5 << \" calls to Decimal constructor-from-string\"\n\t     << \" take \" << sw_ctest.seconds_elapsed() - ctest_base_case\n\t\t << \" seconds.\" << endl;\n\n\treturn;\n}\n\n\nbool is_dagger(char c)\n{\n\treturn c == '|';\n}\n\n\nvoid decimal_csv_test()\n{\n\tcout << \"Testing processing two columns of Decimals from a text file...\"\n\t     << endl;\n\tifstream data(\"testdata\");\n\tstring current_record;\n\tDecimal field_0_total(\"0\");\n\tDecimal field_1_total(\"0\");\n\twhile (getline(data, current_record))\n\t{\n\t\tvector<string> record_vec;\n\t\tsplit(record_vec, current_record, is_dagger);\n\t\tDecimal d0(record_vec[0]);\n\t\tDecimal d1(record_vec[1]);\n\t\tfield_0_total += d0;\n\t\tfield_1_total += d1; \n\t}\n\tif (field_0_total != Decimal(\"0\"))\n\t{\n\t\tcout << \"Test failed. First column should have summed to 0, but \"\n\t\t        \"instead summed to: \" << field_0_total << endl;\n\t}\n\tif (field_1_total != Decimal(\"0\"))\n\t{\n\t\tcout << \"Test failed. Second column should have summed to 0, but \"\n\t\t        \"instead summed to: \" << field_1_total << endl;\n\t}\n\tif (field_0_total == Decimal(\"0\") && field_1_total == Decimal(\"0\"))\n\t{\n\t\tcout << \"Test succeeded. Both columns of Decimals summed to 0, as \"\n\t\t        \"expected.\" << endl;\n\t}\n\treturn;\n}\n\nvoid decimal_serialization_test()\n{\n\t\/\/ Generate sample of Decimals\n\t\n\tcout << \"Generating 1,000,000 Decimals...\" << endl;\n\tvector<Decimal> vec;\n\tDecimal const lim(\"250000\");\n\tfor (Decimal dec(\"0\"); dec != lim; ++dec)\n\t{\n\t\tDecimal dec0 = -dec - Decimal(\"0.45\");\n\t\tDecimal dec1(\"23.03\");\n\t\tDecimal dec2 = dec + Decimal(\"0.89\");\n\t\tDecimal dec3 = dec * Decimal(\"2\");\n\t\tvec.push_back(dec0);\n\t\tvec.push_back(dec1);\n\t\tvec.push_back(dec2);\n\t\tvec.push_back(dec3);\n\t}\n\tcout << \"Decimals generated.\" << endl;\n\tDecimal const total_as_written =\n\t  accumulate(vec.begin(), vec.end(), Decimal(\"0\"));\n\n\n\t\/\/ Serialize in binary format\n\t\n\tofstream bofs(\"binary_store.archive\");\n\tboost::archive::binary_oarchive boa(bofs);\n\tcout << \"Writing 1,000,000 Decimals to binary archive...\"\n\t     << endl;\n\tStopwatch sw_write_binary;\n\tfor (vector<Decimal>::const_iterator it = vec.begin();\n\t  it != vec.end(); )\n\t{\n\t\tboa << *it;\n\t\t++it;\n\t\tboa << *it;\n\t\t++it;\n\t\tboa << *it;\n\t\t++it;\n\t\tboa << *it;\n\t\t++it;\n\t}\n\tbofs.flush();\n\tbofs.close();\n\tcout << \"Writing to binary archive took \"\n\t     << sw_write_binary.seconds_elapsed() << \" seconds.\"\n\t\t << endl;\n\n\n\t\/\/ Serialize in XML format\n\n\tofstream xofs(\"xml_store.xml\");\n\tboost::archive::xml_oarchive xoa(xofs);\n\tcout << \"Writing 1,000,000 Decimals to XML archive...\"\n\t     << endl;\n\tStopwatch sw_write_xml;\n\tfor (vector<Decimal>::const_iterator it = vec.begin();\n\t  it != vec.end(); )\n\t{\n\t\tDecimal d0 = *it;\n\t\t++it;\n\t\tDecimal d1 = *it;\n\t\t++it;\n\t\tDecimal d2 = *it;\n\t\t++it;\n\t\tDecimal d3 = *it;\n\t\t++it;\n\t\txoa << BOOST_SERIALIZATION_NVP(d0)\n\t\t    << BOOST_SERIALIZATION_NVP(d1)\n\t\t\t<< BOOST_SERIALIZATION_NVP(d2)\n\t\t\t<< BOOST_SERIALIZATION_NVP(d3);\n\t}\n\txofs.flush();\n\txofs.close();\n\tcout << \"Writing to XML archive took \"\n\t     << sw_write_xml.seconds_elapsed() << \" seconds.\"\n\t\t << endl;\n\n\n\t\/\/ Read back from binary archive\n\t\n\tvector<Decimal> decs_read_back_from_binary_store;\n\tcout << \"Now reading 1,000,000 binary-serialized Decimals from \"\n\t        \"binary archive, and pushing them onto a vector...\" << endl;\n\tStopwatch swbin;\n\tifstream bifs(\"binary_store.archive\");\n\tboost::archive::binary_iarchive bia(bifs);\n\tfor (int i = 0; i != 1000000; ++i)\n\t{\n\t\tDecimal d;\n\t\tbia >> d;\n\t\tdecs_read_back_from_binary_store.push_back(d);\n\t}\n\tcout << \"Done. Reading from binary archive took \"\n\t\t << swbin.seconds_elapsed() << \" seconds.\" << endl;\n\n\n\t\/\/ Check integrity of Decimals read back from binary archive\n\n\tDecimal total_read_back_from_binary_store =\n\t  accumulate(decs_read_back_from_binary_store.begin(),\n\t  decs_read_back_from_binary_store.end(), Decimal(\"0\"));\n\n\tif (total_read_back_from_binary_store != total_as_written)\n\t{\n\t\tcout << \"Fail! Sum of Decimals read back from binary archive \"\n\t\t        \"does not equal sum as written.\" << endl;\n\t}\n\telse\n\t{\n\t\tcout << \"Decimals successfully stored and read back from \"\n\t\t        \"binary archive. Sum of Decimals read back equals \"\n\t\t\t\t\"sum of Decimals written.\" << endl;\n\t}\n\tbifs.close();\n\n\n\t\/\/ Read back from XML archive\n\n\tvector<Decimal> decs_read_back_from_xml_store;\n\tcout << \"Now reading 1,000,000 XML-serialized Decimals from \"\n\t        \"XML archive, and pushing them onto a vector...\" << endl;\n\tStopwatch swxml;\n\tifstream xifs(\"xml_store.xml\");\n\tboost::archive::xml_iarchive xia(xifs);\n\tfor (int i = 0; i != 1000000; ++i)\n\t{\n\t\tDecimal d;\n\t\txia >> BOOST_SERIALIZATION_NVP(d);\n\t\tdecs_read_back_from_xml_store.push_back(d);\n\t}\n\tcout << \"Done. Reading from XML archive took \"\n\t\t << swxml.seconds_elapsed() << \" seconds.\" << endl;\n\t\n\n\t\/\/ Check integrity of Decimals read back from XML archive\n\n\tDecimal total_read_back_from_xml_store =\n\t  accumulate(decs_read_back_from_xml_store.begin(),\n\t  decs_read_back_from_xml_store.end(), Decimal(\"0\"));\n\n\tif (total_read_back_from_xml_store != total_as_written)\n\t{\n\t\tcout << \"Fail! Sum of Decimals read back from XML archive \"\n\t\t        \"does not equal sum as written.\" << endl;\n\t}\n\telse\n\t{\n\t\tcout << \"Decimals successfully stored and read back from \"\n\t\t        \"XML archive. Sum of Decimals read back equals \"\n\t\t\t\t\"sum of Decimals written.\" << endl;\n\t}\n\txifs.close();\n\n\treturn;\n}\n\n}  \/\/ namespace detail\n\n}  \/\/ namespace jewel\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"Tools\/Exception\/exception.hpp\"\n\n#include \"Module\/Encoder\/BCH\/Encoder_BCH.hpp\"\n\n#include \"Encoder_BCH.hpp\"\n\nusing namespace aff3ct;\nusing namespace aff3ct::factory;\n\nconst std::string aff3ct::factory::Encoder_BCH::name   = \"Encoder BCH\";\nconst std::string aff3ct::factory::Encoder_BCH::prefix = \"enc\";\n\nEncoder_BCH::parameters\n::parameters(const std::string prefix)\n: Encoder::parameters(Encoder_BCH::name, prefix)\n{\n\tthis->type = \"BCH\";\n}\n\nEncoder_BCH::parameters\n::~parameters()\n{\n}\n\nEncoder_BCH::parameters* Encoder_BCH::parameters\n::clone() const\n{\n\treturn new Encoder_BCH::parameters(*this);\n}\n\n#include <cmath>\nvoid check_BCH_N(const int N)\n{\n\tauto m = (int)std::ceil(std::log2(N));\n\n\tif (N != ((1 << m) -1))\n\t{\n\t\tstd::stringstream message;\n\t\tmessage << \"'N' has to be a power of 2 minus 1\";\n\t\tthrow std::runtime_error(message.str());\n\t}\n}\n\nvoid Encoder_BCH::parameters\n::get_description(tools::Argument_map_info &req_args, tools::Argument_map_info &opt_args) const\n{\n\tEncoder::parameters::get_description(req_args, opt_args);\n\n\tauto p = this->get_prefix();\n\n\ttools::add_ranges<tools::Integer_type<int, tools::Positive_range<>, tools::Non_zero_range<>>>\n\t(req_args.at({p+\"-cw-size\", \"N\"}), tools::Function<int>(\"power of 2 minus 1\", check_BCH_N));\n\n\ttools::add_options(opt_args.at({p+\"-type\"}), 0, \"BCH\");\n}\n\nvoid Encoder_BCH::parameters\n::store(const tools::Argument_map_value &vals)\n{\n\tEncoder::parameters::store(vals);\n}\n\nvoid Encoder_BCH::parameters\n::get_headers(std::map<std::string,header_list>& headers, const bool full) const\n{\n\tEncoder::parameters::get_headers(headers, full);\n}\n\ntemplate <typename B>\nmodule::Encoder<B>* Encoder_BCH::parameters\n::build(const tools::BCH_polynomial_generator &GF) const\n{\n\tif (this->type == \"BCH\") return new module::Encoder_BCH<B>(this->K, this->N_cw, GF, this->n_frames);\n\n\tthrow tools::cannot_allocate(__FILE__, __LINE__, __func__);\n}\n\ntemplate <typename B>\nmodule::Encoder<B>* Encoder_BCH\n::build(const parameters &params, const tools::BCH_polynomial_generator &GF)\n{\n\treturn params.template build<B>(GF);\n}\n\n\/\/ ==================================================================================== explicit template instantiation\n#include \"Tools\/types.h\"\n#ifdef MULTI_PREC\ntemplate aff3ct::module::Encoder<B_8 >* aff3ct::factory::Encoder_BCH::parameters::build<B_8 >(const aff3ct::tools::BCH_polynomial_generator&) const;\ntemplate aff3ct::module::Encoder<B_16>* aff3ct::factory::Encoder_BCH::parameters::build<B_16>(const aff3ct::tools::BCH_polynomial_generator&) const;\ntemplate aff3ct::module::Encoder<B_32>* aff3ct::factory::Encoder_BCH::parameters::build<B_32>(const aff3ct::tools::BCH_polynomial_generator&) const;\ntemplate aff3ct::module::Encoder<B_64>* aff3ct::factory::Encoder_BCH::parameters::build<B_64>(const aff3ct::tools::BCH_polynomial_generator&) const;\ntemplate aff3ct::module::Encoder<B_8 >* aff3ct::factory::Encoder_BCH::build<B_8 >(const aff3ct::factory::Encoder_BCH::parameters&, const aff3ct::tools::BCH_polynomial_generator&);\ntemplate aff3ct::module::Encoder<B_16>* aff3ct::factory::Encoder_BCH::build<B_16>(const aff3ct::factory::Encoder_BCH::parameters&, const aff3ct::tools::BCH_polynomial_generator&);\ntemplate aff3ct::module::Encoder<B_32>* aff3ct::factory::Encoder_BCH::build<B_32>(const aff3ct::factory::Encoder_BCH::parameters&, const aff3ct::tools::BCH_polynomial_generator&);\ntemplate aff3ct::module::Encoder<B_64>* aff3ct::factory::Encoder_BCH::build<B_64>(const aff3ct::factory::Encoder_BCH::parameters&, const aff3ct::tools::BCH_polynomial_generator&);\n#else\ntemplate aff3ct::module::Encoder<B>* aff3ct::factory::Encoder_BCH::parameters::build<B>(const aff3ct::tools::BCH_polynomial_generator&) const;\ntemplate aff3ct::module::Encoder<B>* aff3ct::factory::Encoder_BCH::build<B>(const aff3ct::factory::Encoder_BCH::parameters&, const aff3ct::tools::BCH_polynomial_generator&);\n#endif\n\/\/ ==================================================================================== explicit template instantiation\n<commit_msg>Integrate the check N function in the description function<commit_after>#include <cmath>\n\n#include \"Tools\/Exception\/exception.hpp\"\n\n#include \"Module\/Encoder\/BCH\/Encoder_BCH.hpp\"\n\n#include \"Encoder_BCH.hpp\"\n\nusing namespace aff3ct;\nusing namespace aff3ct::factory;\n\nconst std::string aff3ct::factory::Encoder_BCH::name   = \"Encoder BCH\";\nconst std::string aff3ct::factory::Encoder_BCH::prefix = \"enc\";\n\nEncoder_BCH::parameters\n::parameters(const std::string prefix)\n: Encoder::parameters(Encoder_BCH::name, prefix)\n{\n\tthis->type = \"BCH\";\n}\n\nEncoder_BCH::parameters\n::~parameters()\n{\n}\n\nEncoder_BCH::parameters* Encoder_BCH::parameters\n::clone() const\n{\n\treturn new Encoder_BCH::parameters(*this);\n}\n\nvoid Encoder_BCH::parameters\n::get_description(tools::Argument_map_info &req_args, tools::Argument_map_info &opt_args) const\n{\n\tEncoder::parameters::get_description(req_args, opt_args);\n\n\tauto p = this->get_prefix();\n\n\tauto check_BCH_N = [](const int N)\n\t{\n\t\tauto m = (int)std::ceil(std::log2(N));\n\n\t\tif (N != ((1 << m) -1))\n\t\t{\n\t\t\tstd::stringstream message;\n\t\t\tmessage << \"'N' has to be a power of 2 minus 1\";\n\t\t\tthrow std::runtime_error(message.str());\n\t\t}\n\t};\n\n\ttools::add_ranges<tools::Integer_type<int, tools::Positive_range<>, tools::Non_zero_range<>>>\n\t(req_args.at({p+\"-cw-size\", \"N\"}), tools::Function<int>(\"power of 2 minus 1\", check_BCH_N));\n\n\ttools::add_options(opt_args.at({p+\"-type\"}), 0, \"BCH\");\n}\n\nvoid Encoder_BCH::parameters\n::store(const tools::Argument_map_value &vals)\n{\n\tEncoder::parameters::store(vals);\n}\n\nvoid Encoder_BCH::parameters\n::get_headers(std::map<std::string,header_list>& headers, const bool full) const\n{\n\tEncoder::parameters::get_headers(headers, full);\n}\n\ntemplate <typename B>\nmodule::Encoder<B>* Encoder_BCH::parameters\n::build(const tools::BCH_polynomial_generator &GF) const\n{\n\tif (this->type == \"BCH\") return new module::Encoder_BCH<B>(this->K, this->N_cw, GF, this->n_frames);\n\n\tthrow tools::cannot_allocate(__FILE__, __LINE__, __func__);\n}\n\ntemplate <typename B>\nmodule::Encoder<B>* Encoder_BCH\n::build(const parameters &params, const tools::BCH_polynomial_generator &GF)\n{\n\treturn params.template build<B>(GF);\n}\n\n\/\/ ==================================================================================== explicit template instantiation\n#include \"Tools\/types.h\"\n#ifdef MULTI_PREC\ntemplate aff3ct::module::Encoder<B_8 >* aff3ct::factory::Encoder_BCH::parameters::build<B_8 >(const aff3ct::tools::BCH_polynomial_generator&) const;\ntemplate aff3ct::module::Encoder<B_16>* aff3ct::factory::Encoder_BCH::parameters::build<B_16>(const aff3ct::tools::BCH_polynomial_generator&) const;\ntemplate aff3ct::module::Encoder<B_32>* aff3ct::factory::Encoder_BCH::parameters::build<B_32>(const aff3ct::tools::BCH_polynomial_generator&) const;\ntemplate aff3ct::module::Encoder<B_64>* aff3ct::factory::Encoder_BCH::parameters::build<B_64>(const aff3ct::tools::BCH_polynomial_generator&) const;\ntemplate aff3ct::module::Encoder<B_8 >* aff3ct::factory::Encoder_BCH::build<B_8 >(const aff3ct::factory::Encoder_BCH::parameters&, const aff3ct::tools::BCH_polynomial_generator&);\ntemplate aff3ct::module::Encoder<B_16>* aff3ct::factory::Encoder_BCH::build<B_16>(const aff3ct::factory::Encoder_BCH::parameters&, const aff3ct::tools::BCH_polynomial_generator&);\ntemplate aff3ct::module::Encoder<B_32>* aff3ct::factory::Encoder_BCH::build<B_32>(const aff3ct::factory::Encoder_BCH::parameters&, const aff3ct::tools::BCH_polynomial_generator&);\ntemplate aff3ct::module::Encoder<B_64>* aff3ct::factory::Encoder_BCH::build<B_64>(const aff3ct::factory::Encoder_BCH::parameters&, const aff3ct::tools::BCH_polynomial_generator&);\n#else\ntemplate aff3ct::module::Encoder<B>* aff3ct::factory::Encoder_BCH::parameters::build<B>(const aff3ct::tools::BCH_polynomial_generator&) const;\ntemplate aff3ct::module::Encoder<B>* aff3ct::factory::Encoder_BCH::build<B>(const aff3ct::factory::Encoder_BCH::parameters&, const aff3ct::tools::BCH_polynomial_generator&);\n#endif\n\/\/ ==================================================================================== explicit template instantiation\n<|endoftext|>"}
{"text":"<commit_before>#include \"DebugMesh.h\"\n#include \"Camera.h\"\n#include \"ShaderManager.h\"\n#include \"SimpleShader.h\"\n\nDebugMesh::DebugMesh(ID3D11Device* pDevice, ID3D11DeviceContext* pDeviceContext, AglMesh* pMesh)\n{\n\tmDevice = pDevice;\n\tmDeviceContext = pDeviceContext;\n\n\tAglMeshHeader h = pMesh->getHeader();\n\n\tAglVertexSTBN* v = (AglVertexSTBN*)pMesh->getVertices();\n\n\tunsigned int* ind = pMesh->getIndices();\n\n\tInit(v, h.vertexCount, pMesh->getIndices(), h.indexCount);\n\n\tmMesh = pMesh;\n}\nDebugMesh::~DebugMesh()\n{\n\tmVB->Release();\n\tmIB->Release();\n}\n\nvoid DebugMesh::Draw(AglMatrix pWorld, float pScale)\n{\n\tSimpleShader* ss = ShaderManager::GetInstance()->GetSimpleShader();\n\tss->SetMatrixBuffer(pWorld, Camera::GetInstance()->GetViewMatrix(), Camera::GetInstance()->GetProjectionMatrix(), false);\n\tmDeviceContext->VSSetShader(ss->GetVertexShader().Data, 0, 0);\n\tmDeviceContext->PSSetShader(ss->GetPixelShader().Data, 0, 0);\t\n\tmDeviceContext->HSSetShader(NULL, 0, 0);\n\tmDeviceContext->DSSetShader(NULL, 0, 0);\n\tmDeviceContext->IASetInputLayout(ss->GetInputLayout());\n\tUINT stride = sizeof(VertexPC);\n\tUINT offset = 0;\n\tmDeviceContext->IASetVertexBuffers(0, 1, &mVB, &stride, &offset);\n\tmDeviceContext->IASetIndexBuffer(mIB, DXGI_FORMAT_R32_UINT, 0);\n\tmDeviceContext->IASetPrimitiveTopology(D3D11_PRIMITIVE_TOPOLOGY_TRIANGLELIST);\n\n\tmDeviceContext->DrawIndexed(mIndexCount, 0, 0);\n}\nAglBoundingSphere DebugMesh::getBoundingSphere()\n{\n\tAglMeshHeader mh = mMesh->getHeader();\n\treturn mh.boundingSphere;\n}\nAglOBB DebugMesh::getMinimumOBB()\n{\n\tAglMeshHeader mh = mMesh->getHeader();\n\treturn mh.minimumOBB;\n}\nvoid DebugMesh::Init(AglVertexSTBN* pVertices, int pVertexCount, unsigned int* pIndices, int pIndexCount)\n{\n\tVertexPC* v = new VertexPC[pVertexCount];\n\tfor (int i = 0; i < pVertexCount; i++)\n\t{\n\t\tv[i].position = pVertices[i].position;\n\t\tv[i].normal = pVertices[i].normal;\n\t\tv[i].color = AglVector4(1, 0, 0, 1);\n\t}\n\n\t\/\/Create Vertex Buffer\n\tD3D11_BUFFER_DESC bd;\n\tZeroMemory(&bd, sizeof(bd));\n\tbd.Usage = D3D11_USAGE_DYNAMIC;\n\tbd.ByteWidth = sizeof(VertexPC) * pVertexCount;\n\tbd.BindFlags = D3D11_BIND_VERTEX_BUFFER;\n\tbd.CPUAccessFlags = D3D11_CPU_ACCESS_WRITE;\n\tD3D11_SUBRESOURCE_DATA vertexData;\n\tvertexData.pSysMem = v;\n\tvertexData.SysMemPitch = 0;\n\tvertexData.SysMemSlicePitch = 0;\n\n\tmDevice->CreateBuffer(&bd, &vertexData, &mVB);\n\n\tD3D11_BUFFER_DESC ibd;\n\tibd.Usage = D3D11_USAGE_DEFAULT;\n\tibd.ByteWidth = sizeof(unsigned int) * pIndexCount;\n\tibd.BindFlags = D3D11_BIND_INDEX_BUFFER;\n\tibd.CPUAccessFlags = 0;\n\tibd.MiscFlags = 0;\n\tibd.StructureByteStride = 0;\n\n\tD3D11_SUBRESOURCE_DATA indexData;\n\tindexData.pSysMem = pIndices;\n\tindexData.SysMemPitch = 0;\n\tindexData.SysMemSlicePitch = 0;\n\n\tmDevice->CreateBuffer(&ibd, &indexData, &mIB);\n\n\tmStride = sizeof(VertexPC);\n\tmIndexCount = pIndexCount;\n}<commit_msg>Christmas commit<commit_after>#include \"DebugMesh.h\"\n#include \"Camera.h\"\n#include \"ShaderManager.h\"\n#include \"SimpleShader.h\"\n\nDebugMesh::DebugMesh(ID3D11Device* pDevice, ID3D11DeviceContext* pDeviceContext, AglMesh* pMesh)\n{\n\tmDevice = pDevice;\n\tmDeviceContext = pDeviceContext;\n\n\tAglMeshHeader h = pMesh->getHeader();\n\n\tAglVertexSTBN* v = (AglVertexSTBN*)pMesh->getVertices();\n\n\tunsigned int* ind = pMesh->getIndices();\n\n\tInit(v, h.vertexCount, pMesh->getIndices(), h.indexCount);\n\n\tmMesh = pMesh;\n}\nDebugMesh::~DebugMesh()\n{\n\tmVB->Release();\n\tmIB->Release();\n}\n\nvoid DebugMesh::Draw(AglMatrix pWorld, float pScale)\n{\n\tSimpleShader* ss = ShaderManager::GetInstance()->GetSimpleShader();\n\tss->SetMatrixBuffer(pWorld, Camera::GetInstance()->GetViewMatrix(), Camera::GetInstance()->GetProjectionMatrix(), false);\n\tmDeviceContext->VSSetShader(ss->GetVertexShader().Data, 0, 0);\n\tmDeviceContext->PSSetShader(ss->GetPixelShader().Data, 0, 0);\t\n\tmDeviceContext->HSSetShader(NULL, 0, 0);\n\tmDeviceContext->DSSetShader(NULL, 0, 0);\n\tmDeviceContext->IASetInputLayout(ss->GetInputLayout());\n\tUINT stride = sizeof(VertexPC);\n\tUINT offset = 0;\n\tmDeviceContext->IASetVertexBuffers(0, 1, &mVB, &stride, &offset);\n\tmDeviceContext->IASetIndexBuffer(mIB, DXGI_FORMAT_R32_UINT, 0);\n\tmDeviceContext->IASetPrimitiveTopology(D3D11_PRIMITIVE_TOPOLOGY_TRIANGLELIST);\n\n\tmDeviceContext->DrawIndexed(mIndexCount, 0, 0);\n}\nAglBoundingSphere DebugMesh::getBoundingSphere()\n{\n\tAglMeshHeader mh = mMesh->getHeader();\n\treturn mh.boundingSphere;\n}\nAglOBB DebugMesh::getMinimumOBB()\n{\n\tAglMeshHeader mh = mMesh->getHeader();\n\treturn mh.minimumOBB;\n}\nvoid DebugMesh::Init(AglVertexSTBN* pVertices, int pVertexCount, unsigned int* pIndices, int pIndexCount)\n{\n\tVertexPC* v = new VertexPC[pVertexCount];\n\tfor (int i = 0; i < pVertexCount; i++)\n\t{\n\t\tv[i].position = pVertices[i].position;\n\t\tv[i].normal = pVertices[i].normal;\n\t\tv[i].color = AglVector4(1, 0.82f, 0, 1);\n\t}\n\n\t\/\/Create Vertex Buffer\n\tD3D11_BUFFER_DESC bd;\n\tZeroMemory(&bd, sizeof(bd));\n\tbd.Usage = D3D11_USAGE_DYNAMIC;\n\tbd.ByteWidth = sizeof(VertexPC) * pVertexCount;\n\tbd.BindFlags = D3D11_BIND_VERTEX_BUFFER;\n\tbd.CPUAccessFlags = D3D11_CPU_ACCESS_WRITE;\n\tD3D11_SUBRESOURCE_DATA vertexData;\n\tvertexData.pSysMem = v;\n\tvertexData.SysMemPitch = 0;\n\tvertexData.SysMemSlicePitch = 0;\n\n\tmDevice->CreateBuffer(&bd, &vertexData, &mVB);\n\n\tD3D11_BUFFER_DESC ibd;\n\tibd.Usage = D3D11_USAGE_DEFAULT;\n\tibd.ByteWidth = sizeof(unsigned int) * pIndexCount;\n\tibd.BindFlags = D3D11_BIND_INDEX_BUFFER;\n\tibd.CPUAccessFlags = 0;\n\tibd.MiscFlags = 0;\n\tibd.StructureByteStride = 0;\n\n\tD3D11_SUBRESOURCE_DATA indexData;\n\tindexData.pSysMem = pIndices;\n\tindexData.SysMemPitch = 0;\n\tindexData.SysMemSlicePitch = 0;\n\n\tmDevice->CreateBuffer(&ibd, &indexData, &mIB);\n\n\tmStride = sizeof(VertexPC);\n\tmIndexCount = pIndexCount;\n}<|endoftext|>"}
{"text":"<commit_before>\/\/\/@file\n\/\/\/ Type traits used for converting from and to Nasal types\n\/\/\/\n\/\/ Copyright (C) 2012  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#ifndef SG_NASAL_TRAITS_HXX_\n#define SG_NASAL_TRAITS_HXX_\n\n#include <simgear\/structure\/SGSharedPtr.hxx>\n#include <simgear\/structure\/SGWeakPtr.hxx>\n\n#include <osg\/ref_ptr>\n#include <osg\/observer_ptr>\n\n#include <boost\/shared_ptr.hpp>\n#include <boost\/weak_ptr.hpp>\n\n#include <boost\/type_traits\/integral_constant.hpp>\n#include <boost\/type_traits\/is_base_of.hpp>\n\nnamespace nasal\n{\n  template<class T>\n  struct is_vec2: public boost::integral_constant<bool, false> {};\n\n#define SG_MAKE_TRAIT(templ,type,attr)\\\n  template templ\\\n  struct attr< type >:\\\n    public boost::integral_constant<bool, true> {};\n\n#ifdef SGVec2_H\n  SG_MAKE_TRAIT(<class T>, SGVec2<T>, is_vec2)\n#endif\n\n#ifdef OSG_VEC2B\n  SG_MAKE_TRAIT(<>, osg::Vec2b, is_vec2)\n#endif\n\n#ifdef OSG_VEC2D\n  SG_MAKE_TRAIT(<>, osg::Vec2d, is_vec2)\n#endif\n\n#ifdef OSG_VEC2F\n  SG_MAKE_TRAIT(<>, osg::Vec2f, is_vec2)\n#endif\n\n#ifdef OSG_VEC2S\n  SG_MAKE_TRAIT(<>, osg::Vec2s, is_vec2)\n#endif\n\n#undef SG_MAKE_TRAIT\n\n  template<class T>\n  struct shared_ptr_traits;\n\n  template<class T>\n  struct is_strong_ref:\n    public boost::integral_constant<bool, false>\n  {};\n\n  template<class T>\n  struct is_weak_ref:\n    public boost::integral_constant<bool, false>\n  {};\n\n#define SG_MAKE_SHARED_PTR_TRAIT(ref, weak)\\\n  template<class T>\\\n  struct shared_ptr_traits<ref<T> >\\\n  {\\\n    typedef ref<T>  strong_ref;\\\n    typedef weak<T> weak_ref;\\\n    typedef T       element_type;\\\n    typedef boost::integral_constant<bool, true> is_strong;\\\n  };\\\n  template<class T>\\\n  struct shared_ptr_traits<weak<T> >\\\n  {\\\n    typedef ref<T>  strong_ref;\\\n    typedef weak<T> weak_ref;\\\n    typedef T       element_type;\\\n    typedef boost::integral_constant<bool, false> is_strong;\\\n  };\\\n  template<class T>\\\n  struct is_strong_ref<ref<T> >:\\\n    public boost::integral_constant<bool, true>\\\n  {};\\\n  template<class T>\\\n  struct is_weak_ref<weak<T> >:\\\n    public boost::integral_constant<bool, true>\\\n  {};\n\n  SG_MAKE_SHARED_PTR_TRAIT(SGSharedPtr, SGWeakPtr)\n  SG_MAKE_SHARED_PTR_TRAIT(osg::ref_ptr, osg::observer_ptr)\n  SG_MAKE_SHARED_PTR_TRAIT(boost::shared_ptr, boost::weak_ptr)\n\n#undef SG_MAKE_SHARED_PTR_TRAIT\n\n  template<class T>\n  struct supports_weak_ref:\n    public boost::integral_constant<bool, true>\n  {};\n\n  template<class T>\n  struct supports_weak_ref<SGSharedPtr<T> >:\n    public boost::integral_constant<\n      bool,\n      boost::is_base_of<SGWeakReferenced, T>::value\n    >\n  {};\n\n} \/\/ namespace nasal\n#endif \/* SG_NASAL_TRAITS_HXX_ *\/\n<commit_msg>Fix headless build and reduce include dependencies.<commit_after>\/\/\/@file\n\/\/\/ Type traits used for converting from and to Nasal types\n\/\/\/\n\/\/ Copyright (C) 2012  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#ifndef SG_NASAL_TRAITS_HXX_\n#define SG_NASAL_TRAITS_HXX_\n\n#include <boost\/type_traits\/integral_constant.hpp>\n#include <boost\/type_traits\/is_base_of.hpp>\n\n\/\/ Forward declarations\nclass SGWeakReferenced;\ntemplate<class T> class SGSharedPtr;\ntemplate<class T> class SGWeakPtr;\ntemplate<class T> class SGVec2;\n\nnamespace boost\n{\n  template<class T> class shared_ptr;\n  template<class T> class weak_ptr;\n}\nnamespace osg\n{\n  template<class T> class ref_ptr;\n  template<class T> class observer_ptr;\n\n  class Vec2b;\n  class Vec2d;\n  class Vec2f;\n  class Vec2s;\n}\n\n\/\/ The actual traits...\nnamespace nasal\n{\n  template<class T>\n  struct is_vec2: public boost::integral_constant<bool, false> {};\n\n#define SG_MAKE_TRAIT(templ,type,attr)\\\n  template templ\\\n  struct attr< type >:\\\n    public boost::integral_constant<bool, true> {};\n\nSG_MAKE_TRAIT(<class T>, SGVec2<T>, is_vec2)\nSG_MAKE_TRAIT(<>, osg::Vec2b, is_vec2)\nSG_MAKE_TRAIT(<>, osg::Vec2d, is_vec2)\nSG_MAKE_TRAIT(<>, osg::Vec2f, is_vec2)\nSG_MAKE_TRAIT(<>, osg::Vec2s, is_vec2)\n\n#undef SG_MAKE_TRAIT\n\n  template<class T>\n  struct shared_ptr_traits;\n\n  template<class T>\n  struct is_strong_ref:\n    public boost::integral_constant<bool, false>\n  {};\n\n  template<class T>\n  struct is_weak_ref:\n    public boost::integral_constant<bool, false>\n  {};\n\n#define SG_MAKE_SHARED_PTR_TRAIT(ref, weak)\\\n  template<class T>\\\n  struct shared_ptr_traits<ref<T> >\\\n  {\\\n    typedef ref<T>  strong_ref;\\\n    typedef weak<T> weak_ref;\\\n    typedef T       element_type;\\\n    typedef boost::integral_constant<bool, true> is_strong;\\\n  };\\\n  template<class T>\\\n  struct shared_ptr_traits<weak<T> >\\\n  {\\\n    typedef ref<T>  strong_ref;\\\n    typedef weak<T> weak_ref;\\\n    typedef T       element_type;\\\n    typedef boost::integral_constant<bool, false> is_strong;\\\n  };\\\n  template<class T>\\\n  struct is_strong_ref<ref<T> >:\\\n    public boost::integral_constant<bool, true>\\\n  {};\\\n  template<class T>\\\n  struct is_weak_ref<weak<T> >:\\\n    public boost::integral_constant<bool, true>\\\n  {};\n\n  SG_MAKE_SHARED_PTR_TRAIT(SGSharedPtr, SGWeakPtr)\n  SG_MAKE_SHARED_PTR_TRAIT(osg::ref_ptr, osg::observer_ptr)\n  SG_MAKE_SHARED_PTR_TRAIT(boost::shared_ptr, boost::weak_ptr)\n\n#undef SG_MAKE_SHARED_PTR_TRAIT\n\n  template<class T>\n  struct supports_weak_ref:\n    public boost::integral_constant<bool, true>\n  {};\n\n  template<class T>\n  struct supports_weak_ref<SGSharedPtr<T> >:\n    public boost::integral_constant<\n      bool,\n      boost::is_base_of<SGWeakReferenced, T>::value\n    >\n  {};\n\n} \/\/ namespace nasal\n#endif \/* SG_NASAL_TRAITS_HXX_ *\/\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 \"net\/http\/infinite_cache.h\"\n\n#include \"base\/file_util.h\"\n#include \"base\/scoped_temp_dir.h\"\n#include \"base\/threading\/platform_thread.h\"\n#include \"base\/time.h\"\n#include \"net\/base\/net_errors.h\"\n#include \"net\/base\/test_completion_callback.h\"\n#include \"net\/http\/http_transaction_unittest.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nusing base::Time;\nusing base::TimeDelta;\nusing net::InfiniteCache;\nusing net::InfiniteCacheTransaction;\n\nnamespace {\n\nvoid StartRequest(const MockTransaction& http_transaction,\n                  InfiniteCacheTransaction* transaction) {\n  scoped_refptr<net::HttpResponseHeaders> headers(\n      new net::HttpResponseHeaders(http_transaction.response_headers));\n  net::HttpResponseInfo response;\n  response.headers = headers;\n  response.request_time = http_transaction.request_time.is_null() ?\n                          Time::Now() : http_transaction.request_time;\n  response.response_time = Time::Now();\n\n  MockHttpRequest request(http_transaction);\n  transaction->OnRequestStart(&request);\n  transaction->OnResponseReceived(&response);\n}\n\nvoid ProcessRequest(const MockTransaction& http_transaction,\n                    InfiniteCache* cache) {\n  scoped_ptr<InfiniteCacheTransaction> transaction\n      (cache->CreateInfiniteCacheTransaction());\n\n  StartRequest(http_transaction, transaction.get());\n  transaction->OnDataRead(http_transaction.data, strlen(http_transaction.data));\n}\n\nvoid ProcessRequestWithTime(const MockTransaction& http_transaction,\n                            InfiniteCache* cache,\n                            Time time) {\n  scoped_ptr<InfiniteCacheTransaction> transaction\n      (cache->CreateInfiniteCacheTransaction());\n\n  MockTransaction timed_transaction = http_transaction;\n  timed_transaction.request_time = time;\n  StartRequest(timed_transaction, transaction.get());\n  transaction->OnDataRead(http_transaction.data, strlen(http_transaction.data));\n}\n\n}  \/\/ namespace\n\nTEST(InfiniteCache, Basics) {\n  InfiniteCache cache;\n  cache.Init(FilePath());\n\n  scoped_ptr<InfiniteCacheTransaction> transaction\n      (cache.CreateInfiniteCacheTransaction());\n\n  \/\/ Don't even Start() this transaction.\n  transaction.reset(cache.CreateInfiniteCacheTransaction());\n\n  net::TestCompletionCallback cb;\n  EXPECT_EQ(0, cb.GetResult(cache.QueryItemsForTest(cb.callback())));\n\n  MockHttpRequest request(kTypicalGET_Transaction);\n  transaction->OnRequestStart(&request);\n\n  \/\/ Don't have a response yet.\n  transaction.reset(cache.CreateInfiniteCacheTransaction());\n  EXPECT_EQ(0, cb.GetResult(cache.QueryItemsForTest(cb.callback())));\n\n  net::HttpResponseInfo response;\n  scoped_refptr<net::HttpResponseHeaders> headers(\n      new net::HttpResponseHeaders(kTypicalGET_Transaction.response_headers));\n  response.headers = headers;\n\n  transaction->OnRequestStart(&request);\n  transaction->OnResponseReceived(&response);\n  transaction.reset(cache.CreateInfiniteCacheTransaction());\n  EXPECT_EQ(1, cb.GetResult(cache.QueryItemsForTest(cb.callback())));\n\n  \/\/ Hit the same URL again.\n  transaction->OnRequestStart(&request);\n  transaction->OnResponseReceived(&response);\n  transaction.reset(cache.CreateInfiniteCacheTransaction());\n  EXPECT_EQ(1, cb.GetResult(cache.QueryItemsForTest(cb.callback())));\n\n  \/\/ Now a different URL.\n  MockHttpRequest request2(kSimpleGET_Transaction);\n  transaction->OnRequestStart(&request2);\n  transaction->OnResponseReceived(&response);\n  transaction.reset();\n  EXPECT_EQ(2, cb.GetResult(cache.QueryItemsForTest(cb.callback())));\n}\n\nTEST(InfiniteCache, Save_Restore) {\n  ScopedTempDir dir;\n  ASSERT_TRUE(dir.CreateUniqueTempDir());\n  FilePath path = dir.path().Append(FILE_PATH_LITERAL(\"infinite\"));\n\n  scoped_ptr<InfiniteCache> cache(new InfiniteCache);\n  cache->Init(path);\n  net::TestCompletionCallback cb;\n\n  ProcessRequest(kTypicalGET_Transaction, cache.get());\n  ProcessRequest(kSimpleGET_Transaction, cache.get());\n  ProcessRequest(kETagGET_Transaction, cache.get());\n  ProcessRequest(kSimplePOST_Transaction, cache.get());\n\n  EXPECT_EQ(3, cb.GetResult(cache->QueryItemsForTest(cb.callback())));\n  EXPECT_EQ(net::OK, cb.GetResult(cache->FlushDataForTest(cb.callback())));\n\n  cache.reset(new InfiniteCache);\n  cache->Init(path);\n  EXPECT_EQ(3, cb.GetResult(cache->QueryItemsForTest(cb.callback())));\n\n  ProcessRequest(kTypicalGET_Transaction, cache.get());\n  EXPECT_EQ(3, cb.GetResult(cache->QueryItemsForTest(cb.callback())));\n  EXPECT_EQ(net::OK, cb.GetResult(cache->FlushDataForTest(cb.callback())));\n}\n\nTEST(InfiniteCache, DoomMethod) {\n  InfiniteCache cache;\n  cache.Init(FilePath());\n\n  ProcessRequest(kTypicalGET_Transaction, &cache);\n  ProcessRequest(kSimpleGET_Transaction, &cache);\n  ProcessRequest(kETagGET_Transaction, &cache);\n  net::TestCompletionCallback cb;\n  EXPECT_EQ(3, cb.GetResult(cache.QueryItemsForTest(cb.callback())));\n\n  MockTransaction request(kTypicalGET_Transaction);\n  request.method = \"PUT\";\n  ProcessRequest(request, &cache);\n  EXPECT_EQ(2, cb.GetResult(cache.QueryItemsForTest(cb.callback())));\n\n  request.method = \"POST\";\n  request.url = kSimpleGET_Transaction.url;\n  ProcessRequest(request, &cache);\n  EXPECT_EQ(1, cb.GetResult(cache.QueryItemsForTest(cb.callback())));\n\n  request.method = \"DELETE\";\n  request.url = kETagGET_Transaction.url;\n  ProcessRequest(request, &cache);\n  EXPECT_EQ(0, cb.GetResult(cache.QueryItemsForTest(cb.callback())));\n}\n\nTEST(InfiniteCache, Delete) {\n  ScopedTempDir dir;\n  ASSERT_TRUE(dir.CreateUniqueTempDir());\n  FilePath path = dir.path().Append(FILE_PATH_LITERAL(\"infinite\"));\n\n  scoped_ptr<InfiniteCache> cache(new InfiniteCache);\n  cache->Init(path);\n  net::TestCompletionCallback cb;\n\n  ProcessRequest(kTypicalGET_Transaction, cache.get());\n  ProcessRequest(kSimpleGET_Transaction, cache.get());\n  EXPECT_EQ(2, cb.GetResult(cache->QueryItemsForTest(cb.callback())));\n  EXPECT_EQ(net::OK, cb.GetResult(cache->FlushDataForTest(cb.callback())));\n  EXPECT_TRUE(file_util::PathExists(path));\n\n  cache.reset(new InfiniteCache);\n  cache->Init(path);\n  EXPECT_EQ(2, cb.GetResult(cache->QueryItemsForTest(cb.callback())));\n  EXPECT_EQ(net::OK, cb.GetResult(cache->DeleteData(cb.callback())));\n  EXPECT_EQ(0, cb.GetResult(cache->QueryItemsForTest(cb.callback())));\n  EXPECT_FALSE(file_util::PathExists(path));\n\n  EXPECT_EQ(net::OK, cb.GetResult(cache->FlushDataForTest(cb.callback())));\n}\n\nTEST(InfiniteCache, DeleteBetween) {\n  ScopedTempDir dir;\n  ASSERT_TRUE(dir.CreateUniqueTempDir());\n  FilePath path = dir.path().Append(FILE_PATH_LITERAL(\"infinite\"));\n\n  scoped_ptr<InfiniteCache> cache(new InfiniteCache);\n  cache->Init(path);\n  net::TestCompletionCallback cb;\n\n  Time::Exploded baseline = {};\n  baseline.year = 2012;\n  baseline.month = 1;\n  baseline.day_of_month = 1;\n  Time base_time = Time::FromUTCExploded(baseline);\n\n  ProcessRequestWithTime(kTypicalGET_Transaction, cache.get(), base_time);\n\n  Time start = base_time + TimeDelta::FromSeconds(2);\n  ProcessRequestWithTime(kSimpleGET_Transaction, cache.get(), start);\n  Time end = start + TimeDelta::FromSeconds(2);\n\n  ProcessRequestWithTime(kETagGET_Transaction, cache.get(),\n                          end + TimeDelta::FromSeconds(2));\n\n  EXPECT_EQ(3, cb.GetResult(cache->QueryItemsForTest(cb.callback())));\n  EXPECT_EQ(net::OK,\n            cb.GetResult(cache->DeleteDataBetween(start, end,\n                                                  cb.callback())));\n  EXPECT_EQ(2, cb.GetResult(cache->QueryItemsForTest(cb.callback())));\n\n  \/\/ Make sure the data is deleted from disk.\n  EXPECT_EQ(net::OK, cb.GetResult(cache->FlushDataForTest(cb.callback())));\n  cache.reset(new InfiniteCache);\n  cache->Init(path);\n\n  EXPECT_EQ(2, cb.GetResult(cache->QueryItemsForTest(cb.callback())));\n  ProcessRequest(kETagGET_Transaction, cache.get());\n  EXPECT_EQ(2, cb.GetResult(cache->QueryItemsForTest(cb.callback())));\n\n  EXPECT_EQ(net::OK,\n            cb.GetResult(cache->DeleteDataBetween(start, Time::Now(),\n                                                  cb.callback())));\n  EXPECT_EQ(1, cb.GetResult(cache->QueryItemsForTest(cb.callback())));\n\n  \/\/ Make sure the data is deleted from disk.\n  EXPECT_EQ(net::OK, cb.GetResult(cache->FlushDataForTest(cb.callback())));\n  cache.reset(new InfiniteCache);\n  cache->Init(path);\n\n  EXPECT_EQ(1, cb.GetResult(cache->QueryItemsForTest(cb.callback())));\n  ProcessRequest(kTypicalGET_Transaction, cache.get());\n  EXPECT_EQ(1, cb.GetResult(cache->QueryItemsForTest(cb.callback())));\n}\n<commit_msg>net: don't run InfiniteCache.DeleteBetween on Android.<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 \"net\/http\/infinite_cache.h\"\n\n#include \"base\/file_util.h\"\n#include \"base\/scoped_temp_dir.h\"\n#include \"base\/threading\/platform_thread.h\"\n#include \"base\/time.h\"\n#include \"net\/base\/net_errors.h\"\n#include \"net\/base\/test_completion_callback.h\"\n#include \"net\/http\/http_transaction_unittest.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nusing base::Time;\nusing base::TimeDelta;\nusing net::InfiniteCache;\nusing net::InfiniteCacheTransaction;\n\nnamespace {\n\nvoid StartRequest(const MockTransaction& http_transaction,\n                  InfiniteCacheTransaction* transaction) {\n  scoped_refptr<net::HttpResponseHeaders> headers(\n      new net::HttpResponseHeaders(http_transaction.response_headers));\n  net::HttpResponseInfo response;\n  response.headers = headers;\n  response.request_time = http_transaction.request_time.is_null() ?\n                          Time::Now() : http_transaction.request_time;\n  response.response_time = Time::Now();\n\n  MockHttpRequest request(http_transaction);\n  transaction->OnRequestStart(&request);\n  transaction->OnResponseReceived(&response);\n}\n\nvoid ProcessRequest(const MockTransaction& http_transaction,\n                    InfiniteCache* cache) {\n  scoped_ptr<InfiniteCacheTransaction> transaction\n      (cache->CreateInfiniteCacheTransaction());\n\n  StartRequest(http_transaction, transaction.get());\n  transaction->OnDataRead(http_transaction.data, strlen(http_transaction.data));\n}\n\nvoid ProcessRequestWithTime(const MockTransaction& http_transaction,\n                            InfiniteCache* cache,\n                            Time time) {\n  scoped_ptr<InfiniteCacheTransaction> transaction\n      (cache->CreateInfiniteCacheTransaction());\n\n  MockTransaction timed_transaction = http_transaction;\n  timed_transaction.request_time = time;\n  StartRequest(timed_transaction, transaction.get());\n  transaction->OnDataRead(http_transaction.data, strlen(http_transaction.data));\n}\n\n}  \/\/ namespace\n\nTEST(InfiniteCache, Basics) {\n  InfiniteCache cache;\n  cache.Init(FilePath());\n\n  scoped_ptr<InfiniteCacheTransaction> transaction\n      (cache.CreateInfiniteCacheTransaction());\n\n  \/\/ Don't even Start() this transaction.\n  transaction.reset(cache.CreateInfiniteCacheTransaction());\n\n  net::TestCompletionCallback cb;\n  EXPECT_EQ(0, cb.GetResult(cache.QueryItemsForTest(cb.callback())));\n\n  MockHttpRequest request(kTypicalGET_Transaction);\n  transaction->OnRequestStart(&request);\n\n  \/\/ Don't have a response yet.\n  transaction.reset(cache.CreateInfiniteCacheTransaction());\n  EXPECT_EQ(0, cb.GetResult(cache.QueryItemsForTest(cb.callback())));\n\n  net::HttpResponseInfo response;\n  scoped_refptr<net::HttpResponseHeaders> headers(\n      new net::HttpResponseHeaders(kTypicalGET_Transaction.response_headers));\n  response.headers = headers;\n\n  transaction->OnRequestStart(&request);\n  transaction->OnResponseReceived(&response);\n  transaction.reset(cache.CreateInfiniteCacheTransaction());\n  EXPECT_EQ(1, cb.GetResult(cache.QueryItemsForTest(cb.callback())));\n\n  \/\/ Hit the same URL again.\n  transaction->OnRequestStart(&request);\n  transaction->OnResponseReceived(&response);\n  transaction.reset(cache.CreateInfiniteCacheTransaction());\n  EXPECT_EQ(1, cb.GetResult(cache.QueryItemsForTest(cb.callback())));\n\n  \/\/ Now a different URL.\n  MockHttpRequest request2(kSimpleGET_Transaction);\n  transaction->OnRequestStart(&request2);\n  transaction->OnResponseReceived(&response);\n  transaction.reset();\n  EXPECT_EQ(2, cb.GetResult(cache.QueryItemsForTest(cb.callback())));\n}\n\nTEST(InfiniteCache, Save_Restore) {\n  ScopedTempDir dir;\n  ASSERT_TRUE(dir.CreateUniqueTempDir());\n  FilePath path = dir.path().Append(FILE_PATH_LITERAL(\"infinite\"));\n\n  scoped_ptr<InfiniteCache> cache(new InfiniteCache);\n  cache->Init(path);\n  net::TestCompletionCallback cb;\n\n  ProcessRequest(kTypicalGET_Transaction, cache.get());\n  ProcessRequest(kSimpleGET_Transaction, cache.get());\n  ProcessRequest(kETagGET_Transaction, cache.get());\n  ProcessRequest(kSimplePOST_Transaction, cache.get());\n\n  EXPECT_EQ(3, cb.GetResult(cache->QueryItemsForTest(cb.callback())));\n  EXPECT_EQ(net::OK, cb.GetResult(cache->FlushDataForTest(cb.callback())));\n\n  cache.reset(new InfiniteCache);\n  cache->Init(path);\n  EXPECT_EQ(3, cb.GetResult(cache->QueryItemsForTest(cb.callback())));\n\n  ProcessRequest(kTypicalGET_Transaction, cache.get());\n  EXPECT_EQ(3, cb.GetResult(cache->QueryItemsForTest(cb.callback())));\n  EXPECT_EQ(net::OK, cb.GetResult(cache->FlushDataForTest(cb.callback())));\n}\n\nTEST(InfiniteCache, DoomMethod) {\n  InfiniteCache cache;\n  cache.Init(FilePath());\n\n  ProcessRequest(kTypicalGET_Transaction, &cache);\n  ProcessRequest(kSimpleGET_Transaction, &cache);\n  ProcessRequest(kETagGET_Transaction, &cache);\n  net::TestCompletionCallback cb;\n  EXPECT_EQ(3, cb.GetResult(cache.QueryItemsForTest(cb.callback())));\n\n  MockTransaction request(kTypicalGET_Transaction);\n  request.method = \"PUT\";\n  ProcessRequest(request, &cache);\n  EXPECT_EQ(2, cb.GetResult(cache.QueryItemsForTest(cb.callback())));\n\n  request.method = \"POST\";\n  request.url = kSimpleGET_Transaction.url;\n  ProcessRequest(request, &cache);\n  EXPECT_EQ(1, cb.GetResult(cache.QueryItemsForTest(cb.callback())));\n\n  request.method = \"DELETE\";\n  request.url = kETagGET_Transaction.url;\n  ProcessRequest(request, &cache);\n  EXPECT_EQ(0, cb.GetResult(cache.QueryItemsForTest(cb.callback())));\n}\n\nTEST(InfiniteCache, Delete) {\n  ScopedTempDir dir;\n  ASSERT_TRUE(dir.CreateUniqueTempDir());\n  FilePath path = dir.path().Append(FILE_PATH_LITERAL(\"infinite\"));\n\n  scoped_ptr<InfiniteCache> cache(new InfiniteCache);\n  cache->Init(path);\n  net::TestCompletionCallback cb;\n\n  ProcessRequest(kTypicalGET_Transaction, cache.get());\n  ProcessRequest(kSimpleGET_Transaction, cache.get());\n  EXPECT_EQ(2, cb.GetResult(cache->QueryItemsForTest(cb.callback())));\n  EXPECT_EQ(net::OK, cb.GetResult(cache->FlushDataForTest(cb.callback())));\n  EXPECT_TRUE(file_util::PathExists(path));\n\n  cache.reset(new InfiniteCache);\n  cache->Init(path);\n  EXPECT_EQ(2, cb.GetResult(cache->QueryItemsForTest(cb.callback())));\n  EXPECT_EQ(net::OK, cb.GetResult(cache->DeleteData(cb.callback())));\n  EXPECT_EQ(0, cb.GetResult(cache->QueryItemsForTest(cb.callback())));\n  EXPECT_FALSE(file_util::PathExists(path));\n\n  EXPECT_EQ(net::OK, cb.GetResult(cache->FlushDataForTest(cb.callback())));\n}\n\nTEST(InfiniteCache, DeleteBetween) {\n#if !defined(OS_ANDROID)\n  ScopedTempDir dir;\n  ASSERT_TRUE(dir.CreateUniqueTempDir());\n  FilePath path = dir.path().Append(FILE_PATH_LITERAL(\"infinite\"));\n\n  scoped_ptr<InfiniteCache> cache(new InfiniteCache);\n  cache->Init(path);\n  net::TestCompletionCallback cb;\n\n  Time::Exploded baseline = {};\n  baseline.year = 2012;\n  baseline.month = 1;\n  baseline.day_of_month = 1;\n  Time base_time = Time::FromUTCExploded(baseline);\n\n  ProcessRequestWithTime(kTypicalGET_Transaction, cache.get(), base_time);\n\n  Time start = base_time + TimeDelta::FromSeconds(2);\n  ProcessRequestWithTime(kSimpleGET_Transaction, cache.get(), start);\n  Time end = start + TimeDelta::FromSeconds(2);\n\n  ProcessRequestWithTime(kETagGET_Transaction, cache.get(),\n                          end + TimeDelta::FromSeconds(2));\n\n  EXPECT_EQ(3, cb.GetResult(cache->QueryItemsForTest(cb.callback())));\n  EXPECT_EQ(net::OK,\n            cb.GetResult(cache->DeleteDataBetween(start, end,\n                                                  cb.callback())));\n  EXPECT_EQ(2, cb.GetResult(cache->QueryItemsForTest(cb.callback())));\n\n  \/\/ Make sure the data is deleted from disk.\n  EXPECT_EQ(net::OK, cb.GetResult(cache->FlushDataForTest(cb.callback())));\n  cache.reset(new InfiniteCache);\n  cache->Init(path);\n\n  EXPECT_EQ(2, cb.GetResult(cache->QueryItemsForTest(cb.callback())));\n  ProcessRequest(kETagGET_Transaction, cache.get());\n  EXPECT_EQ(2, cb.GetResult(cache->QueryItemsForTest(cb.callback())));\n\n  EXPECT_EQ(net::OK,\n            cb.GetResult(cache->DeleteDataBetween(start, Time::Now(),\n                                                  cb.callback())));\n  EXPECT_EQ(1, cb.GetResult(cache->QueryItemsForTest(cb.callback())));\n\n  \/\/ Make sure the data is deleted from disk.\n  EXPECT_EQ(net::OK, cb.GetResult(cache->FlushDataForTest(cb.callback())));\n  cache.reset(new InfiniteCache);\n  cache->Init(path);\n\n  EXPECT_EQ(1, cb.GetResult(cache->QueryItemsForTest(cb.callback())));\n  ProcessRequest(kTypicalGET_Transaction, cache.get());\n  EXPECT_EQ(1, cb.GetResult(cache->QueryItemsForTest(cb.callback())));\n#endif  \/\/ OS_ANDROID\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"judge_or_rejudge_job_handler.h\"\n#include \"main.h\"\n\n#include <sim\/submission.h>\n\nvoid JudgeOrRejudgeJobHandler::run() {\n\tSTACK_UNWINDING_MARK;\n\n\t\/\/ Gather the needed information about the submission\n\tauto stmt = mysql.prepare(\"SELECT s.file_id, s.language, s.owner,\"\n\t                          \" contest_problem_id, problem_id, last_judgment,\"\n\t                          \" p.file_id, p.last_edit \"\n\t                          \"FROM submissions s, problems p \"\n\t                          \"WHERE p.id=problem_id AND s.id=?\");\n\tstmt.bindAndExecute(submission_id);\n\tuint64_t submission_file_id, problem_file_id;\n\tuint64_t problem_id;\n\tMySQL::Optional<uint64_t> sowner, contest_problem_id;\n\tInplaceBuff<64> last_judgment, p_last_edit;\n\tEnumVal<SubmissionLanguage> lang;\n\tstmt.res_bind_all(submission_file_id, lang, sowner, contest_problem_id,\n\t                  problem_id, last_judgment, problem_file_id, p_last_edit);\n\t\/\/ If the submission doesn't exist (probably was removed)\n\tif (not stmt.next()) {\n\t\treturn set_failure(\"Failed the job of judging the submission \",\n\t\t                   submission_id,\n\t\t                   \", since there is no such submission.\");\n\t}\n\n\t\/\/ If the problem wasn't modified since last judgment and submission has\n\t\/\/ already been rejudged after the job was created\n\tif (last_judgment > p_last_edit and last_judgment > job_creation_time) {\n\t\t\/\/ Skip the job - the submission has already been rejudged\n\t\treturn job_cancelled(\"Skipped judging of the submission \",\n\t\t                     submission_id,\n\t\t                     \" because it has already been rejudged after this \"\n\t\t                     \"job had been scheduled\");\n\t}\n\n\tstd::string judging_began = mysql_date();\n\n\tjob_log(\"Judging submission \", submission_id, \" (problem: \", problem_id,\n\t        ')');\n\tload_problem_package(internal_file_path(problem_file_id));\n\n\tauto update_submission = [&](SubmissionStatus initial_status,\n\t                             SubmissionStatus full_status,\n\t                             Optional<int64_t> score, auto&& initial_report,\n\t                             auto&& final_report) {\n\t\t{\n\t\t\tauto transaction = mysql.start_transaction();\n\t\t\tsubmission::update_final_lock(mysql, sowner, problem_id);\n\n\t\t\tusing ST = SubmissionType;\n\t\t\t\/\/ Get the submission's ACTUAL type\n\t\t\tstmt = mysql.prepare(\"SELECT type FROM submissions WHERE id=?\");\n\t\t\tstmt.bindAndExecute(submission_id);\n\t\t\tEnumVal<ST> stype;\n\t\t\tstmt.res_bind_all(stype);\n\t\t\tif (not stmt.next())\n\t\t\t\treturn; \/\/ Ignore errors (deleted submission)\n\n\t\t\t\/\/ Update submission\n\t\t\tstmt = mysql.prepare(\"UPDATE submissions \"\n\t\t\t                     \"SET final_candidate=?, initial_status=?,\"\n\t\t\t                     \" full_status=?, score=?, last_judgment=?,\"\n\t\t\t                     \" initial_report=?, final_report=? \"\n\t\t\t                     \"WHERE id=?\");\n\n\t\t\tif (is_fatal(full_status)) {\n\t\t\t\tstmt.bindAndExecute(\n\t\t\t\t   false, (uint)initial_status, (uint)full_status, nullptr,\n\t\t\t\t   judging_began, initial_report, final_report, submission_id);\n\t\t\t} else {\n\t\t\t\tstmt.bindAndExecute((stype == ST::NORMAL and score.has_value()),\n\t\t\t\t                    (uint)initial_status, (uint)full_status,\n\t\t\t\t                    score, judging_began, initial_report,\n\t\t\t\t                    final_report, submission_id);\n\t\t\t}\n\n\t\t\tsubmission::update_final(mysql, sowner, problem_id,\n\t\t\t                         contest_problem_id, false);\n\n\t\t\ttransaction.commit();\n\t\t}\n\t};\n\n\tauto compilation_errors = compile_solution(\n\t   internal_file_path(submission_file_id), to_sol_lang(lang));\n\tif (compilation_errors.has_value()) {\n\t\tupdate_submission(SubmissionStatus::COMPILATION_ERROR,\n\t\t                  SubmissionStatus::COMPILATION_ERROR, std::nullopt,\n\t\t                  concat(\"<pre class=\\\"compilation-errors\\\">\",\n\t\t                         htmlEscape(compilation_errors.value()),\n\t\t                         \"<\/pre>\"),\n\t\t                  \"\");\n\n\t\treturn job_done();\n\t}\n\n\t\/\/ Compile checker\n\tcompilation_errors = compile_checker();\n\tif (compilation_errors.has_value()) {\n\t\terrlog(\"Job \", job_id, \" (submission \", submission_id, \", problem \",\n\t\t       problem_id, \"): Checker compilation failed\");\n\t\tupdate_submission(\n\t\t   SubmissionStatus::CHECKER_COMPILATION_ERROR,\n\t\t   SubmissionStatus::CHECKER_COMPILATION_ERROR, std::nullopt,\n\t\t   concat(\"<pre class=\\\"compilation-errors\\\">\",\n\t\t          htmlEscape(compilation_errors.value()), \"<\/pre>\"),\n\t\t   \"\");\n\n\t\treturn job_done();\n\t}\n\n\tauto send_judge_report = [&, initial_status = SubmissionStatus::OK,\n\t                          initial_report = InplaceBuff<1 << 16>(),\n\t                          initial_score =\n\t                             (int64_t)0](const sim::JudgeReport& jreport,\n\t                                         bool final, bool partial) mutable {\n\t\tauto rep = construct_report(jreport, final);\n\t\tauto status = calc_status(jreport);\n\t\t\/\/ Count score\n\t\tint64_t score = 0;\n\t\tfor (auto&& group : jreport.groups)\n\t\t\tscore += group.score;\n\n\t\t\/\/ Log reports\n\t\tauto job_log_len = job_log_holder.size;\n\t\tjob_log(\"Job \", job_id, \" -> submission \", submission_id, \" (problem \",\n\t\t        problem_id, \")\\n\", (partial ? \"Partial j\" : \"J\"),\n\t\t        \"udge report: \", jreport.judge_log);\n\n\t\tstmt = mysql.prepare(\"UPDATE jobs SET data=? WHERE id=?\");\n\t\tstmt.bindAndExecute(get_log(), job_id);\n\t\tif (partial)\n\t\t\tjob_log_holder.size = job_log_len;\n\n\t\tif (not final) {\n\t\t\tinitial_report = rep;\n\t\t\tinitial_status = status;\n\t\t\tinitial_score = score;\n\t\t\treturn update_submission(status, SubmissionStatus::PENDING,\n\t\t\t                         std::nullopt, rep, \"\");\n\t\t}\n\n\t\t\/\/ Final\n\t\tscore += initial_score;\n\t\t\/\/ If initial tests haven't passed\n\t\tif (initial_status != SubmissionStatus::OK and\n\t\t    status != SubmissionStatus::JUDGE_ERROR) {\n\t\t\tstatus = initial_status;\n\t\t}\n\n\t\tupdate_submission(initial_status, status, score, initial_report, rep);\n\t};\n\n\ttry {\n\t\t\/\/ Judge\n\t\tsim::VerboseJudgeLogger logger(true);\n\n\t\tsim::JudgeReport initial_jrep =\n\t\t   jworker.judge(false, logger, [&](const sim::JudgeReport& partial) {\n\t\t\t   send_judge_report(partial, false, true);\n\t\t   });\n\t\tsend_judge_report(initial_jrep, false, false);\n\n\t\tsim::JudgeReport final_jrep =\n\t\t   jworker.judge(true, logger, [&](const sim::JudgeReport& partial) {\n\t\t\t   send_judge_report(partial, true, true);\n\t\t   });\n\t\tsend_judge_report(final_jrep, true, false);\n\n\t\t\/\/ Log checker errors\n\t\tfor (auto&& rep : {initial_jrep, final_jrep})\n\t\t\tfor (auto&& group : rep.groups)\n\t\t\t\tfor (auto&& test : group.tests)\n\t\t\t\t\tif (test.status == sim::JudgeReport::Test::CHECKER_ERROR) {\n\t\t\t\t\t\terrlog(\"Checker error: submission \", submission_id,\n\t\t\t\t\t\t       \" (problem id: \", problem_id, \") test `\",\n\t\t\t\t\t\t       test.name, '`');\n\t\t\t\t\t}\n\n\t\t\/\/ Log syscall problems (to errlog)\n\t\tfor (auto&& rep : {initial_jrep, final_jrep}) {\n\t\t\tfor (auto&& group : rep.groups) {\n\t\t\t\tfor (auto&& test : group.tests) {\n\t\t\t\t\tif (hasPrefixIn(test.comment,\n\t\t\t\t\t                {\"Runtime error (Error: \",\n\t\t\t\t\t                 \"Runtime error (failed to get syscall\",\n\t\t\t\t\t                 \"Runtime error (forbidden syscall\"})) {\n\t\t\t\t\t\terrlog(\"Submission \", submission_id, \" (problem \",\n\t\t\t\t\t\t       problem_id, \"): \", test.name, \" -> \",\n\t\t\t\t\t\t       test.comment);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn job_done();\n\n\t} catch (const std::exception& e) {\n\t\tERRLOG_CATCH(e);\n\n\t\tjob_log(\"Judge error.\");\n\t\tjob_log(\"Caught exception -> \", e.what());\n\n\t\tupdate_submission(SubmissionStatus::JUDGE_ERROR,\n\t\t                  SubmissionStatus::JUDGE_ERROR, std::nullopt, \"\", \"\");\n\n\t\treturn job_done();\n\t}\n}\n<commit_msg>Hidden checker compilation errors from unprivileged user (they are showed only in the job log)<commit_after>#include \"judge_or_rejudge_job_handler.h\"\n#include \"main.h\"\n\n#include <sim\/submission.h>\n\nvoid JudgeOrRejudgeJobHandler::run() {\n\tSTACK_UNWINDING_MARK;\n\n\t\/\/ Gather the needed information about the submission\n\tauto stmt = mysql.prepare(\"SELECT s.file_id, s.language, s.owner,\"\n\t                          \" contest_problem_id, problem_id, last_judgment,\"\n\t                          \" p.file_id, p.last_edit \"\n\t                          \"FROM submissions s, problems p \"\n\t                          \"WHERE p.id=problem_id AND s.id=?\");\n\tstmt.bindAndExecute(submission_id);\n\tuint64_t submission_file_id, problem_file_id;\n\tuint64_t problem_id;\n\tMySQL::Optional<uint64_t> sowner, contest_problem_id;\n\tInplaceBuff<64> last_judgment, p_last_edit;\n\tEnumVal<SubmissionLanguage> lang;\n\tstmt.res_bind_all(submission_file_id, lang, sowner, contest_problem_id,\n\t                  problem_id, last_judgment, problem_file_id, p_last_edit);\n\t\/\/ If the submission doesn't exist (probably was removed)\n\tif (not stmt.next()) {\n\t\treturn set_failure(\"Failed the job of judging the submission \",\n\t\t                   submission_id,\n\t\t                   \", since there is no such submission.\");\n\t}\n\n\t\/\/ If the problem wasn't modified since last judgment and submission has\n\t\/\/ already been rejudged after the job was created\n\tif (last_judgment > p_last_edit and last_judgment > job_creation_time) {\n\t\t\/\/ Skip the job - the submission has already been rejudged\n\t\treturn job_cancelled(\"Skipped judging of the submission \",\n\t\t                     submission_id,\n\t\t                     \" because it has already been rejudged after this \"\n\t\t                     \"job had been scheduled\");\n\t}\n\n\tstd::string judging_began = mysql_date();\n\n\tjob_log(\"Judging submission \", submission_id, \" (problem: \", problem_id,\n\t        ')');\n\tload_problem_package(internal_file_path(problem_file_id));\n\n\tauto update_submission = [&](SubmissionStatus initial_status,\n\t                             SubmissionStatus full_status,\n\t                             Optional<int64_t> score, auto&& initial_report,\n\t                             auto&& final_report) {\n\t\t{\n\t\t\tauto transaction = mysql.start_transaction();\n\t\t\tsubmission::update_final_lock(mysql, sowner, problem_id);\n\n\t\t\tusing ST = SubmissionType;\n\t\t\t\/\/ Get the submission's ACTUAL type\n\t\t\tstmt = mysql.prepare(\"SELECT type FROM submissions WHERE id=?\");\n\t\t\tstmt.bindAndExecute(submission_id);\n\t\t\tEnumVal<ST> stype;\n\t\t\tstmt.res_bind_all(stype);\n\t\t\tif (not stmt.next())\n\t\t\t\treturn; \/\/ Ignore errors (deleted submission)\n\n\t\t\t\/\/ Update submission\n\t\t\tstmt = mysql.prepare(\"UPDATE submissions \"\n\t\t\t                     \"SET final_candidate=?, initial_status=?,\"\n\t\t\t                     \" full_status=?, score=?, last_judgment=?,\"\n\t\t\t                     \" initial_report=?, final_report=? \"\n\t\t\t                     \"WHERE id=?\");\n\n\t\t\tif (is_fatal(full_status)) {\n\t\t\t\tstmt.bindAndExecute(\n\t\t\t\t   false, (uint)initial_status, (uint)full_status, nullptr,\n\t\t\t\t   judging_began, initial_report, final_report, submission_id);\n\t\t\t} else {\n\t\t\t\tstmt.bindAndExecute((stype == ST::NORMAL and score.has_value()),\n\t\t\t\t                    (uint)initial_status, (uint)full_status,\n\t\t\t\t                    score, judging_began, initial_report,\n\t\t\t\t                    final_report, submission_id);\n\t\t\t}\n\n\t\t\tsubmission::update_final(mysql, sowner, problem_id,\n\t\t\t                         contest_problem_id, false);\n\n\t\t\ttransaction.commit();\n\t\t}\n\t};\n\n\tauto compilation_errors = compile_solution(\n\t   internal_file_path(submission_file_id), to_sol_lang(lang));\n\tif (compilation_errors.has_value()) {\n\t\tupdate_submission(SubmissionStatus::COMPILATION_ERROR,\n\t\t                  SubmissionStatus::COMPILATION_ERROR, std::nullopt,\n\t\t                  concat(\"<pre class=\\\"compilation-errors\\\">\",\n\t\t                         htmlEscape(compilation_errors.value()),\n\t\t                         \"<\/pre>\"),\n\t\t                  \"\");\n\n\t\treturn job_done();\n\t}\n\n\t\/\/ Compile checker\n\tcompilation_errors = compile_checker();\n\tif (compilation_errors.has_value()) {\n\t\terrlog(\"Job \", job_id, \" (submission \", submission_id, \", problem \",\n\t\t       problem_id, \"): Checker compilation failed\");\n\t\tupdate_submission(SubmissionStatus::CHECKER_COMPILATION_ERROR,\n\t\t                  SubmissionStatus::CHECKER_COMPILATION_ERROR,\n\t\t                  std::nullopt, \"\", \"\");\n\n\t\treturn job_done();\n\t}\n\n\tauto send_judge_report = [&, initial_status = SubmissionStatus::OK,\n\t                          initial_report = InplaceBuff<1 << 16>(),\n\t                          initial_score =\n\t                             (int64_t)0](const sim::JudgeReport& jreport,\n\t                                         bool final, bool partial) mutable {\n\t\tauto rep = construct_report(jreport, final);\n\t\tauto status = calc_status(jreport);\n\t\t\/\/ Count score\n\t\tint64_t score = 0;\n\t\tfor (auto&& group : jreport.groups)\n\t\t\tscore += group.score;\n\n\t\t\/\/ Log reports\n\t\tauto job_log_len = job_log_holder.size;\n\t\tjob_log(\"Job \", job_id, \" -> submission \", submission_id, \" (problem \",\n\t\t        problem_id, \")\\n\", (partial ? \"Partial j\" : \"J\"),\n\t\t        \"udge report: \", jreport.judge_log);\n\n\t\tstmt = mysql.prepare(\"UPDATE jobs SET data=? WHERE id=?\");\n\t\tstmt.bindAndExecute(get_log(), job_id);\n\t\tif (partial)\n\t\t\tjob_log_holder.size = job_log_len;\n\n\t\tif (not final) {\n\t\t\tinitial_report = rep;\n\t\t\tinitial_status = status;\n\t\t\tinitial_score = score;\n\t\t\treturn update_submission(status, SubmissionStatus::PENDING,\n\t\t\t                         std::nullopt, rep, \"\");\n\t\t}\n\n\t\t\/\/ Final\n\t\tscore += initial_score;\n\t\t\/\/ If initial tests haven't passed\n\t\tif (initial_status != SubmissionStatus::OK and\n\t\t    status != SubmissionStatus::JUDGE_ERROR) {\n\t\t\tstatus = initial_status;\n\t\t}\n\n\t\tupdate_submission(initial_status, status, score, initial_report, rep);\n\t};\n\n\ttry {\n\t\t\/\/ Judge\n\t\tsim::VerboseJudgeLogger logger(true);\n\n\t\tsim::JudgeReport initial_jrep =\n\t\t   jworker.judge(false, logger, [&](const sim::JudgeReport& partial) {\n\t\t\t   send_judge_report(partial, false, true);\n\t\t   });\n\t\tsend_judge_report(initial_jrep, false, false);\n\n\t\tsim::JudgeReport final_jrep =\n\t\t   jworker.judge(true, logger, [&](const sim::JudgeReport& partial) {\n\t\t\t   send_judge_report(partial, true, true);\n\t\t   });\n\t\tsend_judge_report(final_jrep, true, false);\n\n\t\t\/\/ Log checker errors\n\t\tfor (auto&& rep : {initial_jrep, final_jrep})\n\t\t\tfor (auto&& group : rep.groups)\n\t\t\t\tfor (auto&& test : group.tests)\n\t\t\t\t\tif (test.status == sim::JudgeReport::Test::CHECKER_ERROR) {\n\t\t\t\t\t\terrlog(\"Checker error: submission \", submission_id,\n\t\t\t\t\t\t       \" (problem id: \", problem_id, \") test `\",\n\t\t\t\t\t\t       test.name, '`');\n\t\t\t\t\t}\n\n\t\t\/\/ Log syscall problems (to errlog)\n\t\tfor (auto&& rep : {initial_jrep, final_jrep}) {\n\t\t\tfor (auto&& group : rep.groups) {\n\t\t\t\tfor (auto&& test : group.tests) {\n\t\t\t\t\tif (hasPrefixIn(test.comment,\n\t\t\t\t\t                {\"Runtime error (Error: \",\n\t\t\t\t\t                 \"Runtime error (failed to get syscall\",\n\t\t\t\t\t                 \"Runtime error (forbidden syscall\"})) {\n\t\t\t\t\t\terrlog(\"Submission \", submission_id, \" (problem \",\n\t\t\t\t\t\t       problem_id, \"): \", test.name, \" -> \",\n\t\t\t\t\t\t       test.comment);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn job_done();\n\n\t} catch (const std::exception& e) {\n\t\tERRLOG_CATCH(e);\n\n\t\tjob_log(\"Judge error.\");\n\t\tjob_log(\"Caught exception -> \", e.what());\n\n\t\tupdate_submission(SubmissionStatus::JUDGE_ERROR,\n\t\t                  SubmissionStatus::JUDGE_ERROR, std::nullopt, \"\", \"\");\n\n\t\treturn job_done();\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    This file is part of KOrganizer.\n    Copyright (c) 2001 Cornelius Schumacher <schumacher@kde.org>\n\n    This program is free software; you can redistribute it and\/or modify\n    it under the terms of the GNU General Public License as published by\n    the Free Software Foundation; either version 2 of the License, or\n    (at your option) any later version.\n\n    This program is distributed in the hope that it will be useful,\n    but WITHOUT ANY WARRANTY; without even the implied warranty of\n    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n    GNU General Public License for more details.\n\n    You should have received a copy of the GNU General Public License\n    along with this program; if not, write to the Free Software\n    Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.\n*\/\n\n\/\/ $Id$\n\/\/ Dialog for selecting and configuring the Holiday plugin\n\n#include <qlayout.h>\n#include <qlabel.h>\n#include <qcombobox.h>\n\n#include <klocale.h>\n#include <kmessagebox.h>\n#include <kapplication.h>\n#include <kglobal.h>\n#include <kconfig.h>\n#include <kstandarddirs.h>\n#include <ksimpleconfig.h>\n\n#include \"configdialog.h\"\n#include \"configdialog.moc\"\n\nConfigDialog::ConfigDialog(QWidget *parent)\n  : KDialogBase(Plain,i18n(\"Configure Holidays\"),Ok,Ok,parent)\n{\n  QFrame *topFrame = plainPage();\n  QVBoxLayout *topLayout = new QVBoxLayout(topFrame,0,spacingHint());\n\n  QLabel *label = new QLabel(i18n(\"Please select a holiday set:\"),topFrame);\n  topLayout->addWidget(label);\n\n  mHolidayCombo = new QComboBox(topFrame);\n  topLayout->addWidget(mHolidayCombo);\n\n  load();\n}\n\nConfigDialog::~ConfigDialog()\n{\n}\n\nvoid ConfigDialog::load()\n{\n  KConfig config( locateLocal( \"config\", \"korganizerrc\" ));\n  config.setGroup(\"Calendar\/Holiday Plugin\");\n  QString currentHoliday = config.readEntry(\"Holidays\");\n  QString currentHolidayName;\n\n  QStringList holidayList;\n  QStringList countryList = KGlobal::dirs()->findAllResources(\"data\",\n      \"korganizer\/holiday_*\", false, true);\n  QStringList::ConstIterator it;\n  for ( it = countryList.begin(); it != countryList.end(); ++it ) {\n    QString country = (*it).mid((*it).findRev('_') + 1);\n    QString countryFile = locate(\"locale\",\"l10n\/\" + country + \"\/entry.desktop\");\n    QString countryName;\n    if (!countryFile.isEmpty()) {\n      KSimpleConfig cfg(countryFile);\n      cfg.setGroup(\"KCM Locale\");\n      countryName = cfg.readEntry(\"Name\");\n    }\n    if (countryName.isEmpty()) countryName = country;\n  \n    mCountryMap[countryName] = country;\n    holidayList << countryName;\n\n    if (country == currentHoliday) currentHolidayName = countryName;\n  }\n  holidayList.sort();\n  \n  mHolidayCombo->insertStringList(holidayList);\n    \n  for(int i=0;i<mHolidayCombo->count();++i) {\n    if(mHolidayCombo->text(i) == currentHolidayName) {\n      mHolidayCombo->setCurrentItem(i);\n      break;\n    }\n  }\n}\n\nvoid ConfigDialog::save()\n{\n  QString currentHoliday = mCountryMap[mHolidayCombo->currentText()];\n  KConfig config( locateLocal( \"config\", \"korganizerrc\" ));\n\n  config.setGroup(\"Calendar\/Holiday Plugin\");\n  config.writeEntry(\"Holidays\",currentHoliday);\n  config.sync();\n}\n\nvoid ConfigDialog::slotOk()\n{\n  save();\n\n  accept();\n}\n<commit_msg>Normal dialogbox with Ok and Cancel<commit_after>\/*\n    This file is part of KOrganizer.\n    Copyright (c) 2001 Cornelius Schumacher <schumacher@kde.org>\n\n    This program is free software; you can redistribute it and\/or modify\n    it under the terms of the GNU General Public License as published by\n    the Free Software Foundation; either version 2 of the License, or\n    (at your option) any later version.\n\n    This program is distributed in the hope that it will be useful,\n    but WITHOUT ANY WARRANTY; without even the implied warranty of\n    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n    GNU General Public License for more details.\n\n    You should have received a copy of the GNU General Public License\n    along with this program; if not, write to the Free Software\n    Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.\n*\/\n\n\/\/ Dialog for selecting and configuring the Holiday plugin\n\n#include <qlayout.h>\n#include <qlabel.h>\n#include <qcombobox.h>\n\n#include <klocale.h>\n#include <kmessagebox.h>\n#include <kapplication.h>\n#include <kglobal.h>\n#include <kconfig.h>\n#include <kstandarddirs.h>\n#include <ksimpleconfig.h>\n\n#include \"configdialog.h\"\n#include \"configdialog.moc\"\n\nConfigDialog::ConfigDialog(QWidget *parent)\n  : KDialogBase(Plain,i18n(\"Configure Holidays\"),Ok|Cancel,Ok,parent)\n{\n  QFrame *topFrame = plainPage();\n  QVBoxLayout *topLayout = new QVBoxLayout(topFrame,0,spacingHint());\n\n  QLabel *label = new QLabel(i18n(\"Please select a holiday set:\"),topFrame);\n  topLayout->addWidget(label);\n\n  mHolidayCombo = new QComboBox(topFrame);\n  topLayout->addWidget(mHolidayCombo);\n\n  load();\n}\n\nConfigDialog::~ConfigDialog()\n{\n}\n\nvoid ConfigDialog::load()\n{\n  KConfig config( locateLocal( \"config\", \"korganizerrc\" ));\n  config.setGroup(\"Calendar\/Holiday Plugin\");\n  QString currentHoliday = config.readEntry(\"Holidays\");\n  QString currentHolidayName;\n\n  QStringList holidayList;\n  QStringList countryList = KGlobal::dirs()->findAllResources(\"data\",\n      \"korganizer\/holiday_*\", false, true);\n  QStringList::ConstIterator it;\n  for ( it = countryList.begin(); it != countryList.end(); ++it ) {\n    QString country = (*it).mid((*it).findRev('_') + 1);\n    QString countryFile = locate(\"locale\",\"l10n\/\" + country + \"\/entry.desktop\");\n    QString countryName;\n    if (!countryFile.isEmpty()) {\n      KSimpleConfig cfg(countryFile);\n      cfg.setGroup(\"KCM Locale\");\n      countryName = cfg.readEntry(\"Name\");\n    }\n    if (countryName.isEmpty()) countryName = country;\n\n    mCountryMap[countryName] = country;\n    holidayList << countryName;\n\n    if (country == currentHoliday) currentHolidayName = countryName;\n  }\n  holidayList.sort();\n\n  mHolidayCombo->insertStringList(holidayList);\n\n  for(int i=0;i<mHolidayCombo->count();++i) {\n    if(mHolidayCombo->text(i) == currentHolidayName) {\n      mHolidayCombo->setCurrentItem(i);\n      break;\n    }\n  }\n}\n\nvoid ConfigDialog::save()\n{\n  QString currentHoliday = mCountryMap[mHolidayCombo->currentText()];\n  KConfig config( locateLocal( \"config\", \"korganizerrc\" ));\n\n  config.setGroup(\"Calendar\/Holiday Plugin\");\n  config.writeEntry(\"Holidays\",currentHoliday);\n  config.sync();\n}\n\nvoid ConfigDialog::slotOk()\n{\n  save();\n\n  accept();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <QLabel>\n#include <QWidget>\n#include <QPushButton>\n#include <QHBoxLayout>\n#include <QVBoxLayout>\n#include <QApplication>\n\n#include \"qt_window.hpp\"\n\n#define USERDATA \"\/dev\/disk\/by-partlabel\/userdata\"\n#define NVME \"\/dev\/nvme0n1\"\n\n\nvoid do_reset() {\n  std::system(\"sudo umount \" USERDATA);\n  std::system(\"yes | sudo mkfs.ext4 \" USERDATA);\n  std::system(\"sudo umount \" NVME);\n  std::system(\"yes | sudo mkfs.ext4 \" NVME);\n  std::system(\"sudo reboot\");\n}\n\nint main(int argc, char *argv[]) {\n  QApplication a(argc, argv);\n  QWidget window;\n  setMainWindow(&window);\n\n  QVBoxLayout *layout = new QVBoxLayout();\n  layout->setContentsMargins(125, 125, 125, 125);\n\n  QLabel *title = new QLabel(\"System Reset\");\n  title->setStyleSheet(R\"(\n    font-weight: 500;\n    font-size: 100px;\n  )\");\n  layout->addWidget(title, 0, Qt::AlignTop);\n\n  QLabel *body = new QLabel(\"System reset triggered. Press confirm to erase all content and settings. Press cancel to resume boot.\");\n  body->setWordWrap(true);\n  body->setAlignment(Qt::AlignCenter);\n  body->setStyleSheet(\"font-size: 65px;\");\n  layout->addWidget(body, 1, Qt::AlignCenter);\n\n  QHBoxLayout *btn_layout = new QHBoxLayout();\n\n  QPushButton *cancel_btn = new QPushButton(\"Cancel\");\n  btn_layout->addWidget(cancel_btn, 0, Qt::AlignLeft);\n  QObject::connect(cancel_btn, SIGNAL(released()), &a, SLOT(quit()));\n\n  QPushButton *confirm_btn  = new QPushButton(\"Confirm\");\n  btn_layout->addWidget(confirm_btn, 0, Qt::AlignRight);\n  QObject::connect(confirm_btn, &QPushButton::released, [=]() {\n    const QString confirm_txt = \"Are you sure you want to reset your device?\";\n    if (body->text() != confirm_txt) {\n      body->setText(confirm_txt);\n    } else {\n      body->setText(\"Resetting device...\");\n      cancel_btn->hide();\n      confirm_btn->hide();\n      QCoreApplication::processEvents(QEventLoop::AllEvents, 1000);\n#ifdef __aarch64__\n      do_reset();\n#endif\n    }\n  });\n\n  layout->addLayout(btn_layout);\n\n  window.setLayout(layout);\n  window.setStyleSheet(R\"(\n    * {\n      color: white;\n      background-color: black;\n    }\n    QPushButton {\n      padding: 50px;\n      padding-right: 100px;\n      padding-left: 100px;\n      border: 7px solid white;\n      border-radius: 20px;\n      font-size: 50px;\n    }\n  )\");\n\n  return a.exec();\n}\n<commit_msg>swap factory reset order<commit_after>#include <QLabel>\n#include <QWidget>\n#include <QPushButton>\n#include <QHBoxLayout>\n#include <QVBoxLayout>\n#include <QApplication>\n\n#include \"qt_window.hpp\"\n\n#define USERDATA \"\/dev\/disk\/by-partlabel\/userdata\"\n#define NVME \"\/dev\/nvme0n1\"\n\n\nvoid do_reset() {\n  std::system(\"sudo umount \" NVME);\n  std::system(\"yes | sudo mkfs.ext4 \" NVME);\n  std::system(\"sudo umount \" USERDATA);\n  std::system(\"yes | sudo mkfs.ext4 \" USERDATA);\n  std::system(\"sudo reboot\");\n}\n\nint main(int argc, char *argv[]) {\n  QApplication a(argc, argv);\n  QWidget window;\n  setMainWindow(&window);\n\n  QVBoxLayout *layout = new QVBoxLayout();\n  layout->setContentsMargins(125, 125, 125, 125);\n\n  QLabel *title = new QLabel(\"System Reset\");\n  title->setStyleSheet(R\"(\n    font-weight: 500;\n    font-size: 100px;\n  )\");\n  layout->addWidget(title, 0, Qt::AlignTop);\n\n  QLabel *body = new QLabel(\"System reset triggered. Press confirm to erase all content and settings. Press cancel to resume boot.\");\n  body->setWordWrap(true);\n  body->setAlignment(Qt::AlignCenter);\n  body->setStyleSheet(\"font-size: 65px;\");\n  layout->addWidget(body, 1, Qt::AlignCenter);\n\n  QHBoxLayout *btn_layout = new QHBoxLayout();\n\n  QPushButton *cancel_btn = new QPushButton(\"Cancel\");\n  btn_layout->addWidget(cancel_btn, 0, Qt::AlignLeft);\n  QObject::connect(cancel_btn, SIGNAL(released()), &a, SLOT(quit()));\n\n  QPushButton *confirm_btn  = new QPushButton(\"Confirm\");\n  btn_layout->addWidget(confirm_btn, 0, Qt::AlignRight);\n  QObject::connect(confirm_btn, &QPushButton::released, [=]() {\n    const QString confirm_txt = \"Are you sure you want to reset your device?\";\n    if (body->text() != confirm_txt) {\n      body->setText(confirm_txt);\n    } else {\n      body->setText(\"Resetting device...\");\n      cancel_btn->hide();\n      confirm_btn->hide();\n      QCoreApplication::processEvents(QEventLoop::AllEvents, 1000);\n#ifdef __aarch64__\n      do_reset();\n#endif\n    }\n  });\n\n  layout->addLayout(btn_layout);\n\n  window.setLayout(layout);\n  window.setStyleSheet(R\"(\n    * {\n      color: white;\n      background-color: black;\n    }\n    QPushButton {\n      padding: 50px;\n      padding-right: 100px;\n      padding-left: 100px;\n      border: 7px solid white;\n      border-radius: 20px;\n      font-size: 50px;\n    }\n  )\");\n\n  return a.exec();\n}\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 <alloy\/compiler\/passes\/finalization_pass.h>\n\n#include <alloy\/backend\/backend.h>\n#include <alloy\/compiler\/compiler.h>\n#include <alloy\/runtime\/runtime.h>\n\nusing namespace alloy;\nusing namespace alloy::backend;\nusing namespace alloy::compiler;\nusing namespace alloy::compiler::passes;\nusing namespace alloy::frontend;\nusing namespace alloy::hir;\nusing namespace alloy::runtime;\n\n\nFinalizationPass::FinalizationPass() :\n    CompilerPass() {\n}\n\nFinalizationPass::~FinalizationPass() {\n}\n\nint FinalizationPass::Run(HIRBuilder* builder) {\n  \/\/ Process the HIR and prepare it for lowering.\n  \/\/ After this is done the HIR should be ready for emitting.\n\n  auto arena = builder->arena();\n\n  uint32_t block_ordinal = 0;\n  auto block = builder->first_block();\n  while (block) {\n    block->ordinal = block_ordinal++;\n\n    \/\/ Ensure all labels have names.\n    auto label = block->label_head;\n    while (label) {\n      if (!label->name) {\n        char* name = (char*)arena->Alloc(6 + 4 + 1);\n        xestrcpya(name, 6 + 1, \"_label\");\n        char* part = _itoa(label->id, name + 6, 10);\n        label->name = name;\n      }\n      label = label->next;\n    }\n\n    \/\/ ? remove useless jumps?\n\n    \/\/ Renumber all instructions to make liveness tracking easier.\n    uint32_t instr_ordinal = 0;\n    auto instr = block->instr_head;\n    while (instr) {\n      instr->ordinal = instr_ordinal++;\n      instr = instr->next;\n    }\n\n    block = block->next;\n  }\n\n  return 0;\n}\n<commit_msg>Removing block continuation branches.<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 <alloy\/compiler\/passes\/finalization_pass.h>\n\n#include <alloy\/backend\/backend.h>\n#include <alloy\/compiler\/compiler.h>\n#include <alloy\/runtime\/runtime.h>\n\nusing namespace alloy;\nusing namespace alloy::backend;\nusing namespace alloy::compiler;\nusing namespace alloy::compiler::passes;\nusing namespace alloy::frontend;\nusing namespace alloy::hir;\nusing namespace alloy::runtime;\n\n\nFinalizationPass::FinalizationPass() :\n    CompilerPass() {\n}\n\nFinalizationPass::~FinalizationPass() {\n}\n\nint FinalizationPass::Run(HIRBuilder* builder) {\n  \/\/ Process the HIR and prepare it for lowering.\n  \/\/ After this is done the HIR should be ready for emitting.\n\n  auto arena = builder->arena();\n\n  uint32_t block_ordinal = 0;\n  auto block = builder->first_block();\n  while (block) {\n    block->ordinal = block_ordinal++;\n\n    \/\/ Ensure all labels have names.\n    auto label = block->label_head;\n    while (label) {\n      if (!label->name) {\n        char* name = (char*)arena->Alloc(6 + 4 + 1);\n        xestrcpya(name, 6 + 1, \"_label\");\n        char* part = _itoa(label->id, name + 6, 10);\n        label->name = name;\n      }\n      label = label->next;\n    }\n\n    \/\/ Remove unneeded jumps.\n    auto tail = block->instr_tail;\n    if (tail && tail->opcode == &OPCODE_BRANCH_info) {\n      \/\/ Jump. Check target.\n      auto target = tail->src1.label;\n      if (target->block == block->next) {\n        \/\/ Jumping to subsequent block. Remove.\n        tail->Remove();\n      }\n    }\n\n    \/\/ Renumber all instructions to make liveness tracking easier.\n    uint32_t instr_ordinal = 0;\n    auto instr = block->instr_head;\n    while (instr) {\n      instr->ordinal = instr_ordinal++;\n      instr = instr->next;\n    }\n\n    block = block->next;\n  }\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Fix regression in query handling in slurp mode.<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"api\/Api.h\"\n#include \"plugin\/Plugin.h\"\n#include \"Vector.h\"\n\n#undef max\n\n#include <iostream>\n#include <memory>\n#include <thread>\n\nnamespace {\n\n\/\/ List of friends to join if they are on a private frequency\nconst std::vector<std::string> Friends = { \"taz\", \"kirino\", \"obama\" };\n\/\/ Password for the private frequency\nconst std::string Password = \"mmmm\";\n\n}\n\nbool InRect(Vec2 pos, Vec2 min_rect, Vec2 max_rect) {\n    return ((pos.x >= min_rect.x && pos.y >= min_rect.y) &&\n            (pos.x <= max_rect.x && pos.y <= max_rect.y));\n}\n\nclass HyperspaceSelector : public api::Selector {\npublic:\n    std::shared_ptr<api::Player> Select(api::Bot* bot) {\n        ClientPtr client = bot->GetClient();\n\n        std::vector<api::PlayerPtr> enemies = client->GetEnemies();\n\n        if (enemies.size() == 0) return api::PlayerPtr(nullptr);\n\n        \/\/ Distance of closest enemy with multiplier applied\n        double closest_calc_dist = std::numeric_limits<double>::max();\n        api::PlayerPtr closest = api::PlayerPtr(nullptr);\n        \/\/ Determines how much the rotation difference will increase distance by\n        const double RotationMultiplier = 2.25;\n\n        Vec2 bot_pos = bot->GetPos();\n        bool has_x = (bot->GetMemorySensor().GetBotPlayer()->GetStatus() & 4) != 0;\n        Vec2 half_resolution = Vec2(1920, 1080) \/ 2;\n        Vec2 view_min = bot_pos - half_resolution \/ 16;\n        Vec2 view_max = bot_pos + half_resolution \/ 16;\n\n        Vec2 spawn(512, 512);\n        const int center_radius = 512 - 320;\n\n        bool center_only = InRect(bot->GetPos(), spawn - center_radius, spawn + center_radius);\n\n        for (unsigned int i = 0; i < enemies.size(); ++i) {\n            api::PlayerPtr& enemy = enemies.at(i);\n            Vec2 enemy_pos = enemy->GetPosition() \/ 16;\n            \n            if (enemy_pos.x <= 0 && enemy_pos.y <= 0) continue;\n            if (client->IsInSafe(enemy_pos, bot->GetLevel())) continue;\n\n            double cdist = bot_pos.Distance(enemy_pos);\n\n            if (cdist < 15 && bot->IsInSafe()) continue;\n\n            bool in_center = InRect(enemy_pos, spawn - center_radius, spawn + center_radius);\n            bool in_mini = InRect(enemy_pos, Vec2(460, 613), Vec2(534, 670));\n            if ((center_only && !in_center) || in_mini) continue;\n\n            unsigned char status = enemy->GetStatus();\n            bool stealth = (status & 1) != 0;\n            bool cloak = (status & 2) != 0;\n\n            if (!has_x) {\n                if (stealth && cloak) continue;\n                bool visible = InRect(enemy_pos, view_min, view_max);\n\n                if (stealth && !visible) continue;\n            }\n\n            \/\/ Unit vector pointing towards this enemy\n            Vec2 to_target = Vec2Normalize(enemy_pos - bot_pos);\n            double dot = bot->GetHeading().Dot(to_target);\n            double multiplier = 1.0 + ((1.0 - dot) \/ RotationMultiplier);\n            double calc_dist = cdist * multiplier;\n\n            if (calc_dist < closest_calc_dist) {\n                closest_calc_dist = calc_dist;\n                closest = enemy;\n            }\n        }\n\n        return closest;\n    }\n};\n\nclass PrivateFrequencyEnforcer {\nprivate:\n    api::Bot* m_Bot;\n    bool m_JoinFriends;\n    bool m_Override;\n\n    api::PlayerPtr FindFriend() {\n        api::PlayerList players = m_Bot->GetMemorySensor().GetPlayers();\n        api::PlayerList::iterator iter;\n        \n        for (iter = players.begin(); iter != players.end(); ++iter) {\n            api::PlayerPtr player = *iter;\n            std::string name = player->GetName();\n\n            if (player->GetShip() == api::Ship::Spectator || player->GetFreq() < 100) continue;\n\n            for (std::string f : Friends) {\n                if (f.compare(name) == 0)\n                    return player;\n            }\n        }\n\n        return nullptr;\n    }\n\n    bool GetFullEnergy() {\n        using namespace std;\n        using namespace api;\n\n        if (!m_Bot->IsInSafe()) return false;\n\n        shared_ptr<Client> client = m_Bot->GetClient();\n\n        client->SetXRadar(false);\n        client->Gun(GunState::Tap);\n\n        while (!m_Bot->FullEnergy()) {\n            client->Update(100);\n            std::this_thread::sleep_for(std::chrono::milliseconds(100));\n        }\n        return true;\n    }\n\n    bool JoinPriv() {\n        using namespace std;\n        using namespace api;\n\n        shared_ptr<Client> client = m_Bot->GetClient();\n\n        if (!GetFullEnergy()) return false;\n\n        client->SendString(\"?createpriv \" + Password);\n        std::this_thread::sleep_for(std::chrono::milliseconds(500));\n\n        return true;\n    }\n\n    bool JoinFriend(api::PlayerPtr target) {\n        using namespace std;\n        using namespace api;\n\n        shared_ptr<Client> client = m_Bot->GetClient();\n\n        if (!GetFullEnergy()) return false;\n\n        if (target) {\n            client->SendPM(target->GetName(), \"?join \" + Password);\n            std::this_thread::sleep_for(std::chrono::milliseconds(500));\n        }\n\n        return target != nullptr;\n    }\n\n    std::size_t GetFreqSize() {\n        using namespace std;\n        using namespace api;\n\n        PlayerList freq_players = m_Bot->GetClient()->GetFreqPlayers(m_Bot->GetFreq());\n\n        freq_players.erase(remove_if(freq_players.begin(), freq_players.end(), [](PlayerPtr player) {\n            return player->GetName().at(0) == '<';\n        }), freq_players.end());\n\n        return freq_players.size();\n    }\n\n    \/\/ Gets the enemy freqs\n    std::map<int, api::PlayerList> GetEnemyFreqs() {\n        using namespace std;\n        using namespace api;\n\n        PlayerList players = m_Bot->GetMemorySensor().GetPlayers();\n        unsigned int freq = m_Bot->GetFreq();\n\n        players.erase(remove_if(players.begin(), players.end(), [&](PlayerPtr player) {\n            bool own_team = player->GetFreq() == freq;\n            bool fake = player->GetName().at(0) == '<';\n            bool in_spec = player->GetShip() == Ship::Spectator;\n            bool flagging = player->GetFreq() == 90 || player->GetFreq() == 91;\n\n            return own_team || fake || in_spec || flagging;\n        }), players.end());\n        \n        std::map<int, PlayerList> freqs;\n        for (PlayerPtr player : players)\n            freqs[player->GetFreq()].push_back(player);\n\n        return freqs;\n    }\n\n    void UpdateJoinFriends() {\n        if (m_Override) return;\n\n        std::map<int, api::PlayerList> freqs = GetEnemyFreqs();\n        std::size_t freq_count = freqs.size();\n\n        for (auto& kv : freqs) {\n            if (kv.second.size() >= 3) {\n                m_JoinFriends = true;\n                return;\n            }\n        }\n        m_JoinFriends = false;\n    }\n\npublic:\n    PrivateFrequencyEnforcer(api::Bot* bot)\n        : m_Bot(bot), m_JoinFriends(false), m_Override(true)\n    {\n\n    }\n\n    void SetJoinFriends(bool v) { m_JoinFriends = v; }\n    bool GetJoinFriends() const { return m_JoinFriends; }\n\n    void SetOverride(bool v) { m_Override = v; }\n    bool GetOverride() const { return m_Override; }\n\n    \n    void OnUpdate(unsigned long dt) {\n        using namespace std;\n        using namespace api;\n\n        shared_ptr<Client> client = m_Bot->GetClient();\n        unsigned int freq = m_Bot->GetFreq();\n        Ship ship = m_Bot->GetMemorySensor().GetBotPlayer()->GetShip();\n\n        if (ship == Ship::Spectator || !m_Bot->IsInSafe()) return;\n\n        if (!GetOverride())\n            UpdateJoinFriends();\n\n        if (m_JoinFriends) {\n            size_t freq_size = GetFreqSize();\n            \n            if (freq_size == 1 || freq < 100) {\n                api::PlayerPtr target = FindFriend();\n                if (target)\n                    JoinFriend(target);\n                else if (!target && freq < 100)\n                    JoinPriv();\n            }\n        } else {\n            size_t freq_size = GetFreqSize();\n            \n            if (freq_size > 1 || freq < 100)\n                JoinPriv();\n        }\n    }\n};\n\nclass JoinFriendsCommand : public api::Command {\nprivate:\n    std::shared_ptr<PrivateFrequencyEnforcer> m_PrivEnforcer;\n\npublic:\n    JoinFriendsCommand(std::shared_ptr<PrivateFrequencyEnforcer> enforcer)\n        : m_PrivEnforcer(enforcer)\n    {\n\n    }\n\n    std::string GetHelp() const { return \"Toggles whether or not this bot joins private frequencies of other bots.\"; }\n    std::string GetPermission() const { return \"hyperspace.joinfriends\"; }\n\n    void Invoke(api::Bot* bot, const std::string& sender, const std::string& args) {\n        bool join = !m_PrivEnforcer->GetJoinFriends();\n\n        if (!args.empty()) {\n            if (args[0] == 't' || args[0] == 'T')\n                join = true;\n            else if (args[0] == 'f' || args[0] == 'F')\n                join = false;\n\n            m_PrivEnforcer->SetOverride(true);\n        } else {\n            m_PrivEnforcer->SetOverride(false);\n        }\n\n        m_PrivEnforcer->SetJoinFriends(join);\n\n        std::cout << \"Join friends: \" << std::boolalpha << join << std::endl;\n    }\n};\n\nclass HyperspacePlugin : public Plugin {\nprivate:\n    api::Bot* m_Bot;\n    std::shared_ptr<HyperspaceSelector> m_Selector;\n    std::shared_ptr<PrivateFrequencyEnforcer> m_PrivEnforcer;\n\npublic:\n    HyperspacePlugin(api::Bot* bot)\n        : m_Bot(bot),\n          m_Selector(new HyperspaceSelector()),\n          m_PrivEnforcer(new PrivateFrequencyEnforcer(m_Bot))\n    {\n    }\n\n    int OnCreate() {\n        m_Bot->GetCommandHandler().RegisterCommand(\"joinfriends\", api::CommandPtr(new JoinFriendsCommand(m_PrivEnforcer)));\n        return 0;\n    }\n\n    int OnUpdate(unsigned long dt) {\n        \/\/m_Bot->SetEnemySelector(m_Selector);\n        m_PrivEnforcer->OnUpdate(dt);\n\n        return 0;\n    }\n\n    int OnDestroy() {\n       \/\/ auto factory = m_Bot->GetEnemySelectors();\n       \/\/ m_Bot->SetEnemySelector(factory->CreateClosest());\n        m_Bot->GetCommandHandler().UnregisterCommand(\"joinfriends\");\n        return 0;\n    }\n\n};\n\nextern \"C\" {\n    PLUGIN_FUNC Plugin* CreatePlugin(api::Bot* bot) {\n        return new HyperspacePlugin(bot);\n    }\n\n    PLUGIN_FUNC void DestroyPlugin(Plugin* plugin) {\n        delete plugin;\n    }\n\n    PLUGIN_FUNC const char* GetPluginName() {\n        return \"Hyperspace\";\n    }\n}\n<commit_msg>Update hyperspace plugin to allow for flagging.<commit_after>#include \"api\/Api.h\"\n#include \"plugin\/Plugin.h\"\n#include \"Vector.h\"\n#include \"Tokenizer.h\"\n\n\/**\n * This has barely been tested. It might cause crashes or do random bad things.\n *\n * Flagging probably requires CenterOnly in config to be false.\n * This plugin doesn't alter the config yet, so it needs to be done before turning on flagging.\n *\/\n\n#undef max\n\n#include <iostream>\n#include <memory>\n#include <thread>\n#include <regex>\n\nnamespace {\n\n\/\/ List of friends to join if they are on a private frequency\nconst std::vector<std::string> Friends = { \"taz\", \"kirino\", \"obama\" };\n\/\/ Password for the private frequency\nconst std::string Password = \"mmmm\";\n\n}\n\nbool InRect(Vec2 pos, Vec2 min_rect, Vec2 max_rect) {\n    return ((pos.x >= min_rect.x && pos.y >= min_rect.y) &&\n            (pos.x <= max_rect.x && pos.y <= max_rect.y));\n}\n\nclass HyperspaceSelector : public api::Selector {\npublic:\n    std::shared_ptr<api::Player> Select(api::Bot* bot) {\n        ClientPtr client = bot->GetClient();\n\n        std::vector<api::PlayerPtr> enemies = client->GetEnemies();\n\n        if (enemies.size() == 0) return api::PlayerPtr(nullptr);\n\n        \/\/ Distance of closest enemy with multiplier applied\n        double closest_calc_dist = std::numeric_limits<double>::max();\n        api::PlayerPtr closest = api::PlayerPtr(nullptr);\n        \/\/ Determines how much the rotation difference will increase distance by\n        const double RotationMultiplier = 2.25;\n\n        Vec2 bot_pos = bot->GetPos();\n        bool has_x = (bot->GetMemorySensor().GetBotPlayer()->GetStatus() & 4) != 0;\n        Vec2 half_resolution = Vec2(1920, 1080) \/ 2;\n        Vec2 view_min = bot_pos - half_resolution \/ 16;\n        Vec2 view_max = bot_pos + half_resolution \/ 16;\n\n        Vec2 spawn(512, 512);\n        const int center_radius = 512 - 320;\n\n        bool center_only = InRect(bot->GetPos(), spawn - center_radius, spawn + center_radius);\n\n        for (unsigned int i = 0; i < enemies.size(); ++i) {\n            api::PlayerPtr& enemy = enemies.at(i);\n            Vec2 enemy_pos = enemy->GetPosition() \/ 16;\n            \n            if (enemy_pos.x <= 0 && enemy_pos.y <= 0) continue;\n            if (client->IsInSafe(enemy_pos, bot->GetLevel())) continue;\n\n            double cdist = bot_pos.Distance(enemy_pos);\n\n            if (cdist < 15 && bot->IsInSafe()) continue;\n\n            bool in_center = InRect(enemy_pos, spawn - center_radius, spawn + center_radius);\n            bool in_mini = InRect(enemy_pos, Vec2(460, 613), Vec2(534, 670));\n            if ((center_only && !in_center) || in_mini) continue;\n\n            unsigned char status = enemy->GetStatus();\n            bool stealth = (status & 1) != 0;\n            bool cloak = (status & 2) != 0;\n\n            if (!has_x) {\n                if (stealth && cloak) continue;\n                bool visible = InRect(enemy_pos, view_min, view_max);\n\n                if (stealth && !visible) continue;\n            }\n\n            \/\/ Unit vector pointing towards this enemy\n            Vec2 to_target = Vec2Normalize(enemy_pos - bot_pos);\n            double dot = bot->GetHeading().Dot(to_target);\n            double multiplier = 1.0 + ((1.0 - dot) \/ RotationMultiplier);\n            double calc_dist = cdist * multiplier;\n\n            if (calc_dist < closest_calc_dist) {\n                closest_calc_dist = calc_dist;\n                closest = enemy;\n            }\n        }\n\n        return closest;\n    }\n};\n\nclass PrivateFrequencyEnforcer {\nprivate:\n    api::Bot* m_Bot;\n    bool m_JoinFriends;\n    bool m_Override;\n\n    api::PlayerPtr FindFriend() {\n        api::PlayerList players = m_Bot->GetMemorySensor().GetPlayers();\n        api::PlayerList::iterator iter;\n        \n        for (iter = players.begin(); iter != players.end(); ++iter) {\n            api::PlayerPtr player = *iter;\n            std::string name = player->GetName();\n\n            if (player->GetShip() == api::Ship::Spectator || player->GetFreq() < 100) continue;\n\n            for (std::string f : Friends) {\n                if (f.compare(name) == 0)\n                    return player;\n            }\n        }\n\n        return nullptr;\n    }\n\n    bool GetFullEnergy() {\n        using namespace std;\n        using namespace api;\n\n        if (!m_Bot->IsInSafe()) return false;\n\n        shared_ptr<Client> client = m_Bot->GetClient();\n\n        client->SetXRadar(false);\n        client->Gun(GunState::Tap);\n\n        while (!m_Bot->FullEnergy()) {\n            client->Update(100);\n            std::this_thread::sleep_for(std::chrono::milliseconds(100));\n        }\n        return true;\n    }\n\n    bool JoinPriv() {\n        using namespace std;\n        using namespace api;\n\n        shared_ptr<Client> client = m_Bot->GetClient();\n\n        if (!GetFullEnergy()) return false;\n\n        client->SendString(\"?createpriv \" + Password);\n        std::this_thread::sleep_for(std::chrono::milliseconds(500));\n\n        return true;\n    }\n\n    bool JoinFriend(api::PlayerPtr target) {\n        using namespace std;\n        using namespace api;\n\n        shared_ptr<Client> client = m_Bot->GetClient();\n\n        if (!GetFullEnergy()) return false;\n\n        if (target) {\n            client->SendPM(target->GetName(), \"?join \" + Password);\n            std::this_thread::sleep_for(std::chrono::milliseconds(500));\n        }\n\n        return target != nullptr;\n    }\n\n    std::size_t GetFreqSize() {\n        using namespace std;\n        using namespace api;\n\n        PlayerList freq_players = m_Bot->GetClient()->GetFreqPlayers(m_Bot->GetFreq());\n\n        freq_players.erase(remove_if(freq_players.begin(), freq_players.end(), [](PlayerPtr player) {\n            return player->GetName().at(0) == '<';\n        }), freq_players.end());\n\n        return freq_players.size();\n    }\n\n    \/\/ Gets the enemy freqs\n    std::map<int, api::PlayerList> GetEnemyFreqs() {\n        using namespace std;\n        using namespace api;\n\n        PlayerList players = m_Bot->GetMemorySensor().GetPlayers();\n        unsigned int freq = m_Bot->GetFreq();\n\n        players.erase(remove_if(players.begin(), players.end(), [&](PlayerPtr player) {\n            bool own_team = player->GetFreq() == freq;\n            bool fake = player->GetName().at(0) == '<';\n            bool in_spec = player->GetShip() == Ship::Spectator;\n            bool flagging = player->GetFreq() == 90 || player->GetFreq() == 91;\n\n            return own_team || fake || in_spec || flagging;\n        }), players.end());\n        \n        std::map<int, PlayerList> freqs;\n        for (PlayerPtr player : players)\n            freqs[player->GetFreq()].push_back(player);\n\n        return freqs;\n    }\n\n    void UpdateJoinFriends() {\n        if (m_Override) return;\n\n        std::map<int, api::PlayerList> freqs = GetEnemyFreqs();\n        std::size_t freq_count = freqs.size();\n\n        for (auto& kv : freqs) {\n            if (kv.second.size() >= 3) {\n                m_JoinFriends = true;\n                return;\n            }\n        }\n        m_JoinFriends = false;\n    }\n\npublic:\n    PrivateFrequencyEnforcer(api::Bot* bot)\n        : m_Bot(bot), m_JoinFriends(false), m_Override(true)\n    {\n\n    }\n\n    void SetJoinFriends(bool v) { m_JoinFriends = v; }\n    bool GetJoinFriends() const { return m_JoinFriends; }\n\n    void SetOverride(bool v) { m_Override = v; }\n    bool GetOverride() const { return m_Override; }\n\n    \n    void OnUpdate(unsigned long dt) {\n        using namespace std;\n        using namespace api;\n\n        shared_ptr<Client> client = m_Bot->GetClient();\n        unsigned int freq = m_Bot->GetFreq();\n        Ship ship = m_Bot->GetMemorySensor().GetBotPlayer()->GetShip();\n\n        if (ship == Ship::Spectator || !m_Bot->IsInSafe()) return;\n\n        if (!GetOverride())\n            UpdateJoinFriends();\n\n        if (m_JoinFriends) {\n            size_t freq_size = GetFreqSize();\n            \n            if (freq_size == 1 || freq < 100) {\n                api::PlayerPtr target = FindFriend();\n                if (target)\n                    JoinFriend(target);\n                else if (!target && freq < 100)\n                    JoinPriv();\n            }\n        } else {\n            size_t freq_size = GetFreqSize();\n            \n            if (freq_size > 1 || freq < 100)\n                JoinPriv();\n        }\n    }\n};\n\nclass JoinFriendsCommand : public api::Command {\nprivate:\n    std::shared_ptr<PrivateFrequencyEnforcer> m_PrivEnforcer;\n\npublic:\n    JoinFriendsCommand(std::shared_ptr<PrivateFrequencyEnforcer> enforcer)\n        : m_PrivEnforcer(enforcer)\n    {\n\n    }\n\n    std::string GetHelp() const { return \"Toggles whether or not this bot joins private frequencies of other bots.\"; }\n    std::string GetPermission() const { return \"hyperspace.joinfriends\"; }\n\n    void Invoke(api::Bot* bot, const std::string& sender, const std::string& args) {\n        bool join = !m_PrivEnforcer->GetJoinFriends();\n\n        if (!args.empty()) {\n            if (args[0] == 't' || args[0] == 'T')\n                join = true;\n            else if (args[0] == 'f' || args[0] == 'F')\n                join = false;\n\n            m_PrivEnforcer->SetOverride(true);\n        } else {\n            m_PrivEnforcer->SetOverride(false);\n        }\n\n        m_PrivEnforcer->SetJoinFriends(join);\n\n        std::cout << \"Join friends: \" << std::boolalpha << join << std::endl;\n    }\n};\n\nclass AnchorSelector {\nprivate:\n    const unsigned long SendDelay = 1000 * 30;\n    const unsigned long LancsTimeout = 7500;\n    const unsigned long AnchorSyncTime = 1000;\n\n    api::Bot* m_Bot;\n    unsigned long m_SendTimer;\n    unsigned long m_AttachCheckTimer;\n    std::vector<std::string> m_Lancs;\n    std::vector<std::string> m_Evokers;\n    std::weak_ptr<api::Player> m_PrevAnchor;\n\n    void UpdateAnchors(const std::string& line) {\n        std::string regex_str = R\"::(^\\s*\\(S|E\\) (.+)$)::\";\n\n        int ship_num = (int)m_Bot->GetShip() + 1;\n        if (ship_num > 6 || ship_num == 3 || ship_num == 4)\n            regex_str = R\"::(^\\s*\\(S\\) (.+)$)::\";\n\n        std::regex summoner_regex(regex_str);\n        Util::Tokenizer tokenizer(line);\n\n        tokenizer(',');\n\n        for (const std::string& anchor : tokenizer) {\n            std::sregex_iterator begin(anchor.begin(), anchor.end(), summoner_regex);\n            std::sregex_iterator end;\n\n            if (begin != end) {\n                size_t pos = anchor.find(\"(S)\");\n                if (pos != std::string::npos) {\n                    m_Lancs.emplace_back(anchor.substr(anchor.find(\"(S) \") + 4));\n                    continue;\n                }\n\n                pos = anchor.find(\"(E)\");\n                if (pos == std::string::npos) continue;\n                m_Evokers.emplace_back(anchor.substr(anchor.find(\"(E) \") + 4));\n            }\n        }\n    }\n\n    api::PlayerPtr GetPlayerByName(const std::string& name) const {\n        api::PlayerList players = m_Bot->GetMemorySensor().GetPlayers();\n\n        auto iter = std::find_if(players.begin(), players.end(), [&](api::PlayerPtr player) -> bool {\n            return player->GetName().compare(name) == 0;\n        });\n\n        if (iter == players.end())\n            return nullptr;\n        return *iter;\n    }\n\n    bool IsLanc(api::PlayerPtr player) const {\n        return player->GetShip() == api::Ship::Lancaster;\n    }\n\n    bool IsEvoker(api::PlayerPtr player) const {\n        return (player->GetShip() == api::Ship::Spider || player->GetShip() == api::Ship::Leviathan);\n    }\n\npublic:\n    AnchorSelector(api::Bot* bot) : m_Bot(bot), m_SendTimer(0), m_AttachCheckTimer(0), m_PrevAnchor() { }\n\n    api::PlayerPtr GetAnchor() {\n        api::PlayerPtr anchor;\n\n        \/\/ Do evokers before lancs so lancs have priority\n        for (const std::string& evoker : m_Evokers) {\n            api::PlayerPtr player = GetPlayerByName(evoker);\n            if (player && IsEvoker(player)) {\n                anchor = player;\n                break;\n            }\n        }\n\n        for (const std::string& lanc : m_Lancs) {\n            api::PlayerPtr player = GetPlayerByName(lanc);\n            if (player && IsLanc(player)) {\n                anchor = player;\n                break;\n            }\n        }\n\n        if (!anchor) {\n            api::PlayerPtr prev = m_PrevAnchor.lock();\n            \/\/ Only attach to previous anchor if they are still viable anchor\n            if (prev && prev->GetFreq() == m_Bot->GetFreq() && (IsLanc(prev) || IsEvoker(prev)))\n                anchor = prev;\n        } else {\n            m_PrevAnchor = anchor;\n        }\n\n        return anchor;\n    }\n\n    void ForceSend() {\n        m_SendTimer = SendDelay;\n    }\n\n    void OnUpdate(unsigned long dt) {\n        m_SendTimer += dt;\n\n        if (m_SendTimer >= SendDelay) {\n            std::cout << \"Sending ?lancs\" << std::endl;\n            m_Bot->GetClient()->SendString(\"?lancs\");\n            m_Lancs.clear();\n            m_Evokers.clear();\n            m_SendTimer = 0;\n        }\n\n        api::PlayerPtr anchor = m_PrevAnchor.lock();\n\n        if (anchor && m_Bot->GetEnergyPercent() > 0) {\n            Vec2 botPos = m_Bot->GetMemorySensor().GetBotPlayer()->GetPosition();\n            Vec2 anchorPos = anchor->GetPosition();\n\n            \/\/ Detach bot from anchor if position has been in sync for some time\n            if (botPos == anchorPos && botPos != Vec2(0, 0)) {\n                m_AttachCheckTimer += dt;\n\n                if (m_AttachCheckTimer >= AnchorSyncTime) {\n                    m_Bot->GetClient()->Attach();\n                    m_AttachCheckTimer = 0;\n                }\n            }\n        }\n    }\n\n    void OnChatMessage(ChatMessage* mesg) {\n        if (mesg->GetType() == ChatMessage::Type::Arena && (m_Lancs.size() == 0 && m_Evokers.size() == 0) && m_SendTimer < LancsTimeout)\n            UpdateAnchors(mesg->GetMessage());\n    }\n};\n\nclass HyperspacePlugin;\n\nclass FlagCommand : public api::Command {\nprivate:\n    HyperspacePlugin* m_Plugin;\n\npublic:\n    FlagCommand(HyperspacePlugin* plugin) : m_Plugin(plugin) {\n\n    }\n\n    std::string GetHelp() const { return \"Makes the bot type ?flag and sets certain config options to make it work for flagging in hyperspace.\"; }\n    std::string GetPermission() const { return \"default.flag\"; }\n    void Invoke(api::Bot* bot, const std::string& sender, const std::string& args);\n};\n\nclass HyperspacePlugin : public Plugin {\nprivate:\n    api::Bot* m_Bot;\n    std::shared_ptr<HyperspaceSelector> m_Selector;\n    std::shared_ptr<PrivateFrequencyEnforcer> m_PrivEnforcer;\n    AnchorSelector m_AnchorSelector;\n    bool m_Flagging;\n\n    bool IsFlagging() const {\n        return m_Bot->GetFreq() == 90 || m_Bot->GetFreq() == 91;\n    }\n\npublic:\n    HyperspacePlugin(api::Bot* bot)\n        : m_Bot(bot),\n          m_Selector(new HyperspaceSelector()),\n          m_PrivEnforcer(new PrivateFrequencyEnforcer(m_Bot)),\n          m_Flagging(false),\n          m_AnchorSelector(m_Bot)\n    {\n    }\n\n    bool IsFlaggingEnabled() const { return m_Flagging; }\n\n    void StartFlagging() {\n        ClientPtr client = m_Bot->GetClient();\n\n        m_Flagging = true;\n\n        client->ReleaseKeys();\n        client->SetXRadar(false);\n        while (!m_Bot->FullEnergy()) {\n            std::this_thread::sleep_for(std::chrono::milliseconds(100));\n            client->Update(100);\n        }\n        client->SendString(\"?flag\", false);\n\n        std::this_thread::sleep_for(std::chrono::milliseconds(750));\n        m_AnchorSelector.ForceSend();\n\n    }\n\n    void StopFlagging() {\n        ClientPtr client = m_Bot->GetClient();\n\n        m_Flagging = false;\n\n        client->ReleaseKeys();\n        client->SetXRadar(false);\n        while (!m_Bot->FullEnergy()) {\n            std::this_thread::sleep_for(std::chrono::milliseconds(100));\n            client->Update(100);\n        }\n\n        client->Spec();\n\n    }\n\n    int OnCreate() {\n        m_Bot->GetCommandHandler().RegisterCommand(\"joinfriends\", api::CommandPtr(new JoinFriendsCommand(m_PrivEnforcer)));\n        m_Bot->GetCommandHandler().RegisterCommand(\"flag\", api::CommandPtr(new FlagCommand(this)));\n        return 0;\n    }\n\n    int OnUpdate(unsigned long dt) {\n        if (!m_Flagging)\n            m_PrivEnforcer->OnUpdate(dt);\n        else\n            m_AnchorSelector.OnUpdate(dt);\n\n        if (m_Flagging && !IsFlagging() && m_Bot->IsInSafe())\n            StartFlagging();\n\n        if (m_Flagging && m_Bot->IsInSafe()) {\n            api::PlayerPtr anchor = m_AnchorSelector.GetAnchor();\n\n            if (anchor)\n                m_Bot->SetAttachTarget(anchor->GetName());\n            else\n                m_Bot->SetAttachTarget(\"\");\n\n            auto stateType = m_Bot->GetState()->GetType();\n            if (stateType != api::StateType::AttachState)\n                m_Bot->SetState(api::StateType::AttachState);\n        }\n\n        return 0;\n    }\n\n    int OnDestroy() {\n        m_Bot->GetCommandHandler().UnregisterCommand(\"joinfriends\");\n        m_Bot->GetCommandHandler().UnregisterCommand(\"flag\");\n        return 0;\n    }\n\n    void OnChatMessage(ChatMessage* mesg) {\n        m_AnchorSelector.OnChatMessage(mesg);\n    }\n};\n\nvoid FlagCommand::Invoke(api::Bot* bot, const std::string& sender, const std::string& args) {\n    ClientPtr client = bot->GetClient();\n    bool flagging = !m_Plugin->IsFlaggingEnabled();\n\n    std::cout << \"Flagging: \" << std::boolalpha << flagging << std::endl;\n\n    if (flagging)\n        m_Plugin->StartFlagging();\n    else\n        m_Plugin->StopFlagging();\n\n}\n\nextern \"C\" {\n    PLUGIN_FUNC Plugin* CreatePlugin(api::Bot* bot) {\n        return new HyperspacePlugin(bot);\n    }\n\n    PLUGIN_FUNC void DestroyPlugin(Plugin* plugin) {\n        delete plugin;\n    }\n\n    PLUGIN_FUNC const char* GetPluginName() {\n        return \"Hyperspace\";\n    }\n}\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 \"SkBenchmark.h\"\n#include \"SkRandom.h\"\n#include \"SkTSort.h\"\n#include \"SkString.h\"\n\nstatic void rand_proc(int array[], int count) {\n    SkRandom rand;\n    for (int i = 0; i < count; ++i) {\n        array[i] = rand.nextS();\n    }\n}\n\nstatic void forward_proc(int array[], int count) {\n    for (int i = 0; i < count; ++i) {\n        array[i] = i;\n    }\n}\n\nstatic void backward_proc(int array[], int count) {\n    for (int i = 0; i < count; ++i) {\n        array[i] = -i;\n    }\n}\n\nstatic void same_proc(int array[], int count) {\n    for (int i = 0; i < count; ++i) {\n        array[i] = count;\n    }\n}\n\ntypedef void (*SortProc)(int array[], int count);\n\nenum Type {\n    kRand, kFore, kBack, kSame\n};\n\nstatic const struct {\n    const char* fName;\n    SortProc    fProc;\n} gRec[] = {\n    { \"random\", rand_proc },\n    { \"forward\", forward_proc },\n    { \"backward\", backward_proc },\n    { \"repeated\", same_proc },\n};\n\nstatic void skqsort_sort(int array[], int count) {\n    SkTQSort<int>(array, array + count);\n}\n\nstatic void skheap_sort(int array[], int count) {\n    SkTHeapSort<int>(array, count);\n}\n\nextern \"C\" {\n    static int int_compare(const void* a, const void* b) {\n        const int ai = *(const int*)a;\n        const int bi = *(const int*)b;\n        return ai < bi ? -1 : (ai > bi);\n    }\n}\n\nstatic void qsort_sort(int array[], int count) {\n    qsort(array, count, sizeof(int), int_compare);\n}\n\nenum SortType {\n    kSKQSort, kSKHeap, kQSort\n};\n\nstatic const struct {\n    const char* fName;\n    SortProc    fProc;\n} gSorts[] = {\n    { \"skqsort\", skqsort_sort },\n    { \"skheap\", skheap_sort },\n    { \"qsort\", qsort_sort },\n};\n\nclass SortBench : public SkBenchmark {\n    SkString    fName;\n    enum { MAX = 100000 };\n    int         fUnsorted[MAX];\n    int         fSorted[MAX];\n    int         fCount;\n    SortProc    fSortProc;\n\npublic:\n    SortBench(void* param, Type t, int N, SortType s) : INHERITED(param) {\n        if (N > MAX) {\n            N = MAX;\n        }\n        fName.printf(\"sort_%s_%s\", gSorts[s].fName, gRec[t].fName);\n        fCount = N;\n        gRec[t].fProc(fUnsorted, N);\n        fSortProc = gSorts[s].fProc;\n        fIsRendering = false;\n    }\n\nprotected:\n    virtual const char* onGetName() SK_OVERRIDE {\n        return fName.c_str();\n    }\n\n    virtual void onDraw(SkCanvas* canvas) {\n        int n = SkBENCHLOOP(20);\n        for (int i = 0; i < n; i++) {\n            memcpy(fSorted, fUnsorted, fCount * sizeof(int));\n            fSortProc(fSorted, fCount);\n#ifdef SK_DEBUG\n            for (int j = 1; j < fCount; ++j) {\n                SkASSERT(fSorted[j - 1] <= fSorted[j]);\n            }\n#endif\n        }\n    }\n\nprivate:\n    typedef SkBenchmark INHERITED;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#define N   10*1000\n\nstatic SkBenchmark* NewSkQSort(void* param, Type t) {\n    return new SortBench(param, t, N, kSKQSort);\n}\n\nDEF_BENCH( return NewSkQSort(p, kRand); )\nDEF_BENCH( return NewSkQSort(p, kFore); )\nDEF_BENCH( return NewSkQSort(p, kBack); )\nDEF_BENCH( return NewSkQSort(p, kSame); )\n\nstatic SkBenchmark* NewSkHeap(void* param, Type t) {\n    return new SortBench(param, t, N, kSKHeap);\n}\n\nDEF_BENCH( return NewSkHeap(p, kRand); )\nDEF_BENCH( return NewSkHeap(p, kFore); )\nDEF_BENCH( return NewSkHeap(p, kBack); )\nDEF_BENCH( return NewSkHeap(p, kSame); )\n\nstatic SkBenchmark* NewQSort(void* param, Type t) {\n    return new SortBench(param, t, N, kQSort);\n}\n\nDEF_BENCH( return NewQSort(p, kRand); )\nDEF_BENCH( return NewQSort(p, kFore); )\nDEF_BENCH( return NewQSort(p, kBack); )\nDEF_BENCH( return NewQSort(p, kSame); )\n\n<commit_msg>add rand10 bench for sort, which makes 10% of the entries repeats reorder sort tests to make comparisons easier to read<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 \"SkBenchmark.h\"\n#include \"SkRandom.h\"\n#include \"SkTSort.h\"\n#include \"SkString.h\"\n\nstatic const int N = 1000;\n\nstatic void rand_proc(int array[], int count) {\n    SkRandom rand;\n    for (int i = 0; i < count; ++i) {\n        array[i] = rand.nextS();\n    }\n}\n\nstatic void randN_proc(int array[], int count) {\n    SkRandom rand;\n    int mod = N \/ 10;\n    for (int i = 0; i < count; ++i) {\n        array[i] = rand.nextU() % mod;\n    }\n}\n\nstatic void forward_proc(int array[], int count) {\n    for (int i = 0; i < count; ++i) {\n        array[i] = i;\n    }\n}\n\nstatic void backward_proc(int array[], int count) {\n    for (int i = 0; i < count; ++i) {\n        array[i] = -i;\n    }\n}\n\nstatic void same_proc(int array[], int count) {\n    for (int i = 0; i < count; ++i) {\n        array[i] = count;\n    }\n}\n\ntypedef void (*SortProc)(int array[], int count);\n\nenum Type {\n    kRand, kRandN, kFore, kBack, kSame\n};\n\nstatic const struct {\n    const char* fName;\n    SortProc    fProc;\n} gRec[] = {\n    { \"rand\", rand_proc },\n    { \"rand10\", randN_proc },\n    { \"forward\", forward_proc },\n    { \"backward\", backward_proc },\n    { \"repeated\", same_proc },\n};\n\nstatic void skqsort_sort(int array[], int count) {\n    SkTQSort<int>(array, array + count);\n}\n\nstatic void skheap_sort(int array[], int count) {\n    SkTHeapSort<int>(array, count);\n}\n\nextern \"C\" {\n    static int int_compare(const void* a, const void* b) {\n        const int ai = *(const int*)a;\n        const int bi = *(const int*)b;\n        return ai < bi ? -1 : (ai > bi);\n    }\n}\n\nstatic void qsort_sort(int array[], int count) {\n    qsort(array, count, sizeof(int), int_compare);\n}\n\nenum SortType {\n    kSKQSort, kSKHeap, kQSort\n};\n\nstatic const struct {\n    const char* fName;\n    SortProc    fProc;\n} gSorts[] = {\n    { \"skqsort\", skqsort_sort },\n    { \"skheap\", skheap_sort },\n    { \"qsort\", qsort_sort },\n};\n\nclass SortBench : public SkBenchmark {\n    SkString    fName;\n    enum { MAX = 100000 };\n    int         fUnsorted[MAX];\n    int         fSorted[MAX];\n    int         fCount;\n    SortProc    fSortProc;\n\npublic:\n    SortBench(void* param, Type t, int n, SortType s) : INHERITED(param) {\n        if (n > MAX) {\n            n = MAX;\n        }\n        fName.printf(\"sort_%s_%s\", gSorts[s].fName, gRec[t].fName);\n        fCount = n;\n        gRec[t].fProc(fUnsorted, n);\n        fSortProc = gSorts[s].fProc;\n        fIsRendering = false;\n    }\n\nprotected:\n    virtual const char* onGetName() SK_OVERRIDE {\n        return fName.c_str();\n    }\n\n    virtual void onDraw(SkCanvas* canvas) {\n        int n = SkBENCHLOOP(200);\n        for (int i = 0; i < n; i++) {\n            memcpy(fSorted, fUnsorted, fCount * sizeof(int));\n            fSortProc(fSorted, fCount);\n#ifdef SK_DEBUG\n            for (int j = 1; j < fCount; ++j) {\n                SkASSERT(fSorted[j - 1] <= fSorted[j]);\n            }\n#endif\n        }\n    }\n\nprivate:\n    typedef SkBenchmark INHERITED;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic SkBenchmark* NewSkQSort(void* param, Type t) {\n    return new SortBench(param, t, N, kSKQSort);\n}\nstatic SkBenchmark* NewSkHeap(void* param, Type t) {\n    return new SortBench(param, t, N, kSKHeap);\n}\nstatic SkBenchmark* NewQSort(void* param, Type t) {\n    return new SortBench(param, t, N, kQSort);\n}\n\nDEF_BENCH( return NewSkQSort(p, kRand); )\nDEF_BENCH( return NewSkHeap(p, kRand); )\nDEF_BENCH( return NewQSort(p, kRand); )\n\nDEF_BENCH( return NewSkQSort(p, kRandN); )\nDEF_BENCH( return NewSkHeap(p, kRandN); )\nDEF_BENCH( return NewQSort(p, kRandN); )\n\nDEF_BENCH( return NewSkQSort(p, kFore); )\nDEF_BENCH( return NewSkHeap(p, kFore); )\nDEF_BENCH( return NewQSort(p, kFore); )\n\nDEF_BENCH( return NewSkQSort(p, kBack); )\nDEF_BENCH( return NewSkHeap(p, kBack); )\nDEF_BENCH( return NewQSort(p, kBack); )\n\nDEF_BENCH( return NewSkQSort(p, kSame); )\nDEF_BENCH( return NewSkHeap(p, kSame); )\nDEF_BENCH( return NewQSort(p, kSame); )\n\n<|endoftext|>"}
{"text":"<commit_before>#define CATCH_CONFIG_MAIN\n#include \"vector\"\n#include \"catch.hpp\"\n#include \"naive_bayes_classifier.h\"\n\nml::Sample createSample (std::string param, float value) {\n\treturn std::make_pair(param,value);\n}\nvoid insertSamples(ml::NaiveBayesClassifier & classifier,std::string type,  std::string param, std::vector<float> values) {\n\tfor (auto value: values) {\n\t\tml::Sample sample = createSample(param,value);\n\t\tclassifier.addRow(type,sample);\n\t}\n}\n\nTEST_CASE(\"Add row correctly\",\"[naive_bayes_classifier]\") {\n\tml::NaiveBayesClassifier classifier;\n\t\n\tstd::vector<float> v {1.};\n\tinsertSamples(classifier,\"male\",\"height\",v);\t\n\n\t\/\/TODO isolate testing\n\tclassifier.train();\n\tml::GaussianInfo info = classifier.getGaussianInfo(\"male\",\"height\");\n\tREQUIRE(info.mean == 1.);\n\tREQUIRE(info.values[0] == 1.);\n\tREQUIRE(info.variance ==  1.);\n};\n\n\nTEST_CASE(\"Add two rows correctly\",\"[naive_bayes_classifier]\") {\n\t\/\/TODO ADD SETUP\n\tml::NaiveBayesClassifier classifier;\n\n\tstd::vector<float> v {1., 1.5};\n\tinsertSamples(classifier,\"male\",\"height\",v);\t\n\t\n\n\tclassifier.train();\n\tml::GaussianInfo info = classifier.getGaussianInfo(\"male\",\"height\");\n\t\n\tREQUIRE(info.values.size() == 2);\n\tREQUIRE(info.mean == 1.25);\n\tREQUIRE(info.values[0] == 1);\n\tREQUIRE(info.values[1] == 1.5);\n\tREQUIRE(info.variance ==  0.25 );\n};\n\nTEST_CASE(\"Add different type of samples for testing test\",\"[naive_bayes_classifier]\") {\n\t\/\/TODO ADD SETUP\n\tml::NaiveBayesClassifier classifier;\n\n\tstd::vector<float> v {1., 1.5};\n\tinsertSamples(classifier,\"male\",\"height\",v);\t\n\t\n\tstd::vector<float> v2 {1.};\n\tinsertSamples(classifier,\"male\",\"weight\",v2);\t\n\n\t\/\/TODO add test for not finding type of sample\n\n\tclassifier.train();\n\tml::GaussianInfo info = classifier.getGaussianInfo(\"male\",\"weight\");\n\t\n\tREQUIRE(info.values.size() == 1);\n\n\tREQUIRE(info.values[0] == 1);\n\tREQUIRE(info.variance ==  0 );\n\tREQUIRE(info.mean ==  1 );\n};\n\n\n<commit_msg>Refactorization tests to permit setUp and tearDown<commit_after>#define CATCH_CONFIG_MAIN\n#include \"vector\"\n#include \"catch.hpp\"\n#include \"naive_bayes_classifier.h\"\n\nml::Sample createSample (std::string param, float value) {\n\treturn std::make_pair(param,value);\n}\nvoid insertSamples(ml::NaiveBayesClassifier & classifier,std::string type,  std::string param, std::vector<float> values) {\n\tfor (auto value: values) {\n\t\tml::Sample sample = createSample(param,value);\n\t\tclassifier.addRow(type,sample);\n\t}\n}\n\nTEST_CASE(\"testing add information\",\"[naive_bayes_classifier]\") {\n\tml::NaiveBayesClassifier classifier;\n\n\tSECTION(\"Add row correctly\") {\n\tstd::vector<float> v {1.};\n\t\tinsertSamples(classifier,\"male\",\"height\",v);\t\n\t\t\n\t\t\/\/TODO isolate testing\n\t\tclassifier.train();\n\t\tml::GaussianInfo info = classifier.getGaussianInfo(\"male\",\"height\");\n\t\tREQUIRE(info.mean == 1.);\n\t\tREQUIRE(info.values[0] == 1.);\n\t\tREQUIRE(info.variance ==  1.);\n\t};\n\tSECTION(\"Add two rows correctly\") {\n\t\tstd::vector<float> v {1., 1.5};\n\t\tinsertSamples(classifier,\"male\",\"height\",v);\t\n\t\t\n\t\tclassifier.train();\n\t\tml::GaussianInfo info = classifier.getGaussianInfo(\"male\",\"height\");\t\n\t\tREQUIRE(info.values.size() == 2);\n\t\tREQUIRE(info.mean == 1.25);\n\t\tREQUIRE(info.values[0] == 1);\n\t\tREQUIRE(info.values[1] == 1.5);\n\t\tREQUIRE(info.variance ==  0.25 );\t\n\t};\n\n\tSECTION(\"Add different type of samples for testing test\") {\n\t\tstd::vector<float> v {1., 1.5};\n\t\tinsertSamples(classifier,\"male\",\"height\",v);\t\n\t\t\n\t\tstd::vector<float> v2 {1.};\n\t\tinsertSamples(classifier,\"male\",\"weight\",v2);\t\n\t\n\t\t\/\/TODO add test for not finding type of sample\n\t\n\t\tclassifier.train();\n\t\tml::GaussianInfo info = classifier.getGaussianInfo(\"male\",\"weight\");\n\t\n\t\tREQUIRE(info.values.size() == 1);\n\t\t\n\t\tREQUIRE(info.values[0] == 1);\n\t\tREQUIRE(info.variance ==  0 );\n\t\tREQUIRE(info.mean ==  1 );\n\t};\n\n};\n\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * @file network-messaging-task.cpp\n *\n * @author C. Smith\n *\/\n\n#include \"network-messaging-task.hpp\"\n\n#include <Crypto.h>\n#include <AES.h>\n#include <CBC.h>\n#include <SHA256.h>\n#include <ESP8266TrueRandom.h>\n#include <cassert>\n#include <array>\n#include <vector>\n#include <algorithm>\n\n#include \"security-information.hpp\"\n\nnamespace app\n{\n\nstatic std::vector<uint8_t> performEncryption(const std::vector<uint8_t>& key,\n                                              const std::vector<uint8_t>& iv,\n                                              const std::vector<uint8_t>& data);\nstatic std::vector<uint8_t> sign(const std::vector<uint8_t>& key,\n                                 const std::vector<uint8_t>& data);\ntemplate <typename T>\nstatic String hexify(const T& data);\nstatic std::vector<uint8_t> padData(const std::vector<uint8_t>& data);\n\nNetworkMessagingTask::NetworkMessagingTask(\n    const std::shared_ptr<MqttClient>& client,\n    const std::shared_ptr<NetworkQueue>& queue,\n    const uint32_t timeInterval)\n  : Task(timeInterval), m_client(client), m_queue(queue)\n{\n}\n\nbool NetworkMessagingTask::OnStart()\n{\n  return true;\n}\n\nvoid NetworkMessagingTask::OnStop()\n{\n}\n\nvoid NetworkMessagingTask::OnUpdate(uint32_t deltaTime)\n{\n  if(m_client->isConnected())\n  {\n    String msgString = m_queue->dequeue();\n\n    if(msgString != \"\")\n    {\n      MqttClient::Message message;\n      MqttClient::Error::type rc;\n\n      Serial.print(\"Received Message: \");\n      Serial.println(msgString);\n\n      msgString = encrypt(msgString);\n\n      Serial.print(\"Encrypted Message: \");\n      Serial.println(msgString);\n\n      message.qos = MqttClient::QOS0;\n      message.retained = false;\n      message.dup = false;\n      message.payload = reinterpret_cast<void*>(\n                          const_cast<char*>(msgString.c_str()));\n      message.payloadLen = msgString.length() + 1;\n\n      rc = m_client->publish(\"monitor\", message);\n      if(rc != MqttClient::Error::SUCCESS)\n      {\n        Serial.print(\"Error sending message: \");\n        Serial.println(rc);\n      }\n    }\n  }\n}\n\nString NetworkMessagingTask::encrypt(const String& message) const\n{\n  const SecurityInformation& info = g_securityInformation;\n  std::vector<uint8_t> iv(16, 0);\n  std::vector<uint8_t> encryptedIv;\n  std::vector<uint8_t> cipherText;\n  std::vector<uint8_t> signature;\n  std::vector<uint8_t> fullMessage;\n  std::vector<uint8_t> plainText = padData(std::vector<uint8_t>(message.c_str(), message.c_str() + message.length()));\n  String result;\n\n  ESP8266TrueRandom.memfill(reinterpret_cast<char*>(iv.data()), iv.size());\n\n  encryptedIv = performEncryption(\n      std::vector<uint8_t>(info.ivKey.begin(), info.ivKey.end()),\n      std::vector<uint8_t>(info.staticIv.begin(), info.staticIv.end()),\n      iv);\n  cipherText = performEncryption(\n      std::vector<uint8_t>(info.dataKey.begin(), info.dataKey.end()),\n      iv,\n      plainText);\n\n  fullMessage.reserve(iv.size() + plainText.size());\n  fullMessage = iv;\n  fullMessage.insert(fullMessage.end(), plainText.begin(), plainText.end());\n  signature = sign(info.hashKey, fullMessage);\n\n  result = hexify(encryptedIv);\n  result += ',';\n  result += hexify(cipherText);\n  result += ',';\n  result += hexify(signature);\n\n  return result;\n}\n\nstatic std::vector<uint8_t> performEncryption(const std::vector<uint8_t>& key,\n                                              const std::vector<uint8_t>& iv,\n                                              const std::vector<uint8_t>& data)\n{\n  CBC<AES128> cipher;\n  std::vector<uint8_t> cipherText(data.size(), 0);;\n\n  cipher.clear();\n\n  assert(cipher.setKey(key.data(), key.size()));\n  assert(cipher.setIV(iv.data(), iv.size()));\n  assert(data.size() % 16 == 0);\n\n  cipher.encrypt(cipherText.data(), data.data(), data.size());\n\n  return cipherText;\n}\n\nstatic std::vector<uint8_t> sign(const std::vector<uint8_t>& key,\n                                 const std::vector<uint8_t>& data)\n{\n  SHA256 hmac;\n  std::vector<uint8_t> signature;\n\n  signature.resize(hmac.hashSize());\n  hmac.resetHMAC(key.data(), key.size());\n  hmac.update(data.data(), data.size());\n  hmac.finalizeHMAC(key.data(), key.size(), signature.data(), hmac.hashSize());\n\n  return signature;\n}\n\ntemplate <typename T>\nstatic String hexify(const T& data)\n{\n  const char hexLookup[] = \"0123456789ABCDEF\";\n  String result = \"\";\n\n  for(auto x : data)\n  {\n    result += hexLookup[(x >> 4) & 0x0F];\n    result += hexLookup[(x & 0x0F)];\n  }\n\n  return result;\n}\n\nstatic std::vector<uint8_t> padData(const std::vector<uint8_t>& data)\n{\n  std::vector<uint8_t> padded(data);\n\n  while(data.size() % 16 != 0)\n  {\n    padded.push_back(static_cast<uint8_t>(' '));\n  }\n\n  return padded;\n}\n\n}\n<commit_msg>Removed Null terminator on message<commit_after>\/*\n * @file network-messaging-task.cpp\n *\n * @author C. Smith\n *\/\n\n#include \"network-messaging-task.hpp\"\n\n#include <Crypto.h>\n#include <AES.h>\n#include <CBC.h>\n#include <SHA256.h>\n#include <ESP8266TrueRandom.h>\n#include <cassert>\n#include <array>\n#include <vector>\n#include <algorithm>\n\n#include \"security-information.hpp\"\n\nnamespace app\n{\n\nstatic std::vector<uint8_t> performEncryption(const std::vector<uint8_t>& key,\n                                              const std::vector<uint8_t>& iv,\n                                              const std::vector<uint8_t>& data);\nstatic std::vector<uint8_t> sign(const std::vector<uint8_t>& key,\n                                 const std::vector<uint8_t>& data);\ntemplate <typename T>\nstatic String hexify(const T& data);\nstatic std::vector<uint8_t> padData(const std::vector<uint8_t>& data);\n\nNetworkMessagingTask::NetworkMessagingTask(\n    const std::shared_ptr<MqttClient>& client,\n    const std::shared_ptr<NetworkQueue>& queue,\n    const uint32_t timeInterval)\n  : Task(timeInterval), m_client(client), m_queue(queue)\n{\n}\n\nbool NetworkMessagingTask::OnStart()\n{\n  return true;\n}\n\nvoid NetworkMessagingTask::OnStop()\n{\n}\n\nvoid NetworkMessagingTask::OnUpdate(uint32_t deltaTime)\n{\n  if(m_client->isConnected())\n  {\n    String msgString = m_queue->dequeue();\n\n    if(msgString != \"\")\n    {\n      MqttClient::Message message;\n      MqttClient::Error::type rc;\n\n      Serial.print(\"Received Message: \");\n      Serial.println(msgString);\n\n      msgString = encrypt(msgString);\n\n      Serial.print(\"Encrypted Message: \");\n      Serial.println(msgString);\n\n      message.qos = MqttClient::QOS0;\n      message.retained = false;\n      message.dup = false;\n      message.payload = reinterpret_cast<void*>(\n                          const_cast<char*>(msgString.c_str()));\n      message.payloadLen = msgString.length();\n\n      rc = m_client->publish(\"monitor\", message);\n      if(rc != MqttClient::Error::SUCCESS)\n      {\n        Serial.print(\"Error sending message: \");\n        Serial.println(rc);\n      }\n    }\n  }\n}\n\nString NetworkMessagingTask::encrypt(const String& message) const\n{\n  const SecurityInformation& info = g_securityInformation;\n  std::vector<uint8_t> iv(16, 0);\n  std::vector<uint8_t> encryptedIv;\n  std::vector<uint8_t> cipherText;\n  std::vector<uint8_t> signature;\n  std::vector<uint8_t> fullMessage;\n  std::vector<uint8_t> plainText = padData(std::vector<uint8_t>(message.c_str(), message.c_str() + message.length()));\n  String result;\n\n  ESP8266TrueRandom.memfill(reinterpret_cast<char*>(iv.data()), iv.size());\n\n  encryptedIv = performEncryption(\n      std::vector<uint8_t>(info.ivKey.begin(), info.ivKey.end()),\n      std::vector<uint8_t>(info.staticIv.begin(), info.staticIv.end()),\n      iv);\n  cipherText = performEncryption(\n      std::vector<uint8_t>(info.dataKey.begin(), info.dataKey.end()),\n      iv,\n      plainText);\n\n  fullMessage.reserve(iv.size() + plainText.size());\n  fullMessage = iv;\n  fullMessage.insert(fullMessage.end(), plainText.begin(), plainText.end());\n  signature = sign(info.hashKey, fullMessage);\n\n  result = hexify(encryptedIv);\n  result += ',';\n  result += hexify(cipherText);\n  result += ',';\n  result += hexify(signature);\n\n  return result;\n}\n\nstatic std::vector<uint8_t> performEncryption(const std::vector<uint8_t>& key,\n                                              const std::vector<uint8_t>& iv,\n                                              const std::vector<uint8_t>& data)\n{\n  CBC<AES128> cipher;\n  std::vector<uint8_t> cipherText(data.size(), 0);;\n\n  cipher.clear();\n\n  assert(cipher.setKey(key.data(), key.size()));\n  assert(cipher.setIV(iv.data(), iv.size()));\n  assert(data.size() % 16 == 0);\n\n  cipher.encrypt(cipherText.data(), data.data(), data.size());\n\n  return cipherText;\n}\n\nstatic std::vector<uint8_t> sign(const std::vector<uint8_t>& key,\n                                 const std::vector<uint8_t>& data)\n{\n  SHA256 hmac;\n  std::vector<uint8_t> signature;\n\n  signature.resize(hmac.hashSize());\n  hmac.resetHMAC(key.data(), key.size());\n  hmac.update(data.data(), data.size());\n  hmac.finalizeHMAC(key.data(), key.size(), signature.data(), hmac.hashSize());\n\n  return signature;\n}\n\ntemplate <typename T>\nstatic String hexify(const T& data)\n{\n  const char hexLookup[] = \"0123456789ABCDEF\";\n  String result = \"\";\n\n  for(auto x : data)\n  {\n    result += hexLookup[(x >> 4) & 0x0F];\n    result += hexLookup[(x & 0x0F)];\n  }\n\n  return result;\n}\n\nstatic std::vector<uint8_t> padData(const std::vector<uint8_t>& data)\n{\n  std::vector<uint8_t> padded(data);\n\n  while(data.size() % 16 != 0)\n  {\n    padded.push_back(static_cast<uint8_t>(' '));\n  }\n\n  return padded;\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"Internal.hpp\"\r\n#include <LuminoCore\/IO\/Process.hpp>\r\n#if defined(LN_OS_WIN32)\r\n#include \"Process_Win32.hpp\"\r\n#else\r\n#include \"Process_Unix.hpp\"\r\n#endif\r\n\r\nnamespace ln {\r\n\r\n\/\/==============================================================================\r\n\/\/ Process\r\n\r\nProcess::Process()\r\n\t: m_impl(makeRef<detail::ProcessImpl>())\r\n\t, m_startInfo()\r\n\t, m_stdinEncoding(nullptr)\r\n\t, m_stdoutEncoding(nullptr)\r\n\t, m_stderrEncoding(nullptr)\r\n{\r\n\tm_startInfo.useShellExecute = true;\r\n\tcreateRedirectStreams();\r\n}\r\n\r\nProcess::Process(const String& program, const List<String>& arguments, TextEncoding* encoding)\r\n\t: m_impl(makeRef<detail::ProcessImpl>())\r\n\t, m_startInfo()\r\n\t, m_stdinEncoding(encoding)\r\n\t, m_stdoutEncoding(encoding)\r\n\t, m_stderrEncoding(encoding)\r\n{\r\n\tsetProgram(program);\r\n\tsetArguments(arguments);\r\n\tcreateRedirectStreams();\r\n}\r\n\r\nProcess::~Process()\r\n{\r\n}\r\n\r\nStreamWriter* Process::openStdin()\r\n{\r\n\tif (!m_stdinWriter)\r\n\t{\r\n\t\tm_startInfo.stdinPipe = makeRef<detail::PipeImpl>();\r\n\t\tm_startInfo.stdinPipe->init();\r\n\t\tTextEncoding* encoding = m_stdinEncoding;\r\n\t\tif (!encoding) {\r\n\t\t\tencoding = TextEncoding::systemMultiByteEncoding();\r\n\t\t}\r\n\t\tm_stdinWriter = makeRef<StreamWriter>(m_startInfo.stdinPipe, encoding);\r\n\t}\r\n\r\n\treturn m_stdinWriter;\r\n}\r\n\r\nStreamReader* Process::openStdout()\r\n{\r\n\tif (!m_stdoutReader)\r\n\t{\r\n\t\tm_startInfo.stdoutPipe = makeRef<detail::PipeImpl>();\r\n\t\tm_startInfo.stdoutPipe->init();\r\n\t\tTextEncoding* encoding = m_stdoutEncoding;\r\n\t\tif (!encoding) {\r\n\t\t\tencoding = TextEncoding::systemMultiByteEncoding();\r\n\t\t}\r\n\t\tm_stdoutReader = makeRef<StreamReader>(m_startInfo.stdoutPipe, encoding);\r\n\t}\r\n\r\n\treturn m_stdoutReader;\r\n}\r\n\r\nStreamReader* Process::openStderr()\r\n{\r\n\tif (!m_stderrReader)\r\n\t{\r\n\t\tm_startInfo.stderrPipe = makeRef<detail::PipeImpl>();\r\n\t\tm_startInfo.stderrPipe->init();\r\n\t\tTextEncoding* encoding = m_stdoutEncoding;\r\n\t\tif (!encoding) {\r\n\t\t\tencoding = TextEncoding::systemMultiByteEncoding();\r\n\t\t}\r\n\t\tm_stderrReader = makeRef<StreamReader>(m_startInfo.stderrPipe, encoding);\r\n\t}\r\n\r\n\treturn m_stderrReader;\r\n}\r\n\r\n\r\n\/\/StreamWriter* Process::stdinWriter() const\r\n\/\/{\r\n\/\/\treturn m_stdinWriter;\r\n\/\/}\r\n\/\/\r\n\/\/StreamReader* Process::stdoutReader() const\r\n\/\/{\r\n\/\/\treturn m_stdoutReader;\r\n\/\/}\r\n\/\/\r\n\/\/StreamReader* Process::stderrReader() const\r\n\/\/{\r\n\/\/\treturn m_stderrReader;\r\n\/\/}\r\n\r\nvoid Process::start()\r\n{\r\n\tif (m_startInfo.useShellExecute) {\r\n\t\tif (LN_REQUIRE(!m_startInfo.stdinPipe && !m_startInfo.stdoutPipe && !m_startInfo.stderrPipe)) return;\r\n\t\t\/\/ TODO: 環境変数指定も NG\r\n\t\tm_impl->startWithShell(m_startInfo);\r\n\t}\r\n\telse {\r\n\t\tm_impl->start(m_startInfo);\r\n\t}\r\n}\r\n\r\nbool Process::wait(int timeoutMilliseconds)\r\n{\r\n\treturn m_impl->waitForExit(timeoutMilliseconds);\r\n}\r\n\r\nProcessStatus Process::status()\r\n{\r\n\treturn m_impl->getStatus(nullptr);\r\n}\r\n\r\nint Process::exitCode()\r\n{\r\n\tint n = 1;\r\n\tm_impl->getStatus(&n);\r\n\treturn n;\r\n}\r\n\r\nint Process::execute(const Path& program, const List<String>& args, String* outStdOutput, String* outStdError)\r\n{\r\n\tProcess proc(program, args);\r\n\tStreamReader* stdoutReader = (outStdOutput) ? proc.openStdout() : nullptr;\r\n\tStreamReader* stderrReader = (outStdError) ? proc.openStderr() : nullptr;\r\n\tproc.start();\r\n\tproc.wait();\r\n\tif (stdoutReader && outStdOutput) *outStdOutput = stdoutReader->readToEnd();\r\n\tif (stderrReader && outStdError) *outStdError = stderrReader->readToEnd();\r\n\treturn proc.exitCode();\r\n}\r\n\r\nvoid Process::createRedirectStreams()\r\n{\r\n\t\/\/if (!m_stdinWriter)\r\n\t\/\/{\r\n\t\/\/\tm_startInfo.stdinPipe = makeRef<detail::PipeImpl>();\r\n\t\/\/\tm_startInfo.stdinPipe->init();\r\n\t\/\/\tm_stdinWriter = makeRef<StreamWriter>(m_startInfo.stdinPipe, m_stdinEncoding);\r\n\t\/\/}\r\n\r\n\t\/\/if (!m_stdoutReader)\r\n\t\/\/{\r\n\t\/\/\tm_startInfo.stdoutPipe = makeRef<detail::PipeImpl>();\r\n\t\/\/\tm_startInfo.stdoutPipe->init();\r\n\t\/\/\tm_stdoutReader = makeRef<StreamReader>(m_startInfo.stdoutPipe, m_stdoutEncoding);\r\n\t\/\/}\r\n\r\n\t\/\/if (!m_stderrReader)\r\n\t\/\/{\r\n\t\/\/\tm_startInfo.stderrPipe = makeRef<detail::PipeImpl>();\r\n\t\/\/\tm_startInfo.stderrPipe->init();\r\n\t\/\/\tm_stderrReader = makeRef<StreamReader>(m_startInfo.stderrPipe, m_stderrEncoding);\r\n\t\/\/}\r\n}\r\n\r\n#if 0\r\n\/\/==============================================================================\r\n\/\/ Process\r\n\/\/==============================================================================\r\n\/\/------------------------------------------------------------------------------\r\nProcess::Process()\r\n\t: m_impl(LN_NEW detail::ProcessImpl())\r\n\t, m_workingDirectory()\r\n\t, m_redirectStandardInput(false)\r\n\t, m_redirectStandardOutput(false)\r\n\t, m_redirectStandardError(false)\r\n\t, m_standardInputEncoding(Encoding::getSystemMultiByteEncoding())\r\n\t, m_standardOutputEncoding(Encoding::getSystemMultiByteEncoding())\r\n\t, m_standardErrorEncoding(Encoding::getSystemMultiByteEncoding())\r\n\t, m_standardOutputExternalStream(nullptr)\r\n\t, m_standardInputWriter()\r\n\t, m_standardOutputReader()\r\n\t, m_standardErrorReader()\r\n\t, m_runningReadThread(false)\r\n\t, m_runningErrorReadThread(false)\r\n#ifdef LN_OS_WIN32\r\n#else\r\n    , m_pid(NULL)\r\n#endif\r\n{\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nProcess::~Process()\r\n{\r\n\tdisposeProcess();\r\n\tLN_SAFE_DELETE(m_impl);\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nvoid Process::setWorkingDirectory(const PathName& directoryPath)\r\n{\r\n\tm_workingDirectory = directoryPath;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nvoid Process::setRedirectStandardInput(bool enabled)\r\n{\r\n\tm_redirectStandardInput = enabled;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nvoid Process::setRedirectStandardOutput(bool enabled)\r\n{\r\n\tm_redirectStandardOutput = enabled;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nvoid Process::setRedirectStandardError(bool enabled)\r\n{\r\n\tm_redirectStandardError = enabled;\r\n}\r\n\r\n#ifdef LN_CPP11\r\n\/\/------------------------------------------------------------------------------\r\nvoid Process::setOutputDataReceivedCallback(const Delegate<void(String)>& callback)\r\n{\r\n\tm_outputDataReceivedCallback = callback;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nvoid Process::setErrorDataReceivedCallback(const Delegate<void(String)>& callback)\r\n{\r\n\tm_errorDataReceivedCallback = callback;\r\n}\r\n#else\r\n\/\/------------------------------------------------------------------------------\r\nvoid process::SetOutputDataReceivedCallback(const Delegate01<String>& callback)\r\n{\r\n\tm_outputDataReceivedCallback = callback;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nvoid process::SetErrorDataReceivedCallback(const Delegate01<String>& callback)\r\n{\r\n\tm_errorDataReceivedCallback = callback;\r\n}\r\n#endif\r\n\r\n\/\/------------------------------------------------------------------------------\r\nvoid Process::start(const PathName& program, const String& args)\r\n{\r\n\tdetail::ProcessStartInfo si;\r\n\tdetail::ProcessStartResult result;\r\n\tsi.program = program;\r\n\tsi.args = args;\r\n\tsi.workingDirectory = m_workingDirectory;\r\n\tsi.redirectStandardInput = m_redirectStandardInput;\r\n\tsi.redirectStandardOutput = m_redirectStandardOutput;\r\n\tsi.redirectStandardError = m_redirectStandardError;\r\n\tsi.standardInputEncoding = m_standardInputEncoding;\r\n\tsi.standardOutputEncoding = m_standardOutputEncoding;\r\n\tsi.standardErrorEncoding = m_standardErrorEncoding;\r\n\tm_impl->start(si, &result);\r\n\tm_standardInputWriter = result.standardInputWriter;\r\n\tm_standardOutputReader = result.standardOutputReader;\r\n\tm_standardErrorReader = result.standardErrorReader;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nvoid Process::start(const PathName& program, const StringArray& argsList)\r\n{\r\n\t\/\/ コマンドライン引数を作る\r\n\tString args;\r\n\tfor (int i = 0; i < argsList.getCount(); ++i)\r\n\t{\r\n\t\tif (!args.isEmpty()) {\r\n\t\t\targs += _LT(' ');\r\n\t\t}\r\n\r\n\t\t\/\/ スペースが含まれていれば引数を \" で囲む\r\n\t\tString tmp = argsList[i];\r\n\t\tif (tmp.contains(_LT(' ')) || tmp.contains(_LT('\\t')))\r\n\t\t{\r\n\t\t\tif (!tmp.startsWith(_LT('\\\"')) && !tmp.endsWith(_LT('\\\"')))\r\n\t\t\t{\r\n\t\t\t\ttmp = _LT('\\\"') + tmp + _LT('\\\"');\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\targs += tmp;\r\n\t}\r\n\r\n\tstart(program, args);\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nbool Process::waitForExit(int timeoutMSec)\r\n{\r\n\treturn m_impl->waitForExit(timeoutMSec);\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nStreamWriter* Process::getStandardInput() const\r\n{\r\n\tif (LN_REQUIRE(m_standardInputWriter != nullptr)) return nullptr;\r\n\treturn m_standardInputWriter;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nStreamReader* Process::getStandardOutput() const\r\n{\r\n\tif (LN_REQUIRE(m_standardOutputReader != nullptr)) return nullptr;\r\n\treturn m_standardOutputReader;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nStreamReader* Process::getStandardError() const\r\n{\r\n\tif (LN_REQUIRE(m_standardErrorReader != nullptr)) return nullptr;\r\n\treturn m_standardErrorReader;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nint Process::execute(const PathName& program, const String& args, String* outStdOutput, String* outStdError)\r\n{\r\n\tProcess proc;\r\n\tproc.setRedirectStandardOutput(outStdOutput != nullptr);\r\n\tproc.setRedirectStandardError(outStdError != nullptr);\r\n\tproc.start(program, args);\r\n\tif (outStdOutput != nullptr) {\r\n\t\t*outStdOutput = proc.getStandardOutput()->readToEnd();\r\n\t}\r\n\tif (outStdError != nullptr) {\r\n\t\t*outStdError = proc.getStandardError()->readToEnd();\r\n\t}\r\n\tproc.waitForExit();\r\n\treturn proc.getExitCode();\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nint Process::getExitCode()\r\n{\r\n\treturn m_impl->getExitCode();\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nvoid Process::beginOutputReadLine()\r\n{\r\n\tif (LN_REQUIRE(m_standardOutputReader != nullptr)) return;\r\n\r\n\t\/\/ 読み取りスレッドを立てる\r\n#ifdef LN_CPP11\r\n\tm_readStdOutputThread.start(Delegate<void()>(this, &Process::thread_ReadStdOutput));\r\n#else\r\n\tm_readStdOutputThread.start(LN_CreateDelegate(this, &process::Thread_ReadStdOutput));\r\n#endif\r\n\tm_runningReadThread = true;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nvoid Process::beginErrorReadLine()\r\n{\r\n\tif (LN_REQUIRE(m_standardErrorReader != nullptr)) return;\r\n\r\n\t\/\/ 読み取りスレッドを立てる\r\n#ifdef LN_CPP11\r\n\tm_readStdErrorThread.start(Delegate<void()>(this, &Process::thread_ReadStdError));\r\n#else\r\n\tm_readStdErrorThread.start(LN_CreateDelegate(this, &process::Thread_ReadStdError));\r\n#endif\r\n\tm_runningErrorReadThread = true;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nvoid Process::disposeProcess()\r\n{\r\n\tm_impl->dispose();\r\n\r\n\t\/\/ 読み取りスレッドの終了を待つ\r\n\tif (m_runningReadThread)\r\n\t{\r\n\t\tm_runningReadThread = false;\r\n\t\tm_readStdOutputThread.wait();\r\n\t}\r\n\tif (m_runningErrorReadThread)\r\n\t{\r\n\t\tm_runningErrorReadThread = false;\r\n\t\tm_readStdErrorThread.wait();\r\n\t}\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nvoid Process::thread_ReadStdOutput()\r\n{\r\n\tString strLine;\r\n\twhile (m_standardOutputReader->readLine(&strLine))\r\n\t{\r\n\t\tif (!m_outputDataReceivedCallback.isEmpty()) {\r\n\t\t\tm_outputDataReceivedCallback.call(strLine);\r\n\t\t}\r\n\t}\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nvoid Process::thread_ReadStdError()\r\n{\r\n\tString strLine;\r\n\twhile (m_standardErrorReader->readLine(&strLine))\r\n\t{\r\n\t\tif (!m_errorDataReceivedCallback.isEmpty()) {\r\n\t\t\tm_errorDataReceivedCallback.call(strLine);\r\n\t\t}\r\n\t}\r\n}\r\n#endif\r\n\r\n} \/\/ namespace ln\r\n<commit_msg>error message<commit_after>#include \"Internal.hpp\"\r\n#include <LuminoCore\/IO\/Process.hpp>\r\n#if defined(LN_OS_WIN32)\r\n#include \"Process_Win32.hpp\"\r\n#else\r\n#include \"Process_Unix.hpp\"\r\n#endif\r\n\r\nnamespace ln {\r\n\r\n\/\/==============================================================================\r\n\/\/ Process\r\n\r\nProcess::Process()\r\n\t: m_impl(makeRef<detail::ProcessImpl>())\r\n\t, m_startInfo()\r\n\t, m_stdinEncoding(nullptr)\r\n\t, m_stdoutEncoding(nullptr)\r\n\t, m_stderrEncoding(nullptr)\r\n{\r\n\tm_startInfo.useShellExecute = true;\r\n\tcreateRedirectStreams();\r\n}\r\n\r\nProcess::Process(const String& program, const List<String>& arguments, TextEncoding* encoding)\r\n\t: m_impl(makeRef<detail::ProcessImpl>())\r\n\t, m_startInfo()\r\n\t, m_stdinEncoding(encoding)\r\n\t, m_stdoutEncoding(encoding)\r\n\t, m_stderrEncoding(encoding)\r\n{\r\n\tsetProgram(program);\r\n\tsetArguments(arguments);\r\n\tcreateRedirectStreams();\r\n}\r\n\r\nProcess::~Process()\r\n{\r\n}\r\n\r\nStreamWriter* Process::openStdin()\r\n{\r\n\tif (!m_stdinWriter)\r\n\t{\r\n\t\tm_startInfo.stdinPipe = makeRef<detail::PipeImpl>();\r\n\t\tm_startInfo.stdinPipe->init();\r\n\t\tTextEncoding* encoding = m_stdinEncoding;\r\n\t\tif (!encoding) {\r\n\t\t\tencoding = TextEncoding::systemMultiByteEncoding();\r\n\t\t}\r\n\t\tm_stdinWriter = makeRef<StreamWriter>(m_startInfo.stdinPipe, encoding);\r\n\t}\r\n\r\n\treturn m_stdinWriter;\r\n}\r\n\r\nStreamReader* Process::openStdout()\r\n{\r\n\tif (!m_stdoutReader)\r\n\t{\r\n\t\tm_startInfo.stdoutPipe = makeRef<detail::PipeImpl>();\r\n\t\tm_startInfo.stdoutPipe->init();\r\n\t\tTextEncoding* encoding = m_stdoutEncoding;\r\n\t\tif (!encoding) {\r\n\t\t\tencoding = TextEncoding::systemMultiByteEncoding();\r\n\t\t}\r\n\t\tm_stdoutReader = makeRef<StreamReader>(m_startInfo.stdoutPipe, encoding);\r\n\t}\r\n\r\n\treturn m_stdoutReader;\r\n}\r\n\r\nStreamReader* Process::openStderr()\r\n{\r\n\tif (!m_stderrReader)\r\n\t{\r\n\t\tm_startInfo.stderrPipe = makeRef<detail::PipeImpl>();\r\n\t\tm_startInfo.stderrPipe->init();\r\n\t\tTextEncoding* encoding = m_stdoutEncoding;\r\n\t\tif (!encoding) {\r\n\t\t\tencoding = TextEncoding::systemMultiByteEncoding();\r\n\t\t}\r\n\t\tm_stderrReader = makeRef<StreamReader>(m_startInfo.stderrPipe, encoding);\r\n\t}\r\n\r\n\treturn m_stderrReader;\r\n}\r\n\r\n\r\n\/\/StreamWriter* Process::stdinWriter() const\r\n\/\/{\r\n\/\/\treturn m_stdinWriter;\r\n\/\/}\r\n\/\/\r\n\/\/StreamReader* Process::stdoutReader() const\r\n\/\/{\r\n\/\/\treturn m_stdoutReader;\r\n\/\/}\r\n\/\/\r\n\/\/StreamReader* Process::stderrReader() const\r\n\/\/{\r\n\/\/\treturn m_stderrReader;\r\n\/\/}\r\n\r\nvoid Process::start()\r\n{\r\n\tif (m_startInfo.useShellExecute) {\r\n\t\tif (LN_REQUIRE(!m_startInfo.stdinPipe && !m_startInfo.stdoutPipe && !m_startInfo.stderrPipe, \"Use with setUseShellExecute(false).\")) return;\r\n\t\t\/\/ TODO: 環境変数指定も NG\r\n\t\tm_impl->startWithShell(m_startInfo);\r\n\t}\r\n\telse {\r\n\t\tm_impl->start(m_startInfo);\r\n\t}\r\n}\r\n\r\nbool Process::wait(int timeoutMilliseconds)\r\n{\r\n\treturn m_impl->waitForExit(timeoutMilliseconds);\r\n}\r\n\r\nProcessStatus Process::status()\r\n{\r\n\treturn m_impl->getStatus(nullptr);\r\n}\r\n\r\nint Process::exitCode()\r\n{\r\n\tint n = 1;\r\n\tm_impl->getStatus(&n);\r\n\treturn n;\r\n}\r\n\r\nint Process::execute(const Path& program, const List<String>& args, String* outStdOutput, String* outStdError)\r\n{\r\n\tProcess proc(program, args);\r\n\tStreamReader* stdoutReader = (outStdOutput) ? proc.openStdout() : nullptr;\r\n\tStreamReader* stderrReader = (outStdError) ? proc.openStderr() : nullptr;\r\n\tproc.start();\r\n\tproc.wait();\r\n\tif (stdoutReader && outStdOutput) *outStdOutput = stdoutReader->readToEnd();\r\n\tif (stderrReader && outStdError) *outStdError = stderrReader->readToEnd();\r\n\treturn proc.exitCode();\r\n}\r\n\r\nvoid Process::createRedirectStreams()\r\n{\r\n\t\/\/if (!m_stdinWriter)\r\n\t\/\/{\r\n\t\/\/\tm_startInfo.stdinPipe = makeRef<detail::PipeImpl>();\r\n\t\/\/\tm_startInfo.stdinPipe->init();\r\n\t\/\/\tm_stdinWriter = makeRef<StreamWriter>(m_startInfo.stdinPipe, m_stdinEncoding);\r\n\t\/\/}\r\n\r\n\t\/\/if (!m_stdoutReader)\r\n\t\/\/{\r\n\t\/\/\tm_startInfo.stdoutPipe = makeRef<detail::PipeImpl>();\r\n\t\/\/\tm_startInfo.stdoutPipe->init();\r\n\t\/\/\tm_stdoutReader = makeRef<StreamReader>(m_startInfo.stdoutPipe, m_stdoutEncoding);\r\n\t\/\/}\r\n\r\n\t\/\/if (!m_stderrReader)\r\n\t\/\/{\r\n\t\/\/\tm_startInfo.stderrPipe = makeRef<detail::PipeImpl>();\r\n\t\/\/\tm_startInfo.stderrPipe->init();\r\n\t\/\/\tm_stderrReader = makeRef<StreamReader>(m_startInfo.stderrPipe, m_stderrEncoding);\r\n\t\/\/}\r\n}\r\n\r\n#if 0\r\n\/\/==============================================================================\r\n\/\/ Process\r\n\/\/==============================================================================\r\n\/\/------------------------------------------------------------------------------\r\nProcess::Process()\r\n\t: m_impl(LN_NEW detail::ProcessImpl())\r\n\t, m_workingDirectory()\r\n\t, m_redirectStandardInput(false)\r\n\t, m_redirectStandardOutput(false)\r\n\t, m_redirectStandardError(false)\r\n\t, m_standardInputEncoding(Encoding::getSystemMultiByteEncoding())\r\n\t, m_standardOutputEncoding(Encoding::getSystemMultiByteEncoding())\r\n\t, m_standardErrorEncoding(Encoding::getSystemMultiByteEncoding())\r\n\t, m_standardOutputExternalStream(nullptr)\r\n\t, m_standardInputWriter()\r\n\t, m_standardOutputReader()\r\n\t, m_standardErrorReader()\r\n\t, m_runningReadThread(false)\r\n\t, m_runningErrorReadThread(false)\r\n#ifdef LN_OS_WIN32\r\n#else\r\n    , m_pid(NULL)\r\n#endif\r\n{\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nProcess::~Process()\r\n{\r\n\tdisposeProcess();\r\n\tLN_SAFE_DELETE(m_impl);\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nvoid Process::setWorkingDirectory(const PathName& directoryPath)\r\n{\r\n\tm_workingDirectory = directoryPath;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nvoid Process::setRedirectStandardInput(bool enabled)\r\n{\r\n\tm_redirectStandardInput = enabled;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nvoid Process::setRedirectStandardOutput(bool enabled)\r\n{\r\n\tm_redirectStandardOutput = enabled;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nvoid Process::setRedirectStandardError(bool enabled)\r\n{\r\n\tm_redirectStandardError = enabled;\r\n}\r\n\r\n#ifdef LN_CPP11\r\n\/\/------------------------------------------------------------------------------\r\nvoid Process::setOutputDataReceivedCallback(const Delegate<void(String)>& callback)\r\n{\r\n\tm_outputDataReceivedCallback = callback;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nvoid Process::setErrorDataReceivedCallback(const Delegate<void(String)>& callback)\r\n{\r\n\tm_errorDataReceivedCallback = callback;\r\n}\r\n#else\r\n\/\/------------------------------------------------------------------------------\r\nvoid process::SetOutputDataReceivedCallback(const Delegate01<String>& callback)\r\n{\r\n\tm_outputDataReceivedCallback = callback;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nvoid process::SetErrorDataReceivedCallback(const Delegate01<String>& callback)\r\n{\r\n\tm_errorDataReceivedCallback = callback;\r\n}\r\n#endif\r\n\r\n\/\/------------------------------------------------------------------------------\r\nvoid Process::start(const PathName& program, const String& args)\r\n{\r\n\tdetail::ProcessStartInfo si;\r\n\tdetail::ProcessStartResult result;\r\n\tsi.program = program;\r\n\tsi.args = args;\r\n\tsi.workingDirectory = m_workingDirectory;\r\n\tsi.redirectStandardInput = m_redirectStandardInput;\r\n\tsi.redirectStandardOutput = m_redirectStandardOutput;\r\n\tsi.redirectStandardError = m_redirectStandardError;\r\n\tsi.standardInputEncoding = m_standardInputEncoding;\r\n\tsi.standardOutputEncoding = m_standardOutputEncoding;\r\n\tsi.standardErrorEncoding = m_standardErrorEncoding;\r\n\tm_impl->start(si, &result);\r\n\tm_standardInputWriter = result.standardInputWriter;\r\n\tm_standardOutputReader = result.standardOutputReader;\r\n\tm_standardErrorReader = result.standardErrorReader;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nvoid Process::start(const PathName& program, const StringArray& argsList)\r\n{\r\n\t\/\/ コマンドライン引数を作る\r\n\tString args;\r\n\tfor (int i = 0; i < argsList.getCount(); ++i)\r\n\t{\r\n\t\tif (!args.isEmpty()) {\r\n\t\t\targs += _LT(' ');\r\n\t\t}\r\n\r\n\t\t\/\/ スペースが含まれていれば引数を \" で囲む\r\n\t\tString tmp = argsList[i];\r\n\t\tif (tmp.contains(_LT(' ')) || tmp.contains(_LT('\\t')))\r\n\t\t{\r\n\t\t\tif (!tmp.startsWith(_LT('\\\"')) && !tmp.endsWith(_LT('\\\"')))\r\n\t\t\t{\r\n\t\t\t\ttmp = _LT('\\\"') + tmp + _LT('\\\"');\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\targs += tmp;\r\n\t}\r\n\r\n\tstart(program, args);\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nbool Process::waitForExit(int timeoutMSec)\r\n{\r\n\treturn m_impl->waitForExit(timeoutMSec);\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nStreamWriter* Process::getStandardInput() const\r\n{\r\n\tif (LN_REQUIRE(m_standardInputWriter != nullptr)) return nullptr;\r\n\treturn m_standardInputWriter;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nStreamReader* Process::getStandardOutput() const\r\n{\r\n\tif (LN_REQUIRE(m_standardOutputReader != nullptr)) return nullptr;\r\n\treturn m_standardOutputReader;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nStreamReader* Process::getStandardError() const\r\n{\r\n\tif (LN_REQUIRE(m_standardErrorReader != nullptr)) return nullptr;\r\n\treturn m_standardErrorReader;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nint Process::execute(const PathName& program, const String& args, String* outStdOutput, String* outStdError)\r\n{\r\n\tProcess proc;\r\n\tproc.setRedirectStandardOutput(outStdOutput != nullptr);\r\n\tproc.setRedirectStandardError(outStdError != nullptr);\r\n\tproc.start(program, args);\r\n\tif (outStdOutput != nullptr) {\r\n\t\t*outStdOutput = proc.getStandardOutput()->readToEnd();\r\n\t}\r\n\tif (outStdError != nullptr) {\r\n\t\t*outStdError = proc.getStandardError()->readToEnd();\r\n\t}\r\n\tproc.waitForExit();\r\n\treturn proc.getExitCode();\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nint Process::getExitCode()\r\n{\r\n\treturn m_impl->getExitCode();\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nvoid Process::beginOutputReadLine()\r\n{\r\n\tif (LN_REQUIRE(m_standardOutputReader != nullptr)) return;\r\n\r\n\t\/\/ 読み取りスレッドを立てる\r\n#ifdef LN_CPP11\r\n\tm_readStdOutputThread.start(Delegate<void()>(this, &Process::thread_ReadStdOutput));\r\n#else\r\n\tm_readStdOutputThread.start(LN_CreateDelegate(this, &process::Thread_ReadStdOutput));\r\n#endif\r\n\tm_runningReadThread = true;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nvoid Process::beginErrorReadLine()\r\n{\r\n\tif (LN_REQUIRE(m_standardErrorReader != nullptr)) return;\r\n\r\n\t\/\/ 読み取りスレッドを立てる\r\n#ifdef LN_CPP11\r\n\tm_readStdErrorThread.start(Delegate<void()>(this, &Process::thread_ReadStdError));\r\n#else\r\n\tm_readStdErrorThread.start(LN_CreateDelegate(this, &process::Thread_ReadStdError));\r\n#endif\r\n\tm_runningErrorReadThread = true;\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nvoid Process::disposeProcess()\r\n{\r\n\tm_impl->dispose();\r\n\r\n\t\/\/ 読み取りスレッドの終了を待つ\r\n\tif (m_runningReadThread)\r\n\t{\r\n\t\tm_runningReadThread = false;\r\n\t\tm_readStdOutputThread.wait();\r\n\t}\r\n\tif (m_runningErrorReadThread)\r\n\t{\r\n\t\tm_runningErrorReadThread = false;\r\n\t\tm_readStdErrorThread.wait();\r\n\t}\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nvoid Process::thread_ReadStdOutput()\r\n{\r\n\tString strLine;\r\n\twhile (m_standardOutputReader->readLine(&strLine))\r\n\t{\r\n\t\tif (!m_outputDataReceivedCallback.isEmpty()) {\r\n\t\t\tm_outputDataReceivedCallback.call(strLine);\r\n\t\t}\r\n\t}\r\n}\r\n\r\n\/\/------------------------------------------------------------------------------\r\nvoid Process::thread_ReadStdError()\r\n{\r\n\tString strLine;\r\n\twhile (m_standardErrorReader->readLine(&strLine))\r\n\t{\r\n\t\tif (!m_errorDataReceivedCallback.isEmpty()) {\r\n\t\t\tm_errorDataReceivedCallback.call(strLine);\r\n\t\t}\r\n\t}\r\n}\r\n#endif\r\n\r\n} \/\/ namespace ln\r\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Added voronoi colorExterior case where one external vertex coincides with a point of an input segment.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: SdUnoOutlineView.cxx,v $\n *\n *  $Revision: 1.20 $\n *\n *  last change: $Author: kz $ $Date: 2008-04-03 14:55:28 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sd.hxx\"\n\n#include \"SdUnoOutlineView.hxx\"\n\n#include \"DrawController.hxx\"\n#ifndef SD_OUTLINE_VIEW_SHELL_HXX\n#include \"OutlineViewShell.hxx\"\n#endif\n#include \"sdpage.hxx\"\n#include \"unopage.hxx\"\n\n#include <cppuhelper\/proptypehlp.hxx>\n#include <svx\/unopage.hxx>\n\n#ifndef _VOS_MUTEX_HXX_\n#include <vos\/mutex.hxx>\n#endif\n\n#ifndef _SV_SVAPP_HXX\n#include <vcl\/svapp.hxx>\n#endif\n\nusing ::rtl::OUString;\nusing namespace ::vos;\nusing namespace ::cppu;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\n\n\n\nnamespace sd {\n\nSdUnoOutlineView::SdUnoOutlineView(\n    DrawController& rController,\n    OutlineViewShell& rViewShell,\n    View& rView) throw()\n    :   DrawSubControllerInterfaceBase(m_aMutex),\n        mrController(rController),\n        mrOutlineViewShell(rViewShell),\n        mrView(rView)\n{\n}\n\n\n\n\nSdUnoOutlineView::~SdUnoOutlineView (void) throw()\n{\n}\n\n\n\n\nvoid SAL_CALL SdUnoOutlineView::disposing (void)\n{\n}\n\n\n\n\n\/\/----- XSelectionSupplier ----------------------------------------------------\n\nsal_Bool SAL_CALL SdUnoOutlineView::select( const Any&  )\n    throw(lang::IllegalArgumentException, RuntimeException)\n{\n    \/\/ todo: add selections for text ranges\n    return sal_False;\n}\n\n\n\nAny SAL_CALL SdUnoOutlineView::getSelection()\n    throw(RuntimeException)\n{\n    Any aAny;\n    return aAny;\n}\n\n\n\nvoid SAL_CALL SdUnoOutlineView::addSelectionChangeListener (\n    const css::uno::Reference<css::view::XSelectionChangeListener>& rxListener)\n    throw(css::uno::RuntimeException)\n{\n    (void)rxListener;\n}\n\n\n\n\nvoid SAL_CALL SdUnoOutlineView::removeSelectionChangeListener (\n    const css::uno::Reference<css::view::XSelectionChangeListener>& rxListener)\n    throw(css::uno::RuntimeException)\n{\n    (void)rxListener;\n}\n\n\n\n\n\/\/----- XDrawView -------------------------------------------------------------\n\n\nvoid SAL_CALL SdUnoOutlineView::setCurrentPage (\n    const Reference< drawing::XDrawPage >& xPage)\n    throw(RuntimeException)\n{\n    SvxDrawPage* pDrawPage = SvxDrawPage::getImplementation( xPage );\n    SdrPage *pSdrPage = pDrawPage ? pDrawPage->GetSdrPage() : NULL;\n\n    if (pSdrPage != NULL)\n        mrOutlineViewShell.SetCurrentPage(dynamic_cast<SdPage*>(pSdrPage));\n}\n\n\n\n\nReference< drawing::XDrawPage > SAL_CALL SdUnoOutlineView::getCurrentPage (void)\n    throw(RuntimeException)\n{\n    Reference<drawing::XDrawPage>  xPage;\n\n    SdPage* pPage = mrOutlineViewShell.getCurrentPage();\n    if (pPage != NULL)\n        xPage = Reference<drawing::XDrawPage>::query(pPage->getUnoPage());\n\n    return xPage;\n}\n\n\n\n\/*\n\/\/ Return sal_True, value change\nsal_Bool SdUnoOutlineView::convertFastPropertyValue (\n    Any & rConvertedValue,\n    Any & rOldValue,\n    sal_Int32 nHandle,\n    const Any& rValue)\n    throw ( com::sun::star::lang::IllegalArgumentException)\n{\n    sal_Bool bResult = sal_False;\n\n    switch( nHandle )\n    {\n        case DrawController::PROPERTY_CURRENTPAGE:\n            {\n                Reference< drawing::XDrawPage > xOldPage( getCurrentPage() );\n                Reference< drawing::XDrawPage > xNewPage;\n                ::cppu::convertPropertyValue( xNewPage, rValue );\n                if( xOldPage != xNewPage )\n                {\n                    rConvertedValue <<= xNewPage;\n                    rOldValue <<= xOldPage;\n                    bResult = sal_True;\n                }\n            }\n            break;\n\n        default:\n            break;\n    }\n\n    return bResult;\n}\n*\/\n\n\nvoid SdUnoOutlineView::setFastPropertyValue (\n    sal_Int32 nHandle,\n        const Any& rValue)\n    throw(css::beans::UnknownPropertyException,\n        css::beans::PropertyVetoException,\n        css::lang::IllegalArgumentException,\n        css::lang::WrappedTargetException,\n        css::uno::RuntimeException)\n{\n    switch( nHandle )\n    {\n        case DrawController::PROPERTY_CURRENTPAGE:\n        {\n            Reference< drawing::XDrawPage > xPage;\n            rValue >>= xPage;\n            setCurrentPage( xPage );\n        }\n        break;\n\n        default:\n            throw beans::UnknownPropertyException();\n    }\n}\n\n\n\n\nvoid SAL_CALL SdUnoOutlineView::disposing (const ::com::sun::star::lang::EventObject& )\n    throw (::com::sun::star::uno::RuntimeException)\n{\n}\n\n\n\n\nAny SAL_CALL SdUnoOutlineView::getFastPropertyValue (\n    sal_Int32 nHandle)\n    throw(css::beans::UnknownPropertyException,\n        css::lang::WrappedTargetException,\n        css::uno::RuntimeException)\n{\n    Any aValue;\n\n    switch( nHandle )\n    {\n        case DrawController::PROPERTY_CURRENTPAGE:\n        {\n            SdPage* pPage = const_cast<OutlineViewShell&>(mrOutlineViewShell).GetActualPage();\n            if (pPage != NULL)\n                aValue <<= pPage->getUnoPage();\n        }\n        break;\n\n        default:\n            throw beans::UnknownPropertyException();\n    }\n\n    return aValue;\n}\n\n\n\n\n} \/\/ end of namespace sd\n<commit_msg>INTEGRATION: CWS changefileheader (1.19.298); FILE MERGED 2008\/04\/01 15:36:11 thb 1.19.298.3: #i85898# Stripping all external header guards 2008\/04\/01 12:39:24 thb 1.19.298.2: #i85898# Stripping all external header guards 2008\/03\/31 13:59:07 rt 1.19.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: SdUnoOutlineView.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_sd.hxx\"\n\n#include \"SdUnoOutlineView.hxx\"\n\n#include \"DrawController.hxx\"\n#include \"OutlineViewShell.hxx\"\n#include \"sdpage.hxx\"\n#include \"unopage.hxx\"\n\n#include <cppuhelper\/proptypehlp.hxx>\n#include <svx\/unopage.hxx>\n#include <vos\/mutex.hxx>\n#include <vcl\/svapp.hxx>\n\nusing ::rtl::OUString;\nusing namespace ::vos;\nusing namespace ::cppu;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\n\n\n\nnamespace sd {\n\nSdUnoOutlineView::SdUnoOutlineView(\n    DrawController& rController,\n    OutlineViewShell& rViewShell,\n    View& rView) throw()\n    :   DrawSubControllerInterfaceBase(m_aMutex),\n        mrController(rController),\n        mrOutlineViewShell(rViewShell),\n        mrView(rView)\n{\n}\n\n\n\n\nSdUnoOutlineView::~SdUnoOutlineView (void) throw()\n{\n}\n\n\n\n\nvoid SAL_CALL SdUnoOutlineView::disposing (void)\n{\n}\n\n\n\n\n\/\/----- XSelectionSupplier ----------------------------------------------------\n\nsal_Bool SAL_CALL SdUnoOutlineView::select( const Any&  )\n    throw(lang::IllegalArgumentException, RuntimeException)\n{\n    \/\/ todo: add selections for text ranges\n    return sal_False;\n}\n\n\n\nAny SAL_CALL SdUnoOutlineView::getSelection()\n    throw(RuntimeException)\n{\n    Any aAny;\n    return aAny;\n}\n\n\n\nvoid SAL_CALL SdUnoOutlineView::addSelectionChangeListener (\n    const css::uno::Reference<css::view::XSelectionChangeListener>& rxListener)\n    throw(css::uno::RuntimeException)\n{\n    (void)rxListener;\n}\n\n\n\n\nvoid SAL_CALL SdUnoOutlineView::removeSelectionChangeListener (\n    const css::uno::Reference<css::view::XSelectionChangeListener>& rxListener)\n    throw(css::uno::RuntimeException)\n{\n    (void)rxListener;\n}\n\n\n\n\n\/\/----- XDrawView -------------------------------------------------------------\n\n\nvoid SAL_CALL SdUnoOutlineView::setCurrentPage (\n    const Reference< drawing::XDrawPage >& xPage)\n    throw(RuntimeException)\n{\n    SvxDrawPage* pDrawPage = SvxDrawPage::getImplementation( xPage );\n    SdrPage *pSdrPage = pDrawPage ? pDrawPage->GetSdrPage() : NULL;\n\n    if (pSdrPage != NULL)\n        mrOutlineViewShell.SetCurrentPage(dynamic_cast<SdPage*>(pSdrPage));\n}\n\n\n\n\nReference< drawing::XDrawPage > SAL_CALL SdUnoOutlineView::getCurrentPage (void)\n    throw(RuntimeException)\n{\n    Reference<drawing::XDrawPage>  xPage;\n\n    SdPage* pPage = mrOutlineViewShell.getCurrentPage();\n    if (pPage != NULL)\n        xPage = Reference<drawing::XDrawPage>::query(pPage->getUnoPage());\n\n    return xPage;\n}\n\n\n\n\/*\n\/\/ Return sal_True, value change\nsal_Bool SdUnoOutlineView::convertFastPropertyValue (\n    Any & rConvertedValue,\n    Any & rOldValue,\n    sal_Int32 nHandle,\n    const Any& rValue)\n    throw ( com::sun::star::lang::IllegalArgumentException)\n{\n    sal_Bool bResult = sal_False;\n\n    switch( nHandle )\n    {\n        case DrawController::PROPERTY_CURRENTPAGE:\n            {\n                Reference< drawing::XDrawPage > xOldPage( getCurrentPage() );\n                Reference< drawing::XDrawPage > xNewPage;\n                ::cppu::convertPropertyValue( xNewPage, rValue );\n                if( xOldPage != xNewPage )\n                {\n                    rConvertedValue <<= xNewPage;\n                    rOldValue <<= xOldPage;\n                    bResult = sal_True;\n                }\n            }\n            break;\n\n        default:\n            break;\n    }\n\n    return bResult;\n}\n*\/\n\n\nvoid SdUnoOutlineView::setFastPropertyValue (\n    sal_Int32 nHandle,\n        const Any& rValue)\n    throw(css::beans::UnknownPropertyException,\n        css::beans::PropertyVetoException,\n        css::lang::IllegalArgumentException,\n        css::lang::WrappedTargetException,\n        css::uno::RuntimeException)\n{\n    switch( nHandle )\n    {\n        case DrawController::PROPERTY_CURRENTPAGE:\n        {\n            Reference< drawing::XDrawPage > xPage;\n            rValue >>= xPage;\n            setCurrentPage( xPage );\n        }\n        break;\n\n        default:\n            throw beans::UnknownPropertyException();\n    }\n}\n\n\n\n\nvoid SAL_CALL SdUnoOutlineView::disposing (const ::com::sun::star::lang::EventObject& )\n    throw (::com::sun::star::uno::RuntimeException)\n{\n}\n\n\n\n\nAny SAL_CALL SdUnoOutlineView::getFastPropertyValue (\n    sal_Int32 nHandle)\n    throw(css::beans::UnknownPropertyException,\n        css::lang::WrappedTargetException,\n        css::uno::RuntimeException)\n{\n    Any aValue;\n\n    switch( nHandle )\n    {\n        case DrawController::PROPERTY_CURRENTPAGE:\n        {\n            SdPage* pPage = const_cast<OutlineViewShell&>(mrOutlineViewShell).GetActualPage();\n            if (pPage != NULL)\n                aValue <<= pPage->getUnoPage();\n        }\n        break;\n\n        default:\n            throw beans::UnknownPropertyException();\n    }\n\n    return aValue;\n}\n\n\n\n\n} \/\/ end of namespace sd\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkTIFFWriter.cxx\n  Language:  C++\n  Date:      $Date$\n  Version:   $Revision$\n\n  Copyright (c) 1993-2002 Ken Martin, Will Schroeder, Bill Lorensen \n  All rights reserved.\n  See Copyright.txt or http:\/\/www.kitware.com\/Copyright.htm for details.\n\n     This software is distributed WITHOUT ANY WARRANTY; without even \n     the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR \n     PURPOSE.  See the above copyright notice for more information.\n\n=========================================================================*\/\n#include \"vtkTIFFWriter.h\"\n\n#include \"vtkObjectFactory.h\"\n#include \"vtkImageData.h\"\n#include \"vtkPointData.h\"\n#include \"vtkErrorCode.h\"\n#include <tiffio.h>\n\nvtkCxxRevisionMacro(vtkTIFFWriter, \"1.30\");\nvtkStandardNewMacro(vtkTIFFWriter);\n\n\/\/----------------------------------------------------------------------------\nvtkTIFFWriter::vtkTIFFWriter() \n{\n  this->TIFFPtr = 0;\n  this->Compression = vtkTIFFWriter::PackBits;\n};\n\n\nclass vtkTIFFWriterIO\n{\npublic:\n  \/\/ Writing file no reading\n  static tsize_t TIFFRead(thandle_t, tdata_t, tsize_t) { return 0; }\n\n  \/\/ Write data\n  static tsize_t TIFFWrite(thandle_t fd, tdata_t buf, tsize_t size) \n    {\n    ostream *out = reinterpret_cast<ostream *>(fd);\n    out->write(static_cast<char *>(buf), size);\n    return out->fail() ? static_cast<tsize_t>(0) : size;\n    }\n\n  static toff_t TIFFSeek(thandle_t fd, toff_t off, int whence) \n    {\n    ostream *out = reinterpret_cast<ostream *>(fd);\n    switch (whence) \n      {\n      case SEEK_SET:\n        out->seekp(off, ios::beg);\n        break;\n      case SEEK_END:\n        out->seekp(off, ios::end);\n        break;\n      case SEEK_CUR:\n        out->seekp(off, ios::cur);\n        break;\n      default:\n        return out->tellp();\n      }\n    return out->tellp();\n    }\n\n  \/\/ File will be closed by the superclass\n  static int TIFFClose(thandle_t) { return 1; }\n\n  static toff_t TIFFSize(thandle_t fd) \n    {\n    ostream *out = reinterpret_cast<ostream *>(fd);\n    out->seekp(0, ios::end);\n    return out->tellp();\n    }\n\n  static int TIFFMapFile(thandle_t, tdata_t*, toff_t*) { return (0); }\n  static void TIFFUnmapFile(thandle_t, tdata_t, toff_t) {}\n};\n\n\/\/----------------------------------------------------------------------------\nvoid vtkTIFFWriter::WriteFileHeader(ofstream *file, vtkImageData *data)\n{\n  int dims[3];\n  int width, height;\n  data->GetDimensions(dims);\n  int scomponents = data->GetNumberOfScalarComponents();\n  int stype = data->GetScalarType();\n  double resolution = -1;\n  uint32 rowsperstrip = (uint32) -1;\n\n  int min0, min1, max0, max1, min2, max2;\n\n\n  int bps;\n  switch (stype)\n    {\n  case VTK_CHAR:\n  case VTK_UNSIGNED_CHAR:\n    bps = 8;\n    break;\n  case VTK_SHORT:\n  case VTK_UNSIGNED_SHORT:\n    bps = 16;\n    break;\n  default:\n    vtkErrorMacro(<< \"Unsupported data type: \" << data->GetScalarTypeAsString());\n    this->SetErrorCode(vtkErrorCode::FileFormatError);\n    return;\n    }\n\n  int predictor = 0;\n\n  \/\/ Find the length of the rows to write.\n  data->GetWholeExtent(min0, max0, min1, max1, min2, max2);\n  width = (max0 - min0 + 1);\n  height = (max1 - min1 + 1);\n\n  TIFF* tif = TIFFClientOpen(this->GetFileName(), \"w\",\n    (thandle_t) file,\n    vtkTIFFWriterIO::TIFFRead, vtkTIFFWriterIO::TIFFWrite,\n    vtkTIFFWriterIO::TIFFSeek,\n    vtkTIFFWriterIO::TIFFClose, vtkTIFFWriterIO::TIFFSize,\n    vtkTIFFWriterIO::TIFFMapFile, vtkTIFFWriterIO::TIFFUnmapFile);\n  if ( !tif )\n    {\n    this->TIFFPtr = 0;\n    return;\n    }\n  this->TIFFPtr = tif;\n\n  uint32 w = width;\n  uint32 h = height;\n  TIFFSetField(tif, TIFFTAG_IMAGEWIDTH, w);\n  TIFFSetField(tif, TIFFTAG_IMAGELENGTH, h);\n  TIFFSetField(tif, TIFFTAG_ORIENTATION, ORIENTATION_TOPLEFT);\n  TIFFSetField(tif, TIFFTAG_SAMPLESPERPIXEL, scomponents);\n  TIFFSetField(tif, TIFFTAG_BITSPERSAMPLE, bps); \/\/ Fix for stype\n  TIFFSetField(tif, TIFFTAG_PLANARCONFIG, PLANARCONFIG_CONTIG);\n\n  if ( scomponents > 3 )\n    {\n    \/\/ if number of scalar components is greater than 3, that means we assume\n    \/\/ there is alpha.\n    uint16 extra_samples = scomponents-3;\n    uint16 *sample_info = new uint16[scomponents-3];\n    sample_info[0]=EXTRASAMPLE_ASSOCALPHA;\n    int cc;\n    for ( cc = 1; cc < scomponents-3; cc ++ )\n      {\n      sample_info[cc] = EXTRASAMPLE_UNSPECIFIED;\n      }\n    TIFFSetField(tif,TIFFTAG_EXTRASAMPLES,extra_samples,\n      sample_info);\n    delete [] sample_info;\n    }\n\n  int compression = COMPRESSION_PACKBITS;\n  switch ( this->Compression )\n    {\n  case vtkTIFFWriter::PackBits: compression = COMPRESSION_PACKBITS; break;\n  case vtkTIFFWriter::JPEG:     compression = COMPRESSION_JPEG; break;\n  case vtkTIFFWriter::Deflate:  compression = COMPRESSION_DEFLATE; break;\n  case vtkTIFFWriter::LZW:      compression = COMPRESSION_LZW; break;\n  default: compression = COMPRESSION_NONE;\n    }\n  \/\/compression = COMPRESSION_JPEG;\n  TIFFSetField(tif, TIFFTAG_COMPRESSION, compression); \/\/ Fix for compression\n  uint16 photometric = PHOTOMETRIC_RGB;\n  if ( compression == COMPRESSION_JPEG )\n    {\n    TIFFSetField(tif, TIFFTAG_JPEGQUALITY, 75); \/\/ Parameter\n    TIFFSetField(tif, TIFFTAG_JPEGCOLORMODE, JPEGCOLORMODE_RGB);\n    photometric = PHOTOMETRIC_YCBCR;\n    }\n  else if ( compression == COMPRESSION_LZW )\n    {\n    predictor = 2;\n    TIFFSetField(tif, TIFFTAG_PREDICTOR, predictor);\n    vtkErrorMacro(\"LZW compression is patented outside US so it is disabled\");\n    }\n  else if ( compression == COMPRESSION_DEFLATE )\n    {\n    predictor = 2;\n    TIFFSetField(tif, TIFFTAG_PREDICTOR, predictor);\n    }\n\n  TIFFSetField(tif, TIFFTAG_PHOTOMETRIC, photometric); \/\/ Fix for scomponents\n  TIFFSetField(tif, TIFFTAG_ROWSPERSTRIP,\n    TIFFDefaultStripSize(tif, rowsperstrip));\n  if (resolution > 0) {\n    TIFFSetField(tif, TIFFTAG_XRESOLUTION, resolution);\n    TIFFSetField(tif, TIFFTAG_YRESOLUTION, resolution);\n    TIFFSetField(tif, TIFFTAG_RESOLUTIONUNIT, RESUNIT_INCH);\n  }\n}\n\n\n\/\/----------------------------------------------------------------------------\nvoid vtkTIFFWriter::WriteFile(ofstream *, vtkImageData *data,\n  int extent[6])\n{\n  int idx1, idx2;\n  int rowLength; \/\/ in bytes\n  void *ptr;\n\n  \/\/ Make sure we actually have data.\n  if ( !data->GetPointData()->GetScalars())\n    {\n    vtkErrorMacro(<< \"Could not get data from input.\");\n    return;\n    }\n\n  TIFF* tif = reinterpret_cast<TIFF*>(this->TIFFPtr);\n  if ( !tif )\n    {\n    vtkErrorMacro(\"Problem writting trailer.\");\n    this->SetErrorCode(vtkErrorCode::FileFormatError);\n    return;\n    }\n\n  \/\/ take into consideration the scalar type\n  switch (data->GetScalarType())\n    {\n  case VTK_UNSIGNED_CHAR:\n    rowLength = sizeof(unsigned char); \n    break;\n  case VTK_UNSIGNED_SHORT:\n    rowLength = sizeof(unsigned short);\n  default:\n    vtkErrorMacro(\"TIFFWriter only accepts unsigned char scalars!\");\n    return; \n    }\n  rowLength *= data->GetNumberOfScalarComponents();\n  rowLength *= (extent[1] - extent[0] + 1);\n\n  int row = 0;\n  for (idx2 = extent[4]; idx2 <= extent[5]; ++idx2)\n    {\n    for (idx1 = extent[3]; idx1 >= extent[2]; idx1--)\n      {\n      ptr = data->GetScalarPointer(extent[0], idx1, idx2);\n      if ( TIFFWriteScanline(tif, static_cast<unsigned char*>(ptr), row, 0) < 0)\n        {\n        this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n        break;\n        }\n      row ++;\n      }\n    }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkTIFFWriter::WriteFileTrailer(ofstream *, vtkImageData *)\n{\n  TIFF* tif = reinterpret_cast<TIFF*>(this->TIFFPtr);\n  if ( !tif )\n    {\n    vtkErrorMacro(\"Problem writting trailer.\");\n    this->SetErrorCode(vtkErrorCode::FileFormatError);\n    }\n  TIFFClose(tif);\n  this->TIFFPtr = 0;\n}\n\/\/----------------------------------------------------------------------------\nvoid vtkTIFFWriter::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os,indent);\n\n  os << indent << \"Compression: \";\n  if ( this->Compression == vtkTIFFWriter::PackBits )\n    {\n    os << \"Pack Bits\\n\";\n    }\n  else if ( this->Compression == vtkTIFFWriter::JPEG )\n    {\n    os << \"JPEG\\n\";\n    }\n  else if ( this->Compression == vtkTIFFWriter::Deflate )\n    {\n    os << \"Deflate\\n\";\n    }\n  else if ( this->Compression == vtkTIFFWriter::LZW )\n    {\n    os << \"LZW\\n\";\n    }\n  else \/\/if ( this->Compression == vtkTIFFWriter::NoCompression )\n    {\n    os << \"No Compression\\n\";\n    }\n}\n<commit_msg>ERR: Attempt to remove sun warnings<commit_after>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkTIFFWriter.cxx\n  Language:  C++\n  Date:      $Date$\n  Version:   $Revision$\n\n  Copyright (c) 1993-2002 Ken Martin, Will Schroeder, Bill Lorensen \n  All rights reserved.\n  See Copyright.txt or http:\/\/www.kitware.com\/Copyright.htm for details.\n\n     This software is distributed WITHOUT ANY WARRANTY; without even \n     the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR \n     PURPOSE.  See the above copyright notice for more information.\n\n=========================================================================*\/\n#include \"vtkTIFFWriter.h\"\n\n#include \"vtkObjectFactory.h\"\n#include \"vtkImageData.h\"\n#include \"vtkPointData.h\"\n#include \"vtkErrorCode.h\"\n#include <tiffio.h>\n\nvtkCxxRevisionMacro(vtkTIFFWriter, \"1.31\");\nvtkStandardNewMacro(vtkTIFFWriter);\n\n\/\/----------------------------------------------------------------------------\nvtkTIFFWriter::vtkTIFFWriter() \n{\n  this->TIFFPtr = 0;\n  this->Compression = vtkTIFFWriter::PackBits;\n};\n\n\nclass vtkTIFFWriterIO\n{\npublic:\n  \/\/ Writing file no reading\n  static tsize_t TIFFRead(thandle_t, tdata_t, tsize_t) { return 0; }\n\n  \/\/ Write data\n  static tsize_t TIFFWrite(thandle_t fd, tdata_t buf, tsize_t size) \n    {\n    ostream *out = reinterpret_cast<ostream *>(fd);\n    out->write(static_cast<char *>(buf), size);\n    return out->fail() ? static_cast<tsize_t>(0) : size;\n    }\n\n  static toff_t TIFFSeek(thandle_t fd, toff_t off, int whence) \n    {\n    ostream *out = reinterpret_cast<ostream *>(fd);\n    switch (whence) \n      {\n      case SEEK_SET:\n        out->seekp(off, ios::beg);\n        break;\n      case SEEK_END:\n        out->seekp(off, ios::end);\n        break;\n      case SEEK_CUR:\n        out->seekp(off, ios::cur);\n        break;\n      default:\n        return out->tellp();\n      }\n    return out->tellp();\n    }\n\n  \/\/ File will be closed by the superclass\n  static int TIFFClose(thandle_t) { return 1; }\n\n  static toff_t TIFFSize(thandle_t fd) \n    {\n    ostream *out = reinterpret_cast<ostream *>(fd);\n    out->seekp(0, ios::end);\n    return out->tellp();\n    }\n\n  static int TIFFMapFile(thandle_t, tdata_t*, toff_t*) { return (0); }\n  static void TIFFUnmapFile(thandle_t, tdata_t, toff_t) {}\n};\n\n\/\/----------------------------------------------------------------------------\nvoid vtkTIFFWriter::WriteFileHeader(ofstream *file, vtkImageData *data)\n{\n  int dims[3];\n  int width, height;\n  data->GetDimensions(dims);\n  int scomponents = data->GetNumberOfScalarComponents();\n  int stype = data->GetScalarType();\n  double resolution = -1;\n  uint32 rowsperstrip = (uint32) -1;\n\n  int min0, min1, max0, max1, min2, max2;\n\n\n  int bps;\n  switch (stype)\n    {\n  case VTK_CHAR:\n  case VTK_UNSIGNED_CHAR:\n    bps = 8;\n    break;\n  case VTK_SHORT:\n  case VTK_UNSIGNED_SHORT:\n    bps = 16;\n    break;\n  default:\n    vtkErrorMacro(<< \"Unsupported data type: \" << data->GetScalarTypeAsString());\n    this->SetErrorCode(vtkErrorCode::FileFormatError);\n    return;\n    }\n\n  int predictor = 0;\n\n  \/\/ Find the length of the rows to write.\n  data->GetWholeExtent(min0, max0, min1, max1, min2, max2);\n  width = (max0 - min0 + 1);\n  height = (max1 - min1 + 1);\n\n  TIFF* tif = TIFFClientOpen(this->GetFileName(), \"w\",\n    (thandle_t) file,\n    reinterpret_cast<TIFFReadWriteProc>(vtkTIFFWriterIO::TIFFRead), \n    reinterpret_cast<TIFFReadWriteProc>(vtkTIFFWriterIO::TIFFWrite),\n    reinterpret_cast<TIFFSeekProc>(vtkTIFFWriterIO::TIFFSeek),\n    reinterpret_cast<TIFFCloseProc>(vtkTIFFWriterIO::TIFFClose), \n    reinterpret_cast<TIFFSizeProc>(vtkTIFFWriterIO::TIFFSize),\n    reinterpret_cast<TIFFMapFileProc>(vtkTIFFWriterIO::TIFFMapFile), \n    reinterpret_cast<TIFFUnmapFileProc>(vtkTIFFWriterIO::TIFFUnmapFile)\n    );\n  if ( !tif )\n    {\n    this->TIFFPtr = 0;\n    return;\n    }\n  this->TIFFPtr = tif;\n\n  uint32 w = width;\n  uint32 h = height;\n  TIFFSetField(tif, TIFFTAG_IMAGEWIDTH, w);\n  TIFFSetField(tif, TIFFTAG_IMAGELENGTH, h);\n  TIFFSetField(tif, TIFFTAG_ORIENTATION, ORIENTATION_TOPLEFT);\n  TIFFSetField(tif, TIFFTAG_SAMPLESPERPIXEL, scomponents);\n  TIFFSetField(tif, TIFFTAG_BITSPERSAMPLE, bps); \/\/ Fix for stype\n  TIFFSetField(tif, TIFFTAG_PLANARCONFIG, PLANARCONFIG_CONTIG);\n\n  if ( scomponents > 3 )\n    {\n    \/\/ if number of scalar components is greater than 3, that means we assume\n    \/\/ there is alpha.\n    uint16 extra_samples = scomponents-3;\n    uint16 *sample_info = new uint16[scomponents-3];\n    sample_info[0]=EXTRASAMPLE_ASSOCALPHA;\n    int cc;\n    for ( cc = 1; cc < scomponents-3; cc ++ )\n      {\n      sample_info[cc] = EXTRASAMPLE_UNSPECIFIED;\n      }\n    TIFFSetField(tif,TIFFTAG_EXTRASAMPLES,extra_samples,\n      sample_info);\n    delete [] sample_info;\n    }\n\n  int compression = COMPRESSION_PACKBITS;\n  switch ( this->Compression )\n    {\n  case vtkTIFFWriter::PackBits: compression = COMPRESSION_PACKBITS; break;\n  case vtkTIFFWriter::JPEG:     compression = COMPRESSION_JPEG; break;\n  case vtkTIFFWriter::Deflate:  compression = COMPRESSION_DEFLATE; break;\n  case vtkTIFFWriter::LZW:      compression = COMPRESSION_LZW; break;\n  default: compression = COMPRESSION_NONE;\n    }\n  \/\/compression = COMPRESSION_JPEG;\n  TIFFSetField(tif, TIFFTAG_COMPRESSION, compression); \/\/ Fix for compression\n  uint16 photometric = PHOTOMETRIC_RGB;\n  if ( compression == COMPRESSION_JPEG )\n    {\n    TIFFSetField(tif, TIFFTAG_JPEGQUALITY, 75); \/\/ Parameter\n    TIFFSetField(tif, TIFFTAG_JPEGCOLORMODE, JPEGCOLORMODE_RGB);\n    photometric = PHOTOMETRIC_YCBCR;\n    }\n  else if ( compression == COMPRESSION_LZW )\n    {\n    predictor = 2;\n    TIFFSetField(tif, TIFFTAG_PREDICTOR, predictor);\n    vtkErrorMacro(\"LZW compression is patented outside US so it is disabled\");\n    }\n  else if ( compression == COMPRESSION_DEFLATE )\n    {\n    predictor = 2;\n    TIFFSetField(tif, TIFFTAG_PREDICTOR, predictor);\n    }\n\n  TIFFSetField(tif, TIFFTAG_PHOTOMETRIC, photometric); \/\/ Fix for scomponents\n  TIFFSetField(tif, TIFFTAG_ROWSPERSTRIP,\n    TIFFDefaultStripSize(tif, rowsperstrip));\n  if (resolution > 0) {\n    TIFFSetField(tif, TIFFTAG_XRESOLUTION, resolution);\n    TIFFSetField(tif, TIFFTAG_YRESOLUTION, resolution);\n    TIFFSetField(tif, TIFFTAG_RESOLUTIONUNIT, RESUNIT_INCH);\n  }\n}\n\n\n\/\/----------------------------------------------------------------------------\nvoid vtkTIFFWriter::WriteFile(ofstream *, vtkImageData *data,\n  int extent[6])\n{\n  int idx1, idx2;\n  int rowLength; \/\/ in bytes\n  void *ptr;\n\n  \/\/ Make sure we actually have data.\n  if ( !data->GetPointData()->GetScalars())\n    {\n    vtkErrorMacro(<< \"Could not get data from input.\");\n    return;\n    }\n\n  TIFF* tif = reinterpret_cast<TIFF*>(this->TIFFPtr);\n  if ( !tif )\n    {\n    vtkErrorMacro(\"Problem writting trailer.\");\n    this->SetErrorCode(vtkErrorCode::FileFormatError);\n    return;\n    }\n\n  \/\/ take into consideration the scalar type\n  switch (data->GetScalarType())\n    {\n  case VTK_UNSIGNED_CHAR:\n    rowLength = sizeof(unsigned char); \n    break;\n  case VTK_UNSIGNED_SHORT:\n    rowLength = sizeof(unsigned short);\n  default:\n    vtkErrorMacro(\"TIFFWriter only accepts unsigned char scalars!\");\n    return; \n    }\n  rowLength *= data->GetNumberOfScalarComponents();\n  rowLength *= (extent[1] - extent[0] + 1);\n\n  int row = 0;\n  for (idx2 = extent[4]; idx2 <= extent[5]; ++idx2)\n    {\n    for (idx1 = extent[3]; idx1 >= extent[2]; idx1--)\n      {\n      ptr = data->GetScalarPointer(extent[0], idx1, idx2);\n      if ( TIFFWriteScanline(tif, static_cast<unsigned char*>(ptr), row, 0) < 0)\n        {\n        this->SetErrorCode(vtkErrorCode::OutOfDiskSpaceError);\n        break;\n        }\n      row ++;\n      }\n    }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkTIFFWriter::WriteFileTrailer(ofstream *, vtkImageData *)\n{\n  TIFF* tif = reinterpret_cast<TIFF*>(this->TIFFPtr);\n  if ( !tif )\n    {\n    vtkErrorMacro(\"Problem writting trailer.\");\n    this->SetErrorCode(vtkErrorCode::FileFormatError);\n    }\n  TIFFClose(tif);\n  this->TIFFPtr = 0;\n}\n\/\/----------------------------------------------------------------------------\nvoid vtkTIFFWriter::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os,indent);\n\n  os << indent << \"Compression: \";\n  if ( this->Compression == vtkTIFFWriter::PackBits )\n    {\n    os << \"Pack Bits\\n\";\n    }\n  else if ( this->Compression == vtkTIFFWriter::JPEG )\n    {\n    os << \"JPEG\\n\";\n    }\n  else if ( this->Compression == vtkTIFFWriter::Deflate )\n    {\n    os << \"Deflate\\n\";\n    }\n  else if ( this->Compression == vtkTIFFWriter::LZW )\n    {\n    os << \"LZW\\n\";\n    }\n  else \/\/if ( this->Compression == vtkTIFFWriter::NoCompression )\n    {\n    os << \"No Compression\\n\";\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include<meshy.h>\n\nint main(){\n\tmeshy::EventQueue mainEventQueue(5);\n\tmeshy::IoLoop::get().start();\n\treturn 0;\n}\n\n<commit_msg>IoLoop<commit_after>\n#include<meshy.h>\n\nint main(){\n\tmeshy::EventQueue mainEventQueue(5);\n\tIoLoop::get().start();\n\treturn 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <evenk\/synch_queue.h>\n#include <evenk\/thread_pool.h>\n\ntemplate<typename T>\nusing queue = evenk::synch_queue<T>;\n\nint\nmain()\n{\n\tevenk::thread_pool<queue> pool(8);\n\treturn 0;\n}\n<commit_msg>Finish simple thread pool test<commit_after>#include <evenk\/synch_queue.h>\n#include <evenk\/thread_pool.h>\n\ntemplate <typename T>\nusing queue = evenk::synch_queue<T>;\n\nint\nmain()\n{\n\tstatic constexpr std::uint32_t expected = 100 * 1000;\n\tstd::atomic<std::uint32_t> counter = ATOMIC_VAR_INIT(0);\n\n\tevenk::thread_pool<queue> pool(8);\n\tfor (std::uint32_t i = 0; i < expected; i++)\n\t\tpool.submit([&counter] { counter.fetch_add(1, std::memory_order_relaxed); });\n\tpool.wait();\n\n\tstd::uint32_t actual = counter.load(std::memory_order_relaxed);\n\tprintf(\"%u %s\\n\", actual, actual == expected ? \"Okay\" : \"FAIL\");\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * (c) 2019 by Mega Limited, Wellsford, New Zealand\n *\n * This file is part of the MEGA SDK - Client Access Engine.\n *\n * Applications using the MEGA API must present a valid application key\n * and comply with the the rules set forth in the Terms of Service.\n *\n * The MEGA SDK is distributed in the hope 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 * @copyright Simplified (2-clause) BSD License.\n *\n * You should have received a copy of the license along with this\n * program.\n *\/\n\n#include <array>\n#include <tuple>\n\n#include <gtest\/gtest.h>\n\n#include <mega\/utils.h>\n#include <mega\/filesystem.h>\n#include \"megafs.h\"\n\nTEST(utils, hashCombine_integer)\n{\n    size_t hash = 0;\n    mega::hashCombine(hash, 42);\n#ifdef _WIN32\n    \/\/ MSVC's std::hash gives different values than that of gcc\/clang\n    ASSERT_EQ(sizeof(hash) == 4 ? 286246808ul : 10203658983813110072ull, hash);\n#else\n    ASSERT_EQ(2654435811ull, hash);\n#endif\n}\n\nTEST(CharacterSet, IterateUtf8)\n{\n    using mega::unicodeCodepointIterator;\n\n    \/\/ Single code-unit.\n    {\n        auto it = unicodeCodepointIterator(\"abc\");\n\n        EXPECT_FALSE(it.end());\n        EXPECT_EQ(it.get(), 'a');\n        EXPECT_EQ(it.get(), 'b');\n        EXPECT_EQ(it.get(), 'c');\n        EXPECT_TRUE(it.end());\n        EXPECT_EQ(it.get(), '\\0');\n    }\n\n    \/\/ Multiple code-unit.\n    {\n        auto it = unicodeCodepointIterator(\"q\\xf0\\x90\\x80\\x80r\");\n\n        EXPECT_FALSE(it.end());\n        EXPECT_EQ(it.get(), 'q');\n        EXPECT_EQ(it.get(), 0x10000);\n        EXPECT_EQ(it.get(), 'r');\n        EXPECT_TRUE(it.end());\n        EXPECT_EQ(it.get(), '\\0');\n    }\n}\n\nTEST(CharacterSet, IterateUtf16)\n{\n    using mega::unicodeCodepointIterator;\n\n    \/\/ Single code-unit.\n    {\n        auto it = unicodeCodepointIterator(L\"abc\");\n\n        EXPECT_FALSE(it.end());\n        EXPECT_EQ(it.get(), L'a');\n        EXPECT_EQ(it.get(), L'b');\n        EXPECT_EQ(it.get(), L'c');\n        EXPECT_TRUE(it.end());\n        EXPECT_EQ(it.get(), L'\\0');\n    }\n\n    \/\/ Multiple code-unit.\n    {\n        auto it = unicodeCodepointIterator(L\"q\\xd800\\xdc00r\");\n\n        EXPECT_FALSE(it.end());\n        EXPECT_EQ(it.get(), L'q');\n        EXPECT_EQ(it.get(), 0x10000);\n        EXPECT_EQ(it.get(), L'r');\n        EXPECT_TRUE(it.end());\n        EXPECT_EQ(it.get(), L'\\0');\n    }\n}\n\nusing namespace mega;\nusing namespace std;\n\n\/\/ Disambiguate between Microsoft's FileSystemType.\nusing ::mega::FileSystemType;\n\nclass ComparatorTest\n  : public ::testing::Test\n{\npublic:\n    ComparatorTest()\n      : mFSAccess()\n    {\n    }\n\n    template<typename T, typename U>\n    int compare(const T& lhs, const U& rhs) const\n    {\n        return compareUtf(lhs, true, rhs, true, false);\n    }\n\n    template<typename T, typename U>\n    int ciCompare(const T& lhs, const U& rhs) const\n    {\n        return compareUtf(lhs, true, rhs, true, true);\n    }\n\n    LocalPath fromPath(const string& s)\n    {\n        return LocalPath::fromPath(s, mFSAccess);\n    }\n\n    template<typename T, typename U>\n    int fsCompare(const T& lhs, const U& rhs, const FileSystemType type) const\n    {\n        const auto caseInsensitive = isCaseInsensitive(type);\n\n        return compareUtf(lhs, true, rhs, true, caseInsensitive);\n    }\n\nprivate:\n    FSACCESS_CLASS mFSAccess;\n}; \/\/ ComparatorTest\n\nTEST_F(ComparatorTest, CompareLocalPaths)\n{\n    LocalPath lhs;\n    LocalPath rhs;\n\n    \/\/ Case insensitive\n    {\n        \/\/ Make sure basic characters are uppercased.\n        lhs = fromPath(\"abc\");\n        rhs = fromPath(\"ABC\");\n\n        EXPECT_EQ(ciCompare(lhs, rhs), 0);\n        EXPECT_EQ(ciCompare(rhs, lhs), 0);\n\n        \/\/ Make sure comparison invariants are not violated.\n        lhs = fromPath(\"abc\");\n        rhs = fromPath(\"ABCD\");\n\n        EXPECT_LT(ciCompare(lhs, rhs), 0);\n        EXPECT_GT(ciCompare(rhs, lhs), 0);\n\n        \/\/ Make sure escapes are decoded.\n        lhs = fromPath(\"a%30b\");\n        rhs = fromPath(\"A0B\");\n\n        EXPECT_EQ(ciCompare(lhs, rhs), 0);\n        EXPECT_EQ(ciCompare(rhs, lhs), 0);\n\n        \/\/ Make sure decoded characters are uppercased.\n        lhs = fromPath(\"%61%62%63\");\n        rhs = fromPath(\"ABC\");\n\n        EXPECT_EQ(ciCompare(lhs, rhs), 0);\n        EXPECT_EQ(ciCompare(rhs, lhs), 0);\n\n        \/\/ Invalid escapes are left as-is.\n        lhs = fromPath(\"a%qb%\");\n        rhs = fromPath(\"A%qB%\");\n\n        EXPECT_EQ(ciCompare(lhs, rhs), 0);\n        EXPECT_EQ(ciCompare(rhs, lhs), 0);\n    }\n\n    \/\/ Case sensitive\n    {\n        \/\/ Basic comparison.\n        lhs = fromPath(\"abc\");\n\n        EXPECT_EQ(compare(lhs, lhs), 0);\n\n        \/\/ Make sure characters are not uppercased.\n        rhs = fromPath(\"ABC\");\n\n        EXPECT_NE(compare(lhs, rhs), 0);\n        EXPECT_NE(compare(rhs, lhs), 0);\n\n        \/\/ Make sure comparison invariants are not violated.\n        lhs = fromPath(\"abc\");\n        rhs = fromPath(\"abcd\");\n\n        EXPECT_LT(compare(lhs, rhs), 0);\n        EXPECT_GT(compare(rhs, lhs), 0);\n\n        \/\/ Make sure escapes are decoded.\n        lhs = fromPath(\"a%30b\");\n        rhs = fromPath(\"a0b\");\n\n        EXPECT_EQ(compare(lhs, rhs), 0);\n        EXPECT_EQ(compare(rhs, lhs), 0);\n\n        \/\/ Invalid escapes are left as-is.\n        lhs = fromPath(\"a%qb%\");\n\n        EXPECT_EQ(compare(lhs, lhs), 0);\n    }\n\n    \/\/ Filesystem-specific\n    {\n        lhs = fromPath(\"a\\7%30b%31c\");\n        rhs = fromPath(\"A%070B1C\");\n\n        \/\/ exFAT, FAT32, NTFS and UNKNOWN are case-insensitive.\n        EXPECT_EQ(fsCompare(lhs, rhs, FS_EXFAT), 0);\n        EXPECT_EQ(fsCompare(lhs, rhs, FS_FAT32), 0);\n        EXPECT_EQ(fsCompare(lhs, rhs, FS_NTFS), 0);\n        EXPECT_EQ(fsCompare(lhs, rhs, FS_UNKNOWN), 0);\n\n#ifndef _WIN32\n        \/\/ Everything else is case-sensitive.\n        EXPECT_NE(fsCompare(lhs, rhs, FS_EXT), 0);\n\n        rhs = fromPath(\"a%070b1c\");\n        EXPECT_EQ(fsCompare(lhs, rhs, FS_EXT), 0);\n#endif \/\/ ! _WIN32\n    }\n}\n\nTEST_F(ComparatorTest, CompareLocalPathAgainstString)\n{\n    LocalPath lhs;\n    string rhs;\n\n    \/\/ Case insensitive\n    {\n        \/\/ Simple comparison.\n        lhs = fromPath(\"abc\");\n        rhs = \"ABC\";\n\n        EXPECT_EQ(ciCompare(lhs, rhs), 0);\n\n        \/\/ Invariants.\n        lhs = fromPath(\"abc\");\n        rhs = \"abcd\";\n\n        EXPECT_LT(ciCompare(lhs, rhs), 0);\n\n        lhs = fromPath(\"abcd\");\n        rhs = \"abc\";\n\n        EXPECT_GT(ciCompare(lhs, rhs), 0);\n\n        \/\/ All local escapes are decoded.\n        lhs = fromPath(\"a%30b%31c\");\n        rhs = \"A0b1C\";\n\n        EXPECT_EQ(ciCompare(lhs, rhs), 0);\n\n        \/\/ Escapes are uppercased.\n        lhs = fromPath(\"%61%62%63\");\n        rhs = \"ABC\";\n\n        EXPECT_EQ(ciCompare(lhs, rhs), 0);\n\n        \/\/ Invalid escapes are left as-is.\n        lhs = fromPath(\"a%qb%\");\n        rhs = \"A%QB%\";\n\n        EXPECT_EQ(ciCompare(lhs, rhs), 0);\n    }\n\n    \/\/ Case sensitive\n    {\n        \/\/ Simple comparison.\n        lhs = fromPath(\"abc\");\n        rhs = \"abc\";\n\n        EXPECT_EQ(compare(lhs, rhs), 0);\n\n        \/\/ Invariants.\n        rhs = \"abcd\";\n\n        EXPECT_LT(compare(lhs, rhs), 0);\n\n        lhs = fromPath(\"abcd\");\n        rhs = \"abc\";\n\n        EXPECT_GT(compare(lhs, rhs), 0);\n\n        \/\/ All local escapes are decoded.\n        lhs = fromPath(\"a%30b%31c\");\n        rhs = \"a0b1c\";\n\n        EXPECT_EQ(compare(lhs, rhs), 0);\n\n        \/\/ Invalid escapes left as-is.\n        lhs = fromPath(\"a%qb%r\");\n        rhs = \"a%qb%r\";\n\n        EXPECT_EQ(compare(lhs, rhs), 0);\n    }\n\n    \/\/ Filesystem-specific\n    {\n        lhs = fromPath(\"a\\7%30b%31c\");\n        rhs = \"A%070B1C\";\n\n        \/\/ exFAT, FAT32, NTFS and UNKNOWN are case-insensitive.\n        EXPECT_EQ(fsCompare(lhs, rhs, FS_EXFAT), 0);\n        EXPECT_EQ(fsCompare(lhs, rhs, FS_FAT32), 0);\n        EXPECT_EQ(fsCompare(lhs, rhs, FS_NTFS), 0);\n        EXPECT_EQ(fsCompare(lhs, rhs, FS_UNKNOWN), 0);\n\n#ifndef _WIN32\n        \/\/ Everything else is case-sensitive.\n        EXPECT_NE(fsCompare(lhs, rhs, FS_EXT), 0);\n\n        rhs = \"a%070b1c\";\n        EXPECT_EQ(fsCompare(lhs, rhs, FS_EXT), 0);\n#endif \/\/ ! _WIN32\n    }\n}\n\n<commit_msg>Add unit tests for hexval(...).<commit_after>\/**\n * (c) 2019 by Mega Limited, Wellsford, New Zealand\n *\n * This file is part of the MEGA SDK - Client Access Engine.\n *\n * Applications using the MEGA API must present a valid application key\n * and comply with the the rules set forth in the Terms of Service.\n *\n * The MEGA SDK is distributed in the hope 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 * @copyright Simplified (2-clause) BSD License.\n *\n * You should have received a copy of the license along with this\n * program.\n *\/\n\n#include <array>\n#include <tuple>\n\n#include <gtest\/gtest.h>\n\n#include <mega\/utils.h>\n#include <mega\/filesystem.h>\n#include \"megafs.h\"\n\nTEST(utils, hashCombine_integer)\n{\n    size_t hash = 0;\n    mega::hashCombine(hash, 42);\n#ifdef _WIN32\n    \/\/ MSVC's std::hash gives different values than that of gcc\/clang\n    ASSERT_EQ(sizeof(hash) == 4 ? 286246808ul : 10203658983813110072ull, hash);\n#else\n    ASSERT_EQ(2654435811ull, hash);\n#endif\n}\n\nTEST(CharacterSet, IterateUtf8)\n{\n    using mega::unicodeCodepointIterator;\n\n    \/\/ Single code-unit.\n    {\n        auto it = unicodeCodepointIterator(\"abc\");\n\n        EXPECT_FALSE(it.end());\n        EXPECT_EQ(it.get(), 'a');\n        EXPECT_EQ(it.get(), 'b');\n        EXPECT_EQ(it.get(), 'c');\n        EXPECT_TRUE(it.end());\n        EXPECT_EQ(it.get(), '\\0');\n    }\n\n    \/\/ Multiple code-unit.\n    {\n        auto it = unicodeCodepointIterator(\"q\\xf0\\x90\\x80\\x80r\");\n\n        EXPECT_FALSE(it.end());\n        EXPECT_EQ(it.get(), 'q');\n        EXPECT_EQ(it.get(), 0x10000);\n        EXPECT_EQ(it.get(), 'r');\n        EXPECT_TRUE(it.end());\n        EXPECT_EQ(it.get(), '\\0');\n    }\n}\n\nTEST(CharacterSet, IterateUtf16)\n{\n    using mega::unicodeCodepointIterator;\n\n    \/\/ Single code-unit.\n    {\n        auto it = unicodeCodepointIterator(L\"abc\");\n\n        EXPECT_FALSE(it.end());\n        EXPECT_EQ(it.get(), L'a');\n        EXPECT_EQ(it.get(), L'b');\n        EXPECT_EQ(it.get(), L'c');\n        EXPECT_TRUE(it.end());\n        EXPECT_EQ(it.get(), L'\\0');\n    }\n\n    \/\/ Multiple code-unit.\n    {\n        auto it = unicodeCodepointIterator(L\"q\\xd800\\xdc00r\");\n\n        EXPECT_FALSE(it.end());\n        EXPECT_EQ(it.get(), L'q');\n        EXPECT_EQ(it.get(), 0x10000);\n        EXPECT_EQ(it.get(), L'r');\n        EXPECT_TRUE(it.end());\n        EXPECT_EQ(it.get(), L'\\0');\n    }\n}\n\nusing namespace mega;\nusing namespace std;\n\n\/\/ Disambiguate between Microsoft's FileSystemType.\nusing ::mega::FileSystemType;\n\nclass ComparatorTest\n  : public ::testing::Test\n{\npublic:\n    ComparatorTest()\n      : mFSAccess()\n    {\n    }\n\n    template<typename T, typename U>\n    int compare(const T& lhs, const U& rhs) const\n    {\n        return compareUtf(lhs, true, rhs, true, false);\n    }\n\n    template<typename T, typename U>\n    int ciCompare(const T& lhs, const U& rhs) const\n    {\n        return compareUtf(lhs, true, rhs, true, true);\n    }\n\n    LocalPath fromPath(const string& s)\n    {\n        return LocalPath::fromPath(s, mFSAccess);\n    }\n\n    template<typename T, typename U>\n    int fsCompare(const T& lhs, const U& rhs, const FileSystemType type) const\n    {\n        const auto caseInsensitive = isCaseInsensitive(type);\n\n        return compareUtf(lhs, true, rhs, true, caseInsensitive);\n    }\n\nprivate:\n    FSACCESS_CLASS mFSAccess;\n}; \/\/ ComparatorTest\n\nTEST_F(ComparatorTest, CompareLocalPaths)\n{\n    LocalPath lhs;\n    LocalPath rhs;\n\n    \/\/ Case insensitive\n    {\n        \/\/ Make sure basic characters are uppercased.\n        lhs = fromPath(\"abc\");\n        rhs = fromPath(\"ABC\");\n\n        EXPECT_EQ(ciCompare(lhs, rhs), 0);\n        EXPECT_EQ(ciCompare(rhs, lhs), 0);\n\n        \/\/ Make sure comparison invariants are not violated.\n        lhs = fromPath(\"abc\");\n        rhs = fromPath(\"ABCD\");\n\n        EXPECT_LT(ciCompare(lhs, rhs), 0);\n        EXPECT_GT(ciCompare(rhs, lhs), 0);\n\n        \/\/ Make sure escapes are decoded.\n        lhs = fromPath(\"a%30b\");\n        rhs = fromPath(\"A0B\");\n\n        EXPECT_EQ(ciCompare(lhs, rhs), 0);\n        EXPECT_EQ(ciCompare(rhs, lhs), 0);\n\n        \/\/ Make sure decoded characters are uppercased.\n        lhs = fromPath(\"%61%62%63\");\n        rhs = fromPath(\"ABC\");\n\n        EXPECT_EQ(ciCompare(lhs, rhs), 0);\n        EXPECT_EQ(ciCompare(rhs, lhs), 0);\n\n        \/\/ Invalid escapes are left as-is.\n        lhs = fromPath(\"a%qb%\");\n        rhs = fromPath(\"A%qB%\");\n\n        EXPECT_EQ(ciCompare(lhs, rhs), 0);\n        EXPECT_EQ(ciCompare(rhs, lhs), 0);\n    }\n\n    \/\/ Case sensitive\n    {\n        \/\/ Basic comparison.\n        lhs = fromPath(\"abc\");\n\n        EXPECT_EQ(compare(lhs, lhs), 0);\n\n        \/\/ Make sure characters are not uppercased.\n        rhs = fromPath(\"ABC\");\n\n        EXPECT_NE(compare(lhs, rhs), 0);\n        EXPECT_NE(compare(rhs, lhs), 0);\n\n        \/\/ Make sure comparison invariants are not violated.\n        lhs = fromPath(\"abc\");\n        rhs = fromPath(\"abcd\");\n\n        EXPECT_LT(compare(lhs, rhs), 0);\n        EXPECT_GT(compare(rhs, lhs), 0);\n\n        \/\/ Make sure escapes are decoded.\n        lhs = fromPath(\"a%30b\");\n        rhs = fromPath(\"a0b\");\n\n        EXPECT_EQ(compare(lhs, rhs), 0);\n        EXPECT_EQ(compare(rhs, lhs), 0);\n\n        \/\/ Invalid escapes are left as-is.\n        lhs = fromPath(\"a%qb%\");\n\n        EXPECT_EQ(compare(lhs, lhs), 0);\n    }\n\n    \/\/ Filesystem-specific\n    {\n        lhs = fromPath(\"a\\7%30b%31c\");\n        rhs = fromPath(\"A%070B1C\");\n\n        \/\/ exFAT, FAT32, NTFS and UNKNOWN are case-insensitive.\n        EXPECT_EQ(fsCompare(lhs, rhs, FS_EXFAT), 0);\n        EXPECT_EQ(fsCompare(lhs, rhs, FS_FAT32), 0);\n        EXPECT_EQ(fsCompare(lhs, rhs, FS_NTFS), 0);\n        EXPECT_EQ(fsCompare(lhs, rhs, FS_UNKNOWN), 0);\n\n#ifndef _WIN32\n        \/\/ Everything else is case-sensitive.\n        EXPECT_NE(fsCompare(lhs, rhs, FS_EXT), 0);\n\n        rhs = fromPath(\"a%070b1c\");\n        EXPECT_EQ(fsCompare(lhs, rhs, FS_EXT), 0);\n#endif \/\/ ! _WIN32\n    }\n}\n\nTEST_F(ComparatorTest, CompareLocalPathAgainstString)\n{\n    LocalPath lhs;\n    string rhs;\n\n    \/\/ Case insensitive\n    {\n        \/\/ Simple comparison.\n        lhs = fromPath(\"abc\");\n        rhs = \"ABC\";\n\n        EXPECT_EQ(ciCompare(lhs, rhs), 0);\n\n        \/\/ Invariants.\n        lhs = fromPath(\"abc\");\n        rhs = \"abcd\";\n\n        EXPECT_LT(ciCompare(lhs, rhs), 0);\n\n        lhs = fromPath(\"abcd\");\n        rhs = \"abc\";\n\n        EXPECT_GT(ciCompare(lhs, rhs), 0);\n\n        \/\/ All local escapes are decoded.\n        lhs = fromPath(\"a%30b%31c\");\n        rhs = \"A0b1C\";\n\n        EXPECT_EQ(ciCompare(lhs, rhs), 0);\n\n        \/\/ Escapes are uppercased.\n        lhs = fromPath(\"%61%62%63\");\n        rhs = \"ABC\";\n\n        EXPECT_EQ(ciCompare(lhs, rhs), 0);\n\n        \/\/ Invalid escapes are left as-is.\n        lhs = fromPath(\"a%qb%\");\n        rhs = \"A%QB%\";\n\n        EXPECT_EQ(ciCompare(lhs, rhs), 0);\n    }\n\n    \/\/ Case sensitive\n    {\n        \/\/ Simple comparison.\n        lhs = fromPath(\"abc\");\n        rhs = \"abc\";\n\n        EXPECT_EQ(compare(lhs, rhs), 0);\n\n        \/\/ Invariants.\n        rhs = \"abcd\";\n\n        EXPECT_LT(compare(lhs, rhs), 0);\n\n        lhs = fromPath(\"abcd\");\n        rhs = \"abc\";\n\n        EXPECT_GT(compare(lhs, rhs), 0);\n\n        \/\/ All local escapes are decoded.\n        lhs = fromPath(\"a%30b%31c\");\n        rhs = \"a0b1c\";\n\n        EXPECT_EQ(compare(lhs, rhs), 0);\n\n        \/\/ Invalid escapes left as-is.\n        lhs = fromPath(\"a%qb%r\");\n        rhs = \"a%qb%r\";\n\n        EXPECT_EQ(compare(lhs, rhs), 0);\n    }\n\n    \/\/ Filesystem-specific\n    {\n        lhs = fromPath(\"a\\7%30b%31c\");\n        rhs = \"A%070B1C\";\n\n        \/\/ exFAT, FAT32, NTFS and UNKNOWN are case-insensitive.\n        EXPECT_EQ(fsCompare(lhs, rhs, FS_EXFAT), 0);\n        EXPECT_EQ(fsCompare(lhs, rhs, FS_FAT32), 0);\n        EXPECT_EQ(fsCompare(lhs, rhs, FS_NTFS), 0);\n        EXPECT_EQ(fsCompare(lhs, rhs, FS_UNKNOWN), 0);\n\n#ifndef _WIN32\n        \/\/ Everything else is case-sensitive.\n        EXPECT_NE(fsCompare(lhs, rhs, FS_EXT), 0);\n\n        rhs = \"a%070b1c\";\n        EXPECT_EQ(fsCompare(lhs, rhs, FS_EXT), 0);\n#endif \/\/ ! _WIN32\n    }\n}\n\nTEST(Conversion, HexVal)\n{\n    \/\/ Decimal [0-9]\n    for (int i = 0x30; i < 0x3a; ++i)\n    {\n        EXPECT_EQ(hexval(i), i - 0x30);\n    }\n    \n    \/\/ Lowercase hexadecimal [a-f]\n    for (int i = 0x41; i < 0x47; ++i)\n    {\n        EXPECT_EQ(hexval(i), i - 0x37);\n    }\n\n    \/\/ Uppercase hexadeimcal [A-F]\n    for (int i = 0x61; i < 0x67; ++i)\n    {\n        EXPECT_EQ(hexval(i), i - 0x57);\n    }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"OSD.h\"\n\n#include <algorithm>\n\n#include \"..\\3RVX.h\"\n#include \"..\\DisplayManager.h\"\n#include \"..\\Error.h\"\n#include \"..\\HotkeyInfo.h\"\n#include \"..\\Monitor.h\"\n\n#define DISPLAY_EDGE_OFFSET 140\n\nOSD::OSD(LPCWSTR className, HINSTANCE hInstance) :\n_className(className) {\n\n    if (hInstance == NULL) {\n        hInstance = (HINSTANCE) GetModuleHandle(NULL);\n    }\n    _hInstance = hInstance;\n\n    WNDCLASSEX wcex;\n\n    wcex.cbSize = sizeof(WNDCLASSEX);\n    wcex.style = NULL;\n    wcex.lpfnWndProc = &OSD::StaticWndProc;\n    wcex.cbClsExtra = NULL;\n    wcex.cbWndExtra = NULL;\n    wcex.hInstance = hInstance;\n    wcex.hIcon = LoadIcon(NULL, IDI_APPLICATION);\n    wcex.hCursor = LoadCursor(NULL, IDC_ARROW);\n    wcex.hbrBackground = (HBRUSH) (COLOR_WINDOW + 1);\n    wcex.lpszMenuName = NULL;\n    wcex.lpszClassName = _className;\n    wcex.hIconSm = LoadIcon(NULL, IDI_APPLICATION);\n\n    if (!RegisterClassEx(&wcex)) {\n        throw SYSERR_REGISTERCLASS;\n    }\n\n    _hWnd = CreateWindowEx(NULL,\n        className, className,\n        NULL, NULL, NULL, NULL, NULL, NULL, NULL, hInstance, this);\n\n    if (_hWnd == NULL) {\n        throw SYSERR_CREATEWINDOW;\n    }\n\n    _masterWnd = FindWindow(L\"3RVXv3\", L\"3RVXv3\");\n}\n\nOSD::~OSD() {\n    DestroyWindow(_hWnd);\n    UnregisterClass(_className, _hInstance);\n}\n\nvoid OSD::HideOthers(OSDType except = All) {\n    SendMessage(_masterWnd, WM_3RVX_CONTROL, MSG_HIDEOSD, except);\n}\n\nstd::vector<Monitor> OSD::ActiveMonitors() {\n    std::vector<Monitor> monitors;\n    std::wstring monitorStr = Settings::Instance()->Monitor();\n\n    if (monitorStr == L\"\") {\n        \/* Primary Monitor *\/\n        monitors.push_back(DisplayManager::Primary());\n        CLOG(L\"Monitor: (Primary)\");\n\n    } else if (monitorStr == L\"*\") {\n        \/* All Monitors *\/\n        std::unordered_map<std::wstring, Monitor> map\n            = DisplayManager::MonitorMap();\n\n        for (auto it = map.begin(); it != map.end(); ++it) {\n            CLOG(L\"Monitor: %s\", it->first.c_str());\n            monitors.push_back(it->second);\n        }\n    } else {\n        \/* Specific Monitor *\/\n        std::unordered_map<std::wstring, Monitor> map \n            = DisplayManager::MonitorMap();\n\n        for (auto it = map.begin(); it != map.end(); ++it) {\n            if (monitorStr == it->first) {\n                CLOG(L\"Monitor: %s\", it->first.c_str());\n                monitors.push_back(it->second);\n                break;\n            }\n        }\n    }\n\n    return monitors;\n}\n\nvoid OSD::PositionWindow(Monitor monitor, LayeredWnd &lWnd) {\n    Settings::OSDPos pos = Settings::Instance()->OSDPosition();\n\n    if (pos == Settings::OSDPos::Custom) {\n        int customX = Settings::Instance()->OSDX();\n        int customY = Settings::Instance()->OSDY();\n        lWnd.X(customX);\n        lWnd.Y(customY);\n        return;\n    }\n\n    int offset = Settings::Instance()->OSDEdgeOffset();\n\n    \/* Edge cases ;-) *\/\n    switch (pos) {\n    case Settings::TopLeft:\n        lWnd.X(monitor.X() + offset);\n        lWnd.Y(monitor.Y() + offset);\n        return;\n\n    case Settings::TopRight:\n        lWnd.X(monitor.X() + monitor.Width() - lWnd.Width() - offset);\n        lWnd.Y(monitor.Y() + offset);\n        return;\n\n    case Settings::BottomLeft:\n        lWnd.X(monitor.X() + offset);\n        lWnd.Y(monitor.Y() + monitor.Height() - lWnd.Height() - offset);\n        return;\n\n    case Settings::BottomRight:\n        lWnd.X(monitor.X() + monitor.Width() - lWnd.Width() - offset);\n        lWnd.Y(monitor.Y() + monitor.Height() - lWnd.Height() - offset);\n        return;\n    }\n\n    \/* Center *\/\n    CenterWindowX(monitor, lWnd);\n    CenterWindowY(monitor, lWnd);\n    if (pos == Settings::OSDPos::Center) {\n        return;\n    }\n\n    \/* We're centered. Now adjust based on top, bottom, left, or right: *\/\n\n    switch (pos) {\n    case Settings::Top:\n        lWnd.Y(monitor.Y() + offset);\n        return;\n\n    case Settings::Bottom:\n        lWnd.Y(monitor.Y() + monitor.Height() - lWnd.Height() - offset);\n        return;\n\n    case Settings::Left:\n        lWnd.X(monitor.X() + offset);\n        return;\n\n    case Settings::Right:\n        lWnd.X(monitor.X() + monitor.Width() - lWnd.Width() - offset);\n        return;\n    }\n}\n\nvoid OSD::CenterWindowX(Monitor monitor, LayeredWnd &lWnd) {\n    lWnd.X(monitor.X() + monitor.Width() \/ 2 - lWnd.Width() \/ 2);\n}\n\nvoid OSD::CenterWindowY(Monitor monitor, LayeredWnd &lWnd) {\n    lWnd.Y(monitor.Y() + monitor.Height() \/ 2 - lWnd.Height() \/ 2);\n}\n\nvoid OSD::ProcessHotkeys(HotkeyInfo &hki) {\n\n}\n\nLRESULT CALLBACK\nOSD::StaticWndProc(\nHWND hWnd, UINT message, WPARAM wParam, LPARAM lParam) {\n    OSD *osd;\n\n    if (message == WM_CREATE) {\n        osd = (OSD *) ((LPCREATESTRUCT) lParam)->lpCreateParams;\n        SetWindowLongPtr(hWnd, GWLP_USERDATA, (LONG_PTR) osd);\n    } else {\n        osd = (OSD *) GetWindowLongPtr(hWnd, GWLP_USERDATA);\n        if (!osd) {\n            return DefWindowProc(hWnd, message, wParam, lParam);\n        }\n    }\n\n    return osd->WndProc(hWnd, message, wParam, lParam);\n}\n\nLRESULT\nOSD::WndProc(HWND hWnd, UINT message, WPARAM wParam, LPARAM lParam) {\n    return DefWindowProc(hWnd, message, wParam, lParam);\n}<commit_msg>Remove unused #define<commit_after>#include \"OSD.h\"\n\n#include <algorithm>\n\n#include \"..\\3RVX.h\"\n#include \"..\\DisplayManager.h\"\n#include \"..\\Error.h\"\n#include \"..\\HotkeyInfo.h\"\n#include \"..\\Monitor.h\"\n\nOSD::OSD(LPCWSTR className, HINSTANCE hInstance) :\n_className(className) {\n\n    if (hInstance == NULL) {\n        hInstance = (HINSTANCE) GetModuleHandle(NULL);\n    }\n    _hInstance = hInstance;\n\n    WNDCLASSEX wcex;\n\n    wcex.cbSize = sizeof(WNDCLASSEX);\n    wcex.style = NULL;\n    wcex.lpfnWndProc = &OSD::StaticWndProc;\n    wcex.cbClsExtra = NULL;\n    wcex.cbWndExtra = NULL;\n    wcex.hInstance = hInstance;\n    wcex.hIcon = LoadIcon(NULL, IDI_APPLICATION);\n    wcex.hCursor = LoadCursor(NULL, IDC_ARROW);\n    wcex.hbrBackground = (HBRUSH) (COLOR_WINDOW + 1);\n    wcex.lpszMenuName = NULL;\n    wcex.lpszClassName = _className;\n    wcex.hIconSm = LoadIcon(NULL, IDI_APPLICATION);\n\n    if (!RegisterClassEx(&wcex)) {\n        throw SYSERR_REGISTERCLASS;\n    }\n\n    _hWnd = CreateWindowEx(NULL,\n        className, className,\n        NULL, NULL, NULL, NULL, NULL, NULL, NULL, hInstance, this);\n\n    if (_hWnd == NULL) {\n        throw SYSERR_CREATEWINDOW;\n    }\n\n    _masterWnd = FindWindow(L\"3RVXv3\", L\"3RVXv3\");\n}\n\nOSD::~OSD() {\n    DestroyWindow(_hWnd);\n    UnregisterClass(_className, _hInstance);\n}\n\nvoid OSD::HideOthers(OSDType except = All) {\n    SendMessage(_masterWnd, WM_3RVX_CONTROL, MSG_HIDEOSD, except);\n}\n\nstd::vector<Monitor> OSD::ActiveMonitors() {\n    std::vector<Monitor> monitors;\n    std::wstring monitorStr = Settings::Instance()->Monitor();\n\n    if (monitorStr == L\"\") {\n        \/* Primary Monitor *\/\n        monitors.push_back(DisplayManager::Primary());\n        CLOG(L\"Monitor: (Primary)\");\n\n    } else if (monitorStr == L\"*\") {\n        \/* All Monitors *\/\n        std::unordered_map<std::wstring, Monitor> map\n            = DisplayManager::MonitorMap();\n\n        for (auto it = map.begin(); it != map.end(); ++it) {\n            CLOG(L\"Monitor: %s\", it->first.c_str());\n            monitors.push_back(it->second);\n        }\n    } else {\n        \/* Specific Monitor *\/\n        std::unordered_map<std::wstring, Monitor> map \n            = DisplayManager::MonitorMap();\n\n        for (auto it = map.begin(); it != map.end(); ++it) {\n            if (monitorStr == it->first) {\n                CLOG(L\"Monitor: %s\", it->first.c_str());\n                monitors.push_back(it->second);\n                break;\n            }\n        }\n    }\n\n    return monitors;\n}\n\nvoid OSD::PositionWindow(Monitor monitor, LayeredWnd &lWnd) {\n    Settings::OSDPos pos = Settings::Instance()->OSDPosition();\n\n    if (pos == Settings::OSDPos::Custom) {\n        int customX = Settings::Instance()->OSDX();\n        int customY = Settings::Instance()->OSDY();\n        lWnd.X(customX);\n        lWnd.Y(customY);\n        return;\n    }\n\n    int offset = Settings::Instance()->OSDEdgeOffset();\n\n    \/* Edge cases ;-) *\/\n    switch (pos) {\n    case Settings::TopLeft:\n        lWnd.X(monitor.X() + offset);\n        lWnd.Y(monitor.Y() + offset);\n        return;\n\n    case Settings::TopRight:\n        lWnd.X(monitor.X() + monitor.Width() - lWnd.Width() - offset);\n        lWnd.Y(monitor.Y() + offset);\n        return;\n\n    case Settings::BottomLeft:\n        lWnd.X(monitor.X() + offset);\n        lWnd.Y(monitor.Y() + monitor.Height() - lWnd.Height() - offset);\n        return;\n\n    case Settings::BottomRight:\n        lWnd.X(monitor.X() + monitor.Width() - lWnd.Width() - offset);\n        lWnd.Y(monitor.Y() + monitor.Height() - lWnd.Height() - offset);\n        return;\n    }\n\n    \/* Center *\/\n    CenterWindowX(monitor, lWnd);\n    CenterWindowY(monitor, lWnd);\n    if (pos == Settings::OSDPos::Center) {\n        return;\n    }\n\n    \/* We're centered. Now adjust based on top, bottom, left, or right: *\/\n\n    switch (pos) {\n    case Settings::Top:\n        lWnd.Y(monitor.Y() + offset);\n        return;\n\n    case Settings::Bottom:\n        lWnd.Y(monitor.Y() + monitor.Height() - lWnd.Height() - offset);\n        return;\n\n    case Settings::Left:\n        lWnd.X(monitor.X() + offset);\n        return;\n\n    case Settings::Right:\n        lWnd.X(monitor.X() + monitor.Width() - lWnd.Width() - offset);\n        return;\n    }\n}\n\nvoid OSD::CenterWindowX(Monitor monitor, LayeredWnd &lWnd) {\n    lWnd.X(monitor.X() + monitor.Width() \/ 2 - lWnd.Width() \/ 2);\n}\n\nvoid OSD::CenterWindowY(Monitor monitor, LayeredWnd &lWnd) {\n    lWnd.Y(monitor.Y() + monitor.Height() \/ 2 - lWnd.Height() \/ 2);\n}\n\nvoid OSD::ProcessHotkeys(HotkeyInfo &hki) {\n\n}\n\nLRESULT CALLBACK\nOSD::StaticWndProc(\nHWND hWnd, UINT message, WPARAM wParam, LPARAM lParam) {\n    OSD *osd;\n\n    if (message == WM_CREATE) {\n        osd = (OSD *) ((LPCREATESTRUCT) lParam)->lpCreateParams;\n        SetWindowLongPtr(hWnd, GWLP_USERDATA, (LONG_PTR) osd);\n    } else {\n        osd = (OSD *) GetWindowLongPtr(hWnd, GWLP_USERDATA);\n        if (!osd) {\n            return DefWindowProc(hWnd, message, wParam, lParam);\n        }\n    }\n\n    return osd->WndProc(hWnd, message, wParam, lParam);\n}\n\nLRESULT\nOSD::WndProc(HWND hWnd, UINT message, WPARAM wParam, LPARAM lParam) {\n    return DefWindowProc(hWnd, message, wParam, lParam);\n}<|endoftext|>"}
{"text":"<commit_before>\/*********************************************************************************\n *\n * Copyright (c) 2017 Josef Adamsson\n *\n * Inviwo - Interactive Visualization Workshop\n *\n * Copyright (c) 2017 Inviwo Foundation\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *********************************************************************************\/\n\n#include <modules\/crystalvisualization\/processors\/coordinatereader.h>\n#include <modules\/hdf5\/datastructures\/hdf5handle.h>\n#include <modules\/hdf5\/datastructures\/hdf5path.h>\n\nnamespace inviwo {\n\n\/\/ The Class Identifier has to be globally unique. Use a reverse DNS naming scheme\nconst ProcessorInfo CoordinateReader::processorInfo_{\n    \"envision.CoordinateReader\",      \/\/ Class identifier\n    \"Coordinate Reader\",                \/\/ Display name\n    \"Crystal\",                          \/\/ Category\n    CodeState::Experimental,  \/\/ Code state\n    Tags::None,               \/\/ Tags\n};\nconst ProcessorInfo CoordinateReader::getProcessorInfo() const {\n    return processorInfo_;\n}\n\nCoordinateReader::CoordinateReader()\n    : Processor()\n    , outport_(\"outport\")\n    , inport_(\"inport\")\n\n    \/\/ New property for animations\n    , timestep_(\"timestep\", \"Time step\", false)\n    , path_(\"path\", \"Path\", \"\", InvalidationLevel::InvalidOutput, PropertySemantics::Default) {\n\n    addPort(outport_);\n    addPort(inport_);\n\n    \/\/ New property for animations\n    addProperty(timestep_);\n    addProperty(path_);\n}\n\nvoid CoordinateReader::process() {\n    const auto h5path = hdf5::Path(path_.get());\n    const auto data = inport_.getData();\n    \n\/*\nif ibrion = 0\n  timeh5 = h5path.split('\/')\nelse\n\n\n*\/\n\n    auto vecptr = std::make_shared<std::vector<vec3>>(data->getVectorOfVec3AtPath<float>(h5path));\n    outport_.setData(vecptr);\n}\n\n} \/\/ namespace\n<commit_msg>Lagt till funktion i CoordnateReader som hanterar animation<commit_after>\/*********************************************************************************\n *\n * Copyright (c) 2017 Josef Adamsson\n *\n * Inviwo - Interactive Visualization Workshop\n *\n * Copyright (c) 2017 Inviwo Foundation\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *********************************************************************************\/\n #include <iostream>       \/\/ std::cout\n #include <string>         \/\/ std::string\n #include <cstddef>         \/\/ std::size_t\n#include <modules\/crystalvisualization\/processors\/coordinatereader.h>\n#include <modules\/hdf5\/datastructures\/hdf5handle.h>\n#include <modules\/hdf5\/datastructures\/hdf5path.h>\n\nnamespace inviwo {\n\n\/\/ The Class Identifier has to be globally unique. Use a reverse DNS naming scheme\nconst ProcessorInfo CoordinateReader::processorInfo_{\n    \"envision.CoordinateReader\",      \/\/ Class identifier\n    \"Coordinate Reader\",                \/\/ Display name\n    \"Crystal\",                          \/\/ Category\n    CodeState::Experimental,  \/\/ Code state\n    Tags::None,               \/\/ Tags\n};\nconst ProcessorInfo CoordinateReader::getProcessorInfo() const {\n    return processorInfo_;\n}\n\nCoordinateReader::CoordinateReader()\n    : Processor()\n    , outport_(\"outport\")\n    , inport_(\"inport\")\n\n    \/\/ New property for animations\n    , timestep_(\"timestep\", \"Time step\", false)\n    , path_(\"path\", \"Path\", \"\", InvalidationLevel::InvalidOutput, PropertySemantics::Default) {\n\n    addPort(outport_);\n    addPort(inport_);\n\n    \/\/ New property for animations\n    addProperty(timestep_);\n    addProperty(path_);\n}\n\nvoid CoordinateReader::process() {\n\n\n\/\/Replacement string for path\nauto path = path_.get();\n\n\/\/Find last '\/' of path_ to be able to insert numbers\n  int posStart = path.find_last_of('\/') - 4;\n\n\/\/Function for counting how many digits\n  int timestepINT = timestep_.get();\n  int temp = timestep_.get();\n  int count = 0;\n    while (temp >= 1)\n    {\n        temp = temp \/ 10;\n        ++count;\n    }\n\n \/\/If only one digit\n  if (count == 1)\n  {\n    path.replace(posStart, 4, (\"000\" +  std::to_string(timestepINT)));\n  }\n  \/\/If two digits\n  if (count == 2)\n  {\n   path.replace(posStart, 4, (\"00\" +  std::to_string(timestepINT)));\n  }\n  \/\/If three digits\n  if (count == 3)\n  {\n   path.replace(posStart, 4, (\"0\" +  std::to_string(timestepINT)));\n  }\n  \/\/If four digits\n  if (count == 4)\n  {\n   path.replace(posStart, 4,  std::to_string(timestepINT));\n  }\n\n  path_.set(path);\n\n  const auto h5path = hdf5::Path(path_.get());\n  const auto data = inport_.getData();\n\n\n\n    auto vecptr = std::make_shared<std::vector<vec3>>(data->getVectorOfVec3AtPath<float>(h5path));\n    outport_.setData(vecptr);\n}\n\n} \/\/ namespace\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * The MIT License (MIT)\n *\n * Copyright (c) 2015 Microsoft Corporation\n *\n * -=- Robust Distributed System Nucleus (rDSN) -=-\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 * Description:\n *     the meta server's date structure, impl file\n *\n * Revision history:\n *     2016-04-25, Weijie Sun(sunweijie at xiaomi.com), first version\n *     xxxx-xx-xx, author, fix bug about xxx\n *\/\n#include <boost\/lexical_cast.hpp>\n#include <dsn\/service_api_cpp.h>\n#include \"meta_data.h\"\n\nnamespace dsn {\nnamespace replication {\n\nvoid when_update_replicas(config_type::type t, const std::function<void(bool)> &func)\n{\n    switch (t) {\n    case config_type::CT_ASSIGN_PRIMARY:\n    case config_type::CT_UPGRADE_TO_PRIMARY:\n    case config_type::CT_UPGRADE_TO_SECONDARY:\n        func(true);\n        break;\n    case config_type::CT_DOWNGRADE_TO_INACTIVE:\n    case config_type::CT_REMOVE:\n    case config_type::CT_DROP_PARTITION:\n        func(false);\n        break;\n    default:\n        break;\n    }\n}\n\nvoid maintain_drops(std::vector<rpc_address> &drops, const rpc_address &node, config_type::type t)\n{\n    auto action = [&drops, &node](bool is_adding) {\n        auto it = std::find(drops.begin(), drops.end(), node);\n        if (is_adding) {\n            if (it != drops.end()) {\n                drops.erase(it);\n            }\n        } else {\n            dassert(it == drops.end(),\n                    \"the node(%s) cannot be in drops set before this update\",\n                    node.to_string());\n            drops.push_back(node);\n            if (drops.size() > 3) {\n                drops.erase(drops.begin());\n            }\n        }\n    };\n    when_update_replicas(t, action);\n}\n\nint config_context::MAX_REPLICA_COUNT_IN_GRROUP = 4;\nvoid config_context::cancel_sync()\n{\n    if (config_status::pending_remote_sync == stage) {\n        pending_sync_task->cancel(false);\n        pending_sync_task = nullptr;\n        pending_sync_request.reset();\n    }\n    if (msg) {\n        dsn_msg_release_ref(msg);\n    }\n    msg = nullptr;\n    stage = config_status::not_pending;\n}\n\nvoid config_context::check_size()\n{\n    while (replica_count(*config_owner) + dropped.size() > MAX_REPLICA_COUNT_IN_GRROUP) {\n        dropped.erase(dropped.begin());\n        prefered_dropped = (int)dropped.size() - 1;\n    }\n}\n\nstd::vector<dropped_replica>::iterator config_context::find_from_dropped(const rpc_address &node)\n{\n    return std::find_if(dropped.begin(), dropped.end(), [&node](const dropped_replica &r) {\n        return r.node == node;\n    });\n}\n\nbool config_context::remove_from_dropped(const rpc_address &node)\n{\n    auto iter = find_from_dropped(node);\n    if (iter != dropped.end()) {\n        dropped.erase(iter);\n        prefered_dropped = (int)dropped.size() - 1;\n        return true;\n    }\n    return false;\n}\n\nbool config_context::record_drop_history(const rpc_address &node)\n{\n    auto iter = find_from_dropped(node);\n    if (iter != dropped.end())\n        return false;\n    dropped.emplace_back(\n        dropped_replica{node, dsn_now_ms(), invalid_ballot, invalid_decree, invalid_decree});\n    prefered_dropped = (int)dropped.size() - 1;\n    check_size();\n    return true;\n}\n\nint config_context::collect_drop_replica(const rpc_address &node, const replica_info &info)\n{\n    bool in_dropped = false;\n    auto iter = find_from_dropped(node);\n    uint64_t last_drop_time = dropped_replica::INVALID_TIMESTAMP;\n    if (iter != dropped.end()) {\n        in_dropped = true;\n        last_drop_time = iter->time;\n        dropped.erase(iter);\n        prefered_dropped = (int)dropped.size() - 1;\n    }\n\n    dropped_replica current = {\n        node, last_drop_time, info.ballot, info.last_committed_decree, info.last_prepared_decree};\n    auto cmp = [](const dropped_replica &d1, const dropped_replica &d2) {\n        return dropped_cmp(d1, d2) < 0;\n    };\n    iter = std::lower_bound(dropped.begin(), dropped.end(), current, cmp);\n\n    dropped.emplace(iter, current);\n    prefered_dropped = (int)dropped.size() - 1;\n    check_size();\n\n    iter = find_from_dropped(node);\n    if (iter == dropped.end()) {\n        dassert(!in_dropped,\n                \"adjust position of existing node(%s) failed, this is a bug, partition(%d.%d)\",\n                node.to_string(),\n                config_owner->pid.get_app_id(),\n                config_owner->pid.get_partition_index());\n        return -1;\n    }\n    return in_dropped ? 1 : 0;\n}\n\nbool config_context::check_order()\n{\n    if (dropped.empty())\n        return true;\n    for (unsigned int i = 0; i < dropped.size() - 1; ++i) {\n        if (dropped_cmp(dropped[i], dropped[i + 1]) > 0) {\n            derror(\"check dropped order for gpid(%d.%d) failed, [%s,%llu,%lld,%lld,%lld@%d] vs \"\n                   \"[%s,%llu,%lld,%lld,%lld@%d]\",\n                   config_owner->pid.get_app_id(),\n                   config_owner->pid.get_partition_index(),\n                   dropped[i].node.to_string(),\n                   dropped[i].time,\n                   dropped[i].ballot,\n                   dropped[i].last_committed_decree,\n                   dropped[i].last_prepared_decree,\n                   i,\n                   dropped[i].node.to_string(),\n                   dropped[i].time,\n                   dropped[i].ballot,\n                   dropped[i].last_committed_decree,\n                   dropped[i].last_prepared_decree,\n                   i + 1);\n            return false;\n        }\n    }\n    return true;\n}\n\nvoid app_state_helper::on_init_partitions()\n{\n    config_context context;\n    context.stage = config_status::not_pending;\n    context.pending_sync_task = nullptr;\n    context.msg = nullptr;\n    context.lb_actions.from_balancer = false;\n\n    context.prefered_dropped = -1;\n    contexts.assign(owner->partition_count, context);\n\n    std::vector<partition_configuration> &partitions = owner->partitions;\n    for (unsigned int i = 0; i != owner->partition_count; ++i) {\n        contexts[i].config_owner = &(partitions[i]);\n    }\n\n    partitions_in_progress.store(owner->partition_count);\n}\n\napp_state::app_state(const app_info &info) : app_info(info), helpers(new app_state_helper())\n{\n    log_name = info.app_name + \"(\" + boost::lexical_cast<std::string>(info.app_id) + \")\";\n    helpers->owner = this;\n\n    partition_configuration config;\n    config.ballot = 0;\n    config.pid.set_app_id(app_id);\n    config.last_committed_decree = 0;\n    config.last_drops.clear();\n    config.max_replica_count = app_info::max_replica_count;\n    config.primary.set_invalid();\n    config.secondaries.clear();\n    partitions.assign(app_info::partition_count, config);\n    for (int i = 0; i != app_info::partition_count; ++i)\n        partitions[i].pid.set_partition_index(i);\n\n    helpers->on_init_partitions();\n}\n\nstd::shared_ptr<app_state> app_state::create(const app_info &info)\n{\n    return std::make_shared<app_state>(info);\n}\n\nnode_state::node_state()\n    : total_primaries(0), total_partitions(0), is_alive(false), has_collected_replicas(false)\n{\n}\n\nbool node_state::for_each_partition(const std::function<bool(const gpid &)> &f) const\n{\n    for (const auto &pair : app_partitions) {\n        const partition_set &ps = pair.second;\n        for (const auto &gpid : ps) {\n            if (!f(gpid))\n                return false;\n        }\n    }\n    return true;\n}\n\nconst partition_set *node_state::get_partitions(int app_id, bool only_primary) const\n{\n    const std::map<int32_t, partition_set> *all_partitions;\n    if (only_primary)\n        all_partitions = &app_primaries;\n    else\n        all_partitions = &app_partitions;\n\n    auto iter = all_partitions->find(app_id);\n    if (iter == all_partitions->end())\n        return nullptr;\n    else\n        return &(iter->second);\n}\n\npartition_set *node_state::get_partitions(app_id id, bool only_primary, bool create_new)\n{\n    std::map<int32_t, partition_set> *all_partitions;\n    if (only_primary)\n        all_partitions = &app_primaries;\n    else\n        all_partitions = &app_partitions;\n\n    if (create_new) {\n        return &((*all_partitions)[id]);\n    } else {\n        auto iter = all_partitions->find(id);\n        if (iter == all_partitions->end())\n            return nullptr;\n        else\n            return &(iter->second);\n    }\n}\n\npartition_set *node_state::partitions(app_id id, bool only_primary)\n{\n    return const_cast<partition_set *>(get_partitions(id, only_primary));\n}\n\nconst partition_set *node_state::partitions(app_id id, bool only_primary) const\n{\n    return get_partitions(id, only_primary);\n}\n\nvoid node_state::put_partition(const gpid &pid, bool is_primary)\n{\n    partition_set *all = get_partitions(pid.get_app_id(), false, true);\n    if ((all->insert(pid)).second)\n        total_partitions++;\n    if (is_primary) {\n        partition_set *pri = get_partitions(pid.get_app_id(), true, true);\n        if ((pri->insert(pid)).second)\n            total_primaries++;\n    }\n}\n\nvoid node_state::remove_partition(const gpid &pid, bool only_primary)\n{\n    partition_set *pri = get_partitions(pid.get_app_id(), true, true);\n    total_primaries -= pri->erase(pid);\n    if (!only_primary) {\n        partition_set *all = get_partitions(pid.get_app_id(), false, true);\n        total_partitions -= all->erase(pid);\n    }\n}\n\nbool node_state::for_each_primary(app_id id, const std::function<bool(const gpid &)> &f) const\n{\n    const partition_set *pri = partitions(id, true);\n    if (pri == nullptr)\n        return false;\n    for (const gpid &pid : *pri) {\n        dassert(id == pid.get_app_id(),\n                \"invalid gpid(%d.%d), app_id must be %d\",\n                pid.get_app_id(),\n                pid.get_partition_index(),\n                id);\n        if (!f(pid))\n            return false;\n    }\n    return true;\n}\n\nunsigned node_state::primary_count(app_id id) const\n{\n    const partition_set *pri = partitions(id, true);\n    if (pri == nullptr)\n        return 0;\n    return pri->size();\n}\n\nunsigned node_state::partition_count(app_id id) const\n{\n    const partition_set *pri = partitions(id, false);\n    if (pri == nullptr)\n        return 0;\n    return pri->size();\n}\n\npartition_status::type node_state::served_as(const gpid &pid) const\n{\n    const partition_set *ps1 = partitions(pid.get_app_id(), true);\n    if (ps1 != nullptr && ps1->find(pid) != ps1->end())\n        return partition_status::PS_PRIMARY;\n    const partition_set *ps2 = partitions(pid.get_app_id(), false);\n    if (ps2 != nullptr && ps2->find(pid) != ps2->end())\n        return partition_status::PS_SECONDARY;\n    return partition_status::PS_INACTIVE;\n}\n}\n}\n<commit_msg>bugfix: remove from config_context::dropped only when it's not empty<commit_after>\/*\n * The MIT License (MIT)\n *\n * Copyright (c) 2015 Microsoft Corporation\n *\n * -=- Robust Distributed System Nucleus (rDSN) -=-\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 * Description:\n *     the meta server's date structure, impl file\n *\n * Revision history:\n *     2016-04-25, Weijie Sun(sunweijie at xiaomi.com), first version\n *     xxxx-xx-xx, author, fix bug about xxx\n *\/\n#include <boost\/lexical_cast.hpp>\n#include <dsn\/service_api_cpp.h>\n#include \"meta_data.h\"\n\nnamespace dsn {\nnamespace replication {\n\nvoid when_update_replicas(config_type::type t, const std::function<void(bool)> &func)\n{\n    switch (t) {\n    case config_type::CT_ASSIGN_PRIMARY:\n    case config_type::CT_UPGRADE_TO_PRIMARY:\n    case config_type::CT_UPGRADE_TO_SECONDARY:\n        func(true);\n        break;\n    case config_type::CT_DOWNGRADE_TO_INACTIVE:\n    case config_type::CT_REMOVE:\n    case config_type::CT_DROP_PARTITION:\n        func(false);\n        break;\n    default:\n        break;\n    }\n}\n\nvoid maintain_drops(std::vector<rpc_address> &drops, const rpc_address &node, config_type::type t)\n{\n    auto action = [&drops, &node](bool is_adding) {\n        auto it = std::find(drops.begin(), drops.end(), node);\n        if (is_adding) {\n            if (it != drops.end()) {\n                drops.erase(it);\n            }\n        } else {\n            dassert(it == drops.end(),\n                    \"the node(%s) cannot be in drops set before this update\",\n                    node.to_string());\n            drops.push_back(node);\n            if (drops.size() > 3) {\n                drops.erase(drops.begin());\n            }\n        }\n    };\n    when_update_replicas(t, action);\n}\n\nint config_context::MAX_REPLICA_COUNT_IN_GRROUP = 4;\nvoid config_context::cancel_sync()\n{\n    if (config_status::pending_remote_sync == stage) {\n        pending_sync_task->cancel(false);\n        pending_sync_task = nullptr;\n        pending_sync_request.reset();\n    }\n    if (msg) {\n        dsn_msg_release_ref(msg);\n    }\n    msg = nullptr;\n    stage = config_status::not_pending;\n}\n\nvoid config_context::check_size()\n{\n    \/\/ when add learner, it is possible that replica_count > max_replica_count, so we\n    \/\/ need to remove things from dropped only when it's not empty.\n    while (replica_count(*config_owner) + dropped.size() > MAX_REPLICA_COUNT_IN_GRROUP &&\n           !dropped.empty()) {\n        dropped.erase(dropped.begin());\n        prefered_dropped = (int)dropped.size() - 1;\n    }\n}\n\nstd::vector<dropped_replica>::iterator config_context::find_from_dropped(const rpc_address &node)\n{\n    return std::find_if(dropped.begin(), dropped.end(), [&node](const dropped_replica &r) {\n        return r.node == node;\n    });\n}\n\nbool config_context::remove_from_dropped(const rpc_address &node)\n{\n    auto iter = find_from_dropped(node);\n    if (iter != dropped.end()) {\n        dropped.erase(iter);\n        prefered_dropped = (int)dropped.size() - 1;\n        return true;\n    }\n    return false;\n}\n\nbool config_context::record_drop_history(const rpc_address &node)\n{\n    auto iter = find_from_dropped(node);\n    if (iter != dropped.end())\n        return false;\n    dropped.emplace_back(\n        dropped_replica{node, dsn_now_ms(), invalid_ballot, invalid_decree, invalid_decree});\n    prefered_dropped = (int)dropped.size() - 1;\n    check_size();\n    return true;\n}\n\nint config_context::collect_drop_replica(const rpc_address &node, const replica_info &info)\n{\n    bool in_dropped = false;\n    auto iter = find_from_dropped(node);\n    uint64_t last_drop_time = dropped_replica::INVALID_TIMESTAMP;\n    if (iter != dropped.end()) {\n        in_dropped = true;\n        last_drop_time = iter->time;\n        dropped.erase(iter);\n        prefered_dropped = (int)dropped.size() - 1;\n    }\n\n    dropped_replica current = {\n        node, last_drop_time, info.ballot, info.last_committed_decree, info.last_prepared_decree};\n    auto cmp = [](const dropped_replica &d1, const dropped_replica &d2) {\n        return dropped_cmp(d1, d2) < 0;\n    };\n    iter = std::lower_bound(dropped.begin(), dropped.end(), current, cmp);\n\n    dropped.emplace(iter, current);\n    prefered_dropped = (int)dropped.size() - 1;\n    check_size();\n\n    iter = find_from_dropped(node);\n    if (iter == dropped.end()) {\n        dassert(!in_dropped,\n                \"adjust position of existing node(%s) failed, this is a bug, partition(%d.%d)\",\n                node.to_string(),\n                config_owner->pid.get_app_id(),\n                config_owner->pid.get_partition_index());\n        return -1;\n    }\n    return in_dropped ? 1 : 0;\n}\n\nbool config_context::check_order()\n{\n    if (dropped.empty())\n        return true;\n    for (unsigned int i = 0; i < dropped.size() - 1; ++i) {\n        if (dropped_cmp(dropped[i], dropped[i + 1]) > 0) {\n            derror(\"check dropped order for gpid(%d.%d) failed, [%s,%llu,%lld,%lld,%lld@%d] vs \"\n                   \"[%s,%llu,%lld,%lld,%lld@%d]\",\n                   config_owner->pid.get_app_id(),\n                   config_owner->pid.get_partition_index(),\n                   dropped[i].node.to_string(),\n                   dropped[i].time,\n                   dropped[i].ballot,\n                   dropped[i].last_committed_decree,\n                   dropped[i].last_prepared_decree,\n                   i,\n                   dropped[i].node.to_string(),\n                   dropped[i].time,\n                   dropped[i].ballot,\n                   dropped[i].last_committed_decree,\n                   dropped[i].last_prepared_decree,\n                   i + 1);\n            return false;\n        }\n    }\n    return true;\n}\n\nvoid app_state_helper::on_init_partitions()\n{\n    config_context context;\n    context.stage = config_status::not_pending;\n    context.pending_sync_task = nullptr;\n    context.msg = nullptr;\n    context.lb_actions.from_balancer = false;\n\n    context.prefered_dropped = -1;\n    contexts.assign(owner->partition_count, context);\n\n    std::vector<partition_configuration> &partitions = owner->partitions;\n    for (unsigned int i = 0; i != owner->partition_count; ++i) {\n        contexts[i].config_owner = &(partitions[i]);\n    }\n\n    partitions_in_progress.store(owner->partition_count);\n}\n\napp_state::app_state(const app_info &info) : app_info(info), helpers(new app_state_helper())\n{\n    log_name = info.app_name + \"(\" + boost::lexical_cast<std::string>(info.app_id) + \")\";\n    helpers->owner = this;\n\n    partition_configuration config;\n    config.ballot = 0;\n    config.pid.set_app_id(app_id);\n    config.last_committed_decree = 0;\n    config.last_drops.clear();\n    config.max_replica_count = app_info::max_replica_count;\n    config.primary.set_invalid();\n    config.secondaries.clear();\n    partitions.assign(app_info::partition_count, config);\n    for (int i = 0; i != app_info::partition_count; ++i)\n        partitions[i].pid.set_partition_index(i);\n\n    helpers->on_init_partitions();\n}\n\nstd::shared_ptr<app_state> app_state::create(const app_info &info)\n{\n    return std::make_shared<app_state>(info);\n}\n\nnode_state::node_state()\n    : total_primaries(0), total_partitions(0), is_alive(false), has_collected_replicas(false)\n{\n}\n\nbool node_state::for_each_partition(const std::function<bool(const gpid &)> &f) const\n{\n    for (const auto &pair : app_partitions) {\n        const partition_set &ps = pair.second;\n        for (const auto &gpid : ps) {\n            if (!f(gpid))\n                return false;\n        }\n    }\n    return true;\n}\n\nconst partition_set *node_state::get_partitions(int app_id, bool only_primary) const\n{\n    const std::map<int32_t, partition_set> *all_partitions;\n    if (only_primary)\n        all_partitions = &app_primaries;\n    else\n        all_partitions = &app_partitions;\n\n    auto iter = all_partitions->find(app_id);\n    if (iter == all_partitions->end())\n        return nullptr;\n    else\n        return &(iter->second);\n}\n\npartition_set *node_state::get_partitions(app_id id, bool only_primary, bool create_new)\n{\n    std::map<int32_t, partition_set> *all_partitions;\n    if (only_primary)\n        all_partitions = &app_primaries;\n    else\n        all_partitions = &app_partitions;\n\n    if (create_new) {\n        return &((*all_partitions)[id]);\n    } else {\n        auto iter = all_partitions->find(id);\n        if (iter == all_partitions->end())\n            return nullptr;\n        else\n            return &(iter->second);\n    }\n}\n\npartition_set *node_state::partitions(app_id id, bool only_primary)\n{\n    return const_cast<partition_set *>(get_partitions(id, only_primary));\n}\n\nconst partition_set *node_state::partitions(app_id id, bool only_primary) const\n{\n    return get_partitions(id, only_primary);\n}\n\nvoid node_state::put_partition(const gpid &pid, bool is_primary)\n{\n    partition_set *all = get_partitions(pid.get_app_id(), false, true);\n    if ((all->insert(pid)).second)\n        total_partitions++;\n    if (is_primary) {\n        partition_set *pri = get_partitions(pid.get_app_id(), true, true);\n        if ((pri->insert(pid)).second)\n            total_primaries++;\n    }\n}\n\nvoid node_state::remove_partition(const gpid &pid, bool only_primary)\n{\n    partition_set *pri = get_partitions(pid.get_app_id(), true, true);\n    total_primaries -= pri->erase(pid);\n    if (!only_primary) {\n        partition_set *all = get_partitions(pid.get_app_id(), false, true);\n        total_partitions -= all->erase(pid);\n    }\n}\n\nbool node_state::for_each_primary(app_id id, const std::function<bool(const gpid &)> &f) const\n{\n    const partition_set *pri = partitions(id, true);\n    if (pri == nullptr)\n        return false;\n    for (const gpid &pid : *pri) {\n        dassert(id == pid.get_app_id(),\n                \"invalid gpid(%d.%d), app_id must be %d\",\n                pid.get_app_id(),\n                pid.get_partition_index(),\n                id);\n        if (!f(pid))\n            return false;\n    }\n    return true;\n}\n\nunsigned node_state::primary_count(app_id id) const\n{\n    const partition_set *pri = partitions(id, true);\n    if (pri == nullptr)\n        return 0;\n    return pri->size();\n}\n\nunsigned node_state::partition_count(app_id id) const\n{\n    const partition_set *pri = partitions(id, false);\n    if (pri == nullptr)\n        return 0;\n    return pri->size();\n}\n\npartition_status::type node_state::served_as(const gpid &pid) const\n{\n    const partition_set *ps1 = partitions(pid.get_app_id(), true);\n    if (ps1 != nullptr && ps1->find(pid) != ps1->end())\n        return partition_status::PS_PRIMARY;\n    const partition_set *ps2 = partitions(pid.get_app_id(), false);\n    if (ps2 != nullptr && ps2->find(pid) != ps2->end())\n        return partition_status::PS_SECONDARY;\n    return partition_status::PS_INACTIVE;\n}\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"Include.h\"\n\n\n\n\n\nint sizeX = 3;\nint sizeY = 3;\nint numPlayers = 2;\n\n\n\n\n\n\n\nint main(){\n\n\tMap map = Map();\n\tAI* ai = new AI(&map, 1);\n\n\n\tmap.Draw();\n\n\tstd::cin.get();\n\treturn 0;\n}\n\n\n<commit_msg>push for jonathan<commit_after>\n#include \"Include.h\"\n\n\n\n\n\nint sizeX = 3;\nint sizeY = 3;\nint numPlayers = 2;\n\n\n\n\n\n\n\nint main(){\n\n\tMap map = Map(3,3);\n\tAI ai = AI(&map, 2);\n\tmap.Draw();\n\t\n\tai.play();\n\n\t\n\n\tstd::cin.get();\n\treturn 0;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"editor_native\/property_frame\/script_ui.h\"\n#include <cstdio>\n#include <Windows.h>\n#include \"core\/crc32.h\"\n#include \"editor\/editor_client.h\"\n#include \"editor\/server_message_types.h\"\n#include \"editor_native\/main_frame.h\"\n#include \"editor_native\/property_frame\/property_frame.h\"\n#include \"gui\/controls\/button.h\"\n#include \"gui\/controls\/text_box.h\"\n#include \"gui\/gui.h\"\n\n\nScriptUI::ScriptUI(PropertyFrame& property_frame, Lux::UI::Block* parent, Lux::EditorClient& client)\n\t: Block(parent->getGui(), parent, NULL)\n\t, m_property_frame(property_frame)\n{\n\tm_client = &client;\n\tsetArea(0, 0, 0, 0, 1, 0, 0, 40);\n\tLux::UI::Block* label = LUX_NEW(Lux::UI::Block)(getGui(), this, \"_text_centered\");\n\tlabel->setBlockText(\"Script\");\n\tlabel->setArea(0, 0, 0, 0, 1, 0, 0, 20);\n\n\tlabel = LUX_NEW(Lux::UI::Block)(getGui(), this, \"_text\");\n\tlabel->setBlockText(\"Source\");\n\tlabel->setArea(0, 0, 0, 20, 0, 50, 0, 40);\n\n\tm_source_box = LUX_NEW(Lux::UI::TextBox)(\"empty\", getGui(), this);\n\tm_source_box->setArea(0, 50, 0, 20, 1, -21, 0, 40);\n\tm_source_box->onEvent(\"text_accepted\").bind<ScriptUI, &ScriptUI::sourceChanged>(this);\n\n\tLux::UI::Button* browse_button = LUX_NEW(Lux::UI::Button)(\"...\", getGui(), this);\n\tbrowse_button->setArea(1, -20, 0, 20, 1, -1, 0, 40);\n\tbrowse_button->onEvent(\"click\").bind<ScriptUI, &ScriptUI::browseSource>(this);\t\n\n\tLux::UI::Button* edit_button = LUX_NEW(Lux::UI::Button)(\"Edit script\", getGui(), this);\n\tedit_button->setArea(0.5f, -40, 0, 42, 0.5f, 40, 0, 62);\n\tedit_button->onEvent(\"click\").bind<ScriptUI, &ScriptUI::editScript>(this);\t\n\n}\n\n\nvoid ScriptUI::sourceChanged(Lux::UI::Block& block, void*)\n{\n\tconst Lux::string& s = m_source_box->getChild(0)->getBlockText();\n\tm_client->setComponentProperty(\"script\", \"source\", s.c_str(), s.length()+1);\n}\n\n\nvoid ScriptUI::editScript(Lux::UI::Block& block, void*)\n{\n\tShellExecute(NULL, \"open\", m_source_box->getText().c_str(), NULL, NULL, SW_SHOW);\n}\n\n\nvoid ScriptUI::browseSource(Lux::UI::Block& block, void*)\n{\n\tOPENFILENAME ofn;\n\tZeroMemory(&ofn, sizeof(ofn));\n\n\tofn.lStructSize = sizeof(ofn);\n\tofn.hwndOwner = NULL;\n\tofn.lpstrFilter = \"models\\0*.scene.xml\\0\";\n\tchar buf[MAX_PATH];\n\tbuf[0] = 0;\n\tofn.lpstrFile = buf;\n\tofn.nMaxFile = MAX_PATH;\n\tofn.Flags = OFN_EXPLORER | OFN_FILEMUSTEXIST | OFN_HIDEREADONLY;\n\tif(GetOpenFileName(&ofn) != FALSE)\n\t{\n\t\tLux::string& s = m_property_frame.getMainFrame()->getStartupDirectory();\n\t\tif(strncmp(s.c_str(), buf, s.length()) == 0)\n\t\t{\n\t\t\tif(buf[s.length()] == '\\\\')\n\t\t\t{\n\t\t\t\tstrcpy_s(buf, buf + s.length()+1);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tstrcpy_s(buf, buf + s.length());\n\t\t\t}\n\t\t}\n\t\tm_source_box->getChild(0)->setBlockText(buf);\n\t\tm_source_box->getChild(0)->emitEvent(\"text_accepted\");\n\t}\n\n\tconst Lux::string& s = m_source_box->getText();\n\tm_client->setComponentProperty(\"script\", \"source\", s.c_str(), s.length()+1);\n}\n\n\nvoid ScriptUI::onEntityProperties(Lux::PropertyListEvent& evt)\n{\n\tif(evt.type_hash == crc32(\"script\"))\n\t{\n\t\tfor(int i = 0; i < evt.properties.size(); ++i)\n\t\t{\n\t\t\tif(evt.properties[i].name_hash == crc32(\"source\"))\n\t\t\t{\n\t\t\t\tif(evt.properties[i].data_size > 0)\n\t\t\t\t{\n\t\t\t\t\tm_source_box->setText((char*)evt.properties[i].data);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n<commit_msg>fixed script ui in property grid - closes #92<commit_after>#include \"editor_native\/property_frame\/script_ui.h\"\n#include <cstdio>\n#include <Windows.h>\n#include \"core\/crc32.h\"\n#include \"editor\/editor_client.h\"\n#include \"editor\/server_message_types.h\"\n#include \"editor_native\/main_frame.h\"\n#include \"editor_native\/property_frame\/property_frame.h\"\n#include \"gui\/controls\/button.h\"\n#include \"gui\/controls\/text_box.h\"\n#include \"gui\/gui.h\"\n\n\nScriptUI::ScriptUI(PropertyFrame& property_frame, Lux::UI::Block* parent, Lux::EditorClient& client)\n\t: Block(parent->getGui(), parent, NULL)\n\t, m_property_frame(property_frame)\n{\n\tm_client = &client;\n\tsetArea(0, 0, 0, 0, 1, 0, 0, 60);\n\tLux::UI::Block* label = LUX_NEW(Lux::UI::Block)(getGui(), this, \"_text_centered\");\n\tlabel->setBlockText(\"Script\");\n\tlabel->setArea(0, 0, 0, 0, 1, 0, 0, 20);\n\n\tlabel = LUX_NEW(Lux::UI::Block)(getGui(), this, \"_text\");\n\tlabel->setBlockText(\"Source\");\n\tlabel->setArea(0, 0, 0, 20, 0, 50, 0, 40);\n\n\tm_source_box = LUX_NEW(Lux::UI::TextBox)(\"empty\", getGui(), this);\n\tm_source_box->setArea(0, 50, 0, 20, 1, -21, 0, 40);\n\tm_source_box->onEvent(\"text_accepted\").bind<ScriptUI, &ScriptUI::sourceChanged>(this);\n\n\tLux::UI::Button* browse_button = LUX_NEW(Lux::UI::Button)(\"...\", getGui(), this);\n\tbrowse_button->setArea(1, -20, 0, 20, 1, -1, 0, 40);\n\tbrowse_button->onEvent(\"click\").bind<ScriptUI, &ScriptUI::browseSource>(this);\t\n\n\tLux::UI::Button* edit_button = LUX_NEW(Lux::UI::Button)(\"Edit script\", getGui(), this);\n\tedit_button->setArea(0.5f, -40, 0, 42, 0.5f, 40, 0, 62);\n\tedit_button->onEvent(\"click\").bind<ScriptUI, &ScriptUI::editScript>(this);\t\n\n}\n\n\nvoid ScriptUI::sourceChanged(Lux::UI::Block& block, void*)\n{\n\tconst Lux::string& s = m_source_box->getChild(0)->getBlockText();\n\tm_client->setComponentProperty(\"script\", \"source\", s.c_str(), s.length()+1);\n}\n\n\nvoid ScriptUI::editScript(Lux::UI::Block& block, void*)\n{\n\tShellExecute(NULL, \"open\", m_source_box->getText().c_str(), NULL, NULL, SW_SHOW);\n}\n\n\nvoid ScriptUI::browseSource(Lux::UI::Block& block, void*)\n{\n\tOPENFILENAME ofn;\n\tZeroMemory(&ofn, sizeof(ofn));\n\n\tofn.lStructSize = sizeof(ofn);\n\tofn.hwndOwner = NULL;\n\tofn.lpstrFilter = \"models\\0*.scene.xml\\0\";\n\tchar buf[MAX_PATH];\n\tbuf[0] = 0;\n\tofn.lpstrFile = buf;\n\tofn.nMaxFile = MAX_PATH;\n\tofn.Flags = OFN_EXPLORER | OFN_FILEMUSTEXIST | OFN_HIDEREADONLY;\n\tif(GetOpenFileName(&ofn) != FALSE)\n\t{\n\t\tLux::string& s = m_property_frame.getMainFrame()->getStartupDirectory();\n\t\tif(strncmp(s.c_str(), buf, s.length()) == 0)\n\t\t{\n\t\t\tif(buf[s.length()] == '\\\\')\n\t\t\t{\n\t\t\t\tstrcpy_s(buf, buf + s.length()+1);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tstrcpy_s(buf, buf + s.length());\n\t\t\t}\n\t\t}\n\t\tm_source_box->getChild(0)->setBlockText(buf);\n\t\tm_source_box->getChild(0)->emitEvent(\"text_accepted\");\n\t}\n\n\tconst Lux::string& s = m_source_box->getText();\n\tm_client->setComponentProperty(\"script\", \"source\", s.c_str(), s.length()+1);\n}\n\n\nvoid ScriptUI::onEntityProperties(Lux::PropertyListEvent& evt)\n{\n\tif(evt.type_hash == crc32(\"script\"))\n\t{\n\t\tfor(int i = 0; i < evt.properties.size(); ++i)\n\t\t{\n\t\t\tif(evt.properties[i].name_hash == crc32(\"source\"))\n\t\t\t{\n\t\t\t\tif(evt.properties[i].data_size > 0)\n\t\t\t\t{\n\t\t\t\t\tm_source_box->setText((char*)evt.properties[i].data);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <exodus\/program.h>\nprograminit()\n\n\tfunction main() {\n\n\tvar filenames = COMMAND.field(FM, 2, 999999);\n\n\tif (not filenames) {\n\t\tstop(\"Syntax is createfile filename filename ...\\ndict files are named dict.filename\");\n\t}\n\tvar nfiles = dcount(filenames, FM);\n\tfor (var filen = 1; filen <= nfiles; ++filen) {\n\n\t\tvar filename = filenames.a(filen);\n\n\t\tif (createfile(filename)) {\n\t\t\tprint(\"Created \");\n\t\t} else {\n\t\t\tprint(\"Cannot create \");\n\t\t}\n\t\tprintl(filename);\n\t}\n\treturn 0;\n}\n\nprogramexit()\n<commit_msg>cli createfile to return error if any file cannot be created<commit_after>#include <exodus\/program.h>\nprograminit()\n\n\tfunction main() {\n\n\tvar filenames = COMMAND.field(FM, 2, 999999);\n\n\tif (not filenames) {\n\t\tstop(\"Syntax is createfile filename filename ...\\ndict files are named dict.filename\");\n\t}\n\tvar result = 0;\n\tvar nfiles = dcount(filenames, FM);\n\tfor (var filen = 1; filen <= nfiles; ++filen) {\n\n\t\tvar filename = filenames.a(filen);\n\n\t\tif (createfile(filename)) {\n\t\t\tprint(\"Created \");\n\t\t} else {\n\t\t\tresult = 1;\n\t\t\tprint(\"Cannot create \");\n\t\t}\n\t\tprintl(filename);\n\t}\n\treturn 1;\n}\n\nprogramexit()\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2019 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 \"source\/fuzz\/fuzzer_pass_apply_id_synonyms.h\"\n\n#include \"source\/fuzz\/data_descriptor.h\"\n#include \"source\/fuzz\/fuzzer_util.h\"\n#include \"source\/fuzz\/id_use_descriptor.h\"\n#include \"source\/fuzz\/instruction_descriptor.h\"\n#include \"source\/fuzz\/transformation_composite_extract.h\"\n#include \"source\/fuzz\/transformation_replace_id_with_synonym.h\"\n\nnamespace spvtools {\nnamespace fuzz {\n\nFuzzerPassApplyIdSynonyms::FuzzerPassApplyIdSynonyms(\n    opt::IRContext* ir_context, FactManager* fact_manager,\n    FuzzerContext* fuzzer_context,\n    protobufs::TransformationSequence* transformations)\n    : FuzzerPass(ir_context, fact_manager, fuzzer_context, transformations) {}\n\nFuzzerPassApplyIdSynonyms::~FuzzerPassApplyIdSynonyms() = default;\n\nvoid FuzzerPassApplyIdSynonyms::Apply() {\n  for (auto id_with_known_synonyms :\n       GetFactManager()->GetIdsForWhichSynonymsAreKnown(GetIRContext())) {\n    \/\/ Gather up all uses of |id_with_known_synonym|, and then subsequently\n    \/\/ iterate over these uses.  We use this separation because, when\n    \/\/ considering a given use, we might apply a transformation that will\n    \/\/ invalidate the def-use manager.\n    std::vector<std::pair<opt::Instruction*, uint32_t>> uses;\n    GetIRContext()->get_def_use_mgr()->ForEachUse(\n        id_with_known_synonyms,\n        [&uses](opt::Instruction* use_inst, uint32_t use_index) -> void {\n          uses.emplace_back(\n              std::pair<opt::Instruction*, uint32_t>(use_inst, use_index));\n        });\n\n    for (auto& use : uses) {\n      auto use_inst = use.first;\n      auto use_index = use.second;\n      auto block_containing_use = GetIRContext()->get_instr_block(use_inst);\n      \/\/ The use might not be in a block; e.g. it could be a decoration.\n      if (!block_containing_use) {\n        continue;\n      }\n      if (!GetFuzzerContext()->ChoosePercentage(\n              GetFuzzerContext()->GetChanceOfReplacingIdWithSynonym())) {\n        continue;\n      }\n      \/\/ |use_index| is the absolute index of the operand.  We require\n      \/\/ the index of the operand restricted to input operands only, so\n      \/\/ we subtract the number of non-input operands from |use_index|.\n      uint32_t use_in_operand_index =\n          use_index - use_inst->NumOperands() + use_inst->NumInOperands();\n      if (!TransformationReplaceIdWithSynonym::UseCanBeReplacedWithSynonym(\n              GetIRContext(), use_inst, use_in_operand_index)) {\n        continue;\n      }\n\n      std::vector<const protobufs::DataDescriptor*> synonyms_to_try;\n      for (auto& data_descriptor : GetFactManager()->GetSynonymsForId(\n               id_with_known_synonyms, GetIRContext())) {\n        protobufs::DataDescriptor descriptor_for_this_id =\n            MakeDataDescriptor(id_with_known_synonyms, {});\n        if (DataDescriptorEquals()(data_descriptor, &descriptor_for_this_id)) {\n          \/\/ Exclude the fact that the id is synonymous with itself.\n          continue;\n        }\n        synonyms_to_try.push_back(data_descriptor);\n      }\n      while (!synonyms_to_try.empty()) {\n        auto synonym_index = GetFuzzerContext()->RandomIndex(synonyms_to_try);\n        auto synonym_to_try = synonyms_to_try[synonym_index];\n        synonyms_to_try.erase(synonyms_to_try.begin() + synonym_index);\n\n        \/\/ If the synonym's |index_size| is zero, the synonym represents an id.\n        \/\/ Otherwise it represents some element of a composite structure, in\n        \/\/ which case we need to be able to add an extract instruction to get\n        \/\/ that element out.\n        if (synonym_to_try->index_size() > 0 &&\n            !fuzzerutil::CanInsertOpcodeBeforeInstruction(SpvOpCompositeExtract,\n                                                          use_inst)) {\n          \/\/ We cannot insert an extract before this instruction, so this\n          \/\/ synonym is no good.\n          \/\/\n          \/\/ TODO(afd): In the case of an OpPhi, we could consider inserting the\n          \/\/  extract instruction into the relevant parent block of the OpPhi.\n          continue;\n        }\n\n        if (!fuzzerutil::IdIsAvailableAtUse(GetIRContext(), use_inst,\n                                            use_in_operand_index,\n                                            synonym_to_try->object())) {\n          continue;\n        }\n\n        \/\/ We either replace the use with an id known to be synonymous (when\n        \/\/ the synonym's |index_size| is 0), or an id that will hold the result\n        \/\/ of extracting a synonym from a composite (when the synonym's\n        \/\/ |index_size| is > 0).\n        uint32_t id_with_which_to_replace_use;\n        if (synonym_to_try->index_size() == 0) {\n          id_with_which_to_replace_use = synonym_to_try->object();\n        } else {\n          id_with_which_to_replace_use = GetFuzzerContext()->GetFreshId();\n          ApplyTransformation(TransformationCompositeExtract(\n              MakeInstructionDescriptor(GetIRContext(), use_inst),\n              id_with_which_to_replace_use, synonym_to_try->object(),\n              fuzzerutil::RepeatedFieldToVector(synonym_to_try->index())));\n        }\n\n        ApplyTransformation(TransformationReplaceIdWithSynonym(\n            MakeIdUseDescriptorFromUse(GetIRContext(), use_inst,\n                                       use_in_operand_index),\n            id_with_which_to_replace_use));\n        break;\n      }\n    }\n  }\n}\n\n}  \/\/ namespace fuzz\n}  \/\/ namespace spvtools\n<commit_msg>spirv-fuzz: Allow OpPhi operand to be replaced with a composite synonym (#3221)<commit_after>\/\/ Copyright (c) 2019 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 \"source\/fuzz\/fuzzer_pass_apply_id_synonyms.h\"\n\n#include \"source\/fuzz\/data_descriptor.h\"\n#include \"source\/fuzz\/fuzzer_util.h\"\n#include \"source\/fuzz\/id_use_descriptor.h\"\n#include \"source\/fuzz\/instruction_descriptor.h\"\n#include \"source\/fuzz\/transformation_composite_extract.h\"\n#include \"source\/fuzz\/transformation_replace_id_with_synonym.h\"\n\nnamespace spvtools {\nnamespace fuzz {\n\nFuzzerPassApplyIdSynonyms::FuzzerPassApplyIdSynonyms(\n    opt::IRContext* ir_context, FactManager* fact_manager,\n    FuzzerContext* fuzzer_context,\n    protobufs::TransformationSequence* transformations)\n    : FuzzerPass(ir_context, fact_manager, fuzzer_context, transformations) {}\n\nFuzzerPassApplyIdSynonyms::~FuzzerPassApplyIdSynonyms() = default;\n\nvoid FuzzerPassApplyIdSynonyms::Apply() {\n  for (auto id_with_known_synonyms :\n       GetFactManager()->GetIdsForWhichSynonymsAreKnown(GetIRContext())) {\n    \/\/ Gather up all uses of |id_with_known_synonym|, and then subsequently\n    \/\/ iterate over these uses.  We use this separation because, when\n    \/\/ considering a given use, we might apply a transformation that will\n    \/\/ invalidate the def-use manager.\n    std::vector<std::pair<opt::Instruction*, uint32_t>> uses;\n    GetIRContext()->get_def_use_mgr()->ForEachUse(\n        id_with_known_synonyms,\n        [&uses](opt::Instruction* use_inst, uint32_t use_index) -> void {\n          uses.emplace_back(\n              std::pair<opt::Instruction*, uint32_t>(use_inst, use_index));\n        });\n\n    for (auto& use : uses) {\n      auto use_inst = use.first;\n      auto use_index = use.second;\n      auto block_containing_use = GetIRContext()->get_instr_block(use_inst);\n      \/\/ The use might not be in a block; e.g. it could be a decoration.\n      if (!block_containing_use) {\n        continue;\n      }\n      if (!GetFuzzerContext()->ChoosePercentage(\n              GetFuzzerContext()->GetChanceOfReplacingIdWithSynonym())) {\n        continue;\n      }\n      \/\/ |use_index| is the absolute index of the operand.  We require\n      \/\/ the index of the operand restricted to input operands only, so\n      \/\/ we subtract the number of non-input operands from |use_index|.\n      uint32_t use_in_operand_index =\n          use_index - use_inst->NumOperands() + use_inst->NumInOperands();\n      if (!TransformationReplaceIdWithSynonym::UseCanBeReplacedWithSynonym(\n              GetIRContext(), use_inst, use_in_operand_index)) {\n        continue;\n      }\n\n      std::vector<const protobufs::DataDescriptor*> synonyms_to_try;\n      for (auto& data_descriptor : GetFactManager()->GetSynonymsForId(\n               id_with_known_synonyms, GetIRContext())) {\n        protobufs::DataDescriptor descriptor_for_this_id =\n            MakeDataDescriptor(id_with_known_synonyms, {});\n        if (DataDescriptorEquals()(data_descriptor, &descriptor_for_this_id)) {\n          \/\/ Exclude the fact that the id is synonymous with itself.\n          continue;\n        }\n        synonyms_to_try.push_back(data_descriptor);\n      }\n      while (!synonyms_to_try.empty()) {\n        auto synonym_to_try =\n            GetFuzzerContext()->RemoveAtRandomIndex(&synonyms_to_try);\n\n        \/\/ If the synonym's |index_size| is zero, the synonym represents an id.\n        \/\/ Otherwise it represents some element of a composite structure, in\n        \/\/ which case we need to be able to add an extract instruction to get\n        \/\/ that element out.\n        if (synonym_to_try->index_size() > 0 &&\n            !fuzzerutil::CanInsertOpcodeBeforeInstruction(SpvOpCompositeExtract,\n                                                          use_inst) &&\n            use_inst->opcode() != SpvOpPhi) {\n          \/\/ We cannot insert an extract before this instruction, so this\n          \/\/ synonym is no good.\n          continue;\n        }\n\n        if (!fuzzerutil::IdIsAvailableAtUse(GetIRContext(), use_inst,\n                                            use_in_operand_index,\n                                            synonym_to_try->object())) {\n          continue;\n        }\n\n        \/\/ We either replace the use with an id known to be synonymous (when\n        \/\/ the synonym's |index_size| is 0), or an id that will hold the result\n        \/\/ of extracting a synonym from a composite (when the synonym's\n        \/\/ |index_size| is > 0).\n        uint32_t id_with_which_to_replace_use;\n        if (synonym_to_try->index_size() == 0) {\n          id_with_which_to_replace_use = synonym_to_try->object();\n        } else {\n          id_with_which_to_replace_use = GetFuzzerContext()->GetFreshId();\n          opt::Instruction* instruction_to_insert_before = nullptr;\n\n          if (use_inst->opcode() != SpvOpPhi) {\n            instruction_to_insert_before = use_inst;\n          } else {\n            auto parent_block_id =\n                use_inst->GetSingleWordInOperand(use_in_operand_index + 1);\n            auto parent_block_instruction =\n                GetIRContext()->get_def_use_mgr()->GetDef(parent_block_id);\n            auto parent_block =\n                GetIRContext()->get_instr_block(parent_block_instruction);\n\n            instruction_to_insert_before = parent_block->GetMergeInst()\n                                               ? parent_block->GetMergeInst()\n                                               : parent_block->terminator();\n          }\n\n          ApplyTransformation(TransformationCompositeExtract(\n              MakeInstructionDescriptor(GetIRContext(),\n                                        instruction_to_insert_before),\n              id_with_which_to_replace_use, synonym_to_try->object(),\n              fuzzerutil::RepeatedFieldToVector(synonym_to_try->index())));\n        }\n\n        ApplyTransformation(TransformationReplaceIdWithSynonym(\n            MakeIdUseDescriptorFromUse(GetIRContext(), use_inst,\n                                       use_in_operand_index),\n            id_with_which_to_replace_use));\n        break;\n      }\n    }\n  }\n}\n\n}  \/\/ namespace fuzz\n}  \/\/ namespace spvtools\n<|endoftext|>"}
{"text":"<commit_before>\n#include <gloperate-qt\/base\/Converter.h>\n\n#include <QKeyEvent>\n#include <QGLWidget>\n\n#include <glm\/vec2.hpp>\n\n\nnamespace gloperate_qt\n{\n\n\n\/\/ Helper functions\ngloperate::KeyModifier operator|(gloperate::KeyModifier left, gloperate::KeyModifier right)\n{\n    return gloperate::KeyModifier(static_cast<int>(left) | static_cast<int>(right));\n}\n\n\n\/\/ Converter\nQImage Converter::convert(const QImage & image)\n{\n    return QGLWidget::convertToGLFormat(image);\n}\n\nglm::ivec2 Converter::fromQPoint(const QPoint & point)\n{\n    return glm::ivec2(point.x(), point.y());\n}\n\ngloperate::MouseButton Converter::fromQtMouseButton(Qt::MouseButton button)\n{\n    if (button & Qt::LeftButton)\n        return gloperate::MouseButtonLeft;\n    else if (button & Qt::RightButton)\n        return gloperate::MouseButtonRight;\n    else if (button & Qt::MiddleButton)\n        return gloperate::MouseButtonMiddle;\n    else if (button & Qt::XButton1)\n        return gloperate::MouseButton4;\n    else if (button & Qt::XButton2)\n        return gloperate::MouseButton5;\n    else\n        return gloperate::NoMouseButton;\n}\n\ngloperate::Key Converter::fromQtKeyCode(int key, int mods)\n{\n    if (mods & Qt::KeypadModifier)\n    {\n        switch (key)\n        {\n        case Qt::Key_0:\n            return gloperate::KeyKeypad0;\n        case Qt::Key_1:\n            return gloperate::KeyKeypad1;\n        case Qt::Key_2:\n            return gloperate::KeyKeypad2;\n        case Qt::Key_3:\n            return gloperate::KeyKeypad3;\n        case Qt::Key_4:\n            return gloperate::KeyKeypad4;\n        case Qt::Key_5:\n            return gloperate::KeyKeypad5;\n        case Qt::Key_6:\n            return gloperate::KeyKeypad6;\n        case Qt::Key_7:\n            return gloperate::KeyKeypad7;\n        case Qt::Key_8:\n            return gloperate::KeyKeypad8;\n        case Qt::Key_9:\n            return gloperate::KeyKeypad9;\n        case Qt::Key_division:\n            return gloperate::KeyKeypadDivide;\n        case Qt::Key_multiply:\n            return gloperate::KeyKeypadMultiply;\n        case Qt::Key_Minus:\n            return gloperate::KeyKeypadSubtract;\n        case Qt::Key_Plus:\n            return gloperate::KeyKeypadAdd;\n        case Qt::Key_Enter:\n            return gloperate::KeyKeypadEnter;\n        case Qt::Key_Equal:\n            return gloperate::KeyKeypadEqual;\n        default:\n            return gloperate::KeyUnknown;\n        };\n    }\n    else\n    {\n        switch (key)\n        {\n        case Qt::Key_Space:\n            return gloperate::KeySpace;\n        case Qt::Key_Apostrophe:\n            return gloperate::KeyApostrophe;\n        case Qt::Key_Comma:\n            return gloperate::KeyComma;\n        case Qt::Key_Minus:\n            return gloperate::KeyMinus;\n        case Qt::Key_Period:\n            return gloperate::KeyPeriod;\n        case Qt::Key_Slash:\n            return gloperate::KeySlash;\n        case Qt::Key_0:\n            return gloperate::Key0;\n        case Qt::Key_1:\n            return gloperate::Key1;\n        case Qt::Key_2:\n            return gloperate::Key2;\n        case Qt::Key_3:\n            return gloperate::Key3;\n        case Qt::Key_4:\n            return gloperate::Key4;\n        case Qt::Key_5:\n            return gloperate::Key5;\n        case Qt::Key_6:\n            return gloperate::Key6;\n        case Qt::Key_7:\n            return gloperate::Key7;\n        case Qt::Key_8:\n            return gloperate::Key8;\n        case Qt::Key_9:\n            return gloperate::Key9;\n        case Qt::Key_Semicolon:\n            return gloperate::KeySemicolon;\n        case Qt::Key_Equal:\n            return gloperate::KeyEqual;\n        case Qt::Key_A:\n            return gloperate::KeyA;\n        case Qt::Key_B:\n            return gloperate::KeyB;\n        case Qt::Key_C:\n            return gloperate::KeyC;\n        case Qt::Key_D:\n            return gloperate::KeyD;\n        case Qt::Key_E:\n            return gloperate::KeyE;\n        case Qt::Key_F:\n            return gloperate::KeyF;\n        case Qt::Key_G:\n            return gloperate::KeyG;\n        case Qt::Key_H:\n            return gloperate::KeyH;\n        case Qt::Key_I:\n            return gloperate::KeyI;\n        case Qt::Key_J:\n            return gloperate::KeyJ;\n        case Qt::Key_K:\n            return gloperate::KeyK;\n        case Qt::Key_L:\n            return gloperate::KeyL;\n        case Qt::Key_M:\n            return gloperate::KeyM;\n        case Qt::Key_N:\n            return gloperate::KeyN;\n        case Qt::Key_O:\n            return gloperate::KeyO;\n        case Qt::Key_P:\n            return gloperate::KeyP;\n        case Qt::Key_Q:\n            return gloperate::KeyQ;\n        case Qt::Key_R:\n            return gloperate::KeyR;\n        case Qt::Key_S:\n            return gloperate::KeyS;\n        case Qt::Key_T:\n            return gloperate::KeyT;\n        case Qt::Key_U:\n            return gloperate::KeyU;\n        case Qt::Key_V:\n            return gloperate::KeyV;\n        case Qt::Key_W:\n            return gloperate::KeyW;\n        case Qt::Key_X:\n            return gloperate::KeyX;\n        case Qt::Key_Y:\n            return gloperate::KeyY;\n        case Qt::Key_Z:\n            return gloperate::KeyZ;\n        case Qt::Key_BracketLeft:\n            return gloperate::KeyLeftBracket;\n        case Qt::Key_Backslash:\n            return gloperate::KeyBackslash;\n        case Qt::Key_BracketRight:\n            return gloperate::KeyRightBracket;\n        case Qt::Key_Agrave:\n            return gloperate::KeyGraveAccent;\n        case Qt::Key_Escape:\n            return gloperate::KeyEscape;\n        case Qt::Key_Return:\n            return gloperate::KeyEnter;\n        case Qt::Key_Tab:\n            return gloperate::KeyTab;\n        case Qt::Key_Backspace:\n            return gloperate::KeyBackspace;\n        case Qt::Key_Insert:\n            return gloperate::KeyInsert;\n        case Qt::Key_Delete:\n            return gloperate::KeyDelete;\n        case Qt::Key_Right:\n            return gloperate::KeyRight;\n        case Qt::Key_Left:\n            return gloperate::KeyLeft;\n        case Qt::Key_Down:\n            return gloperate::KeyDown;\n        case Qt::Key_Up:\n            return gloperate::KeyUp;\n        case Qt::Key_PageUp:\n            return gloperate::KeyPageUp;\n        case Qt::Key_PageDown:\n            return gloperate::KeyPageDown;\n        case Qt::Key_Home:\n            return gloperate::KeyHome;\n        case Qt::Key_End:\n            return gloperate::KeyEnd;\n        case Qt::Key_CapsLock:\n            return gloperate::KeyCapsLock;\n        case Qt::Key_ScrollLock:\n            return gloperate::KeyScrollLock;\n        case Qt::Key_NumLock:\n            return gloperate::KeyNumLock;\n        case Qt::Key_Print:\n            return gloperate::KeyPrintScreen;\n        case Qt::Key_Pause:\n            return gloperate::KeyPause;\n        case Qt::Key_F1:\n            return gloperate::KeyF1;\n        case Qt::Key_F2:\n            return gloperate::KeyF2;\n        case Qt::Key_F3:\n            return gloperate::KeyF3;\n        case Qt::Key_F4:\n            return gloperate::KeyF4;\n        case Qt::Key_F5:\n            return gloperate::KeyF5;\n        case Qt::Key_F6:\n            return gloperate::KeyF6;\n        case Qt::Key_F7:\n            return gloperate::KeyF7;\n        case Qt::Key_F8:\n            return gloperate::KeyF8;\n        case Qt::Key_F9:\n            return gloperate::KeyF9;\n        case Qt::Key_F10:\n            return gloperate::KeyF10;\n        case Qt::Key_F11:\n            return gloperate::KeyF11;\n        case Qt::Key_F12:\n            return gloperate::KeyF12;\n        case Qt::Key_F13:\n            return gloperate::KeyF13;\n        case Qt::Key_F14:\n            return gloperate::KeyF14;\n        case Qt::Key_F15:\n            return gloperate::KeyF15;\n        case Qt::Key_F16:\n            return gloperate::KeyF16;\n        case Qt::Key_F17:\n            return gloperate::KeyF17;\n        case Qt::Key_F18:\n            return gloperate::KeyF18;\n        case Qt::Key_F19:\n            return gloperate::KeyF19;\n        case Qt::Key_F20:\n            return gloperate::KeyF20;\n        case Qt::Key_F21:\n            return gloperate::KeyF21;\n        case Qt::Key_F22:\n            return gloperate::KeyF22;\n        case Qt::Key_F23:\n            return gloperate::KeyF23;\n        case Qt::Key_F24:\n            return gloperate::KeyF24;\n        case Qt::Key_F25:\n            return gloperate::KeyF25;\n        case Qt::Key_Shift:\n            return gloperate::KeyLeftShift;\n        case Qt::Key_Control:\n            return gloperate::KeyLeftControl;\n        case Qt::Key_Alt:\n            return gloperate::KeyLeftAlt;\n        case Qt::Key_Super_L:\n            return gloperate::KeyLeftSuper;\n        case Qt::Key_AltGr:\n            return gloperate::KeyRightAlt;\n        case Qt::Key_Super_R:\n            return gloperate::KeyRightSuper;\n        case Qt::Key_Menu:\n            return gloperate::KeyMenu;\n        default:\n            return gloperate::KeyUnknown;\n        }\n    }\n}\n\ngloperate::KeyModifier Converter::fromQtModifiers(int mod)\n{\n    gloperate::KeyModifier modifier = gloperate::ModNone;\n\n    modifier = modifier | (Qt::ShiftModifier & mod)   ? gloperate::ModShift   : gloperate::ModNone;\n    modifier = modifier | (Qt::ControlModifier & mod) ? gloperate::ModControl : gloperate::ModNone;\n    modifier = modifier | (Qt::AltModifier & mod)     ? gloperate::ModAlt     : gloperate::ModNone;\n    modifier = modifier | (Qt::MetaModifier & mod)    ? gloperate::ModSuper   : gloperate::ModNone;\n\n    return modifier;\n}\n\n\n} \/\/ namespace gloperate_qt\n<commit_msg>Fix operator precedence error in gloperate_qt::Converter::fromQtModifiers<commit_after>\n#include <gloperate-qt\/base\/Converter.h>\n\n#include <QKeyEvent>\n#include <QGLWidget>\n\n#include <glm\/vec2.hpp>\n\n\nnamespace gloperate_qt\n{\n\n\n\/\/ Helper functions\ngloperate::KeyModifier operator|(gloperate::KeyModifier left, gloperate::KeyModifier right)\n{\n    return gloperate::KeyModifier(static_cast<int>(left) | static_cast<int>(right));\n}\n\n\n\/\/ Converter\nQImage Converter::convert(const QImage & image)\n{\n    return QGLWidget::convertToGLFormat(image);\n}\n\nglm::ivec2 Converter::fromQPoint(const QPoint & point)\n{\n    return glm::ivec2(point.x(), point.y());\n}\n\ngloperate::MouseButton Converter::fromQtMouseButton(Qt::MouseButton button)\n{\n    if (button & Qt::LeftButton)\n        return gloperate::MouseButtonLeft;\n    else if (button & Qt::RightButton)\n        return gloperate::MouseButtonRight;\n    else if (button & Qt::MiddleButton)\n        return gloperate::MouseButtonMiddle;\n    else if (button & Qt::XButton1)\n        return gloperate::MouseButton4;\n    else if (button & Qt::XButton2)\n        return gloperate::MouseButton5;\n    else\n        return gloperate::NoMouseButton;\n}\n\ngloperate::Key Converter::fromQtKeyCode(int key, int mods)\n{\n    if (mods & Qt::KeypadModifier)\n    {\n        switch (key)\n        {\n        case Qt::Key_0:\n            return gloperate::KeyKeypad0;\n        case Qt::Key_1:\n            return gloperate::KeyKeypad1;\n        case Qt::Key_2:\n            return gloperate::KeyKeypad2;\n        case Qt::Key_3:\n            return gloperate::KeyKeypad3;\n        case Qt::Key_4:\n            return gloperate::KeyKeypad4;\n        case Qt::Key_5:\n            return gloperate::KeyKeypad5;\n        case Qt::Key_6:\n            return gloperate::KeyKeypad6;\n        case Qt::Key_7:\n            return gloperate::KeyKeypad7;\n        case Qt::Key_8:\n            return gloperate::KeyKeypad8;\n        case Qt::Key_9:\n            return gloperate::KeyKeypad9;\n        case Qt::Key_division:\n            return gloperate::KeyKeypadDivide;\n        case Qt::Key_multiply:\n            return gloperate::KeyKeypadMultiply;\n        case Qt::Key_Minus:\n            return gloperate::KeyKeypadSubtract;\n        case Qt::Key_Plus:\n            return gloperate::KeyKeypadAdd;\n        case Qt::Key_Enter:\n            return gloperate::KeyKeypadEnter;\n        case Qt::Key_Equal:\n            return gloperate::KeyKeypadEqual;\n        default:\n            return gloperate::KeyUnknown;\n        };\n    }\n    else\n    {\n        switch (key)\n        {\n        case Qt::Key_Space:\n            return gloperate::KeySpace;\n        case Qt::Key_Apostrophe:\n            return gloperate::KeyApostrophe;\n        case Qt::Key_Comma:\n            return gloperate::KeyComma;\n        case Qt::Key_Minus:\n            return gloperate::KeyMinus;\n        case Qt::Key_Period:\n            return gloperate::KeyPeriod;\n        case Qt::Key_Slash:\n            return gloperate::KeySlash;\n        case Qt::Key_0:\n            return gloperate::Key0;\n        case Qt::Key_1:\n            return gloperate::Key1;\n        case Qt::Key_2:\n            return gloperate::Key2;\n        case Qt::Key_3:\n            return gloperate::Key3;\n        case Qt::Key_4:\n            return gloperate::Key4;\n        case Qt::Key_5:\n            return gloperate::Key5;\n        case Qt::Key_6:\n            return gloperate::Key6;\n        case Qt::Key_7:\n            return gloperate::Key7;\n        case Qt::Key_8:\n            return gloperate::Key8;\n        case Qt::Key_9:\n            return gloperate::Key9;\n        case Qt::Key_Semicolon:\n            return gloperate::KeySemicolon;\n        case Qt::Key_Equal:\n            return gloperate::KeyEqual;\n        case Qt::Key_A:\n            return gloperate::KeyA;\n        case Qt::Key_B:\n            return gloperate::KeyB;\n        case Qt::Key_C:\n            return gloperate::KeyC;\n        case Qt::Key_D:\n            return gloperate::KeyD;\n        case Qt::Key_E:\n            return gloperate::KeyE;\n        case Qt::Key_F:\n            return gloperate::KeyF;\n        case Qt::Key_G:\n            return gloperate::KeyG;\n        case Qt::Key_H:\n            return gloperate::KeyH;\n        case Qt::Key_I:\n            return gloperate::KeyI;\n        case Qt::Key_J:\n            return gloperate::KeyJ;\n        case Qt::Key_K:\n            return gloperate::KeyK;\n        case Qt::Key_L:\n            return gloperate::KeyL;\n        case Qt::Key_M:\n            return gloperate::KeyM;\n        case Qt::Key_N:\n            return gloperate::KeyN;\n        case Qt::Key_O:\n            return gloperate::KeyO;\n        case Qt::Key_P:\n            return gloperate::KeyP;\n        case Qt::Key_Q:\n            return gloperate::KeyQ;\n        case Qt::Key_R:\n            return gloperate::KeyR;\n        case Qt::Key_S:\n            return gloperate::KeyS;\n        case Qt::Key_T:\n            return gloperate::KeyT;\n        case Qt::Key_U:\n            return gloperate::KeyU;\n        case Qt::Key_V:\n            return gloperate::KeyV;\n        case Qt::Key_W:\n            return gloperate::KeyW;\n        case Qt::Key_X:\n            return gloperate::KeyX;\n        case Qt::Key_Y:\n            return gloperate::KeyY;\n        case Qt::Key_Z:\n            return gloperate::KeyZ;\n        case Qt::Key_BracketLeft:\n            return gloperate::KeyLeftBracket;\n        case Qt::Key_Backslash:\n            return gloperate::KeyBackslash;\n        case Qt::Key_BracketRight:\n            return gloperate::KeyRightBracket;\n        case Qt::Key_Agrave:\n            return gloperate::KeyGraveAccent;\n        case Qt::Key_Escape:\n            return gloperate::KeyEscape;\n        case Qt::Key_Return:\n            return gloperate::KeyEnter;\n        case Qt::Key_Tab:\n            return gloperate::KeyTab;\n        case Qt::Key_Backspace:\n            return gloperate::KeyBackspace;\n        case Qt::Key_Insert:\n            return gloperate::KeyInsert;\n        case Qt::Key_Delete:\n            return gloperate::KeyDelete;\n        case Qt::Key_Right:\n            return gloperate::KeyRight;\n        case Qt::Key_Left:\n            return gloperate::KeyLeft;\n        case Qt::Key_Down:\n            return gloperate::KeyDown;\n        case Qt::Key_Up:\n            return gloperate::KeyUp;\n        case Qt::Key_PageUp:\n            return gloperate::KeyPageUp;\n        case Qt::Key_PageDown:\n            return gloperate::KeyPageDown;\n        case Qt::Key_Home:\n            return gloperate::KeyHome;\n        case Qt::Key_End:\n            return gloperate::KeyEnd;\n        case Qt::Key_CapsLock:\n            return gloperate::KeyCapsLock;\n        case Qt::Key_ScrollLock:\n            return gloperate::KeyScrollLock;\n        case Qt::Key_NumLock:\n            return gloperate::KeyNumLock;\n        case Qt::Key_Print:\n            return gloperate::KeyPrintScreen;\n        case Qt::Key_Pause:\n            return gloperate::KeyPause;\n        case Qt::Key_F1:\n            return gloperate::KeyF1;\n        case Qt::Key_F2:\n            return gloperate::KeyF2;\n        case Qt::Key_F3:\n            return gloperate::KeyF3;\n        case Qt::Key_F4:\n            return gloperate::KeyF4;\n        case Qt::Key_F5:\n            return gloperate::KeyF5;\n        case Qt::Key_F6:\n            return gloperate::KeyF6;\n        case Qt::Key_F7:\n            return gloperate::KeyF7;\n        case Qt::Key_F8:\n            return gloperate::KeyF8;\n        case Qt::Key_F9:\n            return gloperate::KeyF9;\n        case Qt::Key_F10:\n            return gloperate::KeyF10;\n        case Qt::Key_F11:\n            return gloperate::KeyF11;\n        case Qt::Key_F12:\n            return gloperate::KeyF12;\n        case Qt::Key_F13:\n            return gloperate::KeyF13;\n        case Qt::Key_F14:\n            return gloperate::KeyF14;\n        case Qt::Key_F15:\n            return gloperate::KeyF15;\n        case Qt::Key_F16:\n            return gloperate::KeyF16;\n        case Qt::Key_F17:\n            return gloperate::KeyF17;\n        case Qt::Key_F18:\n            return gloperate::KeyF18;\n        case Qt::Key_F19:\n            return gloperate::KeyF19;\n        case Qt::Key_F20:\n            return gloperate::KeyF20;\n        case Qt::Key_F21:\n            return gloperate::KeyF21;\n        case Qt::Key_F22:\n            return gloperate::KeyF22;\n        case Qt::Key_F23:\n            return gloperate::KeyF23;\n        case Qt::Key_F24:\n            return gloperate::KeyF24;\n        case Qt::Key_F25:\n            return gloperate::KeyF25;\n        case Qt::Key_Shift:\n            return gloperate::KeyLeftShift;\n        case Qt::Key_Control:\n            return gloperate::KeyLeftControl;\n        case Qt::Key_Alt:\n            return gloperate::KeyLeftAlt;\n        case Qt::Key_Super_L:\n            return gloperate::KeyLeftSuper;\n        case Qt::Key_AltGr:\n            return gloperate::KeyRightAlt;\n        case Qt::Key_Super_R:\n            return gloperate::KeyRightSuper;\n        case Qt::Key_Menu:\n            return gloperate::KeyMenu;\n        default:\n            return gloperate::KeyUnknown;\n        }\n    }\n}\n\ngloperate::KeyModifier Converter::fromQtModifiers(int mod)\n{\n    gloperate::KeyModifier modifier = gloperate::ModNone;\n\n    modifier = modifier | ((Qt::ShiftModifier & mod)   ? gloperate::ModShift   : gloperate::ModNone);\n    modifier = modifier | ((Qt::ControlModifier & mod) ? gloperate::ModControl : gloperate::ModNone);\n    modifier = modifier | ((Qt::AltModifier & mod)     ? gloperate::ModAlt     : gloperate::ModNone);\n    modifier = modifier | ((Qt::MetaModifier & mod)    ? gloperate::ModSuper   : gloperate::ModNone);\n\n    return modifier;\n}\n\n\n} \/\/ namespace gloperate_qt\n<|endoftext|>"}
{"text":"<commit_before>#include <ir\/index_manager\/index\/FieldMerger.h>\r\n#include <ir\/index_manager\/index\/Posting.h>\r\n#include <ir\/index_manager\/index\/IndexBarrelWriter.h>\r\n#include <ir\/index_manager\/index\/TermReader.h>\r\n#include <ir\/index_manager\/index\/MultiPostingIterator.h>\r\n\r\n#define MEMPOOL_SIZE_FOR_MERGING    50*1024*1024\r\n\r\nusing namespace izenelib::ir::indexmanager;\r\n\r\nFieldMerger::FieldMerger(bool sortingMerge)\r\n        :sortingMerge_(sortingMerge)\r\n        ,buffer_(NULL)\r\n        ,bufsize_(0)\r\n        ,pMergeQueue_(NULL)\r\n        ,pPostingMerger_(NULL)\r\n        ,nNumTermCached_(0)\r\n        ,pDirectory_(NULL)\r\n        ,ppFieldInfos_(NULL)\r\n        ,nNumInfos_(0)\r\n        ,termCount_(0)\r\n        ,lastTerm_(0)\r\n        ,lastPOffset_(0)\r\n        ,beginOfVoc_(0)\r\n        ,nMergedTerms_(0)\r\n        ,pDocFilter_(0)\r\n        ,pMemCache_(0)\r\n{\r\n    memset(cachedTermInfos_,0,NUM_CACHEDTERMINFO*sizeof(MergeTermInfo*));\r\n}\r\n\r\nFieldMerger::~FieldMerger(void)\r\n{\r\n    buffer_ = NULL;\r\n    bufsize_ = 0;\r\n    vector<MergeFieldEntry*>::iterator iter = fieldEntries_.begin();\r\n    while (iter != fieldEntries_.end())\r\n    {\r\n        delete (*iter);\r\n        iter++;\r\n    }\r\n    fieldEntries_.clear();\r\n\r\n    if (pMergeQueue_)\r\n    {\r\n        delete pMergeQueue_;\r\n        pMergeQueue_ = NULL;\r\n    }\r\n    if (pPostingMerger_)\r\n    {\r\n        delete pPostingMerger_;\r\n        pPostingMerger_ = NULL;\r\n    }\r\n\r\n    for (int32_t i = 0;i<NUM_CACHEDTERMINFO;i++)\r\n    {\r\n        if (cachedTermInfos_[i])\r\n        {\r\n            delete cachedTermInfos_[i];\r\n            cachedTermInfos_[i] = NULL;\r\n        }\r\n    }\r\n\r\n    if (ppFieldInfos_)\r\n    {\r\n        delete[] ppFieldInfos_;\r\n        ppFieldInfos_ = NULL;\r\n        nNumInfos_ = 0;\r\n    }\r\n    pDocFilter_ = 0;\r\n    if(pMemCache_)\r\n    {\r\n        delete pMemCache_;\r\n        pMemCache_ = NULL;\r\n    }\r\n}\r\nvoid FieldMerger::addField(BarrelInfo* pBarrelInfo,FieldInfo* pFieldInfo)\r\n{\r\n    fieldEntries_.push_back(new MergeFieldEntry(pBarrelInfo,pFieldInfo));\r\n    if (pPostingMerger_ == NULL)\r\n        pPostingMerger_ = new PostingMerger();\r\n\r\n}\r\n\r\nfileoffset_t FieldMerger::merge(OutputDescriptor* pOutputDescriptor)\r\n{\r\n    if (initQueue() == false)\/\/\/initialize merge queue\r\n        \/\/return 0; \r\n        \/\/When collection is empty in a barrel, it still needs to write some information.\r\n        return endMerge(pOutputDescriptor);\r\n\r\n\r\n    pPostingMerger_->setOutputDescriptor(pOutputDescriptor);\r\n\r\n    nMergedTerms_ = 0;\r\n    int64_t mergedTerms = 0;\r\n    int32_t nMatch = 0;\r\n    FieldMergeInfo** match = new FieldMergeInfo*[pMergeQueue_->size()];\r\n    Term* pTerm = NULL;\r\n    FieldMergeInfo* pTop = NULL;\r\n    fileoffset_t postingoffset = 0;\r\n    freq_t sortingMergeDF = 0;\r\n    while (pMergeQueue_->size() > 0)\r\n    {\r\n        nMatch = 0;\r\n        \/\/Pop the first\r\n        match[nMatch++] = pMergeQueue_->pop();\r\n        pTerm = match[0]->pCurTerm_;\r\n        \/\/Get the current top of the queue\r\n        pTop = pMergeQueue_->top();\r\n        while (pTop != NULL && (pTerm->compare(pTop->pCurTerm_)==0) )\r\n        {\r\n            \/\/A match has been found so add the matching FieldMergeInfo to the match array\r\n            match[nMatch++] = pMergeQueue_->pop();\r\n            \/\/Get the next FieldMergeInfo\r\n            pTop = pMergeQueue_->top();\r\n        }\r\n\r\n        postingoffset = mergeTerms(match,nMatch,sortingMergeDF);\r\n\r\n        if (postingoffset > 0)\r\n        {\r\n            \/\/\/store merged terms to term info cache\r\n            if (cachedTermInfos_[nNumTermCached_] == NULL)\r\n            {\r\n                if(sortingMerge_)\r\n                    cachedTermInfos_[nNumTermCached_] = \r\n                        new MergeTermInfo(pTerm->clone(),\r\n                                                        new TermInfo(sortingMergeDF,postingoffset));\r\n                else\r\n                    cachedTermInfos_[nNumTermCached_] = \r\n                        new MergeTermInfo(pTerm->clone(),\r\n                                                        new TermInfo(pPostingMerger_->getPostingDescriptor().df,postingoffset));\r\n            }\r\n            else\r\n            {\r\n                cachedTermInfos_[nNumTermCached_]->pTerm_->setValue(pTerm->getValue());\r\n                if(sortingMerge_)\r\n                    cachedTermInfos_[nNumTermCached_]->pTermInfo_->set(sortingMergeDF,postingoffset);\t\t\t\t\t\r\n                else\r\n                    cachedTermInfos_[nNumTermCached_]->pTermInfo_->set(pPostingMerger_->getPostingDescriptor().df,postingoffset);\r\n            }\r\n            nNumTermCached_++;\r\n            if (nNumTermCached_ >= NUM_CACHEDTERMINFO)\/\/\/cache is exhausted\r\n            {\r\n                flushTermInfo(pOutputDescriptor,cachedTermInfos_,nNumTermCached_);\r\n                nNumTermCached_ = 0;\r\n            }\r\n            mergedTerms++;\r\n        }\r\n\r\n        while (nMatch > 0)\r\n        {\r\n            pTop = match[--nMatch];\r\n\r\n            \/\/Move to the next term i\r\n            if (pTop->next())\r\n            {\r\n                \/\/There still are some terms so restore it in the queue\r\n                pMergeQueue_->put(pTop);\r\n            }\r\n            else\r\n            {\r\n                \/\/No terms anymore\r\n                delete pTop;\r\n            }\r\n        }\r\n    }\r\n    if (nNumTermCached_ > 0)\/\/\/flush cache\r\n    {\r\n        flushTermInfo(pOutputDescriptor,cachedTermInfos_,nNumTermCached_);\r\n        nNumTermCached_ = 0;\r\n    }\r\n    delete[] match;\r\n    nMergedTerms_ = mergedTerms;\r\n    return endMerge(pOutputDescriptor);\/\/\/merge end here\r\n}\r\n\r\nvoid FieldMerger::setBuffer(char* buf,size_t bufSize)\r\n{\r\n    buffer_ = buf;\r\n    bufsize_ = bufSize;\r\n}\r\n\r\nbool FieldMerger::initQueue()\r\n{\r\n    if (fieldEntries_.size() <= 0)\r\n        return false;\r\n    pMergeQueue_ = new FieldMergeQueue(fieldEntries_.size());\r\n    TermReader* pTermReader = NULL;\r\n    FieldMergeInfo* pMI = NULL;\r\n    MergeFieldEntry* pEntry;\r\n\r\n    size_t nSubBufSize = 0;\r\n    size_t nCurBufferSize = 0;\r\n    size_t nTotalUsed = 0;\r\n    size_t nSubBufUsed = 0;\r\n\r\n    \/\/\/dispatch buffer\r\n    if ( (bufsize_ > 0) && (fieldEntries_.size() > 0))\r\n    {\r\n        nSubBufSize = bufsize_\/fieldEntries_.size();\r\n        nCurBufferSize = nSubBufSize;\r\n    }\r\n\r\n    int32_t order = 0;\r\n    nNumInfos_ = fieldEntries_.size();\r\n    if (nNumInfos_ > 0)\r\n    {\r\n        ppFieldInfos_ = new MergeFieldEntry*[fieldEntries_.size()];\r\n        memset(ppFieldInfos_,0,nNumInfos_ * sizeof(MergeFieldEntry*));\r\n    }\r\n    vector<MergeFieldEntry*>::iterator iter = fieldEntries_.begin();\r\n    while (iter != fieldEntries_.end())\r\n    {\r\n        pEntry = (*iter);\r\n        ppFieldInfos_[order] = pEntry;\r\n        if (pEntry->pBarrelInfo_->getWriter()) \/\/\/in-memory index barrel\r\n        {\r\n            pTermReader = pEntry->pBarrelInfo_->getWriter()->getCollectionIndexer(pEntry->pFieldInfo_->getColID())\r\n\t\t\t\t->getFieldIndexer(pEntry->pFieldInfo_->getName())->termReader();\r\n        }\r\n        else\r\n        {\r\n            \/\/\/on-disk index barrel\r\n            pTermReader = new DiskTermReader(pDirectory_,pEntry->pBarrelInfo_->getName().c_str(),pEntry->pFieldInfo_);\r\n        }\r\n        pMI = new FieldMergeInfo(order,pEntry->pFieldInfo_->getColID(),pEntry->pBarrelInfo_,pTermReader);\r\n        if (nSubBufSize > 0)\r\n        {\r\n            nSubBufUsed = pMI->pIterator_->setBuffer(buffer_ + nTotalUsed,nCurBufferSize);\r\n            nTotalUsed += nSubBufUsed;\r\n        }\r\n        if (pMI->next())\t\/\/\/get first term\r\n        {\r\n            pMergeQueue_->put(pMI);\r\n            nCurBufferSize = nSubBufSize + (nCurBufferSize - nSubBufUsed);\r\n            order++;\r\n        }\r\n        else\r\n        {\r\n            nTotalUsed -= nSubBufUsed;\r\n            delete pMI;\r\n        }\r\n        iter++;\r\n    }\r\n    nNumInfos_ = order;\r\n\r\n    \/\/\/buffer for posting merging\r\n    if ( (bufsize_ - nTotalUsed) > POSTINGMERGE_BUFFERSIZE)\r\n        pPostingMerger_->setBuffer(buffer_ + nTotalUsed,bufsize_ - nTotalUsed);\r\n\r\n    return (pMergeQueue_->size() > 0);\r\n}\r\n\r\nvoid FieldMerger::flushTermInfo(OutputDescriptor* pOutputDescriptor,MergeTermInfo** ppTermInfo,int32_t numTermInfos)\r\n{\r\n    IndexOutput* pVocOutput = pOutputDescriptor->getVocOutput();\r\n\r\n    if (termCount_ == 0)\r\n        beginOfVoc_ = pVocOutput->getFilePointer();\r\n    termid_t tid;\r\n    fileoffset_t poffset;\r\n    for (int32_t i = 0;i < numTermInfos;i++)\r\n    {\r\n        tid = ppTermInfo[i]->getTerm()->getValue();\r\n        \/\/pVocOutput->writeInt(tid - lastTerm_);\r\n        pVocOutput->writeInt(tid);\r\n        pVocOutput->writeInt(ppTermInfo[i]->getTermInfo()->docFreq());\r\n        poffset = ppTermInfo[i]->getTermInfo()->docPointer();\r\n        pVocOutput->writeLong(poffset);\r\n        \/\/lastTerm_ = tid;\r\n        \/\/lastPOffset_ = poffset;\r\n        termCount_++;\r\n    }\r\n\r\n}\r\n\r\nfileoffset_t FieldMerger::endMerge(OutputDescriptor* pOutputDescriptor)\r\n{\r\n    IndexOutput* pVocOutput = pOutputDescriptor->getVocOutput();\r\n    fileoffset_t voffset = pVocOutput->getFilePointer();\r\n    \/\/\/begin write vocabulary descriptor\r\n    pVocOutput->writeLong(voffset - beginOfVoc_);\r\n    pVocOutput->writeLong(termCount_);\r\n    \/\/\/end write vocabulary descriptor\r\n    return voffset;\r\n}\r\n\r\nfileoffset_t FieldMerger::sortingMerge(FieldMergeInfo** ppMergeInfos,int32_t numInfos, BitVector* pFilter, freq_t& df)\r\n{\r\n    if(!pMemCache_)\r\n        pMemCache_ = new MemCache(MEMPOOL_SIZE_FOR_MERGING);\r\n    MultiPostingIterator postingIterator(numInfos);\r\n\r\n    for (int32_t i = 0;i< numInfos;i++)\r\n    {\r\n        TermPositions* pPosition = new TermPositions(ppMergeInfos[i]->pIterator_->termPosting());\r\n        if(ppMergeInfos[i]->pBarrelInfo_->hasUpdateDocs)\r\n            postingIterator.addTermPosition(pPosition);\r\n        else\r\n            postingIterator.addTermPosition(pPosition, pFilter);\r\n    }\r\n    InMemoryPosting* newPosting = new InMemoryPosting(pMemCache_);\r\n\r\n    docid_t docId = 0;\r\n    while(postingIterator.next())\r\n    {\r\n        docId = postingIterator.doc();\r\n        loc_t pos = postingIterator.nextPosition();\r\n        while (pos != BAD_POSITION)\r\n        {\r\n            newPosting->addLocation(docId, pos);\r\n            pos = postingIterator.nextPosition();\r\n        }\r\n    }\r\n    fileoffset_t offset = newPosting->write(pPostingMerger_->getOutputDescriptor());\r\n    df = newPosting->docFreq();\r\n    delete newPosting;\r\n    pMemCache_->flushMem();\r\n    return offset;\r\n}\r\n\r\n\r\n<commit_msg>update error for indexmanager: if a posting contains only one doc, and it will be deleted during updating, such kinds of situation has some problems<commit_after>#include <ir\/index_manager\/index\/FieldMerger.h>\r\n#include <ir\/index_manager\/index\/Posting.h>\r\n#include <ir\/index_manager\/index\/IndexBarrelWriter.h>\r\n#include <ir\/index_manager\/index\/TermReader.h>\r\n#include <ir\/index_manager\/index\/MultiPostingIterator.h>\r\n\r\n#define MEMPOOL_SIZE_FOR_MERGING    50*1024*1024\r\n\r\nusing namespace izenelib::ir::indexmanager;\r\n\r\nFieldMerger::FieldMerger(bool sortingMerge)\r\n        :sortingMerge_(sortingMerge)\r\n        ,buffer_(NULL)\r\n        ,bufsize_(0)\r\n        ,pMergeQueue_(NULL)\r\n        ,pPostingMerger_(NULL)\r\n        ,nNumTermCached_(0)\r\n        ,pDirectory_(NULL)\r\n        ,ppFieldInfos_(NULL)\r\n        ,nNumInfos_(0)\r\n        ,termCount_(0)\r\n        ,lastTerm_(0)\r\n        ,lastPOffset_(0)\r\n        ,beginOfVoc_(0)\r\n        ,nMergedTerms_(0)\r\n        ,pDocFilter_(0)\r\n        ,pMemCache_(0)\r\n{\r\n    memset(cachedTermInfos_,0,NUM_CACHEDTERMINFO*sizeof(MergeTermInfo*));\r\n}\r\n\r\nFieldMerger::~FieldMerger(void)\r\n{\r\n    buffer_ = NULL;\r\n    bufsize_ = 0;\r\n    vector<MergeFieldEntry*>::iterator iter = fieldEntries_.begin();\r\n    while (iter != fieldEntries_.end())\r\n    {\r\n        delete (*iter);\r\n        iter++;\r\n    }\r\n    fieldEntries_.clear();\r\n\r\n    if (pMergeQueue_)\r\n    {\r\n        delete pMergeQueue_;\r\n        pMergeQueue_ = NULL;\r\n    }\r\n    if (pPostingMerger_)\r\n    {\r\n        delete pPostingMerger_;\r\n        pPostingMerger_ = NULL;\r\n    }\r\n\r\n    for (int32_t i = 0;i<NUM_CACHEDTERMINFO;i++)\r\n    {\r\n        if (cachedTermInfos_[i])\r\n        {\r\n            delete cachedTermInfos_[i];\r\n            cachedTermInfos_[i] = NULL;\r\n        }\r\n    }\r\n\r\n    if (ppFieldInfos_)\r\n    {\r\n        delete[] ppFieldInfos_;\r\n        ppFieldInfos_ = NULL;\r\n        nNumInfos_ = 0;\r\n    }\r\n    pDocFilter_ = 0;\r\n    if(pMemCache_)\r\n    {\r\n        delete pMemCache_;\r\n        pMemCache_ = NULL;\r\n    }\r\n}\r\nvoid FieldMerger::addField(BarrelInfo* pBarrelInfo,FieldInfo* pFieldInfo)\r\n{\r\n    fieldEntries_.push_back(new MergeFieldEntry(pBarrelInfo,pFieldInfo));\r\n    if (pPostingMerger_ == NULL)\r\n        pPostingMerger_ = new PostingMerger();\r\n\r\n}\r\n\r\nfileoffset_t FieldMerger::merge(OutputDescriptor* pOutputDescriptor)\r\n{\r\n    if (initQueue() == false)\/\/\/initialize merge queue\r\n        \/\/return 0; \r\n        \/\/When collection is empty in a barrel, it still needs to write some information.\r\n        return endMerge(pOutputDescriptor);\r\n\r\n\r\n    pPostingMerger_->setOutputDescriptor(pOutputDescriptor);\r\n\r\n    nMergedTerms_ = 0;\r\n    int64_t mergedTerms = 0;\r\n    int32_t nMatch = 0;\r\n    FieldMergeInfo** match = new FieldMergeInfo*[pMergeQueue_->size()];\r\n    Term* pTerm = NULL;\r\n    FieldMergeInfo* pTop = NULL;\r\n    fileoffset_t postingoffset = 0;\r\n    freq_t sortingMergeDF = 0;\r\n    while (pMergeQueue_->size() > 0)\r\n    {\r\n        nMatch = 0;\r\n        \/\/Pop the first\r\n        match[nMatch++] = pMergeQueue_->pop();\r\n        pTerm = match[0]->pCurTerm_;\r\n        \/\/Get the current top of the queue\r\n        pTop = pMergeQueue_->top();\r\n        while (pTop != NULL && (pTerm->compare(pTop->pCurTerm_)==0) )\r\n        {\r\n            \/\/A match has been found so add the matching FieldMergeInfo to the match array\r\n            match[nMatch++] = pMergeQueue_->pop();\r\n            \/\/Get the next FieldMergeInfo\r\n            pTop = pMergeQueue_->top();\r\n        }\r\n\r\n        postingoffset = mergeTerms(match,nMatch,sortingMergeDF);\r\n\r\n        if (postingoffset > 0)\r\n        {\r\n            \/\/\/store merged terms to term info cache\r\n            if (cachedTermInfos_[nNumTermCached_] == NULL)\r\n            {\r\n                if(sortingMerge_)\r\n                    cachedTermInfos_[nNumTermCached_] = \r\n                        new MergeTermInfo(pTerm->clone(),\r\n                                                        new TermInfo(sortingMergeDF,postingoffset));\r\n                else\r\n                    cachedTermInfos_[nNumTermCached_] = \r\n                        new MergeTermInfo(pTerm->clone(),\r\n                                                        new TermInfo(pPostingMerger_->getPostingDescriptor().df,postingoffset));\r\n            }\r\n            else\r\n            {\r\n                cachedTermInfos_[nNumTermCached_]->pTerm_->setValue(pTerm->getValue());\r\n                if(sortingMerge_)\r\n                    cachedTermInfos_[nNumTermCached_]->pTermInfo_->set(sortingMergeDF,postingoffset);\t\t\t\t\t\r\n                else\r\n                    cachedTermInfos_[nNumTermCached_]->pTermInfo_->set(pPostingMerger_->getPostingDescriptor().df,postingoffset);\r\n            }\r\n            nNumTermCached_++;\r\n            if (nNumTermCached_ >= NUM_CACHEDTERMINFO)\/\/\/cache is exhausted\r\n            {\r\n                flushTermInfo(pOutputDescriptor,cachedTermInfos_,nNumTermCached_);\r\n                nNumTermCached_ = 0;\r\n            }\r\n            mergedTerms++;\r\n        }\r\n\r\n        while (nMatch > 0)\r\n        {\r\n            pTop = match[--nMatch];\r\n\r\n            \/\/Move to the next term i\r\n            if (pTop->next())\r\n            {\r\n                \/\/There still are some terms so restore it in the queue\r\n                pMergeQueue_->put(pTop);\r\n            }\r\n            else\r\n            {\r\n                \/\/No terms anymore\r\n                delete pTop;\r\n            }\r\n        }\r\n    }\r\n    if (nNumTermCached_ > 0)\/\/\/flush cache\r\n    {\r\n        flushTermInfo(pOutputDescriptor,cachedTermInfos_,nNumTermCached_);\r\n        nNumTermCached_ = 0;\r\n    }\r\n    delete[] match;\r\n    nMergedTerms_ = mergedTerms;\r\n    return endMerge(pOutputDescriptor);\/\/\/merge end here\r\n}\r\n\r\nvoid FieldMerger::setBuffer(char* buf,size_t bufSize)\r\n{\r\n    buffer_ = buf;\r\n    bufsize_ = bufSize;\r\n}\r\n\r\nbool FieldMerger::initQueue()\r\n{\r\n    if (fieldEntries_.size() <= 0)\r\n        return false;\r\n    pMergeQueue_ = new FieldMergeQueue(fieldEntries_.size());\r\n    TermReader* pTermReader = NULL;\r\n    FieldMergeInfo* pMI = NULL;\r\n    MergeFieldEntry* pEntry;\r\n\r\n    size_t nSubBufSize = 0;\r\n    size_t nCurBufferSize = 0;\r\n    size_t nTotalUsed = 0;\r\n    size_t nSubBufUsed = 0;\r\n\r\n    \/\/\/dispatch buffer\r\n    if ( (bufsize_ > 0) && (fieldEntries_.size() > 0))\r\n    {\r\n        nSubBufSize = bufsize_\/fieldEntries_.size();\r\n        nCurBufferSize = nSubBufSize;\r\n    }\r\n\r\n    int32_t order = 0;\r\n    nNumInfos_ = fieldEntries_.size();\r\n    if (nNumInfos_ > 0)\r\n    {\r\n        ppFieldInfos_ = new MergeFieldEntry*[fieldEntries_.size()];\r\n        memset(ppFieldInfos_,0,nNumInfos_ * sizeof(MergeFieldEntry*));\r\n    }\r\n    vector<MergeFieldEntry*>::iterator iter = fieldEntries_.begin();\r\n    while (iter != fieldEntries_.end())\r\n    {\r\n        pEntry = (*iter);\r\n        ppFieldInfos_[order] = pEntry;\r\n        if (pEntry->pBarrelInfo_->getWriter()) \/\/\/in-memory index barrel\r\n        {\r\n            pTermReader = pEntry->pBarrelInfo_->getWriter()->getCollectionIndexer(pEntry->pFieldInfo_->getColID())\r\n\t\t\t\t->getFieldIndexer(pEntry->pFieldInfo_->getName())->termReader();\r\n        }\r\n        else\r\n        {\r\n            \/\/\/on-disk index barrel\r\n            pTermReader = new DiskTermReader(pDirectory_,pEntry->pBarrelInfo_->getName().c_str(),pEntry->pFieldInfo_);\r\n        }\r\n        pMI = new FieldMergeInfo(order,pEntry->pFieldInfo_->getColID(),pEntry->pBarrelInfo_,pTermReader);\r\n        if (nSubBufSize > 0)\r\n        {\r\n            nSubBufUsed = pMI->pIterator_->setBuffer(buffer_ + nTotalUsed,nCurBufferSize);\r\n            nTotalUsed += nSubBufUsed;\r\n        }\r\n        if (pMI->next())\t\/\/\/get first term\r\n        {\r\n            pMergeQueue_->put(pMI);\r\n            nCurBufferSize = nSubBufSize + (nCurBufferSize - nSubBufUsed);\r\n            order++;\r\n        }\r\n        else\r\n        {\r\n            nTotalUsed -= nSubBufUsed;\r\n            delete pMI;\r\n        }\r\n        iter++;\r\n    }\r\n    nNumInfos_ = order;\r\n\r\n    \/\/\/buffer for posting merging\r\n    if ( (bufsize_ - nTotalUsed) > POSTINGMERGE_BUFFERSIZE)\r\n        pPostingMerger_->setBuffer(buffer_ + nTotalUsed,bufsize_ - nTotalUsed);\r\n\r\n    return (pMergeQueue_->size() > 0);\r\n}\r\n\r\nvoid FieldMerger::flushTermInfo(OutputDescriptor* pOutputDescriptor,MergeTermInfo** ppTermInfo,int32_t numTermInfos)\r\n{\r\n    IndexOutput* pVocOutput = pOutputDescriptor->getVocOutput();\r\n\r\n    if (termCount_ == 0)\r\n        beginOfVoc_ = pVocOutput->getFilePointer();\r\n    termid_t tid;\r\n    fileoffset_t poffset;\r\n    for (int32_t i = 0;i < numTermInfos;i++)\r\n    {\r\n        tid = ppTermInfo[i]->getTerm()->getValue();\r\n        \/\/pVocOutput->writeInt(tid - lastTerm_);\r\n        pVocOutput->writeInt(tid);\r\n        pVocOutput->writeInt(ppTermInfo[i]->getTermInfo()->docFreq());\r\n        poffset = ppTermInfo[i]->getTermInfo()->docPointer();\r\n        pVocOutput->writeLong(poffset);\r\n        \/\/lastTerm_ = tid;\r\n        \/\/lastPOffset_ = poffset;\r\n        termCount_++;\r\n    }\r\n\r\n}\r\n\r\nfileoffset_t FieldMerger::endMerge(OutputDescriptor* pOutputDescriptor)\r\n{\r\n    IndexOutput* pVocOutput = pOutputDescriptor->getVocOutput();\r\n    fileoffset_t voffset = pVocOutput->getFilePointer();\r\n    \/\/\/begin write vocabulary descriptor\r\n    pVocOutput->writeLong(voffset - beginOfVoc_);\r\n    pVocOutput->writeLong(termCount_);\r\n    \/\/\/end write vocabulary descriptor\r\n    return voffset;\r\n}\r\n\r\nfileoffset_t FieldMerger::sortingMerge(FieldMergeInfo** ppMergeInfos,int32_t numInfos, BitVector* pFilter, freq_t& df)\r\n{\r\n    if(!pMemCache_)\r\n        pMemCache_ = new MemCache(MEMPOOL_SIZE_FOR_MERGING);\r\n    MultiPostingIterator postingIterator(numInfos);\r\n\r\n    for (int32_t i = 0;i< numInfos;i++)\r\n    {\r\n        TermPositions* pPosition = new TermPositions(ppMergeInfos[i]->pIterator_->termPosting());\r\n        if(ppMergeInfos[i]->pBarrelInfo_->hasUpdateDocs)\r\n            postingIterator.addTermPosition(pPosition);\r\n        else\r\n            postingIterator.addTermPosition(pPosition, pFilter);\r\n    }\r\n    InMemoryPosting* newPosting = new InMemoryPosting(pMemCache_);\r\n\r\n    docid_t docId = 0;\r\n    while(postingIterator.next())\r\n    {\r\n        docId = postingIterator.doc();\r\n        loc_t pos = postingIterator.nextPosition();\r\n        while (pos != BAD_POSITION)\r\n        {\r\n            newPosting->addLocation(docId, pos);\r\n            pos = postingIterator.nextPosition();\r\n        }\r\n    }\r\n\r\n    if(0 == docId)\r\n    {\r\n        delete newPosting;\r\n        df = 0;\r\n        return -1;\r\n    }\r\n\r\n    fileoffset_t offset = newPosting->write(pPostingMerger_->getOutputDescriptor());\r\n    df = newPosting->docFreq();\r\n    delete newPosting;\r\n    pMemCache_->flushMem();\r\n    return offset;\r\n}\r\n\r\n\r\n<|endoftext|>"}
{"text":"<commit_before>#ifndef MANIFOLDS_FUNCTIONS_COMPLEX_HH\n#define MANIFOLDS_FUNCTIONS_COMPLEX_HH\n\n#include <utility>\n#include <complex>\n#include \"tmp_utils.hh\"\n#include \"function.hh\"\n#include \"full_function_defs.hh\"\n\nnamespace manifolds {\n\nstruct Real : Function<int_<27>, 1, 1>, FunctionCommon<Real> {\n  using FunctionCommon<Real>::operator();\n  static const bool stateless = true;\n  static const ComplexOutputBehaviour complex_output = NeverComplex;\n\n  template <class T> auto eval(T t) const {\n    using std::real;\n    return real(t);\n  }\n\n  template <class T> bool operator==(const T &) const {\n    return std::is_same<Real, T>::value;\n  }\n};\n\nstruct Imag : Function<int_<28>, 1, 1>, FunctionCommon<Imag> {\n  using FunctionCommon<Imag>::operator();\n  static const bool stateless = true;\n  static const ComplexOutputBehaviour complex_output = NeverComplex;\n\n  template <class T> auto eval(T t) const {\n    using std::imag;\n    return imag(t);\n  }\n\n  template <class T> bool operator==(const T &) const {\n    return std::is_same<Imag, T>::value;\n  }\n};\n\nstruct Phase : Function<int_<28>, 1, 1>, FunctionCommon<Phase> {\n  using FunctionCommon<Phase>::operator();\n  static const bool stateless = true;\n  static const ComplexOutputBehaviour complex_output = NeverComplex;\n  template <class T> auto eval(T t) const {\n    using std::arg;\n    return arg(t);\n  }\n\n  template <class T> bool operator==(const T &) const {\n    return std::is_same<Phase, T>::value;\n  }\n};\n\nusing Arg = Phase;\n\nstruct Norm : Function<int_<29>, 1, 1>, FunctionCommon<Norm> {\n  using FunctionCommon<Norm>::operator();\n  static const bool stateless = true;\n  static const ComplexOutputBehaviour complex_output = NeverComplex;\n\n  template <class T> auto eval(T t) const -> decltype(norm(t)) {\n    return norm(t);\n  }\n\n  template <class T> bool operator==(const T &) const {\n    return std::is_same<Norm, T>::value;\n  }\n\n  template <class T,\n            class = typename std::enable_if<!is_complex<T>::value>::type>\n  auto eval(T t) const {\n    return t * t;\n  }\n};\n\ntemplate <class Complex>\nstruct ImagN : Function<int_<30>, 0, 1>, FunctionCommon<ImagN<Complex> > {\n  using FunctionCommon<ImagN>::operator();\n  static const bool stateless = true;\n  static const ComplexOutputBehaviour complex_output = NeverComplex;\n\n  template <class... Args> auto eval(Args...) const { return Complex(0, 1); }\n\n  template <class T> bool operator==(ImagN<T>) const { return true; }\n\n  template <class T> bool operator==(const T &) const { return false; }\n};\n\nstruct Sign : Function<int_<31>, 1, 1>, FunctionCommon<Sign> {\n  using FunctionCommon<Sign>::operator();\n  static const bool stateless = true;\n  \/\/ The sign of a complex number isn't even defined\n  static const ComplexOutputBehaviour complex_output = NeverComplex;\n\n  template <class T> auto eval(T t) const { return std::copysign(1, t); }\n\n  template <class T> bool operator==(T) const {\n    return std::is_same<T, Sign>::value;\n  }\n};\n\nstruct Conjugate : Function<int_<32>, 1, 1>, FunctionCommon<Conjugate> {\n  using FunctionCommon<Conjugate>::operator();\n  static const bool stateless = true;\n  static const ComplexOutputBehaviour complex_output = SameAsInput;\n\n  template <class T> auto eval(T t) const { return T(real(t), -imag(t)); }\n\n  template <class T> bool operator==(T) const {\n    return std::is_same<Conjugate, T>::value;\n  }\n};\n\nstatic const ImagN<std::complex<double> > I = ImagN<std::complex<double> >();\n}\n\n#endif\n<commit_msg>Added precondition comment<commit_after>#ifndef MANIFOLDS_FUNCTIONS_COMPLEX_HH\n#define MANIFOLDS_FUNCTIONS_COMPLEX_HH\n\n#include <utility>\n#include <complex>\n#include \"tmp_utils.hh\"\n#include \"function.hh\"\n#include \"full_function_defs.hh\"\n\nnamespace manifolds {\n\nstruct Real : Function<int_<27>, 1, 1>, FunctionCommon<Real> {\n  using FunctionCommon<Real>::operator();\n  static const bool stateless = true;\n  static const ComplexOutputBehaviour complex_output = NeverComplex;\n\n  template <class T> auto eval(T t) const {\n    using std::real;\n    return real(t);\n  }\n\n  template <class T> bool operator==(const T &) const {\n    return std::is_same<Real, T>::value;\n  }\n};\n\nstruct Imag : Function<int_<28>, 1, 1>, FunctionCommon<Imag> {\n  using FunctionCommon<Imag>::operator();\n  static const bool stateless = true;\n  static const ComplexOutputBehaviour complex_output = NeverComplex;\n\n  template <class T> auto eval(T t) const {\n    using std::imag;\n    return imag(t);\n  }\n\n  template <class T> bool operator==(const T &) const {\n    return std::is_same<Imag, T>::value;\n  }\n};\n\nstruct Phase : Function<int_<28>, 1, 1>, FunctionCommon<Phase> {\n  using FunctionCommon<Phase>::operator();\n  static const bool stateless = true;\n  static const ComplexOutputBehaviour complex_output = NeverComplex;\n  template <class T> auto eval(T t) const {\n    using std::arg;\n    return arg(t);\n  }\n\n  template <class T> bool operator==(const T &) const {\n    return std::is_same<Phase, T>::value;\n  }\n};\n\nusing Arg = Phase;\n\nstruct Norm : Function<int_<29>, 1, 1>, FunctionCommon<Norm> {\n  using FunctionCommon<Norm>::operator();\n  static const bool stateless = true;\n  static const ComplexOutputBehaviour complex_output = NeverComplex;\n\n  template <class T> auto eval(T t) const -> decltype(norm(t)) {\n    return norm(t);\n  }\n\n  template <class T> bool operator==(const T &) const {\n    return std::is_same<Norm, T>::value;\n  }\n\n  template <class T,\n            class = typename std::enable_if<!is_complex<T>::value>::type>\n  auto eval(T t) const {\n    return t * t;\n  }\n};\n\ntemplate <class Complex>\nstruct ImagN : Function<int_<30>, 0, 1>, FunctionCommon<ImagN<Complex> > {\n  using FunctionCommon<ImagN>::operator();\n  static const bool stateless = true;\n  static const ComplexOutputBehaviour complex_output = NeverComplex;\n\n  template <class... Args> auto eval(Args...) const { return Complex(0, 1); }\n\n  template <class T> bool operator==(ImagN<T>) const { return true; }\n\n  template <class T> bool operator==(const T &) const { return false; }\n};\n\n\/*\n * Note that the Sign of 0 will be undefined,\n * but you won't actually get NaN as a result of trying it.\n *\/\nstruct Sign : Function<int_<31>, 1, 1>, FunctionCommon<Sign> {\n  using FunctionCommon<Sign>::operator();\n  static const bool stateless = true;\n  \/\/ The sign of a complex number isn't even defined\n  static const ComplexOutputBehaviour complex_output = NeverComplex;\n\n  template <class T> auto eval(T t) const { return std::copysign(1, t); }\n\n  template <class T> bool operator==(T) const {\n    return std::is_same<T, Sign>::value;\n  }\n};\n\nstruct Conjugate : Function<int_<32>, 1, 1>, FunctionCommon<Conjugate> {\n  using FunctionCommon<Conjugate>::operator();\n  static const bool stateless = true;\n  static const ComplexOutputBehaviour complex_output = SameAsInput;\n\n  template <class T> auto eval(T t) const { return T(real(t), -imag(t)); }\n\n  template <class T> bool operator==(T) const {\n    return std::is_same<Conjugate, T>::value;\n  }\n};\n\nstatic const ImagN<std::complex<double> > I = ImagN<std::complex<double> >();\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"ToyFactory\/ToyFactoryStd\/ToyFactoryStd.h\"\n\n\/\/ from RooFit\n#include \"RooDataSet.h\"\n\n\/\/ from Project\n#include \"Config\/CommonConfig.h\"\n#include \"ToyFactory\/ToyFactoryStd\/ToyFactoryStdConfig.h\"\n\nusing namespace ROOT;\nusing namespace RooFit;\n\nToyFactoryStd::ToyFactoryStd(const CommonConfig& cfg_com, const ToyFactoryStdConfig& cfg_tfac) :\nconfig_common_(cfg_com),\nconfig_toyfactory_(cfg_tfac)\n{\n  \n}\n\nToyFactoryStd::~ToyFactoryStd(){\n  \n}\n\nToyFactoryStd::Generate() {\n  \n}<commit_msg>ToyFactoryStd:    * bugfix in aforementioned stub<commit_after>#include \"ToyFactory\/ToyFactoryStd\/ToyFactoryStd.h\"\n\n\/\/ from RooFit\n#include \"RooDataSet.h\"\n\n\/\/ from Project\n#include \"Config\/CommonConfig.h\"\n#include \"ToyFactory\/ToyFactoryStd\/ToyFactoryStdConfig.h\"\n\nusing namespace ROOT;\nusing namespace RooFit;\n\nToyFactoryStd::ToyFactoryStd(const CommonConfig& cfg_com, const ToyFactoryStdConfig& cfg_tfac) :\nconfig_common_(cfg_com),\nconfig_toyfactory_(cfg_tfac)\n{\n  \n}\n\nToyFactoryStd::~ToyFactoryStd(){\n  \n}\n\nRooDataSet* ToyFactoryStd::Generate() {\n  \n}<|endoftext|>"}
{"text":"<commit_before><commit_msg>cut the global mutex in EventBase<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2018 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_ACTION__EXCEPTIONS_HPP_\n#define RCLCPP_ACTION__EXCEPTIONS_HPP_\n\n#include <stdexcept>\n\nnamespace rclcpp_action\n{\nnamespace exceptions\n{\nclass UnknownGoalHandleError : public std::invalid_argument\n{\npublic:\n  UnknownGoalHandleError()\n  : std::invalid_argument(\"Goal handle is not know to this client.\")\n  {\n  }\n};\n\nclass UnawareGoalHandleError : public std::runtime_error\n{\npublic:\n  UnawareGoalHandleError()\n  : std::runtime_error(\"Goal handle is not tracking the goal result.\")\n  {\n  }\n};\n\n}  \/\/ namespace exceptions\n\n}  \/\/ namespace rclcpp_action\n\n#endif  \/\/ RCLCPP_ACTION__EXCEPTIONS_HPP_\n<commit_msg>Fix UnknownGoalHandle error string. (#856)<commit_after>\/\/ Copyright 2018 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_ACTION__EXCEPTIONS_HPP_\n#define RCLCPP_ACTION__EXCEPTIONS_HPP_\n\n#include <stdexcept>\n\nnamespace rclcpp_action\n{\nnamespace exceptions\n{\nclass UnknownGoalHandleError : public std::invalid_argument\n{\npublic:\n  UnknownGoalHandleError()\n  : std::invalid_argument(\"Goal handle is not known to this client.\")\n  {\n  }\n};\n\nclass UnawareGoalHandleError : public std::runtime_error\n{\npublic:\n  UnawareGoalHandleError()\n  : std::runtime_error(\"Goal handle is not tracking the goal result.\")\n  {\n  }\n};\n\n}  \/\/ namespace exceptions\n\n}  \/\/ namespace rclcpp_action\n\n#endif  \/\/ RCLCPP_ACTION__EXCEPTIONS_HPP_\n<|endoftext|>"}
{"text":"<commit_before>#include \"abstractfriendshipidsmodel.h\"\n\n#include <QtCore\/QTimer>\n\nclass AbstractFriendshipIdsModel::Private\n{\npublic:\n    Private();\n\n    QString userId;\n    QString screenName;\n    QString cursor;\n    bool stringifyIds;\n\n    int nextCursor;\n    QString nextCursorStr;\n    int previousCursor;\n    QString previousCursorStr;\n\n    QTimer timer;\n};\n\nAbstractFriendshipIdsModel::Private::Private()\n    : stringifyIds(true)\n    , nextCursor(0)\n    , previousCursor(0)\n{\n}\n\nAbstractFriendshipIdsModel::AbstractFriendshipIdsModel(QObject *parent)\n    : AbstractTwitterModel(parent)\n    , d(new Private)\n{\n    QHash<int, QByteArray> roles;\n    roles[IdRole] = \"id\";\n    roles[IdStrRole] = \"id_str\";\n    setRoleNames(roles);\n\n    connect(&d->timer, SIGNAL(timeout()), this, SLOT(reload()));\n    d->timer.setSingleShot(true);\n    d->timer.setInterval(0);\n\n    connect(this, SIGNAL(userIdChanged(QString)), &d->timer, SLOT(start()));\n    connect(this, SIGNAL(screenNameChanged(QString)), &d->timer, SLOT(start()));\n}\n\nAbstractFriendshipIdsModel::~AbstractFriendshipIdsModel()\n{\n    delete d;\n}\n\nvoid AbstractFriendshipIdsModel::reload() {\n    if (!userId().isEmpty() || !screenName().isEmpty()) {\n        AbstractTwitterModel::reload();\n    }\n}\n\nvoid AbstractFriendshipIdsModel::parseDone(const QVariant &data)\n{\n    DEBUG() << data;\n    if (data.type() == QVariant::Map) {\n        QVariantMap object = data.toMap();\n        if (object.contains(\"ids\") && object.value(\"ids\").type() == QVariant::List) {\n            QVariantList results = object.value(\"ids\").toList();\n            foreach (const QVariant &result, results) {\n                QVariantMap map;\n                switch(result.type()) {\n                case QVariant::Int:\n                    map.insert(\"id\", result);\n                    addData(map);\n                    break;\n                case QVariant::String:\n                    map.insert(\"id_str\", result);\n                    addData(map);\n                    break;\n                default:\n                    break;\n                }\n            }\n        } else {\n            DEBUG() << data;\n        }\n        if (object.contains(\"next_cursor\"))\n            setNextCursor(object.value(\"next_cursor\").toInt());\n        if (object.contains(\"next_cursor_str\"))\n            setNextCursorStr(object.value(\"next_cursor_str\").toString());\n        if (object.contains(\"previous_cursor\"))\n            setPreviousCursor(object.value(\"previous_cursor\").toInt());\n        if (object.contains(\"previous_cursor_str\"))\n            setPreviousCursorStr(object.value(\"previous_cursor_str\").toString());\n    }\n}\n\nconst QString &AbstractFriendshipIdsModel::userId() const\n{\n    return d->userId;\n}\n\nvoid AbstractFriendshipIdsModel::setUserId(const QString &userId)\n{\n    if (d->userId == userId) return;\n    d->userId = userId;\n    emit userIdChanged(userId);\n}\n\nconst QString &AbstractFriendshipIdsModel::screenName() const\n{\n    return d->screenName;\n}\n\nvoid AbstractFriendshipIdsModel::setScreenName(const QString &screenName)\n{\n    if (d->screenName == screenName) return;\n    d->screenName = screenName;\n    emit screenNameChanged(screenName);\n}\n\nconst QString &AbstractFriendshipIdsModel::cursor() const\n{\n    return d->cursor;\n}\n\nvoid AbstractFriendshipIdsModel::setCursor(const QString &cursor)\n{\n    if (d->cursor == cursor) return;\n    d->cursor = cursor;\n    emit cursorChanged(cursor);\n}\n\nbool AbstractFriendshipIdsModel::stringifyIds() const\n{\n    return d->stringifyIds;\n}\n\nvoid AbstractFriendshipIdsModel::setStringifyIds(bool stringifyIds)\n{\n    if (d->stringifyIds == stringifyIds) return;\n    d->stringifyIds = stringifyIds;\n    emit stringifyIdsChanged(stringifyIds);\n}\n\nint AbstractFriendshipIdsModel::nextCursor() const\n{\n    return d->nextCursor;\n}\n\nvoid AbstractFriendshipIdsModel::setNextCursor(int nextCursor)\n{\n    if (d->nextCursor == nextCursor) return;\n    d->nextCursor = nextCursor;\n    emit nextCursorChanged(nextCursor);\n}\n\nconst QString &AbstractFriendshipIdsModel::nextCursorStr() const\n{\n    return d->nextCursorStr;\n}\n\nvoid AbstractFriendshipIdsModel::setNextCursorStr(const QString &nextCursorStr)\n{\n    if (d->nextCursorStr == nextCursorStr) return;\n    d->nextCursorStr = nextCursorStr;\n    emit nextCursorStrChanged(nextCursorStr);\n}\n\nint AbstractFriendshipIdsModel::previousCursor() const\n{\n    return d->previousCursor;\n}\n\nvoid AbstractFriendshipIdsModel::setPreviousCursor(int previousCursor)\n{\n    if (d->previousCursor == previousCursor) return;\n    d->previousCursor = previousCursor;\n    emit previousCursorChanged(previousCursor);\n}\n\nconst QString &AbstractFriendshipIdsModel::previousCursorStr() const\n{\n    return d->previousCursorStr;\n}\n\nvoid AbstractFriendshipIdsModel::setPreviousCursorStr(const QString &previousCursorStr)\n{\n    if (d->previousCursorStr == previousCursorStr) return;\n    d->previousCursorStr = previousCursorStr;\n    emit previousCursorStrChanged(previousCursorStr);\n}\n<commit_msg>remove debug message in AbstractFriendshipIdsModel<commit_after>#include \"abstractfriendshipidsmodel.h\"\n\n#include <QtCore\/QTimer>\n\nclass AbstractFriendshipIdsModel::Private\n{\npublic:\n    Private();\n\n    QString userId;\n    QString screenName;\n    QString cursor;\n    bool stringifyIds;\n\n    int nextCursor;\n    QString nextCursorStr;\n    int previousCursor;\n    QString previousCursorStr;\n\n    QTimer timer;\n};\n\nAbstractFriendshipIdsModel::Private::Private()\n    : stringifyIds(true)\n    , nextCursor(0)\n    , previousCursor(0)\n{\n}\n\nAbstractFriendshipIdsModel::AbstractFriendshipIdsModel(QObject *parent)\n    : AbstractTwitterModel(parent)\n    , d(new Private)\n{\n    QHash<int, QByteArray> roles;\n    roles[IdRole] = \"id\";\n    roles[IdStrRole] = \"id_str\";\n    setRoleNames(roles);\n\n    connect(&d->timer, SIGNAL(timeout()), this, SLOT(reload()));\n    d->timer.setSingleShot(true);\n    d->timer.setInterval(0);\n\n    connect(this, SIGNAL(userIdChanged(QString)), &d->timer, SLOT(start()));\n    connect(this, SIGNAL(screenNameChanged(QString)), &d->timer, SLOT(start()));\n}\n\nAbstractFriendshipIdsModel::~AbstractFriendshipIdsModel()\n{\n    delete d;\n}\n\nvoid AbstractFriendshipIdsModel::reload() {\n    if (!userId().isEmpty() || !screenName().isEmpty()) {\n        AbstractTwitterModel::reload();\n    }\n}\n\nvoid AbstractFriendshipIdsModel::parseDone(const QVariant &data)\n{\n\/\/    DEBUG() << data;\n    if (data.type() == QVariant::Map) {\n        QVariantMap object = data.toMap();\n        if (object.contains(\"ids\") && object.value(\"ids\").type() == QVariant::List) {\n            QVariantList results = object.value(\"ids\").toList();\n            foreach (const QVariant &result, results) {\n                QVariantMap map;\n                switch(result.type()) {\n                case QVariant::Int:\n                    map.insert(\"id\", result);\n                    addData(map);\n                    break;\n                case QVariant::String:\n                    map.insert(\"id_str\", result);\n                    addData(map);\n                    break;\n                default:\n                    break;\n                }\n            }\n        } else {\n            DEBUG() << data;\n        }\n        if (object.contains(\"next_cursor\"))\n            setNextCursor(object.value(\"next_cursor\").toInt());\n        if (object.contains(\"next_cursor_str\"))\n            setNextCursorStr(object.value(\"next_cursor_str\").toString());\n        if (object.contains(\"previous_cursor\"))\n            setPreviousCursor(object.value(\"previous_cursor\").toInt());\n        if (object.contains(\"previous_cursor_str\"))\n            setPreviousCursorStr(object.value(\"previous_cursor_str\").toString());\n    }\n}\n\nconst QString &AbstractFriendshipIdsModel::userId() const\n{\n    return d->userId;\n}\n\nvoid AbstractFriendshipIdsModel::setUserId(const QString &userId)\n{\n    if (d->userId == userId) return;\n    d->userId = userId;\n    emit userIdChanged(userId);\n}\n\nconst QString &AbstractFriendshipIdsModel::screenName() const\n{\n    return d->screenName;\n}\n\nvoid AbstractFriendshipIdsModel::setScreenName(const QString &screenName)\n{\n    if (d->screenName == screenName) return;\n    d->screenName = screenName;\n    emit screenNameChanged(screenName);\n}\n\nconst QString &AbstractFriendshipIdsModel::cursor() const\n{\n    return d->cursor;\n}\n\nvoid AbstractFriendshipIdsModel::setCursor(const QString &cursor)\n{\n    if (d->cursor == cursor) return;\n    d->cursor = cursor;\n    emit cursorChanged(cursor);\n}\n\nbool AbstractFriendshipIdsModel::stringifyIds() const\n{\n    return d->stringifyIds;\n}\n\nvoid AbstractFriendshipIdsModel::setStringifyIds(bool stringifyIds)\n{\n    if (d->stringifyIds == stringifyIds) return;\n    d->stringifyIds = stringifyIds;\n    emit stringifyIdsChanged(stringifyIds);\n}\n\nint AbstractFriendshipIdsModel::nextCursor() const\n{\n    return d->nextCursor;\n}\n\nvoid AbstractFriendshipIdsModel::setNextCursor(int nextCursor)\n{\n    if (d->nextCursor == nextCursor) return;\n    d->nextCursor = nextCursor;\n    emit nextCursorChanged(nextCursor);\n}\n\nconst QString &AbstractFriendshipIdsModel::nextCursorStr() const\n{\n    return d->nextCursorStr;\n}\n\nvoid AbstractFriendshipIdsModel::setNextCursorStr(const QString &nextCursorStr)\n{\n    if (d->nextCursorStr == nextCursorStr) return;\n    d->nextCursorStr = nextCursorStr;\n    emit nextCursorStrChanged(nextCursorStr);\n}\n\nint AbstractFriendshipIdsModel::previousCursor() const\n{\n    return d->previousCursor;\n}\n\nvoid AbstractFriendshipIdsModel::setPreviousCursor(int previousCursor)\n{\n    if (d->previousCursor == previousCursor) return;\n    d->previousCursor = previousCursor;\n    emit previousCursorChanged(previousCursor);\n}\n\nconst QString &AbstractFriendshipIdsModel::previousCursorStr() const\n{\n    return d->previousCursorStr;\n}\n\nvoid AbstractFriendshipIdsModel::setPreviousCursorStr(const QString &previousCursorStr)\n{\n    if (d->previousCursorStr == previousCursorStr) return;\n    d->previousCursorStr = previousCursorStr;\n    emit previousCursorStrChanged(previousCursorStr);\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          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<commit_msg>Fix type error in VectorRealToTensor when compiling with Clang<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\n    \/\/ Explicit convertion of std:vector to std::array<Eigen::Index> for Clang.\n    std::array<Eigen::Index, 4> shapeEigenIndex;\n    std::copy_n(shape.begin(), 4, shapeEigenIndex.begin());\n\n    tensor.resize(shapeEigenIndex);\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>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/generic\/memory\/lib\/spd\/spd_traits.H $              *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2018,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 spd_traits.H\n\/\/\/ @brief Declaration for assocated traits to reading SPD\n\/\/\/\n\n\/\/ *HWP HWP Owner: Andre Marin <aamarin@us.ibm.com>\n\/\/ *HWP HWP Backup: Stephen Glancy <sglancy@us.ibm.com>\n\/\/ *HWP Team: Memory\n\/\/ *HWP Level: 2\n\/\/ *HWP Consumed by: HB:FSP\n\n#ifndef _MSS_SPD_READER_TRAITS_H_\n#define _MSS_SPD_READER_TRAITS_H_\n\n#include <cstdint>\n#include <functional>\n#include <generic\/memory\/lib\/spd\/spd_field.H>\n\nnamespace mss\n{\nnamespace spd\n{\n\n\/\/\/\n\/\/\/ @brief Checks SPD input field against a custom conditional\n\/\/\/ @tparam T SPD field input type\n\/\/\/ @tparam F Callable object type\n\/\/\/ @param[in] i_spd_field Extracted SPD field\n\/\/\/ @param[in] i_comparison_val value we are comparing against\n\/\/\/ @param[in] i_op comparison operator function object\n\/\/\/ @return boolean true or false\n\/\/\/\ntemplate < typename T, typename F >\nbool conditional(const T i_spd_field,\n                 const size_t i_comparison_val,\n                 const F i_op)\n{\n    return i_op(i_spd_field, i_comparison_val);\n}\n\n\/\/\/\n\/\/\/ @class readerTraits\n\/\/\/ @brief trait structure to hold static SPD information\n\/\/\/ @tparam F holds SPD field info\n\/\/\/ @tparam R the revision of the SPD field\n\/\/\/ @tparam B boolean required to activate trait class - defaulted to true_type\n\/\/\/\ntemplate< const field_t& F, rev R, typename B = std::true_type >\nclass readerTraits;\n\n\/\/\/\n\/\/\/ @class readerTraits\n\/\/\/ @brief trait structure to hold static SPD information\n\/\/\/ @tparam R the revision of the SPD field\n\/\/\/ @note REVISION field specialization\n\/\/\/ @note valid for all revs\n\/\/\/\ntemplate< rev R >\nclass readerTraits < init_fields::REVISION, R >\n{\n    public:\n\n        static constexpr size_t COMPARISON_VAL = 0xFF;\n        static constexpr const char* FIELD_STR = \"SPD Revision\";\n\n        template <typename T>\n        using COMPARISON_OP = std::less_equal<T>;\n};\n\n\/\/\/\n\/\/\/ @class readerTraits\n\/\/\/ @brief trait structure to hold static SPD information\n\/\/\/ @tparam R the revision of the SPD field\n\/\/\/ @note DEVICE_TYPE field specialization\n\/\/\/ @note valid for all revs\n\/\/\/\ntemplate< rev R >\nclass readerTraits< init_fields::DEVICE_TYPE, R >\n{\n    public:\n\n        static constexpr size_t COMPARISON_VAL = 0x11; \/\/\/< Largest valid SPD encoding\n        static constexpr const char* FIELD_STR = \"DRAM Device Type\";\n\n        template <typename T>\n        using COMPARISON_OP = std::less_equal<T>;\n};\n\n\/\/\/\n\/\/\/ @class readerTraits\n\/\/\/ @brief trait structure to hold static SPD information\n\/\/\/ @tparam R the revision of the SPD field\n\/\/\/ @note BASE_MODULE field specialization\n\/\/\/ @note valid for all revs\n\/\/\/\ntemplate< rev R >\nclass readerTraits < init_fields::BASE_MODULE, R >\n{\n    public:\n\n        static constexpr size_t COMPARISON_VAL = 0b1101;\n        static constexpr const char* FIELD_STR = \"Base Module\";\n\n        template <typename T>\n        using COMPARISON_OP = std::less_equal<T>;\n};\n\n\/\/\/\n\/\/\/ @class readerTraits\n\/\/\/ @brief trait structure to hold static SPD information\n\/\/\/ @note HYBRID field specialization\n\/\/\/ @note valid for all revs\n\/\/\/\ntemplate< rev R >\nclass readerTraits< init_fields::HYBRID, R >\n{\n    public:\n\n        static constexpr size_t COMPARISON_VAL = 1;\n        static constexpr const char* FIELD_STR = \"Hybrid\";\n\n        template <typename T>\n        using COMPARISON_OP = std::less_equal<T>;\n};\n\n\/\/\/\n\/\/\/ @class readerTraits\n\/\/\/ @brief trait structure to hold static SPD information\n\/\/\/ @note HYBRID_MEDIA field specialization\n\/\/\/ @note valid for all revs\n\/\/\/\ntemplate< rev R >\nclass readerTraits< init_fields::HYBRID_MEDIA, R >\n{\n    public:\n\n        static constexpr size_t COMPARISON_VAL = 1;\n        static constexpr const char* FIELD_STR = \"Hybrid Media\";\n\n        template <typename T>\n        using COMPARISON_OP = std::less_equal<T>;\n};\n\n\/\/\/ @class readerTraits\n\/\/\/ @brief trait structure to hold static SPD information\n\/\/\/ @note REF_RAW_CARD field specialization\n\/\/\/ @note valid for all revs\n\/\/\/\ntemplate< rev R >\nclass readerTraits< init_fields::REF_RAW_CARD, R >\n{\n    public:\n\n        static constexpr size_t COMPARISON_VAL = 1;\n        static constexpr const char* FIELD_STR = \"Reference Raw Card\";\n\n        template <typename T>\n        using COMPARISON_OP = std::less_equal<T>;\n};\n\n}\/\/ spd\n}\/\/ mss\n\n#endif \/\/_MSS_SPD_READER_TRAITS_H_\n<commit_msg>Remove Nimbus dependencies from the SPD decoder<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/generic\/memory\/lib\/spd\/spd_traits.H $              *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2018,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 spd_traits.H\n\/\/\/ @brief Declaration for assocated traits to reading SPD\n\/\/\/\n\n\/\/ *HWP HWP Owner: Andre Marin <aamarin@us.ibm.com>\n\/\/ *HWP HWP Backup: Stephen Glancy <sglancy@us.ibm.com>\n\/\/ *HWP Team: Memory\n\/\/ *HWP Level: 2\n\/\/ *HWP Consumed by: HB:FSP\n\n#ifndef _MSS_SPD_READER_TRAITS_H_\n#define _MSS_SPD_READER_TRAITS_H_\n\n#include <cstdint>\n#include <functional>\n#include <generic\/memory\/lib\/spd\/spd_field.H>\n\nnamespace mss\n{\nnamespace spd\n{\n\n\/\/\/\n\/\/\/ @brief Checks SPD input field against a custom conditional\n\/\/\/ @tparam T SPD field input type\n\/\/\/ @tparam F Callable object type\n\/\/\/ @param[in] i_spd_field Extracted SPD field\n\/\/\/ @param[in] i_comparison_val value we are comparing against\n\/\/\/ @param[in] i_op comparison operator function object\n\/\/\/ @return boolean true or false\n\/\/\/\ntemplate < typename T, typename F >\nbool conditional(const T i_spd_field,\n                 const size_t i_comparison_val,\n                 const F i_op)\n{\n    return i_op(i_spd_field, i_comparison_val);\n}\n\n\/\/\/\n\/\/\/ @class readerTraits\n\/\/\/ @brief trait structure to hold static SPD information\n\/\/\/ @tparam F holds SPD field info\n\/\/\/ @tparam R the revision of the SPD field\n\/\/\/\ntemplate< const field_t& F, rev R >\nclass readerTraits;\n\n\/\/\/\n\/\/\/ @class readerTraits\n\/\/\/ @brief trait structure to hold static SPD information\n\/\/\/ @tparam R the revision of the SPD field\n\/\/\/ @note REVISION field specialization\n\/\/\/ @note valid for all revs\n\/\/\/\ntemplate< rev R >\nclass readerTraits < init_fields::REVISION, R >\n{\n    public:\n\n        static constexpr size_t COMPARISON_VAL = 0xFF;\n        static constexpr const char* FIELD_STR = \"SPD Revision\";\n\n        template <typename T>\n        using COMPARISON_OP = std::less_equal<T>;\n};\n\n\/\/\/\n\/\/\/ @class readerTraits\n\/\/\/ @brief trait structure to hold static SPD information\n\/\/\/ @tparam R the revision of the SPD field\n\/\/\/ @note DEVICE_TYPE field specialization\n\/\/\/ @note valid for all revs\n\/\/\/\ntemplate< rev R >\nclass readerTraits< init_fields::DEVICE_TYPE, R >\n{\n    public:\n\n        static constexpr size_t COMPARISON_VAL = 0x11; \/\/\/< Largest valid SPD encoding\n        static constexpr const char* FIELD_STR = \"DRAM Device Type\";\n\n        template <typename T>\n        using COMPARISON_OP = std::less_equal<T>;\n};\n\n\/\/\/\n\/\/\/ @class readerTraits\n\/\/\/ @brief trait structure to hold static SPD information\n\/\/\/ @tparam R the revision of the SPD field\n\/\/\/ @note BASE_MODULE field specialization\n\/\/\/ @note valid for all revs\n\/\/\/\ntemplate< rev R >\nclass readerTraits < init_fields::BASE_MODULE, R >\n{\n    public:\n\n        static constexpr size_t COMPARISON_VAL = 0b1101;\n        static constexpr const char* FIELD_STR = \"Base Module\";\n\n        template <typename T>\n        using COMPARISON_OP = std::less_equal<T>;\n};\n\n\/\/\/\n\/\/\/ @class readerTraits\n\/\/\/ @brief trait structure to hold static SPD information\n\/\/\/ @note HYBRID field specialization\n\/\/\/ @note valid for all revs\n\/\/\/\ntemplate< rev R >\nclass readerTraits< init_fields::HYBRID, R >\n{\n    public:\n\n        static constexpr size_t COMPARISON_VAL = 1;\n        static constexpr const char* FIELD_STR = \"Hybrid\";\n\n        template <typename T>\n        using COMPARISON_OP = std::less_equal<T>;\n};\n\n\/\/\/\n\/\/\/ @class readerTraits\n\/\/\/ @brief trait structure to hold static SPD information\n\/\/\/ @note HYBRID_MEDIA field specialization\n\/\/\/ @note valid for all revs\n\/\/\/\ntemplate< rev R >\nclass readerTraits< init_fields::HYBRID_MEDIA, R >\n{\n    public:\n\n        static constexpr size_t COMPARISON_VAL = 1;\n        static constexpr const char* FIELD_STR = \"Hybrid Media\";\n\n        template <typename T>\n        using COMPARISON_OP = std::less_equal<T>;\n};\n\n\/\/\/ @class readerTraits\n\/\/\/ @brief trait structure to hold static SPD information\n\/\/\/ @note REF_RAW_CARD field specialization\n\/\/\/ @note valid for all revs\n\/\/\/\ntemplate< rev R >\nclass readerTraits< init_fields::REF_RAW_CARD, R >\n{\n    public:\n\n        static constexpr size_t COMPARISON_VAL = 1;\n        static constexpr const char* FIELD_STR = \"Reference Raw Card\";\n\n        template <typename T>\n        using COMPARISON_OP = std::less_equal<T>;\n};\n\n}\/\/ spd\n}\/\/ mss\n\n#endif \/\/_MSS_SPD_READER_TRAITS_H_\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 <string>\n\n#include \"base\/basictypes.h\"\n#include \"remoting\/base\/constants.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\n\/\/ X11 headers must be #included after gtest.h, since the X11 headers define\n\/\/ some macros that cause errors in gtest-type-util.h.\n#include <X11\/Xlib.h>\n#include \"remoting\/host\/linux\/x_server_clipboard.h\"\n\nnamespace remoting {\n\nnamespace {\n\nclass ClipboardTestClient {\n public:\n  ClipboardTestClient() : display_(NULL) {}\n  ~ClipboardTestClient() {}\n\n  void Init(Display* display) {\n    display_ = display;\n    clipboard_.Init(display,\n                    base::Bind(&ClipboardTestClient::OnClipboardChanged,\n                               base::Unretained(this)));\n  }\n\n  void SetClipboardData(const std::string& clipboard_data) {\n    clipboard_data_ = clipboard_data;\n    clipboard_.SetClipboard(kMimeTypeTextUtf8, clipboard_data);\n  }\n\n  void OnClipboardChanged(const std::string& mime_type,\n                          const std::string& data) {\n    clipboard_data_ = data;\n  }\n\n  \/\/ Process X events on the connection, returning true if any events were\n  \/\/ processed.\n  bool PumpXEvents() {\n    bool result = false;\n    while (XPending(display_)) {\n      XEvent event;\n      XNextEvent(display_, &event);\n      clipboard_.ProcessXEvent(&event);\n      result = true;\n    }\n    return result;\n  }\n\n  const std::string& clipboard_data() const { return clipboard_data_; }\n  Display* display() const { return display_; }\n\n private:\n  std::string clipboard_data_;\n  XServerClipboard clipboard_;\n  Display* display_;\n\n  DISALLOW_COPY_AND_ASSIGN(ClipboardTestClient);\n};\n\n}  \/\/ namespace\n\nclass XServerClipboardTest : public testing::Test {\n public:\n  virtual void SetUp() OVERRIDE {\n    \/\/ XSynchronize() ensures that PumpXEvents() fully processes all X server\n    \/\/ requests and responses before returning to the caller.\n    Display* display1 = XOpenDisplay(NULL);\n    XSynchronize(display1, True);\n    client1_.Init(display1);\n    Display* display2 = XOpenDisplay(NULL);\n    XSynchronize(display2, True);\n    client2_.Init(display2);\n  }\n\n  virtual void TearDown() OVERRIDE {\n    XCloseDisplay(client1_.display());\n    XCloseDisplay(client2_.display());\n  }\n\n  void PumpXEvents() {\n    while (true) {\n      if (!client1_.PumpXEvents() && !client2_.PumpXEvents()) {\n        break;\n      }\n    }\n  }\n\n  ClipboardTestClient client1_;\n  ClipboardTestClient client2_;\n};\n\nTEST_F(XServerClipboardTest, CopyPaste) {\n  \/\/ Verify clipboard data can be transferred more than once. Then verify that\n  \/\/ the code continues to function in the opposite direction (so client1_ will\n  \/\/ send then receive, and client2_ will receive then send).\n  client1_.SetClipboardData(\"Text1\");\n  PumpXEvents();\n  EXPECT_EQ(\"Text1\", client2_.clipboard_data());\n\n  client1_.SetClipboardData(\"Text2\");\n  PumpXEvents();\n  EXPECT_EQ(\"Text2\", client2_.clipboard_data());\n\n  client2_.SetClipboardData(\"Text3\");\n  PumpXEvents();\n  EXPECT_EQ(\"Text3\", client1_.clipboard_data());\n\n  client2_.SetClipboardData(\"Text4\");\n  PumpXEvents();\n  EXPECT_EQ(\"Text4\", client1_.clipboard_data());\n}\n\n}  \/\/ namespace remoting\n<commit_msg>disable unittest XServerClipboardTest.CopyPaste<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 <string>\n\n#include \"base\/basictypes.h\"\n#include \"remoting\/base\/constants.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\n\/\/ X11 headers must be #included after gtest.h, since the X11 headers define\n\/\/ some macros that cause errors in gtest-type-util.h.\n#include <X11\/Xlib.h>\n#include \"remoting\/host\/linux\/x_server_clipboard.h\"\n\nnamespace remoting {\n\nnamespace {\n\nclass ClipboardTestClient {\n public:\n  ClipboardTestClient() : display_(NULL) {}\n  ~ClipboardTestClient() {}\n\n  void Init(Display* display) {\n    display_ = display;\n    clipboard_.Init(display,\n                    base::Bind(&ClipboardTestClient::OnClipboardChanged,\n                               base::Unretained(this)));\n  }\n\n  void SetClipboardData(const std::string& clipboard_data) {\n    clipboard_data_ = clipboard_data;\n    clipboard_.SetClipboard(kMimeTypeTextUtf8, clipboard_data);\n  }\n\n  void OnClipboardChanged(const std::string& mime_type,\n                          const std::string& data) {\n    clipboard_data_ = data;\n  }\n\n  \/\/ Process X events on the connection, returning true if any events were\n  \/\/ processed.\n  bool PumpXEvents() {\n    bool result = false;\n    while (XPending(display_)) {\n      XEvent event;\n      XNextEvent(display_, &event);\n      clipboard_.ProcessXEvent(&event);\n      result = true;\n    }\n    return result;\n  }\n\n  const std::string& clipboard_data() const { return clipboard_data_; }\n  Display* display() const { return display_; }\n\n private:\n  std::string clipboard_data_;\n  XServerClipboard clipboard_;\n  Display* display_;\n\n  DISALLOW_COPY_AND_ASSIGN(ClipboardTestClient);\n};\n\n}  \/\/ namespace\n\nclass XServerClipboardTest : public testing::Test {\n public:\n  virtual void SetUp() OVERRIDE {\n    \/\/ XSynchronize() ensures that PumpXEvents() fully processes all X server\n    \/\/ requests and responses before returning to the caller.\n    Display* display1 = XOpenDisplay(NULL);\n    XSynchronize(display1, True);\n    client1_.Init(display1);\n    Display* display2 = XOpenDisplay(NULL);\n    XSynchronize(display2, True);\n    client2_.Init(display2);\n  }\n\n  virtual void TearDown() OVERRIDE {\n    XCloseDisplay(client1_.display());\n    XCloseDisplay(client2_.display());\n  }\n\n  void PumpXEvents() {\n    while (true) {\n      if (!client1_.PumpXEvents() && !client2_.PumpXEvents()) {\n        break;\n      }\n    }\n  }\n\n  ClipboardTestClient client1_;\n  ClipboardTestClient client2_;\n};\n\n\/\/ http:\/\/crbug.com\/163428\nTEST_F(XServerClipboardTest, FLAKY_CopyPaste) {\n  \/\/ Verify clipboard data can be transferred more than once. Then verify that\n  \/\/ the code continues to function in the opposite direction (so client1_ will\n  \/\/ send then receive, and client2_ will receive then send).\n  client1_.SetClipboardData(\"Text1\");\n  PumpXEvents();\n  EXPECT_EQ(\"Text1\", client2_.clipboard_data());\n\n  client1_.SetClipboardData(\"Text2\");\n  PumpXEvents();\n  EXPECT_EQ(\"Text2\", client2_.clipboard_data());\n\n  client2_.SetClipboardData(\"Text3\");\n  PumpXEvents();\n  EXPECT_EQ(\"Text3\", client1_.clipboard_data());\n\n  client2_.SetClipboardData(\"Text4\");\n  PumpXEvents();\n  EXPECT_EQ(\"Text4\", client1_.clipboard_data());\n}\n\n}  \/\/ namespace remoting\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\ttemplate <class Container>\n\tinline void Shuffle(Container& c)\n\t{\n\t\tShuffle(std::begin(c), std::end(c), GetDefaultRNG());\n\t}\n\n\ttemplate <class Container, class URBG>\n\tinline void Shuffle(Container& c, URBG&& urbg)\n\t{\n\t\tShuffle(std::begin(c), std::end(c), std::forward<URBG>(urbg));\n\t}\n\n\ttemplate <class RandomIt>\n\tinline void Shuffle(RandomIt first, RandomIt last)\n\t{\n\t\tShuffle(first, last, GetDefaultRNG());\n\t}\n\n\ttemplate <class RandomIt, class URBG>\n\tinline void Shuffle(RandomIt first, RandomIt last, URBG&& urbg)\n\t{\n\t\tif (first == last)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\tusing difference_type = typename std::iterator_traits<RandomIt>::difference_type;\n\n\t\tfor (RandomIt it = first + 1; it < last; ++it)\n\t\t{\n\t\t\tconst uint64 n = static_cast<uint64>(it - first);\n\t\t\tstd::iter_swap(it, first + static_cast<difference_type>(Random<uint64>(0, n, std::forward<URBG>(urbg))));\n\t\t}\n\t}\n}\n<commit_msg>[共通] update Shuffle()<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\ttemplate <class Container>\n\tinline void Shuffle(Container& c)\n\t{\n\t\tShuffle(std::begin(c), std::end(c), GetDefaultRNG());\n\t}\n\n\ttemplate <class Container, class URBG>\n\tinline void Shuffle(Container& c, URBG&& urbg)\n\t{\n\t\tShuffle(std::begin(c), std::end(c), std::forward<URBG>(urbg));\n\t}\n\n\ttemplate <class RandomIt>\n\tinline void Shuffle(RandomIt first, RandomIt last)\n\t{\n\t\tShuffle(first, last, GetDefaultRNG());\n\t}\n\n\ttemplate <class RandomIt, class URBG>\n\tinline void Shuffle(RandomIt first, RandomIt last, URBG&& urbg)\n\t{\n\t\tif (first == last)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\tusing difference_type = typename std::iterator_traits<RandomIt>::difference_type;\n\t\tauto it = first;\n\n\t\tfor (difference_type targetIndex = 1; ++it != last; ++targetIndex)\n\t\t{\n\t\t\tdifference_type offset\n\t\t\t\t= Random(static_cast<difference_type>(targetIndex), std::forward<URBG>(urbg));\n\n\t\t\tif (offset != targetIndex)\n\t\t\t{\n\t\t\t\tstd::iter_swap(it, first + offset);\n\t\t\t}\n\t\t}\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 1998-2014 Epic Games, Inc. All Rights Reserved.\n\n#include \"m2uPluginPrivatePCH.h\"\n#include \"Networking.h\"\n#include \"ActorEditorUtils.h\"\n#include \"UnrealEd.h\"\n\nDEFINE_LOG_CATEGORY( LogM2U )\n\n#define DEFAULT_M2U_ENDPOINT FIPv4Endpoint(FIPv4Address(127,0,0,1), 3939)\n\nIMPLEMENT_MODULE( Fm2uPlugin, m2uPlugin )\n\n\nbool GetActorByName( const TCHAR* Name, AActor* OutActor, UWorld* InWorld);\nvoid ExecuteCommand(const TCHAR* Str);\n\nFm2uPlugin::Fm2uPlugin()\n\t:TcpListener(NULL),\n\t Client(NULL)\n{\n}\n\nvoid Fm2uPlugin::StartupModule()\n{\n    \/\/ This code will execute after your module is loaded into memory (but after global variables are initialized, of course.)\n\tUE_LOG(LogM2U, Log, TEXT(\"starting up m2u\"));\n\tif( !GIsEditor )\n\t{\n\t\treturn;\n\t}\n\n\tTcpListener = new FTcpListener( DEFAULT_M2U_ENDPOINT );\n\tTcpListener->OnConnectionAccepted().BindRaw(this, &Fm2uPlugin::HandleConnectionAccepted);\n\n\tTickObject = new Fm2uTickObject(this);\n\n}\n\n\nvoid Fm2uPlugin::ShutdownModule()\n{\n\n\tTcpListener->Stop();\n\tdelete TcpListener;\n\tTcpListener = NULL;\n\n    \/\/ close all clients\n\tClient->Close();\n\tClient=NULL;\n\n\tdelete TickObject;\n\tTickObject = NULL;\n}\n\nbool Fm2uPlugin::HandleConnectionAccepted( FSocket* ClientSocket, const FIPv4Endpoint& ClientEndpoint)\n{\n\tif(Client==NULL)\n\t{\n\t\tClient = ClientSocket;\n\t\tUE_LOG(LogM2U, Log, TEXT(\"connected on port %i\"),Client->GetPortNo());\n\t\treturn true;\n\t}\n\tUE_LOG(LogM2U, Log, TEXT(\"connection declined\"));\n\treturn false;\n}\n\n\nvoid Fm2uPlugin::Tick( float DeltaTime )\n{\n    \/\/ get data from client\n\tif(Client==NULL)\n\t\treturn;\n\n\tuint32 DataSize = 0;\n\twhile(Client->HasPendingData(DataSize) && DataSize > 0 )\n\t{\n\t\tUE_LOG(LogM2U, Log, TEXT(\"pending data size %i\"), DataSize);\n        \/\/ create data array to read from client\n\t\t\/\/FArrayReaderPtr Data = MakeShareable(new FArrayReader(true));\n\t\tFArrayReader Data;\n\t\tData.Init(DataSize);\n\n\t\tint32 BytesRead = 0;\n        \/\/ read pending data into the Data array reader\n\t\tif( Client->Recv( Data.GetData(), Data.Num(), BytesRead) )\n\t\t{\n\t\t\tUE_LOG(LogM2U, Log, TEXT(\"DataNum %i, BytesRead: %i\"), Data.Num(), BytesRead);\n\n\t\t\t\/\/ the data we receive is supposed to be ansi, but we will work with TCHAR, so we have to convert\n\t\t\tint32 DestLen = TStringConvert<ANSICHAR,TCHAR>::ConvertedLength((char*)(Data.GetData()),Data.Num());\n\t\t\t\/\/UE_LOG(LogM2U, Log, TEXT(\"DestLen will be %i\"), DestLen);\n\t\t\tTCHAR* Dest = new TCHAR[DestLen+1];\n\t\t\tTStringConvert<ANSICHAR,TCHAR>::Convert(Dest, DestLen, (char*)(Data.GetData()), Data.Num());\n\t\t\tDest[DestLen]='\\0';\n\n\t\t\t\/\/FString Text(Dest); \/\/ FString from tchar array\n\t\t\t\/\/UE_LOG(LogM2U, Log, TEXT(\"server received %s\"), *Text);\n\t\t\tUE_LOG(LogM2U, Log, TEXT(\"Server received: %s\"), Dest);\n\n\t\t\tExecuteCommand(Dest);\n\n\t\t\tdelete Dest;\n\t\t}\n\n\t\t\/\/if(\t! Client->Send(Data, Count, BytesSent) )\n\t\t\/\/{\n\t\t\/\/\tUE_LOG(LogM2U, Log, TEXT(\"server sending answer failed\"));\n\t\t\/\/}\n\t}\n}\n\n\/\/void HandleReceivedData(FArrayReader& Data)\n\nbool GetActorByName( const TCHAR* Name, AActor** OutActor, UWorld* InWorld = NULL)\n{\n\tif( InWorld == NULL)\n\t{\n\t\tInWorld = GEditor->GetEditorWorldContext().World();\n\t}\n\tAActor* Actor;\n\t\/\/OutActor = FindObject<AActor>( InWorld->GetCurrentLevel(), Name );\n\tActor = FindObject<AActor>( ANY_PACKAGE, Name, false );\n\tif( Actor == NULL ) \/\/ actor with that name cannot be found\n\t{\n\t\treturn false;\n\t}\n\telse if( ! Actor->IsValidLowLevelFast() )\n\t{\n\t\t\/\/UE_LOG(LogM2U, Log, TEXT(\"Actor is NOT valid\"));\n\t\treturn false;\n\t}\n\telse\n\t{\n\t\t\/\/UE_LOG(LogM2U, Log, TEXT(\"Actor is valid\"));\n\t\t*OutActor=Actor;\n\t\treturn true;\n\t}\n}\n\nvoid ExecuteCommand(const TCHAR* Str)\n{\n\tif( FParse::Command(&Str, TEXT(\"Exec\")))\n\t{\n\t\tGEditor->Exec(GEditor->GetEditorWorldContext().World(), Str);\n\t}\n\telse if( FParse::Command(&Str, TEXT(\"TransformObject\")))\n\t{\n\t\tconst FString ActorName = FParse::Token(Str,0);\n\t\tAActor* Actor = NULL;\n\t\tUE_LOG(LogM2U, Log, TEXT(\"Searching for actor with name %s\"), *ActorName);\n\n\t\tif(!GetActorByName(*ActorName, &Actor) || Actor == NULL)\n\t\t{\n\t\t\tUE_LOG(LogM2U, Log, TEXT(\"Actor %s not found or invalid.\"), *ActorName);\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/UE_LOG(LogM2U, Log, TEXT(\"found actor\"));\n\n\t\tconst TCHAR* Stream = Str;\n\t\tif( Stream != NULL )\n\t\t{\n\t\t\t++Stream;\n\t\t}\n\n\t\t\/\/UE_LOG(LogM2U, Log, TEXT(\"before Loc %s\"), Stream);\n\t\t\/\/ get location\n\t\tFVector Loc;\n\t\tStream = GetFVECTORSpaceDelimited( Stream, Loc );\n\t\t\/\/UE_LOG(LogM2U, Log, TEXT(\"Loc %s\"), *(Loc.ToString()) );\n\t\t\/\/ jump over the space\n\t\tStream = FCString::Strchr(Stream,' ');\n\t\tif( Stream != NULL )\n\t\t{\n\t\t\t++Stream;\n\t\t}\n\t\t\/\/UE_LOG(LogM2U, Log, TEXT(\"before Rot %s\"), Stream);\n\t\t\/\/ get rotation\n\t\tFRotator Rot;\n\t\tStream = GetFROTATORSpaceDelimited( Stream, Rot, 1.0f );\n\t\t\/\/UE_LOG(LogM2U, Log, TEXT(\"Rot %s\"), *(Rot.ToString()) );\n\t\t\/\/ jump over the space\n\t\tStream = FCString::Strchr(Stream,' ');\n\t\tif( Stream != NULL )\n\t\t{\n\t\t\t++Stream;\n\t\t}\n\t\t\/\/UE_LOG(LogM2U, Log, TEXT(\"before Scc %s\"), Stream);\n\t\t\/\/ get scale\n\t\tFVector Scale;\n\t\tStream = GetFVECTORSpaceDelimited( Stream, Scale );\n\t\t\/\/UE_LOG(LogM2U, Log, TEXT(\"Scc %s\"), *(Scale.ToString()) );\n\n\t\tActor->TeleportTo( Loc, Rot, false, true);\n\t\tActor->SetActorScale3D( Scale );\n\t\tActor->InvalidateLightingCache();\n\t\t\/\/ Call PostEditMove to update components, etc.\n\t\tActor->PostEditMove( true );\n\t\tActor->CheckDefaultSubobjects();\n\t\t\/\/ Request saves\/refreshes.\n\t\tActor->MarkPackageDirty();\n\n\t\tGEditor->RedrawLevelEditingViewports();\n\t}\n\telse if( FParse::Command(&Str, TEXT(\"SelectByName\")))\n\t{\n\t\tconst FString ActorName = FParse::Token(Str,0);\n\t\tAActor* Actor = GEditor->SelectNamedActor(*ActorName);\n\t\tGEditor->RedrawLevelEditingViewports();\n\t}\n\telse if( FParse::Command(&Str, TEXT(\"DeselectAll\")))\n\t{\n\t\tGEditor->SelectNone(true, true, false);\n\t\tGEditor->RedrawLevelEditingViewports();\n\t}\n\n\t\/\/ -- VISIBILITY --\n\t\/\/ also see the \"edactHide...\" functions\n\t\/\/ these functions currently do not write to the TransactionBuffer, so won't be undoable\n\telse if( FParse::Command(&Str, TEXT(\"HideSelected\")))\n\t{\n\t\tTArray<AActor*> SelectedActors;\n\t\tUSelection* Selection = GEditor->GetSelectedActors();\n\t\tSelection->Modify();\n\t\tSelection->GetSelectedObjects<AActor>(SelectedActors);\n\n\t\tfor( int32 Idx = 0 ; Idx < SelectedActors.Num() ; ++Idx )\n\t\t{\n\t\t\tAActor* Actor = SelectedActors[ Idx ];\n\t\t\t\/\/ Don't consider already hidden actors or the builder brush\n\t\t\tif( !FActorEditorUtils::IsABuilderBrush(Actor) && !Actor->IsHiddenEd() )\n\t\t\t{\n\t\t\t\tActor->SetIsTemporarilyHiddenInEditor( true );\n\t\t\t}\n\t\t}\n\t\tGEditor->RedrawLevelEditingViewports();\n\t}\n\telse if( FParse::Command(&Str, TEXT(\"UnhideSelected\")))\n\t{\n\t\tTArray<AActor*> SelectedActors;\n\t\tUSelection* Selection = GEditor->GetSelectedActors();\n\t\tSelection->Modify();\n\t\tSelection->GetSelectedObjects<AActor>(SelectedActors);\n\n\t\tfor( int32 Idx = 0 ; Idx < SelectedActors.Num() ; ++Idx )\n\t\t{\n\t\t\tAActor* Actor = SelectedActors[ Idx ];\n\t\t\t\/\/ Don't consider already visible actors or the builder brush\n\t\t\tif( !FActorEditorUtils::IsABuilderBrush(Actor) && Actor->IsHiddenEd() )\n\t\t\t{\n\t\t\t\tActor->SetIsTemporarilyHiddenInEditor( false );\n\t\t\t}\n\t\t}\n\t\tGEditor->RedrawLevelEditingViewports();\n\t}\n\telse if( FParse::Command(&Str, TEXT(\"IsolateSelected\")))\n\t{\n\t\t\/\/ Iterate through all of the actors and hide the ones which are not selected and are not already hidden\n\t\tauto World = GEditor->GetEditorWorldContext().World();\n\t\tfor( FActorIterator It(World); It; ++It )\n\t\t{\n\t\t\tAActor* Actor = *It;\n\t\t\tif( !FActorEditorUtils::IsABuilderBrush(Actor) && !Actor->IsSelected() && !Actor->IsHiddenEd() )\n\t\t\t{\n\t\t\t\tActor->SetIsTemporarilyHiddenInEditor( true );\n\t\t\t}\n\t\t}\n\t\tGEditor->RedrawLevelEditingViewports();\n\t}\n\telse if( FParse::Command(&Str, TEXT(\"UnhideAll\")))\n\t{\n\t\t\/\/ Iterate through all of the actors and unhide them\n\t\tauto World = GEditor->GetEditorWorldContext().World();\n\t\tfor( FActorIterator It(World); It; ++It )\n\t\t{\n\t\t\tAActor* Actor = *It;\n\t\t\tif( !FActorEditorUtils::IsABuilderBrush(Actor) && Actor->IsTemporarilyHiddenInEditor() )\n\t\t\t{\n\t\t\t\tActor->SetIsTemporarilyHiddenInEditor( false );\n\t\t\t}\n\t\t}\n\t\tGEditor->RedrawLevelEditingViewports();\n\t}\n\n\t\/\/ -- CAMERA --\n\telse if( FParse::Command(&Str, TEXT(\"TransformCamera\")))\n\t{\n\t\t\/* this command is meant for viewports, not for camera Actors *\/\n\t\tconst TCHAR* Stream = Str;\n\t\tFVector Loc;\n\t\tStream = GetFVECTORSpaceDelimited( Stream, Loc );\n\t\t\/\/ jump over the space\n\t\tStream = FCString::Strchr(Stream,' ');\n\t\tif( Stream != NULL )\n\t\t{\n\t\t\t++Stream;\n\t\t}\n\t\tFRotator Rot;\n\t\tStream = GetFROTATORSpaceDelimited( Stream, Rot, 1.0f );\n\n\t\tif( Stream != NULL )\n\t\t{\n\t\t\tfor( int32 i=0; i<GEditor->LevelViewportClients.Num(); i++ )\n\t\t\t{\n\t\t\t\tGEditor->LevelViewportClients[i]->SetViewLocation( Loc );\n\t\t\t\tGEditor->LevelViewportClients[i]->SetViewRotation( Rot );\n\t\t\t}\n\t\t}\n\t\tGEditor->RedrawLevelEditingViewports();\n\n\t}\n\telse if( FParse::Command(&Str, TEXT(\"DuplicateObject\")))\n\t{\n\t\t\/*Actor->InvalidateLightingCache();\n\t\t\/\/ Call PostEditMove to update components, etc.\n\t\tActor->PostEditMove( true );\n\t\tActor->PostDuplicate(false);\n\t\tActor->CheckDefaultSubobjects();\n\n\t\t\/\/ Request saves\/refreshes.\n\t\tActor->MarkPackageDirty();*\/\n\t}\n}\n<commit_msg>edited selection and transform functions<commit_after>\/\/ Copyright 1998-2014 Epic Games, Inc. All Rights Reserved.\n\n#include \"m2uPluginPrivatePCH.h\"\n#include \"Networking.h\"\n#include \"ActorEditorUtils.h\"\n#include \"UnrealEd.h\"\n\nDEFINE_LOG_CATEGORY( LogM2U )\n\n#define DEFAULT_M2U_ENDPOINT FIPv4Endpoint(FIPv4Address(127,0,0,1), 3939)\n\nIMPLEMENT_MODULE( Fm2uPlugin, m2uPlugin )\n\n\nbool GetActorByName( const TCHAR* Name, AActor* OutActor, UWorld* InWorld);\nvoid ExecuteCommand(const TCHAR* Str);\n\nFm2uPlugin::Fm2uPlugin()\n\t:TcpListener(NULL),\n\t Client(NULL)\n{\n}\n\nvoid Fm2uPlugin::StartupModule()\n{\n    \/\/ This code will execute after your module is loaded into memory (but after global variables are initialized, of course.)\n\tUE_LOG(LogM2U, Log, TEXT(\"starting up m2u\"));\n\tif( !GIsEditor )\n\t{\n\t\treturn;\n\t}\n\n\tTcpListener = new FTcpListener( DEFAULT_M2U_ENDPOINT );\n\tTcpListener->OnConnectionAccepted().BindRaw(this, &Fm2uPlugin::HandleConnectionAccepted);\n\n\tTickObject = new Fm2uTickObject(this);\n\n}\n\n\nvoid Fm2uPlugin::ShutdownModule()\n{\n\n\tTcpListener->Stop();\n\tdelete TcpListener;\n\tTcpListener = NULL;\n\n    \/\/ close all clients\n\tClient->Close();\n\tClient=NULL;\n\n\tdelete TickObject;\n\tTickObject = NULL;\n}\n\nbool Fm2uPlugin::HandleConnectionAccepted( FSocket* ClientSocket, const FIPv4Endpoint& ClientEndpoint)\n{\n\tif(Client==NULL)\n\t{\n\t\tClient = ClientSocket;\n\t\tUE_LOG(LogM2U, Log, TEXT(\"connected on port %i\"),Client->GetPortNo());\n\t\treturn true;\n\t}\n\tUE_LOG(LogM2U, Log, TEXT(\"connection declined\"));\n\treturn false;\n}\n\n\nvoid Fm2uPlugin::Tick( float DeltaTime )\n{\n    \/\/ get data from client\n\tif(Client==NULL)\n\t\treturn;\n\n\tuint32 DataSize = 0;\n\twhile(Client->HasPendingData(DataSize) && DataSize > 0 )\n\t{\n\t\t\/\/UE_LOG(LogM2U, Log, TEXT(\"pending data size %i\"), DataSize);\n        \/\/ create data array to read from client\n\t\t\/\/FArrayReaderPtr Data = MakeShareable(new FArrayReader(true));\n\t\tFArrayReader Data;\n\t\tData.Init(DataSize);\n\n\t\tint32 BytesRead = 0;\n        \/\/ read pending data into the Data array reader\n\t\tif( Client->Recv( Data.GetData(), Data.Num(), BytesRead) )\n\t\t{\n\t\t\tUE_LOG(LogM2U, Log, TEXT(\"DataNum %i, BytesRead: %i\"), Data.Num(), BytesRead);\n\n\t\t\t\/\/ the data we receive is supposed to be ansi, but we will work with TCHAR, so we have to convert\n\t\t\tint32 DestLen = TStringConvert<ANSICHAR,TCHAR>::ConvertedLength((char*)(Data.GetData()),Data.Num());\n\t\t\t\/\/UE_LOG(LogM2U, Log, TEXT(\"DestLen will be %i\"), DestLen);\n\t\t\tTCHAR* Dest = new TCHAR[DestLen+1];\n\t\t\tTStringConvert<ANSICHAR,TCHAR>::Convert(Dest, DestLen, (char*)(Data.GetData()), Data.Num());\n\t\t\tDest[DestLen]='\\0';\n\n\t\t\t\/\/FString Text(Dest); \/\/ FString from tchar array\n\t\t\t\/\/UE_LOG(LogM2U, Log, TEXT(\"server received %s\"), *Text);\n\t\t\tUE_LOG(LogM2U, Log, TEXT(\"Server received: %s\"), Dest);\n\n\t\t\tExecuteCommand(Dest);\n\n\t\t\tdelete Dest;\n\t\t}\n\n\t\t\/\/if(\t! Client->Send(Data, Count, BytesSent) )\n\t\t\/\/{\n\t\t\/\/\tUE_LOG(LogM2U, Log, TEXT(\"server sending answer failed\"));\n\t\t\/\/}\n\t}\n}\n\n\/\/void HandleReceivedData(FArrayReader& Data)\n\nbool GetActorByName( const TCHAR* Name, AActor** OutActor, UWorld* InWorld = NULL)\n{\n\tif( InWorld == NULL)\n\t{\n\t\tInWorld = GEditor->GetEditorWorldContext().World();\n\t}\n\tAActor* Actor;\n\t\/\/OutActor = FindObject<AActor>( InWorld->GetCurrentLevel(), Name );\n\tActor = FindObject<AActor>( ANY_PACKAGE, Name, false );\n\tif( Actor == NULL ) \/\/ actor with that name cannot be found\n\t{\n\t\treturn false;\n\t}\n\telse if( ! Actor->IsValidLowLevelFast() )\n\t{\n\t\t\/\/UE_LOG(LogM2U, Log, TEXT(\"Actor is NOT valid\"));\n\t\treturn false;\n\t}\n\telse\n\t{\n\t\t\/\/UE_LOG(LogM2U, Log, TEXT(\"Actor is valid\"));\n\t\t*OutActor=Actor;\n\t\treturn true;\n\t}\n}\n\nvoid ExecuteCommand(const TCHAR* Str)\n{\n\tif( FParse::Command(&Str, TEXT(\"Exec\")))\n\t{\n\t\tGEditor->Exec(GEditor->GetEditorWorldContext().World(), Str);\n\t}\n\n\n\t\/\/ -- SELECTION --\n\telse if( FParse::Command(&Str, TEXT(\"SelectByName\")))\n\t{\n\t\tconst FString ActorName = FParse::Token(Str,0);\n\t\tAActor* Actor = GEditor->SelectNamedActor(*ActorName);\n\t\tGEditor->RedrawLevelEditingViewports();\n\t}\n\telse if( FParse::Command(&Str, TEXT(\"DeselectAll\")))\n\t{\n\t\tGEditor->SelectNone(true, true, false);\n\t\tGEditor->RedrawLevelEditingViewports();\n\t}\n\telse if( FParse::Command(&Str, TEXT(\"DeselectByName\")))\n\t{\n\t\tconst FString ActorName = FParse::Token(Str,0);\n\t\tTArray<AActor*> SelectedActors;\n\t\tUSelection* Selection = GEditor->GetSelectedActors();\n\t\tSelection->GetSelectedObjects<AActor>(SelectedActors);\n\n\t\tfor( int32 Idx = 0 ; Idx < SelectedActors.Num() ; ++Idx )\n\t\t{\n\t\t\tAActor* Actor = SelectedActors[ Idx ];\t\t\t\n\t\t\tif(Actor->GetFName().ToString() == ActorName)\n\t\t\t{\n\t\t\t\tSelection->Modify();\n\t\t\t\t\/\/Selection->BeginBatchSelectOperation();\n\t\t\t\t\/\/Selection->Deselect(Actor);\n\t\t\t\t\/\/Selection->EndBatchSelectOperation();\n\t\t\t\tGEditor->SelectActor( Actor, false, false ); \/\/ deselect\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tGEditor->RedrawLevelEditingViewports();\n\t}\n\n\n\t\/\/ -- EDITING --\n\telse if( FParse::Command(&Str, TEXT(\"TransformObject\")))\n\t{\n\t\tconst FString ActorName = FParse::Token(Str,0);\n\t\tAActor* Actor = NULL;\n\t\tUE_LOG(LogM2U, Log, TEXT(\"Searching for actor with name %s\"), *ActorName);\n\n\t\tif(!GetActorByName(*ActorName, &Actor) || Actor == NULL)\n\t\t{\n\t\t\tUE_LOG(LogM2U, Log, TEXT(\"Actor %s not found or invalid.\"), *ActorName);\n\t\t\treturn;\n\t\t}\n\n\t\tconst TCHAR* Stream = Str;\n\t\tif( Stream != NULL )\n\t\t{\t++Stream;  } \/\/ skip a space\n\n\t\tFString Temp; \n\t\t\/\/ get location\n\t\tFVector Loc;\n\t\tif( FParse::Value( Stream, TEXT(\"T=(\"), Temp, false) )\n\t\t{\n\t\t\t\/\/Stream += 2; \/\/ skip T=\n\t\t\t\/\/Stream = GetFVECTORSpaceDelimited( Stream, Loc );\n\t\t\tGetFVECTORSpaceDelimited( *Temp, Loc );\n\t\t\t\/\/UE_LOG(LogM2U, Log, TEXT(\"Loc %s\"), *(Loc.ToString()) );\n\t\t\t\/\/ jump over the space\n\t\t\t\/\/Stream = FCString::Strchr(Stream,' ');\n\t\t\t\/\/if( Stream != NULL )\n\t\t\t\/\/{\t++Stream;  }\n\t\t}\n\t\telse \/\/ no translate value in string\n\t\t{\n\t\t\tLoc = Actor->GetActorLocation();\n\t\t}\n\n\t\t\/\/ get rotation\n\t\tFRotator Rot;\n\t\tif( FParse::Value( Stream, TEXT(\"R=(\"), Temp, false) )\n\t\t{\n\t\t\t\/\/Stream +=2;\n\t\t\t\/\/Stream = GetFROTATORSpaceDelimited( Stream, Rot, 1.0f );\n\t\t\tGetFROTATORSpaceDelimited( *Temp, Rot, 1.0f );\n\t\t\t\/\/UE_LOG(LogM2U, Log, TEXT(\"Rot %s\"), *(Rot.ToString()) );\n\t\t\t\/\/ jump over the space\n\t\t\t\/\/Stream = FCString::Strchr(Stream,' ');\n\t\t\t\/\/if( Stream != NULL )\n\t\t\t\/\/{\t++Stream;  }\n\t\t}\n\t\telse \/\/ no rotate value in string\n\t\t{\n\t\t\tRot = Actor->GetActorRotation();\n\t\t}\n\n\t\t\/\/ get scale\n\t\tFVector Scale;\n\t\tif( FParse::Value( Stream, TEXT(\"S=(\"), Temp, false) )\n\t\t{\n\t\t\t\/\/Stream = GetFVECTORSpaceDelimited( Stream, Scale );\n\t\t\tGetFVECTORSpaceDelimited( *Temp, Scale );\n\t\t\t\/\/UE_LOG(LogM2U, Log, TEXT(\"Scc %s\"), *(Scale.ToString()) );\n\t\t\tActor->SetActorScale3D( Scale );\n\t\t}\n\n\t\tActor->TeleportTo( Loc, Rot, false, true);\n\t\tActor->InvalidateLightingCache();\n\t\t\/\/ Call PostEditMove to update components, etc.\n\t\tActor->PostEditMove( true );\n\t\tActor->CheckDefaultSubobjects();\n\t\t\/\/ Request saves\/refreshes.\n\t\tActor->MarkPackageDirty();\n\n\t\tGEditor->RedrawLevelEditingViewports();\n\t}\n\telse if( FParse::Command(&Str, TEXT(\"DeleteSelected\")))\n\t{\n\t}\n\telse if( FParse::Command(&Str, TEXT(\"RenameObject\")))\n\t{\n\t}\n\telse if( FParse::Command(&Str, TEXT(\"DuplicateObject\")))\n\t{\n\t\t\/*Actor->InvalidateLightingCache();\n\t\t\/\/ Call PostEditMove to update components, etc.\n\t\tActor->PostEditMove( true );\n\t\tActor->PostDuplicate(false);\n\t\tActor->CheckDefaultSubobjects();\n\n\t\t\/\/ Request saves\/refreshes.\n\t\tActor->MarkPackageDirty();*\/\n\t}\n\t\n\n\n\t\/\/ -- VISIBILITY --\n\t\/\/ also see the \"edactHide...\" functions\n\t\/\/ these functions currently do not write to the TransactionBuffer, so won't be undoable\n\telse if( FParse::Command(&Str, TEXT(\"HideSelected\")))\n\t{\n\t\tTArray<AActor*> SelectedActors;\n\t\tUSelection* Selection = GEditor->GetSelectedActors();\n\t\tSelection->Modify();\n\t\tSelection->GetSelectedObjects<AActor>(SelectedActors);\n\n\t\tfor( int32 Idx = 0 ; Idx < SelectedActors.Num() ; ++Idx )\n\t\t{\n\t\t\tAActor* Actor = SelectedActors[ Idx ];\n\t\t\t\/\/ Don't consider already hidden actors or the builder brush\n\t\t\tif( !FActorEditorUtils::IsABuilderBrush(Actor) && !Actor->IsHiddenEd() )\n\t\t\t{\n\t\t\t\tActor->SetIsTemporarilyHiddenInEditor( true );\n\t\t\t}\n\t\t}\n\t\tGEditor->RedrawLevelEditingViewports();\n\t}\n\telse if( FParse::Command(&Str, TEXT(\"UnhideSelected\")))\n\t{\n\t\tTArray<AActor*> SelectedActors;\n\t\tUSelection* Selection = GEditor->GetSelectedActors();\n\t\tSelection->Modify();\n\t\tSelection->GetSelectedObjects<AActor>(SelectedActors);\n\n\t\tfor( int32 Idx = 0 ; Idx < SelectedActors.Num() ; ++Idx )\n\t\t{\n\t\t\tAActor* Actor = SelectedActors[ Idx ];\n\t\t\t\/\/ Don't consider already visible actors or the builder brush\n\t\t\tif( !FActorEditorUtils::IsABuilderBrush(Actor) && Actor->IsHiddenEd() )\n\t\t\t{\n\t\t\t\tActor->SetIsTemporarilyHiddenInEditor( false );\n\t\t\t}\n\t\t}\n\t\tGEditor->RedrawLevelEditingViewports();\n\t}\n\telse if( FParse::Command(&Str, TEXT(\"IsolateSelected\")))\n\t{\n\t\t\/\/ Iterate through all of the actors and hide the ones which are not selected and are not already hidden\n\t\tauto World = GEditor->GetEditorWorldContext().World();\n\t\tfor( FActorIterator It(World); It; ++It )\n\t\t{\n\t\t\tAActor* Actor = *It;\n\t\t\tif( !FActorEditorUtils::IsABuilderBrush(Actor) && !Actor->IsSelected() && !Actor->IsHiddenEd() )\n\t\t\t{\n\t\t\t\tActor->SetIsTemporarilyHiddenInEditor( true );\n\t\t\t}\n\t\t}\n\t\tGEditor->RedrawLevelEditingViewports();\n\t}\n\telse if( FParse::Command(&Str, TEXT(\"UnhideAll\")))\n\t{\n\t\t\/\/ Iterate through all of the actors and unhide them\n\t\tauto World = GEditor->GetEditorWorldContext().World();\n\t\tfor( FActorIterator It(World); It; ++It )\n\t\t{\n\t\t\tAActor* Actor = *It;\n\t\t\tif( !FActorEditorUtils::IsABuilderBrush(Actor) && Actor->IsTemporarilyHiddenInEditor() )\n\t\t\t{\n\t\t\t\tActor->SetIsTemporarilyHiddenInEditor( false );\n\t\t\t}\n\t\t}\n\t\tGEditor->RedrawLevelEditingViewports();\n\t}\n\n\n\t\/\/ -- CAMERA --\n\telse if( FParse::Command(&Str, TEXT(\"TransformCamera\")))\n\t{\n\t\t\/* this command is meant for viewports, not for camera Actors *\/\n\t\tconst TCHAR* Stream = Str;\n\t\tFVector Loc;\n\t\tStream = GetFVECTORSpaceDelimited( Stream, Loc );\n\t\t\/\/ jump over the space\n\t\tStream = FCString::Strchr(Stream,' ');\n\t\tif( Stream != NULL )\n\t\t{\n\t\t\t++Stream;\n\t\t}\n\t\tFRotator Rot;\n\t\tStream = GetFROTATORSpaceDelimited( Stream, Rot, 1.0f );\n\n\t\tif( Stream != NULL )\n\t\t{\n\t\t\tfor( int32 i=0; i<GEditor->LevelViewportClients.Num(); i++ )\n\t\t\t{\n\t\t\t\tGEditor->LevelViewportClients[i]->SetViewLocation( Loc );\n\t\t\t\tGEditor->LevelViewportClients[i]->SetViewRotation( Rot );\n\t\t\t}\n\t\t}\n\t\tGEditor->RedrawLevelEditingViewports();\n\n\t}\n\n\t\/\/ -- OTHER --\n\telse if( FParse::Command(&Str, TEXT(\"Undo\")))\n\t{}\n\telse if( FParse::Command(&Str, TEXT(\"Redo\")))\n\t{}\n\telse if( FParse::Command(&Str, TEXT(\"GetFreeName\")))\n\t{}\n\t\n}\n<|endoftext|>"}
{"text":"<commit_before>\n\/\/\n\/\/ This source file is part of appleseed.\n\/\/ Visit https:\/\/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-2018 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 \"miscellaneous.h\"\n\n\/\/ appleseed.studio headers.\n#include \"utility\/interop.h\"\n#include \"utility\/settingskeys.h\"\n\n\/\/ appleseed.shared headers.\n#include \"application\/application.h\"\n\n\/\/ appleseed.renderer headers.\n#include \"renderer\/api\/utility.h\"\n\n\/\/ appleseed.foundation headers.\n#include \"foundation\/utility\/string.h\"\n\n\/\/ OpenImageIO headers.\n#include \"foundation\/platform\/_beginoiioheaders.h\"\n#include \"OpenImageIO\/texture.h\"\n#include \"foundation\/platform\/_endoiioheaders.h\"\n\n\/\/ Qt headers.\n#include <QDir>\n#include <QFileInfo>\n#include <QGridLayout>\n#include <QIcon>\n#include <QKeySequence>\n#include <QLayout>\n#include <QLayoutItem>\n#include <QMessageBox>\n#include <QMutex>\n#include <QMutexLocker>\n#include <QPixmap>\n#include <QShortcut>\n#include <QSpacerItem>\n#include <QString>\n#include <QStringList>\n#include <Qt>\n#include <QWidget>\n\n\/\/ Standard headers.\n#include <sstream>\n#include <string>\n#include <vector>\n\nusing namespace appleseed::shared;\nusing namespace foundation;\nusing namespace renderer;\nusing namespace std;\n\nnamespace appleseed {\nnamespace studio {\n\nconst QString g_appleseed_image_files_filter = \"Bitmap Files (*.exr *.png);;OpenEXR (*.exr);;PNG (*.png);;All Files (*.*)\";\n\nconst QString g_qt_image_files_filter = \"Bitmap Files (*.bmp *.jpg *.png *.tif);;BMP (*.bmp);;JPEG (*.jpg);;PNG (*.png);;TIFF (*.tif);;All Files (*.*)\";\n\nnamespace\n{\n    string join_exts(const vector<string>& exts)\n    {\n        stringstream sstr;\n\n        for (size_t i = 0, e = exts.size(); i < e; ++i)\n        {\n            if (i > 0)\n                sstr << \" \";\n            sstr << \"*.\" << exts[i];\n        }\n\n        return sstr.str();\n    }\n}\n\nQString get_oiio_image_files_filter()\n{\n    static QString filter;\n    static QMutex mutex;\n\n    QMutexLocker locker(&mutex);\n\n    if (filter.isEmpty())\n    {\n        stringstream sstr;\n\n        \/\/ Retrieve the extension list as a string of the form \"bmp:bmp;openexr:exr,sxr,mxr;png:png\".\n        string extension_list;\n        OIIO::getattribute(\"extension_list\", extension_list);\n\n        \/\/ Split the extension list into an array of the form [ \"bmp:bmp\", \"openexr:exr,sxr,mxr\", \"png:png\" ].\n        vector<string> formats;\n        split(extension_list, \";\", formats);\n\n        \/\/ Collect all extensions into an array of the form [ \"bmp\", \"exr\", \"png\" ].\n        vector<string> all_exts;\n        for (const auto& format : formats)\n        {\n            const auto sep = format.find_first_of(':');\n            const auto extlist = format.substr(sep + 1);\n            split(extlist, \",\", all_exts);\n        }\n\n        \/\/ The first filter shows all bitmap files.\n        sstr << \"Bitmap Files (\" << join_exts(all_exts) << \");;\";\n\n        \/\/ Then one filter per file format.\n        for (const auto& format : formats)\n        {\n            const auto sep = format.find_first_of(':');\n            const auto name = format.substr(0, sep);\n            const auto extlist = format.substr(sep + 1);\n            vector<string> exts;\n            split(extlist, \",\", exts);\n            sstr << upper_case(name) << \" Files (\" << join_exts(exts) << \");;\";\n        }\n\n        \/\/ The last filter shows all files.\n        sstr << \"All Files (*.*)\";\n\n        filter = QString::fromStdString(sstr.str());\n    }\n\n    return filter;\n}\n\nQString get_project_files_filter(const int filters)\n{\n    QStringList filter_list;\n\n    if (filters & ProjectFilesFilterAllProjects)\n        filter_list << \"Project Files (*.appleseed *.appleseedz)\";\n\n    if (filters & ProjectFilesFilterPlainProjects)\n        filter_list << \"Plain Project Files (*.appleseed)\";\n\n    if (filters & ProjectFilesFilterPackedProjects)\n        filter_list << \"Packed Project Files (*.appleseedz)\";\n\n    filter_list << \"All Files (*.*)\";\n\n    return filter_list.join(\";;\");\n}\n\nQString combine_paths(const QString& lhs, const QString& rhs)\n{\n    QString result(lhs);\n\n    if (!result.endsWith(QDir::separator()))\n        result.append(QDir::separator());\n\n    result.append(rhs);\n\n    return QDir::toNativeSeparators(result);\n}\n\nQString make_app_path(const QString& path)\n{\n    return combine_paths(Application::get_root_path(), path);\n}\n\nQString combine_name_and_shortcut(const QString& name, const QKeySequence& shortcut)\n{\n    return name + \" (\" + shortcut.toString(QKeySequence::NativeText) + \")\";\n}\n\nbool file_exists(const QString& path)\n{\n    const QFileInfo info(path);\n    return info.exists() && info.isFile();\n}\n\nQIcon load_icons(const QString& base_name)\n{\n    const QString base_icon_filepath(make_app_path(\"icons\/%1.png\").arg(base_name));\n    const QString hover_icon_filepath(make_app_path(\"icons\/%1_hover.png\").arg(base_name));\n    const QString disabled_icon_filepath(make_app_path(\"icons\/%1_disabled.png\").arg(base_name));\n\n    QIcon icon(base_icon_filepath);\n\n    if (file_exists(hover_icon_filepath))\n        icon.addPixmap(QPixmap(hover_icon_filepath), QIcon::Active);\n\n    if (file_exists(disabled_icon_filepath))\n        icon.addPixmap(QPixmap(disabled_icon_filepath), QIcon::Disabled);\n\n    return icon;\n}\n\nnamespace\n{\n    QString get_value(const ParamArray& settings, const QString& key)\n    {\n        return settings.get_path_optional<QString>(key.toAscii().constData());\n    }\n\n    void set_value(ParamArray& settings, const QString& key, const QString& value)\n    {\n        settings.insert_path(key.toAscii().constData(), value);\n    }\n}\n\nQString get_open_filename(\n    QWidget*                parent,\n    const QString&          caption,\n    const QString&          filter,\n    ParamArray&             settings,\n    const QString&          settings_key,\n    QFileDialog::Options    options)\n{\n    const QString dir = get_value(settings, settings_key + SETTINGS_LAST_DIRECTORY);\n    QString selected_filter = get_value(settings, settings_key + SETTINGS_SELECTED_FILTER);\n\n    const QString filepath =\n        QFileDialog::getOpenFileName(\n            parent,\n            caption,\n            dir,\n            filter,\n            &selected_filter,\n            options);\n\n    set_value(settings, settings_key + SETTINGS_SELECTED_FILTER, selected_filter);\n\n    if (!filepath.isEmpty())\n    {\n        set_value(\n            settings,\n            settings_key + SETTINGS_LAST_DIRECTORY,\n            QDir::toNativeSeparators(QFileInfo(filepath).path()));\n    }\n\n    return filepath;\n}\n\nQStringList get_open_filenames(\n    QWidget*                parent,\n    const QString&          caption,\n    const QString&          filter,\n    ParamArray&             settings,\n    const QString&          settings_key,\n    QFileDialog::Options    options)\n{\n    const QString dir = get_value(settings, settings_key + SETTINGS_LAST_DIRECTORY);\n    QString selected_filter = get_value(settings, settings_key + SETTINGS_SELECTED_FILTER);\n\n    const QStringList filepaths =\n        QFileDialog::getOpenFileNames(\n            parent,\n            caption,\n            dir,\n            filter,\n            &selected_filter,\n            options);\n\n    set_value(settings, settings_key + SETTINGS_SELECTED_FILTER, selected_filter);\n\n    if (!filepaths.isEmpty())\n    {\n        set_value(\n            settings,\n            settings_key + SETTINGS_LAST_DIRECTORY,\n            QDir::toNativeSeparators(QFileInfo(filepaths.first()).path()));\n    }\n\n    return filepaths;\n}\n\nQString get_save_filename(\n    QWidget*                parent,\n    const QString&          caption,\n    const QString&          filter,\n    ParamArray&             settings,\n    const QString&          settings_key,\n    QFileDialog::Options    options)\n{\n    const QString dir = get_value(settings, settings_key + SETTINGS_LAST_DIRECTORY);\n    QString selected_filter = get_value(settings, settings_key + SETTINGS_SELECTED_FILTER);\n\n    const QString filepath =\n        QFileDialog::getSaveFileName(\n            parent,\n            caption,\n            dir,\n            filter,\n            &selected_filter,\n            options);\n\n    set_value(settings, settings_key + SETTINGS_SELECTED_FILTER, selected_filter);\n\n    if (!filepath.isEmpty())\n    {\n        set_value(\n            settings,\n            settings_key + SETTINGS_LAST_DIRECTORY,\n            QDir::toNativeSeparators(QFileInfo(filepath).path()));\n    }\n\n    return filepath;\n}\n\nvoid disable_osx_focus_rect(QWidget* widget)\n{\n    widget->setAttribute(Qt::WA_MacShowFocusRect, false);\n}\n\nvoid set_minimum_width(QMessageBox& msgbox, const int minimum_width)\n{\n    QSpacerItem* spacer =\n        new QSpacerItem(\n            minimum_width,\n            0,\n            QSizePolicy::Minimum,\n            QSizePolicy::Expanding);\n\n    QGridLayout* layout = static_cast<QGridLayout*>(msgbox.layout());\n\n    layout->addItem(\n        spacer,\n        layout->rowCount(),         \/\/ row\n        0,                          \/\/ column\n        1,                          \/\/ row span\n        layout->columnCount());     \/\/ column span\n}\n\nQShortcut* create_window_local_shortcut(QWidget* parent, const int key)\n{\n    return\n        new QShortcut(\n            QKeySequence(key),\n            parent,\n            nullptr,\n            nullptr,\n            Qt::WidgetWithChildrenShortcut);\n}\n\nvoid clear_layout(QLayout* layout)\n{\n    for (int i = layout->count(); i > 0; --i)\n    {\n        QLayoutItem* item = layout->takeAt(0);\n\n        if (item->layout())\n            clear_layout(item->layout());\n        else item->widget()->deleteLater();\n\n        delete item;\n    }\n}\n\n}   \/\/ namespace studio\n}   \/\/ namespace appleseed\n<commit_msg>Add extension based on selected filter in file save dialogs<commit_after>\n\/\/\n\/\/ This source file is part of appleseed.\n\/\/ Visit https:\/\/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-2018 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 \"miscellaneous.h\"\n\n\/\/ appleseed.studio headers.\n#include \"utility\/interop.h\"\n#include \"utility\/settingskeys.h\"\n\n\/\/ appleseed.shared headers.\n#include \"application\/application.h\"\n\n\/\/ appleseed.renderer headers.\n#include \"renderer\/api\/utility.h\"\n\n\/\/ appleseed.foundation headers.\n#include \"foundation\/utility\/string.h\"\n\n\/\/ OpenImageIO headers.\n#include \"foundation\/platform\/_beginoiioheaders.h\"\n#include \"OpenImageIO\/texture.h\"\n#include \"foundation\/platform\/_endoiioheaders.h\"\n\n\/\/ Qt headers.\n#include <QDir>\n#include <QFileInfo>\n#include <QGridLayout>\n#include <QIcon>\n#include <QKeySequence>\n#include <QLayout>\n#include <QLayoutItem>\n#include <QMessageBox>\n#include <QMutex>\n#include <QMutexLocker>\n#include <QPixmap>\n#include <QShortcut>\n#include <QSpacerItem>\n#include <QString>\n#include <QStringList>\n#include <Qt>\n#include <QWidget>\n\n\/\/ Standard headers.\n#include <sstream>\n#include <string>\n#include <vector>\n\nusing namespace appleseed::shared;\nusing namespace foundation;\nusing namespace renderer;\nusing namespace std;\n\nnamespace appleseed {\nnamespace studio {\n\nconst QString g_appleseed_image_files_filter = \"Bitmap Files (*.exr *.png);;OpenEXR (*.exr);;PNG (*.png);;All Files (*.*)\";\n\nconst QString g_qt_image_files_filter = \"Bitmap Files (*.bmp *.jpg *.png *.tif);;BMP (*.bmp);;JPEG (*.jpg);;PNG (*.png);;TIFF (*.tif);;All Files (*.*)\";\n\nnamespace\n{\n    string join_exts(const vector<string>& exts)\n    {\n        stringstream sstr;\n\n        for (size_t i = 0, e = exts.size(); i < e; ++i)\n        {\n            if (i > 0)\n                sstr << \" \";\n            sstr << \"*.\" << exts[i];\n        }\n\n        return sstr.str();\n    }\n}\n\nQString get_oiio_image_files_filter()\n{\n    static QString filter;\n    static QMutex mutex;\n\n    QMutexLocker locker(&mutex);\n\n    if (filter.isEmpty())\n    {\n        stringstream sstr;\n\n        \/\/ Retrieve the extension list as a string of the form \"bmp:bmp;openexr:exr,sxr,mxr;png:png\".\n        string extension_list;\n        OIIO::getattribute(\"extension_list\", extension_list);\n\n        \/\/ Split the extension list into an array of the form [ \"bmp:bmp\", \"openexr:exr,sxr,mxr\", \"png:png\" ].\n        vector<string> formats;\n        split(extension_list, \";\", formats);\n\n        \/\/ Collect all extensions into an array of the form [ \"bmp\", \"exr\", \"png\" ].\n        vector<string> all_exts;\n        for (const auto& format : formats)\n        {\n            const auto sep = format.find_first_of(':');\n            const auto extlist = format.substr(sep + 1);\n            split(extlist, \",\", all_exts);\n        }\n\n        \/\/ The first filter shows all bitmap files.\n        sstr << \"Bitmap Files (\" << join_exts(all_exts) << \");;\";\n\n        \/\/ Then one filter per file format.\n        for (const auto& format : formats)\n        {\n            const auto sep = format.find_first_of(':');\n            const auto name = format.substr(0, sep);\n            const auto extlist = format.substr(sep + 1);\n            vector<string> exts;\n            split(extlist, \",\", exts);\n            sstr << upper_case(name) << \" Files (\" << join_exts(exts) << \");;\";\n        }\n\n        \/\/ The last filter shows all files.\n        sstr << \"All Files (*.*)\";\n\n        filter = QString::fromStdString(sstr.str());\n    }\n\n    return filter;\n}\n\nQString get_project_files_filter(const int filters)\n{\n    QStringList filter_list;\n\n    if (filters & ProjectFilesFilterAllProjects)\n        filter_list << \"Project Files (*.appleseed *.appleseedz)\";\n\n    if (filters & ProjectFilesFilterPlainProjects)\n        filter_list << \"Plain Project Files (*.appleseed)\";\n\n    if (filters & ProjectFilesFilterPackedProjects)\n        filter_list << \"Packed Project Files (*.appleseedz)\";\n\n    filter_list << \"All Files (*.*)\";\n\n    return filter_list.join(\";;\");\n}\n\nQString combine_paths(const QString& lhs, const QString& rhs)\n{\n    QString result(lhs);\n\n    if (!result.endsWith(QDir::separator()))\n        result.append(QDir::separator());\n\n    result.append(rhs);\n\n    return QDir::toNativeSeparators(result);\n}\n\nQString make_app_path(const QString& path)\n{\n    return combine_paths(Application::get_root_path(), path);\n}\n\nQString combine_name_and_shortcut(const QString& name, const QKeySequence& shortcut)\n{\n    return name + \" (\" + shortcut.toString(QKeySequence::NativeText) + \")\";\n}\n\nbool file_exists(const QString& path)\n{\n    const QFileInfo info(path);\n    return info.exists() && info.isFile();\n}\n\nQIcon load_icons(const QString& base_name)\n{\n    const QString base_icon_filepath(make_app_path(\"icons\/%1.png\").arg(base_name));\n    const QString hover_icon_filepath(make_app_path(\"icons\/%1_hover.png\").arg(base_name));\n    const QString disabled_icon_filepath(make_app_path(\"icons\/%1_disabled.png\").arg(base_name));\n\n    QIcon icon(base_icon_filepath);\n\n    if (file_exists(hover_icon_filepath))\n        icon.addPixmap(QPixmap(hover_icon_filepath), QIcon::Active);\n\n    if (file_exists(disabled_icon_filepath))\n        icon.addPixmap(QPixmap(disabled_icon_filepath), QIcon::Disabled);\n\n    return icon;\n}\n\nnamespace\n{\n    QString get_value(const ParamArray& settings, const QString& key)\n    {\n        return settings.get_path_optional<QString>(key.toAscii().constData());\n    }\n\n    void set_value(ParamArray& settings, const QString& key, const QString& value)\n    {\n        settings.insert_path(key.toAscii().constData(), value);\n    }\n}\n\nQString get_open_filename(\n    QWidget*                parent,\n    const QString&          caption,\n    const QString&          filter,\n    ParamArray&             settings,\n    const QString&          settings_key,\n    QFileDialog::Options    options)\n{\n    const QString dir = get_value(settings, settings_key + SETTINGS_LAST_DIRECTORY);\n    QString selected_filter = get_value(settings, settings_key + SETTINGS_SELECTED_FILTER);\n\n    const QString filepath =\n        QFileDialog::getOpenFileName(\n            parent,\n            caption,\n            dir,\n            filter,\n            &selected_filter,\n            options);\n\n    set_value(settings, settings_key + SETTINGS_SELECTED_FILTER, selected_filter);\n\n    if (!filepath.isEmpty())\n    {\n        set_value(\n            settings,\n            settings_key + SETTINGS_LAST_DIRECTORY,\n            QDir::toNativeSeparators(QFileInfo(filepath).path()));\n    }\n\n    return filepath;\n}\n\nQStringList get_open_filenames(\n    QWidget*                parent,\n    const QString&          caption,\n    const QString&          filter,\n    ParamArray&             settings,\n    const QString&          settings_key,\n    QFileDialog::Options    options)\n{\n    const QString dir = get_value(settings, settings_key + SETTINGS_LAST_DIRECTORY);\n    QString selected_filter = get_value(settings, settings_key + SETTINGS_SELECTED_FILTER);\n\n    const QStringList filepaths =\n        QFileDialog::getOpenFileNames(\n            parent,\n            caption,\n            dir,\n            filter,\n            &selected_filter,\n            options);\n\n    set_value(settings, settings_key + SETTINGS_SELECTED_FILTER, selected_filter);\n\n    if (!filepaths.isEmpty())\n    {\n        set_value(\n            settings,\n            settings_key + SETTINGS_LAST_DIRECTORY,\n            QDir::toNativeSeparators(QFileInfo(filepaths.first()).path()));\n    }\n\n    return filepaths;\n}\n\nQString get_save_filename(\n    QWidget*                parent,\n    const QString&          caption,\n    const QString&          filter,\n    ParamArray&             settings,\n    const QString&          settings_key,\n    QFileDialog::Options    options)\n{\n    const QString dir = get_value(settings, settings_key + SETTINGS_LAST_DIRECTORY);\n    QString selected_filter = get_value(settings, settings_key + SETTINGS_SELECTED_FILTER);\n\n    QString filepath =\n        QFileDialog::getSaveFileName(\n            parent,\n            caption,\n            dir,\n            filter,\n            &selected_filter,\n            options);\n\n    set_value(settings, settings_key + SETTINGS_SELECTED_FILTER, selected_filter);\n\n    if (!filepath.isEmpty())\n    {\n        set_value(\n            settings,\n            settings_key + SETTINGS_LAST_DIRECTORY,\n            QDir::toNativeSeparators(QFileInfo(filepath).path()));\n    }\n\n    QFileInfo finfo(filepath);\n\n    \/\/ Check if there is any extension.\n    \/\/ Use the selected filter as the extension only if the filter has one type.\n    if (finfo.suffix().isEmpty() && selected_filter.count('*') == 1)\n    {\n        int begin = selected_filter.indexOf(\"*\") + 1;\n        int end = selected_filter.indexOf(\")\", begin);\n        assert(begin != 0 && end > begin);\n        \n        filepath += selected_filter.mid(begin, end - begin);\n    }\n\n    return filepath;\n}\n\nvoid disable_osx_focus_rect(QWidget* widget)\n{\n    widget->setAttribute(Qt::WA_MacShowFocusRect, false);\n}\n\nvoid set_minimum_width(QMessageBox& msgbox, const int minimum_width)\n{\n    QSpacerItem* spacer =\n        new QSpacerItem(\n            minimum_width,\n            0,\n            QSizePolicy::Minimum,\n            QSizePolicy::Expanding);\n\n    QGridLayout* layout = static_cast<QGridLayout*>(msgbox.layout());\n\n    layout->addItem(\n        spacer,\n        layout->rowCount(),         \/\/ row\n        0,                          \/\/ column\n        1,                          \/\/ row span\n        layout->columnCount());     \/\/ column span\n}\n\nQShortcut* create_window_local_shortcut(QWidget* parent, const int key)\n{\n    return\n        new QShortcut(\n            QKeySequence(key),\n            parent,\n            nullptr,\n            nullptr,\n            Qt::WidgetWithChildrenShortcut);\n}\n\nvoid clear_layout(QLayout* layout)\n{\n    for (int i = layout->count(); i > 0; --i)\n    {\n        QLayoutItem* item = layout->takeAt(0);\n\n        if (item->layout())\n            clear_layout(item->layout());\n        else item->widget()->deleteLater();\n\n        delete item;\n    }\n}\n\n}   \/\/ namespace studio\n}   \/\/ namespace appleseed\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Copyright © 2017 Arm Ltd. All rights reserved.\n\/\/ SPDX-License-Identifier: MIT\n\/\/\n\n#include \"ClResizeWorkload.hpp\"\n\n#include \"ClWorkloadUtils.hpp\"\n\n#include <aclCommon\/ArmComputeUtils.hpp>\n#include <aclCommon\/ArmComputeTensorUtils.hpp>\n\n#include <backendsCommon\/CpuTensorHandle.hpp>\n\n#include <cl\/ClLayerSupport.hpp>\n#include <cl\/ClTensorHandle.hpp>\n\nusing namespace armnn::armcomputetensorutils;\n\nnamespace armnn\n{\n\narm_compute::Status ClResizeWorkloadValidate(const TensorInfo& input,\n                                             const TensorInfo& output,\n                                             const ResizeDescriptor& descriptor)\n{\n    arm_compute::TensorInfo aclInputInfo  = BuildArmComputeTensorInfo(input);\n    arm_compute::TensorInfo aclOutputInfo = BuildArmComputeTensorInfo(output);\n\n    arm_compute::DataLayout aclDataLayout = ConvertDataLayout(descriptor.m_DataLayout);\n    aclInputInfo.set_data_layout(aclDataLayout);\n    aclOutputInfo.set_data_layout(aclDataLayout);\n\n    arm_compute::InterpolationPolicy aclInterpolationPolicy =\n        ConvertResizeMethodToAclInterpolationPolicy(descriptor.m_Method);\n\n    return arm_compute::CLScale::validate(&aclInputInfo,\n                                          &aclOutputInfo,\n                                          aclInterpolationPolicy,\n                                          arm_compute::BorderMode::REPLICATE,\n                                          arm_compute::PixelValue(0.f),\n                                          arm_compute::SamplingPolicy::TOP_LEFT);\n}\n\nClResizeWorkload::ClResizeWorkload(const ResizeQueueDescriptor& descriptor, const WorkloadInfo& info) :\n    BaseWorkload<ResizeQueueDescriptor>(descriptor, info)\n{\n    m_Data.ValidateInputsOutputs(\"ClResizeWorkload\", 1, 1);\n\n    arm_compute::ICLTensor& input  = static_cast<IClTensorHandle*>(m_Data.m_Inputs[0])->GetTensor();\n    arm_compute::ICLTensor& output = static_cast<IClTensorHandle*>(m_Data.m_Outputs[0])->GetTensor();\n\n    arm_compute::DataLayout aclDataLayout = ConvertDataLayout(m_Data.m_Parameters.m_DataLayout);\n    input.info()->set_data_layout(aclDataLayout);\n    output.info()->set_data_layout(aclDataLayout);\n\n    arm_compute::InterpolationPolicy aclInterpolationPolicy =\n        ConvertResizeMethodToAclInterpolationPolicy(descriptor.m_Parameters.m_Method);\n\n    m_ResizeLayer.configure(&input,\n                            &output,\n                            aclInterpolationPolicy,\n                            arm_compute::BorderMode::REPLICATE,\n                            arm_compute::PixelValue(0.f),\n                            arm_compute::SamplingPolicy::TOP_LEFT);\n};\n\nvoid ClResizeWorkload::Execute() const\n{\n    ARMNN_SCOPED_PROFILING_EVENT_CL(\"ClResizeWorkload_Execute\");\n    RunClFunction(m_ResizeLayer, CHECK_LOCATION());\n}\n\n} \/\/namespace armnn\n<commit_msg>Remove unnecessary include from ClResizeWorkload.cpp<commit_after>\/\/\n\/\/ Copyright © 2017 Arm Ltd. All rights reserved.\n\/\/ SPDX-License-Identifier: MIT\n\/\/\n\n#include \"ClResizeWorkload.hpp\"\n\n#include \"ClWorkloadUtils.hpp\"\n\n#include <aclCommon\/ArmComputeUtils.hpp>\n#include <aclCommon\/ArmComputeTensorUtils.hpp>\n\n#include <backendsCommon\/CpuTensorHandle.hpp>\n\n#include <cl\/ClTensorHandle.hpp>\n\nusing namespace armnn::armcomputetensorutils;\n\nnamespace armnn\n{\n\narm_compute::Status ClResizeWorkloadValidate(const TensorInfo& input,\n                                             const TensorInfo& output,\n                                             const ResizeDescriptor& descriptor)\n{\n    arm_compute::TensorInfo aclInputInfo  = BuildArmComputeTensorInfo(input);\n    arm_compute::TensorInfo aclOutputInfo = BuildArmComputeTensorInfo(output);\n\n    arm_compute::DataLayout aclDataLayout = ConvertDataLayout(descriptor.m_DataLayout);\n    aclInputInfo.set_data_layout(aclDataLayout);\n    aclOutputInfo.set_data_layout(aclDataLayout);\n\n    arm_compute::InterpolationPolicy aclInterpolationPolicy =\n        ConvertResizeMethodToAclInterpolationPolicy(descriptor.m_Method);\n\n    return arm_compute::CLScale::validate(&aclInputInfo,\n                                          &aclOutputInfo,\n                                          aclInterpolationPolicy,\n                                          arm_compute::BorderMode::REPLICATE,\n                                          arm_compute::PixelValue(0.f),\n                                          arm_compute::SamplingPolicy::TOP_LEFT);\n}\n\nClResizeWorkload::ClResizeWorkload(const ResizeQueueDescriptor& descriptor, const WorkloadInfo& info) :\n    BaseWorkload<ResizeQueueDescriptor>(descriptor, info)\n{\n    m_Data.ValidateInputsOutputs(\"ClResizeWorkload\", 1, 1);\n\n    arm_compute::ICLTensor& input  = static_cast<IClTensorHandle*>(m_Data.m_Inputs[0])->GetTensor();\n    arm_compute::ICLTensor& output = static_cast<IClTensorHandle*>(m_Data.m_Outputs[0])->GetTensor();\n\n    arm_compute::DataLayout aclDataLayout = ConvertDataLayout(m_Data.m_Parameters.m_DataLayout);\n    input.info()->set_data_layout(aclDataLayout);\n    output.info()->set_data_layout(aclDataLayout);\n\n    arm_compute::InterpolationPolicy aclInterpolationPolicy =\n        ConvertResizeMethodToAclInterpolationPolicy(descriptor.m_Parameters.m_Method);\n\n    m_ResizeLayer.configure(&input,\n                            &output,\n                            aclInterpolationPolicy,\n                            arm_compute::BorderMode::REPLICATE,\n                            arm_compute::PixelValue(0.f),\n                            arm_compute::SamplingPolicy::TOP_LEFT);\n};\n\nvoid ClResizeWorkload::Execute() const\n{\n    ARMNN_SCOPED_PROFILING_EVENT_CL(\"ClResizeWorkload_Execute\");\n    RunClFunction(m_ResizeLayer, CHECK_LOCATION());\n}\n\n} \/\/namespace armnn\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ TerrainPatch.cpp\n\/\/\n\/\/ Copyright (c) 2001 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n#include \"vtlib\/vtlib.h\"\n#include \"TerrainPatch.h\"\n\n#define OSC_MAG\t\t2.0f\t\/\/ oscillation magnitude\n\n\nTerrainPatch::TerrainPatch(int VtxType, int NumVertices) :\n\t vtMesh(GL_TRIANGLE_STRIP, VtxType, NumVertices)\n\/\/\t vtMesh(GL_LINE_STRIP, VtxType, NumVertices)\n{\n\t\/\/ nothing more to do here\n}\n\n\/\/\n\/\/ Constructor for TerrainPatch\n\/\/\n\/\/ x and z are number of quad patches\n\/\/\nbool TerrainPatch::MakeGrid(int iXQuads, int iZQuads,\n\t\t\t\t\t\t\tfloat fXSize, float fZSize,\n\t\t\t\t\t\t\tfloat fXOffset, float fZOffset,\n\t\t\t\t\t\t\tfloat xTiling, float zTiling)\n{\n\tFPoint3\tp;\n    int\t\ti, j, iNVerts;\n\n\t\/\/ safety check\n\tif (iXQuads < 1) iXQuads = 1;\t\t\/\/ min x = 1, z = 1\n\tif (iZQuads < 1) iZQuads = 1;\t\t\/\/ min x = 1, z = 1\n\n\t\/\/ size of vertex grid is one larger than the size of the quad grid\n\tm_iXVerts = iXQuads + 1;\n\tm_iZVerts = iZQuads + 1;\n\n\tiNVerts = m_iXVerts * m_iZVerts;\n\n\tm_fXSize = fXSize;\n\tm_fZSize = fZSize;\n\n\t\/\/\n\t\/\/ Populate the quadmesh with locations, normals, and texture coordinates\n\t\/\/\n\tfor (i = 0; i < m_iXVerts; i++)\n\t{\n\t    for (j = 0; j < m_iZVerts; j++)\n\t\t{\n\t\t\tp.Set(fXOffset + i*fXSize, 0.0, fZOffset + j*fZSize);\n\t\t\tint vidx = AddVertex(p);\n\t\t\tif (GetVtxType() & VT_Normals)\n\t\t\t{\n\t\t\t\tp.x = 0.0f;\n\t\t\t\tp.y = 1.0f;\n\t\t\t\tp.z = 0.0f;\n\t\t\t\tSetVtxNormal(vidx, p);\n\t\t\t}\n\t\t\tif (GetVtxType() & VT_TexCoords)\t\t\/* compute tex coords *\/\n\t\t\t{\n\t\t\t\tFPoint2 tc((float) i\/iXQuads * xTiling,\n\t\t\t\t\t\t\t(float) j\/iZQuads * zTiling);\n\t\t\t\tSetVtxTexCoord(vidx, tc);\n\t\t\t}\n\t\t}\n\t}\n\tCreateRectangularMesh(m_iXVerts, m_iZVerts);\n    return true;\n}\n\n\nfloat dist_to_point(FPoint2 p1, FPoint2 p2)\n{\n\tFPoint2 diff = p1 - p2;\n\treturn diff.Length() \/ 3.0f;\n}\n\nvoid TerrainPatch::MoveVerticesIntoSineCurve(float fOffset)\n{\n\tint iNum = GetNumVertices();\n\n\/\/\tfloat ang;\n\tFPoint3 point;\n\tFPoint2 p1, p2(45.0f, -20.f), p3(65.0f, -55.f), base, diff;\n\tbool first = true;\n\n\tfor (int i = 0; i < iNum; i++)\n\t{\n\t\tpoint = GetVtxPos(i);\n\t\tp1.x = point.x;\n\t\tp1.y = point.z;\n\t\tpoint.y = (OSC_MAG\/2.0f) * sinf(dist_to_point(p1, p2)+fOffset) +\n\t\t\t\t(OSC_MAG\/2.0f) * sinf(dist_to_point(p1, p3)+fOffset);\n\t\tSetVtxPos(i, point);\n\t}\n\n\t\/\/ must do this for correct lighting after moving the vertex positions\n\/\/\tif (GetVtxType() & VT_Normals)\n\/\/\t\tMakeNormals();\n\n\tif (GetVtxType() & VT_Colors)\n\t\tSetVertexColors();\n}\n\n\nvoid TerrainPatch::SetVertexTextureCoords()\n{\n\tint iNum = GetNumVertices();\n\tFPoint3 p3;\n\n\tfor (int i = 0; i < iNum; i++)\n\t{\n\t\tp3 = GetVtxPos(i);\n\t\tSetVtxTexCoord(i, FPoint2(p3.x \/ 10.0f, -p3.z \/ 10.0f));\n\t}\n}\n\n\nvoid TerrainPatch::SetVertexColors()\n{\n\tint iNum = GetNumVertices();\n\tFPoint3 p3;\n\n\tfor (int i = 0; i < iNum; i++)\n\t{\n\t\tp3 = GetVtxPos(i);\n\t\tfloat r, g, b;\n\t\tif (p3.y > 0.0f)\n\t\t\tr = g = b = p3.y \/ OSC_MAG;\n\t\telse\n\t\t{\n\t\t\tr = g = 0.0f;\n\t\t\tb = (-p3.y \/ OSC_MAG);\n\t\t}\n\t\tSetVtxColor(i, RGBf(r, g, b));\n\t}\n}\n\n\n\/\/\n\/\/ Quick n' dirty elevation test for perfectly regular grid terrain\n\/\/ Find altitude (y) and surface normal, given (x,z) local coordinates\n\/\/\n\/\/ This approach is really straightforward, so it could be majorly sped up if needed\n\/\/\nbool TerrainPatch::FindAltitudeAtPoint(const FPoint3 &point, float &fAltitude,\n\t\t\t\t\t\t\t\t\t   FPoint3 *vNormal)\n{\n\tif (m_bIsFlat)\n\t{\n\t\tfAltitude = 0.0f;\n\t\tif (vNormal) vNormal->Set(0.0f, 1.0f, 0.0f);\n\t\treturn true;\n\t}\n\n\tFPoint3 porigin = GetVtxPos(0);\n\n\tint iX = (int)((point.x - porigin.x) \/ m_fXSize);\n\tint iZ = -(int)((point.z - porigin.z) \/ m_fZSize);\n\n\t\/\/ safety check\n\tif (iX < 0 || iX >= m_iXVerts-1 || iZ < 0 || iZ >= m_iZVerts-1)\n\t{\n\t\tfAltitude = 0.0f;\n\t\tif (vNormal) vNormal->Set(0.0f, 1.0f, 0.0f);\n\t\treturn false;\n\t}\n\n\tint iIndex0 = iX * m_iZVerts + iZ;\n\tint iIndex1 = iIndex0 + m_iZVerts;\n\tint iIndex2 = iIndex1 + 1;\n\tint iIndex3 = iIndex0 + 1;\n\n\tFPoint3 p0 = GetVtxPos(iIndex0);\n\tFPoint3 p1 = GetVtxPos(iIndex1);\n\tFPoint3 p2 = GetVtxPos(iIndex2);\n\tFPoint3 p3 = GetVtxPos(iIndex3);\n\n\t\/\/ find fractional amount (0..1 across quad)\n\tfloat fX = (point.x - p0.x) \/ m_fXSize;\n\tfloat fZ = -(point.z - p0.z) \/ m_fZSize;\n\n\t\/\/ which of the two triangles in the quad is it?\n\tif (fX + fZ < 1)\n\t{\n\t\tfAltitude = p0.y + fX * (p1.y - p0.y) + fZ * (p3.y - p0.y);\n\n\t\tif (vNormal)\n\t\t{\n\t\t\t\/\/ find normal also\n\t\t\tFPoint3 edge0 = p1 - p0;\n\t\t\tFPoint3 edge1 = p3 - p0;\n\t\t\t*vNormal = edge0.Cross(edge1);\n\t\t\tvNormal->Normalize();\n\t\t}\n\t}\n\telse\n\t{\n\t\tfAltitude = p2.y + (1.0f-fX) * (p3.y - p2.y) + (1.0f-fZ) * (p1.y - p2.y);\n\n\t\tif (vNormal)\n\t\t{\n\t\t\t\/\/ find normal also\n\t\t\tFPoint3 edge0 = p3 - p2;\n\t\t\tFPoint3 edge1 = p1 - p2;\n\t\t\t*vNormal = edge0.Cross(edge1);\n\t\t\tvNormal->Normalize();\n\t\t}\n\t}\n\treturn true;\n}\n\nvtMovGeom *CreatePlaneMGeom(vtMaterialArray *pMats, int iMatIdx,\n\t\t\t\t\t\t\tFPoint2 org, FPoint2 size,\n\t\t\t\t\t\t\tfloat xTiling, float zTiling, int steps)\n{\n\tvtGeom *pGeom = new vtGeom();\n\tTerrainPatch *geo = new TerrainPatch(VT_Normals | VT_TexCoords, steps * steps);\n\tgeo->MakeGrid(steps, steps, size.x\/steps, size.y\/steps,\n\t\torg.x, org.y,\n\t\txTiling, zTiling);\t\t\/\/ tiling\n\tpGeom->SetMaterials(pMats);\n\tpGeom->AddMesh(geo, iMatIdx);\n\treturn new vtMovGeom(pGeom);\n}\n\n<commit_msg>whitespace<commit_after>\/\/\n\/\/ TerrainPatch.cpp\n\/\/\n\/\/ Copyright (c) 2001 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n#include \"vtlib\/vtlib.h\"\n#include \"TerrainPatch.h\"\n\n#define OSC_MAG\t\t2.0f\t\/\/ oscillation magnitude\n\n\nTerrainPatch::TerrainPatch(int VtxType, int NumVertices) :\n\t vtMesh(GL_TRIANGLE_STRIP, VtxType, NumVertices)\n\/\/\t vtMesh(GL_LINE_STRIP, VtxType, NumVertices)\n{\n\t\/\/ nothing more to do here\n}\n\n\/\/\n\/\/ Constructor for TerrainPatch\n\/\/\n\/\/ x and z are number of quad patches\n\/\/\nbool TerrainPatch::MakeGrid(int iXQuads, int iZQuads,\n\t\t\t\t\t\t\tfloat fXSize, float fZSize,\n\t\t\t\t\t\t\tfloat fXOffset, float fZOffset,\n\t\t\t\t\t\t\tfloat xTiling, float zTiling)\n{\n\tFPoint3\tp;\n\tint\t\ti, j, iNVerts;\n\n\t\/\/ safety check\n\tif (iXQuads < 1) iXQuads = 1;\t\t\/\/ min x = 1, z = 1\n\tif (iZQuads < 1) iZQuads = 1;\t\t\/\/ min x = 1, z = 1\n\n\t\/\/ size of vertex grid is one larger than the size of the quad grid\n\tm_iXVerts = iXQuads + 1;\n\tm_iZVerts = iZQuads + 1;\n\n\tiNVerts = m_iXVerts * m_iZVerts;\n\n\tm_fXSize = fXSize;\n\tm_fZSize = fZSize;\n\n\t\/\/\n\t\/\/ Populate the quadmesh with locations, normals, and texture coordinates\n\t\/\/\n\tfor (i = 0; i < m_iXVerts; i++)\n\t{\n\t\tfor (j = 0; j < m_iZVerts; j++)\n\t\t{\n\t\t\tp.Set(fXOffset + i*fXSize, 0.0, fZOffset + j*fZSize);\n\t\t\tint vidx = AddVertex(p);\n\t\t\tif (GetVtxType() & VT_Normals)\n\t\t\t{\n\t\t\t\tp.x = 0.0f;\n\t\t\t\tp.y = 1.0f;\n\t\t\t\tp.z = 0.0f;\n\t\t\t\tSetVtxNormal(vidx, p);\n\t\t\t}\n\t\t\tif (GetVtxType() & VT_TexCoords)\t\t\/* compute tex coords *\/\n\t\t\t{\n\t\t\t\tFPoint2 tc((float) i\/iXQuads * xTiling,\n\t\t\t\t\t\t\t(float) j\/iZQuads * zTiling);\n\t\t\t\tSetVtxTexCoord(vidx, tc);\n\t\t\t}\n\t\t}\n\t}\n\tCreateRectangularMesh(m_iXVerts, m_iZVerts);\n\treturn true;\n}\n\n\nfloat dist_to_point(FPoint2 p1, FPoint2 p2)\n{\n\tFPoint2 diff = p1 - p2;\n\treturn diff.Length() \/ 3.0f;\n}\n\nvoid TerrainPatch::MoveVerticesIntoSineCurve(float fOffset)\n{\n\tint iNum = GetNumVertices();\n\n\/\/\tfloat ang;\n\tFPoint3 point;\n\tFPoint2 p1, p2(45.0f, -20.f), p3(65.0f, -55.f), base, diff;\n\tbool first = true;\n\n\tfor (int i = 0; i < iNum; i++)\n\t{\n\t\tpoint = GetVtxPos(i);\n\t\tp1.x = point.x;\n\t\tp1.y = point.z;\n\t\tpoint.y = (OSC_MAG\/2.0f) * sinf(dist_to_point(p1, p2)+fOffset) +\n\t\t\t\t(OSC_MAG\/2.0f) * sinf(dist_to_point(p1, p3)+fOffset);\n\t\tSetVtxPos(i, point);\n\t}\n\n\t\/\/ must do this for correct lighting after moving the vertex positions\n\/\/\tif (GetVtxType() & VT_Normals)\n\/\/\t\tMakeNormals();\n\n\tif (GetVtxType() & VT_Colors)\n\t\tSetVertexColors();\n}\n\n\nvoid TerrainPatch::SetVertexTextureCoords()\n{\n\tint iNum = GetNumVertices();\n\tFPoint3 p3;\n\n\tfor (int i = 0; i < iNum; i++)\n\t{\n\t\tp3 = GetVtxPos(i);\n\t\tSetVtxTexCoord(i, FPoint2(p3.x \/ 10.0f, -p3.z \/ 10.0f));\n\t}\n}\n\n\nvoid TerrainPatch::SetVertexColors()\n{\n\tint iNum = GetNumVertices();\n\tFPoint3 p3;\n\n\tfor (int i = 0; i < iNum; i++)\n\t{\n\t\tp3 = GetVtxPos(i);\n\t\tfloat r, g, b;\n\t\tif (p3.y > 0.0f)\n\t\t\tr = g = b = p3.y \/ OSC_MAG;\n\t\telse\n\t\t{\n\t\t\tr = g = 0.0f;\n\t\t\tb = (-p3.y \/ OSC_MAG);\n\t\t}\n\t\tSetVtxColor(i, RGBf(r, g, b));\n\t}\n}\n\n\n\/\/\n\/\/ Quick n' dirty elevation test for perfectly regular grid terrain\n\/\/ Find altitude (y) and surface normal, given (x,z) local coordinates\n\/\/\n\/\/ This approach is really straightforward, so it could be majorly sped up if needed\n\/\/\nbool TerrainPatch::FindAltitudeAtPoint(const FPoint3 &point, float &fAltitude,\n\t\t\t\t\t\t\t\t\t   FPoint3 *vNormal)\n{\n\tif (m_bIsFlat)\n\t{\n\t\tfAltitude = 0.0f;\n\t\tif (vNormal) vNormal->Set(0.0f, 1.0f, 0.0f);\n\t\treturn true;\n\t}\n\n\tFPoint3 porigin = GetVtxPos(0);\n\n\tint iX = (int)((point.x - porigin.x) \/ m_fXSize);\n\tint iZ = -(int)((point.z - porigin.z) \/ m_fZSize);\n\n\t\/\/ safety check\n\tif (iX < 0 || iX >= m_iXVerts-1 || iZ < 0 || iZ >= m_iZVerts-1)\n\t{\n\t\tfAltitude = 0.0f;\n\t\tif (vNormal) vNormal->Set(0.0f, 1.0f, 0.0f);\n\t\treturn false;\n\t}\n\n\tint iIndex0 = iX * m_iZVerts + iZ;\n\tint iIndex1 = iIndex0 + m_iZVerts;\n\tint iIndex2 = iIndex1 + 1;\n\tint iIndex3 = iIndex0 + 1;\n\n\tFPoint3 p0 = GetVtxPos(iIndex0);\n\tFPoint3 p1 = GetVtxPos(iIndex1);\n\tFPoint3 p2 = GetVtxPos(iIndex2);\n\tFPoint3 p3 = GetVtxPos(iIndex3);\n\n\t\/\/ find fractional amount (0..1 across quad)\n\tfloat fX = (point.x - p0.x) \/ m_fXSize;\n\tfloat fZ = -(point.z - p0.z) \/ m_fZSize;\n\n\t\/\/ which of the two triangles in the quad is it?\n\tif (fX + fZ < 1)\n\t{\n\t\tfAltitude = p0.y + fX * (p1.y - p0.y) + fZ * (p3.y - p0.y);\n\n\t\tif (vNormal)\n\t\t{\n\t\t\t\/\/ find normal also\n\t\t\tFPoint3 edge0 = p1 - p0;\n\t\t\tFPoint3 edge1 = p3 - p0;\n\t\t\t*vNormal = edge0.Cross(edge1);\n\t\t\tvNormal->Normalize();\n\t\t}\n\t}\n\telse\n\t{\n\t\tfAltitude = p2.y + (1.0f-fX) * (p3.y - p2.y) + (1.0f-fZ) * (p1.y - p2.y);\n\n\t\tif (vNormal)\n\t\t{\n\t\t\t\/\/ find normal also\n\t\t\tFPoint3 edge0 = p3 - p2;\n\t\t\tFPoint3 edge1 = p1 - p2;\n\t\t\t*vNormal = edge0.Cross(edge1);\n\t\t\tvNormal->Normalize();\n\t\t}\n\t}\n\treturn true;\n}\n\nvtMovGeom *CreatePlaneMGeom(vtMaterialArray *pMats, int iMatIdx,\n\t\t\t\t\t\t\tFPoint2 org, FPoint2 size,\n\t\t\t\t\t\t\tfloat xTiling, float zTiling, int steps)\n{\n\tvtGeom *pGeom = new vtGeom();\n\tTerrainPatch *geo = new TerrainPatch(VT_Normals | VT_TexCoords, steps * steps);\n\tgeo->MakeGrid(steps, steps, size.x\/steps, size.y\/steps,\n\t\torg.x, org.y,\n\t\txTiling, zTiling);\t\t\/\/ tiling\n\tpGeom->SetMaterials(pMats);\n\tpGeom->AddMesh(geo, iMatIdx);\n\treturn new vtMovGeom(pGeom);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\n\/\/ Qt includes\n#include <QtGlobal>\n#include <QStringList>\n#include <QRegExp>\n\n\/\/ Visomics includes\n#include \"voUtils.h\"\n\n\/\/ VTK includes\n#include <vtkDoubleArray.h>\n#include <vtkIntArray.h>\n#include <vtkNew.h>\n#include <vtkSmartPointer.h>\n#include <vtkStringArray.h>\n#include <vtkTable.h>\n#include <vtkVariantArray.h>\n\n#include <QDebug>\n\nnamespace\n{\n\/\/----------------------------------------------------------------------------\ntemplate<typename ArrayType, typename ValueType>\nbool transposeColumn(vtkTable* srcTable, vtkTable* destTable, int columnId, bool useVariant = false)\n{\n  if (!srcTable || !destTable)\n    {\n    return false;\n    }\n  if (columnId < 0 || columnId >= srcTable->GetNumberOfColumns())\n    {\n    return false;\n    }\n  vtkAbstractArray * column = srcTable->GetColumn(columnId);\n  ArrayType * typeColumn = ArrayType::SafeDownCast(column);\n  if (!typeColumn && !useVariant)\n    {\n    return false;\n    }\n\n  for (int rid = 0; rid < column->GetNumberOfTuples() * column->GetNumberOfComponents(); ++rid)\n    {\n    vtkSmartPointer<ArrayType> transposedColumn;\n    if (columnId == 0)\n      {\n      transposedColumn = vtkSmartPointer<ArrayType>::New();\n      transposedColumn->SetNumberOfValues(srcTable->GetNumberOfColumns());\n      destTable->AddColumn(transposedColumn);\n      }\n    else\n      {\n      transposedColumn = ArrayType::SafeDownCast(destTable->GetColumn(rid));\n      }\n    Q_ASSERT(transposedColumn);\n    if (!useVariant)\n      {\n      ValueType value = typeColumn->GetValue(rid);\n      transposedColumn->SetValue(columnId, value);\n      }\n    else\n      {\n      vtkVariant value = column->GetVariantValue(rid);\n      transposedColumn->SetVariantValue(columnId, value);\n      }\n    }\n  return true;\n}\n}\n\n\/\/----------------------------------------------------------------------------\nbool voUtils::transposeTable(vtkTable* srcTable, vtkTable* destTable)\n{\n  if (!srcTable)\n    {\n    return false;\n    }\n\n  if (!destTable)\n    {\n    return false;\n    }\n\n  if (srcTable->GetNumberOfColumns() == 0)\n    {\n    return true;\n    }\n\n  bool useVariant = false;\n  vtkAbstractArray * firstColumn = srcTable->GetColumn(0);\n  for (int cid = 1; cid < srcTable->GetNumberOfColumns(); ++cid)\n    {\n    if (qstrcmp(firstColumn->GetClassName(), srcTable->GetColumn(cid)->GetClassName()) != 0)\n      {\n      useVariant = true;\n      break;\n      }\n    }\n\n  for(int cid = 0; cid < srcTable->GetNumberOfColumns(); ++cid)\n    {\n    if (!useVariant)\n      {\n      if (!transposeColumn<vtkDoubleArray, double>(srcTable, destTable, cid))\n        {\n        if (!transposeColumn<vtkIntArray, int>(srcTable, destTable, cid))\n          {\n          if (!transposeColumn<vtkStringArray, vtkStdString>(srcTable, destTable, cid))\n            {\n            if (!transposeColumn<vtkVariantArray, vtkVariant>(srcTable, destTable, cid))\n              {\n              return false;\n              }\n            }\n          }\n        }\n      }\n    else\n      {\n      if (!transposeColumn<vtkVariantArray, vtkVariant>(srcTable, destTable, cid, useVariant))\n        {\n        return false;\n        }\n      }\n    }\n\n  return true;\n}\n\n\/\/----------------------------------------------------------------------------\nbool voUtils::transposeTable(vtkTable* table)\n{\n  vtkNew<vtkTable> transposedTable;\n  bool success = voUtils::transposeTable(table, transposedTable.GetPointer());\n  if (!success)\n    {\n    return false;\n    }\n  table->ShallowCopy(transposedTable.GetPointer());\n  return true;\n}\n\n\/\/----------------------------------------------------------------------------\nbool voUtils::insertColumnIntoTable(vtkTable * table, int position, vtkAbstractArray * columnToInsert)\n{\n  if (!table)\n    {\n    return false;\n    }\n  if (!columnToInsert)\n    {\n    return false;\n    }\n  if (table->GetNumberOfRows() != columnToInsert->GetNumberOfComponents() * columnToInsert->GetNumberOfTuples())\n    {\n    return false;\n    }\n  if (position < 0)\n    {\n    position = 0;\n    }\n  if (position > table->GetNumberOfColumns())\n    {\n    position = table->GetNumberOfColumns();\n    }\n\n  vtkNew<vtkTable> updatedTable;\n  for (int cid = 0; cid < table->GetNumberOfColumns(); ++cid)\n    {\n    vtkAbstractArray * column = table->GetColumn(cid);\n    Q_ASSERT(column);\n    if (cid == position)\n      {\n      updatedTable->AddColumn(columnToInsert);\n      }\n    updatedTable->AddColumn(column);\n    }\n  if (position == table->GetNumberOfColumns())\n    {\n    updatedTable->AddColumn(columnToInsert);\n    }\n  table->ShallowCopy(updatedTable.GetPointer());\n  return true;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid voUtils::setTableColumnNames(vtkTable * table, vtkStringArray * columnNames)\n{\n  if (!table)\n    {\n    return;\n    }\n  if (!columnNames)\n    {\n    return;\n    }\n\n  for (int cid = 0; cid < table->GetNumberOfColumns() && cid < columnNames->GetNumberOfValues(); ++cid)\n    {\n    vtkAbstractArray * column = table->GetColumn(cid);\n    Q_ASSERT(column);\n    column->SetName(columnNames->GetValue(cid));\n    }\n}\n\n\/\/----------------------------------------------------------------------------\nbool voUtils::parseRangeString(const QString& rangeString, QList<int>& rangeList, bool alpha)\n{\n  if(!rangeList.empty())\n    {\n    return false;\n    }\n\n  \/\/Validate - checks for form, not semantics\n  QRegExp validRegEx;\n  if (!alpha) \/\/ Numbers\n    {\n    validRegEx.setPattern(\"^\\\\s*(\\\\d+\\\\s*[-,]\\\\s*)*\\\\d+\\\\s*$\");\n    }\n  else \/\/ Letters\n    {\n    validRegEx.setPattern(\"^\\\\s*([A-Z]+\\\\s*[-,]\\\\s*)*[A-Z]+\\\\s*$\");\n    validRegEx.setCaseSensitivity(Qt::CaseInsensitive);\n    }\n  if(!validRegEx.exactMatch(rangeString))\n    {\n    return false;\n    }\n\n  \/\/Parse\n  QString scratchString(rangeString);\n  scratchString.replace(\" \", \"\");\n  QStringList rangeStringList = scratchString.split(\",\");\n  rangeStringList.removeDuplicates();\n\n  QRegExp rangeRegEx;\n  if (!alpha)\n    {\n    rangeRegEx.setPattern(\"^(\\\\d+)-(\\\\d+)$\");\n    }\n  else\n    {\n    rangeRegEx.setPattern(\"^([A-Z]+)-([A-Z]+)$\");\n    rangeRegEx.setCaseSensitivity(Qt::CaseInsensitive);\n    }\n  foreach(const QString& subStr, rangeStringList)\n    {\n    if(rangeRegEx.indexIn(subStr) != -1)\n      {\n      int subBegin;\n      int subEnd;\n      if (!alpha)\n        {\n        subBegin = rangeRegEx.cap(1).toInt() - 1;\n        subEnd = rangeRegEx.cap(2).toInt() - 1;\n        }\n      else\n        {\n        subBegin = voUtils::counterAlphaToInt(rangeRegEx.cap(1));\n        subEnd = voUtils::counterAlphaToInt(rangeRegEx.cap(2));\n        }\n      for(int subCtr = subBegin; subCtr <= subEnd; subCtr++)\n        {\n        rangeList.push_back(subCtr);\n        }\n      }\n    else\n      {\n      if (!alpha)\n        {\n        rangeList.push_back(subStr.toInt() - 1);\n        }\n      else\n        {\n        rangeList.push_back(subStr.toUpper().at(0).toLatin1() - 'A');\n        }\n      }\n    }\n\n  return true;\n}\n\n\/\/----------------------------------------------------------------------------\nQString voUtils::counterIntToAlpha(int intVal)\n{\n  if (intVal < 0)\n    {\n    return QString();\n    }\n  else if (intVal < 26)\n    {\n    return QString(QChar('A' + intVal));\n    }\n  else\n    {\n    return voUtils::counterIntToAlpha((intVal \/ 26) - 1) + voUtils::counterIntToAlpha(intVal % 26);\n    }\n}\n\n\/\/----------------------------------------------------------------------------\nint voUtils::counterAlphaToInt(const QString& alphaVal)\n{\n  if (alphaVal.length() < 1)\n    {\n    return -1;\n    }\n  else if (alphaVal.length() == 1)\n    {\n    return static_cast<int>(alphaVal.toUpper().at(0).toLatin1() - 'A');\n    }\n  else\n    {\n    return (voUtils::counterAlphaToInt(alphaVal.mid(0, alphaVal.length()-1)) + 1) * 26\n           + voUtils::counterAlphaToInt(alphaVal.mid(alphaVal.length()-1));\n    }\n}\n\n<commit_msg>Fix comment style<commit_after>\n\/\/ Qt includes\n#include <QtGlobal>\n#include <QStringList>\n#include <QRegExp>\n\n\/\/ Visomics includes\n#include \"voUtils.h\"\n\n\/\/ VTK includes\n#include <vtkDoubleArray.h>\n#include <vtkIntArray.h>\n#include <vtkNew.h>\n#include <vtkSmartPointer.h>\n#include <vtkStringArray.h>\n#include <vtkTable.h>\n#include <vtkVariantArray.h>\n\n#include <QDebug>\n\nnamespace\n{\n\/\/----------------------------------------------------------------------------\ntemplate<typename ArrayType, typename ValueType>\nbool transposeColumn(vtkTable* srcTable, vtkTable* destTable, int columnId, bool useVariant = false)\n{\n  if (!srcTable || !destTable)\n    {\n    return false;\n    }\n  if (columnId < 0 || columnId >= srcTable->GetNumberOfColumns())\n    {\n    return false;\n    }\n  vtkAbstractArray * column = srcTable->GetColumn(columnId);\n  ArrayType * typeColumn = ArrayType::SafeDownCast(column);\n  if (!typeColumn && !useVariant)\n    {\n    return false;\n    }\n\n  for (int rid = 0; rid < column->GetNumberOfTuples() * column->GetNumberOfComponents(); ++rid)\n    {\n    vtkSmartPointer<ArrayType> transposedColumn;\n    if (columnId == 0)\n      {\n      transposedColumn = vtkSmartPointer<ArrayType>::New();\n      transposedColumn->SetNumberOfValues(srcTable->GetNumberOfColumns());\n      destTable->AddColumn(transposedColumn);\n      }\n    else\n      {\n      transposedColumn = ArrayType::SafeDownCast(destTable->GetColumn(rid));\n      }\n    Q_ASSERT(transposedColumn);\n    if (!useVariant)\n      {\n      ValueType value = typeColumn->GetValue(rid);\n      transposedColumn->SetValue(columnId, value);\n      }\n    else\n      {\n      vtkVariant value = column->GetVariantValue(rid);\n      transposedColumn->SetVariantValue(columnId, value);\n      }\n    }\n  return true;\n}\n}\n\n\/\/----------------------------------------------------------------------------\nbool voUtils::transposeTable(vtkTable* srcTable, vtkTable* destTable)\n{\n  if (!srcTable)\n    {\n    return false;\n    }\n\n  if (!destTable)\n    {\n    return false;\n    }\n\n  if (srcTable->GetNumberOfColumns() == 0)\n    {\n    return true;\n    }\n\n  bool useVariant = false;\n  vtkAbstractArray * firstColumn = srcTable->GetColumn(0);\n  for (int cid = 1; cid < srcTable->GetNumberOfColumns(); ++cid)\n    {\n    if (qstrcmp(firstColumn->GetClassName(), srcTable->GetColumn(cid)->GetClassName()) != 0)\n      {\n      useVariant = true;\n      break;\n      }\n    }\n\n  for(int cid = 0; cid < srcTable->GetNumberOfColumns(); ++cid)\n    {\n    if (!useVariant)\n      {\n      if (!transposeColumn<vtkDoubleArray, double>(srcTable, destTable, cid))\n        {\n        if (!transposeColumn<vtkIntArray, int>(srcTable, destTable, cid))\n          {\n          if (!transposeColumn<vtkStringArray, vtkStdString>(srcTable, destTable, cid))\n            {\n            if (!transposeColumn<vtkVariantArray, vtkVariant>(srcTable, destTable, cid))\n              {\n              return false;\n              }\n            }\n          }\n        }\n      }\n    else\n      {\n      if (!transposeColumn<vtkVariantArray, vtkVariant>(srcTable, destTable, cid, useVariant))\n        {\n        return false;\n        }\n      }\n    }\n\n  return true;\n}\n\n\/\/----------------------------------------------------------------------------\nbool voUtils::transposeTable(vtkTable* table)\n{\n  vtkNew<vtkTable> transposedTable;\n  bool success = voUtils::transposeTable(table, transposedTable.GetPointer());\n  if (!success)\n    {\n    return false;\n    }\n  table->ShallowCopy(transposedTable.GetPointer());\n  return true;\n}\n\n\/\/----------------------------------------------------------------------------\nbool voUtils::insertColumnIntoTable(vtkTable * table, int position, vtkAbstractArray * columnToInsert)\n{\n  if (!table)\n    {\n    return false;\n    }\n  if (!columnToInsert)\n    {\n    return false;\n    }\n  if (table->GetNumberOfRows() != columnToInsert->GetNumberOfComponents() * columnToInsert->GetNumberOfTuples())\n    {\n    return false;\n    }\n  if (position < 0)\n    {\n    position = 0;\n    }\n  if (position > table->GetNumberOfColumns())\n    {\n    position = table->GetNumberOfColumns();\n    }\n\n  vtkNew<vtkTable> updatedTable;\n  for (int cid = 0; cid < table->GetNumberOfColumns(); ++cid)\n    {\n    vtkAbstractArray * column = table->GetColumn(cid);\n    Q_ASSERT(column);\n    if (cid == position)\n      {\n      updatedTable->AddColumn(columnToInsert);\n      }\n    updatedTable->AddColumn(column);\n    }\n  if (position == table->GetNumberOfColumns())\n    {\n    updatedTable->AddColumn(columnToInsert);\n    }\n  table->ShallowCopy(updatedTable.GetPointer());\n  return true;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid voUtils::setTableColumnNames(vtkTable * table, vtkStringArray * columnNames)\n{\n  if (!table)\n    {\n    return;\n    }\n  if (!columnNames)\n    {\n    return;\n    }\n\n  for (int cid = 0; cid < table->GetNumberOfColumns() && cid < columnNames->GetNumberOfValues(); ++cid)\n    {\n    vtkAbstractArray * column = table->GetColumn(cid);\n    Q_ASSERT(column);\n    column->SetName(columnNames->GetValue(cid));\n    }\n}\n\n\/\/----------------------------------------------------------------------------\nbool voUtils::parseRangeString(const QString& rangeString, QList<int>& rangeList, bool alpha)\n{\n  if(!rangeList.empty())\n    {\n    return false;\n    }\n\n  \/\/ Validate - checks for form, not semantics\n  QRegExp validRegEx;\n  if (!alpha) \/\/ Numbers\n    {\n    validRegEx.setPattern(\"^\\\\s*(\\\\d+\\\\s*[-,]\\\\s*)*\\\\d+\\\\s*$\");\n    }\n  else \/\/ Letters\n    {\n    validRegEx.setPattern(\"^\\\\s*([A-Z]+\\\\s*[-,]\\\\s*)*[A-Z]+\\\\s*$\");\n    validRegEx.setCaseSensitivity(Qt::CaseInsensitive);\n    }\n  if(!validRegEx.exactMatch(rangeString))\n    {\n    return false;\n    }\n\n  \/\/ Parse\n  QString scratchString(rangeString);\n  scratchString.replace(\" \", \"\");\n  QStringList rangeStringList = scratchString.split(\",\");\n  rangeStringList.removeDuplicates();\n\n  QRegExp rangeRegEx;\n  if (!alpha)\n    {\n    rangeRegEx.setPattern(\"^(\\\\d+)-(\\\\d+)$\");\n    }\n  else\n    {\n    rangeRegEx.setPattern(\"^([A-Z]+)-([A-Z]+)$\");\n    rangeRegEx.setCaseSensitivity(Qt::CaseInsensitive);\n    }\n  foreach(const QString& subStr, rangeStringList)\n    {\n    if(rangeRegEx.indexIn(subStr) != -1)\n      {\n      int subBegin;\n      int subEnd;\n      if (!alpha)\n        {\n        subBegin = rangeRegEx.cap(1).toInt() - 1;\n        subEnd = rangeRegEx.cap(2).toInt() - 1;\n        }\n      else\n        {\n        subBegin = voUtils::counterAlphaToInt(rangeRegEx.cap(1));\n        subEnd = voUtils::counterAlphaToInt(rangeRegEx.cap(2));\n        }\n      for(int subCtr = subBegin; subCtr <= subEnd; subCtr++)\n        {\n        rangeList.push_back(subCtr);\n        }\n      }\n    else\n      {\n      if (!alpha)\n        {\n        rangeList.push_back(subStr.toInt() - 1);\n        }\n      else\n        {\n        rangeList.push_back(subStr.toUpper().at(0).toLatin1() - 'A');\n        }\n      }\n    }\n\n  return true;\n}\n\n\/\/----------------------------------------------------------------------------\nQString voUtils::counterIntToAlpha(int intVal)\n{\n  if (intVal < 0)\n    {\n    return QString();\n    }\n  else if (intVal < 26)\n    {\n    return QString(QChar('A' + intVal));\n    }\n  else\n    {\n    return voUtils::counterIntToAlpha((intVal \/ 26) - 1) + voUtils::counterIntToAlpha(intVal % 26);\n    }\n}\n\n\/\/----------------------------------------------------------------------------\nint voUtils::counterAlphaToInt(const QString& alphaVal)\n{\n  if (alphaVal.length() < 1)\n    {\n    return -1;\n    }\n  else if (alphaVal.length() == 1)\n    {\n    return static_cast<int>(alphaVal.toUpper().at(0).toLatin1() - 'A');\n    }\n  else\n    {\n    return (voUtils::counterAlphaToInt(alphaVal.mid(0, alphaVal.length()-1)) + 1) * 26\n           + voUtils::counterAlphaToInt(alphaVal.mid(alphaVal.length()-1));\n    }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"BitSharesApp.hpp\"\n\n#include \"html5viewer\/html5viewer.h\"\n#include \"ClientWrapper.hpp\"\n#include \"Utilities.hpp\"\n#include \"MainWindow.hpp\"\n\n#include <boost\/thread.hpp>\n#include <bts\/blockchain\/config.hpp>\n#include <bts\/wallet\/url.hpp>\n#include <signal.h>\n\n#include <QSettings>\n#include <QPixmap>\n#include <QErrorMessage>\n#include <QSplashScreen>\n#include <QDir>\n#include <QWebSettings>\n#include <QWebPage>\n#include <QWebFrame>\n#include <QJsonDocument>\n#include <QGraphicsWebView>\n#include <QTimer>\n#include <QAuthenticator>\n#include <QNetworkReply>\n#include <QResource>\n#include <QGraphicsWidget>\n#include <QMainWindow>\n#include <QMenuBar>\n#include <QLayout>\n#include <QLocalSocket>\n#include <QLocalServer>\n#include <QMessageBox>\n#include <QProxyStyle>\n#include <QComboBox>\n#include <QTemporaryFile>\n\n#include <boost\/program_options.hpp>\n\n#include <bts\/client\/client.hpp>\n#include <bts\/net\/upnp.hpp>\n#include <bts\/blockchain\/chain_database.hpp>\n#include <bts\/rpc\/rpc_server.hpp>\n#include <bts\/cli\/cli.hpp>\n#include <bts\/utilities\/git_revision.hpp>\n#include <fc\/filesystem.hpp>\n#include <fc\/thread\/thread.hpp>\n#include <fc\/log\/file_appender.hpp>\n#include <fc\/log\/logger_config.hpp>\n#include <fc\/io\/json.hpp>\n#include <fc\/reflect\/variant.hpp>\n#include <fc\/git_revision.hpp>\n#include <fc\/io\/json.hpp>\n#include <fc\/log\/logger_config.hpp>\n#include <fc\/signals.hpp>\n\n#include <boost\/iostreams\/tee.hpp>\n#include <boost\/iostreams\/stream.hpp>\n\n#include <fstream>\n#include <iostream>\n#include <iomanip>\n\n#ifdef WIN32\n\n  #define APP_TRY \/*try*\/\n  #define APP_CATCH \/*Nothing*\/\n\n  #ifdef NDEBUG \/\/ enable crashrpt win32 release only\n  #include \"..\/..\/CrashRpt\/include\/CrashRpt.h\"\n\n  \/* forwards SEH caught by fc's async tasks to CrashRpt *\/\n  int unhandled_exception_filter(unsigned code, _EXCEPTION_POINTERS* info)\n  {\n    return crExceptionFilter(code, info);\n  }\n\n  void installCrashRptHandler(const char* appName, const char* appVersion, const QFile& logFilePath)\n  {\n    \/\/ Define CrashRpt configuration parameters\n    CR_INSTALL_INFO info = { 0 };\n    info.cb = sizeof(CR_INSTALL_INFO);\n    info.pszAppName = appName;\n    info.pszAppVersion = appVersion;\n    info.pszEmailSubject = nullptr;\n    info.pszEmailTo = \"sales@syncad.com\";\n    info.pszUrl = \"http:\/\/invictus.syncad.com\/crash_report.html\";\n    info.uPriorities[CR_HTTP] = 3;  \/\/ First try send report over HTTP \n    info.uPriorities[CR_SMTP] = 2;  \/\/ Second try send report over SMTP  \n    info.uPriorities[CR_SMAPI] = 1; \/\/ Third try send report over Simple MAPI    \n    \/\/ Install all available exception handlers\n    info.dwFlags = CR_INST_ALL_POSSIBLE_HANDLERS |\n                   CR_INST_CRT_EXCEPTION_HANDLERS |\n                   CR_INST_AUTO_THREAD_HANDLERS |\n                   CR_INST_SEND_QUEUED_REPORTS;\n    \/\/ Define the Privacy Policy URL \n    info.pszPrivacyPolicyURL = \"http:\/\/invictus.syncad.com\/crash_privacy.html\";\n\n    \/\/ Install crash reporting\n    int nResult = crInstall(&info);\n    if (nResult != 0)\n    {\n      \/\/ Something goes wrong. Get error message.\n      char szErrorMsg[512] = { 0 };\n      crGetLastErrorMsg(szErrorMsg, 512);\n      elog(\"Cannot install CrsshRpt error handler: ${e}\", (\"e\", szErrorMsg));\n      return;\n    }\n    else\n    {\n      wlog(\"CrashRpt handler installed successfully\");\n    }\n\n    auto logPathString = logFilePath.fileName().toStdString();\n\n    \/\/ Add our log file to the error report\n    crAddFile2(logPathString.c_str(), NULL, \"Log File\", CR_AF_MAKE_FILE_COPY);\n\n    \/\/ We want the screenshot of the entire desktop is to be added on crash\n    crAddScreenshot2(CR_AS_PROCESS_WINDOWS | CR_AS_USE_JPEG_FORMAT, 0);\n\n    fc::set_unhandled_structured_exception_filter(&unhandled_exception_filter);\n  }\n\n  void uninstallCrashRptHandler()\n  {\n    crUninstall();\n  }\n\n#endif \/\/ NDEBUG\n#else \/\/ WIN32\n\n  #define APP_TRY try\n  #define APP_CATCH \\\n    catch(const fc::exception& e) \\\n    {\\\n    onExceptionCaught(e);\\\n    }\\\n    catch(...)\\\n    {\\\n    onUnknownExceptionCaught();\\\n    }\n#endif\n\n#if !defined(WIN32) || !defined(NDEBUG)\n  void installCrashRptHandler(const char* appName, const char* appVersion, const QFile& logFilePath)\n  {\n    \/\/\/ Nothing to do here since no crash report support available\n  }\n\n  void uninstallCrashRptHandler()\n  {\n    \/\/\/ Nothing to do here since no crash report support available\n  }\n#endif\n\n\nBitSharesApp* BitSharesApp::_instance = nullptr;\n\n#define APP_NAME \"BitSharesXT\"\n\nstatic std::string CreateBitSharesVersionNumberString()\n{\n  std::ostringstream versionNumberStream;\n  \/\/\/ TODO auto incrementing version\n  versionNumberStream << 0 << \".\" << 4 << \".\" << 1;\n  \/\/versionNumberStream << VERSION_MAJOR << \".\" << VERSION_MINOR << \".\" << VERSION_PATCH;\n  return versionNumberStream.str();\n}\n\nQTemporaryFile gLogFile;\n\nvoid ConfigureLoggingToTemporaryFile()\n{\n  \/\/create log file in temporary dir that lasts after application exits\n  gLogFile.setAutoRemove(false);\n  gLogFile.open();\n  gLogFile.close();\n\n  \/\/configure logger to also write to log file\n  fc::file_appender::config ac;\n  \/** \\warning Use wstring to construct log file name since %TEMP% can point to path containing\n  native chars.\n  *\/\n  ac.filename = gLogFile.fileName().toStdWString();\n  ac.truncate = false;\n  ac.flush = true;\n  fc::logger::get().add_appender(fc::shared_ptr<fc::file_appender>(new fc::file_appender(fc::variant(ac))));\n}\n\nBitSharesApp::BitSharesApp(int& argc, char** argv)\n  :QApplication(argc, argv)\n{\n  assert(_instance == nullptr && \"Only one instance allowed at time\");\n  _instance = this;\n\n  QApplication::setWindowIcon(QIcon(\":\/images\/qtapp.ico\"));\n}\n\nBitSharesApp::~BitSharesApp()\n{\n  assert(_instance == this && \"Only one instance allowed at time\");\n  _instance = nullptr;\n}\n\nint BitSharesApp::run(int& argc, char** argv)\n{\n  ConfigureLoggingToTemporaryFile();\n\n  installCrashRptHandler(APP_NAME, CreateBitSharesVersionNumberString().c_str(), gLogFile);\n\n  BitSharesApp app(argc, argv);\n  int ec = app.run();\n\n  uninstallCrashRptHandler();\n\n  return ec;\n}\n\nint BitSharesApp::run()\n{\n  setOrganizationName(\"BitShares\");\n  setOrganizationDomain(\"bitshares.org\");\n  setApplicationName(BTS_BLOCKCHAIN_NAME);\n\n  \/\/This works around Qt bug 22410, which causes a crash when repeatedly clicking a QComboBox\n  class CrashWorkaroundStyle : public QProxyStyle {\n  public: virtual int styleHint(StyleHint hint, const QStyleOption *option = 0,\n    const QWidget *widget = 0, QStyleHintReturn *returnData = 0) const{\n    if (hint == QStyle::SH_Menu_FlashTriggeredItem)\n      return 0;\n    return QProxyStyle::styleHint(hint, option, widget, returnData);\n  }\n  };\n  setStyle(new CrashWorkaroundStyle);\n\n  MainWindow mainWindow;\n  installEventFilter(&mainWindow);\n\n  \/\/We'll go ahead and leave Win\/Lin URL handling available in OSX too\n  QLocalSocket* sock = new QLocalSocket();\n  sock->connectToServer(BTS_BLOCKCHAIN_NAME);\n  if (sock->waitForConnected(100))\n  {\n    if (arguments().size() > 1 && \n        arguments()[1].startsWith(QString(CUSTOM_URL_SCHEME) + \":\"))\n    {\n      \/\/Need to open a custom URL. Pass it to pre-existing instance.\n      std::cout << \"Found instance already running. Sending message and exiting.\" << std::endl;\n      sock->write( arguments()[1].toStdString().c_str());\n      sock->waitForBytesWritten();\n      sock->close();\n    }\n    \/\/Note that we connected, but may not have sent anything. This means that another instance is already\n    \/\/running. The fact that we connected prompted it to request focus; we will just exit now.\n    delete sock;\n    return 0;\n  }\n  else\n  {\n    if (arguments().size() > 1 &&\n        arguments()[1].startsWith(QString(CUSTOM_URL_SCHEME) + \":\"))\n    {\n      \/\/No other instance running. Handle URL when we get started up.\n      mainWindow.deferCustomUrl(arguments()[1]);\n    }\n\n    \/\/Could not connect to already-running instance. Start a server so future instances connect to us\n    QLocalServer* singleInstanceServer = startSingleInstanceServer(&mainWindow);\n    connect(this, &QApplication::aboutToQuit, singleInstanceServer, &QLocalServer::deleteLater);\n  }\n  delete sock;\n\n  auto viewer = new Html5Viewer;\n  ClientWrapper* client = new ClientWrapper;\n  connect(this, &QApplication::aboutToQuit, client, &ClientWrapper::close);\n\n  mainWindow.setCentralWidget(viewer);\n  mainWindow.setClientWrapper(client);\n\n  QTimer fc_tasks;\n  fc_tasks.connect(&fc_tasks, &QTimer::timeout, [](){ fc::usleep(fc::microseconds(1000)); });\n  fc_tasks.start(33);\n\n  QPixmap pixmap(\":\/images\/splash_screen.jpg\");\n  QSplashScreen splash(pixmap);\n  splash.showMessage(QObject::tr(\"Loading configuration...\"),\n    Qt::AlignCenter | Qt::AlignBottom, Qt::white);\n  splash.show();\n\n  prepareStartupSequence(client, viewer, &mainWindow, &splash);\n\n  QWebSettings::globalSettings()->setAttribute(QWebSettings::PluginsEnabled, false);\n\n  APP_TRY\n  {\n    client->initialize();\n    return exec();\n  }\n  APP_CATCH\n}\n\nvoid setupMenus(ClientWrapper* client, MainWindow* mainWindow)\n{\n  auto accountMenu = mainWindow->accountMenu();\n\n  accountMenu->addAction(\"Go to My Accounts\", mainWindow, SLOT(goToMyAccounts()), QKeySequence(QObject::tr(\"Ctrl+Shift+A\")));\n  accountMenu->addAction(\"Create Account\", mainWindow, SLOT(goToCreateAccount()), QKeySequence(QObject::tr(\"Ctrl+Shift+C\")));\n  accountMenu->addAction(\"Import Account\")->setEnabled(false);\n  accountMenu->addAction(\"New Contact\", mainWindow, SLOT(goToAddContact()), QKeySequence(QObject::tr(\"Ctrl+Shift+N\")));\n}\n\nvoid BitSharesApp::prepareStartupSequence(ClientWrapper* client, Html5Viewer* viewer, MainWindow* mainWindow, QSplashScreen* splash)\n{\n  viewer->webView()->page()->mainFrame()->addToJavaScriptWindowObject(\"bitshares\", client);\n  viewer->webView()->page()->mainFrame()->addToJavaScriptWindowObject(\"magic_unicorn\", new Utilities, QWebFrame::ScriptOwnership);\n\n  QObject::connect(viewer->webView()->page()->networkAccessManager(), &QNetworkAccessManager::authenticationRequired,\n    [client](QNetworkReply*, QAuthenticator *auth) {\n    auth->setUser(client->http_url().userName());\n    auth->setPassword(client->http_url().password());\n  });\n  client->connect(client, &ClientWrapper::initialized, [viewer, client, mainWindow]() {\n    ilog(\"Client initialized; loading web interface from ${url}\", (\"url\", client->http_url().toString().toStdString()));\n    client->status_update(\"Calculating last 3 digits of pi\");\n    viewer->webView()->load(client->http_url());\n    \/\/Now we know the URL of the app, so we can create the items in the Accounts menu\n    setupMenus(client, mainWindow);\n  });\n  auto loadFinishedConnection = std::make_shared<QMetaObject::Connection>();\n  *loadFinishedConnection = viewer->connect(viewer->webView(), &QGraphicsWebView::loadFinished, [mainWindow, splash, viewer, loadFinishedConnection](bool ok) {\n    \/\/Workaround for wallet_get_info RPC call failure in web_wallet\n    \/\/viewer->webView()->reload();\n\n    ilog(\"Webview loaded: ${status}\", (\"status\", ok));\n    viewer->disconnect(*loadFinishedConnection);\n    mainWindow->show();\n    splash->finish(mainWindow);\n    mainWindow->setupTrayIcon();\n    mainWindow->processDeferredUrl();\n  });\n  client->connect(client, &ClientWrapper::error, [=](QString errorString) {\n    splash->hide();\n    QMessageBox::critical(nullptr, QObject::tr(\"Error\"), errorString);\n    exit(1);\n  });\n  client->connect(client, &ClientWrapper::status_update, [=](QString messageString) {\n    splash->showMessage(messageString, Qt::AlignCenter | Qt::AlignBottom, Qt::white);\n  });\n}\n\nQLocalServer* BitSharesApp::startSingleInstanceServer(MainWindow* mainWindow)\n{\n  QLocalServer* singleInstanceServer = new QLocalServer();\n  if (!singleInstanceServer->listen(BTS_BLOCKCHAIN_NAME))\n  {\n    std::cerr << \"Could not start new instance listener. Attempting to remove defunct listener... \";\n    QLocalServer::removeServer(BTS_BLOCKCHAIN_NAME);\n    if (!singleInstanceServer->listen(BTS_BLOCKCHAIN_NAME))\n    {\n      std::cerr << \"Failed to start new instance listener: \" << singleInstanceServer->errorString().toStdString() << std::endl;\n      exit(1);\n    }\n    std::cerr << \"Success.\\n\";\n  }\n\n  std::cout << \"Listening for new instances on \" << singleInstanceServer->fullServerName().toStdString() << std::endl;\n  singleInstanceServer->connect(singleInstanceServer, &QLocalServer::newConnection, [singleInstanceServer, mainWindow](){\n    QLocalSocket* zygote = singleInstanceServer->nextPendingConnection();\n    QEventLoop waitLoop;\n\n    zygote->connect(zygote, &QLocalSocket::readyRead, &waitLoop, &QEventLoop::quit);\n    QTimer::singleShot(1000, &waitLoop, SLOT(quit()));\n    waitLoop.exec();\n\n    mainWindow->takeFocus();\n\n    if (zygote->bytesAvailable())\n    {\n      QByteArray message = zygote->readLine();\n      ilog(\"Got message from new instance: ${msg}\", (\"msg\", message.data()));\n      mainWindow->processCustomUrl(message);\n    }\n    zygote->close();\n\n    delete zygote;\n  });\n\n  return singleInstanceServer;\n}\n\n\nbool BitSharesApp::notify(QObject* receiver, QEvent* e)\n{\n  APP_TRY\n  {\n    return QApplication::notify(receiver, e);\n  }\n  APP_CATCH\n\n  return true;\n}\n\nvoid BitSharesApp::onExceptionCaught(const fc::exception& e)\n{\n  displayFailureInfo(e.to_detail_string());\n}\n\nvoid BitSharesApp::onUnknownExceptionCaught()\n{\n  std::string detail(\"Unknown exception caught\");\n  displayFailureInfo(detail);\n}\n\nvoid BitSharesApp::displayFailureInfo(const std::string& detail)\n{\n  elog(\"${e}\", (\"e\", detail));\n  QErrorMessage::qtHandler()->showMessage(detail.c_str());\n  QApplication::quit();\n}<commit_msg>Resolve #21: Reincarnation of the magic unicorn<commit_after>#include \"BitSharesApp.hpp\"\n\n#include \"html5viewer\/html5viewer.h\"\n#include \"ClientWrapper.hpp\"\n#include \"Utilities.hpp\"\n#include \"MainWindow.hpp\"\n\n#include <boost\/thread.hpp>\n#include <bts\/blockchain\/config.hpp>\n#include <bts\/wallet\/url.hpp>\n#include <signal.h>\n\n#include <QSettings>\n#include <QPixmap>\n#include <QErrorMessage>\n#include <QSplashScreen>\n#include <QDir>\n#include <QWebSettings>\n#include <QWebPage>\n#include <QWebFrame>\n#include <QJsonDocument>\n#include <QGraphicsWebView>\n#include <QTimer>\n#include <QAuthenticator>\n#include <QNetworkReply>\n#include <QResource>\n#include <QGraphicsWidget>\n#include <QMainWindow>\n#include <QMenuBar>\n#include <QLayout>\n#include <QLocalSocket>\n#include <QLocalServer>\n#include <QMessageBox>\n#include <QProxyStyle>\n#include <QComboBox>\n#include <QTemporaryFile>\n\n#include <boost\/program_options.hpp>\n\n#include <bts\/client\/client.hpp>\n#include <bts\/net\/upnp.hpp>\n#include <bts\/blockchain\/chain_database.hpp>\n#include <bts\/rpc\/rpc_server.hpp>\n#include <bts\/cli\/cli.hpp>\n#include <bts\/utilities\/git_revision.hpp>\n#include <fc\/filesystem.hpp>\n#include <fc\/thread\/thread.hpp>\n#include <fc\/log\/file_appender.hpp>\n#include <fc\/log\/logger_config.hpp>\n#include <fc\/io\/json.hpp>\n#include <fc\/reflect\/variant.hpp>\n#include <fc\/git_revision.hpp>\n#include <fc\/io\/json.hpp>\n#include <fc\/log\/logger_config.hpp>\n#include <fc\/signals.hpp>\n\n#include <boost\/iostreams\/tee.hpp>\n#include <boost\/iostreams\/stream.hpp>\n\n#include <fstream>\n#include <iostream>\n#include <iomanip>\n\n#ifdef WIN32\n\n  #define APP_TRY \/*try*\/\n  #define APP_CATCH \/*Nothing*\/\n\n  #ifdef NDEBUG \/\/ enable crashrpt win32 release only\n  #include \"..\/..\/CrashRpt\/include\/CrashRpt.h\"\n\n  \/* forwards SEH caught by fc's async tasks to CrashRpt *\/\n  int unhandled_exception_filter(unsigned code, _EXCEPTION_POINTERS* info)\n  {\n    return crExceptionFilter(code, info);\n  }\n\n  void installCrashRptHandler(const char* appName, const char* appVersion, const QFile& logFilePath)\n  {\n    \/\/ Define CrashRpt configuration parameters\n    CR_INSTALL_INFO info = { 0 };\n    info.cb = sizeof(CR_INSTALL_INFO);\n    info.pszAppName = appName;\n    info.pszAppVersion = appVersion;\n    info.pszEmailSubject = nullptr;\n    info.pszEmailTo = \"sales@syncad.com\";\n    info.pszUrl = \"http:\/\/invictus.syncad.com\/crash_report.html\";\n    info.uPriorities[CR_HTTP] = 3;  \/\/ First try send report over HTTP \n    info.uPriorities[CR_SMTP] = 2;  \/\/ Second try send report over SMTP  \n    info.uPriorities[CR_SMAPI] = 1; \/\/ Third try send report over Simple MAPI    \n    \/\/ Install all available exception handlers\n    info.dwFlags = CR_INST_ALL_POSSIBLE_HANDLERS |\n                   CR_INST_CRT_EXCEPTION_HANDLERS |\n                   CR_INST_AUTO_THREAD_HANDLERS |\n                   CR_INST_SEND_QUEUED_REPORTS;\n    \/\/ Define the Privacy Policy URL \n    info.pszPrivacyPolicyURL = \"http:\/\/invictus.syncad.com\/crash_privacy.html\";\n\n    \/\/ Install crash reporting\n    int nResult = crInstall(&info);\n    if (nResult != 0)\n    {\n      \/\/ Something goes wrong. Get error message.\n      char szErrorMsg[512] = { 0 };\n      crGetLastErrorMsg(szErrorMsg, 512);\n      elog(\"Cannot install CrsshRpt error handler: ${e}\", (\"e\", szErrorMsg));\n      return;\n    }\n    else\n    {\n      wlog(\"CrashRpt handler installed successfully\");\n    }\n\n    auto logPathString = logFilePath.fileName().toStdString();\n\n    \/\/ Add our log file to the error report\n    crAddFile2(logPathString.c_str(), NULL, \"Log File\", CR_AF_MAKE_FILE_COPY);\n\n    \/\/ We want the screenshot of the entire desktop is to be added on crash\n    crAddScreenshot2(CR_AS_PROCESS_WINDOWS | CR_AS_USE_JPEG_FORMAT, 0);\n\n    fc::set_unhandled_structured_exception_filter(&unhandled_exception_filter);\n  }\n\n  void uninstallCrashRptHandler()\n  {\n    crUninstall();\n  }\n\n#endif \/\/ NDEBUG\n#else \/\/ WIN32\n\n  #define APP_TRY try\n  #define APP_CATCH \\\n    catch(const fc::exception& e) \\\n    {\\\n    onExceptionCaught(e);\\\n    }\\\n    catch(...)\\\n    {\\\n    onUnknownExceptionCaught();\\\n    }\n#endif\n\n#if !defined(WIN32) || !defined(NDEBUG)\n  void installCrashRptHandler(const char* appName, const char* appVersion, const QFile& logFilePath)\n  {\n    \/\/\/ Nothing to do here since no crash report support available\n  }\n\n  void uninstallCrashRptHandler()\n  {\n    \/\/\/ Nothing to do here since no crash report support available\n  }\n#endif\n\n\nBitSharesApp* BitSharesApp::_instance = nullptr;\n\n#define APP_NAME \"BitSharesXT\"\n\nstatic std::string CreateBitSharesVersionNumberString()\n{\n  std::ostringstream versionNumberStream;\n  \/\/\/ TODO auto incrementing version\n  versionNumberStream << 0 << \".\" << 4 << \".\" << 1;\n  \/\/versionNumberStream << VERSION_MAJOR << \".\" << VERSION_MINOR << \".\" << VERSION_PATCH;\n  return versionNumberStream.str();\n}\n\nQTemporaryFile gLogFile;\n\nvoid ConfigureLoggingToTemporaryFile()\n{\n  \/\/create log file in temporary dir that lasts after application exits\n  gLogFile.setAutoRemove(false);\n  gLogFile.open();\n  gLogFile.close();\n\n  \/\/configure logger to also write to log file\n  fc::file_appender::config ac;\n  \/** \\warning Use wstring to construct log file name since %TEMP% can point to path containing\n  native chars.\n  *\/\n  ac.filename = gLogFile.fileName().toStdWString();\n  ac.truncate = false;\n  ac.flush = true;\n  fc::logger::get().add_appender(fc::shared_ptr<fc::file_appender>(new fc::file_appender(fc::variant(ac))));\n}\n\nBitSharesApp::BitSharesApp(int& argc, char** argv)\n  :QApplication(argc, argv)\n{\n  assert(_instance == nullptr && \"Only one instance allowed at time\");\n  _instance = this;\n\n  QApplication::setWindowIcon(QIcon(\":\/images\/qtapp.ico\"));\n}\n\nBitSharesApp::~BitSharesApp()\n{\n  assert(_instance == this && \"Only one instance allowed at time\");\n  _instance = nullptr;\n}\n\nint BitSharesApp::run(int& argc, char** argv)\n{\n  ConfigureLoggingToTemporaryFile();\n\n  installCrashRptHandler(APP_NAME, CreateBitSharesVersionNumberString().c_str(), gLogFile);\n\n  BitSharesApp app(argc, argv);\n  int ec = app.run();\n\n  uninstallCrashRptHandler();\n\n  return ec;\n}\n\nint BitSharesApp::run()\n{\n  setOrganizationName(\"BitShares\");\n  setOrganizationDomain(\"bitshares.org\");\n  setApplicationName(BTS_BLOCKCHAIN_NAME);\n\n  \/\/This works around Qt bug 22410, which causes a crash when repeatedly clicking a QComboBox\n  class CrashWorkaroundStyle : public QProxyStyle {\n  public: virtual int styleHint(StyleHint hint, const QStyleOption *option = 0,\n    const QWidget *widget = 0, QStyleHintReturn *returnData = 0) const{\n    if (hint == QStyle::SH_Menu_FlashTriggeredItem)\n      return 0;\n    return QProxyStyle::styleHint(hint, option, widget, returnData);\n  }\n  };\n  setStyle(new CrashWorkaroundStyle);\n\n  MainWindow mainWindow;\n  installEventFilter(&mainWindow);\n\n  \/\/We'll go ahead and leave Win\/Lin URL handling available in OSX too\n  QLocalSocket* sock = new QLocalSocket();\n  sock->connectToServer(BTS_BLOCKCHAIN_NAME);\n  if (sock->waitForConnected(100))\n  {\n    if (arguments().size() > 1 && \n        arguments()[1].startsWith(QString(CUSTOM_URL_SCHEME) + \":\"))\n    {\n      \/\/Need to open a custom URL. Pass it to pre-existing instance.\n      std::cout << \"Found instance already running. Sending message and exiting.\" << std::endl;\n      sock->write( arguments()[1].toStdString().c_str());\n      sock->waitForBytesWritten();\n      sock->close();\n    }\n    \/\/Note that we connected, but may not have sent anything. This means that another instance is already\n    \/\/running. The fact that we connected prompted it to request focus; we will just exit now.\n    delete sock;\n    return 0;\n  }\n  else\n  {\n    if (arguments().size() > 1 &&\n        arguments()[1].startsWith(QString(CUSTOM_URL_SCHEME) + \":\"))\n    {\n      \/\/No other instance running. Handle URL when we get started up.\n      mainWindow.deferCustomUrl(arguments()[1]);\n    }\n\n    \/\/Could not connect to already-running instance. Start a server so future instances connect to us\n    QLocalServer* singleInstanceServer = startSingleInstanceServer(&mainWindow);\n    connect(this, &QApplication::aboutToQuit, singleInstanceServer, &QLocalServer::deleteLater);\n  }\n  delete sock;\n\n  auto viewer = new Html5Viewer;\n  ClientWrapper* client = new ClientWrapper;\n  connect(this, &QApplication::aboutToQuit, client, &ClientWrapper::close);\n\n  mainWindow.setCentralWidget(viewer);\n  mainWindow.setClientWrapper(client);\n\n  QTimer fc_tasks;\n  fc_tasks.connect(&fc_tasks, &QTimer::timeout, [](){ fc::usleep(fc::microseconds(1000)); });\n  fc_tasks.start(33);\n\n  QPixmap pixmap(\":\/images\/splash_screen.jpg\");\n  QSplashScreen splash(pixmap);\n  splash.showMessage(QObject::tr(\"Loading configuration...\"),\n    Qt::AlignCenter | Qt::AlignBottom, Qt::white);\n  splash.show();\n\n  prepareStartupSequence(client, viewer, &mainWindow, &splash);\n\n  QWebSettings::globalSettings()->setAttribute(QWebSettings::PluginsEnabled, false);\n\n  APP_TRY\n  {\n    client->initialize();\n    return exec();\n  }\n  APP_CATCH\n}\n\nvoid setupMenus(ClientWrapper* client, MainWindow* mainWindow)\n{\n  auto accountMenu = mainWindow->accountMenu();\n\n  accountMenu->addAction(\"Go to My Accounts\", mainWindow, SLOT(goToMyAccounts()), QKeySequence(QObject::tr(\"Ctrl+Shift+A\")));\n  accountMenu->addAction(\"Create Account\", mainWindow, SLOT(goToCreateAccount()), QKeySequence(QObject::tr(\"Ctrl+Shift+C\")));\n  accountMenu->addAction(\"Import Account\")->setEnabled(false);\n  accountMenu->addAction(\"New Contact\", mainWindow, SLOT(goToAddContact()), QKeySequence(QObject::tr(\"Ctrl+Shift+N\")));\n}\n\nvoid BitSharesApp::prepareStartupSequence(ClientWrapper* client, Html5Viewer* viewer, MainWindow* mainWindow, QSplashScreen* splash)\n{\n  viewer->connect(viewer->webView(), &QGraphicsWebView::urlChanged, [viewer,client] {\n    \/\/Rebirth of the magic unicorn: When the page is reloaded, the magic unicorn dies. Make a new one.\n    viewer->webView()->page()->mainFrame()->addToJavaScriptWindowObject(\"bitshares\", client);\n    viewer->webView()->page()->mainFrame()->addToJavaScriptWindowObject(\"magic_unicorn\", new Utilities, QWebFrame::ScriptOwnership);\n  });\n  QObject::connect(viewer->webView()->page()->networkAccessManager(), &QNetworkAccessManager::authenticationRequired,\n    [client](QNetworkReply*, QAuthenticator *auth) {\n    auth->setUser(client->http_url().userName());\n    auth->setPassword(client->http_url().password());\n  });\n  client->connect(client, &ClientWrapper::initialized, [viewer, client, mainWindow]() {\n    ilog(\"Client initialized; loading web interface from ${url}\", (\"url\", client->http_url().toString().toStdString()));\n    client->status_update(\"Calculating last 3 digits of pi\");\n    viewer->webView()->load(client->http_url());\n    \/\/Now we know the URL of the app, so we can create the items in the Accounts menu\n    setupMenus(client, mainWindow);\n  });\n  auto loadFinishedConnection = std::make_shared<QMetaObject::Connection>();\n  *loadFinishedConnection = viewer->connect(viewer->webView(), &QGraphicsWebView::loadFinished, [mainWindow, splash, viewer, loadFinishedConnection](bool ok) {\n    \/\/Workaround for wallet_get_info RPC call failure in web_wallet\n    \/\/viewer->webView()->reload();\n\n    ilog(\"Webview loaded: ${status}\", (\"status\", ok));\n    viewer->disconnect(*loadFinishedConnection);\n    mainWindow->show();\n    splash->finish(mainWindow);\n    mainWindow->setupTrayIcon();\n    mainWindow->processDeferredUrl();\n  });\n  client->connect(client, &ClientWrapper::error, [=](QString errorString) {\n    splash->hide();\n    QMessageBox::critical(nullptr, QObject::tr(\"Error\"), errorString);\n    exit(1);\n  });\n  client->connect(client, &ClientWrapper::status_update, [=](QString messageString) {\n    splash->showMessage(messageString, Qt::AlignCenter | Qt::AlignBottom, Qt::white);\n  });\n}\n\nQLocalServer* BitSharesApp::startSingleInstanceServer(MainWindow* mainWindow)\n{\n  QLocalServer* singleInstanceServer = new QLocalServer();\n  if (!singleInstanceServer->listen(BTS_BLOCKCHAIN_NAME))\n  {\n    std::cerr << \"Could not start new instance listener. Attempting to remove defunct listener... \";\n    QLocalServer::removeServer(BTS_BLOCKCHAIN_NAME);\n    if (!singleInstanceServer->listen(BTS_BLOCKCHAIN_NAME))\n    {\n      std::cerr << \"Failed to start new instance listener: \" << singleInstanceServer->errorString().toStdString() << std::endl;\n      exit(1);\n    }\n    std::cerr << \"Success.\\n\";\n  }\n\n  std::cout << \"Listening for new instances on \" << singleInstanceServer->fullServerName().toStdString() << std::endl;\n  singleInstanceServer->connect(singleInstanceServer, &QLocalServer::newConnection, [singleInstanceServer, mainWindow](){\n    QLocalSocket* zygote = singleInstanceServer->nextPendingConnection();\n    QEventLoop waitLoop;\n\n    zygote->connect(zygote, &QLocalSocket::readyRead, &waitLoop, &QEventLoop::quit);\n    QTimer::singleShot(1000, &waitLoop, SLOT(quit()));\n    waitLoop.exec();\n\n    mainWindow->takeFocus();\n\n    if (zygote->bytesAvailable())\n    {\n      QByteArray message = zygote->readLine();\n      ilog(\"Got message from new instance: ${msg}\", (\"msg\", message.data()));\n      mainWindow->processCustomUrl(message);\n    }\n    zygote->close();\n\n    delete zygote;\n  });\n\n  return singleInstanceServer;\n}\n\n\nbool BitSharesApp::notify(QObject* receiver, QEvent* e)\n{\n  APP_TRY\n  {\n    return QApplication::notify(receiver, e);\n  }\n  APP_CATCH\n\n  return true;\n}\n\nvoid BitSharesApp::onExceptionCaught(const fc::exception& e)\n{\n  displayFailureInfo(e.to_detail_string());\n}\n\nvoid BitSharesApp::onUnknownExceptionCaught()\n{\n  std::string detail(\"Unknown exception caught\");\n  displayFailureInfo(detail);\n}\n\nvoid BitSharesApp::displayFailureInfo(const std::string& detail)\n{\n  elog(\"${e}\", (\"e\", detail));\n  QErrorMessage::qtHandler()->showMessage(detail.c_str());\n  QApplication::quit();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Time:  O(m * n)\n\/\/ Space: O(m)\n\nclass Solution {\npublic:\n    \/**\n     * @param m: An integer m denotes the size of a backpack\n     * @param A: Given n items with size A[i]\n     * @return: The maximum size\n     *\/\n    int backPack(int m, vector<int> A) {\n        \/\/ table[i][j] denotes whether using the first elements\n        \/\/ could fulfill size j.\n        vector<vector<bool>> table(2, vector<bool>(m + 1, false));\n        int max_size = 0;\n        table[0][0] = true;\n\n        for (int i = 1; i <= A.size(); ++i) {\n            table[i % 2][0] = true;\n            for (int j = 1; j <= m; ++j) {\n                \/\/ If first i - 1 elements could fulfill the backpack, then\n                \/\/ first i elements would also do.\n                table[i % 2][j] = table[(i - 1) % 2][j];\n\n                \/\/ Using the ith element to fulfill the backpack.\n                if (j >= A[i - 1]) {\n                    table[i % 2][j] = table[i % 2][j]\n                    || table[(i - 1) % 2][j - A[i - 1]];\n                }\n\n                \/\/ If it fullfills size j, update max size.\n                if (table[i % 2][j]) {\n                    max_size = max(max_size, j);\n                }\n            }\n        }\n\n        return max_size;\n    }\n};\n<commit_msg>Update backpack.cpp<commit_after>\/\/ Time:  O(m * n)\n\/\/ Space: O(m)\n\nclass Solution {\npublic:\n    \/**\n     * @param m: An integer m denotes the size of a backpack\n     * @param A: Given n items with size A[i]\n     * @return: The maximum size\n     *\/\n    int backPack(int m, vector<int> A) {\n        \/\/ table[i][j] denotes whether using the first elements\n        \/\/ could fullfill size j.\n        vector<vector<bool>> table(2, vector<bool>(m + 1, false));\n        int max_size = 0;\n        table[0][0] = true;\n\n        for (int i = 1; i <= A.size(); ++i) {\n            table[i % 2][0] = true;\n            for (int j = 1; j <= m; ++j) {\n                \/\/ If first i - 1 elements could fulfill the backpack, then\n                \/\/ first i elements would also do.\n                table[i % 2][j] = table[(i - 1) % 2][j];\n\n                \/\/ Using the ith element to fulfill the backpack.\n                if (j >= A[i - 1]) {\n                    table[i % 2][j] = table[i % 2][j]\n                    || table[(i - 1) % 2][j - A[i - 1]];\n                }\n\n                \/\/ If it fullfills size j, update max size.\n                if (table[i % 2][j]) {\n                    max_size = max(max_size, j);\n                }\n            }\n        }\n\n        return max_size;\n    }\n};\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Module:    itkRawImageIOTest4.cxx\n  Language:  C++\n  Date:      $Date$\n  Version:   $Revision$\n\n  Copyright (c) 2002 Insight Consortium. All rights reserved.\n  See ITKCopyright.txt or http:\/\/www.itk.org\/HTML\/Copyright.htm for details.\n\n     This software is distributed WITHOUT ANY WARRANTY; without even \n     the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR \n     PURPOSE.  See the above copyright notices for more information.\n\n=========================================================================*\/\n\n#include <fstream>\n#include \"itkRawImageIO.h\"\n#include \"itkImageFileReader.h\"\n#include \"itkImage.h\"\n#include \"itkImageLinearIteratorWithIndex.h\"\n\n\n\n\n\n\n\/\/ Helper class for reading a file and checking the content \ntemplate< typename TImageType >\nclass RawImageIOReadFileTester\n{\n\npublic:\n\/\/ Only single method of this class\nint Read( const char *filename , bool ReadBigEndian, unsigned int dims[] )\n  {\n\n    const unsigned int ImageDimension = TImageType::ImageDimension;\n\n    typedef typename TImageType::PixelType   PixelType;\n    typedef itk::ImageFileReader<TImageType> ReaderType;\n    typedef itk::RawImageIO<PixelType,ImageDimension> IOType;\n\n    typename IOType::Pointer io = IOType::New();\n\n    io->SetFileTypeToBinary();\n    \n    if( ReadBigEndian )\n      {\n      io->SetByteOrderToBigEndian();\n      }\n    else \n      {\n      io->SetByteOrderToLittleEndian();\n      }\n\n\n    for( unsigned int j = 0; j < TImageType::ImageDimension; j++ )\n      {\n      io->SetDimensions( j, dims[j] );\n      }\n\n\n    \n    typename ReaderType::Pointer reader = ReaderType::New();\n    reader->SetFileName( filename );\n    reader->SetImageIO( io );\n    reader->Update();\n\n\n    typedef itk::ImageLinearIteratorWithIndex<TImageType> Iterator;\n    Iterator it( reader->GetOutput(), reader->GetOutput()->GetBufferedRegion() );\n\n    it.GoToBegin();\n    it.SetDirection( 0 ); \n\n\n    PixelType value = itk::NumericTraits< PixelType >::Zero;\n    while ( !it.IsAtEnd() )\n      {\n      while ( !it.IsAtEndOfLine() )\n        {\n        PixelType readValue = it.Get();\n        std::cout << readValue << \" \";\n        if( readValue != value )\n          {\n          std::cerr << \"At index \" << it.GetIndex() << std::endl;\n          std::cerr << \"the value \" << value << \" was expected  \" << std::endl;\n          std::cerr << \"but value \" << readValue << \" was read  \" << std::endl;\n          return EXIT_FAILURE;\n          }\n        ++it;\n        ++value;\n        }\n      std::cout << std::endl;\n      it.NextLine();\n      }\n    return EXIT_SUCCESS;\n  }\n\n};\n\n\n\n\n\n\n\n\n\nint itkRawImageIOTest4(int argc, char*argv[])\n{\n\n  typedef unsigned short PixelType;\n  const unsigned int ImageDimension = 2;\n\n  typedef itk::RawImageIO<PixelType,ImageDimension> IOType;\n  typedef itk::Image<PixelType,ImageDimension> ImageType;\n\n  unsigned int dims[ImageDimension] = { 5, 5 };\n\n  typedef itk::PixelTraits< PixelType >::ValueType ComponentType;\n  typedef itk::ByteSwapper< ComponentType >              ByteSwapperType;\n\n  PixelType value = itk::NumericTraits< PixelType >::Zero;\n  unsigned int numberOfPixels = dims[0] * dims[1];\n\n  if(argc < 3)\n    {\n    std::cerr << \"Usage: \" << argv[0] << \" Output1 Output2\\n\";\n    return EXIT_FAILURE;\n    }\n\n\n  \/\/ Create the BigEndian binary file\n  std::ofstream outputFile1;\n#ifdef _WIN32\n  outputFile1.open( argv[1] , std::ios::out | std::ios::binary );\n#else\n  outputFile1.open( argv[1] );\n#endif\n\n  if( outputFile1.fail() )\n    {\n    std::cerr << \"itkRawImageIOTest4:Error writing the test file\" << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  for( unsigned int i = 0; i < numberOfPixels; i++ )\n    {\n    PixelType swappedValue = value;\n    \/\/ make sure that the file is written in \n    \/\/ BigEndian regardless of the platform\n    ByteSwapperType::SwapFromSystemToBigEndian( &swappedValue );\n    outputFile1.write( reinterpret_cast<char*>(&swappedValue), \n                      sizeof(swappedValue) );\n    ++value;\n    }\n  outputFile1.close();\n \n  if( outputFile1.fail() )\n    {\n    std::cerr << \"itkRawImageIOTest4:Error writing the test file\" << std::endl;\n    return EXIT_FAILURE;\n    }\n\n\n\n\n  \/\/ Create the LittleEndian binary file\n  std::ofstream outputFile2;\n#ifdef _WIN32\n  outputFile2.open( argv[2] , std::ios::out | std::ios::binary );\n#else\n  outputFile2.open( argv[2] );\n#endif\n\n  if( outputFile2.fail() )\n    {\n    std::cerr << \"itkRawImageIOTest4:Error writing the test file\" << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  value = itk::NumericTraits< PixelType >::Zero;\n  for( unsigned int i = 0; i < numberOfPixels; i++ )\n    {\n    PixelType swappedValue = value;\n    \/\/ make sure that the file is written in \n    \/\/ LittleEndian regardless of the platform\n    ByteSwapperType::SwapFromSystemToLittleEndian( &swappedValue );\n    outputFile2.write( reinterpret_cast<char*>(&swappedValue), \n                      sizeof(swappedValue) );\n    ++value;\n    }\n  outputFile2.close();\n \n  if( outputFile2.fail() )\n    {\n    std::cerr << \"itkRawImageIOTest4:Error writing the test file\" << std::endl;\n    return EXIT_FAILURE;\n    }\n\n\n\n  RawImageIOReadFileTester<ImageType>  readTester;\n\n\n  int status;\n\n  std::cout << \"Testing read of Big Endian File\" << std::endl;\n  bool fileIsBigEndian = true;\n  status = readTester.Read( argv[1], fileIsBigEndian, dims );\n  if( status==EXIT_FAILURE )\n    {\n    std::cerr << \"Reading Raw BigEndian FAILED !!\" << std::endl;\n    return EXIT_FAILURE;\n    }\n  else\n    {\n    std::cout << \"Reading Raw BigEndian PASSED !!\" << std::endl << std::endl;\n    }\n\n  std::cout << \"Testing read of Little Endian File\" << std::endl;\n  fileIsBigEndian = false;\n  status = readTester.Read( argv[2], fileIsBigEndian, dims );\n  if( status==EXIT_FAILURE )\n    {\n    std::cerr << \"Reading Raw LittleEndian FAILED !!\" << std::endl;\n    return EXIT_FAILURE;\n    }\n  else\n    {\n    std::cout << \"Reading Raw LittleEndian PASSED !!\" << std::endl << std::endl;\n    }\n\n  std::cout << \"Test PASSED !!\" << std::endl << std::endl;\n\n  return EXIT_SUCCESS;\n\n}\n\n\n<commit_msg>ERR: on older sgis, the open for write, requires the file to exist.<commit_after>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Module:    itkRawImageIOTest4.cxx\n  Language:  C++\n  Date:      $Date$\n  Version:   $Revision$\n\n  Copyright (c) 2002 Insight Consortium. All rights reserved.\n  See ITKCopyright.txt or http:\/\/www.itk.org\/HTML\/Copyright.htm for details.\n\n     This software is distributed WITHOUT ANY WARRANTY; without even \n     the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR \n     PURPOSE.  See the above copyright notices for more information.\n\n=========================================================================*\/\n\n#include <fstream>\n#include \"itkRawImageIO.h\"\n#include \"itkImageFileReader.h\"\n#include \"itkImage.h\"\n#include \"itkImageLinearIteratorWithIndex.h\"\n\n\n\n\n\n\n\/\/ Helper class for reading a file and checking the content \ntemplate< typename TImageType >\nclass RawImageIOReadFileTester\n{\n\npublic:\n\/\/ Only single method of this class\nint Read( const char *filename , bool ReadBigEndian, unsigned int dims[] )\n  {\n\n    const unsigned int ImageDimension = TImageType::ImageDimension;\n\n    typedef typename TImageType::PixelType   PixelType;\n    typedef itk::ImageFileReader<TImageType> ReaderType;\n    typedef itk::RawImageIO<PixelType,ImageDimension> IOType;\n\n    typename IOType::Pointer io = IOType::New();\n\n    io->SetFileTypeToBinary();\n    \n    if( ReadBigEndian )\n      {\n      io->SetByteOrderToBigEndian();\n      }\n    else \n      {\n      io->SetByteOrderToLittleEndian();\n      }\n\n\n    for( unsigned int j = 0; j < TImageType::ImageDimension; j++ )\n      {\n      io->SetDimensions( j, dims[j] );\n      }\n\n\n    \n    typename ReaderType::Pointer reader = ReaderType::New();\n    reader->SetFileName( filename );\n    reader->SetImageIO( io );\n    reader->Update();\n\n\n    typedef itk::ImageLinearIteratorWithIndex<TImageType> Iterator;\n    Iterator it( reader->GetOutput(), reader->GetOutput()->GetBufferedRegion() );\n\n    it.GoToBegin();\n    it.SetDirection( 0 ); \n\n\n    PixelType value = itk::NumericTraits< PixelType >::Zero;\n    while ( !it.IsAtEnd() )\n      {\n      while ( !it.IsAtEndOfLine() )\n        {\n        PixelType readValue = it.Get();\n        std::cout << readValue << \" \";\n        if( readValue != value )\n          {\n          std::cerr << \"At index \" << it.GetIndex() << std::endl;\n          std::cerr << \"the value \" << value << \" was expected  \" << std::endl;\n          std::cerr << \"but value \" << readValue << \" was read  \" << std::endl;\n          return EXIT_FAILURE;\n          }\n        ++it;\n        ++value;\n        }\n      std::cout << std::endl;\n      it.NextLine();\n      }\n    return EXIT_SUCCESS;\n  }\n\n};\n\n\n\n\n\n\n\n\n\nint itkRawImageIOTest4(int argc, char*argv[])\n{\n\n  typedef unsigned short PixelType;\n  const unsigned int ImageDimension = 2;\n\n  typedef itk::RawImageIO<PixelType,ImageDimension> IOType;\n  typedef itk::Image<PixelType,ImageDimension> ImageType;\n\n  unsigned int dims[ImageDimension] = { 5, 5 };\n\n  typedef itk::PixelTraits< PixelType >::ValueType ComponentType;\n  typedef itk::ByteSwapper< ComponentType >              ByteSwapperType;\n\n  PixelType value = itk::NumericTraits< PixelType >::Zero;\n  unsigned int numberOfPixels = dims[0] * dims[1];\n\n  if(argc < 3)\n    {\n    std::cerr << \"Usage: \" << argv[0] << \" Output1 Output2\\n\";\n    return EXIT_FAILURE;\n    }\n\n\n  \/\/ Create the BigEndian binary file\n  std::ofstream outputFile1(argv[1], std::ios::out);\n  outputFile1.close();\n#ifdef _WIN32\n  outputFile1.open( argv[1] , std::ios::out | std::ios::binary );\n#else\n  outputFile1.open( argv[1] );\n#endif\n\n  if( outputFile1.fail() )\n    {\n    std::cerr << \"itkRawImageIOTest4:Error writing the test file\" << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  for( unsigned int i = 0; i < numberOfPixels; i++ )\n    {\n    PixelType swappedValue = value;\n    \/\/ make sure that the file is written in \n    \/\/ BigEndian regardless of the platform\n    ByteSwapperType::SwapFromSystemToBigEndian( &swappedValue );\n    outputFile1.write( reinterpret_cast<char*>(&swappedValue), \n                      sizeof(swappedValue) );\n    ++value;\n    }\n  outputFile1.close();\n \n  if( outputFile1.fail() )\n    {\n    std::cerr << \"itkRawImageIOTest4:Error writing the test file\" << std::endl;\n    return EXIT_FAILURE;\n    }\n\n\n\n\n  \/\/ Create the LittleEndian binary file\n  std::ofstream outputFile2(argv[2], std::ios::out);\n  outputFile2.close();\n#ifdef _WIN32\n  outputFile2.open( argv[2] , std::ios::out | std::ios::binary );\n#else\n  outputFile2.open( argv[2] );\n#endif\n\n  if( outputFile2.fail() )\n    {\n    std::cerr << \"itkRawImageIOTest4:Error writing the test file\" << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  value = itk::NumericTraits< PixelType >::Zero;\n  for( unsigned int i = 0; i < numberOfPixels; i++ )\n    {\n    PixelType swappedValue = value;\n    \/\/ make sure that the file is written in \n    \/\/ LittleEndian regardless of the platform\n    ByteSwapperType::SwapFromSystemToLittleEndian( &swappedValue );\n    outputFile2.write( reinterpret_cast<char*>(&swappedValue), \n                      sizeof(swappedValue) );\n    ++value;\n    }\n  outputFile2.close();\n \n  if( outputFile2.fail() )\n    {\n    std::cerr << \"itkRawImageIOTest4:Error writing the test file\" << std::endl;\n    return EXIT_FAILURE;\n    }\n\n\n\n  RawImageIOReadFileTester<ImageType>  readTester;\n\n\n  int status;\n\n  std::cout << \"Testing read of Big Endian File\" << std::endl;\n  bool fileIsBigEndian = true;\n  status = readTester.Read( argv[1], fileIsBigEndian, dims );\n  if( status==EXIT_FAILURE )\n    {\n    std::cerr << \"Reading Raw BigEndian FAILED !!\" << std::endl;\n    return EXIT_FAILURE;\n    }\n  else\n    {\n    std::cout << \"Reading Raw BigEndian PASSED !!\" << std::endl << std::endl;\n    }\n\n  std::cout << \"Testing read of Little Endian File\" << std::endl;\n  fileIsBigEndian = false;\n  status = readTester.Read( argv[2], fileIsBigEndian, dims );\n  if( status==EXIT_FAILURE )\n    {\n    std::cerr << \"Reading Raw LittleEndian FAILED !!\" << std::endl;\n    return EXIT_FAILURE;\n    }\n  else\n    {\n    std::cout << \"Reading Raw LittleEndian PASSED !!\" << std::endl << std::endl;\n    }\n\n  std::cout << \"Test PASSED !!\" << std::endl << std::endl;\n\n  return EXIT_SUCCESS;\n\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/A simple Sam viewer. Convert a Sam alignment file into a SVG vector graphic.\n#include <fstream>\n#include <iostream>\n#include <string>\n\n#include <seqan\/store.h>\n#include <seqan\/misc\/misc_cmdparser.h>\n#include <seqan\/misc\/misc_svg.h>\n\nusing namespace seqan;\n\nint main(int argc, const char *argv[])\n{\n\ttypedef FragmentStore<> TFragStore;\n\ttypedef TFragStore::TContigPos TContigPos;\n\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\/\/ Define options\n\tCommandLineParser parser;\n\taddUsageLine(parser, \"[OPTION]... <Sam file> <SVG file>\");\n\taddUsageLine(parser, \"[OPTION]... <Sam file> <GENOME file> <SVG file>\");\n\n\taddOption(parser, CommandLineOption(\"c\",  \"contig\",    \"display only contig #NUM (default: show all contigs)\", OptionType::Int | OptionType::Label | OptionType::List));\n\taddOption(parser, CommandLineOption(\"p\",  \"pos\",    2, \"set begin and end position (default: show whole strands)\", OptionType::Int | OptionType::Label));\n\taddOption(parser, CommandLineOption(\"l\",  \"lines\",  2, \"set first and last line of the alignment (default: show whole alignment)\", OptionType::Int | OptionType::Label));\n\taddOption(parser, CommandLineOption(\"a\",  \"ascii\",     \"output alignment in ASCII format instead of SVG\", OptionType::Bool | OptionType::Label));\n\trequiredArguments(parser, 2);\n\n\tbool stop = !parse(parser, argc, argv, std::cerr);\n\tif (stop) return 0;\n\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\/\/ Extract and check options\n\tString<unsigned> contigs;\n\tTContigPos left = 0;\n\tTContigPos right = MaxValue<TContigPos>::VALUE;\n\tunsigned firstLine = 0;\n\tunsigned lastLine = MaxValue<unsigned>::VALUE;\n\tbool inASCII = false;\n\n\tif (isSetLong(parser, \"pos\"))\n\t{\n\t\t__int64 l = 0, r = 0;\n\t\tgetOptionValueLong(parser, \"pos\", 0, l);\n\t\tgetOptionValueLong(parser, \"pos\", 1, r);\n\t\tif ((l >= r) && (stop = true))\n\t\t\tstd::cerr << \"Begin position must be less than end position.\" << std::endl;\n\t\tleft = l;\n\t\tright = r;\n\t}\n\n\tif (isSetLong(parser, \"lines\"))\n\t{\n\t\tgetOptionValueLong(parser, \"lines\", 0, firstLine);\n\t\tgetOptionValueLong(parser, \"lines\", 1, lastLine);\n\t\tif ((firstLine >= lastLine) && (stop = true))\n\t\t\tstd::cerr << \"First line must be less or equal than last line.\" << std::endl;\n\t}\n\n\tTFragStore store;\n\tstd::ifstream samFile(toCString(getArgumentValue(parser, 0)), std::ios_base::in | std::ios_base::binary);\n\tstd::ofstream ascii;\n\tSVGFile svg;\n\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\/\/ Optionally load genome file\n\tunsigned outArgNo = 1;\n\tif (argumentCount(parser) > 2)\n\t{\n\t\tif (!loadContigs(store, getArgumentValue(parser, 1)) && (stop = true))\n\t\t\tstd::cerr << \"Failed to load genome.\" << std::endl;\n\t\t++outArgNo;\n\t}\n\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\/\/ Load Sam file\n\tif (!stop) read(samFile, store, Sam());\n\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\/\/ Choose contigs\n\tif (isSetLong(parser, \"contig\"))\n\t{\n\t\tresize(contigs, length(getOptionValuesLong(parser, \"contig\")));\n\t\tfor (unsigned i = 0; i < length(contigs); ++i)\n\t\t\tgetOptionValueLong(parser, \"contig\", i, contigs[i]);\n\t} else {\n\t\tresize(contigs, length(store.contigStore));\n\t\tfor (unsigned i = 0; i < length(contigs); ++i)\n\t\t\tcontigs[i] = i;\n\t}\n\n\tif (isSetLong(parser, \"ascii\"))\n\t\tinASCII = true;\n\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\/\/ Optionally load genome and open SVG file for writing\n\tif (!stop)\n\t{\n\t\tif (inASCII)\n\t\t{\n\t\t\tascii.open(toCString(getArgumentValue(parser, outArgNo)), std::ios_base::out | std::ios_base::trunc);\n\t\t\tif (!ascii.is_open()) stop = true;\n\t\t} else\n\t\t\tif (!open(svg, toCString(getArgumentValue(parser, outArgNo)))) stop = true;\n\n\t\tif (stop) std::cerr << \"Failed to open output file for writing.\" << std::endl;\n\t}\n\n\t\/\/ something went wrong\n\tif (stop)\n\t{\n\t\tstd::cerr << \"Exiting ...\" << std::endl;\n\t\treturn 1;\n\t}\n\n\tfor(unsigned o=0;o<length(store.contigStore);++o)\n\tstd::cerr<<store.contigNameStore[o]<<std::endl;\n\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\/\/ Output alignment\n\tAlignedReadLayout layout;\n\tstd::cout << \"Layouting reads ... \" << std::flush;\n\tlayoutAlignment(layout, store);\n\tstd::cout << \"done\" << std::endl;\n\n\tfor (unsigned i = 0; i < length(contigs); ++i)\n\t\tif (i < length(store.contigStore))\n\t\t{\n\t\t\tstd::cout << \"Writing contig \" << contigs[i] << \" ... \" << std::flush;\n\t\t\tTContigPos right_ = right;\n\t\t\tif (right_ == MaxValue<TContigPos>::VALUE)\n\t\t\t{\n\t\t\t\tright_ = 0;\n\t\t\t\tfor (unsigned j = 0; j < length(layout.contigRows[i]); ++j)\n\t\t\t\t{\n\t\t\t\t\tunsigned id = back(layout.contigRows[i][j]);\n\t\t\t\t\tif (right_ < store.alignedReadStore[id].beginPos)\n\t\t\t\t\t\tright_ = store.alignedReadStore[id].beginPos;\n\t\t\t\t\tif (right_ < store.alignedReadStore[id].endPos)\n\t\t\t\t\t\tright_ = store.alignedReadStore[id].endPos;\n\t\t\t\t}\n\t\t\t}\n\t\t\tstd::cout << left<<'\\t'<<right_<<'\\t'<<firstLine<<'\\t'<<lastLine<<std::endl;\n\t\t\tif (inASCII)\n\t\t\t\tprintAlignment(ascii, Raw(), layout, store, contigs[i], left, right_, firstLine, lastLine);\n\t\t\telse\n\t\t\t\tprintAlignment(svg, Raw(), layout, store, contigs[i], left, right_, firstLine, lastLine);\n\n\t\t\tstd::cout << \"done\" << std::endl;\n\t\t}\n\n\treturn 0;\n}\n<commit_msg>added: gap\/seq space option<commit_after>\/\/\/A simple Sam viewer. Convert a Sam alignment file into a SVG vector graphic.\n#include <fstream>\n#include <iostream>\n#include <string>\n\n#include <seqan\/store.h>\n#include <seqan\/misc\/misc_cmdparser.h>\n#include <seqan\/misc\/misc_svg.h>\n\nusing namespace seqan;\n\nint main(int argc, const char *argv[])\n{\n\ttypedef FragmentStore<> TFragStore;\n\n\t\ttypedef  TFragStore::TContigStore\t\t\t\t\tTContigStore;\n        typedef  Value<TContigStore>::Type\t\t\t\t\t\tTContig;\n\t\ttypedef TFragStore::TContigPos TContigPos;\n\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\/\/ Define options\n\tCommandLineParser parser;\n\taddUsageLine(parser, \"[OPTION]... <Sam file> <SVG file>\");\n\taddUsageLine(parser, \"[OPTION]... <Sam file> <GENOME file> <SVG file>\");\n\n\taddOption(parser, CommandLineOption(\"c\",  \"contig\",    \"display only contig #NUM (default: show all contigs)\", OptionType::Int | OptionType::Label | OptionType::List));\n\taddOption(parser, CommandLineOption(\"p\",  \"pos\",    2, \"set begin and end position (default: show whole strands)\", OptionType::Int | OptionType::Label));\n\taddOption(parser, CommandLineOption(\"l\",  \"lines\",  2, \"set first and last line of the alignment (default: show whole alignment)\", OptionType::Int | OptionType::Label));\n\taddOption(parser, CommandLineOption(\"a\",  \"ascii\",     \"output alignment in ASCII format instead of SVG\", OptionType::Bool | OptionType::Label));\n\taddOption(parser, CommandLineOption(\"gs\", \"gap-space\", \"begin and end position (-p) are given in gap space\", OptionType::Bool | OptionType::Label));\n\trequiredArguments(parser, 2);\n\n\tbool stop = !parse(parser, argc, argv, std::cerr);\n\tif (stop) return 0;\n\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\/\/ Extract and check options\n\tString<unsigned> contigs;\n\tTContigPos left = 0;\n\tTContigPos right = MaxValue<TContigPos>::VALUE;\n\tunsigned firstLine = 0;\n\tunsigned lastLine = MaxValue<unsigned>::VALUE;\n\tbool inASCII = false;\n\n\tif (isSetLong(parser, \"pos\"))\n\t{\n\t\t__int64 l = 0, r = 0;\n\t\tgetOptionValueLong(parser, \"pos\", 0, l);\n\t\tgetOptionValueLong(parser, \"pos\", 1, r);\n\t\tif ((l >= r) && (stop = true))\n\t\t\tstd::cerr << \"Begin position must be less than end position.\" << std::endl;\n\t\tleft = l;\n\t\tright = r;\n\t}\n\n\tif (isSetLong(parser, \"lines\"))\n\t{\n\t\tgetOptionValueLong(parser, \"lines\", 0, firstLine);\n\t\tgetOptionValueLong(parser, \"lines\", 1, lastLine);\n\t\tif ((firstLine >= lastLine) && (stop = true))\n\t\t\tstd::cerr << \"First line must be less or equal than last line.\" << std::endl;\n\t}\n\n\tTFragStore store;\n\tstd::ifstream samFile(toCString(getArgumentValue(parser, 0)), std::ios_base::in | std::ios_base::binary);\n\tstd::ofstream ascii;\n\tSVGFile svg;\n\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\/\/ Optionally load genome file\n\tunsigned outArgNo = 1;\n\tif (argumentCount(parser) > 2)\n\t{\n\t\tif (!loadContigs(store, getArgumentValue(parser, 1)) && (stop = true))\n\t\t\tstd::cerr << \"Failed to load genome.\" << std::endl;\n\t\t++outArgNo;\n\t}\n\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\/\/ Load Sam file\n\tif (!stop) read(samFile, store, Sam());\n\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\/\/ Choose contigs\n\tif (isSetLong(parser, \"contig\"))\n\t{\n\t\tresize(contigs, length(getOptionValuesLong(parser, \"contig\")));\n\t\tfor (unsigned i = 0; i < length(contigs); ++i)\n\t\t\tgetOptionValueLong(parser, \"contig\", i, contigs[i]);\n\t} else {\n\t\tresize(contigs, length(store.contigStore));\n\t\tfor (unsigned i = 0; i < length(contigs); ++i)\n\t\t\tcontigs[i] = i;\n\t}\n\n\tif (isSetLong(parser, \"ascii\"))\n\t\tinASCII = true;\n\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\/\/ Optionally load genome and open SVG file for writing\n\tif (!stop)\n\t{\n\t\tif (inASCII)\n\t\t{\n\t\t\tascii.open(toCString(getArgumentValue(parser, outArgNo)), std::ios_base::out | std::ios_base::trunc);\n\t\t\tif (!ascii.is_open()) stop = true;\n\t\t} else\n\t\t\tif (!open(svg, toCString(getArgumentValue(parser, outArgNo)))) stop = true;\n\n\t\tif (stop) std::cerr << \"Failed to open output file for writing.\" << std::endl;\n\t}\n\n\t\/\/ something went wrong\n\tif (stop)\n\t{\n\t\tstd::cerr << \"Exiting ...\" << std::endl;\n\t\treturn 1;\n\t}\n\n\tfor(unsigned o=0;o<length(store.contigStore);++o)\n\tstd::cerr<<store.contigNameStore[o]<<std::endl;\n\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\/\/ Output alignment\n\tAlignedReadLayout layout;\n\tstd::cout << \"Layouting reads ... \" << std::flush;\n\tlayoutAlignment(layout, store);\n\tstd::cout << \"done\" << std::endl;\n\n\tfor (unsigned i = 0; i < length(contigs); ++i)\n\t\tif (i < length(store.contigStore))\n\t\t{\n\t\t\tstd::cout << \"Writing contig \" << contigs[i] << \" ... \" << std::flush;\n\n\t\t\t__int64 l = left;\n\t\t\t__int64 r = right;\n\n\t\t\tif (!isSetLong(parser, \"gap-space\"))\n\t\t\t{\n\t\t\t\ttypedef Gaps<Nothing, AnchorGaps< TContig::TGapAnchors> >\tTContigGaps;\n\t\t\t\tTContigGaps\tcontigGaps(store.contigStore[i].gaps);\n\t\t\t\tl = positionSeqToGap(contigGaps, l);\n\t\t\t\tif (r != MaxValue<TContigPos>::VALUE)\n\t\t\t\t\tr = positionSeqToGap(contigGaps, r);\n\t\t\t}\n\n\t\t\tif (r == MaxValue<TContigPos>::VALUE)\n\t\t\t{\n\t\t\t\tr = 0;\n\t\t\t\tfor (unsigned j = 0; j < length(layout.contigRows[i]); ++j)\n\t\t\t\t{\n\t\t\t\t\tunsigned id = back(layout.contigRows[i][j]);\n\t\t\t\t\tif (r < store.alignedReadStore[id].beginPos)\n\t\t\t\t\t\tr = store.alignedReadStore[id].beginPos;\n\t\t\t\t\tif (r < store.alignedReadStore[id].endPos)\n\t\t\t\t\t\tr = store.alignedReadStore[id].endPos;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tstd::cout <<l<<'\\t'<<r<<'\\t'<<firstLine<<'\\t'<<lastLine<<std::endl;\n\t\t\tif (inASCII)\n\t\t\t\tprintAlignment(ascii, Raw(), layout, store, contigs[i], l, r, firstLine, lastLine);\n\t\t\telse\n\t\t\t\tprintAlignment(svg, Raw(), layout, store, contigs[i], l, r, firstLine, lastLine);\n\n\t\t\tstd::cout << \"done\" << std::endl;\n\t\t}\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2014 Digia Plc and\/or its subsidiary(-ies).\n** Contact: http:\/\/www.qt-project.org\/legal\n**\n** This file is part of 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 \"artifactcleaner.h\"\n\n#include \"artifact.h\"\n#include \"artifactvisitor.h\"\n#include \"productbuilddata.h\"\n#include \"projectbuilddata.h\"\n#include \"transformer.h\"\n\n#include <language\/language.h>\n#include <logging\/translator.h>\n#include <tools\/cleanoptions.h>\n#include <tools\/error.h>\n#include <tools\/fileinfo.h>\n#include <tools\/progressobserver.h>\n#include <tools\/qbsassert.h>\n\n#include <QCoreApplication>\n#include <QDir>\n#include <QDirIterator>\n#include <QFileInfo>\n#include <QSet>\n#include <QString>\n\nnamespace qbs {\nnamespace Internal {\n\nstatic void printRemovalMessage(const QString &path, bool dryRun, const Logger &logger)\n{\n    if (dryRun)\n        logger.qbsInfo() << Tr::tr(\"Would remove '%1'.\").arg(path);\n    else\n        logger.qbsDebug() << \"Removing '\" << path << \"'.\";\n}\n\nstatic void invalidateArtifactTimestamp(Artifact *artifact)\n{\n    if (artifact->timestamp().isValid()) {\n        artifact->clearTimestamp();\n        artifact->product->topLevelProject()->buildData->isDirty = true;\n    }\n}\n\nstatic void removeArtifactFromDisk(Artifact *artifact, bool dryRun, const Logger &logger)\n{\n    QFileInfo fileInfo(artifact->filePath());\n    if (!fileInfo.exists()) {\n        if (!dryRun)\n            invalidateArtifactTimestamp(artifact);\n        return;\n    }\n    printRemovalMessage(fileInfo.filePath(), dryRun, logger);\n    if (dryRun)\n        return;\n    invalidateArtifactTimestamp(artifact);\n    QString errorMessage;\n    if (!removeFileRecursion(fileInfo, &errorMessage))\n        throw ErrorInfo(errorMessage);\n}\n\nclass CleanupVisitor : public ArtifactVisitor\n{\npublic:\n    CleanupVisitor(const CleanOptions &options, const Logger &logger)\n        : ArtifactVisitor(Artifact::Generated)\n        , m_options(options)\n        , m_logger(logger)\n        , m_hasError(false)\n    {\n    }\n\n    void visitProduct(const ResolvedProductConstPtr &product)\n    {\n        m_product = product;\n        ArtifactVisitor::visitProduct(product);\n    }\n\n    const QSet<QString> &directories() const { return m_directories; }\n    bool hasError() const { return m_hasError; }\n\nprivate:\n    void doVisit(Artifact *artifact)\n    {\n        if (artifact->product != m_product)\n            return;\n        if (m_options.cleanType() == CleanOptions::CleanupTemporaries) {\n            QBS_CHECK(artifact->transformer);\n            foreach (Artifact * const sibling, artifact->transformer->outputs) {\n                if (artifact->product->buildData->targetArtifacts().contains(sibling))\n                    return;\n            }\n        }\n        try {\n            removeArtifactFromDisk(artifact, m_options.dryRun(), m_logger);\n        } catch (const ErrorInfo &error) {\n            if (!m_options.keepGoing())\n                throw;\n            m_logger.printWarning(error);\n            m_hasError = true;\n        }\n        m_directories << artifact->dirPath();\n    }\n\n    const CleanOptions m_options;\n    Logger m_logger;\n    bool m_hasError;\n    ResolvedProductConstPtr m_product;\n    QSet<QString> m_directories;\n};\n\nArtifactCleaner::ArtifactCleaner(const Logger &logger, ProgressObserver *observer)\n    : m_logger(logger), m_observer(observer)\n{\n}\n\nvoid ArtifactCleaner::cleanup(const TopLevelProjectPtr &project,\n        const QList<ResolvedProductPtr> &products, const CleanOptions &options)\n{\n    m_hasError = false;\n\n    const QString configString = Tr::tr(\" for configuration %1\").arg(project->id());\n    m_observer->initialize(Tr::tr(\"Cleaning up%1\").arg(configString), products.count() + 1);\n\n    QSet<QString> directories;\n    foreach (const ResolvedProductPtr &product, products) {\n        CleanupVisitor visitor(options, m_logger);\n        visitor.visitProduct(product);\n        directories.unite(visitor.directories());\n        if (visitor.hasError())\n            m_hasError = true;\n        m_observer->incrementProgressValue();\n    }\n\n    \/\/ Directories created during the build are not artifacts (TODO: should they be?),\n    \/\/ so we have to clean them up manually.\n    QList<QString> dirList = directories.toList();\n    for (int i = 0; i < dirList.count(); ++i) {\n        const QString &dir = dirList.at(i);\n        if (dir.startsWith(project->buildDirectory) && FileInfo(dir).exists())\n            removeEmptyDirectories(dir, options);\n        if (dir != project->buildDirectory) {\n            const QString parentDir = QDir::cleanPath(dir + QLatin1String(\"\/..\"));\n            if (parentDir != project->buildDirectory && !dirList.contains(parentDir))\n                dirList << parentDir;\n        }\n    }\n    m_observer->incrementProgressValue();\n\n    if (m_hasError)\n        throw ErrorInfo(Tr::tr(\"Failed to remove some files.\"));\n    m_observer->setFinished();\n}\n\nvoid ArtifactCleaner::removeEmptyDirectories(const QString &rootDir, const CleanOptions &options,\n                                             bool *isEmpty)\n{\n    bool subTreeIsEmpty = true;\n    QDirIterator it(rootDir, QDir::Files | QDir::Dirs | QDir::NoDotAndDotDot);\n    while (it.hasNext()) {\n        it.next();\n        if (!it.fileInfo().isSymLink() && it.fileInfo().isDir())\n            removeEmptyDirectories(it.filePath(), options, &subTreeIsEmpty);\n        else\n            subTreeIsEmpty = false;\n    }\n    if (subTreeIsEmpty) {\n        printRemovalMessage(rootDir, options.dryRun(), m_logger);\n        if (!QDir::root().rmdir(rootDir)) {\n            ErrorInfo error(Tr::tr(\"Failure to remove empty directory '%1'.\").arg(rootDir));\n            if (!options.keepGoing())\n                throw error;\n            m_logger.printWarning(error);\n            m_hasError = true;\n            subTreeIsEmpty = false;\n        }\n    }\n    if (!subTreeIsEmpty && isEmpty)\n        *isEmpty = false;\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace qbs\n<commit_msg>Fix potential infinite loop in build dir cleaning.<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2014 Digia Plc and\/or its subsidiary(-ies).\n** Contact: http:\/\/www.qt-project.org\/legal\n**\n** This file is part of 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 \"artifactcleaner.h\"\n\n#include \"artifact.h\"\n#include \"artifactvisitor.h\"\n#include \"productbuilddata.h\"\n#include \"projectbuilddata.h\"\n#include \"transformer.h\"\n\n#include <language\/language.h>\n#include <logging\/translator.h>\n#include <tools\/cleanoptions.h>\n#include <tools\/error.h>\n#include <tools\/fileinfo.h>\n#include <tools\/progressobserver.h>\n#include <tools\/qbsassert.h>\n\n#include <QCoreApplication>\n#include <QDir>\n#include <QDirIterator>\n#include <QFileInfo>\n#include <QSet>\n#include <QString>\n\nnamespace qbs {\nnamespace Internal {\n\nstatic void printRemovalMessage(const QString &path, bool dryRun, const Logger &logger)\n{\n    if (dryRun)\n        logger.qbsInfo() << Tr::tr(\"Would remove '%1'.\").arg(path);\n    else\n        logger.qbsDebug() << \"Removing '\" << path << \"'.\";\n}\n\nstatic void invalidateArtifactTimestamp(Artifact *artifact)\n{\n    if (artifact->timestamp().isValid()) {\n        artifact->clearTimestamp();\n        artifact->product->topLevelProject()->buildData->isDirty = true;\n    }\n}\n\nstatic void removeArtifactFromDisk(Artifact *artifact, bool dryRun, const Logger &logger)\n{\n    QFileInfo fileInfo(artifact->filePath());\n    if (!fileInfo.exists()) {\n        if (!dryRun)\n            invalidateArtifactTimestamp(artifact);\n        return;\n    }\n    printRemovalMessage(fileInfo.filePath(), dryRun, logger);\n    if (dryRun)\n        return;\n    invalidateArtifactTimestamp(artifact);\n    QString errorMessage;\n    if (!removeFileRecursion(fileInfo, &errorMessage))\n        throw ErrorInfo(errorMessage);\n}\n\nclass CleanupVisitor : public ArtifactVisitor\n{\npublic:\n    CleanupVisitor(const CleanOptions &options, const Logger &logger)\n        : ArtifactVisitor(Artifact::Generated)\n        , m_options(options)\n        , m_logger(logger)\n        , m_hasError(false)\n    {\n    }\n\n    void visitProduct(const ResolvedProductConstPtr &product)\n    {\n        m_product = product;\n        ArtifactVisitor::visitProduct(product);\n    }\n\n    const QSet<QString> &directories() const { return m_directories; }\n    bool hasError() const { return m_hasError; }\n\nprivate:\n    void doVisit(Artifact *artifact)\n    {\n        if (artifact->product != m_product)\n            return;\n        if (m_options.cleanType() == CleanOptions::CleanupTemporaries) {\n            QBS_CHECK(artifact->transformer);\n            foreach (Artifact * const sibling, artifact->transformer->outputs) {\n                if (artifact->product->buildData->targetArtifacts().contains(sibling))\n                    return;\n            }\n        }\n        try {\n            removeArtifactFromDisk(artifact, m_options.dryRun(), m_logger);\n        } catch (const ErrorInfo &error) {\n            if (!m_options.keepGoing())\n                throw;\n            m_logger.printWarning(error);\n            m_hasError = true;\n        }\n        m_directories << artifact->dirPath();\n    }\n\n    const CleanOptions m_options;\n    Logger m_logger;\n    bool m_hasError;\n    ResolvedProductConstPtr m_product;\n    QSet<QString> m_directories;\n};\n\nArtifactCleaner::ArtifactCleaner(const Logger &logger, ProgressObserver *observer)\n    : m_logger(logger), m_observer(observer)\n{\n}\n\nvoid ArtifactCleaner::cleanup(const TopLevelProjectPtr &project,\n        const QList<ResolvedProductPtr> &products, const CleanOptions &options)\n{\n    m_hasError = false;\n\n    const QString configString = Tr::tr(\" for configuration %1\").arg(project->id());\n    m_observer->initialize(Tr::tr(\"Cleaning up%1\").arg(configString), products.count() + 1);\n\n    QSet<QString> directories;\n    foreach (const ResolvedProductPtr &product, products) {\n        CleanupVisitor visitor(options, m_logger);\n        visitor.visitProduct(product);\n        directories.unite(visitor.directories());\n        if (visitor.hasError())\n            m_hasError = true;\n        m_observer->incrementProgressValue();\n    }\n\n    \/\/ Directories created during the build are not artifacts (TODO: should they be?),\n    \/\/ so we have to clean them up manually.\n    QList<QString> dirList = directories.toList();\n    for (int i = 0; i < dirList.count(); ++i) {\n        const QString &dir = dirList.at(i);\n        if (!dir.startsWith(project->buildDirectory))\n            continue;\n        if (FileInfo(dir).exists())\n            removeEmptyDirectories(dir, options);\n        if (dir != project->buildDirectory) {\n            const QString parentDir = QDir::cleanPath(dir + QLatin1String(\"\/..\"));\n            if (parentDir != project->buildDirectory && !dirList.contains(parentDir))\n                dirList << parentDir;\n        }\n    }\n    m_observer->incrementProgressValue();\n\n    if (m_hasError)\n        throw ErrorInfo(Tr::tr(\"Failed to remove some files.\"));\n    m_observer->setFinished();\n}\n\nvoid ArtifactCleaner::removeEmptyDirectories(const QString &rootDir, const CleanOptions &options,\n                                             bool *isEmpty)\n{\n    bool subTreeIsEmpty = true;\n    QDirIterator it(rootDir, QDir::Files | QDir::Dirs | QDir::NoDotAndDotDot);\n    while (it.hasNext()) {\n        it.next();\n        if (!it.fileInfo().isSymLink() && it.fileInfo().isDir())\n            removeEmptyDirectories(it.filePath(), options, &subTreeIsEmpty);\n        else\n            subTreeIsEmpty = false;\n    }\n    if (subTreeIsEmpty) {\n        printRemovalMessage(rootDir, options.dryRun(), m_logger);\n        if (!QDir::root().rmdir(rootDir)) {\n            ErrorInfo error(Tr::tr(\"Failure to remove empty directory '%1'.\").arg(rootDir));\n            if (!options.keepGoing())\n                throw error;\n            m_logger.printWarning(error);\n            m_hasError = true;\n            subTreeIsEmpty = false;\n        }\n    }\n    if (!subTreeIsEmpty && isEmpty)\n        *isEmpty = false;\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace qbs\n<|endoftext|>"}
{"text":"<commit_before>#if !defined(__CINT__) || defined(__MAKECINT__)\r\n#include \"TString.h\"\r\n#include \"TObjArray.h\"\r\n\r\n#include \"AliLog.h\"\r\n\r\n#include \"AliAnalysisManager.h\"\r\n#include \"AliAnalysisDataContainer.h\"\r\n\r\n#include \"AliAnalysisTaskNonlinearFlow.h\"\r\n#endif\r\n\r\nAliAnalysisTaskNonlinearFlow* AddTaskNonlinearFlow(\r\n\t\tInt_t\t\tfFilterbit \t\t= 96,\r\n\t\tDouble_t\tfMinPt\t\t\t= 0.2,\r\n\t\tDouble_t\tfMaxPt\t\t\t= 3.0,\r\n                Int_t           trigger                 = 0,\r\n                Int_t           fSystFlag               = 0,\r\n                TString         fPeriod                 = \"LHC15o\",\r\n                TString         fNtrksName              = \"Mult\",\r\n\t        Bool_t\t\tfNUA\t\t\t= true,\r\n\t        Bool_t\t\tfNUE \t\t\t= true,\r\n\t\tTString\t\tuniqueID        \t= \"\"\r\n\t\t)\r\n{\r\n        \/\/ The common parameters\r\n\tDouble_t\tfEtaCut \t\t\t= 0.8;\r\n\tDouble_t\tfVtxCut\t\t\t\t= 10.0;\r\n\tInt_t\t\tTPCclusters\t\t        = 70;\r\n\tDouble_t        chi2PerTPCcluster               = 10000;\r\n\tInt_t\t\tfMinITSClus\t\t        = 5;\r\n\tDouble_t\tfMaxChi2\t\t\t= 2.5;\r\n\tBool_t\t\tfUseDCAzCut\t\t        = false;\r\n\tDouble_t\tfDCAz\t\t\t\t= 1.0;\r\n\tBool_t\t\tfUseDCAxyCut\t                = false;\r\n\tDouble_t\tfDCAxy\t\t\t\t= 0.2;\r\n\tInt_t\t\tIsSample\t\t\t= 10;\r\n\tShort_t\t\tnCentFl\t\t\t\t= 0;\r\n\tBool_t\t\tfLS\t\t\t\t= false;\r\n\r\n\t\/\/ Creates a pid task and adds it to the analysis manager\r\n\t\/\/ Get the pointer to the existing analysis manager via the static\r\n\t\/\/access method\r\n\t\/\/=========================================================================\r\n\tAliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\r\n\tif (!mgr) {\r\n\t\tError(\"AddTaskNonlinearFlow.C\", \"No analysis manager to connect to.\");\r\n\t\treturn NULL;\r\n\t}\r\n\r\n\t\/\/ Check the analysis type using the event handlers connected to the\r\n\t\/\/ analysis manager The availability of MC handler can also be\r\n\t\/\/ checked here.\r\n\t\/\/ =========================================================================\r\n\tif (!mgr->GetInputEventHandler()) {\r\n\t\tError(\"AddTaskNonLinearFlow.C\", \"This task requires an input event handler\");\r\n\t\treturn NULL;\r\n\t}\r\n\r\n\t\/\/ Create the task and configure it\r\n\t\/\/========================================================================\r\n\tTString type = mgr->GetInputEventHandler()->GetDataType(); \/\/ can be \"ESD\" or \"AOD\"\r\n\r\n\tAliAnalysisTaskNonlinearFlow* taskFlowEp = new AliAnalysisTaskNonlinearFlow(\"taskFlowEp\", fNUA, fNUE);\r\n\ttaskFlowEp->SetDebugLevel(3);\r\n\ttaskFlowEp->SetFilterbit(fFilterbit); \/\/ For systematics\r\n\ttaskFlowEp->SetFilterbitDefault(fFilterbit);\r\n\ttaskFlowEp->SetEtaCut(fEtaCut);\r\n\ttaskFlowEp->SetVtxCut(fVtxCut); \/\/ For systematics\r\n\ttaskFlowEp->SetVtxCutDefault(fVtxCut);\r\n\ttaskFlowEp->SetMinPt(fMinPt);\r\n\ttaskFlowEp->SetMaxPt(fMaxPt);\r\n\ttaskFlowEp->SetTPCclusters(TPCclusters); \/\/ For systematics\r\n\ttaskFlowEp->SetTPCclustersDefault(TPCclusters);\r\n\ttaskFlowEp->SetChi2PerTPCcluster(chi2PerTPCcluster); \/\/ max. chi2 per TPC cluster\r\n\ttaskFlowEp->SetMinITSClusters(fMinITSClus);\r\n\ttaskFlowEp->SetMaxChi2(fMaxChi2);\r\n\ttaskFlowEp->SetUseDCAzCut(fUseDCAzCut);\r\n\ttaskFlowEp->SetDCAzCut(fDCAz); \/\/ For systematics\r\n\ttaskFlowEp->SetDCAzCutDefault(fDCAz); \r\n\ttaskFlowEp->SetUseDCAxyCut(fUseDCAxyCut);\r\n\ttaskFlowEp->SetDCAxyCut(fDCAxy); \/\/ For systematics\r\n\ttaskFlowEp->SetDCAxyCutDefault(fDCAxy); \r\n\ttaskFlowEp->SetIsSample(IsSample);\r\n\ttaskFlowEp->SetCentFlag(nCentFl);\r\n\ttaskFlowEp->SetTrigger(trigger);\r\n\ttaskFlowEp->SetLSFlag(fLS);\r\n\ttaskFlowEp->SetNUEFlag(fNUE);\r\n\ttaskFlowEp->SetNUA(fNUA);\r\n\ttaskFlowEp->SetNtrksName(fNtrksName);\r\n        taskFlowEp->SetSystFlag(fSystFlag);\r\n\r\n        taskFlowEp->SetUseWeigthsRunByRun(false);\r\n        taskFlowEp->SetUsePeriodWeigths(false);\r\n        taskFlowEp->SetUseWeights3D(false); \r\n\r\n\t\/\/....\r\n\ttaskFlowEp->SetPeriod(fPeriod);\r\n\tmgr->AddTask(taskFlowEp);\r\n\r\n\r\n\t\/\/ Create ONLY the output containers for the data produced by the\r\n\t\/\/ task.  Get and connect other common input\/output containers via\r\n\t\/\/ the manager as below\r\n\t\/\/=======================================================================\r\n\t\/\/TString fileName = AliAnalysisManager::GetCommonFileName();\r\n\t\/\/fileName+=suffixName;\r\n\tAliAnalysisDataContainer* cinput = mgr->GetCommonInputContainer();\r\n\tAliAnalysisDataContainer *cout_hist = mgr->CreateContainer(Form(\"QA_%s\", uniqueID.Data()), TList::Class(), AliAnalysisManager::kOutputContainer, Form(\"AnalysisResults.root:%s\", uniqueID.Data()));\r\n\tmgr->ConnectInput (taskFlowEp, 0, cinput);\r\n\tmgr->ConnectOutput(taskFlowEp, 1, cout_hist);\r\n\tAliAnalysisDataContainer *physics_hist = mgr->CreateContainer(Form(\"output_%s\", uniqueID.Data()), TList::Class(), AliAnalysisManager::kOutputContainer, Form(\"AnalysisResults.root:%s\", uniqueID.Data()));\r\n\tmgr->ConnectOutput(taskFlowEp, 2, physics_hist);\r\n        int outSlotCounter=2;\r\n        for (int i = 0; i < 30; i++) {\r\n            outSlotCounter++;\r\n\t    AliAnalysisDataContainer *physics_hist_i = mgr->CreateContainer(Form(\"output_%s_%d\", uniqueID.Data(), i), TList::Class(), AliAnalysisManager::kOutputContainer, Form(\"AnalysisResults.root:%s\", uniqueID.Data()));\r\n\t    mgr->ConnectOutput(taskFlowEp, outSlotCounter, physics_hist_i);\r\n        }\r\n        \r\n\tInt_t inSlotCounter=1;\r\n\tTGrid::Connect(\"alien:\");\r\n\r\n        TObjArray *AllContainers = mgr->GetContainers();\r\n\tif(fNUA) {\r\n\r\n                if(!AllContainers->FindObject(\"NUA\")) {\r\n\r\n\t\tAliAnalysisDataContainer *cin_NUA = mgr->CreateContainer(Form(\"NUA\"), TList::Class(), AliAnalysisManager::kInputContainer);\r\n                TFile *inNUA;\r\n\r\n                if (fPeriod.EqualTo(\"LHC15o\")) {\r\n\t\t\tinNUA = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/m\/mzhao\/Weights\/NUA\/WeightsPbPb15o.root\");\r\n\t\t\ttaskFlowEp->SetUseWeigthsRunByRun(true);\r\n                } else if (fPeriod.EqualTo(\"LHC15oKatarina\")) {\r\n\t\t\tinNUA = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/m\/mzhao\/Weights\/NUA\/PhiWeight_Katarina.root\");\r\n\t\t\ttaskFlowEp->SetUseWeigthsRunByRun(true);\r\n                } else if (fPeriod.EqualTo(\"LHC17\")) {\r\n\t            taskFlowEp->SetUsePeriodWeigths(true);\r\n                    if (trigger == 0) {\r\n                        inNUA = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/z\/zumoravc\/weights\/pp_LHC17\/weights_LHC17_MB_periods.root\");\r\n                    } else {\r\n\t\t\tinNUA = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/m\/mzhao\/Weights\/NUA\/Weights_pp17.root\");\r\n\t\t\ttaskFlowEp->SetUseWeigthsRunByRun(true);\r\n                    }\r\n                } else if (fPeriod.EqualTo(\"LHC15i\")) {\r\n\t            taskFlowEp->SetUsePeriodWeigths(true);\r\n\t\t    if (trigger == 0) {\r\n                        inNUA = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/z\/zumoravc\/weights\/pp_LHC15\/weights_LHC15i_MB.root\");\r\n                    } else {\r\n                        inNUA = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/z\/zumoravc\/weights\/pp_LHC15\/weights_LHC15i_HM.root\");\r\n                    }\r\n                } else if (fPeriod.EqualTo(\"LHC15l\")) {\r\n\t            taskFlowEp->SetUsePeriodWeigths(true);\r\n\t\t    if (trigger == 0) {\r\n                        inNUA = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/z\/zumoravc\/weights\/pp_LHC15\/weights_LHC15l_MB.root\");\r\n                    } else {\r\n                        inNUA = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/z\/zumoravc\/weights\/pp_LHC15\/weights_LHC15l_HM.root\");\r\n                    }\r\n                } else if (fPeriod.EqualTo(\"LHC16\")) {\r\n\t            taskFlowEp->SetUsePeriodWeigths(true);\r\n\t\t    if (trigger == 0) {\r\n                        inNUA = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/z\/zumoravc\/weights\/pp_LHC16\/weights_LHC16_MB_periods.root\");\r\n                    } else {\r\n\t\t\tinNUA = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/m\/mzhao\/Weights\/NUA\/Weights_pp16.root\");\r\n\t\t\ttaskFlowEp->SetUseWeigthsRunByRun(true);\r\n                    }\r\n                } else if (fPeriod.EqualTo(\"LHC18\")) {\r\n\t            taskFlowEp->SetUsePeriodWeigths(true);\r\n\t\t    if (trigger == 0) {\r\n                        inNUA = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/z\/zumoravc\/weights\/pp_LHC18\/weights_LHC18_MB_periods.root\");\r\n                    } else {\r\n\t\t\tinNUA = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/m\/mzhao\/Weights\/NUA\/Weights_pp18.root\");\r\n\t\t\ttaskFlowEp->SetUseWeigthsRunByRun(true);\r\n                    }\r\n                } \r\n\t\t\t\t\t\r\n                TList* weight_list = NULL;\r\n\t\tif (fPeriod.EqualTo(\"LHC15oKatarina\")) {\r\n\t\t    weight_list = dynamic_cast<TList*>(inNUA->Get(\"weightList\"));\r\n                    cin_NUA->SetData(weight_list); \r\n                } else {\r\n\t\t    weight_list = dynamic_cast<TList*>(inNUA->Get(\"WeightList\"));\r\n\t\t    cin_NUA->SetData(weight_list);\r\n                }\r\n\t\tmgr->ConnectInput(taskFlowEp,inSlotCounter,cin_NUA);\r\n\t\tinSlotCounter++;\r\n\t\t} else {\r\n\t\t    mgr->ConnectInput(taskFlowEp,inSlotCounter,(AliAnalysisDataContainer*)AllContainers->FindObject(\"NUA\"));\r\n\t\t    inSlotCounter++;\r\n\t\t    printf(\"NUA already loaded\\n\");\r\n\t\t}\r\n\t}\r\n\r\n\tif(fNUE) {\r\n\r\n                if(!AllContainers->FindObject(\"NUE\")) {\r\n                TFile *inNUE = NULL;\r\n\r\n\t\tAliAnalysisDataContainer *cin_NUE = mgr->CreateContainer(Form(\"NUE\"), TList::Class(), AliAnalysisManager::kInputContainer);\r\n                if (fPeriod.EqualTo(\"LHC15o\")) {\r\n\t\t\tinNUE = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/m\/mzhao\/Weights\/NUE\/LHC18e1_MBEff_FD_wSyst_v2.root\");\r\n\t\t\ttaskFlowEp->SetUseWeigthsRunByRun(true);\r\n                } else if (fPeriod.EqualTo(\"LHC15oKatarina\")) {\r\n\t\t\tinNUE = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/m\/mzhao\/Weights\/NUE\/TrackingEfficiency_Katarina.root\");\r\n\t\t\ttaskFlowEp->SetUseWeigthsRunByRun(true);\r\n                } else {\r\n\t\t\tinNUE = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/m\/mzhao\/Weights\/NUE\/LHC17d20a1_WithModEff_Syst.root\");\r\n\t\t\ttaskFlowEp->SetUseWeigthsRunByRun(true);\r\n\t\t}\r\n\r\n\t\tif(!inNUE) {\r\n\t\t\tprintf(\"Could not open efficiency file!\\n\");\r\n\t\t\treturn 0;\r\n\t\t}\r\n                TList* weight_list = NULL;\r\n                if (fPeriod.EqualTo(\"LHC15oKatarina\")) {\r\n\t\t    weight_list = dynamic_cast<TList*>(inNUE->Get(\"weightList\"));\r\n\t\t    cin_NUE->SetData(weight_list);\r\n                } else {\r\n\t\t    weight_list = dynamic_cast<TList*>(inNUE->Get(\"EffAndFD\"));\r\n\t\t    cin_NUE->SetData(weight_list);\r\n                }\r\n\t\tmgr->ConnectInput(taskFlowEp,inSlotCounter,cin_NUE);\r\n\t\tinSlotCounter++;\r\n           \t} else {\r\n\t\t    mgr->ConnectInput(taskFlowEp,inSlotCounter,(AliAnalysisDataContainer*)AllContainers->FindObject(\"NUE\"));\r\n\t\t    inSlotCounter++;\r\n\t\t    printf(\"NUE already loaded\\n\");\r\n\t\t}\r\n\r\n\t} \r\n\r\n\t\/\/ Return task pointer at the end\r\n\treturn taskFlowEp;\r\n}\r\n\/\/\r\n\/\/ EOF\r\n\/\/\r\n<commit_msg>fix add nonlinear flow macro<commit_after>#if !defined(__CINT__) || defined(__MAKECINT__)\r\n#include \"TString.h\"\r\n#include \"TObjArray.h\"\r\n\r\n#include \"AliLog.h\"\r\n\r\n#include \"AliAnalysisManager.h\"\r\n#include \"AliAnalysisDataContainer.h\"\r\n\r\n#include \"AliAnalysisTaskNonlinearFlow.h\"\r\n#endif\r\n\r\nAliAnalysisTaskNonlinearFlow* AddTaskNonlinearFlow(\r\n\t\tInt_t\t\tfFilterbit \t\t= 96,\r\n\t\tDouble_t\tfMinPt\t\t\t= 0.2,\r\n\t\tDouble_t\tfMaxPt\t\t\t= 3.0,\r\n                Int_t           trigger                 = 0,\r\n                Int_t           fSystFlag               = 0,\r\n                TString         fPeriod                 = \"LHC15o\",\r\n                TString         fNtrksName              = \"Mult\",\r\n\t        Bool_t\t\tfNUA\t\t\t= true,\r\n\t        Bool_t\t\tfNUE \t\t\t= true,\r\n\t\tTString\t\tuniqueID        \t= \"\"\r\n\t\t)\r\n{\r\n        \/\/ The common parameters\r\n\tDouble_t\tfEtaCut \t\t\t= 0.8;\r\n\tDouble_t\tfVtxCut\t\t\t\t= 10.0;\r\n\tInt_t\t\tTPCclusters\t\t        = 70;\r\n\tDouble_t        chi2PerTPCcluster               = 10000;\r\n\tInt_t\t\tfMinITSClus\t\t        = 5;\r\n\tDouble_t\tfMaxChi2\t\t\t= 2.5;\r\n\tBool_t\t\tfUseDCAzCut\t\t        = false;\r\n\tDouble_t\tfDCAz\t\t\t\t= 1.0;\r\n\tBool_t\t\tfUseDCAxyCut\t                = false;\r\n\tDouble_t\tfDCAxy\t\t\t\t= 0.2;\r\n\tInt_t\t\tIsSample\t\t\t= 10;\r\n\tShort_t\t\tnCentFl\t\t\t\t= 0;\r\n\tBool_t\t\tfLS\t\t\t\t= false;\r\n\r\n\t\/\/ Creates a pid task and adds it to the analysis manager\r\n\t\/\/ Get the pointer to the existing analysis manager via the static\r\n\t\/\/access method\r\n\t\/\/=========================================================================\r\n\tAliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\r\n\tif (!mgr) {\r\n\t\tError(\"AddTaskNonlinearFlow.C\", \"No analysis manager to connect to.\");\r\n\t\treturn NULL;\r\n\t}\r\n\r\n\t\/\/ Check the analysis type using the event handlers connected to the\r\n\t\/\/ analysis manager The availability of MC handler can also be\r\n\t\/\/ checked here.\r\n\t\/\/ =========================================================================\r\n\tif (!mgr->GetInputEventHandler()) {\r\n\t\tError(\"AddTaskNonLinearFlow.C\", \"This task requires an input event handler\");\r\n\t\treturn NULL;\r\n\t}\r\n\r\n\t\/\/ Create the task and configure it\r\n\t\/\/========================================================================\r\n\tTString type = mgr->GetInputEventHandler()->GetDataType(); \/\/ can be \"ESD\" or \"AOD\"\r\n\r\n\tAliAnalysisTaskNonlinearFlow* taskFlowEp = new AliAnalysisTaskNonlinearFlow(\"taskFlowEp\", fNUA, fNUE);\r\n\ttaskFlowEp->SetDebugLevel(3);\r\n\ttaskFlowEp->SetEtaCut(fEtaCut);\r\n\ttaskFlowEp->SetMinPt(fMinPt);\r\n\ttaskFlowEp->SetMaxPt(fMaxPt);\r\n\ttaskFlowEp->SetTrigger(trigger);\r\n\ttaskFlowEp->SetNUEFlag(fNUE);\r\n\ttaskFlowEp->SetNUA(fNUA);\r\n\ttaskFlowEp->SetNtrksName(fNtrksName);\r\n        taskFlowEp->SetSystFlag(fSystFlag);\r\n\r\n        taskFlowEp->SetUseWeigthsRunByRun(false);\r\n        taskFlowEp->SetUsePeriodWeigths(false);\r\n        taskFlowEp->SetUseWeights3D(false); \r\n\r\n\t\/\/....\r\n\ttaskFlowEp->SetPeriod(fPeriod);\r\n\tmgr->AddTask(taskFlowEp);\r\n\r\n\r\n\t\/\/ Create ONLY the output containers for the data produced by the\r\n\t\/\/ task.  Get and connect other common input\/output containers via\r\n\t\/\/ the manager as below\r\n\t\/\/=======================================================================\r\n\t\/\/TString fileName = AliAnalysisManager::GetCommonFileName();\r\n\t\/\/fileName+=suffixName;\r\n\tAliAnalysisDataContainer* cinput = mgr->GetCommonInputContainer();\r\n\tAliAnalysisDataContainer *cout_hist = mgr->CreateContainer(Form(\"QA_%s\", uniqueID.Data()), TList::Class(), AliAnalysisManager::kOutputContainer, Form(\"AnalysisResults.root:%s\", uniqueID.Data()));\r\n\tmgr->ConnectInput (taskFlowEp, 0, cinput);\r\n\tmgr->ConnectOutput(taskFlowEp, 1, cout_hist);\r\n\tAliAnalysisDataContainer *physics_hist = mgr->CreateContainer(Form(\"output_%s\", uniqueID.Data()), TList::Class(), AliAnalysisManager::kOutputContainer, Form(\"AnalysisResults.root:%s\", uniqueID.Data()));\r\n\tmgr->ConnectOutput(taskFlowEp, 2, physics_hist);\r\n        int outSlotCounter=2;\r\n        for (int i = 0; i < 30; i++) {\r\n            outSlotCounter++;\r\n\t    AliAnalysisDataContainer *physics_hist_i = mgr->CreateContainer(Form(\"output_%s_%d\", uniqueID.Data(), i), TList::Class(), AliAnalysisManager::kOutputContainer, Form(\"AnalysisResults.root:%s\", uniqueID.Data()));\r\n\t    mgr->ConnectOutput(taskFlowEp, outSlotCounter, physics_hist_i);\r\n        }\r\n        \r\n\tInt_t inSlotCounter=1;\r\n\tTGrid::Connect(\"alien:\");\r\n\r\n        TObjArray *AllContainers = mgr->GetContainers();\r\n\tif(fNUA) {\r\n\r\n                if(!AllContainers->FindObject(\"NUA\")) {\r\n\r\n\t\tAliAnalysisDataContainer *cin_NUA = mgr->CreateContainer(Form(\"NUA\"), TList::Class(), AliAnalysisManager::kInputContainer);\r\n                TFile *inNUA;\r\n\r\n                if (fPeriod.EqualTo(\"LHC15o\")) {\r\n\t\t\tinNUA = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/m\/mzhao\/Weights\/NUA\/WeightsPbPb15o.root\");\r\n\t\t\ttaskFlowEp->SetUseWeigthsRunByRun(true);\r\n                } else if (fPeriod.EqualTo(\"LHC15oKatarina\")) {\r\n\t\t\tinNUA = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/m\/mzhao\/Weights\/NUA\/PhiWeight_Katarina.root\");\r\n\t\t\ttaskFlowEp->SetUseWeigthsRunByRun(true);\r\n                } else if (fPeriod.EqualTo(\"LHC17\")) {\r\n\t            taskFlowEp->SetUsePeriodWeigths(true);\r\n                    if (trigger == 0) {\r\n                        inNUA = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/z\/zumoravc\/weights\/pp_LHC17\/weights_LHC17_MB_periods.root\");\r\n                    } else {\r\n\t\t\tinNUA = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/m\/mzhao\/Weights\/NUA\/Weights_pp17.root\");\r\n\t\t\ttaskFlowEp->SetUseWeigthsRunByRun(true);\r\n                    }\r\n                } else if (fPeriod.EqualTo(\"LHC15i\")) {\r\n\t            taskFlowEp->SetUsePeriodWeigths(true);\r\n\t\t    if (trigger == 0) {\r\n                        inNUA = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/z\/zumoravc\/weights\/pp_LHC15\/weights_LHC15i_MB.root\");\r\n                    } else {\r\n                        inNUA = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/z\/zumoravc\/weights\/pp_LHC15\/weights_LHC15i_HM.root\");\r\n                    }\r\n                } else if (fPeriod.EqualTo(\"LHC15l\")) {\r\n\t            taskFlowEp->SetUsePeriodWeigths(true);\r\n\t\t    if (trigger == 0) {\r\n                        inNUA = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/z\/zumoravc\/weights\/pp_LHC15\/weights_LHC15l_MB.root\");\r\n                    } else {\r\n                        inNUA = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/z\/zumoravc\/weights\/pp_LHC15\/weights_LHC15l_HM.root\");\r\n                    }\r\n                } else if (fPeriod.EqualTo(\"LHC16\")) {\r\n\t            taskFlowEp->SetUsePeriodWeigths(true);\r\n\t\t    if (trigger == 0) {\r\n                        inNUA = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/z\/zumoravc\/weights\/pp_LHC16\/weights_LHC16_MB_periods.root\");\r\n                    } else {\r\n\t\t\tinNUA = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/m\/mzhao\/Weights\/NUA\/Weights_pp16.root\");\r\n\t\t\ttaskFlowEp->SetUseWeigthsRunByRun(true);\r\n                    }\r\n                } else if (fPeriod.EqualTo(\"LHC18\")) {\r\n\t            taskFlowEp->SetUsePeriodWeigths(true);\r\n\t\t    if (trigger == 0) {\r\n                        inNUA = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/z\/zumoravc\/weights\/pp_LHC18\/weights_LHC18_MB_periods.root\");\r\n                    } else {\r\n\t\t\tinNUA = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/m\/mzhao\/Weights\/NUA\/Weights_pp18.root\");\r\n\t\t\ttaskFlowEp->SetUseWeigthsRunByRun(true);\r\n                    }\r\n                } \r\n\t\t\t\t\t\r\n                TList* weight_list = NULL;\r\n\t\tif (fPeriod.EqualTo(\"LHC15oKatarina\")) {\r\n\t\t    weight_list = dynamic_cast<TList*>(inNUA->Get(\"weightList\"));\r\n                    cin_NUA->SetData(weight_list); \r\n                } else {\r\n\t\t    weight_list = dynamic_cast<TList*>(inNUA->Get(\"WeightList\"));\r\n\t\t    cin_NUA->SetData(weight_list);\r\n                }\r\n\t\tmgr->ConnectInput(taskFlowEp,inSlotCounter,cin_NUA);\r\n\t\tinSlotCounter++;\r\n\t\t} else {\r\n\t\t    mgr->ConnectInput(taskFlowEp,inSlotCounter,(AliAnalysisDataContainer*)AllContainers->FindObject(\"NUA\"));\r\n\t\t    inSlotCounter++;\r\n\t\t    printf(\"NUA already loaded\\n\");\r\n\t\t}\r\n\t}\r\n\r\n\tif(fNUE) {\r\n\r\n                if(!AllContainers->FindObject(\"NUE\")) {\r\n                TFile *inNUE = NULL;\r\n\r\n\t\tAliAnalysisDataContainer *cin_NUE = mgr->CreateContainer(Form(\"NUE\"), TList::Class(), AliAnalysisManager::kInputContainer);\r\n                if (fPeriod.EqualTo(\"LHC15o\")) {\r\n\t\t\tinNUE = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/m\/mzhao\/Weights\/NUE\/LHC18e1_MBEff_FD_wSyst_v2.root\");\r\n\t\t\ttaskFlowEp->SetUseWeigthsRunByRun(true);\r\n                } else if (fPeriod.EqualTo(\"LHC15oKatarina\")) {\r\n\t\t\tinNUE = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/m\/mzhao\/Weights\/NUE\/TrackingEfficiency_Katarina.root\");\r\n\t\t\ttaskFlowEp->SetUseWeigthsRunByRun(true);\r\n                } else {\r\n\t\t\tinNUE = TFile::Open(\"alien:\/\/\/alice\/cern.ch\/user\/m\/mzhao\/Weights\/NUE\/LHC17d20a1_WithModEff_Syst.root\");\r\n\t\t\ttaskFlowEp->SetUseWeigthsRunByRun(true);\r\n\t\t}\r\n\r\n\t\tif(!inNUE) {\r\n\t\t\tprintf(\"Could not open efficiency file!\\n\");\r\n\t\t\treturn 0;\r\n\t\t}\r\n                TList* weight_list = NULL;\r\n                if (fPeriod.EqualTo(\"LHC15oKatarina\")) {\r\n\t\t    weight_list = dynamic_cast<TList*>(inNUE->Get(\"weightList\"));\r\n\t\t    cin_NUE->SetData(weight_list);\r\n                } else {\r\n\t\t    weight_list = dynamic_cast<TList*>(inNUE->Get(\"EffAndFD\"));\r\n\t\t    cin_NUE->SetData(weight_list);\r\n                }\r\n\t\tmgr->ConnectInput(taskFlowEp,inSlotCounter,cin_NUE);\r\n\t\tinSlotCounter++;\r\n           \t} else {\r\n\t\t    mgr->ConnectInput(taskFlowEp,inSlotCounter,(AliAnalysisDataContainer*)AllContainers->FindObject(\"NUE\"));\r\n\t\t    inSlotCounter++;\r\n\t\t    printf(\"NUE already loaded\\n\");\r\n\t\t}\r\n\r\n\t} \r\n\r\n\t\/\/ Return task pointer at the end\r\n\treturn taskFlowEp;\r\n}\r\n\/\/\r\n\/\/ EOF\r\n\/\/\r\n<|endoftext|>"}
{"text":"<commit_before>\/\/ -*- Mode: C++; tab-width: 2; -*-\n\/\/ vi: set ts=2:\n\/\/\n\n\/\/ A small example application for creating random numbers.\n\n#include <BALL\/MATHS\/randomNumberGenerator.h>\n#include <BALL\/DATATYPE\/string.h>\n\nusing namespace BALL;\n\nint main(int argc, char** argv)\n{\n\tSize numbers;\n\n\tif (argc != 2)\n\t{\n\t\tnumbers = 20;\n\t\tstd::cerr << \"Creating 20 random numbers. Call me with the number of random numbers you want.\" \n\t\t\t<< std::endl;\n\t}\n\telse\n\t{\n\t\tString argument(argv[1]);\n\t\tnumbers = argument.toInt();\n\t}\n\t\n\tstd::cout << \"******************************\" << std::endl;\n\n\tdouble r, rmin=1e32, rmax=-1e32;\n\n\tRandomNumberGenerator rng;\n\trng.setup(1802, 9373);\n\n\tfor (Size i=0; i < numbers; i++)\n\t{\n\t\tr = rng.randomUniform();\n\t\tif (r < rmin) rmin = r;\n\t\tif (r > rmax) rmax = r;\n\t\tstd::cout << r << std::endl;\n\t}\n\tstd::cout << \"******************************\" << std::endl;\n\tstd::cout << \"min: \" << rmin << \"  max: \" << rmax << std::endl; \n\n}\n<commit_msg>Remove BALL::RNG from create_random_numbers<commit_after>\/\/ -*- Mode: C++; tab-width: 2; -*-\n\/\/ vi: set ts=2:\n\/\/\n\n\/\/ A small example application for creating random numbers.\n\n#include <BALL\/DATATYPE\/string.h>\n#include <BALL\/CONCEPT\/timeStamp.h>\n\n#include <boost\/random\/mersenne_twister.hpp>\n#include <boost\/random\/uniform_01.hpp>\n\nusing namespace BALL;\n\nint main(int argc, char** argv)\n{\n\tSize numbers;\n\n\tif (argc != 2)\n\t{\n\t\tnumbers = 20;\n\t\tstd::cerr << \"Creating 20 random numbers. Call me with the number of random numbers you want.\" \n\t\t\t<< std::endl;\n\t}\n\telse\n\t{\n\t\tString argument(argv[1]);\n\t\tnumbers = argument.toInt();\n\t}\n\t\n\tstd::cout << \"******************************\" << std::endl;\n\n\tdouble r, rmin=1e32, rmax=-1e32;\n\n\tboost::mt19937 rng(PreciseTime::now().getMicroSeconds());\n\tboost::uniform_01<double> unif;\n\n\tfor (Size i=0; i < numbers; i++)\n\t{\n\t\tr = unif(rng);\n\t\tif (r < rmin) rmin = r;\n\t\tif (r > rmax) rmax = r;\n\t\tstd::cout << r << std::endl;\n\t}\n\tstd::cout << \"******************************\" << std::endl;\n\tstd::cout << \"min: \" << rmin << \"  max: \" << rmax << std::endl; \n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"core_configuration.hpp\"\n#include \"libkrbn.h\"\n#include \"libkrbn.hpp\"\n\nbool libkrbn_core_configuration_initialize(libkrbn_core_configuration** out, const char* file_path) {\n  if (!out) return false;\n  \/\/ return if already initialized.\n  if (*out) return false;\n\n  *out = reinterpret_cast<libkrbn_core_configuration*>(new core_configuration(libkrbn::get_logger(), file_path));\n  return true;\n}\n\nvoid libkrbn_core_configuration_terminate(libkrbn_core_configuration** p) {\n  if (p && *p) {\n    delete reinterpret_cast<core_configuration*>(*p);\n    *p = nullptr;\n  }\n}\n\nbool libkrbn_core_configuration_is_loaded(libkrbn_core_configuration* p) {\n  if (auto c = reinterpret_cast<core_configuration*>(p)) {\n    return c->is_loaded();\n  }\n  return false;\n}\n\nbool libkrbn_core_configuration_get_global_configuration_check_for_updates_on_startup(libkrbn_core_configuration* _Nonnull p) {\n  if (libkrbn_core_configuration_is_loaded(p)) {\n    if (auto c = reinterpret_cast<core_configuration*>(p)) {\n      return (c->get_global_configuration()).get_check_for_updates_on_startup();\n    }\n  }\n  return false;\n}\n\nbool libkrbn_core_configuration_get_global_configuration_show_in_menu_bar(libkrbn_core_configuration* _Nonnull p) {\n  if (libkrbn_core_configuration_is_loaded(p)) {\n    if (auto c = reinterpret_cast<core_configuration*>(p)) {\n      return (c->get_global_configuration()).get_show_in_menu_bar();\n    }\n  }\n  return false;\n}\n\nbool libkrbn_core_configuration_get_global_configuration_show_profile_name_in_menu_bar(libkrbn_core_configuration* _Nonnull p) {\n  if (libkrbn_core_configuration_is_loaded(p)) {\n    if (auto c = reinterpret_cast<core_configuration*>(p)) {\n      return (c->get_global_configuration()).get_show_profile_name_in_menu_bar();\n    }\n  }\n  return false;\n}\n<commit_msg>remove is_loaded check<commit_after>#include \"core_configuration.hpp\"\n#include \"libkrbn.h\"\n#include \"libkrbn.hpp\"\n\nbool libkrbn_core_configuration_initialize(libkrbn_core_configuration** out, const char* file_path) {\n  if (!out) return false;\n  \/\/ return if already initialized.\n  if (*out) return false;\n\n  *out = reinterpret_cast<libkrbn_core_configuration*>(new core_configuration(libkrbn::get_logger(), file_path));\n  return true;\n}\n\nvoid libkrbn_core_configuration_terminate(libkrbn_core_configuration** p) {\n  if (p && *p) {\n    delete reinterpret_cast<core_configuration*>(*p);\n    *p = nullptr;\n  }\n}\n\nbool libkrbn_core_configuration_is_loaded(libkrbn_core_configuration* p) {\n  if (auto c = reinterpret_cast<core_configuration*>(p)) {\n    return c->is_loaded();\n  }\n  return false;\n}\n\nbool libkrbn_core_configuration_get_global_configuration_check_for_updates_on_startup(libkrbn_core_configuration* _Nonnull p) {\n  if (auto c = reinterpret_cast<core_configuration*>(p)) {\n    return (c->get_global_configuration()).get_check_for_updates_on_startup();\n  }\n  return false;\n}\n\nbool libkrbn_core_configuration_get_global_configuration_show_in_menu_bar(libkrbn_core_configuration* _Nonnull p) {\n  if (auto c = reinterpret_cast<core_configuration*>(p)) {\n    return (c->get_global_configuration()).get_show_in_menu_bar();\n  }\n  return false;\n}\n\nbool libkrbn_core_configuration_get_global_configuration_show_profile_name_in_menu_bar(libkrbn_core_configuration* _Nonnull p) {\n  if (auto c = reinterpret_cast<core_configuration*>(p)) {\n    return (c->get_global_configuration()).get_show_profile_name_in_menu_bar();\n  }\n  return false;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"departure_boards.h\"\n#include \"request_handle.h\"\n#include \"get_stop_times.h\"\n#include \"type\/pb_converter.h\"\n#include \"boost\/lexical_cast.hpp\"\n#include \"boost\/date_time\/posix_time\/posix_time.hpp\"\n#include \"utils\/paginate.h\"\n\nnamespace pt = boost::posix_time;\n\nnamespace navitia { namespace timetables {\n\nstd::vector<vector_datetime> make_columuns(const vector_dt_st &stop_times) {\n    std::vector<vector_datetime> result;\n    DateTime prev_date = DateTimeUtils::inf;\n\n    for(auto & item : stop_times) {\n        if(prev_date == DateTimeUtils::inf ||\n                (DateTimeUtils::hour(prev_date)\/3600) != (DateTimeUtils::hour(item.first)\/3600)) {\n            \/\/On supprime les doublons\n            if(result.size() > 0) {\n                auto last = result.back();\n                auto it = std::unique(last.begin(), last.end());\n                last.resize(std::distance(last.begin(), it));\n            }\n            result.push_back(vector_datetime());\n        }\n\n        result.back().push_back(item.first);\n        prev_date = item.first;\n    }\n\n    if(result.size() > 0) {\n        auto it = std::unique(result.back().begin(), result.back().end());\n        result.back().resize(std::distance(result.back().begin(), it));\n    }\n\n    return result;\n}\n\n\npbnavitia::Response\nrender_v0(const std::map<stop_point_line, vector_dt_st> &map_route_stop_point,\n          DateTime datetime, DateTime max_datetime,\n          const type::Data &data) {\n    pbnavitia::Response response;\n    auto current_time = pt::second_clock::local_time();\n    pt::time_period action_period(to_posix_time(datetime, data),\n                                  to_posix_time(max_datetime, data));\n\n    auto sort_predicate =\n        [&](datetime_stop_time d1, datetime_stop_time d2)->bool {\n            auto hour1 = DateTimeUtils::hour(d1.first) % DateTimeUtils::SECONDS_PER_DAY;\n            auto hour2 = DateTimeUtils::hour(d2.first) % DateTimeUtils::SECONDS_PER_DAY;\n            return std::abs(hour1 - DateTimeUtils::hour(datetime)) <\n                   std::abs(hour2 - DateTimeUtils::hour(datetime));\n        };\n\n    for(auto id_vec : map_route_stop_point) {\n\n        auto board = response.add_departure_boards();\n        fill_pb_object(data.pt_data.stop_points[id_vec.first.first], data,\n                       board->mutable_stop_point(), 1,\n                       current_time, action_period);\n        fill_pb_object(data.pt_data.routes[id_vec.first.second], data,\n                       board->mutable_route(), 2, current_time, action_period);\n\n        auto vec_st = id_vec.second;\n        std::sort(vec_st.begin(), vec_st.end(), sort_predicate);\n\n        for(auto vec : make_columuns(vec_st)) {\n            pbnavitia::BoardItem *item = board->add_board_items();\n\n            for(DateTime dt : vec) {\n                if(!item->has_hour()) {\n                    auto hours = DateTimeUtils::hour(dt)\/3600;\n                    item->set_hour(boost::lexical_cast<std::string>(hours));\n                }\n                auto minutes = (DateTimeUtils::hour(dt)%3600)\/60;\n                item->add_minutes(boost::lexical_cast<std::string>(minutes));\n            }\n        }\n    }\n    return response;\n}\n\n\npbnavitia::Response\nrender_v1(const std::map<uint32_t, pbnavitia::ResponseStatus> &response_status,\n          const std::map<stop_point_line, vector_dt_st> &map_route_stop_point,\n          DateTime datetime, DateTime max_datetime,\n          const type::Data &data) {\n    pbnavitia::Response response;\n    auto current_time = pt::second_clock::local_time();\n    auto now = pt::second_clock::local_time();\n    pt::time_period action_period(to_posix_time(datetime, data),\n                                  to_posix_time(max_datetime, data));\n\n    for(auto id_vec : map_route_stop_point) {\n        auto schedule = response.add_stop_schedules();\n        \/\/Each schedule has a stop_point and a route\n        fill_pb_object(data.pt_data.stop_points[id_vec.first.first], data,\n                       schedule->mutable_stop_point(), 0,\n                       current_time, action_period);\n\n        auto m_route = schedule->mutable_route();\n        fill_pb_object(data.pt_data.routes[id_vec.first.second], data,\n                               m_route, 0, current_time, action_period);\n        if (data.pt_data.routes[id_vec.first.second]->line != nullptr){\n            auto m_line = m_route->mutable_line();\n            fill_pb_object(data.pt_data.routes[id_vec.first.second]->line, data,\n                                   m_line, 0, current_time, action_period);\n        }\n        auto pt_display_information = schedule->mutable_pt_display_informations();\n        fill_pb_object(data.pt_data.routes[id_vec.first.second], data,\n                               pt_display_information, 0, current_time, action_period);\n        \/\/Now we fill the date_times\n        for(auto dt_st : id_vec.second) {\n            auto date_time = schedule->add_date_times();\n            fill_pb_object(dt_st.second, data, date_time, 0,\n                           now, action_period, dt_st.first);\n        }\n        auto it = response_status.at(id_vec.first.second);\n        if(it != pbnavitia::ResponseStatus::default_status){\n            schedule->set_status(it);\n        }\n    }\n    return response;\n}\n\n\npbnavitia::Response\ndeparture_board(const std::string& request, const std::vector<std::string>& forbidden_uris,\n                const std::string& date,\n                uint32_t duration, int32_t max_date_times,\n                int interface_version,\n                int count, int start_page, const type::Data &data) {\n\n    RequestHandle handler(\"DEPARTURE_BOARD\", request, forbidden_uris, date,  duration, data);\n\n    if(handler.pb_response.has_error())\n        return handler.pb_response;\n\n    if(handler.journey_pattern_points.size() == 0)\n        return handler.pb_response;\n\n    if (max_date_times < 0) {\n        fill_pb_error(pbnavitia::Error::bad_filter, \"stop_schedules : value of max_date_times invalid\", handler.pb_response.mutable_error());\n        return handler.pb_response;\n    }\n    \/\/  <idx_route, status>\n    std::map<uint32_t, pbnavitia::ResponseStatus> response_status;\n\n    std::map<stop_point_line, vector_dt_st> map_route_stop_point;\n    \/\/Mapping route\/stop_point\n    std::vector<stop_point_line> sps_routes;\n    for(auto jpp_idx : handler.journey_pattern_points) {\n        auto jpp = data.pt_data.journey_pattern_points[jpp_idx];\n        auto route_idx  = jpp->journey_pattern->route->idx;        \n        auto sp_idx = jpp->stop_point->idx;\n        stop_point_line key = stop_point_line(sp_idx, route_idx);\n        auto find_predicate = [&](stop_point_line spl) {\n            return spl.first == key.first && spl.second == key.second;\n        };\n        auto it = std::find_if(sps_routes.begin(), sps_routes.end(), find_predicate);\n        if(it == sps_routes.end()){\n            sps_routes.push_back(key);\n            response_status[route_idx] = pbnavitia::ResponseStatus::default_status;\n        }\n    }\n    size_t total_result = sps_routes.size();\n    sps_routes = paginate(sps_routes, count, start_page);\n    \/\/Trie des vecteurs de date_times stop_times\n    auto sort_predicate = [](datetime_stop_time dt1, datetime_stop_time dt2) {\n                    return dt1.first < dt2.first;\n                };\n    \/\/ On regroupe entre eux les stop_times appartenant\n    \/\/ au meme couple (stop_point, route)\n    \/\/ On veut en effet afficher les départs regroupés par route\n    \/\/ (une route étant une vague direction commerciale\n    for(auto sp_route : sps_routes) {\n        std::vector<datetime_stop_time> stop_times;\n        const type::StopPoint* stop_point = data.pt_data.stop_points[sp_route.first];\n        const type::Route* route = data.pt_data.routes[sp_route.second];\n        auto jpps = stop_point->journey_pattern_point_list;\n        for(auto jpp : jpps) {\n            if(jpp->journey_pattern->route == route) {                 \n                if(stop_point->idx == jpp->journey_pattern->journey_pattern_point_list.back()->stop_point->idx){ \/\/ dans le cas de terminus\n                    response_status[route->idx] = pbnavitia::ResponseStatus::terminus;\n                }else{\n                        auto tmp = get_stop_times({jpp->idx}, handler.date_time,\n                                                         handler.max_datetime,\n                                                         max_date_times, data);\n                        if(tmp.size() == 0){\n                            response_status[route->idx] = pbnavitia::ResponseStatus::no_departure_this_day;\n                        }else{\n                            stop_times.insert(stop_times.end(), tmp.begin(), tmp.end());\n                        }\n                }\n            }\n        }\n        std::sort(stop_times.begin(), stop_times.end(), sort_predicate);\n        auto to_insert = std::pair<stop_point_line, vector_dt_st>(sp_route, stop_times);\n        map_route_stop_point.insert(to_insert);\n    }\n\n    if(interface_version == 0) {\n        handler.pb_response = render_v0(map_route_stop_point,\n                                        handler.date_time,\n                                        handler.max_datetime, data);\n    } else if(interface_version == 1) {\n        handler.pb_response = render_v1(response_status, map_route_stop_point,\n                                        handler.date_time,\n                                        handler.max_datetime, data);\n    }\n\n\n    auto pagination = handler.pb_response.mutable_pagination();\n    pagination->set_totalresult(total_result);\n    pagination->set_startpage(start_page);\n    pagination->set_itemsperpage(count);\n    pagination->set_itemsonpage(std::max(handler.pb_response.departure_boards_size(),\n                                         handler.pb_response.stop_schedules_size()));\n\n    return handler.pb_response;\n}\n}\n}\n<commit_msg>Departureboards: Added default status<commit_after>#include \"departure_boards.h\"\n#include \"request_handle.h\"\n#include \"get_stop_times.h\"\n#include \"type\/pb_converter.h\"\n#include \"boost\/lexical_cast.hpp\"\n#include \"boost\/date_time\/posix_time\/posix_time.hpp\"\n#include \"utils\/paginate.h\"\n\nnamespace pt = boost::posix_time;\n\nnamespace navitia { namespace timetables {\n\nstd::vector<vector_datetime> make_columuns(const vector_dt_st &stop_times) {\n    std::vector<vector_datetime> result;\n    DateTime prev_date = DateTimeUtils::inf;\n\n    for(auto & item : stop_times) {\n        if(prev_date == DateTimeUtils::inf ||\n                (DateTimeUtils::hour(prev_date)\/3600) != (DateTimeUtils::hour(item.first)\/3600)) {\n            \/\/On supprime les doublons\n            if(result.size() > 0) {\n                auto last = result.back();\n                auto it = std::unique(last.begin(), last.end());\n                last.resize(std::distance(last.begin(), it));\n            }\n            result.push_back(vector_datetime());\n        }\n\n        result.back().push_back(item.first);\n        prev_date = item.first;\n    }\n\n    if(result.size() > 0) {\n        auto it = std::unique(result.back().begin(), result.back().end());\n        result.back().resize(std::distance(result.back().begin(), it));\n    }\n\n    return result;\n}\n\n\npbnavitia::Response\nrender_v0(const std::map<stop_point_line, vector_dt_st> &map_route_stop_point,\n          DateTime datetime, DateTime max_datetime,\n          const type::Data &data) {\n    pbnavitia::Response response;\n    auto current_time = pt::second_clock::local_time();\n    pt::time_period action_period(to_posix_time(datetime, data),\n                                  to_posix_time(max_datetime, data));\n\n    auto sort_predicate =\n        [&](datetime_stop_time d1, datetime_stop_time d2)->bool {\n            auto hour1 = DateTimeUtils::hour(d1.first) % DateTimeUtils::SECONDS_PER_DAY;\n            auto hour2 = DateTimeUtils::hour(d2.first) % DateTimeUtils::SECONDS_PER_DAY;\n            return std::abs(hour1 - DateTimeUtils::hour(datetime)) <\n                   std::abs(hour2 - DateTimeUtils::hour(datetime));\n        };\n\n    for(auto id_vec : map_route_stop_point) {\n\n        auto board = response.add_departure_boards();\n        fill_pb_object(data.pt_data.stop_points[id_vec.first.first], data,\n                       board->mutable_stop_point(), 1,\n                       current_time, action_period);\n        fill_pb_object(data.pt_data.routes[id_vec.first.second], data,\n                       board->mutable_route(), 2, current_time, action_period);\n\n        auto vec_st = id_vec.second;\n        std::sort(vec_st.begin(), vec_st.end(), sort_predicate);\n\n        for(auto vec : make_columuns(vec_st)) {\n            pbnavitia::BoardItem *item = board->add_board_items();\n\n            for(DateTime dt : vec) {\n                if(!item->has_hour()) {\n                    auto hours = DateTimeUtils::hour(dt)\/3600;\n                    item->set_hour(boost::lexical_cast<std::string>(hours));\n                }\n                auto minutes = (DateTimeUtils::hour(dt)%3600)\/60;\n                item->add_minutes(boost::lexical_cast<std::string>(minutes));\n            }\n        }\n    }\n    return response;\n}\n\n\npbnavitia::Response\nrender_v1(const std::map<uint32_t, pbnavitia::ResponseStatus> &response_status,\n          const std::map<stop_point_line, vector_dt_st> &map_route_stop_point,\n          DateTime datetime, DateTime max_datetime,\n          const type::Data &data) {\n    pbnavitia::Response response;\n    auto current_time = pt::second_clock::local_time();\n    auto now = pt::second_clock::local_time();\n    pt::time_period action_period(to_posix_time(datetime, data),\n                                  to_posix_time(max_datetime, data));\n\n    for(auto id_vec : map_route_stop_point) {\n        auto schedule = response.add_stop_schedules();\n        \/\/Each schedule has a stop_point and a route\n        fill_pb_object(data.pt_data.stop_points[id_vec.first.first], data,\n                       schedule->mutable_stop_point(), 0,\n                       current_time, action_period);\n\n        auto m_route = schedule->mutable_route();\n        fill_pb_object(data.pt_data.routes[id_vec.first.second], data,\n                               m_route, 0, current_time, action_period);\n        if (data.pt_data.routes[id_vec.first.second]->line != nullptr){\n            auto m_line = m_route->mutable_line();\n            fill_pb_object(data.pt_data.routes[id_vec.first.second]->line, data,\n                                   m_line, 0, current_time, action_period);\n        }\n        auto pt_display_information = schedule->mutable_pt_display_informations();\n        fill_pb_object(data.pt_data.routes[id_vec.first.second], data,\n                               pt_display_information, 0, current_time, action_period);\n        \/\/Now we fill the date_times\n        for(auto dt_st : id_vec.second) {\n            auto date_time = schedule->add_date_times();\n            fill_pb_object(dt_st.second, data, date_time, 0,\n                           now, action_period, dt_st.first);\n        }\n        auto it = response_status.at(id_vec.first.second);\n        schedule->set_status(it);\n    }\n    return response;\n}\n\n\npbnavitia::Response\ndeparture_board(const std::string& request, const std::vector<std::string>& forbidden_uris,\n                const std::string& date,\n                uint32_t duration, int32_t max_date_times,\n                int interface_version,\n                int count, int start_page, const type::Data &data) {\n\n    RequestHandle handler(\"DEPARTURE_BOARD\", request, forbidden_uris, date,  duration, data);\n\n    if(handler.pb_response.has_error())\n        return handler.pb_response;\n\n    if(handler.journey_pattern_points.size() == 0)\n        return handler.pb_response;\n\n    if (max_date_times < 0) {\n        fill_pb_error(pbnavitia::Error::bad_filter, \"stop_schedules : value of max_date_times invalid\", handler.pb_response.mutable_error());\n        return handler.pb_response;\n    }\n    \/\/  <idx_route, status>\n    std::map<uint32_t, pbnavitia::ResponseStatus> response_status;\n\n    std::map<stop_point_line, vector_dt_st> map_route_stop_point;\n    \/\/Mapping route\/stop_point\n    std::vector<stop_point_line> sps_routes;\n    for(auto jpp_idx : handler.journey_pattern_points) {\n        auto jpp = data.pt_data.journey_pattern_points[jpp_idx];\n        auto route_idx  = jpp->journey_pattern->route->idx;        \n        auto sp_idx = jpp->stop_point->idx;\n        stop_point_line key = stop_point_line(sp_idx, route_idx);\n        auto find_predicate = [&](stop_point_line spl) {\n            return spl.first == key.first && spl.second == key.second;\n        };\n        auto it = std::find_if(sps_routes.begin(), sps_routes.end(), find_predicate);\n        if(it == sps_routes.end()){\n            sps_routes.push_back(key);\n            response_status[route_idx] = pbnavitia::ResponseStatus::default_status;\n        }\n    }\n    size_t total_result = sps_routes.size();\n    sps_routes = paginate(sps_routes, count, start_page);\n    \/\/Trie des vecteurs de date_times stop_times\n    auto sort_predicate = [](datetime_stop_time dt1, datetime_stop_time dt2) {\n                    return dt1.first < dt2.first;\n                };\n    \/\/ On regroupe entre eux les stop_times appartenant\n    \/\/ au meme couple (stop_point, route)\n    \/\/ On veut en effet afficher les départs regroupés par route\n    \/\/ (une route étant une vague direction commerciale\n    for(auto sp_route : sps_routes) {\n        std::vector<datetime_stop_time> stop_times;\n        const type::StopPoint* stop_point = data.pt_data.stop_points[sp_route.first];\n        const type::Route* route = data.pt_data.routes[sp_route.second];\n        auto jpps = stop_point->journey_pattern_point_list;\n        for(auto jpp : jpps) {\n            if(jpp->journey_pattern->route == route) {                 \n                if(stop_point->idx == jpp->journey_pattern->journey_pattern_point_list.back()->stop_point->idx){ \/\/ dans le cas de terminus\n                    response_status[route->idx] = pbnavitia::ResponseStatus::terminus;\n                }else{\n                        auto tmp = get_stop_times({jpp->idx}, handler.date_time,\n                                                         handler.max_datetime,\n                                                         max_date_times, data);\n                        if(tmp.size() == 0){\n                            response_status[route->idx] = pbnavitia::ResponseStatus::no_departure_this_day;\n                        }else{\n                            stop_times.insert(stop_times.end(), tmp.begin(), tmp.end());\n                        }\n                }\n            }\n        }\n        std::sort(stop_times.begin(), stop_times.end(), sort_predicate);\n        auto to_insert = std::pair<stop_point_line, vector_dt_st>(sp_route, stop_times);\n        map_route_stop_point.insert(to_insert);\n    }\n\n    if(interface_version == 0) {\n        handler.pb_response = render_v0(map_route_stop_point,\n                                        handler.date_time,\n                                        handler.max_datetime, data);\n    } else if(interface_version == 1) {\n        handler.pb_response = render_v1(response_status, map_route_stop_point,\n                                        handler.date_time,\n                                        handler.max_datetime, data);\n    }\n\n\n    auto pagination = handler.pb_response.mutable_pagination();\n    pagination->set_totalresult(total_result);\n    pagination->set_startpage(start_page);\n    pagination->set_itemsperpage(count);\n    pagination->set_itemsonpage(std::max(handler.pb_response.departure_boards_size(),\n                                         handler.pb_response.stop_schedules_size()));\n\n    return handler.pb_response;\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, \"Registration was unsucessful, please try again.\", 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\tui->valueVerificationSequence->setDisabled( true );\n\tui->valueVerificationSequence->setText( \"\" );\n\tenableButton( User1, false );\n\tupdateStatus( \"\" );\n\n\t\/\/ emit UIN 0, to enable 'register new account' button again in dialog below\n\temit registeredNumber( 0, QString( \"\" ) );\n\n\tslotClose();\n\tdeleteLater();\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<commit_msg>don't delete manualy our kids!! QT will try to do it too, and kaboom<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, \"Registration was unsucessful, please try again.\", 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\tui->valueVerificationSequence->setDisabled( true );\n\tui->valueVerificationSequence->setText( \"\" );\n\tenableButton( User1, false );\n\tupdateStatus( \"\" );\n\n\t\/\/ emit UIN 0, to enable 'register new account' button again in dialog below\n\temit registeredNumber( 0, QString( \"\" ) );\n\n\tdeleteLater();\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\tdeleteLater();\n}\n\nGaduRegisterAccount::~GaduRegisterAccount( )\n{\n\tkdDebug( 14100 ) << \" register Cancel \" << endl;\n}\n\n#include \"gaduregisteraccount.moc\"\n<|endoftext|>"}
{"text":"<commit_before>\/*%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n Header:       FGConfigFile.h\n Author:       Jon Berndt\n Date started: 03\/29\/00\n Purpose:      Config file read-in class\n Called by:    FGAircraft\n\nFUNCTIONAL DESCRIPTION\n--------------------------------------------------------------------------------\n\nHISTORY\n--------------------------------------------------------------------------------\n03\/16\/2000 JSB  Created\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nINCLUDES\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%*\/\n\n#include \"FGConfigFile.h\"\n#include <stdlib.h>\n#include <math.h>\n\nstatic const char *IdSrc = \"$Id: FGConfigFile.cpp,v 1.27 2001\/11\/14 23:53:25 jberndt Exp $\";\nstatic const char *IdHdr = ID_CONFIGFILE;\n\n\/*%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nCLASS IMPLEMENTATION\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%*\/\n\nFGConfigFile::FGConfigFile(string cfgFileName)\n{\n#if defined ( sgi ) && !defined( __GNUC__ )\n  cfgfile.open(cfgFileName.c_str(), ios::in );\n#else\n  cfgfile.open(cfgFileName.c_str(), ios::in | ios::binary );\n#endif\n  CommentsOn = false;\n  CurrentIndex = 0;\n  Opened = true;\n#if defined ( sgi ) && !defined( __GNUC__ )\n   if (!cfgfile.fail() && !cfgfile.eof())  GetNextConfigLine();\n#else\n  if (cfgfile.is_open()) GetNextConfigLine();\n#endif\n  else Opened = false;\n\n  if (debug_lvl & 2) cout << \"Instantiated: FGConfigFile\" << endl;\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nFGConfigFile::~FGConfigFile()\n{\n  cfgfile.close();\n  if (debug_lvl & 2) cout << \"Destroyed:    FGConfigFile\" << endl;\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nstring FGConfigFile::GetNextConfigLine(void)\n{\n  int deblank;\n\n  do {\n    CurrentLine = GetLine();\n    if (CurrentLine.find(\"<!--\") != CurrentLine.npos) {\n      CommentsOn = true;\n      CommentString = \"\";\n      if (CurrentLine.find(\"<!--\") != CurrentLine.npos)\n        CurrentLine.erase(CurrentLine.find(\"<!--\"),4);\n      while((deblank = CurrentLine.find(\" \")) != CurrentLine.npos) CurrentLine.erase(deblank,1);\n      if (CurrentLine.size() <= 2) CurrentLine = \"\";\n    }\n\n    if (CurrentLine.find(\"-->\") != CurrentLine.npos) {\n      CommentsOn = false;\n\n      if (CurrentLine.find(\"-->\") != CurrentLine.npos)\n        CurrentLine.erase(CurrentLine.find(\"-->\"),4);\n\n      while((deblank = CurrentLine.find(\" \")) != CurrentLine.npos) CurrentLine.erase(deblank,1);\n      if (CurrentLine.size() <= 2) CurrentLine = \"\";\n\n      CommentString += CurrentLine;\n      GetNextConfigLine();\n    }\n\n    if (CommentsOn) CommentString += CurrentLine + \"\\r\\n\";\n\n  } while (CommentsOn);\n\n  if (CurrentLine.length() == 0) GetNextConfigLine();\n  CurrentIndex = 0;\n  return CurrentLine;\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nstring FGConfigFile::GetCommentString(void)\n{\n    return CommentString;\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nstring FGConfigFile::GetValue(string val)\n{\n  unsigned int pos, p1, p2, ptest;\n\n  if (val == \"\") {    \/\/ this call is to return the tag value\n    pos = CurrentLine.find(\"<\");\n    if (pos != CurrentLine.npos) { \/\/ beginning brace found \"<\"\n      p1 = CurrentLine.find_first_not_of(\" \",pos+1);\n      if (p1 != CurrentLine.npos) { \/\/ found first character of tag\n        p2 = CurrentLine.find_first_of(\" >\",p1+1);\n        if (p2 == CurrentLine.npos) p2 = p1+1;\n        return CurrentLine.substr(p1,p2-p1);\n      }\n    } else {   \/\/ beginning brace \"<\" not found; this is a regular data line\n      pos = CurrentLine.find_first_not_of(\" \");\n      if (pos != CurrentLine.npos) {  \/\/ first character in line found\n        p2 = CurrentLine.find_first_of(\" \",pos+1);\n        if (p2 != CurrentLine.npos) {\n          return CurrentLine.substr(pos,p2-pos);\n        } else {\n          return CurrentLine.substr(pos,CurrentLine.length()-pos);\n        }\n      }\n    }\n  } else { \/\/ return a value for a specific tag\n    pos = CurrentLine.find(val);\n    if (pos != CurrentLine.npos) {\n      pos = CurrentLine.find(\"=\",pos);\n      if (pos != CurrentLine.npos) {\n        ptest = CurrentLine.find_first_not_of(\" \",pos+1);\n        if (ptest != CurrentLine.npos) {\n          p1 = ptest + 1;\n          if (CurrentLine[ptest] == '\"') { \/\/ quoted\n            p2 = CurrentLine.find_first_of(\"\\\"\",p1);\n          } else { \/\/ not quoted\n            p2 = CurrentLine.find_first_of(\" \",p1);\n          }\n          if (p2 != CurrentLine.npos) {\n            return CurrentLine.substr(p1,p2-p1);\n          }\n        }\n      } else {   \/\/ \"=\" not found\n        pos = CurrentLine.find(val);\n        pos = CurrentLine.find_first_of(\" \",pos+1);\n        ptest = CurrentLine.find_first_not_of(\" \",pos+1);\n        if (ptest != CurrentLine.npos) {\n          if (CurrentLine[ptest] == '\"') { \/\/ quoted\n            p1 = ptest + 1;\n            p2 = CurrentLine.find_first_of(\"\\\"\",p1);\n          } else { \/\/ not quoted\n            p1 = ptest;\n            p2 = CurrentLine.find_first_of(\" \",p1);\n          }\n          if (p2 != CurrentLine.npos) {\n            return CurrentLine.substr(p1,p2-p1);\n          } else {\n            p2 = CurrentLine.length();\n            return CurrentLine.substr(p1,p2-p1);\n          }\n        }\n      }\n    }\n  }\n\n  return string(\"\");\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nstring FGConfigFile::GetValue(void)\n{\n  return GetValue(\"\");\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nstring FGConfigFile::GetLine(void)\n{\n  string scratch = \"\";\n  int test;\n\n  while ((test = cfgfile.get()) != EOF) {\n    if (test >= 0x20 || test == 0x09) {\n      if (test == 0x09) {\n        scratch += (char)0x20;\n      } else {\n        scratch += (char)test;\n      }\n    } else {\n      if ((test = cfgfile.get()) != EOF) { \/\/ get *next* character\n#if defined ( sgi ) && !defined( __GNUC__ )\n        if (test >= 0x20 || test == 0x09) cfgfile.putback(test);\n#else\n        if (test >= 0x20 || test == 0x09) cfgfile.unget();\n#endif\n        break;\n      }\n    }\n  }\n  if (cfgfile.eof()) return string(\"EOF\");\n  return scratch;\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\/*\nFGConfigFile& FGConfigFile::operator>>(double& val)\n{\n  unsigned int pos, end;\n\n  pos = CurrentLine.find_first_not_of(\", \",CurrentIndex);\n  if (pos == CurrentLine.npos) pos = CurrentLine.length();\n  end = CurrentLine.find_first_of(\", \",pos+1);\n  if (end == CurrentLine.npos) end = CurrentLine.length();\n  string str = CurrentLine.substr(pos, end - pos);\n  val = strtod(str.c_str(),NULL);\n  CurrentIndex = end+1;\n  if (CurrentIndex >= CurrentLine.length()) GetNextConfigLine();\n  return *this;\n}\n*\/\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nFGConfigFile& FGConfigFile::operator>>(double& val)\n{\n  unsigned int pos, end;\n\n  pos = CurrentLine.find_first_not_of(\", \",CurrentIndex);\n  if (pos == CurrentLine.npos) pos = CurrentLine.length();\n  end = CurrentLine.find_first_of(\", \",pos+1);\n  if (end == CurrentLine.npos) end = CurrentLine.length();\n  string str = CurrentLine.substr(pos, end - pos);\n  val = strtod(str.c_str(),NULL);\n  CurrentIndex = end+1;\n  if (CurrentIndex >= CurrentLine.length()) GetNextConfigLine();\n  return *this;\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nFGConfigFile& FGConfigFile::operator>>(int& val)\n{\n  unsigned int pos, end;\n\n  pos = CurrentLine.find_first_not_of(\", \",CurrentIndex);\n  if (pos == CurrentLine.npos) pos = CurrentLine.length();\n  end = CurrentLine.find_first_of(\", \",pos+1);\n  if (end == CurrentLine.npos) end = CurrentLine.length();\n  string str = CurrentLine.substr(pos, end - pos);\n  val = atoi(str.c_str());\n  CurrentIndex = end+1;\n  if (CurrentIndex >= CurrentLine.length()) GetNextConfigLine();\n  return *this;\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nFGConfigFile& FGConfigFile::operator>>(eParam& val)\n{\n  unsigned int pos, end;\n\n  pos = CurrentLine.find_first_not_of(\", \",CurrentIndex);\n  if (pos == CurrentLine.npos) pos = CurrentLine.length();\n  end = CurrentLine.find_first_of(\", \",pos+1);\n  if (end == CurrentLine.npos) end = CurrentLine.length();\n  string str = CurrentLine.substr(pos, end - pos);\n  val = (eParam)atoi(str.c_str());\n  CurrentIndex = end+1;\n  if (CurrentIndex >= CurrentLine.length()) GetNextConfigLine();\n  return *this;\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nFGConfigFile& FGConfigFile::operator>>(string& str)\n{\n  unsigned int pos, end;\n\n  pos = CurrentLine.find_first_not_of(\", \",CurrentIndex);\n  if (pos == CurrentLine.npos) pos = CurrentLine.length();\n  end = CurrentLine.find_first_of(\", \",pos+1);\n  if (end == CurrentLine.npos) end = CurrentLine.length();\n  str = CurrentLine.substr(pos, end - pos);\n  CurrentIndex = end+1;\n  if (CurrentIndex >= CurrentLine.length()) GetNextConfigLine();\n  return *this;\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nvoid FGConfigFile::ResetLineIndexToZero(void)\n{\n  CurrentIndex = 0;\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nvoid FGConfigFile::Debug(void)\n{\n    \/\/TODO: Add your source code here\n}\n\n<commit_msg>Slight mods to begin logic for partial comment lines<commit_after>\/*%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r\n\r\n Header:       FGConfigFile.h\r\n Author:       Jon Berndt\r\n Date started: 03\/29\/00\r\n Purpose:      Config file read-in class\r\n Called by:    FGAircraft\r\n\r\nFUNCTIONAL DESCRIPTION\r\n--------------------------------------------------------------------------------\r\n\r\nHISTORY\r\n--------------------------------------------------------------------------------\r\n03\/16\/2000 JSB  Created\r\n\r\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r\nINCLUDES\r\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%*\/\r\n\r\n#include \"FGConfigFile.h\"\r\n#include <stdlib.h>\r\n#include <math.h>\r\n\r\nstatic const char *IdSrc = \"$Id: FGConfigFile.cpp,v 1.28 2001\/11\/15 23:57:28 jberndt Exp $\";\r\nstatic const char *IdHdr = ID_CONFIGFILE;\r\n\r\n\/*%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r\nCLASS IMPLEMENTATION\r\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%*\/\r\n\r\nFGConfigFile::FGConfigFile(string cfgFileName)\r\n{\r\n#if defined ( sgi ) && !defined( __GNUC__ )\r\n  cfgfile.open(cfgFileName.c_str(), ios::in );\r\n#else\r\n  cfgfile.open(cfgFileName.c_str(), ios::in | ios::binary );\r\n#endif\r\n  CommentsOn = false;\r\n  DelayedComments = false;\r\n  CurrentIndex = 0;\r\n  Opened = true;\r\n#if defined ( sgi ) && !defined( __GNUC__ )\r\n   if (!cfgfile.fail() && !cfgfile.eof())  GetNextConfigLine();\r\n#else\r\n  if (cfgfile.is_open()) GetNextConfigLine();\r\n#endif\r\n  else Opened = false;\r\n\r\n  if (debug_lvl & 2) cout << \"Instantiated: FGConfigFile\" << endl;\r\n}\r\n\r\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r\n\r\nFGConfigFile::~FGConfigFile()\r\n{\r\n  cfgfile.close();\r\n  if (debug_lvl & 2) cout << \"Destroyed:    FGConfigFile\" << endl;\r\n}\r\n\r\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r\n\r\nstring FGConfigFile::GetNextConfigLine(void)\r\n{\r\n  \/\/ New logic for this function should be created:\r\n  \/\/ If this is a partially commented line:\r\n  \/\/   save the line-comment or begin the Comment\r\n  \/\/   remove the line_comment\r\n  \/\/   return the string\r\n  \/\/ otherwise if this is an entire comment\r\n  \/\/   append the comment to Comment\r\n  \/\/   Call this function interatively\r\n  \/\/ otherwise if there is no comment just\r\n  \/\/   return the line\r\n\r\n  int deblank, not_found = string::npos;\r\n\r\n  do {\r\n    CurrentLine = GetLine();\r\n    if (DelayedComments) {\r\n      DelayedComments = false;\r\n      CommentsOn = true;\r\n    }\r\n    if (CurrentLine.find(\"<!--\") != not_found) {\r\n      CommentsOn = true;\r\n      CommentString = \"\";\r\n      if (CurrentLine.find(\"<!--\") != not_found)\r\n        CurrentLine.erase(CurrentLine.find(\"<!--\"),4);\r\n      while((deblank = CurrentLine.find(\" \")) != not_found) CurrentLine.erase(deblank,1);\r\n      if (CurrentLine.size() <= 2) CurrentLine = \"\";\r\n    }\r\n\r\n    if (CurrentLine.find(\"-->\") != not_found) {\r\n      CommentsOn = false;\r\n\r\n      if (CurrentLine.find(\"-->\") != not_found)\r\n        CurrentLine.erase(CurrentLine.find(\"-->\"),4);\r\n\r\n      while((deblank = CurrentLine.find(\" \")) != not_found) CurrentLine.erase(deblank,1);\r\n      if (CurrentLine.size() <= 2) CurrentLine = \"\";\r\n\r\n      CommentString += CurrentLine;\r\n      GetNextConfigLine();\r\n    }\r\n\r\n    if (CommentsOn) CommentString += CurrentLine + \"\\r\\n\";\r\n\r\n  } while (CommentsOn);\r\n\r\n  if (CurrentLine.length() == 0) GetNextConfigLine();\r\n  CurrentIndex = 0;\r\n  return CurrentLine;\r\n}\r\n\r\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r\n\r\nstring FGConfigFile::GetCommentString(void)\r\n{\r\n    return CommentString;\r\n}\r\n\r\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r\n\r\nstring FGConfigFile::GetValue(string val)\r\n{\r\n  unsigned int pos, p1, p2, ptest;\r\n\r\n  if (val == \"\") {    \/\/ this call is to return the tag value\r\n    pos = CurrentLine.find(\"<\");\r\n    if (pos != CurrentLine.npos) { \/\/ beginning brace found \"<\"\r\n      p1 = CurrentLine.find_first_not_of(\" \",pos+1);\r\n      if (p1 != CurrentLine.npos) { \/\/ found first character of tag\r\n        p2 = CurrentLine.find_first_of(\" >\",p1+1);\r\n        if (p2 == CurrentLine.npos) p2 = p1+1;\r\n        return CurrentLine.substr(p1,p2-p1);\r\n      }\r\n    } else {   \/\/ beginning brace \"<\" not found; this is a regular data line\r\n      pos = CurrentLine.find_first_not_of(\" \");\r\n      if (pos != CurrentLine.npos) {  \/\/ first character in line found\r\n        p2 = CurrentLine.find_first_of(\" \",pos+1);\r\n        if (p2 != CurrentLine.npos) {\r\n          return CurrentLine.substr(pos,p2-pos);\r\n        } else {\r\n          return CurrentLine.substr(pos,CurrentLine.length()-pos);\r\n        }\r\n      }\r\n    }\r\n  } else { \/\/ return a value for a specific tag\r\n    pos = CurrentLine.find(val);\r\n    if (pos != CurrentLine.npos) {\r\n      pos = CurrentLine.find(\"=\",pos);\r\n      if (pos != CurrentLine.npos) {\r\n        ptest = CurrentLine.find_first_not_of(\" \",pos+1);\r\n        if (ptest != CurrentLine.npos) {\r\n          p1 = ptest + 1;\r\n          if (CurrentLine[ptest] == '\"') { \/\/ quoted\r\n            p2 = CurrentLine.find_first_of(\"\\\"\",p1);\r\n          } else { \/\/ not quoted\r\n            p2 = CurrentLine.find_first_of(\" \",p1);\r\n          }\r\n          if (p2 != CurrentLine.npos) {\r\n            return CurrentLine.substr(p1,p2-p1);\r\n          }\r\n        }\r\n      } else {   \/\/ \"=\" not found\r\n        pos = CurrentLine.find(val);\r\n        pos = CurrentLine.find_first_of(\" \",pos+1);\r\n        ptest = CurrentLine.find_first_not_of(\" \",pos+1);\r\n        if (ptest != CurrentLine.npos) {\r\n          if (CurrentLine[ptest] == '\"') { \/\/ quoted\r\n            p1 = ptest + 1;\r\n            p2 = CurrentLine.find_first_of(\"\\\"\",p1);\r\n          } else { \/\/ not quoted\r\n            p1 = ptest;\r\n            p2 = CurrentLine.find_first_of(\" \",p1);\r\n          }\r\n          if (p2 != CurrentLine.npos) {\r\n            return CurrentLine.substr(p1,p2-p1);\r\n          } else {\r\n            p2 = CurrentLine.length();\r\n            return CurrentLine.substr(p1,p2-p1);\r\n          }\r\n        }\r\n      }\r\n    }\r\n  }\r\n\r\n  return string(\"\");\r\n}\r\n\r\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r\n\r\nstring FGConfigFile::GetValue(void)\r\n{\r\n  return GetValue(\"\");\r\n}\r\n\r\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r\n\r\nstring FGConfigFile::GetLine(void)\r\n{\r\n  string scratch = \"\";\r\n  int test;\r\n\r\n  while ((test = cfgfile.get()) != EOF) {\r\n    if (test >= 0x20 || test == 0x09) {\r\n      if (test == 0x09) {\r\n        scratch += (char)0x20;\r\n      } else {\r\n        scratch += (char)test;\r\n      }\r\n    } else {\r\n      if ((test = cfgfile.get()) != EOF) { \/\/ get *next* character\r\n#if defined ( sgi ) && !defined( __GNUC__ )\r\n        if (test >= 0x20 || test == 0x09) cfgfile.putback(test);\r\n#else\r\n        if (test >= 0x20 || test == 0x09) cfgfile.unget();\r\n#endif\r\n        break;\r\n      }\r\n    }\r\n  }\r\n  if (cfgfile.eof()) return string(\"EOF\");\r\n  return scratch;\r\n}\r\n\r\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r\n\/*\r\nFGConfigFile& FGConfigFile::operator>>(double& val)\r\n{\r\n  unsigned int pos, end;\r\n\r\n  pos = CurrentLine.find_first_not_of(\", \",CurrentIndex);\r\n  if (pos == CurrentLine.npos) pos = CurrentLine.length();\r\n  end = CurrentLine.find_first_of(\", \",pos+1);\r\n  if (end == CurrentLine.npos) end = CurrentLine.length();\r\n  string str = CurrentLine.substr(pos, end - pos);\r\n  val = strtod(str.c_str(),NULL);\r\n  CurrentIndex = end+1;\r\n  if (CurrentIndex >= CurrentLine.length()) GetNextConfigLine();\r\n  return *this;\r\n}\r\n*\/\r\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r\n\r\nFGConfigFile& FGConfigFile::operator>>(double& val)\r\n{\r\n  unsigned int pos, end;\r\n\r\n  pos = CurrentLine.find_first_not_of(\", \",CurrentIndex);\r\n  if (pos == CurrentLine.npos) pos = CurrentLine.length();\r\n  end = CurrentLine.find_first_of(\", \",pos+1);\r\n  if (end == CurrentLine.npos) end = CurrentLine.length();\r\n  string str = CurrentLine.substr(pos, end - pos);\r\n  val = strtod(str.c_str(),NULL);\r\n  CurrentIndex = end+1;\r\n  if (CurrentIndex >= CurrentLine.length()) GetNextConfigLine();\r\n  return *this;\r\n}\r\n\r\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r\n\r\nFGConfigFile& FGConfigFile::operator>>(int& val)\r\n{\r\n  unsigned int pos, end;\r\n\r\n  pos = CurrentLine.find_first_not_of(\", \",CurrentIndex);\r\n  if (pos == CurrentLine.npos) pos = CurrentLine.length();\r\n  end = CurrentLine.find_first_of(\", \",pos+1);\r\n  if (end == CurrentLine.npos) end = CurrentLine.length();\r\n  string str = CurrentLine.substr(pos, end - pos);\r\n  val = atoi(str.c_str());\r\n  CurrentIndex = end+1;\r\n  if (CurrentIndex >= CurrentLine.length()) GetNextConfigLine();\r\n  return *this;\r\n}\r\n\r\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r\n\r\nFGConfigFile& FGConfigFile::operator>>(eParam& val)\r\n{\r\n  unsigned int pos, end;\r\n\r\n  pos = CurrentLine.find_first_not_of(\", \",CurrentIndex);\r\n  if (pos == CurrentLine.npos) pos = CurrentLine.length();\r\n  end = CurrentLine.find_first_of(\", \",pos+1);\r\n  if (end == CurrentLine.npos) end = CurrentLine.length();\r\n  string str = CurrentLine.substr(pos, end - pos);\r\n  val = (eParam)atoi(str.c_str());\r\n  CurrentIndex = end+1;\r\n  if (CurrentIndex >= CurrentLine.length()) GetNextConfigLine();\r\n  return *this;\r\n}\r\n\r\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r\n\r\nFGConfigFile& FGConfigFile::operator>>(string& str)\r\n{\r\n  unsigned int pos, end;\r\n\r\n  pos = CurrentLine.find_first_not_of(\", \",CurrentIndex);\r\n  if (pos == CurrentLine.npos) pos = CurrentLine.length();\r\n  end = CurrentLine.find_first_of(\", \",pos+1);\r\n  if (end == CurrentLine.npos) end = CurrentLine.length();\r\n  str = CurrentLine.substr(pos, end - pos);\r\n  CurrentIndex = end+1;\r\n  if (CurrentIndex >= CurrentLine.length()) GetNextConfigLine();\r\n  return *this;\r\n}\r\n\r\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r\n\r\nvoid FGConfigFile::ResetLineIndexToZero(void)\r\n{\r\n  CurrentIndex = 0;\r\n}\r\n\r\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r\n\r\nvoid FGConfigFile::Debug(void)\r\n{\r\n    \/\/TODO: Add your source code here\r\n}\r\n\r\n<|endoftext|>"}
{"text":"<commit_before>#include \"FPSRoleLocal.h\"\n#include \"Creature.h\"\n\nCFPSRoleLocal::CFPSRoleLocal(void)\n{\n\tm_nCharMode = 0;\n\tm_nMuzzleBone = -1;\n\tm_nUpdateMove = 0;\n}\n\nCFPSRoleLocal::~CFPSRoleLocal(void)\n{\n\tdelete m_pActorBase;\n}\n\nCFPSRoleLocal::CFPSRoleLocal(void)\n{\n\tm_nCharMode = 0;\n\tm_nMuzzleBone = -1;\n\tm_nUpdateMove = 0;\n}\n\n\nint CFPSRoleLocal::Init(int nRoleID,const char* strCharFile)\n{\n\tCFPSRole::Init(nRoleID, strCharFile);\n\n\treturn 0;\n}\n<commit_msg>Signed-off-by: mrlitong <litongtongxue@gmail.com><commit_after>#include \"FPSRoleLocal.h\"\n#include \"Creature.h\"\n\nCFPSRoleLocal::CFPSRoleLocal(void)\n{\n\tm_nCharMode = 0;\n\tm_nMuzzleBone = -1;\n\tm_nUpdateMove = 0;\n}\n\nCFPSRoleLocal::~CFPSRoleLocal(void)\n{\n\tdelete m_pActorBase;\n}\n\nCFPSRoleLocal::CFPSRoleLocal(void)\n{\n\tm_nCharMode = 0;\n\tm_nMuzzleBone = -1;\n\tm_nUpdateMove = 0;\n}\n\n\nint CFPSRoleLocal::Init(int nRoleID,const char* strCharFile)\n{\n\tCFPSRole::Init(nRoleID, strCharFile);\n\n\tm_pCreature->SetupBody(1, 1);\n\n\n\treturn 1;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Don't enable volumetric decals by default.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/**\n * Appcelerator Kroll - licensed under the Apache Public License 2\n * see LICENSE in the root folder for details on the license.\n * Copyright (c) 2008-2009 Appcelerator, Inc. All Rights Reserved.\n *\/\n#include <dlfcn.h>\n#include <libgen.h>\n#include <limits.h>\n#include <errno.h>\n#include <gtk\/gtk.h>\n#include \"boot.h\"\n\n#ifdef USE_BREAKPAD\n#include \"client\/linux\/handler\/exception_handler.h\"\n#include \"common\/linux\/http_upload.h\"\n#endif\n\nnamespace KrollBoot\n{\n\textern string applicationHome;\n\textern string updateFile;\n\textern SharedApplication app;\n\textern int argc;\n\textern const char** argv;\n\n\tvoid ShowError(string error, bool fatal)\n\t{\n\t\tstd::cout << error << std::endl;\n\t\tgtk_init(&argc, (char***) &argv);\n\t\tGtkWidget* dialog = gtk_message_dialog_new(\n\t\t\tNULL,\n\t\t\tGTK_DIALOG_MODAL,\n\t\t\tGTK_MESSAGE_ERROR,\n\t\t\tGTK_BUTTONS_CLOSE,\n\t\t\t\"%s\",\n\t\t\terror.c_str());\n\t\tgtk_window_set_title(GTK_WINDOW(dialog), GetApplicationName().c_str());\n\t\tgtk_dialog_run(GTK_DIALOG(dialog));\n\t\tgtk_widget_destroy(dialog);\n\t\tif (fatal)\n\t\t\texit(1);\n\t}\n\n\tstring GetApplicationHomePath()\n\t{\n\t\tchar* buffer = (char*) alloca(sizeof(char) * PATH_MAX);\n\t\tchar* realPath = realpath(argv[0], buffer);\n\t\tstring realPathStr = realPath;\n\t\tif (realPath != NULL && FileUtils::IsFile(realPathStr))\n\t\t{\n\t\t\treturn dirname(realPath);\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn FileUtils::GetApplicationDirectory();\n\t\t}\n\t}\n\n\tbool RunInstaller(vector<SharedDependency> missing)\n\t{\n\t\tstring exec = FileUtils::Join(\n\t\t\tapp->path.c_str(), \"installer\", \"installer\", NULL);\n\n\t\tif (!FileUtils::IsFile(exec))\n\t\t{\n\t\t\tShowError(\"Missing installer and application has additional modules that are needed.\");\n\t\t\treturn false;\n\t\t}\n\n\t\tvector<string> args;\n\t\targs.push_back(\"--apppath\");\n\t\targs.push_back(app->path);\n\t\tif (!updateFile.empty())\n\t\t{\n\t\t\targs.push_back(\"--updatefile\");\n\t\t\targs.push_back(updateFile);\n\t\t}\n\n\t\tstd::vector<SharedDependency>::iterator di = missing.begin();\n\t\twhile (di != missing.end())\n\t\t{\n\t\t\tSharedDependency d = *di++;\n\t\t\tstring url = app->GetURLForDependency(d);\n\t\t\targs.push_back(url);\n\t\t}\n\n\t\tFileUtils::RunAndWait(exec, args);\n\t\treturn true;\n\t}\n\n\tvoid BootstrapPlatformSpecific(string moduleList)\n\t{\n\t\tmoduleList = app->runtime->path + \":\" + moduleList;\n\n\t\tstring path = moduleList;\n\t\tstring current = EnvironmentUtils::Get(\"LD_LIBRARY_PATH\");\n\t\tif (!current.empty())\n\t\t{\n\t\t\tpath.append(\":\" + current);\n\t\t}\n\t\tEnvironmentUtils::Set(\"LD_LIBRARY_PATH\", path);\n\t}\n\n\tstring Blastoff()\n\t{\n\t\t\/\/ Ensure that the argument list is NULL terminated\n\t\tchar** myargv = (char **) calloc(sizeof(char *), argc + 1);\n\t\tmemcpy(myargv, argv, sizeof(char*) * (argc + 1));\n\t\tmyargv[argc] = NULL;\n\n\t\texecv(argv[0], (char* const*) argv);\n\n\t\t\/\/ If we get here an error happened with the execv \n\t\treturn strerror(errno);\n\t}\n\n\n\ttypedef int Executor(int argc, const char **argv);\n\tint StartHost()\n\t{\n\t\tconst char* runtimePath = getenv(\"KR_RUNTIME\");\n\t\tif (runtimePath == NULL)\n\t\t\treturn __LINE__;\n\n\t\t\/\/ now we need to load the host and get 'er booted\n\t\tstring khost = FileUtils::Join(runtimePath, \"libkhost.so\", NULL);\n\t\tif (!FileUtils::IsFile(khost))\n\t\t{\n\t\t\tstring msg = string(\"Couldn't find required file:\") + khost;\n\t\t\tShowError(msg);\n\t\t\treturn __LINE__;\n\t\t}\n\n\t\tvoid* lib = dlopen(khost.c_str(), RTLD_LAZY | RTLD_GLOBAL);\n\t\tif (!lib)\n\t\t{\n\t\t\tstring msg = string(\"Couldn't load file:\") + khost + \", error: \" + dlerror();\n\t\t\tShowError(msg);\n\t\t\treturn __LINE__;\n\t\t}\n\n\t\tExecutor* executor = (Executor*) dlsym(lib, \"Execute\");\n\t\tif (!executor)\n\t\t{\n\t\t\tstring msg = string(\"Invalid entry point for\") + khost;\n\t\t\tShowError(msg);\n\t\t\treturn __LINE__;\n\t\t}\n\n\t\treturn executor(argc, argv);\n\t}\n\n#ifdef USE_BREAKPAD\n\tstatic google_breakpad::ExceptionHandler* breakpad;\n\textern string dumpFilePath;\n\n\tchar breakpadCallBuffer[PATH_MAX];\n\tbool HandleCrash(\n\t\tconst char* dump_path,\n\t\tconst char* id,\n\t\tvoid* context,\n\t\tbool succeeded)\n\t{\n\t\tif (succeeded)\n\t\t{\n\t\t\tsnprintf(breakpadCallBuffer, PATH_MAX - 1,\n\t\t\t\t \"\\\"%s\\\" %s \\\"%s\\\" %s\", argv[0], CRASH_REPORT_OPT, dump_path, id);\n\t\t\tsystem(breakpadCallBuffer);\n\t\t}\n#ifdef DEBUG\n\t\treturn false;\n#else\n\t\treturn true;\n#endif\n\t}\n\t\n\tint SendCrashReport()\n\t{\n\t\tgtk_init(&argc, (char***) &argv);\n\n\t\tInitCrashDetection();\n\t\tstd::string title = GetCrashDetectionTitle();\n\t\tstd::string msg = GetCrashDetectionMessage();\n\t\tstring url = \"https:\/\/\" + CRASH_REPORT_URL;\n\t\tconst std::map<string, string> parameters = GetCrashReportParameters();\n\t\tstring filePartName = \"dump\";\n\t\tstring proxy;\n\t\tstring proxyUserPassword;\n\t\tstring responseBody;\n\t\tstring errorDescription;\n\n\t\tGtkWidget* dialog = gtk_message_dialog_new(\n\t\t\tNULL,\n\t\t\tGTK_DIALOG_MODAL,\n\t\t\tGTK_MESSAGE_ERROR,\n\t\t\tGTK_BUTTONS_OK_CANCEL,\n\t\t\tmsg);\n\t\tgtk_window_set_title(GTK_WINDOW(dialog), title);\n\t\tint response = gtk_dialog_run(GTK_DIALOG(dialog));\n\t\tif (response != GTK_RESPONSE_OK)\n\t\t{\n\t\t\treturn 1;\n\t\t}\n\t\t\n\n\t\tbool success = google_breakpad::HTTPUpload::SendRequest(\n\t\t\turl,\n\t\t\tparameters,\n\t\t\tdumpFilePath.c_str(),\n\t\t\tfilePartName,\n\t\t\tproxy,\n\t\t\tproxyUserPassword,\n\t\t\t&responseBody,\n\t\t\t&errorDescription\n\t\t);\n\t\tif (!success)\n\t\t{\n\t\t\tShowError(string(\"Error uploading crash dump: \") + errorDescription);\n\t\t\treturn 2;\n\t\t}\n\t\treturn 0;\n\t}\n#endif\n}\n\nint main(int argc, const char* argv[])\n{\n\tKrollBoot::argc = argc;\n\tKrollBoot::argv = argv;\n#ifdef USE_BREAKPAD\n\tif (argc > 2 && !strcmp(CRASH_REPORT_OPT, argv[1]))\n\t{\n\t\treturn KrollBoot::SendCrashReport();\n\t}\n\n\t\/\/ Don't install a handler if we are just handling an error (above).\n\tstring dumpPath = \"\/tmp\";\n\tKrollBoot::breakpad = new google_breakpad::ExceptionHandler(\n\t\tdumpPath,\n\t\tNULL,\n\t\tKrollBoot::HandleCrash,\n\t\tNULL,\n\t\ttrue);\n#endif\n\n\tif (!EnvironmentUtils::Has(BOOTSTRAP_ENV))\n\t{\n\t\treturn KrollBoot::Bootstrap();\n\t}\n\telse\n\t{\n\t\tEnvironmentUtils::Unset(BOOTSTRAP_ENV);\n\t\treturn KrollBoot::StartHost();\n\t}\n}\n\n<commit_msg>Compile fixes for Linux<commit_after>\/**\n * Appcelerator Kroll - licensed under the Apache Public License 2\n * see LICENSE in the root folder for details on the license.\n * Copyright (c) 2008-2009 Appcelerator, Inc. All Rights Reserved.\n *\/\n#include <dlfcn.h>\n#include <libgen.h>\n#include <limits.h>\n#include <errno.h>\n#include <gtk\/gtk.h>\n#include \"boot.h\"\n\n#ifdef USE_BREAKPAD\n#include \"client\/linux\/handler\/exception_handler.h\"\n#include \"common\/linux\/http_upload.h\"\n#endif\n\nnamespace KrollBoot\n{\n\textern string applicationHome;\n\textern string updateFile;\n\textern SharedApplication app;\n\textern int argc;\n\textern const char** argv;\n\n\tvoid ShowError(string error, bool fatal)\n\t{\n\t\tstd::cout << error << std::endl;\n\t\tgtk_init(&argc, (char***) &argv);\n\t\tGtkWidget* dialog = gtk_message_dialog_new(\n\t\t\tNULL,\n\t\t\tGTK_DIALOG_MODAL,\n\t\t\tGTK_MESSAGE_ERROR,\n\t\t\tGTK_BUTTONS_CLOSE,\n\t\t\t\"%s\",\n\t\t\terror.c_str());\n\t\tgtk_window_set_title(GTK_WINDOW(dialog), GetApplicationName().c_str());\n\t\tgtk_dialog_run(GTK_DIALOG(dialog));\n\t\tgtk_widget_destroy(dialog);\n\t\tif (fatal)\n\t\t\texit(1);\n\t}\n\n\tstring GetApplicationHomePath()\n\t{\n\t\tchar* buffer = (char*) alloca(sizeof(char) * PATH_MAX);\n\t\tchar* realPath = realpath(argv[0], buffer);\n\t\tstring realPathStr = realPath;\n\t\tif (realPath != NULL && FileUtils::IsFile(realPathStr))\n\t\t{\n\t\t\treturn dirname(realPath);\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn FileUtils::GetApplicationDirectory();\n\t\t}\n\t}\n\n\tbool RunInstaller(vector<SharedDependency> missing)\n\t{\n\t\tstring exec = FileUtils::Join(\n\t\t\tapp->path.c_str(), \"installer\", \"installer\", NULL);\n\n\t\tif (!FileUtils::IsFile(exec))\n\t\t{\n\t\t\tShowError(\"Missing installer and application has additional modules that are needed.\");\n\t\t\treturn false;\n\t\t}\n\n\t\tvector<string> args;\n\t\targs.push_back(\"--apppath\");\n\t\targs.push_back(app->path);\n\t\tif (!updateFile.empty())\n\t\t{\n\t\t\targs.push_back(\"--updatefile\");\n\t\t\targs.push_back(updateFile);\n\t\t}\n\n\t\tstd::vector<SharedDependency>::iterator di = missing.begin();\n\t\twhile (di != missing.end())\n\t\t{\n\t\t\tSharedDependency d = *di++;\n\t\t\tstring url = app->GetURLForDependency(d);\n\t\t\targs.push_back(url);\n\t\t}\n\n\t\tFileUtils::RunAndWait(exec, args);\n\t\treturn true;\n\t}\n\n\tvoid BootstrapPlatformSpecific(string moduleList)\n\t{\n\t\tmoduleList = app->runtime->path + \":\" + moduleList;\n\n\t\tstring path = moduleList;\n\t\tstring current = EnvironmentUtils::Get(\"LD_LIBRARY_PATH\");\n\t\tif (!current.empty())\n\t\t{\n\t\t\tpath.append(\":\" + current);\n\t\t}\n\t\tEnvironmentUtils::Set(\"LD_LIBRARY_PATH\", path);\n\t}\n\n\tstring Blastoff()\n\t{\n\t\t\/\/ Ensure that the argument list is NULL terminated\n\t\tchar** myargv = (char **) calloc(sizeof(char *), argc + 1);\n\t\tmemcpy(myargv, argv, sizeof(char*) * (argc + 1));\n\t\tmyargv[argc] = NULL;\n\n\t\texecv(argv[0], (char* const*) argv);\n\n\t\t\/\/ If we get here an error happened with the execv \n\t\treturn strerror(errno);\n\t}\n\n\n\ttypedef int Executor(int argc, const char **argv);\n\tint StartHost()\n\t{\n\t\tconst char* runtimePath = getenv(\"KR_RUNTIME\");\n\t\tif (runtimePath == NULL)\n\t\t\treturn __LINE__;\n\n\t\t\/\/ now we need to load the host and get 'er booted\n\t\tstring khost = FileUtils::Join(runtimePath, \"libkhost.so\", NULL);\n\t\tif (!FileUtils::IsFile(khost))\n\t\t{\n\t\t\tstring msg = string(\"Couldn't find required file:\") + khost;\n\t\t\tShowError(msg);\n\t\t\treturn __LINE__;\n\t\t}\n\n\t\tvoid* lib = dlopen(khost.c_str(), RTLD_LAZY | RTLD_GLOBAL);\n\t\tif (!lib)\n\t\t{\n\t\t\tstring msg = string(\"Couldn't load file:\") + khost + \", error: \" + dlerror();\n\t\t\tShowError(msg);\n\t\t\treturn __LINE__;\n\t\t}\n\n\t\tExecutor* executor = (Executor*) dlsym(lib, \"Execute\");\n\t\tif (!executor)\n\t\t{\n\t\t\tstring msg = string(\"Invalid entry point for\") + khost;\n\t\t\tShowError(msg);\n\t\t\treturn __LINE__;\n\t\t}\n\n\t\treturn executor(argc, argv);\n\t}\n\n#ifdef USE_BREAKPAD\n\tstatic google_breakpad::ExceptionHandler* breakpad;\n\textern string dumpFilePath;\n\n\tchar breakpadCallBuffer[PATH_MAX];\n\tbool HandleCrash(\n\t\tconst char* dump_path,\n\t\tconst char* id,\n\t\tvoid* context,\n\t\tbool succeeded)\n\t{\n\t\tif (succeeded)\n\t\t{\n\t\t\tsnprintf(breakpadCallBuffer, PATH_MAX - 1,\n\t\t\t\t \"\\\"%s\\\" %s \\\"%s\\\" %s\", argv[0], CRASH_REPORT_OPT, dump_path, id);\n\t\t\tsystem(breakpadCallBuffer);\n\t\t}\n#ifdef DEBUG\n\t\treturn false;\n#else\n\t\treturn true;\n#endif\n\t}\n\t\n\tint SendCrashReport()\n\t{\n\t\tgtk_init(&argc, (char***) &argv);\n\n\t\tInitCrashDetection();\n\t\tstd::string title = GetCrashDetectionTitle();\n\t\tstd::string msg = GetCrashDetectionMessage();\n\t\tstring url = string(\"https:\/\/\") + CRASH_REPORT_URL;\n\t\tconst std::map<string, string> parameters = GetCrashReportParameters();\n\t\tstring filePartName = \"dump\";\n\t\tstring proxy;\n\t\tstring proxyUserPassword;\n\t\tstring responseBody;\n\t\tstring errorDescription;\n\n\t\tGtkWidget* dialog = gtk_message_dialog_new(\n\t\t\tNULL,\n\t\t\tGTK_DIALOG_MODAL,\n\t\t\tGTK_MESSAGE_ERROR,\n\t\t\tGTK_BUTTONS_OK_CANCEL,\n\t\t\tmsg.c_str());\n\t\tgtk_window_set_title(GTK_WINDOW(dialog), title.c_str());\n\t\tint response = gtk_dialog_run(GTK_DIALOG(dialog));\n\t\tif (response != GTK_RESPONSE_OK)\n\t\t{\n\t\t\treturn 1;\n\t\t}\n\t\t\n\n\t\tbool success = google_breakpad::HTTPUpload::SendRequest(\n\t\t\turl,\n\t\t\tparameters,\n\t\t\tdumpFilePath.c_str(),\n\t\t\tfilePartName,\n\t\t\tproxy,\n\t\t\tproxyUserPassword,\n\t\t\t&responseBody,\n\t\t\t&errorDescription\n\t\t);\n\t\tif (!success)\n\t\t{\n\t\t\tShowError(string(\"Error uploading crash dump: \") + errorDescription);\n\t\t\treturn 2;\n\t\t}\n\t\treturn 0;\n\t}\n#endif\n}\n\nint main(int argc, const char* argv[])\n{\n\tKrollBoot::argc = argc;\n\tKrollBoot::argv = argv;\n#ifdef USE_BREAKPAD\n\tif (argc > 2 && !strcmp(CRASH_REPORT_OPT, argv[1]))\n\t{\n\t\treturn KrollBoot::SendCrashReport();\n\t}\n\n\t\/\/ Don't install a handler if we are just handling an error (above).\n\tstring dumpPath = \"\/tmp\";\n\tKrollBoot::breakpad = new google_breakpad::ExceptionHandler(\n\t\tdumpPath,\n\t\tNULL,\n\t\tKrollBoot::HandleCrash,\n\t\tNULL,\n\t\ttrue);\n#endif\n\n\tif (!EnvironmentUtils::Has(BOOTSTRAP_ENV))\n\t{\n\t\treturn KrollBoot::Bootstrap();\n\t}\n\telse\n\t{\n\t\tEnvironmentUtils::Unset(BOOTSTRAP_ENV);\n\t\treturn KrollBoot::StartHost();\n\t}\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef DUNE_STUFF_FUNCTION_EXPRESSION_BASE_HH\n#define DUNE_STUFF_FUNCTION_EXPRESSION_BASE_HH\n\n#ifdef HAVE_CMAKE_CONFIG\n  #include \"cmake_config.h\"\n#else\n  #include \"config.h\"\n#endif \/\/ ifdef HAVE_CMAKE_CONFIG\n\n#include <sstream>\n#include <vector>\n\n\/\/#if HAVE_EIGEN\n\/\/  #include <Eigen\/Core>\n\/\/#endif \/\/ HAVE_EIGEN\n\n#include <dune\/common\/fvector.hh>\n#include <dune\/common\/dynvector.hh>\n#include <dune\/common\/exceptions.hh>\n#include <dune\/common\/static_assert.hh>\n\n#include <dune\/stuff\/common\/parameter\/tree.hh>\n#include <dune\/stuff\/common\/string.hh>\n#include <dune\/stuff\/common\/color.hh>\n\n#include \"mathexpr.hh\"\n\nnamespace Dune {\nnamespace Stuff {\nnamespace Function {\n\n\n\/\/ forward\ntemplate< class RangeFieldImp >\nclass Coefficient;\n\n\n\/\/\/**\n\/\/  \\brief  Provides a function which evaluates a given mathematical expression at runtime.\n\n\/\/          Given a mathematical expression as a string, a domain \\f$ K_d^{m \\geq 1} \\f$ and a range \\f$ K_r^{n \\geq 1}\n\/\/          \\f$ this function represents the map\n\/\/          \\f{eqnarray}\n\/\/            f:K_d^m \\to K_r^n\\\\\n\/\/            x = (x_1, \\dots, x_m)' \\mapsto (f_1(x), \\dots f_n(x))',\n\/\/          \\f}\n\/\/          where \\f$ K_d \\f$ is the DomainType and \\f$ K_r \\f$ is the RangeType, usually a power of \\f$ \\mathcal{R} \\f$.\n\/\/          The name of the variable as well as the \\f$ n \\f$ expressions of \\f$f_1, \\dots, f_n\\f$ have to be given in a\n\/\/          Dune::ParameterTree in the following form:\n\/\/\\code variable: x\n\/\/expression.0: 2*x[0]\n\/\/expression.1: sin(x[1])*x[0]\\endcode\n\/\/          There have to exist at least \\f$n\\f$ expressions; the entries of the variable are indexed by \\f$[i]\\f$ for\n\/\/          \\f$ 0 \\leq i \\leq m - 1 \\f$.\n\/\/ **\/\n\/**\n *  \\brief base class that wraps makes a function out of the stuff from mathexpr.hh\n *  \\attention  Most surely you do not want to use this class directly!\n *\/\ntemplate< class DomainFieldImp, int domainDim,\n          class RangeFieldImp, int rangeDim >\nclass ExpressionBase\n{\npublic:\n  typedef ExpressionBase< DomainFieldImp, domainDim, RangeFieldImp, rangeDim > ThisType;\n\n  typedef DomainFieldImp  DomainFieldType;\n  static const int        dimDomain = domainDim;\n\n  typedef RangeFieldImp   RangeFieldType;\n  static const int        dimRange = rangeDim;\n\n  ExpressionBase(const std::string _variable, const std::string _expression)\n  {\n    const std::vector< std::string > expressions(1, _expression);\n    setup(_variable, expressions);\n  } \/\/ NonparametricExpression(const std::string variable, const std::string expression)\n\n  ExpressionBase(const std::string _variable, const std::vector< std::string > _expressions)\n  {\n    setup(_variable, _expressions);\n  } \/\/ NonparametricExpression(const std::string variable, const std::vector< std::string >& expressions)\n\n  ExpressionBase(const ThisType& _other)\n  {\n    setup(_other.variable(), _other.expression());\n  } \/\/ NonparametricExpression(const ThisType& other)\n\n  ThisType& operator=(const ThisType& _other)\n  {\n    if (this != &_other) {\n      cleanup();\n      variable_ = \"\";\n      variables_ = std::vector< std::string >();\n      expressions_ = std::vector< std::string >();\n      setup(_other.variable(), _other.expression());\n    }\n    return this;\n  } \/\/ ThisType& operator=(const ThisType& other)\n\n  ~ExpressionBase()\n  {\n    cleanup();\n  } \/\/ ~NonparametricExpression()\n\n  std::string variable() const\n  {\n    return variable_;\n  }\n\n  const std::vector< std::string >& expression() const\n  {\n    return expressions_;\n  }\n\n  void evaluate(const Dune::FieldVector< DomainFieldType, dimDomain >& _arg,\n                Dune::FieldVector< RangeFieldType, dimRange >& _ret) const\n  {\n    \/\/ copy arg\n    for (typename Dune::FieldVector< DomainFieldType, dimDomain >::size_type ii = 0; ii < dimDomain; ++ii)\n      *(arg_[ii]) = _arg[ii];\n    \/\/ copy ret\n    for (typename Dune::FieldVector< RangeFieldType, dimRange >::size_type ii = 0; ii < dimRange; ++ii)\n      _ret[ii] = op_[ii]->Val();\n  }\n\n  \/**\n   *  \\attention  _arg will be used up to its size, _ret will be resized!\n   *\/\n  void evaluate(const Dune::DynamicVector< DomainFieldType >& _arg,\n                Dune::DynamicVector< RangeFieldType >& _ret) const\n  {\n    \/\/ check for sizes\n    if (_ret.size() != dimRange)\n      _ret = Dune::DynamicVector< RangeFieldType >(dimRange);\n    \/\/ copy arg\n    for (int ii = 0; ii < std::min(domainDim, int(_arg.size())); ++ii)\n      *(arg_[ii]) = _arg[ii];\n    \/\/ copy ret\n    for (int ii = 0; ii < dimRange; ++ii)\n      _ret[ii] = op_[ii]->Val();\n  }\n\n  \/**\n   *  \\attention  _arg will be used up to its size\n   *\/\n  void evaluate(const Dune::DynamicVector< DomainFieldType >& _arg,\n                Dune::FieldVector< RangeFieldType, dimRange >& _ret) const\n  {\n    \/\/ copy arg\n    for (int ii = 0; ii < std::min(domainDim, int(_arg.size())); ++ii)\n      *(arg_[ii]) = _arg[ii];\n    \/\/ copy ret\n    for (int ii = 0; ii < dimRange; ++ii)\n      _ret[ii] = op_[ii]->Val();\n  }\n\n\/\/#if HAVE_EIGEN\n\/\/  void evaluate(const Eigen::Matrix< Eigen::Dynamic, 1, DomainFieldType >& _arg,\n\/\/                Eigen::Matrix< Eigen::Dynamic, 1, RangeFieldType >& _ret)\n\/\/  {\n\/\/    \/\/ check for sizes\n\/\/    assert(_arg.size() <= dimDomain);\n\/\/    if (_ret.size != dimRange)\n\/\/      _ret.resize(dimRange);\n\/\/    \/\/ copy arg\n\/\/    for (typename Dune::DynamicVector< DomainFieldType >::size_type ii = 0; ii < dimDomain; ++ii)\n\/\/      *(arg_[ii]) = arg[ii];\n\/\/    \/\/ copy ret\n\/\/    for (typename RangeType::size_type ii = 0; ii < ret.size(); ++ii)\n\/\/      ret[ii] = op_[ii]->Val();\n\/\/  }\n\/\/#endif \/\/ HAVE_EIGEN\n\n  void report(const std::string _name = \"function.nonparametric.expression\",\n              std::ostream& _stream = std::cout,\n              const std::string& _prefix = \"\") const\n  {\n    const std::string tmp = _name + \"(\" + variable() + \") = \";\n    _stream << _prefix << tmp;\n    if (expression().size() == 1)\n        _stream << expression()[0] << std::endl;\n    else {\n      _stream << \"[ \" << expression()[0] << \";\" << std::endl;\n      const std::string whitespace = Dune::Stuff::Common::whitespaceify(tmp + \"[ \");\n      for (unsigned int i = 1; i < expression().size() - 1; ++i)\n        _stream << _prefix << whitespace << expression()[i] << \";\" << std::endl;\n      _stream << _prefix << whitespace << expression()[expression().size() -1] << \" ]\" << std::endl;\n    }\n  } \/\/ void report(const std::string, std::ostream&, const std::string&) const\n\nprivate:\n  friend class Coefficient< RangeFieldType >;\n\n  void evaluate(const Dune::DynamicVector< DomainFieldType >& _arg, RangeFieldType& _ret) const\n  {\n    assert(dimRange == 1 && \"I'm only here to be used by Function::Parametric::Coefficient, which has dimrange == 1\");\n    \/\/ copy arg\n    for (int ii = 0; ii < std::min(domainDim, int(_arg.size())); ++ii)\n      *(arg_[ii]) = _arg[ii];\n    \/\/ copy ret\n    _ret = op_[0]->Val();\n  }\n\n  void setup(const std::string& _variable, const std::vector< std::string >& _expression)\n  {\n    dune_static_assert((dimDomain > 0), \"Really?\");\n    dune_static_assert((dimRange > 0), \"Really?\");\n    \/\/ set expressions\n    if (_expression.size() < dimRange)\n      DUNE_THROW(Dune::InvalidStateException,\n                 \"\\n\" << Dune::Stuff::Common::colorStringRed(\"ERROR:\")\n                 << \" '_expression' too short (is \" << _expression.size()\n                 << \", should be \" << dimRange << \")!\");\n    for (int ii = 0; ii < dimRange; ++ii)\n      expressions_.push_back(_expression[ii]);\n    \/\/ set variable (i.e. \"x\")\n    variable_ = _variable;\n    \/\/ fill variables (i.e. \"x[0]\", \"x[1]\", ...)\n    for (int ii = 0; ii < dimDomain; ++ii) {\n      std::stringstream variableStream;\n      variableStream << variable_ << \"[\" << ii << \"]\";\n      variables_.push_back(variableStream.str());\n    }\n    \/\/ create epressions\n    for (int ii = 0; ii < dimDomain; ++ii) {\n      arg_[ii] = new DomainFieldType(0.0);\n      var_arg_[ii] = new RVar(variables_[ii].c_str(), arg_[ii]);\n      vararray_[ii] = var_arg_[ii];\n    }\n    for (int ii = 0; ii < dimRange; ++ ii) {\n      op_[ii] = new ROperation(expressions_[ii].c_str(), dimDomain, vararray_);\n    }\n  } \/\/ void setup(const std::string& variable, const std::vector< std::string >& expressions)\n\n  void cleanup()\n  {\n    for (int ii = 0; ii < dimRange; ++ii) {\n      delete op_[ii];\n    }\n    for (int ii = 0; ii < dimDomain; ++ii) {\n      delete var_arg_[ii];\n      delete arg_[ii];\n    }\n  } \/\/ void cleanup()\n\n  std::string                variable_;\n  std::vector< std::string > variables_;\n  std::vector< std::string > expressions_;\n  unsigned int actualDimRange_;\n  mutable DomainFieldType* arg_[dimDomain];\n  RVar* var_arg_[dimDomain];\n  RVar* vararray_[dimDomain];\n  ROperation* op_[dimRange];\n}; \/\/ class ExpressionBase\n\n\/\/template< class DomainFieldImp, int domainDim,\n\/\/          class RangeFieldImp, int rangeDim >\n\/\/const int ExpressionBase< DomainFieldImp, domainDim, RangeFieldImp, rangeDim >::dimDomain = domainDim;\n\n} \/\/ namespace Function\n} \/\/ namespace Stuff\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_STUFF_FUNCTION_EXPRESSION_BASE_HH\n<commit_msg>[function.expression.base] added another evaluate()<commit_after>#ifndef DUNE_STUFF_FUNCTION_EXPRESSION_BASE_HH\n#define DUNE_STUFF_FUNCTION_EXPRESSION_BASE_HH\n\n#ifdef HAVE_CMAKE_CONFIG\n  #include \"cmake_config.h\"\n#else\n  #include \"config.h\"\n#endif \/\/ ifdef HAVE_CMAKE_CONFIG\n\n#include <sstream>\n#include <vector>\n\n\/\/#if HAVE_EIGEN\n\/\/  #include <Eigen\/Core>\n\/\/#endif \/\/ HAVE_EIGEN\n\n#include <dune\/common\/fvector.hh>\n#include <dune\/common\/dynvector.hh>\n#include <dune\/common\/exceptions.hh>\n#include <dune\/common\/static_assert.hh>\n\n#include <dune\/stuff\/common\/parameter\/tree.hh>\n#include <dune\/stuff\/common\/string.hh>\n#include <dune\/stuff\/common\/color.hh>\n\n#include \"mathexpr.hh\"\n\nnamespace Dune {\nnamespace Stuff {\nnamespace Function {\n\n\n\/\/ forward\ntemplate< class RangeFieldImp >\nclass Coefficient;\n\n\n\/\/\/**\n\/\/  \\brief  Provides a function which evaluates a given mathematical expression at runtime.\n\n\/\/          Given a mathematical expression as a string, a domain \\f$ K_d^{m \\geq 1} \\f$ and a range \\f$ K_r^{n \\geq 1}\n\/\/          \\f$ this function represents the map\n\/\/          \\f{eqnarray}\n\/\/            f:K_d^m \\to K_r^n\\\\\n\/\/            x = (x_1, \\dots, x_m)' \\mapsto (f_1(x), \\dots f_n(x))',\n\/\/          \\f}\n\/\/          where \\f$ K_d \\f$ is the DomainType and \\f$ K_r \\f$ is the RangeType, usually a power of \\f$ \\mathcal{R} \\f$.\n\/\/          The name of the variable as well as the \\f$ n \\f$ expressions of \\f$f_1, \\dots, f_n\\f$ have to be given in a\n\/\/          Dune::ParameterTree in the following form:\n\/\/\\code variable: x\n\/\/expression.0: 2*x[0]\n\/\/expression.1: sin(x[1])*x[0]\\endcode\n\/\/          There have to exist at least \\f$n\\f$ expressions; the entries of the variable are indexed by \\f$[i]\\f$ for\n\/\/          \\f$ 0 \\leq i \\leq m - 1 \\f$.\n\/\/ **\/\n\/**\n *  \\brief base class that wraps makes a function out of the stuff from mathexpr.hh\n *  \\attention  Most surely you do not want to use this class directly!\n *\/\ntemplate< class DomainFieldImp, int domainDim,\n          class RangeFieldImp, int rangeDim >\nclass ExpressionBase\n{\npublic:\n  typedef ExpressionBase< DomainFieldImp, domainDim, RangeFieldImp, rangeDim > ThisType;\n\n  typedef DomainFieldImp  DomainFieldType;\n  static const int        dimDomain = domainDim;\n\n  typedef RangeFieldImp   RangeFieldType;\n  static const int        dimRange = rangeDim;\n\n  ExpressionBase(const std::string _variable, const std::string _expression)\n  {\n    const std::vector< std::string > expressions(1, _expression);\n    setup(_variable, expressions);\n  } \/\/ NonparametricExpression(const std::string variable, const std::string expression)\n\n  ExpressionBase(const std::string _variable, const std::vector< std::string > _expressions)\n  {\n    setup(_variable, _expressions);\n  } \/\/ NonparametricExpression(const std::string variable, const std::vector< std::string >& expressions)\n\n  ExpressionBase(const ThisType& _other)\n  {\n    setup(_other.variable(), _other.expression());\n  } \/\/ NonparametricExpression(const ThisType& other)\n\n  ThisType& operator=(const ThisType& _other)\n  {\n    if (this != &_other) {\n      cleanup();\n      variable_ = \"\";\n      variables_ = std::vector< std::string >();\n      expressions_ = std::vector< std::string >();\n      setup(_other.variable(), _other.expression());\n    }\n    return this;\n  } \/\/ ThisType& operator=(const ThisType& other)\n\n  ~ExpressionBase()\n  {\n    cleanup();\n  } \/\/ ~NonparametricExpression()\n\n  std::string variable() const\n  {\n    return variable_;\n  }\n\n  const std::vector< std::string >& expression() const\n  {\n    return expressions_;\n  }\n\n  void evaluate(const Dune::FieldVector< DomainFieldType, dimDomain >& _arg,\n                Dune::FieldVector< RangeFieldType, dimRange >& _ret) const\n  {\n    \/\/ copy arg\n    for (typename Dune::FieldVector< DomainFieldType, dimDomain >::size_type ii = 0; ii < dimDomain; ++ii)\n      *(arg_[ii]) = _arg[ii];\n    \/\/ copy ret\n    for (typename Dune::FieldVector< RangeFieldType, dimRange >::size_type ii = 0; ii < dimRange; ++ii)\n      _ret[ii] = op_[ii]->Val();\n  }\n\n  \/**\n   *  \\attention  _arg will be used up to its size, _ret will be resized!\n   *\/\n  void evaluate(const Dune::DynamicVector< DomainFieldType >& _arg,\n                Dune::DynamicVector< RangeFieldType >& _ret) const\n  {\n    \/\/ check for sizes\n    assert(_arg.size() > 0);\n    if (_ret.size() != dimRange)\n      _ret = Dune::DynamicVector< RangeFieldType >(dimRange);\n    \/\/ copy arg\n    for (typename Dune::DynamicVector< DomainFieldType >::size_type ii = 0; ii < std::min(domainDim, int(_arg.size())); ++ii)\n      *(arg_[ii]) = _arg[ii];\n    \/\/ copy ret\n    for (typename Dune::DynamicVector< RangeFieldType >::size_type ii = 0; ii < dimRange; ++ii)\n      _ret[ii] = op_[ii]->Val();\n  }\n\n  void evaluate(const Dune::FieldVector< DomainFieldType, dimDomain >& _arg,\n                Dune::DynamicVector< RangeFieldType >& _ret) const\n  {\n    \/\/ check for sizes\n    if (_ret.size() != dimRange)\n      _ret = Dune::DynamicVector< RangeFieldType >(dimRange);\n    \/\/ copy arg\n    for (typename Dune::FieldVector< DomainFieldType, dimDomain >::size_type ii = 0; ii < dimDomain; ++ii)\n      *(arg_[ii]) = _arg[ii];\n    \/\/ copy ret\n    for (typename Dune::DynamicVector< RangeFieldType >::size_type ii = 0; ii < dimRange; ++ii)\n      _ret[ii] = op_[ii]->Val();\n  }\n\n  \/**\n   *  \\attention  _arg will be used up to its size\n   *\/\n  void evaluate(const Dune::DynamicVector< DomainFieldType >& _arg,\n                Dune::FieldVector< RangeFieldType, dimRange >& _ret) const\n  {\n    assert(_arg.size() > 0);\n    \/\/ copy arg\n    for (typename Dune::DynamicVector< DomainFieldType >::size_type ii = 0; ii < std::min(domainDim, int(_arg.size())); ++ii)\n      *(arg_[ii]) = _arg[ii];\n    \/\/ copy ret\n    for (typename Dune::FieldVector< RangeFieldType, dimRange >::size_type ii = 0; ii < dimRange; ++ii)\n      _ret[ii] = op_[ii]->Val();\n  }\n\n\/\/#if HAVE_EIGEN\n\/\/  void evaluate(const Eigen::Matrix< Eigen::Dynamic, 1, DomainFieldType >& _arg,\n\/\/                Eigen::Matrix< Eigen::Dynamic, 1, RangeFieldType >& _ret)\n\/\/  {\n\/\/    \/\/ check for sizes\n\/\/    assert(_arg.size() <= dimDomain);\n\/\/    if (_ret.size != dimRange)\n\/\/      _ret.resize(dimRange);\n\/\/    \/\/ copy arg\n\/\/    for (typename Dune::DynamicVector< DomainFieldType >::size_type ii = 0; ii < dimDomain; ++ii)\n\/\/      *(arg_[ii]) = arg[ii];\n\/\/    \/\/ copy ret\n\/\/    for (typename RangeType::size_type ii = 0; ii < ret.size(); ++ii)\n\/\/      ret[ii] = op_[ii]->Val();\n\/\/  }\n\/\/#endif \/\/ HAVE_EIGEN\n\n  void report(const std::string _name = \"function.nonparametric.expression\",\n              std::ostream& _stream = std::cout,\n              const std::string& _prefix = \"\") const\n  {\n    const std::string tmp = _name + \"(\" + variable() + \") = \";\n    _stream << _prefix << tmp;\n    if (expression().size() == 1)\n        _stream << expression()[0] << std::endl;\n    else {\n      _stream << \"[ \" << expression()[0] << \";\" << std::endl;\n      const std::string whitespace = Dune::Stuff::Common::whitespaceify(tmp + \"[ \");\n      for (unsigned int i = 1; i < expression().size() - 1; ++i)\n        _stream << _prefix << whitespace << expression()[i] << \";\" << std::endl;\n      _stream << _prefix << whitespace << expression()[expression().size() -1] << \" ]\" << std::endl;\n    }\n  } \/\/ void report(const std::string, std::ostream&, const std::string&) const\n\nprivate:\n  friend class Coefficient< RangeFieldType >;\n\n  void evaluate(const Dune::DynamicVector< DomainFieldType >& _arg, RangeFieldType& _ret) const\n  {\n    assert(dimRange == 1 && \"I'm only here to be used by Function::Parametric::Coefficient, which has dimrange == 1\");\n    \/\/ copy arg\n    for (int ii = 0; ii < std::min(domainDim, int(_arg.size())); ++ii)\n      *(arg_[ii]) = _arg[ii];\n    \/\/ copy ret\n    _ret = op_[0]->Val();\n  }\n\n  void setup(const std::string& _variable, const std::vector< std::string >& _expression)\n  {\n    dune_static_assert((dimDomain > 0), \"Really?\");\n    dune_static_assert((dimRange > 0), \"Really?\");\n    \/\/ set expressions\n    if (_expression.size() < dimRange)\n      DUNE_THROW(Dune::InvalidStateException,\n                 \"\\n\" << Dune::Stuff::Common::colorStringRed(\"ERROR:\")\n                 << \" '_expression' too short (is \" << _expression.size()\n                 << \", should be \" << dimRange << \")!\");\n    for (int ii = 0; ii < dimRange; ++ii)\n      expressions_.push_back(_expression[ii]);\n    \/\/ set variable (i.e. \"x\")\n    variable_ = _variable;\n    \/\/ fill variables (i.e. \"x[0]\", \"x[1]\", ...)\n    for (int ii = 0; ii < dimDomain; ++ii) {\n      std::stringstream variableStream;\n      variableStream << variable_ << \"[\" << ii << \"]\";\n      variables_.push_back(variableStream.str());\n    }\n    \/\/ create epressions\n    for (int ii = 0; ii < dimDomain; ++ii) {\n      arg_[ii] = new DomainFieldType(0.0);\n      var_arg_[ii] = new RVar(variables_[ii].c_str(), arg_[ii]);\n      vararray_[ii] = var_arg_[ii];\n    }\n    for (int ii = 0; ii < dimRange; ++ ii) {\n      op_[ii] = new ROperation(expressions_[ii].c_str(), dimDomain, vararray_);\n    }\n  } \/\/ void setup(const std::string& variable, const std::vector< std::string >& expressions)\n\n  void cleanup()\n  {\n    for (int ii = 0; ii < dimRange; ++ii) {\n      delete op_[ii];\n    }\n    for (int ii = 0; ii < dimDomain; ++ii) {\n      delete var_arg_[ii];\n      delete arg_[ii];\n    }\n  } \/\/ void cleanup()\n\n  std::string                variable_;\n  std::vector< std::string > variables_;\n  std::vector< std::string > expressions_;\n  unsigned int actualDimRange_;\n  mutable DomainFieldType* arg_[dimDomain];\n  RVar* var_arg_[dimDomain];\n  RVar* vararray_[dimDomain];\n  ROperation* op_[dimRange];\n}; \/\/ class ExpressionBase\n\n\/\/template< class DomainFieldImp, int domainDim,\n\/\/          class RangeFieldImp, int rangeDim >\n\/\/const int ExpressionBase< DomainFieldImp, domainDim, RangeFieldImp, rangeDim >::dimDomain = domainDim;\n\n} \/\/ namespace Function\n} \/\/ namespace Stuff\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_STUFF_FUNCTION_EXPRESSION_BASE_HH\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * copyright: (c) RDO-Team, 2009\n * filename : rdo_object.h\n * author   :  ,  \n * date     : \n * bref     : \n * indent   : 4T\n *\/\n\n\/\/ ====================================================================== PCH\n#include \"rdo_lib\/rdo_parser\/pch.h\"\n\/\/ ====================================================================== INCLUDES\n\/\/ ====================================================================== SYNOPSIS\n#include \"rdo_lib\/rdo_parser\/rdo_object.h\"\n#include \"rdo_lib\/rdo_parser\/rdoparser.h\"\n#include \"rdo_lib\/rdo_runtime\/rdo_runtime.h\"\n\/\/ ===============================================================================\n\nOPEN_RDO_PARSER_NAMESPACE\n\n\/\/ ----------------------------------------------------------------------------\n\/\/ ---------- RDOParserSrcInfo\n\/\/ ----------------------------------------------------------------------------\nRDOParserSrcInfo::RDOParserSrcInfo()\n\t: RDOSrcInfo()\n{\n\tinit();\n}\n\nRDOParserSrcInfo::RDOParserSrcInfo(CREF(YYLTYPE) pos)\n\t: RDOSrcInfo()\n{\n\tinit();\n\tsetSrcPos(pos);\n}\n\nRDOParserSrcInfo::RDOParserSrcInfo(CREF(rdoRuntime::RDOSrcInfo) info)\n\t: RDOSrcInfo()\n{\n\tinit();\n\tRDOSrcInfo::setSrcInfo(info);\n}\n\nRDOParserSrcInfo::RDOParserSrcInfo(CREF(rdoRuntime::RDOSrcInfo::Position) pos)\n\t: RDOSrcInfo()\n{\n\tinit();\n\tRDOSrcInfo::setSrcPos(pos);\n}\n\nRDOParserSrcInfo::RDOParserSrcInfo(CREF(tstring) text)\n\t: RDOSrcInfo()\n{\n\tinit();\n\tsetSrcText(text);\n}\n\nRDOParserSrcInfo::RDOParserSrcInfo(CREF(YYLTYPE) pos, CREF(tstring) text)\n\t: RDOSrcInfo()\n{\n\tinit();\n\tsetSrcPos (pos );\n\tsetSrcText(text);\n}\n\nRDOParserSrcInfo::RDOParserSrcInfo(CREF(YYLTYPE) pos_begin, CREF(YYLTYPE) pos_end, rbool first_align)\n\t: RDOSrcInfo()\n{\n\tinit();\n\tif (!first_align)\n\t{\n\t\tsetSrcPos(pos_begin, pos_end);\n\t}\n\telse\n\t{\n\t\tif (pos_begin.m_first_line == pos_end.m_last_line)\n\t\t{\n\t\t\tsetSrcPos(pos_begin, pos_end);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tYYLTYPE pos(pos_begin);\n\t\t\tpos.m_first_line = pos.m_last_line;\n\t\t\tpos.m_first_pos  = pos.m_last_pos;\n\t\t\tsetSrcPos(pos);\n\t\t}\n\t}\n}\n\nRDOParserSrcInfo::RDOParserSrcInfo(CREF(YYLTYPE) pos_begin, CREF(YYLTYPE) pos_end, CREF(tstring) text)\n\t: RDOSrcInfo()\n{\n\tinit();\n\tsetSrcPos (pos_begin, pos_end);\n\tsetSrcText(text);\n}\n\nvoid RDOParserSrcInfo::init()\n{\n\tsetSrcFileType(RDOParser::getFileToParse());\n\trdoRuntime::RDOSrcInfo::Position pos;\n\tpos.m_first_pos  = RDOParser::lexer_loc_pos();\n\tpos.m_last_pos   = pos.m_first_pos;\n\tpos.m_first_line = RDOParser::lexer_loc_line();\n\tpos.m_last_line  = pos.m_first_line;\n\tRDOSrcInfo::setSrcPos(pos);\n}\n\nCLOSE_RDO_PARSER_NAMESPACE\n<commit_msg> - удалён ненужный инклюд<commit_after>\/*\n * copyright: (c) RDO-Team, 2009\n * filename : rdo_object.h\n * author   :  ,  \n * date     : \n * bref     : \n * indent   : 4T\n *\/\n\n\/\/ ====================================================================== PCH\n#include \"rdo_lib\/rdo_parser\/pch.h\"\n\/\/ ====================================================================== INCLUDES\n\/\/ ====================================================================== SYNOPSIS\n#include \"rdo_lib\/rdo_parser\/rdo_object.h\"\n#include \"rdo_lib\/rdo_parser\/rdoparser.h\"\n\/\/ ===============================================================================\n\nOPEN_RDO_PARSER_NAMESPACE\n\n\/\/ ----------------------------------------------------------------------------\n\/\/ ---------- RDOParserSrcInfo\n\/\/ ----------------------------------------------------------------------------\nRDOParserSrcInfo::RDOParserSrcInfo()\n\t: RDOSrcInfo()\n{\n\tinit();\n}\n\nRDOParserSrcInfo::RDOParserSrcInfo(CREF(YYLTYPE) pos)\n\t: RDOSrcInfo()\n{\n\tinit();\n\tsetSrcPos(pos);\n}\n\nRDOParserSrcInfo::RDOParserSrcInfo(CREF(rdoRuntime::RDOSrcInfo) info)\n\t: RDOSrcInfo()\n{\n\tinit();\n\tRDOSrcInfo::setSrcInfo(info);\n}\n\nRDOParserSrcInfo::RDOParserSrcInfo(CREF(rdoRuntime::RDOSrcInfo::Position) pos)\n\t: RDOSrcInfo()\n{\n\tinit();\n\tRDOSrcInfo::setSrcPos(pos);\n}\n\nRDOParserSrcInfo::RDOParserSrcInfo(CREF(tstring) text)\n\t: RDOSrcInfo()\n{\n\tinit();\n\tsetSrcText(text);\n}\n\nRDOParserSrcInfo::RDOParserSrcInfo(CREF(YYLTYPE) pos, CREF(tstring) text)\n\t: RDOSrcInfo()\n{\n\tinit();\n\tsetSrcPos (pos );\n\tsetSrcText(text);\n}\n\nRDOParserSrcInfo::RDOParserSrcInfo(CREF(YYLTYPE) pos_begin, CREF(YYLTYPE) pos_end, rbool first_align)\n\t: RDOSrcInfo()\n{\n\tinit();\n\tif (!first_align)\n\t{\n\t\tsetSrcPos(pos_begin, pos_end);\n\t}\n\telse\n\t{\n\t\tif (pos_begin.m_first_line == pos_end.m_last_line)\n\t\t{\n\t\t\tsetSrcPos(pos_begin, pos_end);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tYYLTYPE pos(pos_begin);\n\t\t\tpos.m_first_line = pos.m_last_line;\n\t\t\tpos.m_first_pos  = pos.m_last_pos;\n\t\t\tsetSrcPos(pos);\n\t\t}\n\t}\n}\n\nRDOParserSrcInfo::RDOParserSrcInfo(CREF(YYLTYPE) pos_begin, CREF(YYLTYPE) pos_end, CREF(tstring) text)\n\t: RDOSrcInfo()\n{\n\tinit();\n\tsetSrcPos (pos_begin, pos_end);\n\tsetSrcText(text);\n}\n\nvoid RDOParserSrcInfo::init()\n{\n\tsetSrcFileType(RDOParser::getFileToParse());\n\trdoRuntime::RDOSrcInfo::Position pos;\n\tpos.m_first_pos  = RDOParser::lexer_loc_pos();\n\tpos.m_last_pos   = pos.m_first_pos;\n\tpos.m_first_line = RDOParser::lexer_loc_line();\n\tpos.m_last_line  = pos.m_first_line;\n\tRDOSrcInfo::setSrcPos(pos);\n}\n\nCLOSE_RDO_PARSER_NAMESPACE\n<|endoftext|>"}
{"text":"<commit_before>#include \"EntityEditor.hpp\"\n\n#include <Engine\/Component\/Animation.hpp>\n#include <Engine\/Component\/Physics.hpp>\n#include <Engine\/Component\/Mesh.hpp>\n#include <Engine\/Component\/Lens.hpp>\n#include <Engine\/Component\/Material.hpp>\n#include <Engine\/Component\/DirectionalLight.hpp>\n#include <Engine\/Component\/PointLight.hpp>\n#include <Engine\/Component\/SpotLight.hpp>\n#include <Engine\/Component\/Listener.hpp>\n#include <Engine\/Component\/Script.hpp>\n#include <Engine\/Component\/SoundSource.hpp>\n#include <Engine\/Component\/ParticleEmitter.hpp>\n#include <Engine\/Hymn.hpp>\n#include <Engine\/Geometry\/Model.hpp>\n#include <Engine\/Geometry\/RiggedModel.hpp>\n#include <Engine\/Texture\/Texture2D.hpp>\n#include <Engine\/Audio\/SoundBuffer.hpp>\n#include <Engine\/Script\/ScriptFile.hpp>\n#include <Engine\/Util\/FileSystem.hpp>\n#include <Engine\/Manager\/Managers.hpp>\n#include <Engine\/Manager\/ScriptManager.hpp>\n\n#include \"..\/..\/Util\/EditorSettings.hpp\"\n#include \"..\/FileSelector.hpp\"\n#include \"..\/..\/ImGui\/Draggable.hpp\"\n\nusing namespace GUI;\n\nEntityEditor::EntityEditor() {\n    name[0] = '\\0';\n    AddEditor<Component::Animation>(\"Animation\", std::bind(&EntityEditor::AnimationEditor, this, std::placeholders::_1));\n    AddEditor<Component::Physics>(\"Physics\", std::bind(&EntityEditor::PhysicsEditor, this, std::placeholders::_1));\n    AddEditor<Component::Mesh>(\"Mesh\", std::bind(&EntityEditor::MeshEditor, this, std::placeholders::_1));\n    AddEditor<Component::Lens>(\"Lens\", std::bind(&EntityEditor::LensEditor, this, std::placeholders::_1));\n    AddEditor<Component::Material>(\"Material\", std::bind(&EntityEditor::MaterialEditor, this, std::placeholders::_1));\n    AddEditor<Component::DirectionalLight>(\"Directional light\", std::bind(&EntityEditor::DirectionalLightEditor, this, std::placeholders::_1));\n    AddEditor<Component::PointLight>(\"Point light\", std::bind(&EntityEditor::PointLightEditor, this, std::placeholders::_1));\n    AddEditor<Component::SpotLight>(\"Spot light\", std::bind(&EntityEditor::SpotLightEditor, this, std::placeholders::_1));\n    AddEditor<Component::Listener>(\"Listener\", std::bind(&EntityEditor::ListenerEditor, this, std::placeholders::_1));\n    AddEditor<Component::Script>(\"Script\", std::bind(&EntityEditor::ScriptEditor, this, std::placeholders::_1));\n    AddEditor<Component::SoundSource>(\"Sound source\", std::bind(&EntityEditor::SoundSourceEditor, this, std::placeholders::_1));\n    AddEditor<Component::ParticleEmitter>(\"Particle emitter\", std::bind(&EntityEditor::ParticleEmitterEditor, this, std::placeholders::_1));\n}\n\nEntityEditor::~EntityEditor() {\n    \n}\n\nvoid EntityEditor::Show() {\n    if (ImGui::Begin((\"Entity: \" + entity->name + \"###\" + std::to_string(reinterpret_cast<uintptr_t>(entity))).c_str(), &visible)) {\n        ImGui::InputText(\"Name\", name, 128);\n        entity->name = name;\n        ImGui::Text(\"Transform\");\n        ImGui::Indent();\n        ImGui::InputFloat3(\"Position\", &entity->position[0]);\n        ImGui::InputFloat3(\"Rotation\", &entity->rotation[0]);\n        ImGui::InputFloat3(\"Scale\", &entity->scale[0]);\n        ImGui::Unindent();\n        if (!entity->IsScene()) {\n            if (ImGui::Button(\"Add component\"))\n                ImGui::OpenPopup(\"Add component\");\n            \n            if (ImGui::BeginPopup(\"Add component\")) {\n                ImGui::Text(\"Components\");\n                ImGui::Separator();\n                \n                for (Editor& editor : editors) {\n                    editor.addFunction();\n                }\n                \n                ImGui::EndPopup();\n            }\n            \n            for (Editor& editor : editors) {\n                editor.editFunction();\n            }\n        }\n    }\n\n    ImGui::End();\n}\n\nvoid EntityEditor::SetEntity(Entity* entity) {\n    this->entity = entity;\n    strcpy(name, entity->name.c_str());\n}\n\nbool EntityEditor::ShowsEntity(Entity* entity) {\n    return this->entity == entity;\n}\n\nbool EntityEditor::IsVisible() const {\n    return visible;\n}\n\nvoid EntityEditor::SetVisible(bool visible) {\n    this->visible = visible;\n}\n\nvoid EntityEditor::AnimationEditor(Component::Animation* animation) {\n    ImGui::Indent();\n    if (ImGui::Button(\"Select model##Animation\"))\n        ImGui::OpenPopup(\"Select model##Animation\");\n\n    if (ImGui::BeginPopup(\"Select model##Animation\")) {\n        ImGui::Text(\"Models\");\n        ImGui::Separator();\n\n        for (Geometry::Model* model : Hymn().models) {\n            if (ImGui::Selectable(model->name.c_str()))\n                animation->riggedModel = dynamic_cast<Geometry::RiggedModel*>(model);\n        }\n\n        ImGui::EndPopup();\n    }\n    ImGui::Unindent();\n}\n\nvoid EntityEditor::PhysicsEditor(Component::Physics* physics) {\n    ImGui::Text(\"Positional\");\n    ImGui::Indent();\n    ImGui::InputFloat3(\"Velocity\", &physics->velocity[0]);\n    ImGui::InputFloat(\"Max velocity\", &physics->maxVelocity);\n    ImGui::InputFloat3(\"Acceleration\", &physics->acceleration[0]);\n    ImGui::InputFloat(\"Velocity drag factor\", &physics->velocityDragFactor);\n    ImGui::InputFloat(\"Gravity factor\", &physics->gravityFactor);\n    ImGui::Unindent();\n    ImGui::Text(\"Angular\");\n    ImGui::Indent();\n    ImGui::InputFloat3(\"Angular velocity\", &physics->angularVelocity[0]);\n    ImGui::InputFloat(\"Max angular velocity\", &physics->maxAngularVelocity);\n    ImGui::InputFloat3(\"Angular acceleration\", &physics->angularAcceleration[0]);\n    ImGui::InputFloat(\"Angular drag factor\", &physics->angularDragFactor);\n    ImGui::InputFloat3(\"Moment of inertia\", &physics->momentOfInertia[0]);\n    ImGui::Unindent();\n\n}\n\nvoid EntityEditor::MeshEditor(Component::Mesh* mesh) {\n    ImGui::Indent();\n    if (ImGui::Button(\"Select model##Mesh\"))\n        ImGui::OpenPopup(\"Select model##Mesh\");\n    \n    if (ImGui::BeginPopup(\"Select model##Mesh\")) {\n        ImGui::Text(\"Models\");\n        ImGui::Separator();\n        \n        for (Geometry::Model* model : Hymn().models) {\n            if (ImGui::Selectable(model->name.c_str()))\n                mesh->geometry = model;\n        }\n        \n        ImGui::EndPopup();\n    }\n    ImGui::Unindent();\n}\n\nvoid EntityEditor::LensEditor(Component::Lens* lens) {\n    ImGui::Indent();\n    ImGui::InputFloat(\"Field of view\", &lens->fieldOfView);\n    ImGui::InputFloat(\"Z near\", &lens->zNear);\n    ImGui::InputFloat(\"Z far\", &lens->zFar);\n    ImGui::Unindent();\n}\n\nvoid EntityEditor::MaterialEditor(Component::Material* material) {\n    \/\/ Diffuse\n    ImGui::Text(\"Diffuse\");\n    ImGui::Indent();\n    if (material->diffuse->IsLoaded())\n        ImGui::Image((void*) material->diffuse->GetTextureID(), ImVec2(128, 128));\n    \n    if (ImGui::Button(\"Select diffuse texture\"))\n        ImGui::OpenPopup(\"Select diffuse texture\");\n    \n    if (ImGui::BeginPopup(\"Select diffuse texture\")) {\n        ImGui::Text(\"Textures\");\n        ImGui::Separator();\n        \n        for (Texture2D* texture : Hymn().textures) {\n            if (ImGui::Selectable(texture->name.c_str()))\n                material->diffuse = texture;\n        }\n        \n        ImGui::EndPopup();\n    }\n    ImGui::Unindent();\n\n\n    \/\/ Normal\n    ImGui::Text(\"Normal\");\n    ImGui::Indent();\n    if (material->normal->IsLoaded())\n        ImGui::Image((void*) material->normal->GetTextureID(), ImVec2(128, 128));\n    \n    if (ImGui::Button(\"Select normal texture\"))\n        ImGui::OpenPopup(\"Select normal texture\");\n    \n    if (ImGui::BeginPopup(\"Select normal texture\")) {\n        ImGui::Text(\"Textures\");\n        ImGui::Separator();\n        \n        for (Texture2D* texture : Hymn().textures) {\n            if (ImGui::Selectable(texture->name.c_str()))\n                material->normal = texture;\n        }\n        \n        ImGui::EndPopup();\n    }\n    ImGui::Unindent();\n\n    \/\/ Specular\n    ImGui::Text(\"Specular\");\n    ImGui::Indent();\n    if (material->specular->IsLoaded())\n        ImGui::Image((void*) material->specular->GetTextureID(), ImVec2(128, 128));\n    \n    if (ImGui::Button(\"Select specular texture\"))\n        ImGui::OpenPopup(\"Select specular texture\");\n    \n    if (ImGui::BeginPopup(\"Select specular texture\")) {\n        ImGui::Text(\"Textures\");\n        ImGui::Separator();\n        \n        for (Texture2D* texture : Hymn().textures) {\n            if (ImGui::Selectable(texture->name.c_str()))\n                material->specular = texture;\n        }\n        \n        ImGui::EndPopup();\n    }\n    ImGui::Unindent();\n\n    \/\/ Glow\n    ImGui::Text(\"Glow\");\n    ImGui::Indent();\n    if (material->glow->IsLoaded())\n        ImGui::Image((void*) material->glow->GetTextureID(), ImVec2(128, 128));\n    \n    if (ImGui::Button(\"Select glow texture\"))\n        ImGui::OpenPopup(\"Select glow texture\");\n    \n    if (ImGui::BeginPopup(\"Select glow texture\")) {\n        ImGui::Text(\"Textures\");\n        ImGui::Separator();\n        \n        for (Texture2D* texture : Hymn().textures) {\n            if (ImGui::Selectable(texture->name.c_str()))\n                material->glow = texture;\n        }\n        \n        ImGui::EndPopup();\n    }\n    ImGui::Unindent();\n}\n\nvoid EntityEditor::DirectionalLightEditor(Component::DirectionalLight* directionalLight) {\n    ImGui::Indent();\n    ImGui::InputFloat3(\"Color\", &directionalLight->color[0]);\n    ImGui::InputFloat(\"Ambient coefficient\", &directionalLight->ambientCoefficient);\n    ImGui::Unindent();\n}\n\nvoid EntityEditor::PointLightEditor(Component::PointLight* pointLight) {\n    ImGui::Indent();\n    ImGui::InputFloat3(\"Color\", &pointLight->color[0]);\n    ImGui::DraggableFloat(\"Ambient coefficient\", pointLight->ambientCoefficient);\n    ImGui::DraggableFloat(\"Attenuation\", pointLight->attenuation);\n    ImGui::DraggableFloat(\"Intensity\", pointLight->intensity);\n    ImGui::Unindent();\n}\n\nvoid EntityEditor::SpotLightEditor(Component::SpotLight* spotLight) {\n    ImGui::Indent();\n    ImGui::InputFloat3(\"Color\", &spotLight->color[0]);\n    ImGui::DraggableFloat(\"Ambient coefficient\", spotLight->ambientCoefficient);\n    ImGui::DraggableFloat(\"Attenuation\", spotLight->attenuation);\n    ImGui::DraggableFloat(\"Intensity\", spotLight->intensity);\n    ImGui::DraggableFloat(\"Cone angle\", spotLight->coneAngle);\n    ImGui::Unindent();\n}\n\nvoid EntityEditor::ListenerEditor(Component::Listener* listener) {\n    \n}\n\nvoid EntityEditor::ScriptEditor(Component::Script* script) {\n    ImGui::Indent();\n    if(script->scriptFile != nullptr)\n        ImGui::Text(script->scriptFile->name.c_str());\n    else\n        ImGui::Text(\"No script loaded\");\n    \n    if (ImGui::Button(\"Select script\"))\n        ImGui::OpenPopup(\"Select script\");\n\n    if (ImGui::BeginPopup(\"Select script\")) {\n        ImGui::Text(\"Scripts\");\n        ImGui::Separator();\n\n        for (ScriptFile* scriptFile : Hymn().scripts) {\n            if (ImGui::Selectable(scriptFile->name.c_str()))\n                script->scriptFile = scriptFile;\n        }\n\n        ImGui::EndPopup();\n    }\n    ImGui::Unindent();\n}\n\nvoid EntityEditor::SoundSourceEditor(Component::SoundSource* soundSource) {\n    ImGui::Text(\"Sound\");\n    ImGui::Indent();\n    if (ImGui::Button(\"Select sound\"))\n        ImGui::OpenPopup(\"Select sound\");\n    \n    if (ImGui::BeginPopup(\"Select sound\")) {\n        ImGui::Text(\"Sounds\");\n        ImGui::Separator();\n        \n        for (Audio::SoundBuffer* sound : Hymn().sounds) {\n            if (ImGui::Selectable(sound->name.c_str()))\n                soundSource->soundBuffer = sound;\n        }\n        \n        ImGui::EndPopup();\n    }\n    ImGui::Unindent();\n    ImGui::Text(\"Sound properties\");\n    ImGui::Indent();\n    ImGui::DraggableFloat(\"Pitch\", soundSource->pitch, 0.0f);\n    ImGui::DraggableFloat(\"Gain\", soundSource->gain, 0.0f);\n    ImGui::Checkbox(\"Loop\", &soundSource->loop);\n    ImGui::Unindent();\n}\n\nvoid EntityEditor::ParticleEmitterEditor(Component::ParticleEmitter* particleEmitter) {\n    ImGui::Text(\"Particle\");\n    ImGui::Indent();\n    int rows = Managers().particleManager->GetTextureAtlasRows();\n    float column = static_cast<float>(particleEmitter->particleType.textureIndex % rows);\n    float row = static_cast<float>(particleEmitter->particleType.textureIndex \/ rows);\n    ImGui::Image((void*) Managers().particleManager->GetTextureAtlas()->GetTextureID(), ImVec2(128, 128), ImVec2(column \/ rows, row \/ rows), ImVec2((column + 1.f) \/ rows, (row + 1.f) \/ rows));\n    ImGui::InputInt(\"Texture index\", &particleEmitter->particleType.textureIndex);\n    ImGui::DraggableVec3(\"Min velocity\", particleEmitter->particleType.minVelocity);\n    ImGui::DraggableVec3(\"Max velocity\", particleEmitter->particleType.maxVelocity);\n    ImGui::DraggableFloat(\"Average lifetime\", particleEmitter->particleType.averageLifetime, 0.0f);\n    ImGui::DraggableFloat(\"Lifetime variance\", particleEmitter->particleType.lifetimeVariance, 0.0f);\n    ImGui::DraggableVec2(\"Average size\", particleEmitter->particleType.averageSize, 0.0f);\n    ImGui::DraggableVec2(\"Size variance\", particleEmitter->particleType.sizeVariance, 0.0f);\n    ImGui::Checkbox(\"Uniform scaling\", &particleEmitter->particleType.uniformScaling);\n    ImGui::DraggableFloat(\"Start alpha\", particleEmitter->particleType.startAlpha, 0.0f, 1.0f);\n    ImGui::DraggableFloat(\"Mid alpha\", particleEmitter->particleType.midAlpha, 0.0f, 1.0f);\n    ImGui::DraggableFloat(\"End alpha\", particleEmitter->particleType.endAlpha, 0.0f, 1.0f);\n    ImGui::InputFloat3(\"Color\", &particleEmitter->particleType.color[0]);\n    ImGui::Unindent();\n    \n    ImGui::Text(\"Emitter\");\n    ImGui::Indent();\n    ImGui::DraggableVec3(\"Size\", particleEmitter->size);\n    ImGui::DraggableFloat(\"Average emit time\", particleEmitter->averageEmitTime, 0.0f);\n    ImGui::DraggableFloat(\"Emit time variance\", particleEmitter->emitTimeVariance, 0.0f);\n    \n    if (ImGui::Button(\"Emitter type\"))\n        ImGui::OpenPopup(\"Emitter type\");\n    \n    if (ImGui::BeginPopup(\"Emitter type\")) {\n        ImGui::Text(\"Emitter type\");\n        ImGui::Separator();\n        \n        if (ImGui::Selectable(\"Point\"))\n            particleEmitter->emitterType = Component::ParticleEmitter::POINT;\n        \n        if (ImGui::Selectable(\"Cuboid\"))\n            particleEmitter->emitterType = Component::ParticleEmitter::CUBOID;\n        \n        ImGui::EndPopup();\n    }\n    ImGui::Unindent();\n    \n    ImGui::Text(\"Preview\");\n    ImGui::Indent();\n    ImGui::Checkbox(\"Simulate\", &particleEmitter->preview);\n    ImGui::Unindent();\n}\n<commit_msg>Use draggable in DirectionalLight<commit_after>#include \"EntityEditor.hpp\"\n\n#include <Engine\/Component\/Animation.hpp>\n#include <Engine\/Component\/Physics.hpp>\n#include <Engine\/Component\/Mesh.hpp>\n#include <Engine\/Component\/Lens.hpp>\n#include <Engine\/Component\/Material.hpp>\n#include <Engine\/Component\/DirectionalLight.hpp>\n#include <Engine\/Component\/PointLight.hpp>\n#include <Engine\/Component\/SpotLight.hpp>\n#include <Engine\/Component\/Listener.hpp>\n#include <Engine\/Component\/Script.hpp>\n#include <Engine\/Component\/SoundSource.hpp>\n#include <Engine\/Component\/ParticleEmitter.hpp>\n#include <Engine\/Hymn.hpp>\n#include <Engine\/Geometry\/Model.hpp>\n#include <Engine\/Geometry\/RiggedModel.hpp>\n#include <Engine\/Texture\/Texture2D.hpp>\n#include <Engine\/Audio\/SoundBuffer.hpp>\n#include <Engine\/Script\/ScriptFile.hpp>\n#include <Engine\/Util\/FileSystem.hpp>\n#include <Engine\/Manager\/Managers.hpp>\n#include <Engine\/Manager\/ScriptManager.hpp>\n\n#include \"..\/..\/Util\/EditorSettings.hpp\"\n#include \"..\/FileSelector.hpp\"\n#include \"..\/..\/ImGui\/Draggable.hpp\"\n\nusing namespace GUI;\n\nEntityEditor::EntityEditor() {\n    name[0] = '\\0';\n    AddEditor<Component::Animation>(\"Animation\", std::bind(&EntityEditor::AnimationEditor, this, std::placeholders::_1));\n    AddEditor<Component::Physics>(\"Physics\", std::bind(&EntityEditor::PhysicsEditor, this, std::placeholders::_1));\n    AddEditor<Component::Mesh>(\"Mesh\", std::bind(&EntityEditor::MeshEditor, this, std::placeholders::_1));\n    AddEditor<Component::Lens>(\"Lens\", std::bind(&EntityEditor::LensEditor, this, std::placeholders::_1));\n    AddEditor<Component::Material>(\"Material\", std::bind(&EntityEditor::MaterialEditor, this, std::placeholders::_1));\n    AddEditor<Component::DirectionalLight>(\"Directional light\", std::bind(&EntityEditor::DirectionalLightEditor, this, std::placeholders::_1));\n    AddEditor<Component::PointLight>(\"Point light\", std::bind(&EntityEditor::PointLightEditor, this, std::placeholders::_1));\n    AddEditor<Component::SpotLight>(\"Spot light\", std::bind(&EntityEditor::SpotLightEditor, this, std::placeholders::_1));\n    AddEditor<Component::Listener>(\"Listener\", std::bind(&EntityEditor::ListenerEditor, this, std::placeholders::_1));\n    AddEditor<Component::Script>(\"Script\", std::bind(&EntityEditor::ScriptEditor, this, std::placeholders::_1));\n    AddEditor<Component::SoundSource>(\"Sound source\", std::bind(&EntityEditor::SoundSourceEditor, this, std::placeholders::_1));\n    AddEditor<Component::ParticleEmitter>(\"Particle emitter\", std::bind(&EntityEditor::ParticleEmitterEditor, this, std::placeholders::_1));\n}\n\nEntityEditor::~EntityEditor() {\n    \n}\n\nvoid EntityEditor::Show() {\n    if (ImGui::Begin((\"Entity: \" + entity->name + \"###\" + std::to_string(reinterpret_cast<uintptr_t>(entity))).c_str(), &visible)) {\n        ImGui::InputText(\"Name\", name, 128);\n        entity->name = name;\n        ImGui::Text(\"Transform\");\n        ImGui::Indent();\n        ImGui::InputFloat3(\"Position\", &entity->position[0]);\n        ImGui::InputFloat3(\"Rotation\", &entity->rotation[0]);\n        ImGui::InputFloat3(\"Scale\", &entity->scale[0]);\n        ImGui::Unindent();\n        if (!entity->IsScene()) {\n            if (ImGui::Button(\"Add component\"))\n                ImGui::OpenPopup(\"Add component\");\n            \n            if (ImGui::BeginPopup(\"Add component\")) {\n                ImGui::Text(\"Components\");\n                ImGui::Separator();\n                \n                for (Editor& editor : editors) {\n                    editor.addFunction();\n                }\n                \n                ImGui::EndPopup();\n            }\n            \n            for (Editor& editor : editors) {\n                editor.editFunction();\n            }\n        }\n    }\n\n    ImGui::End();\n}\n\nvoid EntityEditor::SetEntity(Entity* entity) {\n    this->entity = entity;\n    strcpy(name, entity->name.c_str());\n}\n\nbool EntityEditor::ShowsEntity(Entity* entity) {\n    return this->entity == entity;\n}\n\nbool EntityEditor::IsVisible() const {\n    return visible;\n}\n\nvoid EntityEditor::SetVisible(bool visible) {\n    this->visible = visible;\n}\n\nvoid EntityEditor::AnimationEditor(Component::Animation* animation) {\n    ImGui::Indent();\n    if (ImGui::Button(\"Select model##Animation\"))\n        ImGui::OpenPopup(\"Select model##Animation\");\n\n    if (ImGui::BeginPopup(\"Select model##Animation\")) {\n        ImGui::Text(\"Models\");\n        ImGui::Separator();\n\n        for (Geometry::Model* model : Hymn().models) {\n            if (ImGui::Selectable(model->name.c_str()))\n                animation->riggedModel = dynamic_cast<Geometry::RiggedModel*>(model);\n        }\n\n        ImGui::EndPopup();\n    }\n    ImGui::Unindent();\n}\n\nvoid EntityEditor::PhysicsEditor(Component::Physics* physics) {\n    ImGui::Text(\"Positional\");\n    ImGui::Indent();\n    ImGui::InputFloat3(\"Velocity\", &physics->velocity[0]);\n    ImGui::InputFloat(\"Max velocity\", &physics->maxVelocity);\n    ImGui::InputFloat3(\"Acceleration\", &physics->acceleration[0]);\n    ImGui::InputFloat(\"Velocity drag factor\", &physics->velocityDragFactor);\n    ImGui::InputFloat(\"Gravity factor\", &physics->gravityFactor);\n    ImGui::Unindent();\n    ImGui::Text(\"Angular\");\n    ImGui::Indent();\n    ImGui::InputFloat3(\"Angular velocity\", &physics->angularVelocity[0]);\n    ImGui::InputFloat(\"Max angular velocity\", &physics->maxAngularVelocity);\n    ImGui::InputFloat3(\"Angular acceleration\", &physics->angularAcceleration[0]);\n    ImGui::InputFloat(\"Angular drag factor\", &physics->angularDragFactor);\n    ImGui::InputFloat3(\"Moment of inertia\", &physics->momentOfInertia[0]);\n    ImGui::Unindent();\n\n}\n\nvoid EntityEditor::MeshEditor(Component::Mesh* mesh) {\n    ImGui::Indent();\n    if (ImGui::Button(\"Select model##Mesh\"))\n        ImGui::OpenPopup(\"Select model##Mesh\");\n    \n    if (ImGui::BeginPopup(\"Select model##Mesh\")) {\n        ImGui::Text(\"Models\");\n        ImGui::Separator();\n        \n        for (Geometry::Model* model : Hymn().models) {\n            if (ImGui::Selectable(model->name.c_str()))\n                mesh->geometry = model;\n        }\n        \n        ImGui::EndPopup();\n    }\n    ImGui::Unindent();\n}\n\nvoid EntityEditor::LensEditor(Component::Lens* lens) {\n    ImGui::Indent();\n    ImGui::InputFloat(\"Field of view\", &lens->fieldOfView);\n    ImGui::InputFloat(\"Z near\", &lens->zNear);\n    ImGui::InputFloat(\"Z far\", &lens->zFar);\n    ImGui::Unindent();\n}\n\nvoid EntityEditor::MaterialEditor(Component::Material* material) {\n    \/\/ Diffuse\n    ImGui::Text(\"Diffuse\");\n    ImGui::Indent();\n    if (material->diffuse->IsLoaded())\n        ImGui::Image((void*) material->diffuse->GetTextureID(), ImVec2(128, 128));\n    \n    if (ImGui::Button(\"Select diffuse texture\"))\n        ImGui::OpenPopup(\"Select diffuse texture\");\n    \n    if (ImGui::BeginPopup(\"Select diffuse texture\")) {\n        ImGui::Text(\"Textures\");\n        ImGui::Separator();\n        \n        for (Texture2D* texture : Hymn().textures) {\n            if (ImGui::Selectable(texture->name.c_str()))\n                material->diffuse = texture;\n        }\n        \n        ImGui::EndPopup();\n    }\n    ImGui::Unindent();\n\n\n    \/\/ Normal\n    ImGui::Text(\"Normal\");\n    ImGui::Indent();\n    if (material->normal->IsLoaded())\n        ImGui::Image((void*) material->normal->GetTextureID(), ImVec2(128, 128));\n    \n    if (ImGui::Button(\"Select normal texture\"))\n        ImGui::OpenPopup(\"Select normal texture\");\n    \n    if (ImGui::BeginPopup(\"Select normal texture\")) {\n        ImGui::Text(\"Textures\");\n        ImGui::Separator();\n        \n        for (Texture2D* texture : Hymn().textures) {\n            if (ImGui::Selectable(texture->name.c_str()))\n                material->normal = texture;\n        }\n        \n        ImGui::EndPopup();\n    }\n    ImGui::Unindent();\n\n    \/\/ Specular\n    ImGui::Text(\"Specular\");\n    ImGui::Indent();\n    if (material->specular->IsLoaded())\n        ImGui::Image((void*) material->specular->GetTextureID(), ImVec2(128, 128));\n    \n    if (ImGui::Button(\"Select specular texture\"))\n        ImGui::OpenPopup(\"Select specular texture\");\n    \n    if (ImGui::BeginPopup(\"Select specular texture\")) {\n        ImGui::Text(\"Textures\");\n        ImGui::Separator();\n        \n        for (Texture2D* texture : Hymn().textures) {\n            if (ImGui::Selectable(texture->name.c_str()))\n                material->specular = texture;\n        }\n        \n        ImGui::EndPopup();\n    }\n    ImGui::Unindent();\n\n    \/\/ Glow\n    ImGui::Text(\"Glow\");\n    ImGui::Indent();\n    if (material->glow->IsLoaded())\n        ImGui::Image((void*) material->glow->GetTextureID(), ImVec2(128, 128));\n    \n    if (ImGui::Button(\"Select glow texture\"))\n        ImGui::OpenPopup(\"Select glow texture\");\n    \n    if (ImGui::BeginPopup(\"Select glow texture\")) {\n        ImGui::Text(\"Textures\");\n        ImGui::Separator();\n        \n        for (Texture2D* texture : Hymn().textures) {\n            if (ImGui::Selectable(texture->name.c_str()))\n                material->glow = texture;\n        }\n        \n        ImGui::EndPopup();\n    }\n    ImGui::Unindent();\n}\n\nvoid EntityEditor::DirectionalLightEditor(Component::DirectionalLight* directionalLight) {\n    ImGui::Indent();\n    ImGui::InputFloat3(\"Color\", &directionalLight->color[0]);\n    ImGui::DraggableFloat(\"Ambient coefficient\", directionalLight->ambientCoefficient, 0.0f);\n    ImGui::Unindent();\n}\n\nvoid EntityEditor::PointLightEditor(Component::PointLight* pointLight) {\n    ImGui::Indent();\n    ImGui::InputFloat3(\"Color\", &pointLight->color[0]);\n    ImGui::DraggableFloat(\"Ambient coefficient\", pointLight->ambientCoefficient, 0.0f);\n    ImGui::DraggableFloat(\"Attenuation\", pointLight->attenuation, 0.0f);\n    ImGui::DraggableFloat(\"Intensity\", pointLight->intensity, 0.0f);\n    ImGui::Unindent();\n}\n\nvoid EntityEditor::SpotLightEditor(Component::SpotLight* spotLight) {\n    ImGui::Indent();\n    ImGui::InputFloat3(\"Color\", &spotLight->color[0]);\n    ImGui::DraggableFloat(\"Ambient coefficient\", spotLight->ambientCoefficient, 0.0f);\n    ImGui::DraggableFloat(\"Attenuation\", spotLight->attenuation, 0.0f);\n    ImGui::DraggableFloat(\"Intensity\", spotLight->intensity, 0.0f);\n    ImGui::DraggableFloat(\"Cone angle\", spotLight->coneAngle, 0.0f, 180.f);\n    ImGui::Unindent();\n}\n\nvoid EntityEditor::ListenerEditor(Component::Listener* listener) {\n    \n}\n\nvoid EntityEditor::ScriptEditor(Component::Script* script) {\n    ImGui::Indent();\n    if(script->scriptFile != nullptr)\n        ImGui::Text(script->scriptFile->name.c_str());\n    else\n        ImGui::Text(\"No script loaded\");\n    \n    if (ImGui::Button(\"Select script\"))\n        ImGui::OpenPopup(\"Select script\");\n\n    if (ImGui::BeginPopup(\"Select script\")) {\n        ImGui::Text(\"Scripts\");\n        ImGui::Separator();\n\n        for (ScriptFile* scriptFile : Hymn().scripts) {\n            if (ImGui::Selectable(scriptFile->name.c_str()))\n                script->scriptFile = scriptFile;\n        }\n\n        ImGui::EndPopup();\n    }\n    ImGui::Unindent();\n}\n\nvoid EntityEditor::SoundSourceEditor(Component::SoundSource* soundSource) {\n    ImGui::Text(\"Sound\");\n    ImGui::Indent();\n    if (ImGui::Button(\"Select sound\"))\n        ImGui::OpenPopup(\"Select sound\");\n    \n    if (ImGui::BeginPopup(\"Select sound\")) {\n        ImGui::Text(\"Sounds\");\n        ImGui::Separator();\n        \n        for (Audio::SoundBuffer* sound : Hymn().sounds) {\n            if (ImGui::Selectable(sound->name.c_str()))\n                soundSource->soundBuffer = sound;\n        }\n        \n        ImGui::EndPopup();\n    }\n    ImGui::Unindent();\n    ImGui::Text(\"Sound properties\");\n    ImGui::Indent();\n    ImGui::DraggableFloat(\"Pitch\", soundSource->pitch, 0.0f);\n    ImGui::DraggableFloat(\"Gain\", soundSource->gain, 0.0f);\n    ImGui::Checkbox(\"Loop\", &soundSource->loop);\n    ImGui::Unindent();\n}\n\nvoid EntityEditor::ParticleEmitterEditor(Component::ParticleEmitter* particleEmitter) {\n    ImGui::Text(\"Particle\");\n    ImGui::Indent();\n    int rows = Managers().particleManager->GetTextureAtlasRows();\n    float column = static_cast<float>(particleEmitter->particleType.textureIndex % rows);\n    float row = static_cast<float>(particleEmitter->particleType.textureIndex \/ rows);\n    ImGui::Image((void*) Managers().particleManager->GetTextureAtlas()->GetTextureID(), ImVec2(128, 128), ImVec2(column \/ rows, row \/ rows), ImVec2((column + 1.f) \/ rows, (row + 1.f) \/ rows));\n    ImGui::InputInt(\"Texture index\", &particleEmitter->particleType.textureIndex);\n    ImGui::DraggableVec3(\"Min velocity\", particleEmitter->particleType.minVelocity);\n    ImGui::DraggableVec3(\"Max velocity\", particleEmitter->particleType.maxVelocity);\n    ImGui::DraggableFloat(\"Average lifetime\", particleEmitter->particleType.averageLifetime, 0.0f);\n    ImGui::DraggableFloat(\"Lifetime variance\", particleEmitter->particleType.lifetimeVariance, 0.0f);\n    ImGui::DraggableVec2(\"Average size\", particleEmitter->particleType.averageSize, 0.0f);\n    ImGui::DraggableVec2(\"Size variance\", particleEmitter->particleType.sizeVariance, 0.0f);\n    ImGui::Checkbox(\"Uniform scaling\", &particleEmitter->particleType.uniformScaling);\n    ImGui::DraggableFloat(\"Start alpha\", particleEmitter->particleType.startAlpha, 0.0f, 1.0f);\n    ImGui::DraggableFloat(\"Mid alpha\", particleEmitter->particleType.midAlpha, 0.0f, 1.0f);\n    ImGui::DraggableFloat(\"End alpha\", particleEmitter->particleType.endAlpha, 0.0f, 1.0f);\n    ImGui::InputFloat3(\"Color\", &particleEmitter->particleType.color[0]);\n    ImGui::Unindent();\n    \n    ImGui::Text(\"Emitter\");\n    ImGui::Indent();\n    ImGui::DraggableVec3(\"Size\", particleEmitter->size);\n    ImGui::DraggableFloat(\"Average emit time\", particleEmitter->averageEmitTime, 0.0f);\n    ImGui::DraggableFloat(\"Emit time variance\", particleEmitter->emitTimeVariance, 0.0f);\n    \n    if (ImGui::Button(\"Emitter type\"))\n        ImGui::OpenPopup(\"Emitter type\");\n    \n    if (ImGui::BeginPopup(\"Emitter type\")) {\n        ImGui::Text(\"Emitter type\");\n        ImGui::Separator();\n        \n        if (ImGui::Selectable(\"Point\"))\n            particleEmitter->emitterType = Component::ParticleEmitter::POINT;\n        \n        if (ImGui::Selectable(\"Cuboid\"))\n            particleEmitter->emitterType = Component::ParticleEmitter::CUBOID;\n        \n        ImGui::EndPopup();\n    }\n    ImGui::Unindent();\n    \n    ImGui::Text(\"Preview\");\n    ImGui::Indent();\n    ImGui::Checkbox(\"Simulate\", &particleEmitter->preview);\n    ImGui::Unindent();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (C) 2007-2013  CEA\/DEN, EDF R&D, OPEN CASCADE\n\/\/\n\/\/ This 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\/\/ File      : GEOMGUI_CreationInfoWdg.cxx\n\/\/ Created   : Fri Jun  7 13:07:59 2013\n\/\/ Author    : Edward AGAPOV (eap)\n\n#include \"GEOMGUI_CreationInfoWdg.h\"\n\n#include <SalomeApp_Application.h>\n#include <SUIT_Desktop.h>\n\n#include <QString>\n#include <QLabel>\n#include <QLineEdit>\n#include <QTreeWidget>\n#include <QHeaderView>\n#include <QGroupBox>\n#include <QVBoxLayout>\n#include <QHBoxLayout>\n\nGEOMGUI_CreationInfoWdg::GEOMGUI_CreationInfoWdg( SalomeApp_Application* app )\n\/\/:QWidget( app->desktop() )\n{\n  setWindowTitle(tr(\"CREATION_INFO_TITLE\"));\n\n  QFrame* frame = new QFrame( this );\n\n  QVBoxLayout* myLayout = new QVBoxLayout( this );\n  myLayout->addWidget( frame );\n  myLayout->setMargin(0);\n\n  QGroupBox* operationGB = new QGroupBox( tr( \"OPERATION\" ), frame );\n\n  myIconLbl      = new QLabel( operationGB );\n  myOperaionLnEd = new QLineEdit( operationGB );\n  myOperaionLnEd->setReadOnly( true );\n  myParamsTreeWd = new QTreeWidget( frame );\n  myParamsTreeWd->setColumnCount( 2 );\n  myParamsTreeWd->setHeaderLabels( QStringList() << tr( \"PARAMETER\" ) << tr( \"VALUE\" ) );\n  myParamsTreeWd->header()->setStretchLastSection( true );\n  myParamsTreeWd->header()->setResizeMode( 0, QHeaderView::ResizeToContents );\n\n  QHBoxLayout* operationLay = new QHBoxLayout( operationGB );\n  operationLay->addWidget( myIconLbl );\n  operationLay->addWidget( myOperaionLnEd );\n  operationLay->setMargin(5);\n\n  QVBoxLayout* aLayout = new QVBoxLayout( frame );\n  aLayout->addWidget( operationGB );\n  aLayout->addWidget( myParamsTreeWd );\n\n  \/\/ get a free dockable window id\n  myWindowID = 1;\n  while( app->dockWindow( myWindowID ))\n    ++myWindowID;\n}\n\nvoid GEOMGUI_CreationInfoWdg::setOperation(const QPixmap& icon, const QString& name)\n{\n  myIconLbl->setPixmap( icon );\n  myOperaionLnEd->setText( name );\n  myParamsTreeWd->clear();\n\n  if ( name.isEmpty() )\n    myOperaionLnEd->setText( tr(\"NO_INFO\"));\n}\n\nvoid GEOMGUI_CreationInfoWdg::addParam (const QString& name, const QString& value)\n{\n  QTreeWidgetItem* item = new QTreeWidgetItem( myParamsTreeWd );\n\n  \/\/item->setFlags( Qt::NoItemFlags );\n  item->setExpanded( true );\n\n  item->setText( 0, name );\n  item->setText( 1, value );\n}\n\nvoid GEOMGUI_CreationInfoWdg::clear()\n{\n  myIconLbl->setPixmap( QPixmap() );\n  myOperaionLnEd->setText( \"\" );\n  myParamsTreeWd->clear();\n}\n\nGEOMGUI_CreationInfoWdg::~GEOMGUI_CreationInfoWdg()\n{\n  \/\/std::cout<<\"~GEOMGUI_CreationInfoWdg\"<<std::endl;\n}\n<commit_msg>  ++myWindowID; \/\/ pb when a GEOM is a sole module: CreationInfoWdg replaces Python console<commit_after>\/\/ Copyright (C) 2007-2013  CEA\/DEN, EDF R&D, OPEN CASCADE\n\/\/\n\/\/ This 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\/\/ File      : GEOMGUI_CreationInfoWdg.cxx\n\/\/ Created   : Fri Jun  7 13:07:59 2013\n\/\/ Author    : Edward AGAPOV (eap)\n\n#include \"GEOMGUI_CreationInfoWdg.h\"\n\n#include <SalomeApp_Application.h>\n#include <SUIT_Desktop.h>\n\n#include <QString>\n#include <QLabel>\n#include <QLineEdit>\n#include <QTreeWidget>\n#include <QHeaderView>\n#include <QGroupBox>\n#include <QVBoxLayout>\n#include <QHBoxLayout>\n\nGEOMGUI_CreationInfoWdg::GEOMGUI_CreationInfoWdg( SalomeApp_Application* app )\n\/\/:QWidget( app->desktop() )\n{\n  setWindowTitle(tr(\"CREATION_INFO_TITLE\"));\n\n  QFrame* frame = new QFrame( this );\n\n  QVBoxLayout* myLayout = new QVBoxLayout( this );\n  myLayout->addWidget( frame );\n  myLayout->setMargin(0);\n\n  QGroupBox* operationGB = new QGroupBox( tr( \"OPERATION\" ), frame );\n\n  myIconLbl      = new QLabel( operationGB );\n  myOperaionLnEd = new QLineEdit( operationGB );\n  myOperaionLnEd->setReadOnly( true );\n  myParamsTreeWd = new QTreeWidget( frame );\n  myParamsTreeWd->setColumnCount( 2 );\n  myParamsTreeWd->setHeaderLabels( QStringList() << tr( \"PARAMETER\" ) << tr( \"VALUE\" ) );\n  myParamsTreeWd->header()->setStretchLastSection( true );\n  myParamsTreeWd->header()->setResizeMode( 0, QHeaderView::ResizeToContents );\n\n  QHBoxLayout* operationLay = new QHBoxLayout( operationGB );\n  operationLay->addWidget( myIconLbl );\n  operationLay->addWidget( myOperaionLnEd );\n  operationLay->setMargin(5);\n\n  QVBoxLayout* aLayout = new QVBoxLayout( frame );\n  aLayout->addWidget( operationGB );\n  aLayout->addWidget( myParamsTreeWd );\n\n  \/\/ get a free dockable window id\n  myWindowID = 1;\n  while( app->dockWindow( myWindowID ))\n    ++myWindowID;\n  ++myWindowID; \/\/ pb when a GEOM is a sole module: CreationInfoWdg replaces Python console\n}\n\nvoid GEOMGUI_CreationInfoWdg::setOperation(const QPixmap& icon, const QString& name)\n{\n  myIconLbl->setPixmap( icon );\n  myOperaionLnEd->setText( name );\n  myParamsTreeWd->clear();\n\n  if ( name.isEmpty() )\n    myOperaionLnEd->setText( tr(\"NO_INFO\"));\n}\n\nvoid GEOMGUI_CreationInfoWdg::addParam (const QString& name, const QString& value)\n{\n  QTreeWidgetItem* item = new QTreeWidgetItem( myParamsTreeWd );\n\n  \/\/item->setFlags( Qt::NoItemFlags );\n  item->setExpanded( true );\n\n  item->setText( 0, name );\n  item->setText( 1, value );\n}\n\nvoid GEOMGUI_CreationInfoWdg::clear()\n{\n  myIconLbl->setPixmap( QPixmap() );\n  myOperaionLnEd->setText( \"\" );\n  myParamsTreeWd->clear();\n}\n\nGEOMGUI_CreationInfoWdg::~GEOMGUI_CreationInfoWdg()\n{\n  \/\/std::cout<<\"~GEOMGUI_CreationInfoWdg\"<<std::endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Day19.cpp : Defines the entry point for the console application.\n\/\/\n\n#include \"stdafx.h\"\n\nconstexpr uint64_t Input = 3005290;\n\nuint64_t PartOne(uint64_t ElveCount);\nuint64_t PartTwo(uint64_t ElveCount);\n\nint main()\n{\n\tstd::cout << \"Part One Elf: \" << PartOne(Input) << std::endl;\n\tstd::cout << \"Part Two Elf: \" << PartTwo(Input) << std::endl;\n\tsystem(\"pause\");\n\n    return 0;\n}\n\nuint64_t PartOne(uint64_t ElveCount)\n{\n\tuint64_t ElfIndex = 0;\n\tuint64_t Offset = 1;\n\n\twhile (ElveCount != 1)\n\t{\n\t\tbool Even = (ElveCount % 2) == 0;\n\t\tElveCount \/= 2;\n\t\tOffset *= 2;\n\n\t\tif (!Even)\n\t\t{\n\t\t\tElfIndex += Offset;\n\t\t}\n\t}\n\n\treturn ElfIndex + 1;\n}\n\nuint64_t PartTwo(uint64_t ElveCount)\n{\n\tdouble ElveLog = std::log2(ElveCount) \/ std::log2(3);\n\tuint64_t ElveLowerBound = static_cast<uint64_t>(std::pow(3.0, std::floor(ElveLog)));\n\n\tElveCount -= ElveLowerBound;\n\tif (ElveCount < ElveLowerBound)\n\t{\n\t\treturn ElveCount;\n\t}\n\telse\n\t{\n\t\treturn ((ElveCount - ElveLowerBound) * 2) + ElveLowerBound;\n\t}\n}\n\n<commit_msg>Change part one to constant computation similar to part two; Fix typo in part two<commit_after>\/\/ Day19.cpp : Defines the entry point for the console application.\n\/\/\n\n#include \"stdafx.h\"\n\nconstexpr uint64_t Input = 3005290;\n\nuint64_t PartOne(uint64_t ElveCount);\nuint64_t PartTwo(uint64_t ElveCount);\n\nint main()\n{\n\tstd::cout << \"Part One Elf: \" << PartOne(Input) << std::endl;\n\tstd::cout << \"Part Two Elf: \" << PartTwo(Input) << std::endl;\n\n\tsystem(\"pause\");\n\n    return 0;\n}\n\nuint64_t PartOne(uint64_t ElveCount)\n{\n\tdouble ElfLog = std::log2(ElveCount);\n\tuint64_t ElfLowerBound = static_cast<uint64_t>(std::pow(2.0, std::floor(ElfLog)));\n\n\treturn (((ElveCount - ElfLowerBound) * 2) + 1);\n}\n\nuint64_t PartTwo(uint64_t ElveCount)\n{\n\tdouble ElfLog = std::log2(ElveCount) \/ std::log2(3);\n\tuint64_t ElfLowerBound = static_cast<uint64_t>(std::pow(3.0, std::floor(ElfLog)));\n\n\tElveCount -= ElfLowerBound;\n\tif (ElveCount < ElfLowerBound)\n\t{\n\t\treturn ElveCount;\n\t}\n\telse\n\t{\n\t\treturn ((ElveCount - ElfLowerBound) * 2) + ElfLowerBound;\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"j1App.h\"\n#include \"j1Textures.h\"\n#include \"j1Input.h\"\n#include \"j1Render.h\"\n#include \"j1Collision.h\"\n#include \"j1Player.h\"\n#include \"p2Log.h\"\n#include \"j1Window.h\"\n#include \"j1Map.h\"\n#include \"j1Scene.h\"\n#include \"j1Audio.h\"\n\n#include<stdio.h>\n\n\/\/ Reference at https:\/\/www.youtube.com\/watch?v=OEhmUuehGOA\n\nj1Player::j1Player() : Entity(\"player\")\n{\n\tname.create(\"player\");\n\n\t\/\/ Animations\n\tjump_cloud.PushBack({ 108, 60, 52, 20 });\n\tjump_cloud.PushBack({ 108, 40, 52, 20 });\n\tjump_cloud.PushBack({ 108, 20, 52, 20 });\n\tjump_cloud.PushBack({ 108, 0, 52, 20 });\n\tjump_cloud.PushBack({ 108, 0, 0, 0 });\n\tjump_cloud.speed = 0.17f;\n\tjump_cloud.loop = false;\n\n\tcloud_offset.x = -16;\n\tcloud_offset.y = 17;\n\n\tSSJ_aura.PushBack({ 163, 1, 36, 45 });\n\tSSJ_aura.PushBack({ 163, 47, 36, 45 });\n\tSSJ_aura.PushBack({ 163, 94, 36, 45 });\n\tSSJ_aura.speed = 0.1f;\n\n\taura_offset.x = -7;\n\taura_offset.y = -12;\n\n\t\/*collider_move.x = 2;\n\tcollider_move.y = 0;*\/\n}\n\nj1Player::~j1Player()\n{}\n\nbool j1Player::Awake(pugi::xml_node& config)\n{\n\tspeed = config.attribute(\"speed\").as_float();\n\tjump_force = config.attribute(\"jump_force\").as_float();\n\n\treturn true;\n}\n\n\/\/ Load assets\nbool j1Player::Start()\n{\n\tLOG(\"Loading player\");\n\n\tif (graphics == nullptr)\n\t\tgraphics = App->tex->Load(\"textures\/character\/Character spritesheet.png\");\n\n\tif (graphics_god == nullptr)\n\t\tgraphics_god = App->tex->Load(\"textures\/character\/godmode_spritesheet.png\");\n\n\tif (collider == nullptr)\n\t\tcollider = App->collision->AddCollider({ 0, 0, 21, 33 }, COLLIDER_PLAYER, this);\n\n\tcollidingFloor = nullptr;\n\tcolliding_bottom = false;\n\tcolliding_left = false;\n\tcolliding_right = false;\n\n\tv.x = 0;\n\tv.y = 0;\n\n\tanimation = &idle_right;\n\n\tvirtualPosition.x = position.x;\n\tvirtualPosition.y = position.y;\n\n\tif (step_fx == 0)\n\t\tstep_fx = App->audio->LoadFx(\"audio\/fx\/step.wav\");\n\tif (jump_fx == 0)\n\t\tjump_fx = App->audio->LoadFx(\"audio\/fx\/jump.wav\");\n\tif (double_jump_fx == 0)\n\t\tdouble_jump_fx = App->audio->LoadFx(\"audio\/fx\/double_jump.wav\");\n\tif (landing_fx == 0)\n\t\tlanding_fx = App->audio->LoadFx(\"audio\/fx\/landing.wav\");\n\tif (die_fx == 0)\n\t\tdie_fx = App->audio->LoadFx(\"audio\/fx\/die.wav\");\n\tif (SSJ_transformation == 0)\n\t\tSSJ_transformation = App->audio->LoadFx(\"audio\/fx\/SSJ_transformation.wav\");\n\tif (SSJ_off == 0)\n\t\tSSJ_off = App->audio->LoadFx(\"audio\/fx\/SSJ_off.wav\");\n\n\treturn true;\n}\n\n\/\/ Unload assets\nbool j1Player::CleanUp()\n{\n\tLOG(\"Unloading player\");\n\n\tApp->tex->UnLoad(graphics);\n\tApp->tex->UnLoad(graphics_god);\n\tif (collider != nullptr)\n\t{\n\t\tcollider->to_delete = true;\n\t\tcollider = nullptr;\n\t}\n\n\treturn true;\n}\n\n\/\/ Update: draw background\nbool j1Player::Update(float dt)\n{\n\tEntity_Update();\n\n\tif (App->input->GetKey(SDL_SCANCODE_A) == KEY_DOWN)\n\t{\n\t\tv.x = -speed;\n\t\tif (state != JUMPING && state != DEAD)\n\t\t{\n\t\t\tstate = LEFT;\n\t\t}\n\t}\n\telse if (App->input->GetKey(SDL_SCANCODE_A) == KEY_UP)\n\t{\n\t\tif (state == LEFT)\n\t\t{\n\t\t\tv.x = 0;\n\t\t\tstate = IDLE;\n\t\t}\n\t}\n\tif (App->input->GetKey(SDL_SCANCODE_D) == KEY_DOWN)\n\t{\n\t\tv.x = speed;\n\t\tif (state != JUMPING && state != DEAD)\n\t\t{\n\t\t\tstate = RIGHT;\n\t\t}\n\t}\n\telse if (App->input->GetKey(SDL_SCANCODE_D) == KEY_UP)\n\t{\n\t\tif (state == RIGHT)\n\t\t{\n\t\t\tv.x = 0;\n\t\t\tstate = IDLE;\n\t\t}\n\t}\n\tif (App->input->GetKey(SDL_SCANCODE_SPACE) == KEY_DOWN)\n\t{\n\t\tif (!double_jump)\n\t\t{\n\t\t\tif (state == JUMPING || state == FALLING)\n\t\t\t{\n\t\t\t\tdouble_jump = true;\n\t\t\t\tcloud_pos.x = position.x + cloud_offset.x;\n\t\t\t\tcloud_pos.y = position.y + cloud_offset.y;\n\t\t\t\tv.y = (jump_force * 2 \/ 3);\n\t\t\t\tif (state == FALLING)\n\t\t\t\t{\n\t\t\t\t\tstate = JUMPING;\n\t\t\t\t}\n\t\t\t\t\/\/Double jumping sound\n\t\t\t\tApp->audio->PlayFx(double_jump_fx, 0);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tv.y = jump_force;\n\t\t\t\tstate = JUMPING;\n\t\t\t\t\/\/Jumping sound\n\t\t\t\tApp->audio->PlayFx(jump_fx, 0);\n\n\t\t\t}\n\t\t}\n\t}\n\t\/\/Running sound\n\tif (v.x != 0 && colliding_bottom && SDL_GetTicks() > step_time)\n\t{\n\t\tApp->audio->PlayFx(step_fx, 0);\n\t\tstep_time = SDL_GetTicks() + (1 \/ right.speed) + 450;\n\t}\n\n\tcollider->SetPos(virtualPosition.x + collider_move.x, virtualPosition.y + collider_move.y);\n\n\tApp->player->colliding_left = false;\n\tApp->player->colliding_right = false;\n\n\treturn true;\n}\n\nbool j1Player::PostUpdate()\n{\n\tif (App->input->GetKey(SDL_SCANCODE_D) == KEY_REPEAT && !colliding_right && v.x == 0)\n\t{\n\t\tv.x = speed;\n\t}\n\tif (App->input->GetKey(SDL_SCANCODE_A) == KEY_REPEAT && !colliding_left && v.x == 0)\n\t{\n\t\tv.x = -speed;\n\t}\n\n\tposition.x = virtualPosition.x;\n\tposition.y = virtualPosition.y;\n\n\tint win_scale = App->win->GetScale();\n\tpos_relCam = App->player->position.x + App->render->camera.x \/ win_scale;\n\n\tif (position.y > App->win->screen_surface->h \/ win_scale + 50 && !won)\n\t{\n\t\tApp->audio->PlayFx(die_fx, 0);\n\t\tApp->scene->LoadLvl(App->scene->current_lvl->data->lvl);\n\t}\n\n\t\/\/When f10 is clicked he converts into super sayan (god mode)\n\tif (god_mode)\n\t{\n\t\tApp->render->Blit(graphics_god, position.x + aura_offset.x, position.y + aura_offset.y, &SSJ_aura.GetCurrentFrame());\n\t\tApp->render->Blit(graphics_god, position.x, position.y, &animation->GetCurrentFrame());\n\t\tApp->render->Blit(graphics_god, position.x + aura_offset.x, position.y + aura_offset.y, &SSJ_aura.GetCurrentFrame());\n\t}\n\telse if (god_mode == false)\n\t{\n\t\tApp->render->Blit(graphics, position.x, position.y, &animation->GetCurrentFrame());\n\t}\n\n\tif (double_jump)\n\t{\n\t\tApp->render->Blit(graphics, cloud_pos.x, cloud_pos.y, &jump_cloud.GetCurrentFrame());\n\t}\n\n\treturn true;\n}\n\nvoid j1Player::OnCollision(Collider* c1, Collider* c2)\n{\n\tif (c2->type == COLLIDER_FLOOR || c2->type == COLLIDER_JUMPABLE)\n\t{\n\t\tif (((c2->rect.y - v.y + 1) > (c1->rect.y + (c1->rect.h)))) \/\/The collision is from bottom\n\t\t{\n\t\t\tdouble_jump = false;\n\t\t\tjump_cloud.Reset();\n\t\t}\n\t}\n\n\tEntity_OnCollision(c1, c2);\n}\n\nbool j1Player::Load(pugi::xml_node& data)\n{\n\tApp->scene->LoadLvl(data.attribute(\"level\").as_int());\n\tvirtualPosition.x = data.attribute(\"position_x\").as_int();\n\tvirtualPosition.y = data.attribute(\"position_y\").as_int();\n\tApp->render->virtualCamPos = -(virtualPosition.x * (int)App->win->GetScale() - 300);\n\tif (App->render->virtualCamPos > 0)\n\t{\n\t\tApp->render->virtualCamPos = 0;\n\t}\n\tif (App->render->virtualCamPos < App->scene->max_camera_pos)\n\t{\n\t\tApp->render->virtualCamPos = App->scene->max_camera_pos;\n\t}\n\t\n\treturn true;\n}\n\nbool j1Player::Save(pugi::xml_node& data) const\n{\n\tdata.append_attribute(\"position_x\") = position.x;\n\n\tdata.append_attribute(\"position_y\") = position.y - 5;\n\n\tdata.append_attribute(\"level\") = App->scene->current_lvl->data->lvl;\n\t\n\treturn true;\n}<commit_msg>character jump will be interrumped if player release space<commit_after>#include \"j1App.h\"\n#include \"j1Textures.h\"\n#include \"j1Input.h\"\n#include \"j1Render.h\"\n#include \"j1Collision.h\"\n#include \"j1Player.h\"\n#include \"p2Log.h\"\n#include \"j1Window.h\"\n#include \"j1Map.h\"\n#include \"j1Scene.h\"\n#include \"j1Audio.h\"\n\n#include<stdio.h>\n\n\/\/ Reference at https:\/\/www.youtube.com\/watch?v=OEhmUuehGOA\n\nj1Player::j1Player() : Entity(\"player\")\n{\n\tname.create(\"player\");\n\n\t\/\/ Animations\n\tjump_cloud.PushBack({ 108, 60, 52, 20 });\n\tjump_cloud.PushBack({ 108, 40, 52, 20 });\n\tjump_cloud.PushBack({ 108, 20, 52, 20 });\n\tjump_cloud.PushBack({ 108, 0, 52, 20 });\n\tjump_cloud.PushBack({ 108, 0, 0, 0 });\n\tjump_cloud.speed = 0.17f;\n\tjump_cloud.loop = false;\n\n\tcloud_offset.x = -16;\n\tcloud_offset.y = 17;\n\n\tSSJ_aura.PushBack({ 163, 1, 36, 45 });\n\tSSJ_aura.PushBack({ 163, 47, 36, 45 });\n\tSSJ_aura.PushBack({ 163, 94, 36, 45 });\n\tSSJ_aura.speed = 0.1f;\n\n\taura_offset.x = -7;\n\taura_offset.y = -12;\n\n\t\/*collider_move.x = 2;\n\tcollider_move.y = 0;*\/\n}\n\nj1Player::~j1Player()\n{}\n\nbool j1Player::Awake(pugi::xml_node& config)\n{\n\tspeed = config.attribute(\"speed\").as_float();\n\tjump_force = config.attribute(\"jump_force\").as_float();\n\n\treturn true;\n}\n\n\/\/ Load assets\nbool j1Player::Start()\n{\n\tLOG(\"Loading player\");\n\n\tif (graphics == nullptr)\n\t\tgraphics = App->tex->Load(\"textures\/character\/Character spritesheet.png\");\n\n\tif (graphics_god == nullptr)\n\t\tgraphics_god = App->tex->Load(\"textures\/character\/godmode_spritesheet.png\");\n\n\tif (collider == nullptr)\n\t\tcollider = App->collision->AddCollider({ 0, 0, 21, 33 }, COLLIDER_PLAYER, this);\n\n\tcollidingFloor = nullptr;\n\tcolliding_bottom = false;\n\tcolliding_left = false;\n\tcolliding_right = false;\n\n\tv.x = 0;\n\tv.y = 0;\n\n\tanimation = &idle_right;\n\n\tvirtualPosition.x = position.x;\n\tvirtualPosition.y = position.y;\n\n\tif (step_fx == 0)\n\t\tstep_fx = App->audio->LoadFx(\"audio\/fx\/step.wav\");\n\tif (jump_fx == 0)\n\t\tjump_fx = App->audio->LoadFx(\"audio\/fx\/jump.wav\");\n\tif (double_jump_fx == 0)\n\t\tdouble_jump_fx = App->audio->LoadFx(\"audio\/fx\/double_jump.wav\");\n\tif (landing_fx == 0)\n\t\tlanding_fx = App->audio->LoadFx(\"audio\/fx\/landing.wav\");\n\tif (die_fx == 0)\n\t\tdie_fx = App->audio->LoadFx(\"audio\/fx\/die.wav\");\n\tif (SSJ_transformation == 0)\n\t\tSSJ_transformation = App->audio->LoadFx(\"audio\/fx\/SSJ_transformation.wav\");\n\tif (SSJ_off == 0)\n\t\tSSJ_off = App->audio->LoadFx(\"audio\/fx\/SSJ_off.wav\");\n\n\treturn true;\n}\n\n\/\/ Unload assets\nbool j1Player::CleanUp()\n{\n\tLOG(\"Unloading player\");\n\n\tApp->tex->UnLoad(graphics);\n\tApp->tex->UnLoad(graphics_god);\n\tif (collider != nullptr)\n\t{\n\t\tcollider->to_delete = true;\n\t\tcollider = nullptr;\n\t}\n\n\treturn true;\n}\n\n\/\/ Update: draw background\nbool j1Player::Update(float dt)\n{\n\tLOG(\"Player Update\");\n\tEntity_Update();\n\n\tif (App->input->GetKey(SDL_SCANCODE_A) == KEY_DOWN)\n\t{\n\t\tv.x = -speed;\n\t\tif (state != JUMPING && state != DEAD)\n\t\t{\n\t\t\tstate = LEFT;\n\t\t}\n\t}\n\telse if (App->input->GetKey(SDL_SCANCODE_A) == KEY_UP)\n\t{\n\t\tif (state == LEFT)\n\t\t{\n\t\t\tv.x = 0;\n\t\t\tstate = IDLE;\n\t\t}\n\t}\n\tif (App->input->GetKey(SDL_SCANCODE_D) == KEY_DOWN)\n\t{\n\t\tv.x = speed;\n\t\tif (state != JUMPING && state != DEAD)\n\t\t{\n\t\t\tstate = RIGHT;\n\t\t}\n\t}\n\telse if (App->input->GetKey(SDL_SCANCODE_D) == KEY_UP)\n\t{\n\t\tif (state == RIGHT)\n\t\t{\n\t\t\tv.x = 0;\n\t\t\tstate = IDLE;\n\t\t}\n\t}\n\tif (App->input->GetKey(SDL_SCANCODE_SPACE) == KEY_DOWN)\n\t{\n\t\tif (!double_jump)\n\t\t{\n\t\t\tif (state == JUMPING || state == FALLING)\n\t\t\t{\n\t\t\t\tdouble_jump = true;\n\t\t\t\tcloud_pos.x = position.x + cloud_offset.x;\n\t\t\t\tcloud_pos.y = position.y + cloud_offset.y;\n\t\t\t\tv.y = (jump_force * 2 \/ 3);\n\t\t\t\tif (state == FALLING)\n\t\t\t\t{\n\t\t\t\t\tstate = JUMPING;\n\t\t\t\t}\n\t\t\t\t\/\/Double jumping sound\n\t\t\t\tApp->audio->PlayFx(double_jump_fx, 0);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tv.y = jump_force;\n\t\t\t\tstate = JUMPING;\n\t\t\t\t\/\/Jumping sound\n\t\t\t\tApp->audio->PlayFx(jump_fx, 0);\n\n\t\t\t}\n\t\t}\n\t}\n\telse if (App->input->GetKey(SDL_SCANCODE_SPACE) == KEY_UP)\n\t{\n\t\t\/\/ If player release space in mid jump, the character won't reach max height\n\t\tif (!double_jump && v.y > (jump_force * 2 \/ 3) \/ 2)\n\t\t{\n\t\t\tv.y = (jump_force * 2 \/ 3) \/ 2;\n\t\t}\n\t}\n\t\/\/Running sound\n\tif (v.x != 0 && colliding_bottom && SDL_GetTicks() > step_time)\n\t{\n\t\tApp->audio->PlayFx(step_fx, 0);\n\t\tstep_time = SDL_GetTicks() + (1 \/ right.speed) + 450;\n\t}\n\n\tcollider->SetPos(virtualPosition.x + collider_move.x, virtualPosition.y + collider_move.y);\n\n\tApp->player->colliding_left = false;\n\tApp->player->colliding_right = false;\n\n\treturn true;\n}\n\nbool j1Player::PostUpdate()\n{\n\tif (App->input->GetKey(SDL_SCANCODE_D) == KEY_REPEAT && !colliding_right && v.x == 0)\n\t{\n\t\tv.x = speed;\n\t}\n\tif (App->input->GetKey(SDL_SCANCODE_A) == KEY_REPEAT && !colliding_left && v.x == 0)\n\t{\n\t\tv.x = -speed;\n\t}\n\n\tposition.x = virtualPosition.x;\n\tposition.y = virtualPosition.y;\n\n\tint win_scale = App->win->GetScale();\n\tpos_relCam = App->player->position.x + App->render->camera.x \/ win_scale;\n\n\tif (position.y > App->win->screen_surface->h \/ win_scale + 50 && !won)\n\t{\n\t\tApp->audio->PlayFx(die_fx, 0);\n\t\tApp->scene->LoadLvl(App->scene->current_lvl->data->lvl);\n\t}\n\n\t\/\/When f10 is clicked he converts into super sayan (god mode)\n\tif (god_mode)\n\t{\n\t\tApp->render->Blit(graphics_god, position.x + aura_offset.x, position.y + aura_offset.y, &SSJ_aura.GetCurrentFrame());\n\t\tApp->render->Blit(graphics_god, position.x, position.y, &animation->GetCurrentFrame());\n\t\tApp->render->Blit(graphics_god, position.x + aura_offset.x, position.y + aura_offset.y, &SSJ_aura.GetCurrentFrame());\n\t}\n\telse if (god_mode == false)\n\t{\n\t\tApp->render->Blit(graphics, position.x, position.y, &animation->GetCurrentFrame());\n\t}\n\n\tif (double_jump)\n\t{\n\t\tApp->render->Blit(graphics, cloud_pos.x, cloud_pos.y, &jump_cloud.GetCurrentFrame());\n\t}\n\n\treturn true;\n}\n\nvoid j1Player::OnCollision(Collider* c1, Collider* c2)\n{\n\tif (c2->type == COLLIDER_FLOOR || c2->type == COLLIDER_JUMPABLE)\n\t{\n\t\tif (((c2->rect.y - v.y + 1) > (c1->rect.y + (c1->rect.h)))) \/\/The collision is from bottom\n\t\t{\n\t\t\tdouble_jump = false;\n\t\t\tjump_cloud.Reset();\n\t\t}\n\t}\n\n\tEntity_OnCollision(c1, c2);\n}\n\nbool j1Player::Load(pugi::xml_node& data)\n{\n\tApp->scene->LoadLvl(data.attribute(\"level\").as_int());\n\tvirtualPosition.x = data.attribute(\"position_x\").as_int();\n\tvirtualPosition.y = data.attribute(\"position_y\").as_int();\n\tApp->render->virtualCamPos = -(virtualPosition.x * (int)App->win->GetScale() - 300);\n\tif (App->render->virtualCamPos > 0)\n\t{\n\t\tApp->render->virtualCamPos = 0;\n\t}\n\tif (App->render->virtualCamPos < App->scene->max_camera_pos)\n\t{\n\t\tApp->render->virtualCamPos = App->scene->max_camera_pos;\n\t}\n\t\n\treturn true;\n}\n\nbool j1Player::Save(pugi::xml_node& data) const\n{\n\tdata.append_attribute(\"position_x\") = position.x;\n\n\tdata.append_attribute(\"position_y\") = position.y - 5;\n\n\tdata.append_attribute(\"level\") = App->scene->current_lvl->data->lvl;\n\t\n\treturn true;\n}<|endoftext|>"}
{"text":"<commit_before>\/*******************************************************************************\n * thrill\/api\/read_lines.hpp\n *\n * Part of Project Thrill.\n *\n * Copyright (C) 2015 Alexander Noe <aleexnoe@gmail.com>\n * Copyright (C) 2015 Timo Bingmann <tb@panthema.net>\n *\n * This file has no license. Only Chuck Norris can compile it.\n ******************************************************************************\/\n\n#pragma once\n#ifndef THRILL_API_READ_LINES_HEADER\n#define THRILL_API_READ_LINES_HEADER\n\n#include <thrill\/api\/dia.hpp>\n#include <thrill\/api\/source_node.hpp>\n#include <thrill\/common\/defines.hpp>\n#include <thrill\/common\/logger.hpp>\n#include <thrill\/common\/math.hpp>\n#include <thrill\/common\/stat_logger.hpp>\n#include <thrill\/common\/string.hpp>\n#include <thrill\/core\/file_io.hpp>\n#include <thrill\/net\/buffer_builder.hpp>\n\n#include <string>\n#include <utility>\n#include <vector>\n\nnamespace thrill {\nnamespace api {\n\n\/\/! \\addtogroup api Interface\n\/\/! \\{\n\n\/*!\n * A DIANode which performs a line-based Read operation. Read reads a file from\n * the file system and emits it as a DIA.\n *\/\nclass ReadLinesNode : public SourceNode<std::string>\n{\npublic:\n    using Super = SourceNode<std::string>;\n    using Super::context_;\n\n    using FileSizePair = std::pair<std::string, size_t>;\n\n    static const bool debug = false;\n\n    \/*!\n     * Constructor for a ReadLinesNode. Sets the Context\n     * and file path.\n     *\n     * \\param ctx Reference to Context, which holds references to data and\n     * network.\n     *\n     * \\param path Path of the input file(s)\n     *\/\n    ReadLinesNode(Context& ctx,\n                  const std::string& path,\n                  StatsNode* stats_node)\n        : Super(ctx, { }, stats_node),\n          path_(path)\n    {\n        LOG << \"Opening read notes for \" << path_;\n\n        filesize_prefix_ = core::GlobFileSizePrefixSum(path_);\n\n        for (auto file : filesize_prefix_) {\n            if (core::IsCompressed(file.first)) {\n                contains_compressed_file_ = true;\n                break;\n            }\n        }\n    }\n\n    void PushData(bool \/* consume *\/) final {\n        if (contains_compressed_file_) {\n            InputLineIteratorCompressed it = InputLineIteratorCompressed(\n                filesize_prefix_, context_);\n\n            \/\/ Hook Read\n            while (it.HasNext()) {\n                this->PushItem(it.Next());\n            }\n        }\n        else {\n            InputLineIteratorUncompressed it = InputLineIteratorUncompressed(\n                filesize_prefix_, context_);\n\n            \/\/ Hook Read\n            while (it.HasNext()) {\n                this->PushItem(it.Next());\n            }\n        }\n    }\n\n    void Dispose() final { }\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        return FunctionStack<std::string>();\n    }\n\nprivate:\n    \/\/! True, if at least one input file is compressed.\n    bool contains_compressed_file_ = false;\n    \/\/! Path of the input file.\n    std::string path_;\n\n    std::vector<std::pair<std::string, size_t> > filesize_prefix_;\n\n    class InputLineIterator\n    {\n    public:\n        InputLineIterator(const std::vector<FileSizePair>& files, Context& ctx)\n            : files_(files), context_(ctx) { }\n\n        static const bool debug = false;\n\n    protected:\n        \/\/! Block read size\n        const size_t read_size = data::default_block_size;\n        \/\/! String, which Next() references to\n        std::string data_;\n        \/\/! Input files with size prefixsum.\n        const std::vector<FileSizePair>& files_;\n        \/\/! Index of current file in files_\n        size_t current_file_ = 0;\n        \/\/! Byte buffer to create line-std::strings\n        net::BufferBuilder buffer_;\n        \/\/! Start of next element in current buffer.\n        unsigned char* current_;\n        \/\/! (exclusive) end of local block\n        size_t my_end_;\n\t\t\/\/! Reference to context\n\t\tContext& context_;\n\n\t\tsize_t stats_total_bytes_ = 0;\n\t\tsize_t stats_total_reads_ = 0;\n\t\tsize_t stats_total_elements_ = 0;\n\n\t\tbool ReadBlock(core::SysFile& file, net::BufferBuilder& buffer) {\n\t\t\tssize_t bytes = file.read(buffer.data(), read_size);\n\t\t\tbuffer.set_size(bytes);\n\t\t\tcurrent_ = buffer.begin();\n\t\t\tstats_total_bytes_ += bytes;\n\t\t\tstats_total_reads_++;\n\t\t\tLOG1 << \"Opening block with \" << bytes << \" bytes.\";\n\t\t\treturn bytes > 0;\n\t\t}\n\n        ~InputLineIterator() {\n            STAT(context_) << \"NodeType\" << \"ReadLines\"\n                           << \"TotalBytes\" << stats_total_bytes_\n                           << \"TotalReads\" << stats_total_reads_\n                           << \"TotalLines\" << stats_total_elements_;\n        }\n    };\n\n    \/\/! InputLineIterator gives you access to lines of a file\n    class InputLineIteratorUncompressed : public InputLineIterator\n    {\n    public:\n        \/\/! Creates an instance of iterator that reads file line based\n        InputLineIteratorUncompressed(\n            const std::vector<FileSizePair>& files,\n            Context& ctx)\n            : InputLineIterator(files, ctx) {\n\n            \/\/ Go to start of 'local part'.\n            size_t my_start;\n            std::tie(my_start, my_end_) =\n                common::CalculateLocalRange(files[NumFiles()].second, ctx.num_workers(), ctx.my_rank());\n\n            while (files_[current_file_ + 1].second <= my_start) {\n                current_file_++;\n            }\n            if (my_start < my_end_) {\n                LOG << \"Opening file \" << current_file_;\n                file_ = core::SysFile::OpenForRead(files_[current_file_].first);\n            }\n            else {\n                LOG << \"my_start : \" << my_start << \" my_end_: \" << my_end_;\n                return;\n            }\n\n            \/\/ find offset in current file:\n            \/\/ offset = start - sum of previous file sizes\n            offset_ = file_.lseek(my_start - files_[current_file_].second);\n            buffer_.Reserve(read_size);\n            ReadBlock(file_, buffer_);\n\n            if (offset_ != 0) {\n                bool found_n = false;\n\n                \/\/ find next newline, discard all previous data as previous worker already covers it\n                while (!found_n) {\n                    while (current_ < buffer_.end()) {\n                        if (THRILL_UNLIKELY(*current_++ == '\\n')) {\n                            found_n = true;\n                            break;\n                        }\n                    }\n                    \/\/ no newline found: read new data into buffer_builder\n                    if (!found_n) {\n                        offset_ += buffer_.size();\n                        if (!ReadBlock(file_, buffer_)) {\n                            \/\/ EOF = newline per definition\n                            found_n = true;\n                        }\n                    }\n                }\n            }\n            data_.reserve(4 * 1024);\n        }\n\n        \/\/! returns the next element if one exists\n        \/\/!\n        \/\/! does no checks whether a next element exists!\n        const std::string & Next() {\n            stats_total_elements_++;\n            data_.clear();\n            while (true) {\n                while (current_ < buffer_.end()) {\n                    if (THRILL_UNLIKELY(*current_ == '\\n')) {\n                        current_++;\n                        return data_;\n                    }\n                    else {\n                        data_.push_back(*current_++);\n                    }\n                }\n                if (!ReadBlock(file_, buffer_)) {\n                    file_.close();\n                    current_file_++;\n                    offset_ = 0;\n\n                    if (current_file_ < NumFiles()) {\n                        file_ = core::SysFile::OpenForRead(files_[current_file_].first);\n                        ReadBlock(file_, buffer_);\n                    }\n                    else {\n                        current_ = buffer_.begin() +\n                                   files_[current_file_].second - files_[current_file_ - 1].second;\n                    }\n\n                    if (data_.length()) {\n                        return data_;\n                    }\n                }\n            }\n        }\n\n        \/\/! returns true, if an element is available in local part\n        bool HasNext() {\n            size_t global_index = offset_ + current_ - buffer_.begin() + files_[current_file_].second;\n            return global_index < my_end_ ||\n                   (global_index == my_end_ &&\n                    files_[current_file_ + 1].second - files_[current_file_].second >\n                    offset_ + (current_ - buffer_.begin()));\n        }\n\n        size_t NumFiles() {\n            return files_.size() - 1;\n        }\n\n    private:\n        \/\/! Offset of current block in file_.\n        size_t offset_ = 0;\n        \/\/! File handle to files_[current_file_]\n        core::SysFile file_;\n    };\n\n    \/\/! InputLineIterator gives you access to lines of a file\n    class InputLineIteratorCompressed : public InputLineIterator\n    {\n    public:\n        \/\/! Creates an instance of iterator that reads file line based\n        InputLineIteratorCompressed(\n            const std::vector<FileSizePair>& files,\n            Context& ctx)\n            : InputLineIterator(files, ctx) {\n\n            \/\/ Go to start of 'local part'.\n            size_t my_start;\n            std::tie(my_start, my_end_) =\n                common::CalculateLocalRange(files[NumFiles()].second, ctx.num_workers(), ctx.my_rank());\n\n            while (files_[current_file_ + 1].second <= my_start) {\n                current_file_++;\n            }\n\n            for (size_t file_nr = current_file_; file_nr < NumFiles(); file_nr++) {\n                if (files[file_nr + 1].second == my_end_) {\n                    break;\n                }\n                if (files[file_nr + 1].second > my_end_) {\n                    my_end_ = files_[file_nr].second;\n                    break;\n                }\n            }\n\n            if (my_start < my_end_) {\n                LOG << \"Opening file \" << current_file_;\n                LOG << \"my_start : \" << my_start << \" my_end_: \" << my_end_;\n                file_ = core::SysFile::OpenForRead(files_[current_file_].first);\n            }\n            else {\n                \/\/ No local files, set buffer size to 2, so HasNext() does not try to read\n                LOG << \"my_start : \" << my_start << \" my_end_: \" << my_end_;\n                buffer_.Reserve(2);\n                buffer_.set_size(2);\n                current_ = buffer_.begin();\n                return;\n            }\n            buffer_.Reserve(read_size);\n            ReadBlock(file_, buffer_);\n            data_.reserve(4 * 1024);\n        }\n\n        \/\/! returns the next element if one exists\n        \/\/!\n        \/\/! does no checks whether a next element exists!\n        const std::string & Next() {\n            stats_total_elements_++;\n            data_.clear();\n            while (true) {\n                while (current_ < buffer_.end()) {\n                    if (THRILL_UNLIKELY(*current_ == '\\n')) {\n                        current_++;\n                        return data_;\n                    }\n                    else {\n                        data_.push_back(*current_++);\n                    }\n                }\n\n                if (!ReadBlock(file_, buffer_)) {\n                    LOG << \"Opening new file!\";\n                    file_.close();\n                    current_file_++;\n\n                    if (current_file_ < NumFiles()) {\n                        file_ = core::SysFile::OpenForRead(files_[current_file_].first);\n                        ReadBlock(file_, buffer_);\n                    }\n                    else {\n                        LOG << \"reached last file\";\n                        current_ = buffer_.begin();\n                    }\n\n                    if (data_.length()) {\n                        LOG << \"end - returning string of length\" << data_.length();\n                        return data_;\n                    }\n                }\n            }\n        }\n\n        size_t NumFiles() {\n            return files_.size() - 1;\n        }\n\n        \/\/! returns true, if an element is available in local part\n        bool HasNext() {\n            if (files_[current_file_].second >= my_end_) {\n                return false;\n            }\n\n            \/\/ if block is fully read, read next block. needs to be done here\n            \/\/ as HasNext() has to know if file is finished\n            \/\/         v-- no new line at end ||   v-- newline at end of file\n            if (current_ >= buffer_.end() || (current_ + 1 >= buffer_.end() && *current_ == '\\n')) {\n                LOG << \"New buffer in HasNext()\";\n                ReadBlock(file_, buffer_);\n                if (buffer_.size() > 1 || (buffer_.size() == 1 && buffer_[0] != '\\n')) {\n                    return true;\n                }\n                else {\n                    LOG << \"Opening new file in HasNext()\";\n                    \/\/ already at last file\n                    if (current_file_ >= NumFiles() - 1) {\n                        return false;\n                    }\n                    file_.close();\n                    \/\/ if (this worker reads at least one more file)\n                    if (my_end_ > files_[current_file_ + 1].second) {\n                        current_file_++;\n                        file_ = core::SysFile::OpenForRead(files_[current_file_].first);\n                        ReadBlock(file_, buffer_);\n                        return true;\n                    }\n                    else {\n                        return false;\n                    }\n                }\n            }\n            else {\n                return true;\n            }\n        }\n\n    private:\n        \/\/! File handle to files_[current_file_]\n        core::SysFile file_;\n    };\n};\n\nDIARef<std::string> ReadLines(Context& ctx, std::string filepath) {\n\n    StatsNode* stats_node = ctx.stats_graph().AddNode(\n        \"ReadLines\", DIANodeType::DOP);\n\n    auto shared_node =\n        std::make_shared<ReadLinesNode>(\n            ctx, filepath, stats_node);\n\n    auto read_stack = shared_node->ProduceStack();\n\n    return DIARef<std::string, decltype(read_stack)>(\n        shared_node, read_stack, { stats_node });\n}\n\n\/\/! \\}\n\n} \/\/ namespace api\n} \/\/ namespace thrill\n\n#endif \/\/ !THRILL_API_READ_LINES_HEADER\n\n\/******************************************************************************\/\n<commit_msg>fix non-compressed read<commit_after>\/*******************************************************************************\n * thrill\/api\/read_lines.hpp\n *\n * Part of Project Thrill.\n *\n * Copyright (C) 2015 Alexander Noe <aleexnoe@gmail.com>\n * Copyright (C) 2015 Timo Bingmann <tb@panthema.net>\n *\n * This file has no license. Only Chuck Norris can compile it.\n ******************************************************************************\/\n\n#pragma once\n#ifndef THRILL_API_READ_LINES_HEADER\n#define THRILL_API_READ_LINES_HEADER\n\n#include <thrill\/api\/dia.hpp>\n#include <thrill\/api\/source_node.hpp>\n#include <thrill\/common\/defines.hpp>\n#include <thrill\/common\/logger.hpp>\n#include <thrill\/common\/math.hpp>\n#include <thrill\/common\/stat_logger.hpp>\n#include <thrill\/common\/string.hpp>\n#include <thrill\/common\/system_exception.hpp>\n#include <thrill\/core\/file_io.hpp>\n#include <thrill\/net\/buffer_builder.hpp>\n\n#include <string>\n#include <utility>\n#include <vector>\n\nnamespace thrill {\nnamespace api {\n\n\/\/! \\addtogroup api Interface\n\/\/! \\{\n\n\/*!\n * A DIANode which performs a line-based Read operation. Read reads a file from\n * the file system and emits it as a DIA.\n *\/\nclass ReadLinesNode : public SourceNode<std::string>\n{\npublic:\n    using Super = SourceNode<std::string>;\n    using Super::context_;\n\n    using FileSizePair = std::pair<std::string, size_t>;\n\n    static const bool debug = false;\n\n    \/*!\n     * Constructor for a ReadLinesNode. Sets the Context\n     * and file path.\n     *\n     * \\param ctx Reference to Context, which holds references to data and\n     * network.\n     *\n     * \\param path Path of the input file(s)\n     *\/\n    ReadLinesNode(Context& ctx,\n                  const std::string& path,\n                  StatsNode* stats_node)\n        : Super(ctx, { }, stats_node),\n          path_(path)\n    {\n        LOG << \"Opening read notes for \" << path_;\n\n        filesize_prefix_ = core::GlobFileSizePrefixSum(path_);\n\n        for (auto file : filesize_prefix_) {\n            if (core::IsCompressed(file.first)) {\n                contains_compressed_file_ = true;\n                break;\n            }\n        }\n    }\n\n    void PushData(bool \/* consume *\/) final {\n        if (contains_compressed_file_) {\n            InputLineIteratorCompressed it = InputLineIteratorCompressed(\n                filesize_prefix_, context_);\n\n            \/\/ Hook Read\n            while (it.HasNext()) {\n                this->PushItem(it.Next());\n            }\n        }\n        else {\n            InputLineIteratorUncompressed it = InputLineIteratorUncompressed(\n                filesize_prefix_, context_);\n\n            \/\/ Hook Read\n            while (it.HasNext()) {\n                this->PushItem(it.Next());\n            }\n        }\n    }\n\n    void Dispose() final { }\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        return FunctionStack<std::string>();\n    }\n\nprivate:\n    \/\/! True, if at least one input file is compressed.\n    bool contains_compressed_file_ = false;\n    \/\/! Path of the input file.\n    std::string path_;\n\n    std::vector<std::pair<std::string, size_t> > filesize_prefix_;\n\n    class InputLineIterator\n    {\n    public:\n        InputLineIterator(const std::vector<FileSizePair>& files, Context& ctx)\n            : files_(files), context_(ctx) { }\n\n        static const bool debug = false;\n\n    protected:\n        \/\/! Block read size\n        const size_t read_size = data::default_block_size;\n        \/\/! String, which Next() references to\n        std::string data_;\n        \/\/! Input files with size prefixsum.\n        const std::vector<FileSizePair>& files_;\n        \/\/! Index of current file in files_\n        size_t current_file_ = 0;\n        \/\/! Byte buffer to create line-std::strings\n        net::BufferBuilder buffer_;\n        \/\/! Start of next element in current buffer.\n        unsigned char* current_;\n        \/\/! (exclusive) end of local block\n        size_t my_end_;\n\t\t\/\/! Reference to context\n\t\tContext& context_;\n\n\t\tsize_t stats_total_bytes_ = 0;\n\t\tsize_t stats_total_reads_ = 0;\n\t\tsize_t stats_total_elements_ = 0;\n\n\t\tbool ReadBlock(core::SysFile& file, net::BufferBuilder& buffer) {\n\t\t\tssize_t bytes = file.read(buffer.data(), read_size);\n\t\t\tif(bytes < 0) {\n\t\t\t\tthrow common::SystemException(\"Read error\", errno);\n\t\t\t}\n\t\t\tbuffer.set_size(bytes);\n\t\t\tcurrent_ = buffer.begin();\n\t\t\tstats_total_bytes_ += bytes;\n\t\t\tstats_total_reads_++;\n\t\t\tLOG << \"Opening block with \" << bytes << \" bytes.\";\n\t\t\treturn bytes > 0;\n\t\t}\n\n        ~InputLineIterator() {\n            STAT(context_) << \"NodeType\" << \"ReadLines\"\n                           << \"TotalBytes\" << stats_total_bytes_\n                           << \"TotalReads\" << stats_total_reads_\n                           << \"TotalLines\" << stats_total_elements_;\n        }\n    };\n\n    \/\/! InputLineIterator gives you access to lines of a file\n    class InputLineIteratorUncompressed : public InputLineIterator\n    {\n    public:\n        \/\/! Creates an instance of iterator that reads file line based\n        InputLineIteratorUncompressed(\n            const std::vector<FileSizePair>& files,\n            Context& ctx)\n            : InputLineIterator(files, ctx) {\n\n            \/\/ Go to start of 'local part'.\n            size_t my_start;\n            std::tie(my_start, my_end_) =\n                common::CalculateLocalRange(files[NumFiles()].second, ctx.num_workers(), ctx.my_rank());\n\n            while (files_[current_file_ + 1].second <= my_start) {\n                current_file_++;\n            }\n            if (my_start < my_end_) {\n                LOG << \"Opening file \" << current_file_;\n                file_ = core::SysFile::OpenForRead(files_[current_file_].first);\n            }\n            else {\n                LOG << \"my_start : \" << my_start << \" my_end_: \" << my_end_;\n                return;\n            }\n\n            \/\/ find offset in current file:\n            \/\/ offset = start - sum of previous file sizes\n            offset_ = file_.lseek(my_start - files_[current_file_].second);\n            buffer_.Reserve(read_size);\n            ReadBlock(file_, buffer_);\n\n            if (offset_ != 0) {\n                bool found_n = false;\n\n                \/\/ find next newline, discard all previous data as previous worker already covers it\n                while (!found_n) {\n                    while (current_ < buffer_.end()) {\n                        if (THRILL_UNLIKELY(*current_++ == '\\n')) {\n                            found_n = true;\n                            break;\n                        }\n                    }\n                    \/\/ no newline found: read new data into buffer_builder\n                    if (!found_n) {\n                        offset_ += buffer_.size();\n                        if (!ReadBlock(file_, buffer_)) {\n                            \/\/ EOF = newline per definition\n                            found_n = true;\n                        }\n                    }\n                }\n            }\n            data_.reserve(4 * 1024);\n        }\n\n        \/\/! returns the next element if one exists\n        \/\/!\n        \/\/! does no checks whether a next element exists!\n        const std::string & Next() {\n            stats_total_elements_++;\n            data_.clear();\n            while (true) {\n                while (current_ < buffer_.end()) {\n                    if (THRILL_UNLIKELY(*current_ == '\\n')) {\n                        current_++;\n                        return data_;\n                    }\n                    else {\n                        data_.push_back(*current_++);\n                    }\n                }\n\t\t\t\toffset_ += buffer_.size();\n                if (!ReadBlock(file_, buffer_)) {\n\t\t\t\t\tLOG << \"opening next file\";\n\n                    file_.close();\n                    current_file_++;\n                    offset_ = 0;\n\n                    if (current_file_ < NumFiles()) {\n                        file_ = core::SysFile::OpenForRead(files_[current_file_].first);\n\t\t\t\t\t\toffset_ += buffer_.size();\n                        ReadBlock(file_, buffer_);\n                    }\n                    else {\n                        current_ = buffer_.begin() +\n                                   files_[current_file_].second - files_[current_file_ - 1].second;\n                    }\n\n                    if (data_.length()) {\n                        return data_;\n                    }\n                }\n            }\n        }\n\n        \/\/! returns true, if an element is available in local part\n        bool HasNext() {\n\t\t\tsize_t position_in_buf = current_ - buffer_.begin(); \n\t\t\tassert(current_ >= buffer_.begin());\n            size_t global_index = offset_ + position_in_buf + files_[current_file_].second;\n            return global_index < my_end_ ||\n                   (global_index == my_end_ &&\n                    files_[current_file_ + 1].second - files_[current_file_].second >\n                    offset_ + position_in_buf);\n        }\n\n        size_t NumFiles() {\n            return files_.size() - 1;\n        }\n\n    private:\n        \/\/! Offset of current block in file_.\n        size_t offset_ = 0;\n        \/\/! File handle to files_[current_file_]\n        core::SysFile file_;\n    };\n\n    \/\/! InputLineIterator gives you access to lines of a file\n    class InputLineIteratorCompressed : public InputLineIterator\n    {\n    public:\n        \/\/! Creates an instance of iterator that reads file line based\n        InputLineIteratorCompressed(\n            const std::vector<FileSizePair>& files,\n            Context& ctx)\n            : InputLineIterator(files, ctx) {\n\n            \/\/ Go to start of 'local part'.\n            size_t my_start;\n            std::tie(my_start, my_end_) =\n                common::CalculateLocalRange(files[NumFiles()].second, ctx.num_workers(), ctx.my_rank());\n\n            while (files_[current_file_ + 1].second <= my_start) {\n                current_file_++;\n            }\n\n            for (size_t file_nr = current_file_; file_nr < NumFiles(); file_nr++) {\n                if (files[file_nr + 1].second == my_end_) {\n                    break;\n                }\n                if (files[file_nr + 1].second > my_end_) {\n                    my_end_ = files_[file_nr].second;\n                    break;\n                }\n            }\n\n            if (my_start < my_end_) {\n                LOG << \"Opening file \" << current_file_;\n                LOG << \"my_start : \" << my_start << \" my_end_: \" << my_end_;\n                file_ = core::SysFile::OpenForRead(files_[current_file_].first);\n            }\n            else {\n                \/\/ No local files, set buffer size to 2, so HasNext() does not try to read\n                LOG << \"my_start : \" << my_start << \" my_end_: \" << my_end_;\n                buffer_.Reserve(2);\n                buffer_.set_size(2);\n                current_ = buffer_.begin();\n                return;\n            }\n            buffer_.Reserve(read_size);\n            ReadBlock(file_, buffer_);\n            data_.reserve(4 * 1024);\n        }\n\n        \/\/! returns the next element if one exists\n        \/\/!\n        \/\/! does no checks whether a next element exists!\n        const std::string & Next() {\n            stats_total_elements_++;\n            data_.clear();\n            while (true) {\n                while (current_ < buffer_.end()) {\n                    if (THRILL_UNLIKELY(*current_ == '\\n')) {\n                        current_++;\n                        return data_;\n                    }\n                    else {\n                        data_.push_back(*current_++);\n                    }\n                }\n\n                if (!ReadBlock(file_, buffer_)) {\n                    LOG << \"Opening new file!\";\n                    file_.close();\n                    current_file_++;\n\n                    if (current_file_ < NumFiles()) {\n                        file_ = core::SysFile::OpenForRead(files_[current_file_].first);\n                        ReadBlock(file_, buffer_);\n                    }\n                    else {\n                        LOG << \"reached last file\";\n                        current_ = buffer_.begin();\n                    }\n\n                    if (data_.length()) {\n                        LOG << \"end - returning string of length\" << data_.length();\n                        return data_;\n                    }\n                }\n            }\n        }\n\n        size_t NumFiles() {\n            return files_.size() - 1;\n        }\n\n        \/\/! returns true, if an element is available in local part\n        bool HasNext() {\n            if (files_[current_file_].second >= my_end_) {\n                return false;\n            }\n\n            \/\/ if block is fully read, read next block. needs to be done here\n            \/\/ as HasNext() has to know if file is finished\n            \/\/         v-- no new line at end ||   v-- newline at end of file\n            if (current_ >= buffer_.end() || (current_ + 1 >= buffer_.end() && *current_ == '\\n')) {\n                LOG << \"New buffer in HasNext()\";\n                ReadBlock(file_, buffer_);\n                if (buffer_.size() > 1 || (buffer_.size() == 1 && buffer_[0] != '\\n')) {\n                    return true;\n                }\n                else {\n                    LOG << \"Opening new file in HasNext()\";\n                    \/\/ already at last file\n                    if (current_file_ >= NumFiles() - 1) {\n                        return false;\n                    }\n                    file_.close();\n                    \/\/ if (this worker reads at least one more file)\n                    if (my_end_ > files_[current_file_ + 1].second) {\n                        current_file_++;\n                        file_ = core::SysFile::OpenForRead(files_[current_file_].first);\n                        ReadBlock(file_, buffer_);\n                        return true;\n                    }\n                    else {\n                        return false;\n                    }\n                }\n            }\n            else {\n                return true;\n            }\n        }\n\n    private:\n        \/\/! File handle to files_[current_file_]\n        core::SysFile file_;\n    };\n};\n\nDIARef<std::string> ReadLines(Context& ctx, std::string filepath) {\n\n    StatsNode* stats_node = ctx.stats_graph().AddNode(\n        \"ReadLines\", DIANodeType::DOP);\n\n    auto shared_node =\n        std::make_shared<ReadLinesNode>(\n            ctx, filepath, stats_node);\n\n    auto read_stack = shared_node->ProduceStack();\n\n    return DIARef<std::string, decltype(read_stack)>(\n        shared_node, read_stack, { stats_node });\n}\n\n\/\/! \\}\n\n} \/\/ namespace api\n} \/\/ namespace thrill\n\n#endif \/\/ !THRILL_API_READ_LINES_HEADER\n\n\/******************************************************************************\/\n<|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 \"medViewContainer.h\"\n#include \"medViewContainer_p.h\"\n#include \"medViewPool.h\"\n#include <medDataManager.h>\n#include <medViewManager.h>\n#include <medAbstractView.h>\n#include <medDataIndex.h>\n\n#include <QtGui>\n\n#include <dtkCore\/dtkAbstractViewFactory.h>\n#include <dtkCore\/dtkAbstractView.h>\n#include <medAbstractData.h>\n\n\nmedViewContainer::medViewContainer ( QWidget *parent )\n        : QFrame ( parent )\n        , d ( new medViewContainerPrivate )\n{\n    d->layout = new QGridLayout ( this );\n    d->layout->setContentsMargins ( 0, 0, 0, 0 );\n    d->layout->setSpacing ( 0 );\n\n    d->view = NULL;\n    d->current = this;\n    d->selected = false;\n    d->multiLayer = true;\n\n    d->pool = new medViewPool ( this );\n\n    medViewContainer *container = qobject_cast<medViewContainer *>(parent);\n    if ( container != NULL ) {\n        connect(this,      SIGNAL(imageSet(const medDataIndex&)),\n                container, SIGNAL(imageSet(const medDataIndex&)));\n        connect(this,      SIGNAL(focused(dtkAbstractView*)),\n                container, SIGNAL(focused(dtkAbstractView*)));\n    }\n\n    this->setAcceptDrops ( true );\n    this->setFocusPolicy ( Qt::ClickFocus );\n    this->setMouseTracking ( true );\n    this->setSizePolicy ( QSizePolicy::Expanding,QSizePolicy::Expanding );\n\n}\n\nmedViewContainer::~medViewContainer()\n{\n    if ( d->view )\n    {\n        d->view->close();\n    }\n\n    delete d;\n\n    d = NULL;\n}\n\n\nconst medViewContainer *medViewContainer::current() const\n{\n    const medViewContainer * root = this->root();\n    if ( root != this )\n        return root->current();\n\n    return d->current;\n}\n\nmedViewContainer *medViewContainer::current()\n{\n    medViewContainer * root = this->root();\n    if ( root != this )\n        return root->current();\n\n    return d->current;\n}\n\nbool medViewContainer::isSelected() const\n{\n    return d->selected;\n}\n\nbool medViewContainer::isCurrent() const\n{\n    return const_cast< medViewContainer * > ( this )->current() == this;\n}\n\nbool medViewContainer::isRoot() const\n{\n    return this->parentContainer() == NULL;\n}\n\nbool medViewContainer::isLeaf() const\n{\n    return false;\n}\n\nbool medViewContainer::isEmpty() const\n{\n    return ( this->view() == NULL &&\n             this->childContainers().isEmpty());\n}\n\nmedViewContainer * medViewContainer::parentContainer() const\n{\n    return qobject_cast< medViewContainer * >( this->parentWidget() );\n}\n\nconst medViewContainer * medViewContainer::root() const\n{\n    const medViewContainer * parent = this->parentContainer();\n    return ( parent != NULL ? parent->root() : this );\n}\n\nmedViewContainer * medViewContainer::root()\n{\n    medViewContainer * parent = this->parentContainer();\n    return ( parent != NULL ? parent->root() : this );\n}\n\nQList< medViewContainer * > medViewContainer::childContainers() const\n{\n    QList< medViewContainer * > containers;\n    foreach ( QObject * child, this->children() ) {\n        medViewContainer * c = qobject_cast<medViewContainer *>( child );\n        if ( c != NULL ) {\n            containers << c;\n            containers << c->childContainers();\n        }\n    }\n\n    return containers;\n}\n\nQList< medViewContainer * > medViewContainer::leaves ( bool excludeEmpty )\n{\n    QList< medViewContainer * > leaves;\n    if ( this->isLeaf() )\n    {\n        if ( ! ( excludeEmpty && this->isEmpty() ) )\n            leaves << this;\n    }\n    else                   \/\/ a leaf doesn't contain another container\n        foreach ( medViewContainer * child, this->childContainers() )\n        leaves << child->leaves ( excludeEmpty );\n\n    return leaves;\n}\n\nvoid medViewContainer::split ( int rows, int cols )\n{\n    Q_UNUSED ( rows );\n    Q_UNUSED ( cols );\n}\n\ndtkAbstractView *medViewContainer::view() const\n{\n    return d->view;\n}\n\nQList<dtkAbstractView *> medViewContainer::views() const\n{\n    QList<dtkAbstractView *> views;\n    if ( d->view )\n        views << d->view;\n\n    return views;\n}\n\nmedViewPool *medViewContainer::pool()\n{\n    return d->pool;\n}\n\nvoid medViewContainer::setView ( dtkAbstractView *view )\n{\n    if (!isLeaf())\n    {\n        \/\/go down to the actual currently selected container to set the view.\n        current()->setView(view);\n        return;\n    }\n    if (view==d->view)\n        return;\n\n    \/\/ clear connection of previous view\n    if ( d->view )\n    {\n        \/\/ disconnect all conenctions from this class to the view\n        disconnect ( view, 0, this, 0 );\n        d->view->close();\n        d->view = 0;\n    }\n\n    d->view = view;\n\n    if ( d->view )\n    {\n        \/\/ pass properties to the view\n        QHash<QString,QString>::iterator it = d->viewProperties.begin();\n        while ( it!=d->viewProperties.end() )\n        {\n            view->setProperty ( it.key(), it.value() );\n            ++it;\n        }\n        medAbstractView * medView = qobject_cast<medAbstractView*>(view);\n        if (medView) {\n            connect(medView, SIGNAL(selected()), this, SLOT(select()));\n        }\n        this->recomputeStyleSheet();\n    }\n    setFocus(Qt::MouseFocusReason);\n}\n\nvoid medViewContainer::select()\n{\n    d->selected = true;\n\n    this->setCurrent ( this );\n\n    if (!current() || !current()->view())\n    {\n        \/\/focusing on an empty container, reset the toolboxes.\n        emit focused(NULL);\n        return;\n    }\n\n    if (dtkAbstractView *view = current()->view())\n    {\n        emit focused(view);\n    }\n\n    this->update();\n\n    this->recomputeStyleSheet();\n    emit selected();\n}\n\nvoid medViewContainer::unselect()\n{\n    d->selected = false;\n    this->recomputeStyleSheet();\n}\n\nvoid medViewContainer::setCurrent ( medViewContainer *container )\n{\n    medViewContainer * parent =\n        qobject_cast<medViewContainer *>( this->parentWidget() );\n    if ( parent != NULL )\n        parent->setCurrent ( container );\n    else\n        d->current = container;\n\n}\n\nvoid medViewContainer::recomputeStyleSheet()\n{\n    this->style()->unpolish(this);\n    this->style()->polish(this);\n}\n\nvoid medViewContainer::dragEnterEvent ( QDragEnterEvent *event )\n{\n    event->acceptProposedAction();\n}\n\nvoid medViewContainer::dragMoveEvent ( QDragMoveEvent *event )\n{\n    event->acceptProposedAction();\n}\n\nvoid medViewContainer::dragLeaveEvent ( QDragLeaveEvent *event )\n{\n    event->accept();\n}\n\nvoid medViewContainer::dropEvent ( QDropEvent *event )\n{\n    const QMimeData *mimeData = event->mimeData();\n\n    medDataIndex index = medDataIndex::readMimeData ( mimeData );\n    if ( index.isValid() )\n    {\n        open ( index );\n    }\n\n    event->acceptProposedAction();\n      \n}\n\nvoid medViewContainer::focusInEvent ( QFocusEvent *event )\n{\n    Q_UNUSED ( event );\n\n    this->select();\n}\n\nvoid medViewContainer::focusOutEvent ( QFocusEvent *event )\n{\n    Q_UNUSED(event);\n}\n\nvoid medViewContainer::paintEvent ( QPaintEvent *event )\n{\n    if ( this->layout()->count() > 1 )\n        return;\n\n    QPainter painter;\n    painter.begin ( this );\n\n    if ( !this->view() && ( d->viewProperties.count() ||\n                            !d->viewInfo.isEmpty() ) )\n    {\n        painter.setPen ( Qt::white );\n        QFont font = painter.font();\n        font.setPointSize ( 18 );\n        painter.setFont ( font );\n        QString text;\n\n        \/\/Add View Info:\n        if ( !d->viewInfo.isEmpty() )\n            \/\/    Debug()<< \"viewInfo\" << d->viewInfo;\n            text += d->viewInfo + \"\\n\";\n\n        QList<QString> keys = d->viewProperties.keys();\n        foreach ( QString key, keys )\n        text += d->viewProperties[key] + \"\\n\";\n        painter.drawText ( event->rect(), Qt::AlignCenter, text );\n    }\n\n    painter.end();\n}\n\nvoid medViewContainer::setViewProperty ( const QString &key, const QString &value )\n{\n    d->viewProperties[key] = value;\n}\n\nQString medViewContainer::viewProperty ( const QString &key ) const\n{\n    if ( d->viewProperties.contains ( key ) )\n        return d->viewProperties[key];\n\n    return QString();\n}\n\nvoid medViewContainer::onViewFullScreen ( bool value )\n{\n    Q_UNUSED ( value );\n}\n\nvoid medViewContainer::setInfo ( const QString& info )\n{\n    d->viewInfo = info;\n}\n\nQString medViewContainer::info()\n{\n    return d->viewInfo;\n}\n\nvoid medViewContainer::setMultiLayer(bool enable)\n{\n    d->multiLayer = enable;\n}\n\nbool medViewContainer::multiLayer( void )\n{\n    return d->multiLayer;\n}\n\nbool medViewContainer::open(const medDataIndex& index)\n{\n    bool res = false;\n\n    if(!index.isValid())\n        return res;\n\n    if( this != this->current() )\n    {\n        \/\/ opening should be done by current container\n        res = this->current()->open(index);\n        return res;\n    }\n\n    if(!this->acceptDrops())\n        return res;\n\n    if( index.isValidForSeries() )\n    {\n        dtkSmartPointer<medAbstractData> data;\n\n        data = medDataManager::instance()->data(index);\n\n        res = this->open(data);\n\n        if(res)\n        {\n            \/\/ add the view to the viewManager\n            dtkSmartPointer<medAbstractView> view = qobject_cast<medAbstractView*>(this->view());\n            medViewManager::instance()->insert(index, view);\n        }\n\n        emit imageSet(index);\n\n    }\n    return res;\n\n}\n\nbool medViewContainer::open(medAbstractData * data)\n{\n    if ( data == NULL )\n        return false;\n\n    dtkSmartPointer<medAbstractView> view = qobject_cast<medAbstractView*>(this->view());\n    bool newView = view.isNull() || !this->multiLayer();\n\n    if( newView)\n    {\n        \/\/container empty, or multi with no extendable view\n        view = qobject_cast<medAbstractView*>(dtkAbstractViewFactory::instance()->createSmartPointer(\"medVtkView\"));\n        connect (this, SIGNAL(sliceSelected(int)), view, SLOT(setSlider(int)));\n    }\n\n    if( view.isNull() )\n    {\n        qWarning() << \"medViewContainer: Unable to create a v3dView\";\n        return false;\n    }\n\n    \/\/ set the data to the view\n    if (!this->multiLayer())\n    {\n        view->removeOverlay(0);\n        view->setSharedDataPointer(data,0);\n        newView = true;\n    }\n    else\n    {\n        view->setSharedDataPointer(data);\n    }\n\n    \/\/only call reset if the view is a new one or with only one layer.\n    if (newView)\n    {\n        this->setView(view);\n        qDebug() << \"medViewContainer: Reset view\";\n        view->reset();\n    }\n    else\n    {\n        \/\/ in order to update the toolboxes, when a new data type has been added for example\n        setFocus(Qt::MouseFocusReason);\n    }\n\n    view->update();\n\n    return true;\n}\n<commit_msg>Cleanup in medViewPool<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 \"medViewContainer.h\"\n#include \"medViewContainer_p.h\"\n#include \"medViewPool.h\"\n#include <medDataManager.h>\n#include <medViewManager.h>\n#include <medAbstractView.h>\n#include <medDataIndex.h>\n\n#include <QtGui>\n\n#include <dtkCore\/dtkAbstractViewFactory.h>\n#include <dtkCore\/dtkAbstractView.h>\n#include <medAbstractData.h>\n\n\nmedViewContainer::medViewContainer ( QWidget *parent )\n        : QFrame ( parent )\n        , d ( new medViewContainerPrivate )\n{\n    d->layout = new QGridLayout ( this );\n    d->layout->setContentsMargins ( 0, 0, 0, 0 );\n    d->layout->setSpacing ( 0 );\n\n    d->view = NULL;\n    d->current = this;\n    d->selected = false;\n    d->multiLayer = true;\n\n    d->pool = new medViewPool ( this );\n\n    medViewContainer *container = qobject_cast<medViewContainer *>(parent);\n    if ( container != NULL ) {\n        connect(this,      SIGNAL(imageSet(const medDataIndex&)),\n                container, SIGNAL(imageSet(const medDataIndex&)));\n        connect(this,      SIGNAL(focused(dtkAbstractView*)),\n                container, SIGNAL(focused(dtkAbstractView*)));\n    }\n\n    this->setAcceptDrops ( true );\n    this->setFocusPolicy ( Qt::ClickFocus );\n    this->setMouseTracking ( true );\n    this->setSizePolicy ( QSizePolicy::Expanding,QSizePolicy::Expanding );\n\n}\n\nmedViewContainer::~medViewContainer()\n{\n    if ( d->view )\n    {\n        d->view->close();\n    }\n\n    delete d;\n\n    d = NULL;\n}\n\n\nconst medViewContainer *medViewContainer::current() const\n{\n    const medViewContainer * root = this->root();\n    if ( root != this )\n        return root->current();\n\n    return d->current;\n}\n\nmedViewContainer *medViewContainer::current()\n{\n    medViewContainer * root = this->root();\n    if ( root != this )\n        return root->current();\n\n    return d->current;\n}\n\nbool medViewContainer::isSelected() const\n{\n    return d->selected;\n}\n\nbool medViewContainer::isCurrent() const\n{\n    return const_cast< medViewContainer * > ( this )->current() == this;\n}\n\nbool medViewContainer::isRoot() const\n{\n    return this->parentContainer() == NULL;\n}\n\nbool medViewContainer::isLeaf() const\n{\n    return false;\n}\n\nbool medViewContainer::isEmpty() const\n{\n    return ( this->view() == NULL &&\n             this->childContainers().isEmpty());\n}\n\nbool medViewContainer::isDaddy() const\n{\n    return ( this->view() != NULL &&\n             this->view()->property ( \"Daddy\" ) == \"true\" );\n}\n\nmedViewContainer * medViewContainer::parentContainer() const\n{\n    return qobject_cast< medViewContainer * >( this->parentWidget() );\n}\n\nconst medViewContainer * medViewContainer::root() const\n{\n    const medViewContainer * parent = this->parentContainer();\n    return ( parent != NULL ? parent->root() : this );\n}\n\nmedViewContainer * medViewContainer::root()\n{\n    medViewContainer * parent = this->parentContainer();\n    return ( parent != NULL ? parent->root() : this );\n}\n\nQList< medViewContainer * > medViewContainer::childContainers() const\n{\n    QList< medViewContainer * > containers;\n    foreach ( QObject * child, this->children() ) {\n        medViewContainer * c = qobject_cast<medViewContainer *>( child );\n        if ( c != NULL ) {\n            containers << c;\n            containers << c->childContainers();\n        }\n    }\n\n    return containers;\n}\n\nQList< medViewContainer * > medViewContainer::leaves ( bool excludeEmpty )\n{\n    QList< medViewContainer * > leaves;\n    if ( this->isLeaf() )\n    {\n        if ( ! ( excludeEmpty && this->isEmpty() ) )\n            leaves << this;\n    }\n    else                   \/\/ a leaf doesn't contain another container\n        foreach ( medViewContainer * child, this->childContainers() )\n        leaves << child->leaves ( excludeEmpty );\n\n    return leaves;\n}\n\nvoid medViewContainer::split ( int rows, int cols )\n{\n    Q_UNUSED ( rows );\n    Q_UNUSED ( cols );\n}\n\ndtkAbstractView *medViewContainer::view() const\n{\n    return d->view;\n}\n\nQList<dtkAbstractView *> medViewContainer::views() const\n{\n    QList<dtkAbstractView *> views;\n    if ( d->view )\n        views << d->view;\n\n    return views;\n}\n\nmedViewPool *medViewContainer::pool()\n{\n    return d->pool;\n}\n\nvoid medViewContainer::setView ( dtkAbstractView *view )\n{\n    if (!isLeaf())\n    {\n        \/\/go down to the actual currently selected container to set the view.\n        current()->setView(view);\n        return;\n    }\n    if (view==d->view)\n        return;\n\n    \/\/ clear connection of previous view\n    if ( d->view )\n    {\n        \/\/ disconnect all conenctions from this class to the view\n        disconnect ( view, 0, this, 0 );\n        d->view->close();\n        d->view = 0;\n    }\n\n    d->view = view;\n\n    if ( d->view )\n    {\n        \/\/ pass properties to the view\n        QHash<QString,QString>::iterator it = d->viewProperties.begin();\n        while ( it!=d->viewProperties.end() )\n        {\n            view->setProperty ( it.key(), it.value() );\n            ++it;\n        }\n        medAbstractView * medView = qobject_cast<medAbstractView*>(view);\n        if (medView) {\n            connect(medView, SIGNAL(selected()), this, SLOT(select()));\n        }\n        this->recomputeStyleSheet();\n    }\n    setFocus(Qt::MouseFocusReason);\n}\n\nvoid medViewContainer::select()\n{\n    d->selected = true;\n\n    this->setCurrent ( this );\n\n    if (!current() || !current()->view())\n    {\n        \/\/focusing on an empty container, reset the toolboxes.\n        emit focused(NULL);\n        return;\n    }\n\n    if (dtkAbstractView *view = current()->view())\n    {\n        emit focused(view);\n    }\n\n    this->update();\n\n    this->recomputeStyleSheet();\n    emit selected();\n}\n\nvoid medViewContainer::unselect()\n{\n    d->selected = false;\n    this->recomputeStyleSheet();\n}\n\nvoid medViewContainer::setCurrent ( medViewContainer *container )\n{\n    medViewContainer * parent =\n        qobject_cast<medViewContainer *>( this->parentWidget() );\n    if ( parent != NULL )\n        parent->setCurrent ( container );\n    else\n        d->current = container;\n\n}\n\nvoid medViewContainer::recomputeStyleSheet()\n{\n    this->style()->unpolish(this);\n    this->style()->polish(this);\n}\n\nvoid medViewContainer::dragEnterEvent ( QDragEnterEvent *event )\n{\n    event->acceptProposedAction();\n}\n\nvoid medViewContainer::dragMoveEvent ( QDragMoveEvent *event )\n{\n    event->acceptProposedAction();\n}\n\nvoid medViewContainer::dragLeaveEvent ( QDragLeaveEvent *event )\n{\n    event->accept();\n}\n\nvoid medViewContainer::dropEvent ( QDropEvent *event )\n{\n    const QMimeData *mimeData = event->mimeData();\n\n    medDataIndex index = medDataIndex::readMimeData ( mimeData );\n    if ( index.isValid() )\n    {\n        open ( index );\n    }\n\n    event->acceptProposedAction();\n      \n}\n\nvoid medViewContainer::focusInEvent ( QFocusEvent *event )\n{\n    Q_UNUSED ( event );\n\n    this->select();\n}\n\nvoid medViewContainer::focusOutEvent ( QFocusEvent *event )\n{\n    Q_UNUSED(event);\n}\n\nvoid medViewContainer::paintEvent ( QPaintEvent *event )\n{\n    if ( this->layout()->count() > 1 )\n        return;\n\n    QPainter painter;\n    painter.begin ( this );\n\n    if ( !this->view() && ( d->viewProperties.count() ||\n                            !d->viewInfo.isEmpty() ) )\n    {\n        painter.setPen ( Qt::white );\n        QFont font = painter.font();\n        font.setPointSize ( 18 );\n        painter.setFont ( font );\n        QString text;\n\n        \/\/Add View Info:\n        if ( !d->viewInfo.isEmpty() )\n            \/\/    Debug()<< \"viewInfo\" << d->viewInfo;\n            text += d->viewInfo + \"\\n\";\n\n        QList<QString> keys = d->viewProperties.keys();\n        foreach ( QString key, keys )\n        text += d->viewProperties[key] + \"\\n\";\n        painter.drawText ( event->rect(), Qt::AlignCenter, text );\n    }\n\n    painter.end();\n}\n\nvoid medViewContainer::setViewProperty ( const QString &key, const QString &value )\n{\n    d->viewProperties[key] = value;\n}\n\nQString medViewContainer::viewProperty ( const QString &key ) const\n{\n    if ( d->viewProperties.contains ( key ) )\n        return d->viewProperties[key];\n\n    return QString();\n}\n\nvoid medViewContainer::onViewFullScreen ( bool value )\n{\n    Q_UNUSED ( value );\n}\n\nvoid medViewContainer::setInfo ( const QString& info )\n{\n    d->viewInfo = info;\n}\n\nQString medViewContainer::info()\n{\n    return d->viewInfo;\n}\n\nvoid medViewContainer::setMultiLayer(bool enable)\n{\n    d->multiLayer = enable;\n}\n\nbool medViewContainer::multiLayer( void )\n{\n    return d->multiLayer;\n}\n\nbool medViewContainer::open(const medDataIndex& index)\n{\n    bool res = false;\n\n    if(!index.isValid())\n        return res;\n\n    if( this != this->current() )\n    {\n        \/\/ opening should be done by current container\n        res = this->current()->open(index);\n        return res;\n    }\n\n    if(!this->acceptDrops())\n        return res;\n\n    if( index.isValidForSeries() )\n    {\n        dtkSmartPointer<medAbstractData> data;\n\n        data = medDataManager::instance()->data(index);\n\n        res = this->open(data);\n\n        if(res)\n        {\n            \/\/ add the view to the viewManager\n            dtkSmartPointer<medAbstractView> view = qobject_cast<medAbstractView*>(this->view());\n            medViewManager::instance()->insert(index, view);\n        }\n\n        emit imageSet(index);\n\n    }\n    return res;\n\n}\n\nbool medViewContainer::open(medAbstractData * data)\n{\n    if ( data == NULL )\n        return false;\n\n    dtkSmartPointer<medAbstractView> view = qobject_cast<medAbstractView*>(this->view());\n    bool newView = view.isNull() || !this->multiLayer();\n\n    if( newView)\n    {\n        \/\/container empty, or multi with no extendable view\n        view = qobject_cast<medAbstractView*>(dtkAbstractViewFactory::instance()->createSmartPointer(\"medVtkView\"));\n        connect (this, SIGNAL(sliceSelected(int)), view, SLOT(setSlider(int)));\n    }\n\n    if( view.isNull() )\n    {\n        qWarning() << \"medViewContainer: Unable to create a v3dView\";\n        return false;\n    }\n\n    \/\/ set the data to the view\n    if (!this->multiLayer())\n    {\n        view->removeOverlay(0);\n        view->setSharedDataPointer(data,0);\n        newView = true;\n    }\n    else\n    {\n        view->setSharedDataPointer(data);\n    }\n\n    \/\/only call reset if the view is a new one or with only one layer.\n    if (newView)\n    {\n        this->setView(view);\n        qDebug() << \"medViewContainer: Reset view\";\n        view->reset();\n    }\n    else\n    {\n        \/\/ in order to update the toolboxes, when a new data type has been added for example\n        setFocus(Qt::MouseFocusReason);\n    }\n\n    view->update();\n\n    return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file one_hot_layer.hpp\n * @author Shangtong Zhang\n *\n * Definition of the OneHotLayer class, which implements a standard network\n * layer.\n *\/\n#ifndef __MLPACK_METHODS_ANN_LAYER_ONE_HOT_LAYER_HPP\n#define __MLPACK_METHODS_ANN_LAYER_ONE_HOT_LAYER_HPP\n\n#include <mlpack\/core.hpp>\n#include <mlpack\/methods\/ann\/layer\/layer_traits.hpp>\n\nnamespace mlpack {\nnamespace ann \/** Artificial Neural Network. *\/ {\n\n\/**\n * An implementation of a one hot classification layer that can be used as\n * output layer.\n *\/\nclass OneHotLayer\n{\n public:\n  \/**\n   * Create the OneHotLayer object.\n   *\/\n  OneHotLayer()\n  {\n    \/\/ Nothing to do here.\n  }\n\n  \/*\n   * Calculate the error using the specified input activation and the target.\n   * The error is stored into the given error parameter.\n   *\n   * @param inputActivations Input data used for evaluating the network.\n   * @param target Target data used for evaluating the network.\n   * @param error The calculated error with respect to the input activation and\n   * the given target.\n   *\/\n  template<typename DataType>\n  void CalculateError(const DataType& inputActivations,\n                      const DataType& target,\n                      DataType& error)\n  {\n    error = inputActivations - target;\n  }\n\n  \/*\n   * Calculate the output class using the specified input activation.\n   *\n   * @param inputActivations Input data used to calculate the output class.\n   * @param output Output class of the input activation.\n   *\/\n  template<typename DataType>\n  void OutputClass(const DataType& inputActivations, DataType& output)\n  {\n    output = inputActivations;\n    output.zeros();\n\n    arma::uword maxIndex;\n    inputActivations.max(maxIndex);\n    output(maxIndex) = 1;\n  }\n}; \/\/ class OneHotLayer\n\n\/\/! Layer traits for the one-hot class classification layer.\ntemplate <>\nclass LayerTraits<OneHotLayer>\n{\n public:\n  static const bool IsBinary = true;\n  static const bool IsOutputLayer = true;\n  static const bool IsBiasLayer = false;\n  static const bool IsConnection = false;\n};\n\n} \/\/ namespace ann\n} \/\/ namespace mlpack\n\n\n#endif\n<commit_msg>implement serialize<commit_after>\/**\n * @file one_hot_layer.hpp\n * @author Shangtong Zhang\n *\n * Definition of the OneHotLayer class, which implements a standard network\n * layer.\n *\/\n#ifndef __MLPACK_METHODS_ANN_LAYER_ONE_HOT_LAYER_HPP\n#define __MLPACK_METHODS_ANN_LAYER_ONE_HOT_LAYER_HPP\n\n#include <mlpack\/core.hpp>\n#include <mlpack\/methods\/ann\/layer\/layer_traits.hpp>\n\nnamespace mlpack {\nnamespace ann \/** Artificial Neural Network. *\/ {\n\n\/**\n * An implementation of a one hot classification layer that can be used as\n * output layer.\n *\/\nclass OneHotLayer\n{\n public:\n  \/**\n   * Create the OneHotLayer object.\n   *\/\n  OneHotLayer()\n  {\n    \/\/ Nothing to do here.\n  }\n\n  \/*\n   * Calculate the error using the specified input activation and the target.\n   * The error is stored into the given error parameter.\n   *\n   * @param inputActivations Input data used for evaluating the network.\n   * @param target Target data used for evaluating the network.\n   * @param error The calculated error with respect to the input activation and\n   * the given target.\n   *\/\n  template<typename DataType>\n  void CalculateError(const DataType& inputActivations,\n                      const DataType& target,\n                      DataType& error)\n  {\n    error = inputActivations - target;\n  }\n\n  \/*\n   * Calculate the output class using the specified input activation.\n   *\n   * @param inputActivations Input data used to calculate the output class.\n   * @param output Output class of the input activation.\n   *\/\n  template<typename DataType>\n  void OutputClass(const DataType& inputActivations, DataType& output)\n  {\n    output = inputActivations;\n    output.zeros();\n\n    arma::uword maxIndex;\n    inputActivations.max(maxIndex);\n    output(maxIndex) = 1;\n  }\n  \n  \/**\n   * Serialize the layer\n   *\/\n  template<typename Archive>\n  void Serialize(Archive& ar, const unsigned int \/* version *\/)\n  {    \t\t\t\t\n  }\n}; \/\/ class OneHotLayer\n\n\/\/! Layer traits for the one-hot class classification layer.\ntemplate <>\nclass LayerTraits<OneHotLayer>\n{\n public:\n  static const bool IsBinary = true;\n  static const bool IsOutputLayer = true;\n  static const bool IsBiasLayer = false;\n  static const bool IsConnection = false;\n};\n\n} \/\/ namespace ann\n} \/\/ namespace mlpack\n\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n *\n *   Copyright (c) 2017 PX4 Development Team. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n *    notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n *    notice, this list of conditions and the following disclaimer in\n *    the documentation and\/or other materials provided with the\n *    distribution.\n * 3. Neither the name PX4 nor the names of its contributors may be\n *    used to endorse or promote products derived from this software\n *    without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n ****************************************************************************\/\n\n\/**\n * @file tempcal_main.cpp\n * Implementation of the Temperature Calibration for onboard sensors.\n *\n * @author Siddharth Bharat Purohit\n *\/\n\n#include <px4_config.h>\n#include <px4_defines.h>\n#include <px4_tasks.h>\n#include <px4_posix.h>\n#include <px4_time.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <unistd.h>\n#include <fcntl.h>\n#include <errno.h>\n#include <math.h>\n#include <poll.h>\n#include <time.h>\n#include <float.h>\n#include <vector>\n#include <arch\/board\/board.h>\n#include <systemlib\/param\/param.h>\n#include <systemlib\/err.h>\n#include <systemlib\/systemlib.h>\n#include <mathlib\/mathlib.h>\n#include <mathlib\/math\/filter\/LowPassFilter2p.hpp>\n#include <platforms\/px4_defines.h>\n#include <drivers\/drv_hrt.h>\n#include <drivers\/drv_gyro.h>\n#include <controllib\/uorb\/blocks.hpp>\n\n#include <uORB\/topics\/sensor_gyro.h>\n#include \"polyfit.hpp\"\n#include \"temperature_calibration.h\"\n\n#define TC_PRINT_DEBUG 0\n#if TC_PRINT_DEBUG\n#define TC_DEBUG(fmt, ...) printf(fmt, ##__VA_ARGS__);\n#else\n#define TC_DEBUG(fmt, ...)\n#endif\n\n\n#define SENSOR_COUNT_MAX\t\t3\n\nextern \"C\" __EXPORT int tempcal_main(int argc, char *argv[]);\n\n\nclass Tempcal;\n\nnamespace tempcal\n{\nTempcal *instance = nullptr;\n}\n\n\nclass Tempcal : public control::SuperBlock\n{\npublic:\n\t\/**\n\t * Constructor\n\t *\/\n\tTempcal();\n\n\t\/**\n\t * Destructor, also kills task.\n\t *\/\n\t~Tempcal();\n\n\t\/**\n\t * Start task.\n\t *\n\t * @return\t\tOK on success.\n\t *\/\n\tint\t\tstart();\n\n\tstatic void do_temperature_calibration(int argc, char *argv[]);\n\n\tvoid\t\ttask_main();\n\n\tvoid print_status();\n\n\tvoid exit() { _task_should_exit = true; }\n\nprivate:\n\tbool\t_task_should_exit = false;\n\tint\t_control_task = -1;\t\t\/\/ task handle for task\n};\n\nTempcal::Tempcal():\n\tSuperBlock(NULL, \"Tempcal\")\n{\n}\n\nTempcal::~Tempcal()\n{\n\n}\n\nvoid Tempcal::task_main()\n{\n\t\/\/ subscribe to relevant topics\n\tint gyro_sub[SENSOR_COUNT_MAX];\n\tfloat gyro_sample_filt[SENSOR_COUNT_MAX][4];\n\tpolyfitter<4> P[SENSOR_COUNT_MAX][3];\n\tpx4_pollfd_struct_t fds[SENSOR_COUNT_MAX] = {};\n\tunsigned _hot_soak_sat[SENSOR_COUNT_MAX] = {};\n\tunsigned num_gyro = orb_group_count(ORB_ID(sensor_gyro));\n\tunsigned num_samples[SENSOR_COUNT_MAX] = {0};\n\tuint32_t device_ids[SENSOR_COUNT_MAX] = {};\n\n\tif (num_gyro > SENSOR_COUNT_MAX) {\n\t\tnum_gyro = SENSOR_COUNT_MAX;\n\t}\n\n\tbool _cold_soaked[SENSOR_COUNT_MAX] = {false};\n\tbool _hot_soaked[SENSOR_COUNT_MAX] = {false};\n\tbool _tempcal_complete[SENSOR_COUNT_MAX] = {false};\n\tfloat _low_temp[SENSOR_COUNT_MAX];\n\tfloat _high_temp[SENSOR_COUNT_MAX] = {0};\n\tfloat _ref_temp[SENSOR_COUNT_MAX];\n\n\tfor (unsigned i = 0; i < num_gyro; i++) {\n\t\tgyro_sub[i] = orb_subscribe_multi(ORB_ID(sensor_gyro), i);\n\t\tfds[i].fd = gyro_sub[i];\n\t\tfds[i].events = POLLIN;\n\t}\n\n\t\/\/ initialize data structures outside of loop\n\t\/\/ because they will else not always be\n\t\/\/ properly populated\n\tsensor_gyro_s gyro_data = {};\n\n\twhile (!_task_should_exit) {\n\t\tint ret = px4_poll(fds, num_gyro, 1000);\n\n\t\tif (ret < 0) {\n\t\t\t\/\/ Poll error, sleep and try again\n\t\t\tusleep(10000);\n\t\t\tcontinue;\n\n\t\t} else if (ret == 0) {\n\t\t\t\/\/ Poll timeout or no new data, do nothing\n\t\t\tcontinue;\n\t\t}\n\n\t\tfor (unsigned i = 0; i < num_gyro; i++) {\n\t\t\tif (_hot_soaked[i]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (fds[i].revents & POLLIN) {\n\t\t\t\torb_copy(ORB_ID(sensor_gyro), gyro_sub[i], &gyro_data);\n\n\t\t\t\tdevice_ids[i] = gyro_data.device_id;\n\n\t\t\t\tgyro_sample_filt[i][0] = gyro_data.x;\n\t\t\t\tgyro_sample_filt[i][1] = gyro_data.y;\n\t\t\t\tgyro_sample_filt[i][2] = gyro_data.z;\n\t\t\t\tgyro_sample_filt[i][3] = gyro_data.temperature;\n\n\t\t\t\tif (!_cold_soaked[i]) {\n\t\t\t\t\t_cold_soaked[i] = true;\n\t\t\t\t\t_low_temp[i] = gyro_sample_filt[i][3];\t\/\/Record the low temperature\n\t\t\t\t\t_ref_temp[i] = gyro_sample_filt[i][3] + 12.0f;\n\t\t\t\t}\n\n\t\t\t\tnum_samples[i]++;\n\t\t\t}\n\t\t}\n\n\t\tfor (unsigned i = 0; i < num_gyro; i++) {\n\t\t\tif (_hot_soaked[i]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (gyro_sample_filt[i][3] > _high_temp[i]) {\n\t\t\t\t_high_temp[i] = gyro_sample_filt[i][3];\n\t\t\t\t_hot_soak_sat[i] = 0;\n\n\t\t\t} else {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t\/\/TODO: Hot Soak Saturation\n\t\t\tif (_hot_soak_sat[i] == 10 || (_high_temp[i] - _low_temp[i]) > 24.0f) {\n\t\t\t\t_hot_soaked[i] = true;\n\t\t\t}\n\n\t\t\tif (i == 0) {\n\t\t\t\tTC_DEBUG(\"\\n%.20f,%.20f,%.20f,%.20f, %.6f, %.6f, %.6f\\n\\n\", (double)gyro_sample_filt[i][0],\n\t\t\t\t\t (double)gyro_sample_filt[i][1],\n\t\t\t\t\t (double)gyro_sample_filt[i][2], (double)gyro_sample_filt[i][3], (double)_low_temp[i], (double)_high_temp[i],\n\t\t\t\t\t (double)(_high_temp[i] - _low_temp[i]));\n\t\t\t}\n\n\t\t\t\/\/update linear fit matrices\n\t\t\tgyro_sample_filt[i][3] -= _ref_temp[i];\n\t\t\tP[i][0].update((double)gyro_sample_filt[i][3], (double)gyro_sample_filt[i][0]);\n\t\t\tP[i][1].update((double)gyro_sample_filt[i][3], (double)gyro_sample_filt[i][1]);\n\t\t\tP[i][2].update((double)gyro_sample_filt[i][3], (double)gyro_sample_filt[i][2]);\n\t\t\tnum_samples[i] = 0;\n\t\t}\n\n\t\tfor (unsigned i = 0; i < num_gyro; i++) {\n\t\t\tif (_hot_soaked[i] && !_tempcal_complete[i]) {\n\t\t\t\tdouble res[3][4] = {0.0f};\n\t\t\t\tP[i][0].fit(res[0]);\n\t\t\t\tPX4_WARN(\"Result Gyro %d Axis 0: %.20f %.20f %.20f %.20f\", i, (double)res[0][0], (double)res[0][1], (double)res[0][2],\n\t\t\t\t\t (double)res[0][3]);\n\t\t\t\tP[i][1].fit(res[1]);\n\t\t\t\tPX4_WARN(\"Result Gyro %d Axis 1: %.20f %.20f %.20f %.20f\", i, (double)res[1][0], (double)res[1][1], (double)res[1][2],\n\t\t\t\t\t (double)res[1][3]);\n\t\t\t\tP[i][2].fit(res[2]);\n\t\t\t\tPX4_WARN(\"Result Gyro %d Axis 2: %.20f %.20f %.20f %.20f\", i, (double)res[2][0], (double)res[2][1], (double)res[2][2],\n\t\t\t\t\t (double)res[2][3]);\n\t\t\t\t_tempcal_complete[i] = true;\n\n\t\t\t\tchar str[30];\n\t\t\t\tfloat param = 0.0f;\n\t\t\t\tint result = PX4_OK;\n\n\t\t\t\tsprintf(str, \"TC_G%d_ID\", i);\n\t\t\t\tresult = param_set(param_find(str), &device_ids[i]);\n\n\t\t\t\tif (result != PX4_OK) {\n\t\t\t\t\tPX4_ERR(\"unable to reset %s\", str);\n\t\t\t\t}\n\n\t\t\t\tfor (unsigned j = 0; j < 3; j++) {\n\t\t\t\t\tfor (unsigned m = 0; m <= 3; m++) {\n\t\t\t\t\t\tsprintf(str, \"TC_G%d_X%d_%d\", i, m, j);\n\t\t\t\t\t\tparam = (float)res[j][m];\n\t\t\t\t\t\tresult = param_set(param_find(str), &param);\n\n\t\t\t\t\t\tif (result != PX4_OK) {\n\t\t\t\t\t\t\tPX4_ERR(\"unable to reset %s\", str);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tsprintf(str, \"TC_G%d_TMAX\", i);\n\t\t\t\t\tparam = _high_temp[i];\n\t\t\t\t\tresult = param_set(param_find(str), &param);\n\n\t\t\t\t\tif (result != PX4_OK) {\n\t\t\t\t\t\tPX4_ERR(\"unable to reset %s\", str);\n\t\t\t\t\t}\n\n\t\t\t\t\tsprintf(str, \"TC_G%d_TMIN\", i);\n\t\t\t\t\tparam = _low_temp[i];\n\t\t\t\t\tresult = param_set(param_find(str), &param);\n\n\t\t\t\t\tif (result != PX4_OK) {\n\t\t\t\t\t\tPX4_ERR(\"unable to reset %s\", str);\n\t\t\t\t\t}\n\n\t\t\t\t\tsprintf(str, \"TC_G%d_TREF\", i);\n\t\t\t\t\tparam = _ref_temp[i];\n\t\t\t\t\tresult = param_set(param_find(str), &param);\n\n\t\t\t\t\tif (result != PX4_OK) {\n\t\t\t\t\t\tPX4_ERR(\"unable to reset %s\", str);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t}\n\t\t}\n\n\t}\n\n\tfor (unsigned i = 0; i < num_gyro; i++) {\n\t\torb_unsubscribe(gyro_sub[i]);\n\t}\n\n\tdelete tempcal::instance;\n\ttempcal::instance = nullptr;\n\tPX4_INFO(\"Tempcal process stopped\");\n}\n\nvoid Tempcal::do_temperature_calibration(int argc, char *argv[])\n{\n\ttempcal::instance->task_main();\n}\n\nint Tempcal::start()\n{\n\n\tASSERT(_control_task == -1);\n\t_control_task = px4_task_spawn_cmd(\"temperature_calib\",\n\t\t\t\t\t   SCHED_DEFAULT,\n\t\t\t\t\t   SCHED_PRIORITY_MAX - 5,\n\t\t\t\t\t   5800,\n\t\t\t\t\t   (px4_main_t)&Tempcal::do_temperature_calibration,\n\t\t\t\t\t   nullptr);\n\n\tif (_control_task < 0) {\n\t\tdelete tempcal::instance;\n\t\ttempcal::instance = nullptr;\n\t\tPX4_ERR(\"start failed\");\n\t\treturn -errno;\n\t}\n\n\treturn 0;\n}\n\nint run_temperature_calibration()\n{\n\tPX4_INFO(\"Starting Temperature calibration task\");\n\ttempcal::instance = new Tempcal();\n\n\tif (tempcal::instance == nullptr) {\n\t\tPX4_ERR(\"alloc failed\");\n\t\treturn 1;\n\t}\n\n\treturn tempcal::instance->start();\n}\n<commit_msg>temperature_calibration: exit task when complete, set TC_G_ENABLE & use param_set_no_notification<commit_after>\/****************************************************************************\n *\n *   Copyright (c) 2017 PX4 Development Team. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n *    notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n *    notice, this list of conditions and the following disclaimer in\n *    the documentation and\/or other materials provided with the\n *    distribution.\n * 3. Neither the name PX4 nor the names of its contributors may be\n *    used to endorse or promote products derived from this software\n *    without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n ****************************************************************************\/\n\n\/**\n * @file tempcal_main.cpp\n * Implementation of the Temperature Calibration for onboard sensors.\n *\n * @author Siddharth Bharat Purohit\n *\/\n\n#include <px4_config.h>\n#include <px4_defines.h>\n#include <px4_tasks.h>\n#include <px4_posix.h>\n#include <px4_time.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <unistd.h>\n#include <fcntl.h>\n#include <errno.h>\n#include <math.h>\n#include <poll.h>\n#include <time.h>\n#include <float.h>\n#include <vector>\n#include <arch\/board\/board.h>\n#include <systemlib\/param\/param.h>\n#include <systemlib\/err.h>\n#include <systemlib\/systemlib.h>\n#include <mathlib\/mathlib.h>\n#include <mathlib\/math\/filter\/LowPassFilter2p.hpp>\n#include <platforms\/px4_defines.h>\n#include <drivers\/drv_hrt.h>\n#include <drivers\/drv_gyro.h>\n#include <controllib\/uorb\/blocks.hpp>\n\n#include <uORB\/topics\/sensor_gyro.h>\n#include \"polyfit.hpp\"\n#include \"temperature_calibration.h\"\n\n#define TC_PRINT_DEBUG 0\n#if TC_PRINT_DEBUG\n#define TC_DEBUG(fmt, ...) printf(fmt, ##__VA_ARGS__);\n#else\n#define TC_DEBUG(fmt, ...)\n#endif\n\n\n#define SENSOR_COUNT_MAX\t\t3\n\nextern \"C\" __EXPORT int tempcal_main(int argc, char *argv[]);\n\n\nclass Tempcal;\n\nnamespace tempcal\n{\nTempcal *instance = nullptr;\n}\n\n\nclass Tempcal : public control::SuperBlock\n{\npublic:\n\t\/**\n\t * Constructor\n\t *\/\n\tTempcal();\n\n\t\/**\n\t * Destructor, also kills task.\n\t *\/\n\t~Tempcal();\n\n\t\/**\n\t * Start task.\n\t *\n\t * @return\t\tOK on success.\n\t *\/\n\tint\t\tstart();\n\n\tstatic void do_temperature_calibration(int argc, char *argv[]);\n\n\tvoid\t\ttask_main();\n\n\tvoid print_status();\n\n\tvoid exit() { _task_should_exit = true; }\n\nprivate:\n\tbool\t_task_should_exit = false;\n\tint\t_control_task = -1;\t\t\/\/ task handle for task\n};\n\nTempcal::Tempcal():\n\tSuperBlock(NULL, \"Tempcal\")\n{\n}\n\nTempcal::~Tempcal()\n{\n\n}\n\nvoid Tempcal::task_main()\n{\n\t\/\/ subscribe to relevant topics\n\tint gyro_sub[SENSOR_COUNT_MAX];\n\tfloat gyro_sample_filt[SENSOR_COUNT_MAX][4];\n\tpolyfitter<4> P[SENSOR_COUNT_MAX][3];\n\tpx4_pollfd_struct_t fds[SENSOR_COUNT_MAX] = {};\n\tunsigned _hot_soak_sat[SENSOR_COUNT_MAX] = {};\n\tunsigned num_gyro = orb_group_count(ORB_ID(sensor_gyro));\n\tunsigned num_samples[SENSOR_COUNT_MAX] = {0};\n\tuint32_t device_ids[SENSOR_COUNT_MAX] = {};\n\tint result;\n\tint num_completed = 0; \/\/ number of completed gyros\n\n\tif (num_gyro > SENSOR_COUNT_MAX) {\n\t\tnum_gyro = SENSOR_COUNT_MAX;\n\t}\n\n\tbool _cold_soaked[SENSOR_COUNT_MAX] = {false};\n\tbool _hot_soaked[SENSOR_COUNT_MAX] = {false};\n\tbool _tempcal_complete[SENSOR_COUNT_MAX] = {false};\n\tfloat _low_temp[SENSOR_COUNT_MAX];\n\tfloat _high_temp[SENSOR_COUNT_MAX] = {0};\n\tfloat _ref_temp[SENSOR_COUNT_MAX];\n\n\tfor (unsigned i = 0; i < num_gyro; i++) {\n\t\tgyro_sub[i] = orb_subscribe_multi(ORB_ID(sensor_gyro), i);\n\t\tfds[i].fd = gyro_sub[i];\n\t\tfds[i].events = POLLIN;\n\t}\n\n\t\/\/ initialize data structures outside of loop\n\t\/\/ because they will else not always be\n\t\/\/ properly populated\n\tsensor_gyro_s gyro_data = {};\n\n\twhile (!_task_should_exit) {\n\t\tint ret = px4_poll(fds, num_gyro, 1000);\n\n\t\tif (ret < 0) {\n\t\t\t\/\/ Poll error, sleep and try again\n\t\t\tusleep(10000);\n\t\t\tcontinue;\n\n\t\t} else if (ret == 0) {\n\t\t\t\/\/ Poll timeout or no new data, do nothing\n\t\t\tcontinue;\n\t\t}\n\n\t\tfor (unsigned i = 0; i < num_gyro; i++) {\n\t\t\tif (_hot_soaked[i]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (fds[i].revents & POLLIN) {\n\t\t\t\torb_copy(ORB_ID(sensor_gyro), gyro_sub[i], &gyro_data);\n\n\t\t\t\tdevice_ids[i] = gyro_data.device_id;\n\n\t\t\t\tgyro_sample_filt[i][0] = gyro_data.x;\n\t\t\t\tgyro_sample_filt[i][1] = gyro_data.y;\n\t\t\t\tgyro_sample_filt[i][2] = gyro_data.z;\n\t\t\t\tgyro_sample_filt[i][3] = gyro_data.temperature;\n\n\t\t\t\tif (!_cold_soaked[i]) {\n\t\t\t\t\t_cold_soaked[i] = true;\n\t\t\t\t\t_low_temp[i] = gyro_sample_filt[i][3];\t\/\/Record the low temperature\n\t\t\t\t\t_ref_temp[i] = gyro_sample_filt[i][3] + 12.0f;\n\t\t\t\t}\n\n\t\t\t\tnum_samples[i]++;\n\t\t\t}\n\t\t}\n\n\t\tfor (unsigned i = 0; i < num_gyro; i++) {\n\t\t\tif (_hot_soaked[i]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (gyro_sample_filt[i][3] > _high_temp[i]) {\n\t\t\t\t_high_temp[i] = gyro_sample_filt[i][3];\n\t\t\t\t_hot_soak_sat[i] = 0;\n\n\t\t\t} else {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t\/\/TODO: Hot Soak Saturation\n\t\t\tif (_hot_soak_sat[i] == 10 || (_high_temp[i] - _low_temp[i]) > 24.0f) {\n\t\t\t\t_hot_soaked[i] = true;\n\t\t\t}\n\n\t\t\tif (i == 0) {\n\t\t\t\tTC_DEBUG(\"\\n%.20f,%.20f,%.20f,%.20f, %.6f, %.6f, %.6f\\n\\n\", (double)gyro_sample_filt[i][0],\n\t\t\t\t\t (double)gyro_sample_filt[i][1],\n\t\t\t\t\t (double)gyro_sample_filt[i][2], (double)gyro_sample_filt[i][3], (double)_low_temp[i], (double)_high_temp[i],\n\t\t\t\t\t (double)(_high_temp[i] - _low_temp[i]));\n\t\t\t}\n\n\t\t\t\/\/update linear fit matrices\n\t\t\tgyro_sample_filt[i][3] -= _ref_temp[i];\n\t\t\tP[i][0].update((double)gyro_sample_filt[i][3], (double)gyro_sample_filt[i][0]);\n\t\t\tP[i][1].update((double)gyro_sample_filt[i][3], (double)gyro_sample_filt[i][1]);\n\t\t\tP[i][2].update((double)gyro_sample_filt[i][3], (double)gyro_sample_filt[i][2]);\n\t\t\tnum_samples[i] = 0;\n\t\t}\n\n\t\tfor (unsigned i = 0; i < num_gyro; i++) {\n\t\t\tif (_hot_soaked[i] && !_tempcal_complete[i]) {\n\t\t\t\tdouble res[3][4] = {0.0f};\n\t\t\t\tP[i][0].fit(res[0]);\n\t\t\t\tPX4_WARN(\"Result Gyro %d Axis 0: %.20f %.20f %.20f %.20f\", i, (double)res[0][0], (double)res[0][1], (double)res[0][2],\n\t\t\t\t\t (double)res[0][3]);\n\t\t\t\tP[i][1].fit(res[1]);\n\t\t\t\tPX4_WARN(\"Result Gyro %d Axis 1: %.20f %.20f %.20f %.20f\", i, (double)res[1][0], (double)res[1][1], (double)res[1][2],\n\t\t\t\t\t (double)res[1][3]);\n\t\t\t\tP[i][2].fit(res[2]);\n\t\t\t\tPX4_WARN(\"Result Gyro %d Axis 2: %.20f %.20f %.20f %.20f\", i, (double)res[2][0], (double)res[2][1], (double)res[2][2],\n\t\t\t\t\t (double)res[2][3]);\n\t\t\t\t_tempcal_complete[i] = true;\n\t\t\t\t++num_completed;\n\n\t\t\t\tchar str[30];\n\t\t\t\tfloat param = 0.0f;\n\n\t\t\t\tsprintf(str, \"TC_G%d_ID\", i);\n\t\t\t\tresult = param_set_no_notification(param_find(str), &device_ids[i]);\n\n\t\t\t\tif (result != PX4_OK) {\n\t\t\t\t\tPX4_ERR(\"unable to reset %s\", str);\n\t\t\t\t}\n\n\t\t\t\tfor (unsigned j = 0; j < 3; j++) {\n\t\t\t\t\tfor (unsigned m = 0; m <= 3; m++) {\n\t\t\t\t\t\tsprintf(str, \"TC_G%d_X%d_%d\", i, m, j);\n\t\t\t\t\t\tparam = (float)res[j][m];\n\t\t\t\t\t\tresult = param_set_no_notification(param_find(str), &param);\n\n\t\t\t\t\t\tif (result != PX4_OK) {\n\t\t\t\t\t\t\tPX4_ERR(\"unable to reset %s\", str);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\tsprintf(str, \"TC_G%d_TMAX\", i);\n\t\t\t\tparam = _high_temp[i];\n\t\t\t\tresult = param_set_no_notification(param_find(str), &param);\n\n\t\t\t\tif (result != PX4_OK) {\n\t\t\t\t\tPX4_ERR(\"unable to reset %s\", str);\n\t\t\t\t}\n\n\t\t\t\tsprintf(str, \"TC_G%d_TMIN\", i);\n\t\t\t\tparam = _low_temp[i];\n\t\t\t\tresult = param_set_no_notification(param_find(str), &param);\n\n\t\t\t\tif (result != PX4_OK) {\n\t\t\t\t\tPX4_ERR(\"unable to reset %s\", str);\n\t\t\t\t}\n\n\t\t\t\tsprintf(str, \"TC_G%d_TREF\", i);\n\t\t\t\tparam = _ref_temp[i];\n\t\t\t\tresult = param_set_no_notification(param_find(str), &param);\n\n\t\t\t\tif (result != PX4_OK) {\n\t\t\t\t\tPX4_ERR(\"unable to reset %s\", str);\n\t\t\t\t}\n\n\t\t\t}\n\t\t}\n\n\n\t\tif (num_completed == num_gyro) {\n\t\t\t\/* all gyros are done *\/\n\t\t\tint32_t enabled = 1;\n\t\t\tresult = param_set(param_find(\"TC_G_ENABLE\"), &enabled);\n\n\t\t\tif (result != PX4_OK) {\n\t\t\t\tPX4_ERR(\"unable to reset TC_G_ENABLE\");\n\t\t\t}\n\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tfor (unsigned i = 0; i < num_gyro; i++) {\n\t\torb_unsubscribe(gyro_sub[i]);\n\t}\n\n\tdelete tempcal::instance;\n\ttempcal::instance = nullptr;\n\tPX4_INFO(\"Tempcal process exited\");\n}\n\nvoid Tempcal::do_temperature_calibration(int argc, char *argv[])\n{\n\ttempcal::instance->task_main();\n}\n\nint Tempcal::start()\n{\n\n\tASSERT(_control_task == -1);\n\t_control_task = px4_task_spawn_cmd(\"temperature_calib\",\n\t\t\t\t\t   SCHED_DEFAULT,\n\t\t\t\t\t   SCHED_PRIORITY_MAX - 5,\n\t\t\t\t\t   5800,\n\t\t\t\t\t   (px4_main_t)&Tempcal::do_temperature_calibration,\n\t\t\t\t\t   nullptr);\n\n\tif (_control_task < 0) {\n\t\tdelete tempcal::instance;\n\t\ttempcal::instance = nullptr;\n\t\tPX4_ERR(\"start failed\");\n\t\treturn -errno;\n\t}\n\n\treturn 0;\n}\n\nint run_temperature_calibration()\n{\n\tPX4_INFO(\"Starting Temperature calibration task\");\n\ttempcal::instance = new Tempcal();\n\n\tif (tempcal::instance == nullptr) {\n\t\tPX4_ERR(\"alloc failed\");\n\t\treturn 1;\n\t}\n\n\treturn tempcal::instance->start();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/chips\/p9\/common\/include\/p9_mc_scom_addresses_fld_fixes.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 mc_scom_addresses_fld_fixes.H\n\/\/\/ @brief The *scom_addresses_fld.H files are generated form figtree,\n\/\/\/        but the figree can be wrong.  This file is included in\n\/\/\/        *_scom_addresses_fld.H and allows incorrect constants to be\n\/\/\/        fixed manually.\n\/\/\/\n\/\/ *HWP HWP Owner: Ben Gass <bgass@us.ibm.com>\n\/\/ *HWP FW Owner: ? <?>\n\/\/ *HWP Team: SAO\n\/\/ *HWP Level: 1\n\/\/ *HWP Consumed by: FSP:HB:HS:OCC:SBE:CME:SGPE:PGPE:FPPE:IPPE\n\n#ifndef __P9_MC_SCOM_ADDRESSES_FLD_FIXES_H\n#define __P9_MC_SCOM_ADDRESSES_FLD_FIXES_H\n\n\/\/Example\n\/\/Copy the whole line from the *scom_addresses_fld.H file.  Then add FIX in front of REG\n\/\/and add another paramter that is the new value you want.\n\/\/\n\/\/FIXREG64_FLD( PU_ALTD_CMD_REG_FBC_WITH_TM_QUIESCE, 24, SH_UNT, SH_ACS_SCOM, SH_FLD_FBC_WITH_TM_QUIESCE,\n\/\/              12);\n\n\nstatic const uint64_t SH_FLD_COMMAND_LIST_TIMEOUT_SPEC = 99990000;\nstatic const uint64_t SH_FLD_CFG_PAUSE_ON_MCE = 99990001;\n\n\nREG64_FLD( MCA_DDRPHY_DP16_SYSCLK_PR0_P0_0_01_ENABLE               , 48  , SH_UNT_MCA      , SH_ACS_SCOM_RW  ,\n           0 );\n\nREG64_FLD( MCA_DDRPHY_WC_RTT_WL_SWAP_ENABLE_P0                     , 48  , SH_UNT_MCA      , SH_ACS_SCOM_RW  ,\n           0 );\nREG64_FLD( MCA_DDRPHY_WC_RTT_WR_CTL_SWAP_ENABLE_P0                 , 49  , SH_UNT_MCA      , SH_ACS_SCOM_RW  ,\n           0 );\n\nREG64_FLD( MCBIST_MCBCFGQ_CFG_MCBIST_CFG_FORCE_PAUSE_AFTER_RANK    , 34  , SH_UNT_MCA      , SH_ACS_SCOM_RW  ,\n           0 );\n\nREG64_FLD( MCBIST_MBSTRQ_CFG_PAUSE_ON_MCE                          , 33  , SH_UNT_MCBIST   , SH_ACS_SCOM_RW  ,\n           SH_FLD_CFG_PAUSE_ON_MCE );\n\nREG64_FLD( MCS_MCMODE0_GROUP_INTERLEAVE_GRANULARITY                , 52  , SH_UNT_MCS      , SH_ACS_SCOM_RW  ,\n           0 );\nREG64_FLD( MCS_MCMODE0_GROUP_INTERLEAVE_GRANULARITY_LEN            , 4   , SH_UNT_MCS      , SH_ACS_SCOM_RW  ,\n           0 );\n\n\n\n#endif\n<commit_msg>p9_throttle_sync -- initial version for Cumulus<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/chips\/p9\/common\/include\/p9_mc_scom_addresses_fld_fixes.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 mc_scom_addresses_fld_fixes.H\n\/\/\/ @brief The *scom_addresses_fld.H files are generated form figtree,\n\/\/\/        but the figree can be wrong.  This file is included in\n\/\/\/        *_scom_addresses_fld.H and allows incorrect constants to be\n\/\/\/        fixed manually.\n\/\/\/\n\/\/ *HWP HWP Owner: Ben Gass <bgass@us.ibm.com>\n\/\/ *HWP FW Owner: ? <?>\n\/\/ *HWP Team: SAO\n\/\/ *HWP Level: 1\n\/\/ *HWP Consumed by: FSP:HB:HS:OCC:SBE:CME:SGPE:PGPE:FPPE:IPPE\n\n#ifndef __P9_MC_SCOM_ADDRESSES_FLD_FIXES_H\n#define __P9_MC_SCOM_ADDRESSES_FLD_FIXES_H\n\n\/\/Example\n\/\/Copy the whole line from the *scom_addresses_fld.H file.  Then add FIX in front of REG\n\/\/and add another paramter that is the new value you want.\n\/\/\n\/\/FIXREG64_FLD( PU_ALTD_CMD_REG_FBC_WITH_TM_QUIESCE, 24, SH_UNT, SH_ACS_SCOM, SH_FLD_FBC_WITH_TM_QUIESCE,\n\/\/              12);\n\n\nstatic const uint64_t SH_FLD_COMMAND_LIST_TIMEOUT_SPEC = 99990000;\nstatic const uint64_t SH_FLD_CFG_PAUSE_ON_MCE = 99990001;\n\n\nREG64_FLD( MCA_DDRPHY_DP16_SYSCLK_PR0_P0_0_01_ENABLE               , 48  , SH_UNT_MCA      , SH_ACS_SCOM_RW  ,\n           0 );\n\nREG64_FLD( MCA_DDRPHY_WC_RTT_WL_SWAP_ENABLE_P0                     , 48  , SH_UNT_MCA      , SH_ACS_SCOM_RW  ,\n           0 );\nREG64_FLD( MCA_DDRPHY_WC_RTT_WR_CTL_SWAP_ENABLE_P0                 , 49  , SH_UNT_MCA      , SH_ACS_SCOM_RW  ,\n           0 );\n\nREG64_FLD( MCBIST_MCBCFGQ_CFG_MCBIST_CFG_FORCE_PAUSE_AFTER_RANK    , 34  , SH_UNT_MCA      , SH_ACS_SCOM_RW  ,\n           0 );\n\nREG64_FLD( MCBIST_MBSTRQ_CFG_PAUSE_ON_MCE                          , 33  , SH_UNT_MCBIST   , SH_ACS_SCOM_RW  ,\n           SH_FLD_CFG_PAUSE_ON_MCE );\n\nREG64_FLD( MCS_MCMODE0_GROUP_INTERLEAVE_GRANULARITY                , 52  , SH_UNT_MCS      , SH_ACS_SCOM_RW  ,\n           0 );\nREG64_FLD( MCS_MCMODE0_GROUP_INTERLEAVE_GRANULARITY_LEN            , 4   , SH_UNT_MCS      , SH_ACS_SCOM_RW  ,\n           0 );\nREG64_FLD( MCS_MCMODE0_DISABLE_MC_SYNC                             , 27  , SH_UNT_MCS      , SH_ACS_SCOM_RW  ,\n           0 );\nREG64_FLD( MCS_MCMODE0_DISABLE_MC_PAIR_SYNC                        , 28  , SH_UNT_MCS      , SH_ACS_SCOM_RW  ,\n           0 );\n\n\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Updated conf<commit_after><|endoftext|>"}
{"text":"<commit_before>#include <algorithm>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <regex>\n#include <string>\n#include <vector>\n\n#include <cmath>\n\n\/\/ TODO: Replace this as soon as possible with a more modern option\n\/\/ parser interface.\n#include <getopt.h>\n\n#include \"distances\/Wasserstein.hh\"\n\n#include \"persistenceDiagrams\/PersistenceDiagram.hh\"\n#include \"persistenceDiagrams\/PersistenceIndicatorFunction.hh\"\n\n#include \"persistenceDiagrams\/io\/Raw.hh\"\n\n#include \"utilities\/Filesystem.hh\"\n\nusing DataType                     = double;\nusing PersistenceDiagram           = aleph::PersistenceDiagram<DataType>;\nusing PersistenceIndicatorFunction = aleph::math::StepFunction<DataType>;\n\n\/*\n  Auxiliary structure for describing a data set. I need this in order to\n  figure out the corresponding dimension of the persistence diagram.\n*\/\n\nstruct DataSet\n{\n  std::string name;\n  std::string filename;\n  unsigned dimension;\n\n  PersistenceDiagram persistenceDiagram;\n  PersistenceIndicatorFunction persistenceIndicatorFunction;\n};\n\nvoid storeMatrix( const std::vector< std::vector<double> >& M, std::ostream& out )\n{\n  if( M.empty() )\n    return;\n\n  auto rows = M.size();\n  auto cols = M.front().size();\n\n  for( decltype(rows) row = 0; row < rows; row++ )\n  {\n    for( decltype(cols) col = 0; col < cols; col++ )\n    {\n      if( col != 0 )\n        out << \" \";\n\n      out << M[row][col];\n    }\n\n    out << \"\\n\";\n  }\n}\n\n\/\/ Calculates the distance between two data sets. This requires enumerating all\n\/\/ dimensions, and finding the corresponding persistence indicator function. If\n\/\/ no such function exists, the function uses the norm of the function.\ndouble distance( const std::vector<DataSet>& dataSet1, const std::vector<DataSet>& dataSet2, unsigned minDimension, unsigned maxDimension, double power )\n{\n  auto getPersistenceIndicatorFunction = [] ( const std::vector<DataSet>& dataSet, unsigned dimension )\n  {\n    auto it = std::find_if( dataSet.begin(), dataSet.end(),\n                            [&dimension] ( const DataSet& dataSet )\n                            {\n                              return dataSet.dimension == dimension;\n                            } );\n\n    if( it != dataSet.end() )\n      return PersistenceIndicatorFunction( it->persistenceIndicatorFunction );\n    else\n      return PersistenceIndicatorFunction();\n  };\n\n  double d = 0.0;\n\n  for( unsigned dimension = minDimension; dimension <= maxDimension; dimension++ )\n  {\n    auto f = getPersistenceIndicatorFunction( dataSet1, dimension );\n    auto g = getPersistenceIndicatorFunction( dataSet2, dimension );\n\n    g = -g;\n    if( power == 1.0 )\n      d = d + (f+g).abs().integral();\n    else\n      d = d + (f+g).abs().integral_p( power );\n  }\n\n  return d;\n}\n\ndouble wassersteinDistance( const std::vector<DataSet>& dataSet1, const std::vector<DataSet>& dataSet2, unsigned minDimension, unsigned maxDimension, double power )\n{\n  auto getPersistenceDiagram = [] ( const std::vector<DataSet>& dataSet, unsigned dimension )\n  {\n    auto it = std::find_if( dataSet.begin(), dataSet.end(),\n                            [&dimension] ( const DataSet& dataSet )\n                            {\n                              return dataSet.dimension == dimension;\n                            } );\n\n    if( it != dataSet.end() )\n      return PersistenceDiagram( it->persistenceDiagram );\n    else\n      return PersistenceDiagram();\n  };\n\n  double d = 0.0;\n\n  for( unsigned dimension = minDimension; dimension <= maxDimension; dimension++ )\n  {\n    auto D1 = getPersistenceDiagram( dataSet1, dimension );\n    auto D2 = getPersistenceDiagram( dataSet2, dimension );\n\n    d += aleph::distances::wassersteinDistance( D1, D2, power );\n  }\n\n  d = std::pow( d, 1.0 \/ power );\n  return d;\n}\n\n\nint main( int argc, char** argv )\n{\n  static option commandLineOptions[] =\n  {\n    { \"power\"      , required_argument, nullptr, 'p' },\n    { \"wasserstein\", no_argument      , nullptr, 'w' },\n    { nullptr      , 0                , nullptr,  0  }\n  };\n\n  double power                = 2.0;\n  bool useWassersteinDistance = false;\n\n  int option = 0;\n  while( ( option = getopt_long( argc, argv, \"p:w\", commandLineOptions, nullptr ) ) != -1 )\n  {\n    switch( option )\n    {\n    case 'p':\n      power = std::stod( optarg );\n      break;\n    case 'w':\n      useWassersteinDistance = true;\n      break;\n    default:\n      break;\n    }\n  }\n\n  if( ( argc - optind ) <= 1 )\n  {\n    \/\/ TODO: Show usage\n    return -1;\n  }\n\n  \/\/ Maps filenames to indices. I need this to ensure that the internal\n  \/\/ ordering of files coincides with the shell's ordering.\n  std::map<std::string, unsigned> filenameMap;\n\n  std::vector< std::vector<DataSet> > dataSets;\n\n  \/\/ TODO: Make this regular expression more, well, 'expressive' and\n  \/\/ support more methods of specifying a dimension.\n  std::regex reDataSetPrefix( \"(.*)_[dk]([[:digit:]]+)\\\\.txt\" );\n  std::smatch matches;\n\n  \/\/ Get filenames & prefixes ------------------------------------------\n\n  unsigned minDimension = std::numeric_limits<unsigned>::max();\n  unsigned maxDimension = 0;\n\n  {\n    std::vector<std::string> filenames;\n    filenames.reserve( argc - 1 );\n\n    unsigned index = 0;\n\n    for( int i = optind; i < argc; i++ )\n    {\n      filenames.push_back( argv[i] );\n\n      auto name = filenames.back();\n\n      \/\/ Check whether the name contains a recognizable prefix and\n      \/\/ suffix\n      if( std::regex_match( filenames.back(), matches, reDataSetPrefix ) )\n        name = matches[1];\n\n      if( filenameMap.find( name ) == filenameMap.end() )\n        filenameMap[ name ] = index++;\n    }\n\n    dataSets.resize( filenameMap.size() );\n\n    for( auto&& filename : filenames )\n    {\n      auto name      = filename;\n      auto dimension = 0u;\n\n      \/\/ Check if a recognizable prefix and suffix exist so that we may\n      \/\/ grab information about the data set and its dimension.\n      if( std::regex_match( filename, matches, reDataSetPrefix ) )\n      {\n        name      = matches[1];\n        dimension = unsigned( std::stoul( matches[2] ) );\n      }\n\n      dataSets.at( filenameMap[name] ).push_back( { name, filename, dimension, {}, {} } );\n\n      minDimension = std::min( minDimension, dimension );\n      maxDimension = std::max( maxDimension, dimension );\n    }\n  }\n\n  \/\/ Load persistence diagrams & calculate indicator functions ---------\n\n  std::vector<PersistenceDiagram> persistenceDiagrams;\n\n  for( auto&& sets : dataSets )\n  {\n    for( auto&& dataSet : sets )\n    {\n      std::cerr << \"* Processing '\" << dataSet.filename << \"'...\";\n\n      dataSet.persistenceDiagram = aleph::io::load<DataType>( dataSet.filename );\n\n      \/\/ FIXME: This is only required in order to ensure that the\n      \/\/ persistence indicator function has a finite integral; it\n      \/\/ can be solved more elegantly by using a special value to\n      \/\/ indicate infinite intervals.\n      dataSet.persistenceDiagram.removeUnpaired();\n\n      dataSet.persistenceIndicatorFunction\n         = aleph::persistenceIndicatorFunction( dataSet.persistenceDiagram );\n\n      std::cerr << \"finished\\n\";\n    }\n  }\n\n  \/\/ Calculate all distances -------------------------------------------\n\n  std::vector< std::vector<double> > distances;\n  distances.resize( dataSets.size(), std::vector<double>( dataSets.size() ) );\n\n  #pragma omp parallel for collapse(2)\n  for( std::size_t row = 0; row < dataSets.size(); row++ )\n  {\n    for( std::size_t col = 0; col < dataSets.size(); col++ )\n    {\n      if( row <= col )\n        continue;\n\n      double d = 0.0;\n\n      if( useWassersteinDistance )\n        d = wassersteinDistance( dataSets.at(row), dataSets.at(col), minDimension, maxDimension, power );\n      else\n        d = distance( dataSets.at(row), dataSets.at(col), minDimension, maxDimension, power );\n\n      distances[row][col] = d;\n      distances[col][row] = d;\n    }\n  }\n\n  std::cerr << \"Storing matrix...\";\n\n  storeMatrix( distances, std::cout );\n\n  std::cerr << \"finished\\n\";\n}\n<commit_msg>Extended topological distance calculation tool with Hausdorff distance<commit_after>#include <algorithm>\n#include <functional>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <regex>\n#include <string>\n#include <vector>\n\n#include <cmath>\n\n\/\/ TODO: Replace this as soon as possible with a more modern option\n\/\/ parser interface.\n#include <getopt.h>\n\n#include \"distances\/Hausdorff.hh\"\n#include \"distances\/Wasserstein.hh\"\n\n#include \"persistenceDiagrams\/PersistenceDiagram.hh\"\n#include \"persistenceDiagrams\/PersistenceIndicatorFunction.hh\"\n\n#include \"persistenceDiagrams\/io\/Raw.hh\"\n\n#include \"utilities\/Filesystem.hh\"\n\nusing DataType                     = double;\nusing PersistenceDiagram           = aleph::PersistenceDiagram<DataType>;\nusing PersistenceIndicatorFunction = aleph::math::StepFunction<DataType>;\n\n\/*\n  Auxiliary structure for describing a data set. I need this in order to\n  figure out the corresponding dimension of the persistence diagram.\n*\/\n\nstruct DataSet\n{\n  std::string name;\n  std::string filename;\n  unsigned dimension;\n\n  PersistenceDiagram persistenceDiagram;\n  PersistenceIndicatorFunction persistenceIndicatorFunction;\n};\n\n\/*\n  Stores a matrix in an output stream. The matrix is formatted such that\n  individual values are separated by spaces and each row ends with '\\n'.\n\n  This format can be easily parsed by auxiliary programs such as gnuplot\n  or R.\n*\/\n\nvoid storeMatrix( const std::vector< std::vector<double> >& M, std::ostream& out )\n{\n  if( M.empty() )\n    return;\n\n  auto rows = M.size();\n  auto cols = M.front().size();\n\n  for( decltype(rows) row = 0; row < rows; row++ )\n  {\n    for( decltype(cols) col = 0; col < cols; col++ )\n    {\n      if( col != 0 )\n        out << \" \";\n\n      out << M[row][col];\n    }\n\n    out << \"\\n\";\n  }\n}\n\n\/*\n  Calculates the topological distance between two data sets using persistence\n  indicator functions. This requires enumerating all dimensions and finding a\n  corresponding persistence indicator function. If no suitable function could\n  be found, the calculation defaults to calculating the norm.\n*\/\n\ndouble distancePIF( const std::vector<DataSet>& dataSet1,\n                    const std::vector<DataSet>& dataSet2,\n                    unsigned minDimension,\n                    unsigned maxDimension,\n                    double power )\n{\n  auto getPersistenceIndicatorFunction = [] ( const std::vector<DataSet>& dataSet, unsigned dimension )\n  {\n    auto it = std::find_if( dataSet.begin(), dataSet.end(),\n                            [&dimension] ( const DataSet& dataSet )\n                            {\n                              return dataSet.dimension == dimension;\n                            } );\n\n    if( it != dataSet.end() )\n      return PersistenceIndicatorFunction( it->persistenceIndicatorFunction );\n    else\n      return PersistenceIndicatorFunction();\n  };\n\n  double d = 0.0;\n\n  for( unsigned dimension = minDimension; dimension <= maxDimension; dimension++ )\n  {\n    auto f = getPersistenceIndicatorFunction( dataSet1, dimension );\n    auto g = getPersistenceIndicatorFunction( dataSet2, dimension );\n\n    g = -g;\n    if( power == 1.0 )\n      d = d + (f+g).abs().integral();\n    else\n      d = d + (f+g).abs().integral_p( power );\n  }\n\n  return d;\n}\n\n\/*\n  Calculates the topological distance between two data sets, using\n  a standard distance between two persistence diagrams, for example\n  the Hausdorff, Wasserstein, or bottleneck distance.\n\n  By default, the Wasserstein distance is calculated.\n*\/\n\ntemplate <class Functor>\ndouble persistenceDiagramDistance( const std::vector<DataSet>& dataSet1,\n                                   const std::vector<DataSet>& dataSet2,\n                                   unsigned minDimension,\n                                   unsigned maxDimension,\n                                   double power,\n                                   Functor functor = [] ( const PersistenceDiagram& D1, const PersistenceDiagram& D2, double power )\n                                   {\n                                     return aleph::distances::wassersteinDistance( D1, D2, power );\n                                   } )\n{\n  auto getPersistenceDiagram = [] ( const std::vector<DataSet>& dataSet, unsigned dimension )\n  {\n    auto it = std::find_if( dataSet.begin(), dataSet.end(),\n                            [&dimension] ( const DataSet& dataSet )\n                            {\n                              return dataSet.dimension == dimension;\n                            } );\n\n    if( it != dataSet.end() )\n      return PersistenceDiagram( it->persistenceDiagram );\n    else\n      return PersistenceDiagram();\n  };\n\n  double d = 0.0;\n\n  for( unsigned dimension = minDimension; dimension <= maxDimension; dimension++ )\n  {\n    auto D1 = getPersistenceDiagram( dataSet1, dimension );\n    auto D2 = getPersistenceDiagram( dataSet2, dimension );\n\n    d += functor( D1, D2, power );\n  }\n\n  d = std::pow( d, 1.0 \/ power );\n  return d;\n}\n\n\nint main( int argc, char** argv )\n{\n  static option commandLineOptions[] =\n  {\n    { \"power\"      , required_argument, nullptr, 'p' },\n    { \"hausdorff\"  , no_argument      , nullptr, 'h' },\n    { \"indicator\"  , no_argument      , nullptr, 'i' },\n    { \"wasserstein\", no_argument      , nullptr, 'w' },\n    { nullptr      , 0                , nullptr,  0  }\n  };\n\n  double power                      = 2.0;\n  bool useIndicatorFunctionDistance = false;\n  bool useWassersteinDistance       = false;\n\n  int option = 0;\n  while( ( option = getopt_long( argc, argv, \"p:hiw\", commandLineOptions, nullptr ) ) != -1 )\n  {\n    switch( option )\n    {\n    case 'p':\n      power = std::stod( optarg );\n      break;\n    case 'h':\n      useWassersteinDistance       = false;\n      useIndicatorFunctionDistance = false;\n      break;\n    case 'i':\n      useIndicatorFunctionDistance = true;\n      useWassersteinDistance       = false;\n      break;\n    case 'w':\n      useIndicatorFunctionDistance = false;\n      useWassersteinDistance       = true;\n      break;\n    default:\n      break;\n    }\n  }\n\n  if( ( argc - optind ) <= 1 )\n  {\n    \/\/ TODO: Show usage\n    return -1;\n  }\n\n  \/\/ Maps filenames to indices. I need this to ensure that the internal\n  \/\/ ordering of files coincides with the shell's ordering.\n  std::map<std::string, unsigned> filenameMap;\n\n  std::vector< std::vector<DataSet> > dataSets;\n\n  \/\/ TODO: Make this regular expression more, well, 'expressive' and\n  \/\/ support more methods of specifying a dimension.\n  std::regex reDataSetPrefix( \"(.*)_[dk]([[:digit:]]+)\\\\.txt\" );\n  std::smatch matches;\n\n  \/\/ Get filenames & prefixes ------------------------------------------\n\n  unsigned minDimension = std::numeric_limits<unsigned>::max();\n  unsigned maxDimension = 0;\n\n  {\n    std::vector<std::string> filenames;\n    filenames.reserve( argc - 1 );\n\n    unsigned index = 0;\n\n    for( int i = optind; i < argc; i++ )\n    {\n      filenames.push_back( argv[i] );\n\n      auto name = filenames.back();\n\n      \/\/ Check whether the name contains a recognizable prefix and\n      \/\/ suffix. If not, use the complete filename to identify the\n      \/\/ data set.\n      if( std::regex_match( filenames.back(), matches, reDataSetPrefix ) )\n        name = matches[1];\n\n      if( filenameMap.find( name ) == filenameMap.end() )\n        filenameMap[ name ] = index++;\n    }\n\n    dataSets.resize( filenameMap.size() );\n\n    for( auto&& filename : filenames )\n    {\n      auto name      = filename;\n      auto dimension = 0u;\n\n      \/\/ Check if a recognizable prefix and suffix exist so that we may\n      \/\/ grab information about the data set and its dimension. If not,\n      \/\/ use the complete filename to identify the data set.\n      if( std::regex_match( filename, matches, reDataSetPrefix ) )\n      {\n        name      = matches[1];\n        dimension = unsigned( std::stoul( matches[2] ) );\n      }\n\n      dataSets.at( filenameMap[name] ).push_back( { name, filename, dimension, {}, {} } );\n\n      minDimension = std::min( minDimension, dimension );\n      maxDimension = std::max( maxDimension, dimension );\n    }\n  }\n\n  \/\/ Load persistence diagrams & calculate indicator functions ---------\n\n  std::vector<PersistenceDiagram> persistenceDiagrams;\n\n  for( auto&& sets : dataSets )\n  {\n    for( auto&& dataSet : sets )\n    {\n      std::cerr << \"* Processing '\" << dataSet.filename << \"'...\";\n\n      dataSet.persistenceDiagram = aleph::io::load<DataType>( dataSet.filename );\n\n      \/\/ FIXME: This is only required in order to ensure that the\n      \/\/ persistence indicator function has a finite integral; it\n      \/\/ can be solved more elegantly by using a special value to\n      \/\/ indicate infinite intervals.\n      dataSet.persistenceDiagram.removeUnpaired();\n\n      dataSet.persistenceIndicatorFunction\n         = aleph::persistenceIndicatorFunction( dataSet.persistenceDiagram );\n\n      std::cerr << \"finished\\n\";\n    }\n  }\n\n  \/\/ Setup distance functor --------------------------------------------\n\n  std::function< double( const PersistenceDiagram&, const PersistenceDiagram&, double ) > functor\n    = !useIndicatorFunctionDistance ? useWassersteinDistance ? [] ( const PersistenceDiagram& D1, const PersistenceDiagram& D2, double p )\n                                                               {\n                                                                 return aleph::distances::wassersteinDistance( D1, D2, p );\n                                                               }\n                                                             : [] ( const PersistenceDiagram& D1, const PersistenceDiagram& D2, double p )\n                                                               {\n                                                                 return std::pow( aleph::distances::hausdorffDistance( D1, D2 ), p );\n                                                               }\n                                    : [] ( const PersistenceDiagram&, const PersistenceDiagram&, double )\n                                    {\n                                      return 0.0;\n                                    };\n\n  \/\/ Calculate all distances -------------------------------------------\n\n  std::vector< std::vector<double> > distances;\n  distances.resize( dataSets.size(), std::vector<double>( dataSets.size() ) );\n\n  #pragma omp parallel for collapse(2)\n  for( std::size_t row = 0; row < dataSets.size(); row++ )\n  {\n    for( std::size_t col = 0; col < dataSets.size(); col++ )\n    {\n      if( row <= col )\n        continue;\n\n      double d = 0.0;\n\n      if( useIndicatorFunctionDistance )\n        d = distancePIF( dataSets.at(row), dataSets.at(col), minDimension, maxDimension, power );\n      else\n        d = persistenceDiagramDistance( dataSets.at(row), dataSets.at(col), minDimension, maxDimension, power, functor );\n\n      distances[row][col] = d;\n      distances[col][row] = d;\n    }\n  }\n\n  std::cerr << \"Storing matrix...\";\n\n  storeMatrix( distances, std::cout );\n\n  std::cerr << \"finished\\n\";\n}\n<|endoftext|>"}
{"text":"<commit_before>\/***************************************************************************\r\n *   Copyright (c) 2006 Werner Mayer <wmayer[at]users.sourceforge.net>     *\r\n *                                                                         *\r\n *   This file is part of the FreeCAD CAx development system.              *\r\n *                                                                         *\r\n *   This library is free software; you can redistribute it and\/or         *\r\n *   modify it under the terms of the GNU Library General Public           *\r\n *   License as published by the Free Software Foundation; either          *\r\n *   version 2 of the License, or (at your option) any later version.      *\r\n *                                                                         *\r\n *   This library  is distributed in the hope that it will be useful,      *\r\n *   but WITHOUT ANY WARRANTY; without even the implied warranty of        *\r\n *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the         *\r\n *   GNU Library General Public License for more details.                  *\r\n *                                                                         *\r\n *   You should have received a copy of the GNU Library General Public     *\r\n *   License along with this library; see the file COPYING.LIB. If not,    *\r\n *   write to the Free Software Foundation, Inc., 59 Temple Place,         *\r\n *   Suite 330, Boston, MA  02111-1307, USA                                *\r\n *                                                                         *\r\n ***************************************************************************\/\r\n\r\n#include \"PreCompiled.h\"\r\n#ifndef _PreComp_\r\n# include <QIcon>\r\n# include <QImage>\r\n# include <sstream>\r\n#endif\r\n\r\n#include \"DrawingView.h\"\r\n#include <Mod\/Drawing\/App\/FeaturePage.h>\r\n\r\n#include <Base\/Console.h>\r\n#include <Base\/Exception.h>\r\n#include <Base\/FileInfo.h>\r\n#include <Base\/Stream.h>\r\n#include <App\/Application.h>\r\n#include <App\/DocumentObjectPy.h>\r\n#include <Gui\/MainWindow.h>\r\n#include <Gui\/BitmapFactory.h>\r\n\r\nusing namespace DrawingGui;\r\n\r\n\r\n\/* module functions *\/\r\nstatic PyObject * \r\nopen(PyObject *self, PyObject *args) \r\n{\r\n    const char* Name;\r\n    if (!PyArg_ParseTuple(args, \"s\",&Name))\r\n        return NULL; \r\n    \r\n    PY_TRY {\r\n        Base::FileInfo file(Name);\r\n        if (file.hasExtension(\"svg\") || file.hasExtension(\"svgz\")) {\r\n            QString fileName = QString::fromUtf8(Name);\r\n            \/\/ Displaying the image in a view\r\n            DrawingView* view = new DrawingView(0, Gui::getMainWindow());\r\n            view->load(fileName);\r\n            view->setWindowIcon(Gui::BitmapFactory().pixmap(\"actions\/drawing-landscape\"));\r\n            view->setWindowTitle(QObject::tr(\"Drawing viewer\"));\r\n            view->resize( 400, 300 );\r\n            Gui::getMainWindow()->addWindow(view);\r\n        }\r\n        else {\r\n            PyErr_SetString(PyExc_Exception, \"unknown filetype\");\r\n            return NULL;\r\n        }\r\n    } PY_CATCH;\r\n\r\n    Py_Return; \r\n}\r\n\r\n\/* module functions *\/\r\nstatic PyObject *\r\nimporter(PyObject *self, PyObject *args)\r\n{\r\n    const char* Name;\r\n    const char* dummy;\r\n    if (!PyArg_ParseTuple(args, \"s|s\",&Name,&dummy))\r\n        return NULL; \r\n    \r\n    PY_TRY {\r\n        Base::FileInfo file(Name);\r\n        if (file.hasExtension(\"svg\") || file.hasExtension(\"svgz\")) {\r\n            QString fileName = QString::fromUtf8(Name);\r\n            \/\/ Displaying the image in a view\r\n            DrawingView* view = new DrawingView(0, Gui::getMainWindow());\r\n            view->load(fileName);\r\n            view->setWindowIcon(Gui::BitmapFactory().pixmap(\"actions\/drawing-landscape\"));\r\n            view->setWindowTitle(QObject::tr(\"Drawing viewer\"));\r\n            view->resize( 400, 300 );\r\n            Gui::getMainWindow()->addWindow(view);\r\n        } else {\r\n            PyErr_SetString(PyExc_Exception, \"unknown filetype\");\r\n            return NULL;\r\n        }\r\n    } PY_CATCH;\r\n\r\n    Py_Return; \r\n}\r\n\r\nstatic PyObject * \r\nexporter(PyObject *self, PyObject *args)\r\n{\r\n    PyObject* object;\r\n    const char* filename;\r\n    if (!PyArg_ParseTuple(args, \"Os\",&object,&filename))\r\n        return NULL;\r\n\r\n    PY_TRY {\r\n        Py::List list(object);\r\n        for (Py::List::iterator it = list.begin(); it != list.end(); ++it) {\r\n            PyObject* item = (*it).ptr();\r\n            if (PyObject_TypeCheck(item, &(App::DocumentObjectPy::Type))) {\r\n                App::DocumentObject* obj = static_cast<App::DocumentObjectPy*>(item)->getDocumentObjectPtr();\r\n                if (obj->getTypeId().isDerivedFrom(Drawing::FeaturePage::getClassTypeId())) {\r\n                    std::string fn = static_cast<Drawing::FeaturePage*>(obj)->PageResult.getValue();\r\n                    Base::FileInfo fi_in(fn);\r\n                    Base::ifstream str_in(fi_in, std::ios::in | std::ios::binary);\r\n                    if (!str_in) {\r\n                        std::stringstream str;\r\n                        str << \"Cannot open file '\" << fn << \"' for reading\";\r\n                        PyErr_SetString(PyExc_IOError, str.str().c_str());\r\n                        return NULL;\r\n                    }\r\n\r\n                    Base::FileInfo fi_out(filename);\r\n                    Base::ofstream str_out(fi_out, std::ios::out | std::ios::binary);\r\n                    if (!str_out) {\r\n                        std::stringstream str;\r\n                        str << \"Cannot open file '\" << filename << \"' for writing\";\r\n                        PyErr_SetString(PyExc_IOError, str.str().c_str());\r\n                        return NULL;\r\n                    }\r\n\r\n                    str_in >> str_out.rdbuf();\r\n                    str_in.close();\r\n                    str_out.close();\r\n                    break;\r\n                }\r\n            }\r\n        }\r\n    } PY_CATCH;\r\n\r\n    Py_Return;\r\n}\r\n\r\n\/* registration table  *\/\r\nstruct PyMethodDef DrawingGui_Import_methods[] = {\r\n    {\"open\"     ,open ,     METH_VARARGS}, \/* method name, C func ptr, always-tuple *\/\r\n    {\"insert\"   ,importer,  METH_VARARGS},\r\n    {\"export\"   ,exporter,  METH_VARARGS},\r\n    {NULL, NULL}                    \/* end of table marker *\/\r\n};\r\n<commit_msg>Raise exception in Drawing module for unsupported objects<commit_after>\/***************************************************************************\r\n *   Copyright (c) 2006 Werner Mayer <wmayer[at]users.sourceforge.net>     *\r\n *                                                                         *\r\n *   This file is part of the FreeCAD CAx development system.              *\r\n *                                                                         *\r\n *   This library is free software; you can redistribute it and\/or         *\r\n *   modify it under the terms of the GNU Library General Public           *\r\n *   License as published by the Free Software Foundation; either          *\r\n *   version 2 of the License, or (at your option) any later version.      *\r\n *                                                                         *\r\n *   This library  is distributed in the hope that it will be useful,      *\r\n *   but WITHOUT ANY WARRANTY; without even the implied warranty of        *\r\n *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the         *\r\n *   GNU Library General Public License for more details.                  *\r\n *                                                                         *\r\n *   You should have received a copy of the GNU Library General Public     *\r\n *   License along with this library; see the file COPYING.LIB. If not,    *\r\n *   write to the Free Software Foundation, Inc., 59 Temple Place,         *\r\n *   Suite 330, Boston, MA  02111-1307, USA                                *\r\n *                                                                         *\r\n ***************************************************************************\/\r\n\r\n#include \"PreCompiled.h\"\r\n#ifndef _PreComp_\r\n# include <QIcon>\r\n# include <QImage>\r\n# include <sstream>\r\n#endif\r\n\r\n#include \"DrawingView.h\"\r\n#include <Mod\/Drawing\/App\/FeaturePage.h>\r\n\r\n#include <Base\/Console.h>\r\n#include <Base\/Exception.h>\r\n#include <Base\/FileInfo.h>\r\n#include <Base\/Stream.h>\r\n#include <App\/Application.h>\r\n#include <App\/DocumentObjectPy.h>\r\n#include <Gui\/MainWindow.h>\r\n#include <Gui\/BitmapFactory.h>\r\n\r\nusing namespace DrawingGui;\r\n\r\n\r\n\/* module functions *\/\r\nstatic PyObject * \r\nopen(PyObject *self, PyObject *args) \r\n{\r\n    const char* Name;\r\n    if (!PyArg_ParseTuple(args, \"s\",&Name))\r\n        return NULL; \r\n    \r\n    PY_TRY {\r\n        Base::FileInfo file(Name);\r\n        if (file.hasExtension(\"svg\") || file.hasExtension(\"svgz\")) {\r\n            QString fileName = QString::fromUtf8(Name);\r\n            \/\/ Displaying the image in a view\r\n            DrawingView* view = new DrawingView(0, Gui::getMainWindow());\r\n            view->load(fileName);\r\n            view->setWindowIcon(Gui::BitmapFactory().pixmap(\"actions\/drawing-landscape\"));\r\n            view->setWindowTitle(QObject::tr(\"Drawing viewer\"));\r\n            view->resize( 400, 300 );\r\n            Gui::getMainWindow()->addWindow(view);\r\n        }\r\n        else {\r\n            PyErr_SetString(PyExc_Exception, \"unknown filetype\");\r\n            return NULL;\r\n        }\r\n    } PY_CATCH;\r\n\r\n    Py_Return; \r\n}\r\n\r\n\/* module functions *\/\r\nstatic PyObject *\r\nimporter(PyObject *self, PyObject *args)\r\n{\r\n    const char* Name;\r\n    const char* dummy;\r\n    if (!PyArg_ParseTuple(args, \"s|s\",&Name,&dummy))\r\n        return NULL; \r\n    \r\n    PY_TRY {\r\n        Base::FileInfo file(Name);\r\n        if (file.hasExtension(\"svg\") || file.hasExtension(\"svgz\")) {\r\n            QString fileName = QString::fromUtf8(Name);\r\n            \/\/ Displaying the image in a view\r\n            DrawingView* view = new DrawingView(0, Gui::getMainWindow());\r\n            view->load(fileName);\r\n            view->setWindowIcon(Gui::BitmapFactory().pixmap(\"actions\/drawing-landscape\"));\r\n            view->setWindowTitle(QObject::tr(\"Drawing viewer\"));\r\n            view->resize( 400, 300 );\r\n            Gui::getMainWindow()->addWindow(view);\r\n        } else {\r\n            PyErr_SetString(PyExc_Exception, \"unknown filetype\");\r\n            return NULL;\r\n        }\r\n    } PY_CATCH;\r\n\r\n    Py_Return; \r\n}\r\n\r\nstatic PyObject * \r\nexporter(PyObject *self, PyObject *args)\r\n{\r\n    PyObject* object;\r\n    const char* filename;\r\n    if (!PyArg_ParseTuple(args, \"Os\",&object,&filename))\r\n        return NULL;\r\n\r\n    PY_TRY {\r\n        Py::List list(object);\r\n        for (Py::List::iterator it = list.begin(); it != list.end(); ++it) {\r\n            PyObject* item = (*it).ptr();\r\n            if (PyObject_TypeCheck(item, &(App::DocumentObjectPy::Type))) {\r\n                App::DocumentObject* obj = static_cast<App::DocumentObjectPy*>(item)->getDocumentObjectPtr();\r\n                if (obj->getTypeId().isDerivedFrom(Drawing::FeaturePage::getClassTypeId())) {\r\n                    std::string fn = static_cast<Drawing::FeaturePage*>(obj)->PageResult.getValue();\r\n                    Base::FileInfo fi_in(fn);\r\n                    Base::ifstream str_in(fi_in, std::ios::in | std::ios::binary);\r\n                    if (!str_in) {\r\n                        std::stringstream str;\r\n                        str << \"Cannot open file '\" << fn << \"' for reading\";\r\n                        PyErr_SetString(PyExc_IOError, str.str().c_str());\r\n                        return NULL;\r\n                    }\r\n\r\n                    Base::FileInfo fi_out(filename);\r\n                    Base::ofstream str_out(fi_out, std::ios::out | std::ios::binary);\r\n                    if (!str_out) {\r\n                        std::stringstream str;\r\n                        str << \"Cannot open file '\" << filename << \"' for writing\";\r\n                        PyErr_SetString(PyExc_IOError, str.str().c_str());\r\n                        return NULL;\r\n                    }\r\n\r\n                    str_in >> str_out.rdbuf();\r\n                    str_in.close();\r\n                    str_out.close();\r\n                    break;\r\n                }\r\n                else {\r\n                    PyErr_SetString(PyExc_TypeError, \"Export as SVG of this object type is not supported by Drawing module\");\r\n                    return 0;\r\n                }\r\n            }\r\n        }\r\n    } PY_CATCH;\r\n\r\n    Py_Return;\r\n}\r\n\r\n\/* registration table  *\/\r\nstruct PyMethodDef DrawingGui_Import_methods[] = {\r\n    {\"open\"     ,open ,     METH_VARARGS}, \/* method name, C func ptr, always-tuple *\/\r\n    {\"insert\"   ,importer,  METH_VARARGS},\r\n    {\"export\"   ,exporter,  METH_VARARGS},\r\n    {NULL, NULL}                    \/* end of table marker *\/\r\n};\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* Copyright (C) 2008-2014 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 \"abstractfinder.h\"\n#include <QPropertyAnimation>\n#include <QStylePainter>\n#include <QStyleOption>\n#include <QApplication>\n#include <QHBoxLayout>\n#include <QKeyEvent>\n#include <QEvent>\n\nAbstractFinder::AbstractFinder(QWidget* parent) : QWidget(parent)\n{\n    d.offset = -1;\n    d.error = false;\n\n    parent->installEventFilter(this);\n\n    d.lineEdit = new QLineEdit(this);\n    d.lineEdit->setAttribute(Qt::WA_MacShowFocusRect, false);\n    d.lineEdit->setSizePolicy(QSizePolicy::Expanding, QSizePolicy::Fixed);\n\n    d.prevButton = new QToolButton(this);\n    d.prevButton->setObjectName(\"prev\");\n    d.prevButton->setSizePolicy(QSizePolicy::Maximum, QSizePolicy::Preferred);\n    connect(d.prevButton, SIGNAL(clicked()), this, SLOT(findPrevious()));\n\n    d.nextButton = new QToolButton(this);\n    d.nextButton->setObjectName(\"next\");\n    d.nextButton->setSizePolicy(QSizePolicy::Maximum, QSizePolicy::Preferred);\n    connect(d.nextButton, SIGNAL(clicked()), this, SLOT(findNext()));\n\n    QHBoxLayout* layout = new QHBoxLayout(this);\n    layout->addWidget(d.lineEdit);\n    layout->addWidget(d.prevButton);\n    layout->addWidget(d.nextButton);\n    layout->setSpacing(0);\n    layout->setMargin(0);\n\n    connect(d.lineEdit, SIGNAL(returnPressed()), this, SIGNAL(returnPressed()));\n    connect(d.lineEdit, SIGNAL(textEdited(QString)), this, SLOT(find(QString)));\n}\n\nAbstractFinder::~AbstractFinder()\n{\n    emit destroyed(this);\n}\n\nQString AbstractFinder::text() const\n{\n    return d.lineEdit->text();\n}\n\nvoid AbstractFinder::setText(const QString& text)\n{\n    d.lineEdit->setText(text);\n}\n\nint AbstractFinder::offset() const\n{\n    return d.offset;\n}\n\nvoid AbstractFinder::setOffset(int offset)\n{\n    d.offset = offset;\n    relocate();\n}\n\nbool AbstractFinder::hasError() const\n{\n    return d.error;\n}\n\nvoid AbstractFinder::setError(bool error)\n{\n    if (d.error != error) {\n        d.error = error;\n        \/\/ force restyle\n        setStyleSheet(QString());\n        d.lineEdit->setStyleSheet(QString());\n        d.nextButton->setEnabled(!error);\n        d.prevButton->setEnabled(!error);\n    }\n}\n\nbool AbstractFinder::eventFilter(QObject* object, QEvent* event)\n{\n    Q_UNUSED(object);\n    if (event->type() == QEvent::Resize)\n        relocate();\n    return false;\n}\n\nvoid AbstractFinder::findNext()\n{\n    find(d.lineEdit->text(), true, false, false);\n}\n\nvoid AbstractFinder::findPrevious()\n{\n    find(d.lineEdit->text(), false, true, false);\n}\n\nvoid AbstractFinder::doFind()\n{\n    setFixedHeight(d.lineEdit->sizeHint().height() + 1);\n    setOffset(-sizeHint().height());\n    relocate();\n    animateShow();\n    reFind();\n}\n\nvoid AbstractFinder::reFind()\n{\n    d.lineEdit->setFocus(Qt::ShortcutFocusReason);\n    d.lineEdit->selectAll();\n}\n\nvoid AbstractFinder::animateShow()\n{\n    QPropertyAnimation *animation = new QPropertyAnimation(this, \"offset\");\n    animation->setDuration(50);\n    animation->setEndValue(-1);\n    animation->start(QAbstractAnimation::DeleteWhenStopped);\n    setVisible(true);\n}\n\nvoid AbstractFinder::animateHide()\n{\n    QPropertyAnimation *animation = new QPropertyAnimation(this, \"offset\");\n    animation->setDuration(50);\n    animation->setEndValue(-sizeHint().height());\n    animation->start(QAbstractAnimation::DeleteWhenStopped);\n    connect(animation, SIGNAL(destroyed()), this, SLOT(hide()));\n    connect(animation, SIGNAL(destroyed()), this, SLOT(deleteLater()));\n}\n<commit_msg>Make the search boxes slightly transparent<commit_after>\/*\n* Copyright (C) 2008-2014 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 \"abstractfinder.h\"\n#include <QPropertyAnimation>\n#include <QGraphicsOpacityEffect>\n#include <QStylePainter>\n#include <QStyleOption>\n#include <QApplication>\n#include <QHBoxLayout>\n#include <QKeyEvent>\n#include <QEvent>\n\nAbstractFinder::AbstractFinder(QWidget* parent) : QWidget(parent)\n{\n    d.offset = -1;\n    d.error = false;\n\n    parent->installEventFilter(this);\n    setGraphicsEffect(new QGraphicsOpacityEffect(this));\n\n    d.lineEdit = new QLineEdit(this);\n    d.lineEdit->setAttribute(Qt::WA_MacShowFocusRect, false);\n    d.lineEdit->setSizePolicy(QSizePolicy::Expanding, QSizePolicy::Fixed);\n\n    d.prevButton = new QToolButton(this);\n    d.prevButton->setObjectName(\"prev\");\n    d.prevButton->setSizePolicy(QSizePolicy::Maximum, QSizePolicy::Preferred);\n    connect(d.prevButton, SIGNAL(clicked()), this, SLOT(findPrevious()));\n\n    d.nextButton = new QToolButton(this);\n    d.nextButton->setObjectName(\"next\");\n    d.nextButton->setSizePolicy(QSizePolicy::Maximum, QSizePolicy::Preferred);\n    connect(d.nextButton, SIGNAL(clicked()), this, SLOT(findNext()));\n\n    QHBoxLayout* layout = new QHBoxLayout(this);\n    layout->addWidget(d.lineEdit);\n    layout->addWidget(d.prevButton);\n    layout->addWidget(d.nextButton);\n    layout->setSpacing(0);\n    layout->setMargin(0);\n\n    connect(d.lineEdit, SIGNAL(returnPressed()), this, SIGNAL(returnPressed()));\n    connect(d.lineEdit, SIGNAL(textEdited(QString)), this, SLOT(find(QString)));\n}\n\nAbstractFinder::~AbstractFinder()\n{\n    emit destroyed(this);\n}\n\nQString AbstractFinder::text() const\n{\n    return d.lineEdit->text();\n}\n\nvoid AbstractFinder::setText(const QString& text)\n{\n    d.lineEdit->setText(text);\n}\n\nint AbstractFinder::offset() const\n{\n    return d.offset;\n}\n\nvoid AbstractFinder::setOffset(int offset)\n{\n    d.offset = offset;\n    relocate();\n}\n\nbool AbstractFinder::hasError() const\n{\n    return d.error;\n}\n\nvoid AbstractFinder::setError(bool error)\n{\n    if (d.error != error) {\n        d.error = error;\n        \/\/ force restyle\n        setStyleSheet(QString());\n        d.lineEdit->setStyleSheet(QString());\n        d.nextButton->setEnabled(!error);\n        d.prevButton->setEnabled(!error);\n    }\n}\n\nbool AbstractFinder::eventFilter(QObject* object, QEvent* event)\n{\n    Q_UNUSED(object);\n    if (event->type() == QEvent::Resize)\n        relocate();\n    return false;\n}\n\nvoid AbstractFinder::findNext()\n{\n    find(d.lineEdit->text(), true, false, false);\n}\n\nvoid AbstractFinder::findPrevious()\n{\n    find(d.lineEdit->text(), false, true, false);\n}\n\nvoid AbstractFinder::doFind()\n{\n    setFixedHeight(d.lineEdit->sizeHint().height() + 1);\n    setOffset(-sizeHint().height());\n    relocate();\n    animateShow();\n    reFind();\n}\n\nvoid AbstractFinder::reFind()\n{\n    d.lineEdit->setFocus(Qt::ShortcutFocusReason);\n    d.lineEdit->selectAll();\n}\n\nvoid AbstractFinder::animateShow()\n{\n    QPropertyAnimation *animation = new QPropertyAnimation(this, \"offset\");\n    animation->setDuration(50);\n    animation->setEndValue(-1);\n    animation->start(QAbstractAnimation::DeleteWhenStopped);\n    setVisible(true);\n}\n\nvoid AbstractFinder::animateHide()\n{\n    QPropertyAnimation *animation = new QPropertyAnimation(this, \"offset\");\n    animation->setDuration(50);\n    animation->setEndValue(-sizeHint().height());\n    animation->start(QAbstractAnimation::DeleteWhenStopped);\n    connect(animation, SIGNAL(destroyed()), this, SLOT(hide()));\n    connect(animation, SIGNAL(destroyed()), this, SLOT(deleteLater()));\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2007 The Hewlett-Packard Development Company\n * All rights reserved.\n *\n * The license below extends only to copyright in the software and shall\n * not be construed as granting a license to any other intellectual\n * property including but not limited to intellectual property relating\n * to a hardware implementation of the functionality of the software\n * licensed hereunder.  You may use the software subject to the license\n * terms below provided that you ensure that this notice is replicated\n * unmodified and in its entirety in all distributions of the software,\n * modified or unmodified, in source code or in binary form.\n *\n * 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_X86_INSTS_MICROLDSTOP_HH__\n#define __ARCH_X86_INSTS_MICROLDSTOP_HH__\n\n#include \"arch\/x86\/insts\/microop.hh\"\n#include \"mem\/packet.hh\"\n#include \"mem\/request.hh\"\n#include \"sim\/faults.hh\"\n\nnamespace X86ISA\n{\n    const Request::FlagsType SegmentFlagMask = mask(4);\n    const int FlagShift = 4;\n    enum FlagBit {\n        CPL0FlagBit = 1,\n        AddrSizeFlagBit = 2,\n        StoreCheck = 4\n    };\n\n    \/**\n     * Base class for load and store ops\n     *\/\n    class LdStOp : public X86MicroopBase\n    {\n      protected:\n        const uint8_t scale;\n        const RegIndex index;\n        const RegIndex base;\n        const uint64_t disp;\n        const uint8_t segment;\n        const RegIndex data;\n        const uint8_t dataSize;\n        const uint8_t addressSize;\n        const Request::FlagsType memFlags;\n        RegIndex foldOBit, foldABit;\n\n        \/\/Constructor\n        LdStOp(ExtMachInst _machInst,\n                const char * mnem, const char * _instMnem,\n                uint64_t setFlags,\n                uint8_t _scale, InstRegIndex _index, InstRegIndex _base,\n                uint64_t _disp, InstRegIndex _segment,\n                InstRegIndex _data,\n                uint8_t _dataSize, uint8_t _addressSize,\n                Request::FlagsType _memFlags,\n                OpClass __opClass) :\n        X86MicroopBase(machInst, mnem, _instMnem, setFlags, __opClass),\n                scale(_scale), index(_index.idx), base(_base.idx),\n                disp(_disp), segment(_segment.idx),\n                data(_data.idx),\n                dataSize(_dataSize), addressSize(_addressSize),\n                memFlags(_memFlags | _segment.idx)\n        {\n            assert(_segment.idx < NUM_SEGMENTREGS);\n            foldOBit = (dataSize == 1 && !_machInst.rex.present) ? 1 << 6 : 0;\n            foldABit =\n                (addressSize == 1 && !_machInst.rex.present) ? 1 << 6 : 0;\n        }\n\n        std::string generateDisassembly(Addr pc,\n            const SymbolTable *symtab) const;\n    };\n}\n\n#endif \/\/__ARCH_X86_INSTS_MICROLDSTOP_HH__\n<commit_msg>X86: Fix a tiny typo in the load\/store microop constructor.<commit_after>\/*\n * Copyright (c) 2007 The Hewlett-Packard Development Company\n * All rights reserved.\n *\n * The license below extends only to copyright in the software and shall\n * not be construed as granting a license to any other intellectual\n * property including but not limited to intellectual property relating\n * to a hardware implementation of the functionality of the software\n * licensed hereunder.  You may use the software subject to the license\n * terms below provided that you ensure that this notice is replicated\n * unmodified and in its entirety in all distributions of the software,\n * modified or unmodified, in source code or in binary form.\n *\n * 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_X86_INSTS_MICROLDSTOP_HH__\n#define __ARCH_X86_INSTS_MICROLDSTOP_HH__\n\n#include \"arch\/x86\/insts\/microop.hh\"\n#include \"mem\/packet.hh\"\n#include \"mem\/request.hh\"\n#include \"sim\/faults.hh\"\n\nnamespace X86ISA\n{\n    const Request::FlagsType SegmentFlagMask = mask(4);\n    const int FlagShift = 4;\n    enum FlagBit {\n        CPL0FlagBit = 1,\n        AddrSizeFlagBit = 2,\n        StoreCheck = 4\n    };\n\n    \/**\n     * Base class for load and store ops\n     *\/\n    class LdStOp : public X86MicroopBase\n    {\n      protected:\n        const uint8_t scale;\n        const RegIndex index;\n        const RegIndex base;\n        const uint64_t disp;\n        const uint8_t segment;\n        const RegIndex data;\n        const uint8_t dataSize;\n        const uint8_t addressSize;\n        const Request::FlagsType memFlags;\n        RegIndex foldOBit, foldABit;\n\n        \/\/Constructor\n        LdStOp(ExtMachInst _machInst,\n                const char * mnem, const char * _instMnem,\n                uint64_t setFlags,\n                uint8_t _scale, InstRegIndex _index, InstRegIndex _base,\n                uint64_t _disp, InstRegIndex _segment,\n                InstRegIndex _data,\n                uint8_t _dataSize, uint8_t _addressSize,\n                Request::FlagsType _memFlags,\n                OpClass __opClass) :\n        X86MicroopBase(_machInst, mnem, _instMnem, setFlags, __opClass),\n                scale(_scale), index(_index.idx), base(_base.idx),\n                disp(_disp), segment(_segment.idx),\n                data(_data.idx),\n                dataSize(_dataSize), addressSize(_addressSize),\n                memFlags(_memFlags | _segment.idx)\n        {\n            assert(_segment.idx < NUM_SEGMENTREGS);\n            foldOBit = (dataSize == 1 && !_machInst.rex.present) ? 1 << 6 : 0;\n            foldABit =\n                (addressSize == 1 && !_machInst.rex.present) ? 1 << 6 : 0;\n        }\n\n        std::string generateDisassembly(Addr pc,\n            const SymbolTable *symtab) const;\n    };\n}\n\n#endif \/\/__ARCH_X86_INSTS_MICROLDSTOP_HH__\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\r\n#include <string>\r\n#include <memory>\r\n\r\n#include \"WatchdogNotif.h\"\r\n#include \"DeleteNotif.h\"\r\n#include \"AchievementNotif.h\"\r\n#include \"UriNotif.h\"\r\n\r\n#include <vector>\r\n#include <memory>\r\n\r\nint main()\r\n{   \r\n    std::vector<std::string> google_ids;\r\n    google_ids.push_back(\"f6MPWjr144I:APA91bE4_2j9YKMGD5iLiB5jn8UkcGWEfv3zOqcYWScYc7FflpNXuK9tW78hrfvwMdsBV0O97Kk_98ML2ml7tk3L63aZs2eIEApHRsoO5nRNUvJbgXOn0-WJ4COrdgawkn0TT0TwVR7R\");\r\n    \r\n    int user_id = 9509;\r\n    int notif_id = 8584;\r\n    long timestamp = 1458737981;\r\n    std::string message = \"Testovaci URI notifikace.\";\r\n    std::string uri = \"www.google.cz\";\r\n\r\n    std::shared_ptr<Notification> advert = std::make_shared<UriNotif>(user_id, notif_id, timestamp, message, uri);\r\n\r\n    advert->sendGcm(&google_ids);\r\n\r\n\r\n    \/\/ids.push_back(\"APA91bF-u3AZ3bNl6jehq19oEhbVFGEaA_4x3jlzMtKwHzlakRcE9K_H_Rk8YuNSjp1K62dz-_sL09iQjlH8Z3JTsxbg1VbV_Gch0YhTuOg3U1bCib7pk4Xg4rHPeUrICiQ74RIB3qXxTjmTCeLBZor_Tr3pLuATUw\");\r\n    \/*\r\n    Notification *notif = new WatchdogNotif(\r\n        9509,                    \/\/ user ID (MrMaidx -> Martin Novak)\r\n        9999,                  \/\/ message (notification) ID\r\n        1458735373,        \/\/ timestamp (ms)\r\n        \"Test notifikace watchdog.\",   \/\/ message\r\n        4321,                  \/\/ adadpter ID\r\n        \"\",               \/\/ sensor ID\r\n        10,                  \/\/ sensor type\r\n        3);                   \/\/ rule ID\r\n    \r\n    notif->sendGcm(&ids);\r\n    *\/\r\n \/*\r\n    sleep(5);   \r\n\r\n    Notification *notif2 = new DeleteNotif(\r\n        8,\r\n        2,\r\n        45,\r\n        0);\r\n\r\n    notif2->sendGcm(&ids);\r\n   *\/ \r\n    \/*\r\n    if (notif->saveToDb()) {\r\n      cout << endl << \"########   SAVING TO DATABASE ############\" << endl;\r\n      int userId = notif->getUserId();\r\n      long timestamp = notif->getTime();\r\n      int notificationId = notif->getId();\r\n      int level = notif->getLevel();\r\n      string name = notif->getName();\r\n      cout << notif->getDbXml() << endl;\r\n    }\r\n*\/\r\n    \/*\r\n    Notification *notif2 = new AchievementNotif(\r\n        8,                  \/\/ user ID\r\n        123,                \/\/ message (notification) ID\r\n        1418220573673,      \/\/ timestamp (ms)\r\n        1                   \/\/ achievement ID\r\n        );\r\n\r\n    notif2->sendGcm(&ids);\r\n*\/\r\n    \/\/delete(notif);\r\n  \r\n    return 0;\r\n}\r\n<commit_msg>I don't think I will make it work...<commit_after>#include <iostream>\r\n#include <string>\r\n#include <memory>\r\n\r\n#include \"WatchdogNotif.h\"\r\n#include \"DeleteNotif.h\"\r\n#include \"AchievementNotif.h\"\r\n#include \"UriNotif.h\"\r\n\r\n#include <vector>\r\n#include <memory>\r\n\r\nint main()\r\n{   \r\n\r\n\r\n    std::vector<std::string> service_reference_ids;\r\n    service_reference_ids.push_back(\"f6MPWjr144I:APA91bE4_2j9YKMGD5iLiB5jn8UkcGWEfv3zOqcYWScYc7FflpNXuK9tW78hrfvwMdsBV0O97Kk_98ML2ml7tk3L63aZs2eIEApHRsoO5nRNUvJbgXOn0-WJ4COrdgawkn0TT0TwVR7R\");\r\n    \r\n\r\n    int user_id = 9509;\r\n    int notif_id = 8584;\r\n    long timestamp = 1458737981;\r\n    std::string message = \"Testovaci URI notifikace.\";\r\n    std::string uri = \"www.google.cz\";\r\n\r\n    \/\/std::shared_ptr<Notification> advert = std::make_shared<UriNotif>(user_id, notif_id, timestamp, message, uri);\r\n\r\n    \/\/advert->sendGcm(&service_reference_ids);\r\n\r\n\r\n    \/\/ids.push_back(\"APA91bF-u3AZ3bNl6jehq19oEhbVFGEaA_4x3jlzMtKwHzlakRcE9K_H_Rk8YuNSjp1K62dz-_sL09iQjlH8Z3JTsxbg1VbV_Gch0YhTuOg3U1bCib7pk4Xg4rHPeUrICiQ74RIB3qXxTjmTCeLBZor_Tr3pLuATUw\");\r\n    \r\n    Notification *notif = new WatchdogNotif(\r\n        9509,                    \/\/ user ID (MrMaidx -> Martin Novak)\r\n        9999,                  \/\/ message (notification) ID\r\n        timestamp,        \/\/ timestamp (ms)\r\n        \"Test notifikace watchdog.\",   \/\/ message\r\n        4321,                  \/\/ adadpter ID\r\n        \"\",               \/\/ sensor ID\r\n        10,                  \/\/ sensor type\r\n        3);                   \/\/ rule ID\r\n    \r\n    notif->sendGcm(&service_reference_ids);\r\n    \r\n \/*\r\n    sleep(5);   \r\n\r\n    Notification *notif2 = new DeleteNotif(\r\n        8,\r\n        2,\r\n        45,\r\n        0);\r\n\r\n    notif2->sendGcm(&ids);\r\n   *\/ \r\n    \/*\r\n    if (notif->saveToDb()) {\r\n      cout << endl << \"########   SAVING TO DATABASE ############\" << endl;\r\n      int userId = notif->getUserId();\r\n      long timestamp = notif->getTime();\r\n      int notificationId = notif->getId();\r\n      int level = notif->getLevel();\r\n      string name = notif->getName();\r\n      cout << notif->getDbXml() << endl;\r\n    }\r\n*\/\r\n    \/*\r\n    Notification *notif2 = new AchievementNotif(\r\n        8,                  \/\/ user ID\r\n        123,                \/\/ message (notification) ID\r\n        1418220573673,      \/\/ timestamp (ms)\r\n        1                   \/\/ achievement ID\r\n        );\r\n\r\n    notif2->sendGcm(&ids);\r\n*\/\r\n    \/\/delete(notif);\r\n  \r\n    return 0;\r\n}\r\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 <iostream>\n\n#include <Engine\/Network\/NetworkEditorController.h>\n\n#include <Core\/Dataflow\/Network\/Connection.h>\n#include <Core\/Dataflow\/Network\/Network.h>\n#include <Core\/Dataflow\/Network\/ModuleDescription.h>\n#include <Core\/Dataflow\/Network\/Module.h>\n#include <Core\/Serialization\/Network\/NetworkXMLSerializer.h>\n#include <Engine\/Scheduler\/BoostGraphSerialScheduler.h>\n#include <Engine\/Scheduler\/LinearSerialNetworkExecutor.h>\n\nusing namespace SCIRun;\nusing namespace SCIRun::Engine;\nusing namespace SCIRun::Domain::Networks;\n\nNetworkEditorController::NetworkEditorController(ModuleFactoryHandle mf, ModuleStateFactoryHandle sf) : moduleFactory_(mf), stateFactory_(sf)\n{\n  \/\/TODO should this class own or just keep a reference?\n  theNetwork_.reset(new Network(mf, sf));\n}\n\nNetworkEditorController::NetworkEditorController(SCIRun::Domain::Networks::NetworkHandle network)\n  : theNetwork_(network)\n{\n}\n\nModuleHandle NetworkEditorController::addModule(const std::string& moduleName)\n{\n  \/\/TODO: should pass in entire info struct\n  ModuleLookupInfo info;\n  info.module_name_ = moduleName;\n  ModuleHandle realModule = theNetwork_->add_module(info);\n  \/*emit*\/ moduleAdded_(moduleName, realModule);\n  printNetwork();\n  return realModule;\n}\n\nvoid NetworkEditorController::removeModule(const std::string& id)\n{\n  \/\/before or after?\n  \/*emit*\/ moduleRemoved_(id);\n  theNetwork_->remove_module(id);\n  printNetwork();\n}\n\nvoid NetworkEditorController::printNetwork() const\n{\n  if (theNetwork_)\n    std::cout << theNetwork_->toString() << std::endl;\n}\n\nvoid NetworkEditorController::addConnection(const SCIRun::Domain::Networks::ConnectionDescription& desc)\n{\n  ConnectionId id = theNetwork_->connect(theNetwork_->lookupModule(desc.moduleId1_), desc.port1_, theNetwork_->lookupModule(desc.moduleId2_), desc.port2_);\n  if (!id.id_.empty())\n    connectionAdded_(id);\n  printNetwork();\n}\n\nvoid NetworkEditorController::removeConnection(const ConnectionId& id)\n{\n  theNetwork_->disconnect(id);\n  printNetwork();\n}\n\nboost::signals2::connection NetworkEditorController::connectModuleAdded(const ModuleAddedSignalType::slot_type& subscriber)\n{\n  return moduleAdded_.connect(subscriber);\n}\n\nboost::signals2::connection NetworkEditorController::connectModuleRemoved(const ModuleRemovedSignalType::slot_type& subscriber)\n{\n  return moduleRemoved_.connect(subscriber);\n}\n\nboost::signals2::connection NetworkEditorController::connectConnectionAdded(const ConnectionAddedSignalType::slot_type& subscriber)\n{\n  return connectionAdded_.connect(subscriber);\n}\n\nNetworkXMLHandle NetworkEditorController::saveNetwork() const\n{\n  NetworkToXML conv;\n  return conv.to_xml_data(theNetwork_);\n}\n\nvoid NetworkEditorController::loadNetwork(const NetworkXML& xml)\n{\n  NetworkXMLConverter conv(moduleFactory_, stateFactory_);\n  theNetwork_ = conv.from_xml_data(xml);\n}\n\nvoid NetworkEditorController::executeAll(const SCIRun::Domain::Networks::ExecutableLookup& lookup)\n{\n  BoostGraphSerialScheduler scheduler;\n  LinearSerialNetworkExecutor executor;\n  try\n  {\n    executor.executeAll(lookup, scheduler.schedule(*theNetwork_));\n  }\n  catch (NetworkHasCyclesException&)\n  {\n    std::cout << \"Cannot schedule execution: network has cycles. Please break all cycles and try again.\" << std::endl;\n  }  \n}\n\nNetworkHandle NetworkEditorController::getNetwork() const \n{\n  return theNetwork_;\n}\n<commit_msg>Modules added to GUI.<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 <iostream>\n\n#include <Engine\/Network\/NetworkEditorController.h>\n\n#include <Core\/Dataflow\/Network\/Connection.h>\n#include <Core\/Dataflow\/Network\/Network.h>\n#include <Core\/Dataflow\/Network\/ModuleDescription.h>\n#include <Core\/Dataflow\/Network\/Module.h>\n#include <Core\/Serialization\/Network\/NetworkXMLSerializer.h>\n#include <Engine\/Scheduler\/BoostGraphSerialScheduler.h>\n#include <Engine\/Scheduler\/LinearSerialNetworkExecutor.h>\n\nusing namespace SCIRun;\nusing namespace SCIRun::Engine;\nusing namespace SCIRun::Domain::Networks;\n\nNetworkEditorController::NetworkEditorController(ModuleFactoryHandle mf, ModuleStateFactoryHandle sf) : moduleFactory_(mf), stateFactory_(sf)\n{\n  \/\/TODO should this class own or just keep a reference?\n  theNetwork_.reset(new Network(mf, sf));\n}\n\nNetworkEditorController::NetworkEditorController(SCIRun::Domain::Networks::NetworkHandle network)\n  : theNetwork_(network)\n{\n}\n\nModuleHandle NetworkEditorController::addModule(const std::string& moduleName)\n{\n  \/\/TODO: should pass in entire info struct\n  ModuleLookupInfo info;\n  info.module_name_ = moduleName;\n  ModuleHandle realModule = theNetwork_->add_module(info);\n  \/*emit*\/ moduleAdded_(moduleName, realModule);\n  printNetwork();\n  return realModule;\n}\n\nvoid NetworkEditorController::removeModule(const std::string& id)\n{\n  \/\/before or after?\n  \/*emit*\/ moduleRemoved_(id);\n  theNetwork_->remove_module(id);\n  printNetwork();\n}\n\nvoid NetworkEditorController::printNetwork() const\n{\n  if (theNetwork_)\n    std::cout << theNetwork_->toString() << std::endl;\n}\n\nvoid NetworkEditorController::addConnection(const SCIRun::Domain::Networks::ConnectionDescription& desc)\n{\n  ConnectionId id = theNetwork_->connect(theNetwork_->lookupModule(desc.moduleId1_), desc.port1_, theNetwork_->lookupModule(desc.moduleId2_), desc.port2_);\n  if (!id.id_.empty())\n    connectionAdded_(id);\n  printNetwork();\n}\n\nvoid NetworkEditorController::removeConnection(const ConnectionId& id)\n{\n  theNetwork_->disconnect(id);\n  printNetwork();\n}\n\nboost::signals2::connection NetworkEditorController::connectModuleAdded(const ModuleAddedSignalType::slot_type& subscriber)\n{\n  return moduleAdded_.connect(subscriber);\n}\n\nboost::signals2::connection NetworkEditorController::connectModuleRemoved(const ModuleRemovedSignalType::slot_type& subscriber)\n{\n  return moduleRemoved_.connect(subscriber);\n}\n\nboost::signals2::connection NetworkEditorController::connectConnectionAdded(const ConnectionAddedSignalType::slot_type& subscriber)\n{\n  return connectionAdded_.connect(subscriber);\n}\n\nNetworkXMLHandle NetworkEditorController::saveNetwork() const\n{\n  NetworkToXML conv;\n  return conv.to_xml_data(theNetwork_);\n}\n\nvoid NetworkEditorController::loadNetwork(const NetworkXML& xml)\n{\n  NetworkXMLConverter conv(moduleFactory_, stateFactory_);\n  theNetwork_ = conv.from_xml_data(xml);\n  for (size_t i = 0; i < theNetwork_->nmodules(); ++i)\n  {\n    ModuleHandle module = theNetwork_->module(i);\n    moduleAdded_(module->get_module_name(), module);\n  }\n  std::cout << \"creating connections:\" << std::endl;\n  BOOST_FOREACH(const ConnectionDescription& cd, theNetwork_->connections())\n  {\n    ConnectionId id = ConnectionId::create(cd);\n    std::cout << id.id_ << std::endl;\n    connectionAdded_(id);\n  }\n  \/\/TODO: update state\n}\n\nvoid NetworkEditorController::executeAll(const SCIRun::Domain::Networks::ExecutableLookup& lookup)\n{\n  BoostGraphSerialScheduler scheduler;\n  LinearSerialNetworkExecutor executor;\n  try\n  {\n    executor.executeAll(lookup, scheduler.schedule(*theNetwork_));\n  }\n  catch (NetworkHasCyclesException&)\n  {\n    std::cout << \"Cannot schedule execution: network has cycles. Please break all cycles and try again.\" << std::endl;\n  }  \n}\n\nNetworkHandle NetworkEditorController::getNetwork() const \n{\n  return theNetwork_;\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 Modules --- Error Page\n *\n * The Error Page module allows the user to select a custom error page.\n *\n * @author Sam Baskinger <sbaskinger@qualys.com>\n *\/\n\n#include \"ironbee_config_auto.h\"\n\n#include <ironbeepp\/configuration_directives.hpp>\n#include <ironbeepp\/configuration_parser.hpp>\n#include <ironbeepp\/c_trampoline.hpp>\n#include <ironbeepp\/module.hpp>\n#include <ironbeepp\/module_bootstrap.hpp>\n#include <ironbeepp\/module_delegate.hpp>\n#include <ironbeepp\/transaction.hpp>\n\n#include <ironbee\/path.h>\n#include <ironbee\/rule_engine.h>\n#include <ironbee\/string.h>\n\n#include <boost\/bind.hpp>\n#include <boost\/function.hpp>\n#include <boost\/iostreams\/device\/mapped_file.hpp>\n\n#if defined(__cplusplus) && !defined(__STDC_FORMAT_MACROS)\n\/* C99 requires that inttypes.h only exposes PRI* macros\n * for C++ implementations if this is defined: *\/\n#define __STDC_FORMAT_MACROS\n#endif\n#include <inttypes.h>\n\n\/**\n * Error Page Module implementation.\n *\/\nclass ErrorPageModule : public IronBee::ModuleDelegate\n{\npublic:\n    \/**\n     * Constructor.\n     *\n     * @param[in] module The IronBee++ module.\n     *\/\n    explicit ErrorPageModule(IronBee::Module module);\n\nprivate:\n    \/**\n     * A post-block hook to send the error page to the server.\n     *\n     * @param[in] tx The transaction.\n     * @param[in] info The block info.\n     **\/\n    void post_block(\n        IronBee::Transaction   tx,\n        const ib_block_info_t& info\n    ) const;\n\n    \/**\n     * Implement the ErrorPageMap directive.\n     *\n     * @param[in] cp Configuration parser.\n     * @param[in] name The directive.\n     * @param[in] param1 The status code.\n     * @param[in] param2 The error page file name.\n     *\n     * @throws @ref IronBee::exception.\n     *\/\n    void errorPageMapDirective(\n        IronBee::ConfigurationParser  cp,\n        const char                   *name,\n        const char                   *param1,\n        const char                   *param2\n    );\n};\n\nIBPP_BOOTSTRAP_MODULE_DELEGATE(\"ErrorPageModule\", ErrorPageModule);\n\n\/**\n * A map from the status number to a file name.\n *\/\ntypedef std::map<ib_num_t, std::string> status_to_file_map_t;\n\n\/**\n * Context configuration value for the ErrorPageModule.\n *\/\nstruct ErrorPageCtxConfig {\n\n    \/**\n     * The mapping from an HTTP status code to the file to return.\n     *\/\n    status_to_file_map_t status_to_file;\n\n    \/**\n     * The mapping from an HTTP status code to the memory mapped file.\n     *\/\n    std::map<ib_num_t, boost::iostreams::mapped_file_source>\n        status_to_mapped_file_source;\n};\n\n\/* Implementation *\/\n\nErrorPageModule::ErrorPageModule(IronBee::Module module):\n    \/* Initialize the parent. *\/\n    IronBee::ModuleDelegate(module)\n{\n    module.engine().register_block_post_hook(\n        \"ErrorPage\",\n        boost::bind(&ErrorPageModule::post_block, this, _1, _2)\n    );\n\n    \/* Setup the directive callbacks. *\/\n    module.engine().register_configuration_directives().\n        param2(\n            \"ErrorPageMap\",\n            boost::bind(\n                &ErrorPageModule::errorPageMapDirective,\n                this, _1, _2, _3, _4));\n\n    module.set_configuration_data<ErrorPageCtxConfig>();\n}\n\nvoid ErrorPageModule::errorPageMapDirective(\n        IronBee::ConfigurationParser  cp,\n        const char                   *name,\n        const char                   *param1,\n        const char                   *param2)\n{\n    ib_num_t num;\n\n    ErrorPageCtxConfig &cfg =\n        module().configuration_data<ErrorPageCtxConfig>(cp.current_context());\n\n    \/* Convert the incoming parameter. *\/\n    IronBee::throw_if_error(ib_string_to_num(param1, 10, &num));\n\n    \/* Set the mapping in the context configuration. *\/\n    cfg.status_to_file[num] = ib_util_relative_file(\n        ib_engine_mm_config_get(cp.engine().ib()),\n        cp.current_file(),\n        param2\n    );\n\n    try {\n        cfg.status_to_mapped_file_source[num] =\n            boost::iostreams::mapped_file_source(cfg.status_to_file[num]);\n    }\n    catch (const std::exception& e) {\n        BOOST_THROW_EXCEPTION(\n            IronBee::enoent()\n                << IronBee::errinfo_what(e.what()));\n    }\n}\n\nvoid ErrorPageModule::post_block(\n    IronBee::Transaction   tx,\n    const ib_block_info_t& info\n) const\n{\n    ErrorPageCtxConfig &cfg =\n        module().configuration_data<ErrorPageCtxConfig>(tx.context());\n\n    status_to_file_map_t::iterator itr =\n        cfg.status_to_file.find(info.status);\n\n    \/* If we can't find a mapping, decline. The default will take over. *\/\n    if (itr == cfg.status_to_file.end()) {\n        ib_log_debug2_tx(\n            tx.ib(),\n            \"No custom page mapped for status %d and context %s. \"\n            \"Declining.\",\n            info.status,\n            tx.context().name()\n        );\n        return;\n    }\n\n    const std::string& file = itr->second;\n    const boost::iostreams::mapped_file_source &source =\n        cfg.status_to_mapped_file_source[info.status];\n\n    ib_log_debug2_tx(\n        tx.ib(),\n        \"Using custom error page file %.*s.\",\n        static_cast<int>(file.length()),\n        file.data()\n    );\n\n    \/* Report the error page back to the server. *\/\n    ib_status_t rc = ib_server_error_body(\n        ib_engine_server_get(tx.engine().ib()),\n        tx.ib(), source.data(), source.size()\n    );\n    if ((rc == IB_DECLINED) || (rc == IB_ENOTIMPL)) {\n        ib_log_debug2_tx(\n            tx.ib(),\n            \"Server not willing to set HTTP error response data.\"\n        );\n    }\n    else if (rc != IB_OK) {\n        ib_log_notice_tx(\n            tx.ib(),\n            \"Server failed to set HTTP error response data: %s\",\n            ib_status_to_string(rc)\n        );\n        IronBee::throw_if_error(rc);\n    }\n}\n<commit_msg>error_page.cpp: The string constant \"${TRANSACTION_ID}\" in the error document will, in all cases, be replaced with the current ib_tx_t's transaction ID.<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 Modules --- Error Page\n *\n * The Error Page module allows the user to select a custom error page.\n *\n * @author Sam Baskinger <sbaskinger@qualys.com>\n *\/\n\n#include \"ironbee_config_auto.h\"\n\n#include <ironbeepp\/configuration_directives.hpp>\n#include <ironbeepp\/configuration_parser.hpp>\n#include <ironbeepp\/c_trampoline.hpp>\n#include <ironbeepp\/module.hpp>\n#include <ironbeepp\/module_bootstrap.hpp>\n#include <ironbeepp\/module_delegate.hpp>\n#include <ironbeepp\/transaction.hpp>\n\n#include <ironbee\/path.h>\n#include <ironbee\/rule_engine.h>\n#include <ironbee\/string.h>\n\n#include <boost\/algorithm\/string\/replace.hpp>\n#include <boost\/bind.hpp>\n#include <boost\/function.hpp>\n#include <boost\/iostreams\/device\/mapped_file.hpp>\n\n#if defined(__cplusplus) && !defined(__STDC_FORMAT_MACROS)\n\/* C99 requires that inttypes.h only exposes PRI* macros\n * for C++ implementations if this is defined: *\/\n#define __STDC_FORMAT_MACROS\n#endif\n#include <inttypes.h>\n\n\/**\n * Error Page Module implementation.\n *\/\nclass ErrorPageModule : public IronBee::ModuleDelegate\n{\npublic:\n    \/**\n     * Constructor.\n     *\n     * @param[in] module The IronBee++ module.\n     *\/\n    explicit ErrorPageModule(IronBee::Module module);\n\nprivate:\n    \/**\n     * A post-block hook to send the error page to the server.\n     *\n     * @param[in] tx The transaction.\n     * @param[in] info The block info.\n     **\/\n    void post_block(\n        IronBee::Transaction   tx,\n        const ib_block_info_t& info\n    ) const;\n\n    \/**\n     * Implement the ErrorPageMap directive.\n     *\n     * @param[in] cp Configuration parser.\n     * @param[in] name The directive.\n     * @param[in] param1 The status code.\n     * @param[in] param2 The error page file name.\n     *\n     * @throws @ref IronBee::exception.\n     *\/\n    void errorPageMapDirective(\n        IronBee::ConfigurationParser  cp,\n        const char                   *name,\n        const char                   *param1,\n        const char                   *param2\n    );\n};\n\nIBPP_BOOTSTRAP_MODULE_DELEGATE(\"ErrorPageModule\", ErrorPageModule);\n\n\/**\n * A map from the status number to a file name.\n *\/\ntypedef std::map<ib_num_t, std::string> status_to_file_map_t;\n\n\/**\n * Context configuration value for the ErrorPageModule.\n *\/\nstruct ErrorPageCtxConfig {\n\n    \/**\n     * The mapping from an HTTP status code to the file to return.\n     *\/\n    status_to_file_map_t status_to_file;\n\n    \/**\n     * The mapping from an HTTP status code to the memory mapped file.\n     *\/\n    std::map<ib_num_t, boost::iostreams::mapped_file_source>\n        status_to_mapped_file_source;\n};\n\n\/* Implementation *\/\n\nErrorPageModule::ErrorPageModule(IronBee::Module module):\n    \/* Initialize the parent. *\/\n    IronBee::ModuleDelegate(module)\n{\n    module.engine().register_block_post_hook(\n        \"ErrorPage\",\n        boost::bind(&ErrorPageModule::post_block, this, _1, _2)\n    );\n\n    \/* Setup the directive callbacks. *\/\n    module.engine().register_configuration_directives().\n        param2(\n            \"ErrorPageMap\",\n            boost::bind(\n                &ErrorPageModule::errorPageMapDirective,\n                this, _1, _2, _3, _4));\n\n    module.set_configuration_data<ErrorPageCtxConfig>();\n}\n\nvoid ErrorPageModule::errorPageMapDirective(\n        IronBee::ConfigurationParser  cp,\n        const char                   *name,\n        const char                   *param1,\n        const char                   *param2)\n{\n    ib_num_t num;\n\n    ErrorPageCtxConfig &cfg =\n        module().configuration_data<ErrorPageCtxConfig>(cp.current_context());\n\n    \/* Convert the incoming parameter. *\/\n    IronBee::throw_if_error(ib_string_to_num(param1, 10, &num));\n\n    \/* Set the mapping in the context configuration. *\/\n    cfg.status_to_file[num] = ib_util_relative_file(\n        ib_engine_mm_config_get(cp.engine().ib()),\n        cp.current_file(),\n        param2\n    );\n\n    try {\n        cfg.status_to_mapped_file_source[num] =\n            boost::iostreams::mapped_file_source(cfg.status_to_file[num]);\n    }\n    catch (const std::exception& e) {\n        BOOST_THROW_EXCEPTION(\n            IronBee::enoent()\n                << IronBee::errinfo_what(e.what()));\n    }\n}\n\nvoid ErrorPageModule::post_block(\n    IronBee::Transaction   tx,\n    const ib_block_info_t& info\n) const\n{\n    ErrorPageCtxConfig &cfg =\n        module().configuration_data<ErrorPageCtxConfig>(tx.context());\n\n    status_to_file_map_t::iterator itr =\n        cfg.status_to_file.find(info.status);\n\n    \/* If we can't find a mapping, decline. The default will take over. *\/\n    if (itr == cfg.status_to_file.end()) {\n        ib_log_debug2_tx(\n            tx.ib(),\n            \"No custom page mapped for status %d and context %s. \"\n            \"Declining.\",\n            info.status,\n            tx.context().name()\n        );\n        return;\n    }\n\n    const std::string& file = itr->second;\n    const boost::iostreams::mapped_file_source &source =\n        cfg.status_to_mapped_file_source[info.status];\n\n    \/* The error page to be handed to the server is written to this\n     * output string stream. *\/\n    std::ostringstream error_page_output_stream;\n\n    \/* Optimization: Reserve the document size + 37 characters for a UUID.\n     * We assume that the transaction ID is only replaced once. *\/\n    error_page_output_stream.str().reserve(source.size() + 37);\n\n    \/* Replace holder text with transaction id. *\/\n    boost::algorithm::replace_all_copy(\n        \/* Output iterator. *\/\n        std::ostream_iterator<char>(error_page_output_stream),\n\n        \/* The range. *\/\n        std::pair<const char *, const char *>(\n            source.data(),\n            source.data()+ source.size()\n        ),\n\n        \/* The text to replace. *\/\n        \"${TRANSACTION_ID}\",\n\n        \/* What to replace the text with. *\/\n        tx.id()\n    );\n\n    ib_log_debug2_tx(\n        tx.ib(),\n        \"Using custom error page file %.*s.\",\n        static_cast<int>(file.length()),\n        file.data()\n    );\n\n    \/* Report the error page back to the server. *\/\n    ib_status_t rc = ib_server_error_body(\n        ib_engine_server_get(tx.engine().ib()),\n        tx.ib(),\n        error_page_output_stream.str().data(),\n        error_page_output_stream.str().size()\n    );\n    if ((rc == IB_DECLINED) || (rc == IB_ENOTIMPL)) {\n        ib_log_debug2_tx(\n            tx.ib(),\n            \"Server not willing to set HTTP error response data.\"\n        );\n    }\n    else if (rc != IB_OK) {\n        ib_log_notice_tx(\n            tx.ib(),\n            \"Server failed to set HTTP error response data: %s\",\n            ib_status_to_string(rc)\n        );\n        IronBee::throw_if_error(rc);\n    }\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\/graphics.hpp>\n#include <mapnik\/agg_renderer.hpp>\n#include <mapnik\/agg_rasterizer.hpp>\n#include <mapnik\/segment.hpp>\n#include <mapnik\/expression_evaluator.hpp>\n\n\/\/ boost\n#include <boost\/scoped_ptr.hpp>\n\n\/\/ agg\n#include \"agg_basics.h\"\n#include \"agg_rendering_buffer.h\"\n#include \"agg_pixfmt_rgba.h\"\n#include \"agg_rasterizer_scanline_aa.h\"\n#include \"agg_scanline_u.h\"\n#include \"agg_renderer_scanline.h\"\n#include \"agg_conv_stroke.h\"\n\nnamespace mapnik\n{\n\ntemplate <typename T>\nvoid agg_renderer<T>::process(building_symbolizer const& sym,\n                              mapnik::feature_impl & feature,\n                              proj_transform const& prj_trans)\n{\n    typedef coord_transform<CoordTransform,geometry_type> path_type;\n    typedef agg::renderer_base<agg::pixfmt_rgba32> ren_base;\n    typedef agg::renderer_scanline_aa_solid<ren_base> renderer;\n\n    agg::rendering_buffer buf(current_buffer_->raw_data(),width_,height_, width_ * 4);\n    agg::pixfmt_rgba32 pixf(buf);\n    ren_base renb(pixf);\n\n    color const& fill_  = sym.get_fill();\n    unsigned r=fill_.red();\n    unsigned g=fill_.green();\n    unsigned b=fill_.blue();\n    unsigned a=fill_.alpha();\n    renderer ren(renb);\n    agg::scanline_u8 sl;\n\n    ras_ptr->reset();\n    ras_ptr->gamma(agg::gamma_power());\n\n    double height = 0.0;\n    expression_ptr height_expr = sym.height();\n    if (height_expr)\n    {\n        value_type result = boost::apply_visitor(evaluate<Feature,value_type>(feature), *height_expr);\n        height = result.to_double() * scale_factor_;\n    }\n\n    for (unsigned i=0;i<feature.num_geometries();++i)\n    {\n        geometry_type const& geom = feature.get_geometry(i);\n        if (geom.size() > 2)\n        {\n            boost::scoped_ptr<geometry_type> frame(new geometry_type(LineString));\n            boost::scoped_ptr<geometry_type> roof(new geometry_type(Polygon));\n            std::deque<segment_t> face_segments;\n            double x0(0);\n            double y0(0);\n\n            geom.rewind(0);\n            unsigned cm = geom.vertex(&x0,&y0);\n            for (unsigned j=1;j<geom.size();++j)\n            {\n                double x(0);\n                double y(0);\n                cm = geom.vertex(&x,&y);\n                if (cm == SEG_MOVETO)\n                {\n                    frame->move_to(x,y);\n                }\n                else if (cm == SEG_LINETO)\n                {\n                    frame->line_to(x,y);\n                    face_segments.push_back(segment_t(x0,y0,x,y));\n                }\n\n                x0 = x;\n                y0 = y;\n            }\n            std::sort(face_segments.begin(),face_segments.end(), y_order);\n            std::deque<segment_t>::const_iterator itr=face_segments.begin();\n            for (;itr!=face_segments.end();++itr)\n            {\n                boost::scoped_ptr<geometry_type> faces(new geometry_type(Polygon));\n                faces->move_to(itr->get<0>(),itr->get<1>());\n                faces->line_to(itr->get<2>(),itr->get<3>());\n                faces->line_to(itr->get<2>(),itr->get<3>() + height);\n                faces->line_to(itr->get<0>(),itr->get<1>() + height);\n\n                path_type faces_path (t_,*faces,prj_trans);\n                ras_ptr->add_path(faces_path);\n                ren.color(agg::rgba8(int(r*0.8), int(g*0.8), int(b*0.8), int(a * sym.get_opacity())));\n                agg::render_scanlines(*ras_ptr, sl, ren);\n                ras_ptr->reset();\n\n                frame->move_to(itr->get<0>(),itr->get<1>());\n                frame->line_to(itr->get<0>(),itr->get<1>()+height);\n            }\n\n            geom.rewind(0);\n            for (unsigned j=0;j<geom.size();++j)\n            {\n                double x,y;\n                unsigned cm = geom.vertex(&x,&y);\n                if (cm == SEG_MOVETO)\n                {\n                    frame->move_to(x,y+height);\n                    roof->move_to(x,y+height);\n                }\n                else if (cm == SEG_LINETO)\n                {\n                    frame->line_to(x,y+height);\n                    roof->line_to(x,y+height);\n                }\n            }\n\n            path_type path(t_,*frame,prj_trans);\n            agg::conv_stroke<path_type> stroke(path);\n            ras_ptr->add_path(stroke);\n            ren.color(agg::rgba8(int(r*0.8), int(g*0.8), int(b*0.8), int(255 * sym.get_opacity())));\n            agg::render_scanlines(*ras_ptr, sl, ren);\n            ras_ptr->reset();\n\n            path_type roof_path (t_,*roof,prj_trans);\n            ras_ptr->add_path(roof_path);\n            ren.color(agg::rgba8(r, g, b, int(a * sym.get_opacity())));\n            agg::render_scanlines(*ras_ptr, sl, ren);\n        }\n    }\n}\n\ntemplate void agg_renderer<image_32>::process(building_symbolizer const&,\n                                              mapnik::feature_impl &,\n                                              proj_transform const&);\n\n}\n<commit_msg>+ process SEG_CLOSE<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\/graphics.hpp>\n#include <mapnik\/agg_renderer.hpp>\n#include <mapnik\/agg_rasterizer.hpp>\n#include <mapnik\/segment.hpp>\n#include <mapnik\/expression_evaluator.hpp>\n\n\/\/ boost\n#include <boost\/scoped_ptr.hpp>\n\n\/\/ agg\n#include \"agg_basics.h\"\n#include \"agg_rendering_buffer.h\"\n#include \"agg_pixfmt_rgba.h\"\n#include \"agg_rasterizer_scanline_aa.h\"\n#include \"agg_scanline_u.h\"\n#include \"agg_renderer_scanline.h\"\n#include \"agg_conv_stroke.h\"\n\nnamespace mapnik\n{\n\ntemplate <typename T>\nvoid agg_renderer<T>::process(building_symbolizer const& sym,\n                              mapnik::feature_impl & feature,\n                              proj_transform const& prj_trans)\n{\n    typedef coord_transform<CoordTransform,geometry_type> path_type;\n    typedef agg::renderer_base<agg::pixfmt_rgba32> ren_base;\n    typedef agg::renderer_scanline_aa_solid<ren_base> renderer;\n\n    agg::rendering_buffer buf(current_buffer_->raw_data(),width_,height_, width_ * 4);\n    agg::pixfmt_rgba32 pixf(buf);\n    ren_base renb(pixf);\n\n    color const& fill_  = sym.get_fill();\n    unsigned r=fill_.red();\n    unsigned g=fill_.green();\n    unsigned b=fill_.blue();\n    unsigned a=fill_.alpha();\n    renderer ren(renb);\n    agg::scanline_u8 sl;\n\n    ras_ptr->reset();\n    ras_ptr->gamma(agg::gamma_power());\n\n    double height = 0.0;\n    expression_ptr height_expr = sym.height();\n    if (height_expr)\n    {\n        value_type result = boost::apply_visitor(evaluate<Feature,value_type>(feature), *height_expr);\n        height = result.to_double() * scale_factor_;\n    }\n\n    for (unsigned i=0;i<feature.num_geometries();++i)\n    {\n        geometry_type const& geom = feature.get_geometry(i);\n        if (geom.size() > 2)\n        {\n            boost::scoped_ptr<geometry_type> frame(new geometry_type(LineString));\n            boost::scoped_ptr<geometry_type> roof(new geometry_type(Polygon));\n            std::deque<segment_t> face_segments;\n            double x0 = 0;\n            double y0 = 0;\n\n            geom.rewind(0);\n            unsigned cm = geom.vertex(&x0,&y0);\n            for (unsigned j=1;j<geom.size();++j)\n            {\n                double x(0);\n                double y(0);\n                cm = geom.vertex(&x,&y);\n                if (cm == SEG_MOVETO)\n                {\n                    frame->move_to(x,y);\n                }\n                else if (cm == SEG_LINETO || cm == SEG_CLOSE)\n                {\n                    frame->line_to(x,y);\n                    face_segments.push_back(segment_t(x0,y0,x,y));\n                }\n                x0 = x;\n                y0 = y;\n            }\n            std::sort(face_segments.begin(),face_segments.end(), y_order);\n            std::deque<segment_t>::const_iterator itr=face_segments.begin();\n            for (;itr!=face_segments.end();++itr)\n            {\n                boost::scoped_ptr<geometry_type> faces(new geometry_type(Polygon));\n                faces->move_to(itr->get<0>(),itr->get<1>());\n                faces->line_to(itr->get<2>(),itr->get<3>());\n                faces->line_to(itr->get<2>(),itr->get<3>() + height);\n                faces->line_to(itr->get<0>(),itr->get<1>() + height);\n\n                path_type faces_path (t_,*faces,prj_trans);\n                ras_ptr->add_path(faces_path);\n                ren.color(agg::rgba8(int(r*0.8), int(g*0.8), int(b*0.8), int(a * sym.get_opacity())));\n                agg::render_scanlines(*ras_ptr, sl, ren);\n                ras_ptr->reset();\n\n                frame->move_to(itr->get<0>(),itr->get<1>());\n                frame->line_to(itr->get<0>(),itr->get<1>()+height);\n            }\n\n            geom.rewind(0);\n            for (unsigned j=0;j<geom.size();++j)\n            {\n                double x,y;\n                unsigned cm = geom.vertex(&x,&y);\n                if (cm == SEG_MOVETO)\n                {\n                    frame->move_to(x,y+height);\n                    roof->move_to(x,y+height);\n                }\n                else if (cm == SEG_LINETO)\n                {\n                    frame->line_to(x,y+height);\n                    roof->line_to(x,y+height);\n                }\n            }\n\n            path_type path(t_,*frame,prj_trans);\n            agg::conv_stroke<path_type> stroke(path);\n            ras_ptr->add_path(stroke);\n            ren.color(agg::rgba8(int(r*0.8), int(g*0.8), int(b*0.8), int(255 * sym.get_opacity())));\n            agg::render_scanlines(*ras_ptr, sl, ren);\n            ras_ptr->reset();\n\n            path_type roof_path (t_,*roof,prj_trans);\n            ras_ptr->add_path(roof_path);\n            ren.color(agg::rgba8(r, g, b, int(a * sym.get_opacity())));\n            agg::render_scanlines(*ras_ptr, sl, ren);\n        }\n    }\n}\n\ntemplate void agg_renderer<image_32>::process(building_symbolizer const&,\n                                              mapnik::feature_impl &,\n                                              proj_transform const&);\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\n *\n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2006 Artem Pavlenko\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA\n *\n *****************************************************************************\/\n\/\/$Id$\n\n\/\/ mapnik\n#include <mapnik\/agg_renderer.hpp>\n#include <mapnik\/agg_rasterizer.hpp>\n\n\/\/ boost\n#include <boost\/tuple\/tuple.hpp>\n#include <boost\/scoped_ptr.hpp>\n\n\/\/ agg\n#include \"agg_basics.h\"\n#include \"agg_rendering_buffer.h\"\n#include \"agg_pixfmt_rgba.h\"\n#include \"agg_rasterizer_scanline_aa.h\"\n#include \"agg_scanline_u.h\"\n#include \"agg_renderer_scanline.h\"\n#include \"agg_conv_stroke.h\"\n\nnamespace mapnik \n{\n\ntypedef boost::tuple<double,double,double,double> segment_t;\nbool y_order(segment_t const& first,segment_t const& second)\n{\n    double miny0 = std::min(first.get<1>(),first.get<3>());\n    double miny1 = std::min(second.get<1>(),second.get<3>());\n    return  miny0 > miny1;\n}\n\ntemplate <typename T>\nvoid agg_renderer<T>::process(building_symbolizer const& sym,\n                              Feature const& feature,\n                              proj_transform const& prj_trans)\n{\n    typedef  coord_transform2<CoordTransform,geometry2d> path_type;\n    typedef  coord_transform3<CoordTransform,geometry2d> path_type_roof;\n    typedef agg::renderer_base<agg::pixfmt_rgba32_plain> ren_base;\n    typedef agg::renderer_scanline_aa_solid<ren_base> renderer;\n\n    agg::rendering_buffer buf(pixmap_.raw_data(),width_,height_, width_ * 4);\n    agg::pixfmt_rgba32_plain pixf(buf);\n    ren_base renb(pixf);\n\n    color const& fill_  = sym.get_fill();\n    unsigned r=fill_.red();\n    unsigned g=fill_.green();\n    unsigned b=fill_.blue();\n    unsigned a=fill_.alpha();\n    renderer ren(renb);\n    agg::scanline_u8 sl;\n\n    ras_ptr->reset();\n    ras_ptr->gamma(agg::gamma_linear());\n    \n    double height = sym.height(); \/\/ height in pixels\n    \n    for (unsigned i=0;i<feature.num_geometries();++i)\n    {\n        geometry2d const& geom = feature.get_geometry(i);\n        if (geom.num_points() > 2)\n        {\n            boost::scoped_ptr<geometry2d> frame(new line_string_impl);\n            boost::scoped_ptr<geometry2d> roof(new polygon_impl);\n            std::deque<segment_t> face_segments;\n            double x0(0);\n            double y0(0);\n            unsigned cm = geom.vertex(&x0,&y0);\n            for (unsigned j=1;j<geom.num_points();++j)\n            {\n                double x(0);\n                double y(0);\n                cm = geom.vertex(&x,&y);\n                if (cm == SEG_MOVETO)\n                {\n                    frame->move_to(x,y);\n                }\n                else if (cm == SEG_LINETO)\n                {\n                    frame->line_to(x,y);\n                    face_segments.push_back(segment_t(x0,y0,x,y));\n                }\n                \n                x0 = x;\n                y0 = y;\n            }\n            std::sort(face_segments.begin(),face_segments.end(), y_order);\n            std::deque<segment_t>::const_iterator itr=face_segments.begin();\n            for (;itr!=face_segments.end();++itr)\n            {\n                boost::scoped_ptr<geometry2d> faces(new polygon_impl);\n                faces->move_to(itr->get<0>(),itr->get<1>());\n                faces->line_to(itr->get<2>(),itr->get<3>());\n                faces->line_to(itr->get<2>(),itr->get<3>() + height);\n                faces->line_to(itr->get<0>(),itr->get<1>() + height);\n\n                path_type faces_path (t_,*faces,prj_trans);\n                ras_ptr->add_path(faces_path);\n                ren.color(agg::rgba8(int(r*0.8), int(g*0.8), int(b*0.8), int(a * sym.get_opacity())));\n                agg::render_scanlines(*ras_ptr, sl, ren);\n                ras_ptr->reset();\n\n                frame->move_to(itr->get<0>(),itr->get<1>());\n                frame->line_to(itr->get<0>(),itr->get<1>()+height);\n            }\n\n            geom.rewind(0);\n            for (unsigned j=0;j<geom.num_points();++j)\n            {\n                double x,y;\n                unsigned cm = geom.vertex(&x,&y);\n                if (cm == SEG_MOVETO)\n                {\n                    frame->move_to(x,y+height);\n                    roof->move_to(x,y+height);\n                }\n                else if (cm == SEG_LINETO)\n                {\n                    frame->line_to(x,y+height);\n                    roof->line_to(x,y+height);\n                }\n            }\n            path_type path(t_,*frame,prj_trans);\n            agg::conv_stroke<path_type>  stroke(path);\n            ras_ptr->add_path(stroke);\n            ren.color(agg::rgba8(r * 0.8, g * 0.8 , b * 0.8, int(255 * sym.get_opacity())));\n            agg::render_scanlines(*ras_ptr, sl, ren);\n            ras_ptr->reset();\n\n            path_type roof_path (t_,*roof,prj_trans);\n            ras_ptr->add_path(roof_path);\n            ren.color(agg::rgba8(r, g, b, int(a * sym.get_opacity())));\n            agg::render_scanlines(*ras_ptr, sl, ren);\n        }\n    }\n}\n\ntemplate void agg_renderer<image_32>::process(building_symbolizer const&,\n                                              Feature const&,\n                                              proj_transform const&);\n\n}\n<commit_msg>+ apply scale_factor in building sym<commit_after>\/*****************************************************************************\n *\n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2006 Artem Pavlenko\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA\n *\n *****************************************************************************\/\n\/\/$Id$\n\n\/\/ mapnik\n#include <mapnik\/agg_renderer.hpp>\n#include <mapnik\/agg_rasterizer.hpp>\n\n\/\/ boost\n#include <boost\/tuple\/tuple.hpp>\n#include <boost\/scoped_ptr.hpp>\n\n\/\/ agg\n#include \"agg_basics.h\"\n#include \"agg_rendering_buffer.h\"\n#include \"agg_pixfmt_rgba.h\"\n#include \"agg_rasterizer_scanline_aa.h\"\n#include \"agg_scanline_u.h\"\n#include \"agg_renderer_scanline.h\"\n#include \"agg_conv_stroke.h\"\n\nnamespace mapnik \n{\n\ntypedef boost::tuple<double,double,double,double> segment_t;\nbool y_order(segment_t const& first,segment_t const& second)\n{\n    double miny0 = std::min(first.get<1>(),first.get<3>());\n    double miny1 = std::min(second.get<1>(),second.get<3>());\n    return  miny0 > miny1;\n}\n\ntemplate <typename T>\nvoid agg_renderer<T>::process(building_symbolizer const& sym,\n                              Feature const& feature,\n                              proj_transform const& prj_trans)\n{\n    typedef  coord_transform2<CoordTransform,geometry2d> path_type;\n    typedef  coord_transform3<CoordTransform,geometry2d> path_type_roof;\n    typedef agg::renderer_base<agg::pixfmt_rgba32_plain> ren_base;\n    typedef agg::renderer_scanline_aa_solid<ren_base> renderer;\n\n    agg::rendering_buffer buf(pixmap_.raw_data(),width_,height_, width_ * 4);\n    agg::pixfmt_rgba32_plain pixf(buf);\n    ren_base renb(pixf);\n\n    color const& fill_  = sym.get_fill();\n    unsigned r=fill_.red();\n    unsigned g=fill_.green();\n    unsigned b=fill_.blue();\n    unsigned a=fill_.alpha();\n    renderer ren(renb);\n    agg::scanline_u8 sl;\n\n    ras_ptr->reset();\n    ras_ptr->gamma(agg::gamma_linear());\n    \n    double height = sym.height() * scale_factor_;\n    \n    for (unsigned i=0;i<feature.num_geometries();++i)\n    {\n        geometry2d const& geom = feature.get_geometry(i);\n        if (geom.num_points() > 2)\n        {\n            boost::scoped_ptr<geometry2d> frame(new line_string_impl);\n            boost::scoped_ptr<geometry2d> roof(new polygon_impl);\n            std::deque<segment_t> face_segments;\n            double x0(0);\n            double y0(0);\n            unsigned cm = geom.vertex(&x0,&y0);\n            for (unsigned j=1;j<geom.num_points();++j)\n            {\n                double x(0);\n                double y(0);\n                cm = geom.vertex(&x,&y);\n                if (cm == SEG_MOVETO)\n                {\n                    frame->move_to(x,y);\n                }\n                else if (cm == SEG_LINETO)\n                {\n                    frame->line_to(x,y);\n                    face_segments.push_back(segment_t(x0,y0,x,y));\n                }\n                \n                x0 = x;\n                y0 = y;\n            }\n            std::sort(face_segments.begin(),face_segments.end(), y_order);\n            std::deque<segment_t>::const_iterator itr=face_segments.begin();\n            for (;itr!=face_segments.end();++itr)\n            {\n                boost::scoped_ptr<geometry2d> faces(new polygon_impl);\n                faces->move_to(itr->get<0>(),itr->get<1>());\n                faces->line_to(itr->get<2>(),itr->get<3>());\n                faces->line_to(itr->get<2>(),itr->get<3>() + height);\n                faces->line_to(itr->get<0>(),itr->get<1>() + height);\n\n                path_type faces_path (t_,*faces,prj_trans);\n                ras_ptr->add_path(faces_path);\n                ren.color(agg::rgba8(int(r*0.8), int(g*0.8), int(b*0.8), int(a * sym.get_opacity())));\n                agg::render_scanlines(*ras_ptr, sl, ren);\n                ras_ptr->reset();\n\n                frame->move_to(itr->get<0>(),itr->get<1>());\n                frame->line_to(itr->get<0>(),itr->get<1>()+height);\n            }\n\n            geom.rewind(0);\n            for (unsigned j=0;j<geom.num_points();++j)\n            {\n                double x,y;\n                unsigned cm = geom.vertex(&x,&y);\n                if (cm == SEG_MOVETO)\n                {\n                    frame->move_to(x,y+height);\n                    roof->move_to(x,y+height);\n                }\n                else if (cm == SEG_LINETO)\n                {\n                    frame->line_to(x,y+height);\n                    roof->line_to(x,y+height);\n                }\n            }\n            path_type path(t_,*frame,prj_trans);\n            agg::conv_stroke<path_type> stroke(path);\n            ras_ptr->add_path(stroke);\n            ren.color(agg::rgba8(r * 0.8, g * 0.8 , b * 0.8, int(255 * sym.get_opacity())));\n            agg::render_scanlines(*ras_ptr, sl, ren);\n            ras_ptr->reset();\n\n            path_type roof_path (t_,*roof,prj_trans);\n            ras_ptr->add_path(roof_path);\n            ren.color(agg::rgba8(r, g, b, int(a * sym.get_opacity())));\n            agg::render_scanlines(*ras_ptr, sl, ren);\n        }\n    }\n}\n\ntemplate void agg_renderer<image_32>::process(building_symbolizer const&,\n                                              Feature const&,\n                                              proj_transform const&);\n\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* This  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 \"oxygenwidgetsizedata.h\"\n#include \"..\/oxygenstyle.h\"\n#include \"..\/oxygengtkutils.h\"\n\nnamespace Oxygen\n{\n    bool WidgetSizeData::updateXShape()\n    {\n        GtkWidget* widget(_widget);\n        GdkWindow* window(0);\n        int verticalMaskOffset(0);\n\n        if(GTK_IS_MENU(widget))\n        {\n            window=gtk_widget_get_parent_window(widget);\n            verticalMaskOffset=Oxygen::Menu_VerticalOffset;\n        }\n        else if(GTK_IS_TOOLTIP(widget) || Gtk::gtk_is_tooltip(widget))\n        {\n            window=gtk_widget_get_window(widget);\n        }\n        else if(Gtk::gtk_combobox_is_popup(widget))\n        {\n            window=gtk_widget_get_window(widget);\n        }\n        else if(Gtk::gtk_combo_is_popup(widget))\n        {\n            window=gtk_widget_get_window(widget);\n        }\n        else\n        {\n            std::cerr << \"FIXME: Oxygen::WidgetSizeData: unknown window type: \\\"\"<< Gtk::gtk_widget_path(widget)<<\"\\\"\\n\";\n            return false;\n        }\n\n        const bool wasAlpha(_alpha);\n        const bool alpha(Gtk::gtk_widget_has_rgba( widget ));\n\n        const GtkAllocation allocation( Gtk::gtk_widget_get_allocation( widget ) );\n        const int &width(allocation.width), &height(allocation.height);\n\n        const bool sizeChanged( width != _width || height != _height );\n        const bool alphaChanged( alpha != wasAlpha );\n\n        if( !sizeChanged && !alphaChanged )\n            return false;\n\n        if(!alpha)\n        {\n            \/\/ make menus\/tooltips\/combo lists appear rounded using XShape extension if screen isn't composited\n            GdkPixmap* mask( Style::instance().helper().roundMask( width, height - 2*verticalMaskOffset) );\n            gdk_window_shape_combine_mask( window, mask, 0, verticalMaskOffset );\n            gdk_pixmap_unref(mask);\n        }\n        else\n        {\n            \/\/ reset mask if compositing has appeared after we had set a mask\n            gdk_window_shape_combine_mask( window, NULL, 0, 0);\n\n            \/\/ TODO: move to size allocation hook\n            if( GTK_IS_TOOLTIP(widget) && (sizeChanged||!wasAlpha) )\n            {\n                Style::instance().setWindowBlur(window,true);\n            }\n        }\n\n        \/\/ Update widget properties\n        _width=width;\n        _height=height;\n        _alpha=alpha;\n\n        return sizeChanged;\n    }\n\n}\n<commit_msg>Fix tooltip detection<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* This  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 \"oxygenwidgetsizedata.h\"\n#include \"..\/oxygenstyle.h\"\n#include \"..\/oxygengtkutils.h\"\n\nnamespace Oxygen\n{\n    bool WidgetSizeData::updateXShape()\n    {\n        GtkWidget* widget(_widget);\n        GdkWindow* window(0);\n        int verticalMaskOffset(0);\n\n        if(GTK_IS_MENU(widget))\n        {\n            window=gtk_widget_get_parent_window(widget);\n            verticalMaskOffset=Oxygen::Menu_VerticalOffset;\n        }\n        else if(Gtk::gtk_is_tooltip(widget))\n        {\n            window=gtk_widget_get_window(widget);\n        }\n        else if(Gtk::gtk_combobox_is_popup(widget))\n        {\n            window=gtk_widget_get_window(widget);\n        }\n        else if(Gtk::gtk_combo_is_popup(widget))\n        {\n            window=gtk_widget_get_window(widget);\n        }\n        else\n        {\n            std::cerr << \"FIXME: Oxygen::WidgetSizeData: unknown window type: \\\"\"<< Gtk::gtk_widget_path(widget)<<\"\\\"\\n\";\n            return false;\n        }\n\n        const bool wasAlpha(_alpha);\n        const bool alpha(Gtk::gtk_widget_has_rgba( widget ));\n\n        const GtkAllocation allocation( Gtk::gtk_widget_get_allocation( widget ) );\n        const int &width(allocation.width), &height(allocation.height);\n\n        const bool sizeChanged( width != _width || height != _height );\n        const bool alphaChanged( alpha != wasAlpha );\n\n        if( !sizeChanged && !alphaChanged )\n            return false;\n\n        if(!alpha)\n        {\n            \/\/ make menus\/tooltips\/combo lists appear rounded using XShape extension if screen isn't composited\n            GdkPixmap* mask( Style::instance().helper().roundMask( width, height - 2*verticalMaskOffset) );\n            gdk_window_shape_combine_mask( window, mask, 0, verticalMaskOffset );\n            gdk_pixmap_unref(mask);\n        }\n        else\n        {\n            \/\/ reset mask if compositing has appeared after we had set a mask\n            gdk_window_shape_combine_mask( window, NULL, 0, 0);\n\n            \/\/ TODO: move to size allocation hook\n            if( Gtk::gtk_is_tooltip(widget) && (sizeChanged||!wasAlpha) )\n            {\n                Style::instance().setWindowBlur(window,true);\n            }\n        }\n\n        \/\/ Update widget properties\n        _width=width;\n        _height=height;\n        _alpha=alpha;\n\n        return sizeChanged;\n    }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2012 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 \"dex_file-inl.h\"\n#include \"entrypoints\/entrypoint_utils.h\"\n#include \"mirror\/art_method-inl.h\"\n#include \"mirror\/class-inl.h\"\n#include \"mirror\/object.h\"\n#include \"mirror\/object-inl.h\"\n#include \"mirror\/object_array-inl.h\"\n#include \"object_utils.h\"\n#include \"scoped_thread_state_change.h\"\n#include \"thread.h\"\n\nnamespace art {\n\n\/\/ Called on entry to JNI, transition out of Runnable and release share of mutator_lock_.\nextern uint32_t JniMethodStart(Thread* self) {\n  JNIEnvExt* env = self->GetJniEnv();\n  DCHECK(env != nullptr);\n  uint32_t saved_local_ref_cookie = env->local_ref_cookie;\n  env->local_ref_cookie = env->locals.GetSegmentState();\n  mirror::ArtMethod* native_method = *self->GetManagedStack()->GetTopQuickFrame();\n  if (!native_method->IsFastNative()) {\n    \/\/ When not fast JNI we transition out of runnable.\n    self->TransitionFromRunnableToSuspended(kNative);\n  }\n  return saved_local_ref_cookie;\n}\n\nextern uint32_t JniMethodStartSynchronized(jobject to_lock, Thread* self) {\n  self->DecodeJObject(to_lock)->MonitorEnter(self);\n  return JniMethodStart(self);\n}\n\n\/\/ TODO: NO_THREAD_SAFETY_ANALYSIS due to different control paths depending on fast JNI.\nstatic void GoToRunnable(Thread* self) NO_THREAD_SAFETY_ANALYSIS {\n  mirror::ArtMethod* native_method = *self->GetManagedStack()->GetTopQuickFrame();\n  bool is_fast = native_method->IsFastNative();\n  if (!is_fast) {\n    self->TransitionFromSuspendedToRunnable();\n  } else if (UNLIKELY(self->TestAllFlags())) {\n    \/\/ In fast JNI mode we never transitioned out of runnable. Perform a suspend check if there\n    \/\/ is a flag raised.\n    DCHECK(Locks::mutator_lock_->IsSharedHeld(self));\n    CheckSuspend(self);\n  }\n}\n\nstatic void PopLocalReferences(uint32_t saved_local_ref_cookie, Thread* self) {\n  JNIEnvExt* env = self->GetJniEnv();\n  env->locals.SetSegmentState(env->local_ref_cookie);\n  env->local_ref_cookie = saved_local_ref_cookie;\n  self->PopSirt();\n}\n\nextern void JniMethodEnd(uint32_t saved_local_ref_cookie, Thread* self) {\n  GoToRunnable(self);\n  PopLocalReferences(saved_local_ref_cookie, self);\n}\n\n\nextern void JniMethodEndSynchronized(uint32_t saved_local_ref_cookie, jobject locked,\n                                     Thread* self) {\n  GoToRunnable(self);\n  UnlockJniSynchronizedMethod(locked, self);  \/\/ Must decode before pop.\n  PopLocalReferences(saved_local_ref_cookie, self);\n}\n\nextern mirror::Object* JniMethodEndWithReference(jobject result, uint32_t saved_local_ref_cookie,\n                                                 Thread* self) {\n  GoToRunnable(self);\n  mirror::Object* o = self->DecodeJObject(result);  \/\/ Must decode before pop.\n  PopLocalReferences(saved_local_ref_cookie, self);\n  \/\/ Process result.\n  if (UNLIKELY(self->GetJniEnv()->check_jni)) {\n    if (self->IsExceptionPending()) {\n      return NULL;\n    }\n    CheckReferenceResult(o, self);\n  }\n  return o;\n}\n\nextern mirror::Object* JniMethodEndWithReferenceSynchronized(jobject result,\n                                                             uint32_t saved_local_ref_cookie,\n                                                             jobject locked, Thread* self) {\n  GoToRunnable(self);\n  UnlockJniSynchronizedMethod(locked, self);  \/\/ Must decode before pop.\n  mirror::Object* o = self->DecodeJObject(result);\n  PopLocalReferences(saved_local_ref_cookie, self);\n  \/\/ Process result.\n  if (UNLIKELY(self->GetJniEnv()->check_jni)) {\n    if (self->IsExceptionPending()) {\n      return NULL;\n    }\n    CheckReferenceResult(o, self);\n  }\n  return o;\n}\n\n}  \/\/ namespace art\n<commit_msg>Add VerifyObject calls to JniMethodEndWithReference.<commit_after>\/*\n * Copyright (C) 2012 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 \"dex_file-inl.h\"\n#include \"entrypoints\/entrypoint_utils.h\"\n#include \"mirror\/art_method-inl.h\"\n#include \"mirror\/class-inl.h\"\n#include \"mirror\/object.h\"\n#include \"mirror\/object-inl.h\"\n#include \"mirror\/object_array-inl.h\"\n#include \"object_utils.h\"\n#include \"scoped_thread_state_change.h\"\n#include \"thread.h\"\n\nnamespace art {\n\n\/\/ Called on entry to JNI, transition out of Runnable and release share of mutator_lock_.\nextern uint32_t JniMethodStart(Thread* self) {\n  JNIEnvExt* env = self->GetJniEnv();\n  DCHECK(env != nullptr);\n  uint32_t saved_local_ref_cookie = env->local_ref_cookie;\n  env->local_ref_cookie = env->locals.GetSegmentState();\n  mirror::ArtMethod* native_method = *self->GetManagedStack()->GetTopQuickFrame();\n  if (!native_method->IsFastNative()) {\n    \/\/ When not fast JNI we transition out of runnable.\n    self->TransitionFromRunnableToSuspended(kNative);\n  }\n  return saved_local_ref_cookie;\n}\n\nextern uint32_t JniMethodStartSynchronized(jobject to_lock, Thread* self) {\n  self->DecodeJObject(to_lock)->MonitorEnter(self);\n  return JniMethodStart(self);\n}\n\n\/\/ TODO: NO_THREAD_SAFETY_ANALYSIS due to different control paths depending on fast JNI.\nstatic void GoToRunnable(Thread* self) NO_THREAD_SAFETY_ANALYSIS {\n  mirror::ArtMethod* native_method = *self->GetManagedStack()->GetTopQuickFrame();\n  bool is_fast = native_method->IsFastNative();\n  if (!is_fast) {\n    self->TransitionFromSuspendedToRunnable();\n  } else if (UNLIKELY(self->TestAllFlags())) {\n    \/\/ In fast JNI mode we never transitioned out of runnable. Perform a suspend check if there\n    \/\/ is a flag raised.\n    DCHECK(Locks::mutator_lock_->IsSharedHeld(self));\n    CheckSuspend(self);\n  }\n}\n\nstatic void PopLocalReferences(uint32_t saved_local_ref_cookie, Thread* self) {\n  JNIEnvExt* env = self->GetJniEnv();\n  env->locals.SetSegmentState(env->local_ref_cookie);\n  env->local_ref_cookie = saved_local_ref_cookie;\n  self->PopSirt();\n}\n\nextern void JniMethodEnd(uint32_t saved_local_ref_cookie, Thread* self) {\n  GoToRunnable(self);\n  PopLocalReferences(saved_local_ref_cookie, self);\n}\n\n\nextern void JniMethodEndSynchronized(uint32_t saved_local_ref_cookie, jobject locked,\n                                     Thread* self) {\n  GoToRunnable(self);\n  UnlockJniSynchronizedMethod(locked, self);  \/\/ Must decode before pop.\n  PopLocalReferences(saved_local_ref_cookie, self);\n}\n\nextern mirror::Object* JniMethodEndWithReference(jobject result, uint32_t saved_local_ref_cookie,\n                                                 Thread* self) {\n  GoToRunnable(self);\n  mirror::Object* o = self->DecodeJObject(result);  \/\/ Must decode before pop.\n  PopLocalReferences(saved_local_ref_cookie, self);\n  \/\/ Process result.\n  if (UNLIKELY(self->GetJniEnv()->check_jni)) {\n    if (self->IsExceptionPending()) {\n      return NULL;\n    }\n    CheckReferenceResult(o, self);\n  }\n  VerifyObject(o);\n  return o;\n}\n\nextern mirror::Object* JniMethodEndWithReferenceSynchronized(jobject result,\n                                                             uint32_t saved_local_ref_cookie,\n                                                             jobject locked, Thread* self) {\n  GoToRunnable(self);\n  UnlockJniSynchronizedMethod(locked, self);  \/\/ Must decode before pop.\n  mirror::Object* o = self->DecodeJObject(result);\n  PopLocalReferences(saved_local_ref_cookie, self);\n  \/\/ Process result.\n  if (UNLIKELY(self->GetJniEnv()->check_jni)) {\n    if (self->IsExceptionPending()) {\n      return NULL;\n    }\n    CheckReferenceResult(o, self);\n  }\n  VerifyObject(o);\n  return o;\n}\n\n}  \/\/ namespace art\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2017 Intel Corporation. All rights reserved.\n\/\/ Use of this source code is governed by a MIT-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"camera_delegate.h\"\n#include <rs\/playback\/playback_context.h>\n#include <string>\n#include <vector>\n\nstatic const size_t MAX_USB_DEVICES = 256;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass CameraDelegateDeviceD {\n public:\n  friend class CameraDelegate;\n  friend class CameraDelegateDevice;\n\n  CameraDelegateDeviceD() {\n    device = nullptr;\n    streaming_counter = 0;\n    motion_handler_set = false;\n  }\n\n  rs::device* device;  \/\/ No need to delete this pointer\n  int streaming_counter;\n\n  typedef std::function<void(rs::motion_data)> motion_handler_t;\n  typedef std::function<void(rs::timestamp_data)> timestamp_handler_t;\n\n  std::vector<motion_handler_t> motion_handlers;\n  std::vector<timestamp_handler_t> timestamp_handlers;\n\n  bool motion_handler_set;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass CameraDelegateD {\n  CameraDelegateD() {\n    context = nullptr;\n    device_delegate.reserve(MAX_USB_DEVICES);  \/\/ Ensures no memory re-alloc\n    device_delegate.resize(0);\n  }\n\n  friend class CameraDelegate;\n  rs::core::context_interface* context;\n  std::vector<CameraDelegateDeviceD> device_delegate;\n  std::string playback_filename;\n\n  void ResetContext() {\n    delete context;\n    context = nullptr;\n  }\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nCameraDelegate::CameraDelegate() {\n  d_ = new CameraDelegateD();\n  ConnectToRealCamera();\n}\n\nCameraDelegate::~CameraDelegate() {\n  d_->ResetContext();\n  delete d_;\n}\n\nvoid CameraDelegate::ConnectToVirtualCamera(const std::string& fileName) {\n  d_->ResetContext();\n  d_->context = new rs::playback::context(fileName.c_str());\n  d_->playback_filename = fileName;\n  for (size_t i = 0 ; i < d_->device_delegate.size() ; ++i) {\n    d_->device_delegate[i].device = d_->context->get_device(i);\n  }\n}\n\nvoid CameraDelegate::ConnectToRealCamera() {\n  d_->ResetContext();\n  d_->context = new rs::core::context();\n  for (size_t i = 0 ; i < d_->device_delegate.size() ; ++i) {\n    d_->device_delegate[i].device = d_->context->get_device(i);\n  }\n  d_->playback_filename = \"\";\n}\n\nbool CameraDelegate::IsVirtualCamera() const {\n  return d_->playback_filename.length() > 0;\n}\n\nconst std::string& CameraDelegate::GetVirtualCameraFileName() const {\n  return d_->playback_filename;\n}\n\nint CameraDelegate::get_device_count() const {\n  return d_->context->get_device_count();\n}\n\nCameraDelegateDevice* CameraDelegate::get_device(int index) {\n  const size_t idx = index;\n  if (idx >= MAX_USB_DEVICES) {\n    return nullptr;\n  }\n  if (idx >= d_->device_delegate.size()) {\n    d_->device_delegate.resize(idx + 1);\n  }\n  d_->device_delegate[idx].device = d_->context->get_device(index);\n  return new CameraDelegateDevice(d_->device_delegate.data() + idx);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nCameraDelegateDevice::CameraDelegateDevice(CameraDelegateDeviceD* d) {\n  d_ = d;\n}\n\nCameraDelegateDevice::~CameraDelegateDevice() {\n}\n\nrs::device* CameraDelegateDevice::get_device() {\n  return d_->device;\n}\n\nconst char* CameraDelegateDevice::get_name() const {\n  return d_->device->get_name();\n}\n\nconst char* CameraDelegateDevice::get_serial() const {\n  return d_->device->get_serial();\n}\n\nconst char* CameraDelegateDevice::get_usb_port_id() const {\n  return d_->device->get_usb_port_id();\n}\n\nconst char* CameraDelegateDevice::get_firmware_version() const {\n  return d_->device->get_firmware_version();\n}\n\nconst char* CameraDelegateDevice::get_info(rs::camera_info info) const {\n  return d_->device->get_info(info);\n}\n\nrs::extrinsics CameraDelegateDevice::get_extrinsics(rs::stream from_stream,\n    rs::stream to_stream) const {\n  return d_->device->get_extrinsics(from_stream, to_stream);\n}\n\nrs::extrinsics CameraDelegateDevice::get_motion_extrinsics_from(\n    rs::stream from_stream) const {\n  return d_->device->get_motion_extrinsics_from(from_stream);\n}\n\nfloat CameraDelegateDevice::get_depth_scale() const {\n  return d_->device->get_depth_scale();\n}\n\nbool CameraDelegateDevice::supports_option(rs::option option) const {\n  return d_->device->supports_option(option);\n}\n\nint CameraDelegateDevice::get_stream_mode_count(rs::stream stream) const {\n  return d_->device->get_stream_mode_count(stream);\n}\n\nvoid CameraDelegateDevice::get_stream_mode(rs::stream stream, int index,\n    int& width, int& height, rs::format & format, int & framerate) const {\n  return d_->device->get_stream_mode(stream, index, width, height,\n    format, framerate);\n}\n\nvoid CameraDelegateDevice::enable_stream(rs::stream stream,\n    int width, int height, rs::format format, int framerate,\n    rs::output_buffer_format output_buffer_type) {\n  if (!is_streaming()) {\n    \/\/ Only when camera is not working\n    return d_->device->enable_stream(stream, width, height,\n        format, framerate, output_buffer_type);\n  }\n}\n\nvoid CameraDelegateDevice::enable_stream(rs::stream stream,\n    rs::preset preset) {\n  if (!is_streaming()) {\n    \/\/ Only when camera is not working\n    return d_->device->enable_stream(stream, preset);\n  }\n}\n\nvoid CameraDelegateDevice::disable_stream(rs::stream stream) {\n  if (!is_streaming()) {\n    \/\/ Only when camera is not working\n    return d_->device->disable_stream(stream);\n  }\n}\n\nbool CameraDelegateDevice::is_stream_enabled(rs::stream stream) const {\n  return d_->device->is_stream_enabled(stream);\n}\n\nint CameraDelegateDevice::get_stream_width(rs::stream stream) const {\n  return d_->device->get_stream_width(stream);\n}\n\nint CameraDelegateDevice::get_stream_height(rs::stream stream) const {\n  return d_->device->get_stream_height(stream);\n}\n\nrs::format CameraDelegateDevice::get_stream_format(rs::stream stream) const {\n  return d_->device->get_stream_format(stream);\n}\n\nint CameraDelegateDevice::get_stream_framerate(rs::stream stream) const {\n  return d_->device->get_stream_framerate(stream);\n}\n\nrs::intrinsics CameraDelegateDevice::get_stream_intrinsics(\n    rs::stream stream) const {\n  return d_->device->get_stream_intrinsics(stream);\n}\n\nrs::motion_intrinsics CameraDelegateDevice::get_motion_intrinsics() const {\n  return d_->device->get_motion_intrinsics();\n}\n\nvoid CameraDelegateDevice::set_frame_callback(rs::stream stream,\n    std::function<void(rs::frame)> frame_handler) {\n  return d_->device->set_frame_callback(stream, frame_handler);\n}\n\nvoid CameraDelegateDevice::enable_motion_tracking(\n    std::function<void(rs::motion_data)> motion_handler,\n    std::function<void(rs::timestamp_data)> timestamp_handler) {\n  if (!d_->motion_handler_set) {\n    d_->device->enable_motion_tracking([this](rs::motion_data data){\n      try {\n        for (auto i = this->d_->motion_handlers.begin();\n          i != this->d_->motion_handlers.end();\n          ++i) {\n          i->operator () (data);\n        }\n      } catch (...) {\n        \/\/ Absorb all exceptions\n      }\n    }, [this](rs::timestamp_data data){\n      try {\n        for (auto i = this->d_->timestamp_handlers.begin();\n          i != this->d_->timestamp_handlers.end();\n          ++i) {\n          i->operator () (data);\n        }\n      } catch (...) {\n        \/\/ Absorb all exceptions\n      }\n    });\n    d_->motion_handler_set = true;\n  }\n\n  d_->motion_handlers.push_back(motion_handler);\n  d_->timestamp_handlers.push_back(timestamp_handler);\n}\n\nvoid CameraDelegateDevice::enable_motion_tracking(\n    std::function<void(rs::motion_data)> motion_handler) {\n  if (!d_->motion_handler_set) {\n    d_->device->enable_motion_tracking([this](rs::motion_data data){\n      try {\n        for (auto i = this->d_->motion_handlers.begin();\n          i != this->d_->motion_handlers.end();\n          ++i) {\n          i->operator () (data);\n        }\n      } catch (...) {\n        \/\/ Absorb all exceptions\n      }\n    });\n    d_->motion_handler_set = true;\n  }\n\n  d_->motion_handlers.push_back(motion_handler);\n}\n\nvoid CameraDelegateDevice::disable_motion_tracking(void) {\n  d_->motion_handler_set = false;\n\n  try {\n    d_->device->disable_motion_tracking();\n\n    d_->motion_handlers.resize(0);\n    d_->timestamp_handlers.resize(0);\n  } catch (...) {\n    d_->motion_handlers.resize(0);\n    d_->timestamp_handlers.resize(0);\n  }\n}\n\nint CameraDelegateDevice::is_motion_tracking_active() {\n  return d_->device->is_motion_tracking_active();\n}\n\nvoid CameraDelegateDevice::start(rs::source source) {\n  ++d_->streaming_counter;\n  if (!is_streaming()) {\n    \/\/ Only call through for the first time\n    d_->device->start(source);\n  }\n}\n\nvoid CameraDelegateDevice::stop(rs::source source) {\n  --d_->streaming_counter;\n\n  if (d_->streaming_counter <= 0) {\n    d_->streaming_counter = 0;\n    \/\/ It's time to stop it for real\n    return d_->device->stop(source);\n  }\n}\n\nbool CameraDelegateDevice::is_streaming() const {\n  return d_->device->is_streaming();\n}\n\nvoid CameraDelegateDevice::get_option_range(rs::option option,\n    double & min, double & max, double & step) {\n  return d_->device->get_option_range(option, min, max, step);\n}\n\nvoid CameraDelegateDevice::get_option_range(rs::option option,\n    double & min, double & max, double & step, double & def) {\n  return d_->device->get_option_range(option, min, max, step, def);\n}\n\nvoid CameraDelegateDevice::get_options(const rs::option* options,\n    size_t count, double * values) {\n  return d_->device->get_options(options, count, values);\n}\n\nvoid CameraDelegateDevice::set_options(const rs::option* options,\n    size_t count, const double * values) {\n  return d_->device->set_options(options, count, values);\n}\n\ndouble CameraDelegateDevice::get_option(rs::option option) {\n  return d_->device->get_option(option);\n}\n\nconst char* CameraDelegateDevice::get_option_description(rs::option option) {\n  return d_->device->get_option_description(option);\n}\n\nvoid CameraDelegateDevice::set_option(rs::option option, double value) {\n  return d_->device->set_option(option, value);\n}\n\nvoid CameraDelegateDevice::wait_for_frames() {\n  return d_->device->wait_for_frames();\n}\n\nbool CameraDelegateDevice::poll_for_frames() {\n  return d_->device->poll_for_frames();\n}\n\nbool CameraDelegateDevice::supports(rs::capabilities capability) const {\n  return d_->device->supports(capability);\n}\n\nbool CameraDelegateDevice::supports(rs::camera_info info_param) const {\n  return d_->device->supports(info_param);\n}\n\ndouble CameraDelegateDevice::get_frame_timestamp(rs::stream stream) const {\n  return d_->device->get_frame_timestamp(stream);\n}\n\nunsigned long long CameraDelegateDevice::get_frame_number(  \/\/ NOLINT(*)\n    rs::stream stream) const {\n  return d_->device->get_frame_number(stream);\n}\n\nconst void* CameraDelegateDevice::get_frame_data(rs::stream stream) const {\n  return d_->device->get_frame_data(stream);\n}\n\nvoid CameraDelegateDevice::send_blob_to_device(rs::blob_type type,\n    void * data, int size) {\n  return d_->device->send_blob_to_device(type, data, size);\n}\n<commit_msg>Delay disabling motion tracking to enable more use case of camera-sharing by multiple clients<commit_after>\/\/ Copyright (c) 2017 Intel Corporation. All rights reserved.\n\/\/ Use of this source code is governed by a MIT-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"camera_delegate.h\"\n#include <rs\/playback\/playback_context.h>\n#include <string>\n#include <vector>\n\nstatic const size_t MAX_USB_DEVICES = 256;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass CameraDelegateDeviceD {\n public:\n  friend class CameraDelegate;\n  friend class CameraDelegateDevice;\n\n  CameraDelegateDeviceD() {\n    device = nullptr;\n    streaming_counter = 0;\n    motion_handler_set = false;\n  }\n\n  void disable_motion_tracking() {\n    try {\n      motion_handler_set = false;\n      device->disable_motion_tracking();\n\n      motion_handlers.resize(0);\n      timestamp_handlers.resize(0);\n    } catch (...) {\n      motion_handler_set = false;\n      motion_handlers.resize(0);\n      timestamp_handlers.resize(0);\n    }\n  }\n\n  rs::device* device;  \/\/ No need to delete this pointer\n  int streaming_counter;\n\n  typedef std::function<void(rs::motion_data)> motion_handler_t;\n  typedef std::function<void(rs::timestamp_data)> timestamp_handler_t;\n\n  std::vector<motion_handler_t> motion_handlers;\n  std::vector<timestamp_handler_t> timestamp_handlers;\n\n  bool motion_handler_set;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass CameraDelegateD {\n  CameraDelegateD() {\n    context = nullptr;\n    device_delegate.reserve(MAX_USB_DEVICES);  \/\/ Ensures no memory re-alloc\n    device_delegate.resize(0);\n  }\n\n  friend class CameraDelegate;\n  rs::core::context_interface* context;\n  std::vector<CameraDelegateDeviceD> device_delegate;\n  std::string playback_filename;\n\n  void ResetContext() {\n    delete context;\n    context = nullptr;\n  }\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nCameraDelegate::CameraDelegate() {\n  d_ = new CameraDelegateD();\n  ConnectToRealCamera();\n}\n\nCameraDelegate::~CameraDelegate() {\n  d_->ResetContext();\n  delete d_;\n}\n\nvoid CameraDelegate::ConnectToVirtualCamera(const std::string& fileName) {\n  d_->ResetContext();\n  d_->context = new rs::playback::context(fileName.c_str());\n  d_->playback_filename = fileName;\n  for (size_t i = 0 ; i < d_->device_delegate.size() ; ++i) {\n    d_->device_delegate[i].device = d_->context->get_device(i);\n  }\n}\n\nvoid CameraDelegate::ConnectToRealCamera() {\n  d_->ResetContext();\n  d_->context = new rs::core::context();\n  for (size_t i = 0 ; i < d_->device_delegate.size() ; ++i) {\n    d_->device_delegate[i].device = d_->context->get_device(i);\n  }\n  d_->playback_filename = \"\";\n}\n\nbool CameraDelegate::IsVirtualCamera() const {\n  return d_->playback_filename.length() > 0;\n}\n\nconst std::string& CameraDelegate::GetVirtualCameraFileName() const {\n  return d_->playback_filename;\n}\n\nint CameraDelegate::get_device_count() const {\n  return d_->context->get_device_count();\n}\n\nCameraDelegateDevice* CameraDelegate::get_device(int index) {\n  const size_t idx = index;\n  if (idx >= MAX_USB_DEVICES) {\n    return nullptr;\n  }\n  if (idx >= d_->device_delegate.size()) {\n    d_->device_delegate.resize(idx + 1);\n  }\n  d_->device_delegate[idx].device = d_->context->get_device(index);\n  return new CameraDelegateDevice(d_->device_delegate.data() + idx);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nCameraDelegateDevice::CameraDelegateDevice(CameraDelegateDeviceD* d) {\n  d_ = d;\n}\n\nCameraDelegateDevice::~CameraDelegateDevice() {\n}\n\nrs::device* CameraDelegateDevice::get_device() {\n  return d_->device;\n}\n\nconst char* CameraDelegateDevice::get_name() const {\n  return d_->device->get_name();\n}\n\nconst char* CameraDelegateDevice::get_serial() const {\n  return d_->device->get_serial();\n}\n\nconst char* CameraDelegateDevice::get_usb_port_id() const {\n  return d_->device->get_usb_port_id();\n}\n\nconst char* CameraDelegateDevice::get_firmware_version() const {\n  return d_->device->get_firmware_version();\n}\n\nconst char* CameraDelegateDevice::get_info(rs::camera_info info) const {\n  return d_->device->get_info(info);\n}\n\nrs::extrinsics CameraDelegateDevice::get_extrinsics(rs::stream from_stream,\n    rs::stream to_stream) const {\n  return d_->device->get_extrinsics(from_stream, to_stream);\n}\n\nrs::extrinsics CameraDelegateDevice::get_motion_extrinsics_from(\n    rs::stream from_stream) const {\n  return d_->device->get_motion_extrinsics_from(from_stream);\n}\n\nfloat CameraDelegateDevice::get_depth_scale() const {\n  return d_->device->get_depth_scale();\n}\n\nbool CameraDelegateDevice::supports_option(rs::option option) const {\n  return d_->device->supports_option(option);\n}\n\nint CameraDelegateDevice::get_stream_mode_count(rs::stream stream) const {\n  return d_->device->get_stream_mode_count(stream);\n}\n\nvoid CameraDelegateDevice::get_stream_mode(rs::stream stream, int index,\n    int& width, int& height, rs::format & format, int & framerate) const {\n  return d_->device->get_stream_mode(stream, index, width, height,\n    format, framerate);\n}\n\nvoid CameraDelegateDevice::enable_stream(rs::stream stream,\n    int width, int height, rs::format format, int framerate,\n    rs::output_buffer_format output_buffer_type) {\n  if (!is_streaming()) {\n    \/\/ Only when camera is not working\n    return d_->device->enable_stream(stream, width, height,\n        format, framerate, output_buffer_type);\n  }\n}\n\nvoid CameraDelegateDevice::enable_stream(rs::stream stream,\n    rs::preset preset) {\n  if (!is_streaming()) {\n    \/\/ Only when camera is not working\n    return d_->device->enable_stream(stream, preset);\n  }\n}\n\nvoid CameraDelegateDevice::disable_stream(rs::stream stream) {\n  if (!is_streaming()) {\n    \/\/ Only when camera is not working\n    return d_->device->disable_stream(stream);\n  }\n}\n\nbool CameraDelegateDevice::is_stream_enabled(rs::stream stream) const {\n  return d_->device->is_stream_enabled(stream);\n}\n\nint CameraDelegateDevice::get_stream_width(rs::stream stream) const {\n  return d_->device->get_stream_width(stream);\n}\n\nint CameraDelegateDevice::get_stream_height(rs::stream stream) const {\n  return d_->device->get_stream_height(stream);\n}\n\nrs::format CameraDelegateDevice::get_stream_format(rs::stream stream) const {\n  return d_->device->get_stream_format(stream);\n}\n\nint CameraDelegateDevice::get_stream_framerate(rs::stream stream) const {\n  return d_->device->get_stream_framerate(stream);\n}\n\nrs::intrinsics CameraDelegateDevice::get_stream_intrinsics(\n    rs::stream stream) const {\n  return d_->device->get_stream_intrinsics(stream);\n}\n\nrs::motion_intrinsics CameraDelegateDevice::get_motion_intrinsics() const {\n  return d_->device->get_motion_intrinsics();\n}\n\nvoid CameraDelegateDevice::set_frame_callback(rs::stream stream,\n    std::function<void(rs::frame)> frame_handler) {\n  return d_->device->set_frame_callback(stream, frame_handler);\n}\n\nvoid CameraDelegateDevice::enable_motion_tracking(\n    std::function<void(rs::motion_data)> motion_handler,\n    std::function<void(rs::timestamp_data)> timestamp_handler) {\n  if (!d_->motion_handler_set) {\n    d_->device->enable_motion_tracking([this](rs::motion_data data){\n      try {\n        for (auto i = this->d_->motion_handlers.begin();\n          i != this->d_->motion_handlers.end();\n          ++i) {\n          i->operator () (data);\n        }\n      } catch (...) {\n        \/\/ Absorb all exceptions\n      }\n    }, [this](rs::timestamp_data data){\n      try {\n        for (auto i = this->d_->timestamp_handlers.begin();\n          i != this->d_->timestamp_handlers.end();\n          ++i) {\n          i->operator () (data);\n        }\n      } catch (...) {\n        \/\/ Absorb all exceptions\n      }\n    });\n    d_->motion_handler_set = true;\n  }\n\n  d_->motion_handlers.push_back(motion_handler);\n  d_->timestamp_handlers.push_back(timestamp_handler);\n}\n\nvoid CameraDelegateDevice::enable_motion_tracking(\n    std::function<void(rs::motion_data)> motion_handler) {\n  if (!d_->motion_handler_set) {\n    d_->device->enable_motion_tracking([this](rs::motion_data data){\n      try {\n        for (auto i = this->d_->motion_handlers.begin();\n          i != this->d_->motion_handlers.end();\n          ++i) {\n          i->operator () (data);\n        }\n      } catch (...) {\n        \/\/ Absorb all exceptions\n      }\n    });\n    d_->motion_handler_set = true;\n  }\n\n  d_->motion_handlers.push_back(motion_handler);\n}\n\nvoid CameraDelegateDevice::disable_motion_tracking(void) {\n  if (is_streaming()) {\n    \/\/ Wait for full stop of the camera device\n    \/\/  This enables \"camera sharing\" usage by multiple clients\n  } else {\n    d_->disable_motion_tracking();\n  }\n}\n\nint CameraDelegateDevice::is_motion_tracking_active() {\n  return d_->device->is_motion_tracking_active();\n}\n\nvoid CameraDelegateDevice::start(rs::source source) {\n  ++d_->streaming_counter;\n  if (!is_streaming()) {\n    \/\/ Only call through for the first time\n    d_->device->start(source);\n  }\n}\n\nvoid CameraDelegateDevice::stop(rs::source source) {\n  --d_->streaming_counter;\n\n  if (d_->streaming_counter <= 0) {\n    d_->streaming_counter = 0;\n\n    d_->disable_motion_tracking();\n\n    \/\/ It's time to stop it for real\n    return d_->device->stop(source);\n  }\n}\n\nbool CameraDelegateDevice::is_streaming() const {\n  return d_->device->is_streaming();\n}\n\nvoid CameraDelegateDevice::get_option_range(rs::option option,\n    double & min, double & max, double & step) {\n  return d_->device->get_option_range(option, min, max, step);\n}\n\nvoid CameraDelegateDevice::get_option_range(rs::option option,\n    double & min, double & max, double & step, double & def) {\n  return d_->device->get_option_range(option, min, max, step, def);\n}\n\nvoid CameraDelegateDevice::get_options(const rs::option* options,\n    size_t count, double * values) {\n  return d_->device->get_options(options, count, values);\n}\n\nvoid CameraDelegateDevice::set_options(const rs::option* options,\n    size_t count, const double * values) {\n  return d_->device->set_options(options, count, values);\n}\n\ndouble CameraDelegateDevice::get_option(rs::option option) {\n  return d_->device->get_option(option);\n}\n\nconst char* CameraDelegateDevice::get_option_description(rs::option option) {\n  return d_->device->get_option_description(option);\n}\n\nvoid CameraDelegateDevice::set_option(rs::option option, double value) {\n  return d_->device->set_option(option, value);\n}\n\nvoid CameraDelegateDevice::wait_for_frames() {\n  return d_->device->wait_for_frames();\n}\n\nbool CameraDelegateDevice::poll_for_frames() {\n  return d_->device->poll_for_frames();\n}\n\nbool CameraDelegateDevice::supports(rs::capabilities capability) const {\n  return d_->device->supports(capability);\n}\n\nbool CameraDelegateDevice::supports(rs::camera_info info_param) const {\n  return d_->device->supports(info_param);\n}\n\ndouble CameraDelegateDevice::get_frame_timestamp(rs::stream stream) const {\n  return d_->device->get_frame_timestamp(stream);\n}\n\nunsigned long long CameraDelegateDevice::get_frame_number(  \/\/ NOLINT(*)\n    rs::stream stream) const {\n  return d_->device->get_frame_number(stream);\n}\n\nconst void* CameraDelegateDevice::get_frame_data(rs::stream stream) const {\n  return d_->device->get_frame_data(stream);\n}\n\nvoid CameraDelegateDevice::send_blob_to_device(rs::blob_type type,\n    void * data, int size) {\n  return d_->device->send_blob_to_device(type, data, size);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"compiler\/build_tables\/build_parse_table.h\"\n#include <algorithm>\n#include <map>\n#include <set>\n#include <string>\n#include <unordered_map>\n#include <utility>\n#include \"compiler\/parse_table.h\"\n#include \"compiler\/build_tables\/parse_conflict_manager.h\"\n#include \"compiler\/build_tables\/remove_duplicate_states.h\"\n#include \"compiler\/build_tables\/parse_item.h\"\n#include \"compiler\/build_tables\/item_set_closure.h\"\n#include \"compiler\/lexical_grammar.h\"\n#include \"compiler\/syntax_grammar.h\"\n#include \"compiler\/rules\/symbol.h\"\n#include \"compiler\/rules\/built_in_symbols.h\"\n#include \"compiler\/build_tables\/recovery_tokens.h\"\n\nnamespace tree_sitter {\nnamespace build_tables {\n\nusing std::find;\nusing std::pair;\nusing std::vector;\nusing std::set;\nusing std::map;\nusing std::string;\nusing std::to_string;\nusing std::unordered_map;\nusing std::make_shared;\nusing rules::Symbol;\n\nclass ParseTableBuilder {\n  const SyntaxGrammar grammar;\n  const LexicalGrammar lexical_grammar;\n  ParseConflictManager conflict_manager;\n  unordered_map<Symbol, ParseItemSet> recovery_states;\n  unordered_map<ParseItemSet, ParseStateId, ParseItemSet::Hash> parse_state_ids;\n  vector<pair<ParseItemSet, ParseStateId>> item_sets_to_process;\n  ParseTable parse_table;\n  std::set<string> conflicts;\n  ParseItemSet null_item_set;\n  std::set<const Production *> fragile_productions;\n  bool allow_any_conflict;\n\n public:\n  ParseTableBuilder(const SyntaxGrammar &grammar,\n                    const LexicalGrammar &lex_grammar)\n      : grammar(grammar),\n        lexical_grammar(lex_grammar),\n        allow_any_conflict(false) {}\n\n  pair<ParseTable, CompileError> build() {\n    Symbol start_symbol = Symbol(0, grammar.variables.empty());\n    Production start_production({\n      ProductionStep(start_symbol, 0, rules::AssociativityNone),\n    });\n\n    \/\/ Placeholder for error state\n    add_parse_state(ParseItemSet());\n\n    add_parse_state(ParseItemSet({\n      {\n        ParseItem(rules::START(), start_production, 0),\n        LookaheadSet({ rules::END_OF_INPUT() }),\n      },\n    }));\n\n    CompileError error = process_part_state_queue();\n    if (error.type != TSCompileErrorTypeNone)\n      return { parse_table, error };\n\n    for (const ParseState &state : parse_table.states)\n      for (const auto &pair1 : state.entries)\n        for (const auto &pair2 : state.entries)\n          parse_table.symbols[pair1.first].compatible_symbols.insert(pair2.first);\n\n    build_error_parse_state();\n\n    allow_any_conflict = true;\n    process_part_state_queue();\n    allow_any_conflict = false;\n\n    for (ParseStateId state = 0; state < parse_table.states.size(); state++)\n      add_reduce_extra_actions(state);\n\n    mark_fragile_actions();\n    remove_duplicate_parse_states();\n\n    return { parse_table, CompileError::none() };\n  }\n\n private:\n  CompileError process_part_state_queue() {\n    while (!item_sets_to_process.empty()) {\n      auto pair = item_sets_to_process.back();\n      ParseItemSet item_set = item_set_closure(pair.first, grammar);\n\n      ParseStateId state_id = pair.second;\n      item_sets_to_process.pop_back();\n\n      add_reduce_actions(item_set, state_id);\n      add_shift_actions(item_set, state_id);\n      add_shift_extra_actions(state_id);\n\n      if (!conflicts.empty()) {\n        return CompileError(TSCompileErrorTypeParseConflict,\n                            \"Unresolved conflict.\\n\\n\" + *conflicts.begin());\n      }\n    }\n\n    return CompileError::none();\n  }\n\n  void build_error_parse_state() {\n    ParseState error_state;\n\n    for (const Symbol &symbol : recovery_tokens(lexical_grammar)) {\n      add_out_of_context_parse_state(&error_state, symbol);\n    }\n\n    for (const Symbol &symbol : grammar.extra_tokens) {\n      error_state.entries[symbol].actions.push_back(ParseAction::ShiftExtra());\n    }\n\n    for (size_t i = 0; i < grammar.variables.size(); i++) {\n      Symbol symbol(i, false);\n      add_out_of_context_parse_state(&error_state, symbol);\n    }\n\n    error_state.entries[rules::END_OF_INPUT()].actions.push_back(\n      ParseAction::Recover(0));\n\n    parse_table.states[0] = error_state;\n  }\n\n  void add_out_of_context_parse_state(ParseState *error_state,\n                                      const rules::Symbol &symbol) {\n    const ParseItemSet &item_set = recovery_states[symbol];\n    if (!item_set.entries.empty()) {\n      ParseStateId state = add_parse_state(item_set);\n      error_state->entries[symbol].actions.push_back(ParseAction::Recover(state));\n    }\n  }\n\n  ParseStateId add_parse_state(const ParseItemSet &item_set) {\n    auto pair = parse_state_ids.find(item_set);\n    if (pair == parse_state_ids.end()) {\n      ParseStateId state_id = parse_table.add_state();\n\n      parse_state_ids[item_set] = state_id;\n      item_sets_to_process.push_back({ item_set, state_id });\n      return state_id;\n    } else {\n      return pair->second;\n    }\n  }\n\n  void add_shift_actions(const ParseItemSet &item_set, ParseStateId state_id) {\n    for (const auto &transition : item_set.transitions()) {\n      const Symbol &symbol = transition.first;\n      const ParseItemSet &next_item_set = transition.second.first;\n      const PrecedenceRange &precedence = transition.second.second;\n\n      ParseAction *new_action = add_action(\n        state_id, symbol, ParseAction::Shift(0, precedence), item_set);\n\n      if (!allow_any_conflict)\n        recovery_states[symbol].add(next_item_set);\n\n      if (new_action)\n        new_action->state_index = add_parse_state(next_item_set);\n    }\n  }\n\n  void add_reduce_actions(const ParseItemSet &item_set, ParseStateId state_id) {\n    for (const auto &pair : item_set.entries) {\n      const ParseItem &item = pair.first;\n      const auto &lookahead_symbols = pair.second;\n\n      ParseItem::CompletionStatus status = item.completion_status();\n      if (status.is_done) {\n        ParseAction action;\n        if (item.lhs() == rules::START()) {\n          action = ParseAction::Accept();\n        } else {\n          action = ParseAction::Reduce(Symbol(item.variable_index),\n                                       item.step_index, status.precedence,\n                                       status.associativity, *item.production);\n        }\n\n        for (const auto &lookahead_sym : *lookahead_symbols.entries)\n          add_action(state_id, lookahead_sym, action, item_set);\n      }\n    }\n  }\n\n  void add_shift_extra_actions(ParseStateId state_id) {\n    ParseAction action = ParseAction::ShiftExtra();\n    for (const Symbol &extra_symbol : grammar.extra_tokens)\n      add_action(state_id, extra_symbol, action, null_item_set);\n  }\n\n  void add_reduce_extra_actions(ParseStateId state_id) {\n    const ParseState &state = parse_table.states[state_id];\n\n    for (const Symbol &extra_symbol : grammar.extra_tokens) {\n      const auto &entry_for_symbol = state.entries.find(extra_symbol);\n      if (entry_for_symbol == state.entries.end())\n        continue;\n\n      for (const ParseAction &action : entry_for_symbol->second.actions)\n        if (action.type == ParseActionTypeShift && !action.extra) {\n          size_t dest_state_id = action.state_index;\n          ParseAction reduce_extra = ParseAction::ReduceExtra(extra_symbol);\n          for (const auto &pair : state.entries)\n            add_action(dest_state_id, pair.first, reduce_extra, null_item_set);\n        }\n    }\n  }\n\n  void mark_fragile_actions() {\n    for (ParseState &state : parse_table.states) {\n      set<Symbol> symbols_with_multiple_actions;\n\n      for (auto &entry : state.entries) {\n        const Symbol &symbol = entry.first;\n        auto &actions = entry.second.actions;\n\n        if (actions.size() > 1)\n          symbols_with_multiple_actions.insert(symbol);\n\n        for (ParseAction &action : actions) {\n          if (action.type == ParseActionTypeReduce && !action.extra) {\n            if (has_fragile_production(action.production))\n              action.fragile = true;\n\n            action.production = NULL;\n            action.precedence_range = PrecedenceRange();\n            action.associativity = rules::AssociativityNone;\n          }\n        }\n\n        for (auto i = actions.begin(); i != actions.end();) {\n          bool erased = false;\n          for (auto j = actions.begin(); j != i; j++) {\n            if (*j == *i) {\n              actions.erase(i);\n              erased = true;\n              break;\n            }\n          }\n          if (!erased)\n            ++i;\n        }\n      }\n\n      if (!symbols_with_multiple_actions.empty()) {\n        for (auto &entry : state.entries) {\n          if (!entry.first.is_token) {\n            set<Symbol> first_set = get_first_set(entry.first);\n            for (const Symbol &symbol : symbols_with_multiple_actions) {\n              if (first_set.count(symbol)) {\n                entry.second.reusable = false;\n                break;\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n\n  void remove_duplicate_parse_states() {\n    remove_duplicate_states<ParseTable, ParseAction>(&parse_table);\n  }\n\n  ParseAction *add_action(ParseStateId state_id, Symbol lookahead,\n                          const ParseAction &new_action,\n                          const ParseItemSet &item_set) {\n    const ParseState &state = parse_table.states[state_id];\n    const auto &current_entry = state.entries.find(lookahead);\n    if (current_entry == state.entries.end())\n      return &parse_table.set_action(state_id, lookahead, new_action);\n    if (allow_any_conflict)\n      return &parse_table.add_action(state_id, lookahead, new_action);\n\n    const ParseAction old_action = current_entry->second.actions[0];\n    auto resolution = conflict_manager.resolve(new_action, old_action);\n\n    switch (resolution.second) {\n      case ConflictTypeNone:\n        if (resolution.first)\n          return &parse_table.set_action(state_id, lookahead, new_action);\n        break;\n\n      case ConflictTypeResolved: {\n        if (resolution.first) {\n          if (old_action.type == ParseActionTypeReduce)\n            fragile_productions.insert(old_action.production);\n          return &parse_table.set_action(state_id, lookahead, new_action);\n        } else {\n          if (new_action.type == ParseActionTypeReduce)\n            fragile_productions.insert(new_action.production);\n          break;\n        }\n      }\n\n      case ConflictTypeUnresolved: {\n        if (handle_unresolved_conflict(item_set, lookahead)) {\n          if (old_action.type == ParseActionTypeReduce)\n            fragile_productions.insert(old_action.production);\n          if (new_action.type == ParseActionTypeReduce)\n            fragile_productions.insert(new_action.production);\n          return &parse_table.add_action(state_id, lookahead, new_action);\n        }\n        break;\n      }\n    }\n\n    return nullptr;\n  }\n\n  bool handle_unresolved_conflict(const ParseItemSet &item_set,\n                                  const Symbol &lookahead) {\n    set<Symbol> involved_symbols;\n    set<ParseItem> reduce_items;\n    set<ParseItem> core_shift_items;\n    set<ParseItem> other_shift_items;\n\n    for (const auto &pair : item_set.entries) {\n      const ParseItem &item = pair.first;\n      const LookaheadSet &lookahead_set = pair.second;\n\n      Symbol next_symbol = item.next_symbol();\n      if (next_symbol == rules::NONE()) {\n        if (lookahead_set.contains(lookahead)) {\n          involved_symbols.insert(item.lhs());\n          reduce_items.insert(item);\n        }\n      } else {\n        if (item.step_index > 0) {\n          set<Symbol> first_set = get_first_set(next_symbol);\n          if (first_set.count(lookahead)) {\n            involved_symbols.insert(item.lhs());\n            core_shift_items.insert(item);\n          }\n        } else if (next_symbol == lookahead) {\n          other_shift_items.insert(item);\n        }\n      }\n    }\n\n    for (const auto &conflict_set : grammar.expected_conflicts)\n      if (involved_symbols == conflict_set)\n        return true;\n\n    string description = \"Lookahead symbol: \" + symbol_name(lookahead) + \"\\n\";\n\n    if (!reduce_items.empty()) {\n      description += \"Reduce items:\\n\";\n      for (const ParseItem &item : reduce_items)\n        description += \"  \" + item_string(item) + \"\\n\";\n    }\n\n    if (!core_shift_items.empty()) {\n      description += \"Core shift items:\\n\";\n      for (const ParseItem &item : core_shift_items)\n        description += \"  \" + item_string(item) + \"\\n\";\n    }\n\n    if (!other_shift_items.empty()) {\n      description += \"Other shift items:\\n\";\n      for (const ParseItem &item : other_shift_items)\n        description += \"  \" + item_string(item) + \"\\n\";\n    }\n\n    conflicts.insert(description);\n    return false;\n  }\n\n  string item_string(const ParseItem &item) const {\n    string result = symbol_name(item.lhs()) + \" ->\";\n    size_t i = 0;\n    for (const ProductionStep &step : *item.production) {\n      if (i == item.step_index)\n        result += \" \\u2022\";\n      result += \" \" + symbol_name(step.symbol);\n      i++;\n    }\n    if (i == item.step_index)\n      result += \" \\u2022\";\n\n    result += \"   (prec \" + to_string(item.precedence());\n\n    switch (item.associativity()) {\n      case rules::AssociativityNone:\n        result += \")\";\n        break;\n      case rules::AssociativityLeft:\n        result += \", assoc left)\";\n        break;\n      case rules::AssociativityRight:\n        result += \", assoc right)\";\n        break;\n    }\n\n    return result;\n  }\n\n  set<Symbol> get_first_set(const Symbol &start_symbol) {\n    set<Symbol> result;\n    vector<Symbol> symbols_to_process({ start_symbol });\n\n    while (!symbols_to_process.empty()) {\n      Symbol symbol = symbols_to_process.back();\n      symbols_to_process.pop_back();\n      if (result.insert(symbol).second)\n        for (const Production &production : grammar.productions(symbol))\n          if (!production.empty())\n            symbols_to_process.push_back(production[0].symbol);\n    }\n\n    return result;\n  }\n\n  string symbol_name(const rules::Symbol &symbol) const {\n    if (symbol.is_built_in()) {\n      if (symbol == rules::END_OF_INPUT())\n        return \"END_OF_INPUT\";\n      else\n        return \"\";\n    } else if (symbol.is_token) {\n      const Variable &variable = lexical_grammar.variables[symbol.index];\n      if (variable.type == VariableTypeNamed)\n        return variable.name;\n      else\n        return \"'\" + variable.name + \"'\";\n    } else {\n      return grammar.variables[symbol.index].name;\n    }\n  }\n\n  bool has_fragile_production(const Production *production) {\n    auto end = fragile_productions.end();\n    return std::find(fragile_productions.begin(), end, production) != end;\n  }\n};\n\npair<ParseTable, CompileError> build_parse_table(\n  const SyntaxGrammar &grammar, const LexicalGrammar &lex_grammar) {\n  return ParseTableBuilder(grammar, lex_grammar).build();\n}\n\n}  \/\/ namespace build_tables\n}  \/\/ namespace tree_sitter\n<commit_msg>Don't have both shift and shift-extra actions in recovery states<commit_after>#include \"compiler\/build_tables\/build_parse_table.h\"\n#include <algorithm>\n#include <map>\n#include <set>\n#include <string>\n#include <unordered_map>\n#include <utility>\n#include \"compiler\/parse_table.h\"\n#include \"compiler\/build_tables\/parse_conflict_manager.h\"\n#include \"compiler\/build_tables\/remove_duplicate_states.h\"\n#include \"compiler\/build_tables\/parse_item.h\"\n#include \"compiler\/build_tables\/item_set_closure.h\"\n#include \"compiler\/lexical_grammar.h\"\n#include \"compiler\/syntax_grammar.h\"\n#include \"compiler\/rules\/symbol.h\"\n#include \"compiler\/rules\/built_in_symbols.h\"\n#include \"compiler\/build_tables\/recovery_tokens.h\"\n\nnamespace tree_sitter {\nnamespace build_tables {\n\nusing std::find;\nusing std::pair;\nusing std::vector;\nusing std::set;\nusing std::map;\nusing std::string;\nusing std::to_string;\nusing std::unordered_map;\nusing std::make_shared;\nusing rules::Symbol;\n\nclass ParseTableBuilder {\n  const SyntaxGrammar grammar;\n  const LexicalGrammar lexical_grammar;\n  ParseConflictManager conflict_manager;\n  unordered_map<Symbol, ParseItemSet> recovery_states;\n  unordered_map<ParseItemSet, ParseStateId, ParseItemSet::Hash> parse_state_ids;\n  vector<pair<ParseItemSet, ParseStateId>> item_sets_to_process;\n  ParseTable parse_table;\n  std::set<string> conflicts;\n  ParseItemSet null_item_set;\n  std::set<const Production *> fragile_productions;\n  bool allow_any_conflict;\n\n public:\n  ParseTableBuilder(const SyntaxGrammar &grammar,\n                    const LexicalGrammar &lex_grammar)\n      : grammar(grammar),\n        lexical_grammar(lex_grammar),\n        allow_any_conflict(false) {}\n\n  pair<ParseTable, CompileError> build() {\n    Symbol start_symbol = Symbol(0, grammar.variables.empty());\n    Production start_production({\n      ProductionStep(start_symbol, 0, rules::AssociativityNone),\n    });\n\n    \/\/ Placeholder for error state\n    add_parse_state(ParseItemSet());\n\n    add_parse_state(ParseItemSet({\n      {\n        ParseItem(rules::START(), start_production, 0),\n        LookaheadSet({ rules::END_OF_INPUT() }),\n      },\n    }));\n\n    CompileError error = process_part_state_queue();\n    if (error.type != TSCompileErrorTypeNone)\n      return { parse_table, error };\n\n    for (const ParseState &state : parse_table.states)\n      for (const auto &pair1 : state.entries)\n        for (const auto &pair2 : state.entries)\n          parse_table.symbols[pair1.first].compatible_symbols.insert(pair2.first);\n\n    build_error_parse_state();\n\n    allow_any_conflict = true;\n    process_part_state_queue();\n    allow_any_conflict = false;\n\n    for (ParseStateId state = 0; state < parse_table.states.size(); state++)\n      add_reduce_extra_actions(state);\n\n    mark_fragile_actions();\n    remove_duplicate_parse_states();\n\n    return { parse_table, CompileError::none() };\n  }\n\n private:\n  CompileError process_part_state_queue() {\n    while (!item_sets_to_process.empty()) {\n      auto pair = item_sets_to_process.back();\n      ParseItemSet item_set = item_set_closure(pair.first, grammar);\n\n      ParseStateId state_id = pair.second;\n      item_sets_to_process.pop_back();\n\n      add_reduce_actions(item_set, state_id);\n      add_shift_actions(item_set, state_id);\n      add_shift_extra_actions(state_id);\n\n      if (!conflicts.empty()) {\n        return CompileError(TSCompileErrorTypeParseConflict,\n                            \"Unresolved conflict.\\n\\n\" + *conflicts.begin());\n      }\n    }\n\n    return CompileError::none();\n  }\n\n  void build_error_parse_state() {\n    ParseState error_state;\n\n    for (const Symbol &symbol : recovery_tokens(lexical_grammar))\n      add_out_of_context_parse_state(&error_state, symbol);\n\n    for (const Symbol &symbol : grammar.extra_tokens)\n      if (!error_state.entries.count(symbol))\n        error_state.entries[symbol].actions.push_back(ParseAction::ShiftExtra());\n\n    for (size_t i = 0; i < grammar.variables.size(); i++) {\n      Symbol symbol(i, false);\n      add_out_of_context_parse_state(&error_state, symbol);\n    }\n\n    error_state.entries[rules::END_OF_INPUT()].actions.push_back(\n      ParseAction::Recover(0));\n\n    parse_table.states[0] = error_state;\n  }\n\n  void add_out_of_context_parse_state(ParseState *error_state,\n                                      const rules::Symbol &symbol) {\n    const ParseItemSet &item_set = recovery_states[symbol];\n    if (!item_set.entries.empty()) {\n      ParseStateId state = add_parse_state(item_set);\n      error_state->entries[symbol].actions.push_back(ParseAction::Recover(state));\n    }\n  }\n\n  ParseStateId add_parse_state(const ParseItemSet &item_set) {\n    auto pair = parse_state_ids.find(item_set);\n    if (pair == parse_state_ids.end()) {\n      ParseStateId state_id = parse_table.add_state();\n\n      parse_state_ids[item_set] = state_id;\n      item_sets_to_process.push_back({ item_set, state_id });\n      return state_id;\n    } else {\n      return pair->second;\n    }\n  }\n\n  void add_shift_actions(const ParseItemSet &item_set, ParseStateId state_id) {\n    for (const auto &transition : item_set.transitions()) {\n      const Symbol &symbol = transition.first;\n      const ParseItemSet &next_item_set = transition.second.first;\n      const PrecedenceRange &precedence = transition.second.second;\n\n      ParseAction *new_action = add_action(\n        state_id, symbol, ParseAction::Shift(0, precedence), item_set);\n\n      if (!allow_any_conflict)\n        recovery_states[symbol].add(next_item_set);\n\n      if (new_action)\n        new_action->state_index = add_parse_state(next_item_set);\n    }\n  }\n\n  void add_reduce_actions(const ParseItemSet &item_set, ParseStateId state_id) {\n    for (const auto &pair : item_set.entries) {\n      const ParseItem &item = pair.first;\n      const auto &lookahead_symbols = pair.second;\n\n      ParseItem::CompletionStatus status = item.completion_status();\n      if (status.is_done) {\n        ParseAction action;\n        if (item.lhs() == rules::START()) {\n          action = ParseAction::Accept();\n        } else {\n          action = ParseAction::Reduce(Symbol(item.variable_index),\n                                       item.step_index, status.precedence,\n                                       status.associativity, *item.production);\n        }\n\n        for (const auto &lookahead_sym : *lookahead_symbols.entries)\n          add_action(state_id, lookahead_sym, action, item_set);\n      }\n    }\n  }\n\n  void add_shift_extra_actions(ParseStateId state_id) {\n    ParseAction action = ParseAction::ShiftExtra();\n    ParseState &state = parse_table.states[state_id];\n    for (const Symbol &extra_symbol : grammar.extra_tokens)\n      if (!state.entries.count(extra_symbol) ||\n          (allow_any_conflict &&\n           state.entries[extra_symbol].actions.back().type ==\n             ParseActionTypeReduce))\n        parse_table.add_action(state_id, extra_symbol, action);\n  }\n\n  void add_reduce_extra_actions(ParseStateId state_id) {\n    const ParseState &state = parse_table.states[state_id];\n\n    for (const Symbol &extra_symbol : grammar.extra_tokens) {\n      const auto &entry_for_symbol = state.entries.find(extra_symbol);\n      if (entry_for_symbol == state.entries.end())\n        continue;\n\n      for (const ParseAction &action : entry_for_symbol->second.actions)\n        if (action.type == ParseActionTypeShift && !action.extra) {\n          size_t dest_state_id = action.state_index;\n          ParseAction reduce_extra = ParseAction::ReduceExtra(extra_symbol);\n          for (const auto &pair : state.entries)\n            add_action(dest_state_id, pair.first, reduce_extra, null_item_set);\n        }\n    }\n  }\n\n  void mark_fragile_actions() {\n    for (ParseState &state : parse_table.states) {\n      set<Symbol> symbols_with_multiple_actions;\n\n      for (auto &entry : state.entries) {\n        const Symbol &symbol = entry.first;\n        auto &actions = entry.second.actions;\n\n        if (actions.size() > 1)\n          symbols_with_multiple_actions.insert(symbol);\n\n        for (ParseAction &action : actions) {\n          if (action.type == ParseActionTypeReduce && !action.extra) {\n            if (has_fragile_production(action.production))\n              action.fragile = true;\n\n            action.production = NULL;\n            action.precedence_range = PrecedenceRange();\n            action.associativity = rules::AssociativityNone;\n          }\n        }\n\n        for (auto i = actions.begin(); i != actions.end();) {\n          bool erased = false;\n          for (auto j = actions.begin(); j != i; j++) {\n            if (*j == *i) {\n              actions.erase(i);\n              erased = true;\n              break;\n            }\n          }\n          if (!erased)\n            ++i;\n        }\n      }\n\n      if (!symbols_with_multiple_actions.empty()) {\n        for (auto &entry : state.entries) {\n          if (!entry.first.is_token) {\n            set<Symbol> first_set = get_first_set(entry.first);\n            for (const Symbol &symbol : symbols_with_multiple_actions) {\n              if (first_set.count(symbol)) {\n                entry.second.reusable = false;\n                break;\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n\n  void remove_duplicate_parse_states() {\n    remove_duplicate_states<ParseTable, ParseAction>(&parse_table);\n  }\n\n  ParseAction *add_action(ParseStateId state_id, Symbol lookahead,\n                          const ParseAction &new_action,\n                          const ParseItemSet &item_set) {\n    const ParseState &state = parse_table.states[state_id];\n    const auto &current_entry = state.entries.find(lookahead);\n    if (current_entry == state.entries.end())\n      return &parse_table.set_action(state_id, lookahead, new_action);\n    if (allow_any_conflict)\n      return &parse_table.add_action(state_id, lookahead, new_action);\n\n    const ParseAction old_action = current_entry->second.actions[0];\n    auto resolution = conflict_manager.resolve(new_action, old_action);\n\n    switch (resolution.second) {\n      case ConflictTypeNone:\n        if (resolution.first)\n          return &parse_table.set_action(state_id, lookahead, new_action);\n        break;\n\n      case ConflictTypeResolved: {\n        if (resolution.first) {\n          if (old_action.type == ParseActionTypeReduce)\n            fragile_productions.insert(old_action.production);\n          return &parse_table.set_action(state_id, lookahead, new_action);\n        } else {\n          if (new_action.type == ParseActionTypeReduce)\n            fragile_productions.insert(new_action.production);\n          break;\n        }\n      }\n\n      case ConflictTypeUnresolved: {\n        if (handle_unresolved_conflict(item_set, lookahead)) {\n          if (old_action.type == ParseActionTypeReduce)\n            fragile_productions.insert(old_action.production);\n          if (new_action.type == ParseActionTypeReduce)\n            fragile_productions.insert(new_action.production);\n          return &parse_table.add_action(state_id, lookahead, new_action);\n        }\n        break;\n      }\n    }\n\n    return nullptr;\n  }\n\n  bool handle_unresolved_conflict(const ParseItemSet &item_set,\n                                  const Symbol &lookahead) {\n    set<Symbol> involved_symbols;\n    set<ParseItem> reduce_items;\n    set<ParseItem> core_shift_items;\n    set<ParseItem> other_shift_items;\n\n    for (const auto &pair : item_set.entries) {\n      const ParseItem &item = pair.first;\n      const LookaheadSet &lookahead_set = pair.second;\n\n      Symbol next_symbol = item.next_symbol();\n      if (next_symbol == rules::NONE()) {\n        if (lookahead_set.contains(lookahead)) {\n          involved_symbols.insert(item.lhs());\n          reduce_items.insert(item);\n        }\n      } else {\n        if (item.step_index > 0) {\n          set<Symbol> first_set = get_first_set(next_symbol);\n          if (first_set.count(lookahead)) {\n            involved_symbols.insert(item.lhs());\n            core_shift_items.insert(item);\n          }\n        } else if (next_symbol == lookahead) {\n          other_shift_items.insert(item);\n        }\n      }\n    }\n\n    for (const auto &conflict_set : grammar.expected_conflicts)\n      if (involved_symbols == conflict_set)\n        return true;\n\n    string description = \"Lookahead symbol: \" + symbol_name(lookahead) + \"\\n\";\n\n    if (!reduce_items.empty()) {\n      description += \"Reduce items:\\n\";\n      for (const ParseItem &item : reduce_items)\n        description += \"  \" + item_string(item) + \"\\n\";\n    }\n\n    if (!core_shift_items.empty()) {\n      description += \"Core shift items:\\n\";\n      for (const ParseItem &item : core_shift_items)\n        description += \"  \" + item_string(item) + \"\\n\";\n    }\n\n    if (!other_shift_items.empty()) {\n      description += \"Other shift items:\\n\";\n      for (const ParseItem &item : other_shift_items)\n        description += \"  \" + item_string(item) + \"\\n\";\n    }\n\n    conflicts.insert(description);\n    return false;\n  }\n\n  string item_string(const ParseItem &item) const {\n    string result = symbol_name(item.lhs()) + \" ->\";\n    size_t i = 0;\n    for (const ProductionStep &step : *item.production) {\n      if (i == item.step_index)\n        result += \" \\u2022\";\n      result += \" \" + symbol_name(step.symbol);\n      i++;\n    }\n    if (i == item.step_index)\n      result += \" \\u2022\";\n\n    result += \"   (prec \" + to_string(item.precedence());\n\n    switch (item.associativity()) {\n      case rules::AssociativityNone:\n        result += \")\";\n        break;\n      case rules::AssociativityLeft:\n        result += \", assoc left)\";\n        break;\n      case rules::AssociativityRight:\n        result += \", assoc right)\";\n        break;\n    }\n\n    return result;\n  }\n\n  set<Symbol> get_first_set(const Symbol &start_symbol) {\n    set<Symbol> result;\n    vector<Symbol> symbols_to_process({ start_symbol });\n\n    while (!symbols_to_process.empty()) {\n      Symbol symbol = symbols_to_process.back();\n      symbols_to_process.pop_back();\n      if (result.insert(symbol).second)\n        for (const Production &production : grammar.productions(symbol))\n          if (!production.empty())\n            symbols_to_process.push_back(production[0].symbol);\n    }\n\n    return result;\n  }\n\n  string symbol_name(const rules::Symbol &symbol) const {\n    if (symbol.is_built_in()) {\n      if (symbol == rules::END_OF_INPUT())\n        return \"END_OF_INPUT\";\n      else\n        return \"\";\n    } else if (symbol.is_token) {\n      const Variable &variable = lexical_grammar.variables[symbol.index];\n      if (variable.type == VariableTypeNamed)\n        return variable.name;\n      else\n        return \"'\" + variable.name + \"'\";\n    } else {\n      return grammar.variables[symbol.index].name;\n    }\n  }\n\n  bool has_fragile_production(const Production *production) {\n    auto end = fragile_productions.end();\n    return std::find(fragile_productions.begin(), end, production) != end;\n  }\n};\n\npair<ParseTable, CompileError> build_parse_table(\n  const SyntaxGrammar &grammar, const LexicalGrammar &lex_grammar) {\n  return ParseTableBuilder(grammar, lex_grammar).build();\n}\n\n}  \/\/ namespace build_tables\n}  \/\/ namespace tree_sitter\n<|endoftext|>"}
{"text":"<commit_before>\/**\r\n * Scattering model classes\r\n * The classes use the IGOR library found in\r\n *   sansmodels\/src\/libigor\n *\/\r\n#include \"models.h\"\r\n#include <stdio.h>\r\nusing namespace std;\r\n\r\nextern \"C\" {\r\n\t#include \"libCylinder.h\"\r\n}\r\n\r\nCylinder :: Cylinder() {\r\n\tscale = 1.0;\r\n\tradius = 10.0;\r\n\tlength = 400.0;\r\n\tcontrast = 1.0;\r\n\tbackground = 0;\r\n}\r\n\r\ndouble Cylinder :: operator()(double q) {\r\n\tdouble dp[5];\r\n\t\/\/ Fill paramater array\r\n\tdp[0] = scale;\r\n\tdp[1] = radius;\r\n\tdp[2] = length;\r\n\tdp[3] = contrast;\r\n\tdp[4] = background;\r\n\r\n\t\/\/ Call library function to evaluate model\r\n\treturn CylinderForm(dp, q);\r\n}\r\n\r\nint main(void)\r\n{\r\n\tCylinder c = Cylinder();\r\n\tprintf(\"I(Q=%g) = %g\\n\", 0.001, c(0.001));\r\n\treturn 0;\r\n}\r\n<commit_msg>mistake in commit<commit_after>\/**\r\n * Scattering model classes\r\n * The classes use the IGOR library found in\r\n *   sansmodels\/src\/libigor\n *\/\r\n#include \"models.h\"\r\n#include <stdio.h>\r\nusing namespace std;\r\n\r\nextern \"C\" {\r\n\t#include \"libCylinder.h\"\r\n}\r\n\r\nCylindser :: Cylinder() {\r\n\tscale = 1.0;\r\n\tradius = 10.0;\r\n\tlength = 400.0;\r\n\tcontrast = 1.0;\r\n\tbackground = 0;\r\n}\r\n\r\ndouble Cylinder :: operator()(double q) {\r\n\tdouble dp[5];\r\n\t\/\/ Fill paramater array\r\n\tdp[0] = scale;\r\n\tdp[1] = radius;\r\n\tdp[2] = length;\r\n\tdp[3] = contrast;\r\n\tdp[4] = background;\r\n\r\n\t\/\/ Call library function to evaluate model\r\n\treturn CylinderForm(dp, q);\r\n}\r\n\r\nint main(void)\r\n{\r\n\tCylinder c = Cylinder();\r\n\tprintf(\"I(Q=%g) = %g\\n\", 0.001, c(0.001));\r\n\treturn 0;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Fix \"make check\" after deprecations<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n *  soundpicker.cpp  -  widget to select a sound file or a beep\n *  Program:  kalarm\n *  Copyright © 2002-2007 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 <QTimer>\n#include <QLabel>\n#include <QHBoxLayout>\n\n#include <kglobal.h>\n#include <klocale.h>\n#include <kfiledialog.h>\n#include <kstandarddirs.h>\n#include <kiconloader.h>\n#include <khbox.h>\n#include <phonon\/backendcapabilities.h>\n#include <kdebug.h>\n\n#include \"combobox.h\"\n#include \"functions.h\"\n#include \"kalarmapp.h\"\n#include \"pushbutton.h\"\n#include \"sounddlg.h\"\n#include \"soundpicker.moc\"\n\n\nstatic QMap<Preferences::SoundType, int> indexes;    \/\/ mapping from sound type to combo index\n\n\n\/\/ Collect these widget labels together to ensure consistent wording and\n\/\/ translations across different modules.\nQString SoundPicker::i18n_label_Sound()   { return i18nc(\"@label:listbox\", \"Sound:\"); }\nQString SoundPicker::i18n_combo_None()    { return i18nc(\"@item:inlistbox No sound\", \"None\"); }\nQString SoundPicker::i18n_combo_Beep()    { return i18nc(\"@item:inlistbox\", \"Beep\"); }\nQString SoundPicker::i18n_combo_Speak()   { return i18nc(\"@item:inlistbox\", \"Speak\"); }\nQString SoundPicker::i18n_combo_File()    { return i18nc(\"@item:inlistbox\", \"Sound file\"); }\n\n\nSoundPicker::SoundPicker(QWidget* parent)\n\t: QFrame(parent),\n\t  mRevertType(false)\n{\n\tQHBoxLayout* soundLayout = new QHBoxLayout(this);\n\tsoundLayout->setMargin(0);\n\tsoundLayout->setSpacing(2*KDialog::spacingHint());\n\tmTypeBox = new KHBox(this);    \/\/ this is to control the QWhatsThis text display area\n\tmTypeBox->setMargin(0);\n\tmTypeBox->setSpacing(KDialog::spacingHint());\n\n\tQLabel* label = new QLabel(i18n_label_Sound(), mTypeBox);\n\tlabel->setFixedSize(label->sizeHint());\n\n\t\/\/ Sound type combo box\n\t\/\/ The order of combo box entries must correspond with the 'Type' enum.\n\tif (indexes.isEmpty())\n\t{\n\t\tindexes[Preferences::Sound_None]     = 0;\n\t\tindexes[Preferences::Sound_Beep]     = 1;\n\t\tindexes[Preferences::Sound_File] = 2;\n\t\tindexes[Preferences::Sound_Speak]    = 3;\n\t}\n\n\tmTypeCombo = new ComboBox(mTypeBox);\n\tmTypeCombo->addItem(i18n_combo_None());     \/\/ index None\n\tmTypeCombo->addItem(i18n_combo_Beep());     \/\/ index Beep\n\tmTypeCombo->addItem(i18n_combo_File());     \/\/ index PlayFile\n\tmSpeakShowing = !theApp()->speechEnabled();\n\tshowSpeak(!mSpeakShowing);            \/\/ index Speak (only displayed if appropriate)\n\tconnect(mTypeCombo, SIGNAL(activated(int)), SLOT(slotTypeSelected(int)));\n\tlabel->setBuddy(mTypeCombo);\n\tsoundLayout->addWidget(mTypeBox);\n\n\t\/\/ Sound file picker button\n\tmFilePicker = new PushButton(this);\n\tmFilePicker->setIcon(SmallIcon(\"playsound\"));\n\tmFilePicker->setFixedSize(mFilePicker->sizeHint());\n\tconnect(mFilePicker, SIGNAL(clicked()), SLOT(slotPickFile()));\n\tmFilePicker->setToolTip(i18nc(\"@info:tooltip\", \"Configure sound file\"));\n\tmFilePicker->setWhatsThis(i18nc(\"@info:whatsthis\", \"Configure a sound file to play when the alarm is displayed.\"));\n\tsoundLayout->addWidget(mFilePicker);\n\n\t\/\/ Initialise the file picker button state and tooltip\n\tmTypeCombo->setCurrentIndex(indexes[Preferences::Sound_None]);\n\tmFilePicker->setEnabled(false);\n}\n\n\/******************************************************************************\n* Set the read-only status of the widget.\n*\/\nvoid SoundPicker::setReadOnly(bool readOnly)\n{\n\tmTypeCombo->setReadOnly(readOnly);\n\tmFilePicker->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\tshow = false;    \/\/ speech capability is not installed\n\tif (show == mSpeakShowing)\n\t\treturn;    \/\/ no change\n\tif (!show  &&  mTypeCombo->currentIndex() == indexes[Preferences::Sound_Speak])\n\t\tmTypeCombo->setCurrentIndex(indexes[Preferences::Sound_None]);\n\tif (mTypeCombo->count() == indexes[Preferences::Sound_Speak]+1)\n\t\tmTypeCombo->removeItem(indexes[Preferences::Sound_Speak]);    \/\/ precaution in case of mix-ups\n\tQString whatsThis;\n\tQString opt1 = i18nc(\"@info:whatsthis\", \"<interface>%1<\/interface>: the message is displayed silently.\", i18n_combo_None());\n\tQString opt2 = i18nc(\"@info:whatsthis\", \"<interface>%1<\/interface>: a simple beep is sounded.\", i18n_combo_Beep());\n\tQString opt3 = i18nc(\"@info:whatsthis\", \"<interface>%1<\/interface>: an audio file is played. You will be prompted to choose the file and set play options.\", i18n_combo_File());\n\tif (show)\n\t{\n\t\tmTypeCombo->addItem(i18n_combo_Speak());\n\t\tQString opt4 = i18nc(\"@info:whatsthis\", \"<interface>%1<\/interface>: the message text is spoken.\", i18n_combo_Speak());\n\t\twhatsThis = i18nc(\"@info:whatsthis Combination of multiple whatsthis items\",\n\t\t                  \"<para>Choose a sound to play when the message is displayed:\"\n\t\t                  \"<list><item>%1<\/item>\"\n\t\t                  \"<item>%2<\/item>\"\n\t\t                  \"<item>%3<\/item>\"\n\t\t                  \"<item>%4<\/item><\/list><\/para>\", opt1, opt2, opt3, opt4);\n\t}\n\telse\n\t\twhatsThis = i18nc(\"@info:whatsthis Combination of multiple whatsthis items\",\n\t\t                  \"<para>Choose a sound to play when the message is displayed:\"\n\t\t                  \"<list><item>%1<\/item>\"\n\t\t                  \"<item>%2<\/item>\"\n\t\t                  \"<item>%3<\/item><\/list><\/para>\", opt1, opt2, opt3);\n\tmTypeBox->setWhatsThis(whatsThis);\n\tmSpeakShowing = show;\n}\n\n\/******************************************************************************\n* Return the currently selected option.\n*\/\nPreferences::SoundType SoundPicker::sound() const\n{\n\tint current = mTypeCombo->currentIndex();\n\tfor (QMap<Preferences::SoundType, int>::const_iterator it = indexes.constBegin();  it != indexes.constEnd();  ++it)\n\t\tif (it.value() == current)\n\t\t\treturn it.key();\n\treturn Preferences::Sound_None;\n}\n\n\/******************************************************************************\n* Return the selected sound file, if the File option is selected.\n* Returns empty URL if File is not currently selected.\n*\/\nKUrl SoundPicker::file() const\n{\n\treturn (mTypeCombo->currentIndex() == indexes[Preferences::Sound_File]) ? mFile : KUrl();\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 (mTypeCombo->currentIndex() == indexes[Preferences::Sound_File]  &&  !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 mTypeCombo->currentIndex() == indexes[Preferences::Sound_File]  &&  !mFile.isEmpty()  &&  mRepeat;\n}\n\n\/******************************************************************************\n* Initialise the widget's state.\n*\/\nvoid SoundPicker::set(Preferences::SoundType type, const QString& f, float volume, float fadeVolume, int fadeSeconds, bool repeat)\n{\n\tif (type == Preferences::Sound_File  &&  f.isEmpty())\n\t\ttype = Preferences::Sound_Beep;\n\tmFile        = KUrl(f);\n\tmVolume      = volume;\n\tmFadeVolume  = fadeVolume;\n\tmFadeSeconds = fadeSeconds;\n\tmRepeat      = repeat;\n\tmTypeCombo->setCurrentIndex(indexes[type]);  \/\/ this doesn't trigger slotTypeSelected()\n\tmFilePicker->setEnabled(type == Preferences::Sound_File);\n\tmTypeCombo->setToolTip(type == Preferences::Sound_File ? mFile.prettyUrl() : QString());\n\tmLastType = type;\n}\n\n\/******************************************************************************\n* Called when the sound option is changed.\n*\/\nvoid SoundPicker::slotTypeSelected(int id)\n{\n\tPreferences::SoundType newType = Preferences::Sound_None;\n\tfor (QMap<Preferences::SoundType, int>::const_iterator it = indexes.constBegin();  it != indexes.constEnd();  ++it)\n\t{\n\t\tif (it.value() == id)\n\t\t{\n\t\t\tnewType = it.key();\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (newType == mLastType  ||  mRevertType)\n\t\treturn;\n\tif (mLastType == Preferences::Sound_File)\n\t{\n\t\tmFilePicker->setEnabled(false);\n\t\tmTypeCombo->setToolTip(QString());\n\t}\n\telse if (newType == Preferences::Sound_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(true);\n\t\tmTypeCombo->setToolTip(mFile.prettyUrl());\n\t}\n\tmLastType = newType;\n}\n\n\/******************************************************************************\n* Called when the file picker button is clicked.\n*\/\nvoid SoundPicker::slotPickFile()\n{\n\tKUrl file = mFile;\n\tSoundDlg dlg(mFile.prettyUrl(), mVolume, mFadeVolume, mFadeSeconds, mRepeat, i18nc(\"@title:window\", \"Sound File\"), this);\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\tif (mFile.isEmpty())\n\t{\n\t\t\/\/ No audio file is selected, so revert to previously selected option\n#if 0\n\/\/ Remove mRevertType, setLastType(), #include QTimer\n\t\t\/\/ But wait a moment until setting the radio button, or it won't work.\n\t\tmRevertType = true;   \/\/ prevent sound dialog popping up twice\n\t\tQTimer::singleShot(0, this, SLOT(setLastType()));\n#else\n\t\tmTypeCombo->setCurrentIndex(indexes[mLastType]);\n#endif\n\t\tmTypeCombo->setToolTip(QString());\n\t}\n\telse\n\t\tmTypeCombo->setToolTip(mFile.prettyUrl());\n}\n\n\/******************************************************************************\n* Select the previously selected sound type.\n*\/\nvoid SoundPicker::setLastType()\n{\n\tmTypeCombo->setCurrentIndex(indexes[mLastType]);\n\tmRevertType = false;\n}\n\n\/******************************************************************************\n* Display a dialog 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\tQString filter = Phonon::BackendCapabilities::availableMimeTypes().join(\" \");\n\treturn KAlarm::browseFile(i18nc(\"@title:window\", \"Choose Sound File\"), defaultDir, initialFile, filter, KFile::ExistingOnly, 0);\n}\n<commit_msg>use the correct icon for the media playback<commit_after>\/*\n *  soundpicker.cpp  -  widget to select a sound file or a beep\n *  Program:  kalarm\n *  Copyright © 2002-2007 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 <QTimer>\n#include <QLabel>\n#include <QHBoxLayout>\n\n#include <kglobal.h>\n#include <klocale.h>\n#include <kfiledialog.h>\n#include <kstandarddirs.h>\n#include <kiconloader.h>\n#include <khbox.h>\n#include <phonon\/backendcapabilities.h>\n#include <kdebug.h>\n\n#include \"combobox.h\"\n#include \"functions.h\"\n#include \"kalarmapp.h\"\n#include \"pushbutton.h\"\n#include \"sounddlg.h\"\n#include \"soundpicker.moc\"\n\n\nstatic QMap<Preferences::SoundType, int> indexes;    \/\/ mapping from sound type to combo index\n\n\n\/\/ Collect these widget labels together to ensure consistent wording and\n\/\/ translations across different modules.\nQString SoundPicker::i18n_label_Sound()   { return i18nc(\"@label:listbox\", \"Sound:\"); }\nQString SoundPicker::i18n_combo_None()    { return i18nc(\"@item:inlistbox No sound\", \"None\"); }\nQString SoundPicker::i18n_combo_Beep()    { return i18nc(\"@item:inlistbox\", \"Beep\"); }\nQString SoundPicker::i18n_combo_Speak()   { return i18nc(\"@item:inlistbox\", \"Speak\"); }\nQString SoundPicker::i18n_combo_File()    { return i18nc(\"@item:inlistbox\", \"Sound file\"); }\n\n\nSoundPicker::SoundPicker(QWidget* parent)\n\t: QFrame(parent),\n\t  mRevertType(false)\n{\n\tQHBoxLayout* soundLayout = new QHBoxLayout(this);\n\tsoundLayout->setMargin(0);\n\tsoundLayout->setSpacing(2*KDialog::spacingHint());\n\tmTypeBox = new KHBox(this);    \/\/ this is to control the QWhatsThis text display area\n\tmTypeBox->setMargin(0);\n\tmTypeBox->setSpacing(KDialog::spacingHint());\n\n\tQLabel* label = new QLabel(i18n_label_Sound(), mTypeBox);\n\tlabel->setFixedSize(label->sizeHint());\n\n\t\/\/ Sound type combo box\n\t\/\/ The order of combo box entries must correspond with the 'Type' enum.\n\tif (indexes.isEmpty())\n\t{\n\t\tindexes[Preferences::Sound_None]     = 0;\n\t\tindexes[Preferences::Sound_Beep]     = 1;\n\t\tindexes[Preferences::Sound_File] = 2;\n\t\tindexes[Preferences::Sound_Speak]    = 3;\n\t}\n\n\tmTypeCombo = new ComboBox(mTypeBox);\n\tmTypeCombo->addItem(i18n_combo_None());     \/\/ index None\n\tmTypeCombo->addItem(i18n_combo_Beep());     \/\/ index Beep\n\tmTypeCombo->addItem(i18n_combo_File());     \/\/ index PlayFile\n\tmSpeakShowing = !theApp()->speechEnabled();\n\tshowSpeak(!mSpeakShowing);            \/\/ index Speak (only displayed if appropriate)\n\tconnect(mTypeCombo, SIGNAL(activated(int)), SLOT(slotTypeSelected(int)));\n\tlabel->setBuddy(mTypeCombo);\n\tsoundLayout->addWidget(mTypeBox);\n\n\t\/\/ Sound file picker button\n\tmFilePicker = new PushButton(this);\n\tmFilePicker->setIcon(SmallIcon(\"media-playback-start\"));\n\tmFilePicker->setFixedSize(mFilePicker->sizeHint());\n\tconnect(mFilePicker, SIGNAL(clicked()), SLOT(slotPickFile()));\n\tmFilePicker->setToolTip(i18nc(\"@info:tooltip\", \"Configure sound file\"));\n\tmFilePicker->setWhatsThis(i18nc(\"@info:whatsthis\", \"Configure a sound file to play when the alarm is displayed.\"));\n\tsoundLayout->addWidget(mFilePicker);\n\n\t\/\/ Initialise the file picker button state and tooltip\n\tmTypeCombo->setCurrentIndex(indexes[Preferences::Sound_None]);\n\tmFilePicker->setEnabled(false);\n}\n\n\/******************************************************************************\n* Set the read-only status of the widget.\n*\/\nvoid SoundPicker::setReadOnly(bool readOnly)\n{\n\tmTypeCombo->setReadOnly(readOnly);\n\tmFilePicker->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\tshow = false;    \/\/ speech capability is not installed\n\tif (show == mSpeakShowing)\n\t\treturn;    \/\/ no change\n\tif (!show  &&  mTypeCombo->currentIndex() == indexes[Preferences::Sound_Speak])\n\t\tmTypeCombo->setCurrentIndex(indexes[Preferences::Sound_None]);\n\tif (mTypeCombo->count() == indexes[Preferences::Sound_Speak]+1)\n\t\tmTypeCombo->removeItem(indexes[Preferences::Sound_Speak]);    \/\/ precaution in case of mix-ups\n\tQString whatsThis;\n\tQString opt1 = i18nc(\"@info:whatsthis\", \"<interface>%1<\/interface>: the message is displayed silently.\", i18n_combo_None());\n\tQString opt2 = i18nc(\"@info:whatsthis\", \"<interface>%1<\/interface>: a simple beep is sounded.\", i18n_combo_Beep());\n\tQString opt3 = i18nc(\"@info:whatsthis\", \"<interface>%1<\/interface>: an audio file is played. You will be prompted to choose the file and set play options.\", i18n_combo_File());\n\tif (show)\n\t{\n\t\tmTypeCombo->addItem(i18n_combo_Speak());\n\t\tQString opt4 = i18nc(\"@info:whatsthis\", \"<interface>%1<\/interface>: the message text is spoken.\", i18n_combo_Speak());\n\t\twhatsThis = i18nc(\"@info:whatsthis Combination of multiple whatsthis items\",\n\t\t                  \"<para>Choose a sound to play when the message is displayed:\"\n\t\t                  \"<list><item>%1<\/item>\"\n\t\t                  \"<item>%2<\/item>\"\n\t\t                  \"<item>%3<\/item>\"\n\t\t                  \"<item>%4<\/item><\/list><\/para>\", opt1, opt2, opt3, opt4);\n\t}\n\telse\n\t\twhatsThis = i18nc(\"@info:whatsthis Combination of multiple whatsthis items\",\n\t\t                  \"<para>Choose a sound to play when the message is displayed:\"\n\t\t                  \"<list><item>%1<\/item>\"\n\t\t                  \"<item>%2<\/item>\"\n\t\t                  \"<item>%3<\/item><\/list><\/para>\", opt1, opt2, opt3);\n\tmTypeBox->setWhatsThis(whatsThis);\n\tmSpeakShowing = show;\n}\n\n\/******************************************************************************\n* Return the currently selected option.\n*\/\nPreferences::SoundType SoundPicker::sound() const\n{\n\tint current = mTypeCombo->currentIndex();\n\tfor (QMap<Preferences::SoundType, int>::const_iterator it = indexes.constBegin();  it != indexes.constEnd();  ++it)\n\t\tif (it.value() == current)\n\t\t\treturn it.key();\n\treturn Preferences::Sound_None;\n}\n\n\/******************************************************************************\n* Return the selected sound file, if the File option is selected.\n* Returns empty URL if File is not currently selected.\n*\/\nKUrl SoundPicker::file() const\n{\n\treturn (mTypeCombo->currentIndex() == indexes[Preferences::Sound_File]) ? mFile : KUrl();\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 (mTypeCombo->currentIndex() == indexes[Preferences::Sound_File]  &&  !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 mTypeCombo->currentIndex() == indexes[Preferences::Sound_File]  &&  !mFile.isEmpty()  &&  mRepeat;\n}\n\n\/******************************************************************************\n* Initialise the widget's state.\n*\/\nvoid SoundPicker::set(Preferences::SoundType type, const QString& f, float volume, float fadeVolume, int fadeSeconds, bool repeat)\n{\n\tif (type == Preferences::Sound_File  &&  f.isEmpty())\n\t\ttype = Preferences::Sound_Beep;\n\tmFile        = KUrl(f);\n\tmVolume      = volume;\n\tmFadeVolume  = fadeVolume;\n\tmFadeSeconds = fadeSeconds;\n\tmRepeat      = repeat;\n\tmTypeCombo->setCurrentIndex(indexes[type]);  \/\/ this doesn't trigger slotTypeSelected()\n\tmFilePicker->setEnabled(type == Preferences::Sound_File);\n\tmTypeCombo->setToolTip(type == Preferences::Sound_File ? mFile.prettyUrl() : QString());\n\tmLastType = type;\n}\n\n\/******************************************************************************\n* Called when the sound option is changed.\n*\/\nvoid SoundPicker::slotTypeSelected(int id)\n{\n\tPreferences::SoundType newType = Preferences::Sound_None;\n\tfor (QMap<Preferences::SoundType, int>::const_iterator it = indexes.constBegin();  it != indexes.constEnd();  ++it)\n\t{\n\t\tif (it.value() == id)\n\t\t{\n\t\t\tnewType = it.key();\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (newType == mLastType  ||  mRevertType)\n\t\treturn;\n\tif (mLastType == Preferences::Sound_File)\n\t{\n\t\tmFilePicker->setEnabled(false);\n\t\tmTypeCombo->setToolTip(QString());\n\t}\n\telse if (newType == Preferences::Sound_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(true);\n\t\tmTypeCombo->setToolTip(mFile.prettyUrl());\n\t}\n\tmLastType = newType;\n}\n\n\/******************************************************************************\n* Called when the file picker button is clicked.\n*\/\nvoid SoundPicker::slotPickFile()\n{\n\tKUrl file = mFile;\n\tSoundDlg dlg(mFile.prettyUrl(), mVolume, mFadeVolume, mFadeSeconds, mRepeat, i18nc(\"@title:window\", \"Sound File\"), this);\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\tif (mFile.isEmpty())\n\t{\n\t\t\/\/ No audio file is selected, so revert to previously selected option\n#if 0\n\/\/ Remove mRevertType, setLastType(), #include QTimer\n\t\t\/\/ But wait a moment until setting the radio button, or it won't work.\n\t\tmRevertType = true;   \/\/ prevent sound dialog popping up twice\n\t\tQTimer::singleShot(0, this, SLOT(setLastType()));\n#else\n\t\tmTypeCombo->setCurrentIndex(indexes[mLastType]);\n#endif\n\t\tmTypeCombo->setToolTip(QString());\n\t}\n\telse\n\t\tmTypeCombo->setToolTip(mFile.prettyUrl());\n}\n\n\/******************************************************************************\n* Select the previously selected sound type.\n*\/\nvoid SoundPicker::setLastType()\n{\n\tmTypeCombo->setCurrentIndex(indexes[mLastType]);\n\tmRevertType = false;\n}\n\n\/******************************************************************************\n* Display a dialog 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\tQString filter = Phonon::BackendCapabilities::availableMimeTypes().join(\" \");\n\treturn KAlarm::browseFile(i18nc(\"@title:window\", \"Choose Sound File\"), defaultDir, initialFile, filter, KFile::ExistingOnly, 0);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2014 Thorben Kroeger <thorbenkroeger@gmail.com>.\n** Contact: http:\/\/www.qt-project.org\/legal\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia.  For licensing terms and\n** conditions see http:\/\/www.qt.io\/licensing.  For further information\n** use the contact form at http:\/\/www.qt.io\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 or version 3 as published by the Free\n** Software Foundation and appearing in the file LICENSE.LGPLv21 and\n** LICENSE.LGPLv3 included in the packaging of this file.  Please review the\n** following information to ensure the GNU Lesser General Public License\n** requirements will be met: https:\/\/www.gnu.org\/licenses\/lgpl.html and\n** http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, 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 \"themesettingswidget.h\"\n#include \"coreconstants.h\"\n#include \"icore.h\"\n#include \"manhattanstyle.h\"\n#include \"themeeditor\/themesettingstablemodel.h\"\n\n#include <utils\/theme\/theme.h>\n#include <utils\/theme\/theme_p.h>\n#include <utils\/qtcassert.h>\n\n#include <QDebug>\n#include <QDir>\n#include <QInputDialog>\n#include <QMessageBox>\n#include <QSettings>\n#include <QStyleFactory>\n\n#include \"ui_themesettings.h\"\n\nusing namespace Utils;\n\nnamespace Core {\nnamespace Internal {\n\nconst char themeNameKey[] = \"ThemeName\";\n\nstatic QString customThemesPath()\n{\n    return ICore::userResourcePath() + QLatin1String(\"\/themes\/\");\n}\n\nstatic QString createThemeFileName(const QString &pattern)\n{\n    const QString stylesPath = customThemesPath();\n    QString baseFileName = stylesPath;\n    baseFileName += pattern;\n\n    \/\/ Find an available file name\n    int i = 1;\n    QString fileName;\n    do {\n        fileName = baseFileName.arg((i == 1) ? QString() : QString::number(i));\n        ++i;\n    } while (QFile::exists(fileName));\n\n    \/\/ Create the base directory when it doesn't exist\n    if (!QFile::exists(stylesPath) && !QDir().mkpath(stylesPath)) {\n        qWarning() << \"Failed to create theme directory:\" << stylesPath;\n        return QString();\n    }\n    return fileName;\n}\n\n\nstruct ThemeEntry\n{\n    ThemeEntry() {}\n    ThemeEntry(const QString &name, const QString &filePath, bool readOnly):\n        m_name(name),\n        m_filePath(filePath),\n        m_readOnly(readOnly)\n    {\n    }\n\n    QString name() const { return m_name; }\n    QString displayName() const;\n    QString filePath() const { return m_filePath; }\n    bool readOnly() const { return m_readOnly; }\n\nprivate:\n    QString m_name;\n    QString m_filePath;\n    bool m_readOnly;\n};\n\nQString ThemeEntry::displayName() const\n{\n    QSettings settings(filePath(), QSettings::IniFormat);\n    QString n = settings.value(QLatin1String(themeNameKey), QCoreApplication::tr(\"unnamed\")).toString();\n    return m_readOnly ? QCoreApplication::tr(\"%1 (built-in)\").arg(n) : n;\n}\n\n\nclass ThemeListModel : public QAbstractListModel\n{\npublic:\n    ThemeListModel(QObject *parent = 0):\n        QAbstractListModel(parent)\n    {\n    }\n\n    int rowCount(const QModelIndex &parent) const\n    {\n        return parent.isValid() ? 0 : m_themes.size();\n    }\n\n    QVariant data(const QModelIndex &index, int role) const\n    {\n        if (role == Qt::DisplayRole)\n            return m_themes.at(index.row()).displayName();\n        return QVariant();\n    }\n\n    void removeTheme(int index)\n    {\n        beginRemoveRows(QModelIndex(), index, index);\n        m_themes.removeAt(index);\n        endRemoveRows();\n    }\n\n    void setThemes(const QList<ThemeEntry> &themes)\n    {\n        beginResetModel();\n        m_themes = themes;\n        endResetModel();\n    }\n\n    const ThemeEntry &themeAt(int index) const\n    {\n        return m_themes.at(index);\n    }\n\nprivate:\n    QList<ThemeEntry> m_themes;\n};\n\n\nclass ThemeSettingsPrivate\n{\npublic:\n    ThemeSettingsPrivate(QWidget *widget);\n    ~ThemeSettingsPrivate();\n\npublic:\n    ThemeListModel *m_themeListModel;\n    bool m_refreshingThemeList;\n    Ui::ThemeSettings *m_ui;\n    ThemeEntry m_currentTheme;\n};\n\nThemeSettingsPrivate::ThemeSettingsPrivate(QWidget *widget)\n    : m_themeListModel(new ThemeListModel)\n    , m_refreshingThemeList(false)\n    , m_ui(new Ui::ThemeSettings)\n{\n    m_currentTheme = ThemeEntry(creatorTheme()->name(), creatorTheme()->filePath(), true);\n    m_ui->setupUi(widget);\n    m_ui->editor->hide(); \/\/ TODO: Restore after improving the editor\n    m_ui->themeComboBox->setModel(m_themeListModel);\n}\n\nThemeSettingsPrivate::~ThemeSettingsPrivate()\n{\n    delete m_themeListModel;\n    delete m_ui;\n}\n\nThemeSettingsWidget::ThemeSettingsWidget(QWidget *parent) :\n    QWidget(parent)\n{\n    d = new ThemeSettingsPrivate(this);\n\n    connect(d->m_ui->themeComboBox, static_cast<void(QComboBox::*)(int)>(&QComboBox::currentIndexChanged),\n           this, &ThemeSettingsWidget::themeSelected);\n    connect(d->m_ui->copyButton, &QAbstractButton::clicked, this, &ThemeSettingsWidget::copyTheme);\n    connect(d->m_ui->renameButton, &QAbstractButton::clicked, this, &ThemeSettingsWidget::renameTheme);\n    connect(d->m_ui->deleteButton, &QAbstractButton::clicked, this, &ThemeSettingsWidget::confirmDeleteTheme);\n\n    refreshThemeList();\n}\n\nThemeSettingsWidget::~ThemeSettingsWidget()\n{\n    delete d;\n}\n\nvoid ThemeSettingsWidget::refreshThemeList()\n{\n    QList<ThemeEntry> themes;\n\n    QDir themeDir(ICore::resourcePath() + QLatin1String(\"\/themes\"));\n    themeDir.setNameFilters(QStringList() << QLatin1String(\"*.creatortheme\"));\n    themeDir.setFilter(QDir::Files);\n\n    int selected = 0;\n\n    QStringList themeList = themeDir.entryList();\n    const QString defaultTheme = QLatin1String(\"default.creatortheme\");\n    if (themeList.removeOne(defaultTheme))\n        themeList.prepend(defaultTheme);\n    const QLatin1String extension(\".creatortheme\");\n    for (int i = 0, total = themeList.count(); i < total; ++i) {\n        const QString fileName = themeList.at(i);\n        if (d->m_currentTheme.name() + extension == fileName)\n            selected = i;\n        QString name = fileName;\n        name.remove(extension);\n        themes.append(ThemeEntry(name, themeDir.absoluteFilePath(fileName), true));\n    }\n\n    if (themes.isEmpty())\n        qWarning() << \"Warning: no themes found in path:\" << themeDir.path();\n\n    themeDir.setPath(customThemesPath());\n    foreach (const QString &file, themeDir.entryList()) {\n        const QString fileName = themeDir.absoluteFilePath(file);\n        if (d->m_currentTheme.name() == fileName)\n            selected = themes.size();\n        themes.append(ThemeEntry(fileName, fileName, false));\n    }\n\n    d->m_currentTheme = themes[selected];\n\n    d->m_refreshingThemeList = true;\n    d->m_themeListModel->setThemes(themes);\n    d->m_ui->themeComboBox->setCurrentIndex(selected);\n    d->m_refreshingThemeList = false;\n}\n\nvoid ThemeSettingsWidget::themeSelected(int index)\n{\n    bool readOnly = true;\n    if (index != -1) {\n        \/\/ Check whether we're switching away from a changed theme\n        if (!d->m_refreshingThemeList)\n            maybeSaveTheme();\n\n        const ThemeEntry &entry = d->m_themeListModel->themeAt(index);\n        readOnly = entry.readOnly();\n        d->m_currentTheme = entry;\n\n        QSettings settings(entry.filePath(), QSettings::IniFormat);\n        Theme theme(entry.name());\n        theme.readSettings(settings);\n        d->m_ui->editor->initFrom(&theme);\n    }\n    d->m_ui->copyButton->setEnabled(index != -1);\n    d->m_ui->deleteButton->setEnabled(!readOnly);\n    d->m_ui->renameButton->setEnabled(!readOnly);\n    d->m_ui->editor->setReadOnly(readOnly);\n}\n\nvoid ThemeSettingsWidget::confirmDeleteTheme()\n{\n    const int index = d->m_ui->themeComboBox->currentIndex();\n    if (index == -1)\n        return;\n\n    const ThemeEntry &entry = d->m_themeListModel->themeAt(index);\n    if (entry.readOnly())\n        return;\n\n    QMessageBox *messageBox = new QMessageBox(QMessageBox::Warning,\n                                              tr(\"Delete Theme\"),\n                                              tr(\"Are you sure you want to delete the theme '%1' permanently?\").arg(entry.displayName()),\n                                              QMessageBox::Discard | QMessageBox::Cancel,\n                                              d->m_ui->deleteButton->window());\n\n    \/\/ Change the text and role of the discard button\n    QPushButton *deleteButton = static_cast<QPushButton*>(messageBox->button(QMessageBox::Discard));\n    deleteButton->setText(tr(\"Delete\"));\n    messageBox->addButton(deleteButton, QMessageBox::AcceptRole);\n    messageBox->setDefaultButton(deleteButton);\n\n    connect(deleteButton, &QAbstractButton::clicked, messageBox, &QDialog::accept);\n    connect(messageBox, &QDialog::accepted, this, &ThemeSettingsWidget::deleteTheme);\n    messageBox->setAttribute(Qt::WA_DeleteOnClose);\n    messageBox->open();\n}\n\nvoid ThemeSettingsWidget::deleteTheme()\n{\n    const int index = d->m_ui->themeComboBox->currentIndex();\n    QTC_ASSERT(index != -1, return);\n\n    const ThemeEntry &entry = d->m_themeListModel->themeAt(index);\n    QTC_ASSERT(!entry.readOnly(), return);\n\n    if (QFile::remove(entry.filePath()))\n        d->m_themeListModel->removeTheme(index);\n}\n\nvoid ThemeSettingsWidget::copyTheme()\n{\n    QInputDialog *dialog = new QInputDialog(d->m_ui->copyButton->window());\n    dialog->setAttribute(Qt::WA_DeleteOnClose);\n    dialog->setInputMode(QInputDialog::TextInput);\n    dialog->setWindowTitle(tr(\"Copy Theme\"));\n    dialog->setLabelText(tr(\"Theme name:\"));\n\n    \/\/TODO\n    \/\/dialog->setTextValue(tr(\"%1 (copy)\").arg(d_ptr->m_value.colorScheme().displayName()));\n\n    connect(dialog, &QInputDialog::textValueSelected, this, &ThemeSettingsWidget::copyThemeByName);\n    dialog->open();\n}\n\nvoid ThemeSettingsWidget::maybeSaveTheme()\n{\n    if (!d->m_ui->editor->model()->hasChanges())\n        return;\n\n    QMessageBox *messageBox = new QMessageBox(QMessageBox::Warning,\n                                              tr(\"Theme Changed\"),\n                                              tr(\"The theme \\\"%1\\\" was modified, do you want to save the changes?\")\n                                                  .arg(d->m_currentTheme.displayName()),\n                                              QMessageBox::Discard | QMessageBox::Save,\n                                              d->m_ui->themeComboBox->window());\n\n    \/\/ Change the text of the discard button\n    QPushButton *discardButton = static_cast<QPushButton*>(messageBox->button(QMessageBox::Discard));\n    discardButton->setText(tr(\"Discard\"));\n    messageBox->addButton(discardButton, QMessageBox::DestructiveRole);\n    messageBox->setDefaultButton(QMessageBox::Save);\n\n    if (messageBox->exec() == QMessageBox::Save) {\n        Theme newTheme(d->m_currentTheme.name());\n        d->m_ui->editor->model()->toTheme(&newTheme);\n        newTheme.writeSettings(d->m_currentTheme.filePath());\n    }\n}\n\nvoid ThemeSettingsWidget::renameTheme()\n{\n    int index = d->m_ui->themeComboBox->currentIndex();\n    if (index == -1)\n        return;\n    const ThemeEntry &entry = d->m_themeListModel->themeAt(index);\n\n    maybeSaveTheme();\n\n    QInputDialog *dialog = new QInputDialog(d->m_ui->renameButton->window());\n    dialog->setInputMode(QInputDialog::TextInput);\n    dialog->setWindowTitle(tr(\"Rename Theme\"));\n    dialog->setLabelText(tr(\"Theme name:\"));\n    dialog->setTextValue(d->m_ui->editor->model()->m_name);\n    int ret = dialog->exec();\n    QString newName = dialog->textValue();\n    delete dialog;\n\n    if (ret != QDialog::Accepted || newName.isEmpty())\n        return;\n\n    \/\/ overwrite file with new name\n    Theme newTheme(entry.name());\n    d->m_ui->editor->model()->toTheme(&newTheme);\n    newTheme.setName(newName);\n    newTheme.writeSettings(entry.filePath());\n\n    refreshThemeList();\n}\n\nvoid ThemeSettingsWidget::copyThemeByName(const QString &name)\n{\n    int index = d->m_ui->themeComboBox->currentIndex();\n    if (index == -1)\n        return;\n\n    const ThemeEntry &entry = d->m_themeListModel->themeAt(index);\n\n    QString baseFileName = QFileInfo(entry.filePath()).completeBaseName();\n    baseFileName += QLatin1String(\"_copy%1.creatortheme\");\n    QString fileName = createThemeFileName(baseFileName);\n\n    if (fileName.isEmpty())\n        return;\n\n    \/\/ Ask about saving any existing modifactions\n    maybeSaveTheme();\n\n    Theme newTheme(fileName);\n    d->m_ui->editor->model()->toTheme(&newTheme);\n    newTheme.setName(name);\n    newTheme.writeSettings(fileName);\n\n    d->m_currentTheme = ThemeEntry(fileName, fileName, true);\n\n    refreshThemeList();\n}\n\nvoid ThemeSettingsWidget::apply()\n{\n    const QString themeName = d->m_currentTheme.name();\n    Theme *newTheme = new Theme(themeName);\n    if (d->m_currentTheme.readOnly()) {\n        QSettings themeSettings(d->m_currentTheme.filePath(), QSettings::IniFormat);\n        newTheme->readSettings(themeSettings);\n    } else {\n        d->m_ui->editor->model()->toTheme(newTheme);\n        newTheme->writeSettings(d->m_currentTheme.filePath());\n    }\n    setCreatorTheme(newTheme);\n    emit ICore::instance()->themeChanged();\n    QPalette pal = newTheme->flag(Theme::ApplyThemePaletteGlobally) ? newTheme->palette()\n                                                                    : Theme::initialPalette();\n    QApplication::setPalette(pal);\n    if (ManhattanStyle *style = qobject_cast<ManhattanStyle *>(QApplication::style())) {\n        QStyle *baseStyle = 0;\n        foreach (const QString &s, creatorTheme()->preferredStyles()) {\n            if ((baseStyle = QStyleFactory::create(s)))\n                break;\n        }\n        style->setBaseStyle(baseStyle);\n    }\n    foreach (QWidget *w, QApplication::topLevelWidgets())\n        w->update();\n\n    \/\/ save filename of selected theme in global config\n    QSettings *settings = Core::ICore::settings();\n    settings->setValue(QLatin1String(Core::Constants::SETTINGS_THEME), themeName);\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace Core\n<commit_msg>Theming: Cache display name in ThemeSettingsWidget<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2014 Thorben Kroeger <thorbenkroeger@gmail.com>.\n** Contact: http:\/\/www.qt-project.org\/legal\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia.  For licensing terms and\n** conditions see http:\/\/www.qt.io\/licensing.  For further information\n** use the contact form at http:\/\/www.qt.io\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 or version 3 as published by the Free\n** Software Foundation and appearing in the file LICENSE.LGPLv21 and\n** LICENSE.LGPLv3 included in the packaging of this file.  Please review the\n** following information to ensure the GNU Lesser General Public License\n** requirements will be met: https:\/\/www.gnu.org\/licenses\/lgpl.html and\n** http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, 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 \"themesettingswidget.h\"\n#include \"coreconstants.h\"\n#include \"icore.h\"\n#include \"manhattanstyle.h\"\n#include \"themeeditor\/themesettingstablemodel.h\"\n\n#include <utils\/theme\/theme.h>\n#include <utils\/theme\/theme_p.h>\n#include <utils\/qtcassert.h>\n\n#include <QDebug>\n#include <QDir>\n#include <QInputDialog>\n#include <QMessageBox>\n#include <QSettings>\n#include <QStyleFactory>\n\n#include \"ui_themesettings.h\"\n\nusing namespace Utils;\n\nnamespace Core {\nnamespace Internal {\n\nconst char themeNameKey[] = \"ThemeName\";\n\nstatic QString customThemesPath()\n{\n    return ICore::userResourcePath() + QLatin1String(\"\/themes\/\");\n}\n\nstatic QString createThemeFileName(const QString &pattern)\n{\n    const QString stylesPath = customThemesPath();\n    QString baseFileName = stylesPath;\n    baseFileName += pattern;\n\n    \/\/ Find an available file name\n    int i = 1;\n    QString fileName;\n    do {\n        fileName = baseFileName.arg((i == 1) ? QString() : QString::number(i));\n        ++i;\n    } while (QFile::exists(fileName));\n\n    \/\/ Create the base directory when it doesn't exist\n    if (!QFile::exists(stylesPath) && !QDir().mkpath(stylesPath)) {\n        qWarning() << \"Failed to create theme directory:\" << stylesPath;\n        return QString();\n    }\n    return fileName;\n}\n\n\nstruct ThemeEntry\n{\n    ThemeEntry() {}\n    ThemeEntry(const QString &name, const QString &filePath, bool readOnly):\n        m_name(name),\n        m_filePath(filePath),\n        m_readOnly(readOnly)\n    {\n    }\n\n    QString name() const { return m_name; }\n    QString displayName() const;\n    QString filePath() const { return m_filePath; }\n    bool readOnly() const { return m_readOnly; }\n\nprivate:\n    QString m_name;\n    QString m_filePath;\n    mutable QString m_displayName;\n    bool m_readOnly;\n};\n\nQString ThemeEntry::displayName() const\n{\n    if (m_displayName.isEmpty()) {\n        QSettings settings(filePath(), QSettings::IniFormat);\n        m_displayName = settings.value(QLatin1String(themeNameKey),\n                                       QCoreApplication::tr(\"unnamed\")).toString();\n        if (m_readOnly)\n            m_displayName = QCoreApplication::tr(\"%1 (built-in)\").arg(m_displayName);\n    }\n    return m_displayName;\n}\n\n\nclass ThemeListModel : public QAbstractListModel\n{\npublic:\n    ThemeListModel(QObject *parent = 0):\n        QAbstractListModel(parent)\n    {\n    }\n\n    int rowCount(const QModelIndex &parent) const\n    {\n        return parent.isValid() ? 0 : m_themes.size();\n    }\n\n    QVariant data(const QModelIndex &index, int role) const\n    {\n        if (role == Qt::DisplayRole)\n            return m_themes.at(index.row()).displayName();\n        return QVariant();\n    }\n\n    void removeTheme(int index)\n    {\n        beginRemoveRows(QModelIndex(), index, index);\n        m_themes.removeAt(index);\n        endRemoveRows();\n    }\n\n    void setThemes(const QList<ThemeEntry> &themes)\n    {\n        beginResetModel();\n        m_themes = themes;\n        endResetModel();\n    }\n\n    const ThemeEntry &themeAt(int index) const\n    {\n        return m_themes.at(index);\n    }\n\nprivate:\n    QList<ThemeEntry> m_themes;\n};\n\n\nclass ThemeSettingsPrivate\n{\npublic:\n    ThemeSettingsPrivate(QWidget *widget);\n    ~ThemeSettingsPrivate();\n\npublic:\n    ThemeListModel *m_themeListModel;\n    bool m_refreshingThemeList;\n    Ui::ThemeSettings *m_ui;\n    ThemeEntry m_currentTheme;\n};\n\nThemeSettingsPrivate::ThemeSettingsPrivate(QWidget *widget)\n    : m_themeListModel(new ThemeListModel)\n    , m_refreshingThemeList(false)\n    , m_ui(new Ui::ThemeSettings)\n{\n    m_currentTheme = ThemeEntry(creatorTheme()->name(), creatorTheme()->filePath(), true);\n    m_ui->setupUi(widget);\n    m_ui->editor->hide(); \/\/ TODO: Restore after improving the editor\n    m_ui->themeComboBox->setModel(m_themeListModel);\n}\n\nThemeSettingsPrivate::~ThemeSettingsPrivate()\n{\n    delete m_themeListModel;\n    delete m_ui;\n}\n\nThemeSettingsWidget::ThemeSettingsWidget(QWidget *parent) :\n    QWidget(parent)\n{\n    d = new ThemeSettingsPrivate(this);\n\n    connect(d->m_ui->themeComboBox, static_cast<void(QComboBox::*)(int)>(&QComboBox::currentIndexChanged),\n           this, &ThemeSettingsWidget::themeSelected);\n    connect(d->m_ui->copyButton, &QAbstractButton::clicked, this, &ThemeSettingsWidget::copyTheme);\n    connect(d->m_ui->renameButton, &QAbstractButton::clicked, this, &ThemeSettingsWidget::renameTheme);\n    connect(d->m_ui->deleteButton, &QAbstractButton::clicked, this, &ThemeSettingsWidget::confirmDeleteTheme);\n\n    refreshThemeList();\n}\n\nThemeSettingsWidget::~ThemeSettingsWidget()\n{\n    delete d;\n}\n\nvoid ThemeSettingsWidget::refreshThemeList()\n{\n    QList<ThemeEntry> themes;\n\n    QDir themeDir(ICore::resourcePath() + QLatin1String(\"\/themes\"));\n    themeDir.setNameFilters(QStringList() << QLatin1String(\"*.creatortheme\"));\n    themeDir.setFilter(QDir::Files);\n\n    int selected = 0;\n\n    QStringList themeList = themeDir.entryList();\n    const QString defaultTheme = QLatin1String(\"default.creatortheme\");\n    if (themeList.removeOne(defaultTheme))\n        themeList.prepend(defaultTheme);\n    const QLatin1String extension(\".creatortheme\");\n    for (int i = 0, total = themeList.count(); i < total; ++i) {\n        const QString fileName = themeList.at(i);\n        if (d->m_currentTheme.name() + extension == fileName)\n            selected = i;\n        QString name = fileName;\n        name.remove(extension);\n        themes.append(ThemeEntry(name, themeDir.absoluteFilePath(fileName), true));\n    }\n\n    if (themes.isEmpty())\n        qWarning() << \"Warning: no themes found in path:\" << themeDir.path();\n\n    themeDir.setPath(customThemesPath());\n    foreach (const QString &file, themeDir.entryList()) {\n        const QString fileName = themeDir.absoluteFilePath(file);\n        if (d->m_currentTheme.name() == fileName)\n            selected = themes.size();\n        themes.append(ThemeEntry(fileName, fileName, false));\n    }\n\n    d->m_currentTheme = themes[selected];\n\n    d->m_refreshingThemeList = true;\n    d->m_themeListModel->setThemes(themes);\n    d->m_ui->themeComboBox->setCurrentIndex(selected);\n    d->m_refreshingThemeList = false;\n}\n\nvoid ThemeSettingsWidget::themeSelected(int index)\n{\n    bool readOnly = true;\n    if (index != -1) {\n        \/\/ Check whether we're switching away from a changed theme\n        if (!d->m_refreshingThemeList)\n            maybeSaveTheme();\n\n        const ThemeEntry &entry = d->m_themeListModel->themeAt(index);\n        readOnly = entry.readOnly();\n        d->m_currentTheme = entry;\n\n        QSettings settings(entry.filePath(), QSettings::IniFormat);\n        Theme theme(entry.name());\n        theme.readSettings(settings);\n        d->m_ui->editor->initFrom(&theme);\n    }\n    d->m_ui->copyButton->setEnabled(index != -1);\n    d->m_ui->deleteButton->setEnabled(!readOnly);\n    d->m_ui->renameButton->setEnabled(!readOnly);\n    d->m_ui->editor->setReadOnly(readOnly);\n}\n\nvoid ThemeSettingsWidget::confirmDeleteTheme()\n{\n    const int index = d->m_ui->themeComboBox->currentIndex();\n    if (index == -1)\n        return;\n\n    const ThemeEntry &entry = d->m_themeListModel->themeAt(index);\n    if (entry.readOnly())\n        return;\n\n    QMessageBox *messageBox = new QMessageBox(QMessageBox::Warning,\n                                              tr(\"Delete Theme\"),\n                                              tr(\"Are you sure you want to delete the theme '%1' permanently?\").arg(entry.displayName()),\n                                              QMessageBox::Discard | QMessageBox::Cancel,\n                                              d->m_ui->deleteButton->window());\n\n    \/\/ Change the text and role of the discard button\n    QPushButton *deleteButton = static_cast<QPushButton*>(messageBox->button(QMessageBox::Discard));\n    deleteButton->setText(tr(\"Delete\"));\n    messageBox->addButton(deleteButton, QMessageBox::AcceptRole);\n    messageBox->setDefaultButton(deleteButton);\n\n    connect(deleteButton, &QAbstractButton::clicked, messageBox, &QDialog::accept);\n    connect(messageBox, &QDialog::accepted, this, &ThemeSettingsWidget::deleteTheme);\n    messageBox->setAttribute(Qt::WA_DeleteOnClose);\n    messageBox->open();\n}\n\nvoid ThemeSettingsWidget::deleteTheme()\n{\n    const int index = d->m_ui->themeComboBox->currentIndex();\n    QTC_ASSERT(index != -1, return);\n\n    const ThemeEntry &entry = d->m_themeListModel->themeAt(index);\n    QTC_ASSERT(!entry.readOnly(), return);\n\n    if (QFile::remove(entry.filePath()))\n        d->m_themeListModel->removeTheme(index);\n}\n\nvoid ThemeSettingsWidget::copyTheme()\n{\n    QInputDialog *dialog = new QInputDialog(d->m_ui->copyButton->window());\n    dialog->setAttribute(Qt::WA_DeleteOnClose);\n    dialog->setInputMode(QInputDialog::TextInput);\n    dialog->setWindowTitle(tr(\"Copy Theme\"));\n    dialog->setLabelText(tr(\"Theme name:\"));\n\n    \/\/TODO\n    \/\/dialog->setTextValue(tr(\"%1 (copy)\").arg(d_ptr->m_value.colorScheme().displayName()));\n\n    connect(dialog, &QInputDialog::textValueSelected, this, &ThemeSettingsWidget::copyThemeByName);\n    dialog->open();\n}\n\nvoid ThemeSettingsWidget::maybeSaveTheme()\n{\n    if (!d->m_ui->editor->model()->hasChanges())\n        return;\n\n    QMessageBox *messageBox = new QMessageBox(QMessageBox::Warning,\n                                              tr(\"Theme Changed\"),\n                                              tr(\"The theme \\\"%1\\\" was modified, do you want to save the changes?\")\n                                                  .arg(d->m_currentTheme.displayName()),\n                                              QMessageBox::Discard | QMessageBox::Save,\n                                              d->m_ui->themeComboBox->window());\n\n    \/\/ Change the text of the discard button\n    QPushButton *discardButton = static_cast<QPushButton*>(messageBox->button(QMessageBox::Discard));\n    discardButton->setText(tr(\"Discard\"));\n    messageBox->addButton(discardButton, QMessageBox::DestructiveRole);\n    messageBox->setDefaultButton(QMessageBox::Save);\n\n    if (messageBox->exec() == QMessageBox::Save) {\n        Theme newTheme(d->m_currentTheme.name());\n        d->m_ui->editor->model()->toTheme(&newTheme);\n        newTheme.writeSettings(d->m_currentTheme.filePath());\n    }\n}\n\nvoid ThemeSettingsWidget::renameTheme()\n{\n    int index = d->m_ui->themeComboBox->currentIndex();\n    if (index == -1)\n        return;\n    const ThemeEntry &entry = d->m_themeListModel->themeAt(index);\n\n    maybeSaveTheme();\n\n    QInputDialog *dialog = new QInputDialog(d->m_ui->renameButton->window());\n    dialog->setInputMode(QInputDialog::TextInput);\n    dialog->setWindowTitle(tr(\"Rename Theme\"));\n    dialog->setLabelText(tr(\"Theme name:\"));\n    dialog->setTextValue(d->m_ui->editor->model()->m_name);\n    int ret = dialog->exec();\n    QString newName = dialog->textValue();\n    delete dialog;\n\n    if (ret != QDialog::Accepted || newName.isEmpty())\n        return;\n\n    \/\/ overwrite file with new name\n    Theme newTheme(entry.name());\n    d->m_ui->editor->model()->toTheme(&newTheme);\n    newTheme.setName(newName);\n    newTheme.writeSettings(entry.filePath());\n\n    refreshThemeList();\n}\n\nvoid ThemeSettingsWidget::copyThemeByName(const QString &name)\n{\n    int index = d->m_ui->themeComboBox->currentIndex();\n    if (index == -1)\n        return;\n\n    const ThemeEntry &entry = d->m_themeListModel->themeAt(index);\n\n    QString baseFileName = QFileInfo(entry.filePath()).completeBaseName();\n    baseFileName += QLatin1String(\"_copy%1.creatortheme\");\n    QString fileName = createThemeFileName(baseFileName);\n\n    if (fileName.isEmpty())\n        return;\n\n    \/\/ Ask about saving any existing modifactions\n    maybeSaveTheme();\n\n    Theme newTheme(fileName);\n    d->m_ui->editor->model()->toTheme(&newTheme);\n    newTheme.setName(name);\n    newTheme.writeSettings(fileName);\n\n    d->m_currentTheme = ThemeEntry(fileName, fileName, true);\n\n    refreshThemeList();\n}\n\nvoid ThemeSettingsWidget::apply()\n{\n    const QString themeName = d->m_currentTheme.name();\n    Theme *newTheme = new Theme(themeName);\n    if (d->m_currentTheme.readOnly()) {\n        QSettings themeSettings(d->m_currentTheme.filePath(), QSettings::IniFormat);\n        newTheme->readSettings(themeSettings);\n    } else {\n        d->m_ui->editor->model()->toTheme(newTheme);\n        newTheme->writeSettings(d->m_currentTheme.filePath());\n    }\n    setCreatorTheme(newTheme);\n    emit ICore::instance()->themeChanged();\n    QPalette pal = newTheme->flag(Theme::ApplyThemePaletteGlobally) ? newTheme->palette()\n                                                                    : Theme::initialPalette();\n    QApplication::setPalette(pal);\n    if (ManhattanStyle *style = qobject_cast<ManhattanStyle *>(QApplication::style())) {\n        QStyle *baseStyle = 0;\n        foreach (const QString &s, creatorTheme()->preferredStyles()) {\n            if ((baseStyle = QStyleFactory::create(s)))\n                break;\n        }\n        style->setBaseStyle(baseStyle);\n    }\n    foreach (QWidget *w, QApplication::topLevelWidgets())\n        w->update();\n\n    \/\/ save filename of selected theme in global config\n    QSettings *settings = Core::ICore::settings();\n    settings->setValue(QLatin1String(Core::Constants::SETTINGS_THEME), themeName);\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace Core\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ This file is part of the Marble Desktop Globe.\n\/\/\n\/\/ This program is free software licensed under the GNU LGPL. You can\n\/\/ find a copy of this license in LICENSE.txt in the top directory of\n\/\/ the source code.\n\/\/\n\/\/ Copyright 2008-2009      Patrick Spendrin  <ps_ml@gmx.de>\n\/\/\n\n#include \"GeoRendererView.h\"\n\n\/\/ Marble\n#include \"GeoDataContainer.h\"\n#include \"GeoDataCoordinates.h\"\n#include \"GeoDataDocument.h\"\n#include \"GeoDataFeature.h\"\n#include \"GeoDataFolder.h\"\n#include \"GeoDataLineStyle.h\"\n#include \"GeoDataObject.h\"\n#include \"GeoDataPlacemark.h\"\n#include \"GeoDataPolygon.h\"\n#include \"GeoDataPolyStyle.h\"\n#include \"GeoDataStyle.h\"\n#include \"GeoDataStyleMap.h\"\n#include \"MarbleDebug.h\"\n\n#include \"GeoPainter.h\"\n\n\/\/ Qt\n#include <QtGui\/QPaintEvent>\n\nusing namespace Marble;\n\nGeoRendererView::GeoRendererView( QWidget * parent ) \n  : QAbstractItemView( parent )\n{\n}\n\nvoid GeoRendererView::setGeoPainter( GeoPainter* painter )\n{\n    m_painter = painter;\n    \/* the paintEvent function has to called by hand as the view is not \n     * connected to a widget (where you normally would get the event from) *\/\n    if( model() ) paintEvent( 0 );\n}\n\nQRect GeoRendererView::visualRect( const QModelIndex &index ) const\n{\n    Q_UNUSED( index )\n\n    return QRect();\n}\n\nvoid GeoRendererView::scrollTo( const QModelIndex &index, ScrollHint hint )\n{\n    Q_UNUSED( index )\n    Q_UNUSED( hint )\n}\n\nQModelIndex GeoRendererView::indexAt( const QPoint &point ) const\n{\n    Q_UNUSED( point )\n\n    return QModelIndex();\n}\n\nQModelIndex GeoRendererView::moveCursor( QAbstractItemView::CursorAction cursorAction,\n                    Qt::KeyboardModifiers modifiers )\n{\n    Q_UNUSED( cursorAction )\n    Q_UNUSED( modifiers )\n\n    return QModelIndex();\n}\n\nbool GeoRendererView::isIndexHidden( const QModelIndex &index ) const\n{\n    Q_UNUSED( index )\n\n    return false;\n}\n\nvoid GeoRendererView::setSelection( const QRect&, QItemSelectionModel::SelectionFlags command )\n{\n    Q_UNUSED( command )\n}\n\nvoid GeoRendererView::paintEvent( QPaintEvent *event )\n{\n    Q_UNUSED( event )\n\n    QModelIndex index = rootIndex();\n    renderIndex( index );\n}\n\nvoid GeoRendererView::renderIndex( QModelIndex &index )\n{\n    \/*\n     * \"render\" a specific index - this means going through all children and if\n     * one can be rendered (if it is a Geometry object which is not a container)\n     * then call the real render function. For the rest iterate through the\n     * children and recurse.\n     *\/\n    GeoDataObject* indexObject = model()->data( rootIndex(), Qt::UserRole + 11 ).value<Marble::GeoDataObject*>();\n    if( !( dynamic_cast<GeoDataFeature*>( indexObject ) && dynamic_cast<GeoDataFeature*>( indexObject )->isVisible() ) ) return;\n\n    int rowCount = model()->rowCount( index );\n   \n    for ( int row = 0; row < rowCount; ++row )\n    {\n        QModelIndex childIndex = model()->index( row, 0, index );\n        QString output = model()->data( childIndex ).toString();\n        GeoDataObject* object = model()->data( childIndex, Qt::UserRole + 11 ).value<Marble::GeoDataObject*>();\n\n        if( dynamic_cast<GeoDataGeometry*>( object ) ) {\n            if( static_cast<GeoDataGeometry*>( object )->geometryId() != GeoDataMultiGeometryId ) {\n                renderGeoDataGeometry( reinterpret_cast<GeoDataGeometry*>( object ), styleUrl );\n            } else {\n                if( childIndex.isValid() && model()->rowCount( childIndex ) > 0 ) {\n                    renderIndex( childIndex );\n                }\n            }\n        }\n        else if( dynamic_cast<GeoDataFeature*>( object ) ) {\n            if( dynamic_cast<GeoDataFeature*>( object )->featureId() == GeoDataPlacemarkId ) {\n                GeoDataPlacemark placemark( *static_cast<GeoDataFeature*>( object ) );\n                styleUrl = placemark.styleUrl();\n            }\n\n            if( childIndex.isValid() && model()->rowCount( childIndex ) > 0 ) {\n                renderIndex( childIndex );\n            }\n        }\n    }\n}\n\nQRegion GeoRendererView::visualRegionForSelection( const QItemSelection &selection ) const\n{\n    Q_UNUSED( selection )\n\n    return QRegion();\n}\n\nvoid GeoRendererView::setBrushStyle( QString mapped )\n{\n    \/* this part has to be reworked:\n     * Currently the style has to be accessible from the root object of the \n     * model. This might not be wanted. On the other hand - is a copy of the\n     * style within every Placemark wanted and how should this be called here?\n     *\/\n    if( !m_root->style( mapped ).polyStyle().fill() ) {\n        if( m_painter->brush().color() != Qt::transparent )\n        m_painter->setBrush( QColor( Qt::transparent ) );\n        return;\n    }\n\n    if( m_painter->brush().color() != m_root->style( mapped ).polyStyle().color() ) {\n\/*        mDebug() << \"BrushColor:\" \n                 << m_root->style( mapped ).polyStyle().color() \n                 << m_painter->brush().color();*\/\n        m_painter->setBrush( m_root->style( mapped ).polyStyle().color() );\n    }\n}\n\nvoid GeoRendererView::setPenStyle( QString mapped )\n{\n    \/*\n     * see the note in the setBrushStyle function\n     *\/\n    if( !m_root->style( mapped ).polyStyle().outline() ) {\n        m_currentPen.setColor( Qt::transparent );\n        if( m_painter->pen() != m_currentPen ) m_painter->setPen( m_currentPen );\n        return;\n    }\n\n    if( m_currentPen.color() != m_root->style( mapped ).lineStyle().color() || \n        m_currentPen.widthF() != m_root->style( mapped ).lineStyle().width() ) {\n\/*            mDebug() << \"PenColor:\" \n                 << m_root->style( mapped ).lineStyle().color() \n                 << m_currentPen.color();\n        mDebug() << \"PenWidth:\" \n                 << m_root->style( mapped ).lineStyle().width() \n                 << m_currentPen.widthF();*\/\n        m_currentPen.setColor( m_root->style( mapped ).lineStyle().color() );\n        m_currentPen.setWidthF( m_root->style( mapped ).lineStyle().width() );\n    }\n\n    if (    m_painter->mapQuality() != Marble::HighQuality\n         && m_painter->mapQuality() != Marble::PrintQuality )\n    {\n\/\/            m_currentPen.setWidth( 0 );\n        QColor penColor = m_currentPen.color();\n        penColor.setAlpha( 255 );\n        m_currentPen.setColor( penColor );\n    }\n\n    if( m_painter->pen() != m_currentPen ) m_painter->setPen( m_currentPen );\n}\n\nbool GeoRendererView::renderGeoDataGeometry( GeoDataGeometry *object, QString styleUrl )\n{\n    m_painter->save();\n    m_painter->autoMapQuality();\n\n    m_root = dynamic_cast<GeoDataDocument*>( model()->data( rootIndex(), \n                 Qt::UserRole + 11 ).value<Marble::GeoDataObject*>() );\n\n    if( !m_root ) {\n        qWarning() << \"root seems to be 0!!!\";\n        return false;\n    }\n\n    QString mapped = styleUrl;\n    const GeoDataStyleMap& styleMap = m_root->styleMap( styleUrl.remove( '#' ) );\n\n    \/\/\/ hard coded to use only the \"normal\" style\n    if( !styleMap.value( QString( \"normal\" ) ).isEmpty() ) {\n        mapped = styleMap.value( QString( \"normal\" ) );\n    }\n\n    mapped.remove( '#' );\n\n    if( object->geometryId() == GeoDataPolygonId ) {\n        setBrushStyle( mapped );\n        setPenStyle( mapped );\n        \/\/ geometries are implicitly shared, this shouldn't hurt\n        GeoDataPolygon polygon( *static_cast<GeoDataPolygon*>( object ) );\n        m_painter->drawPolygon( polygon );\n    }\n    if( object->geometryId() == GeoDataLinearRingId ) {\n        m_painter->setBrush( QColor( 0, 0, 0, 0 ) );\n        setPenStyle( mapped );\n        GeoDataLinearRing linearRing( *static_cast<GeoDataLinearRing*>( object ) );\n        m_painter->drawPolygon( linearRing );\n    }\n    if( object->geometryId() == GeoDataLineStringId ) {\n        setPenStyle( mapped );\n        GeoDataLineString lineString( *static_cast<GeoDataLineString*>( object ) );\n        m_painter->drawPolyline( lineString );\n    }\n    \/* Note: GeoDataMultiGeometry is handled within the model *\/\n    m_painter->restore();\n    return true;\n}\n<commit_msg>Break long lines.<commit_after>\/\/\n\/\/ This file is part of the Marble Desktop Globe.\n\/\/\n\/\/ This program is free software licensed under the GNU LGPL. You can\n\/\/ find a copy of this license in LICENSE.txt in the top directory of\n\/\/ the source code.\n\/\/\n\/\/ Copyright 2008-2009      Patrick Spendrin  <ps_ml@gmx.de>\n\/\/\n\n#include \"GeoRendererView.h\"\n\n\/\/ Marble\n#include \"GeoDataContainer.h\"\n#include \"GeoDataCoordinates.h\"\n#include \"GeoDataDocument.h\"\n#include \"GeoDataFeature.h\"\n#include \"GeoDataFolder.h\"\n#include \"GeoDataLineStyle.h\"\n#include \"GeoDataObject.h\"\n#include \"GeoDataPlacemark.h\"\n#include \"GeoDataPolygon.h\"\n#include \"GeoDataPolyStyle.h\"\n#include \"GeoDataStyle.h\"\n#include \"GeoDataStyleMap.h\"\n#include \"MarbleDebug.h\"\n\n#include \"GeoPainter.h\"\n\n\/\/ Qt\n#include <QtGui\/QPaintEvent>\n\nusing namespace Marble;\n\nGeoRendererView::GeoRendererView( QWidget * parent ) \n  : QAbstractItemView( parent )\n{\n}\n\nvoid GeoRendererView::setGeoPainter( GeoPainter* painter )\n{\n    m_painter = painter;\n    \/* the paintEvent function has to called by hand as the view is not \n     * connected to a widget (where you normally would get the event from) *\/\n    if( model() ) paintEvent( 0 );\n}\n\nQRect GeoRendererView::visualRect( const QModelIndex &index ) const\n{\n    Q_UNUSED( index )\n\n    return QRect();\n}\n\nvoid GeoRendererView::scrollTo( const QModelIndex &index, ScrollHint hint )\n{\n    Q_UNUSED( index )\n    Q_UNUSED( hint )\n}\n\nQModelIndex GeoRendererView::indexAt( const QPoint &point ) const\n{\n    Q_UNUSED( point )\n\n    return QModelIndex();\n}\n\nQModelIndex GeoRendererView::moveCursor( QAbstractItemView::CursorAction cursorAction,\n                    Qt::KeyboardModifiers modifiers )\n{\n    Q_UNUSED( cursorAction )\n    Q_UNUSED( modifiers )\n\n    return QModelIndex();\n}\n\nbool GeoRendererView::isIndexHidden( const QModelIndex &index ) const\n{\n    Q_UNUSED( index )\n\n    return false;\n}\n\nvoid GeoRendererView::setSelection( const QRect&, QItemSelectionModel::SelectionFlags command )\n{\n    Q_UNUSED( command )\n}\n\nvoid GeoRendererView::paintEvent( QPaintEvent *event )\n{\n    Q_UNUSED( event )\n\n    QModelIndex index = rootIndex();\n    renderIndex( index );\n}\n\nvoid GeoRendererView::renderIndex( QModelIndex &index )\n{\n    \/*\n     * \"render\" a specific index - this means going through all children and if\n     * one can be rendered (if it is a Geometry object which is not a container)\n     * then call the real render function. For the rest iterate through the\n     * children and recurse.\n     *\/\n    QVariant indexObjectVariant = model()->data( rootIndex(), Qt::UserRole + 11 );\n    GeoDataObject* indexObject = indexObjectVariant.value<Marble::GeoDataObject*>();\n    if( !( dynamic_cast<GeoDataFeature*>( indexObject )\n           && dynamic_cast<GeoDataFeature*>( indexObject )->isVisible() ) ) {\n        return;\n    }\n\n    int rowCount = model()->rowCount( index );\n   \n    for ( int row = 0; row < rowCount; ++row )\n    {\n        QModelIndex childIndex = model()->index( row, 0, index );\n        QString output = model()->data( childIndex ).toString();\n        QVariant objectVariant = model()->data( childIndex, Qt::UserRole + 11 );\n        GeoDataObject* object = objectVariant.value<Marble::GeoDataObject*>();\n\n        if( dynamic_cast<GeoDataGeometry*>( object ) ) {\n            if( static_cast<GeoDataGeometry*>( object )->geometryId() != GeoDataMultiGeometryId ) {\n                renderGeoDataGeometry( reinterpret_cast<GeoDataGeometry*>( object ), styleUrl );\n            } else {\n                if( childIndex.isValid() && model()->rowCount( childIndex ) > 0 ) {\n                    renderIndex( childIndex );\n                }\n            }\n        }\n        else if( dynamic_cast<GeoDataFeature*>( object ) ) {\n            if( dynamic_cast<GeoDataFeature*>( object )->featureId() == GeoDataPlacemarkId ) {\n                GeoDataPlacemark placemark( *static_cast<GeoDataFeature*>( object ) );\n                styleUrl = placemark.styleUrl();\n            }\n\n            if( childIndex.isValid() && model()->rowCount( childIndex ) > 0 ) {\n                renderIndex( childIndex );\n            }\n        }\n    }\n}\n\nQRegion GeoRendererView::visualRegionForSelection( const QItemSelection &selection ) const\n{\n    Q_UNUSED( selection )\n\n    return QRegion();\n}\n\nvoid GeoRendererView::setBrushStyle( QString mapped )\n{\n    \/* this part has to be reworked:\n     * Currently the style has to be accessible from the root object of the \n     * model. This might not be wanted. On the other hand - is a copy of the\n     * style within every Placemark wanted and how should this be called here?\n     *\/\n    if( !m_root->style( mapped ).polyStyle().fill() ) {\n        if( m_painter->brush().color() != Qt::transparent )\n        m_painter->setBrush( QColor( Qt::transparent ) );\n        return;\n    }\n\n    if( m_painter->brush().color() != m_root->style( mapped ).polyStyle().color() ) {\n\/*        mDebug() << \"BrushColor:\" \n                 << m_root->style( mapped ).polyStyle().color() \n                 << m_painter->brush().color();*\/\n        m_painter->setBrush( m_root->style( mapped ).polyStyle().color() );\n    }\n}\n\nvoid GeoRendererView::setPenStyle( QString mapped )\n{\n    \/*\n     * see the note in the setBrushStyle function\n     *\/\n    if( !m_root->style( mapped ).polyStyle().outline() ) {\n        m_currentPen.setColor( Qt::transparent );\n        if( m_painter->pen() != m_currentPen ) m_painter->setPen( m_currentPen );\n        return;\n    }\n\n    if( m_currentPen.color() != m_root->style( mapped ).lineStyle().color() || \n        m_currentPen.widthF() != m_root->style( mapped ).lineStyle().width() ) {\n\/*            mDebug() << \"PenColor:\" \n                 << m_root->style( mapped ).lineStyle().color() \n                 << m_currentPen.color();\n        mDebug() << \"PenWidth:\" \n                 << m_root->style( mapped ).lineStyle().width() \n                 << m_currentPen.widthF();*\/\n        m_currentPen.setColor( m_root->style( mapped ).lineStyle().color() );\n        m_currentPen.setWidthF( m_root->style( mapped ).lineStyle().width() );\n    }\n\n    if (    m_painter->mapQuality() != Marble::HighQuality\n         && m_painter->mapQuality() != Marble::PrintQuality )\n    {\n\/\/            m_currentPen.setWidth( 0 );\n        QColor penColor = m_currentPen.color();\n        penColor.setAlpha( 255 );\n        m_currentPen.setColor( penColor );\n    }\n\n    if( m_painter->pen() != m_currentPen ) m_painter->setPen( m_currentPen );\n}\n\nbool GeoRendererView::renderGeoDataGeometry( GeoDataGeometry *object, QString styleUrl )\n{\n    m_painter->save();\n    m_painter->autoMapQuality();\n\n    m_root = dynamic_cast<GeoDataDocument*>( model()->data( rootIndex(), \n                 Qt::UserRole + 11 ).value<Marble::GeoDataObject*>() );\n\n    if( !m_root ) {\n        qWarning() << \"root seems to be 0!!!\";\n        return false;\n    }\n\n    QString mapped = styleUrl;\n    const GeoDataStyleMap& styleMap = m_root->styleMap( styleUrl.remove( '#' ) );\n\n    \/\/\/ hard coded to use only the \"normal\" style\n    if( !styleMap.value( QString( \"normal\" ) ).isEmpty() ) {\n        mapped = styleMap.value( QString( \"normal\" ) );\n    }\n\n    mapped.remove( '#' );\n\n    if( object->geometryId() == GeoDataPolygonId ) {\n        setBrushStyle( mapped );\n        setPenStyle( mapped );\n        \/\/ geometries are implicitly shared, this shouldn't hurt\n        GeoDataPolygon polygon( *static_cast<GeoDataPolygon*>( object ) );\n        m_painter->drawPolygon( polygon );\n    }\n    if( object->geometryId() == GeoDataLinearRingId ) {\n        m_painter->setBrush( QColor( 0, 0, 0, 0 ) );\n        setPenStyle( mapped );\n        GeoDataLinearRing linearRing( *static_cast<GeoDataLinearRing*>( object ) );\n        m_painter->drawPolygon( linearRing );\n    }\n    if( object->geometryId() == GeoDataLineStringId ) {\n        setPenStyle( mapped );\n        GeoDataLineString lineString( *static_cast<GeoDataLineString*>( object ) );\n        m_painter->drawPolyline( lineString );\n    }\n    \/* Note: GeoDataMultiGeometry is handled within the model *\/\n    m_painter->restore();\n    return true;\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 2009      Bastian Holst <bastianholst@gmx.de>\n\/\/\n\n\/\/ Self\n#include \"PanoramioItem.h\"\n\n\/\/ Marble\n#include \"MarbleDebug.h\"\n#include \"MarbleWidget.h\"\n#include \"layers\/PopupLayer.h\"\n\n#include <QAction>\n#include <QPainter>\n\nusing namespace Marble;\n\nPanoramioItem::PanoramioItem( MarbleWidget *marbleWidget, QObject *parent ) :\n    AbstractDataPluginItem( parent ),\n    m_marbleWidget( marbleWidget )\n{\n    m_action = new QAction( this );\n    connect( m_action, SIGNAL(triggered()), this, SLOT(openBrowser()) );\n}\n\nbool PanoramioItem::initialized() const\n{\n    return !smallImage.isNull();\n}\n\nvoid PanoramioItem::addDownloadedFile( const QString &url, const QString &type )\n{\n    if( standardImageSize == type ) {\n        \/\/ Loading original image\n        QImage largeImage;\n        largeImage.load( url );\n\n        \/\/ Scaling the image to the half of the original size\n        smallImage = largeImage.scaled( largeImage.size() \/ 2,\n                                        Qt::IgnoreAspectRatio,\n                                        Qt::SmoothTransformation );\n        setSize( smallImage.size() );\n        update();\n    }\n    else {\n        mDebug() << Q_FUNC_INFO << \"can't handle type\" << type;\n    }\n}\n\nvoid PanoramioItem::setPhotoUrl( const QUrl &url )\n{\n    m_url = url;\n}\n\nQDate PanoramioItem::uploadDate() const\n{\n    return m_uploadDate;\n}\n\nvoid PanoramioItem::setUploadDate( const QDate &uploadDate )\n{\n    m_uploadDate = uploadDate;\n}\n\nbool PanoramioItem::operator<( const AbstractDataPluginItem *other ) const\n{\n    Q_ASSERT( dynamic_cast<const PanoramioItem *>( other ) != 0 );\n\n    return uploadDate() > static_cast<const PanoramioItem *>( other )->uploadDate();\n}\n\nvoid PanoramioItem::paint( QPainter *painter )\n{\n    painter->drawImage( 0, 0, smallImage );\n}\n\nQAction *Marble::PanoramioItem::action()\n{\n    if( m_action->icon().isNull() ) {\n        m_action->setIcon( QIcon( QPixmap::fromImage( smallImage ) ) );\n    }\n\n    return m_action;\n}\n\nvoid PanoramioItem::openBrowser()\n{\n    if ( m_marbleWidget ) {\n        PopupLayer* popup = m_marbleWidget->popupLayer();\n        popup->setCoordinates( coordinate(), Qt::AlignRight | Qt::AlignVCenter );\n        popup->setSize( QSizeF( 700, 450 ) );\n        popup->setUrl( m_url );\n        popup->popup();\n    }\n}\n\n#include \"PanoramioItem.moc\"\n<commit_msg>have smaller thumbnails<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 2009      Bastian Holst <bastianholst@gmx.de>\n\/\/\n\n\/\/ Self\n#include \"PanoramioItem.h\"\n\n\/\/ Marble\n#include \"MarbleDebug.h\"\n#include \"MarbleWidget.h\"\n#include \"layers\/PopupLayer.h\"\n\n#include <QAction>\n#include <QPainter>\n\nusing namespace Marble;\n\nPanoramioItem::PanoramioItem( MarbleWidget *marbleWidget, QObject *parent ) :\n    AbstractDataPluginItem( parent ),\n    m_marbleWidget( marbleWidget )\n{\n    m_action = new QAction( this );\n    connect( m_action, SIGNAL(triggered()), this, SLOT(openBrowser()) );\n}\n\nbool PanoramioItem::initialized() const\n{\n    return !smallImage.isNull();\n}\n\nvoid PanoramioItem::addDownloadedFile( const QString &url, const QString &type )\n{\n    if( standardImageSize == type ) {\n        \/\/ Loading original image\n        QImage largeImage;\n        largeImage.load( url );\n\n        \/\/ Scaling the image to the half of the original size\n        smallImage = largeImage.scaled( largeImage.size() \/ 3,\n                                        Qt::IgnoreAspectRatio,\n                                        Qt::SmoothTransformation );\n        setSize( smallImage.size() );\n        update();\n    }\n    else {\n        mDebug() << Q_FUNC_INFO << \"can't handle type\" << type;\n    }\n}\n\nvoid PanoramioItem::setPhotoUrl( const QUrl &url )\n{\n    m_url = url;\n}\n\nQDate PanoramioItem::uploadDate() const\n{\n    return m_uploadDate;\n}\n\nvoid PanoramioItem::setUploadDate( const QDate &uploadDate )\n{\n    m_uploadDate = uploadDate;\n}\n\nbool PanoramioItem::operator<( const AbstractDataPluginItem *other ) const\n{\n    Q_ASSERT( dynamic_cast<const PanoramioItem *>( other ) != 0 );\n\n    return uploadDate() > static_cast<const PanoramioItem *>( other )->uploadDate();\n}\n\nvoid PanoramioItem::paint( QPainter *painter )\n{\n    painter->drawImage( 0, 0, smallImage );\n}\n\nQAction *Marble::PanoramioItem::action()\n{\n    if( m_action->icon().isNull() ) {\n        m_action->setIcon( QIcon( QPixmap::fromImage( smallImage ) ) );\n    }\n\n    return m_action;\n}\n\nvoid PanoramioItem::openBrowser()\n{\n    if ( m_marbleWidget ) {\n        PopupLayer* popup = m_marbleWidget->popupLayer();\n        popup->setCoordinates( coordinate(), Qt::AlignRight | Qt::AlignVCenter );\n        popup->setSize( QSizeF( 700, 450 ) );\n        popup->setUrl( m_url );\n        popup->popup();\n    }\n}\n\n#include \"PanoramioItem.moc\"\n<|endoftext|>"}
{"text":"<commit_before>\n\/*!\n\t\\file\n\n\t\\author Igor Mironchik (igor.mironchik at gmail dot com).\n\n\tCopyright (c) 2013-2017 Igor Mironchik\n\n\tPermission is hereby granted, free of charge, to any person\n\tobtaining a copy of this software and associated documentation\n\tfiles (the \"Software\"), to deal in the Software without\n\trestriction, including without limitation the rights to use,\n\tcopy, modify, merge, publish, distribute, sublicense, and\/or sell\n\tcopies of the Software, and to permit persons to whom the\n\tSoftware is furnished to do so, subject to the following\n\tconditions:\n\n\tThe above copyright notice and this permission notice shall be\n\tincluded in all copies or substantial portions of the Software.\n\n\tTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n\tEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\n\tOF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n\tNONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n\tHOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\n\tWHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n\tFROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\n\tOTHER DEALINGS IN THE SOFTWARE.\n*\/\n\n#ifndef ARGS__GROUP_IFACE_HPP__INCLUDED\n#define ARGS__GROUP_IFACE_HPP__INCLUDED\n\n\/\/ Args include.\n#include \"arg_iface.hpp\"\n#include \"utils.hpp\"\n#include \"exceptions.hpp\"\n#include \"types.hpp\"\n\n\/\/ C++ include.\n#include <vector>\n#include <type_traits>\n#include <algorithm>\n#include <utility>\n#include <memory>\n\n\nnamespace Args {\n\nclass Command;\n\n\n\/\/\n\/\/ GroupIface\n\/\/\n\n\/\/! Interface for the groups.\nclass GroupIface\n\t:\tpublic ArgIface\n{\npublic:\n\t\/\/! Dummy empty string.\n\tstatic const String m_dummyEmptyString;\n\npublic:\n\t\/\/! Smart pointer to the argument.\n\tusing ArgPtr = std::unique_ptr< ArgIface, details::Deleter< ArgIface > >;\n\t\/\/! List of child arguments.\n\tusing Arguments = std::vector< ArgPtr >;\n\n\ttemplate< typename T >\n\texplicit GroupIface( T && name,\n\t\tbool required = false )\n\t\t:\tm_name( std::forward< T > ( name ) )\n\t\t,\tm_required( required )\n\t{\n\t}\n\n\tvirtual ~GroupIface()\n\t{\n\t}\n\n\t\/\/! \\return List of children.\n\tconst Arguments & children() const\n\t{\n\t\treturn m_children;\n\t}\n\n\t\/\/! Add argument. \\note Developer should handle lifetime of the argument.\n\ttemplate< typename T >\n\ttypename std::enable_if< std::is_base_of< ArgIface, T >::value &&\n\t\t!std::is_base_of< Command, T >::value >::type\n\taddArg( T & arg )\n\t{\n\t\tif( arg.type() == ArgType::Command )\n\t\t\tthrow BaseException( String( SL( \"Commands not allowed in groups. \"\n\t\t\t\t\"You are trying to add command \\\"\" ) ) + arg.name() +\n\t\t\t\tSL( \"\\\" to group \\\"\" ) + name() + SL( \"\\\".\" ) );\n\n\t\tif( std::find( m_children.cbegin(), m_children.cend(),\n\t\t\tArgPtr( &arg, details::Deleter< ArgIface > ( false ) ) ) ==\n\t\t\tm_children.cend() )\n\t\t\t\tm_children.push_back(\n\t\t\t\t\tArgPtr( &arg, details::Deleter< ArgIface > ( false ) ) );\n\n\t\tif( cmdLine() )\n\t\t\targ.setCmdLine( cmdLine() );\n\t}\n\n\t\/\/! Add argument. \\note Developer should handle lifetime of the argument.\n\ttemplate< typename T >\n\ttypename std::enable_if< std::is_base_of< ArgIface, T >::value &&\n\t\t!std::is_base_of< Command, T >::value >::type\n\taddArg( T * arg )\n\t{\n\t\tif( arg->type() == ArgType::Command )\n\t\t\tthrow BaseException( String( SL( \"Commands not allowed in groups. \"\n\t\t\t\t\"You are trying to add command \\\"\" ) ) + arg->name() +\n\t\t\t\tSL( \"\\\" to group \\\"\" ) + name() + SL( \"\\\".\" ) );\n\n\t\tif( std::find( m_children.cbegin(), m_children.cend(),\n\t\t\tArgPtr( arg, details::Deleter< ArgIface > ( false ) ) ) ==\n\t\t\t\tm_children.cend() )\n\t\t\t\t\tm_children.push_back(\n\t\t\t\t\t\tArgPtr( arg, details::Deleter< ArgIface > ( false ) ) );\n\n\t\tif( cmdLine() )\n\t\t\targ->setCmdLine( cmdLine() );\n\t}\n\n\t\/\/! Add argument.\n\tvoid addArg( ArgPtr arg )\n\t{\n\t\tif( arg->type() == ArgType::Command )\n\t\t\tthrow BaseException( String( SL( \"Commands not allowed in groups. \"\n\t\t\t\t\"You are trying to add command \\\"\" ) ) + arg->name() +\n\t\t\t\tSL( \"\\\" to group \\\"\" ) + name() + SL( \"\\\".\" ) );\n\n\t\tif( cmdLine() )\n\t\t\targ->setCmdLine( cmdLine() );\n\n\t\tif( std::find( m_children.cbegin(), m_children.cend(), arg ) ==\n\t\t\tm_children.cend() )\n\t\t\t\tm_children.push_back( std::move( arg ) );\n\t}\n\n\t\/*!\n\t\t\\return Name of the argument.\n\n\t\tIf name is empty returned value should be a flag.\n\t\tI.e. for example \"-t\" or \"--timeout\"\n\t*\/\n\tString name() const override\n\t{\n\t\treturn m_name;\n\t}\n\n\t\/\/! \\return Is this argument with value?\n\tbool isWithValue() const override\n\t{\n\t\treturn false;\n\t}\n\n\t\/\/! \\return Is this argument required?\n\tbool isRequired() const override\n\t{\n\t\treturn m_required;\n\t}\n\n\t\/\/! Set required flag.\n\tvirtual void setRequired( bool on = true )\n\t{\n\t\tm_required = on;\n\t}\n\n\t\/\/! \\return Flag.\n\tconst String & flag() const override\n\t{\n\t\treturn m_dummyEmptyString;\n\t}\n\n\t\/\/! \\return Argument name.\n\tconst String & argumentName() const override\n\t{\n\t\treturn m_dummyEmptyString;\n\t}\n\n\t\/\/! \\return Value specifier.\n\tconst String & valueSpecifier() const override\n\t{\n\t\treturn m_dummyEmptyString;\n\t}\n\n\t\/\/! \\return Description of the argument.\n\tconst String & description() const override\n\t{\n\t\treturn m_dummyEmptyString;\n\t}\n\n\t\/\/! \\return Long description of the argument.\n\tconst String & longDescription() const override\n\t{\n\t\treturn m_dummyEmptyString;\n\t}\n\n\t\/\/! Clear state of the argument.\n\tvoid clear() override\n\t{\n\t\tstd::for_each( children().begin(), children().end(),\n\t\t\t[ & ] ( const auto & ch ) { ch->clear(); } );\n\t}\n\nprotected:\n\t\/*!\n\t\t\\return Argument for the given name.\n\n\t\t\\retval Pointer to the ArgIface if this argument handles\n\t\t\targument with the given name.\n\t\t\\retval nullptr if this argument doesn't know about\n\t\t\targument with name.\n\n\t\t\\note Looks only in children.\n\t*\/\n\tArgIface * findArgument(\n\t\t\/*!\n\t\t\tName of the argument. Can be for example \"-t\" or\n\t\t\t\"--timeout\".\n\t\t*\/\n\t\tconst String & name ) override\n\t{\n\t\tfor( const auto & arg : details::asConst( m_children ) )\n\t\t{\n\t\t\tArgIface * tmp = arg->findArgument( name );\n\n\t\t\tif( tmp != nullptr )\n\t\t\t\treturn tmp;\n\t\t}\n\n\t\treturn nullptr;\n\t}\n\n\t\/*!\n\t\tProcess argument's staff, for example take values from\n\t\tcontext. This method invokes exactly at that moment when\n\t\tparser has found this argument.\n\t*\/\n\tvoid process(\n\t\t\/\/! Context of the command line.\n\t\tContext & ) override\n\t{\n\t}\n\n\t\/*!\n\t\tCheck correctness of the argument before parsing.\n\n\t\tImplementation of this method must add his flag\n\t\tand name to the flags and names.\n\t*\/\n\tvoid checkCorrectnessBeforeParsing(\n\t\t\/\/! All known flags.\n\t\tStringList & flags,\n\t\t\/\/! All known names.\n\t\tStringList & names ) const override\n\t{\n\t\tfor( const auto & arg : details::asConst( m_children ) )\n\t\t\targ->checkCorrectnessBeforeParsing( flags, names );\n\t}\n\n\t\/\/! Check correctness of the argument after parsing.\n\tvoid checkCorrectnessAfterParsing() const override\n\t{\n\t\tfor( const auto & arg : details::asConst( m_children ) )\n\t\t\targ->checkCorrectnessAfterParsing();\n\n\t\tif( isRequired() && !isDefined() )\n\t\t\tthrow BaseException(\n\t\t\t\tString( SL( \"Not defined required argument \\\"\" ) ) +\n\t\t\t\tname() + SL( \"\\\"\" ) );\n\t}\n\n\t\/\/! Set command line parser.\n\tvoid setCmdLine( CmdLine * cmdLine ) override\n\t{\n\t\tArgIface::setCmdLine( cmdLine );\n\n\t\tfor( const auto & arg : details::asConst( m_children ) )\n\t\t\targ->setCmdLine( cmdLine );\n\t}\n\n\t\/\/! \\return Is given name a misspelled name of the argument.\n\tbool isMisspelledName(\n\t\t\/\/! Name to check (misspelled).\n\t\tconst String & name,\n\t\t\/\/! List of possible names for the given misspelled name.\n\t\tStringList & possibleNames ) const override\n\t{\n\t\tbool ret = false;\n\n\t\tstd::for_each( children().cbegin(), children().cend(),\n\t\t\t[ & ] ( const auto & ch )\n\t\t\t{\n\t\t\t\tif( ch->isMisspelledName( name, possibleNames ) )\n\t\t\t\t\tret = true;\n\t\t\t} );\n\n\t\treturn ret;\n\t}\n\nprivate:\n\tDISABLE_COPY( GroupIface )\n\n\t\/\/! List of children.\n\tArguments m_children;\n\t\/\/! Name.\n\tString m_name;\n\t\/\/! Is required?\n\tbool m_required;\n}; \/\/ class GroupIface\n\nconst String GroupIface::m_dummyEmptyString;\n\n} \/* namespace Args *\/\n\n#endif \/\/ ARGS__GROUP_IFACE_HPP__INCLUDED\n<commit_msg>Add possibility to find group by its name.<commit_after>\n\/*!\n\t\\file\n\n\t\\author Igor Mironchik (igor.mironchik at gmail dot com).\n\n\tCopyright (c) 2013-2017 Igor Mironchik\n\n\tPermission is hereby granted, free of charge, to any person\n\tobtaining a copy of this software and associated documentation\n\tfiles (the \"Software\"), to deal in the Software without\n\trestriction, including without limitation the rights to use,\n\tcopy, modify, merge, publish, distribute, sublicense, and\/or sell\n\tcopies of the Software, and to permit persons to whom the\n\tSoftware is furnished to do so, subject to the following\n\tconditions:\n\n\tThe above copyright notice and this permission notice shall be\n\tincluded in all copies or substantial portions of the Software.\n\n\tTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n\tEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\n\tOF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n\tNONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n\tHOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\n\tWHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n\tFROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\n\tOTHER DEALINGS IN THE SOFTWARE.\n*\/\n\n#ifndef ARGS__GROUP_IFACE_HPP__INCLUDED\n#define ARGS__GROUP_IFACE_HPP__INCLUDED\n\n\/\/ Args include.\n#include \"arg_iface.hpp\"\n#include \"utils.hpp\"\n#include \"exceptions.hpp\"\n#include \"types.hpp\"\n\n\/\/ C++ include.\n#include <vector>\n#include <type_traits>\n#include <algorithm>\n#include <utility>\n#include <memory>\n\n\nnamespace Args {\n\nclass Command;\n\n\n\/\/\n\/\/ GroupIface\n\/\/\n\n\/\/! Interface for the groups.\nclass GroupIface\n\t:\tpublic ArgIface\n{\npublic:\n\t\/\/! Dummy empty string.\n\tstatic const String m_dummyEmptyString;\n\npublic:\n\t\/\/! Smart pointer to the argument.\n\tusing ArgPtr = std::unique_ptr< ArgIface, details::Deleter< ArgIface > >;\n\t\/\/! List of child arguments.\n\tusing Arguments = std::vector< ArgPtr >;\n\n\ttemplate< typename T >\n\texplicit GroupIface( T && name,\n\t\tbool required = false )\n\t\t:\tm_name( std::forward< T > ( name ) )\n\t\t,\tm_required( required )\n\t{\n\t}\n\n\tvirtual ~GroupIface()\n\t{\n\t}\n\n\t\/\/! \\return List of children.\n\tconst Arguments & children() const\n\t{\n\t\treturn m_children;\n\t}\n\n\t\/\/! Add argument. \\note Developer should handle lifetime of the argument.\n\ttemplate< typename T >\n\ttypename std::enable_if< std::is_base_of< ArgIface, T >::value &&\n\t\t!std::is_base_of< Command, T >::value >::type\n\taddArg( T & arg )\n\t{\n\t\tif( arg.type() == ArgType::Command )\n\t\t\tthrow BaseException( String( SL( \"Commands not allowed in groups. \"\n\t\t\t\t\"You are trying to add command \\\"\" ) ) + arg.name() +\n\t\t\t\tSL( \"\\\" to group \\\"\" ) + name() + SL( \"\\\".\" ) );\n\n\t\tif( std::find( m_children.cbegin(), m_children.cend(),\n\t\t\tArgPtr( &arg, details::Deleter< ArgIface > ( false ) ) ) ==\n\t\t\tm_children.cend() )\n\t\t\t\tm_children.push_back(\n\t\t\t\t\tArgPtr( &arg, details::Deleter< ArgIface > ( false ) ) );\n\n\t\tif( cmdLine() )\n\t\t\targ.setCmdLine( cmdLine() );\n\t}\n\n\t\/\/! Add argument. \\note Developer should handle lifetime of the argument.\n\ttemplate< typename T >\n\ttypename std::enable_if< std::is_base_of< ArgIface, T >::value &&\n\t\t!std::is_base_of< Command, T >::value >::type\n\taddArg( T * arg )\n\t{\n\t\tif( arg->type() == ArgType::Command )\n\t\t\tthrow BaseException( String( SL( \"Commands not allowed in groups. \"\n\t\t\t\t\"You are trying to add command \\\"\" ) ) + arg->name() +\n\t\t\t\tSL( \"\\\" to group \\\"\" ) + name() + SL( \"\\\".\" ) );\n\n\t\tif( std::find( m_children.cbegin(), m_children.cend(),\n\t\t\tArgPtr( arg, details::Deleter< ArgIface > ( false ) ) ) ==\n\t\t\t\tm_children.cend() )\n\t\t\t\t\tm_children.push_back(\n\t\t\t\t\t\tArgPtr( arg, details::Deleter< ArgIface > ( false ) ) );\n\n\t\tif( cmdLine() )\n\t\t\targ->setCmdLine( cmdLine() );\n\t}\n\n\t\/\/! Add argument.\n\tvoid addArg( ArgPtr arg )\n\t{\n\t\tif( arg->type() == ArgType::Command )\n\t\t\tthrow BaseException( String( SL( \"Commands not allowed in groups. \"\n\t\t\t\t\"You are trying to add command \\\"\" ) ) + arg->name() +\n\t\t\t\tSL( \"\\\" to group \\\"\" ) + name() + SL( \"\\\".\" ) );\n\n\t\tif( cmdLine() )\n\t\t\targ->setCmdLine( cmdLine() );\n\n\t\tif( std::find( m_children.cbegin(), m_children.cend(), arg ) ==\n\t\t\tm_children.cend() )\n\t\t\t\tm_children.push_back( std::move( arg ) );\n\t}\n\n\t\/*!\n\t\t\\return Name of the argument.\n\n\t\tIf name is empty returned value should be a flag.\n\t\tI.e. for example \"-t\" or \"--timeout\"\n\t*\/\n\tString name() const override\n\t{\n\t\treturn m_name;\n\t}\n\n\t\/\/! \\return Is this argument with value?\n\tbool isWithValue() const override\n\t{\n\t\treturn false;\n\t}\n\n\t\/\/! \\return Is this argument required?\n\tbool isRequired() const override\n\t{\n\t\treturn m_required;\n\t}\n\n\t\/\/! Set required flag.\n\tvirtual void setRequired( bool on = true )\n\t{\n\t\tm_required = on;\n\t}\n\n\t\/\/! \\return Flag.\n\tconst String & flag() const override\n\t{\n\t\treturn m_dummyEmptyString;\n\t}\n\n\t\/\/! \\return Argument name.\n\tconst String & argumentName() const override\n\t{\n\t\treturn m_dummyEmptyString;\n\t}\n\n\t\/\/! \\return Value specifier.\n\tconst String & valueSpecifier() const override\n\t{\n\t\treturn m_dummyEmptyString;\n\t}\n\n\t\/\/! \\return Description of the argument.\n\tconst String & description() const override\n\t{\n\t\treturn m_dummyEmptyString;\n\t}\n\n\t\/\/! \\return Long description of the argument.\n\tconst String & longDescription() const override\n\t{\n\t\treturn m_dummyEmptyString;\n\t}\n\n\t\/\/! Clear state of the argument.\n\tvoid clear() override\n\t{\n\t\tstd::for_each( children().begin(), children().end(),\n\t\t\t[ & ] ( const auto & ch ) { ch->clear(); } );\n\t}\n\nprotected:\n\t\/*!\n\t\t\\return Argument for the given name.\n\n\t\t\\retval Pointer to the ArgIface if this argument handles\n\t\t\targument with the given name.\n\t\t\\retval nullptr if this argument doesn't know about\n\t\t\targument with name.\n\n\t\t\\note Looks only in children.\n\t*\/\n\tArgIface * findArgument(\n\t\t\/*!\n\t\t\tName of the argument. Can be for example \"-t\" or\n\t\t\t\"--timeout\".\n\t\t*\/\n\t\tconst String & name ) override\n\t{\n\t\tfor( const auto & arg : details::asConst( m_children ) )\n\t\t{\n\t\t\tArgIface * tmp = arg->findArgument( name );\n\n\t\t\tif( tmp != nullptr )\n\t\t\t\treturn tmp;\n\t\t}\n\n\t\tif( m_name == name )\n\t\t\treturn this;\n\t\telse\n\t\t\treturn nullptr;\n\t}\n\n\t\/*!\n\t\tProcess argument's staff, for example take values from\n\t\tcontext. This method invokes exactly at that moment when\n\t\tparser has found this argument.\n\t*\/\n\tvoid process(\n\t\t\/\/! Context of the command line.\n\t\tContext & ) override\n\t{\n\t}\n\n\t\/*!\n\t\tCheck correctness of the argument before parsing.\n\n\t\tImplementation of this method must add his flag\n\t\tand name to the flags and names.\n\t*\/\n\tvoid checkCorrectnessBeforeParsing(\n\t\t\/\/! All known flags.\n\t\tStringList & flags,\n\t\t\/\/! All known names.\n\t\tStringList & names ) const override\n\t{\n\t\tfor( const auto & arg : details::asConst( m_children ) )\n\t\t\targ->checkCorrectnessBeforeParsing( flags, names );\n\t}\n\n\t\/\/! Check correctness of the argument after parsing.\n\tvoid checkCorrectnessAfterParsing() const override\n\t{\n\t\tfor( const auto & arg : details::asConst( m_children ) )\n\t\t\targ->checkCorrectnessAfterParsing();\n\n\t\tif( isRequired() && !isDefined() )\n\t\t\tthrow BaseException(\n\t\t\t\tString( SL( \"Not defined required argument \\\"\" ) ) +\n\t\t\t\tname() + SL( \"\\\"\" ) );\n\t}\n\n\t\/\/! Set command line parser.\n\tvoid setCmdLine( CmdLine * cmdLine ) override\n\t{\n\t\tArgIface::setCmdLine( cmdLine );\n\n\t\tfor( const auto & arg : details::asConst( m_children ) )\n\t\t\targ->setCmdLine( cmdLine );\n\t}\n\n\t\/\/! \\return Is given name a misspelled name of the argument.\n\tbool isMisspelledName(\n\t\t\/\/! Name to check (misspelled).\n\t\tconst String & name,\n\t\t\/\/! List of possible names for the given misspelled name.\n\t\tStringList & possibleNames ) const override\n\t{\n\t\tbool ret = false;\n\n\t\tstd::for_each( children().cbegin(), children().cend(),\n\t\t\t[ & ] ( const auto & ch )\n\t\t\t{\n\t\t\t\tif( ch->isMisspelledName( name, possibleNames ) )\n\t\t\t\t\tret = true;\n\t\t\t} );\n\n\t\treturn ret;\n\t}\n\nprivate:\n\tDISABLE_COPY( GroupIface )\n\n\t\/\/! List of children.\n\tArguments m_children;\n\t\/\/! Name.\n\tString m_name;\n\t\/\/! Is required?\n\tbool m_required;\n}; \/\/ class GroupIface\n\nconst String GroupIface::m_dummyEmptyString;\n\n} \/* namespace Args *\/\n\n#endif \/\/ ARGS__GROUP_IFACE_HPP__INCLUDED\n<|endoftext|>"}
{"text":"<commit_before>\/\/ This file may be redistributed and modified under the terms of the\n\/\/ GNU Lesser General Public License (See COPYING for details).\n\/\/ Copyright (C) 2000-2001 Michael Day, Stefanus Du Toit\n\n#include \"XML.h\"\n\nnamespace Atlas { namespace Codecs {\n    \nXML::XML(std::iostream& s, Atlas::Bridge* b)\n    : socket(s), bridge(b)\n{\n    token = TOKEN_DATA;\n    state.push(PARSE_NOTHING);\n    data.push(\"\");\n}\n\nvoid XML::tokenTag(char next)\n{\n    tag.erase();\n    \n    switch (next)\n    {\n\tcase '\/':\n\t    token = TOKEN_END_TAG;\n\tbreak;\n\t\n\tcase '>':\n\t    \/\/ FIXME signal error here\n\t    \/\/ unexpected character\n\tbreak;\n\t\n\tdefault:\n\t    token = TOKEN_START_TAG;\n\t    tag += next;\n\tbreak;\n    }\n}\n\nvoid XML::tokenStartTag(char next)\n{\n    switch (next)\n    {\n\tcase '<':\n\t    \/\/ FIXME signal error here\n\t    \/\/ unexpected character\n\tbreak;\n\n\tcase '>':\n\t    parseStartTag();\n\t    token = TOKEN_DATA;\n\t    data.push(\"\");\n\tbreak;\n\n\tdefault:\n\t    tag += next;\n\tbreak;\n    }\n}\n\nvoid XML::tokenEndTag(char next)\n{\n    switch (next)\n    {\n\tcase '<':\n\t    \/\/ FIXME signal error here\n\t    \/\/ unexpected character\n\tbreak;\n\n\tcase '>':\n\t    parseEndTag();\n\t    token = TOKEN_DATA;\n\t    data.pop();\n\tbreak;\n\n\tdefault:\n\t    tag += next;\n\tbreak;\n    }\n}\n\nvoid XML::tokenData(char next)\n{\n    switch (next)\n    {\n\tcase '<':\n\t    token = TOKEN_TAG;\n\tbreak;\n\n\tcase '>':\n\t    \/\/ FIXME signal error here\n\t    \/\/ unexpected character\n\tbreak;\n\n\tdefault:\n\t    data.top() += next;\n\tbreak;\n    }\n}\n\nvoid XML::parseStartTag()\n{\n    int tag_end = tag.find(' ');\n    int name_start = tag.find(\"name=\\\"\") + 6;\n    int name_end = tag.rfind(\"\\\"\");\n    \n    if (name_start < name_end)\n    {\n\tname = std::string(tag, name_start, name_end - name_start);\n    }\n    else\n    {\n\tname.erase();\n    }\n    \n    tag = std::string(tag, 0, tag_end);\n\n    switch (state.top())\n    {\n\tcase PARSE_NOTHING:\n\t    if (tag == \"atlas\")\n\t    {\n\t\tbridge->streamBegin();\n\t\tstate.push(PARSE_STREAM);\n\t    }\n\t    else\n\t    {\n\t\t\/\/ FIXME signal error here\n\t\t\/\/ unexpected tag\n\t    }\n\tbreak;\n\t\n\tcase PARSE_STREAM:\n\t    if (tag == \"map\")\n\t    {\n\t\tbridge->streamMessage(mapBegin);\n\t\tstate.push(PARSE_MAP);\n\t    }\n\t    else\n\t    {\n\t\t\/\/ FIXME signal error here\n\t\t\/\/ unexpected tag\n\t    }\n\tbreak;\n\t\n        case PARSE_MAP:\n\t    if (tag == \"map\")\n\t    {\n\t\tbridge->mapItem(name, mapBegin);\n\t\tstate.push(PARSE_MAP);\n\t    }\n\t    else if (tag == \"list\")\n\t    {\n\t\tbridge->mapItem(name, listBegin);\n\t\tstate.push(PARSE_LIST);\n\t    }\n\t    else if (tag == \"int\")\n\t    {\n\t\tstate.push(PARSE_INT);\n\t    }\n\t    else if (tag == \"float\")\n\t    {\n\t\tstate.push(PARSE_FLOAT);\n\t    }\n\t    else if (tag == \"string\")\n\t    {\n\t\tstate.push(PARSE_STRING);\n\t    }\n\t    else\n\t    {\n\t\t\/\/ FIXME signal error here\n\t\t\/\/ unexpected tag\n\t    }\n\tbreak;\n\t\n        case PARSE_LIST:\n\t    if (tag == \"map\")\n\t    {\n\t\tbridge->listItem(mapBegin);\n\t\tstate.push(PARSE_MAP);\n\t    }\n\t    else if (tag == \"list\")\n\t    {\n\t\tbridge->listItem(listBegin);\n\t\tstate.push(PARSE_LIST);\n\t    }\n\t    else if (tag == \"int\")\n\t    {\n\t\tstate.push(PARSE_INT);\n\t    }\n\t    else if (tag == \"float\")\n\t    {\n\t\tstate.push(PARSE_FLOAT);\n\t    }\n\t    else if (tag == \"string\")\n\t    {\n\t\tstate.push(PARSE_STRING);\n\t    }\n\t    else\n\t    {\n\t\t\/\/ FIXME signal error here\n\t\t\/\/ unexpected tag\n\t    }\n\tbreak;\n\n\tcase PARSE_INT:\n\tcase PARSE_FLOAT:\n\tcase PARSE_STRING:\n\t    \/\/ FIXME signal error here\n\t    \/\/ unexpected tag\n\tbreak;\n    }\n}\n\nvoid XML::parseEndTag()\n{\n    switch (state.top())\n    {\n\tcase PARSE_NOTHING:\n\t    \/\/ FIXME signal error here\n\t    \/\/ unexpected tag\n\tbreak;\n\t\n\tcase PARSE_STREAM:\n\t    if (tag == \"atlas\")\n\t    {\n\t\tbridge->streamEnd();\n\t\tstate.pop();\n\t    }\n\t    else\n\t    {\n\t\t\/\/ FIXME signal error here\n\t\t\/\/ unexpected tag\n\t    }\n\tbreak;\n\t\n        case PARSE_MAP:\n\t    if (tag == \"map\")\n\t    {\n\t\tbridge->mapEnd();\n\t\tstate.pop();\n\t    }\n\t    else\n\t    {\n\t\t\/\/ FIXME signal error here\n\t\t\/\/ unexpected tag\n\t    }\n\tbreak;\n\t\n        case PARSE_LIST:\n\t    if (tag == \"list\")\n\t    {\n\t\tbridge->listEnd();\n\t\tstate.pop();\n\t    }\n\t    else\n\t    {\n\t\t\/\/ FIXME signal error here\n\t\t\/\/ unexpected tag\n\t    }\n\tbreak;\n\n\tcase PARSE_INT:\n\t    if (tag == \"int\")\n\t    {\n\t\tstate.pop();\n\t\tif (state.top() == PARSE_MAP)\n\t\t{\n\t\t    bridge->mapItem(name, atol(data.top().c_str()));\n\t\t}\n\t\telse\n\t\t{\n\t\t    bridge->listItem(atol(data.top().c_str()));\n\t\t}\n\t    }\n\t    else\n\t    {\n\t\t\/\/ FIXME signal error here\n\t\t\/\/ unexpected tag\n\t    }\n\tbreak;\n\n\tcase PARSE_FLOAT:\n\t    if (tag == \"float\")\n\t    {\n\t\tstate.pop();\n\t\tif (state.top() == PARSE_MAP)\n\t\t{\n\t\t    bridge->mapItem(name, atof(data.top().c_str()));\n\t\t}\n\t\telse\n\t\t{\n\t\t    bridge->listItem(atof(data.top().c_str()));\n\t\t}\n\t    }\n\t    else\n\t    {\n\t\t\/\/ FIXME signal error here\n\t\t\/\/ unexpected tag\n\t    }\n\tbreak;\n\n\tcase PARSE_STRING:\n\t    if (tag == \"string\")\n\t    {\n\t\tstate.pop();\n\t\tif (state.top() == PARSE_MAP)\n\t\t{\n\t\t    bridge->mapItem(name, data.top());\n\t\t}\n\t\telse\n\t\t{\n\t\t    bridge->listItem(data.top());\n\t\t}\n\t    }\n\t    else\n\t    {\n\t\t\/\/ FIXME signal error here\n\t\t\/\/ unexpected tag\n\t    }\n\tbreak;\n    }\n}\n\nvoid XML::poll(bool can_read)\n{\n    if (!can_read) return;\n    do\n    {\n\tchar next = socket.get();\n\n\tswitch (token)\n\t{\n\t    case TOKEN_TAG:\t    tokenTag(next); break;\n\t    case TOKEN_START_TAG:   tokenStartTag(next); break;\n\t    case TOKEN_END_TAG:\t    tokenEndTag(next); break;\n\t    case TOKEN_DATA:\t    tokenData(next); break;\n\t}\n    }\n    while (socket.rdbuf()->in_avail());\n}\n\nvoid XML::streamBegin()\n{\n    socket << \"<atlas>\";\n}\n\nvoid XML::streamEnd()\n{\n    socket << \"<\/atlas>\";\n}\n\nvoid XML::streamMessage(const Map&)\n{\n    socket << \"<map>\";\n}\n\nvoid XML::mapItem(const std::string& name, const Map&)\n{\n    socket << \"<map name=\\\"\" << name << \"\\\">\";\n}\n\nvoid XML::mapItem(const std::string& name, const List&)\n{\n    socket << \"<list name=\\\"\" << name << \"\\\">\";\n}\n\nvoid XML::mapItem(const std::string& name, long data)\n{\n    socket << \"<int name=\\\"\" << name << \"\\\">\" << data << \"<\/int>\";\n}\n\nvoid XML::mapItem(const std::string& name, double data)\n{\n    socket << \"<float name=\\\"\" << name << \"\\\">\" << data << \"<\/float>\";\n}\n\nvoid XML::mapItem(const std::string& name, const std::string& data)\n{\n    socket << \"<string name=\\\"\" << name << \"\\\">\" << data << \"<\/string>\";\n}\n\nvoid XML::mapEnd()\n{\n    socket << \"<\/map>\";\n}\n\nvoid XML::listItem(const Map&)\n{\n    socket << \"<map>\";\n}\n\nvoid XML::listItem(const List&)\n{\n    socket << \"<list>\";\n}\n\nvoid XML::listItem(long data)\n{\n    socket << \"<int>\" << data << \"<\/int>\";\n}\n\nvoid XML::listItem(double data)\n{\n    socket << \"<float>\" << data << \"<\/float>\";\n}\n\nvoid XML::listItem(const std::string& data)\n{\n    socket << \"<string>\" << data << \"<\/string>\";\n}\n\nvoid XML::listEnd()\n{\n    socket << \"<\/list>\";\n}\n\n} } \/\/namespace Atlas::Codecs\n<commit_msg>Added some casts.<commit_after>\/\/ This file may be redistributed and modified under the terms of the\n\/\/ GNU Lesser General Public License (See COPYING for details).\n\/\/ Copyright (C) 2000-2001 Michael Day, Stefanus Du Toit\n\n#include \"XML.h\"\n\nnamespace Atlas { namespace Codecs {\n    \nXML::XML(std::iostream& s, Atlas::Bridge* b)\n    : socket(s), bridge(b)\n{\n    token = TOKEN_DATA;\n    state.push(PARSE_NOTHING);\n    data.push(\"\");\n}\n\nvoid XML::tokenTag(char next)\n{\n    tag.erase();\n    \n    switch (next)\n    {\n\tcase '\/':\n\t    token = TOKEN_END_TAG;\n\tbreak;\n\t\n\tcase '>':\n\t    \/\/ FIXME signal error here\n\t    \/\/ unexpected character\n\tbreak;\n\t\n\tdefault:\n\t    token = TOKEN_START_TAG;\n\t    tag += next;\n\tbreak;\n    }\n}\n\nvoid XML::tokenStartTag(char next)\n{\n    switch (next)\n    {\n\tcase '<':\n\t    \/\/ FIXME signal error here\n\t    \/\/ unexpected character\n\tbreak;\n\n\tcase '>':\n\t    parseStartTag();\n\t    token = TOKEN_DATA;\n\t    data.push(\"\");\n\tbreak;\n\n\tdefault:\n\t    tag += next;\n\tbreak;\n    }\n}\n\nvoid XML::tokenEndTag(char next)\n{\n    switch (next)\n    {\n\tcase '<':\n\t    \/\/ FIXME signal error here\n\t    \/\/ unexpected character\n\tbreak;\n\n\tcase '>':\n\t    parseEndTag();\n\t    token = TOKEN_DATA;\n\t    data.pop();\n\tbreak;\n\n\tdefault:\n\t    tag += next;\n\tbreak;\n    }\n}\n\nvoid XML::tokenData(char next)\n{\n    switch (next)\n    {\n\tcase '<':\n\t    token = TOKEN_TAG;\n\tbreak;\n\n\tcase '>':\n\t    \/\/ FIXME signal error here\n\t    \/\/ unexpected character\n\tbreak;\n\n\tdefault:\n\t    data.top() += next;\n\tbreak;\n    }\n}\n\nvoid XML::parseStartTag()\n{\n    int tag_end = (int) tag.find(' ');\n    int name_start = (int) tag.find(\"name=\\\"\") + 6;\n    int name_end = (int) tag.rfind(\"\\\"\");\n    \n    if (name_start < name_end)\n    {\n\tname = std::string(tag, (unsigned long) name_start, (unsigned long) (name_end - name_start));\n    }\n    else\n    {\n\tname.erase();\n    }\n    \n    tag = std::string(tag, 0, (unsigned long) tag_end);\n\n    switch (state.top())\n    {\n\tcase PARSE_NOTHING:\n\t    if (tag == \"atlas\")\n\t    {\n\t\tbridge->streamBegin();\n\t\tstate.push(PARSE_STREAM);\n\t    }\n\t    else\n\t    {\n\t\t\/\/ FIXME signal error here\n\t\t\/\/ unexpected tag\n\t    }\n\tbreak;\n\t\n\tcase PARSE_STREAM:\n\t    if (tag == \"map\")\n\t    {\n\t\tbridge->streamMessage(mapBegin);\n\t\tstate.push(PARSE_MAP);\n\t    }\n\t    else\n\t    {\n\t\t\/\/ FIXME signal error here\n\t\t\/\/ unexpected tag\n\t    }\n\tbreak;\n\t\n        case PARSE_MAP:\n\t    if (tag == \"map\")\n\t    {\n\t\tbridge->mapItem(name, mapBegin);\n\t\tstate.push(PARSE_MAP);\n\t    }\n\t    else if (tag == \"list\")\n\t    {\n\t\tbridge->mapItem(name, listBegin);\n\t\tstate.push(PARSE_LIST);\n\t    }\n\t    else if (tag == \"int\")\n\t    {\n\t\tstate.push(PARSE_INT);\n\t    }\n\t    else if (tag == \"float\")\n\t    {\n\t\tstate.push(PARSE_FLOAT);\n\t    }\n\t    else if (tag == \"string\")\n\t    {\n\t\tstate.push(PARSE_STRING);\n\t    }\n\t    else\n\t    {\n\t\t\/\/ FIXME signal error here\n\t\t\/\/ unexpected tag\n\t    }\n\tbreak;\n\t\n        case PARSE_LIST:\n\t    if (tag == \"map\")\n\t    {\n\t\tbridge->listItem(mapBegin);\n\t\tstate.push(PARSE_MAP);\n\t    }\n\t    else if (tag == \"list\")\n\t    {\n\t\tbridge->listItem(listBegin);\n\t\tstate.push(PARSE_LIST);\n\t    }\n\t    else if (tag == \"int\")\n\t    {\n\t\tstate.push(PARSE_INT);\n\t    }\n\t    else if (tag == \"float\")\n\t    {\n\t\tstate.push(PARSE_FLOAT);\n\t    }\n\t    else if (tag == \"string\")\n\t    {\n\t\tstate.push(PARSE_STRING);\n\t    }\n\t    else\n\t    {\n\t\t\/\/ FIXME signal error here\n\t\t\/\/ unexpected tag\n\t    }\n\tbreak;\n\n\tcase PARSE_INT:\n\tcase PARSE_FLOAT:\n\tcase PARSE_STRING:\n\t    \/\/ FIXME signal error here\n\t    \/\/ unexpected tag\n\tbreak;\n    }\n}\n\nvoid XML::parseEndTag()\n{\n    switch (state.top())\n    {\n\tcase PARSE_NOTHING:\n\t    \/\/ FIXME signal error here\n\t    \/\/ unexpected tag\n\tbreak;\n\t\n\tcase PARSE_STREAM:\n\t    if (tag == \"atlas\")\n\t    {\n\t\tbridge->streamEnd();\n\t\tstate.pop();\n\t    }\n\t    else\n\t    {\n\t\t\/\/ FIXME signal error here\n\t\t\/\/ unexpected tag\n\t    }\n\tbreak;\n\t\n        case PARSE_MAP:\n\t    if (tag == \"map\")\n\t    {\n\t\tbridge->mapEnd();\n\t\tstate.pop();\n\t    }\n\t    else\n\t    {\n\t\t\/\/ FIXME signal error here\n\t\t\/\/ unexpected tag\n\t    }\n\tbreak;\n\t\n        case PARSE_LIST:\n\t    if (tag == \"list\")\n\t    {\n\t\tbridge->listEnd();\n\t\tstate.pop();\n\t    }\n\t    else\n\t    {\n\t\t\/\/ FIXME signal error here\n\t\t\/\/ unexpected tag\n\t    }\n\tbreak;\n\n\tcase PARSE_INT:\n\t    if (tag == \"int\")\n\t    {\n\t\tstate.pop();\n\t\tif (state.top() == PARSE_MAP)\n\t\t{\n\t\t    bridge->mapItem(name, atol(data.top().c_str()));\n\t\t}\n\t\telse\n\t\t{\n\t\t    bridge->listItem(atol(data.top().c_str()));\n\t\t}\n\t    }\n\t    else\n\t    {\n\t\t\/\/ FIXME signal error here\n\t\t\/\/ unexpected tag\n\t    }\n\tbreak;\n\n\tcase PARSE_FLOAT:\n\t    if (tag == \"float\")\n\t    {\n\t\tstate.pop();\n\t\tif (state.top() == PARSE_MAP)\n\t\t{\n\t\t    bridge->mapItem(name, atof(data.top().c_str()));\n\t\t}\n\t\telse\n\t\t{\n\t\t    bridge->listItem(atof(data.top().c_str()));\n\t\t}\n\t    }\n\t    else\n\t    {\n\t\t\/\/ FIXME signal error here\n\t\t\/\/ unexpected tag\n\t    }\n\tbreak;\n\n\tcase PARSE_STRING:\n\t    if (tag == \"string\")\n\t    {\n\t\tstate.pop();\n\t\tif (state.top() == PARSE_MAP)\n\t\t{\n\t\t    bridge->mapItem(name, data.top());\n\t\t}\n\t\telse\n\t\t{\n\t\t    bridge->listItem(data.top());\n\t\t}\n\t    }\n\t    else\n\t    {\n\t\t\/\/ FIXME signal error here\n\t\t\/\/ unexpected tag\n\t    }\n\tbreak;\n    }\n}\n\nvoid XML::poll(bool can_read)\n{\n    if (!can_read) return;\n    do\n    {\n\tchar next = (char) socket.get();\n\n\tswitch (token)\n\t{\n\t    case TOKEN_TAG:\t    tokenTag(next); break;\n\t    case TOKEN_START_TAG:   tokenStartTag(next); break;\n\t    case TOKEN_END_TAG:\t    tokenEndTag(next); break;\n\t    case TOKEN_DATA:\t    tokenData(next); break;\n\t}\n    }\n    while (socket.rdbuf()->in_avail());\n}\n\nvoid XML::streamBegin()\n{\n    socket << \"<atlas>\";\n}\n\nvoid XML::streamEnd()\n{\n    socket << \"<\/atlas>\";\n}\n\nvoid XML::streamMessage(const Map&)\n{\n    socket << \"<map>\";\n}\n\nvoid XML::mapItem(const std::string& name, const Map&)\n{\n    socket << \"<map name=\\\"\" << name << \"\\\">\";\n}\n\nvoid XML::mapItem(const std::string& name, const List&)\n{\n    socket << \"<list name=\\\"\" << name << \"\\\">\";\n}\n\nvoid XML::mapItem(const std::string& name, long data)\n{\n    socket << \"<int name=\\\"\" << name << \"\\\">\" << data << \"<\/int>\";\n}\n\nvoid XML::mapItem(const std::string& name, double data)\n{\n    socket << \"<float name=\\\"\" << name << \"\\\">\" << data << \"<\/float>\";\n}\n\nvoid XML::mapItem(const std::string& name, const std::string& data)\n{\n    socket << \"<string name=\\\"\" << name << \"\\\">\" << data << \"<\/string>\";\n}\n\nvoid XML::mapEnd()\n{\n    socket << \"<\/map>\";\n}\n\nvoid XML::listItem(const Map&)\n{\n    socket << \"<map>\";\n}\n\nvoid XML::listItem(const List&)\n{\n    socket << \"<list>\";\n}\n\nvoid XML::listItem(long data)\n{\n    socket << \"<int>\" << data << \"<\/int>\";\n}\n\nvoid XML::listItem(double data)\n{\n    socket << \"<float>\" << data << \"<\/float>\";\n}\n\nvoid XML::listItem(const std::string& data)\n{\n    socket << \"<string>\" << data << \"<\/string>\";\n}\n\nvoid XML::listEnd()\n{\n    socket << \"<\/list>\";\n}\n\n} } \/\/namespace Atlas::Codecs\n<|endoftext|>"}
{"text":"<commit_before>\/************************************************************************\n\tfilename: \ttexture.cpp\n\tcreated:\t10\/4\/2004\n\tauthor:\t\tPaul D Turner\n\t\n\tpurpose:\tImplements texture class for D3D8.1 system\n*************************************************************************\/\n\/*************************************************************************\n    Crazy Eddie's GUI System (http:\/\/crayzedsgui.sourceforge.net)\n    Copyright (C)2004 Paul D Turner (crayzed@users.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.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 \"renderers\/directx81GUIRenderer\/texture.h\"\n#include \"renderers\/directx81GUIRenderer\/renderer.h\"\n#include \"CEGUIExceptions.h\"\n#include \"CEGUISystem.h\"\n\n#include <d3dx8.h>\n#include <dxerr8.h>\n\n\/\/ remove Microsoft idiocy\n#undef max\n#undef min\n\n\n\/\/ Start of CEGUI namespace section\nnamespace CEGUI\n{\n\n\/*************************************************************************\n\tConstructor\n*************************************************************************\/\nDirectX81Texture::DirectX81Texture(Renderer* owner) :\n\tTexture(owner)\n{\n\td_d3dtexture = NULL;\n\n\t\/\/ do this mainly to indicate the lack of a filename.\n\td_isMemoryTexture = true;\n}\n\n\/*************************************************************************\n\tDestructor\n*************************************************************************\/\nDirectX81Texture::~DirectX81Texture(void)\n{\n\tfreeD3DTexture();\n}\n\n\/*************************************************************************\n\tLoad texture from file.  Texture is made to be same size as image in\n\tfile.\n*************************************************************************\/\nvoid DirectX81Texture::loadFromFile(const String& filename)\n{\n\tfreeD3DTexture();\n\n\t\/\/ load the file via the resource provider\n\tRawDataContainer texFile;\n\tSystem::getSingleton().getResourceProvider()->loadRawDataContainer(filename, texFile);\n\t\n\tD3DXIMAGE_INFO texInfo;\n\tHRESULT hr = D3DXCreateTextureFromFileInMemoryEx(((DirectX81Renderer*)getRenderer())->getDevice(), texFile.getDataPtr(), texFile.getSize(),\n\t\t\t\t\t\tD3DX_DEFAULT, D3DX_DEFAULT, 1, 0, D3DFMT_UNKNOWN, D3DPOOL_DEFAULT, D3DX_DEFAULT, D3DX_DEFAULT,\n\t\t\t\t\t\t0, &texInfo, NULL, &d_d3dtexture);\n\n\tif (SUCCEEDED(hr))\n\t{\n\t\td_width\t\t= texInfo.Width;\n\t\td_height\t= texInfo.Height;\n\n\t\td_filename = filename;\n\t\td_isMemoryTexture = false;\n\t}\n\telse\n\t{\n\t\tthrow RendererException((utf8*)\"Failed to create Texture object from file '\" + filename + \"'.  Additional Info: \" + (const utf8*)DXGetErrorString8(hr));\n\t}\n\n}\n\n\n\/*************************************************************************\n\tLoad texture from raw memory.\t\n*************************************************************************\/\nvoid DirectX81Texture::loadFromMemory(const void* buffPtr, uint buffWidth, uint buffHeight)\n{\n\tusing namespace std;\n\n\t\/\/ release old texture\n\tfreeD3DTexture();\n\n\t\/\/ calculate square size big enough for whole memory buffer\n\tuint tex_size = std::max(buffWidth, buffHeight);\n\n\t\/\/ create a texture\n\t\/\/ TODO: Check resulting pixel format and react appropriately.\n\tHRESULT hr = D3DXCreateTexture(((DirectX81Renderer*)getRenderer())->getDevice(), tex_size, tex_size, 1, 0, D3DFMT_A8R8G8B8, D3DPOOL_MANAGED, &d_d3dtexture);\n\n\tif (FAILED(hr))\n\t{\n\t\tthrow RendererException((utf8*)\"Failed to load texture from memory: D3D Texture creation failed.\");\n\t}\n\telse\n\t{\n\t\tD3DSURFACE_DESC\ttexdesc;\n\t\td_d3dtexture->GetLevelDesc(0, &texdesc);\n\n\t\t\/\/ store new size;\n\t\td_width\t\t= texdesc.Width;\n\t\td_height\t= texdesc.Height;\n\n\t\t\/\/ lock the D3D texture\n\t\tD3DLOCKED_RECT\trect;\n\t\thr = d_d3dtexture->LockRect(0, &rect, NULL, D3DLOCK_DISCARD);\n\n\t\tif (FAILED(hr))\n\t\t{\n\t\t\td_d3dtexture->Release();\n\t\t\td_d3dtexture = NULL;\n\n\t\t\tthrow RendererException((utf8*)\"Failed to load texture from memory: IDirect3DTexture8::LockRect failed.\");\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ copy data from buffer into texture\n\t\t\tulong* dst = (ulong*)rect.pBits;\n\t\t\tulong* src = (ulong*)buffPtr;\n\n\t\t\tfor (uint i = 0; i < buffHeight; ++i)\n\t\t\t{\n\t\t\t\tfor (uint j = 0; j < buffWidth; ++j)\n\t\t\t\t{\n\t\t\t\t\tdst[j] = src[j];\n\t\t\t\t}\n\n\t\t\t\tdst += rect.Pitch \/ sizeof(ulong);\n\t\t\t\tsrc += buffWidth;\n\t\t\t}\n\n\t\t\td_d3dtexture->UnlockRect(0);\n\t\t}\n\n\t}\n\n}\n\n\n\/*************************************************************************\n\tsafely release D3D texture associated with this Texture\n*************************************************************************\/\nvoid DirectX81Texture::freeD3DTexture(void)\n{\n\tif (d_d3dtexture != NULL)\n\t{\n\t\td_d3dtexture->Release();\n\t\td_d3dtexture = NULL;\n\t}\n\n\td_filename.clear();\n\td_isMemoryTexture = true;\n}\n\n\n\/*************************************************************************\n\tallocate a D3D texture >= 'size'.  Previous D3D texture is lost\n*************************************************************************\/\nvoid DirectX81Texture::setD3DTextureSize(uint size)\n{\n\tfreeD3DTexture();\n\n\tHRESULT hr = D3DXCreateTexture(((DirectX81Renderer*)getRenderer())->getDevice(), size, size, 1, 0, D3DFMT_A8R8G8B8, D3DPOOL_MANAGED, &d_d3dtexture);\n\n\tif (FAILED(hr))\n\t{\n\t\tthrow RendererException((utf8*)\"Failed to create texture of specified size: D3D Texture creation failed.\");\n\t}\n\telse\n\t{\n\t\tD3DSURFACE_DESC\ttexdesc;\n\t\td_d3dtexture->GetLevelDesc(0, &texdesc);\n\n\t\t\/\/ store new size;\n\t\td_width\t\t= texdesc.Width;\n\t\td_height\t= texdesc.Height;\n\t}\n\n}\n\n\n\/*************************************************************************\n\tDirect3D support method that must be called prior to a Reset call\n\ton the Direct3DDevice.\n*************************************************************************\/\nvoid DirectX81Texture::preD3DReset(void)\n{\n\t\/\/ textures not based on files are in the managed pool, so we do\n\t\/\/ not worry about those.\n\tif (!d_isMemoryTexture)\n\t{\n\t\t\/\/ release the d3d texture\n\t\tif (d_d3dtexture != NULL)\n\t\t{\n\t\t\tif (FAILED(d_d3dtexture->Release()))\n\t\t\t{\n\t\t\t\tthrow RendererException(\"DirectX81Texture::preD3DReset - failed to release the Direct3DTexture8 object for this texture.\");\n\t\t\t}\n\n\t\t\td_d3dtexture = NULL;\n\t\t}\n\n\t}\n\n}\n\n\n\/*************************************************************************\n\tDirect3D support method that must be called after a Reset call on the\n\tDirect3DDevice.\n*************************************************************************\/\nvoid DirectX81Texture::postD3DReset(void)\n{\n\t\/\/ textures not based on files are in the managed pool, so we do\n\t\/\/ not worry about those.\n\tif (!d_isMemoryTexture)\n\t{\n\t\t\/\/ The reason this copy is made is that d_filename will be reset once we\n\t\t\/\/ call loadFromFile and loading would always fail due to invalid filenames.\n\t\tString name(d_filename);\n\n\t\t\/\/ re-load the texture\n\t\tloadFromFile(name);\n\t}\n\n}\n\n} \/\/ End of  CEGUI namespace section\n<commit_msg>Bug Fix: Erroneous use of D3DLOCK_DISCARD flag.<commit_after>\/************************************************************************\n\tfilename: \ttexture.cpp\n\tcreated:\t10\/4\/2004\n\tauthor:\t\tPaul D Turner\n\t\n\tpurpose:\tImplements texture class for D3D8.1 system\n*************************************************************************\/\n\/*************************************************************************\n    Crazy Eddie's GUI System (http:\/\/crayzedsgui.sourceforge.net)\n    Copyright (C)2004 Paul D Turner (crayzed@users.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.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 \"renderers\/directx81GUIRenderer\/texture.h\"\n#include \"renderers\/directx81GUIRenderer\/renderer.h\"\n#include \"CEGUIExceptions.h\"\n#include \"CEGUISystem.h\"\n\n#include <d3dx8.h>\n#include <dxerr8.h>\n\n\/\/ remove Microsoft idiocy\n#undef max\n#undef min\n\n\n\/\/ Start of CEGUI namespace section\nnamespace CEGUI\n{\n\n\/*************************************************************************\n\tConstructor\n*************************************************************************\/\nDirectX81Texture::DirectX81Texture(Renderer* owner) :\n\tTexture(owner)\n{\n\td_d3dtexture = NULL;\n\n\t\/\/ do this mainly to indicate the lack of a filename.\n\td_isMemoryTexture = true;\n}\n\n\/*************************************************************************\n\tDestructor\n*************************************************************************\/\nDirectX81Texture::~DirectX81Texture(void)\n{\n\tfreeD3DTexture();\n}\n\n\/*************************************************************************\n\tLoad texture from file.  Texture is made to be same size as image in\n\tfile.\n*************************************************************************\/\nvoid DirectX81Texture::loadFromFile(const String& filename)\n{\n\tfreeD3DTexture();\n\n\t\/\/ load the file via the resource provider\n\tRawDataContainer texFile;\n\tSystem::getSingleton().getResourceProvider()->loadRawDataContainer(filename, texFile);\n\t\n\tD3DXIMAGE_INFO texInfo;\n\tHRESULT hr = D3DXCreateTextureFromFileInMemoryEx(((DirectX81Renderer*)getRenderer())->getDevice(), texFile.getDataPtr(), texFile.getSize(),\n\t\t\t\t\t\tD3DX_DEFAULT, D3DX_DEFAULT, 1, 0, D3DFMT_UNKNOWN, D3DPOOL_DEFAULT, D3DX_DEFAULT, D3DX_DEFAULT,\n\t\t\t\t\t\t0, &texInfo, NULL, &d_d3dtexture);\n\n\tif (SUCCEEDED(hr))\n\t{\n\t\td_width\t\t= texInfo.Width;\n\t\td_height\t= texInfo.Height;\n\n\t\td_filename = filename;\n\t\td_isMemoryTexture = false;\n\t}\n\telse\n\t{\n\t\tthrow RendererException((utf8*)\"Failed to create Texture object from file '\" + filename + \"'.  Additional Info: \" + (const utf8*)DXGetErrorString8(hr));\n\t}\n\n}\n\n\n\/*************************************************************************\n\tLoad texture from raw memory.\t\n*************************************************************************\/\nvoid DirectX81Texture::loadFromMemory(const void* buffPtr, uint buffWidth, uint buffHeight)\n{\n\tusing namespace std;\n\n\t\/\/ release old texture\n\tfreeD3DTexture();\n\n\t\/\/ calculate square size big enough for whole memory buffer\n\tuint tex_size = std::max(buffWidth, buffHeight);\n\n\t\/\/ create a texture\n\t\/\/ TODO: Check resulting pixel format and react appropriately.\n\tHRESULT hr = D3DXCreateTexture(((DirectX81Renderer*)getRenderer())->getDevice(), tex_size, tex_size, 1, 0, D3DFMT_A8R8G8B8, D3DPOOL_MANAGED, &d_d3dtexture);\n\n\tif (FAILED(hr))\n\t{\n\t\tthrow RendererException((utf8*)\"Failed to load texture from memory: D3D Texture creation failed.\");\n\t}\n\telse\n\t{\n\t\tD3DSURFACE_DESC\ttexdesc;\n\t\td_d3dtexture->GetLevelDesc(0, &texdesc);\n\n\t\t\/\/ store new size;\n\t\td_width\t\t= texdesc.Width;\n\t\td_height\t= texdesc.Height;\n\n\t\t\/\/ lock the D3D texture\n\t\tD3DLOCKED_RECT\trect;\n\t\thr = d_d3dtexture->LockRect(0, &rect, NULL, 0);\n\n\t\tif (FAILED(hr))\n\t\t{\n\t\t\td_d3dtexture->Release();\n\t\t\td_d3dtexture = NULL;\n\n\t\t\tthrow RendererException((utf8*)\"Failed to load texture from memory: IDirect3DTexture8::LockRect failed.\");\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ copy data from buffer into texture\n\t\t\tulong* dst = (ulong*)rect.pBits;\n\t\t\tulong* src = (ulong*)buffPtr;\n\n\t\t\tfor (uint i = 0; i < buffHeight; ++i)\n\t\t\t{\n\t\t\t\tfor (uint j = 0; j < buffWidth; ++j)\n\t\t\t\t{\n\t\t\t\t\tdst[j] = src[j];\n\t\t\t\t}\n\n\t\t\t\tdst += rect.Pitch \/ sizeof(ulong);\n\t\t\t\tsrc += buffWidth;\n\t\t\t}\n\n\t\t\td_d3dtexture->UnlockRect(0);\n\t\t}\n\n\t}\n\n}\n\n\n\/*************************************************************************\n\tsafely release D3D texture associated with this Texture\n*************************************************************************\/\nvoid DirectX81Texture::freeD3DTexture(void)\n{\n\tif (d_d3dtexture != NULL)\n\t{\n\t\td_d3dtexture->Release();\n\t\td_d3dtexture = NULL;\n\t}\n\n\td_filename.clear();\n\td_isMemoryTexture = true;\n}\n\n\n\/*************************************************************************\n\tallocate a D3D texture >= 'size'.  Previous D3D texture is lost\n*************************************************************************\/\nvoid DirectX81Texture::setD3DTextureSize(uint size)\n{\n\tfreeD3DTexture();\n\n\tHRESULT hr = D3DXCreateTexture(((DirectX81Renderer*)getRenderer())->getDevice(), size, size, 1, 0, D3DFMT_A8R8G8B8, D3DPOOL_MANAGED, &d_d3dtexture);\n\n\tif (FAILED(hr))\n\t{\n\t\tthrow RendererException((utf8*)\"Failed to create texture of specified size: D3D Texture creation failed.\");\n\t}\n\telse\n\t{\n\t\tD3DSURFACE_DESC\ttexdesc;\n\t\td_d3dtexture->GetLevelDesc(0, &texdesc);\n\n\t\t\/\/ store new size;\n\t\td_width\t\t= texdesc.Width;\n\t\td_height\t= texdesc.Height;\n\t}\n\n}\n\n\n\/*************************************************************************\n\tDirect3D support method that must be called prior to a Reset call\n\ton the Direct3DDevice.\n*************************************************************************\/\nvoid DirectX81Texture::preD3DReset(void)\n{\n\t\/\/ textures not based on files are in the managed pool, so we do\n\t\/\/ not worry about those.\n\tif (!d_isMemoryTexture)\n\t{\n\t\t\/\/ release the d3d texture\n\t\tif (d_d3dtexture != NULL)\n\t\t{\n\t\t\tif (FAILED(d_d3dtexture->Release()))\n\t\t\t{\n\t\t\t\tthrow RendererException(\"DirectX81Texture::preD3DReset - failed to release the Direct3DTexture8 object for this texture.\");\n\t\t\t}\n\n\t\t\td_d3dtexture = NULL;\n\t\t}\n\n\t}\n\n}\n\n\n\/*************************************************************************\n\tDirect3D support method that must be called after a Reset call on the\n\tDirect3DDevice.\n*************************************************************************\/\nvoid DirectX81Texture::postD3DReset(void)\n{\n\t\/\/ textures not based on files are in the managed pool, so we do\n\t\/\/ not worry about those.\n\tif (!d_isMemoryTexture)\n\t{\n\t\t\/\/ The reason this copy is made is that d_filename will be reset once we\n\t\t\/\/ call loadFromFile and loading would always fail due to invalid filenames.\n\t\tString name(d_filename);\n\n\t\t\/\/ re-load the texture\n\t\tloadFromFile(name);\n\t}\n\n}\n\n} \/\/ End of  CEGUI namespace section\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 <QFileInfo>\n#include <QDebug>\n\n\/\/ Visomics includes\n#include \"voAnalysis.h\"\n#include \"voApplication.h\"\n#include \"voDataModel.h\"\n#include \"voDataModelItem.h\"\n#include \"voInputFileDataObject.h\"\n#include \"voIOManager.h\"\n#include \"voRegistry.h\"\n#include \"voUtils.h\"\n#include \"vtkExtendedTable.h\"\n#include \"voTableDataObject.h\"\n\n\/\/ VTK includes\n#include <vtkDelimitedTextReader.h>\n#include <vtkDelimitedTextWriter.h>\n#include <vtkDoubleArray.h>\n#include <vtkGenericDataObjectWriter.h>\n#include <vtkNew.h>\n#include <vtkSmartPointer.h>\n#include <vtkStringArray.h>\n#include <vtkTable.h>\n#include <vtkMultiNewickTreeReader.h>\n#include <vtkNewickTreeReader.h>\n#include <vtkMultiPieceDataSet.h>\n#include <vtkGraphLayoutView.h>\n#include <vtkTree.h>\n\n\n\/\/ --------------------------------------------------------------------------\nbool voIOManager::readCSVFileIntoTable(const QString& fileName, vtkTable * outputTable, const voDelimitedTextImportSettings& settings, const bool haveHeaders)\n{\n  if (!outputTable)\n    {\n    return false;\n    }\n\n  vtkNew<vtkDelimitedTextReader> reader;\n  reader->SetFileName(fileName.toLatin1());\n\n  \/\/ Configure reader\n  reader->SetFieldDelimiterCharacters(\n        settings.value(voDelimitedTextImportSettings::FieldDelimiterCharacters).toString().toLatin1());\n  reader->SetMergeConsecutiveDelimiters(\n        settings.value(voDelimitedTextImportSettings::MergeConsecutiveDelimiters).toBool());\n  reader->SetStringDelimiter(\n        settings.value(voDelimitedTextImportSettings::StringDelimiter).toChar().toLatin1());\n  reader->SetUseStringDelimiter(\n        settings.value(voDelimitedTextImportSettings::UseStringDelimiter).toBool());\n  reader->SetHaveHeaders(haveHeaders);\n\n  \/\/ Read data\n  reader->Update();\n\n  outputTable->ShallowCopy(reader->GetOutput());\n\n  return true;\n}\n\n\/\/ --------------------------------------------------------------------------\nbool voIOManager::writeTableToCVSFile(vtkTable* table, const QString& fileName)\n{\n  if (!table)\n    {\n    return false;\n    }\n\n  vtkNew<vtkDelimitedTextWriter> writer;\n\n  voDelimitedTextImportSettings settings;\n\n  \/\/ Configure writer\n  writer->SetFieldDelimiter(\n        settings.value(voDelimitedTextImportSettings::FieldDelimiterCharacters).toString().toLatin1());\n  writer->SetStringDelimiter(\n        QString(settings.value(voDelimitedTextImportSettings::StringDelimiter).toChar()).toLatin1());\n  writer->SetUseStringDelimiter(\n        settings.value(voDelimitedTextImportSettings::UseStringDelimiter).toBool());\n\n  writer->SetFileName(fileName.toLatin1());\n\n  writer->SetInputData(table);\n  writer->Update();\n\n  return true;\n}\n\n\/\/ --------------------------------------------------------------------------\nvoid voIOManager::fillExtendedTable(vtkTable* sourceTable, vtkExtendedTable* destTable,\n                                    const voDelimitedTextImportSettings& settings)\n{\n  \/\/ vtkExtendedTable settings\n  bool transpose = settings.value(voDelimitedTextImportSettings::Transpose).toBool();\n  if (transpose)\n    {\n    voUtils::transposeTable(sourceTable);\n    }\n\n  int numberOfRowMetaDataTypes =\n      settings.value(voDelimitedTextImportSettings::NumberOfRowMetaDataTypes).toInt();\n  int numberOfColumnMetaDataTypes =\n      settings.value(voDelimitedTextImportSettings::NumberOfColumnMetaDataTypes).toInt();\n\n  Q_ASSERT(numberOfColumnMetaDataTypes <= sourceTable->GetNumberOfRows());\n\n  \/\/sourceTable->Dump();\n\n  \/\/ ColumnMetaData\n  vtkNew<vtkTable> columnMetaData;\n  for (int cid = numberOfRowMetaDataTypes; cid < sourceTable->GetNumberOfColumns(); ++cid)\n    {\n    vtkStringArray * column = vtkStringArray::SafeDownCast(sourceTable->GetColumn(cid));\n    Q_ASSERT(column);\n    for (int rid = 0; rid < numberOfColumnMetaDataTypes; ++rid)\n      {\n      vtkSmartPointer<vtkStringArray> newColumn;\n      if (cid == numberOfRowMetaDataTypes)\n        {\n        newColumn = vtkSmartPointer<vtkStringArray>::New();\n        newColumn->SetNumberOfValues(sourceTable->GetNumberOfColumns() - numberOfRowMetaDataTypes);\n        columnMetaData->AddColumn(newColumn);\n        }\n      else\n        {\n        newColumn = vtkStringArray::SafeDownCast(columnMetaData->GetColumn(rid));\n        }\n      Q_ASSERT(newColumn);\n      vtkStdString value = column->GetValue(rid);\n      newColumn->SetValue(cid - numberOfRowMetaDataTypes, value);\n      }\n    }\n\n  \/\/columnMetaData->Dump();\n\n  \/\/ ColumnMetaDataLabels\n  vtkNew<vtkStringArray> columnMetaDataLabels;\n  if (numberOfRowMetaDataTypes > 0) \/\/ If there are no row metadata types, there is no room for column metadata labels\n    {\n    for (int rid = 0; rid < numberOfColumnMetaDataTypes; rid++)\n      {\n      columnMetaDataLabels->InsertNextValue(sourceTable->GetValue(rid, 0).ToString());\n      }\n    }\n\n  \/\/ RowMetaData\n  vtkNew<vtkTable> rowMetaData;\n  Q_ASSERT(numberOfRowMetaDataTypes <= sourceTable->GetNumberOfColumns());\n  for (int cid = 0; cid < numberOfRowMetaDataTypes; ++cid)\n    {\n    vtkStringArray * column = vtkStringArray::SafeDownCast(sourceTable->GetColumn(cid));\n    Q_ASSERT(column);\n    for (int rid = numberOfColumnMetaDataTypes; rid < column->GetNumberOfValues(); ++rid)\n      {\n      vtkSmartPointer<vtkStringArray> newColumn;\n      if (rid == numberOfColumnMetaDataTypes)\n        {\n        newColumn = vtkSmartPointer<vtkStringArray>::New();\n        newColumn->SetNumberOfValues(sourceTable->GetNumberOfRows() - numberOfColumnMetaDataTypes);\n        rowMetaData->AddColumn(newColumn);\n        }\n      else\n        {\n        newColumn = vtkStringArray::SafeDownCast(rowMetaData->GetColumn(cid));\n        }\n      Q_ASSERT(newColumn);\n      vtkStdString value = column->GetValue(rid);\n      newColumn->SetValue(rid - numberOfColumnMetaDataTypes, value);\n      }\n    }\n\n  \/\/rowMetaData->Dump();\n\n  \/\/ RowMetaDataLabels\n  vtkNew<vtkStringArray> rowMetaDataLabels;\n  if (numberOfColumnMetaDataTypes > 0) \/\/ If there are no column metadata types, there is no room for row metadata labels\n    {\n    for (int cid = 0; cid < numberOfRowMetaDataTypes; cid++)\n      {\n      rowMetaDataLabels->InsertNextValue(sourceTable->GetValue(0, cid).ToString());\n      }\n    }\n\n  \/\/ Data\n  vtkNew<vtkTable> data;\n  for (int cid = numberOfRowMetaDataTypes; cid < sourceTable->GetNumberOfColumns(); ++cid)\n    {\n    vtkStringArray * column = vtkStringArray::SafeDownCast(sourceTable->GetColumn(cid));\n    Q_ASSERT(column);\n    for (int rid = numberOfColumnMetaDataTypes; rid < column->GetNumberOfValues(); ++rid)\n      {\n      vtkSmartPointer<vtkDoubleArray> newColumn;\n      if (rid == numberOfColumnMetaDataTypes)\n        {\n        newColumn = vtkSmartPointer<vtkDoubleArray>::New();\n        newColumn->SetNumberOfValues(sourceTable->GetNumberOfRows() - numberOfColumnMetaDataTypes);\n        data->AddColumn(newColumn);\n        }\n      else\n        {\n        newColumn = vtkDoubleArray::SafeDownCast(data->GetColumn(cid - numberOfRowMetaDataTypes));\n        }\n      Q_ASSERT(newColumn);\n      vtkStdString value = column->GetValue(rid);\n      \/\/ Convert to numeric\n      bool ok = false;\n      double doubleValue = vtkVariant(value).ToDouble(&ok);\n      if (!ok)\n        {\n        qCritical() << \"Data at column\" << cid << \"and row\" << rid << \"is not a numeric value !\"\n                    << \" - Defaulting to 0\";\n        doubleValue = 0;\n        }\n      newColumn->SetValue(rid - numberOfColumnMetaDataTypes, doubleValue);\n      }\n    }\n\n  \/\/data->Dump();\n\n  \/\/ ColumnMetaDataTypeOfInterest\n  int columnMetaDataTypeOfInterest =\n      settings.value(voDelimitedTextImportSettings::ColumnMetaDataTypeOfInterest).toInt();\n\n  \/\/ RowMetaDataTypeOfInterest\n  int rowMetaDataTypeOfInterest =\n      settings.value(voDelimitedTextImportSettings::RowMetaDataTypeOfInterest).toInt();\n\n  destTable->SetColumnMetaDataTable(columnMetaData.GetPointer());\n  destTable->SetRowMetaDataTable(rowMetaData.GetPointer());\n  destTable->SetData(data.GetPointer());\n  destTable->SetColumnMetaDataTypeOfInterest(columnMetaDataTypeOfInterest);\n  destTable->SetRowMetaDataTypeOfInterest(rowMetaDataTypeOfInterest);\n  destTable->SetColumnMetaDataLabels(columnMetaDataLabels.GetPointer());\n  destTable->SetRowMetaDataLabels(rowMetaDataLabels.GetPointer());\n\n  \/\/ Set column names\n  voUtils::setTableColumnNames(destTable->GetData(), destTable->GetColumnMetaDataOfInterestAsString());\n\n  \/\/ NormalizationMethod\n  QString normalizationMethod =\n      settings.value(voDelimitedTextImportSettings::NormalizationMethod).toString();\n\n  \/\/ Normalize\n  if (voApplication::application())\n    {\n    voApplication::application()->normalizerRegistry()->apply(\n          normalizationMethod, destTable->GetData(), settings);\n    }\n\n  \/\/destTable->GetData()->Dump();\n}\n\n\/\/ --------------------------------------------------------------------------\nvoid voIOManager::openCSVFile(const QString& fileName, const voDelimitedTextImportSettings& settings)\n{\n  \/\/ settings.printAdditionalInfo();\n\n  vtkNew<vtkTable> table;\n  Self::readCSVFileIntoTable(fileName, table.GetPointer(), settings);\n\n  vtkNew<vtkExtendedTable> extendedTable;\n  Self::fillExtendedTable(table.GetPointer(), extendedTable.GetPointer(), settings);\n\n  voInputFileDataObject * dataObject =\n      new voInputFileDataObject(fileName, extendedTable.GetPointer());\n\n  voDataModel * model = voApplication::application()->dataModel();\n\n  voDataModelItem * newItem = model->addDataObject(dataObject);\n  newItem->setRawViewType(\"voExtendedTableView\");\n\n  \/\/ Select added item\n  model->setSelected(newItem);\n\n  \/\/extendedTable->Dump();\n}\n\nvoid voIOManager::loadPhyloTreeDataSet(const QString& fileName)\n{\n  \/\/ load the phylo tree data set file\n  vtkSmartPointer<vtkMultiNewickTreeReader> reader =\n        vtkSmartPointer<vtkMultiNewickTreeReader>::New();\n\n  reader->SetFileName(fileName.toStdString().c_str());\n  vtkMultiPieceDataSet * forest = reader->GetOutput();\n  reader->Update();\n\n\n  voDataModel * model = voApplication::application()->dataModel();\n\n  if (forest->GetNumberOfPieces() == 1)\n     { \/\/single tree\n     vtkTree * tree =  vtkTree::SafeDownCast( forest->GetPieceAsDataObject(0));\n     voInputFileDataObject * dataObject =\n       new voInputFileDataObject(fileName, tree);\n     voDataModelItem * newItem = model->addDataObject(dataObject);\n     newItem->setRawViewType(\"voTreeHeatmapView\");\n\n     model->setSelected(newItem);\n     }\n  else\n     {\/\/multiple trees --forest\n     voDataObject * emptyDataObject = new voDataObject(QFileInfo(fileName).baseName(),NULL);\n     voDataModelItem * newForestItem = model->addDataObject(emptyDataObject);\n     for (unsigned int i = 0; i < forest->GetNumberOfPieces(); i++)\n       {\n       vtkTree * tree =  vtkTree::SafeDownCast( forest->GetPieceAsDataObject(i));\n       QString displayName = QString(\"tree-%1\").arg(QString::number(i));\n       voInputFileDataObject * dataObject = new voInputFileDataObject(displayName, tree);\n       voDataModelItem * treeItem = model->addDataObjectAsChild(dataObject, newForestItem);\n       treeItem->setRawViewType(\"voTreeHeatmapView\");\n\n       newForestItem->addChildItem(treeItem);\n       }\n     model->setSelected(newForestItem);\n     }\n}\n\n\/\/ --------------------------------------------------------------------------\nvoid voIOManager::loadPhyloTreeDataSet(const QString& fileName,\n  const QString & tableFileName, const voDelimitedTextImportSettings& settings )\n{\n  voDataModel * model = voApplication::application()->dataModel();\n  voDataObject * emptyDataObject = new voDataObject(QFileInfo(fileName).baseName(),NULL);\n  voDataModelItem * newItem = model->addDataObject(emptyDataObject);\n\n  \/\/ load the phylo tree\n  vtkSmartPointer<vtkMultiNewickTreeReader> reader =\n        vtkSmartPointer<vtkMultiNewickTreeReader>::New();\n\n  reader->SetFileName(fileName.toStdString().c_str());\n  vtkMultiPieceDataSet * forest = reader->GetOutput();\n  reader->Update();\n\n  \/\/ load associated table data\n  vtkNew<vtkTable> table;\n  Self::readCSVFileIntoTable(tableFileName, table.GetPointer(), settings, true);\n  vtkNew<vtkExtendedTable> extendedTable;\n  Self::fillExtendedTable(table.GetPointer(), extendedTable.GetPointer(), settings);\n  extendedTable->SetInputDataTable(table.GetPointer());\n\n  voTableDataObject * dataObjectTable =\n    new voTableDataObject(QFileInfo(tableFileName).baseName(), extendedTable.GetPointer());\n\n  if (forest->GetNumberOfPieces() == 1)\n    { \/\/single tree\n    vtkTree * tree =  vtkTree::SafeDownCast( forest->GetPieceAsDataObject(0));\n    voInputFileDataObject * dataObject =\n      new voInputFileDataObject(fileName, tree);\n    voDataModelItem * treeItem = model->addDataObjectAsChild(dataObject, newItem);\n    treeItem->setRawViewType(\"voTreeHeatmapView\");\n\n    voDataModelItem * tableItem = model->addDataObjectAsChild(dataObjectTable,newItem);\n    tableItem->setType(voDataModelItem::InputType);\n    tableItem->setRawViewType(\"voTableView\");\n\n    \/\/ add table data\n    \/\/ use tree heat map view, the tree and the table must be matching\n    unsigned int NumberOfLeafNodes = 0;\n    for (vtkIdType vertex = 0; vertex < tree->GetNumberOfVertices(); ++vertex)\n      {\n      if (!tree->IsLeaf(vertex))\n        {\n        continue;\n        }\n      ++NumberOfLeafNodes;\n      }\n\n    if (table->GetNumberOfRows() == NumberOfLeafNodes )\n      {\/\/display data table as a heat map\n      newItem->setRawViewType(\"voTreeHeatmapView\");\n      newItem->setType(voDataModelItem::InputType);\n      }\n    newItem->addChildItem(treeItem);\n    newItem->addChildItem(tableItem);\n\n    }\n  else\n    {\/\/multiple trees --forest\n    for (unsigned int i = 0; i < forest->GetNumberOfPieces(); i++)\n      {\n      vtkTree * tree =  vtkTree::SafeDownCast( forest->GetPieceAsDataObject(i));\n      QString displayName = QString(\"tree-%1\").arg(QString::number(i));\n      voInputFileDataObject * dataObject = new voInputFileDataObject(displayName, tree);\n      voDataModelItem * treeItem = model->addDataObjectAsChild(dataObject, newItem);\n      treeItem->setRawViewType(\"voTreeHeatmapView\");\n\n      newItem->addChildItem(treeItem);\n      }\n\n    \/\/add table item\n    voDataModelItem * tableItem = model->addDataObjectAsChild(dataObjectTable,newItem);\n    tableItem->setRawViewType(\"voTableView\");\n    newItem->addChildItem(tableItem);\n    }\n\n  model->setSelected(newItem);\n\n}\n\n\/\/ --------------------------------------------------------------------------\nbool voIOManager::writeDataObjectToFile(vtkDataObject * dataObject, const QString& fileName)\n{\n  if (!dataObject)\n    {\n    return false;\n    }\n\n  vtkNew<vtkGenericDataObjectWriter> dataWriter;\n  dataWriter->SetFileName(fileName.toLatin1());\n  dataWriter->SetInputData(dataObject);\n  dataWriter->Update();\n\n  return true;\n}\n<commit_msg>fix header display of associated table<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 <QFileInfo>\n#include <QDebug>\n\n\/\/ Visomics includes\n#include \"voAnalysis.h\"\n#include \"voApplication.h\"\n#include \"voDataModel.h\"\n#include \"voDataModelItem.h\"\n#include \"voInputFileDataObject.h\"\n#include \"voIOManager.h\"\n#include \"voRegistry.h\"\n#include \"voUtils.h\"\n#include \"vtkExtendedTable.h\"\n#include \"voTableDataObject.h\"\n\n\/\/ VTK includes\n#include <vtkDelimitedTextReader.h>\n#include <vtkDelimitedTextWriter.h>\n#include <vtkDoubleArray.h>\n#include <vtkGenericDataObjectWriter.h>\n#include <vtkNew.h>\n#include <vtkSmartPointer.h>\n#include <vtkStringArray.h>\n#include <vtkTable.h>\n#include <vtkMultiNewickTreeReader.h>\n#include <vtkNewickTreeReader.h>\n#include <vtkMultiPieceDataSet.h>\n#include <vtkGraphLayoutView.h>\n#include <vtkTree.h>\n\n\n\/\/ --------------------------------------------------------------------------\nbool voIOManager::readCSVFileIntoTable(const QString& fileName, vtkTable * outputTable, const voDelimitedTextImportSettings& settings, const bool haveHeaders)\n{\n  if (!outputTable)\n    {\n    return false;\n    }\n\n  vtkNew<vtkDelimitedTextReader> reader;\n  reader->SetFileName(fileName.toLatin1());\n\n  \/\/ Configure reader\n  reader->SetFieldDelimiterCharacters(\n        settings.value(voDelimitedTextImportSettings::FieldDelimiterCharacters).toString().toLatin1());\n  reader->SetMergeConsecutiveDelimiters(\n        settings.value(voDelimitedTextImportSettings::MergeConsecutiveDelimiters).toBool());\n  reader->SetStringDelimiter(\n        settings.value(voDelimitedTextImportSettings::StringDelimiter).toChar().toLatin1());\n  reader->SetUseStringDelimiter(\n        settings.value(voDelimitedTextImportSettings::UseStringDelimiter).toBool());\n  reader->SetHaveHeaders(haveHeaders);\n\n  \/\/ Read data\n  reader->Update();\n\n  outputTable->ShallowCopy(reader->GetOutput());\n\n  return true;\n}\n\n\/\/ --------------------------------------------------------------------------\nbool voIOManager::writeTableToCVSFile(vtkTable* table, const QString& fileName)\n{\n  if (!table)\n    {\n    return false;\n    }\n\n  vtkNew<vtkDelimitedTextWriter> writer;\n\n  voDelimitedTextImportSettings settings;\n\n  \/\/ Configure writer\n  writer->SetFieldDelimiter(\n        settings.value(voDelimitedTextImportSettings::FieldDelimiterCharacters).toString().toLatin1());\n  writer->SetStringDelimiter(\n        QString(settings.value(voDelimitedTextImportSettings::StringDelimiter).toChar()).toLatin1());\n  writer->SetUseStringDelimiter(\n        settings.value(voDelimitedTextImportSettings::UseStringDelimiter).toBool());\n\n  writer->SetFileName(fileName.toLatin1());\n\n  writer->SetInputData(table);\n  writer->Update();\n\n  return true;\n}\n\n\/\/ --------------------------------------------------------------------------\nvoid voIOManager::fillExtendedTable(vtkTable* sourceTable, vtkExtendedTable* destTable,\n                                    const voDelimitedTextImportSettings& settings)\n{\n  \/\/ vtkExtendedTable settings\n  bool transpose = settings.value(voDelimitedTextImportSettings::Transpose).toBool();\n  if (transpose)\n    {\n    voUtils::transposeTable(sourceTable);\n    }\n\n  int numberOfRowMetaDataTypes =\n      settings.value(voDelimitedTextImportSettings::NumberOfRowMetaDataTypes).toInt();\n  int numberOfColumnMetaDataTypes =\n      settings.value(voDelimitedTextImportSettings::NumberOfColumnMetaDataTypes).toInt();\n\n  Q_ASSERT(numberOfColumnMetaDataTypes <= sourceTable->GetNumberOfRows());\n\n  \/\/sourceTable->Dump();\n\n  \/\/ ColumnMetaData\n  vtkNew<vtkTable> columnMetaData;\n  for (int cid = numberOfRowMetaDataTypes; cid < sourceTable->GetNumberOfColumns(); ++cid)\n    {\n    vtkStringArray * column = vtkStringArray::SafeDownCast(sourceTable->GetColumn(cid));\n    Q_ASSERT(column);\n    for (int rid = 0; rid < numberOfColumnMetaDataTypes; ++rid)\n      {\n      vtkSmartPointer<vtkStringArray> newColumn;\n      if (cid == numberOfRowMetaDataTypes)\n        {\n        newColumn = vtkSmartPointer<vtkStringArray>::New();\n        newColumn->SetNumberOfValues(sourceTable->GetNumberOfColumns() - numberOfRowMetaDataTypes);\n        columnMetaData->AddColumn(newColumn);\n        }\n      else\n        {\n        newColumn = vtkStringArray::SafeDownCast(columnMetaData->GetColumn(rid));\n        }\n      Q_ASSERT(newColumn);\n      vtkStdString value = column->GetValue(rid);\n      newColumn->SetValue(cid - numberOfRowMetaDataTypes, value);\n      }\n    }\n\n  \/\/columnMetaData->Dump();\n\n  \/\/ ColumnMetaDataLabels\n  vtkNew<vtkStringArray> columnMetaDataLabels;\n  if (numberOfRowMetaDataTypes > 0) \/\/ If there are no row metadata types, there is no room for column metadata labels\n    {\n    for (int rid = 0; rid < numberOfColumnMetaDataTypes; rid++)\n      {\n      columnMetaDataLabels->InsertNextValue(sourceTable->GetValue(rid, 0).ToString());\n      }\n    }\n\n  \/\/ RowMetaData\n  vtkNew<vtkTable> rowMetaData;\n  Q_ASSERT(numberOfRowMetaDataTypes <= sourceTable->GetNumberOfColumns());\n  for (int cid = 0; cid < numberOfRowMetaDataTypes; ++cid)\n    {\n    vtkStringArray * column = vtkStringArray::SafeDownCast(sourceTable->GetColumn(cid));\n    Q_ASSERT(column);\n    for (int rid = numberOfColumnMetaDataTypes; rid < column->GetNumberOfValues(); ++rid)\n      {\n      vtkSmartPointer<vtkStringArray> newColumn;\n      if (rid == numberOfColumnMetaDataTypes)\n        {\n        newColumn = vtkSmartPointer<vtkStringArray>::New();\n        newColumn->SetNumberOfValues(sourceTable->GetNumberOfRows() - numberOfColumnMetaDataTypes);\n        rowMetaData->AddColumn(newColumn);\n        }\n      else\n        {\n        newColumn = vtkStringArray::SafeDownCast(rowMetaData->GetColumn(cid));\n        }\n      Q_ASSERT(newColumn);\n      vtkStdString value = column->GetValue(rid);\n      newColumn->SetValue(rid - numberOfColumnMetaDataTypes, value);\n      }\n    }\n\n  \/\/rowMetaData->Dump();\n\n  \/\/ RowMetaDataLabels\n  vtkNew<vtkStringArray> rowMetaDataLabels;\n  if (numberOfColumnMetaDataTypes > 0) \/\/ If there are no column metadata types, there is no room for row metadata labels\n    {\n    for (int cid = 0; cid < numberOfRowMetaDataTypes; cid++)\n      {\n      rowMetaDataLabels->InsertNextValue(sourceTable->GetValue(0, cid).ToString());\n      }\n    }\n\n  \/\/ Data\n  vtkNew<vtkTable> data;\n  for (int cid = numberOfRowMetaDataTypes; cid < sourceTable->GetNumberOfColumns(); ++cid)\n    {\n    vtkStringArray * column = vtkStringArray::SafeDownCast(sourceTable->GetColumn(cid));\n    Q_ASSERT(column);\n    for (int rid = numberOfColumnMetaDataTypes; rid < column->GetNumberOfValues(); ++rid)\n      {\n      vtkSmartPointer<vtkDoubleArray> newColumn;\n      if (rid == numberOfColumnMetaDataTypes)\n        {\n        newColumn = vtkSmartPointer<vtkDoubleArray>::New();\n        newColumn->SetNumberOfValues(sourceTable->GetNumberOfRows() - numberOfColumnMetaDataTypes);\n        data->AddColumn(newColumn);\n        }\n      else\n        {\n        newColumn = vtkDoubleArray::SafeDownCast(data->GetColumn(cid - numberOfRowMetaDataTypes));\n        }\n      Q_ASSERT(newColumn);\n      vtkStdString value = column->GetValue(rid);\n      \/\/ Convert to numeric\n      bool ok = false;\n      double doubleValue = vtkVariant(value).ToDouble(&ok);\n      if (!ok)\n        {\n        qCritical() << \"Data at column\" << cid << \"and row\" << rid << \"is not a numeric value !\"\n                    << \" - Defaulting to 0\";\n        doubleValue = 0;\n        }\n      newColumn->SetValue(rid - numberOfColumnMetaDataTypes, doubleValue);\n      }\n    }\n\n  \/\/data->Dump();\n\n  \/\/ ColumnMetaDataTypeOfInterest\n  int columnMetaDataTypeOfInterest =\n      settings.value(voDelimitedTextImportSettings::ColumnMetaDataTypeOfInterest).toInt();\n\n  \/\/ RowMetaDataTypeOfInterest\n  int rowMetaDataTypeOfInterest =\n      settings.value(voDelimitedTextImportSettings::RowMetaDataTypeOfInterest).toInt();\n\n  destTable->SetColumnMetaDataTable(columnMetaData.GetPointer());\n  destTable->SetRowMetaDataTable(rowMetaData.GetPointer());\n  destTable->SetData(data.GetPointer());\n  destTable->SetColumnMetaDataTypeOfInterest(columnMetaDataTypeOfInterest);\n  destTable->SetRowMetaDataTypeOfInterest(rowMetaDataTypeOfInterest);\n  destTable->SetColumnMetaDataLabels(columnMetaDataLabels.GetPointer());\n  destTable->SetRowMetaDataLabels(rowMetaDataLabels.GetPointer());\n\n  \/\/ Set column names\n  voUtils::setTableColumnNames(destTable->GetData(), destTable->GetColumnMetaDataOfInterestAsString());\n\n  \/\/ NormalizationMethod\n  QString normalizationMethod =\n      settings.value(voDelimitedTextImportSettings::NormalizationMethod).toString();\n\n  \/\/ Normalize\n  if (voApplication::application())\n    {\n    voApplication::application()->normalizerRegistry()->apply(\n          normalizationMethod, destTable->GetData(), settings);\n    }\n\n  \/\/destTable->GetData()->Dump();\n}\n\n\/\/ --------------------------------------------------------------------------\nvoid voIOManager::openCSVFile(const QString& fileName, const voDelimitedTextImportSettings& settings)\n{\n  \/\/ settings.printAdditionalInfo();\n\n  vtkNew<vtkTable> table;\n  Self::readCSVFileIntoTable(fileName, table.GetPointer(), settings);\n\n  vtkNew<vtkExtendedTable> extendedTable;\n  Self::fillExtendedTable(table.GetPointer(), extendedTable.GetPointer(), settings);\n\n  voInputFileDataObject * dataObject =\n      new voInputFileDataObject(fileName, extendedTable.GetPointer());\n\n  voDataModel * model = voApplication::application()->dataModel();\n\n  voDataModelItem * newItem = model->addDataObject(dataObject);\n  newItem->setRawViewType(\"voExtendedTableView\");\n\n  \/\/ Select added item\n  model->setSelected(newItem);\n\n  \/\/extendedTable->Dump();\n}\n\nvoid voIOManager::loadPhyloTreeDataSet(const QString& fileName)\n{\n  \/\/ load the phylo tree data set file\n  vtkSmartPointer<vtkMultiNewickTreeReader> reader =\n        vtkSmartPointer<vtkMultiNewickTreeReader>::New();\n\n  reader->SetFileName(fileName.toStdString().c_str());\n  vtkMultiPieceDataSet * forest = reader->GetOutput();\n  reader->Update();\n\n\n  voDataModel * model = voApplication::application()->dataModel();\n\n  if (forest->GetNumberOfPieces() == 1)\n     { \/\/single tree\n     vtkTree * tree =  vtkTree::SafeDownCast( forest->GetPieceAsDataObject(0));\n     voInputFileDataObject * dataObject =\n       new voInputFileDataObject(fileName, tree);\n     voDataModelItem * newItem = model->addDataObject(dataObject);\n     newItem->setRawViewType(\"voTreeHeatmapView\");\n\n     model->setSelected(newItem);\n     }\n  else\n     {\/\/multiple trees --forest\n     voDataObject * emptyDataObject = new voDataObject(QFileInfo(fileName).baseName(),NULL);\n     voDataModelItem * newForestItem = model->addDataObject(emptyDataObject);\n     for (unsigned int i = 0; i < forest->GetNumberOfPieces(); i++)\n       {\n       vtkTree * tree =  vtkTree::SafeDownCast( forest->GetPieceAsDataObject(i));\n       QString displayName = QString(\"tree-%1\").arg(QString::number(i));\n       voInputFileDataObject * dataObject = new voInputFileDataObject(displayName, tree);\n       voDataModelItem * treeItem = model->addDataObjectAsChild(dataObject, newForestItem);\n       treeItem->setRawViewType(\"voTreeHeatmapView\");\n\n       newForestItem->addChildItem(treeItem);\n       }\n     model->setSelected(newForestItem);\n     }\n}\n\n\/\/ --------------------------------------------------------------------------\nvoid voIOManager::loadPhyloTreeDataSet(const QString& fileName,\n  const QString & tableFileName, const voDelimitedTextImportSettings& settings )\n{\n  voDataModel * model = voApplication::application()->dataModel();\n  voDataObject * emptyDataObject = new voDataObject(QFileInfo(fileName).baseName(),NULL);\n  voDataModelItem * newItem = model->addDataObject(emptyDataObject);\n\n  \/\/ load the phylo tree\n  vtkSmartPointer<vtkMultiNewickTreeReader> reader =\n        vtkSmartPointer<vtkMultiNewickTreeReader>::New();\n\n  reader->SetFileName(fileName.toStdString().c_str());\n  vtkMultiPieceDataSet * forest = reader->GetOutput();\n  reader->Update();\n\n  \/\/ load associated table data\n  vtkNew<vtkTable> dataTable;\n  vtkNew<vtkTable> inputTable;\n  Self::readCSVFileIntoTable(tableFileName, dataTable.GetPointer(), settings, true);\n  Self::readCSVFileIntoTable(tableFileName, inputTable.GetPointer(), settings);\n  vtkNew<vtkExtendedTable> extendedTable;\n  Self::fillExtendedTable(inputTable.GetPointer(), extendedTable.GetPointer(), settings);\n  extendedTable->SetInputDataTable(dataTable.GetPointer());\n\n  voTableDataObject * dataObjectTable =\n    new voTableDataObject(QFileInfo(tableFileName).baseName(), extendedTable.GetPointer());\n\n  if (forest->GetNumberOfPieces() == 1)\n    { \/\/single tree\n    vtkTree * tree =  vtkTree::SafeDownCast( forest->GetPieceAsDataObject(0));\n    voInputFileDataObject * dataObject =\n      new voInputFileDataObject(fileName, tree);\n    voDataModelItem * treeItem = model->addDataObjectAsChild(dataObject, newItem);\n    treeItem->setRawViewType(\"voTreeHeatmapView\");\n\n    voDataModelItem * tableItem = model->addDataObjectAsChild(dataObjectTable,newItem);\n    tableItem->setType(voDataModelItem::InputType);\n    tableItem->setRawViewType(\"voExtendedTableView\");\n\n    \/\/ add table data\n    \/\/ use tree heat map view, the tree and the table must be matching\n    unsigned int NumberOfLeafNodes = 0;\n    for (vtkIdType vertex = 0; vertex < tree->GetNumberOfVertices(); ++vertex)\n      {\n      if (!tree->IsLeaf(vertex))\n        {\n        continue;\n        }\n      ++NumberOfLeafNodes;\n      }\n\n    if (dataTable->GetNumberOfRows() == NumberOfLeafNodes )\n      {\/\/display data table as a heat map\n      newItem->setRawViewType(\"voTreeHeatmapView\");\n      newItem->setType(voDataModelItem::InputType);\n      }\n    newItem->addChildItem(treeItem);\n    newItem->addChildItem(tableItem);\n\n    }\n  else\n    {\/\/multiple trees --forest\n    for (unsigned int i = 0; i < forest->GetNumberOfPieces(); i++)\n      {\n      vtkTree * tree =  vtkTree::SafeDownCast( forest->GetPieceAsDataObject(i));\n      QString displayName = QString(\"tree-%1\").arg(QString::number(i));\n      voInputFileDataObject * dataObject = new voInputFileDataObject(displayName, tree);\n      voDataModelItem * treeItem = model->addDataObjectAsChild(dataObject, newItem);\n      treeItem->setRawViewType(\"voTreeHeatmapView\");\n\n      newItem->addChildItem(treeItem);\n      }\n\n    \/\/add table item\n    voDataModelItem * tableItem = model->addDataObjectAsChild(dataObjectTable,newItem);\n    tableItem->setRawViewType(\"voTableView\");\n    newItem->addChildItem(tableItem);\n    }\n\n  model->setSelected(newItem);\n\n}\n\n\/\/ --------------------------------------------------------------------------\nbool voIOManager::writeDataObjectToFile(vtkDataObject * dataObject, const QString& fileName)\n{\n  if (!dataObject)\n    {\n    return false;\n    }\n\n  vtkNew<vtkGenericDataObjectWriter> dataWriter;\n  dataWriter->SetFileName(fileName.toLatin1());\n  dataWriter->SetInputData(dataObject);\n  dataWriter->Update();\n\n  return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\/*\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\n#ifndef _QI_MESSAGING_SRC_MUTEXEDNAMELOOKUP_HPP_\n#define _QI_MESSAGING_SRC_MUTEXEDNAMELOOKUP_HPP_\n\n#include <map>\n#include <string>\n#include <boost\/thread\/thread.hpp>\n#include <boost\/thread\/mutex.hpp>\n\nnamespace qi {\n  namespace detail {\n\n    template<typename T>\n    class MutexedNameLookup {\n    private:\n      std::map<std::string, T> _map;\n      T                        _invalidValue;\n      boost::mutex             _mutex;\n    public:\n\n      \n      MutexedNameLookup() {}\n\n      void replace(const std::map<std::string, T>& other) {\n        boost::mutex::scoped_lock lock(_mutex);\n        _map = other;\n      }\n\n      const std::map<std::string, T>& getMap() {\n        boost::mutex::scoped_lock lock(_mutex);\n        return _map;\n      }\n\n      const T& get(std::string key) {\n        boost::mutex::scoped_lock lock(_mutex);\n        typename std::map<std::string, T>::const_iterator it;\n        it = _map.find(key);\n        if (it != _map.end()) {\n          return it->second;\n        }\n        return _invalidValue;\n      }\n\n      bool exists(std::string key) {\n        boost::mutex::scoped_lock lock(_mutex);\n        typename std::map<std::string, T>::const_iterator it;\n        it = _map.find(key);\n        return !(it == _map.end());\n      }\n\n      void insert(const std::string key, const T& val) {\n        boost::mutex::scoped_lock lock(_mutex);\n        typename std::map<std::string, T>::const_iterator it = _map.find(key);\n        if (it != _map.end()) {\n          _map.erase(key);\n        }\n        _map.insert(make_pair(key, val));\n      }\n\n      void remove(const std::string key) {\n        boost::mutex::scoped_lock lock(_mutex);\n        _map.erase(key);\n      }\n\n      void setInvalidValue(const T& val) {\n        _invalidValue = val;\n      }\n\n      bool empty() {\n        return _map.empty();\n      }\n\n      std::vector<std::string> getKeys() {\n        boost::mutex::scoped_lock lock(_mutex);\n        std::map<std::string, T>::const_iterator it;\n        std::vector<std::string> result;\n        result.resize(_map.size());\n        int i = 0;\n        for(it = _map.begin(); it != _map.end(); ++it) {\n          result[i++] = it->first;\n        }\n        return result;\n      }\n\n      std::vector<std::string> getKeysWhereValueEquals(const T& val) {\n        boost::mutex::scoped_lock lock(_mutex);\n        std::map<std::string, T>::const_iterator it;\n        std::vector<std::string> result;\n        int i = 0;\n        for(it = _map.begin(); it != _map.end(); ++it) {\n          if (it->second == val) {\n            result.push_back(it->first);\n          }\n        }\n        return result;\n      }\n\n    };\n  }\n}\n\n#endif  \/\/ _QI_MESSAGING_SRC_MUTEXEDNAMELOOKUP_HPP_\n\n<commit_msg>fix compilation<commit_after>#pragma once\n\/*\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\n#ifndef _QI_MESSAGING_SRC_MUTEXEDNAMELOOKUP_HPP_\n#define _QI_MESSAGING_SRC_MUTEXEDNAMELOOKUP_HPP_\n\n#include <map>\n#include <vector>\n#include <string>\n#include <boost\/thread\/thread.hpp>\n#include <boost\/thread\/mutex.hpp>\n\nnamespace qi {\n  namespace detail {\n\n    template<typename T>\n    class MutexedNameLookup {\n    private:\n      std::map<std::string, T> _map;\n      T                        _invalidValue;\n      boost::mutex             _mutex;\n    public:\n\n\n      MutexedNameLookup() {}\n\n      void replace(const std::map<std::string, T>& other) {\n        boost::mutex::scoped_lock lock(_mutex);\n        _map = other;\n      }\n\n      const std::map<std::string, T>& getMap() {\n        boost::mutex::scoped_lock lock(_mutex);\n        return _map;\n      }\n\n      const T& get(std::string key) {\n        boost::mutex::scoped_lock lock(_mutex);\n        typename std::map<std::string, T>::const_iterator it;\n        it = _map.find(key);\n        if (it != _map.end()) {\n          return it->second;\n        }\n        return _invalidValue;\n      }\n\n      bool exists(std::string key) {\n        boost::mutex::scoped_lock lock(_mutex);\n        typename std::map<std::string, T>::const_iterator it;\n        it = _map.find(key);\n        return !(it == _map.end());\n      }\n\n      void insert(const std::string key, const T& val) {\n        boost::mutex::scoped_lock lock(_mutex);\n        typename std::map<std::string, T>::const_iterator it = _map.find(key);\n        if (it != _map.end()) {\n          _map.erase(key);\n        }\n        _map.insert(make_pair(key, val));\n      }\n\n      void remove(const std::string key) {\n        boost::mutex::scoped_lock lock(_mutex);\n        _map.erase(key);\n      }\n\n      void setInvalidValue(const T& val) {\n        _invalidValue = val;\n      }\n\n      bool empty() {\n        return _map.empty();\n      }\n\n      std::vector<std::string> getKeys() {\n        boost::mutex::scoped_lock lock(_mutex);\n        typename std::map<std::string, T>::const_iterator it;\n        std::vector<std::string> result;\n        result.resize(_map.size());\n        int i = 0;\n        for(it = _map.begin(); it != _map.end(); ++it) {\n          result[i++] = it->first;\n        }\n        return result;\n      }\n\n      std::vector<std::string> getKeysWhereValueEquals(const T& val) {\n        boost::mutex::scoped_lock lock(_mutex);\n        typename std::map<std::string, T>::const_iterator it;\n        std::vector<std::string> result;\n        int i = 0;\n        for(it = _map.begin(); it != _map.end(); ++it) {\n          if (it->second == val) {\n            result.push_back(it->first);\n          }\n        }\n        return result;\n      }\n\n    };\n  }\n}\n\n#endif  \/\/ _QI_MESSAGING_SRC_MUTEXEDNAMELOOKUP_HPP_\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 \"Order.hpp\"\n\n#include <geode\/PdxReader.hpp>\n#include <geode\/PdxWriter.hpp>\n\nnamespace customserializable {\n\nvoid Order::fromData(PdxReader& pdxReader) {\n  order_id_ = pdxReader.readInt(ORDER_ID_KEY_);\n  name_ = pdxReader.readString(NAME_KEY_);\n  quantity_ = pdxReader.readShort(QUANTITY_KEY_);\n}\n\nvoid Order::toData(PdxWriter& pdxWriter) const {\n  pdxWriter.writeInt(ORDER_ID_KEY_, order_id_);\n  pdxWriter.markIdentityField(ORDER_ID_KEY_);\n\n  pdxWriter.writeString(NAME_KEY_, name_);\n  pdxWriter.markIdentityField(NAME_KEY_);\n\n  pdxWriter.writeShort(QUANTITY_KEY_, quantity_);\n  pdxWriter.markIdentityField(QUANTITY_KEY_);\n}\n\nstd::string Order::toString() const {\n  return \"OrderID: \" + std::to_string(order_id_) + std::endl + \" Product Name: \" +\n          name_ + std::endl + \" Quantity: \" + std::to_string(quantity_);\n}\n\nconst std::string& Order::getClassName() const {\n  static const std::string CLASS_NAME = \"com.example.Order\";\n  return CLASS_NAME;\n}\n\nstd::shared_ptr<PdxSerializable> Order::createDeserializable() {\n  return std::make_shared<Order>();\n}\n\nconst std::string Order::ORDER_ID_KEY_ = \"order_id\";\nconst std::string Order::NAME_KEY_ = \"name\";\nconst std::string Order::QUANTITY_KEY_ = \"quantity\";\n\n}  \/\/ namespace customserializable\n<commit_msg>GEODE-7203: Fix build break in examples (#524)<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 \"Order.hpp\"\n\n#include <geode\/PdxReader.hpp>\n#include <geode\/PdxWriter.hpp>\n\nnamespace customserializable {\n\nvoid Order::fromData(PdxReader& pdxReader) {\n  order_id_ = pdxReader.readInt(ORDER_ID_KEY_);\n  name_ = pdxReader.readString(NAME_KEY_);\n  quantity_ = pdxReader.readShort(QUANTITY_KEY_);\n}\n\nvoid Order::toData(PdxWriter& pdxWriter) const {\n  pdxWriter.writeInt(ORDER_ID_KEY_, order_id_);\n  pdxWriter.markIdentityField(ORDER_ID_KEY_);\n\n  pdxWriter.writeString(NAME_KEY_, name_);\n  pdxWriter.markIdentityField(NAME_KEY_);\n\n  pdxWriter.writeShort(QUANTITY_KEY_, quantity_);\n  pdxWriter.markIdentityField(QUANTITY_KEY_);\n}\n\nstd::string Order::toString() const {\n  return \"OrderID: \" + std::to_string(order_id_) + \"\\n Product Name: \" +\n          name_ + \"\\n Quantity: \" + std::to_string(quantity_);\n}\n\nconst std::string& Order::getClassName() const {\n  static const std::string CLASS_NAME = \"com.example.Order\";\n  return CLASS_NAME;\n}\n\nstd::shared_ptr<PdxSerializable> Order::createDeserializable() {\n  return std::make_shared<Order>();\n}\n\nconst std::string Order::ORDER_ID_KEY_ = \"order_id\";\nconst std::string Order::NAME_KEY_ = \"name\";\nconst std::string Order::QUANTITY_KEY_ = \"quantity\";\n\n}  \/\/ namespace customserializable\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file logistic_regression_main.cpp\n * @author Ryan Curtin\n *\n * Main executable for logistic regression.\n *\/\n#include <mlpack\/core.hpp>\n#include \"logistic_regression.hpp\"\n\n#include <mlpack\/core\/optimizers\/sgd\/sgd.hpp>\n\nusing namespace std;\nusing namespace mlpack;\nusing namespace mlpack::regression;\nusing namespace mlpack::optimization;\n\nPROGRAM_INFO(\"L2-regularized Logistic Regression and Prediction\",\n    \"An implementation of L2-regularized logistic regression using either the \"\n    \"L-BFGS optimizer or SGD (stochastic gradient descent).  This solves the \"\n    \"regression problem\"\n    \"\\n\\n\"\n    \"  y = (1 \/ 1 + e^-(X * b))\"\n    \"\\n\\n\"\n    \"where y takes values 0 or 1.\"\n    \"\\n\\n\"\n    \"This program allows loading a logistic regression model from a file (-i) \"\n    \"or training a logistic regression model given training data (-t), or both \"\n    \"those things at once.  In addition, this program allows classification on \"\n    \"a test dataset (-T) and will save the classification results to the given \"\n    \"output file (-o).  The logistic regression model itself may be saved with \"\n    \"a file specified using the -m option.\"\n    \"\\n\\n\"\n    \"The training data given with the -t option should have class labels as its\"\n    \" last dimension (so, if the training data is in CSV format, labels should \"\n    \"be the last column).  Alternately, the -l (--labels_file) option may be \"\n    \"used to specify a separate file of labels.\"\n    \"\\n\\n\"\n    \"When a model is being trained, there are many options.  L2 regularization \"\n    \"(to prevent overfitting) can be specified with the -l option, and the \"\n    \"optimizer used to train the model can be specified with the --optimizer \"\n    \"option.  Available options are 'sgd' (stochastic gradient descent) and \"\n    \"'lbfgs' (the L-BFGS optimizer).  There are also various parameters for the\"\n    \" optimizer; the --max_iterations parameter specifies the maximum number of\"\n    \" allowed iterations, and the --tolerance (-e) parameter specifies the \"\n    \"tolerance for convergence.  For the SGD optimizer, the --step_size \"\n    \"parameter controls the step size taken at each iteration by the optimizer.\"\n    \"  If the objective function for your data is oscillating between Inf and \"\n    \"0, the step size is probably too large.  There are more parameters for the\"\n    \" SGD and L-BFGS optimizers, but the C++ interface must be used to access \"\n    \"these.\"\n    \"\\n\\n\"\n    \"Optionally, the model can be used to predict the responses for another \"\n    \"matrix of data points, if --test_file is specified.  The --test_file \"\n    \"option can be specified without --input_file, so long as an existing \"\n    \"logistic regression model is given with --model_file.  The output \"\n    \"predictions from the logistic regression model are stored in the file \"\n    \"given with --output_predictions.\"\n    \"\\n\\n\"\n    \"This implementation of logistic regression does not support the general \"\n    \"multi-class case but instead only the two-class case.  Any responses must \"\n    \"be either 0 or 1.\");\n\n\/\/ Training parameters.\nPARAM_STRING(\"training_file\", \"A file containing the training set (the matrix \"\n    \"of predictors, X).\", \"t\", \"\");\nPARAM_STRING(\"labels_file\", \"A file containing labels (0 or 1) for the points \"\n    \"in the training set (y).\", \"l\", \"\");\n\n\/\/ Optimizer parameters.\nPARAM_DOUBLE(\"lambda\", \"L2-regularization parameter for training.\", \"L\", 0.0);\nPARAM_STRING(\"optimizer\", \"Optimizer to use for training ('lbfgs' or 'sgd').\",\n    \"O\", \"lbfgs\");\nPARAM_DOUBLE(\"tolerance\", \"Convergence tolerance for optimizer.\", \"e\", 1e-10);\nPARAM_INT(\"max_iterations\", \"Maximum iterations for optimizer (0 indicates no \"\n    \"limit).\", \"n\", 10000);\nPARAM_DOUBLE(\"step_size\", \"Step size for SGD optimizer.\", \"s\", 0.01);\n\n\/\/ Model loading\/saving.\nPARAM_STRING(\"input_model_file\", \"File containing existing model (parameters).\",\n    \"m\", \"\");\nPARAM_STRING(\"output_model_file\", \"File to save trained logistic regression \"\n    \"model to.\", \"M\", \"\");\n\n\/\/ Testing.\nPARAM_STRING(\"test_file\", \"File containing test dataset.\", \"T\", \"\");\nPARAM_STRING(\"output_file\", \"If --test_file is specified, this file is \"\n    \"where the predicted responses will be saved.\", \"o\", \"\");\nPARAM_DOUBLE(\"decision_boundary\", \"Decision boundary for prediction; if the \"\n    \"logistic function for a point is less than the boundary, the class is \"\n    \"taken to be 0; otherwise, the class is 1.\", \"d\", 0.5);\n\nint main(int argc, char** argv)\n{\n  CLI::ParseCommandLine(argc, argv);\n\n  \/\/ Collect command-line options.\n  const string trainingFile = CLI::GetParam<string>(\"training_file\");\n  const string labelsFile = CLI::GetParam<string>(\"labels_file\");\n  const double lambda = CLI::GetParam<double>(\"lambda\");\n  const string optimizerType = CLI::GetParam<string>(\"optimizer\");\n  const double tolerance = CLI::GetParam<double>(\"tolerance\");\n  const double stepSize = CLI::GetParam<double>(\"step_size\");\n  const size_t maxIterations = (size_t) CLI::GetParam<int>(\"max_iterations\");\n  const string inputModelFile = CLI::GetParam<string>(\"input_model\");\n  const string outputModelFile = CLI::GetParam<string>(\"output_model\");\n  const string testFile = CLI::GetParam<string>(\"test_file\");\n  const string outputFile = CLI::GetParam<string>(\"output_file\");\n  const double decisionBoundary = CLI::GetParam<double>(\"decision_boundary\");\n\n  \/\/ One of inputFile and modelFile must be specified.\n  if (trainingFile.empty() && inputModelFile.empty())\n    Log::Fatal << \"One of --input_model or --training_file must be specified.\"\n        << endl;\n\n  \/\/ If no output file is given, the user should know that the model will not be\n  \/\/ saved, but only if a model is being trained.\n  if (outputModelFile.empty() && !trainingFile.empty())\n    Log::Warn << \"--output_model_file not given; trained model will not be \"\n        << \"saved.\" << endl;\n\n  \/\/ Tolerance needs to be positive.\n  if (tolerance < 0.0)\n    Log::Fatal << \"Tolerance must be positive (received \" << tolerance << \").\"\n        << endl;\n\n  \/\/ Optimizer has to be L-BFGS or SGD.\n  if (optimizerType != \"lbfgs\" && optimizerType != \"sgd\")\n    Log::Fatal << \"--optimizer must be 'lbfgs' or 'sgd'.\" << endl;\n\n  \/\/ Lambda must be positive.\n  if (lambda < 0.0)\n    Log::Fatal << \"L2-regularization parameter (--lambda) must be positive (\"\n        << \"received \" << lambda << \").\" << endl;\n\n  \/\/ Decision boundary must be between 0 and 1.\n  if (decisionBoundary < 0.0 || decisionBoundary > 1.0)\n    Log::Fatal << \"Decision boundary (--decision_boundary) must be between 0.0 \"\n        << \"and 1.0 (received \" << decisionBoundary << \").\" << endl;\n\n  if ((stepSize < 0.0) && (optimizerType == \"sgd\"))\n    Log::Fatal << \"Step size (--step_size) must be positive (received \"\n        << stepSize << \").\" << endl;\n\n  if (CLI::HasParam(\"step_size\") && optimizerType == \"lbfgs\")\n    Log::Warn << \"Step size (--step_size) ignored because 'sgd' optimizer is \"\n        << \"not being used.\" << endl;\n\n  \/\/ These are the matrices we might use.\n  arma::mat regressors;\n  arma::Mat<size_t> responsesMat;\n  arma::Row<size_t> responses;\n  arma::mat testSet;\n  arma::Row<size_t> predictions;\n\n  \/\/ Load data matrix.\n  if (!trainingFile.empty())\n    data::Load(trainingFile, regressors, true);\n\n  \/\/ Load the model, if necessary.\n  LogisticRegression<> model(0, 0); \/\/ Empty model.\n  if (!inputModelFile.empty())\n  {\n    data::Load(inputModelFile, \"logistic_regression_model\", model);\n  }\n  else\n  {\n    \/\/ Set the size of the parameters vector, if necessary.\n    if (labelsFile.empty())\n      model.Parameters() = arma::zeros<arma::vec>(regressors.n_rows - 1);\n    else\n      model.Parameters() = arma::zeros<arma::vec>(regressors.n_rows);\n  }\n\n  \/\/ Check if the responses are in a separate file.\n  if (!trainingFile.empty() && !labelsFile.empty())\n  {\n    data::Load(labelsFile, responsesMat, true);\n    if (responsesMat.n_cols == 1)\n      responses = responsesMat.col(0).t();\n    else\n      responses = responsesMat.row(0);\n\n    if (responses.n_cols != regressors.n_cols)\n      Log::Fatal << \"The labels (--labels_file) must have the same number of \"\n          << \"points as the training dataset (--training_file).\" << endl;\n  }\n  else if (!trainingFile.empty())\n  {\n    \/\/ The initial predictors for y, Nx1.\n    responses = arma::conv_to<arma::Row<size_t>>::from(\n        regressors.row(regressors.n_rows - 1));\n    regressors.shed_row(regressors.n_rows - 1);\n  }\n\n  \/\/ Verify the labels.\n  if (!trainingFile.empty() && max(responses) > 1)\n    Log::Fatal << \"The labels must be either 0 or 1, not \" << max(responses)\n        << \"!\" << endl;\n\n  \/\/ Now, do the training.\n  if (!trainingFile.empty())\n  {\n    LogisticRegressionFunction<> lrf(regressors, responses, model.Parameters());\n    if (optimizerType == \"sgd\")\n    {\n      SGD<LogisticRegressionFunction<>> sgdOpt(lrf);\n      sgdOpt.MaxIterations() = maxIterations;\n      sgdOpt.Tolerance() = tolerance;\n      sgdOpt.StepSize() = stepSize;\n      Log::Info << \"Training model with SGD optimizer.\" << endl;\n\n      \/\/ This will train the model.\n      model.Train(sgdOpt);\n    }\n    else if (optimizerType == \"lbfgs\")\n    {\n      L_BFGS<LogisticRegressionFunction<>> lbfgsOpt(lrf);\n      lbfgsOpt.MaxIterations() = maxIterations;\n      lbfgsOpt.MinGradientNorm() = tolerance;\n      Log::Info << \"Training model with L-BFGS optimizer.\" << endl;\n\n      \/\/ This will train the model.\n      model.Train(lbfgsOpt);\n    }\n  }\n\n  if (!testFile.empty())\n  {\n    data::Load(testFile, testSet, true);\n\n    \/\/ We must perform predictions on the test set.  Training (and the\n    \/\/ optimizer) are irrelevant here; we'll pass in the model we have.\n    Log::Info << \"Predicting classes of points in '\" << testFile << \"'.\"\n        << endl;\n    model.Predict(testSet, predictions, decisionBoundary);\n\n    \/\/ Save the results, if necessary.\n    if (!outputFile.empty())\n      data::Save(outputFile, predictions, false);\n  }\n\n  if (!outputModelFile.empty())\n  {\n    Log::Info << \"Saving model to '\" << outputModelFile << \"'.\" << endl;\n    data::Save(outputModelFile, \"logistic_regression_model\", model, false);\n  }\n}\n<commit_msg>Update GetParam<>(parameterName) per marcos<commit_after>\/**\n * @file logistic_regression_main.cpp\n * @author Ryan Curtin\n *\n * Main executable for logistic regression.\n *\/\n#include <mlpack\/core.hpp>\n#include \"logistic_regression.hpp\"\n\n#include <mlpack\/core\/optimizers\/sgd\/sgd.hpp>\n\nusing namespace std;\nusing namespace mlpack;\nusing namespace mlpack::regression;\nusing namespace mlpack::optimization;\n\nPROGRAM_INFO(\"L2-regularized Logistic Regression and Prediction\",\n    \"An implementation of L2-regularized logistic regression using either the \"\n    \"L-BFGS optimizer or SGD (stochastic gradient descent).  This solves the \"\n    \"regression problem\"\n    \"\\n\\n\"\n    \"  y = (1 \/ 1 + e^-(X * b))\"\n    \"\\n\\n\"\n    \"where y takes values 0 or 1.\"\n    \"\\n\\n\"\n    \"This program allows loading a logistic regression model from a file (-i) \"\n    \"or training a logistic regression model given training data (-t), or both \"\n    \"those things at once.  In addition, this program allows classification on \"\n    \"a test dataset (-T) and will save the classification results to the given \"\n    \"output file (-o).  The logistic regression model itself may be saved with \"\n    \"a file specified using the -m option.\"\n    \"\\n\\n\"\n    \"The training data given with the -t option should have class labels as its\"\n    \" last dimension (so, if the training data is in CSV format, labels should \"\n    \"be the last column).  Alternately, the -l (--labels_file) option may be \"\n    \"used to specify a separate file of labels.\"\n    \"\\n\\n\"\n    \"When a model is being trained, there are many options.  L2 regularization \"\n    \"(to prevent overfitting) can be specified with the -l option, and the \"\n    \"optimizer used to train the model can be specified with the --optimizer \"\n    \"option.  Available options are 'sgd' (stochastic gradient descent) and \"\n    \"'lbfgs' (the L-BFGS optimizer).  There are also various parameters for the\"\n    \" optimizer; the --max_iterations parameter specifies the maximum number of\"\n    \" allowed iterations, and the --tolerance (-e) parameter specifies the \"\n    \"tolerance for convergence.  For the SGD optimizer, the --step_size \"\n    \"parameter controls the step size taken at each iteration by the optimizer.\"\n    \"  If the objective function for your data is oscillating between Inf and \"\n    \"0, the step size is probably too large.  There are more parameters for the\"\n    \" SGD and L-BFGS optimizers, but the C++ interface must be used to access \"\n    \"these.\"\n    \"\\n\\n\"\n    \"Optionally, the model can be used to predict the responses for another \"\n    \"matrix of data points, if --test_file is specified.  The --test_file \"\n    \"option can be specified without --input_file, so long as an existing \"\n    \"logistic regression model is given with --model_file.  The output \"\n    \"predictions from the logistic regression model are stored in the file \"\n    \"given with --output_predictions.\"\n    \"\\n\\n\"\n    \"This implementation of logistic regression does not support the general \"\n    \"multi-class case but instead only the two-class case.  Any responses must \"\n    \"be either 0 or 1.\");\n\n\/\/ Training parameters.\nPARAM_STRING(\"training_file\", \"A file containing the training set (the matrix \"\n    \"of predictors, X).\", \"t\", \"\");\nPARAM_STRING(\"labels_file\", \"A file containing labels (0 or 1) for the points \"\n    \"in the training set (y).\", \"l\", \"\");\n\n\/\/ Optimizer parameters.\nPARAM_DOUBLE(\"lambda\", \"L2-regularization parameter for training.\", \"L\", 0.0);\nPARAM_STRING(\"optimizer\", \"Optimizer to use for training ('lbfgs' or 'sgd').\",\n    \"O\", \"lbfgs\");\nPARAM_DOUBLE(\"tolerance\", \"Convergence tolerance for optimizer.\", \"e\", 1e-10);\nPARAM_INT(\"max_iterations\", \"Maximum iterations for optimizer (0 indicates no \"\n    \"limit).\", \"n\", 10000);\nPARAM_DOUBLE(\"step_size\", \"Step size for SGD optimizer.\", \"s\", 0.01);\n\n\/\/ Model loading\/saving.\nPARAM_STRING(\"input_model_file\", \"File containing existing model (parameters).\",\n    \"m\", \"\");\nPARAM_STRING(\"output_model_file\", \"File to save trained logistic regression \"\n    \"model to.\", \"M\", \"\");\n\n\/\/ Testing.\nPARAM_STRING(\"test_file\", \"File containing test dataset.\", \"T\", \"\");\nPARAM_STRING(\"output_file\", \"If --test_file is specified, this file is \"\n    \"where the predicted responses will be saved.\", \"o\", \"\");\nPARAM_DOUBLE(\"decision_boundary\", \"Decision boundary for prediction; if the \"\n    \"logistic function for a point is less than the boundary, the class is \"\n    \"taken to be 0; otherwise, the class is 1.\", \"d\", 0.5);\n\nint main(int argc, char** argv)\n{\n  CLI::ParseCommandLine(argc, argv);\n\n  \/\/ Collect command-line options.\n  const string trainingFile = CLI::GetParam<string>(\"training_file\");\n  const string labelsFile = CLI::GetParam<string>(\"labels_file\");\n  const double lambda = CLI::GetParam<double>(\"lambda\");\n  const string optimizerType = CLI::GetParam<string>(\"optimizer\");\n  const double tolerance = CLI::GetParam<double>(\"tolerance\");\n  const double stepSize = CLI::GetParam<double>(\"step_size\");\n  const size_t maxIterations = (size_t) CLI::GetParam<int>(\"max_iterations\");\n  const string inputModelFile = CLI::GetParam<string>(\"input_model_file\");\n  const string outputModelFile = CLI::GetParam<string>(\"output_model_file\");\n  const string testFile = CLI::GetParam<string>(\"test_file\");\n  const string outputFile = CLI::GetParam<string>(\"output_file\");\n  const double decisionBoundary = CLI::GetParam<double>(\"decision_boundary\");\n\n  \/\/ One of inputFile and modelFile must be specified.\n  if (trainingFile.empty() && inputModelFile.empty())\n    Log::Fatal << \"One of --input_model or --training_file must be specified.\"\n        << endl;\n\n  \/\/ If no output file is given, the user should know that the model will not be\n  \/\/ saved, but only if a model is being trained.\n  if (outputModelFile.empty() && !trainingFile.empty())\n    Log::Warn << \"--output_model_file not given; trained model will not be \"\n        << \"saved.\" << endl;\n\n  \/\/ Tolerance needs to be positive.\n  if (tolerance < 0.0)\n    Log::Fatal << \"Tolerance must be positive (received \" << tolerance << \").\"\n        << endl;\n\n  \/\/ Optimizer has to be L-BFGS or SGD.\n  if (optimizerType != \"lbfgs\" && optimizerType != \"sgd\")\n    Log::Fatal << \"--optimizer must be 'lbfgs' or 'sgd'.\" << endl;\n\n  \/\/ Lambda must be positive.\n  if (lambda < 0.0)\n    Log::Fatal << \"L2-regularization parameter (--lambda) must be positive (\"\n        << \"received \" << lambda << \").\" << endl;\n\n  \/\/ Decision boundary must be between 0 and 1.\n  if (decisionBoundary < 0.0 || decisionBoundary > 1.0)\n    Log::Fatal << \"Decision boundary (--decision_boundary) must be between 0.0 \"\n        << \"and 1.0 (received \" << decisionBoundary << \").\" << endl;\n\n  if ((stepSize < 0.0) && (optimizerType == \"sgd\"))\n    Log::Fatal << \"Step size (--step_size) must be positive (received \"\n        << stepSize << \").\" << endl;\n\n  if (CLI::HasParam(\"step_size\") && optimizerType == \"lbfgs\")\n    Log::Warn << \"Step size (--step_size) ignored because 'sgd' optimizer is \"\n        << \"not being used.\" << endl;\n\n  \/\/ These are the matrices we might use.\n  arma::mat regressors;\n  arma::Mat<size_t> responsesMat;\n  arma::Row<size_t> responses;\n  arma::mat testSet;\n  arma::Row<size_t> predictions;\n\n  \/\/ Load data matrix.\n  if (!trainingFile.empty())\n    data::Load(trainingFile, regressors, true);\n\n  \/\/ Load the model, if necessary.\n  LogisticRegression<> model(0, 0); \/\/ Empty model.\n  if (!inputModelFile.empty())\n  {\n    data::Load(inputModelFile, \"logistic_regression_model\", model);\n  }\n  else\n  {\n    \/\/ Set the size of the parameters vector, if necessary.\n    if (labelsFile.empty())\n      model.Parameters() = arma::zeros<arma::vec>(regressors.n_rows - 1);\n    else\n      model.Parameters() = arma::zeros<arma::vec>(regressors.n_rows);\n  }\n\n  \/\/ Check if the responses are in a separate file.\n  if (!trainingFile.empty() && !labelsFile.empty())\n  {\n    data::Load(labelsFile, responsesMat, true);\n    if (responsesMat.n_cols == 1)\n      responses = responsesMat.col(0).t();\n    else\n      responses = responsesMat.row(0);\n\n    if (responses.n_cols != regressors.n_cols)\n      Log::Fatal << \"The labels (--labels_file) must have the same number of \"\n          << \"points as the training dataset (--training_file).\" << endl;\n  }\n  else if (!trainingFile.empty())\n  {\n    \/\/ The initial predictors for y, Nx1.\n    responses = arma::conv_to<arma::Row<size_t>>::from(\n        regressors.row(regressors.n_rows - 1));\n    regressors.shed_row(regressors.n_rows - 1);\n  }\n\n  \/\/ Verify the labels.\n  if (!trainingFile.empty() && max(responses) > 1)\n    Log::Fatal << \"The labels must be either 0 or 1, not \" << max(responses)\n        << \"!\" << endl;\n\n  \/\/ Now, do the training.\n  if (!trainingFile.empty())\n  {\n    LogisticRegressionFunction<> lrf(regressors, responses, model.Parameters());\n    if (optimizerType == \"sgd\")\n    {\n      SGD<LogisticRegressionFunction<>> sgdOpt(lrf);\n      sgdOpt.MaxIterations() = maxIterations;\n      sgdOpt.Tolerance() = tolerance;\n      sgdOpt.StepSize() = stepSize;\n      Log::Info << \"Training model with SGD optimizer.\" << endl;\n\n      \/\/ This will train the model.\n      model.Train(sgdOpt);\n    }\n    else if (optimizerType == \"lbfgs\")\n    {\n      L_BFGS<LogisticRegressionFunction<>> lbfgsOpt(lrf);\n      lbfgsOpt.MaxIterations() = maxIterations;\n      lbfgsOpt.MinGradientNorm() = tolerance;\n      Log::Info << \"Training model with L-BFGS optimizer.\" << endl;\n\n      \/\/ This will train the model.\n      model.Train(lbfgsOpt);\n    }\n  }\n\n  if (!testFile.empty())\n  {\n    data::Load(testFile, testSet, true);\n\n    \/\/ We must perform predictions on the test set.  Training (and the\n    \/\/ optimizer) are irrelevant here; we'll pass in the model we have.\n    Log::Info << \"Predicting classes of points in '\" << testFile << \"'.\"\n        << endl;\n    model.Predict(testSet, predictions, decisionBoundary);\n\n    \/\/ Save the results, if necessary.\n    if (!outputFile.empty())\n      data::Save(outputFile, predictions, false);\n  }\n\n  if (!outputModelFile.empty())\n  {\n    Log::Info << \"Saving model to '\" << outputModelFile << \"'.\" << endl;\n    data::Save(outputModelFile, \"logistic_regression_model\", model, false);\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 \"itemlibrarymodel.h\"\n#include \"itemlibraryinfo.h\"\n#include <model.h>\n#include <nodemetainfo.h>\n\n#include <QVariant>\n#include <QMimeData>\n#include <QPainter>\n#include <QPen>\n#include <qdebug.h>\n\n\nnamespace QmlDesigner {\n\nnamespace Internal {\n\n\ntemplate <class T>\nItemLibrarySortedModel<T>::ItemLibrarySortedModel(QObject *parent) :\n    QDeclarativeListModel(parent)\n{\n}\n\n\ntemplate <class T>\nItemLibrarySortedModel<T>::~ItemLibrarySortedModel()\n{\n    clearElements();\n}\n\n\ntemplate <class T>\nvoid ItemLibrarySortedModel<T>::clearElements()\n{\n    while (m_elementOrder.count() > 0)\n        removeElement(m_elementOrder.at(0).libId);\n}\n\n\ntemplate <class T>\nvoid ItemLibrarySortedModel<T>::addElement(T *element, int libId)\n{\n    struct order_struct orderEntry;\n    orderEntry.libId = libId;\n    orderEntry.visible = false;\n\n    int pos = 0;\n    while ((pos < m_elementOrder.count()) &&\n           (*(m_elementModels.value(m_elementOrder.at(pos).libId)) < *element))\n        ++pos;\n\n    m_elementModels.insert(libId, element);\n    m_elementOrder.insert(pos, orderEntry);\n\n    setElementVisible(libId, true);\n}\n\ntemplate <class T>\nvoid ItemLibrarySortedModel<T>::removeElement(int libId)\n{\n    T *element = m_elementModels.value(libId);\n    int pos = findElement(libId);\n\n    setElementVisible(libId, false);\n\n    m_elementModels.remove(libId);\n    m_elementOrder.removeAt(pos);\n\n    delete element;\n}\n\n\ntemplate <class T>\nbool ItemLibrarySortedModel<T>::elementVisible(int libId) const\n{\n    int pos = findElement(libId);\n    return m_elementOrder.at(pos).visible;\n}\n\n\ntemplate <class T>\nbool ItemLibrarySortedModel<T>::setElementVisible(int libId, bool visible)\n{\n    int pos = findElement(libId);\n    if (m_elementOrder.at(pos).visible == visible)\n        return false;\n\n    int visiblePos = visibleElementPosition(libId);\n    if (visible)\n        insert(visiblePos, *(m_elementModels.value(libId)));\n    else\n        remove(visiblePos);\n\n    m_elementOrder[pos].visible = visible;\n    return true;\n}\n\n\ntemplate <class T>\nconst QMap<int, T *> &ItemLibrarySortedModel<T>::elements() const\n{\n    return m_elementModels;\n}\n\n\ntemplate <class T>\nT *ItemLibrarySortedModel<T>::elementModel(int libId)\n{\n    return m_elementModels.value(libId);\n}\n\n\ntemplate <class T>\nint ItemLibrarySortedModel<T>::findElement(int libId) const\n{\n    int i = 0;\n    QListIterator<struct order_struct> it(m_elementOrder);\n\n    while (it.hasNext()) {\n        if (it.next().libId == libId)\n            return i;\n        ++i;\n    }\n\n    return -1;\n}\n\ntemplate <class T>\nint ItemLibrarySortedModel<T>::visibleElementPosition(int libId) const\n{\n    int i = 0;\n    QListIterator<struct order_struct> it(m_elementOrder);\n\n    while (it.hasNext()) {\n        struct order_struct order = it.next();\n        if (order.libId == libId)\n            return i;\n        if (order.visible)\n            ++i;\n    }\n\n    return -1;\n}\n\n\n\nItemLibraryItemModel::ItemLibraryItemModel(QScriptEngine *scriptEngine, int itemLibId, const QString &itemName)\n    : QScriptValue(scriptEngine->newObject()),\n      m_scriptEngine(scriptEngine),\n      m_libId(itemLibId),\n      m_name(itemName),\n      m_iconSize(64, 64)\n{\n    QScriptValue pixmapScriptValue(m_scriptEngine->newVariant(QPixmap()));\n\n    setProperty(QLatin1String(\"itemLibId\"), itemLibId);\n    setProperty(QLatin1String(\"itemName\"), itemName);\n    setProperty(QLatin1String(\"itemPixmap\"), pixmapScriptValue);\n}\n\n\nItemLibraryItemModel::~ItemLibraryItemModel()\n{\n    setProperty(QLatin1String(\"itemPixmap\"), QVariant::Invalid);\n}\n\n\nint ItemLibraryItemModel::itemLibId() const\n{\n    return m_libId;\n}\n\n\nQString ItemLibraryItemModel::itemName() const\n{\n    return m_name;\n}\n\nvoid ItemLibraryItemModel::setItemIconPath(const QString &iconPath)\n{\n    m_iconPath = iconPath;\n\n    setProperty(QLatin1String(\"itemLibraryIconPath\"),\n                QString(QLatin1String(\"image:\/\/qmldesigner_itemlibrary\/\") + iconPath));\n}\n\nvoid ItemLibraryItemModel::setItemIconSize(const QSize &itemIconSize)\n{\n    m_iconSize = itemIconSize;\n\/\/    qDebug() << \"set icon size\" << itemIconSize;\n    setItemIconPath(m_iconPath);\n}\n\n\nbool ItemLibraryItemModel::operator<(const ItemLibraryItemModel &other) const\n{\n    return itemName() < other.itemName();\n}\n\n\n\n\nItemLibrarySectionModel::ItemLibrarySectionModel(QScriptEngine *scriptEngine, int sectionLibId, const QString &sectionName, QObject *parent)\n    : QScriptValue(scriptEngine->newObject()),\n      m_name(sectionName),\n      m_sectionEntries(parent)\n{\n    QScriptValue::setProperty(QLatin1String(\"sectionLibId\"), sectionLibId);\n    QScriptValue::setProperty(QLatin1String(\"sectionName\"), sectionName);\n    QScriptValue::setProperty(QLatin1String(\"sectionEntries\"),\n        scriptEngine->newVariant(QVariant::fromValue(static_cast<QDeclarativeListModel *>(&m_sectionEntries))));\n}\n\n\nQString ItemLibrarySectionModel::sectionName() const\n{\n    return m_name;\n}\n\n\nvoid ItemLibrarySectionModel::addSectionEntry(ItemLibraryItemModel *sectionEntry)\n{\n    m_sectionEntries.addElement(sectionEntry, sectionEntry->itemLibId());\n}\n\n\nvoid ItemLibrarySectionModel::removeSectionEntry(int itemLibId)\n{\n    m_sectionEntries.removeElement(itemLibId);\n}\n\n\nint ItemLibrarySectionModel::visibleItemIndex(int itemLibId)\n{\n    return m_sectionEntries.visibleElementPosition(itemLibId);\n}\n\n\nbool ItemLibrarySectionModel::isItemVisible(int itemLibId)\n{\n    return m_sectionEntries.elementVisible(itemLibId);\n}\n\n\nbool ItemLibrarySectionModel::updateSectionVisibility(const QString &searchText, bool *changed)\n{\n    bool haveVisibleItems = false;\n\n    *changed = false;\n\n    QMap<int, ItemLibraryItemModel *>::const_iterator itemIt = m_sectionEntries.elements().constBegin();\n    while (itemIt != m_sectionEntries.elements().constEnd()) {\n\n        bool itemVisible = itemIt.value()->itemName().toLower().contains(searchText),\n            itemChanged = false;\n        itemChanged = m_sectionEntries.setElementVisible(itemIt.key(), itemVisible);\n\n        *changed |= itemChanged;\n\n        if (itemVisible)\n            haveVisibleItems = true;\n\n        ++itemIt;\n    }\n\n    return haveVisibleItems;\n}\n\n\nvoid ItemLibrarySectionModel::updateItemIconSize(const QSize &itemIconSize)\n{\n    foreach (ItemLibraryItemModel *item, m_sectionEntries.elements()) {\n        item->setItemIconSize(itemIconSize);\n    }\n}\n\nbool ItemLibrarySectionModel::operator<(const ItemLibrarySectionModel &other) const\n{\n    if (sectionName() == QLatin1String(\"QML Components\")) \/\/Qml Components always come first\n        return true;\n    return sectionName() < other.sectionName();\n}\n\nItemLibraryModel::ItemLibraryModel(QScriptEngine *scriptEngine, QObject *parent)\n    : ItemLibrarySortedModel<ItemLibrarySectionModel>(parent),\n      m_scriptEngine(scriptEngine),\n      m_searchText(\"\"),\n      m_itemIconSize(64, 64),\n      m_nextLibId(0)\n{\n}\n\n\nItemLibraryModel::~ItemLibraryModel()\n{\n}\n\n\nQString ItemLibraryModel::searchText() const\n{\n    return m_searchText;\n}\n\n\nvoid ItemLibraryModel::setSearchText(const QString &searchText)\n{\n    QString lowerSearchText = searchText.toLower();\n\n    if (m_searchText != lowerSearchText) {\n        m_searchText = lowerSearchText;\n        emit searchTextChanged();\n\n        updateVisibility();\n    }\n}\n\n\nvoid ItemLibraryModel::setItemIconSize(const QSize &itemIconSize)\n{\n    m_itemIconSize = itemIconSize;\n\n    foreach (ItemLibrarySectionModel *section, elements().values())\n        section->updateItemIconSize(itemIconSize);\n}\n\n\nint ItemLibraryModel::getItemSectionIndex(int itemLibId)\n{\n    if (m_sections.contains(itemLibId))\n        return elementModel(m_sections.value(itemLibId))->visibleItemIndex(itemLibId);\n    else\n        return -1;\n}\n\n\nint ItemLibraryModel::getSectionLibId(int itemLibId)\n{\n    return m_sections.value(itemLibId);\n}\n\n\nbool ItemLibraryModel::isItemVisible(int itemLibId)\n{\n    if (!m_sections.contains(itemLibId))\n        return false;\n\n    int sectionLibId = m_sections.value(itemLibId);\n    if (!elementVisible(sectionLibId))\n        return false;\n\n    return elementModel(sectionLibId)->isItemVisible(itemLibId);\n}\n\nImport entryToImport(const ItemLibraryEntry &entry)\n{\n    if (entry.majorVersion() == -1 && entry.minorVersion() == -1)\n        return Import::createFileImport(entry.requiredImport());\n\n    return Import::createLibraryImport(entry.requiredImport(), QString::number(entry.majorVersion()) + QLatin1Char('.') +\n                                                               QString::number(entry.minorVersion()));\n\n}\n\nvoid ItemLibraryModel::update(ItemLibraryInfo *itemLibraryInfo, Model *model)\n{\n    QMap<QString, int> sections;\n\n    clearElements();\n    m_itemInfos.clear();\n    m_sections.clear();\n    m_nextLibId = 0;\n\n    QStringList imports;\n    foreach (const Import &import, model->imports())\n        if (import.isLibraryImport())\n            imports << import.url() + QLatin1Char(' ') + import.version();\n\n    foreach (ItemLibraryEntry entry, itemLibraryInfo->entries()) {\n\n         NodeMetaInfo metaInfo = model->metaInfo(entry.typeName(), -1, -1);\n         bool valid = metaInfo.isValid() && metaInfo.majorVersion() == entry.majorVersion();\n\n         if ((valid || entry.forceImport())\n                 && (entry.requiredImport().isEmpty()\n                     || model->hasImport(entryToImport(entry), true, false) || entry.forceImport())) {\n            QString itemSectionName = entry.category();\n            ItemLibrarySectionModel *sectionModel;\n            ItemLibraryItemModel *itemModel;\n            int itemId = m_nextLibId++, sectionId;\n\n            if (sections.contains(itemSectionName)) {\n                sectionId = sections.value(itemSectionName);\n                sectionModel = elementModel(sectionId);\n            } else {\n                sectionId = m_nextLibId++;\n                sectionModel = new ItemLibrarySectionModel(m_scriptEngine.data(), sectionId, itemSectionName, this);\n                addElement(sectionModel, sectionId);\n                sections.insert(itemSectionName, sectionId);\n            }\n\n            m_itemInfos.insert(itemId, entry);\n\n            itemModel = new ItemLibraryItemModel(m_scriptEngine.data(), itemId, entry.name());\n\n            \/\/ delayed creation of (default) icons\n            if (entry.iconPath().isEmpty())\n                entry.setIconPath(QLatin1String(\":\/ItemLibrary\/images\/item-default-icon.png\"));\n            if (entry.dragIcon().isNull())\n                entry.setDragIcon(createDragPixmap(getWidth(entry), getHeight(entry)));\n\n            itemModel->setItemIconPath(entry.iconPath());\n            itemModel->setItemIconSize(m_itemIconSize);\n            sectionModel->addSectionEntry(itemModel);\n            m_sections.insert(itemId, sectionId);\n        }\n    }\n\n    updateVisibility();\n}\n\n\nQString ItemLibraryModel::getTypeName(int libId)\n{\n    return m_itemInfos.value(libId).typeName();\n}\n\n\nQMimeData *ItemLibraryModel::getMimeData(int libId)\n{\n    QMimeData *mimeData = new QMimeData();\n\n    QByteArray data;\n    QDataStream stream(&data, QIODevice::WriteOnly);\n    stream << m_itemInfos.value(libId);\n    mimeData->setData(QLatin1String(\"application\/vnd.bauhaus.itemlibraryinfo\"), data);\n\n    const QIcon icon = m_itemInfos.value(libId).dragIcon();\n    if (!icon.isNull()) {\n        const QList<QSize> sizes = icon.availableSizes();\n        if (!sizes.isEmpty())\n            mimeData->setImageData(icon.pixmap(sizes.front()).toImage());\n    }\n\n    mimeData->removeFormat(QLatin1String(\"text\/plain\"));\n\n    return mimeData;\n}\n\n\nQIcon ItemLibraryModel::getIcon(int libId)\n{\n    return m_itemInfos.value(libId).icon();\n}\n\n\nvoid ItemLibraryModel::updateVisibility()\n{\n    bool changed = false;\n\n    QMap<int, ItemLibrarySectionModel *>::const_iterator sectionIt = elements().constBegin();\n    while (sectionIt != elements().constEnd()) {\n\n        ItemLibrarySectionModel *sectionModel = sectionIt.value();\n        QString sectionSearchText = m_searchText;\n\n        if (sectionModel->sectionName().toLower().contains(m_searchText))\n            sectionSearchText = \"\";\n\n        bool sectionChanged = false,\n            sectionVisibility = sectionModel->updateSectionVisibility(sectionSearchText,\n                                                                      &sectionChanged);\n        if (sectionChanged) {\n            changed = true;\n            if (sectionVisibility)\n                emit sectionVisibilityChanged(sectionIt.key());\n        }\n\n        changed |= setElementVisible(sectionIt.key(), sectionVisibility);\n        ++sectionIt;\n    }\n\n    if (changed)\n        emit visibilityChanged();\n}\n\nint ItemLibraryModel::getWidth(const ItemLibraryEntry &itemLibraryEntry)\n{\n    foreach (const ItemLibraryEntry::Property &property, itemLibraryEntry.properties())\n    {\n        if (property.name() == QLatin1String(\"width\"))\n            return property.value().toInt();\n    }\n    return 64;\n}\n\nint ItemLibraryModel::getHeight(const ItemLibraryEntry &itemLibraryEntry)\n{\n    foreach (const ItemLibraryEntry::Property &property, itemLibraryEntry.properties())\n    {\n        if (property.name() == QLatin1String(\"height\"))\n            return property.value().toInt();\n    }\n    return 64;\n}\n\nQPixmap ItemLibraryModel::createDragPixmap(int , int )\n{\n    QImage dragImage(10, 10, QImage::Format_ARGB32); \/\/ TODO: draw item drag icon\n    dragImage.fill(0x00ffffff); \/\/### todo for now we disable the preview image\n    QPainter p(&dragImage);\n    QPen pen(Qt::gray);\n\/\/    pen.setWidth(2);\n\/\/    p.setPen(pen);\n\/\/    p.drawRect(1, 1, dragImage.width() - 2, dragImage.height() - 2);\n    return QPixmap::fromImage(dragImage);\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace QmlDesigner\n\n<commit_msg>QmlDesigner.itemLibary: crash fix<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 \"itemlibrarymodel.h\"\n#include \"itemlibraryinfo.h\"\n#include <model.h>\n#include <nodemetainfo.h>\n\n#include <QVariant>\n#include <QMimeData>\n#include <QPainter>\n#include <QPen>\n#include <qdebug.h>\n\n\nnamespace QmlDesigner {\n\nnamespace Internal {\n\n\ntemplate <class T>\nItemLibrarySortedModel<T>::ItemLibrarySortedModel(QObject *parent) :\n    QDeclarativeListModel(parent)\n{\n}\n\n\ntemplate <class T>\nItemLibrarySortedModel<T>::~ItemLibrarySortedModel()\n{\n    clearElements();\n}\n\n\ntemplate <class T>\nvoid ItemLibrarySortedModel<T>::clearElements()\n{\n    while (m_elementOrder.count() > 0)\n        removeElement(m_elementOrder.at(0).libId);\n}\n\n\ntemplate <class T>\nvoid ItemLibrarySortedModel<T>::addElement(T *element, int libId)\n{\n    struct order_struct orderEntry;\n    orderEntry.libId = libId;\n    orderEntry.visible = false;\n\n    int pos = 0;\n    while ((pos < m_elementOrder.count()) &&\n           (*(m_elementModels.value(m_elementOrder.at(pos).libId)) < *element))\n        ++pos;\n\n    m_elementModels.insert(libId, element);\n    m_elementOrder.insert(pos, orderEntry);\n\n    setElementVisible(libId, true);\n}\n\ntemplate <class T>\nvoid ItemLibrarySortedModel<T>::removeElement(int libId)\n{\n    T *element = m_elementModels.value(libId);\n    int pos = findElement(libId);\n\n    setElementVisible(libId, false);\n\n    m_elementModels.remove(libId);\n    m_elementOrder.removeAt(pos);\n\n    delete element;\n}\n\n\ntemplate <class T>\nbool ItemLibrarySortedModel<T>::elementVisible(int libId) const\n{\n    int pos = findElement(libId);\n    return m_elementOrder.at(pos).visible;\n}\n\n\ntemplate <class T>\nbool ItemLibrarySortedModel<T>::setElementVisible(int libId, bool visible)\n{\n    int pos = findElement(libId);\n    if (m_elementOrder.at(pos).visible == visible)\n        return false;\n\n    int visiblePos = visibleElementPosition(libId);\n    if (visible)\n        insert(visiblePos, *(m_elementModels.value(libId)));\n    else\n        remove(visiblePos);\n\n    m_elementOrder[pos].visible = visible;\n    return true;\n}\n\n\ntemplate <class T>\nconst QMap<int, T *> &ItemLibrarySortedModel<T>::elements() const\n{\n    return m_elementModels;\n}\n\n\ntemplate <class T>\nT *ItemLibrarySortedModel<T>::elementModel(int libId)\n{\n    return m_elementModels.value(libId);\n}\n\n\ntemplate <class T>\nint ItemLibrarySortedModel<T>::findElement(int libId) const\n{\n    int i = 0;\n    QListIterator<struct order_struct> it(m_elementOrder);\n\n    while (it.hasNext()) {\n        if (it.next().libId == libId)\n            return i;\n        ++i;\n    }\n\n    return -1;\n}\n\ntemplate <class T>\nint ItemLibrarySortedModel<T>::visibleElementPosition(int libId) const\n{\n    int i = 0;\n    QListIterator<struct order_struct> it(m_elementOrder);\n\n    while (it.hasNext()) {\n        struct order_struct order = it.next();\n        if (order.libId == libId)\n            return i;\n        if (order.visible)\n            ++i;\n    }\n\n    return -1;\n}\n\n\n\nItemLibraryItemModel::ItemLibraryItemModel(QScriptEngine *scriptEngine, int itemLibId, const QString &itemName)\n    : QScriptValue(scriptEngine->newObject()),\n      m_scriptEngine(scriptEngine),\n      m_libId(itemLibId),\n      m_name(itemName),\n      m_iconSize(64, 64)\n{\n    QScriptValue pixmapScriptValue(m_scriptEngine->newVariant(QPixmap()));\n\n    setProperty(QLatin1String(\"itemLibId\"), itemLibId);\n    setProperty(QLatin1String(\"itemName\"), itemName);\n    setProperty(QLatin1String(\"itemPixmap\"), pixmapScriptValue);\n}\n\n\nItemLibraryItemModel::~ItemLibraryItemModel()\n{\n    setProperty(QLatin1String(\"itemPixmap\"), QVariant::Invalid);\n}\n\n\nint ItemLibraryItemModel::itemLibId() const\n{\n    return m_libId;\n}\n\n\nQString ItemLibraryItemModel::itemName() const\n{\n    return m_name;\n}\n\nvoid ItemLibraryItemModel::setItemIconPath(const QString &iconPath)\n{\n    m_iconPath = iconPath;\n\n    setProperty(QLatin1String(\"itemLibraryIconPath\"),\n                QString(QLatin1String(\"image:\/\/qmldesigner_itemlibrary\/\") + iconPath));\n}\n\nvoid ItemLibraryItemModel::setItemIconSize(const QSize &itemIconSize)\n{\n    m_iconSize = itemIconSize;\n\/\/    qDebug() << \"set icon size\" << itemIconSize;\n    setItemIconPath(m_iconPath);\n}\n\n\nbool ItemLibraryItemModel::operator<(const ItemLibraryItemModel &other) const\n{\n    return itemName() < other.itemName();\n}\n\n\n\n\nItemLibrarySectionModel::ItemLibrarySectionModel(QScriptEngine *scriptEngine, int sectionLibId, const QString &sectionName, QObject *parent)\n    : QScriptValue(scriptEngine->newObject()),\n      m_name(sectionName),\n      m_sectionEntries(parent)\n{\n    QScriptValue::setProperty(QLatin1String(\"sectionLibId\"), sectionLibId);\n    QScriptValue::setProperty(QLatin1String(\"sectionName\"), sectionName);\n    QScriptValue::setProperty(QLatin1String(\"sectionEntries\"),\n        scriptEngine->newVariant(QVariant::fromValue(static_cast<QDeclarativeListModel *>(&m_sectionEntries))));\n}\n\n\nQString ItemLibrarySectionModel::sectionName() const\n{\n    return m_name;\n}\n\n\nvoid ItemLibrarySectionModel::addSectionEntry(ItemLibraryItemModel *sectionEntry)\n{\n    m_sectionEntries.addElement(sectionEntry, sectionEntry->itemLibId());\n}\n\n\nvoid ItemLibrarySectionModel::removeSectionEntry(int itemLibId)\n{\n    m_sectionEntries.removeElement(itemLibId);\n}\n\n\nint ItemLibrarySectionModel::visibleItemIndex(int itemLibId)\n{\n    return m_sectionEntries.visibleElementPosition(itemLibId);\n}\n\n\nbool ItemLibrarySectionModel::isItemVisible(int itemLibId)\n{\n    return m_sectionEntries.elementVisible(itemLibId);\n}\n\n\nbool ItemLibrarySectionModel::updateSectionVisibility(const QString &searchText, bool *changed)\n{\n    bool haveVisibleItems = false;\n\n    *changed = false;\n\n    QMap<int, ItemLibraryItemModel *>::const_iterator itemIt = m_sectionEntries.elements().constBegin();\n    while (itemIt != m_sectionEntries.elements().constEnd()) {\n\n        bool itemVisible = itemIt.value()->itemName().toLower().contains(searchText),\n            itemChanged = false;\n        itemChanged = m_sectionEntries.setElementVisible(itemIt.key(), itemVisible);\n\n        *changed |= itemChanged;\n\n        if (itemVisible)\n            haveVisibleItems = true;\n\n        ++itemIt;\n    }\n\n    return haveVisibleItems;\n}\n\n\nvoid ItemLibrarySectionModel::updateItemIconSize(const QSize &itemIconSize)\n{\n    foreach (ItemLibraryItemModel *item, m_sectionEntries.elements()) {\n        item->setItemIconSize(itemIconSize);\n    }\n}\n\nbool ItemLibrarySectionModel::operator<(const ItemLibrarySectionModel &other) const\n{\n    if (sectionName() == QLatin1String(\"QML Components\")) \/\/Qml Components always come first\n        return true;\n    return sectionName() < other.sectionName();\n}\n\nItemLibraryModel::ItemLibraryModel(QScriptEngine *scriptEngine, QObject *parent)\n    : ItemLibrarySortedModel<ItemLibrarySectionModel>(parent),\n      m_scriptEngine(scriptEngine),\n      m_searchText(\"\"),\n      m_itemIconSize(64, 64),\n      m_nextLibId(0)\n{\n}\n\n\nItemLibraryModel::~ItemLibraryModel()\n{\n}\n\n\nQString ItemLibraryModel::searchText() const\n{\n    return m_searchText;\n}\n\n\nvoid ItemLibraryModel::setSearchText(const QString &searchText)\n{\n    QString lowerSearchText = searchText.toLower();\n\n    if (m_searchText != lowerSearchText) {\n        m_searchText = lowerSearchText;\n        emit searchTextChanged();\n\n        updateVisibility();\n    }\n}\n\n\nvoid ItemLibraryModel::setItemIconSize(const QSize &itemIconSize)\n{\n    m_itemIconSize = itemIconSize;\n\n    foreach (ItemLibrarySectionModel *section, elements().values())\n        section->updateItemIconSize(itemIconSize);\n}\n\n\nint ItemLibraryModel::getItemSectionIndex(int itemLibId)\n{\n    if (m_sections.contains(itemLibId))\n        return elementModel(m_sections.value(itemLibId))->visibleItemIndex(itemLibId);\n    else\n        return -1;\n}\n\n\nint ItemLibraryModel::getSectionLibId(int itemLibId)\n{\n    return m_sections.value(itemLibId);\n}\n\n\nbool ItemLibraryModel::isItemVisible(int itemLibId)\n{\n    if (!m_sections.contains(itemLibId))\n        return false;\n\n    int sectionLibId = m_sections.value(itemLibId);\n    if (!elementVisible(sectionLibId))\n        return false;\n\n    return elementModel(sectionLibId)->isItemVisible(itemLibId);\n}\n\nImport entryToImport(const ItemLibraryEntry &entry)\n{\n    if (entry.majorVersion() == -1 && entry.minorVersion() == -1)\n        return Import::createFileImport(entry.requiredImport());\n\n    return Import::createLibraryImport(entry.requiredImport(), QString::number(entry.majorVersion()) + QLatin1Char('.') +\n                                                               QString::number(entry.minorVersion()));\n\n}\n\nvoid ItemLibraryModel::update(ItemLibraryInfo *itemLibraryInfo, Model *model)\n{\n    if (!model)\n        return;\n\n    QMap<QString, int> sections;\n\n    clearElements();\n    m_itemInfos.clear();\n    m_sections.clear();\n    m_nextLibId = 0;\n\n    QStringList imports;\n    foreach (const Import &import, model->imports())\n        if (import.isLibraryImport())\n            imports << import.url() + QLatin1Char(' ') + import.version();\n\n    foreach (ItemLibraryEntry entry, itemLibraryInfo->entries()) {\n\n         NodeMetaInfo metaInfo = model->metaInfo(entry.typeName(), -1, -1);\n         bool valid = metaInfo.isValid() && metaInfo.majorVersion() == entry.majorVersion();\n\n         if ((valid || entry.forceImport())\n                 && (entry.requiredImport().isEmpty()\n                     || model->hasImport(entryToImport(entry), true, false) || entry.forceImport())) {\n            QString itemSectionName = entry.category();\n            ItemLibrarySectionModel *sectionModel;\n            ItemLibraryItemModel *itemModel;\n            int itemId = m_nextLibId++, sectionId;\n\n            if (sections.contains(itemSectionName)) {\n                sectionId = sections.value(itemSectionName);\n                sectionModel = elementModel(sectionId);\n            } else {\n                sectionId = m_nextLibId++;\n                sectionModel = new ItemLibrarySectionModel(m_scriptEngine.data(), sectionId, itemSectionName, this);\n                addElement(sectionModel, sectionId);\n                sections.insert(itemSectionName, sectionId);\n            }\n\n            m_itemInfos.insert(itemId, entry);\n\n            itemModel = new ItemLibraryItemModel(m_scriptEngine.data(), itemId, entry.name());\n\n            \/\/ delayed creation of (default) icons\n            if (entry.iconPath().isEmpty())\n                entry.setIconPath(QLatin1String(\":\/ItemLibrary\/images\/item-default-icon.png\"));\n            if (entry.dragIcon().isNull())\n                entry.setDragIcon(createDragPixmap(getWidth(entry), getHeight(entry)));\n\n            itemModel->setItemIconPath(entry.iconPath());\n            itemModel->setItemIconSize(m_itemIconSize);\n            sectionModel->addSectionEntry(itemModel);\n            m_sections.insert(itemId, sectionId);\n        }\n    }\n\n    updateVisibility();\n}\n\n\nQString ItemLibraryModel::getTypeName(int libId)\n{\n    return m_itemInfos.value(libId).typeName();\n}\n\n\nQMimeData *ItemLibraryModel::getMimeData(int libId)\n{\n    QMimeData *mimeData = new QMimeData();\n\n    QByteArray data;\n    QDataStream stream(&data, QIODevice::WriteOnly);\n    stream << m_itemInfos.value(libId);\n    mimeData->setData(QLatin1String(\"application\/vnd.bauhaus.itemlibraryinfo\"), data);\n\n    const QIcon icon = m_itemInfos.value(libId).dragIcon();\n    if (!icon.isNull()) {\n        const QList<QSize> sizes = icon.availableSizes();\n        if (!sizes.isEmpty())\n            mimeData->setImageData(icon.pixmap(sizes.front()).toImage());\n    }\n\n    mimeData->removeFormat(QLatin1String(\"text\/plain\"));\n\n    return mimeData;\n}\n\n\nQIcon ItemLibraryModel::getIcon(int libId)\n{\n    return m_itemInfos.value(libId).icon();\n}\n\n\nvoid ItemLibraryModel::updateVisibility()\n{\n    bool changed = false;\n\n    QMap<int, ItemLibrarySectionModel *>::const_iterator sectionIt = elements().constBegin();\n    while (sectionIt != elements().constEnd()) {\n\n        ItemLibrarySectionModel *sectionModel = sectionIt.value();\n        QString sectionSearchText = m_searchText;\n\n        if (sectionModel->sectionName().toLower().contains(m_searchText))\n            sectionSearchText = \"\";\n\n        bool sectionChanged = false,\n            sectionVisibility = sectionModel->updateSectionVisibility(sectionSearchText,\n                                                                      &sectionChanged);\n        if (sectionChanged) {\n            changed = true;\n            if (sectionVisibility)\n                emit sectionVisibilityChanged(sectionIt.key());\n        }\n\n        changed |= setElementVisible(sectionIt.key(), sectionVisibility);\n        ++sectionIt;\n    }\n\n    if (changed)\n        emit visibilityChanged();\n}\n\nint ItemLibraryModel::getWidth(const ItemLibraryEntry &itemLibraryEntry)\n{\n    foreach (const ItemLibraryEntry::Property &property, itemLibraryEntry.properties())\n    {\n        if (property.name() == QLatin1String(\"width\"))\n            return property.value().toInt();\n    }\n    return 64;\n}\n\nint ItemLibraryModel::getHeight(const ItemLibraryEntry &itemLibraryEntry)\n{\n    foreach (const ItemLibraryEntry::Property &property, itemLibraryEntry.properties())\n    {\n        if (property.name() == QLatin1String(\"height\"))\n            return property.value().toInt();\n    }\n    return 64;\n}\n\nQPixmap ItemLibraryModel::createDragPixmap(int , int )\n{\n    QImage dragImage(10, 10, QImage::Format_ARGB32); \/\/ TODO: draw item drag icon\n    dragImage.fill(0x00ffffff); \/\/### todo for now we disable the preview image\n    QPainter p(&dragImage);\n    QPen pen(Qt::gray);\n\/\/    pen.setWidth(2);\n\/\/    p.setPen(pen);\n\/\/    p.drawRect(1, 1, dragImage.width() - 2, dragImage.height() - 2);\n    return QPixmap::fromImage(dragImage);\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace QmlDesigner\n\n<|endoftext|>"}
{"text":"<commit_before>#define _IRR_STATIC_LIB_\n#include <irrlicht.h>\n\n#include \"..\/..\/ext\/ScreenShot\/ScreenShot.h\"\n\n#include \"..\/common\/QToQuitEventReceiver.h\"\n\n#include \"..\/3rdparty\/portable-file-dialogs\/portable-file-dialogs.h\"\n#include \"..\/..\/ext\/MitsubaLoader\/CMitsubaLoader.h\"\n\n#include \".\/dirty_source\/ExtraCrap.h\"\n\n\nusing namespace irr;\nusing namespace core;\n\nint main()\n{\n\t\/\/ create device with full flexibility over creation parameters\n\t\/\/ you can add more parameters if desired, check irr::SIrrlichtCreationParameters\n\tirr::SIrrlichtCreationParameters params;\n\tparams.Bits = 24; \/\/may have to set to 32bit for some platforms\n\tparams.ZBufferBits = 24;\n\tparams.DriverType = video::EDT_OPENGL;\n\tparams.Fullscreen = false;\n\tparams.Vsync = false;\n\tparams.Doublebuffer = true;\n\tparams.Stencilbuffer = false; \/\/! This will not even be a choice soon\n\tparams.WindowSize = dimension2d<uint32_t>(1600, 900);\n\tIrrlichtDevice* device = createDeviceEx(params);\n\tif (device == 0)\n\t\treturn 1; \/\/ could not create selected driver.\n\n\t\/\/\n\tasset::SAssetBundle meshes;\n\tcore::smart_refctd_ptr<ext::MitsubaLoader::CGlobalMitsubaMetadata> globalMeta;\n\t{\n\t\tio::IFileSystem* fs = device->getFileSystem();\n\t\tasset::IAssetManager* am = device->getAssetManager();\n\n\t\tam->addAssetLoader(core::make_smart_refctd_ptr<irr::ext::MitsubaLoader::CSerializedLoader>(am));\n\t\tam->addAssetLoader(core::make_smart_refctd_ptr<irr::ext::MitsubaLoader::CMitsubaLoader>(am));\n\n\t\tstd::string filePath = \"..\/..\/media\/mitsuba\/daily_pt.xml\";\n\t\/\/#define MITSUBA_LOADER_TESTS\n\t#ifndef MITSUBA_LOADER_TESTS\n\t\tpfd::message(\"Choose file to load\", \"Choose mitsuba XML file to load or ZIP containing an XML. \\nIf you cancel or choosen file fails to load, simple scene will be loaded.\", pfd::choice::ok);\n\t\tpfd::open_file file(\"Choose XML or ZIP file\", \"..\/..\/media\/mitsuba\", { \"ZIP files (.zip)\", \"*.zip\", \"XML files (.xml)\", \"*.xml\"});\n\t\tif (!file.result().empty())\n\t\t\tfilePath = file.result()[0];\n\t#endif\n\t\tif (core::hasFileExtension(io::path(filePath.c_str()), \"zip\", \"ZIP\"))\n\t\t{\n\t\t\tio::IFileArchive* arch = nullptr;\n\t\t\tdevice->getFileSystem()->addFileArchive(filePath.c_str(),io::EFAT_ZIP,\"\",&arch);\n\t\t\tif (arch)\n\t\t\t{\n\t\t\t\tauto flist = arch->getFileList();\n\t\t\t\tif (!flist)\n\t\t\t\t\treturn 3;\n\t\t\t\tauto files = flist->getFiles();\n\n\t\t\t\tfor (auto it=files.begin(); it!=files.end(); )\n\t\t\t\t{\n\t\t\t\t\tif (core::hasFileExtension(it->FullName, \"xml\", \"XML\"))\n\t\t\t\t\t\tit++;\n\t\t\t\t\telse\n\t\t\t\t\t\tit = files.erase(it);\n\t\t\t\t}\n\t\t\t\tif (files.size() == 0u)\n\t\t\t\t\treturn 4;\n\n\t\t\t\tstd::cout << \"Choose File (0-\" << files.size() - 1ull << \"):\" << std::endl;\n\t\t\t\tfor (auto i = 0u; i < files.size(); i++)\n\t\t\t\t\tstd::cout << i << \": \" << files[i].FullName.c_str() << std::endl;\n\t\t\t\tuint32_t chosen = 0;\n\t\t#ifndef MITSUBA_LOADER_TESTS\n\t\t\t\tstd::cin >> chosen;\n\t\t#endif\n\t\t\t\tif (chosen >= files.size())\n\t\t\t\t\tchosen = 0u;\n\n\t\t\t\tfilePath = files[chosen].FullName.c_str();\n\t\t\t}\n\t\t}\n\n\t\t\/\/! read cache results -- speeds up mesh generation\n\t\t{\n\t\t\tio::IReadFile* cacheFile = device->getFileSystem()->createAndOpenFile(\"..\/..\/tmp\/normalCache101010.sse\");\n\t\t\tif (cacheFile)\n\t\t\t{\n\t\t\t\tasset::normalCacheFor2_10_10_10Quant.resize(cacheFile->getSize() \/ sizeof(asset::QuantizationCacheEntry2_10_10_10));\n\t\t\t\tcacheFile->read(asset::normalCacheFor2_10_10_10Quant.data(), cacheFile->getSize());\n\t\t\t\tcacheFile->drop();\n\n\t\t\t\t\/\/make sure its still ok\n\t\t\t\tstd::sort(asset::normalCacheFor2_10_10_10Quant.begin(), asset::normalCacheFor2_10_10_10Quant.end());\n\t\t\t}\n\t\t}\n\t\t\/\/! load the mitsuba scene\n\t\tmeshes = am->getAsset(filePath, {});\n\t\t\/\/! cache results -- speeds up mesh generation on second run\n\t\t{\n\t\t\tio::IWriteFile* cacheFile = device->getFileSystem()->createAndWriteFile(\"..\/..\/tmp\/normalCache101010.sse\");\n\t\t\tif (cacheFile)\n\t\t\t{\n\t\t\t\tcacheFile->write(asset::normalCacheFor2_10_10_10Quant.data(), asset::normalCacheFor2_10_10_10Quant.size() * sizeof(asset::QuantizationCacheEntry2_10_10_10));\n\t\t\t\tcacheFile->drop();\n\t\t\t}\n\t\t}\n\t\t\n\t\tauto contents = meshes.getContents();\n\t\tif (contents.first>=contents.second)\n\t\t\treturn 2;\n\n\t\tauto firstmesh = *contents.first;\n\t\tif (!firstmesh)\n\t\t\treturn 3;\n\n\t\tauto meta = firstmesh->getMetadata();\n\t\tif (!meta)\n\t\t\treturn 4;\n\t\tassert(core::strcmpi(meta->getLoaderName(),ext::MitsubaLoader::IMitsubaMetadata::LoaderName) == 0);\n\t\tglobalMeta = static_cast<ext::MitsubaLoader::IMeshMetadata*>(meta)->globalMetadata;\n\t}\n\n\n\tauto driver = device->getVideoDriver();\n\tdriver->setTextureCreationFlag(video::ETCF_ALWAYS_32_BIT, true);\n\tauto smgr = device->getSceneManager();\n\tcore::smart_refctd_ptr<Renderer> renderer = core::make_smart_refctd_ptr<Renderer>(driver,device->getAssetManager(),smgr);\n\trenderer->init(meshes);\n\tmeshes = {}; \/\/ free memory\n\n\n\tauto extent = renderer->getSceneBound().getExtent();\n\tauto camera = smgr->addCameraSceneNodeFPS(nullptr, 100.f, core::min(extent.X, extent.Y, extent.Z) * 0.0002f);\n\t\/\/auto camera = smgr->addCameraSceneNode(nullptr);\n\tauto isOkSensorType = [](const ext::MitsubaLoader::CElementSensor& sensor) -> bool {\n\t\treturn sensor.type == ext::MitsubaLoader::CElementSensor::Type::PERSPECTIVE || sensor.type == ext::MitsubaLoader::CElementSensor::Type::THINLENS;\n\t};\n\tif (globalMeta->sensors.size() && isOkSensorType(globalMeta->sensors.front()))\n\t{\n\t\tconst auto& sensor = globalMeta->sensors.front();\n\t\tconst auto& film = sensor.film;\n\n\t\t\/\/ need to extract individual components\n\t\tbool leftHandedCamera = false;\n\t\t{\n\t\t\tauto relativeTransform = sensor.transform.matrix.extractSub3x4();\n\t\t\tif (relativeTransform.getPseudoDeterminant().x < 0.f)\n\t\t\t\tleftHandedCamera = true;\n\n\t\t\tauto pos = relativeTransform.getTranslation();\n\t\t\tcamera->setPosition(pos.getAsVector3df());\n\n\t\t\tauto tpose = core::transpose(sensor.transform.matrix);\n\t\t\tauto up = tpose.rows[1];\n\t\t\tcore::vectorSIMDf view = tpose.rows[2];\n\t\t\tauto target = view+pos;\n\n\t\t\tcamera->setTarget(target.getAsVector3df());\n\t\t\tif (core::dot(core::normalize(core::cross(camera->getUpVector(),view)),core::cross(up,view)).x<0.99f)\n\t\t\t\tcamera->setUpVector(up.getAsVector3df());\n\t\t}\n\n\t\tconst ext::MitsubaLoader::CElementSensor::PerspectivePinhole* persp = nullptr;\n\t\tswitch (sensor.type)\n\t\t{\n\t\t\tcase ext::MitsubaLoader::CElementSensor::Type::PERSPECTIVE:\n\t\t\t\tpersp = &sensor.perspective;\n\t\t\t\tbreak;\n\t\t\tcase ext::MitsubaLoader::CElementSensor::Type::THINLENS:\n\t\t\t\tpersp = &sensor.thinlens;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tassert(false);\n\t\t\t\tbreak;\n\t\t}\n\t\tfloat realFoVDegrees;\n\t\tauto width = film.cropWidth;\n\t\tauto height = film.cropHeight;\n\t\tfloat aspectRatio = float(width) \/ float(height);\n\t\tauto convertFromXFoV = [=](float fov) -> float\n\t\t{\n\t\t\tfloat aspectX = tan(core::radians(fov)*0.5f);\n\t\t\treturn core::degrees(atan(aspectX\/aspectRatio)*2.f);\n\t\t};\n\t\tswitch (persp->fovAxis)\n\t\t{\n\t\t\tcase ext::MitsubaLoader::CElementSensor::PerspectivePinhole::FOVAxis::X:\n\t\t\t\trealFoVDegrees = convertFromXFoV(persp->fov);\n\t\t\t\tbreak;\n\t\t\tcase ext::MitsubaLoader::CElementSensor::PerspectivePinhole::FOVAxis::Y:\n\t\t\t\trealFoVDegrees = persp->fov;\n\t\t\t\tbreak;\n\t\t\tcase ext::MitsubaLoader::CElementSensor::PerspectivePinhole::FOVAxis::DIAGONAL:\n\t\t\t\t{\n\t\t\t\t\tfloat aspectDiag = tan(core::radians(persp->fov)*0.5f);\n\t\t\t\t\tfloat aspectY = aspectDiag\/core::sqrt(1.f+aspectRatio*aspectRatio);\n\t\t\t\t\trealFoVDegrees = core::degrees(atan(aspectY)*2.f);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase ext::MitsubaLoader::CElementSensor::PerspectivePinhole::FOVAxis::SMALLER:\n\t\t\t\tif (width < height)\n\t\t\t\t\trealFoVDegrees = convertFromXFoV(persp->fov);\n\t\t\t\telse\n\t\t\t\t\trealFoVDegrees = persp->fov;\n\t\t\t\tbreak;\n\t\t\tcase ext::MitsubaLoader::CElementSensor::PerspectivePinhole::FOVAxis::LARGER:\n\t\t\t\tif (width < height)\n\t\t\t\t\trealFoVDegrees = persp->fov;\n\t\t\t\telse\n\t\t\t\t\trealFoVDegrees = convertFromXFoV(persp->fov);\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\trealFoVDegrees = NAN;\n\t\t\t\tassert(false);\n\t\t\t\tbreak;\n\t\t}\n\t\t\/\/ TODO: apply the crop offset\n\t\tassert(film.cropOffsetX==0 && film.cropOffsetY==0);\n\t\tif (leftHandedCamera)\n\t\t\tcamera->setProjectionMatrix(core::matrix4SIMD::buildProjectionMatrixPerspectiveFovLH(core::radians(realFoVDegrees), aspectRatio, persp->nearClip, persp->farClip));\n\t\telse\n\t\t\tcamera->setProjectionMatrix(core::matrix4SIMD::buildProjectionMatrixPerspectiveFovRH(core::radians(realFoVDegrees), aspectRatio, persp->nearClip, persp->farClip));\n\t}\n\telse\n\t{\n\t\tcamera->setNearValue(20.f);\n\t\tcamera->setFarValue(5000.f);\n\t}\n\tsmgr->setActiveCamera(camera);\n\tdevice->getCursorControl()->setVisible(false);\n\n\n\tQToQuitEventReceiver receiver;\n\tdevice->setEventReceiver(&receiver);\n\n\tuint64_t lastFPSTime = 0;\n\twhile (device->run() && receiver.keepOpen())\n\t{\n\t\tdriver->beginScene(false, false);\n\n\t\trenderer->render();\n\n\t\tdriver->blitRenderTargets(renderer->getColorBuffer(),nullptr,false,false,{},{},true);\n\n\t\tdriver->endScene();\n\n\t\t\/\/ display frames per second in window title\n\t\tuint64_t time = device->getTimer()->getRealTime();\n\t\tif (time - lastFPSTime > 1000)\n\t\t{\n\t\t\tstd::wostringstream str;\n\t\t\tstr << L\"Mitsuba Loader Demo - Irrlicht Engine [\" << driver->getName() << \"] FPS:\" << driver->getFPS() << \" PrimitvesDrawn:\" << driver->getPrimitiveCountDrawn();\n\n\t\t\tdevice->setWindowCaption(str.str());\n\t\t\tlastFPSTime = time;\n\t\t}\n\t}\n\trenderer->deinit();\n\trenderer = nullptr;\n\n\t\/\/ create a screenshot\n\t{\n\t\tcore::rect<uint32_t> sourceRect(0, 0, params.WindowSize.Width, params.WindowSize.Height);\n\t\text::ScreenShot::dirtyCPUStallingScreenshot(device, \"screenshot.png\", sourceRect, asset::EF_R8G8B8_SRGB);\n\t}\n\n\tdevice->drop();\n\treturn 0;\n}\n<commit_msg>accuracy fixes<commit_after>#define _IRR_STATIC_LIB_\n#include <irrlicht.h>\n\n#include \"..\/..\/ext\/ScreenShot\/ScreenShot.h\"\n\n#include \"..\/common\/QToQuitEventReceiver.h\"\n\n#include \"..\/3rdparty\/portable-file-dialogs\/portable-file-dialogs.h\"\n#include \"..\/..\/ext\/MitsubaLoader\/CMitsubaLoader.h\"\n\n#include \".\/dirty_source\/ExtraCrap.h\"\n\n\nusing namespace irr;\nusing namespace core;\n\nint main()\n{\n\t\/\/ create device with full flexibility over creation parameters\n\t\/\/ you can add more parameters if desired, check irr::SIrrlichtCreationParameters\n\tirr::SIrrlichtCreationParameters params;\n\tparams.Bits = 24; \/\/may have to set to 32bit for some platforms\n\tparams.ZBufferBits = 24;\n\tparams.DriverType = video::EDT_OPENGL;\n\tparams.Fullscreen = false;\n\tparams.Vsync = false;\n\tparams.Doublebuffer = true;\n\tparams.Stencilbuffer = false; \/\/! This will not even be a choice soon\n\tparams.WindowSize = dimension2d<uint32_t>(1600, 900);\n\tIrrlichtDevice* device = createDeviceEx(params);\n\tif (device == 0)\n\t\treturn 1; \/\/ could not create selected driver.\n\n\t\/\/\n\tasset::SAssetBundle meshes;\n\tcore::smart_refctd_ptr<ext::MitsubaLoader::CGlobalMitsubaMetadata> globalMeta;\n\t{\n\t\tio::IFileSystem* fs = device->getFileSystem();\n\t\tasset::IAssetManager* am = device->getAssetManager();\n\n\t\tam->addAssetLoader(core::make_smart_refctd_ptr<irr::ext::MitsubaLoader::CSerializedLoader>(am));\n\t\tam->addAssetLoader(core::make_smart_refctd_ptr<irr::ext::MitsubaLoader::CMitsubaLoader>(am));\n\n\t\tstd::string filePath = \"..\/..\/media\/mitsuba\/daily_pt.xml\";\n\t\/\/#define MITSUBA_LOADER_TESTS\n\t#ifndef MITSUBA_LOADER_TESTS\n\t\tpfd::message(\"Choose file to load\", \"Choose mitsuba XML file to load or ZIP containing an XML. \\nIf you cancel or choosen file fails to load, simple scene will be loaded.\", pfd::choice::ok);\n\t\tpfd::open_file file(\"Choose XML or ZIP file\", \"..\/..\/media\/mitsuba\", { \"ZIP files (.zip)\", \"*.zip\", \"XML files (.xml)\", \"*.xml\"});\n\t\tif (!file.result().empty())\n\t\t\tfilePath = file.result()[0];\n\t#endif\n\t\tif (core::hasFileExtension(io::path(filePath.c_str()), \"zip\", \"ZIP\"))\n\t\t{\n\t\t\tio::IFileArchive* arch = nullptr;\n\t\t\tdevice->getFileSystem()->addFileArchive(filePath.c_str(),io::EFAT_ZIP,\"\",&arch);\n\t\t\tif (arch)\n\t\t\t{\n\t\t\t\tauto flist = arch->getFileList();\n\t\t\t\tif (!flist)\n\t\t\t\t\treturn 3;\n\t\t\t\tauto files = flist->getFiles();\n\n\t\t\t\tfor (auto it=files.begin(); it!=files.end(); )\n\t\t\t\t{\n\t\t\t\t\tif (core::hasFileExtension(it->FullName, \"xml\", \"XML\"))\n\t\t\t\t\t\tit++;\n\t\t\t\t\telse\n\t\t\t\t\t\tit = files.erase(it);\n\t\t\t\t}\n\t\t\t\tif (files.size() == 0u)\n\t\t\t\t\treturn 4;\n\n\t\t\t\tstd::cout << \"Choose File (0-\" << files.size() - 1ull << \"):\" << std::endl;\n\t\t\t\tfor (auto i = 0u; i < files.size(); i++)\n\t\t\t\t\tstd::cout << i << \": \" << files[i].FullName.c_str() << std::endl;\n\t\t\t\tuint32_t chosen = 0;\n\t\t#ifndef MITSUBA_LOADER_TESTS\n\t\t\t\tstd::cin >> chosen;\n\t\t#endif\n\t\t\t\tif (chosen >= files.size())\n\t\t\t\t\tchosen = 0u;\n\n\t\t\t\tfilePath = files[chosen].FullName.c_str();\n\t\t\t}\n\t\t}\n\n\t\t\/\/! read cache results -- speeds up mesh generation\n\t\t{\n\t\t\tio::IReadFile* cacheFile = device->getFileSystem()->createAndOpenFile(\"..\/..\/tmp\/normalCache101010.sse\");\n\t\t\tif (cacheFile)\n\t\t\t{\n\t\t\t\tasset::normalCacheFor2_10_10_10Quant.resize(cacheFile->getSize() \/ sizeof(asset::QuantizationCacheEntry2_10_10_10));\n\t\t\t\tcacheFile->read(asset::normalCacheFor2_10_10_10Quant.data(), cacheFile->getSize());\n\t\t\t\tcacheFile->drop();\n\n\t\t\t\t\/\/make sure its still ok\n\t\t\t\tstd::sort(asset::normalCacheFor2_10_10_10Quant.begin(), asset::normalCacheFor2_10_10_10Quant.end());\n\t\t\t}\n\t\t}\n\t\t\/\/! load the mitsuba scene\n\t\tmeshes = am->getAsset(filePath, {});\n\t\t\/\/! cache results -- speeds up mesh generation on second run\n\t\t{\n\t\t\tio::IWriteFile* cacheFile = device->getFileSystem()->createAndWriteFile(\"..\/..\/tmp\/normalCache101010.sse\");\n\t\t\tif (cacheFile)\n\t\t\t{\n\t\t\t\tcacheFile->write(asset::normalCacheFor2_10_10_10Quant.data(), asset::normalCacheFor2_10_10_10Quant.size() * sizeof(asset::QuantizationCacheEntry2_10_10_10));\n\t\t\t\tcacheFile->drop();\n\t\t\t}\n\t\t}\n\t\t\n\t\tauto contents = meshes.getContents();\n\t\tif (contents.first>=contents.second)\n\t\t\treturn 2;\n\n\t\tauto firstmesh = *contents.first;\n\t\tif (!firstmesh)\n\t\t\treturn 3;\n\n\t\tauto meta = firstmesh->getMetadata();\n\t\tif (!meta)\n\t\t\treturn 4;\n\t\tassert(core::strcmpi(meta->getLoaderName(),ext::MitsubaLoader::IMitsubaMetadata::LoaderName) == 0);\n\t\tglobalMeta = static_cast<ext::MitsubaLoader::IMeshMetadata*>(meta)->globalMetadata;\n\t}\n\n\n\tauto driver = device->getVideoDriver();\n\tdriver->setTextureCreationFlag(video::ETCF_ALWAYS_32_BIT, true);\n\tauto smgr = device->getSceneManager();\n\tcore::smart_refctd_ptr<Renderer> renderer = core::make_smart_refctd_ptr<Renderer>(driver,device->getAssetManager(),smgr);\n\trenderer->init(meshes);\n\tmeshes = {}; \/\/ free memory\n\n\n\tauto extent = renderer->getSceneBound().getExtent();\n\tauto camera = smgr->addCameraSceneNodeFPS(nullptr, 100.f, core::min(extent.X, extent.Y, extent.Z) * 0.0002f);\n\t\/\/auto camera = smgr->addCameraSceneNode(nullptr);\n\tauto isOkSensorType = [](const ext::MitsubaLoader::CElementSensor& sensor) -> bool {\n\t\treturn sensor.type == ext::MitsubaLoader::CElementSensor::Type::PERSPECTIVE || sensor.type == ext::MitsubaLoader::CElementSensor::Type::THINLENS;\n\t};\n\tif (globalMeta->sensors.size() && isOkSensorType(globalMeta->sensors.front()))\n\t{\n\t\tconst auto& sensor = globalMeta->sensors.front();\n\t\tconst auto& film = sensor.film;\n\n\t\t\/\/ need to extract individual components\n\t\tbool leftHandedCamera = false;\n\t\t{\n\t\t\tauto relativeTransform = sensor.transform.matrix.extractSub3x4();\n\t\t\tif (relativeTransform.getPseudoDeterminant().x < 0.f)\n\t\t\t\tleftHandedCamera = true;\n\n\t\t\tauto pos = relativeTransform.getTranslation();\n\t\t\tcamera->setPosition(pos.getAsVector3df());\n\n\t\t\tauto tpose = core::transpose(sensor.transform.matrix);\n\t\t\tauto up = tpose.rows[1];\n\t\t\tcore::vectorSIMDf view = tpose.rows[2];\n\t\t\tauto target = view+pos;\n\n\t\t\tcamera->setTarget(target.getAsVector3df());\n\t\t\tif (core::dot(core::normalize(core::cross(camera->getUpVector(),view)),core::cross(up,view)).x<0.99f)\n\t\t\t\tcamera->setUpVector(up.getAsVector3df());\n\t\t}\n\n\t\tconst ext::MitsubaLoader::CElementSensor::PerspectivePinhole* persp = nullptr;\n\t\tswitch (sensor.type)\n\t\t{\n\t\t\tcase ext::MitsubaLoader::CElementSensor::Type::PERSPECTIVE:\n\t\t\t\tpersp = &sensor.perspective;\n\t\t\t\tbreak;\n\t\t\tcase ext::MitsubaLoader::CElementSensor::Type::THINLENS:\n\t\t\t\tpersp = &sensor.thinlens;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tassert(false);\n\t\t\t\tbreak;\n\t\t}\n\t\tfloat realFoVDegrees;\n\t\tauto width = film.cropWidth;\n\t\tauto height = film.cropHeight;\n\t\tfloat aspectRatio = float(width) \/ float(height);\n\t\tauto convertFromXFoV = [=](float fov) -> float\n\t\t{\n\t\t\tfloat aspectX = tan(core::radians(fov)*0.5f);\n\t\t\treturn core::degrees(atan(aspectX\/aspectRatio)*2.f);\n\t\t};\n\t\tswitch (persp->fovAxis)\n\t\t{\n\t\t\tcase ext::MitsubaLoader::CElementSensor::PerspectivePinhole::FOVAxis::X:\n\t\t\t\trealFoVDegrees = convertFromXFoV(persp->fov);\n\t\t\t\tbreak;\n\t\t\tcase ext::MitsubaLoader::CElementSensor::PerspectivePinhole::FOVAxis::Y:\n\t\t\t\trealFoVDegrees = persp->fov;\n\t\t\t\tbreak;\n\t\t\tcase ext::MitsubaLoader::CElementSensor::PerspectivePinhole::FOVAxis::DIAGONAL:\n\t\t\t\t{\n\t\t\t\t\tfloat aspectDiag = tan(core::radians(persp->fov)*0.5f);\n\t\t\t\t\tfloat aspectY = aspectDiag\/core::sqrt(1.f+aspectRatio*aspectRatio);\n\t\t\t\t\trealFoVDegrees = core::degrees(atan(aspectY)*2.f);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase ext::MitsubaLoader::CElementSensor::PerspectivePinhole::FOVAxis::SMALLER:\n\t\t\t\tif (width < height)\n\t\t\t\t\trealFoVDegrees = convertFromXFoV(persp->fov);\n\t\t\t\telse\n\t\t\t\t\trealFoVDegrees = persp->fov;\n\t\t\t\tbreak;\n\t\t\tcase ext::MitsubaLoader::CElementSensor::PerspectivePinhole::FOVAxis::LARGER:\n\t\t\t\tif (width < height)\n\t\t\t\t\trealFoVDegrees = persp->fov;\n\t\t\t\telse\n\t\t\t\t\trealFoVDegrees = convertFromXFoV(persp->fov);\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\trealFoVDegrees = NAN;\n\t\t\t\tassert(false);\n\t\t\t\tbreak;\n\t\t}\n\t\t\/\/ TODO: apply the crop offset\n\t\tassert(film.cropOffsetX==0 && film.cropOffsetY==0);\n\t\tfloat nearClip = core::max(persp->nearClip, persp->farClip * 0.0001);\n\t\tif (leftHandedCamera)\n\t\t\tcamera->setProjectionMatrix(core::matrix4SIMD::buildProjectionMatrixPerspectiveFovLH(core::radians(realFoVDegrees), aspectRatio, nearClip, persp->farClip));\n\t\telse\n\t\t\tcamera->setProjectionMatrix(core::matrix4SIMD::buildProjectionMatrixPerspectiveFovRH(core::radians(realFoVDegrees), aspectRatio, nearClip, persp->farClip));\n\t}\n\telse\n\t{\n\t\tcamera->setNearValue(20.f);\n\t\tcamera->setFarValue(5000.f);\n\t}\n\tsmgr->setActiveCamera(camera);\n\tdevice->getCursorControl()->setVisible(false);\n\n\n\tQToQuitEventReceiver receiver;\n\tdevice->setEventReceiver(&receiver);\n\n\tuint64_t lastFPSTime = 0;\n\twhile (device->run() && receiver.keepOpen())\n\t{\n\t\tdriver->beginScene(false, false);\n\n\t\trenderer->render();\n\n\t\tauto oldVP = driver->getViewPort();\n\t\tdriver->blitRenderTargets(renderer->getColorBuffer(),nullptr,false,false,{},{},true);\n\t\tdriver->setViewPort(oldVP);\n\n\t\tdriver->endScene();\n\n\t\t\/\/ display frames per second in window title\n\t\tuint64_t time = device->getTimer()->getRealTime();\n\t\tif (time - lastFPSTime > 1000)\n\t\t{\n\t\t\tstd::wostringstream str;\n\t\t\tstr << L\"Mitsuba Loader Demo - Irrlicht Engine [\" << driver->getName() << \"] FPS:\" << driver->getFPS() << \" PrimitvesDrawn:\" << driver->getPrimitiveCountDrawn();\n\n\t\t\tdevice->setWindowCaption(str.str());\n\t\t\tlastFPSTime = time;\n\t\t}\n\t}\n\trenderer->deinit();\n\trenderer = nullptr;\n\n\t\/\/ create a screenshot\n\t{\n\t\tcore::rect<uint32_t> sourceRect(0, 0, params.WindowSize.Width, params.WindowSize.Height);\n\t\text::ScreenShot::dirtyCPUStallingScreenshot(device, \"screenshot.png\", sourceRect, asset::EF_R8G8B8_SRGB);\n\t}\n\n\tdevice->drop();\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2014 Digia Plc and\/or its subsidiary(-ies).\n** Contact: http:\/\/www.qt-project.org\/legal\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia.  For licensing terms and\n** conditions see http:\/\/qt.digia.com\/licensing.  For further information\n** use the contact form at http:\/\/qt.digia.com\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Digia gives you certain additional\n** rights.  These rights are described in the Digia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n****************************************************************************\/\n\n#include \"entertabdesigneraction.h\"\n\n#include <abstractaction.h>\n#include <documentmanager.h>\n#include <modelnode.h>\n#include <nodeabstractproperty.h>\n#include <nodemetainfo.h>\n#include <qmlitemnode.h>\n\n#include <QCoreApplication>\n\nnamespace QmlDesigner {\n\nclass EnterTabAction : public DefaultAction\n{\n\npublic:\n    EnterTabAction(const QString &description)\n        : DefaultAction(description)\n    { }\n\npublic \/*slots*\/:\n    void actionTriggered(bool) QTC_OVERRIDE\n    {\n        DocumentManager::goIntoComponent(m_selectionContext.targetNode());\n    }\n};\n\nEnterTabDesignerAction::EnterTabDesignerAction()\n : AbstractActionGroup(QCoreApplication::translate(\"TabViewToolAction\", \"Edit Tab\"))\n{\n}\n\nQByteArray EnterTabDesignerAction::category() const\n{\n    return QByteArray();\n}\n\nQByteArray EnterTabDesignerAction::menuId() const\n{\n    return \"TabViewAction\";\n}\n\nint EnterTabDesignerAction::priority() const\n{\n    \/\/Editing tabs is above adding tabs\n    return CustomActionsPriority + 10;\n}\n\nvoid EnterTabDesignerAction::updateContext()\n{\n    menu()->clear();\n    if (selectionContext().isValid()) {\n\n        action()->setEnabled(isEnabled(selectionContext()));\n        action()->setVisible(isVisible(selectionContext()));\n\n        if (action()->isEnabled()) {\n            const ModelNode selectedModelNode = selectionContext().currentSingleSelectedNode();\n            if (selectedModelNode.metaInfo().isValid()\n                    && selectedModelNode.metaInfo().isSubclassOf(\"QtQuick.Controls.TabView\", -1, -1)) {\n\n                const NodeAbstractProperty defaultProperty = selectedModelNode.defaultNodeAbstractProperty();\n                foreach (const QmlDesigner::ModelNode &childModelNode, defaultProperty.directSubNodes()) {\n                    createActionForTab(childModelNode);\n                }\n            }\n        }\n    }\n}\n\nbool EnterTabDesignerAction::isVisible(const SelectionContext &selectionContext) const\n{\n    if (selectionContext.singleNodeIsSelected()) {\n        ModelNode selectedModelNode = selectionContext.currentSingleSelectedNode();\n        return selectedModelNode.metaInfo().isValid() && selectedModelNode.metaInfo().isTabView();\n    }\n\n    return false;\n}\n\nstatic bool tabViewIsNotEmpty(const SelectionContext &selectionContext)\n{\n    return  selectionContext.currentSingleSelectedNode().defaultNodeAbstractProperty().isNodeListProperty();\n}\n\nbool EnterTabDesignerAction::isEnabled(const SelectionContext &selectionContext) const\n{\n    return isVisible(selectionContext) && tabViewIsNotEmpty(selectionContext);\n}\n\nvoid EnterTabDesignerAction::createActionForTab(const ModelNode &modelNode)\n{\n    if (modelNode.metaInfo().isValid()\n            && modelNode.metaInfo().isSubclassOf(\"QtQuick.Controls.Tab\", -1, -1)) {\n\n        QmlDesigner::QmlItemNode itemNode(modelNode);\n\n        if (itemNode.isValid()) {\n            QString what = QString(QT_TRANSLATE_NOOP(\"QmlDesignerContextMenu\", \"Edit: %1\")).\n                    arg(itemNode.instanceValue(\"title\").toString());\n            EnterTabAction *selectionAction = new EnterTabAction(what);\n\n            SelectionContext nodeSelectionContext = selectionContext();\n            nodeSelectionContext.setTargetNode(modelNode);\n            selectionAction->setSelectionContext(nodeSelectionContext);\n\n            menu()->addAction(selectionAction);\n\n        }\n    }\n}\n\n} \/\/ namespace QmlDesigner\n<commit_msg>QmlDesigner: Adjusting text<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2014 Digia Plc and\/or its subsidiary(-ies).\n** Contact: http:\/\/www.qt-project.org\/legal\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia.  For licensing terms and\n** conditions see http:\/\/qt.digia.com\/licensing.  For further information\n** use the contact form at http:\/\/qt.digia.com\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Digia gives you certain additional\n** rights.  These rights are described in the Digia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n****************************************************************************\/\n\n#include \"entertabdesigneraction.h\"\n\n#include <abstractaction.h>\n#include <documentmanager.h>\n#include <modelnode.h>\n#include <nodeabstractproperty.h>\n#include <nodemetainfo.h>\n#include <qmlitemnode.h>\n\n#include <QCoreApplication>\n\nnamespace QmlDesigner {\n\nclass EnterTabAction : public DefaultAction\n{\n\npublic:\n    EnterTabAction(const QString &description)\n        : DefaultAction(description)\n    { }\n\npublic \/*slots*\/:\n    void actionTriggered(bool) QTC_OVERRIDE\n    {\n        DocumentManager::goIntoComponent(m_selectionContext.targetNode());\n    }\n};\n\nEnterTabDesignerAction::EnterTabDesignerAction()\n : AbstractActionGroup(QCoreApplication::translate(\"TabViewToolAction\", \"Step into Tab\"))\n{\n}\n\nQByteArray EnterTabDesignerAction::category() const\n{\n    return QByteArray();\n}\n\nQByteArray EnterTabDesignerAction::menuId() const\n{\n    return \"TabViewAction\";\n}\n\nint EnterTabDesignerAction::priority() const\n{\n    \/\/Editing tabs is above adding tabs\n    return CustomActionsPriority + 10;\n}\n\nvoid EnterTabDesignerAction::updateContext()\n{\n    menu()->clear();\n    if (selectionContext().isValid()) {\n\n        action()->setEnabled(isEnabled(selectionContext()));\n        action()->setVisible(isVisible(selectionContext()));\n\n        if (action()->isEnabled()) {\n            const ModelNode selectedModelNode = selectionContext().currentSingleSelectedNode();\n            if (selectedModelNode.metaInfo().isValid()\n                    && selectedModelNode.metaInfo().isSubclassOf(\"QtQuick.Controls.TabView\", -1, -1)) {\n\n                const NodeAbstractProperty defaultProperty = selectedModelNode.defaultNodeAbstractProperty();\n                foreach (const QmlDesigner::ModelNode &childModelNode, defaultProperty.directSubNodes()) {\n                    createActionForTab(childModelNode);\n                }\n            }\n        }\n    }\n}\n\nbool EnterTabDesignerAction::isVisible(const SelectionContext &selectionContext) const\n{\n    if (selectionContext.singleNodeIsSelected()) {\n        ModelNode selectedModelNode = selectionContext.currentSingleSelectedNode();\n        return selectedModelNode.metaInfo().isValid() && selectedModelNode.metaInfo().isTabView();\n    }\n\n    return false;\n}\n\nstatic bool tabViewIsNotEmpty(const SelectionContext &selectionContext)\n{\n    return  selectionContext.currentSingleSelectedNode().defaultNodeAbstractProperty().isNodeListProperty();\n}\n\nbool EnterTabDesignerAction::isEnabled(const SelectionContext &selectionContext) const\n{\n    return isVisible(selectionContext) && tabViewIsNotEmpty(selectionContext);\n}\n\nvoid EnterTabDesignerAction::createActionForTab(const ModelNode &modelNode)\n{\n    if (modelNode.metaInfo().isValid()\n            && modelNode.metaInfo().isSubclassOf(\"QtQuick.Controls.Tab\", -1, -1)) {\n\n        QmlDesigner::QmlItemNode itemNode(modelNode);\n\n        if (itemNode.isValid()) {\n            QString what = QString(QT_TRANSLATE_NOOP(\"QmlDesignerContextMenu\", \"Step into: %1\")).\n                    arg(itemNode.instanceValue(\"title\").toString());\n            EnterTabAction *selectionAction = new EnterTabAction(what);\n\n            SelectionContext nodeSelectionContext = selectionContext();\n            nodeSelectionContext.setTargetNode(modelNode);\n            selectionAction->setSelectionContext(nodeSelectionContext);\n\n            menu()->addAction(selectionAction);\n\n        }\n    }\n}\n\n} \/\/ namespace QmlDesigner\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n * The MIT License (MIT)\n *\n * Copyright (c) 2016 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 \"d3d12_state.h\"\n#include \"d3d12_command_list.h\"\n#include \"d3d12_manager.h\"\n#include \"d3d12_resources.h\"\n\nD3D12RenderState::D3D12RenderState()\n{\n  views.clear();\n  scissors.clear();\n\n  rts.clear();\n  rtSingle = false;\n  dsv = PortableHandle();\n\n  m_ResourceManager = NULL;\n\n  heaps.clear();\n\n  pipe = graphics.rootsig = compute.rootsig = ResourceId();\n  graphics.sigelems.clear();\n  compute.sigelems.clear();\n\n  topo = D3D_PRIMITIVE_TOPOLOGY_UNDEFINED;\n\n  stencilRef = 0;\n  RDCEraseEl(blendFactor);\n\n  RDCEraseEl(ibuffer);\n  vbuffers.clear();\n}\n\nD3D12RenderState &D3D12RenderState::operator=(const D3D12RenderState &o)\n{\n  views = o.views;\n  scissors = o.scissors;\n\n  rts = o.rts;\n  rtSingle = o.rtSingle;\n  dsv = o.dsv;\n\n  pipe = o.pipe;\n\n  heaps = o.heaps;\n\n  graphics.rootsig = o.graphics.rootsig;\n  graphics.sigelems = o.graphics.sigelems;\n  compute.rootsig = o.compute.rootsig;\n  compute.sigelems = o.compute.sigelems;\n\n  topo = o.topo;\n  stencilRef = o.stencilRef;\n  memcpy(blendFactor, o.blendFactor, sizeof(blendFactor));\n\n  ibuffer = o.ibuffer;\n  vbuffers = o.vbuffers;\n\n  return *this;\n}\n\nvector<ResourceId> D3D12RenderState::GetRTVIDs() const\n{\n  vector<ResourceId> ret;\n\n  if(rtSingle)\n  {\n    if(!rts.empty())\n    {\n      const D3D12Descriptor *descs = DescriptorFromPortableHandle(GetResourceManager(), rts[0]);\n\n      for(UINT i = 0; i < rts.size(); i++)\n      {\n        RDCASSERT(descs[i].GetType() == D3D12Descriptor::TypeRTV);\n        ret.push_back(GetResID(descs[i].nonsamp.resource));\n      }\n    }\n  }\n  else\n  {\n    for(UINT i = 0; i < rts.size(); i++)\n    {\n      WrappedID3D12DescriptorHeap *heap =\n          GetResourceManager()->GetLiveAs<WrappedID3D12DescriptorHeap>(rts[0].heap);\n\n      const D3D12Descriptor &desc = heap->GetDescriptors()[rts[i].index];\n\n      RDCASSERT(desc.GetType() == D3D12Descriptor::TypeRTV);\n      ret.push_back(GetResID(desc.nonsamp.resource));\n    }\n  }\n\n  return ret;\n}\n\nResourceId D3D12RenderState::GetDSVID() const\n{\n  if(dsv.heap != ResourceId())\n  {\n    const D3D12Descriptor *desc = DescriptorFromPortableHandle(GetResourceManager(), dsv);\n\n    RDCASSERT(desc->GetType() == D3D12Descriptor::TypeDSV);\n\n    return GetResID(desc->nonsamp.resource);\n  }\n\n  return ResourceId();\n}\n\nvoid D3D12RenderState::ApplyState(ID3D12GraphicsCommandList *cmd) const\n{\n  if(pipe != ResourceId())\n    cmd->SetPipelineState(GetResourceManager()->GetCurrentAs<ID3D12PipelineState>(pipe));\n\n  if(!views.empty())\n    cmd->RSSetViewports((UINT)views.size(), &views[0]);\n\n  if(!scissors.empty())\n    cmd->RSSetScissorRects((UINT)scissors.size(), &scissors[0]);\n\n  if(topo != D3D_PRIMITIVE_TOPOLOGY_UNDEFINED)\n    cmd->IASetPrimitiveTopology(topo);\n\n  cmd->OMSetStencilRef(stencilRef);\n  cmd->OMSetBlendFactor(blendFactor);\n\n  if(ibuffer.buf != ResourceId())\n  {\n    D3D12_INDEX_BUFFER_VIEW ib;\n\n    ID3D12Resource *res = GetResourceManager()->GetCurrentAs<ID3D12Resource>(ibuffer.buf);\n    if(res)\n      ib.BufferLocation = res->GetGPUVirtualAddress() + ibuffer.offs;\n    else\n      ib.BufferLocation = 0;\n\n    ib.Format = (ibuffer.bytewidth == 2 ? DXGI_FORMAT_R16_UINT : DXGI_FORMAT_R32_UINT);\n    ib.SizeInBytes = ibuffer.size;\n\n    cmd->IASetIndexBuffer(&ib);\n  }\n\n  for(size_t i = 0; i < vbuffers.size(); i++)\n  {\n    D3D12_VERTEX_BUFFER_VIEW vb;\n\n    ID3D12Resource *res = GetResourceManager()->GetCurrentAs<ID3D12Resource>(vbuffers[i].buf);\n    if(res)\n      vb.BufferLocation = res->GetGPUVirtualAddress() + vbuffers[i].offs;\n    else\n      vb.BufferLocation = 0;\n\n    vb.StrideInBytes = vbuffers[i].stride;\n    vb.SizeInBytes = vbuffers[i].size;\n\n    cmd->IASetVertexBuffers((UINT)i, 1, &vb);\n  }\n\n  std::vector<ID3D12DescriptorHeap *> descHeaps;\n  descHeaps.resize(heaps.size());\n\n  for(size_t i = 0; i < heaps.size(); i++)\n    descHeaps[i] = GetResourceManager()->GetCurrentAs<ID3D12DescriptorHeap>(heaps[i]);\n\n  if(!descHeaps.empty())\n    cmd->SetDescriptorHeaps((UINT)descHeaps.size(), &descHeaps[0]);\n\n  if(!rts.empty() || dsv.heap != ResourceId())\n  {\n    D3D12_CPU_DESCRIPTOR_HANDLE rtHandles[8];\n    D3D12_CPU_DESCRIPTOR_HANDLE dsvHandle = CPUHandleFromPortableHandle(GetResourceManager(), dsv);\n\n    UINT numActualHandles = rtSingle ? 1 : (UINT)rts.size();\n\n    for(UINT i = 0; i < numActualHandles; i++)\n      rtHandles[i] = CPUHandleFromPortableHandle(GetResourceManager(), rts[i]);\n\n    \/\/ need to unwrap here, as FromPortableHandle unwraps too.\n    Unwrap(cmd)->OMSetRenderTargets((UINT)rts.size(), rtHandles, rtSingle ? TRUE : FALSE,\n                                    dsv.heap != ResourceId() ? &dsvHandle : NULL);\n  }\n\n  if(graphics.rootsig != ResourceId())\n  {\n    cmd->SetGraphicsRootSignature(\n        GetResourceManager()->GetCurrentAs<ID3D12RootSignature>(graphics.rootsig));\n\n    ApplyGraphicsRootElements(cmd);\n  }\n\n  if(compute.rootsig != ResourceId())\n  {\n    cmd->SetComputeRootSignature(\n        GetResourceManager()->GetCurrentAs<ID3D12RootSignature>(compute.rootsig));\n\n    ApplyComputeRootElements(cmd);\n  }\n}\n\nvoid D3D12RenderState::ApplyComputeRootElements(ID3D12GraphicsCommandList *cmd) const\n{\n  for(size_t i = 0; i < compute.sigelems.size(); i++)\n  {\n    \/\/ just don't set tables that aren't in the descriptor heaps, since it's invalid and can crash\n    \/\/ and is probably just from stale bindings that aren't going to be used\n    if(compute.sigelems[i].type != eRootTable ||\n       std::find(heaps.begin(), heaps.end(), compute.sigelems[i].id) != heaps.end())\n    {\n      compute.sigelems[i].SetToCompute(GetResourceManager(), cmd, (UINT)i);\n    }\n    else\n    {\n      RDCDEBUG(\"Skipping setting possibly stale compute root table referring to heap %llu\",\n               compute.sigelems[i].id);\n    }\n  }\n}\n\nvoid D3D12RenderState::ApplyGraphicsRootElements(ID3D12GraphicsCommandList *cmd) const\n{\n  for(size_t i = 0; i < graphics.sigelems.size(); i++)\n  {\n    \/\/ just don't set tables that aren't in the descriptor heaps, since it's invalid and can crash\n    \/\/ and is probably just from stale bindings that aren't going to be used\n    if(graphics.sigelems[i].type != eRootTable ||\n       std::find(heaps.begin(), heaps.end(), graphics.sigelems[i].id) != heaps.end())\n    {\n      graphics.sigelems[i].SetToGraphics(GetResourceManager(), cmd, (UINT)i);\n    }\n    else\n    {\n      RDCDEBUG(\"Skipping setting possibly stale graphics root table referring to heap %llu\",\n               graphics.sigelems[i].id);\n    }\n  }\n}\n<commit_msg>Make sure we don't index into empty RTs array with rtSingle. Refs #482<commit_after>\/******************************************************************************\n * The MIT License (MIT)\n *\n * Copyright (c) 2016 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 \"d3d12_state.h\"\n#include \"d3d12_command_list.h\"\n#include \"d3d12_manager.h\"\n#include \"d3d12_resources.h\"\n\nD3D12RenderState::D3D12RenderState()\n{\n  views.clear();\n  scissors.clear();\n\n  rts.clear();\n  rtSingle = false;\n  dsv = PortableHandle();\n\n  m_ResourceManager = NULL;\n\n  heaps.clear();\n\n  pipe = graphics.rootsig = compute.rootsig = ResourceId();\n  graphics.sigelems.clear();\n  compute.sigelems.clear();\n\n  topo = D3D_PRIMITIVE_TOPOLOGY_UNDEFINED;\n\n  stencilRef = 0;\n  RDCEraseEl(blendFactor);\n\n  RDCEraseEl(ibuffer);\n  vbuffers.clear();\n}\n\nD3D12RenderState &D3D12RenderState::operator=(const D3D12RenderState &o)\n{\n  views = o.views;\n  scissors = o.scissors;\n\n  rts = o.rts;\n  rtSingle = o.rtSingle;\n  dsv = o.dsv;\n\n  pipe = o.pipe;\n\n  heaps = o.heaps;\n\n  graphics.rootsig = o.graphics.rootsig;\n  graphics.sigelems = o.graphics.sigelems;\n  compute.rootsig = o.compute.rootsig;\n  compute.sigelems = o.compute.sigelems;\n\n  topo = o.topo;\n  stencilRef = o.stencilRef;\n  memcpy(blendFactor, o.blendFactor, sizeof(blendFactor));\n\n  ibuffer = o.ibuffer;\n  vbuffers = o.vbuffers;\n\n  return *this;\n}\n\nvector<ResourceId> D3D12RenderState::GetRTVIDs() const\n{\n  vector<ResourceId> ret;\n\n  if(rtSingle)\n  {\n    if(!rts.empty())\n    {\n      const D3D12Descriptor *descs = DescriptorFromPortableHandle(GetResourceManager(), rts[0]);\n\n      for(UINT i = 0; i < rts.size(); i++)\n      {\n        RDCASSERT(descs[i].GetType() == D3D12Descriptor::TypeRTV);\n        ret.push_back(GetResID(descs[i].nonsamp.resource));\n      }\n    }\n  }\n  else\n  {\n    for(UINT i = 0; i < rts.size(); i++)\n    {\n      WrappedID3D12DescriptorHeap *heap =\n          GetResourceManager()->GetLiveAs<WrappedID3D12DescriptorHeap>(rts[0].heap);\n\n      const D3D12Descriptor &desc = heap->GetDescriptors()[rts[i].index];\n\n      RDCASSERT(desc.GetType() == D3D12Descriptor::TypeRTV);\n      ret.push_back(GetResID(desc.nonsamp.resource));\n    }\n  }\n\n  return ret;\n}\n\nResourceId D3D12RenderState::GetDSVID() const\n{\n  if(dsv.heap != ResourceId())\n  {\n    const D3D12Descriptor *desc = DescriptorFromPortableHandle(GetResourceManager(), dsv);\n\n    RDCASSERT(desc->GetType() == D3D12Descriptor::TypeDSV);\n\n    return GetResID(desc->nonsamp.resource);\n  }\n\n  return ResourceId();\n}\n\nvoid D3D12RenderState::ApplyState(ID3D12GraphicsCommandList *cmd) const\n{\n  if(pipe != ResourceId())\n    cmd->SetPipelineState(GetResourceManager()->GetCurrentAs<ID3D12PipelineState>(pipe));\n\n  if(!views.empty())\n    cmd->RSSetViewports((UINT)views.size(), &views[0]);\n\n  if(!scissors.empty())\n    cmd->RSSetScissorRects((UINT)scissors.size(), &scissors[0]);\n\n  if(topo != D3D_PRIMITIVE_TOPOLOGY_UNDEFINED)\n    cmd->IASetPrimitiveTopology(topo);\n\n  cmd->OMSetStencilRef(stencilRef);\n  cmd->OMSetBlendFactor(blendFactor);\n\n  if(ibuffer.buf != ResourceId())\n  {\n    D3D12_INDEX_BUFFER_VIEW ib;\n\n    ID3D12Resource *res = GetResourceManager()->GetCurrentAs<ID3D12Resource>(ibuffer.buf);\n    if(res)\n      ib.BufferLocation = res->GetGPUVirtualAddress() + ibuffer.offs;\n    else\n      ib.BufferLocation = 0;\n\n    ib.Format = (ibuffer.bytewidth == 2 ? DXGI_FORMAT_R16_UINT : DXGI_FORMAT_R32_UINT);\n    ib.SizeInBytes = ibuffer.size;\n\n    cmd->IASetIndexBuffer(&ib);\n  }\n\n  for(size_t i = 0; i < vbuffers.size(); i++)\n  {\n    D3D12_VERTEX_BUFFER_VIEW vb;\n\n    ID3D12Resource *res = GetResourceManager()->GetCurrentAs<ID3D12Resource>(vbuffers[i].buf);\n    if(res)\n      vb.BufferLocation = res->GetGPUVirtualAddress() + vbuffers[i].offs;\n    else\n      vb.BufferLocation = 0;\n\n    vb.StrideInBytes = vbuffers[i].stride;\n    vb.SizeInBytes = vbuffers[i].size;\n\n    cmd->IASetVertexBuffers((UINT)i, 1, &vb);\n  }\n\n  std::vector<ID3D12DescriptorHeap *> descHeaps;\n  descHeaps.resize(heaps.size());\n\n  for(size_t i = 0; i < heaps.size(); i++)\n    descHeaps[i] = GetResourceManager()->GetCurrentAs<ID3D12DescriptorHeap>(heaps[i]);\n\n  if(!descHeaps.empty())\n    cmd->SetDescriptorHeaps((UINT)descHeaps.size(), &descHeaps[0]);\n\n  if(!rts.empty() || dsv.heap != ResourceId())\n  {\n    D3D12_CPU_DESCRIPTOR_HANDLE rtHandles[8];\n    D3D12_CPU_DESCRIPTOR_HANDLE dsvHandle = CPUHandleFromPortableHandle(GetResourceManager(), dsv);\n\n    UINT rtCount = (UINT)rts.size();\n    UINT numActualHandles = rtSingle ? RDCMIN(1U, rtCount) : rtCount;\n\n    for(UINT i = 0; i < numActualHandles; i++)\n      rtHandles[i] = CPUHandleFromPortableHandle(GetResourceManager(), rts[i]);\n\n    \/\/ need to unwrap here, as FromPortableHandle unwraps too.\n    Unwrap(cmd)->OMSetRenderTargets((UINT)rts.size(), rtHandles, rtSingle ? TRUE : FALSE,\n                                    dsv.heap != ResourceId() ? &dsvHandle : NULL);\n  }\n\n  if(graphics.rootsig != ResourceId())\n  {\n    cmd->SetGraphicsRootSignature(\n        GetResourceManager()->GetCurrentAs<ID3D12RootSignature>(graphics.rootsig));\n\n    ApplyGraphicsRootElements(cmd);\n  }\n\n  if(compute.rootsig != ResourceId())\n  {\n    cmd->SetComputeRootSignature(\n        GetResourceManager()->GetCurrentAs<ID3D12RootSignature>(compute.rootsig));\n\n    ApplyComputeRootElements(cmd);\n  }\n}\n\nvoid D3D12RenderState::ApplyComputeRootElements(ID3D12GraphicsCommandList *cmd) const\n{\n  for(size_t i = 0; i < compute.sigelems.size(); i++)\n  {\n    \/\/ just don't set tables that aren't in the descriptor heaps, since it's invalid and can crash\n    \/\/ and is probably just from stale bindings that aren't going to be used\n    if(compute.sigelems[i].type != eRootTable ||\n       std::find(heaps.begin(), heaps.end(), compute.sigelems[i].id) != heaps.end())\n    {\n      compute.sigelems[i].SetToCompute(GetResourceManager(), cmd, (UINT)i);\n    }\n    else\n    {\n      RDCDEBUG(\"Skipping setting possibly stale compute root table referring to heap %llu\",\n               compute.sigelems[i].id);\n    }\n  }\n}\n\nvoid D3D12RenderState::ApplyGraphicsRootElements(ID3D12GraphicsCommandList *cmd) const\n{\n  for(size_t i = 0; i < graphics.sigelems.size(); i++)\n  {\n    \/\/ just don't set tables that aren't in the descriptor heaps, since it's invalid and can crash\n    \/\/ and is probably just from stale bindings that aren't going to be used\n    if(graphics.sigelems[i].type != eRootTable ||\n       std::find(heaps.begin(), heaps.end(), graphics.sigelems[i].id) != heaps.end())\n    {\n      graphics.sigelems[i].SetToGraphics(GetResourceManager(), cmd, (UINT)i);\n    }\n    else\n    {\n      RDCDEBUG(\"Skipping setting possibly stale graphics root table referring to heap %llu\",\n               graphics.sigelems[i].id);\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 \"media\/base\/filters.h\"\n#include \"media\/base\/mock_filter_host.h\"\n#include \"media\/base\/mock_filters.h\"\n#include \"webkit\/glue\/media\/mock_media_resource_loader_bridge_factory.h\"\n#include \"webkit\/glue\/media\/simple_data_source.h\"\n#include \"webkit\/glue\/mock_resource_loader_bridge.h\"\n\nusing ::testing::_;\nusing ::testing::DoAll;\nusing ::testing::InSequence;\nusing ::testing::Invoke;\nusing ::testing::NiceMock;\nusing ::testing::NotNull;\nusing ::testing::Return;\nusing ::testing::SetArgumentPointee;\nusing ::testing::StrictMock;\nusing ::testing::WithArgs;\n\nnamespace {\n\nconst int kDataSize = 1024;\nconst char kHttpUrl[] = \"http:\/\/test\";\nconst char kHttpsUrl[] = \"https:\/\/test\";\nconst char kFileUrl[] = \"file:\/\/test\";\nconst char kDataUrl[] =\n    \"data:text\/plain;base64,YWJjZGVmZ2hpamtsbW5vcHFyc3R1dnd4eXoK\";\nconst char kDataUrlDecoded[] = \"abcdefghijklmnopqrstuvwxyz\";\nconst char kInvalidUrl[] = \"whatever:\/\/test\";\n\n}  \/\/ namespace\n\nnamespace webkit_glue {\n\nclass SimpleDataSourceTest : public testing::Test {\n public:\n  SimpleDataSourceTest() {\n    bridge_factory_.reset(\n        new NiceMock<MockMediaResourceLoaderBridgeFactory>());\n    bridge_.reset(new NiceMock<MockResourceLoaderBridge>());\n    factory_ = SimpleDataSource::CreateFactory(MessageLoop::current(),\n                                               bridge_factory_.get());\n\n    for (int i = 0; i < kDataSize; ++i) {\n      data_[i] = i;\n    }\n  }\n\n  virtual ~SimpleDataSourceTest() {\n    if (bridge_.get()) {\n      EXPECT_CALL(*bridge_, OnDestroy());\n    }\n  }\n\n  void InitializeDataSource(const char* url) {\n    media::MediaFormat url_format;\n    url_format.SetAsString(media::MediaFormat::kMimeType,\n                           media::mime_type::kURL);\n    url_format.SetAsString(media::MediaFormat::kURL, url);\n    data_source_ = factory_->Create<SimpleDataSource>(url_format);\n    CHECK(data_source_);\n\n    \/\/ There is no need to provide a message loop to data source.\n    data_source_->set_host(&host_);\n\n    \/\/ First a bridge is created.\n    InSequence s;\n    EXPECT_CALL(*bridge_factory_, CreateBridge(GURL(url), _, -1, -1))\n        .WillOnce(Return(bridge_.get()));\n    EXPECT_CALL(*bridge_, Start(data_source_.get()))\n        .WillOnce(Return(true));\n\n    data_source_->Initialize(url, callback_.NewCallback());\n\n    MessageLoop::current()->RunAllPending();\n  }\n\n  void RequestSucceeded(bool is_loaded) {\n    ResourceLoaderBridge::ResponseInfo info;\n    info.content_length = kDataSize;\n\n    data_source_->OnReceivedResponse(info, false);\n    int64 size;\n    EXPECT_TRUE(data_source_->GetSize(&size));\n    EXPECT_EQ(kDataSize, size);\n\n    for (int i = 0; i < kDataSize; ++i)\n      data_source_->OnReceivedData(data_ + i, 1);\n\n    EXPECT_CALL(host_, SetLoaded(is_loaded));\n\n    InSequence s;\n    EXPECT_CALL(*bridge_, OnDestroy())\n        .WillOnce(Invoke(this, &SimpleDataSourceTest::ReleaseBridge));\n    EXPECT_CALL(host_, SetTotalBytes(kDataSize));\n    EXPECT_CALL(host_, SetBufferedBytes(kDataSize));\n    EXPECT_CALL(callback_, OnFilterCallback());\n    EXPECT_CALL(callback_, OnCallbackDestroyed());\n\n    URLRequestStatus status;\n    status.set_status(URLRequestStatus::SUCCESS);\n    status.set_os_error(0);\n    data_source_->OnCompletedRequest(status, \"\");\n\n    \/\/ Let the tasks to be executed.\n    MessageLoop::current()->RunAllPending();\n  }\n\n  void RequestFailed() {\n    InSequence s;\n    EXPECT_CALL(*bridge_, OnDestroy())\n        .WillOnce(Invoke(this, &SimpleDataSourceTest::ReleaseBridge));\n    EXPECT_CALL(host_, SetError(media::PIPELINE_ERROR_NETWORK));\n    EXPECT_CALL(callback_, OnFilterCallback());\n    EXPECT_CALL(callback_, OnCallbackDestroyed());\n\n    URLRequestStatus status;\n    status.set_status(URLRequestStatus::FAILED);\n    status.set_os_error(100);\n    data_source_->OnCompletedRequest(status, \"\");\n\n    \/\/ Let the tasks to be executed.\n    MessageLoop::current()->RunAllPending();\n  }\n\n  void DestroyDataSource() {\n    EXPECT_CALL(*bridge_factory_, OnDestroy())\n        .WillOnce(Invoke(this, &SimpleDataSourceTest::ReleaseBridgeFactory));\n\n    data_source_->Stop();\n    MessageLoop::current()->RunAllPending();\n\n    data_source_ = NULL;\n  }\n\n  void AsyncRead() {\n    for (int i = 0; i < kDataSize; ++i) {\n      uint8 buffer[1];\n\n      EXPECT_CALL(*this, ReadCallback(1));\n      data_source_->Read(\n          i, 1, buffer,\n          NewCallback(this, &SimpleDataSourceTest::ReadCallback));\n      EXPECT_EQ(static_cast<uint8>(data_[i]), buffer[0]);\n    }\n  }\n\n  void ReleaseBridge() {\n    bridge_.release();\n  }\n\n  void ReleaseBridgeFactory() {\n    bridge_factory_.release();\n  }\n\n  MOCK_METHOD1(ReadCallback, void(size_t size));\n\n protected:\n  scoped_ptr<MessageLoop> message_loop_;\n  scoped_ptr<NiceMock<MockMediaResourceLoaderBridgeFactory> > bridge_factory_;\n  scoped_ptr<NiceMock<MockResourceLoaderBridge> > bridge_;\n  scoped_refptr<media::FilterFactory> factory_;\n  scoped_refptr<SimpleDataSource> data_source_;\n  StrictMock<media::MockFilterHost> host_;\n  StrictMock<media::MockFilterCallback> callback_;\n  char data_[kDataSize];\n\n  DISALLOW_COPY_AND_ASSIGN(SimpleDataSourceTest);\n};\n\nTEST_F(SimpleDataSourceTest, InitializeHTTP) {\n  InitializeDataSource(kHttpUrl);\n  RequestSucceeded(false);\n  DestroyDataSource();\n}\n\nTEST_F(SimpleDataSourceTest, InitializeHTTPS) {\n  InitializeDataSource(kHttpsUrl);\n  RequestSucceeded(false);\n  DestroyDataSource();\n}\n\nTEST_F(SimpleDataSourceTest, InitializeFile) {\n  InitializeDataSource(kFileUrl);\n  RequestSucceeded(true);\n  DestroyDataSource();\n}\n\nTEST_F(SimpleDataSourceTest, InitializeData) {\n  \/\/ Bridge is not used at all.\n  ReleaseBridge();\n\n  media::MediaFormat url_format;\n  url_format.SetAsString(media::MediaFormat::kMimeType,\n                         media::mime_type::kURL);\n  url_format.SetAsString(media::MediaFormat::kURL, kDataUrl);\n  data_source_ = factory_->Create<SimpleDataSource>(url_format);\n  CHECK(data_source_);\n\n  \/\/ There is no need to provide a message loop to data source.\n  data_source_->set_host(&host_);\n\n  EXPECT_CALL(host_, SetLoaded(true));\n  EXPECT_CALL(host_, SetTotalBytes(sizeof(kDataUrlDecoded)));\n  EXPECT_CALL(host_, SetBufferedBytes(sizeof(kDataUrlDecoded)));\n  EXPECT_CALL(callback_, OnFilterCallback());\n  EXPECT_CALL(callback_, OnCallbackDestroyed());\n\n  data_source_->Initialize(kDataUrl, callback_.NewCallback());\n  MessageLoop::current()->RunAllPending();\n\n  DestroyDataSource();\n}\n\nTEST_F(SimpleDataSourceTest, InitializeInvalid) {\n  \/\/ They are not used at all.\n  ReleaseBridge();\n  ReleaseBridgeFactory();\n\n  media::MediaFormat url_format;\n  url_format.SetAsString(media::MediaFormat::kMimeType,\n                         media::mime_type::kURL);\n  url_format.SetAsString(media::MediaFormat::kURL, kInvalidUrl);\n  data_source_ = factory_->Create<SimpleDataSource>(url_format);\n  EXPECT_FALSE(data_source_);\n}\n\nTEST_F(SimpleDataSourceTest, RequestFailed) {\n  InitializeDataSource(kHttpUrl);\n  RequestFailed();\n  DestroyDataSource();\n}\n\nTEST_F(SimpleDataSourceTest, StopWhenDownloading) {\n  InitializeDataSource(kHttpUrl);\n\n  EXPECT_CALL(*bridge_, Cancel());\n  EXPECT_CALL(*bridge_, OnDestroy())\n      .WillOnce(Invoke(this, &SimpleDataSourceTest::ReleaseBridge));\n  EXPECT_CALL(callback_, OnCallbackDestroyed());\n  DestroyDataSource();\n}\n\nTEST_F(SimpleDataSourceTest, AsyncRead) {\n  InitializeDataSource(kFileUrl);\n  RequestSucceeded(true);\n  AsyncRead();\n  DestroyDataSource();\n}\n\n}  \/\/ namespace webkit_glue\n<commit_msg>Fixed valgrind breakage by r29848<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 \"media\/base\/filters.h\"\n#include \"media\/base\/mock_filter_host.h\"\n#include \"media\/base\/mock_filters.h\"\n#include \"webkit\/glue\/media\/mock_media_resource_loader_bridge_factory.h\"\n#include \"webkit\/glue\/media\/simple_data_source.h\"\n#include \"webkit\/glue\/mock_resource_loader_bridge.h\"\n\nusing ::testing::_;\nusing ::testing::DoAll;\nusing ::testing::InSequence;\nusing ::testing::Invoke;\nusing ::testing::NiceMock;\nusing ::testing::NotNull;\nusing ::testing::Return;\nusing ::testing::SetArgumentPointee;\nusing ::testing::StrictMock;\nusing ::testing::WithArgs;\n\nnamespace {\n\nconst int kDataSize = 1024;\nconst char kHttpUrl[] = \"http:\/\/test\";\nconst char kHttpsUrl[] = \"https:\/\/test\";\nconst char kFileUrl[] = \"file:\/\/test\";\nconst char kDataUrl[] =\n    \"data:text\/plain;base64,YWJjZGVmZ2hpamtsbW5vcHFyc3R1dnd4eXoK\";\nconst char kDataUrlDecoded[] = \"abcdefghijklmnopqrstuvwxyz\";\nconst char kInvalidUrl[] = \"whatever:\/\/test\";\n\n}  \/\/ namespace\n\nnamespace webkit_glue {\n\nclass SimpleDataSourceTest : public testing::Test {\n public:\n  SimpleDataSourceTest() {\n    bridge_factory_.reset(\n        new NiceMock<MockMediaResourceLoaderBridgeFactory>());\n    bridge_.reset(new NiceMock<MockResourceLoaderBridge>());\n    factory_ = SimpleDataSource::CreateFactory(MessageLoop::current(),\n                                               bridge_factory_.get());\n\n    for (int i = 0; i < kDataSize; ++i) {\n      data_[i] = i;\n    }\n  }\n\n  virtual ~SimpleDataSourceTest() {\n    if (bridge_.get())\n      EXPECT_CALL(*bridge_, OnDestroy());\n    if (bridge_factory_.get())\n      EXPECT_CALL(*bridge_factory_, OnDestroy());\n  }\n\n  void InitializeDataSource(const char* url) {\n    media::MediaFormat url_format;\n    url_format.SetAsString(media::MediaFormat::kMimeType,\n                           media::mime_type::kURL);\n    url_format.SetAsString(media::MediaFormat::kURL, url);\n    data_source_ = factory_->Create<SimpleDataSource>(url_format);\n    CHECK(data_source_);\n\n    \/\/ There is no need to provide a message loop to data source.\n    data_source_->set_host(&host_);\n\n    \/\/ First a bridge is created.\n    InSequence s;\n    EXPECT_CALL(*bridge_factory_, CreateBridge(GURL(url), _, -1, -1))\n        .WillOnce(Return(bridge_.get()));\n    EXPECT_CALL(*bridge_, Start(data_source_.get()))\n        .WillOnce(Return(true));\n\n    data_source_->Initialize(url, callback_.NewCallback());\n\n    MessageLoop::current()->RunAllPending();\n  }\n\n  void RequestSucceeded(bool is_loaded) {\n    ResourceLoaderBridge::ResponseInfo info;\n    info.content_length = kDataSize;\n\n    data_source_->OnReceivedResponse(info, false);\n    int64 size;\n    EXPECT_TRUE(data_source_->GetSize(&size));\n    EXPECT_EQ(kDataSize, size);\n\n    for (int i = 0; i < kDataSize; ++i)\n      data_source_->OnReceivedData(data_ + i, 1);\n\n    EXPECT_CALL(host_, SetLoaded(is_loaded));\n\n    InSequence s;\n    EXPECT_CALL(*bridge_, OnDestroy())\n        .WillOnce(Invoke(this, &SimpleDataSourceTest::ReleaseBridge));\n    EXPECT_CALL(host_, SetTotalBytes(kDataSize));\n    EXPECT_CALL(host_, SetBufferedBytes(kDataSize));\n    EXPECT_CALL(callback_, OnFilterCallback());\n    EXPECT_CALL(callback_, OnCallbackDestroyed());\n\n    URLRequestStatus status;\n    status.set_status(URLRequestStatus::SUCCESS);\n    status.set_os_error(0);\n    data_source_->OnCompletedRequest(status, \"\");\n\n    \/\/ Let the tasks to be executed.\n    MessageLoop::current()->RunAllPending();\n  }\n\n  void RequestFailed() {\n    InSequence s;\n    EXPECT_CALL(*bridge_, OnDestroy())\n        .WillOnce(Invoke(this, &SimpleDataSourceTest::ReleaseBridge));\n    EXPECT_CALL(host_, SetError(media::PIPELINE_ERROR_NETWORK));\n    EXPECT_CALL(callback_, OnFilterCallback());\n    EXPECT_CALL(callback_, OnCallbackDestroyed());\n\n    URLRequestStatus status;\n    status.set_status(URLRequestStatus::FAILED);\n    status.set_os_error(100);\n    data_source_->OnCompletedRequest(status, \"\");\n\n    \/\/ Let the tasks to be executed.\n    MessageLoop::current()->RunAllPending();\n  }\n\n  void DestroyDataSource() {\n    EXPECT_CALL(*bridge_factory_, OnDestroy())\n        .WillOnce(Invoke(this, &SimpleDataSourceTest::ReleaseBridgeFactory));\n\n    data_source_->Stop();\n    MessageLoop::current()->RunAllPending();\n\n    data_source_ = NULL;\n  }\n\n  void AsyncRead() {\n    for (int i = 0; i < kDataSize; ++i) {\n      uint8 buffer[1];\n\n      EXPECT_CALL(*this, ReadCallback(1));\n      data_source_->Read(\n          i, 1, buffer,\n          NewCallback(this, &SimpleDataSourceTest::ReadCallback));\n      EXPECT_EQ(static_cast<uint8>(data_[i]), buffer[0]);\n    }\n  }\n\n  void ReleaseBridge() {\n    bridge_.release();\n  }\n\n  void ReleaseBridgeFactory() {\n    bridge_factory_.release();\n  }\n\n  MOCK_METHOD1(ReadCallback, void(size_t size));\n\n protected:\n  scoped_ptr<MessageLoop> message_loop_;\n  scoped_ptr<NiceMock<MockMediaResourceLoaderBridgeFactory> > bridge_factory_;\n  scoped_ptr<NiceMock<MockResourceLoaderBridge> > bridge_;\n  scoped_refptr<media::FilterFactory> factory_;\n  scoped_refptr<SimpleDataSource> data_source_;\n  StrictMock<media::MockFilterHost> host_;\n  StrictMock<media::MockFilterCallback> callback_;\n  char data_[kDataSize];\n\n  DISALLOW_COPY_AND_ASSIGN(SimpleDataSourceTest);\n};\n\nTEST_F(SimpleDataSourceTest, InitializeHTTP) {\n  InitializeDataSource(kHttpUrl);\n  RequestSucceeded(false);\n  DestroyDataSource();\n}\n\nTEST_F(SimpleDataSourceTest, InitializeHTTPS) {\n  InitializeDataSource(kHttpsUrl);\n  RequestSucceeded(false);\n  DestroyDataSource();\n}\n\nTEST_F(SimpleDataSourceTest, InitializeFile) {\n  InitializeDataSource(kFileUrl);\n  RequestSucceeded(true);\n  DestroyDataSource();\n}\n\nTEST_F(SimpleDataSourceTest, InitializeData) {\n  media::MediaFormat url_format;\n  url_format.SetAsString(media::MediaFormat::kMimeType,\n                         media::mime_type::kURL);\n  url_format.SetAsString(media::MediaFormat::kURL, kDataUrl);\n  data_source_ = factory_->Create<SimpleDataSource>(url_format);\n  CHECK(data_source_);\n\n  \/\/ There is no need to provide a message loop to data source.\n  data_source_->set_host(&host_);\n\n  EXPECT_CALL(host_, SetLoaded(true));\n  EXPECT_CALL(host_, SetTotalBytes(sizeof(kDataUrlDecoded)));\n  EXPECT_CALL(host_, SetBufferedBytes(sizeof(kDataUrlDecoded)));\n  EXPECT_CALL(callback_, OnFilterCallback());\n  EXPECT_CALL(callback_, OnCallbackDestroyed());\n\n  data_source_->Initialize(kDataUrl, callback_.NewCallback());\n  MessageLoop::current()->RunAllPending();\n\n  DestroyDataSource();\n}\n\nTEST_F(SimpleDataSourceTest, InitializeInvalid) {\n  media::MediaFormat url_format;\n  url_format.SetAsString(media::MediaFormat::kMimeType,\n                         media::mime_type::kURL);\n  url_format.SetAsString(media::MediaFormat::kURL, kInvalidUrl);\n  data_source_ = factory_->Create<SimpleDataSource>(url_format);\n  EXPECT_FALSE(data_source_);\n}\n\nTEST_F(SimpleDataSourceTest, RequestFailed) {\n  InitializeDataSource(kHttpUrl);\n  RequestFailed();\n  DestroyDataSource();\n}\n\nTEST_F(SimpleDataSourceTest, StopWhenDownloading) {\n  InitializeDataSource(kHttpUrl);\n\n  EXPECT_CALL(*bridge_, Cancel());\n  EXPECT_CALL(*bridge_, OnDestroy())\n      .WillOnce(Invoke(this, &SimpleDataSourceTest::ReleaseBridge));\n  EXPECT_CALL(callback_, OnCallbackDestroyed());\n  DestroyDataSource();\n}\n\nTEST_F(SimpleDataSourceTest, AsyncRead) {\n  InitializeDataSource(kFileUrl);\n  RequestSucceeded(true);\n  AsyncRead();\n  DestroyDataSource();\n}\n\n}  \/\/ namespace webkit_glue\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: uiservices.cxx,v $\n *\n *  $Revision: 1.23 $\n *\n *  last change: $Author: obo $ $Date: 2006-10-12 13: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_dbaccess.hxx\"\n\n#ifndef _CPPUHELPER_FACTORY_HXX_\n#include <cppuhelper\/factory.hxx>\n#endif\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n#ifndef _DBU_REGHELPER_HXX_\n#include \"dbu_reghelper.hxx\"\n#endif\n\n\/********************************************************************************************\/\n\nusing namespace ::rtl;\nusing namespace ::dbaui;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::registry;\n\n\/\/***************************************************************************************\n\/\/\n\/\/ registry functions\nextern \"C\" void SAL_CALL createRegistryInfo_OTableFilterDialog();\nextern \"C\" void SAL_CALL createRegistryInfo_ODataSourcePropertyDialog();\nextern \"C\" void SAL_CALL createRegistryInfo_OSQLMessageDialog();\nextern \"C\" void SAL_CALL createRegistryInfo_OBrowser();\nextern \"C\" void SAL_CALL createRegistryInfo_OFormGridView();\nextern \"C\" void SAL_CALL createRegistryInfo_DBContentLoader();\nextern \"C\" void SAL_CALL writeDBLoaderInfo(void* pRegistryKey);\nextern \"C\" void SAL_CALL createRegistryInfo_OInteractionHandler();\nextern \"C\" void SAL_CALL createRegistryInfo_SbaXGridControl();\nextern \"C\" void SAL_CALL createRegistryInfo_OQueryControl();\nextern \"C\" void SAL_CALL createRegistryInfo_OTableControl();\nextern \"C\" void SAL_CALL createRegistryInfo_ORelationControl();\nextern \"C\" void SAL_CALL createRegistryInfo_ComposerDialogs();\nextern \"C\" void SAL_CALL createRegistryInfo_ODBApplication();\nextern \"C\" void SAL_CALL createRegistryInfo_ODirectSQLDialog();\nextern \"C\" void SAL_CALL createRegistryInfo_OAdvancedSettingsDialog();\nextern \"C\" void SAL_CALL createRegistryInfo_ODBTypeWizDialog();\nextern \"C\" void SAL_CALL createRegistryInfo_OUserSettingsDialog();\nextern \"C\" void SAL_CALL createRegistryInfo_ODBTypeWizDialogSetup();\nextern \"C\" void SAL_CALL createRegistryInfo_OAdabasSettingsDialog();\nextern \"C\" void SAL_CALL createRegistryInfo_OColumnControlModel();\nextern \"C\" void SAL_CALL createRegistryInfo_OColumnControl();\nextern \"C\" void SAL_CALL createRegistryInfo_OToolboxController();\nextern \"C\" void SAL_CALL createRegistryInfo_OStatusbarController();\n\n\/\/***************************************************************************************\nextern \"C\" void SAL_CALL createRegistryInfo_DBU()\n{\n    static sal_Bool bInit = sal_False;\n    if (!bInit)\n    {\n        createRegistryInfo_OTableFilterDialog();\n        createRegistryInfo_ODataSourcePropertyDialog();\n        createRegistryInfo_OSQLMessageDialog();\n        createRegistryInfo_OBrowser();\n        createRegistryInfo_OFormGridView();\n        createRegistryInfo_DBContentLoader();\n        createRegistryInfo_OInteractionHandler();\n        createRegistryInfo_SbaXGridControl();\n        createRegistryInfo_OQueryControl();\n        createRegistryInfo_OTableControl();\n        createRegistryInfo_ORelationControl();\n        createRegistryInfo_ComposerDialogs();\n        createRegistryInfo_ODBApplication();\n        createRegistryInfo_ODirectSQLDialog();\n        createRegistryInfo_OAdvancedSettingsDialog();\n        createRegistryInfo_ODBTypeWizDialog();\n        createRegistryInfo_ODBTypeWizDialogSetup();\n            createRegistryInfo_OUserSettingsDialog();\n        createRegistryInfo_OAdabasSettingsDialog();\n        createRegistryInfo_OColumnControlModel();\n        createRegistryInfo_OColumnControl();\n        createRegistryInfo_OToolboxController();\n        createRegistryInfo_OStatusbarController();\n        bInit = sal_True;\n    }\n}\n\n\/\/---------------------------------------------------------------------------------------\n\nextern \"C\" void SAL_CALL component_getImplementationEnvironment(\n                const sal_Char  **ppEnvTypeName,\n                uno_Environment **\n            )\n{\n    createRegistryInfo_DBU();\n    *ppEnvTypeName = CPPU_CURRENT_LANGUAGE_BINDING_NAME;\n}\n\n\/\/---------------------------------------------------------------------------------------\nextern \"C\" sal_Bool SAL_CALL component_writeInfo(\n                void* pServiceManager,\n                void* pRegistryKey\n            )\n{\n    if (pRegistryKey)\n    try\n    {\n        writeDBLoaderInfo(pRegistryKey);\n        return ::dbaui::OModuleRegistration::writeComponentInfos(\n            static_cast<XMultiServiceFactory*>(pServiceManager),\n            static_cast<XRegistryKey*>(pRegistryKey));\n    }\n    catch (InvalidRegistryException& )\n    {\n        OSL_ENSURE(sal_False, \"DBA::component_writeInfo : could not create a registry key ! ## InvalidRegistryException !\");\n    }\n\n    return sal_False;\n}\n\n\/\/---------------------------------------------------------------------------------------\nextern \"C\" void* SAL_CALL component_getFactory(\n                    const sal_Char* pImplementationName,\n                    void* pServiceManager,\n                    void* \/*pRegistryKey*\/)\n{\n    Reference< XInterface > xRet;\n    if (pServiceManager && pImplementationName)\n    {\n        xRet = ::dbaui::OModuleRegistration::getComponentFactory(\n            ::rtl::OUString::createFromAscii(pImplementationName),\n            static_cast< XMultiServiceFactory* >(pServiceManager));\n    }\n\n    if (xRet.is())\n        xRet->acquire();\n    return xRet.get();\n};\n<commit_msg>INTEGRATION: CWS oj14 (1.19.8); FILE MERGED 2006\/11\/07 09:33:33 oj 1.19.8.3: RESYNC: (1.20-1.23); FILE MERGED 2006\/07\/04 08:15:57 oj 1.19.8.2: RESYNC: (1.19-1.20); FILE MERGED 2006\/01\/03 07:49:22 oj 1.19.8.1: changed module client<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: uiservices.cxx,v $\n *\n *  $Revision: 1.24 $\n *\n *  last change: $Author: rt $ $Date: 2007-07-06 08:38: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_dbaccess.hxx\"\n\n#ifndef _CPPUHELPER_FACTORY_HXX_\n#include <cppuhelper\/factory.hxx>\n#endif\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n#ifndef _DBU_REGHELPER_HXX_\n#include \"dbu_reghelper.hxx\"\n#endif\n#ifndef INCLUDED_DBACCESSDLLAPI_H\n#include \"dbaccessdllapi.h\"\n#endif\n\n\/********************************************************************************************\/\n\nusing namespace ::rtl;\nusing namespace ::dbaui;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::registry;\n\n\/\/***************************************************************************************\n\/\/\n\/\/ registry functions\nextern \"C\" void SAL_CALL createRegistryInfo_OTableFilterDialog();\nextern \"C\" void SAL_CALL createRegistryInfo_ODataSourcePropertyDialog();\nextern \"C\" void SAL_CALL createRegistryInfo_OSQLMessageDialog();\nextern \"C\" void SAL_CALL createRegistryInfo_OBrowser();\nextern \"C\" void SAL_CALL createRegistryInfo_OFormGridView();\nextern \"C\" void SAL_CALL createRegistryInfo_DBContentLoader();\nextern \"C\" void SAL_CALL writeDBLoaderInfo(void* pRegistryKey);\nextern \"C\" void SAL_CALL createRegistryInfo_OInteractionHandler();\nextern \"C\" void SAL_CALL createRegistryInfo_SbaXGridControl();\nextern \"C\" void SAL_CALL createRegistryInfo_OQueryControl();\nextern \"C\" void SAL_CALL createRegistryInfo_OTableControl();\nextern \"C\" void SAL_CALL createRegistryInfo_ORelationControl();\nextern \"C\" void SAL_CALL createRegistryInfo_ComposerDialogs();\nextern \"C\" void SAL_CALL createRegistryInfo_ODBApplication();\nextern \"C\" void SAL_CALL createRegistryInfo_ODirectSQLDialog();\nextern \"C\" void SAL_CALL createRegistryInfo_OAdvancedSettingsDialog();\nextern \"C\" void SAL_CALL createRegistryInfo_ODBTypeWizDialog();\nextern \"C\" void SAL_CALL createRegistryInfo_OUserSettingsDialog();\nextern \"C\" void SAL_CALL createRegistryInfo_ODBTypeWizDialogSetup();\nextern \"C\" void SAL_CALL createRegistryInfo_OAdabasSettingsDialog();\nextern \"C\" void SAL_CALL createRegistryInfo_OColumnControlModel();\nextern \"C\" void SAL_CALL createRegistryInfo_OColumnControl();\nextern \"C\" void SAL_CALL createRegistryInfo_OToolboxController();\nextern \"C\" void SAL_CALL createRegistryInfo_OStatusbarController();\n\n\/\/***************************************************************************************\nextern \"C\" void SAL_CALL createRegistryInfo_DBU()\n{\n    static sal_Bool bInit = sal_False;\n    if (!bInit)\n    {\n        createRegistryInfo_OTableFilterDialog();\n        createRegistryInfo_ODataSourcePropertyDialog();\n        createRegistryInfo_OSQLMessageDialog();\n        createRegistryInfo_OBrowser();\n        createRegistryInfo_OFormGridView();\n        createRegistryInfo_DBContentLoader();\n        createRegistryInfo_OInteractionHandler();\n        createRegistryInfo_SbaXGridControl();\n        createRegistryInfo_OQueryControl();\n        createRegistryInfo_OTableControl();\n        createRegistryInfo_ORelationControl();\n        createRegistryInfo_ComposerDialogs();\n        createRegistryInfo_ODBApplication();\n        createRegistryInfo_ODirectSQLDialog();\n        createRegistryInfo_OAdvancedSettingsDialog();\n        createRegistryInfo_ODBTypeWizDialog();\n        createRegistryInfo_ODBTypeWizDialogSetup();\n            createRegistryInfo_OUserSettingsDialog();\n        createRegistryInfo_OAdabasSettingsDialog();\n        createRegistryInfo_OColumnControlModel();\n        createRegistryInfo_OColumnControl();\n        createRegistryInfo_OToolboxController();\n        createRegistryInfo_OStatusbarController();\n        bInit = sal_True;\n    }\n}\n\n\/\/---------------------------------------------------------------------------------------\n\nextern \"C\" DBACCESS_DLLPUBLIC void SAL_CALL component_getImplementationEnvironment(\n                const sal_Char  **ppEnvTypeName,\n                uno_Environment **\n            )\n{\n    createRegistryInfo_DBU();\n    *ppEnvTypeName = CPPU_CURRENT_LANGUAGE_BINDING_NAME;\n}\n\n\/\/---------------------------------------------------------------------------------------\nextern \"C\" DBACCESS_DLLPUBLIC sal_Bool SAL_CALL component_writeInfo(\n                void* pServiceManager,\n                void* pRegistryKey\n            )\n{\n    if (pRegistryKey)\n    try\n    {\n        writeDBLoaderInfo(pRegistryKey);\n        return ::dbaui::OModuleRegistration::writeComponentInfos(\n            static_cast<XMultiServiceFactory*>(pServiceManager),\n            static_cast<XRegistryKey*>(pRegistryKey));\n    }\n    catch (InvalidRegistryException& )\n    {\n        OSL_ENSURE(sal_False, \"DBA::component_writeInfo : could not create a registry key ! ## InvalidRegistryException !\");\n    }\n\n    return sal_False;\n}\n\n\/\/---------------------------------------------------------------------------------------\nextern \"C\" DBACCESS_DLLPUBLIC void* SAL_CALL component_getFactory(\n                    const sal_Char* pImplementationName,\n                    void* pServiceManager,\n                    void* \/*pRegistryKey*\/)\n{\n    Reference< XInterface > xRet;\n    if (pServiceManager && pImplementationName)\n    {\n        xRet = ::dbaui::OModuleRegistration::getComponentFactory(\n            ::rtl::OUString::createFromAscii(pImplementationName),\n            static_cast< XMultiServiceFactory* >(pServiceManager));\n    }\n\n    if (xRet.is())\n        xRet->acquire();\n    return xRet.get();\n};\n<|endoftext|>"}
{"text":"<commit_before>\/* $Id$ *\/\n\/* Copyright W. Bangerth, University of Heidelberg, 1990 *\/\n\n\n#include <fe\/fe_system.h>\n\n\n\n\n\ntemplate <int dim>\nFESystem<dim>::~FESystem ()\n{\n  for (unsigned i=0;i<base_elements.size();++i)\n    {\n      base_elements[i].first -> unsubscribe ();\n      delete base_elements[i].first;\n    }\n};\n\n\n\ntemplate <int dim>\nvoid FESystem<dim>::initialize ()\n{\n\t\t\t\t   \/\/ Initialize index table\n\t\t\t\t   \/\/ Multi-component base elements have to be thought of.\n\t\t\t\t   \/\/ 1. Vertices\n  unsigned total_index = 0;\n  for (unsigned vertex_number= 0 ; vertex_number < GeometryInfo<2>::vertices_per_cell ;\n       ++vertex_number)\n    {\n      unsigned comp_start = 0;\n      for(unsigned comp = 0; comp < n_component_elements() ;\n\t  ++comp)\n\t{\n\t  for (unsigned m = 0; m < element_multiplicity(comp); ++m)\n\t    {\n\t      for (unsigned local_index = 0 ;\n\t\t   local_index < base_element(comp).dofs_per_vertex ;\n\t\t   ++local_index)\n\t\t{\n\t\t  cerr << \"V(sys, comp, m, loc) = (\"\n\t\t       << total_index << \",\" << comp << \",\" << m << \",\" << local_index << \")\" << endl;\n\t\t  system_to_component_table[total_index++]\n\t\t    = pair<unsigned,unsigned>\n\t\t    (comp_start+m,\n\t\t     vertex_number*base_element(comp).dofs_per_vertex+local_index);\n\t\t}\n\t    }\n\t  comp_start += element_multiplicity(comp);\n\t}\n    }\n  \n\t\t\t\t   \/\/ 2. Lines\n  for (unsigned line_number= 0 ; line_number < GeometryInfo<2>::lines_per_cell ;\n       ++line_number)\n    {\n      unsigned comp_start = 0;\n      for(unsigned comp = 0; comp < n_component_elements() ;\n\t  ++comp)\n\t{\n\t  for (unsigned m = 0; m < element_multiplicity(comp); ++m)\n\t    {\n\t      for (unsigned local_index = 0 ;\n\t\t   local_index < base_element(comp).dofs_per_line ;\n\t\t   ++local_index)\n\t\t{\n\t\t  cerr << \"L(sys, comp, m, loc) = (\"\n\t\t       << total_index << \",\" << comp << \",\" << m << \",\" << local_index << \")\" << endl;\n\t\t  system_to_component_table[total_index++]\n\t\t    = pair<unsigned,unsigned>\n\t\t    (comp_start+m,\n\t\t     line_number*base_element(comp).dofs_per_line\n\t\t     +local_index+base_element(comp).first_line_index);\n\t\t}\n\t    }\n\t  comp_start += element_multiplicity(comp);\n\t}\n    }\n  \n\t\t\t\t   \/\/ 3. Quads\n  for (unsigned quad_number= 0 ; quad_number < GeometryInfo<2>::quads_per_cell ;\n       ++quad_number)\n    {\n      unsigned comp_start = 0;\n      for(unsigned comp = 0; comp < n_component_elements() ;\n\t  ++comp)\n\t{\n\t  for (unsigned m = 0; m < element_multiplicity(comp); ++m)\n\t    {\n\t      for (unsigned local_index = 0 ;\n\t\t   local_index < base_element(comp).dofs_per_quad ;\n\t\t   ++local_index)\n\t\t{\n\t\t  cerr << \"Q(sys, comp, m, loc) = (\"\n\t\t       << total_index << \",\" << comp << \",\" << m << \",\" << local_index << \")\" << endl;\n\t\t  system_to_component_table[total_index++]\n\t\t    = pair<unsigned,unsigned>\n\t\t    (comp_start+m,\n\t\t     quad_number*base_element(comp).dofs_per_quad\n\t\t     +local_index+base_element(comp).first_quad_index);\n\t\t}\n\t    }\n\t  comp_start += element_multiplicity(comp);\n\t}\n    }\n  \n\t\t\t\t   \/\/ 4. Hex\n  for (unsigned hex_number= 0 ; hex_number < GeometryInfo<2>::hexes_per_cell ;\n       ++hex_number)\n    {\n      unsigned comp_start = 0;\n      for(unsigned comp = 0; comp < n_component_elements() ;\n\t  ++comp, comp_start += element_multiplicity(comp))\n\t{\n\t  for (unsigned m = 0; m < element_multiplicity(comp); ++m)\n\t    {\n\t      for (unsigned local_index = 0 ;\n\t\t   local_index < base_element(comp).dofs_per_hex ;\n\t\t   ++local_index)\n\t\t{\n\t\t  cerr << \"Q(sys, comp, m, loc) = (\"\n\t\t       << total_index << \",\" << comp << \",\" << m << \",\" << local_index << \")\" << endl;\n\t\t  system_to_component_table[total_index++]\n\t\t    = pair<unsigned,unsigned>\n\t\t    (comp_start+m,\n\t\t     hex_number*base_element(comp).dofs_per_hex\n\t\t     +local_index+base_element(comp).first_hex_index);\n\t\t}\n\t    }\n\t}\n    }\n  \n  \n\n\t\t\t\t   \/\/ distribute the matrices of the base\n\t\t\t\t   \/\/ finite element to the matrices of\n\t\t\t\t   \/\/ this object\n\/*  for (unsigned int i=0; i<base_element->total_dofs; ++i)\n    for (unsigned int j=0; j<base_element->total_dofs; ++j)\n      for (unsigned int n=0; n<n_sub_elements; ++n)\n\t\t\t\t\t \/\/ only fill diagonals of the blocks\n\t{\n\t  for (unsigned int child=0; child<GeometryInfo<dim>::children_per_cell; ++child)\n\t    {\n\t      restriction[child] (i*n_sub_elements + n,\n\t\t\t\t  j*n_sub_elements + n)\n\t\t= base_element->restrict(child)(i,j);\n\t      prolongation[child] (i*n_sub_elements + n,\n\t\t\t\t   j*n_sub_elements + n)\n\t\t= base_element->prolongate(child)(i,j);\n\t    };\n\n\t  interface_constraints (i*n_sub_elements + n,\n\t\t\t\t j*n_sub_elements + n)\n\t    = base_element->constraints()(i,j);\n\t};\n*\/};\n\n\n\n\n#if deal_II_dimension == 1\n\ntemplate <>\nFiniteElementData<1>\nFESystem<1>::multiply_dof_numbers (const FiniteElementData<1> &fe_data,\n\t\t\t\t   const unsigned int          N)\n{\n  return FiniteElementData<1> (fe_data.dofs_per_vertex * N,\n\t\t\t       fe_data.dofs_per_line * N,\n\t\t\t       fe_data.n_transform_functions,\n\t\t\t       fe_data.n_components * N);\n};\n\ntemplate <>\nFiniteElementData<1>\nFESystem<1>::multiply_dof_numbers (const FiniteElementData<1> &fe1,\n\t\t\t\t   const unsigned int          N1,\n\t\t\t\t   const FiniteElementData<1> &fe2,\n\t\t\t\t   const unsigned int          N2)\n{\n  return FiniteElementData<1> (fe1.dofs_per_vertex * N1 + fe2.dofs_per_vertex * N2 ,\n\t\t\t       fe1.dofs_per_line * N1 + fe2.dofs_per_line * N2 ,\n\t\t\t       fe1.n_transform_functions + fe2.n_transform_functions ,\n\t\t\t       fe1.n_components * N1 + fe2.n_components * N2 );\n};\n\n#endif\n\n\n#if deal_II_dimension == 2\n\ntemplate <>\nFiniteElementData<2>\nFESystem<2>::multiply_dof_numbers (const FiniteElementData<2> &fe_data,\n\t\t\t\t   const unsigned int          N)\n{\n  return FiniteElementData<2> (fe_data.dofs_per_vertex * N,\n\t\t\t       fe_data.dofs_per_line * N,\n\t\t\t       fe_data.dofs_per_quad * N,\n\t\t\t       fe_data.n_transform_functions,\n\t\t\t       fe_data.n_components * N);\n};\n\ntemplate <>\nFiniteElementData<2>\nFESystem<2>::multiply_dof_numbers (const FiniteElementData<2> &fe1,\n\t\t\t\t   const unsigned int          N1,\n\t\t\t\t   const FiniteElementData<2> &fe2,\n\t\t\t\t   const unsigned int          N2)\n{\n  return FiniteElementData<2> (fe1.dofs_per_vertex * N1 + fe2.dofs_per_vertex * N2 ,\n\t\t\t       fe1.dofs_per_line * N1 + fe2.dofs_per_line * N2 ,\n\t\t\t       fe1.dofs_per_quad * N1 + fe2.dofs_per_quad * N2 ,\n\t\t\t       fe1.n_transform_functions + fe2.n_transform_functions ,\n\t\t\t       fe1.n_components * N1 + fe2.n_components * N2 );\n};\n\n#endif\n\n\ntemplate <int dim>\ndouble FESystem<dim>::shape_value (const unsigned int i,\n\t\t\t\t   const Point<dim>  &p) const\n{\n  Assert(false, ExcNotImplemented());\n  return 0.;\n  \n  Assert((i<total_dofs), ExcInvalidIndex(i));\n\n\n\/\/  return base_element->shape_value (i \/ n_sub_elements, p);\n};\n\n\n\ntemplate <int dim>\nTensor<1,dim>\nFESystem<dim>::shape_grad (const unsigned int  i,\n\t\t\t   const Point<dim>   &p) const\n{\n  Assert(false, ExcNotImplemented());\n  return Tensor<1,dim>();\n\n  Assert((i<total_dofs), ExcInvalidIndex(i));\n\n\/\/  return base_element->shape_grad (i \/ n_sub_elements, p);\n};\n\n\n\ntemplate <int dim>\nTensor<2,dim>\nFESystem<dim>::shape_grad_grad (const unsigned int  i,\n\t\t\t\tconst Point<dim>   &p) const\n {\n  Assert(false, ExcNotImplemented());\n  return Tensor<2,dim>();\n\n  Assert((i<total_dofs), ExcInvalidIndex(i));\n\n\/\/  return base_element->shape_grad_grad (i \/ n_sub_elements, p);\n};\n\n\n\ntemplate <int dim>\nvoid FESystem<dim>::get_unit_support_points (vector<Point<dim> > &support_points) const\n{\n\/*  Assert (support_points.size() == total_dofs,\n\t  ExcWrongFieldDimension (support_points.size(), total_dofs));\n\n  vector<Point<dim> > base_support_points (base_element->total_dofs);\n  base_element->get_unit_support_points (base_support_points);\n  \n  for (unsigned int i=0; i<base_element->total_dofs; ++i) \n    for (unsigned int n=0; n<n_sub_elements; ++n)\n      support_points[i*n_sub_elements+n] = base_support_points[i];\n*\/\n};\n\n\n\ntemplate <int dim>\nvoid FESystem<dim>::get_support_points (const DoFHandler<dim>::cell_iterator &cell,\n\t\t\t\t\tconst Boundary<dim> &boundary,\n\t\t\t\t\tvector<Point<dim> > &support_points) const\n{\n  Assert(false, ExcNotImplemented());\n\/*\n  Assert (support_points.size() == total_dofs,\n\t  ExcWrongFieldDimension (support_points.size(), total_dofs));\n\n  vector<Point<dim> > base_support_points (base_element->total_dofs);\n  base_element->get_support_points (cell, boundary, base_support_points);\n  \n  for (unsigned int i=0; i<base_element->total_dofs; ++i) \n    for (unsigned int n=0; n<n_sub_elements; ++n)\n      support_points[i*n_sub_elements+n] = base_support_points[i];\n*\/\n};\n\n\n\ntemplate <int dim>\nvoid FESystem<dim>::get_face_support_points (const DoFHandler<dim>::face_iterator &face,\n\t\t\t\t\t     const Boundary<dim> &boundary,\n\t\t\t\t\t     vector<Point<dim> > &support_points) const\n{\n  Assert(false, ExcNotImplemented());\n\/*\n  Assert (support_points.size() == dofs_per_face,\n\t  ExcWrongFieldDimension (support_points.size(), dofs_per_face));\n\n  vector<Point<dim> > base_support_points (base_element->dofs_per_face);\n  base_element->get_face_support_points (face, boundary, base_support_points);\n  \n  for (unsigned int i=0; i<base_element->dofs_per_face; ++i) \n    for (unsigned int n=0; n<n_sub_elements; ++n)\n      support_points[i*n_sub_elements+n] = base_support_points[i];\n*\/\n};\n\n\n\ntemplate <int dim>\nvoid FESystem<dim>::get_local_mass_matrix (const DoFHandler<dim>::cell_iterator &cell,\n\t\t\t\t\t   const Boundary<dim> &boundary,\n\t\t\t\t\t   dFMatrix            &local_mass_matrix) const\n{\n  Assert(false, ExcNotImplemented());\n\/*\n  Assert (local_mass_matrix.n() == total_dofs,\n\t  ExcWrongFieldDimension(local_mass_matrix.n(),total_dofs));\n  Assert (local_mass_matrix.m() == total_dofs,\n\t  ExcWrongFieldDimension(local_mass_matrix.m(),total_dofs));\n\n\t\t\t\t   \/\/ first get the local mass matrix for\n\t\t\t\t   \/\/ the base object\n  dFMatrix base_mass_matrix (base_element->total_dofs,\n\t\t\t     base_element->total_dofs);\n  base_element->get_local_mass_matrix (cell, boundary, base_mass_matrix);\n\n\n\t\t\t\t   \/\/ now distribute it to the mass matrix\n\t\t\t\t   \/\/ of this object\n  for (unsigned int i=0; i<base_element->total_dofs; ++i)\n    for (unsigned int j=0; j<base_element->total_dofs; ++j)\n      for (unsigned int n=0; n<n_sub_elements; ++n)\n\t\t\t\t\t \/\/ only fill diagonals of the blocks\n\tlocal_mass_matrix (i*n_sub_elements + n,\n\t\t\t   j*n_sub_elements + n) = base_mass_matrix (i,j);\n*\/\n};\n\n\n\ntemplate <int dim>\ndouble FESystem<dim>::shape_value_transform (const unsigned int i,\n\t\t\t\t\t     const Point<dim>  &p) const\n{\n  Assert(false, ExcNotImplemented());\n  return 0.;\n  \n\/\/  return base_element->shape_value_transform (i, p);\n};\n\n\ntemplate <int dim>\nTensor<1,dim> FESystem<dim>::shape_grad_transform (const unsigned int i,\n\t\t\t\t\t\t   const Point<dim>  &p) const\n{\n  Assert(false, ExcNotImplemented());\n  return Tensor<1,dim>();\n\n\/\/  return base_element->shape_grad_transform (i, p);\n};\n\n\n\ntemplate <int dim>\nvoid FESystem<dim>::get_face_jacobians (const DoFHandler<dim>::face_iterator &face,\n\t\t\t\t\tconst Boundary<dim>         &boundary,\n\t\t\t\t\tconst vector<Point<dim-1> > &unit_points,\n\t\t\t\t\tvector<double>      &face_jacobi_determinants) const\n{\n  Assert(false, ExcNotImplemented());\n\n\/\/  base_element->get_face_jacobians (face, boundary, unit_points, face_jacobi_determinants);\n};\n\n\n\ntemplate <int dim>\nvoid FESystem<dim>::get_subface_jacobians (const DoFHandler<dim>::face_iterator &face,\n\t\t\t\t\t   const unsigned int           subface_no,\n\t\t\t\t\t   const vector<Point<dim-1> > &unit_points,\n\t\t\t\t\t   vector<double>      &face_jacobi_determinants) const\n{\n  Assert(false, ExcNotImplemented());\n\n\/\/  base_element->get_subface_jacobians (face, subface_no, unit_points, face_jacobi_determinants);\n};\n\n\n\n\ntemplate <int dim>\nvoid FESystem<dim>::get_normal_vectors (const DoFHandler<dim>::cell_iterator &cell,\n\t\t\t\t\tconst unsigned int          face_no,\n\t\t\t\t\tconst Boundary<dim>         &boundary,\n\t\t\t\t\tconst vector<Point<dim-1> > &unit_points,\n\t\t\t\t\tvector<Point<dim> >         &normal_vectors) const\n{\n  Assert(false, ExcNotImplemented());\n\n\/\/  base_element->get_normal_vectors (cell, face_no, boundary, unit_points, normal_vectors);\n};\n\n\n\ntemplate <int dim>\nvoid FESystem<dim>::get_normal_vectors (const DoFHandler<dim>::cell_iterator &cell,\n\t\t\t\t\tconst unsigned int          face_no,\n\t\t\t\t\tconst unsigned int          subface_no,\n\t\t\t\t\tconst vector<Point<dim-1> > &unit_points,\n\t\t\t\t\tvector<Point<dim> >         &normal_vectors) const\n{\n  Assert(false, ExcNotImplemented());\n\n\/\/  base_element->get_normal_vectors (cell, face_no, subface_no, unit_points, normal_vectors);\n};\n\n\n\n\n\n\/\/ explicit instantiations\ntemplate class FESystem<deal_II_dimension>;\n\n\n\n<commit_msg>test output removed<commit_after>\/* $Id$ *\/\n\/* Copyright W. Bangerth, University of Heidelberg, 1990 *\/\n\n\n#include <fe\/fe_system.h>\n\n\n\n\n\ntemplate <int dim>\nFESystem<dim>::~FESystem ()\n{\n  for (unsigned i=0;i<base_elements.size();++i)\n    {\n      base_elements[i].first -> unsubscribe ();\n      delete base_elements[i].first;\n    }\n};\n\n\n\ntemplate <int dim>\nvoid FESystem<dim>::initialize ()\n{\n\t\t\t\t   \/\/ Initialize index table\n\t\t\t\t   \/\/ Multi-component base elements have to be thought of.\n\t\t\t\t   \/\/ 1. Vertices\n  unsigned total_index = 0;\n  for (unsigned vertex_number= 0 ; vertex_number < GeometryInfo<2>::vertices_per_cell ;\n       ++vertex_number)\n    {\n      unsigned comp_start = 0;\n      for(unsigned comp = 0; comp < n_component_elements() ;\n\t  ++comp)\n\t{\n\t  for (unsigned m = 0; m < element_multiplicity(comp); ++m)\n\t    {\n\t      for (unsigned local_index = 0 ;\n\t\t   local_index < base_element(comp).dofs_per_vertex ;\n\t\t   ++local_index)\n\t\t{\n\t\t  system_to_component_table[total_index++]\n\t\t    = pair<unsigned,unsigned>\n\t\t    (comp_start+m,\n\t\t     vertex_number*base_element(comp).dofs_per_vertex+local_index);\n\t\t}\n\t    }\n\t  comp_start += element_multiplicity(comp);\n\t}\n    }\n  \n\t\t\t\t   \/\/ 2. Lines\n  for (unsigned line_number= 0 ; line_number < GeometryInfo<2>::lines_per_cell ;\n       ++line_number)\n    {\n      unsigned comp_start = 0;\n      for(unsigned comp = 0; comp < n_component_elements() ;\n\t  ++comp)\n\t{\n\t  for (unsigned m = 0; m < element_multiplicity(comp); ++m)\n\t    {\n\t      for (unsigned local_index = 0 ;\n\t\t   local_index < base_element(comp).dofs_per_line ;\n\t\t   ++local_index)\n\t\t{\n\t\t  system_to_component_table[total_index++]\n\t\t    = pair<unsigned,unsigned>\n\t\t    (comp_start+m,\n\t\t     line_number*base_element(comp).dofs_per_line\n\t\t     +local_index+base_element(comp).first_line_index);\n\t\t}\n\t    }\n\t  comp_start += element_multiplicity(comp);\n\t}\n    }\n  \n\t\t\t\t   \/\/ 3. Quads\n  for (unsigned quad_number= 0 ; quad_number < GeometryInfo<2>::quads_per_cell ;\n       ++quad_number)\n    {\n      unsigned comp_start = 0;\n      for(unsigned comp = 0; comp < n_component_elements() ;\n\t  ++comp)\n\t{\n\t  for (unsigned m = 0; m < element_multiplicity(comp); ++m)\n\t    {\n\t      for (unsigned local_index = 0 ;\n\t\t   local_index < base_element(comp).dofs_per_quad ;\n\t\t   ++local_index)\n\t\t{\n\t\t  system_to_component_table[total_index++]\n\t\t    = pair<unsigned,unsigned>\n\t\t    (comp_start+m,\n\t\t     quad_number*base_element(comp).dofs_per_quad\n\t\t     +local_index+base_element(comp).first_quad_index);\n\t\t}\n\t    }\n\t  comp_start += element_multiplicity(comp);\n\t}\n    }\n  \n\t\t\t\t   \/\/ 4. Hex\n  for (unsigned hex_number= 0 ; hex_number < GeometryInfo<2>::hexes_per_cell ;\n       ++hex_number)\n    {\n      unsigned comp_start = 0;\n      for(unsigned comp = 0; comp < n_component_elements() ;\n\t  ++comp, comp_start += element_multiplicity(comp))\n\t{\n\t  for (unsigned m = 0; m < element_multiplicity(comp); ++m)\n\t    {\n\t      for (unsigned local_index = 0 ;\n\t\t   local_index < base_element(comp).dofs_per_hex ;\n\t\t   ++local_index)\n\t\t{\n\t\t  system_to_component_table[total_index++]\n\t\t    = pair<unsigned,unsigned>\n\t\t    (comp_start+m,\n\t\t     hex_number*base_element(comp).dofs_per_hex\n\t\t     +local_index+base_element(comp).first_hex_index);\n\t\t}\n\t    }\n\t}\n    }\n  \n  \n\n\t\t\t\t   \/\/ distribute the matrices of the base\n\t\t\t\t   \/\/ finite element to the matrices of\n\t\t\t\t   \/\/ this object\n\/*  for (unsigned int i=0; i<base_element->total_dofs; ++i)\n    for (unsigned int j=0; j<base_element->total_dofs; ++j)\n      for (unsigned int n=0; n<n_sub_elements; ++n)\n\t\t\t\t\t \/\/ only fill diagonals of the blocks\n\t{\n\t  for (unsigned int child=0; child<GeometryInfo<dim>::children_per_cell; ++child)\n\t    {\n\t      restriction[child] (i*n_sub_elements + n,\n\t\t\t\t  j*n_sub_elements + n)\n\t\t= base_element->restrict(child)(i,j);\n\t      prolongation[child] (i*n_sub_elements + n,\n\t\t\t\t   j*n_sub_elements + n)\n\t\t= base_element->prolongate(child)(i,j);\n\t    };\n\n\t  interface_constraints (i*n_sub_elements + n,\n\t\t\t\t j*n_sub_elements + n)\n\t    = base_element->constraints()(i,j);\n\t};\n*\/};\n\n\n\n\n#if deal_II_dimension == 1\n\ntemplate <>\nFiniteElementData<1>\nFESystem<1>::multiply_dof_numbers (const FiniteElementData<1> &fe_data,\n\t\t\t\t   const unsigned int          N)\n{\n  return FiniteElementData<1> (fe_data.dofs_per_vertex * N,\n\t\t\t       fe_data.dofs_per_line * N,\n\t\t\t       fe_data.n_transform_functions,\n\t\t\t       fe_data.n_components * N);\n};\n\ntemplate <>\nFiniteElementData<1>\nFESystem<1>::multiply_dof_numbers (const FiniteElementData<1> &fe1,\n\t\t\t\t   const unsigned int          N1,\n\t\t\t\t   const FiniteElementData<1> &fe2,\n\t\t\t\t   const unsigned int          N2)\n{\n  return FiniteElementData<1> (fe1.dofs_per_vertex * N1 + fe2.dofs_per_vertex * N2 ,\n\t\t\t       fe1.dofs_per_line * N1 + fe2.dofs_per_line * N2 ,\n\t\t\t       fe1.n_transform_functions + fe2.n_transform_functions ,\n\t\t\t       fe1.n_components * N1 + fe2.n_components * N2 );\n};\n\n#endif\n\n\n#if deal_II_dimension == 2\n\ntemplate <>\nFiniteElementData<2>\nFESystem<2>::multiply_dof_numbers (const FiniteElementData<2> &fe_data,\n\t\t\t\t   const unsigned int          N)\n{\n  return FiniteElementData<2> (fe_data.dofs_per_vertex * N,\n\t\t\t       fe_data.dofs_per_line * N,\n\t\t\t       fe_data.dofs_per_quad * N,\n\t\t\t       fe_data.n_transform_functions,\n\t\t\t       fe_data.n_components * N);\n};\n\ntemplate <>\nFiniteElementData<2>\nFESystem<2>::multiply_dof_numbers (const FiniteElementData<2> &fe1,\n\t\t\t\t   const unsigned int          N1,\n\t\t\t\t   const FiniteElementData<2> &fe2,\n\t\t\t\t   const unsigned int          N2)\n{\n  return FiniteElementData<2> (fe1.dofs_per_vertex * N1 + fe2.dofs_per_vertex * N2 ,\n\t\t\t       fe1.dofs_per_line * N1 + fe2.dofs_per_line * N2 ,\n\t\t\t       fe1.dofs_per_quad * N1 + fe2.dofs_per_quad * N2 ,\n\t\t\t       fe1.n_transform_functions + fe2.n_transform_functions ,\n\t\t\t       fe1.n_components * N1 + fe2.n_components * N2 );\n};\n\n#endif\n\n\ntemplate <int dim>\ndouble FESystem<dim>::shape_value (const unsigned int i,\n\t\t\t\t   const Point<dim>  &p) const\n{\n  Assert(false, ExcNotImplemented());\n  return 0.;\n  \n  Assert((i<total_dofs), ExcInvalidIndex(i));\n\n\n\/\/  return base_element->shape_value (i \/ n_sub_elements, p);\n};\n\n\n\ntemplate <int dim>\nTensor<1,dim>\nFESystem<dim>::shape_grad (const unsigned int  i,\n\t\t\t   const Point<dim>   &p) const\n{\n  Assert(false, ExcNotImplemented());\n  return Tensor<1,dim>();\n\n  Assert((i<total_dofs), ExcInvalidIndex(i));\n\n\/\/  return base_element->shape_grad (i \/ n_sub_elements, p);\n};\n\n\n\ntemplate <int dim>\nTensor<2,dim>\nFESystem<dim>::shape_grad_grad (const unsigned int  i,\n\t\t\t\tconst Point<dim>   &p) const\n {\n  Assert(false, ExcNotImplemented());\n  return Tensor<2,dim>();\n\n  Assert((i<total_dofs), ExcInvalidIndex(i));\n\n\/\/  return base_element->shape_grad_grad (i \/ n_sub_elements, p);\n};\n\n\n\ntemplate <int dim>\nvoid FESystem<dim>::get_unit_support_points (vector<Point<dim> > &support_points) const\n{\n\/*  Assert (support_points.size() == total_dofs,\n\t  ExcWrongFieldDimension (support_points.size(), total_dofs));\n\n  vector<Point<dim> > base_support_points (base_element->total_dofs);\n  base_element->get_unit_support_points (base_support_points);\n  \n  for (unsigned int i=0; i<base_element->total_dofs; ++i) \n    for (unsigned int n=0; n<n_sub_elements; ++n)\n      support_points[i*n_sub_elements+n] = base_support_points[i];\n*\/\n};\n\n\n\ntemplate <int dim>\nvoid FESystem<dim>::get_support_points (const DoFHandler<dim>::cell_iterator &cell,\n\t\t\t\t\tconst Boundary<dim> &boundary,\n\t\t\t\t\tvector<Point<dim> > &support_points) const\n{\n  Assert(false, ExcNotImplemented());\n\/*\n  Assert (support_points.size() == total_dofs,\n\t  ExcWrongFieldDimension (support_points.size(), total_dofs));\n\n  vector<Point<dim> > base_support_points (base_element->total_dofs);\n  base_element->get_support_points (cell, boundary, base_support_points);\n  \n  for (unsigned int i=0; i<base_element->total_dofs; ++i) \n    for (unsigned int n=0; n<n_sub_elements; ++n)\n      support_points[i*n_sub_elements+n] = base_support_points[i];\n*\/\n};\n\n\n\ntemplate <int dim>\nvoid FESystem<dim>::get_face_support_points (const DoFHandler<dim>::face_iterator &face,\n\t\t\t\t\t     const Boundary<dim> &boundary,\n\t\t\t\t\t     vector<Point<dim> > &support_points) const\n{\n  Assert(false, ExcNotImplemented());\n\/*\n  Assert (support_points.size() == dofs_per_face,\n\t  ExcWrongFieldDimension (support_points.size(), dofs_per_face));\n\n  vector<Point<dim> > base_support_points (base_element->dofs_per_face);\n  base_element->get_face_support_points (face, boundary, base_support_points);\n  \n  for (unsigned int i=0; i<base_element->dofs_per_face; ++i) \n    for (unsigned int n=0; n<n_sub_elements; ++n)\n      support_points[i*n_sub_elements+n] = base_support_points[i];\n*\/\n};\n\n\n\ntemplate <int dim>\nvoid FESystem<dim>::get_local_mass_matrix (const DoFHandler<dim>::cell_iterator &cell,\n\t\t\t\t\t   const Boundary<dim> &boundary,\n\t\t\t\t\t   dFMatrix            &local_mass_matrix) const\n{\n  Assert(false, ExcNotImplemented());\n\/*\n  Assert (local_mass_matrix.n() == total_dofs,\n\t  ExcWrongFieldDimension(local_mass_matrix.n(),total_dofs));\n  Assert (local_mass_matrix.m() == total_dofs,\n\t  ExcWrongFieldDimension(local_mass_matrix.m(),total_dofs));\n\n\t\t\t\t   \/\/ first get the local mass matrix for\n\t\t\t\t   \/\/ the base object\n  dFMatrix base_mass_matrix (base_element->total_dofs,\n\t\t\t     base_element->total_dofs);\n  base_element->get_local_mass_matrix (cell, boundary, base_mass_matrix);\n\n\n\t\t\t\t   \/\/ now distribute it to the mass matrix\n\t\t\t\t   \/\/ of this object\n  for (unsigned int i=0; i<base_element->total_dofs; ++i)\n    for (unsigned int j=0; j<base_element->total_dofs; ++j)\n      for (unsigned int n=0; n<n_sub_elements; ++n)\n\t\t\t\t\t \/\/ only fill diagonals of the blocks\n\tlocal_mass_matrix (i*n_sub_elements + n,\n\t\t\t   j*n_sub_elements + n) = base_mass_matrix (i,j);\n*\/\n};\n\n\n\ntemplate <int dim>\ndouble FESystem<dim>::shape_value_transform (const unsigned int i,\n\t\t\t\t\t     const Point<dim>  &p) const\n{\n  Assert(false, ExcNotImplemented());\n  return 0.;\n  \n\/\/  return base_element->shape_value_transform (i, p);\n};\n\n\ntemplate <int dim>\nTensor<1,dim> FESystem<dim>::shape_grad_transform (const unsigned int i,\n\t\t\t\t\t\t   const Point<dim>  &p) const\n{\n  Assert(false, ExcNotImplemented());\n  return Tensor<1,dim>();\n\n\/\/  return base_element->shape_grad_transform (i, p);\n};\n\n\n\ntemplate <int dim>\nvoid FESystem<dim>::get_face_jacobians (const DoFHandler<dim>::face_iterator &face,\n\t\t\t\t\tconst Boundary<dim>         &boundary,\n\t\t\t\t\tconst vector<Point<dim-1> > &unit_points,\n\t\t\t\t\tvector<double>      &face_jacobi_determinants) const\n{\n  Assert(false, ExcNotImplemented());\n\n\/\/  base_element->get_face_jacobians (face, boundary, unit_points, face_jacobi_determinants);\n};\n\n\n\ntemplate <int dim>\nvoid FESystem<dim>::get_subface_jacobians (const DoFHandler<dim>::face_iterator &face,\n\t\t\t\t\t   const unsigned int           subface_no,\n\t\t\t\t\t   const vector<Point<dim-1> > &unit_points,\n\t\t\t\t\t   vector<double>      &face_jacobi_determinants) const\n{\n  Assert(false, ExcNotImplemented());\n\n\/\/  base_element->get_subface_jacobians (face, subface_no, unit_points, face_jacobi_determinants);\n};\n\n\n\n\ntemplate <int dim>\nvoid FESystem<dim>::get_normal_vectors (const DoFHandler<dim>::cell_iterator &cell,\n\t\t\t\t\tconst unsigned int          face_no,\n\t\t\t\t\tconst Boundary<dim>         &boundary,\n\t\t\t\t\tconst vector<Point<dim-1> > &unit_points,\n\t\t\t\t\tvector<Point<dim> >         &normal_vectors) const\n{\n  Assert(false, ExcNotImplemented());\n\n\/\/  base_element->get_normal_vectors (cell, face_no, boundary, unit_points, normal_vectors);\n};\n\n\n\ntemplate <int dim>\nvoid FESystem<dim>::get_normal_vectors (const DoFHandler<dim>::cell_iterator &cell,\n\t\t\t\t\tconst unsigned int          face_no,\n\t\t\t\t\tconst unsigned int          subface_no,\n\t\t\t\t\tconst vector<Point<dim-1> > &unit_points,\n\t\t\t\t\tvector<Point<dim> >         &normal_vectors) const\n{\n  Assert(false, ExcNotImplemented());\n\n\/\/  base_element->get_normal_vectors (cell, face_no, subface_no, unit_points, normal_vectors);\n};\n\n\n\n\n\n\/\/ explicit instantiations\ntemplate class FESystem<deal_II_dimension>;\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    kircmessage.cpp - IRC Client\n\n    Copyright (c) 2003      by Michel Hermier <michel.hermier@wanadoo.fr>\n\n    Kopete    (c) 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 <kdebug.h>\n#include <klocale.h>\n#include <kmessagebox.h>\n\n#include \"kircmessage.h\"\n\n#ifndef _IRC_STRICTNESS_\nconst QRegExp KIRCMessage::m_IRCCommandType1(QString::fromLatin1(\n\t\"^(?::([^ ]+) )?([A-Za-z]+|\\\\d{3,3})((?: [^ :][^ ]*)*) ?(?: :(.*))?$\"));\n\t\/\/ Extra end arg space check -------------------------^\n#else \/\/ _IRC_STRICTNESS_\nconst QRegExp KIRCMessage::m_IRCCommandType1(QString::fromLatin1(\n\t\"^(?::([^ ]+) )?([A-Za-z]+|\\\\d{3,3})((?: [^ :][^ ]*){0,13})(?: :(.*))?$\"));\nconst QRegExp KIRCMessage::m_IRCCommandType2(QString::fromLatin1(\n\t\"^(?::[[^ ]+) )?([A-Za-z]+|\\\\d{3,3})((?: [^ :][^ ]*){14,14})(?: (.*))?$\"));\n#endif \/\/ _IRC_STRICTNESS_\n\nconst QRegExp KIRCMessage::m_IRCNumericCommand(QString::fromLatin1(\"^\\\\d{3,3}$\"));\n\n\nKIRCMessage::KIRCMessage()\n\t: m_ctcpMessage(0)\n{\n}\n\nKIRCMessage::KIRCMessage(const KIRCMessage &obj)\n\t: m_ctcpMessage(0)\n{\n\tm_raw = obj.m_raw;\n\n\tm_prefix = obj.m_prefix;\n\tm_command = obj.m_command;\n\tm_args = obj.m_args;\n\tm_suffix = obj.m_suffix;\n\n\tm_ctcpRaw = obj.m_ctcpRaw;\n\n\tif(obj.m_ctcpMessage)\n\t\tm_ctcpMessage = new KIRCMessage(obj.m_ctcpMessage);\n}\n\nKIRCMessage::KIRCMessage(const KIRCMessage *obj)\n\t: m_ctcpMessage(0)\n{\n\tm_raw = obj->m_raw;\n\n\tm_prefix = obj->m_prefix;\n\tm_command = obj->m_command;\n\tm_args = obj->m_args;\n\tm_suffix = obj->m_suffix;\n\n\tm_ctcpRaw = obj->m_ctcpRaw;\n\n\tif(obj->m_ctcpMessage)\n\t\tm_ctcpMessage = new KIRCMessage(obj->m_ctcpMessage);\n}\n\nKIRCMessage::~KIRCMessage()\n{\n\tif(m_ctcpMessage) delete m_ctcpMessage;\n}\n\nKIRCMessage KIRCMessage::writeString(QIODevice *dev, const QString &str, QTextCodec *codec)\n{\n\tQCString s;\n\tQString txt = str + QString::fromLatin1(\"\\r\\n\");\n\n\t\/\/ FIXME: codecForContent() is useless on QStrings, they are already unicode!\n\t\/\/ Pass a REAL char* like QSocket::readBlock() provides before doing any\n\t\/\/ charset conversion.\n\t\/\/ Also, codecForContent is quite crappy. See the Qt docs, but I would suggest\n\t\/\/ defaulting to utf8 encoding in IRC and having OPTIONAL support for other\n\t\/\/ codecs (manually selectable, not auto-detected). - Martijn\n\tQTextCodec *_codec = codec ? codec : QTextCodec::codecForContent( txt.latin1(), txt.length() );\n\tif (codec)\n\t\ts = _codec->fromUnicode(txt);\n\telse\n\t\ts = txt.local8Bit();\n\n\tkdDebug(14121) << \">> \" << s;\n\t\/\/ FIXME: Should check the amount of data really writen.\n\tdev->writeBlock(s.data(), s.length());\n\treturn parse(str);\n}\n\nKIRCMessage KIRCMessage::writeMessage(QIODevice *dev,\n\t\tconst QString &command, const QStringList &args, const QString &suffix,\n\t\tQTextCodec *codec)\n{\n\tQString msg = command;\n\tfor (QStringList::ConstIterator it = args.begin(); it != args.end(); ++it)\n\t\tmsg += QChar(' ') + *it;\n\tif (!suffix.isNull())\n\t\tmsg += QString::fromLatin1(\" :\") + suffix;\n\n\tmsg = quote(ctcpQuote(msg));\n\n\treturn writeString(dev, msg, codec);\n}\n\nKIRCMessage KIRCMessage::writeMessage(QIODevice *dev,\n\t\tconst QString &command, const QString &arg, const QString &suffix,\n\t\tQTextCodec *codec)\n{\n\tQString msg = command;\n\tif (!arg.isNull())\n\t\tmsg += QChar(' ') + arg;\n\tif (!suffix.isNull())\n\t\tmsg += QString::fromLatin1(\" :\") + suffix;\n\n\tmsg = quote(ctcpQuote(msg));\n\n\treturn writeString(dev, msg, codec);\n}\n\nKIRCMessage KIRCMessage::writeCtcpMessage(QIODevice *dev,\n\t\tconst QString &command, const QString &to \/*prefix*\/, const QString &suffix,\n\t\tconst QString &ctcpCommand, const QStringList &ctcpArgs, const QString &ctcpSuffix,\n\t\tQTextCodec *codec)\n{\n\tQString msg = command+QChar(' ')+getNickFromPrefix(to)+QString::fromLatin1(\" :\");\n\tif (!suffix.isNull())\n\t\tmsg += suffix;\n\tmsg = ctcpQuote(msg);\n\n\tQString ctcpMsg = ctcpCommand;\n\tfor (QStringList::ConstIterator it = ctcpArgs.begin(); it != ctcpArgs.end(); ++it)\n\t\tctcpMsg += QChar(' ') + *it;\n\tif (!ctcpSuffix.isNull())\n\t\tctcpMsg += QString::fromLatin1(\" :\") + ctcpSuffix;\n\tctcpMsg = ctcpQuote(ctcpMsg);\n\n\tmsg = quote(msg + QChar(0x01) + ctcpMsg + QChar(0x01));\n\treturn writeString(dev, msg, codec);\n}\n\n\/\/ if codec==0 => autodetect\nKIRCMessage KIRCMessage::parse(KBufferedIO *dev, bool *parseSuccess, QTextCodec *codec)\n{\n\tif(parseSuccess) *parseSuccess=false;\n\tif(dev->canReadLine())\n\t{\n\t\tQCString raw;\n\t\tQString line;\n\n\t\traw.resize(dev->bytesAvailable()+1);\n\t\tQ_LONG length = dev->readLine(raw.data(), raw.count());\n\t\tif (length > -1)\n\t\t{\n\t\t\traw.resize(length);\n\t\t\traw.replace(\"\\r\\n\",\"\"); \/\/remove the trailling \\r\\n if any(there must be in fact)\n\t\t\tkdDebug(14121) << \"<< \" << raw << endl;\n\n\t\t\tQTextCodec *_codec = codec?codec:QTextCodec::codecForContent(raw.data(), raw.length());\n\n\t\t\tif (codec)\n\t\t\t\tline = _codec->toUnicode(raw);\n\t\t\telse\n\t\t\t\tline = raw;\n\n\t\t\tKIRCMessage msg = parse(line, parseSuccess);\n\t\t\tmsg.m_raw = raw;\n\t\t\treturn msg;\n\t\t}\n\t\telse\n\t\t\tkdWarning(14121) << \"Failed to read a line while canReadLine returned true!\" << endl;\n\t}\n\treturn KIRCMessage();\n}\n\nKIRCMessage KIRCMessage::parse(const QString &line, bool *parseSuccess)\n{\n\tKIRCMessage msg;\n\n\tif(parseSuccess) *parseSuccess=false;\n\tmsg.m_raw = unquote( line ).utf8();\n\tif(matchForIRCRegExp(msg.m_raw, msg))\n\t{\n\t\tmsg.m_prefix = ctcpUnquote(msg.m_prefix);\n\t\tmsg.m_command = ctcpUnquote(msg.m_command);\n\t\tfor (QStringList::Iterator it = msg.m_args.begin(); it != msg.m_args.end(); ++it)\n\t\t\t(*it) = ctcpUnquote(*it);\n\n\t\tif(extractCtcpCommand(msg.m_suffix, msg.m_ctcpRaw))\n\t\t{\n\t\t\tmsg.m_ctcpRaw = ctcpUnquote(msg.m_ctcpRaw);\n\t\t\tkdDebug(14121) << \"Found CTCP command:\\\"\" << msg.m_ctcpRaw << \"\\\"\" << endl;\n\t\t\tmsg.m_ctcpMessage = new KIRCMessage();\n\t\t\tmsg.m_ctcpMessage->m_raw = msg.m_ctcpRaw.utf8();\n\t\t\tif(!matchForIRCRegExp(msg.m_ctcpRaw, *msg.m_ctcpMessage))\n\t\t\t{\n\t\t\t\tmsg.m_ctcpMessage->m_command = msg.m_ctcpRaw.section(' ', 0, 0).upper();\n\t\t\t}\n\t\t\tmsg.m_ctcpMessage->m_ctcpRaw = msg.m_ctcpRaw.section(' ', 1);\n\t\t}\n\t\tmsg.m_suffix = ctcpUnquote(msg.m_suffix);\n\n\t\tif(parseSuccess) *parseSuccess=true;\n\t}\n\telse\n\t{\n\/\/\t\tKMessageBox::error(0, \"\\\"\" + line + \"\\\"\", \"Unmatched line\");\n\t\tkdDebug(14120) << \"Unmatched line:\\\"\" << line << \"\\\"\" << endl;\n\t}\n\treturn msg;\n}\n\nQString KIRCMessage::quote(const QString &str)\n{\n\tQString tmp = str;\n\tQChar q('\\020');\n\ttmp.replace(q, q+QString(q));\n\ttmp.replace(QChar('\\r'), q+QString::fromLatin1(\"r\"));\n\ttmp.replace(QChar('\\n'), q+QString::fromLatin1(\"n\"));\n\ttmp.replace(QChar('\\0'), q+QString::fromLatin1(\"0\"));\n\treturn tmp;\n}\n\n\/\/ FIXME: The unquote system is buggy.\nQString KIRCMessage::unquote(const QString &str)\n{\n\tQString tmp = str;\n\tQChar q('\\020');\n\ttmp.replace(q+QString(q), q);\n\ttmp.replace(q+QString::fromLatin1(\"r\"), QChar('\\r'));\n\ttmp.replace(q+QString::fromLatin1(\"n\"), QChar('\\n'));\n\ttmp.replace(q+QString::fromLatin1(\"0\"), QChar('\\0'));\n\treturn tmp;\n}\n\nQString KIRCMessage::ctcpQuote(const QString &str)\n{\n\tQString tmp = str;\n\ttmp.replace( QChar('\\\\'), QString::fromLatin1(\"\\\\\\\\\"));\n\ttmp.replace( QChar((uchar)0x01), QString::fromLatin1(\"\\\\1\"));\n\treturn tmp;\n}\n\n\/\/ FIXME: The unquote system is buggy.\nQString KIRCMessage::ctcpUnquote(const QString &str)\n{\n\tQString tmp = str;\n\ttmp.replace(QString::fromLatin1(\"\\\\\\\\\"), QChar('\\\\'));\n\ttmp.replace(QString::fromLatin1(\"\\\\1\"), QChar((uchar)0x01));\n\treturn tmp;\n}\n\nbool KIRCMessage::matchForIRCRegExp(const QString &line,KIRCMessage &message)\n{\n\tQRegExp IRCCommandType1(m_IRCCommandType1);\n#ifdef _IRC_STRICTNESS_\n\tQRegExp IRCCommandType2(m_IRCCommandType2);\n#endif \/\/ _IRC_STRICTNESS_\n\n\tif(matchForIRCRegExp(IRCCommandType1, line,\n\t\tmessage.m_prefix, message.m_command , message.m_args, message.m_suffix))\n\t\treturn true;\n#ifdef _IRC_STRICTNESS_\n\tif(!matchForIRCRegExp(IRCCommandType2, line,\n\t\tmessage.m_prefix, message.m_command , message.m_args, message.m_suffix))\n\t\treturn true;\n#endif \/\/ _IRC_STRICTNESS_\n\treturn false;\n}\n\nbool KIRCMessage::matchForIRCRegExp(QRegExp &regexp, const QString &line,\n\t\t\t\tQString &prefix, QString &command, QStringList &args, QString &suffix)\n{\n\tif(regexp.exactMatch(line))\n\t{\n\t\tprefix  = regexp.cap(1);\n\t\tcommand = regexp.cap(2);\n\t\targs    = QStringList::split(' ', regexp.cap(3).stripWhiteSpace());\n\t\tsuffix  = regexp.cap(4);\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n\/\/ FIXME: there are missing parts\nQString KIRCMessage::toString() const\n{\n\tif( !isValid() )\n\t\treturn QString::null;\n\n\tQString msg = m_command;\n\tfor (QStringList::ConstIterator it = m_args.begin(); it != m_args.end(); ++it)\n\t\tmsg += QChar(' ') + *it;\n\tif (!m_suffix.isNull())\n\t\tmsg += QString::fromLatin1(\" :\") + m_suffix;\n\n\treturn msg;\n}\n\nbool KIRCMessage::isNumericMessage() const\n{\n\tQRegExp re(m_IRCNumericCommand);\n\treturn re.exactMatch( m_command );\n}\n\nbool KIRCMessage::isValid() const\n{\n\/\/\tThis could\/should be more complex but the message validity is tested durring the parsing\n\/\/\tSo this is enougth as we don't allow the editing the content.\n\treturn !m_command.isEmpty();\n}\n\n\/* Return true if the given string is a special command string\n * (i.e start and finish with the ascii code \\001), and the given\n * string is splited to get the first part of the message and fill the ctcp command. *\/\nbool KIRCMessage::extractCtcpCommand(QString &str, QString &ctcpline)\n{\n\t\/\/ This could also be done using a regexp like: \"^([^\\\\x01])\\\\x01([^\\\\x01])\\\\x01$\"\n\t\/\/ (make less code to test)\n\tint pos_begin = str.find(QChar(0x01));\n\tif (pos_begin==-1)\n\t\treturn false;\n\n\tint pos_end = str.find(QChar(0x01), pos_begin+1);\n\tif (pos_end==-1||pos_end!=(int)str.length()-1)\n\t\treturn false;\n\n\tctcpline = str.mid(pos_begin+1, pos_end-pos_begin-1);\n\tstr = str.mid(0, pos_begin);\n\treturn true;\n}\n\nvoid KIRCMessage::dump() const\n{\n\tkdDebug(14120)\t<< \"Raw:\" << m_raw << endl\n\t\t\t<< \"Prefix:\" << m_prefix << endl\n\t\t\t<< \"Command:\" << m_command << endl\n\/\/\t\t\t<< \"Args:\" << m_args << endl   \/\/this does not compile on KDE 3.1\n\t\t\t<< \"Suffix:\" << m_suffix << endl\n\t\t\t<< \"CtcpRaw:\" << m_ctcpRaw << endl;\n\tif(m_ctcpMessage)\n\t{\n\t\tkdDebug(14120) << \"Contains CTCP Message:\" << endl;\n\t\tm_ctcpMessage->dump();\n\t}\n}\n<commit_msg>I don't know what the purpose of these ctcpQuote lines are, but they are the source of this bug. And since the CTCP commands we support still work, I am getting rid of this until Michel implements it properly.<commit_after>\/*\n    kircmessage.cpp - IRC Client\n\n    Copyright (c) 2003      by Michel Hermier <michel.hermier@wanadoo.fr>\n\n    Kopete    (c) 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 <kdebug.h>\n#include <klocale.h>\n#include <kmessagebox.h>\n\n#include \"kircmessage.h\"\n\n#ifndef _IRC_STRICTNESS_\nconst QRegExp KIRCMessage::m_IRCCommandType1(QString::fromLatin1(\n\t\"^(?::([^ ]+) )?([A-Za-z]+|\\\\d{3,3})((?: [^ :][^ ]*)*) ?(?: :(.*))?$\"));\n\t\/\/ Extra end arg space check -------------------------^\n#else \/\/ _IRC_STRICTNESS_\nconst QRegExp KIRCMessage::m_IRCCommandType1(QString::fromLatin1(\n\t\"^(?::([^ ]+) )?([A-Za-z]+|\\\\d{3,3})((?: [^ :][^ ]*){0,13})(?: :(.*))?$\"));\nconst QRegExp KIRCMessage::m_IRCCommandType2(QString::fromLatin1(\n\t\"^(?::[[^ ]+) )?([A-Za-z]+|\\\\d{3,3})((?: [^ :][^ ]*){14,14})(?: (.*))?$\"));\n#endif \/\/ _IRC_STRICTNESS_\n\nconst QRegExp KIRCMessage::m_IRCNumericCommand(QString::fromLatin1(\"^\\\\d{3,3}$\"));\n\n\nKIRCMessage::KIRCMessage()\n\t: m_ctcpMessage(0)\n{\n}\n\nKIRCMessage::KIRCMessage(const KIRCMessage &obj)\n\t: m_ctcpMessage(0)\n{\n\tm_raw = obj.m_raw;\n\n\tm_prefix = obj.m_prefix;\n\tm_command = obj.m_command;\n\tm_args = obj.m_args;\n\tm_suffix = obj.m_suffix;\n\n\tm_ctcpRaw = obj.m_ctcpRaw;\n\n\tif(obj.m_ctcpMessage)\n\t\tm_ctcpMessage = new KIRCMessage(obj.m_ctcpMessage);\n}\n\nKIRCMessage::KIRCMessage(const KIRCMessage *obj)\n\t: m_ctcpMessage(0)\n{\n\tm_raw = obj->m_raw;\n\n\tm_prefix = obj->m_prefix;\n\tm_command = obj->m_command;\n\tm_args = obj->m_args;\n\tm_suffix = obj->m_suffix;\n\n\tm_ctcpRaw = obj->m_ctcpRaw;\n\n\tif(obj->m_ctcpMessage)\n\t\tm_ctcpMessage = new KIRCMessage(obj->m_ctcpMessage);\n}\n\nKIRCMessage::~KIRCMessage()\n{\n\tif(m_ctcpMessage) delete m_ctcpMessage;\n}\n\nKIRCMessage KIRCMessage::writeString(QIODevice *dev, const QString &str, QTextCodec *codec)\n{\n\tQCString s;\n\tQString txt = str + QString::fromLatin1(\"\\r\\n\");\n\n\t\/\/ FIXME: codecForContent() is useless on QStrings, they are already unicode!\n\t\/\/ Pass a REAL char* like QSocket::readBlock() provides before doing any\n\t\/\/ charset conversion.\n\t\/\/ Also, codecForContent is quite crappy. See the Qt docs, but I would suggest\n\t\/\/ defaulting to utf8 encoding in IRC and having OPTIONAL support for other\n\t\/\/ codecs (manually selectable, not auto-detected). - Martijn\n\tQTextCodec *_codec = codec ? codec : QTextCodec::codecForContent( txt.latin1(), txt.length() );\n\tif (codec)\n\t\ts = _codec->fromUnicode(txt);\n\telse\n\t\ts = txt.local8Bit();\n\n\tkdDebug(14121) << \">> \" << s;\n\t\/\/ FIXME: Should check the amount of data really writen.\n\tdev->writeBlock(s.data(), s.length());\n\treturn parse(str);\n}\n\nKIRCMessage KIRCMessage::writeMessage(QIODevice *dev,\n\t\tconst QString &command, const QStringList &args, const QString &suffix,\n\t\tQTextCodec *codec)\n{\n\tQString msg = command;\n\tfor (QStringList::ConstIterator it = args.begin(); it != args.end(); ++it)\n\t\tmsg += QChar(' ') + *it;\n\tif (!suffix.isNull())\n\t\tmsg += QString::fromLatin1(\" :\") + suffix;\n\n\tmsg = quote(ctcpQuote(msg));\n\n\treturn writeString(dev, msg, codec);\n}\n\nKIRCMessage KIRCMessage::writeMessage(QIODevice *dev,\n\t\tconst QString &command, const QString &arg, const QString &suffix,\n\t\tQTextCodec *codec)\n{\n\tQString msg = command;\n\tif (!arg.isNull())\n\t\tmsg += QChar(' ') + arg;\n\tif (!suffix.isNull())\n\t\tmsg += QString::fromLatin1(\" :\") + suffix;\n\n\tmsg = quote(ctcpQuote(msg));\n\n\treturn writeString(dev, msg, codec);\n}\n\nKIRCMessage KIRCMessage::writeCtcpMessage(QIODevice *dev,\n\t\tconst QString &command, const QString &to \/*prefix*\/, const QString &suffix,\n\t\tconst QString &ctcpCommand, const QStringList &ctcpArgs, const QString &ctcpSuffix,\n\t\tQTextCodec *codec)\n{\n\tQString msg = command+QChar(' ')+getNickFromPrefix(to)+QString::fromLatin1(\" :\");\n\tif (!suffix.isNull())\n\t\tmsg += suffix;\n\tmsg = ctcpQuote(msg);\n\n\tQString ctcpMsg = ctcpCommand;\n\tfor (QStringList::ConstIterator it = ctcpArgs.begin(); it != ctcpArgs.end(); ++it)\n\t\tctcpMsg += QChar(' ') + *it;\n\tif (!ctcpSuffix.isNull())\n\t\tctcpMsg += QString::fromLatin1(\" :\") + ctcpSuffix;\n\tctcpMsg = ctcpQuote(ctcpMsg);\n\n\tmsg = quote(msg + QChar(0x01) + ctcpMsg + QChar(0x01));\n\treturn writeString(dev, msg, codec);\n}\n\n\/\/ if codec==0 => autodetect\nKIRCMessage KIRCMessage::parse(KBufferedIO *dev, bool *parseSuccess, QTextCodec *codec)\n{\n\tif(parseSuccess) *parseSuccess=false;\n\tif(dev->canReadLine())\n\t{\n\t\tQCString raw;\n\t\tQString line;\n\n\t\traw.resize(dev->bytesAvailable()+1);\n\t\tQ_LONG length = dev->readLine(raw.data(), raw.count());\n\t\tif (length > -1)\n\t\t{\n\t\t\traw.resize(length);\n\t\t\traw.replace(\"\\r\\n\",\"\"); \/\/remove the trailling \\r\\n if any(there must be in fact)\n\t\t\tkdDebug(14121) << \"<< \" << raw << endl;\n\n\t\t\tQTextCodec *_codec = codec?codec:QTextCodec::codecForContent(raw.data(), raw.length());\n\n\t\t\tif (codec)\n\t\t\t\tline = _codec->toUnicode(raw);\n\t\t\telse\n\t\t\t\tline = raw;\n\n\t\t\tKIRCMessage msg = parse(line, parseSuccess);\n\t\t\tmsg.m_raw = raw;\n\t\t\treturn msg;\n\t\t}\n\t\telse\n\t\t\tkdWarning(14121) << \"Failed to read a line while canReadLine returned true!\" << endl;\n\t}\n\treturn KIRCMessage();\n}\n\nKIRCMessage KIRCMessage::parse(const QString &line, bool *parseSuccess)\n{\n\tKIRCMessage msg;\n\n\tif(parseSuccess) *parseSuccess=false;\n\tmsg.m_raw = unquote( line ).utf8();\n\tif(matchForIRCRegExp(msg.m_raw, msg))\n\t{\n\t\tmsg.m_prefix = ctcpUnquote(msg.m_prefix);\n\t\tmsg.m_command = ctcpUnquote(msg.m_command);\n\t\tfor (QStringList::Iterator it = msg.m_args.begin(); it != msg.m_args.end(); ++it)\n\t\t\t(*it) = ctcpUnquote(*it);\n\n\t\tif(extractCtcpCommand(msg.m_suffix, msg.m_ctcpRaw))\n\t\t{\n\t\t\tmsg.m_ctcpRaw = ctcpUnquote(msg.m_ctcpRaw);\n\t\t\tkdDebug(14121) << \"Found CTCP command:\\\"\" << msg.m_ctcpRaw << \"\\\"\" << endl;\n\t\t\tmsg.m_ctcpMessage = new KIRCMessage();\n\t\t\tmsg.m_ctcpMessage->m_raw = msg.m_ctcpRaw.utf8();\n\t\t\tif(!matchForIRCRegExp(msg.m_ctcpRaw, *msg.m_ctcpMessage))\n\t\t\t{\n\t\t\t\tmsg.m_ctcpMessage->m_command = msg.m_ctcpRaw.section(' ', 0, 0).upper();\n\t\t\t}\n\t\t\tmsg.m_ctcpMessage->m_ctcpRaw = msg.m_ctcpRaw.section(' ', 1);\n\t\t}\n\t\tmsg.m_suffix = ctcpUnquote(msg.m_suffix);\n\n\t\tif(parseSuccess) *parseSuccess=true;\n\t}\n\telse\n\t{\n\/\/\t\tKMessageBox::error(0, \"\\\"\" + line + \"\\\"\", \"Unmatched line\");\n\t\tkdDebug(14120) << \"Unmatched line:\\\"\" << line << \"\\\"\" << endl;\n\t}\n\treturn msg;\n}\n\nQString KIRCMessage::quote(const QString &str)\n{\n\tQString tmp = str;\n\tQChar q('\\020');\n\ttmp.replace(q, q+QString(q));\n\ttmp.replace(QChar('\\r'), q+QString::fromLatin1(\"r\"));\n\ttmp.replace(QChar('\\n'), q+QString::fromLatin1(\"n\"));\n\ttmp.replace(QChar('\\0'), q+QString::fromLatin1(\"0\"));\n\treturn tmp;\n}\n\n\/\/ FIXME: The unquote system is buggy.\nQString KIRCMessage::unquote(const QString &str)\n{\n\tQString tmp = str;\n\tQChar q('\\020');\n\ttmp.replace(q+QString(q), q);\n\ttmp.replace(q+QString::fromLatin1(\"r\"), QChar('\\r'));\n\ttmp.replace(q+QString::fromLatin1(\"n\"), QChar('\\n'));\n\ttmp.replace(q+QString::fromLatin1(\"0\"), QChar('\\0'));\n\treturn tmp;\n}\n\nQString KIRCMessage::ctcpQuote(const QString &str)\n{\n\treturn str;\n\t\n\tQString tmp = str;\n\ttmp.replace( QChar('\\\\'), QString::fromLatin1(\"\\\\\\\\\"));\n\ttmp.replace( QChar((uchar)0x01), QString::fromLatin1(\"\\\\1\"));\n\treturn tmp;\n}\n\n\/\/ FIXME: The unquote system is buggy.\nQString KIRCMessage::ctcpUnquote(const QString &str)\n{\n\treturn str;\n\t\n\tQString tmp = str;\n\ttmp.replace(QString::fromLatin1(\"\\\\\\\\\"), QChar('\\\\'));\n\ttmp.replace(QString::fromLatin1(\"\\\\1\"), QChar((uchar)0x01));\n\treturn tmp;\n}\n\nbool KIRCMessage::matchForIRCRegExp(const QString &line,KIRCMessage &message)\n{\n\tQRegExp IRCCommandType1(m_IRCCommandType1);\n#ifdef _IRC_STRICTNESS_\n\tQRegExp IRCCommandType2(m_IRCCommandType2);\n#endif \/\/ _IRC_STRICTNESS_\n\n\tif(matchForIRCRegExp(IRCCommandType1, line,\n\t\tmessage.m_prefix, message.m_command , message.m_args, message.m_suffix))\n\t\treturn true;\n#ifdef _IRC_STRICTNESS_\n\tif(!matchForIRCRegExp(IRCCommandType2, line,\n\t\tmessage.m_prefix, message.m_command , message.m_args, message.m_suffix))\n\t\treturn true;\n#endif \/\/ _IRC_STRICTNESS_\n\treturn false;\n}\n\nbool KIRCMessage::matchForIRCRegExp(QRegExp &regexp, const QString &line,\n\t\t\t\tQString &prefix, QString &command, QStringList &args, QString &suffix)\n{\n\tif(regexp.exactMatch(line))\n\t{\n\t\tprefix  = regexp.cap(1);\n\t\tcommand = regexp.cap(2);\n\t\targs    = QStringList::split(' ', regexp.cap(3).stripWhiteSpace());\n\t\tsuffix  = regexp.cap(4);\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n\/\/ FIXME: there are missing parts\nQString KIRCMessage::toString() const\n{\n\tif( !isValid() )\n\t\treturn QString::null;\n\n\tQString msg = m_command;\n\tfor (QStringList::ConstIterator it = m_args.begin(); it != m_args.end(); ++it)\n\t\tmsg += QChar(' ') + *it;\n\tif (!m_suffix.isNull())\n\t\tmsg += QString::fromLatin1(\" :\") + m_suffix;\n\n\treturn msg;\n}\n\nbool KIRCMessage::isNumericMessage() const\n{\n\tQRegExp re(m_IRCNumericCommand);\n\treturn re.exactMatch( m_command );\n}\n\nbool KIRCMessage::isValid() const\n{\n\/\/\tThis could\/should be more complex but the message validity is tested durring the parsing\n\/\/\tSo this is enougth as we don't allow the editing the content.\n\treturn !m_command.isEmpty();\n}\n\n\/* Return true if the given string is a special command string\n * (i.e start and finish with the ascii code \\001), and the given\n * string is splited to get the first part of the message and fill the ctcp command. *\/\nbool KIRCMessage::extractCtcpCommand(QString &str, QString &ctcpline)\n{\n\t\/\/ This could also be done using a regexp like: \"^([^\\\\x01])\\\\x01([^\\\\x01])\\\\x01$\"\n\t\/\/ (make less code to test)\n\tint pos_begin = str.find(QChar(0x01));\n\tif (pos_begin==-1)\n\t\treturn false;\n\n\tint pos_end = str.find(QChar(0x01), pos_begin+1);\n\tif (pos_end==-1||pos_end!=(int)str.length()-1)\n\t\treturn false;\n\n\tctcpline = str.mid(pos_begin+1, pos_end-pos_begin-1);\n\tstr = str.mid(0, pos_begin);\n\treturn true;\n}\n\nvoid KIRCMessage::dump() const\n{\n\tkdDebug(14120)\t<< \"Raw:\" << m_raw << endl\n\t\t\t<< \"Prefix:\" << m_prefix << endl\n\t\t\t<< \"Command:\" << m_command << endl\n\/\/\t\t\t<< \"Args:\" << m_args << endl   \/\/this does not compile on KDE 3.1\n\t\t\t<< \"Suffix:\" << m_suffix << endl\n\t\t\t<< \"CtcpRaw:\" << m_ctcpRaw << endl;\n\tif(m_ctcpMessage)\n\t{\n\t\tkdDebug(14120) << \"Contains CTCP Message:\" << endl;\n\t\tm_ctcpMessage->dump();\n\t}\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\/test\/ui\/ui_test.h\"\n\n#include \"base\/file_path.h\"\n#include \"chrome\/app\/chrome_dll_resource.h\"\n#include \"chrome\/browser\/chrome_thread.h\"\n#include \"chrome\/browser\/dom_ui\/new_tab_ui.h\"\n#include \"chrome\/browser\/pref_value_store.h\"\n#include \"chrome\/common\/json_pref_store.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"chrome\/test\/automation\/browser_proxy.h\"\n#include \"chrome\/test\/automation\/tab_proxy.h\"\n#include \"chrome\/test\/automation\/window_proxy.h\"\n#include \"chrome\/test\/testing_pref_service.h\"\n\nclass NewTabUITest : public UITest {\n public:\n  NewTabUITest() {\n    dom_automation_enabled_ = true;\n    \/\/ Set home page to the empty string so that we can set the home page using\n    \/\/ preferences.\n    homepage_ = \"\";\n\n    \/\/ Setup the DEFAULT_THEME profile (has fake history entries).\n    set_template_user_data(UITest::ComputeTypicalUserDataSource(\n        UITest::DEFAULT_THEME));\n  }\n};\n\nTEST_F(NewTabUITest, NTPHasThumbnails) {\n  \/\/ Switch to the \"new tab\" tab, which should be any new tab after the\n  \/\/ first (the first is about:blank).\n  scoped_refptr<BrowserProxy> window(automation()->GetBrowserWindow(0));\n  ASSERT_TRUE(window.get());\n\n  \/\/ Bring up a new tab page.\n  ASSERT_TRUE(window->RunCommand(IDC_NEW_TAB));\n  int load_time;\n  ASSERT_TRUE(automation()->WaitForInitialNewTabUILoad(&load_time));\n\n  \/\/ Blank thumbnails on the NTP have the class 'filler' applied to the div.\n  \/\/ If all the thumbnails load, there should be no div's with 'filler'.\n  scoped_refptr<TabProxy> tab = window->GetActiveTab();\n  ASSERT_TRUE(tab.get());\n\n  ASSERT_TRUE(WaitUntilJavaScriptCondition(tab, L\"\",\n      L\"window.domAutomationController.send(\"\n      L\"document.getElementsByClassName('filler').length == 0)\",\n      action_max_timeout_ms()));\n}\n\n\/\/ Fails about ~5% of the time on all platforms. http:\/\/crbug.com\/45001\nTEST_F(NewTabUITest, FLAKY_ChromeInternalLoadsNTP) {\n  scoped_refptr<BrowserProxy> window(automation()->GetBrowserWindow(0));\n  ASSERT_TRUE(window.get());\n\n  \/\/ Go to the \"new tab page\" using its old url, rather than chrome:\/\/newtab.\n  scoped_refptr<TabProxy> tab = window->GetTab(0);\n  ASSERT_TRUE(tab.get());\n  ASSERT_TRUE(tab->NavigateToURLAsync(GURL(\"chrome-internal:\")));\n  int load_time;\n  ASSERT_TRUE(automation()->WaitForInitialNewTabUILoad(&load_time));\n\n  \/\/ Ensure there are some thumbnails loaded in the page.\n  int thumbnails_count = -1;\n  ASSERT_TRUE(tab->ExecuteAndExtractInt(L\"\",\n      L\"window.domAutomationController.send(\"\n      L\"document.getElementsByClassName('thumbnail-container').length)\",\n      &thumbnails_count));\n  EXPECT_GT(thumbnails_count, 0);\n}\n\nTEST_F(NewTabUITest, UpdateUserPrefsVersion) {\n  \/\/ PrefService with JSON user-pref file only, no enforced or advised prefs.\n  scoped_ptr<PrefService> prefs(new TestingPrefService);\n\n  \/\/ Does the migration\n  NewTabUI::RegisterUserPrefs(prefs.get());\n\n  ASSERT_EQ(NewTabUI::current_pref_version(),\n            prefs->GetInteger(prefs::kNTPPrefVersion));\n\n  \/\/ Reset the version\n  prefs->ClearPref(prefs::kNTPPrefVersion);\n  ASSERT_EQ(0, prefs->GetInteger(prefs::kNTPPrefVersion));\n\n  bool migrated = NewTabUI::UpdateUserPrefsVersion(prefs.get());\n  ASSERT_TRUE(migrated);\n  ASSERT_EQ(NewTabUI::current_pref_version(),\n            prefs->GetInteger(prefs::kNTPPrefVersion));\n\n  migrated = NewTabUI::UpdateUserPrefsVersion(prefs.get());\n  ASSERT_FALSE(migrated);\n}\n<commit_msg>Mark NewTabUITest.NTPHasThumbnails FLAKY.<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\/test\/ui\/ui_test.h\"\n\n#include \"base\/file_path.h\"\n#include \"chrome\/app\/chrome_dll_resource.h\"\n#include \"chrome\/browser\/chrome_thread.h\"\n#include \"chrome\/browser\/dom_ui\/new_tab_ui.h\"\n#include \"chrome\/browser\/pref_value_store.h\"\n#include \"chrome\/common\/json_pref_store.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"chrome\/test\/automation\/browser_proxy.h\"\n#include \"chrome\/test\/automation\/tab_proxy.h\"\n#include \"chrome\/test\/automation\/window_proxy.h\"\n#include \"chrome\/test\/testing_pref_service.h\"\n\nclass NewTabUITest : public UITest {\n public:\n  NewTabUITest() {\n    dom_automation_enabled_ = true;\n    \/\/ Set home page to the empty string so that we can set the home page using\n    \/\/ preferences.\n    homepage_ = \"\";\n\n    \/\/ Setup the DEFAULT_THEME profile (has fake history entries).\n    set_template_user_data(UITest::ComputeTypicalUserDataSource(\n        UITest::DEFAULT_THEME));\n  }\n};\n\n\/\/ Fails on XP, Linux: http:\/\/crbug.com\/51721\nTEST_F(NewTabUITest, FLAKY_NTPHasThumbnails) {\n  \/\/ Switch to the \"new tab\" tab, which should be any new tab after the\n  \/\/ first (the first is about:blank).\n  scoped_refptr<BrowserProxy> window(automation()->GetBrowserWindow(0));\n  ASSERT_TRUE(window.get());\n\n  \/\/ Bring up a new tab page.\n  ASSERT_TRUE(window->RunCommand(IDC_NEW_TAB));\n  int load_time;\n  ASSERT_TRUE(automation()->WaitForInitialNewTabUILoad(&load_time));\n\n  \/\/ Blank thumbnails on the NTP have the class 'filler' applied to the div.\n  \/\/ If all the thumbnails load, there should be no div's with 'filler'.\n  scoped_refptr<TabProxy> tab = window->GetActiveTab();\n  ASSERT_TRUE(tab.get());\n\n  ASSERT_TRUE(WaitUntilJavaScriptCondition(tab, L\"\",\n      L\"window.domAutomationController.send(\"\n      L\"document.getElementsByClassName('filler').length == 0)\",\n      action_max_timeout_ms()));\n}\n\n\/\/ Fails about ~5% of the time on all platforms. http:\/\/crbug.com\/45001\nTEST_F(NewTabUITest, FLAKY_ChromeInternalLoadsNTP) {\n  scoped_refptr<BrowserProxy> window(automation()->GetBrowserWindow(0));\n  ASSERT_TRUE(window.get());\n\n  \/\/ Go to the \"new tab page\" using its old url, rather than chrome:\/\/newtab.\n  scoped_refptr<TabProxy> tab = window->GetTab(0);\n  ASSERT_TRUE(tab.get());\n  ASSERT_TRUE(tab->NavigateToURLAsync(GURL(\"chrome-internal:\")));\n  int load_time;\n  ASSERT_TRUE(automation()->WaitForInitialNewTabUILoad(&load_time));\n\n  \/\/ Ensure there are some thumbnails loaded in the page.\n  int thumbnails_count = -1;\n  ASSERT_TRUE(tab->ExecuteAndExtractInt(L\"\",\n      L\"window.domAutomationController.send(\"\n      L\"document.getElementsByClassName('thumbnail-container').length)\",\n      &thumbnails_count));\n  EXPECT_GT(thumbnails_count, 0);\n}\n\nTEST_F(NewTabUITest, UpdateUserPrefsVersion) {\n  \/\/ PrefService with JSON user-pref file only, no enforced or advised prefs.\n  scoped_ptr<PrefService> prefs(new TestingPrefService);\n\n  \/\/ Does the migration\n  NewTabUI::RegisterUserPrefs(prefs.get());\n\n  ASSERT_EQ(NewTabUI::current_pref_version(),\n            prefs->GetInteger(prefs::kNTPPrefVersion));\n\n  \/\/ Reset the version\n  prefs->ClearPref(prefs::kNTPPrefVersion);\n  ASSERT_EQ(0, prefs->GetInteger(prefs::kNTPPrefVersion));\n\n  bool migrated = NewTabUI::UpdateUserPrefsVersion(prefs.get());\n  ASSERT_TRUE(migrated);\n  ASSERT_EQ(NewTabUI::current_pref_version(),\n            prefs->GetInteger(prefs::kNTPPrefVersion));\n\n  migrated = NewTabUI::UpdateUserPrefsVersion(prefs.get());\n  ASSERT_FALSE(migrated);\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Test has failed a few times in the current waterfall display.  The bug that enabled it is still open, so tagging it to that bug and just marking as flaky.<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"StdAfx.h\"\r\n#include \"TiffIFD.h\"\r\n#include \"TiffParser.h\"\r\n\/*\r\n    RawSpeed - RAW file decoder.\r\n\r\n    Copyright (C) 2009-2014 Klaus Post\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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\r\n\r\n    http:\/\/www.klauspost.com\r\n*\/\r\n\r\nnamespace RawSpeed {\r\n\r\n#ifdef CHECKSIZE\r\n#undef CHECKSIZE\r\n#endif\r\n\r\n#define CHECKSIZE(A) if (A > size) ThrowTPE(\"Error reading TIFF structure (invalid size). File Corrupt\")\r\n\r\nTiffIFD::TiffIFD() {\r\n  nextIFD = 0;\r\n  endian = little;\r\n  mFile = 0;\r\n}\r\n\r\nTiffIFD::TiffIFD(FileMap* f) {\r\n  nextIFD = 0;\r\n  endian = little;\r\n  mFile = f;\r\n}\r\n\r\nTiffIFD::TiffIFD(FileMap* f, uint32 offset) {\r\n  mFile = f;\r\n  uint32 size = f->getSize();\r\n  uint32 entries;\r\n  endian = little;\r\n  CHECKSIZE(offset);\r\n\r\n  entries = *(unsigned short*)f->getData(offset);    \/\/ Directory entries in this IFD\r\n\r\n  CHECKSIZE(offset + 2 + entries*4);\r\n  for (uint32 i = 0; i < entries; i++) {\r\n    TiffEntry *t = new TiffEntry(f, offset + 2 + i*12);\r\n\r\n    switch (t->tag) {\r\n      case DNGPRIVATEDATA: \r\n        {\r\n          try {\r\n            TiffIFD *maker_ifd = parseDngPrivateData(t);\r\n            mSubIFD.push_back(maker_ifd);\r\n            delete(t);\r\n          } catch (TiffParserException) {\r\n            \/\/ Unparsable private data are added as entries\r\n            mEntry[t->tag] = t;\r\n          }\r\n        }\r\n        break;\r\n      case MAKERNOTE:\r\n      case MAKERNOTE_ALT:\r\n        {\r\n          try {\r\n            mSubIFD.push_back(parseMakerNote(f, t->getDataOffset(), endian));\r\n            delete(t);\r\n          } catch (TiffParserException) {\r\n            \/\/ Unparsable makernotes are added as entries\r\n            mEntry[t->tag] = t;\r\n          }\r\n        }\r\n        break;\r\n\r\n      case FUJI_RAW_IFD:\r\n        if (t->type == 0xd) \/\/ FUJI - correct type\r\n          t->type = TIFF_LONG;\r\n      case SUBIFDS:\r\n      case EXIFIFDPOINTER:\r\n        try {\r\n          const unsigned int* sub_offsets = t->getIntArray();\r\n\r\n          for (uint32 j = 0; j < t->count; j++) {\r\n            mSubIFD.push_back(new TiffIFD(f, sub_offsets[j]));\r\n          }\r\n          delete(t);\r\n        } catch (TiffParserException) {\r\n          \/\/ Unparsable subifds are added as entries\r\n          mEntry[t->tag] = t;\r\n        }\r\n        break;\r\n      default:\r\n        mEntry[t->tag] = t;\r\n    }\r\n  }\r\n  nextIFD = *(int*)f->getData(offset + 2 + entries * 12);\r\n}\r\n\r\nTiffIFD* TiffIFD::parseDngPrivateData(TiffEntry *t) {\r\n  \/*\r\n  1. Six bytes containing the zero-terminated string \"Adobe\". (The DNG specification calls for the DNGPrivateData tag to start with an ASCII string identifying the creator\/format).\r\n  2. 4 bytes: an ASCII string (\"MakN\" for a Makernote),  indicating what sort of data is being stored here. Note that this is not zero-terminated.\r\n  3. A four-byte count (number of data bytes following); this is the length of the original MakerNote data. (This is always in \"most significant byte first\" format).\r\n  4. 2 bytes: the byte-order indicator from the original file (the usual 'MM'\/4D4D or 'II'\/4949).\r\n  5. 4 bytes: the original file offset for the MakerNote tag data (stored according to the byte order given above).\r\n  6. The contents of the MakerNote tag. This is a simple byte-for-byte copy, with no modification.\r\n  *\/\r\n  uint32 size = t->count;\r\n  const uchar8 *data = t->getData();\r\n  string id((const char*)data);\r\n  if (0 != id.compare(\"Adobe\"))\r\n    ThrowTPE(\"Not Adobe Private data\");\r\n\r\n  data+=6;\r\n  if (!(data[0] == 'M' && data[1] == 'a' && data[2] == 'k' &&data[3] == 'N' ))\r\n    ThrowTPE(\"Not Makernote\");\r\n\r\n  data+=4;\r\n  uint32 count;\r\n  if (big == getHostEndianness())\r\n    count = *(uint32*)data;\r\n  else\r\n    count = (unsigned int)data[0] << 24 | (unsigned int)data[1] << 16 | (unsigned int)data[2] << 8 | (unsigned int)data[3];\r\n\r\n  data+=4;\r\n  CHECKSIZE(count);\r\n  Endianness makernote_endian = unknown;\r\n  if (data[0] == 0x49 && data[1] == 0x49)\r\n    makernote_endian = little;\r\n  else if (data[0] == 0x4D && data[1] == 0x4D)\r\n    makernote_endian = big;\r\n  else\r\n    ThrowTPE(\"Cannot determine endianess of DNG makernote\");\r\n\r\n  data+=2;\r\n  uint32 org_offset;\r\n\r\n  if (big == getHostEndianness())\r\n    org_offset = *(uint32*)data;\r\n  else\r\n    org_offset = (unsigned int)data[0] << 24 | (unsigned int)data[1] << 16 | (unsigned int)data[2] << 8 | (unsigned int)data[3];\r\n\r\n  data+=4;\r\n  \/* We don't parse original makernotes that are placed after 300MB mark in the original file *\/\r\n  if (org_offset+count > 300*1024*1024)\r\n    ThrowTPE(\"Adobe Private data: original offset of makernote is past 300MB offset\");\r\n\r\n  \/* Create fake tiff with original offsets *\/\r\n  uchar8* maker_data = new uchar8[org_offset+count];\r\n  memcpy(&maker_data[org_offset],data, count);\r\n  FileMap *maker_map = new FileMap(maker_data, org_offset+count);\r\n\r\n  TiffIFD *maker_ifd;\r\n  try {\r\n    maker_ifd = parseMakerNote(maker_map, org_offset, makernote_endian);\r\n  } catch (TiffParserException &e) {\r\n    delete[] maker_data;\r\n    delete maker_map;\r\n    throw e;\r\n  }\r\n  delete[] maker_data;\r\n  delete maker_map;\r\n  return maker_ifd;\r\n}\r\n\r\nconst uchar8 fuji_signature[] = {\n  'F', 'U', 'J', 'I', 'F', 'I', 'L', 'M', 0x0c, 0x00, 0x00, 0x00\n};\r\n\r\n\/* This will attempt to parse makernotes and return it as an IFD *\/\r\nTiffIFD* TiffIFD::parseMakerNote(FileMap *f, uint32 offset, Endianness parent_end)\r\n{\r\n  FileMap *mFile = f;\r\n  uint32 size = f->getSize();\r\n  CHECKSIZE(offset + 20);\r\n  TiffIFD *maker_ifd = NULL;\r\n  const uchar8* data = f->getData(offset);\r\n\r\n  \/\/ Pentax makernote starts with AOC\\0 - If it's there, skip it\r\n  if (data[0] == 0x41 && data[1] == 0x4f && data[2] == 0x43 && data[3] == 0)\r\n  {\r\n    data +=4;\r\n    offset +=4;\r\n  }\r\n\r\n  \/\/ Pentax also has \"PENTAX\" at the start, makernote starts at 8\r\n  if (data[0] == 0x50 && data[1] == 0x45 && data[2] == 0x4e && data[3] == 0x54 && data[4] == 0x41 && data[5] == 0x58)\r\n  {\r\n    mFile = new FileMap(f->getDataWrt(offset), f->getSize()-offset);\r\n    parent_end = getTiffEndianness((const ushort16*)&data[8]);\r\n    if (parent_end == unknown)\r\n      ThrowTPE(\"Cannot determine Pentax makernote endianness\");\r\n    data +=10;\r\n    offset = 10;\r\n  }\r\n  \/\/ Panasonic has the word Exif at byte 6, a complete Tiff header starts at byte 12\r\n  \/\/ This TIFF is 0 offset based\r\n  if (data[6] == 0x45 && data[7] == 0x78 && data[8] == 0x69 && data[9] == 0x66)\r\n  {\r\n    parent_end = getTiffEndianness((const ushort16*)&data[12]);\r\n    if (parent_end == unknown)\r\n      ThrowTPE(\"Cannot determine Panasonic makernote endianness\");\r\n    data +=20;\r\n    offset +=20;\r\n  }\r\n\r\n  \/\/ Check for fuji signature\r\n\r\n  if (0 == memcmp(fuji_signature,&data[0], sizeof(fuji_signature))) {\r\n    mFile = new FileMap(f->getDataWrt(offset), f->getSize()-offset);\r\n    offset = 12;\r\n  }\r\n\r\n  \/\/ Some have MM or II to indicate endianness - read that\r\n  if (data[0] == 0x49 && data[1] == 0x49) {\r\n    offset +=2;\r\n    parent_end = little;\r\n  } else if (data[0] == 0x4D && data[1] == 0x4D) {\r\n    parent_end = big;\r\n    offset +=2;\r\n  }\r\n\r\n  \/\/ Attempt to parse the rest as an IFD\r\n  try {\r\n    if (parent_end == getHostEndianness())\r\n      maker_ifd = new TiffIFD(mFile, offset);\r\n    else\r\n      maker_ifd = new TiffIFDBE(mFile, offset);\r\n  } catch (...) {\r\n    if (mFile != f)\r\n      delete mFile;\r\n \t  throw;\r\n  }\r\n\r\n  if (mFile != f)\r\n    delete mFile;\r\n  \/\/ If the structure cannot be read, a TiffParserException will be thrown.\r\n  mFile = f;\r\n  return maker_ifd;\r\n}\r\n\r\nTiffIFD::~TiffIFD(void) {\r\n  for (map<TiffTag, TiffEntry*>::iterator i = mEntry.begin(); i != mEntry.end(); ++i) {\r\n    delete((*i).second);\r\n  }\r\n  mEntry.clear();\r\n  for (vector<TiffIFD*>::iterator i = mSubIFD.begin(); i != mSubIFD.end(); ++i) {\r\n    delete(*i);\r\n  }\r\n  mSubIFD.clear();\r\n}\r\n\r\nbool TiffIFD::hasEntryRecursive(TiffTag tag) {\r\n  if (mEntry.find(tag) != mEntry.end())\r\n    return TRUE;\r\n  for (vector<TiffIFD*>::iterator i = mSubIFD.begin(); i != mSubIFD.end(); ++i) {\r\n    if ((*i)->hasEntryRecursive(tag))\r\n      return TRUE;\r\n  }\r\n  return false;\r\n}\r\n\r\nvector<TiffIFD*> TiffIFD::getIFDsWithTag(TiffTag tag) {\r\n  vector<TiffIFD*> matchingIFDs;\r\n  if (mEntry.find(tag) != mEntry.end()) {\r\n    matchingIFDs.push_back(this);\r\n  }\r\n  for (vector<TiffIFD*>::iterator i = mSubIFD.begin(); i != mSubIFD.end(); ++i) {\r\n    vector<TiffIFD*> t = (*i)->getIFDsWithTag(tag);\r\n    for (uint32 j = 0; j < t.size(); j++) {\r\n      matchingIFDs.push_back(t[j]);\r\n    }\r\n  }\r\n  return matchingIFDs;\r\n}\r\n\r\nvector<TiffIFD*> TiffIFD::getIFDsWithTagWhere(TiffTag tag, uint32 isValue) {\r\n  vector<TiffIFD*> matchingIFDs;\r\n  if (mEntry.find(tag) != mEntry.end()) {\r\n    TiffEntry* entry = mEntry[tag];\r\n    if (entry->isInt() && entry->getInt() == isValue)\r\n      matchingIFDs.push_back(this);\r\n  }\r\n  for (vector<TiffIFD*>::iterator i = mSubIFD.begin(); i != mSubIFD.end(); ++i) {\r\n    vector<TiffIFD*> t = (*i)->getIFDsWithTag(tag);\r\n    for (uint32 j = 0; j < t.size(); j++) {\r\n      matchingIFDs.push_back(t[j]);\r\n    }\r\n  }\r\n  return matchingIFDs;\r\n}\r\n\r\nvector<TiffIFD*> TiffIFD::getIFDsWithTagWhere(TiffTag tag, string isValue) {\r\n  vector<TiffIFD*> matchingIFDs;\r\n  if (mEntry.find(tag) != mEntry.end()) {\r\n    TiffEntry* entry = mEntry[tag];\r\n    if (entry->isString() && 0 == entry->getString().compare(isValue))\r\n      matchingIFDs.push_back(this);\r\n  }\r\n  for (vector<TiffIFD*>::iterator i = mSubIFD.begin(); i != mSubIFD.end(); ++i) {\r\n    vector<TiffIFD*> t = (*i)->getIFDsWithTag(tag);\r\n    for (uint32 j = 0; j < t.size(); j++) {\r\n      matchingIFDs.push_back(t[j]);\r\n    }\r\n  }\r\n  return matchingIFDs;\r\n}\r\n\r\nTiffEntry* TiffIFD::getEntryRecursive(TiffTag tag) {\r\n  if (mEntry.find(tag) != mEntry.end()) {\r\n    return mEntry[tag];\r\n  }\r\n  for (vector<TiffIFD*>::iterator i = mSubIFD.begin(); i != mSubIFD.end(); ++i) {\r\n    TiffEntry* entry = (*i)->getEntryRecursive(tag);\r\n    if (entry)\r\n      return entry;\r\n  }\r\n  return NULL;\r\n}\r\n\r\nTiffEntry* TiffIFD::getEntryRecursiveWhere(TiffTag tag, uint32 isValue) {\r\n  if (mEntry.find(tag) != mEntry.end()) {\r\n    TiffEntry* entry = mEntry[tag];\r\n    if (entry->isInt() && entry->getInt() == isValue)\r\n      return entry;\r\n  }\r\n  for (vector<TiffIFD*>::iterator i = mSubIFD.begin(); i != mSubIFD.end(); ++i) {\r\n    TiffEntry* entry = (*i)->getEntryRecursive(tag);\r\n    if (entry)\r\n      return entry;\r\n  }\r\n  return NULL;\r\n}\r\n\r\nTiffEntry* TiffIFD::getEntryRecursiveWhere(TiffTag tag, string isValue) {\r\n  if (mEntry.find(tag) != mEntry.end()) {\r\n    TiffEntry* entry = mEntry[tag];\r\n    if (entry->isString() && 0 == entry->getString().compare(isValue))\r\n      return entry;\r\n  }\r\n  for (vector<TiffIFD*>::iterator i = mSubIFD.begin(); i != mSubIFD.end(); ++i) {\r\n    TiffEntry* entry = (*i)->getEntryRecursive(tag);\r\n    if (entry)\r\n      return entry;\r\n  }\r\n  return NULL;\r\n}\r\n\r\nTiffEntry* TiffIFD::getEntry(TiffTag tag) {\r\n  if (mEntry.find(tag) != mEntry.end()) {\r\n    return mEntry[tag];\r\n  }\r\n  ThrowTPE(\"TiffIFD: TIFF Parser entry 0x%x not found.\", tag);\r\n  return 0;\r\n}\r\n\r\n\r\nbool TiffIFD::hasEntry(TiffTag tag) {\r\n  return mEntry.find(tag) != mEntry.end();\r\n}\r\n\r\n} \/\/ namespace RawSpeed\r\n<commit_msg>Fix an unlikely memory leak found by coverity<commit_after>#include \"StdAfx.h\"\r\n#include \"TiffIFD.h\"\r\n#include \"TiffParser.h\"\r\n\/*\r\n    RawSpeed - RAW file decoder.\r\n\r\n    Copyright (C) 2009-2014 Klaus Post\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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\r\n\r\n    http:\/\/www.klauspost.com\r\n*\/\r\n\r\nnamespace RawSpeed {\r\n\r\n#ifdef CHECKSIZE\r\n#undef CHECKSIZE\r\n#endif\r\n\r\n#define CHECKSIZE(A) if (A > size) ThrowTPE(\"Error reading TIFF structure (invalid size). File Corrupt\")\r\n\r\nTiffIFD::TiffIFD() {\r\n  nextIFD = 0;\r\n  endian = little;\r\n  mFile = 0;\r\n}\r\n\r\nTiffIFD::TiffIFD(FileMap* f) {\r\n  nextIFD = 0;\r\n  endian = little;\r\n  mFile = f;\r\n}\r\n\r\nTiffIFD::TiffIFD(FileMap* f, uint32 offset) {\r\n  mFile = f;\r\n  uint32 size = f->getSize();\r\n  uint32 entries;\r\n  endian = little;\r\n  CHECKSIZE(offset);\r\n\r\n  entries = *(unsigned short*)f->getData(offset);    \/\/ Directory entries in this IFD\r\n\r\n  CHECKSIZE(offset + 2 + entries*4);\r\n  for (uint32 i = 0; i < entries; i++) {\r\n    TiffEntry *t = new TiffEntry(f, offset + 2 + i*12);\r\n\r\n    switch (t->tag) {\r\n      case DNGPRIVATEDATA: \r\n        {\r\n          try {\r\n            TiffIFD *maker_ifd = parseDngPrivateData(t);\r\n            mSubIFD.push_back(maker_ifd);\r\n            delete(t);\r\n          } catch (TiffParserException) {\r\n            \/\/ Unparsable private data are added as entries\r\n            mEntry[t->tag] = t;\r\n          }\r\n        }\r\n        break;\r\n      case MAKERNOTE:\r\n      case MAKERNOTE_ALT:\r\n        {\r\n          try {\r\n            mSubIFD.push_back(parseMakerNote(f, t->getDataOffset(), endian));\r\n            delete(t);\r\n          } catch (TiffParserException) {\r\n            \/\/ Unparsable makernotes are added as entries\r\n            mEntry[t->tag] = t;\r\n          }\r\n        }\r\n        break;\r\n\r\n      case FUJI_RAW_IFD:\r\n        if (t->type == 0xd) \/\/ FUJI - correct type\r\n          t->type = TIFF_LONG;\r\n      case SUBIFDS:\r\n      case EXIFIFDPOINTER:\r\n        try {\r\n          const unsigned int* sub_offsets = t->getIntArray();\r\n\r\n          for (uint32 j = 0; j < t->count; j++) {\r\n            mSubIFD.push_back(new TiffIFD(f, sub_offsets[j]));\r\n          }\r\n          delete(t);\r\n        } catch (TiffParserException) {\r\n          \/\/ Unparsable subifds are added as entries\r\n          mEntry[t->tag] = t;\r\n        }\r\n        break;\r\n      default:\r\n        mEntry[t->tag] = t;\r\n    }\r\n  }\r\n  nextIFD = *(int*)f->getData(offset + 2 + entries * 12);\r\n}\r\n\r\nTiffIFD* TiffIFD::parseDngPrivateData(TiffEntry *t) {\r\n  \/*\r\n  1. Six bytes containing the zero-terminated string \"Adobe\". (The DNG specification calls for the DNGPrivateData tag to start with an ASCII string identifying the creator\/format).\r\n  2. 4 bytes: an ASCII string (\"MakN\" for a Makernote),  indicating what sort of data is being stored here. Note that this is not zero-terminated.\r\n  3. A four-byte count (number of data bytes following); this is the length of the original MakerNote data. (This is always in \"most significant byte first\" format).\r\n  4. 2 bytes: the byte-order indicator from the original file (the usual 'MM'\/4D4D or 'II'\/4949).\r\n  5. 4 bytes: the original file offset for the MakerNote tag data (stored according to the byte order given above).\r\n  6. The contents of the MakerNote tag. This is a simple byte-for-byte copy, with no modification.\r\n  *\/\r\n  uint32 size = t->count;\r\n  const uchar8 *data = t->getData();\r\n  string id((const char*)data);\r\n  if (0 != id.compare(\"Adobe\"))\r\n    ThrowTPE(\"Not Adobe Private data\");\r\n\r\n  data+=6;\r\n  if (!(data[0] == 'M' && data[1] == 'a' && data[2] == 'k' &&data[3] == 'N' ))\r\n    ThrowTPE(\"Not Makernote\");\r\n\r\n  data+=4;\r\n  uint32 count;\r\n  if (big == getHostEndianness())\r\n    count = *(uint32*)data;\r\n  else\r\n    count = (unsigned int)data[0] << 24 | (unsigned int)data[1] << 16 | (unsigned int)data[2] << 8 | (unsigned int)data[3];\r\n\r\n  data+=4;\r\n  CHECKSIZE(count);\r\n  Endianness makernote_endian = unknown;\r\n  if (data[0] == 0x49 && data[1] == 0x49)\r\n    makernote_endian = little;\r\n  else if (data[0] == 0x4D && data[1] == 0x4D)\r\n    makernote_endian = big;\r\n  else\r\n    ThrowTPE(\"Cannot determine endianess of DNG makernote\");\r\n\r\n  data+=2;\r\n  uint32 org_offset;\r\n\r\n  if (big == getHostEndianness())\r\n    org_offset = *(uint32*)data;\r\n  else\r\n    org_offset = (unsigned int)data[0] << 24 | (unsigned int)data[1] << 16 | (unsigned int)data[2] << 8 | (unsigned int)data[3];\r\n\r\n  data+=4;\r\n  \/* We don't parse original makernotes that are placed after 300MB mark in the original file *\/\r\n  if (org_offset+count > 300*1024*1024)\r\n    ThrowTPE(\"Adobe Private data: original offset of makernote is past 300MB offset\");\r\n\r\n  \/* Create fake tiff with original offsets *\/\r\n  uchar8* maker_data = new uchar8[org_offset+count];\r\n  memcpy(&maker_data[org_offset],data, count);\r\n  FileMap *maker_map = new FileMap(maker_data, org_offset+count);\r\n\r\n  TiffIFD *maker_ifd;\r\n  try {\r\n    maker_ifd = parseMakerNote(maker_map, org_offset, makernote_endian);\r\n  } catch (TiffParserException &e) {\r\n    delete[] maker_data;\r\n    delete maker_map;\r\n    throw e;\r\n  }\r\n  delete[] maker_data;\r\n  delete maker_map;\r\n  return maker_ifd;\r\n}\r\n\r\nconst uchar8 fuji_signature[] = {\n  'F', 'U', 'J', 'I', 'F', 'I', 'L', 'M', 0x0c, 0x00, 0x00, 0x00\n};\r\n\r\n\/* This will attempt to parse makernotes and return it as an IFD *\/\r\nTiffIFD* TiffIFD::parseMakerNote(FileMap *f, uint32 offset, Endianness parent_end)\r\n{\r\n  FileMap *mFile = f;\r\n  uint32 size = f->getSize();\r\n  CHECKSIZE(offset + 20);\r\n  TiffIFD *maker_ifd = NULL;\r\n  const uchar8* data = f->getData(offset);\r\n\r\n  \/\/ Pentax makernote starts with AOC\\0 - If it's there, skip it\r\n  if (data[0] == 0x41 && data[1] == 0x4f && data[2] == 0x43 && data[3] == 0)\r\n  {\r\n    data +=4;\r\n    offset +=4;\r\n  }\r\n\r\n  \/\/ Pentax also has \"PENTAX\" at the start, makernote starts at 8\r\n  if (data[0] == 0x50 && data[1] == 0x45 && data[2] == 0x4e && data[3] == 0x54 && data[4] == 0x41 && data[5] == 0x58)\r\n  {\r\n    mFile = new FileMap(f->getDataWrt(offset), f->getSize()-offset);\r\n    parent_end = getTiffEndianness((const ushort16*)&data[8]);\r\n    if (parent_end == unknown)\r\n      ThrowTPE(\"Cannot determine Pentax makernote endianness\");\r\n    data +=10;\r\n    offset = 10;\r\n  \/\/ Check for fuji signature in else block so we don't accidentally leak FileMap\n  } else if (0 == memcmp(fuji_signature,&data[0], sizeof(fuji_signature))) {\n    mFile = new FileMap(f->getDataWrt(offset), f->getSize()-offset);\n    offset = 12;\n  }\r\n\n  \/\/ Panasonic has the word Exif at byte 6, a complete Tiff header starts at byte 12\r\n  \/\/ This TIFF is 0 offset based\r\n  if (data[6] == 0x45 && data[7] == 0x78 && data[8] == 0x69 && data[9] == 0x66)\r\n  {\r\n    parent_end = getTiffEndianness((const ushort16*)&data[12]);\r\n    if (parent_end == unknown)\r\n      ThrowTPE(\"Cannot determine Panasonic makernote endianness\");\r\n    data +=20;\r\n    offset +=20;\r\n  }\r\n\r\n  \/\/ Some have MM or II to indicate endianness - read that\r\n  if (data[0] == 0x49 && data[1] == 0x49) {\r\n    offset +=2;\r\n    parent_end = little;\r\n  } else if (data[0] == 0x4D && data[1] == 0x4D) {\r\n    parent_end = big;\r\n    offset +=2;\r\n  }\r\n\r\n  \/\/ Attempt to parse the rest as an IFD\r\n  try {\r\n    if (parent_end == getHostEndianness())\r\n      maker_ifd = new TiffIFD(mFile, offset);\r\n    else\r\n      maker_ifd = new TiffIFDBE(mFile, offset);\r\n  } catch (...) {\r\n    if (mFile != f)\r\n      delete mFile;\r\n \t  throw;\r\n  }\r\n\r\n  if (mFile != f)\r\n    delete mFile;\r\n  \/\/ If the structure cannot be read, a TiffParserException will be thrown.\r\n  mFile = f;\r\n  return maker_ifd;\r\n}\r\n\r\nTiffIFD::~TiffIFD(void) {\r\n  for (map<TiffTag, TiffEntry*>::iterator i = mEntry.begin(); i != mEntry.end(); ++i) {\r\n    delete((*i).second);\r\n  }\r\n  mEntry.clear();\r\n  for (vector<TiffIFD*>::iterator i = mSubIFD.begin(); i != mSubIFD.end(); ++i) {\r\n    delete(*i);\r\n  }\r\n  mSubIFD.clear();\r\n}\r\n\r\nbool TiffIFD::hasEntryRecursive(TiffTag tag) {\r\n  if (mEntry.find(tag) != mEntry.end())\r\n    return TRUE;\r\n  for (vector<TiffIFD*>::iterator i = mSubIFD.begin(); i != mSubIFD.end(); ++i) {\r\n    if ((*i)->hasEntryRecursive(tag))\r\n      return TRUE;\r\n  }\r\n  return false;\r\n}\r\n\r\nvector<TiffIFD*> TiffIFD::getIFDsWithTag(TiffTag tag) {\r\n  vector<TiffIFD*> matchingIFDs;\r\n  if (mEntry.find(tag) != mEntry.end()) {\r\n    matchingIFDs.push_back(this);\r\n  }\r\n  for (vector<TiffIFD*>::iterator i = mSubIFD.begin(); i != mSubIFD.end(); ++i) {\r\n    vector<TiffIFD*> t = (*i)->getIFDsWithTag(tag);\r\n    for (uint32 j = 0; j < t.size(); j++) {\r\n      matchingIFDs.push_back(t[j]);\r\n    }\r\n  }\r\n  return matchingIFDs;\r\n}\r\n\r\nvector<TiffIFD*> TiffIFD::getIFDsWithTagWhere(TiffTag tag, uint32 isValue) {\r\n  vector<TiffIFD*> matchingIFDs;\r\n  if (mEntry.find(tag) != mEntry.end()) {\r\n    TiffEntry* entry = mEntry[tag];\r\n    if (entry->isInt() && entry->getInt() == isValue)\r\n      matchingIFDs.push_back(this);\r\n  }\r\n  for (vector<TiffIFD*>::iterator i = mSubIFD.begin(); i != mSubIFD.end(); ++i) {\r\n    vector<TiffIFD*> t = (*i)->getIFDsWithTag(tag);\r\n    for (uint32 j = 0; j < t.size(); j++) {\r\n      matchingIFDs.push_back(t[j]);\r\n    }\r\n  }\r\n  return matchingIFDs;\r\n}\r\n\r\nvector<TiffIFD*> TiffIFD::getIFDsWithTagWhere(TiffTag tag, string isValue) {\r\n  vector<TiffIFD*> matchingIFDs;\r\n  if (mEntry.find(tag) != mEntry.end()) {\r\n    TiffEntry* entry = mEntry[tag];\r\n    if (entry->isString() && 0 == entry->getString().compare(isValue))\r\n      matchingIFDs.push_back(this);\r\n  }\r\n  for (vector<TiffIFD*>::iterator i = mSubIFD.begin(); i != mSubIFD.end(); ++i) {\r\n    vector<TiffIFD*> t = (*i)->getIFDsWithTag(tag);\r\n    for (uint32 j = 0; j < t.size(); j++) {\r\n      matchingIFDs.push_back(t[j]);\r\n    }\r\n  }\r\n  return matchingIFDs;\r\n}\r\n\r\nTiffEntry* TiffIFD::getEntryRecursive(TiffTag tag) {\r\n  if (mEntry.find(tag) != mEntry.end()) {\r\n    return mEntry[tag];\r\n  }\r\n  for (vector<TiffIFD*>::iterator i = mSubIFD.begin(); i != mSubIFD.end(); ++i) {\r\n    TiffEntry* entry = (*i)->getEntryRecursive(tag);\r\n    if (entry)\r\n      return entry;\r\n  }\r\n  return NULL;\r\n}\r\n\r\nTiffEntry* TiffIFD::getEntryRecursiveWhere(TiffTag tag, uint32 isValue) {\r\n  if (mEntry.find(tag) != mEntry.end()) {\r\n    TiffEntry* entry = mEntry[tag];\r\n    if (entry->isInt() && entry->getInt() == isValue)\r\n      return entry;\r\n  }\r\n  for (vector<TiffIFD*>::iterator i = mSubIFD.begin(); i != mSubIFD.end(); ++i) {\r\n    TiffEntry* entry = (*i)->getEntryRecursive(tag);\r\n    if (entry)\r\n      return entry;\r\n  }\r\n  return NULL;\r\n}\r\n\r\nTiffEntry* TiffIFD::getEntryRecursiveWhere(TiffTag tag, string isValue) {\r\n  if (mEntry.find(tag) != mEntry.end()) {\r\n    TiffEntry* entry = mEntry[tag];\r\n    if (entry->isString() && 0 == entry->getString().compare(isValue))\r\n      return entry;\r\n  }\r\n  for (vector<TiffIFD*>::iterator i = mSubIFD.begin(); i != mSubIFD.end(); ++i) {\r\n    TiffEntry* entry = (*i)->getEntryRecursive(tag);\r\n    if (entry)\r\n      return entry;\r\n  }\r\n  return NULL;\r\n}\r\n\r\nTiffEntry* TiffIFD::getEntry(TiffTag tag) {\r\n  if (mEntry.find(tag) != mEntry.end()) {\r\n    return mEntry[tag];\r\n  }\r\n  ThrowTPE(\"TiffIFD: TIFF Parser entry 0x%x not found.\", tag);\r\n  return 0;\r\n}\r\n\r\n\r\nbool TiffIFD::hasEntry(TiffTag tag) {\r\n  return mEntry.find(tag) != mEntry.end();\r\n}\r\n\r\n} \/\/ namespace RawSpeed\r\n<|endoftext|>"}
{"text":"<commit_before>#ifndef __MEMORY_TEMPLATES_HPP_INCLUDED\n#define __MEMORY_TEMPLATES_HPP_INCLUDED\n\n\/\/ Include standard headers\n#include <cstddef> \/\/ std::size_t\n#include <stdint.h> \/\/ uint32_t etc.\n\nnamespace yli\n{\n    namespace memory\n    {\n        template<class T1, class T2>\n            T2 read_nonaligned_32_bit(T1* src_data, std::size_t offset)\n            {\n                uint8_t* src_data_uint8_t = (uint8_t*) src_data;\n                T2 value_32_bit = static_cast<T2>(src_data_uint8_t[offset + 3]);\n                value_32_bit = value_32_bit << 8 | static_cast<T2>(src_data_uint8_t[offset + 2]);\n                value_32_bit = value_32_bit << 8 | static_cast<T2>(src_data_uint8_t[offset + 1]);\n                value_32_bit = value_32_bit << 8 | static_cast<T2>(src_data_uint8_t[offset]);\n                return value_32_bit;\n            }\n\n        template<class T1>\n            void flip_vertically(T1* src_data, std::size_t image_width, std::size_t image_height)\n            {\n                for (std::size_t y = 0; y < image_height \/ 2; y++)\n                {\n                    for (std::size_t x = 0; x < image_width; x++)\n                    {\n                        std::size_t upper_index = image_width * y + x;\n                        std::size_t lower_index = image_width * (image_height - y - 1) + x;\n                        T1 temp = src_data[upper_index];\n                        src_data[upper_index] = src_data[lower_index];\n                        src_data[lower_index] = temp;\n                    }\n                }\n            }\n    }\n}\n\n#endif\n<commit_msg>Edited whitespace.<commit_after>#ifndef __MEMORY_TEMPLATES_HPP_INCLUDED\n#define __MEMORY_TEMPLATES_HPP_INCLUDED\n\n\/\/ Include standard headers\n#include <cstddef>  \/\/ std::size_t\n#include <stdint.h> \/\/ uint32_t etc.\n\nnamespace yli\n{\n    namespace memory\n    {\n        template<class T1, class T2>\n            T2 read_nonaligned_32_bit(T1* src_data, std::size_t offset)\n            {\n                uint8_t* src_data_uint8_t = (uint8_t*) src_data;\n                T2 value_32_bit = static_cast<T2>(src_data_uint8_t[offset + 3]);\n                value_32_bit = value_32_bit << 8 | static_cast<T2>(src_data_uint8_t[offset + 2]);\n                value_32_bit = value_32_bit << 8 | static_cast<T2>(src_data_uint8_t[offset + 1]);\n                value_32_bit = value_32_bit << 8 | static_cast<T2>(src_data_uint8_t[offset]);\n                return value_32_bit;\n            }\n\n        template<class T1>\n            void flip_vertically(T1* src_data, std::size_t image_width, std::size_t image_height)\n            {\n                for (std::size_t y = 0; y < image_height \/ 2; y++)\n                {\n                    for (std::size_t x = 0; x < image_width; x++)\n                    {\n                        std::size_t upper_index = image_width * y + x;\n                        std::size_t lower_index = image_width * (image_height - y - 1) + x;\n                        T1 temp = src_data[upper_index];\n                        src_data[upper_index] = src_data[lower_index];\n                        src_data[lower_index] = temp;\n                    }\n                }\n            }\n    }\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>INTEGRATION: CWS dbgmacros1 (1.4.44); FILE MERGED 2003\/04\/09 11:54:47 kso 1.4.44.1: #108413# - debug macro unification.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2004-2015 Cray Inc.\n * Other additional copyright holders may be indicated within.\n * \n * The entirety of this work is licensed under the Apache License,\n * Version 2.0 (the \"License\"); you may not use this file except\n * 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, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 \"passes.h\"\n\n#include \"astutil.h\"\n#include \"stlUtil.h\"\n#include \"expr.h\"\n#include \"stmt.h\"\n#include \"stringutil.h\"\n\n#include <cstdio>\n\n\/\/ This pass pulls out any global constants to the top of the given\n\/\/ function (with the motivation to avoid loads during loops).\n\n\/\/ Note that this work cannot be done within an init function s.t. the\n\/\/ global constant still retains its value (otherwise, the init function\n\/\/ would set a local copy of a given value, and other functions wouldn't\n\/\/ see the intended value.\n\nvoid localizeGlobals() {\n  if (fNoGlobalConstOpt) return;\n  forv_Vec(FnSymbol, fn, gFnSymbols) {\n    Map<Symbol*,VarSymbol*> globals;\n    std::vector<BaseAST*> asts;\n    collect_asts(fn->body, asts);\n    for_vector(BaseAST, ast, asts) {\n      if (SymExpr* se = toSymExpr(ast)) {\n        Symbol* var = se->var;\n        ModuleSymbol* parentmod = toModuleSymbol(var->defPoint->parentSymbol);\n\n        \/\/ Is var a global constant?\n        \/\/ Don't replace the var name in its init function since that's\n        \/\/      where we're setting the value.\n        \/\/ If the parentSymbol is the rootModule, the var is 'void,'\n        \/\/      'false,' '0,' ...\n        if (parentmod &&\n            fn != parentmod->initFn &&\n            var->hasFlag(FLAG_CONST) &&\n            var->defPoint->parentSymbol != rootModule) {\n          VarSymbol* local_global = globals.get(var);\n          SET_LINENO(se); \/\/ Set the se line number for output\n          if (!local_global) {\n            const char * newname = astr(\"local_\", var->cname);\n            local_global = newTemp(newname, var->type);\n            fn->insertAtHead(new CallExpr(PRIM_MOVE, local_global, var));\n            fn->insertAtHead(new DefExpr(local_global));\n\n            globals.put(var, local_global);\n          }\n          se->replace(new SymExpr(toSymbol(local_global)));\n        }\n      }\n    }\n  }\n}\n<commit_msg>Disable localizeGlobals optimization because it interferes with IR creation under AMM.<commit_after>\/*\n * Copyright 2004-2015 Cray Inc.\n * Other additional copyright holders may be indicated within.\n * \n * The entirety of this work is licensed under the Apache License,\n * Version 2.0 (the \"License\"); you may not use this file except\n * 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, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 \"passes.h\"\n\n#include \"astutil.h\"\n#include \"stlUtil.h\"\n#include \"expr.h\"\n#include \"stmt.h\"\n#include \"stringutil.h\"\n\n#include <cstdio>\n\n\/\/ This pass pulls out any global constants to the top of the given\n\/\/ function (with the motivation to avoid loads during loops).\n\n\/\/ Note that this work cannot be done within an init function s.t. the\n\/\/ global constant still retains its value (otherwise, the init function\n\/\/ would set a local copy of a given value, and other functions wouldn't\n\/\/ see the intended value.\n\nvoid localizeGlobals() {\n  \/\/ This pass is not implemented correctly, so disabled for now.  \n  \/\/ Generally, it is safe to pass a global (module-level) variable by\n  \/\/ reference, because its lifetime equals that of the program.  But this\n  \/\/ localization makes a copy whose lifetime is only as long as the containing\n  \/\/ routine.\n  \/\/ With code such as:\n  \/\/  proc foo() : ref string {\n  \/\/    return \"my_literal_string\";\n  \/\/  }\n  \/\/ we are in trouble, because the (localized) object being returned is\n  \/\/ deleted before it is returned.\n  \/\/ This would be true for any localized global, but is especially a problem\n  \/\/ for strings, because all string literals are stored as globals.\n  \/\/\n  \/\/ I think the reason for this optimization in the first place is to reduce\n  \/\/ communication costs.  In which case, remote value forwarding or\n  \/\/ replicating globals on each locale is a better approach.  Since the\n  \/\/ globals being copied here are const, caching them (as locale-private data)\n  \/\/ on each network node will work fine and the potential for references to\n  \/\/ freed memory.\n  \/\/ \n  \/\/ Under the new AMM, many arguments -- including those passed into routines\n  \/\/ that create iterator records -- are passed by reference.  To avoid\n  \/\/ creating an iterator that points to freed (stack() memory, disabling this\n  \/\/ optimization is necessary.  The test case of interest is\n  \/\/ beer-promoted-infer-explicit.  As of this writing there were other issues,\n  \/\/ but once it works, re-enabling this optimization in its current form\n  \/\/ should expose the error readily.\n  if (fNoGlobalConstOpt || true) return;\n  forv_Vec(FnSymbol, fn, gFnSymbols) {\n    Map<Symbol*,VarSymbol*> globals;\n    std::vector<BaseAST*> asts;\n    collect_asts(fn->body, asts);\n    for_vector(BaseAST, ast, asts) {\n      if (SymExpr* se = toSymExpr(ast)) {\n        Symbol* var = se->var;\n        ModuleSymbol* parentmod = toModuleSymbol(var->defPoint->parentSymbol);\n\n        \/\/ Is var a global constant?\n        \/\/ Don't replace the var name in its init function since that's\n        \/\/      where we're setting the value.\n        \/\/ If the parentSymbol is the rootModule, the var is 'void,'\n        \/\/      'false,' '0,' ...\n        if (parentmod &&\n            fn != parentmod->initFn &&\n            var->hasFlag(FLAG_CONST) &&\n            var->defPoint->parentSymbol != rootModule) {\n          VarSymbol* local_global = globals.get(var);\n          SET_LINENO(se); \/\/ Set the se line number for output\n          if (!local_global) {\n            const char * newname = astr(\"local_\", var->cname);\n            local_global = newTemp(newname, var->type);\n            fn->insertAtHead(new CallExpr(PRIM_MOVE, local_global, var));\n            fn->insertAtHead(new DefExpr(local_global));\n\n            globals.put(var, local_global);\n          }\n          se->replace(new SymExpr(toSymbol(local_global)));\n        }\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 \"content\/renderer\/p2p\/ipc_socket_factory.h\"\n\n#include <deque>\n\n#include \"base\/compiler_specific.h\"\n#include \"base\/debug\/trace_event.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/message_loop_proxy.h\"\n#include \"content\/renderer\/p2p\/socket_client.h\"\n#include \"content\/renderer\/p2p\/socket_dispatcher.h\"\n#include \"jingle\/glue\/utils.h\"\n#include \"third_party\/libjingle\/source\/talk\/base\/asyncpacketsocket.h\"\n\nnamespace content {\n\nnamespace {\n\n\/\/ TODO(miu): This needs tuning.  http:\/\/crbug.com\/237960\nconst size_t kMaximumInFlightBytes = 64 * 1024;  \/\/ 64 KB\n\n\/\/ IpcPacketSocket implements talk_base::AsyncPacketSocket interface\n\/\/ using P2PSocketClient that works over IPC-channel. It must be used\n\/\/ on the thread it was created.\nclass IpcPacketSocket : public talk_base::AsyncPacketSocket,\n                        public P2PSocketClient::Delegate {\n public:\n  IpcPacketSocket();\n  virtual ~IpcPacketSocket();\n\n  \/\/ Always takes ownership of client even if initialization fails.\n  bool Init(P2PSocketType type, P2PSocketClient* client,\n            const talk_base::SocketAddress& local_address,\n            const talk_base::SocketAddress& remote_address);\n\n  \/\/ talk_base::AsyncPacketSocket interface.\n  virtual talk_base::SocketAddress GetLocalAddress() const OVERRIDE;\n  virtual talk_base::SocketAddress GetRemoteAddress() const OVERRIDE;\n  virtual int Send(const void *pv, size_t cb) OVERRIDE;\n  virtual int SendTo(const void *pv, size_t cb,\n                     const talk_base::SocketAddress& addr) OVERRIDE;\n  virtual int Close() OVERRIDE;\n  virtual State GetState() const OVERRIDE;\n  virtual int GetOption(talk_base::Socket::Option opt, int* value) OVERRIDE;\n  virtual int SetOption(talk_base::Socket::Option opt, int value) OVERRIDE;\n  virtual int GetError() const OVERRIDE;\n  virtual void SetError(int error) OVERRIDE;\n\n  \/\/ P2PSocketClient::Delegate implementation.\n  virtual void OnOpen(const net::IPEndPoint& address) OVERRIDE;\n  virtual void OnIncomingTcpConnection(const net::IPEndPoint& address,\n                                       P2PSocketClient* client) OVERRIDE;\n  virtual void OnSendComplete() OVERRIDE;\n  virtual void OnError() OVERRIDE;\n  virtual void OnDataReceived(const net::IPEndPoint& address,\n                              const std::vector<char>& data) OVERRIDE;\n\n private:\n  enum InternalState {\n    IS_UNINITIALIZED,\n    IS_OPENING,\n    IS_OPEN,\n    IS_CLOSED,\n    IS_ERROR,\n  };\n\n  \/\/ Update trace of send throttling internal state. This should be called\n  \/\/ immediately after any changes to |send_bytes_available_| and\/or\n  \/\/ |in_flight_packet_sizes_|.\n  void TraceSendThrottlingState() const;\n\n  void InitAcceptedTcp(P2PSocketClient* client,\n                       const talk_base::SocketAddress& local_address,\n                       const talk_base::SocketAddress& remote_address);\n\n  P2PSocketType type_;\n\n  \/\/ Message loop on which this socket was created and being used.\n  base::MessageLoop* message_loop_;\n\n  \/\/ Corresponding P2P socket client.\n  scoped_refptr<P2PSocketClient> client_;\n\n  \/\/ Local address is allocated by the browser process, and the\n  \/\/ renderer side doesn't know the address until it receives OnOpen()\n  \/\/ event from the browser.\n  talk_base::SocketAddress local_address_;\n\n  \/\/ Remote address for client TCP connections.\n  talk_base::SocketAddress remote_address_;\n\n  \/\/ Current state of the object.\n  InternalState state_;\n\n  \/\/ Track the number of bytes allowed to be sent non-blocking. This is used to\n  \/\/ throttle the sending of packets to the browser process. For each packet\n  \/\/ sent, the value is decreased. As callbacks to OnSendComplete() (as IPCs\n  \/\/ from the browser process) are made, the value is increased back. This\n  \/\/ allows short bursts of high-rate sending without dropping packets, but\n  \/\/ quickly restricts the client to a sustainable steady-state rate.\n  size_t send_bytes_available_;\n  std::deque<size_t> in_flight_packet_sizes_;\n\n  \/\/ Set to true once EWOULDBLOCK was returned from Send(). Indicates that the\n  \/\/ caller expects SignalWritable notification.\n  bool writable_signal_expected_;\n\n  \/\/ Current error code. Valid when state_ == IS_ERROR.\n  int error_;\n\n  DISALLOW_COPY_AND_ASSIGN(IpcPacketSocket);\n};\n\nIpcPacketSocket::IpcPacketSocket()\n    : type_(P2P_SOCKET_UDP),\n      message_loop_(base::MessageLoop::current()),\n      state_(IS_UNINITIALIZED),\n      send_bytes_available_(kMaximumInFlightBytes),\n      writable_signal_expected_(false),\n      error_(0) {\n  COMPILE_ASSERT(kMaximumInFlightBytes > 0, would_send_at_zero_rate);\n}\n\nIpcPacketSocket::~IpcPacketSocket() {\n  if (state_ == IS_OPENING || state_ == IS_OPEN ||\n      state_ == IS_ERROR) {\n    Close();\n  }\n}\n\nvoid IpcPacketSocket::TraceSendThrottlingState() const {\n  TRACE_COUNTER1(\"p2p\", \"P2PSendBytesAvailable\", send_bytes_available_);\n  TRACE_COUNTER1(\"p2p\", \"P2PSendPacketsInFlight\",\n                 in_flight_packet_sizes_.size());\n}\n\nbool IpcPacketSocket::Init(P2PSocketType type, P2PSocketClient* client,\n                           const talk_base::SocketAddress& local_address,\n                           const talk_base::SocketAddress& remote_address) {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n  DCHECK_EQ(state_, IS_UNINITIALIZED);\n\n  type_ = type;\n  client_ = client;\n  local_address_ = local_address;\n  remote_address_ = remote_address;\n  state_ = IS_OPENING;\n\n  net::IPEndPoint local_endpoint;\n  if (!jingle_glue::SocketAddressToIPEndPoint(local_address, &local_endpoint)) {\n    return false;\n  }\n\n  net::IPEndPoint remote_endpoint;\n  if (!jingle_glue::SocketAddressToIPEndPoint(\n          remote_address, &remote_endpoint)) {\n    return false;\n  }\n\n  client_->Init(type, local_endpoint, remote_endpoint, this);\n\n  return true;\n}\n\nvoid IpcPacketSocket::InitAcceptedTcp(\n    P2PSocketClient* client,\n    const talk_base::SocketAddress& local_address,\n    const talk_base::SocketAddress& remote_address) {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n  DCHECK_EQ(state_, IS_UNINITIALIZED);\n\n  client_ = client;\n  local_address_ = local_address;\n  remote_address_ = remote_address;\n  state_ = IS_OPEN;\n  TraceSendThrottlingState();\n  client_->set_delegate(this);\n}\n\n\/\/ talk_base::AsyncPacketSocket interface.\ntalk_base::SocketAddress IpcPacketSocket::GetLocalAddress() const {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n  return local_address_;\n}\n\ntalk_base::SocketAddress IpcPacketSocket::GetRemoteAddress() const {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n  return remote_address_;\n}\n\nint IpcPacketSocket::Send(const void *data, size_t data_size) {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n  return SendTo(data, data_size, remote_address_);\n}\n\nint IpcPacketSocket::SendTo(const void *data, size_t data_size,\n                            const talk_base::SocketAddress& address) {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n\n  switch (state_) {\n    case IS_UNINITIALIZED:\n      NOTREACHED();\n      return EWOULDBLOCK;\n    case IS_OPENING:\n      return EWOULDBLOCK;\n    case IS_CLOSED:\n      return ENOTCONN;\n    case IS_ERROR:\n      return error_;\n    case IS_OPEN:\n      \/\/ Continue sending the packet.\n      break;\n  }\n\n  if (data_size == 0) {\n    NOTREACHED();\n    return 0;\n  }\n\n  if (data_size > send_bytes_available_) {\n    TRACE_EVENT_INSTANT1(\"p2p\", \"MaxPendingBytesWouldBlock\",\n                         TRACE_EVENT_SCOPE_THREAD, \"id\", client_->socket_id());\n    writable_signal_expected_ = true;\n    error_ = EWOULDBLOCK;\n    return -1;\n  }\n\n  net::IPEndPoint address_chrome;\n  if (!jingle_glue::SocketAddressToIPEndPoint(address, &address_chrome)) {\n    NOTREACHED();\n    return -1;\n  }\n\n  send_bytes_available_ -= data_size;\n  in_flight_packet_sizes_.push_back(data_size);\n  TraceSendThrottlingState();\n\n  const char* data_char = reinterpret_cast<const char*>(data);\n  std::vector<char> data_vector(data_char, data_char + data_size);\n  client_->Send(address_chrome, data_vector);\n\n  \/\/ Fake successful send. The caller ignores result anyway.\n  return data_size;\n}\n\nint IpcPacketSocket::Close() {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n\n  client_->Close();\n  state_ = IS_CLOSED;\n\n  return 0;\n}\n\ntalk_base::AsyncPacketSocket::State IpcPacketSocket::GetState() const {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n\n  switch (state_) {\n    case IS_UNINITIALIZED:\n      NOTREACHED();\n      return STATE_CLOSED;\n\n    case IS_OPENING:\n      return STATE_BINDING;\n\n    case IS_OPEN:\n      if (type_ == P2P_SOCKET_TCP_CLIENT) {\n        return STATE_CONNECTED;\n      } else {\n        return STATE_BOUND;\n      }\n\n    case IS_CLOSED:\n    case IS_ERROR:\n      return STATE_CLOSED;\n  }\n\n  NOTREACHED();\n  return STATE_CLOSED;\n}\n\nint IpcPacketSocket::GetOption(talk_base::Socket::Option opt, int* value) {\n  \/\/ We don't support socket options for IPC sockets.\n  return -1;\n}\n\nint IpcPacketSocket::SetOption(talk_base::Socket::Option opt, int value) {\n  \/\/ We don't support socket options for IPC sockets.\n  return -1;\n}\n\nint IpcPacketSocket::GetError() const {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n  return error_;\n}\n\nvoid IpcPacketSocket::SetError(int error) {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n  error_ = error;\n}\n\nvoid IpcPacketSocket::OnOpen(const net::IPEndPoint& address) {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n\n  if (!jingle_glue::IPEndPointToSocketAddress(address, &local_address_)) {\n    \/\/ Always expect correct IPv4 address to be allocated.\n    NOTREACHED();\n    OnError();\n    return;\n  }\n\n  state_ = IS_OPEN;\n  TraceSendThrottlingState();\n\n  SignalAddressReady(this, local_address_);\n  if (type_ == P2P_SOCKET_TCP_CLIENT)\n    SignalConnect(this);\n}\n\nvoid IpcPacketSocket::OnIncomingTcpConnection(\n    const net::IPEndPoint& address,\n    P2PSocketClient* client) {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n\n  scoped_ptr<IpcPacketSocket> socket(new IpcPacketSocket());\n\n  talk_base::SocketAddress remote_address;\n  if (!jingle_glue::IPEndPointToSocketAddress(address, &remote_address)) {\n    \/\/ Always expect correct IPv4 address to be allocated.\n    NOTREACHED();\n  }\n  socket->InitAcceptedTcp(client, local_address_, remote_address);\n  SignalNewConnection(this, socket.release());\n}\n\nvoid IpcPacketSocket::OnSendComplete() {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n\n  CHECK(!in_flight_packet_sizes_.empty());\n  send_bytes_available_ += in_flight_packet_sizes_.front();\n  DCHECK_LE(send_bytes_available_, kMaximumInFlightBytes);\n  in_flight_packet_sizes_.pop_front();\n  TraceSendThrottlingState();\n\n  if (writable_signal_expected_ && send_bytes_available_ > 0) {\n    SignalReadyToSend(this);\n    writable_signal_expected_ = false;\n  }\n}\n\nvoid IpcPacketSocket::OnError() {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n  state_ = IS_ERROR;\n  error_ = ECONNABORTED;\n}\n\nvoid IpcPacketSocket::OnDataReceived(const net::IPEndPoint& address,\n                                     const std::vector<char>& data) {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n\n  talk_base::SocketAddress address_lj;\n  if (!jingle_glue::IPEndPointToSocketAddress(address, &address_lj)) {\n    \/\/ We should always be able to convert address here because we\n    \/\/ don't expect IPv6 address on IPv4 connections.\n    NOTREACHED();\n    return;\n  }\n\n  SignalReadPacket(this, &data[0], data.size(), address_lj);\n}\n\n}  \/\/ namespace\n\nIpcPacketSocketFactory::IpcPacketSocketFactory(\n    P2PSocketDispatcher* socket_dispatcher)\n    : socket_dispatcher_(socket_dispatcher) {\n}\n\nIpcPacketSocketFactory::~IpcPacketSocketFactory() {\n}\n\ntalk_base::AsyncPacketSocket* IpcPacketSocketFactory::CreateUdpSocket(\n    const talk_base::SocketAddress& local_address, int min_port, int max_port) {\n  talk_base::SocketAddress crome_address;\n  P2PSocketClient* socket_client = new P2PSocketClient(socket_dispatcher_);\n  scoped_ptr<IpcPacketSocket> socket(new IpcPacketSocket());\n  \/\/ TODO(sergeyu): Respect local_address and port limits here (need\n  \/\/ to pass them over IPC channel to the browser).\n  if (!socket->Init(P2P_SOCKET_UDP, socket_client,\n                    local_address, talk_base::SocketAddress())) {\n    return NULL;\n  }\n  return socket.release();\n}\n\ntalk_base::AsyncPacketSocket* IpcPacketSocketFactory::CreateServerTcpSocket(\n    const talk_base::SocketAddress& local_address, int min_port, int max_port,\n    int opts) {\n  \/\/ TODO(sergeyu): Implement SSL support.\n  if (opts & talk_base::PacketSocketFactory::OPT_SSLTCP)\n    return NULL;\n\n  P2PSocketType type = (opts & talk_base::PacketSocketFactory::OPT_STUN) ?\n      P2P_SOCKET_STUN_TCP_CLIENT : P2P_SOCKET_TCP_CLIENT;\n  P2PSocketClient* socket_client = new P2PSocketClient(socket_dispatcher_);\n  scoped_ptr<IpcPacketSocket> socket(new IpcPacketSocket());\n  if (!socket->Init(type, socket_client, local_address,\n                    talk_base::SocketAddress())) {\n    return NULL;\n  }\n  return socket.release();\n}\n\ntalk_base::AsyncPacketSocket* IpcPacketSocketFactory::CreateClientTcpSocket(\n    const talk_base::SocketAddress& local_address,\n    const talk_base::SocketAddress& remote_address,\n    const talk_base::ProxyInfo& proxy_info,\n    const std::string& user_agent, int opts) {\n  \/\/ TODO(sergeyu): Implement SSL support.\n  if (opts & talk_base::PacketSocketFactory::OPT_SSLTCP)\n    return NULL;\n\n  P2PSocketType type = (opts & talk_base::PacketSocketFactory::OPT_STUN) ?\n      P2P_SOCKET_STUN_TCP_SERVER : P2P_SOCKET_TCP_SERVER;\n  P2PSocketClient* socket_client = new P2PSocketClient(socket_dispatcher_);\n  scoped_ptr<IpcPacketSocket> socket(new IpcPacketSocket());\n  if (!socket->Init(type, socket_client, local_address,\n                    remote_address))\n    return NULL;\n  return socket.release();\n}\n\n}  \/\/ namespace content\n<commit_msg>Fixing the p2p client\/server tcp socket type.<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\/p2p\/ipc_socket_factory.h\"\n\n#include <deque>\n\n#include \"base\/compiler_specific.h\"\n#include \"base\/debug\/trace_event.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/message_loop_proxy.h\"\n#include \"content\/renderer\/p2p\/socket_client.h\"\n#include \"content\/renderer\/p2p\/socket_dispatcher.h\"\n#include \"jingle\/glue\/utils.h\"\n#include \"third_party\/libjingle\/source\/talk\/base\/asyncpacketsocket.h\"\n\nnamespace content {\n\nnamespace {\n\n\/\/ TODO(miu): This needs tuning.  http:\/\/crbug.com\/237960\nconst size_t kMaximumInFlightBytes = 64 * 1024;  \/\/ 64 KB\n\n\/\/ IpcPacketSocket implements talk_base::AsyncPacketSocket interface\n\/\/ using P2PSocketClient that works over IPC-channel. It must be used\n\/\/ on the thread it was created.\nclass IpcPacketSocket : public talk_base::AsyncPacketSocket,\n                        public P2PSocketClient::Delegate {\n public:\n  IpcPacketSocket();\n  virtual ~IpcPacketSocket();\n\n  \/\/ Always takes ownership of client even if initialization fails.\n  bool Init(P2PSocketType type, P2PSocketClient* client,\n            const talk_base::SocketAddress& local_address,\n            const talk_base::SocketAddress& remote_address);\n\n  \/\/ talk_base::AsyncPacketSocket interface.\n  virtual talk_base::SocketAddress GetLocalAddress() const OVERRIDE;\n  virtual talk_base::SocketAddress GetRemoteAddress() const OVERRIDE;\n  virtual int Send(const void *pv, size_t cb) OVERRIDE;\n  virtual int SendTo(const void *pv, size_t cb,\n                     const talk_base::SocketAddress& addr) OVERRIDE;\n  virtual int Close() OVERRIDE;\n  virtual State GetState() const OVERRIDE;\n  virtual int GetOption(talk_base::Socket::Option opt, int* value) OVERRIDE;\n  virtual int SetOption(talk_base::Socket::Option opt, int value) OVERRIDE;\n  virtual int GetError() const OVERRIDE;\n  virtual void SetError(int error) OVERRIDE;\n\n  \/\/ P2PSocketClient::Delegate implementation.\n  virtual void OnOpen(const net::IPEndPoint& address) OVERRIDE;\n  virtual void OnIncomingTcpConnection(const net::IPEndPoint& address,\n                                       P2PSocketClient* client) OVERRIDE;\n  virtual void OnSendComplete() OVERRIDE;\n  virtual void OnError() OVERRIDE;\n  virtual void OnDataReceived(const net::IPEndPoint& address,\n                              const std::vector<char>& data) OVERRIDE;\n\n private:\n  enum InternalState {\n    IS_UNINITIALIZED,\n    IS_OPENING,\n    IS_OPEN,\n    IS_CLOSED,\n    IS_ERROR,\n  };\n\n  \/\/ Update trace of send throttling internal state. This should be called\n  \/\/ immediately after any changes to |send_bytes_available_| and\/or\n  \/\/ |in_flight_packet_sizes_|.\n  void TraceSendThrottlingState() const;\n\n  void InitAcceptedTcp(P2PSocketClient* client,\n                       const talk_base::SocketAddress& local_address,\n                       const talk_base::SocketAddress& remote_address);\n\n  P2PSocketType type_;\n\n  \/\/ Message loop on which this socket was created and being used.\n  base::MessageLoop* message_loop_;\n\n  \/\/ Corresponding P2P socket client.\n  scoped_refptr<P2PSocketClient> client_;\n\n  \/\/ Local address is allocated by the browser process, and the\n  \/\/ renderer side doesn't know the address until it receives OnOpen()\n  \/\/ event from the browser.\n  talk_base::SocketAddress local_address_;\n\n  \/\/ Remote address for client TCP connections.\n  talk_base::SocketAddress remote_address_;\n\n  \/\/ Current state of the object.\n  InternalState state_;\n\n  \/\/ Track the number of bytes allowed to be sent non-blocking. This is used to\n  \/\/ throttle the sending of packets to the browser process. For each packet\n  \/\/ sent, the value is decreased. As callbacks to OnSendComplete() (as IPCs\n  \/\/ from the browser process) are made, the value is increased back. This\n  \/\/ allows short bursts of high-rate sending without dropping packets, but\n  \/\/ quickly restricts the client to a sustainable steady-state rate.\n  size_t send_bytes_available_;\n  std::deque<size_t> in_flight_packet_sizes_;\n\n  \/\/ Set to true once EWOULDBLOCK was returned from Send(). Indicates that the\n  \/\/ caller expects SignalWritable notification.\n  bool writable_signal_expected_;\n\n  \/\/ Current error code. Valid when state_ == IS_ERROR.\n  int error_;\n\n  DISALLOW_COPY_AND_ASSIGN(IpcPacketSocket);\n};\n\nIpcPacketSocket::IpcPacketSocket()\n    : type_(P2P_SOCKET_UDP),\n      message_loop_(base::MessageLoop::current()),\n      state_(IS_UNINITIALIZED),\n      send_bytes_available_(kMaximumInFlightBytes),\n      writable_signal_expected_(false),\n      error_(0) {\n  COMPILE_ASSERT(kMaximumInFlightBytes > 0, would_send_at_zero_rate);\n}\n\nIpcPacketSocket::~IpcPacketSocket() {\n  if (state_ == IS_OPENING || state_ == IS_OPEN ||\n      state_ == IS_ERROR) {\n    Close();\n  }\n}\n\nvoid IpcPacketSocket::TraceSendThrottlingState() const {\n  TRACE_COUNTER1(\"p2p\", \"P2PSendBytesAvailable\", send_bytes_available_);\n  TRACE_COUNTER1(\"p2p\", \"P2PSendPacketsInFlight\",\n                 in_flight_packet_sizes_.size());\n}\n\nbool IpcPacketSocket::Init(P2PSocketType type, P2PSocketClient* client,\n                           const talk_base::SocketAddress& local_address,\n                           const talk_base::SocketAddress& remote_address) {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n  DCHECK_EQ(state_, IS_UNINITIALIZED);\n\n  type_ = type;\n  client_ = client;\n  local_address_ = local_address;\n  remote_address_ = remote_address;\n  state_ = IS_OPENING;\n\n  net::IPEndPoint local_endpoint;\n  if (!jingle_glue::SocketAddressToIPEndPoint(local_address, &local_endpoint)) {\n    return false;\n  }\n\n  net::IPEndPoint remote_endpoint;\n  if (!jingle_glue::SocketAddressToIPEndPoint(\n          remote_address, &remote_endpoint)) {\n    return false;\n  }\n\n  client_->Init(type, local_endpoint, remote_endpoint, this);\n\n  return true;\n}\n\nvoid IpcPacketSocket::InitAcceptedTcp(\n    P2PSocketClient* client,\n    const talk_base::SocketAddress& local_address,\n    const talk_base::SocketAddress& remote_address) {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n  DCHECK_EQ(state_, IS_UNINITIALIZED);\n\n  client_ = client;\n  local_address_ = local_address;\n  remote_address_ = remote_address;\n  state_ = IS_OPEN;\n  TraceSendThrottlingState();\n  client_->set_delegate(this);\n}\n\n\/\/ talk_base::AsyncPacketSocket interface.\ntalk_base::SocketAddress IpcPacketSocket::GetLocalAddress() const {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n  return local_address_;\n}\n\ntalk_base::SocketAddress IpcPacketSocket::GetRemoteAddress() const {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n  return remote_address_;\n}\n\nint IpcPacketSocket::Send(const void *data, size_t data_size) {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n  return SendTo(data, data_size, remote_address_);\n}\n\nint IpcPacketSocket::SendTo(const void *data, size_t data_size,\n                            const talk_base::SocketAddress& address) {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n\n  switch (state_) {\n    case IS_UNINITIALIZED:\n      NOTREACHED();\n      return EWOULDBLOCK;\n    case IS_OPENING:\n      return EWOULDBLOCK;\n    case IS_CLOSED:\n      return ENOTCONN;\n    case IS_ERROR:\n      return error_;\n    case IS_OPEN:\n      \/\/ Continue sending the packet.\n      break;\n  }\n\n  if (data_size == 0) {\n    NOTREACHED();\n    return 0;\n  }\n\n  if (data_size > send_bytes_available_) {\n    TRACE_EVENT_INSTANT1(\"p2p\", \"MaxPendingBytesWouldBlock\",\n                         TRACE_EVENT_SCOPE_THREAD, \"id\", client_->socket_id());\n    writable_signal_expected_ = true;\n    error_ = EWOULDBLOCK;\n    return -1;\n  }\n\n  net::IPEndPoint address_chrome;\n  if (!jingle_glue::SocketAddressToIPEndPoint(address, &address_chrome)) {\n    NOTREACHED();\n    return -1;\n  }\n\n  send_bytes_available_ -= data_size;\n  in_flight_packet_sizes_.push_back(data_size);\n  TraceSendThrottlingState();\n\n  const char* data_char = reinterpret_cast<const char*>(data);\n  std::vector<char> data_vector(data_char, data_char + data_size);\n  client_->Send(address_chrome, data_vector);\n\n  \/\/ Fake successful send. The caller ignores result anyway.\n  return data_size;\n}\n\nint IpcPacketSocket::Close() {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n\n  client_->Close();\n  state_ = IS_CLOSED;\n\n  return 0;\n}\n\ntalk_base::AsyncPacketSocket::State IpcPacketSocket::GetState() const {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n\n  switch (state_) {\n    case IS_UNINITIALIZED:\n      NOTREACHED();\n      return STATE_CLOSED;\n\n    case IS_OPENING:\n      return STATE_BINDING;\n\n    case IS_OPEN:\n      if (type_ == P2P_SOCKET_TCP_CLIENT) {\n        return STATE_CONNECTED;\n      } else {\n        return STATE_BOUND;\n      }\n\n    case IS_CLOSED:\n    case IS_ERROR:\n      return STATE_CLOSED;\n  }\n\n  NOTREACHED();\n  return STATE_CLOSED;\n}\n\nint IpcPacketSocket::GetOption(talk_base::Socket::Option opt, int* value) {\n  \/\/ We don't support socket options for IPC sockets.\n  return -1;\n}\n\nint IpcPacketSocket::SetOption(talk_base::Socket::Option opt, int value) {\n  \/\/ We don't support socket options for IPC sockets.\n  return -1;\n}\n\nint IpcPacketSocket::GetError() const {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n  return error_;\n}\n\nvoid IpcPacketSocket::SetError(int error) {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n  error_ = error;\n}\n\nvoid IpcPacketSocket::OnOpen(const net::IPEndPoint& address) {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n\n  if (!jingle_glue::IPEndPointToSocketAddress(address, &local_address_)) {\n    \/\/ Always expect correct IPv4 address to be allocated.\n    NOTREACHED();\n    OnError();\n    return;\n  }\n\n  state_ = IS_OPEN;\n  TraceSendThrottlingState();\n\n  SignalAddressReady(this, local_address_);\n  if (type_ == P2P_SOCKET_TCP_CLIENT)\n    SignalConnect(this);\n}\n\nvoid IpcPacketSocket::OnIncomingTcpConnection(\n    const net::IPEndPoint& address,\n    P2PSocketClient* client) {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n\n  scoped_ptr<IpcPacketSocket> socket(new IpcPacketSocket());\n\n  talk_base::SocketAddress remote_address;\n  if (!jingle_glue::IPEndPointToSocketAddress(address, &remote_address)) {\n    \/\/ Always expect correct IPv4 address to be allocated.\n    NOTREACHED();\n  }\n  socket->InitAcceptedTcp(client, local_address_, remote_address);\n  SignalNewConnection(this, socket.release());\n}\n\nvoid IpcPacketSocket::OnSendComplete() {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n\n  CHECK(!in_flight_packet_sizes_.empty());\n  send_bytes_available_ += in_flight_packet_sizes_.front();\n  DCHECK_LE(send_bytes_available_, kMaximumInFlightBytes);\n  in_flight_packet_sizes_.pop_front();\n  TraceSendThrottlingState();\n\n  if (writable_signal_expected_ && send_bytes_available_ > 0) {\n    SignalReadyToSend(this);\n    writable_signal_expected_ = false;\n  }\n}\n\nvoid IpcPacketSocket::OnError() {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n  state_ = IS_ERROR;\n  error_ = ECONNABORTED;\n}\n\nvoid IpcPacketSocket::OnDataReceived(const net::IPEndPoint& address,\n                                     const std::vector<char>& data) {\n  DCHECK_EQ(base::MessageLoop::current(), message_loop_);\n\n  talk_base::SocketAddress address_lj;\n  if (!jingle_glue::IPEndPointToSocketAddress(address, &address_lj)) {\n    \/\/ We should always be able to convert address here because we\n    \/\/ don't expect IPv6 address on IPv4 connections.\n    NOTREACHED();\n    return;\n  }\n\n  SignalReadPacket(this, &data[0], data.size(), address_lj);\n}\n\n}  \/\/ namespace\n\nIpcPacketSocketFactory::IpcPacketSocketFactory(\n    P2PSocketDispatcher* socket_dispatcher)\n    : socket_dispatcher_(socket_dispatcher) {\n}\n\nIpcPacketSocketFactory::~IpcPacketSocketFactory() {\n}\n\ntalk_base::AsyncPacketSocket* IpcPacketSocketFactory::CreateUdpSocket(\n    const talk_base::SocketAddress& local_address, int min_port, int max_port) {\n  talk_base::SocketAddress crome_address;\n  P2PSocketClient* socket_client = new P2PSocketClient(socket_dispatcher_);\n  scoped_ptr<IpcPacketSocket> socket(new IpcPacketSocket());\n  \/\/ TODO(sergeyu): Respect local_address and port limits here (need\n  \/\/ to pass them over IPC channel to the browser).\n  if (!socket->Init(P2P_SOCKET_UDP, socket_client,\n                    local_address, talk_base::SocketAddress())) {\n    return NULL;\n  }\n  return socket.release();\n}\n\ntalk_base::AsyncPacketSocket* IpcPacketSocketFactory::CreateServerTcpSocket(\n    const talk_base::SocketAddress& local_address, int min_port, int max_port,\n    int opts) {\n  \/\/ TODO(sergeyu): Implement SSL support.\n  if (opts & talk_base::PacketSocketFactory::OPT_SSLTCP)\n    return NULL;\n\n  P2PSocketType type = (opts & talk_base::PacketSocketFactory::OPT_STUN) ?\n      P2P_SOCKET_STUN_TCP_SERVER : P2P_SOCKET_TCP_SERVER;\n  P2PSocketClient* socket_client = new P2PSocketClient(socket_dispatcher_);\n  scoped_ptr<IpcPacketSocket> socket(new IpcPacketSocket());\n  if (!socket->Init(type, socket_client, local_address,\n                    talk_base::SocketAddress())) {\n    return NULL;\n  }\n  return socket.release();\n}\n\ntalk_base::AsyncPacketSocket* IpcPacketSocketFactory::CreateClientTcpSocket(\n    const talk_base::SocketAddress& local_address,\n    const talk_base::SocketAddress& remote_address,\n    const talk_base::ProxyInfo& proxy_info,\n    const std::string& user_agent, int opts) {\n  \/\/ TODO(sergeyu): Implement SSL support.\n  if (opts & talk_base::PacketSocketFactory::OPT_SSLTCP)\n    return NULL;\n\n  P2PSocketType type = (opts & talk_base::PacketSocketFactory::OPT_STUN) ?\n      P2P_SOCKET_STUN_TCP_CLIENT : P2P_SOCKET_TCP_CLIENT;\n  P2PSocketClient* socket_client = new P2PSocketClient(socket_dispatcher_);\n  scoped_ptr<IpcPacketSocket> socket(new IpcPacketSocket());\n  if (!socket->Init(type, socket_client, local_address,\n                    remote_address))\n    return NULL;\n  return socket.release();\n}\n\n}  \/\/ namespace content\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 <helper\/titlebarupdate.hxx>\n\n#include <pattern\/window.hxx>\n#include <threadhelp\/writeguard.hxx>\n#include <threadhelp\/readguard.hxx>\n#include <macros\/generic.hxx>\n#include <services.h>\n#include <properties.h>\n\n#include <com\/sun\/star\/awt\/XWindow.hpp>\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#include <com\/sun\/star\/lang\/IllegalArgumentException.hpp>\n#include <com\/sun\/star\/frame\/ModuleManager.hpp>\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#include <com\/sun\/star\/beans\/XMaterialHolder.hpp>\n#include <com\/sun\/star\/frame\/XTitleChangeBroadcaster.hpp>\n#include <com\/sun\/star\/beans\/NamedValue.hpp>\n\n#include <comphelper\/processfactory.hxx>\n#include <comphelper\/sequenceashashmap.hxx>\n#include <unotools\/configmgr.hxx>\n#include <unotools\/bootstrap.hxx>\n#include <vcl\/window.hxx>\n#include <vcl\/syswin.hxx>\n#include <toolkit\/helper\/vclunohelper.hxx>\n#include <vcl\/svapp.hxx>\n#include <vcl\/wrkwin.hxx>\n#include <tools\/diagnose_ex.h>\n\nnamespace framework{\n\nstatic const ::sal_Int32 INVALID_ICON_ID = -1;\nstatic const ::sal_Int32 DEFAULT_ICON_ID =  0;\n\n\n\/\/*****************************************************************************************************************\nTitleBarUpdate::TitleBarUpdate(const css::uno::Reference< css::uno::XComponentContext >& xContext)\n    : ThreadHelpBase          (&Application::GetSolarMutex())\n    , m_xContext              (xContext                     )\n    , m_xFrame                (                             )\n{\n}\n\n\/\/*****************************************************************************************************************\nTitleBarUpdate::~TitleBarUpdate()\n{\n}\n\n\/\/*****************************************************************************************************************\nvoid SAL_CALL TitleBarUpdate::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    \/\/ SYNCHRONIZED ->\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    \/\/ <- SYNCHRONIZED\n\n    \/\/ start listening\n    xFrame->addFrameActionListener(this);\n\n    css::uno::Reference< css::frame::XTitleChangeBroadcaster > xBroadcaster(xFrame, css::uno::UNO_QUERY);\n    if (xBroadcaster.is ())\n        xBroadcaster->addTitleChangeListener (this);\n}\n\n\/\/*****************************************************************************************************************\nvoid SAL_CALL TitleBarUpdate::frameAction(const css::frame::FrameActionEvent& aEvent)\n    throw(css::uno::RuntimeException)\n{\n    \/\/ we are interested on events only, which must trigger a title bar update\n    \/\/ because component was changed.\n    if (\n        (aEvent.Action == css::frame::FrameAction_COMPONENT_ATTACHED  ) ||\n        (aEvent.Action == css::frame::FrameAction_COMPONENT_REATTACHED) ||\n        (aEvent.Action == css::frame::FrameAction_COMPONENT_DETACHING )\n       )\n    {\n        impl_forceUpdate ();\n    }\n}\n\n\/\/*****************************************************************************************************************\nvoid SAL_CALL TitleBarUpdate::titleChanged(const css::frame::TitleChangedEvent& \/* aEvent *\/)\n    throw (css::uno::RuntimeException)\n{\n    impl_forceUpdate ();\n}\n\n\/\/*****************************************************************************************************************\nvoid SAL_CALL TitleBarUpdate::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\/\/http:\/\/live.gnome.org\/GnomeShell\/ApplicationBased\n\/\/See http:\/\/msdn.microsoft.com\/en-us\/library\/dd378459(v=VS.85).aspx for future\n\/\/Windows 7 equivalent support\nvoid TitleBarUpdate::impl_updateApplicationID(const css::uno::Reference< css::frame::XFrame >& xFrame)\n{\n    css::uno::Reference< css::awt::XWindow > xWindow = xFrame->getContainerWindow ();\n    if ( ! xWindow.is() )\n        return;\n\n    OUString sApplicationID;\n    try\n    {\n        \/\/ SYNCHRONIZED ->\n        ReadGuard aReadLock(m_aLock);\n        css::uno::Reference< css::uno::XComponentContext > xContext = m_xContext;\n        aReadLock.unlock();\n        \/\/ <- SYNCHRONIZED\n\n        css::uno::Reference< css::frame::XModuleManager2 > xModuleManager =\n            css::frame::ModuleManager::create( xContext );\n\n        OUString aModuleId = xModuleManager->identify(xFrame);\n        OUString sDesktopName;\n#if !defined(MACOSX)\n        if ( aModuleId.equalsAsciiL(RTL_CONSTASCII_STRINGPARAM(\"com.sun.star.text.TextDocument\")) ||\n             aModuleId.equalsAsciiL(RTL_CONSTASCII_STRINGPARAM(\"com.sun.star.text.GlobalDocument\")) ||\n             aModuleId.equalsAsciiL(RTL_CONSTASCII_STRINGPARAM(\"com.sun.star.text.WebDocument\")) ||\n             aModuleId.equalsAsciiL(RTL_CONSTASCII_STRINGPARAM(\"com.sun.star.xforms.XMLFormDocument\")) )\n            sDesktopName = OUString(\"Writer\");\n        else if ( aModuleId == \"com.sun.star.sheet.SpreadsheetDocument\" )\n            sDesktopName = OUString(\"Calc\");\n        else if ( aModuleId == \"com.sun.star.presentation.PresentationDocument\" )\n            sDesktopName = OUString(\"Impress\");\n        else if ( aModuleId == \"com.sun.star.drawing.DrawingDocument\" )\n            sDesktopName = OUString(\"Draw\");\n        else if ( aModuleId == \"com.sun.star.formula.FormulaProperties\" )\n            sDesktopName = OUString(\"Math\");\n        else if ( aModuleId.equalsAsciiL(RTL_CONSTASCII_STRINGPARAM(\"com.sun.star.sdb.DatabaseDocument\")) ||\n                  aModuleId.equalsAsciiL(RTL_CONSTASCII_STRINGPARAM(\"com.sun.star.sdb.OfficeDatabaseDocument\")) ||\n                  aModuleId.equalsAsciiL(RTL_CONSTASCII_STRINGPARAM(\"com.sun.star.sdb.RelationDesign\")) ||\n                  aModuleId.equalsAsciiL(RTL_CONSTASCII_STRINGPARAM(\"com.sun.star.sdb.QueryDesign\")) ||\n                  aModuleId.equalsAsciiL(RTL_CONSTASCII_STRINGPARAM(\"com.sun.star.sdb.TableDesign\")) ||\n                  aModuleId.equalsAsciiL(RTL_CONSTASCII_STRINGPARAM(\"com.sun.star.sdb.DataSourceBrowser\")) )\n            sDesktopName = OUString(\"Base\");\n        else\n            sDesktopName = OUString(\"Startcenter\");\n#if defined(WNT)\n        \/\/ We use a hardcoded product name matching the registry keys so applications can be associated with file types\n        sApplicationID = \"TheDocumentFoundation.LibreOffice.\";\n        sApplicationID += sDesktopName;\n#else\n        sApplicationID = utl::ConfigManager::getProductName().toAsciiLowerCase();\n        sApplicationID += OUString(sal_Unicode('-'));\n        sApplicationID += sDesktopName.toAsciiLowerCase();\n#endif\n#endif\n    }\n    catch(const css::uno::Exception&)\n    {\n    }\n\n    \/\/ VCL SYNCHRONIZED ->\n    SolarMutexGuard aSolarGuard;\n\n    Window* pWindow = (VCLUnoHelper::GetWindow( xWindow ));\n    if (\n        ( pWindow                                 ) &&\n        ( pWindow->GetType() == WINDOW_WORKWINDOW )\n       )\n    {\n        WorkWindow* pWorkWindow = (WorkWindow*)pWindow;\n        pWorkWindow->SetApplicationID( sApplicationID );\n    }\n    \/\/ <- VCL SYNCHRONIZED\n}\n\n\n\/\/*****************************************************************************************************************\n::sal_Bool TitleBarUpdate::implst_getModuleInfo(const css::uno::Reference< css::frame::XFrame >& xFrame,\n                                                      TModuleInfo&                               rInfo )\n{\n    if ( ! xFrame.is ())\n        return sal_False;\n\n    \/\/ SYNCHRONIZED ->\n    ReadGuard aReadLock(m_aLock);\n    css::uno::Reference< css::uno::XComponentContext > xContext = m_xContext;\n    aReadLock.unlock();\n    \/\/ <- SYNCHRONIZED\n\n    try\n    {\n        css::uno::Reference< css::frame::XModuleManager2 > xModuleManager =\n            css::frame::ModuleManager::create( xContext );\n\n        rInfo.sID = xModuleManager->identify(xFrame);\n        ::comphelper::SequenceAsHashMap lProps    = xModuleManager->getByName (rInfo.sID);\n\n        rInfo.sUIName = lProps.getUnpackedValueOrDefault (OFFICEFACTORY_PROPNAME_UINAME, OUString());\n        rInfo.nIcon   = lProps.getUnpackedValueOrDefault (OFFICEFACTORY_PROPNAME_ICON  , INVALID_ICON_ID  );\n\n        \/\/ Note: If we could retrieve a module id ... everything is OK.\n        \/\/ UIName and Icon ID are optional values !\n        ::sal_Bool bSuccess = !rInfo.sID.isEmpty();\n        return bSuccess;\n    }\n    catch(const css::uno::Exception&)\n        {}\n\n    return sal_False;\n}\n\n\/\/*****************************************************************************************************************\nvoid TitleBarUpdate::impl_forceUpdate()\n{\n    \/\/ SYNCHRONIZED ->\n    ReadGuard aReadLock(m_aLock);\n    css::uno::Reference< css::frame::XFrame >              xFrame(m_xFrame.get(), css::uno::UNO_QUERY);\n    aReadLock.unlock();\n    \/\/ <- SYNCHRONIZED\n\n    \/\/ frame already gone ? We hold it weak only ...\n    if ( ! xFrame.is())\n        return;\n\n    \/\/ no window -> no chance to set\/update title and icon\n    css::uno::Reference< css::awt::XWindow > xWindow = xFrame->getContainerWindow();\n    if ( ! xWindow.is())\n        return;\n\n    impl_updateIcon  (xFrame);\n    impl_updateTitle (xFrame);\n#if !defined(MACOSX)\n    impl_updateApplicationID (xFrame);\n#endif\n}\n\n\/\/*****************************************************************************************************************\nvoid TitleBarUpdate::impl_updateIcon(const css::uno::Reference< css::frame::XFrame >& xFrame)\n{\n    css::uno::Reference< css::frame::XController > xController = xFrame->getController      ();\n    css::uno::Reference< css::awt::XWindow >       xWindow     = xFrame->getContainerWindow ();\n\n    if (\n        ( ! xController.is() ) ||\n        ( ! xWindow.is()     )\n       )\n        return;\n\n    \/\/ a) set default value to an invalid one. So we can start further searches for right icon id, if\n    \/\/    first steps failed!\n    sal_Int32 nIcon = INVALID_ICON_ID;\n\n    \/\/ b) try to find information on controller property set directly\n    \/\/    Don't forget to catch possible exceptions - because these property is an optional one!\n    css::uno::Reference< css::beans::XPropertySet > xSet( xController, css::uno::UNO_QUERY );\n    if ( xSet.is() )\n    {\n        try\n        {\n            css::uno::Reference< css::beans::XPropertySetInfo > const xPSI( xSet->getPropertySetInfo(), css::uno::UNO_SET_THROW );\n            if ( xPSI->hasPropertyByName( DECLARE_ASCII(\"IconId\") ) )\n                xSet->getPropertyValue( DECLARE_ASCII(\"IconId\") ) >>= nIcon;\n        }\n        catch(const css::uno::Exception&)\n        {\n            DBG_UNHANDLED_EXCEPTION();\n        }\n    }\n\n    \/\/ c) if b) failed ... identify the used module and retrieve set icon from module config.\n    \/\/    Tirck :-) Module was already specified outside and aInfo contains all needed information.\n    if ( nIcon == INVALID_ICON_ID )\n    {\n        TModuleInfo aInfo;\n        if (implst_getModuleInfo(xFrame, aInfo))\n            nIcon = aInfo.nIcon;\n    }\n\n    \/\/ d) if all steps failed - use fallback :-)\n    \/\/    ... means using the global staroffice icon\n    if( nIcon == INVALID_ICON_ID )\n        nIcon = DEFAULT_ICON_ID;\n\n    \/\/ e) set icon on container window now\n    \/\/    Don't forget SolarMutex! We use vcl directly :-(\n    \/\/    Check window pointer for right WorkWindow class too!!!\n\n    \/\/ VCL SYNCHRONIZED ->\n    SolarMutexGuard aSolarGuard;\n\n    Window* pWindow = (VCLUnoHelper::GetWindow( xWindow ));\n    if (\n        ( pWindow                                 ) &&\n        ( pWindow->GetType() == WINDOW_WORKWINDOW )\n       )\n    {\n        WorkWindow* pWorkWindow = (WorkWindow*)pWindow;\n        pWorkWindow->SetIcon( (sal_uInt16)nIcon );\n\n        css::uno::Reference< css::frame::XModel > xModel = xController->getModel();\n        OUString aURL;\n        if( xModel.is() )\n            aURL = xModel->getURL();\n        pWorkWindow->SetRepresentedURL( aURL );\n    }\n    \/\/ <- VCL SYNCHRONIZED\n}\n\n\/\/*****************************************************************************************************************\nvoid TitleBarUpdate::impl_updateTitle(const css::uno::Reference< css::frame::XFrame >& xFrame)\n{\n    \/\/ no window ... no chance to set any title -> return\n    css::uno::Reference< css::awt::XWindow > xWindow = xFrame->getContainerWindow ();\n    if ( ! xWindow.is() )\n        return;\n\n    css::uno::Reference< css::frame::XTitle > xTitle(xFrame, css::uno::UNO_QUERY);\n    if ( ! xTitle.is() )\n        return;\n\n    const OUString sTitle = xTitle->getTitle ();\n\n    \/\/ VCL SYNCHRONIZED ->\n    SolarMutexGuard aSolarGuard;\n\n    Window* pWindow = (VCLUnoHelper::GetWindow( xWindow ));\n    if (\n        ( pWindow                                 ) &&\n        ( pWindow->GetType() == WINDOW_WORKWINDOW )\n       )\n    {\n        WorkWindow* pWorkWindow = (WorkWindow*)pWindow;\n        pWorkWindow->SetText( sTitle );\n    }\n    \/\/ <- VCL SYNCHRONIZED\n}\n\n} \/\/ namespace framework\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>Remove some occurrences of RTL_CONSTASCII_STRINGPARAM and equalsAsciiL<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 <helper\/titlebarupdate.hxx>\n\n#include <pattern\/window.hxx>\n#include <threadhelp\/writeguard.hxx>\n#include <threadhelp\/readguard.hxx>\n#include <macros\/generic.hxx>\n#include <services.h>\n#include <properties.h>\n\n#include <com\/sun\/star\/awt\/XWindow.hpp>\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#include <com\/sun\/star\/lang\/IllegalArgumentException.hpp>\n#include <com\/sun\/star\/frame\/ModuleManager.hpp>\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#include <com\/sun\/star\/beans\/XMaterialHolder.hpp>\n#include <com\/sun\/star\/frame\/XTitleChangeBroadcaster.hpp>\n#include <com\/sun\/star\/beans\/NamedValue.hpp>\n\n#include <comphelper\/processfactory.hxx>\n#include <comphelper\/sequenceashashmap.hxx>\n#include <unotools\/configmgr.hxx>\n#include <unotools\/bootstrap.hxx>\n#include <vcl\/window.hxx>\n#include <vcl\/syswin.hxx>\n#include <toolkit\/helper\/vclunohelper.hxx>\n#include <vcl\/svapp.hxx>\n#include <vcl\/wrkwin.hxx>\n#include <tools\/diagnose_ex.h>\n\nnamespace framework{\n\nstatic const ::sal_Int32 INVALID_ICON_ID = -1;\nstatic const ::sal_Int32 DEFAULT_ICON_ID =  0;\n\n\n\/\/*****************************************************************************************************************\nTitleBarUpdate::TitleBarUpdate(const css::uno::Reference< css::uno::XComponentContext >& xContext)\n    : ThreadHelpBase          (&Application::GetSolarMutex())\n    , m_xContext              (xContext                     )\n    , m_xFrame                (                             )\n{\n}\n\n\/\/*****************************************************************************************************************\nTitleBarUpdate::~TitleBarUpdate()\n{\n}\n\n\/\/*****************************************************************************************************************\nvoid SAL_CALL TitleBarUpdate::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    \/\/ SYNCHRONIZED ->\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    \/\/ <- SYNCHRONIZED\n\n    \/\/ start listening\n    xFrame->addFrameActionListener(this);\n\n    css::uno::Reference< css::frame::XTitleChangeBroadcaster > xBroadcaster(xFrame, css::uno::UNO_QUERY);\n    if (xBroadcaster.is ())\n        xBroadcaster->addTitleChangeListener (this);\n}\n\n\/\/*****************************************************************************************************************\nvoid SAL_CALL TitleBarUpdate::frameAction(const css::frame::FrameActionEvent& aEvent)\n    throw(css::uno::RuntimeException)\n{\n    \/\/ we are interested on events only, which must trigger a title bar update\n    \/\/ because component was changed.\n    if (\n        (aEvent.Action == css::frame::FrameAction_COMPONENT_ATTACHED  ) ||\n        (aEvent.Action == css::frame::FrameAction_COMPONENT_REATTACHED) ||\n        (aEvent.Action == css::frame::FrameAction_COMPONENT_DETACHING )\n       )\n    {\n        impl_forceUpdate ();\n    }\n}\n\n\/\/*****************************************************************************************************************\nvoid SAL_CALL TitleBarUpdate::titleChanged(const css::frame::TitleChangedEvent& \/* aEvent *\/)\n    throw (css::uno::RuntimeException)\n{\n    impl_forceUpdate ();\n}\n\n\/\/*****************************************************************************************************************\nvoid SAL_CALL TitleBarUpdate::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\/\/http:\/\/live.gnome.org\/GnomeShell\/ApplicationBased\n\/\/See http:\/\/msdn.microsoft.com\/en-us\/library\/dd378459(v=VS.85).aspx for future\n\/\/Windows 7 equivalent support\nvoid TitleBarUpdate::impl_updateApplicationID(const css::uno::Reference< css::frame::XFrame >& xFrame)\n{\n    css::uno::Reference< css::awt::XWindow > xWindow = xFrame->getContainerWindow ();\n    if ( ! xWindow.is() )\n        return;\n\n    OUString sApplicationID;\n    try\n    {\n        \/\/ SYNCHRONIZED ->\n        ReadGuard aReadLock(m_aLock);\n        css::uno::Reference< css::uno::XComponentContext > xContext = m_xContext;\n        aReadLock.unlock();\n        \/\/ <- SYNCHRONIZED\n\n        css::uno::Reference< css::frame::XModuleManager2 > xModuleManager =\n            css::frame::ModuleManager::create( xContext );\n\n        OUString aModuleId = xModuleManager->identify(xFrame);\n        OUString sDesktopName;\n#if !defined(MACOSX)\n        if ( aModuleId == \"com.sun.star.text.TextDocument\" ||\n             aModuleId == \"com.sun.star.text.GlobalDocument\" ||\n             aModuleId == \"com.sun.star.text.WebDocument\" ||\n             aModuleId == \"com.sun.star.xforms.XMLFormDocument\" )\n            sDesktopName = OUString(\"Writer\");\n        else if ( aModuleId == \"com.sun.star.sheet.SpreadsheetDocument\" )\n            sDesktopName = OUString(\"Calc\");\n        else if ( aModuleId == \"com.sun.star.presentation.PresentationDocument\" )\n            sDesktopName = OUString(\"Impress\");\n        else if ( aModuleId == \"com.sun.star.drawing.DrawingDocument\" )\n            sDesktopName = OUString(\"Draw\");\n        else if ( aModuleId == \"com.sun.star.formula.FormulaProperties\" )\n            sDesktopName = OUString(\"Math\");\n        else if ( aModuleId == \"com.sun.star.sdb.DatabaseDocument\" ||\n                  aModuleId == \"com.sun.star.sdb.OfficeDatabaseDocument\" ||\n                  aModuleId == \"com.sun.star.sdb.RelationDesign\" ||\n                  aModuleId == \"com.sun.star.sdb.QueryDesign\" ||\n                  aModuleId == \"com.sun.star.sdb.TableDesign\" ||\n                  aModuleId == \"com.sun.star.sdb.DataSourceBrowser\" )\n            sDesktopName = OUString(\"Base\");\n        else\n            sDesktopName = OUString(\"Startcenter\");\n#if defined(WNT)\n        \/\/ We use a hardcoded product name matching the registry keys so applications can be associated with file types\n        sApplicationID = \"TheDocumentFoundation.LibreOffice.\";\n        sApplicationID += sDesktopName;\n#else\n        sApplicationID = utl::ConfigManager::getProductName().toAsciiLowerCase();\n        sApplicationID += OUString(sal_Unicode('-'));\n        sApplicationID += sDesktopName.toAsciiLowerCase();\n#endif\n#endif\n    }\n    catch(const css::uno::Exception&)\n    {\n    }\n\n    \/\/ VCL SYNCHRONIZED ->\n    SolarMutexGuard aSolarGuard;\n\n    Window* pWindow = (VCLUnoHelper::GetWindow( xWindow ));\n    if (\n        ( pWindow                                 ) &&\n        ( pWindow->GetType() == WINDOW_WORKWINDOW )\n       )\n    {\n        WorkWindow* pWorkWindow = (WorkWindow*)pWindow;\n        pWorkWindow->SetApplicationID( sApplicationID );\n    }\n    \/\/ <- VCL SYNCHRONIZED\n}\n\n\n\/\/*****************************************************************************************************************\n::sal_Bool TitleBarUpdate::implst_getModuleInfo(const css::uno::Reference< css::frame::XFrame >& xFrame,\n                                                      TModuleInfo&                               rInfo )\n{\n    if ( ! xFrame.is ())\n        return sal_False;\n\n    \/\/ SYNCHRONIZED ->\n    ReadGuard aReadLock(m_aLock);\n    css::uno::Reference< css::uno::XComponentContext > xContext = m_xContext;\n    aReadLock.unlock();\n    \/\/ <- SYNCHRONIZED\n\n    try\n    {\n        css::uno::Reference< css::frame::XModuleManager2 > xModuleManager =\n            css::frame::ModuleManager::create( xContext );\n\n        rInfo.sID = xModuleManager->identify(xFrame);\n        ::comphelper::SequenceAsHashMap lProps    = xModuleManager->getByName (rInfo.sID);\n\n        rInfo.sUIName = lProps.getUnpackedValueOrDefault (OFFICEFACTORY_PROPNAME_UINAME, OUString());\n        rInfo.nIcon   = lProps.getUnpackedValueOrDefault (OFFICEFACTORY_PROPNAME_ICON  , INVALID_ICON_ID  );\n\n        \/\/ Note: If we could retrieve a module id ... everything is OK.\n        \/\/ UIName and Icon ID are optional values !\n        ::sal_Bool bSuccess = !rInfo.sID.isEmpty();\n        return bSuccess;\n    }\n    catch(const css::uno::Exception&)\n        {}\n\n    return sal_False;\n}\n\n\/\/*****************************************************************************************************************\nvoid TitleBarUpdate::impl_forceUpdate()\n{\n    \/\/ SYNCHRONIZED ->\n    ReadGuard aReadLock(m_aLock);\n    css::uno::Reference< css::frame::XFrame >              xFrame(m_xFrame.get(), css::uno::UNO_QUERY);\n    aReadLock.unlock();\n    \/\/ <- SYNCHRONIZED\n\n    \/\/ frame already gone ? We hold it weak only ...\n    if ( ! xFrame.is())\n        return;\n\n    \/\/ no window -> no chance to set\/update title and icon\n    css::uno::Reference< css::awt::XWindow > xWindow = xFrame->getContainerWindow();\n    if ( ! xWindow.is())\n        return;\n\n    impl_updateIcon  (xFrame);\n    impl_updateTitle (xFrame);\n#if !defined(MACOSX)\n    impl_updateApplicationID (xFrame);\n#endif\n}\n\n\/\/*****************************************************************************************************************\nvoid TitleBarUpdate::impl_updateIcon(const css::uno::Reference< css::frame::XFrame >& xFrame)\n{\n    css::uno::Reference< css::frame::XController > xController = xFrame->getController      ();\n    css::uno::Reference< css::awt::XWindow >       xWindow     = xFrame->getContainerWindow ();\n\n    if (\n        ( ! xController.is() ) ||\n        ( ! xWindow.is()     )\n       )\n        return;\n\n    \/\/ a) set default value to an invalid one. So we can start further searches for right icon id, if\n    \/\/    first steps failed!\n    sal_Int32 nIcon = INVALID_ICON_ID;\n\n    \/\/ b) try to find information on controller property set directly\n    \/\/    Don't forget to catch possible exceptions - because these property is an optional one!\n    css::uno::Reference< css::beans::XPropertySet > xSet( xController, css::uno::UNO_QUERY );\n    if ( xSet.is() )\n    {\n        try\n        {\n            css::uno::Reference< css::beans::XPropertySetInfo > const xPSI( xSet->getPropertySetInfo(), css::uno::UNO_SET_THROW );\n            if ( xPSI->hasPropertyByName( DECLARE_ASCII(\"IconId\") ) )\n                xSet->getPropertyValue( DECLARE_ASCII(\"IconId\") ) >>= nIcon;\n        }\n        catch(const css::uno::Exception&)\n        {\n            DBG_UNHANDLED_EXCEPTION();\n        }\n    }\n\n    \/\/ c) if b) failed ... identify the used module and retrieve set icon from module config.\n    \/\/    Tirck :-) Module was already specified outside and aInfo contains all needed information.\n    if ( nIcon == INVALID_ICON_ID )\n    {\n        TModuleInfo aInfo;\n        if (implst_getModuleInfo(xFrame, aInfo))\n            nIcon = aInfo.nIcon;\n    }\n\n    \/\/ d) if all steps failed - use fallback :-)\n    \/\/    ... means using the global staroffice icon\n    if( nIcon == INVALID_ICON_ID )\n        nIcon = DEFAULT_ICON_ID;\n\n    \/\/ e) set icon on container window now\n    \/\/    Don't forget SolarMutex! We use vcl directly :-(\n    \/\/    Check window pointer for right WorkWindow class too!!!\n\n    \/\/ VCL SYNCHRONIZED ->\n    SolarMutexGuard aSolarGuard;\n\n    Window* pWindow = (VCLUnoHelper::GetWindow( xWindow ));\n    if (\n        ( pWindow                                 ) &&\n        ( pWindow->GetType() == WINDOW_WORKWINDOW )\n       )\n    {\n        WorkWindow* pWorkWindow = (WorkWindow*)pWindow;\n        pWorkWindow->SetIcon( (sal_uInt16)nIcon );\n\n        css::uno::Reference< css::frame::XModel > xModel = xController->getModel();\n        OUString aURL;\n        if( xModel.is() )\n            aURL = xModel->getURL();\n        pWorkWindow->SetRepresentedURL( aURL );\n    }\n    \/\/ <- VCL SYNCHRONIZED\n}\n\n\/\/*****************************************************************************************************************\nvoid TitleBarUpdate::impl_updateTitle(const css::uno::Reference< css::frame::XFrame >& xFrame)\n{\n    \/\/ no window ... no chance to set any title -> return\n    css::uno::Reference< css::awt::XWindow > xWindow = xFrame->getContainerWindow ();\n    if ( ! xWindow.is() )\n        return;\n\n    css::uno::Reference< css::frame::XTitle > xTitle(xFrame, css::uno::UNO_QUERY);\n    if ( ! xTitle.is() )\n        return;\n\n    const OUString sTitle = xTitle->getTitle ();\n\n    \/\/ VCL SYNCHRONIZED ->\n    SolarMutexGuard aSolarGuard;\n\n    Window* pWindow = (VCLUnoHelper::GetWindow( xWindow ));\n    if (\n        ( pWindow                                 ) &&\n        ( pWindow->GetType() == WINDOW_WORKWINDOW )\n       )\n    {\n        WorkWindow* pWorkWindow = (WorkWindow*)pWindow;\n        pWorkWindow->SetText( sTitle );\n    }\n    \/\/ <- VCL SYNCHRONIZED\n}\n\n} \/\/ namespace framework\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before>#include <cstdio>\n#include <algorithm>\n\nusing namespace std;\n\n#define X(a,b) (x[a]*10+x[b])\n\nint main() {\n    int x[] = { 0, 2, 3, 4, 5, 6, 7, 8, 9 };\n    do {\n        int ab = X(0, 1), cd = X(2, 3), ef = X(4, 5), gh = X(6, 7);\n        if ((ab >= 10 && cd >= 10 && ef >= 10 && gh >= 10) && (ab - cd) == ef && (ef + gh) == 111) {\n            printf(\"%02d + %02d = %02d, %02d - %02d = 111\\n\", ab, cd, ef, ef, gh);\n        }\n    } while (next_permutation(x, x + 9));\n\n    return 0;\n}\n<commit_msg>Refactor C++ code to real C++ code<commit_after>#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\n#define X(a,b) (x[a]*10+x[b])\n\nint mkInt(vector<int> &v) {\n    int ret = 0;\n    for (vector<int>::iterator it = v.begin(); it != v.end(); ++it) {\n        ret = ret * 10 + *it;\n    }\n    return ret;\n}\n\nint main() {\n    int init_x[] = { 0, 2, 3, 4, 5, 6, 7, 8, 9 };\n    vector<int> x = vector<int>(init_x, init_x + 9);\n    do {\n        vector<int> vec_ab = vector<int>(x.begin() + 0, x.begin() + 2);\n        vector<int> vec_cd = vector<int>(x.begin() + 2, x.begin() + 4);\n        vector<int> vec_ef = vector<int>(x.begin() + 4, x.begin() + 6);\n        vector<int> vec_gh = vector<int>(x.begin() + 6, x.begin() + 8);\n\n        int ab = mkInt(vec_ab), cd = mkInt(vec_cd), ef = mkInt(vec_ef), gh = mkInt(vec_gh);\n        if ((ab >= 10 && cd >= 10 && ef >= 10 && gh >= 10) && (ab - cd) == ef && (ef + gh) == 111) {\n            cout << ab << \" + \" << cd << \" = \" << ef << \", \" << ef << \" - \" << gh << \" = 111\" << endl;\n        }\n    } while (next_permutation(x.begin(), x.end()));\n\n    return 0;\n}\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#define SUITE indexer_stage_driver\n\n#include \"vast\/system\/indexer_stage_driver.hpp\"\n\n#include \"vast\/test\/test.hpp\"\n\n#include \"vast\/test\/fixtures\/actor_system_and_events.hpp\"\n\n#include <random>\n#include <vector>\n\n#include \"vast\/concept\/printable\/to_string.hpp\"\n#include \"vast\/detail\/spawn_container_source.hpp\"\n#include \"vast\/meta_index.hpp\"\n#include \"vast\/system\/index.hpp\"\n#include \"vast\/system\/partition.hpp\"\n#include \"vast\/to_events.hpp\"\n#include \"vast\/uuid.hpp\"\n\nusing namespace caf;\nusing namespace vast;\nusing namespace vast::system;\n\nusing std::shared_ptr;\nusing std::make_shared;\n\nnamespace {\n\nthread_local std::vector<caf::actor> all_sinks;\n\nstruct sink_state {\n  std::vector<event> buf;\n};\n\nbehavior dummy_sink(stateful_actor<sink_state>* self) {\n  return {[=](stream<table_slice_ptr> in) {\n    self->make_sink(in,\n                    [=](unit_t&) {\n                      \/\/ nop\n                    },\n                    [=](unit_t&, table_slice_ptr slice) {\n                      for (auto& x : to_events(*slice))\n                        self->state.buf.emplace_back(std::move(x));\n                    });\n    self->unbecome();\n  }};\n}\n\ncaf::actor spawn_sink(caf::local_actor* self, path, type, size_t, caf::actor,\n                      uuid, atomic_measurement*) {\n  auto result = self->spawn(dummy_sink);\n  all_sinks.emplace_back(result);\n  return result;\n}\n\nbehavior dummy_index(stateful_actor<index_state>* self, path dir) {\n  self->state.init(dir, std::numeric_limits<size_t>::max(), 10, 5);\n  self->state.factory = spawn_sink;\n  return {[] {\n    \/\/ nop\n  }};\n}\n\nbehavior test_stage(stateful_actor<index_state>* self) {\n  return {[=](stream<table_slice_ptr> in) {\n    auto mgr = self->make_continuous_stage<indexer_stage_driver>(self);\n    mgr->add_inbound_path(in);\n    self->unbecome();\n  }};\n}\n\nstruct fixture : fixtures::deterministic_actor_system_and_events {\n  fixture() : expected_sink_count(0) {\n    \/\/ Only needed for computing how many layouts are in our data set.\n    std::set<record_type> layouts;\n    \/\/ Makes sure no persistet state exists.\n    rm(state_dir);\n    \/\/ Pick slices from various data sets.\n    auto pick_from = [&](const auto& slices) {\n      VAST_ASSERT(slices.size() > 0);\n      test_slices.emplace_back(slices[0]);\n      layouts.emplace(slices[0]->layout());\n    };\n    pick_from(bro_conn_log_slices);\n    pick_from(ascending_integers_slices);\n    \/\/ TODO: uncomment when resolving [ch3215]\n    \/\/ pick_from(bro_http_log_slices);\n    \/\/ pick_from(bgpdump_txt_slices);\n    \/\/ pick_from(random_slices);\n    num_layouts = layouts.size();\n    for (auto& layout : layouts)\n      expected_sink_count += layout.fields.size();\n    REQUIRE_EQUAL(test_slices.size(), num_layouts);\n    index = sys.spawn(dummy_index, state_dir \/ \"dummy-index\");\n  }\n\n  ~fixture() {\n    \/\/ Make sure we're not leaving stuff behind.\n    for (auto& snk : all_sinks)\n      anon_send_exit(snk, exit_reason::user_shutdown);\n    all_sinks.clear();\n  }\n\n  \/\/ Directory where the manager is supposed to persist its state.\n  path state_dir = directory \/ \"indexer-manager\";\n\n  \/\/ Dummy acting as INDEX.\n  actor index;\n\n  \/\/ Randomly picked table slices from the events fixture.\n  std::vector<table_slice_ptr> test_slices;\n\n  \/\/ Keeps track how many layouts are in `test_slices`.\n  size_t num_layouts;\n\n  \/\/ Tells us how many INDEXER actors *should* get started.\n  size_t expected_sink_count;\n\n  \/\/ Convenience getter for accessing the state of our dummy INDEX.\n  index_state* state() {\n    return std::addressof(deref<stateful_actor<index_state>>(index).state);\n  }\n};\n\n} \/\/ namespace <anonymous>\n\nFIXTURE_SCOPE(indexer_stage_driver_tests, fixture)\n\nTEST(spawning sinks automatically) {\n  MESSAGE(\"spawn the stage\");\n  auto stg = sys.spawn(test_stage);\n  MESSAGE(\"spawn the source and run\");\n  auto src = vast::detail::spawn_container_source(self->system(),\n                                                  test_slices,\n                                                  stg);\n  run();\n  CHECK_EQUAL(all_sinks.size(), expected_sink_count);\n  \/*\n  MESSAGE(\"check content of the shared buffer\");\n  std::vector<event> rows;\n  for (auto& slice : test_slices)\n    for (auto& x : to_events(*slice))\n      rows.emplace_back(std::move(x));\n  auto& buf = state.buf;\n  std::sort(buf.begin(), buf.end());\n  CHECK_EQUAL(rows, buf);\n  anon_send_exit(stg, exit_reason::user_shutdown);\n  *\/\n}\n\n\/*\nTEST(creating bro conn log partitions automatically) {\n  MESSAGE(\"spawn the stage\");\n  auto stg = sys.spawn(test_stage, &pindex,\n                       partition_factory(sys, state_dir, &partition_count),\n                       slice_size);\n  MESSAGE(\"spawn the source and run\");\n  auto src = vast::detail::spawn_container_source(self->system(),\n                                                  bro_conn_log_slices, stg);\n  run();\n  CHECK_EQUAL(bufs->size(), bro_conn_log_slices.size());\n  MESSAGE(\"flatten all partitions into one buffer\");\n  event_buffer xs;\n  for (auto& buf : *bufs)\n    xs.insert(xs.end(), buf->begin(), buf->end());\n  CHECK_EQUAL(bro_conn_log.size(), xs.size());\n  std::sort(xs.begin(), xs.end());\n  auto ys = bro_conn_log;\n  std::sort(ys.begin(), ys.end());\n  REQUIRE_EQUAL(xs.size(), ys.size());\n  for (size_t i = 0; i < xs.size(); ++i)\n    CHECK_EQUAL(xs[i], flatten(ys[i]));\n  anon_send_exit(stg, exit_reason::user_shutdown);\n}\n*\/\n\nFIXTURE_SCOPE_END()\n<commit_msg>Fix indexer_stage_driver unit test<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#define SUITE indexer_stage_driver\n\n#include \"vast\/system\/indexer_stage_driver.hpp\"\n\n#include \"vast\/test\/test.hpp\"\n\n#include \"vast\/test\/fixtures\/actor_system_and_events.hpp\"\n\n#include <random>\n#include <vector>\n\n#include \"vast\/concept\/printable\/to_string.hpp\"\n#include \"vast\/detail\/spawn_container_source.hpp\"\n#include \"vast\/logger.hpp\"\n#include \"vast\/meta_index.hpp\"\n#include \"vast\/system\/index.hpp\"\n#include \"vast\/system\/partition.hpp\"\n#include \"vast\/to_events.hpp\"\n#include \"vast\/uuid.hpp\"\n\nusing namespace caf;\nusing namespace vast;\nusing namespace vast::system;\n\nusing std::shared_ptr;\nusing std::make_shared;\n\nnamespace {\n\ntemplate <class Container>\nauto sorted(Container xs) {\n  std::sort(xs.begin(), xs.end());\n  return xs;\n}\n\nthread_local std::vector<caf::actor> all_sinks;\n\nthread_local std::set<table_slice_ptr> all_slices;\n\nbehavior dummy_sink(event_based_actor* self) {\n  return {[=](stream<table_slice_ptr> in) {\n    self->make_sink(in,\n                    [=](unit_t&) {\n                      \/\/ nop\n                    },\n                    [=](unit_t&, table_slice_ptr slice) {\n                      all_slices.emplace(std::move(slice));\n                    });\n    self->unbecome();\n  }};\n}\n\ncaf::actor spawn_sink(caf::local_actor* self, path dir, type t, size_t,\n                      caf::actor, uuid partition_id, atomic_measurement*) {\n  VAST_TRACE(VAST_ARG(dir), VAST_ARG(\"t\", t.name()), VAST_ARG(partition_id));\n  auto result = self->spawn(dummy_sink);\n  all_sinks.emplace_back(result);\n  return result;\n}\n\nbehavior dummy_index(stateful_actor<index_state>* self, path dir) {\n  VAST_TRACE(VAST_ARG(dir));\n  self->state.init(dir, std::numeric_limits<size_t>::max(), 10, 5);\n  self->state.factory = spawn_sink;\n  return {[=](stream<table_slice_ptr> in) {\n    auto mgr = self->make_continuous_stage<indexer_stage_driver>(self);\n    mgr->add_inbound_path(in);\n    self->unbecome();\n  }};\n}\n\nstruct fixture : fixtures::deterministic_actor_system_and_events {\n  fixture() : expected_sink_count(0) {\n    \/\/ Only needed for computing how many layouts are in our data set.\n    std::set<record_type> layouts;\n    \/\/ Make sure no persistet state exists.\n    rm(state_dir);\n    \/\/ Make sure we have a clean slate.\n    all_sinks.clear();\n    all_slices.clear();\n    \/\/ Pick slices from various data sets.\n    auto pick_from = [&](const auto& slices) {\n      VAST_ASSERT(slices.size() > 0);\n      test_slices.emplace_back(slices[0]);\n      layouts.emplace(slices[0]->layout());\n    };\n    pick_from(bro_conn_log_slices);\n    pick_from(ascending_integers_slices);\n    \/\/ TODO: uncomment when resolving [ch3215]\n    \/\/ pick_from(bro_http_log_slices);\n    \/\/ pick_from(bgpdump_txt_slices);\n    \/\/ pick_from(random_slices);\n    num_layouts = layouts.size();\n    for (auto& layout : layouts)\n      expected_sink_count += layout.fields.size();\n    REQUIRE_EQUAL(test_slices.size(), num_layouts);\n    index = sys.spawn(dummy_index, state_dir \/ \"dummy-index\");\n  }\n\n  ~fixture() {\n    \/\/ Make sure we're not leaving stuff behind.\n    for (auto& snk : all_sinks)\n      anon_send_exit(snk, exit_reason::user_shutdown);\n    all_sinks.clear();\n  }\n\n  \/\/ Directory where the manager is supposed to persist its state.\n  path state_dir = directory \/ \"indexer-manager\";\n\n  \/\/ Dummy acting as INDEX.\n  actor index;\n\n  \/\/ Randomly picked table slices from the events fixture.\n  std::vector<table_slice_ptr> test_slices;\n\n  \/\/ Keeps track how many layouts are in `test_slices`.\n  size_t num_layouts;\n\n  \/\/ Tells us how many INDEXER actors *should* get started.\n  size_t expected_sink_count;\n\n  \/\/ Convenience getter for accessing the state of our dummy INDEX.\n  index_state* state() {\n    return std::addressof(deref<stateful_actor<index_state>>(index).state);\n  }\n};\n\n} \/\/ namespace <anonymous>\n\nFIXTURE_SCOPE(indexer_stage_driver_tests, fixture)\n\nTEST(spawning sinks automatically) {\n  MESSAGE(\"spawn the source and run\");\n  auto src = vast::detail::spawn_container_source(self->system(), test_slices,\n                                                  index);\n  run();\n  CHECK_EQUAL(all_sinks.size(), expected_sink_count);\n  CHECK_EQUAL(sorted(test_slices), all_slices);\n}\n\n\/*\nTEST(creating bro conn log partitions automatically) {\n  MESSAGE(\"spawn the stage\");\n  auto stg = sys.spawn(test_stage, &pindex,\n                       partition_factory(sys, state_dir, &partition_count),\n                       slice_size);\n  MESSAGE(\"spawn the source and run\");\n  auto src = vast::detail::spawn_container_source(self->system(),\n                                                  bro_conn_log_slices, stg);\n  run();\n  CHECK_EQUAL(bufs->size(), bro_conn_log_slices.size());\n  MESSAGE(\"flatten all partitions into one buffer\");\n  event_buffer xs;\n  for (auto& buf : *bufs)\n    xs.insert(xs.end(), buf->begin(), buf->end());\n  CHECK_EQUAL(bro_conn_log.size(), xs.size());\n  std::sort(xs.begin(), xs.end());\n  auto ys = bro_conn_log;\n  std::sort(ys.begin(), ys.end());\n  REQUIRE_EQUAL(xs.size(), ys.size());\n  for (size_t i = 0; i < xs.size(); ++i)\n    CHECK_EQUAL(xs[i], flatten(ys[i]));\n  anon_send_exit(stg, exit_reason::user_shutdown);\n}\n*\/\n\nFIXTURE_SCOPE_END()\n<|endoftext|>"}
{"text":"<commit_before>#include \"astarplanner.h\"\n#include <common\/config\/configmanager.h>\n#include <common\/logger\/logger.h>\n#include <pcl\/kdtree\/kdtree_flann.h>\n\nAStarPlanner::AStarPlanner()\n{\n    \/*\n     * These ConfigManager calls just make sure the config values get added\n     * to the file even if the algorithm doesn't run. This is simply for\n     * ease of use, ensuring that the config values appear in the editor at\n     * the start of the application.\n     *\/\n    ConfigManager::Instance().getValue(\"AStarPlanner\", \"GoalThreshold\", 2.0);\n    ConfigManager::Instance().getValue(\"AStarPlanner\", \"OnPathThreshold\", 0.6);\n    ConfigManager::Instance().getValue(\"AStarPlanner\", \"CollisionThreshold\", 1.0);\n    ConfigManager::Instance().getValue(\"AStarPlanner\", \"Velocity\", 1.0);\n    ConfigManager::Instance().getValue(\"AStarPlanner\", \"DeltaT\", 1.0);\n    ConfigManager::Instance().getValue(\"Robot\", \"Baseline\", 0);\n    ConfigManager::Instance().getValue(\"AStarPlanner\", \"CollisionRadius\", 1.0);\n\n    mapSet = false;\n    goalSet = false;\n    startSet = false;\n\n    replanRequested = false;\n    thread = boost::thread(boost::bind(&AStarPlanner::run, this));\n}\n\nAStarPlanner::~AStarPlanner()\n{\n    std::cout << \"here\" << std::endl;\n    thread.interrupt();\n    std::cout << \"there\" << std::endl;\n    thread.join();\n    std::cout << \"y\" << std::endl;\n}\n\npath_t AStarPlanner::GetPath()\n{\n    return path;\n}\n\nvoid AStarPlanner::run()\n{\n    while(true)\n    {\n        if(mapSet && startSet && goalSet && replanRequested)\n        {\n            replanRequested = false;\n            searchproblem.Speed = ConfigManager::Instance().getValue(\"AStarPlanner\", \"Velocity\", 1.0);\n            searchproblem.DeltaT = ConfigManager::Instance().getValue(\"AStarPlanner\", \"DeltaT\", 1.0);\n            searchproblem.PointTurnsEnabled = false;\n            searchproblem.Baseline = ConfigManager::Instance().getValue(\"Robot\", \"Baseline\", 1.0);\n            searchproblem.Threshold = ConfigManager::Instance().getValue(\"AStarPlanner\", \"CollisionRadius\", 1.0);\n            searchproblem.GoalThreshold = ConfigManager::Instance().getValue(\"AStarPlanner\", \"GoalThreshold\", 1.0);\n            auto newpath = GraphSearch::AStar(searchproblem);\n            path.clear();\n            for(int i = 0; i < newpath.getNumberOfSteps(); i++)\n                path.push_back(std::pair<SearchMove,SearchLocation>(newpath.getAction(i), newpath.getState(i+1)));\n            replanRequested = false;\n            OnNewPath(path);\n        }\n        try {\n            boost::this_thread::interruption_point();\n        } catch(...) {\n            return;\n        }\n        usleep(300000);\n    }\n}\n\nbool AStarPlanner::pathIsValid()\n{\n    if(searchproblem.Map == nullptr)\n        return false;\n    if(path.size() == 0)\n        return false;\n    if(path[path.size()-1].second.distTo(searchproblem.Goal) > ConfigManager::Instance().getValue(\"AStarPlanner\", \"GoalThreshold\", 2.0))\n        return false;\n    if(distanceFromPath(searchproblem.Start) > ConfigManager::Instance().getValue(\"AStarPlanner\", \"OnPathThreshold\", 0.6))\n        return false;\n    if(searchproblem.Map->empty())\n        return true;\n    pcl::KdTreeFLANN<pcl::PointXYZ> kdtree;\n    kdtree.setInputCloud(searchproblem.Map);\n    std::vector<int> pointIdxRadiusSearch;\n    std::vector<float> pointRadiusSquaredDistance;\n    float radius = ConfigManager::Instance().getValue(\"AStarPlanner\", \"CollisionThreshold\", 1.0);\n    for(auto pair : path)\n    {\n        pcl::PointXYZ point;\n        point.x = pair.second.x;\n        point.y = pair.second.y;\n        point.z = 0;\n        if( kdtree.radiusSearch(point, radius, pointIdxRadiusSearch, pointRadiusSquaredDistance) > 0)\n        {\n            return false;\n        }\n    }\n    return true;\n}\n\nfloat AStarPlanner::distanceFromPath(SearchLocation point)\n{\n    float minDist = point.distTo(searchproblem.Start);\n    for(auto pair : path)\n    {\n        float dist = point.distTo(pair.second);\n        if(dist < minDist)\n            minDist = dist;\n    }\n    return minDist;\n}\n\nvoid AStarPlanner::OnNewMap(pcl::PointCloud<pcl::PointXYZ>::Ptr map)\n{\n    searchproblem.Map = map;\n    mapSet = true;\n    if(!pathIsValid())\n        replanRequested = true;\n}\n\nvoid AStarPlanner::OnNewStartPos(RobotPosition pos)\n{\n    searchproblem.Start = SearchLocation(pos.X, pos.Y, pos.Heading);\n    startSet = true;\n    if(!pathIsValid())\n        replanRequested = true;\n}\n\nvoid AStarPlanner::OnNewGoalPos(RobotPosition pos)\n{\n    searchproblem.Goal = SearchLocation(pos.X, pos.Y, pos.Heading);\n    goalSet = true;\n    Logger::Log(LogLevel::Debug, \"[AStarPlanner] Received new goal pos \" + pos.toString());\n    if(!pathIsValid())\n        replanRequested = true;\n}\n<commit_msg>Removes debugging printouts.<commit_after>#include \"astarplanner.h\"\n#include <common\/config\/configmanager.h>\n#include <common\/logger\/logger.h>\n#include <pcl\/kdtree\/kdtree_flann.h>\n\nAStarPlanner::AStarPlanner()\n{\n    \/*\n     * These ConfigManager calls just make sure the config values get added\n     * to the file even if the algorithm doesn't run. This is simply for\n     * ease of use, ensuring that the config values appear in the editor at\n     * the start of the application.\n     *\/\n    ConfigManager::Instance().getValue(\"AStarPlanner\", \"GoalThreshold\", 2.0);\n    ConfigManager::Instance().getValue(\"AStarPlanner\", \"OnPathThreshold\", 0.6);\n    ConfigManager::Instance().getValue(\"AStarPlanner\", \"CollisionThreshold\", 1.0);\n    ConfigManager::Instance().getValue(\"AStarPlanner\", \"Velocity\", 1.0);\n    ConfigManager::Instance().getValue(\"AStarPlanner\", \"DeltaT\", 1.0);\n    ConfigManager::Instance().getValue(\"Robot\", \"Baseline\", 0);\n    ConfigManager::Instance().getValue(\"AStarPlanner\", \"CollisionRadius\", 1.0);\n\n    mapSet = false;\n    goalSet = false;\n    startSet = false;\n\n    replanRequested = false;\n    thread = boost::thread(boost::bind(&AStarPlanner::run, this));\n}\n\nAStarPlanner::~AStarPlanner()\n{\n    thread.interrupt();\n    thread.join();\n}\n\npath_t AStarPlanner::GetPath()\n{\n    return path;\n}\n\nvoid AStarPlanner::run()\n{\n    while(true)\n    {\n        if(mapSet && startSet && goalSet && replanRequested)\n        {\n            replanRequested = false;\n            searchproblem.Speed = ConfigManager::Instance().getValue(\"AStarPlanner\", \"Velocity\", 1.0);\n            searchproblem.DeltaT = ConfigManager::Instance().getValue(\"AStarPlanner\", \"DeltaT\", 1.0);\n            searchproblem.PointTurnsEnabled = false;\n            searchproblem.Baseline = ConfigManager::Instance().getValue(\"Robot\", \"Baseline\", 1.0);\n            searchproblem.Threshold = ConfigManager::Instance().getValue(\"AStarPlanner\", \"CollisionRadius\", 1.0);\n            searchproblem.GoalThreshold = ConfigManager::Instance().getValue(\"AStarPlanner\", \"GoalThreshold\", 1.0);\n            auto newpath = GraphSearch::AStar(searchproblem);\n            path.clear();\n            for(int i = 0; i < newpath.getNumberOfSteps(); i++)\n                path.push_back(std::pair<SearchMove,SearchLocation>(newpath.getAction(i), newpath.getState(i+1)));\n            replanRequested = false;\n            OnNewPath(path);\n        }\n        try {\n            boost::this_thread::interruption_point();\n        } catch(...) {\n            return;\n        }\n        usleep(300000);\n    }\n}\n\nbool AStarPlanner::pathIsValid()\n{\n    if(searchproblem.Map == nullptr)\n        return false;\n    if(path.size() == 0)\n        return false;\n    if(path[path.size()-1].second.distTo(searchproblem.Goal) > ConfigManager::Instance().getValue(\"AStarPlanner\", \"GoalThreshold\", 2.0))\n        return false;\n    if(distanceFromPath(searchproblem.Start) > ConfigManager::Instance().getValue(\"AStarPlanner\", \"OnPathThreshold\", 0.6))\n        return false;\n    if(searchproblem.Map->empty())\n        return true;\n    pcl::KdTreeFLANN<pcl::PointXYZ> kdtree;\n    kdtree.setInputCloud(searchproblem.Map);\n    std::vector<int> pointIdxRadiusSearch;\n    std::vector<float> pointRadiusSquaredDistance;\n    float radius = ConfigManager::Instance().getValue(\"AStarPlanner\", \"CollisionThreshold\", 1.0);\n    for(auto pair : path)\n    {\n        pcl::PointXYZ point;\n        point.x = pair.second.x;\n        point.y = pair.second.y;\n        point.z = 0;\n        if( kdtree.radiusSearch(point, radius, pointIdxRadiusSearch, pointRadiusSquaredDistance) > 0)\n        {\n            return false;\n        }\n    }\n    return true;\n}\n\nfloat AStarPlanner::distanceFromPath(SearchLocation point)\n{\n    float minDist = point.distTo(searchproblem.Start);\n    for(auto pair : path)\n    {\n        float dist = point.distTo(pair.second);\n        if(dist < minDist)\n            minDist = dist;\n    }\n    return minDist;\n}\n\nvoid AStarPlanner::OnNewMap(pcl::PointCloud<pcl::PointXYZ>::Ptr map)\n{\n    searchproblem.Map = map;\n    mapSet = true;\n    if(!pathIsValid())\n        replanRequested = true;\n}\n\nvoid AStarPlanner::OnNewStartPos(RobotPosition pos)\n{\n    searchproblem.Start = SearchLocation(pos.X, pos.Y, pos.Heading);\n    startSet = true;\n    if(!pathIsValid())\n        replanRequested = true;\n}\n\nvoid AStarPlanner::OnNewGoalPos(RobotPosition pos)\n{\n    searchproblem.Goal = SearchLocation(pos.X, pos.Y, pos.Heading);\n    goalSet = true;\n    Logger::Log(LogLevel::Debug, \"[AStarPlanner] Received new goal pos \" + pos.toString());\n    if(!pathIsValid())\n        replanRequested = true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  readsToPWP.cpp\n\/\/  cPWP\n\/\/\n\/\/  Created by Evan McCartney-Melstad on 12\/31\/14.\n\/\/  Copyright (c) 2014 Evan McCartney-Melstad. All rights reserved.\n\/\/\n\n#include \"readsToPWP.h\"\n#include <stdlib.h>\n#include <stdio.h>\n#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <string>\n#include <vector>\n#include <boost\/iostreams\/filtering_stream.hpp>\n#include <boost\/iostreams\/filtering_streambuf.hpp>\n#include <boost\/iostreams\/filter\/gzip.hpp>\n#include <boost\/algorithm\/string.hpp>\n\n\n\n\nint runANGSDforReadCounts (std::string bamlist, std::string angsdPrefix, std::string nThreads, std::string angsdOutputLog) {\n    std::cout << \"**********\\nChecking if processor is available...**********\\n\";\n    if (system(NULL)) puts (\"Ok\");\n    else exit (EXIT_FAILURE);\n    \n    std::string angsdCommand = \"\/home\/evan\/bin\/angsd0.613\/angsd -bam \" + bamlist + \" -out \" + angsdPrefix + \" -uniqueOnly 1 -only_proper_pairs 1 -remove_bads 1 -doCounts 1 -nThreads \" + nThreads + \" -dumpCounts 4 -doMaf 1 -doMajorMinor 2 -GL 2 -minMapQ 20 -minQ 30 > \" + angsdOutputLog + \" 2>&1\";\n    \n    if (system((angsdCommand).c_str()) != 0) {\n        std::cout << \"**********\\nFailure running the following command: \" << angsdCommand << \"\\n**********\\n\";\n        exit(EXIT_FAILURE);\n    } else {\n        std::cout << \"**********\\nExecuted the following command: \" << angsdCommand << \"\\n**********\\n\";\n    }\n    \n    return 0;\n}\n\n\nunsigned char readCountToUnsignedChar(int individual, std::string allele, std::vector<std::string> countsVector) {\n    \/*    std::cout << \"countsVector elements: \";\n     for (int i=0; i < countsVector.size(); i++) {\n     std::cout <<  countsVector.at(i) << \" \";\n     }\n     std::cout << std::endl;\n     *\/\n    \n    \/\/    std::cout << \"FunctionPassedAllele: \" << allele << std::endl;\n    \n    unsigned char countChar;\n    if (allele == \"A\") {\n        \/\/        std::cout << \"Allele is an A\" << std::endl;\n        int countField = individual*4;\n        int countInt = atoi(countsVector[countField].c_str());\n        countChar = (unsigned char) countInt;\n    }\n    else if (allele == \"C\") {\n        \/\/\tstd::cout << \"Allele is an C\" << std::endl;\n        int countField = (individual*4)+1;\n        int countInt = atoi(countsVector[countField].c_str());\n        countChar = (unsigned char) countInt;\n    } else if (allele == \"G\") {\n        \/\/\tstd::cout << \"Allele is a G\" << std::endl;\n        int countField = (individual*4) + 2;\n        int countInt = atoi(countsVector[countField].c_str());\n        countChar = (unsigned char) countInt;\n    } else if (allele == \"T\") {\n        \/\/\tstd::cout << \"Allele is a T\" << std::endl;\n        int countField = (individual*4) + 3;\n        int countInt = atoi(countsVector[countField].c_str());\n        countChar = (unsigned char) countInt;\n    } else {\n        std::cout << \"Allele doesn't look right. The allele fed into readCountToUnsignedChar is: \" << allele << \". Exiting now\" << std::endl;\n        exit(EXIT_FAILURE);\n    }\n    \/\/    std::cout << std::to_string(countChar) << std::endl;\n    return countChar;\n}\n\n\n\nint convertANGSDcountsToBinary(std::string angsdPrefix, std::string binaryOutputFileName, int numIndividuals, int readDepthMax)\n{\n    std::string countsFileName = angsdPrefix + \".counts.gz\";\n    std::string mafsFileName = angsdPrefix + \".mafs.gz\";\n    std::ifstream countsFile(countsFileName, std::ios_base::in | std::ios_base::binary);\n    std::ifstream mafsFile(mafsFileName, std::ios_base::in | std::ios_base::binary);\n    std::ofstream outCountsFile(binaryOutputFileName, std::ios_base::out | std::ios_base::binary);\n    \n    try {\n        boost::iostreams::filtering_istream in;\n        boost::iostreams::filtering_istream inMafs;\n        in.push(boost::iostreams::gzip_decompressor());\n        in.push(countsFile);\n        inMafs.push(boost::iostreams::gzip_decompressor());\n        inMafs.push(mafsFile);\n        int counter = 0;\n        \/\/int numIndividuals = 3;\n        for(std::string str; std::getline(in, str); )\n        {\n            \/* Make sure to get the maf string before we do anything else to keep it in\n             sync with the counts string *\/\n            std::string mafStr;\n            std::getline(inMafs, mafStr);\n            \n            \/\/ Skip the first line of the counts and mafs file, since it is a header\n            if (counter == 0) {\n                counter++;\n                continue;\n            }\n            \n            \/\/ Just for monitoring progress\n            if (counter % 1000000 == 0) {\n                std::cout << \"Processed \" << counter << \" loci\" << std::endl;\n            }\n            \n            \/* The first thing we'll do after getting the lines from the gzipped file is to split \n             the tab-separated lines into separate vectors for the counts and mafs. The vector will \n             be recreated for every line of the gzipped counts and mafs files output by angsd (each \n             line represents a locus) *\/\n            std::vector<std::string> countsFields;\n            boost::algorithm::split(countsFields, str, boost::is_any_of(\"\\t\"), boost::token_compress_on);\n            std::vector<std::string> mafFields;\n            boost::algorithm::split(mafFields, mafStr, boost::is_any_of(\"\\t\"), boost::token_compress_on);\n            \n            \n            \/* Since we're using a weighted PWP calculation, and since we don't want to overweight\n             repetitive regions, we'll throw out any locus that has more than readDepthMax reads\n             for any individual at that locus *\/\n            auto countMax = std::minmax_element(countsFields.begin(),countsFields.end());\n            if (*countMax.second > readDepthMax) {\n                continue; \/\/ Skip to the next locus\n            }\n            \n\n            \/\/ Now that the lines are parsed, pull the major and minor alleles from angsd's mafs output\n            std::string majorAllele = mafFields[2];\n            std::string minorAllele = mafFields[3];\n            \n            \n            \/* Next, we'll count find how many reads there are supporting the major and minor\n             alleles for each individual by looking through the corresponding counts file. The\n             function that does this, \"readCountToUnsignedChar\" is implemented above. It returns\n             the readcount number as an unsigned char for binary printing. The max value of an\n             unsigned char is 255, but we are skipping all loci with individual read depths \n             above readDepthMax (which will usually be much less than 255)*\/\n            for (int individual = 0; individual < numIndividuals; individual++) {\n                unsigned char majorAlleleUnsignedChar = readCountToUnsignedChar(individual, majorAllele, countsFields);\n                unsigned char minorAlleleUnsignedChar = readCountToUnsignedChar(individual, minorAllele, countsFields);\n                outCountsFile << majorAlleleUnsignedChar << minorAlleleUnsignedChar;\n            }\n            counter++; \/\/ Keep track of how many loci have been processed\n        }\n    }\n    catch(const boost::iostreams::gzip_error& e) {\n        std::cout << e.what() << '\\n';\n    }\n    outCountsFile.close();\n    \n    return 0;\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n<commit_msg>Convert readcount strings to ints with boost<commit_after>\/\/\n\/\/  readsToPWP.cpp\n\/\/  cPWP\n\/\/\n\/\/  Created by Evan McCartney-Melstad on 12\/31\/14.\n\/\/  Copyright (c) 2014 Evan McCartney-Melstad. All rights reserved.\n\/\/\n\n#include \"readsToPWP.h\"\n#include <stdlib.h>\n#include <stdio.h>\n#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <string>\n#include <vector>\n#include <boost\/iostreams\/filtering_stream.hpp>\n#include <boost\/iostreams\/filtering_streambuf.hpp>\n#include <boost\/iostreams\/filter\/gzip.hpp>\n#include <boost\/algorithm\/string.hpp>\n\n\n\n\nint runANGSDforReadCounts (std::string bamlist, std::string angsdPrefix, std::string nThreads, std::string angsdOutputLog) {\n    std::cout << \"**********\\nChecking if processor is available...**********\\n\";\n    if (system(NULL)) puts (\"Ok\");\n    else exit (EXIT_FAILURE);\n    \n    std::string angsdCommand = \"\/home\/evan\/bin\/angsd0.613\/angsd -bam \" + bamlist + \" -out \" + angsdPrefix + \" -uniqueOnly 1 -only_proper_pairs 1 -remove_bads 1 -doCounts 1 -nThreads \" + nThreads + \" -dumpCounts 4 -doMaf 1 -doMajorMinor 2 -GL 2 -minMapQ 20 -minQ 30 > \" + angsdOutputLog + \" 2>&1\";\n    \n    if (system((angsdCommand).c_str()) != 0) {\n        std::cout << \"**********\\nFailure running the following command: \" << angsdCommand << \"\\n**********\\n\";\n        exit(EXIT_FAILURE);\n    } else {\n        std::cout << \"**********\\nExecuted the following command: \" << angsdCommand << \"\\n**********\\n\";\n    }\n    \n    return 0;\n}\n\n\nunsigned char readCountToUnsignedChar(int individual, std::string allele, std::vector<std::string> countsVector) {\n    \/*    std::cout << \"countsVector elements: \";\n     for (int i=0; i < countsVector.size(); i++) {\n     std::cout <<  countsVector.at(i) << \" \";\n     }\n     std::cout << std::endl;\n     *\/\n    \n    \/\/    std::cout << \"FunctionPassedAllele: \" << allele << std::endl;\n    \n    unsigned char countChar;\n    if (allele == \"A\") {\n        \/\/        std::cout << \"Allele is an A\" << std::endl;\n        int countField = individual*4;\n        int countInt = atoi(countsVector[countField].c_str());\n        countChar = (unsigned char) countInt;\n    }\n    else if (allele == \"C\") {\n        \/\/\tstd::cout << \"Allele is an C\" << std::endl;\n        int countField = (individual*4)+1;\n        int countInt = atoi(countsVector[countField].c_str());\n        countChar = (unsigned char) countInt;\n    } else if (allele == \"G\") {\n        \/\/\tstd::cout << \"Allele is a G\" << std::endl;\n        int countField = (individual*4) + 2;\n        int countInt = atoi(countsVector[countField].c_str());\n        countChar = (unsigned char) countInt;\n    } else if (allele == \"T\") {\n        \/\/\tstd::cout << \"Allele is a T\" << std::endl;\n        int countField = (individual*4) + 3;\n        int countInt = atoi(countsVector[countField].c_str());\n        countChar = (unsigned char) countInt;\n    } else {\n        std::cout << \"Allele doesn't look right. The allele fed into readCountToUnsignedChar is: \" << allele << \". Exiting now\" << std::endl;\n        exit(EXIT_FAILURE);\n    }\n    \/\/    std::cout << std::to_string(countChar) << std::endl;\n    return countChar;\n}\n\n\n\nint convertANGSDcountsToBinary(std::string angsdPrefix, std::string binaryOutputFileName, int numIndividuals, int readDepthMax)\n{\n    std::string countsFileName = angsdPrefix + \".counts.gz\";\n    std::string mafsFileName = angsdPrefix + \".mafs.gz\";\n    std::ifstream countsFile(countsFileName, std::ios_base::in | std::ios_base::binary);\n    std::ifstream mafsFile(mafsFileName, std::ios_base::in | std::ios_base::binary);\n    std::ofstream outCountsFile(binaryOutputFileName, std::ios_base::out | std::ios_base::binary);\n    \n    try {\n        boost::iostreams::filtering_istream in;\n        boost::iostreams::filtering_istream inMafs;\n        in.push(boost::iostreams::gzip_decompressor());\n        in.push(countsFile);\n        inMafs.push(boost::iostreams::gzip_decompressor());\n        inMafs.push(mafsFile);\n        int counter = 0;\n        \/\/int numIndividuals = 3;\n        for(std::string str; std::getline(in, str); )\n        {\n            \/* Make sure to get the maf string before we do anything else to keep it in\n             sync with the counts string *\/\n            std::string mafStr;\n            std::getline(inMafs, mafStr);\n            \n            \/\/ Skip the first line of the counts and mafs file, since it is a header\n            if (counter == 0) {\n                counter++;\n                continue;\n            }\n            \n            \/\/ Just for monitoring progress\n            if (counter % 1000000 == 0) {\n                std::cout << \"Processed \" << counter << \" loci\" << std::endl;\n            }\n            \n            \/* The first thing we'll do after getting the lines from the gzipped file is to split \n             the tab-separated lines into separate vectors for the counts and mafs. The vector will \n             be recreated for every line of the gzipped counts and mafs files output by angsd (each \n             line represents a locus) *\/\n            std::vector<std::string> countsFields;\n            boost::algorithm::split(countsFields, str, boost::is_any_of(\"\\t\"), boost::token_compress_on);\n            \n            std::vector<std::string> mafFields;\n            boost::algorithm::split(mafFields, mafStr, boost::is_any_of(\"\\t\"), boost::token_compress_on);\n            \n            \n            \/* Since we're using a weighted PWP calculation, and since we don't want to overweight\n             repetitive regions, we'll throw out any locus that has more than readDepthMax reads\n             for any individual at that locus *\/\n            std::vector<int> countsFieldsInts;\n            try\n            {\n                for (size_t i=0; i<countsFields.size(); i++)\n                {\n                    countsFieldsInts.push_back(boost::lexical_cast<int>(countsFields[i]));\n                }\n            }\n            catch(const boost::bad_lexical_cast &)\n            {\n                \/\/If we're here it's not an integer\n                std::cout << \"Problem converting the strings from readCounts into integers!\" << endl;\n                exit(EXIT_FAILURE);\n            }\n            \n            \n            auto countMax = std::minmax_element(countsFields.begin(),countsFields.end());\n            if (*countMax.second > readDepthMax) {\n                continue; \/\/ Skip to the next locus\n            }\n            \n\n            \/\/ Now that the lines are parsed, pull the major and minor alleles from angsd's mafs output\n            std::string majorAllele = mafFields[2];\n            std::string minorAllele = mafFields[3];\n            \n            \n            \/* Next, we'll count find how many reads there are supporting the major and minor\n             alleles for each individual by looking through the corresponding counts file. The\n             function that does this, \"readCountToUnsignedChar\" is implemented above. It returns\n             the readcount number as an unsigned char for binary printing. The max value of an\n             unsigned char is 255, but we are skipping all loci with individual read depths \n             above readDepthMax (which will usually be much less than 255)*\/\n            for (int individual = 0; individual < numIndividuals; individual++) {\n                unsigned char majorAlleleUnsignedChar = readCountToUnsignedChar(individual, majorAllele, countsFields);\n                unsigned char minorAlleleUnsignedChar = readCountToUnsignedChar(individual, minorAllele, countsFields);\n                outCountsFile << majorAlleleUnsignedChar << minorAlleleUnsignedChar;\n            }\n            counter++; \/\/ Keep track of how many loci have been processed\n        }\n    }\n    catch(const boost::iostreams::gzip_error& e) {\n        std::cout << e.what() << '\\n';\n    }\n    outCountsFile.close();\n    \n    return 0;\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>#include \"RdSDLInputManager.hpp\"\n\n\/\/-- Initialize static members\nrd::RdSDLInputManager * rd::RdSDLInputManager::uniqueInstance = NULL;\nconst std::string rd::RdSDLInputManager::id = \"SDL\";\n\nbool rd::RdSDLInputManager::start()\n{  \n    \/\/-- Start input callback\n    SDL_AddEventWatch(staticInputCallback, this);\n\n    stopped = false;\n\n    return true;\n}\n\nbool rd::RdSDLInputManager::stop()\n{\n    \/\/-- Stop input callback\n\n    stopped = true;\n\n    return true;\n}\n\nbool rd::RdSDLInputManager::isStopped()\n{\n    return stopped;\n}\n\nbool rd::RdSDLInputManager::configure(std::string parameter, std::string value)\n{\n    return RdInputManager::configure(parameter, value);\n}\n\nbool rd::RdSDLInputManager::RegisterManager()\n{\n    if (uniqueInstance == NULL)\n    {\n        uniqueInstance = new RdSDLInputManager();\n    }\n\n    return Register( uniqueInstance, id);\n}\n\nrd::RdSDLInputManager::~RdSDLInputManager()\n{\n    \/\/-- Stop this thread\n    this->stop();\n    uniqueInstance = NULL;\n}\n\nrd::RdSDLInputManager::RdSDLInputManager()\n{\n    stopped = true;\n\n    \/\/-- Init SDL\n    \/\/\/\/\/\/\/\/if (SDL_WasInit( SDL_INIT_EVENTTHREAD) == 0)\n    \/\/\/\/\/\/\/\/\/\/\/\/7    SDL_Init(SDL_INIT_EVENTTHREAD);\n\n    \/\/-- Init X11 threads\n    XInitThreads();\n}\n\nvoid rd::RdSDLInputManager::inputCallback(SDL_Event *event)\n{\n    RdKey * key = NULL;\n\n    if (event->type == SDL_KEYDOWN )\n    {\n        key = new RdSDLKey(event->key.keysym.sym);\n\n        if ( !(key->isPrintable() || key->isControlKey()) )\n        {\n            delete key;\n            key = NULL;\n            \/\/return false;\n            return;\n        }\n\n        for ( int i = 0; i < (int)listeners.size(); i++)\n            listeners.at(i)->onKeyDown(*key);\n\n    }\n    else if (event->type == SDL_KEYUP )\n    {\n         key = new RdSDLKey(event->key.keysym.sym);\n\n         if ( !(key->isPrintable() || key->isControlKey()) )\n         {\n             delete key;\n             key = NULL;\n             \/\/return false;\n             return;\n         }\n\n        for ( int i = 0; i < (int)listeners.size(); i++)\n            listeners.at(i)->onKeyUp(*key);\n\n    }\n    else\n    {\n\/\/          RD_WARNING(\"Unkown event ocurred! (Event is not supported yet)\\n\");\n        \/\/return false;\n        return;\n    }\n\n    delete key;\n    key = NULL;\n    \/\/return true;*\/\n    return;\n}\n<commit_msg>add SDL_DelEventWatch to RdSDLInputManager::stop()<commit_after>#include \"RdSDLInputManager.hpp\"\n\n\/\/-- Initialize static members\nrd::RdSDLInputManager * rd::RdSDLInputManager::uniqueInstance = NULL;\nconst std::string rd::RdSDLInputManager::id = \"SDL\";\n\nbool rd::RdSDLInputManager::start()\n{  \n    \/\/-- Start input callback\n    SDL_AddEventWatch(staticInputCallback, this);\n\n    stopped = false;\n\n    return true;\n}\n\nbool rd::RdSDLInputManager::stop()\n{\n    \/\/-- Stop input callback\n    SDL_DelEventWatch(staticInputCallback, this);\n\n    stopped = true;\n\n    return true;\n}\n\nbool rd::RdSDLInputManager::isStopped()\n{\n    return stopped;\n}\n\nbool rd::RdSDLInputManager::configure(std::string parameter, std::string value)\n{\n    return RdInputManager::configure(parameter, value);\n}\n\nbool rd::RdSDLInputManager::RegisterManager()\n{\n    if (uniqueInstance == NULL)\n    {\n        uniqueInstance = new RdSDLInputManager();\n    }\n\n    return Register( uniqueInstance, id);\n}\n\nrd::RdSDLInputManager::~RdSDLInputManager()\n{\n    \/\/-- Stop this thread\n    this->stop();\n    uniqueInstance = NULL;\n}\n\nrd::RdSDLInputManager::RdSDLInputManager()\n{\n    stopped = true;\n\n    \/\/-- Init SDL\n    \/\/\/\/\/\/\/\/if (SDL_WasInit( SDL_INIT_EVENTTHREAD) == 0)\n    \/\/\/\/\/\/\/\/\/\/\/\/7    SDL_Init(SDL_INIT_EVENTTHREAD);\n\n    \/\/-- Init X11 threads\n    XInitThreads();\n}\n\nvoid rd::RdSDLInputManager::inputCallback(SDL_Event *event)\n{\n    RdKey * key = NULL;\n\n    if (event->type == SDL_KEYDOWN )\n    {\n        key = new RdSDLKey(event->key.keysym.sym);\n\n        if ( !(key->isPrintable() || key->isControlKey()) )\n        {\n            delete key;\n            key = NULL;\n            \/\/return false;\n            return;\n        }\n\n        for ( int i = 0; i < (int)listeners.size(); i++)\n            listeners.at(i)->onKeyDown(*key);\n\n    }\n    else if (event->type == SDL_KEYUP )\n    {\n         key = new RdSDLKey(event->key.keysym.sym);\n\n         if ( !(key->isPrintable() || key->isControlKey()) )\n         {\n             delete key;\n             key = NULL;\n             \/\/return false;\n             return;\n         }\n\n        for ( int i = 0; i < (int)listeners.size(); i++)\n            listeners.at(i)->onKeyUp(*key);\n\n    }\n    else\n    {\n\/\/          RD_WARNING(\"Unkown event ocurred! (Event is not supported yet)\\n\");\n        \/\/return false;\n        return;\n    }\n\n    delete key;\n    key = NULL;\n    \/\/return true;*\/\n    return;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/                                MFEM Example 20\n\/\/\n\/\/ Compile with: make ex20\n\/\/\n\/\/ Sample runs:  ex20\n\/\/\n\/\/ Description: This example demonstrates the use of the variable order,\n\/\/              symplectic ODE integration algorithm.  Symplectic integration\n\/\/              algorithms are designed to conserve energy when integrating, in\n\/\/              time, systems of ODEs which are derived from Hamiltonian\n\/\/              systems.\n\/\/\n\/\/              Hamiltonian systems define the energy of a system as a function\n\/\/              of time (t), a set of generalized coordinates (q), and their\n\/\/              corresponding generalized momenta (p).\n\/\/\n\/\/                 H(q,p,t) = T(p) + V(q,t)\n\/\/\n\/\/              Hamilton's equations then specify how q and p evolve in time:\n\/\/\n\/\/                 dq\/dt =  dH\/dp\n\/\/                 dp\/dt = -dH\/dq\n\/\/\n\/\/              To use the symplectic integration classes we need to define an\n\/\/              mfem::Operator P which evaluates the action of dH\/dp, and an\n\/\/              mfem::TimeDependentOperator F which computes -dH\/dq.\n\/\/\n\/\/              This example offers five simple 1D Hamiltonians:\n\/\/              0) Simple Harmonic Oscillator (mass on a spring)\n\/\/                 H = ( p^2 \/ m + q^2 \/ k ) \/ 2\n\/\/              1) Pendulum\n\/\/                 H = ( p^2 \/ m - k ( 1 - cos(q) ) ) \/ 2\n\/\/              2) Gaussian Potential Well\n\/\/                 H = ( p^2 \/ m ) \/ 2 - k exp(-q^2 \/ 2)\n\/\/              3) Quartic Potential\n\/\/                 H = ( p^2 \/ m + k ( 1 + q^2 ) q^2 ) \/ 2\n\/\/              4) Negative Quartic Potential\n\/\/                 H = ( p^2 \/ m + k ( 1 - q^2 \/8 ) q^2 ) \/ 2\n\/\/\n\/\/              In all cases these Hamiltonians are shifted by constant values\n\/\/              so that the energy will remain positive. The mean and standard\n\/\/              deviation of the computed energies at each time step are\n\/\/              displayed upon completion.\n\/\/\n\/\/              We then use GLVis to visualize the results in a non-standard way\n\/\/              by defining the axes to be q, p, and t rather than x, y, and z.\n\/\/              In this space we build a ribbon-like mesh with nodes at (0,0,t)\n\/\/              and (q,p,t). Finally we plot the energy as a function of time\n\/\/              as a scalar field on this ribbon-like mesh.\n\/\/\n\/\/              For a more traditional plot of the results, including q, p, and\n\/\/              H, can be obtained by selecting the \"-gp\" option. This creates\n\/\/              a data file and input deck for the GnuPlot application (not\n\/\/              included with MFEM). To visualize these results on most Linux\n\/\/              systems type the command \"gnuplot gnuplot_ex20.inp\". The data\n\/\/              file, named \"ex20.dat\", should be simple enough to display with\n\/\/              other plotting programs as well.\n\n#include \"mfem.hpp\"\n#include <fstream>\n#include <iostream>\n\nusing namespace std;\nusing namespace mfem;\n\n\/\/ Constants used in the Hamiltonian\nstatic int prob_ = 0;\nstatic double m_ = 1.0;\nstatic double k_ = 1.0;\n\n\/\/ Hamiltonian functional, see below for implementation\ndouble hamiltonian(double q, double p, double t);\n\nclass GradT : public Operator\n{\npublic:\n   GradT() : Operator(1) {}\n   void Mult(const Vector &x, Vector &y) const { y.Set(1.0\/m_, x); }\n};\n\nclass NegGradV : public TimeDependentOperator\n{\npublic:\n   NegGradV() : TimeDependentOperator(1) {}\n   void Mult(const Vector &x, Vector &y) const;\n};\n\nint main(int argc, char *argv[])\n{\n   \/\/ 1. Parse command-line options.\n   int order  = 1;\n   int nsteps = 100;\n   double dt  = 0.1;\n   bool visualization = true;\n   bool gnuplot = false;\n\n   OptionsParser args(argc, argv);\n   args.AddOption(&order, \"-o\", \"--order\",\n                  \"Time integration order.\");\n   args.AddOption(&prob_, \"-p\", \"--problem-type\",\n                  \"Problem Type:\\n\"\n                  \"\\t  0 - Simple Harmonic Oscillator\\n\"\n                  \"\\t  1 - Pendulum\\n\"\n                  \"\\t  2 - Gaussian Potential Well\\n\"\n                  \"\\t  3 - Quartic Potential\\n\"\n                  \"\\t  4 - Negative Quartic Potential\");\n   args.AddOption(&nsteps, \"-n\", \"--number-of-steps\",\n                  \"Number of time steps.\");\n   args.AddOption(&dt, \"-dt\", \"--time-step\",\n                  \"Time step size.\");\n   args.AddOption(&m_, \"-m\", \"--mass\",\n                  \"Mass.\");\n   args.AddOption(&k_, \"-k\", \"--spring-const\",\n                  \"Spring constant.\");\n   args.AddOption(&visualization, \"-vis\", \"--visualization\", \"-no-vis\",\n                  \"--no-visualization\",\n                  \"Enable or disable GLVis visualization.\");\n   args.AddOption(&gnuplot, \"-gp\", \"--gnuplot\", \"-no-gp\", \"--no-gnuplot\",\n                  \"Enable or disable GnuPlot visualization.\");\n   args.Parse();\n   if (!args.Good())\n   {\n      args.PrintUsage(cout);\n      return 1;\n   }\n   args.PrintOptions(cout);\n\n   \/\/ 2. Create and Initialize the Symplectic Integration Solver\n   SIAVSolver siaSolver(order);\n   GradT    P;\n   NegGradV F;\n   siaSolver.Init(P,F);\n\n   \/\/ 3. Set the initial conditions\n   double t = 0.0;\n   Vector q(1), p(1);\n   Vector e(nsteps+1);\n   q(0) = 0.0;\n   p(0) = 1.0;\n\n   \/\/ 4. Prepare GnuPlot output file if needed\n   ofstream ofs;\n   if (gnuplot)\n   {\n      ofs.open(\"ex20.dat\");\n      ofs << t << \"\\t\" << q(0) << \"\\t\" << p(0) << endl;\n   }\n\n   \/\/ 5. Create a Mesh for visualization in phase space\n   int nverts = (visualization) ? 2*(nsteps+1) : 0;\n   int nelems = (visualization) ? nsteps : 0;\n   Mesh mesh(2, nverts, nelems, 0, 3);\n\n   int    v[4];\n   Vector x0(3); x0 = 0.0;\n   Vector x1(3); x1 = 0.0;\n\n   \/\/ 6. Perform time-stepping\n   double e_mean = 0.0;\n\n   for (int i = 0; i < nsteps; i++)\n   {\n      \/\/ 6a. Record initial state\n      if (i == 0)\n      {\n         e[0] = hamiltonian(q(0),p(0),t);\n         e_mean += e[0];\n\n         if (visualization)\n         {\n            x1[0] = q(0);\n            x1[1] = p(0);\n            x1[2] = 0.0;\n            mesh.AddVertex(x0);\n            mesh.AddVertex(x1);\n         }\n      }\n\n      \/\/ 6b. Advance the state of the system\n      siaSolver.Step(q,p,t,dt);\n      e[i+1] = hamiltonian(q(0),p(0),t);\n      e_mean += e[i+1];\n\n      \/\/ 6c. Record the state of the system\n      if (gnuplot)\n      {\n         ofs << t << \"\\t\" << q(0) << \"\\t\" << p(0) << \"\\t\" << e[i+1] << endl;\n      }\n\n      \/\/ 6d. Add results to GLVis visualization\n      if (visualization)\n      {\n         x0[2] = t;\n         x1[0] = q(0);\n         x1[1] = p(0);\n         x1[2] = t;\n         mesh.AddVertex(x0);\n         mesh.AddVertex(x1);\n         v[0] = 2*i;\n         v[1] = 2*(i+1);\n         v[2] = 2*(i+1)+1;\n         v[3] = 2*i+1;\n         mesh.AddQuad(v);\n      }\n   }\n\n   \/\/ 7. Compute and display mean and standard deviation of the energy\n   e_mean \/= (nsteps + 1);\n   double e_var = 0.0;\n   for (int i=0; i<=nsteps; i++)\n   {\n      e_var += pow(e[i] - e_mean, 2);\n   }\n   e_var \/= (nsteps + 1);\n   double e_sd = sqrt(e_var);\n   cout << endl << \"Mean and standard deviation of the energy\" << endl;\n   cout << e_mean << \"\\t\" << e_sd << endl;\n\n   \/\/ 8. Finalize the GnuPlot output\n   if (gnuplot)\n   {\n      ofs.close();\n\n      ofs.open(\"gnuplot_ex20.inp\");\n      ofs << \"plot 'ex20.dat' using 1:2 w l t 'q', \"\n          << \"'ex20.dat' using 1:3 w l t 'p', \"\n          << \"'ex20.dat' using 1:4 w l t 'H'\" << endl;\n      ofs.close();\n   }\n\n   \/\/ 9. Finalize the GLVis output\n   if (visualization)\n   {\n      H1_FECollection fec(order = 1, 2);\n      FiniteElementSpace fespace(&mesh, &fec);\n      GridFunction energy(&fespace);\n      energy = 0.0;\n      for (int i = 0; i <= nsteps; i++)\n      {\n         energy[2*i+0] = e[i];\n         energy[2*i+1] = e[i];\n      }\n\n      char vishost[] = \"localhost\";\n      int  visport   = 19916;\n      socketstream sock(vishost, visport);\n      sock.precision(8);\n      sock << \"solution\\n\" << mesh << energy\n           << \"window_title 'Energy in Phase Space'\\n\"\n           << \"keys\\n maac\\n\" << \"axis_labels 'q' 'p' 't'\\n\"<< flush;\n   }\n}\n\ndouble hamiltonian(double q, double p, double t)\n{\n   double h = 1.0 - 0.5 \/ m_ + 0.5 * p * p \/ m_;\n   switch (prob_)\n   {\n      case 1:\n         h += k_ * (1.0 - cos(q));\n         break;\n      case 2:\n         h += k_ * (1.0 - exp(-0.5 * q * q));\n         break;\n      case 3:\n         h += 0.5 * k_ * (1.0 + q * q) * q * q;\n         break;\n      case 4:\n         h += 0.5 * k_ * (1.0 - 0.125 * q * q) * q * q;\n         break;\n      default:\n         h += 0.5 * k_ * q * q;\n         break;\n   }\n   return h;\n}\n\nvoid NegGradV::Mult(const Vector &x, Vector &y) const\n{\n   switch (prob_)\n   {\n      case 1:\n         y(0) = - k_* sin(x(0));\n         break;\n      case 2:\n         y(0) = - k_ * x(0) * exp(-0.5 * x(0) * x(0));\n         break;\n      case 3:\n         y(0) = - k_ * (1.0 + 2.0 * x(0) * x(0)) * x(0);\n         break;\n      case 4:\n         y(0) = - k_ * (1.0 - 0.25 * x(0) * x(0)) * x(0);\n         break;\n      default:\n         y(0) = - k_ * x(0);\n         break;\n   };\n}\n<commit_msg>Initial commit<commit_after>\/\/                                MFEM Example 20\n\/\/\n\/\/ Compile with: make ex20\n\/\/\n\/\/ Sample runs:  ex20\n\/\/\n\/\/ Description: This example demonstrates the use of the variable order,\n\/\/              symplectic ODE integration algorithm.  Symplectic integration\n\/\/              algorithms are designed to conserve energy when integrating, in\n\/\/              time, systems of ODEs which are derived from Hamiltonian\n\/\/              systems.\n\/\/\n\/\/              Hamiltonian systems define the energy of a system as a function\n\/\/              of time (t), a set of generalized coordinates (q), and their\n\/\/              corresponding generalized momenta (p).\n\/\/\n\/\/                 H(q,p,t) = T(p) + V(q,t)\n\/\/\n\/\/              Hamilton's equations then specify how q and p evolve in time:\n\/\/\n\/\/                 dq\/dt =  dH\/dp\n\/\/                 dp\/dt = -dH\/dq\n\/\/\n\/\/              To use the symplectic integration classes we need to define an\n\/\/              mfem::Operator P which evaluates the action of dH\/dp, and an\n\/\/              mfem::TimeDependentOperator F which computes -dH\/dq.\n\/\/\n\/\/              This example offers five simple 1D Hamiltonians:\n\/\/              0) Simple Harmonic Oscillator (mass on a spring)\n\/\/                 H = ( p^2 \/ m + q^2 \/ k ) \/ 2\n\/\/              1) Pendulum\n\/\/                 H = ( p^2 \/ m - k ( 1 - cos(q) ) ) \/ 2\n\/\/              2) Gaussian Potential Well\n\/\/                 H = ( p^2 \/ m ) \/ 2 - k exp(-q^2 \/ 2)\n\/\/              3) Quartic Potential\n\/\/                 H = ( p^2 \/ m + k ( 1 + q^2 ) q^2 ) \/ 2\n\/\/              4) Negative Quartic Potential\n\/\/                 H = ( p^2 \/ m + k ( 1 - q^2 \/8 ) q^2 ) \/ 2\n\/\/\n\/\/              In all cases these Hamiltonians are shifted by constant values\n\/\/              so that the energy will remain positive. The mean and standard\n\/\/              deviation of the computed energies at each time step are\n\/\/              displayed upon completion.\n\/\/\n\/\/              We then use GLVis to visualize the results in a non-standard way\n\/\/              by defining the axes to be q, p, and t rather than x, y, and z.\n\/\/              In this space we build a ribbon-like mesh with nodes at (0,0,t)\n\/\/              and (q,p,t). Finally we plot the energy as a function of time\n\/\/              as a scalar field on this ribbon-like mesh.\n\/\/\n\/\/              For a more traditional plot of the results, including q, p, and\n\/\/              H, can be obtained by selecting the \"-gp\" option. This creates\n\/\/              a data file and input deck for the GnuPlot application (not\n\/\/              included with MFEM). To visualize these results on most Linux\n\/\/              systems type the command \"gnuplot gnuplot_ex20.inp\". The data\n\/\/              file, named \"ex20.dat\", should be simple enough to display with\n\/\/              other plotting programs as well.\n\n#include \"mfem.hpp\"\n#include <fstream>\n#include <iostream>\n\nusing namespace std;\nusing namespace mfem;\n\n\/\/ Constants used in the Hamiltonian\nstatic int prob_ = 0;\nstatic double m_ = 1.0;\nstatic double k_ = 1.0;\n\n\/\/ Hamiltonian functional, see below for implementation\ndouble hamiltonian(double q, double p, double t);\n\nclass GradT : public Operator\n{\npublic:\n   GradT() : Operator(1) {}\n   void Mult(const Vector &x, Vector &y) const { y.Set(1.0\/m_, x); }\n};\n\nclass NegGradV : public TimeDependentOperator\n{\npublic:\n   NegGradV() : TimeDependentOperator(1) {}\n   void Mult(const Vector &x, Vector &y) const;\n};\n\nint main(int argc, char *argv[])\n{\n   \/\/ 1. Parse command-line options.\n   int order  = 1;\n   int nsteps = 100;\n   double dt  = 0.1;\n   bool visualization = true;\n   bool gnuplot = false;\n\n   OptionsParser args(argc, argv);\n   args.AddOption(&order, \"-o\", \"--order\",\n                  \"Time integration order.\");\n   args.AddOption(&prob_, \"-p\", \"--problem-type\",\n                  \"Problem Type:\\n\"\n                  \"\\t  0 - Simple Harmonic Oscillator\\n\"\n                  \"\\t  1 - Pendulum\\n\"\n                  \"\\t  2 - Gaussian Potential Well\\n\"\n                  \"\\t  3 - Quartic Potential\\n\"\n                  \"\\t  4 - Negative Quartic Potential\");\n   args.AddOption(&nsteps, \"-n\", \"--number-of-steps\",\n                  \"Number of time steps.\");\n   args.AddOption(&dt, \"-dt\", \"--time-step\",\n                  \"Time step size.\");\n   args.AddOption(&m_, \"-m\", \"--mass\",\n                  \"Mass.\");\n   args.AddOption(&k_, \"-k\", \"--spring-const\",\n                  \"Spring constant.\");\n   args.AddOption(&visualization, \"-vis\", \"--visualization\", \"-no-vis\",\n                  \"--no-visualization\",\n                  \"Enable or disable GLVis visualization.\");\n   args.AddOption(&gnuplot, \"-gp\", \"--gnuplot\", \"-no-gp\", \"--no-gnuplot\",\n                  \"Enable or disable GnuPlot visualization.\");\n   args.Parse();\n   if (!args.Good())\n   {\n      args.PrintUsage(cout);\n      return 1;\n   }\n   args.PrintOptions(cout);\n\n   \/\/ 2. Create and Initialize the Symplectic Integration Solver\n   SIAVSolver siaSolver(order);\n   GradT    P;\n   NegGradV F;\n   siaSolver.Init(P,F);\n\n   \/\/ 3. Set the initial conditions\n   double t = 0.0;\n   Vector q(1), p(1);\n   Vector e(nsteps+1);\n   q(0) = 0.0;\n   p(0) = 1.0;\n\n   \/\/ 4. Prepare GnuPlot output file if needed\n   ofstream ofs;\n   if (gnuplot)\n   {\n      ofs.open(\"ex20.dat\");\n      ofs << t << \"\\t\" << q(0) << \"\\t\" << p(0) << endl;\n   }\n\n   \/\/ 5. Create a Mesh for visualization in phase space\n   int nverts = (visualization) ? 2*(nsteps+1) : 0;\n   int nelems = (visualization) ? nsteps : 0;\n   Mesh mesh(2, nverts, nelems, 0, 3);\n\n   int    v[4];\n   Vector x0(3); x0 = 0.0;\n   Vector x1(3); x1 = 0.0;\n\n   \/\/ 6. Perform time-stepping\n   double e_mean = 0.0;\n\n   for (int i = 0; i < nsteps; i++)\n   {\n      \/\/ 6a. Record initial state\n      if (i == 0)\n      {\n         e[0] = hamiltonian(q(0),p(0),t);\n         e_mean += e[0];\n\n         if (visualization)\n         {\n            x1[0] = q(0);\n            x1[1] = p(0);\n            x1[2] = 0.0;\n            mesh.AddVertex(x0);\n            mesh.AddVertex(x1);\n         }\n      }\n\n      \/\/ 6b. Advance the state of the system\n      siaSolver.Step(q,p,t,dt);\n      e[i+1] = hamiltonian(q(0),p(0),t);\n      e_mean += e[i+1];\n\n      \/\/ 6c. Record the state of the system\n      if (gnuplot)\n      {\n         ofs << t << \"\\t\" << q(0) << \"\\t\" << p(0) << \"\\t\" << e[i+1] << endl;\n      }\n\n      \/\/ 6d. Add results to GLVis visualization\n      if (visualization)\n      {\n         x0[2] = t;\n         x1[0] = q(0);\n         x1[1] = p(0);\n         x1[2] = t;\n         mesh.AddVertex(x0);\n         mesh.AddVertex(x1);\n         v[0] = 2*i;\n         v[1] = 2*(i+1);\n         v[2] = 2*(i+1)+1;\n         v[3] = 2*i+1;\n         mesh.AddQuad(v);\n      }\n   }\n\n   \/\/ 7. Compute and display mean and standard deviation of the energy\n   e_mean \/= (nsteps + 1);\n   double e_var = 0.0;\n   for (int i=0; i<=nsteps; i++)\n   {\n      e_var += pow(e[i] - e_mean, 2);\n   }\n   e_var \/= (nsteps + 1);\n   double e_sd = sqrt(e_var);\n   cout << endl << \"Mean and standard deviation of the energy\" << endl;\n   cout << e_mean << \"\\t\" << e_sd << endl;\n\n   \/\/ 8. Finalize the GnuPlot output\n   if (gnuplot)\n   {\n      ofs.close();\n\n      ofs.open(\"gnuplot_ex20.inp\");\n      ofs << \"plot 'ex20.dat' using 1:2 w l t 'q', \"\n          << \"'ex20.dat' using 1:3 w l t 'p', \"\n          << \"'ex20.dat' using 1:4 w l t 'H'\" << endl;\n      ofs.close();\n   }\n\n   \/\/ 9. Finalize the GLVis output\n   if (visualization)\n   {\n      mesh.FinalizeQuadMesh(1);\n      H1_FECollection fec(order = 1, 2);\n      FiniteElementSpace fespace(&mesh, &fec);\n      GridFunction energy(&fespace);\n      energy = 0.0;\n      for (int i = 0; i <= nsteps; i++)\n      {\n         energy[2*i+0] = e[i];\n         energy[2*i+1] = e[i];\n      }\n\n      char vishost[] = \"localhost\";\n      int  visport   = 19916;\n      socketstream sock(vishost, visport);\n      sock.precision(8);\n      sock << \"solution\\n\" << mesh << energy\n           << \"window_title 'Energy in Phase Space'\\n\"\n           << \"keys\\n maac\\n\" << \"axis_labels 'q' 'p' 't'\\n\"<< flush;\n   }\n}\n\ndouble hamiltonian(double q, double p, double t)\n{\n   double h = 1.0 - 0.5 \/ m_ + 0.5 * p * p \/ m_;\n   switch (prob_)\n   {\n      case 1:\n         h += k_ * (1.0 - cos(q));\n         break;\n      case 2:\n         h += k_ * (1.0 - exp(-0.5 * q * q));\n         break;\n      case 3:\n         h += 0.5 * k_ * (1.0 + q * q) * q * q;\n         break;\n      case 4:\n         h += 0.5 * k_ * (1.0 - 0.125 * q * q) * q * q;\n         break;\n      default:\n         h += 0.5 * k_ * q * q;\n         break;\n   }\n   return h;\n}\n\nvoid NegGradV::Mult(const Vector &x, Vector &y) const\n{\n   switch (prob_)\n   {\n      case 1:\n         y(0) = - k_* sin(x(0));\n         break;\n      case 2:\n         y(0) = - k_ * x(0) * exp(-0.5 * x(0) * x(0));\n         break;\n      case 3:\n         y(0) = - k_ * (1.0 + 2.0 * x(0) * x(0)) * x(0);\n         break;\n      case 4:\n         y(0) = - k_ * (1.0 - 0.25 * x(0) * x(0)) * x(0);\n         break;\n      default:\n         y(0) = - k_ * x(0);\n         break;\n   };\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright 2016 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#include \"tensorflow\/core\/distributed_runtime\/simple_graph_execution_state.h\"\n\n#include <memory>\n#include <string>\n#include <unordered_set>\n#include <vector>\n\n#include \"tensorflow\/core\/common_runtime\/device.h\"\n#include \"tensorflow\/core\/common_runtime\/simple_placer.h\"\n#include \"tensorflow\/core\/distributed_runtime\/process_util.h\"\n#include \"tensorflow\/core\/framework\/graph_def_util.h\"\n#include \"tensorflow\/core\/graph\/costmodel.h\"\n#include \"tensorflow\/core\/graph\/dot.h\"\n#include \"tensorflow\/core\/graph\/graph.h\"\n#include \"tensorflow\/core\/graph\/graph_constructor.h\"\n#include \"tensorflow\/core\/graph\/subgraph.h\"\n#include \"tensorflow\/core\/lib\/core\/errors.h\"\n#include \"tensorflow\/core\/lib\/core\/status.h\"\n#include \"tensorflow\/core\/lib\/strings\/stringprintf.h\"\n#include \"tensorflow\/core\/platform\/logging.h\"\n#include \"tensorflow\/core\/platform\/mutex.h\"\n#include \"tensorflow\/core\/platform\/types.h\"\n#include \"tensorflow\/core\/protobuf\/worker.pb.h\"\n#include \"tensorflow\/core\/util\/util.h\"\n\nnamespace tensorflow {\n\nstring BuildGraphOptions::DebugString() const {\n  string rv = \"Feed endpoints: \";\n  for (auto& s : feed_endpoints) {\n    strings::StrAppend(&rv, s, \", \");\n  }\n  strings::StrAppend(&rv, \"\\nFetch endpoints: \");\n  for (auto& s : fetch_endpoints) {\n    strings::StrAppend(&rv, s, \", \");\n  }\n  strings::StrAppend(&rv, \"\\nTarget nodes: \");\n  for (auto& s : target_nodes) {\n    strings::StrAppend(&rv, s, \", \");\n  }\n  return rv;\n}\n\nSimpleGraphExecutionState::SimpleGraphExecutionState(\n    const OpRegistryInterface* ops,\n    const SimpleGraphExecutionStateOptions& options)\n    : ops_(ops),\n      device_set_(options.device_set),\n      session_options_(options.session_options),\n      base_(nullptr),\n      placed_(nullptr) {\n  \/\/ TODO(mrry): Publish placement visualizations or handle the log\n  \/\/ placement option.\n}\n\nSimpleGraphExecutionState::~SimpleGraphExecutionState() {\n  mutex_lock l(mu_);\n  delete base_;\n  delete placed_;\n}\n\nStatus SimpleGraphExecutionState::Create(GraphDef* graph_def) {\n  if (original_graph_def_.node_size() > 0) {\n    return errors::InvalidArgument(\n        \"Cannot call Create on SimpleGraphExecutionState twice\");\n  }\n\n  original_graph_def_.Swap(graph_def);\n  VLOG(2) << \"Incoming def: \" << original_graph_def_.DebugString();\n  return AddDefaultAttrsToGraphDef(&original_graph_def_, *ops_, 0);\n}\n\nStatus SimpleGraphExecutionState::Extend(\n    const GraphDef& extension_def, SimpleGraphExecutionState** out) const {\n  std::unordered_set<string> new_names;\n  \/\/ 1. Build an index of the new node names.\n  for (const NodeDef& node : extension_def.node()) {\n    new_names.insert(node.name());\n  }\n\n  \/\/ 2. Add the non-duplicates from the old graph to the new graph.\n  \/\/    Return an error if the same node name appears in both the\n  \/\/    old graph and the extension.\n  GraphDef gdef;\n  for (const NodeDef& node : original_graph_def_.node()) {\n    if (new_names.count(node.name()) == 0) {\n      *gdef.add_node() = node;\n    } else {\n      return errors::InvalidArgument(tensorflow::strings::Printf(\n          \"GraphDef argument to Extend includes node '%s', which was created \"\n          \"by a previous call to Create or Extend in this session.\",\n          node.name().c_str()));\n    }\n  }\n\n  int old_node_size = gdef.node_size();\n  gdef.mutable_node()->MergeFrom(extension_def.node());\n  TF_RETURN_IF_ERROR(AddDefaultAttrsToGraphDef(&gdef, *ops_, old_node_size));\n\n  \/\/ 3. Add the extension.\n  SimpleGraphExecutionStateOptions combined_options;\n  combined_options.device_set = device_set_;\n\n  SimpleGraphExecutionState* new_execution_state =\n      new SimpleGraphExecutionState(ops_, combined_options);\n  Status new_execution_state_status = new_execution_state->Create(&gdef);\n  if (!new_execution_state_status.ok()) {\n    delete new_execution_state;\n    return new_execution_state_status;\n  }\n  *out = new_execution_state;\n\n  \/\/ Ensure that any state created in the precursor is accessible in the\n  \/\/ new graph.\n  {\n    mutex_lock l(mu_);\n    for (const auto& placement : stateful_placements_) {\n      (*out)->stateful_placements_.insert(placement);\n    }\n  }\n\n  \/\/ TODO(mrry): This is likely to be used for non-throughput-sensitive\n  \/\/ interactive workloads, but in future we may want to transfer other\n  \/\/ parts of the placement and\/or cost model.\n  return Status::OK();\n}\n\nStatus SimpleGraphExecutionState::InitBaseGraph() {\n  std::unique_ptr<Graph> new_base(new Graph(ops_));\n  GraphConstructorOptions opts;\n  TF_RETURN_IF_ERROR(\n      ConvertGraphDefToGraph(opts, original_graph_def_, new_base.get()));\n  for (const Node* n : new_base->nodes()) {\n    VLOG(2) << \"Mapping \" << n->name() << \" to \" << n->cost_id();\n    node_name_to_cost_id_map_[n->name()] = n->cost_id();\n  }\n\n  Status status = PreliminaryPlace(*new_base);\n  if (!status.ok()) {\n    node_name_to_cost_id_map_.clear();\n    return status;\n  }\n  base_ = new_base.release();\n  return Status::OK();\n}\n\nStatus SimpleGraphExecutionState::GlobalNodeDefByName(const string& name,\n                                                      NodeDef* out) {\n  NodeNameToCostIdMap::const_iterator iter =\n      node_name_to_cost_id_map_.find(name);\n  if (iter != node_name_to_cost_id_map_.end()) {\n    mutex_lock l(mu_);  \/\/ could use reader lock\n    const Node* node = placed_->FindNodeId(iter->second);\n    if (node) {\n      *out = node->def();\n      return Status::OK();\n    }\n  }\n  return errors::NotFound(\"Node name: \", name);\n}\n\nStatus SimpleGraphExecutionState::PreliminaryPlace(const Graph& base) {\n  VLOG(1) << \"PreliminaryPlace\";\n  Graph* ng = new Graph(ops_);\n\n  CopyGraph(base, ng);\n  Status status = DoPlace(ng);\n  if (!status.ok()) {\n    delete ng;\n  } else {\n    delete placed_;\n    placed_ = ng;\n    FreezeStatefulNodes(true \/*is_prelim*\/);\n  }\n  return status;\n}\n\nvoid SimpleGraphExecutionState::FreezeStatefulNodes(bool is_prelim) {\n  if (is_prelim) {\n    \/\/ During the preliminary placement every stateful Node got placed\n    \/\/ somewhere, and we need to remember where, so it doesn't move.\n    for (Node* n : placed_->nodes()) {\n      if (n->op_def().is_stateful()) {\n        stateful_placements_[n->name()] = n->assigned_device_name();\n      }\n    }\n  } else {\n    \/\/ During later placements it's possible for new stateful nodes to\n    \/\/ appear. They are noticed while we're pinning the pre-existing\n    \/\/ stateful nodes to their prior positions, and after they've been\n    \/\/ placed this function is entered to record their placements.\n    for (Node* n : missing_stateful_placements_) {\n      CHECK(n->op_def().is_stateful());\n      stateful_placements_[n->name()] = n->assigned_device_name();\n    }\n    missing_stateful_placements_.clear();\n  }\n}\n\nvoid SimpleGraphExecutionState::PlaceStatefulNodes(Graph* graph) {\n  for (Node* n : graph->nodes()) {\n    if (n->op_def().is_stateful()) {\n      PlaceMap::const_iterator iter = stateful_placements_.find(n->name());\n      if (iter == stateful_placements_.end()) {\n        \/\/ NOTE(tucker): I don't understand why this can occur.  So far,\n        \/\/ I've only seen it in eval instances, started from a checkpoint.\n        missing_stateful_placements_.push_back(n);\n      } else {\n        n->set_assigned_device_name(iter->second);\n      }\n    }\n  }\n}\n\nStatus SimpleGraphExecutionState::DoPlace(Graph* graph) {\n  Status status;\n  \/\/ TODO(mrry): Port other placement algorithms from whitepaper.\n  return SimplePlacement(graph);\n}\n\nStatus SimpleGraphExecutionState::BuildGraph(const BuildGraphOptions& options,\n                                             ClientGraph** out) {\n  VLOG(1) << \"BuildGraph\";\n  mutex_lock l(mu_);\n  \/\/ Lazily initialize the base graph.\n  if (base_ == nullptr) {\n    TF_RETURN_IF_ERROR(InitBaseGraph());\n  }\n\n  if (!base_ || !placed_) {\n    return ::tensorflow::errors::Internal(\n        \"There was a problem building the graph.\");\n  }\n\n  std::unique_ptr<ClientGraph> cgraph(new ClientGraph(ops_));\n  CopyGraph(*placed_, &cgraph->graph);\n\n  \/\/ Extract the subset of the graph that needs to be run, adding feed\/fetch\n  \/\/ ops as needed.\n  TF_RETURN_IF_ERROR(subgraph::RewriteGraphForExecution(\n      &cgraph->graph, options.feed_endpoints, options.fetch_endpoints,\n      options.target_nodes, device_set_->client_device()->attributes()));\n\n  \/\/ Copy the extracted graph in order to make its node ids dense,\n  \/\/ since the local CostModel used to record its stats is sized by\n  \/\/ the largest node id.\n  {\n    std::unique_ptr<ClientGraph> dense_copy(new ClientGraph(ops_));\n    CopyGraph(cgraph->graph, &dense_copy->graph);\n    cgraph = std::move(dense_copy);\n  }\n\n  \/\/ TODO(vrv): We should check invariants of the graph here.\n\n  *out = cgraph.release();\n\n  return Status::OK();\n}\n\nStatus SimpleGraphExecutionState::DeviceIsCompatible(\n    Node* n, const Device* device) const {\n  if (!n->def().device().empty()) {\n    DeviceNameUtils::ParsedName pname;\n    if (!DeviceNameUtils::ParseFullName(n->def().device(), &pname)) {\n      return AttachDef(\n          errors::InvalidArgument(\"Malformed device specification '\",\n                                  n->def().device(), \"'\"),\n          n->def());\n    }\n    std::vector<Device*> devices;\n    device_set_->FindMatchingDevices(pname, &devices);\n    for (auto d : devices) {\n      if (d == device) {\n        return Status::OK();\n      }\n    }\n\n    return AttachDef(\n        errors::InvalidArgument(\n            \"Specified device '\", n->def().device(),\n            \"' not compatible with device of ref connection: \", device->name()),\n        n->def());\n  }\n  return Status::OK();\n}\n\nStatus SimpleGraphExecutionState::SimplePlacement(Graph* graph) {\n  SimplePlacer placer(graph, device_set_, &node_name_to_cost_id_map_,\n                      session_options_);\n  \/\/ TODO(mrry): Consider making the SimplePlacer cancelable.\n  return placer.Run();\n}\n\n}  \/\/ namespace tensorflow\n<commit_msg>TensorFlow: fix duplicate definition of BuildGraphOptions, fixes bug on mac build. Change: 116165342<commit_after>\/* Copyright 2016 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#include \"tensorflow\/core\/distributed_runtime\/simple_graph_execution_state.h\"\n\n#include <memory>\n#include <string>\n#include <unordered_set>\n#include <vector>\n\n#include \"tensorflow\/core\/common_runtime\/device.h\"\n#include \"tensorflow\/core\/common_runtime\/simple_placer.h\"\n#include \"tensorflow\/core\/distributed_runtime\/process_util.h\"\n#include \"tensorflow\/core\/framework\/graph_def_util.h\"\n#include \"tensorflow\/core\/graph\/costmodel.h\"\n#include \"tensorflow\/core\/graph\/dot.h\"\n#include \"tensorflow\/core\/graph\/graph.h\"\n#include \"tensorflow\/core\/graph\/graph_constructor.h\"\n#include \"tensorflow\/core\/graph\/subgraph.h\"\n#include \"tensorflow\/core\/lib\/core\/errors.h\"\n#include \"tensorflow\/core\/lib\/core\/status.h\"\n#include \"tensorflow\/core\/lib\/strings\/stringprintf.h\"\n#include \"tensorflow\/core\/platform\/logging.h\"\n#include \"tensorflow\/core\/platform\/mutex.h\"\n#include \"tensorflow\/core\/platform\/types.h\"\n#include \"tensorflow\/core\/protobuf\/worker.pb.h\"\n#include \"tensorflow\/core\/util\/util.h\"\n\nnamespace tensorflow {\n\nSimpleGraphExecutionState::SimpleGraphExecutionState(\n    const OpRegistryInterface* ops,\n    const SimpleGraphExecutionStateOptions& options)\n    : ops_(ops),\n      device_set_(options.device_set),\n      session_options_(options.session_options),\n      base_(nullptr),\n      placed_(nullptr) {\n  \/\/ TODO(mrry): Publish placement visualizations or handle the log\n  \/\/ placement option.\n}\n\nSimpleGraphExecutionState::~SimpleGraphExecutionState() {\n  mutex_lock l(mu_);\n  delete base_;\n  delete placed_;\n}\n\nStatus SimpleGraphExecutionState::Create(GraphDef* graph_def) {\n  if (original_graph_def_.node_size() > 0) {\n    return errors::InvalidArgument(\n        \"Cannot call Create on SimpleGraphExecutionState twice\");\n  }\n\n  original_graph_def_.Swap(graph_def);\n  VLOG(2) << \"Incoming def: \" << original_graph_def_.DebugString();\n  return AddDefaultAttrsToGraphDef(&original_graph_def_, *ops_, 0);\n}\n\nStatus SimpleGraphExecutionState::Extend(\n    const GraphDef& extension_def, SimpleGraphExecutionState** out) const {\n  std::unordered_set<string> new_names;\n  \/\/ 1. Build an index of the new node names.\n  for (const NodeDef& node : extension_def.node()) {\n    new_names.insert(node.name());\n  }\n\n  \/\/ 2. Add the non-duplicates from the old graph to the new graph.\n  \/\/    Return an error if the same node name appears in both the\n  \/\/    old graph and the extension.\n  GraphDef gdef;\n  for (const NodeDef& node : original_graph_def_.node()) {\n    if (new_names.count(node.name()) == 0) {\n      *gdef.add_node() = node;\n    } else {\n      return errors::InvalidArgument(tensorflow::strings::Printf(\n          \"GraphDef argument to Extend includes node '%s', which was created \"\n          \"by a previous call to Create or Extend in this session.\",\n          node.name().c_str()));\n    }\n  }\n\n  int old_node_size = gdef.node_size();\n  gdef.mutable_node()->MergeFrom(extension_def.node());\n  TF_RETURN_IF_ERROR(AddDefaultAttrsToGraphDef(&gdef, *ops_, old_node_size));\n\n  \/\/ 3. Add the extension.\n  SimpleGraphExecutionStateOptions combined_options;\n  combined_options.device_set = device_set_;\n\n  SimpleGraphExecutionState* new_execution_state =\n      new SimpleGraphExecutionState(ops_, combined_options);\n  Status new_execution_state_status = new_execution_state->Create(&gdef);\n  if (!new_execution_state_status.ok()) {\n    delete new_execution_state;\n    return new_execution_state_status;\n  }\n  *out = new_execution_state;\n\n  \/\/ Ensure that any state created in the precursor is accessible in the\n  \/\/ new graph.\n  {\n    mutex_lock l(mu_);\n    for (const auto& placement : stateful_placements_) {\n      (*out)->stateful_placements_.insert(placement);\n    }\n  }\n\n  \/\/ TODO(mrry): This is likely to be used for non-throughput-sensitive\n  \/\/ interactive workloads, but in future we may want to transfer other\n  \/\/ parts of the placement and\/or cost model.\n  return Status::OK();\n}\n\nStatus SimpleGraphExecutionState::InitBaseGraph() {\n  std::unique_ptr<Graph> new_base(new Graph(ops_));\n  GraphConstructorOptions opts;\n  TF_RETURN_IF_ERROR(\n      ConvertGraphDefToGraph(opts, original_graph_def_, new_base.get()));\n  for (const Node* n : new_base->nodes()) {\n    VLOG(2) << \"Mapping \" << n->name() << \" to \" << n->cost_id();\n    node_name_to_cost_id_map_[n->name()] = n->cost_id();\n  }\n\n  Status status = PreliminaryPlace(*new_base);\n  if (!status.ok()) {\n    node_name_to_cost_id_map_.clear();\n    return status;\n  }\n  base_ = new_base.release();\n  return Status::OK();\n}\n\nStatus SimpleGraphExecutionState::GlobalNodeDefByName(const string& name,\n                                                      NodeDef* out) {\n  NodeNameToCostIdMap::const_iterator iter =\n      node_name_to_cost_id_map_.find(name);\n  if (iter != node_name_to_cost_id_map_.end()) {\n    mutex_lock l(mu_);  \/\/ could use reader lock\n    const Node* node = placed_->FindNodeId(iter->second);\n    if (node) {\n      *out = node->def();\n      return Status::OK();\n    }\n  }\n  return errors::NotFound(\"Node name: \", name);\n}\n\nStatus SimpleGraphExecutionState::PreliminaryPlace(const Graph& base) {\n  VLOG(1) << \"PreliminaryPlace\";\n  Graph* ng = new Graph(ops_);\n\n  CopyGraph(base, ng);\n  Status status = DoPlace(ng);\n  if (!status.ok()) {\n    delete ng;\n  } else {\n    delete placed_;\n    placed_ = ng;\n    FreezeStatefulNodes(true \/*is_prelim*\/);\n  }\n  return status;\n}\n\nvoid SimpleGraphExecutionState::FreezeStatefulNodes(bool is_prelim) {\n  if (is_prelim) {\n    \/\/ During the preliminary placement every stateful Node got placed\n    \/\/ somewhere, and we need to remember where, so it doesn't move.\n    for (Node* n : placed_->nodes()) {\n      if (n->op_def().is_stateful()) {\n        stateful_placements_[n->name()] = n->assigned_device_name();\n      }\n    }\n  } else {\n    \/\/ During later placements it's possible for new stateful nodes to\n    \/\/ appear. They are noticed while we're pinning the pre-existing\n    \/\/ stateful nodes to their prior positions, and after they've been\n    \/\/ placed this function is entered to record their placements.\n    for (Node* n : missing_stateful_placements_) {\n      CHECK(n->op_def().is_stateful());\n      stateful_placements_[n->name()] = n->assigned_device_name();\n    }\n    missing_stateful_placements_.clear();\n  }\n}\n\nvoid SimpleGraphExecutionState::PlaceStatefulNodes(Graph* graph) {\n  for (Node* n : graph->nodes()) {\n    if (n->op_def().is_stateful()) {\n      PlaceMap::const_iterator iter = stateful_placements_.find(n->name());\n      if (iter == stateful_placements_.end()) {\n        \/\/ NOTE(tucker): I don't understand why this can occur.  So far,\n        \/\/ I've only seen it in eval instances, started from a checkpoint.\n        missing_stateful_placements_.push_back(n);\n      } else {\n        n->set_assigned_device_name(iter->second);\n      }\n    }\n  }\n}\n\nStatus SimpleGraphExecutionState::DoPlace(Graph* graph) {\n  Status status;\n  \/\/ TODO(mrry): Port other placement algorithms from whitepaper.\n  return SimplePlacement(graph);\n}\n\nStatus SimpleGraphExecutionState::BuildGraph(const BuildGraphOptions& options,\n                                             ClientGraph** out) {\n  VLOG(1) << \"BuildGraph\";\n  mutex_lock l(mu_);\n  \/\/ Lazily initialize the base graph.\n  if (base_ == nullptr) {\n    TF_RETURN_IF_ERROR(InitBaseGraph());\n  }\n\n  if (!base_ || !placed_) {\n    return ::tensorflow::errors::Internal(\n        \"There was a problem building the graph.\");\n  }\n\n  std::unique_ptr<ClientGraph> cgraph(new ClientGraph(ops_));\n  CopyGraph(*placed_, &cgraph->graph);\n\n  \/\/ Extract the subset of the graph that needs to be run, adding feed\/fetch\n  \/\/ ops as needed.\n  TF_RETURN_IF_ERROR(subgraph::RewriteGraphForExecution(\n      &cgraph->graph, options.feed_endpoints, options.fetch_endpoints,\n      options.target_nodes, device_set_->client_device()->attributes()));\n\n  \/\/ Copy the extracted graph in order to make its node ids dense,\n  \/\/ since the local CostModel used to record its stats is sized by\n  \/\/ the largest node id.\n  {\n    std::unique_ptr<ClientGraph> dense_copy(new ClientGraph(ops_));\n    CopyGraph(cgraph->graph, &dense_copy->graph);\n    cgraph = std::move(dense_copy);\n  }\n\n  \/\/ TODO(vrv): We should check invariants of the graph here.\n\n  *out = cgraph.release();\n\n  return Status::OK();\n}\n\nStatus SimpleGraphExecutionState::DeviceIsCompatible(\n    Node* n, const Device* device) const {\n  if (!n->def().device().empty()) {\n    DeviceNameUtils::ParsedName pname;\n    if (!DeviceNameUtils::ParseFullName(n->def().device(), &pname)) {\n      return AttachDef(\n          errors::InvalidArgument(\"Malformed device specification '\",\n                                  n->def().device(), \"'\"),\n          n->def());\n    }\n    std::vector<Device*> devices;\n    device_set_->FindMatchingDevices(pname, &devices);\n    for (auto d : devices) {\n      if (d == device) {\n        return Status::OK();\n      }\n    }\n\n    return AttachDef(\n        errors::InvalidArgument(\n            \"Specified device '\", n->def().device(),\n            \"' not compatible with device of ref connection: \", device->name()),\n        n->def());\n  }\n  return Status::OK();\n}\n\nStatus SimpleGraphExecutionState::SimplePlacement(Graph* graph) {\n  SimplePlacer placer(graph, device_set_, &node_name_to_cost_id_map_,\n                      session_options_);\n  \/\/ TODO(mrry): Consider making the SimplePlacer cancelable.\n  return placer.Run();\n}\n\n}  \/\/ namespace tensorflow\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2016, Andrej Kislovskij\n *\n * This is PUBLIC DOMAIN software so use at your own risk as it comes\n * with no warranties. This code is yours to share, use and modify without\n * any restrictions or obligations.\n *\n * For more information see conwrap\/LICENSE or refer refer to http:\/\/unlicense.org\n *\n * Author: gimesketvirtadieni at gmail dot com (Andrej Kislovskij)\n *\/\n\n#include <asio.hpp>\n#include <chrono>\n#include <conwrap\/ProcessorAsio.hpp>\n#include <conwrap\/ProcessorQueue.hpp>\n#include <functional>\n#include <iostream>\n\n\nstruct Dummy\n{\n\t\/\/ TODO: this is a temporary fix before reflection is implemented\n\tvoid setProcessor(conwrap::Processor<Dummy>*) {}\n};\n\n\nclass Server\n{\n\tpublic:\n\t\tServer(short p) : port(p) {}\n\n\t\tvoid close()\n\t\t{\n\t\t\t\/\/ closing acceptor\n\t\t\tacceptorPtr->close();\n\n\t\t\t\/\/ closing socket\n\t\t\tif (socketPtr->is_open())\n\t\t\t{\n\t\t\t\ttry {\n\t\t\t\t\tsocketPtr->shutdown(asio::socket_base::shutdown_both);\n\t\t\t\t} catch (...) {}\n\t\t\t\ttry {\n\t\t\t\t\tsocketPtr->close();\n\t\t\t\t} catch (...) {}\n\t\t\t}\n\t\t}\n\n\t\tvoid ping()\n\t\t{\n\t\t\tif (socketPtr->is_open())\n\t\t\t{\n\t\t\t\tsocketPtr->send(asio::buffer(\"ping\\n\\r\"));\n\t\t\t}\n\t\t}\n\n\t\tvoid setProcessor(conwrap::ProcessorAsio<Server>* p)\n\t\t{\n\t\t\tprocessorPtr = p;\n\n\t\t\t\/\/ creating an acceptor\n\t\t\tacceptorPtr = std::make_unique<asio::ip::tcp::acceptor>(\n\t\t\t\t*processorPtr->getDispatcher(),\n\t\t\t\tasio::ip::tcp::endpoint(\n\t\t\t\t\tasio::ip::tcp::v4(),\n\t\t\t\t\tport\n\t\t\t\t)\n\t\t\t);\n\n\t\t\t\/\/ creating a socket\n\t\t\tsocketPtr = std::make_unique<asio::ip::tcp::socket>(\n\t\t\t\t*processorPtr->getDispatcher()\n\t\t\t);\n\n\t\t\tacceptorPtr->async_accept(\n\t\t\t\t*socketPtr,\n\t\t\t\t[=](const std::error_code error)\n\t\t\t\t{\n\t\t\t\t\t\/\/ wrapping is needed to pass handler from asio's thread to the processor's thread\n\t\t\t\t\tprocessorPtr->wrapHandler([=]\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ start receiving data\n\t\t\t\t\t\tonData(error, 0);\n\t\t\t\t\t})();\n\t\t\t\t}\n\t\t\t);\n\t\t}\n\n\t\t\/\/ TODO: this is a temporary fix before reflection is implemented\n\t\tvoid setProcessor(conwrap::ProcessorQueue<Server>*) {}\n\n\tprotected:\n\t\tvoid onData(const std::error_code error, const std::size_t receivedSize)\n\t\t{\n\t\t\tif (!error)\n\t\t\t{\n\t\t\t\t\/\/ if there is data to send back to the client\n\t\t\t\tif (receivedSize > 0)\n\t\t\t\t{\n\t\t\t\t\tsocketPtr->send(asio::buffer(buffer, receivedSize));\n\t\t\t\t}\n\n\t\t\t\t\/\/ keep receiving\n\t\t\t\tsocketPtr->async_read_some(\n\t\t\t\t\tasio::buffer(buffer, BUFFER_SIZE),\n\t\t\t\t\t[=](const std::error_code error, const std::size_t receivedSize)\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ wrapping is needed to pass handler from asio's thread to the processor's thread\n\t\t\t\t\t\tprocessorPtr->wrapHandler([=]\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tonData(error, receivedSize);\n\t\t\t\t\t\t})();\n\t\t\t\t\t}\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\n\tprivate:\n\t\tconwrap::ProcessorAsio<Server>*          processorPtr;\n\t\tshort                                    port;\n\t\tstd::unique_ptr<asio::ip::tcp::acceptor> acceptorPtr;\n\t\tstd::unique_ptr<asio::ip::tcp::socket>   socketPtr;\n\t\tenum {\n\t\t\tBUFFER_SIZE = 1024\n\t\t};\n\t\tchar                                     buffer[BUFFER_SIZE];\n};\n\n\nint main(int argc, char *argv[])\n{\n\t{\n\t\tconwrap::ProcessorQueue<Dummy> processorQueue;\n\n\t\tprocessorQueue.process([]\n\t\t{\n\t\t\tstd::cout << \"Hello from queue task\\n\\r\";\n\t\t});\n\t}\n\tstd::cout << \"Back to main\\n\\r\";\n\n\t{\n\t\tconwrap::ProcessorAsio<Dummy> processorAsio;\n\n\t\tprocessorAsio.process([]\n\t\t{\n\t\t\tstd::cout << \"Hello from asio task\\n\\r\";\n\t\t});\n\t\tprocessorAsio.flush();\n\t\tstd::cout << \"Back to main\\n\\r\";\n\t}\n\n\t{\n\t\tconwrap::ProcessorAsio<Server> processorAsio(1234);\n\t\tstd::cout << \"Echo server is listening on 1234 port (press ^C to terminate)\\n\\r\";\n\n\t\t\/\/ now server runs on a separate thread; any other logic can be done here\n\t\tfor (int i = 0; i < 3; i++)\n\t\t{\n\t\t\t\/\/ submitting a task in a regular way\n\t\t\tprocessorAsio.process([]() -> int\n\t\t\t{\n\t\t\t\tstd::cout << \"Hello from asio task\\n\\r\";\n\n\t\t\t\t\/\/ this is just to demonstrate that now asio can be used with tasks that return value\n\t\t\t\treturn 1234;\n\t\t\t});\n\n\t\t\tfor (int j = 0; j < 3; j++)\n\t\t\t{\n\t\t\t\t\/\/ submitting a task directly via asio io_service\n\t\t\t\tprocessorAsio.getDispatcher()->post(\n\n\t\t\t\t\t\/\/ a task submitted directly via asio io_service must be wrapped as following\n\t\t\t\t\tprocessorAsio.wrapHandler([&]\n\t\t\t\t\t{\n\t\t\t\t\t\tprocessorAsio.getResource()->ping();\n\t\t\t\t\t})\n\t\t\t\t);\n\n\t\t\t\t\/\/ sleeping\n\t\t\t\tstd::this_thread::sleep_for(std::chrono::seconds{5});\n\t\t\t}\n\n\t\t\t\/\/ after this flush all tasks including asio handlers are executed\n\t\t\tprocessorAsio.flush();\n\t\t\tstd::cout << \"All tasks were flushed\\n\\r\";\n\t\t}\n\n\t\t\/\/ without this close processor's destructor would wait forever for async receive handler\n\t\t\/\/ sync socket operations are thread safe since asio 1.4.0 so posting to asio thread is optional\n\t\tprocessorAsio.getDispatcher()->post([&]\n\t\t{\n\t\t\t processorAsio.getResource()->close();\n\t\t});\n\n\t\t\/\/ this flush is required as handler posted to asio captured processorAsio reference\n\t\tprocessorAsio.flush();\n\t}\n\n\treturn 0;\n}\n<commit_msg>Examples were extended with Task combination sample<commit_after>\/*\n * Copyright 2016, Andrej Kislovskij\n *\n * This is PUBLIC DOMAIN software so use at your own risk as it comes\n * with no warranties. This code is yours to share, use and modify without\n * any restrictions or obligations.\n *\n * For more information see conwrap\/LICENSE or refer refer to http:\/\/unlicense.org\n *\n * Author: gimesketvirtadieni at gmail dot com (Andrej Kislovskij)\n *\/\n\n#include <asio.hpp>\n#include <chrono>\n#include <conwrap\/ProcessorAsio.hpp>\n#include <conwrap\/ProcessorQueue.hpp>\n#include <functional>\n#include <iostream>\n\n\nstruct Dummy\n{\n\t\/\/ TODO: this is a temporary fix before reflection is implemented\n\tvoid setProcessor(conwrap::Processor<Dummy>*) {}\n};\n\n\nclass Server\n{\n\tpublic:\n\t\tServer(short p) : port(p) {}\n\n\t\tvoid close()\n\t\t{\n\t\t\t\/\/ closing acceptor\n\t\t\tacceptorPtr->close();\n\n\t\t\t\/\/ closing socket\n\t\t\tif (socketPtr->is_open())\n\t\t\t{\n\t\t\t\ttry {\n\t\t\t\t\tsocketPtr->shutdown(asio::socket_base::shutdown_both);\n\t\t\t\t} catch (...) {}\n\t\t\t\ttry {\n\t\t\t\t\tsocketPtr->close();\n\t\t\t\t} catch (...) {}\n\t\t\t}\n\t\t}\n\n\t\tvoid ping()\n\t\t{\n\t\t\tif (socketPtr->is_open())\n\t\t\t{\n\t\t\t\tsocketPtr->send(asio::buffer(\"ping\\n\\r\"));\n\t\t\t}\n\t\t}\n\n\t\tvoid setProcessor(conwrap::ProcessorAsio<Server>* p)\n\t\t{\n\t\t\tprocessorPtr = p;\n\n\t\t\t\/\/ creating an acceptor\n\t\t\tacceptorPtr = std::make_unique<asio::ip::tcp::acceptor>(\n\t\t\t\t*processorPtr->getDispatcher(),\n\t\t\t\tasio::ip::tcp::endpoint(\n\t\t\t\t\tasio::ip::tcp::v4(),\n\t\t\t\t\tport\n\t\t\t\t)\n\t\t\t);\n\n\t\t\t\/\/ creating a socket\n\t\t\tsocketPtr = std::make_unique<asio::ip::tcp::socket>(\n\t\t\t\t*processorPtr->getDispatcher()\n\t\t\t);\n\n\t\t\tacceptorPtr->async_accept(\n\t\t\t\t*socketPtr,\n\t\t\t\t[=](const std::error_code error)\n\t\t\t\t{\n\t\t\t\t\t\/\/ wrapping is needed to pass handler from asio's thread to the processor's thread\n\t\t\t\t\tprocessorPtr->wrapHandler([=]\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ start receiving data\n\t\t\t\t\t\tonData(error, 0);\n\t\t\t\t\t})();\n\t\t\t\t}\n\t\t\t);\n\t\t}\n\n\t\t\/\/ TODO: this is a temporary fix before reflection is implemented\n\t\tvoid setProcessor(conwrap::ProcessorQueue<Server>*) {}\n\n\tprotected:\n\t\tvoid onData(const std::error_code error, const std::size_t receivedSize)\n\t\t{\n\t\t\tif (!error)\n\t\t\t{\n\t\t\t\t\/\/ if there is data to send back to the client\n\t\t\t\tif (receivedSize > 0)\n\t\t\t\t{\n\t\t\t\t\tsocketPtr->send(asio::buffer(buffer, receivedSize));\n\t\t\t\t}\n\n\t\t\t\t\/\/ keep receiving\n\t\t\t\tsocketPtr->async_read_some(\n\t\t\t\t\tasio::buffer(buffer, BUFFER_SIZE),\n\t\t\t\t\t[=](const std::error_code error, const std::size_t receivedSize)\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ wrapping is needed to pass handler from asio's thread to the processor's thread\n\t\t\t\t\t\tprocessorPtr->wrapHandler([=]\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tonData(error, receivedSize);\n\t\t\t\t\t\t})();\n\t\t\t\t\t}\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\n\tprivate:\n\t\tconwrap::ProcessorAsio<Server>*          processorPtr;\n\t\tshort                                    port;\n\t\tstd::unique_ptr<asio::ip::tcp::acceptor> acceptorPtr;\n\t\tstd::unique_ptr<asio::ip::tcp::socket>   socketPtr;\n\t\tenum {\n\t\t\tBUFFER_SIZE = 1024\n\t\t};\n\t\tchar                                     buffer[BUFFER_SIZE];\n};\n\n\nint main(int argc, char *argv[])\n{\n\t{\n\t\tconwrap::ProcessorQueue<Dummy> processorQueue;\n\n\t\tprocessorQueue.process([]\n\t\t{\n\t\t\tstd::cout << \"Hello from queue task\\n\\r\";\n\t\t});\n\t}\n\tstd::cout << \"Back to main\\n\\r\";\n\n\t{\n\t\tconwrap::ProcessorAsio<Dummy> processorAsio;\n\n\t\tprocessorAsio.process([]\n\t\t{\n\t\t\tstd::cout << \"Hello from asio task\\n\\r\";\n\t\t});\n\t\tprocessorAsio.flush();\n\t\tstd::cout << \"Back to main\\n\\r\";\n\t}\n\n\t\/\/ example demonstrating composition of tasks\n\t{\n\t\tconwrap::ProcessorQueue<Dummy> processorQueue;\n\n\t\tprocessorQueue.process([]() -> int\n\t\t{\n\t\t\tstd::cout << \"Hello from the 1'st task\\n\\r\";\n\t\t\treturn 123;\n\t\t}).then([](auto context) -> bool\n\t\t{\n\t\t\tstd::cout << \"Hello from the 2'nd task (result from previous task is \" << context.getResult() << \")\\n\\r\";\n\n\t\t\tcontext.getProcessorProxy()->process([]() -> int\n\t\t\t{\n\t\t\t\tstd::cout << \"Hello from the 2.1'st task\\n\\r\";\n\t\t\t\treturn 1234;\n\t\t\t}).then([](auto context) -> bool\n\t\t\t{\n\t\t\t\tstd::cout << \"Hello from the 2.2'nd task (result from previous task is \" << context.getResult() << \")\\n\\r\";\n\t\t\t\treturn true;\n\t\t\t}).then([](auto context)\n\t\t\t{\n\t\t\t\tstd::cout << \"Hello from the 2.3'rd task (result from previous task is \" << context.getResult() << \")\\n\\r\";\n\t\t\t});\n\n\t\t\treturn false;\n\t\t}).then([](auto context)\n\t\t{\n\t\t\tstd::cout << \"Hello from the 3'rd task (result from previous task is \" << context.getResult() << \")\\n\\r\";\n\t\t});\n\t\tprocessorQueue.flush();\n\t\tstd::cout << \"Back to main\\n\\r\";\n\t}\n\n\t\/\/ example demonstrating combining task processing with Asio server\n\t{\n\t\tconwrap::ProcessorAsio<Server> processorAsio(1234);\n\t\tstd::cout << \"Echo server is listening on 1234 port (press ^C to terminate)\\n\\r\";\n\n\t\t\/\/ now server runs on a separate thread; any other logic can be done here\n\t\tfor (int i = 0; i < 3; i++)\n\t\t{\n\t\t\t\/\/ submitting a task in a regular way\n\t\t\tprocessorAsio.process([]() -> int\n\t\t\t{\n\t\t\t\tstd::cout << \"Hello from asio task\\n\\r\";\n\n\t\t\t\t\/\/ this is just to demonstrate that now asio can be used with tasks that return value\n\t\t\t\treturn 1234;\n\t\t\t}).getResult();\n\n\t\t\tfor (int j = 0; j < 3; j++)\n\t\t\t{\n\t\t\t\t\/\/ submitting a task directly via asio io_service\n\t\t\t\tprocessorAsio.getDispatcher()->post(\n\n\t\t\t\t\t\/\/ a task submitted directly via asio io_service must be wrapped as following\n\t\t\t\t\tprocessorAsio.wrapHandler([&]\n\t\t\t\t\t{\n\t\t\t\t\t\tprocessorAsio.getResource()->ping();\n\t\t\t\t\t})\n\t\t\t\t);\n\n\t\t\t\t\/\/ sleeping\n\t\t\t\tstd::this_thread::sleep_for(std::chrono::seconds{5});\n\t\t\t}\n\n\t\t\t\/\/ after this flush all tasks including asio handlers are executed\n\t\t\tprocessorAsio.flush();\n\t\t\tstd::cout << \"All tasks were flushed\\n\\r\";\n\t\t}\n\n\t\t\/\/ without this close processor's destructor would wait forever for async receive handler\n\t\t\/\/ sync socket operations are thread safe since asio 1.4.0 so posting to asio thread is optional\n\t\tprocessorAsio.getDispatcher()->post([&]\n\t\t{\n\t\t\t processorAsio.getResource()->close();\n\t\t});\n\n\t\t\/\/ this flush is required as handler posted to asio captured processorAsio reference\n\t\tprocessorAsio.flush();\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * This file is part of signon\n *\n * Copyright (C) 2009-2010 Nokia Corporation.\n *\n * Contact: Aurel Popirtac <ext-Aurel.Popirtac@nokia.com>\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\n#include <QtTest\/QtTest>\n#include \"credentialsaccessmanagertest.h\"\n\n#include \"credentialsaccessmanager.h\"\n\nusing namespace SignonDaemonNS;\n\n#define TEST_START qDebug(\"\\n\\n\\n\\n ----------------- %s ----------------\\n\\n\",  __func__);\n\n#define TEST_DONE  qDebug(\"\\n\\n ----------------- %s PASS ----------------\\n\\n\",  __func__);\n\n\nvoid CredentialsAccessManagerTest::initTestCase()\n{\n    TEST_START\n    m_pManager = CredentialsAccessManager::instance();\n\n    QVERIFY(m_pManager != NULL);\n    QCOMPARE(m_pManager->lastError(), SignonDaemonNS::NoError);\n\n    \/\/otherwise using currrent default configuration\n    CAMConfiguration config;\n    config.m_useEncryption = true;\n    config.m_dbFileSystemPath = QLatin1String(\"\/home\/user\/MyDocs\/signonfs\");\n    config.m_encryptionPassphrase = \"1234\";\n\n    QVERIFY(m_pManager->init(config));\n\n    QCOMPARE(m_pManager->lastError(), SignonDaemonNS::NoError);\n    TEST_DONE\n}\n\nvoid CredentialsAccessManagerTest::cleanupTestCase()\n{\n    TEST_START\n    if(m_pManager)\n        delete m_pManager;\n    TEST_DONE\n}\n\n\/\/test cases\n\nvoid CredentialsAccessManagerTest::createCredentialsSystem()\n{\n    TEST_START\n    QSKIP(\"This test requires to be reconsidered.\", SkipSingle);\n\n    QVERIFY(m_pManager->openCredentialsSystem());\n\n    QCOMPARE(m_pManager->lastError(), SignonDaemonNS::NoError);\n\n    QVERIFY(m_pManager->credentialsSystemOpened());\n\n    QVERIFY(m_pManager->closeCredentialsSystem());\n\n    QCOMPARE(m_pManager->lastError(), SignonDaemonNS::NoError);\n\n    QVERIFY(m_pManager->credentialsSystemOpened() == false);\n    TEST_DONE\n}\n\nvoid CredentialsAccessManagerTest::openCredentialsSystem()\n{\n    TEST_START\n    QSKIP(\"This test requires to be reconsidered.\", SkipSingle);\n\n    QVERIFY(m_pManager->openCredentialsSystem());\n\n    QVERIFY(m_pManager->credentialsSystemOpened());\n\n    QCOMPARE(m_pManager->lastError(), SignonDaemonNS::NoError);\n    TEST_DONE\n}\n\nvoid CredentialsAccessManagerTest::testCredentialsDatabase()\n{\n    TEST_START\n\n    CredentialsDB *db = m_pManager->credentialsDB();\n    QVERIFY(db != NULL);\n\n    if (!db->clear())\n        qDebug() << \"Clearing of credentials db failed. Test could fail.\";\n\n    \/\/ TODO - test with a greater number of crendetials.\n    int numberOfStoredCredentials = 500;\n\n    \/\/Prepare Identity data\n    QMap<QString, QStringList> mapList;\n    for(int i = 0; i < 5; ++i)\n        mapList.insert(\"my_so_called_method\",\n                       QStringList() << \"mech1\" << \"mech2\" << \"mech3\" << \"mech4\" << \"mech5\");\n    QMap<QString, QVariant> methods =\n            SignonIdentityInfo::mapListToMapVariant(mapList);\n\n    QLatin1String caption(\"Long text about strawberries and old stories\"\n                          \"about stupid things that make us feel good.\");\n\n    QStringList realms = QStringList() << \"http:\/\/www.something.com\/dsa=43fds=test\"\n                                       << \"http:\/\/www.something.com\/dsa=43fds=test\"\n                                       << \"http:\/\/www.something.com\/dsa=43fds=test\"\n                                       << \"http:\/\/ww555008w.something.com\/dsa=43fds=test\"\n                                       << \"http:\/\/www.something.com\/dsa=43fds=test\"\n                                       << \"http:\/\/www.something.com\/dsa=43fds=test\";\n    QStringList accessControlList = QStringList() << \"PREF::package.token.gummybear\"\n                                                  << \"PREF::package.token.gummybear\"\n                                                  << \"PREF::package.token.beer\"\n                                                  << \"PREF::package.token.stuff\"\n                                                  << \"PREF::package.token.application\"\n                                                  << \"PREF::package.token.wonders\"\n                                                  << \"PREF::package.token.ventilation\";\n    SignonIdentityInfo info(0, QLatin1String(\"username\"), QLatin1String(\"passsssword1231454\"), true,\n                            methods, caption, realms);\n\n    info.m_accessControlList = accessControlList;\n\n    \/\/store 200 identities\n    for(int j = 0; j < numberOfStoredCredentials; ++j) {\n        QVERIFY2(db->insertCredentials(info, true) > 0,\n                 QString(QLatin1String(\"Number of successfully inserted credentials:\")\n                 + QString::number(j)).toUtf8().constData());\n    }\n\n    QList<SignonIdentityInfo> result = db->credentials(QMap<QString, QString>());\n    QVERIFY(result.count() == numberOfStoredCredentials);\n\n    TEST_DONE\n}\n\nvoid CredentialsAccessManagerTest::closeCredentialsSystem()\n{\n    TEST_START\n    QVERIFY(m_pManager->closeCredentialsSystem());\n    QCOMPARE(m_pManager->lastError(), SignonDaemonNS::NoError);\n    QVERIFY(m_pManager->credentialsSystemOpened() == false);\n    TEST_DONE\n}\n\nvoid CredentialsAccessManagerTest::deleteCredentialsSystem()\n{\n    TEST_START\n    \/\/TODO\n    TEST_DONE\n}\n#if defined(SSO_CI_TESTMANAGEMENT)\n    void CredentialsAccessManagerTest::runAllTests()\n    {\n        initTestCase();\n        createCredentialsSystem();\n        openCredentialsSystem();\n        testCredentialsDatabase();\n        closeCredentialsSystem();\n        deleteCredentialsSystem();\n        cleanupTestCase();\n    }\n#else\n    QTEST_MAIN(CredentialsAccessManagerTest)\n#endif\n<commit_msg>Fix building of tests<commit_after>\/*\n * This file is part of signon\n *\n * Copyright (C) 2009-2010 Nokia Corporation.\n *\n * Contact: Aurel Popirtac <ext-Aurel.Popirtac@nokia.com>\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\n#include <QtTest\/QtTest>\n#include \"credentialsaccessmanagertest.h\"\n\n#include \"credentialsaccessmanager.h\"\n\nusing namespace SignonDaemonNS;\n\n#define TEST_START qDebug(\"\\n\\n\\n\\n ----------------- %s ----------------\\n\\n\",  __func__);\n\n#define TEST_DONE  qDebug(\"\\n\\n ----------------- %s PASS ----------------\\n\\n\",  __func__);\n\n\nvoid CredentialsAccessManagerTest::initTestCase()\n{\n    TEST_START\n    m_pManager = CredentialsAccessManager::instance();\n\n    QVERIFY(m_pManager != NULL);\n    QCOMPARE(m_pManager->lastError(), SignonDaemonNS::NoError);\n\n    \/\/otherwise using currrent default configuration\n    CAMConfiguration config;\n    config.m_useEncryption = true;\n    config.m_dbFileSystemPath = QLatin1String(\"\/home\/user\/MyDocs\/signonfs\");\n    config.m_encryptionPassphrase = \"1234\";\n\n    QVERIFY(m_pManager->init(config));\n\n    QCOMPARE(m_pManager->lastError(), SignonDaemonNS::NoError);\n    TEST_DONE\n}\n\nvoid CredentialsAccessManagerTest::cleanupTestCase()\n{\n    TEST_START\n    if(m_pManager)\n        delete m_pManager;\n    TEST_DONE\n}\n\n\/\/test cases\n\nvoid CredentialsAccessManagerTest::createCredentialsSystem()\n{\n    TEST_START\n    QSKIP(\"This test requires to be reconsidered.\", SkipSingle);\n\n    QVERIFY(m_pManager->openCredentialsSystem());\n\n    QCOMPARE(m_pManager->lastError(), SignonDaemonNS::NoError);\n\n    QVERIFY(m_pManager->credentialsSystemOpened());\n\n    QVERIFY(m_pManager->closeCredentialsSystem());\n\n    QCOMPARE(m_pManager->lastError(), SignonDaemonNS::NoError);\n\n    QVERIFY(m_pManager->credentialsSystemOpened() == false);\n    TEST_DONE\n}\n\nvoid CredentialsAccessManagerTest::openCredentialsSystem()\n{\n    TEST_START\n    QSKIP(\"This test requires to be reconsidered.\", SkipSingle);\n\n    QVERIFY(m_pManager->openCredentialsSystem());\n\n    QVERIFY(m_pManager->credentialsSystemOpened());\n\n    QCOMPARE(m_pManager->lastError(), SignonDaemonNS::NoError);\n    TEST_DONE\n}\n\nvoid CredentialsAccessManagerTest::testCredentialsDatabase()\n{\n    TEST_START\n\n    CredentialsDB *db = m_pManager->credentialsDB();\n    QVERIFY(db != NULL);\n\n    if (!db->clear())\n        qDebug() << \"Clearing of credentials db failed. Test could fail.\";\n\n    \/\/ TODO - test with a greater number of crendetials.\n    int numberOfStoredCredentials = 500;\n\n    \/\/Prepare Identity data\n    QMap<QString, QStringList> mapList;\n    for(int i = 0; i < 5; ++i)\n        mapList.insert(\"my_so_called_method\",\n                       QStringList() << \"mech1\" << \"mech2\" << \"mech3\" << \"mech4\" << \"mech5\");\n    QMap<QString, QVariant> methods =\n            SignonIdentityInfo::mapListToMapVariant(mapList);\n\n    QLatin1String caption(\"Long text about strawberries and old stories\"\n                          \"about stupid things that make us feel good.\");\n\n    QStringList realms = QStringList() << \"http:\/\/www.something.com\/dsa=43fds=test\"\n                                       << \"http:\/\/www.something.com\/dsa=43fds=test\"\n                                       << \"http:\/\/www.something.com\/dsa=43fds=test\"\n                                       << \"http:\/\/ww555008w.something.com\/dsa=43fds=test\"\n                                       << \"http:\/\/www.something.com\/dsa=43fds=test\"\n                                       << \"http:\/\/www.something.com\/dsa=43fds=test\";\n    QStringList accessControlList = QStringList() << \"PREF::package.token.gummybear\"\n                                                  << \"PREF::package.token.gummybear\"\n                                                  << \"PREF::package.token.beer\"\n                                                  << \"PREF::package.token.stuff\"\n                                                  << \"PREF::package.token.application\"\n                                                  << \"PREF::package.token.wonders\"\n                                                  << \"PREF::package.token.ventilation\";\n    SignonIdentityInfo info(0, QLatin1String(\"username\"), QLatin1String(\"passsssword1231454\"), true,\n                            methods, caption, realms, accessControlList);\n\n    \/\/store 200 identities\n    for(int j = 0; j < numberOfStoredCredentials; ++j) {\n        QVERIFY2(db->insertCredentials(info, true) > 0,\n                 QString(QLatin1String(\"Number of successfully inserted credentials:\")\n                 + QString::number(j)).toUtf8().constData());\n    }\n\n    QList<SignonIdentityInfo> result = db->credentials(QMap<QString, QString>());\n    QVERIFY(result.count() == numberOfStoredCredentials);\n\n    TEST_DONE\n}\n\nvoid CredentialsAccessManagerTest::closeCredentialsSystem()\n{\n    TEST_START\n    QVERIFY(m_pManager->closeCredentialsSystem());\n    QCOMPARE(m_pManager->lastError(), SignonDaemonNS::NoError);\n    QVERIFY(m_pManager->credentialsSystemOpened() == false);\n    TEST_DONE\n}\n\nvoid CredentialsAccessManagerTest::deleteCredentialsSystem()\n{\n    TEST_START\n    \/\/TODO\n    TEST_DONE\n}\n#if defined(SSO_CI_TESTMANAGEMENT)\n    void CredentialsAccessManagerTest::runAllTests()\n    {\n        initTestCase();\n        createCredentialsSystem();\n        openCredentialsSystem();\n        testCredentialsDatabase();\n        closeCredentialsSystem();\n        deleteCredentialsSystem();\n        cleanupTestCase();\n    }\n#else\n    QTEST_MAIN(CredentialsAccessManagerTest)\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <limits>\n#include <cstdint>\n\nnamespace oqpi {\n\n\t\/\/----------------------------------------------------------------------------------------------\n\tenum class thread_priority\n\t{\n\t\tlowest,\n\t\tbelow_normal,\n\t\tnormal,\n\t\tabove_normal,\n\t\thighest,\n        time_critical,\n\n        count\n\t};\n\t\/\/----------------------------------------------------------------------------------------------\n\n\t\/\/----------------------------------------------------------------------------------------------\n\tenum core_affinity : uint32_t\n\t{\n\t\tcore0 = 1,\n\t\tcore1 = core0 << 1,\n\t\tcore2 = core1 << 1,\n\t\tcore3 = core2 << 1,\n\t\tcore4 = core3 << 1,\n\t\tcore5 = core4 << 1,\n\t\tcore6 = core5 << 1,\n\t\tcore7 = core6 << 1,\n\n\t\tall_cores = (std::numeric_limits<uint32_t>::max)()\n\t};\n\t\/\/----------------------------------------------------------------------------------------------\n\n\t\/\/----------------------------------------------------------------------------------------------\n\tstruct thread_attributes\n\t{\n        \/\/ Thread's name that will appear in various debug tools\n\t\tconst char\t\t*name_;\n        \/\/ The maximal stack size of the thread, 0 will use the system's default value\n\t\tuint32_t\t\t stackSize_;\n        \/\/ Specifies which cores this thread is allowed to run on.\n\t\tcore_affinity\t coreAffinityMask_;\n        \/\/ The higher the priority the bigger the time slices this thread will be given in the \n        \/\/ underlying OS scheduler.\n\t\tthread_priority\t priority_;\n\n        \/\/ Constructor with default values, the name should always be specified\n        thread_attributes\n        (\n            const char *name,\n            uint32_t stackSize              = 0u,\n            core_affinity coreAffinityMask  = core_affinity::all_cores,\n            thread_priority priority        = thread_priority::normal\n        )\n            : name_             (name)\n            , stackSize_        (stackSize)\n            , coreAffinityMask_ (coreAffinityMask)\n            , priority_         (priority)\n        {}\n\t};\n\t\/\/----------------------------------------------------------------------------------------------\n\n}\n<commit_msg>Changed name type to std::string in thread_attributes + added a detached field to launched detached threads<commit_after>#pragma once\n\n#include <limits>\n#include <cstdint>\n\nnamespace oqpi {\n\n\t\/\/----------------------------------------------------------------------------------------------\n\tenum class thread_priority\n\t{\n\t\tlowest,\n\t\tbelow_normal,\n\t\tnormal,\n\t\tabove_normal,\n\t\thighest,\n        time_critical,\n\n        count\n\t};\n\t\/\/----------------------------------------------------------------------------------------------\n\n\t\/\/----------------------------------------------------------------------------------------------\n\tenum core_affinity : uint32_t\n\t{\n\t\tcore0 = 1,\n\t\tcore1 = core0 << 1,\n\t\tcore2 = core1 << 1,\n\t\tcore3 = core2 << 1,\n\t\tcore4 = core3 << 1,\n\t\tcore5 = core4 << 1,\n\t\tcore6 = core5 << 1,\n\t\tcore7 = core6 << 1,\n\n\t\tall_cores = (std::numeric_limits<uint32_t>::max)()\n\t};\n\t\/\/----------------------------------------------------------------------------------------------\n\n\t\/\/----------------------------------------------------------------------------------------------\n\tstruct thread_attributes\n\t{\n        \/\/ Thread's name that will appear in various debug tools\n\t\tstd::string     name_;\n        \/\/ The maximal stack size of the thread, 0 will use the system's default value\n\t\tuint32_t\t\tstackSize_;\n        \/\/ Specifies which cores this thread is allowed to run on.\n\t\tcore_affinity   coreAffinityMask_;\n        \/\/ The higher the priority the bigger the time slices this thread will be given in the \n        \/\/ underlying OS scheduler.\n\t\tthread_priority priority_;\n        \/\/ Whether or not to launch the thread detached\n        bool            detached_;\n\n        \/\/ Constructor with default values, the name should always be specified\n        thread_attributes\n        (\n            const std::string name,\n            uint32_t stackSize              = 0u,\n            core_affinity coreAffinityMask  = core_affinity::all_cores,\n            thread_priority priority        = thread_priority::normal,\n            bool detached                   = false\n        )\n            : name_             (name)\n            , stackSize_        (stackSize)\n            , coreAffinityMask_ (coreAffinityMask)\n            , priority_         (priority)\n            , detached_         (detached)\n        {}\n\t};\n\t\/\/----------------------------------------------------------------------------------------------\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: AccessibleDataPilotControl.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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n\n#include \"precompiled_sc.hxx\"\n#include \"AccessibleGlobal.hxx\"\n#include \"AccessibleFilterMenuItem.hxx\"\n#include \"dpcontrol.hxx\"\n\n#include <com\/sun\/star\/accessibility\/XAccessible.hpp>\n#include <com\/sun\/star\/accessibility\/XAccessibleStateSet.hpp>\n#include <com\/sun\/star\/accessibility\/AccessibleRole.hpp>\n#include <com\/sun\/star\/accessibility\/AccessibleEventId.hpp>\n#include <com\/sun\/star\/accessibility\/AccessibleEventObject.hpp>\n#include <com\/sun\/star\/accessibility\/AccessibleStateType.hpp>\n#include <com\/sun\/star\/accessibility\/TextSegment.hpp>\n\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::accessibility;\nusing namespace ::com::sun::star::accessibility::AccessibleStateType;\n\nusing ::com::sun::star::uno::Any;\nusing ::com::sun::star::uno::Reference;\nusing ::com::sun::star::uno::Sequence;\nusing ::com::sun::star::uno::UNO_QUERY;\nusing ::com::sun::star::lang::IndexOutOfBoundsException;\nusing ::com::sun::star::uno::RuntimeException;\nusing ::rtl::OUString;\n\nScAccessibleFilterMenuItem::ScAccessibleFilterMenuItem(\n    const Reference<XAccessible>& rxParent, ScMenuFloatingWindow* pWin, const OUString& rName, size_t nMenuPos) :\n    ScAccessibleContextBase(rxParent, AccessibleRole::MENU_ITEM),\n    mpWindow(pWin),\n    maName(rName),\n    mnMenuPos(nMenuPos),\n    mbEnabled(true)\n{\n    SetName(rName);\n}\n\nScAccessibleFilterMenuItem::~ScAccessibleFilterMenuItem()\n{\n}\n\nsal_Int32 ScAccessibleFilterMenuItem::getAccessibleChildCount()\n    throw (RuntimeException)\n{\n    return 0;\n}\n\nReference<XAccessible> ScAccessibleFilterMenuItem::getAccessibleChild(sal_Int32 \/*nIndex*\/)\n    throw (RuntimeException, IndexOutOfBoundsException)\n{\n    throw IndexOutOfBoundsException();\n    return Reference<XAccessible>();\n}\n\nReference<XAccessibleStateSet> ScAccessibleFilterMenuItem::getAccessibleStateSet()\n    throw (RuntimeException)\n{\n    updateStateSet();\n    return mxStateSet;\n}\n\nOUString ScAccessibleFilterMenuItem::getImplementationName()\n    throw (RuntimeException)\n{\n    return OUString::createFromAscii(\"ScAccessibleFilterMenuItem\");\n}\n\n\/\/ XAccessibleAction\n\nsal_Int32 ScAccessibleFilterMenuItem::getAccessibleActionCount() throw (RuntimeException)\n{\n    return 1;\n}\n\nsal_Bool ScAccessibleFilterMenuItem::doAccessibleAction(sal_Int32 \/*nIndex*\/)\n    throw (IndexOutOfBoundsException, RuntimeException)\n{\n    mpWindow->executeMenuItem(mnMenuPos);\n    return true;\n}\n\nOUString ScAccessibleFilterMenuItem::getAccessibleActionDescription(sal_Int32 \/*nIndex*\/)\n    throw (IndexOutOfBoundsException, RuntimeException)\n{\n    return OUString::createFromAscii(\"click\");\n}\n\nReference<XAccessibleKeyBinding> ScAccessibleFilterMenuItem::getAccessibleActionKeyBinding(\n    sal_Int32 \/*nIndex*\/) throw (IndexOutOfBoundsException, RuntimeException)\n{\n    return Reference<XAccessibleKeyBinding>();\n}\n\nAny SAL_CALL ScAccessibleFilterMenuItem::queryInterface( uno::Type const & rType )\n    throw (RuntimeException)\n{\n    Any any = ScAccessibleContextBase::queryInterface(rType);\n    if (any.hasValue())\n        return any;\n\n    return ScAccessibleFilterMenuItem_BASE::queryInterface(rType);\n}\n\nvoid SAL_CALL ScAccessibleFilterMenuItem::acquire() throw ()\n{\n    ScAccessibleContextBase::acquire();\n}\n\nvoid SAL_CALL ScAccessibleFilterMenuItem::release() throw ()\n{\n    ScAccessibleContextBase::release();\n}\n\nbool ScAccessibleFilterMenuItem::isSelected() const\n{\n    return mpWindow->isMenuItemSelected(mnMenuPos);\n}\n\nbool ScAccessibleFilterMenuItem::isFocused() const\n{\n    return isSelected();\n}\n\nvoid ScAccessibleFilterMenuItem::setEnabled(bool bEnabled)\n{\n    mbEnabled = bEnabled;\n}\n\nRectangle ScAccessibleFilterMenuItem::GetBoundingBoxOnScreen() const\n    throw (RuntimeException)\n{\n    if (!mpWindow->IsVisible())\n        return Rectangle();\n\n    Point aPos = mpWindow->OutputToAbsoluteScreenPixel(Point(0,0));\n    Point aMenuPos;\n    Size aMenuSize;\n    mpWindow->getMenuItemPosSize(mnMenuPos, aMenuPos, aMenuSize);\n    Rectangle aRect(aPos + aMenuPos, aMenuSize);\n    return aRect;\n}\n\nRectangle ScAccessibleFilterMenuItem::GetBoundingBox() const\n    throw (RuntimeException)\n{\n    if (!mpWindow->IsVisible())\n        return Rectangle();\n\n    Point aMenuPos;\n    Size aMenuSize;\n    mpWindow->getMenuItemPosSize(mnMenuPos, aMenuPos, aMenuSize);\n    Rectangle aRect(aMenuPos, aMenuSize);\n    return aRect;\n}\n\nvoid ScAccessibleFilterMenuItem::updateStateSet()\n{\n    if (!mxStateSet.is())\n        mxStateSet.set(new ScAccessibleStateSet);\n\n    ScAccessibleStateSet* p = static_cast<ScAccessibleStateSet*>(\n        mxStateSet.get());\n\n    p->clear();\n\n    p->insert(ENABLED);\n    p->insert(FOCUSABLE);\n    p->insert(SELECTABLE);\n    p->insert(SENSITIVE);\n    p->insert(OPAQUE);\n\n    if (isFocused())\n        p->insert(FOCUSED);\n\n    if (isSelected())\n        p->insert(SELECTED);\n}\n\n<commit_msg>unx warning<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: AccessibleDataPilotControl.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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n\n#include \"precompiled_sc.hxx\"\n#include \"AccessibleGlobal.hxx\"\n#include \"AccessibleFilterMenuItem.hxx\"\n#include \"dpcontrol.hxx\"\n\n#include <com\/sun\/star\/accessibility\/XAccessible.hpp>\n#include <com\/sun\/star\/accessibility\/XAccessibleStateSet.hpp>\n#include <com\/sun\/star\/accessibility\/AccessibleRole.hpp>\n#include <com\/sun\/star\/accessibility\/AccessibleEventId.hpp>\n#include <com\/sun\/star\/accessibility\/AccessibleEventObject.hpp>\n#include <com\/sun\/star\/accessibility\/AccessibleStateType.hpp>\n#include <com\/sun\/star\/accessibility\/TextSegment.hpp>\n\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::accessibility;\nusing namespace ::com::sun::star::accessibility::AccessibleStateType;\n\nusing ::com::sun::star::uno::Any;\nusing ::com::sun::star::uno::Reference;\nusing ::com::sun::star::uno::Sequence;\nusing ::com::sun::star::uno::UNO_QUERY;\nusing ::com::sun::star::lang::IndexOutOfBoundsException;\nusing ::com::sun::star::uno::RuntimeException;\nusing ::rtl::OUString;\n\nScAccessibleFilterMenuItem::ScAccessibleFilterMenuItem(\n    const Reference<XAccessible>& rxParent, ScMenuFloatingWindow* pWin, const OUString& rName, size_t nMenuPos) :\n    ScAccessibleContextBase(rxParent, AccessibleRole::MENU_ITEM),\n    mpWindow(pWin),\n    maName(rName),\n    mnMenuPos(nMenuPos),\n    mbEnabled(true)\n{\n    SetName(rName);\n}\n\nScAccessibleFilterMenuItem::~ScAccessibleFilterMenuItem()\n{\n}\n\nsal_Int32 ScAccessibleFilterMenuItem::getAccessibleChildCount()\n    throw (RuntimeException)\n{\n    return 0;\n}\n\nReference<XAccessible> ScAccessibleFilterMenuItem::getAccessibleChild(sal_Int32 \/*nIndex*\/)\n    throw (RuntimeException, IndexOutOfBoundsException)\n{\n    throw IndexOutOfBoundsException();\n}\n\nReference<XAccessibleStateSet> ScAccessibleFilterMenuItem::getAccessibleStateSet()\n    throw (RuntimeException)\n{\n    updateStateSet();\n    return mxStateSet;\n}\n\nOUString ScAccessibleFilterMenuItem::getImplementationName()\n    throw (RuntimeException)\n{\n    return OUString::createFromAscii(\"ScAccessibleFilterMenuItem\");\n}\n\n\/\/ XAccessibleAction\n\nsal_Int32 ScAccessibleFilterMenuItem::getAccessibleActionCount() throw (RuntimeException)\n{\n    return 1;\n}\n\nsal_Bool ScAccessibleFilterMenuItem::doAccessibleAction(sal_Int32 \/*nIndex*\/)\n    throw (IndexOutOfBoundsException, RuntimeException)\n{\n    mpWindow->executeMenuItem(mnMenuPos);\n    return true;\n}\n\nOUString ScAccessibleFilterMenuItem::getAccessibleActionDescription(sal_Int32 \/*nIndex*\/)\n    throw (IndexOutOfBoundsException, RuntimeException)\n{\n    return OUString::createFromAscii(\"click\");\n}\n\nReference<XAccessibleKeyBinding> ScAccessibleFilterMenuItem::getAccessibleActionKeyBinding(\n    sal_Int32 \/*nIndex*\/) throw (IndexOutOfBoundsException, RuntimeException)\n{\n    return Reference<XAccessibleKeyBinding>();\n}\n\nAny SAL_CALL ScAccessibleFilterMenuItem::queryInterface( uno::Type const & rType )\n    throw (RuntimeException)\n{\n    Any any = ScAccessibleContextBase::queryInterface(rType);\n    if (any.hasValue())\n        return any;\n\n    return ScAccessibleFilterMenuItem_BASE::queryInterface(rType);\n}\n\nvoid SAL_CALL ScAccessibleFilterMenuItem::acquire() throw ()\n{\n    ScAccessibleContextBase::acquire();\n}\n\nvoid SAL_CALL ScAccessibleFilterMenuItem::release() throw ()\n{\n    ScAccessibleContextBase::release();\n}\n\nbool ScAccessibleFilterMenuItem::isSelected() const\n{\n    return mpWindow->isMenuItemSelected(mnMenuPos);\n}\n\nbool ScAccessibleFilterMenuItem::isFocused() const\n{\n    return isSelected();\n}\n\nvoid ScAccessibleFilterMenuItem::setEnabled(bool bEnabled)\n{\n    mbEnabled = bEnabled;\n}\n\nRectangle ScAccessibleFilterMenuItem::GetBoundingBoxOnScreen() const\n    throw (RuntimeException)\n{\n    if (!mpWindow->IsVisible())\n        return Rectangle();\n\n    Point aPos = mpWindow->OutputToAbsoluteScreenPixel(Point(0,0));\n    Point aMenuPos;\n    Size aMenuSize;\n    mpWindow->getMenuItemPosSize(mnMenuPos, aMenuPos, aMenuSize);\n    Rectangle aRect(aPos + aMenuPos, aMenuSize);\n    return aRect;\n}\n\nRectangle ScAccessibleFilterMenuItem::GetBoundingBox() const\n    throw (RuntimeException)\n{\n    if (!mpWindow->IsVisible())\n        return Rectangle();\n\n    Point aMenuPos;\n    Size aMenuSize;\n    mpWindow->getMenuItemPosSize(mnMenuPos, aMenuPos, aMenuSize);\n    Rectangle aRect(aMenuPos, aMenuSize);\n    return aRect;\n}\n\nvoid ScAccessibleFilterMenuItem::updateStateSet()\n{\n    if (!mxStateSet.is())\n        mxStateSet.set(new ScAccessibleStateSet);\n\n    ScAccessibleStateSet* p = static_cast<ScAccessibleStateSet*>(\n        mxStateSet.get());\n\n    p->clear();\n\n    p->insert(ENABLED);\n    p->insert(FOCUSABLE);\n    p->insert(SELECTABLE);\n    p->insert(SENSITIVE);\n    p->insert(OPAQUE);\n\n    if (isFocused())\n        p->insert(FOCUSED);\n\n    if (isSelected())\n        p->insert(SELECTED);\n}\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Initializing source vector<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>We used the wrong syntax for \"new\", which generated a warning\/error building with clang. Review URL: http:\/\/webrtc-codereview.appspot.com\/336003<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n    open source routing machine\n    Copyright (C) Dennis Luxen, 2010\n\nThis program is free software; you can redistribute it and\/or modify\nit under the terms of the GNU AFFERO General Public License as published by\nthe Free Software Foundation; either version 3 of the License, or\nany later version.\n\nThis program is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\nGNU General Public License for more details.\n\nYou should have received a copy of the GNU Affero General Public License\nalong with this program; if not, write to the Free Software\nFoundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA\nor see http:\/\/www.gnu.org\/licenses\/agpl.txt.\n *\/\n\n#include \"OSRM.h\"\n\nOSRM::OSRM(const char * server_ini_path) {\n    if( !testDataFile(server_ini_path) ){\n        std::string error_message = std::string(server_ini_path) + \" not found\";\n        throw OSRMException(error_message.c_str());\n    }\n\n    IniFile serverConfig(server_ini_path);\n\n    boost::filesystem::path base_path =\n               boost::filesystem::absolute(server_ini_path).parent_path();\n\n    if ( !serverConfig.Holds(\"hsgrData\")) {\n        throw OSRMException(\"no ram index file name in server ini\");\n    }\n    if ( !serverConfig.Holds(\"ramIndex\") ) {\n        throw OSRMException(\"no mem index file name in server ini\");\n    }\n    if ( !serverConfig.Holds(\"fileIndex\") ) {\n        throw OSRMException(\"no nodes file name in server ini\");\n    }\n    if ( !serverConfig.Holds(\"nodesData\") ) {\n        throw OSRMException(\"no nodes file name in server ini\");\n    }\n    if ( !serverConfig.Holds(\"edgesData\") ) {\n        throw OSRMException(\"no edges file name in server ini\");\n    }\n\n    boost::filesystem::path hsgr_path = boost::filesystem::absolute(\n            serverConfig.GetParameter(\"hsgrData\"),\n            base_path\n    );\n\n    boost::filesystem::path ram_index_path = boost::filesystem::absolute(\n            serverConfig.GetParameter(\"ramIndex\"),\n            base_path\n    );\n\n    boost::filesystem::path file_index_path = boost::filesystem::absolute(\n            serverConfig.GetParameter(\"fileIndex\"),\n            base_path\n    );\n\n    boost::filesystem::path node_data_path = boost::filesystem::absolute(\n            serverConfig.GetParameter(\"nodesData\"),\n            base_path\n    );\n    boost::filesystem::path edge_data_path = boost::filesystem::absolute(\n            serverConfig.GetParameter(\"edgesData\"),\n            base_path\n    );\n    boost::filesystem::path name_data_path = boost::filesystem::absolute(\n            serverConfig.GetParameter(\"namesData\"),\n            base_path\n    );\n    boost::filesystem::path timestamp_path = boost::filesystem::absolute(\n            serverConfig.GetParameter(\"timestamp\"),\n            base_path\n    );\n\n    objects = new QueryObjectsStorage(\n        hsgr_path.string(),\n        ram_index_path.string(),\n        file_index_path.string(),\n        node_data_path.string(),\n        edge_data_path.string(),\n        name_data_path.string(),\n        timestamp_path.string()\n    );\n\n    RegisterPlugin(new HelloWorldPlugin());\n    RegisterPlugin(new LocatePlugin(objects));\n    RegisterPlugin(new NearestPlugin(objects));\n    RegisterPlugin(new TimestampPlugin(objects));\n    RegisterPlugin(new ViaRoutePlugin(objects));\n}\n\nOSRM::~OSRM() {\n    BOOST_FOREACH(PluginMap::value_type & plugin_pointer, pluginMap) {\n        delete plugin_pointer.second;\n    }\n    delete objects;\n}\n\nvoid OSRM::RegisterPlugin(BasePlugin * plugin) {\n    SimpleLogger().Write()  << \"loaded plugin: \" << plugin->GetDescriptor();\n    if( pluginMap.find(plugin->GetDescriptor()) != pluginMap.end() ) {\n        delete pluginMap[plugin->GetDescriptor()];\n    }\n    pluginMap.insert(std::make_pair(plugin->GetDescriptor(), plugin));\n}\n\nvoid OSRM::RunQuery(RouteParameters & route_parameters, http::Reply & reply) {\n    const PluginMap::const_iterator & iter = pluginMap.find(route_parameters.service);\n    if(pluginMap.end() != iter) {\n        reply.status = http::Reply::ok;\n        iter->second->HandleRequest(route_parameters, reply );\n    } else {\n        reply = http::Reply::stockReply(http::Reply::badRequest);\n    }\n}\n<commit_msg>Fixing coverity issue<commit_after>\/*\n    open source routing machine\n    Copyright (C) Dennis Luxen, 2010\n\nThis program is free software; you can redistribute it and\/or modify\nit under the terms of the GNU AFFERO General Public License as published by\nthe Free Software Foundation; either version 3 of the License, or\nany later version.\n\nThis program is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\nGNU General Public License for more details.\n\nYou should have received a copy of the GNU Affero General Public License\nalong with this program; if not, write to the Free Software\nFoundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA\nor see http:\/\/www.gnu.org\/licenses\/agpl.txt.\n *\/\n\n#include \"OSRM.h\"\n\nOSRM::OSRM(const char * server_ini_path) {\n    if( !testDataFile(server_ini_path) ){\n        std::string error_message = std::string(server_ini_path) + \" not found\";\n        throw OSRMException(error_message.c_str());\n    }\n\n    IniFile serverConfig(server_ini_path);\n\n    boost::filesystem::path base_path =\n               boost::filesystem::absolute(server_ini_path).parent_path();\n\n    if ( !serverConfig.Holds(\"hsgrData\")) {\n        throw OSRMException(\"no ram index file name in server ini\");\n    }\n    if ( !serverConfig.Holds(\"ramIndex\") ) {\n        throw OSRMException(\"no mem index file name in server ini\");\n    }\n    if ( !serverConfig.Holds(\"fileIndex\") ) {\n        throw OSRMException(\"no nodes file name in server ini\");\n    }\n    if ( !serverConfig.Holds(\"nodesData\") ) {\n        throw OSRMException(\"no nodes file name in server ini\");\n    }\n    if ( !serverConfig.Holds(\"edgesData\") ) {\n        throw OSRMException(\"no edges file name in server ini\");\n    }\n\n    boost::filesystem::path hsgr_path = boost::filesystem::absolute(\n            serverConfig.GetParameter(\"hsgrData\"),\n            base_path\n    );\n\n    boost::filesystem::path ram_index_path = boost::filesystem::absolute(\n            serverConfig.GetParameter(\"ramIndex\"),\n            base_path\n    );\n\n    boost::filesystem::path file_index_path = boost::filesystem::absolute(\n            serverConfig.GetParameter(\"fileIndex\"),\n            base_path\n    );\n\n    boost::filesystem::path node_data_path = boost::filesystem::absolute(\n            serverConfig.GetParameter(\"nodesData\"),\n            base_path\n    );\n    boost::filesystem::path edge_data_path = boost::filesystem::absolute(\n            serverConfig.GetParameter(\"edgesData\"),\n            base_path\n    );\n    boost::filesystem::path name_data_path = boost::filesystem::absolute(\n            serverConfig.GetParameter(\"namesData\"),\n            base_path\n    );\n    boost::filesystem::path timestamp_path = boost::filesystem::absolute(\n            serverConfig.GetParameter(\"timestamp\"),\n            base_path\n    );\n\n    objects = new QueryObjectsStorage(\n        hsgr_path.string(),\n        ram_index_path.string(),\n        file_index_path.string(),\n        node_data_path.string(),\n        edge_data_path.string(),\n        name_data_path.string(),\n        timestamp_path.string()\n    );\n\n    RegisterPlugin(new HelloWorldPlugin());\n    RegisterPlugin(new LocatePlugin(objects));\n    RegisterPlugin(new NearestPlugin(objects));\n    RegisterPlugin(new TimestampPlugin(objects));\n    RegisterPlugin(new ViaRoutePlugin(objects));\n}\n\nOSRM::~OSRM() {\n    BOOST_FOREACH(PluginMap::value_type & plugin_pointer, pluginMap) {\n        delete plugin_pointer.second;\n    }\n    delete objects;\n}\n\nvoid OSRM::RegisterPlugin(BasePlugin * plugin) {\n    SimpleLogger().Write()  << \"loaded plugin: \" << plugin->GetDescriptor();\n    if( pluginMap.find(plugin->GetDescriptor()) != pluginMap.end() ) {\n        delete pluginMap.find(plugin->GetDescriptor())->second;\n    }\n    pluginMap.emplace(plugin->GetDescriptor(), plugin);\n}\n\nvoid OSRM::RunQuery(RouteParameters & route_parameters, http::Reply & reply) {\n    const PluginMap::const_iterator & iter = pluginMap.find(route_parameters.service);\n    if(pluginMap.end() != iter) {\n        reply.status = http::Reply::ok;\n        iter->second->HandleRequest(route_parameters, reply );\n    } else {\n        reply = http::Reply::stockReply(http::Reply::badRequest);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: SlsPageSelector.cxx,v $\n *\n *  $Revision: 1.10 $\n *\n *  last change: $Author: kz $ $Date: 2008-04-03 14:26:44 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n#include \"precompiled_sd.hxx\"\n\n#include \"controller\/SlsPageSelector.hxx\"\n\n#include \"SlideSorter.hxx\"\n#include \"SlideSorterViewShell.hxx\"\n#include \"controller\/SlideSorterController.hxx\"\n#include \"controller\/SlsSelectionManager.hxx\"\n#include \"model\/SlsPageDescriptor.hxx\"\n#include \"model\/SlsPageEnumerationProvider.hxx\"\n#include \"model\/SlideSorterModel.hxx\"\n#include \"view\/SlideSorterView.hxx\"\n\n#include \"sdpage.hxx\"\n#include \"ViewShell.hxx\"\n#include \"DrawViewShell.hxx\"\n#include \"ViewShellBase.hxx\"\n\n#ifndef _COM_SUN_STAR_DRAWING_XDRAWVIEW_HPP_\n#include <com\/sun\/star\/drawing\/XDrawView.hpp>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_XPROPERTYSET_HPP_\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#endif\n\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::sd::slidesorter::model;\nusing namespace ::sd::slidesorter::view;\n\nnamespace sd { namespace slidesorter { namespace controller {\n\n\nPageSelector::PageSelector (SlideSorter& rSlideSorter)\n    : mrModel(rSlideSorter.GetModel()),\n      mrSlideSorter(rSlideSorter),\n      mrController(mrSlideSorter.GetController()),\n      mnSelectedPageCount(0),\n      mnBroadcastDisableLevel(0),\n      mbSelectionChangeBroadcastPending(false),\n      mpMostRecentlySelectedPage(),\n      mpSelectionAnchor()\n{\n    CountSelectedPages ();\n}\n\n\n\n\nvoid PageSelector::SelectAllPages (void)\n{\n    int nPageCount = mrModel.GetPageCount();\n    for (int nPageIndex=0; nPageIndex<nPageCount; nPageIndex++)\n        SelectPage (nPageIndex);\n}\n\n\n\n\nvoid PageSelector::DeselectAllPages (void)\n{\n    int nPageCount = mrModel.GetPageCount();\n    for (int nPageIndex=0; nPageIndex<nPageCount; nPageIndex++)\n        DeselectPage (nPageIndex);\n    DBG_ASSERT (mnSelectedPageCount==0,\n        \"PageSelector::DeselectAllPages: the selected pages counter is not 0\");\n    mnSelectedPageCount = 0;\n    mpMostRecentlySelectedPage.reset();\n    mpSelectionAnchor.reset();\n}\n\n\n\n\nvoid PageSelector::UpdateAllPages (void)\n{\n    bool bSelectionHasChanged (true);\n    mnSelectedPageCount = 0;\n    model::PageEnumeration aAllPages (\n        model::PageEnumerationProvider::CreateAllPagesEnumeration(mrModel));\n    while (aAllPages.HasMoreElements())\n    {\n        model::SharedPageDescriptor pDescriptor (aAllPages.GetNextElement());\n        if (pDescriptor->UpdateSelection())\n        {\n            mrSlideSorter.GetView().RequestRepaint(pDescriptor);\n            bSelectionHasChanged = true;\n        }\n\n        if (pDescriptor->IsSelected())\n            mnSelectedPageCount++;\n    }\n\n    if (bSelectionHasChanged)\n        if (mnBroadcastDisableLevel > 0)\n            mbSelectionChangeBroadcastPending = true;\n        else\n            mrController.GetSelectionManager()->SelectionHasChanged();\n}\n\n\n\n\nvoid PageSelector::SelectPage (int nPageIndex)\n{\n    SharedPageDescriptor pDescriptor (mrModel.GetPageDescriptor(nPageIndex));\n    if (pDescriptor.get() != NULL)\n        SelectPage(pDescriptor);\n}\n\n\n\n\nvoid PageSelector::SelectPage (const SdPage* pPage)\n{\n    int nPageIndex = (pPage->GetPageNum()-1) \/ 2;\n    SharedPageDescriptor pDescriptor (mrModel.GetPageDescriptor(nPageIndex));\n    if (pDescriptor.get()!=NULL && pDescriptor->GetPage()==pPage)\n        SelectPage(pDescriptor);\n}\n\n\n\n\nvoid PageSelector::SelectPage (const SharedPageDescriptor& rpDescriptor)\n{\n    if (rpDescriptor.get()!=NULL && rpDescriptor->Select())\n    {\n        mnSelectedPageCount ++;\n        mrSlideSorter.GetView().RequestRepaint(rpDescriptor);\n\n        mpMostRecentlySelectedPage = rpDescriptor;\n        if (mpSelectionAnchor == NULL)\n            mpSelectionAnchor = rpDescriptor;\n\n        if (mnBroadcastDisableLevel > 0)\n            mbSelectionChangeBroadcastPending = true;\n        else\n            mrController.GetSelectionManager()->SelectionHasChanged();\n    }\n}\n\n\n\n\nvoid PageSelector::DeselectPage (int nPageIndex)\n{\n    model::SharedPageDescriptor pDescriptor (mrModel.GetPageDescriptor(nPageIndex));\n    if (pDescriptor.get() != NULL)\n        DeselectPage(pDescriptor);\n}\n\n\n\n\nvoid PageSelector::DeselectPage (const SdPage* pPage)\n{\n    int nPageIndex = (pPage->GetPageNum()-1) \/ 2;\n    SharedPageDescriptor pDescriptor (mrModel.GetPageDescriptor(nPageIndex));\n    if (pDescriptor.get()!=NULL && pDescriptor->GetPage()==pPage)\n        DeselectPage(pDescriptor);\n}\n\n\n\n\nvoid PageSelector::DeselectPage (const SharedPageDescriptor& rpDescriptor)\n{\n    if (rpDescriptor.get()!=NULL && rpDescriptor->Deselect())\n    {\n        mnSelectedPageCount --;\n        mrSlideSorter.GetView().RequestRepaint(rpDescriptor);\n        if (mpMostRecentlySelectedPage == rpDescriptor)\n            mpMostRecentlySelectedPage.reset();\n        if (mnBroadcastDisableLevel > 0)\n            mbSelectionChangeBroadcastPending = true;\n        else\n            mrController.GetSelectionManager()->SelectionHasChanged();\n    }\n}\n\n\n\n\nbool PageSelector::IsPageSelected (int nPageIndex)\n{\n    SharedPageDescriptor pDescriptor (mrModel.GetPageDescriptor(nPageIndex));\n    if (pDescriptor.get() != NULL)\n        return pDescriptor->IsSelected();\n    else\n        return false;\n}\n\n\n\n\nint PageSelector::GetPageCount (void) const\n{\n    return mrModel.GetPageCount();\n}\n\n\n\n\nint PageSelector::GetSelectedPageCount (void) const\n{\n    return mnSelectedPageCount;\n}\n\n\n\n\nvoid PageSelector::PrepareModelChange (void)\n{\n    DeselectAllPages ();\n}\n\n\n\n\nvoid PageSelector::HandleModelChange (void)\n{\n    UpdateAllPages();\n}\n\n\n\n\nSharedPageDescriptor PageSelector::GetMostRecentlySelectedPage (void) const\n{\n    return mpMostRecentlySelectedPage;\n}\n\n\n\n\nSharedPageDescriptor PageSelector::GetSelectionAnchor (void) const\n{\n    return mpSelectionAnchor;\n}\n\n\n\n\nvoid PageSelector::CountSelectedPages (void)\n{\n    mnSelectedPageCount = 0;\n    model::PageEnumeration aSelectedPages (\n        model::PageEnumerationProvider::CreateSelectedPagesEnumeration(mrModel));\n    while (aSelectedPages.HasMoreElements())\n    {\n        mnSelectedPageCount++;\n        aSelectedPages.GetNextElement();\n    }\n}\n\n\n\n\nvoid PageSelector::EnableBroadcasting (bool bMakeSelectionVisible)\n{\n    if (mnBroadcastDisableLevel > 0)\n        mnBroadcastDisableLevel --;\n    if (mnBroadcastDisableLevel==0 && mbSelectionChangeBroadcastPending)\n    {\n        mrController.GetSelectionManager()->SelectionHasChanged(bMakeSelectionVisible);\n        mbSelectionChangeBroadcastPending = false;\n    }\n}\n\n\n\n\nvoid PageSelector::DisableBroadcasting (void)\n{\n    mnBroadcastDisableLevel ++;\n}\n\n\n\n\n::boost::shared_ptr<PageSelector::PageSelection> PageSelector::GetPageSelection (void) const\n{\n    ::boost::shared_ptr<PageSelection> pSelection (new PageSelection());\n    pSelection->reserve(GetSelectedPageCount());\n\n    int nPageCount = GetPageCount();\n    for (int nIndex=0; nIndex<nPageCount; nIndex++)\n    {\n        SharedPageDescriptor pDescriptor (mrModel.GetPageDescriptor(nIndex));\n        if (pDescriptor.get()!=NULL && pDescriptor->IsSelected())\n            pSelection->push_back(pDescriptor->GetPage());\n    }\n\n    return pSelection;\n}\n\n\n\n\nvoid PageSelector::SetPageSelection (const ::boost::shared_ptr<PageSelection>& rpSelection)\n{\n    PageSelection::const_iterator iPage;\n    for (iPage=rpSelection->begin(); iPage!=rpSelection->end(); ++iPage)\n        SelectPage(*iPage);\n}\n\n\n\n\n} } } \/\/ end of namespace ::sd::slidesorter::controller\n<commit_msg>INTEGRATION: CWS changefileheader (1.9.232); FILE MERGED 2008\/04\/01 12:39:17 thb 1.9.232.2: #i85898# Stripping all external header guards 2008\/03\/31 13:58:47 rt 1.9.232.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: SlsPageSelector.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#include \"precompiled_sd.hxx\"\n\n#include \"controller\/SlsPageSelector.hxx\"\n\n#include \"SlideSorter.hxx\"\n#include \"SlideSorterViewShell.hxx\"\n#include \"controller\/SlideSorterController.hxx\"\n#include \"controller\/SlsSelectionManager.hxx\"\n#include \"model\/SlsPageDescriptor.hxx\"\n#include \"model\/SlsPageEnumerationProvider.hxx\"\n#include \"model\/SlideSorterModel.hxx\"\n#include \"view\/SlideSorterView.hxx\"\n\n#include \"sdpage.hxx\"\n#include \"ViewShell.hxx\"\n#include \"DrawViewShell.hxx\"\n#include \"ViewShellBase.hxx\"\n#include <com\/sun\/star\/drawing\/XDrawView.hpp>\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::sd::slidesorter::model;\nusing namespace ::sd::slidesorter::view;\n\nnamespace sd { namespace slidesorter { namespace controller {\n\n\nPageSelector::PageSelector (SlideSorter& rSlideSorter)\n    : mrModel(rSlideSorter.GetModel()),\n      mrSlideSorter(rSlideSorter),\n      mrController(mrSlideSorter.GetController()),\n      mnSelectedPageCount(0),\n      mnBroadcastDisableLevel(0),\n      mbSelectionChangeBroadcastPending(false),\n      mpMostRecentlySelectedPage(),\n      mpSelectionAnchor()\n{\n    CountSelectedPages ();\n}\n\n\n\n\nvoid PageSelector::SelectAllPages (void)\n{\n    int nPageCount = mrModel.GetPageCount();\n    for (int nPageIndex=0; nPageIndex<nPageCount; nPageIndex++)\n        SelectPage (nPageIndex);\n}\n\n\n\n\nvoid PageSelector::DeselectAllPages (void)\n{\n    int nPageCount = mrModel.GetPageCount();\n    for (int nPageIndex=0; nPageIndex<nPageCount; nPageIndex++)\n        DeselectPage (nPageIndex);\n    DBG_ASSERT (mnSelectedPageCount==0,\n        \"PageSelector::DeselectAllPages: the selected pages counter is not 0\");\n    mnSelectedPageCount = 0;\n    mpMostRecentlySelectedPage.reset();\n    mpSelectionAnchor.reset();\n}\n\n\n\n\nvoid PageSelector::UpdateAllPages (void)\n{\n    bool bSelectionHasChanged (true);\n    mnSelectedPageCount = 0;\n    model::PageEnumeration aAllPages (\n        model::PageEnumerationProvider::CreateAllPagesEnumeration(mrModel));\n    while (aAllPages.HasMoreElements())\n    {\n        model::SharedPageDescriptor pDescriptor (aAllPages.GetNextElement());\n        if (pDescriptor->UpdateSelection())\n        {\n            mrSlideSorter.GetView().RequestRepaint(pDescriptor);\n            bSelectionHasChanged = true;\n        }\n\n        if (pDescriptor->IsSelected())\n            mnSelectedPageCount++;\n    }\n\n    if (bSelectionHasChanged)\n        if (mnBroadcastDisableLevel > 0)\n            mbSelectionChangeBroadcastPending = true;\n        else\n            mrController.GetSelectionManager()->SelectionHasChanged();\n}\n\n\n\n\nvoid PageSelector::SelectPage (int nPageIndex)\n{\n    SharedPageDescriptor pDescriptor (mrModel.GetPageDescriptor(nPageIndex));\n    if (pDescriptor.get() != NULL)\n        SelectPage(pDescriptor);\n}\n\n\n\n\nvoid PageSelector::SelectPage (const SdPage* pPage)\n{\n    int nPageIndex = (pPage->GetPageNum()-1) \/ 2;\n    SharedPageDescriptor pDescriptor (mrModel.GetPageDescriptor(nPageIndex));\n    if (pDescriptor.get()!=NULL && pDescriptor->GetPage()==pPage)\n        SelectPage(pDescriptor);\n}\n\n\n\n\nvoid PageSelector::SelectPage (const SharedPageDescriptor& rpDescriptor)\n{\n    if (rpDescriptor.get()!=NULL && rpDescriptor->Select())\n    {\n        mnSelectedPageCount ++;\n        mrSlideSorter.GetView().RequestRepaint(rpDescriptor);\n\n        mpMostRecentlySelectedPage = rpDescriptor;\n        if (mpSelectionAnchor == NULL)\n            mpSelectionAnchor = rpDescriptor;\n\n        if (mnBroadcastDisableLevel > 0)\n            mbSelectionChangeBroadcastPending = true;\n        else\n            mrController.GetSelectionManager()->SelectionHasChanged();\n    }\n}\n\n\n\n\nvoid PageSelector::DeselectPage (int nPageIndex)\n{\n    model::SharedPageDescriptor pDescriptor (mrModel.GetPageDescriptor(nPageIndex));\n    if (pDescriptor.get() != NULL)\n        DeselectPage(pDescriptor);\n}\n\n\n\n\nvoid PageSelector::DeselectPage (const SdPage* pPage)\n{\n    int nPageIndex = (pPage->GetPageNum()-1) \/ 2;\n    SharedPageDescriptor pDescriptor (mrModel.GetPageDescriptor(nPageIndex));\n    if (pDescriptor.get()!=NULL && pDescriptor->GetPage()==pPage)\n        DeselectPage(pDescriptor);\n}\n\n\n\n\nvoid PageSelector::DeselectPage (const SharedPageDescriptor& rpDescriptor)\n{\n    if (rpDescriptor.get()!=NULL && rpDescriptor->Deselect())\n    {\n        mnSelectedPageCount --;\n        mrSlideSorter.GetView().RequestRepaint(rpDescriptor);\n        if (mpMostRecentlySelectedPage == rpDescriptor)\n            mpMostRecentlySelectedPage.reset();\n        if (mnBroadcastDisableLevel > 0)\n            mbSelectionChangeBroadcastPending = true;\n        else\n            mrController.GetSelectionManager()->SelectionHasChanged();\n    }\n}\n\n\n\n\nbool PageSelector::IsPageSelected (int nPageIndex)\n{\n    SharedPageDescriptor pDescriptor (mrModel.GetPageDescriptor(nPageIndex));\n    if (pDescriptor.get() != NULL)\n        return pDescriptor->IsSelected();\n    else\n        return false;\n}\n\n\n\n\nint PageSelector::GetPageCount (void) const\n{\n    return mrModel.GetPageCount();\n}\n\n\n\n\nint PageSelector::GetSelectedPageCount (void) const\n{\n    return mnSelectedPageCount;\n}\n\n\n\n\nvoid PageSelector::PrepareModelChange (void)\n{\n    DeselectAllPages ();\n}\n\n\n\n\nvoid PageSelector::HandleModelChange (void)\n{\n    UpdateAllPages();\n}\n\n\n\n\nSharedPageDescriptor PageSelector::GetMostRecentlySelectedPage (void) const\n{\n    return mpMostRecentlySelectedPage;\n}\n\n\n\n\nSharedPageDescriptor PageSelector::GetSelectionAnchor (void) const\n{\n    return mpSelectionAnchor;\n}\n\n\n\n\nvoid PageSelector::CountSelectedPages (void)\n{\n    mnSelectedPageCount = 0;\n    model::PageEnumeration aSelectedPages (\n        model::PageEnumerationProvider::CreateSelectedPagesEnumeration(mrModel));\n    while (aSelectedPages.HasMoreElements())\n    {\n        mnSelectedPageCount++;\n        aSelectedPages.GetNextElement();\n    }\n}\n\n\n\n\nvoid PageSelector::EnableBroadcasting (bool bMakeSelectionVisible)\n{\n    if (mnBroadcastDisableLevel > 0)\n        mnBroadcastDisableLevel --;\n    if (mnBroadcastDisableLevel==0 && mbSelectionChangeBroadcastPending)\n    {\n        mrController.GetSelectionManager()->SelectionHasChanged(bMakeSelectionVisible);\n        mbSelectionChangeBroadcastPending = false;\n    }\n}\n\n\n\n\nvoid PageSelector::DisableBroadcasting (void)\n{\n    mnBroadcastDisableLevel ++;\n}\n\n\n\n\n::boost::shared_ptr<PageSelector::PageSelection> PageSelector::GetPageSelection (void) const\n{\n    ::boost::shared_ptr<PageSelection> pSelection (new PageSelection());\n    pSelection->reserve(GetSelectedPageCount());\n\n    int nPageCount = GetPageCount();\n    for (int nIndex=0; nIndex<nPageCount; nIndex++)\n    {\n        SharedPageDescriptor pDescriptor (mrModel.GetPageDescriptor(nIndex));\n        if (pDescriptor.get()!=NULL && pDescriptor->IsSelected())\n            pSelection->push_back(pDescriptor->GetPage());\n    }\n\n    return pSelection;\n}\n\n\n\n\nvoid PageSelector::SetPageSelection (const ::boost::shared_ptr<PageSelection>& rpSelection)\n{\n    PageSelection::const_iterator iPage;\n    for (iPage=rpSelection->begin(); iPage!=rpSelection->end(); ++iPage)\n        SelectPage(*iPage);\n}\n\n\n\n\n} } } \/\/ end of namespace ::sd::slidesorter::controller\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: SlideSorterModel.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 06:20:19 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n#ifndef SD_SLIDESORTER_SLIDE_SORTER_MODEL_HXX\n#define SD_SLIDESORTER_SLIDE_SORTER_MODEL_HXX\n\nclass SdDrawDocument;\n\n#include \"SlsPageEnumeration.hxx\"\n\n#ifndef _PRESENTATION_HXX\n#include \"pres.hxx\"\n#endif\n#ifndef _COM_SUN_STAR_DRAWING_XDRAWPAGE_HPP_\n#include <com\/sun\/star\/drawing\/XDrawPage.hpp>\n#endif\n#include <osl\/mutex.hxx>\n\n#include <memory>\n#include <vector>\n#include <functional>\n\nnamespace sd { namespace slidesorter { namespace controller {\nclass PageObjectFactory;\n} } }\n\nnamespace sd { namespace slidesorter { namespace model {\n\nclass DocumentPageContainer;\nclass PageDescriptor;\nclass PageEnumeration;\n\nclass SlideSorterModel\n{\npublic:\n    typedef PageEnumeration Enumeration;\n\n    SlideSorterModel (SdDrawDocument& rDocument,\n        PageKind ePageKind = PK_STANDARD,\n        EditMode eEditMode= EM_PAGE);\n\n    virtual ~SlideSorterModel (void);\n\n    \/** This method is present to let the view create a ShowView for\n        displaying slides.\n    *\/\n    SdDrawDocument* GetDocument (void);\n\n    \/** Set a new edit mode and return whether the edit mode really\n        has been changed.  When the edit mode is changed then the\n        previous page descriptor list is replaced by a new one which\n        has to be repainted.\n        @return\n            A return value of <TRUE\/> indicates that the edit mode has\n            changed and thus the page descriptor list has been set up\n            to reflect that change.  A repaint is necessary.\n    *\/\n    bool SetEditMode (EditMode eEditMode);\n    EditMode GetEditMode (void) const;\n    PageKind GetPageType (void) const;\n\n    int GetPageCount (void) const;\n\n    \/** Return a page descriptor for the page with the specified index.\n        Page descriptors are created on demand.  The page descriptor is\n        found (or not found) in constant time.\n        @return\n            When the given index is not valid, i.e. lower then zero or\n            larger than or equal to the number of pages as returned by\n            GetPageCount() then NULL is returned. Note that the page count\n            may change between subsequent calls to GetPageCount() and\n            GetPageDescriptor().\n    *\/\n    PageDescriptor* GetPageDescriptor (int nPageIndex) const;\n\n    \/** Return the page descriptor for the page with the specified index.\n        In contrast to GetPageDescriptor() this method does not create a\n        page descriptor when not already present.  This method exists mainly\n        for debugging so use it only when you know what you are doing.\n    *\/\n    PageDescriptor* GetRawPageDescriptor (int nPageIndex) const;\n\n    \/** Return the page descriptor whose page has the given object as UNO\n        wrapper.  This method takes linear time (in the number of pages).\n        @return\n            Returns NULL when no page descriptor is found with the given UNO\n            wrapper.\n    *\/\n    PageDescriptor* FindPageDescriptor (\n        const ::com::sun::star::uno::Reference<\n            ::com::sun::star::drawing::XDrawPage>& rxPage) const;\n\n    Enumeration GetAllPagesEnumeration (void) const;\n    Enumeration GetSelectedPagesEnumeration (void) const;\n    Enumeration GetVisiblePagesEnumeration (void) const;\n\n    \/** Call this method after the document has changed its structure.  This\n        will get the model in sync with the SdDrawDocument.  This method\n        tries not to throw away to much information already gathered.  This\n        is especially important for previews of complex pages that take some\n        time to create.\n    *\/\n    void Resync (void);\n\n    \/** Set the selection of the document to exactly that of the called model.\n    *\/\n    void SynchronizeDocumentSelection (void);\n\n    \/** Set the selection of the called model to exactly that of the document.\n    *\/\n    void SynchronizeModelSelection (void);\n\n    \/** Replace the factory for the creation of the page objects and\n        contacts with the given object.  The old factory is destroyed.\n    *\/\n    void SetPageObjectFactory(\n        ::std::auto_ptr<controller::PageObjectFactory> pPageObjectFactory);\n\n    \/** Return the page object factory.  It none has been set so far or it\n        has been reset, then a new one is created.\n    *\/\n    const controller::PageObjectFactory& GetPageObjectFactory (void) const;\n\n    \/** Return the mutex so that the caller can lock it and then safely\n        access the model.\n    *\/\n    ::osl::Mutex& GetMutex (void);\n\nprivate:\n    mutable ::osl::Mutex maMutex;\n    typedef ::std::vector<PageDescriptor*> DescriptorContainer;\n    SdDrawDocument& mrDocument;\n    PageKind mePageKind;\n    EditMode meEditMode;\n    mutable DescriptorContainer maPageDescriptors;\n    mutable ::std::auto_ptr<controller::PageObjectFactory> mpPageObjectFactory;\n\n    \/** Resize the descriptor container according to current values of\n        page kind and edit mode.\n    *\/\n    void AdaptSize (void);\n\n    \/** Delete all descriptors that currently are in the container.  The size\n        of the container, however, is not altered.  Use the AdaptSize\n        method for that.\n    *\/\n    void ClearDescriptorList (void);\n};\n\n} } } \/\/ end of namespace ::sd::slidesorter::model\n\n#endif\n<commit_msg>INTEGRATION: CWS impress78 (1.3.84); FILE MERGED 2005\/12\/12 13:02:33 af 1.3.84.1: #i58769# Made AdaptSize() and ClearDescriptorList() public.<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: SlideSorterModel.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: obo $ $Date: 2006-01-19 12:53:16 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n#ifndef SD_SLIDESORTER_SLIDE_SORTER_MODEL_HXX\n#define SD_SLIDESORTER_SLIDE_SORTER_MODEL_HXX\n\nclass SdDrawDocument;\n\n#include \"SlsPageEnumeration.hxx\"\n\n#ifndef _PRESENTATION_HXX\n#include \"pres.hxx\"\n#endif\n#ifndef _COM_SUN_STAR_DRAWING_XDRAWPAGE_HPP_\n#include <com\/sun\/star\/drawing\/XDrawPage.hpp>\n#endif\n#include <osl\/mutex.hxx>\n\n#include <memory>\n#include <vector>\n#include <functional>\n\nnamespace sd { namespace slidesorter { namespace controller {\nclass PageObjectFactory;\n} } }\n\nnamespace sd { namespace slidesorter { namespace model {\n\nclass DocumentPageContainer;\nclass PageDescriptor;\nclass PageEnumeration;\n\nclass SlideSorterModel\n{\npublic:\n    typedef PageEnumeration Enumeration;\n\n    SlideSorterModel (SdDrawDocument& rDocument,\n        PageKind ePageKind = PK_STANDARD,\n        EditMode eEditMode= EM_PAGE);\n\n    virtual ~SlideSorterModel (void);\n\n    \/** This method is present to let the view create a ShowView for\n        displaying slides.\n    *\/\n    SdDrawDocument* GetDocument (void);\n\n    \/** Set a new edit mode and return whether the edit mode really\n        has been changed.  When the edit mode is changed then the\n        previous page descriptor list is replaced by a new one which\n        has to be repainted.\n        @return\n            A return value of <TRUE\/> indicates that the edit mode has\n            changed and thus the page descriptor list has been set up\n            to reflect that change.  A repaint is necessary.\n    *\/\n    bool SetEditMode (EditMode eEditMode);\n    EditMode GetEditMode (void) const;\n    PageKind GetPageType (void) const;\n\n    int GetPageCount (void) const;\n\n    \/** Return a page descriptor for the page with the specified index.\n        Page descriptors are created on demand.  The page descriptor is\n        found (or not found) in constant time.\n        @return\n            When the given index is not valid, i.e. lower then zero or\n            larger than or equal to the number of pages as returned by\n            GetPageCount() then NULL is returned. Note that the page count\n            may change between subsequent calls to GetPageCount() and\n            GetPageDescriptor().\n    *\/\n    PageDescriptor* GetPageDescriptor (int nPageIndex) const;\n\n    \/** Return the page descriptor for the page with the specified index.\n        In contrast to GetPageDescriptor() this method does not create a\n        page descriptor when not already present.  This method exists mainly\n        for debugging so use it only when you know what you are doing.\n    *\/\n    PageDescriptor* GetRawPageDescriptor (int nPageIndex) const;\n\n    \/** Return the page descriptor whose page has the given object as UNO\n        wrapper.  This method takes linear time (in the number of pages).\n        @return\n            Returns NULL when no page descriptor is found with the given UNO\n            wrapper.\n    *\/\n    PageDescriptor* FindPageDescriptor (\n        const ::com::sun::star::uno::Reference<\n            ::com::sun::star::drawing::XDrawPage>& rxPage) const;\n\n    Enumeration GetAllPagesEnumeration (void) const;\n    Enumeration GetSelectedPagesEnumeration (void) const;\n    Enumeration GetVisiblePagesEnumeration (void) const;\n\n    \/** Call this method after the document has changed its structure.  This\n        will get the model in sync with the SdDrawDocument.  This method\n        tries not to throw away to much information already gathered.  This\n        is especially important for previews of complex pages that take some\n        time to create.\n    *\/\n    void Resync (void);\n\n    \/** Resize the descriptor container according to current values of\n        page kind and edit mode.\n    *\/\n    void AdaptSize (void);\n\n    \/** Delete all descriptors that currently are in the container.  The size\n        of the container, however, is not altered.  Use the AdaptSize\n        method for that.\n    *\/\n    void ClearDescriptorList (void);\n\n    \/** Set the selection of the document to exactly that of the called model.\n    *\/\n    void SynchronizeDocumentSelection (void);\n\n    \/** Set the selection of the called model to exactly that of the document.\n    *\/\n    void SynchronizeModelSelection (void);\n\n    \/** Replace the factory for the creation of the page objects and\n        contacts with the given object.  The old factory is destroyed.\n    *\/\n    void SetPageObjectFactory(\n        ::std::auto_ptr<controller::PageObjectFactory> pPageObjectFactory);\n\n    \/** Return the page object factory.  It none has been set so far or it\n        has been reset, then a new one is created.\n    *\/\n    const controller::PageObjectFactory& GetPageObjectFactory (void) const;\n\n    \/** Return the mutex so that the caller can lock it and then safely\n        access the model.\n    *\/\n    ::osl::Mutex& GetMutex (void);\n\nprivate:\n    mutable ::osl::Mutex maMutex;\n    typedef ::std::vector<PageDescriptor*> DescriptorContainer;\n    SdDrawDocument& mrDocument;\n    PageKind mePageKind;\n    EditMode meEditMode;\n    mutable DescriptorContainer maPageDescriptors;\n    mutable ::std::auto_ptr<controller::PageObjectFactory> mpPageObjectFactory;\n\n};\n\n} } } \/\/ end of namespace ::sd::slidesorter::model\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: dispatchwatcher.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 _DESKTOP_DISPATCHWATCHER_HXX\n#define _DESKTOP_DISPATCHWATCHER_HXX\n\n#include <cppuhelper\/implbase1.hxx>\n#include <com\/sun\/star\/frame\/XNotifyingDispatch.hpp>\n#include <com\/sun\/star\/frame\/XDispatchResultListener.hpp>\n\n#include \"officeipcthread.hxx\"\n#include <hash_map>\n#include <vector>\n\nnamespace desktop\n{\n\n\/*\n    Class for controlls dispatching of command URL through office command line. There\n    are \"dangerous\" command URLs, that can result in a running office without UI. To prevent\n    this situation the implementation surveile all dispatches and looks for an open task if\n    there is arose a problem. If there is none the office will be shutdown to prevent a\n    running office without UI.\n*\/\n\nstruct OUStringHashCode\n{\n    size_t operator()( const ::rtl::OUString& sString ) const\n    {\n        return sString.hashCode();\n    }\n};\n\nclass DispatchWatcherHashMap : public ::std::hash_map< ::rtl::OUString, sal_Int32, OUStringHashCode, ::std::equal_to< ::rtl::OUString > >\n{\n    public:\n        inline void free()\n        {\n            DispatchWatcherHashMap().swap( *this );\n        }\n};\n\nclass DispatchWatcher : public ::cppu::WeakImplHelper1< ::com::sun::star::frame::XDispatchResultListener >\n{\n    public:\n        enum RequestType\n        {\n            REQUEST_OPEN,\n            REQUEST_VIEW,\n            REQUEST_START,\n            REQUEST_PRINT,\n            REQUEST_PRINTTO,\n            REQUEST_FORCEOPEN,\n            REQUEST_FORCENEW\n        };\n\n        struct DispatchRequest\n        {\n            DispatchRequest( RequestType aType, const ::rtl::OUString& aFile, const ::rtl::OUString& aPrinter, const ::rtl::OUString& aFact ) :\n                aRequestType( aType ), aURL( aFile ), aPrinterName( aPrinter ), aPreselectedFactory( aFact ) {}\n\n            RequestType     aRequestType;\n            rtl::OUString   aURL;\n            rtl::OUString   aPrinterName;\n            rtl::OUString   aPreselectedFactory;\n        };\n\n        typedef std::vector< DispatchRequest > DispatchList;\n\n        virtual ~DispatchWatcher();\n\n        \/\/ XEventListener\n        virtual void SAL_CALL disposing( const ::com::sun::star::lang::EventObject& Source )\n            throw(::com::sun::star::uno::RuntimeException);\n\n        \/\/ XDispachResultListener\n        virtual void SAL_CALL dispatchFinished( const com::sun::star::frame::DispatchResultEvent& aEvent ) throw( com::sun::star::uno::RuntimeException );\n\n        \/\/ Access function to get a dispatcher watcher reference. There must be a global reference holder\n        static DispatchWatcher* GetDispatchWatcher();\n\n        \/\/ execute new dispatch request\n        sal_Bool executeDispatchRequests( const DispatchList& aDispatches );\n\n    private:\n        DispatchWatcher();\n\n        static ::osl::Mutex&        GetMutex();\n\n        DispatchWatcherHashMap      m_aRequestContainer;\n\n        static ::osl::Mutex*        pWatcherMutex;\n\n        sal_Int16                   m_nRequestCount;\n};\n\n}\n\n#endif \/\/ _DESKTOP_DISPATCHWATCHER_HXX\n<commit_msg>INTEGRATION: CWS sb87 (1.9.356); FILE MERGED 2008\/04\/24 13:21:51 sb 1.9.356.2: RESYNC: (1.9-1.10); FILE MERGED 2008\/04\/09 14:05:49 sb 1.9.356.1: #i87730# in an attempt of consolidation with the new OOO_CWD stuff for Windows, pass the working dir across the pipe between two soffice processes (instead of already making cmd line args absolute at sending side)<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: dispatchwatcher.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 _DESKTOP_DISPATCHWATCHER_HXX\n#define _DESKTOP_DISPATCHWATCHER_HXX\n\n#include <cppuhelper\/implbase1.hxx>\n#include <com\/sun\/star\/frame\/XNotifyingDispatch.hpp>\n#include <com\/sun\/star\/frame\/XDispatchResultListener.hpp>\n\n#include \"officeipcthread.hxx\"\n#include <hash_map>\n#include <vector>\n\nnamespace desktop\n{\n\n\/*\n    Class for controlls dispatching of command URL through office command line. There\n    are \"dangerous\" command URLs, that can result in a running office without UI. To prevent\n    this situation the implementation surveile all dispatches and looks for an open task if\n    there is arose a problem. If there is none the office will be shutdown to prevent a\n    running office without UI.\n*\/\n\nstruct OUStringHashCode\n{\n    size_t operator()( const ::rtl::OUString& sString ) const\n    {\n        return sString.hashCode();\n    }\n};\n\nclass DispatchWatcherHashMap : public ::std::hash_map< ::rtl::OUString, sal_Int32, OUStringHashCode, ::std::equal_to< ::rtl::OUString > >\n{\n    public:\n        inline void free()\n        {\n            DispatchWatcherHashMap().swap( *this );\n        }\n};\n\nclass DispatchWatcher : public ::cppu::WeakImplHelper1< ::com::sun::star::frame::XDispatchResultListener >\n{\n    public:\n        enum RequestType\n        {\n            REQUEST_OPEN,\n            REQUEST_VIEW,\n            REQUEST_START,\n            REQUEST_PRINT,\n            REQUEST_PRINTTO,\n            REQUEST_FORCEOPEN,\n            REQUEST_FORCENEW\n        };\n\n        struct DispatchRequest\n        {\n            DispatchRequest( RequestType aType, const ::rtl::OUString& aFile, boost::optional< rtl::OUString > const & cwdUrl, const ::rtl::OUString& aPrinter, const ::rtl::OUString& aFact ) :\n                aRequestType( aType ), aURL( aFile ), aCwdUrl( cwdUrl ), aPrinterName( aPrinter ), aPreselectedFactory( aFact ) {}\n\n            RequestType     aRequestType;\n            rtl::OUString   aURL;\n            boost::optional< rtl::OUString > aCwdUrl;\n            rtl::OUString   aPrinterName;\n            rtl::OUString   aPreselectedFactory;\n        };\n\n        typedef std::vector< DispatchRequest > DispatchList;\n\n        virtual ~DispatchWatcher();\n\n        \/\/ XEventListener\n        virtual void SAL_CALL disposing( const ::com::sun::star::lang::EventObject& Source )\n            throw(::com::sun::star::uno::RuntimeException);\n\n        \/\/ XDispachResultListener\n        virtual void SAL_CALL dispatchFinished( const com::sun::star::frame::DispatchResultEvent& aEvent ) throw( com::sun::star::uno::RuntimeException );\n\n        \/\/ Access function to get a dispatcher watcher reference. There must be a global reference holder\n        static DispatchWatcher* GetDispatchWatcher();\n\n        \/\/ execute new dispatch request\n        sal_Bool executeDispatchRequests( const DispatchList& aDispatches );\n\n    private:\n        DispatchWatcher();\n\n        static ::osl::Mutex&        GetMutex();\n\n        DispatchWatcherHashMap      m_aRequestContainer;\n\n        static ::osl::Mutex*        pWatcherMutex;\n\n        sal_Int16                   m_nRequestCount;\n};\n\n}\n\n#endif \/\/ _DESKTOP_DISPATCHWATCHER_HXX\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\n * See cxx source for full Copyright notice                               *\/\n\n\/* $Id$ *\/\n\n\/\/\/ \\ingroup macros\n\/\/\/ \\file rootlogon.C\n\/\/\/ \\brief Macro which is run when starting Root in MUON\n\/\/\/\n\/\/\/ It loads the MUON libraries needed for simulation and reconstruction\n\/\/\/ and sets the include path. \n\/\/\/\n\/\/\/ \\author Laurent Aphecetche\n\n{\n  cout << \"Loading MUON libraries ...\" << endl;\n  gROOT->LoadMacro(\"${ALICE_ROOT}\/MUON\/loadlibs.C\");\n  gInterpreter->ProcessLine(\"loadlibs()\");\n    \n  cout << \"Setting include path ...\" << endl;\n  TString includePath = \"-I${ALICE_ROOT}\/STEER \";\n  includePath        += \"-I${ALICE_ROOT}\/STEER\/STEER \";\n  includePath        += \"-I${ALICE_ROOT}\/STEER\/STEERBase \";\n  includePath        += \"-I${ALICE_ROOT}\/STEER\/CDB \";\n  includePath        += \"-I${ALICE_ROOT}\/STEER\/ESD \";\n  includePath        += \"-I${ALICE_ROOT}\/RAW \";\n  includePath        += \"-I${ALICE_ROOT}\/FASTSIM \";\n  includePath        += \"-I${ALICE_ROOT}\/EVGEN \";\n  includePath        += \"-I${ALICE_ROOT}\/SHUTTLE\/TestShuttle \";\n  includePath        += \"-I${ALICE_ROOT}\/ITS \";\n  includePath        += \"-I${ALICE_ROOT}\/MUON \";\n  includePath        += \"-I${ALICE_ROOT}\/MUON\/mapping \";\n  includePath        += \"-I${ALICE_ROOT}\/RAW \";\n  includePath        += \"-I${ALICE_ROOT}\/include \";\n\n  gSystem->SetIncludePath(includePath.Data());\n}\n<commit_msg>Take into account common installation locations for includes<commit_after>\/* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\n * See cxx source for full Copyright notice                               *\/\n\n\/* $Id$ *\/\n\n\/\/\/ \\ingroup macros\n\/\/\/ \\file rootlogon.C\n\/\/\/ \\brief Macro which is run when starting Root in MUON\n\/\/\/\n\/\/\/ It loads the MUON libraries needed for simulation and reconstruction\n\/\/\/ and sets the include path. \n\/\/\/\n\/\/\/ \\author Laurent Aphecetche\n\n{\n  cout << \"Loading MUON libraries ...\" << endl;\n  gROOT->LoadMacro(\"${ALICE_ROOT}\/MUON\/loadlibs.C\");\n  gInterpreter->ProcessLine(\"loadlibs()\");\n    \n  cout << \"Setting include path ...\" << endl;\n  TString includePath = \"-I${ALICE_ROOT}\/STEER \";\n  includePath        += \"-I${ALICE_ROOT}\/STEER\/STEER \";\n  includePath        += \"-I${ALICE_ROOT}\/STEER\/STEERBase \";\n  includePath        += \"-I${ALICE_ROOT}\/STEER\/CDB \";\n  includePath        += \"-I${ALICE_ROOT}\/STEER\/ESD \";\n  includePath        += \"-I${ALICE_ROOT}\/RAW \";\n  includePath        += \"-I${ALICE_ROOT}\/FASTSIM \";\n  includePath        += \"-I${ALICE_ROOT}\/EVGEN \";\n  includePath        += \"-I${ALICE_ROOT}\/SHUTTLE\/TestShuttle \";\n  includePath        += \"-I${ALICE_ROOT}\/ITS \";\n  includePath        += \"-I${ALICE_ROOT}\/MUON \";\n  includePath        += \"-I${ALICE_ROOT}\/MUON\/mapping \";\n  includePath        += \"-I${ALICE_ROOT}\/RAW \";\n  includePath        += \"-I${ALICE_ROOT}\/include \";\n  includePath        += \"-I${ALICE_INSTALL}\/include \";\n  includePath        += \"-I${ALICE_BUILD}\/include \";\n\n  gSystem->SetIncludePath(includePath.Data());\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ BundleActivator.cpp\n\/\/\n\/\/ $Id: \/\/iot\/Main\/Tf\/src\/BundleActivator.cpp#2 $\n\/\/\n\/\/ Copyright (c) 2015, Applied Informatics Software Engineering GmbH.\n\/\/ All rights reserved.\n\/\/\n\/\/ SPDX-License-Identifier: Apache-2.0\n\/\/\n\n\n#include \"Poco\/OSP\/BundleActivator.h\"\n#include \"Poco\/OSP\/BundleContext.h\"\n#include \"Poco\/OSP\/Bundle.h\"\n#include \"Poco\/OSP\/ServiceRegistry.h\"\n#include \"Poco\/OSP\/ServiceRef.h\"\n#include \"Poco\/OSP\/ServiceFinder.h\"\n#include \"Poco\/OSP\/PreferencesService.h\"\n#include \"Poco\/RemotingNG\/ORB.h\"\n#include \"IoT\/Serial\/SerialDeviceImpl.h\"\n#include \"IoT\/Devices\/SerialDeviceServerHelper.h\"\n#include \"Poco\/ClassLibrary.h\"\n#include \"Poco\/Format.h\"\n#include \"Poco\/NumberFormatter.h\"\n#include <vector>\n\n\nusing Poco::OSP::BundleContext;\nusing Poco::OSP::ServiceRegistry;\nusing Poco::OSP::ServiceRef;\nusing Poco::OSP::ServiceFinder;\nusing Poco::OSP::Properties;\nusing Poco::OSP::PreferencesService;\n\n\nnamespace IoT {\nnamespace Serial {\n\n\nclass BundleActivator: public Poco::OSP::BundleActivator\n{\npublic:\n\tBundleActivator()\n\t{\n\t}\n\t\n\t~BundleActivator()\n\t{\n\t}\n\t\n\tvoid createSerialDevice(const std::string& uid, SerialDeviceImpl::SerialPortPtr pSerialPort)\n\t{\n\t\ttypedef Poco::RemotingNG::ServerHelper<IoT::Devices::SerialDevice> ServerHelper;\n\t\t\n\t\tPoco::SharedPtr<IoT::Devices::SerialDevice> pDevice = new SerialDeviceImpl(pSerialPort);\n\t\tstd::string symbolicName = pDevice->getPropertyString(\"symbolicName\");\n\t\tPoco::RemotingNG::Identifiable::ObjectId oid = symbolicName;\n\t\toid += '#';\n\t\toid += uid;\n\t\tServerHelper::RemoteObjectPtr pDeviceRemoteObject = ServerHelper::createRemoteObject(pDevice, oid);\n\t\t\n\t\tProperties props;\n\t\tprops.set(\"io.macchina.device\", oid);\n\t\tprops.set(\"io.macchina.serialport.device\", pSerialPort->device());\n\t\t\n\t\tServiceRef::Ptr pServiceRef = _pContext->registry().registerService(oid, pDeviceRemoteObject, props);\n\t\t_serviceRefs.push_back(pServiceRef);\n\t}\n\t\n\tvoid start(BundleContext::Ptr pContext)\n\t{\n\t\t_pContext = pContext;\n\t\t_pPrefs = ServiceFinder::find<PreferencesService>(pContext);\n\t\t\n\t\tPoco::Util::AbstractConfiguration::Keys keys;\n\t\t_pPrefs->configuration()->keys(\"serial.ports\", keys);\n\t\tint index = 0;\n\t\tfor (std::vector<std::string>::const_iterator it = keys.begin(); it != keys.end(); ++it)\n\t\t{\n\t\t\tstd::string baseKey = \"serial.ports.\";\n\t\t\tbaseKey += *it;\n\n\t\t\tstd::string device = _pPrefs->configuration()->getString(baseKey + \".device\", \"\");\n\t\t\tstd::string params = _pPrefs->configuration()->getString(baseKey + \".params\", \"8N1\");\n\t\t\tint speed = _pPrefs->configuration()->getInt(baseKey + \".speed\", 9600);\n\t\t\n\t\t\ttry\n\t\t\t{\n\t\t\t\tpContext->logger().information(Poco::format(\"Creating serial port for device '%s'.\", device));\n\n\t\t\t\tSerialDeviceImpl::SerialPortPtr pSerialPort = new SerialPort(device, speed, params);\n\t\t\t\tcreateSerialDevice(Poco::NumberFormatter::format(index), pSerialPort);\n\t\t\t}\n\t\t\tcatch (Poco::Exception& exc)\n\t\t\t{\n\t\t\t\tpContext->logger().error(Poco::format(\"Cannot create serial port for device '%s': %s\", device, exc.displayText())); \n\t\t\t}\n\t\t\tindex++;\n\t\t}\n\t}\n\t\t\n\tvoid stop(BundleContext::Ptr pContext)\n\t{\n\t\tfor (std::vector<ServiceRef::Ptr>::iterator it = _serviceRefs.begin(); it != _serviceRefs.end(); ++it)\n\t\t{\n\t\t\t_pContext->registry().unregisterService(*it);\n\t\t}\n\t\t_serviceRefs.clear();\n\t\t_pPrefs = 0;\n\t\t_pContext = 0;\n\t}\n\nprotected:\n\tbool getBoolConfig(const std::string& key)\n\t{\n\t\treturn _pPrefs->configuration()->getBool(key, _pContext->thisBundle()->properties().getBool(key));\n\t}\n\n\tbool getBoolConfig(const std::string& key, bool deflt)\n\t{\n\t\treturn _pPrefs->configuration()->getBool(key, _pContext->thisBundle()->properties().getBool(key, deflt));\n\t}\n\n\tint getIntConfig(const std::string& key)\n\t{\n\t\treturn _pPrefs->configuration()->getInt(key, _pContext->thisBundle()->properties().getInt(key));\n\t}\n\n\tint getIntConfig(const std::string& key, int deflt)\n\t{\n\t\treturn _pPrefs->configuration()->getInt(key, _pContext->thisBundle()->properties().getInt(key, deflt));\n\t}\n\t\n\tstd::string getStringConfig(const std::string& key)\n\t{\n\t\treturn _pPrefs->configuration()->getString(key, _pContext->thisBundle()->properties().getString(key));\n\t}\n\t\n\tstd::string getStringConfig(const std::string& key, const std::string& deflt)\n\t{\n\t\treturn _pPrefs->configuration()->getString(key, _pContext->thisBundle()->properties().getString(key, deflt));\n\t}\n\t\nprivate:\n\tBundleContext::Ptr _pContext;\n\tPreferencesService::Ptr _pPrefs;\n\tstd::vector<ServiceRef::Ptr> _serviceRefs;\n};\n\n\n} } \/\/ namespace IoT::Serial\n\n\nPOCO_BEGIN_MANIFEST(Poco::OSP::BundleActivator)\n\tPOCO_EXPORT_CLASS(IoT::Serial::BundleActivator)\nPOCO_END_MANIFEST\n<commit_msg>removed unnecessary code, fix name<commit_after>\/\/\n\/\/ BundleActivator.cpp\n\/\/\n\/\/ $Id: \/\/iot\/Main\/Tf\/src\/BundleActivator.cpp#2 $\n\/\/\n\/\/ Copyright (c) 2015, Applied Informatics Software Engineering GmbH.\n\/\/ All rights reserved.\n\/\/\n\/\/ SPDX-License-Identifier: Apache-2.0\n\/\/\n\n\n#include \"Poco\/OSP\/BundleActivator.h\"\n#include \"Poco\/OSP\/BundleContext.h\"\n#include \"Poco\/OSP\/Bundle.h\"\n#include \"Poco\/OSP\/ServiceRegistry.h\"\n#include \"Poco\/OSP\/ServiceRef.h\"\n#include \"Poco\/OSP\/ServiceFinder.h\"\n#include \"Poco\/OSP\/PreferencesService.h\"\n#include \"Poco\/RemotingNG\/ORB.h\"\n#include \"IoT\/Serial\/SerialDeviceImpl.h\"\n#include \"IoT\/Devices\/SerialDeviceServerHelper.h\"\n#include \"Poco\/ClassLibrary.h\"\n#include \"Poco\/Format.h\"\n#include \"Poco\/NumberFormatter.h\"\n#include <vector>\n\n\nusing Poco::OSP::BundleContext;\nusing Poco::OSP::ServiceRegistry;\nusing Poco::OSP::ServiceRef;\nusing Poco::OSP::ServiceFinder;\nusing Poco::OSP::Properties;\nusing Poco::OSP::PreferencesService;\n\n\nnamespace IoT {\nnamespace Serial {\n\n\nclass BundleActivator: public Poco::OSP::BundleActivator\n{\npublic:\n\tBundleActivator()\n\t{\n\t}\n\t\n\t~BundleActivator()\n\t{\n\t}\n\t\n\tvoid createSerialDevice(const std::string& uid, SerialDeviceImpl::SerialPortPtr pSerialPort)\n\t{\n\t\ttypedef Poco::RemotingNG::ServerHelper<IoT::Devices::SerialDevice> ServerHelper;\n\t\t\n\t\tPoco::SharedPtr<IoT::Devices::SerialDevice> pDevice = new SerialDeviceImpl(pSerialPort);\n\t\tstd::string symbolicName = pDevice->getPropertyString(\"symbolicName\");\n\t\tPoco::RemotingNG::Identifiable::ObjectId oid = symbolicName;\n\t\toid += '#';\n\t\toid += uid;\n\t\tServerHelper::RemoteObjectPtr pDeviceRemoteObject = ServerHelper::createRemoteObject(pDevice, oid);\n\t\t\n\t\tProperties props;\n\t\tprops.set(\"io.macchina.device\", symbolicName);\n\t\tprops.set(\"io.macchina.serialport.device\", pSerialPort->device());\n\t\t\n\t\tServiceRef::Ptr pServiceRef = _pContext->registry().registerService(oid, pDeviceRemoteObject, props);\n\t\t_serviceRefs.push_back(pServiceRef);\n\t}\n\t\n\tvoid start(BundleContext::Ptr pContext)\n\t{\n\t\t_pContext = pContext;\n\t\t_pPrefs = ServiceFinder::find<PreferencesService>(pContext);\n\t\t\n\t\tPoco::Util::AbstractConfiguration::Keys keys;\n\t\t_pPrefs->configuration()->keys(\"serial.ports\", keys);\n\t\tint index = 0;\n\t\tfor (std::vector<std::string>::const_iterator it = keys.begin(); it != keys.end(); ++it)\n\t\t{\n\t\t\tstd::string baseKey = \"serial.ports.\";\n\t\t\tbaseKey += *it;\n\n\t\t\tstd::string device = _pPrefs->configuration()->getString(baseKey + \".device\", \"\");\n\t\t\tstd::string params = _pPrefs->configuration()->getString(baseKey + \".params\", \"8N1\");\n\t\t\tint speed = _pPrefs->configuration()->getInt(baseKey + \".speed\", 9600);\n\t\t\n\t\t\ttry\n\t\t\t{\n\t\t\t\tpContext->logger().information(Poco::format(\"Creating serial port for device '%s'.\", device));\n\n\t\t\t\tSerialDeviceImpl::SerialPortPtr pSerialPort = new SerialPort(device, speed, params);\n\t\t\t\tcreateSerialDevice(Poco::NumberFormatter::format(index), pSerialPort);\n\t\t\t}\n\t\t\tcatch (Poco::Exception& exc)\n\t\t\t{\n\t\t\t\tpContext->logger().error(Poco::format(\"Cannot create serial port for device '%s': %s\", device, exc.displayText())); \n\t\t\t}\n\t\t\tindex++;\n\t\t}\n\t}\n\t\t\n\tvoid stop(BundleContext::Ptr pContext)\n\t{\n\t\tfor (std::vector<ServiceRef::Ptr>::iterator it = _serviceRefs.begin(); it != _serviceRefs.end(); ++it)\n\t\t{\n\t\t\t_pContext->registry().unregisterService(*it);\n\t\t}\n\t\t_serviceRefs.clear();\n\t\t_pPrefs = 0;\n\t\t_pContext = 0;\n\t}\n\t\nprivate:\n\tBundleContext::Ptr _pContext;\n\tPreferencesService::Ptr _pPrefs;\n\tstd::vector<ServiceRef::Ptr> _serviceRefs;\n};\n\n\n} } \/\/ namespace IoT::Serial\n\n\nPOCO_BEGIN_MANIFEST(Poco::OSP::BundleActivator)\n\tPOCO_EXPORT_CLASS(IoT::Serial::BundleActivator)\nPOCO_END_MANIFEST\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\/\/ <utility>\n\n\/\/ template <class T1, class T2> struct pair\n\n\/\/ struct piecewise_construct_t { };\n\/\/ constexpr piecewise_construct_t piecewise_construct = piecewise_construct_t();\n\n#include <utility>\n\nint main()\n{\n    std::piecewise_construct_t p = std::piecewise_construct;\n}\n<commit_msg>test for pair piecewise construction<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\/\/ <utility>\n\n\/\/ template <class T1, class T2> struct pair\n\n\/\/ struct piecewise_construct_t { };\n\/\/ constexpr piecewise_construct_t piecewise_construct = piecewise_construct_t();\n\n#include <utility>\n#include <tuple>\n#include <cassert>\n\nclass A\n{\n    int i_;\n    char c_;\npublic:\n    A(int i, char c) : i_(i), c_(c) {}\n    int get_i() const {return i_;}\n    char get_c() const {return c_;}\n};\n\nclass B\n{\n    double d_;\n    unsigned u1_;\n    unsigned u2_;\npublic:\n    B(double d, unsigned u1, unsigned u2) : d_(d), u1_(u1), u2_(u2) {}\n    double get_d() const {return d_;}\n    unsigned get_u1() const {return u1_;}\n    unsigned get_u2() const {return u2_;}\n};\n\nint main()\n{\n#ifndef _LIBCPP_HAS_NO_VARIADICS\n    std::pair<A, B> p(std::piecewise_construct,\n                      std::make_tuple(4, 'a'),\n                      std::make_tuple(3.5, 6u, 2u));\n    assert(p.first.get_i() == 4);\n    assert(p.first.get_c() == 'a');\n    assert(p.second.get_d() == 3.5);\n    assert(p.second.get_u1() == 6u);\n    assert(p.second.get_u2() == 2u);\n#endif\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* -*-c++-*-\n *\n * Copyright (C) 2008 Stuart Buchanan\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,\n * MA 02110-1301, USA.\n *\n *\/\n\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <map>\n\n#include <boost\/tuple\/tuple_comparison.hpp>\n\n#include <osg\/AlphaFunc>\n#include <osg\/Billboard>\n#include <osg\/BlendFunc>\n#include <osg\/Geode>\n#include <osg\/Geometry>\n#include <osg\/Material>\n#include <osg\/Math>\n#include <osg\/MatrixTransform>\n#include <osg\/Matrix>\n#include <osg\/StateSet>\n#include <osg\/Texture2D>\n#include <osg\/TexEnv>\n\n#include <osgDB\/ReadFile>\n#include <osgDB\/FileUtils>\n\n#include <simgear\/misc\/sg_path.hxx>\n#include <simgear\/scene\/util\/QuadTreeBuilder.hxx>\n#include <simgear\/scene\/util\/RenderConstants.hxx>\n#include <simgear\/scene\/util\/StateAttributeFactory.hxx>\n\n#include \"ShaderGeometry.hxx\"\n#include \"TreeBin.hxx\"\n\n#define SG_TREE_QUAD_TREE_DEPTH 3\n\n\/\/ Comments from Tim Moore:\n\/\/ Some work remains for this code. Stuart's enhancement for multiple\n\/\/ textures per forest should be integrated. We should try to use one\n\/\/ ShaderGeometry for *all* the trees in the scene graph and do the\n\/\/ rotation and scale with a MatrixTransform above the trees quad\n\/\/ tree. The positions would of course have to be transformed by the\n\/\/ inverse of that transform. Also, we should investigate whether it\n\/\/ would be better to instantiate trees as polygons in a osg::Geometry\n\/\/ object instead of using the ShaderGeometry instancing technique.\n\nusing namespace osg;\n\nnamespace simgear\n{\n\n\/\/ memoize geometry\ntypedef boost::tuple<float, float, int> ForestTuple;\ntypedef std::map<ForestTuple, ref_ptr<Geometry> > OrthQuadMap;\n\nosg::Geometry* createOrthQuads(float w, float h, int varieties, const osg::Matrix& rotate)\n{\n    static OrthQuadMap orthQuadMap;\n    OrthQuadMap::iterator giter\n        = orthQuadMap.find(ForestTuple(w, h, varieties));\n    if (giter != orthQuadMap.end())\n        return giter->second.get();\n\n    \/\/const osg::Vec3& pos = osg::Vec3(0.0f,0.0f,0.0f),\n    \/\/ set up the coords\n    \/\/ Create front and back polygons so we don't need to screw around\n    \/\/ with two-sided lighting in the shader.\n    osg::Vec3Array& v = *(new osg::Vec3Array(8));\n    osg::Vec3Array& n = *(new osg::Vec3Array(8));\n    osg::Vec2Array& t = *(new osg::Vec2Array(8));\n    \n    float cw = w*0.5f;\n\n    v[0].set(0.0f,-cw,0.0f);\n    v[1].set(0.0f, cw,0.0f);\n    v[2].set(0.0f, cw,h);\n    v[3].set(0.0f,-cw,h);\n\n    v[4].set(-cw,0.0f,0.0f);\n    v[5].set( cw,0.0f,0.0f);\n    v[6].set( cw,0.0f,h);\n    v[7].set(-cw,0.0f,h);\n\n    \/\/ The texture coordinate range is not the\n    \/\/ entire coordinate space - as the texture\n    \/\/ has a number of different trees on it.\n    float tx = 1.0f\/varieties;\n\n    t[0].set(0.0f,0.0f);\n    t[1].set(  tx,0.0f);\n    t[2].set(  tx,1.0f);\n    t[3].set(0.0f,1.0f);\n\n    t[4].set(0.0f,0.0f);\n    t[5].set(  tx,0.0f);\n    t[6].set(  tx,1.0f);\n    t[7].set(0.0f,1.0f);\n\n    \/\/ For now the normal is normal to the quad. If we want to get\n    \/\/ fancier and approximate a cylindrical tree or something, then\n    \/\/ we would really want more geometry.\n    std::fill(n.begin(), n.begin() + 4, Vec3f(1.0f, 0.0f, 0.0f));\n    std::fill(n.begin() + 4, n.end(), Vec3f(0.0f, -1.0f, 0.0f));\n    for (unsigned int i = 0; i < 8; i++) {\n        v[i] = v[i] * rotate;\n        \/\/ Should be the inverse transpose, but assume that rotate is\n        \/\/ orthonormal.\n        n[i] = n[i] * rotate;     \n    }\n\n    osg::Geometry *geom = new osg::Geometry;\n\n    geom->setVertexArray(&v);\n    geom->setTexCoordArray(0, &t);\n    geom->setNormalArray(&n);\n    geom->setNormalBinding(Geometry::BIND_PER_VERTEX);\n    \/\/ No color for now; that's used to pass the position.\n    geom->addPrimitiveSet(new osg::DrawArrays(osg::PrimitiveSet::QUADS,0,8));\n\n    orthQuadMap.insert(std::make_pair(ForestTuple(w, h, varieties), geom));\n    return geom;\n}\n\n static char vertexShaderSource[] = \n    \"varying float fogFactor;\\n\"\n    \"attribute float textureIndex;\\n\"\n    \"\\n\"\n    \"void main(void)\\n\"\n    \"{\\n\"\n    \"  gl_TexCoord[0] = gl_MultiTexCoord0 + vec4(textureIndex, 0.0, 0.0, 0.0);\\n\"\n    \"  vec3 position = gl_Vertex.xyz * gl_Color.w + gl_Color.xyz;\\n\"\n    \"  gl_Position   = gl_ModelViewProjectionMatrix * vec4(position,1.0);\\n\"\n    \"  vec3 ecPosition = vec3(gl_ModelViewMatrix * vec4(position, 1.0));\\n\"\n    \"  float n = dot(normalize(gl_LightSource[0].position.xyz), normalize(-ecPosition));\\n\"\n    \"  vec3 diffuse = gl_FrontMaterial.diffuse.rgb * max(0.1, n);\\n\"\n    \"  vec4 ambientColor = gl_FrontLightModelProduct.sceneColor + gl_LightSource[0].ambient * gl_FrontMaterial.ambient;\\n\"\n    \"  gl_FrontColor = ambientColor + gl_LightSource[0].diffuse * vec4(diffuse, 1.0);\\n\"\n    \"  gl_BackColor = gl_FrontColor;\\n\"\n    \"  float fogCoord = abs(ecPosition.z);\\n\"\n    \"  fogFactor = exp( -gl_Fog.density * gl_Fog.density * fogCoord * fogCoord);\\n\"\n    \"  fogFactor = clamp(fogFactor, 0.0, 1.0);\\n\"\n    \"}\\n\";\n\nstatic char fragmentShaderSource[] = \n    \"uniform sampler2D baseTexture; \\n\"\n    \"varying float fogFactor;\\n\"\n    \"\\n\"\n    \"void main(void) \\n\"\n    \"{ \\n\"\n    \"  vec4 base = texture2D( baseTexture, gl_TexCoord[0].st);\\n\"\n    \"  vec4 finalColor = base * gl_Color;\\n\"\n    \"  gl_FragColor = mix(gl_Fog.color, finalColor, fogFactor );\\n\"\n    \"}\\n\";\n\ntypedef std::map<std::string, osg::ref_ptr<StateSet> > StateSetMap;\n\nstatic StateSetMap treeTextureMap;\n\n\/\/ Helper classes for creating the quad tree\nnamespace\n{\nstruct MakeTreesLeaf\n{\n    MakeTreesLeaf(float range, Geometry* geometry, int varieties) :\n        _range(range), _geometry(geometry), _varieties(varieties)\n    {}\n    MakeTreesLeaf(const MakeTreesLeaf& rhs) :\n        _range(rhs._range), _geometry(rhs._geometry), _varieties(rhs._varieties) {}\n    LOD* operator() () const\n    {\n        LOD* result = new LOD;\n        Geode* geode = new Geode;\n        ShaderGeometry* sg = new ShaderGeometry(_varieties);\n        sg->setGeometry(_geometry);\n        geode->addDrawable(sg);\n        result->addChild(geode, 0, _range);\n        return result;\n    }\n    float _range;\n    int _varieties;\n    Geometry* _geometry;\n};\n\nstruct AddTreesLeafObject\n{\n    void operator() (LOD* lod, const TreeBin::Tree& tree) const\n    {\n        Geode* geode = static_cast<Geode*>(lod->getChild(0));\n        ShaderGeometry* sg\n            = static_cast<ShaderGeometry*>(geode->getDrawable(0));\n        sg->addTree(tree);\n    }\n};\n\nstruct GetTreeCoord\n{\n    Vec3 operator() (const TreeBin::Tree& tree) const\n    {\n        return tree.position.osg();\n    }\n};\n\ntypedef QuadTreeBuilder<LOD*, TreeBin::Tree, MakeTreesLeaf, AddTreesLeafObject,\n                        GetTreeCoord> ShaderGeometryQuadtree;\n}\n\nstruct TreeTransformer\n{\n    TreeTransformer(Matrix& mat_) : mat(mat_) {}\n    TreeBin::Tree operator()(const TreeBin::Tree& tree) const\n    {\n        const Vec3& pos = tree.position.osg();\n        return TreeBin::Tree(SGVec3f(pos * mat), tree.texture_index,\n                             tree.scale);\n    }\n    Matrix mat;\n};\n\n\/\/ This actually returns a MatrixTransform node. If we rotate the whole\n\/\/ forest into the local Z-up coordinate system we can reuse the\n\/\/ primitive tree geometry for all the forests of the same type.\n\nosg::Group* createForest(TreeBin& forest, const osg::Matrix& transform)\n{\n    Matrix transInv = Matrix::inverse(transform);\n    static Matrix ident;\n    \/\/ Set up some shared structures. \n    osg::Geometry* shared_geometry = createOrthQuads(forest.width, \n                                                     forest.height, \n                                                     forest.texture_varieties,\n                                                     ident);\n\n    ref_ptr<Group> group;\n\n    osg::StateSet* stateset = 0;\n    StateSetMap::iterator iter = treeTextureMap.find(forest.texture);\n    if (iter == treeTextureMap.end()) {\n        osg::Texture2D *tex = new osg::Texture2D;\n        tex->setWrap( osg::Texture2D::WRAP_S, osg::Texture2D::CLAMP );\n        tex->setWrap( osg::Texture2D::WRAP_T, osg::Texture2D::CLAMP );\n        tex->setImage(osgDB::readImageFile(forest.texture));\n\n        static ref_ptr<AlphaFunc> alphaFunc;\n        static ref_ptr<Program> program;\n        static ref_ptr<Uniform> baseTextureSampler;\n        static ref_ptr<Material> material;\n    \n        stateset = new osg::StateSet;\n        stateset->setTextureAttributeAndModes(0, tex, osg::StateAttribute::ON );\n        stateset->setRenderBinDetails(RANDOM_OBJECTS_BIN, \"DepthSortedBin\");\n        if (!program.valid()) {\n            alphaFunc = new AlphaFunc;\n            alphaFunc->setFunction(AlphaFunc::GEQUAL,0.33f);\n            program  = new Program;\n            baseTextureSampler = new osg::Uniform(\"baseTexture\", 0);\n            Shader* vertex_shader = new Shader(Shader::VERTEX, vertexShaderSource);\n            program->addShader(vertex_shader);\n            program->addBindAttribLocation(\"textureIndex\", 1);\n\n            Shader* fragment_shader = new Shader(Shader::FRAGMENT,\n                                                 fragmentShaderSource);\n            program->addShader(fragment_shader);\n            material = new Material;\n            \/\/ Don´t track vertex color\n            material->setColorMode(Material::OFF);\n            material->setAmbient(Material::FRONT_AND_BACK,\n                                 Vec4(1.0f, 1.0f, 1.0f, 1.0f));\n            material->setDiffuse(Material::FRONT_AND_BACK,\n                                 Vec4(1.0f, 1.0f, 1.0f, 1.0f));\n        }\n        stateset->setAttributeAndModes(alphaFunc.get());\n        stateset->setAttribute(program.get());\n        stateset->addUniform(baseTextureSampler.get());\n        stateset->setMode(GL_VERTEX_PROGRAM_TWO_SIDE, StateAttribute::ON);\n        stateset->setAttribute(material.get());\n\n        treeTextureMap.insert(StateSetMap::value_type(forest.texture,\n                                                      stateset));\n    } else {\n        stateset = iter->second.get();\n    }\n    \/\/ Now, create a quadtree for the forest.\n    {\n        ShaderGeometryQuadtree quadtree(GetTreeCoord(),\n                                        AddTreesLeafObject(),\n                                        SG_TREE_QUAD_TREE_DEPTH,\n                                        MakeTreesLeaf(forest.range,\n                                                      shared_geometry,\n                                                      forest.texture_varieties));\n        \/\/ Transform tree positions from the \"geocentric\" positions we\n        \/\/ get from the scenery polys into the local Z-up coordinate\n        \/\/ system.\n        std::vector<TreeBin::Tree> rotatedTrees;\n        rotatedTrees.reserve(forest._trees.size());\n        std::transform(forest._trees.begin(), forest._trees.end(),\n                       std::back_inserter(rotatedTrees),\n                       TreeTransformer(transInv));\n        quadtree.buildQuadTree(rotatedTrees.begin(), rotatedTrees.end());\n        group = quadtree.getRoot();\n    }\n    MatrixTransform* mt = new MatrixTransform(transform);\n    for (int i = 0; i < group->getNumChildren(); ++i)\n        mt->addChild(group->getChild(i));\n    mt->setStateSet(stateset);\n    return mt;\n}\n\n}\n<commit_msg>Suppress warnings<commit_after>\/* -*-c++-*-\n *\n * Copyright (C) 2008 Stuart Buchanan\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,\n * MA 02110-1301, USA.\n *\n *\/\n\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <map>\n\n#include <boost\/tuple\/tuple_comparison.hpp>\n\n#include <osg\/AlphaFunc>\n#include <osg\/Billboard>\n#include <osg\/BlendFunc>\n#include <osg\/Geode>\n#include <osg\/Geometry>\n#include <osg\/Material>\n#include <osg\/Math>\n#include <osg\/MatrixTransform>\n#include <osg\/Matrix>\n#include <osg\/StateSet>\n#include <osg\/Texture2D>\n#include <osg\/TexEnv>\n\n#include <osgDB\/ReadFile>\n#include <osgDB\/FileUtils>\n\n#include <simgear\/misc\/sg_path.hxx>\n#include <simgear\/scene\/util\/QuadTreeBuilder.hxx>\n#include <simgear\/scene\/util\/RenderConstants.hxx>\n#include <simgear\/scene\/util\/StateAttributeFactory.hxx>\n\n#include \"ShaderGeometry.hxx\"\n#include \"TreeBin.hxx\"\n\n#define SG_TREE_QUAD_TREE_DEPTH 3\n\n\/\/ Comments from Tim Moore:\n\/\/ Some work remains for this code. Stuart's enhancement for multiple\n\/\/ textures per forest should be integrated. We should try to use one\n\/\/ ShaderGeometry for *all* the trees in the scene graph and do the\n\/\/ rotation and scale with a MatrixTransform above the trees quad\n\/\/ tree. The positions would of course have to be transformed by the\n\/\/ inverse of that transform. Also, we should investigate whether it\n\/\/ would be better to instantiate trees as polygons in a osg::Geometry\n\/\/ object instead of using the ShaderGeometry instancing technique.\n\nusing namespace osg;\n\nnamespace simgear\n{\n\n\/\/ memoize geometry\ntypedef boost::tuple<float, float, int> ForestTuple;\ntypedef std::map<ForestTuple, ref_ptr<Geometry> > OrthQuadMap;\n\nosg::Geometry* createOrthQuads(float w, float h, int varieties, const osg::Matrix& rotate)\n{\n    static OrthQuadMap orthQuadMap;\n    OrthQuadMap::iterator giter\n        = orthQuadMap.find(ForestTuple(w, h, varieties));\n    if (giter != orthQuadMap.end())\n        return giter->second.get();\n\n    \/\/const osg::Vec3& pos = osg::Vec3(0.0f,0.0f,0.0f),\n    \/\/ set up the coords\n    \/\/ Create front and back polygons so we don't need to screw around\n    \/\/ with two-sided lighting in the shader.\n    osg::Vec3Array& v = *(new osg::Vec3Array(8));\n    osg::Vec3Array& n = *(new osg::Vec3Array(8));\n    osg::Vec2Array& t = *(new osg::Vec2Array(8));\n    \n    float cw = w*0.5f;\n\n    v[0].set(0.0f,-cw,0.0f);\n    v[1].set(0.0f, cw,0.0f);\n    v[2].set(0.0f, cw,h);\n    v[3].set(0.0f,-cw,h);\n\n    v[4].set(-cw,0.0f,0.0f);\n    v[5].set( cw,0.0f,0.0f);\n    v[6].set( cw,0.0f,h);\n    v[7].set(-cw,0.0f,h);\n\n    \/\/ The texture coordinate range is not the\n    \/\/ entire coordinate space - as the texture\n    \/\/ has a number of different trees on it.\n    float tx = 1.0f\/varieties;\n\n    t[0].set(0.0f,0.0f);\n    t[1].set(  tx,0.0f);\n    t[2].set(  tx,1.0f);\n    t[3].set(0.0f,1.0f);\n\n    t[4].set(0.0f,0.0f);\n    t[5].set(  tx,0.0f);\n    t[6].set(  tx,1.0f);\n    t[7].set(0.0f,1.0f);\n\n    \/\/ For now the normal is normal to the quad. If we want to get\n    \/\/ fancier and approximate a cylindrical tree or something, then\n    \/\/ we would really want more geometry.\n    std::fill(n.begin(), n.begin() + 4, Vec3f(1.0f, 0.0f, 0.0f));\n    std::fill(n.begin() + 4, n.end(), Vec3f(0.0f, -1.0f, 0.0f));\n    for (unsigned int i = 0; i < 8; i++) {\n        v[i] = v[i] * rotate;\n        \/\/ Should be the inverse transpose, but assume that rotate is\n        \/\/ orthonormal.\n        n[i] = n[i] * rotate;     \n    }\n\n    osg::Geometry *geom = new osg::Geometry;\n\n    geom->setVertexArray(&v);\n    geom->setTexCoordArray(0, &t);\n    geom->setNormalArray(&n);\n    geom->setNormalBinding(Geometry::BIND_PER_VERTEX);\n    \/\/ No color for now; that's used to pass the position.\n    geom->addPrimitiveSet(new osg::DrawArrays(osg::PrimitiveSet::QUADS,0,8));\n\n    orthQuadMap.insert(std::make_pair(ForestTuple(w, h, varieties), geom));\n    return geom;\n}\n\n static char vertexShaderSource[] = \n    \"varying float fogFactor;\\n\"\n    \"attribute float textureIndex;\\n\"\n    \"\\n\"\n    \"void main(void)\\n\"\n    \"{\\n\"\n    \"  gl_TexCoord[0] = gl_MultiTexCoord0 + vec4(textureIndex, 0.0, 0.0, 0.0);\\n\"\n    \"  vec3 position = gl_Vertex.xyz * gl_Color.w + gl_Color.xyz;\\n\"\n    \"  gl_Position   = gl_ModelViewProjectionMatrix * vec4(position,1.0);\\n\"\n    \"  vec3 ecPosition = vec3(gl_ModelViewMatrix * vec4(position, 1.0));\\n\"\n    \"  float n = dot(normalize(gl_LightSource[0].position.xyz), normalize(-ecPosition));\\n\"\n    \"  vec3 diffuse = gl_FrontMaterial.diffuse.rgb * max(0.1, n);\\n\"\n    \"  vec4 ambientColor = gl_FrontLightModelProduct.sceneColor + gl_LightSource[0].ambient * gl_FrontMaterial.ambient;\\n\"\n    \"  gl_FrontColor = ambientColor + gl_LightSource[0].diffuse * vec4(diffuse, 1.0);\\n\"\n    \"  gl_BackColor = gl_FrontColor;\\n\"\n    \"  float fogCoord = abs(ecPosition.z);\\n\"\n    \"  fogFactor = exp( -gl_Fog.density * gl_Fog.density * fogCoord * fogCoord);\\n\"\n    \"  fogFactor = clamp(fogFactor, 0.0, 1.0);\\n\"\n    \"}\\n\";\n\nstatic char fragmentShaderSource[] = \n    \"uniform sampler2D baseTexture; \\n\"\n    \"varying float fogFactor;\\n\"\n    \"\\n\"\n    \"void main(void) \\n\"\n    \"{ \\n\"\n    \"  vec4 base = texture2D( baseTexture, gl_TexCoord[0].st);\\n\"\n    \"  vec4 finalColor = base * gl_Color;\\n\"\n    \"  gl_FragColor = mix(gl_Fog.color, finalColor, fogFactor );\\n\"\n    \"}\\n\";\n\ntypedef std::map<std::string, osg::ref_ptr<StateSet> > StateSetMap;\n\nstatic StateSetMap treeTextureMap;\n\n\/\/ Helper classes for creating the quad tree\nnamespace\n{\nstruct MakeTreesLeaf\n{\n    MakeTreesLeaf(float range, Geometry* geometry, int varieties) :\n        _range(range), _geometry(geometry), _varieties(varieties)\n    {}\n    MakeTreesLeaf(const MakeTreesLeaf& rhs) :\n        _range(rhs._range), _geometry(rhs._geometry), _varieties(rhs._varieties) {}\n    LOD* operator() () const\n    {\n        LOD* result = new LOD;\n        Geode* geode = new Geode;\n        ShaderGeometry* sg = new ShaderGeometry(_varieties);\n        sg->setGeometry(_geometry);\n        geode->addDrawable(sg);\n        result->addChild(geode, 0, _range);\n        return result;\n    }\n    float _range;\n    int _varieties;\n    Geometry* _geometry;\n};\n\nstruct AddTreesLeafObject\n{\n    void operator() (LOD* lod, const TreeBin::Tree& tree) const\n    {\n        Geode* geode = static_cast<Geode*>(lod->getChild(0));\n        ShaderGeometry* sg\n            = static_cast<ShaderGeometry*>(geode->getDrawable(0));\n        sg->addTree(tree);\n    }\n};\n\nstruct GetTreeCoord\n{\n    Vec3 operator() (const TreeBin::Tree& tree) const\n    {\n        return tree.position.osg();\n    }\n};\n\ntypedef QuadTreeBuilder<LOD*, TreeBin::Tree, MakeTreesLeaf, AddTreesLeafObject,\n                        GetTreeCoord> ShaderGeometryQuadtree;\n}\n\nstruct TreeTransformer\n{\n    TreeTransformer(Matrix& mat_) : mat(mat_) {}\n    TreeBin::Tree operator()(const TreeBin::Tree& tree) const\n    {\n        const Vec3& pos = tree.position.osg();\n        return TreeBin::Tree(SGVec3f(pos * mat), tree.texture_index,\n                             tree.scale);\n    }\n    Matrix mat;\n};\n\n\/\/ This actually returns a MatrixTransform node. If we rotate the whole\n\/\/ forest into the local Z-up coordinate system we can reuse the\n\/\/ primitive tree geometry for all the forests of the same type.\n\nosg::Group* createForest(TreeBin& forest, const osg::Matrix& transform)\n{\n    Matrix transInv = Matrix::inverse(transform);\n    static Matrix ident;\n    \/\/ Set up some shared structures. \n    osg::Geometry* shared_geometry = createOrthQuads(forest.width, \n                                                     forest.height, \n                                                     forest.texture_varieties,\n                                                     ident);\n\n    ref_ptr<Group> group;\n\n    osg::StateSet* stateset = 0;\n    StateSetMap::iterator iter = treeTextureMap.find(forest.texture);\n    if (iter == treeTextureMap.end()) {\n        osg::Texture2D *tex = new osg::Texture2D;\n        tex->setWrap( osg::Texture2D::WRAP_S, osg::Texture2D::CLAMP );\n        tex->setWrap( osg::Texture2D::WRAP_T, osg::Texture2D::CLAMP );\n        tex->setImage(osgDB::readImageFile(forest.texture));\n\n        static ref_ptr<AlphaFunc> alphaFunc;\n        static ref_ptr<Program> program;\n        static ref_ptr<Uniform> baseTextureSampler;\n        static ref_ptr<Material> material;\n    \n        stateset = new osg::StateSet;\n        stateset->setTextureAttributeAndModes(0, tex, osg::StateAttribute::ON );\n        stateset->setRenderBinDetails(RANDOM_OBJECTS_BIN, \"DepthSortedBin\");\n        if (!program.valid()) {\n            alphaFunc = new AlphaFunc;\n            alphaFunc->setFunction(AlphaFunc::GEQUAL,0.33f);\n            program  = new Program;\n            baseTextureSampler = new osg::Uniform(\"baseTexture\", 0);\n            Shader* vertex_shader = new Shader(Shader::VERTEX, vertexShaderSource);\n            program->addShader(vertex_shader);\n            program->addBindAttribLocation(\"textureIndex\", 1);\n\n            Shader* fragment_shader = new Shader(Shader::FRAGMENT,\n                                                 fragmentShaderSource);\n            program->addShader(fragment_shader);\n            material = new Material;\n            \/\/ Don´t track vertex color\n            material->setColorMode(Material::OFF);\n            material->setAmbient(Material::FRONT_AND_BACK,\n                                 Vec4(1.0f, 1.0f, 1.0f, 1.0f));\n            material->setDiffuse(Material::FRONT_AND_BACK,\n                                 Vec4(1.0f, 1.0f, 1.0f, 1.0f));\n        }\n        stateset->setAttributeAndModes(alphaFunc.get());\n        stateset->setAttribute(program.get());\n        stateset->addUniform(baseTextureSampler.get());\n        stateset->setMode(GL_VERTEX_PROGRAM_TWO_SIDE, StateAttribute::ON);\n        stateset->setAttribute(material.get());\n\n        treeTextureMap.insert(StateSetMap::value_type(forest.texture,\n                                                      stateset));\n    } else {\n        stateset = iter->second.get();\n    }\n    \/\/ Now, create a quadtree for the forest.\n    {\n        ShaderGeometryQuadtree quadtree(GetTreeCoord(),\n                                        AddTreesLeafObject(),\n                                        SG_TREE_QUAD_TREE_DEPTH,\n                                        MakeTreesLeaf(forest.range,\n                                                      shared_geometry,\n                                                      forest.texture_varieties));\n        \/\/ Transform tree positions from the \"geocentric\" positions we\n        \/\/ get from the scenery polys into the local Z-up coordinate\n        \/\/ system.\n        std::vector<TreeBin::Tree> rotatedTrees;\n        rotatedTrees.reserve(forest._trees.size());\n        std::transform(forest._trees.begin(), forest._trees.end(),\n                       std::back_inserter(rotatedTrees),\n                       TreeTransformer(transInv));\n        quadtree.buildQuadTree(rotatedTrees.begin(), rotatedTrees.end());\n        group = quadtree.getRoot();\n    }\n    MatrixTransform* mt = new MatrixTransform(transform);\n    for (size_t i = 0; i < group->getNumChildren(); ++i)\n        mt->addChild(group->getChild(i));\n    mt->setStateSet(stateset);\n    return mt;\n}\n\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_GENERICVALUE_HXX_\n#define _QITYPE_DETAILS_GENERICVALUE_HXX_\n\n#include <boost\/type_traits\/remove_const.hpp>\n#include <boost\/type_traits\/is_floating_point.hpp>\n\nnamespace qi {\n\n\n  template<> class TypeImpl<GenericValuePtr>: public TypeDynamic\n  {\n    virtual void* clone(void* src)\n    {\n      return new GenericValuePtr(((GenericValuePtr*)src)->clone());\n    }\n    virtual void destroy(void* ptr)\n    {\n      ((GenericValuePtr*)ptr)->destroy();\n      delete (GenericValuePtr*)ptr;\n    }\n    virtual std::pair<GenericValuePtr, bool> get(void* storage)\n    {\n      return std::make_pair(*(GenericValuePtr*)ptrFromStorage(&storage), false);\n    }\n    virtual void set(void** storage, GenericValuePtr src)\n    {\n      GenericValuePtr* val = (GenericValuePtr*)ptrFromStorage(storage);\n      *val = src.clone();\n    }\n    typedef DefaultTypeImplMethods<GenericValuePtr> Methods;\n    _QI_BOUNCE_TYPE_METHODS_NOCLONE(Methods);\n  };\n\n  template<> class TypeImpl<GenericValue>: public TypeDynamic\n  {\n  public:\n    virtual std::pair<GenericValuePtr, bool> get(void* storage)\n    {\n      return std::make_pair(*(GenericValuePtr*)ptrFromStorage(&storage), false);\n    }\n  virtual void set(void** storage, GenericValuePtr src)\n  {\n    GenericValue* val = (GenericValue*)ptrFromStorage(storage);\n    *val = src;\n  }\n  virtual void* clone(void* storage)\n  {\n    return new GenericValue((*(GenericValuePtr*)storage));\n  }\n  virtual void destroy(void* storage)\n  {\n    GenericValuePtr* val = (GenericValuePtr*)ptrFromStorage(&storage);\n    val->destroy();\n    delete val;\n  }\n  typedef DefaultTypeImplMethods<GenericValue> Methods;\n  _QI_BOUNCE_TYPE_METHODS_NOCLONE(Methods);\n  };\n\n  namespace 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\n  template<typename T>\n  GenericValuePtr GenericValuePtr::from(const T& v)\n  {\n    static Type* type = 0;\n    if (!type)\n      type = typeOf<typename boost::remove_const<T>::type>();\n    GenericValuePtr res;\n    res.type = type;\n    res.value = res.type->initializeStorage(const_cast<void*>((const void*)&v));\n    return res;\n  }\n\n  inline\n  GenericValuePtr GenericValuePtr::clone() const\n  {\n    GenericValuePtr res;\n    res.type = type;\n    res.value = type?res.type->clone(value):0;\n    return res;\n  }\n\n  inline AutoGenericValuePtr::AutoGenericValuePtr(const AutoGenericValuePtr& b)\n  {\n    value = b.value;\n    type = b.type;\n  }\n\n  template<typename T> AutoGenericValuePtr::AutoGenericValuePtr(const T& ptr)\n  {\n    *(GenericValuePtr*)this = from(ptr);\n  }\n\n  inline AutoGenericValuePtr::AutoGenericValuePtr()\n  {\n    value = type = 0;\n  }\n\n  inline std::string GenericValuePtr::signature(bool resolveDynamic) const\n  {\n    if (!type)\n      return \"\";\n    else\n      return type->signature(value, resolveDynamic);\n  }\n\n  inline void GenericValuePtr::destroy()\n  {\n    if (type && value)\n      type->destroy(value);\n  }\n\n  inline GenericValuePtr::GenericValuePtr()\n    : type(0)\n    , value(0)\n  {\n  }\n\n  inline GenericValuePtr::GenericValuePtr(Type* type)\n    : type(type)\n    , value(type->initializeStorage())\n  {\n  }\n\n  inline Type::Kind GenericValuePtr::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\n  class KindNotConvertible;\n\n  template<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\n\n  TYPE_OF_KIND(Type::Int, TypeInt);\n  TYPE_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\n  namespace 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) \\\n  public detail::IfElse<cond, typename detail::MakeKind<type>, detail::Nothing>::type\n\n  template<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\n  namespace detail {\n\n    \/\/ Optimized GenericValuePtr::as<T> for direct access to a subType getter\n    template<typename T, Type::Kind k>\n    inline T valueAs(const GenericValuePtr& v)\n    {\n      if (v.kind() == k) {\n        \/\/ C4244 - 'conversion' conversion from 'double' to 'float', possible loss of data\n        \/\/ TODO - fix the warning on this conversion\n        return static_cast<typename TypeOfKind<k>::type* const>(v.type)->get(v.value);\n      }\n      \/\/ Fallback to default which will attempt a full conversion.\n      return v.as<T>();\n    }\n  }\n\n  template<typename T>\n  inline T* GenericValuePtr::ptr(bool check)\n  {\n    if (check && typeOf<T>()->info() != type->info())\n      return 0;\n    else\n      return (T*)type->ptrFromStorage(&value);\n  }\n\n  template<typename T>\n  inline T GenericValuePtr::as(const T&) const\n  {\n    return as<T>();\n  }\n\n  template<typename T>\n  inline T GenericValuePtr::as() const\n  {\n    std::pair<GenericValuePtr, bool> conv = convert(typeOf<T>());\n    if (!conv.first.type)\n    {\n      qiLogWarning(\"qi.GenericValuePtr\") << \"Conversion from \" << type->infoString()\n                                      << '(' << type->kind() << ')'\n                                      << \" to \" << typeOf<T>()->infoString()\n                                      << '(' << typeOf<T>()->kind() << \") failed\";\n      return T();\n    }\n    T result = *conv.first.ptr<T>(false);\n    if (conv.second)\n      conv.first.destroy();\n    return result;\n  }\n\n  inline int64_t GenericValuePtr::asInt() const\n  {\n    return detail::valueAs<int64_t, Type::Int>(*this);\n  }\n\n  inline float GenericValuePtr::asFloat() const\n  {\n    return detail::valueAs<float, Type::Float>(*this);\n  }\n\n  inline double GenericValuePtr::asDouble() const\n  {\n    return detail::valueAs<double, Type::Float>(*this);\n  }\n\n\n  inline std::string GenericValuePtr::asString() const\n  {\n    return as<std::string>();\n  }\n\n\n  namespace detail\n  {\n    \/** This class can be used to convert the return value of an arbitrary function\n  * into a GenericValuePtr. 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 GenericValuePtrCopy: public GenericValuePtr\n    {\n    public:\n      template<typename T> void operator,(const T& any);\n      GenericValuePtrCopy &operator()() { return *this; }\n    };\n\n    template<typename T> void GenericValuePtrCopy::operator,(const T& any)\n    {\n      *(GenericValuePtr*)this = from(any);\n      *(GenericValuePtr*)this = clone();\n    }\n  }\n}\n\n#endif  \/\/ _QITYPE_DETAILS_GENERICVALUE_HXX_\n<commit_msg>Silence vcxx warning in valueAs().<commit_after>#pragma once\n\/*\n**  Copyright (C) 2012 Aldebaran Robotics\n**  See COPYING for the license\n*\/\n\n#ifndef _QITYPE_DETAILS_GENERICVALUE_HXX_\n#define _QITYPE_DETAILS_GENERICVALUE_HXX_\n\n#include <boost\/type_traits\/remove_const.hpp>\n#include <boost\/type_traits\/is_floating_point.hpp>\n\nnamespace qi {\n\n\n  template<> class TypeImpl<GenericValuePtr>: public TypeDynamic\n  {\n    virtual void* clone(void* src)\n    {\n      return new GenericValuePtr(((GenericValuePtr*)src)->clone());\n    }\n    virtual void destroy(void* ptr)\n    {\n      ((GenericValuePtr*)ptr)->destroy();\n      delete (GenericValuePtr*)ptr;\n    }\n    virtual std::pair<GenericValuePtr, bool> get(void* storage)\n    {\n      return std::make_pair(*(GenericValuePtr*)ptrFromStorage(&storage), false);\n    }\n    virtual void set(void** storage, GenericValuePtr src)\n    {\n      GenericValuePtr* val = (GenericValuePtr*)ptrFromStorage(storage);\n      *val = src.clone();\n    }\n    typedef DefaultTypeImplMethods<GenericValuePtr> Methods;\n    _QI_BOUNCE_TYPE_METHODS_NOCLONE(Methods);\n  };\n\n  template<> class TypeImpl<GenericValue>: public TypeDynamic\n  {\n  public:\n    virtual std::pair<GenericValuePtr, bool> get(void* storage)\n    {\n      return std::make_pair(*(GenericValuePtr*)ptrFromStorage(&storage), false);\n    }\n  virtual void set(void** storage, GenericValuePtr src)\n  {\n    GenericValue* val = (GenericValue*)ptrFromStorage(storage);\n    *val = src;\n  }\n  virtual void* clone(void* storage)\n  {\n    return new GenericValue((*(GenericValuePtr*)storage));\n  }\n  virtual void destroy(void* storage)\n  {\n    GenericValuePtr* val = (GenericValuePtr*)ptrFromStorage(&storage);\n    val->destroy();\n    delete val;\n  }\n  typedef DefaultTypeImplMethods<GenericValue> Methods;\n  _QI_BOUNCE_TYPE_METHODS_NOCLONE(Methods);\n  };\n\n  namespace 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\n  template<typename T>\n  GenericValuePtr GenericValuePtr::from(const T& v)\n  {\n    static Type* type = 0;\n    if (!type)\n      type = typeOf<typename boost::remove_const<T>::type>();\n    GenericValuePtr res;\n    res.type = type;\n    res.value = res.type->initializeStorage(const_cast<void*>((const void*)&v));\n    return res;\n  }\n\n  inline\n  GenericValuePtr GenericValuePtr::clone() const\n  {\n    GenericValuePtr res;\n    res.type = type;\n    res.value = type?res.type->clone(value):0;\n    return res;\n  }\n\n  inline AutoGenericValuePtr::AutoGenericValuePtr(const AutoGenericValuePtr& b)\n  {\n    value = b.value;\n    type = b.type;\n  }\n\n  template<typename T> AutoGenericValuePtr::AutoGenericValuePtr(const T& ptr)\n  {\n    *(GenericValuePtr*)this = from(ptr);\n  }\n\n  inline AutoGenericValuePtr::AutoGenericValuePtr()\n  {\n    value = type = 0;\n  }\n\n  inline std::string GenericValuePtr::signature(bool resolveDynamic) const\n  {\n    if (!type)\n      return \"\";\n    else\n      return type->signature(value, resolveDynamic);\n  }\n\n  inline void GenericValuePtr::destroy()\n  {\n    if (type && value)\n      type->destroy(value);\n  }\n\n  inline GenericValuePtr::GenericValuePtr()\n    : type(0)\n    , value(0)\n  {\n  }\n\n  inline GenericValuePtr::GenericValuePtr(Type* type)\n    : type(type)\n    , value(type->initializeStorage())\n  {\n  }\n\n  inline Type::Kind GenericValuePtr::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\n  class KindNotConvertible;\n\n  template<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\n\n  TYPE_OF_KIND(Type::Int, TypeInt);\n  TYPE_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\n  namespace 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) \\\n  public detail::IfElse<cond, typename detail::MakeKind<type>, detail::Nothing>::type\n\n  template<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\n  namespace detail {\n\n    \/\/ Optimized GenericValuePtr::as<T> for direct access to a subType getter\n    template<typename T, Type::Kind k>\n    inline T valueAs(const GenericValuePtr& v)\n    {\n      if (v.kind() == k)\n        return static_cast<T>(\n          static_cast<typename TypeOfKind<k>::type* const>(v.type)->get(v.value));\n      \/\/ Fallback to default which will attempt a full conversion.\n      return v.as<T>();\n    }\n  }\n\n  template<typename T>\n  inline T* GenericValuePtr::ptr(bool check)\n  {\n    if (check && typeOf<T>()->info() != type->info())\n      return 0;\n    else\n      return (T*)type->ptrFromStorage(&value);\n  }\n\n  template<typename T>\n  inline T GenericValuePtr::as(const T&) const\n  {\n    return as<T>();\n  }\n\n  template<typename T>\n  inline T GenericValuePtr::as() const\n  {\n    std::pair<GenericValuePtr, bool> conv = convert(typeOf<T>());\n    if (!conv.first.type)\n    {\n      qiLogWarning(\"qi.GenericValuePtr\") << \"Conversion from \" << type->infoString()\n                                      << '(' << type->kind() << ')'\n                                      << \" to \" << typeOf<T>()->infoString()\n                                      << '(' << typeOf<T>()->kind() << \") failed\";\n      return T();\n    }\n    T result = *conv.first.ptr<T>(false);\n    if (conv.second)\n      conv.first.destroy();\n    return result;\n  }\n\n  inline int64_t GenericValuePtr::asInt() const\n  {\n    return detail::valueAs<int64_t, Type::Int>(*this);\n  }\n\n  inline float GenericValuePtr::asFloat() const\n  {\n    return detail::valueAs<float, Type::Float>(*this);\n  }\n\n  inline double GenericValuePtr::asDouble() const\n  {\n    return detail::valueAs<double, Type::Float>(*this);\n  }\n\n\n  inline std::string GenericValuePtr::asString() const\n  {\n    return as<std::string>();\n  }\n\n\n  namespace detail\n  {\n    \/** This class can be used to convert the return value of an arbitrary function\n  * into a GenericValuePtr. 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 GenericValuePtrCopy: public GenericValuePtr\n    {\n    public:\n      template<typename T> void operator,(const T& any);\n      GenericValuePtrCopy &operator()() { return *this; }\n    };\n\n    template<typename T> void GenericValuePtrCopy::operator,(const T& any)\n    {\n      *(GenericValuePtr*)this = from(any);\n      *(GenericValuePtr*)this = clone();\n    }\n  }\n}\n\n#endif  \/\/ _QITYPE_DETAILS_GENERICVALUE_HXX_\n<|endoftext|>"}
{"text":"<commit_before>#include \"PictureRenderer.h\"\n#include \"SamplePipeControllers.h\"\n#include \"SkCanvas.h\"\n#include \"SkDevice.h\"\n#include \"SkGPipe.h\"\n#include \"SkPicture.h\"\n#include \"SkTDArray.h\"\n#include \"SkTypes.h\"\n#include \"picture_utils.h\"\n\n#if SK_SUPPORT_GPU\n#include \"SkGpuDevice.h\"\n#endif\n\nnamespace sk_tools {\n\nenum {\n    kDefaultTileWidth = 256,\n    kDefaultTileHeight = 256\n};\n\nvoid PictureRenderer::init(SkPicture* pict) {\n    SkASSERT(NULL == fPicture);\n    SkASSERT(NULL == fCanvas.get());\n    if (fPicture != NULL || NULL != fCanvas.get()) {\n        return;\n    }\n\n    SkASSERT(pict != NULL);\n    if (NULL == pict) {\n        return;\n    }\n\n    fPicture = pict;\n    fCanvas.reset(this->setupCanvas());\n}\n\nSkCanvas* PictureRenderer::setupCanvas() {\n    return this->setupCanvas(fPicture->width(), fPicture->height());\n}\n\nSkCanvas* PictureRenderer::setupCanvas(int width, int height) {\n    switch(fDeviceType) {\n        case kBitmap_DeviceType: {\n            SkBitmap bitmap;\n            sk_tools::setup_bitmap(&bitmap, width, height);\n            return SkNEW_ARGS(SkCanvas, (bitmap));\n            break;\n        }\n#if SK_SUPPORT_GPU\n        case kGPU_DeviceType: {\n            SkAutoTUnref<SkGpuDevice> device(SkNEW_ARGS(SkGpuDevice,\n                                                    (fGrContext, SkBitmap::kARGB_8888_Config,\n                                                    width, height)));\n            return SkNEW_ARGS(SkCanvas, (device.get()));\n            break;\n        }\n#endif\n        default:\n            SkASSERT(0);\n    }\n\n    return NULL;\n}\n\nvoid PictureRenderer::end() {\n    this->resetState();\n    fPicture = NULL;\n    fCanvas.reset(NULL);\n}\n\nvoid PictureRenderer::resetState() {\n    fCanvas->flush();\n\n    if (this->isUsingGpuDevice()) {\n        SkGLContext* glContext = fGrContextFactory.getGLContext(\n            GrContextFactory::kNative_GLContextType);\n        SK_GL(*glContext, Finish());\n        fGrContext->freeGpuResources();\n    }\n}\n\nvoid PipePictureRenderer::render() {\n    SkASSERT(fCanvas.get() != NULL);\n    SkASSERT(fPicture != NULL);\n    if (NULL == fCanvas.get() || NULL == fPicture) {\n        return;\n    }\n\n    PipeController pipeController(fCanvas.get());\n    SkGPipeWriter writer;\n    SkCanvas* pipeCanvas = writer.startRecording(&pipeController);\n    pipeCanvas->drawPicture(*fPicture);\n    writer.endRecording();\n}\n\nvoid SimplePictureRenderer::render() {\n    SkASSERT(fCanvas.get() != NULL);\n    SkASSERT(fPicture != NULL);\n    if (NULL == fCanvas.get() || NULL == fPicture) {\n        return;\n    }\n\n    fCanvas->drawPicture(*fPicture);\n}\n\nTiledPictureRenderer::TiledPictureRenderer()\n    : fTileWidth(kDefaultTileWidth)\n    , fTileHeight(kDefaultTileHeight) {}\n\nvoid TiledPictureRenderer::init(SkPicture* pict) {\n    SkASSERT(pict != NULL);\n    SkASSERT(0 == fTiles.count());\n    if (NULL == pict || fTiles.count() != 0) {\n        return;\n    }\n\n    this->INHERITED::init(pict);\n\n    if (fTileWidthPercentage > 0) {\n        fTileWidth = sk_float_ceil2int(float(fTileWidthPercentage * fPicture->width() \/ 100));\n    }\n    if (fTileHeightPercentage > 0) {\n        fTileHeight = sk_float_ceil2int(float(fTileHeightPercentage * fPicture->height() \/ 100));\n    }\n\n    this->setupTiles();\n}\n\nvoid TiledPictureRenderer::render() {\n    SkASSERT(fCanvas.get() != NULL);\n    SkASSERT(fPicture != NULL);\n    if (NULL == fCanvas.get() || NULL == fPicture) {\n        return;\n    }\n\n    this->drawTiles();\n    this->copyTilesToCanvas();\n}\n\nvoid TiledPictureRenderer::end() {\n    this->deleteTiles();\n    this->INHERITED::end();\n}\n\nTiledPictureRenderer::~TiledPictureRenderer() {\n    this->deleteTiles();\n}\n\nvoid TiledPictureRenderer::clipTile(const TileInfo& tile) {\n    SkRect clip = SkRect::MakeWH(SkIntToScalar(fPicture->width()),\n                                 SkIntToScalar(fPicture->height()));\n    tile.fCanvas->clipRect(clip);\n}\n\nvoid TiledPictureRenderer::addTile(int tile_x_start, int tile_y_start) {\n    TileInfo* tile = fTiles.push();\n\n    tile->fCanvas = this->setupCanvas(fTileWidth, fTileHeight);\n    tile->fCanvas->translate(SkIntToScalar(-tile_x_start), SkIntToScalar(-tile_y_start));\n    this->clipTile(*tile);\n}\n\nvoid TiledPictureRenderer::setupTiles() {\n    for (int tile_y_start = 0; tile_y_start < fPicture->height();\n         tile_y_start += fTileHeight) {\n        for (int tile_x_start = 0; tile_x_start < fPicture->width();\n             tile_x_start += fTileWidth) {\n            this->addTile(tile_x_start, tile_y_start);\n        }\n    }\n}\n\nvoid TiledPictureRenderer::deleteTiles() {\n    for (int i = 0; i < fTiles.count(); ++i) {\n        SkDELETE(fTiles[i].fCanvas);\n    }\n\n    fTiles.reset();\n}\n\nvoid TiledPictureRenderer::drawTiles() {\n    for (int i = 0; i < fTiles.count(); ++i) {\n        fTiles[i].fCanvas->drawPicture(*(fPicture));\n    }\n}\n\nvoid TiledPictureRenderer::resetState() {\n    for (int i = 0; i < fTiles.count(); ++i) {\n        fTiles[i].fCanvas->flush();\n    }\n\n    this->INHERITED::resetState();\n}\n\nvoid TiledPictureRenderer::copyTilesToCanvas() {\n    int tile_index = 0;\n    for (int tile_y_start = 0; tile_y_start < fPicture->height();\n         tile_y_start += fTileHeight) {\n        for (int tile_x_start = 0; tile_x_start < fPicture->width();\n             tile_x_start += fTileWidth) {\n            SkASSERT(tile_index < fTiles.count());\n            SkBitmap source = fTiles[tile_index].fCanvas->getDevice()->accessBitmap(false);\n            fCanvas->drawBitmap(source,\n                                SkIntToScalar(tile_x_start),\n                                SkIntToScalar(tile_y_start));\n            ++tile_index;\n        }\n    }\n}\n\n}\n<commit_msg>Added some assertions.<commit_after>#include \"PictureRenderer.h\"\n#include \"SamplePipeControllers.h\"\n#include \"SkCanvas.h\"\n#include \"SkDevice.h\"\n#include \"SkGPipe.h\"\n#include \"SkPicture.h\"\n#include \"SkTDArray.h\"\n#include \"SkTypes.h\"\n#include \"picture_utils.h\"\n\n#if SK_SUPPORT_GPU\n#include \"SkGpuDevice.h\"\n#endif\n\nnamespace sk_tools {\n\nenum {\n    kDefaultTileWidth = 256,\n    kDefaultTileHeight = 256\n};\n\nvoid PictureRenderer::init(SkPicture* pict) {\n    SkASSERT(NULL == fPicture);\n    SkASSERT(NULL == fCanvas.get());\n    if (fPicture != NULL || NULL != fCanvas.get()) {\n        return;\n    }\n\n    SkASSERT(pict != NULL);\n    if (NULL == pict) {\n        return;\n    }\n\n    fPicture = pict;\n    fCanvas.reset(this->setupCanvas());\n}\n\nSkCanvas* PictureRenderer::setupCanvas() {\n    return this->setupCanvas(fPicture->width(), fPicture->height());\n}\n\nSkCanvas* PictureRenderer::setupCanvas(int width, int height) {\n    switch(fDeviceType) {\n        case kBitmap_DeviceType: {\n            SkBitmap bitmap;\n            sk_tools::setup_bitmap(&bitmap, width, height);\n            return SkNEW_ARGS(SkCanvas, (bitmap));\n            break;\n        }\n#if SK_SUPPORT_GPU\n        case kGPU_DeviceType: {\n            SkAutoTUnref<SkGpuDevice> device(SkNEW_ARGS(SkGpuDevice,\n                                                    (fGrContext, SkBitmap::kARGB_8888_Config,\n                                                    width, height)));\n            return SkNEW_ARGS(SkCanvas, (device.get()));\n            break;\n        }\n#endif\n        default:\n            SkASSERT(0);\n    }\n\n    return NULL;\n}\n\nvoid PictureRenderer::end() {\n    this->resetState();\n    fPicture = NULL;\n    fCanvas.reset(NULL);\n}\n\nvoid PictureRenderer::resetState() {\n    SkASSERT(fCanvas.get() != NULL);\n    SkASSERT(fPicture != NULL);\n    if (NULL == fCanvas.get() || NULL == fPicture) {\n        return;\n    }\n\n    fCanvas->flush();\n\n    if (this->isUsingGpuDevice()) {\n        SkGLContext* glContext = fGrContextFactory.getGLContext(\n            GrContextFactory::kNative_GLContextType);\n        SK_GL(*glContext, Finish());\n        fGrContext->freeGpuResources();\n    }\n}\n\nvoid PipePictureRenderer::render() {\n    SkASSERT(fCanvas.get() != NULL);\n    SkASSERT(fPicture != NULL);\n    if (NULL == fCanvas.get() || NULL == fPicture) {\n        return;\n    }\n\n    PipeController pipeController(fCanvas.get());\n    SkGPipeWriter writer;\n    SkCanvas* pipeCanvas = writer.startRecording(&pipeController);\n    pipeCanvas->drawPicture(*fPicture);\n    writer.endRecording();\n}\n\nvoid SimplePictureRenderer::render() {\n    SkASSERT(fCanvas.get() != NULL);\n    SkASSERT(fPicture != NULL);\n    if (NULL == fCanvas.get() || NULL == fPicture) {\n        return;\n    }\n\n    fCanvas->drawPicture(*fPicture);\n}\n\nTiledPictureRenderer::TiledPictureRenderer()\n    : fTileWidth(kDefaultTileWidth)\n    , fTileHeight(kDefaultTileHeight) {}\n\nvoid TiledPictureRenderer::init(SkPicture* pict) {\n    SkASSERT(pict != NULL);\n    SkASSERT(0 == fTiles.count());\n    if (NULL == pict || fTiles.count() != 0) {\n        return;\n    }\n\n    this->INHERITED::init(pict);\n\n    if (fTileWidthPercentage > 0) {\n        fTileWidth = sk_float_ceil2int(float(fTileWidthPercentage * fPicture->width() \/ 100));\n    }\n    if (fTileHeightPercentage > 0) {\n        fTileHeight = sk_float_ceil2int(float(fTileHeightPercentage * fPicture->height() \/ 100));\n    }\n\n    this->setupTiles();\n}\n\nvoid TiledPictureRenderer::render() {\n    SkASSERT(fCanvas.get() != NULL);\n    SkASSERT(fPicture != NULL);\n    if (NULL == fCanvas.get() || NULL == fPicture) {\n        return;\n    }\n\n    this->drawTiles();\n    this->copyTilesToCanvas();\n}\n\nvoid TiledPictureRenderer::end() {\n    this->deleteTiles();\n    this->INHERITED::end();\n}\n\nTiledPictureRenderer::~TiledPictureRenderer() {\n    this->deleteTiles();\n}\n\nvoid TiledPictureRenderer::clipTile(const TileInfo& tile) {\n    SkRect clip = SkRect::MakeWH(SkIntToScalar(fPicture->width()),\n                                 SkIntToScalar(fPicture->height()));\n    tile.fCanvas->clipRect(clip);\n}\n\nvoid TiledPictureRenderer::addTile(int tile_x_start, int tile_y_start) {\n    TileInfo* tile = fTiles.push();\n\n    tile->fCanvas = this->setupCanvas(fTileWidth, fTileHeight);\n    tile->fCanvas->translate(SkIntToScalar(-tile_x_start), SkIntToScalar(-tile_y_start));\n    this->clipTile(*tile);\n}\n\nvoid TiledPictureRenderer::setupTiles() {\n    for (int tile_y_start = 0; tile_y_start < fPicture->height();\n         tile_y_start += fTileHeight) {\n        for (int tile_x_start = 0; tile_x_start < fPicture->width();\n             tile_x_start += fTileWidth) {\n            this->addTile(tile_x_start, tile_y_start);\n        }\n    }\n}\n\nvoid TiledPictureRenderer::deleteTiles() {\n    for (int i = 0; i < fTiles.count(); ++i) {\n        SkDELETE(fTiles[i].fCanvas);\n    }\n\n    fTiles.reset();\n}\n\nvoid TiledPictureRenderer::drawTiles() {\n    for (int i = 0; i < fTiles.count(); ++i) {\n        fTiles[i].fCanvas->drawPicture(*(fPicture));\n    }\n}\n\nvoid TiledPictureRenderer::resetState() {\n    SkASSERT(fCanvas.get() != NULL);\n    SkASSERT(fPicture != NULL);\n    if (NULL == fCanvas.get() || NULL == fPicture) {\n        return;\n    }\n\n    for (int i = 0; i < fTiles.count(); ++i) {\n        fTiles[i].fCanvas->flush();\n    }\n\n    this->INHERITED::resetState();\n}\n\nvoid TiledPictureRenderer::copyTilesToCanvas() {\n    int tile_index = 0;\n    for (int tile_y_start = 0; tile_y_start < fPicture->height();\n         tile_y_start += fTileHeight) {\n        for (int tile_x_start = 0; tile_x_start < fPicture->width();\n             tile_x_start += fTileWidth) {\n            SkASSERT(tile_index < fTiles.count());\n            SkBitmap source = fTiles[tile_index].fCanvas->getDevice()->accessBitmap(false);\n            fCanvas->drawBitmap(source,\n                                SkIntToScalar(tile_x_start),\n                                SkIntToScalar(tile_y_start));\n            ++tile_index;\n        }\n    }\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n  A hacky replacement for backtrace_symbols in glibc\n\n  backtrace_symbols in glibc looks up symbols using dladdr which is limited in\n  the symbols that it sees. libbacktracesymbols opens the executable and shared\n  libraries using libbfd and will look up backtrace information using the symbol\n  table and the dwarf line information.\n\n  It may make more sense for this program to use libelf instead of libbfd.\n  However, I have not investigated that yet.\n\n  Derived from addr2line.c from GNU Binutils by Jeff Muizelaar\n\n  Copyright 2007 Jeff Muizelaar\n*\/\n\n\/* addr2line.c -- convert addresses to line number and function name\n   Copyright 1997, 1998, 1999, 2000, 2001, 2002 Free Software Foundation, Inc.\n   Contributed by Ulrich Lauther <Ulrich.Lauther@mchp.siemens.de>\n\n   This file was part of GNU Binutils.\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, or (at your option)\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, write to the Free Software\n   Foundation, 51 Franklin Street, Suite 500, Boston, MA 02110-1335, USA.  *\/\n\n#ifdef HASBFD\n\n#include \"util\/Result.h\"\n#include \"FindFile.h\" \/\/ GetBinaryFilename\n#include <iostream>\n#include <sstream>\n#include <vector>\n#include <string>\n\n\/* 2 characters for each byte, plus 1 each for 0, x, and NULL *\/\n#define PTRSTR_LEN (sizeof(void *) * 2 + 3)\n\n#define _GNU_SOURCE\n#include <string.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <execinfo.h>\n#ifdef __APPLE__\n#include <bfd.h>\n#include <dlfcn.h>\n#else\n#include <bfd.h>\n#include <libiberty.h>\n#include <dlfcn.h>\n#include <link.h>\n#endif\n\n\n#if 0\n\nvoid (*dbfd_init)(void);\nbfd_vma (*dbfd_scan_vma)(const char *string, const char **end, int base);\nbfd* (*dbfd_openr)(const char *filename, const char *target);\nbfd_boolean (*dbfd_check_format)(bfd *abfd, bfd_format format);\nbfd_boolean (*dbfd_check_format_matches)(bfd *abfd, bfd_format format, char ***matching);\nbfd_boolean (*dbfd_close)(bfd *abfd);\nbfd_boolean (*dbfd_map_over_sections)(bfd *abfd, void (*func)(bfd *abfd, asection *sect, void *obj),\n\t\tvoid *obj);\n#define bfd_init dbfd_init\n\nstatic void load_funcs(void)\n{\n\tvoid * handle = dlopen(\"libbfd.so\", RTLD_NOW);\n\tdbfd_init = dlsym(handle, \"bfd_init\");\n\tdbfd_scan_vma = dlsym(handle, \"bfd_scan_vma\");\n\tdbfd_openr = dlsym(handle, \"bfd_openr\");\n\tdbfd_check_format = dlsym(handle, \"bfd_check_format\");\n\tdbfd_check_format_matches = dlsym(handle, \"bfd_check_format_matches\");\n\tdbfd_close = dlsym(handle, \"bfd_close\");\n\tdbfd_map_over_sections = dlsym(handle, \"bfd_map_over_sections\");\n}\n\n#endif\n\n\nstatic asymbol **syms;\t\t\/* Symbol table.  *\/\n\n\nstatic Result slurp_symtab(bfd * abfd);\nstatic void find_address_in_section(bfd *abfd, asection *section, void *data);\n\n\/* Read in the symbol table.  *\/\n\nstatic Result slurp_symtab(bfd * abfd)\n{\n\tif ((bfd_get_file_flags(abfd) & HAS_SYMS) == 0)\n\t\treturn \"file has no symtab\";\n\n\tunsigned int size = 0;\n\tlong symcount = bfd_read_minisymbols(abfd, false, (void**) &syms, &size);\n\tif (symcount == 0)\n\t\tsymcount = bfd_read_minisymbols(abfd, true \/* dynamic *\/ ,\n\t\t\t\t\t\t(void**) &syms, &size);\n\n\tif (symcount < 0)\n\t\treturn \"error getting minisymbols\";\n\n\tif (symcount == 0)\n\t\treturn \"no minisymbols found\";\n\n\treturn true;\n}\n\n\/* These global variables are used to pass information between\n   translate_addresses and find_address_in_section.  *\/\n\nstatic bfd_vma pc;\nstatic const char *filename;\nstatic const char *functionname;\nstatic unsigned int line;\nstatic bool found = false;\nstatic bool sectionFound = false;\n\n\/* Look for an address in a section.  This is called via\n   bfd_map_over_sections.  *\/\n\nstatic void find_address_in_section(bfd *abfd, asection *section, void *data __attribute__ ((__unused__)) )\n{\n\tbfd_vma vma;\n\tbfd_size_type size;\n\n\tif (found)\n\t\treturn;\n\n\tif ((bfd_get_section_flags(abfd, section) & SEC_ALLOC) == 0)\n\t\treturn;\n\n\tvma = bfd_get_section_vma(abfd, section);\n\tif (pc < vma)\n\t\treturn;\n\n\tsize = bfd_section_size(abfd, section);\n\tif (pc >= vma + size)\n\t\treturn;\n\n\tsectionFound = true;\n\tfound = bfd_find_nearest_line(abfd, section, syms, pc - vma,\n\t\t\t\t      &filename, &functionname, &line);\n}\n\n\n\nstatic std::string translate_addresses_buf(bfd * abfd, bfd_vma addr)\n{\n\tstd::ostringstream ret;\n\n\tpc = addr;\n\tsectionFound = false;\n\tfound = false;\n\tbfd_map_over_sections(abfd, find_address_in_section, (PTR) NULL);\n\n\tif (!found) {\n\t\tret.setf( std::ios::hex, std::ios::basefield );\n\t\tret.setf( std::ios::showbase );\n\t\tret << \"[\" << (long long unsigned int) addr << \"] \";\n\t\tif(sectionFound) ret << \"<function not found>\";\n\t\telse ret << \"<section not found>\";\n\n\t} else {\n\t\tif (filename != NULL) {\n\t\t\tchar *h = strrchr(filename, '\/');\n\t\t\tif (h != NULL)\n\t\t\t\tfilename = h + 1;\n\n\t\t\tret << filename;\n\t\t}\n\t\telse\n\t\t\tret << \"<unknown file>\";\n\n\t\tret << \":\" << line << \"\\t\";\n\n\t\tif (functionname == NULL || *functionname == '\\0')\n\t\t\tret << \"<unknown function>\";\n\t\telse\n\t\t\tret << functionname << \"()\";\n\t}\n\n\treturn ret.str();\n}\n\/* Process a file.  *\/\n\nstatic Result process_file(const char *file_name, bfd_vma addr, std::string& ret_buf)\n{\n\tbfd *abfd;\n\tchar **matching;\n\n\tabfd = bfd_openr(file_name, NULL);\n\n\tif (abfd == NULL)\n\t\treturn \"no abfd\";\n\n\tif (bfd_check_format(abfd, bfd_archive))\n\t\treturn \"can not get addresses from archive\";\n\n\tif (!bfd_check_format_matches(abfd, bfd_object, &matching)) {\n\t\t\/\/bfd_nonfatal(bfd_get_filename(abfd));\n\t\tif (bfd_get_error() ==\n\t\t    bfd_error_file_ambiguously_recognized) {\n\t\t\t\/\/list_matching_formats(matching);\n\t\t\tfree(matching);\n\t\t}\n\t\treturn \"format does not match\";\n\t}\n\n\tif(NegResult r = slurp_symtab(abfd))\n\t\treturn \"slurp_symtab: \" + r.res.humanErrorMsg;\n\n\tret_buf = translate_addresses_buf(abfd, addr);\n\n\tfree (syms);\n\tsyms = NULL;\n\n\tbfd_close(abfd);\n\treturn true;\n}\n\n#define MAX_DEPTH 16\n\nstruct file_match {\n\tconst char *file;\n\tvoid *address;\n\tvoid *base;\n\tvoid *hdr;\n};\n\n#ifndef __APPLE__\nstatic int find_matching_file(struct dl_phdr_info *info,\n\t\tsize_t size, void *data)\n{\n\tstruct file_match *match = (struct file_match*) data;\n\t\/* This code is modeled from Gfind_proc_info-lsb.c:callback() from libunwind *\/\n\tlong n;\n\tconst ElfW(Phdr) *phdr;\n\tElfW(Addr) load_base = info->dlpi_addr;\n\tphdr = info->dlpi_phdr;\n\tfor (n = info->dlpi_phnum; --n >= 0; phdr++) {\n\t\tif (phdr->p_type == PT_LOAD) {\n\t\t\tElfW(Addr) vaddr = phdr->p_vaddr + load_base;\n\t\t\tif (match->address >= vaddr && match->address < vaddr + phdr->p_memsz) {\n\t\t\t\t\/* we found a match *\/\n\t\t\t\tmatch->file = info->dlpi_name;\n\t\t\t\tmatch->base = info->dlpi_addr;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\n#endif\n\nchar **backtrace_symbols(void *const *buffer, int size)\n{\n\tint stack_depth = size - 1;\n\tint x,y;\n\t\/* discard calling function *\/\n\tint total = 0;\n\n\tchar **final;\n\tchar *f_strings;\n\n\tstd::vector<std::string> locations(stack_depth + 1);\n\n\tbfd_init();\n\tfor(x=stack_depth, y=0; x>=0; x--, y++){\n\t\tstd::string ret_buf;\n\t\tconst void* xaddr = buffer[x];\n\t\tbfd_vma addr = (bfd_vma)xaddr;\n\t\tResult r = true;\n#ifndef __APPLE__\n\t\tstruct file_match match;\n\t\tmatch.address = buffer[x];\n\t\tdl_iterate_phdr(find_matching_file, &match);\n\t\taddr = buffer[x] - match.base;\n\t\tif (match.file && strlen(match.file))\n\t\t\tr = process_file(match.file, addr, ret_buf);\n\t\telse\n#endif\n\t\t\tr = process_file(GetBinaryFilename(), addr, ret_buf);\n\t\tif(r)\n\t\t\tlocations[x] = ret_buf;\n\t\telse\n\t\t\tlocations[x] = \"<error>\";\n\t\ttotal += locations[x].size() + 1;\n\t}\n\n\t\/* allocate the array of char* we are going to return and extra space for\n\t * all of the strings *\/\n\tfinal = (char**)malloc(total + (stack_depth + 1) * sizeof(char*));\n\t\/* get a pointer to the extra space *\/\n\tf_strings = (char*)(final + stack_depth + 1);\n\n\t\/* fill in all of strings and pointers *\/\n\tfor(x=stack_depth; x>=0; x--){\n\t\tstrcpy(f_strings, locations[x].c_str());\n\t\tfinal[x] = f_strings;\n\t\tf_strings += strlen(f_strings) + 1;\n\t}\n\n\treturn final;\n}\n\nvoid\nbacktrace_symbols_fd(void *const *buffer, int size, int fd)\n{\n        int j;\n        char **strings;\n\n        strings = backtrace_symbols(buffer, size);\n\t\tif (strings == NULL) return;\n\n        for (j = 0; j < size; j++)\n\t\tprintf(\"%s\\n\", strings[j]);\n\n        free(strings);\n}\n\n\/\/ Not sure on this. Linking failed on Mac.\n\/\/ Found it here: http:\/\/www.mail-archive.com\/uclinux-dev@uclinux.org\/msg02347.html\n#ifndef HAVE_LIBINTL_DGETTEXT\nextern \"C\"\nconst char *libintl_dgettext (const char *domain, const char *msg)\n{\n  return msg;\n}\n#endif \/* !HAVE_LIBINTL_DGETTEXT *\/\n\n#endif \/\/ HASBFD\n<commit_msg>better dbg err msg<commit_after>\/*\n  A hacky replacement for backtrace_symbols in glibc\n\n  backtrace_symbols in glibc looks up symbols using dladdr which is limited in\n  the symbols that it sees. libbacktracesymbols opens the executable and shared\n  libraries using libbfd and will look up backtrace information using the symbol\n  table and the dwarf line information.\n\n  It may make more sense for this program to use libelf instead of libbfd.\n  However, I have not investigated that yet.\n\n  Derived from addr2line.c from GNU Binutils by Jeff Muizelaar\n\n  Copyright 2007 Jeff Muizelaar\n*\/\n\n\/* addr2line.c -- convert addresses to line number and function name\n   Copyright 1997, 1998, 1999, 2000, 2001, 2002 Free Software Foundation, Inc.\n   Contributed by Ulrich Lauther <Ulrich.Lauther@mchp.siemens.de>\n\n   This file was part of GNU Binutils.\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, or (at your option)\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, write to the Free Software\n   Foundation, 51 Franklin Street, Suite 500, Boston, MA 02110-1335, USA.  *\/\n\n#ifdef HASBFD\n\n#include \"util\/Result.h\"\n#include \"FindFile.h\" \/\/ GetBinaryFilename\n#include <iostream>\n#include <sstream>\n#include <vector>\n#include <string>\n\n\/* 2 characters for each byte, plus 1 each for 0, x, and NULL *\/\n#define PTRSTR_LEN (sizeof(void *) * 2 + 3)\n\n#define _GNU_SOURCE\n#include <string.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <execinfo.h>\n#ifdef __APPLE__\n#include <bfd.h>\n#include <dlfcn.h>\n#else\n#include <bfd.h>\n#include <libiberty.h>\n#include <dlfcn.h>\n#include <link.h>\n#endif\n\n\n#if 0\n\nvoid (*dbfd_init)(void);\nbfd_vma (*dbfd_scan_vma)(const char *string, const char **end, int base);\nbfd* (*dbfd_openr)(const char *filename, const char *target);\nbfd_boolean (*dbfd_check_format)(bfd *abfd, bfd_format format);\nbfd_boolean (*dbfd_check_format_matches)(bfd *abfd, bfd_format format, char ***matching);\nbfd_boolean (*dbfd_close)(bfd *abfd);\nbfd_boolean (*dbfd_map_over_sections)(bfd *abfd, void (*func)(bfd *abfd, asection *sect, void *obj),\n\t\tvoid *obj);\n#define bfd_init dbfd_init\n\nstatic void load_funcs(void)\n{\n\tvoid * handle = dlopen(\"libbfd.so\", RTLD_NOW);\n\tdbfd_init = dlsym(handle, \"bfd_init\");\n\tdbfd_scan_vma = dlsym(handle, \"bfd_scan_vma\");\n\tdbfd_openr = dlsym(handle, \"bfd_openr\");\n\tdbfd_check_format = dlsym(handle, \"bfd_check_format\");\n\tdbfd_check_format_matches = dlsym(handle, \"bfd_check_format_matches\");\n\tdbfd_close = dlsym(handle, \"bfd_close\");\n\tdbfd_map_over_sections = dlsym(handle, \"bfd_map_over_sections\");\n}\n\n#endif\n\n\nstatic asymbol **syms;\t\t\/* Symbol table.  *\/\n\n\nstatic Result slurp_symtab(bfd * abfd);\nstatic void find_address_in_section(bfd *abfd, asection *section, void *data);\n\n\/* Read in the symbol table.  *\/\n\nstatic Result slurp_symtab(bfd * abfd)\n{\n\tif ((bfd_get_file_flags(abfd) & HAS_SYMS) == 0)\n\t\treturn \"file has no symtab\";\n\n\tunsigned int size = 0;\n\tlong symcount = bfd_read_minisymbols(abfd, false, (void**) &syms, &size);\n\tif (symcount == 0)\n\t\tsymcount = bfd_read_minisymbols(abfd, true \/* dynamic *\/ ,\n\t\t\t\t\t\t(void**) &syms, &size);\n\n\tif (symcount < 0)\n\t\treturn \"error getting minisymbols\";\n\n\tif (symcount == 0)\n\t\treturn \"no minisymbols found\";\n\n\treturn true;\n}\n\n\/* These global variables are used to pass information between\n   translate_addresses and find_address_in_section.  *\/\n\nstatic bfd_vma pc;\nstatic const char *filename;\nstatic const char *functionname;\nstatic unsigned int line;\nstatic bool found = false;\nstatic bool sectionFound = false;\n\n\/* Look for an address in a section.  This is called via\n   bfd_map_over_sections.  *\/\n\nstatic void find_address_in_section(bfd *abfd, asection *section, void *data __attribute__ ((__unused__)) )\n{\n\tbfd_vma vma;\n\tbfd_size_type size;\n\n\tif (found)\n\t\treturn;\n\n\tif ((bfd_get_section_flags(abfd, section) & SEC_ALLOC) == 0)\n\t\treturn;\n\n\tvma = bfd_get_section_vma(abfd, section);\n\tif (pc < vma)\n\t\treturn;\n\n\tsize = bfd_section_size(abfd, section);\n\tif (pc >= vma + size)\n\t\treturn;\n\n\tsectionFound = true;\n\tfound = bfd_find_nearest_line(abfd, section, syms, pc - vma,\n\t\t\t\t      &filename, &functionname, &line);\n}\n\n\n\nstatic std::string translate_addresses_buf(bfd * abfd, bfd_vma addr)\n{\n\tstd::ostringstream ret;\n\n\tpc = addr;\n\tsectionFound = false;\n\tfound = false;\n\tbfd_map_over_sections(abfd, find_address_in_section, (PTR) NULL);\n\n\tif (!found) {\n\t\tret.setf( std::ios::hex, std::ios::basefield );\n\t\tret.setf( std::ios::showbase );\n\t\tret << \"[\" << (long long unsigned int) addr << \"] \";\n\t\tif(sectionFound) ret << \"<function not found>\";\n\t\telse ret << \"<section not found>\";\n\n\t} else {\n\t\tif (filename != NULL) {\n\t\t\tchar *h = strrchr(filename, '\/');\n\t\t\tif (h != NULL)\n\t\t\t\tfilename = h + 1;\n\n\t\t\tret << filename;\n\t\t}\n\t\telse\n\t\t\tret << \"<unknown file>\";\n\n\t\tret << \":\" << line << \"\\t\";\n\n\t\tif (functionname == NULL || *functionname == '\\0')\n\t\t\tret << \"<unknown function>\";\n\t\telse\n\t\t\tret << functionname << \"()\";\n\t}\n\n\treturn ret.str();\n}\n\/* Process a file.  *\/\n\nstatic Result process_file(const char *file_name, bfd_vma addr, std::string& ret_buf)\n{\n\tbfd *abfd;\n\tchar **matching;\n\n\tabfd = bfd_openr(file_name, NULL);\n\n\tif (abfd == NULL)\n\t\treturn \"no abfd\";\n\n\tif (bfd_check_format(abfd, bfd_archive))\n\t\treturn \"can not get addresses from archive\";\n\n\tif (!bfd_check_format_matches(abfd, bfd_object, &matching)) {\n\t\t\/\/bfd_nonfatal(bfd_get_filename(abfd));\n\t\tif (bfd_get_error() ==\n\t\t    bfd_error_file_ambiguously_recognized) {\n\t\t\t\/\/list_matching_formats(matching);\n\t\t\tfree(matching);\n\t\t}\n\t\treturn \"format does not match\";\n\t}\n\n\tif(NegResult r = slurp_symtab(abfd))\n\t\treturn \"slurp_symtab: \" + r.res.humanErrorMsg;\n\n\tret_buf = translate_addresses_buf(abfd, addr);\n\n\tfree (syms);\n\tsyms = NULL;\n\n\tbfd_close(abfd);\n\treturn true;\n}\n\n#define MAX_DEPTH 16\n\nstruct file_match {\n\tconst char *file;\n\tvoid *address;\n\tvoid *base;\n\tvoid *hdr;\n};\n\n#ifndef __APPLE__\nstatic int find_matching_file(struct dl_phdr_info *info,\n\t\tsize_t size, void *data)\n{\n\tstruct file_match *match = (struct file_match*) data;\n\t\/* This code is modeled from Gfind_proc_info-lsb.c:callback() from libunwind *\/\n\tlong n;\n\tconst ElfW(Phdr) *phdr;\n\tElfW(Addr) load_base = info->dlpi_addr;\n\tphdr = info->dlpi_phdr;\n\tfor (n = info->dlpi_phnum; --n >= 0; phdr++) {\n\t\tif (phdr->p_type == PT_LOAD) {\n\t\t\tElfW(Addr) vaddr = phdr->p_vaddr + load_base;\n\t\t\tif (match->address >= vaddr && match->address < vaddr + phdr->p_memsz) {\n\t\t\t\t\/* we found a match *\/\n\t\t\t\tmatch->file = info->dlpi_name;\n\t\t\t\tmatch->base = info->dlpi_addr;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\n#endif\n\nchar **backtrace_symbols(void *const *buffer, int size)\n{\n\tint stack_depth = size - 1;\n\tint x,y;\n\t\/* discard calling function *\/\n\tint total = 0;\n\n\tchar **final;\n\tchar *f_strings;\n\n\tstd::vector<std::string> locations(stack_depth + 1);\n\n\tbfd_init();\n\tfor(x=stack_depth, y=0; x>=0; x--, y++){\n\t\tstd::string ret_buf;\n\t\tconst void* xaddr = buffer[x];\n\t\tbfd_vma addr = (bfd_vma)xaddr;\n\t\tResult r = true;\n#ifndef __APPLE__\n\t\tstruct file_match match;\n\t\tmatch.address = buffer[x];\n\t\tdl_iterate_phdr(find_matching_file, &match);\n\t\taddr = buffer[x] - match.base;\n\t\tif (match.file && strlen(match.file))\n\t\t\tr = process_file(match.file, addr, ret_buf);\n\t\telse\n#endif\n\t\t\tr = process_file(GetBinaryFilename(), addr, ret_buf);\n\t\tif(r)\n\t\t\tlocations[x] = ret_buf;\n\t\telse\n\t\t\tlocations[x] = \"<\" + r.humanErrorMsg + \">\";\n\t\ttotal += locations[x].size() + 1;\n\t}\n\n\t\/* allocate the array of char* we are going to return and extra space for\n\t * all of the strings *\/\n\tfinal = (char**)malloc(total + (stack_depth + 1) * sizeof(char*));\n\t\/* get a pointer to the extra space *\/\n\tf_strings = (char*)(final + stack_depth + 1);\n\n\t\/* fill in all of strings and pointers *\/\n\tfor(x=stack_depth; x>=0; x--){\n\t\tstrcpy(f_strings, locations[x].c_str());\n\t\tfinal[x] = f_strings;\n\t\tf_strings += strlen(f_strings) + 1;\n\t}\n\n\treturn final;\n}\n\nvoid\nbacktrace_symbols_fd(void *const *buffer, int size, int fd)\n{\n        int j;\n        char **strings;\n\n        strings = backtrace_symbols(buffer, size);\n\t\tif (strings == NULL) return;\n\n        for (j = 0; j < size; j++)\n\t\tprintf(\"%s\\n\", strings[j]);\n\n        free(strings);\n}\n\n\/\/ Not sure on this. Linking failed on Mac.\n\/\/ Found it here: http:\/\/www.mail-archive.com\/uclinux-dev@uclinux.org\/msg02347.html\n#ifndef HAVE_LIBINTL_DGETTEXT\nextern \"C\"\nconst char *libintl_dgettext (const char *domain, const char *msg)\n{\n  return msg;\n}\n#endif \/* !HAVE_LIBINTL_DGETTEXT *\/\n\n#endif \/\/ HASBFD\n<|endoftext|>"}
{"text":"<commit_before>#include \"Atm_step.h\"\n\nAtm_step & Atm_step::begin( void )\n{\n  const static state_t state_table[] PROGMEM = {\n    \/*            ON_ENTER    ON_LOOP  ON_EXIT  EVT_STEP  EVT_SWEEP  EVT_BURST  EVT_LINEAR   ELSE *\/\n    \/* IDLE    *\/       -1,        -1,      -1,   LINEAR,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* LINEAR  *\/       -1,        -1,      -1,       S0,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* S0      *\/   ACT_S0,        -1,      -1,       S1,     SWEEP,     BURST,     LINEAR,    -1, \/\/ Linear mode\n    \/* S1      *\/   ACT_S1,        -1,      -1,       S2,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* S2      *\/   ACT_S2,        -1,      -1,       S3,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* S3      *\/   ACT_S3,        -1,      -1,       S4,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* S4      *\/   ACT_S4,        -1,      -1,       S5,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* S5      *\/   ACT_S5,        -1,      -1,       S6,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* S6      *\/   ACT_S6,        -1,      -1,       S7,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* S7      *\/   ACT_S7,        -1,      -1,       S0,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* SWEEP   *\/       -1,        -1,      -1,       X0,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* X0      *\/   ACT_S0,        -1,      -1,       X1,     SWEEP,     BURST,     LINEAR,    -1, \/\/ Sweep mode\n    \/* X1      *\/   ACT_S1,        -1,      -1,       X2,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* X2      *\/   ACT_S2,        -1,      -1,       X3,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* X3      *\/   ACT_S3,        -1,      -1,       X4,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* X4      *\/   ACT_S4,        -1,      -1,       X5,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* X5      *\/   ACT_S5,        -1,      -1,       X6,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* X6      *\/   ACT_S6,        -1,      -1,       X7,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* X7      *\/   ACT_S7,        -1,      -1,       X8,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* X8      *\/   ACT_S6,        -1,      -1,       X9,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* X9      *\/   ACT_S5,        -1,      -1,       XA,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* XA      *\/   ACT_S4,        -1,      -1,       XB,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* XB      *\/   ACT_S3,        -1,      -1,       XC,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* XC      *\/   ACT_S2,        -1,      -1,       XD,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* XD      *\/   ACT_S1,        -1,      -1,       X0,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* BURST   *\/       -1,        -1,      -1,       U0,     SWEEP,     BURST,     LINEAR,    -1, \/\/ Burst mode\t\n    \/* U0      *\/   ACT_S0,        -1,      -1,       -1,     SWEEP,     BURST,     LINEAR,    U1, \n    \/* U1      *\/   ACT_S1,        -1,      -1,       -1,     SWEEP,     BURST,     LINEAR,    U2,\n    \/* U2      *\/   ACT_S2,        -1,      -1,       -1,     SWEEP,     BURST,     LINEAR,    U3,\n    \/* U3      *\/   ACT_S3,        -1,      -1,       -1,     SWEEP,     BURST,     LINEAR,    U4,\n    \/* U4      *\/   ACT_S4,        -1,      -1,       -1,     SWEEP,     BURST,     LINEAR,    U5,\n    \/* U5      *\/   ACT_S5,        -1,      -1,       -1,     SWEEP,     BURST,     LINEAR,    U6,\n    \/* U6      *\/   ACT_S6,        -1,      -1,       -1,     SWEEP,     BURST,     LINEAR,    U7,\n    \/* U7      *\/   ACT_S7,        -1,      -1,       -1,     SWEEP,     BURST,     LINEAR, BURST,\n  };\n  Machine::begin( state_table, ELSE );\n  return *this;\n}\n\nAtm_step & Atm_step::onStep( uint8_t idx, stepcb_t callback )\n{\n  _step[idx]._mode = MODE_CALLBACK;\n  _step[idx]._callback = callback;\n  return *this;\n}\n\nAtm_step & Atm_step::onStep( uint8_t idx, Machine * machine, state_t event \/* = 0 *\/ )\n{\n  _step[idx]._mode = MODE_MACHINE;\n  _step[idx]._client_machine = machine;\n  _step[idx]._client_machine_event = event;\n  return *this;\n}\n\nAtm_step & Atm_step::onStep( uint8_t idx, const char * label, state_t event \/* = 0 *\/ )\n{\n  _step[idx]._mode = MODE_FACTORY;\n  _step[idx]._client_label = label;\n  _step[idx]._client_label_event = event;\n  return *this;\n}\n\nint Atm_step::event( int id )\n{\n  switch (id ) {\n    case EVT_STEP: \/\/ TODO CHANGE TO TINY_READ_STATE for Tiny Machine!!!\n      state_t on_enter = read_state( state_table + ( current * state_width ) + ATM_ON_ENTER );\n      return ( on_enter > -1 ) && ( _step[on_enter]._mode == 0 );\n  }\n  return 0;\n}\n\nvoid Atm_step::action( int id )\n{\n  if ( id > -1 ) {\n    switch ( _step[id]._mode ) {\n      case MODE_CALLBACK:\n        flags |= ATM_CALLBACK_FLAG;\n        (*_step[id]._callback)( id );\n        flags &= ~ATM_CALLBACK_FLAG;\n        return;\n      case MODE_MACHINE:\n        _step[id]._client_machine->trigger( _step[id]._client_machine_event );\n        return;\n      case MODE_FACTORY:\n        factory->trigger( _step[id]._client_label, _step[id]._client_label_event );\n        return;\n    }\n  }\n}\n\nAtm_step & Atm_step::trace( Stream * stream ) {\n\n  setTrace( stream, atm_serial_debug::trace,\n            \"EVT_STEP\\0EVT_SWEEP\\0EVT_BURST\\0EVT_RESET\\0ELSE\\0\"\n\t\t\t\"IDLE\\0LINEAR\\0S0\\0S1\\0S2\\0S3\\0S4\\0S5\\0S6\\0S7\\0\"\n\t\t\t\"SWEEP\\0X0\\0X1\\0X2\\0X3\\0X4\\0X5\\0X6\\0X7\\0X8\\0X9\\0XA\\0XB\\0XC\\0XD\\0\"\n\t\t\t\"BURST\\0U0\\0U1\\0U2\\0U3\\0U4\\0U5\\0U6\\0U7\" );\n\t\t\treturn *this;\n}\n\n\n<commit_msg>Fixed Atm_step::trace()<commit_after>#include \"Atm_step.h\"\n\nAtm_step & Atm_step::begin( void )\n{\n  const static state_t state_table[] PROGMEM = {\n    \/*            ON_ENTER    ON_LOOP  ON_EXIT  EVT_STEP  EVT_SWEEP  EVT_BURST  EVT_LINEAR   ELSE *\/\n    \/* IDLE    *\/       -1,        -1,      -1,   LINEAR,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* LINEAR  *\/       -1,        -1,      -1,       S0,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* S0      *\/   ACT_S0,        -1,      -1,       S1,     SWEEP,     BURST,     LINEAR,    -1, \/\/ Linear mode\n    \/* S1      *\/   ACT_S1,        -1,      -1,       S2,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* S2      *\/   ACT_S2,        -1,      -1,       S3,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* S3      *\/   ACT_S3,        -1,      -1,       S4,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* S4      *\/   ACT_S4,        -1,      -1,       S5,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* S5      *\/   ACT_S5,        -1,      -1,       S6,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* S6      *\/   ACT_S6,        -1,      -1,       S7,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* S7      *\/   ACT_S7,        -1,      -1,       S0,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* SWEEP   *\/       -1,        -1,      -1,       X0,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* X0      *\/   ACT_S0,        -1,      -1,       X1,     SWEEP,     BURST,     LINEAR,    -1, \/\/ Sweep mode\n    \/* X1      *\/   ACT_S1,        -1,      -1,       X2,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* X2      *\/   ACT_S2,        -1,      -1,       X3,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* X3      *\/   ACT_S3,        -1,      -1,       X4,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* X4      *\/   ACT_S4,        -1,      -1,       X5,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* X5      *\/   ACT_S5,        -1,      -1,       X6,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* X6      *\/   ACT_S6,        -1,      -1,       X7,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* X7      *\/   ACT_S7,        -1,      -1,       X8,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* X8      *\/   ACT_S6,        -1,      -1,       X9,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* X9      *\/   ACT_S5,        -1,      -1,       XA,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* XA      *\/   ACT_S4,        -1,      -1,       XB,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* XB      *\/   ACT_S3,        -1,      -1,       XC,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* XC      *\/   ACT_S2,        -1,      -1,       XD,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* XD      *\/   ACT_S1,        -1,      -1,       X0,     SWEEP,     BURST,     LINEAR,    -1,\n    \/* BURST   *\/       -1,        -1,      -1,       U0,     SWEEP,     BURST,     LINEAR,    -1, \/\/ Burst mode\t\n    \/* U0      *\/   ACT_S0,        -1,      -1,       -1,     SWEEP,     BURST,     LINEAR,    U1, \n    \/* U1      *\/   ACT_S1,        -1,      -1,       -1,     SWEEP,     BURST,     LINEAR,    U2,\n    \/* U2      *\/   ACT_S2,        -1,      -1,       -1,     SWEEP,     BURST,     LINEAR,    U3,\n    \/* U3      *\/   ACT_S3,        -1,      -1,       -1,     SWEEP,     BURST,     LINEAR,    U4,\n    \/* U4      *\/   ACT_S4,        -1,      -1,       -1,     SWEEP,     BURST,     LINEAR,    U5,\n    \/* U5      *\/   ACT_S5,        -1,      -1,       -1,     SWEEP,     BURST,     LINEAR,    U6,\n    \/* U6      *\/   ACT_S6,        -1,      -1,       -1,     SWEEP,     BURST,     LINEAR,    U7,\n    \/* U7      *\/   ACT_S7,        -1,      -1,       -1,     SWEEP,     BURST,     LINEAR, BURST,\n  };\n  Machine::begin( state_table, ELSE );\n  return *this;\n}\n\nAtm_step & Atm_step::onStep( uint8_t idx, stepcb_t callback )\n{\n  _step[idx]._mode = MODE_CALLBACK;\n  _step[idx]._callback = callback;\n  return *this;\n}\n\nAtm_step & Atm_step::onStep( uint8_t idx, Machine * machine, state_t event \/* = 0 *\/ )\n{\n  _step[idx]._mode = MODE_MACHINE;\n  _step[idx]._client_machine = machine;\n  _step[idx]._client_machine_event = event;\n  return *this;\n}\n\nAtm_step & Atm_step::onStep( uint8_t idx, const char * label, state_t event \/* = 0 *\/ )\n{\n  _step[idx]._mode = MODE_FACTORY;\n  _step[idx]._client_label = label;\n  _step[idx]._client_label_event = event;\n  return *this;\n}\n\nint Atm_step::event( int id )\n{\n  switch (id ) {\n    case EVT_STEP: \/\/ TODO CHANGE TO TINY_READ_STATE for Tiny Machine!!!\n      state_t on_enter = read_state( state_table + ( current * state_width ) + ATM_ON_ENTER );\n      return ( on_enter > -1 ) && ( _step[on_enter]._mode == 0 );\n  }\n  return 0;\n}\n\nvoid Atm_step::action( int id )\n{\n  if ( id > -1 ) {\n    switch ( _step[id]._mode ) {\n      case MODE_CALLBACK:\n        flags |= ATM_CALLBACK_FLAG;\n        (*_step[id]._callback)( id );\n        flags &= ~ATM_CALLBACK_FLAG;\n        return;\n      case MODE_MACHINE:\n        _step[id]._client_machine->trigger( _step[id]._client_machine_event );\n        return;\n      case MODE_FACTORY:\n        factory->trigger( _step[id]._client_label, _step[id]._client_label_event );\n        return;\n    }\n  }\n}\n\nAtm_step & Atm_step::trace( Stream * stream ) {\n\n  setTrace( stream, atm_serial_debug::trace,\n            \"EVT_STEP\\0EVT_SWEEP\\0EVT_BURST\\0EVT_LINEAR\\0ELSE\\0\"\n\t\t\t\"IDLE\\0LINEAR\\0S0\\0S1\\0S2\\0S3\\0S4\\0S5\\0S6\\0S7\\0\"\n\t\t\t\"SWEEP\\0X0\\0X1\\0X2\\0X3\\0X4\\0X5\\0X6\\0X7\\0X8\\0X9\\0XA\\0XB\\0XC\\0XD\\0\"\n\t\t\t\"BURST\\0U0\\0U1\\0U2\\0U3\\0U4\\0U5\\0U6\\0U7\" );\n\t\t\treturn *this;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <vector>\n\nusing std::vector; using std::cout; using std::endl; using std::cin;\n\nint main()\n{\n  vector<int> ivec;\n  int i;\n  while (cin >> i)\n    ivec.push_back(i);  \n  \n  if (ivec.empty())\n  {\n    cout << \"input at least one integer.\" << endl;\n    return -1;\n  }\n  if (ivec.size() == 1)\n  {\n    cout << \"only one integer \"<<ivec[0]<< \",it doesn't have any adjacent elements.\"<<endl;\n\treturn -1;\n  }\n  for(decltype(ivec.size()) i=0; i!=ivec.size()-1; ++i)\n    cout << ivec[i] + ivec[i+1] << \" \";\n  cout << endl;\n  return 0;\n}\n<commit_msg>Update ex3_20a.cpp<commit_after>#include <iostream>\n#include <vector>\n\nusing std::vector; using std::cout; using std::endl; using std::cin;\n\nint main()\n{\n    vector<int> ivec;\n    for (int i; cin >> i; ivec.push_back(i));\n\n    if (ivec.empty())\n    {\n        cout << \"input at least one integer.\" << endl;\n        return -1;\n    }\n\n    if (ivec.size() == 1)\n    {\n        cout << \"only one integer \" << ivec[0] << \",it doesn't have any adjacent elements.\" << endl;\n        return -1;\n    }\n\n    for (int i = 0; i != ivec.size() - 1; ++i)\n        cout << ivec[i] + ivec[i + 1] << \" \";\n    cout << endl;\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  ex11_23.cpp\n\/\/  Exercise 11.23\n\/\/\n\/\/  Created by pezy on 12\/16\/14.\n\/\/  Copyright (c) 2014 pezy. All rights reserved.\n\/\/\n\/\/  Rewrite the map that stored vectors of children’s names with a key that is\n\/\/  the family last name for the exercises in 11.2.1 (p. 424) to use a multimap.\n\n#include <map>\n#include <string>\n#include <iostream>\n\nusing std::string;\n\nint main()\n{\n    std::multimap<string, string> families;\n    for (string lastName, childName; std::cin >> childName >> lastName;\n         families.emplace(lastName, childName))\n        ;\n    for (const auto& s : families)\n        std::cout << s.second << \" \" << s.first << std::endl;\n}<commit_msg>Update ex11_23.cpp<commit_after>\/\/\n\/\/  ex11_23.cpp\n\/\/  Exercise 11.23\n\/\/\n\/\/  Created by pezy on 12\/16\/14.\n\/\/  Copyright (c) 2014 pezy. All rights reserved.\n\/\/\n\/\/  Rewrite the map that stored vector of children’s names with a key that is\n\/\/  the family last name for the exercises in 11.2.1 (p. 424) to use a multimap.\n\n#include <iostream>\n#include <map>\n#include <string>\n\nusing namespace std;\n\nint main()\n{\n    multimap<string, string> families;\n    for(string lastName, childName; cin>>childName>>lastName; families.emplace(lastName, childName))\n        ;\n\n    for(const auto &e:families)\n        cout<<e.second<<\" \"<<e.first<<endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 3 of the License, or\n * (at your option) any later version.\n *\n * Written (W) 2012 Chiyuan Zhang\n * Copyright (C) 2012 Chiyuan Zhang\n *\/\n\n#include <shogun\/lib\/Map.h>\n#include <shogun\/machine\/KernelMulticlassMachine.h>\n\nusing namespace shogun;\n\nvoid CKernelMulticlassMachine::store_model_features()\n{\n    CKernel *kernel = ((CKernelMachine *)m_machine)->get_kernel();\n\tif (!kernel)\n\t\tSG_ERROR(\"kernel is needed to store SV features.\\n\");\n\n\tCFeatures* lhs = kernel->get_lhs();\n\tCFeatures* rhs = kernel->get_rhs();\n\tif (!lhs)\n\t\tSG_ERROR(\"kernel lhs is needed to store SV features.\\n\");\n\n    CMap<int32_t, int32_t> all_sv;\n    for (int32_t i=0; i < m_machines->get_num_elements(); ++i)\n    {\n        CKernelMachine *machine = (CKernelMachine *)get_machine(i);\n        for (int32_t j=0; j < machine->get_num_support_vectors(); ++j)\n            all_sv.add(machine->get_support_vector(j), 0);\n\n        SG_UNREF(machine);\n    }\n\n    SGVector<int32_t> sv_idx(all_sv.get_num_elements());\n    for (index_t i=0; i < sv_idx.vlen; ++i)\n        sv_idx[i] = all_sv.get_element(i);\n\n    for (index_t i=0; i < sv_idx.vlen; ++i)\n        *all_sv.get_element_ptr(all_sv.index_of(sv_idx[i])) = i;\n\n\tCFeatures* sv_features=lhs->copy_subset(sv_idx);\n\n    kernel->init(sv_features, rhs);\n\n    for (int32_t i=0; i < m_machines->get_num_elements(); ++i)\n    {\n        CKernelMachine *machine = (CKernelMachine *)get_machine(i);\n\n        for (int32_t j=0; j < machine->get_num_support_vectors(); ++j)\n            machine->set_support_vector(j, all_sv.get_element(all_sv.index_of(machine->get_support_vector(j))));\n\n        SG_UNREF(machine);\n    }\n\n    SG_UNREF(lhs);\n    SG_UNREF(rhs);\n    SG_UNREF(kernel);\n}\n<commit_msg>fixed store_model_features, which didnt work before, causing x-val on multi class kernel machines to fail badly<commit_after>\/*\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 3 of the License, or\n * (at your option) any later version.\n *\n * Written (W) 2012 Chiyuan Zhang\n * Written (W) 2012 Heiko Strathmann\n * Copyright (C) 2012 Chiyuan Zhang\n *\/\n\n#include <shogun\/lib\/Set.h>\n#include <shogun\/machine\/KernelMulticlassMachine.h>\n\nusing namespace shogun;\n\nvoid CKernelMulticlassMachine::store_model_features()\n{\n\tCKernel *kernel=((CKernelMachine *)m_machine)->get_kernel();\n\tif (!kernel)\n\t\tSG_ERROR(\"kernel is needed to store SV features.\\n\");\n\n\tCFeatures* lhs=kernel->get_lhs();\n\tCFeatures* rhs=kernel->get_rhs();\n\tif (!lhs)\n\t{\n\t\tSG_ERROR(\"%s::store_model_features(): kernel lhs is needed to store \"\n\t\t\"SV features.\\n\");\n\t}\n\n\t\/* this map will be abused as a map *\/\n\tCSet<index_t> all_sv;\n\tfor (index_t i=0; i<m_machines->get_num_elements(); ++i)\n\t{\n\t\tCKernelMachine *machine=(CKernelMachine *)get_machine(i);\n\t\tfor (index_t j=0; j<machine->get_num_support_vectors(); ++j)\n\t\t\tall_sv.add(machine->get_support_vector(j));\n\n\t\tSG_UNREF(machine);\n\t}\n\n\t\/* convert map to vector of SV *\/\n\tSGVector<index_t> sv_idx(all_sv.get_num_elements());\n\tfor (index_t i=0; i<sv_idx.vlen; ++i)\n\t\tsv_idx[i]=*all_sv.get_element_ptr(i);\n\n\tCFeatures* sv_features=lhs->copy_subset(sv_idx);\n\n\t\/* now, features are replaced by concatenated SV features *\/\n\tkernel->init(sv_features, rhs);\n\n\t\/* now the old SV indices have to be mapped to the new features *\/\n\n\t\/* update SV of all machines *\/\n\tfor (int32_t i=0; i<m_machines->get_num_elements(); ++i)\n\t{\n\t\tCKernelMachine *machine=(CKernelMachine *)get_machine(i);\n\n\t\t\/* for each machine, replace SV by index in sv_idx array *\/\n\t\tfor (int32_t j=0; j<machine->get_num_support_vectors(); ++j)\n\t\t{\n\t\t\t\/* get index of SV in old features *\/\n\t\t\tindex_t current_sv_idx=machine->get_support_vector(j);\n\n\t\t\t\/* the position of this old index in the map is the position of\n\t\t\t * the SV in the new features *\/\n\t\t\tindex_t new_sv_idx=all_sv.index_of(current_sv_idx);\n\n\t\t\tmachine->set_support_vector(j, new_sv_idx);\n\t\t}\n\n\t\tSG_UNREF(machine);\n\t}\n\n\tSG_UNREF(lhs);\n\tSG_UNREF(rhs);\n\tSG_UNREF(kernel);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2008-2016 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 of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\n * \n * For more details, see www.mrtrix.org\n * \n *\/\n\n\n#include \"command.h\"\n#include \"algo\/histogram.h\"\n#include \"algo\/loop.h\"\n\n#include \"image.h\"\n\n#include \"sparse\/fixel_metric.h\"\n#include \"sparse\/keys.h\"\n#include \"sparse\/image.h\"\n\n\nusing namespace MR;\nusing namespace App;\n\nusing Sparse::FixelMetric;\n\nvoid usage ()\n{\n  AUTHOR = \"Robert E. Smith (robert.smith@florey.edu.au)\";\n\n  DESCRIPTION\n  + \"Generate a histogram of fixel values.\";\n\n  ARGUMENTS\n  + Argument (\"input\", \"the input fixel image.\").type_image_in ();\n\n  OPTIONS\n  + Algo::Histogram::Options;\n}\n\n\nvoid run ()\n{\n  Sparse::Image<FixelMetric> input (argument[0]);\n\n  auto opt = get_options(\"mask\");\n  std::unique_ptr<Sparse::Image<FixelMetric> > mask_ptr;\n  if (opt.size()) {\n    mask_ptr.reset (new Sparse::Image<FixelMetric> (opt[0][0]));\n    check_dimensions (input, *mask_ptr);\n  }\n\n  File::OFStream output (argument[1]);\n\n  size_t nbins = get_option_value (\"bins\", 0);\n  Algo::Histogram::Calibrator calibrator (nbins, get_options (\"ignorezero\").size());\n\n  opt = get_options (\"template\");\n  if (opt.size()) {\n    calibrator.from_file (opt[0][0]);\n  } else {\n    for (auto i = Loop (input) (input); i; ++i) {\n      if (mask_ptr) {\n        assign_pos_of (input).to (*mask_ptr);\n        if (input.value().size() != mask_ptr->value().size())\n          throw Exception (\"the input fixel image and mask image to not have corrresponding fixels\");\n      }\n      for (size_t fixel = 0; fixel != input.value().size(); ++fixel) {\n        if (mask_ptr) {\n          if (mask_ptr->value()[fixel].value > 0.5)\n            calibrator (input.value()[fixel].value);\n        } else {\n          calibrator (input.value()[fixel].value);\n        }\n      }\n    }\n    calibrator.finalize (1, false);\n  }\n\n  Algo::Histogram::Data histogram (calibrator);\n\n  for (auto i = Loop (input) (input); i; ++i) {\n    if (mask_ptr)\n      assign_pos_of (input).to (*mask_ptr);\n\n    for (size_t fixel = 0; fixel != input.value().size(); ++fixel) {\n      if (mask_ptr) {\n        if (mask_ptr->value()[fixel].value > 0.5)\n          histogram (input.value()[fixel].value);\n      } else {\n        histogram (input.value()[fixel].value);\n      }\n    }\n  }\n\n  for (size_t i = 0; i != nbins; ++i)\n    output << (calibrator.get_min() + ((i+0.5) * calibrator.get_bin_width())) << \",\";\n  output << \"\\n\";\n  for (size_t i = 0; i != nbins; ++i)\n    output << histogram[i] << \",\";\n  output << \"\\n\";\n}\n<commit_msg>removed fixelhistogram since fixel data files can now be fed into mrstats<commit_after><|endoftext|>"}
{"text":"<commit_before>#ifndef STAN__MATH__MATRIX__SPARSE_MULTIPLY_HPP\n#define STAN__MATH__MATRIX__SPARSE_MULTIPLY_HPP\n\n#include <vector>\n#include <boost\/math\/tools\/promotion.hpp>\n\n#include <stan\/math\/prim\/mat\/fun\/Eigen.hpp>\n\nnamespace stan {\n\n  namespace math {\n\n    \/** Return the multiplication of the sparse matrix spefcified by\n     * by values and indexing by the specified dense vector.\n     *\n     * The sparse matrix X of dimension m by n is represented by the\n     * vector w (of values), the integer array v (containing one-based\n     * row index of each value), the integer array u (containing\n     * one-based indexes of where each column starts in w), and the\n     * integer array z (containing the number of non-zero entries in\n     * each column of w).\n     *\n     * @tparam T1 Type of sparse matrix entries.\n     * @tparam T2 Type of dense vector entries.\n     * @param m Rows in matrix.\n     * @param n Columns in matrix.\n     * @param v One-based row index of each value.\n     * @param u one-based index of where each column starts in w.\n     * @param z number of non-zer entries in each column of w.\n     * @return dense vector for the product.\n     * @throw ... explain error conditions briefly ...\n     *\/\n    template <typename T1, typename T2>\n    inline\n    Eigen::Matrix<typename boost::math::tools::promote_args<T1, T2>::type, Eigen::Dynamic, 1>\n    sparse_multiply_csc(const int& m,\n                    const int& n,\n                    const Eigen::Matrix<T1, Eigen::Dynamic,1>& w,\n                    const std::vector<int>& v,\n                    const std::vector<int>& u,\n                    const std::vector<int>& z,\n                    const Eigen::Matrix<T2, Eigen::Dynamic,1>& b) {\n\n      \/\/ a whole bunch of error checking goes here, e.g., m, n > 0,\n      \/\/ etc. etc.  we can't throw index out of bounds exceptions at\n      \/\/ run time\n\n      typedef typename boost::math::tools::promote_args<T1, T2>::type fun_scalar_t;\n      Eigen::Matrix<fun_scalar_t, Eigen::Dynamic, 1>  y(m);\n      for (int j = 0; j < n; ++j) {\n        int end = u[j] + z[j] - 1;\n        for (int q = u[j] - 1; q < end; ++q)\n          y(v[q]-1) += w[q] * b(j);\n      }\n      return y;\n    }\n\n    \/** Return the multiplication of the sparse matrix spefcified by\n     * by values and indexing by the specified dense vector.\n     *\n     * The sparse matrix X of dimension m by n is represented by the\n     * vector w (of values), the integer array v (containing one-based\n     * column index of each value), the integer array u (containing\n     * one-based indexes of where each row starts in w), and the\n     * integer array z (containing the number of non-zero entries in\n     * each row of w).\n     *\n     * @tparam T1 Type of sparse matrix entries.\n     * @tparam T2 Type of dense vector entries.\n     * @param m Rows in matrix.\n     * @param n Columns in matrix.\n     * @param v One-based column index of each value.\n     * @param u one-based index of where each row starts in w.\n     * @param z number of non-zero entries in each row of w.\n     * @return dense vector for the product.\n     * @throw ... explain error conditions briefly ...\n     *\/\n    template <typename T1, typename T2>\n    inline\n    Eigen::Matrix<typename boost::math::tools::promote_args<T1, T2>::type, Eigen::Dynamic, 1>\n    sparse_multiply_csr(const int& m,\n                    const int& n,\n                    const Eigen::Matrix<T1, Eigen::Dynamic,1>& w,\n                    const std::vector<int>& v,\n                    const std::vector<int>& u,\n                    const std::vector<int>& z,\n                    const Eigen::Matrix<T2, Eigen::Dynamic,1>& b) {\n\n      \/\/ a whole bunch of error checking goes here, e.g., m, n > 0,\n      \/\/ etc. etc.  we can't throw index out of bounds exceptions at\n      \/\/ run time\n\n      typedef typename boost::math::tools::promote_args<T1, T2>::type fun_scalar_t;\n      Eigen::Matrix<fun_scalar_t, Eigen::Dynamic, 1>  y(m);\n      for (int i = 0; i < m; ++i) {\n        int end = u[i] + z[i] - 1;\n        int p = 0;\n        Eigen::Matrix<T2,Eigen::Dynamic,1> b_sub(z[i]);\n        for (int q = u[i]-1; q < end; ++q) {\n          b_sub(p) = b(v[q]-1); \n          ++p;\n        }\n        Eigen::Matrix<T2,Eigen::Dynamic,1> w_sub = w.segment(u[i]-1,z[i]);\n\/\/        y(i) = stan::math::dot_product(w.segment(u[i]-1,z[i]),b_sub.segment(0,p-1));\n        y(i) = stan::math::dot_product(w_sub,b_sub);\n      }\n      return y;\n    }\n\n  }\n\n}\n\n#endif\n\n\n<commit_msg>Added check_ calls to sparse_multiply_csr.<commit_after>#ifndef STAN__MATH__MATRIX__SPARSE_MULTIPLY_HPP\n#define STAN__MATH__MATRIX__SPARSE_MULTIPLY_HPP\n\n#include <vector>\n#include <boost\/math\/tools\/promotion.hpp>\n\n#include <stan\/math\/prim\/mat\/fun\/Eigen.hpp>\n\n#include <stan\/math\/prim\/scal\/err\/check_equal.hpp>\n#include <stan\/math\/prim\/scal\/err\/check_positive.hpp>\n\nnamespace stan {\n\n  namespace math {\n\n    \/** Return the multiplication of the sparse matrix spefcified by\n     * by values and indexing by the specified dense vector.\n     *\n     * The sparse matrix X of dimension m by n is represented by the\n     * vector w (of values), the integer array v (containing one-based\n     * row index of each value), the integer array u (containing\n     * one-based indexes of where each column starts in w), and the\n     * integer array z (containing the number of non-zero entries in\n     * each column of w).\n     *\n     * @tparam T1 Type of sparse matrix entries.\n     * @tparam T2 Type of dense vector entries.\n     * @param m Rows in matrix.\n     * @param n Columns in matrix.\n     * @param v One-based row index of each value.\n     * @param u one-based index of where each column starts in w.\n     * @param z number of non-zer entries in each column of w.\n     * @return dense vector for the product.\n     * @throw ... explain error conditions briefly ...\n     *\/\n    template <typename T1, typename T2>\n    inline\n    Eigen::Matrix<typename boost::math::tools::promote_args<T1, T2>::type, Eigen::Dynamic, 1>\n    sparse_multiply_csc(const int& m,\n                    const int& n,\n                    const Eigen::Matrix<T1, Eigen::Dynamic,1>& w,\n                    const std::vector<int>& v,\n                    const std::vector<int>& u,\n                    const std::vector<int>& z,\n                    const Eigen::Matrix<T2, Eigen::Dynamic,1>& b) {\n\n      \/\/ a whole bunch of error checking goes here, e.g., m, n > 0,\n      \/\/ etc. etc.  we can't throw index out of bounds exceptions at\n      \/\/ run time\n\n      typedef typename boost::math::tools::promote_args<T1, T2>::type fun_scalar_t;\n      Eigen::Matrix<fun_scalar_t, Eigen::Dynamic, 1>  y(m);\n      for (int j = 0; j < n; ++j) {\n        int end = u[j] + z[j] - 1;\n        for (int q = u[j] - 1; q < end; ++q)\n          y(v[q]-1) += w[q] * b(j);\n      }\n      return y;\n    }\n\n    \/** Return the multiplication of the sparse matrix (specified by\n     * by values and indexing) by the specified dense vector.\n     *\n     * The sparse matrix X of dimension m by n is represented by the\n     * vector w (of values), the integer array v (containing one-based\n     * column index of each value), the integer array u (containing\n     * one-based indexes of where each row starts in w), and the\n     * integer array z (containing the number of non-zero entries in\n     * each row of w).\n     *\n     * @tparam T1 Type of sparse matrix entries.\n     * @tparam T2 Type of dense vector entries.\n     * @param m Number of rows in matrix.\n     * @param n Number of columns in matrix.\n\t\t * @param w Vector of non-zero values in matrix.\n     * @param v One-based column index of each non-zero value, same\n\t\t *          length as w.\n     * @param u one-based index of where each row starts in w, equal to\n\t\t *          the number of rows plus one.\n     * @param z number of non-zero entries in each row of w, equal to\n\t\t *          the number of rows..\n     * @return dense vector for the product.\n     * @throw ... explain error conditions briefly ...\n     *\/\n    template <typename T1, typename T2>\n    inline\n    Eigen::Matrix<typename boost::math::tools::promote_args<T1, T2>::type, Eigen::Dynamic, 1>\n    sparse_multiply_csr(const int& m,\n                    const int& n,\n                    const Eigen::Matrix<T1, Eigen::Dynamic,1>& w,\n                    const std::vector<int>& v,\n                    const std::vector<int>& u,\n                    const std::vector<int>& z,\n                    const Eigen::Matrix<T2, Eigen::Dynamic,1>& b) {\n\n\t\t\tstan::math::check_positive(\"sparse_multiply_csr\",\"m\",m);\n\t\t\tstan::math::check_positive(\"sparse_multiply_csr\",\"n\",n);\n\t\t\tstan::math::check_equal(\"sparse_multiply_csr\",\"n\/b\", n, b.size());\n\t\t\tstan::math::check_equal(\"sparse_multiply_csr\",\"m\/u\", m, u.size()-1);\n\t\t\tstan::math::check_equal(\"sparse_multiply_csr\",\"m\/z\", m, z.size()  );\n\t\t\tstan::math::check_equal(\"sparse_multiply_csr\",\"w\/v\", w.size(), v.size());\n\t\t\tstan::math::check_equal(\"sparse_multiply_csr\",\"u\/z\/v\", u[m-1]+z[m-1]-1, v.size());\n\n      typedef typename boost::math::tools::promote_args<T1, T2>::type fun_scalar_t;\n      Eigen::Matrix<fun_scalar_t, Eigen::Dynamic, 1>  y(m);\n      for (int i = 0; i < m; ++i) {\n        int end = u[i] + z[i] - 1;\n        int p = 0;\n        Eigen::Matrix<T2,Eigen::Dynamic,1> b_sub(z[i]);\n        for (int q = u[i]-1; q < end; ++q) {\n          b_sub(p) = b(v[q]-1); \n          ++p;\n        }\n        Eigen::Matrix<T2,Eigen::Dynamic,1> w_sub = w.segment(u[i]-1,z[i]);\n        y(i) = stan::math::dot_product(w_sub,b_sub);\n      }\n      return y;\n    }\n\n  }\n\n}\n\n#endif\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Accelerometer.cpp\n *\n *  Created on: 25 May 2015\n *      Author: jeremy\n *\/\n\n#include \"Sensor.h\"\n\n\nnamespace IO\n{\n\n\tSensor::Sensor(char chan)\n\t: channel(chan)\n\t{\n\n\t\tif (!bcm2835_init())\n\t\t{\n\t\t\tstd::cout << \"Could not initialise bcm2835\" << std::endl;\n\t\t\treturn ;\n\t\t}\n\n\t\t\/\/ Bcm2835 configuration\n\t\t{\n\t\t\tbcm2835_spi_begin();\n\t\t\tbcm2835_spi_setBitOrder(BCM2835_SPI_BIT_ORDER_MSBFIRST);\t\t\/\/ The default\n\t\t\tbcm2835_spi_setDataMode(BCM2835_SPI_MODE0);\t\t\t\t\t\t\/\/ The default\n\t\t\tbcm2835_spi_setClockDivider(BCM2835_SPI_CLOCK_DIVIDER_64);\t\t\/\/\n\t\t\tbcm2835_spi_chipSelect(BCM2835_SPI_CS0);\t\t\t\t\t\t\/\/ The default\n\t\t\tbcm2835_spi_setChipSelectPolarity(BCM2835_SPI_CS0, LOW);\t\t\/\/ the default\n\t\t}\n\n\t\treturn;\n\t}\n\n\tSensor::~Sensor()\n\t{\n\n\t\t\/\/ End Spi transfer\n\t\tbcm2835_spi_end();\n\n\t\t\/\/ Close bcm2835 library\n\t\tbcm2835_close();\n\n\t\treturn;\n\t}\n\n\n\tshort Sensor::GetOutput()\n\t{\n\n\t\t\/\/ Select SPI channel\n\t\tchar data = 0b11100000 | (channel << 3);\n\n\t\tchar mosi[3] = {data};\n\t\tchar miso[3] = {0};\n\n\t\t\/\/ Receive data\n\t\tbcm2835_spi_transfernb(mosi, miso, 3);\n\n\t\t\/\/ Calculate value from received bits\n\t\tshort value = ((miso[0] & 0x01) << 11) | (miso[1] << 3) | ((miso[2] >> 5) & 0x07);\n\n\t\treturn value;\n\t}\n\n}\n\n\n<commit_msg>Changed the ADC's clock frequency.<commit_after>\/*\n * Accelerometer.cpp\n *\n *  Created on: 25 May 2015\n *      Author: jeremy\n *\/\n\n#include \"Sensor.h\"\n\n\nnamespace IO\n{\n\n\tSensor::Sensor(char chan)\n\t: channel(chan)\n\t{\n\n\t\tif (!bcm2835_init())\n\t\t{\n\t\t\tstd::cout << \"Could not initialise bcm2835\" << std::endl;\n\t\t\treturn ;\n\t\t}\n\n\t\t\/\/ Bcm2835 configuration\n\t\t{\n\t\t\tbcm2835_spi_begin();\n\t\t\tbcm2835_spi_setBitOrder(BCM2835_SPI_BIT_ORDER_MSBFIRST);\t\t\/\/ The default\n\t\t\tbcm2835_spi_setDataMode(BCM2835_SPI_MODE0);\t\t\t\t\t\t\/\/ The default\n\t\t\tbcm2835_spi_setClockDivider(BCM2835_SPI_CLOCK_DIVIDER_128);\t\t\/\/\n\t\t\tbcm2835_spi_chipSelect(BCM2835_SPI_CS0);\t\t\t\t\t\t\/\/ The default\n\t\t\tbcm2835_spi_setChipSelectPolarity(BCM2835_SPI_CS0, LOW);\t\t\/\/ the default\n\t\t}\n\n\t\treturn;\n\t}\n\n\tSensor::~Sensor()\n\t{\n\n\t\t\/\/ End Spi transfer\n\t\tbcm2835_spi_end();\n\n\t\t\/\/ Close bcm2835 library\n\t\tbcm2835_close();\n\n\t\treturn;\n\t}\n\n\n\tshort Sensor::GetOutput()\n\t{\n\n\t\t\/\/ Select SPI channel\n\t\tchar data = 0b11100000 | (channel << 3);\n\n\t\tchar mosi[3] = {data};\n\t\tchar miso[3] = {0};\n\n\t\t\/\/ Receive data\n\t\tbcm2835_spi_transfernb(mosi, miso, 3);\n\n\t\t\/\/ Calculate value from received bits\n\t\tshort value = ((miso[0] & 0x01) << 11) | (miso[1] << 3) | ((miso[2] >> 5) & 0x07);\n\n\t\treturn value;\n\t}\n\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: pluginframe.hxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 00:33:18 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n#ifndef __FRAMEWORK_SERVICES_PLUGINFRAME_HXX_\n#define __FRAMEWORK_SERVICES_PLUGINFRAME_HXX_\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  my own includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef __FRAMEWORK_SERVICES_FRAME_HXX_\n#include <services\/frame.hxx>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  interface includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef _COM_SUN_STAR_MOZILLA_XPLUGININSTANCE_HPP_\n#include <com\/sun\/star\/mozilla\/XPluginInstance.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_MOZILLA_XPLUGININSTANCEPEER_HPP_\n#include <com\/sun\/star\/mozilla\/XPluginInstancePeer.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_MOZILLA_XPLUGINWINDOWPEER_HPP_\n#include <com\/sun\/star\/mozilla\/XPluginWindowPeer.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_IO_XINPUTSTREAM_HPP_\n#include <com\/sun\/star\/io\/XInputStream.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_XINITIALIZATION_HPP_\n#include <com\/sun\/star\/lang\/XInitialization.hpp>\n#endif\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_FRAME_XDISPATCHRESULTLISTENER_HPP_\n#include <com\/sun\/star\/frame\/XDispatchResultListener.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_FRAME_FEATURESTATEEVENT_HPP_\n#include <com\/sun\/star\/frame\/FeatureStateEvent.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_EVENTOBJECT_HPP_\n#include <com\/sun\/star\/lang\/EventObject.hpp>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  other includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef _VCL_ATOM_HXX\n#include <vcl\/threadex.hxx>\n#endif\n\n#ifndef INCLUDED_SVTOOLS_CMDOPTIONS_HXX\n#include <svtools\/cmdoptions.hxx>\n#endif\n\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  namespace\n\/\/_________________________________________________________________________________________________________________\n\nnamespace framework{\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  exported const\n\/\/_________________________________________________________________________________________________________________\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  exported definitions\n\/\/_________________________________________________________________________________________________________________\n\n\/*-************************************************************************************************************\/\/**\n    @short      implements an special frame - a plugin frame\n    @descr      -\n\n    @implements XInitialization\n                XPluginInstance\n                XDispatchResultListener\n    @base       Frame\n*\/\/*-*************************************************************************************************************\/\n\nclass PlugInFrame   :   public css::lang::XInitialization           ,\n                        public css::mozilla::XPluginInstance        ,\n                        public css::frame::XDispatchResultListener  ,   \/\/ => XEVENTLISTENER\n                        public Frame                                    \/\/ Order of baseclasses is neccessary for right initialization!\n{\n    \/\/-------------------------------------------------------------------------------------------------------------\n    \/\/  public methods\n    \/\/-------------------------------------------------------------------------------------------------------------\n\n    public:\n\n        \/\/---------------------------------------------------------------------------------------------------------\n        \/\/  constructor \/ destructor\n        \/\/---------------------------------------------------------------------------------------------------------\n\n        \/*-****************************************************************************************************\/\/**\n            @short      standard constructor to create instance\n            @descr      This constructor initialize a new instance of this class,\n                        and will be set valid values on his member and baseclasses.\n\n            @seealso    -\n\n            @param      -\n            @return     -\n\n            @onerror    -\n        *\/\/*-*****************************************************************************************************\/\n\n         PlugInFrame( const css::uno::Reference< css::lang::XMultiServiceFactory >& xFactory );\n\n        \/*-****************************************************************************************************\/\/**\n            @short      standard destructor\n            @descr      This method destruct an instance of this class and clear some member.\n\n            @seealso    -\n\n            @param      -\n            @return     -\n\n            @onerror    -\n        *\/\/*-*****************************************************************************************************\/\n\n        virtual ~PlugInFrame();\n\n        \/\/---------------------------------------------------------------------------------------------------------\n        \/\/  XInterface, XTypeProvider, XServiceInfo\n        \/\/---------------------------------------------------------------------------------------------------------\n\n        DECLARE_XINTERFACE\n        DECLARE_XTYPEPROVIDER\n        DECLARE_XSERVICEINFO\n\n        \/\/---------------------------------------------------------------------------------------------------------\n        \/\/  XInitialization\n        \/\/---------------------------------------------------------------------------------------------------------\n\n        void SAL_CALL initialize( const css::uno::Sequence< css::uno::Any >& seqArguments ) throw(  css::uno::Exception         ,\n                                                                                                     css::uno::RuntimeException );\n\n        \/\/---------------------------------------------------------------------------------------------------------\n        \/\/  XPluginInstance\n        \/\/---------------------------------------------------------------------------------------------------------\n\n        void SAL_CALL start         () throw( css::uno::RuntimeException );\n        void SAL_CALL implcb_start  () throw( css::uno::RuntimeException );\n        void SAL_CALL stop          () throw( css::uno::RuntimeException );\n        void SAL_CALL implcb_stop   () throw( css::uno::RuntimeException );\n        void SAL_CALL destroy       () throw( css::uno::RuntimeException );\n        void SAL_CALL implcb_destroy() throw( css::uno::RuntimeException );\n        void SAL_CALL createWindow          (   const   css::uno::Any&      aPlatformWindowHandle   ,\n                                                        sal_Bool            bEmbedded               ) throw( css::uno::RuntimeException );\n        void SAL_CALL implcb_createWindow   (   const   css::uno::Any&      aPlatformWindowHandle   ,\n                                                        sal_Bool            bEmbedded               ) throw( css::uno::RuntimeException );\n        void SAL_CALL newStream     (   const   ::rtl::OUString&                                sMIMEDescription,\n                                        const   ::rtl::OUString&                                sURL            ,\n                                        const   ::rtl::OUString&                                sFilter         ,\n                                        const   css::uno::Reference< css::io::XInputStream >&   xStream         ,\n                                        const   css::uno::Any&                                  aSessionId      ) throw( css::uno::RuntimeException );\n        void SAL_CALL implcb_newStream\n                                    (   const   ::rtl::OUString&                                sMIMEDescription,\n                                        const   ::rtl::OUString&                                sURL            ,\n                                        const   ::rtl::OUString&                                sFilter         ,\n                                        const   css::uno::Reference< css::io::XInputStream >&   xStream         ,\n                                        const   css::uno::Any&                                  aSessionId      ) throw( css::uno::RuntimeException );\n        void SAL_CALL newURL        (   const   ::rtl::OUString&    sMIMEDescription,\n                                        const   ::rtl::OUString&    sURL            ,\n                                        const   ::rtl::OUString&    sFilter         ,\n                                        const   css::uno::Any&      aSessionId      ) throw( css::uno::RuntimeException );\n        void SAL_CALL implcb_newURL (   const   ::rtl::OUString&    sMIMEDescription,\n                                        const   ::rtl::OUString&    sURL            ,\n                                        const   ::rtl::OUString&    sFilter         ,\n                                        const   css::uno::Any&      aSessionId      ) throw( css::uno::RuntimeException );\n        virtual void SAL_CALL getHttpServerURL( ::rtl::OUString&    sHost   ,\n                                                sal_uInt16&         nPort   ,\n                                                ::rtl::OUString&    sPrefix ) throw( css::uno::RuntimeException );\n\n        \/\/---------------------------------------------------------------------------------------------------------\n        \/\/   XDispatchProvider\n        \/\/---------------------------------------------------------------------------------------------------------\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 >& seqDescripts ) throw( css::uno::RuntimeException );\n\n        \/\/---------------------------------------------------------------------------------------------------------\n        \/\/   XDispatchResultListener\n        \/\/---------------------------------------------------------------------------------------------------------\n\n        virtual void SAL_CALL dispatchFinished      ( const css::frame::DispatchResultEvent&                    aEvent     ) throw( css::uno::RuntimeException );\n\n        \/\/---------------------------------------------------------------------------------------------------------\n        \/\/   XEventListener\n        \/\/---------------------------------------------------------------------------------------------------------\n\n        void SAL_CALL disposing( const css::lang::EventObject& aEvent ) throw( css::uno::RuntimeException );\n\n    \/\/-------------------------------------------------------------------------------------------------------------\n    \/\/  protected methods\n    \/\/-------------------------------------------------------------------------------------------------------------\n\n    protected:\n\n    \/\/-------------------------------------------------------------------------------------------------------------\n    \/\/  private methods\n    \/\/-------------------------------------------------------------------------------------------------------------\n\n    private:\n\n        void impl_tryToLoadDocument();\n        sal_Bool impl_registerRemoteFactories( const css::uno::Reference< css::lang::XMultiServiceFactory >& xRemoteServiceManager );\n\n    \/\/-------------------------------------------------------------------------------------------------------------\n    \/\/  debug methods\n    \/\/  (should be private everyway!)\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<BR>\n                        sal_True  otherway\n\n            @onerror    -\n        *\/\/*-*****************************************************************************************************\/\n\n    #ifdef ENABLE_ASSERTIONS\n\n    private:\n\n        static sal_Bool impldbg_checkParameter_initialize           (   const   css::uno::Sequence< css::uno::Any >&                    seqArguments            );\n        static sal_Bool impldbg_checkParameter_createWindow         (   const   css::uno::Any&                                          aPlatformWindowHandle   ,\n                                                                                sal_Bool                                                bEmbedded               );\n        static sal_Bool impldbg_checkParameter_newStream            (   const   ::rtl::OUString&                                        sMIMEDescription        ,\n                                                                        const   ::rtl::OUString&                                        sURL                    ,\n                                                                        const   ::rtl::OUString&                                        sFilter                 ,\n                                                                        const   css::uno::Reference< css::io::XInputStream >&           xStream                 );\n        static sal_Bool impldbg_checkParameter_newURL               (   const   ::rtl::OUString&                                        sMIMEDescription        ,\n                                                                        const   ::rtl::OUString&                                        sURL                    ,\n                                                                        const   ::rtl::OUString&                                        sFilter                 );\n        static sal_Bool impldbg_checkParameter_getHttpServerURL     (           ::rtl::OUString&                                        sHost                   ,\n                                                                                sal_uInt16&                                             nPort                   ,\n                                                                                ::rtl::OUString&                                        sPrefix                 );\n        static sal_Bool impldbg_checkParameter_queryDispatch        (   const   css::util::URL&                                         aURL                    ,\n                                                                        const   ::rtl::OUString&                                        sTargetFrameName        ,\n                                                                                sal_Int32                                               nSearchFlags            );\n        static sal_Bool impldbg_checkParameter_queryDispatches      (   const   css::uno::Sequence< css::frame::DispatchDescriptor >&   seqDescripts            );\n        static sal_Bool impldbg_checkParameter_statusChanged        (   const   css::frame::FeatureStateEvent&                          aEvent                  );\n        static sal_Bool impldbg_checkParameter_disposing            (   const   css::lang::EventObject&                                 aEvent                  );\n\n    #endif  \/\/ #ifdef ENABLE_ASSERTIONS\n\n    \/\/-------------------------------------------------------------------------------------------------------------\n    \/\/  variables\n    \/\/  (should be private everyway!)\n    \/\/-------------------------------------------------------------------------------------------------------------\n\n    private:\n\n        css::uno::Reference< css::mozilla::XPluginInstancePeer >            m_xPlugInInstancePeer   ;   \/\/\/ Reference to UNO interface of PlugIn dll for communication with browser\n        css::uno::Reference< css::mozilla::XPluginWindowPeer >              m_xPlugInWindowPeer     ;   \/\/\/ Reference to set child window at plugin window\n        css::uno::Sequence< css::beans::PropertyValue >                     m_seqProperties         ;   \/\/\/ Sequence of properties as arguments for load document\n        css::util::URL                                                      m_aURL                  ;   \/\/\/ URL for document to load\n        sal_Bool                                                            m_bILoad                ;   \/\/\/ PlugInFrame has a valid loader which load the document and wait for finished\/cancelled\n        sal_Bool                                                            m_bIHaveDocument        ;   \/\/\/ We have a document loaded successful.\n        css::uno::Reference< css::frame::XDispatchProvider >                m_xPlugInDispatcher     ;   \/\/\/ Dispatcher to forward dispatches to browser\n        static sal_Bool                                                     m_bRemoteFactoriesExist ;   \/\/\/ indicates, if remote factories was already registered (neccessary one times only!)\n        SvtCommandOptions                                                   m_aCommandOptions       ;   \/\/\/ ref counted class to support disabling commands defined by configuration file\n\n};      \/\/  class PlugInFrame\n\n\/*-************************************************************************************************************\/\/**\n    @short      used to forward all asynchronous calls which use VCL internal to the main thread\n    @descr      We need this asynchronous mechanism to prevent us against dead locks. Sometimes our main thread\n                can call us for event handling like FOCUS, ACTIVATE and something else. But at the same time we will call\n                the main thread to CREATE A WINDOW, SET IT VISIBLE ... Then we have a problem. We must send us himself a event\n                to run our code synchronized with our main thread!\n\n    @implements\n    @base       -\n*\/\/*-*************************************************************************************************************\/\n\nenum eIMPL_PluginCommand\n{\n    START           ,\n    STOP            ,\n    CREATEWINDOW    ,\n    DESTROY         ,\n    NEWSTREAM       ,\n    NEWURL\n};\n\nclass cIMPL_MainThreadExecutorRequest\n{\n    public:\n        cIMPL_MainThreadExecutorRequest(    eIMPL_PluginCommand                             eCommand                ,\n                                            PlugInFrame*                                    pPluginInstance         );\n\n        cIMPL_MainThreadExecutorRequest(    eIMPL_PluginCommand                             eCommand                ,\n                                            PlugInFrame*                                    pPluginInstance         ,\n                                    const   css::uno::Any&                                  aPlatformWindowHandle   ,\n                                            sal_Bool                                        bEmbedded               );\n\n        cIMPL_MainThreadExecutorRequest(    eIMPL_PluginCommand                             eCommand                ,\n                                            PlugInFrame*                                    pPluginInstance         ,\n                                    const   ::rtl::OUString&                                sMIMEDescription        ,\n                                    const   ::rtl::OUString&                                sURL                    ,\n                                    const   ::rtl::OUString&                                sFilter                 ,\n                                    const   css::uno::Reference< css::io::XInputStream >&   xStream                 ,\n                                    const   css::uno::Any&                                  aSessionId              );\n\n        \/*-****************************************************************************************************\/\/**\n            @short      -\n            @descr      -\n\n            @seealso    -\n\n            @param      -\n            @return     -\n\n            @onerror    -\n        *\/\/*-*****************************************************************************************************\/\n\n        virtual long doIt();\n\n    \/\/-------------------------------------------------------------------------------------------------------------\n    \/\/  private variables\n    \/\/-------------------------------------------------------------------------------------------------------------\n    private:\n\n        eIMPL_PluginCommand                             m_eCommand              ;   \/\/\/ switch to specify forward function\n        PlugInFrame*                                    m_pPluginInstance       ;   \/\/\/ instance wich has started this swicth mechanism and wish to called back from us\n        css::uno::Reference< css::uno::XInterface >     m_xPluginInstance       ;   \/\/\/ reference to our plugin frame to prevent that plugin frame dies before we call back\n        css::uno::Any                                   m_aPlatformWindowHandle ;   \/\/\/ parameter for XPluginInstance->createWindow()\n        sal_Bool                                        m_bEmbedded             ;   \/\/\/ parameter for XPluginInstance->createWindow()\n        ::rtl::OUString                                 m_sMIMEDescription      ;   \/\/\/ parameter for XPluginInstance->newStream()\/newURL()\n        ::rtl::OUString                                 m_sURL                  ;   \/\/\/ parameter for XPluginInstance->newStream()\/newURL()\n        ::rtl::OUString                                 m_sFilter               ;   \/\/\/ parameter for XPluginInstance->newStream()\/newURL()\n        css::uno::Reference< css::io::XInputStream >    m_xStream               ;   \/\/\/ parameter for XPluginInstance->newStream()\/newURL()\n        css::uno::Any                                   m_aSessionId            ;   \/\/\/ parameter for XPluginInstance->newStream()\/newURL()\n};\n\nclass cIMPL_MainThreadExecutor\n{\n    \/\/-------------------------------------------------------------------------------------------------------------\n    \/\/  public methods\n    \/\/-------------------------------------------------------------------------------------------------------------\n    public:\n        static void execute( cIMPL_MainThreadExecutorRequest* pRequest );\n\n        \/*-****************************************************************************************************\/\/**\n            @short      -\n            @descr      -\n\n            @seealso    -\n\n            @param      -\n            @return     -\n\n            @onerror    -\n        *\/\/*-*****************************************************************************************************\/\n        DECL_STATIC_LINK( cIMPL_MainThreadExecutor, worker, cIMPL_MainThreadExecutorRequest* );\n};\n\n}       \/\/  namespace framework\n\n#endif  \/\/  #ifndef __FRAMEWORK_SERVICES_PLUGINFRAME_HXX_\n<commit_msg>INTEGRATION: CWS changefileheader (1.9.458); FILE MERGED 2008\/04\/01 15:18:24 thb 1.9.458.3: #i85898# Stripping all external header guards 2008\/04\/01 10:57:53 thb 1.9.458.2: #i85898# Stripping all external header guards 2008\/03\/28 15:34:50 rt 1.9.458.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: pluginframe.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 __FRAMEWORK_SERVICES_PLUGINFRAME_HXX_\n#define __FRAMEWORK_SERVICES_PLUGINFRAME_HXX_\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  my own includes\n\/\/_________________________________________________________________________________________________________________\n\n#include <services\/frame.hxx>\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  interface includes\n\/\/_________________________________________________________________________________________________________________\n#include <com\/sun\/star\/mozilla\/XPluginInstance.hpp>\n#include <com\/sun\/star\/mozilla\/XPluginInstancePeer.hpp>\n#include <com\/sun\/star\/mozilla\/XPluginWindowPeer.hpp>\n#include <com\/sun\/star\/io\/XInputStream.hpp>\n#include <com\/sun\/star\/lang\/XInitialization.hpp>\n#include <com\/sun\/star\/awt\/XWindow.hpp>\n#include <com\/sun\/star\/frame\/XDispatchResultListener.hpp>\n#include <com\/sun\/star\/frame\/FeatureStateEvent.hpp>\n#include <com\/sun\/star\/lang\/EventObject.hpp>\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  other includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef _VCL_ATOM_HXX\n#include <vcl\/threadex.hxx>\n#endif\n#include <svtools\/cmdoptions.hxx>\n\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  namespace\n\/\/_________________________________________________________________________________________________________________\n\nnamespace framework{\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  exported const\n\/\/_________________________________________________________________________________________________________________\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  exported definitions\n\/\/_________________________________________________________________________________________________________________\n\n\/*-************************************************************************************************************\/\/**\n    @short      implements an special frame - a plugin frame\n    @descr      -\n\n    @implements XInitialization\n                XPluginInstance\n                XDispatchResultListener\n    @base       Frame\n*\/\/*-*************************************************************************************************************\/\n\nclass PlugInFrame   :   public css::lang::XInitialization           ,\n                        public css::mozilla::XPluginInstance        ,\n                        public css::frame::XDispatchResultListener  ,   \/\/ => XEVENTLISTENER\n                        public Frame                                    \/\/ Order of baseclasses is neccessary for right initialization!\n{\n    \/\/-------------------------------------------------------------------------------------------------------------\n    \/\/  public methods\n    \/\/-------------------------------------------------------------------------------------------------------------\n\n    public:\n\n        \/\/---------------------------------------------------------------------------------------------------------\n        \/\/  constructor \/ destructor\n        \/\/---------------------------------------------------------------------------------------------------------\n\n        \/*-****************************************************************************************************\/\/**\n            @short      standard constructor to create instance\n            @descr      This constructor initialize a new instance of this class,\n                        and will be set valid values on his member and baseclasses.\n\n            @seealso    -\n\n            @param      -\n            @return     -\n\n            @onerror    -\n        *\/\/*-*****************************************************************************************************\/\n\n         PlugInFrame( const css::uno::Reference< css::lang::XMultiServiceFactory >& xFactory );\n\n        \/*-****************************************************************************************************\/\/**\n            @short      standard destructor\n            @descr      This method destruct an instance of this class and clear some member.\n\n            @seealso    -\n\n            @param      -\n            @return     -\n\n            @onerror    -\n        *\/\/*-*****************************************************************************************************\/\n\n        virtual ~PlugInFrame();\n\n        \/\/---------------------------------------------------------------------------------------------------------\n        \/\/  XInterface, XTypeProvider, XServiceInfo\n        \/\/---------------------------------------------------------------------------------------------------------\n\n        DECLARE_XINTERFACE\n        DECLARE_XTYPEPROVIDER\n        DECLARE_XSERVICEINFO\n\n        \/\/---------------------------------------------------------------------------------------------------------\n        \/\/  XInitialization\n        \/\/---------------------------------------------------------------------------------------------------------\n\n        void SAL_CALL initialize( const css::uno::Sequence< css::uno::Any >& seqArguments ) throw(  css::uno::Exception         ,\n                                                                                                     css::uno::RuntimeException );\n\n        \/\/---------------------------------------------------------------------------------------------------------\n        \/\/  XPluginInstance\n        \/\/---------------------------------------------------------------------------------------------------------\n\n        void SAL_CALL start         () throw( css::uno::RuntimeException );\n        void SAL_CALL implcb_start  () throw( css::uno::RuntimeException );\n        void SAL_CALL stop          () throw( css::uno::RuntimeException );\n        void SAL_CALL implcb_stop   () throw( css::uno::RuntimeException );\n        void SAL_CALL destroy       () throw( css::uno::RuntimeException );\n        void SAL_CALL implcb_destroy() throw( css::uno::RuntimeException );\n        void SAL_CALL createWindow          (   const   css::uno::Any&      aPlatformWindowHandle   ,\n                                                        sal_Bool            bEmbedded               ) throw( css::uno::RuntimeException );\n        void SAL_CALL implcb_createWindow   (   const   css::uno::Any&      aPlatformWindowHandle   ,\n                                                        sal_Bool            bEmbedded               ) throw( css::uno::RuntimeException );\n        void SAL_CALL newStream     (   const   ::rtl::OUString&                                sMIMEDescription,\n                                        const   ::rtl::OUString&                                sURL            ,\n                                        const   ::rtl::OUString&                                sFilter         ,\n                                        const   css::uno::Reference< css::io::XInputStream >&   xStream         ,\n                                        const   css::uno::Any&                                  aSessionId      ) throw( css::uno::RuntimeException );\n        void SAL_CALL implcb_newStream\n                                    (   const   ::rtl::OUString&                                sMIMEDescription,\n                                        const   ::rtl::OUString&                                sURL            ,\n                                        const   ::rtl::OUString&                                sFilter         ,\n                                        const   css::uno::Reference< css::io::XInputStream >&   xStream         ,\n                                        const   css::uno::Any&                                  aSessionId      ) throw( css::uno::RuntimeException );\n        void SAL_CALL newURL        (   const   ::rtl::OUString&    sMIMEDescription,\n                                        const   ::rtl::OUString&    sURL            ,\n                                        const   ::rtl::OUString&    sFilter         ,\n                                        const   css::uno::Any&      aSessionId      ) throw( css::uno::RuntimeException );\n        void SAL_CALL implcb_newURL (   const   ::rtl::OUString&    sMIMEDescription,\n                                        const   ::rtl::OUString&    sURL            ,\n                                        const   ::rtl::OUString&    sFilter         ,\n                                        const   css::uno::Any&      aSessionId      ) throw( css::uno::RuntimeException );\n        virtual void SAL_CALL getHttpServerURL( ::rtl::OUString&    sHost   ,\n                                                sal_uInt16&         nPort   ,\n                                                ::rtl::OUString&    sPrefix ) throw( css::uno::RuntimeException );\n\n        \/\/---------------------------------------------------------------------------------------------------------\n        \/\/   XDispatchProvider\n        \/\/---------------------------------------------------------------------------------------------------------\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 >& seqDescripts ) throw( css::uno::RuntimeException );\n\n        \/\/---------------------------------------------------------------------------------------------------------\n        \/\/   XDispatchResultListener\n        \/\/---------------------------------------------------------------------------------------------------------\n\n        virtual void SAL_CALL dispatchFinished      ( const css::frame::DispatchResultEvent&                    aEvent     ) throw( css::uno::RuntimeException );\n\n        \/\/---------------------------------------------------------------------------------------------------------\n        \/\/   XEventListener\n        \/\/---------------------------------------------------------------------------------------------------------\n\n        void SAL_CALL disposing( const css::lang::EventObject& aEvent ) throw( css::uno::RuntimeException );\n\n    \/\/-------------------------------------------------------------------------------------------------------------\n    \/\/  protected methods\n    \/\/-------------------------------------------------------------------------------------------------------------\n\n    protected:\n\n    \/\/-------------------------------------------------------------------------------------------------------------\n    \/\/  private methods\n    \/\/-------------------------------------------------------------------------------------------------------------\n\n    private:\n\n        void impl_tryToLoadDocument();\n        sal_Bool impl_registerRemoteFactories( const css::uno::Reference< css::lang::XMultiServiceFactory >& xRemoteServiceManager );\n\n    \/\/-------------------------------------------------------------------------------------------------------------\n    \/\/  debug methods\n    \/\/  (should be private everyway!)\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<BR>\n                        sal_True  otherway\n\n            @onerror    -\n        *\/\/*-*****************************************************************************************************\/\n\n    #ifdef ENABLE_ASSERTIONS\n\n    private:\n\n        static sal_Bool impldbg_checkParameter_initialize           (   const   css::uno::Sequence< css::uno::Any >&                    seqArguments            );\n        static sal_Bool impldbg_checkParameter_createWindow         (   const   css::uno::Any&                                          aPlatformWindowHandle   ,\n                                                                                sal_Bool                                                bEmbedded               );\n        static sal_Bool impldbg_checkParameter_newStream            (   const   ::rtl::OUString&                                        sMIMEDescription        ,\n                                                                        const   ::rtl::OUString&                                        sURL                    ,\n                                                                        const   ::rtl::OUString&                                        sFilter                 ,\n                                                                        const   css::uno::Reference< css::io::XInputStream >&           xStream                 );\n        static sal_Bool impldbg_checkParameter_newURL               (   const   ::rtl::OUString&                                        sMIMEDescription        ,\n                                                                        const   ::rtl::OUString&                                        sURL                    ,\n                                                                        const   ::rtl::OUString&                                        sFilter                 );\n        static sal_Bool impldbg_checkParameter_getHttpServerURL     (           ::rtl::OUString&                                        sHost                   ,\n                                                                                sal_uInt16&                                             nPort                   ,\n                                                                                ::rtl::OUString&                                        sPrefix                 );\n        static sal_Bool impldbg_checkParameter_queryDispatch        (   const   css::util::URL&                                         aURL                    ,\n                                                                        const   ::rtl::OUString&                                        sTargetFrameName        ,\n                                                                                sal_Int32                                               nSearchFlags            );\n        static sal_Bool impldbg_checkParameter_queryDispatches      (   const   css::uno::Sequence< css::frame::DispatchDescriptor >&   seqDescripts            );\n        static sal_Bool impldbg_checkParameter_statusChanged        (   const   css::frame::FeatureStateEvent&                          aEvent                  );\n        static sal_Bool impldbg_checkParameter_disposing            (   const   css::lang::EventObject&                                 aEvent                  );\n\n    #endif  \/\/ #ifdef ENABLE_ASSERTIONS\n\n    \/\/-------------------------------------------------------------------------------------------------------------\n    \/\/  variables\n    \/\/  (should be private everyway!)\n    \/\/-------------------------------------------------------------------------------------------------------------\n\n    private:\n\n        css::uno::Reference< css::mozilla::XPluginInstancePeer >            m_xPlugInInstancePeer   ;   \/\/\/ Reference to UNO interface of PlugIn dll for communication with browser\n        css::uno::Reference< css::mozilla::XPluginWindowPeer >              m_xPlugInWindowPeer     ;   \/\/\/ Reference to set child window at plugin window\n        css::uno::Sequence< css::beans::PropertyValue >                     m_seqProperties         ;   \/\/\/ Sequence of properties as arguments for load document\n        css::util::URL                                                      m_aURL                  ;   \/\/\/ URL for document to load\n        sal_Bool                                                            m_bILoad                ;   \/\/\/ PlugInFrame has a valid loader which load the document and wait for finished\/cancelled\n        sal_Bool                                                            m_bIHaveDocument        ;   \/\/\/ We have a document loaded successful.\n        css::uno::Reference< css::frame::XDispatchProvider >                m_xPlugInDispatcher     ;   \/\/\/ Dispatcher to forward dispatches to browser\n        static sal_Bool                                                     m_bRemoteFactoriesExist ;   \/\/\/ indicates, if remote factories was already registered (neccessary one times only!)\n        SvtCommandOptions                                                   m_aCommandOptions       ;   \/\/\/ ref counted class to support disabling commands defined by configuration file\n\n};      \/\/  class PlugInFrame\n\n\/*-************************************************************************************************************\/\/**\n    @short      used to forward all asynchronous calls which use VCL internal to the main thread\n    @descr      We need this asynchronous mechanism to prevent us against dead locks. Sometimes our main thread\n                can call us for event handling like FOCUS, ACTIVATE and something else. But at the same time we will call\n                the main thread to CREATE A WINDOW, SET IT VISIBLE ... Then we have a problem. We must send us himself a event\n                to run our code synchronized with our main thread!\n\n    @implements\n    @base       -\n*\/\/*-*************************************************************************************************************\/\n\nenum eIMPL_PluginCommand\n{\n    START           ,\n    STOP            ,\n    CREATEWINDOW    ,\n    DESTROY         ,\n    NEWSTREAM       ,\n    NEWURL\n};\n\nclass cIMPL_MainThreadExecutorRequest\n{\n    public:\n        cIMPL_MainThreadExecutorRequest(    eIMPL_PluginCommand                             eCommand                ,\n                                            PlugInFrame*                                    pPluginInstance         );\n\n        cIMPL_MainThreadExecutorRequest(    eIMPL_PluginCommand                             eCommand                ,\n                                            PlugInFrame*                                    pPluginInstance         ,\n                                    const   css::uno::Any&                                  aPlatformWindowHandle   ,\n                                            sal_Bool                                        bEmbedded               );\n\n        cIMPL_MainThreadExecutorRequest(    eIMPL_PluginCommand                             eCommand                ,\n                                            PlugInFrame*                                    pPluginInstance         ,\n                                    const   ::rtl::OUString&                                sMIMEDescription        ,\n                                    const   ::rtl::OUString&                                sURL                    ,\n                                    const   ::rtl::OUString&                                sFilter                 ,\n                                    const   css::uno::Reference< css::io::XInputStream >&   xStream                 ,\n                                    const   css::uno::Any&                                  aSessionId              );\n\n        \/*-****************************************************************************************************\/\/**\n            @short      -\n            @descr      -\n\n            @seealso    -\n\n            @param      -\n            @return     -\n\n            @onerror    -\n        *\/\/*-*****************************************************************************************************\/\n\n        virtual long doIt();\n\n    \/\/-------------------------------------------------------------------------------------------------------------\n    \/\/  private variables\n    \/\/-------------------------------------------------------------------------------------------------------------\n    private:\n\n        eIMPL_PluginCommand                             m_eCommand              ;   \/\/\/ switch to specify forward function\n        PlugInFrame*                                    m_pPluginInstance       ;   \/\/\/ instance wich has started this swicth mechanism and wish to called back from us\n        css::uno::Reference< css::uno::XInterface >     m_xPluginInstance       ;   \/\/\/ reference to our plugin frame to prevent that plugin frame dies before we call back\n        css::uno::Any                                   m_aPlatformWindowHandle ;   \/\/\/ parameter for XPluginInstance->createWindow()\n        sal_Bool                                        m_bEmbedded             ;   \/\/\/ parameter for XPluginInstance->createWindow()\n        ::rtl::OUString                                 m_sMIMEDescription      ;   \/\/\/ parameter for XPluginInstance->newStream()\/newURL()\n        ::rtl::OUString                                 m_sURL                  ;   \/\/\/ parameter for XPluginInstance->newStream()\/newURL()\n        ::rtl::OUString                                 m_sFilter               ;   \/\/\/ parameter for XPluginInstance->newStream()\/newURL()\n        css::uno::Reference< css::io::XInputStream >    m_xStream               ;   \/\/\/ parameter for XPluginInstance->newStream()\/newURL()\n        css::uno::Any                                   m_aSessionId            ;   \/\/\/ parameter for XPluginInstance->newStream()\/newURL()\n};\n\nclass cIMPL_MainThreadExecutor\n{\n    \/\/-------------------------------------------------------------------------------------------------------------\n    \/\/  public methods\n    \/\/-------------------------------------------------------------------------------------------------------------\n    public:\n        static void execute( cIMPL_MainThreadExecutorRequest* pRequest );\n\n        \/*-****************************************************************************************************\/\/**\n            @short      -\n            @descr      -\n\n            @seealso    -\n\n            @param      -\n            @return     -\n\n            @onerror    -\n        *\/\/*-*****************************************************************************************************\/\n        DECL_STATIC_LINK( cIMPL_MainThreadExecutor, worker, cIMPL_MainThreadExecutorRequest* );\n};\n\n}       \/\/  namespace framework\n\n#endif  \/\/  #ifndef __FRAMEWORK_SERVICES_PLUGINFRAME_HXX_\n<|endoftext|>"}
{"text":"<commit_before>#define DEBUG 1\n\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 2019-5-25 21:27:40\n * Powered by Visual Studio Code\n *\/\n\n#include <iostream>\n#include <iomanip>   \/\/ << fixed << setprecision(xxx)\n#include <algorithm> \/\/ do { } while ( next_permutation(A, A+xxx) ) ;\n#include <vector>\n#include <string> \/\/ to_string(nnn) \/\/ substr(m, n) \/\/ stoi(nnn)\n#include <complex>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <map> \/\/ if (M.find(key) != M.end()) { }\n#include <set>\n#include <functional>\n#include <random> \/\/ auto rd = bind(uniform_int_distribution<int>(0, 9), mt19937(10101010));\n#include <chrono> \/\/ std::chrono::system_clock::time_point start_time, end_time;\n\/\/ start = std::chrono::system_clock::now();\n\/\/ double elapsed = std::chrono::duration_cast<std::chrono::milliseconds>(end_time-start_time).count();\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\nusing namespace std;\n\ntypedef long long ll;\n\n\/\/ const int dx[4] = {1, 0, -1, 0};\n\/\/ const int dy[4] = {0, 1, 0, -1};\n\n\/\/ const int C = 1e6+10;\n\/\/ const ll M = 1000000007;\n\nclass BIT\n{ \/\/ index starts at 1.\npublic:\n  int N;\n  ll *data;\n\n  BIT()\n  {\n  }\n\n  BIT(int n) : N(n)\n  {\n    data = new ll[N + 1];\n    for (auto i = 1; i <= N; ++i)\n    {\n      data[i] = 0;\n    }\n  }\n\n  ~BIT()\n  {\n    delete[] data;\n  }\n\n  ll sum(int i)\n  { \/\/ [1, i]\n    if (i <= 0)\n    {\n      return 0;\n    }\n    if (i > N)\n    {\n      return sum(N);\n    }\n    ll s = 0;\n    while (i > 0)\n    {\n      s += data[i];\n      i -= i & -i;\n    }\n    return s;\n  }\n\n  ll sum(int a, int b)\n  {\n    return sum(b) - sum(a);\n  }\n\n  void add(int i, ll x)\n  {\n    while (i <= N)\n    {\n      data[i] += x;\n      i += i & -i;\n    }\n  }\n\n  void add(int i)\n  {\n    add(i, 1);\n  }\n};\n\nint Q;\ntypedef tuple<char, ll, ll> query;\nvector<query> V;\nchar c;\nll B = 0;\nmap<ll, int> M;\nvector<ll> W;\npriority_queue<ll> L;\npriority_queue<ll, vector<ll>, greater<ll>> R;\nBIT bit = BIT(200010);\n\nvoid merge(ll a, ll b)\n{\n  ll x = L.top();\n  ll y = R.top();\n  if (a <= x)\n  {\n    L.push(a);\n  }\n  else if (a >= y)\n  {\n    R.push(a);\n  }\n  else\n  {\n    L.push(a);\n  }\n  while (L.size() > R.size())\n  {\n    ll t = L.top();\n    L.pop();\n    R.push(t);\n  }\n  while (L.size() < R.size())\n  {\n    ll t = R.top();\n    R.pop();\n    L.push(t);\n  }\n  B += b;\n  bit.add(M[a], a);\n}\n\nvoid flush()\n{\n  ll val = L.top();\n  ll ans = B;\n  ans -= bit.sum(M[val] - 1);\n  ans += bit.sum(M[val] - 1, W.size());\n#if DEBUG == 1\n  cerr << \"M[\" << val << \"] = \" << M[val] << \", W.size() = \" << W.size() << endl;\n  cerr << \"bit.sum(\" << M[val] << \") = \" << bit.sum(M[val]) << endl;\n  cerr << \"bit.sum(\" << M[val] << \", \" << W.size() << \") = \" << bit.sum(M[val], W.size()) << endl;\n#endif\n  cout << val << \" \" << ans << endl;\n}\n\nint main()\n{\n  cin >> Q;\n  L.push(-1000000000000LL);\n  R.push(1000000000000LL);\n  for (auto i = 0; i < Q; i++)\n  {\n    cin >> c;\n    if (c == '1')\n    {\n      ll a, b;\n      cin >> a >> b;\n      V.push_back(query(c, a, b));\n    }\n    else\n    {\n      V.push_back(query(c, 0, 0));\n    }\n  }\n  for (auto i = 0; i < Q; i++)\n  {\n    if (get<0>(V[i]) == '1')\n    {\n      ll a = get<1>(V[i]);\n      W.push_back(a);\n    }\n  }\n  sort(W.begin(), W.end());\n  for (auto i = 0; i < (int)W.size(); i++)\n  {\n    M[W[i]] = i + 1;\n#if DEBUG == 1\n    cerr << \"M[\" << W[i] << \"] = \" << M[W[i]] << endl;\n#endif\n  }\n  for (auto i = 0; i < Q; i++)\n  {\n    if (get<0>(V[i]) == '1')\n    {\n      merge(get<1>(V[i]), get<2>(V[i]));\n    }\n    else\n    {\n      flush();\n    }\n  }\n}<commit_msg>tried F.cpp to 'F'<commit_after>#define DEBUG 1\n\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 2019-5-25 21:27:40\n * Powered by Visual Studio Code\n *\/\n\n#include <iostream>\n#include <iomanip>   \/\/ << fixed << setprecision(xxx)\n#include <algorithm> \/\/ do { } while ( next_permutation(A, A+xxx) ) ;\n#include <vector>\n#include <string> \/\/ to_string(nnn) \/\/ substr(m, n) \/\/ stoi(nnn)\n#include <complex>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <map> \/\/ if (M.find(key) != M.end()) { }\n#include <set>\n#include <functional>\n#include <random> \/\/ auto rd = bind(uniform_int_distribution<int>(0, 9), mt19937(10101010));\n#include <chrono> \/\/ std::chrono::system_clock::time_point start_time, end_time;\n\/\/ start = std::chrono::system_clock::now();\n\/\/ double elapsed = std::chrono::duration_cast<std::chrono::milliseconds>(end_time-start_time).count();\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\nusing namespace std;\n\ntypedef long long ll;\n\n\/\/ const int dx[4] = {1, 0, -1, 0};\n\/\/ const int dy[4] = {0, 1, 0, -1};\n\n\/\/ const int C = 1e6+10;\n\/\/ const ll M = 1000000007;\n\nclass BIT\n{ \/\/ index starts at 1.\npublic:\n  int N;\n  ll *data;\n\n  BIT()\n  {\n  }\n\n  BIT(int n) : N(n)\n  {\n    data = new ll[N + 1];\n    for (auto i = 1; i <= N; ++i)\n    {\n      data[i] = 0;\n    }\n  }\n\n  ~BIT()\n  {\n    delete[] data;\n  }\n\n  ll sum(int i)\n  { \/\/ [1, i]\n    if (i <= 0)\n    {\n      return 0;\n    }\n    if (i > N)\n    {\n      return sum(N);\n    }\n    ll s = 0;\n    while (i > 0)\n    {\n      s += data[i];\n      i -= i & -i;\n    }\n    return s;\n  }\n\n  ll sum(int a, int b)\n  {\n    return sum(b) - sum(a);\n  }\n\n  void add(int i, ll x)\n  {\n    while (i <= N)\n    {\n      data[i] += x;\n      i += i & -i;\n    }\n  }\n\n  void add(int i)\n  {\n    add(i, 1);\n  }\n};\n\nint Q;\ntypedef tuple<char, ll, ll> query;\nvector<query> V;\nchar c;\nll B = 0;\nmap<ll, int> M;\nvector<ll> W;\npriority_queue<ll> L;\npriority_queue<ll, vector<ll>, greater<ll>> R;\nBIT bit = BIT(200010);\n\nvoid merge(ll a, ll b)\n{\n  ll x = L.top();\n  ll y = R.top();\n  if (a <= x)\n  {\n    L.push(a);\n  }\n  else if (a >= y)\n  {\n    R.push(a);\n  }\n  else\n  {\n    L.push(a);\n  }\n  while (L.size() > R.size())\n  {\n    ll t = L.top();\n    L.pop();\n    R.push(t);\n  }\n  while (L.size() < R.size())\n  {\n    ll t = R.top();\n    R.pop();\n    L.push(t);\n  }\n  B += b;\n  bit.add(M[a], a);\n}\n\nvoid flush()\n{\n  ll val = L.top();\n  ll ans = B;\n  ans -= bit.sum(M[val] - 1);\n  ans += bit.sum(M[val] - 1, W.size());\n#if DEBUG == 1\n  cerr << \"M[\" << val << \"] = \" << M[val] << \", W.size() = \" << W.size() << endl;\n  cerr << \"bit.sum(\" << M[val] - 1 << \") = \" << bit.sum(M[val] - 1) << endl;\n  cerr << \"bit.sum(\" << M[val] - 1 << \", \" << W.size() << \") = \" << bit.sum(M[val] - 1, W.size()) << endl;\n#endif\n  cout << val << \" \" << ans << endl;\n}\n\nint main()\n{\n  cin >> Q;\n  L.push(-1000000000000LL);\n  R.push(1000000000000LL);\n  for (auto i = 0; i < Q; i++)\n  {\n    cin >> c;\n    if (c == '1')\n    {\n      ll a, b;\n      cin >> a >> b;\n      V.push_back(query(c, a, b));\n    }\n    else\n    {\n      V.push_back(query(c, 0, 0));\n    }\n  }\n  for (auto i = 0; i < Q; i++)\n  {\n    if (get<0>(V[i]) == '1')\n    {\n      ll a = get<1>(V[i]);\n      W.push_back(a);\n    }\n  }\n  sort(W.begin(), W.end());\n  for (auto i = 0; i < (int)W.size(); i++)\n  {\n    M[W[i]] = i + 1;\n#if DEBUG == 1\n    cerr << \"M[\" << W[i] << \"] = \" << M[W[i]] << endl;\n#endif\n  }\n  for (auto i = 0; i < Q; i++)\n  {\n    if (get<0>(V[i]) == '1')\n    {\n      merge(get<1>(V[i]), get<2>(V[i]));\n    }\n    else\n    {\n      flush();\n    }\n  }\n}<|endoftext|>"}
{"text":"<commit_before>#define DEBUG 1\n\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 6\/9\/2019, 9:32:28 PM\n * Powered by Visual Studio Code\n *\/\n\n#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <complex>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <functional>\n#include <random>\n#include <chrono>\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\nusing namespace std;\n\ntypedef long long ll;\n\ntemplate <class T>\nclass Matrix\n{\npublic:\n  static T MOD;\n\nprivate:\n  int H, W;\n  T **a;\n\npublic:\n  Matrix() {}\n\n  Matrix(int h, int w) : H(h), W(w)\n  {\n    a = new T *[H];\n    for (auto i = 0; i < H; i++)\n    {\n      a[i] = new T[W];\n    }\n  }\n\n  Matrix &operator=(const Matrix A)\n  {\n    H = A.H;\n    W = A.W;\n    for (auto i = 0; i < H; i++)\n    {\n      for (auto j = 0; j < W; j++)\n      {\n        a[i][j] = A.a[i][j];\n      }\n    }\n    return *this;\n  }\n\n  Matrix &operator=(const vector<T> v)\n  {\n    assert((int)v.size() == H * W);\n    for (auto i = 0; i < H; i++)\n    {\n      for (auto j = 0; j < W; j++)\n      {\n        a[i][j] = v[i * W + j];\n      }\n    }\n    return *this;\n  }\n\n  const Matrix operator-() const\n  {\n    Matrix X(H, W);\n    for (auto i = 0; i < H; i++)\n    {\n      for (auto j = 0; j < W; j++)\n      {\n        X.a[i][j] = MOD - a[i][j];\n        if (MOD > 0)\n        {\n          X.a[i][j] %= MOD;\n        }\n      }\n    }\n    return this;\n  }\n\n  const Matrix operator+(const Matrix &A) const\n  {\n    assert(A.H == H);\n    assert(A.W == W);\n    Matrix X(H, W);\n    for (auto i = 0; i < H; i++)\n    {\n      for (auto j = 0; j < W; j++)\n      {\n        X.a[i][j] = a[i][j] + A.a[i][j];\n        if (MOD > 0)\n        {\n          X.a[i][j] %= MOD;\n        }\n      }\n    }\n    return X;\n  }\n\n  const Matrix operator-(const Matrix &A) const\n  {\n    return this + (-A);\n  }\n\n  const Matrix operator*(const Matrix &A) const\n  {\n    assert(W == A.H);\n    Matrix X(H, A.W);\n    for (auto i = 0; i < X.H; i++)\n    {\n      for (auto j = 0; j < X.W; j++)\n      {\n        X.a[i][j] = 0;\n        for (auto k = 0; k < W; k++)\n        {\n          T t = a[i][k] * A.a[k][j];\n          if (MOD > 0)\n          {\n            t %= MOD;\n          }\n          X.a[i][j] += t;\n          if (MOD > 0)\n          {\n            X.a[i][j] %= MOD;\n          }\n        }\n      }\n    }\n    return X;\n  }\n\n  Matrix &operator+=(const Matrix &A)\n  {\n    Matrix X = this + A;\n    this = X;\n    return this;\n  }\n\n  Matrix &operator-=(const Matrix &A)\n  {\n    return this += (-A);\n  }\n\n  Matrix &operator*=(const Matrix &A)\n  {\n    Matrix X = this * A;\n    this = X;\n    return this;\n  }\n\n  bool operator==(const Matrix &A) const\n  {\n    assert(H == A.H);\n    assert(W == A.W);\n    for (auto i = 0; i < H; i++)\n    {\n      for (auto j = 0; j < W; j++)\n      {\n        if (a[i][j] != A.a[i][j])\n        {\n          return false;\n        }\n      }\n    }\n    return true;\n  }\n\n  bool operator!=(const Matrix &A) const\n  {\n    return !(this == A);\n  }\n\n  const T *&operator[](const size_t i) const\n  {\n    return a[i];\n  }\n\n  T *&operator[](const size_t i)\n  {\n    return a[i];\n  }\n\n  Matrix power(T N)\n  {\n    assert(H == W);\n    \/\/ N > 0\n    if (N == 1)\n    {\n      return *this;\n    }\n    if (N % 2 == 1)\n    {\n      return power(N - 1) * (*this);\n    }\n    Matrix X = power(N \/ 2);\n    return X * X;\n  }\n};\n\ntemplate <class T>\nT Matrix<T>::MOD = 0;\n\nll L, A, B, M;\nll upper[100];\n\nMatrix<ll> choose(ll k, ll n)\n{\n  Matrix<ll> K(3, 3);\n  ll p = 1;\n  for (auto i = 0; i < k; i++)\n  {\n    p *= 10LL;\n  }\n  K = {p, 1, 0, 0, 1, B, 0, 0, 1};\n  return K.power(n);\n}\n\nll f(ll i)\n{\n  return A + B * i;\n}\n\nint main()\n{\n  cin >> L >> A >> B >> M;\n  Matrix<ll>::MOD = M;\n  for (auto i = 1; i <= 18; i++)\n  {\n    ll ok = upper[i - 1];\n    ll ng = L;\n    if ((int)to_string(f(ok)).size() != i)\n    {\n      upper[i] = ok;\n      continue;\n    }\n    while (abs(ok - ng) > 1)\n    {\n      ll t = (ok + ng) \/ 2;\n      if ((int)to_string(f(t)).size() == i)\n      {\n        ok = t;\n      }\n      else\n      {\n        ng = t;\n      }\n    }\n    upper[i] = ng;\n  }\n  Matrix<ll> v(3, 1);\n  v = {0, A, 1};\n  for (auto i = 1; i <= 18; i++)\n  {\n    ll x = upper[i] - upper[i - 1];\n    if (x == 0)\n    {\n      continue;\n    }\n#if DEBUG == 1\n    cerr << \"i = \" << i << \", upper[\" << i << \"] = \" << upper[i] << endl;\n    cerr << \"f(\" << upper[i] - 1 << \") = \" << f(upper[i] - 1) << endl;\n    cerr << \"f(\" << upper[i] << \") = \" << f(upper[i]) << endl;\n#endif\n    v = choose(i, x) * v;\n#if DEBUG == 1\n    cerr << v[0][0] << \" \" << v[1][0] << \" \" << v[2][0] << endl;\n#endif\n  }\n  cout << v[0][0] << endl;\n}<commit_msg>tried F.cpp to 'F'<commit_after>#define DEBUG 1\n\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 6\/9\/2019, 9:32:28 PM\n * Powered by Visual Studio Code\n *\/\n\n#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <complex>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <functional>\n#include <random>\n#include <chrono>\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\nusing namespace std;\n\ntypedef long long ll;\n\ntemplate <class T>\nclass Matrix\n{\npublic:\n  static T MOD;\n\nprivate:\n  int H, W;\n  T **a;\n\npublic:\n  Matrix() {}\n\n  Matrix(int h, int w) : H(h), W(w)\n  {\n    a = new T *[H];\n    for (auto i = 0; i < H; i++)\n    {\n      a[i] = new T[W];\n    }\n  }\n\n  Matrix &operator=(const Matrix A)\n  {\n    H = A.H;\n    W = A.W;\n    for (auto i = 0; i < H; i++)\n    {\n      for (auto j = 0; j < W; j++)\n      {\n        a[i][j] = A.a[i][j];\n      }\n    }\n    return *this;\n  }\n\n  Matrix &operator=(const vector<T> v)\n  {\n    assert((int)v.size() == H * W);\n    for (auto i = 0; i < H; i++)\n    {\n      for (auto j = 0; j < W; j++)\n      {\n        a[i][j] = v[i * W + j];\n      }\n    }\n    return *this;\n  }\n\n  const Matrix operator-() const\n  {\n    Matrix X(H, W);\n    for (auto i = 0; i < H; i++)\n    {\n      for (auto j = 0; j < W; j++)\n      {\n        X.a[i][j] = MOD - a[i][j];\n        if (MOD > 0)\n        {\n          X.a[i][j] %= MOD;\n        }\n      }\n    }\n    return this;\n  }\n\n  const Matrix operator+(const Matrix &A) const\n  {\n    assert(A.H == H);\n    assert(A.W == W);\n    Matrix X(H, W);\n    for (auto i = 0; i < H; i++)\n    {\n      for (auto j = 0; j < W; j++)\n      {\n        X.a[i][j] = a[i][j] + A.a[i][j];\n        if (MOD > 0)\n        {\n          X.a[i][j] %= MOD;\n        }\n      }\n    }\n    return X;\n  }\n\n  const Matrix operator-(const Matrix &A) const\n  {\n    return this + (-A);\n  }\n\n  const Matrix operator*(const Matrix &A) const\n  {\n    assert(W == A.H);\n    Matrix X(H, A.W);\n    for (auto i = 0; i < X.H; i++)\n    {\n      for (auto j = 0; j < X.W; j++)\n      {\n        X.a[i][j] = 0;\n        for (auto k = 0; k < W; k++)\n        {\n          T t = a[i][k] * A.a[k][j];\n          if (MOD > 0)\n          {\n            t %= MOD;\n          }\n          X.a[i][j] += t;\n          if (MOD > 0)\n          {\n            X.a[i][j] %= MOD;\n          }\n        }\n      }\n    }\n    return X;\n  }\n\n  Matrix &operator+=(const Matrix &A)\n  {\n    Matrix X = this + A;\n    this = X;\n    return this;\n  }\n\n  Matrix &operator-=(const Matrix &A)\n  {\n    return this += (-A);\n  }\n\n  Matrix &operator*=(const Matrix &A)\n  {\n    Matrix X = this * A;\n    this = X;\n    return this;\n  }\n\n  bool operator==(const Matrix &A) const\n  {\n    assert(H == A.H);\n    assert(W == A.W);\n    for (auto i = 0; i < H; i++)\n    {\n      for (auto j = 0; j < W; j++)\n      {\n        if (a[i][j] != A.a[i][j])\n        {\n          return false;\n        }\n      }\n    }\n    return true;\n  }\n\n  bool operator!=(const Matrix &A) const\n  {\n    return !(this == A);\n  }\n\n  const T *&operator[](const size_t i) const\n  {\n    return a[i];\n  }\n\n  T *&operator[](const size_t i)\n  {\n    return a[i];\n  }\n\n  Matrix power(T N)\n  {\n    assert(H == W);\n    \/\/ N > 0\n    if (N == 1)\n    {\n      return *this;\n    }\n    if (N % 2 == 1)\n    {\n      return power(N - 1) * (*this);\n    }\n    Matrix X = power(N \/ 2);\n    return X * X;\n  }\n};\n\ntemplate <class T>\nT Matrix<T>::MOD = 0;\n\nll L, A, B, M;\nll upper[100];\n\nMatrix<ll> choose(ll k, ll n)\n{\n  Matrix<ll> K(3, 3);\n  ll p = 1;\n  for (auto i = 0; i < k; i++)\n  {\n    p *= 10LL;\n  }\n  p %= M;\n  K = {p, 1, 0, 0, 1, B, 0, 0, 1};\n  return K.power(n);\n}\n\nll f(ll i)\n{\n  return A + B * i;\n}\n\nint main()\n{\n  cin >> L >> A >> B >> M;\n  Matrix<ll>::MOD = M;\n  for (auto i = 1; i <= 18; i++)\n  {\n    ll ok = upper[i - 1];\n    ll ng = L;\n    if ((int)to_string(f(ok)).size() != i)\n    {\n      upper[i] = ok;\n      continue;\n    }\n    while (abs(ok - ng) > 1)\n    {\n      ll t = (ok + ng) \/ 2;\n      if ((int)to_string(f(t)).size() == i)\n      {\n        ok = t;\n      }\n      else\n      {\n        ng = t;\n      }\n    }\n    upper[i] = ng;\n  }\n  Matrix<ll> v(3, 1);\n  v = {0, A, 1};\n  for (auto i = 1; i <= 18; i++)\n  {\n    ll x = upper[i] - upper[i - 1];\n    if (x == 0)\n    {\n      continue;\n    }\n#if DEBUG == 1\n    cerr << \"i = \" << i << \", upper[\" << i << \"] = \" << upper[i] << endl;\n    cerr << \"f(\" << upper[i] - 1 << \") = \" << f(upper[i] - 1) << endl;\n    cerr << \"f(\" << upper[i] << \") = \" << f(upper[i]) << endl;\n#endif\n    v = choose(i, x) * v;\n#if DEBUG == 1\n    cerr << v[0][0] << \" \" << v[1][0] << \" \" << v[2][0] << endl;\n#endif\n  }\n  cout << v[0][0] << endl;\n}<|endoftext|>"}
{"text":"<commit_before>#define DEBUG 1\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 5\/18\/2020, 10:33:43 PM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(const Mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(const Mint &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(const Mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(const Mint &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n  Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n  Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n  Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n  bool operator<(const Mint &a) const { return x < a.x; }\n  bool operator<=(const Mint &a) const { return x <= a.x; }\n  bool operator>(const Mint &a) const { return x > a.x; }\n  bool operator>=(const Mint &a) const { return x >= a.x; }\n  bool operator==(const Mint &a) const { return x == a.x; }\n  bool operator!=(const Mint &a) const { return !(*this == a); }\n  const Mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, const Mint<MOD> &rhs)\n{\n  return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, const Mint<MOD> &rhs)\n{\n  return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n  return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, const Mint<MOD> &a)\n{\n  return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2LL; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1LL; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\ntemplate <typename T>\nT gcd(T x, T y) { return y ? gcd(y, x % y) : x; }\ntemplate <typename T>\nT lcm(T x, T y) { return x \/ gcd(x, y) * y; }\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n  int ans{0};\n  while (x != 0)\n  {\n    ans += x & 1;\n    x >>= 1;\n  }\n  return ans;\n}\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1000000000000000LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\/\/ ----- main() -----\n\nint main()\n{\n  ll N, K;\n  cin >> N >> K;\n  ll X{static_cast<ll>(sqrt(N)) + 10};\n  vector<vector<mint>> DP(K + 1, vector<mint>(X + 1, 0));\n  vector<vector<mint>> DP2(K + 1, vector<mint>(X + 1, 0));\n  vector<vector<mint>> DP_sum(K + 1, vector<mint>(X + 1, 0));\n  vector<vector<mint>> DP2_sum(K + 1, vector<mint>(X + 1, 0));\n  vector<mint> cnt(X + 1);\n  for (auto j = 1; j <= X; ++j)\n  {\n    cnt[j] = max(N \/ j, X) - max(N \/ (j + 1), X);\n  }\n  DP[0][1] = 1;\n  for (auto j = 1; j <= X; ++j)\n  {\n    DP_sum[0][j] = 1;\n  }\n  for (auto i = 1; i <= K; ++i)\n  {\n    for (auto j = 1; j <= X; ++j)\n    {\n      DP[i][j] = DP_sum[i - 1][min(X, N \/ j)] + DP2_sum[i - 1][X - 1] - DP2_sum[i - 1][j - 1];\n      DP2[i][j] = cnt[j] * DP_sum[i - 1][j];\n      DP_sum[i][j] = DP_sum[i][j - 1] + DP[i][j];\n      DP2_sum[i][j] = DP2_sum[i][j - 1] + DP2[i][j];\n    }\n  }\n  cout << DP_sum[K][X] + DP2_sum[K][X] << endl;\n}\n<commit_msg>submit F.cpp to 'F - Small Products' (abc132) [C++14 (GCC 5.4.1)]<commit_after>#define DEBUG 1\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 5\/18\/2020, 10:33:43 PM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(const Mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(const Mint &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(const Mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(const Mint &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n  Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n  Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n  Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n  bool operator<(const Mint &a) const { return x < a.x; }\n  bool operator<=(const Mint &a) const { return x <= a.x; }\n  bool operator>(const Mint &a) const { return x > a.x; }\n  bool operator>=(const Mint &a) const { return x >= a.x; }\n  bool operator==(const Mint &a) const { return x == a.x; }\n  bool operator!=(const Mint &a) const { return !(*this == a); }\n  const Mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, const Mint<MOD> &rhs)\n{\n  return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, const Mint<MOD> &rhs)\n{\n  return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n  return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, const Mint<MOD> &a)\n{\n  return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2LL; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1LL; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\ntemplate <typename T>\nT gcd(T x, T y) { return y ? gcd(y, x % y) : x; }\ntemplate <typename T>\nT lcm(T x, T y) { return x \/ gcd(x, y) * y; }\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n  int ans{0};\n  while (x != 0)\n  {\n    ans += x & 1;\n    x >>= 1;\n  }\n  return ans;\n}\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1000000000000000LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\/\/ ----- main() -----\n\nint main()\n{\n  ll N, K;\n  cin >> N >> K;\n  ll X{static_cast<ll>(sqrt(N)) + 10};\n  vector<vector<mint>> DP(K + 1, vector<mint>(X + 1, 0));\n  vector<vector<mint>> DP2(K + 1, vector<mint>(X + 1, 0));\n  vector<vector<mint>> SUM(K + 1, vector<mint>(X + 1, 0));\n  vector<vector<mint>> SUM2(K + 1, vector<mint>(X + 1, 0));\n  vector<mint> cnt(X + 1);\n  for (auto j = 1; j <= X; ++j)\n  {\n    cnt[j] = max(N \/ j, X) - max(N \/ (j + 1), X);\n  }\n  DP[0][1] = 1;\n  for (auto j = 1; j <= X; ++j)\n  {\n    SUM[0][j] = 1;\n  }\n  for (auto i = 1; i <= K; ++i)\n  {\n    for (auto j = 1; j <= X; ++j)\n    {\n      DP[i][j] = SUM[i - 1][min(X, N \/ j)] + SUM2[i - 1][X - 1] - SUM2[i - 1][j - 1];\n      DP2[i][j] = cnt[j] * SUM[i - 1][j];\n      SUM[i][j] = SUM[i][j - 1] + DP[i][j];\n      SUM2[i][j] = SUM2[i][j - 1] + DP2[i][j];\n    }\n  }\n  cout << SUM[K][X] + SUM2[K][X] << endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>#define DEBUG 1\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 8\/13\/2019, 5:50:27 PM\n * Powered by Visual Studio Code\n *\/\n#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <complex>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <functional>\n#include <random>\n#include <chrono>\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\nusing namespace std;\n#define maxs(x, y) (x = max(x, y))\n#define mins(x, y) (x = min(x, y))\nusing ll = long long;\nclass mint\n{\npublic:\n  static ll MOD;\n  ll x;\n  mint() : x(0) {}\n  mint(ll x) : x(x % MOD) {}\n  mint operator-() const { return x ? MOD - x : 0; }\n  mint &operator+=(const mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  mint &operator-=(const mint &a) { return *this += -a; }\n  mint &operator*=(const mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  mint &operator\/=(const mint &a)\n  {\n    mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  mint operator+(const mint &a) const { return mint(*this) += a; }\n  mint operator-(const mint &a) const { return mint(*this) -= a; }\n  mint operator*(const mint &a) const { return mint(*this) *= a; }\n  mint operator\/(const mint &a) const { return mint(*this) \/= a; }\n  bool operator<(const mint &a) const { return x < a.x; }\n  bool operator==(const mint &a) const { return x == a.x; }\n  const mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\nll mint::MOD = 1e9 + 7;\nistream &operator>>(istream &stream, mint &a) { return stream >> a.x; }\nostream &operator<<(ostream &stream, const mint &a) { return stream << a.x; }\nclass combination\n{\npublic:\n  vector<mint> inv, fact, factinv;\n  static int MAX_SIZE;\n  combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[mint::MOD % i]) * (mint::MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1; i < MAX_SIZE; i++)\n    {\n      fact[i] = mint(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  mint operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n};\nint combination::MAX_SIZE = 3000010;\nll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }\nconstexpr double epsilon = 1e-10;\n\/\/ constexpr ll infty = 1000000000000000LL;\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\nstruct Element\n{\n  mint val;\n  mint c;\n  int ind;\n  int ind_a;\n  bool is_a;\n\n  Element() {}\n  Element(int i, mint v) : val{v}, ind{i}, is_a{true} {}\n  Element(int i, mint v, mint _c) : val{v}, c{_c}, ind{i}, is_a{false} {}\n\n  bool operator<(Element const &l) const\n  {\n    if (val == l.val)\n    {\n      return ind < l.ind;\n    }\n    return val < l.val;\n  }\n};\n\nvector<Element> make_elements(ll N)\n{\n  vector<Element> res(2 * N);\n  \/\/ make_A\n  for (auto i = 0LL; i < N; i++)\n  {\n    ll X = sqrt(4 * N * N - (i + N) * (i + N)) + epsilon;\n    res[i] = Element(i, X + 1);\n  }\n  \/\/ make_B\n  for (auto i = 0LL; i < N; i++)\n  {\n    ll X = sqrt(4 * N * N - i * i) + epsilon;\n    ll Y = sqrt(N * N - i * i) - epsilon;\n    res[i + N] = Element(i, Y + 1, X + 1);\n  }\n  sort(res.begin(), res.end());\n  \/\/ calc ind_a;\n  ll now{0};\n  for (auto i = 0LL; i < 2 * N; i++)\n  {\n    res[i].ind_a = now;\n    if (res[i].is_a)\n    {\n      ++now;\n    }\n  }\n  return res;\n}\n\nmint solve(ll N, vector<Element> const &V, ll k)\n{\n  vector<vector<mint>> dp(2 * N + 1, vector<mint>(2 * N + 1, 0));\n  dp[0][0] = 1;\n  for (auto x = 0; x < 2 * N; x++)\n  {\n    for (auto y = 0; y <= x; y++)\n    {\n      if (dp[x][y] == 0)\n      {\n        continue;\n      }\n      if (V[x].is_a)\n      {\n        dp[x + 1][y] += dp[x][y] * (V[x].val - V[x].ind_a - y);\n      }\n      else\n      {\n        dp[x + 1][y + 1] += dp[x][y] * (V[x].val - V[x].ind_a - y);\n        dp[x + 1][y] += dp[x][y] * (V[x].c - N - k - (V[x].ind - y));\n      }\n    }\n  }\n  return dp[2 * N][k];\n}\n\nint main()\n{\n  ll N;\n  cin >> N >> mint::MOD;\n  vector<Element> V{make_elements(N)};\n  mint ans{0};\n  for (auto k = 0LL; k <= N; k++)\n  {\n    if (k % 2)\n    {\n      ans -= solve(N, V, k);\n    }\n    else\n    {\n      ans += solve(N, V, k);\n    }\n  }\n  cout << ans << endl;\n}<commit_msg>tried F.cpp to 'F'<commit_after>#define DEBUG 1\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 8\/13\/2019, 5:50:27 PM\n * Powered by Visual Studio Code\n *\/\n#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <complex>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <functional>\n#include <random>\n#include <chrono>\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\nusing namespace std;\n#define maxs(x, y) (x = max(x, y))\n#define mins(x, y) (x = min(x, y))\nusing ll = long long;\nclass mint\n{\npublic:\n  static ll MOD;\n  ll x;\n  mint() : x(0) {}\n  mint(ll x) : x(x % MOD) {}\n  mint operator-() const { return x ? MOD - x : 0; }\n  mint &operator+=(const mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  mint &operator-=(const mint &a) { return *this += -a; }\n  mint &operator*=(const mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  mint &operator\/=(const mint &a)\n  {\n    mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  mint operator+(const mint &a) const { return mint(*this) += a; }\n  mint operator-(const mint &a) const { return mint(*this) -= a; }\n  mint operator*(const mint &a) const { return mint(*this) *= a; }\n  mint operator\/(const mint &a) const { return mint(*this) \/= a; }\n  bool operator<(const mint &a) const { return x < a.x; }\n  bool operator==(const mint &a) const { return x == a.x; }\n  const mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\nll mint::MOD = 1e9 + 7;\nistream &operator>>(istream &stream, mint &a) { return stream >> a.x; }\nostream &operator<<(ostream &stream, const mint &a) { return stream << a.x; }\nclass combination\n{\npublic:\n  vector<mint> inv, fact, factinv;\n  static int MAX_SIZE;\n  combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[mint::MOD % i]) * (mint::MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1; i < MAX_SIZE; i++)\n    {\n      fact[i] = mint(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  mint operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n};\nint combination::MAX_SIZE = 3000010;\nll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }\nconstexpr double epsilon = 1e-10;\n\/\/ constexpr ll infty = 1000000000000000LL;\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\nstruct Element\n{\n  mint val;\n  mint c;\n  int ind;\n  int ind_a;\n  bool is_a;\n\n  Element() {}\n  Element(int i, mint v) : val{v}, ind{i}, is_a{true} {}\n  Element(int i, mint v, mint _c) : val{v}, c{_c}, ind{i}, is_a{false} {}\n\n  bool operator<(Element const &l) const\n  {\n    if (val == l.val)\n    {\n      return ind < l.ind;\n    }\n    return val < l.val;\n  }\n};\n\nvector<Element> make_elements(ll N)\n{\n  vector<Element> res(2 * N);\n  \/\/ make_A\n  for (auto i = 0LL; i < N; i++)\n  {\n    ll X = sqrt(4 * N * N - (i + N) * (i + N)) + epsilon;\n    res[i] = Element(i, X + 1);\n  }\n  \/\/ make_B\n  for (auto i = 0LL; i < N; i++)\n  {\n    ll X = sqrt(4 * N * N - i * i) + epsilon;\n    ll Y = sqrt(N * N - i * i) - epsilon;\n    res[i + N] = Element(i, Y + 1, X + 1);\n  }\n  sort(res.begin(), res.end());\n  \/\/ calc ind_a;\n  ll now{0};\n  for (auto i = 0LL; i < 2 * N; i++)\n  {\n    res[i].ind_a = now;\n    if (res[i].is_a)\n    {\n      ++now;\n    }\n  }\n  return res;\n}\n\nmint solve(ll N, vector<Element> const &V, ll k)\n{\n  vector<vector<mint>> dp(2 * N + 1, vector<mint>(2 * N + 1, 0));\n  dp[0][0] = 1;\n  for (auto x = 0; x < 2 * N; x++)\n  {\n    for (auto y = 0; y <= x; y++)\n    {\n      if (dp[x][y] == 0)\n      {\n        continue;\n      }\n      if (V[x].is_a)\n      {\n        dp[x + 1][y] += dp[x][y] * (V[x].val - V[x].ind_a - y);\n      }\n      else\n      {\n        dp[x + 1][y + 1] += dp[x][y] * (V[x].val - V[x].ind_a - y);\n        dp[x + 1][y] += dp[x][y] * (V[x].c - N - k - (V[x].ind - y));\n      }\n    }\n  }\n  return dp[2 * N][k];\n}\n\nint main()\n{\n  ll N;\n  cin >> N >> mint::MOD;\n  vector<Element> V{make_elements(N)};\n#if DEBUG == 1\n  for (auto i = 0; i < 2 * N; i++)\n  {\n    cerr << \"V[\" << i << \"] = \";\n    if (V[i].is_a)\n    {\n      cerr << \"a[\" << V[i].ind << \"] = \" << V[i].val << endl;\n    }\n    else\n    {\n      cerr << \"b[\" << V[i].ind << \"] = \" << V[i].val << \", c[\" << V[i].ind << \"] = \" << V[i].c << endl;\n    }\n  }\n#endif\n  mint ans{0};\n  for (auto k = 0LL; k <= N; k++)\n  {\n    if (k % 2)\n    {\n      ans -= solve(N, V, k);\n    }\n    else\n    {\n      ans += solve(N, V, k);\n    }\n  }\n  cout << ans << endl;\n}<|endoftext|>"}
{"text":"<commit_before>#define DEBUG 1\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 12\/11\/2019, 4:20:39 PM\n * Powered by Visual Studio Code\n *\/\n#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <complex>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <functional>\n#include <random>\n#include <chrono>\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/optional.hpp> \/\/ for C++14\n\/\/ ----- using directives and manipulations -----\nusing boost::rational;\nusing namespace std;\nusing ll = long long;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{x % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(const Mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(const Mint &a) { return *this += -a; }\n  Mint &operator*=(const Mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(const Mint &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n  Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n  Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n  Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n  bool operator<(const Mint &a) const { return x < a.x; }\n  bool operator<=(const Mint &a) const { return x <= a.x; }\n  bool operator>(const Mint &a) const { return x > a.x; }\n  bool operator>=(const Mint &a) const { return x >= a.x; }\n  bool operator==(const Mint &a) const { return x == a.x; }\n  bool operator!=(const Mint &a) const { return !(*this == a); }\n  const Mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, const Mint<MOD> &rhs)\n{\n  return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, const Mint<MOD> &rhs)\n{\n  return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n  return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, const Mint<MOD> &a)\n{\n  return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2LL; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1LL; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\nll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1000000000000000LL};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\/\/ ----- main() -----\n\nstruct Element\n{\n  int ind;\n  ll left, right;\n  boost::optional<int> value; \/\/ for C++14\n  bool operator<(Element const &rhs) const\n  {\n    return ind < rhs.ind;\n  }\n  bool operator==(Element const &rhs) const\n  {\n    return ind == rhs.ind;\n  }\n};\n\nElement make_element(int ind)\n{\n  return Element{ind, 0, 0, boost::none};\n}\n\nclass Solve\n{\n  int N, L;\n  set<Element> A;\n  map<int, vector<int>> indexes; \/\/ value -> inds\n\npublic:\n  Solve(int N, int L, vector<int> input) : N{N}, L{L}\n  {\n    for (auto i = 0; i < N; i++)\n    {\n      A.insert({i, 1, 1, input[i]});\n      indexes[input[i]];\n      indexes[input[i]].push_back(i);\n    }\n  }\n\n  ll count()\n  {\n    ll ans{N};\n    while (!indexes.empty())\n    {\n      vector<Element> tmp;\n      auto &vec{indexes.begin()->second};\n      sort(vec.begin(), vec.end());\n      int min_value{indexes.begin()->first};\n#if DEBUG == 1\n      cerr << \"min_value = \" << min_value << endl;\n#endif\n      for (auto ind : indexes[min_value])\n      {\n        auto it{A.find(make_element(ind))};\n#if DEBUG == 1\n        cerr << \"A[\" << it->ind << \"] = (\" << (it->value ? to_string(*it->value) : \"n\") << \", \" << it->right << \", \" << it->left << \")\" << endl;\n#endif\n        assert(it != A.end());\n        tmp.push_back(*it);\n        it = A.erase(it);\n        if (it == A.end() || it->value != min_value)\n        {\n          update(ans, tmp);\n        }\n      }\n      if (!tmp.empty())\n      {\n        update(ans, tmp);\n      }\n      indexes.erase(indexes.begin());\n    }\n    return ans;\n  }\n\nprivate:\n  void\n  update(ll &ans, vector<Element> &tmp)\n  {\n    ans += calc(tmp);\n    tmp = press(tmp);\n    ans -= calc(tmp);\n    for (auto e : tmp)\n    {\n      A.insert(e);\n    }\n    tmp.clear();\n#if DEBUG == 1\n    cerr << \"updated.\" << endl;\n#endif\n  }\n\n  ll calc(vector<Element> const &X)\n  {\n    ll ans{0};\n    ll sum_right{0};\n    int S{static_cast<int>(X.size())};\n    for (auto i = L - 1; i < S; i++)\n    {\n      sum_right += X[i].right;\n    }\n    for (auto i = 0; i < S - L + 1; i++)\n    {\n      ans += X[i].left * sum_right;\n      sum_right -= X[i + L - 1].right;\n    }\n    assert(sum_right == 0);\n    return ans;\n  }\n\n  vector<Element> press(vector<Element> const &V)\n  {\n    assert(!V.empty());\n    int S{static_cast<int>(V.size())};\n    if (S < L)\n    {\n      return {{V[0].ind, 0, 0, boost::none}};\n    }\n    int index{V[0].ind};\n    int K{*V[0].value + 1};\n    vector<Element> ans(S \/ L);\n    for (auto &e : ans)\n    {\n      e.ind = index;\n      e.value = K;\n      indexes[K];\n      indexes[K].push_back(index);\n      ++index;\n    }\n    for (auto i = L - 1; i < S; i++)\n    {\n      ans[(i - L + 1) \/ L].right += V[i].right;\n    }\n    int mod{S % L};\n    for (auto i = 0; i < S - L + 1; i++)\n    {\n      ans[(i + L - mod - 1) \/ L].left += V[i].left;\n    }\n    return ans;\n  }\n};\n\nint main()\n{\n  int N, L;\n  cin >> N >> L;\n  vector<int> A(N);\n  for (auto i = 0; i < N; i++)\n  {\n    cin >> A[i];\n  }\n  Solve solve(N, L, A);\n  cout << solve.count() << endl;\n}\n<commit_msg>submit F.cpp to 'F - Counting of Subarrays' (agc037) [C++14 (GCC 5.4.1)]<commit_after>#define DEBUG 1\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 12\/11\/2019, 4:20:39 PM\n * Powered by Visual Studio Code\n *\/\n#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <complex>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <functional>\n#include <random>\n#include <chrono>\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/optional.hpp> \/\/ for C++14\n\/\/ ----- using directives and manipulations -----\nusing boost::rational;\nusing namespace std;\nusing ll = long long;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{x % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(const Mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(const Mint &a) { return *this += -a; }\n  Mint &operator*=(const Mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(const Mint &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n  Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n  Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n  Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n  bool operator<(const Mint &a) const { return x < a.x; }\n  bool operator<=(const Mint &a) const { return x <= a.x; }\n  bool operator>(const Mint &a) const { return x > a.x; }\n  bool operator>=(const Mint &a) const { return x >= a.x; }\n  bool operator==(const Mint &a) const { return x == a.x; }\n  bool operator!=(const Mint &a) const { return !(*this == a); }\n  const Mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, const Mint<MOD> &rhs)\n{\n  return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, const Mint<MOD> &rhs)\n{\n  return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n  return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, const Mint<MOD> &a)\n{\n  return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2LL; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1LL; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\nll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1000000000000000LL};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\/\/ ----- main() -----\n\nstruct Element\n{\n  int ind;\n  ll left, right;\n  boost::optional<int> value; \/\/ for C++14\n  bool operator<(Element const &rhs) const\n  {\n    return ind < rhs.ind;\n  }\n  bool operator==(Element const &rhs) const\n  {\n    return ind == rhs.ind;\n  }\n};\n\nElement make_element(int ind) \/\/ helper function avoiding contaminating the default constructor.\n{\n  return Element{ind, 0, 0, boost::none};\n}\n\nclass Solve\n{\n  int N, L;\n  set<Element> A;\n  map<int, vector<int>> indexes; \/\/ value -> inds\n\npublic:\n  Solve(int N, int L, vector<int> input) : N{N}, L{L}\n  {\n    for (auto i = 0; i < N; i++)\n    {\n      A.insert({i, 1, 1, input[i]});\n      indexes[input[i]];\n      indexes[input[i]].push_back(i);\n    }\n  }\n\n  ll count()\n  {\n    ll ans{N};\n    while (!indexes.empty())\n    {\n      vector<Element> tmp;\n      auto &vec{indexes.begin()->second};\n      sort(vec.begin(), vec.end());\n      int min_value{indexes.begin()->first};\n      for (auto ind : indexes[min_value]) \/\/ in order not to touch all elements of A.\n      {\n        auto it{A.find(make_element(ind))};\n        assert(it != A.end()); \/\/ it must be found.\n        tmp.push_back(*it);\n        it = A.erase(it); \/\/ We must erase elements before inserting pressed elements. Fortunately `erase` returns the next iterator.\n        if (it == A.end() || it->value != min_value)\n        {\n          update(ans, tmp);\n        }\n      }\n      if (!tmp.empty())\n      {\n        update(ans, tmp);\n      }\n      indexes.erase(indexes.begin());\n    }\n    return ans;\n  }\n\nprivate:\n  void update(ll &ans, vector<Element> &tmp)\n  {\n    ans += calc(tmp);\n    tmp = press(tmp);\n    ans -= calc(tmp);\n    for (auto e : tmp)\n    {\n      A.insert(e);\n    }\n    tmp.clear();\n  }\n\n  ll calc(vector<Element> const &X)\n  {\n    ll ans{0};\n    ll sum_right{0};\n    int S{static_cast<int>(X.size())};\n    for (auto i = L - 1; i < S; i++)\n    {\n      sum_right += X[i].right;\n    }\n    for (auto i = 0; i < S - L + 1; i++)\n    {\n      ans += X[i].left * sum_right;\n      sum_right -= X[i + L - 1].right;\n    }\n    assert(sum_right == 0);\n    return ans;\n  }\n\n  vector<Element> press(vector<Element> const &V)\n  {\n    assert(!V.empty());\n    int S{static_cast<int>(V.size())};\n    if (S < L)\n    {\n      return {{V[0].ind, 0, 0, boost::none}};\n    }\n    int index{V[0].ind};\n    int K{*V[0].value + 1};\n    vector<Element> ans(S \/ L);\n    for (auto &e : ans)\n    {\n      e.ind = index;\n      e.value = K;\n      indexes[K];\n      indexes[K].push_back(index);\n      ++index;\n    }\n    for (auto i = L - 1; i < S; i++)\n    {\n      ans[(i - L + 1) \/ L].right += V[i].right;\n    }\n    int mod{S % L};\n    for (auto i = 0; i < S - L + 1; i++)\n    {\n      ans[(i + L - mod - 1) \/ L].left += V[i].left;\n    }\n    return ans;\n  }\n};\n\nint main()\n{\n  int N, L;\n  cin >> N >> L;\n  vector<int> A(N);\n  for (auto i = 0; i < N; i++)\n  {\n    cin >> A[i];\n  }\n  Solve solve(N, L, A);\n  cout << solve.count() << endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>#define DEBUG 1\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 12\/11\/2019, 4:20:39 PM\n * Powered by Visual Studio Code\n *\/\n#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <complex>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <functional>\n#include <random>\n#include <chrono>\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/optional.hpp> \/\/ for C++14\n\/\/ ----- using directives and manipulations -----\nusing boost::rational;\nusing namespace std;\nusing ll = long long;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{x % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(const Mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(const Mint &a) { return *this += -a; }\n  Mint &operator*=(const Mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(const Mint &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n  Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n  Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n  Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n  bool operator<(const Mint &a) const { return x < a.x; }\n  bool operator<=(const Mint &a) const { return x <= a.x; }\n  bool operator>(const Mint &a) const { return x > a.x; }\n  bool operator>=(const Mint &a) const { return x >= a.x; }\n  bool operator==(const Mint &a) const { return x == a.x; }\n  bool operator!=(const Mint &a) const { return !(*this == a); }\n  const Mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, const Mint<MOD> &rhs)\n{\n  return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, const Mint<MOD> &rhs)\n{\n  return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n  return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, const Mint<MOD> &a)\n{\n  return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2LL; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1LL; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\nll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1000000000000000LL};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\/\/ ----- main() -----\n\nstruct Element\n{\n  int ind;\n  ll left, right;\n  boost::optional<int> value; \/\/ for C++14\n  bool operator<(Element const &rhs) const\n  {\n    return ind < rhs.ind;\n  }\n  bool operator==(Element const &rhs) const\n  {\n    return ind == rhs.ind;\n  }\n};\n\nElement make_element(int ind) \/\/ helper function avoiding contaminating the default constructor.\n{\n  return Element{ind, 0, 0, boost::none};\n}\n\nclass Solve\n{\n  int N, L;\n  set<Element> A;\n  map<int, vector<int>> indexes; \/\/ value -> inds\n\npublic:\n  Solve(int N, int L, vector<int> input) : N{N}, L{L}\n  {\n    for (auto i = 0; i < N; i++)\n    {\n      A.insert({i, 1, 1, input[i]});\n      indexes[input[i]];\n      indexes[input[i]].push_back(i);\n    }\n  }\n\n  ll count()\n  {\n    ll ans{N};\n    while (!indexes.empty())\n    {\n      vector<Element> tmp;\n      auto &vec{indexes.begin()->second};\n      sort(vec.begin(), vec.end());\n      int min_value{indexes.begin()->first};\n      for (auto ind : indexes[min_value]) \/\/ in order not to touch all elements of A.\n      {\n        auto it{A.find(make_element(ind))};\n        assert(it != A.end()); \/\/ it must be found.\n        tmp.push_back(*it);\n        it = A.erase(it); \/\/ We must erase elements before inserting pressed elements. Fortunately `erase` returns the next iterator.\n        if (it == A.end() || it->value != min_value)\n        {\n          update(ans, tmp);\n        }\n      }\n      if (!tmp.empty())\n      {\n        update(ans, tmp);\n      }\n      indexes.erase(indexes.begin());\n    }\n    return ans;\n  }\n\nprivate:\n  void update(ll &ans, vector<Element> &tmp)\n  {\n    ans += calc(tmp);\n    tmp = press(tmp);\n    ans -= calc(tmp);\n    for (auto e : tmp)\n    {\n      A.insert(e);\n    }\n    tmp.clear();\n  }\n\n  ll calc(vector<Element> const &X)\n  {\n    ll ans{0};\n    ll sum_right{0};\n    int S{static_cast<int>(X.size())};\n    for (auto i = L - 1; i < S; i++)\n    {\n      sum_right += X[i].right;\n    }\n    for (auto i = 0; i < S - L + 1; i++)\n    {\n      ans += X[i].left * sum_right;\n      sum_right -= X[i + L - 1].right;\n    }\n    assert(sum_right == 0);\n    return ans;\n  }\n\n  vector<Element> press(vector<Element> const &V)\n  {\n    assert(!V.empty());\n    int S{static_cast<int>(V.size())};\n    if (S < L)\n    {\n      return {{V[0].ind, 0, 0, boost::none}};\n    }\n    int index{V[0].ind};\n    int K{*V[0].value + 1};\n    vector<Element> ans(S \/ L);\n    for (auto &e : ans)\n    {\n      e.ind = index;\n      e.value = K;\n      indexes[K];\n      indexes[K].push_back(index);\n      ++index;\n    }\n    for (auto i = L - 1; i < S; i++)\n    {\n      ans[(i - L + 1) \/ L].right += V[i].right;\n    }\n    int mod{S % L};\n    for (auto i = 0; i < S - L + 1; i++)\n    {\n      ans[(i + L - mod - 1) \/ L].left += V[i].left;\n    }\n    return ans;\n  }\n};\n\nint main()\n{\n  int N, L;\n  cin >> N >> L;\n  vector<int> A(N);\n  for (auto i = 0; i < N; i++)\n  {\n    cin >> A[i];\n  }\n  Solve solve(N, L, A);\n  cout << solve.count() << endl;\n}\n<commit_msg>submit F.cpp to 'F - Counting of Subarrays' (agc037) [C++14 (GCC 5.4.1)]<commit_after>#define DEBUG 1\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 12\/11\/2019, 4:20:39 PM\n * Powered by Visual Studio Code\n *\/\n#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <complex>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <functional>\n#include <random>\n#include <chrono>\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/optional.hpp> \/\/ for C++14\n\/\/ ----- using directives and manipulations -----\nusing boost::rational;\nusing namespace std;\nusing ll = long long;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{x % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(const Mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(const Mint &a) { return *this += -a; }\n  Mint &operator*=(const Mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(const Mint &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n  Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n  Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n  Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n  bool operator<(const Mint &a) const { return x < a.x; }\n  bool operator<=(const Mint &a) const { return x <= a.x; }\n  bool operator>(const Mint &a) const { return x > a.x; }\n  bool operator>=(const Mint &a) const { return x >= a.x; }\n  bool operator==(const Mint &a) const { return x == a.x; }\n  bool operator!=(const Mint &a) const { return !(*this == a); }\n  const Mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, const Mint<MOD> &rhs)\n{\n  return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, const Mint<MOD> &rhs)\n{\n  return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n  return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, const Mint<MOD> &a)\n{\n  return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2LL; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1LL; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\nll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1000000000000000LL};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\/\/ ----- main() -----\n\nstruct Element\n{\n  int ind;\n  ll left, right;\n  boost::optional<int> value; \/\/ for C++14\n  bool operator<(Element const &rhs) const\n  {\n    return ind < rhs.ind;\n  }\n  bool operator==(Element const &rhs) const\n  {\n    return ind == rhs.ind;\n  }\n};\n\nElement make_element(int ind) \/\/ helper function avoiding contaminating the default constructor.\n{\n  return Element{ind, 0, 0, boost::none};\n}\n\nclass Solve\n{\n  int N, L;\n  set<Element> A;\n  map<int, vector<int>> indexes; \/\/ value -> inds\n\npublic:\n  Solve(int N, int L, vector<int> input) : N{N}, L{L}\n  {\n    for (auto i = 0; i < N; i++)\n    {\n      A.insert({i, 1, 1, input[i]});\n      indexes[input[i]];\n      indexes[input[i]].push_back(i);\n    }\n  }\n\n  ll count();\n\nprivate:\n  void update(ll &ans, vector<Element> &tmp)\n  {\n    ans += calc(tmp);\n    tmp = press(tmp);\n    ans -= calc(tmp);\n    for (auto e : tmp)\n    {\n      A.insert(e);\n    }\n    tmp.clear();\n  }\n\n  ll calc(vector<Element> const &X)\n  {\n    ll ans{0};\n    ll sum_right{0};\n    int S{static_cast<int>(X.size())};\n    for (auto i = L - 1; i < S; i++)\n    {\n      sum_right += X[i].right;\n    }\n    for (auto i = 0; i < S - L + 1; i++)\n    {\n      ans += X[i].left * sum_right;\n      sum_right -= X[i + L - 1].right;\n    }\n    assert(sum_right == 0);\n    return ans;\n  }\n\n  vector<Element> press(vector<Element> const &V)\n  {\n    assert(!V.empty());\n    int S{static_cast<int>(V.size())};\n    if (S < L)\n    {\n      return {{V[0].ind, 0, 0, boost::none}};\n    }\n    int index{V[0].ind};\n    int K{*V[0].value + 1};\n    vector<Element> ans(S \/ L);\n    for (auto &e : ans)\n    {\n      e.ind = index;\n      e.value = K;\n      indexes[K];\n      indexes[K].push_back(index);\n      ++index;\n    }\n    for (auto i = L - 1; i < S; i++)\n    {\n      ans[(i - L + 1) \/ L].right += V[i].right;\n    }\n    int mod{S % L};\n    for (auto i = 0; i < S - L + 1; i++)\n    {\n      ans[(i + L - mod - 1) \/ L].left += V[i].left;\n    }\n    return ans;\n  }\n};\n\nll Solve::count()\n{\n  ll ans{N};\n  while (!indexes.empty())\n  {\n    vector<Element> tmp;\n    auto &vec{indexes.begin()->second};\n    sort(vec.begin(), vec.end());\n    int min_value{indexes.begin()->first};\n    for (auto ind : indexes[min_value]) \/\/ in order not to touch all elements of A.\n    {\n      auto it{A.find(make_element(ind))};\n      assert(it != A.end()); \/\/ it must be found.\n      tmp.push_back(*it);\n      it = A.erase(it); \/\/ We must erase elements before inserting pressed elements. Fortunately `erase` returns the next iterator.\n      if (it == A.end() || it->value != min_value)\n      {\n        update(ans, tmp);\n      }\n    }\n    if (!tmp.empty())\n    {\n      update(ans, tmp);\n    }\n    indexes.erase(indexes.begin());\n  }\n  return ans;\n}\n\nint main()\n{\n  int N, L;\n  cin >> N >> L;\n  vector<int> A(N);\n  for (auto i = 0; i < N; i++)\n  {\n    cin >> A[i];\n  }\n  Solve solve(N, L, A);\n  cout << solve.count() << endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>#define DEBUG 1\n\/**\n * File    : E.cpp\n * Author  : Kazune Takahashi\n * Created : 6\/16\/2020, 4:51:07 PM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ld = long double;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1'000'000'007LL};\n\/\/ constexpr ll MOD{998'244'353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3'000'010LL};\n\/\/ constexpr ll MAX_SIZE{30'000'010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nbool ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n    return true;\n  }\n  return false;\n}\ntemplate <typename T>\nbool ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n    return true;\n  }\n  return false;\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(Mint const &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(Mint const &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(Mint const &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(Mint const &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(Mint const &a) const { return Mint(*this) += a; }\n  Mint operator-(Mint const &a) const { return Mint(*this) -= a; }\n  Mint operator*(Mint const &a) const { return Mint(*this) *= a; }\n  Mint operator\/(Mint const &a) const { return Mint(*this) \/= a; }\n  bool operator<(Mint const &a) const { return x < a.x; }\n  bool operator<=(Mint const &a) const { return x <= a.x; }\n  bool operator>(Mint const &a) const { return x > a.x; }\n  bool operator>=(Mint const &a) const { return x >= a.x; }\n  bool operator==(Mint const &a) const { return x == a.x; }\n  bool operator!=(Mint const &a) const { return !(*this == a); }\n  Mint power(ll N) const\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, Mint<MOD> const &rhs) { return rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, Mint<MOD> const &rhs) { return -rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, Mint<MOD> const &rhs) { return rhs * lhs; }\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, Mint<MOD> const &rhs) { return Mint<MOD>{lhs} \/ rhs; }\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a) { return stream >> a.x; }\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, Mint<MOD> const &a) { return stream << a.x; }\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i{2LL}; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i{1LL}; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\ntemplate <typename T>\nT gcd(T x, T y) { return y ? gcd(y, x % y) : x; }\ntemplate <typename T>\nT lcm(T x, T y) { return x \/ gcd(x, y) * y; }\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n  int ans{0};\n  while (x != 0)\n  {\n    ans += x & 1;\n    x >>= 1;\n  }\n  return ans;\n}\n\/\/ ----- Infty -----\ntemplate <typename T>\nconstexpr T Infty() { return numeric_limits<T>::max(); }\ntemplate <typename T>\nconstexpr T mInfty() { return numeric_limits<T>::min(); }\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1'000'000'000'000'010LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\n\/\/ ----- Solve -----\n\nclass Solve\n{\n\npublic:\n  Solve()\n  {\n  }\n\n  void flush()\n  {\n  }\n\nprivate:\n};\n\n\/\/ ----- main() -----\n\n\/*\nint main()\n{\n  Solve solve;\n  solve.flush();\n}\n*\/\n\nint main()\n{\n  int N;\n  cin >> N;\n  vector<cpp_int> A(N);\n  for (auto i{0}; i < N; ++i)\n  {\n    cin >> A[i];\n  }\n  cpp_int L{1};\n  for (auto i{0}; i < N; ++i)\n  {\n    L = lcm(L, A[i]);\n  }\n  auto R{static_cast<ll>(L % MOD)};\n  auto M{mint{R}};\n  mint ans{0};\n  for (auto i{0}; i < N; ++i)\n  {\n    ans += M \/ static_cast<ll>(A[i]);\n  }\n  cout << ans << endl;\n}\n<commit_msg>submit E.cpp to 'E - Flatten' (abc152) [C++14 (GCC 5.4.1)]<commit_after>#define DEBUG 1\n\/**\n * File    : E.cpp\n * Author  : Kazune Takahashi\n * Created : 6\/16\/2020, 4:51:07 PM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ld = long double;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1'000'000'007LL};\n\/\/ constexpr ll MOD{998'244'353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3'000'010LL};\n\/\/ constexpr ll MAX_SIZE{30'000'010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nbool ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n    return true;\n  }\n  return false;\n}\ntemplate <typename T>\nbool ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n    return true;\n  }\n  return false;\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(Mint const &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(Mint const &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(Mint const &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(Mint const &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(Mint const &a) const { return Mint(*this) += a; }\n  Mint operator-(Mint const &a) const { return Mint(*this) -= a; }\n  Mint operator*(Mint const &a) const { return Mint(*this) *= a; }\n  Mint operator\/(Mint const &a) const { return Mint(*this) \/= a; }\n  bool operator<(Mint const &a) const { return x < a.x; }\n  bool operator<=(Mint const &a) const { return x <= a.x; }\n  bool operator>(Mint const &a) const { return x > a.x; }\n  bool operator>=(Mint const &a) const { return x >= a.x; }\n  bool operator==(Mint const &a) const { return x == a.x; }\n  bool operator!=(Mint const &a) const { return !(*this == a); }\n  Mint power(ll N) const\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, Mint<MOD> const &rhs) { return rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, Mint<MOD> const &rhs) { return -rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, Mint<MOD> const &rhs) { return rhs * lhs; }\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, Mint<MOD> const &rhs) { return Mint<MOD>{lhs} \/ rhs; }\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a) { return stream >> a.x; }\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, Mint<MOD> const &a) { return stream << a.x; }\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i{2LL}; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i{1LL}; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\ncpp_int gcd(cpp_int x, cpp_int y) { return y ? gcd(y, x % y) : x; }\ncpp_int lcm(cpp_int x, cpp_int y) { return x \/ gcd(x, y) * y; }\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n  int ans{0};\n  while (x != 0)\n  {\n    ans += x & 1;\n    x >>= 1;\n  }\n  return ans;\n}\n\/\/ ----- Infty -----\ntemplate <typename T>\nconstexpr T Infty() { return numeric_limits<T>::max(); }\ntemplate <typename T>\nconstexpr T mInfty() { return numeric_limits<T>::min(); }\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1'000'000'000'000'010LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\n\/\/ ----- Solve -----\n\nclass Solve\n{\n\npublic:\n  Solve()\n  {\n  }\n\n  void flush()\n  {\n  }\n\nprivate:\n};\n\n\/\/ ----- main() -----\n\n\/*\nint main()\n{\n  Solve solve;\n  solve.flush();\n}\n*\/\n\nint main()\n{\n  int N;\n  cin >> N;\n  vector<cpp_int> A(N);\n  for (auto i{0}; i < N; ++i)\n  {\n    cin >> A[i];\n  }\n  cpp_int L{1};\n  for (auto i{0}; i < N; ++i)\n  {\n    L = lcm(L, A[i]);\n  }\n  mint R{static_cast<ll>(L % MOD)};\n  mint ans{0};\n  for (auto i{0}; i < N; ++i)\n  {\n    ans += R \/ static_cast<ll>(A[i]);\n  }\n  cout << ans << endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>#define DEBUG 1\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 2\/5\/2020, 2:32:20 PM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(const Mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(const Mint &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint &operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint &operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(const Mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(const Mint &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n  Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n  Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n  Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n  bool operator<(const Mint &a) const { return x < a.x; }\n  bool operator<=(const Mint &a) const { return x <= a.x; }\n  bool operator>(const Mint &a) const { return x > a.x; }\n  bool operator>=(const Mint &a) const { return x >= a.x; }\n  bool operator==(const Mint &a) const { return x == a.x; }\n  bool operator!=(const Mint &a) const { return !(*this == a); }\n  const Mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, const Mint<MOD> &rhs)\n{\n  return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, const Mint<MOD> &rhs)\n{\n  return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n  return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, const Mint<MOD> &a)\n{\n  return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2LL; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1LL; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\ntemplate <typename T>\nT gcd(T x, T y) { return y ? gcd(y, x % y) : x; }\ntemplate <typename T>\nT lcm(T x, T y) { return x \/ gcd(x, y) * y; }\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n  int ans{0};\n  while (x != 0)\n  {\n    ans += x & 1;\n    x >>= 1;\n  }\n  return ans;\n}\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\nconstexpr ll infty{1000000000000000LL};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\/\/ ----- main() -----\n\nint main()\n{\n  int N, K;\n  cin >> N >> K;\n  vector<ll> H(N + 1, 0);\n  for (auto i = 1; i <= N; ++i)\n  {\n    cin >> H[i];\n  }\n  vector<vector<ll>> DP(N + 1, vector<ll>(N - K + 1, infty));\n  DP[0][0] = 0;\n  for (auto i = 1; i <= N; ++i)\n  {\n    for (auto j = 1; j <= N - K; ++j)\n    {\n      for (auto k = 0; k < i; ++k)\n      {\n        ch_min(DP[i][j], DP[k][j - 1] + max(0LL, H[i] - H[k]));\n      }\n    }\n  }\n  ll ans{infty};\n  for (auto i = 1; i <= N; ++i)\n  {\n    ch_min(ans, DP[i][N - K]);\n  }\n  cout << ans << endl;\n}\n<commit_msg>submit F.cpp to 'F - Laminate' (abc145) [C++14 (GCC 5.4.1)]<commit_after>#define DEBUG 1\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 2\/5\/2020, 2:32:20 PM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(const Mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(const Mint &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint &operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint &operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(const Mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(const Mint &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n  Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n  Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n  Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n  bool operator<(const Mint &a) const { return x < a.x; }\n  bool operator<=(const Mint &a) const { return x <= a.x; }\n  bool operator>(const Mint &a) const { return x > a.x; }\n  bool operator>=(const Mint &a) const { return x >= a.x; }\n  bool operator==(const Mint &a) const { return x == a.x; }\n  bool operator!=(const Mint &a) const { return !(*this == a); }\n  const Mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, const Mint<MOD> &rhs)\n{\n  return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, const Mint<MOD> &rhs)\n{\n  return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n  return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, const Mint<MOD> &a)\n{\n  return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2LL; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1LL; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\ntemplate <typename T>\nT gcd(T x, T y) { return y ? gcd(y, x % y) : x; }\ntemplate <typename T>\nT lcm(T x, T y) { return x \/ gcd(x, y) * y; }\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n  int ans{0};\n  while (x != 0)\n  {\n    ans += x & 1;\n    x >>= 1;\n  }\n  return ans;\n}\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\nconstexpr ll infty{1000000000000000LL};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\/\/ ----- main() -----\n\nint main()\n{\n  int N, K;\n  cin >> N >> K;\n  vector<ll> H(N + 1, 0);\n  for (auto i = 1; i <= N; ++i)\n  {\n    cin >> H[i];\n  }\n  vector<vector<ll>> DP(N + 1, vector<ll>(N - K + 1, infty));\n  DP[0][0] = 0;\n  for (auto i = 1; i <= N; ++i)\n  {\n    for (auto j = 1; j <= N - K; ++j)\n    {\n      for (auto k = 0; k < i; ++k)\n      {\n        ch_min(DP[i][j], DP[k][j - 1] + max(0LL, H[i] - H[k]));\n      }\n    }\n  }\n  ll ans{infty};\n  for (auto i = 0; i <= N; ++i)\n  {\n    ch_min(ans, DP[i][N - K]);\n  }\n  cout << ans << endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>#define DEBUG 1\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 2020\/6\/23 5:42:51\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/integer\/common_factor_rt.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n#include <boost\/rational.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::integer::gcd; \/\/ for C++14 or for cpp_int\nusing boost::integer::lcm; \/\/ for C++14 or for cpp_int\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ld = long double;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1'000'000'007LL};\n\/\/ constexpr ll MOD{998'244'353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3'000'010LL};\n\/\/ constexpr ll MAX_SIZE{30'000'010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nbool ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n    return true;\n  }\n  return false;\n}\ntemplate <typename T>\nbool ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n    return true;\n  }\n  return false;\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(Mint const &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(Mint const &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(Mint const &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(Mint const &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(Mint const &a) const { return Mint(*this) += a; }\n  Mint operator-(Mint const &a) const { return Mint(*this) -= a; }\n  Mint operator*(Mint const &a) const { return Mint(*this) *= a; }\n  Mint operator\/(Mint const &a) const { return Mint(*this) \/= a; }\n  bool operator<(Mint const &a) const { return x < a.x; }\n  bool operator<=(Mint const &a) const { return x <= a.x; }\n  bool operator>(Mint const &a) const { return x > a.x; }\n  bool operator>=(Mint const &a) const { return x >= a.x; }\n  bool operator==(Mint const &a) const { return x == a.x; }\n  bool operator!=(Mint const &a) const { return !(*this == a); }\n  Mint power(ll N) const\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, Mint<MOD> const &rhs) { return rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, Mint<MOD> const &rhs) { return -rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, Mint<MOD> const &rhs) { return rhs * lhs; }\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, Mint<MOD> const &rhs) { return Mint<MOD>{lhs} \/ rhs; }\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a) { return stream >> a.x; }\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, Mint<MOD> const &a) { return stream << a.x; }\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i{2LL}; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i{1LL}; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\n\/\/ ----- for C++17 -----\ntemplate <typename T, typename enable_if<is_integral<T>::value>::type * = nullptr>\nsize_t popcount(T x) { return bitset<64>(x).count(); }\nsize_t popcount(string const &S) { return bitset<200010>{S}.count(); }\n\/\/ ----- Infty -----\ntemplate <typename T>\nconstexpr T Infty() { return numeric_limits<T>::max(); }\ntemplate <typename T>\nconstexpr T mInfty() { return numeric_limits<T>::min(); }\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1'000'000'000'000'010LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\n\/\/ ----- ReadGraph -----\n\/\/ Referring to ymatsux-san's source code: https:\/\/atcoder.jp\/contests\/abc138\/submissions\/7016619\n\nstruct Edge\n{\n  int src, dst, id, rev;\n  \/\/ ll cost;\n  Edge() {}\n  Edge(int src, int dst, int id, int rev) : src{src}, dst{dst}, id{id}, rev{rev} {}\n\n  void added_edge(vector<vector<Edge>> &V)\n  {\n    V[src].push_back(*this);\n  }\n\n  void added_rev(vector<vector<Edge>> &V)\n  {\n    V[dst].push_back(rev_edge());\n  }\n\n  Edge rev_edge()\n  {\n    Edge edge{*this};\n    swap(edge.src, edge.dst);\n    swap(edge.id, edge.rev);\n    return edge;\n  }\n};\n\nenum class GraphType\n{\n  Undirected,\n  Directed,\n  RevEdge,\n};\n\ntuple<vector<vector<Edge>>, vector<Edge>> ReadGraphWithEdges(int N, int M, GraphType type = GraphType::Undirected, bool is_one_indexed = true)\n{\n  vector<vector<Edge>> V(N);\n  vector<Edge> E;\n  for (auto i = 0; i < M; ++i)\n  {\n    int v, w;\n    cin >> v >> w;\n    if (is_one_indexed)\n    {\n      --v;\n      --w;\n    }\n    switch (type)\n    {\n    case GraphType::Undirected:\n    {\n      Edge edge{v, w, static_cast<int>(E.size()), static_cast<int>(E.size())};\n      edge.added_edge(V);\n      edge.added_rev(V);\n      E.push_back(edge);\n      break;\n    }\n    case GraphType::Directed:\n    {\n      Edge edge{v, w, static_cast<int>(E.size()), static_cast<int>(E.size())};\n      edge.added_edge(V);\n      E.push_back(edge);\n      break;\n    }\n    case GraphType::RevEdge:\n    {\n      Edge edge{v, w, static_cast<int>(E.size()), static_cast<int>(E.size()) + 1};\n      edge.added_edge(V);\n      edge.added_rev(V);\n      E.push_back(edge);\n      E.push_back(edge.rev_edge());\n      break;\n    }\n    default:\n      break;\n    }\n  }\n  return make_tuple(V, E);\n}\n\nvector<vector<Edge>> ReadGraph(int N, int M, GraphType type = GraphType::Undirected, bool is_one_indexed = true)\n{\n  return get<0>(ReadGraphWithEdges(N, M, type, is_one_indexed));\n}\n\ntuple<vector<vector<Edge>>, vector<Edge>> ReadTreeWithEdges(int N, GraphType type = GraphType::Undirected, bool is_one_indexed = true)\n{\n  return ReadGraphWithEdges(N, N - 1, type, is_one_indexed);\n}\n\nvector<vector<Edge>> ReadTree(int N, GraphType type = GraphType::Undirected, bool is_one_indexed = true)\n{\n  return ReadGraph(N, N - 1, type, is_one_indexed);\n}\n\n\/\/ ----- Solve -----\n\nstruct SubTree\n{\n  ll id, size;\n};\n\nclass Solve\n{\n  ll N, id;\n  vector<queue<SubTree>> Q;\n  vector<ll> C;\n  vector<vector<Edge>> V;\n  vector<vector<ll>> S;\n  vector<ll> color_to_count;\n\npublic:\n  Solve(ll N) : N{N}, id{0}, Q(N), C(N), S(N), color_to_count(N, 0)\n  {\n    for (auto i{0}; i < N; ++i)\n    {\n      cin >> C[i];\n      C[i]--;\n      color_to_count[C[i]]++;\n    }\n    V = ReadTree(N);\n  }\n\n  void flush()\n  {\n    dfs();\n    for (auto i{0}; i < N; ++i)\n    {\n      auto sum{accumulate(S[i].begin(), S[i].end(), 0)};\n      S[i].push_back(N - sum - color_to_count[i]);\n      ll ans{0};\n      for (auto e : S[i])\n      {\n        ans += e * (e + 1) \/ 2;\n      }\n#if DEBUG == 1\n      cerr << \"S[\" << i << \"] : \";\n      for (auto e : S[i])\n      {\n        cerr << e << \", \";\n      }\n      cerr << endl;\n#endif\n      cout << N * (N + 1) \/ 2 - ans << endl;\n    }\n  }\n\nprivate:\n  ll dfs(ll src = 0, ll parent = -1)\n  {\n    auto src_id{id++};\n    auto &subtree_queue{Q[C[src]]};\n    for (auto const &e : V[src])\n    {\n      if (e.dst == parent)\n      {\n        continue;\n      }\n#if DEBUG == 1\n      cerr << \"e.dst = \" << e.dst << endl;\n#endif\n      auto colorless_tree_size{dfs(e.dst, src)};\n      while (!subtree_queue.empty() && subtree_queue.front().id > src_id)\n      {\n        colorless_tree_size -= subtree_queue.front().size;\n        subtree_queue.pop();\n      }\n      S[C[src]].push_back(colorless_tree_size);\n    }\n    auto subtree_size{id - src_id};\n    subtree_queue.push(SubTree{src_id, subtree_size});\n    return subtree_size;\n  }\n};\n\n\/\/ ----- main() -----\n\nint main()\n{\n  ll N;\n  cin >> N;\n  Solve solve(N);\n  solve.flush();\n}\n<commit_msg>tried F.cpp to 'F'<commit_after>#define DEBUG 1\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 2020\/6\/23 5:42:51\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/integer\/common_factor_rt.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n#include <boost\/rational.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::integer::gcd; \/\/ for C++14 or for cpp_int\nusing boost::integer::lcm; \/\/ for C++14 or for cpp_int\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ld = long double;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1'000'000'007LL};\n\/\/ constexpr ll MOD{998'244'353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3'000'010LL};\n\/\/ constexpr ll MAX_SIZE{30'000'010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nbool ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n    return true;\n  }\n  return false;\n}\ntemplate <typename T>\nbool ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n    return true;\n  }\n  return false;\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(Mint const &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(Mint const &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(Mint const &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(Mint const &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(Mint const &a) const { return Mint(*this) += a; }\n  Mint operator-(Mint const &a) const { return Mint(*this) -= a; }\n  Mint operator*(Mint const &a) const { return Mint(*this) *= a; }\n  Mint operator\/(Mint const &a) const { return Mint(*this) \/= a; }\n  bool operator<(Mint const &a) const { return x < a.x; }\n  bool operator<=(Mint const &a) const { return x <= a.x; }\n  bool operator>(Mint const &a) const { return x > a.x; }\n  bool operator>=(Mint const &a) const { return x >= a.x; }\n  bool operator==(Mint const &a) const { return x == a.x; }\n  bool operator!=(Mint const &a) const { return !(*this == a); }\n  Mint power(ll N) const\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, Mint<MOD> const &rhs) { return rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, Mint<MOD> const &rhs) { return -rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, Mint<MOD> const &rhs) { return rhs * lhs; }\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, Mint<MOD> const &rhs) { return Mint<MOD>{lhs} \/ rhs; }\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a) { return stream >> a.x; }\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, Mint<MOD> const &a) { return stream << a.x; }\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i{2LL}; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i{1LL}; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\n\/\/ ----- for C++17 -----\ntemplate <typename T, typename enable_if<is_integral<T>::value>::type * = nullptr>\nsize_t popcount(T x) { return bitset<64>(x).count(); }\nsize_t popcount(string const &S) { return bitset<200010>{S}.count(); }\n\/\/ ----- Infty -----\ntemplate <typename T>\nconstexpr T Infty() { return numeric_limits<T>::max(); }\ntemplate <typename T>\nconstexpr T mInfty() { return numeric_limits<T>::min(); }\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1'000'000'000'000'010LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\n\/\/ ----- ReadGraph -----\n\/\/ Referring to ymatsux-san's source code: https:\/\/atcoder.jp\/contests\/abc138\/submissions\/7016619\n\nstruct Edge\n{\n  int src, dst, id, rev;\n  \/\/ ll cost;\n  Edge() {}\n  Edge(int src, int dst, int id, int rev) : src{src}, dst{dst}, id{id}, rev{rev} {}\n\n  void added_edge(vector<vector<Edge>> &V)\n  {\n    V[src].push_back(*this);\n  }\n\n  void added_rev(vector<vector<Edge>> &V)\n  {\n    V[dst].push_back(rev_edge());\n  }\n\n  Edge rev_edge()\n  {\n    Edge edge{*this};\n    swap(edge.src, edge.dst);\n    swap(edge.id, edge.rev);\n    return edge;\n  }\n};\n\nenum class GraphType\n{\n  Undirected,\n  Directed,\n  RevEdge,\n};\n\ntuple<vector<vector<Edge>>, vector<Edge>> ReadGraphWithEdges(int N, int M, GraphType type = GraphType::Undirected, bool is_one_indexed = true)\n{\n  vector<vector<Edge>> V(N);\n  vector<Edge> E;\n  for (auto i = 0; i < M; ++i)\n  {\n    int v, w;\n    cin >> v >> w;\n    if (is_one_indexed)\n    {\n      --v;\n      --w;\n    }\n    switch (type)\n    {\n    case GraphType::Undirected:\n    {\n      Edge edge{v, w, static_cast<int>(E.size()), static_cast<int>(E.size())};\n      edge.added_edge(V);\n      edge.added_rev(V);\n      E.push_back(edge);\n      break;\n    }\n    case GraphType::Directed:\n    {\n      Edge edge{v, w, static_cast<int>(E.size()), static_cast<int>(E.size())};\n      edge.added_edge(V);\n      E.push_back(edge);\n      break;\n    }\n    case GraphType::RevEdge:\n    {\n      Edge edge{v, w, static_cast<int>(E.size()), static_cast<int>(E.size()) + 1};\n      edge.added_edge(V);\n      edge.added_rev(V);\n      E.push_back(edge);\n      E.push_back(edge.rev_edge());\n      break;\n    }\n    default:\n      break;\n    }\n  }\n  return make_tuple(V, E);\n}\n\nvector<vector<Edge>> ReadGraph(int N, int M, GraphType type = GraphType::Undirected, bool is_one_indexed = true)\n{\n  return get<0>(ReadGraphWithEdges(N, M, type, is_one_indexed));\n}\n\ntuple<vector<vector<Edge>>, vector<Edge>> ReadTreeWithEdges(int N, GraphType type = GraphType::Undirected, bool is_one_indexed = true)\n{\n  return ReadGraphWithEdges(N, N - 1, type, is_one_indexed);\n}\n\nvector<vector<Edge>> ReadTree(int N, GraphType type = GraphType::Undirected, bool is_one_indexed = true)\n{\n  return ReadGraph(N, N - 1, type, is_one_indexed);\n}\n\n\/\/ ----- Solve -----\n\nstruct SubTree\n{\n  ll id, size;\n};\n\nclass Solve\n{\n  ll N, id;\n  vector<queue<SubTree>> Q;\n  vector<ll> C;\n  vector<vector<Edge>> V;\n  vector<vector<ll>> S;\n  vector<ll> color_to_count;\n\npublic:\n  Solve(ll N) : N{N}, id{0}, Q(N), C(N), S(N), color_to_count(N, 0)\n  {\n    for (auto i{0}; i < N; ++i)\n    {\n      cin >> C[i];\n      C[i]--;\n      color_to_count[C[i]]++;\n    }\n    V = ReadTree(N);\n  }\n\n  void flush()\n  {\n    dfs();\n#if DEBUG == 1\n    cerr << \"Here\" << endl;\n#endif\n    for (auto i{0}; i < N; ++i)\n    {\n      auto sum{accumulate(S[i].begin(), S[i].end(), 0)};\n      S[i].push_back(N - sum - color_to_count[i]);\n      ll ans{0};\n      for (auto e : S[i])\n      {\n        ans += e * (e + 1) \/ 2;\n      }\n#if DEBUG == 1\n      cerr << \"S[\" << i << \"] : \";\n      for (auto e : S[i])\n      {\n        cerr << e << \", \";\n      }\n      cerr << endl;\n#endif\n      cout << N * (N + 1) \/ 2 - ans << endl;\n    }\n  }\n\nprivate:\n  ll dfs(ll src = 0, ll parent = -1)\n  {\n    auto src_id{id++};\n    auto &subtree_queue{Q[C[src]]};\n    for (auto const &e : V[src])\n    {\n      if (e.dst == parent)\n      {\n        continue;\n      }\n      auto colorless_tree_size{dfs(e.dst, src)};\n      while (!subtree_queue.empty() && subtree_queue.front().id > src_id)\n      {\n        colorless_tree_size -= subtree_queue.front().size;\n        subtree_queue.pop();\n      }\n      S[C[src]].push_back(colorless_tree_size);\n    }\n    auto subtree_size{id - src_id};\n    subtree_queue.push(SubTree{src_id, subtree_size});\n    return subtree_size;\n  }\n};\n\n\/\/ ----- main() -----\n\nint main()\n{\n  ll N;\n  cin >> N;\n  Solve solve(N);\n  solve.flush();\n}\n<|endoftext|>"}
{"text":"<commit_before>#define DEBUG 1\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 2020\/6\/23 5:42:51\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/integer\/common_factor_rt.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n#include <boost\/rational.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::integer::gcd; \/\/ for C++14 or for cpp_int\nusing boost::integer::lcm; \/\/ for C++14 or for cpp_int\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ld = long double;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1'000'000'007LL};\n\/\/ constexpr ll MOD{998'244'353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3'000'010LL};\n\/\/ constexpr ll MAX_SIZE{30'000'010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nbool ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n    return true;\n  }\n  return false;\n}\ntemplate <typename T>\nbool ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n    return true;\n  }\n  return false;\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(Mint const &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(Mint const &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(Mint const &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(Mint const &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(Mint const &a) const { return Mint(*this) += a; }\n  Mint operator-(Mint const &a) const { return Mint(*this) -= a; }\n  Mint operator*(Mint const &a) const { return Mint(*this) *= a; }\n  Mint operator\/(Mint const &a) const { return Mint(*this) \/= a; }\n  bool operator<(Mint const &a) const { return x < a.x; }\n  bool operator<=(Mint const &a) const { return x <= a.x; }\n  bool operator>(Mint const &a) const { return x > a.x; }\n  bool operator>=(Mint const &a) const { return x >= a.x; }\n  bool operator==(Mint const &a) const { return x == a.x; }\n  bool operator!=(Mint const &a) const { return !(*this == a); }\n  Mint power(ll N) const\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, Mint<MOD> const &rhs) { return rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, Mint<MOD> const &rhs) { return -rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, Mint<MOD> const &rhs) { return rhs * lhs; }\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, Mint<MOD> const &rhs) { return Mint<MOD>{lhs} \/ rhs; }\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a) { return stream >> a.x; }\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, Mint<MOD> const &a) { return stream << a.x; }\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i{2LL}; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i{1LL}; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\n\/\/ ----- for C++17 -----\ntemplate <typename T, typename enable_if<is_integral<T>::value>::type * = nullptr>\nsize_t popcount(T x) { return bitset<64>(x).count(); }\nsize_t popcount(string const &S) { return bitset<200010>{S}.count(); }\n\/\/ ----- Infty -----\ntemplate <typename T>\nconstexpr T Infty() { return numeric_limits<T>::max(); }\ntemplate <typename T>\nconstexpr T mInfty() { return numeric_limits<T>::min(); }\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1'000'000'000'000'010LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\n\/\/ ----- ReadGraph -----\n\/\/ Referring to ymatsux-san's source code: https:\/\/atcoder.jp\/contests\/abc138\/submissions\/7016619\n\nstruct Edge\n{\n  int src, dst, id, rev;\n  \/\/ ll cost;\n  Edge() {}\n  Edge(int src, int dst, int id, int rev) : src{src}, dst{dst}, id{id}, rev{rev} {}\n\n  void added_edge(vector<vector<Edge>> &V)\n  {\n    V[src].push_back(*this);\n  }\n\n  void added_rev(vector<vector<Edge>> &V)\n  {\n    V[dst].push_back(rev_edge());\n  }\n\n  Edge rev_edge()\n  {\n    Edge edge{*this};\n    swap(edge.src, edge.dst);\n    swap(edge.id, edge.rev);\n    return edge;\n  }\n};\n\nenum class GraphType\n{\n  Undirected,\n  Directed,\n  RevEdge,\n};\n\ntuple<vector<vector<Edge>>, vector<Edge>> ReadGraphWithEdges(int N, int M, GraphType type = GraphType::Undirected, bool is_one_indexed = true)\n{\n  vector<vector<Edge>> V(N);\n  vector<Edge> E;\n  for (auto i = 0; i < M; ++i)\n  {\n    int v, w;\n    cin >> v >> w;\n    if (is_one_indexed)\n    {\n      --v;\n      --w;\n    }\n    switch (type)\n    {\n    case GraphType::Undirected:\n    {\n      Edge edge{v, w, static_cast<int>(E.size()), static_cast<int>(E.size())};\n      edge.added_edge(V);\n      edge.added_rev(V);\n      E.push_back(edge);\n      break;\n    }\n    case GraphType::Directed:\n    {\n      Edge edge{v, w, static_cast<int>(E.size()), static_cast<int>(E.size())};\n      edge.added_edge(V);\n      E.push_back(edge);\n      break;\n    }\n    case GraphType::RevEdge:\n    {\n      Edge edge{v, w, static_cast<int>(E.size()), static_cast<int>(E.size()) + 1};\n      edge.added_edge(V);\n      edge.added_rev(V);\n      E.push_back(edge);\n      E.push_back(edge.rev_edge());\n      break;\n    }\n    default:\n      break;\n    }\n  }\n  return make_tuple(V, E);\n}\n\nvector<vector<Edge>> ReadGraph(int N, int M, GraphType type = GraphType::Undirected, bool is_one_indexed = true)\n{\n  return get<0>(ReadGraphWithEdges(N, M, type, is_one_indexed));\n}\n\ntuple<vector<vector<Edge>>, vector<Edge>> ReadTreeWithEdges(int N, GraphType type = GraphType::Undirected, bool is_one_indexed = true)\n{\n  return ReadGraphWithEdges(N, N - 1, type, is_one_indexed);\n}\n\nvector<vector<Edge>> ReadTree(int N, GraphType type = GraphType::Undirected, bool is_one_indexed = true)\n{\n  return ReadGraph(N, N - 1, type, is_one_indexed);\n}\n\n\/\/ ----- Solve -----\n\nchrono::system_clock::time_point time_start = chrono::system_clock::now();\n\nvoid TimeStamp()\n{\n  cout << \"Time: \" << chrono::duration_cast<std::chrono::milliseconds>(chrono::system_clock::now() - time_start).count() << endl;\n}\n\nstruct SubTree\n{\n  ll id, size;\n};\n\nclass Solve\n{\n  ll N, id;\n  vector<queue<SubTree>> Q;\n  vector<ll> C;\n  vector<vector<Edge>> V;\n  vector<vector<ll>> S;\n  vector<ll> color_to_count;\n\npublic:\n  Solve(ll N) : N{N}, id{0}, Q(N), C(N), S(N), color_to_count(N, 0)\n  {\n    TimeStamp();\n    for (auto i{0}; i < N; ++i)\n    {\n      cin >> C[i];\n      C[i]--;\n      color_to_count[C[i]]++;\n    }\n    V = ReadTree(N);\n  }\n\n  void flush()\n  {\n    dfs();\n    for (auto i{0}; i < N; ++i)\n    {\n      auto sum{accumulate(S[i].begin(), S[i].end(), 0)};\n      S[i].push_back(N - sum - color_to_count[i]);\n      ll ans{0};\n      for (auto e : S[i])\n      {\n        ans += e * (e + 1) \/ 2;\n      }\n#if DEBUG == 1\n      cerr << \"S[\" << i << \"] : \";\n      for (auto e : S[i])\n      {\n        cerr << e << \", \";\n      }\n      cerr << endl;\n#endif\n      cout << N * (N + 1) \/ 2 - ans << endl;\n    }\n  }\n\nprivate:\n  ll dfs(ll src = 0, ll parent = -1)\n  {\n#if DEBUG == 1\n    cout << \"src = \" << src << endl;\n#endif\n    auto src_id{id++};\n#if DEBUG == 1\n    cout << \"src_id = \" << src_id << endl;\n#endif\n    auto &subtree_queue{Q[C[src]]};\n    for (auto const &e : V[src])\n    {\n#if DEBUG == 1\n      cout << \"e.dst = \" << e.dst << endl;\n#endif\n      if (e.dst == parent)\n      {\n        continue;\n      }\n      auto colorless_tree_size{dfs(e.dst, src)};\n      while (!subtree_queue.empty() && subtree_queue.front().id > src_id)\n      {\n        colorless_tree_size -= subtree_queue.front().size;\n        subtree_queue.pop();\n      }\n      S[C[src]].push_back(colorless_tree_size);\n    }\n    auto subtree_size{id - src_id};\n    subtree_queue.push(SubTree{src_id, subtree_size});\n    return subtree_size;\n  }\n};\n\n\/\/ ----- main() -----\n\nint main()\n{\n  ll N;\n  cin >> N;\n  Solve solve(N);\n  solve.flush();\n}\n<commit_msg>tried F.cpp to 'F'<commit_after>#define DEBUG 1\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 2020\/6\/23 5:42:51\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/integer\/common_factor_rt.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n#include <boost\/rational.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::integer::gcd; \/\/ for C++14 or for cpp_int\nusing boost::integer::lcm; \/\/ for C++14 or for cpp_int\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ld = long double;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1'000'000'007LL};\n\/\/ constexpr ll MOD{998'244'353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3'000'010LL};\n\/\/ constexpr ll MAX_SIZE{30'000'010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nbool ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n    return true;\n  }\n  return false;\n}\ntemplate <typename T>\nbool ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n    return true;\n  }\n  return false;\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(Mint const &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(Mint const &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(Mint const &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(Mint const &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(Mint const &a) const { return Mint(*this) += a; }\n  Mint operator-(Mint const &a) const { return Mint(*this) -= a; }\n  Mint operator*(Mint const &a) const { return Mint(*this) *= a; }\n  Mint operator\/(Mint const &a) const { return Mint(*this) \/= a; }\n  bool operator<(Mint const &a) const { return x < a.x; }\n  bool operator<=(Mint const &a) const { return x <= a.x; }\n  bool operator>(Mint const &a) const { return x > a.x; }\n  bool operator>=(Mint const &a) const { return x >= a.x; }\n  bool operator==(Mint const &a) const { return x == a.x; }\n  bool operator!=(Mint const &a) const { return !(*this == a); }\n  Mint power(ll N) const\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, Mint<MOD> const &rhs) { return rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, Mint<MOD> const &rhs) { return -rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, Mint<MOD> const &rhs) { return rhs * lhs; }\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, Mint<MOD> const &rhs) { return Mint<MOD>{lhs} \/ rhs; }\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a) { return stream >> a.x; }\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, Mint<MOD> const &a) { return stream << a.x; }\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i{2LL}; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i{1LL}; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\n\/\/ ----- for C++17 -----\ntemplate <typename T, typename enable_if<is_integral<T>::value>::type * = nullptr>\nsize_t popcount(T x) { return bitset<64>(x).count(); }\nsize_t popcount(string const &S) { return bitset<200010>{S}.count(); }\n\/\/ ----- Infty -----\ntemplate <typename T>\nconstexpr T Infty() { return numeric_limits<T>::max(); }\ntemplate <typename T>\nconstexpr T mInfty() { return numeric_limits<T>::min(); }\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1'000'000'000'000'010LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\n\/\/ ----- ReadGraph -----\n\/\/ Referring to ymatsux-san's source code: https:\/\/atcoder.jp\/contests\/abc138\/submissions\/7016619\n\nstruct Edge\n{\n  int src, dst, id, rev;\n  \/\/ ll cost;\n  Edge() {}\n  Edge(int src, int dst, int id, int rev) : src{src}, dst{dst}, id{id}, rev{rev} {}\n\n  void added_edge(vector<vector<Edge>> &V)\n  {\n    V[src].push_back(*this);\n  }\n\n  void added_rev(vector<vector<Edge>> &V)\n  {\n    V[dst].push_back(rev_edge());\n  }\n\n  Edge rev_edge()\n  {\n    Edge edge{*this};\n    swap(edge.src, edge.dst);\n    swap(edge.id, edge.rev);\n    return edge;\n  }\n};\n\nenum class GraphType\n{\n  Undirected,\n  Directed,\n  RevEdge,\n};\n\ntuple<vector<vector<Edge>>, vector<Edge>> ReadGraphWithEdges(int N, int M, GraphType type = GraphType::Undirected, bool is_one_indexed = true)\n{\n  vector<vector<Edge>> V(N);\n  vector<Edge> E;\n  for (auto i = 0; i < M; ++i)\n  {\n    int v, w;\n    cin >> v >> w;\n    if (is_one_indexed)\n    {\n      --v;\n      --w;\n    }\n    switch (type)\n    {\n    case GraphType::Undirected:\n    {\n      Edge edge{v, w, static_cast<int>(E.size()), static_cast<int>(E.size())};\n      edge.added_edge(V);\n      edge.added_rev(V);\n      E.push_back(edge);\n      break;\n    }\n    case GraphType::Directed:\n    {\n      Edge edge{v, w, static_cast<int>(E.size()), static_cast<int>(E.size())};\n      edge.added_edge(V);\n      E.push_back(edge);\n      break;\n    }\n    case GraphType::RevEdge:\n    {\n      Edge edge{v, w, static_cast<int>(E.size()), static_cast<int>(E.size()) + 1};\n      edge.added_edge(V);\n      edge.added_rev(V);\n      E.push_back(edge);\n      E.push_back(edge.rev_edge());\n      break;\n    }\n    default:\n      break;\n    }\n  }\n  return make_tuple(V, E);\n}\n\nvector<vector<Edge>> ReadGraph(int N, int M, GraphType type = GraphType::Undirected, bool is_one_indexed = true)\n{\n  return get<0>(ReadGraphWithEdges(N, M, type, is_one_indexed));\n}\n\ntuple<vector<vector<Edge>>, vector<Edge>> ReadTreeWithEdges(int N, GraphType type = GraphType::Undirected, bool is_one_indexed = true)\n{\n  return ReadGraphWithEdges(N, N - 1, type, is_one_indexed);\n}\n\nvector<vector<Edge>> ReadTree(int N, GraphType type = GraphType::Undirected, bool is_one_indexed = true)\n{\n  return ReadGraph(N, N - 1, type, is_one_indexed);\n}\n\n\/\/ ----- Solve -----\n\nchrono::system_clock::time_point time_start = chrono::system_clock::now();\n\nvoid TimeStamp()\n{\n  cout << \"Time: \" << chrono::duration_cast<std::chrono::milliseconds>(chrono::system_clock::now() - time_start).count() << endl;\n}\n\nstruct SubTree\n{\n  ll id, size;\n};\n\nclass Solve\n{\n  ll N, id;\n  vector<queue<SubTree>> Q;\n  vector<ll> C;\n  vector<vector<Edge>> V;\n  vector<vector<ll>> S;\n  vector<ll> color_to_count;\n\npublic:\n  Solve(ll N) : N{N}, id{0}, Q(N), C(N), S(N), color_to_count(N, 0)\n  {\n    TimeStamp();\n    for (auto i{0}; i < N; ++i)\n    {\n      cin >> C[i];\n      C[i]--;\n      color_to_count[C[i]]++;\n    }\n    V = ReadTree(N);\n  }\n\n  void flush()\n  {\n    dfs();\n    for (auto i{0}; i < N; ++i)\n    {\n      auto sum{accumulate(S[i].begin(), S[i].end(), 0)};\n      S[i].push_back(N - sum - color_to_count[i]);\n      ll ans{0};\n      for (auto e : S[i])\n      {\n        ans += e * (e + 1) \/ 2;\n      }\n#if DEBUG == 1\n      cerr << \"S[\" << i << \"] : \";\n      for (auto e : S[i])\n      {\n        cerr << e << \", \";\n      }\n      cerr << endl;\n#endif\n      cout << N * (N + 1) \/ 2 - ans << endl;\n    }\n  }\n\nprivate:\n  ll dfs(ll src = 0, ll parent = -1)\n  {\n#if DEBUG == 1\n    cout << \"src = \" << src << endl;\n#endif\n    auto src_id{id++};\n#if DEBUG == 1\n    cout << \"src_id = \" << src_id << endl;\n#endif\n    auto &subtree_queue{Q[C[src]]};\n    for (auto const &e : V[src])\n    {\n#if DEBUG == 1\n      cout << \"e.dst = \" << e.dst << endl;\n#endif\n      if (e.dst == parent)\n      {\n        continue;\n      }\n#if DEBUG == 1\n      cout << \"e.dst = \" << e.dst << endl;\n#endif\n      auto colorless_tree_size{dfs(e.dst, src)};\n      while (!subtree_queue.empty() && subtree_queue.front().id > src_id)\n      {\n        colorless_tree_size -= subtree_queue.front().size;\n        subtree_queue.pop();\n      }\n      S[C[src]].push_back(colorless_tree_size);\n    }\n    auto subtree_size{id - src_id};\n    subtree_queue.push(SubTree{src_id, subtree_size});\n    return subtree_size;\n  }\n};\n\n\/\/ ----- main() -----\n\nint main()\n{\n  ll N;\n  cin >> N;\n  Solve solve(N);\n  solve.flush();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"VolumeOSD.h\"\n\n#include <Shlwapi.h>\n#include <string>\n\n#include \"..\\HotkeyInfo.h\"\n#include \"..\\Monitor.h\"\n#include \"..\\Skin.h\"\n#include \"..\\Slider\\VolumeSlider.h\"\n\n#define MENU_SETTINGS 0\n#define MENU_MIXER 1\n#define MENU_EXIT 2\n#define MENU_DEVICE 0xF000\n\nVolumeOSD::VolumeOSD() :\nOSD(L\"3RVX-VolumeDispatcher\"),\n_mWnd(L\"3RVX-MasterVolumeOSD\", L\"3RVX-MasterVolumeOSD\"),\n_muteWnd(L\"3RVX-MasterMuteOSD\", L\"3RVX-MasterMuteOSD\")\n{\n    LoadSkin();\n\n    \/* Start the volume controller *\/\n    _volumeCtrl = new CoreAudio(_hWnd);\n    std::wstring device = Settings::Instance()->AudioDeviceID();\n    _volumeCtrl->Init(device);\n    _selectedDesc = _volumeCtrl->DeviceDesc();\n\n    \/* Create the slider *\/\n    _volumeSlider = new VolumeSlider(*_volumeCtrl);\n\n    \/* Set up context menu *\/\n    _menu = CreatePopupMenu();\n    _deviceMenu = CreatePopupMenu();\n\n    InsertMenu(_menu, -1, MF_ENABLED, MENU_SETTINGS, L\"Settings\");\n    InsertMenu(_menu, -1, MF_POPUP, UINT(_deviceMenu), L\"Audio Device\");\n    InsertMenu(_menu, -1, MF_ENABLED, MENU_MIXER, L\"Mixer\");\n    InsertMenu(_menu, -1, MF_ENABLED, MENU_EXIT, L\"Exit\");\n\n    _menuFlags = TPM_RIGHTBUTTON;\n    if (GetSystemMetrics(SM_MENUDROPALIGNMENT) != 0) {\n        _menuFlags |= TPM_RIGHTALIGN;\n    } else {\n        _menuFlags |= TPM_LEFTALIGN;\n    }\n\n    UpdateDeviceMenu();\n\n    Settings *settings = Settings::Instance();\n    FadeOut *fOut = new FadeOut();\n    _mWnd.HideAnimation(fOut);\n    _mWnd.VisibleDuration(settings->HideDelay());\n    _muteWnd.HideAnimation(fOut);\n    _muteWnd.VisibleDuration(settings->HideDelay());\n\n    UpdateIcon();\n    float v = _volumeCtrl->Volume();\n    MeterLevels(v);\n    _volumeSlider->MeterLevels(v);\n\n    \/* TODO: check whether we should show the OSD on startup or not. If so, post\n     * a MSG_VOL_CHNG so that the volume level (or mute) is displayed: *\/\n    SendMessage(_hWnd, MSG_VOL_CHNG, NULL, NULL);\n}\n\nVolumeOSD::~VolumeOSD() {\n\n    \/* DestroyIcon() *\/\n}\n\nvoid VolumeOSD::UpdateDeviceMenu() {\n    \/* Remove any devices currently in the menu first *\/\n    for (unsigned int i = 0; i < _deviceList.size(); ++i) {\n        RemoveMenu(_deviceMenu, 0, MF_BYPOSITION);\n    }\n    _deviceList.clear();\n\n    std::list<VolumeController::DeviceInfo> devices\n        = _volumeCtrl->ListDevices();\n    std::wstring currentDeviceId = _volumeCtrl->DeviceId();\n\n    int menuItem = MENU_DEVICE;\n    for (VolumeController::DeviceInfo device : devices) {\n        unsigned int flags = MF_ENABLED;\n        if (currentDeviceId == device.id) {\n            flags |= MF_CHECKED;\n        }\n\n        InsertMenu(_deviceMenu, -1, flags, menuItem++, device.name.c_str());\n        _deviceList.push_back(device);\n    }\n}\n\nvoid VolumeOSD::LoadSkin() {\n    Skin *skin = Settings::Instance()->CurrentSkin();\n\n    Gdiplus::Bitmap *bg = skin->OSDBgImg(\"volume\");\n    _mWnd.BackgroundImage(bg);\n\n    std::list<Meter*> meters = skin->VolumeMeters();\n    for (Meter *m : meters) {\n        _mWnd.AddMeter(m);\n    }\n\n    \/* Default volume increment *\/\n    _defaultIncrement = (float) (10000 \/ skin->DefaultVolumeUnits()) \/ 10000.0f;\n    CLOG(L\"Default volume increment: %f\", _defaultIncrement);\n\n    HMONITOR monitor = Monitor::Primary();\n\n    _mWnd.Update();\n    PositionWindow(monitor, _mWnd);\n\n    _muteBg = skin->OSDBgImg(\"mute\");\n    _muteWnd.BackgroundImage(_muteBg);\n    _muteWnd.Update();\n    PositionWindow(monitor, _muteWnd);\n\n    \/* Set up notification icon *\/\n    _iconImages = skin->Iconset(\"volume\");\n    if (_iconImages.size() > 0) {\n        _icon = new NotifyIcon(_hWnd, L\"3RVX\", _iconImages[0]);\n    }\n}\n\nvoid VolumeOSD::MeterLevels(float level) {\n    _mWnd.MeterLevels(level);\n    _mWnd.Update();\n}\n\nvoid VolumeOSD::Hide() {\n    _mWnd.Hide(false);\n    _muteWnd.Hide(false);\n}\n\nvoid VolumeOSD::HideIcon() {\n    delete _icon;\n}\n\nvoid VolumeOSD::UpdateIcon() {\n    UpdateIconImage();\n    UpdateIconTip();\n}\n\nvoid VolumeOSD::UpdateIconImage() {\n    if (_icon == NULL) {\n        return;\n    }\n\n    int icon = 0;\n    if (_volumeCtrl->Muted() == false) {\n        int vUnits = _iconImages.size() - 1;\n        icon = (int) ceil(_volumeCtrl->Volume() * vUnits);\n    }\n\n    if (icon != _lastIcon) {\n        _icon->UpdateIcon(_iconImages[icon]);\n        _lastIcon = icon;\n    }\n}\n\nvoid VolumeOSD::UpdateIconTip() {\n    if (_icon == NULL) {\n        return;\n    }\n\n    if (_volumeCtrl->Muted()) {\n        _icon->UpdateToolTip(_selectedDesc + L\": Muted\");\n    } else {\n        float v = _volumeCtrl->Volume();\n        std::wstring perc = std::to_wstring((int) (v * 100.0f));\n        std::wstring level = _selectedDesc + L\": \" + perc + L\"%\";\n        _icon->UpdateToolTip(level);\n    }\n}\n\nvoid VolumeOSD::ProcessHotkeys(HotkeyInfo &hki) {\n    float currentVol = _volumeCtrl->Volume();\n    switch (hki.action) {\n    case HotkeyInfo::IncreaseVolume:\n        _volumeCtrl->Volume(currentVol + _defaultIncrement);\n        SendMessage(_hWnd, MSG_VOL_CHNG, NULL, NULL);\n        break;\n\n    case HotkeyInfo::DecreaseVolume:\n        _volumeCtrl->Volume(currentVol - _defaultIncrement);\n        SendMessage(_hWnd, MSG_VOL_CHNG, NULL, NULL);\n        break;\n\n    case HotkeyInfo::Mute:\n        _volumeCtrl->ToggleMute();\n        break;\n    }\n}\n\nLRESULT\nVolumeOSD::WndProc(HWND hWnd, UINT message, WPARAM wParam, LPARAM lParam) {\n    if (message == MSG_VOL_CHNG) {\n        float v = _volumeCtrl->Volume();\n\n        _volumeSlider->MeterLevels(v);\n\n        if (_volumeSlider->Visible() == false) {\n            if (_volumeCtrl->Muted() || v == 0.0f) {\n                _muteWnd.Show();\n                _mWnd.Hide(false);\n            } else {\n                MeterLevels(v);\n                _mWnd.Show();\n                _muteWnd.Hide(false);\n            }\n            HideOthers(Volume);\n        }\n\n        UpdateIcon();\n    } else if (message == MSG_VOL_DEVCHNG) {\n        CLOG(L\"Volume device change detected.\");\n        if (_selectedDevice == L\"\") {\n            _volumeCtrl->SelectDefaultDevice();\n        } else {\n            HRESULT hr = _volumeCtrl->SelectDevice(_selectedDevice);\n            if (FAILED(hr)) {\n                _volumeCtrl->SelectDefaultDevice();\n            }\n        }\n        _selectedDesc = _volumeCtrl->DeviceDesc();\n        UpdateDeviceMenu();\n    } else if (message == MSG_NOTIFYICON) {\n        if (lParam == WM_LBUTTONUP) {\n            _volumeSlider->Show();\n        } else if (lParam == WM_RBUTTONUP) {\n            POINT p;\n            GetCursorPos(&p);\n            SetForegroundWindow(hWnd);\n            TrackPopupMenuEx(_menu, _menuFlags, p.x, p.y, _hWnd, NULL);\n            PostMessage(hWnd, WM_NULL, 0, 0);\n        }\n    } else if (message == WM_COMMAND) {\n        int menuItem = LOWORD(wParam);\n        switch (menuItem) {\n        case MENU_SETTINGS:\n            Settings::LaunchSettingsApp();\n            break;\n\n        case MENU_MIXER: {\n            CLOG(L\"Menu: Mixer\");\n            HINSTANCE code = ShellExecute(NULL, L\"open\", L\"sndvol\",\n                NULL, NULL, SW_SHOWNORMAL);\n            break;\n        }\n\n        case MENU_EXIT:\n            CLOG(L\"Menu: Exit: %d\", (int) _masterWnd);\n            SendMessage(_masterWnd, WM_CLOSE, NULL, NULL);\n            break;\n        }\n\n        \/* Device menu items *\/\n        if ((menuItem & MENU_DEVICE) > 0) {\n            int device = menuItem & 0x0FFF;\n            VolumeController::DeviceInfo selectedDev = _deviceList[device];\n            if (selectedDev.id != _volumeCtrl->DeviceId()) {\n                \/* A different device has been selected *\/\n                CLOG(L\"Changing to volume device: %s\",\n                    selectedDev.name.c_str());\n                _volumeCtrl->SelectDevice(selectedDev.id);\n                UpdateDeviceMenu();\n            }\n        }\n    }\n\n    return DefWindowProc(hWnd, message, wParam, lParam);\n}<commit_msg>Unmute volume if a volume up or down hotkey is used<commit_after>#include \"VolumeOSD.h\"\n\n#include <Shlwapi.h>\n#include <string>\n\n#include \"..\\HotkeyInfo.h\"\n#include \"..\\Monitor.h\"\n#include \"..\\Skin.h\"\n#include \"..\\Slider\\VolumeSlider.h\"\n\n#define MENU_SETTINGS 0\n#define MENU_MIXER 1\n#define MENU_EXIT 2\n#define MENU_DEVICE 0xF000\n\nVolumeOSD::VolumeOSD() :\nOSD(L\"3RVX-VolumeDispatcher\"),\n_mWnd(L\"3RVX-MasterVolumeOSD\", L\"3RVX-MasterVolumeOSD\"),\n_muteWnd(L\"3RVX-MasterMuteOSD\", L\"3RVX-MasterMuteOSD\")\n{\n    LoadSkin();\n\n    \/* Start the volume controller *\/\n    _volumeCtrl = new CoreAudio(_hWnd);\n    std::wstring device = Settings::Instance()->AudioDeviceID();\n    _volumeCtrl->Init(device);\n    _selectedDesc = _volumeCtrl->DeviceDesc();\n\n    \/* Create the slider *\/\n    _volumeSlider = new VolumeSlider(*_volumeCtrl);\n\n    \/* Set up context menu *\/\n    _menu = CreatePopupMenu();\n    _deviceMenu = CreatePopupMenu();\n\n    InsertMenu(_menu, -1, MF_ENABLED, MENU_SETTINGS, L\"Settings\");\n    InsertMenu(_menu, -1, MF_POPUP, UINT(_deviceMenu), L\"Audio Device\");\n    InsertMenu(_menu, -1, MF_ENABLED, MENU_MIXER, L\"Mixer\");\n    InsertMenu(_menu, -1, MF_ENABLED, MENU_EXIT, L\"Exit\");\n\n    _menuFlags = TPM_RIGHTBUTTON;\n    if (GetSystemMetrics(SM_MENUDROPALIGNMENT) != 0) {\n        _menuFlags |= TPM_RIGHTALIGN;\n    } else {\n        _menuFlags |= TPM_LEFTALIGN;\n    }\n\n    UpdateDeviceMenu();\n\n    Settings *settings = Settings::Instance();\n    FadeOut *fOut = new FadeOut();\n    _mWnd.HideAnimation(fOut);\n    _mWnd.VisibleDuration(settings->HideDelay());\n    _muteWnd.HideAnimation(fOut);\n    _muteWnd.VisibleDuration(settings->HideDelay());\n\n    UpdateIcon();\n    float v = _volumeCtrl->Volume();\n    MeterLevels(v);\n    _volumeSlider->MeterLevels(v);\n\n    \/* TODO: check whether we should show the OSD on startup or not. If so, post\n     * a MSG_VOL_CHNG so that the volume level (or mute) is displayed: *\/\n    SendMessage(_hWnd, MSG_VOL_CHNG, NULL, NULL);\n}\n\nVolumeOSD::~VolumeOSD() {\n\n    \/* DestroyIcon() *\/\n}\n\nvoid VolumeOSD::UpdateDeviceMenu() {\n    \/* Remove any devices currently in the menu first *\/\n    for (unsigned int i = 0; i < _deviceList.size(); ++i) {\n        RemoveMenu(_deviceMenu, 0, MF_BYPOSITION);\n    }\n    _deviceList.clear();\n\n    std::list<VolumeController::DeviceInfo> devices\n        = _volumeCtrl->ListDevices();\n    std::wstring currentDeviceId = _volumeCtrl->DeviceId();\n\n    int menuItem = MENU_DEVICE;\n    for (VolumeController::DeviceInfo device : devices) {\n        unsigned int flags = MF_ENABLED;\n        if (currentDeviceId == device.id) {\n            flags |= MF_CHECKED;\n        }\n\n        InsertMenu(_deviceMenu, -1, flags, menuItem++, device.name.c_str());\n        _deviceList.push_back(device);\n    }\n}\n\nvoid VolumeOSD::LoadSkin() {\n    Skin *skin = Settings::Instance()->CurrentSkin();\n\n    Gdiplus::Bitmap *bg = skin->OSDBgImg(\"volume\");\n    _mWnd.BackgroundImage(bg);\n\n    std::list<Meter*> meters = skin->VolumeMeters();\n    for (Meter *m : meters) {\n        _mWnd.AddMeter(m);\n    }\n\n    \/* Default volume increment *\/\n    _defaultIncrement = (float) (10000 \/ skin->DefaultVolumeUnits()) \/ 10000.0f;\n    CLOG(L\"Default volume increment: %f\", _defaultIncrement);\n\n    HMONITOR monitor = Monitor::Primary();\n\n    _mWnd.Update();\n    PositionWindow(monitor, _mWnd);\n\n    _muteBg = skin->OSDBgImg(\"mute\");\n    _muteWnd.BackgroundImage(_muteBg);\n    _muteWnd.Update();\n    PositionWindow(monitor, _muteWnd);\n\n    \/* Set up notification icon *\/\n    _iconImages = skin->Iconset(\"volume\");\n    if (_iconImages.size() > 0) {\n        _icon = new NotifyIcon(_hWnd, L\"3RVX\", _iconImages[0]);\n    }\n}\n\nvoid VolumeOSD::MeterLevels(float level) {\n    _mWnd.MeterLevels(level);\n    _mWnd.Update();\n}\n\nvoid VolumeOSD::Hide() {\n    _mWnd.Hide(false);\n    _muteWnd.Hide(false);\n}\n\nvoid VolumeOSD::HideIcon() {\n    delete _icon;\n}\n\nvoid VolumeOSD::UpdateIcon() {\n    UpdateIconImage();\n    UpdateIconTip();\n}\n\nvoid VolumeOSD::UpdateIconImage() {\n    if (_icon == NULL) {\n        return;\n    }\n\n    int icon = 0;\n    if (_volumeCtrl->Muted() == false) {\n        int vUnits = _iconImages.size() - 1;\n        icon = (int) ceil(_volumeCtrl->Volume() * vUnits);\n    }\n\n    if (icon != _lastIcon) {\n        _icon->UpdateIcon(_iconImages[icon]);\n        _lastIcon = icon;\n    }\n}\n\nvoid VolumeOSD::UpdateIconTip() {\n    if (_icon == NULL) {\n        return;\n    }\n\n    if (_volumeCtrl->Muted()) {\n        _icon->UpdateToolTip(_selectedDesc + L\": Muted\");\n    } else {\n        float v = _volumeCtrl->Volume();\n        std::wstring perc = std::to_wstring((int) (v * 100.0f));\n        std::wstring level = _selectedDesc + L\": \" + perc + L\"%\";\n        _icon->UpdateToolTip(level);\n    }\n}\n\nvoid VolumeOSD::ProcessHotkeys(HotkeyInfo &hki) {\n    float currentVol = _volumeCtrl->Volume();\n    switch (hki.action) {\n    case HotkeyInfo::IncreaseVolume:\n        if (_volumeCtrl->Muted() == true) {\n            _volumeCtrl->Muted(false);\n        }\n        _volumeCtrl->Volume(currentVol + _defaultIncrement);\n        SendMessage(_hWnd, MSG_VOL_CHNG, NULL, NULL);\n        break;\n\n    case HotkeyInfo::DecreaseVolume:\n        if (_volumeCtrl->Muted() == true) {\n            _volumeCtrl->Muted(false);\n        }\n        _volumeCtrl->Volume(currentVol - _defaultIncrement);\n        SendMessage(_hWnd, MSG_VOL_CHNG, NULL, NULL);\n        break;\n\n    case HotkeyInfo::Mute:\n        _volumeCtrl->ToggleMute();\n        break;\n    }\n}\n\nLRESULT\nVolumeOSD::WndProc(HWND hWnd, UINT message, WPARAM wParam, LPARAM lParam) {\n    if (message == MSG_VOL_CHNG) {\n        float v = _volumeCtrl->Volume();\n\n        _volumeSlider->MeterLevels(v);\n\n        if (_volumeSlider->Visible() == false) {\n            if (_volumeCtrl->Muted() || v == 0.0f) {\n                _muteWnd.Show();\n                _mWnd.Hide(false);\n            } else {\n                MeterLevels(v);\n                _mWnd.Show();\n                _muteWnd.Hide(false);\n            }\n            HideOthers(Volume);\n        }\n\n        UpdateIcon();\n    } else if (message == MSG_VOL_DEVCHNG) {\n        CLOG(L\"Volume device change detected.\");\n        if (_selectedDevice == L\"\") {\n            _volumeCtrl->SelectDefaultDevice();\n        } else {\n            HRESULT hr = _volumeCtrl->SelectDevice(_selectedDevice);\n            if (FAILED(hr)) {\n                _volumeCtrl->SelectDefaultDevice();\n            }\n        }\n        _selectedDesc = _volumeCtrl->DeviceDesc();\n        UpdateDeviceMenu();\n    } else if (message == MSG_NOTIFYICON) {\n        if (lParam == WM_LBUTTONUP) {\n            _volumeSlider->Show();\n        } else if (lParam == WM_RBUTTONUP) {\n            POINT p;\n            GetCursorPos(&p);\n            SetForegroundWindow(hWnd);\n            TrackPopupMenuEx(_menu, _menuFlags, p.x, p.y, _hWnd, NULL);\n            PostMessage(hWnd, WM_NULL, 0, 0);\n        }\n    } else if (message == WM_COMMAND) {\n        int menuItem = LOWORD(wParam);\n        switch (menuItem) {\n        case MENU_SETTINGS:\n            Settings::LaunchSettingsApp();\n            break;\n\n        case MENU_MIXER: {\n            CLOG(L\"Menu: Mixer\");\n            HINSTANCE code = ShellExecute(NULL, L\"open\", L\"sndvol\",\n                NULL, NULL, SW_SHOWNORMAL);\n            break;\n        }\n\n        case MENU_EXIT:\n            CLOG(L\"Menu: Exit: %d\", (int) _masterWnd);\n            SendMessage(_masterWnd, WM_CLOSE, NULL, NULL);\n            break;\n        }\n\n        \/* Device menu items *\/\n        if ((menuItem & MENU_DEVICE) > 0) {\n            int device = menuItem & 0x0FFF;\n            VolumeController::DeviceInfo selectedDev = _deviceList[device];\n            if (selectedDev.id != _volumeCtrl->DeviceId()) {\n                \/* A different device has been selected *\/\n                CLOG(L\"Changing to volume device: %s\",\n                    selectedDev.name.c_str());\n                _volumeCtrl->SelectDevice(selectedDev.id);\n                UpdateDeviceMenu();\n            }\n        }\n    }\n\n    return DefWindowProc(hWnd, message, wParam, lParam);\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 \"VolumeOSD.h\"\n\n#include <string>\n\n#include \"..\/3RVX.h\"\n#include \"..\/Controllers\/Volume\/CurveTransformer.h\"\n#include \"..\/HotkeyInfo.h\"\n#include \"..\/LanguageTranslator.h\"\n#include \"..\/MeterWnd\/LayeredWnd.h\"\n#include \"..\/MeterWnd\/Meters\/CallbackMeter.h\"\n#include \"..\/Monitor.h\"\n#include \"..\/Skin\/OSDComponent.h\"\n#include \"..\/Skin\/Skin.h\"\n#include \"..\/Skin\/SkinManager.h\"\n#include \"..\/Slider\/VolumeSlider.h\"\n#include \"..\/SoundPlayer.h\"\n\nVolumeOSD::VolumeOSD() :\nOSD(L\"3RVX-VolumeDispatcher\"),\n_mWnd(L\"3RVX-VolumeOSD\", L\"3RVX-VolumeOSD\"),\n_muteWnd(L\"3RVX-MuteOSD\", L\"3RVX-MuteOSD\") {\n\n    LoadSkin();\n\n    \/* Start the volume controller *\/\n    _volumeCtrl = new CoreAudio(Window::Handle());\n    std::wstring device = _settings->AudioDeviceID();\n    _volumeCtrl->Init(device);\n    _selectedDesc = _volumeCtrl->DeviceDesc();\n\n    int curveAdjust = _settings->VolumeCurveAdjustment();\n    if (curveAdjust > 0) {\n        CLOG(L\"Using curve adjust factor: %d\", curveAdjust);\n        CurveTransformer *ct = new CurveTransformer((float) curveAdjust);\n        _volumeCtrl->AddTransformation(ct);\n        _volumeTransformations.push_back(ct);\n    }\n\n    float volumeLimiter = _settings->VolumeLimiter();\n    if (volumeLimiter > 0.0f && volumeLimiter < 1.0f) {\n        CLOG(L\"Using volume limiter: %f\", volumeLimiter);\n        \/\/TODO: limiter\n    }\n\n    \/* Set up volume state variables *\/\n    _lastVolume = _volumeCtrl->Volume();\n    _muted = _volumeCtrl->Muted();\n\n    \/* Create the slider *\/\n    _volumeSlider = new VolumeSlider(*_volumeCtrl);\n\n    \/* Set up context menu *\/\n    if (_settings->NotifyIconEnabled()) {\n        LanguageTranslator *translator = _settings->Translator();\n        _menuSetStr = translator->Translate(_menuSetStr);\n        _menuDevStr = translator->Translate(_menuDevStr);\n        _menuMixerStr = translator->Translate(_menuMixerStr);\n        _menuExitStr = translator->Translate(_menuExitStr);\n        _iconMuteStr = translator->Translate(_iconMuteStr);\n\n        _menu = CreatePopupMenu();\n        _deviceMenu = CreatePopupMenu();\n\n        InsertMenu(_menu, -1, MF_ENABLED, MENU_SETTINGS, _menuSetStr.c_str());\n        InsertMenu(_menu, -1, MF_POPUP, UINT(_deviceMenu), _menuDevStr.c_str());\n        InsertMenu(_menu, -1, MF_ENABLED, MENU_MIXER, _menuMixerStr.c_str());\n        InsertMenu(_menu, -1, MF_ENABLED, MENU_EXIT, _menuExitStr.c_str());\n\n        _menuFlags = TPM_RIGHTBUTTON;\n        if (GetSystemMetrics(SM_MENUDROPALIGNMENT) != 0) {\n            _menuFlags |= TPM_RIGHTALIGN;\n        } else {\n            _menuFlags |= TPM_LEFTALIGN;\n        }\n\n        UpdateDeviceMenu();\n    }\n\n    UpdateIcon();\n    float v = _volumeCtrl->Volume();\n    MeterLevels(v);\n    _volumeSlider->MeterLevels(v);\n\n    if (_settings->ShowOnStartup()) {\n        SendMessage(Window::Handle(), VolumeController::MSG_VOL_CHNG,\n            NULL, (LPARAM) 1);\n    }\n}\n\nVolumeOSD::~VolumeOSD() {\n    DestroyMenu(_deviceMenu);\n    DestroyMenu(_menu);\n    delete _icon;\n    delete _volumeSlider;\n    delete _callbackMeter;\n    for (VolumeTransformation *trans : _volumeTransformations) {\n        delete trans;\n    }\n    _volumeTransformations.clear();\n    _volumeCtrl->Dispose();\n}\n\nvoid VolumeOSD::UpdateDeviceMenu() {\n    if (_menu == NULL || _deviceMenu == NULL) {\n        return;\n    }\n\n    \/* Remove any devices currently in the menu first *\/\n    for (unsigned int i = 0; i < _deviceList.size(); ++i) {\n        RemoveMenu(_deviceMenu, 0, MF_BYPOSITION);\n    }\n    _deviceList.clear();\n\n    std::list<VolumeController::DeviceInfo> devices\n        = _volumeCtrl->ListDevices();\n    std::wstring currentDeviceId = _volumeCtrl->DeviceId();\n\n    \/* Disable\/enable the menu depending on whether devices are available *\/\n    EnableMenuItem(_menu, UINT(_deviceMenu),\n        devices.size() == 0 ? MF_GRAYED : MF_ENABLED);\n\n    int menuItem = MENU_DEVICE;\n    for (VolumeController::DeviceInfo device : devices) {\n        unsigned int flags = MF_ENABLED;\n        if (currentDeviceId == device.id) {\n            flags |= MF_CHECKED;\n        }\n\n        InsertMenu(_deviceMenu, -1, flags, menuItem++, device.name.c_str());\n        _deviceList.push_back(device);\n    }\n}\n\nvoid VolumeOSD::LoadSkin() {\n    SkinManager *skin = SkinManager::Instance();\n\n    \/* Volume OSD *\/\n    OSDComponent *volumeOSD = skin->VolumeOSD();\n    _mWnd.BackgroundImage(volumeOSD->background);\n    _mWnd.EnableGlass(volumeOSD->mask);\n    for (Meter *m : volumeOSD->meters) {\n        _mWnd.AddMeter(m);\n    }\n\n    \/* Add a callback meter with the default volume increment for sounds *\/\n    _callbackMeter = new CallbackMeter(volumeOSD->defaultUnits, *this);\n    _mWnd.AddMeter(_callbackMeter);\n\n    \/* Default volume increment *\/\n    _defaultIncrement = (float) (10000 \/ volumeOSD->defaultUnits) \/ 10000.0f;\n    CLOG(L\"Default volume increment: %f\", _defaultIncrement);\n\n    _mWnd.Update();\n\n    \/* Mute OSD *\/\n    _muteWnd.BackgroundImage(skin->MuteOSD()->background);\n    _muteWnd.EnableGlass(skin->MuteOSD()->mask);\n    _muteWnd.Update();\n\n    \/* Now that everything is set up, initialize the meter windows. *\/\n    OSD::InitMeterWnd(_mWnd);\n    OSD::InitMeterWnd(_muteWnd);\n\n    \/* Set up notification icon *\/\n    if (_settings->NotifyIconEnabled()) {\n        _iconImages = skin->VolumeIconset();\n        if (_iconImages.size() > 0) {\n            _icon = new NotifyIcon(Window::Handle(), L\"3RVX\", _iconImages[0]);\n        }\n    }\n\n    \/* Enable sound effects, if any *\/\n    if (_settings->SoundEffectsEnabled()) {\n        _soundPlayer = volumeOSD->sound;\n    }\n}\n\nvoid VolumeOSD::MeterLevels(float level) {\n    _mWnd.MeterLevels(level);\n    _mWnd.Update();\n}\n\nvoid VolumeOSD::MeterChangeCallback(int units) {\n    \/* This method is called each time the callback meter changes by at least\n     * 1 volume unit (as defined by the skin's default unit amount). The\n     * callback meter is also used for incrementing\/decrementing the volume by\n     * skin units. *\/\n}\n\nvoid VolumeOSD::Hide() {\n    _mWnd.Hide(false);\n    _muteWnd.Hide(false);\n}\n\nvoid VolumeOSD::Show(bool mute) {\n    if (OSD::Enabled() == false) {\n        return;\n    }\n\n    if (mute) {\n        _muteWnd.Show();\n        _mWnd.Hide(false);\n    } else {\n        _mWnd.Show();\n        _muteWnd.Hide(false);\n    }\n}\n\nvoid VolumeOSD::HideIcon() {\n    delete _icon;\n}\n\nvoid VolumeOSD::UpdateIcon() {\n    UpdateIconImage();\n    UpdateIconTip();\n}\n\nvoid VolumeOSD::UpdateIconImage() {\n    if (_icon == NULL) {\n        return;\n    }\n\n    int icon = 0;\n    if (_volumeCtrl->Muted() == false) {\n        size_t vUnits = _iconImages.size() - 1;\n        icon = (int) ceil(_volumeCtrl->Volume() * vUnits);\n    }\n\n    if (icon != _lastIcon) {\n        _icon->UpdateIcon(_iconImages[icon]);\n        _lastIcon = icon;\n    }\n}\n\nvoid VolumeOSD::UpdateIconTip() {\n    if (_icon == NULL) {\n        return;\n    }\n\n    if (_volumeCtrl->Muted()) {\n        if (_volumeCtrl->DeviceEnabled()) {\n            _icon->UpdateToolTip(_selectedDesc + L\": \" + _iconMuteStr);\n        } else {\n            _icon->UpdateToolTip(L\"No audio device detected\");\n        }\n    } else {\n        float v = _volumeCtrl->Volume();\n        std::wstring perc = std::to_wstring((int) (v * 100.0f));\n        std::wstring level = _selectedDesc + L\": \" + perc + L\"%\";\n        _icon->UpdateToolTip(level);\n    }\n}\n\nvoid VolumeOSD::UnMute() {\n    if (_volumeCtrl->Muted() == true) {\n        _volumeCtrl->Muted(false);\n    }\n}\n\nvoid VolumeOSD::ProcessHotkeys(HotkeyInfo &hki) {\n    switch (hki.action) {\n    case HotkeyInfo::IncreaseVolume:\n    case HotkeyInfo::DecreaseVolume:\n        UnMute();\n        ProcessVolumeHotkeys(hki);\n        break;\n\n    case HotkeyInfo::SetVolume: {\n        HotkeyInfo::VolumeKeyArgTypes type = HotkeyInfo::VolumeArgType(hki);\n        if (type == HotkeyInfo::VolumeKeyArgTypes::NoArgs) {\n            return;\n        } else if (type == HotkeyInfo::VolumeKeyArgTypes::Units) {\n            int numUnits = hki.ArgToInt(0);\n            _volumeCtrl->Volume(numUnits * _defaultIncrement);\n        } else if (type == HotkeyInfo::VolumeKeyArgTypes::Percentage) {\n            double perc = hki.ArgToDouble(0);\n            _volumeCtrl->Volume((float) perc);\n        }\n    }\n\n        SendMessage(Window::Handle(), VolumeController::MSG_VOL_CHNG,\n            NULL, (LPARAM) 1);\n        break;\n\n    case HotkeyInfo::Mute:\n        _volumeCtrl->ToggleMute();\n        SendMessage(Window::Handle(), VolumeController::MSG_VOL_CHNG,\n            NULL, (LPARAM) 1);\n        break;\n\n    case HotkeyInfo::VolumeSlider:\n        if (_volumeSlider->Visible()) {\n            \/* If the slider is already visible, user must want to close it. *\/\n            _volumeSlider->Hide();\n        } else {\n            SendMessage(Window::Handle(), MSG_NOTIFYICON, NULL, WM_LBUTTONUP);\n        }\n        break;\n    }\n}\n\nvoid VolumeOSD::ProcessVolumeHotkeys(HotkeyInfo &hki) {\n    float currentVol = _volumeCtrl->Volume();\n    HotkeyInfo::VolumeKeyArgTypes type = HotkeyInfo::VolumeArgType(hki);\n\n    if (type == HotkeyInfo::VolumeKeyArgTypes::Percentage) {\n        \/* Deal with percentage-based amounts *\/\n        float amount = ((float) hki.ArgToDouble(0) \/ 100.0f);\n        if (hki.action == HotkeyInfo::HotkeyActions::DecreaseVolume) {\n            amount = -amount;\n        }\n        _volumeCtrl->Volume(currentVol + amount);\n    } else {\n        \/* Unit-based amounts *\/\n        int unitIncrement = 1;\n        int currentUnit = _callbackMeter->CalcUnits();\n        if (currentVol <= 0.000001f) {\n            currentUnit = 0;\n        }\n\n        if (hki.action == HotkeyInfo::DecreaseVolume) {\n            unitIncrement = -1;\n        }\n\n        if (type == HotkeyInfo::VolumeKeyArgTypes::Units) {\n            unitIncrement *= hki.ArgToInt(0);\n        }\n\n        _volumeCtrl->Volume(\n            (float) (currentUnit + unitIncrement) * _defaultIncrement);\n    }\n\n    \/* Tell 3RVX that we changed the volume *\/\n    SendMessage(Window::Handle(), VolumeController::MSG_VOL_CHNG,\n        NULL, (LPARAM) 1);\n}\n\nvoid VolumeOSD::UpdateVolumeState() {\n    float v = _volumeCtrl->Volume();\n    MeterLevels(v);\n    _volumeSlider->MeterLevels(v);\n    UpdateIcon();\n}\n\nvoid VolumeOSD::OnDisplayChange() {\n    InitMeterWnd(_mWnd);\n    InitMeterWnd(_muteWnd);\n}\n\nLRESULT\nVolumeOSD::WndProc(HWND hWnd, UINT message, WPARAM wParam, LPARAM lParam) {\n    if (message == VolumeController::MSG_VOL_CHNG) {\n        float v = _volumeCtrl->Volume();\n        bool muteState = _volumeCtrl->Muted();\n\n        _volumeSlider->MeterLevels(v);\n        UpdateIcon();\n\n        if (wParam > 0) {\n            \/* We manually post a MSG_VOL_CHNG when modifying the volume with\n             * hotkeys, so this CoreAudio-generated event can be ignored\n             * by the OSD. *\/\n            CLOG(L\"Ignoring volume change notification generated by 3RVX\");\n            return DefWindowProc(hWnd, message, wParam, lParam);\n        }\n\n        CLOG(L\"Volume change notification:\\nNew level: %f\\nPrevious: %f\",\n            v, _lastVolume);\n        if (lParam == 0 && (muteState == _muted)) {\n            if (abs(v - _lastVolume) < 0.0001f) {\n                CLOG(L\"No change in volume detected; ignoring event.\");\n                return DefWindowProc(hWnd, message, wParam, lParam);\n            }\n        }\n        _lastVolume = v;\n        _muted = muteState;\n\n        if (_volumeSlider->Visible() == false) {\n            if (_volumeCtrl->Muted() || v == 0.0f) {\n                Show(true);\n            } else {\n                MeterLevels(v);\n                Show();\n\n                if (_soundPlayer) {\n                    _soundPlayer->Play();\n                }\n            }\n            HideOthers(Volume);\n        }\n\n    } else if (message == VolumeController::MSG_VOL_DEVCHNG) {\n        CLOG(L\"Volume device change detected.\");\n        if (_selectedDevice == L\"\") {\n            _volumeCtrl->SelectDefaultDevice();\n        } else {\n            HRESULT hr = _volumeCtrl->SelectDevice(_selectedDevice);\n            if (FAILED(hr)) {\n                _volumeCtrl->SelectDefaultDevice();\n            }\n        }\n        _selectedDesc = _volumeCtrl->DeviceDesc();\n        UpdateDeviceMenu();\n        UpdateVolumeState();\n\n    } else if (message == MSG_NOTIFYICON) {\n        if (lParam == WM_LBUTTONUP) {\n            if (_volumeCtrl->DeviceEnabled()) {\n                _volumeSlider->MeterLevels(_volumeCtrl->Volume());\n                _volumeSlider->Show();\n            }\n        } else if (lParam == WM_RBUTTONUP) {\n            POINT p;\n            GetCursorPos(&p);\n            SetForegroundWindow(hWnd);\n            TrackPopupMenuEx(_menu, _menuFlags, p.x, p.y,\n                Window::Handle(), NULL);\n            PostMessage(hWnd, WM_NULL, 0, 0);\n        }\n\n    } else if (message == WM_COMMAND) {\n        int menuItem = LOWORD(wParam);\n        switch (menuItem) {\n        case MENU_SETTINGS:\n            Settings::LaunchSettingsApp();\n            break;\n\n        case MENU_MIXER: {\n            CLOG(L\"Menu: Mixer\");\n            HINSTANCE code = ShellExecute(NULL, L\"open\", L\"sndvol\",\n                NULL, NULL, SW_SHOWNORMAL);\n            break;\n        }\n\n        case MENU_EXIT:\n            CLOG(L\"Menu: Exit: %d\", (int) _masterWnd);\n            SendMessage(_masterWnd, WM_CLOSE, NULL, NULL);\n            break;\n        }\n\n        \/* Device menu items *\/\n        if ((menuItem & MENU_DEVICE) > 0) {\n            int device = menuItem & 0x0FFF;\n            VolumeController::DeviceInfo selectedDev = _deviceList[device];\n            if (selectedDev.id != _volumeCtrl->DeviceId()) {\n                \/* A different device has been selected *\/\n                CLOG(L\"Changing to volume device: %s\",\n                    selectedDev.name.c_str());\n                _volumeCtrl->SelectDevice(selectedDev.id);\n                UpdateDeviceMenu();\n                UpdateVolumeState();\n            }\n        }\n    }\n\n    return DefWindowProc(hWnd, message, wParam, lParam);\n}<commit_msg>Register for session change notifications<commit_after>\/\/ Copyright (c) 2015, Matthew Malensek.\n\/\/ Distributed under the BSD 2-Clause License (see LICENSE.txt for details)\n\n#include \"VolumeOSD.h\"\n\n#pragma comment(lib, \"Wtsapi32.lib\")\n\n#include <string>\n#include <Wtsapi32.h>\n\n#include \"..\/3RVX.h\"\n#include \"..\/Controllers\/Volume\/CurveTransformer.h\"\n#include \"..\/HotkeyInfo.h\"\n#include \"..\/LanguageTranslator.h\"\n#include \"..\/MeterWnd\/LayeredWnd.h\"\n#include \"..\/MeterWnd\/Meters\/CallbackMeter.h\"\n#include \"..\/Monitor.h\"\n#include \"..\/Skin\/OSDComponent.h\"\n#include \"..\/Skin\/Skin.h\"\n#include \"..\/Skin\/SkinManager.h\"\n#include \"..\/Slider\/VolumeSlider.h\"\n#include \"..\/SoundPlayer.h\"\n\nVolumeOSD::VolumeOSD() :\nOSD(L\"3RVX-VolumeDispatcher\"),\n_mWnd(L\"3RVX-VolumeOSD\", L\"3RVX-VolumeOSD\"),\n_muteWnd(L\"3RVX-MuteOSD\", L\"3RVX-MuteOSD\") {\n\n    LoadSkin();\n\n    \/* Start the volume controller *\/\n    _volumeCtrl = new CoreAudio(Window::Handle());\n    std::wstring device = _settings->AudioDeviceID();\n    _volumeCtrl->Init(device);\n    _selectedDesc = _volumeCtrl->DeviceDesc();\n\n    int curveAdjust = _settings->VolumeCurveAdjustment();\n    if (curveAdjust > 0) {\n        CLOG(L\"Using curve adjust factor: %d\", curveAdjust);\n        CurveTransformer *ct = new CurveTransformer((float) curveAdjust);\n        _volumeCtrl->AddTransformation(ct);\n        _volumeTransformations.push_back(ct);\n    }\n\n    float volumeLimiter = _settings->VolumeLimiter();\n    if (volumeLimiter > 0.0f && volumeLimiter < 1.0f) {\n        CLOG(L\"Using volume limiter: %f\", volumeLimiter);\n        \/\/TODO: limiter\n    }\n\n    \/* Set up volume state variables *\/\n    _lastVolume = _volumeCtrl->Volume();\n    _muted = _volumeCtrl->Muted();\n\n    \/* Create the slider *\/\n    _volumeSlider = new VolumeSlider(*_volumeCtrl);\n\n    \/* Set up context menu *\/\n    if (_settings->NotifyIconEnabled()) {\n        LanguageTranslator *translator = _settings->Translator();\n        _menuSetStr = translator->Translate(_menuSetStr);\n        _menuDevStr = translator->Translate(_menuDevStr);\n        _menuMixerStr = translator->Translate(_menuMixerStr);\n        _menuExitStr = translator->Translate(_menuExitStr);\n        _iconMuteStr = translator->Translate(_iconMuteStr);\n\n        _menu = CreatePopupMenu();\n        _deviceMenu = CreatePopupMenu();\n\n        InsertMenu(_menu, -1, MF_ENABLED, MENU_SETTINGS, _menuSetStr.c_str());\n        InsertMenu(_menu, -1, MF_POPUP, UINT(_deviceMenu), _menuDevStr.c_str());\n        InsertMenu(_menu, -1, MF_ENABLED, MENU_MIXER, _menuMixerStr.c_str());\n        InsertMenu(_menu, -1, MF_ENABLED, MENU_EXIT, _menuExitStr.c_str());\n\n        _menuFlags = TPM_RIGHTBUTTON;\n        if (GetSystemMetrics(SM_MENUDROPALIGNMENT) != 0) {\n            _menuFlags |= TPM_RIGHTALIGN;\n        } else {\n            _menuFlags |= TPM_LEFTALIGN;\n        }\n\n        UpdateDeviceMenu();\n    }\n\n    UpdateIcon();\n    float v = _volumeCtrl->Volume();\n    MeterLevels(v);\n    _volumeSlider->MeterLevels(v);\n\n    if (_settings->MuteOnLock()) {\n        \/* If muting volume on lock is enabled, register for notifications. *\/\n        WTSRegisterSessionNotification(\n            Window::Handle(), NOTIFY_FOR_THIS_SESSION);\n    }\n\n    if (_settings->ShowOnStartup()) {\n        SendMessage(Window::Handle(), VolumeController::MSG_VOL_CHNG,\n            NULL, (LPARAM) 1);\n    }\n}\n\nVolumeOSD::~VolumeOSD() {\n    WTSUnRegisterSessionNotification(Window::Handle());\n    DestroyMenu(_deviceMenu);\n    DestroyMenu(_menu);\n    delete _icon;\n    delete _volumeSlider;\n    delete _callbackMeter;\n    for (VolumeTransformation *trans : _volumeTransformations) {\n        delete trans;\n    }\n    _volumeTransformations.clear();\n    _volumeCtrl->Dispose();\n}\n\nvoid VolumeOSD::UpdateDeviceMenu() {\n    if (_menu == NULL || _deviceMenu == NULL) {\n        return;\n    }\n\n    \/* Remove any devices currently in the menu first *\/\n    for (unsigned int i = 0; i < _deviceList.size(); ++i) {\n        RemoveMenu(_deviceMenu, 0, MF_BYPOSITION);\n    }\n    _deviceList.clear();\n\n    std::list<VolumeController::DeviceInfo> devices\n        = _volumeCtrl->ListDevices();\n    std::wstring currentDeviceId = _volumeCtrl->DeviceId();\n\n    \/* Disable\/enable the menu depending on whether devices are available *\/\n    EnableMenuItem(_menu, UINT(_deviceMenu),\n        devices.size() == 0 ? MF_GRAYED : MF_ENABLED);\n\n    int menuItem = MENU_DEVICE;\n    for (VolumeController::DeviceInfo device : devices) {\n        unsigned int flags = MF_ENABLED;\n        if (currentDeviceId == device.id) {\n            flags |= MF_CHECKED;\n        }\n\n        InsertMenu(_deviceMenu, -1, flags, menuItem++, device.name.c_str());\n        _deviceList.push_back(device);\n    }\n}\n\nvoid VolumeOSD::LoadSkin() {\n    SkinManager *skin = SkinManager::Instance();\n\n    \/* Volume OSD *\/\n    OSDComponent *volumeOSD = skin->VolumeOSD();\n    _mWnd.BackgroundImage(volumeOSD->background);\n    _mWnd.EnableGlass(volumeOSD->mask);\n    for (Meter *m : volumeOSD->meters) {\n        _mWnd.AddMeter(m);\n    }\n\n    \/* Add a callback meter with the default volume increment for sounds *\/\n    _callbackMeter = new CallbackMeter(volumeOSD->defaultUnits, *this);\n    _mWnd.AddMeter(_callbackMeter);\n\n    \/* Default volume increment *\/\n    _defaultIncrement = (float) (10000 \/ volumeOSD->defaultUnits) \/ 10000.0f;\n    CLOG(L\"Default volume increment: %f\", _defaultIncrement);\n\n    _mWnd.Update();\n\n    \/* Mute OSD *\/\n    _muteWnd.BackgroundImage(skin->MuteOSD()->background);\n    _muteWnd.EnableGlass(skin->MuteOSD()->mask);\n    _muteWnd.Update();\n\n    \/* Now that everything is set up, initialize the meter windows. *\/\n    OSD::InitMeterWnd(_mWnd);\n    OSD::InitMeterWnd(_muteWnd);\n\n    \/* Set up notification icon *\/\n    if (_settings->NotifyIconEnabled()) {\n        _iconImages = skin->VolumeIconset();\n        if (_iconImages.size() > 0) {\n            _icon = new NotifyIcon(Window::Handle(), L\"3RVX\", _iconImages[0]);\n        }\n    }\n\n    \/* Enable sound effects, if any *\/\n    if (_settings->SoundEffectsEnabled()) {\n        _soundPlayer = volumeOSD->sound;\n    }\n}\n\nvoid VolumeOSD::MeterLevels(float level) {\n    _mWnd.MeterLevels(level);\n    _mWnd.Update();\n}\n\nvoid VolumeOSD::MeterChangeCallback(int units) {\n    \/* This method is called each time the callback meter changes by at least\n     * 1 volume unit (as defined by the skin's default unit amount). The\n     * callback meter is also used for incrementing\/decrementing the volume by\n     * skin units. *\/\n}\n\nvoid VolumeOSD::Hide() {\n    _mWnd.Hide(false);\n    _muteWnd.Hide(false);\n}\n\nvoid VolumeOSD::Show(bool mute) {\n    if (OSD::Enabled() == false) {\n        return;\n    }\n\n    if (mute) {\n        _muteWnd.Show();\n        _mWnd.Hide(false);\n    } else {\n        _mWnd.Show();\n        _muteWnd.Hide(false);\n    }\n}\n\nvoid VolumeOSD::HideIcon() {\n    delete _icon;\n}\n\nvoid VolumeOSD::UpdateIcon() {\n    UpdateIconImage();\n    UpdateIconTip();\n}\n\nvoid VolumeOSD::UpdateIconImage() {\n    if (_icon == NULL) {\n        return;\n    }\n\n    int icon = 0;\n    if (_volumeCtrl->Muted() == false) {\n        size_t vUnits = _iconImages.size() - 1;\n        icon = (int) ceil(_volumeCtrl->Volume() * vUnits);\n    }\n\n    if (icon != _lastIcon) {\n        _icon->UpdateIcon(_iconImages[icon]);\n        _lastIcon = icon;\n    }\n}\n\nvoid VolumeOSD::UpdateIconTip() {\n    if (_icon == NULL) {\n        return;\n    }\n\n    if (_volumeCtrl->Muted()) {\n        if (_volumeCtrl->DeviceEnabled()) {\n            _icon->UpdateToolTip(_selectedDesc + L\": \" + _iconMuteStr);\n        } else {\n            _icon->UpdateToolTip(L\"No audio device detected\");\n        }\n    } else {\n        float v = _volumeCtrl->Volume();\n        std::wstring perc = std::to_wstring((int) (v * 100.0f));\n        std::wstring level = _selectedDesc + L\": \" + perc + L\"%\";\n        _icon->UpdateToolTip(level);\n    }\n}\n\nvoid VolumeOSD::UnMute() {\n    if (_volumeCtrl->Muted() == true) {\n        _volumeCtrl->Muted(false);\n    }\n}\n\nvoid VolumeOSD::ProcessHotkeys(HotkeyInfo &hki) {\n    switch (hki.action) {\n    case HotkeyInfo::IncreaseVolume:\n    case HotkeyInfo::DecreaseVolume:\n        UnMute();\n        ProcessVolumeHotkeys(hki);\n        break;\n\n    case HotkeyInfo::SetVolume: {\n        HotkeyInfo::VolumeKeyArgTypes type = HotkeyInfo::VolumeArgType(hki);\n        if (type == HotkeyInfo::VolumeKeyArgTypes::NoArgs) {\n            return;\n        } else if (type == HotkeyInfo::VolumeKeyArgTypes::Units) {\n            int numUnits = hki.ArgToInt(0);\n            _volumeCtrl->Volume(numUnits * _defaultIncrement);\n        } else if (type == HotkeyInfo::VolumeKeyArgTypes::Percentage) {\n            double perc = hki.ArgToDouble(0);\n            _volumeCtrl->Volume((float) perc);\n        }\n    }\n\n        SendMessage(Window::Handle(), VolumeController::MSG_VOL_CHNG,\n            NULL, (LPARAM) 1);\n        break;\n\n    case HotkeyInfo::Mute:\n        _volumeCtrl->ToggleMute();\n        SendMessage(Window::Handle(), VolumeController::MSG_VOL_CHNG,\n            NULL, (LPARAM) 1);\n        break;\n\n    case HotkeyInfo::VolumeSlider:\n        if (_volumeSlider->Visible()) {\n            \/* If the slider is already visible, user must want to close it. *\/\n            _volumeSlider->Hide();\n        } else {\n            SendMessage(Window::Handle(), MSG_NOTIFYICON, NULL, WM_LBUTTONUP);\n        }\n        break;\n    }\n}\n\nvoid VolumeOSD::ProcessVolumeHotkeys(HotkeyInfo &hki) {\n    float currentVol = _volumeCtrl->Volume();\n    HotkeyInfo::VolumeKeyArgTypes type = HotkeyInfo::VolumeArgType(hki);\n\n    if (type == HotkeyInfo::VolumeKeyArgTypes::Percentage) {\n        \/* Deal with percentage-based amounts *\/\n        float amount = ((float) hki.ArgToDouble(0) \/ 100.0f);\n        if (hki.action == HotkeyInfo::HotkeyActions::DecreaseVolume) {\n            amount = -amount;\n        }\n        _volumeCtrl->Volume(currentVol + amount);\n    } else {\n        \/* Unit-based amounts *\/\n        int unitIncrement = 1;\n        int currentUnit = _callbackMeter->CalcUnits();\n        if (currentVol <= 0.000001f) {\n            currentUnit = 0;\n        }\n\n        if (hki.action == HotkeyInfo::DecreaseVolume) {\n            unitIncrement = -1;\n        }\n\n        if (type == HotkeyInfo::VolumeKeyArgTypes::Units) {\n            unitIncrement *= hki.ArgToInt(0);\n        }\n\n        _volumeCtrl->Volume(\n            (float) (currentUnit + unitIncrement) * _defaultIncrement);\n    }\n\n    \/* Tell 3RVX that we changed the volume *\/\n    SendMessage(Window::Handle(), VolumeController::MSG_VOL_CHNG,\n        NULL, (LPARAM) 1);\n}\n\nvoid VolumeOSD::UpdateVolumeState() {\n    float v = _volumeCtrl->Volume();\n    MeterLevels(v);\n    _volumeSlider->MeterLevels(v);\n    UpdateIcon();\n}\n\nvoid VolumeOSD::OnDisplayChange() {\n    InitMeterWnd(_mWnd);\n    InitMeterWnd(_muteWnd);\n}\n\nLRESULT\nVolumeOSD::WndProc(HWND hWnd, UINT message, WPARAM wParam, LPARAM lParam) {\n    if (message == VolumeController::MSG_VOL_CHNG) {\n        float v = _volumeCtrl->Volume();\n        bool muteState = _volumeCtrl->Muted();\n\n        _volumeSlider->MeterLevels(v);\n        UpdateIcon();\n\n        if (wParam > 0) {\n            \/* We manually post a MSG_VOL_CHNG when modifying the volume with\n             * hotkeys, so this CoreAudio-generated event can be ignored\n             * by the OSD. *\/\n            CLOG(L\"Ignoring volume change notification generated by 3RVX\");\n            return DefWindowProc(hWnd, message, wParam, lParam);\n        }\n\n        CLOG(L\"Volume change notification:\\nNew level: %f\\nPrevious: %f\",\n            v, _lastVolume);\n        if (lParam == 0 && (muteState == _muted)) {\n            if (abs(v - _lastVolume) < 0.0001f) {\n                CLOG(L\"No change in volume detected; ignoring event.\");\n                return DefWindowProc(hWnd, message, wParam, lParam);\n            }\n        }\n        _lastVolume = v;\n        _muted = muteState;\n\n        if (_volumeSlider->Visible() == false) {\n            if (_volumeCtrl->Muted() || v == 0.0f) {\n                Show(true);\n            } else {\n                MeterLevels(v);\n                Show();\n\n                if (_soundPlayer) {\n                    _soundPlayer->Play();\n                }\n            }\n            HideOthers(Volume);\n        }\n\n    } else if (message == VolumeController::MSG_VOL_DEVCHNG) {\n        CLOG(L\"Volume device change detected.\");\n        if (_selectedDevice == L\"\") {\n            _volumeCtrl->SelectDefaultDevice();\n        } else {\n            HRESULT hr = _volumeCtrl->SelectDevice(_selectedDevice);\n            if (FAILED(hr)) {\n                _volumeCtrl->SelectDefaultDevice();\n            }\n        }\n        _selectedDesc = _volumeCtrl->DeviceDesc();\n        UpdateDeviceMenu();\n        UpdateVolumeState();\n\n    } else if (message == MSG_NOTIFYICON) {\n        if (lParam == WM_LBUTTONUP) {\n            if (_volumeCtrl->DeviceEnabled()) {\n                _volumeSlider->MeterLevels(_volumeCtrl->Volume());\n                _volumeSlider->Show();\n            }\n        } else if (lParam == WM_RBUTTONUP) {\n            POINT p;\n            GetCursorPos(&p);\n            SetForegroundWindow(hWnd);\n            TrackPopupMenuEx(_menu, _menuFlags, p.x, p.y,\n                Window::Handle(), NULL);\n            PostMessage(hWnd, WM_NULL, 0, 0);\n        }\n\n    } else if (message == WM_COMMAND) {\n        int menuItem = LOWORD(wParam);\n        switch (menuItem) {\n        case MENU_SETTINGS:\n            Settings::LaunchSettingsApp();\n            break;\n\n        case MENU_MIXER: {\n            CLOG(L\"Menu: Mixer\");\n            HINSTANCE code = ShellExecute(NULL, L\"open\", L\"sndvol\",\n                NULL, NULL, SW_SHOWNORMAL);\n            break;\n        }\n\n        case MENU_EXIT:\n            CLOG(L\"Menu: Exit: %d\", (int) _masterWnd);\n            SendMessage(_masterWnd, WM_CLOSE, NULL, NULL);\n            break;\n        }\n\n        \/* Device menu items *\/\n        if ((menuItem & MENU_DEVICE) > 0) {\n            int device = menuItem & 0x0FFF;\n            VolumeController::DeviceInfo selectedDev = _deviceList[device];\n            if (selectedDev.id != _volumeCtrl->DeviceId()) {\n                \/* A different device has been selected *\/\n                CLOG(L\"Changing to volume device: %s\",\n                    selectedDev.name.c_str());\n                _volumeCtrl->SelectDevice(selectedDev.id);\n                UpdateDeviceMenu();\n                UpdateVolumeState();\n            }\n        }\n    }\n\n    return DefWindowProc(hWnd, message, wParam, lParam);\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2006-2008 The Android Open Source Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"SkInterpolator.h\"\n#include \"SkMath.h\"\n#include \"SkTSearch.h\"\n\nSkInterpolatorBase::SkInterpolatorBase() {\n    fStorage    = NULL;\n    fTimes      = NULL;\n    SkDEBUGCODE(fTimesArray = NULL;)\n}\n\nSkInterpolatorBase::~SkInterpolatorBase() {\n    if (fStorage) {\n        sk_free(fStorage);\n    }\n}\n\nvoid SkInterpolatorBase::reset(int elemCount, int frameCount) {\n    fFlags = 0;\n    fElemCount = SkToU8(elemCount);\n    fFrameCount = SkToS16(frameCount);\n    fRepeat = SK_Scalar1;\n    if (fStorage) {\n        sk_free(fStorage);\n        fStorage = NULL;\n        fTimes = NULL;\n        SkDEBUGCODE(fTimesArray = NULL);\n    }\n}\n\n\/*  Each value[] run is formated as:\n        <time (in msec)>\n        <blend>\n        <data[fElemCount]>\n\n    Totaling fElemCount+2 entries per keyframe\n*\/\n\nbool SkInterpolatorBase::getDuration(SkMSec* startTime, SkMSec* endTime) const {\n    if (fFrameCount == 0) {\n        return false;\n    }\n\n    if (startTime) {\n        *startTime = fTimes[0].fTime;\n    }\n    if (endTime) {\n        *endTime = fTimes[fFrameCount - 1].fTime;\n    }\n    return true;\n}\n\nSkScalar SkInterpolatorBase::ComputeRelativeT(SkMSec time, SkMSec prevTime,\n                                  SkMSec nextTime, const SkScalar blend[4]) {\n    SkASSERT(time > prevTime && time < nextTime);\n\n    SkScalar t = SkScalarDiv((SkScalar)(time - prevTime),\n                             (SkScalar)(nextTime - prevTime));\n    return blend ?\n            SkUnitCubicInterp(t, blend[0], blend[1], blend[2], blend[3]) : t;\n}\n\nSkInterpolatorBase::Result SkInterpolatorBase::timeToT(SkMSec time, SkScalar* T,\n                                        int* indexPtr, SkBool* exactPtr) const {\n    SkASSERT(fFrameCount > 0);\n    Result  result = kNormal_Result;\n    if (fRepeat != SK_Scalar1) {\n        SkMSec startTime, endTime;\n        this->getDuration(&startTime, &endTime);\n        SkMSec totalTime = endTime - startTime;\n        SkMSec offsetTime = time - startTime;\n        endTime = SkScalarMulFloor(fRepeat, totalTime);\n        if (offsetTime >= endTime) {\n            SkScalar fraction = SkScalarFraction(fRepeat);\n            offsetTime = fraction == 0 && fRepeat > 0 ? totalTime :\n                SkScalarMulFloor(fraction, totalTime);\n            result = kFreezeEnd_Result;\n        } else {\n            int mirror = fFlags & kMirror;\n            offsetTime = offsetTime % (totalTime << mirror);\n            if (offsetTime > totalTime) { \/\/ can only be true if fMirror is true\n                offsetTime = (totalTime << 1) - offsetTime;\n            }\n        }\n        time = offsetTime + startTime;\n    }\n\n    int index = SkTSearch<SkMSec>(&fTimes[0].fTime, fFrameCount, time,\n                                  sizeof(SkTimeCode));\n\n    bool    exact = true;\n\n    if (index < 0) {\n        index = ~index;\n        if (index == 0) {\n            result = kFreezeStart_Result;\n        } else if (index == fFrameCount) {\n            if (fFlags & kReset) {\n                index = 0;\n            } else {\n                index -= 1;\n            }\n            result = kFreezeEnd_Result;\n        } else {\n            exact = false;\n        }\n    }\n    SkASSERT(index < fFrameCount);\n    const SkTimeCode* nextTime = &fTimes[index];\n    SkMSec   nextT = nextTime[0].fTime;\n    if (exact) {\n        *T = 0;\n    } else {\n        SkMSec prevT = nextTime[-1].fTime;\n        *T = ComputeRelativeT(time, prevT, nextT, nextTime[-1].fBlend);\n    }\n    *indexPtr = index;\n    *exactPtr = exact;\n    return result;\n}\n\n\nSkInterpolator::SkInterpolator() {\n    INHERITED::reset(0, 0);\n    fValues = NULL;\n    SkDEBUGCODE(fScalarsArray = NULL;)\n}\n\nSkInterpolator::SkInterpolator(int elemCount, int frameCount) {\n    SkASSERT(elemCount > 0);\n    this->reset(elemCount, frameCount);\n}\n\nvoid SkInterpolator::reset(int elemCount, int frameCount) {\n    INHERITED::reset(elemCount, frameCount);\n    fStorage = sk_malloc_throw((sizeof(SkScalar) * elemCount +\n                                sizeof(SkTimeCode)) * frameCount);\n    fTimes = (SkTimeCode*) fStorage;\n    fValues = (SkScalar*) ((char*) fStorage + sizeof(SkTimeCode) * frameCount);\n#ifdef SK_DEBUG\n    fTimesArray = (SkTimeCode(*)[10]) fTimes;\n    fScalarsArray = (SkScalar(*)[10]) fValues;\n#endif\n}\n\n#define SK_Fixed1Third      (SK_Fixed1\/3)\n#define SK_Fixed2Third      (SK_Fixed1*2\/3)\n\nstatic const SkScalar gIdentityBlend[4] = {\n#ifdef SK_SCALAR_IS_FLOAT\n    0.33333333f, 0.33333333f, 0.66666667f, 0.66666667f\n#else\n    SK_Fixed1Third, SK_Fixed1Third, SK_Fixed2Third, SK_Fixed2Third\n#endif\n};\n\nbool SkInterpolator::setKeyFrame(int index, SkMSec time,\n                            const SkScalar values[], const SkScalar blend[4]) {\n    SkASSERT(values != NULL);\n    \n    if (blend == NULL) {\n        blend = gIdentityBlend;\n    }\n\n    bool success = ~index == SkTSearch<SkMSec>(&fTimes->fTime, index, time,\n                                               sizeof(SkTimeCode));\n    SkASSERT(success);\n    if (success) {\n        SkTimeCode* timeCode = &fTimes[index];\n        timeCode->fTime = time;\n        memcpy(timeCode->fBlend, blend, sizeof(timeCode->fBlend));\n        SkScalar* dst = &fValues[fElemCount * index];\n        memcpy(dst, values, fElemCount * sizeof(SkScalar));\n    }\n    return success;\n}\n\nSkInterpolator::Result SkInterpolator::timeToValues(SkMSec time,\n                                                    SkScalar values[]) const {\n    SkScalar T;\n    int index;\n    SkBool exact;\n    Result result = timeToT(time, &T, &index, &exact);\n    if (values) {\n        const SkScalar* nextSrc = &fValues[index * fElemCount];\n\n        if (exact) {\n            memcpy(values, nextSrc, fElemCount * sizeof(SkScalar));\n        } else {\n            SkASSERT(index > 0);\n\n            const SkScalar* prevSrc = nextSrc - fElemCount;\n\n            for (int i = fElemCount - 1; i >= 0; --i) {\n                values[i] = SkScalarInterp(prevSrc[i], nextSrc[i], T);\n            }\n        }\n    }\n    return result;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ntypedef int Dot14;\n#define Dot14_ONE       (1 << 14)\n#define Dot14_HALF      (1 << 13)\n\n#define Dot14ToFloat(x) ((x) \/ 16384.f)\n\nstatic inline Dot14 Dot14Mul(Dot14 a, Dot14 b) {\n    return (a * b + Dot14_HALF) >> 14;\n}\n\nstatic inline Dot14 eval_cubic(Dot14 t, Dot14 A, Dot14 B, Dot14 C) {\n    return Dot14Mul(Dot14Mul(Dot14Mul(C, t) + B, t) + A, t);\n}\n\nstatic inline Dot14 pin_and_convert(SkScalar x) {\n    if (x <= 0) {\n        return 0;\n    }\n    if (x >= SK_Scalar1) {\n        return Dot14_ONE;\n    }\n    return SkScalarToFixed(x) >> 2;\n}\n\nSkScalar SkUnitCubicInterp(SkScalar value, SkScalar bx, SkScalar by,\n                           SkScalar cx, SkScalar cy) {\n    \/\/ pin to the unit-square, and convert to 2.14\n    Dot14 x = pin_and_convert(value);\n    \n    if (x == 0) return 0;\n    if (x == Dot14_ONE) return SK_Scalar1;\n    \n    Dot14 b = pin_and_convert(bx);\n    Dot14 c = pin_and_convert(cx);\n    \n    \/\/ Now compute our coefficients from the control points\n    \/\/  t   -> 3b\n    \/\/  t^2 -> 3c - 6b\n    \/\/  t^3 -> 3b - 3c + 1\n    Dot14 A = 3*b;\n    Dot14 B = 3*(c - 2*b);\n    Dot14 C = 3*(b - c) + Dot14_ONE;\n\n    \/\/ Now search for a t value given x\n    Dot14   t = Dot14_HALF;\n    Dot14   dt = Dot14_HALF;\n    for (int i = 0; i < 13; i++) {\n        dt >>= 1;\n        Dot14 guess = eval_cubic(t, A, B, C);\n        if (x < guess) {\n            t -= dt;\n        } else {\n            t += dt;\n        }\n    }\n    \n    \/\/ Now we have t, so compute the coeff for Y and evaluate\n    b = pin_and_convert(by);\n    c = pin_and_convert(cy);\n    A = 3*b;\n    B = 3*(c - 2*b);\n    C = 3*(b - c) + Dot14_ONE;\n    return SkFixedToScalar(eval_cubic(t, A, B, C) << 2);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#ifdef SK_DEBUG\n\n#ifdef SK_SUPPORT_UNITTEST\n    static SkScalar* iset(SkScalar array[3], int a, int b, int c) {\n        array[0] = SkIntToScalar(a);\n        array[1] = SkIntToScalar(b);\n        array[2] = SkIntToScalar(c);\n        return array;\n    }\n#endif\n\nvoid SkInterpolator::UnitTest() {\n#ifdef SK_SUPPORT_UNITTEST\n    SkInterpolator  inter(3, 2);\n    SkScalar        v1[3], v2[3], v[3], vv[3];\n    Result          result;\n\n    inter.setKeyFrame(0, 100, iset(v1, 10, 20, 30), 0);\n    inter.setKeyFrame(1, 200, iset(v2, 110, 220, 330));\n\n    result = inter.timeToValues(0, v);\n    SkASSERT(result == kFreezeStart_Result);\n    SkASSERT(memcmp(v, v1, sizeof(v)) == 0);\n\n    result = inter.timeToValues(99, v);\n    SkASSERT(result == kFreezeStart_Result);\n    SkASSERT(memcmp(v, v1, sizeof(v)) == 0);\n\n    result = inter.timeToValues(100, v);\n    SkASSERT(result == kNormal_Result);\n    SkASSERT(memcmp(v, v1, sizeof(v)) == 0);\n\n    result = inter.timeToValues(200, v);\n    SkASSERT(result == kNormal_Result);\n    SkASSERT(memcmp(v, v2, sizeof(v)) == 0);\n\n    result = inter.timeToValues(201, v);\n    SkASSERT(result == kFreezeEnd_Result);\n    SkASSERT(memcmp(v, v2, sizeof(v)) == 0);\n\n    result = inter.timeToValues(150, v);\n    SkASSERT(result == kNormal_Result);\n    SkASSERT(memcmp(v, iset(vv, 60, 120, 180), sizeof(v)) == 0);\n\n    result = inter.timeToValues(125, v);\n    SkASSERT(result == kNormal_Result);\n    result = inter.timeToValues(175, v);\n    SkASSERT(result == kNormal_Result);\n#endif\n}\n\n#endif\n\n<commit_msg>Re-apply fix from r1209 that was clobbered in r6925.<commit_after>\/*\n * Copyright (C) 2006-2008 The Android Open Source Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"SkInterpolator.h\"\n#include \"SkMath.h\"\n#include \"SkTSearch.h\"\n\nSkInterpolatorBase::SkInterpolatorBase() {\n    fStorage    = NULL;\n    fTimes      = NULL;\n    SkDEBUGCODE(fTimesArray = NULL;)\n}\n\nSkInterpolatorBase::~SkInterpolatorBase() {\n    if (fStorage) {\n        sk_free(fStorage);\n    }\n}\n\nvoid SkInterpolatorBase::reset(int elemCount, int frameCount) {\n    fFlags = 0;\n    fElemCount = SkToU8(elemCount);\n    fFrameCount = SkToS16(frameCount);\n    fRepeat = SK_Scalar1;\n    if (fStorage) {\n        sk_free(fStorage);\n        fStorage = NULL;\n        fTimes = NULL;\n        SkDEBUGCODE(fTimesArray = NULL);\n    }\n}\n\n\/*  Each value[] run is formated as:\n        <time (in msec)>\n        <blend>\n        <data[fElemCount]>\n\n    Totaling fElemCount+2 entries per keyframe\n*\/\n\nbool SkInterpolatorBase::getDuration(SkMSec* startTime, SkMSec* endTime) const {\n    if (fFrameCount == 0) {\n        return false;\n    }\n\n    if (startTime) {\n        *startTime = fTimes[0].fTime;\n    }\n    if (endTime) {\n        *endTime = fTimes[fFrameCount - 1].fTime;\n    }\n    return true;\n}\n\nSkScalar SkInterpolatorBase::ComputeRelativeT(SkMSec time, SkMSec prevTime,\n                                  SkMSec nextTime, const SkScalar blend[4]) {\n    SkASSERT(time > prevTime && time < nextTime);\n\n    SkScalar t = SkScalarDiv((SkScalar)(time - prevTime),\n                             (SkScalar)(nextTime - prevTime));\n    return blend ?\n            SkUnitCubicInterp(t, blend[0], blend[1], blend[2], blend[3]) : t;\n}\n\nSkInterpolatorBase::Result SkInterpolatorBase::timeToT(SkMSec time, SkScalar* T,\n                                        int* indexPtr, SkBool* exactPtr) const {\n    SkASSERT(fFrameCount > 0);\n    Result  result = kNormal_Result;\n    if (fRepeat != SK_Scalar1) {\n        SkMSec startTime = 0, endTime = 0;\n        this->getDuration(&startTime, &endTime);\n        SkMSec totalTime = endTime - startTime;\n        SkMSec offsetTime = time - startTime;\n        endTime = SkScalarMulFloor(fRepeat, totalTime);\n        if (offsetTime >= endTime) {\n            SkScalar fraction = SkScalarFraction(fRepeat);\n            offsetTime = fraction == 0 && fRepeat > 0 ? totalTime :\n                SkScalarMulFloor(fraction, totalTime);\n            result = kFreezeEnd_Result;\n        } else {\n            int mirror = fFlags & kMirror;\n            offsetTime = offsetTime % (totalTime << mirror);\n            if (offsetTime > totalTime) { \/\/ can only be true if fMirror is true\n                offsetTime = (totalTime << 1) - offsetTime;\n            }\n        }\n        time = offsetTime + startTime;\n    }\n\n    int index = SkTSearch<SkMSec>(&fTimes[0].fTime, fFrameCount, time,\n                                  sizeof(SkTimeCode));\n\n    bool    exact = true;\n\n    if (index < 0) {\n        index = ~index;\n        if (index == 0) {\n            result = kFreezeStart_Result;\n        } else if (index == fFrameCount) {\n            if (fFlags & kReset) {\n                index = 0;\n            } else {\n                index -= 1;\n            }\n            result = kFreezeEnd_Result;\n        } else {\n            exact = false;\n        }\n    }\n    SkASSERT(index < fFrameCount);\n    const SkTimeCode* nextTime = &fTimes[index];\n    SkMSec   nextT = nextTime[0].fTime;\n    if (exact) {\n        *T = 0;\n    } else {\n        SkMSec prevT = nextTime[-1].fTime;\n        *T = ComputeRelativeT(time, prevT, nextT, nextTime[-1].fBlend);\n    }\n    *indexPtr = index;\n    *exactPtr = exact;\n    return result;\n}\n\n\nSkInterpolator::SkInterpolator() {\n    INHERITED::reset(0, 0);\n    fValues = NULL;\n    SkDEBUGCODE(fScalarsArray = NULL;)\n}\n\nSkInterpolator::SkInterpolator(int elemCount, int frameCount) {\n    SkASSERT(elemCount > 0);\n    this->reset(elemCount, frameCount);\n}\n\nvoid SkInterpolator::reset(int elemCount, int frameCount) {\n    INHERITED::reset(elemCount, frameCount);\n    fStorage = sk_malloc_throw((sizeof(SkScalar) * elemCount +\n                                sizeof(SkTimeCode)) * frameCount);\n    fTimes = (SkTimeCode*) fStorage;\n    fValues = (SkScalar*) ((char*) fStorage + sizeof(SkTimeCode) * frameCount);\n#ifdef SK_DEBUG\n    fTimesArray = (SkTimeCode(*)[10]) fTimes;\n    fScalarsArray = (SkScalar(*)[10]) fValues;\n#endif\n}\n\n#define SK_Fixed1Third      (SK_Fixed1\/3)\n#define SK_Fixed2Third      (SK_Fixed1*2\/3)\n\nstatic const SkScalar gIdentityBlend[4] = {\n#ifdef SK_SCALAR_IS_FLOAT\n    0.33333333f, 0.33333333f, 0.66666667f, 0.66666667f\n#else\n    SK_Fixed1Third, SK_Fixed1Third, SK_Fixed2Third, SK_Fixed2Third\n#endif\n};\n\nbool SkInterpolator::setKeyFrame(int index, SkMSec time,\n                            const SkScalar values[], const SkScalar blend[4]) {\n    SkASSERT(values != NULL);\n    \n    if (blend == NULL) {\n        blend = gIdentityBlend;\n    }\n\n    bool success = ~index == SkTSearch<SkMSec>(&fTimes->fTime, index, time,\n                                               sizeof(SkTimeCode));\n    SkASSERT(success);\n    if (success) {\n        SkTimeCode* timeCode = &fTimes[index];\n        timeCode->fTime = time;\n        memcpy(timeCode->fBlend, blend, sizeof(timeCode->fBlend));\n        SkScalar* dst = &fValues[fElemCount * index];\n        memcpy(dst, values, fElemCount * sizeof(SkScalar));\n    }\n    return success;\n}\n\nSkInterpolator::Result SkInterpolator::timeToValues(SkMSec time,\n                                                    SkScalar values[]) const {\n    SkScalar T;\n    int index;\n    SkBool exact;\n    Result result = timeToT(time, &T, &index, &exact);\n    if (values) {\n        const SkScalar* nextSrc = &fValues[index * fElemCount];\n\n        if (exact) {\n            memcpy(values, nextSrc, fElemCount * sizeof(SkScalar));\n        } else {\n            SkASSERT(index > 0);\n\n            const SkScalar* prevSrc = nextSrc - fElemCount;\n\n            for (int i = fElemCount - 1; i >= 0; --i) {\n                values[i] = SkScalarInterp(prevSrc[i], nextSrc[i], T);\n            }\n        }\n    }\n    return result;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ntypedef int Dot14;\n#define Dot14_ONE       (1 << 14)\n#define Dot14_HALF      (1 << 13)\n\n#define Dot14ToFloat(x) ((x) \/ 16384.f)\n\nstatic inline Dot14 Dot14Mul(Dot14 a, Dot14 b) {\n    return (a * b + Dot14_HALF) >> 14;\n}\n\nstatic inline Dot14 eval_cubic(Dot14 t, Dot14 A, Dot14 B, Dot14 C) {\n    return Dot14Mul(Dot14Mul(Dot14Mul(C, t) + B, t) + A, t);\n}\n\nstatic inline Dot14 pin_and_convert(SkScalar x) {\n    if (x <= 0) {\n        return 0;\n    }\n    if (x >= SK_Scalar1) {\n        return Dot14_ONE;\n    }\n    return SkScalarToFixed(x) >> 2;\n}\n\nSkScalar SkUnitCubicInterp(SkScalar value, SkScalar bx, SkScalar by,\n                           SkScalar cx, SkScalar cy) {\n    \/\/ pin to the unit-square, and convert to 2.14\n    Dot14 x = pin_and_convert(value);\n    \n    if (x == 0) return 0;\n    if (x == Dot14_ONE) return SK_Scalar1;\n    \n    Dot14 b = pin_and_convert(bx);\n    Dot14 c = pin_and_convert(cx);\n    \n    \/\/ Now compute our coefficients from the control points\n    \/\/  t   -> 3b\n    \/\/  t^2 -> 3c - 6b\n    \/\/  t^3 -> 3b - 3c + 1\n    Dot14 A = 3*b;\n    Dot14 B = 3*(c - 2*b);\n    Dot14 C = 3*(b - c) + Dot14_ONE;\n\n    \/\/ Now search for a t value given x\n    Dot14   t = Dot14_HALF;\n    Dot14   dt = Dot14_HALF;\n    for (int i = 0; i < 13; i++) {\n        dt >>= 1;\n        Dot14 guess = eval_cubic(t, A, B, C);\n        if (x < guess) {\n            t -= dt;\n        } else {\n            t += dt;\n        }\n    }\n    \n    \/\/ Now we have t, so compute the coeff for Y and evaluate\n    b = pin_and_convert(by);\n    c = pin_and_convert(cy);\n    A = 3*b;\n    B = 3*(c - 2*b);\n    C = 3*(b - c) + Dot14_ONE;\n    return SkFixedToScalar(eval_cubic(t, A, B, C) << 2);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#ifdef SK_DEBUG\n\n#ifdef SK_SUPPORT_UNITTEST\n    static SkScalar* iset(SkScalar array[3], int a, int b, int c) {\n        array[0] = SkIntToScalar(a);\n        array[1] = SkIntToScalar(b);\n        array[2] = SkIntToScalar(c);\n        return array;\n    }\n#endif\n\nvoid SkInterpolator::UnitTest() {\n#ifdef SK_SUPPORT_UNITTEST\n    SkInterpolator  inter(3, 2);\n    SkScalar        v1[3], v2[3], v[3], vv[3];\n    Result          result;\n\n    inter.setKeyFrame(0, 100, iset(v1, 10, 20, 30), 0);\n    inter.setKeyFrame(1, 200, iset(v2, 110, 220, 330));\n\n    result = inter.timeToValues(0, v);\n    SkASSERT(result == kFreezeStart_Result);\n    SkASSERT(memcmp(v, v1, sizeof(v)) == 0);\n\n    result = inter.timeToValues(99, v);\n    SkASSERT(result == kFreezeStart_Result);\n    SkASSERT(memcmp(v, v1, sizeof(v)) == 0);\n\n    result = inter.timeToValues(100, v);\n    SkASSERT(result == kNormal_Result);\n    SkASSERT(memcmp(v, v1, sizeof(v)) == 0);\n\n    result = inter.timeToValues(200, v);\n    SkASSERT(result == kNormal_Result);\n    SkASSERT(memcmp(v, v2, sizeof(v)) == 0);\n\n    result = inter.timeToValues(201, v);\n    SkASSERT(result == kFreezeEnd_Result);\n    SkASSERT(memcmp(v, v2, sizeof(v)) == 0);\n\n    result = inter.timeToValues(150, v);\n    SkASSERT(result == kNormal_Result);\n    SkASSERT(memcmp(v, iset(vv, 60, 120, 180), sizeof(v)) == 0);\n\n    result = inter.timeToValues(125, v);\n    SkASSERT(result == kNormal_Result);\n    result = inter.timeToValues(175, v);\n    SkASSERT(result == kNormal_Result);\n#endif\n}\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Time:  O(n)\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> subarraySum(vector<int> nums){\n        unordered_map<int, int> table;\n        \n        for (int i = 0, sum = 0; i < nums.size(); ++i) {\n            sum += nums[i];\n            if (sum == 0) {\n                return vector<int>{0, i};\n            }\n            else if (table.find(sum) != table.end()) {\n                return vector<int>{table[sum] + 1, i};\n            } else {\n                table[sum] = i;\n            }\n        }\n    }\n};\n<commit_msg>update<commit_after>class 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> subarraySum(vector<int> nums){\n        unordered_map<int, int> table;\n        table[0] = -1;\n        for (int i = 0, sum = 0; i < nums.size(); ++i) {\n            sum += nums[i];\n            if (!table.insert(make_pair(sum, i)).second) { \/\/ Already exists.\n                return vector<int>{table[sum] + 1, i};\n            }\n        }\n    }\n};\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * The MIT License (MIT)\n *\n * Copyright (c) 2015 Microsoft Corporation\n * \n * -=- Robust Distributed System Nucleus (rDSN) -=- \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 * Description:\n *     What is this file about?\n *\n * Revision history:\n *     xxxx-xx-xx, author, first version\n *     xxxx-xx-xx, author, fix bug about xxx\n *\/\n\n#include \"replica.h\"\n#include \"mutation.h\"\n#include \"mutation_log.h\"\n#include \"replica_stub.h\"\n#include <dsn\/internal\/factory_store.h>\n\n# ifdef __TITLE__\n# undef __TITLE__\n# endif\n# define __TITLE__ \"replica.init\"\n\nnamespace dsn { namespace replication {\n\nusing namespace dsn::service;\n\nerror_code replica::initialize_on_new(const char* app_type, global_partition_id gpid)\n{\n    char buffer[256];\n    sprintf(buffer, \"%u.%u.%s\", gpid.app_id, gpid.pidx, app_type);\n\n    _config.gpid = gpid;\n    _dir = utils::filesystem::path_combine(_stub->dir(), buffer);\n\n    sprintf(_name, \"%u.%u@%s\", _config.gpid.app_id, _config.gpid.pidx, _stub->_primary_address.to_string());\n\n    if (dsn::utils::filesystem::directory_exists(_dir) &&\n        !dsn::utils::filesystem::remove_path(_dir))\n    {\n        derror(\"cannot allocate new replica @ %s, as the dir is already exists\", _dir.c_str());\n        return ERR_PATH_ALREADY_EXIST;\n    }\n\n    if (!dsn::utils::filesystem::create_directory(_dir))\n    {\n        dassert(false, \"Fail to create directory %s.\", _dir.c_str());\n        return ERR_FILE_OPERATION_FAILED;\n    }\n\n    error_code err = init_app_and_prepare_list(app_type, true);\n    dassert (err == ERR_OK, \"\");\n    return err;\n}\n\n\/*static*\/ replica* replica::newr(replica_stub* stub, const char* app_type, global_partition_id gpid)\n{\n    replica* rep = new replica(stub, gpid, app_type);\n    error_code err = rep->initialize_on_new(app_type, gpid);\n    if (err == ERR_OK)\n    {\n        dinfo(\"%s: new replica succeed\", rep->name());\n        return rep;\n    }\n    else\n    {\n        dinfo(\"%s: new replica failed: %s\", rep->name(), err.to_string());\n        rep->close();\n        delete rep;\n        return nullptr;\n    }\n}\n\nerror_code replica::initialize_on_load(const char* dir, const char* app_type, bool rename_dir_on_failure)\n{\n    _dir = dir;\n\n    sprintf(_name, \"%u.%u@%s\", _config.gpid.app_id, _config.gpid.pidx, _stub->_primary_address.to_string());\n\n    error_code err = init_app_and_prepare_list(app_type, false);\n\n    if (err != ERR_OK && rename_dir_on_failure)\n    {\n        \/\/ GCed later\n        char newPath[256];\n        sprintf(newPath, \"%s.%llu.err\", dir, dsn_now_us());\n        if (dsn::utils::filesystem::rename_path(dir, newPath, true))\n        {\n            derror(\"move bad replica from '%s' to '%s'\", dir, newPath);\n        }\n        else\n        {\n            err = ERR_FILE_OPERATION_FAILED;\n        }\n    }\n    return err;\n}\n\n\n\/*static*\/ replica* replica::load(replica_stub* stub, const char* dir, bool rename_dir_on_failure)\n{\n    std::string dr(dir);\n    char splitters[] = { '\\\\', '\/', 0 };\n    std::string name = utils::get_last_component(dr, splitters);\n\n    if (name == \"\")\n    {\n        derror(\"invalid replica dir %s\", dir);\n        return nullptr;\n    }\n\n    char app_type[128];\n    global_partition_id gpid;\n    if (3 != sscanf(name.c_str(), \"%u.%u.%s\", &gpid.app_id, &gpid.pidx, app_type))\n    {\n        derror(\"invalid replica dir %s\", dir);\n        return nullptr;\n    }\n\n    replica* rep = new replica(stub, gpid, app_type, dir);\n    error_code err = rep->initialize_on_load(dir, app_type, rename_dir_on_failure);\n    if (err == ERR_OK)\n    {\n        dinfo(\"%s: load replica succeed\", rep->name());\n        return rep;\n    }\n    else\n    {\n        dinfo(\"%s: load replica failed: %s\", rep->name(), err.to_string());\n        rep->close();\n        delete rep;\n        return nullptr;\n    }\n}\n\nerror_code replica::init_app_and_prepare_list(const char* app_type, bool create_new)\n{\n    dassert(nullptr == _app, \"\");\n\n    sprintf(_name, \"%u.%u @ %s\", _config.gpid.app_id, _config.gpid.pidx, primary_address().to_string());\n\n    _app = ::dsn::utils::factory_store<replication_app_base>::create(app_type, PROVIDER_TYPE_MAIN, this);\n    if (nullptr == _app)\n    {\n        return ERR_OBJECT_NOT_FOUND;\n    }\n\n    error_code err = _app->open_internal(\n        this,\n        create_new\n        );\n\n    if (err == ERR_OK)\n    {\n        _prepare_list->reset(_app->last_committed_decree());\n        \n        if (_options->log_enable_private_prepare\n            || !_app->is_delta_state_learning_supported())\n        {\n            dassert(nullptr == _private_log, \"private log must not be initialized yet\");\n\n            std::string log_dir = utils::filesystem::path_combine(dir(), \"log\");\n\n            _private_log = new mutation_log(\n                log_dir,\n                true,\n                _options->log_batch_buffer_MB,\n                _options->log_file_size_mb\n                );\n        }\n\n        \/\/ sync vaid start log offset between app and logs\n        if (create_new)\n        {\n            err = _app->update_log_info(\n                this,\n                _stub->_log->on_partition_reset(get_gpid(), _app->last_committed_decree()),\n                _private_log ? _private_log->on_partition_reset(get_gpid(), _app->last_committed_decree()) : 0\n                );\n        }\n        else\n        {\n            _stub->_log->set_valid_log_offset_before_open(get_gpid(), _app->log_info().init_offset_in_shared_log);\n            if (_private_log)\n                _private_log->set_valid_log_offset_before_open(get_gpid(), _app->log_info().init_offset_in_private_log);\n        }\n\n        \/\/ replay the logs\n        if (nullptr != _private_log)\n        {\n            err = _private_log->open(\n                get_gpid(),\n                [this](mutation_ptr& mu)\n                {\n                    return replay_mutation(mu);\n                }\n            );\n\n            if (err == ERR_OK)\n            {\n                derror(\n                    \"%s: private log initialized, durable = %lld, committed = %lld, maxpd = %llu, ballot = %llu, valid_offset = %lld\",\n                    name(),\n                    _app->last_durable_decree(),\n                    _app->last_committed_decree(),\n                    max_prepared_decree(),\n                    get_ballot(),\n                    _app->log_info().init_offset_in_private_log\n                    );\n                _private_log->check_log_start_offset(get_gpid(), _app->log_info().init_offset_in_private_log);\n                set_inactive_state_transient(true);\n            }\n            \/* in the beginning the prepare_list is reset to the durable_decree *\/\n            else\n            {\n                derror(\n                    \"%s: private log initialized with error, durable = %lld, committed = %lld, maxpd = %llu, ballot = %llu, valid_offset = %lld\",\n                    name(),\n                    _app->last_durable_decree(),\n                    _app->last_committed_decree(),\n                    max_prepared_decree(),\n                    get_ballot(),\n                    _app->log_info().init_offset_in_private_log\n                    );\n\n                set_inactive_state_transient(false);\n\n                _private_log->close();\n                _private_log = nullptr;\n            }\n        }\n\n        if (nullptr == _check_timer && err == ERR_OK)\n        {\n            _check_timer = tasking::enqueue(\n                LPC_PER_REPLICA_CHECK_TIMER,\n                this,\n                &replica::on_check_timer,\n                gpid_to_hash(get_gpid()),\n                0,\n                5 * 60 * 1000 \/\/ check every five mins\n                );\n        }\n    }\n    \n\n    if (err != ERR_OK)\n    {\n        derror( \"%s: open replica failed, error = %s\", name(), err.to_string());\n        _app->close(false);\n        delete _app;\n        _app = nullptr;\n    }\n    \n    return err;\n}\n\n\/\/ return false only when the log is invalid\nbool replica::replay_mutation(mutation_ptr& mu, bool is_private)\n{\n    auto d = mu->data.header.decree;\n    auto offset = mu->data.header.log_offset;\n    if (is_private && offset < _app->log_info().init_offset_in_private_log)\n    {\n        ddebug(\n            \"%s: replay mutation skipped1 as offset is invalid, ballot = %llu, decree = %llu, last_committed_decree = %llu, offset = %lld\",\n            name(),\n            mu->data.header.ballot,\n            d,\n            mu->data.header.last_committed_decree,\n            offset\n            );\n        return false;\n    }\n    \n    if (!is_private && offset < _app->log_info().init_offset_in_shared_log)\n    {\n        ddebug(\n            \"%s: replay mutation skipped2 as offset is invalid, ballot = %llu, decree = %llu, last_committed_decree = %llu, offset = %lld\",\n            name(),\n            mu->data.header.ballot,\n            d,\n            mu->data.header.last_committed_decree,\n            offset\n            );\n        return false;\n    }\n\n    if (d <= last_committed_decree())\n    {\n        ddebug(\n            \"%s: replay mutation skipped3 as decree is outdated, ballot = %llu, decree = %llu, last_committed_decree = %llu, offset = %lld\",\n            name(),\n            mu->data.header.ballot,\n            d,\n            mu->data.header.last_committed_decree,\n            offset\n            );\n        return true;\n    }   \n\n    auto old = _prepare_list->get_mutation_by_decree(d);\n    if (old != nullptr && old->data.header.ballot >= mu->data.header.ballot)\n    {\n        ddebug(\n            \"%s: replay mutation skipped4 as ballot is outdated, ballot = %llu, decree = %llu, last_committed_decree = %llu, offset = %lld\",\n            name(),\n            mu->data.header.ballot,\n            d,\n            mu->data.header.last_committed_decree,\n            offset\n            );\n\n        return true;\n    }\n    \n    if (mu->data.header.ballot > get_ballot())\n    {\n        _config.ballot = mu->data.header.ballot;\n        update_local_configuration(_config, true);\n    }\n\n    ddebug(\n        \"%s: replay mutation ballot = %llu, decree = %llu, last_committed_decree = %llu\",\n        name(),\n        mu->data.header.ballot,\n        d,\n        mu->data.header.last_committed_decree\n        );\n\n    \/\/ prepare\n    error_code err = _prepare_list->prepare(mu, PS_INACTIVE);\n    dassert (err == ERR_OK, \"\");\n\n    \/\/ fix private log completeness when it is from shared\n    if (_private_log && !is_private)\n    {\n        _private_log->append(mu,\n            LPC_WRITE_REPLICATION_LOG,\n            this,\n            [this](error_code err, size_t size)\n        {\n            if (err != ERR_OK)\n            {\n                handle_local_failure(err);\n            }\n        },\n            gpid_to_hash(get_gpid())\n            );\n    }\n\n    return true;\n}\n\nvoid replica::set_inactive_state_transient(bool t)\n{\n    if (status() == PS_INACTIVE)\n    {\n        _inactive_is_transient = t;\n    }\n}\n\nvoid replica::reset_prepare_list_after_replay()\n{\n    \/\/ commit prepare list if possible\n    _prepare_list->commit(_app->last_committed_decree(), COMMIT_TO_DECREE_SOFT);\n\n    \/\/ align the prepare list and the app\n    _prepare_list->truncate(_app->last_committed_decree());\n}\n\n}} \/\/ namespace\n<commit_msg>fix compile problem on linux<commit_after>\/*\n * The MIT License (MIT)\n *\n * Copyright (c) 2015 Microsoft Corporation\n * \n * -=- Robust Distributed System Nucleus (rDSN) -=- \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 * Description:\n *     What is this file about?\n *\n * Revision history:\n *     xxxx-xx-xx, author, first version\n *     xxxx-xx-xx, author, fix bug about xxx\n *\/\n\n#include \"replica.h\"\n#include \"mutation.h\"\n#include \"mutation_log.h\"\n#include \"replica_stub.h\"\n#include <dsn\/internal\/factory_store.h>\n\n# ifdef __TITLE__\n# undef __TITLE__\n# endif\n# define __TITLE__ \"replica.init\"\n\nnamespace dsn { namespace replication {\n\nusing namespace dsn::service;\n\nerror_code replica::initialize_on_new(const char* app_type, global_partition_id gpid)\n{\n    char buffer[256];\n    sprintf(buffer, \"%u.%u.%s\", gpid.app_id, gpid.pidx, app_type);\n\n    _config.gpid = gpid;\n    _dir = utils::filesystem::path_combine(_stub->dir(), buffer);\n\n    sprintf(_name, \"%u.%u@%s\", _config.gpid.app_id, _config.gpid.pidx, _stub->_primary_address.to_string());\n\n    if (dsn::utils::filesystem::directory_exists(_dir) &&\n        !dsn::utils::filesystem::remove_path(_dir))\n    {\n        derror(\"cannot allocate new replica @ %s, as the dir is already exists\", _dir.c_str());\n        return ERR_PATH_ALREADY_EXIST;\n    }\n\n    if (!dsn::utils::filesystem::create_directory(_dir))\n    {\n        dassert(false, \"Fail to create directory %s.\", _dir.c_str());\n        return ERR_FILE_OPERATION_FAILED;\n    }\n\n    error_code err = init_app_and_prepare_list(app_type, true);\n    dassert (err == ERR_OK, \"\");\n    return err;\n}\n\n\/*static*\/ replica* replica::newr(replica_stub* stub, const char* app_type, global_partition_id gpid)\n{\n    replica* rep = new replica(stub, gpid, app_type);\n    error_code err = rep->initialize_on_new(app_type, gpid);\n    if (err == ERR_OK)\n    {\n        dinfo(\"%s: new replica succeed\", rep->name());\n        return rep;\n    }\n    else\n    {\n        dinfo(\"%s: new replica failed: %s\", rep->name(), err.to_string());\n        rep->close();\n        delete rep;\n        return nullptr;\n    }\n}\n\nerror_code replica::initialize_on_load(const char* dir, const char* app_type, bool rename_dir_on_failure)\n{\n    _dir = dir;\n\n    sprintf(_name, \"%u.%u@%s\", _config.gpid.app_id, _config.gpid.pidx, _stub->_primary_address.to_string());\n\n    error_code err = init_app_and_prepare_list(app_type, false);\n\n    if (err != ERR_OK && rename_dir_on_failure)\n    {\n        \/\/ GCed later\n        char newPath[256];\n        sprintf(newPath, \"%s.%llu.err\", dir, static_cast<long long unsigned int>(dsn_now_us()));\n        if (dsn::utils::filesystem::rename_path(dir, newPath, true))\n        {\n            derror(\"move bad replica from '%s' to '%s'\", dir, newPath);\n        }\n        else\n        {\n            err = ERR_FILE_OPERATION_FAILED;\n        }\n    }\n    return err;\n}\n\n\n\/*static*\/ replica* replica::load(replica_stub* stub, const char* dir, bool rename_dir_on_failure)\n{\n    std::string dr(dir);\n    char splitters[] = { '\\\\', '\/', 0 };\n    std::string name = utils::get_last_component(dr, splitters);\n\n    if (name == \"\")\n    {\n        derror(\"invalid replica dir %s\", dir);\n        return nullptr;\n    }\n\n    char app_type[128];\n    global_partition_id gpid;\n    if (3 != sscanf(name.c_str(), \"%u.%u.%s\", &gpid.app_id, &gpid.pidx, app_type))\n    {\n        derror(\"invalid replica dir %s\", dir);\n        return nullptr;\n    }\n\n    replica* rep = new replica(stub, gpid, app_type, dir);\n    error_code err = rep->initialize_on_load(dir, app_type, rename_dir_on_failure);\n    if (err == ERR_OK)\n    {\n        dinfo(\"%s: load replica succeed\", rep->name());\n        return rep;\n    }\n    else\n    {\n        dinfo(\"%s: load replica failed: %s\", rep->name(), err.to_string());\n        rep->close();\n        delete rep;\n        return nullptr;\n    }\n}\n\nerror_code replica::init_app_and_prepare_list(const char* app_type, bool create_new)\n{\n    dassert(nullptr == _app, \"\");\n\n    sprintf(_name, \"%u.%u @ %s\", _config.gpid.app_id, _config.gpid.pidx, primary_address().to_string());\n\n    _app = ::dsn::utils::factory_store<replication_app_base>::create(app_type, PROVIDER_TYPE_MAIN, this);\n    if (nullptr == _app)\n    {\n        return ERR_OBJECT_NOT_FOUND;\n    }\n\n    error_code err = _app->open_internal(\n        this,\n        create_new\n        );\n\n    if (err == ERR_OK)\n    {\n        _prepare_list->reset(_app->last_committed_decree());\n        \n        if (_options->log_enable_private_prepare\n            || !_app->is_delta_state_learning_supported())\n        {\n            dassert(nullptr == _private_log, \"private log must not be initialized yet\");\n\n            std::string log_dir = utils::filesystem::path_combine(dir(), \"log\");\n\n            _private_log = new mutation_log(\n                log_dir,\n                true,\n                _options->log_batch_buffer_MB,\n                _options->log_file_size_mb\n                );\n        }\n\n        \/\/ sync vaid start log offset between app and logs\n        if (create_new)\n        {\n            err = _app->update_log_info(\n                this,\n                _stub->_log->on_partition_reset(get_gpid(), _app->last_committed_decree()),\n                _private_log ? _private_log->on_partition_reset(get_gpid(), _app->last_committed_decree()) : 0\n                );\n        }\n        else\n        {\n            _stub->_log->set_valid_log_offset_before_open(get_gpid(), _app->log_info().init_offset_in_shared_log);\n            if (_private_log)\n                _private_log->set_valid_log_offset_before_open(get_gpid(), _app->log_info().init_offset_in_private_log);\n        }\n\n        \/\/ replay the logs\n        if (nullptr != _private_log)\n        {\n            err = _private_log->open(\n                get_gpid(),\n                [this](mutation_ptr& mu)\n                {\n                    return replay_mutation(mu);\n                }\n            );\n\n            if (err == ERR_OK)\n            {\n                derror(\n                    \"%s: private log initialized, durable = %lld, committed = %lld, maxpd = %llu, ballot = %llu, valid_offset = %lld\",\n                    name(),\n                    _app->last_durable_decree(),\n                    _app->last_committed_decree(),\n                    max_prepared_decree(),\n                    get_ballot(),\n                    _app->log_info().init_offset_in_private_log\n                    );\n                _private_log->check_log_start_offset(get_gpid(), _app->log_info().init_offset_in_private_log);\n                set_inactive_state_transient(true);\n            }\n            \/* in the beginning the prepare_list is reset to the durable_decree *\/\n            else\n            {\n                derror(\n                    \"%s: private log initialized with error, durable = %lld, committed = %lld, maxpd = %llu, ballot = %llu, valid_offset = %lld\",\n                    name(),\n                    _app->last_durable_decree(),\n                    _app->last_committed_decree(),\n                    max_prepared_decree(),\n                    get_ballot(),\n                    _app->log_info().init_offset_in_private_log\n                    );\n\n                set_inactive_state_transient(false);\n\n                _private_log->close();\n                _private_log = nullptr;\n            }\n        }\n\n        if (nullptr == _check_timer && err == ERR_OK)\n        {\n            _check_timer = tasking::enqueue(\n                LPC_PER_REPLICA_CHECK_TIMER,\n                this,\n                &replica::on_check_timer,\n                gpid_to_hash(get_gpid()),\n                0,\n                5 * 60 * 1000 \/\/ check every five mins\n                );\n        }\n    }\n    \n\n    if (err != ERR_OK)\n    {\n        derror( \"%s: open replica failed, error = %s\", name(), err.to_string());\n        _app->close(false);\n        delete _app;\n        _app = nullptr;\n    }\n    \n    return err;\n}\n\n\/\/ return false only when the log is invalid\nbool replica::replay_mutation(mutation_ptr& mu, bool is_private)\n{\n    auto d = mu->data.header.decree;\n    auto offset = mu->data.header.log_offset;\n    if (is_private && offset < _app->log_info().init_offset_in_private_log)\n    {\n        ddebug(\n            \"%s: replay mutation skipped1 as offset is invalid, ballot = %llu, decree = %llu, last_committed_decree = %llu, offset = %lld\",\n            name(),\n            mu->data.header.ballot,\n            d,\n            mu->data.header.last_committed_decree,\n            offset\n            );\n        return false;\n    }\n    \n    if (!is_private && offset < _app->log_info().init_offset_in_shared_log)\n    {\n        ddebug(\n            \"%s: replay mutation skipped2 as offset is invalid, ballot = %llu, decree = %llu, last_committed_decree = %llu, offset = %lld\",\n            name(),\n            mu->data.header.ballot,\n            d,\n            mu->data.header.last_committed_decree,\n            offset\n            );\n        return false;\n    }\n\n    if (d <= last_committed_decree())\n    {\n        ddebug(\n            \"%s: replay mutation skipped3 as decree is outdated, ballot = %llu, decree = %llu, last_committed_decree = %llu, offset = %lld\",\n            name(),\n            mu->data.header.ballot,\n            d,\n            mu->data.header.last_committed_decree,\n            offset\n            );\n        return true;\n    }   \n\n    auto old = _prepare_list->get_mutation_by_decree(d);\n    if (old != nullptr && old->data.header.ballot >= mu->data.header.ballot)\n    {\n        ddebug(\n            \"%s: replay mutation skipped4 as ballot is outdated, ballot = %llu, decree = %llu, last_committed_decree = %llu, offset = %lld\",\n            name(),\n            mu->data.header.ballot,\n            d,\n            mu->data.header.last_committed_decree,\n            offset\n            );\n\n        return true;\n    }\n    \n    if (mu->data.header.ballot > get_ballot())\n    {\n        _config.ballot = mu->data.header.ballot;\n        update_local_configuration(_config, true);\n    }\n\n    ddebug(\n        \"%s: replay mutation ballot = %llu, decree = %llu, last_committed_decree = %llu\",\n        name(),\n        mu->data.header.ballot,\n        d,\n        mu->data.header.last_committed_decree\n        );\n\n    \/\/ prepare\n    error_code err = _prepare_list->prepare(mu, PS_INACTIVE);\n    dassert (err == ERR_OK, \"\");\n\n    \/\/ fix private log completeness when it is from shared\n    if (_private_log && !is_private)\n    {\n        _private_log->append(mu,\n            LPC_WRITE_REPLICATION_LOG,\n            this,\n            [this](error_code err, size_t size)\n        {\n            if (err != ERR_OK)\n            {\n                handle_local_failure(err);\n            }\n        },\n            gpid_to_hash(get_gpid())\n            );\n    }\n\n    return true;\n}\n\nvoid replica::set_inactive_state_transient(bool t)\n{\n    if (status() == PS_INACTIVE)\n    {\n        _inactive_is_transient = t;\n    }\n}\n\nvoid replica::reset_prepare_list_after_replay()\n{\n    \/\/ commit prepare list if possible\n    _prepare_list->commit(_app->last_committed_decree(), COMMIT_TO_DECREE_SOFT);\n\n    \/\/ align the prepare list and the app\n    _prepare_list->truncate(_app->last_committed_decree());\n}\n\n}} \/\/ namespace\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Author: http:\/\/lemming.life\n\/\/ Language: C++\n\/* Challenge Description:\n    Write C++ code for a controller for a stop light at a T-Intersection according to\n    the following rules. The straight part of the intersection runs East-West and receives the heaviest\n    traffic and should be green most often. The intersecting road runs North and only receives light\n    traffic and therefore contains a single sensor to inform the light of the presence of a car.\n    If the sensor is activated for more than 10 seconds the light for the East\/Westbound commuters\n    should turn yellow for 3 seconds, then red. 2 seconds later the light for Northbound commuters\n    should turn green. If the sensor goes inactive for more than 5 seconds the light will then cycle\n    back to be green for East\/West bound commuters. Additionally, the Northbound light will never be\n    green for longer than 40 seconds and the East\/Westbound lights will never be green for less than 30s.\n    Your controller should contain an UpdateController() function that will be called once per second.\n*\/\n\n\/* Notes:\n    - This program was coded on Mac OS X Sierra, using Visual Studio Code.\n    - To compile at terminal: g++ intersection.cpp\n    - To run at terminal: .\/a.out\n    - There is an example simulation in the driver (main function).\n    - The simulation can be changed by changing the state of a sensor and\n      -- by advancing the time by x amount of seconds.\n    - Messages are displayed and can be disabled.\n    - Message format: (time stamp) | (message)\n*\/\n\n#include <iostream>\n#include <vector>\n#include <string>\nusing namespace std;\n\n\/\/ Enums\nenum Color { Green, Yellow, Red };\nenum Operation { LessThanEqual, GreaterThan };\n\n\/\/ A Time Singleton.\n\/\/ - We could also have implemented it as an object and then pass it as needed.\nclass Time {\nprivate:\n    static Time* instance;\n    int currentTime;\n    Time() { currentTime = 0; }\npublic:\n    static Time* getInstance() {\n        return instance != NULL ? instance : (instance = new Time());\n    }\n\n    static void update() { ++(getInstance()->currentTime); }\n    static int getCurrentTime() { return getInstance()->currentTime; }\n};\nTime* Time::instance = NULL;\n\n\n\/\/ Message Singleton to enable\/disable console output.\nclass Messages {\nprivate:\n    static Messages* instance;\n    bool enabled;\n    Messages() { enabled = false; }\npublic:\n    static Messages* getInstance() {\n        return instance != NULL ? instance : (instance = new Messages());\n    }\n\n    static void turnOff() { getInstance()->enabled = false; }\n    static void turnOn() { getInstance()->enabled = true; }\n    static bool areEnabled() { return getInstance()->enabled; }\n};\nMessages* Messages::instance = NULL;\n\n\n\/\/ An object that will clean up any Singletons.\nclass CleanUp {\npublic:\n    ~CleanUp() {\n        delete Time::getInstance();\n        delete Messages::getInstance();\n    }\n};\n\n\n\/\/ Contains data for events for Light objects.\nstruct Event {\npublic:\n    int triggerTime;\n    Color colorToAssign;\n\n    Event(int triggerTime, Color colorToAssign) {\n        this->triggerTime = triggerTime;\n        this->colorToAssign = colorToAssign;\n    }\n};\n\n\n\/\/ Containts constraint data and check for Light objects.\nclass Constraint {\npublic:\n    int color;\n    int timeAmount;\n    Operation operation;\n\n    \/\/ The constraint passed should focus on\n    \/\/ - The color in which the light should be at.\n    \/\/ - The time amount in seconds.\n    \/\/ - The operation desired to be true.\n    \/\/ Example 1:\n    \/\/ -- \"Light x should never be green for less than N seconds\"\n    \/\/ -- Translates to: Constraint(Green, N, GreaterThan)\n    \/\/ Example 2:\n    \/\/ -- \"Light x should never be green for longer than N seconds\"\n    \/\/ -- Transates to: Constraint(Green, N, LessThanEqual)\n    Constraint(Color color, int timeAmount, Operation operation) {\n        this->color = color;\n        this->timeAmount = timeAmount;\n        this->operation = operation;\n    }\n\n    bool isWithin(Color lightColor, int lightTimeCount) {\n        if (color != lightColor) return true;\n\n        bool result = false;\n        switch (operation) {\n            case LessThanEqual:\n                if (lightTimeCount <= timeAmount) { result = true; }\n                break;\n            case GreaterThan:\n                if (lightTimeCount > timeAmount) { result = true; }\n                break;\n            default:\n                result = false;\n                break;\n        }\n        \n        return result;\n    }\n};\n\n\nclass Light {\npublic:\n    Light(string id, Color color, Constraint* constraint) {\n        this->id = id;\n        timeCount = 1;\n        this->constraint = constraint;\n        setColor(color);\n    }\n\n    ~Light() {\n        events.clear();\n        delete constraint;\n    }\n\n    bool isWithinConstraint() {\n        return constraint->isWithin(color, timeCount);\n    }\n    \n    bool isReady() {\n        if (isWithinConstraint()) {\n            return events.size() == 0;\n        }\n        return false;\n    } \n\n    Color getColor() {\n        return color;\n    }\n\n    void setColor(Color color) {\n        this->color = color;\n        if (color == constraint->color) { timeCount = 1; }\n\n        if (Messages::areEnabled()) {\n            cout << Time::getCurrentTime() << \" | Light \" << id << \" changed to \";\n            switch (color) {\n                case Red:\n                    cout << \"red\";      break;\n                case Green:\n                    cout << \"green\";    break;\n                case Yellow:\n                    cout << \"yellow\";   break;\n                default:                break;\n            }\n            cout << \".\\n\";\n        }\n    }\n\n    void addEvent(Event event) {\n        events.push_back(event);\n    }\n\n    void clearEvents() {\n        events.clear();\n        timeCount = 1;\n    }\n\n    void update() {\n        \/\/ Apply events if needed.\n        for (vector<Event>::iterator iter = events.begin(); iter != events.end(); ) {\n            if (iter->triggerTime == Time::getCurrentTime()) {\n                setColor(iter->colorToAssign);\n                iter = events.erase(iter);\n            } else {\n                ++iter;\n            }\n        }\n        \/\/ Keep a count to be used with constraint checks.\n        if (color == constraint->color) { ++timeCount; }\n    }\n    \nprivate:\n    string id;\n    Color color;\n    int timeCount;\n    vector<Event> events;\n    Constraint* constraint;\n};\n\n\n\/\/ The activate() and deactivate() methods must be called by the user\n\/\/ - the controller only checks for the state of the sensor, and updates its timeCount.\nclass Sensor {\npublic:\n    Sensor() { deactivate(); }   \/\/ DRY \n    void update() { ++timeCount; }\n    bool isActive() { return state; }\n    int getTimeCount() { return timeCount; }\n    \n    void activate() {\n        state = true;\n        timeCount = 1;\n        if (Messages::areEnabled()) { cout << Time::getCurrentTime() << \" | Sensor activated.\\n\"; }\n    }\n\n    void deactivate() {\n        state = false;\n        timeCount = 1;\n        if (Messages::areEnabled()) { cout << Time::getCurrentTime() << \" | Sensor deactivated.\\n\"; }\n    }\n\nprivate:\n    bool state;\n    int timeCount;\n};\n\n\/\/ Imagine a world where many controllers exist\n\/\/ - an Interface makes sense, then one can have multiple implementations\n\/\/ - suited for various scenarios.\nclass Controller {\npublic:\n    virtual void UpdateController() {};\n};\n\n\/\/ The implementation.\nclass TController : public Controller {\npublic:\n    TController(Sensor* sensor, Light* lightArms, Light* lightBody) {\n        this->sensor = sensor;\n        this->lightArms = lightArms;\n        this->lightBody = lightBody;\n        bodyActive = false;\n    }\n\n    void UpdateController() {\n\n        \/\/ Neither light is ready for any sensory activation.\n        \/\/ - A light could be handling events, or has failed a time constraint.\n        if (!lightBody->isReady() || !lightArms->isReady()) {\n            if (!lightBody->isWithinConstraint()) {\n                forceChangeLightColor(lightArms, lightBody);\n\n                if (Messages::areEnabled()) {\n                    cout << Time::getCurrentTime()\n                    << \" | N light has been on longer than constraint.\"\n                    << \" Forcing change WE light to green, N light to red.\\n\";\n                }\n            }\n        } else if(lightBody->isReady() && lightArms->isReady()) {\n            \/\/ Both lights ready for sensory input.\n\n            if (sensor->isActive()) {\n                \/\/ When a vehicle is at the sensor, and time specified occurs,\n                \/\/ - Switch N light to to be green, and WE light to be red.\n                if (sensor->getTimeCount() > TIME_ACTIVE_AMOUNT) {\n                    if (lightArms->getColor() == Green && lightBody->getColor() == Red) {\n                        beginChangeLightColor(lightBody, lightArms);\n                        if (Messages::areEnabled()) { cout << Time::getCurrentTime() << \" | Begin changing N light to green, WE light to red.\\n\"; }\n                    }\n                }\n            } else {\n                \/\/ When the N has been inactive for the specified time, switch colors.\n                if (sensor->getTimeCount() > TIME_INACTIVE_AMOUNT) {\n                    if (lightArms->getColor() == Red && lightBody->getColor() == Green) {\n                        beginChangeLightColor(lightArms, lightBody);\n                        if (Messages::areEnabled()) { cout << Time::getCurrentTime() << \" | Begin changing WE light to green, N light to red.\\n\"; }\n                    }\n                }\n            }\n        }\n\n        sensor->update();\n        lightArms->update();\n        lightBody->update();\n        Time::update(); \/\/ If we had more Controller implementations then this is not the place for Time::ipdate()\n    }\n\nprivate:\n    Sensor* sensor;\n    Light* lightArms;\n    Light* lightBody;\n    bool bodyActive;\n    static int TIME_ACTIVE_AMOUNT;\n    static int TIME_INACTIVE_AMOUNT;\n\n    \/\/ Called when a light has failed a constraint.\n    void forceChangeLightColor(Light* lightToGreen, Light* lightToRed) {\n        lightToGreen->clearEvents();\n        lightToRed->clearEvents();\n        beginChangeLightColor(lightToGreen, lightToRed);\n    }\n\n    \/\/ Allows us to schedule events for the specified light.\n    void beginChangeLightColor(Light* lightToGreen, Light* lightToRed) {\n        lightToRed->addEvent( Event(Time::getCurrentTime(), Yellow) );\n        lightToRed->addEvent( Event(Time::getCurrentTime() + 3, Red) );\n        lightToGreen->addEvent( Event(Time::getCurrentTime() + 5, Green) );\n    }\n};\nint TController::TIME_ACTIVE_AMOUNT = 10;\nint TController::TIME_INACTIVE_AMOUNT = 5;\n\n\n\/\/ The class helps us run our simulation.\nclass Scene {\npublic:\n    Scene(Controller* controller) {\n        this->controller = controller;\n    }\n\n    void advanceBy(int seconds) {\n        int secondsElapsed = 0;\n        while(secondsElapsed < seconds) {\n            controller->UpdateController();\n            \/\/ Time::update(); \/\/ If we had multiple controllers this would be an ideal spot for time updating.\n            ++secondsElapsed;\n        }\n    }\n\n    \n    \/\/ For real seconds, we do something like this:\n    \/*\n    \/\/ Add this to the includes section\n    #include <time.h>\n\n    \/\/ Use this function similaly to advanceBy() method.\n    void advanceRealBy(int seconds) {\n        int secondsElapsed = 0;\n        clock_t t1, t2;\n\n        t1 = clock();\n        while (secondsElapsed < seconds) {\n            t2 = clock();\n            if (t2 - t1 > CLOCKS_PER_SEC) {\n                controller->UpdateController();\n                \/\/ Time::update(); \/\/ If we had multiple controllers\n                t1 = clock();\n                ++secondsElapsed;\n            }\n        }\n    }\n    \/\/ But the advanceBy() is just a faster simulation.\n    *\/\nprivate:\n    Controller* controller;\n};\n\n\n\/\/ Driver\nint main() {\n    Messages::turnOn(); \/\/ Comment out to disable all cout messages.\n\n    \/\/ Setup T-Intersection\n    Sensor* sensor = new Sensor();\n    Light* lightArms = new Light(\"WE\", Green, new Constraint(Green, 30, GreaterThan)); \/\/ WE never less than 30\n    Light* lightBody = new Light(\"N\", Red, new Constraint(Green, 40, LessThanEqual)); \/\/ N never longer than 40\n    Controller* tController = new TController(sensor, lightArms, lightBody); \/\/ Program to an interface\n\n    \/\/ Run a simulation\n    Scene scene(tController);\n    scene.advanceBy(30);\n    sensor->activate();\n    scene.advanceBy(15);\n    sensor->deactivate();\n    scene.advanceBy(100);\n    sensor->activate();\n    scene.advanceBy(100);\n    sensor->deactivate();\n    scene.advanceBy(50);\n\n    \/\/ Deadlocate memory\n    delete lightBody;\n    delete lightArms;\n    delete sensor;\n    delete tController;\n\n    CleanUp clean; \/\/ Gets rid of Singletons when out of scope.\n    return 0;\n}<commit_msg>T-Intersection in C++.<commit_after>\/\/ Author: http:\/\/lemming.life\n\/\/ Language: C++\n\/\/ Title: T-Intersection\n\/* Challenge Description:\n    Write C++ code for a controller for a stop light at a T-Intersection according to\n    the following rules. The straight part of the intersection runs East-West and receives the heaviest\n    traffic and should be green most often. The intersecting road runs North and only receives light\n    traffic and therefore contains a single sensor to inform the light of the presence of a car.\n    If the sensor is activated for more than 10 seconds the light for the East\/Westbound commuters\n    should turn yellow for 3 seconds, then red. 2 seconds later the light for Northbound commuters\n    should turn green. If the sensor goes inactive for more than 5 seconds the light will then cycle\n    back to be green for East\/West bound commuters. Additionally, the Northbound light will never be\n    green for longer than 40 seconds and the East\/Westbound lights will never be green for less than 30s.\n    Your controller should contain an UpdateController() function that will be called once per second.\n*\/\n\n\/* Notes:\n    - This program was coded on Mac OS X Sierra, using Visual Studio Code.\n    - To compile at terminal: g++ intersection.cpp\n    - To run at terminal: .\/a.out\n    - There is an example simulation in the driver (main function).\n    - The simulation can be changed by changing the state of a sensor and\n      -- by advancing the time by x amount of seconds.\n    - Messages are displayed and can be disabled.\n    - Message format: (time stamp) | (message)\n*\/\n\n#include <iostream>\n#include <vector>\n#include <string>\nusing namespace std;\n\n\/\/ Enums\nenum Color { Green, Yellow, Red };\nenum Operation { LessThanEqual, GreaterThan };\n\n\/\/ A Time Singleton.\n\/\/ - We could also have implemented it as an object and then pass it as needed.\nclass Time {\nprivate:\n    static Time* instance;\n    int currentTime;\n    Time() { currentTime = 0; }\npublic:\n    static Time* getInstance() {\n        return instance != NULL ? instance : (instance = new Time());\n    }\n\n    static void update() { ++(getInstance()->currentTime); }\n    static int getCurrentTime() { return getInstance()->currentTime; }\n};\nTime* Time::instance = NULL;\n\n\n\/\/ Message Singleton to enable\/disable console output.\nclass Messages {\nprivate:\n    static Messages* instance;\n    bool enabled;\n    Messages() { enabled = false; }\npublic:\n    static Messages* getInstance() {\n        return instance != NULL ? instance : (instance = new Messages());\n    }\n\n    static void turnOff() { getInstance()->enabled = false; }\n    static void turnOn() { getInstance()->enabled = true; }\n    static bool areEnabled() { return getInstance()->enabled; }\n};\nMessages* Messages::instance = NULL;\n\n\n\/\/ An object that will clean up any Singletons.\nclass CleanUp {\npublic:\n    ~CleanUp() {\n        delete Time::getInstance();\n        delete Messages::getInstance();\n    }\n};\n\n\n\/\/ Contains data for events for Light objects.\nstruct Event {\npublic:\n    int triggerTime;\n    Color colorToAssign;\n\n    Event(int triggerTime, Color colorToAssign) {\n        this->triggerTime = triggerTime;\n        this->colorToAssign = colorToAssign;\n    }\n};\n\n\n\/\/ Containts constraint data and check for Light objects.\nclass Constraint {\npublic:\n    int color;\n    int timeAmount;\n    Operation operation;\n\n    \/\/ The constraint passed should focus on\n    \/\/ - The color in which the light should be at.\n    \/\/ - The time amount in seconds.\n    \/\/ - The operation desired to be true.\n    \/\/ Example 1:\n    \/\/ -- \"Light x should never be green for less than N seconds\"\n    \/\/ -- Translates to: Constraint(Green, N, GreaterThan)\n    \/\/ Example 2:\n    \/\/ -- \"Light x should never be green for longer than N seconds\"\n    \/\/ -- Transates to: Constraint(Green, N, LessThanEqual)\n    Constraint(Color color, int timeAmount, Operation operation) {\n        this->color = color;\n        this->timeAmount = timeAmount;\n        this->operation = operation;\n    }\n\n    bool isWithin(Color lightColor, int lightTimeCount) {\n        if (color != lightColor) return true;\n\n        bool result = false;\n        switch (operation) {\n            case LessThanEqual:\n                if (lightTimeCount <= timeAmount) { result = true; }\n                break;\n            case GreaterThan:\n                if (lightTimeCount > timeAmount) { result = true; }\n                break;\n            default:\n                result = false;\n                break;\n        }\n        \n        return result;\n    }\n};\n\n\nclass Light {\npublic:\n    Light(string id, Color color, Constraint* constraint) {\n        this->id = id;\n        timeCount = 1;\n        this->constraint = constraint;\n        setColor(color);\n    }\n\n    ~Light() {\n        events.clear();\n        delete constraint;\n    }\n\n    bool isWithinConstraint() {\n        return constraint->isWithin(color, timeCount);\n    }\n    \n    bool isReady() {\n        if (isWithinConstraint()) {\n            return events.size() == 0;\n        }\n        return false;\n    } \n\n    Color getColor() {\n        return color;\n    }\n\n    void setColor(Color color) {\n        this->color = color;\n        if (color == constraint->color) { timeCount = 1; }\n\n        if (Messages::areEnabled()) {\n            cout << Time::getCurrentTime() << \" | Light \" << id << \" changed to \";\n            switch (color) {\n                case Red:\n                    cout << \"red\";      break;\n                case Green:\n                    cout << \"green\";    break;\n                case Yellow:\n                    cout << \"yellow\";   break;\n                default:                break;\n            }\n            cout << \".\\n\";\n        }\n    }\n\n    void addEvent(Event event) {\n        events.push_back(event);\n    }\n\n    void clearEvents() {\n        events.clear();\n        timeCount = 1;\n    }\n\n    void update() {\n        \/\/ Apply events if needed.\n        for (vector<Event>::iterator iter = events.begin(); iter != events.end(); ) {\n            if (iter->triggerTime == Time::getCurrentTime()) {\n                setColor(iter->colorToAssign);\n                iter = events.erase(iter);\n            } else {\n                ++iter;\n            }\n        }\n        \/\/ Keep a count to be used with constraint checks.\n        if (color == constraint->color) { ++timeCount; }\n    }\n    \nprivate:\n    string id;\n    Color color;\n    int timeCount;\n    vector<Event> events;\n    Constraint* constraint;\n};\n\n\n\/\/ The activate() and deactivate() methods must be called by the user\n\/\/ - the controller only checks for the state of the sensor, and updates its timeCount.\nclass Sensor {\npublic:\n    Sensor() { deactivate(); }   \/\/ DRY \n    void update() { ++timeCount; }\n    bool isActive() { return state; }\n    int getTimeCount() { return timeCount; }\n    \n    void activate() {\n        state = true;\n        timeCount = 1;\n        if (Messages::areEnabled()) { cout << Time::getCurrentTime() << \" | Sensor activated.\\n\"; }\n    }\n\n    void deactivate() {\n        state = false;\n        timeCount = 1;\n        if (Messages::areEnabled()) { cout << Time::getCurrentTime() << \" | Sensor deactivated.\\n\"; }\n    }\n\nprivate:\n    bool state;\n    int timeCount;\n};\n\n\/\/ Imagine a world where many controllers exist\n\/\/ - an Interface makes sense, then one can have multiple implementations\n\/\/ - suited for various scenarios.\nclass Controller {\npublic:\n    virtual void UpdateController() {};\n};\n\n\/\/ The implementation.\nclass TController : public Controller {\npublic:\n    TController(Sensor* sensor, Light* lightArms, Light* lightBody) {\n        this->sensor = sensor;\n        this->lightArms = lightArms;\n        this->lightBody = lightBody;\n        bodyActive = false;\n    }\n\n    void UpdateController() {\n\n        \/\/ Neither light is ready for any sensory activation.\n        \/\/ - A light could be handling events, or has failed a time constraint.\n        if (!lightBody->isReady() || !lightArms->isReady()) {\n            if (!lightBody->isWithinConstraint()) {\n                forceChangeLightColor(lightArms, lightBody);\n\n                if (Messages::areEnabled()) {\n                    cout << Time::getCurrentTime()\n                    << \" | N light has been on longer than constraint.\"\n                    << \" Forcing change WE light to green, N light to red.\\n\";\n                }\n            }\n        } else if(lightBody->isReady() && lightArms->isReady()) {\n            \/\/ Both lights ready for sensory input.\n\n            if (sensor->isActive()) {\n                \/\/ When a vehicle is at the sensor, and time specified occurs,\n                \/\/ - Switch N light to to be green, and WE light to be red.\n                if (sensor->getTimeCount() > TIME_ACTIVE_AMOUNT) {\n                    if (lightArms->getColor() == Green && lightBody->getColor() == Red) {\n                        beginChangeLightColor(lightBody, lightArms);\n                        if (Messages::areEnabled()) { cout << Time::getCurrentTime() << \" | Begin changing N light to green, WE light to red.\\n\"; }\n                    }\n                }\n            } else {\n                \/\/ When the N has been inactive for the specified time, switch colors.\n                if (sensor->getTimeCount() > TIME_INACTIVE_AMOUNT) {\n                    if (lightArms->getColor() == Red && lightBody->getColor() == Green) {\n                        beginChangeLightColor(lightArms, lightBody);\n                        if (Messages::areEnabled()) { cout << Time::getCurrentTime() << \" | Begin changing WE light to green, N light to red.\\n\"; }\n                    }\n                }\n            }\n        }\n\n        sensor->update();\n        lightArms->update();\n        lightBody->update();\n        Time::update(); \/\/ If we had more Controller implementations then this is not the place for Time::ipdate()\n    }\n\nprivate:\n    Sensor* sensor;\n    Light* lightArms;\n    Light* lightBody;\n    bool bodyActive;\n    static int TIME_ACTIVE_AMOUNT;\n    static int TIME_INACTIVE_AMOUNT;\n\n    \/\/ Called when a light has failed a constraint.\n    void forceChangeLightColor(Light* lightToGreen, Light* lightToRed) {\n        lightToGreen->clearEvents();\n        lightToRed->clearEvents();\n        beginChangeLightColor(lightToGreen, lightToRed);\n    }\n\n    \/\/ Allows us to schedule events for the specified light.\n    void beginChangeLightColor(Light* lightToGreen, Light* lightToRed) {\n        lightToRed->addEvent( Event(Time::getCurrentTime(), Yellow) );\n        lightToRed->addEvent( Event(Time::getCurrentTime() + 3, Red) );\n        lightToGreen->addEvent( Event(Time::getCurrentTime() + 5, Green) );\n    }\n};\nint TController::TIME_ACTIVE_AMOUNT = 10;\nint TController::TIME_INACTIVE_AMOUNT = 5;\n\n\n\/\/ The class helps us run our simulation.\nclass Scene {\npublic:\n    Scene(Controller* controller) {\n        this->controller = controller;\n    }\n\n    void advanceBy(int seconds) {\n        int secondsElapsed = 0;\n        while(secondsElapsed < seconds) {\n            controller->UpdateController();\n            \/\/ Time::update(); \/\/ If we had multiple controllers this would be an ideal spot for time updating.\n            ++secondsElapsed;\n        }\n    }\n\n    \n    \/\/ For real seconds, we do something like this:\n    \/*\n    \/\/ Add this to the includes section\n    #include <time.h>\n\n    \/\/ Use this function similaly to advanceBy() method.\n    void advanceRealBy(int seconds) {\n        int secondsElapsed = 0;\n        clock_t t1, t2;\n\n        t1 = clock();\n        while (secondsElapsed < seconds) {\n            t2 = clock();\n            if (t2 - t1 > CLOCKS_PER_SEC) {\n                controller->UpdateController();\n                \/\/ Time::update(); \/\/ If we had multiple controllers\n                t1 = clock();\n                ++secondsElapsed;\n            }\n        }\n    }\n    \/\/ But the advanceBy() is just a faster simulation.\n    *\/\nprivate:\n    Controller* controller;\n};\n\n\n\/\/ Driver\nint main() {\n    Messages::turnOn(); \/\/ Comment out to disable all cout messages.\n\n    \/\/ Setup T-Intersection\n    Sensor* sensor = new Sensor();\n    Light* lightArms = new Light(\"WE\", Green, new Constraint(Green, 30, GreaterThan)); \/\/ WE never less than 30\n    Light* lightBody = new Light(\"N\", Red, new Constraint(Green, 40, LessThanEqual)); \/\/ N never longer than 40\n    Controller* tController = new TController(sensor, lightArms, lightBody); \/\/ Program to an interface\n\n    \/\/ Run a simulation\n    Scene scene(tController);\n    scene.advanceBy(30);\n    sensor->activate();\n    scene.advanceBy(15);\n    sensor->deactivate();\n    scene.advanceBy(100);\n    sensor->activate();\n    scene.advanceBy(100);\n    sensor->deactivate();\n    scene.advanceBy(50);\n\n    \/\/ Deadlocate memory\n    delete lightBody;\n    delete lightArms;\n    delete sensor;\n    delete tController;\n\n    CleanUp clean; \/\/ Gets rid of Singletons when out of scope.\n    return 0;\n}<|endoftext|>"}
{"text":"<commit_before>#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <pthread.h>\n\/\/#include \"carbon_user.h\"\n\/\/#include <time.h>\n\/\/#include <sys\/timeb.h>\n\n#define MAX            100000000\n#define INT_MAX        100000000\n\/\/ #define DEBUG              1\n#define BILLION 1E9\n\n\nint _W[8][8] =\n{\n  {0,   2,      1,      17,     MAX,    MAX,    MAX,    MAX},\n  {2,   0,      MAX,    MAX,    2,      6,      MAX,    MAX},\n  {1,   MAX,    0,      MAX,    MAX,    MAX,    MAX,    8},\n  {17,  MAX,    MAX,    0,      MAX,    2,      1,      9},\n  {MAX, 2,      MAX,    MAX,    0,      4,      MAX,    MAX},\n  {MAX, 6,      MAX,    2,      4,      0,      5,      MAX},\n  {MAX, MAX,    MAX,    1,      MAX,    5,      0,      3},\n  {MAX, MAX,    8,      9,      MAX,    MAX,    3,      0}\n};\n\nint min = INT_MAX;\nint min_index = 0;\npthread_mutex_t lock;\npthread_mutex_t locks[4194304];\nint u = 0;\n\n\n  void init_weights(int N, int DEG, int** W, int** W_index)\n  {\n          int range = DEG + (N - DEG)\/16;\n  \n          \/\/ Initialize to -1\n          for(int i = 0; i < N; i++)\n                  for(int j = 0; j < DEG; j++)\n                          W_index[i][j]= -1;\n  \n          \/\/ Populate Index Array\n          for(int i = 0; i < N; i++)\n          {\n                  int last = 0;\n                  int min = 0;\n                  int max = DEG;\n                  for(int j = 0; j < DEG; j++)\n                  {\n                          if(W_index[i][j] == -1)\n                          {\n                                  int neighbor = i + j;\/\/rand()%(max);\n                                  if(neighbor > last)\n                                  {\n                                          W_index[i][j] = neighbor;\n                                          last = W_index[i][j];\n                                  }\n                                  else\n                                  {\n                                          if(last < (N-1))\n                                          {\n                                                  W_index[i][j] = (last + 1);\n                                                  last = W_index[i][j];\n                                          }\n                                  }\n                          }\n                          else\n                          {\n                                  last = W_index[i][j];\n                          }\n                          if(W_index[i][j]>=N)\n                          {\n                                  W_index[i][j] = N-1;\n                          }\n                  }\n          }\n  \n          \/\/ Populate Cost Array\n          for(int i = 0; i < N; i++)\n          {\n                  for(int j = 0; j < DEG; j++)\n                  {\n                          double v = drand48();\n                          \/*if(v > 0.8 || W_index[i][j] == -1)\n                          {       W[i][j] = MAX;\n                                  W_index[i][j] = -1;\n                          }\n  \n                          else*\/ if(W_index[i][j] == i)\n                                  W[i][j] = 0;\n  \n                          else\n                                  W[i][j] = (int) (v*100) + 1;\n                          \/\/printf(\"   %d  \",W_index[i][j]);\n                  }\n                  \/\/printf(\"\\n\");\n          }\n  }\n\n\n\n\n\nint initialize_single_source(int* D, int* Q, int source, int N);\nvoid relax(int u, int i, volatile int* D, int** W, int** W_index, int N);\nint get_local_min(volatile int* Q, volatile int* D, int start, int stop, int N, int** W_index, int** W, int u);\n\ntypedef struct\n{\n  int*      local_min;\n  int*      global_min;\n  int*      Q;\n  int*      D;\n  int**     W;\n  int**     W_index;\n  int*      d_count;\n  int       tid;\n  int       P;\n  int       N;\n  int       DEG;\n  pthread_barrier_t* barrier_total;\n\tpthread_barrier_t* barrier;\n} thread_arg_t;\n\nint local_min_buffer[1024];\nint global_min_buffer;\nint terminate = 0;\nint range=1;\nint old_range =1;\nint difference=0;\nint pid=0;\nint next_source = -1;\nint start = 64;\nint P_global = 256;\nthread_arg_t thread_arg[1024];\npthread_t   thread_handle[1024];\n\nvoid* do_work(void* args)\n{\n  volatile thread_arg_t* arg = (thread_arg_t*) args;\n\n  volatile int* count      = arg->d_count;\n  volatile int* global_min = arg->global_min;\n  volatile int* local_min  = arg->local_min;\n  int tid                  = arg->tid;\n  int P                    = arg->P;\n  \/\/volatile int* Q          = arg->Q;\n  \/\/int* D                   = arg->D;\n  int** W                  = arg->W;\n  int** W_index            = arg->W_index;\n  const int N              = arg->N;\n  const int DEG            = arg->DEG;\n  int local_count          = N;\n  int i, j, po;\n\tint uu = 0;\n\tP_global = start;\n\n\tint* D;\n\tint* Q;\n\n\tposix_memalign((void**) &D, 64, N * sizeof(int));\n\tposix_memalign((void**) &Q, 64, N * sizeof(int));\n\n\tfor(int i=0;i<N;i++)\n\t{\n\t\tD[i] = INT_MAX;\n\t\tQ[i] = 1;\n\t}\n\tD[0]=0;\n\n  int a = 0;\n  int i_start =  0;  \/\/tid    * DEG \/ (arg->P);\n  int i_stop  = 0;   \/\/(tid+1) * DEG \/ (arg->P);\n\tint start = 0;\n\tint stop = 1;\n\tint node = 0;\n\n\tpthread_barrier_wait(arg->barrier_total);\n\n  while(node<N)\n  {\n\n     pthread_mutex_lock(&lock); \n\t\t next_source++;\n\t\t node = next_source;\n\t\t \/\/printf(\"\\n %d\",next_source);\n\t\t pthread_mutex_unlock(&lock);\n\n\t    for(uu=0;uu<N;uu++)\n\t\t  {\n        for(int i = 0; i < DEG; i++)\n        {\n\n\t\t\t    if((D[W_index[uu][i]] > (D[uu] + W[uu][i])))\n\t\t\t\t    D[W_index[uu][i]] = D[uu] + W[uu][i];\n          \n\t\t\t\t\tQ[uu]=0;\/\/ po=u;\n        }\n\t\t  }\n\n\t}\n\n\tpthread_barrier_wait(arg->barrier_total);\n  \/\/printf(\"\\n tid:%d\",tid);\n\n\t\/*for(int i=0;i<N;i++)\n\t{\n\t\tprintf(\" %d \",D[i]);\n\t}*\/\n\n\n\treturn NULL;\n}\n\n\nint main(int argc, char** argv)\n{ \/\/int mul = W_index[0][0];\n  \/\/ Start the simulator\n  \/\/CarbonStartSim(argc, argv);\n\n  const int P1 = 1;\/\/atoi(argv[1]);\n  const int N = atoi(argv[1]);\n  const int DEG = atoi(argv[2]);\n\n\tint P = 256;\n\tstart = P1;\n\tP = P1;\n\n\n        if (DEG > N)\n        {\n                fprintf(stderr, \"Degree of graph cannot be grater than number of Vertices\\n\");\n                exit(EXIT_FAILURE);\n        }\n\n  \/\/int* D;\n  \/\/int* Q;\n  \/\/posix_memalign((void**) &D, 64, N * sizeof(int));\n  \/\/posix_memalign((void**) &Q, 64, N * sizeof(int));\n  int d_count = N;\n  pthread_barrier_t barrier_total;\n\tpthread_barrier_t barrier;\n\n  int** W = (int**) malloc(N*sizeof(int*));\n  int** W_index = (int**) malloc(N*sizeof(int*));\n  for(int i = 0; i < N; i++)\n  {\n    \/\/W[i] = (int *)malloc(sizeof(int)*N);\n    int ret = posix_memalign((void**) &W[i], 64, DEG*sizeof(int));\n    int re1 = posix_memalign((void**) &W_index[i], 64, DEG*sizeof(int));\n    if (ret != 0 || re1!=0)\n    {\n       fprintf(stderr, \"Could not allocate memory\\n\");\n       exit(EXIT_FAILURE);\n    }\n  }\n  init_weights(N, DEG, W, W_index);\n  \/*for(int i = 0;i<N;i++)\n  {\n        for(int j = 0;j<N;j++)\n        {\n                printf(\" %d \",W[i][j]);\n        }\n        printf(\"\\n\");\n  }*\/\n\n  pthread_barrier_init(&barrier_total, NULL, P1);\n\tpthread_barrier_init(&barrier, NULL, P1);\n\n  pthread_mutex_init(&lock, NULL);\n\t\n\tfor(int i=0; i<2097152; i++)\n\t\tpthread_mutex_init(&locks[i], NULL);\n  \n\t\/\/initialize_single_source(D, Q, 0, N);\n\n  for(int j = 0; j < P1; j++) {\n    thread_arg[j].local_min  = local_min_buffer;\n    thread_arg[j].global_min = &global_min_buffer;\n    \/\/thread_arg[j].Q          = Q;\n    \/\/thread_arg[j].D          = D;\n    thread_arg[j].W          = W;\n    thread_arg[j].W_index    = W_index;\n    thread_arg[j].d_count    = &d_count;\n    thread_arg[j].tid        = j;\n    thread_arg[j].P          = P;\n    thread_arg[j].N          = N;\n    thread_arg[j].DEG        = DEG;\n    thread_arg[j].barrier_total = &barrier_total;\n\t\tthread_arg[j].barrier    = &barrier;\n  }\nint mul = 2;\n  \/\/ Enable performance and energy models\n  \/\/CarbonEnableModels();\n\n\/\/struct timespec requestStart, requestEnd;\n\/\/clock_gettime(CLOCK_REALTIME, &requestStart);\n\n  for(int j = 1; j < P1; j++) {\n    pthread_create(thread_handle+j,\n                   NULL,\n                   do_work,\n                   (void*)&thread_arg[j]);\n  }\n  do_work((void*) &thread_arg[0]);\n\n  printf(\"Threads Returned!\");\n\n  for(int j = 1; j < P1; j++) { \/\/mul = mul*2;\n    pthread_join(thread_handle[j],NULL);\n  }\n\n\tprintf(\"Threads Joined!\");\n\n\t\/\/clock_gettime(CLOCK_REALTIME, &requestEnd);\n\t\/\/  double accum = ( requestEnd.tv_sec - requestStart.tv_sec ) + ( requestEnd.tv_nsec - requestStart.tv_nsec ) \/ BILLION;\n\t\/\/\t  printf( \"%lf\\n\", accum );\n\n  \/\/ Enable performance and energy models\n  \/\/CarbonDisableModels();\n  \/\/printf(\"\\ndistance:%d \\n\",D[N-1]);\n\n    \/*for(int i = 0; i < N; i++) {\n      printf(\" %d \", D[i]);\n    }\n    printf(\"\\n\");\n*\/\n  \/\/ Stop the simulator\n  \/\/CarbonStopSim();\n  return 0;\n}\n\nint initialize_single_source(int*  D,\n                             int*  Q,\n                             int   source,\n                             int   N)\n{\n  for(int i = 0; i < N+1; i++)\n  {\n    D[i] = INT_MAX;\n    Q[i] = 1;\n  }\n\n  D[source] = 0;\n  return 0;\n}\n\nint get_local_min(volatile int* Q, volatile int* D, int start, int stop, int N, int** W_index, int** W, int u)\n{\n  int min = INT_MAX;\n  int min_index = N;\n\n  for(int i = start; i < stop; i++) \n  {\n    if(D[i] < min && Q[i]) \n    {\n      min = D[i];\n      min_index = W_index[u][i];\n    }\n  }\n  return min_index;\n}\n\nvoid relax(int u, int i, volatile int* D, int** W, int** W_index, int N)\n{\n  if((D[W_index[u][i]] > (D[u] + W[u][i]) && (W_index[u][i]!=-1 && W_index[u][i]<N && W[u][i]!=INT_MAX)))\n    D[W_index[u][i]] = D[u] + W[u][i];\n}\n<commit_msg>spaces fixed<commit_after>#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <pthread.h>\n\/\/#include \"carbon_user.h\"\n\/\/#include <time.h>\n\/\/#include <sys\/timeb.h>\n\n#define MAX            100000000\n#define INT_MAX        100000000\n\/\/ #define DEBUG              1\n#define BILLION 1E9\n\n\nint _W[8][8] =\n{\n  {0,   2,      1,      17,     MAX,    MAX,    MAX,    MAX},\n  {2,   0,      MAX,    MAX,    2,      6,      MAX,    MAX},\n  {1,   MAX,    0,      MAX,    MAX,    MAX,    MAX,    8},\n  {17,  MAX,    MAX,    0,      MAX,    2,      1,      9},\n  {MAX, 2,      MAX,    MAX,    0,      4,      MAX,    MAX},\n  {MAX, 6,      MAX,    2,      4,      0,      5,      MAX},\n  {MAX, MAX,    MAX,    1,      MAX,    5,      0,      3},\n  {MAX, MAX,    8,      9,      MAX,    MAX,    3,      0}\n};\n\nint min = INT_MAX;\nint min_index = 0;\npthread_mutex_t lock;\npthread_mutex_t locks[4194304];\nint u = 0;\n\n\n  void init_weights(int N, int DEG, int** W, int** W_index)\n  {\n          int range = DEG + (N - DEG)\/16;\n  \n          \/\/ Initialize to -1\n          for(int i = 0; i < N; i++)\n                  for(int j = 0; j < DEG; j++)\n                          W_index[i][j]= -1;\n  \n          \/\/ Populate Index Array\n          for(int i = 0; i < N; i++)\n          {\n                  int last = 0;\n                  int min = 0;\n                  int max = DEG;\n                  for(int j = 0; j < DEG; j++)\n                  {\n                          if(W_index[i][j] == -1)\n                          {\n                                  int neighbor = i + j;\/\/rand()%(max);\n                                  if(neighbor > last)\n                                  {\n                                          W_index[i][j] = neighbor;\n                                          last = W_index[i][j];\n                                  }\n                                  else\n                                  {\n                                          if(last < (N-1))\n                                          {\n                                                  W_index[i][j] = (last + 1);\n                                                  last = W_index[i][j];\n                                          }\n                                  }\n                          }\n                          else\n                          {\n                                  last = W_index[i][j];\n                          }\n                          if(W_index[i][j]>=N)\n                          {\n                                  W_index[i][j] = N-1;\n                          }\n                  }\n          }\n  \n          \/\/ Populate Cost Array\n          for(int i = 0; i < N; i++)\n          {\n                  for(int j = 0; j < DEG; j++)\n                  {\n                          double v = drand48();\n                          \/*if(v > 0.8 || W_index[i][j] == -1)\n                          {       W[i][j] = MAX;\n                                  W_index[i][j] = -1;\n                          }\n  \n                          else*\/ if(W_index[i][j] == i)\n                                  W[i][j] = 0;\n  \n                          else\n                                  W[i][j] = (int) (v*100) + 1;\n                          \/\/printf(\"   %d  \",W_index[i][j]);\n                  }\n                  \/\/printf(\"\\n\");\n          }\n  }\n\n\n\n\n\nint initialize_single_source(int* D, int* Q, int source, int N);\nvoid relax(int u, int i, volatile int* D, int** W, int** W_index, int N);\nint get_local_min(volatile int* Q, volatile int* D, int start, int stop, int N, int** W_index, int** W, int u);\n\ntypedef struct\n{\n  int*      local_min;\n  int*      global_min;\n  int*      Q;\n  int*      D;\n  int**     W;\n  int**     W_index;\n  int*      d_count;\n  int       tid;\n  int       P;\n  int       N;\n  int       DEG;\n  pthread_barrier_t* barrier_total;\n  pthread_barrier_t* barrier;\n} thread_arg_t;\n\nint local_min_buffer[1024];\nint global_min_buffer;\nint terminate = 0;\nint range=1;\nint old_range =1;\nint difference=0;\nint pid=0;\nint next_source = -1;\nint start = 64;\nint P_global = 256;\nthread_arg_t thread_arg[1024];\npthread_t   thread_handle[1024];\n\nvoid* do_work(void* args)\n{\n  volatile thread_arg_t* arg = (thread_arg_t*) args;\n\n  volatile int* count      = arg->d_count;\n  volatile int* global_min = arg->global_min;\n  volatile int* local_min  = arg->local_min;\n  int tid                  = arg->tid;\n  int P                    = arg->P;\n  \/\/volatile int* Q          = arg->Q;\n  \/\/int* D                   = arg->D;\n  int** W                  = arg->W;\n  int** W_index            = arg->W_index;\n  const int N              = arg->N;\n  const int DEG            = arg->DEG;\n  int local_count          = N;\n  int i, j, po;\n  int uu = 0;\n  P_global = start;\n\n  int* D;\n  int* Q;\n\n  posix_memalign((void**) &D, 64, N * sizeof(int));\n  posix_memalign((void**) &Q, 64, N * sizeof(int));\n\n  for(int i=0;i<N;i++)\n  {\n    D[i] = INT_MAX;\n    Q[i] = 1;\n  }\n  D[0]=0;\n\n  int a = 0;\n  int i_start =  0;  \/\/tid    * DEG \/ (arg->P);\n  int i_stop  = 0;   \/\/(tid+1) * DEG \/ (arg->P);\n  int start = 0;\n  int stop = 1;\n  int node = 0;\n\n  pthread_barrier_wait(arg->barrier_total);\n\n  while(node<N)\n  {\n     pthread_mutex_lock(&lock); \n     next_source++;\n     node = next_source;\n     \/\/printf(\"\\n %d\",next_source);\n     pthread_mutex_unlock(&lock);\n\n     for(uu=0;uu<N;uu++)\n     {\n       for(int i = 0; i < DEG; i++)\n       {\n         if((D[W_index[uu][i]] > (D[uu] + W[uu][i])))\n           D[W_index[uu][i]] = D[uu] + W[uu][i];\n          \n         Q[uu]=0;\/\/ po=u;\n       }\n      }\n  }\n\n  pthread_barrier_wait(arg->barrier_total);\n\n  return NULL;\n}\n\n\nint main(int argc, char** argv)\n{ \/\/int mul = W_index[0][0];\n  \/\/ Start the simulator\n  \/\/CarbonStartSim(argc, argv);\n\n  const int P1 = 1;\/\/atoi(argv[1]);\n  const int N = atoi(argv[1]);\n  const int DEG = atoi(argv[2]);\n\n\tint P = 256;\n\tstart = P1;\n\tP = P1;\n\n\n        if (DEG > N)\n        {\n                fprintf(stderr, \"Degree of graph cannot be grater than number of Vertices\\n\");\n                exit(EXIT_FAILURE);\n        }\n\n  \/\/int* D;\n  \/\/int* Q;\n  \/\/posix_memalign((void**) &D, 64, N * sizeof(int));\n  \/\/posix_memalign((void**) &Q, 64, N * sizeof(int));\n  int d_count = N;\n  pthread_barrier_t barrier_total;\n  pthread_barrier_t barrier;\n\n  int** W = (int**) malloc(N*sizeof(int*));\n  int** W_index = (int**) malloc(N*sizeof(int*));\n  for(int i = 0; i < N; i++)\n  {\n    \/\/W[i] = (int *)malloc(sizeof(int)*N);\n    int ret = posix_memalign((void**) &W[i], 64, DEG*sizeof(int));\n    int re1 = posix_memalign((void**) &W_index[i], 64, DEG*sizeof(int));\n    if (ret != 0 || re1!=0)\n    {\n       fprintf(stderr, \"Could not allocate memory\\n\");\n       exit(EXIT_FAILURE);\n    }\n  }\n  init_weights(N, DEG, W, W_index);\n  \/*for(int i = 0;i<N;i++)\n  {\n        for(int j = 0;j<N;j++)\n        {\n                printf(\" %d \",W[i][j]);\n        }\n        printf(\"\\n\");\n  }*\/\n\n  pthread_barrier_init(&barrier_total, NULL, P1);\n  pthread_barrier_init(&barrier, NULL, P1);\n  pthread_mutex_init(&lock, NULL);\n\n  for(int i=0; i<2097152; i++)\n    pthread_mutex_init(&locks[i], NULL);\n  \n  \/\/initialize_single_source(D, Q, 0, N);\n\n  for(int j = 0; j < P1; j++) {\n    thread_arg[j].local_min  = local_min_buffer;\n    thread_arg[j].global_min = &global_min_buffer;\n    \/\/thread_arg[j].Q          = Q;\n    \/\/thread_arg[j].D          = D;\n    thread_arg[j].W          = W;\n    thread_arg[j].W_index    = W_index;\n    thread_arg[j].d_count    = &d_count;\n    thread_arg[j].tid        = j;\n    thread_arg[j].P          = P;\n    thread_arg[j].N          = N;\n    thread_arg[j].DEG        = DEG;\n    thread_arg[j].barrier_total = &barrier_total;\n\t\tthread_arg[j].barrier    = &barrier;\n  }\nint mul = 2;\n  \/\/ Enable performance and energy models\n  \/\/CarbonEnableModels();\n\n\/\/struct timespec requestStart, requestEnd;\n\/\/clock_gettime(CLOCK_REALTIME, &requestStart);\n\n  for(int j = 1; j < P1; j++) {\n    pthread_create(thread_handle+j,\n                   NULL,\n                   do_work,\n                   (void*)&thread_arg[j]);\n  }\n  do_work((void*) &thread_arg[0]);\n\n  printf(\"Threads Returned!\");\n\n  for(int j = 1; j < P1; j++) { \/\/mul = mul*2;\n    pthread_join(thread_handle[j],NULL);\n  }\n\n\tprintf(\"Threads Joined!\");\n\n\t\/\/clock_gettime(CLOCK_REALTIME, &requestEnd);\n\t\/\/  double accum = ( requestEnd.tv_sec - requestStart.tv_sec ) + ( requestEnd.tv_nsec - requestStart.tv_nsec ) \/ BILLION;\n\t\/\/\t  printf( \"%lf\\n\", accum );\n\n  \/\/ Enable performance and energy models\n  \/\/CarbonDisableModels();\n  \/\/printf(\"\\ndistance:%d \\n\",D[N-1]);\n\n    \/*for(int i = 0; i < N; i++) {\n      printf(\" %d \", D[i]);\n    }\n    printf(\"\\n\");\n*\/\n  \/\/ Stop the simulator\n  \/\/CarbonStopSim();\n  return 0;\n}\n\nint initialize_single_source(int*  D,\n                             int*  Q,\n                             int   source,\n                             int   N)\n{\n  for(int i = 0; i < N+1; i++)\n  {\n    D[i] = INT_MAX;\n    Q[i] = 1;\n  }\n\n  D[source] = 0;\n  return 0;\n}\n\nint get_local_min(volatile int* Q, volatile int* D, int start, int stop, int N, int** W_index, int** W, int u)\n{\n  int min = INT_MAX;\n  int min_index = N;\n\n  for(int i = start; i < stop; i++) \n  {\n    if(D[i] < min && Q[i]) \n    {\n      min = D[i];\n      min_index = W_index[u][i];\n    }\n  }\n  return min_index;\n}\n\nvoid relax(int u, int i, volatile int* D, int** W, int** W_index, int N)\n{\n  if((D[W_index[u][i]] > (D[u] + W[u][i]) && (W_index[u][i]!=-1 && W_index[u][i]<N && W[u][i]!=INT_MAX)))\n    D[W_index[u][i]] = D[u] + W[u][i];\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2006-2013  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 \"chordsdetectionbeats.h\"\n#include \"essentiamath.h\"\n\nusing namespace std;\n\nnamespace essentia {\nnamespace standard {\n\nconst char* ChordsDetectionBeats::name = \"ChordsDetectionBeats\";\nconst char* ChordsDetectionBeats::description = DOC(\"This algorithm takes the ChordsDetection algorithm from Essentia, and tries to enhance it by using a Beat Tracker for in between estimation.\\n\"\n\"\\n\"\n\"Note:\\n\"\n\"  - This algorithm assumes that input pcps have been computed with framesize = 2*hopsize\\n\"\n\"\\n\"\n\"Quality: experimental (prone to errors, algorithm needs improvement)\\n\"\n\"\\n\"\n\"References:\\n\"\n\"  [1] E. Gómez, \\\"Tonal Description of Polyphonic Audio for Music Content\\n\"\n\"  Processing,\\\" INFORMS Journal on Computing, vol. 18, no. 3, pp. 294–304,\\n\"\n\"  2006.\\n\\n\"\n\"  [2] D. Temperley, \\\"What's key for key? The Krumhansl-Schmuckler\\n\"\n\"  key-finding algorithm reconsidered\\\", Music Perception vol. 17, no. 1,\\n\"\n\"  pp. 65-100, 1999.\");\n\nvoid ChordsDetectionBeats::configure() {\n  Real wsize = parameter(\"windowSize\").toReal();\n  _sampleRate = parameter(\"sampleRate\").toReal();\n  _hopSize = parameter(\"hopSize\").toInt();\n\n  \/\/ NB: this assumes that frameSize = hopSize * 2, so that we don't have to\n  \/\/     require frameSize as well as parameter.\n  _numFramesWindow = int((wsize * _sampleRate) \/ _hopSize) - 1; \/\/ wsize = 1.0 , hopSize = 512 --> 85\n}\n\nvoid ChordsDetectionBeats::compute() {\n  const vector<vector<Real> >& hpcp = _pcp.get();\n  vector<string>& chords = _chords.get();\n  vector<Real>& strength = _strength.get();\n  const vector<Real>& ticks = _ticks.get(); \n  \n  string key;\n  string scale;\n  Real firstToSecondRelativeStrength;\n  Real str; \/\/ strength\n\n  chords.reserve(int(hpcp.size()\/_numFramesWindow)); \/\/ 1478\/85 = 17\n  \/\/out << \"chords.reserve(int(hpcp.size()\/_numFramesWindow)); = \" << int(hpcp.size()\/_numFramesWindow) << endl;\n  strength.reserve(int(hpcp.size()\/_numFramesWindow));\n\n  \/\/cout << \"int(hpcp.size() = \" << (int)hpcp.size() << endl; \n\n  \/\/ for (int j=0; j<ticks.size(); j++) {\n  \/\/   cout << \"tick \" << j << \" \" << ticks[j] << endl;\n  \/\/ } \n  if(ticks.size() < 2) { \n  throw EssentiaException(\"Ticks vector should contain at least 2 elements.\");\n  } \n\n  Real diffTicks = 0.0f;\n  int numFramesTick = 0;\n  int initFrame = 0;\n\n  int frameStart=0;\n  int frameEnd=0;\n  \/\/cout << \"ticks.size() = \"<<ticks.size()<< \"from 0 to \"<< ticks.size()-1 << \", ticks[size-1]\"<<ticks[ticks.size()-1]<< endl; \n  \/\/cout << \"hpcp.size() = length of chords output array in the previous version of the code = \" <<hpcp.size()<< endl;\n\n  for (int i = 0; i < ticks.size()-1; ++i){\n\n    diffTicks = ticks[i+1] - ticks[i];\n    numFramesTick = int((diffTicks * _sampleRate) \/ _hopSize);\n    frameStart = int((ticks[i] * _sampleRate) \/ _hopSize);\n    frameEnd = frameStart + numFramesTick-1;\n\n    if (frameEnd > hpcp.size()-1) break;\n\n    vector<Real> hpcpMedian = medianFrames(hpcp, frameStart, frameEnd);\n    normalize(hpcpMedian);\n\n    _chordsAlgo->input(\"pcp\").set(hpcpMedian);\n    _chordsAlgo->output(\"key\").set(key);\n    _chordsAlgo->output(\"scale\").set(scale);\n    _chordsAlgo->output(\"strength\").set(str);\n    _chordsAlgo->output(\"firstToSecondRelativeStrength\").set(firstToSecondRelativeStrength);\n    _chordsAlgo->compute();\n\n    if (scale == \"minor\") {\n      chords.push_back(key + 'm');\n    }\n    else {\n      chords.push_back(key);\n    }\n\n    strength.push_back(str);\n\n  } \/\/ for\n\n  \n}\/\/method\n\n} \/\/ namespace standard\n} \/\/ namespace essentia\n\n\n#include \"poolstorage.h\"\n\nnamespace essentia {\nnamespace streaming {\n\nconst char* ChordsDetectionBeats::name = standard::ChordsDetectionBeats::name;\nconst char* ChordsDetectionBeats::description = standard::ChordsDetectionBeats::description;\n\nChordsDetectionBeats::ChordsDetectionBeats() : AlgorithmComposite() {\n\n  declareInput(_pcp, \"pcp\", \"the pitch class profile from which to detect the chord\");\n  declareOutput(_chords, 1, \"chords\", \"the resulting chords, from A to G\");\n  declareOutput(_strength, 1, \"strength\", \"the strength of the chord\");\n\n  _chordsAlgo = standard::AlgorithmFactory::create(\"Key\");\n  _chordsAlgo->configure(\"profileType\", \"tonictriad\", \"usePolyphony\", false);\n  _poolStorage = new PoolStorage<vector<Real> >(&_pool, \"internal.hpcp\");\n\n  \/\/ FIXME: this is just a temporary hack...\n  \/\/        the correct way to do this is to have the algorithm output the chords\n  \/\/        continuously while processing, which requires a FrameCutter for vectors\n  \/\/ Need to set the buffer type to multiple frames as all the chords\n  \/\/ are output all at once\n  _chords.setBufferType(BufferUsage::forMultipleFrames);\n  _strength.setBufferType(BufferUsage::forMultipleFrames);\n\n  attach(_pcp, _poolStorage->input(\"data\"));\n}\n\nChordsDetectionBeats::~ChordsDetectionBeats() {\n  delete _chordsAlgo;\n  delete _poolStorage;\n}\n\nvoid ChordsDetectionBeats::configure() {\n  Real wsize = parameter(\"windowSize\").toReal();\n  Real sampleRate = parameter(\"sampleRate\").toReal();\n  int hopSize = parameter(\"hopSize\").toInt();\n\n  \/\/ NB: this assumes that frameSize = hopSize * 2, so that we don't have to\n  \/\/     require frameSize as well as parameter.\n  _numFramesWindow = int((wsize * sampleRate) \/ hopSize) - 1;\n}\n\nAlgorithmStatus ChordsDetectionBeats::process() {\n  if (!shouldStop()) return PASS;\n\n  const vector<vector<Real> >& hpcp = _pool.value<vector<vector<Real> > >(\"internal.hpcp\");\n  string key;\n  string scale;\n  Real strength;\n  Real firstToSecondRelativeStrength;\n\n  \/\/ This is very strange, because we jump by a single frame each time, not by\n  \/\/ the defined windowSize. Is that the expected behavior or is it a bug?\n  \/\/ eaylon: windowSize is not intended for advancing, but for searching\n  \/\/ nwack: maybe it could be a smart idea to jump from 1 beat to another instead\n  \/\/        of a fixed amount a time (arbitrary frame size)\n  \n  for (int i=0; i<(int)hpcp.size(); i++) {\n\n    int indexStart = max(0, i - _numFramesWindow\/2);\n    int indexEnd = min(i + _numFramesWindow\/2, (int)hpcp.size());\n\n    \/\/vector<Real> hpcpAverage = medianFrames(hpcp, indexStart, indexEnd);\n    vector<Real> hpcpAverage = meanFrames(hpcp, indexStart, indexEnd);\n    normalize(hpcpAverage);\n\n    _chordsAlgo->input(\"pcp\").set(hpcpAverage);\n    _chordsAlgo->output(\"key\").set(key);\n    _chordsAlgo->output(\"scale\").set(scale);\n    _chordsAlgo->output(\"strength\").set(strength);\n    _chordsAlgo->output(\"firstToSecondRelativeStrength\").set(firstToSecondRelativeStrength);\n    _chordsAlgo->compute();\n\n    if (scale == \"minor\") {\n      _chords.push(key + 'm');\n    }\n    else {\n      _chords.push(key);\n    }\n\n    _strength.push(strength);\n  }\n\n  return FINISHED;\n}\n\nvoid ChordsDetectionBeats::reset() {\n  AlgorithmComposite::reset();\n  _chordsAlgo->reset();\n}\n\n\n} \/\/ namespace streaming\n} \/\/ namespace essentia\n<commit_msg>Cleaned some comments<commit_after>\/*\n * Copyright (C) 2006-2013  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 \"chordsdetectionbeats.h\"\n#include \"essentiamath.h\"\n\nusing namespace std;\n\nnamespace essentia {\nnamespace standard {\n\nconst char* ChordsDetectionBeats::name = \"ChordsDetectionBeats\";\nconst char* ChordsDetectionBeats::description = DOC(\"This algorithm takes the ChordsDetection algorithm from Essentia, and tries to enhance it by using a Beat Tracker for in between estimation.\\n\"\n\"\\n\"\n\"Note:\\n\"\n\"  - This algorithm assumes that input pcps have been computed with framesize = 2*hopsize\\n\"\n\"\\n\"\n\"Quality: experimental (prone to errors, algorithm needs improvement)\\n\"\n\"\\n\"\n\"References:\\n\"\n\"  [1] E. Gómez, \\\"Tonal Description of Polyphonic Audio for Music Content\\n\"\n\"  Processing,\\\" INFORMS Journal on Computing, vol. 18, no. 3, pp. 294–304,\\n\"\n\"  2006.\\n\\n\"\n\"  [2] D. Temperley, \\\"What's key for key? The Krumhansl-Schmuckler\\n\"\n\"  key-finding algorithm reconsidered\\\", Music Perception vol. 17, no. 1,\\n\"\n\"  pp. 65-100, 1999.\");\n\nvoid ChordsDetectionBeats::configure() {\n  Real wsize = parameter(\"windowSize\").toReal();\n  _sampleRate = parameter(\"sampleRate\").toReal();\n  _hopSize = parameter(\"hopSize\").toInt();\n\n  \/\/ NB: this assumes that frameSize = hopSize * 2, so that we don't have to\n  \/\/     require frameSize as well as parameter.\n  _numFramesWindow = int((wsize * _sampleRate) \/ _hopSize) - 1; \/\/ wsize = 1.0 , hopSize = 512 --> 85\n}\n\nvoid ChordsDetectionBeats::compute() {\n  const vector<vector<Real> >& hpcp = _pcp.get();\n  vector<string>& chords = _chords.get();\n  vector<Real>& strength = _strength.get();\n  const vector<Real>& ticks = _ticks.get(); \n  \n  string key;\n  string scale;\n  Real firstToSecondRelativeStrength;\n  Real str; \/\/ strength\n\n  chords.reserve(int(hpcp.size()\/_numFramesWindow)); \/\/ 1478\/85 = 17\n  strength.reserve(int(hpcp.size()\/_numFramesWindow));\n\n  if(ticks.size() < 2) { \n  \tthrow EssentiaException(\"Ticks vector should contain at least 2 elements.\");\n  } \n\n  Real diffTicks = 0.0f;\n  int numFramesTick = 0;\n  int initFrame = 0;\n\n  int frameStart=0;\n  int frameEnd=0;\n  \n  for (int i = 0; i < ticks.size()-1; ++i){\n\n    diffTicks = ticks[i+1] - ticks[i];\n    numFramesTick = int((diffTicks * _sampleRate) \/ _hopSize);\n    frameStart = int((ticks[i] * _sampleRate) \/ _hopSize);\n    frameEnd = frameStart + numFramesTick-1;\n\n    if (frameEnd > hpcp.size()-1) break;\n\n    vector<Real> hpcpMedian = medianFrames(hpcp, frameStart, frameEnd);\n    normalize(hpcpMedian);\n\n    _chordsAlgo->input(\"pcp\").set(hpcpMedian);\n    _chordsAlgo->output(\"key\").set(key);\n    _chordsAlgo->output(\"scale\").set(scale);\n    _chordsAlgo->output(\"strength\").set(str);\n    _chordsAlgo->output(\"firstToSecondRelativeStrength\").set(firstToSecondRelativeStrength);\n    _chordsAlgo->compute();\n\n    if (scale == \"minor\") {\n      chords.push_back(key + 'm');\n    }\n    else {\n      chords.push_back(key);\n    }\n\n    strength.push_back(str);\n\n  } \/\/ for\n\n  \n} \/\/compute\n\n} \/\/ namespace standard\n} \/\/ namespace essentia\n\n\n#include \"poolstorage.h\"\n\nnamespace essentia {\nnamespace streaming {\n\nconst char* ChordsDetectionBeats::name = standard::ChordsDetectionBeats::name;\nconst char* ChordsDetectionBeats::description = standard::ChordsDetectionBeats::description;\n\nChordsDetectionBeats::ChordsDetectionBeats() : AlgorithmComposite() {\n\n  declareInput(_pcp, \"pcp\", \"the pitch class profile from which to detect the chord\");\n  declareOutput(_chords, 1, \"chords\", \"the resulting chords, from A to G\");\n  declareOutput(_strength, 1, \"strength\", \"the strength of the chord\");\n\n  _chordsAlgo = standard::AlgorithmFactory::create(\"Key\");\n  _chordsAlgo->configure(\"profileType\", \"tonictriad\", \"usePolyphony\", false);\n  _poolStorage = new PoolStorage<vector<Real> >(&_pool, \"internal.hpcp\");\n\n  \/\/ FIXME: this is just a temporary hack...\n  \/\/        the correct way to do this is to have the algorithm output the chords\n  \/\/        continuously while processing, which requires a FrameCutter for vectors\n  \/\/ Need to set the buffer type to multiple frames as all the chords\n  \/\/ are output all at once\n  _chords.setBufferType(BufferUsage::forMultipleFrames);\n  _strength.setBufferType(BufferUsage::forMultipleFrames);\n\n  attach(_pcp, _poolStorage->input(\"data\"));\n}\n\nChordsDetectionBeats::~ChordsDetectionBeats() {\n  delete _chordsAlgo;\n  delete _poolStorage;\n}\n\nvoid ChordsDetectionBeats::configure() {\n  Real wsize = parameter(\"windowSize\").toReal();\n  Real sampleRate = parameter(\"sampleRate\").toReal();\n  int hopSize = parameter(\"hopSize\").toInt();\n\n  \/\/ NB: this assumes that frameSize = hopSize * 2, so that we don't have to\n  \/\/     require frameSize as well as parameter.\n  _numFramesWindow = int((wsize * sampleRate) \/ hopSize) - 1;\n}\n\nAlgorithmStatus ChordsDetectionBeats::process() {\n  if (!shouldStop()) return PASS;\n\n  const vector<vector<Real> >& hpcp = _pool.value<vector<vector<Real> > >(\"internal.hpcp\");\n  string key;\n  string scale;\n  Real strength;\n  Real firstToSecondRelativeStrength;\n\n  \/\/ This is very strange, because we jump by a single frame each time, not by\n  \/\/ the defined windowSize. Is that the expected behavior or is it a bug?\n  \/\/ eaylon: windowSize is not intended for advancing, but for searching\n  \/\/ nwack: maybe it could be a smart idea to jump from 1 beat to another instead\n  \/\/        of a fixed amount a time (arbitrary frame size)\n  \n  for (int i=0; i<(int)hpcp.size(); i++) {\n\n    int indexStart = max(0, i - _numFramesWindow\/2);\n    int indexEnd = min(i + _numFramesWindow\/2, (int)hpcp.size());\n\n    vector<Real> hpcpAverage = meanFrames(hpcp, indexStart, indexEnd);\n    normalize(hpcpAverage);\n\n    _chordsAlgo->input(\"pcp\").set(hpcpAverage);\n    _chordsAlgo->output(\"key\").set(key);\n    _chordsAlgo->output(\"scale\").set(scale);\n    _chordsAlgo->output(\"strength\").set(strength);\n    _chordsAlgo->output(\"firstToSecondRelativeStrength\").set(firstToSecondRelativeStrength);\n    _chordsAlgo->compute();\n\n    if (scale == \"minor\") {\n      _chords.push(key + 'm');\n    }\n    else {\n      _chords.push(key);\n    }\n\n    _strength.push(strength);\n  }\n\n  return FINISHED;\n}\n\nvoid ChordsDetectionBeats::reset() {\n  AlgorithmComposite::reset();\n  _chordsAlgo->reset();\n}\n\n\n} \/\/ namespace streaming\n} \/\/ namespace essentia\n<|endoftext|>"}
{"text":"<commit_before>\/* \n * File:   AfUnixCommunicator.cpp\n * Author: cjg\n * \n * Created on 30 settembre 2009, 12.01\n *\/\n\n#include <sys\/types.h>\n#include <sys\/socket.h>\n#include <sys\/un.h>\n#include <csignal>\n#include \"AfUnixCommunicator.h\"\n\nusing namespace std;\n\nAfUnixCommunicator::AfUnixCommunicator(string &path) {\n    mPath = path;\n}\n\nAfUnixCommunicator::AfUnixCommunicator(int fd) {\n    mSocketFd = fd;\n    InitializeStream();\n}\n\nAfUnixCommunicator::AfUnixCommunicator(const char *path) {\n    mPath = string(path);\n}\n\nAfUnixCommunicator::~AfUnixCommunicator() {\n    \/\/ TODO Auto-generated destructor stub\n}\n\nvoid AfUnixCommunicator::Serve() {\n    struct sockaddr_un socket_addr;\n\n    unlink(mPath.c_str());\n\n    if ((mSocketFd = socket(AF_UNIX, SOCK_STREAM, 0)) == 0)\n        throw \"AfUnixCommunicator: Can't create socket.\";\n\n    socket_addr.sun_family = AF_UNIX;\n    strcpy(socket_addr.sun_path, mPath.c_str());\n\n    if (bind(mSocketFd, (struct sockaddr *) & socket_addr,\n            sizeof (struct sockaddr_un)) != 0)\n        throw \"AfUnixCommunicator: Can't bind socket.\";\n\n    if (listen(mSocketFd, 5) != 0)\n        throw \"AfUnixCommunicator: Can't listen from socket.\";\n}\n\nconst Communicator * const AfUnixCommunicator::Accept() const {\n    unsigned client_socket_fd;\n    struct sockaddr_un client_socket_addr;\n    unsigned client_socket_addr_size;\n\n    client_socket_addr_size = sizeof (struct sockaddr_un);\n    if ((client_socket_fd = accept(mSocketFd,\n        (sockaddr *) & client_socket_addr,\n        &client_socket_addr_size)) == 0)\n        throw \"AfUnixCommunicator: Error while accepting connection.\";\n\n    return new AfUnixCommunicator(client_socket_fd);\n}\n\nvoid AfUnixCommunicator::Connect() {\n    int len;\n    struct sockaddr_un remote;\n\n    if((mSocketFd = socket(AF_UNIX, SOCK_STREAM, 0)) == 0)\n        throw \"AfUnixCommunicator: Can't create socket.\";\n\n    remote.sun_family = AF_UNIX;\n    strcpy(remote.sun_path, mPath.c_str());\n    len = offsetof(struct sockaddr_un, sun_path) + strlen(remote.sun_path);\n    if (connect(mSocketFd, (struct sockaddr *) & remote, len) != 0) \n        throw \"AfUnixCommunicator: Can't connect to socket.\";\n    InitializeStream();\n}\n\nvoid AfUnixCommunicator::Close() {\n}\n\nstd::istream & AfUnixCommunicator::GetInputStream() const {\n    return *(this->mpInput);\n}\n\nstd::ostream & AfUnixCommunicator::GetOutputStream() const {\n    return *(this->mpOutput);\n}\n\nvoid AfUnixCommunicator::InitializeStream() {\n    mpInputBuf = new __gnu_cxx::stdio_filebuf<char>(mSocketFd,\n            std::ios_base::in);\n    mpOutputBuf = new __gnu_cxx::stdio_filebuf<char>(mSocketFd,\n            std::ios_base::out);\n    mpInput = new istream(mpInputBuf);\n    mpOutput = new ostream(mpOutputBuf);\n    signal(SIGPIPE, SIG_IGN);\n}\n<commit_msg>ignoring SIGPIPE<commit_after>\/* \n * File:   AfUnixCommunicator.cpp\n * Author: cjg\n * \n * Created on 30 settembre 2009, 12.01\n *\/\n\n#include <sys\/types.h>\n#include <sys\/socket.h>\n#include <sys\/un.h>\n#include <csignal>\n#include \"AfUnixCommunicator.h\"\n\nusing namespace std;\n\nAfUnixCommunicator::AfUnixCommunicator(string &path) {\n    mPath = path;\n}\n\nAfUnixCommunicator::AfUnixCommunicator(int fd) {\n    mSocketFd = fd;\n    InitializeStream();\n}\n\nAfUnixCommunicator::AfUnixCommunicator(const char *path) {\n    mPath = string(path);\n}\n\nAfUnixCommunicator::~AfUnixCommunicator() {\n    \/\/ TODO Auto-generated destructor stub\n}\n\nvoid AfUnixCommunicator::Serve() {\n    struct sockaddr_un socket_addr;\n\n    unlink(mPath.c_str());\n\n    if ((mSocketFd = socket(AF_UNIX, SOCK_STREAM, 0)) == 0)\n        throw \"AfUnixCommunicator: Can't create socket.\";\n\n    socket_addr.sun_family = AF_UNIX;\n    strcpy(socket_addr.sun_path, mPath.c_str());\n\n    if (bind(mSocketFd, (struct sockaddr *) & socket_addr,\n            sizeof (struct sockaddr_un)) != 0)\n        throw \"AfUnixCommunicator: Can't bind socket.\";\n\n    if (listen(mSocketFd, 5) != 0)\n        throw \"AfUnixCommunicator: Can't listen from socket.\";\n}\n\nconst Communicator * const AfUnixCommunicator::Accept() const {\n    unsigned client_socket_fd;\n    struct sockaddr_un client_socket_addr;\n    unsigned client_socket_addr_size;\n\n    client_socket_addr_size = sizeof (struct sockaddr_un);\n    if ((client_socket_fd = accept(mSocketFd,\n        (sockaddr *) & client_socket_addr,\n        &client_socket_addr_size)) == 0)\n        throw \"AfUnixCommunicator: Error while accepting connection.\";\n\n    return new AfUnixCommunicator(client_socket_fd);\n}\n\nvoid AfUnixCommunicator::Connect() {\n    int len;\n    struct sockaddr_un remote;\n\n    if((mSocketFd = socket(AF_UNIX, SOCK_STREAM, 0)) == 0)\n        throw \"AfUnixCommunicator: Can't create socket.\";\n\n    remote.sun_family = AF_UNIX;\n    strcpy(remote.sun_path, mPath.c_str());\n    len = offsetof(struct sockaddr_un, sun_path) + strlen(remote.sun_path);\n    if (connect(mSocketFd, (struct sockaddr *) & remote, len) != 0) \n        throw \"AfUnixCommunicator: Can't connect to socket.\";\n    InitializeStream();\n}\n\nvoid AfUnixCommunicator::Close() {\n}\n\nstd::istream & AfUnixCommunicator::GetInputStream() const {\n    return *(this->mpInput);\n}\n\nstd::ostream & AfUnixCommunicator::GetOutputStream() const {\n    return *(this->mpOutput);\n}\n\nvoid AfUnixCommunicator::InitializeStream() {\n    mpInputBuf = new __gnu_cxx::stdio_filebuf<char>(mSocketFd,\n            std::ios_base::in);\n    mpOutputBuf = new __gnu_cxx::stdio_filebuf<char>(mSocketFd,\n            std::ios_base::out);\n    mpInput = new istream(mpInputBuf);\n    mpOutput = new ostream(mpOutputBuf);\n    \/* FIXME: handle SIGPIPE instead of just ignoring it *\/\n    signal(SIGPIPE, SIG_IGN);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * <one line to give the library's name and an idea of what it does.>\n * Copyright (C) 2013  David Edmundson <davidedmundson@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\n#include \"persondatatests.h\"\n\n#include <QtTest>\n#include <QFile>\n\n\/\/private includes\n#include \"personmanager_p.h\"\n#include \"personpluginmanager.h\"\n\n\/\/public kpeople includes\n#include <KPeople\/PersonData>\n\n#include \"fakecontactsource.h\"\n\nQTEST_MAIN(PersonDataTests);\n\n\/\/the fake datasource is configured with\n\n\/\/ID       - NAME        - email\n\/\/contact1 - Contact1    - contact1@example.com\n\/\/contact2 - PersonA     - contact2@example.com\n\/\/contact3 - PersonA     - contact3@example.com\n\n\nusing namespace KPeople;\n\n\/\/this tests PersonData but also implicitly tests the private classes\n\/\/ - BasePersonsDataSource\n\/\/ - DefaultContactMonitor\n\/\/ - MetaContact\n\n\nvoid PersonDataTests::initTestCase()\n{\n    \/\/ Called before the first testfunction is executed\n    PersonManager::instance(\"\/tmp\/kpeople_test_db\");\n    PersonManager::instance()->mergeContacts(QStringList() << \"fakesource:\/\/contact2\" << \"fakesource:\/\/contact3\");\n\n    m_source = new FakeContactSource(0); \/\/don't own. PersonPluginManager removes it on destruction\n    PersonPluginManager::setDataSourcePlugins(QList<BasePersonsDataSource*>() << m_source);\n}\n\nvoid PersonDataTests::cleanupTestCase()\n{\n    \/\/ Called after the last testfunction was executed\n    QFile::remove(\"\/tmp\/kpeople_test_db\");\n}\n\nvoid PersonDataTests::init()\n{\n    \/\/ Called before each testfunction is executed\n}\n\nvoid PersonDataTests::cleanup()\n{\n    \/\/ Called after every testfunction\n}\n\n\nvoid PersonDataTests::loadContact()\n{\n    PersonData person(\"fakesource:\/\/contact1\");\n    \/\/in this case we know the datasource is syncronous, but we should extend the test to cope with it not being async.\n\n    QCOMPARE(person.contacts().size(), 1);\n    QCOMPARE(person.person().name(), QString(\"Contact 1\"));\n    QCOMPARE(person.person().emails().size(), 1);\n    QCOMPARE(person.person().emails().first(), QString(\"contact1@example.com\"));\n}\n\nvoid PersonDataTests::loadPerson()\n{\n    \/\/loading contact 2 which is already merged should return person1\n    \/\/which is both contact 2 and 3\n    PersonData person(\"fakesource:\/\/contact2\");\n\n    QCOMPARE(person.contacts().size(), 2);\n    QCOMPARE(person.person().name(), QString(\"Person A\"));\n    QCOMPARE(person.person().emails().size(), 2);\n\n    \/\/convert to set as order is not important\n    QCOMPARE(person.person().emails().toSet(), QSet<QString>() << \"contact2@example.com\" << \"contact3@example.com\");\n}\n\nvoid PersonDataTests::contactChanged()\n{\n    PersonData person(\"fakesource:\/\/contact1\");\n\n    QCOMPARE(person.person().emails().first(), QString(\"contact1@example.com\"));\n\n    m_source->changeContact1();\n    \/\/TODO add some stuff with QSIGNALSPY\n\n    QCOMPARE(person.person().emails().first(), QString(\"newaddress@yahoo.com\"));\n}\n\nvoid PersonDataTests::invalidId()\n{\n    KPeople::PersonData person(\"fakesource:\/\/adsf\");\n\/\/     QCOMPARE(person.isValid(), false);\n    \/\/FIXME we need this method ^\n}\n\n\n\n\n#include \"persondatatests.moc\"\n<commit_msg>Add test that dataChanged() is emitted from PersonData<commit_after>\/*\n * <one line to give the library's name and an idea of what it does.>\n * Copyright (C) 2013  David Edmundson <davidedmundson@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\n#include \"persondatatests.h\"\n\n#include <QtTest>\n#include <QFile>\n\n\/\/private includes\n#include \"personmanager_p.h\"\n#include \"personpluginmanager.h\"\n\n\/\/public kpeople includes\n#include <KPeople\/PersonData>\n\n#include \"fakecontactsource.h\"\n\nQTEST_MAIN(PersonDataTests);\n\n\/\/the fake datasource is configured with\n\n\/\/ID       - NAME        - email\n\/\/contact1 - Contact1    - contact1@example.com\n\/\/contact2 - PersonA     - contact2@example.com\n\/\/contact3 - PersonA     - contact3@example.com\n\n\nusing namespace KPeople;\n\n\/\/this tests PersonData but also implicitly tests the private classes\n\/\/ - BasePersonsDataSource\n\/\/ - DefaultContactMonitor\n\/\/ - MetaContact\n\n\nvoid PersonDataTests::initTestCase()\n{\n    \/\/ Called before the first testfunction is executed\n    PersonManager::instance(\"\/tmp\/kpeople_test_db\");\n    PersonManager::instance()->mergeContacts(QStringList() << \"fakesource:\/\/contact2\" << \"fakesource:\/\/contact3\");\n\n    m_source = new FakeContactSource(0); \/\/don't own. PersonPluginManager removes it on destruction\n    PersonPluginManager::setDataSourcePlugins(QList<BasePersonsDataSource*>() << m_source);\n}\n\nvoid PersonDataTests::cleanupTestCase()\n{\n    \/\/ Called after the last testfunction was executed\n    QFile::remove(\"\/tmp\/kpeople_test_db\");\n}\n\nvoid PersonDataTests::init()\n{\n    \/\/ Called before each testfunction is executed\n}\n\nvoid PersonDataTests::cleanup()\n{\n    \/\/ Called after every testfunction\n}\n\n\nvoid PersonDataTests::loadContact()\n{\n    PersonData person(\"fakesource:\/\/contact1\");\n    \/\/in this case we know the datasource is syncronous, but we should extend the test to cope with it not being async.\n\n    QCOMPARE(person.contacts().size(), 1);\n    QCOMPARE(person.person().name(), QString(\"Contact 1\"));\n    QCOMPARE(person.person().emails().size(), 1);\n    QCOMPARE(person.person().emails().first(), QString(\"contact1@example.com\"));\n}\n\nvoid PersonDataTests::loadPerson()\n{\n    \/\/loading contact 2 which is already merged should return person1\n    \/\/which is both contact 2 and 3\n    PersonData person(\"fakesource:\/\/contact2\");\n\n    QCOMPARE(person.contacts().size(), 2);\n    QCOMPARE(person.person().name(), QString(\"Person A\"));\n    QCOMPARE(person.person().emails().size(), 2);\n\n    \/\/convert to set as order is not important\n    QCOMPARE(person.person().emails().toSet(), QSet<QString>() << \"contact2@example.com\" << \"contact3@example.com\");\n}\n\nvoid PersonDataTests::contactChanged()\n{\n    PersonData person(\"fakesource:\/\/contact1\");\n\n    QCOMPARE(person.person().emails().first(), QString(\"contact1@example.com\"));\n\n    QSignalSpy spy(&person, SIGNAL(dataChanged()));\n    m_source->changeContact1();\n    QCOMPARE(spy.count(), 1);\n\n    QCOMPARE(person.person().emails().first(), QString(\"newaddress@yahoo.com\"));\n}\n\nvoid PersonDataTests::invalidId()\n{\n    KPeople::PersonData person(\"fakesource:\/\/adsf\");\n\/\/     QCOMPARE(person.isValid(), false);\n    \/\/FIXME we need this method ^\n}\n\n\n\n\n#include \"persondatatests.moc\"\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) 2016 Esteban Tovagliari, 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 \"appleseedmaya\/exporters\/lightexporter.h\"\n\n\/\/ Standard headers.\n#include <sstream>\n\n\/\/ Maya headers.\n#include <maya\/MFnDagNode.h>\n\n\/\/ appleseed.foundation headers.\n#include \"foundation\/math\/scalar.h\"\n\n\/\/ appleseed.renderer headers.\n#include \"renderer\/api\/scene.h\"\n\n\/\/ appleseed.maya headers.\n#include \"appleseedmaya\/attributeutils.h\"\n#include \"appleseedmaya\/exporters\/exporterfactory.h\"\n\nnamespace asf = foundation;\nnamespace asr = renderer;\n\nvoid LightExporter::registerExporter()\n{\n    NodeExporterFactory::registerDagNodeExporter(\"directionalLight\", &LightExporter::create);\n    NodeExporterFactory::registerDagNodeExporter(\"pointLight\", &LightExporter::create);\n    NodeExporterFactory::registerDagNodeExporter(\"spotLight\", &LightExporter::create);\n}\n\nDagNodeExporter *LightExporter::create(\n    const MDagPath&                 path,\n    asr::Project&                   project,\n    AppleseedSession::SessionMode   sessionMode)\n{\n    return new LightExporter(path, project, sessionMode);\n}\n\nLightExporter::LightExporter(\n    const MDagPath&                 path,\n    asr::Project&                   project,\n    AppleseedSession::SessionMode   sessionMode)\n  : DagNodeExporter(path, project, sessionMode)\n{\n}\n\nbool LightExporter::supportsMotionBlur() const\n{\n    return false;\n}\n\nvoid LightExporter::createEntity(const AppleseedSession::Options& options)\n{\n    asr::LightFactoryRegistrar lightFactories;\n    const asr::ILightFactory *lightFactory = 0;\n    asr::ParamArray lightParams;\n\n    MFnDependencyNode depNodeFn(node());\n\n    MStatus status;\n    MPlug plug = depNodeFn.findPlug(\"intensity\", &status);\n    if(plug.isConnected())\n    {\n        \/\/ todo: add warning here...\n    }\n\n    float intensity = 1.0;\n    AttributeUtils::get(plug, intensity);\n\n    plug = depNodeFn.findPlug(\"color\", &status);\n    if(plug.isConnected())\n    {\n        \/\/ todo: add warning here...\n    }\n\n    \/\/ Create a color entity.\n    MString colorName = appleseedName() + MString(\"_intensity_color\");\n    {\n        MColor color(1.0f, 1.0f, 1.0f);\n        AttributeUtils::get(plug, color);\n        asr::ColorValueArray values(3, &color.r);\n\n        asr::ParamArray params;\n        params.insert(\"color_space\", \"linear_rgb\");\n        m_lightColor.reset(\n            asr::ColorEntityFactory::create(colorName.asChar(), params, values));\n    }\n\n    if(depNodeFn.typeName() == \"directionalLight\")\n    {\n        lightFactory = lightFactories.lookup(\"directional_light\");\n        lightParams.insert(\"irradiance\", colorName.asChar());\n        lightParams.insert(\"irradiance_multiplier\", intensity);\n    }\n    if(depNodeFn.typeName() == \"pointLight\")\n    {\n        lightFactory = lightFactories.lookup(\"point_light\");\n        lightParams.insert(\"intensity\", colorName.asChar());\n        lightParams.insert(\"intensity_multiplier\", intensity);\n    }\n    else \/\/ spotLight\n    {\n        lightFactory = lightFactories.lookup(\"spot_light\");\n        lightParams.insert(\"intensity\", colorName.asChar());\n        lightParams.insert(\"intensity_multiplier\", intensity);\n\n        MAngle coneAngle(20.0f, MAngle::kDegrees);\n        AttributeUtils::get(node(), \"coneAngle\", coneAngle);\n        lightParams.insert(\"inner_angle\", coneAngle.asDegrees());\n\n        MAngle penumbraAngle(5.0f, MAngle::kDegrees);\n        AttributeUtils::get(node(), \"penumbraAngle\", penumbraAngle);\n        const float outerAngle = coneAngle.asDegrees() + 2.0 * penumbraAngle.asDegrees();\n        lightParams.insert(\"outer_angle\", outerAngle);\n    }\n\n    m_light = lightFactory->create(appleseedName().asChar(), lightParams);\n\n    asf::Matrix4d m = convert(dagPath().inclusiveMatrix());\n    asf::Matrix4d invM = convert(dagPath().inclusiveMatrixInverse());\n    asf::Transformd xform(m, invM);\n    m_light->set_transform(xform);\n}\n\nvoid LightExporter::flushEntity()\n{\n    mainAssembly().colors().insert(m_lightColor.release());\n    mainAssembly().lights().insert(m_light.release());\n}\n<commit_msg>fixed bugs when exporting lights<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) 2016 Esteban Tovagliari, 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 \"appleseedmaya\/exporters\/lightexporter.h\"\n\n\/\/ Standard headers.\n#include <sstream>\n\n\/\/ Maya headers.\n#include <maya\/MFnDagNode.h>\n\n\/\/ appleseed.foundation headers.\n#include \"foundation\/math\/scalar.h\"\n\n\/\/ appleseed.renderer headers.\n#include \"renderer\/api\/scene.h\"\n\n\/\/ appleseed.maya headers.\n#include \"appleseedmaya\/attributeutils.h\"\n#include \"appleseedmaya\/exporters\/exporterfactory.h\"\n\nnamespace asf = foundation;\nnamespace asr = renderer;\n\nvoid LightExporter::registerExporter()\n{\n    NodeExporterFactory::registerDagNodeExporter(\"directionalLight\", &LightExporter::create);\n    NodeExporterFactory::registerDagNodeExporter(\"pointLight\", &LightExporter::create);\n    NodeExporterFactory::registerDagNodeExporter(\"spotLight\", &LightExporter::create);\n}\n\nDagNodeExporter *LightExporter::create(\n    const MDagPath&                 path,\n    asr::Project&                   project,\n    AppleseedSession::SessionMode   sessionMode)\n{\n    return new LightExporter(path, project, sessionMode);\n}\n\nLightExporter::LightExporter(\n    const MDagPath&                 path,\n    asr::Project&                   project,\n    AppleseedSession::SessionMode   sessionMode)\n  : DagNodeExporter(path, project, sessionMode)\n{\n}\n\nbool LightExporter::supportsMotionBlur() const\n{\n    return false;\n}\n\nvoid LightExporter::createEntity(const AppleseedSession::Options& options)\n{\n    asr::LightFactoryRegistrar lightFactories;\n    const asr::ILightFactory *lightFactory = 0;\n    asr::ParamArray lightParams;\n\n    MFnDependencyNode depNodeFn(node());\n\n    MStatus status;\n    MPlug plug = depNodeFn.findPlug(\"intensity\", &status);\n    if(plug.isConnected())\n    {\n        \/\/ todo: add warning here...\n    }\n\n    float intensity = 1.0;\n    AttributeUtils::get(plug, intensity);\n\n    plug = depNodeFn.findPlug(\"color\", &status);\n    if(plug.isConnected())\n    {\n        \/\/ todo: add warning here...\n    }\n\n    \/\/ Create a color entity.\n    MString colorName = appleseedName() + MString(\"_intensity_color\");\n    {\n        MColor color(1.0f, 1.0f, 1.0f);\n        AttributeUtils::get(plug, color);\n        asr::ColorValueArray values(3, &color.r);\n\n        asr::ParamArray params;\n        params.insert(\"color_space\", \"linear_rgb\");\n        m_lightColor.reset(\n            asr::ColorEntityFactory::create(colorName.asChar(), params, values));\n    }\n\n    if(depNodeFn.typeName() == \"directionalLight\")\n    {\n        lightFactory = lightFactories.lookup(\"directional_light\");\n        lightParams.insert(\"irradiance\", colorName.asChar());\n        lightParams.insert(\"irradiance_multiplier\", intensity);\n    }\n    else if(depNodeFn.typeName() == \"pointLight\")\n    {\n        lightFactory = lightFactories.lookup(\"point_light\");\n        lightParams.insert(\"intensity\", colorName.asChar());\n        lightParams.insert(\"intensity_multiplier\", intensity);\n    }\n    else if(depNodeFn.typeName() == \"spotLight\")\n    {\n        lightFactory = lightFactories.lookup(\"spot_light\");\n        lightParams.insert(\"intensity\", colorName.asChar());\n        lightParams.insert(\"intensity_multiplier\", intensity);\n\n        MAngle coneAngle(20.0f, MAngle::kDegrees);\n        AttributeUtils::get(node(), \"coneAngle\", coneAngle);\n        lightParams.insert(\"inner_angle\", coneAngle.asDegrees());\n\n        MAngle penumbraAngle(5.0f, MAngle::kDegrees);\n        AttributeUtils::get(node(), \"penumbraAngle\", penumbraAngle);\n        const float outerAngle = coneAngle.asDegrees() + 2.0 * penumbraAngle.asDegrees();\n        lightParams.insert(\"outer_angle\", outerAngle);\n    }\n    else\n    {\n        RENDERER_LOG_WARNING(\n            \"Unsupported light type %s found. Skipping\",\n            depNodeFn.typeName().asChar());\n        return;\n    }\n\n    m_light = lightFactory->create(appleseedName().asChar(), lightParams);\n    asf::Matrix4d m = convert(dagPath().inclusiveMatrix());\n    asf::Matrix4d invM = convert(dagPath().inclusiveMatrixInverse());\n    asf::Transformd xform(m, invM);\n    m_light->set_transform(xform);\n}\n\nvoid LightExporter::flushEntity()\n{\n    if(m_light.get())\n    {\n        mainAssembly().colors().insert(m_lightColor.release());\n        mainAssembly().lights().insert(m_light.release());\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/== INCLUDES =================================================================\n\n#include <fstream>\n#include <limits>\n\n#include <OpenMesh\/Core\/System\/config.h>\n#include <OpenMesh\/Core\/IO\/BinaryHelper.hh>\n#include <OpenMesh\/Core\/IO\/writer\/VTKWriter.hh>\n#include <OpenMesh\/Core\/IO\/IOManager.hh>\n#include <OpenMesh\/Core\/System\/omstream.hh>\n#include <OpenMesh\/Core\/Utils\/color_cast.hh>\n\n\/\/=== NAMESPACES ==============================================================\n\nnamespace OpenMesh {\nnamespace IO {\n\n\/\/=== INSTANTIATE =============================================================\n\n_VTKWriter_  __VTKWriterinstance;\n_VTKWriter_& VTKWriter() { return __VTKWriterinstance; }\n\n\/\/=== IMPLEMENTATION ==========================================================\n\n_VTKWriter_::_VTKWriter_() { IOManager().register_module(this); }\n\n\/\/-----------------------------------------------------------------------------\n\nbool _VTKWriter_::write(const std::string& _filename, BaseExporter& _be, Options _opt, std::streamsize _precision) const\n{\n    std::ofstream out(_filename.c_str());\n\n    if (!out) {\n        omerr() << \"[VTKWriter] : cannot open file \" << _filename << std::endl;\n        return false;\n    }\n\n    return write(out, _be, _opt, _precision);\n}\n\n\/\/-----------------------------------------------------------------------------\n\nbool _VTKWriter_::write(std::ostream& _out, BaseExporter& _be, Options _opt, std::streamsize _precision) const\n{\n    unsigned int idx;\n    Vec3f v, n;\n    Vec2f t;\n    VertexHandle vh;\n    OpenMesh::Vec3f c;\n    OpenMesh::Vec4f cA;\n\n    \/\/ check exporter features\n    if (!check(_be, _opt)) {\n        return false;\n    }\n\n    \/\/ check writer features\n    if (!_opt.is_empty()) {\n        omlog() << \"[VTKWriter] : writer does not support any options\\n\";\n        return false;\n    }\n\n    omlog() << \"[VTKWriter] : write file\\n\";\n    _out.precision(_precision);\n\n    std::vector<VertexHandle> vhandles;\n    size_t polygon_table_size = 0;\n    size_t nf = _be.n_faces();\n    for (size_t i = 0; i < nf; ++i) {\n        polygon_table_size += _be.get_vhandles(FaceHandle(int(i)), vhandles);\n    }\n    polygon_table_size += nf;\n\n    \/\/ header\n    _out << \"# vtk DataFile Version 3.0\\n\";\n    _out << \"Generated by OpenMesh\\n\";\n    _out << \"ASCII\\n\";\n    _out << \"DATASET POLYDATA\\n\";\n\n    \/\/ points\n    _out << \"POINTS \" << _be.n_vertices() << \" float\\n\";\n    size_t nv = _be.n_vertices();\n    for (size_t i = 0; i < nv; ++i) {\n        Vec3f v = _be.point(VertexHandle(int(i)));\n        _out << v[0] << ' ' << v[1] << ' ' << v[2] << std::endl;\n    }\n\n    \/\/ faces\n    _out << \"POLYGONS \" << nf << ' ' << polygon_table_size << std::endl;\n    for (size_t i = 0; i < nf; ++i) {\n        _be.get_vhandles(FaceHandle(int(i)), vhandles);\n\n        _out << vhandles.size() << ' ';\n        for (size_t j = 0; j < vhandles.size(); ++j) {\n            _out << \" \" << vhandles[j].idx();\n        }\n        _out << std::endl;\n    }\n\n    return true;\n}\n\n\/\/=============================================================================\n} \/\/ namespace IO\n} \/\/ namespace OpenMesh\n\/\/=============================================================================\n<commit_msg>Removed unused variable<commit_after>\/\/== INCLUDES =================================================================\n\n#include <fstream>\n#include <limits>\n\n#include <OpenMesh\/Core\/System\/config.h>\n#include <OpenMesh\/Core\/IO\/BinaryHelper.hh>\n#include <OpenMesh\/Core\/IO\/writer\/VTKWriter.hh>\n#include <OpenMesh\/Core\/IO\/IOManager.hh>\n#include <OpenMesh\/Core\/System\/omstream.hh>\n#include <OpenMesh\/Core\/Utils\/color_cast.hh>\n\n\/\/=== NAMESPACES ==============================================================\n\nnamespace OpenMesh {\nnamespace IO {\n\n\/\/=== INSTANTIATE =============================================================\n\n_VTKWriter_  __VTKWriterinstance;\n_VTKWriter_& VTKWriter() { return __VTKWriterinstance; }\n\n\/\/=== IMPLEMENTATION ==========================================================\n\n_VTKWriter_::_VTKWriter_() { IOManager().register_module(this); }\n\n\/\/-----------------------------------------------------------------------------\n\nbool _VTKWriter_::write(const std::string& _filename, BaseExporter& _be, Options _opt, std::streamsize _precision) const\n{\n    std::ofstream out(_filename.c_str());\n\n    if (!out) {\n        omerr() << \"[VTKWriter] : cannot open file \" << _filename << std::endl;\n        return false;\n    }\n\n    return write(out, _be, _opt, _precision);\n}\n\n\/\/-----------------------------------------------------------------------------\n\nbool _VTKWriter_::write(std::ostream& _out, BaseExporter& _be, Options _opt, std::streamsize _precision) const\n{\n    Vec3f v, n;\n    Vec2f t;\n    VertexHandle vh;\n    OpenMesh::Vec3f c;\n    OpenMesh::Vec4f cA;\n\n    \/\/ check exporter features\n    if (!check(_be, _opt)) {\n        return false;\n    }\n\n    \/\/ check writer features\n    if (!_opt.is_empty()) {\n        omlog() << \"[VTKWriter] : writer does not support any options\\n\";\n        return false;\n    }\n\n    omlog() << \"[VTKWriter] : write file\\n\";\n    _out.precision(_precision);\n\n    std::vector<VertexHandle> vhandles;\n    size_t polygon_table_size = 0;\n    size_t nf = _be.n_faces();\n    for (size_t i = 0; i < nf; ++i) {\n        polygon_table_size += _be.get_vhandles(FaceHandle(int(i)), vhandles);\n    }\n    polygon_table_size += nf;\n\n    \/\/ header\n    _out << \"# vtk DataFile Version 3.0\\n\";\n    _out << \"Generated by OpenMesh\\n\";\n    _out << \"ASCII\\n\";\n    _out << \"DATASET POLYDATA\\n\";\n\n    \/\/ points\n    _out << \"POINTS \" << _be.n_vertices() << \" float\\n\";\n    size_t nv = _be.n_vertices();\n    for (size_t i = 0; i < nv; ++i) {\n        Vec3f v = _be.point(VertexHandle(int(i)));\n        _out << v[0] << ' ' << v[1] << ' ' << v[2] << std::endl;\n    }\n\n    \/\/ faces\n    _out << \"POLYGONS \" << nf << ' ' << polygon_table_size << std::endl;\n    for (size_t i = 0; i < nf; ++i) {\n        _be.get_vhandles(FaceHandle(int(i)), vhandles);\n\n        _out << vhandles.size() << ' ';\n        for (size_t j = 0; j < vhandles.size(); ++j) {\n            _out << \" \" << vhandles[j].idx();\n        }\n        _out << std::endl;\n    }\n\n    return true;\n}\n\n\/\/=============================================================================\n} \/\/ namespace IO\n} \/\/ namespace OpenMesh\n\/\/=============================================================================\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  query_handler.cpp\n\/\/  Argos\n\/\/\n\/\/  Created by Windoze on 12-7-8.\n\/\/  Copyright (c) 2012 0d0a.com. All rights reserved.\n\/\/\n\n#ifdef __GNUC__\n#pragma GCC diagnostic ignored \"-Wsign-compare\"\n#pragma GCC diagnostic ignored \"-Wsign-conversion\"\n#endif\n\n#include <iomanip>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/scoped_ptr.hpp>\n#include <boost\/interprocess\/streams\/vectorstream.hpp>\n#include <boost\/iostreams\/filtering_stream.hpp>\n#include <boost\/iostreams\/filter\/gzip.hpp>\n#include \"query_handler.hpp\"\n#include \"index\/full_index.h\"\n#include \"query\/enquire.h\"\n#include \"parser.h\"\n#include \"serialization.h\"\n#include \"common\/util.h\"\n\nnamespace http {\n    namespace server {\n        query_handler::query_handler(argos::index::Index* the_index)\n        : the_index_(the_index)\n        , idx_name(get_index_name(the_index))\n        , logger(Logger::getInstance(\"main\"))\n        , acc(Logger::getInstance(std::string(\"access.\")+idx_name))\n        , err(Logger::getInstance(std::string(\"error.\")+idx_name))\n        {}\n        \n        void query_handler::handle_request(const request& req, reply& rep)\n        {\n            timer t;\n            mem_counter mc;\n\n            argos::query::Query q;\n            boost::scoped_ptr<argos::common::ExecutionContext> pctx(the_index_->create_context());\n            argos::common::ExecutionContext &ctx=*(pctx.get());\n            try {\n                {\n                    \/\/ So far we cannot put content into mem_pool as the content may be written out by\n                    \/\/ other thread, this makes us cannot reset mem_pool before this function exiting.\n                    \/\/ Use vectorstream.swap_vector to set reply.content, w\/o copying and re-allocation\n                    boost::interprocess::basic_vectorstream<std::string> base_sst;\n                    std::ostream *psst=&base_sst;\n                    \n                    size_t qm=req.uri.find('?');\n                    if (qm==req.uri.npos) {\n                        rep=reply::stock_reply(reply::bad_request);\n                        throw argos::argos_logic_error(\"Request format error\");\n                    }\n                    bool ret=argos::parser::parse_query(req.uri.c_str()+qm+1,\n                                                        req.uri.size()-qm-1,\n                                                        q,\n                                                        ctx);\n                    if (!ret) {\n                        rep=reply::stock_reply(reply::bad_request);\n                        throw argos::argos_logic_error(\"Request format error\");\n                    }\n                    namespace io = boost::iostreams;\n                    io::filtering_ostream out;\n                    if(q.comp_) {\n                        out.push(io::gzip_compressor());\n                        out.push(base_sst);\n                        psst=&out;\n                    }\n                    \n                    argos::query::Enquire enq;\n                    argos::query::dvp_allocator_t da;\n                    argos::query::results_t results(da);\n                    argos::query::histograms_t histos(q.histos_.size());\n                    size_t total_hits=enq.execute(q, results, histos, ctx);\n                    \/\/ TODO: Use mem_pool to store output content\n                    argos::serialization::results_serializer ser(q.fmt.c_str(), q.get_field_list(), total_hits, results.size());\n                    argos::common::value_list_t vl;\n                    ser.serialize_prolog(*psst);\n                    ser.serialize_histos(*psst, q.histos_, histos);\n                    for (int i=0; i<results.size(); i++) {\n                        ctx.set_match_info(&results[i].match_info);\n                        ctx.get_index()->get_value_list(results[i].did, q.get_field_list(), vl, ctx);\n                        ser.serialize_doc(*psst, vl, i);\n                    }\n                    ser.serialize_epilog(*psst);\n                    \/\/ No allocation\n                    base_sst.swap_vector(rep.content);\n                    rep.status = reply::ok;\n                    rep.headers.resize(2 + (q.comp_ ? 1 : 0));\n                    rep.headers[0].name = \"Content-Length\";\n                    rep.headers[0].value = boost::lexical_cast<std::string>(rep.content.size());\n                    rep.headers[1].name = \"Content-Type\";\n                    rep.headers[1].value = ser.content_type();\n                    if (q.comp_) {\n                        \/\/ Content-Encoding: gzip\";\n                        rep.headers[2].name = \"Content-Encoding\";\n                        rep.headers[2].value = \"gzip\";\n                    }\n                }\n            }\n            catch(argos::argos_logic_error &e) {\n                rep=reply::stock_reply(reply::bad_request);\n                LOG4CPLUS_ERROR(err, \"CLIENT:\" << req.peer << \", CODE:\" << rep.status << \" - \" << req.uri);\n            }\n            catch(...) {\n                rep=reply::stock_reply(reply::internal_server_error);\n                LOG4CPLUS_ERROR(err, \"CLIENT:\" << req.peer << \", CODE:\" << rep.status << \" - \" << req.uri);\n            }\n\n            LOG4CPLUS_INFO(acc, \"CLIENT:\" << req.peer << \", CODE:\" << rep.status << \", TIME:\" << t*1000 << \"ms, MEM:\" << mc << \", CL:\" << rep.content.size() << \", QID:[\" << q.query_id_ << \"], URL:\" << req.uri);\n\n            \/\/ TODO: Set a meaningful threshold\n            if (ctx.temp_pool->get_used_size()>3*1024*1024) {\n                ctx.temp_pool->reset();\n            }\n        }\n    }   \/\/ End of namespace server\n}   \/\/ End of namespace http<commit_msg>No idea why this doesn't work with boost 1.55<commit_after>\/\/\n\/\/  query_handler.cpp\n\/\/  Argos\n\/\/\n\/\/  Created by Windoze on 12-7-8.\n\/\/  Copyright (c) 2012 0d0a.com. All rights reserved.\n\/\/\n\n#ifdef __GNUC__\n#pragma GCC diagnostic ignored \"-Wsign-compare\"\n#pragma GCC diagnostic ignored \"-Wsign-conversion\"\n#endif\n\n#include <iomanip>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/scoped_ptr.hpp>\n#include <boost\/interprocess\/streams\/vectorstream.hpp>\n#include <boost\/iostreams\/filtering_stream.hpp>\n#include <boost\/iostreams\/filter\/gzip.hpp>\n#include \"query_handler.hpp\"\n#include \"index\/full_index.h\"\n#include \"query\/enquire.h\"\n#include \"parser.h\"\n#include \"serialization.h\"\n#include \"common\/util.h\"\n\nnamespace http {\n    namespace server {\n        query_handler::query_handler(argos::index::Index* the_index)\n        : the_index_(the_index)\n        , idx_name(get_index_name(the_index))\n        , logger(Logger::getInstance(\"main\"))\n        , acc(Logger::getInstance(std::string(\"access.\")+idx_name))\n        , err(Logger::getInstance(std::string(\"error.\")+idx_name))\n        {}\n        \n        void query_handler::handle_request(const request& req, reply& rep)\n        {\n            timer t;\n            mem_counter mc;\n\n            argos::query::Query q;\n            boost::scoped_ptr<argos::common::ExecutionContext> pctx(the_index_->create_context());\n            argos::common::ExecutionContext &ctx=*(pctx.get());\n            try {\n                {\n                    \/\/ So far we cannot put content into mem_pool as the content may be written out by\n                    \/\/ other thread, this makes us cannot reset mem_pool before this function exiting.\n                    \/\/ Use vectorstream.swap_vector to set reply.content, w\/o copying and re-allocation\n                    boost::interprocess::basic_vectorstream<std::string> base_sst;\n                    std::ostream *psst=&base_sst;\n                    \n                    size_t qm=req.uri.find('?');\n                    if (qm==req.uri.npos) {\n                        rep=reply::stock_reply(reply::bad_request);\n                        throw argos::argos_logic_error(\"Request format error\");\n                    }\n                    bool ret=argos::parser::parse_query(req.uri.c_str()+qm+1,\n                                                        req.uri.size()-qm-1,\n                                                        q,\n                                                        ctx);\n                    if (!ret) {\n                        rep=reply::stock_reply(reply::bad_request);\n                        throw argos::argos_logic_error(\"Request format error\");\n                    }\n                    namespace io = boost::iostreams;\n                    io::filtering_ostream out;\n                    if(q.comp_) {\n                        out.push(io::gzip_compressor());\n                        out.push((std::ostream &)base_sst);\n                        psst=&out;\n                    }\n                    \n                    argos::query::Enquire enq;\n                    argos::query::dvp_allocator_t da;\n                    argos::query::results_t results(da);\n                    argos::query::histograms_t histos(q.histos_.size());\n                    size_t total_hits=enq.execute(q, results, histos, ctx);\n                    \/\/ TODO: Use mem_pool to store output content\n                    argos::serialization::results_serializer ser(q.fmt.c_str(), q.get_field_list(), total_hits, results.size());\n                    argos::common::value_list_t vl;\n                    ser.serialize_prolog(*psst);\n                    ser.serialize_histos(*psst, q.histos_, histos);\n                    for (int i=0; i<results.size(); i++) {\n                        ctx.set_match_info(&results[i].match_info);\n                        ctx.get_index()->get_value_list(results[i].did, q.get_field_list(), vl, ctx);\n                        ser.serialize_doc(*psst, vl, i);\n                    }\n                    ser.serialize_epilog(*psst);\n                    \/\/ No allocation\n                    base_sst.swap_vector(rep.content);\n                    rep.status = reply::ok;\n                    rep.headers.resize(2 + (q.comp_ ? 1 : 0));\n                    rep.headers[0].name = \"Content-Length\";\n                    rep.headers[0].value = boost::lexical_cast<std::string>(rep.content.size());\n                    rep.headers[1].name = \"Content-Type\";\n                    rep.headers[1].value = ser.content_type();\n                    if (q.comp_) {\n                        \/\/ Content-Encoding: gzip\";\n                        rep.headers[2].name = \"Content-Encoding\";\n                        rep.headers[2].value = \"gzip\";\n                    }\n                }\n            }\n            catch(argos::argos_logic_error &e) {\n                rep=reply::stock_reply(reply::bad_request);\n                LOG4CPLUS_ERROR(err, \"CLIENT:\" << req.peer << \", CODE:\" << rep.status << \" - \" << req.uri);\n            }\n            catch(...) {\n                rep=reply::stock_reply(reply::internal_server_error);\n                LOG4CPLUS_ERROR(err, \"CLIENT:\" << req.peer << \", CODE:\" << rep.status << \" - \" << req.uri);\n            }\n\n            LOG4CPLUS_INFO(acc, \"CLIENT:\" << req.peer << \", CODE:\" << rep.status << \", TIME:\" << t*1000 << \"ms, MEM:\" << mc << \", CL:\" << rep.content.size() << \", QID:[\" << q.query_id_ << \"], URL:\" << req.uri);\n\n            \/\/ TODO: Set a meaningful threshold\n            if (ctx.temp_pool->get_used_size()>3*1024*1024) {\n                ctx.temp_pool->reset();\n            }\n        }\n    }   \/\/ End of namespace server\n}   \/\/ End of namespace http<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2010-2012 RethinkDB, all rights reserved.\n#include \"buffer_cache\/mirrored\/page_repl_random.hpp\"\n\n#include \"buffer_cache\/mirrored\/mirrored.hpp\"\n#include \"logger.hpp\"\n#include \"perfmon\/perfmon.hpp\"\n\nevictable_t::evictable_t(mc_cache_t *_cache, bool loaded)\n    : eviction_priority(DEFAULT_EVICTION_PRIORITY), cache(_cache), page_repl_index(static_cast<size_t>(-1))\n{\n    cache->assert_thread();\n    if (loaded) {\n        insert_into_page_repl();\n    }\n}\n\nevictable_t::~evictable_t() {\n    cache->assert_thread();\n\n    \/\/ It's the subclass destructor's responsibility to run\n    \/\/\n    \/\/     if (in_page_repl()) { remove_from_page_repl(); }\n    rassert(!in_page_repl());\n}\n\nbool evictable_t::in_page_repl() {\n    return page_repl_index != static_cast<size_t>(-1);\n}\n\nvoid evictable_t::insert_into_page_repl() {\n    cache->assert_thread();\n    page_repl_index = cache->page_repl.array.size();\n    cache->page_repl.array.push_back(this);\n}\n\nvoid evictable_t::remove_from_page_repl() {\n    cache->assert_thread();\n\n    rassert(page_repl_index < cache->page_repl.array.size());\n    evictable_t *replacement = cache->page_repl.array.back();\n    replacement->page_repl_index = page_repl_index;\n    std::swap(cache->page_repl.array[page_repl_index],\n              cache->page_repl.array.back());\n    cache->page_repl.array.pop_back();\n    page_repl_index = static_cast<size_t>(-1);\n}\n\npage_repl_random_t::page_repl_random_t(size_t _unload_threshold, cache_t *_cache)\n    : unload_threshold(_unload_threshold),\n      cache(_cache)\n    {}\n\nbool page_repl_random_t::is_full(size_t space_needed) {\n    cache->assert_thread();\n    return array.size() + space_needed > unload_threshold;\n}\n\n\/\/perfmon_counter_t pm_n_blocks_evicted(\"blocks_evicted\");\n\nsize_t randsize(size_t n) {\n    size_t x = randint(0x10000);\n    x = x * 0x10000 + randint(0x10000);\n    x = x * 0x10000 + randint(0x10000);\n    x = x * 0x10000 + randint(0x10000);\n    return x % n;\n}\n\n\n\/\/ make_space tries to make sure that the number of blocks currently in memory is at least\n\/\/ 'space_needed' less than the user-specified memory limit.\nvoid page_repl_random_t::make_space(size_t space_needed) {\n    cache->assert_thread();\n    size_t target;\n    if (space_needed > unload_threshold) {\n        target = 0;\n    } else {\n        target = unload_threshold - space_needed;\n    }\n\n    while (array.size() > target) {\n        \/\/ Try to find a block we can unload. Blocks are ineligible to be unloaded if they are\n        \/\/ dirty or in use.\n        evictable_t *block_to_unload = NULL;\n        for (int tries = PAGE_REPL_NUM_TRIES; tries > 0; tries --) {\n            \/* Choose a block in memory at random. *\/\n            size_t n = randsize(array.size());\n            evictable_t *block = array[n];\n\n            \/\/ TODO we don't have code that sets buf_snapshot_t eviction priorities.\n\n            if (!block->safe_to_unload()) {\n                \/* nothing to do here, jetpack away to the next iteration of this loop *\/\n            } else if (block_to_unload == NULL) {\n                \/* The block is safe to unload, and our only candidate so far, so he's in *\/\n                block_to_unload = block;\n            } else if (block_to_unload->eviction_priority < block->eviction_priority) {\n                \/* This block is a better candidate than one before, he's in *\/\n                block_to_unload = block;\n            } else {\n                \/* Failed to find a better candidate, continue on our way. *\/\n            }\n        }\n\n        if (!block_to_unload) {\n            \/\/ The following log message blows the corostack because it has propensity to overlog.\n            \/\/ Commenting it out for 1.2. TODO: we might want to address it later in a different\n            \/\/ way (i.e. spawn_maybe?)\n            \/*\n            if (array.size() > target + (target \/ 100) + 10)\n                logWRN(\"cache %p exceeding memory target. %d blocks in memory, %d dirty, target is %d.\",\n                       cache, array.size(), cache->writeback.num_dirty_blocks(), target);\n            *\/\n            break;\n        }\n\n        \/\/ Remove it from the page repl and call its callback. Need to remove it from the repl first\n        \/\/ because its callback could delete it.\n        block_to_unload->remove_from_page_repl();\n        block_to_unload->unload();\n        ++cache->stats->pm_n_blocks_evicted;\n    }\n}\n\nevictable_t *page_repl_random_t::get_first_buf() {\n    cache->assert_thread();\n    return array.empty() ? NULL : array[0];\n}\n<commit_msg>Added a comment<commit_after>\/\/ Copyright 2010-2012 RethinkDB, all rights reserved.\n#include \"buffer_cache\/mirrored\/page_repl_random.hpp\"\n\n#include \"buffer_cache\/mirrored\/mirrored.hpp\"\n#include \"logger.hpp\"\n#include \"perfmon\/perfmon.hpp\"\n\nevictable_t::evictable_t(mc_cache_t *_cache, bool loaded)\n    : eviction_priority(DEFAULT_EVICTION_PRIORITY), cache(_cache), page_repl_index(static_cast<size_t>(-1))\n{\n    cache->assert_thread();\n    if (loaded) {\n        insert_into_page_repl();\n    }\n}\n\nevictable_t::~evictable_t() {\n    cache->assert_thread();\n\n    \/\/ It's the subclass destructor's responsibility to run\n    \/\/\n    \/\/     if (in_page_repl()) { remove_from_page_repl(); }\n    rassert(!in_page_repl());\n}\n\nbool evictable_t::in_page_repl() {\n    return page_repl_index != static_cast<size_t>(-1);\n}\n\nvoid evictable_t::insert_into_page_repl() {\n    cache->assert_thread();\n    page_repl_index = cache->page_repl.array.size();\n    cache->page_repl.array.push_back(this);\n}\n\nvoid evictable_t::remove_from_page_repl() {\n    cache->assert_thread();\n\n    rassert(page_repl_index < cache->page_repl.array.size());\n    evictable_t *replacement = cache->page_repl.array.back();\n    replacement->page_repl_index = page_repl_index;\n    std::swap(cache->page_repl.array[page_repl_index],\n              cache->page_repl.array.back());\n    cache->page_repl.array.pop_back();\n    page_repl_index = static_cast<size_t>(-1);\n}\n\npage_repl_random_t::page_repl_random_t(size_t _unload_threshold, cache_t *_cache)\n    : unload_threshold(_unload_threshold),\n      cache(_cache)\n    {}\n\nbool page_repl_random_t::is_full(size_t space_needed) {\n    cache->assert_thread();\n    return array.size() + space_needed > unload_threshold;\n}\n\n\/\/perfmon_counter_t pm_n_blocks_evicted(\"blocks_evicted\");\n\nsize_t randsize(size_t n) {\n    size_t x = randint(0x10000);\n    x = x * 0x10000 + randint(0x10000);\n    x = x * 0x10000 + randint(0x10000);\n    x = x * 0x10000 + randint(0x10000);\n    return x % n;\n}\n\n\n\/\/ make_space tries to make sure that the number of blocks currently in memory is at least\n\/\/ 'space_needed' less than the user-specified memory limit.\nvoid page_repl_random_t::make_space(size_t space_needed) {\n    cache->assert_thread();\n    \/\/ `target` is how many free blocks we want to have when we return.\n    size_t target;\n    if (space_needed > unload_threshold) {\n        \/\/ We cannot accomplish our goal of having at least `space_needed` less\n        \/\/ blocks in memory than the memory limit (`unload_threshold`), because\n        \/\/ `space_needed` is too large.\n        \/\/ However we try to get as close as possible by unloading as many blocks\n        \/\/ as we can.\n        target = 0;\n    } else {\n        target = unload_threshold - space_needed;\n    }\n\n    while (array.size() > target) {\n        \/\/ Try to find a block we can unload. Blocks are ineligible to be unloaded if they are\n        \/\/ dirty or in use.\n        evictable_t *block_to_unload = NULL;\n        for (int tries = PAGE_REPL_NUM_TRIES; tries > 0; tries --) {\n            \/* Choose a block in memory at random. *\/\n            size_t n = randsize(array.size());\n            evictable_t *block = array[n];\n\n            \/\/ TODO we don't have code that sets buf_snapshot_t eviction priorities.\n\n            if (!block->safe_to_unload()) {\n                \/* nothing to do here, jetpack away to the next iteration of this loop *\/\n            } else if (block_to_unload == NULL) {\n                \/* The block is safe to unload, and our only candidate so far, so he's in *\/\n                block_to_unload = block;\n            } else if (block_to_unload->eviction_priority < block->eviction_priority) {\n                \/* This block is a better candidate than one before, he's in *\/\n                block_to_unload = block;\n            } else {\n                \/* Failed to find a better candidate, continue on our way. *\/\n            }\n        }\n\n        if (!block_to_unload) {\n            \/\/ The following log message blows the corostack because it has propensity to overlog.\n            \/\/ Commenting it out for 1.2. TODO: we might want to address it later in a different\n            \/\/ way (i.e. spawn_maybe?)\n            \/*\n            if (array.size() > target + (target \/ 100) + 10)\n                logWRN(\"cache %p exceeding memory target. %d blocks in memory, %d dirty, target is %d.\",\n                       cache, array.size(), cache->writeback.num_dirty_blocks(), target);\n            *\/\n            break;\n        }\n\n        \/\/ Remove it from the page repl and call its callback. Need to remove it from the repl first\n        \/\/ because its callback could delete it.\n        block_to_unload->remove_from_page_repl();\n        block_to_unload->unload();\n        ++cache->stats->pm_n_blocks_evicted;\n    }\n}\n\nevictable_t *page_repl_random_t::get_first_buf() {\n    cache->assert_thread();\n    return array.empty() ? NULL : array[0];\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Funambol is a mobile platform developed by Funambol, Inc. \n * Copyright (C) 2008 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#include <sqlite3.h>\n\n#include \"client\/SQLiteKeyValueStore.h\"\n#include \"base\/util\/StringBuffer.h\"\n#include \"base\/util\/KeyValuePair.h\"\n\n    \nBEGIN_NAMESPACE\n    \nSQLiteKeyValueStore::SQLiteKeyValueStore(const StringBuffer & table, const StringBuffer & colKey,\n                                         const StringBuffer & colValue,\n                                         const StringBuffer & path)\n: SQLKeyValueStore(table,colKey,colValue), enumeration(*this)\n{\n    this->path = path;\n    db = NULL;\n    statement = NULL;\n}\n\n\nSQLiteKeyValueStore::~SQLiteKeyValueStore()\n{\n    if (statement)\n    {\n        sqlite3_finalize(statement);\n        statement = NULL;\n    }\n    disconnect();\n}\n\nEnumeration& SQLiteKeyValueStore::query(const StringBuffer & sql) const\n{\n    if (!db)\n    {\n        throw new StringBuffer \/*Exception*\/ (\"Not connected to database\");\n    }\n    \n    if (statement)\n    {\n        sqlite3_finalize(statement);\n        statement = NULL;\n    }\n    \n    int ret = sqlite3_prepare_v2(db, sql.c_str(), sql.length(), &statement, NULL);\n    if (ret == SQLITE_OK) {\n        enumeration.reinit(sqlite3_step(statement));\n    }\n    return enumeration;\n}\n\nint SQLiteKeyValueStore::execute(const StringBuffer & sql)\n{\n    connect();\n\n    sqlite3_stmt * stmt;\n    \n    int ret = sqlite3_prepare_v2(db, sql.c_str(), sql.length(), &stmt, NULL);\n    if (ret == SQLITE_OK) {\n        ret = sqlite3_step(stmt);\n    }\n    sqlite3_finalize(stmt);\n    \n    \n    if (ret == SQLITE_DONE)\n        ret = SQLITE_OK;\n    return ret;\n}\n\n\/**\n * Get all the properties that are currently defined.     \n *\/\nEnumeration& SQLiteKeyValueStore::getProperties() const\n{\n    StringBuffer sqlQuery = sqlCountAllString();\n    Enumeration& en = query(sqlQuery);\n    int rows = 0;\n    if (en.hasMoreElement())\n    {\n        KeyValuePair* kvp = (KeyValuePair*)en.getNextElement();\n        sscanf(kvp->getValue(), \"%d\", &rows);\n    }\n    if (rows == 0)\n        return en;\n    \n    sqlQuery = sqlGetAllString();\n    SQLiteKeyValueStoreEnumeration& en2 = (SQLiteKeyValueStoreEnumeration&)query(sqlQuery);\n    en2.totalRows = rows;\n    \n    return en;\n}\n\n\nint SQLiteKeyValueStore::connect()\n{\n    if (db)\n        return true;\n        \n    int ret = sqlite3_open(path, &db);\n    if (ret == SQLITE_OK)\n    {\n        return execute(\"BEGIN TRANSACTION;\");\n    }\n    return ret;\n}\n\n\nint SQLiteKeyValueStore::disconnect()\n{\n    if (db == NULL)\n        return true;\n    \n    execute(\"ROLLBACK TRANSACTION;\");\n    \n    int ret = sqlite3_close(db);\n    db = NULL;\n    \n    return ret;\n}\n\nint SQLiteKeyValueStore::save()\n{\n    if (statement)\n    {\n        sqlite3_finalize(statement);\n        statement = NULL;\n    }\n    return (\n        ((execute(\"COMMIT TRANSACTION;\") == SQLITE_OK) && (execute(\"BEGIN TRANSACTION;\") == SQLITE_OK))\n        ? 0 : 1);\n}\n\nEND_NAMESPACE\n<commit_msg>SQLiteKeyValueStore connect on construction<commit_after>\/*\n * Funambol is a mobile platform developed by Funambol, Inc. \n * Copyright (C) 2008 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#include <sqlite3.h>\n\n#include \"client\/SQLiteKeyValueStore.h\"\n#include \"base\/util\/StringBuffer.h\"\n#include \"base\/util\/KeyValuePair.h\"\n\n    \nBEGIN_NAMESPACE\n    \nSQLiteKeyValueStore::SQLiteKeyValueStore(const StringBuffer & table, const StringBuffer & colKey,\n                                         const StringBuffer & colValue,\n                                         const StringBuffer & path)\n: SQLKeyValueStore(table,colKey,colValue), enumeration(*this)\n{\n    this->path = path;\n    db = NULL;\n    statement = NULL;\n    \n    connect();\n}\n\n\nSQLiteKeyValueStore::~SQLiteKeyValueStore()\n{\n    if (statement)\n    {\n        sqlite3_finalize(statement);\n        statement = NULL;\n    }\n    disconnect();\n}\n\nEnumeration& SQLiteKeyValueStore::query(const StringBuffer & sql) const\n{\n    if (!db)\n    {\n        throw new StringBuffer \/*Exception*\/ (\"Not connected to database\");\n    }\n    \n    if (statement)\n    {\n        sqlite3_finalize(statement);\n        statement = NULL;\n    }\n    \n    int ret = sqlite3_prepare_v2(db, sql.c_str(), sql.length(), &statement, NULL);\n    if (ret == SQLITE_OK) {\n        enumeration.reinit(sqlite3_step(statement));\n    }\n    return enumeration;\n}\n\nint SQLiteKeyValueStore::execute(const StringBuffer & sql)\n{\n    connect();\n\n    sqlite3_stmt * stmt;\n    \n    int ret = sqlite3_prepare_v2(db, sql.c_str(), sql.length(), &stmt, NULL);\n    if (ret == SQLITE_OK) {\n        ret = sqlite3_step(stmt);\n    }\n    sqlite3_finalize(stmt);\n    \n    \n    if (ret == SQLITE_DONE)\n        ret = SQLITE_OK;\n    return ret;\n}\n\n\/**\n * Get all the properties that are currently defined.     \n *\/\nEnumeration& SQLiteKeyValueStore::getProperties() const\n{\n    StringBuffer sqlQuery = sqlCountAllString();\n    Enumeration& en = query(sqlQuery);\n    int rows = 0;\n    if (en.hasMoreElement())\n    {\n        KeyValuePair* kvp = (KeyValuePair*)en.getNextElement();\n        sscanf(kvp->getValue(), \"%d\", &rows);\n    }\n    if (rows == 0)\n        return en;\n    \n    sqlQuery = sqlGetAllString();\n    SQLiteKeyValueStoreEnumeration& en2 = (SQLiteKeyValueStoreEnumeration&)query(sqlQuery);\n    en2.totalRows = rows;\n    \n    return en;\n}\n\n\nint SQLiteKeyValueStore::connect()\n{\n    if (db)\n        return true;\n        \n    int ret = sqlite3_open(path, &db);\n    if (ret == SQLITE_OK)\n    {\n        return execute(\"BEGIN TRANSACTION;\");\n    }\n    return ret;\n}\n\n\nint SQLiteKeyValueStore::disconnect()\n{\n    if (db == NULL)\n        return true;\n    \n    execute(\"ROLLBACK TRANSACTION;\");\n    \n    int ret = sqlite3_close(db);\n    db = NULL;\n    \n    return ret;\n}\n\nint SQLiteKeyValueStore::save()\n{\n    if (statement)\n    {\n        sqlite3_finalize(statement);\n        statement = NULL;\n    }\n    return (\n        ((execute(\"COMMIT TRANSACTION;\") == SQLITE_OK) && (execute(\"BEGIN TRANSACTION;\") == SQLITE_OK))\n        ? 0 : 1);\n}\n\nEND_NAMESPACE\n<|endoftext|>"}
{"text":"<commit_before>\/*******************************************************************\n KNotes -- Notes for the KDE project\n\n Copyright (c) 2005, Michael Brade <brade@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 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 <qstringlist.h>\n\n#include <kmessagebox.h>\n#include <klocale.h>\n\n#include <libkcal\/calendarresources.h>\n\n#include \"knotes\/resourcemanager.h\"\n\n#include \"knotesalarm.h\"\n#include \"knotesglobalconfig.h\"\n\n\nKNotesAlarm::KNotesAlarm( KNotesResourceManager *manager, QObject *parent, const char *name )\n  : QObject( parent, name ),\n    m_manager( manager ),\n    m_checkTimer( 0, \"m_checkTimer\" )\n{\n    \/\/ TODO: fix timezone stuff?\n\n    connect( &m_checkTimer, SIGNAL(timeout()), SLOT(checkAlarms()) );\n    m_checkTimer.start( 1000 * KNotesGlobalConfig::self()->checkInterval() );  \/\/ interval in seconds\n}\n\nvoid KNotesAlarm::checkAlarms()\n{\n    QDateTime from = KNotesGlobalConfig::self()->alarmsLastChecked().addSecs( 1 );\n    if ( !from.isValid() )\n        from.setTime_t( 0 );\n\n    KNotesGlobalConfig::self()->setAlarmsLastChecked( QDateTime::currentDateTime() );\n    QValueList<KCal::Alarm *> alarms = m_manager->alarms( from, KNotesGlobalConfig::self()->alarmsLastChecked() );\n\n    QStringList notes;\n    QValueList<KCal::Alarm *>::ConstIterator it;\n    for ( it = alarms.begin(); it != alarms.end(); ++it )\n    {\n        KCal::Incidence *incidence = (*it)->parent();\n        notes += incidence->summary();\n    }\n\n    if ( !notes.isEmpty() )\n        KMessageBox::informationList( 0, i18n(\"The following notes triggered alarms:\"), notes, i18n(\"Alarm\") );\n}\n\n\n#include \"knotesalarm.moc\"\n<commit_msg>Minor optimisation<commit_after>\/*******************************************************************\n KNotes -- Notes for the KDE project\n\n Copyright (c) 2005, Michael Brade <brade@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 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 <qstringlist.h>\n\n#include <kmessagebox.h>\n#include <klocale.h>\n\n#include <libkcal\/calendarresources.h>\n\n#include \"knotes\/resourcemanager.h\"\n\n#include \"knotesalarm.h\"\n#include \"knotesglobalconfig.h\"\n\n\nKNotesAlarm::KNotesAlarm( KNotesResourceManager *manager, QObject *parent, const char *name )\n  : QObject( parent, name ),\n    m_manager( manager ),\n    m_checkTimer( 0, \"m_checkTimer\" )\n{\n    \/\/ TODO: fix timezone stuff?\n\n    connect( &m_checkTimer, SIGNAL(timeout()), SLOT(checkAlarms()) );\n    m_checkTimer.start( 1000 * KNotesGlobalConfig::self()->checkInterval() );  \/\/ interval in seconds\n}\n\nvoid KNotesAlarm::checkAlarms()\n{\n    QDateTime from = KNotesGlobalConfig::self()->alarmsLastChecked().addSecs( 1 );\n    if ( !from.isValid() )\n        from.setTime_t( 0 );\n\n    KNotesGlobalConfig::self()->setAlarmsLastChecked( QDateTime::currentDateTime() );\n    QValueList<KCal::Alarm *> alarms = m_manager->alarms( from, KNotesGlobalConfig::self()->alarmsLastChecked() );\n    if( alarms.isEmpty())\n        return;\n    QStringList notes;\n    QValueList<KCal::Alarm *>::ConstIterator it;\n    for ( it = alarms.begin(); it != alarms.end(); ++it )\n    {\n        KCal::Incidence *incidence = (*it)->parent();\n        notes += incidence->summary();\n    }\n\n    if ( !notes.isEmpty() )\n        KMessageBox::informationList( 0, i18n(\"The following notes triggered alarms:\"), notes, i18n(\"Alarm\") );\n}\n\n\n#include \"knotesalarm.moc\"\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#include \"condor_common.h\"\n\n#include \"condor_io.h\"\n\n#include \"qmgr.h\"\n#include \"condor_qmgr.h\"\n#include \"condor_debug.h\"\n#include \"condor_attributes.h\"\n#include \"condor_classad.h\"\n#include \"my_hostname.h\"\n#include \"my_username.h\"\n#include \"get_daemon_addr.h\"\n\nint open_url(char *, int, int);\nextern \"C\" char*\tget_schedd_addr(const char*, const char*); \nextern \"C\" int\t\tstrcmp_until(const char *, const char *, const char);\n\nReliSock *qmgmt_sock = NULL;\nstatic Qmgr_connection connection;\n\nQmgr_connection *\nConnectQ(char *qmgr_location, int timeout, bool read_only )\n{\n\tint\t\trval, fd, cmd, ok, is_local = FALSE;\n\tchar\ttmp_file[255];\n#if !defined(WIN32)\n\tstruct  passwd *pwd;\n#endif\n\tchar*\tscheddAddr = get_schedd_addr(0);\n\tchar*\tlocalScheddAddr = NULL;\n\n\tif( scheddAddr ) {\n\t\tlocalScheddAddr = strdup( scheddAddr );\n\t\tscheddAddr = NULL;\n\t} \n\n\t\t\/\/ get the address of the schedd to which we want a connection\n\tif( !qmgr_location || !*qmgr_location ) {\n\t\t\t\/* No schedd identified --- use local schedd *\/\n\t\tscheddAddr = localScheddAddr;\n\t\tis_local = TRUE;\n\t} else if(qmgr_location[0] != '<') {\n\t\t\t\/* Get schedd's IP address from collector *\/\n\t\tscheddAddr = get_schedd_addr(qmgr_location);\n\t} else {\n\t\t\t\/* We were passed the sinful string already *\/\n\t\tscheddAddr = qmgr_location;\n\t}\n\n\n\t\t\/\/ do we already have a connection active?\n\tif( qmgmt_sock ) {\n\t\t\t\/\/ yes; reject new connection (we can only handle one at a time)\n\t\tif( localScheddAddr ) free( localScheddAddr );\n\t\treturn( NULL );\n\t}\n\n\t\t\/\/ no connection active as of now; create a new one\n\tif(scheddAddr) {\n\t\tqmgmt_sock = new ReliSock();\n\t\tif ( timeout > 0 && qmgmt_sock ) {\n\t\t\tqmgmt_sock->timeout(timeout);\n\t\t}\n\t\tok = qmgmt_sock && qmgmt_sock->connect(scheddAddr, QMGR_PORT);\n\t\tif( !ok ) {\n\t\t\tdprintf(D_ALWAYS, \"Can't connect to queue manager\\n\");\n\t\t}\n\t} else {\n\t\tok = FALSE;\n\t\tif( qmgr_location ) {\n\t\t\tdprintf( D_ALWAYS, \"Can't find address of queue manager %s\\n\", \n\t\t\t\t\t qmgr_location );\n\t\t} else {\n\t\t\tdprintf( D_ALWAYS, \"Can't find address of local queue manager\\n\" );\n\t\t}\n\t}\n\n\tif( !ok ) {\n\t\tif ( localScheddAddr ) free(localScheddAddr);\n\t\tif( qmgmt_sock ) delete qmgmt_sock;\n\t\tqmgmt_sock = NULL;\n\t\treturn 0;\n\t}\n\n\t\t\/* Figure out if we're trying to connect to a remote queue, in\n\t\t   which case we'll set our username to \"nobody\" *\/\n\tif( localScheddAddr ) {\n\t\t\/\/mju replaced strcmp with new method that strcmp until char (:)\n\t\t\/\/so that we don't worry about the port number\n\t\tif( ! is_local && ! strcmp_until(localScheddAddr, scheddAddr, ':' ) ) {\n\t\t\tis_local = TRUE;\n\t\t}\n\t\telse {\n\t\t\tdprintf(D_FULLDEBUG,\"ConnectQ failed on check for localScheddAddr\\n\" );\n\t\t}\n\t\tfree(localScheddAddr);\n\t}\n\n\tchar *username = my_username();\n\n\tif ( !username ) {\n\t\tdprintf(D_FULLDEBUG,\"Failure getting my_username()\\n\", username );\n\t\tdelete qmgmt_sock;\n\t\tqmgmt_sock = NULL;\n\t\treturn( 0 );\n\t}\n\n\tdprintf(D_FULLDEBUG,\"Connecting to queue as user \\\"%s\\\"\\n\", username );\n\n\t\/* Get the schedd to handle Q ops. *\/\n\tqmgmt_sock->encode();\n\tcmd = QMGMT_CMD;\n\tqmgmt_sock->code(cmd);\n\t\n\tif ( read_only ) {\n\t\trval = InitializeReadOnlyConnection( username );\n\t} else {\n\t\trval = InitializeConnection( username );\n\t}\n\tfree( username );\n\n\tif (rval < 0) {\n\t\tdelete qmgmt_sock;\n\t\tqmgmt_sock = NULL;\n\t\treturn 0;\n\t}\n\n\tif ( !read_only ) {\n\t\tqmgmt_sock->authenticate();\n\t}\n\n\treturn &connection;\n}\n\n\n\/\/ we can ignore the parameter because there is only one connection\nbool\nDisconnectQ(Qmgr_connection *)\n{\n\tint rval;\n\n\tif( !qmgmt_sock ) return( false );\n\trval = CloseConnection();\n\tdelete qmgmt_sock;\n\tqmgmt_sock = NULL;\n\treturn( rval >= 0 );\n}\n\n\nvoid\nFreeJobAd(ClassAd *&ad)\n{\n\tdelete ad;\n\tad = NULL;\n}\n\nint\nSendSpoolFileBytes(char *filename)\n{\n\tqmgmt_sock->encode();\n\tif (qmgmt_sock->put_file(filename) < 0) {\t\t\n\t\treturn -1;\n\t}\n\n\treturn 0;\n\n}\n\n\nvoid\nWalkJobQueue(scan_func func)\n{\n\tClassAd *ad;\n\tint rval = 0;\n\n\tad = GetNextJob(1);\n\twhile (ad != NULL && rval >= 0) {\n\t\trval = func(ad);\n\t\tif (rval >= 0) {\n\t\t\tFreeJobAd(ad);\n\t\t\tad = GetNextJob(0);\n\t\t}\n\t} \n\tif (ad != NULL)\n\t\tFreeJobAd(ad);\n}\n\n\nint\nrusage_to_float(struct rusage ru, float *utime, float *stime )\n{\n\tfloat rval;\n\n\tif ( utime )\n\t\t*utime = (float) ru.ru_utime.tv_sec;\n\n\tif ( stime )\n\t\t*stime = (float) ru.ru_stime.tv_sec;\n\n\treturn 0;\n}\n\nint\nfloat_to_rusage(float utime, float stime, struct rusage *ru)\n{\n\tru->ru_utime.tv_sec = (time_t)utime;\n\tru->ru_stime.tv_sec = (time_t)stime;\n\tru->ru_utime.tv_usec = 0;\n\tru->ru_stime.tv_usec = 0;\n\treturn 0;\n}\n\n#if !defined(WIN32)\nint\nGetProc(int cl, int pr, PROC *p)\n{\n\tint disconn_when_done = 0;\n\tchar buf[ATTRLIST_MAX_EXPRESSION];\n\tfloat\tutime,stime;\n\tchar\t*s;\n\n\tif (!qmgmt_sock) {\n\t\tdisconn_when_done = 1;\n\t\tif( !ConnectQ(0) ) {\n\t\t\treturn -1;\n\t\t}\n\t}\n\n\tp->version_num = 3;\n\tp->id.cluster = cl;\n\tp->id.proc = pr;\n\n\tGetAttributeInt(cl, pr, ATTR_JOB_UNIVERSE, &(p->universe));\n\tGetAttributeInt(cl, pr, ATTR_WANT_CHECKPOINT, &(p->checkpoint));\n\tGetAttributeInt(cl, pr, ATTR_WANT_REMOTE_SYSCALLS, &(p->remote_syscalls));\n\tGetAttributeString(cl, pr, ATTR_OWNER, buf);\n\tp->owner = strdup(buf);\n\tGetAttributeInt(cl, pr, ATTR_Q_DATE, &(p->q_date));\n\tGetAttributeInt(cl, pr, ATTR_COMPLETION_DATE, &(p->completion_date));\n\tGetAttributeInt(cl, pr, ATTR_JOB_STATUS, &(p->status));\n\tGetAttributeInt(cl, pr, ATTR_JOB_PRIO, &(p->prio));\n\tGetAttributeInt(cl, pr, ATTR_JOB_NOTIFICATION, &(p->notification));\n\tGetAttributeInt(cl, pr, ATTR_IMAGE_SIZE, &(p->image_size));\n\tGetAttributeString(cl, pr, ATTR_JOB_ENVIRONMENT, buf);\n\tp->env = strdup(buf);\n\n\tp->n_cmds = 1;\n\tp->cmd = (char **) malloc(p->n_cmds * sizeof(char *));\n\tp->args = (char **) malloc(p->n_cmds * sizeof(char *));\n\tp->in = (char **) malloc(p->n_cmds * sizeof(char *));\n\tp->out = (char **) malloc(p->n_cmds * sizeof(char *));\n\tp->err = (char **) malloc(p->n_cmds * sizeof(char *));\n\tp->exit_status = (int *) malloc(p->n_cmds * sizeof(int));\n\n\tGetAttributeString(cl, pr, ATTR_JOB_CMD, buf);\n\tp->cmd[0] = strdup(buf);\n\tGetAttributeString(cl, pr, ATTR_JOB_ARGUMENTS, buf);\n\tp->args[0] = strdup(buf);\n\tGetAttributeString(cl, pr, ATTR_JOB_INPUT, buf);\n\tp->in[0] = strdup(buf);\n\tGetAttributeString(cl, pr, ATTR_JOB_OUTPUT, buf);\n\tp->out[0] = strdup(buf);\n\tGetAttributeString(cl, pr, ATTR_JOB_ERROR, buf);\n\tp->err[0] = strdup(buf);\n\tGetAttributeInt(cl, pr, ATTR_JOB_EXIT_STATUS, &(p->exit_status[0]));\n\n\tGetAttributeInt(cl, pr, ATTR_MIN_HOSTS, &(p->min_needed));\n\tGetAttributeInt(cl, pr, ATTR_MAX_HOSTS, &(p->max_needed));\n\n\tGetAttributeString(cl, pr, ATTR_JOB_ROOT_DIR, buf);\n\tp->rootdir = strdup(buf);\n\tGetAttributeString(cl, pr, ATTR_JOB_IWD, buf);\n\tp->iwd = strdup(buf);\n\tGetAttributeExpr(cl, pr, ATTR_REQUIREMENTS, buf);\n\ts = strchr(buf, '=');\n\tif (s) {\n\t\ts++;\n\t\tp->requirements = strdup(s);\n\t} \n\telse {\n\t\tp->requirements = strdup(buf);\n\t}\n\tGetAttributeExpr(cl, pr, ATTR_PREFERENCES, buf);\n\ts = strchr(buf, '=');\n\tif (s) {\n\t\ts++;\n\t\tp->preferences = strdup(s);\n\t} \n\telse {\n\t\tp->preferences = strdup(buf);\n\t}\n\n\tGetAttributeFloat(cl, pr, ATTR_JOB_LOCAL_USER_CPU, &utime);\n\tGetAttributeFloat(cl, pr, ATTR_JOB_LOCAL_SYS_CPU, &stime);\n\tfloat_to_rusage(utime, stime, &(p->local_usage));\n\n\tp->remote_usage = (struct rusage *) malloc(p->n_cmds * \n\t\tsizeof(struct rusage));\n\n\tmemset(p->remote_usage, 0, sizeof( struct rusage ));\n\n\tGetAttributeFloat(cl, pr, ATTR_JOB_REMOTE_USER_CPU, &utime);\n\tGetAttributeFloat(cl, pr, ATTR_JOB_REMOTE_SYS_CPU, &stime);\n\tfloat_to_rusage(utime, stime, &(p->remote_usage[0]));\n\t\n\n\tif (disconn_when_done) {\n\t\tDisconnectQ(&connection);\n\t}\n\treturn 0;\n}\n#endif\n<commit_msg>if we fail to authenticate in ConnectQ, probably because of a timeout, return failure<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#include \"condor_common.h\"\n\n#include \"condor_io.h\"\n\n#include \"qmgr.h\"\n#include \"condor_qmgr.h\"\n#include \"condor_debug.h\"\n#include \"condor_attributes.h\"\n#include \"condor_classad.h\"\n#include \"my_hostname.h\"\n#include \"my_username.h\"\n#include \"get_daemon_addr.h\"\n\nint open_url(char *, int, int);\nextern \"C\" char*\tget_schedd_addr(const char*, const char*); \nextern \"C\" int\t\tstrcmp_until(const char *, const char *, const char);\n\nReliSock *qmgmt_sock = NULL;\nstatic Qmgr_connection connection;\n\nQmgr_connection *\nConnectQ(char *qmgr_location, int timeout, bool read_only )\n{\n\tint\t\trval, fd, cmd, ok, is_local = FALSE;\n\tchar\ttmp_file[255];\n#if !defined(WIN32)\n\tstruct  passwd *pwd;\n#endif\n\tchar*\tscheddAddr = get_schedd_addr(0);\n\tchar*\tlocalScheddAddr = NULL;\n\n\tif( scheddAddr ) {\n\t\tlocalScheddAddr = strdup( scheddAddr );\n\t\tscheddAddr = NULL;\n\t} \n\n\t\t\/\/ get the address of the schedd to which we want a connection\n\tif( !qmgr_location || !*qmgr_location ) {\n\t\t\t\/* No schedd identified --- use local schedd *\/\n\t\tscheddAddr = localScheddAddr;\n\t\tis_local = TRUE;\n\t} else if(qmgr_location[0] != '<') {\n\t\t\t\/* Get schedd's IP address from collector *\/\n\t\tscheddAddr = get_schedd_addr(qmgr_location);\n\t} else {\n\t\t\t\/* We were passed the sinful string already *\/\n\t\tscheddAddr = qmgr_location;\n\t}\n\n\n\t\t\/\/ do we already have a connection active?\n\tif( qmgmt_sock ) {\n\t\t\t\/\/ yes; reject new connection (we can only handle one at a time)\n\t\tif( localScheddAddr ) free( localScheddAddr );\n\t\treturn( NULL );\n\t}\n\n\t\t\/\/ no connection active as of now; create a new one\n\tif(scheddAddr) {\n\t\tqmgmt_sock = new ReliSock();\n\t\tif ( timeout > 0 && qmgmt_sock ) {\n\t\t\tqmgmt_sock->timeout(timeout);\n\t\t}\n\t\tok = qmgmt_sock && qmgmt_sock->connect(scheddAddr, QMGR_PORT);\n\t\tif( !ok ) {\n\t\t\tdprintf(D_ALWAYS, \"Can't connect to queue manager\\n\");\n\t\t}\n\t} else {\n\t\tok = FALSE;\n\t\tif( qmgr_location ) {\n\t\t\tdprintf( D_ALWAYS, \"Can't find address of queue manager %s\\n\", \n\t\t\t\t\t qmgr_location );\n\t\t} else {\n\t\t\tdprintf( D_ALWAYS, \"Can't find address of local queue manager\\n\" );\n\t\t}\n\t}\n\n\tif( !ok ) {\n\t\tif ( localScheddAddr ) free(localScheddAddr);\n\t\tif( qmgmt_sock ) delete qmgmt_sock;\n\t\tqmgmt_sock = NULL;\n\t\treturn 0;\n\t}\n\n\t\t\/* Figure out if we're trying to connect to a remote queue, in\n\t\t   which case we'll set our username to \"nobody\" *\/\n\tif( localScheddAddr ) {\n\t\t\/\/mju replaced strcmp with new method that strcmp until char (:)\n\t\t\/\/so that we don't worry about the port number\n\t\tif( ! is_local && ! strcmp_until(localScheddAddr, scheddAddr, ':' ) ) {\n\t\t\tis_local = TRUE;\n\t\t}\n\t\telse {\n\t\t\tdprintf(D_FULLDEBUG,\"ConnectQ failed on check for localScheddAddr\\n\" );\n\t\t}\n\t\tfree(localScheddAddr);\n\t}\n\n\tchar *username = my_username();\n\n\tif ( !username ) {\n\t\tdprintf(D_FULLDEBUG,\"Failure getting my_username()\\n\", username );\n\t\tdelete qmgmt_sock;\n\t\tqmgmt_sock = NULL;\n\t\treturn( 0 );\n\t}\n\n\tdprintf(D_FULLDEBUG,\"Connecting to queue as user \\\"%s\\\"\\n\", username );\n\n\t\/* Get the schedd to handle Q ops. *\/\n\tqmgmt_sock->encode();\n\tcmd = QMGMT_CMD;\n\tqmgmt_sock->code(cmd);\n\t\n\tif ( read_only ) {\n\t\trval = InitializeReadOnlyConnection( username );\n\t} else {\n\t\trval = InitializeConnection( username );\n\t}\n\tfree( username );\n\n\tif (rval < 0) {\n\t\tdelete qmgmt_sock;\n\t\tqmgmt_sock = NULL;\n\t\treturn 0;\n\t}\n\n\tif ( !read_only ) {\n\t\tif (!qmgmt_sock->authenticate()) {\n\t\t\tdelete qmgmt_sock;\n\t\t\tqmgmt_sock = NULL;\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\treturn &connection;\n}\n\n\n\/\/ we can ignore the parameter because there is only one connection\nbool\nDisconnectQ(Qmgr_connection *)\n{\n\tint rval;\n\n\tif( !qmgmt_sock ) return( false );\n\trval = CloseConnection();\n\tdelete qmgmt_sock;\n\tqmgmt_sock = NULL;\n\treturn( rval >= 0 );\n}\n\n\nvoid\nFreeJobAd(ClassAd *&ad)\n{\n\tdelete ad;\n\tad = NULL;\n}\n\nint\nSendSpoolFileBytes(char *filename)\n{\n\tqmgmt_sock->encode();\n\tif (qmgmt_sock->put_file(filename) < 0) {\t\t\n\t\treturn -1;\n\t}\n\n\treturn 0;\n\n}\n\n\nvoid\nWalkJobQueue(scan_func func)\n{\n\tClassAd *ad;\n\tint rval = 0;\n\n\tad = GetNextJob(1);\n\twhile (ad != NULL && rval >= 0) {\n\t\trval = func(ad);\n\t\tif (rval >= 0) {\n\t\t\tFreeJobAd(ad);\n\t\t\tad = GetNextJob(0);\n\t\t}\n\t} \n\tif (ad != NULL)\n\t\tFreeJobAd(ad);\n}\n\n\nint\nrusage_to_float(struct rusage ru, float *utime, float *stime )\n{\n\tfloat rval;\n\n\tif ( utime )\n\t\t*utime = (float) ru.ru_utime.tv_sec;\n\n\tif ( stime )\n\t\t*stime = (float) ru.ru_stime.tv_sec;\n\n\treturn 0;\n}\n\nint\nfloat_to_rusage(float utime, float stime, struct rusage *ru)\n{\n\tru->ru_utime.tv_sec = (time_t)utime;\n\tru->ru_stime.tv_sec = (time_t)stime;\n\tru->ru_utime.tv_usec = 0;\n\tru->ru_stime.tv_usec = 0;\n\treturn 0;\n}\n\n#if !defined(WIN32)\nint\nGetProc(int cl, int pr, PROC *p)\n{\n\tint disconn_when_done = 0;\n\tchar buf[ATTRLIST_MAX_EXPRESSION];\n\tfloat\tutime,stime;\n\tchar\t*s;\n\n\tif (!qmgmt_sock) {\n\t\tdisconn_when_done = 1;\n\t\tif( !ConnectQ(0) ) {\n\t\t\treturn -1;\n\t\t}\n\t}\n\n\tp->version_num = 3;\n\tp->id.cluster = cl;\n\tp->id.proc = pr;\n\n\tGetAttributeInt(cl, pr, ATTR_JOB_UNIVERSE, &(p->universe));\n\tGetAttributeInt(cl, pr, ATTR_WANT_CHECKPOINT, &(p->checkpoint));\n\tGetAttributeInt(cl, pr, ATTR_WANT_REMOTE_SYSCALLS, &(p->remote_syscalls));\n\tGetAttributeString(cl, pr, ATTR_OWNER, buf);\n\tp->owner = strdup(buf);\n\tGetAttributeInt(cl, pr, ATTR_Q_DATE, &(p->q_date));\n\tGetAttributeInt(cl, pr, ATTR_COMPLETION_DATE, &(p->completion_date));\n\tGetAttributeInt(cl, pr, ATTR_JOB_STATUS, &(p->status));\n\tGetAttributeInt(cl, pr, ATTR_JOB_PRIO, &(p->prio));\n\tGetAttributeInt(cl, pr, ATTR_JOB_NOTIFICATION, &(p->notification));\n\tGetAttributeInt(cl, pr, ATTR_IMAGE_SIZE, &(p->image_size));\n\tGetAttributeString(cl, pr, ATTR_JOB_ENVIRONMENT, buf);\n\tp->env = strdup(buf);\n\n\tp->n_cmds = 1;\n\tp->cmd = (char **) malloc(p->n_cmds * sizeof(char *));\n\tp->args = (char **) malloc(p->n_cmds * sizeof(char *));\n\tp->in = (char **) malloc(p->n_cmds * sizeof(char *));\n\tp->out = (char **) malloc(p->n_cmds * sizeof(char *));\n\tp->err = (char **) malloc(p->n_cmds * sizeof(char *));\n\tp->exit_status = (int *) malloc(p->n_cmds * sizeof(int));\n\n\tGetAttributeString(cl, pr, ATTR_JOB_CMD, buf);\n\tp->cmd[0] = strdup(buf);\n\tGetAttributeString(cl, pr, ATTR_JOB_ARGUMENTS, buf);\n\tp->args[0] = strdup(buf);\n\tGetAttributeString(cl, pr, ATTR_JOB_INPUT, buf);\n\tp->in[0] = strdup(buf);\n\tGetAttributeString(cl, pr, ATTR_JOB_OUTPUT, buf);\n\tp->out[0] = strdup(buf);\n\tGetAttributeString(cl, pr, ATTR_JOB_ERROR, buf);\n\tp->err[0] = strdup(buf);\n\tGetAttributeInt(cl, pr, ATTR_JOB_EXIT_STATUS, &(p->exit_status[0]));\n\n\tGetAttributeInt(cl, pr, ATTR_MIN_HOSTS, &(p->min_needed));\n\tGetAttributeInt(cl, pr, ATTR_MAX_HOSTS, &(p->max_needed));\n\n\tGetAttributeString(cl, pr, ATTR_JOB_ROOT_DIR, buf);\n\tp->rootdir = strdup(buf);\n\tGetAttributeString(cl, pr, ATTR_JOB_IWD, buf);\n\tp->iwd = strdup(buf);\n\tGetAttributeExpr(cl, pr, ATTR_REQUIREMENTS, buf);\n\ts = strchr(buf, '=');\n\tif (s) {\n\t\ts++;\n\t\tp->requirements = strdup(s);\n\t} \n\telse {\n\t\tp->requirements = strdup(buf);\n\t}\n\tGetAttributeExpr(cl, pr, ATTR_PREFERENCES, buf);\n\ts = strchr(buf, '=');\n\tif (s) {\n\t\ts++;\n\t\tp->preferences = strdup(s);\n\t} \n\telse {\n\t\tp->preferences = strdup(buf);\n\t}\n\n\tGetAttributeFloat(cl, pr, ATTR_JOB_LOCAL_USER_CPU, &utime);\n\tGetAttributeFloat(cl, pr, ATTR_JOB_LOCAL_SYS_CPU, &stime);\n\tfloat_to_rusage(utime, stime, &(p->local_usage));\n\n\tp->remote_usage = (struct rusage *) malloc(p->n_cmds * \n\t\tsizeof(struct rusage));\n\n\tmemset(p->remote_usage, 0, sizeof( struct rusage ));\n\n\tGetAttributeFloat(cl, pr, ATTR_JOB_REMOTE_USER_CPU, &utime);\n\tGetAttributeFloat(cl, pr, ATTR_JOB_REMOTE_SYS_CPU, &stime);\n\tfloat_to_rusage(utime, stime, &(p->remote_usage[0]));\n\t\n\n\tif (disconn_when_done) {\n\t\tDisconnectQ(&connection);\n\t}\n\treturn 0;\n}\n#endif\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.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\/\/ Qt includes\n#include <QDebug>\n#include <QDir>\n#include <QRegExp>\n#include <QString>\n#include <QStringList>\n\n#include \"ctkUtils.h\"\n\n\/\/ STD includes\n#include <algorithm>\n#include <limits>\n\n#ifdef _MSC_VER\n  #pragma warning(disable: 4996)\n#endif\n\n\/\/------------------------------------------------------------------------------\nvoid ctk::qListToSTLVector(const QStringList& list,\n                                 std::vector<char*>& vector)\n{\n  \/\/ Resize if required\n  if (list.count() != static_cast<int>(vector.size()))\n    {\n    vector.resize(list.count());\n    }\n  for (int i = 0; i < list.count(); ++i)\n    {\n    \/\/ Allocate memory\n    char* str = new char[list[i].size()+1];\n    strcpy(str, list[i].toLatin1());\n    vector[i] = str;\n    }\n}\n\n\/\/------------------------------------------------------------------------------\nnamespace\n{\n\/\/\/ Convert QString to std::string\nstatic std::string qStringToSTLString(const QString& qstring)\n{\n  return qstring.toStdString();\n}\n}\n\n\/\/------------------------------------------------------------------------------\nvoid ctk::qListToSTLVector(const QStringList& list,\n                                 std::vector<std::string>& vector)\n{\n  \/\/ To avoid unnessesary relocations, let's reserve the required amount of space\n  vector.reserve(list.size());\n  std::transform(list.begin(),list.end(),std::back_inserter(vector),&qStringToSTLString);\n}\n\n\/\/------------------------------------------------------------------------------\nvoid ctk::stlVectorToQList(const std::vector<std::string>& vector,\n                                 QStringList& list)\n{\n  std::transform(vector.begin(),vector.end(),std::back_inserter(list),&QString::fromStdString);\n}\n\n\/\/-----------------------------------------------------------------------------\nconst char *ctkNameFilterRegExp =\n  \"^(.*)\\\\(([a-zA-Z0-9_.*? +;#\\\\-\\\\[\\\\]@\\\\{\\\\}\/!<>\\\\$%&=^~:\\\\|]*)\\\\)$\";\nconst char *ctkValidWildCard =\n  \"^[\\\\w\\\\s\\\\.\\\\*\\\\_\\\\~\\\\$\\\\[\\\\]]+$\";\n\n\/\/-----------------------------------------------------------------------------\nQStringList ctk::nameFilterToExtensions(const QString& nameFilter)\n{\n  QRegExp regexp(QString::fromLatin1(ctkNameFilterRegExp));\n  int i = regexp.indexIn(nameFilter);\n  if (i < 0)\n    {\n    QRegExp isWildCard(QString::fromLatin1(ctkValidWildCard));\n    if (isWildCard.indexIn(nameFilter) >= 0)\n      {\n      return QStringList(nameFilter);\n      }\n    return QStringList();\n    }\n  QString f = regexp.cap(2);\n  return f.split(QLatin1Char(' '), QString::SkipEmptyParts);\n}\n\n\/\/-----------------------------------------------------------------------------\nQStringList ctk::nameFiltersToExtensions(const QStringList& nameFilters)\n{\n  QStringList extensions;\n  foreach(const QString& nameFilter, nameFilters)\n    {\n    extensions << nameFilterToExtensions(nameFilter);\n    }\n  return extensions;\n}\n\n\/\/-----------------------------------------------------------------------------\nQString ctk::extensionToRegExp(const QString& extension)\n{\n  \/\/ typically *.jpg\n  QRegExp extensionExtractor(\"\\\\*\\\\.(\\\\w+)\");\n  int pos = extensionExtractor.indexIn(extension);\n  if (pos < 0)\n    {\n    return QString();\n    }\n  return \".*\\\\.\" + extensionExtractor.cap(1) + \"?$\";\n}\n\n\/\/-----------------------------------------------------------------------------\nQRegExp ctk::nameFiltersToRegExp(const QStringList& nameFilters)\n{\n  QString pattern;\n  foreach(const QString& nameFilter, nameFilters)\n    {\n    foreach(const QString& extension, nameFilterToExtensions(nameFilter))\n      {\n      QString regExpExtension = extensionToRegExp(extension);\n      if (!regExpExtension.isEmpty())\n        {\n        if (pattern.isEmpty())\n          {\n          pattern = \"(\";\n          }\n        else\n          {\n          pattern += \"|\";\n          }\n        pattern +=regExpExtension;\n        }\n      }\n    }\n  if (pattern.isEmpty())\n    {\n    pattern = \".+\";\n    }\n  else\n    {\n    pattern += \")\";\n    }\n  return QRegExp(pattern);\n}\n\n\/\/-----------------------------------------------------------------------------\nint ctk::significantDecimals(double value, int defaultDecimals)\n{\n  if (value == 0.\n      || qAbs(value) == std::numeric_limits<double>::infinity())\n    {\n    return 0;\n    }\n  if (value != value) \/\/ is NaN\n    {\n    return -1;\n    }\n  QString number = QString::number(value, 'f', 16);\n  QString fractional = number.section('.', 1, 1);\n  Q_ASSERT(fractional.length() == 16);\n  QChar previous;\n  int previousRepeat=0;\n  bool only0s = true;\n  bool isUnit = value > -1. && value < 1.;\n  for (int i = 0; i < fractional.length(); ++i)\n    {\n    QChar digit = fractional.at(i);\n    if (digit != '0')\n      {\n      only0s = false;\n      }\n    \/\/ Has the digit been repeated too many times ?\n    if (digit == previous && previousRepeat == 2 &&\n        !only0s)\n      {\n      if (digit == '0' || digit == '9')\n        {\n        return i - previousRepeat;\n        }\n      return i;\n      }\n    \/\/ Last digit\n    if (i == fractional.length() - 1)\n      {\n      \/\/ If we are here, that means that the right number of significant\n      \/\/ decimals for the number has not been figured out yet.\n      if (previousRepeat > 2 && !(only0s && isUnit) )\n        {\n        return i - previousRepeat;\n        }\n      \/\/ If defaultDecimals has been provided, just use it.\n      if (defaultDecimals >= 0)\n        {\n        return defaultDecimals;\n        }\n      return fractional.length();\n      }\n    \/\/ get ready for next\n    if (previous != digit)\n      {\n      previous = digit;\n      previousRepeat = 1;\n      }\n    else\n      {\n      ++previousRepeat;\n      }\n    }\n  Q_ASSERT(false);\n  return fractional.length();\n}\n\n\/\/-----------------------------------------------------------------------------\nint ctk::orderOfMagnitude(double value)\n{\n  value = qAbs(value);\n  if (value == 0.\n      || value == std::numeric_limits<double>::infinity()\n      || value != value \/\/ is NaN\n      || value < std::numeric_limits<double>::epsilon() \/\/ is tool small to compute\n  )\n    {\n    return std::numeric_limits<int>::min();\n    }\n  double magnitude = 1.00000000000000001;\n  int magnitudeOrder = 0;\n\n  int magnitudeStep = 1;\n  double magnitudeFactor = 10;\n\n  if (value < 1.)\n    {\n    magnitudeOrder = -1;\n    magnitudeStep = -1;\n    magnitudeFactor = 0.1;\n    }\n\n  double epsilon = std::numeric_limits<double>::epsilon();\n  while ( (magnitudeStep > 0 && value >= magnitude) ||\n          (magnitudeStep < 0 && value < magnitude - epsilon))\n    {\n    magnitude *= magnitudeFactor;\n    magnitudeOrder += magnitudeStep;\n    }\n  \/\/ we went 1 order too far, so decrement it\n  return magnitudeOrder - magnitudeStep;\n}\n\n\/\/-----------------------------------------------------------------------------\ndouble ctk::closestPowerOfTen(double _value)\n{\n  const double sign = _value >= 0. ? 1 : -1;\n  const double value = qAbs(_value);\n  if (value == 0.\n      || value == std::numeric_limits<double>::infinity()\n      || value != value \/\/ is NaN\n      || value < std::numeric_limits<double>::epsilon() \/\/ is denormalized\n  )\n    {\n    return _value;\n    }\n\n  double magnitude = 1.;\n  double nextMagnitude = magnitude;\n\n  if (value >= 1.)\n    {\n    do\n      {\n      magnitude = nextMagnitude;\n      nextMagnitude *= 10.;\n      }\n    while ( (value - magnitude)  > (nextMagnitude - value) );\n    }\n  else\n    {\n    do\n      {\n      magnitude = nextMagnitude;\n      nextMagnitude \/= 10.;\n      }\n    while ( (value - magnitude)  < (nextMagnitude - value) );\n    }\n  return magnitude * sign;\n}\n\n\/\/-----------------------------------------------------------------------------\nbool ctk::removeDirRecursively(const QString & dirName)\n{\n  bool result = false;\n  QDir dir(dirName);\n\n  if (dir.exists(dirName))\n    {\n    foreach (QFileInfo info, dir.entryInfoList(QDir::NoDotAndDotDot | QDir::System | QDir::Hidden  | QDir::AllDirs | QDir::Files, QDir::DirsFirst))\n      {\n      if (info.isDir())\n        {\n        result = ctk::removeDirRecursively(info.absoluteFilePath());\n        }\n      else\n        {\n        result = QFile::remove(info.absoluteFilePath());\n        }\n\n      if (!result)\n        {\n        return result;\n        }\n      }\n    result = dir.rmdir(dirName);\n    }\n\n  return result;\n}\n\n\/\/-----------------------------------------------------------------------------\nbool ctk::copyDirRecursively(const QString &srcPath, const QString &dstPath)\n{\n  \/\/ See http:\/\/stackoverflow.com\/questions\/2536524\/copy-directory-using-qt\n  if (!QFile::exists(srcPath))\n    {\n    qCritical() << \"ctk::copyDirRecursively: Failed to copy nonexistent directory\" << srcPath;\n    return false;\n    }\n\n  QDir srcDir(srcPath);\n  if (!srcDir.relativeFilePath(dstPath).startsWith(\"..\"))\n    {\n    qCritical() << \"ctk::copyDirRecursively: Cannot copy directory\" << srcPath << \"into itself\" << dstPath;\n    return false;\n    }\n\n\n  QDir parentDstDir(QFileInfo(dstPath).path());\n  if (!QFile::exists(dstPath) && !parentDstDir.mkdir(QFileInfo(dstPath).fileName()))\n    {\n    qCritical() << \"ctk::copyDirRecursively: Failed to create destination directory\" << QFileInfo(dstPath).fileName();\n    return false;\n    }\n\n  foreach(const QFileInfo &info, srcDir.entryInfoList(QDir::Dirs | QDir::Files | QDir::NoDotAndDotDot))\n    {\n    QString srcItemPath = srcPath + \"\/\" + info.fileName();\n    QString dstItemPath = dstPath + \"\/\" + info.fileName();\n    if (info.isDir())\n      {\n      if (!ctk::copyDirRecursively(srcItemPath, dstItemPath))\n        {\n        qCritical() << \"ctk::copyDirRecursively: Failed to copy files from \" << srcItemPath << \" into \" << dstItemPath;\n        return false;\n        }\n      }\n    else if (info.isFile())\n      {\n      if (!QFile::copy(srcItemPath, dstItemPath))\n        {\n        return false;\n        }\n      }\n    else\n      {\n      qWarning() << \"ctk::copyDirRecursively: Unhandled item\" << info.filePath();\n      }\n    }\n  return true;\n}\n\n\/\/-----------------------------------------------------------------------------\nQString ctk::qtHandleToString(Qt::HANDLE handle)\n{\n  QString str;\n  QTextStream s(&str);\n  s << handle;\n  return str;\n}\n\n\/\/-----------------------------------------------------------------------------\nqint64 ctk::msecsTo(const QDateTime& t1, const QDateTime& t2)\n{\n  QDateTime utcT1 = t1.toUTC();\n  QDateTime utcT2 = t2.toUTC();\n\n  return static_cast<qint64>(utcT1.daysTo(utcT2)) * static_cast<qint64>(1000*3600*24)\n      + static_cast<qint64>(utcT1.time().msecsTo(utcT2.time()));\n}\n<commit_msg>BUG: ctkUtils: Update removeDirRecursively to support relative paths<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.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\/\/ Qt includes\n#include <QDebug>\n#include <QDir>\n#include <QRegExp>\n#include <QString>\n#include <QStringList>\n\n#include \"ctkUtils.h\"\n\n\/\/ STD includes\n#include <algorithm>\n#include <limits>\n\n#ifdef _MSC_VER\n  #pragma warning(disable: 4996)\n#endif\n\n\/\/------------------------------------------------------------------------------\nvoid ctk::qListToSTLVector(const QStringList& list,\n                                 std::vector<char*>& vector)\n{\n  \/\/ Resize if required\n  if (list.count() != static_cast<int>(vector.size()))\n    {\n    vector.resize(list.count());\n    }\n  for (int i = 0; i < list.count(); ++i)\n    {\n    \/\/ Allocate memory\n    char* str = new char[list[i].size()+1];\n    strcpy(str, list[i].toLatin1());\n    vector[i] = str;\n    }\n}\n\n\/\/------------------------------------------------------------------------------\nnamespace\n{\n\/\/\/ Convert QString to std::string\nstatic std::string qStringToSTLString(const QString& qstring)\n{\n  return qstring.toStdString();\n}\n}\n\n\/\/------------------------------------------------------------------------------\nvoid ctk::qListToSTLVector(const QStringList& list,\n                                 std::vector<std::string>& vector)\n{\n  \/\/ To avoid unnessesary relocations, let's reserve the required amount of space\n  vector.reserve(list.size());\n  std::transform(list.begin(),list.end(),std::back_inserter(vector),&qStringToSTLString);\n}\n\n\/\/------------------------------------------------------------------------------\nvoid ctk::stlVectorToQList(const std::vector<std::string>& vector,\n                                 QStringList& list)\n{\n  std::transform(vector.begin(),vector.end(),std::back_inserter(list),&QString::fromStdString);\n}\n\n\/\/-----------------------------------------------------------------------------\nconst char *ctkNameFilterRegExp =\n  \"^(.*)\\\\(([a-zA-Z0-9_.*? +;#\\\\-\\\\[\\\\]@\\\\{\\\\}\/!<>\\\\$%&=^~:\\\\|]*)\\\\)$\";\nconst char *ctkValidWildCard =\n  \"^[\\\\w\\\\s\\\\.\\\\*\\\\_\\\\~\\\\$\\\\[\\\\]]+$\";\n\n\/\/-----------------------------------------------------------------------------\nQStringList ctk::nameFilterToExtensions(const QString& nameFilter)\n{\n  QRegExp regexp(QString::fromLatin1(ctkNameFilterRegExp));\n  int i = regexp.indexIn(nameFilter);\n  if (i < 0)\n    {\n    QRegExp isWildCard(QString::fromLatin1(ctkValidWildCard));\n    if (isWildCard.indexIn(nameFilter) >= 0)\n      {\n      return QStringList(nameFilter);\n      }\n    return QStringList();\n    }\n  QString f = regexp.cap(2);\n  return f.split(QLatin1Char(' '), QString::SkipEmptyParts);\n}\n\n\/\/-----------------------------------------------------------------------------\nQStringList ctk::nameFiltersToExtensions(const QStringList& nameFilters)\n{\n  QStringList extensions;\n  foreach(const QString& nameFilter, nameFilters)\n    {\n    extensions << nameFilterToExtensions(nameFilter);\n    }\n  return extensions;\n}\n\n\/\/-----------------------------------------------------------------------------\nQString ctk::extensionToRegExp(const QString& extension)\n{\n  \/\/ typically *.jpg\n  QRegExp extensionExtractor(\"\\\\*\\\\.(\\\\w+)\");\n  int pos = extensionExtractor.indexIn(extension);\n  if (pos < 0)\n    {\n    return QString();\n    }\n  return \".*\\\\.\" + extensionExtractor.cap(1) + \"?$\";\n}\n\n\/\/-----------------------------------------------------------------------------\nQRegExp ctk::nameFiltersToRegExp(const QStringList& nameFilters)\n{\n  QString pattern;\n  foreach(const QString& nameFilter, nameFilters)\n    {\n    foreach(const QString& extension, nameFilterToExtensions(nameFilter))\n      {\n      QString regExpExtension = extensionToRegExp(extension);\n      if (!regExpExtension.isEmpty())\n        {\n        if (pattern.isEmpty())\n          {\n          pattern = \"(\";\n          }\n        else\n          {\n          pattern += \"|\";\n          }\n        pattern +=regExpExtension;\n        }\n      }\n    }\n  if (pattern.isEmpty())\n    {\n    pattern = \".+\";\n    }\n  else\n    {\n    pattern += \")\";\n    }\n  return QRegExp(pattern);\n}\n\n\/\/-----------------------------------------------------------------------------\nint ctk::significantDecimals(double value, int defaultDecimals)\n{\n  if (value == 0.\n      || qAbs(value) == std::numeric_limits<double>::infinity())\n    {\n    return 0;\n    }\n  if (value != value) \/\/ is NaN\n    {\n    return -1;\n    }\n  QString number = QString::number(value, 'f', 16);\n  QString fractional = number.section('.', 1, 1);\n  Q_ASSERT(fractional.length() == 16);\n  QChar previous;\n  int previousRepeat=0;\n  bool only0s = true;\n  bool isUnit = value > -1. && value < 1.;\n  for (int i = 0; i < fractional.length(); ++i)\n    {\n    QChar digit = fractional.at(i);\n    if (digit != '0')\n      {\n      only0s = false;\n      }\n    \/\/ Has the digit been repeated too many times ?\n    if (digit == previous && previousRepeat == 2 &&\n        !only0s)\n      {\n      if (digit == '0' || digit == '9')\n        {\n        return i - previousRepeat;\n        }\n      return i;\n      }\n    \/\/ Last digit\n    if (i == fractional.length() - 1)\n      {\n      \/\/ If we are here, that means that the right number of significant\n      \/\/ decimals for the number has not been figured out yet.\n      if (previousRepeat > 2 && !(only0s && isUnit) )\n        {\n        return i - previousRepeat;\n        }\n      \/\/ If defaultDecimals has been provided, just use it.\n      if (defaultDecimals >= 0)\n        {\n        return defaultDecimals;\n        }\n      return fractional.length();\n      }\n    \/\/ get ready for next\n    if (previous != digit)\n      {\n      previous = digit;\n      previousRepeat = 1;\n      }\n    else\n      {\n      ++previousRepeat;\n      }\n    }\n  Q_ASSERT(false);\n  return fractional.length();\n}\n\n\/\/-----------------------------------------------------------------------------\nint ctk::orderOfMagnitude(double value)\n{\n  value = qAbs(value);\n  if (value == 0.\n      || value == std::numeric_limits<double>::infinity()\n      || value != value \/\/ is NaN\n      || value < std::numeric_limits<double>::epsilon() \/\/ is tool small to compute\n  )\n    {\n    return std::numeric_limits<int>::min();\n    }\n  double magnitude = 1.00000000000000001;\n  int magnitudeOrder = 0;\n\n  int magnitudeStep = 1;\n  double magnitudeFactor = 10;\n\n  if (value < 1.)\n    {\n    magnitudeOrder = -1;\n    magnitudeStep = -1;\n    magnitudeFactor = 0.1;\n    }\n\n  double epsilon = std::numeric_limits<double>::epsilon();\n  while ( (magnitudeStep > 0 && value >= magnitude) ||\n          (magnitudeStep < 0 && value < magnitude - epsilon))\n    {\n    magnitude *= magnitudeFactor;\n    magnitudeOrder += magnitudeStep;\n    }\n  \/\/ we went 1 order too far, so decrement it\n  return magnitudeOrder - magnitudeStep;\n}\n\n\/\/-----------------------------------------------------------------------------\ndouble ctk::closestPowerOfTen(double _value)\n{\n  const double sign = _value >= 0. ? 1 : -1;\n  const double value = qAbs(_value);\n  if (value == 0.\n      || value == std::numeric_limits<double>::infinity()\n      || value != value \/\/ is NaN\n      || value < std::numeric_limits<double>::epsilon() \/\/ is denormalized\n  )\n    {\n    return _value;\n    }\n\n  double magnitude = 1.;\n  double nextMagnitude = magnitude;\n\n  if (value >= 1.)\n    {\n    do\n      {\n      magnitude = nextMagnitude;\n      nextMagnitude *= 10.;\n      }\n    while ( (value - magnitude)  > (nextMagnitude - value) );\n    }\n  else\n    {\n    do\n      {\n      magnitude = nextMagnitude;\n      nextMagnitude \/= 10.;\n      }\n    while ( (value - magnitude)  < (nextMagnitude - value) );\n    }\n  return magnitude * sign;\n}\n\n\/\/-----------------------------------------------------------------------------\nbool ctk::removeDirRecursively(const QString & dirName)\n{\n  bool result = false;\n  QDir dir(dirName);\n\n  if (dir.exists())\n    {\n    foreach (QFileInfo info, dir.entryInfoList(QDir::NoDotAndDotDot | QDir::System | QDir::Hidden  | QDir::AllDirs | QDir::Files, QDir::DirsFirst))\n      {\n      if (info.isDir())\n        {\n        result = ctk::removeDirRecursively(info.absoluteFilePath());\n        }\n      else\n        {\n        result = QFile::remove(info.absoluteFilePath());\n        }\n\n      if (!result)\n        {\n        return result;\n        }\n      }\n    QDir parentDir(QFileInfo(dirName).absolutePath());\n    result = parentDir.rmdir(dirName);\n    }\n\n  return result;\n}\n\n\/\/-----------------------------------------------------------------------------\nbool ctk::copyDirRecursively(const QString &srcPath, const QString &dstPath)\n{\n  \/\/ See http:\/\/stackoverflow.com\/questions\/2536524\/copy-directory-using-qt\n  if (!QFile::exists(srcPath))\n    {\n    qCritical() << \"ctk::copyDirRecursively: Failed to copy nonexistent directory\" << srcPath;\n    return false;\n    }\n\n  QDir srcDir(srcPath);\n  if (!srcDir.relativeFilePath(dstPath).startsWith(\"..\"))\n    {\n    qCritical() << \"ctk::copyDirRecursively: Cannot copy directory\" << srcPath << \"into itself\" << dstPath;\n    return false;\n    }\n\n\n  QDir parentDstDir(QFileInfo(dstPath).path());\n  if (!QFile::exists(dstPath) && !parentDstDir.mkdir(QFileInfo(dstPath).fileName()))\n    {\n    qCritical() << \"ctk::copyDirRecursively: Failed to create destination directory\" << QFileInfo(dstPath).fileName();\n    return false;\n    }\n\n  foreach(const QFileInfo &info, srcDir.entryInfoList(QDir::Dirs | QDir::Files | QDir::NoDotAndDotDot))\n    {\n    QString srcItemPath = srcPath + \"\/\" + info.fileName();\n    QString dstItemPath = dstPath + \"\/\" + info.fileName();\n    if (info.isDir())\n      {\n      if (!ctk::copyDirRecursively(srcItemPath, dstItemPath))\n        {\n        qCritical() << \"ctk::copyDirRecursively: Failed to copy files from \" << srcItemPath << \" into \" << dstItemPath;\n        return false;\n        }\n      }\n    else if (info.isFile())\n      {\n      if (!QFile::copy(srcItemPath, dstItemPath))\n        {\n        return false;\n        }\n      }\n    else\n      {\n      qWarning() << \"ctk::copyDirRecursively: Unhandled item\" << info.filePath();\n      }\n    }\n  return true;\n}\n\n\/\/-----------------------------------------------------------------------------\nQString ctk::qtHandleToString(Qt::HANDLE handle)\n{\n  QString str;\n  QTextStream s(&str);\n  s << handle;\n  return str;\n}\n\n\/\/-----------------------------------------------------------------------------\nqint64 ctk::msecsTo(const QDateTime& t1, const QDateTime& t2)\n{\n  QDateTime utcT1 = t1.toUTC();\n  QDateTime utcT2 = t2.toUTC();\n\n  return static_cast<qint64>(utcT1.daysTo(utcT2)) * static_cast<qint64>(1000*3600*24)\n      + static_cast<qint64>(utcT1.time().msecsTo(utcT2.time()));\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * RActiveSessions.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\/r_util\/RActiveSessions.hpp>\n\n#include <boost\/foreach.hpp>\n#include <boost\/algorithm\/string\/predicate.hpp>\n\n#include <core\/system\/System.hpp>\n\n#define kSessionDirPrefix \"session-\"\n\nnamespace rstudio {\nnamespace core {\nnamespace r_util {\n\nnamespace {\n\n\n} \/\/ anonymous namespace\n\n\nError ActiveSessions::create(const std::string& project, std::string* pId)\n{\n   return create(project, project, pId);\n}\n\nError ActiveSessions::create(const std::string& project,\n                             const std::string& workingDir,\n                             std::string* pId)\n{\n   \/\/ generate a new id\n   std::string id = core::system::generateShortenedUuid();\n\n   \/\/ create the directory\n   FilePath dir = storagePath_.childPath(kSessionDirPrefix + id);\n   Error error = dir.ensureDirectory();\n   if (error)\n      return error;\n\n   \/\/ write initial settings\n   ActiveSession activeSession(id, dir);\n   activeSession.setProject(project);\n   activeSession.setWorkingDir(workingDir);\n\n   \/\/ return the id\n   *pId = id;\n   return Success();\n}\n\nstd::vector<boost::shared_ptr<ActiveSession> > ActiveSessions::list()\n{\n   \/\/ list to return\n   std::vector<boost::shared_ptr<ActiveSession> > sessions;\n\n   \/\/ enumerate children and check for sessions\n   std::vector<FilePath> children;\n   Error error = storagePath_.children(&children);\n   if (error)\n   {\n      LOG_ERROR(error);\n      return sessions;\n   }\n   std::string prefix = kSessionDirPrefix;\n   BOOST_FOREACH(const FilePath& child, children)\n   {\n      if (boost::algorithm::starts_with(child.filename(), prefix))\n      {\n         std::string id = child.filename().substr(prefix.length());\n         boost::shared_ptr<ActiveSession> pSession = get(id);\n         if (pSession->hasRequiredProperties())\n         {\n            sessions.push_back(pSession);\n         }\n         else\n         {\n            \/\/ this session isn't valid so destroy it\n            Error error = pSession->destroy();\n            if (error)\n               LOG_ERROR(error);\n         }\n      }\n\n   }\n\n   return sessions;\n}\n\nboost::shared_ptr<ActiveSession> ActiveSessions::get(const std::string& id)\n{\n   FilePath scratchPath = storagePath_.childPath(kSessionDirPrefix + id);\n   if (scratchPath.exists())\n      return boost::shared_ptr<ActiveSession>(new ActiveSession(id,\n                                                                scratchPath));\n   else\n      return emptySession();\n}\n\n\nboost::shared_ptr<ActiveSession> ActiveSessions::emptySession()\n{\n   return boost::shared_ptr<ActiveSession>(new ActiveSession());\n}\n\n} \/\/ namespace r_util\n} \/\/ namespace core \n} \/\/ namespace rstudio\n\n\n\n<commit_msg>ensure that session ids are lower case<commit_after>\/*\n * RActiveSessions.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\/r_util\/RActiveSessions.hpp>\n\n#include <boost\/foreach.hpp>\n#include <boost\/algorithm\/string\/predicate.hpp>\n\n#include <core\/StringUtils.hpp>\n\n#include <core\/system\/System.hpp>\n\n#define kSessionDirPrefix \"session-\"\n\nnamespace rstudio {\nnamespace core {\nnamespace r_util {\n\nnamespace {\n\n\n} \/\/ anonymous namespace\n\n\nError ActiveSessions::create(const std::string& project, std::string* pId)\n{\n   return create(project, project, pId);\n}\n\nError ActiveSessions::create(const std::string& project,\n                             const std::string& workingDir,\n                             std::string* pId)\n{\n   \/\/ generate a new id\n   std::string id = string_utils::toLower(core::system::generateShortenedUuid());\n\n   \/\/ create the directory\n   FilePath dir = storagePath_.childPath(kSessionDirPrefix + id);\n   Error error = dir.ensureDirectory();\n   if (error)\n      return error;\n\n   \/\/ write initial settings\n   ActiveSession activeSession(id, dir);\n   activeSession.setProject(project);\n   activeSession.setWorkingDir(workingDir);\n\n   \/\/ return the id\n   *pId = id;\n   return Success();\n}\n\nstd::vector<boost::shared_ptr<ActiveSession> > ActiveSessions::list()\n{\n   \/\/ list to return\n   std::vector<boost::shared_ptr<ActiveSession> > sessions;\n\n   \/\/ enumerate children and check for sessions\n   std::vector<FilePath> children;\n   Error error = storagePath_.children(&children);\n   if (error)\n   {\n      LOG_ERROR(error);\n      return sessions;\n   }\n   std::string prefix = kSessionDirPrefix;\n   BOOST_FOREACH(const FilePath& child, children)\n   {\n      if (boost::algorithm::starts_with(child.filename(), prefix))\n      {\n         std::string id = child.filename().substr(prefix.length());\n         boost::shared_ptr<ActiveSession> pSession = get(id);\n         if (pSession->hasRequiredProperties())\n         {\n            sessions.push_back(pSession);\n         }\n         else\n         {\n            \/\/ this session isn't valid so destroy it\n            Error error = pSession->destroy();\n            if (error)\n               LOG_ERROR(error);\n         }\n      }\n\n   }\n\n   return sessions;\n}\n\nboost::shared_ptr<ActiveSession> ActiveSessions::get(const std::string& id)\n{\n   FilePath scratchPath = storagePath_.childPath(kSessionDirPrefix + id);\n   if (scratchPath.exists())\n      return boost::shared_ptr<ActiveSession>(new ActiveSession(id,\n                                                                scratchPath));\n   else\n      return emptySession();\n}\n\n\nboost::shared_ptr<ActiveSession> ActiveSessions::emptySession()\n{\n   return boost::shared_ptr<ActiveSession>(new ActiveSession());\n}\n\n} \/\/ namespace r_util\n} \/\/ namespace core \n} \/\/ namespace rstudio\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ This is an adaptation of the Fisheye distortion model implemented in OpenCV\n\/\/ https:\/\/github.com\/Itseez\/opencv\/blob\/master\/modules\/calib3d\/src\/fisheye.cpp\n\n\/\/ Copyright (c) 2015 Romain Janvier <romain.janvier~AT~univ-orleans.fr> for the given adaptation\n\n\/\/ This Source Code Form is subject to the terms of the Mozilla Public\n\/\/ License, v. 2.0. If a copy of the MPL was not distributed with this\n\/\/ file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#ifndef OPENMVG_CAMERAS_CAMERA_PINHOLE_FISHEYE_HPP\n#define OPENMVG_CAMERAS_CAMERA_PINHOLE_FISHEYE_HPP\n\n#include \"openMVG\/cameras\/Camera_Common.hpp\"\n#include \"openMVG\/cameras\/Camera_Pinhole.hpp\"\n#include \"openMVG\/numeric\/numeric.h\"\n\n#include <vector>\n\nnamespace openMVG\n{\nnamespace cameras\n{\n\n\/**\n* @brief Implement a simple Fish-eye camera model\n*\/\nclass Pinhole_Intrinsic_Fisheye : public Pinhole_Intrinsic\n{\n  using class_type = Pinhole_Intrinsic_Fisheye;\n\n  protected:\n\n    \/\/\/ center of distortion is applied by the Intrinsics class\n    std::vector<double> params_; \/\/ K1, K2, K3, K4\n\n\n  public:\n\n    \/**\n    * @brief Constructor\n    * @param w Width of image plane\n    * @param h Height of image plane\n    * @param focal Focal distance in pixel\n    * @param ppx Principal point on X-axis\n    * @param ppy Principal point on Y-axis\n    * @param k1 Distortion coefficient\n    * @param k2 Distortion coefficient\n    * @param k3 Distortion coefficient\n    * @param k4 Distortion coefficient\n    *\/\n    Pinhole_Intrinsic_Fisheye(\n      int w = 0, int h = 0,\n      double focal = 0.0, double ppx = 0, double ppy = 0,\n      double k1 = 0.0, double k2 = 0.0, double k3 = 0.0, double k4 = 0.0 )\n      : Pinhole_Intrinsic( w, h, focal, ppx, ppy )\n    {\n      params_ = {k1, k2, k3, k4};\n    }\n\n    ~Pinhole_Intrinsic_Fisheye() override = default;\n\n    \/**\n    * @brief Tell from which type the embed camera is\n    * @retval PINHOLE_CAMERA_FISHEYE\n    *\/\n    EINTRINSIC getType() const override\n    {\n      return PINHOLE_CAMERA_FISHEYE;\n    }\n\n    \/**\n    * @brief Does the camera model handle a distortion field?\n    * @retval true\n    *\/\n    bool have_disto() const override\n    {\n      return true;\n    }\n\n    \/**\n    * @brief Add the distortion field to a point (that is in normalized camera frame)\n    * @param p Point before distortion computation (in normalized camera frame)\n    * @return point with distortion\n    *\/\n    Vec2 add_disto( const Vec2 & p ) const override\n    {\n      const double eps = 1e-8;\n      const double k1 = params_[0], k2 = params_[1], k3 = params_[2], k4 = params_[3];\n      const double r = std::sqrt( p( 0 ) * p( 0 ) + p( 1 ) * p( 1 ) );\n      const double theta = std::atan( r );\n      const double\n      theta2 = theta * theta,\n      theta3 = theta2 * theta,\n      theta4 = theta2 * theta2,\n      theta5 = theta4 * theta,\n      theta6 = theta3 * theta3,\n      theta7 = theta6 * theta,\n      theta8 = theta4 * theta4,\n      theta9 = theta8 * theta;\n      const double theta_dist = theta + k1 * theta3 + k2 * theta5 + k3 * theta7 + k4 * theta9;\n      const double inv_r = r > eps ? 1.0 \/ r : 1.0;\n      const double cdist = r > eps ? theta_dist * inv_r : 1.0;\n      return  p * cdist;\n    }\n\n    \/**\n    * @brief Remove the distortion to a camera point (that is in normalized camera frame)\n    * @param p Point with distortion\n    * @return Point without distortion\n    *\/\n    Vec2 remove_disto( const Vec2 & p ) const override\n    {\n      const double eps = 1e-8;\n      double scale = 1.0;\n      const double theta_dist = std::sqrt( p[0] * p[0] + p[1] * p[1] );\n      if ( theta_dist > eps )\n      {\n        double theta = theta_dist;\n        for ( int j = 0; j < 10; ++j )\n        {\n          const double\n            theta2 = theta * theta,\n            theta4 = theta2 * theta2,\n            theta6 = theta4 * theta2,\n            theta8 = theta6 * theta2;\n            theta = theta_dist \/\n                    ( 1 + params_[0] * theta2\n                      + params_[1] * theta4\n                      + params_[2] * theta6\n                      + params_[3] * theta8 );\n        }\n        scale = std::tan( theta ) \/ theta_dist;\n      }\n      return p * scale;\n    }\n\n    \/**\n    * @brief Data wrapper for non linear optimization (get data)\n    * @return vector of parameter of this intrinsic\n    *\/\n    std::vector<double> getParams() const override\n    {\n      std::vector<double> params = Pinhole_Intrinsic::getParams();\n      params.insert(params.end(), std::begin(params_), std::end(params_));\n      return params;\n    }\n\n    \/**\n    * @brief Data wrapper for non linear optimization (update from data)\n    * @param params List of params used to update this intrinsic\n    * @retval true if update is correct\n    * @retval false if there was an error during update\n    *\/\n    bool updateFromParams( const std::vector<double> & params ) override\n    {\n      if ( params.size() == 7 )\n      {\n        *this = Pinhole_Intrinsic_Fisheye(\n                  w_, h_,\n                  params[0], params[1], params[2], \/\/ focal, ppx, ppy\n                  params[3], params[4], params[5], params[6] ); \/\/ k1, k2, k3, k4\n        return true;\n      }\n      else\n      {\n        return false;\n      }\n    }\n\n    \/**\n    * @brief Return the list of parameter indexes that must be held constant\n    * @param parametrization The given parametrization\n    *\/\n    std::vector<int> subsetParameterization\n    (\n      const Intrinsic_Parameter_Type & parametrization) const override\n    {\n      std::vector<int> constant_index;\n      const int param = static_cast<int>(parametrization);\n      if ( !(param & (int)Intrinsic_Parameter_Type::ADJUST_FOCAL_LENGTH)\n          || param & (int)Intrinsic_Parameter_Type::NONE )\n      {\n        constant_index.push_back(0);\n      }\n      if ( !(param & (int)Intrinsic_Parameter_Type::ADJUST_PRINCIPAL_POINT)\n          || param & (int)Intrinsic_Parameter_Type::NONE )\n      {\n        constant_index.push_back(1);\n        constant_index.push_back(2);\n      }\n      if ( !(param & (int)Intrinsic_Parameter_Type::ADJUST_DISTORTION)\n          || param & (int)Intrinsic_Parameter_Type::NONE )\n      {\n        constant_index.push_back(3);\n        constant_index.push_back(4);\n        constant_index.push_back(5);\n        constant_index.push_back(6);\n      }\n      return constant_index;\n    }\n\n    \/**\n    * @brief Return the un-distorted pixel (with removed distortion)\n    * @param p Input distorted pixel\n    * @return Point without distortion\n    *\/\n    Vec2 get_ud_pixel( const Vec2& p ) const override\n    {\n      return cam2ima( remove_disto( ima2cam( p ) ) );\n    }\n\n    \/**\n    * @brief Return the distorted pixel (with added distortion)\n    * @param p Input pixel\n    * @return Distorted pixel\n    *\/\n    Vec2 get_d_pixel( const Vec2& p ) const override\n    {\n      return cam2ima( add_disto( ima2cam( p ) ) );\n    }\n\n    \/**\n    * @brief Serialization out\n    * @param ar Archive\n    *\/\n    template <class Archive>\n    void save( Archive & ar ) const\n    {\n      ar(cereal::base_class<Pinhole_Intrinsic>(this));\n      ar( cereal::make_nvp( \"fisheye\", params_ ) );\n    }\n\n    \/**\n    * @brief  Serialization in\n    * @param ar Archive\n    *\/\n    template <class Archive>\n    void load( Archive & ar )\n    {\n      ar(cereal::base_class<Pinhole_Intrinsic>(this));\n      ar( cereal::make_nvp( \"fisheye\", params_ ) );\n    }\n\n    \/**\n    * @brief Clone the object\n    * @return A clone (copy of the stored object)\n    *\/\n    IntrinsicBase * clone( void ) const override\n    {\n      return new class_type( *this );\n    }\n};\n\n\n} \/\/ namespace cameras\n} \/\/ namespace openMVG\n\n#include <cereal\/types\/polymorphic.hpp>\n#include <cereal\/types\/vector.hpp>\n\nCEREAL_REGISTER_TYPE_WITH_NAME( openMVG::cameras::Pinhole_Intrinsic_Fisheye, \"fisheye\" );\nCEREAL_REGISTER_POLYMORPHIC_RELATION(openMVG::cameras::Pinhole_Intrinsic, openMVG::cameras::Pinhole_Intrinsic_Fisheye)\n\n#endif \/\/ #ifndef OPENMVG_CAMERAS_CAMERA_PINHOLE_FISHEYE_HPP\n<commit_msg>[cameras] Fix visual studio compiler cereal cameras serialization bug #664 - handle fisheye camera model<commit_after>\/\/ This is an adaptation of the Fisheye distortion model implemented in OpenCV\n\/\/ https:\/\/github.com\/Itseez\/opencv\/blob\/master\/modules\/calib3d\/src\/fisheye.cpp\n\n\/\/ Copyright (c) 2015 Romain Janvier <romain.janvier~AT~univ-orleans.fr> for the given adaptation\n\n\/\/ This Source Code Form is subject to the terms of the Mozilla Public\n\/\/ License, v. 2.0. If a copy of the MPL was not distributed with this\n\/\/ file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#ifndef OPENMVG_CAMERAS_CAMERA_PINHOLE_FISHEYE_HPP\n#define OPENMVG_CAMERAS_CAMERA_PINHOLE_FISHEYE_HPP\n\n#include \"openMVG\/cameras\/Camera_Common.hpp\"\n#include \"openMVG\/cameras\/Camera_Pinhole.hpp\"\n#include \"openMVG\/numeric\/numeric.h\"\n\n#include <vector>\n\nnamespace openMVG\n{\nnamespace cameras\n{\n\n\/**\n* @brief Implement a simple Fish-eye camera model\n*\/\nclass Pinhole_Intrinsic_Fisheye : public Pinhole_Intrinsic\n{\n  using class_type = Pinhole_Intrinsic_Fisheye;\n\n  protected:\n\n    \/\/\/ center of distortion is applied by the Intrinsics class\n    std::vector<double> params_; \/\/ K1, K2, K3, K4\n\n\n  public:\n\n    \/**\n    * @brief Constructor\n    * @param w Width of image plane\n    * @param h Height of image plane\n    * @param focal Focal distance in pixel\n    * @param ppx Principal point on X-axis\n    * @param ppy Principal point on Y-axis\n    * @param k1 Distortion coefficient\n    * @param k2 Distortion coefficient\n    * @param k3 Distortion coefficient\n    * @param k4 Distortion coefficient\n    *\/\n    Pinhole_Intrinsic_Fisheye(\n      int w = 0, int h = 0,\n      double focal = 0.0, double ppx = 0, double ppy = 0,\n      double k1 = 0.0, double k2 = 0.0, double k3 = 0.0, double k4 = 0.0 )\n      : Pinhole_Intrinsic( w, h, focal, ppx, ppy )\n    {\n      params_ = {k1, k2, k3, k4};\n    }\n\n    ~Pinhole_Intrinsic_Fisheye() override = default;\n\n    \/**\n    * @brief Tell from which type the embed camera is\n    * @retval PINHOLE_CAMERA_FISHEYE\n    *\/\n    EINTRINSIC getType() const override\n    {\n      return PINHOLE_CAMERA_FISHEYE;\n    }\n\n    \/**\n    * @brief Does the camera model handle a distortion field?\n    * @retval true\n    *\/\n    bool have_disto() const override\n    {\n      return true;\n    }\n\n    \/**\n    * @brief Add the distortion field to a point (that is in normalized camera frame)\n    * @param p Point before distortion computation (in normalized camera frame)\n    * @return point with distortion\n    *\/\n    Vec2 add_disto( const Vec2 & p ) const override\n    {\n      const double eps = 1e-8;\n      const double k1 = params_[0], k2 = params_[1], k3 = params_[2], k4 = params_[3];\n      const double r = std::sqrt( p( 0 ) * p( 0 ) + p( 1 ) * p( 1 ) );\n      const double theta = std::atan( r );\n      const double\n      theta2 = theta * theta,\n      theta3 = theta2 * theta,\n      theta4 = theta2 * theta2,\n      theta5 = theta4 * theta,\n      theta6 = theta3 * theta3,\n      theta7 = theta6 * theta,\n      theta8 = theta4 * theta4,\n      theta9 = theta8 * theta;\n      const double theta_dist = theta + k1 * theta3 + k2 * theta5 + k3 * theta7 + k4 * theta9;\n      const double inv_r = r > eps ? 1.0 \/ r : 1.0;\n      const double cdist = r > eps ? theta_dist * inv_r : 1.0;\n      return  p * cdist;\n    }\n\n    \/**\n    * @brief Remove the distortion to a camera point (that is in normalized camera frame)\n    * @param p Point with distortion\n    * @return Point without distortion\n    *\/\n    Vec2 remove_disto( const Vec2 & p ) const override\n    {\n      const double eps = 1e-8;\n      double scale = 1.0;\n      const double theta_dist = std::sqrt( p[0] * p[0] + p[1] * p[1] );\n      if ( theta_dist > eps )\n      {\n        double theta = theta_dist;\n        for ( int j = 0; j < 10; ++j )\n        {\n          const double\n            theta2 = theta * theta,\n            theta4 = theta2 * theta2,\n            theta6 = theta4 * theta2,\n            theta8 = theta6 * theta2;\n            theta = theta_dist \/\n                    ( 1 + params_[0] * theta2\n                      + params_[1] * theta4\n                      + params_[2] * theta6\n                      + params_[3] * theta8 );\n        }\n        scale = std::tan( theta ) \/ theta_dist;\n      }\n      return p * scale;\n    }\n\n    \/**\n    * @brief Data wrapper for non linear optimization (get data)\n    * @return vector of parameter of this intrinsic\n    *\/\n    std::vector<double> getParams() const override\n    {\n      std::vector<double> params = Pinhole_Intrinsic::getParams();\n      params.insert(params.end(), std::begin(params_), std::end(params_));\n      return params;\n    }\n\n    \/**\n    * @brief Data wrapper for non linear optimization (update from data)\n    * @param params List of params used to update this intrinsic\n    * @retval true if update is correct\n    * @retval false if there was an error during update\n    *\/\n    bool updateFromParams( const std::vector<double> & params ) override\n    {\n      if ( params.size() == 7 )\n      {\n        *this = Pinhole_Intrinsic_Fisheye(\n                  w_, h_,\n                  params[0], params[1], params[2], \/\/ focal, ppx, ppy\n                  params[3], params[4], params[5], params[6] ); \/\/ k1, k2, k3, k4\n        return true;\n      }\n      else\n      {\n        return false;\n      }\n    }\n\n    \/**\n    * @brief Return the list of parameter indexes that must be held constant\n    * @param parametrization The given parametrization\n    *\/\n    std::vector<int> subsetParameterization\n    (\n      const Intrinsic_Parameter_Type & parametrization) const override\n    {\n      std::vector<int> constant_index;\n      const int param = static_cast<int>(parametrization);\n      if ( !(param & (int)Intrinsic_Parameter_Type::ADJUST_FOCAL_LENGTH)\n          || param & (int)Intrinsic_Parameter_Type::NONE )\n      {\n        constant_index.push_back(0);\n      }\n      if ( !(param & (int)Intrinsic_Parameter_Type::ADJUST_PRINCIPAL_POINT)\n          || param & (int)Intrinsic_Parameter_Type::NONE )\n      {\n        constant_index.push_back(1);\n        constant_index.push_back(2);\n      }\n      if ( !(param & (int)Intrinsic_Parameter_Type::ADJUST_DISTORTION)\n          || param & (int)Intrinsic_Parameter_Type::NONE )\n      {\n        constant_index.push_back(3);\n        constant_index.push_back(4);\n        constant_index.push_back(5);\n        constant_index.push_back(6);\n      }\n      return constant_index;\n    }\n\n    \/**\n    * @brief Return the un-distorted pixel (with removed distortion)\n    * @param p Input distorted pixel\n    * @return Point without distortion\n    *\/\n    Vec2 get_ud_pixel( const Vec2& p ) const override\n    {\n      return cam2ima( remove_disto( ima2cam( p ) ) );\n    }\n\n    \/**\n    * @brief Return the distorted pixel (with added distortion)\n    * @param p Input pixel\n    * @return Distorted pixel\n    *\/\n    Vec2 get_d_pixel( const Vec2& p ) const override\n    {\n      return cam2ima( add_disto( ima2cam( p ) ) );\n    }\n\n    \/**\n    * @brief Serialization out\n    * @param ar Archive\n    *\/\n    template <class Archive>\n    void save( Archive & ar ) const\n    {\n      ar(cereal::base_class<Pinhole_Intrinsic>(this));\n      ar( cereal::make_nvp( \"fisheye\", params_ ) );\n    }\n\n    \/**\n    * @brief  Serialization in\n    * @param ar Archive\n    *\/\n    template <class Archive>\n    void load( Archive & ar )\n    {\n      ar(cereal::base_class<Pinhole_Intrinsic>(this));\n      ar( cereal::make_nvp( \"fisheye\", params_ ) );\n    }\n\n    \/**\n    * @brief Clone the object\n    * @return A clone (copy of the stored object)\n    *\/\n    IntrinsicBase * clone( void ) const override\n    {\n      return new class_type( *this );\n    }\n};\n\n\n} \/\/ namespace cameras\n} \/\/ namespace openMVG\n\n#include <cereal\/types\/polymorphic.hpp>\n#include <cereal\/types\/vector.hpp>\n\nCEREAL_REGISTER_TYPE_WITH_NAME( openMVG::cameras::Pinhole_Intrinsic_Fisheye, \"fisheye\" );\nCEREAL_REGISTER_POLYMORPHIC_RELATION(openMVG::cameras::IntrinsicBase, openMVG::cameras::Pinhole_Intrinsic_Fisheye)\n\n#endif \/\/ #ifndef OPENMVG_CAMERAS_CAMERA_PINHOLE_FISHEYE_HPP\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Hack to sort out avoiding generating code<commit_after> \n<|endoftext|>"}
{"text":"<commit_before>#ifndef DUNE_DETAILED_SOLVERS_STATIONARY_LINEAR_ELLIPTIC_MODEL_THERMALBLOCK_HH\n#define DUNE_DETAILED_SOLVERS_STATIONARY_LINEAR_ELLIPTIC_MODEL_THERMALBLOCK_HH\n\n\/\/ system\n#include <vector>\n#include <string>\n\n\/\/ dune-common\n#include <dune\/common\/shared_ptr.hh>\n\n\/\/ dune-stuff\n#include <dune\/stuff\/function\/expression.hh>\n#include <dune\/stuff\/function\/interface.hh>\n#include <dune\/stuff\/common\/parameter\/tree.hh>\n#include <dune\/stuff\/common\/print.hh>\n\n\/\/ local\n#include \"interface.hh\"\n\nnamespace Dune {\n\nnamespace Detailed {\n\nnamespace Solvers {\n\nnamespace Stationary {\n\nnamespace Linear {\n\nnamespace Elliptic {\n\nnamespace Model {\n\ntemplate< class DomainFieldImp, int domainDim, class RangeFieldImp, int rangeDim >\nclass Thermalblock\n  : public Interface < DomainFieldImp, domainDim, RangeFieldImp, rangeDim >\n{\npublic:\n  typedef DomainFieldImp DomainFieldType;\n\n  static const int dimDomain = domainDim;\n\n  typedef RangeFieldImp RangeFieldType;\n\n  static const int dimRange = rangeDim;\n\n  typedef Interface< DomainFieldType, dimDomain, RangeFieldType, dimRange > BaseType;\n\n  typedef Thermalblock< DomainFieldType, dimDomain, RangeFieldType, dimRange > ThisType;\n\n  static const std::string id;\n\nprivate:\n  class Diffusion\n    : public Dune::Stuff::Function::Interface< DomainFieldType, dimDomain, RangeFieldType, dimRange >\n  {\n  public:\n    typedef Dune::FieldVector< DomainFieldType, dimDomain > DomainType;\n\n    typedef Dune::FieldVector< RangeFieldType, dimRange > RangeType;\n\n    Diffusion(const DomainType lowerLeft,\n              const DomainType upperRight,\n              const std::vector< unsigned int > numElements,\n              const std::vector< RangeFieldType > components)\n      : lowerLeft_(lowerLeft)\n      , upperRight_(upperRight)\n      , numElements_(numElements)\n      , components_(components)\n    {\n      \/\/ get total number of subdomains\n      unsigned int totalSubdomains = 1;\n      static const unsigned int dim = numElements_.size();\n      for (unsigned int d = 0; d < dim; ++d) {\n          totalSubdomains *= numElements_[d];\n      }\n      assert(totalSubdomains <= components_.size() && \"Please provide at least as many components as subdomains!\");\n    }\n\n    Diffusion(const Diffusion& other)\n      : lowerLeft_(other.lowerLeft_)\n      , upperRight_(other.upperRight_)\n      , numElements_(other.numElements_)\n      , components_(other.components_)\n    {\n      \/\/ get total number of subdomains\n      unsigned int totalSubdomains = 1;\n      static const unsigned int dim = numElements_.size();\n      for (unsigned int d = 0; d < dim; ++d) {\n          totalSubdomains *= numElements_[d];\n      }\n      assert(totalSubdomains <= components_.size() && \"Please provide at least as many components as subdomains!\");\n    }\n\n    virtual void evaluate(const DomainType& x, RangeType& ret) const\n    {\n      \/\/ decide on the subdomain the point x belongs to\n      std::vector< unsigned int > whichPartition;\n      for (unsigned int d = 0; d < dimDomain; ++d)\n      {\n        whichPartition.push_back(std::floor(numElements_[d]*((x[d] - lowerLeft_[d])\/(upperRight_[d] - lowerLeft_[d]))));\n      }\n      unsigned int subdomain = 0;\n      if (dimDomain == 1)\n        subdomain = whichPartition[0];\n      else if (dimDomain == 2)\n        subdomain = whichPartition[0] + whichPartition[1]*numElements_[0];\n      else if (dimDomain == 3)\n        subdomain = whichPartition[0] + whichPartition[1]*numElements_[0] + whichPartition[2]*numElements_[1]*numElements_[0];\n      else\n      {\n        std::stringstream msg;\n        msg << \"Error in \" << id << \": not implemented for grid dimensions other than 1, 2 or 3!\";\n        DUNE_THROW(Dune::NotImplemented, msg.str());\n      } \/\/ decide on the subdomain the point x belongs to\n\n      \/\/ return the component that belongs to the subdomain of x\n      ret = components_[subdomain];\n    } \/\/ virtual void evaluate(const DomainType& x, RangeType& ret) const\n\n  private:\n    const DomainType lowerLeft_;\n    const DomainType upperRight_;\n    const std::vector< unsigned int > numElements_;\n    const std::vector< RangeFieldType > components_;\n  }; \/\/ class Diffusion\n\npublic:\n  typedef typename BaseType::DiffusionType DiffusionType;\n\n  typedef typename BaseType::ForceType ForceType;\n\n  typedef typename BaseType::DirichletType DirichletType;\n\n  Thermalblock(const Dune::Stuff::Common::ExtendedParameterTree paramTree)\n    : diffusionOrder_(-1)\n    , forceOrder_(-1)\n    , dirichletOrder_(-1)\n  {\n    \/\/ check parametertree\n    paramTree.assertSub(\"diffusion\", id);\n    paramTree.assertSub(\"force\", id);\n    paramTree.assertSub(\"dirichlet\", id);\n    paramTree.assertKey(\"diffusion.order\", id);\n    paramTree.assertKey(\"force.order\", id);\n    paramTree.assertKey(\"dirichlet.order\", id);\n    \/\/ build functions\n    typedef Dune::Stuff::Function::Expression< DomainFieldType, dimDomain, RangeFieldType, dimRange > ExpressionFunctionType;\n    force_ = Dune::shared_ptr< ForceType >(new ExpressionFunctionType(paramTree.sub(\"force\")));\n    dirichlet_ = Dune::shared_ptr< DirichletType >(new ExpressionFunctionType(paramTree.sub(\"dirichlet\")));\n\n    \/\/ build the thermalblock diffusion\n    Dune::FieldVector< DomainFieldType, dimDomain > lowerLeft(DomainFieldType(0));\n    Dune::FieldVector< DomainFieldType, dimDomain > upperRight(DomainFieldType(1));\n    std::vector< unsigned int > numElements(dimDomain, 0);\n    std::vector< RangeFieldType > components;\n\n    Dune::Stuff::Common::ExtendedParameterTree paramTreeDiffusion = paramTree.sub(\"diffusion\");\n\n    \/\/ get number of subdomains per direction, total number of subdomains and coordinates of lowerLeft and upperRight corners of the cube\n    unsigned int totalSubdomains = 1;\n    for (unsigned int d = 0; d < dimDomain; ++d) {\n      std::string low = \"lowerLeft.\" + std::to_string(d);\n      std::string up = \"upperRight.\" + std::to_string(d);\n      std::string el = \"numElements.\" + std::to_string(d);\n      lowerLeft[d] = paramTreeDiffusion.get(low, 0);\n      upperRight[d] = paramTreeDiffusion.get(up, 1);\n      numElements[d] = paramTreeDiffusion.get(el, 0);\n      totalSubdomains *= numElements[d];\n    }\n    for (unsigned int i = 0; i < totalSubdomains; ++i) {\n      std::string com = \"component.\" + std::to_string(i);\n      const RangeFieldType tmp = paramTreeDiffusion.get(com, 1.0);\n      components.push_back(tmp);\n    }\n    diffusion_ = Dune::shared_ptr< DiffusionType >(new Diffusion(lowerLeft, upperRight, numElements, components));\n    \/\/ set orders\n    diffusionOrder_ = paramTree.sub(\"diffusion\").get(\"order\", -1);\n    forceOrder_ = paramTree.sub(\"force\").get(\"order\", -1);\n    dirichletOrder_ = paramTree.sub(\"dirichlet\").get(\"order\", -1);\n  }\n\n  Thermalblock(const ThisType& other)\n    : diffusionOrder_(other.diffusionOrder_)\n    , forceOrder_(other.forceOrder_)\n    , dirichletOrder_(other.dirichletOrder_)\n    , diffusion_(other.diffusion_)\n    , force_(other.force_)\n    , dirichlet_(other.dirichlet_)\n  {}\n\n  virtual const Dune::shared_ptr< const DiffusionType > diffusion() const\n  {\n    return diffusion_;\n  }\n\n  virtual int diffusionOrder() const\n  {\n    return diffusionOrder_;\n  }\n\n  virtual const Dune::shared_ptr< const ForceType > force() const\n  {\n    return force_;\n  }\n\n  virtual int forceOrder() const\n  {\n    return forceOrder_;\n  }\n\n  virtual const Dune::shared_ptr< const DirichletType > dirichlet() const\n  {\n    return dirichlet_;\n  }\n\n  virtual int dirichletOrder() const\n  {\n    return dirichletOrder_;\n  }\n\nprivate:\n  ThisType& operator=(const ThisType&);\n\n  int diffusionOrder_;\n  int forceOrder_;\n  int dirichletOrder_;\n  Dune::shared_ptr< DiffusionType > diffusion_;\n  Dune::shared_ptr< ForceType > force_;\n  Dune::shared_ptr< DirichletType > dirichlet_;\n}; \/\/ class Thermalblock\n\ntemplate< class DomainFieldType, int dimDomain, class RangeFieldType, int dimRange >\nconst std::string Thermalblock< DomainFieldType, dimDomain, RangeFieldType, dimRange >::id = \"detailed.solvers.stationary.linear.elliptic.model.thermalblock\";\n\n} \/\/ namespace Model\n\n} \/\/ namespace Elliptic\n\n} \/\/ namespace Linear\n\n} \/\/ namespace Stationary\n\n} \/\/ namespace Solvers\n\n} \/\/ namespace Detailed\n\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_DETAILED_SOLVERS_STATIONARY_LINEAR_ELLIPTIC_MODEL_THERMALBLOCK_HH\n<commit_msg>[...elliptic.model.thermalblock] changed id -> id()<commit_after>#ifndef DUNE_DETAILED_SOLVERS_STATIONARY_LINEAR_ELLIPTIC_MODEL_THERMALBLOCK_HH\n#define DUNE_DETAILED_SOLVERS_STATIONARY_LINEAR_ELLIPTIC_MODEL_THERMALBLOCK_HH\n\n\/\/ system\n#include <vector>\n#include <string>\n\n\/\/ dune-common\n#include <dune\/common\/shared_ptr.hh>\n\n\/\/ dune-stuff\n#include <dune\/stuff\/function\/expression.hh>\n#include <dune\/stuff\/function\/interface.hh>\n#include <dune\/stuff\/common\/parameter\/tree.hh>\n#include <dune\/stuff\/common\/print.hh>\n\n\/\/ local\n#include \"interface.hh\"\n\nnamespace Dune {\n\nnamespace Detailed {\n\nnamespace Solvers {\n\nnamespace Stationary {\n\nnamespace Linear {\n\nnamespace Elliptic {\n\nnamespace Model {\n\ntemplate< class DomainFieldImp, int domainDim, class RangeFieldImp, int rangeDim >\nclass Thermalblock\n  : public Interface < DomainFieldImp, domainDim, RangeFieldImp, rangeDim >\n{\npublic:\n  typedef DomainFieldImp DomainFieldType;\n\n  static const int dimDomain = domainDim;\n\n  typedef RangeFieldImp RangeFieldType;\n\n  static const int dimRange = rangeDim;\n\n  typedef Interface< DomainFieldType, dimDomain, RangeFieldType, dimRange > BaseType;\n\n  typedef Thermalblock< DomainFieldType, dimDomain, RangeFieldType, dimRange > ThisType;\n\nprivate:\n  class Diffusion\n    : public Dune::Stuff::Function::Interface< DomainFieldType, dimDomain, RangeFieldType, dimRange >\n  {\n  public:\n    typedef Dune::FieldVector< DomainFieldType, dimDomain > DomainType;\n\n    typedef Dune::FieldVector< RangeFieldType, dimRange > RangeType;\n\n    Diffusion(const DomainType lowerLeft,\n              const DomainType upperRight,\n              const std::vector< unsigned int > numElements,\n              const std::vector< RangeFieldType > components)\n      : lowerLeft_(lowerLeft)\n      , upperRight_(upperRight)\n      , numElements_(numElements)\n      , components_(components)\n    {\n      \/\/ get total number of subdomains\n      unsigned int totalSubdomains = 1;\n      static const unsigned int dim = numElements_.size();\n      for (unsigned int d = 0; d < dim; ++d) {\n          totalSubdomains *= numElements_[d];\n      }\n      assert(totalSubdomains <= components_.size() && \"Please provide at least as many components as subdomains!\");\n    }\n\n    Diffusion(const Diffusion& other)\n      : lowerLeft_(other.lowerLeft_)\n      , upperRight_(other.upperRight_)\n      , numElements_(other.numElements_)\n      , components_(other.components_)\n    {\n      \/\/ get total number of subdomains\n      unsigned int totalSubdomains = 1;\n      static const unsigned int dim = numElements_.size();\n      for (unsigned int d = 0; d < dim; ++d) {\n          totalSubdomains *= numElements_[d];\n      }\n      assert(totalSubdomains <= components_.size() && \"Please provide at least as many components as subdomains!\");\n    }\n\n    virtual void evaluate(const DomainType& x, RangeType& ret) const\n    {\n      \/\/ decide on the subdomain the point x belongs to\n      std::vector< unsigned int > whichPartition;\n      for (unsigned int d = 0; d < dimDomain; ++d)\n      {\n        whichPartition.push_back(std::floor(numElements_[d]*((x[d] - lowerLeft_[d])\/(upperRight_[d] - lowerLeft_[d]))));\n      }\n      unsigned int subdomain = 0;\n      if (dimDomain == 1)\n        subdomain = whichPartition[0];\n      else if (dimDomain == 2)\n        subdomain = whichPartition[0] + whichPartition[1]*numElements_[0];\n      else if (dimDomain == 3)\n        subdomain = whichPartition[0] + whichPartition[1]*numElements_[0] + whichPartition[2]*numElements_[1]*numElements_[0];\n      else\n      {\n        std::stringstream msg;\n        msg << \"Error in \" << id << \": not implemented for grid dimensions other than 1, 2 or 3!\";\n        DUNE_THROW(Dune::NotImplemented, msg.str());\n      } \/\/ decide on the subdomain the point x belongs to\n\n      \/\/ return the component that belongs to the subdomain of x\n      ret = components_[subdomain];\n    } \/\/ virtual void evaluate(const DomainType& x, RangeType& ret) const\n\n  private:\n    const DomainType lowerLeft_;\n    const DomainType upperRight_;\n    const std::vector< unsigned int > numElements_;\n    const std::vector< RangeFieldType > components_;\n  }; \/\/ class Diffusion\n\npublic:\n  typedef typename BaseType::DiffusionType DiffusionType;\n\n  typedef typename BaseType::ForceType ForceType;\n\n  typedef typename BaseType::DirichletType DirichletType;\n\n  Thermalblock(const Dune::Stuff::Common::ExtendedParameterTree paramTree)\n    : diffusionOrder_(-1)\n    , forceOrder_(-1)\n    , dirichletOrder_(-1)\n  {\n    \/\/ check parametertree\n    paramTree.assertSub(\"diffusion\", id());\n    paramTree.assertSub(\"force\", id());\n    paramTree.assertSub(\"dirichlet\", id());\n    paramTree.assertKey(\"diffusion.order\", id());\n    paramTree.assertKey(\"force.order\", id());\n    paramTree.assertKey(\"dirichlet.order\", id());\n    \/\/ build functions\n    typedef Dune::Stuff::Function::Expression< DomainFieldType, dimDomain, RangeFieldType, dimRange > ExpressionFunctionType;\n    force_ = Dune::shared_ptr< ForceType >(new ExpressionFunctionType(paramTree.sub(\"force\")));\n    dirichlet_ = Dune::shared_ptr< DirichletType >(new ExpressionFunctionType(paramTree.sub(\"dirichlet\")));\n\n    \/\/ build the thermalblock diffusion\n    Dune::FieldVector< DomainFieldType, dimDomain > lowerLeft(DomainFieldType(0));\n    Dune::FieldVector< DomainFieldType, dimDomain > upperRight(DomainFieldType(1));\n    std::vector< unsigned int > numElements(dimDomain, 0);\n    std::vector< RangeFieldType > components;\n\n    Dune::Stuff::Common::ExtendedParameterTree paramTreeDiffusion = paramTree.sub(\"diffusion\");\n\n    \/\/ get number of subdomains per direction, total number of subdomains and coordinates of lowerLeft and upperRight corners of the cube\n    unsigned int totalSubdomains = 1;\n    for (unsigned int d = 0; d < dimDomain; ++d) {\n      std::string low = \"lowerLeft.\" + std::to_string(d);\n      std::string up = \"upperRight.\" + std::to_string(d);\n      std::string el = \"numElements.\" + std::to_string(d);\n      lowerLeft[d] = paramTreeDiffusion.get(low, 0);\n      upperRight[d] = paramTreeDiffusion.get(up, 1);\n      numElements[d] = paramTreeDiffusion.get(el, 0);\n      totalSubdomains *= numElements[d];\n    }\n    for (unsigned int i = 0; i < totalSubdomains; ++i) {\n      std::string com = \"component.\" + std::to_string(i);\n      const RangeFieldType tmp = paramTreeDiffusion.get(com, 1.0);\n      components.push_back(tmp);\n    }\n    diffusion_ = Dune::shared_ptr< DiffusionType >(new Diffusion(lowerLeft, upperRight, numElements, components));\n    \/\/ set orders\n    diffusionOrder_ = paramTree.sub(\"diffusion\").get(\"order\", -1);\n    forceOrder_ = paramTree.sub(\"force\").get(\"order\", -1);\n    dirichletOrder_ = paramTree.sub(\"dirichlet\").get(\"order\", -1);\n  }\n\n  Thermalblock(const ThisType& other)\n    : diffusionOrder_(other.diffusionOrder_)\n    , forceOrder_(other.forceOrder_)\n    , dirichletOrder_(other.dirichletOrder_)\n    , diffusion_(other.diffusion_)\n    , force_(other.force_)\n    , dirichlet_(other.dirichlet_)\n  {}\n\n  static const std::string id()\n  {\n    return \"detailed.solvers.stationary.linear.elliptic.model.thermalblock\";\n  }\n\n  virtual const Dune::shared_ptr< const DiffusionType > diffusion() const\n  {\n    return diffusion_;\n  }\n\n  virtual int diffusionOrder() const\n  {\n    return diffusionOrder_;\n  }\n\n  virtual const Dune::shared_ptr< const ForceType > force() const\n  {\n    return force_;\n  }\n\n  virtual int forceOrder() const\n  {\n    return forceOrder_;\n  }\n\n  virtual const Dune::shared_ptr< const DirichletType > dirichlet() const\n  {\n    return dirichlet_;\n  }\n\n  virtual int dirichletOrder() const\n  {\n    return dirichletOrder_;\n  }\n\nprivate:\n  ThisType& operator=(const ThisType&);\n\n  int diffusionOrder_;\n  int forceOrder_;\n  int dirichletOrder_;\n  Dune::shared_ptr< DiffusionType > diffusion_;\n  Dune::shared_ptr< ForceType > force_;\n  Dune::shared_ptr< DirichletType > dirichlet_;\n}; \/\/ class Thermalblock\n\n} \/\/ namespace Model\n\n} \/\/ namespace Elliptic\n\n} \/\/ namespace Linear\n\n} \/\/ namespace Stationary\n\n} \/\/ namespace Solvers\n\n} \/\/ namespace Detailed\n\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_DETAILED_SOLVERS_STATIONARY_LINEAR_ELLIPTIC_MODEL_THERMALBLOCK_HH\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 \"lighting\/advanced\/glsl\/deferredShadingFeaturesGLSL.h\"\n\n#include \"lighting\/advanced\/advancedLightBinManager.h\"\n#include \"shaderGen\/langElement.h\"\n#include \"shaderGen\/shaderOp.h\"\n#include \"shaderGen\/conditionerFeature.h\"\n#include \"renderInstance\/renderDeferredMgr.h\"\n#include \"materials\/processedMaterial.h\"\n#include \"materials\/materialFeatureTypes.h\"\n\n\n\/\/****************************************************************************\n\/\/ Deferred Shading Features\n\/\/****************************************************************************\nU32 PBRConfigMapGLSL::getOutputTargets(const MaterialFeatureData& fd) const\n{\n   return fd.features[MFT_isDeferred] ? ShaderFeature::RenderTarget2 : ShaderFeature::DefaultTarget;\n}\n\nvoid PBRConfigMapGLSL::processPix( Vector<ShaderComponent*> &componentList, const MaterialFeatureData &fd )\n{\n   \/\/ Get the texture coord.\n   Var *texCoord = getInTexCoord( \"texCoord\", \"vec2\", componentList );\n   \n   MultiLine* meta = new MultiLine;\n   Var* pbrConfig;\n   if (fd.features[MFT_isDeferred])\n   {\n      pbrConfig = (Var*)LangElement::find(getOutputTargetVarName(ShaderFeature::RenderTarget2));\n      if (!pbrConfig)\n      {\n         \/\/ create material var\n         pbrConfig = new Var;\n         pbrConfig->setType(\"vec4\");\n         pbrConfig->setName(getOutputTargetVarName(ShaderFeature::RenderTarget2));\n         pbrConfig->setStructName(\"OUT\");\n      }\n   }\n   else\n   {\n      pbrConfig = (Var*)LangElement::find(\"PBRConfig\");\n      if (!pbrConfig)\n      {\n         pbrConfig = new Var(\"PBRConfig\", \"vec4\");\n         meta->addStatement(new GenOp(\"   @;\\r\\n\", new DecOp(pbrConfig)));\n      }\n   }\n\n   \/\/ create texture var\n   Var *pbrConfigMap = new Var;\n   pbrConfigMap->setType( \"sampler2D\" );\n   pbrConfigMap->setName( \"pbrConfigMap\" );\n   pbrConfigMap->uniform = true;\n   pbrConfigMap->sampler = true;\n   pbrConfigMap->constNum = Var::getTexUnitNum();\n   LangElement *texOp = new GenOp( \"tex2D(@, @)\", pbrConfigMap, texCoord );\n\n   Var *metalness = (Var*)LangElement::find(\"metalness\");\n   if (!metalness) metalness = new Var(\"metalness\", \"float\");\n   Var *smoothness = (Var*)LangElement::find(\"smoothness\");\n   if (!smoothness) smoothness = new Var(\"smoothness\", \"float\");\n   Var* ao = (Var*)LangElement::find(\"ao\");\n   if (!ao) ao = new Var(\"ao\", \"float\");\n\n\n   meta->addStatement(new GenOp(\"   @.bga = @.rgb;\\r\\n\", pbrConfig, texOp));\n\n   meta->addStatement(new GenOp(\"   @ = @.b;\\r\\n\", new DecOp(smoothness), pbrConfig));\n   if (fd.features[MFT_InvertSmoothness])\n   {\n      meta->addStatement(new GenOp(\"   @.b = 1.0-@.b;\\r\\n\", pbrConfig, pbrConfig));\n      meta->addStatement(new GenOp(\"   @ = 1.0-@;\\r\\n\", smoothness, smoothness));\n   }\n   meta->addStatement(new GenOp(\"   @ = @.g;\\r\\n\", new DecOp(ao), pbrConfig));\n   meta->addStatement(new GenOp(\"   @ = @.a;\\r\\n\", new DecOp(metalness), pbrConfig));\n\n   output = meta;\n}\n\nShaderFeature::Resources PBRConfigMapGLSL::getResources( const MaterialFeatureData &fd )\n{\n   Resources res; \n   res.numTex = 1;\n   res.numTexReg = 1;\n\n   return res;\n}\n\nvoid PBRConfigMapGLSL::setTexData(   Material::StageData &stageDat,\n                                       const MaterialFeatureData &fd,\n                                       RenderPassData &passData,\n                                       U32 &texIndex )\n{\n   GFXTextureObject *tex = stageDat.getTex(MFT_PBRConfigMap);\n   if ( tex )\n   {\n      passData.mTexType[ texIndex ] = Material::Standard;\n      passData.mSamplerNames[ texIndex ] = \"pbrConfigMap\";\n      passData.mTexSlot[ texIndex++ ].texObject = tex;\n   }\n}\n\nvoid PBRConfigMapGLSL::processVert( Vector<ShaderComponent*> &componentList,\n                                       const MaterialFeatureData &fd )\n{\n   MultiLine *meta = new MultiLine;\n   getOutTexCoord(   \"texCoord\", \n                     \"vec2\", \n                     fd.features[MFT_TexAnim], \n                     meta, \n                     componentList );\n   output = meta;\n}\n\nU32 MatInfoFlagsGLSL::getOutputTargets(const MaterialFeatureData& fd) const\n{\n   return fd.features[MFT_isDeferred] ? ShaderFeature::RenderTarget2 : ShaderFeature::DefaultTarget;\n}\n\n\/\/ Material Info Flags -> Red ( Flags ) of Material Info Buffer.\nvoid MatInfoFlagsGLSL::processPix( Vector<ShaderComponent*> &componentList, const MaterialFeatureData &fd )\n{\n\tMultiLine *meta = new MultiLine;\n\n   Var* pbrConfig;\n   if (fd.features[MFT_isDeferred])\n   {\n      pbrConfig = (Var*)LangElement::find(getOutputTargetVarName(ShaderFeature::RenderTarget2));\n      if (!pbrConfig)\n      {\n         \/\/ create material var\n         pbrConfig = new Var;\n         pbrConfig->setType(\"vec4\");\n         pbrConfig->setName(getOutputTargetVarName(ShaderFeature::RenderTarget2));\n         pbrConfig->setStructName(\"OUT\");\n      }\n   }\n   else\n   {\n      pbrConfig = (Var*)LangElement::find(\"PBRConfig\");\n      if (!pbrConfig)\n      {\n         pbrConfig = new Var(\"PBRConfig\", \"vec4\");\n         meta->addStatement(new GenOp(\"   @;\\r\\n\", new DecOp(pbrConfig)));\n      }\n   }\n\n   Var *matInfoFlags = new Var;\n   matInfoFlags->setType( \"float\" );\n   matInfoFlags->setName( \"matInfoFlags\" );\n   matInfoFlags->uniform = true;\n   matInfoFlags->constSortPos = cspPotentialPrimitive;\n\n   meta->addStatement(output = new GenOp(\"   @.r = @;\\r\\n\", pbrConfig, matInfoFlags));\n   output = meta;\n}\n\nU32 PBRConfigVarsGLSL::getOutputTargets(const MaterialFeatureData& fd) const\n{\n   return fd.features[MFT_isDeferred] ? ShaderFeature::RenderTarget2 : ShaderFeature::DefaultTarget;\n}\n\n\/\/ Spec Strength -> Blue Channel of Material Info Buffer.\n\/\/ Spec Power -> Alpha Channel ( of Material Info Buffer.\nvoid PBRConfigVarsGLSL::processPix( Vector<ShaderComponent*> &componentList, const MaterialFeatureData &fd )\n{\n   MultiLine* meta = new MultiLine;\n\n   Var* pbrConfig;\n   if (fd.features[MFT_isDeferred])\n   {\n      pbrConfig = (Var*)LangElement::find(getOutputTargetVarName(ShaderFeature::RenderTarget2));\n      if (!pbrConfig)\n      {\n         \/\/ create material var\n         pbrConfig = new Var;\n         pbrConfig->setType(\"vec4\");\n         pbrConfig->setName(getOutputTargetVarName(ShaderFeature::RenderTarget2));\n         pbrConfig->setStructName(\"OUT\");\n      }\n   }\n   else\n   {\n      pbrConfig = (Var*)LangElement::find(\"PBRConfig\");\n      if (!pbrConfig)\n      {\n         pbrConfig = new Var(\"PBRConfig\", \"vec4\");\n         meta->addStatement(new GenOp(\"   @;\\r\\n\", new DecOp(pbrConfig)));\n      }\n   }\n   Var* metalness = new Var(\"metalness\", \"float\");\n   metalness->uniform = true;\n   metalness->constSortPos = cspPotentialPrimitive;\n\n   Var* smoothness = new Var(\"smoothness\", \"float\");\n   smoothness->uniform = true;\n   smoothness->constSortPos = cspPotentialPrimitive;\n\n   \/\/matinfo.g slot reserved for AO later\n   meta->addStatement(new GenOp(\"   @.g = 1.0;\\r\\n\", pbrConfig));\n   meta->addStatement(new GenOp(\"   @.b = @;\\r\\n\", pbrConfig, smoothness));\n   if (fd.features[MFT_InvertSmoothness])\n      meta->addStatement(new GenOp(\"   @ = 1.0-@;\\r\\n\", smoothness, smoothness));\n   meta->addStatement(new GenOp(\"   @.a = @;\\r\\n\", pbrConfig, metalness));\n   output = meta;\n}\n\nU32 GlowMapGLSL::getOutputTargets(const MaterialFeatureData& fd) const\n{\n   return fd.features[MFT_isDeferred] ? ShaderFeature::RenderTarget3 : ShaderFeature::DefaultTarget;\n}\n\n\/\/deferred emissive\nvoid GlowMapGLSL::processPix(Vector<ShaderComponent*>& componentList, const MaterialFeatureData& fd)\n{\n   Var* texCoord = getInTexCoord(\"texCoord\", \"float2\", componentList);\n\n   Var* glowMap = new Var;\n   glowMap->setType(\"sampler2D\");\n   glowMap->setName(\"glowMap\");\n   glowMap->uniform = true;\n   glowMap->sampler = true;\n   glowMap->constNum = Var::getTexUnitNum();\n   LangElement* texOp = new GenOp(\"tex2D(@, @)\", glowMap, texCoord);\n   \n   Var* glowMul = new Var(\"glowMul\", \"float\");\n   glowMul->uniform = true;\n   glowMul->constSortPos = cspPotentialPrimitive;\n\n   Var* targ = (Var*)LangElement::find(getOutputTargetVarName(ShaderFeature::DefaultTarget));\n   if (fd.features[MFT_isDeferred])\n   {\n      targ = (Var*)LangElement::find(getOutputTargetVarName(ShaderFeature::RenderTarget3));\n      if (!targ)\n      {\n         \/\/ create scene color target var\n         targ = new Var;\n         targ->setType(\"vec4\");\n         targ->setName(getOutputTargetVarName(ShaderFeature::RenderTarget3));\n         targ->setStructName(\"OUT\");\n         output = new GenOp(\"@ = vec4(@.rgb*@,0);\", targ, texOp, glowMul);\n      }\n      else\n      {\n         output = new GenOp(\"@ += vec4(@.rgb*@,0);\", targ, texOp, glowMul);\n      }\n   }\n   else\n   {\n      output = new GenOp(\"@ += vec4(@.rgb*@,@.a);\", targ, texOp, glowMul, targ);\n   }\n\n}\n\nShaderFeature::Resources GlowMapGLSL::getResources(const MaterialFeatureData& fd)\n{\n   Resources res;\n   res.numTex = 1;\n   res.numTexReg = 1;\n\n   return res;\n}\n\nvoid GlowMapGLSL::setTexData(Material::StageData& stageDat,\n   const MaterialFeatureData& fd,\n   RenderPassData& passData,\n   U32& texIndex)\n{\n   GFXTextureObject* tex = stageDat.getTex(MFT_GlowMap);\n   if (tex)\n   {\n      passData.mTexType[texIndex] = Material::Standard;\n      passData.mSamplerNames[texIndex] = \"glowMap\";\n      passData.mTexSlot[texIndex++].texObject = tex;\n   }\n}\n<commit_msg>\"ShaderFeatureGLSL::getInTexCoord - Type mismatch!\" bit turned out to be a simple typofix<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 \"lighting\/advanced\/glsl\/deferredShadingFeaturesGLSL.h\"\n\n#include \"lighting\/advanced\/advancedLightBinManager.h\"\n#include \"shaderGen\/langElement.h\"\n#include \"shaderGen\/shaderOp.h\"\n#include \"shaderGen\/conditionerFeature.h\"\n#include \"renderInstance\/renderDeferredMgr.h\"\n#include \"materials\/processedMaterial.h\"\n#include \"materials\/materialFeatureTypes.h\"\n\n\n\/\/****************************************************************************\n\/\/ Deferred Shading Features\n\/\/****************************************************************************\nU32 PBRConfigMapGLSL::getOutputTargets(const MaterialFeatureData& fd) const\n{\n   return fd.features[MFT_isDeferred] ? ShaderFeature::RenderTarget2 : ShaderFeature::DefaultTarget;\n}\n\nvoid PBRConfigMapGLSL::processPix( Vector<ShaderComponent*> &componentList, const MaterialFeatureData &fd )\n{\n   \/\/ Get the texture coord.\n   Var *texCoord = getInTexCoord( \"texCoord\", \"vec2\", componentList );\n   \n   MultiLine* meta = new MultiLine;\n   Var* pbrConfig;\n   if (fd.features[MFT_isDeferred])\n   {\n      pbrConfig = (Var*)LangElement::find(getOutputTargetVarName(ShaderFeature::RenderTarget2));\n      if (!pbrConfig)\n      {\n         \/\/ create material var\n         pbrConfig = new Var;\n         pbrConfig->setType(\"vec4\");\n         pbrConfig->setName(getOutputTargetVarName(ShaderFeature::RenderTarget2));\n         pbrConfig->setStructName(\"OUT\");\n      }\n   }\n   else\n   {\n      pbrConfig = (Var*)LangElement::find(\"PBRConfig\");\n      if (!pbrConfig)\n      {\n         pbrConfig = new Var(\"PBRConfig\", \"vec4\");\n         meta->addStatement(new GenOp(\"   @;\\r\\n\", new DecOp(pbrConfig)));\n      }\n   }\n\n   \/\/ create texture var\n   Var *pbrConfigMap = new Var;\n   pbrConfigMap->setType( \"sampler2D\" );\n   pbrConfigMap->setName( \"pbrConfigMap\" );\n   pbrConfigMap->uniform = true;\n   pbrConfigMap->sampler = true;\n   pbrConfigMap->constNum = Var::getTexUnitNum();\n   LangElement *texOp = new GenOp( \"tex2D(@, @)\", pbrConfigMap, texCoord );\n\n   Var *metalness = (Var*)LangElement::find(\"metalness\");\n   if (!metalness) metalness = new Var(\"metalness\", \"float\");\n   Var *smoothness = (Var*)LangElement::find(\"smoothness\");\n   if (!smoothness) smoothness = new Var(\"smoothness\", \"float\");\n   Var* ao = (Var*)LangElement::find(\"ao\");\n   if (!ao) ao = new Var(\"ao\", \"float\");\n\n\n   meta->addStatement(new GenOp(\"   @.bga = @.rgb;\\r\\n\", pbrConfig, texOp));\n\n   meta->addStatement(new GenOp(\"   @ = @.b;\\r\\n\", new DecOp(smoothness), pbrConfig));\n   if (fd.features[MFT_InvertSmoothness])\n   {\n      meta->addStatement(new GenOp(\"   @.b = 1.0-@.b;\\r\\n\", pbrConfig, pbrConfig));\n      meta->addStatement(new GenOp(\"   @ = 1.0-@;\\r\\n\", smoothness, smoothness));\n   }\n   meta->addStatement(new GenOp(\"   @ = @.g;\\r\\n\", new DecOp(ao), pbrConfig));\n   meta->addStatement(new GenOp(\"   @ = @.a;\\r\\n\", new DecOp(metalness), pbrConfig));\n\n   output = meta;\n}\n\nShaderFeature::Resources PBRConfigMapGLSL::getResources( const MaterialFeatureData &fd )\n{\n   Resources res; \n   res.numTex = 1;\n   res.numTexReg = 1;\n\n   return res;\n}\n\nvoid PBRConfigMapGLSL::setTexData(   Material::StageData &stageDat,\n                                       const MaterialFeatureData &fd,\n                                       RenderPassData &passData,\n                                       U32 &texIndex )\n{\n   GFXTextureObject *tex = stageDat.getTex(MFT_PBRConfigMap);\n   if ( tex )\n   {\n      passData.mTexType[ texIndex ] = Material::Standard;\n      passData.mSamplerNames[ texIndex ] = \"pbrConfigMap\";\n      passData.mTexSlot[ texIndex++ ].texObject = tex;\n   }\n}\n\nvoid PBRConfigMapGLSL::processVert( Vector<ShaderComponent*> &componentList,\n                                       const MaterialFeatureData &fd )\n{\n   MultiLine *meta = new MultiLine;\n   getOutTexCoord(   \"texCoord\", \n                     \"vec2\", \n                     fd.features[MFT_TexAnim], \n                     meta, \n                     componentList );\n   output = meta;\n}\n\nU32 MatInfoFlagsGLSL::getOutputTargets(const MaterialFeatureData& fd) const\n{\n   return fd.features[MFT_isDeferred] ? ShaderFeature::RenderTarget2 : ShaderFeature::DefaultTarget;\n}\n\n\/\/ Material Info Flags -> Red ( Flags ) of Material Info Buffer.\nvoid MatInfoFlagsGLSL::processPix( Vector<ShaderComponent*> &componentList, const MaterialFeatureData &fd )\n{\n\tMultiLine *meta = new MultiLine;\n\n   Var* pbrConfig;\n   if (fd.features[MFT_isDeferred])\n   {\n      pbrConfig = (Var*)LangElement::find(getOutputTargetVarName(ShaderFeature::RenderTarget2));\n      if (!pbrConfig)\n      {\n         \/\/ create material var\n         pbrConfig = new Var;\n         pbrConfig->setType(\"vec4\");\n         pbrConfig->setName(getOutputTargetVarName(ShaderFeature::RenderTarget2));\n         pbrConfig->setStructName(\"OUT\");\n      }\n   }\n   else\n   {\n      pbrConfig = (Var*)LangElement::find(\"PBRConfig\");\n      if (!pbrConfig)\n      {\n         pbrConfig = new Var(\"PBRConfig\", \"vec4\");\n         meta->addStatement(new GenOp(\"   @;\\r\\n\", new DecOp(pbrConfig)));\n      }\n   }\n\n   Var *matInfoFlags = new Var;\n   matInfoFlags->setType( \"float\" );\n   matInfoFlags->setName( \"matInfoFlags\" );\n   matInfoFlags->uniform = true;\n   matInfoFlags->constSortPos = cspPotentialPrimitive;\n\n   meta->addStatement(output = new GenOp(\"   @.r = @;\\r\\n\", pbrConfig, matInfoFlags));\n   output = meta;\n}\n\nU32 PBRConfigVarsGLSL::getOutputTargets(const MaterialFeatureData& fd) const\n{\n   return fd.features[MFT_isDeferred] ? ShaderFeature::RenderTarget2 : ShaderFeature::DefaultTarget;\n}\n\n\/\/ Spec Strength -> Blue Channel of Material Info Buffer.\n\/\/ Spec Power -> Alpha Channel ( of Material Info Buffer.\nvoid PBRConfigVarsGLSL::processPix( Vector<ShaderComponent*> &componentList, const MaterialFeatureData &fd )\n{\n   MultiLine* meta = new MultiLine;\n\n   Var* pbrConfig;\n   if (fd.features[MFT_isDeferred])\n   {\n      pbrConfig = (Var*)LangElement::find(getOutputTargetVarName(ShaderFeature::RenderTarget2));\n      if (!pbrConfig)\n      {\n         \/\/ create material var\n         pbrConfig = new Var;\n         pbrConfig->setType(\"vec4\");\n         pbrConfig->setName(getOutputTargetVarName(ShaderFeature::RenderTarget2));\n         pbrConfig->setStructName(\"OUT\");\n      }\n   }\n   else\n   {\n      pbrConfig = (Var*)LangElement::find(\"PBRConfig\");\n      if (!pbrConfig)\n      {\n         pbrConfig = new Var(\"PBRConfig\", \"vec4\");\n         meta->addStatement(new GenOp(\"   @;\\r\\n\", new DecOp(pbrConfig)));\n      }\n   }\n   Var* metalness = new Var(\"metalness\", \"float\");\n   metalness->uniform = true;\n   metalness->constSortPos = cspPotentialPrimitive;\n\n   Var* smoothness = new Var(\"smoothness\", \"float\");\n   smoothness->uniform = true;\n   smoothness->constSortPos = cspPotentialPrimitive;\n\n   \/\/matinfo.g slot reserved for AO later\n   meta->addStatement(new GenOp(\"   @.g = 1.0;\\r\\n\", pbrConfig));\n   meta->addStatement(new GenOp(\"   @.b = @;\\r\\n\", pbrConfig, smoothness));\n   if (fd.features[MFT_InvertSmoothness])\n      meta->addStatement(new GenOp(\"   @ = 1.0-@;\\r\\n\", smoothness, smoothness));\n   meta->addStatement(new GenOp(\"   @.a = @;\\r\\n\", pbrConfig, metalness));\n   output = meta;\n}\n\nU32 GlowMapGLSL::getOutputTargets(const MaterialFeatureData& fd) const\n{\n   return fd.features[MFT_isDeferred] ? ShaderFeature::RenderTarget3 : ShaderFeature::DefaultTarget;\n}\n\n\/\/deferred emissive\nvoid GlowMapGLSL::processPix(Vector<ShaderComponent*>& componentList, const MaterialFeatureData& fd)\n{\n   Var* texCoord = getInTexCoord(\"texCoord\", \"vec2\", componentList);\n\n   Var* glowMap = new Var;\n   glowMap->setType(\"sampler2D\");\n   glowMap->setName(\"glowMap\");\n   glowMap->uniform = true;\n   glowMap->sampler = true;\n   glowMap->constNum = Var::getTexUnitNum();\n   LangElement* texOp = new GenOp(\"tex2D(@, @)\", glowMap, texCoord);\n   \n   Var* glowMul = new Var(\"glowMul\", \"float\");\n   glowMul->uniform = true;\n   glowMul->constSortPos = cspPotentialPrimitive;\n\n   Var* targ = (Var*)LangElement::find(getOutputTargetVarName(ShaderFeature::DefaultTarget));\n   if (fd.features[MFT_isDeferred])\n   {\n      targ = (Var*)LangElement::find(getOutputTargetVarName(ShaderFeature::RenderTarget3));\n      if (!targ)\n      {\n         \/\/ create scene color target var\n         targ = new Var;\n         targ->setType(\"vec4\");\n         targ->setName(getOutputTargetVarName(ShaderFeature::RenderTarget3));\n         targ->setStructName(\"OUT\");\n         output = new GenOp(\"@ = vec4(@.rgb*@,0);\", targ, texOp, glowMul);\n      }\n      else\n      {\n         output = new GenOp(\"@ += vec4(@.rgb*@,0);\", targ, texOp, glowMul);\n      }\n   }\n   else\n   {\n      output = new GenOp(\"@ += vec4(@.rgb*@,@.a);\", targ, texOp, glowMul, targ);\n   }\n\n}\n\nShaderFeature::Resources GlowMapGLSL::getResources(const MaterialFeatureData& fd)\n{\n   Resources res;\n   res.numTex = 1;\n   res.numTexReg = 1;\n\n   return res;\n}\n\nvoid GlowMapGLSL::setTexData(Material::StageData& stageDat,\n   const MaterialFeatureData& fd,\n   RenderPassData& passData,\n   U32& texIndex)\n{\n   GFXTextureObject* tex = stageDat.getTex(MFT_GlowMap);\n   if (tex)\n   {\n      passData.mTexType[texIndex] = Material::Standard;\n      passData.mSamplerNames[texIndex] = \"glowMap\";\n      passData.mTexSlot[texIndex++].texObject = tex;\n   }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Time:  O(n * k)\n\/\/ Space: O(k)\n\nclass Solution {\npublic:\n    int minCostII(vector<vector<int>>& costs) {\n        if (costs.empty()) {\n            return 0;\n        }\n        \n        vector<vector<int>> min_cost(2, costs[0]);\n\n        const int n = costs.size();\n        const int k = costs[0].size();\n        for (int i = 1; i < n; ++i) {\n            int smallest = numeric_limits<int>::max(), second_smallest = numeric_limits<int>::max();\n            for (int j = 0; j < k; ++j) {\n                if (min_cost[(i - 1) % 2][j] < smallest) {\n                    second_smallest = smallest;\n                    smallest = min_cost[(i - 1) % 2][j];\n                } else if (min_cost[(i - 1) % 2][j] < second_smallest) {\n                    second_smallest = min_cost[(i - 1) % 2][j];\n                }\n            }\n            for (int j = 0; j < k; ++j) {\n                const int min_j = (min_cost[(i - 1) % 2][j] != smallest) ? smallest : second_smallest;\n                min_cost[i % 2][j] = costs[i][j] + min_j;\n            }\n        }\n\n        return *min_element(min_cost[(n - 1) % 2].begin(), min_cost[(n - 1) % 2].end());\n    }\n};\n\n\/\/ Time:  O(n * k)\n\/\/ Space: O(k)\nclass Solution2{\npublic:\n    int minCostII(vector<vector<int>>& costs) {\n        if (costs.empty()) {\n            return 0;\n        }\n        auto combine = [](const vector<int>& tmp, const vector<int>& house) {\n                            const int smallest = *min_element(tmp.cbegin(), tmp.cend());\n                            const int i = distance(tmp.begin(), find(tmp.cbegin(), tmp.cend(), smallest));\n                            vector<int> tmp2(tmp);\n                            tmp2.erase(tmp2.begin() + i);\n                            const int second_smallest = *min_element(tmp2.cbegin(), tmp2.cend());\n                            vector<int> min_cost(tmp.size(), smallest);\n                            min_cost[i] = second_smallest;\n                            transform(min_cost.begin(), min_cost.end(), house.begin(),\n                                      min_cost.begin(), std::plus<int>());\n                            return min_cost;\n                        };\n        vector<int> min_cost = accumulate(costs.cbegin(), costs.cend(), vector<int>(costs[0].size(), 0), combine);\n        return *min_element(min_cost.cbegin(), min_cost.cend());\n\n    }\n};\n<commit_msg>Update paint-house-ii.cpp<commit_after>\/\/ Time:  O(n * k)\n\/\/ Space: O(k)\n\nclass Solution {\npublic:\n    int minCostII(vector<vector<int>>& costs) {\n        if (costs.empty()) {\n            return 0;\n        }\n        \n        vector<vector<int>> min_cost(2, costs[0]);\n\n        const int n = costs.size();\n        const int k = costs[0].size();\n        for (int i = 1; i < n; ++i) {\n            int smallest = numeric_limits<int>::max(), second_smallest = numeric_limits<int>::max();\n            for (int j = 0; j < k; ++j) {\n                if (min_cost[(i - 1) % 2][j] < smallest) {\n                    second_smallest = smallest;\n                    smallest = min_cost[(i - 1) % 2][j];\n                } else if (min_cost[(i - 1) % 2][j] < second_smallest) {\n                    second_smallest = min_cost[(i - 1) % 2][j];\n                }\n            }\n            for (int j = 0; j < k; ++j) {\n                const int min_j = (min_cost[(i - 1) % 2][j] != smallest) ? smallest : second_smallest;\n                min_cost[i % 2][j] = costs[i][j] + min_j;\n            }\n        }\n\n        return *min_element(min_cost[(n - 1) % 2].begin(), min_cost[(n - 1) % 2].end());\n    }\n};\n\n\/\/ Time:  O(n * k)\n\/\/ Space: O(k)\nclass Solution2{\npublic:\n    int minCostII(vector<vector<int>>& costs) {\n        if (costs.empty()) {\n            return 0;\n        }\n        auto combine = [](const vector<int>& tmp, const vector<int>& house) {\n                            const int smallest = *min_element(tmp.cbegin(), tmp.cend());\n                            const int i = distance(tmp.begin(), find(tmp.cbegin(), tmp.cend(), smallest));\n                            vector<int> tmp2(tmp);\n                            tmp2.erase(tmp2.begin() + i);\n                            const int second_smallest = *min_element(tmp2.cbegin(), tmp2.cend());\n                            vector<int> min_cost(tmp.size(), smallest);\n                            min_cost[i] = second_smallest;\n                            transform(min_cost.cbegin(), min_cost.cend(), house.cbegin(),\n                                      min_cost.begin(), std::plus<int>());\n                            return min_cost;\n                        };\n        vector<int> min_cost = accumulate(costs.cbegin(), costs.cend(), vector<int>(costs[0].size(), 0), combine);\n        return *min_element(min_cost.cbegin(), min_cost.cend());\n\n    }\n};\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2016, University of Freiburg,\n\/\/ Chair of Algorithms and Data Structures.\n\/\/ Author: Björn Buchhold (buchhold@informatik.uni-freiburg.de)\n\n#include <fstream>\n#include \"..\/util\/StringUtils.h\"\n#include \"..\/util\/Exception.h\"\n#include \".\/QueryPlanningCostFactors.h\"\n\n\n\/\/ _____________________________________________________________________________\nQueryPlanningCostFactors::QueryPlanningCostFactors() : _factors() {\n  \/\/ Set default values\n  _factors[\"FILTER_PUNISH\"] = 10.0;\n  _factors[\"NO_FILTER_PUNISH\"] = 1.0;\n  _factors[\"FILTER_SELECTIVITY\"] = 0.5;\n  _factors[\"HASH_MAP_OPERATION_COST\"] = 50.0;\n}\n\n\/\/ _____________________________________________________________________________\nvoid QueryPlanningCostFactors::readFromFile(const string& fileName) {\n  std::ifstream in(fileName.c_str());\n  string line;\n  while (std::getline(in, line)) {\n    auto v = ad_utility::split(line, '\\t');\n    AD_CHECK_EQ(v.size(), 2);\n    _factors[v[0]] = atol(v[1].c_str());\n  }\n}\n\n\/\/ _____________________________________________________________________________\nfloat QueryPlanningCostFactors::getCostFactor(const string& key) const {\n  return _factors.find(key)->second;\n}\n\n\n\n<commit_msg>fine tuning on text operation cost factors<commit_after>\/\/ Copyright 2016, University of Freiburg,\n\/\/ Chair of Algorithms and Data Structures.\n\/\/ Author: Björn Buchhold (buchhold@informatik.uni-freiburg.de)\n\n#include <fstream>\n#include \"..\/util\/StringUtils.h\"\n#include \"..\/util\/Exception.h\"\n#include \".\/QueryPlanningCostFactors.h\"\n\n\n\/\/ _____________________________________________________________________________\nQueryPlanningCostFactors::QueryPlanningCostFactors() : _factors() {\n  \/\/ Set default values\n  _factors[\"FILTER_PUNISH\"] = 100.0;\n  _factors[\"NO_FILTER_PUNISH\"] = 1.0;\n  _factors[\"FILTER_SELECTIVITY\"] = 0.5;\n  _factors[\"HASH_MAP_OPERATION_COST\"] = 50.0;\n}\n\n\/\/ _____________________________________________________________________________\nvoid QueryPlanningCostFactors::readFromFile(const string& fileName) {\n  std::ifstream in(fileName.c_str());\n  string line;\n  while (std::getline(in, line)) {\n    auto v = ad_utility::split(line, '\\t');\n    AD_CHECK_EQ(v.size(), 2);\n    _factors[v[0]] = atol(v[1].c_str());\n  }\n}\n\n\/\/ _____________________________________________________________________________\nfloat QueryPlanningCostFactors::getCostFactor(const string& key) const {\n  return _factors.find(key)->second;\n}\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n===========================================================================\nDaemon BSD Source Code\nCopyright (c) 2013-2014, Daemon Developers\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n    * Redistributions of source code must retain the above copyright\n      notice, this list of conditions and the following disclaimer.\n    * Redistributions in binary form must reproduce the above copyright\n      notice, this list of conditions and the following disclaimer in the\n      documentation and\/or other materials provided with the distribution.\n    * Neither the name of the Daemon developers nor the\n      names of its contributors may be used to endorse or promote products\n      derived from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\nANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\nWARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL DAEMON DEVELOPERS BE LIABLE FOR ANY\nDIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\nLOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\nON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n===========================================================================\n*\/\n\n#include \"framework\/Application.h\"\n#include \"ConsoleHistory.h\"\n\nnamespace Console {\nHistory::Container History::lines;\nstd::mutex History::lines_mutex;\n\nstd::string History::GetFilename()\n{\n\treturn \"conhistory\" + Application::GetTraits().uniqueHomepathSuffix;\n}\n\nvoid History::Save() {\n\ttry {\n\t\tFS::File f = FS::HomePath::OpenWrite(GetFilename());\n\n\t\tauto lock = Lock();\n\t\tContainer::size_type i = 0;\n\t\tif ( lines.size() > SAVED_HISTORY_LINES )\n\t\t\ti = lines.size() - SAVED_HISTORY_LINES;\n\t\tfor (; i < lines.size(); i++)\n\t\t{\n\t\t\tf.Write(lines[i].data(), lines[i].size());\n\t\t\tf.Write(\"\\n\", 1);\n\t\t}\n\t} catch (const std::system_error& error) {\n\t\tLog::Warn(\"Couldn't write %s: %s\", GetFilename(), error.what());\n\t}\n}\n\nvoid History::Load() {\n\tstd::string buffer;\n\n\ttry {\n\t\tFS::File f = FS::HomePath::OpenRead(GetFilename());\n\t\tbuffer = f.ReadAll();\n\t} catch (const std::system_error& error) {\n\t\tLog::Warn(\"Couldn't read %s: %s\", GetFilename(), error.what());\n\t}\n\n\tauto lock = Lock();\n\tlines.clear();\n\tstd::size_t currentPos = 0;\n\tstd::size_t nextPos = 0;\n\twhile (true)\n\t{\n\t\tnextPos = buffer.find('\\n', currentPos);\n\t\tif ( nextPos == std::string::npos )\n\t\t\tbreak;\n\t\tlines.emplace_back(buffer, currentPos, (nextPos - currentPos));\n\t\tcurrentPos = nextPos + 1;\n\t}\n}\n\nHistory::History()\n\t: current_line( std::numeric_limits<Container::size_type>::max() )\n{}\n\nvoid History::Add( const Line& text )\n{\n\tauto lock = Lock();\n\n\tif ( lines.empty() || text != lines.back() )\n\t{\n\t\tlines.push_back(std::move( text ));\n\t}\n\n\tcurrent_line = lines.size();\n\tunfinished.clear();\n\n\tSave();\n}\n\nvoid History::PrevLine( Line& text )\n{\n\tauto lock = Lock();\n\n\tif ( lines.empty() )\n\t{\n\t\treturn;\n\t}\n\n\tif ( !text.empty() && ( current_line >= lines.size() || text != lines[current_line] ) )\n\t{\n\t\tunfinished = text;\n\t}\n\n\tif ( current_line >= lines.size() )\n\t{\n\t\tcurrent_line = lines.size() - 1;\n\t}\n\telse if ( current_line > 0 )\n\t{\n\t\tcurrent_line--;\n\t}\n\n\ttext = lines[current_line];\n}\n\nvoid History::NextLine( Line& text )\n{\n\tauto lock = Lock();\n\n\tif ( lines.empty() || current_line >= lines.size() - 1 )\n\t{\n\t\ttext = unfinished;\n\t\tunfinished.clear();\n\t\tcurrent_line = lines.size();\n\t}\n\telse\n\t{\n\t\tcurrent_line++;\n\t\ttext = lines[current_line];\n\t}\n}\n\n}\n<commit_msg>Avoid deadlock on the console history<commit_after>\/*\n===========================================================================\nDaemon BSD Source Code\nCopyright (c) 2013-2014, Daemon Developers\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n    * Redistributions of source code must retain the above copyright\n      notice, this list of conditions and the following disclaimer.\n    * Redistributions in binary form must reproduce the above copyright\n      notice, this list of conditions and the following disclaimer in the\n      documentation and\/or other materials provided with the distribution.\n    * Neither the name of the Daemon developers nor the\n      names of its contributors may be used to endorse or promote products\n      derived from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\nANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\nWARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL DAEMON DEVELOPERS BE LIABLE FOR ANY\nDIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\nLOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\nON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n===========================================================================\n*\/\n\n#include \"framework\/Application.h\"\n#include \"ConsoleHistory.h\"\n\nnamespace Console {\nHistory::Container History::lines;\nstd::mutex History::lines_mutex;\n\nstd::string History::GetFilename()\n{\n\treturn \"conhistory\" + Application::GetTraits().uniqueHomepathSuffix;\n}\n\nvoid History::Save() {\n\ttry {\n\t\tFS::File f = FS::HomePath::OpenWrite(GetFilename());\n\n\t\tauto lock = Lock();\n\t\tContainer::size_type i = 0;\n\t\tif ( lines.size() > SAVED_HISTORY_LINES )\n\t\t\ti = lines.size() - SAVED_HISTORY_LINES;\n\t\tfor (; i < lines.size(); i++)\n\t\t{\n\t\t\tf.Write(lines[i].data(), lines[i].size());\n\t\t\tf.Write(\"\\n\", 1);\n\t\t}\n\t} catch (const std::system_error& error) {\n\t\tLog::Warn(\"Couldn't write %s: %s\", GetFilename(), error.what());\n\t}\n}\n\nvoid History::Load() {\n\tstd::string buffer;\n\n\ttry {\n\t\tFS::File f = FS::HomePath::OpenRead(GetFilename());\n\t\tbuffer = f.ReadAll();\n\t} catch (const std::system_error& error) {\n\t\tLog::Warn(\"Couldn't read %s: %s\", GetFilename(), error.what());\n\t}\n\n\tauto lock = Lock();\n\tlines.clear();\n\tstd::size_t currentPos = 0;\n\tstd::size_t nextPos = 0;\n\twhile (true)\n\t{\n\t\tnextPos = buffer.find('\\n', currentPos);\n\t\tif ( nextPos == std::string::npos )\n\t\t\tbreak;\n\t\tlines.emplace_back(buffer, currentPos, (nextPos - currentPos));\n\t\tcurrentPos = nextPos + 1;\n\t}\n}\n\nHistory::History()\n\t: current_line( std::numeric_limits<Container::size_type>::max() )\n{}\n\nvoid History::Add( const Line& text )\n{\n\tauto lock = Lock();\n\n\tif ( lines.empty() || text != lines.back() )\n\t{\n\t\tlines.push_back(std::move( text ));\n\t}\n\n\tcurrent_line = lines.size();\n\tunfinished.clear();\n\n\tlock.unlock();\n\tSave();\n}\n\nvoid History::PrevLine( Line& text )\n{\n\tauto lock = Lock();\n\n\tif ( lines.empty() )\n\t{\n\t\treturn;\n\t}\n\n\tif ( !text.empty() && ( current_line >= lines.size() || text != lines[current_line] ) )\n\t{\n\t\tunfinished = text;\n\t}\n\n\tif ( current_line >= lines.size() )\n\t{\n\t\tcurrent_line = lines.size() - 1;\n\t}\n\telse if ( current_line > 0 )\n\t{\n\t\tcurrent_line--;\n\t}\n\n\ttext = lines[current_line];\n}\n\nvoid History::NextLine( Line& text )\n{\n\tauto lock = Lock();\n\n\tif ( lines.empty() || current_line >= lines.size() - 1 )\n\t{\n\t\ttext = unfinished;\n\t\tunfinished.clear();\n\t\tcurrent_line = lines.size();\n\t}\n\telse\n\t{\n\t\tcurrent_line++;\n\t\ttext = lines[current_line];\n\t}\n}\n\n}\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\n#include \"vtkSlicerTortuosityLogic.h\"\n\n\/\/ ITK includes\n#include \"itkVesselTubeSpatialObject.h\"\n#include \"itktubeTortuositySpatialObjectFilter.h\"\n\n\/\/ Spatial object includes\n#include \"vtkMRMLSpatialObjectsNode.h\"\n\n\/\/ VTK includes\n#include \"vtkObjectFactory.h\"\n#include \"vtkDelimitedTextWriter.h\"\n#include \"vtkDoubleArray.h\"\n#include \"vtkIntArray.h\"\n#include \"vtkMath.h\"\n#include \"vtkNew.h\"\n#include \"vtkPointData.h\"\n#include \"vtkPolyData.h\"\n#include \"vtkTable.h\"\n\n#include <math.h>\n\nvtkStandardNewMacro(vtkSlicerTortuosityLogic);\n\n\/\/------------------------------------------------------------------------------\nvtkSlicerTortuosityLogic::vtkSlicerTortuosityLogic( void )\n{\n  this->FlagToArrayNames[DistanceMetric] = \"DistanceMetric\";\n  this->FlagToArrayNames[InflectionCountMetric] = \"InflectionCountMetric\";\n  this->FlagToArrayNames[InflectionPoints] = \"InflectionPoints\";\n  this->FlagToArrayNames[SumOfAnglesMetric] = \"SumOfAnglesMetric\";\n}\n\n\/\/------------------------------------------------------------------------------\nvtkSlicerTortuosityLogic::~vtkSlicerTortuosityLogic( void )\n{\n}\n\n\/\/------------------------------------------------------------------------------\nvoid vtkSlicerTortuosityLogic::PrintSelf(ostream& os, vtkIndent indent)\n{\n}\n\n\/\/------------------------------------------------------------------------------\nbool vtkSlicerTortuosityLogic::UniqueMeasure(int flag)\n{\n  return flag == vtkSlicerTortuosityLogic::DistanceMetric ||\n    flag == vtkSlicerTortuosityLogic::InflectionCountMetric ||\n    flag == vtkSlicerTortuosityLogic::InflectionPoints ||\n    flag == vtkSlicerTortuosityLogic::SumOfAnglesMetric;\n}\n\n\/\/------------------------------------------------------------------------------\nvtkDoubleArray* vtkSlicerTortuosityLogic\n::GetDistanceMetricArray(vtkMRMLSpatialObjectsNode* node, int flag)\n{\n  return this->GetOrCreateArray(\n    node, flag & vtkSlicerTortuosityLogic::DistanceMetric);\n}\n\n\/\/------------------------------------------------------------------------------\nvtkDoubleArray* vtkSlicerTortuosityLogic\n::GetInflectionCountMetricArray(vtkMRMLSpatialObjectsNode* node, int flag)\n{\n  return this->GetOrCreateArray(\n    node, flag & vtkSlicerTortuosityLogic::InflectionCountMetric);\n}\n\n\/\/------------------------------------------------------------------------------\nvtkDoubleArray* vtkSlicerTortuosityLogic\n::GetInflectionPointsArray(vtkMRMLSpatialObjectsNode* node, int flag)\n{\n  return this->GetOrCreateArray(\n    node, flag & vtkSlicerTortuosityLogic::InflectionPoints);\n}\n\n\/\/------------------------------------------------------------------------------\nvtkDoubleArray* vtkSlicerTortuosityLogic\n::GetSumOfAnglesMetricArray(vtkMRMLSpatialObjectsNode* node, int flag)\n{\n  return this->GetOrCreateArray(\n    node, flag & vtkSlicerTortuosityLogic::SumOfAnglesMetric);\n}\n\n\/\/------------------------------------------------------------------------------\nvtkDoubleArray* vtkSlicerTortuosityLogic\n::GetOrCreateArray(vtkMRMLSpatialObjectsNode* node, int flag)\n{\n  if (!flag || !this->UniqueMeasure(flag))\n    {\n    return NULL;\n    }\n\n  std::string name = this->FlagToArrayNames[flag];\n  vtkDoubleArray* metricArray =\n    this->GetOrCreateArray<vtkDoubleArray>(node, name.c_str());\n  if (!metricArray)\n    {\n    return NULL;\n    }\n\n  \/\/ If it's new, make it the correct size\n  vtkDoubleArray* ids = this->GetArray<vtkDoubleArray>(node, \"TubeIDs\");\n  assert(ids);\n  if (metricArray->GetSize() != ids->GetSize());\n    {\n    metricArray->SetNumberOfValues(ids->GetSize());\n    }\n  return metricArray;\n}\n\n\/\/------------------------------------------------------------------------------\ntemplate<typename T> T* vtkSlicerTortuosityLogic\n::GetArray(vtkMRMLSpatialObjectsNode* node, const char* name)\n{\n  vtkPolyData* polydata = node->GetPolyData();\n  if (!polydata)\n    {\n    return NULL;\n    }\n  vtkPointData* pointData = polydata->GetPointData();\n  if (!pointData)\n    {\n    return NULL;\n    }\n\n  return T::SafeDownCast(pointData->GetArray(name));\n}\n\n\/\/------------------------------------------------------------------------------\ntemplate<typename T> T* vtkSlicerTortuosityLogic\n::GetOrCreateArray(vtkMRMLSpatialObjectsNode* node, const char* name)\n{\n  T* metricArray = this->GetArray<T>(node, name);\n  if (!metricArray)\n    {\n    vtkPolyData* polydata = node->GetPolyData();\n    if (!polydata)\n      {\n      return NULL;\n      }\n    vtkPointData* pointData = polydata->GetPointData();\n    if (!pointData)\n      {\n      return NULL;\n      }\n\n    vtkNew<T> newMetricArray;\n    newMetricArray->SetName(name);\n    pointData->AddArray(newMetricArray.GetPointer());\n    return newMetricArray.GetPointer();\n    }\n  return metricArray;\n}\n\n\/\/------------------------------------------------------------------------------\nbool vtkSlicerTortuosityLogic\n::RunDistanceMetric(vtkMRMLSpatialObjectsNode* node)\n{\n  return this->RunMetrics(\n    node, vtkSlicerTortuosityLogic::DistanceMetric);\n}\n\n\/\/------------------------------------------------------------------------------\nbool vtkSlicerTortuosityLogic\n::RunInflectionCountMetric(vtkMRMLSpatialObjectsNode* node)\n{\n  return this->RunMetrics(\n    node, vtkSlicerTortuosityLogic::InflectionCountMetric);\n}\n\n\/\/------------------------------------------------------------------------------\nbool vtkSlicerTortuosityLogic\n::RunInflectionPoints(vtkMRMLSpatialObjectsNode* node)\n{\n  return this->RunMetrics(\n    node, vtkSlicerTortuosityLogic::InflectionPoints);\n}\n\n\/\/------------------------------------------------------------------------------\nbool vtkSlicerTortuosityLogic\n::RunSumOfAnglesMetric(vtkMRMLSpatialObjectsNode* node)\n{\n  return this->RunMetrics(\n    node, vtkSlicerTortuosityLogic::SumOfAnglesMetric);\n}\n\n\/\/------------------------------------------------------------------------------\nbool vtkSlicerTortuosityLogic\n::RunMetrics(vtkMRMLSpatialObjectsNode* node, int flag)\n{\n  if (!node)\n    {\n    return false;\n    }\n\n  \/\/ 1 - Get the metric arrays\n  vtkDoubleArray* dm = this->GetDistanceMetricArray(node, flag);\n  vtkDoubleArray* icm = this->GetInflectionCountMetricArray(node, flag);\n  vtkDoubleArray* ip = this->GetInflectionPointsArray(node, flag);\n  vtkDoubleArray* soam = this->GetSumOfAnglesMetricArray(node, flag);\n\n  if (!dm && !icm && !ip && !soam)\n    {\n    std::cerr<<\"Tortuosity flag mode unknown.\"<<std::endl;\n    return false;\n    }\n\n  \/\/ Rewrite number of points array everytime\n  vtkIntArray* nop = this->GetOrCreateArray<vtkIntArray>(node, \"NumberOfPoints\");\n\n  \/\/ 2 - Fill the metric arrays\n  typedef vtkMRMLSpatialObjectsNode::TubeNetType                    TubeNetType;\n  typedef itk::VesselTubeSpatialObject<3>                           VesselTubeType;\n  typedef itk::tube::TortuositySpatialObjectFilter<VesselTubeType>  FilterType;\n\n  TubeNetType* spatialObject = node->GetSpatialObject();\n\n  char childName[] = \"Tube\";\n  TubeNetType::ChildrenListType* tubeList =\n    spatialObject->GetChildren(spatialObject->GetMaximumDepth(), childName);\n\n  size_t totalNumberOfPointsAdded = 0;\n  for(TubeNetType::ChildrenListType::iterator tubeIt = tubeList->begin();\n        tubeIt != tubeList->end(); ++tubeIt)\n    {\n    VesselTubeType* currTube =\n      dynamic_cast<VesselTubeType*>((*tubeIt).GetPointer());\n    if (!currTube)\n      {\n      continue;\n      }\n\n    if (currTube->GetNumberOfPoints() < 2)\n      {\n      std::cerr<<\"Error, vessel #\"<<currTube->GetId()\n        <<\" has less than 2 points !\"<<std::endl\n        <<\"Skipping the vessel.\"<<std::endl;\n      continue;\n      }\n\n    \/\/ Update filter\n    FilterType::Pointer filter = FilterType::New();\n    filter->SetMeasureFlag(flag);\n    filter->SetInput(currTube);\n    filter->Update();\n\n    if (filter->GetOutput()->GetId() != currTube->GetId())\n      {\n      std::cerr<<\"Error while running filter on tube.\"<<std::endl;\n      return false;\n      }\n\n    \/\/ Fill the arrays\n    size_t numberOfPoints = currTube->GetPoints().size();\n    for(size_t filterIndex = 0, tubeIndex = totalNumberOfPointsAdded;\n      filterIndex < numberOfPoints; ++filterIndex, ++tubeIndex)\n      {\n      if (dm)\n        {\n        dm->SetValue(tubeIndex, filter->GetDistanceMetric());\n        }\n      if (icm)\n        {\n        icm->SetValue(tubeIndex, filter->GetInflectionCountMetric());\n        }\n      if (soam)\n        {\n        soam->SetValue(tubeIndex, filter->GetSumOfAnglesMetric());\n        }\n      if (ip)\n        {\n        ip->SetValue(tubeIndex, filter->GetInflectionPointValue(filterIndex));\n        }\n\n      nop->InsertNextValue(numberOfPoints);\n      }\n\n    totalNumberOfPointsAdded += numberOfPoints;\n    }\n\n  return true;\n}\n\n\/\/------------------------------------------------------------------------------\nstd::vector<std::string> vtkSlicerTortuosityLogic::GetNamesFromFlag(int flag)\n{\n  std::vector<std::string> names;\n  for (int compareFlag = vtkSlicerTortuosityLogic::DistanceMetric;\n    compareFlag <= vtkSlicerTortuosityLogic::SumOfAnglesMetric;\n    compareFlag = compareFlag << 1)\n    {\n    if (flag & compareFlag)\n      {\n      names.push_back(this->FlagToArrayNames[compareFlag]);\n      }\n    }\n  return names;\n}\n\n\/\/------------------------------------------------------------------------------\nbool vtkSlicerTortuosityLogic\n::SaveAsCSV(vtkMRMLSpatialObjectsNode* node, const char* filename, int flag)\n{\n  if (!node || !filename)\n    {\n    return false;\n    }\n\n  \/\/ Get the metric arrays\n  std::vector<vtkDoubleArray*> metricArrays;\n  std::vector<std::string> names = this->GetNamesFromFlag(flag);\n  for (std::vector<std::string>::iterator it = names.begin();\n    it != names.end(); ++it)\n    {\n    vtkDoubleArray* metricArray =\n      this->GetArray<vtkDoubleArray>(node, it->c_str());\n    if (metricArray)\n      {\n      metricArrays.push_back(metricArray);\n      }\n    }\n\n  \/\/ Make sure we have everything we need for export\n  if (metricArrays.size() <= 0)\n    {\n    std::cout<<\"No array found for given flag: \"<<flag<<std::endl;\n    return false;\n    }\n\n  vtkIntArray* numberOfPointsArray =\n    this->GetArray<vtkIntArray>(node, \"NumberOfPoints\");\n  if (!numberOfPointsArray)\n    {\n    std::cerr<<\"Expected ''NumberOfPoints'' array on the node point data.\"\n      <<std::endl<<\"Cannot proceed.\"<<std::endl;\n    return false;\n    }\n\n  \/\/ Create  the table. Each column has only one value per vessel\n  \/\/ instead of one value per each point of the vessel.\n  vtkNew<vtkTable> table;\n  for(std::vector<vtkDoubleArray*>::iterator it = metricArrays.begin();\n    it != metricArrays.end(); ++it)\n    {\n    vtkNew<vtkDoubleArray> newArray;\n    newArray->SetName((*it)->GetName());\n\n    for (int j = 0; j < numberOfPointsArray->GetNumberOfTuples(); j += numberOfPointsArray->GetValue(j))\n      {\n      newArray->InsertNextValue((*it)->GetValue(j));\n      }\n\n    table->AddColumn(newArray.GetPointer());\n    }\n\n  \/\/ Write out the table to file\n  vtkNew<vtkDelimitedTextWriter> writer;\n  writer->SetFileName(filename);\n\n#if (VTK_MAJOR_VERSION < 6)\n  writer->SetInput(table.GetPointer());\n#else\n  writer->SetInputData(table.GetPointer());\n#endif\n\n  return writer->Write();\n}\n<commit_msg>Fix crash after saving CSV for 2nd time<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\n#include \"vtkSlicerTortuosityLogic.h\"\n\n\/\/ ITK includes\n#include \"itkVesselTubeSpatialObject.h\"\n#include \"itktubeTortuositySpatialObjectFilter.h\"\n\n\/\/ Spatial object includes\n#include \"vtkMRMLSpatialObjectsNode.h\"\n\n\/\/ VTK includes\n#include \"vtkObjectFactory.h\"\n#include \"vtkDelimitedTextWriter.h\"\n#include \"vtkDoubleArray.h\"\n#include \"vtkIntArray.h\"\n#include \"vtkMath.h\"\n#include \"vtkNew.h\"\n#include \"vtkPointData.h\"\n#include \"vtkPolyData.h\"\n#include \"vtkTable.h\"\n\n#include <math.h>\n\nvtkStandardNewMacro(vtkSlicerTortuosityLogic);\n\n\/\/------------------------------------------------------------------------------\nvtkSlicerTortuosityLogic::vtkSlicerTortuosityLogic( void )\n{\n  this->FlagToArrayNames[DistanceMetric] = \"DistanceMetric\";\n  this->FlagToArrayNames[InflectionCountMetric] = \"InflectionCountMetric\";\n  this->FlagToArrayNames[InflectionPoints] = \"InflectionPoints\";\n  this->FlagToArrayNames[SumOfAnglesMetric] = \"SumOfAnglesMetric\";\n}\n\n\/\/------------------------------------------------------------------------------\nvtkSlicerTortuosityLogic::~vtkSlicerTortuosityLogic( void )\n{\n}\n\n\/\/------------------------------------------------------------------------------\nvoid vtkSlicerTortuosityLogic::PrintSelf(ostream& os, vtkIndent indent)\n{\n}\n\n\/\/------------------------------------------------------------------------------\nbool vtkSlicerTortuosityLogic::UniqueMeasure(int flag)\n{\n  return flag == vtkSlicerTortuosityLogic::DistanceMetric ||\n    flag == vtkSlicerTortuosityLogic::InflectionCountMetric ||\n    flag == vtkSlicerTortuosityLogic::InflectionPoints ||\n    flag == vtkSlicerTortuosityLogic::SumOfAnglesMetric;\n}\n\n\/\/------------------------------------------------------------------------------\nvtkDoubleArray* vtkSlicerTortuosityLogic\n::GetDistanceMetricArray(vtkMRMLSpatialObjectsNode* node, int flag)\n{\n  return this->GetOrCreateArray(\n    node, flag & vtkSlicerTortuosityLogic::DistanceMetric);\n}\n\n\/\/------------------------------------------------------------------------------\nvtkDoubleArray* vtkSlicerTortuosityLogic\n::GetInflectionCountMetricArray(vtkMRMLSpatialObjectsNode* node, int flag)\n{\n  return this->GetOrCreateArray(\n    node, flag & vtkSlicerTortuosityLogic::InflectionCountMetric);\n}\n\n\/\/------------------------------------------------------------------------------\nvtkDoubleArray* vtkSlicerTortuosityLogic\n::GetInflectionPointsArray(vtkMRMLSpatialObjectsNode* node, int flag)\n{\n  return this->GetOrCreateArray(\n    node, flag & vtkSlicerTortuosityLogic::InflectionPoints);\n}\n\n\/\/------------------------------------------------------------------------------\nvtkDoubleArray* vtkSlicerTortuosityLogic\n::GetSumOfAnglesMetricArray(vtkMRMLSpatialObjectsNode* node, int flag)\n{\n  return this->GetOrCreateArray(\n    node, flag & vtkSlicerTortuosityLogic::SumOfAnglesMetric);\n}\n\n\/\/------------------------------------------------------------------------------\nvtkDoubleArray* vtkSlicerTortuosityLogic\n::GetOrCreateArray(vtkMRMLSpatialObjectsNode* node, int flag)\n{\n  if (!flag || !this->UniqueMeasure(flag))\n    {\n    return NULL;\n    }\n\n  std::string name = this->FlagToArrayNames[flag];\n  vtkDoubleArray* metricArray =\n    this->GetOrCreateArray<vtkDoubleArray>(node, name.c_str());\n  if (!metricArray)\n    {\n    return NULL;\n    }\n\n  \/\/ If it's new, make it the correct size\n  vtkDoubleArray* ids = this->GetArray<vtkDoubleArray>(node, \"TubeIDs\");\n  assert(ids);\n  if (metricArray->GetSize() != ids->GetSize());\n    {\n    metricArray->SetNumberOfValues(ids->GetSize());\n    }\n  return metricArray;\n}\n\n\/\/------------------------------------------------------------------------------\ntemplate<typename T> T* vtkSlicerTortuosityLogic\n::GetArray(vtkMRMLSpatialObjectsNode* node, const char* name)\n{\n  vtkPolyData* polydata = node->GetPolyData();\n  if (!polydata)\n    {\n    return NULL;\n    }\n  vtkPointData* pointData = polydata->GetPointData();\n  if (!pointData)\n    {\n    return NULL;\n    }\n\n  return T::SafeDownCast(pointData->GetArray(name));\n}\n\n\/\/------------------------------------------------------------------------------\ntemplate<typename T> T* vtkSlicerTortuosityLogic\n::GetOrCreateArray(vtkMRMLSpatialObjectsNode* node, const char* name)\n{\n  T* metricArray = this->GetArray<T>(node, name);\n  if (!metricArray)\n    {\n    vtkPolyData* polydata = node->GetPolyData();\n    if (!polydata)\n      {\n      return NULL;\n      }\n    vtkPointData* pointData = polydata->GetPointData();\n    if (!pointData)\n      {\n      return NULL;\n      }\n\n    vtkNew<T> newMetricArray;\n    newMetricArray->SetName(name);\n    pointData->AddArray(newMetricArray.GetPointer());\n    return newMetricArray.GetPointer();\n    }\n  return metricArray;\n}\n\n\/\/------------------------------------------------------------------------------\nbool vtkSlicerTortuosityLogic\n::RunDistanceMetric(vtkMRMLSpatialObjectsNode* node)\n{\n  return this->RunMetrics(\n    node, vtkSlicerTortuosityLogic::DistanceMetric);\n}\n\n\/\/------------------------------------------------------------------------------\nbool vtkSlicerTortuosityLogic\n::RunInflectionCountMetric(vtkMRMLSpatialObjectsNode* node)\n{\n  return this->RunMetrics(\n    node, vtkSlicerTortuosityLogic::InflectionCountMetric);\n}\n\n\/\/------------------------------------------------------------------------------\nbool vtkSlicerTortuosityLogic\n::RunInflectionPoints(vtkMRMLSpatialObjectsNode* node)\n{\n  return this->RunMetrics(\n    node, vtkSlicerTortuosityLogic::InflectionPoints);\n}\n\n\/\/------------------------------------------------------------------------------\nbool vtkSlicerTortuosityLogic\n::RunSumOfAnglesMetric(vtkMRMLSpatialObjectsNode* node)\n{\n  return this->RunMetrics(\n    node, vtkSlicerTortuosityLogic::SumOfAnglesMetric);\n}\n\n\/\/------------------------------------------------------------------------------\nbool vtkSlicerTortuosityLogic\n::RunMetrics(vtkMRMLSpatialObjectsNode* node, int flag)\n{\n  if (!node)\n    {\n    return false;\n    }\n\n  \/\/ 1 - Get the metric arrays\n  vtkDoubleArray* dm = this->GetDistanceMetricArray(node, flag);\n  vtkDoubleArray* icm = this->GetInflectionCountMetricArray(node, flag);\n  vtkDoubleArray* ip = this->GetInflectionPointsArray(node, flag);\n  vtkDoubleArray* soam = this->GetSumOfAnglesMetricArray(node, flag);\n\n  if (!dm && !icm && !ip && !soam)\n    {\n    std::cerr<<\"Tortuosity flag mode unknown.\"<<std::endl;\n    return false;\n    }\n\n  \/\/ Rewrite number of points array everytime\n  vtkIntArray* nop = this->GetOrCreateArray<vtkIntArray>(node, \"NumberOfPoints\");\n  nop->Initialize();\n\n  \/\/ 2 - Fill the metric arrays\n  typedef vtkMRMLSpatialObjectsNode::TubeNetType                    TubeNetType;\n  typedef itk::VesselTubeSpatialObject<3>                           VesselTubeType;\n  typedef itk::tube::TortuositySpatialObjectFilter<VesselTubeType>  FilterType;\n\n  TubeNetType* spatialObject = node->GetSpatialObject();\n\n  char childName[] = \"Tube\";\n  TubeNetType::ChildrenListType* tubeList =\n    spatialObject->GetChildren(spatialObject->GetMaximumDepth(), childName);\n\n  size_t totalNumberOfPointsAdded = 0;\n  for(TubeNetType::ChildrenListType::iterator tubeIt = tubeList->begin();\n        tubeIt != tubeList->end(); ++tubeIt)\n    {\n    VesselTubeType* currTube =\n      dynamic_cast<VesselTubeType*>((*tubeIt).GetPointer());\n    if (!currTube)\n      {\n      continue;\n      }\n\n    if (currTube->GetNumberOfPoints() < 2)\n      {\n      std::cerr<<\"Error, vessel #\"<<currTube->GetId()\n        <<\" has less than 2 points !\"<<std::endl\n        <<\"Skipping the vessel.\"<<std::endl;\n      continue;\n      }\n\n    \/\/ Update filter\n    FilterType::Pointer filter = FilterType::New();\n    filter->SetMeasureFlag(flag);\n    filter->SetInput(currTube);\n    filter->Update();\n\n    if (filter->GetOutput()->GetId() != currTube->GetId())\n      {\n      std::cerr<<\"Error while running filter on tube.\"<<std::endl;\n      return false;\n      }\n\n    \/\/ Fill the arrays\n    size_t numberOfPoints = currTube->GetPoints().size();\n    for(size_t filterIndex = 0, tubeIndex = totalNumberOfPointsAdded;\n      filterIndex < numberOfPoints; ++filterIndex, ++tubeIndex)\n      {\n      if (dm)\n        {\n        dm->SetValue(tubeIndex, filter->GetDistanceMetric());\n        }\n      if (icm)\n        {\n        icm->SetValue(tubeIndex, filter->GetInflectionCountMetric());\n        }\n      if (soam)\n        {\n        soam->SetValue(tubeIndex, filter->GetSumOfAnglesMetric());\n        }\n      if (ip)\n        {\n        ip->SetValue(tubeIndex, filter->GetInflectionPointValue(filterIndex));\n        }\n\n      nop->InsertNextValue(numberOfPoints);\n      }\n\n    totalNumberOfPointsAdded += numberOfPoints;\n    }\n\n  return true;\n}\n\n\/\/------------------------------------------------------------------------------\nstd::vector<std::string> vtkSlicerTortuosityLogic::GetNamesFromFlag(int flag)\n{\n  std::vector<std::string> names;\n  for (int compareFlag = vtkSlicerTortuosityLogic::DistanceMetric;\n    compareFlag <= vtkSlicerTortuosityLogic::SumOfAnglesMetric;\n    compareFlag = compareFlag << 1)\n    {\n    if (flag & compareFlag)\n      {\n      names.push_back(this->FlagToArrayNames[compareFlag]);\n      }\n    }\n  return names;\n}\n\n\/\/------------------------------------------------------------------------------\nbool vtkSlicerTortuosityLogic\n::SaveAsCSV(vtkMRMLSpatialObjectsNode* node, const char* filename, int flag)\n{\n  if (!node || !filename)\n    {\n    return false;\n    }\n\n  \/\/ Get the metric arrays\n  std::vector<vtkDoubleArray*> metricArrays;\n  std::vector<std::string> names = this->GetNamesFromFlag(flag);\n  for (std::vector<std::string>::iterator it = names.begin();\n    it != names.end(); ++it)\n    {\n    vtkDoubleArray* metricArray =\n      this->GetArray<vtkDoubleArray>(node, it->c_str());\n    if (metricArray)\n      {\n      metricArrays.push_back(metricArray);\n      }\n    }\n\n  \/\/ Make sure we have everything we need for export\n  if (metricArrays.size() <= 0)\n    {\n    std::cout<<\"No array found for given flag: \"<<flag<<std::endl;\n    return false;\n    }\n\n  vtkIntArray* numberOfPointsArray =\n    this->GetArray<vtkIntArray>(node, \"NumberOfPoints\");\n  if (!numberOfPointsArray)\n    {\n    std::cerr<<\"Expected ''NumberOfPoints'' array on the node point data.\"\n      <<std::endl<<\"Cannot proceed.\"<<std::endl;\n    return false;\n    }\n\n  \/\/ Create  the table. Each column has only one value per vessel\n  \/\/ instead of one value per each point of the vessel.\n  vtkNew<vtkTable> table;\n  for(std::vector<vtkDoubleArray*>::iterator it = metricArrays.begin();\n    it != metricArrays.end(); ++it)\n    {\n    vtkNew<vtkDoubleArray> newArray;\n    newArray->SetName((*it)->GetName());\n\n    for (int j = 0; j < numberOfPointsArray->GetNumberOfTuples(); j += numberOfPointsArray->GetValue(j))\n      {\n      newArray->InsertNextValue((*it)->GetValue(j));\n      }\n\n    table->AddColumn(newArray.GetPointer());\n    }\n\n  \/\/ Write out the table to file\n  vtkNew<vtkDelimitedTextWriter> writer;\n  writer->SetFileName(filename);\n\n#if (VTK_MAJOR_VERSION < 6)\n  writer->SetInput(table.GetPointer());\n#else\n  writer->SetInputData(table.GetPointer());\n#endif\n\n  return writer->Write();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkBitArray.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 \"vtkBitArray.h\"\n#include \"vtkObjectFactory.h\"\n\nvtkCxxRevisionMacro(vtkBitArray, \"1.58\");\nvtkStandardNewMacro(vtkBitArray);\n\n\/\/ Instantiate object.\nvtkBitArray::vtkBitArray(vtkIdType numComp)\n{\n  this->NumberOfComponents = (numComp < 1 ? 1 : numComp);\n  this->Array = NULL;\n  this->TupleSize = 3;\n  this->Tuple = new double[this->TupleSize]; \/\/used for conversion\n  this->SaveUserArray = 0;\n}\n\nvtkBitArray::~vtkBitArray()\n{\n  if ((this->Array) && (!this->SaveUserArray))\n    {\n    delete [] this->Array;\n    }\n  delete [] this->Tuple;\n}\n\nunsigned char *vtkBitArray::WritePointer(vtkIdType id, vtkIdType number)\n{\n  vtkIdType newSize=id+number;\n  if ( newSize > this->Size )\n    {\n    this->ResizeAndExtend(newSize);\n    }\n  if ( (--newSize) > this->MaxId )\n    {\n    this->MaxId = newSize;\n    }\n  return this->Array + id\/8;\n}\n\n\/\/ This method lets the user specify data to be held by the array.  The \n\/\/ array argument is a pointer to the data.  size is the size of \n\/\/ the array supplied by the user.  Set save to 1 to keep the class\n\/\/ from deleting the array when it cleans up or reallocates memory.\n\/\/ The class uses the actual array provided; it does not copy the data \n\/\/ from the suppled array.\nvoid vtkBitArray::SetArray(unsigned char* array, vtkIdType size, int save)\n{\n  \n  if ((this->Array) && (!this->SaveUserArray))\n    {\n      vtkDebugMacro (<< \"Deleting the array...\");\n      delete [] this->Array;\n    }\n  else \n    {\n      vtkDebugMacro (<<\"Warning, array not deleted, but will point to new array.\");\n    }\n\n  vtkDebugMacro(<<\"Setting array to: \" << array);\n\n  this->Array = array;\n  this->Size = size;\n  this->MaxId = size-1;\n  this->SaveUserArray = save;\n}\n\n\/\/ Get the data at a particular index.\nint vtkBitArray::GetValue(vtkIdType id)\n{\n  if (this->Array[id\/8]&(0x80 >> (id%8)))\n    {\n    return 1;\n    }\n  return 0;\n}\n\n\/\/ Allocate memory for this array. Delete old storage only if necessary.\nint vtkBitArray::Allocate(vtkIdType sz, vtkIdType vtkNotUsed(ext))\n{\n  if ( sz > this->Size )\n    {\n    if (( this->Array != NULL ) && (!this->SaveUserArray))\n      {\n      delete [] this->Array;\n      }\n    this->Size = ( sz > 0 ? sz : 1);\n    if ( (this->Array = new unsigned char[(this->Size+7)\/8]) == NULL )\n      {\n      return 0;\n      }\n    this->SaveUserArray = 0;\n    }\n\n  this->MaxId = -1;\n\n  return 1;\n}\n\n\/\/ Release storage and reset array to initial state.\nvoid vtkBitArray::Initialize()\n{\n  if (( this->Array != NULL ) && (!this->SaveUserArray))\n    {\n    delete [] this->Array;\n    }\n  this->Array = NULL;\n  this->Size = 0;\n  this->MaxId = -1;\n  this->SaveUserArray = 0;\n}\n\n\/\/ Deep copy of another bit array.\nvoid vtkBitArray::DeepCopy(vtkDataArray *ia)\n{\n  \/\/ Do nothing on a NULL input.\n  if (ia == NULL)\n    {\n    return;\n    }\n\n  if (ia->GetDataType() != VTK_BIT)\n    {\n    vtkDataArray::DeepCopy(ia);\n    return;\n    }\n\n  if ( this != ia )\n    {\n    if ((this->Array) && (!this->SaveUserArray))\n      {\n      delete [] this->Array;\n      }\n\n    this->NumberOfComponents = ia->GetNumberOfComponents();\n    this->MaxId = ia->GetMaxId();\n    this->Size = ia->GetSize();\n    this->SaveUserArray = 0;\n\n    this->Array = new unsigned char[(this->Size+7)\/8];\n    memcpy(this->Array, (unsigned char*)ia->GetVoidPointer(0),\n           ((this->Size+7)\/8)*sizeof(unsigned char));\n    }\n}\n\nvoid vtkBitArray::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os,indent);\n\n  if (this->Array)\n    {\n    os << indent << \"Array: \" << this->Array << \"\\n\";\n    }\n  else\n    {\n    os << indent << \"Array: (null)\\n\";\n    }\n}\n\n\/\/\n\/\/ Private function does \"reallocate\". Sz is the number of \"bits\", and we\n\/\/ can allocate only 8-bit bytes.\nunsigned char *vtkBitArray::ResizeAndExtend(vtkIdType sz)\n{\n  unsigned char *newArray;\n  vtkIdType newSize;\n\n  if ( sz > this->Size ) \n    {\n    newSize = this->Size + sz;\n    }\n  else if (sz == this->Size)\n    {\n    return this->Array;\n    }\n  else \n    {\n    newSize = sz;\n    }\n\n  if (newSize <= 0)\n    {\n    this->Initialize();\n    return 0;\n    }\n\n  if ( (newArray = new unsigned char[(newSize+7)\/8]) == NULL )\n    {\n    vtkErrorMacro(<< \"Cannot allocate memory\\n\");\n    return 0;\n    }\n\n  if (this->Array)\n    {\n    int usedSize = (sz < this->Size) ? sz : this->Size;\n\n    memcpy(newArray, this->Array, \n         ((usedSize+7)\/8)*sizeof(unsigned char));\n    if (!this->SaveUserArray)\n      {\n        delete[] this->Array;\n      }\n    }\n\n  if (newSize < this->Size)\n    {\n    this->MaxId = newSize-1;\n    }\n  this->Size = newSize;\n  this->Array = newArray;\n  this->SaveUserArray = 0;\n\n  return this->Array;\n}\n\nvoid vtkBitArray::Resize(vtkIdType sz)\n{\n  unsigned char *newArray;\n  vtkIdType newSize = sz*this->NumberOfComponents;\n\n  if (newSize == this->Size)\n    {\n    return;\n    }\n\n  if (newSize <= 0)\n    {\n    this->Initialize();\n    return;\n    }\n\n  if ( (newArray = new unsigned char[(newSize+7)\/8]) == NULL )\n    {\n    vtkErrorMacro(<< \"Cannot allocate memory\\n\");\n    return;\n    }\n\n  if (this->Array)\n    {\n    int usedSize = (newSize < this->Size) ? newSize : this->Size;\n\n    memcpy(newArray, this->Array, \n         ((usedSize+7)\/8)*sizeof(unsigned char));\n    if (!this->SaveUserArray)\n      {\n        delete[] this->Array;\n      }\n    }\n\n  if (newSize < this->Size)\n    {\n    this->MaxId = newSize-1;\n    }\n  this->Size = newSize;\n  this->Array = newArray;\n  this->SaveUserArray = 0;\n\n  return;\n}\n\n\/\/ Set the number of n-tuples in the array.\nvoid vtkBitArray::SetNumberOfTuples(vtkIdType number)\n{\n  this->SetNumberOfValues(number*this->NumberOfComponents);\n}\n\n\/\/ Get a pointer to a tuple at the ith location. This is a dangerous method\n\/\/ (it is not thread safe since a pointer is returned).\ndouble *vtkBitArray::GetTuple(vtkIdType i)\n{\n  if ( this->TupleSize < this->NumberOfComponents )\n    {\n    this->TupleSize = this->NumberOfComponents;\n    delete [] this->Tuple;\n    this->Tuple = new double[this->TupleSize];\n    }\n\n  int loc = this->NumberOfComponents*i;\n  for (int j=0; j<this->NumberOfComponents; j++)\n    {\n    this->Tuple[j] = (double)this->GetValue(loc+j);\n    }\n\n  return this->Tuple;\n}\n\n\/\/ Copy the tuple value into a user-provided array.\nvoid vtkBitArray::GetTuple(vtkIdType i, double * tuple)\n{\n  vtkIdType loc = this->NumberOfComponents*i;\n\n  for (int j=0; j<this->NumberOfComponents; j++)\n    {\n    tuple[j] = (double)this->GetValue(loc+j);\n    }\n}\n\n\/\/ Set the tuple value at the ith location in the array.\nvoid vtkBitArray::SetTuple(vtkIdType i, const float * tuple)\n{\n  vtkIdType loc = i * this->NumberOfComponents; \n\n  for (int j=0; j<this->NumberOfComponents; j++)\n    {\n    this->SetValue(loc+j,(int)tuple[j]);\n    }\n}\n\nvoid vtkBitArray::SetTuple(vtkIdType i, const double * tuple)\n{\n  vtkIdType loc = i * this->NumberOfComponents; \n\n  for (int j=0; j<this->NumberOfComponents; j++)\n    {\n    this->SetValue(loc+j,(int)tuple[j]);\n    }\n}\n\n\/\/ Insert (memory allocation performed) the tuple into the ith location\n\/\/ in the array.\nvoid vtkBitArray::InsertTuple(vtkIdType i, const float * tuple)\n{\n  vtkIdType loc = this->NumberOfComponents*i;\n\n  for (int j=0; j<this->NumberOfComponents; j++)\n    {\n    this->InsertValue(loc+j,(int)tuple[j]);\n    }\n}\n\nvoid vtkBitArray::InsertTuple(vtkIdType i, const double * tuple)\n{\n  vtkIdType loc = this->NumberOfComponents*i;\n\n  for (int j=0; j<this->NumberOfComponents; j++)\n    {\n    this->InsertValue(loc+j,(int)tuple[j]);\n    }\n}\n\n\/\/ Insert (memory allocation performed) the tuple onto the end of the array.\nvtkIdType vtkBitArray::InsertNextTuple(const float * tuple)\n{\n  for (int i=0; i<this->NumberOfComponents; i++)\n    {\n    this->InsertNextValue((int)tuple[i]);\n    }\n\n  return this->MaxId \/ this->NumberOfComponents;\n}\n\nvtkIdType vtkBitArray::InsertNextTuple(const double * tuple)\n{\n  for (int i=0; i<this->NumberOfComponents; i++)\n    {\n    this->InsertNextValue((int)tuple[i]);\n    }\n\n  return this->MaxId \/ this->NumberOfComponents;\n}\n\n\nvoid vtkBitArray::InsertComponent(vtkIdType i, int j, double c)\n{\n  this->InsertValue(i*this->NumberOfComponents + j, \n                    static_cast<int>(c));\n}\n\n\/\/ Set the data component at the ith tuple and jth component location.\n\/\/ Note that i<NumberOfTuples and j<NumberOfComponents. Make sure enough\n\/\/ memory has been allocated (use SetNumberOfTuples() and \n\/\/ SetNumberOfComponents()).\nvoid vtkBitArray::SetComponent(vtkIdType i, int j, double c)\n{\n  this->SetValue(i*this->NumberOfComponents + j, static_cast<int>(c));\n}\n<commit_msg>BUG: vtkDataArray::DeepCopy does not properly convert to bit arrays, so do not call the superclass to do the copy.<commit_after>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkBitArray.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 \"vtkBitArray.h\"\n#include \"vtkObjectFactory.h\"\n\nvtkCxxRevisionMacro(vtkBitArray, \"1.59\");\nvtkStandardNewMacro(vtkBitArray);\n\n\/\/ Instantiate object.\nvtkBitArray::vtkBitArray(vtkIdType numComp)\n{\n  this->NumberOfComponents = (numComp < 1 ? 1 : numComp);\n  this->Array = NULL;\n  this->TupleSize = 3;\n  this->Tuple = new double[this->TupleSize]; \/\/used for conversion\n  this->SaveUserArray = 0;\n}\n\nvtkBitArray::~vtkBitArray()\n{\n  if ((this->Array) && (!this->SaveUserArray))\n    {\n    delete [] this->Array;\n    }\n  delete [] this->Tuple;\n}\n\nunsigned char *vtkBitArray::WritePointer(vtkIdType id, vtkIdType number)\n{\n  vtkIdType newSize=id+number;\n  if ( newSize > this->Size )\n    {\n    this->ResizeAndExtend(newSize);\n    }\n  if ( (--newSize) > this->MaxId )\n    {\n    this->MaxId = newSize;\n    }\n  return this->Array + id\/8;\n}\n\n\/\/ This method lets the user specify data to be held by the array.  The \n\/\/ array argument is a pointer to the data.  size is the size of \n\/\/ the array supplied by the user.  Set save to 1 to keep the class\n\/\/ from deleting the array when it cleans up or reallocates memory.\n\/\/ The class uses the actual array provided; it does not copy the data \n\/\/ from the suppled array.\nvoid vtkBitArray::SetArray(unsigned char* array, vtkIdType size, int save)\n{\n  \n  if ((this->Array) && (!this->SaveUserArray))\n    {\n      vtkDebugMacro (<< \"Deleting the array...\");\n      delete [] this->Array;\n    }\n  else \n    {\n      vtkDebugMacro (<<\"Warning, array not deleted, but will point to new array.\");\n    }\n\n  vtkDebugMacro(<<\"Setting array to: \" << array);\n\n  this->Array = array;\n  this->Size = size;\n  this->MaxId = size-1;\n  this->SaveUserArray = save;\n}\n\n\/\/ Get the data at a particular index.\nint vtkBitArray::GetValue(vtkIdType id)\n{\n  if (this->Array[id\/8]&(0x80 >> (id%8)))\n    {\n    return 1;\n    }\n  return 0;\n}\n\n\/\/ Allocate memory for this array. Delete old storage only if necessary.\nint vtkBitArray::Allocate(vtkIdType sz, vtkIdType vtkNotUsed(ext))\n{\n  if ( sz > this->Size )\n    {\n    if (( this->Array != NULL ) && (!this->SaveUserArray))\n      {\n      delete [] this->Array;\n      }\n    this->Size = ( sz > 0 ? sz : 1);\n    if ( (this->Array = new unsigned char[(this->Size+7)\/8]) == NULL )\n      {\n      return 0;\n      }\n    this->SaveUserArray = 0;\n    }\n\n  this->MaxId = -1;\n\n  return 1;\n}\n\n\/\/ Release storage and reset array to initial state.\nvoid vtkBitArray::Initialize()\n{\n  if (( this->Array != NULL ) && (!this->SaveUserArray))\n    {\n    delete [] this->Array;\n    }\n  this->Array = NULL;\n  this->Size = 0;\n  this->MaxId = -1;\n  this->SaveUserArray = 0;\n}\n\n\/\/ Deep copy of another bit array.\nvoid vtkBitArray::DeepCopy(vtkDataArray *ia)\n{\n  \/\/ Do nothing on a NULL input.\n  if (ia == NULL)\n    {\n    return;\n    }\n\n  if (ia->GetDataType() != VTK_BIT)\n    {\n    vtkIdType numTuples = ia->GetNumberOfTuples();\n    this->NumberOfComponents = ia->GetNumberOfComponents();\n    this->SetNumberOfTuples(numTuples);\n\n    for (vtkIdType i = 0; i < numTuples; i++)\n      {\n      this->SetTuple(i, ia->GetTuple(i));\n      }\n    return;\n    }\n\n  if ( this != ia )\n    {\n    if ((this->Array) && (!this->SaveUserArray))\n      {\n      delete [] this->Array;\n      }\n\n    this->NumberOfComponents = ia->GetNumberOfComponents();\n    this->MaxId = ia->GetMaxId();\n    this->Size = ia->GetSize();\n    this->SaveUserArray = 0;\n\n    this->Array = new unsigned char[(this->Size+7)\/8];\n    memcpy(this->Array, (unsigned char*)ia->GetVoidPointer(0),\n           ((this->Size+7)\/8)*sizeof(unsigned char));\n    }\n}\n\nvoid vtkBitArray::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os,indent);\n\n  if (this->Array)\n    {\n    os << indent << \"Array: \" << this->Array << \"\\n\";\n    }\n  else\n    {\n    os << indent << \"Array: (null)\\n\";\n    }\n}\n\n\/\/\n\/\/ Private function does \"reallocate\". Sz is the number of \"bits\", and we\n\/\/ can allocate only 8-bit bytes.\nunsigned char *vtkBitArray::ResizeAndExtend(vtkIdType sz)\n{\n  unsigned char *newArray;\n  vtkIdType newSize;\n\n  if ( sz > this->Size ) \n    {\n    newSize = this->Size + sz;\n    }\n  else if (sz == this->Size)\n    {\n    return this->Array;\n    }\n  else \n    {\n    newSize = sz;\n    }\n\n  if (newSize <= 0)\n    {\n    this->Initialize();\n    return 0;\n    }\n\n  if ( (newArray = new unsigned char[(newSize+7)\/8]) == NULL )\n    {\n    vtkErrorMacro(<< \"Cannot allocate memory\\n\");\n    return 0;\n    }\n\n  if (this->Array)\n    {\n    int usedSize = (sz < this->Size) ? sz : this->Size;\n\n    memcpy(newArray, this->Array, \n         ((usedSize+7)\/8)*sizeof(unsigned char));\n    if (!this->SaveUserArray)\n      {\n        delete[] this->Array;\n      }\n    }\n\n  if (newSize < this->Size)\n    {\n    this->MaxId = newSize-1;\n    }\n  this->Size = newSize;\n  this->Array = newArray;\n  this->SaveUserArray = 0;\n\n  return this->Array;\n}\n\nvoid vtkBitArray::Resize(vtkIdType sz)\n{\n  unsigned char *newArray;\n  vtkIdType newSize = sz*this->NumberOfComponents;\n\n  if (newSize == this->Size)\n    {\n    return;\n    }\n\n  if (newSize <= 0)\n    {\n    this->Initialize();\n    return;\n    }\n\n  if ( (newArray = new unsigned char[(newSize+7)\/8]) == NULL )\n    {\n    vtkErrorMacro(<< \"Cannot allocate memory\\n\");\n    return;\n    }\n\n  if (this->Array)\n    {\n    int usedSize = (newSize < this->Size) ? newSize : this->Size;\n\n    memcpy(newArray, this->Array, \n         ((usedSize+7)\/8)*sizeof(unsigned char));\n    if (!this->SaveUserArray)\n      {\n        delete[] this->Array;\n      }\n    }\n\n  if (newSize < this->Size)\n    {\n    this->MaxId = newSize-1;\n    }\n  this->Size = newSize;\n  this->Array = newArray;\n  this->SaveUserArray = 0;\n\n  return;\n}\n\n\/\/ Set the number of n-tuples in the array.\nvoid vtkBitArray::SetNumberOfTuples(vtkIdType number)\n{\n  this->SetNumberOfValues(number*this->NumberOfComponents);\n}\n\n\/\/ Get a pointer to a tuple at the ith location. This is a dangerous method\n\/\/ (it is not thread safe since a pointer is returned).\ndouble *vtkBitArray::GetTuple(vtkIdType i)\n{\n  if ( this->TupleSize < this->NumberOfComponents )\n    {\n    this->TupleSize = this->NumberOfComponents;\n    delete [] this->Tuple;\n    this->Tuple = new double[this->TupleSize];\n    }\n\n  int loc = this->NumberOfComponents*i;\n  for (int j=0; j<this->NumberOfComponents; j++)\n    {\n    this->Tuple[j] = (double)this->GetValue(loc+j);\n    }\n\n  return this->Tuple;\n}\n\n\/\/ Copy the tuple value into a user-provided array.\nvoid vtkBitArray::GetTuple(vtkIdType i, double * tuple)\n{\n  vtkIdType loc = this->NumberOfComponents*i;\n\n  for (int j=0; j<this->NumberOfComponents; j++)\n    {\n    tuple[j] = (double)this->GetValue(loc+j);\n    }\n}\n\n\/\/ Set the tuple value at the ith location in the array.\nvoid vtkBitArray::SetTuple(vtkIdType i, const float * tuple)\n{\n  vtkIdType loc = i * this->NumberOfComponents; \n\n  for (int j=0; j<this->NumberOfComponents; j++)\n    {\n    this->SetValue(loc+j,(int)tuple[j]);\n    }\n}\n\nvoid vtkBitArray::SetTuple(vtkIdType i, const double * tuple)\n{\n  vtkIdType loc = i * this->NumberOfComponents; \n\n  for (int j=0; j<this->NumberOfComponents; j++)\n    {\n    this->SetValue(loc+j,(int)tuple[j]);\n    }\n}\n\n\/\/ Insert (memory allocation performed) the tuple into the ith location\n\/\/ in the array.\nvoid vtkBitArray::InsertTuple(vtkIdType i, const float * tuple)\n{\n  vtkIdType loc = this->NumberOfComponents*i;\n\n  for (int j=0; j<this->NumberOfComponents; j++)\n    {\n    this->InsertValue(loc+j,(int)tuple[j]);\n    }\n}\n\nvoid vtkBitArray::InsertTuple(vtkIdType i, const double * tuple)\n{\n  vtkIdType loc = this->NumberOfComponents*i;\n\n  for (int j=0; j<this->NumberOfComponents; j++)\n    {\n    this->InsertValue(loc+j,(int)tuple[j]);\n    }\n}\n\n\/\/ Insert (memory allocation performed) the tuple onto the end of the array.\nvtkIdType vtkBitArray::InsertNextTuple(const float * tuple)\n{\n  for (int i=0; i<this->NumberOfComponents; i++)\n    {\n    this->InsertNextValue((int)tuple[i]);\n    }\n\n  return this->MaxId \/ this->NumberOfComponents;\n}\n\nvtkIdType vtkBitArray::InsertNextTuple(const double * tuple)\n{\n  for (int i=0; i<this->NumberOfComponents; i++)\n    {\n    this->InsertNextValue((int)tuple[i]);\n    }\n\n  return this->MaxId \/ this->NumberOfComponents;\n}\n\n\nvoid vtkBitArray::InsertComponent(vtkIdType i, int j, double c)\n{\n  this->InsertValue(i*this->NumberOfComponents + j, \n                    static_cast<int>(c));\n}\n\n\/\/ Set the data component at the ith tuple and jth component location.\n\/\/ Note that i<NumberOfTuples and j<NumberOfComponents. Make sure enough\n\/\/ memory has been allocated (use SetNumberOfTuples() and \n\/\/ SetNumberOfComponents()).\nvoid vtkBitArray::SetComponent(vtkIdType i, int j, double c)\n{\n  this->SetValue(i*this->NumberOfComponents + j, static_cast<int>(c));\n}\n<|endoftext|>"}
{"text":"<commit_before>    \/\/\n\/\/  Lexer.c\n\/\/  Emojicode\n\/\/\n\/\/  Created by Theo Weidmann on 28.02.15.\n\/\/  Copyright (c) 2015 Theo Weidmann. All rights reserved.\n\/\/\n\n#include \"Lexer.hpp\"\n#include \"CompilerError.hpp\"\n#include \"EmojiTokenization.hpp\"\n#include \"Emojis.h\"\n\nnamespace EmojicodeCompiler {\n\nLexer::Lexer(SourceFile *source) : sourcePosition_(1, 0, source), source_(source) {\n    skipWhitespace();\n\n    loadOperatorSingleTokens();\n    singleTokens_.emplace(E_RED_EXCLAMATION_MARK, TokenType::EndArgumentList);\n    singleTokens_.emplace(E_RED_QUESTION_MARK, TokenType::EndInterrogativeArgumentList);\n    singleTokens_.emplace(E_RIGHT_FACING_FIST, TokenType::GroupBegin);\n    singleTokens_.emplace(E_LEFT_FACING_FIST, TokenType::GroupEnd);\n    singleTokens_.emplace(E_RIGHT_ARROW_CURVING_LEFT, TokenType::Return);\n    singleTokens_.emplace(E_CLOCKWISE_RIGHTWARDS_AND_LEFTWARDS_OPEN_CIRCLE_ARROWS, TokenType::RepeatWhile);\n    singleTokens_.emplace(E_CLOCKWISE_RIGHTWARDS_AND_LEFTWARDS_OPEN_CIRCLE_ARROWS_WITH_CIRCLED_ONE_OVERLAY,\n                          TokenType::ForIn);\n    singleTokens_.emplace(E_THUMBS_UP_SIGN, TokenType::BooleanTrue);\n    singleTokens_.emplace(E_THUMBS_DOWN_SIGN, TokenType::BooleanFalse);\n    singleTokens_.emplace(E_POLICE_CARS_LIGHT, TokenType::Error);\n    singleTokens_.emplace(E_LEFT_ARROW_CURVING_RIGHT, TokenType::If);\n    singleTokens_.emplace(E_AVOCADO, TokenType::ErrorHandler);\n    singleTokens_.emplace(E_GRAPES, TokenType::BlockBegin);\n    singleTokens_.emplace(E_WATERMELON, TokenType::BlockEnd);\n    singleTokens_.emplace(E_NEW_SIGN, TokenType::New);\n    singleTokens_.emplace(E_DOG, TokenType::This);\n    singleTokens_.emplace(E_BIOHAZARD, TokenType::Unsafe);\n    singleTokens_.emplace(E_RIGHT_ARROW_CURVING_UP, TokenType::Super);\n    singleTokens_.emplace(E_RIGHTWARDS_ARROW, TokenType::RightProductionOperator);\n    singleTokens_.emplace(E_LEFTWARDS_ARROW, TokenType::LeftProductionOperator);\n    singleTokens_.emplace(E_CRAYON, TokenType::Mutable);\n\n    singleTokens_.emplace(E_CROCODILE, TokenType::Protocol);\n    singleTokens_.emplace(E_DOVE_OF_PEACE, TokenType::ValueType);\n    singleTokens_.emplace(E_RABBIT, TokenType::Class);\n    singleTokens_.emplace(E_TURKEY, TokenType::Enumeration);\n}\n\nvoid Lexer::loadOperatorSingleTokens() {\n    singleTokens_.emplace(E_HEAVY_PLUS_SIGN, TokenType::Operator);\n    singleTokens_.emplace(E_HEAVY_MINUS_SIGN, TokenType::Operator);\n    singleTokens_.emplace(E_HEAVY_DIVISION_SIGN, TokenType::Operator);\n    singleTokens_.emplace(E_HEAVY_MULTIPLICATION_SIGN, TokenType::Operator);\n    singleTokens_.emplace(E_OPEN_HANDS, TokenType::Operator);\n    singleTokens_.emplace(E_HANDSHAKE, TokenType::Operator);\n    singleTokens_.emplace(E_HEAVY_LARGE_CIRCLE, TokenType::Operator);\n    singleTokens_.emplace(E_ANGER_SYMBOL, TokenType::Operator);\n    singleTokens_.emplace(E_CROSS_MARK, TokenType::Operator);\n    singleTokens_.emplace(E_LEFT_POINTING_BACKHAND_INDEX, TokenType::Operator);\n    singleTokens_.emplace(E_RIGHT_POINTING_BACKHAND_INDEX, TokenType::Operator);\n    singleTokens_.emplace(E_PUT_LITTER_IN_ITS_SPACE, TokenType::Operator);\n    singleTokens_.emplace(E_HANDS_RAISED_IN_CELEBRATION, TokenType::Operator);\n    singleTokens_.emplace(E_FACE_WITH_STUCK_OUT_TONGUE_AND_WINKING_EYE, TokenType::Operator);\n    singleTokens_.emplace(E_RED_EXCLAMATION_MARK_AND_QUESTION_MARK, TokenType::Call);\n}\n\nvoid Lexer::skipWhitespace() {\n    while (continue_ && detectWhitespace()) {\n        nextCharOrEnd();\n    }\n}\n\nbool Lexer::detectWhitespace() {\n    if (isNewline()) {\n        sourcePosition_.character = 0;\n        sourcePosition_.line++;\n        source_->endLine(i_ + 1);\n        return false;\n    }\n    return isWhitespace();\n}\n\nvoid Lexer::nextChar() {\n    if (!hasMoreChars()) {\n        throw CompilerError(sourcePosition_, \"Unexpected end of file.\");\n    }\n    i_++;\n    sourcePosition_.character++;\n}\n\nvoid Lexer::nextCharOrEnd() {\n    if (hasMoreChars()) {\n        nextChar();\n    }\n    else {\n        continue_ = false;\n    }\n}\n\nToken Lexer::lex() {\n    auto token = readToken();\n    skipWhitespace();\n    return token;\n}\n\nToken Lexer::readToken() {\n    Token token(sourcePosition_);\n    TokenConstructionState constState;\n\n    TokenState state = beginToken(&token, &constState) ? TokenState::Continues : TokenState::Ended;\n    while (true) {\n        if (state == TokenState::Ended) {\n            token.validate();\n            nextCharOrEnd();\n            return token;\n        }\n        nextChar();\n        state = continueToken(&token, &constState);\n        if (state == TokenState::NextBegun) {\n            token.validate();\n            return token;\n        }\n        \/\/ Whitespace must be detected here so that this method returns on NextBegun without calling detectWhitespace()\n        \/\/ as the detectWhitespace() would otherwise be called twice for the same character. (Here and in lex())\n        detectWhitespace();\n    }\n}\n\nbool Lexer::beginToken(Token *token, TokenConstructionState *constState) const {\n    auto it = singleTokens_.find(codePoint());\n    if (it != singleTokens_.end()) {\n        token->type_ = it->second;\n        token->value_.push_back(codePoint());\n        return false;\n    }\n\n    switch (codePoint()) {\n        case E_INPUT_SYMBOL_LATIN_LETTERS:\n            token->type_ = TokenType::String;\n            return true;\n        case E_THOUGHT_BALLOON:\n            token->type_ = TokenType::SinglelineComment;\n            return true;\n        case E_GREEN_TEXTBOOK:\n            token->type_ = TokenType::DocumentationComment;\n            return true;\n        case E_BLUE_TEXTBOOK:\n            token->type_ = TokenType::PackageDocumentationComment;\n            return true;\n        case E_KEYCAP_10:\n            token->type_ = TokenType::Symbol;\n            return true;\n        case E_LEFT_POINTING_TRIANGLE:\n        case E_RIGHT_POINTING_TRIANGLE:\n            token->type_ = TokenType::Operator;\n            token->value_.push_back(codePoint());\n            return true;\n        default:\n            break;\n    }\n\n    if (isNewline()) {\n        token->type_ = TokenType::LineBreak;\n        return hasMoreChars();\n    }\n\n    if (('0' <= codePoint() && codePoint() <= '9') || codePoint() == '-' || codePoint() == '+') {\n        token->type_ = TokenType::Integer;\n        constState->isHex_ = false;\n    }\n    else if (isEmoji(codePoint())) {\n        token->type_ = TokenType::Identifier;\n    }\n    else {\n        token->type_ = TokenType::Variable;\n    }\n    token->value_.push_back(codePoint());\n    return true;\n}\n\nLexer::TokenState Lexer::continueToken(Token *token, TokenConstructionState *constState) const {\n    switch (token->type()) {\n        case TokenType::Identifier:\n            return continueIdentifierToken(token, constState);\n        case TokenType::Operator:\n            return continueOperator(token);\n        case TokenType::SinglelineComment:\n            return continueSingleLineToken(token, constState);\n        case TokenType::MultilineComment:\n            return continueMultilineComment(token, constState);\n        case TokenType::DocumentationComment:\n            if (codePoint() == E_GREEN_TEXTBOOK) {\n                return TokenState::Ended;\n            }\n            token->value_.push_back(codePoint());\n            return TokenState::Continues;\n        case TokenType::PackageDocumentationComment:\n            if (codePoint() == E_BLUE_TEXTBOOK) {\n                return TokenState::Ended;\n            }\n            token->value_.push_back(codePoint());\n            return TokenState::Continues;\n        case TokenType::String:\n            return continueStringToken(token, constState);\n        case TokenType::Variable:\n            return continueVariableToken(token);\n        case TokenType::Integer:\n            return continueIntegerToken(token, constState);\n        case TokenType::Double:\n            return continueDoubleToken(token);\n        case TokenType::Symbol:\n            token->value_.push_back(codePoint());\n            return TokenState::Ended;\n        case TokenType::LineBreak:\n            if (isNewline()) {\n                token->type_ = TokenType::BlankLine;\n                return TokenState::Ended;\n            }\n            return isWhitespace() ? hasMoreChars() ? TokenState::Continues : TokenState::Ended : TokenState::NextBegun;\n        default:\n            throw std::logic_error(\"Lexer: Token continued but not handled.\");\n    }\n}\n\nLexer::TokenState Lexer::continueMultilineComment(Token *token, TokenConstructionState *constState) const {\n    if (!constState->commentDetermined_) {\n        if (codePoint() == E_THOUGHT_BALLOON) {\n            token->value_.pop_back();\n            return TokenState::Ended;\n        }\n        constState->commentDetermined_ = true;\n    }\n    if (codePoint() == E_END_ARROW) {\n        constState->commentDetermined_ = false;\n    }\n    token->value_.push_back(codePoint());\n    return TokenState::Continues;\n}\n\nLexer::TokenState Lexer::continueSingleLineToken(Token *token, TokenConstructionState *constState) const {\n    if (!constState->commentDetermined_) {\n        if (codePoint() == E_SOON_ARROW) {\n            token->type_ = TokenType::MultilineComment;\n            return TokenState::Continues;\n        }\n        constState->commentDetermined_ = true;\n    }\n\n    if (isNewline()) {\n        return TokenState::Ended;\n    }\n    token->value_.push_back(codePoint());\n    return TokenState::Continues;\n}\n\nLexer::TokenState Lexer::continueDoubleToken(Token *token) const {\n    if ('0' <= codePoint() && codePoint() <= '9') {\n        token->value_.push_back(codePoint());\n        return TokenState::Continues;\n    }\n    return TokenState::NextBegun;\n}\n\nLexer::TokenState Lexer::continueVariableToken(Token *token) const {\n    \/\/ A variable can consist of everything except for whitespaces and identifiers (that is emojis)\n    \/\/ isWhitespace used here because if it is whitespace, the detection will take place below\n    if (isWhitespace() || isEmoji(codePoint())) {\n        return TokenState::NextBegun;\n    }\n\n    token->value_.push_back(codePoint());\n    return TokenState::Continues;\n}\n\nLexer::TokenState Lexer::continueIntegerToken(Token *token, Lexer::TokenConstructionState *constState) const {\n    if (('0' <= codePoint() && codePoint() <= '9') ||\n        (((64 < codePoint() && codePoint() < 71) || (96 < codePoint() && codePoint() < 103)) &&\n         constState->isHex_)) {\n        token->value_.push_back(codePoint());\n        return TokenState::Continues;\n    }\n    if (codePoint() == '.') {\n        token->type_ = TokenType::Double;\n        token->value_.push_back(codePoint());\n        return TokenState::Continues;\n    }\n    if ((codePoint() == 'x' || codePoint() == 'X') && token->value_.size() == 1 && token->value_[0] == '0') {\n        constState->isHex_ = true;\n        token->value_.push_back(codePoint());\n        return TokenState::Continues;\n    }\n    if (codePoint() == ',') {\n        return TokenState::Continues;\n    }\n    return TokenState::NextBegun;\n}\n\nLexer::TokenState Lexer::continueStringToken(Token *token, Lexer::TokenConstructionState *constState) const {\n    if (constState->escapeSequence_) {\n        handleEscapeSequence(token, constState);\n        return TokenState::Continues;\n    }\n    if (codePoint() == E_CROSS_MARK) {\n        constState->escapeSequence_ = true;\n        return TokenState::Continues;\n    }\n    if (codePoint() == E_INPUT_SYMBOL_LATIN_LETTERS) {\n        return TokenState::Ended;\n    }\n\n    token->value_.push_back(codePoint());\n    return TokenState::Continues;\n}\n\nvoid Lexer::handleEscapeSequence(Token *token, Lexer::TokenConstructionState *constState) const {\n    switch (codePoint()) {\n        case E_INPUT_SYMBOL_LATIN_LETTERS:\n        case E_CROSS_MARK:\n            token->value_.push_back(codePoint());\n            break;\n        case 'n':\n            token->value_.push_back('\\n');\n            break;\n        case 't':\n            token->value_.push_back('\\t');\n            break;\n        case 'r':\n            token->value_.push_back('\\r');\n            break;\n        default: {\n            throw CompilerError(sourcePosition_, \"Unrecognized escape sequence ❌\",\n                                utf8(std::u32string(1, codePoint())), \".\");\n        }\n    }\n\n    constState->escapeSequence_ = false;\n}\n\nLexer::TokenState Lexer::continueIdentifierToken(Token *token, Lexer::TokenConstructionState *constState) const {\n    if (constState->foundZWJ_ && isEmoji(codePoint())) {\n        token->value_.push_back(codePoint());\n        constState->foundZWJ_ = false;\n        return TokenState::Continues;\n    }\n    if ((isEmojiModifier(codePoint()) && isEmojiModifierBase(token->value_.back())) ||\n        (isRegionalIndicator(codePoint()) && token->value().size() == 1 &&\n         isRegionalIndicator(token->value().front()))) {\n        token->value_.push_back(codePoint());\n        return TokenState::Continues;\n    }\n    if (codePoint() == 0x200D) {\n        token->value_.push_back(codePoint());\n        constState->foundZWJ_ = true;\n        return TokenState::Continues;\n    }\n    if (codePoint() == 0xFE0F) {  \/\/ Emojicode ignores the Emoji modifier behind an emoji character\n        return TokenState::Continues;\n    }\n    if (token->value_.front() == E_PERSON_SHRUGGING) {\n        token->type_ = TokenType::NoValue;\n    }\n    if (token->value().front() == E_NO_GESTURE) {\n        if (codePoint() == E_LEFT_ARROW_CURVING_RIGHT) {\n            token->type_ = TokenType::ElseIf;\n            return TokenState::Ended;\n        }\n        token->type_ = TokenType::Else;\n    }\n    return TokenState::NextBegun;\n}\n\nLexer::TokenState Lexer::continueOperator(Token *token) const {\n    if (codePoint() == 0xFE0F) {  \/\/ Emojicode ignores the Emoji modifier behind an emoji character\n        return TokenState::Continues;\n    }\n    if (codePoint() == E_HANDS_RAISED_IN_CELEBRATION) {\n        token->value_.push_back(codePoint());\n        return TokenState::Ended;\n    }\n    return TokenState::NextBegun;\n}\n\n}  \/\/ namespace EmojicodeCompiler\n<commit_msg>🧦 Fix bug if file does not end with new line<commit_after>    \/\/\n\/\/  Lexer.c\n\/\/  Emojicode\n\/\/\n\/\/  Created by Theo Weidmann on 28.02.15.\n\/\/  Copyright (c) 2015 Theo Weidmann. All rights reserved.\n\/\/\n\n#include \"Lexer.hpp\"\n#include \"CompilerError.hpp\"\n#include \"EmojiTokenization.hpp\"\n#include \"Emojis.h\"\n\nnamespace EmojicodeCompiler {\n\nLexer::Lexer(SourceFile *source) : sourcePosition_(1, 0, source), source_(source) {\n    skipWhitespace();\n\n    loadOperatorSingleTokens();\n    singleTokens_.emplace(E_RED_EXCLAMATION_MARK, TokenType::EndArgumentList);\n    singleTokens_.emplace(E_RED_QUESTION_MARK, TokenType::EndInterrogativeArgumentList);\n    singleTokens_.emplace(E_RIGHT_FACING_FIST, TokenType::GroupBegin);\n    singleTokens_.emplace(E_LEFT_FACING_FIST, TokenType::GroupEnd);\n    singleTokens_.emplace(E_RIGHT_ARROW_CURVING_LEFT, TokenType::Return);\n    singleTokens_.emplace(E_CLOCKWISE_RIGHTWARDS_AND_LEFTWARDS_OPEN_CIRCLE_ARROWS, TokenType::RepeatWhile);\n    singleTokens_.emplace(E_CLOCKWISE_RIGHTWARDS_AND_LEFTWARDS_OPEN_CIRCLE_ARROWS_WITH_CIRCLED_ONE_OVERLAY,\n                          TokenType::ForIn);\n    singleTokens_.emplace(E_THUMBS_UP_SIGN, TokenType::BooleanTrue);\n    singleTokens_.emplace(E_THUMBS_DOWN_SIGN, TokenType::BooleanFalse);\n    singleTokens_.emplace(E_POLICE_CARS_LIGHT, TokenType::Error);\n    singleTokens_.emplace(E_LEFT_ARROW_CURVING_RIGHT, TokenType::If);\n    singleTokens_.emplace(E_AVOCADO, TokenType::ErrorHandler);\n    singleTokens_.emplace(E_GRAPES, TokenType::BlockBegin);\n    singleTokens_.emplace(E_WATERMELON, TokenType::BlockEnd);\n    singleTokens_.emplace(E_NEW_SIGN, TokenType::New);\n    singleTokens_.emplace(E_DOG, TokenType::This);\n    singleTokens_.emplace(E_BIOHAZARD, TokenType::Unsafe);\n    singleTokens_.emplace(E_RIGHT_ARROW_CURVING_UP, TokenType::Super);\n    singleTokens_.emplace(E_RIGHTWARDS_ARROW, TokenType::RightProductionOperator);\n    singleTokens_.emplace(E_LEFTWARDS_ARROW, TokenType::LeftProductionOperator);\n    singleTokens_.emplace(E_CRAYON, TokenType::Mutable);\n\n    singleTokens_.emplace(E_CROCODILE, TokenType::Protocol);\n    singleTokens_.emplace(E_DOVE_OF_PEACE, TokenType::ValueType);\n    singleTokens_.emplace(E_RABBIT, TokenType::Class);\n    singleTokens_.emplace(E_TURKEY, TokenType::Enumeration);\n}\n\nvoid Lexer::loadOperatorSingleTokens() {\n    singleTokens_.emplace(E_HEAVY_PLUS_SIGN, TokenType::Operator);\n    singleTokens_.emplace(E_HEAVY_MINUS_SIGN, TokenType::Operator);\n    singleTokens_.emplace(E_HEAVY_DIVISION_SIGN, TokenType::Operator);\n    singleTokens_.emplace(E_HEAVY_MULTIPLICATION_SIGN, TokenType::Operator);\n    singleTokens_.emplace(E_OPEN_HANDS, TokenType::Operator);\n    singleTokens_.emplace(E_HANDSHAKE, TokenType::Operator);\n    singleTokens_.emplace(E_HEAVY_LARGE_CIRCLE, TokenType::Operator);\n    singleTokens_.emplace(E_ANGER_SYMBOL, TokenType::Operator);\n    singleTokens_.emplace(E_CROSS_MARK, TokenType::Operator);\n    singleTokens_.emplace(E_LEFT_POINTING_BACKHAND_INDEX, TokenType::Operator);\n    singleTokens_.emplace(E_RIGHT_POINTING_BACKHAND_INDEX, TokenType::Operator);\n    singleTokens_.emplace(E_PUT_LITTER_IN_ITS_SPACE, TokenType::Operator);\n    singleTokens_.emplace(E_HANDS_RAISED_IN_CELEBRATION, TokenType::Operator);\n    singleTokens_.emplace(E_FACE_WITH_STUCK_OUT_TONGUE_AND_WINKING_EYE, TokenType::Operator);\n    singleTokens_.emplace(E_RED_EXCLAMATION_MARK_AND_QUESTION_MARK, TokenType::Call);\n}\n\nvoid Lexer::skipWhitespace() {\n    while (continue_ && detectWhitespace()) {\n        nextCharOrEnd();\n    }\n}\n\nbool Lexer::detectWhitespace() {\n    if (isNewline()) {\n        sourcePosition_.character = 0;\n        sourcePosition_.line++;\n        source_->endLine(i_ + 1);\n        return false;\n    }\n    return isWhitespace();\n}\n\nvoid Lexer::nextChar() {\n    if (!hasMoreChars()) {\n        throw CompilerError(sourcePosition_, \"Unexpected end of file.\");\n    }\n    i_++;\n    sourcePosition_.character++;\n}\n\nvoid Lexer::nextCharOrEnd() {\n    if (hasMoreChars()) {\n        nextChar();\n    }\n    else {\n        continue_ = false;\n    }\n}\n\nToken Lexer::lex() {\n    auto token = readToken();\n    skipWhitespace();\n    return token;\n}\n\nToken Lexer::readToken() {\n    Token token(sourcePosition_);\n    TokenConstructionState constState;\n\n    TokenState state = beginToken(&token, &constState) ? TokenState::Continues : TokenState::Ended;\n    while (true) {\n        if (state == TokenState::Ended) {\n            token.validate();\n            nextCharOrEnd();\n            return token;\n        }\n        nextChar();\n        state = continueToken(&token, &constState);\n        if (state == TokenState::NextBegun) {\n            token.validate();\n            return token;\n        }\n        \/\/ Whitespace must be detected here so that this method returns on NextBegun without calling detectWhitespace()\n        \/\/ as the detectWhitespace() would otherwise be called twice for the same character. (Here and in lex())\n        detectWhitespace();\n    }\n}\n\nbool Lexer::beginToken(Token *token, TokenConstructionState *constState) const {\n    auto it = singleTokens_.find(codePoint());\n    if (it != singleTokens_.end()) {\n        token->type_ = it->second;\n        token->value_.push_back(codePoint());\n        return false;\n    }\n\n    switch (codePoint()) {\n        case E_INPUT_SYMBOL_LATIN_LETTERS:\n            token->type_ = TokenType::String;\n            return true;\n        case E_THOUGHT_BALLOON:\n            token->type_ = TokenType::SinglelineComment;\n            return true;\n        case E_GREEN_TEXTBOOK:\n            token->type_ = TokenType::DocumentationComment;\n            return true;\n        case E_BLUE_TEXTBOOK:\n            token->type_ = TokenType::PackageDocumentationComment;\n            return true;\n        case E_KEYCAP_10:\n            token->type_ = TokenType::Symbol;\n            return true;\n        case E_LEFT_POINTING_TRIANGLE:\n        case E_RIGHT_POINTING_TRIANGLE:\n            token->type_ = TokenType::Operator;\n            token->value_.push_back(codePoint());\n            return true;\n        default:\n            break;\n    }\n\n    if (isNewline()) {\n        token->type_ = TokenType::LineBreak;\n        return hasMoreChars();\n    }\n\n    if (('0' <= codePoint() && codePoint() <= '9') || codePoint() == '-' || codePoint() == '+') {\n        token->type_ = TokenType::Integer;\n        constState->isHex_ = false;\n    }\n    else if (isEmoji(codePoint())) {\n        token->type_ = TokenType::Identifier;\n    }\n    else {\n        token->type_ = TokenType::Variable;\n    }\n    token->value_.push_back(codePoint());\n    return hasMoreChars();\n}\n\nLexer::TokenState Lexer::continueToken(Token *token, TokenConstructionState *constState) const {\n    switch (token->type()) {\n        case TokenType::Identifier:\n            return continueIdentifierToken(token, constState);\n        case TokenType::Operator:\n            return continueOperator(token);\n        case TokenType::SinglelineComment:\n            return continueSingleLineToken(token, constState);\n        case TokenType::MultilineComment:\n            return continueMultilineComment(token, constState);\n        case TokenType::DocumentationComment:\n            if (codePoint() == E_GREEN_TEXTBOOK) {\n                return TokenState::Ended;\n            }\n            token->value_.push_back(codePoint());\n            return TokenState::Continues;\n        case TokenType::PackageDocumentationComment:\n            if (codePoint() == E_BLUE_TEXTBOOK) {\n                return TokenState::Ended;\n            }\n            token->value_.push_back(codePoint());\n            return TokenState::Continues;\n        case TokenType::String:\n            return continueStringToken(token, constState);\n        case TokenType::Variable:\n            return continueVariableToken(token);\n        case TokenType::Integer:\n            return continueIntegerToken(token, constState);\n        case TokenType::Double:\n            return continueDoubleToken(token);\n        case TokenType::Symbol:\n            token->value_.push_back(codePoint());\n            return TokenState::Ended;\n        case TokenType::LineBreak:\n            if (isNewline()) {\n                token->type_ = TokenType::BlankLine;\n                return TokenState::Ended;\n            }\n            return isWhitespace() ? hasMoreChars() ? TokenState::Continues : TokenState::Ended : TokenState::NextBegun;\n        default:\n            throw std::logic_error(\"Lexer: Token continued but not handled.\");\n    }\n}\n\nLexer::TokenState Lexer::continueMultilineComment(Token *token, TokenConstructionState *constState) const {\n    if (!constState->commentDetermined_) {\n        if (codePoint() == E_THOUGHT_BALLOON) {\n            token->value_.pop_back();\n            return TokenState::Ended;\n        }\n        constState->commentDetermined_ = true;\n    }\n    if (codePoint() == E_END_ARROW) {\n        constState->commentDetermined_ = false;\n    }\n    token->value_.push_back(codePoint());\n    return TokenState::Continues;\n}\n\nLexer::TokenState Lexer::continueSingleLineToken(Token *token, TokenConstructionState *constState) const {\n    if (!constState->commentDetermined_) {\n        if (codePoint() == E_SOON_ARROW) {\n            token->type_ = TokenType::MultilineComment;\n            return TokenState::Continues;\n        }\n        constState->commentDetermined_ = true;\n    }\n\n    if (isNewline()) {\n        return TokenState::Ended;\n    }\n    token->value_.push_back(codePoint());\n    return TokenState::Continues;\n}\n\nLexer::TokenState Lexer::continueDoubleToken(Token *token) const {\n    if ('0' <= codePoint() && codePoint() <= '9') {\n        token->value_.push_back(codePoint());\n        return TokenState::Continues;\n    }\n    return TokenState::NextBegun;\n}\n\nLexer::TokenState Lexer::continueVariableToken(Token *token) const {\n    \/\/ A variable can consist of everything except for whitespaces and identifiers (that is emojis)\n    \/\/ isWhitespace used here because if it is whitespace, the detection will take place below\n    if (isWhitespace() || isEmoji(codePoint())) {\n        return TokenState::NextBegun;\n    }\n\n    token->value_.push_back(codePoint());\n    return TokenState::Continues;\n}\n\nLexer::TokenState Lexer::continueIntegerToken(Token *token, Lexer::TokenConstructionState *constState) const {\n    if (('0' <= codePoint() && codePoint() <= '9') ||\n        (((64 < codePoint() && codePoint() < 71) || (96 < codePoint() && codePoint() < 103)) &&\n         constState->isHex_)) {\n        token->value_.push_back(codePoint());\n        return TokenState::Continues;\n    }\n    if (codePoint() == '.') {\n        token->type_ = TokenType::Double;\n        token->value_.push_back(codePoint());\n        return TokenState::Continues;\n    }\n    if ((codePoint() == 'x' || codePoint() == 'X') && token->value_.size() == 1 && token->value_[0] == '0') {\n        constState->isHex_ = true;\n        token->value_.push_back(codePoint());\n        return TokenState::Continues;\n    }\n    if (codePoint() == ',') {\n        return TokenState::Continues;\n    }\n    return TokenState::NextBegun;\n}\n\nLexer::TokenState Lexer::continueStringToken(Token *token, Lexer::TokenConstructionState *constState) const {\n    if (constState->escapeSequence_) {\n        handleEscapeSequence(token, constState);\n        return TokenState::Continues;\n    }\n    if (codePoint() == E_CROSS_MARK) {\n        constState->escapeSequence_ = true;\n        return TokenState::Continues;\n    }\n    if (codePoint() == E_INPUT_SYMBOL_LATIN_LETTERS) {\n        return TokenState::Ended;\n    }\n\n    token->value_.push_back(codePoint());\n    return TokenState::Continues;\n}\n\nvoid Lexer::handleEscapeSequence(Token *token, Lexer::TokenConstructionState *constState) const {\n    switch (codePoint()) {\n        case E_INPUT_SYMBOL_LATIN_LETTERS:\n        case E_CROSS_MARK:\n            token->value_.push_back(codePoint());\n            break;\n        case 'n':\n            token->value_.push_back('\\n');\n            break;\n        case 't':\n            token->value_.push_back('\\t');\n            break;\n        case 'r':\n            token->value_.push_back('\\r');\n            break;\n        default: {\n            throw CompilerError(sourcePosition_, \"Unrecognized escape sequence ❌\",\n                                utf8(std::u32string(1, codePoint())), \".\");\n        }\n    }\n\n    constState->escapeSequence_ = false;\n}\n\nLexer::TokenState Lexer::continueIdentifierToken(Token *token, Lexer::TokenConstructionState *constState) const {\n    if (constState->foundZWJ_ && isEmoji(codePoint())) {\n        token->value_.push_back(codePoint());\n        constState->foundZWJ_ = false;\n        return TokenState::Continues;\n    }\n    if ((isEmojiModifier(codePoint()) && isEmojiModifierBase(token->value_.back())) ||\n        (isRegionalIndicator(codePoint()) && token->value().size() == 1 &&\n         isRegionalIndicator(token->value().front()))) {\n        token->value_.push_back(codePoint());\n        return TokenState::Continues;\n    }\n    if (codePoint() == 0x200D) {\n        token->value_.push_back(codePoint());\n        constState->foundZWJ_ = true;\n        return TokenState::Continues;\n    }\n    if (codePoint() == 0xFE0F) {  \/\/ Emojicode ignores the Emoji modifier behind an emoji character\n        return TokenState::Continues;\n    }\n    if (token->value_.front() == E_PERSON_SHRUGGING) {\n        token->type_ = TokenType::NoValue;\n    }\n    if (token->value().front() == E_NO_GESTURE) {\n        if (codePoint() == E_LEFT_ARROW_CURVING_RIGHT) {\n            token->type_ = TokenType::ElseIf;\n            return TokenState::Ended;\n        }\n        token->type_ = TokenType::Else;\n    }\n    return TokenState::NextBegun;\n}\n\nLexer::TokenState Lexer::continueOperator(Token *token) const {\n    if (codePoint() == 0xFE0F) {  \/\/ Emojicode ignores the Emoji modifier behind an emoji character\n        return TokenState::Continues;\n    }\n    if (codePoint() == E_HANDS_RAISED_IN_CELEBRATION) {\n        token->value_.push_back(codePoint());\n        return TokenState::Ended;\n    }\n    return TokenState::NextBegun;\n}\n\n}  \/\/ namespace EmojicodeCompiler\n<|endoftext|>"}
{"text":"<commit_before>#include \"dumper.hpp\"\n\n#include \"..\/coding\/multilang_utf8_string.hpp\"\n\n#include \"..\/indexer\/classificator.hpp\"\n#include \"..\/indexer\/feature_processor.hpp\"\n\n#include \"..\/std\/algorithm.hpp\"\n#include \"..\/std\/bind.hpp\"\n#include \"..\/std\/iostream.hpp\"\n#include \"..\/std\/map.hpp\"\n#include \"..\/std\/vector.hpp\"\n\nnamespace feature\n{\n  class TypesCollector\n  {\n    vector<uint32_t> m_currFeatureTypes;\n\n  public:\n    typedef map<vector<uint32_t>, size_t> value_type;\n    value_type m_stats;\n    size_t m_namesCount;\n    size_t m_totalCount;\n\n    TypesCollector() : m_namesCount(0), m_totalCount(0) {}\n\n    void operator()(FeatureType & f, uint32_t)\n    {\n      ++m_totalCount;\n      if (!f.GetPreferredDrawableName().empty())\n        ++m_namesCount;\n\n      m_currFeatureTypes.clear();\n      f.ForEachTypeRef(*this);\n      CHECK(!m_currFeatureTypes.empty(), (\"Feature without any type???\"));\n      pair<value_type::iterator, bool> found = m_stats.insert(make_pair(m_currFeatureTypes, 1));\n      if (!found.second)\n        found.first->second++;\n    }\n\n    void operator()(uint32_t type)\n    {\n      m_currFeatureTypes.push_back(type);\n    }\n  };\n\n  template <class T>\n  static bool SortFunc(T const & first, T const & second)\n  {\n    return first.second > second.second;\n  }\n\n  void DumpTypes(string const & fPath)\n  {\n    TypesCollector doClass;\n    feature::ForEachFromDat(fPath, doClass);\n\n    typedef pair<vector<uint32_t>, size_t> stats_elem_type;\n    typedef vector<stats_elem_type> vec_to_sort;\n    vec_to_sort vecToSort(doClass.m_stats.begin(), doClass.m_stats.end());\n    sort(vecToSort.begin(), vecToSort.end(), &SortFunc<stats_elem_type>);\n\n    for (vec_to_sort::iterator it = vecToSort.begin(); it != vecToSort.end(); ++it)\n    {\n      cout << it->second << \" \";\n      for (size_t i = 0; i < it->first.size(); ++i)\n        cout << classif().GetFullObjectName(it->first[i]) << \" \";\n      cout << endl;\n    }\n    cout << \"Total features: \" << doClass.m_totalCount << endl;\n    cout << \"Features with names: \" << doClass.m_namesCount << endl;\n  }\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n  typedef map<int8_t, map<string, pair<unsigned int, string> > > TokensContainerT;\n  class PrefixesCollector\n  {\n  public:\n    TokensContainerT m_stats;\n\n    bool operator()(int8_t langCode, string const & name)\n    {\n      CHECK(!name.empty(), (\"Feature name is empty\"));\n\n      vector<string> tokens;\n      strings::SimpleTokenizer tok(name, \" \");\n      while (tok)\n      {\n        tokens.push_back(*tok);\n        ++tok;\n      }\n\n      if (tokens.empty())\n        return true;\n      \/\/ ignore token if it's first letter is an uppercase letter\n      strings::UniString const s1 = strings::MakeUniString(tokens[0]);\n      strings::UniString const s2 = strings::MakeLowerCase(s1);\n      if (s1[0] != s2[0])\n        return true;\n\n      for (size_t i = 1; i < tokens.size(); ++i)\n      {\n        string s;\n        for (size_t numTokens = 0; numTokens < i; ++numTokens)\n        {\n          s += tokens[numTokens];\n          s += \" \";\n        }\n        pair<TokensContainerT::mapped_type::iterator, bool> found =\n            m_stats[langCode].insert(make_pair(s, make_pair(1U, name)));\n        if (!found.second)\n          found.first->second.first++;\n      }\n      return true;\n    }\n\n    void operator()(FeatureType & f, uint32_t)\n    {\n      f.ForEachNameRef(*this);\n    }\n  };\n\n  static size_t const MIN_OCCURRENCE = 3;\n\n  void Print(int8_t langCode, TokensContainerT::mapped_type const & container)\n  {\n    typedef pair<string, pair<unsigned int, string> > NameElemT;\n    typedef vector<NameElemT> VecToSortT;\n    VecToSortT v(container.begin(), container.end());\n    sort(v.begin(), v.end(), &SortFunc<NameElemT>);\n\n    \/\/ do not display prefixes with low occurrences\n    if (v[0].second.first > MIN_OCCURRENCE)\n    {\n      cout << \"Language code: \" << StringUtf8Multilang::GetLangByCode(langCode) << endl;\n\n      for (VecToSortT::iterator it = v.begin(); it != v.end(); ++it)\n      {\n        if (it->second.first <= MIN_OCCURRENCE)\n          break;\n        cout << it->second.first << \" \" << it->first << \" \\\"\" << it->second.second << \"\\\"\" << endl;\n      }\n    }\n  }\n\n  void DumpPrefixes(string const & fPath)\n  {\n    PrefixesCollector doClass;\n    feature::ForEachFromDat(fPath, doClass);\n    for (TokensContainerT::iterator it = doClass.m_stats.begin();\n         it != doClass.m_stats.end(); ++it)\n    {\n      Print(it->first, it->second);\n    }\n\n  }\n\n}\n<commit_msg>[generator] Prefixes: do not ignore capital letters.<commit_after>#include \"dumper.hpp\"\n\n#include \"..\/coding\/multilang_utf8_string.hpp\"\n\n#include \"..\/indexer\/classificator.hpp\"\n#include \"..\/indexer\/feature_processor.hpp\"\n\n#include \"..\/std\/algorithm.hpp\"\n#include \"..\/std\/bind.hpp\"\n#include \"..\/std\/iostream.hpp\"\n#include \"..\/std\/map.hpp\"\n#include \"..\/std\/vector.hpp\"\n\nnamespace feature\n{\n  class TypesCollector\n  {\n    vector<uint32_t> m_currFeatureTypes;\n\n  public:\n    typedef map<vector<uint32_t>, size_t> value_type;\n    value_type m_stats;\n    size_t m_namesCount;\n    size_t m_totalCount;\n\n    TypesCollector() : m_namesCount(0), m_totalCount(0) {}\n\n    void operator()(FeatureType & f, uint32_t)\n    {\n      ++m_totalCount;\n      if (!f.GetPreferredDrawableName().empty())\n        ++m_namesCount;\n\n      m_currFeatureTypes.clear();\n      f.ForEachTypeRef(*this);\n      CHECK(!m_currFeatureTypes.empty(), (\"Feature without any type???\"));\n      pair<value_type::iterator, bool> found = m_stats.insert(make_pair(m_currFeatureTypes, 1));\n      if (!found.second)\n        found.first->second++;\n    }\n\n    void operator()(uint32_t type)\n    {\n      m_currFeatureTypes.push_back(type);\n    }\n  };\n\n  template <class T>\n  static bool SortFunc(T const & first, T const & second)\n  {\n    return first.second > second.second;\n  }\n\n  void DumpTypes(string const & fPath)\n  {\n    TypesCollector doClass;\n    feature::ForEachFromDat(fPath, doClass);\n\n    typedef pair<vector<uint32_t>, size_t> stats_elem_type;\n    typedef vector<stats_elem_type> vec_to_sort;\n    vec_to_sort vecToSort(doClass.m_stats.begin(), doClass.m_stats.end());\n    sort(vecToSort.begin(), vecToSort.end(), &SortFunc<stats_elem_type>);\n\n    for (vec_to_sort::iterator it = vecToSort.begin(); it != vecToSort.end(); ++it)\n    {\n      cout << it->second << \" \";\n      for (size_t i = 0; i < it->first.size(); ++i)\n        cout << classif().GetFullObjectName(it->first[i]) << \" \";\n      cout << endl;\n    }\n    cout << \"Total features: \" << doClass.m_totalCount << endl;\n    cout << \"Features with names: \" << doClass.m_namesCount << endl;\n  }\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n  typedef map<int8_t, map<string, pair<unsigned int, string> > > TokensContainerT;\n  class PrefixesCollector\n  {\n  public:\n    TokensContainerT m_stats;\n\n    bool operator()(int8_t langCode, string const & name)\n    {\n      CHECK(!name.empty(), (\"Feature name is empty\"));\n\n      vector<string> tokens;\n      strings::SimpleTokenizer tok(name, \" \");\n      while (tok)\n      {\n        tokens.push_back(*tok);\n        ++tok;\n      }\n\n      if (tokens.empty())\n        return true;\n      \/*\n      \/\/ ignore token if it's first letter is an uppercase letter\n      strings::UniString const s1 = strings::MakeUniString(tokens[0]);\n      strings::UniString const s2 = strings::MakeLowerCase(s1);\n      if (s1[0] != s2[0])\n        return true;\n      *\/\n\n      for (size_t i = 1; i < tokens.size(); ++i)\n      {\n        string s;\n        for (size_t numTokens = 0; numTokens < i; ++numTokens)\n        {\n          s += tokens[numTokens];\n          s += \" \";\n        }\n        pair<TokensContainerT::mapped_type::iterator, bool> found =\n            m_stats[langCode].insert(make_pair(s, make_pair(1U, name)));\n        if (!found.second)\n          found.first->second.first++;\n      }\n      return true;\n    }\n\n    void operator()(FeatureType & f, uint32_t)\n    {\n      f.ForEachNameRef(*this);\n    }\n  };\n\n  static size_t const MIN_OCCURRENCE = 3;\n\n  void Print(int8_t langCode, TokensContainerT::mapped_type const & container)\n  {\n    typedef pair<string, pair<unsigned int, string> > NameElemT;\n    typedef vector<NameElemT> VecToSortT;\n    VecToSortT v(container.begin(), container.end());\n    sort(v.begin(), v.end(), &SortFunc<NameElemT>);\n\n    \/\/ do not display prefixes with low occurrences\n    if (v[0].second.first > MIN_OCCURRENCE)\n    {\n      cout << \"Language code: \" << StringUtf8Multilang::GetLangByCode(langCode) << endl;\n\n      for (VecToSortT::iterator it = v.begin(); it != v.end(); ++it)\n      {\n        if (it->second.first <= MIN_OCCURRENCE)\n          break;\n        cout << it->second.first << \" \" << it->first << \" \\\"\" << it->second.second << \"\\\"\" << endl;\n      }\n    }\n  }\n\n  void DumpPrefixes(string const & fPath)\n  {\n    PrefixesCollector doClass;\n    feature::ForEachFromDat(fPath, doClass);\n    for (TokensContainerT::iterator it = doClass.m_stats.begin();\n         it != doClass.m_stats.end(); ++it)\n    {\n      Print(it->first, it->second);\n    }\n\n  }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <stdlib.h>\n#include <Windows.h>\n#include <allegro5\\allegro.h>\n\n\/\/constante provizorii\n#define default_window_w 800\n#define default_window_h 600\n\nALLEGRO_DISPLAY *window;\nint window_w, window_h;\n\n\/\/---functii momentan inutile---\nvoid deserialize() {\n\twindow_w = default_window_w;\n\twindow_h = default_window_h;\n\n}\n\nvoid serialize() {\n\n}\n\/\/----------------------------\n\nbool loop_end;\n\nvoid init(){\n\tal_init();\n\tal_install_keyboard();\n\tal_install_mouse();\n\tal_install_joystick();\n\t\n\tdeserialize();\n\twindow = al_create_display(window_w, window_h);\n\n\tloop_end = 0;\n}\n\nvoid end() {\n\tal_uninstall_joystick();\n\tal_uninstall_mouse();\n\tal_uninstall_keyboard();\n\tal_uninstall_system();\n\n\tserialize();\n}\n\nvoid main_loop() {\n\n\twhile (!loop_end) {\n\n\t\tALLEGRO_COLOR background_color = al_map_rgb(0, 0, 255);\n\n\t\tal_clear_to_color(background_color); \/\/buffer-ul devine albastru\n\n\t\tal_flip_display(); \/\/schimba buffer-ul\n\t}\n\n}\n\nint main(int argc, char **argv \/*parametrii conventionali*\/) {\n\tinit();\n\tmain_loop();\n\tend();\n\t\n\tsystem(\"pause\");\n\treturn 0;\n}<commit_msg>renaming variables<commit_after>#include <iostream>\n#include <stdlib.h>\n#include <Windows.h>\n#include <allegro5\\allegro.h>\n\n\/\/constante provizorii\n#define defaultWindowW 800\n#define defaultWindowH 600\n\nALLEGRO_DISPLAY *window;\nint windowW, windowH;\n\n\/\/---functii momentan inutile---\nvoid deserialize() {\n\twindowW = defaultWindowW;\n\twindowH = defaultWindowH;\n\n}\n\nvoid serialize() {\n\n}\n\/\/----------------------------\n\nbool loopEnd;\n\nvoid init(){\n\tal_init();\n\tal_install_keyboard();\n\tal_install_mouse();\n\tal_install_joystick();\n\t\n\tdeserialize();\n\twindow = al_create_display(window_w, window_h);\n\n\tloopEnd = 0;\n}\n\nvoid end() {\n\tal_uninstall_joystick();\n\tal_uninstall_mouse();\n\tal_uninstall_keyboard();\n\tal_uninstall_system();\n\n\tserialize();\n}\n\nvoid main_loop() {\n\n\twhile (!loopEnd) {\n\n\t\tALLEGRO_COLOR background_color = al_map_rgb(0, 0, 255);\n\n\t\tal_clear_to_color(background_color); \/\/buffer-ul devine albastru\n\n\t\tal_flip_display(); \/\/schimba buffer-ul\n\t}\n\n}\n\nint main(int argc, char **argv \/*parametrii conventionali*\/) {\n\tinit();\n\tmain_loop();\n\tend();\n\t\n\tsystem(\"pause\");\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef XGBOOST_REGRANK_OBJ_HPP\n#define XGBOOST_REGRANK_OBJ_HPP\n\/*!\n * \\file xgboost_regrank_obj.hpp\n * \\brief implementation of objective functions\n * \\author Tianqi Chen, Kailong Chen\n *\/\n\/\/#include \"xgboost_regrank_sample.h\"\n#include <vector>\n#include <functional>\n#include \"xgboost_regrank_utils.h\"\n\nnamespace xgboost{\n    namespace regrank{        \n        class RegressionObj : public IObjFunction{\n        public:\n            RegressionObj( int loss_type ){\n                loss.loss_type = loss_type;\n            }\n            virtual ~RegressionObj(){}\n            virtual void SetParam(const char *name, const char *val){\n                if( !strcmp( \"loss_type\", name ) ) loss.loss_type = atoi( val );\n                if( !strcmp( \"scale_pos_weight\", name ) ) scale_pos_weight = (float)atof( val );\n            }\n            virtual void GetGradient(const std::vector<float>& preds,  \n                                     const DMatrix::Info &info,\n                                     int iter,\n                                     std::vector<float> &grad, \n                                     std::vector<float> &hess ) {\n                utils::Assert( preds.size() == info.labels.size(), \"label size predict size not match\" );\n                grad.resize(preds.size()); hess.resize(preds.size());\n\n                const unsigned ndata = static_cast<unsigned>(preds.size());\n                #pragma omp parallel for schedule( static )\n                for (unsigned j = 0; j < ndata; ++j){\n                    float p = loss.PredTransform(preds[j]);\n                    float w = info.GetWeight(j);\n                    if( info.labels[j] == 1.0f ) w *= scale_pos_weight;\n                    grad[j] = loss.FirstOrderGradient(p, info.labels[j]) * w;\n                    hess[j] = loss.SecondOrderGradient(p, info.labels[j]) * w;\n                }\n            }\n            virtual const char* DefaultEvalMetric(void) {\n                if( loss.loss_type == LossType::kLogisticClassify ) return \"error\";\n                if( loss.loss_type == LossType::kLogisticRaw ) return \"auc\";\n                return \"rmse\";\n            }\n            virtual void PredTransform(std::vector<float> &preds){\n                const unsigned ndata = static_cast<unsigned>(preds.size());\n                #pragma omp parallel for schedule( static )\n                for (unsigned j = 0; j < ndata; ++j){\n                    preds[j] = loss.PredTransform( preds[j] );\n                }\n            }\n        private:\n            float scale_pos_weight;\n            LossType loss;\n        };\n    };\n\n    namespace regrank{\n        \/\/ simple softmax rak\n        class SoftmaxRankObj : public IObjFunction{\n        public:\n            SoftmaxRankObj(void){\n            }\n            virtual ~SoftmaxRankObj(){}\n            virtual void SetParam(const char *name, const char *val){\n            }\n            virtual void GetGradient(const std::vector<float>& preds,  \n                                     const DMatrix::Info &info,\n                                     int iter,\n                                     std::vector<float> &grad, \n                                     std::vector<float> &hess ) {\n                utils::Assert( preds.size() == info.labels.size(), \"label size predict size not match\" );\n                grad.resize(preds.size()); hess.resize(preds.size());\n                const std::vector<unsigned> &gptr = info.group_ptr;\n                utils::Assert( gptr.size() != 0 && gptr.back() == preds.size(), \"rank loss must have group file\" );\n                const unsigned ngroup = static_cast<unsigned>( gptr.size() - 1 );\n\n                #pragma omp parallel\n                {\n                    std::vector< float > rec;                    \n                    #pragma omp for schedule(static)\n                    for (unsigned k = 0; k < ngroup; ++k){\n                        rec.clear();\n                        int nhit = 0;\n                        for(unsigned j = gptr[k]; j < gptr[k+1]; ++j ){\n                            rec.push_back( preds[j] );\n                            grad[j] = hess[j] = 0.0f;\n                            nhit += info.labels[j];\n                        }\n                        Softmax( rec );\n                        if( nhit == 1 ){\n                            for(unsigned j = gptr[k]; j < gptr[k+1]; ++j ){\n                                float p = rec[ j - gptr[k] ];\n                                grad[j] = p - info.labels[j];\n                                hess[j] = 2.0f * p * ( 1.0f - p );\n                            }  \n                        }else{\n                            utils::Assert( nhit == 0, \"softmax does not allow multiple labels\" );\n                        }\n                    }\n                }\n            }\n            virtual const char* DefaultEvalMetric(void) {\n                return \"pre@1\";\n            }\n        };\n\n        \/\/ simple softmax multi-class classification\n        class SoftmaxMultiClassObj : public IObjFunction{\n        public:\n            SoftmaxMultiClassObj(void){\n                nclass = 0;\n            }\n            virtual ~SoftmaxMultiClassObj(){}\n            virtual void SetParam(const char *name, const char *val){\n                if( !strcmp( \"num_class\", name ) ) nclass = atoi(val); \n            }\n            virtual void GetGradient(const std::vector<float>& preds,  \n                                     const DMatrix::Info &info,\n                                     int iter,\n                                     std::vector<float> &grad, \n                                     std::vector<float> &hess ) {\n                utils::Assert( nclass != 0, \"must set num_class to use softmax\" );\n                utils::Assert( preds.size() == (size_t)nclass * info.labels.size(), \"SoftmaxMultiClassObj: label size and pred size does not match\" );\n                grad.resize(preds.size()); hess.resize(preds.size());\n                \n                const unsigned ndata = static_cast<unsigned>(info.labels.size());\n                #pragma omp parallel\n                {\n                    std::vector<float> rec(nclass);\n                    #pragma omp for schedule(static)\n                    for (unsigned j = 0; j < ndata; ++j){\n                        for( int k = 0; k < nclass; ++ k ){\n                            rec[k] = preds[j + k * ndata];\n                        }\n                        Softmax( rec );\n                        int label = static_cast<int>(info.labels[j]);\n                        if( label < 0 ){\n                            label = -label - 1;\n                        }\n                        utils::Assert( label < nclass, \"SoftmaxMultiClassObj: label exceed num_class\" );\n                        for( int k = 0; k < nclass; ++ k ){\n                            float p = rec[ k ];\n                            if( label == k ){\n                                grad[j+k*ndata] = p - 1.0f;\n                            }else{\n                                grad[j+k*ndata] = p;\n                            }\n                            hess[j+k*ndata] = 2.0f * p * ( 1.0f - p );\n                        }  \n                    }\n                }\n            }\n            virtual void PredTransform(std::vector<float> &preds){\n                utils::Assert( nclass != 0, \"must set num_class to use softmax\" );\n                utils::Assert( preds.size() % nclass == 0, \"SoftmaxMultiClassObj: label size and pred size does not match\" );                \n                const unsigned ndata = static_cast<unsigned>(preds.size()\/nclass);\n                \n                #pragma omp parallel\n                {\n                    std::vector<float> rec(nclass);\n                    #pragma omp for schedule(static)\n                    for (unsigned j = 0; j < ndata; ++j){\n                        for( int k = 0; k < nclass; ++ k ){\n                            rec[k] = preds[j + k * ndata];\n                        }\n                        preds[j] = FindMaxIndex( rec );\n                    }\n                }\n                preds.resize( ndata );\n            }\n            virtual const char* DefaultEvalMetric(void) {\n                return \"merror\";\n            }\n        private:\n            int nclass;\n        };\n    };\n\n\n    namespace regrank{\n        \/*! \\brief objective for lambda rank *\/\n        class LambdaRankObj : public IObjFunction{\n        public:\n            LambdaRankObj(void){\n                loss.loss_type = LossType::kLogisticRaw;\n                fix_list_weight = 0.0f;\n                num_pairsample = 1;\n            }\n            virtual ~LambdaRankObj(){}\n            virtual void SetParam(const char *name, const char *val){\n                if( !strcmp( \"loss_type\", name ) )       loss.loss_type = atoi( val );\n                if( !strcmp( \"fix_list_weight\", name ) ) fix_list_weight = (float)atof( val );\n                if( !strcmp( \"num_pairsample\", name ) )  num_pairsample = atoi( val );\n            }\n        public:\n            virtual void GetGradient(const std::vector<float>& preds,  \n                                     const DMatrix::Info &info,\n                                     int iter,\n                                     std::vector<float> &grad, \n                                     std::vector<float> &hess ) {\n                utils::Assert( preds.size() == info.labels.size(), \"label size predict size not match\" );              \n                grad.resize(preds.size()); hess.resize(preds.size());\n                const std::vector<unsigned> &gptr = info.group_ptr;\n                utils::Assert( gptr.size() != 0 && gptr.back() == preds.size(), \"rank loss must have group file\" );\n                const unsigned ngroup = static_cast<unsigned>( gptr.size() - 1 );\n\n                #pragma omp parallel\n                {\n                    \/\/ parall construct, declare random number generator here, so that each \n                    \/\/ thread use its own random number generator, seed by thread id and current iteration\n                    random::Random rnd; rnd.Seed( iter * 1111 + omp_get_thread_num() );\n                    std::vector<LambdaPair> pairs;\n                    std::vector<ListEntry>  lst;\n                    std::vector< std::pair<float,unsigned> > rec;\n                    \n                    #pragma omp for schedule(static)\n                    for (unsigned k = 0; k < ngroup; ++k){\n                        lst.clear(); pairs.clear(); \n                        for(unsigned j = gptr[k]; j < gptr[k+1]; ++j ){\n                            lst.push_back( ListEntry(preds[j], info.labels[j], j ) );\n                            grad[j] = hess[j] = 0.0f;\n                        }                        \n                        std::sort( lst.begin(), lst.end(), ListEntry::CmpPred );\n                        rec.resize( lst.size() );\n                        for( unsigned i = 0; i < lst.size(); ++i ){\n                            rec[i] = std::make_pair( lst[i].label, i );\n                        }\n                        std::sort( rec.begin(), rec.end(), CmpFirst );\n                        \/\/ enumerate buckets with same label, for each item in the lst, grab another sample randomly\n                        for( unsigned i = 0; i < rec.size(); ){\n                            unsigned j = i + 1;\n                            while( j < rec.size() && rec[j].first == rec[i].first ) ++ j;\n                            \/\/ bucket in [i,j), get a sample outside bucket\n                            unsigned nleft = i, nright = rec.size() - j;\n                            if( nleft + nright != 0 ){\n                                int nsample = num_pairsample;\n                                while( nsample -- ){\n                                    for( unsigned pid = i; pid < j; ++ pid ){\n                                        unsigned ridx = static_cast<unsigned>( rnd.RandDouble() * (nleft+nright) );\n                                        if( ridx < nleft ){\n                                            pairs.push_back( LambdaPair( rec[ridx].second, rec[pid].second ) );\n                                        }else{\n                                            pairs.push_back( LambdaPair( rec[pid].second, rec[ridx+j-i].second ) );\n                                        }\n                                    }      \n                                }\n                            }\n                            i = j;\n                        }\n                        \/\/ get lambda weight for the pairs\n                        this->GetLambdaWeight( lst, pairs );\n                        \/\/ rescale each gradient and hessian so that the lst have constant weighted\n                        float scale = 1.0f \/ num_pairsample;\n                        if( fix_list_weight != 0.0f ){\n                            scale *= fix_list_weight \/ (gptr[k+1] - gptr[k]);\n                        }\n                        for( size_t i = 0; i < pairs.size(); ++ i ){\n                            const ListEntry &pos = lst[ pairs[i].pos_index ];\n                            const ListEntry &neg = lst[ pairs[i].neg_index ];\n                            const float w = pairs[i].weight * scale;\n                            float p = loss.PredTransform( pos.pred - neg.pred );\n                            float g = loss.FirstOrderGradient( p, 1.0f );\n                            float h = loss.SecondOrderGradient( p, 1.0f );\n                            \/\/ accumulate gradient and hessian in both pid, and nid, \n                            grad[ pos.rindex ] += g * w; \n                            grad[ neg.rindex ] -= g * w;\n                            \/\/ take conservative update, scale hessian by 2\n                            hess[ pos.rindex ] += 2.0f * h * w; \n                            hess[ neg.rindex ] += 2.0f * h * w;\n                        }                       \n                    }\n                }\n            }\n            virtual const char* DefaultEvalMetric(void) {\n                return \"map\";\n            }\n        private:\n            \/\/ loss function\n            LossType loss;\n            \/\/ number of samples peformed for each instance\n            int num_pairsample;            \n            \/\/ fix weight of each elements in list\n            float fix_list_weight;\n        protected:\n            \/*! \\brief helper information in a list *\/\n            struct ListEntry{\n                \/*! \\brief the predict score we in the data *\/\n                float pred;\n                \/*! \\brief the actual label of the entry *\/\n                float label;\n                \/*! \\brief row index in the data matrix *\/                \n                unsigned rindex;\n                \/\/ constructor\n                ListEntry(float pred, float label, unsigned rindex): pred(pred),label(label),rindex(rindex){}\n                \/\/ comparator by prediction\n                inline static bool CmpPred(const ListEntry &a, const ListEntry &b){\n                    return a.pred > b.pred;\n                }\n                \/\/ comparator by label\n                inline static bool CmpLabel(const ListEntry &a, const ListEntry &b){\n                    return a.label > b.label;\n                }\n            };\n            \/*! \\brief a pair in the lambda rank *\/\n            struct LambdaPair{\n                \/*! \\brief positive index: this is a position in the list *\/\n                unsigned pos_index;\n                \/*! \\brief negative index: this is a position in the list *\/\n                unsigned neg_index;\n                \/*! \\brief weight to be filled in *\/\n                float weight;\n                LambdaPair( unsigned pos_index, unsigned neg_index ):pos_index(pos_index),neg_index(neg_index),weight(1.0f){}\n            };            \n            \/*! \n             * \\brief get lambda weight for existing pairs \n             * \\param list a list that is sorted by pred score\n             * \\param pairs record of pairs, containing the pairs to fill in weights\n             *\/\n            virtual void GetLambdaWeight( const std::vector<ListEntry> &sorted_list, std::vector<LambdaPair> &pairs ) = 0;\n        };\n    };\n    \n    namespace regrank{\n        class PairwiseRankObj: public LambdaRankObj{\n        public:\n            virtual ~PairwiseRankObj(void){}\n            virtual void GetLambdaWeight( const std::vector<ListEntry> &sorted_list, std::vector<LambdaPair> &pairs ){}            \n        };\n    };\n};\n#endif\n<commit_msg>fix bug in classification, scale_pos_weight initialization<commit_after>#ifndef XGBOOST_REGRANK_OBJ_HPP\n#define XGBOOST_REGRANK_OBJ_HPP\n\/*!\n * \\file xgboost_regrank_obj.hpp\n * \\brief implementation of objective functions\n * \\author Tianqi Chen, Kailong Chen\n *\/\n\/\/#include \"xgboost_regrank_sample.h\"\n#include <vector>\n#include <functional>\n#include \"xgboost_regrank_utils.h\"\n\nnamespace xgboost{\n    namespace regrank{        \n        class RegressionObj : public IObjFunction{\n        public:\n            RegressionObj( int loss_type ){\n                loss.loss_type = loss_type;\n                scale_pos_weight = 1.0f;\n            }\n            virtual ~RegressionObj(){}\n            virtual void SetParam(const char *name, const char *val){\n                if( !strcmp( \"loss_type\", name ) ) loss.loss_type = atoi( val );\n                if( !strcmp( \"scale_pos_weight\", name ) ) scale_pos_weight = (float)atof( val );\n            }\n            virtual void GetGradient(const std::vector<float>& preds,  \n                                     const DMatrix::Info &info,\n                                     int iter,\n                                     std::vector<float> &grad, \n                                     std::vector<float> &hess ) {\n                utils::Assert( preds.size() == info.labels.size(), \"label size predict size not match\" );\n                grad.resize(preds.size()); hess.resize(preds.size());\n\n                const unsigned ndata = static_cast<unsigned>(preds.size());\n                #pragma omp parallel for schedule( static )\n                for (unsigned j = 0; j < ndata; ++j){\n                    float p = loss.PredTransform(preds[j]);\n                    float w = info.GetWeight(j);\n                    if( info.labels[j] == 1.0f ) w *= scale_pos_weight;\n                    grad[j] = loss.FirstOrderGradient(p, info.labels[j]) * w;\n                    hess[j] = loss.SecondOrderGradient(p, info.labels[j]) * w;\n                }\n            }\n            virtual const char* DefaultEvalMetric(void) {\n                if( loss.loss_type == LossType::kLogisticClassify ) return \"error\";\n                if( loss.loss_type == LossType::kLogisticRaw ) return \"auc\";\n                return \"rmse\";\n            }\n            virtual void PredTransform(std::vector<float> &preds){\n                const unsigned ndata = static_cast<unsigned>(preds.size());\n                #pragma omp parallel for schedule( static )\n                for (unsigned j = 0; j < ndata; ++j){\n                    preds[j] = loss.PredTransform( preds[j] );\n                }\n            }\n        private:\n            float scale_pos_weight;\n            LossType loss;\n        };\n    };\n\n    namespace regrank{\n        \/\/ simple softmax rak\n        class SoftmaxRankObj : public IObjFunction{\n        public:\n            SoftmaxRankObj(void){\n            }\n            virtual ~SoftmaxRankObj(){}\n            virtual void SetParam(const char *name, const char *val){\n            }\n            virtual void GetGradient(const std::vector<float>& preds,  \n                                     const DMatrix::Info &info,\n                                     int iter,\n                                     std::vector<float> &grad, \n                                     std::vector<float> &hess ) {\n                utils::Assert( preds.size() == info.labels.size(), \"label size predict size not match\" );\n                grad.resize(preds.size()); hess.resize(preds.size());\n                const std::vector<unsigned> &gptr = info.group_ptr;\n                utils::Assert( gptr.size() != 0 && gptr.back() == preds.size(), \"rank loss must have group file\" );\n                const unsigned ngroup = static_cast<unsigned>( gptr.size() - 1 );\n\n                #pragma omp parallel\n                {\n                    std::vector< float > rec;                    \n                    #pragma omp for schedule(static)\n                    for (unsigned k = 0; k < ngroup; ++k){\n                        rec.clear();\n                        int nhit = 0;\n                        for(unsigned j = gptr[k]; j < gptr[k+1]; ++j ){\n                            rec.push_back( preds[j] );\n                            grad[j] = hess[j] = 0.0f;\n                            nhit += info.labels[j];\n                        }\n                        Softmax( rec );\n                        if( nhit == 1 ){\n                            for(unsigned j = gptr[k]; j < gptr[k+1]; ++j ){\n                                float p = rec[ j - gptr[k] ];\n                                grad[j] = p - info.labels[j];\n                                hess[j] = 2.0f * p * ( 1.0f - p );\n                            }  \n                        }else{\n                            utils::Assert( nhit == 0, \"softmax does not allow multiple labels\" );\n                        }\n                    }\n                }\n            }\n            virtual const char* DefaultEvalMetric(void) {\n                return \"pre@1\";\n            }\n        };\n\n        \/\/ simple softmax multi-class classification\n        class SoftmaxMultiClassObj : public IObjFunction{\n        public:\n            SoftmaxMultiClassObj(void){\n                nclass = 0;\n            }\n            virtual ~SoftmaxMultiClassObj(){}\n            virtual void SetParam(const char *name, const char *val){\n                if( !strcmp( \"num_class\", name ) ) nclass = atoi(val); \n            }\n            virtual void GetGradient(const std::vector<float>& preds,  \n                                     const DMatrix::Info &info,\n                                     int iter,\n                                     std::vector<float> &grad, \n                                     std::vector<float> &hess ) {\n                utils::Assert( nclass != 0, \"must set num_class to use softmax\" );\n                utils::Assert( preds.size() == (size_t)nclass * info.labels.size(), \"SoftmaxMultiClassObj: label size and pred size does not match\" );\n                grad.resize(preds.size()); hess.resize(preds.size());\n                \n                const unsigned ndata = static_cast<unsigned>(info.labels.size());\n                #pragma omp parallel\n                {\n                    std::vector<float> rec(nclass);\n                    #pragma omp for schedule(static)\n                    for (unsigned j = 0; j < ndata; ++j){\n                        for( int k = 0; k < nclass; ++ k ){\n                            rec[k] = preds[j + k * ndata];\n                        }\n                        Softmax( rec );\n                        int label = static_cast<int>(info.labels[j]);\n                        if( label < 0 ){\n                            label = -label - 1;\n                        }\n                        utils::Assert( label < nclass, \"SoftmaxMultiClassObj: label exceed num_class\" );\n                        for( int k = 0; k < nclass; ++ k ){\n                            float p = rec[ k ];\n                            if( label == k ){\n                                grad[j+k*ndata] = p - 1.0f;\n                            }else{\n                                grad[j+k*ndata] = p;\n                            }\n                            hess[j+k*ndata] = 2.0f * p * ( 1.0f - p );\n                        }  \n                    }\n                }\n            }\n            virtual void PredTransform(std::vector<float> &preds){\n                utils::Assert( nclass != 0, \"must set num_class to use softmax\" );\n                utils::Assert( preds.size() % nclass == 0, \"SoftmaxMultiClassObj: label size and pred size does not match\" );                \n                const unsigned ndata = static_cast<unsigned>(preds.size()\/nclass);\n                \n                #pragma omp parallel\n                {\n                    std::vector<float> rec(nclass);\n                    #pragma omp for schedule(static)\n                    for (unsigned j = 0; j < ndata; ++j){\n                        for( int k = 0; k < nclass; ++ k ){\n                            rec[k] = preds[j + k * ndata];\n                        }\n                        preds[j] = FindMaxIndex( rec );\n                    }\n                }\n                preds.resize( ndata );\n            }\n            virtual const char* DefaultEvalMetric(void) {\n                return \"merror\";\n            }\n        private:\n            int nclass;\n        };\n    };\n\n\n    namespace regrank{\n        \/*! \\brief objective for lambda rank *\/\n        class LambdaRankObj : public IObjFunction{\n        public:\n            LambdaRankObj(void){\n                loss.loss_type = LossType::kLogisticRaw;\n                fix_list_weight = 0.0f;\n                num_pairsample = 1;\n            }\n            virtual ~LambdaRankObj(){}\n            virtual void SetParam(const char *name, const char *val){\n                if( !strcmp( \"loss_type\", name ) )       loss.loss_type = atoi( val );\n                if( !strcmp( \"fix_list_weight\", name ) ) fix_list_weight = (float)atof( val );\n                if( !strcmp( \"num_pairsample\", name ) )  num_pairsample = atoi( val );\n            }\n        public:\n            virtual void GetGradient(const std::vector<float>& preds,  \n                                     const DMatrix::Info &info,\n                                     int iter,\n                                     std::vector<float> &grad, \n                                     std::vector<float> &hess ) {\n                utils::Assert( preds.size() == info.labels.size(), \"label size predict size not match\" );              \n                grad.resize(preds.size()); hess.resize(preds.size());\n                const std::vector<unsigned> &gptr = info.group_ptr;\n                utils::Assert( gptr.size() != 0 && gptr.back() == preds.size(), \"rank loss must have group file\" );\n                const unsigned ngroup = static_cast<unsigned>( gptr.size() - 1 );\n\n                #pragma omp parallel\n                {\n                    \/\/ parall construct, declare random number generator here, so that each \n                    \/\/ thread use its own random number generator, seed by thread id and current iteration\n                    random::Random rnd; rnd.Seed( iter * 1111 + omp_get_thread_num() );\n                    std::vector<LambdaPair> pairs;\n                    std::vector<ListEntry>  lst;\n                    std::vector< std::pair<float,unsigned> > rec;\n                    \n                    #pragma omp for schedule(static)\n                    for (unsigned k = 0; k < ngroup; ++k){\n                        lst.clear(); pairs.clear(); \n                        for(unsigned j = gptr[k]; j < gptr[k+1]; ++j ){\n                            lst.push_back( ListEntry(preds[j], info.labels[j], j ) );\n                            grad[j] = hess[j] = 0.0f;\n                        }                        \n                        std::sort( lst.begin(), lst.end(), ListEntry::CmpPred );\n                        rec.resize( lst.size() );\n                        for( unsigned i = 0; i < lst.size(); ++i ){\n                            rec[i] = std::make_pair( lst[i].label, i );\n                        }\n                        std::sort( rec.begin(), rec.end(), CmpFirst );\n                        \/\/ enumerate buckets with same label, for each item in the lst, grab another sample randomly\n                        for( unsigned i = 0; i < rec.size(); ){\n                            unsigned j = i + 1;\n                            while( j < rec.size() && rec[j].first == rec[i].first ) ++ j;\n                            \/\/ bucket in [i,j), get a sample outside bucket\n                            unsigned nleft = i, nright = rec.size() - j;\n                            if( nleft + nright != 0 ){\n                                int nsample = num_pairsample;\n                                while( nsample -- ){\n                                    for( unsigned pid = i; pid < j; ++ pid ){\n                                        unsigned ridx = static_cast<unsigned>( rnd.RandDouble() * (nleft+nright) );\n                                        if( ridx < nleft ){\n                                            pairs.push_back( LambdaPair( rec[ridx].second, rec[pid].second ) );\n                                        }else{\n                                            pairs.push_back( LambdaPair( rec[pid].second, rec[ridx+j-i].second ) );\n                                        }\n                                    }      \n                                }\n                            }\n                            i = j;\n                        }\n                        \/\/ get lambda weight for the pairs\n                        this->GetLambdaWeight( lst, pairs );\n                        \/\/ rescale each gradient and hessian so that the lst have constant weighted\n                        float scale = 1.0f \/ num_pairsample;\n                        if( fix_list_weight != 0.0f ){\n                            scale *= fix_list_weight \/ (gptr[k+1] - gptr[k]);\n                        }\n                        for( size_t i = 0; i < pairs.size(); ++ i ){\n                            const ListEntry &pos = lst[ pairs[i].pos_index ];\n                            const ListEntry &neg = lst[ pairs[i].neg_index ];\n                            const float w = pairs[i].weight * scale;\n                            float p = loss.PredTransform( pos.pred - neg.pred );\n                            float g = loss.FirstOrderGradient( p, 1.0f );\n                            float h = loss.SecondOrderGradient( p, 1.0f );\n                            \/\/ accumulate gradient and hessian in both pid, and nid, \n                            grad[ pos.rindex ] += g * w; \n                            grad[ neg.rindex ] -= g * w;\n                            \/\/ take conservative update, scale hessian by 2\n                            hess[ pos.rindex ] += 2.0f * h * w; \n                            hess[ neg.rindex ] += 2.0f * h * w;\n                        }                       \n                    }\n                }\n            }\n            virtual const char* DefaultEvalMetric(void) {\n                return \"map\";\n            }\n        private:\n            \/\/ loss function\n            LossType loss;\n            \/\/ number of samples peformed for each instance\n            int num_pairsample;            \n            \/\/ fix weight of each elements in list\n            float fix_list_weight;\n        protected:\n            \/*! \\brief helper information in a list *\/\n            struct ListEntry{\n                \/*! \\brief the predict score we in the data *\/\n                float pred;\n                \/*! \\brief the actual label of the entry *\/\n                float label;\n                \/*! \\brief row index in the data matrix *\/                \n                unsigned rindex;\n                \/\/ constructor\n                ListEntry(float pred, float label, unsigned rindex): pred(pred),label(label),rindex(rindex){}\n                \/\/ comparator by prediction\n                inline static bool CmpPred(const ListEntry &a, const ListEntry &b){\n                    return a.pred > b.pred;\n                }\n                \/\/ comparator by label\n                inline static bool CmpLabel(const ListEntry &a, const ListEntry &b){\n                    return a.label > b.label;\n                }\n            };\n            \/*! \\brief a pair in the lambda rank *\/\n            struct LambdaPair{\n                \/*! \\brief positive index: this is a position in the list *\/\n                unsigned pos_index;\n                \/*! \\brief negative index: this is a position in the list *\/\n                unsigned neg_index;\n                \/*! \\brief weight to be filled in *\/\n                float weight;\n                LambdaPair( unsigned pos_index, unsigned neg_index ):pos_index(pos_index),neg_index(neg_index),weight(1.0f){}\n            };            \n            \/*! \n             * \\brief get lambda weight for existing pairs \n             * \\param list a list that is sorted by pred score\n             * \\param pairs record of pairs, containing the pairs to fill in weights\n             *\/\n            virtual void GetLambdaWeight( const std::vector<ListEntry> &sorted_list, std::vector<LambdaPair> &pairs ) = 0;\n        };\n    };\n    \n    namespace regrank{\n        class PairwiseRankObj: public LambdaRankObj{\n        public:\n            virtual ~PairwiseRankObj(void){}\n            virtual void GetLambdaWeight( const std::vector<ListEntry> &sorted_list, std::vector<LambdaPair> &pairs ){}            \n        };\n    };\n};\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#define _CRT_SECURE_NO_WARNINGS\n#define _CRT_SECURE_NO_DEPRECATE\n\n#include <ctime>\n#include <string>\n#include <cstring>\n#include \"xgboost_reg.h\"\n#include \"..\/utils\/xgboost_fmap.h\"\n#include \"..\/utils\/xgboost_random.h\"\n#include \"..\/utils\/xgboost_config.h\"\n\nnamespace xgboost{\n    namespace regression{\n        \/*!\n        * \\brief wrapping the training process of the gradient boosting regression model,\n        *   given the configuation\n        * \\author Kailong Chen: chenkl198812@gmail.com, Tianqi Chen: tianqi.chen@gmail.com\n        *\/\n        class RegBoostTask{            \n        public:\n            inline int Run( int argc, char *argv[] ){\n                if( argc < 2 ){\n                    printf(\"Usage: <config>\\n\"); \n                    return 0;\n                }\n                utils::ConfigIterator itr( argv[1] );\n                while( itr.Next() ){\n                    this->SetParam( itr.name(), itr.val() );\n                }\n                for( int i = 2; i < argc; i ++ ){\n                    char name[256], val[256];\n                    if( sscanf( argv[i], \"%[^=]=%s\", name, val ) == 2 ){\n                        this->SetParam( name, val );\n                    }\n                }\n                this->InitData();\n                this->InitLearner();\n                if( task == \"dump\" ){\n                    this->TaskDump();\n                    return 0;\n                }\n                if( task == \"interact\" ){\n                    this->TaskInteractive(); return 0;\n                }\n                if( task == \"dumppath\" ){\n                    this->TaskDumpPath(); return 0;\n                }\n                if( task == \"eval\" ){\n                    this->TaskEval(); return 0;\n                }\n                if( task == \"pred\" ){\n                    this->TaskPred();\n                }else{                  \n                    this->TaskTrain();\n                }\n                return 0;\n            }\n            inline void SetParam( const char *name, const char *val ){\n                if( !strcmp(\"silent\", name ) )       silent = atoi( val );\n                if( !strcmp(\"use_buffer\", name ) )   use_buffer = atoi( val );\n                if( !strcmp(\"seed\", name ) )         random::Seed( atoi(val) );\n                if( !strcmp(\"num_round\", name ) )    num_round = atoi( val );\n                if( !strcmp(\"save_period\", name ) )  save_period = atoi( val );\n                if( !strcmp(\"task\", name ) )         task = val;\n                if( !strcmp(\"data\",  name ) )        train_path = val;\n                if( !strcmp(\"test:data\",  name ) )   test_path  = val;\n                if( !strcmp(\"model_in\",  name ) )    model_in   = val;\n                if( !strcmp(\"model_out\",  name ) )   model_out   = val;\n                if( !strcmp(\"model_dir\", name ) )    model_dir_path = val;\n                if( !strcmp(\"fmap\",  name ) )        name_fmap = val;\n                if( !strcmp(\"name_dump\",  name ) )   name_dump = val;\n                if( !strcmp(\"name_dumppath\",  name ) )   name_dumppath = val;\n                if( !strcmp(\"name_pred\",  name ) )   name_pred = val;\n                if( !strcmp(\"dump_stats\", name ) )   dump_model_stats = atoi( val );\n                if( !strcmp(\"interact:action\",  name ) )  interact_action = val;\n                if( !strncmp(\"batch:\",  name, 6 ) ){\n                    cfg_batch.PushBack( name + 6, val );\n                }\n                if( !strncmp(\"eval[\",  name, 5 ) ) {\n                    char evname[ 256 ];\n                    utils::Assert( sscanf( name, \"eval[%[^]]\", evname ) == 1, \"must specify evaluation name for display\");\n                    eval_data_names.push_back( std::string( evname ) );\n                    eval_data_paths.push_back( std::string( val ) );\n                }\n                cfg.PushBack( name, val );\n            }\n        public:\n            RegBoostTask( void ){\n                \/\/ default parameters\n                silent = 0;\n                use_buffer = 1;\n                num_round = 10;\n                save_period = 0;\n                dump_model_stats = 0;\n                task = \"train\";                \n                model_in = \"NULL\";\n                model_out = \"NULL\";\n                name_fmap = \"NULL\";\n                name_pred = \"pred.txt\";\n                name_dump = \"dump.txt\";\n                name_dumppath = \"dump.path.txt\";\n                model_dir_path = \".\/\";\n                interact_action = \"update\";\n            }\n            ~RegBoostTask( void ){\n                for( size_t i = 0; i < deval.size(); i ++ ){\n                    delete deval[i];\n                }\n            }\n        private:\n            inline void InitData( void ){\n                if( name_fmap != \"NULL\" ) fmap.LoadText( name_fmap.c_str() );\n                if( task == \"dump\" ) return;\n                if( task == \"pred\" || task == \"dumppath\" ){\n                    data.CacheLoad( test_path.c_str(), silent!=0, use_buffer!=0 );\n                }else{\n                    \/\/ training \n                    data.CacheLoad( train_path.c_str(), silent!=0, use_buffer!=0 );\n                    utils::Assert( eval_data_names.size() == eval_data_paths.size() );\n                    for( size_t i = 0; i < eval_data_names.size(); ++ i ){\n                        deval.push_back( new DMatrix() );\n                        deval.back()->CacheLoad( eval_data_paths[i].c_str(), silent!=0, use_buffer!=0 );\n                    }\n                }\n                learner.SetData( &data, deval, eval_data_names );\n            }\n            inline void InitLearner( void ){\n                cfg.BeforeFirst();\n                while( cfg.Next() ){\n                    learner.SetParam( cfg.name(), cfg.val() );\n                }\n                if( model_in != \"NULL\" ){\n                    utils::FileStream fi( utils::FopenCheck( model_in.c_str(), \"rb\") );\n                    learner.LoadModel( fi );\n                    fi.Close();\n                }else{\n                    utils::Assert( task == \"train\", \"model_in not specified\" );\n                    learner.InitModel();\n                }\n                learner.InitTrainer();\n            }\n            inline void TaskTrain( void ){\n                const time_t start    = time( NULL );\n                unsigned long elapsed = 0;\n                for( int i = 0; i < num_round; ++ i ){\n                    elapsed = (unsigned long)(time(NULL) - start); \n                    if( !silent ) printf(\"boosting round %d, %lu sec elapsed\\n\", i , elapsed );\n                    learner.UpdateOneIter( i );\n                    learner.EvalOneIter( i );\n                    if( save_period != 0 && (i+1) % save_period == 0 ){\n                        this->SaveModel( i );\n                    }\n                    elapsed = (unsigned long)(time(NULL) - start); \n                }\n                \/\/ always save final round\n                if( save_period == 0 || num_round % save_period != 0 ){\n                    if( model_out == \"NULL\" ){\n                        this->SaveModel( num_round - 1 );\n                    }else{\n                        this->SaveModel( model_out.c_str() );\n                    }\n                }\n                if( !silent ){\n                    printf(\"\\nupdating end, %lu sec in all\\n\", elapsed );\n                }\n            }\n            inline void TaskEval( void ){\n                learner.EvalOneIter( 0 );\n            }\n            inline void TaskInteractive( void ){\n                const time_t start    = time( NULL );\n                unsigned long elapsed = 0;\n                int batch_action = 0;\n                \n                cfg_batch.BeforeFirst();\n                while( cfg_batch.Next() ){\n                    if( !strcmp( cfg_batch.name(), \"run\" ) ){\n                        learner.UpdateInteract( interact_action );\n                        batch_action += 1;\n                    } else{\n                        learner.SetParam( cfg_batch.name(), cfg_batch.val() );\n                    }\n                }\n\n                if( batch_action == 0 ){\n                    learner.UpdateInteract( interact_action );\n                }\n                utils::Assert( model_out != \"NULL\", \"interactive mode must specify model_out\" );\n                this->SaveModel( model_out.c_str() );\n                elapsed = (unsigned long)(time(NULL) - start); \n\n                if( !silent ){\n                    printf(\"\\ninteractive update, %d batch actions, %lu sec in all\\n\", batch_action, elapsed );\n                }\n            }\n\n            inline void TaskDump( void ){\n                FILE *fo = utils::FopenCheck( name_dump.c_str(), \"w\" );\n                learner.DumpModel( fo, fmap, dump_model_stats != 0 );\n                fclose( fo );\n            }\n            inline void TaskDumpPath( void ){\n                FILE *fo = utils::FopenCheck( name_dumppath.c_str(), \"w\" );\n                learner.DumpPath( fo, data );\n                fclose( fo );\n            }\n            inline void SaveModel( const char *fname ) const{\n                utils::FileStream fo( utils::FopenCheck( fname, \"wb\" ) );\n                learner.SaveModel( fo );\n                fo.Close();\n            }\n            inline void SaveModel( int i ) const{\n                char fname[256];\n                sprintf( fname ,\"%s\/%04d.model\", model_dir_path.c_str(), i+1 );\n                this->SaveModel( fname );\n            }\n            inline void TaskPred( void ){\n                std::vector<float> preds;\n                if( !silent ) printf(\"start prediction...\\n\");\n                learner.Predict( preds, data );\n                if( !silent ) printf(\"writing prediction to %s\\n\", name_pred.c_str() );\n                FILE *fo = utils::FopenCheck( name_pred.c_str(), \"w\" );\n                for( size_t i = 0; i < preds.size(); i ++ ){\n                    fprintf( fo, \"%f\\n\", preds[i] );\n                }\n                fclose( fo );                \n            }\n        private:\n            \/* \\brief whether silent *\/\n            int silent;\n            \/* \\brief whether use auto binary buffer *\/\n            int use_buffer;\n            \/* \\brief number of boosting iterations *\/\n            int num_round;            \n            \/* \\brief the period to save the model, 0 means only save the final round model *\/\n            int save_period;\n            \/*! \\brief interfact action *\/\n            std::string interact_action;\n            \/* \\brief the path of training\/test data set *\/\n            std::string train_path, test_path;\n            \/* \\brief the path of test model file, or file to restart training *\/\n            std::string model_in;\n            \/* \\brief the path of final model file, to be saved *\/\n            std::string model_out;\n            \/* \\brief the path of directory containing the saved models *\/\n            std::string model_dir_path;\n            \/* \\brief task to perform *\/\n            std::string task;\n            \/* \\brief name of predict file *\/\n            std::string name_pred;\n            \/* \\brief whether dump statistics along with model *\/\n            int dump_model_stats;\n            \/* \\brief name of feature map *\/\n            std::string name_fmap;\n            \/* \\brief name of dump file *\/\n            std::string name_dump;\n            \/* \\brief name of dump path file *\/\n            std::string name_dumppath;\n            \/* \\brief the paths of validation data sets *\/\n            std::vector<std::string> eval_data_paths;            \n            \/* \\brief the names of the evaluation data used in output log *\/\n            std::vector<std::string> eval_data_names;            \n            \/*! \\brief saves configurations *\/\n            utils::ConfigSaver cfg;\n            \/*! \\brief batch configurations *\/\n            utils::ConfigSaver cfg_batch;\n        private:\n            DMatrix data;\n            std::vector<DMatrix*> deval;\n            utils::FeatMap fmap;\n            RegBoostLearner learner;\n        };\n    };\n};\n\n<commit_msg>add deleted main back<commit_after>#define _CRT_SECURE_NO_WARNINGS\n#define _CRT_SECURE_NO_DEPRECATE\n\n#include <ctime>\n#include <string>\n#include <cstring>\n#include \"xgboost_reg.h\"\n#include \"..\/utils\/xgboost_fmap.h\"\n#include \"..\/utils\/xgboost_random.h\"\n#include \"..\/utils\/xgboost_config.h\"\n\nnamespace xgboost{\n    namespace regression{\n        \/*!\n        * \\brief wrapping the training process of the gradient boosting regression model,\n        *   given the configuation\n        * \\author Kailong Chen: chenkl198812@gmail.com, Tianqi Chen: tianqi.chen@gmail.com\n        *\/\n        class RegBoostTask{            \n        public:\n            inline int Run( int argc, char *argv[] ){\n                if( argc < 2 ){\n                    printf(\"Usage: <config>\\n\"); \n                    return 0;\n                }\n                utils::ConfigIterator itr( argv[1] );\n                while( itr.Next() ){\n                    this->SetParam( itr.name(), itr.val() );\n                }\n                for( int i = 2; i < argc; i ++ ){\n                    char name[256], val[256];\n                    if( sscanf( argv[i], \"%[^=]=%s\", name, val ) == 2 ){\n                        this->SetParam( name, val );\n                    }\n                }\n                this->InitData();\n                this->InitLearner();\n                if( task == \"dump\" ){\n                    this->TaskDump();\n                    return 0;\n                }\n                if( task == \"interact\" ){\n                    this->TaskInteractive(); return 0;\n                }\n                if( task == \"dumppath\" ){\n                    this->TaskDumpPath(); return 0;\n                }\n                if( task == \"eval\" ){\n                    this->TaskEval(); return 0;\n                }\n                if( task == \"pred\" ){\n                    this->TaskPred();\n                }else{                  \n                    this->TaskTrain();\n                }\n                return 0;\n            }\n            inline void SetParam( const char *name, const char *val ){\n                if( !strcmp(\"silent\", name ) )       silent = atoi( val );\n                if( !strcmp(\"use_buffer\", name ) )   use_buffer = atoi( val );\n                if( !strcmp(\"seed\", name ) )         random::Seed( atoi(val) );\n                if( !strcmp(\"num_round\", name ) )    num_round = atoi( val );\n                if( !strcmp(\"save_period\", name ) )  save_period = atoi( val );\n                if( !strcmp(\"task\", name ) )         task = val;\n                if( !strcmp(\"data\",  name ) )        train_path = val;\n                if( !strcmp(\"test:data\",  name ) )   test_path  = val;\n                if( !strcmp(\"model_in\",  name ) )    model_in   = val;\n                if( !strcmp(\"model_out\",  name ) )   model_out   = val;\n                if( !strcmp(\"model_dir\", name ) )    model_dir_path = val;\n                if( !strcmp(\"fmap\",  name ) )        name_fmap = val;\n                if( !strcmp(\"name_dump\",  name ) )   name_dump = val;\n                if( !strcmp(\"name_dumppath\",  name ) )   name_dumppath = val;\n                if( !strcmp(\"name_pred\",  name ) )   name_pred = val;\n                if( !strcmp(\"dump_stats\", name ) )   dump_model_stats = atoi( val );\n                if( !strcmp(\"interact:action\",  name ) )  interact_action = val;\n                if( !strncmp(\"batch:\",  name, 6 ) ){\n                    cfg_batch.PushBack( name + 6, val );\n                }\n                if( !strncmp(\"eval[\",  name, 5 ) ) {\n                    char evname[ 256 ];\n                    utils::Assert( sscanf( name, \"eval[%[^]]\", evname ) == 1, \"must specify evaluation name for display\");\n                    eval_data_names.push_back( std::string( evname ) );\n                    eval_data_paths.push_back( std::string( val ) );\n                }\n                cfg.PushBack( name, val );\n            }\n        public:\n            RegBoostTask( void ){\n                \/\/ default parameters\n                silent = 0;\n                use_buffer = 1;\n                num_round = 10;\n                save_period = 0;\n                dump_model_stats = 0;\n                task = \"train\";                \n                model_in = \"NULL\";\n                model_out = \"NULL\";\n                name_fmap = \"NULL\";\n                name_pred = \"pred.txt\";\n                name_dump = \"dump.txt\";\n                name_dumppath = \"dump.path.txt\";\n                model_dir_path = \".\/\";\n                interact_action = \"update\";\n            }\n            ~RegBoostTask( void ){\n                for( size_t i = 0; i < deval.size(); i ++ ){\n                    delete deval[i];\n                }\n            }\n        private:\n            inline void InitData( void ){\n                if( name_fmap != \"NULL\" ) fmap.LoadText( name_fmap.c_str() );\n                if( task == \"dump\" ) return;\n                if( task == \"pred\" || task == \"dumppath\" ){\n                    data.CacheLoad( test_path.c_str(), silent!=0, use_buffer!=0 );\n                }else{\n                    \/\/ training \n                    data.CacheLoad( train_path.c_str(), silent!=0, use_buffer!=0 );\n                    utils::Assert( eval_data_names.size() == eval_data_paths.size() );\n                    for( size_t i = 0; i < eval_data_names.size(); ++ i ){\n                        deval.push_back( new DMatrix() );\n                        deval.back()->CacheLoad( eval_data_paths[i].c_str(), silent!=0, use_buffer!=0 );\n                    }\n                }\n                learner.SetData( &data, deval, eval_data_names );\n            }\n            inline void InitLearner( void ){\n                cfg.BeforeFirst();\n                while( cfg.Next() ){\n                    learner.SetParam( cfg.name(), cfg.val() );\n                }\n                if( model_in != \"NULL\" ){\n                    utils::FileStream fi( utils::FopenCheck( model_in.c_str(), \"rb\") );\n                    learner.LoadModel( fi );\n                    fi.Close();\n                }else{\n                    utils::Assert( task == \"train\", \"model_in not specified\" );\n                    learner.InitModel();\n                }\n                learner.InitTrainer();\n            }\n            inline void TaskTrain( void ){\n                const time_t start    = time( NULL );\n                unsigned long elapsed = 0;\n                for( int i = 0; i < num_round; ++ i ){\n                    elapsed = (unsigned long)(time(NULL) - start); \n                    if( !silent ) printf(\"boosting round %d, %lu sec elapsed\\n\", i , elapsed );\n                    learner.UpdateOneIter( i );\n                    learner.EvalOneIter( i );\n                    if( save_period != 0 && (i+1) % save_period == 0 ){\n                        this->SaveModel( i );\n                    }\n                    elapsed = (unsigned long)(time(NULL) - start); \n                }\n                \/\/ always save final round\n                if( save_period == 0 || num_round % save_period != 0 ){\n                    if( model_out == \"NULL\" ){\n                        this->SaveModel( num_round - 1 );\n                    }else{\n                        this->SaveModel( model_out.c_str() );\n                    }\n                }\n                if( !silent ){\n                    printf(\"\\nupdating end, %lu sec in all\\n\", elapsed );\n                }\n            }\n            inline void TaskEval( void ){\n                learner.EvalOneIter( 0 );\n            }\n            inline void TaskInteractive( void ){\n                const time_t start    = time( NULL );\n                unsigned long elapsed = 0;\n                int batch_action = 0;\n                \n                cfg_batch.BeforeFirst();\n                while( cfg_batch.Next() ){\n                    if( !strcmp( cfg_batch.name(), \"run\" ) ){\n                        learner.UpdateInteract( interact_action );\n                        batch_action += 1;\n                    } else{\n                        learner.SetParam( cfg_batch.name(), cfg_batch.val() );\n                    }\n                }\n\n                if( batch_action == 0 ){\n                    learner.UpdateInteract( interact_action );\n                }\n                utils::Assert( model_out != \"NULL\", \"interactive mode must specify model_out\" );\n                this->SaveModel( model_out.c_str() );\n                elapsed = (unsigned long)(time(NULL) - start); \n\n                if( !silent ){\n                    printf(\"\\ninteractive update, %d batch actions, %lu sec in all\\n\", batch_action, elapsed );\n                }\n            }\n\n            inline void TaskDump( void ){\n                FILE *fo = utils::FopenCheck( name_dump.c_str(), \"w\" );\n                learner.DumpModel( fo, fmap, dump_model_stats != 0 );\n                fclose( fo );\n            }\n            inline void TaskDumpPath( void ){\n                FILE *fo = utils::FopenCheck( name_dumppath.c_str(), \"w\" );\n                learner.DumpPath( fo, data );\n                fclose( fo );\n            }\n            inline void SaveModel( const char *fname ) const{\n                utils::FileStream fo( utils::FopenCheck( fname, \"wb\" ) );\n                learner.SaveModel( fo );\n                fo.Close();\n            }\n            inline void SaveModel( int i ) const{\n                char fname[256];\n                sprintf( fname ,\"%s\/%04d.model\", model_dir_path.c_str(), i+1 );\n                this->SaveModel( fname );\n            }\n            inline void TaskPred( void ){\n                std::vector<float> preds;\n                if( !silent ) printf(\"start prediction...\\n\");\n                learner.Predict( preds, data );\n                if( !silent ) printf(\"writing prediction to %s\\n\", name_pred.c_str() );\n                FILE *fo = utils::FopenCheck( name_pred.c_str(), \"w\" );\n                for( size_t i = 0; i < preds.size(); i ++ ){\n                    fprintf( fo, \"%f\\n\", preds[i] );\n                }\n                fclose( fo );                \n            }\n        private:\n            \/* \\brief whether silent *\/\n            int silent;\n            \/* \\brief whether use auto binary buffer *\/\n            int use_buffer;\n            \/* \\brief number of boosting iterations *\/\n            int num_round;            \n            \/* \\brief the period to save the model, 0 means only save the final round model *\/\n            int save_period;\n            \/*! \\brief interfact action *\/\n            std::string interact_action;\n            \/* \\brief the path of training\/test data set *\/\n            std::string train_path, test_path;\n            \/* \\brief the path of test model file, or file to restart training *\/\n            std::string model_in;\n            \/* \\brief the path of final model file, to be saved *\/\n            std::string model_out;\n            \/* \\brief the path of directory containing the saved models *\/\n            std::string model_dir_path;\n            \/* \\brief task to perform *\/\n            std::string task;\n            \/* \\brief name of predict file *\/\n            std::string name_pred;\n            \/* \\brief whether dump statistics along with model *\/\n            int dump_model_stats;\n            \/* \\brief name of feature map *\/\n            std::string name_fmap;\n            \/* \\brief name of dump file *\/\n            std::string name_dump;\n            \/* \\brief name of dump path file *\/\n            std::string name_dumppath;\n            \/* \\brief the paths of validation data sets *\/\n            std::vector<std::string> eval_data_paths;            \n            \/* \\brief the names of the evaluation data used in output log *\/\n            std::vector<std::string> eval_data_names;            \n            \/*! \\brief saves configurations *\/\n            utils::ConfigSaver cfg;\n            \/*! \\brief batch configurations *\/\n            utils::ConfigSaver cfg_batch;\n        private:\n            DMatrix data;\n            std::vector<DMatrix*> deval;\n            utils::FeatMap fmap;\n            RegBoostLearner learner;\n        };\n    };\n};\n\nint main( int argc, char *argv[] ){\n    xgboost::random::Seed( 0 );\n    xgboost::regression::RegBoostTask tsk;\n    return tsk.Run( argc, argv );\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include <string>\n#include <vector>\n\n#define GLM_FORCE_RADIANS\n#include <glm\/glm.hpp>\n\n#include <glad\/glad.h>\n#include <GLFW\/glfw3.h>\n\n#include \"Mesh.h\"\n#include \"Model.h\"\n#include \"Shader.h\"\n#include \"Entity.h\"\n#include \"Window.h\"\n#include \"Texture.h\"\n#include \"Lighting.h\"\n#include \"DiffuseMaterial.h\"\n#include \"DeferredRenderer.h\"\n#include \"PerspectiveCamera.h\"\n\n#define WINDOW_WIDTH 1280\n#define WINDOW_HEIGHT 720\n\nextern \"C\" int main(int argc, char *argv[])\n{\n\t\/\/ DISPLAY & RENDERER\n\tWindow window(WINDOW_WIDTH, WINDOW_HEIGHT, \"Rendeer\");\n\tDeferredRenderer deferredRenderer(window);\n\n\t\/\/ CAMERA\n\tPerspectiveCamera camera(glm::vec3(0, 1.5f, -2.8f), glm::angleAxis(0.5f, glm::vec3(1, 0, 0)),\n\t\tglm::radians(70.0f), 1.0f, 1000.0f, window.GetAspectRatio());\n\n\t\/\/ TEAPOT\n\tModel teapotModel(\"models\/teapot\/teapot.obj\");\n\tMesh teapotMesh(teapotModel);\n\tTexture teapotTexture(\"textures\/default.png\");\n\tDiffuseMaterial teapotMaterial;\n\tteapotMaterial.diffuseTexture = &teapotTexture;\n\tEntity teapot(teapotMesh, teapotMaterial);\n\tteapot.GetTransform().SetScale(0.01f);\n\tteapot.GetTransform().SetPosition(glm::vec3(0, 0, 0));\n\n\t\/\/ TABLE\n\tModel tableModel(\"models\/table\/table.3ds\");\n\tMesh tableMesh(tableModel);\n\t\/\/Texture tableTexture(\"models\/table\/wood.jpg\");\n\tTexture tableTexture(\"textures\/default.png\");\n\tDiffuseMaterial tableMaterial;\n\ttableMaterial.diffuseTexture = &tableTexture;\n\tEntity table(tableMesh, tableMaterial);\n\ttable.GetTransform().SetScale(60.0f);\n\ttable.GetTransform().SetRotation(glm::angleAxis(1.57f, glm::vec3(1, 0, 0)));\n\t\n\t\/\/ FLOOR\n\tModel floorModel(\"models\/floor.obj\");\n\tMesh floorMesh(floorModel);\n\tTexture floorTexture(\"textures\/wood1.diffuse.png\");\n\tDiffuseMaterial floorMaterial;\n\tfloorMaterial.diffuseTexture = &floorTexture;\n\tEntity floor(floorMesh, floorMaterial);\n\tfloor.GetTransform().SetScale(1.0f);\n\tfloor.GetTransform().SetPosition(glm::vec3(0, -1, 10.0f));\n\n\t\/\/ ENTITIES\n\tstd::vector<Entity *> entities;\n\tentities.push_back(&teapot);\n\tentities.push_back(&table);\n\tentities.push_back(&floor);\n\n\t\/\/ DIRECTIONAL LIGHT\n\tDirectionalLight directionalLight(glm::quat(1, 1, 0, 1), glm::vec3(1.0f, 0.95f, 0.88f), 0.5f);\n\n\t\/\/ POINT LIGHT\n\tPointLight pointLight(glm::vec3(0, 1, 0), glm::vec3(1.0f, 0.1f, 0.15f), 1.0f);\n\n\t\/\/ LIGHTS\n\tstd::vector<ILight *> lights;\n\tlights.push_back(&directionalLight);\n\t\/\/lights.push_back(&pointLight);\n\n\t\/\/\/\/\/\/\/\/\/\/\n\t\/\/ LOOP \/\/\n\t\/\/\/\/\/\/\/\/\/\/\n\n\tdeferredRenderer.BindForUsage();\n\n\tfloat timer = 0.0f;\n\n\twhile (!window.IsCloseRequested())\n\t{\n\t\t\/\/ Start every frame by polling events\n\t\twindow.PollEvents();\n\n\t\t\/\/ Make the escape button quit the app\/close the window\n\t\tif (window.GetKeyboard().WasKeyPressed(GLFW_KEY_ESCAPE))\n\t\t{\n\t\t\tbreak;\n\t\t}\n\n\n\n\t\t\/*\n\n\t\t\/\/ Move the camera (for now in this very temporary solution)\n\t\tglm::vec3 translation = glm::vec3();\n\t\tfloat speed = 0.08f;\n\n\t\tconst Input input = display.GetInput();\n\t\tif (input.IsKeyDown(SDL_SCANCODE_W))\n\t\t{\n\t\t\ttranslation.z += speed;\n\t\t}\n\t\tif (input.IsKeyDown(SDL_SCANCODE_S))\n\t\t{\n\t\t\ttranslation.z -= speed;\n\t\t}\n\t\tif (input.IsKeyDown(SDL_SCANCODE_A))\n\t\t{\n\t\t\ttranslation.x -= speed;\n\t\t}\n\t\tif (input.IsKeyDown(SDL_SCANCODE_D))\n\t\t{\n\t\t\ttranslation.x += speed;\n\t\t}\n\t\tif (input.IsKeyDown(SDL_SCANCODE_SPACE))\n\t\t{\n\t\t\ttranslation.y += speed;\n\t\t}\n\t\tif (input.IsKeyDown(SDL_SCANCODE_LSHIFT))\n\t\t{\n\t\t\ttranslation.y -= speed;\n\t\t}\n\n\t\tglm::vec3 newPosition = camera.GetTransform().GetPosition() + translation;\n\t\tcamera.GetTransform().SetPosition(newPosition);\n\n\t\t*\/\n\n\n\n\n\n\t\ttimer += 0.3f;\n\t\tteapot.GetTransform().SetRotation(glm::vec3(0, 1, 0), timer * 0.1f);\n\t\tteapot.GetTransform().SetPosition(glm::vec3(sinf(timer \/ 10), 0, 0));\n\n\t\t\/\/pointLight.GetTransform()->SetPosition(glm::vec3(0, 2, 0));\n\n\t\t\/\/table.GetTransform()->SetScale(timer * 0.3f);\n\t\t\/\/printf(\"%f\\n\", timer * 0.3f);\n\n\t\ttable.GetTransform().SetPosition(glm::vec3(0, 0, sinf(timer \/ 15) * 4 + 2.5));\n\n\t\t\/\/ Try rotating it properly. Quaternions are complicated...\n\t\t\/\/directionalLight.GetTransform()->Rotate ...;\n\n\t\tdeferredRenderer.Render(entities, lights, camera);\n\t}\n\n\treturn 0;\n}\n\n\n\n\n\n\n\n\/*\n\n\/\/ BLUE MATERIAL\nunsigned char bluePixels[4 * 4 * 3] = {\n47, 12, 255, 0, 143, 255, 10, 20, 200, 100, 85, 240,\n0, 143, 255, 10, 20, 200, 100, 85, 240, 47, 12, 255,\n10, 20, 200, 100, 85, 240, 47, 12, 255, 0, 143, 255,\n100, 85, 240, 47, 12, 255, 0, 143, 255, 10, 20, 200\n};\nTexture blueTexture(4, 4, GL_RGB, GL_REPEAT,\nGL_NEAREST, GL_NEAREST_MIPMAP_NEAREST, bluePixels);\nMaterial blueMaterial;\nblueMaterial.diffuseTexture = &blueTexture;\n\n*\/\n\n#if 0\n\/\/ MESH\nVertex vertices[6] = {\n\tVertex(glm::vec3(-1, -1, 0), glm::vec2(0.0, 0.0)),  \/\/ bot left\n\tVertex(glm::vec3(-1, +1, 0), glm::vec2(0.0, 1.0)),  \/\/ top left\n\n\tVertex(glm::vec3(+0, -1, -1), glm::vec2(1.0, 0.0)), \/\/ bot mid\n\tVertex(glm::vec3(+0, +1, -1), glm::vec2(1.0, 1.0)), \/\/ top mid\n\n\tVertex(glm::vec3(+1, -1, 0), glm::vec2(2.0, 0.0)),  \/\/ bot right\n\tVertex(glm::vec3(+1, +1, 0), glm::vec2(2.0, 1.0))   \/\/ top right\n};\nint indices[12] = { 0, 1, 2, 1, 3, 2, 2, 3, 5, 2, 5, 4 };\n\nModel angleModel;\nangleModel.positions.push_back(*vertices[0].GetPosition());\nangleModel.positions.push_back(*vertices[1].GetPosition());\nangleModel.positions.push_back(*vertices[2].GetPosition());\nangleModel.positions.push_back(*vertices[3].GetPosition());\nangleModel.positions.push_back(*vertices[4].GetPosition());\nangleModel.positions.push_back(*vertices[5].GetPosition());\n\nangleModel.texCoords.push_back(*vertices[0].GetTexCoord());\nangleModel.texCoords.push_back(*vertices[1].GetTexCoord());\nangleModel.texCoords.push_back(*vertices[2].GetTexCoord());\nangleModel.texCoords.push_back(*vertices[3].GetTexCoord());\nangleModel.texCoords.push_back(*vertices[4].GetTexCoord());\nangleModel.texCoords.push_back(*vertices[5].GetTexCoord());\n\nangleModel.indices.push_back(0); angleModel.indices.push_back(1); angleModel.indices.push_back(2);\nangleModel.indices.push_back(1); angleModel.indices.push_back(3); angleModel.indices.push_back(2);\nangleModel.indices.push_back(2); angleModel.indices.push_back(3); angleModel.indices.push_back(5);\nangleModel.indices.push_back(2); angleModel.indices.push_back(5); angleModel.indices.push_back(4);\nMesh angleMesh(angleModel);\n\n\/\/ DOG MATERIAL\nTexture dogTexture(\"textures\/dog.png\", GL_LINEAR, GL_REPEAT);\nMaterial dogMaterial;\ndogMaterial.diffuseTexture = &dogTexture;\n\n\/\/ ENTITY\nEntity angleEntity(angleMesh, dogMaterial);\nangleEntity.GetTransform()->SetPosition(glm::vec3(0, 0, 0));\n#endif<commit_msg>Also integrated the new input system<commit_after>\n#include <string>\n#include <vector>\n\n#define GLM_FORCE_RADIANS\n#include <glm\/glm.hpp>\n\n#include <glad\/glad.h>\n#include <GLFW\/glfw3.h>\n\n#include \"Mesh.h\"\n#include \"Model.h\"\n#include \"Shader.h\"\n#include \"Entity.h\"\n#include \"Window.h\"\n#include \"Texture.h\"\n#include \"Lighting.h\"\n#include \"DiffuseMaterial.h\"\n#include \"DeferredRenderer.h\"\n#include \"PerspectiveCamera.h\"\n\n#define WINDOW_WIDTH 1280\n#define WINDOW_HEIGHT 720\n\nextern \"C\" int main(int argc, char *argv[])\n{\n\t\/\/ DISPLAY & RENDERER\n\tWindow window(WINDOW_WIDTH, WINDOW_HEIGHT, \"Rendeer\");\n\tDeferredRenderer deferredRenderer(window);\n\n\t\/\/ CAMERA\n\tPerspectiveCamera camera(glm::vec3(0, 1.5f, -2.8f), glm::angleAxis(0.5f, glm::vec3(1, 0, 0)),\n\t\tglm::radians(70.0f), 1.0f, 1000.0f, window.GetAspectRatio());\n\n\t\/\/ TEAPOT\n\tModel teapotModel(\"models\/teapot\/teapot.obj\");\n\tMesh teapotMesh(teapotModel);\n\tTexture teapotTexture(\"textures\/default.png\");\n\tDiffuseMaterial teapotMaterial;\n\tteapotMaterial.diffuseTexture = &teapotTexture;\n\tEntity teapot(teapotMesh, teapotMaterial);\n\tteapot.GetTransform().SetScale(0.01f);\n\tteapot.GetTransform().SetPosition(glm::vec3(0, 0, 0));\n\n\t\/\/ TABLE\n\tModel tableModel(\"models\/table\/table.3ds\");\n\tMesh tableMesh(tableModel);\n\t\/\/Texture tableTexture(\"models\/table\/wood.jpg\");\n\tTexture tableTexture(\"textures\/default.png\");\n\tDiffuseMaterial tableMaterial;\n\ttableMaterial.diffuseTexture = &tableTexture;\n\tEntity table(tableMesh, tableMaterial);\n\ttable.GetTransform().SetScale(60.0f);\n\ttable.GetTransform().SetRotation(glm::angleAxis(1.57f, glm::vec3(1, 0, 0)));\n\t\n\t\/\/ FLOOR\n\tModel floorModel(\"models\/floor.obj\");\n\tMesh floorMesh(floorModel);\n\tTexture floorTexture(\"textures\/wood1.diffuse.png\");\n\tDiffuseMaterial floorMaterial;\n\tfloorMaterial.diffuseTexture = &floorTexture;\n\tEntity floor(floorMesh, floorMaterial);\n\tfloor.GetTransform().SetScale(1.0f);\n\tfloor.GetTransform().SetPosition(glm::vec3(0, -1, 10.0f));\n\n\t\/\/ ENTITIES\n\tstd::vector<Entity *> entities;\n\tentities.push_back(&teapot);\n\tentities.push_back(&table);\n\tentities.push_back(&floor);\n\n\t\/\/ DIRECTIONAL LIGHT\n\tDirectionalLight directionalLight(glm::quat(1, 1, 0, 1), glm::vec3(1.0f, 0.95f, 0.88f), 0.5f);\n\n\t\/\/ POINT LIGHT\n\tPointLight pointLight(glm::vec3(0, 1, 0), glm::vec3(1.0f, 0.1f, 0.15f), 1.0f);\n\n\t\/\/ LIGHTS\n\tstd::vector<ILight *> lights;\n\tlights.push_back(&directionalLight);\n\t\/\/lights.push_back(&pointLight);\n\n\t\/\/\/\/\/\/\/\/\/\/\n\t\/\/ LOOP \/\/\n\t\/\/\/\/\/\/\/\/\/\/\n\n\tdeferredRenderer.BindForUsage();\n\n\tfloat timer = 0.0f;\n\n\twhile (!window.IsCloseRequested())\n\t{\n\t\t\/\/ Start every frame by polling events\n\t\twindow.PollEvents();\n\n\t\t\/\/ Make the escape button quit the app\/close the window\n\t\tif (window.GetKeyboard().WasKeyPressed(GLFW_KEY_ESCAPE))\n\t\t{\n\t\t\tbreak;\n\t\t}\n\n\n\n\t\t\n\t\t\/\/ Move the camera (for now in this very temporary solution)\n\t\tglm::vec3 translation = glm::vec3();\n\t\tfloat speed = 0.08f;\n\n\t\tconst Keyboard keyboard = window.GetKeyboard();\n\t\tif (keyboard.IsKeyDown(GLFW_KEY_W))\n\t\t{\n\t\t\ttranslation.z += speed;\n\t\t}\n\t\tif (keyboard.IsKeyDown(GLFW_KEY_S))\n\t\t{\n\t\t\ttranslation.z -= speed;\n\t\t}\n\t\tif (keyboard.IsKeyDown(GLFW_KEY_A))\n\t\t{\n\t\t\ttranslation.x -= speed;\n\t\t}\n\t\tif (keyboard.IsKeyDown(GLFW_KEY_D))\n\t\t{\n\t\t\ttranslation.x += speed;\n\t\t}\n\t\tif (keyboard.IsKeyDown(GLFW_KEY_SPACE))\n\t\t{\n\t\t\ttranslation.y += speed;\n\t\t}\n\t\tif (keyboard.IsKeyDown(GLFW_KEY_LEFT_SHIFT))\n\t\t{\n\t\t\ttranslation.y -= speed;\n\t\t}\n\n\t\tglm::vec3 newPosition = camera.GetTransform().GetPosition() + translation;\n\t\tcamera.GetTransform().SetPosition(newPosition);\n\n\n\n\n\n\t\ttimer += 0.3f;\n\t\tteapot.GetTransform().SetRotation(glm::vec3(0, 1, 0), timer * 0.1f);\n\t\tteapot.GetTransform().SetPosition(glm::vec3(sinf(timer \/ 10), 0, 0));\n\n\t\t\/\/pointLight.GetTransform()->SetPosition(glm::vec3(0, 2, 0));\n\n\t\t\/\/table.GetTransform()->SetScale(timer * 0.3f);\n\t\t\/\/printf(\"%f\\n\", timer * 0.3f);\n\n\t\ttable.GetTransform().SetPosition(glm::vec3(0, 0, sinf(timer \/ 15) * 4 + 2.5));\n\n\t\t\/\/ Try rotating it properly. Quaternions are complicated...\n\t\t\/\/directionalLight.GetTransform()->Rotate ...;\n\n\t\tdeferredRenderer.Render(entities, lights, camera);\n\t}\n\n\treturn 0;\n}\n\n\n\n\n\n\n\n\/*\n\n\/\/ BLUE MATERIAL\nunsigned char bluePixels[4 * 4 * 3] = {\n47, 12, 255, 0, 143, 255, 10, 20, 200, 100, 85, 240,\n0, 143, 255, 10, 20, 200, 100, 85, 240, 47, 12, 255,\n10, 20, 200, 100, 85, 240, 47, 12, 255, 0, 143, 255,\n100, 85, 240, 47, 12, 255, 0, 143, 255, 10, 20, 200\n};\nTexture blueTexture(4, 4, GL_RGB, GL_REPEAT,\nGL_NEAREST, GL_NEAREST_MIPMAP_NEAREST, bluePixels);\nMaterial blueMaterial;\nblueMaterial.diffuseTexture = &blueTexture;\n\n*\/\n\n#if 0\n\/\/ MESH\nVertex vertices[6] = {\n\tVertex(glm::vec3(-1, -1, 0), glm::vec2(0.0, 0.0)),  \/\/ bot left\n\tVertex(glm::vec3(-1, +1, 0), glm::vec2(0.0, 1.0)),  \/\/ top left\n\n\tVertex(glm::vec3(+0, -1, -1), glm::vec2(1.0, 0.0)), \/\/ bot mid\n\tVertex(glm::vec3(+0, +1, -1), glm::vec2(1.0, 1.0)), \/\/ top mid\n\n\tVertex(glm::vec3(+1, -1, 0), glm::vec2(2.0, 0.0)),  \/\/ bot right\n\tVertex(glm::vec3(+1, +1, 0), glm::vec2(2.0, 1.0))   \/\/ top right\n};\nint indices[12] = { 0, 1, 2, 1, 3, 2, 2, 3, 5, 2, 5, 4 };\n\nModel angleModel;\nangleModel.positions.push_back(*vertices[0].GetPosition());\nangleModel.positions.push_back(*vertices[1].GetPosition());\nangleModel.positions.push_back(*vertices[2].GetPosition());\nangleModel.positions.push_back(*vertices[3].GetPosition());\nangleModel.positions.push_back(*vertices[4].GetPosition());\nangleModel.positions.push_back(*vertices[5].GetPosition());\n\nangleModel.texCoords.push_back(*vertices[0].GetTexCoord());\nangleModel.texCoords.push_back(*vertices[1].GetTexCoord());\nangleModel.texCoords.push_back(*vertices[2].GetTexCoord());\nangleModel.texCoords.push_back(*vertices[3].GetTexCoord());\nangleModel.texCoords.push_back(*vertices[4].GetTexCoord());\nangleModel.texCoords.push_back(*vertices[5].GetTexCoord());\n\nangleModel.indices.push_back(0); angleModel.indices.push_back(1); angleModel.indices.push_back(2);\nangleModel.indices.push_back(1); angleModel.indices.push_back(3); angleModel.indices.push_back(2);\nangleModel.indices.push_back(2); angleModel.indices.push_back(3); angleModel.indices.push_back(5);\nangleModel.indices.push_back(2); angleModel.indices.push_back(5); angleModel.indices.push_back(4);\nMesh angleMesh(angleModel);\n\n\/\/ DOG MATERIAL\nTexture dogTexture(\"textures\/dog.png\", GL_LINEAR, GL_REPEAT);\nMaterial dogMaterial;\ndogMaterial.diffuseTexture = &dogTexture;\n\n\/\/ ENTITY\nEntity angleEntity(angleMesh, dogMaterial);\nangleEntity.GetTransform()->SetPosition(glm::vec3(0, 0, 0));\n#endif<|endoftext|>"}
{"text":"<commit_before>\/*!\n * \\file bounding_box.hpp\n * \\brief file bounding_box.hpp\n *\n * Copyright 2016 by Intel.\n *\n * Contact: kevin.rogovin@intel.com\n *\n * This Source Code Form is subject to the\n * terms of the Mozilla Public License, v. 2.0.\n * If a copy of the MPL was not distributed with\n * this file, You can obtain one at\n * http:\/\/mozilla.org\/MPL\/2.0\/.\n *\n * \\author Kevin Rogovin <kevin.rogovin@intel.com>\n *\n *\/\n\n\n#pragma once\n\n#include <fastuidraw\/util\/vecN.hpp>\n\nnamespace fastuidraw\n{\n  \/*!\n   * Simple bounding box class\n   *\/\n  template<typename T>\n  class BoundingBox\n  {\n  public:\n    typedef vecN<T, 2> pt_type;\n\n    BoundingBox(void):\n      m_min(T(0), T(0)),\n      m_max(T(0), T(0)),\n      m_empty(true)\n    {}\n\n    BoundingBox(pt_type pmin, pt_type pmax):\n      m_min(pmin),\n      m_max(pmax),\n      m_empty(false)\n    {\n      FASTUIDRAWassert(pmin.x() <= pmax.x());\n      FASTUIDRAWassert(pmin.y() <= pmax.y());\n    }\n\n    void\n    inflated_polygon(vecN<pt_type, 4> &out_data, T rad) const\n    {\n      FASTUIDRAWassert(!m_empty);\n      out_data[0] = pt_type(m_min.x() - rad, m_min.y() - rad);\n      out_data[1] = pt_type(m_max.x() + rad, m_min.y() - rad);\n      out_data[2] = pt_type(m_max.x() + rad, m_max.y() + rad);\n      out_data[3] = pt_type(m_min.x() - rad, m_max.y() + rad);\n    }\n\n    void\n    enlarge(pt_type delta)\n    {\n      if (!m_empty)\n        {\n          m_min -= delta;\n          m_max += delta;\n        }\n    }\n\n    void\n    enlarge(pt_type delta, BoundingBox *dst) const\n    {\n      dst->m_min = m_min;\n      dst->m_max = m_max;\n      dst->m_empty = m_empty;\n      dst->enlarge(delta);\n    }\n\n    void\n    translate(const pt_type &tr)\n    {\n      if (!m_empty)\n        {\n          m_min += tr;\n          m_max += tr;\n        }\n    }\n\n    void\n    scale_down(const pt_type &tr)\n    {\n      if (!m_empty)\n        {\n          m_min \/= tr;\n          m_max \/= tr;\n        }\n    }\n\n    void\n    scale_up(const pt_type &tr)\n    {\n      if (!m_empty)\n        {\n          m_min *= tr;\n          m_max *= tr;\n        }\n    }\n\n    bool \/\/returns true if box became larger\n    union_point(const pt_type &pt)\n    {\n      bool R;\n\n      R = !contains(pt);\n      if (m_empty)\n        {\n          m_empty = false;\n          m_min = m_max = pt;\n        }\n      else\n        {\n          m_min.x() = t_min(m_min.x(), pt.x());\n          m_min.y() = t_min(m_min.y(), pt.y());\n\n          m_max.x() = t_max(m_max.x(), pt.x());\n          m_max.y() = t_max(m_max.y(), pt.y());\n        }\n      return R;\n    }\n\n    template<typename iterator>\n    bool\n    union_points(iterator begin, iterator end)\n    {\n      bool R(false);\n      for(; begin != end; ++begin)\n        {\n          R = union_point(*begin) || R;\n        }\n      return R;\n    }\n\n    bool\n    union_box(const BoundingBox &b)\n    {\n      if (!b.m_empty)\n        {\n\t  bool r0, r1;\n          r0 = union_point(b.m_min);\n          r1 = union_point(b.m_max);\n\t  return r0 || r1;\n        }\n      return false;\n    }\n\n    pt_type\n    size(void) const\n    {\n      return m_empty ?\n        pt_type(T(0), T(0)) :\n        m_max - m_min;\n    }\n\n    bool\n    empty(void) const\n    {\n      return m_empty;\n    }\n\n    const pt_type&\n    min_point(void) const\n    {\n      return m_min;\n    }\n\n    const pt_type&\n    max_point(void) const\n    {\n      return m_max;\n    }\n\n    pt_type\n    center_point(void) const\n    {\n      return (m_min + m_max) \/ T(2);\n    }\n\n    pt_type\n    corner_point(bool max_x, bool max_y) const\n    {\n      pt_type R;\n\n      R.x() = (max_x) ? m_max.x() : m_min.x();\n      R.y() = (max_y) ? m_max.y() : m_min.y();\n      return R;\n    }\n\n    vecN<BoundingBox<T>, 2>\n    split_x(void) const\n    {\n      vecN<BoundingBox<T>, 2> R;\n\n      if (empty())\n        {\n          return R;\n        }\n\n      pt_type center;\n\n      center = center_point();\n      R[0] = BoundingBox(m_min, pt_type(center.x(), m_max.y()));\n      R[1] = BoundingBox(pt_type(center.x(), m_min.y()), m_max);\n      return R;\n    }\n\n    vecN<BoundingBox<T>, 2>\n    split_y(void) const\n    {\n      vecN<BoundingBox<T>, 2> R;\n\n      if (empty())\n        {\n          return R;\n        }\n\n      pt_type center;\n\n      center = center_point();\n      R[0] = BoundingBox(m_min, pt_type(m_max.x(), center.y()));\n      R[1] = BoundingBox(pt_type(m_min.x(), center.y()), m_max);\n      return R;\n    }\n\n    bool\n    intersects(const BoundingBox &obj) const\n    {\n      return !m_empty &&\n        !(obj.m_min.x() > m_max.x()\n          || m_min.x() > obj.m_max.x()\n          || obj.m_min.y() > m_max.y()\n          || m_min.y() > obj.m_max.y());\n    }\n\n    bool\n    contains(const pt_type &p) const\n    {\n      return !m_empty\n        && p.x() >= m_min.x()\n        && p.x() <= m_max.x()\n        && p.y() >= m_min.y()\n        && p.y() <= m_max.y();\n    }\n\n  private:\n    pt_type m_min, m_max;\n    bool m_empty;\n  };\n}\n<commit_msg>fastuidraw\/private\/bounding_box: have BoundingBox derived from RectT<commit_after>\/*!\n * \\file bounding_box.hpp\n * \\brief file bounding_box.hpp\n *\n * Copyright 2016 by Intel.\n *\n * Contact: kevin.rogovin@intel.com\n *\n * This Source Code Form is subject to the\n * terms of the Mozilla Public License, v. 2.0.\n * If a copy of the MPL was not distributed with\n * this file, You can obtain one at\n * http:\/\/mozilla.org\/MPL\/2.0\/.\n *\n * \\author Kevin Rogovin <kevin.rogovin@intel.com>\n *\n *\/\n\n\n#pragma once\n\n#include <fastuidraw\/util\/vecN.hpp>\n#include <fastuidraw\/util\/rect.hpp>\n\nnamespace fastuidraw\n{\n  \/*!\n   * Simple bounding box class\n   *\/\n  template<typename T>\n  class BoundingBox:private RectT<T>\n  {\n  public:\n    typedef vecN<T, 2> pt_type;\n\n    BoundingBox(void):\n      m_empty(true)\n    {\n      this->m_min_point = this->m_max_point = pt_type(T(0), T(0));\n    }\n\n    BoundingBox(pt_type pmin, pt_type pmax):\n      m_empty(false)\n    {\n      FASTUIDRAWassert(pmin.x() <= pmax.x());\n      FASTUIDRAWassert(pmin.y() <= pmax.y());\n      this->m_min_point = pmin;\n      this->m_max_point = pmax;\n    }\n\n    template<typename S>\n    explicit\n    BoundingBox(const RectT<S> &rect):\n      RectT<T>(rect),\n      m_empty(false)\n    {\n      FASTUIDRAWassert(this->m_min_point.x() <= this->m_max_point.x());\n      FASTUIDRAWassert(this->m_min_point.y() <= this->m_max_point.y());\n    }\n\n    void\n    inflated_polygon(vecN<pt_type, 4> &out_data, T rad) const\n    {\n      FASTUIDRAWassert(!m_empty);\n      out_data[0] = pt_type(this->m_min_point.x() - rad, this->m_min_point.y() - rad);\n      out_data[1] = pt_type(this->m_max_point.x() + rad, this->m_min_point.y() - rad);\n      out_data[2] = pt_type(this->m_max_point.x() + rad, this->m_max_point.y() + rad);\n      out_data[3] = pt_type(this->m_min_point.x() - rad, this->m_max_point.y() + rad);\n    }\n\n    void\n    enlarge(pt_type delta)\n    {\n      if (!m_empty)\n        {\n          this->m_min_point -= delta;\n          this->m_max_point += delta;\n        }\n    }\n\n    void\n    enlarge(pt_type delta, BoundingBox *dst) const\n    {\n      dst->m_min_point = this->m_min_point;\n      dst->m_max_point = this->m_max_point;\n      dst->m_empty = m_empty;\n      dst->enlarge(delta);\n    }\n\n    void\n    translate(const pt_type &tr)\n    {\n      if (!m_empty)\n        {\n          this->m_min_point += tr;\n          this->m_max_point += tr;\n        }\n    }\n\n    void\n    scale_down(const pt_type &tr)\n    {\n      if (!m_empty)\n        {\n          this->m_min_point \/= tr;\n          this->m_max_point \/= tr;\n        }\n    }\n\n    void\n    scale_up(const pt_type &tr)\n    {\n      if (!m_empty)\n        {\n          this->m_min_point *= tr;\n          this->m_max_point *= tr;\n        }\n    }\n\n    bool \/\/returns true if box became larger\n    union_point(const pt_type &pt)\n    {\n      bool R;\n\n      R = !contains(pt);\n      if (m_empty)\n        {\n          m_empty = false;\n          this->m_min_point = this->m_max_point = pt;\n        }\n      else\n        {\n          this->m_min_point.x() = t_min(this->m_min_point.x(), pt.x());\n          this->m_min_point.y() = t_min(this->m_min_point.y(), pt.y());\n\n          this->m_max_point.x() = t_max(this->m_max_point.x(), pt.x());\n          this->m_max_point.y() = t_max(this->m_max_point.y(), pt.y());\n        }\n      return R;\n    }\n\n    template<typename iterator>\n    bool\n    union_points(iterator begin, iterator end)\n    {\n      bool R(false);\n      for(; begin != end; ++begin)\n        {\n          R = union_point(*begin) || R;\n        }\n      return R;\n    }\n\n    bool\n    union_box(const BoundingBox &b)\n    {\n      if (!b.m_empty)\n        {\n\t  bool r0, r1;\n          r0 = union_point(b.m_min_point);\n          r1 = union_point(b.m_max_point);\n\t  return r0 || r1;\n        }\n      return false;\n    }\n\n    pt_type\n    size(void) const\n    {\n      return m_empty ?\n        pt_type(T(0), T(0)) :\n        this->m_max_point - this->m_min_point;\n    }\n\n    bool\n    empty(void) const\n    {\n      return m_empty;\n    }\n\n    const pt_type&\n    min_point(void) const\n    {\n      return this->m_min_point;\n    }\n\n    const pt_type&\n    max_point(void) const\n    {\n      return this->m_max_point;\n    }\n\n    pt_type\n    center_point(void) const\n    {\n      return (this->m_min_point + this->m_max_point) \/ T(2);\n    }\n\n    pt_type\n    corner_point(bool max_x, bool max_y) const\n    {\n      pt_type R;\n\n      R.x() = (max_x) ? this->m_max_point.x() : this->m_min_point.x();\n      R.y() = (max_y) ? this->m_max_point.y() : this->m_min_point.y();\n      return R;\n    }\n\n    vecN<BoundingBox<T>, 2>\n    split_x(void) const\n    {\n      vecN<BoundingBox<T>, 2> R;\n\n      if (empty())\n        {\n          return R;\n        }\n\n      pt_type center;\n\n      center = center_point();\n      R[0] = BoundingBox(this->m_min_point, pt_type(center.x(), this->m_max_point.y()));\n      R[1] = BoundingBox(pt_type(center.x(), this->m_min_point.y()), this->m_max_point);\n      return R;\n    }\n\n    vecN<BoundingBox<T>, 2>\n    split_y(void) const\n    {\n      vecN<BoundingBox<T>, 2> R;\n\n      if (empty())\n        {\n          return R;\n        }\n\n      pt_type center;\n\n      center = center_point();\n      R[0] = BoundingBox(this->m_min_point, pt_type(this->m_max_point.x(), center.y()));\n      R[1] = BoundingBox(pt_type(this->m_min_point.x(), center.y()), this->m_max_point);\n      return R;\n    }\n\n    bool\n    intersects(const BoundingBox &obj) const\n    {\n      return !m_empty &&\n        !(obj.m_min_point.x() > this->m_max_point.x()\n          || this->m_min_point.x() > obj.m_max_point.x()\n          || obj.m_min_point.y() > this->m_max_point.y()\n          || this->m_min_point.y() > obj.m_max_point.y());\n    }\n\n    bool\n    contains(const pt_type &p) const\n    {\n      return !m_empty\n        && p.x() >= this->m_min_point.x()\n        && p.x() <= this->m_max_point.x()\n        && p.y() >= this->m_min_point.y()\n        && p.y() <= this->m_max_point.y();\n    }\n\n    const RectT<T>&\n    as_rect(void) const\n    {\n      return *this;\n    }\n\n  private:\n    bool m_empty;\n  };\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Software License Agreement (BSD License)\n *\n *  Copyright (c) 2011, Willow Garage, Inc.\n *  All rights reserved.\n *\n *  Redistribution and use in source and binary forms, with or without\n *  modification, are permitted provided that the following conditions\n *  are met:\n *\n *   * Redistributions of source code must retain the above copyright\n *     notice, this list of conditions and the following disclaimer.\n *   * Redistributions in binary form must reproduce the above\n *     copyright notice, this list of conditions and the following\n *     disclaimer in the documentation and\/or other materials provided\n *     with the distribution.\n *   * Neither the name of Willow Garage, Inc. nor the names of its\n *     contributors may be used to endorse or promote products derived\n *     from this software without specific prior written permission.\n *\n *  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n *  \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n *  LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n *  FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n *  COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n *  INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n *  BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n *  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n *  CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n *  LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n *  ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n *  POSSIBILITY OF SUCH DAMAGE.\n *\n * Author: Radu B. Rusu, Suat Gedikli\n *\n *\/\n#include <pcl\/io\/pcd_grabber.h>\n#include <pcl\/console\/parse.h>\n#define BOOST_FILESYSTEM_VERSION 2\n#include <boost\/filesystem.hpp>\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/thread\/thread.hpp>\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n#include <pcl\/console\/print.h>\n#include <pcl\/visualization\/cloud_viewer.h>\n#include <pcl\/visualization\/image_viewer.h>\n\n\nusing pcl::console::print_error;\nusing pcl::console::print_info;\nusing pcl::console::print_value;\n\nboost::mutex mutex_;\nboost::shared_ptr<pcl::PCDGrabber<pcl::PointXYZRGBA> > grabber;\npcl::PointCloud<pcl::PointXYZRGBA>::ConstPtr cloud_;\n\nvoid\nprintHelp (int, char **argv)\n{\n  \/\/print_error (\"Syntax is: %s <file_name 1..N>.pcd <options>\\n\", argv[0]);\n  print_error (\"Syntax is: %s <options>\\n\", argv[0]);\n  print_info (\"  where options are:\\n\");\n  print_info (\"                     -file file_name          = PCD file to be read from\\n\");\n  print_info (\"                     -dir directory_path      = directory path to PCD file(s) to be read from\\n\");\n  print_info (\"                     -fps frequency           = frames per second\\n\");\n  print_info (\"                     -repeat                  = optional parameter that tells wheter the PCD file(s) should be \\\"grabbed\\\" in a endless loop.\\n\");\n  print_info (\"\\n\");\n  print_info (\"                     -cam (*)                 = use given camera settings as initial view\\n\");\n  print_info (stderr, \" (*) [Clipping Range \/ Focal Point \/ Position \/ ViewUp \/ Distance \/ Window Size \/ Window Pos] or use a <filename.cam> that contains the same information.\\n\");\n}\n\n\/\/ Create the PCLVisualizer object\nboost::shared_ptr<pcl::visualization::PCLVisualizer> cloud_viewer;\n#if !((VTK_MAJOR_VERSION == 5)&&(VTK_MINOR_VERSION <= 4))\nboost::shared_ptr<pcl::visualization::ImageViewer> img_viewer;\n#endif\n\nstd::vector<double> fcolor_r, fcolor_b, fcolor_g;\nbool fcolorparam = false;\n\nstruct EventHelper\n{\n  void \n  cloud_cb (const pcl::PointCloud<pcl::PointXYZRGBA>::ConstPtr & cloud)\n  {\n    if (mutex_.try_lock ())\n    {\n      cloud_ = cloud;\n      mutex_.unlock ();\n    }\n  }\n};\n\nvoid \nkeyboard_callback (const pcl::visualization::KeyboardEvent& event, void*)\n{\n  \/\/\/ If SPACE is pressed, trigger new cloud callback (only works if framerate is set to 0)\n  if (event.getKeyCode() == ' ' && grabber)\n    grabber->trigger ();\n}\n\nvoid mouse_callback (const pcl::visualization::MouseEvent& mouse_event, void* cookie)\n{\n  std::string* message = (std::string*) cookie;\n  if (mouse_event.getType() == pcl::visualization::MouseEvent::MouseButtonPress && mouse_event.getButton() == pcl::visualization::MouseEvent::LeftButton)\n  {\n    cout << (*message) << \" :: \" << mouse_event.getX () << \" , \" << mouse_event.getY () << endl;\n  }\n}\n\n\/* ---[ *\/\nint\nmain (int argc, char** argv)\n{\n  srand (time (0));\n\n  if (argc > 1)\n  {\n    for (int i = 1; i < argc; i++)\n    {\n      if (std::string (argv[i]) == \"-h\")\n      {\n        printHelp (argc, argv);\n        return (-1);\n      }\n    }\n  }\n\n  \/\/ Command line parsing\n  double bcolor[3] = {0, 0, 0};\n  pcl::console::parse_3x_arguments (argc, argv, \"-bc\", bcolor[0], bcolor[1], bcolor[2]);\n\n  fcolorparam = pcl::console::parse_multiple_3x_arguments (argc, argv, \"-fc\", fcolor_r, fcolor_g, fcolor_b);\n\n  int psize = 0;\n  pcl::console::parse_argument (argc, argv, \"-ps\", psize);\n\n  double opaque;\n  pcl::console::parse_argument (argc, argv, \"-opaque\", opaque);\n\n  cloud_viewer.reset (new pcl::visualization::PCLVisualizer (argc, argv, \"PCD viewer\"));\n\n#if !((VTK_MAJOR_VERSION == 5)&&(VTK_MINOR_VERSION <= 4))\n  img_viewer.reset (new pcl::visualization::ImageViewer (\"OpenNI Viewer\"));\n#endif\n\n  \/\/  \/\/ Change the cloud rendered point size\n  \/\/  if (psize > 0)\n  \/\/    p->setPointCloudRenderingProperties (pcl::visualization::PCL_VISUALIZER_POINT_SIZE, psize, \"OpenNICloud\");\n  \/\/\n  \/\/  \/\/ Change the cloud rendered opacity\n  \/\/  if (opaque >= 0)\n  \/\/    p->setPointCloudRenderingProperties (pcl::visualization::PCL_VISUALIZER_OPACITY, opaque, \"OpenNICloud\");\n\n  cloud_viewer->setBackgroundColor (bcolor[0], bcolor[1], bcolor[2]);\n\n  \/\/ Read axes settings\n  double axes = 0.0;\n  pcl::console::parse_argument (argc, argv, \"-ax\", axes);\n  if (axes != 0.0 && cloud_viewer)\n  {\n    double ax_x = 0.0, ax_y = 0.0, ax_z = 0.0;\n    pcl::console::parse_3x_arguments (argc, argv, \"-ax_pos\", ax_x, ax_y, ax_z, false);\n    \/\/ Draw XYZ axes if command-line enabled\n    cloud_viewer->addCoordinateSystem (axes, ax_x, ax_y, ax_z);\n  }\n\n  float frames_per_second = 0; \/\/ 0 means only if triggered!\n  pcl::console::parse (argc, argv, \"-fps\", frames_per_second);\n  if (frames_per_second < 0)\n    frames_per_second = 0.0;\n\n  std::cout << pcl::console::find_argument (argc, argv, \"-repeat\") << \" : repaet\" << std::endl;\n  bool repeat = (pcl::console::find_argument (argc, argv, \"-repeat\") != -1);\n\n  std::cout << \"fps: \" << frames_per_second << \" , repeat: \" << repeat << std::endl;\n  std::string path = \"\";\n  pcl::console::parse_argument (argc, argv, \"-file\", path);\n  std::cout << \"path: \" << path << std::endl;\n  if (path != \"\" && boost::filesystem::exists (path))\n  {\n    grabber.reset (new pcl::PCDGrabber<pcl::PointXYZRGBA> (path, frames_per_second, repeat));\n  }\n  else\n  {\n    std::vector<std::string> pcd_files;\n    pcl::console::parse_argument (argc, argv, \"-dir\", path);\n    std::cout << \"path: \" << path << std::endl;\n    if (path != \"\" && boost::filesystem::exists (path))\n    {\n      boost::filesystem::directory_iterator end_itr;\n      for (boost::filesystem::directory_iterator itr (path); itr != end_itr; ++itr)\n      {\n        if (!is_directory (itr->status()) && boost::algorithm::to_upper_copy(boost::filesystem::extension (itr->leaf())) == \".PCD\" )\n        {\n          pcd_files.push_back (itr->path ().string());\n          std::cout << \"added: \" << itr->path ().string() << std::endl;\n        }\n      }\n    }\n    else\n    {\n      std::cout << \"Neither a pcd file given using the \\\"-file\\\" option, nor given a directory containing pcd files using the \\\"-dir\\\" option.\" << std::endl;\n    }\n\n    \/\/ Sort the read files by name\n    sort (pcd_files.begin (), pcd_files.end ());\n    grabber.reset (new pcl::PCDGrabber<pcl::PointXYZRGBA> (pcd_files, frames_per_second, repeat));\n  }\n\n  EventHelper h;\n  boost::function<void(const pcl::PointCloud<pcl::PointXYZRGBA>::ConstPtr&) > f = boost::bind (&EventHelper::cloud_cb, &h, _1);\n  boost::signals2::connection c1 = grabber->registerCallback (f);\n\n  std::string mouseMsg3D (\"Mouse coordinates in PCL Visualizer\");\n  std::string keyMsg3D (\"Key event for PCL Visualizer\");\n\n  cloud_viewer->registerMouseCallback (&mouse_callback, (void*)(&mouseMsg3D));\n  cloud_viewer->registerKeyboardCallback(&keyboard_callback, (void*)(&keyMsg3D));\n\n  grabber->start ();\n  while (true)\n  {\n    cloud_viewer->spinOnce ();\n\n#if !((VTK_MAJOR_VERSION == 5)&&(VTK_MINOR_VERSION <= 4))\n    img_viewer->spinOnce ();\n#endif\n\n\n    if (!cloud_)\n    {\n      boost::this_thread::sleep(boost::posix_time::microseconds(10000));\n      continue;\n    }\n\n    if (mutex_.try_lock ())\n    {\n      pcl::PointCloud<pcl::PointXYZRGBA>::ConstPtr temp_cloud;\n      temp_cloud.swap (cloud_);\n      mutex_.unlock ();\n\n#if !((VTK_MAJOR_VERSION == 5)&&(VTK_MINOR_VERSION <= 4))\n      img_viewer->showRGBImage (*temp_cloud);\n#endif\n\n\n      if (!cloud_viewer->updatePointCloud (temp_cloud, \"PCDCloud\"))\n      {\n        cloud_viewer->addPointCloud (temp_cloud, \"PCDCloud\");\n        cloud_viewer->resetCameraViewpoint (\"PCDCloud\");\n      }\n    }\n\n    if (cloud_viewer->wasStopped ())\n      break;\n  }\n\n  grabber->stop ();\n}\n\/* ]--- *\/\n<commit_msg>fixed compiler warning<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 *\n * Author: Radu B. Rusu, Suat Gedikli\n *\n *\/\n#include <pcl\/io\/pcd_grabber.h>\n#include <pcl\/console\/parse.h>\n#define BOOST_FILESYSTEM_VERSION 2\n#include <boost\/filesystem.hpp>\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/thread\/thread.hpp>\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n#include <pcl\/console\/print.h>\n#include <pcl\/visualization\/cloud_viewer.h>\n#include <pcl\/visualization\/image_viewer.h>\n\n\nusing pcl::console::print_error;\nusing pcl::console::print_info;\nusing pcl::console::print_value;\n\nboost::mutex mutex_;\nboost::shared_ptr<pcl::PCDGrabber<pcl::PointXYZRGB> > grabber;\npcl::PointCloud<pcl::PointXYZRGB>::ConstPtr cloud_;\n\nvoid\nprintHelp (int, char **argv)\n{\n  \/\/print_error (\"Syntax is: %s <file_name 1..N>.pcd <options>\\n\", argv[0]);\n  print_error (\"Syntax is: %s <options>\\n\", argv[0]);\n  print_info (\"  where options are:\\n\");\n  print_info (\"                     -file file_name          = PCD file to be read from\\n\");\n  print_info (\"                     -dir directory_path      = directory path to PCD file(s) to be read from\\n\");\n  print_info (\"                     -fps frequency           = frames per second\\n\");\n  print_info (\"                     -repeat                  = optional parameter that tells wheter the PCD file(s) should be \\\"grabbed\\\" in a endless loop.\\n\");\n  print_info (\"\\n\");\n  print_info (\"                     -cam (*)                 = use given camera settings as initial view\\n\");\n  print_info (stderr, \" (*) [Clipping Range \/ Focal Point \/ Position \/ ViewUp \/ Distance \/ Window Size \/ Window Pos] or use a <filename.cam> that contains the same information.\\n\");\n}\n\n\/\/ Create the PCLVisualizer object\nboost::shared_ptr<pcl::visualization::PCLVisualizer> cloud_viewer;\n#if !((VTK_MAJOR_VERSION == 5)&&(VTK_MINOR_VERSION <= 4))\nboost::shared_ptr<pcl::visualization::ImageViewer> img_viewer;\n#endif\n\nstd::vector<double> fcolor_r, fcolor_b, fcolor_g;\nbool fcolorparam = false;\n\nstruct EventHelper\n{\n  void \n  cloud_cb (const pcl::PointCloud<pcl::PointXYZRGB>::ConstPtr & cloud)\n  {\n    if (mutex_.try_lock ())\n    {\n      cloud_ = cloud;\n      mutex_.unlock ();\n    }\n  }\n};\n\nvoid \nkeyboard_callback (const pcl::visualization::KeyboardEvent& event, void*)\n{\n  \/\/\/ If SPACE is pressed, trigger new cloud callback (only works if framerate is set to 0)\n  if (event.getKeyCode() == ' ' && grabber)\n    grabber->trigger ();\n}\n\nvoid mouse_callback (const pcl::visualization::MouseEvent& mouse_event, void* cookie)\n{\n  std::string* message = static_cast<std::string*> (cookie);\n  if (mouse_event.getType() == pcl::visualization::MouseEvent::MouseButtonPress && mouse_event.getButton() == pcl::visualization::MouseEvent::LeftButton)\n  {\n    cout << (*message) << \" :: \" << mouse_event.getX () << \" , \" << mouse_event.getY () << endl;\n  }\n}\n\n\/* ---[ *\/\nint\nmain (int argc, char** argv)\n{\n  srand (unsigned (time (0)));\n\n  if (argc > 1)\n  {\n    for (int i = 1; i < argc; i++)\n    {\n      if (std::string (argv[i]) == \"-h\")\n      {\n        printHelp (argc, argv);\n        return (-1);\n      }\n    }\n  }\n\n  \/\/ Command line parsing\n  double bcolor[3] = {0, 0, 0};\n  pcl::console::parse_3x_arguments (argc, argv, \"-bc\", bcolor[0], bcolor[1], bcolor[2]);\n\n  fcolorparam = pcl::console::parse_multiple_3x_arguments (argc, argv, \"-fc\", fcolor_r, fcolor_g, fcolor_b);\n\n  int psize = 0;\n  pcl::console::parse_argument (argc, argv, \"-ps\", psize);\n\n  double opaque;\n  pcl::console::parse_argument (argc, argv, \"-opaque\", opaque);\n\n  cloud_viewer.reset (new pcl::visualization::PCLVisualizer (argc, argv, \"PCD viewer\"));\n\n#if !((VTK_MAJOR_VERSION == 5)&&(VTK_MINOR_VERSION <= 4))\n  img_viewer.reset (new pcl::visualization::ImageViewer (\"OpenNI Viewer\"));\n#endif\n\n  \/\/  \/\/ Change the cloud rendered point size\n  \/\/  if (psize > 0)\n  \/\/    p->setPointCloudRenderingProperties (pcl::visualization::PCL_VISUALIZER_POINT_SIZE, psize, \"OpenNICloud\");\n  \/\/\n  \/\/  \/\/ Change the cloud rendered opacity\n  \/\/  if (opaque >= 0)\n  \/\/    p->setPointCloudRenderingProperties (pcl::visualization::PCL_VISUALIZER_OPACITY, opaque, \"OpenNICloud\");\n\n  cloud_viewer->setBackgroundColor (bcolor[0], bcolor[1], bcolor[2]);\n\n  \/\/ Read axes settings\n  double axes = 0.0;\n  pcl::console::parse_argument (argc, argv, \"-ax\", axes);\n  if (axes != 0.0 && cloud_viewer)\n  {\n    float ax_x = 0.0, ax_y = 0.0, ax_z = 0.0;\n    pcl::console::parse_3x_arguments (argc, argv, \"-ax_pos\", ax_x, ax_y, ax_z, false);\n    \/\/ Draw XYZ axes if command-line enabled\n    cloud_viewer->addCoordinateSystem (axes, ax_x, ax_y, ax_z);\n  }\n\n  float frames_per_second = 0; \/\/ 0 means only if triggered!\n  pcl::console::parse (argc, argv, \"-fps\", frames_per_second);\n  if (frames_per_second < 0)\n    frames_per_second = 0.0;\n\n  bool repeat = (pcl::console::find_argument (argc, argv, \"-repeat\") != -1);\n\n  std::cout << \"fps: \" << frames_per_second << \" , repeat: \" << repeat << std::endl;\n  std::string path = \"\";\n  pcl::console::parse_argument (argc, argv, \"-file\", path);\n  std::cout << \"path: \" << path << std::endl;\n  if (path != \"\" && boost::filesystem::exists (path))\n  {\n    grabber.reset (new pcl::PCDGrabber<pcl::PointXYZRGB> (path, frames_per_second, repeat));\n  }\n  else\n  {\n    std::vector<std::string> pcd_files;\n    pcl::console::parse_argument (argc, argv, \"-dir\", path);\n    std::cout << \"path: \" << path << std::endl;\n    if (path != \"\" && boost::filesystem::exists (path))\n    {\n      boost::filesystem::directory_iterator end_itr;\n      for (boost::filesystem::directory_iterator itr (path); itr != end_itr; ++itr)\n      {\n        if (!is_directory (itr->status()) && boost::algorithm::to_upper_copy(boost::filesystem::extension (itr->leaf())) == \".PCD\" )\n        {\n          pcd_files.push_back (itr->path ().string());\n          std::cout << \"added: \" << itr->path ().string() << std::endl;\n        }\n      }\n    }\n    else\n    {\n      std::cout << \"Neither a pcd file given using the \\\"-file\\\" option, nor given a directory containing pcd files using the \\\"-dir\\\" option.\" << std::endl;\n    }\n\n    \/\/ Sort the read files by name\n    sort (pcd_files.begin (), pcd_files.end ());\n    grabber.reset (new pcl::PCDGrabber<pcl::PointXYZRGB> (pcd_files, frames_per_second, repeat));\n  }\n\n  EventHelper h;\n  boost::function<void(const pcl::PointCloud<pcl::PointXYZRGB>::ConstPtr&) > f = boost::bind (&EventHelper::cloud_cb, &h, _1);\n  boost::signals2::connection c1 = grabber->registerCallback (f);\n\n  std::string mouseMsg3D (\"Mouse coordinates in PCL Visualizer\");\n  std::string keyMsg3D (\"Key event for PCL Visualizer\");\n\n  cloud_viewer->registerMouseCallback (&mouse_callback, reinterpret_cast<void*> (&mouseMsg3D));\n  cloud_viewer->registerKeyboardCallback(&keyboard_callback, reinterpret_cast<void*> (&keyMsg3D));\n\n  grabber->start ();\n  while (!cloud_viewer->wasStopped ())\n  {\n    cloud_viewer->spinOnce ();\n\n#if !((VTK_MAJOR_VERSION == 5)&&(VTK_MINOR_VERSION <= 4))\n    img_viewer->spinOnce ();\n#endif\n\n    if (!cloud_)\n    {\n      boost::this_thread::sleep(boost::posix_time::microseconds(10000));\n      continue;\n    }\n\n    if (mutex_.try_lock ())\n    {\n      pcl::PointCloud<pcl::PointXYZRGB>::ConstPtr temp_cloud;\n      temp_cloud.swap (cloud_);\n      mutex_.unlock ();\n\n#if !((VTK_MAJOR_VERSION == 5)&&(VTK_MINOR_VERSION <= 4))\n      img_viewer->showRGBImage (*temp_cloud);\n#endif\n\n      if (!cloud_viewer->updatePointCloud (temp_cloud, \"PCDCloud\"))\n      {\n        cloud_viewer->addPointCloud (temp_cloud, \"PCDCloud\");\n        cloud_viewer->resetCameraViewpoint (\"PCDCloud\");\n      }\n    }\n  }\n\n  grabber->stop ();\n}\n\/* ]--- *\/\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * DiscordBot.cpp\n *   DiscordBot Integration\n *   ____            _\n *  |  _ \\ ___  __ _| |_ __ ___  ___\n *  | |_) \/ _ \\\/ _` | | '_ ` _ \\\/ __|\n *  |  _ <  __\/ (_| | | | | | | \\__ \\\n *  |_| \\_\\___|\\__,_|_|_| |_| |_|___\/\n *\n * Permission to use, modify and distribute is granted via the\n *  GNU Affero General Public License v3 or later\n *\n *  Copyright (C) 2007-2021 Jason Mitchell, Randi Mitchell\n *     Contributions by Tim Callahan, Jonathan Hseu\n *  Based on Mordor (C) Brooke Paul, Brett J. Vickers, John P. Freeman\n *\n *\/\n#include <dpp\/dpp.h>\n#include <dpp\/commandhandler.h>\n#include \"fmt\/core.h\"\n#include \"random.hpp\"           \/\/ for Random\n#include \"config.hpp\"           \/\/ for Config\n#include \"communication.hpp\"    \/\/ for COM_EMOTE\n#include \"server.hpp\"           \/\/ for Server, MonsterList\n#include \"creatures.hpp\"        \/\/ for Player\n#include <boost\/algorithm\/string\/replace.hpp>\n\nvoid Config::clearWebhookTokens() {\n    webhookTokens.clear();\n}\n\nstd::string getUsername(dpp::guild *guild, dpp::user *author) {\n    const auto member = guild->members.find(author->id);\n    return ((member != guild->members.end() && !member->second.nickname.empty()) ? member->second.nickname : author->username);\n}\n\n\nstd::string getWho() {\n    bool found = false;\n    std::ostringstream whoStr;\n\n    whoStr << \"```\\n\";\n    for(const auto& [pId, player] : gServer->players) {\n        if(!player->isConnected()) continue;\n        if(player->flagIsSet(P_DM_INVIS)) continue;\n        if(player->isEffected(\"incognito\")) continue;\n\n        found = true;\n\n        whoStr << player->getWhoString(false, false, false);\n    }\n    if(!found)\n        return bstring(\"Nobody found!\\n\");\n    else {\n        whoStr << \"```\\n\";\n        return whoStr.str();\n    }\n\n}\n\n\nbool Server::initDiscordBot() {\n    if (!gConfig->isBotEnabled()) {\n        std::cout << \"Discord bot NOT enabled\" << std::endl;\n        return (false);\n    }\n\n    std::cout << \"Initializing Discord bot\" << std::endl;\n    discordBot = new dpp::cluster(gConfig->getBotToken());\n\n    \/* Create command handler, and specify prefixes *\/\n    commandHandler = new dpp::commandhandler (discordBot);\n\n    \/* Specifying a prefix of \"\/\" tells the command handler it should also expect slash commands *\/\n    commandHandler->add_prefix(\".\").add_prefix(\"\/\");\n\n    discordBot->on_ready([bot=this->discordBot, command_handler=this->commandHandler](const dpp::ready_t & event) {\n        std::cout << \"Logged in as \" << bot->me.username << \"!\\n\";\n        command_handler->add_command(\n                \/* Command name *\/\n                \"who\",\n                \/* Parameters *\/\n                {},\n                \/* Command handler *\/\n                [command_handler](const std::string& command, const dpp::parameter_list_t& parameters, dpp::command_source src) {\n                    command_handler->reply(dpp::message().add_embed((dpp::embed().set_title(\"Players currently online\").set_description(getWho()))), src);\n                },\n                \/* Command description *\/\n                \"Get a list of who is currently logged into the mud.\"\n        );\n    });\n\n    discordBot->on_message_create([bot=this->discordBot](const dpp::message_create_t & event) {\n        if (event.msg->author->is_bot()) {\n            \/\/ Don't respond to bot messages\n            return;\n        }\n\n        channelPtr chan = getChannelByDiscordChannel(event.msg->channel_id);\n        auto guild = dpp::find_guild(event.msg->guild_id);\n        if (chan) {\n            \/\/ Second: See if we have a channel\n            const std::string username = getUsername(guild, event.msg->author) + \" [Discord]\";\n            std::ostringstream contentStr;\n\n            if (!event.msg->content.empty()) {\n                if (!event.msg->mentions.empty()) {\n                    \/\/ Replace all mentions with the actual users\n                    std::string content = event.msg->content;\n\n                    for (auto& mention : event.msg->mentions) {\n                        boost::replace_all(content, fmt::format(\"<@!{}>\", mention), fmt::format(\"@{}\", getUsername(guild, dpp::find_user(mention))));\n                    }\n\n                    for (auto& mention : event.msg->mention_channels) {\n                        boost::replace_all(content, fmt::format(\"<@#{}>\", mention), fmt::format(\"#{}\", dpp::find_channel(mention)->name));\n                    }\n\n                    for (auto& mention : event.msg->mention_roles) {\n                        boost::replace_all(content, fmt::format(\"<@&{}>\", mention), fmt::format(\"#{}\", dpp::find_role(mention)->name));\n                    }\n                    contentStr << content;\n                } else {\n                    contentStr << event.msg->content;\n                }\n            }\n\n            if (!event.msg->attachments.empty())\n                for (auto& attachment : event.msg->attachments)\n                    contentStr << \" \" << attachment.url;\n\n            if (!event.msg->embeds.empty())\n                for (auto& embed: event.msg->embeds)\n                    contentStr << \" \" << embed.url;\n\n            sendGlobalComm(nullptr, contentStr.str(), \"\", 0, chan, \"\", username, username);\n        } else {\n            \/\/ Third? Generic fallback... or do nothing\n            std::cout << \"Got msg \" << event.msg->content << \" in channel \" << event.msg->channel_id << \" from \"\n                      << event.msg->author->username << \" isBot: \" << event.msg->author->is_bot() << std::endl;\n            if (event.msg->content == \"!ping\") {\n                bot->message_create(dpp::message(event.msg->channel_id, \"Pong!\"));\n            }\n        }\n    });\n    discordBot->start(true);\n\n    return (true);\n}\n\nbool Server::sendDiscordWebhook(long webhookID, int type, const bstring &author, const bstring &msg) {\n    \/\/ Send a message from the mud, to a discord channel\n    dpp::message myMessage;\n    if (type == COM_EMOTE) {\n        myMessage = dpp::message(\"*** \" + author + \" \" + msg);\n    } else {\n        \/*\n         * TODO: We allow mentioning users, however for this to actually work we'll need to parse out any @<name>'s, look up the user id, and replace it with @<user_id>\n         *\/\n        myMessage = dpp::message(msg).set_allowed_mentions(true, false, false, false, {}, {});\n\n        if(!author.empty()) {\n            auto myAuthor = new dpp::user();\n            myAuthor->username = author;\n            myMessage.author = myAuthor;\n        }\n    }\n\n    auto wh = dpp::webhook();\n    try {\n        wh.token = gConfig->getWebhookToken(webhookID);\n    } catch (std::out_of_range &e) {\n        std::cout << \"Unable to find token for webhook id \" << webhookID << std::endl;\n        return false;\n    }\n    wh.id = webhookID;\n\n\n    discordBot->execute_webhook(wh, myMessage);\n    return true;\n}\n<commit_msg>better mention support<commit_after>\/*\n * DiscordBot.cpp\n *   DiscordBot Integration\n *   ____            _\n *  |  _ \\ ___  __ _| |_ __ ___  ___\n *  | |_) \/ _ \\\/ _` | | '_ ` _ \\\/ __|\n *  |  _ <  __\/ (_| | | | | | | \\__ \\\n *  |_| \\_\\___|\\__,_|_|_| |_| |_|___\/\n *\n * Permission to use, modify and distribute is granted via the\n *  GNU Affero General Public License v3 or later\n *\n *  Copyright (C) 2007-2021 Jason Mitchell, Randi Mitchell\n *     Contributions by Tim Callahan, Jonathan Hseu\n *  Based on Mordor (C) Brooke Paul, Brett J. Vickers, John P. Freeman\n *\n *\/\n#include <dpp\/dpp.h>\n#include <dpp\/commandhandler.h>\n#include \"fmt\/core.h\"\n#include \"random.hpp\"           \/\/ for Random\n#include \"config.hpp\"           \/\/ for Config\n#include \"communication.hpp\"    \/\/ for COM_EMOTE\n#include \"server.hpp\"           \/\/ for Server, MonsterList\n#include \"creatures.hpp\"        \/\/ for Player\n#include <boost\/algorithm\/string\/replace.hpp>\n\nvoid Config::clearWebhookTokens() {\n    webhookTokens.clear();\n}\n\nstd::string getUsername(dpp::guild *guild, dpp::user *author) {\n    const auto member = guild->members.find(author->id);\n    return ((member != guild->members.end() && !member->second.nickname.empty()) ? member->second.nickname : author->username);\n}\n\n\nstd::string getWho() {\n    bool found = false;\n    std::ostringstream whoStr;\n\n    whoStr << \"```\\n\";\n    for(const auto& [pId, player] : gServer->players) {\n        if(!player->isConnected()) continue;\n        if(player->flagIsSet(P_DM_INVIS)) continue;\n        if(player->isEffected(\"incognito\")) continue;\n\n        found = true;\n\n        whoStr << player->getWhoString(false, false, false);\n    }\n    if(!found)\n        return bstring(\"Nobody found!\\n\");\n    else {\n        whoStr << \"```\\n\";\n        return whoStr.str();\n    }\n\n}\n\n\nbool Server::initDiscordBot() {\n    if (!gConfig->isBotEnabled()) {\n        std::cout << \"Discord bot NOT enabled\" << std::endl;\n        return (false);\n    }\n\n    std::cout << \"Initializing Discord bot\" << std::endl;\n    discordBot = new dpp::cluster(gConfig->getBotToken());\n\n    \/* Create command handler, and specify prefixes *\/\n    commandHandler = new dpp::commandhandler (discordBot);\n\n    \/* Specifying a prefix of \"\/\" tells the command handler it should also expect slash commands *\/\n    commandHandler->add_prefix(\".\").add_prefix(\"\/\");\n\n    discordBot->on_ready([bot=this->discordBot, command_handler=this->commandHandler](const dpp::ready_t & event) {\n        std::cout << \"Logged in as \" << bot->me.username << \"!\\n\";\n        command_handler->add_command(\n                \/* Command name *\/\n                \"who\",\n                \/* Parameters *\/\n                {},\n                \/* Command handler *\/\n                [command_handler](const std::string& command, const dpp::parameter_list_t& parameters, dpp::command_source src) {\n                    command_handler->reply(dpp::message().add_embed((dpp::embed().set_title(\"Players currently online\").set_description(getWho()))), src);\n                },\n                \/* Command description *\/\n                \"Get a list of who is currently logged into the mud.\"\n        );\n    });\n\n    discordBot->on_message_create([bot=this->discordBot](const dpp::message_create_t & event) {\n        if (event.msg->author->is_bot()) {\n            \/\/ Don't respond to bot messages\n            return;\n        }\n\n        channelPtr chan = getChannelByDiscordChannel(event.msg->channel_id);\n        auto guild = dpp::find_guild(event.msg->guild_id);\n        if (chan) {\n            \/\/ Second: See if we have a channel\n            const std::string username = getUsername(guild, event.msg->author) + \" [Discord]\";\n            std::ostringstream contentStr;\n\n            if (!event.msg->content.empty()) {\n                std::string content = event.msg->content;\n\n                \/\/ Replace all mentions with the actual users\n                for (auto &mention: event.msg->mentions) {\n                    boost::replace_all(content, fmt::format(\"<@!{}>\", mention), fmt::format(\"@{}\", getUsername(guild, dpp::find_user(mention))));\n                }\n                for (auto &mention: event.msg->mention_channels) {\n                    boost::replace_all(content, fmt::format(\"<#{}>\", mention), fmt::format(\"#{}\", dpp::find_channel(mention)->name));\n                }\n                for (auto &mention: event.msg->mention_roles) {\n                    boost::replace_all(content, fmt::format(\"<@&{}>\", mention), fmt::format(\"@{}\", dpp::find_role(mention)->name));\n                }\n                contentStr << content;\n            }\n\n            if (!event.msg->attachments.empty())\n                for (auto& attachment : event.msg->attachments)\n                    contentStr << \" \" << attachment.url;\n\n            if (!event.msg->embeds.empty())\n                for (auto& embed: event.msg->embeds)\n                    contentStr << \" \" << embed.url;\n\n            sendGlobalComm(nullptr, contentStr.str(), \"\", 0, chan, \"\", username, username);\n        } else {\n            \/\/ Third? Generic fallback... or do nothing\n            std::cout << \"Got msg \" << event.msg->content << \" in channel \" << event.msg->channel_id << \" from \"\n                      << event.msg->author->username << \" isBot: \" << event.msg->author->is_bot() << std::endl;\n            if (event.msg->content == \"!ping\") {\n                bot->message_create(dpp::message(event.msg->channel_id, \"Pong!\"));\n            }\n        }\n    });\n    discordBot->start(true);\n\n    return (true);\n}\n\nbool Server::sendDiscordWebhook(long webhookID, int type, const bstring &author, const bstring &msg) {\n    \/\/ Send a message from the mud, to a discord channel\n    dpp::message myMessage;\n    if (type == COM_EMOTE) {\n        myMessage = dpp::message(\"*** \" + author + \" \" + msg);\n    } else {\n        \/*\n         * TODO: We allow mentioning users, however for this to actually work we'll need to parse out any @<name>'s, look up the user id, and replace it with @<user_id>\n         *\/\n        myMessage = dpp::message(msg).set_allowed_mentions(true, false, false, false, {}, {});\n\n        if(!author.empty()) {\n            auto myAuthor = new dpp::user();\n            myAuthor->username = author;\n            myMessage.author = myAuthor;\n        }\n    }\n\n    auto wh = dpp::webhook();\n    try {\n        wh.token = gConfig->getWebhookToken(webhookID);\n    } catch (std::out_of_range &e) {\n        std::cout << \"Unable to find token for webhook id \" << webhookID << std::endl;\n        return false;\n    }\n    wh.id = webhookID;\n\n\n    discordBot->execute_webhook(wh, myMessage);\n    return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n *\n *   Copyright (c) 2015 Mark Charlebois. All 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 px4_linux_impl.cpp\n *\n * PX4 Middleware Wrapper Linux Implementation\n *\/\n\n#include <px4_defines.h>\n#include <px4_tasks.h>\n#include <px4_middleware.h>\n#include <px4_workqueue.h>\n#include <dataman\/dataman.h>\n#include <stdint.h>\n#include <stdio.h>\n#include <signal.h>\n#include <errno.h>\n#include <unistd.h>\n#include <semaphore.h>\n#include \"systemlib\/param\/param.h\"\n#include \"hrt_work.h\"\n#include \"px4_log.h\"\n\n\n\/\/extern pthread_t _shell_task_id;\n\n\n__BEGIN_DECLS\nextern uint64_t get_ticks_per_us();\n\n\/\/long PX4_TICKS_PER_SEC = 1000L;\n\nunsigned int sleep(unsigned int sec)\n{\n\tfor (unsigned int i = 0; i < sec; i++) {\n\t\tusleep(1000000);\n\t}\n\n\treturn 0;\n}\n\nextern void hrt_init(void);\nextern void init_params();\n\n#if 0\nvoid qurt_log(const char *fmt, ...)\n{\n\tva_list\targs;\n\tva_start(args, fmt);\n\tprintf(fmt, args);\n\tprintf(\"n\");\n}\n#endif\n\n\/\/extern int _posix_init(void);\n\n__END_DECLS\n\nextern struct wqueue_s gwork[NWORKERS];\n\n\nnamespace px4\n{\n\nvoid init_once(void);\n\nvoid init_once(void)\n{\n\t\/\/ Required for QuRT\n\t\/\/_posix_init();\n\tPX4_WARN(\"Before calling work_queue_init\");\n\n\/\/\t_shell_task_id = pthread_self();\n\/\/\tPX4_INFO(\"Shell id is %lu\", _shell_task_id);\n\n\twork_queues_init();\n\tPX4_WARN(\"Before calling hrt_init\");\n\thrt_work_queue_init();\n\thrt_init();\n\tPX4_WARN(\"after calling hrt_init\");\n\n\t\/* Shared memory param sync*\/\n\tinit_params();\n}\n\nvoid init(int argc, char *argv[], const char *app_name)\n{\n\tPX4_DEBUG(\"App name: %s\\n\", app_name);\n}\n\n}\n\n\/** Retrieve from the data manager store *\/\nssize_t\ndm_read(\n\tdm_item_t item,                 \/* The item type to retrieve *\/\n\tunsigned char index,            \/* The index of the item *\/\n\tvoid *buffer,                   \/* Pointer to caller data buffer *\/\n\tsize_t buflen                   \/* Length in bytes of data to retrieve *\/\n)\n{\n\treturn 0;\n}\n\n\/** write to the data manager store *\/\nssize_t\ndm_write(\n\tdm_item_t  item,                \/* The item type to store *\/\n\tunsigned char index,            \/* The index of the item *\/\n\tdm_persitence_t persistence,    \/* The persistence level of this item *\/\n\tconst void *buffer,             \/* Pointer to caller data buffer *\/\n\tsize_t buflen                   \/* Length in bytes of data to retrieve *\/\n)\n{\n\treturn 0;\n}\n\nsize_t strnlen(const char *s, size_t maxlen)\n{\n\tsize_t i = 0;\n\n\twhile (s[i] != '\\0' && i < maxlen) {\n\t\t++i;\n\t}\n\n\treturn i;\n}\n\nstatic void block_indefinite(void)\n{\n\tfor (;;) {\n\t\tvolatile int x = 0;\n\t\t++x;\n\t}\n}\n\nint fprintf(FILE *stream, const char *format, ...)\n{\n\tPX4_ERR(\"Error: Calling unresolved symbol stub[%s]\", __FUNCTION__);\n\tblock_indefinite();\n\treturn 0;\n}\n\nint fputc(int c, FILE *stream)\n{\n\treturn c;\n}\n<commit_msg>Added fprintf fputc and _StdErr definitions<commit_after>\/****************************************************************************\n *\n *   Copyright (c) 2015 Mark Charlebois. All 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 px4_linux_impl.cpp\n *\n * PX4 Middleware Wrapper Linux Implementation\n *\/\n\n#include <px4_defines.h>\n#include <px4_tasks.h>\n#include <px4_middleware.h>\n#include <px4_workqueue.h>\n#include <dataman\/dataman.h>\n#include <stdint.h>\n#include <stdio.h>\n#include <signal.h>\n#include <errno.h>\n#include <unistd.h>\n#include <semaphore.h>\n#include \"systemlib\/param\/param.h\"\n#include \"hrt_work.h\"\n#include \"px4_log.h\"\n\n\n\/\/extern pthread_t _shell_task_id;\n\n\n__BEGIN_DECLS\nextern uint64_t get_ticks_per_us();\n\n\/\/long PX4_TICKS_PER_SEC = 1000L;\n\nunsigned int sleep(unsigned int sec)\n{\n\tfor (unsigned int i = 0; i < sec; i++) {\n\t\tusleep(1000000);\n\t}\n\n\treturn 0;\n}\n\nextern void hrt_init(void);\nextern void init_params();\n\n#if 0\nvoid qurt_log(const char *fmt, ...)\n{\n\tva_list\targs;\n\tva_start(args, fmt);\n\tprintf(fmt, args);\n\tprintf(\"n\");\n}\n#endif\n\n\/\/extern int _posix_init(void);\n\n__END_DECLS\n\nextern struct wqueue_s gwork[NWORKERS];\n\n\nnamespace px4\n{\n\nvoid init_once(void);\n\nvoid init_once(void)\n{\n\t\/\/ Required for QuRT\n\t\/\/_posix_init();\n\tPX4_WARN(\"Before calling work_queue_init\");\n\n\/\/\t_shell_task_id = pthread_self();\n\/\/\tPX4_INFO(\"Shell id is %lu\", _shell_task_id);\n\n\twork_queues_init();\n\tPX4_WARN(\"Before calling hrt_init\");\n\thrt_work_queue_init();\n\thrt_init();\n\tPX4_WARN(\"after calling hrt_init\");\n\n\t\/* Shared memory param sync*\/\n\tinit_params();\n}\n\nvoid init(int argc, char *argv[], const char *app_name)\n{\n\tPX4_DEBUG(\"App name: %s\\n\", app_name);\n}\n\n}\n\n\/** Retrieve from the data manager store *\/\nssize_t\ndm_read(\n\tdm_item_t item,                 \/* The item type to retrieve *\/\n\tunsigned char index,            \/* The index of the item *\/\n\tvoid *buffer,                   \/* Pointer to caller data buffer *\/\n\tsize_t buflen                   \/* Length in bytes of data to retrieve *\/\n)\n{\n\treturn 0;\n}\n\n\/** write to the data manager store *\/\nssize_t\ndm_write(\n\tdm_item_t  item,                \/* The item type to store *\/\n\tunsigned char index,            \/* The index of the item *\/\n\tdm_persitence_t persistence,    \/* The persistence level of this item *\/\n\tconst void *buffer,             \/* Pointer to caller data buffer *\/\n\tsize_t buflen                   \/* Length in bytes of data to retrieve *\/\n)\n{\n\treturn 0;\n}\n\nsize_t strnlen(const char *s, size_t maxlen)\n{\n\tsize_t i = 0;\n\n\twhile (s[i] != '\\0' && i < maxlen) {\n\t\t++i;\n\t}\n\n\treturn i;\n}\n\nstatic void block_indefinite(void)\n{\n\tfor (;;) {\n\t\tvolatile int x = 0;\n\t\t++x;\n\t}\n}\n\nint fprintf(FILE *stream, const char *format, ...)\n{\n\tPX4_ERR(\"Error: Calling unresolved symbol stub[%s]\", __FUNCTION__);\n\tblock_indefinite();\n\treturn 0;\n}\n\nint fputc(int c, FILE *stream)\n{\n\treturn c;\n}\n\nint fprintf(FILE *stream, const char *format, ...)\n{\n\treturn 0;\n}\n\nint fputc(int c, FILE *stream)\n{\n\treturn c;\n}\n\nFILE _Stderr;\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#ifndef __PROCESS_SSL_TEST_HPP__\n#define __PROCESS_SSL_TEST_HPP__\n\n#ifdef USE_SSL_SOCKET\n#include <string>\n\n#include <openssl\/rsa.h>\n#include <openssl\/bio.h>\n#include <openssl\/x509.h>\n#include <openssl\/x509v3.h>\n\n#include <process\/io.hpp>\n#include <process\/process.hpp>\n#include <process\/socket.hpp>\n#include <process\/subprocess.hpp>\n\n#include <process\/ssl\/utilities.hpp>\n\n#include <stout\/none.hpp>\n#include <stout\/option.hpp>\n#include <stout\/try.hpp>\n#include <stout\/result.hpp>\n#endif \/\/ USE_SSL_SOCKET\n\n#include <stout\/tests\/utils.hpp>\n\n#ifdef USE_SSL_SOCKET\nnamespace process {\nnamespace network {\nnamespace openssl {\n\n\/\/ Forward declare the `reinitialize()` function since we want to\n\/\/ programatically change SSL flags during tests.\nvoid reinitialize();\n\n} \/\/ namespace openssl {\n} \/\/ namespace network {\n} \/\/ namespace process {\n#endif \/\/ USE_SSL_SOCKET\n\n\/\/ When SSL is not compiled in, we want the `SSLTemporaryDirectoryTest` class\n\/\/ to exist, so that other tests can inherit it; this class is equivalent\n\/\/ to the `TemporaryDirectoryTest` under that condition.\n#ifndef USE_SSL_SOCKET\nclass SSLTemporaryDirectoryTest : public TemporaryDirectoryTest {};\n#else\n\/**\n * A Test fixture that contains helpers for setting up SSL keys\n * and certificates, as well as cleaning them up afterwards.\n *\/\nclass SSLTemporaryDirectoryTest : public TemporaryDirectoryTest\n{\nprotected:\n  \/**\n   * @return The path to the authorized private key.\n   *\/\n  Path key_path()\n  {\n    return Path(path::join(os::getcwd(), \"key.pem\"));\n  }\n\n  \/**\n   * @return The path to the authorized certificate.\n   *\/\n  Path certificate_path()\n  {\n    return Path(path::join(os::getcwd(), \"cert.pem\"));\n  }\n\n  \/**\n   * @return The path to the unauthorized private key.\n   *\/\n  Path scrap_key_path()\n  {\n    return Path(path::join(os::getcwd(), \"scrap_key.pem\"));\n  }\n\n  \/**\n   * @return The path to the unauthorized certificate.\n   *\/\n  Path scrap_certificate_path()\n  {\n    return Path(path::join(os::getcwd(), \"scrap_cert.pem\"));\n  }\n\n  \/**\n   * Wipes out existing SSL environment variables and replaces them\n   * with the given map.  The SSL library is reinitialized afterwards.\n   *\/\n  void set_environment_variables(\n      const std::map<std::string, std::string>& environment)\n  {\n    \/\/ This unsets all the SSL environment variables. Necessary for\n    \/\/ ensuring a clean starting slate between tests.\n    os::unsetenv(\"SSL_ENABLED\");\n    os::unsetenv(\"SSL_SUPPORT_DOWNGRADE\");\n    os::unsetenv(\"SSL_CERT_FILE\");\n    os::unsetenv(\"SSL_KEY_FILE\");\n    os::unsetenv(\"SSL_VERIFY_CERT\");\n    os::unsetenv(\"SSL_REQUIRE_CERT\");\n    os::unsetenv(\"SSL_VERIFY_DEPTH\");\n    os::unsetenv(\"SSL_CA_DIR\");\n    os::unsetenv(\"SSL_CA_FILE\");\n    os::unsetenv(\"SSL_CIPHERS\");\n    os::unsetenv(\"SSL_ENABLE_SSL_V3\");\n    os::unsetenv(\"SSL_ENABLE_TLS_V1_0\");\n    os::unsetenv(\"SSL_ENABLE_TLS_V1_1\");\n    os::unsetenv(\"SSL_ENABLE_TLS_V1_2\");\n\n    \/\/ Copy the given map into the clean slate.\n    foreachpair (\n        const std::string& name, const std::string& value, environment) {\n      os::setenv(name, value);\n    }\n\n    \/\/ Make sure the library internally reflects the new environment variables.\n    process::network::openssl::reinitialize();\n  }\n\n  \/**\n   * Sets up a private key and certificate pair at SSLTest::key_path\n   * and SSLTest::certificate_path.  Also sets up an independent 'scrap'\n   * pair that can be used to test an invalid certificate authority chain.\n   * These can be found at SSLTest::scrap_key_path and\n   * SSLTest::scrap_certificate_path.\n   *\/\n  void generate_keys_and_certs() {\n    \/\/ We store the allocated objects in these results so that we can\n    \/\/ have a consolidated 'cleanup()' function. This makes all the\n    \/\/ 'EXIT()' calls more readable and less error prone.\n    Result<EVP_PKEY*> private_key = None();\n    Result<X509*> certificate = None();\n    Result<EVP_PKEY*> scrap_key = None();\n    Result<X509*> scrap_certificate = None();\n\n    auto cleanup = [&private_key, &certificate, &scrap_key, &scrap_certificate](\n        const Option<std::string> abort_message = None()) {\n      if (private_key.isSome()) { EVP_PKEY_free(private_key.get()); }\n      if (certificate.isSome()) { X509_free(certificate.get()); }\n      if (scrap_key.isSome()) { EVP_PKEY_free(scrap_key.get()); }\n      if (scrap_certificate.isSome()) { X509_free(scrap_certificate.get()); }\n\n      \/\/ We abort here because failure during setup indicates that something\n      \/\/ is horribly and irrecoverably wrong.\n      if (abort_message.isSome()) {\n        ABORT(abort_message.get());\n      }\n    };\n\n    \/\/ Generate the authority key.\n    private_key = process::network::openssl::generate_private_rsa_key();\n    if (private_key.isError()) {\n      cleanup(\"Could not generate private key: \" + private_key.error());\n    }\n\n    \/\/ Figure out the hostname that 'INADDR_LOOPBACK' will bind to.\n    \/\/ Set the hostname of the certificate to this hostname so that\n    \/\/ hostname verification of the certificate will pass.\n    Try<std::string> hostname = net::getHostname(net::IP(INADDR_LOOPBACK));\n    if (hostname.isError()) {\n      cleanup(\"Could not determine hostname of 'INADDR_LOOPBACK': \" +\n              hostname.error());\n    }\n\n    \/\/ Generate an authorized certificate.\n    certificate = process::network::openssl::generate_x509(\n        private_key.get(),\n        private_key.get(),\n        None(),\n        1,\n        365,\n        hostname.get());\n\n    if (certificate.isError()) {\n      cleanup(\"Could not generate certificate: \" + certificate.error());\n    }\n\n    \/\/ Write the authority key to disk.\n    Try<Nothing> key_write =\n      process::network::openssl::write_key_file(private_key.get(), key_path());\n\n    if (key_write.isError()) {\n      cleanup(\"Could not write private key to disk: \" + key_write.error());\n    }\n\n    \/\/ Write the authorized certificate to disk.\n    Try<Nothing> certificate_write =\n      process::network::openssl::write_certificate_file(\n          certificate.get(),\n          certificate_path());\n\n    if (certificate_write.isError()) {\n      cleanup(\"Could not write certificate to disk: \" +\n              certificate_write.error());\n    }\n\n    \/\/ Generate a scrap key.\n    scrap_key = process::network::openssl::generate_private_rsa_key();\n    if (scrap_key.isError()) {\n      cleanup(\"Could not generate a scrap private key: \" + scrap_key.error());\n    }\n\n    \/\/ Write the scrap key to disk.\n    key_write = process::network::openssl::write_key_file(\n        scrap_key.get(),\n        scrap_key_path());\n\n    if (key_write.isError()) {\n      cleanup(\"Could not write scrap key to disk: \" + key_write.error());\n    }\n\n    \/\/ Generate a scrap certificate.\n    scrap_certificate = process::network::openssl::generate_x509(\n        scrap_key.get(),\n        scrap_key.get());\n\n    if (scrap_certificate.isError()) {\n      cleanup(\"Could not generate a scrap certificate: \" +\n              scrap_certificate.error());\n    }\n\n    \/\/ Write the scrap certificate to disk.\n    certificate_write = process::network::openssl::write_certificate_file(\n        scrap_certificate.get(),\n        scrap_certificate_path());\n\n    if (certificate_write.isError()) {\n      cleanup(\"Could not write scrap certificate to disk: \" +\n              certificate_write.error());\n    }\n\n    \/\/ Since we successfully set up all our state, we call cleanup\n    \/\/ without an abort message (so as not to abort).\n    cleanup();\n  }\n};\n\n\n\/**\n * A Test fixture that sets up SSL keys and certificates.\n *\n * There are some helper functions like SSLTest::setup_server and\n * SSLTest::launch_client that factor out common behavior used in\n * tests.\n *\/\nclass SSLTest : public SSLTemporaryDirectoryTest\n{\nprotected:\n  SSLTest() : data(\"Hello World!\") {}\n\n  virtual void SetUp()\n  {\n    SSLTemporaryDirectoryTest::SetUp();\n    generate_keys_and_certs();\n  }\n\n  \/**\n   * Initializes a listening server.\n   *\n   * @param environment The SSL environment variables to launch the\n   *     server socket with.\n   *\n   * @return Socket if successful otherwise an Error.\n   *\/\n  Try<process::network::Socket> setup_server(\n      const std::map<std::string, std::string>& environment)\n  {\n    set_environment_variables(environment);\n\n    const Try<process::network::Socket> create =\n      process::network::Socket::create(process::network::Socket::SSL);\n\n    if (create.isError()) {\n      return Error(create.error());\n    }\n\n    process::network::Socket server = create.get();\n\n    \/\/ We need to explicitly bind to INADDR_LOOPBACK so the\n    \/\/ certificate we create in this test fixture can be verified.\n    Try<process::network::Address> bind =\n      server.bind(process::network::Address(net::IP(INADDR_LOOPBACK), 0));\n\n    if (bind.isError()) {\n      return Error(bind.error());\n    }\n\n    const Try<Nothing> listen = server.listen(BACKLOG);\n    if (listen.isError()) {\n      return Error(listen.error());\n    }\n\n    return server;\n  }\n\n  \/**\n   * Launches a test SSL client as a subprocess connecting to the\n   * server.\n   *\n   * The subprocess calls the 'ssl-client' binary with the provided\n   * environment.\n   *\n   * @param environment The SSL environment variables to launch the\n   *     SSL client subprocess with.\n   * @param use_ssl_socket Whether the SSL client will try to connect\n   *     using an SSL socket or a POLL socket.\n   *\n   * @return Subprocess if successful otherwise an Error.\n   *\/\n  Try<process::Subprocess> launch_client(\n      const std::map<std::string, std::string>& environment,\n      const process::network::Socket& server,\n      bool use_ssl_socket)\n  {\n    const Try<process::network::Address> address = server.address();\n    if (address.isError()) {\n      return Error(address.error());\n    }\n\n    \/\/ Set up arguments to be passed to the 'client-ssl' binary.\n    const std::vector<std::string> argv = {\n      \"ssl-client\",\n      \"--use_ssl=\" + stringify(use_ssl_socket),\n      \"--server=127.0.0.1\",\n      \"--port=\" + stringify(address.get().port),\n      \"--data=\" + data};\n\n    Result<std::string> path = os::realpath(BUILD_DIR);\n    if (!path.isSome()) {\n      return Error(\"Could not establish build directory path\");\n    }\n\n    return process::subprocess(\n        path::join(path.get(), \"ssl-client\"),\n        argv,\n        process::Subprocess::PIPE(),\n        process::Subprocess::PIPE(),\n        process::Subprocess::FD(STDERR_FILENO),\n        None(),\n        environment);\n  }\n\n  static constexpr size_t BACKLOG = 5;\n\n  const std::string data;\n};\n\n#endif \/\/ USE_SSL_SOCKET\n\n#endif \/\/ __PROCESS_SSL_TEST_HPP__\n<commit_msg>Add a TearDownTestCase method for cleaning up after tests that reinitialize SSL configuration.<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#ifndef __PROCESS_SSL_TEST_HPP__\n#define __PROCESS_SSL_TEST_HPP__\n\n#ifdef USE_SSL_SOCKET\n#include <string>\n\n#include <openssl\/rsa.h>\n#include <openssl\/bio.h>\n#include <openssl\/x509.h>\n#include <openssl\/x509v3.h>\n\n#include <process\/io.hpp>\n#include <process\/process.hpp>\n#include <process\/socket.hpp>\n#include <process\/subprocess.hpp>\n\n#include <process\/ssl\/utilities.hpp>\n\n#include <stout\/none.hpp>\n#include <stout\/option.hpp>\n#include <stout\/try.hpp>\n#include <stout\/result.hpp>\n#endif \/\/ USE_SSL_SOCKET\n\n#include <stout\/tests\/utils.hpp>\n\n#ifdef USE_SSL_SOCKET\nnamespace process {\nnamespace network {\nnamespace openssl {\n\n\/\/ Forward declare the `reinitialize()` function since we want to\n\/\/ programatically change SSL flags during tests.\nvoid reinitialize();\n\n} \/\/ namespace openssl {\n} \/\/ namespace network {\n} \/\/ namespace process {\n#endif \/\/ USE_SSL_SOCKET\n\n\/\/ When SSL is not compiled in, we want the `SSLTemporaryDirectoryTest` class\n\/\/ to exist, so that other tests can inherit it; this class is equivalent\n\/\/ to the `TemporaryDirectoryTest` under that condition.\n#ifndef USE_SSL_SOCKET\nclass SSLTemporaryDirectoryTest : public TemporaryDirectoryTest {};\n#else\n\/**\n * A Test fixture that contains helpers for setting up SSL keys\n * and certificates, as well as cleaning them up afterwards.\n *\/\nclass SSLTemporaryDirectoryTest : public TemporaryDirectoryTest\n{\npublic:\n  static void TearDownTestCase()\n  {\n    \/\/ Clear and reset any environment variables.\n    set_environment_variables({});\n  }\n\nprotected:\n  \/**\n   * @return The path to the authorized private key.\n   *\/\n  Path key_path()\n  {\n    return Path(path::join(os::getcwd(), \"key.pem\"));\n  }\n\n  \/**\n   * @return The path to the authorized certificate.\n   *\/\n  Path certificate_path()\n  {\n    return Path(path::join(os::getcwd(), \"cert.pem\"));\n  }\n\n  \/**\n   * @return The path to the unauthorized private key.\n   *\/\n  Path scrap_key_path()\n  {\n    return Path(path::join(os::getcwd(), \"scrap_key.pem\"));\n  }\n\n  \/**\n   * @return The path to the unauthorized certificate.\n   *\/\n  Path scrap_certificate_path()\n  {\n    return Path(path::join(os::getcwd(), \"scrap_cert.pem\"));\n  }\n\n  \/**\n   * Wipes out existing SSL environment variables and replaces them\n   * with the given map.  The SSL library is reinitialized afterwards.\n   *\/\n  static void set_environment_variables(\n      const std::map<std::string, std::string>& environment)\n  {\n    \/\/ This unsets all the SSL environment variables. Necessary for\n    \/\/ ensuring a clean starting slate between tests.\n    os::unsetenv(\"SSL_ENABLED\");\n    os::unsetenv(\"SSL_SUPPORT_DOWNGRADE\");\n    os::unsetenv(\"SSL_CERT_FILE\");\n    os::unsetenv(\"SSL_KEY_FILE\");\n    os::unsetenv(\"SSL_VERIFY_CERT\");\n    os::unsetenv(\"SSL_REQUIRE_CERT\");\n    os::unsetenv(\"SSL_VERIFY_DEPTH\");\n    os::unsetenv(\"SSL_CA_DIR\");\n    os::unsetenv(\"SSL_CA_FILE\");\n    os::unsetenv(\"SSL_CIPHERS\");\n    os::unsetenv(\"SSL_ENABLE_SSL_V3\");\n    os::unsetenv(\"SSL_ENABLE_TLS_V1_0\");\n    os::unsetenv(\"SSL_ENABLE_TLS_V1_1\");\n    os::unsetenv(\"SSL_ENABLE_TLS_V1_2\");\n\n    \/\/ Copy the given map into the clean slate.\n    foreachpair (\n        const std::string& name, const std::string& value, environment) {\n      os::setenv(name, value);\n    }\n\n    \/\/ Make sure the library internally reflects the new environment variables.\n    process::network::openssl::reinitialize();\n  }\n\n  \/**\n   * Sets up a private key and certificate pair at SSLTest::key_path\n   * and SSLTest::certificate_path.  Also sets up an independent 'scrap'\n   * pair that can be used to test an invalid certificate authority chain.\n   * These can be found at SSLTest::scrap_key_path and\n   * SSLTest::scrap_certificate_path.\n   *\/\n  void generate_keys_and_certs() {\n    \/\/ We store the allocated objects in these results so that we can\n    \/\/ have a consolidated 'cleanup()' function. This makes all the\n    \/\/ 'EXIT()' calls more readable and less error prone.\n    Result<EVP_PKEY*> private_key = None();\n    Result<X509*> certificate = None();\n    Result<EVP_PKEY*> scrap_key = None();\n    Result<X509*> scrap_certificate = None();\n\n    auto cleanup = [&private_key, &certificate, &scrap_key, &scrap_certificate](\n        const Option<std::string> abort_message = None()) {\n      if (private_key.isSome()) { EVP_PKEY_free(private_key.get()); }\n      if (certificate.isSome()) { X509_free(certificate.get()); }\n      if (scrap_key.isSome()) { EVP_PKEY_free(scrap_key.get()); }\n      if (scrap_certificate.isSome()) { X509_free(scrap_certificate.get()); }\n\n      \/\/ We abort here because failure during setup indicates that something\n      \/\/ is horribly and irrecoverably wrong.\n      if (abort_message.isSome()) {\n        ABORT(abort_message.get());\n      }\n    };\n\n    \/\/ Generate the authority key.\n    private_key = process::network::openssl::generate_private_rsa_key();\n    if (private_key.isError()) {\n      cleanup(\"Could not generate private key: \" + private_key.error());\n    }\n\n    \/\/ Figure out the hostname that 'INADDR_LOOPBACK' will bind to.\n    \/\/ Set the hostname of the certificate to this hostname so that\n    \/\/ hostname verification of the certificate will pass.\n    Try<std::string> hostname = net::getHostname(net::IP(INADDR_LOOPBACK));\n    if (hostname.isError()) {\n      cleanup(\"Could not determine hostname of 'INADDR_LOOPBACK': \" +\n              hostname.error());\n    }\n\n    \/\/ Generate an authorized certificate.\n    certificate = process::network::openssl::generate_x509(\n        private_key.get(),\n        private_key.get(),\n        None(),\n        1,\n        365,\n        hostname.get());\n\n    if (certificate.isError()) {\n      cleanup(\"Could not generate certificate: \" + certificate.error());\n    }\n\n    \/\/ Write the authority key to disk.\n    Try<Nothing> key_write =\n      process::network::openssl::write_key_file(private_key.get(), key_path());\n\n    if (key_write.isError()) {\n      cleanup(\"Could not write private key to disk: \" + key_write.error());\n    }\n\n    \/\/ Write the authorized certificate to disk.\n    Try<Nothing> certificate_write =\n      process::network::openssl::write_certificate_file(\n          certificate.get(),\n          certificate_path());\n\n    if (certificate_write.isError()) {\n      cleanup(\"Could not write certificate to disk: \" +\n              certificate_write.error());\n    }\n\n    \/\/ Generate a scrap key.\n    scrap_key = process::network::openssl::generate_private_rsa_key();\n    if (scrap_key.isError()) {\n      cleanup(\"Could not generate a scrap private key: \" + scrap_key.error());\n    }\n\n    \/\/ Write the scrap key to disk.\n    key_write = process::network::openssl::write_key_file(\n        scrap_key.get(),\n        scrap_key_path());\n\n    if (key_write.isError()) {\n      cleanup(\"Could not write scrap key to disk: \" + key_write.error());\n    }\n\n    \/\/ Generate a scrap certificate.\n    scrap_certificate = process::network::openssl::generate_x509(\n        scrap_key.get(),\n        scrap_key.get());\n\n    if (scrap_certificate.isError()) {\n      cleanup(\"Could not generate a scrap certificate: \" +\n              scrap_certificate.error());\n    }\n\n    \/\/ Write the scrap certificate to disk.\n    certificate_write = process::network::openssl::write_certificate_file(\n        scrap_certificate.get(),\n        scrap_certificate_path());\n\n    if (certificate_write.isError()) {\n      cleanup(\"Could not write scrap certificate to disk: \" +\n              certificate_write.error());\n    }\n\n    \/\/ Since we successfully set up all our state, we call cleanup\n    \/\/ without an abort message (so as not to abort).\n    cleanup();\n  }\n};\n\n\n\/**\n * A Test fixture that sets up SSL keys and certificates.\n *\n * There are some helper functions like SSLTest::setup_server and\n * SSLTest::launch_client that factor out common behavior used in\n * tests.\n *\/\nclass SSLTest : public SSLTemporaryDirectoryTest\n{\nprotected:\n  SSLTest() : data(\"Hello World!\") {}\n\n  virtual void SetUp()\n  {\n    SSLTemporaryDirectoryTest::SetUp();\n    generate_keys_and_certs();\n  }\n\n  \/**\n   * Initializes a listening server.\n   *\n   * @param environment The SSL environment variables to launch the\n   *     server socket with.\n   *\n   * @return Socket if successful otherwise an Error.\n   *\/\n  Try<process::network::Socket> setup_server(\n      const std::map<std::string, std::string>& environment)\n  {\n    set_environment_variables(environment);\n\n    const Try<process::network::Socket> create =\n      process::network::Socket::create(process::network::Socket::SSL);\n\n    if (create.isError()) {\n      return Error(create.error());\n    }\n\n    process::network::Socket server = create.get();\n\n    \/\/ We need to explicitly bind to INADDR_LOOPBACK so the\n    \/\/ certificate we create in this test fixture can be verified.\n    Try<process::network::Address> bind =\n      server.bind(process::network::Address(net::IP(INADDR_LOOPBACK), 0));\n\n    if (bind.isError()) {\n      return Error(bind.error());\n    }\n\n    const Try<Nothing> listen = server.listen(BACKLOG);\n    if (listen.isError()) {\n      return Error(listen.error());\n    }\n\n    return server;\n  }\n\n  \/**\n   * Launches a test SSL client as a subprocess connecting to the\n   * server.\n   *\n   * The subprocess calls the 'ssl-client' binary with the provided\n   * environment.\n   *\n   * @param environment The SSL environment variables to launch the\n   *     SSL client subprocess with.\n   * @param use_ssl_socket Whether the SSL client will try to connect\n   *     using an SSL socket or a POLL socket.\n   *\n   * @return Subprocess if successful otherwise an Error.\n   *\/\n  Try<process::Subprocess> launch_client(\n      const std::map<std::string, std::string>& environment,\n      const process::network::Socket& server,\n      bool use_ssl_socket)\n  {\n    const Try<process::network::Address> address = server.address();\n    if (address.isError()) {\n      return Error(address.error());\n    }\n\n    \/\/ Set up arguments to be passed to the 'client-ssl' binary.\n    const std::vector<std::string> argv = {\n      \"ssl-client\",\n      \"--use_ssl=\" + stringify(use_ssl_socket),\n      \"--server=127.0.0.1\",\n      \"--port=\" + stringify(address.get().port),\n      \"--data=\" + data};\n\n    Result<std::string> path = os::realpath(BUILD_DIR);\n    if (!path.isSome()) {\n      return Error(\"Could not establish build directory path\");\n    }\n\n    return process::subprocess(\n        path::join(path.get(), \"ssl-client\"),\n        argv,\n        process::Subprocess::PIPE(),\n        process::Subprocess::PIPE(),\n        process::Subprocess::FD(STDERR_FILENO),\n        None(),\n        environment);\n  }\n\n  static constexpr size_t BACKLOG = 5;\n\n  const std::string data;\n};\n\n#endif \/\/ USE_SSL_SOCKET\n\n#endif \/\/ __PROCESS_SSL_TEST_HPP__\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>localization: fixing issue #8185<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2004 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#ifndef OPERATOR_040729_HPP\n#define OPERATOR_040729_HPP\n\n#include <boost\/mpl\/eval_if.hpp>\n#include <boost\/mpl\/identity.hpp>\n#include <boost\/mpl\/apply_wrap.hpp>\n#include <boost\/preprocessor\/repetition\/enum_trailing.hpp>\n#include <boost\/preprocessor\/repetition\/enum_trailing_params.hpp>\n#include <boost\/type_traits\/is_same.hpp>\n#include <luabind\/detail\/other.hpp>\n#include <luabind\/raw_policy.hpp>\n\n#if defined(__GNUC__) && __GNUC__ < 3\n# define LUABIND_NO_STRINGSTREAM\n#else\n# if defined(BOOST_NO_STRINGSTREAM)\n#  define LUABIND_NO_STRINGSTREAM\n# endif\n#endif\n\n#ifdef LUABIND_NO_STRINGSTREAM\n#include <strstream>\n#else\n#include <sstream>\n#endif\n\nnamespace luabind { namespace detail {\n\n    template<class W, class T> struct unwrap_parameter_type;\n    template<class Derived> struct operator_ {};\n\n    struct operator_void_return {};\n\n#if !BOOST_WORKAROUND(BOOST_MSVC, <= 1300)\n    template<class T>\n    inline T const& operator,(T const& x, operator_void_return)\n    {\n        return x;\n    }\n#endif\n    \n}} \/\/ namespace luabind\n\nnamespace luabind { namespace operators {\n\n   #define BOOST_PP_ITERATION_PARAMS_1 (3, \\\n       (0, LUABIND_MAX_ARITY, <luabind\/detail\/call_operator_iterate.hpp>))\n   #include BOOST_PP_ITERATE()\n    \n}} \/\/ namespace luabind::operators\n\n#include <boost\/preprocessor\/iteration\/local.hpp>\n\nnamespace luabind {\n\n    template<class Derived>\n    struct self_base\n    {\n        operators::call_operator0<Derived> operator()() const\n        {\n            return 0;\n        }\n        \n#define BOOST_PP_LOCAL_MACRO(n) \\\n        template<BOOST_PP_ENUM_PARAMS(n, class A)> \\\n        BOOST_PP_CAT(operators::call_operator, n)< \\\n            Derived \\\n            BOOST_PP_ENUM_TRAILING_PARAMS(n, A) \\\n        >\\\n        operator()( \\\n            BOOST_PP_ENUM_BINARY_PARAMS(n, A, const& BOOST_PP_INTERCEPT) \\\n        ) const \\\n        { \\\n            return 0; \\\n        }\n\n#define BOOST_PP_LOCAL_LIMITS (1, LUABIND_MAX_ARITY)\n#include BOOST_PP_LOCAL_ITERATE()\n\n    };\n\n    struct self_type : self_base<self_type>\n    {\n    };\n\n    struct const_self_type : self_base<const_self_type>\n    {\n    };\n\nnamespace detail {\n\n    template<class W, class T>\n    struct unwrap_parameter_type\n    {\n        typedef typename boost::mpl::eval_if<\n            boost::is_same<T, self_type>\n          , boost::mpl::identity<W&>\n          , boost::mpl::eval_if<\n                boost::is_same<T, const_self_type>\n              , boost::mpl::identity<W const&>\n              , unwrap_other<T>\n            >\n        >::type type;\n    };\n\n    template<class Derived, class A, class B>\n    struct binary_operator \n        : operator_<binary_operator<Derived, A, B> >\n    {\n        binary_operator(int) {}\n\n        template<class T, class Policies>\n        struct apply \n        {\n            typedef typename unwrap_parameter_type<T, A>::type arg0;\n            typedef typename unwrap_parameter_type<T, B>::type arg1;\n\n            static void execute(lua_State* L, arg0 _0, arg1 _1)\n            {\n                Derived::template apply<arg0, arg1, Policies>::execute(\n                    L, _0, _1);\n            }\n        };\n\n        static char const* name()\n        {\n            return Derived::name();\n        }\n    };\n\n    template<class Derived, class A>\n    struct unary_operator \n        : operator_<unary_operator<Derived, A> >\n    {\n        unary_operator(int) {}\n        \n        template<class T, class Policies>\n        struct apply\n        {\n            typedef typename unwrap_parameter_type<T, A>::type arg0;\n\n            static void execute(lua_State* L, arg0 _0)\n            {\n                Derived::template apply<arg0, Policies>::execute(L, _0);\n            }\n        };\n\n        static char const* name()\n        {\n            return Derived::name();\n        }\n    };\n\n    template<class Policies>\n    inline void operator_result(lua_State* L, operator_void_return, Policies*)\n    {\n    }\n\n    namespace mpl = boost::mpl;\n\n    template<class T, class Policies>\n    inline void operator_result(lua_State* L, T const& x, Policies*)\n    {\n        typedef typename find_conversion_policy<\n            0\n          , Policies\n        >::type cv_policy;\n\n        typename mpl::apply_wrap2<cv_policy,T,cpp_to_lua>::type cv;\n\n        cv.apply(L, x);\n    }\n\n}} \/\/ namespace detail::luabind\n\nnamespace luabind {\n\n#define LUABIND_BINARY_OPERATOR(name_, op) \\\n    namespace operators { \\\n\\\n        struct name_ \\\n        { \\\n            template<class T0, class T1, class Policies> \\\n            struct apply \\\n            { \\\n                static void execute(lua_State* L, T0 _0, T1 _1) \\\n                { \\\n                    detail::operator_result(L, _0 op _1, (Policies*)0); \\\n                } \\\n            }; \\\n\\\n            static char const* name() \\\n            { \\\n                return \"__\" # name_; \\\n            } \\\n        }; \\\n\\\n    } \\\n    \\\n    template<class T, class U> \\\n    detail::binary_operator< \\\n        operators::name_ \\\n      , U \\\n      , T \\\n    > \\\n    inline operator op(self_base<U>, T const&) \\\n    { \\\n        return 0; \\\n    } \\\n    \\\n    template<class T, class U> \\\n    detail::binary_operator< \\\n        operators::name_ \\\n      , T \\\n      , U \\\n    > \\\n    inline operator op(T const&, self_base<U>) \\\n    { \\\n        return 0; \\\n    } \\\n    \\\n    detail::binary_operator< \\\n        operators::name_ \\\n      , self_type \\\n      , self_type \\\n    > \\\n    inline operator op(self_type, self_type) \\\n    { \\\n        return 0; \\\n    } \\\n    \\\n    detail::binary_operator< \\\n        operators::name_ \\\n      , self_type \\\n      , const_self_type \\\n    > \\\n    inline operator op(self_type, const_self_type) \\\n    { \\\n        return 0; \\\n    } \\\n    \\\n    detail::binary_operator< \\\n        operators::name_ \\\n      , const_self_type \\\n      , self_type \\\n    > \\\n    inline operator op(const_self_type, self_type) \\\n    { \\\n        return 0; \\\n    } \\\n    \\\n    detail::binary_operator< \\\n        operators::name_ \\\n      , const_self_type \\\n      , const_self_type \\\n    > \\\n    inline operator op(const_self_type, const_self_type) \\\n    { \\\n        return 0; \\\n    }\n\n    LUABIND_BINARY_OPERATOR(add, +)\n    LUABIND_BINARY_OPERATOR(sub, -)\n    LUABIND_BINARY_OPERATOR(mul, *)\n    LUABIND_BINARY_OPERATOR(div, \/)\n    LUABIND_BINARY_OPERATOR(pow, ^)\n    LUABIND_BINARY_OPERATOR(lt, <)\n    LUABIND_BINARY_OPERATOR(le, <=)\n    LUABIND_BINARY_OPERATOR(eq, ==)\n\n#undef LUABIND_UNARY_OPERATOR\n\n#define LUABIND_UNARY_OPERATOR(name_, op, fn) \\\n    namespace operators { \\\n\\\n        struct name_ \\\n        { \\\n            template<class T, class Policies> \\\n            struct apply \\\n            { \\\n                static void execute(lua_State* L, T x) \\\n                { \\\n                    detail::operator_result(L, op(x), (Policies*)0); \\\n                } \\\n            }; \\\n\\\n            static char const* name() \\\n            { \\\n                return \"__\" # name_; \\\n            } \\\n        }; \\\n\\\n    } \\\n    \\\n    template<class T> \\\n    detail::unary_operator< \\\n        operators::name_ \\\n      , T \\\n    > \\\n    inline fn(self_base<T>) \\\n    { \\\n        return 0; \\\n    }\n\n    template<class T>\n    std::string tostring_operator(T const& x)\n    {\n#ifdef LUABIND_NO_STRINGSTREAM\n        std::strstream s;\n        s << x << std::ends;\n#else\n        std::stringstream s;\n        s << x;\n#endif\n        return s.str();\n    }\n    \n    LUABIND_UNARY_OPERATOR(tostring, tostring_operator, tostring)\n    LUABIND_UNARY_OPERATOR(unm, -, operator-)\n\n#undef LUABIND_BINARY_OPERATOR\n\n    namespace {\n\n        LUABIND_ANONYMOUS_FIX self_type self;\n        LUABIND_ANONYMOUS_FIX const_self_type const_self;\n\n    } \/\/ namespace unnamed\n    \n} \/\/ namespace luabind\n\n#endif \/\/ OPERATOR_040729_HPP\n\n<commit_msg>Fix unused variable warnings for self and const_self with GCC.<commit_after>\/\/ Copyright (c) 2004 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#ifndef OPERATOR_040729_HPP\n#define OPERATOR_040729_HPP\n\n#include <boost\/mpl\/eval_if.hpp>\n#include <boost\/mpl\/identity.hpp>\n#include <boost\/mpl\/apply_wrap.hpp>\n#include <boost\/preprocessor\/repetition\/enum_trailing.hpp>\n#include <boost\/preprocessor\/repetition\/enum_trailing_params.hpp>\n#include <boost\/type_traits\/is_same.hpp>\n#include <luabind\/detail\/other.hpp>\n#include <luabind\/raw_policy.hpp>\n\n#if defined(__GNUC__) && __GNUC__ < 3\n# define LUABIND_NO_STRINGSTREAM\n#else\n# if defined(BOOST_NO_STRINGSTREAM)\n#  define LUABIND_NO_STRINGSTREAM\n# endif\n#endif\n\n#ifdef LUABIND_NO_STRINGSTREAM\n#include <strstream>\n#else\n#include <sstream>\n#endif\n\nnamespace luabind { namespace detail {\n\n    template<class W, class T> struct unwrap_parameter_type;\n    template<class Derived> struct operator_ {};\n\n    struct operator_void_return {};\n\n#if !BOOST_WORKAROUND(BOOST_MSVC, <= 1300)\n    template<class T>\n    inline T const& operator,(T const& x, operator_void_return)\n    {\n        return x;\n    }\n#endif\n    \n}} \/\/ namespace luabind\n\nnamespace luabind { namespace operators {\n\n   #define BOOST_PP_ITERATION_PARAMS_1 (3, \\\n       (0, LUABIND_MAX_ARITY, <luabind\/detail\/call_operator_iterate.hpp>))\n   #include BOOST_PP_ITERATE()\n    \n}} \/\/ namespace luabind::operators\n\n#include <boost\/preprocessor\/iteration\/local.hpp>\n\nnamespace luabind {\n\n    template<class Derived>\n    struct self_base\n    {\n        operators::call_operator0<Derived> operator()() const\n        {\n            return 0;\n        }\n        \n#define BOOST_PP_LOCAL_MACRO(n) \\\n        template<BOOST_PP_ENUM_PARAMS(n, class A)> \\\n        BOOST_PP_CAT(operators::call_operator, n)< \\\n            Derived \\\n            BOOST_PP_ENUM_TRAILING_PARAMS(n, A) \\\n        >\\\n        operator()( \\\n            BOOST_PP_ENUM_BINARY_PARAMS(n, A, const& BOOST_PP_INTERCEPT) \\\n        ) const \\\n        { \\\n            return 0; \\\n        }\n\n#define BOOST_PP_LOCAL_LIMITS (1, LUABIND_MAX_ARITY)\n#include BOOST_PP_LOCAL_ITERATE()\n\n    };\n\n    struct self_type : self_base<self_type>\n    {\n    };\n\n    struct const_self_type : self_base<const_self_type>\n    {\n    };\n\nnamespace detail {\n\n    template<class W, class T>\n    struct unwrap_parameter_type\n    {\n        typedef typename boost::mpl::eval_if<\n            boost::is_same<T, self_type>\n          , boost::mpl::identity<W&>\n          , boost::mpl::eval_if<\n                boost::is_same<T, const_self_type>\n              , boost::mpl::identity<W const&>\n              , unwrap_other<T>\n            >\n        >::type type;\n    };\n\n    template<class Derived, class A, class B>\n    struct binary_operator \n        : operator_<binary_operator<Derived, A, B> >\n    {\n        binary_operator(int) {}\n\n        template<class T, class Policies>\n        struct apply \n        {\n            typedef typename unwrap_parameter_type<T, A>::type arg0;\n            typedef typename unwrap_parameter_type<T, B>::type arg1;\n\n            static void execute(lua_State* L, arg0 _0, arg1 _1)\n            {\n                Derived::template apply<arg0, arg1, Policies>::execute(\n                    L, _0, _1);\n            }\n        };\n\n        static char const* name()\n        {\n            return Derived::name();\n        }\n    };\n\n    template<class Derived, class A>\n    struct unary_operator \n        : operator_<unary_operator<Derived, A> >\n    {\n        unary_operator(int) {}\n        \n        template<class T, class Policies>\n        struct apply\n        {\n            typedef typename unwrap_parameter_type<T, A>::type arg0;\n\n            static void execute(lua_State* L, arg0 _0)\n            {\n                Derived::template apply<arg0, Policies>::execute(L, _0);\n            }\n        };\n\n        static char const* name()\n        {\n            return Derived::name();\n        }\n    };\n\n    template<class Policies>\n    inline void operator_result(lua_State* L, operator_void_return, Policies*)\n    {\n    }\n\n    namespace mpl = boost::mpl;\n\n    template<class T, class Policies>\n    inline void operator_result(lua_State* L, T const& x, Policies*)\n    {\n        typedef typename find_conversion_policy<\n            0\n          , Policies\n        >::type cv_policy;\n\n        typename mpl::apply_wrap2<cv_policy,T,cpp_to_lua>::type cv;\n\n        cv.apply(L, x);\n    }\n\n}} \/\/ namespace detail::luabind\n\nnamespace luabind {\n\n#define LUABIND_BINARY_OPERATOR(name_, op) \\\n    namespace operators { \\\n\\\n        struct name_ \\\n        { \\\n            template<class T0, class T1, class Policies> \\\n            struct apply \\\n            { \\\n                static void execute(lua_State* L, T0 _0, T1 _1) \\\n                { \\\n                    detail::operator_result(L, _0 op _1, (Policies*)0); \\\n                } \\\n            }; \\\n\\\n            static char const* name() \\\n            { \\\n                return \"__\" # name_; \\\n            } \\\n        }; \\\n\\\n    } \\\n    \\\n    template<class T, class U> \\\n    detail::binary_operator< \\\n        operators::name_ \\\n      , U \\\n      , T \\\n    > \\\n    inline operator op(self_base<U>, T const&) \\\n    { \\\n        return 0; \\\n    } \\\n    \\\n    template<class T, class U> \\\n    detail::binary_operator< \\\n        operators::name_ \\\n      , T \\\n      , U \\\n    > \\\n    inline operator op(T const&, self_base<U>) \\\n    { \\\n        return 0; \\\n    } \\\n    \\\n    detail::binary_operator< \\\n        operators::name_ \\\n      , self_type \\\n      , self_type \\\n    > \\\n    inline operator op(self_type, self_type) \\\n    { \\\n        return 0; \\\n    } \\\n    \\\n    detail::binary_operator< \\\n        operators::name_ \\\n      , self_type \\\n      , const_self_type \\\n    > \\\n    inline operator op(self_type, const_self_type) \\\n    { \\\n        return 0; \\\n    } \\\n    \\\n    detail::binary_operator< \\\n        operators::name_ \\\n      , const_self_type \\\n      , self_type \\\n    > \\\n    inline operator op(const_self_type, self_type) \\\n    { \\\n        return 0; \\\n    } \\\n    \\\n    detail::binary_operator< \\\n        operators::name_ \\\n      , const_self_type \\\n      , const_self_type \\\n    > \\\n    inline operator op(const_self_type, const_self_type) \\\n    { \\\n        return 0; \\\n    }\n\n    LUABIND_BINARY_OPERATOR(add, +)\n    LUABIND_BINARY_OPERATOR(sub, -)\n    LUABIND_BINARY_OPERATOR(mul, *)\n    LUABIND_BINARY_OPERATOR(div, \/)\n    LUABIND_BINARY_OPERATOR(pow, ^)\n    LUABIND_BINARY_OPERATOR(lt, <)\n    LUABIND_BINARY_OPERATOR(le, <=)\n    LUABIND_BINARY_OPERATOR(eq, ==)\n\n#undef LUABIND_UNARY_OPERATOR\n\n#define LUABIND_UNARY_OPERATOR(name_, op, fn) \\\n    namespace operators { \\\n\\\n        struct name_ \\\n        { \\\n            template<class T, class Policies> \\\n            struct apply \\\n            { \\\n                static void execute(lua_State* L, T x) \\\n                { \\\n                    detail::operator_result(L, op(x), (Policies*)0); \\\n                } \\\n            }; \\\n\\\n            static char const* name() \\\n            { \\\n                return \"__\" # name_; \\\n            } \\\n        }; \\\n\\\n    } \\\n    \\\n    template<class T> \\\n    detail::unary_operator< \\\n        operators::name_ \\\n      , T \\\n    > \\\n    inline fn(self_base<T>) \\\n    { \\\n        return 0; \\\n    }\n\n    template<class T>\n    std::string tostring_operator(T const& x)\n    {\n#ifdef LUABIND_NO_STRINGSTREAM\n        std::strstream s;\n        s << x << std::ends;\n#else\n        std::stringstream s;\n        s << x;\n#endif\n        return s.str();\n    }\n    \n    LUABIND_UNARY_OPERATOR(tostring, tostring_operator, tostring)\n    LUABIND_UNARY_OPERATOR(unm, -, operator-)\n\n#undef LUABIND_BINARY_OPERATOR\n\n    namespace {\n\n        LUABIND_ANONYMOUS_FIX self_type const self = self_type();\n        LUABIND_ANONYMOUS_FIX const_self_type const const_self = const_self_type();\n\n    } \/\/ namespace unnamed\n    \n} \/\/ namespace luabind\n\n#endif \/\/ OPERATOR_040729_HPP\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\/\/ Wrappers\n#include \"otbWrapperApplication.h\"\n#include \"otbWrapperApplicationFactory.h\"\n#include \"otbWrapperChoiceParameter.h\"\n#include \"otbWrapperElevationParametersHandler.h\"\n#include \"otbSensorModelAdapter.h\"\n\nnamespace otb\n{\nnamespace Wrapper\n{\nclass RefineSensorModel : public Application\n{\npublic:\n  \/** Standard class typedefs. *\/\n  typedef RefineSensorModel             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  itkTypeMacro(RefineSensorModel, otb::Application);\n\nprivate:\n  void DoInit()\n  {\n    SetName(\"RefineSensorModel\");\n    SetDescription(\"Perform LSQR to fit sensor model to a set of tie points\");\n    \n    SetDocName(\"Refine Sensor Model\");\n    SetDocLongDescription(\"TODO\");\n    \n    SetDocLimitations(\"None\");\n    SetDocAuthors(\"OTB-Team\");\n    \n    AddParameter(ParameterType_InputFilename,\"ingeom\",\"Input geom file\");\n    SetParameterDescription(\"ingeom\",\"Geom file containing the sensor model to refine\");\n\n    AddParameter(ParameterType_OutputFilename,\"outgeom\",\"Output geom file\");\n    SetParameterDescription(\"outgeom\",\"Geom file containing the refined sensor model\");\n\n    AddParameter(ParameterType_InputFilename,\"inpoints\",\"Input file containing tie points\");\n    SetParameterDescription(\"inpoints\",\"Input file containing tie points. Points are stored in following format: row col lon lat. Line beginning with # are ignored.\");\n\n    \/\/ Elevation\n    ElevationParametersHandler::AddElevationParameters(this, \"elev\");\n    \n  }\n\n  void DoUpdateParameters()\n  {\n    \/\/ Nothing to do here : all parameters are independent\n  }\n\n  void DoExecute()\n  {\n    otb::SensorModelAdapter::Pointer sm = otb::SensorModelAdapter::New();\n    \n    \/\/ Read the geom file\n    bool canRead = sm->ReadGeomFile(GetParameterString(\"ingeom\"));\n    \n  \/\/ Setup elevation\n\n    otb::DEMHandler::Pointer demHandler = otb::DEMHandler::New();\n\n    double avg_elevation = 0;\n    bool use_avg_elevation = false;\n    switch(ElevationParametersHandler::GetElevationType(this, \"elev\"))\n      {\n      case Elevation_DEM:\n      {\n      sm->SetDEMDirectory(ElevationParametersHandler::GetDEMDirectory(this, \"elev\"));\n      sm->SetGeoidFile(ElevationParametersHandler::GetGeoidFile(this, \"elev\"));\n      demHandler->OpenDEMDirectory(ElevationParametersHandler::GetDEMDirectory(this, \"elev\"));\n      demHandler->OpenGeoidFile(ElevationParametersHandler::GetGeoidFile(this, \"elev\"));\n      }\n      break;\n      case Elevation_Average:\n      {\n      avg_elevation = ElevationParametersHandler::GetAverageElevation(this, \"elev\");\n      use_avg_elevation = true;\n      }\n      break;\n      }  \n\n  \/\/ Parse the input file for ground control points\n  std::ifstream ifs;\n  ifs.open(GetParameterString(\"inpoints\").c_str());\n   \n  while(!ifs.eof())\n    {\n    std::string line;\n    std::getline(ifs,line);\n    \n    double x,y,z,lat,lon;\n    \n    \/\/ Avoid commented lines or too short ones\n    if (!line.empty() && line[0] != '#')\n      {\n      \/\/ retrieve the x component\n      std::string::size_type pos = 0;\n      std::string::size_type nextpos = line.find_first_of(\"\\t\", pos);\n      x = atof(line.substr(pos, nextpos).c_str());\n      pos = nextpos + 1;\n      nextpos = line.find_first_of(\"\\t\", pos);\n      y = atof(line.substr(pos, nextpos).c_str());\n      pos = nextpos + 1;\n      nextpos = line.find_first_of(\"\\t\", pos);\n      lon = atof(line.substr(pos, nextpos).c_str());\n      pos = nextpos + 1;\n      nextpos = line.find_first_of(\"\\t\", pos);\n      lat = atof(line.substr(pos, nextpos).c_str());\n      \n      if(!use_avg_elevation)\n        z = demHandler->GetHeightAboveMSL(lon,lat);\n      else\n        z = avg_elevation;\n\n      std::cout<<\"x=\"<<x<<\", y=\"<<y<<\", z=\"<<z<<\", lon=\"<<lon<<\", lat=\"<<lat<<std::endl;\n\n      sm->AddTiePoint(x,y,z,lon,lat);\n      }\n    }\n  ifs.close();\n  \n  std::cout<<\"Optimization...\"<<std::endl;\n  sm->Optimize();\n  std::cout<<\"Done.\"<<std::endl;\n\n  bool canWrite = sm->WriteGeomFile(GetParameterString(\"outgeom\"));\n  }\n};\n}\n}\n\nOTB_APPLICATION_EXPORT(otb::Wrapper::RefineSensorModel)\n<commit_msg>ENH: Performances evaluation in new refine application<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\/\/ Wrappers\n#include \"otbWrapperApplication.h\"\n#include \"otbWrapperApplicationFactory.h\"\n#include \"otbWrapperChoiceParameter.h\"\n#include \"otbWrapperElevationParametersHandler.h\"\n#include \"otbSensorModelAdapter.h\"\n#include \"itkPoint.h\"\n#include \"otbGeographicalDistance.h\"\n\nnamespace otb\n{\nnamespace Wrapper\n{\nclass RefineSensorModel : public Application\n{\npublic:\n  \/** Standard class typedefs. *\/\n  typedef RefineSensorModel             Self;\n  typedef Application                   Superclass;\n  typedef itk::SmartPointer<Self>       Pointer;\n  typedef itk::SmartPointer<const Self> ConstPointer;\n\n  typedef itk::Point<double,3>                 PointType;\n  typedef otb::GeographicalDistance<PointType> DistanceType;\n\n  typedef std::pair<PointType,PointType>       TiePointType;\n  typedef std::vector<TiePointType>            TiePointsType;\n  \n  \/** Standard macro *\/\n  itkNewMacro(Self);\n  itkTypeMacro(RefineSensorModel, otb::Application);\n\nprivate:\n  void DoInit()\n  {\n    SetName(\"RefineSensorModel\");\n    SetDescription(\"Perform LSQR to fit sensor model to a set of tie points\");\n    \n    SetDocName(\"Refine Sensor Model\");\n    SetDocLongDescription(\"TODO\");\n    \n    SetDocLimitations(\"None\");\n    SetDocAuthors(\"OTB-Team\");\n    \n    AddParameter(ParameterType_InputFilename,\"ingeom\",\"Input geom file\");\n    SetParameterDescription(\"ingeom\",\"Geom file containing the sensor model to refine\");\n\n    AddParameter(ParameterType_OutputFilename,\"outgeom\",\"Output geom file\");\n    SetParameterDescription(\"outgeom\",\"Geom file containing the refined sensor model\");\n\n    AddParameter(ParameterType_InputFilename,\"inpoints\",\"Input file containing tie points\");\n    SetParameterDescription(\"inpoints\",\"Input file containing tie points. Points are stored in following format: row col lon lat. Line beginning with # are ignored.\");\n\n    AddParameter(ParameterType_OutputFilename,\"outstat\",\"Output file containing output precision statistics\");\n    SetParameterDescription(\"outstat\",\"Output file containing the following info: ref_lon ref_lat elevation predicted_lon predicted_lat x_error(meters) y_error(meters) overall_error(meters)\");\n    MandatoryOff(\"outstat\");\n    DisableParameter(\"outstat\");\n\n    \/\/ Elevation\n    ElevationParametersHandler::AddElevationParameters(this, \"elev\");\n    \n  }\n\n  void DoUpdateParameters()\n  {\n    \/\/ Nothing to do here : all parameters are independent\n  }\n\n  void DoExecute()\n  {\n    otb::SensorModelAdapter::Pointer sm = otb::SensorModelAdapter::New();\n    \n    \/\/ Read the geom file\n    bool canRead = sm->ReadGeomFile(GetParameterString(\"ingeom\"));\n    \n  \/\/ Setup elevation\n\n    otb::DEMHandler::Pointer demHandler = otb::DEMHandler::New();\n\n    double avg_elevation = 0;\n    bool use_avg_elevation = false;\n    switch(ElevationParametersHandler::GetElevationType(this, \"elev\"))\n      {\n      case Elevation_DEM:\n      {\n      sm->SetDEMDirectory(ElevationParametersHandler::GetDEMDirectory(this, \"elev\"));\n      sm->SetGeoidFile(ElevationParametersHandler::GetGeoidFile(this, \"elev\"));\n      demHandler->OpenDEMDirectory(ElevationParametersHandler::GetDEMDirectory(this, \"elev\"));\n      demHandler->OpenGeoidFile(ElevationParametersHandler::GetGeoidFile(this, \"elev\"));\n      }\n      break;\n      case Elevation_Average:\n      {\n      avg_elevation = ElevationParametersHandler::GetAverageElevation(this, \"elev\");\n      use_avg_elevation = true;\n      }\n      break;\n      }  \n\n  \/\/ Parse the input file for ground control points\n  std::ifstream ifs;\n  ifs.open(GetParameterString(\"inpoints\").c_str());\n   \n  TiePointsType tiepoints;\n\n  while(!ifs.eof())\n    {\n    std::string line;\n    std::getline(ifs,line);\n    \n    double x,y,z,lat,lon;\n    \n    \/\/ Avoid commented lines or too short ones\n    if (!line.empty() && line[0] != '#')\n      {\n      \/\/ retrieve the x component\n      std::string::size_type pos = 0;\n      std::string::size_type nextpos = line.find_first_of(\"\\t\", pos);\n      x = atof(line.substr(pos, nextpos).c_str());\n      pos = nextpos + 1;\n      nextpos = line.find_first_of(\"\\t\", pos);\n      y = atof(line.substr(pos, nextpos).c_str());\n      pos = nextpos + 1;\n      nextpos = line.find_first_of(\"\\t\", pos);\n      lon = atof(line.substr(pos, nextpos).c_str());\n      pos = nextpos + 1;\n      nextpos = line.find_first_of(\"\\t\", pos);\n      lat = atof(line.substr(pos, nextpos).c_str());\n      \n      if(!use_avg_elevation)\n        z = demHandler->GetHeightAboveMSL(lon,lat);\n      else\n        z = avg_elevation;\n\n      otbAppLogINFO(\"Adding tie point x=\"<<x<<\", y=\"<<y<<\", z=\"<<z<<\", lon=\"<<lon<<\", lat=\"<<lat);\n      \n      sm->AddTiePoint(x,y,z,lon,lat);\n\n      PointType p1,p2;\n      p1[0]=x;\n      p1[1]=y;\n      p1[2]=z;\n      p2[0]=lon;\n      p2[1]=lat;\n\n      tiepoints.push_back(std::make_pair(p1,p2));\n\n      }\n    }\n  ifs.close();\n  \n  otbAppLogINFO(\"Optimization in progress ...\");\n  sm->Optimize();\n  otbAppLogINFO(\"Done.\");\n\n  bool canWrite = sm->WriteGeomFile(GetParameterString(\"outgeom\"));\n\n  double rmse = 0;\n  double rmsex = 0;\n  double rmsey = 0;\n\n  DistanceType::Pointer distance = DistanceType::New();\n\n\n  std::ofstream ofs;\n  ofs<<std::fixed;\n  ofs.precision(12);\n  if(IsParameterEnabled(\"outstat\"))\n    {\n    ofs.open(GetParameterString(\"outstat\").c_str());\n    ofs<<\"#ref_lon ref_lat elevation predicted_lon predicted_lat x_error(meters) y_error(meters) global_error(meters)\"<<std::endl;\n    }\n\n  for(TiePointsType::const_iterator it = tiepoints.begin();\n      it!=tiepoints.end();++it)\n    {\n    PointType tmpPoint,tmpPointX,tmpPointY;\n    sm->ForwardTransformPoint(it->first[0],it->first[1],it->first[2],tmpPoint[0],tmpPoint[1],tmpPoint[2]);\n\n\n    \n    tmpPointX = tmpPoint;\n    tmpPointX[1] = it->second[1];\n\n    tmpPointY = tmpPoint;\n    tmpPointY[0] = it->second[0];\n\n    double gerror = distance->Evaluate(it->second,tmpPoint);\n    double xerror = distance->Evaluate(it->second,tmpPointX);\n    double yerror = distance->Evaluate(it->second,tmpPointY);\n\n    if(IsParameterEnabled(\"outstat\"))\n      ofs<<it->second[0]<<\"\\t\"<<it->second[1]<<\"\\t\"<<it->first[2]<<\"\\t\"<<tmpPoint[0]<<\"\\t\"<<tmpPoint[1]<<\"\\t\"<<xerror<<\"\\t\"<<yerror<<\"\\t\"<<gerror<<std::endl;\n\n    rmse += gerror*gerror;\n    rmsex+=xerror*xerror;\n    rmsey+=yerror*yerror;\n    }\n\n  rmse\/=tiepoints.size();\n  rmse=vcl_sqrt(rmse);\n  rmsex\/=tiepoints.size();\n  rmsex=vcl_sqrt(rmsex);\n  rmsey\/=tiepoints.size();\n  rmsey=vcl_sqrt(rmsey);\n\n  otbAppLogINFO(\"Estimated Overall Root Mean Square Error: \"<<rmse<<\" meters\");\n  otbAppLogINFO(\"Estimated Horizontal Root Mean Square Error: \"<<rmsex<<\" meters\");\n  otbAppLogINFO(\"Estimated Vertical Root Mean Square Error: \"<<rmsey<<\" meters\");\n\n  if(IsParameterEnabled(\"outstat\"))\n    ofs.close();\n}\n};\n}\n}\n\nOTB_APPLICATION_EXPORT(otb::Wrapper::RefineSensorModel)\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Perception: logic refinement of image2ground and ground2image<commit_after><|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n * Copyright 2018 The Apollo Authors. All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *****************************************************************************\/\n#include <gtest\/gtest.h>\n\n#define private public\n#define protected public\n#include \"modules\/perception\/common\/io\/io_util.h\"\n\nnamespace apollo {\nnamespace perception {\nnamespace common {\n\nTEST(CommonIoTest, read_pose_file) {\n  const std::string testdata_folder =\n      \"modules\/perception\/testdata\/common\/io\/params\/\";\n  std::string filename;\n  Eigen::Affine3d pose;\n  int frame_id = 0;\n  double time_stamp = 0;\n\n  EXPECT_FALSE(ReadPoseFile(filename, nullptr, nullptr, nullptr));\n  EXPECT_FALSE(ReadPoseFile(filename, &pose, &frame_id, &time_stamp));\n\n  filename = testdata_folder + \"pose_file.txt\";\n  EXPECT_TRUE(ReadPoseFile(filename, &pose, &frame_id, &time_stamp));\n}\n\n\/* TODO(all): to be fixed\nTEST(CommonIoTest, load_camera_intrinsic) {\n  const std::string testdata_folder =\n      \"modules\/perception\/testdata\/common\/io\/params\/\";\n  std::string yaml_file;\n  base::BrownCameraDistortionModel model;\n\n  EXPECT_FALSE(LoadBrownCameraIntrinsic(yaml_file, nullptr));\n  EXPECT_FALSE(LoadBrownCameraIntrinsic(yaml_file, &model));\n\n  yaml_file = testdata_folder + \"empty.yaml\";\n  EXPECT_FALSE(LoadBrownCameraIntrinsic(yaml_file, &model));\n\n  yaml_file = testdata_folder + \"test.yaml\";\n  EXPECT_TRUE(LoadBrownCameraIntrinsic(yaml_file, &model));\n  EXPECT_EQ(model.width_, 1192);\n  EXPECT_EQ(model.height_, 712);\n}\n*\/\n\/* TODO(all): to be fixed\nTEST(CommonIoTest, load_ocamera_intrinsic) {\n  const std::string testdata_folder =\n      \"modules\/perception\/testdata\/common\/io\/params\/\";\n  std::string yaml_file;\n  base::OmnidirectionalCameraDistortionModel model;\n\n  EXPECT_FALSE(LoadOmnidirectionalCameraIntrinsics(yaml_file, nullptr));\n  EXPECT_FALSE(LoadOmnidirectionalCameraIntrinsics(yaml_file, &model));\n\n  yaml_file = testdata_folder + \"empty.yaml\";\n  EXPECT_FALSE(LoadOmnidirectionalCameraIntrinsics(yaml_file, &model));\n\n  yaml_file = testdata_folder + \"test_ocam.yaml\";\n  EXPECT_TRUE(LoadOmnidirectionalCameraIntrinsics(yaml_file, &model));\n  EXPECT_EQ(model.width_, 1920);\n  EXPECT_EQ(model.height_, 1080);\n\n  yaml_file = testdata_folder + \"test_ocam1.yaml\";\n  EXPECT_FALSE(LoadOmnidirectionalCameraIntrinsics(yaml_file, &model));\n  yaml_file = testdata_folder + \"test_ocam2.yaml\";\n  EXPECT_FALSE(LoadOmnidirectionalCameraIntrinsics(yaml_file, &model));\n  yaml_file = testdata_folder + \"test_ocam3.yaml\";\n  EXPECT_FALSE(LoadOmnidirectionalCameraIntrinsics(yaml_file, &model));\n  yaml_file = testdata_folder + \"test_ocam4.yaml\";\n  EXPECT_FALSE(LoadOmnidirectionalCameraIntrinsics(yaml_file, &model));\n  yaml_file = testdata_folder + \"test_ocam5.yaml\";\n  EXPECT_FALSE(LoadOmnidirectionalCameraIntrinsics(yaml_file, &model));\n  yaml_file = testdata_folder + \"test_ocam6.yaml\";\n  EXPECT_FALSE(LoadOmnidirectionalCameraIntrinsics(yaml_file, &model));\n  yaml_file = testdata_folder + \"test_ocam7.yaml\";\n  EXPECT_FALSE(LoadOmnidirectionalCameraIntrinsics(yaml_file, &model));\n  yaml_file = testdata_folder + \"test_ocam8.yaml\";\n  EXPECT_FALSE(LoadOmnidirectionalCameraIntrinsics(yaml_file, &model));\n}\n*\/\n\n}  \/\/ namespace common\n}  \/\/ namespace perception\n}  \/\/ namespace apollo\n<commit_msg>Perception: added unit test of perception\/common\/io<commit_after>\/******************************************************************************\n * Copyright 2018 The Apollo Authors. All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *****************************************************************************\/\n#include <gtest\/gtest.h>\n\n#define private public\n#define protected public\n#include \"modules\/perception\/common\/io\/io_util.h\"\n\nnamespace apollo {\nnamespace perception {\nnamespace common {\n\nTEST(CommonIoTest, read_pose_file) {\n  const std::string testdata_folder =\n      \"modules\/perception\/testdata\/common\/io\/params\/\";\n  std::string filename;\n  Eigen::Affine3d pose;\n  int frame_id = 0;\n  double time_stamp = 0;\n\n  EXPECT_FALSE(ReadPoseFile(filename, nullptr, nullptr, nullptr));\n  EXPECT_FALSE(ReadPoseFile(filename, &pose, &frame_id, &time_stamp));\n\n  filename = testdata_folder + \"pose_file.txt\";\n  EXPECT_TRUE(ReadPoseFile(filename, &pose, &frame_id, &time_stamp));\n}\n\nTEST(CommonIoTest, load_camera_intrinsic) {\n  const std::string testdata_folder =\n      \"modules\/perception\/testdata\/common\/io\/params\/\";\n  std::string yaml_file;\n  base::BrownCameraDistortionModel model;\n\n  EXPECT_FALSE(LoadBrownCameraIntrinsic(yaml_file, nullptr));\n  EXPECT_FALSE(LoadBrownCameraIntrinsic(yaml_file, &model));\n\n  yaml_file = testdata_folder + \"empty.yaml\";\n  EXPECT_FALSE(LoadBrownCameraIntrinsic(yaml_file, &model));\n\n  yaml_file = testdata_folder + \"test.yaml\";\n  EXPECT_TRUE(LoadBrownCameraIntrinsic(yaml_file, &model));\n  EXPECT_EQ(model.width_, 1192);\n  EXPECT_EQ(model.height_, 712);\n}\n\nTEST(CommonIoTest, load_ocamera_intrinsic) {\n  const std::string testdata_folder =\n      \"modules\/perception\/testdata\/common\/io\/params\/\";\n  std::string yaml_file;\n  base::OmnidirectionalCameraDistortionModel model;\n\n  EXPECT_FALSE(LoadOmnidirectionalCameraIntrinsics(yaml_file, nullptr));\n  EXPECT_FALSE(LoadOmnidirectionalCameraIntrinsics(yaml_file, &model));\n\n  yaml_file = testdata_folder + \"empty.yaml\";\n  EXPECT_FALSE(LoadOmnidirectionalCameraIntrinsics(yaml_file, &model));\n\n  yaml_file = testdata_folder + \"test_ocam.yaml\";\n  EXPECT_TRUE(LoadOmnidirectionalCameraIntrinsics(yaml_file, &model));\n  EXPECT_EQ(model.width_, 1920);\n  EXPECT_EQ(model.height_, 1080);\n\n  yaml_file = testdata_folder + \"test_ocam1.yaml\";\n  EXPECT_FALSE(LoadOmnidirectionalCameraIntrinsics(yaml_file, &model));\n  yaml_file = testdata_folder + \"test_ocam2.yaml\";\n  EXPECT_FALSE(LoadOmnidirectionalCameraIntrinsics(yaml_file, &model));\n  yaml_file = testdata_folder + \"test_ocam3.yaml\";\n  EXPECT_FALSE(LoadOmnidirectionalCameraIntrinsics(yaml_file, &model));\n  yaml_file = testdata_folder + \"test_ocam4.yaml\";\n  EXPECT_FALSE(LoadOmnidirectionalCameraIntrinsics(yaml_file, &model));\n  yaml_file = testdata_folder + \"test_ocam5.yaml\";\n  EXPECT_FALSE(LoadOmnidirectionalCameraIntrinsics(yaml_file, &model));\n  yaml_file = testdata_folder + \"test_ocam6.yaml\";\n  EXPECT_FALSE(LoadOmnidirectionalCameraIntrinsics(yaml_file, &model));\n  yaml_file = testdata_folder + \"test_ocam7.yaml\";\n  EXPECT_FALSE(LoadOmnidirectionalCameraIntrinsics(yaml_file, &model));\n  yaml_file = testdata_folder + \"test_ocam8.yaml\";\n  EXPECT_FALSE(LoadOmnidirectionalCameraIntrinsics(yaml_file, &model));\n}\n\n}  \/\/ namespace common\n}  \/\/ namespace perception\n}  \/\/ namespace apollo\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  DSCircleBatcher.cpp\n\/\/  gowengamedev-framework\n\/\/\n\/\/  Created by Stephen Gowen on 8\/25\/15.\n\/\/  Copyright (c) 2015 Gowen Game Dev. All rights reserved.\n\/\/\n\n#define DEGREE_SPACING 24\n\n#include \"DSCircleBatcher.h\"\n#include \"macros.h\"\n#include \"Circle.h\"\n#include \"Vector2D.h\"\n#include \"math.h\"\n#include \"GameConstants.h\"\n\nDSCircleBatcher::DSCircleBatcher(gfxScreen_t screen, int screenWidth, int screenHeight) : CircleBatcher(), m_screen(screen), m_iScreenWidth(screenWidth), m_iScreenHeight(screenHeight), m_iNumPointsOnCircle(0)\n{\n    \/\/ Empty\n}\n\nvoid DSCircleBatcher::renderCircle(Circle &circle, Color &c)\n{\n    renderCircle(circle.getCenter().getX(), circle.getCenter().getY(), circle.m_fRadius, c);\n}\n\nvoid DSCircleBatcher::renderPartialCircle(Circle &circle, int arcDegrees, Color &c)\n{\n    \/\/ This method should display clockwise depleting circle, but I couldn't figure out how to do it, so...\n    float radius = circle.m_fRadius;\n    radius *= (1 - (arcDegrees \/ 360));\n\n    renderCircle(circle.getCenter().getX(), circle.getCenter().getY(), radius, c);\n}\n\nvoid DSCircleBatcher::renderCircle(float x, float y, float radius, Color &c)\n{\n    m_iNumPointsOnCircle = 0;\n    m_vertices.clear();\n\n    addVertex(x, y, c.red, c.green, c.blue, c.alpha);\n\n    for (int i = 0; i < 360; i += DEGREE_SPACING)\n    {\n        float rad = DEGREES_TO_RADIANS(i);\n        float cos = cosf(rad);\n        float sin = sinf(rad);\n\n        addVertex(cos * radius + x, sin * radius + y, c.red, c.green, c.blue, c.alpha);\n    }\n\n    float rad = DEGREES_TO_RADIANS(0);\n    float cos = cosf(rad);\n    float sin = sinf(rad);\n\n    addVertex(cos * radius + x, sin * radius + y, c.red, c.green, c.blue, c.alpha);\n\n    endBatch();\n}\n\nvoid DSCircleBatcher::addVertex(float x, float y, float r, float g, float b, float a)\n{\n    sf2d_vector_3f vertex = (sf2d_vector_3f){x, GAME_HEIGHT - y, SF2D_DEFAULT_DEPTH};\n    sf2d_vector_4f color = (sf2d_vector_4f){r, g, b, a};\n    sf2d_vertex_pos_col v = (sf2d_vertex_pos_col){vertex, color};\n    m_vertices.push_back(v);\n\n    m_iNumPointsOnCircle++;\n}\n\nvoid DSCircleBatcher::endBatch()\n{\n    sf2d_draw_batch_circle(&m_vertices[0], m_iNumPointsOnCircle);\n}<commit_msg>Updating framework again (decreasing precision in CircleBatcher, but fixing shrink over time effect)<commit_after>\/\/\n\/\/  DSCircleBatcher.cpp\n\/\/  gowengamedev-framework\n\/\/\n\/\/  Created by Stephen Gowen on 8\/25\/15.\n\/\/  Copyright (c) 2015 Gowen Game Dev. All rights reserved.\n\/\/\n\n#define DEGREE_SPACING 36\n\n#include \"DSCircleBatcher.h\"\n#include \"macros.h\"\n#include \"Circle.h\"\n#include \"Vector2D.h\"\n#include \"math.h\"\n#include \"GameConstants.h\"\n\nDSCircleBatcher::DSCircleBatcher(gfxScreen_t screen, int screenWidth, int screenHeight) : CircleBatcher(), m_screen(screen), m_iScreenWidth(screenWidth), m_iScreenHeight(screenHeight), m_iNumPointsOnCircle(0)\n{\n    \/\/ Empty\n}\n\nvoid DSCircleBatcher::renderCircle(Circle &circle, Color &c)\n{\n    renderCircle(circle.getCenter().getX(), circle.getCenter().getY(), circle.m_fRadius, c);\n}\n\nvoid DSCircleBatcher::renderPartialCircle(Circle &circle, int arcDegrees, Color &c)\n{\n    \/\/ This method should display clockwise depleting circle, but I couldn't figure out how to do it, so...\n    float radius = circle.m_fRadius;\n    radius *= (1 - (((float) arcDegrees) \/ 360.0f));\n\n    renderCircle(circle.getCenter().getX(), circle.getCenter().getY(), radius, c);\n}\n\nvoid DSCircleBatcher::renderCircle(float x, float y, float radius, Color &c)\n{\n    m_iNumPointsOnCircle = 0;\n    m_vertices.clear();\n\n    addVertex(x, y, c.red, c.green, c.blue, c.alpha);\n\n    for (int i = 0; i < 360; i += DEGREE_SPACING)\n    {\n        float rad = DEGREES_TO_RADIANS(i);\n        float cos = cosf(rad);\n        float sin = sinf(rad);\n\n        addVertex(cos * radius + x, sin * radius + y, c.red, c.green, c.blue, c.alpha);\n    }\n\n    float rad = DEGREES_TO_RADIANS(0);\n    float cos = cosf(rad);\n    float sin = sinf(rad);\n\n    addVertex(cos * radius + x, sin * radius + y, c.red, c.green, c.blue, c.alpha);\n\n    endBatch();\n}\n\nvoid DSCircleBatcher::addVertex(float x, float y, float r, float g, float b, float a)\n{\n    sf2d_vector_3f vertex = (sf2d_vector_3f){x, GAME_HEIGHT - y, SF2D_DEFAULT_DEPTH};\n    sf2d_vector_4f color = (sf2d_vector_4f){r, g, b, a};\n    sf2d_vertex_pos_col v = (sf2d_vertex_pos_col){vertex, color};\n    m_vertices.push_back(v);\n\n    m_iNumPointsOnCircle++;\n}\n\nvoid DSCircleBatcher::endBatch()\n{\n    sf2d_draw_batch_circle(&m_vertices[0], m_iNumPointsOnCircle);\n}<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <sstream>\n#include <algorithm>\n#include <type_traits>\n\n#include \"Tools\/Exception\/exception.hpp\"\n\n#include \"Argument_handler.hpp\"\n#include \"Tools\/Display\/bash_tools.h\"\n\nusing namespace aff3ct::tools;\n\nArgument_handler\n::Argument_handler(const int argc, const char** argv)\n{\n\tif (argc <= 0)\n\t{\n\t\tstd::stringstream message;\n\t\tmessage << \"'argc' has to be greater than 0 ('argc' = \" << argc << \").\";\n\t\tthrow invalid_argument(__FILE__, __LINE__, __func__, message.str());\n\t}\n\n\tthis->m_program_name = argv[0];\n\n\tcommand.resize(argc-1);\n\n\tfor (unsigned short i = 0; i < argc-1; ++i)\n\t\tthis->command[i] = std::string(argv[i+1]);\n}\n\nArgument_handler\n::~Argument_handler()\n{\n}\n\nArgument_map_value Argument_handler\n::parse_arguments(const Argument_map_info &req_args, const Argument_map_info &opt_args,\n                  std::vector<std::string> &warnings, std::vector<std::string> &errors)\n{\n\tArgument_map_value m_arg_v;\n\tstd::vector<bool> command_found_pos(this->command.size(),false);\n\n\tauto req_found_pos = this->sub_parse_arguments(req_args, m_arg_v, command_found_pos, errors);\n\tauto opt_found_pos = this->sub_parse_arguments(opt_args, m_arg_v, command_found_pos, errors);\n\n\n\tfor (unsigned i = 0; i < req_found_pos.size(); ++i)\n\t{\n\t\tif (req_found_pos[i])\n\t\t\tcontinue;\n\n\t\tauto it_arg = req_args.begin();\n\t\tstd::advance(it_arg, i);\n\t\tstd::string message = \"The \" + print_tag(it_arg->first) + \" argument is required.\";\n\t\terrors.push_back(message);\n\t}\n\n\tfor (unsigned i = 0; i < command_found_pos.size(); ++i)\n\t{\n\t\tif (command_found_pos[i])\n\t\t\tcontinue;\n\n\t\tstd::string message = \"Unknown argument \\\"\" + this->command[i] + \"\\\" at the position \"\n\t\t                     + std::to_string(i+1) + \".\";\n\t\twarnings.push_back(message);\n\t}\n\n\treturn m_arg_v;\n}\n\nstd::vector<bool> Argument_handler\n::sub_parse_arguments(const Argument_map_info &args, Argument_map_value& arg_v, std::vector<bool>& command_found_pos,\n                      std::vector<std::string>& messages)\n{\n\tstd::vector<bool> args_found_pos(args.size(), false);\n\n\tif (this->command.size() != command_found_pos.size())\n\t\tstd::runtime_error(\"'command' and 'command_found_pos' vectors have to have the same length.\");\n\n\tunsigned found_arg_count = 0;\n\n\tfor (auto it_arg_info = args.begin(); it_arg_info != args.end(); it_arg_info++)\n\t{\n\t\tstd::string message;\n\n\t\t\/\/ try to find each tag version of each argument\n\t\tfor (auto it_tag = it_arg_info->first.begin(); it_tag != it_arg_info->first.end(); it_tag++)\n\t\t{\n\t\t\tconst auto cur_tag = this->print_tag(*it_tag);\n\n\t\t\t\/\/ find all occurances of this tag in the command line\n\t\t\tfor (unsigned ix_arg_val = 0; ix_arg_val < this->command.size(); ++ix_arg_val)\n\t\t\t{\n\t\t\t\tif (cur_tag == this->command[ix_arg_val]) \/\/ the tag has been found\n\t\t\t\t{\n\t\t\t\t\tif(it_arg_info->second->type->get_title() == \"\") \/\/ do not wait for a value after the tag\n\t\t\t\t\t{\n\t\t\t\t\t\tauto it = arg_v.find(it_arg_info->first);\n\t\t\t\t\t\tif (it == arg_v.end())\n\t\t\t\t\t\t\tfound_arg_count++;\n\n\t\t\t\t\t\targ_v[it_arg_info->first] = \"\";\n\t\t\t\t\t\tcommand_found_pos[ix_arg_val] = true;\n\t\t\t\t\t\targs_found_pos[std::distance(args.begin(), it_arg_info)] = true;\n\n\t\t\t\t\t}\n\t\t\t\t\telse \/\/ wait for a value with the tag\n\t\t\t\t\t{\n\t\t\t\t\t\tif(ix_arg_val != (this->command.size() -1))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tauto it = arg_v.find(it_arg_info->first);\n\t\t\t\t\t\t\tif (it == arg_v.end())\n\t\t\t\t\t\t\t\tfound_arg_count++;\n\n\t\t\t\t\t\t\targ_v[it_arg_info->first] = this->command[ix_arg_val +1];\n\t\t\t\t\t\t\tcommand_found_pos[ix_arg_val   ] = true;\n\t\t\t\t\t\t\tcommand_found_pos[ix_arg_val +1] = true;\n\t\t\t\t\t\t\targs_found_pos[std::distance(args.begin(), it_arg_info)] = true;\n\n\t\t\t\t\t\t\t\/\/ check the found argument\n\t\t\t\t\t\t\ttry\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tit_arg_info->second->type->check(this->command[ix_arg_val +1]);\n\t\t\t\t\t\t\t\tmessage = \"\";\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tcatch(std::exception& e)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tmessage = \"The \" + print_tag(it_arg_info->first) + \" argument \";\n\t\t\t\t\t\t\t\tmessage += e.what();\n\t\t\t\t\t\t\t\tmessage += \"; given at the position \" + std::to_string(ix_arg_val+1) + \" '\";\n\t\t\t\t\t\t\t\tmessage += this->command[ix_arg_val] + \" \" + this->command[ix_arg_val +1] + \"'.\";\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (message != \"\")\n\t\t\tmessages.push_back(message);\n\t}\n\n\treturn args_found_pos;\n}\n\nvoid Argument_handler\n::print_usage(const Argument_map_info &req_args) const\n{\n\tstd::cout << \"Usage: \" << this->m_program_name;\n\n\tstd::vector<std::string> existing_flags;\n\n\tfor (auto it = req_args.begin(); it != req_args.end(); ++it)\n\t{\n\t\tif (std::find(existing_flags.begin(), existing_flags.end(), it->first.back()) == existing_flags.end())\n\t\t{\n\t\t\tif(it->second->type->get_title() != \"\")\n\t\t\t\tstd::cout << \" \" + print_tag(it->first.back()) << \" <\" << it->second->type->get_short_title() << \">\";\n\t\t\telse\n\t\t\t\tstd::cout << \" \" + print_tag(it->first.back());\n\n\t\t\texisting_flags.push_back(it->first.back());\n\t\t}\n\t}\n\tstd::cout << \" [optional args...]\" << std::endl << std::endl;\n}\n\nsize_t Argument_handler\n::find_longest_tags(const Argument_map_info &args) const\n{\n\tsize_t max_n_char_arg = 0;\n\tfor (auto it = args.begin(); it != args.end(); ++it)\n\t\tmax_n_char_arg = std::max(this->print_tag(it->first).size(), max_n_char_arg);\n\n\treturn max_n_char_arg;\n}\n\nvoid Argument_handler\n::print_help(const Argument_map_info &req_args, const Argument_map_info &opt_args) const\n{\n\tthis->print_usage(req_args);\n\n\t\/\/ found first the longest tag to align informations\n\tsize_t max_n_char_arg = std::max(find_longest_tags(req_args), find_longest_tags(opt_args));\n\n\t\/\/ print arguments\n\tfor (auto it = req_args.begin(); it != req_args.end(); ++it)\n\t\tthis->print_help(it->first, *it->second, max_n_char_arg, true);\n\n\tfor (auto it = opt_args.begin(); it != opt_args.end(); ++it)\n\t\tthis->print_help(it->first, *it->second, max_n_char_arg, false);\n\n\tstd::cout << std::endl;\n}\n\nvoid Argument_handler\n::print_help(const Argument_tag &tags, const Argument_info &info, const size_t max_n_char_arg, const bool required) const\n{\n\tFormat arg_format = 0;\n\n\tconst auto tab = \"    \";\n\n\tstd::string tags_str = this->print_tag(tags);\n\ttags_str.append(max_n_char_arg - tags_str.size(), ' ');\n\n\tstd::cout << tab << format(tags_str, arg_format | Style::BOLD);\n\n\tif (info.type->get_title().size())\n\t\tstd::cout << format(\" <\" + info.type->get_title() + \">\", arg_format | FG::GRAY);\n\n\tif (required)\n\t\tstd::cout << format(\" {REQUIRED}\", arg_format | Style::BOLD | FG::Color::ORANGE);\n\n\tstd::cout << std::endl;\n\tstd::cout << format(tab + info.doc, arg_format) << std::endl;\n}\n\nvoid Argument_handler\n::print_help_title(const std::string& title) const\n{\n\tFormat head_format = Style::BOLD | Style::ITALIC | FG::Color::MAGENTA | FG::INTENSE;\n\n\tstd::cout << format(title + \":\", head_format) << std::endl;\n}\n\nvoid Argument_handler\n::print_help(const Argument_map_info &req_args, const Argument_map_info &opt_args, const Argument_map_group& arg_groups) const\n{\n\tthis->print_usage(req_args);\n\n\t\/\/ found first the longest tag to align informations\n\tsize_t max_n_char_arg = std::max(find_longest_tags(req_args), find_longest_tags(opt_args));\n\tbool title_displayed = false;\n\n\t\/\/ display each group\n\tfor (auto it_grp = arg_groups.begin(); it_grp != arg_groups.end(); it_grp++)\n\t{\n\t\ttitle_displayed = false;\n\n\t\tauto& prefix = it_grp->first;\n\n\t\t\/\/ display first the required arguments of this group\n\t\tfor (auto it_arg = req_args.begin(); it_arg != req_args.end(); it_arg++)\n\t\t{\n\t\t\tauto& tag = it_arg->first.front();\n\n\t\t\tif (tag.find(prefix) == 0)\n\t\t\t{\n\t\t\t\tif (!title_displayed)\n\t\t\t\t{\n\t\t\t\t\tprint_help_title(it_grp->second);\n\t\t\t\t\ttitle_displayed = true;\n\t\t\t\t}\n\n\t\t\t\tthis->print_help(it_arg->first, *it_arg->second, max_n_char_arg, true);\n\t\t\t}\n\t\t}\n\n\t\t\/\/ display then the optional arguments of this group\n\t\tfor (auto it_arg = opt_args.begin(); it_arg != opt_args.end(); it_arg++)\n\t\t{\n\t\t\tauto& tag = it_arg->first.front();\n\n\t\t\tif (tag.find(prefix) == 0)\n\t\t\t{\n\t\t\t\tif (!title_displayed)\n\t\t\t\t{\n\t\t\t\t\tprint_help_title(it_grp->second);\n\t\t\t\t\ttitle_displayed = true;\n\t\t\t\t}\n\n\t\t\t\tthis->print_help(it_arg->first, *it_arg->second, max_n_char_arg, false);\n\t\t\t}\n\t\t}\n\n\t\tif (title_displayed)\n\t\t\tstd::cout << std::endl;\n\t}\n\n\n\ttitle_displayed = false;\n\t\/\/ display the other required parameters\n\tfor (auto it_arg = req_args.begin(); it_arg != req_args.end(); it_arg++)\n\t{\n\t\tauto& tag = it_arg->first.front();\n\t\tbool found = false;\n\n\t\tfor (auto it_grp = arg_groups.begin(); it_grp != arg_groups.end(); it_grp++)\n\t\t{\n\t\t\tauto& prefix = it_grp->first;\n\n\t\t\tif (tag.find(prefix) == 0)\n\t\t\t{\n\t\t\t\tfound = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif (!found)\n\t\t{\n\t\t\tif (!title_displayed)\n\t\t\t{\n\t\t\t\tprint_help_title(\"Other parameter(s)\");\n\t\t\t\ttitle_displayed = true;\n\t\t\t}\n\n\t\t\tthis->print_help(it_arg->first, *it_arg->second, max_n_char_arg, true);\n\t\t}\n\t}\n\n\t\/\/ display the other optional parameters\n\tfor (auto it_arg = opt_args.begin(); it_arg != opt_args.end(); it_arg++)\n\t{\n\t\tauto& tag = it_arg->first.front();\n\t\tbool found = false;\n\n\t\tfor (auto it_grp = arg_groups.begin(); it_grp != arg_groups.end(); it_grp++)\n\t\t{\n\t\t\tauto& prefix = it_grp->first;\n\n\t\t\tif (tag.find(prefix) == 0)\n\t\t\t{\n\t\t\t\tfound = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif (!found)\n\t\t{\n\t\t\tif (!title_displayed)\n\t\t\t{\n\t\t\t\tprint_help_title(\"Other parameter(s)\");\n\t\t\t\ttitle_displayed = true;\n\t\t\t}\n\n\t\t\tthis->print_help(it_arg->first, *it_arg->second, max_n_char_arg, false);\n\t\t}\n\t}\n}\n\nstd::string Argument_handler\n::print_tag(const std::string& tag)\n{\n\treturn ((tag.size() == 1) ? \"-\" : \"--\") + tag;\n}\n\nstd::string Argument_handler\n::print_tag(const Argument_tag &tags)\n{\n\tstd::string txt = \"\\\"\";\n\t\tfor (unsigned i = 0; i < tags.size(); i++)\n\t\t\ttxt += print_tag(tags[i]) + ((i < tags.size()-1)?\", \":\"\");\n\ttxt += \"\\\"\";\n\treturn txt;\n}<commit_msg>Add the management of the position of the argument in the command to favor the last ones<commit_after>#include <iostream>\n#include <sstream>\n#include <algorithm>\n#include <type_traits>\n\n#include \"Tools\/Exception\/exception.hpp\"\n\n#include \"Argument_handler.hpp\"\n#include \"Tools\/Display\/bash_tools.h\"\n\nusing namespace aff3ct::tools;\n\nArgument_handler\n::Argument_handler(const int argc, const char** argv)\n{\n\tif (argc <= 0)\n\t{\n\t\tstd::stringstream message;\n\t\tmessage << \"'argc' has to be greater than 0 ('argc' = \" << argc << \").\";\n\t\tthrow invalid_argument(__FILE__, __LINE__, __func__, message.str());\n\t}\n\n\tthis->m_program_name = argv[0];\n\n\tcommand.resize(argc-1);\n\n\tfor (unsigned short i = 0; i < argc-1; ++i)\n\t\tthis->command[i] = std::string(argv[i+1]);\n}\n\nArgument_handler\n::~Argument_handler()\n{\n}\n\nArgument_map_value Argument_handler\n::parse_arguments(const Argument_map_info &req_args, const Argument_map_info &opt_args,\n                  std::vector<std::string> &warnings, std::vector<std::string> &errors)\n{\n\tArgument_map_value m_arg_v;\n\tstd::vector<bool> command_found_pos(this->command.size(),false);\n\n\tauto req_found_pos = this->sub_parse_arguments(req_args, m_arg_v, command_found_pos, errors);\n\tauto opt_found_pos = this->sub_parse_arguments(opt_args, m_arg_v, command_found_pos, errors);\n\n\n\tfor (unsigned i = 0; i < req_found_pos.size(); ++i)\n\t{\n\t\tif (req_found_pos[i])\n\t\t\tcontinue;\n\n\t\tauto it_arg = req_args.begin();\n\t\tstd::advance(it_arg, i);\n\t\tstd::string message = \"The \" + print_tag(it_arg->first) + \" argument is required.\";\n\t\terrors.push_back(message);\n\t}\n\n\tfor (unsigned i = 0; i < command_found_pos.size(); ++i)\n\t{\n\t\tif (command_found_pos[i])\n\t\t\tcontinue;\n\n\t\tstd::string message = \"Unknown argument \\\"\" + this->command[i] + \"\\\" at the position \"\n\t\t                     + std::to_string(i+1) + \".\";\n\t\twarnings.push_back(message);\n\t}\n\n\treturn m_arg_v;\n}\n\nstd::vector<bool> Argument_handler\n::sub_parse_arguments(const Argument_map_info &args, Argument_map_value& arg_v, std::vector<bool>& command_found_pos,\n                      std::vector<std::string>& messages)\n{\n\tstd::map<Argument_tag, size_t> tag_found_pos;\n\n\tstd::vector<bool> args_found_pos(args.size(), false);\n\n\tif (this->command.size() != command_found_pos.size())\n\t\tstd::runtime_error(\"'command' and 'command_found_pos' vectors have to have the same length.\");\n\n\tunsigned found_arg_count = 0;\n\n\tfor (auto it_arg_info = args.begin(); it_arg_info != args.end(); it_arg_info++)\n\t{\n\t\tstd::string message;\n\n\t\t\/\/ try to find each tag version of each argument\n\t\tfor (auto it_tag = it_arg_info->first.begin(); it_tag != it_arg_info->first.end(); it_tag++)\n\t\t{\n\t\t\tconst auto cur_tag = this->print_tag(*it_tag);\n\n\t\t\t\/\/ find all occurances of this tag in the command line\n\t\t\tfor (unsigned ix_arg_val = 0; ix_arg_val < this->command.size(); ++ix_arg_val)\n\t\t\t{\n\t\t\t\tif (cur_tag == this->command[ix_arg_val]) \/\/ the tag has been found\n\t\t\t\t{\n\t\t\t\t\t\/\/ check if the tag has already been found in the command\n\t\t\t\t\tauto it_prev_pos = tag_found_pos.find(it_arg_info->first);\n\n\t\t\t\t\tif (it_prev_pos == tag_found_pos.end())\n\t\t\t\t\t\ttag_found_pos[it_arg_info->first] = ix_arg_val; \/\/ not yet found then set the found position\n\n\t\t\t\t\telse if (it_prev_pos->second >= ix_arg_val) \/\/ the tag is set further in the command so ignore this one\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\/\/ else the tag is set previously in the command so overwrite it\n\n\n\t\t\t\t\tif(it_arg_info->second->type->get_title() == \"\") \/\/ do not wait for a value after the tag\n\t\t\t\t\t{\n\t\t\t\t\t\tauto it = arg_v.find(it_arg_info->first);\n\t\t\t\t\t\tif (it == arg_v.end())\n\t\t\t\t\t\t\tfound_arg_count++;\n\n\t\t\t\t\t\targ_v[it_arg_info->first] = \"\";\n\t\t\t\t\t\tcommand_found_pos[ix_arg_val] = true;\n\t\t\t\t\t\targs_found_pos[std::distance(args.begin(), it_arg_info)] = true;\n\n\t\t\t\t\t}\n\t\t\t\t\telse \/\/ wait for a value with the tag\n\t\t\t\t\t{\n\t\t\t\t\t\tif(ix_arg_val != (this->command.size() -1))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tauto it = arg_v.find(it_arg_info->first);\n\t\t\t\t\t\t\tif (it == arg_v.end())\n\t\t\t\t\t\t\t\tfound_arg_count++;\n\n\t\t\t\t\t\t\targ_v[it_arg_info->first] = this->command[ix_arg_val +1];\n\t\t\t\t\t\t\tcommand_found_pos[ix_arg_val   ] = true;\n\t\t\t\t\t\t\tcommand_found_pos[ix_arg_val +1] = true;\n\t\t\t\t\t\t\targs_found_pos[std::distance(args.begin(), it_arg_info)] = true;\n\n\t\t\t\t\t\t\t\/\/ check the found argument\n\t\t\t\t\t\t\ttry\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tit_arg_info->second->type->check(this->command[ix_arg_val +1]);\n\t\t\t\t\t\t\t\tmessage = \"\";\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tcatch(std::exception& e)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tmessage = \"The \" + print_tag(it_arg_info->first) + \" argument \";\n\t\t\t\t\t\t\t\tmessage += e.what();\n\t\t\t\t\t\t\t\tmessage += \"; given at the position \" + std::to_string(ix_arg_val+1) + \" '\";\n\t\t\t\t\t\t\t\tmessage += this->command[ix_arg_val] + \" \" + this->command[ix_arg_val +1] + \"'.\";\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (message != \"\")\n\t\t\tmessages.push_back(message);\n\t}\n\n\treturn args_found_pos;\n}\n\nvoid Argument_handler\n::print_usage(const Argument_map_info &req_args) const\n{\n\tstd::cout << \"Usage: \" << this->m_program_name;\n\n\tstd::vector<std::string> existing_flags;\n\n\tfor (auto it = req_args.begin(); it != req_args.end(); ++it)\n\t{\n\t\tif (std::find(existing_flags.begin(), existing_flags.end(), it->first.back()) == existing_flags.end())\n\t\t{\n\t\t\tif(it->second->type->get_title() != \"\")\n\t\t\t\tstd::cout << \" \" + print_tag(it->first.back()) << \" <\" << it->second->type->get_short_title() << \">\";\n\t\t\telse\n\t\t\t\tstd::cout << \" \" + print_tag(it->first.back());\n\n\t\t\texisting_flags.push_back(it->first.back());\n\t\t}\n\t}\n\tstd::cout << \" [optional args...]\" << std::endl << std::endl;\n}\n\nsize_t Argument_handler\n::find_longest_tags(const Argument_map_info &args) const\n{\n\tsize_t max_n_char_arg = 0;\n\tfor (auto it = args.begin(); it != args.end(); ++it)\n\t\tmax_n_char_arg = std::max(this->print_tag(it->first).size(), max_n_char_arg);\n\n\treturn max_n_char_arg;\n}\n\nvoid Argument_handler\n::print_help(const Argument_map_info &req_args, const Argument_map_info &opt_args) const\n{\n\tthis->print_usage(req_args);\n\n\t\/\/ found first the longest tag to align informations\n\tsize_t max_n_char_arg = std::max(find_longest_tags(req_args), find_longest_tags(opt_args));\n\n\t\/\/ print arguments\n\tfor (auto it = req_args.begin(); it != req_args.end(); ++it)\n\t\tthis->print_help(it->first, *it->second, max_n_char_arg, true);\n\n\tfor (auto it = opt_args.begin(); it != opt_args.end(); ++it)\n\t\tthis->print_help(it->first, *it->second, max_n_char_arg, false);\n\n\tstd::cout << std::endl;\n}\n\nvoid Argument_handler\n::print_help(const Argument_tag &tags, const Argument_info &info, const size_t max_n_char_arg, const bool required) const\n{\n\tFormat arg_format = 0;\n\n\tconst auto tab = \"    \";\n\n\tstd::string tags_str = this->print_tag(tags);\n\ttags_str.append(max_n_char_arg - tags_str.size(), ' ');\n\n\tstd::cout << tab << format(tags_str, arg_format | Style::BOLD);\n\n\tif (info.type->get_title().size())\n\t\tstd::cout << format(\" <\" + info.type->get_title() + \">\", arg_format | FG::GRAY);\n\n\tif (required)\n\t\tstd::cout << format(\" {REQUIRED}\", arg_format | Style::BOLD | FG::Color::ORANGE);\n\n\tstd::cout << std::endl;\n\tstd::cout << format(tab + info.doc, arg_format) << std::endl;\n}\n\nvoid Argument_handler\n::print_help_title(const std::string& title) const\n{\n\tFormat head_format = Style::BOLD | Style::ITALIC | FG::Color::MAGENTA | FG::INTENSE;\n\n\tstd::cout << format(title + \":\", head_format) << std::endl;\n}\n\nvoid Argument_handler\n::print_help(const Argument_map_info &req_args, const Argument_map_info &opt_args, const Argument_map_group& arg_groups) const\n{\n\tthis->print_usage(req_args);\n\n\t\/\/ found first the longest tag to align informations\n\tsize_t max_n_char_arg = std::max(find_longest_tags(req_args), find_longest_tags(opt_args));\n\tbool title_displayed = false;\n\n\t\/\/ display each group\n\tfor (auto it_grp = arg_groups.begin(); it_grp != arg_groups.end(); it_grp++)\n\t{\n\t\ttitle_displayed = false;\n\n\t\tauto& prefix = it_grp->first;\n\n\t\t\/\/ display first the required arguments of this group\n\t\tfor (auto it_arg = req_args.begin(); it_arg != req_args.end(); it_arg++)\n\t\t{\n\t\t\tauto& tag = it_arg->first.front();\n\n\t\t\tif (tag.find(prefix) == 0)\n\t\t\t{\n\t\t\t\tif (!title_displayed)\n\t\t\t\t{\n\t\t\t\t\tprint_help_title(it_grp->second);\n\t\t\t\t\ttitle_displayed = true;\n\t\t\t\t}\n\n\t\t\t\tthis->print_help(it_arg->first, *it_arg->second, max_n_char_arg, true);\n\t\t\t}\n\t\t}\n\n\t\t\/\/ display then the optional arguments of this group\n\t\tfor (auto it_arg = opt_args.begin(); it_arg != opt_args.end(); it_arg++)\n\t\t{\n\t\t\tauto& tag = it_arg->first.front();\n\n\t\t\tif (tag.find(prefix) == 0)\n\t\t\t{\n\t\t\t\tif (!title_displayed)\n\t\t\t\t{\n\t\t\t\t\tprint_help_title(it_grp->second);\n\t\t\t\t\ttitle_displayed = true;\n\t\t\t\t}\n\n\t\t\t\tthis->print_help(it_arg->first, *it_arg->second, max_n_char_arg, false);\n\t\t\t}\n\t\t}\n\n\t\tif (title_displayed)\n\t\t\tstd::cout << std::endl;\n\t}\n\n\n\ttitle_displayed = false;\n\t\/\/ display the other required parameters\n\tfor (auto it_arg = req_args.begin(); it_arg != req_args.end(); it_arg++)\n\t{\n\t\tauto& tag = it_arg->first.front();\n\t\tbool found = false;\n\n\t\tfor (auto it_grp = arg_groups.begin(); it_grp != arg_groups.end(); it_grp++)\n\t\t{\n\t\t\tauto& prefix = it_grp->first;\n\n\t\t\tif (tag.find(prefix) == 0)\n\t\t\t{\n\t\t\t\tfound = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif (!found)\n\t\t{\n\t\t\tif (!title_displayed)\n\t\t\t{\n\t\t\t\tprint_help_title(\"Other parameter(s)\");\n\t\t\t\ttitle_displayed = true;\n\t\t\t}\n\n\t\t\tthis->print_help(it_arg->first, *it_arg->second, max_n_char_arg, true);\n\t\t}\n\t}\n\n\t\/\/ display the other optional parameters\n\tfor (auto it_arg = opt_args.begin(); it_arg != opt_args.end(); it_arg++)\n\t{\n\t\tauto& tag = it_arg->first.front();\n\t\tbool found = false;\n\n\t\tfor (auto it_grp = arg_groups.begin(); it_grp != arg_groups.end(); it_grp++)\n\t\t{\n\t\t\tauto& prefix = it_grp->first;\n\n\t\t\tif (tag.find(prefix) == 0)\n\t\t\t{\n\t\t\t\tfound = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif (!found)\n\t\t{\n\t\t\tif (!title_displayed)\n\t\t\t{\n\t\t\t\tprint_help_title(\"Other parameter(s)\");\n\t\t\t\ttitle_displayed = true;\n\t\t\t}\n\n\t\t\tthis->print_help(it_arg->first, *it_arg->second, max_n_char_arg, false);\n\t\t}\n\t}\n}\n\nstd::string Argument_handler\n::print_tag(const std::string& tag)\n{\n\treturn ((tag.size() == 1) ? \"-\" : \"--\") + tag;\n}\n\nstd::string Argument_handler\n::print_tag(const Argument_tag &tags)\n{\n\tstd::string txt = \"\\\"\";\n\t\tfor (unsigned i = 0; i < tags.size(); i++)\n\t\t\ttxt += print_tag(tags[i]) + ((i < tags.size()-1)?\", \":\"\");\n\ttxt += \"\\\"\";\n\treturn txt;\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n * SessionPosixShell.cpp\n *\n * Copyright (C) 2009-11 by RStudio, Inc.\n *\n * This program is licensed to you under the terms of version 3 of the\n * GNU Affero General Public License. This program is distributed WITHOUT\n * ANY EXPRESS OR IMPLIED WARRANTY, INCLUDING THOSE OF NON-INFRINGEMENT,\n * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Please refer to the\n * AGPL (http:\/\/www.gnu.org\/licenses\/agpl-3.0.txt) for more details.\n *\n *\/\n\n\/\/ TODO: set sane initial size for shell dialog\n\n\/\/ TODO: ability to interrupt slave\n\n\/\/ TODO: ability to terminate slave via kill\n\n\/\/ TODO: ui chrome (consider console dialog style hanging from top)\n\/\/ TODO: border for shell widget\n\n\/\/ TODO: up-arrow history\n\n\/\/ TODO: other editing shortcuts (completion manager?)\n\n\/\/ TODO: cap output lines sent on the server\n\n\n#include \"SessionPosixShell.hpp\"\n\n#include <boost\/shared_ptr.hpp>\n\n#include <core\/Log.hpp>\n#include <core\/Error.hpp>\n#include <core\/Exec.hpp>\n#include <core\/system\/Process.hpp>\n\n#include <session\/SessionModuleContext.hpp>\n\nusing namespace core ;\n\nnamespace session {\nnamespace modules { \nnamespace posix_shell {\n\nnamespace {\n\nclass PosixShell;\nboost::shared_ptr<PosixShell> s_pActiveShell;\n\nclass PosixShell : boost::noncopyable\n{\npublic:\n   static Error create(int width,\n                       int maxLines,\n                       boost::shared_ptr<PosixShell>* ppPosixShell)\n   {\n      boost::shared_ptr<PosixShell> pShell(new PosixShell(maxLines));\n\n      system::ProcessCallbacks cb;\n      cb.onContinue = boost::bind(&PosixShell::onContinue, pShell, _1);\n      cb.onStdout = boost::bind(&PosixShell::onStdout, pShell, _2);\n      cb.onExit = boost::bind(&PosixShell::onExit, pShell, _1);\n\n      system::ProcessOptions options;\n      options.pseudoterminal = system::Pseudoterminal(width, 1);\n      Error error = module_context::processSupervisor().runCommand(\"\/bin\/sh\",\n                                                                   options,\n                                                                   cb);\n      if (!error)\n      {\n         *ppPosixShell = pShell;\n         return Success();\n      }\n      else\n      {\n         return error;\n      }\n\n   }\n\nprivate:\n   PosixShell(int maxLines)\n      : maxLines_(maxLines), interrupt_(false), terminate_(false)\n   {\n   }\n\npublic:\n   virtual ~PosixShell() {}\n\n   void enqueueInput(const std::string &input)\n   {\n      inputQueue_.append(input);\n   }\n\n   void interrupt()\n   {\n      interrupt_ = true;\n   }\n\n   void terminate()\n   {\n      terminate_ = true;\n   }\n\n\nprivate:\n   bool onContinue(core::system::ProcessOperations& ops)\n   {\n      if (terminate_)\n         return false;\n\n      if (!inputQueue_.empty())\n      {\n         Error error = ops.writeToStdin(inputQueue_, false);\n         if (error)\n            LOG_ERROR(error);\n\n         inputQueue_.clear();\n      }\n\n      if (interrupt_)\n      {\n         Error error = ops.ptyInterrupt();\n         if (error)\n            LOG_ERROR(error);\n\n         interrupt_ = false;\n      }\n\n      return true;\n   }\n\n   void onStdout(const std::string& output)\n   {\n      \/\/ if we are the active shell then emit output event\n      if (s_pActiveShell.get() == this)\n      {\n         ClientEvent event(client_events::kPosixShellOutput, output);\n         module_context::enqueClientEvent(event);\n      }\n   }\n\n   void onExit(int exitCode)\n   {\n      \/\/ if we are the active shell then notify the client that we\n      \/\/ are being terminated (if we aren't the active shell then\n      \/\/ the client isn't (logically) listenting for exit\n      if (s_pActiveShell.get() == this)\n      {\n         s_pActiveShell.reset();\n\n         \/\/ notify client\n         json::Object eventData;\n         eventData[\"exit_code\"] = exitCode;\n         ClientEvent event(client_events::kPosixShellExit, eventData);\n         module_context::enqueClientEvent(event);\n      }\n   }\n\nprivate:\n   int maxLines_;\n   std::string inputQueue_;\n   bool interrupt_;\n   bool terminate_;\n};\n\n\nError startPosixShell(const json::JsonRpcRequest& request,\n                      json::JsonRpcResponse* pResponse)\n{\n   \/\/ get parameters\n   int width, maxLines;\n   Error error = json::readParams(request.params, &width, &maxLines);\n   if (error)\n      return error;\n\n   \/\/ terminate any existing shell\n   if (s_pActiveShell)\n   {\n      s_pActiveShell->terminate();\n      s_pActiveShell.reset();\n   }\n\n   \/\/ start a new shell\n   return PosixShell::create(width, maxLines, &s_pActiveShell);\n}\n\nError interruptPosixShell(const json::JsonRpcRequest& request,\n                          json::JsonRpcResponse* pResponse)\n{\n   \/\/ validate we have an active shell\n   if (!s_pActiveShell)\n      return Error(json::errc::MethodUnexpected, ERROR_LOCATION);\n\n   s_pActiveShell->interrupt();\n\n   return Success();\n}\n\nError sendInputToPosixShell(const json::JsonRpcRequest& request,\n                            json::JsonRpcResponse* pResponse)\n{\n   \/\/ read param\n   std::string input;\n   Error error = json::readParam(request.params, 0, &input);\n   if (error)\n      return error;\n\n   \/\/ validate we have an active shell\n   if (!s_pActiveShell)\n      return Error(json::errc::MethodUnexpected, ERROR_LOCATION);\n\n   \/\/ send input\n   s_pActiveShell->enqueueInput(input);\n\n   return Success();\n}\n\nError terminatePosixShell(const json::JsonRpcRequest& request,\n                          json::JsonRpcResponse* pResponse)\n{\n   \/\/ validate we have an active shell\n   if (!s_pActiveShell)\n      return Error(json::errc::MethodUnexpected, ERROR_LOCATION);\n\n   s_pActiveShell->terminate();\n\n   return Success();\n}\n\n\nvoid onClientInit()\n{\n   \/\/ terminate any active shell we have on client init\n   if (s_pActiveShell)\n   {\n      s_pActiveShell->terminate();\n      s_pActiveShell.reset();\n   }\n}\n\n\n} \/\/ anonymous namespace\n\n\nError initialize()\n{\n   using namespace module_context;\n   module_context::events().onClientInit.connect(boost::bind(onClientInit));\n\n   ExecBlock initBlock ;\n   initBlock.addFunctions()\n      (bind(registerRpcMethod, \"start_posix_shell\", startPosixShell))\n      (bind(registerRpcMethod, \"interrupt_posix_shell\", interruptPosixShell))\n      (bind(registerRpcMethod, \"send_input_to_posix_shell\", sendInputToPosixShell))\n      (bind(registerRpcMethod, \"terminate_posix_shell\", terminatePosixShell));\n   return initBlock.execute();\n\n}\n   \n   \n} \/\/ namespace posix_shell\n} \/\/ namespace modules\n} \/\/ namesapce session\n\n<commit_msg>Fix build on Mac<commit_after>\/*\n * SessionPosixShell.cpp\n *\n * Copyright (C) 2009-11 by RStudio, Inc.\n *\n * This program is licensed to you under the terms of version 3 of the\n * GNU Affero General Public License. This program is distributed WITHOUT\n * ANY EXPRESS OR IMPLIED WARRANTY, INCLUDING THOSE OF NON-INFRINGEMENT,\n * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Please refer to the\n * AGPL (http:\/\/www.gnu.org\/licenses\/agpl-3.0.txt) for more details.\n *\n *\/\n\n\/\/ TODO: set sane initial size for shell dialog\n\n\/\/ TODO: ability to interrupt slave\n\n\/\/ TODO: ability to terminate slave via kill\n\n\/\/ TODO: ui chrome (consider console dialog style hanging from top)\n\/\/ TODO: border for shell widget\n\n\/\/ TODO: up-arrow history\n\n\/\/ TODO: other editing shortcuts (completion manager?)\n\n\/\/ TODO: cap output lines sent on the server\n\n\n#include \"SessionPosixShell.hpp\"\n\n#include <boost\/shared_ptr.hpp>\n\n#include <core\/Log.hpp>\n#include <core\/Error.hpp>\n#include <core\/Exec.hpp>\n#include <core\/system\/Process.hpp>\n\n#include <session\/SessionModuleContext.hpp>\n\nusing namespace core ;\n\nnamespace session {\nnamespace modules { \nnamespace posix_shell {\n\nnamespace {\n\nclass PosixShell;\nboost::shared_ptr<PosixShell> s_pActiveShell;\n\nclass PosixShell : boost::noncopyable\n{\npublic:\n   static Error create(int width,\n                       int maxLines,\n                       boost::shared_ptr<PosixShell>* ppPosixShell)\n   {\n      boost::shared_ptr<PosixShell> pShell(new PosixShell(maxLines));\n\n      core::system::ProcessCallbacks cb;\n      cb.onContinue = boost::bind(&PosixShell::onContinue, pShell, _1);\n      cb.onStdout = boost::bind(&PosixShell::onStdout, pShell, _2);\n      cb.onExit = boost::bind(&PosixShell::onExit, pShell, _1);\n\n      core::system::ProcessOptions options;\n      options.pseudoterminal = core::system::Pseudoterminal(width, 1);\n      Error error = module_context::processSupervisor().runCommand(\"\/bin\/sh\",\n                                                                   options,\n                                                                   cb);\n      if (!error)\n      {\n         *ppPosixShell = pShell;\n         return Success();\n      }\n      else\n      {\n         return error;\n      }\n\n   }\n\nprivate:\n   PosixShell(int maxLines)\n      : maxLines_(maxLines), interrupt_(false), terminate_(false)\n   {\n   }\n\npublic:\n   virtual ~PosixShell() {}\n\n   void enqueueInput(const std::string &input)\n   {\n      inputQueue_.append(input);\n   }\n\n   void interrupt()\n   {\n      interrupt_ = true;\n   }\n\n   void terminate()\n   {\n      terminate_ = true;\n   }\n\n\nprivate:\n   bool onContinue(core::system::ProcessOperations& ops)\n   {\n      if (terminate_)\n         return false;\n\n      if (!inputQueue_.empty())\n      {\n         Error error = ops.writeToStdin(inputQueue_, false);\n         if (error)\n            LOG_ERROR(error);\n\n         inputQueue_.clear();\n      }\n\n      if (interrupt_)\n      {\n         Error error = ops.ptyInterrupt();\n         if (error)\n            LOG_ERROR(error);\n\n         interrupt_ = false;\n      }\n\n      return true;\n   }\n\n   void onStdout(const std::string& output)\n   {\n      \/\/ if we are the active shell then emit output event\n      if (s_pActiveShell.get() == this)\n      {\n         ClientEvent event(client_events::kPosixShellOutput, output);\n         module_context::enqueClientEvent(event);\n      }\n   }\n\n   void onExit(int exitCode)\n   {\n      \/\/ if we are the active shell then notify the client that we\n      \/\/ are being terminated (if we aren't the active shell then\n      \/\/ the client isn't (logically) listenting for exit\n      if (s_pActiveShell.get() == this)\n      {\n         s_pActiveShell.reset();\n\n         \/\/ notify client\n         json::Object eventData;\n         eventData[\"exit_code\"] = exitCode;\n         ClientEvent event(client_events::kPosixShellExit, eventData);\n         module_context::enqueClientEvent(event);\n      }\n   }\n\nprivate:\n   int maxLines_;\n   std::string inputQueue_;\n   bool interrupt_;\n   bool terminate_;\n};\n\n\nError startPosixShell(const json::JsonRpcRequest& request,\n                      json::JsonRpcResponse* pResponse)\n{\n   \/\/ get parameters\n   int width, maxLines;\n   Error error = json::readParams(request.params, &width, &maxLines);\n   if (error)\n      return error;\n\n   \/\/ terminate any existing shell\n   if (s_pActiveShell)\n   {\n      s_pActiveShell->terminate();\n      s_pActiveShell.reset();\n   }\n\n   \/\/ start a new shell\n   return PosixShell::create(width, maxLines, &s_pActiveShell);\n}\n\nError interruptPosixShell(const json::JsonRpcRequest& request,\n                          json::JsonRpcResponse* pResponse)\n{\n   \/\/ validate we have an active shell\n   if (!s_pActiveShell)\n      return Error(json::errc::MethodUnexpected, ERROR_LOCATION);\n\n   s_pActiveShell->interrupt();\n\n   return Success();\n}\n\nError sendInputToPosixShell(const json::JsonRpcRequest& request,\n                            json::JsonRpcResponse* pResponse)\n{\n   \/\/ read param\n   std::string input;\n   Error error = json::readParam(request.params, 0, &input);\n   if (error)\n      return error;\n\n   \/\/ validate we have an active shell\n   if (!s_pActiveShell)\n      return Error(json::errc::MethodUnexpected, ERROR_LOCATION);\n\n   \/\/ send input\n   s_pActiveShell->enqueueInput(input);\n\n   return Success();\n}\n\nError terminatePosixShell(const json::JsonRpcRequest& request,\n                          json::JsonRpcResponse* pResponse)\n{\n   \/\/ validate we have an active shell\n   if (!s_pActiveShell)\n      return Error(json::errc::MethodUnexpected, ERROR_LOCATION);\n\n   s_pActiveShell->terminate();\n\n   return Success();\n}\n\n\nvoid onClientInit()\n{\n   \/\/ terminate any active shell we have on client init\n   if (s_pActiveShell)\n   {\n      s_pActiveShell->terminate();\n      s_pActiveShell.reset();\n   }\n}\n\n\n} \/\/ anonymous namespace\n\n\nError initialize()\n{\n   using namespace module_context;\n   module_context::events().onClientInit.connect(boost::bind(onClientInit));\n\n   ExecBlock initBlock ;\n   initBlock.addFunctions()\n      (bind(registerRpcMethod, \"start_posix_shell\", startPosixShell))\n      (bind(registerRpcMethod, \"interrupt_posix_shell\", interruptPosixShell))\n      (bind(registerRpcMethod, \"send_input_to_posix_shell\", sendInputToPosixShell))\n      (bind(registerRpcMethod, \"terminate_posix_shell\", terminatePosixShell));\n   return initBlock.execute();\n\n}\n   \n   \n} \/\/ namespace posix_shell\n} \/\/ namespace modules\n} \/\/ namesapce session\n\n<|endoftext|>"}
{"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/usr\/isteps\/istep09\/call_proc_fab_iovalid.C $              *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2015,2016                        *\/\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_proc_fab_iovalid.C\n *\n *  Support file for IStep: edi_ei_initialization\n *   EDI, EI Initialization\n *\n *  HWP_IGNORE_VERSION_CHECK\n *\n *\/\n\n\/******************************************************************************\/\n\/\/ Includes\n\/******************************************************************************\/\n#include    <stdint.h>\n#include    <map>\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\n#include    <hwas\/common\/deconfigGard.H>\n#include    <hwas\/common\/hwasCommon.H>\n\n#include    <sbe\/sbeif.H>\n\n\/\/  targeting support\n#include    <targeting\/common\/commontargeting.H>\n#include    <targeting\/common\/utilFilter.H>\n#include    <targeting\/common\/trace.H>\n\n#include <fapi2\/target.H>\n#include <fapi2\/plat_hwp_invoker.H>\n#include <errl\/errlmanager.H>\n\n\/\/ HWP\n#include <p9_fab_iovalid.H>\n\nnamespace   ISTEP_09\n{\n\nusing   namespace   ISTEP;\nusing   namespace   ISTEP_ERROR;\nusing   namespace   ERRORLOG;\nusing   namespace   TARGETING;\nusing   namespace   HWAS;\n\/\/\n\/\/  Wrapper function to call proc_fab_iovalid\n\/\/\nvoid*    call_proc_fab_iovalid( void    *io_pArgs )\n{\n    IStepError l_StepError;\n    errlHndl_t l_errl = NULL;\n\n    TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n               \"call_proc_fab_iovalid entry\" );\n\n    \/\/\n    \/\/  get a list of all the procs in the system\n    \/\/\n    TARGETING::TargetHandleList l_cpuTargetList;\n    getAllChips(l_cpuTargetList, TYPE_PROC);\n\n    \/\/ Loop through all processors including master\n    for (const auto & l_cpu_target: l_cpuTargetList)\n    {\n        const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>l_fapi2_proc_target(\n                  l_cpu_target);\n\n        TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                 \"Running p9_fab_iovalid HWP on processor target %.8X\",\n                 TARGETING::get_huid(l_cpu_target) );\n\/\/ @TODO RTC:134079 Integrate L2 HWPs for istep 9\n\/\/         FAPI_INVOKE_HWP(l_errl, p9_fab_iovalid, l_fapi2_proc_target, true);\n        if(l_errl)\n        {\n            TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                     \"ERROR 0x%.8X : p9_fab_iovalid \"\n                     \"HWP returns error for HUID %.8X\",\n                     l_errl->reasonCode(),\n                     TARGETING::get_huid(l_cpu_target) );\n\n            \/\/ capture the target data in the elog\n            ErrlUserDetailsTarget(l_cpu_target).addToLog( l_errl );\n\n            l_StepError.addErrorDetails(l_errl);\n            errlCommit(l_errl, HWPF_COMP_ID);\n            l_errl = NULL;\n        }\n    } \/\/ end of going through all processors\/\/\n\n    TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n               \"call_proc_fab_iovalid exit\" );\n\n    \/\/ end task, returning any errorlogs to IStepDisp\n    return l_StepError.getErrorHandle();\n}\n};   \/\/ end namespace\n<commit_msg>Actually call p9_fab_iovalid<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/usr\/isteps\/istep09\/call_proc_fab_iovalid.C $              *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2015,2016                        *\/\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_proc_fab_iovalid.C\n *\n *  Support file for IStep: edi_ei_initialization\n *   EDI, EI Initialization\n *\n *  HWP_IGNORE_VERSION_CHECK\n *\n *\/\n\n\/******************************************************************************\/\n\/\/ Includes\n\/******************************************************************************\/\n#include    <stdint.h>\n#include    <map>\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\n#include    <hwas\/common\/deconfigGard.H>\n#include    <hwas\/common\/hwasCommon.H>\n\n#include    <sbe\/sbeif.H>\n\n\/\/  targeting support\n#include    <targeting\/common\/commontargeting.H>\n#include    <targeting\/common\/utilFilter.H>\n#include    <targeting\/common\/trace.H>\n\n#include <fapi2\/target.H>\n#include <fapi2\/plat_hwp_invoker.H>\n#include <errl\/errlmanager.H>\n\n\/\/ HWP\n#include <p9_fab_iovalid.H>\n\nnamespace   ISTEP_09\n{\n\nusing   namespace   ISTEP;\nusing   namespace   ISTEP_ERROR;\nusing   namespace   ERRORLOG;\nusing   namespace   TARGETING;\nusing   namespace   HWAS;\n\/\/\n\/\/  Wrapper function to call proc_fab_iovalid\n\/\/\nvoid*    call_proc_fab_iovalid( void    *io_pArgs )\n{\n    IStepError l_StepError;\n    errlHndl_t l_errl = NULL;\n\n    TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n               \"call_proc_fab_iovalid entry\" );\n\n    \/\/\n    \/\/  get a list of all the procs in the system\n    \/\/\n    TARGETING::TargetHandleList l_cpuTargetList;\n    getAllChips(l_cpuTargetList, TYPE_PROC);\n\n    \/\/ Loop through all processors including master\n    for (const auto & l_cpu_target: l_cpuTargetList)\n    {\n        const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>l_fapi2_proc_target(\n                  l_cpu_target);\n\n        TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                 \"Running p9_fab_iovalid HWP on processor target %.8X\",\n                 TARGETING::get_huid(l_cpu_target) );\n        FAPI_INVOKE_HWP(l_errl, p9_fab_iovalid, l_fapi2_proc_target,\n                        true, true, false);\n        if(l_errl)\n        {\n            TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                     \"ERROR 0x%.8X : p9_fab_iovalid \"\n                     \"HWP returns error for HUID %.8X\",\n                     l_errl->reasonCode(),\n                     TARGETING::get_huid(l_cpu_target) );\n\n            \/\/ capture the target data in the elog\n            ErrlUserDetailsTarget(l_cpu_target).addToLog( l_errl );\n\n            l_StepError.addErrorDetails(l_errl);\n            errlCommit(l_errl, HWPF_COMP_ID);\n            l_errl = NULL;\n        }\n    } \/\/ end of going through all processors\/\/\n\n    TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n               \"call_proc_fab_iovalid exit\" );\n\n    \/\/ end task, returning any errorlogs to IStepDisp\n    return l_StepError.getErrorHandle();\n}\n};   \/\/ end namespace\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\/\/  SeparableInputFirstAllocator: Separable Input-First Allocator\n\/\/\n\/\/ ----------------------------------------------------------------------\n\n#include \"separable_input_first.hpp\"\n\n#include \"booksim.hpp\"\n#include \"arbiter.hpp\"\n\n#include <vector>\n#include <iostream>\n#include <cstring>\n\nSeparableInputFirstAllocator::\nSeparableInputFirstAllocator( Module* parent, const string& name, int inputs,\n\t\t\t      int outputs, const string& arb_type )\n  : SeparableAllocator( parent, name, inputs, outputs, arb_type )\n{}\n\nvoid SeparableInputFirstAllocator::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  _requests[in].push_back( req ) ;\n  in_event.insert(in);\n  if ( req.label > -1 ) {\n    _input_arb[in]->AddRequest( out, _requests[in].size()-1, in_pri ) ;\n  }\n  \n}\n\n\nvoid SeparableInputFirstAllocator::Allocate() {\n  \n  _ClearMatching() ;\n  \n  \/\/  cout << \"SeparableInputFirstAllocator::Allocate()\" << endl ;\n  \/\/  PrintRequests() ;\n  \n  \/\/ Execute the input arbiters and propagate the grants to the\n  \/\/ output arbiters.\n  for(set<int>::iterator i = in_event.begin(); i!=in_event.end(); i++){\n    int input = *i;\n    int id;\n    int pri;\n    int out =_input_arb[input]->Arbitrate( &id, &pri );\n    const sRequest& req = (_requests[input][id]); \n    assert(out == req.port && pri == req.in_pri);\n    _output_arb[out]->AddRequest( input, req.label, req.out_pri );\n    out_event.insert(out);\n  }\n\n\n  \/\/ Execute the output arbiters.\n  for(set<int>::iterator i = out_event.begin(); i!=out_event.end(); i++){\n\n    int label, pri ;\n    int output = *i;\n    int  input = _output_arb[output]->Arbitrate( &label, &pri ) ;\n    assert( _inmatch[input] == -1 && _outmatch[output] == -1 ) ;\n    _inmatch[input]   = output ;\n    _outmatch[output] = input ;\n    _input_arb[input]->UpdateState() ;\n    _output_arb[output]->UpdateState() ;\n\n  }\n  in_event.clear();\n  out_event.clear();\n}\n<commit_msg>more code reuse fixes<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\/\/  SeparableInputFirstAllocator: Separable Input-First Allocator\n\/\/\n\/\/ ----------------------------------------------------------------------\n\n#include \"separable_input_first.hpp\"\n\n#include \"booksim.hpp\"\n#include \"arbiter.hpp\"\n\n#include <vector>\n#include <iostream>\n#include <cstring>\n\nSeparableInputFirstAllocator::\nSeparableInputFirstAllocator( Module* parent, const string& name, int inputs,\n\t\t\t      int outputs, const string& arb_type )\n  : SeparableAllocator( parent, name, inputs, outputs, arb_type )\n{}\n\nvoid SeparableInputFirstAllocator::AddRequest( int in, int out, int label, int in_pri,\n\t\t\t\t     int out_pri ) {\n\n  SeparableAllocator::AddRequest(in, out, label, in_pri, out_pri);\n  in_event.insert(in);\n  if ( label > -1 ) {\n    _input_arb[in]->AddRequest( out, _requests[in].size()-1, in_pri ) ;\n  }\n  \n}\n\n\nvoid SeparableInputFirstAllocator::Allocate() {\n  \n  _ClearMatching() ;\n  \n  \/\/  cout << \"SeparableInputFirstAllocator::Allocate()\" << endl ;\n  \/\/  PrintRequests() ;\n  \n  \/\/ Execute the input arbiters and propagate the grants to the\n  \/\/ output arbiters.\n  for(set<int>::iterator i = in_event.begin(); i!=in_event.end(); i++){\n    int input = *i;\n    int id;\n    int pri;\n    int out =_input_arb[input]->Arbitrate( &id, &pri );\n    const sRequest& req = (_requests[input][id]); \n    assert(out == req.port && pri == req.in_pri);\n    _output_arb[out]->AddRequest( input, req.label, req.out_pri );\n    out_event.insert(out);\n  }\n\n\n  \/\/ Execute the output arbiters.\n  for(set<int>::iterator i = out_event.begin(); i!=out_event.end(); i++){\n\n    int label, pri ;\n    int output = *i;\n    int  input = _output_arb[output]->Arbitrate( &label, &pri ) ;\n    assert( _inmatch[input] == -1 && _outmatch[output] == -1 ) ;\n    _inmatch[input]   = output ;\n    _outmatch[output] = input ;\n    _input_arb[input]->UpdateState() ;\n    _output_arb[output]->UpdateState() ;\n\n  }\n  in_event.clear();\n  out_event.clear();\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.2  2002\/10\/29 18:58:14  tng\n * Support for Linux\/390 which is big endian\n *\n * Revision 1.1.1.1  2002\/02\/01 22:22:24  peiyongz\n * sane_include\n *\n * Revision 1.3  2000\/03\/02 19:55:24  roddey\n * This checkin includes many changes done while waiting for the\n * 1.1.0 code to be finished. I can't list them all here, but a list is\n * available elsewhere.\n *\n * Revision 1.2  2000\/02\/06 07:48:28  rahulj\n * Year 2K copyright swat.\n *\n * Revision 1.1.1.1  1999\/11\/09 01:07:00  twl\n * Initial checkin\n *\n * Revision 1.2  1999\/11\/08 20:45:30  rahul\n * Swat for adding in Product name and CVS comment log variable.\n *\n *\/\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  linux runs in little endian mode\n\/\/ ---------------------------------------------------------------------------\n#ifdef XML_LINUX_390\n    #define ENDIANMODE_BIG\n#else\n    #define ENDIANMODE_LITTLE\n#endif\ntypedef void* FileHandle;\n\n#ifndef LINUX\n#define LINUX\n#endif\n<commit_msg>[Bug 13487] Linux runs on many non-i386 platforms.<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.3  2002\/11\/19 18:19:41  tng\n * [Bug 13487] Linux runs on many non-i386 platforms.\n *\n * Revision 1.2  2002\/10\/29 18:58:14  tng\n * Support for Linux\/390 which is big endian\n *\n * Revision 1.1.1.1  2002\/02\/01 22:22:24  peiyongz\n * sane_include\n *\n * Revision 1.3  2000\/03\/02 19:55:24  roddey\n * This checkin includes many changes done while waiting for the\n * 1.1.0 code to be finished. I can't list them all here, but a list is\n * available elsewhere.\n *\n * Revision 1.2  2000\/02\/06 07:48:28  rahulj\n * Year 2K copyright swat.\n *\n * Revision 1.1.1.1  1999\/11\/09 01:07:00  twl\n * Initial checkin\n *\n * Revision 1.2  1999\/11\/08 20:45:30  rahul\n * Swat for adding in Product name and CVS comment log variable.\n *\n *\/\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  Detect endian mode\n\/\/ ---------------------------------------------------------------------------\n#include <endian.h>\n#ifdef __BYTE_ORDER\n    #if __BYTE_ORDER == __LITTLE_ENDIAN\n        #define ENDIANMODE_LITTLE\n    #else\n        #if __BYTE_ORDER == __BIG_ENDIAN\n            #define ENDIANMODE_BIG\n        #else\n            #error: unknown byte order!\n        #endif\n    #endif\n#endif \/* __BYTE_ORDER *\/\n\ntypedef void* FileHandle;\n\n#ifndef LINUX\n#define LINUX\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * This file is a part of Xpiks - cross platform application for\n * keywording and uploading images for microstocks\n * Copyright (C) 2014-2016 Taras Kushnir <kushnirTV@gmail.com>\n *\n * Xpiks is distributed under the GNU General Public License, version 3.0\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 \"exiv2readingworker.h\"\n#include <QVector>\n#include \"..\/xpiks-qt\/Models\/artworkmetadata.h\"\n#include \"..\/xpiks-qt\/Common\/defines.h\"\n#include <exiv2\/exiv2.hpp>\n\nnamespace MetadataIO {\n    Exiv2ReadingWorker::Exiv2ReadingWorker(int index, QVector<Models::ArtworkMetadata *> itemsToRead, QObject *parent):\n        QObject(parent),\n        m_ItemsToRead(itemsToRead),\n        m_WorkerIndex(index),\n        m_Stopped(false)\n    {\n        Q_ASSERT(!itemsToRead.isEmpty());\n        LOG_INFO << itemsToRead.size() << \"items to read\";\n    }\n\n    Exiv2ReadingWorker::~Exiv2ReadingWorker() {\n        LOG_DEBUG << \"Reading worker\" << m_WorkerIndex << \"destroyed\";\n    }\n\n    void Exiv2ReadingWorker::process() {\n        LOG_DEBUG << \"Worker #\" << m_WorkerIndex << \"started\";\n\n        bool anyError = false;\n\n        int size = m_ItemsToRead.size();\n        for (int i = 0; i < size; ++i) {\n            if (m_Stopped) { break; }\n\n            Models::ArtworkMetadata *artwork = m_ItemsToRead.at(i);\n            const QString &filepath = artwork->getFilepath();\n            ImportDataResult importResult;\n\n            try {\n                if (readMetadata(artwork, importResult)) {\n                    Q_ASSERT(!m_ImportResult.contains(filepath));\n                    m_ImportResult.insert(filepath, importResult);\n                }\n            }\n            catch(Exiv2::Error &error) {\n                anyError = true;\n                LOG_WARNING << \"Worker\" << m_WorkerIndex << \"Exiv2 error:\" << error.what();\n            }\n            catch(...) {\n                anyError = true;\n                LOG_WARNING << \"Worker\" << m_WorkerIndex << \"Reading error for item\" << filepath;\n            }\n        }\n\n        LOG_INFO << \"Worker #\" << m_WorkerIndex << \"finished\";\n\n        emit finished(anyError);\n    }\n\n    void Exiv2ReadingWorker::cancel() {\n        m_Stopped = true;\n    }\n\n    bool Exiv2ReadingWorker::readMetadata(Models::ArtworkMetadata *artwork, ImportDataResult &importResult) {\n        \/\/ BUMP\n        return false;\n    }\n}\n<commit_msg>Minor api changes [ci skip]<commit_after>\/*\n * This file is a part of Xpiks - cross platform application for\n * keywording and uploading images for microstocks\n * Copyright (C) 2014-2016 Taras Kushnir <kushnirTV@gmail.com>\n *\n * Xpiks is distributed under the GNU General Public License, version 3.0\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 \"exiv2readingworker.h\"\n#include <QVector>\n#include \"..\/xpiks-qt\/Models\/artworkmetadata.h\"\n#include \"..\/xpiks-qt\/Common\/defines.h\"\n#include <exiv2\/exiv2.hpp>\n\nnamespace MetadataIO {\n    QString retrieveDescription(Exiv2::XmpData &xmpData, Exiv2::ExifData &exifData, Exiv2::IptcData &iptcData) {\n\n    }\n\n    Exiv2ReadingWorker::Exiv2ReadingWorker(int index, QVector<Models::ArtworkMetadata *> itemsToRead, QObject *parent):\n        QObject(parent),\n        m_ItemsToRead(itemsToRead),\n        m_WorkerIndex(index),\n        m_Stopped(false)\n    {\n        Q_ASSERT(!itemsToRead.isEmpty());\n        LOG_INFO << itemsToRead.size() << \"items to read\";\n    }\n\n    Exiv2ReadingWorker::~Exiv2ReadingWorker() {\n        LOG_DEBUG << \"Reading worker\" << m_WorkerIndex << \"destroyed\";\n    }\n\n    void Exiv2ReadingWorker::process() {\n        LOG_DEBUG << \"Worker #\" << m_WorkerIndex << \"started\";\n\n        bool anyError = false;\n\n        int size = m_ItemsToRead.size();\n        for (int i = 0; i < size; ++i) {\n            if (m_Stopped) { break; }\n\n            Models::ArtworkMetadata *artwork = m_ItemsToRead.at(i);\n            const QString &filepath = artwork->getFilepath();\n            ImportDataResult importResult;\n\n            try {\n                if (readMetadata(artwork, importResult)) {\n                    Q_ASSERT(!m_ImportResult.contains(filepath));\n                    m_ImportResult.insert(filepath, importResult);\n                }\n            }\n            catch(Exiv2::Error &error) {\n                anyError = true;\n                LOG_WARNING << \"Worker\" << m_WorkerIndex << \"Exiv2 error:\" << error.what();\n            }\n            catch(...) {\n                anyError = true;\n                LOG_WARNING << \"Worker\" << m_WorkerIndex << \"Reading error for item\" << filepath;\n            }\n        }\n\n        LOG_INFO << \"Worker #\" << m_WorkerIndex << \"finished\";\n\n        emit finished(anyError);\n    }\n\n    void Exiv2ReadingWorker::cancel() {\n        m_Stopped = true;\n    }\n\n    bool Exiv2ReadingWorker::readMetadata(Models::ArtworkMetadata *artwork, ImportDataResult &importResult) {\n        const QString &filepath = artwork->getFilepath();\n\n        Exiv2::Image::AutoPtr image = Exiv2::ImageFactory::open(filepath.toStdWString());\n        image->readMetadata();\n\n        Exiv2::XmpData &xmpData = image->xmpData();\n        Exiv2::ExifData &exifData = image->exifData();\n        Exiv2::IptcData &iptcData = image->iptcData();\n\n        importResult.Description = retrieveDescription(xmpData, exifData, iptcData);\n\n        \/\/ BUMP\n        return false;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef STAN_MATH_PRIM_SCAL_FUN_GRAD_REG_INC_GAMMA_HPP\n#define STAN_MATH_PRIM_SCAL_FUN_GRAD_REG_INC_GAMMA_HPP\n\n#include <stan\/math\/prim\/scal\/err\/domain_error.hpp>\n#include <stan\/math\/prim\/scal\/fun\/gamma_p.hpp>\n#include <stan\/math\/prim\/scal\/fun\/gamma_q.hpp>\n#include <stan\/math\/prim\/scal\/fun\/is_inf.hpp>\n#include <stan\/math\/prim\/scal\/fun\/square.hpp>\n#include <cmath>\n\nnamespace stan {\n  namespace math {\n\n    \/**\n     * Gradient of the regularized incomplete gamma functions igamma(a, z)\n     *\n     * For small z, the gradient is computed via the series expansion;\n     * for large z, the series is numerically inaccurate due to cancellation\n     * and the asymptotic expansion is used.\n     *\n     * @param a   shape parameter, a > 0\n     * @param z   location z >= 0\n     * @param g   boost::math::tgamma(a) (precomputed value)\n     * @param dig boost::math::digamma(a) (precomputed value)\n     * @param precision required precision; applies to series expansion only\n     * @param max_steps number of steps to take. defaults to 10000\n     * @throw throws std::domain_error if not converged after max_steps\n     *   or increment overflows to inf.\n     *\n     * For the asymptotic expansion, the gradient is given by:\n       \\f[\n       \\begin{array}{rcl}\n       \\Gamma(a, z) & = & z^{a-1}e^{-z} \\sum_{k=0}^N \\frac{(a-1)_k}{z^k} \\qquad , z \\gg a\\\\\n       Q(a, z) & = & \\frac{z^{a-1}e^{-z}}{\\Gamma(a)} \\sum_{k=0}^N \\frac{(a-1)_k}{z^k}\\\\\n       (a)_k & = & (a)_{k-1}(a-k)\\\\\n       \\frac{d}{da} (a)_k & = & (a)_{k-1} + (a-k)\\frac{d}{da} (a)_{k-1}\\\\\n       \\frac{d}{da}Q(a, z) & = & (log(z) - \\psi(a)) Q(a, z)\\\\\n       && + \\frac{z^{a-1}e^{-z}}{\\Gamma(a)} \\sum_{k=0}^N \\left(\\frac{d}{da} (a-1)_k\\right) \\frac{1}{z^k}\n       \\end{array}\n       \\f]\n     *\/\n    template<typename T>\n    T grad_reg_inc_gamma(T a, T z, T g, T dig, double precision = 1e-6,\n        int max_steps = 1e5) {\n      using std::domain_error;\n      using std::exp;\n      using std::fabs;\n      using std::log;\n\n      T l = log(z);\n      if (z >= a && z >= 8) {\n        \/\/ asymptotic expansion http:\/\/dlmf.nist.gov\/8.11#E2\n        T S = 0;\n        T a_minus_one_minus_k = a - 1;\n        T fac = a_minus_one_minus_k;  \/\/ falling_factorial(a-1, k)\n        T dfac = 1;   \/\/ d\/da[falling_factorial(a-1, k)]\n        T zpow = z;   \/\/ z ** k\n        T delta = dfac \/ zpow;\n\n        for (int k = 1; k < 10; ++k) {\n          a_minus_one_minus_k -= 1;\n\n          S += delta;\n\n          zpow *= z;\n          dfac = a_minus_one_minus_k * dfac + fac;\n          fac *= a_minus_one_minus_k;\n          delta = dfac \/ zpow;\n\n          if (is_inf(delta))\n            stan::math::domain_error(\"grad_reg_inc_gamma\",\n                                     \"is not converging\", \"\", \"\");\n        }\n\n        return gamma_q(a, z) * (l - dig) + exp(-z + (a - 1) * l) * S \/ g;\n      } else {\n        \/\/ gradient of series expansion http:\/\/dlmf.nist.gov\/8.7#E3\n\n        T S = 0;\n        T s = 1;\n        int k = 0;\n        T delta = s \/ square(a);\n        while (fabs(delta) > precision) {\n          S += delta;\n          ++k;\n          s *= - z \/ k;\n          delta = s \/ square(k + a);\n          if (k >= max_steps)\n            stan::math::domain_error(\"grad_reg_inc_gamma\",\n              \"k (internal counter)\",\n              max_steps, \"exceeded \",\n              \" iterations, gamma function gradient did not converge.\");\n          if (is_inf(delta))\n            stan::math::domain_error(\"grad_reg_inc_gamma\",\n                                     \"is not converging\", \"\", \"\");\n        }\n        return gamma_p(a, z) * ( dig - l ) + exp( a * l ) * S \/ g;\n      }\n    }\n\n  }\n}\n#endif\n<commit_msg>Placed grad_reg_inc_gamma power series approximation on log scale.<commit_after>#ifndef STAN_MATH_PRIM_SCAL_FUN_GRAD_REG_INC_GAMMA_HPP\n#define STAN_MATH_PRIM_SCAL_FUN_GRAD_REG_INC_GAMMA_HPP\n\n#include <stan\/math\/prim\/scal\/err\/domain_error.hpp>\n#include <stan\/math\/prim\/scal\/fun\/gamma_p.hpp>\n#include <stan\/math\/prim\/scal\/fun\/gamma_q.hpp>\n#include <stan\/math\/prim\/scal\/fun\/is_inf.hpp>\n#include <stan\/math\/prim\/scal\/fun\/square.hpp>\n#include <cmath>\n\nnamespace stan {\n  namespace math {\n\n    \/**\n     * Gradient of the regularized incomplete gamma functions igamma(a, z)\n     *\n     * For small z, the gradient is computed via the series expansion;\n     * for large z, the series is numerically inaccurate due to cancellation\n     * and the asymptotic expansion is used.\n     *\n     * @param a   shape parameter, a > 0\n     * @param z   location z >= 0\n     * @param g   boost::math::tgamma(a) (precomputed value)\n     * @param dig boost::math::digamma(a) (precomputed value)\n     * @param precision required precision; applies to series expansion only\n     * @param max_steps number of steps to take. defaults to 10000\n     * @throw throws std::domain_error if not converged after max_steps\n     *   or increment overflows to inf.\n     *\n     * For the asymptotic expansion, the gradient is given by:\n       \\f[\n       \\begin{array}{rcl}\n       \\Gamma(a, z) & = & z^{a-1}e^{-z} \\sum_{k=0}^N \\frac{(a-1)_k}{z^k} \\qquad , z \\gg a\\\\\n       Q(a, z) & = & \\frac{z^{a-1}e^{-z}}{\\Gamma(a)} \\sum_{k=0}^N \\frac{(a-1)_k}{z^k}\\\\\n       (a)_k & = & (a)_{k-1}(a-k)\\\\\n       \\frac{d}{da} (a)_k & = & (a)_{k-1} + (a-k)\\frac{d}{da} (a)_{k-1}\\\\\n       \\frac{d}{da}Q(a, z) & = & (log(z) - \\psi(a)) Q(a, z)\\\\\n       && + \\frac{z^{a-1}e^{-z}}{\\Gamma(a)} \\sum_{k=0}^N \\left(\\frac{d}{da} (a-1)_k\\right) \\frac{1}{z^k}\n       \\end{array}\n       \\f]\n     *\/\n    template<typename T>\n    T grad_reg_inc_gamma(T a, T z, T g, T dig, double precision = 1e-6,\n        int max_steps = 1e5) {\n      using std::domain_error;\n      using std::exp;\n      using std::fabs;\n      using std::log;\n\n      T l = log(z);\n      if (z >= a && z >= 8) {\n        \/\/ asymptotic expansion http:\/\/dlmf.nist.gov\/8.11#E2\n        T S = 0;\n        T a_minus_one_minus_k = a - 1;\n        T fac = a_minus_one_minus_k;  \/\/ falling_factorial(a-1, k)\n        T dfac = 1;   \/\/ d\/da[falling_factorial(a-1, k)]\n        T zpow = z;   \/\/ z ** k\n        T delta = dfac \/ zpow;\n\n        for (int k = 1; k < 10; ++k) {\n          a_minus_one_minus_k -= 1;\n\n          S += delta;\n\n          zpow *= z;\n          dfac = a_minus_one_minus_k * dfac + fac;\n          fac *= a_minus_one_minus_k;\n          delta = dfac \/ zpow;\n\n          if (is_inf(delta))\n            stan::math::domain_error(\"grad_reg_inc_gamma\",\n                                     \"is not converging\", \"\", \"\");\n        }\n\n        return gamma_q(a, z) * (l - dig) + exp(-z + (a - 1) * l) * S \/ g;\n      } else {\n        \/\/ gradient of series expansion http:\/\/dlmf.nist.gov\/8.7#E3\n\n        T S = 0;\n        T log_s = 0.0;\n        double s_sign = 1.0;\n        int k = 0;\n        T log_z = log(z);\n        T log_delta = log_s - 2 * log(a);\n        while (exp(log_delta) > precision) {\n          S += s_sign * exp(log_delta);\n          ++k;\n          log_s += log_z - log(k);\n          s_sign = -1.0 * s_sign;\n          log_delta = log_s - 2 * log(k + a);\n          if (k >= max_steps)\n            stan::math::domain_error(\"grad_reg_inc_gamma\",\n              \"k (internal counter)\",\n              max_steps, \"exceeded \",\n              \" iterations, gamma function gradient did not converge.\");\n          if (is_inf(log_delta))\n            stan::math::domain_error(\"grad_reg_inc_gamma\",\n                                     \"is not converging\", \"\", \"\");\n        }\n        return gamma_p(a, z) * ( dig - l ) + exp( a * l ) * S \/ g;\n      }\n    }\n\n  }\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"SMPMonteCarloElf.h\"\n#include \"OthelloUtil.h\"\n#include <functional>\n#include <random>\n#include <iostream>\n#include <omp.h>\n#include <chrono>\n#include <cassert>\n#include <ratio>\n#include <vector>\n#include <atomic>\n\nusing namespace std;\n\nconst int WORKSTEALING_BLOCKSIZE = 10;\n\nvoid expand(const OthelloState& rootState, vector<OthelloState>& childStates, vector<OthelloResult>& childResults)\n{\n    auto moves = rootState.getPossibleMoves();\n    for (const auto& move : moves)\n    {\n        childStates.emplace_back(rootState, move);\n        childResults.emplace_back(OthelloResult{ (size_t)move.x, (size_t)move.y, 0, 0});\n    }   \n}\n\nvoid rollout(OthelloState& state, RandomGenerator generator)\n{\n    size_t passCounter = 0;\n    while (passCounter < 2)\n    {\n        auto possibleMoves = state.getPossibleMoves();\n        if (possibleMoves.size() > 0)\n        {\n            OthelloMove move = possibleMoves[generator(possibleMoves.size())];\n            state.doMove(move);\n            passCounter = 0;\n        }\n        else\n        {\n            ++passCounter;\n        }\n    }\n}\n\nOthelloResult SMPMonteCarloElf::getBestMoveFor(OthelloState& rootState, size_t reiterations, size_t nodeId, size_t commonSeed)\n{\n    size_t threadCount = omp_get_max_threads();\n    vector<mt19937> engines;\n    for (size_t i = 0; i < threadCount; ++i)\n    {\n        engines.emplace_back(OthelloHelper::generateUniqueSeed(nodeId, i, commonSeed));\n    }\n\n    auto generator = [&engines](size_t limit){ \n        uniform_int_distribution<size_t> distribution(0, limit - 1);\n        return distribution(engines[omp_get_thread_num()]);\n    };    \n\n\n    vector<OthelloResult> childResults;\n    vector<OthelloState> childStates;\n\n    expand(rootState, childStates, childResults);\n\n    \/\/ no parallel for to enable a form of workstealing \n    \/\/ threads do not have to execute the same number of cycles but instead \n    #pragma omp parallel for schedule(dynamic, WORKSTEALING_BLOCKSIZE) shared(childResults) \n    for(size_t i=0; i<reiterations; ++i)\n    {\n        \/\/ select randomly\n        size_t selectedIndex = generator(childStates.size());\n        OthelloState selectedState = childStates[selectedIndex];\n\n        \/\/ rollout\n        rollout(selectedState, generator);\n\n        \/\/ backpropagate\n        #pragma omp critical(selectedIndex)\n        {\n            childResults[selectedIndex].visits++;\n            if (selectedState.hasWon(selectedState.getCurrentEnemy()))\n                childResults[selectedIndex].wins++;\n        }\n    }\n\n    OthelloResult* bestResult = nullptr;\n    for (auto& result : childResults)\n    {\n        if (bestResult == nullptr || bestResult->successRate() < result.successRate())\n        {\n            bestResult = &result;\n        }\n    }\n    return *bestResult;\n}<commit_msg>replaced random-generator-vector with omp-private (thread-local) generators<commit_after>#include \"SMPMonteCarloElf.h\"\n#include \"OthelloUtil.h\"\n#include <functional>\n#include <random>\n#include <iostream>\n#include <omp.h>\n#include <chrono>\n#include <cassert>\n#include <ratio>\n#include <vector>\n#include <atomic>\n\nusing namespace std;\n\nconst int WORKSTEALING_BLOCKSIZE = 10;\n\nvoid expand(const OthelloState& rootState, vector<OthelloState>& childStates, vector<OthelloResult>& childResults)\n{\n    auto moves = rootState.getPossibleMoves();\n    for (const auto& move : moves)\n    {\n        childStates.emplace_back(rootState, move);\n        childResults.emplace_back(OthelloResult{ (size_t)move.x, (size_t)move.y, 0, 0});\n    }   \n}\n\nvoid rollout(OthelloState& state, RandomGenerator generator)\n{\n    size_t passCounter = 0;\n    while (passCounter < 2)\n    {\n        auto possibleMoves = state.getPossibleMoves();\n        if (possibleMoves.size() > 0)\n        {\n            OthelloMove move = possibleMoves[generator(possibleMoves.size())];\n            state.doMove(move);\n            passCounter = 0;\n        }\n        else\n        {\n            ++passCounter;\n        }\n    }\n}\n\nOthelloResult SMPMonteCarloElf::getBestMoveFor(OthelloState& rootState, size_t reiterations, size_t nodeId, size_t commonSeed)\n{\n    vector<OthelloResult> childResults;\n    vector<OthelloState> childStates;\n\n    expand(rootState, childStates, childResults);\n\n    #pragma omp parallel\n    {\n        \/\/ thread-private random number generator\n        mt19937 engine(OthelloHelper::generateUniqueSeed(nodeId, omp_get_thread_num(), commonSeed));\n\n        auto generator = [&engine](size_t limit){ \n            uniform_int_distribution<size_t> distribution(0, limit - 1);\n            return distribution(engine);\n        };\n\n        #pragma omp for schedule(dynamic, WORKSTEALING_BLOCKSIZE)\n        for(size_t i=0; i<reiterations; ++i)\n        {\n            \/\/ select randomly\n            size_t selectedIndex = generator(childStates.size());\n            OthelloState selectedState = childStates[selectedIndex];\n\n            \/\/ rollout\n            rollout(selectedState, generator);\n\n            \/\/ backpropagate\n            #pragma omp critical(selectedIndex)\n            {\n                childResults[selectedIndex].visits++;\n                if (selectedState.hasWon(selectedState.getCurrentEnemy()))\n                    childResults[selectedIndex].wins++;\n            }\n        }\n    }\n\n    OthelloResult* bestResult = nullptr;\n    for (auto& result : childResults)\n    {\n        if (bestResult == nullptr || bestResult->successRate() < result.successRate())\n        {\n            bestResult = &result;\n        }\n    }\n    return *bestResult;\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2006-2016  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 \"streamingalgorithm.h\"\nusing namespace std;\n\nnamespace essentia {\nnamespace streaming {\n\n\nconst string Algorithm::processingMode = \"Streaming\";\n\n\/\/ here we check the types as well\nvoid connect(SourceBase& source, SinkBase& sink) {\n  try {\n    \/\/ NB: source needs to connect to sink first to have a ReaderID as soon as possible.\n    \/\/     this is a requirement for ProxyConnectors\n    E_DEBUG(EConnectors, \"Connecting \" << source.fullName() << \" to \" << sink.fullName());\n    source.connect(sink);\n    sink.connect(source);\n  }\n  catch (EssentiaException& e) {\n    std::ostringstream msg;\n    msg << \"While connecting \" << source.fullName()\n        << \" to \" << sink.fullName() << \":\\n\"\n        << e.what();\n    throw EssentiaException(msg);\n  }\n}\n\nvoid connect(Algorithm* sourceAlgo, const std::string& sourcePort,\n             Algorithm* sinkAlgo, const std::string& sinkPort) {\n  try {\n    SourceBase& source = sourceAlgo->output(sourcePort);\n    SinkBase& sink = sinkAlgo->input(sinkPort);\n\n    connect(source, sink);\n  }\n  catch (EssentiaException& e) {\n    std::ostringstream msg;\n    msg << \"While connecting \" << sourceAlgo->name() << \"::\" << sourcePort\n        << \" to \" << sinkAlgo->name() << \"::\" << sinkPort << \":\\n\"\n        << e.what();\n    throw EssentiaException(msg);\n  }\n}\n\n\nvoid disconnect(SourceBase& source, SinkBase& sink) {\n  try {\n    E_DEBUG(EConnectors, \"Disconnecting \" << source.fullName() << \" from \" << sink.fullName());\n\n    source.disconnect(sink);\n    sink.disconnect(source);\n  }\n  catch (const EssentiaException& e) {\n    std::ostringstream msg;\n    msg << \"While disconnecting \" << source.fullName()\n        << \" (output) from \" << sink.fullName() << \" (input):\\n\"\n        << e.what();\n    throw EssentiaException(msg);\n  }\n}\n\n\nvoid Algorithm::declareInput(SinkBase& sink, const std::string& name,\n                             const std::string& desc) {\n  sink.setName(name);\n  sink.setParent(this);\n\n  _inputs.insert(name, &sink);\n  inputDescription.insert(name, desc);\n}\n\nvoid Algorithm::declareInput(SinkBase& sink, int n,\n                             const std::string& name, const std::string& desc) {\n  declareInput(sink, n, n, name, desc);\n}\n\nvoid Algorithm::declareInput(SinkBase& sink,\n                             int acquireSize,\n                             int releaseSize,\n                             const std::string& name,\n                             const std::string& desc) {\n  sink.setAcquireSize(acquireSize);\n  sink.setReleaseSize(releaseSize);\n  declareInput(sink, name, desc);\n}\n\nvoid Algorithm::declareOutput(SourceBase& source, const std::string& name, const std::string& desc) {\n  source.setName(name);\n  source.setParent(this);\n\n  _outputs.insert(name, &source);\n  outputDescription.insert(name, desc);\n}\n\nvoid Algorithm::declareOutput(SourceBase& source, int n, const std::string& name, const std::string& desc) {\n  declareOutput(source, n, n, name, desc);\n}\n\nvoid Algorithm::declareOutput(SourceBase& source,\n                              int acquireSize,\n                              int releaseSize,\n                              const std::string& name,\n                              const std::string& desc) {\n  source.setAcquireSize(acquireSize);\n  source.setReleaseSize(releaseSize);\n  declareOutput(source, name, desc);\n}\n\n\nSinkBase& Algorithm::input(const std::string& name) {\n  try {\n    return *_inputs[name];\n  }\n  catch (EssentiaException&) {\n    std::ostringstream msg;\n    msg << \"Couldn't find '\" << name << \"' in \" << this->name() << \"::inputs.\";\n    msg << \" Available input names are:\";\n    std::vector<std::string> availableInputs = _inputs.keys();\n    for (uint i=0; i<availableInputs.size(); i++) {\n      msg << ' ' << availableInputs[i];\n    }\n    throw EssentiaException(msg);\n  }\n}\n\nSourceBase& Algorithm::output(const std::string& name) {\n  try {\n    return *_outputs[name];\n  }\n  catch (EssentiaException&) {\n    std::ostringstream msg;\n    msg << \"Couldn't find '\" << name << \"' in \" << this->name() << \"::outputs.\";\n    msg << \" Available output names are:\";\n    std::vector<std::string> availableOutputs = _outputs.keys();\n    for (uint i=0; i<availableOutputs.size(); i++) {\n      msg << ' ' << availableOutputs[i];\n    }\n    throw EssentiaException(msg);\n  }\n}\n\nSinkBase& Algorithm::input(int idx) {\n  if ((idx < 0) || (idx >= _inputs.size())) {\n    ostringstream msg;\n    msg << \"Cannot access input number \" << idx << \" because \" << this->name() << \" only has \" << _inputs.size() << \" inputs.\";\n    throw EssentiaException(msg);\n  }\n\n  return *_inputs[idx].second;\n}\n\nSourceBase& Algorithm::output(int idx) {\n  if ((idx < 0) || (idx >= _outputs.size())) {\n    ostringstream msg;\n    msg << \"Cannot access output number \" << idx << \" because \" << this->name() << \" only has \" << _outputs.size() << \" outputs.\";\n    throw EssentiaException(msg);\n  }\n\n  return *_outputs[idx].second;\n}\n\n\nvoid Algorithm::disconnectAll() {\n  \/\/ disconnect all outputs\n  for (OutputMap::const_iterator output = _outputs.begin();\n       output != _outputs.end();\n       ++output) {\n    vector<SinkBase*>& sinks = output->second->sinks();\n\n    for (vector<SinkBase*>::iterator it = sinks.begin(); it != sinks.end(); ++it) {\n      disconnect(*output->second, **it);\n    }\n  }\n\n  \/\/ disconnect all inputs\n  for (InputMap::const_iterator input = _inputs.begin();\n       input != _inputs.end();\n       ++input) {\n    SourceBase* source = input->second->source();\n    if (source) disconnect(*source, *input->second);\n  }\n}\n\n\n\/\/ returns true if it succeeded, otherwise returns false (also frees the\n\/\/ resources it may have managed to acquire.\nAlgorithmStatus Algorithm::acquireData() {\n  \/\/ Note: check for inputs first, so we're sure we're done and no need to reschedule\n  \/\/ the algorithm because of no output\n  for (InputMap::const_iterator input = _inputs.begin(); input!=_inputs.end(); ++input) {\n    if (!input->second->acquire()) {\n      return NO_INPUT;\n    }\n  }\n\n  for (OutputMap::const_iterator output = _outputs.begin(); output!=_outputs.end(); ++output) {\n    if (!output->second->acquire()) {\n      return NO_OUTPUT;\n    }\n  }\n\n\n  return OK;\n}\n\nvoid Algorithm::releaseData() {\n  for (OutputMap::const_iterator output = _outputs.begin(); output!=_outputs.end(); ++output) {\n    output->second->release();\n  }\n\n  for (InputMap::const_iterator input = _inputs.begin(); input!=_inputs.end(); ++input) {\n    input->second->release();\n  }\n}\n\n\nvoid Algorithm::reset() {\n  E_DEBUG(EAlgorithm, \"Streaming: \" << name() << \"::reset()\");\n  shouldStop(false);\n\n  \/\/ reset the buffers of the sources of this algorithm\n  for (OutputMap::iterator it = _outputs.begin();\n       it != _outputs.end();\n       ++it) {\n    E_DEBUG(EAlgorithm, \"resetting buffer for \" << it->second->fullName());\n    it->second->reset();\n  }\n\n  \/\/ Note: we don't need to reset the inputs because they share a Multi-rate\n  \/\/ buffer with the outputs\n  E_DEBUG(EAlgorithm, \"Streaming: \" << name() << \"::reset() ok!\");\n}\n\n\nvoid Algorithm::shouldStop(bool stop) {\n#if DEBUGGING_ENABLED\n  std::ostringstream msg;\n  msg << \"Streaming: \" << name() << \"::shouldStop[\" << nProcess << \"] = \"\n      << (stop ? \"true\" : \"false\");\n  E_DEBUG(EAlgorithm, msg.str());\n#else\n  E_DEBUG(EAlgorithm, \"Streaming: \" << name() << \"::shouldStop = \" << (stop?\"true\":\"false\"));\n#endif\n  _shouldStop = stop;\n}\n\n\n\n} \/\/ namespace streaming\n} \/\/ namespace essentia\n<commit_msg>Improve error message when connecting sources\/sinks<commit_after>\/*\n * Copyright (C) 2006-2016  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 \"streamingalgorithm.h\"\nusing namespace std;\n\nnamespace essentia {\nnamespace streaming {\n\n\nconst string Algorithm::processingMode = \"Streaming\";\n\n\/\/ here we check the types as well\nvoid connect(SourceBase& source, SinkBase& sink) {\n  try {\n    \/\/ NB: source needs to connect to sink first to have a ReaderID as soon as possible.\n    \/\/     this is a requirement for ProxyConnectors\n    E_DEBUG(EConnectors, \"Connecting \" << source.fullName() << \" to \" << sink.fullName());\n    sink.connect(source);\n    source.connect(sink);\n  }\n  catch (EssentiaException& e) {\n    std::ostringstream msg;\n    msg << \"While connecting \" << source.fullName()\n        << \" to \" << sink.fullName() << \":\\n\"\n        << e.what();\n    throw EssentiaException(msg);\n  }\n}\n\nvoid connect(Algorithm* sourceAlgo, const std::string& sourcePort,\n             Algorithm* sinkAlgo, const std::string& sinkPort) {\n  try {\n    SourceBase& source = sourceAlgo->output(sourcePort);\n    SinkBase& sink = sinkAlgo->input(sinkPort);\n\n    connect(source, sink);\n  }\n  catch (EssentiaException& e) {\n    std::ostringstream msg;\n    msg << \"While connecting \" << sourceAlgo->name() << \"::\" << sourcePort\n        << \" to \" << sinkAlgo->name() << \"::\" << sinkPort << \":\\n\"\n        << e.what();\n    throw EssentiaException(msg);\n  }\n}\n\n\nvoid disconnect(SourceBase& source, SinkBase& sink) {\n  try {\n    E_DEBUG(EConnectors, \"Disconnecting \" << source.fullName() << \" from \" << sink.fullName());\n\n    source.disconnect(sink);\n    sink.disconnect(source);\n  }\n  catch (const EssentiaException& e) {\n    std::ostringstream msg;\n    msg << \"While disconnecting \" << source.fullName()\n        << \" (output) from \" << sink.fullName() << \" (input):\\n\"\n        << e.what();\n    throw EssentiaException(msg);\n  }\n}\n\n\nvoid Algorithm::declareInput(SinkBase& sink, const std::string& name,\n                             const std::string& desc) {\n  sink.setName(name);\n  sink.setParent(this);\n\n  _inputs.insert(name, &sink);\n  inputDescription.insert(name, desc);\n}\n\nvoid Algorithm::declareInput(SinkBase& sink, int n,\n                             const std::string& name, const std::string& desc) {\n  declareInput(sink, n, n, name, desc);\n}\n\nvoid Algorithm::declareInput(SinkBase& sink,\n                             int acquireSize,\n                             int releaseSize,\n                             const std::string& name,\n                             const std::string& desc) {\n  sink.setAcquireSize(acquireSize);\n  sink.setReleaseSize(releaseSize);\n  declareInput(sink, name, desc);\n}\n\nvoid Algorithm::declareOutput(SourceBase& source, const std::string& name, const std::string& desc) {\n  source.setName(name);\n  source.setParent(this);\n\n  _outputs.insert(name, &source);\n  outputDescription.insert(name, desc);\n}\n\nvoid Algorithm::declareOutput(SourceBase& source, int n, const std::string& name, const std::string& desc) {\n  declareOutput(source, n, n, name, desc);\n}\n\nvoid Algorithm::declareOutput(SourceBase& source,\n                              int acquireSize,\n                              int releaseSize,\n                              const std::string& name,\n                              const std::string& desc) {\n  source.setAcquireSize(acquireSize);\n  source.setReleaseSize(releaseSize);\n  declareOutput(source, name, desc);\n}\n\n\nSinkBase& Algorithm::input(const std::string& name) {\n  try {\n    return *_inputs[name];\n  }\n  catch (EssentiaException&) {\n    std::ostringstream msg;\n    msg << \"Couldn't find '\" << name << \"' in \" << this->name() << \"::inputs.\";\n    msg << \" Available input names are:\";\n    std::vector<std::string> availableInputs = _inputs.keys();\n    for (uint i=0; i<availableInputs.size(); i++) {\n      msg << ' ' << availableInputs[i];\n    }\n    throw EssentiaException(msg);\n  }\n}\n\nSourceBase& Algorithm::output(const std::string& name) {\n  try {\n    return *_outputs[name];\n  }\n  catch (EssentiaException&) {\n    std::ostringstream msg;\n    msg << \"Couldn't find '\" << name << \"' in \" << this->name() << \"::outputs.\";\n    msg << \" Available output names are:\";\n    std::vector<std::string> availableOutputs = _outputs.keys();\n    for (uint i=0; i<availableOutputs.size(); i++) {\n      msg << ' ' << availableOutputs[i];\n    }\n    throw EssentiaException(msg);\n  }\n}\n\nSinkBase& Algorithm::input(int idx) {\n  if ((idx < 0) || (idx >= _inputs.size())) {\n    ostringstream msg;\n    msg << \"Cannot access input number \" << idx << \" because \" << this->name() << \" only has \" << _inputs.size() << \" inputs.\";\n    throw EssentiaException(msg);\n  }\n\n  return *_inputs[idx].second;\n}\n\nSourceBase& Algorithm::output(int idx) {\n  if ((idx < 0) || (idx >= _outputs.size())) {\n    ostringstream msg;\n    msg << \"Cannot access output number \" << idx << \" because \" << this->name() << \" only has \" << _outputs.size() << \" outputs.\";\n    throw EssentiaException(msg);\n  }\n\n  return *_outputs[idx].second;\n}\n\n\nvoid Algorithm::disconnectAll() {\n  \/\/ disconnect all outputs\n  for (OutputMap::const_iterator output = _outputs.begin();\n       output != _outputs.end();\n       ++output) {\n    vector<SinkBase*>& sinks = output->second->sinks();\n\n    for (vector<SinkBase*>::iterator it = sinks.begin(); it != sinks.end(); ++it) {\n      disconnect(*output->second, **it);\n    }\n  }\n\n  \/\/ disconnect all inputs\n  for (InputMap::const_iterator input = _inputs.begin();\n       input != _inputs.end();\n       ++input) {\n    SourceBase* source = input->second->source();\n    if (source) disconnect(*source, *input->second);\n  }\n}\n\n\n\/\/ returns true if it succeeded, otherwise returns false (also frees the\n\/\/ resources it may have managed to acquire.\nAlgorithmStatus Algorithm::acquireData() {\n  \/\/ Note: check for inputs first, so we're sure we're done and no need to reschedule\n  \/\/ the algorithm because of no output\n  for (InputMap::const_iterator input = _inputs.begin(); input!=_inputs.end(); ++input) {\n    if (!input->second->acquire()) {\n      return NO_INPUT;\n    }\n  }\n\n  for (OutputMap::const_iterator output = _outputs.begin(); output!=_outputs.end(); ++output) {\n    if (!output->second->acquire()) {\n      return NO_OUTPUT;\n    }\n  }\n\n\n  return OK;\n}\n\nvoid Algorithm::releaseData() {\n  for (OutputMap::const_iterator output = _outputs.begin(); output!=_outputs.end(); ++output) {\n    output->second->release();\n  }\n\n  for (InputMap::const_iterator input = _inputs.begin(); input!=_inputs.end(); ++input) {\n    input->second->release();\n  }\n}\n\n\nvoid Algorithm::reset() {\n  E_DEBUG(EAlgorithm, \"Streaming: \" << name() << \"::reset()\");\n  shouldStop(false);\n\n  \/\/ reset the buffers of the sources of this algorithm\n  for (OutputMap::iterator it = _outputs.begin();\n       it != _outputs.end();\n       ++it) {\n    E_DEBUG(EAlgorithm, \"resetting buffer for \" << it->second->fullName());\n    it->second->reset();\n  }\n\n  \/\/ Note: we don't need to reset the inputs because they share a Multi-rate\n  \/\/ buffer with the outputs\n  E_DEBUG(EAlgorithm, \"Streaming: \" << name() << \"::reset() ok!\");\n}\n\n\nvoid Algorithm::shouldStop(bool stop) {\n#if DEBUGGING_ENABLED\n  std::ostringstream msg;\n  msg << \"Streaming: \" << name() << \"::shouldStop[\" << nProcess << \"] = \"\n      << (stop ? \"true\" : \"false\");\n  E_DEBUG(EAlgorithm, msg.str());\n#else\n  E_DEBUG(EAlgorithm, \"Streaming: \" << name() << \"::shouldStop = \" << (stop?\"true\":\"false\"));\n#endif\n  _shouldStop = stop;\n}\n\n\n\n} \/\/ namespace streaming\n} \/\/ namespace essentia\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 of the ESD class\n\/\/   This is the class to deal with during the phisical analysis of data\n\/\/\n\/\/      Origin: Iouri Belikov, CERN, Jouri.Belikov@cern.ch\n\/\/-----------------------------------------------------------------\n\n#include \"AliESD.h\"\n\nClassImp(AliESD)\n\n\/\/_______________________________________________________________________\nAliESD::AliESD():\n  fEventNumber(0),\n  fRunNumber(0),\n  fTrigger(0),\n  fRecoVersion(0),\n  fMagneticField(0),\n  fTracks(\"AliESDtrack\",15000),\n  fCaloTracks(\"AliESDCaloTrack\",500),\n  fMuonTracks(\"AliESDMuonTrack\",30),\n  fV0s(\"AliESDv0\",200),\n  fCascades(\"AliESDcascade\",20)\n{\n  Int_t i;\n  for (i=0; i<3; i++) fVtx[i]=0.;\n  for (i=0; i<6; i++) fCovVtx[i]=0.;\n}\n\nvoid AliESD::SetVertex(const Double_t *vtx, const Double_t *cvtx) {\n  \/\/Save the primary vertex position\n  Int_t i;\n  for (i=0; i<3; i++) fVtx[i]=vtx[i];\n  if (cvtx)\n  for (i=0; i<6; i++) fCovVtx[i]=cvtx[i];   \n}\n\nvoid AliESD::GetVertex(Double_t *vtx, Double_t *cvtx) const {\n  \/\/Get the primary vertex position\n  Int_t i;\n  for (i=0; i<3; i++) vtx[i]=fVtx[i];\n  if (cvtx)\n  for (i=0; i<6; i++) cvtx[i]=fCovVtx[i];   \n}\n\nvoid AliESD::Print(Option_t *) const {\n  \/\/Print header information of the event\n  Info(\"Print\",\"ESD run information\");\n  printf(\"Event # %d Run # %d Trigger %ld Magnetic field %f \\n\",\n\t GetEventNumber(),\n\t GetRunNumber(),\n\t GetTrigger(),\n\t GetMagneticField() );\n  printf(\"Event from reconstruction version %d \\n\",fRecoVersion);\n  printf(\"Number of tracks: \\n\");\n  printf(\"charged %d\\n\",GetNumberOfTracks());\n  printf(\"                 calo      %d\\n\", GetNumberOfCaloTracks());\n  printf(\"                 muon      %d\\n\", GetNumberOfMuonTracks());\n  printf(\"                 v0        %d\\n\", GetNumberOfV0s());\n  printf(\"                 cascades %d\\n)\", GetNumberOfCascades());\n}\n<commit_msg>Change in Print (Y.Schutz)<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 of the ESD class\n\/\/   This is the class to deal with during the phisical analysis of data\n\/\/\n\/\/      Origin: Iouri Belikov, CERN, Jouri.Belikov@cern.ch\n\/\/-----------------------------------------------------------------\n\n#include \"AliESD.h\"\n\nClassImp(AliESD)\n\n\/\/_______________________________________________________________________\nAliESD::AliESD():\n  fEventNumber(0),\n  fRunNumber(0),\n  fTrigger(0),\n  fRecoVersion(0),\n  fMagneticField(0),\n  fTracks(\"AliESDtrack\",15000),\n  fCaloTracks(\"AliESDCaloTrack\",500),\n  fMuonTracks(\"AliESDMuonTrack\",30),\n  fV0s(\"AliESDv0\",200),\n  fCascades(\"AliESDcascade\",20)\n{\n  Int_t i;\n  for (i=0; i<3; i++) fVtx[i]=0.;\n  for (i=0; i<6; i++) fCovVtx[i]=0.;\n}\n\nvoid AliESD::SetVertex(const Double_t *vtx, const Double_t *cvtx) {\n  \/\/Save the primary vertex position\n  Int_t i;\n  for (i=0; i<3; i++) fVtx[i]=vtx[i];\n  if (cvtx)\n  for (i=0; i<6; i++) fCovVtx[i]=cvtx[i];   \n}\n\nvoid AliESD::GetVertex(Double_t *vtx, Double_t *cvtx) const {\n  \/\/Get the primary vertex position\n  Int_t i;\n  for (i=0; i<3; i++) vtx[i]=fVtx[i];\n  if (cvtx)\n  for (i=0; i<6; i++) cvtx[i]=fCovVtx[i];   \n}\n\nvoid AliESD::Print(Option_t *) const {\n  \/\/Print header information of the event\n  Info(\"Print\",\"ESD run information\");\n  printf(\"Event # %d Run # %d Trigger %ld Magnetic field %f \\n\",\n\t GetEventNumber(),\n\t GetRunNumber(),\n\t GetTrigger(),\n\t GetMagneticField() );\n  printf(\"Event from reconstruction version %d \\n\",fRecoVersion);\n  printf(\"Number of tracks: \\n\");\n  printf(\"                 charged   %d\\n\",GetNumberOfTracks());\n  printf(\"                 calo      %d\\n\", GetNumberOfCaloTracks());\n  printf(\"                 muon      %d\\n\", GetNumberOfMuonTracks());\n  printf(\"                 v0        %d\\n\", GetNumberOfV0s());\n  printf(\"                 cascades  %d\\n)\", GetNumberOfCascades());\n}\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 <ostream>\n#include <unordered_set>\n#include <vector>\n\n#include \"elang\/optimizer\/scheduler\/scheduler.h\"\n\n#include \"base\/logging.h\"\n#include \"base\/strings\/stringprintf.h\"\n#include \"elang\/optimizer\/depth_first_traversal.h\"\n#include \"elang\/optimizer\/formatters\/graphviz_formatter.h\"\n#include \"elang\/optimizer\/formatters\/text_formatter.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\/block_layouter.h\"\n#include \"elang\/optimizer\/scheduler\/cfg_builder.h\"\n#include \"elang\/optimizer\/scheduler\/formatted_schedule.h\"\n#include \"elang\/optimizer\/scheduler\/schedule.h\"\n#include \"elang\/optimizer\/scheduler\/schedule_editor.h\"\n#include \"elang\/optimizer\/scheduler\/static_predictor.h\"\n#include \"elang\/optimizer\/scheduler\/visual_schedule.h\"\n\nnamespace elang {\nnamespace optimizer {\n\nnamespace {\n\nbool IsPinned(const Node* node) {\n  if (node->IsControl() || node->IsEffect())\n    return true;\n  \/\/ All nodes have at least one input except for |EntryNode|.\n  if (node->input(0)->IsControl())\n    return true;\n  return node->opcode() == Opcode::Phi || node->opcode() == Opcode::EffectPhi;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ EarlyScheduler\n\/\/\nclass EarlyScheduler final : public NodeVisitor, public ScheduleEditor::User {\n public:\n  explicit EarlyScheduler(ScheduleEditor* editor);\n  ~EarlyScheduler() final = default;\n\n  void Run();\n\n private:\n  void DoDefaultVisit(Node* node) final;\n\n  DISALLOW_COPY_AND_ASSIGN(EarlyScheduler);\n};\n\nEarlyScheduler::EarlyScheduler(ScheduleEditor* editor)\n    : ScheduleEditor::User(editor) {\n}\n\nvoid EarlyScheduler::Run() {\n  DepthFirstTraversal<OnInputEdge, const Function> walker;\n  walker.Traverse(function(), this);\n}\n\n\/\/ NodeVisitor implementation\nvoid EarlyScheduler::DoDefaultVisit(Node* node) {\n  if (node->IsLiteral() || BlockOf(node))\n    return;\n  \/\/ Place |node| into deepest block in dominator tree.\n  BasicBlock* block = nullptr;\n  for (auto const input : node->inputs()) {\n    if (input->IsLiteral())\n      continue;\n    auto input_block = BlockOf(input);\n    DCHECK(input_block) << *input << \" in \" << *node;\n    if (!block) {\n      block = input_block;\n      continue;\n    }\n    if (DepthOf(block) < DepthOf(input_block))\n      block = input_block;\n  }\n  DCHECK(block) << *node;\n  editor()->SetBlockOf(node, block);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ LateScheduler\n\/\/\nclass LateScheduler final : public NodeVisitor, public ScheduleEditor::User {\n public:\n  explicit LateScheduler(ScheduleEditor* editor);\n  ~LateScheduler() final = default;\n\n  void Run();\n\n private:\n  void DoDefaultVisit(Node* node) final;\n\n  DISALLOW_COPY_AND_ASSIGN(LateScheduler);\n};\n\nLateScheduler::LateScheduler(ScheduleEditor* editor)\n    : ScheduleEditor::User(editor) {\n}\n\nvoid LateScheduler::Run() {\n  DepthFirstTraversal<OnUseEdge, const Function> walker;\n  walker.Traverse(function(), this);\n}\n\n\/\/ NodeVisitor implementation\nvoid LateScheduler::DoDefaultVisit(Node* node) {\n  if (node->IsLiteral())\n    return;\n  if (IsPinned(node)) {\n    auto const block = BlockOf(node);\n    if (!block) {\n      DCHECK(node->is<PhiNode>() || node->is<EffectPhiNode>());\n      return;\n    }\n    editor()->AppendNode(block, node);\n    return;\n  }\n  \/\/ Find Least Common Ancestor of users of |node|.\n  BasicBlock* lca_block = nullptr;\n  for (auto const edge : node->use_edges()) {\n    if (auto const phi = edge->from()->as<PhiNode>()) {\n      \/\/ This loop could be removed (and the code made asymptotically faster)\n      \/\/ by using complex data structures. In practice it is never a bottleneck.\n      for (auto phi_operand : phi->phi_inputs()) {\n        if (phi_operand->value() != node)\n          continue;\n        lca_block =\n            CommonAncestorOf(lca_block, BlockOf(phi_operand->control()));\n      }\n      continue;\n    }\n    auto const use_block = BlockOf(edge->to());\n    if (!lca_block) {\n      lca_block = use_block;\n      continue;\n    }\n    lca_block = CommonAncestorOf(lca_block, use_block);\n  }\n  DCHECK(lca_block) << *node;\n  auto best_block = lca_block;\n  auto const block = BlockOf(node);\n  for (auto runner = lca_block; runner != block; runner = DominatorOf(runner)) {\n    if (LoopDepthOf(best_block) <= LoopDepthOf(runner))\n      continue;\n    best_block = runner;\n  }\n  \/\/ TODO(eval1749) Split |node| if it is partially dead.\n  editor()->SetBlockOf(node, best_block);\n  editor()->AppendNode(best_block, node);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ NodePlacer\n\/\/\nclass NodePlacer final : public api::Pass, public ScheduleEditor::User {\n public:\n  explicit NodePlacer(api::PassObserver* observer,\n                      ScheduleEditor* editor,\n                      const std::vector<BasicBlock*>& blocks);\n  ~NodePlacer() = default;\n\n  void Run();\n\n private:\n  bool IsUsedInBlock(Node* node, BasicBlock* block) const;\n  void ScheduleInBlock(BasicBlock* block);\n\n  \/\/ api::Pass\n  base::StringPiece name() const final;\n\n  const std::vector<BasicBlock*>& blocks_;\n  std::vector<Node*> nodes_;\n\n  DISALLOW_COPY_AND_ASSIGN(NodePlacer);\n};\n\nNodePlacer::NodePlacer(api::PassObserver* observer,\n                       ScheduleEditor* editor,\n                       const std::vector<BasicBlock*>& blocks)\n    : Pass(observer), ScheduleEditor::User(editor), blocks_(blocks) {\n  nodes_.reserve(function()->max_node_id());\n}\n\nbool NodePlacer::IsUsedInBlock(Node* node, BasicBlock* block) const {\n  for (auto const edge : node->use_edges()) {\n    auto const user = edge->from();\n    if (BlockOf(user) == block)\n      return true;\n  }\n  return false;\n}\n\nvoid NodePlacer::Run() {\n  RunScope scope(this);\n  if (scope.IsStop())\n    return;\n  for (auto const block : blocks_)\n    ScheduleInBlock(block);\n  editor()->DidPlaceNodes(nodes_);\n}\n\nvoid NodePlacer::ScheduleInBlock(BasicBlock* block) {\n  std::unordered_set<Node*> placed;\n  WorkList<Node> pending_list;\n  auto end_node = static_cast<Node*>(nullptr);\n  auto first = true;\n  for (auto const node : block->nodes()) {\n    if (!first) {\n      if (node->IsBlockEnd()) {\n        DCHECK(!end_node);\n        end_node = node;\n        continue;\n      }\n      pending_list.Push(node);\n      continue;\n    }\n    first = false;\n    DCHECK(node->IsBlockStart());\n    nodes_.push_back(node);\n    placed.insert(node);\n    if (auto const phi_owner = node->as<PhiOwnerNode>()) {\n      if (auto const effect_phi = phi_owner->effect_phi()) {\n        nodes_.push_back(effect_phi);\n        placed.insert(effect_phi);\n      }\n      for (auto const phi : phi_owner->phi_nodes()) {\n        nodes_.push_back(phi);\n        placed.insert(phi);\n      }\n    }\n  }\n  DCHECK(end_node);\n\n  while (!pending_list.empty()) {\n    WorkList<Node> work_list;\n    while (!pending_list.empty())\n      work_list.Push(pending_list.Pop());\n    while (!work_list.empty()) {\n      auto const node = work_list.Pop();\n      for (auto const input : node->inputs()) {\n        if (input->IsLiteral() || BlockOf(input) != block ||\n            placed.count(input)) {\n          continue;\n        }\n        pending_list.Push(node);\n        break;\n      }\n      if (!pending_list.Contains(node)) {\n        nodes_.push_back(node);\n        placed.insert(node);\n      }\n    }\n  }\n\n  nodes_.push_back(end_node);\n}\n\n\/\/ api::Pass\nbase::StringPiece NodePlacer::name() const {\n  return \"node_placer\";\n}\n\n}  \/\/ namespace\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Scheduler\n\/\/\nScheduler::Scheduler(api::PassObserver* observer, Schedule* schedule)\n    : Pass(observer), editor_(new ScheduleEditor(schedule)) {\n  DCHECK(schedule);\n}\n\nScheduler::~Scheduler() {\n}\n\n\/\/ The entry point\nvoid Scheduler::Run() {\n  RunScope scope(this);\n  if (scope.IsStop())\n    return;\n  CfgBuilder(editor_.get()).Run();\n  EarlyScheduler(editor_.get()).Run();\n  LateScheduler(editor_.get()).Run();\n  auto const edge_map = StaticPredictor(observer(), editor_.get()).Run();\n  auto const blocks =\n      BlockLayouter(observer(), editor_.get(), edge_map.get()).Run();\n  NodePlacer(observer(), editor_.get(), blocks).Run();\n}\n\n\/\/ api::Pass\nbase::StringPiece Scheduler::name() const {\n  return \"scheduler\";\n}\n\nvoid Scheduler::DumpBeforePass(const api::PassDumpContext& context) {\n  auto& ostream = *context.ostream;\n  if (context.IsGraph()) {\n    ostream << AsGraphviz(editor_->function());\n    return;\n  }\n  ostream << AsReversePostOrder(editor_->function());\n}\n\nvoid Scheduler::DumpAfterPass(const api::PassDumpContext& context) {\n  auto& ostream = *context.ostream;\n  if (context.IsGraph()) {\n    ostream << AsVisual(editor_->schedule());\n    return;\n  }\n  ostream << AsFormatted(editor_->schedule());\n}\n\n}  \/\/ namespace optimizer\n}  \/\/ namespace elang\n<commit_msg>elang\/optimizer\/scheduler: Make |EarlyScheduler| to handle literal |TupleNode|.<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 <ostream>\n#include <unordered_set>\n#include <vector>\n\n#include \"elang\/optimizer\/scheduler\/scheduler.h\"\n\n#include \"base\/logging.h\"\n#include \"base\/strings\/stringprintf.h\"\n#include \"elang\/optimizer\/depth_first_traversal.h\"\n#include \"elang\/optimizer\/formatters\/graphviz_formatter.h\"\n#include \"elang\/optimizer\/formatters\/text_formatter.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\/block_layouter.h\"\n#include \"elang\/optimizer\/scheduler\/cfg_builder.h\"\n#include \"elang\/optimizer\/scheduler\/formatted_schedule.h\"\n#include \"elang\/optimizer\/scheduler\/schedule.h\"\n#include \"elang\/optimizer\/scheduler\/schedule_editor.h\"\n#include \"elang\/optimizer\/scheduler\/static_predictor.h\"\n#include \"elang\/optimizer\/scheduler\/visual_schedule.h\"\n\nnamespace elang {\nnamespace optimizer {\n\nnamespace {\n\nbool IsPinned(const Node* node) {\n  if (node->IsControl() || node->IsEffect())\n    return true;\n  \/\/ All nodes have at least one input except for |EntryNode|.\n  if (node->input(0)->IsControl())\n    return true;\n  return node->opcode() == Opcode::Phi || node->opcode() == Opcode::EffectPhi;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ EarlyScheduler\n\/\/\nclass EarlyScheduler final : public NodeVisitor, public ScheduleEditor::User {\n public:\n  explicit EarlyScheduler(ScheduleEditor* editor);\n  ~EarlyScheduler() final = default;\n\n  void Run();\n\n private:\n  void DoDefaultVisit(Node* node) final;\n\n  DISALLOW_COPY_AND_ASSIGN(EarlyScheduler);\n};\n\nEarlyScheduler::EarlyScheduler(ScheduleEditor* editor)\n    : ScheduleEditor::User(editor) {\n}\n\nvoid EarlyScheduler::Run() {\n  DepthFirstTraversal<OnInputEdge, const Function> walker;\n  walker.Traverse(function(), this);\n}\n\n\/\/ NodeVisitor implementation\nvoid EarlyScheduler::DoDefaultVisit(Node* node) {\n  if (node->IsLiteral() || BlockOf(node))\n    return;\n  \/\/ Place |node| into deepest block in dominator tree.\n  BasicBlock* block = nullptr;\n  for (auto const input : node->inputs()) {\n    if (input->IsLiteral())\n      continue;\n    auto input_block = BlockOf(input);\n    DCHECK(input_block) << *input << \" in \" << *node;\n    if (!block) {\n      block = input_block;\n      continue;\n    }\n    if (DepthOf(block) < DepthOf(input_block))\n      block = input_block;\n  }\n  if (!block) {\n    \/\/ |node| is a literal tuple.\n    DCHECK(node->is<TupleNode>()) << *node;\n    return;\n  }\n  editor()->SetBlockOf(node, block);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ LateScheduler\n\/\/\nclass LateScheduler final : public NodeVisitor, public ScheduleEditor::User {\n public:\n  explicit LateScheduler(ScheduleEditor* editor);\n  ~LateScheduler() final = default;\n\n  void Run();\n\n private:\n  void DoDefaultVisit(Node* node) final;\n\n  DISALLOW_COPY_AND_ASSIGN(LateScheduler);\n};\n\nLateScheduler::LateScheduler(ScheduleEditor* editor)\n    : ScheduleEditor::User(editor) {\n}\n\nvoid LateScheduler::Run() {\n  DepthFirstTraversal<OnUseEdge, const Function> walker;\n  walker.Traverse(function(), this);\n}\n\n\/\/ NodeVisitor implementation\nvoid LateScheduler::DoDefaultVisit(Node* node) {\n  if (node->IsLiteral())\n    return;\n  if (IsPinned(node)) {\n    auto const block = BlockOf(node);\n    if (!block) {\n      DCHECK(node->is<PhiNode>() || node->is<EffectPhiNode>());\n      return;\n    }\n    editor()->AppendNode(block, node);\n    return;\n  }\n  \/\/ Find Least Common Ancestor of users of |node|.\n  BasicBlock* lca_block = nullptr;\n  for (auto const edge : node->use_edges()) {\n    if (auto const phi = edge->from()->as<PhiNode>()) {\n      \/\/ This loop could be removed (and the code made asymptotically faster)\n      \/\/ by using complex data structures. In practice it is never a bottleneck.\n      for (auto phi_operand : phi->phi_inputs()) {\n        if (phi_operand->value() != node)\n          continue;\n        lca_block =\n            CommonAncestorOf(lca_block, BlockOf(phi_operand->control()));\n      }\n      continue;\n    }\n    auto const use_block = BlockOf(edge->to());\n    if (!lca_block) {\n      lca_block = use_block;\n      continue;\n    }\n    lca_block = CommonAncestorOf(lca_block, use_block);\n  }\n  DCHECK(lca_block) << *node;\n  auto best_block = lca_block;\n  auto const block = BlockOf(node);\n  for (auto runner = lca_block; runner != block; runner = DominatorOf(runner)) {\n    if (LoopDepthOf(best_block) <= LoopDepthOf(runner))\n      continue;\n    best_block = runner;\n  }\n  \/\/ TODO(eval1749) Split |node| if it is partially dead.\n  editor()->SetBlockOf(node, best_block);\n  editor()->AppendNode(best_block, node);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ NodePlacer\n\/\/\nclass NodePlacer final : public api::Pass, public ScheduleEditor::User {\n public:\n  explicit NodePlacer(api::PassObserver* observer,\n                      ScheduleEditor* editor,\n                      const std::vector<BasicBlock*>& blocks);\n  ~NodePlacer() = default;\n\n  void Run();\n\n private:\n  bool IsUsedInBlock(Node* node, BasicBlock* block) const;\n  void ScheduleInBlock(BasicBlock* block);\n\n  \/\/ api::Pass\n  base::StringPiece name() const final;\n\n  const std::vector<BasicBlock*>& blocks_;\n  std::vector<Node*> nodes_;\n\n  DISALLOW_COPY_AND_ASSIGN(NodePlacer);\n};\n\nNodePlacer::NodePlacer(api::PassObserver* observer,\n                       ScheduleEditor* editor,\n                       const std::vector<BasicBlock*>& blocks)\n    : Pass(observer), ScheduleEditor::User(editor), blocks_(blocks) {\n  nodes_.reserve(function()->max_node_id());\n}\n\nbool NodePlacer::IsUsedInBlock(Node* node, BasicBlock* block) const {\n  for (auto const edge : node->use_edges()) {\n    auto const user = edge->from();\n    if (BlockOf(user) == block)\n      return true;\n  }\n  return false;\n}\n\nvoid NodePlacer::Run() {\n  RunScope scope(this);\n  if (scope.IsStop())\n    return;\n  for (auto const block : blocks_)\n    ScheduleInBlock(block);\n  editor()->DidPlaceNodes(nodes_);\n}\n\nvoid NodePlacer::ScheduleInBlock(BasicBlock* block) {\n  std::unordered_set<Node*> placed;\n  WorkList<Node> pending_list;\n  auto end_node = static_cast<Node*>(nullptr);\n  auto first = true;\n  for (auto const node : block->nodes()) {\n    if (!first) {\n      if (node->IsBlockEnd()) {\n        DCHECK(!end_node);\n        end_node = node;\n        continue;\n      }\n      pending_list.Push(node);\n      continue;\n    }\n    first = false;\n    DCHECK(node->IsBlockStart());\n    nodes_.push_back(node);\n    placed.insert(node);\n    if (auto const phi_owner = node->as<PhiOwnerNode>()) {\n      if (auto const effect_phi = phi_owner->effect_phi()) {\n        nodes_.push_back(effect_phi);\n        placed.insert(effect_phi);\n      }\n      for (auto const phi : phi_owner->phi_nodes()) {\n        nodes_.push_back(phi);\n        placed.insert(phi);\n      }\n    }\n  }\n  DCHECK(end_node);\n\n  while (!pending_list.empty()) {\n    WorkList<Node> work_list;\n    while (!pending_list.empty())\n      work_list.Push(pending_list.Pop());\n    while (!work_list.empty()) {\n      auto const node = work_list.Pop();\n      for (auto const input : node->inputs()) {\n        if (input->IsLiteral() || BlockOf(input) != block ||\n            placed.count(input)) {\n          continue;\n        }\n        pending_list.Push(node);\n        break;\n      }\n      if (!pending_list.Contains(node)) {\n        nodes_.push_back(node);\n        placed.insert(node);\n      }\n    }\n  }\n\n  nodes_.push_back(end_node);\n}\n\n\/\/ api::Pass\nbase::StringPiece NodePlacer::name() const {\n  return \"node_placer\";\n}\n\n}  \/\/ namespace\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Scheduler\n\/\/\nScheduler::Scheduler(api::PassObserver* observer, Schedule* schedule)\n    : Pass(observer), editor_(new ScheduleEditor(schedule)) {\n  DCHECK(schedule);\n}\n\nScheduler::~Scheduler() {\n}\n\n\/\/ The entry point\nvoid Scheduler::Run() {\n  RunScope scope(this);\n  if (scope.IsStop())\n    return;\n  CfgBuilder(editor_.get()).Run();\n  EarlyScheduler(editor_.get()).Run();\n  LateScheduler(editor_.get()).Run();\n  auto const edge_map = StaticPredictor(observer(), editor_.get()).Run();\n  auto const blocks =\n      BlockLayouter(observer(), editor_.get(), edge_map.get()).Run();\n  NodePlacer(observer(), editor_.get(), blocks).Run();\n}\n\n\/\/ api::Pass\nbase::StringPiece Scheduler::name() const {\n  return \"scheduler\";\n}\n\nvoid Scheduler::DumpBeforePass(const api::PassDumpContext& context) {\n  auto& ostream = *context.ostream;\n  if (context.IsGraph()) {\n    ostream << AsGraphviz(editor_->function());\n    return;\n  }\n  ostream << AsReversePostOrder(editor_->function());\n}\n\nvoid Scheduler::DumpAfterPass(const api::PassDumpContext& context) {\n  auto& ostream = *context.ostream;\n  if (context.IsGraph()) {\n    ostream << AsVisual(editor_->schedule());\n    return;\n  }\n  ostream << AsFormatted(editor_->schedule());\n}\n\n}  \/\/ namespace optimizer\n}  \/\/ namespace elang\n<|endoftext|>"}
{"text":"<commit_before>#include \"Tab.h\"\n\n#include \"UIContext.h\"\n\nTab::Tab() {\n\n}\n\nTab::~Tab() {\n    delete _ctxt;\n}\n\nDLGPROC Tab::TabProc(HWND hDlg, UINT message, WPARAM wParam, LPARAM lParam) {\n    unsigned short nCode, ctrlId;\n\n    switch (message) {\n    case WM_INITDIALOG:\n        _hWnd = hDlg;\n        _ctxt = new UIContext(hDlg);\n        Initialize();\n        LoadSettings();\n        return FALSE;\n\n    case WM_COMMAND:\n        PropSheet_Changed(GetParent(hDlg), NULL);\n        nCode = HIWORD(wParam);\n        ctrlId = LOWORD(wParam);\n        return Command(nCode, ctrlId);\n\n    case WM_NOTIFY:\n        NMHDR *nHdr = (NMHDR *) lParam;\n        return Notification(nHdr);\n    }\n\n    return FALSE;\n}<commit_msg>Route events to their controls<commit_after>#include \"Tab.h\"\n\n#include \"UIContext.h\"\n\nTab::Tab() {\n\n}\n\nTab::~Tab() {\n    delete _ctxt;\n}\n\nDLGPROC Tab::TabProc(HWND hDlg, UINT message, WPARAM wParam, LPARAM lParam) {\n    unsigned short nCode, ctrlId;\n\n    switch (message) {\n    case WM_INITDIALOG:\n        _hWnd = hDlg;\n        _ctxt = new UIContext(hDlg);\n        Initialize();\n        LoadSettings();\n        return FALSE;\n\n    case WM_COMMAND:\n        PropSheet_Changed(GetParent(hDlg), NULL);\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    return FALSE;\n}<|endoftext|>"}
{"text":"<commit_before>\n#include \"Globals.h\"  \/\/ NOTE: MSVC stupidness requires this to be the same across all modules\n\n#include \"Cow.h\"\n\n\n\n\n\n\n\ncCow::cCow(void) :\n\tsuper(\"Cow\", 92, \"mob.cow.hurt\", \"mob.cow.hurt\", 0.9, 1.3)\n{\n}\n\n\n\n\n\nvoid cCow::GetDrops(cItems & a_Drops, cEntity * a_Killer)\n{\n\tAddRandomDropItem(a_Drops, 0, 2, E_ITEM_LEATHER);\n\tAddRandomDropItem(a_Drops, 1, 3, IsOnFire() ? E_ITEM_STEAK : E_ITEM_RAW_BEEF);\n}\n\nvoid cCow::OnRightClicked(cPlayer & a_Player)\n{\n\tif ((a_Player.GetEquippedItem().m_ItemType == E_ITEM_BUCKET))\n\t{\n\t\tif (!a_Player.IsGameModeCreative())\n\t\t{\n\t\t\ta_Player.GetInventory().RemoveOneEquippedItem();\n\t\t\ta_Player.GetInventory().AddItem(E_ITEM_MILK)\n\t\t}\n\n\t}\n}\n\n\n\n<commit_msg>Fixed compilation errors.<commit_after>\n#include \"Globals.h\"  \/\/ NOTE: MSVC stupidness requires this to be the same across all modules\n\n#include \"Cow.h\"\n#include \"..\/Entities\/Player.h\"\n\n\n\n\n\n\n\ncCow::cCow(void) :\n\tsuper(\"Cow\", 92, \"mob.cow.hurt\", \"mob.cow.hurt\", 0.9, 1.3)\n{\n}\n\n\n\n\n\nvoid cCow::GetDrops(cItems & a_Drops, cEntity * a_Killer)\n{\n\tAddRandomDropItem(a_Drops, 0, 2, E_ITEM_LEATHER);\n\tAddRandomDropItem(a_Drops, 1, 3, IsOnFire() ? E_ITEM_STEAK : E_ITEM_RAW_BEEF);\n}\n\n\n\n\n\nvoid cCow::OnRightClicked(cPlayer & a_Player)\n{\n\tif ((a_Player.GetEquippedItem().m_ItemType == E_ITEM_BUCKET))\n\t{\n\t\tif (!a_Player.IsGameModeCreative())\n\t\t{\n\t\t\ta_Player.GetInventory().RemoveOneEquippedItem();\n\t\t\ta_Player.GetInventory().AddItem(E_ITEM_MILK);\n\t\t}\n\t}\n}\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/ @file Merge.cpp\n\/\/\/\n\/\/\/ The merging unit.\n\/\/\/\n\/\/\/ @par Full Description\n\/\/\/ The class defines the merging entity.\n\/\/\/\n\/\/\/ @ingroup Merge\n\/\/\/\n\/\/\/ @par Copyright (c) 2016 vcdMaker team\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 FROM,\n\/\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n\/\/\/ IN THE SOFTWARE.\n\n#include <algorithm>\n#include <ratio>\n\n#include \"Merge.h\"\n#include \"Utils.h\"\n\nconst uint64_t MERGE::Merge::TEN_POWER[] =\n{\n    1ull,\n    static_cast<uint64_t>(std::kilo::num),\n    static_cast<uint64_t>(std::mega::num),\n    static_cast<uint64_t>(std::giga::num),\n    static_cast<uint64_t>(std::tera::num),\n    static_cast<uint64_t>(std::peta::num)\n};\n\nvoid MERGE::Merge::Run()\n{\n    \/\/ Find the minimum merging unit.\n    m_MinTimeUnit = FindMinUnit();\n\n    \/\/ If the output time unit is not forced use the minimum value.\n    if (m_TimeUnit.empty())\n    {\n        \/\/ The minimum time unit used in sources.\n        m_TimeUnit = m_MinTimeUnit;\n    }\n\n    \/\/ Create the output signal database and set its base time unit.\n    m_pMerged = std::make_unique<SIGNAL::SignalDb>(m_TimeUnit);\n\n    \/\/ Find the longest leading time for among all sources.\n    m_MaxLeadingTime = FindMaxLeadingTime();\n\n    \/\/ Merge Sources.\n    for (const SignalSource *source : m_Sources)\n    {\n        \/\/ Get the source's time unit.\n        const std::string sourceTimeUnit = source->GetTimeUnit();\n\n        \/\/ Source sync time in the target unit.\n        const uint64_t transformedSourceSync =\n            TransformUnit(source->GetSyncPoint(), m_MinTimeUnit, sourceTimeUnit);\n\n        \/\/ Merge signals here.\n        for (auto current_signal : source->Get()->GetSignals())\n        {\n            SIGNAL::Signal *signal = current_signal->Clone();\n\n            \/\/ Set the signal's new timestamp.\n            signal->SetTimestamp(CalculateNewTime(TransformUnit(signal->GetTimestamp(), \n                                                                m_MinTimeUnit, \n                                                                sourceTimeUnit),\n                                                  transformedSourceSync));\n\n            \/\/ Update its name.\n            signal->SetName(source->GetPrefix() + signal->GetName());\n\n            \/\/ Add to the output signals database.\n            m_pMerged->Add(signal);\n        }\n    }\n}\n\nstd::string MERGE::Merge::FindMinUnit()\n{\n    size_t maxIndex = 0;\n\n    for (const SignalSource *const source : m_Sources)\n    {\n        const size_t index = UTILS::GetTimeUnitIndex(source->GetTimeUnit());\n        maxIndex = std::max(index, maxIndex);\n    }\n\n    return SIGNAL::Signal::TIME_UNITS[maxIndex];\n}\n\nuint64_t MERGE::Merge::FindMaxLeadingTime()\n{\n    uint64_t maxLeadingTime = 0;\n\n    for (const SignalSource *const source : m_Sources)\n    {\n        uint64_t leadingTime = TransformUnit(source->GetLeadingTime(),\n                                             m_MinTimeUnit,\n                                             source->GetTimeUnit());\n        maxLeadingTime = std::max(leadingTime, maxLeadingTime);\n    }\n\n    return maxLeadingTime;\n}\n\nuint64_t MERGE::Merge::TransformUnit(uint64_t time,\n                                     const std::string &targetTimeUnit,\n                                     const std::string &sourceTimeUnit)\n{\n    uint64_t newTime = time;\n    uint32_t nominator = 0;\n    uint32_t denominator = 0;\n\n    const uint32_t targetPower = UTILS::GetTimeUnitIndex(targetTimeUnit);\n    const uint32_t sourcePower = UTILS::GetTimeUnitIndex(sourceTimeUnit);\n\n    if (targetPower > sourcePower)\n    {\n        nominator = (targetPower - sourcePower);\n    }\n    else if (targetPower < sourcePower)\n    {\n        denominator = (sourcePower - targetPower);\n        \/\/\/ @todo Range checking must be done.\n        newTime = time + static_cast<uint64_t>(((TEN_POWER[denominator]) \/ 2));\n    }\n\n    \/\/\/ @todo Range checking must be done.\n    return static_cast<uint64_t>(newTime * ((long double)(TEN_POWER[nominator]) \/ (TEN_POWER[denominator])));\n}\n\nuint64_t MERGE::Merge::CalculateNewTime(uint64_t time,\n                                        uint64_t syncPoint)\n{\n    \/\/\/ @todo Detect uint64_t overflow.\n    return (TransformUnit(time + m_MaxLeadingTime - syncPoint, m_TimeUnit, m_MinTimeUnit));\n}\n<commit_msg>Minor style fixes<commit_after>\/\/\/ @file Merge.cpp\n\/\/\/\n\/\/\/ The merging unit.\n\/\/\/\n\/\/\/ @par Full Description\n\/\/\/ The class defines the merging entity.\n\/\/\/\n\/\/\/ @ingroup Merge\n\/\/\/\n\/\/\/ @par Copyright (c) 2016 vcdMaker team\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 FROM,\n\/\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n\/\/\/ IN THE SOFTWARE.\n\n#include <algorithm>\n#include <ratio>\n\n#include \"Merge.h\"\n#include \"Utils.h\"\n\nconst uint64_t MERGE::Merge::TEN_POWER[] =\n{\n    1ull,\n    static_cast<uint64_t>(std::kilo::num),\n    static_cast<uint64_t>(std::mega::num),\n    static_cast<uint64_t>(std::giga::num),\n    static_cast<uint64_t>(std::tera::num),\n    static_cast<uint64_t>(std::peta::num)\n};\n\nvoid MERGE::Merge::Run()\n{\n    \/\/ Find the minimum merging unit.\n    m_MinTimeUnit = FindMinUnit();\n\n    \/\/ If the output time unit is not forced use the minimum value.\n    if (m_TimeUnit.empty())\n    {\n        \/\/ The minimum time unit used in sources.\n        m_TimeUnit = m_MinTimeUnit;\n    }\n\n    \/\/ Create the output signal database and set its base time unit.\n    m_pMerged = std::make_unique<SIGNAL::SignalDb>(m_TimeUnit);\n\n    \/\/ Find the longest leading time for among all sources.\n    m_MaxLeadingTime = FindMaxLeadingTime();\n\n    \/\/ Merge Sources.\n    for (const SignalSource *source : m_Sources)\n    {\n        \/\/ Get the source's time unit.\n        const std::string sourceTimeUnit = source->GetTimeUnit();\n\n        \/\/ Source sync time in the target unit.\n        const uint64_t transformedSourceSync =\n            TransformUnit(source->GetSyncPoint(), m_MinTimeUnit, sourceTimeUnit);\n\n        \/\/ Merge signals here.\n        for (auto current_signal : source->Get()->GetSignals())\n        {\n            SIGNAL::Signal *signal = current_signal->Clone();\n\n            \/\/ Set the signal's new timestamp.\n            signal->SetTimestamp(CalculateNewTime(TransformUnit(signal->GetTimestamp(), \n                                                                m_MinTimeUnit, \n                                                                sourceTimeUnit),\n                                                  transformedSourceSync));\n\n            \/\/ Update its name.\n            signal->SetName(source->GetPrefix() + signal->GetName());\n\n            \/\/ Add to the output signals database.\n            m_pMerged->Add(signal);\n        }\n    }\n}\n\nstd::string MERGE::Merge::FindMinUnit()\n{\n    size_t maxIndex = 0;\n\n    for (const SignalSource *const source : m_Sources)\n    {\n        const size_t index = UTILS::GetTimeUnitIndex(source->GetTimeUnit());\n        maxIndex = std::max(index, maxIndex);\n    }\n\n    return SIGNAL::Signal::TIME_UNITS[maxIndex];\n}\n\nuint64_t MERGE::Merge::FindMaxLeadingTime()\n{\n    uint64_t maxLeadingTime = 0;\n\n    for (const SignalSource *const source : m_Sources)\n    {\n        uint64_t leadingTime = TransformUnit(source->GetLeadingTime(),\n                                             m_MinTimeUnit,\n                                             source->GetTimeUnit());\n        maxLeadingTime = std::max(leadingTime, maxLeadingTime);\n    }\n\n    return maxLeadingTime;\n}\n\nuint64_t MERGE::Merge::TransformUnit(uint64_t time,\n                                     const std::string &targetTimeUnit,\n                                     const std::string &sourceTimeUnit)\n{\n    uint64_t newTime = time;\n    uint32_t nominator = 0;\n    uint32_t denominator = 0;\n\n    const uint32_t targetPower = UTILS::GetTimeUnitIndex(targetTimeUnit);\n    const uint32_t sourcePower = UTILS::GetTimeUnitIndex(sourceTimeUnit);\n\n    if (targetPower > sourcePower)\n    {\n        nominator = (targetPower - sourcePower);\n    }\n    else if (targetPower < sourcePower)\n    {\n        denominator = (sourcePower - targetPower);\n        \/\/\/ @todo Range checking must be done.\n        newTime = time + (TEN_POWER[denominator]) \/ 2);\n    }\n\n    const double unitsRatio =\n        static_cast<double>(TEN_POWER[nominator]) \/ TEN_POWER[denominator];\n\n    \/\/\/ @todo Range checking must be done.\n    return static_cast<uint64_t>(newTime * unitsRatio);\n}\n\nuint64_t MERGE::Merge::CalculateNewTime(uint64_t time,\n                                        uint64_t syncPoint)\n{\n    \/\/\/ @todo Detect uint64_t overflow.\n    return (TransformUnit(time + m_MaxLeadingTime - syncPoint, m_TimeUnit, m_MinTimeUnit));\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * This program interprets a tetra file by getting its tree representation\n * Takes a single filename containing the Tetra code as a parameter\n *\/\n\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <sstream>\n#include <string>\n\n#include \"tetra.h\"\n\n\/* this function populates a scope object with the variables contained in a\n * portion of the subtree containing the actual parameter expressions which are\n * passed in *\/\nvoid pasteArgList(Node* node1, Node* node2, Scope* destinationScope, Context* sourceContext) {\n    \/* check if we are a NODE_FORMAL_PARAM_LIST (structure), or an actual value *\/\n    if (node1->kind() == NODE_FORMAL_PARAM_LIST) {\n        \/* recursively paste in the subtrees *\/\n        pasteArgList(node1->child(0), node2->child(0), destinationScope, sourceContext);\n        if (node1->child(1)) {\n            pasteArgList(node1->child(1), node2->child(1), destinationScope, sourceContext);\n        }\n\n    } else {\n        \/* we are an actual value - paste the value from the source to the\n         * destination *\/\n\n        \/* evaluate node2 to get a value *\/\n        Tdata* sourceValue = evaluateExpression(node2, sourceContext);\n\n        \/* create a data reference for this name in the new scope *\/\n        Tdata* destinationValue =\n            destinationScope->lookupVar(node1->getStringvalue(), node1->type());\n\n        \/* do the assignment *\/\n        destinationValue->opAssign(sourceValue);\n    }\n}\n\n\/* evaluate a function call node *\/\nTdata* evaluateFunctionCall(Node* node, Context* context) {\n    \/* check to see if this is a standard library function *\/\n    Tstring funcName = node->child(0)->getStringvalue();\n\n    if (funcName == \"print\") {\n        if (node->child(1) != NULL) {\n            return tslPrint(node->child(1), context);\n        } else {\n            \/* print with no arguments *\/\n            return tslPrint(NULL, context);\n        }\n    }\n\n    \/* TODO add the other standard lib functions *\/\n\n    else {\n        \/* it's user defined, find it in the tree *\/\n        Node* funcNode = functions.getFunctionNode(node);\n\n        \/* check if there are parameters to be passed, and do so if needed *\/\n        if (node->child(1) != NULL) {\n            \/* make a scope for the new function we are calling *\/\n            Scope destScope(node);\n\n            \/* dump the passed parameters into the new scope *\/\n            pasteArgList(funcNode->child(0), node->child(1), &destScope, context);\n\n            \/* set the new scope in our context *\/\n            context->initializeNewScope(destScope);\n        } else {\n            \/* if there are no args, we still need to initialize a new scope *\/\n            context->initializeNewScope(node);\n        }\n\n        \/* place this node on the call stack, so it can be printed in the stack\n         * trace *\/\n        context->getCurrentScope().setCallNode(node);\n\n        \/* transfer control to the function capturing the return value *\/\n        Tdata* returnValue = evaluateStatement(funcNode, context);\n\n        \/* returns to the old scope once the function has finished evaluating *\/\n        context->exitScope();\n\n        \/* return the functions return value back *\/\n        return returnValue;\n    }\n}\n\n\/* evaluate any regular binary operator expression node the operatorMethod\n * parameter refers to one of the Tdata operator methods e.g.  opOR, opAnd etc.\n * from that class *\/\nTdata* evaluateBinaryExpression(Node* node,\n                                Context* context,\n                                Tdata* (Tdata::*operatorMethod)(const Tdata*) ) {\n    \/* evaluate both of the children *\/\n    Tdata* lhs = evaluateExpression(node->child(0), context);\n    Tdata* rhs = evaluateExpression(node->child(1), context);\n\n    \/* call the operator method on the left, passing the right, and return the\n     * result *\/\n    return (lhs->*operatorMethod)(rhs);\n}\n\n\/* fill a list from the children nodes of a list value node *\/\nvoid fillList(Tlist* list, Node* node, Context* context) {\n    \/* evaluate the first item *\/\n    Tdata* first = evaluateExpression(node->child(0), context);\n\n    \/* add it to the list *\/\n    list->append(first);\n\n    \/* recursively add the rest of the list if there is one *\/\n    if (node->getNumChildren() == 2) {\n        fillList(list, node->child(1), context);\n    }\n}\n\n\/* evaluates operations on data types and returns the value *\/\nTdata* evaluateExpression(Node* node, Context* context) {\n    \/* do different things based on the type of statement this is *\/\n    switch (node->kind()) {\n        \/* evaluate the function call using the function above *\/\n        case NODE_FUNCALL:\n            return evaluateFunctionCall(node, context);\n\n        case NODE_STRINGVAL: {\n            \/* make a Tdata for the value *\/\n            Tstring value = node->getStringvalue();\n            return Tdata::create(node->type(), &value);\n        }\n\n        case NODE_REALVAL: {\n            \/* make a Tdata for the value *\/\n            Treal value = node->getRealvalue();\n            return Tdata::create(node->type(), &value);\n        }\n\n        case NODE_INTVAL: {\n            \/* make a Tdata for the value *\/\n            Tint value = node->getIntvalue();\n            return Tdata::create(node->type(), &value);\n        }\n\n        case NODE_BOOLVAL: {\n            \/* make a Tdata for the value *\/\n            Tbool value = node->getBoolvalue();\n            return Tdata::create(node->type(), &value);\n        }\n\n        case NODE_LISTVAL: {\n            \/* make a list data structure *\/\n            Tlist l;\n            \/* if there are data elements, get them *\/\n            if (node->getNumChildren() > 0) {\n                fillList(&l, node, context);\n            }\n\n            \/* wrap this list in a tdata *\/\n            Tdata* list = Tdata::create(node->type(), &l);\n            return list;\n        }\n\n        \/* for all of these, we can simply call the binary expression function with\n         * the appropriate method parameter *\/\n        case NODE_ASSIGN:\n            return evaluateBinaryExpression(node, context, &Tdata::opAssign);\n        case NODE_OR:\n            return evaluateBinaryExpression(node, context, &Tdata::opOr);\n        case NODE_AND:\n            return evaluateBinaryExpression(node, context, &Tdata::opAnd);\n        case NODE_LT:\n            return evaluateBinaryExpression(node, context, &Tdata::opLt);\n        case NODE_LTE:\n            return evaluateBinaryExpression(node, context, &Tdata::opLte);\n        case NODE_GT:\n            return evaluateBinaryExpression(node, context, &Tdata::opGt);\n        case NODE_GTE:\n            return evaluateBinaryExpression(node, context, &Tdata::opGte);\n        case NODE_EQ:\n            return evaluateBinaryExpression(node, context, &Tdata::opEq);\n        case NODE_NEQ:\n            return evaluateBinaryExpression(node, context, &Tdata::opNeq);\n        case NODE_BITXOR:\n            return evaluateBinaryExpression(node, context, &Tdata::opBitxor);\n        case NODE_BITAND:\n            return evaluateBinaryExpression(node, context, &Tdata::opBitand);\n        case NODE_BITOR:\n            return evaluateBinaryExpression(node, context, &Tdata::opBitor);\n        case NODE_SHIFTL:\n            return evaluateBinaryExpression(node, context, &Tdata::opShiftl);\n        case NODE_SHIFTR:\n            return evaluateBinaryExpression(node, context, &Tdata::opShiftr);\n        case NODE_PLUS:\n            return evaluateBinaryExpression(node, context, &Tdata::opPlus);\n        case NODE_MINUS:\n            return evaluateBinaryExpression(node, context, &Tdata::opMinus);\n        case NODE_TIMES:\n            return evaluateBinaryExpression(node, context, &Tdata::opTimes);\n        case NODE_DIVIDE:\n            return evaluateBinaryExpression(node, context, &Tdata::opDivide);\n        case NODE_MODULUS:\n            return evaluateBinaryExpression(node, context, &Tdata::opModulus);\n        case NODE_EXP:\n            return evaluateBinaryExpression(node, context, &Tdata::opExp);\n\n        case NODE_BITNOT: {\n            \/* evaluate the child *\/\n            Tdata* operand = evaluateExpression(node->child(0), context);\n\n            \/* return the not of this *\/\n            return operand->opBitnot();\n        }\n\n        case NODE_NOT: {\n            \/* evaluate the child *\/\n            Tdata* operand = evaluateExpression(node->child(0), context);\n\n            \/* return the not of this *\/\n            return operand->opNot();\n        }\n\n        case NODE_INDEX: {\n            \/* evaluate the list on the left and the index on the right *\/\n            Tdata* list = evaluateExpression(node->child(0), context);\n            Tdata* index = evaluateExpression(node->child(1), context);\n\n            \/* return a pointer to the data in the list at that position *\/\n            return list->opIndex(index);\n        }\n\n        \/* simply get the identifier out of the context *\/\n        case NODE_IDENTIFIER:\n            return context->lookupVar(node->getStringvalue(), node->type());\n\n        default:\n            throw SystemError(\"Unhandled node type in eval\", 0, node);\n            break;\n    }\n}\n\n\/* evaluate a statement node - only returns a value for return statements *\/\nTdata* evaluateStatement(Node* node, Context* context) {\n    \/* do different things based on the type of statement this is *\/\n    switch (node->kind()) {\n        case NODE_FUNCTION: {\n            \/* if there were no arguments, child 0 is the body, else child 1 *\/\n            if (node->getNumChildren() == 1) {\n                return evaluateStatement(node->child(0), context);\n            } else {\n                return evaluateStatement(node->child(1), context);\n            }\n        } break;\n\n        case NODE_STATEMENT: {\n            \/* evaluate the first child *\/\n            Tdata* value = evaluateStatement(node->child(0), context);\n\n            \/* if it didn't result in a break of some kind, do the second one *\/\n            ExecutionStatus status = context->queryExecutionStatus();\n            if (status != RETURN && status != BREAK && status != CONTINUE) {\n                return evaluateStatement(node->child(1), context);\n\n                \/* if it is a return, we return that value back *\/\n            } else if (status == RETURN) {\n                return value;\n            }\n        } break;\n\n        case NODE_RETURN: {\n            \/* the return value, if any *\/\n            Tdata* returnValue = NULL;\n\n            \/* check if there is a child to return or not *\/\n            if (node->child(0)) {\n                \/* evaluate the expression *\/\n                returnValue = evaluateExpression(node->child(0), context);\n            }\n\n            context->notifyReturn();\n            return returnValue;\n        }\n\n        \/* just do nothing *\/\n        case NODE_PASS:\n            return NULL;\n            break;\n\n        \/* set these in the context so we know where yo go next *\/\n        case NODE_BREAK:\n            context->notifyBreak();\n            break;\n        case NODE_CONTINUE:\n            context->notifyContinue();\n            break;\n\n        \/* handle simple if expressions *\/\n        case NODE_IF: {\n            \/* evaluate the conditional expression *\/\n            Tdata* conditional = evaluateExpression(node->child(0), context);\n            \/* if true execute the 2nd child *\/\n            if (((Tbool*)(conditional->getValue()))->toBool()) {\n                return evaluateStatement(node->child(1), context);\n            } else {\n                \/* check for else block and execute it if it exists *\/\n                if (node->child(2) != NULL) {\n                    return evaluateStatement(node->child(2), context);\n                }\n            }\n        } break;\n\n        \/* handle elif nodes *\/\n        case NODE_ELIF: {\n            context->notifyElif();\n\n            \/* check the first branch *\/\n            Tdata* returnValue = evaluateStatement(node->child(0), context);\n\n            \/* check if the first one was false *\/\n            ExecutionStatus status = context->queryExecutionStatus();\n            if (status == ELIF) {\n                \/* if so, do the next one *\/\n                returnValue = evaluateStatement(node->child(1), context);\n            }\n\n            \/* check to see if we need to execute the catchall else statement\n             * if it exists *\/\n            status = context->queryExecutionStatus();\n            if (status == ELIF && node->child(2) != NULL) {\n                \/* if so, execute that *\/\n                returnValue = evaluateStatement(node->child(2), context);\n            }\n\n            return returnValue;\n        } break;\n\n        case NODE_ELIF_CHAIN: {\n            \/* try to execute the given case of the ELIF statement *\/\n            Tdata* returnValue = evaluateStatement(node->child(0), context);\n\n            \/* check to see if we are doing the next one *\/\n            ExecutionStatus status = context->queryExecutionStatus();\n            if (status == ELIF) {\n                \/* if so, do it *\/\n                returnValue = evaluateStatement(node->child(1), context);\n            }\n\n            return returnValue;\n        } break;\n\n        case NODE_ELIF_CLAUSE: {\n            \/* check the condition on the left *\/\n            Tdata* conditional = evaluateExpression(node->child(0), context);\n\n            \/* if condition is true, execute the body *\/\n            if (((Tbool*) conditional->getValue())->toBool()) {\n                \/* we no longer need to check the rest of the branches *\/\n                context->normalizeStatus();\n                return evaluateStatement(node->child(1), context);\n            }\n            return NULL;\n        } break;\n\n        case NODE_WHILE: {\n            \/* evaluate the condition *\/\n            Tdata* conditional = evaluateExpression(node->child(0), context);\n\n            \/* while it is true *\/\n            while (((Tbool*) conditional->getValue())->toBool()) {\n                \/* evaluate the loop body *\/\n                Tdata* returnValue = evaluateStatement(node->child(1), context);\n\n                \/* check the execution status *\/\n                ExecutionStatus status = context->queryExecutionStatus();\n\n                \/* if we returned, pass the value up *\/\n                if (status == RETURN) {\n                    return returnValue;\n                }\n\n                \/* if we broke, reset status and break out of the loop *\/\n                if (status == BREAK) {\n                    context->normalizeStatus();\n                    break;\n                }\n\n                \/* if we continued, just reset status and carry on *\/\n                if (status == CONTINUE) {\n                    context->normalizeStatus();\n                }\n\n                \/* recheck the condition *\/\n                conditional = evaluateExpression(node->child(0), context);\n            }\n        } break;\n\n        case NODE_FOR: {\n            \/* evaluate the list we are looping through *\/\n            Tdata* listData = evaluateExpression(node->child(1), context);\n\n            \/* pull the list out of it *\/\n            Tlist* list = (Tlist*) listData->getValue();\n\n            \/* the return value if we hit one *\/\n            Tdata* returnValue = NULL;\n\n            \/* for each item in this list *\/\n            for (int i = 0; i < list->length(); i++) {\n                \/* if we are breaking or returning, stop *\/\n                ExecutionStatus status = context->queryExecutionStatus();\n                if (status == BREAK) {\n                    context->normalizeStatus();\n                    return NULL;\n                } else if (status == RETURN) {\n                    context->normalizeStatus();\n                    return returnValue;\n                }\n\n                \/* set context to normal for now *\/\n                context->normalizeStatus();\n\n                \/* look the induction variable up in the context *\/\n                Tdata* loopVariable =\n                    context->lookupVar(node->child(0)->getStringvalue(), node->child(0)->type());\n\n                \/* set it to the next value *\/\n                loopVariable->opAssign(list->get(i));\n\n                \/* evaluate the body of the loop *\/\n                returnValue = evaluateStatement(node->child(2), context);\n            }\n        } break;\n\n        default:\n            \/* if it's none of these things, it must be an expression used as a\n             * statement *\/\n            return evaluateExpression(node, context);\n    }\n\n    \/* if we got down here, it was not a return or an expression so just NULL *\/\n    return NULL;\n}\n\n\/* Equivilant of main for the interpreter module *\/\nint interpret(Node* tree, int debug, int threads) {\n    \/* set environment settings *\/\n    TetraEnvironment::setDebug(debug);\n    TetraEnvironment::setMaxThreads(threads);\n    TetraEnvironment::setRunning();\n\n    \/* construct a context (this also initializes the global scope) *\/\n    Context context(TetraEnvironment::obtainNewThreadID());\n\n    \/* attempt to find the main function *\/\n    Node* main = functions.getFunctionNode(\"main()\");\n    if (main == NULL) {\n        throw Error(\"No main function found\", 0);\n    }\n\n    \/* initialize global vars *\/\n    context.initializeGlobalVars(tree);\n\n    \/* initialize a scope fpr the main method, and run *\/\n    context.initializeNewScope(main);\n\n    \/* evaluate the main function *\/\n    evaluateStatement(main, &context);\n\n    \/* wait for any unfinished business *\/\n    ThreadEnvironment::joinDetachedThreads();\n\n    \/* leave the scope *\/\n    context.exitScope();\n\n    return 0;\n}\n<commit_msg>Added support for [1 ... 10] list ranges<commit_after>\/*\n * This program interprets a tetra file by getting its tree representation\n * Takes a single filename containing the Tetra code as a parameter\n *\/\n\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <sstream>\n#include <string>\n\n#include \"tetra.h\"\n\n\/* this function populates a scope object with the variables contained in a\n * portion of the subtree containing the actual parameter expressions which are\n * passed in *\/\nvoid pasteArgList(Node* node1, Node* node2, Scope* destinationScope, Context* sourceContext) {\n    \/* check if we are a NODE_FORMAL_PARAM_LIST (structure), or an actual value *\/\n    if (node1->kind() == NODE_FORMAL_PARAM_LIST) {\n        \/* recursively paste in the subtrees *\/\n        pasteArgList(node1->child(0), node2->child(0), destinationScope, sourceContext);\n        if (node1->child(1)) {\n            pasteArgList(node1->child(1), node2->child(1), destinationScope, sourceContext);\n        }\n\n    } else {\n        \/* we are an actual value - paste the value from the source to the\n         * destination *\/\n\n        \/* evaluate node2 to get a value *\/\n        Tdata* sourceValue = evaluateExpression(node2, sourceContext);\n\n        \/* create a data reference for this name in the new scope *\/\n        Tdata* destinationValue =\n            destinationScope->lookupVar(node1->getStringvalue(), node1->type());\n\n        \/* do the assignment *\/\n        destinationValue->opAssign(sourceValue);\n    }\n}\n\n\/* evaluate a function call node *\/\nTdata* evaluateFunctionCall(Node* node, Context* context) {\n    \/* check to see if this is a standard library function *\/\n    Tstring funcName = node->child(0)->getStringvalue();\n\n    if (funcName == \"print\") {\n        if (node->child(1) != NULL) {\n            return tslPrint(node->child(1), context);\n        } else {\n            \/* print with no arguments *\/\n            return tslPrint(NULL, context);\n        }\n    }\n\n    \/* TODO add the other standard lib functions *\/\n\n    else {\n        \/* it's user defined, find it in the tree *\/\n        Node* funcNode = functions.getFunctionNode(node);\n\n        \/* check if there are parameters to be passed, and do so if needed *\/\n        if (node->child(1) != NULL) {\n            \/* make a scope for the new function we are calling *\/\n            Scope destScope(node);\n\n            \/* dump the passed parameters into the new scope *\/\n            pasteArgList(funcNode->child(0), node->child(1), &destScope, context);\n\n            \/* set the new scope in our context *\/\n            context->initializeNewScope(destScope);\n        } else {\n            \/* if there are no args, we still need to initialize a new scope *\/\n            context->initializeNewScope(node);\n        }\n\n        \/* place this node on the call stack, so it can be printed in the stack\n         * trace *\/\n        context->getCurrentScope().setCallNode(node);\n\n        \/* transfer control to the function capturing the return value *\/\n        Tdata* returnValue = evaluateStatement(funcNode, context);\n\n        \/* returns to the old scope once the function has finished evaluating *\/\n        context->exitScope();\n\n        \/* return the functions return value back *\/\n        return returnValue;\n    }\n}\n\n\/* evaluate any regular binary operator expression node the operatorMethod\n * parameter refers to one of the Tdata operator methods e.g.  opOR, opAnd etc.\n * from that class *\/\nTdata* evaluateBinaryExpression(Node* node,\n                                Context* context,\n                                Tdata* (Tdata::*operatorMethod)(const Tdata*) ) {\n    \/* evaluate both of the children *\/\n    Tdata* lhs = evaluateExpression(node->child(0), context);\n    Tdata* rhs = evaluateExpression(node->child(1), context);\n\n    \/* call the operator method on the left, passing the right, and return the\n     * result *\/\n    return (lhs->*operatorMethod)(rhs);\n}\n\n\/* fill a list from the children nodes of a list value node *\/\nvoid fillList(Tlist* list, Node* node, Context* context) {\n    \/* evaluate the first item *\/\n    Tdata* first = evaluateExpression(node->child(0), context);\n\n    \/* add it to the list *\/\n    list->append(first);\n\n    \/* recursively add the rest of the list if there is one *\/\n    if (node->getNumChildren() == 2) {\n        fillList(list, node->child(1), context);\n    }\n}\n\n\/* evaluates operations on data types and returns the value *\/\nTdata* evaluateExpression(Node* node, Context* context) {\n    \/* do different things based on the type of statement this is *\/\n    switch (node->kind()) {\n        \/* evaluate the function call using the function above *\/\n        case NODE_FUNCALL:\n            return evaluateFunctionCall(node, context);\n\n        case NODE_STRINGVAL: {\n            \/* make a Tdata for the value *\/\n            Tstring value = node->getStringvalue();\n            return Tdata::create(node->type(), &value);\n        }\n\n        case NODE_REALVAL: {\n            \/* make a Tdata for the value *\/\n            Treal value = node->getRealvalue();\n            return Tdata::create(node->type(), &value);\n        }\n\n        case NODE_INTVAL: {\n            \/* make a Tdata for the value *\/\n            Tint value = node->getIntvalue();\n            return Tdata::create(node->type(), &value);\n        }\n\n        case NODE_BOOLVAL: {\n            \/* make a Tdata for the value *\/\n            Tbool value = node->getBoolvalue();\n            return Tdata::create(node->type(), &value);\n        }\n\n        case NODE_LISTVAL: {\n            \/* make a list data structure *\/\n            Tlist l;\n            \/* if there are data elements, get them *\/\n            if (node->getNumChildren() > 0) {\n                fillList(&l, node, context);\n            }\n\n            \/* wrap this list in a tdata *\/\n            Tdata* list = Tdata::create(node->type(), &l);\n            return list;\n        }\n\n        case NODE_LISTRANGE: {\n            \/* make the list data structure *\/\n            Tlist l;\n\n            \/* evaluate the start and end points *\/\n            Tdata* start = evaluateExpression(node->child(0), context);\n            Tdata* end = evaluateExpression(node->child(1), context);\n\n            \/* assemble the array *\/\n            for (Tint t = *((Tint*) (start->getValue()));\n                 (t <= *((Tint*) (end->getValue()))).toBool(); t++) {\n                l.append(Tdata::create(node->child(0)->type(), &t));\n            }\n\n            \/* wrap this list in a tdata *\/\n            Tdata* list = Tdata::create(node->type(), &l);\n            return list;\n        }\n\n        \/* for all of these, we can simply call the binary expression function with\n         * the appropriate method parameter *\/\n        case NODE_ASSIGN:\n            return evaluateBinaryExpression(node, context, &Tdata::opAssign);\n        case NODE_OR:\n            return evaluateBinaryExpression(node, context, &Tdata::opOr);\n        case NODE_AND:\n            return evaluateBinaryExpression(node, context, &Tdata::opAnd);\n        case NODE_LT:\n            return evaluateBinaryExpression(node, context, &Tdata::opLt);\n        case NODE_LTE:\n            return evaluateBinaryExpression(node, context, &Tdata::opLte);\n        case NODE_GT:\n            return evaluateBinaryExpression(node, context, &Tdata::opGt);\n        case NODE_GTE:\n            return evaluateBinaryExpression(node, context, &Tdata::opGte);\n        case NODE_EQ:\n            return evaluateBinaryExpression(node, context, &Tdata::opEq);\n        case NODE_NEQ:\n            return evaluateBinaryExpression(node, context, &Tdata::opNeq);\n        case NODE_BITXOR:\n            return evaluateBinaryExpression(node, context, &Tdata::opBitxor);\n        case NODE_BITAND:\n            return evaluateBinaryExpression(node, context, &Tdata::opBitand);\n        case NODE_BITOR:\n            return evaluateBinaryExpression(node, context, &Tdata::opBitor);\n        case NODE_SHIFTL:\n            return evaluateBinaryExpression(node, context, &Tdata::opShiftl);\n        case NODE_SHIFTR:\n            return evaluateBinaryExpression(node, context, &Tdata::opShiftr);\n        case NODE_PLUS:\n            return evaluateBinaryExpression(node, context, &Tdata::opPlus);\n        case NODE_MINUS:\n            return evaluateBinaryExpression(node, context, &Tdata::opMinus);\n        case NODE_TIMES:\n            return evaluateBinaryExpression(node, context, &Tdata::opTimes);\n        case NODE_DIVIDE:\n            return evaluateBinaryExpression(node, context, &Tdata::opDivide);\n        case NODE_MODULUS:\n            return evaluateBinaryExpression(node, context, &Tdata::opModulus);\n        case NODE_EXP:\n            return evaluateBinaryExpression(node, context, &Tdata::opExp);\n\n        case NODE_BITNOT: {\n            \/* evaluate the child *\/\n            Tdata* operand = evaluateExpression(node->child(0), context);\n\n            \/* return the not of this *\/\n            return operand->opBitnot();\n        }\n\n        case NODE_NOT: {\n            \/* evaluate the child *\/\n            Tdata* operand = evaluateExpression(node->child(0), context);\n\n            \/* return the not of this *\/\n            return operand->opNot();\n        }\n\n        case NODE_INDEX: {\n            \/* evaluate the list on the left and the index on the right *\/\n            Tdata* list = evaluateExpression(node->child(0), context);\n            Tdata* index = evaluateExpression(node->child(1), context);\n\n            \/* return a pointer to the data in the list at that position *\/\n            return list->opIndex(index);\n        }\n\n        \/* simply get the identifier out of the context *\/\n        case NODE_IDENTIFIER:\n            return context->lookupVar(node->getStringvalue(), node->type());\n\n        default:\n            throw SystemError(\"Unhandled node type in eval\", 0, node);\n            break;\n    }\n}\n\n\/* evaluate a statement node - only returns a value for return statements *\/\nTdata* evaluateStatement(Node* node, Context* context) {\n    \/* do different things based on the type of statement this is *\/\n    switch (node->kind()) {\n        case NODE_FUNCTION: {\n            \/* if there were no arguments, child 0 is the body, else child 1 *\/\n            if (node->getNumChildren() == 1) {\n                return evaluateStatement(node->child(0), context);\n            } else {\n                return evaluateStatement(node->child(1), context);\n            }\n        } break;\n\n        case NODE_STATEMENT: {\n            \/* evaluate the first child *\/\n            Tdata* value = evaluateStatement(node->child(0), context);\n\n            \/* if it didn't result in a break of some kind, do the second one *\/\n            ExecutionStatus status = context->queryExecutionStatus();\n            if (status != RETURN && status != BREAK && status != CONTINUE) {\n                return evaluateStatement(node->child(1), context);\n\n                \/* if it is a return, we return that value back *\/\n            } else if (status == RETURN) {\n                return value;\n            }\n        } break;\n\n        case NODE_RETURN: {\n            \/* the return value, if any *\/\n            Tdata* returnValue = NULL;\n\n            \/* check if there is a child to return or not *\/\n            if (node->child(0)) {\n                \/* evaluate the expression *\/\n                returnValue = evaluateExpression(node->child(0), context);\n            }\n\n            context->notifyReturn();\n            return returnValue;\n        }\n\n        \/* just do nothing *\/\n        case NODE_PASS:\n            return NULL;\n            break;\n\n        \/* set these in the context so we know where yo go next *\/\n        case NODE_BREAK:\n            context->notifyBreak();\n            break;\n        case NODE_CONTINUE:\n            context->notifyContinue();\n            break;\n\n        \/* handle simple if expressions *\/\n        case NODE_IF: {\n            \/* evaluate the conditional expression *\/\n            Tdata* conditional = evaluateExpression(node->child(0), context);\n            \/* if true execute the 2nd child *\/\n            if (((Tbool*) (conditional->getValue()))->toBool()) {\n                return evaluateStatement(node->child(1), context);\n            } else {\n                \/* check for else block and execute it if it exists *\/\n                if (node->child(2) != NULL) {\n                    return evaluateStatement(node->child(2), context);\n                }\n            }\n        } break;\n\n        \/* handle elif nodes *\/\n        case NODE_ELIF: {\n            context->notifyElif();\n\n            \/* check the first branch *\/\n            Tdata* returnValue = evaluateStatement(node->child(0), context);\n\n            \/* check if the first one was false *\/\n            ExecutionStatus status = context->queryExecutionStatus();\n            if (status == ELIF) {\n                \/* if so, do the next one *\/\n                returnValue = evaluateStatement(node->child(1), context);\n            }\n\n            \/* check to see if we need to execute the catchall else statement\n             * if it exists *\/\n            status = context->queryExecutionStatus();\n            if (status == ELIF && node->child(2) != NULL) {\n                \/* if so, execute that *\/\n                returnValue = evaluateStatement(node->child(2), context);\n            }\n\n            return returnValue;\n        } break;\n\n        case NODE_ELIF_CHAIN: {\n            \/* try to execute the given case of the ELIF statement *\/\n            Tdata* returnValue = evaluateStatement(node->child(0), context);\n\n            \/* check to see if we are doing the next one *\/\n            ExecutionStatus status = context->queryExecutionStatus();\n            if (status == ELIF) {\n                \/* if so, do it *\/\n                returnValue = evaluateStatement(node->child(1), context);\n            }\n\n            return returnValue;\n        } break;\n\n        case NODE_ELIF_CLAUSE: {\n            \/* check the condition on the left *\/\n            Tdata* conditional = evaluateExpression(node->child(0), context);\n\n            \/* if condition is true, execute the body *\/\n            if (((Tbool*) conditional->getValue())->toBool()) {\n                \/* we no longer need to check the rest of the branches *\/\n                context->normalizeStatus();\n                return evaluateStatement(node->child(1), context);\n            }\n            return NULL;\n        } break;\n\n        case NODE_WHILE: {\n            \/* evaluate the condition *\/\n            Tdata* conditional = evaluateExpression(node->child(0), context);\n\n            \/* while it is true *\/\n            while (((Tbool*) conditional->getValue())->toBool()) {\n                \/* evaluate the loop body *\/\n                Tdata* returnValue = evaluateStatement(node->child(1), context);\n\n                \/* check the execution status *\/\n                ExecutionStatus status = context->queryExecutionStatus();\n\n                \/* if we returned, pass the value up *\/\n                if (status == RETURN) {\n                    return returnValue;\n                }\n\n                \/* if we broke, reset status and break out of the loop *\/\n                if (status == BREAK) {\n                    context->normalizeStatus();\n                    break;\n                }\n\n                \/* if we continued, just reset status and carry on *\/\n                if (status == CONTINUE) {\n                    context->normalizeStatus();\n                }\n\n                \/* recheck the condition *\/\n                conditional = evaluateExpression(node->child(0), context);\n            }\n        } break;\n\n        case NODE_FOR: {\n            \/* evaluate the list we are looping through *\/\n            Tdata* listData = evaluateExpression(node->child(1), context);\n\n            \/* pull the list out of it *\/\n            Tlist* list = (Tlist*) listData->getValue();\n\n            \/* the return value if we hit one *\/\n            Tdata* returnValue = NULL;\n\n            \/* for each item in this list *\/\n            for (int i = 0; i < list->length(); i++) {\n                \/* if we are breaking or returning, stop *\/\n                ExecutionStatus status = context->queryExecutionStatus();\n                if (status == BREAK) {\n                    context->normalizeStatus();\n                    return NULL;\n                } else if (status == RETURN) {\n                    context->normalizeStatus();\n                    return returnValue;\n                }\n\n                \/* set context to normal for now *\/\n                context->normalizeStatus();\n\n                \/* look the induction variable up in the context *\/\n                Tdata* loopVariable =\n                    context->lookupVar(node->child(0)->getStringvalue(), node->child(0)->type());\n\n                \/* set it to the next value *\/\n                loopVariable->opAssign(list->get(i));\n\n                \/* evaluate the body of the loop *\/\n                returnValue = evaluateStatement(node->child(2), context);\n            }\n        } break;\n\n        default:\n            \/* if it's none of these things, it must be an expression used as a\n             * statement *\/\n            return evaluateExpression(node, context);\n    }\n\n    \/* if we got down here, it was not a return or an expression so just NULL *\/\n    return NULL;\n}\n\n\/* Equivilant of main for the interpreter module *\/\nint interpret(Node* tree, int debug, int threads) {\n    \/* set environment settings *\/\n    TetraEnvironment::setDebug(debug);\n    TetraEnvironment::setMaxThreads(threads);\n    TetraEnvironment::setRunning();\n\n    \/* construct a context (this also initializes the global scope) *\/\n    Context context(TetraEnvironment::obtainNewThreadID());\n\n    \/* attempt to find the main function *\/\n    Node* main = functions.getFunctionNode(\"main()\");\n    if (main == NULL) {\n        throw Error(\"No main function found\", 0);\n    }\n\n    \/* initialize global vars *\/\n    context.initializeGlobalVars(tree);\n\n    \/* initialize a scope fpr the main method, and run *\/\n    context.initializeNewScope(main);\n\n    \/* evaluate the main function *\/\n    evaluateStatement(main, &context);\n\n    \/* wait for any unfinished business *\/\n    ThreadEnvironment::joinDetachedThreads();\n\n    \/* leave the scope *\/\n    context.exitScope();\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Module:    MeanSquaresImageMetric1.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 illustrates how to explore the domain of an image metric.  This\n\/\/ is a useful exercise to do before starting a registration process, since\n\/\/ getting familiar with the characteristics of the metric is fundamental for\n\/\/ the apropriate selection of the optimizer to be use for driving the\n\/\/ registration process, as well as for selecting the optimizer parameters.\n\/\/\n\/\/ Software Guide : EndLatex \n\n\n\/\/ Software Guide : BeginCodeSnippet\n#include \"itkImage.h\"\n#include \"itkImageFileReader.h\"\n#include \"itkImageFileWriter.h\"\n#include \"itkMeanSquaresImageToImageMetric.h\"\n#include \"itkTranslationTransform.h\"\n#include \"itkNearestNeighborInterpolateImageFunction.h\"\n#include \"itkLinearInterpolateImageFunction.h\"\n\n\nint main( int argc, char * argv[] )\n{\n  if( argc < 3 )\n    {\n    std::cerr << \"Usage: \" << std::endl;\n    std::cerr << argv[0] << \"  fixedImage  movingImage\" << std::endl;\n    return 1;\n    }\n\n  const     unsigned int   Dimension = 2;\n  typedef   unsigned char  PixelType;\n\n  typedef itk::Image< PixelType, Dimension >   ImageType;\n  typedef itk::Image< PixelType, Dimension >   ImageType;\n\n\n  typedef itk::ImageFileReader< ImageType >  ReaderType;\n\n  ReaderType::Pointer fixedReader  = ReaderType::New();\n  ReaderType::Pointer movingReader = ReaderType::New();\n\n  fixedReader->SetFileName(  argv[ 1 ] );\n  movingReader->SetFileName( argv[ 2 ] );\n\n  try \n    {\n    fixedReader->Update();\n    movingReader->Update();\n    }\n  catch( itk::ExceptionObject & excep )\n    {\n    std::cerr << \"Exception catched !\" << std::endl;\n    std::cerr << excep << std::endl;\n    }\n\n\n  typedef itk::MeanSquaresImageToImageMetric< ImageType, ImageType >  MetricType;\n\n  MetricType::Pointer metric = MetricType::New();\n\n\n\n  typedef itk::TranslationTransform< double, Dimension >  TransformType;\n\n  TransformType::Pointer transform = TransformType::New();\n\n\n\n\/\/  typedef itk::LinearInterpolateImageFunction< \n  typedef itk::NearestNeighborInterpolateImageFunction< \n                                 ImageType, double >  InterpolatorType;\n\n  InterpolatorType::Pointer interpolator = InterpolatorType::New();\n\n\n  metric->SetInterpolator( interpolator );\n  metric->SetTransform( transform );\n\n\n  transform->SetIdentity();\n\n  ImageType::ConstPointer fixedImage  = fixedReader->GetOutput();\n  ImageType::ConstPointer movingImage = movingReader->GetOutput();\n\n  metric->SetFixedImage(  fixedImage  );\n  metric->SetMovingImage( movingImage );\n\n  metric->SetFixedImageRegion(  fixedImage->GetBufferedRegion()  );\n\n  try \n    {\n    metric->Initialize();\n    }\n  catch( itk::ExceptionObject & excep )\n    {\n    std::cerr << \"Exception catched !\" << std::endl;\n    std::cerr << excep << std::endl;\n    return -1;\n    }\n\n\n  MetricType::TransformParametersType displacement( Dimension );\n\n  int rangex = 50;\n  int rangey = 50;\n\n  for( int dx = -rangex; dx <= rangex; dx++ )\n    {\n    for( int dy = -rangey; dy <= rangey; dy++ )\n      {\n      displacement[0] = dx;\n      displacement[1] = dy;\n      const double value = metric->GetValue( displacement );\n\n      std::cout << dx << \"   \"  << dy << \"   \" << value << std::endl;\n      }\n    }\n\n  std::cout << std::endl;\n\n\n  return 0;\n}\n\n\/\/ Software Guide : EndCodeSnippet\n\n<commit_msg>STYLE: Adding comments for the Software Guide.<commit_after>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Module:    MeanSquaresImageMetric1.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 illustrates how to explore the domain of an image metric.  This\n\/\/ is a useful exercise to do before starting a registration process, since\n\/\/ getting familiar with the characteristics of the metric is fundamental for\n\/\/ the apropriate selection of the optimizer to be use for driving the\n\/\/ registration process, as well as for selecting the optimizer parameters.\n\/\/ This process makes possible to identify how noisy a metric may be in a given\n\/\/ range of parameters, and it will also give an idea of the number of local\n\/\/ minima or maxima in which an optimizer may get trapped while exploring the\n\/\/ parametric space.\n\/\/\n\/\/ Software Guide : EndLatex \n\n\n\n#include \"itkImage.h\"\n#include \"itkImageFileReader.h\"\n#include \"itkImageFileWriter.h\"\n\n\n\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ We start by including the headers of the basic components: Metric, Transform\n\/\/ and Interpolator.\n\/\/\n\/\/ Software Guide : EndLatex \n\n\/\/ Software Guide : BeginCodeSnippet\n#include \"itkMeanSquaresImageToImageMetric.h\"\n#include \"itkTranslationTransform.h\"\n#include \"itkNearestNeighborInterpolateImageFunction.h\"\n\/\/ Software Guide : EndCodeSnippet\n\n\nint main( int argc, char * argv[] )\n{\n  if( argc < 3 )\n    {\n    std::cerr << \"Usage: \" << std::endl;\n    std::cerr << argv[0] << \"  fixedImage  movingImage\" << std::endl;\n    return 1;\n    }\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ We define the dimension and pixel type of the images to be used in the\n\/\/ evaluation of the Metric.\n\/\/\n\/\/ Software Guide : EndLatex \n\n\/\/ Software Guide : BeginCodeSnippet\n  const     unsigned int   Dimension = 2;\n  typedef   unsigned char  PixelType;\n\n  typedef itk::Image< PixelType, Dimension >   ImageType;\n\/\/ Software Guide : EndCodeSnippet\n\n\n\n\n  typedef itk::ImageFileReader< ImageType >  ReaderType;\n\n  ReaderType::Pointer fixedReader  = ReaderType::New();\n  ReaderType::Pointer movingReader = ReaderType::New();\n\n  fixedReader->SetFileName(  argv[ 1 ] );\n  movingReader->SetFileName( argv[ 2 ] );\n\n  try \n    {\n    fixedReader->Update();\n    movingReader->Update();\n    }\n  catch( itk::ExceptionObject & excep )\n    {\n    std::cerr << \"Exception catched !\" << std::endl;\n    std::cerr << excep << std::endl;\n    }\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ The type of the Metric is instantiated and one is constructed.  In this case\n\/\/ we decided to use the same image type for both the fixed and the moving\n\/\/ images.\n\/\/\n\/\/ Software Guide : EndLatex \n\n\/\/ Software Guide : BeginCodeSnippet\n  typedef itk::MeanSquaresImageToImageMetric< \n                            ImageType, ImageType >  MetricType;\n\n  MetricType::Pointer metric = MetricType::New();\n\/\/ Software Guide : EndCodeSnippet\n\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ We also instantiate the transform and interpolator types, and create objects\n\/\/ of each class.\n\/\/\n\/\/ Software Guide : EndLatex \n\n\/\/ Software Guide : BeginCodeSnippet\n  typedef itk::TranslationTransform< double, Dimension >  TransformType;\n\n  TransformType::Pointer transform = TransformType::New();\n\n\n  typedef itk::NearestNeighborInterpolateImageFunction< \n                                 ImageType, double >  InterpolatorType;\n\n  InterpolatorType::Pointer interpolator = InterpolatorType::New();\n\/\/ Software Guide : EndCodeSnippet\n\n\n  transform->SetIdentity();\n\n  ImageType::ConstPointer fixedImage  = fixedReader->GetOutput();\n  ImageType::ConstPointer movingImage = movingReader->GetOutput();\n\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ The classes required by the metric are connected to it. This includes the\n\/\/ fixed and moving images, the interpolator and the  transform.\n\/\/\n\/\/ Software Guide : EndLatex \n\n\/\/ Software Guide : BeginCodeSnippet\n  metric->SetTransform( transform );\n  metric->SetInterpolator( interpolator );\n\n  metric->SetFixedImage(  fixedImage  );\n  metric->SetMovingImage( movingImage );\n\/\/ Software Guide : EndCodeSnippet\n\n  metric->SetFixedImageRegion(  fixedImage->GetBufferedRegion()  );\n\n  try \n    {\n    metric->Initialize();\n    }\n  catch( itk::ExceptionObject & excep )\n    {\n    std::cerr << \"Exception catched !\" << std::endl;\n    std::cerr << excep << std::endl;\n    return -1;\n    }\n\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ Finally we select a region of the parametric to explore. In this case we are\n\/\/ using a translation transform in 2D, so we simply select translations from a\n\/\/ negative position to a positive position, in both $x$ and $y$. For each one\n\/\/ of those positions we invoke the GetValue() method of the Metric.\n\/\/\n\/\/ Software Guide : EndLatex \n\n\/\/ Software Guide : BeginCodeSnippet\n  MetricType::TransformParametersType displacement( Dimension );\n\n  const int rangex = 50;\n  const int rangey = 50;\n\n  for( int dx = -rangex; dx <= rangex; dx++ )\n    {\n    for( int dy = -rangey; dy <= rangey; dy++ )\n      {\n      displacement[0] = dx;\n      displacement[1] = dy;\n      const double value = metric->GetValue( displacement );\n      std::cout << dx << \"   \"  << dy << \"   \" << value << std::endl;\n      }\n    }\n\/\/ Software Guide : EndCodeSnippet\n\n\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ Running this code using the image BrainProtonDensitySlice.png as both the\n\/\/ fixed and the moving images results in the plot shown in\n\/\/ Figure~\\ref{fig:MeanSquaresMetricPlot}. From this Figure, it can be seen\n\/\/ that a gradient based optimizer will be appropriate for finding the extrema\n\/\/ of the Metric. It is also possible to estimate a good value for the step\n\/\/ length of a gradient-descent optimizer.\n\/\/\n\/\/ This exercise of plotting the Metric is probably the best thing to do when a\n\/\/ registration process is not converging and when it is unclear how to fine\n\/\/ tune the different parameters involved in the registration. This includes\n\/\/ the optimizer parameters, the metric parameters and even options such as\n\/\/ preprocessing the image data with smoothing filters.\n\/\/\n\/\/ Of course, this plotting exercise becomes more challenging when the\n\/\/ transform has more than three parameters, and when those parameters have\n\/\/ very different range of values.\n\/\/ \n\/\/\n\/\/ Software Guide : EndLatex \n\n\n\n  return 0;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"precomp.h\"\n#include \"menu.h\"\n#include <ClanLib\/gl.h>\n#include <ClanLib\/core.h>\n#include <ClanLib\/application.h>\n#include <ClanLib\/display.h>\n\nMenu::Menu(App * app, clan::DisplayWindow & wnd)\n{\n\tm_app = app;\n\tm_window = wnd;\n\tm_canvas = clan::Canvas(m_window);\n\tm_run = true;\n}\n\nbool Menu::init()\n{\n\tm_change=0;\n\n\tclan::XMLResourceDocument res(\"menu.xml\");\n\tm_resources = clan::XMLResourceManager::create(res);\n\t\n\tm_background = clan::Image::resource(m_canvas,\"background\",m_resources);\n\tbutton_exit_img = clan::Image::resource(m_canvas,\"quit_button_img\",m_resources);\n\tbutton_world_img = clan::Image::resource(m_canvas,\"play_button_img\",m_resources);\n\tbutton_editor_img = clan::Image::resource(m_canvas,\"editor_button_img\",m_resources);\n\tbutton_sound_on_img = clan::Image::resource(m_canvas,\"sound_button_on_img\",m_resources);\n\tbutton_sound_off_img = clan::Image::resource(m_canvas,\"sound_button_off_img\",m_resources);\n\tm_key_up = m_window.get_ic().get_keyboard().sig_key_up().connect(this, &Menu::on_key_up);\n\tm_window_manager = clan::GUIWindowManagerDirect(m_window, m_canvas);\t\n\tm_gui_manager = clan::GUIManager(m_window_manager, \"Gfx\/gui\/aero\");\n\tc = new clan::GUIComponent(&m_gui_manager, clan::GUITopLevelDescription(clan::Rect(0,0,1024,720),true),\"rootx\");\n\twindowClosedEventSlot = m_window.sig_window_close().connect(this, &Menu::WindowCloseEventHandler);\n\n\tbutton_world = new clan::PushButton(c);\t\n\tbutton_world->set_geometry(clan::Rect( 422, 490, clan::Size(180, 28)));\n\tbutton_world->func_clicked().set(this, &Menu::on_button_clicked, button_world);\n\tbutton_world_top = new clan::ImageView(button_world);\n\tbutton_world_top->set_geometry(clan::Rect( -92, -18, clan::Size(364, 68)));\n\tbutton_world_top->set_image(button_world_img);\n\tbutton_world_top->set_scale_to_fit(true);\n\t\n\t\n\tbutton_editor = new clan::PushButton(c);\n\tbutton_editor->set_geometry(clan::Rect( 422, 540, clan::Size(180, 28)));\n\tbutton_editor->func_clicked().set(this, &Menu::on_button_clicked, button_editor);\n\tbutton_editor_top = new clan::ImageView(button_editor);\n\tbutton_editor_top->set_geometry(clan::Rect( -92, -18, clan::Size(364, 68)));\n\tbutton_editor_top->set_image(button_editor_img);\n\tbutton_editor_top->set_scale_to_fit(true);\n\t\n\t\n\tbutton_exit = new clan::PushButton(c);\n\tbutton_exit->set_geometry(clan::Rect( 422, 590, clan::Size(180, 28)));\n\tbutton_exit->func_clicked().set(this, &Menu::on_button_clicked, button_exit);\n\tbutton_exit_top = new clan::ImageView(button_exit);\n\tbutton_exit_top->set_geometry(clan::Rect( -92, -18, clan::Size(364, 68)));\n\tbutton_exit_top->set_image(button_exit_img);\n\tbutton_exit_top->set_scale_to_fit(true);\n\t\n\tm_con_window = new ConDialogue(c);\n\tm_con_window->set_default_values(m_app->ip,m_app->port,m_app->username,\"pass\");\n\n\tm_exit_window = new YNDialogue(c, \"You are about to quit!\");\n\n\tconfirmWindowClosedEventSlot = m_exit_window->confirmation().connect(this, &Menu::CloseConfirmed);\n\tconnectAttemptEventSlot = m_con_window->submit_connection().connect(this, &Menu::ConnectAttempt);\n\n\t\/\/\/reikalinga eilute norint sutvarkyti kai kuriu elementu matomuma. (gui posistemes bug'as?)\n\tc->update_layout();\n\n\t\/\/MUSIC BY Kevin MacLeod\n\tclan::SoundBuffer back_sound(\"Angevin.ogg\");\n\tback_sound.set_volume(0.5f);\n\tplayback = back_sound.prepare();\n\t\/\/playback.play();\n\tplay = true;\n\tplayback.set_looping(true);\n\n\t\t\/\/sound migtukas\n\tbutton_sound = new clan::PushButton(c);\n\tbutton_sound->set_geometry(clan::Rect( 0, 0, clan::Size(20, 20)));\n\tbutton_sound->func_clicked().set(this, &Menu::on_button_clicked, button_sound);\n\tbutton_sound_top = new clan::ImageView(button_sound);\n\tbutton_sound_top->set_geometry(clan::Rect(0, 0, clan::Size(20, 20)));\n\tbutton_sound_top->set_image(button_sound_on_img);\n\tbutton_sound_top->set_scale_to_fit(true);\n\n\treturn true;\n}\n\nvoid Menu::ConnectAttempt(const ConnectionInfo &info)\n{\/\/DEBUG NOT FINISHED! connect params with world\n\t\n\tState * s = new World(m_window);\n\tstatic_cast<World*>(s)->set_info(info);\n\n\tif(s->init())\n\t{\n\t\tm_app->get_states().push(s);\n\t\tpause();\n\t}\n\telse\n\t{\n\t\ts->exit();\n\t\tdelete s;\n\t}\n}\n\nbool Menu::run()\n{\n\tif(m_run)\n\t{\n\t\tchanging();\n\n\t\tm_background.draw(m_canvas,clan::Rect(0,0,1024,720));\n\n\t\t\/\/\/render gui\n\t\tm_gui_manager.process_messages(0);\n\t\tm_gui_manager.render_windows();\n\t\tm_window_manager.get_canvas(NULL).flush(); \n\n\t\tm_window.flip(0);\n\t\tclan::KeepAlive::process();\n\t}\n\n\treturn m_run;\n}\n\nvoid Menu::WindowCloseEventHandler()\n{\n\tm_run = false;\n}\n\nvoid Menu::CloseConfirmed(bool close)\n{\n\tm_run = !close;\n}\n\nbool Menu::pause()\n{\n\tState::pause();\n\n\tplayback.stop();\n\n\tc->set_visible(false);\n\n\tm_key_up.disable();\n\n\tconfirmWindowClosedEventSlot.disable();\n\n\treturn true;\n}\n\nbool Menu::resume()\n{\n\tState::resume();\n\tif(play)\n\tplayback.play();\n\n\tc->set_visible(true);\n\n\tm_key_up.enable();\n\n\tconfirmWindowClosedEventSlot.enable();\n\n\treturn true;\n}\n\nbool Menu::exit()\n{\n\tm_key_up.destroy();\n\treturn true;\n}\n\nvoid Menu::on_key_up(const clan::InputEvent & e)\n{\n\tif(e.id == clan::keycode_q)\n\t\tm_run = false;\n}\n\nvoid Menu::on_button_clicked(clan::PushButton *button)\n{\n\tif(button==button_editor)\n\t{\n\t\tState * s = new editor(m_window);\n\t\tif(s->init())\n\t\t{\n\t\t\tm_app->get_states().push(s);\n\t\t\tpause();\n\t\t}\n\t\telse\n\t\t{\n\t\t\ts->exit();\n\t\t\tdelete s;\n\t\t}\n\t}\n\telse if(button==button_world)\n\t{\n\t\tm_con_window->toggle_visibility();\n\t}\n\telse if(button==button_exit)\n\t{\n\t\tm_exit_window->toggle_visibility();\n\t}\n\telse if(button==button_sound)\n\t{\n\t\tif(playback.is_playing())\n\t\t\t{playback.stop();\n\t\tbutton_sound_top->set_image(button_sound_on_img);\n\t\tplay = false;}\n\t\telse\n\t\t\t{playback.play();\n\t\tbutton_sound_top->set_image(button_sound_off_img);\n\t\tplay = true;}\n\t}\n}\n\nvoid Menu::changing()\n{\n\tclan::Point current = m_window.get_ic().get_mouse().get_position();\n\n\tif(\tcurrent.x >414 && current.x<607 && current.y>490 && current.y<518)\n\t{\n\t\tbutton_world_top->set_geometry(clan::Rect( -94, -20, clan::Size(368, 72)));\n\t\tm_change=1;\n\t}\n\telse if (current.x >414 && current.x<607 && current.y>540 && current.y<568)\n\t{\n\t\tbutton_editor_top->set_geometry(clan::Rect( -94, -20, clan::Size(368, 72)));\n\t\tm_change=2;\n\t}\n\telse if (current.x >414 && current.x<607 && current.y>590 && current.y<618)\n\t{\n\t\tbutton_exit_top->set_geometry(clan::Rect( -94, -20, clan::Size(368, 72)));\n\t\tm_change=3;\n\t}\n\telse if(m_change>0)\n\t{\n\t\tif(m_change==1)\n\t\t\tbutton_world_top->set_geometry(clan::Rect( -92, -18, clan::Size(364, 68)));\n\t\telse if(m_change==2)\n\t\t\tbutton_editor_top->set_geometry(clan::Rect( -92, -18, clan::Size(364, 68)));\n\t\telse if(m_change==3)\n\t\t\tbutton_exit_top->set_geometry(clan::Rect( -92, -18, clan::Size(364, 68)));\n\n\t\tm_change=0;\n\t}\n}<commit_msg>fix button<commit_after>#include \"precomp.h\"\n#include \"menu.h\"\n#include <ClanLib\/gl.h>\n#include <ClanLib\/core.h>\n#include <ClanLib\/application.h>\n#include <ClanLib\/display.h>\n\nMenu::Menu(App * app, clan::DisplayWindow & wnd)\n{\n\tm_app = app;\n\tm_window = wnd;\n\tm_canvas = clan::Canvas(m_window);\n\tm_run = true;\n}\n\nbool Menu::init()\n{\n\tm_change=0;\n\n\tclan::XMLResourceDocument res(\"menu.xml\");\n\tm_resources = clan::XMLResourceManager::create(res);\n\t\n\tm_background = clan::Image::resource(m_canvas,\"background\",m_resources);\n\tbutton_exit_img = clan::Image::resource(m_canvas,\"quit_button_img\",m_resources);\n\tbutton_world_img = clan::Image::resource(m_canvas,\"play_button_img\",m_resources);\n\tbutton_editor_img = clan::Image::resource(m_canvas,\"editor_button_img\",m_resources);\n\tbutton_sound_on_img = clan::Image::resource(m_canvas,\"sound_button_on_img\",m_resources);\n\tbutton_sound_off_img = clan::Image::resource(m_canvas,\"sound_button_off_img\",m_resources);\n\tm_key_up = m_window.get_ic().get_keyboard().sig_key_up().connect(this, &Menu::on_key_up);\n\tm_window_manager = clan::GUIWindowManagerDirect(m_window, m_canvas);\t\n\tm_gui_manager = clan::GUIManager(m_window_manager, \"Gfx\/gui\/aero\");\n\tc = new clan::GUIComponent(&m_gui_manager, clan::GUITopLevelDescription(clan::Rect(0,0,1024,720),true),\"rootx\");\n\twindowClosedEventSlot = m_window.sig_window_close().connect(this, &Menu::WindowCloseEventHandler);\n\n\tbutton_world = new clan::PushButton(c);\t\n\tbutton_world->set_geometry(clan::Rect( 422, 490, clan::Size(180, 28)));\n\tbutton_world->func_clicked().set(this, &Menu::on_button_clicked, button_world);\n\tbutton_world_top = new clan::ImageView(button_world);\n\tbutton_world_top->set_geometry(clan::Rect( -92, -18, clan::Size(364, 68)));\n\tbutton_world_top->set_image(button_world_img);\n\tbutton_world_top->set_scale_to_fit(true);\n\t\n\t\n\tbutton_editor = new clan::PushButton(c);\n\tbutton_editor->set_geometry(clan::Rect( 422, 540, clan::Size(180, 28)));\n\tbutton_editor->func_clicked().set(this, &Menu::on_button_clicked, button_editor);\n\tbutton_editor_top = new clan::ImageView(button_editor);\n\tbutton_editor_top->set_geometry(clan::Rect( -92, -18, clan::Size(364, 68)));\n\tbutton_editor_top->set_image(button_editor_img);\n\tbutton_editor_top->set_scale_to_fit(true);\n\t\n\t\n\tbutton_exit = new clan::PushButton(c);\n\tbutton_exit->set_geometry(clan::Rect( 422, 590, clan::Size(180, 28)));\n\tbutton_exit->func_clicked().set(this, &Menu::on_button_clicked, button_exit);\n\tbutton_exit_top = new clan::ImageView(button_exit);\n\tbutton_exit_top->set_geometry(clan::Rect( -92, -18, clan::Size(364, 68)));\n\tbutton_exit_top->set_image(button_exit_img);\n\tbutton_exit_top->set_scale_to_fit(true);\n\t\n\tm_con_window = new ConDialogue(c);\n\tm_con_window->set_default_values(m_app->ip,m_app->port,m_app->username,\"pass\");\n\n\tm_exit_window = new YNDialogue(c, \"You are about to quit!\");\n\n\tconfirmWindowClosedEventSlot = m_exit_window->confirmation().connect(this, &Menu::CloseConfirmed);\n\tconnectAttemptEventSlot = m_con_window->submit_connection().connect(this, &Menu::ConnectAttempt);\n\n\t\/\/\/reikalinga eilute norint sutvarkyti kai kuriu elementu matomuma. (gui posistemes bug'as?)\n\tc->update_layout();\n\n\t\/\/MUSIC BY Kevin MacLeod\n\tclan::SoundBuffer back_sound(\"Angevin.ogg\");\n\tback_sound.set_volume(0.5f);\n\tplayback = back_sound.prepare();\n\t\/\/playback.play();\n\tplay = true;\n\tplayback.set_looping(true);\n\n\t\t\/\/sound migtukas\n\tbutton_sound = new clan::PushButton(c);\n\tbutton_sound->set_geometry(clan::Rect( 0, 0, clan::Size(20, 20)));\n\tbutton_sound->func_clicked().set(this, &Menu::on_button_clicked, button_sound);\n\tbutton_sound_top = new clan::ImageView(button_sound);\n\tbutton_sound_top->set_geometry(clan::Rect(0, 0, clan::Size(20, 20)));\n\tbutton_sound_top->set_image(button_sound_on_img);\n\tbutton_sound_top->set_scale_to_fit(true);\n\n\treturn true;\n}\n\nvoid Menu::ConnectAttempt(const ConnectionInfo &info)\n{\/\/DEBUG NOT FINISHED! connect params with world\n\t\n\tState * s = new World(m_window);\n\tstatic_cast<World*>(s)->set_info(info);\n\n\tif(s->init())\n\t{\n\t\tm_app->get_states().push(s);\n\t\tpause();\n\t}\n\telse\n\t{\n\t\ts->exit();\n\t\tdelete s;\n\t}\n}\n\nbool Menu::run()\n{\n\tif(m_run)\n\t{\n\t\tchanging();\n\n\t\tm_background.draw(m_canvas,clan::Rect(0,0,1024,720));\n\n\t\t\/\/\/render gui\n\t\tm_gui_manager.process_messages(0);\n\t\tm_gui_manager.render_windows();\n\t\tm_window_manager.get_canvas(NULL).flush(); \n\n\t\tm_window.flip(0);\n\t\tclan::KeepAlive::process();\n\t}\n\n\treturn m_run;\n}\n\nvoid Menu::WindowCloseEventHandler()\n{\n\tm_run = false;\n}\n\nvoid Menu::CloseConfirmed(bool close)\n{\n\tm_run = !close;\n}\n\nbool Menu::pause()\n{\n\tState::pause();\n\n\tplayback.stop();\n\tbutton_sound_top->set_image(button_sound_on_img);\n\tc->set_visible(false);\n\n\tm_key_up.disable();\n\n\tconfirmWindowClosedEventSlot.disable();\n\n\treturn true;\n}\n\nbool Menu::resume()\n{\n\tState::resume();\n\tif(play)\n\t{\n\tbutton_sound_top->set_image(button_sound_off_img);\n\tplayback.play();\n\t}\n\telse \n\tbutton_sound_top->set_image(button_sound_on_img);\n\tc->set_visible(true);\n\n\tm_key_up.enable();\n\n\tconfirmWindowClosedEventSlot.enable();\n\n\treturn true;\n}\n\nbool Menu::exit()\n{\n\tm_key_up.destroy();\n\treturn true;\n}\n\nvoid Menu::on_key_up(const clan::InputEvent & e)\n{\n\tif(e.id == clan::keycode_q)\n\t\tm_run = false;\n}\n\nvoid Menu::on_button_clicked(clan::PushButton *button)\n{\n\tif(button==button_editor)\n\t{\n\t\tState * s = new editor(m_window);\n\t\tif(s->init())\n\t\t{\n\t\t\tm_app->get_states().push(s);\n\t\t\tpause();\n\t\t}\n\t\telse\n\t\t{\n\t\t\ts->exit();\n\t\t\tdelete s;\n\t\t}\n\t}\n\telse if(button==button_world)\n\t{\n\t\tm_con_window->toggle_visibility();\n\t}\n\telse if(button==button_exit)\n\t{\n\t\tm_exit_window->toggle_visibility();\n\t}\n\telse if(button==button_sound)\n\t{\n\t\tif(playback.is_playing())\n\t\t\t{playback.stop();\n\t\tbutton_sound_top->set_image(button_sound_on_img);\n\t\tplay = false;}\n\t\telse\n\t\t\t{playback.play();\n\t\tbutton_sound_top->set_image(button_sound_off_img);\n\t\tplay = true;}\n\t}\n}\n\nvoid Menu::changing()\n{\n\tclan::Point current = m_window.get_ic().get_mouse().get_position();\n\n\tif(\tcurrent.x >414 && current.x<607 && current.y>490 && current.y<518)\n\t{\n\t\tbutton_world_top->set_geometry(clan::Rect( -94, -20, clan::Size(368, 72)));\n\t\tm_change=1;\n\t}\n\telse if (current.x >414 && current.x<607 && current.y>540 && current.y<568)\n\t{\n\t\tbutton_editor_top->set_geometry(clan::Rect( -94, -20, clan::Size(368, 72)));\n\t\tm_change=2;\n\t}\n\telse if (current.x >414 && current.x<607 && current.y>590 && current.y<618)\n\t{\n\t\tbutton_exit_top->set_geometry(clan::Rect( -94, -20, clan::Size(368, 72)));\n\t\tm_change=3;\n\t}\n\telse if(m_change>0)\n\t{\n\t\tif(m_change==1)\n\t\t\tbutton_world_top->set_geometry(clan::Rect( -92, -18, clan::Size(364, 68)));\n\t\telse if(m_change==2)\n\t\t\tbutton_editor_top->set_geometry(clan::Rect( -92, -18, clan::Size(364, 68)));\n\t\telse if(m_change==3)\n\t\t\tbutton_exit_top->set_geometry(clan::Rect( -92, -18, clan::Size(364, 68)));\n\n\t\tm_change=0;\n\t}\n}<|endoftext|>"}
{"text":"<commit_before>#include \"MultiPropertyScorer.h\"\r\n#include <util\/profiler\/ProfilerGroup.h>\r\n\r\nusing namespace std;\r\nusing namespace sf1r;\r\n\r\ndouble MultiPropertyScorer::score(\r\n    const std::vector<RankQueryProperty>& rankQueryProperties,\r\n    const std::vector<boost::shared_ptr<PropertyRanker> >& propertyRankers\r\n)\r\n{\r\n    CREATE_PROFILER ( compute_score, \"SearchManager\", \"doSearch_: compute score in multipropertyscorer\");\r\n    CREATE_PROFILER ( get_doc_item, \"SearchManager\", \"doSearch_: get doc_item\");\r\n\r\n    DocumentIterator* pEntry = 0;\r\n    double score = 0.0F;\r\n    size_t numProperties = rankQueryProperties.size();\r\n    for (size_t i = 0; i < numProperties; ++i)\r\n    {\r\n        pEntry = docIteratorList_[i];\r\n        if (pEntry && pEntry->isCurrent())\r\n        {\r\n            double weight = propertyWeightList_[i];\r\n            if(pEntry->isScorer())\r\n            {\r\n                score += weight * pEntry->score(rankQueryProperties[i],propertyRankers[i]);\r\n            }\r\n            else\r\n            {\r\n                if (weight != 0.0F)\r\n                {\r\n                    rankDocumentProperty_.reset();\r\n                    rankDocumentProperty_.resize(rankQueryProperties[i].size());\r\n                    pEntry->doc_item(rankDocumentProperty_);\r\n\r\n                    \/\/START_PROFILER ( compute_score )\r\n                    score += weight * propertyRankers[i]->getScore(\r\n                        rankQueryProperties[i],\r\n                        rankDocumentProperty_\r\n                    );\r\n                    \/\/STOP_PROFILER ( compute_score )\r\n\r\n                    \/\/cout << i << \" - \" << weight << \" * \" << propertyRankers[i]->getScore(rankQueryProperties[i], rankDocumentProperty_) <<endl;\r\n\r\n                    pEntry->queryBoosting(score, weight); \/\/ if personal search available\r\n                }\r\n            }\r\n        }\r\n    }\r\n\r\n    if (! (score < (numeric_limits<float>::max) ()))\r\n    {\r\n        score = (numeric_limits<float>::max) ();\r\n    }\r\n\r\n    return score;\r\n}\r\n\r\nvoid MultiPropertyScorer::print(int level)\r\n{\r\n    cout << std::string(level*4, ' ') << \"|--[ \"<< \"MultiPropertyScorer current: \" << current_<<\" \"<< currDoc_ << \" ]\"<< endl;\r\n\r\n    DocumentIterator* pEntry;\r\n    for (size_t i = 0; i < docIteratorList_.size(); ++i)\r\n    {\r\n        pEntry = docIteratorList_[i];\r\n        if (pEntry\/* && pEntry->isCurrent()*\/)\r\n        {\r\n            pEntry->print(level+1);\r\n        }\r\n    }\r\n}\r\n<commit_msg>tiny adjust for scoring,but will improve performance a lot<commit_after>#include \"MultiPropertyScorer.h\"\r\n#include <util\/profiler\/ProfilerGroup.h>\r\n\r\nusing namespace std;\r\nusing namespace sf1r;\r\n\r\ndouble MultiPropertyScorer::score(\r\n    const std::vector<RankQueryProperty>& rankQueryProperties,\r\n    const std::vector<boost::shared_ptr<PropertyRanker> >& propertyRankers\r\n)\r\n{\r\n    CREATE_PROFILER ( compute_score, \"SearchManager\", \"doSearch_: compute score in multipropertyscorer\");\r\n    CREATE_PROFILER ( get_doc_item, \"SearchManager\", \"doSearch_: get doc_item\");\r\n\r\n    DocumentIterator* pEntry = 0;\r\n    double score = 0.0F;\r\n    size_t numProperties = rankQueryProperties.size();\r\n    for (size_t i = 0; i < numProperties; ++i)\r\n    {\r\n        pEntry = docIteratorList_[i];\r\n        if (pEntry && pEntry->isCurrent())\r\n        {\r\n            double weight = propertyWeightList_[i];\r\n            if(pEntry->isScorer())\r\n            {\r\n                score += weight * pEntry->score(rankQueryProperties[i],propertyRankers[i]);\r\n            }\r\n            else\r\n            {\r\n                if (weight != 0.0F)\r\n                {\r\n                    \/\/rankDocumentProperty_.reset();\r\n                    rankDocumentProperty_.resize(rankQueryProperties[i].size());\r\n                    pEntry->doc_item(rankDocumentProperty_);\r\n\r\n                    \/\/START_PROFILER ( compute_score )\r\n                    score += weight * propertyRankers[i]->getScore(\r\n                        rankQueryProperties[i],\r\n                        rankDocumentProperty_\r\n                    );\r\n                    \/\/STOP_PROFILER ( compute_score )\r\n\r\n                    \/\/cout << i << \" - \" << weight << \" * \" << propertyRankers[i]->getScore(rankQueryProperties[i], rankDocumentProperty_) <<endl;\r\n\r\n                    pEntry->queryBoosting(score, weight); \/\/ if personal search available\r\n                }\r\n            }\r\n        }\r\n    }\r\n\r\n    if (! (score < (numeric_limits<float>::max) ()))\r\n    {\r\n        score = (numeric_limits<float>::max) ();\r\n    }\r\n\r\n    return score;\r\n}\r\n\r\nvoid MultiPropertyScorer::print(int level)\r\n{\r\n    cout << std::string(level*4, ' ') << \"|--[ \"<< \"MultiPropertyScorer current: \" << current_<<\" \"<< currDoc_ << \" ]\"<< endl;\r\n\r\n    DocumentIterator* pEntry;\r\n    for (size_t i = 0; i < docIteratorList_.size(); ++i)\r\n    {\r\n        pEntry = docIteratorList_[i];\r\n        if (pEntry\/* && pEntry->isCurrent()*\/)\r\n        {\r\n            pEntry->print(level+1);\r\n        }\r\n    }\r\n}\r\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#ifndef METHCLA_AUDIO_IO_DRIVER_HPP_INCLUDED\n#define METHCLA_AUDIO_IO_DRIVER_HPP_INCLUDED\n\n#include \"Methcla\/Audio.hpp\"\n#include <boost\/cstdint.hpp>\n\nnamespace Methcla { namespace Audio { namespace IO {\n\nclass Driver : public Methcla::Audio::TimeInterface\n{\npublic:\n    struct Options\n    {\n        double sampleRate = -1.;\n        int numInputs = -1;\n        int numOutputs = -1;\n        int bufferSize = -1;\n        int blockSize = -1;\n    };\n\n    typedef void (*ProcessCallback)(\n        void* data,\n        Methcla_Time currentTime,\n        size_t numFrames,\n        const sample_t* const* inputs,\n        sample_t* const* outputs\n        );\n\n    Driver(Options options);\n    virtual ~Driver();\n\n    void setProcessCallback(ProcessCallback callback, void* data);\n\n    virtual double sampleRate() const = 0;\n    virtual size_t numInputs() const = 0;\n    virtual size_t numOutputs() const = 0;\n    virtual size_t bufferSize() const = 0;\n\n    size_t blockSize() const;\n\n    virtual Methcla_Time currentTime() const override;\n\n    virtual void start() = 0;\n    virtual void stop() = 0;\n\n    static sample_t** makeBuffers(size_t numChannels, size_t numFrames);\n    static void freeBuffers(size_t numChannels, sample_t** buffers);\n\nprotected:\n    void process(Methcla_Time currentTime, size_t numFrames, const sample_t* const* inputs, sample_t* const* outputs);\n\nprivate:\n    ProcessCallback m_processCallback;\n    void*           m_processData;\n    size_t          m_blockSize;\n};\n\n\/\/* Instantiate the default driver for the current platform.\nDriver* defaultPlatformDriver(Driver::Options options);\n\n} } }\n\n#endif \/\/ METHCLA_AUDIO_IO_DRIVER_HPP_INCLUDED\n<commit_msg>Include cstdint instead of boost header<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#ifndef METHCLA_AUDIO_IO_DRIVER_HPP_INCLUDED\n#define METHCLA_AUDIO_IO_DRIVER_HPP_INCLUDED\n\n#include \"Methcla\/Audio.hpp\"\n#include <cstdint>\n\nnamespace Methcla { namespace Audio { namespace IO {\n\nclass Driver : public Methcla::Audio::TimeInterface\n{\npublic:\n    struct Options\n    {\n        double sampleRate = -1.;\n        int numInputs = -1;\n        int numOutputs = -1;\n        int bufferSize = -1;\n        int blockSize = -1;\n    };\n\n    typedef void (*ProcessCallback)(\n        void* data,\n        Methcla_Time currentTime,\n        size_t numFrames,\n        const sample_t* const* inputs,\n        sample_t* const* outputs\n        );\n\n    Driver(Options options);\n    virtual ~Driver();\n\n    void setProcessCallback(ProcessCallback callback, void* data);\n\n    virtual double sampleRate() const = 0;\n    virtual size_t numInputs() const = 0;\n    virtual size_t numOutputs() const = 0;\n    virtual size_t bufferSize() const = 0;\n\n    size_t blockSize() const;\n\n    virtual Methcla_Time currentTime() const override;\n\n    virtual void start() = 0;\n    virtual void stop() = 0;\n\n    static sample_t** makeBuffers(size_t numChannels, size_t numFrames);\n    static void freeBuffers(size_t numChannels, sample_t** buffers);\n\nprotected:\n    void process(Methcla_Time currentTime, size_t numFrames, const sample_t* const* inputs, sample_t* const* outputs);\n\nprivate:\n    ProcessCallback m_processCallback;\n    void*           m_processData;\n    size_t          m_blockSize;\n};\n\n\/\/* Instantiate the default driver for the current platform.\nDriver* defaultPlatformDriver(Driver::Options options);\n\n} } }\n\n#endif \/\/ METHCLA_AUDIO_IO_DRIVER_HPP_INCLUDED\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 \"tensorflow\/core\/kernels\/data\/zip_dataset_op.h\"\n\n#include \"tensorflow\/core\/framework\/partial_tensor_shape.h\"\n#include \"tensorflow\/core\/framework\/tensor.h\"\n#include \"tensorflow\/core\/kernels\/data\/name_utils.h\"\n\nnamespace tensorflow {\nnamespace data {\n\n\/\/ See documentation in ..\/..\/ops\/dataset_ops.cc for a high-level\n\/\/ description of the following op.\n\n\/* static *\/ constexpr const char* const ZipDatasetOp::kDatasetType;\n\/* static *\/ constexpr const char* const ZipDatasetOp::kInputDatasets;\n\/* static *\/ constexpr const char* const ZipDatasetOp::kOutputTypes;\n\/* static *\/ constexpr const char* const ZipDatasetOp::kOutputShapes;\n\/* static *\/ constexpr const char* const ZipDatasetOp::kNumInputDatasets;\n\nconstexpr char kInputImplsEmpty[] = \"input_impls_empty\";\n\nclass ZipDatasetOp::Dataset : public DatasetBase {\n public:\n  explicit Dataset(OpKernelContext* ctx,\n                   const std::vector<DatasetBase*>& inputs)\n      : DatasetBase(DatasetContext(ctx)), inputs_(inputs) {\n    for (const auto& input : inputs_) {\n      input->Ref();\n      for (DataType dt : input->output_dtypes()) {\n        output_dtypes_.push_back(dt);\n      }\n      output_shapes_.insert(output_shapes_.end(),\n                            input->output_shapes().begin(),\n                            input->output_shapes().end());\n    }\n  }\n\n  ~Dataset() override {\n    for (const auto& input : inputs_) {\n      input->Unref();\n    }\n  }\n\n  std::unique_ptr<IteratorBase> MakeIteratorInternal(\n      const string& prefix) const override {\n    return absl::make_unique<Iterator>(Iterator::Params{\n        this, name_utils::IteratorPrefix(kDatasetType, prefix)});\n  }\n\n  const DataTypeVector& output_dtypes() const override {\n    return output_dtypes_;\n  }\n\n  const std::vector<PartialTensorShape>& output_shapes() const override {\n    return output_shapes_;\n  }\n\n  string DebugString() const override {\n    return name_utils::DatasetDebugString(kDatasetType);\n  }\n\n  int64 Cardinality() const override {\n    int64 result = kInfiniteCardinality;\n    for (const auto& input : inputs_) {\n      int64 n = input->Cardinality();\n      if (n == kUnknownCardinality) {\n        return kUnknownCardinality;\n      }\n      if (n != kInfiniteCardinality &&\n          (result == kInfiniteCardinality || n < result)) {\n        result = n;\n      }\n    }\n    return result;\n  }\n\n  Status CheckExternalState() const override {\n    for (const auto& input : inputs_) {\n      TF_RETURN_IF_ERROR(input->CheckExternalState());\n    }\n    return Status::OK();\n  }\n\n protected:\n  Status AsGraphDefInternal(SerializationContext* ctx,\n                            DatasetGraphDefBuilder* b,\n                            Node** output) const override {\n    std::vector<Node*> input_graph_nodes;\n    input_graph_nodes.reserve(inputs_.size());\n    for (const auto& input : inputs_) {\n      Node* input_node;\n      TF_RETURN_IF_ERROR(b->AddInputDataset(ctx, input, &input_node));\n      input_graph_nodes.emplace_back(input_node);\n    }\n    TF_RETURN_IF_ERROR(b->AddDataset(\n        this, {}, {std::make_pair(0, input_graph_nodes)}, {}, output));\n    return Status::OK();\n  }\n\n private:\n  class Iterator : public DatasetIterator<Dataset> {\n   public:\n    explicit Iterator(const Params& params)\n        : DatasetIterator<Dataset>(params) {}\n\n    Status Initialize(IteratorContext* ctx) override {\n      mutex_lock l(mu_);\n      input_impls_.resize(dataset()->inputs_.size());\n      for (size_t i = 0; i < input_impls_.size(); ++i) {\n        TF_RETURN_IF_ERROR(dataset()->inputs_[i]->MakeIterator(\n            ctx, strings::StrCat(prefix(), \"[\", i, \"]\"), &input_impls_[i]));\n      }\n      return Status::OK();\n    }\n\n    Status GetNextInternal(IteratorContext* ctx,\n                           std::vector<Tensor>* out_tensors,\n                           bool* end_of_sequence) override {\n      mutex_lock l(mu_);\n      if (input_impls_.empty()) {\n        *end_of_sequence = true;\n        return Status::OK();\n      }\n      out_tensors->clear();\n      out_tensors->reserve(dataset()->output_dtypes().size());\n      Status status = Status::OK();\n      *end_of_sequence = false;\n      for (const auto& input_impl : input_impls_) {\n        std::vector<Tensor> input_tensors;\n        bool end_of_sequence_component = false;\n        Status status_component = input_impl->GetNext(ctx, &input_tensors, &end_of_sequence_component);\n        if (end_of_sequence_component) {\n          *end_of_sequence = end_of_sequence_component;\n        }\n        if (!status_component.ok() && status.ok()) {\n          status = status_component;\n        }\n        \/\/ Even if there is error or end_of_sequence encountered,\n        \/\/ we should still run to \"flush out\" any record\n        \/\/ for each component, so that ignore_errors could be processed\n        \/\/ correctly.\n        \/\/ No need to copy the component data though so just continue here.\n        if (*end_of_sequence || !status.ok()) {\n          continue;\n        }\n        out_tensors->insert(out_tensors->end(), input_tensors.begin(),\n                            input_tensors.end());\n      }\n      if (*end_of_sequence || !status.ok()) {\n        out_tensors->clear();\n      }\n      if (*end_of_sequence) {\n        input_impls_.clear();\n      }\n      return status;\n    }\n\n   protected:\n    std::shared_ptr<model::Node> CreateNode(\n        IteratorContext* ctx, model::Node::Args args) const override {\n      \/\/ NOTE: Although this dataset may have multiple inputs, it always\n      \/\/ consumes one element per input to produce an output.\n      return model::MakeKnownRatioNode(std::move(args),\n                                       \/*ratio=*\/1);\n    }\n\n    Status SaveInternal(IteratorStateWriter* writer) override {\n      mutex_lock l(mu_);\n      if (input_impls_.empty()) {\n        TF_RETURN_IF_ERROR(\n            writer->WriteScalar(full_name(kInputImplsEmpty), \"\"));\n      } else {\n        for (auto& input_impl : input_impls_)\n          TF_RETURN_IF_ERROR(SaveInput(writer, input_impl));\n      }\n      return Status::OK();\n    }\n\n    Status RestoreInternal(IteratorContext* ctx,\n                           IteratorStateReader* reader) override {\n      mutex_lock l(mu_);\n      if (reader->Contains(full_name(kInputImplsEmpty))) {\n        input_impls_.clear();\n      } else {\n        DCHECK_EQ(input_impls_.size(), dataset()->inputs_.size());\n        for (auto& input_impl : input_impls_)\n          TF_RETURN_IF_ERROR(RestoreInput(ctx, reader, input_impl));\n      }\n      return Status::OK();\n    }\n\n   private:\n    mutex mu_;\n    std::vector<std::unique_ptr<IteratorBase>> input_impls_ GUARDED_BY(mu_);\n  };\n\n  const std::vector<DatasetBase*> inputs_;\n  DataTypeVector output_dtypes_;\n  std::vector<PartialTensorShape> output_shapes_;\n};\n\nZipDatasetOp::ZipDatasetOp(OpKernelConstruction* ctx) : DatasetOpKernel(ctx) {}\n\nvoid ZipDatasetOp::MakeDataset(OpKernelContext* ctx, DatasetBase** output) {\n  std::vector<DatasetBase*> inputs;\n  for (size_t i = 0; i < ctx->num_inputs(); ++i) {\n    DatasetBase* input;\n    OP_REQUIRES_OK(ctx, GetDatasetFromVariantTensor(ctx->input(i), &input));\n    inputs.push_back(input);\n  }\n  *output = new Dataset(ctx, inputs);\n}\n\nnamespace {\nREGISTER_KERNEL_BUILDER(Name(\"ZipDataset\").Device(DEVICE_CPU), ZipDatasetOp);\n}  \/\/ namespace\n}  \/\/ namespace data\n}  \/\/ namespace tensorflow\n<commit_msg>Update based on feedback, as there is no need to flush when end-of-sequence is encountered.<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 \"tensorflow\/core\/kernels\/data\/zip_dataset_op.h\"\n\n#include \"tensorflow\/core\/framework\/partial_tensor_shape.h\"\n#include \"tensorflow\/core\/framework\/tensor.h\"\n#include \"tensorflow\/core\/kernels\/data\/name_utils.h\"\n\nnamespace tensorflow {\nnamespace data {\n\n\/\/ See documentation in ..\/..\/ops\/dataset_ops.cc for a high-level\n\/\/ description of the following op.\n\n\/* static *\/ constexpr const char* const ZipDatasetOp::kDatasetType;\n\/* static *\/ constexpr const char* const ZipDatasetOp::kInputDatasets;\n\/* static *\/ constexpr const char* const ZipDatasetOp::kOutputTypes;\n\/* static *\/ constexpr const char* const ZipDatasetOp::kOutputShapes;\n\/* static *\/ constexpr const char* const ZipDatasetOp::kNumInputDatasets;\n\nconstexpr char kInputImplsEmpty[] = \"input_impls_empty\";\n\nclass ZipDatasetOp::Dataset : public DatasetBase {\n public:\n  explicit Dataset(OpKernelContext* ctx,\n                   const std::vector<DatasetBase*>& inputs)\n      : DatasetBase(DatasetContext(ctx)), inputs_(inputs) {\n    for (const auto& input : inputs_) {\n      input->Ref();\n      for (DataType dt : input->output_dtypes()) {\n        output_dtypes_.push_back(dt);\n      }\n      output_shapes_.insert(output_shapes_.end(),\n                            input->output_shapes().begin(),\n                            input->output_shapes().end());\n    }\n  }\n\n  ~Dataset() override {\n    for (const auto& input : inputs_) {\n      input->Unref();\n    }\n  }\n\n  std::unique_ptr<IteratorBase> MakeIteratorInternal(\n      const string& prefix) const override {\n    return absl::make_unique<Iterator>(Iterator::Params{\n        this, name_utils::IteratorPrefix(kDatasetType, prefix)});\n  }\n\n  const DataTypeVector& output_dtypes() const override {\n    return output_dtypes_;\n  }\n\n  const std::vector<PartialTensorShape>& output_shapes() const override {\n    return output_shapes_;\n  }\n\n  string DebugString() const override {\n    return name_utils::DatasetDebugString(kDatasetType);\n  }\n\n  int64 Cardinality() const override {\n    int64 result = kInfiniteCardinality;\n    for (const auto& input : inputs_) {\n      int64 n = input->Cardinality();\n      if (n == kUnknownCardinality) {\n        return kUnknownCardinality;\n      }\n      if (n != kInfiniteCardinality &&\n          (result == kInfiniteCardinality || n < result)) {\n        result = n;\n      }\n    }\n    return result;\n  }\n\n  Status CheckExternalState() const override {\n    for (const auto& input : inputs_) {\n      TF_RETURN_IF_ERROR(input->CheckExternalState());\n    }\n    return Status::OK();\n  }\n\n protected:\n  Status AsGraphDefInternal(SerializationContext* ctx,\n                            DatasetGraphDefBuilder* b,\n                            Node** output) const override {\n    std::vector<Node*> input_graph_nodes;\n    input_graph_nodes.reserve(inputs_.size());\n    for (const auto& input : inputs_) {\n      Node* input_node;\n      TF_RETURN_IF_ERROR(b->AddInputDataset(ctx, input, &input_node));\n      input_graph_nodes.emplace_back(input_node);\n    }\n    TF_RETURN_IF_ERROR(b->AddDataset(\n        this, {}, {std::make_pair(0, input_graph_nodes)}, {}, output));\n    return Status::OK();\n  }\n\n private:\n  class Iterator : public DatasetIterator<Dataset> {\n   public:\n    explicit Iterator(const Params& params)\n        : DatasetIterator<Dataset>(params) {}\n\n    Status Initialize(IteratorContext* ctx) override {\n      mutex_lock l(mu_);\n      input_impls_.resize(dataset()->inputs_.size());\n      for (size_t i = 0; i < input_impls_.size(); ++i) {\n        TF_RETURN_IF_ERROR(dataset()->inputs_[i]->MakeIterator(\n            ctx, strings::StrCat(prefix(), \"[\", i, \"]\"), &input_impls_[i]));\n      }\n      return Status::OK();\n    }\n\n    Status GetNextInternal(IteratorContext* ctx,\n                           std::vector<Tensor>* out_tensors,\n                           bool* end_of_sequence) override {\n      mutex_lock l(mu_);\n      if (input_impls_.empty()) {\n        *end_of_sequence = true;\n        return Status::OK();\n      }\n      out_tensors->clear();\n      out_tensors->reserve(dataset()->output_dtypes().size());\n      Status status = Status::OK();\n      *end_of_sequence = false;\n      for (const auto& input_impl : input_impls_) {\n        std::vector<Tensor> input_tensors;\n        bool component_end_of_sequence = false;\n        Status component_status = input_impl->GetNext(ctx, &input_tensors, &component_end_of_sequence);\n        *end_of_sequence |= component_end_of_sequence;\n        if (!component_status.ok() && status.ok()) {\n          status.Update(component_status);\n        }\n        \/\/ Even if an error is encountered for one of the components,\n        \/\/ we need to make sure to advance all components, to keep them in sync.\n        if (!status.ok()) {\n          continue;\n        }\n        if (*end_of_sequence) {\n          break;\n\t}\n        out_tensors->insert(out_tensors->end(), input_tensors.begin(),\n                            input_tensors.end());\n      }\n      if (*end_of_sequence || !status.ok()) {\n        out_tensors->clear();\n      }\n      if (*end_of_sequence) {\n        input_impls_.clear();\n      }\n      return status;\n    }\n\n   protected:\n    std::shared_ptr<model::Node> CreateNode(\n        IteratorContext* ctx, model::Node::Args args) const override {\n      \/\/ NOTE: Although this dataset may have multiple inputs, it always\n      \/\/ consumes one element per input to produce an output.\n      return model::MakeKnownRatioNode(std::move(args),\n                                       \/*ratio=*\/1);\n    }\n\n    Status SaveInternal(IteratorStateWriter* writer) override {\n      mutex_lock l(mu_);\n      if (input_impls_.empty()) {\n        TF_RETURN_IF_ERROR(\n            writer->WriteScalar(full_name(kInputImplsEmpty), \"\"));\n      } else {\n        for (auto& input_impl : input_impls_)\n          TF_RETURN_IF_ERROR(SaveInput(writer, input_impl));\n      }\n      return Status::OK();\n    }\n\n    Status RestoreInternal(IteratorContext* ctx,\n                           IteratorStateReader* reader) override {\n      mutex_lock l(mu_);\n      if (reader->Contains(full_name(kInputImplsEmpty))) {\n        input_impls_.clear();\n      } else {\n        DCHECK_EQ(input_impls_.size(), dataset()->inputs_.size());\n        for (auto& input_impl : input_impls_)\n          TF_RETURN_IF_ERROR(RestoreInput(ctx, reader, input_impl));\n      }\n      return Status::OK();\n    }\n\n   private:\n    mutex mu_;\n    std::vector<std::unique_ptr<IteratorBase>> input_impls_ GUARDED_BY(mu_);\n  };\n\n  const std::vector<DatasetBase*> inputs_;\n  DataTypeVector output_dtypes_;\n  std::vector<PartialTensorShape> output_shapes_;\n};\n\nZipDatasetOp::ZipDatasetOp(OpKernelConstruction* ctx) : DatasetOpKernel(ctx) {}\n\nvoid ZipDatasetOp::MakeDataset(OpKernelContext* ctx, DatasetBase** output) {\n  std::vector<DatasetBase*> inputs;\n  for (size_t i = 0; i < ctx->num_inputs(); ++i) {\n    DatasetBase* input;\n    OP_REQUIRES_OK(ctx, GetDatasetFromVariantTensor(ctx->input(i), &input));\n    inputs.push_back(input);\n  }\n  *output = new Dataset(ctx, inputs);\n}\n\nnamespace {\nREGISTER_KERNEL_BUILDER(Name(\"ZipDataset\").Device(DEVICE_CPU), ZipDatasetOp);\n}  \/\/ namespace\n}  \/\/ namespace data\n}  \/\/ namespace tensorflow\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\/\/ See docs in ..\/ops\/math_ops.cc.\n\n\/\/ This file uses MKL CBLAS batched xGEMM for acceleration of TF Batch\n\/\/ Matrix-Matrix Multiplication (MatMul) operations.\n\/\/ We currently register this kernel only for MKL supported data\n\/\/ types (float, double, complex64, complex128). The macro INTEL_MKL is defined\n\/\/ by the build system only when MKL is chosen as an option at configure stage\n\/\/ and when it is undefined at build time, this file becomes an empty\n\/\/ compilation unit\n\n#define EIGEN_USE_THREADS\n\n#if defined(INTEL_MKL) && !defined(INTEL_MKL_DNN_ONLY)\n#include <vector>\n#include \"mkl_cblas.h\"\n#include \"third_party\/eigen3\/unsupported\/Eigen\/CXX11\/Tensor\"\n#include \"tensorflow\/core\/framework\/op.h\"\n#include \"tensorflow\/core\/framework\/op_kernel.h\"\n#include \"tensorflow\/core\/framework\/register_types.h\"\n#include \"tensorflow\/core\/framework\/tensor.h\"\n#include \"tensorflow\/core\/framework\/tensor_shape.h\"\n#include \"tensorflow\/core\/framework\/type_traits.h\"\n#include \"tensorflow\/core\/framework\/types.h\"\n#include \"tensorflow\/core\/kernels\/fill_functor.h\"\n#include \"tensorflow\/core\/platform\/logging.h\"\n#include \"tensorflow\/core\/platform\/types.h\"\n\nnamespace tensorflow {\n\ntypedef Eigen::ThreadPoolDevice CPUDevice;\n\ntemplate <typename Device, typename Scalar>\nclass BatchMatMulMkl : public OpKernel {\n public:\n  explicit BatchMatMulMkl(OpKernelConstruction *context) : OpKernel(context) {\n    OP_REQUIRES_OK(context, context->GetAttr(\"adj_x\", &adj_x_));\n    OP_REQUIRES_OK(context, context->GetAttr(\"adj_y\", &adj_y_));\n  }\n\n  virtual ~BatchMatMulMkl() {}\n\n  void Compute(OpKernelContext *ctx) override {\n    const Tensor &lhs = ctx->input(0);\n    const Tensor &rhs = ctx->input(1);\n    OP_REQUIRES(ctx, lhs.dims() == rhs.dims(),\n                errors::InvalidArgument(\"lhs and rhs has different ndims: \",\n                                        lhs.shape().DebugString(), \" vs. \",\n                                        rhs.shape().DebugString()));\n    const int ndims = lhs.dims();\n    OP_REQUIRES(\n        ctx, ndims >= 2,\n        errors::InvalidArgument(\"lhs and rhs ndims must be >= 2: \", ndims));\n    TensorShape out_shape;\n    for (int i = 0; i < ndims - 2; ++i) {\n      OP_REQUIRES(ctx, lhs.dim_size(i) == rhs.dim_size(i),\n                  errors::InvalidArgument(\n                      \"lhs.dim(\", i, \") and rhs.dim(\", i,\n                      \") must be the same: \", lhs.shape().DebugString(), \" vs \",\n                      rhs.shape().DebugString()));\n      out_shape.AddDim(lhs.dim_size(i));\n    }\n    auto batch_size = (ndims == 2) ? 1 : out_shape.num_elements();\n    auto lhs_rows = lhs.dim_size(ndims - 2);\n    auto lhs_cols = lhs.dim_size(ndims - 1);\n    auto rhs_rows = rhs.dim_size(ndims - 2);\n    auto rhs_cols = rhs.dim_size(ndims - 1);\n    if (adj_x_) std::swap(lhs_rows, lhs_cols);\n    if (adj_y_) std::swap(rhs_rows, rhs_cols);\n    OP_REQUIRES(ctx, lhs_cols == rhs_rows,\n                errors::InvalidArgument(\n                    \"lhs mismatch rhs shape: \", lhs_cols, \" vs. \", rhs_rows,\n                    \": \", lhs.shape().DebugString(), \" \",\n                    rhs.shape().DebugString(), \" \", adj_x_, \" \", adj_y_));\n    out_shape.AddDim(lhs_rows);\n    out_shape.AddDim(rhs_cols);\n    Tensor *out = nullptr;\n    OP_REQUIRES_OK(ctx, ctx->allocate_output(0, out_shape, &out));\n    if (out->NumElements() == 0) {\n      return;\n    }\n    if (lhs.NumElements() == 0 || rhs.NumElements() == 0) {\n      functor::SetZeroFunctor<Device, Scalar> f;\n      f(ctx->eigen_device<Device>(), out->flat<Scalar>());\n      return;\n    }\n\n    auto rhs_reshaped = rhs.template flat_inner_dims<Scalar, 3>();\n    auto lhs_reshaped = lhs.template flat_inner_dims<Scalar, 3>();\n    auto out_reshaped = out->template flat_inner_dims<Scalar, 3>();\n    const uint64 M = lhs_reshaped.dimension(adj_x_ ? 2 : 1);\n    const uint64 K = lhs_reshaped.dimension(adj_x_ ? 1 : 2);\n    const uint64 N = rhs_reshaped.dimension(adj_y_ ? 1 : 2);\n\n    std::vector<MKL_INT> m_array(batch_size, M);\n    std::vector<MKL_INT> n_array(batch_size, N);\n    std::vector<MKL_INT> k_array(batch_size, K);\n    std::vector<MKL_INT> lda_array(batch_size, adj_x_ ? M : K);\n    std::vector<MKL_INT> ldb_array(batch_size, adj_y_ ? K : N);\n    std::vector<MKL_INT> ldc_array(batch_size, N);\n    std::vector<MKL_INT> group_size(1, batch_size);\n    std::vector<const Scalar *> a_array;\n    std::vector<const Scalar *> b_array;\n    std::vector<Scalar *> c_array;\n    a_array.reserve(batch_size);\n    b_array.reserve(batch_size);\n    c_array.reserve(batch_size);\n    for (int64 i = 0; i < batch_size; i++) {\n      a_array.push_back(&lhs_reshaped(i, 0, 0));\n      b_array.push_back(&rhs_reshaped(i, 0, 0));\n      c_array.push_back(&out_reshaped(i, 0, 0));\n    }\n\n    MklCblasGemmBatch(CblasRowMajor, adj_x_, adj_y_, &m_array[0], &n_array[0],\n                      &k_array[0], &a_array[0], &lda_array[0], &b_array[0],\n                      &ldb_array[0], &c_array[0], &ldc_array[0], 1,\n                      &group_size[0]);\n  }\n\n private:\n  bool adj_x_;\n  bool adj_y_;\n\n  void MklCblasGemmBatch(const CBLAS_LAYOUT Layout, const bool TransA,\n                         const bool TransB, const MKL_INT *M_Array,\n                         const MKL_INT *N_Array, const MKL_INT *K_Array,\n                         const float **A_Array, const MKL_INT *lda_Array,\n                         const float **B_Array, const MKL_INT *ldb_Array,\n                         float **C_Array, const MKL_INT *ldc_Array,\n                         const MKL_INT group_count, const MKL_INT *group_size) {\n    std::vector<CBLAS_TRANSPOSE> TransA_Array(\n        group_size[0], TransA ? CblasTrans : CblasNoTrans);\n    std::vector<CBLAS_TRANSPOSE> TransB_Array(\n        group_size[0], TransB ? CblasTrans : CblasNoTrans);\n    std::vector<float> alpha_Array(group_size[0], 1.0);\n    std::vector<float> beta_Array(group_size[0], 0.0);\n    cblas_sgemm_batch(Layout, &TransA_Array[0], &TransB_Array[0], M_Array,\n                      N_Array, K_Array, &alpha_Array[0], A_Array, lda_Array,\n                      B_Array, ldb_Array, &beta_Array[0], C_Array, ldc_Array,\n                      group_count, group_size);\n  }\n\n  void MklCblasGemmBatch(const CBLAS_LAYOUT Layout, const bool TransA,\n                         const bool TransB, const MKL_INT *M_Array,\n                         const MKL_INT *N_Array, const MKL_INT *K_Array,\n                         const double **A_Array, const MKL_INT *lda_Array,\n                         const double **B_Array, const MKL_INT *ldb_Array,\n                         double **C_Array, const MKL_INT *ldc_Array,\n                         const MKL_INT group_count, const MKL_INT *group_size) {\n    std::vector<CBLAS_TRANSPOSE> TransA_array(\n        group_size[0], TransA ? CblasTrans : CblasNoTrans);\n    std::vector<CBLAS_TRANSPOSE> TransB_array(\n        group_size[0], TransB ? CblasTrans : CblasNoTrans);\n    std::vector<double> alpha_Array(group_size[0], 1.0);\n    std::vector<double> beta_Array(group_size[0], 0.0);\n    cblas_dgemm_batch(Layout, &TransA_array[0], &TransB_array[0], M_Array,\n                      N_Array, K_Array, &alpha_Array[0], A_Array, lda_Array,\n                      B_Array, ldb_Array, &beta_Array[0], C_Array, ldc_Array,\n                      group_count, group_size);\n  }\n\n  void MklCblasGemmBatch(const CBLAS_LAYOUT Layout, const bool TransA,\n                         const bool TransB, const MKL_INT *M_Array,\n                         const MKL_INT *N_Array, const MKL_INT *K_Array,\n                         const complex64 **A_Array, const MKL_INT *lda_Array,\n                         const complex64 **B_Array, const MKL_INT *ldb_Array,\n                         complex64 **C_Array, const MKL_INT *ldc_Array,\n                         const MKL_INT group_count, const MKL_INT *group_size) {\n    std::vector<CBLAS_TRANSPOSE> TransA_array(\n        group_size[0], TransA ? CblasConjTrans : CblasNoTrans);\n    std::vector<CBLAS_TRANSPOSE> TransB_array(\n        group_size[0], TransB ? CblasConjTrans : CblasNoTrans);\n    std::vector<complex64> alpha_Array(group_size[0], {1.0f, 0.0f});\n    std::vector<complex64> beta_Array(group_size[0], {0.0f, 0.0f});\n    cblas_cgemm_batch(\n        Layout, &TransA_array[0], &TransB_array[0], M_Array, N_Array, K_Array,\n        static_cast<const void *>(&alpha_Array[0]),\n        reinterpret_cast<const void **>(A_Array), lda_Array,\n        reinterpret_cast<const void **>(B_Array), ldb_Array,\n        static_cast<const void *>(&beta_Array[0]),\n        reinterpret_cast<void **>(C_Array), ldc_Array, group_count, group_size);\n  }\n\n  void MklCblasGemmBatch(const CBLAS_LAYOUT Layout, const bool TransA,\n                         const bool TransB, const MKL_INT *M_Array,\n                         const MKL_INT *N_Array, const MKL_INT *K_Array,\n                         const complex128 **A_Array, const MKL_INT *lda_Array,\n                         const complex128 **B_Array, const MKL_INT *ldb_Array,\n                         complex128 **C_Array, const MKL_INT *ldc_Array,\n                         const MKL_INT group_count, const MKL_INT *group_size) {\n    std::vector<CBLAS_TRANSPOSE> TransA_array(\n        group_size[0], TransA ? CblasConjTrans : CblasNoTrans);\n    std::vector<CBLAS_TRANSPOSE> TransB_array(\n        group_size[0], TransB ? CblasConjTrans : CblasNoTrans);\n    std::vector<complex128> alpha_Array(group_size[0], {1.0f, 0.0f});\n    std::vector<complex128> beta_Array(group_size[0], {0.0f, 0.0f});\n    cblas_zgemm_batch(\n        Layout, &TransA_array[0], &TransB_array[0], M_Array, N_Array, K_Array,\n        static_cast<const void *>(&alpha_Array[0]),\n        reinterpret_cast<const void **>(A_Array), lda_Array,\n        reinterpret_cast<const void **>(B_Array), ldb_Array,\n        static_cast<const void *>(&beta_Array[0]),\n        reinterpret_cast<void **>(C_Array), ldc_Array, group_count, group_size);\n  }\n};\n\n#define REGISTER_BATCH_MATMUL_MKL(TYPE)                                 \\\n  REGISTER_KERNEL_BUILDER(                                              \\\n      Name(\"BatchMatMul\").Device(DEVICE_CPU).TypeConstraint<TYPE>(\"T\"), \\\n      BatchMatMulMkl<CPUDevice, TYPE>)\n\n#ifdef ENABLE_MKL\nTF_CALL_float(REGISTER_BATCH_MATMUL_MKL);\nTF_CALL_double(REGISTER_BATCH_MATMUL_MKL);\nTF_CALL_complex64(REGISTER_BATCH_MATMUL_MKL);\nTF_CALL_complex128(REGISTER_BATCH_MATMUL_MKL);\n#endif  \/\/ ENABLE_MKL\n\n}  \/\/ end namespace tensorflow\n#endif\n<commit_msg>BatchMatMulV2 op support<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\/\/ See docs in ..\/ops\/math_ops.cc.\n\n\/\/ This file uses MKL CBLAS batched xGEMM for acceleration of TF Batch\n\/\/ Matrix-Matrix Multiplication (MatMul) operations.\n\/\/ We currently register this kernel only for MKL supported data\n\/\/ types (float, double, complex64, complex128). The macro INTEL_MKL is defined\n\/\/ by the build system only when MKL is chosen as an option at configure stage\n\/\/ and when it is undefined at build time, this file becomes an empty\n\/\/ compilation unit\n\n#define EIGEN_USE_THREADS\n\n#if defined(INTEL_MKL) && !defined(INTEL_MKL_DNN_ONLY)\n#include <vector>\n#include \"mkl_cblas.h\"\n#include \"third_party\/eigen3\/unsupported\/Eigen\/CXX11\/Tensor\"\n#include \"tensorflow\/core\/framework\/op.h\"\n#include \"tensorflow\/core\/framework\/op_kernel.h\"\n#include \"tensorflow\/core\/framework\/register_types.h\"\n#include \"tensorflow\/core\/framework\/tensor.h\"\n#include \"tensorflow\/core\/framework\/tensor_shape.h\"\n#include \"tensorflow\/core\/framework\/type_traits.h\"\n#include \"tensorflow\/core\/framework\/types.h\"\n#include \"tensorflow\/core\/kernels\/batch_matmul_op_impl.h\"\n#include \"tensorflow\/core\/kernels\/fill_functor.h\"\n#include \"tensorflow\/core\/platform\/logging.h\"\n#include \"tensorflow\/core\/platform\/types.h\"\n\nnamespace tensorflow {\n\ntypedef Eigen::ThreadPoolDevice CPUDevice;\n\ntemplate <typename Device, typename Scalar>\nclass BatchMatMulMkl : public OpKernel {\n public:\n  explicit BatchMatMulMkl(OpKernelConstruction *context) : OpKernel(context) {\n    OP_REQUIRES_OK(context, context->GetAttr(\"adj_x\", &adj_x_));\n    OP_REQUIRES_OK(context, context->GetAttr(\"adj_y\", &adj_y_));\n  }\n\n  virtual ~BatchMatMulMkl() {}\n\n  void Compute(OpKernelContext *ctx) override {\n    const Tensor &lhs = ctx->input(0);\n    const Tensor &rhs = ctx->input(1);\n    OP_REQUIRES(ctx, lhs.dims() == rhs.dims(),\n                errors::InvalidArgument(\"lhs and rhs has different ndims: \",\n                                        lhs.shape().DebugString(), \" vs. \",\n                                        rhs.shape().DebugString()));\n    const int ndims = lhs.dims();\n    OP_REQUIRES(\n        ctx, ndims >= 2,\n        errors::InvalidArgument(\"lhs and rhs ndims must be >= 2: \", ndims));\n    TensorShape out_shape;\n    for (int i = 0; i < ndims - 2; ++i) {\n      OP_REQUIRES(ctx, lhs.dim_size(i) == rhs.dim_size(i),\n                  errors::InvalidArgument(\n                      \"lhs.dim(\", i, \") and rhs.dim(\", i,\n                      \") must be the same: \", lhs.shape().DebugString(), \" vs \",\n                      rhs.shape().DebugString()));\n      out_shape.AddDim(lhs.dim_size(i));\n    }\n    auto batch_size = (ndims == 2) ? 1 : out_shape.num_elements();\n    auto lhs_rows = lhs.dim_size(ndims - 2);\n    auto lhs_cols = lhs.dim_size(ndims - 1);\n    auto rhs_rows = rhs.dim_size(ndims - 2);\n    auto rhs_cols = rhs.dim_size(ndims - 1);\n    if (adj_x_) std::swap(lhs_rows, lhs_cols);\n    if (adj_y_) std::swap(rhs_rows, rhs_cols);\n    OP_REQUIRES(ctx, lhs_cols == rhs_rows,\n                errors::InvalidArgument(\n                    \"lhs mismatch rhs shape: \", lhs_cols, \" vs. \", rhs_rows,\n                    \": \", lhs.shape().DebugString(), \" \",\n                    rhs.shape().DebugString(), \" \", adj_x_, \" \", adj_y_));\n    out_shape.AddDim(lhs_rows);\n    out_shape.AddDim(rhs_cols);\n    Tensor *out = nullptr;\n    OP_REQUIRES_OK(ctx, ctx->allocate_output(0, out_shape, &out));\n    if (out->NumElements() == 0) {\n      return;\n    }\n    if (lhs.NumElements() == 0 || rhs.NumElements() == 0) {\n      functor::SetZeroFunctor<Device, Scalar> f;\n      f(ctx->eigen_device<Device>(), out->flat<Scalar>());\n      return;\n    }\n\n    auto rhs_reshaped = rhs.template flat_inner_dims<Scalar, 3>();\n    auto lhs_reshaped = lhs.template flat_inner_dims<Scalar, 3>();\n    auto out_reshaped = out->template flat_inner_dims<Scalar, 3>();\n    const uint64 M = lhs_reshaped.dimension(adj_x_ ? 2 : 1);\n    const uint64 K = lhs_reshaped.dimension(adj_x_ ? 1 : 2);\n    const uint64 N = rhs_reshaped.dimension(adj_y_ ? 1 : 2);\n\n    std::vector<MKL_INT> m_array(batch_size, M);\n    std::vector<MKL_INT> n_array(batch_size, N);\n    std::vector<MKL_INT> k_array(batch_size, K);\n    std::vector<MKL_INT> lda_array(batch_size, adj_x_ ? M : K);\n    std::vector<MKL_INT> ldb_array(batch_size, adj_y_ ? K : N);\n    std::vector<MKL_INT> ldc_array(batch_size, N);\n    std::vector<MKL_INT> group_size(1, batch_size);\n    std::vector<const Scalar *> a_array;\n    std::vector<const Scalar *> b_array;\n    std::vector<Scalar *> c_array;\n    a_array.reserve(batch_size);\n    b_array.reserve(batch_size);\n    c_array.reserve(batch_size);\n    for (int64 i = 0; i < batch_size; i++) {\n      a_array.push_back(&lhs_reshaped(i, 0, 0));\n      b_array.push_back(&rhs_reshaped(i, 0, 0));\n      c_array.push_back(&out_reshaped(i, 0, 0));\n    }\n\n    MklCblasGemmBatch(CblasRowMajor, adj_x_, adj_y_, &m_array[0], &n_array[0],\n                      &k_array[0], &a_array[0], &lda_array[0], &b_array[0],\n                      &ldb_array[0], &c_array[0], &ldc_array[0], 1,\n                      &group_size[0]);\n  }\n\n private:\n  bool adj_x_;\n  bool adj_y_;\n\n  void MklCblasGemmBatch(const CBLAS_LAYOUT Layout, const bool TransA,\n                         const bool TransB, const MKL_INT *M_Array,\n                         const MKL_INT *N_Array, const MKL_INT *K_Array,\n                         const float **A_Array, const MKL_INT *lda_Array,\n                         const float **B_Array, const MKL_INT *ldb_Array,\n                         float **C_Array, const MKL_INT *ldc_Array,\n                         const MKL_INT group_count, const MKL_INT *group_size) {\n    std::vector<CBLAS_TRANSPOSE> TransA_Array(\n        group_size[0], TransA ? CblasTrans : CblasNoTrans);\n    std::vector<CBLAS_TRANSPOSE> TransB_Array(\n        group_size[0], TransB ? CblasTrans : CblasNoTrans);\n    std::vector<float> alpha_Array(group_size[0], 1.0);\n    std::vector<float> beta_Array(group_size[0], 0.0);\n    cblas_sgemm_batch(Layout, &TransA_Array[0], &TransB_Array[0], M_Array,\n                      N_Array, K_Array, &alpha_Array[0], A_Array, lda_Array,\n                      B_Array, ldb_Array, &beta_Array[0], C_Array, ldc_Array,\n                      group_count, group_size);\n  }\n\n  void MklCblasGemmBatch(const CBLAS_LAYOUT Layout, const bool TransA,\n                         const bool TransB, const MKL_INT *M_Array,\n                         const MKL_INT *N_Array, const MKL_INT *K_Array,\n                         const double **A_Array, const MKL_INT *lda_Array,\n                         const double **B_Array, const MKL_INT *ldb_Array,\n                         double **C_Array, const MKL_INT *ldc_Array,\n                         const MKL_INT group_count, const MKL_INT *group_size) {\n    std::vector<CBLAS_TRANSPOSE> TransA_array(\n        group_size[0], TransA ? CblasTrans : CblasNoTrans);\n    std::vector<CBLAS_TRANSPOSE> TransB_array(\n        group_size[0], TransB ? CblasTrans : CblasNoTrans);\n    std::vector<double> alpha_Array(group_size[0], 1.0);\n    std::vector<double> beta_Array(group_size[0], 0.0);\n    cblas_dgemm_batch(Layout, &TransA_array[0], &TransB_array[0], M_Array,\n                      N_Array, K_Array, &alpha_Array[0], A_Array, lda_Array,\n                      B_Array, ldb_Array, &beta_Array[0], C_Array, ldc_Array,\n                      group_count, group_size);\n  }\n\n  void MklCblasGemmBatch(const CBLAS_LAYOUT Layout, const bool TransA,\n                         const bool TransB, const MKL_INT *M_Array,\n                         const MKL_INT *N_Array, const MKL_INT *K_Array,\n                         const complex64 **A_Array, const MKL_INT *lda_Array,\n                         const complex64 **B_Array, const MKL_INT *ldb_Array,\n                         complex64 **C_Array, const MKL_INT *ldc_Array,\n                         const MKL_INT group_count, const MKL_INT *group_size) {\n    std::vector<CBLAS_TRANSPOSE> TransA_array(\n        group_size[0], TransA ? CblasConjTrans : CblasNoTrans);\n    std::vector<CBLAS_TRANSPOSE> TransB_array(\n        group_size[0], TransB ? CblasConjTrans : CblasNoTrans);\n    std::vector<complex64> alpha_Array(group_size[0], {1.0f, 0.0f});\n    std::vector<complex64> beta_Array(group_size[0], {0.0f, 0.0f});\n    cblas_cgemm_batch(\n        Layout, &TransA_array[0], &TransB_array[0], M_Array, N_Array, K_Array,\n        static_cast<const void *>(&alpha_Array[0]),\n        reinterpret_cast<const void **>(A_Array), lda_Array,\n        reinterpret_cast<const void **>(B_Array), ldb_Array,\n        static_cast<const void *>(&beta_Array[0]),\n        reinterpret_cast<void **>(C_Array), ldc_Array, group_count, group_size);\n  }\n\n  void MklCblasGemmBatch(const CBLAS_LAYOUT Layout, const bool TransA,\n                         const bool TransB, const MKL_INT *M_Array,\n                         const MKL_INT *N_Array, const MKL_INT *K_Array,\n                         const complex128 **A_Array, const MKL_INT *lda_Array,\n                         const complex128 **B_Array, const MKL_INT *ldb_Array,\n                         complex128 **C_Array, const MKL_INT *ldc_Array,\n                         const MKL_INT group_count, const MKL_INT *group_size) {\n    std::vector<CBLAS_TRANSPOSE> TransA_array(\n        group_size[0], TransA ? CblasConjTrans : CblasNoTrans);\n    std::vector<CBLAS_TRANSPOSE> TransB_array(\n        group_size[0], TransB ? CblasConjTrans : CblasNoTrans);\n    std::vector<complex128> alpha_Array(group_size[0], {1.0f, 0.0f});\n    std::vector<complex128> beta_Array(group_size[0], {0.0f, 0.0f});\n    cblas_zgemm_batch(\n        Layout, &TransA_array[0], &TransB_array[0], M_Array, N_Array, K_Array,\n        static_cast<const void *>(&alpha_Array[0]),\n        reinterpret_cast<const void **>(A_Array), lda_Array,\n        reinterpret_cast<const void **>(B_Array), ldb_Array,\n        static_cast<const void *>(&beta_Array[0]),\n        reinterpret_cast<void **>(C_Array), ldc_Array, group_count, group_size);\n  }\n};\n\n#define REGISTER_BATCH_MATMUL_MKL(TYPE)                                   \\\n  REGISTER_KERNEL_BUILDER(                                                \\\n      Name(\"BatchMatMul\").Device(DEVICE_CPU).TypeConstraint<TYPE>(\"T\"),   \\\n      BatchMatMulMkl<CPUDevice, TYPE>)                                    \\\n  REGISTER_KERNEL_BUILDER(                                                \\\n      Name(\"BatchMatMulV2\").Device(DEVICE_CPU).TypeConstraint<TYPE>(\"T\"), \\\n      BatchMatMulV2Op<CPUDevice, TYPE>)\n\n#ifdef ENABLE_MKL\nTF_CALL_float(REGISTER_BATCH_MATMUL_MKL);\nTF_CALL_double(REGISTER_BATCH_MATMUL_MKL);\nTF_CALL_complex64(REGISTER_BATCH_MATMUL_MKL);\nTF_CALL_complex128(REGISTER_BATCH_MATMUL_MKL);\n#endif  \/\/ ENABLE_MKL\n\n}  \/\/ end namespace tensorflow\n#endif\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\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\n\/\/ See docs in ..\/ops\/io_ops.cc.\n\n#include <string>\n#include <vector>\n\n#include \"tensorflow\/core\/framework\/bounds_check.h\"\n#include \"tensorflow\/core\/framework\/op_kernel.h\"\n#include \"tensorflow\/core\/framework\/tensor.h\"\n#include \"tensorflow\/core\/framework\/types.h\"\n#include \"tensorflow\/core\/framework\/types.pb.h\"\n#include \"tensorflow\/core\/kernels\/save_restore_tensor.h\"\n#include \"tensorflow\/core\/lib\/core\/status.h\"\n#include \"tensorflow\/core\/lib\/io\/path.h\"\n#include \"tensorflow\/core\/platform\/env.h\"\n#include \"tensorflow\/core\/platform\/logging.h\"\n#include \"tensorflow\/core\/platform\/types.h\"\n#include \"tensorflow\/core\/util\/saved_tensor_slice_util.h\"\n#include \"tensorflow\/core\/util\/tensor_bundle\/tensor_bundle.h\"\n#include \"tensorflow\/core\/util\/tensor_slice_reader.h\"\n\nnamespace tensorflow {\n\nnamespace {\n\n\/\/ Shared validations of the inputs to the SaveV2 and RestoreV2 ops.\nvoid ValidateInputs(bool is_save_op, OpKernelContext* context,\n                    const Tensor& prefix, const Tensor& tensor_names,\n                    const Tensor& shape_and_slices) {\n  const int kFixedInputs = 3;  \/\/ Prefix, tensor names, shape_and_slices.\n  const int num_tensors = static_cast<int>(tensor_names.NumElements());\n  OP_REQUIRES(\n      context, prefix.NumElements() == 1,\n      errors::InvalidArgument(\"Input prefix should have a single element, got \",\n                              prefix.NumElements(), \" instead.\"));\n  OP_REQUIRES(context,\n              TensorShapeUtils::IsVector(tensor_names.shape()) &&\n                  TensorShapeUtils::IsVector(shape_and_slices.shape()),\n              errors::InvalidArgument(\n                  \"Input tensor_names and shape_and_slices \"\n                  \"should be an 1-D tensors, got \",\n                  tensor_names.shape().DebugString(), \" and \",\n                  shape_and_slices.shape().DebugString(), \" instead.\"));\n  OP_REQUIRES(context,\n              tensor_names.NumElements() == shape_and_slices.NumElements(),\n              errors::InvalidArgument(\"tensor_names and shape_and_slices \"\n                                      \"have different number of elements: \",\n                                      tensor_names.NumElements(), \" vs. \",\n                                      shape_and_slices.NumElements()));\n  OP_REQUIRES(context,\n              FastBoundsCheck(tensor_names.NumElements() + kFixedInputs,\n                              std::numeric_limits<int>::max()),\n              errors::InvalidArgument(\"Too many inputs to the op\"));\n  OP_REQUIRES(\n      context, shape_and_slices.NumElements() == num_tensors,\n      errors::InvalidArgument(\"Expected \", num_tensors,\n                              \" elements in shapes_and_slices, but got \",\n                              context->input(2).NumElements()));\n  if (is_save_op) {\n    OP_REQUIRES(context, context->num_inputs() == num_tensors + kFixedInputs,\n                errors::InvalidArgument(\n                    \"Got \", num_tensors, \" tensor names but \",\n                    context->num_inputs() - kFixedInputs, \" tensors.\"));\n    OP_REQUIRES(context, context->num_inputs() == num_tensors + kFixedInputs,\n                errors::InvalidArgument(\n                    \"Expected a total of \", num_tensors + kFixedInputs,\n                    \" inputs as input #1 (which is a string \"\n                    \"tensor of saved names) contains \",\n                    num_tensors, \" names, but received \", context->num_inputs(),\n                    \" inputs\"));\n  }\n}\n\n}  \/\/ namespace\n\n\/\/ Saves a list of named tensors using the tensor bundle library.\nclass SaveV2 : public OpKernel {\n public:\n  explicit SaveV2(OpKernelConstruction* context) : OpKernel(context) {}\n\n  void Compute(OpKernelContext* context) override {\n    const Tensor& prefix = context->input(0);\n    const Tensor& tensor_names = context->input(1);\n    const Tensor& shape_and_slices = context->input(2);\n    ValidateInputs(true \/* is save op *\/, context, prefix, tensor_names,\n                   shape_and_slices);\n\n    const int kFixedInputs = 3;  \/\/ Prefix, tensor names, shape_and_slices.\n    const int num_tensors = static_cast<int>(tensor_names.NumElements());\n    const string& prefix_string = prefix.scalar<tstring>()();\n    const auto& tensor_names_flat = tensor_names.flat<tstring>();\n    const auto& shape_and_slices_flat = shape_and_slices.flat<tstring>();\n\n    BundleWriter writer(Env::Default(), prefix_string);\n    OP_REQUIRES_OK(context, writer.status());\n    VLOG(1) << \"BundleWriter, prefix_string: \" << prefix_string;\n\n    for (int i = 0; i < num_tensors; ++i) {\n      const string& tensor_name = tensor_names_flat(i);\n      const Tensor& tensor = context->input(i + kFixedInputs);\n      VLOG(2) << \"Starting save of \" << tensor_name;\n\n      if (!shape_and_slices_flat(i).empty()) {\n        const string& shape_spec = shape_and_slices_flat(i);\n        TensorShape shape;\n        TensorSlice slice(tensor.dims());\n        TensorShape slice_shape;\n\n        OP_REQUIRES_OK(context, checkpoint::ParseShapeAndSlice(\n                                    shape_spec, &shape, &slice, &slice_shape));\n        OP_REQUIRES(context, slice_shape.IsSameSize(tensor.shape()),\n                    errors::InvalidArgument(\"Slice in shape_and_slice \"\n                                            \"specification does not match the \"\n                                            \"shape of the tensor to  save: \",\n                                            shape_spec, \", tensor: \",\n                                            tensor.shape().DebugString()));\n\n        OP_REQUIRES_OK(context,\n                       writer.AddSlice(tensor_name, shape, slice, tensor));\n      } else {\n        OP_REQUIRES_OK(context, writer.Add(tensor_name, tensor));\n      }\n\n      if (VLOG_IS_ON(5)) {\n        if (tensor.dtype() == DT_FLOAT) {\n          const float* t_data = tensor.flat<float>().data();\n          float min = std::numeric_limits<float>::infinity();\n          float max = -std::numeric_limits<float>::infinity();\n          double avg = 0.0;\n          for (int i = 0; i < tensor.NumElements(); ++i) {\n            if (t_data[i] < min) min = t_data[i];\n            if (t_data[i] > max) max = t_data[i];\n            avg += t_data[i];\n          }\n          VLOG(5) << \" min \" << min << \" max \" << max << \" avg \"\n                  << avg \/ tensor.NumElements() << \" total elts \"\n                  << tensor.NumElements();\n        }\n      }\n\n      VLOG(2) << \"Done save of \" << tensor_name;\n    }\n    OP_REQUIRES_OK(context, writer.Finish());\n    VLOG(1) << \"Done BundleWriter, prefix_string: \" << prefix_string;\n  }\n};\nREGISTER_KERNEL_BUILDER(Name(\"SaveV2\").Device(DEVICE_CPU), SaveV2);\n\n\/\/ Restores a list of named tensors from a tensor bundle (V2 checkpoint format).\nclass RestoreV2 : public OpKernel {\n public:\n  explicit RestoreV2(OpKernelConstruction* context) : OpKernel(context) {\n    OP_REQUIRES_OK(context, context->GetAttr(\"dtypes\", &dtypes_));\n  }\n\n  void Compute(OpKernelContext* context) override {\n    const Tensor& prefix = context->input(0);\n    const Tensor& tensor_names = context->input(1);\n    const Tensor& shape_and_slices = context->input(2);\n    OP_REQUIRES(context, tensor_names.NumElements() == dtypes_.size(),\n                errors::InvalidArgument(\"Got \", tensor_names.NumElements(),\n                                        \" tensor names, but \", dtypes_.size(),\n                                        \" expected dtypes.\"));\n    ValidateInputs(false \/* not save op *\/, context, prefix, tensor_names,\n                   shape_and_slices);\n\n    const string& prefix_string = prefix.scalar<tstring>()();\n\n    \/\/ Intention: we plan to use the RestoreV2 op as a backward-compatible\n    \/\/ reader as we upgrade to the V2 format.  This allows transparent upgrade.\n    \/\/ We here attempt to read a V1 checkpoint, if \"prefix_string\" does not\n    \/\/ refer to a V2 checkpoint.\n    Env* env = Env::Default();\n    std::vector<string> paths;\n    if (!env->GetMatchingPaths(MetaFilename(prefix_string), &paths).ok() ||\n        paths.empty()) {\n      \/\/ Cannot find V2's metadata file, so \"prefix_string\" does not point to a\n      \/\/ V2 checkpoint.  Invokes the V1 read path instead.\n      for (size_t i = 0; i < tensor_names.NumElements(); ++i) {\n        RestoreTensor(context, &checkpoint::OpenTableTensorSliceReader,\n                      \/* preferred_shard *\/ -1, \/* restore_slice *\/ true,\n                      \/* restore_index *\/ i);\n        if (!context->status().ok()) {\n          return;\n        }\n      }\n      return;\n    }\n    \/\/ If found, invokes the V2 reader.\n    OP_REQUIRES_OK(context, RestoreTensorsV2(context, prefix, tensor_names,\n                                             shape_and_slices, dtypes_));\n  }\n\n private:\n  \/\/ Expected dtypes of the to-restore tensors.\n  std::vector<DataType> dtypes_;\n};\nREGISTER_KERNEL_BUILDER(Name(\"RestoreV2\").Device(DEVICE_CPU), RestoreV2);\n\n\/\/ The final step in saving sharded V2 checkpoints: merges metadata files.\nclass MergeV2Checkpoints : public OpKernel {\n public:\n  explicit MergeV2Checkpoints(OpKernelConstruction* context)\n      : OpKernel(context) {\n    OP_REQUIRES_OK(context,\n                   context->GetAttr(\"delete_old_dirs\", &delete_old_dirs_));\n  }\n\n  void Compute(OpKernelContext* context) override {\n    const Tensor& checkpoint_prefixes = context->input(0);\n    const Tensor& destination_prefix = context->input(1);\n    OP_REQUIRES(context,\n                TensorShapeUtils::IsVector(checkpoint_prefixes.shape()),\n                errors::InvalidArgument(\n                    \"Input checkpoint_prefixes should be an 1-D tensor, got \",\n                    checkpoint_prefixes.shape().DebugString(), \" instead.\"));\n    OP_REQUIRES(context, TensorShapeUtils::IsScalar(destination_prefix.shape()),\n                errors::InvalidArgument(\n                    \"Input destination_prefix should be a scalar tensor, got \",\n                    destination_prefix.shape().DebugString(), \" instead.\"));\n\n    const gtl::ArraySlice<tstring> input_prefixes =\n        gtl::ArraySlice<tstring>(checkpoint_prefixes.flat<tstring>());\n    Env* env = Env::Default();\n    const string& merged_prefix = destination_prefix.scalar<tstring>()();\n    OP_REQUIRES_OK(\n        context, tensorflow::MergeBundles(env, input_prefixes, merged_prefix));\n\n    if (delete_old_dirs_) {\n      const string merged_dir(io::Dirname(merged_prefix));\n      for (const string& input_prefix : input_prefixes) {\n        const string dirname(io::Dirname(input_prefix));\n        if (dirname == merged_dir) continue;\n        Status status = env->DeleteDir(dirname);\n        \/\/ For sharded save, only the first delete will go through and all\n        \/\/ others will hit NotFound.  Use vlog to be less verbose.\n        if (!status.ok()) VLOG(1) << status;\n      }\n    }\n  }\n\n private:\n  \/\/ On merge, whether or not to delete the input (temporary) directories.\n  bool delete_old_dirs_;\n};\nREGISTER_KERNEL_BUILDER(Name(\"MergeV2Checkpoints\").Device(DEVICE_CPU),\n                        MergeV2Checkpoints);\n\n}  \/\/ namespace tensorflow\n<commit_msg>Ensure validation sticks in `save_restore_v2_ops.cc`<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\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\n\/\/ See docs in ..\/ops\/io_ops.cc.\n\n#include <string>\n#include <vector>\n\n#include \"tensorflow\/core\/framework\/bounds_check.h\"\n#include \"tensorflow\/core\/framework\/op_kernel.h\"\n#include \"tensorflow\/core\/framework\/tensor.h\"\n#include \"tensorflow\/core\/framework\/types.h\"\n#include \"tensorflow\/core\/framework\/types.pb.h\"\n#include \"tensorflow\/core\/kernels\/save_restore_tensor.h\"\n#include \"tensorflow\/core\/lib\/core\/status.h\"\n#include \"tensorflow\/core\/lib\/io\/path.h\"\n#include \"tensorflow\/core\/platform\/env.h\"\n#include \"tensorflow\/core\/platform\/logging.h\"\n#include \"tensorflow\/core\/platform\/types.h\"\n#include \"tensorflow\/core\/util\/saved_tensor_slice_util.h\"\n#include \"tensorflow\/core\/util\/tensor_bundle\/tensor_bundle.h\"\n#include \"tensorflow\/core\/util\/tensor_slice_reader.h\"\n\nnamespace tensorflow {\n\nnamespace {\n\n\/\/ Shared validations of the inputs to the SaveV2 and RestoreV2 ops.\nvoid ValidateInputs(bool is_save_op, OpKernelContext* context,\n                    const Tensor& prefix, const Tensor& tensor_names,\n                    const Tensor& shape_and_slices) {\n  const int kFixedInputs = 3;  \/\/ Prefix, tensor names, shape_and_slices.\n  const int num_tensors = static_cast<int>(tensor_names.NumElements());\n  OP_REQUIRES(\n      context, prefix.NumElements() == 1,\n      errors::InvalidArgument(\"Input prefix should have a single element, got \",\n                              prefix.NumElements(), \" instead.\"));\n  OP_REQUIRES(context,\n              TensorShapeUtils::IsVector(tensor_names.shape()) &&\n                  TensorShapeUtils::IsVector(shape_and_slices.shape()),\n              errors::InvalidArgument(\n                  \"Input tensor_names and shape_and_slices \"\n                  \"should be an 1-D tensors, got \",\n                  tensor_names.shape().DebugString(), \" and \",\n                  shape_and_slices.shape().DebugString(), \" instead.\"));\n  OP_REQUIRES(context,\n              tensor_names.NumElements() == shape_and_slices.NumElements(),\n              errors::InvalidArgument(\"tensor_names and shape_and_slices \"\n                                      \"have different number of elements: \",\n                                      tensor_names.NumElements(), \" vs. \",\n                                      shape_and_slices.NumElements()));\n  OP_REQUIRES(context,\n              FastBoundsCheck(tensor_names.NumElements() + kFixedInputs,\n                              std::numeric_limits<int>::max()),\n              errors::InvalidArgument(\"Too many inputs to the op\"));\n  OP_REQUIRES(\n      context, shape_and_slices.NumElements() == num_tensors,\n      errors::InvalidArgument(\"Expected \", num_tensors,\n                              \" elements in shapes_and_slices, but got \",\n                              context->input(2).NumElements()));\n  if (is_save_op) {\n    OP_REQUIRES(context, context->num_inputs() == num_tensors + kFixedInputs,\n                errors::InvalidArgument(\n                    \"Got \", num_tensors, \" tensor names but \",\n                    context->num_inputs() - kFixedInputs, \" tensors.\"));\n    OP_REQUIRES(context, context->num_inputs() == num_tensors + kFixedInputs,\n                errors::InvalidArgument(\n                    \"Expected a total of \", num_tensors + kFixedInputs,\n                    \" inputs as input #1 (which is a string \"\n                    \"tensor of saved names) contains \",\n                    num_tensors, \" names, but received \", context->num_inputs(),\n                    \" inputs\"));\n  }\n}\n\n}  \/\/ namespace\n\n\/\/ Saves a list of named tensors using the tensor bundle library.\nclass SaveV2 : public OpKernel {\n public:\n  explicit SaveV2(OpKernelConstruction* context) : OpKernel(context) {}\n\n  void Compute(OpKernelContext* context) override {\n    const Tensor& prefix = context->input(0);\n    const Tensor& tensor_names = context->input(1);\n    const Tensor& shape_and_slices = context->input(2);\n    ValidateInputs(true \/* is save op *\/, context, prefix, tensor_names,\n                   shape_and_slices);\n    if (!context->status().ok()) return;\n\n    const int kFixedInputs = 3;  \/\/ Prefix, tensor names, shape_and_slices.\n    const int num_tensors = static_cast<int>(tensor_names.NumElements());\n    const string& prefix_string = prefix.scalar<tstring>()();\n    const auto& tensor_names_flat = tensor_names.flat<tstring>();\n    const auto& shape_and_slices_flat = shape_and_slices.flat<tstring>();\n\n    BundleWriter writer(Env::Default(), prefix_string);\n    OP_REQUIRES_OK(context, writer.status());\n    VLOG(1) << \"BundleWriter, prefix_string: \" << prefix_string;\n\n    for (int i = 0; i < num_tensors; ++i) {\n      const string& tensor_name = tensor_names_flat(i);\n      const Tensor& tensor = context->input(i + kFixedInputs);\n      VLOG(2) << \"Starting save of \" << tensor_name;\n\n      if (!shape_and_slices_flat(i).empty()) {\n        const string& shape_spec = shape_and_slices_flat(i);\n        TensorShape shape;\n        TensorSlice slice(tensor.dims());\n        TensorShape slice_shape;\n\n        OP_REQUIRES_OK(context, checkpoint::ParseShapeAndSlice(\n                                    shape_spec, &shape, &slice, &slice_shape));\n        OP_REQUIRES(context, slice_shape.IsSameSize(tensor.shape()),\n                    errors::InvalidArgument(\"Slice in shape_and_slice \"\n                                            \"specification does not match the \"\n                                            \"shape of the tensor to  save: \",\n                                            shape_spec, \", tensor: \",\n                                            tensor.shape().DebugString()));\n\n        OP_REQUIRES_OK(context,\n                       writer.AddSlice(tensor_name, shape, slice, tensor));\n      } else {\n        OP_REQUIRES_OK(context, writer.Add(tensor_name, tensor));\n      }\n\n      if (VLOG_IS_ON(5)) {\n        if (tensor.dtype() == DT_FLOAT) {\n          const float* t_data = tensor.flat<float>().data();\n          float min = std::numeric_limits<float>::infinity();\n          float max = -std::numeric_limits<float>::infinity();\n          double avg = 0.0;\n          for (int i = 0; i < tensor.NumElements(); ++i) {\n            if (t_data[i] < min) min = t_data[i];\n            if (t_data[i] > max) max = t_data[i];\n            avg += t_data[i];\n          }\n          VLOG(5) << \" min \" << min << \" max \" << max << \" avg \"\n                  << avg \/ tensor.NumElements() << \" total elts \"\n                  << tensor.NumElements();\n        }\n      }\n\n      VLOG(2) << \"Done save of \" << tensor_name;\n    }\n    OP_REQUIRES_OK(context, writer.Finish());\n    VLOG(1) << \"Done BundleWriter, prefix_string: \" << prefix_string;\n  }\n};\nREGISTER_KERNEL_BUILDER(Name(\"SaveV2\").Device(DEVICE_CPU), SaveV2);\n\n\/\/ Restores a list of named tensors from a tensor bundle (V2 checkpoint format).\nclass RestoreV2 : public OpKernel {\n public:\n  explicit RestoreV2(OpKernelConstruction* context) : OpKernel(context) {\n    OP_REQUIRES_OK(context, context->GetAttr(\"dtypes\", &dtypes_));\n  }\n\n  void Compute(OpKernelContext* context) override {\n    const Tensor& prefix = context->input(0);\n    const Tensor& tensor_names = context->input(1);\n    const Tensor& shape_and_slices = context->input(2);\n    OP_REQUIRES(context, tensor_names.NumElements() == dtypes_.size(),\n                errors::InvalidArgument(\"Got \", tensor_names.NumElements(),\n                                        \" tensor names, but \", dtypes_.size(),\n                                        \" expected dtypes.\"));\n    ValidateInputs(false \/* not save op *\/, context, prefix, tensor_names,\n                   shape_and_slices);\n    if (!context->status().ok()) return;\n\n    const string& prefix_string = prefix.scalar<tstring>()();\n\n    \/\/ Intention: we plan to use the RestoreV2 op as a backward-compatible\n    \/\/ reader as we upgrade to the V2 format.  This allows transparent upgrade.\n    \/\/ We here attempt to read a V1 checkpoint, if \"prefix_string\" does not\n    \/\/ refer to a V2 checkpoint.\n    Env* env = Env::Default();\n    std::vector<string> paths;\n    if (!env->GetMatchingPaths(MetaFilename(prefix_string), &paths).ok() ||\n        paths.empty()) {\n      \/\/ Cannot find V2's metadata file, so \"prefix_string\" does not point to a\n      \/\/ V2 checkpoint.  Invokes the V1 read path instead.\n      for (size_t i = 0; i < tensor_names.NumElements(); ++i) {\n        RestoreTensor(context, &checkpoint::OpenTableTensorSliceReader,\n                      \/* preferred_shard *\/ -1, \/* restore_slice *\/ true,\n                      \/* restore_index *\/ i);\n        if (!context->status().ok()) {\n          return;\n        }\n      }\n      return;\n    }\n    \/\/ If found, invokes the V2 reader.\n    OP_REQUIRES_OK(context, RestoreTensorsV2(context, prefix, tensor_names,\n                                             shape_and_slices, dtypes_));\n  }\n\n private:\n  \/\/ Expected dtypes of the to-restore tensors.\n  std::vector<DataType> dtypes_;\n};\nREGISTER_KERNEL_BUILDER(Name(\"RestoreV2\").Device(DEVICE_CPU), RestoreV2);\n\n\/\/ The final step in saving sharded V2 checkpoints: merges metadata files.\nclass MergeV2Checkpoints : public OpKernel {\n public:\n  explicit MergeV2Checkpoints(OpKernelConstruction* context)\n      : OpKernel(context) {\n    OP_REQUIRES_OK(context,\n                   context->GetAttr(\"delete_old_dirs\", &delete_old_dirs_));\n  }\n\n  void Compute(OpKernelContext* context) override {\n    const Tensor& checkpoint_prefixes = context->input(0);\n    const Tensor& destination_prefix = context->input(1);\n    OP_REQUIRES(context,\n                TensorShapeUtils::IsVector(checkpoint_prefixes.shape()),\n                errors::InvalidArgument(\n                    \"Input checkpoint_prefixes should be an 1-D tensor, got \",\n                    checkpoint_prefixes.shape().DebugString(), \" instead.\"));\n    OP_REQUIRES(context, TensorShapeUtils::IsScalar(destination_prefix.shape()),\n                errors::InvalidArgument(\n                    \"Input destination_prefix should be a scalar tensor, got \",\n                    destination_prefix.shape().DebugString(), \" instead.\"));\n\n    const gtl::ArraySlice<tstring> input_prefixes =\n        gtl::ArraySlice<tstring>(checkpoint_prefixes.flat<tstring>());\n    Env* env = Env::Default();\n    const string& merged_prefix = destination_prefix.scalar<tstring>()();\n    OP_REQUIRES_OK(\n        context, tensorflow::MergeBundles(env, input_prefixes, merged_prefix));\n\n    if (delete_old_dirs_) {\n      const string merged_dir(io::Dirname(merged_prefix));\n      for (const string& input_prefix : input_prefixes) {\n        const string dirname(io::Dirname(input_prefix));\n        if (dirname == merged_dir) continue;\n        Status status = env->DeleteDir(dirname);\n        \/\/ For sharded save, only the first delete will go through and all\n        \/\/ others will hit NotFound.  Use vlog to be less verbose.\n        if (!status.ok()) VLOG(1) << status;\n      }\n    }\n  }\n\n private:\n  \/\/ On merge, whether or not to delete the input (temporary) directories.\n  bool delete_old_dirs_;\n};\nREGISTER_KERNEL_BUILDER(Name(\"MergeV2Checkpoints\").Device(DEVICE_CPU),\n                        MergeV2Checkpoints);\n\n}  \/\/ namespace tensorflow\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_ct_EnumType.h\"\n#include \"jnc_ct_Module.h\"\n#include \"jnc_ct_Parser.llk.h\"\n\nnamespace jnc {\nnamespace ct {\n\n\/\/..............................................................................\n\nconst char*\ngetEnumTypeFlagString(EnumTypeFlag flag) {\n\tstatic const char* stringTable[] = {\n\t\t\"exposed\",   \/\/ EnumTypeFlag_Exposed = 0x0010000\n\t\t\"bitflag\",   \/\/ EnumTypeFlag_BitFlag = 0x0020000\n\t};\n\n\tsize_t i = sl::getLoBitIdx32(flag >> 12);\n\n\treturn i < countof(stringTable) ?\n\t\tstringTable[i] :\n\t\t\"undefined-enum-type-flag\";\n}\n\nsl::String\ngetEnumTypeFlagString(uint_t flags) {\n\tsl::String string;\n\n\tif (flags & EnumTypeFlag_Exposed)\n\t\tstring = \"exposed \";\n\n\tif (flags & EnumTypeFlag_BitFlag)\n\t\tstring += \"bitflag \";\n\n\tif (!string.isEmpty())\n\t\tstring.chop(1);\n\n\treturn string;\n}\n\n\/\/..............................................................................\n\nbool\nEnumConst::generateDocumentation(\n\tconst sl::StringRef& outputDir,\n\tsl::String* itemXml,\n\tsl::String* indexXml\n) {\n\tdox::Block* doxyBlock = m_module->m_doxyHost.getItemBlock(this);\n\n\titemXml->format(\n\t\t\"<enumvalue id='%s'>\\n\"\n\t\t\"<name>%s<\/name>\\n\",\n\t\tdoxyBlock->getRefId().sz(),\n\t\tm_name.sz()\n\t);\n\n\tif (!m_initializer.isEmpty())\n\t\titemXml->appendFormat(\n\t\t\t\"<initializer>= %s<\/initializer>\\n\",\n\t\t\tgetInitializerString().sz()\n\t\t);\n\n\titemXml->append(doxyBlock->getDescriptionString());\n\titemXml->append(\"<\/enumvalue>\\n\");\n\n\treturn true;\n}\n\n\/\/..............................................................................\n\nEnumType::EnumType() {\n\tm_typeKind = TypeKind_Enum;\n\tm_flags = TypeFlag_Pod;\n\tm_rootType = NULL;\n\tm_baseType = NULL;\n}\n\nbool\nEnumType::isBaseType(EnumType* type) {\n\tif (m_baseType->getTypeKind() != TypeKind_Enum ||\n\t\ttype->getRootType()->cmp(m_rootType) != 0) \/\/ fast-exit\n\t\treturn false;\n\n\tEnumType* baseType = (EnumType*)m_baseType;\n\n\tfor (;;) {\n\t\tif (type->cmp(baseType) == 0)\n\t\t\treturn true;\n\n\t\tbaseType = (EnumType*)baseType->getBaseType();\n\t\tif (baseType->getTypeKind() != TypeKind_Enum)\n\t\t\treturn false;\n\t}\n}\n\nEnumConst*\nEnumType::createConst(\n\tconst sl::StringRef& name,\n\tsl::BoxList<Token>* initializer\n) {\n\tEnumConst* enumConst = AXL_MEM_NEW(EnumConst);\n\tenumConst->m_module = m_module;\n\tenumConst->m_parentUnit = m_parentUnit;\n\tenumConst->m_parentEnumType = this;\n\tenumConst->m_name = name;\n\n\tif (initializer)\n\t\tsl::takeOver(&enumConst->m_initializer, initializer);\n\n\tm_constList.insertTail(enumConst);\n\tm_constArray.append(enumConst);\n\n\tbool result = addItem(enumConst);\n\tif (!result)\n\t\treturn NULL;\n\n\treturn enumConst;\n}\n\nvoid\nEnumType::prepareSignature() {\n\tconst char* signaturePrefix = (m_flags & EnumTypeFlag_BitFlag) ?\n\t\t(m_flags & EnumTypeFlag_Exposed) ? \"EZ\" : \"EF\" :\n\t\t(m_flags & EnumTypeFlag_Exposed) ? \"EC\" : \"EE\";\n\n\tm_signature = signaturePrefix + m_qualifiedName;\n}\n\nbool\nEnumType::parseBody() {\n\tUnit* prevUnit = m_module->m_unitMgr.setCurrentUnit(m_parentUnit);\n\tm_module->m_namespaceMgr.openNamespace(this);\n\n\tsize_t length = m_body.getLength();\n\tASSERT(length >= 2);\n\n\tParser parser(m_module, m_pragmaSettings, Parser::Mode_Parse);\n\tbool result = parser.parseBody(\n\t\tSymbolKind_enum_const_list,\n\t\tlex::LineColOffset(m_bodyPos.m_line, m_bodyPos.m_col + 1, m_bodyPos.m_offset + 1),\n\t\tm_body.getSubString(1, length - 2)\n\t);\n\n\tif (!result)\n\t\treturn false;\n\n\tm_module->m_namespaceMgr.closeNamespace();\n\tm_module->m_unitMgr.setCurrentUnit(prevUnit);\n\treturn true;\n}\n\nFindModuleItemResult\nEnumType::findDirectChildItemTraverse(\n\tconst sl::StringRef& name,\n\tMemberCoord* coord,\n\tuint_t flags\n) {\n\tif (!(flags & TraverseFlag_NoThis)) {\n\t\tFindModuleItemResult findResult = findDirectChildItem(name);\n\t\tif (!findResult.m_result)\n\t\t\treturn findResult;\n\n\t\tif (findResult.m_item)\n\t\t\treturn findResult;\n\t}\n\n\tif (!(flags & TraverseFlag_NoBaseType) && m_baseType->getTypeKind() == TypeKind_Enum) {\n\t\tuint_t modFlags = (flags & ~TraverseFlag_NoThis) | TraverseFlag_NoParentNamespace;\n\t\tFindModuleItemResult findResult = ((EnumType*)m_baseType)->findDirectChildItemTraverse(name, coord, modFlags);\n\t\tif (!findResult.m_result)\n\t\t\treturn findResult;\n\n\t\tif (findResult.m_item)\n\t\t\treturn findResult;\n\t}\n\n\treturn !(flags & TraverseFlag_NoParentNamespace) && m_parentNamespace ?\n\t\tm_parentNamespace->findDirectChildItemTraverse(name, coord, flags & ~TraverseFlag_NoThis) :\n\t\tg_nullFindModuleItemResult;\n}\n\nbool\nEnumType::calcLayout() {\n\tbool result =\n\t\tm_baseType->ensureLayout() &&\n\t\tensureNamespaceReady() &&\n\t\tensureAttributeValuesReady();\n\n\tif (!result)\n\t\treturn false;\n\n\tType* rootType = m_baseType;\n\twhile (rootType->getTypeKind() == TypeKind_Enum)\n\t\trootType = ((EnumType*)rootType)->m_baseType;\n\n\tif (rootType->getTypeKind() == TypeKind_TypedefShadow)\n\t\trootType = ((TypedefShadowType*)rootType)->getActualType();\n\n\tm_rootType = rootType;\n\n\tif (!(m_baseType->getTypeKindFlags() & TypeKindFlag_Integer) &&\n\t\tm_baseType->getTypeKind() != TypeKind_TypedefShadow) { \/\/ typedef shadows are for documentation & code-assist\n\t\terr::setFormatStringError(\n\t\t\t\"invalid base type %s for %s (must be integer type)\",\n\t\t\tm_baseType->getTypeString().sz(),\n\t\t\tgetTypeString().sz()\n\t\t);\n\n\t\treturn false;\n\t}\n\n\tm_size = m_baseType->getSize();\n\tm_alignment = m_baseType->getAlignment();\n\n\t\/\/ assign values to consts\n\n\tEnumConst* baseConst = findBaseEnumConst();\n\n\tUnit* prevUnit = m_module->m_unitMgr.setCurrentUnit(m_parentUnit);\n\tm_module->m_namespaceMgr.openNamespace(this);\n\n\tresult = (m_flags & EnumTypeFlag_BitFlag) ?\n\t\tcalcBitflagEnumConstValues(baseConst) :\n\t\tcalcEnumConstValues(baseConst);\n\n\tm_module->m_namespaceMgr.closeNamespace();\n\tm_module->m_unitMgr.setCurrentUnit(prevUnit);\n\treturn result;\n}\n\nEnumConst*\nEnumType::findBaseEnumConst() {\n\tEnumType* baseType = (EnumType*)m_baseType;\n\twhile (baseType->getTypeKind() == TypeKind_Enum) {\n\t\tif (!baseType->m_constList.isEmpty())\n\t\t\treturn *baseType->m_constList.getTail();\n\n\t\tbaseType = (EnumType*)baseType->m_baseType;\n\t}\n\n\treturn NULL;\n}\n\nbool\nEnumType::calcEnumConstValues(EnumConst* baseConst) {\n\tbool finalResult = true;\n\tint64_t value = baseConst ? baseConst->m_value + 1 : 0;\n\n\tsl::Iterator<EnumConst> constIt = m_constList.getHead();\n\tfor (; constIt; constIt++, value++) {\n\t\tbool result = constIt->ensureAttributeValuesReady();\n\t\tif (!result)\n\t\t\tfinalResult = false;\n\n\t\tif (!constIt->m_initializer.isEmpty()) {\n\t\t\tresult = m_module->m_operatorMgr.parseConstIntegerExpression(constIt->m_initializer, &value);\n\t\t\tif (!result)\n\t\t\t\tfinalResult = false;\n\t\t}\n\n\t\tconstIt->m_value = value;\n\t\tconstIt->m_flags |= EnumConstFlag_ValueReady;\n\t\tm_constMap[value] = *constIt;\n\t}\n\n\treturn finalResult;\n}\n\nbool\nEnumType::calcBitflagEnumConstValues(EnumConst* baseConst) {\n\tbool finalResult = true;\n\tint64_t value = baseConst ? 2 << sl::getHiBitIdx64(baseConst->m_value) : 1;\n\n\tsl::Iterator<EnumConst> constIt = m_constList.getHead();\n\tfor (; constIt; constIt++) {\n\t\tbool result = constIt->ensureAttributeValuesReady();\n\t\tif (!result)\n\t\t\tfinalResult = false;\n\n\t\tif (!constIt->m_initializer.isEmpty()) {\n\t\t\tresult = m_module->m_operatorMgr.parseConstIntegerExpression(constIt->m_initializer, &value);\n\t\t\tif (!result)\n\t\t\t\tfinalResult = false;\n\t\t}\n\n\t\tconstIt->m_value = value;\n\t\tconstIt->m_flags |= EnumConstFlag_ValueReady;\n\t\tm_constMap[value] = *constIt;\n\n\t\tvalue = value ? 2 << sl::getHiBitIdx64(value) : 1;\n\t}\n\n\treturn finalResult;\n}\n\nsl::String\nEnumType::getValueString(\n\tconst void* p,\n\tconst char* formatSpec\n) {\n\tValue value;\n\tbool result = m_module->m_operatorMgr.castOperator(Value(p, m_baseType), TypeKind_Int64, &value);\n\tASSERT(result);\n\n\tint64_t n = *(int64_t*)value.getConstData();\n\n\tif (!(m_flags & EnumTypeFlag_BitFlag)) { \/\/ shortcut\n\t\tEnumConst* enumConst = findConst(n);\n\t\treturn enumConst ? enumConst->m_name : m_baseType->getValueString(p, formatSpec);\n\t}\n\n\tsl::String string;\n\n\tint64_t unnamedFlags = 0;\n\n\twhile (n) {\n\t\tint64_t flag = sl::getLoBit64(n);\n\t\tif (!flag)\n\t\t\tbreak;\n\n\t\tn &= ~flag;\n\n\t\tEnumConst* enumConst = findConst(flag);\n\t\tif (!enumConst) {\n\t\t\tunnamedFlags |= flag;\n\t\t} else {\n\t\t\tif (!string.isEmpty())\n\t\t\t\tstring += \", \";\n\n\t\t\tstring += enumConst->m_name;\n\t\t}\n\t}\n\n\tif (!formatSpec)\n\t\tformatSpec = \"0x%X\"; \/\/ bitflags are better represented as hex\n\n\tif (string.isEmpty())\n\t\treturn m_baseType->getValueString(p, formatSpec);\n\n\tif (unnamedFlags) {\n\t\tstring += \", \";\n\t\tstring += m_baseType->getValueString(&unnamedFlags, formatSpec);\n\t}\n\n\treturn string;\n}\n\nbool\nEnumType::generateDocumentation(\n\tconst sl::StringRef& outputDir,\n\tsl::String* itemXml,\n\tsl::String* indexXml\n) {\n\tbool result = ensureNoImports();\n\tif (!result)\n\t\treturn false;\n\n\tdox::Block* doxyBlock = m_module->m_doxyHost.getItemBlock(this);\n\n\tsl::String memberXml;\n\tresult = Namespace::generateMemberDocumentation(outputDir, &memberXml, indexXml, false);\n\tif (!result)\n\t\treturn false;\n\n\titemXml->format(\n\t\t\"<memberdef kind='enum' id='%s'\"\n\t\t\">\\n<name>%s<\/name>\\n\",\n\t\tdoxyBlock->getRefId().sz(),\n\t\tm_name.sz()\n\t);\n\n\tuint_t flags = m_flags;\n\tif (m_name.isEmpty())\n\t\tflags &= ~EnumTypeFlag_Exposed; \/\/ unnamed enums imply 'exposed' anyway\n\n\tsl::String modifierString = getEnumTypeFlagString(flags);\n\tif (!modifierString.isEmpty())\n\t\titemXml->appendFormat(\"<modifiers>%s<\/modifiers>\\n\", modifierString.sz());\n\n\titemXml->append(memberXml);\n\n\tsl::String footnoteXml = doxyBlock->getFootnoteString();\n\tif (!footnoteXml.isEmpty())\n\t\titemXml->append(footnoteXml);\n\n\titemXml->append(doxyBlock->getImportString());\n\titemXml->append(doxyBlock->getDescriptionString());\n\titemXml->append(getDoxyLocationString());\n\titemXml->append(\"<\/memberdef>\\n\");\n\n\treturn true;\n}\n\n\/\/..............................................................................\n\n} \/\/ namespace ct\n} \/\/ namespace jnc\n<commit_msg>[jnc_ct] EnumType must emit documentation about its base type<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_ct_EnumType.h\"\n#include \"jnc_ct_Module.h\"\n#include \"jnc_ct_Parser.llk.h\"\n\nnamespace jnc {\nnamespace ct {\n\n\/\/..............................................................................\n\nconst char*\ngetEnumTypeFlagString(EnumTypeFlag flag) {\n\tstatic const char* stringTable[] = {\n\t\t\"exposed\",   \/\/ EnumTypeFlag_Exposed = 0x0010000\n\t\t\"bitflag\",   \/\/ EnumTypeFlag_BitFlag = 0x0020000\n\t};\n\n\tsize_t i = sl::getLoBitIdx32(flag >> 12);\n\n\treturn i < countof(stringTable) ?\n\t\tstringTable[i] :\n\t\t\"undefined-enum-type-flag\";\n}\n\nsl::String\ngetEnumTypeFlagString(uint_t flags) {\n\tsl::String string;\n\n\tif (flags & EnumTypeFlag_Exposed)\n\t\tstring = \"exposed \";\n\n\tif (flags & EnumTypeFlag_BitFlag)\n\t\tstring += \"bitflag \";\n\n\tif (!string.isEmpty())\n\t\tstring.chop(1);\n\n\treturn string;\n}\n\n\/\/..............................................................................\n\nbool\nEnumConst::generateDocumentation(\n\tconst sl::StringRef& outputDir,\n\tsl::String* itemXml,\n\tsl::String* indexXml\n) {\n\tdox::Block* doxyBlock = m_module->m_doxyHost.getItemBlock(this);\n\n\titemXml->format(\n\t\t\"<enumvalue id='%s'>\\n\"\n\t\t\"<name>%s<\/name>\\n\",\n\t\tdoxyBlock->getRefId().sz(),\n\t\tm_name.sz()\n\t);\n\n\tif (!m_initializer.isEmpty())\n\t\titemXml->appendFormat(\n\t\t\t\"<initializer>= %s<\/initializer>\\n\",\n\t\t\tgetInitializerString().sz()\n\t\t);\n\n\titemXml->append(doxyBlock->getDescriptionString());\n\titemXml->append(\"<\/enumvalue>\\n\");\n\n\treturn true;\n}\n\n\/\/..............................................................................\n\nEnumType::EnumType() {\n\tm_typeKind = TypeKind_Enum;\n\tm_flags = TypeFlag_Pod;\n\tm_rootType = NULL;\n\tm_baseType = NULL;\n}\n\nbool\nEnumType::isBaseType(EnumType* type) {\n\tif (m_baseType->getTypeKind() != TypeKind_Enum ||\n\t\ttype->getRootType()->cmp(m_rootType) != 0) \/\/ fast-exit\n\t\treturn false;\n\n\tEnumType* baseType = (EnumType*)m_baseType;\n\n\tfor (;;) {\n\t\tif (type->cmp(baseType) == 0)\n\t\t\treturn true;\n\n\t\tbaseType = (EnumType*)baseType->getBaseType();\n\t\tif (baseType->getTypeKind() != TypeKind_Enum)\n\t\t\treturn false;\n\t}\n}\n\nEnumConst*\nEnumType::createConst(\n\tconst sl::StringRef& name,\n\tsl::BoxList<Token>* initializer\n) {\n\tEnumConst* enumConst = AXL_MEM_NEW(EnumConst);\n\tenumConst->m_module = m_module;\n\tenumConst->m_parentUnit = m_parentUnit;\n\tenumConst->m_parentEnumType = this;\n\tenumConst->m_name = name;\n\n\tif (initializer)\n\t\tsl::takeOver(&enumConst->m_initializer, initializer);\n\n\tm_constList.insertTail(enumConst);\n\tm_constArray.append(enumConst);\n\n\tbool result = addItem(enumConst);\n\tif (!result)\n\t\treturn NULL;\n\n\treturn enumConst;\n}\n\nvoid\nEnumType::prepareSignature() {\n\tconst char* signaturePrefix = (m_flags & EnumTypeFlag_BitFlag) ?\n\t\t(m_flags & EnumTypeFlag_Exposed) ? \"EZ\" : \"EF\" :\n\t\t(m_flags & EnumTypeFlag_Exposed) ? \"EC\" : \"EE\";\n\n\tm_signature = signaturePrefix + m_qualifiedName;\n}\n\nbool\nEnumType::parseBody() {\n\tUnit* prevUnit = m_module->m_unitMgr.setCurrentUnit(m_parentUnit);\n\tm_module->m_namespaceMgr.openNamespace(this);\n\n\tsize_t length = m_body.getLength();\n\tASSERT(length >= 2);\n\n\tParser parser(m_module, m_pragmaSettings, Parser::Mode_Parse);\n\tbool result = parser.parseBody(\n\t\tSymbolKind_enum_const_list,\n\t\tlex::LineColOffset(m_bodyPos.m_line, m_bodyPos.m_col + 1, m_bodyPos.m_offset + 1),\n\t\tm_body.getSubString(1, length - 2)\n\t);\n\n\tif (!result)\n\t\treturn false;\n\n\tm_module->m_namespaceMgr.closeNamespace();\n\tm_module->m_unitMgr.setCurrentUnit(prevUnit);\n\treturn true;\n}\n\nFindModuleItemResult\nEnumType::findDirectChildItemTraverse(\n\tconst sl::StringRef& name,\n\tMemberCoord* coord,\n\tuint_t flags\n) {\n\tif (!(flags & TraverseFlag_NoThis)) {\n\t\tFindModuleItemResult findResult = findDirectChildItem(name);\n\t\tif (!findResult.m_result)\n\t\t\treturn findResult;\n\n\t\tif (findResult.m_item)\n\t\t\treturn findResult;\n\t}\n\n\tif (!(flags & TraverseFlag_NoBaseType) && m_baseType->getTypeKind() == TypeKind_Enum) {\n\t\tuint_t modFlags = (flags & ~TraverseFlag_NoThis) | TraverseFlag_NoParentNamespace;\n\t\tFindModuleItemResult findResult = ((EnumType*)m_baseType)->findDirectChildItemTraverse(name, coord, modFlags);\n\t\tif (!findResult.m_result)\n\t\t\treturn findResult;\n\n\t\tif (findResult.m_item)\n\t\t\treturn findResult;\n\t}\n\n\treturn !(flags & TraverseFlag_NoParentNamespace) && m_parentNamespace ?\n\t\tm_parentNamespace->findDirectChildItemTraverse(name, coord, flags & ~TraverseFlag_NoThis) :\n\t\tg_nullFindModuleItemResult;\n}\n\nbool\nEnumType::calcLayout() {\n\tbool result =\n\t\tm_baseType->ensureLayout() &&\n\t\tensureNamespaceReady() &&\n\t\tensureAttributeValuesReady();\n\n\tif (!result)\n\t\treturn false;\n\n\tType* rootType = m_baseType;\n\twhile (rootType->getTypeKind() == TypeKind_Enum)\n\t\trootType = ((EnumType*)rootType)->m_baseType;\n\n\tif (rootType->getTypeKind() == TypeKind_TypedefShadow)\n\t\trootType = ((TypedefShadowType*)rootType)->getActualType();\n\n\tm_rootType = rootType;\n\n\tif (!(m_baseType->getTypeKindFlags() & TypeKindFlag_Integer) &&\n\t\tm_baseType->getTypeKind() != TypeKind_TypedefShadow) { \/\/ typedef shadows are for documentation & code-assist\n\t\terr::setFormatStringError(\n\t\t\t\"invalid base type %s for %s (must be integer type)\",\n\t\t\tm_baseType->getTypeString().sz(),\n\t\t\tgetTypeString().sz()\n\t\t);\n\n\t\treturn false;\n\t}\n\n\tm_size = m_baseType->getSize();\n\tm_alignment = m_baseType->getAlignment();\n\n\t\/\/ assign values to consts\n\n\tEnumConst* baseConst = findBaseEnumConst();\n\n\tUnit* prevUnit = m_module->m_unitMgr.setCurrentUnit(m_parentUnit);\n\tm_module->m_namespaceMgr.openNamespace(this);\n\n\tresult = (m_flags & EnumTypeFlag_BitFlag) ?\n\t\tcalcBitflagEnumConstValues(baseConst) :\n\t\tcalcEnumConstValues(baseConst);\n\n\tm_module->m_namespaceMgr.closeNamespace();\n\tm_module->m_unitMgr.setCurrentUnit(prevUnit);\n\treturn result;\n}\n\nEnumConst*\nEnumType::findBaseEnumConst() {\n\tEnumType* baseType = (EnumType*)m_baseType;\n\twhile (baseType->getTypeKind() == TypeKind_Enum) {\n\t\tif (!baseType->m_constList.isEmpty())\n\t\t\treturn *baseType->m_constList.getTail();\n\n\t\tbaseType = (EnumType*)baseType->m_baseType;\n\t}\n\n\treturn NULL;\n}\n\nbool\nEnumType::calcEnumConstValues(EnumConst* baseConst) {\n\tbool finalResult = true;\n\tint64_t value = baseConst ? baseConst->m_value + 1 : 0;\n\n\tsl::Iterator<EnumConst> constIt = m_constList.getHead();\n\tfor (; constIt; constIt++, value++) {\n\t\tbool result = constIt->ensureAttributeValuesReady();\n\t\tif (!result)\n\t\t\tfinalResult = false;\n\n\t\tif (!constIt->m_initializer.isEmpty()) {\n\t\t\tresult = m_module->m_operatorMgr.parseConstIntegerExpression(constIt->m_initializer, &value);\n\t\t\tif (!result)\n\t\t\t\tfinalResult = false;\n\t\t}\n\n\t\tconstIt->m_value = value;\n\t\tconstIt->m_flags |= EnumConstFlag_ValueReady;\n\t\tm_constMap[value] = *constIt;\n\t}\n\n\treturn finalResult;\n}\n\nbool\nEnumType::calcBitflagEnumConstValues(EnumConst* baseConst) {\n\tbool finalResult = true;\n\tint64_t value = baseConst ? 2 << sl::getHiBitIdx64(baseConst->m_value) : 1;\n\n\tsl::Iterator<EnumConst> constIt = m_constList.getHead();\n\tfor (; constIt; constIt++) {\n\t\tbool result = constIt->ensureAttributeValuesReady();\n\t\tif (!result)\n\t\t\tfinalResult = false;\n\n\t\tif (!constIt->m_initializer.isEmpty()) {\n\t\t\tresult = m_module->m_operatorMgr.parseConstIntegerExpression(constIt->m_initializer, &value);\n\t\t\tif (!result)\n\t\t\t\tfinalResult = false;\n\t\t}\n\n\t\tconstIt->m_value = value;\n\t\tconstIt->m_flags |= EnumConstFlag_ValueReady;\n\t\tm_constMap[value] = *constIt;\n\n\t\tvalue = value ? 2 << sl::getHiBitIdx64(value) : 1;\n\t}\n\n\treturn finalResult;\n}\n\nsl::String\nEnumType::getValueString(\n\tconst void* p,\n\tconst char* formatSpec\n) {\n\tValue value;\n\tbool result = m_module->m_operatorMgr.castOperator(Value(p, m_baseType), TypeKind_Int64, &value);\n\tASSERT(result);\n\n\tint64_t n = *(int64_t*)value.getConstData();\n\n\tif (!(m_flags & EnumTypeFlag_BitFlag)) { \/\/ shortcut\n\t\tEnumConst* enumConst = findConst(n);\n\t\treturn enumConst ? enumConst->m_name : m_baseType->getValueString(p, formatSpec);\n\t}\n\n\tsl::String string;\n\n\tint64_t unnamedFlags = 0;\n\n\twhile (n) {\n\t\tint64_t flag = sl::getLoBit64(n);\n\t\tif (!flag)\n\t\t\tbreak;\n\n\t\tn &= ~flag;\n\n\t\tEnumConst* enumConst = findConst(flag);\n\t\tif (!enumConst) {\n\t\t\tunnamedFlags |= flag;\n\t\t} else {\n\t\t\tif (!string.isEmpty())\n\t\t\t\tstring += \", \";\n\n\t\t\tstring += enumConst->m_name;\n\t\t}\n\t}\n\n\tif (!formatSpec)\n\t\tformatSpec = \"0x%X\"; \/\/ bitflags are better represented as hex\n\n\tif (string.isEmpty())\n\t\treturn m_baseType->getValueString(p, formatSpec);\n\n\tif (unnamedFlags) {\n\t\tstring += \", \";\n\t\tstring += m_baseType->getValueString(&unnamedFlags, formatSpec);\n\t}\n\n\treturn string;\n}\n\nbool\nEnumType::generateDocumentation(\n\tconst sl::StringRef& outputDir,\n\tsl::String* itemXml,\n\tsl::String* indexXml\n) {\n\tbool result = ensureNoImports();\n\tif (!result)\n\t\treturn false;\n\n\tdox::Block* doxyBlock = m_module->m_doxyHost.getItemBlock(this);\n\n\tsl::String memberXml;\n\tresult = Namespace::generateMemberDocumentation(outputDir, &memberXml, indexXml, false);\n\tif (!result)\n\t\treturn false;\n\n\titemXml->format(\n\t\t\"<memberdef kind='enum' id='%s'\"\n\t\t\">\\n<name>%s<\/name>\\n\",\n\t\tdoxyBlock->getRefId().sz(),\n\t\tm_name.sz()\n\t);\n\n\tif (m_baseType->getTypeKind() != TypeKind_Int)\n\t\titemXml->append(m_baseType->getDoxyTypeString());\n\n\tuint_t flags = m_flags;\n\tif (m_name.isEmpty())\n\t\tflags &= ~EnumTypeFlag_Exposed; \/\/ unnamed enums imply 'exposed' anyway\n\n\tsl::String modifierString = getEnumTypeFlagString(flags);\n\tif (!modifierString.isEmpty())\n\t\titemXml->appendFormat(\"<modifiers>%s<\/modifiers>\\n\", modifierString.sz());\n\n\titemXml->append(memberXml);\n\n\tsl::String footnoteXml = doxyBlock->getFootnoteString();\n\tif (!footnoteXml.isEmpty())\n\t\titemXml->append(footnoteXml);\n\n\titemXml->append(doxyBlock->getImportString());\n\titemXml->append(doxyBlock->getDescriptionString());\n\titemXml->append(getDoxyLocationString());\n\titemXml->append(\"<\/memberdef>\\n\");\n\n\treturn true;\n}\n\n\/\/..............................................................................\n\n} \/\/ namespace ct\n} \/\/ namespace jnc\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2009-2013 The VOTCA Development Team (http:\/\/www.votca.org)\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n#include <iostream>\n#include <fstream>\n\n#include \"dlpolytopologyreader.h\"\n#include \"dlpoly\/dlp_io_layer.h\"\n\nnamespace votca { namespace csg {\n\nbool DLPOLYTopologyReader::ReadTopology(string file, Topology &top)\n{\n    struct FieldSpecsT  FieldBase;\n    struct FrameSpecsT  FrameBase;\n    struct MolecSpecsT *MolecBase;\n    struct FieldSiteT  *FieldSite;\n    struct FrameSiteT  *FrameSite;\n\n    int idnode,matms,natms,nmols,nmolt;\n    int istateF;\n\n    int inode=matms=natms=nmols=nmolt=0;\n\n    \/\/ TODO: istateF must be an enum!\n    istateF=1;\n\n    \/\/ TODO: we need to fix the file naming!\n    field_scan_(&istateF,&matms,&natms,&nmolt);\n\n    MolecBase = new MolecSpecsT[nmolt];\n    FieldSite = new FieldSiteT[natms];\n\n    FieldBase.nmols = nmolt;\n    FieldBase.natms = natms;\n\n    field_read_(&istateF,&FieldBase,MolecBase,FieldSite);\n\n    \/\/ AB: if on return istateF < 0  => in the next F-call the relevant F-arrays will be deallocated (at the end)\n    \/\/ AB: NOT TO RE-\/DE-ALLOCATE F-arrays in the next F-call, reset istateF = 0\n    istateF = 0;\n\n    \/\/ TODO: fix residue naming \/ assignment\n    Residue *res = top.CreateResidue(\"no\");\n\n    \/\/ read the atoms\n    int is=0;\n    for(int im=0; im<nmolt; im++){\n        for(int imr=0; imr<MolecBase[im].nrept; ++imr) {\n            Molecule *mi = top.CreateMolecule(MolecBase[im].name);\n            for(int ims=0; ims<MolecBase[im].nsites; ims++) {\n\n                BeadType *type = top.GetOrCreateBeadType(FieldSite[is].name); \/\/ what is\n                Bead *bead = top.CreateBead(1, FieldSite[is].type, type, res->getId(), FieldSite[is].m, FieldSite[is].q);\n\n                stringstream nm;\n                nm << bead->getResnr() + 1 << \":\" <<  top.getResidue(bead->getResnr())->getName() << \":\" << bead->getName();\n                mi->AddBead(bead, nm.str());\n            }\n        }\n    }\n\n    delete [] MolecBase;\n    delete [] FieldSite;\n\n    std::ifstream fl;\n    fl.open(\"CONFIG\");\n    if(fl.is_open()) {\n      string line;\n      getline(fl, line); \/\/title\n      getline(fl, line); \/\/ 2nd header line\n      vec box_vectors[3];\n      for (int i=0;i<3;i++){ \/\/ read 3 box lines\n        getline(fl, line);\n        if(fl.eof())\n          throw std::runtime_error(\"unexpected end of file in dlpoly file CONFIG, when reading box vector\"  +\n              boost::lexical_cast<string>(i));\n        Tokenizer tok(line, \" \");\n        vector<double> fields;\n        tok.ConvertToVector<double>(fields);\n        box_vectors[i]=vec(fields[0],fields[1],fields[2]);\n      }\n      matrix box(box_vectors[0],box_vectors[1],box_vectors[2]);\n      top.setBox(box);\n    }\n    else {\n      cout << \"NOTE: Could open dlploy file CONFIG, so no boundary conditions, where set in the topology\" << endl;\n    }\n\n    return true;\n}\n\n}}\n\n<commit_msg>dlpolytopologyreader: added missing files close<commit_after>\/*\n * Copyright 2009-2013 The VOTCA Development Team (http:\/\/www.votca.org)\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n#include <iostream>\n#include <fstream>\n\n#include \"dlpolytopologyreader.h\"\n#include \"dlpoly\/dlp_io_layer.h\"\n\nnamespace votca { namespace csg {\n\nbool DLPOLYTopologyReader::ReadTopology(string file, Topology &top)\n{\n    struct FieldSpecsT  FieldBase;\n    struct FrameSpecsT  FrameBase;\n    struct MolecSpecsT *MolecBase;\n    struct FieldSiteT  *FieldSite;\n    struct FrameSiteT  *FrameSite;\n\n    int idnode,matms,natms,nmols,nmolt;\n    int istateF;\n\n    int inode=matms=natms=nmols=nmolt=0;\n\n    \/\/ TODO: istateF must be an enum!\n    istateF=1;\n\n    \/\/ TODO: we need to fix the file naming!\n    field_scan_(&istateF,&matms,&natms,&nmolt);\n\n    MolecBase = new MolecSpecsT[nmolt];\n    FieldSite = new FieldSiteT[natms];\n\n    FieldBase.nmols = nmolt;\n    FieldBase.natms = natms;\n\n    field_read_(&istateF,&FieldBase,MolecBase,FieldSite);\n\n    \/\/ AB: if on return istateF < 0  => in the next F-call the relevant F-arrays will be deallocated (at the end)\n    \/\/ AB: NOT TO RE-\/DE-ALLOCATE F-arrays in the next F-call, reset istateF = 0\n    istateF = 0;\n\n    \/\/ TODO: fix residue naming \/ assignment\n    Residue *res = top.CreateResidue(\"no\");\n\n    \/\/ read the atoms\n    int is=0;\n    for(int im=0; im<nmolt; im++){\n        for(int imr=0; imr<MolecBase[im].nrept; ++imr) {\n            Molecule *mi = top.CreateMolecule(MolecBase[im].name);\n            for(int ims=0; ims<MolecBase[im].nsites; ims++) {\n\n                BeadType *type = top.GetOrCreateBeadType(FieldSite[is].name); \/\/ what is\n                Bead *bead = top.CreateBead(1, FieldSite[is].type, type, res->getId(), FieldSite[is].m, FieldSite[is].q);\n\n                stringstream nm;\n                nm << bead->getResnr() + 1 << \":\" <<  top.getResidue(bead->getResnr())->getName() << \":\" << bead->getName();\n                mi->AddBead(bead, nm.str());\n            }\n        }\n    }\n\n    delete [] MolecBase;\n    delete [] FieldSite;\n\n    std::ifstream fl;\n    fl.open(\"CONFIG\");\n    if(fl.is_open()) {\n      string line;\n      getline(fl, line); \/\/title\n      getline(fl, line); \/\/ 2nd header line\n      vec box_vectors[3];\n      for (int i=0;i<3;i++){ \/\/ read 3 box lines\n        getline(fl, line);\n        if(fl.eof())\n          throw std::runtime_error(\"unexpected end of file in dlpoly file CONFIG, when reading box vector\"  +\n              boost::lexical_cast<string>(i));\n        Tokenizer tok(line, \" \");\n        vector<double> fields;\n        tok.ConvertToVector<double>(fields);\n        box_vectors[i]=vec(fields[0],fields[1],fields[2]);\n      }\n      matrix box(box_vectors[0],box_vectors[1],box_vectors[2]);\n      top.setBox(box);\n    }\n    else {\n      cout << \"NOTE: Could open dlploy file CONFIG, so no boundary conditions, where set in the topology\" << endl;\n    }\n    fl.close();\n\n    return true;\n}\n\n}}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2009-2015 The VOTCA Development Team (http:\/\/www.votca.org)\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n#include \"h5mdtrajectoryreader.h\"\n#include \"hdf5.h\"\n\n#include <vector>\n\nnamespace votca {\nnamespace csg {\n\nH5MDTrajectoryReader::~H5MDTrajectoryReader() {\n  delete particle_group_;\n  delete atom_position_group_;\n  delete atom_force_group_;\n  delete edges_group_;\n  delete ds_atom_position_;\n  delete ds_atom_force_;\n  delete ds_atom_velocity_;\n  delete ds_time_;\n  delete ds_step_;\n  delete ds_edges_;\n  delete[] time_set_;\n  delete[] step_set_;\n  delete[] species_;\n  delete h5file_;\n}\n\nbool H5MDTrajectoryReader::Open(const string &file) {\n  \/\/ Turn on exceptions instead of various messages.\n  H5::Exception::dontPrint();\n\n  \/\/ Checks if we deal with hdf5 file.\n  if (! H5::H5File::isHdf5(file) )\n    throw std::ios_base::failure(\"Error on open trajectory file: \" + file);\n\n  h5file_ = new H5::H5File(file, H5F_ACC_RDONLY);\n\n  \/\/ Check the version of the file.\n  H5::Group *g_h5md = new H5::Group(h5file_->openGroup(\"h5md\"));\n  H5::Attribute *at_version = new H5::Attribute(g_h5md->openAttribute(\"version\"));\n  int version[2];\n  at_version->read(at_version->getDataType(), &version);\n  if (version[0] != 1 || (version[0] == 1 && version[1] > 0)) {\n    h5file_->close();\n    std::cout << \"Major version \" << version[0] << std::endl;\n    std::cout << \"Minor version \" << version[1] << std::endl;\n    throw std::ios_base::failure(\"Wrong version of H5MD file.\");\n  }\n\n  \/\/ Clean up.\n  g_h5md->close();\n  delete at_version;\n  delete g_h5md;\n\n  \/\/ Checks if the particles group exists and what is the number of members.\n  particle_group_ = new H5::Group(h5file_->openGroup(\"particles\"));\n  if (particle_group_->getNumObjs() == 0) {\n    h5file_->close();\n    throw std::ios_base::failure(\"The particles group is empty.\");\n  }\n\n  has_velocity_ = false;\n  has_force_ = false;\n  has_static_box_ = true;\n  first_frame_ = true;\n\n  return true;\n}\n\nvoid H5MDTrajectoryReader::Close() {\n  h5file_->close();\n}\n\nbool H5MDTrajectoryReader::FirstFrame(Topology &top) {  \/\/ NOLINT const reference\n  \/\/ First frame has access to topology so here we will check if the particle_group exists.\n  if (first_frame_) {\n    first_frame_ = false;\n\n    std::string *particle_group_name = new std::string(top.getParticleGroup());\n    if(*particle_group_name == \"\")\n      throw std::ios_base::failure(\"Missing particle group in topology. Please set h5md_particle_group tag with name attribute set to the particle group.\");\n\n    particle_group_ = new H5::Group(h5file_->openGroup(\"particles\"));\n    atom_position_group_ = new H5::Group(particle_group_->openGroup(\n          *particle_group_name + \"\/position\"));\n\n    idx_frame_ = -1;\n\n    ds_atom_position_ = new H5::DataSet(atom_position_group_->openDataSet(\"value\"));\n    ds_step_ = new H5::DataSet(atom_position_group_->openDataSet(\"step\"));\n    ds_time_ = new H5::DataSet(atom_position_group_->openDataSet(\"time\"));\n\n    \/\/ Gets number of particles and dimensions.\n    H5::DataSpace fs_atom_position_ = ds_atom_position_->getSpace();\n    hsize_t dims[3];\n    rank_ = fs_atom_position_.getSimpleExtentDims(dims);\n    N_particles_ = dims[1];\n    variables_ = dims[2];\n\n    if(N_particles_ != top.BeadCount()) {\n      std::cout << \"Warning: The number of beads (\" << N_particles_ << \")\";\n      std::cout << \" in the trajectory is different than defined in the topology (\" << top.BeadCount() << \")\" << std::endl;\n      std::cout << \"The number of beads from topology will be used\" << std::endl;\n      N_particles_ = top.BeadCount();\n    }\n    chunk_rows_[0] = 1;\n    chunk_rows_[1] = N_particles_;\n    chunk_rows_[2] = variables_;\n\n    \/\/ Reads the time set and step set.\n    H5::DataSet *ds_pos_step = new H5::DataSet(atom_position_group_->openDataSet(\"step\"));\n    H5::DataSet *ds_pos_time = new H5::DataSet(atom_position_group_->openDataSet(\"time\"));\n    H5::DataSpace dsp_step = H5::DataSpace(ds_pos_step->getSpace());\n    H5::DataSpace dsp_time = H5::DataSpace(ds_pos_time->getSpace());\n    hsize_t step_dims[3];\n    dsp_step.getSimpleExtentDims(step_dims);\n    time_set_ = new double[step_dims[0]];\n    step_set_ = new int[step_dims[0]];\n    ds_pos_step->read(step_set_, H5::PredType::NATIVE_INT, dsp_step, dsp_step);\n    ds_pos_time->read(time_set_, H5::PredType::NATIVE_DOUBLE, dsp_time, dsp_time);\n\n    delete ds_pos_step;\n    delete ds_pos_time;\n\n    \/\/ Reads the box information.\n    H5::Group g_box = H5::Group(particle_group_->openGroup(\n        *particle_group_name + \"\/box\"));\n\n    H5::Attribute at_box_dimension = H5::Attribute(g_box.openAttribute(\"dimension\"));\n    int dimension;\n    at_box_dimension.read(at_box_dimension.getDataType(), &dimension);\n    if (dimension != 3 ) {\n      throw std::ios_base::failure(\"Wrong dimension \" + dimension);\n    }\n    \/\/ TODO: check also attribute periodic\n    try {\n      edges_group_ = new H5::Group(g_box.openGroup(\"edges\"));\n      has_static_box_ = false;\n      throw std::runtime_error(\"The box is not static during the simulation. Is it NVT ensemble?\");\n    } catch (H5::GroupIException not_found_error) {\n      ds_edges_ = new H5::DataSet(g_box.openDataSet(\"edges\"));\n      has_static_box_ = true;\n    }\n\n    \/\/ Gets the force group.\n    try {\n      std::string force_group_name = *particle_group_name + \"\/force\";\n      atom_force_group_ = new H5::Group(particle_group_->openGroup(force_group_name));\n      ds_atom_force_ = new H5::DataSet(atom_force_group_->openDataSet(\"value\"));\n    } catch (H5::GroupIException not_found) {\n      has_force_ = false;\n    }\n    \/\/ Gets the velocity group.\n    try {\n      std::string velocity_group_name = *particle_group_name + \"\/velocity\";\n      atom_velocity_group_ = new H5::Group(particle_group_->openGroup(velocity_group_name));\n      ds_atom_velocity_ = new H5::DataSet(atom_velocity_group_->openDataSet(\"value\"));\n    } catch (H5::GroupIException not_found) {\n      has_velocity_ = false;\n    }\n    delete particle_group_name;\n  }\n  NextFrame(top);\n  return true;\n}\n\ndouble* H5MDTrajectoryReader::ReadData(H5::DataSet *ds, int row){\n  hsize_t offset[3] = {row, 0, 0};\n  H5::DataSpace dsp = H5::DataSpace(ds->getSpace());\n  dsp.selectHyperslab(H5S_SELECT_SET, chunk_rows_, offset);\n  H5::DataSpace mspace1(variables_, chunk_rows_);\n  double *data_out = new double[N_particles_ * variables_];\n  ds->read(data_out, H5::PredType::NATIVE_DOUBLE, mspace1, dsp);\n  return data_out;\n}\n\n\/\/\/ Reading the data.\nbool H5MDTrajectoryReader::NextFrame(Topology &top) {  \/\/ NOLINT const reference\n  \/\/ Reads the position row.\n  H5::Exception::dontPrint();\n  idx_frame_++;\n  std::cout << '\\r' << \"Reading frame: \" << idx_frame_;\n  std::cout.flush();\n  hsize_t offset[3] = {idx_frame_, 0, 0};\n  double *positions;\n  try {\n    positions = ReadData(ds_atom_position_, idx_frame_);\n  } catch (H5::DataSetIException not_found) {\n      return false;\n  }\n\n  double *forces = NULL;\n  double *velocities = NULL;\n  if (has_velocity_) {\n    velocities = ReadData(ds_atom_velocity_, idx_frame_);\n  }\n\n  if (has_force_) {\n    forces = ReadData(ds_atom_force_, idx_frame_);\n  }\n\n  \/\/Process atoms.\n  for (int at_idx = 0; at_idx < N_particles_; at_idx++) {\n    double x, y, z;\n    int array_index = at_idx*variables_;\n    x = positions[array_index];\n    y = positions[array_index + 1];\n    z = positions[array_index + 2];\n    \/\/ Topology has to be defined in the xml file or in other\n    \/\/ topology files. The h5md only stores the trajectory data.\n    Bead *b = top.getBead(at_idx);\n    b->setPos(vec(x, y, z));\n    if (has_velocity_) {\n      double vx, vy, vz;\n      vx = velocities[array_index];\n      vy = velocities[array_index + 1];\n      vz = velocities[array_index + 2];\n      b->setVel(vec(vx, vy, vz));\n    }\n\n    if (has_force_) {\n      double fx, fy, fz;\n      fx = forces[array_index];\n      fy = forces[array_index + 1];\n      fz = forces[array_index + 2];\n      b->setF(vec(fx, fy, fz));\n    }\n  }\n\n  \/\/ Clean up pointers.\n  delete[] positions;\n  delete[] forces;\n  delete[] velocities;\n\n  return true;\n}\n\n}  \/\/ end csg\n}  \/\/ end votca\n\n<commit_msg>Additional warnning error message when the particle group is not found.<commit_after>\/*\n * Copyright 2009-2015 The VOTCA Development Team (http:\/\/www.votca.org)\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n#include \"h5mdtrajectoryreader.h\"\n#include \"hdf5.h\"\n\n#include <vector>\n\nnamespace votca {\nnamespace csg {\n\nH5MDTrajectoryReader::~H5MDTrajectoryReader() {\n  delete particle_group_;\n  delete atom_position_group_;\n  delete atom_force_group_;\n  delete edges_group_;\n  delete ds_atom_position_;\n  delete ds_atom_force_;\n  delete ds_atom_velocity_;\n  delete ds_time_;\n  delete ds_step_;\n  delete ds_edges_;\n  delete[] time_set_;\n  delete[] step_set_;\n  delete[] species_;\n  delete h5file_;\n}\n\nbool H5MDTrajectoryReader::Open(const string &file) {\n  \/\/ Turn on exceptions instead of various messages.\n  H5::Exception::dontPrint();\n\n  \/\/ Checks if we deal with hdf5 file.\n  if (! H5::H5File::isHdf5(file) )\n    throw std::ios_base::failure(\"Error on open trajectory file: \" + file);\n\n  h5file_ = new H5::H5File(file, H5F_ACC_RDONLY);\n\n  \/\/ Check the version of the file.\n  H5::Group *g_h5md = new H5::Group(h5file_->openGroup(\"h5md\"));\n  H5::Attribute *at_version = new H5::Attribute(g_h5md->openAttribute(\"version\"));\n  int version[2];\n  at_version->read(at_version->getDataType(), &version);\n  if (version[0] != 1 || (version[0] == 1 && version[1] > 0)) {\n    h5file_->close();\n    std::cout << \"Major version \" << version[0] << std::endl;\n    std::cout << \"Minor version \" << version[1] << std::endl;\n    throw std::ios_base::failure(\"Wrong version of H5MD file.\");\n  }\n\n  \/\/ Clean up.\n  g_h5md->close();\n  delete at_version;\n  delete g_h5md;\n\n  \/\/ Checks if the particles group exists and what is the number of members.\n  particle_group_ = new H5::Group(h5file_->openGroup(\"particles\"));\n  if (particle_group_->getNumObjs() == 0) {\n    h5file_->close();\n    throw std::ios_base::failure(\"The particles group is empty.\");\n  }\n\n  has_velocity_ = false;\n  has_force_ = false;\n  has_static_box_ = true;\n  first_frame_ = true;\n\n  return true;\n}\n\nvoid H5MDTrajectoryReader::Close() {\n  h5file_->close();\n}\n\nbool H5MDTrajectoryReader::FirstFrame(Topology &top) {  \/\/ NOLINT const reference\n  \/\/ First frame has access to topology so here we will check if the particle_group exists.\n  if (first_frame_) {\n    first_frame_ = false;\n\n    std::string *particle_group_name = new std::string(top.getParticleGroup());\n    if(*particle_group_name == \"\")\n      throw std::ios_base::failure(\"Missing particle group in topology. Please set h5md_particle_group tag with name \\\n          attribute set to the particle group.\");\n\n    particle_group_ = new H5::Group(h5file_->openGroup(\"particles\"));\n    try {\n      atom_position_group_ = new H5::Group(particle_group_->openGroup(\n            *particle_group_name + \"\/position\"));\n    } catch (H5::GroupIException not_found_error) {\n      std::cout << \"Error: The path '\/particles\/\" << *particle_group_name << \"\/position' not found. Please check the name \";\n      std::cout << \"of particle group defined in topology\" << std::endl;\n      throw not_found_error;\n    }\n\n    idx_frame_ = -1;\n\n    ds_atom_position_ = new H5::DataSet(atom_position_group_->openDataSet(\"value\"));\n    ds_step_ = new H5::DataSet(atom_position_group_->openDataSet(\"step\"));\n    ds_time_ = new H5::DataSet(atom_position_group_->openDataSet(\"time\"));\n\n    \/\/ Gets number of particles and dimensions.\n    H5::DataSpace fs_atom_position_ = ds_atom_position_->getSpace();\n    hsize_t dims[3];\n    rank_ = fs_atom_position_.getSimpleExtentDims(dims);\n    N_particles_ = dims[1];\n    variables_ = dims[2];\n\n    if(N_particles_ != top.BeadCount()) {\n      std::cout << \"Warning: The number of beads (\" << N_particles_ << \")\";\n      std::cout << \" in the trajectory is different than defined in the topology (\" << top.BeadCount() << \")\" << std::endl;\n      std::cout << \"The number of beads from topology will be used!\" << std::endl;\n      N_particles_ = top.BeadCount();\n    }\n    chunk_rows_[0] = 1;\n    chunk_rows_[1] = N_particles_;\n    chunk_rows_[2] = variables_;\n\n    \/\/ Reads the time set and step set.\n    H5::DataSet *ds_pos_step = new H5::DataSet(atom_position_group_->openDataSet(\"step\"));\n    H5::DataSet *ds_pos_time = new H5::DataSet(atom_position_group_->openDataSet(\"time\"));\n    H5::DataSpace dsp_step = H5::DataSpace(ds_pos_step->getSpace());\n    H5::DataSpace dsp_time = H5::DataSpace(ds_pos_time->getSpace());\n    hsize_t step_dims[3];\n    dsp_step.getSimpleExtentDims(step_dims);\n    time_set_ = new double[step_dims[0]];\n    step_set_ = new int[step_dims[0]];\n    ds_pos_step->read(step_set_, H5::PredType::NATIVE_INT, dsp_step, dsp_step);\n    ds_pos_time->read(time_set_, H5::PredType::NATIVE_DOUBLE, dsp_time, dsp_time);\n\n    delete ds_pos_step;\n    delete ds_pos_time;\n\n    \/\/ Reads the box information.\n    H5::Group g_box = H5::Group(particle_group_->openGroup(\n        *particle_group_name + \"\/box\"));\n\n    H5::Attribute at_box_dimension = H5::Attribute(g_box.openAttribute(\"dimension\"));\n    int dimension;\n    at_box_dimension.read(at_box_dimension.getDataType(), &dimension);\n    if (dimension != 3 ) {\n      throw std::ios_base::failure(\"Wrong dimension \" + dimension);\n    }\n    \/\/ TODO: check also attribute periodic\n    try {\n      edges_group_ = new H5::Group(g_box.openGroup(\"edges\"));\n      has_static_box_ = false;\n      throw std::runtime_error(\"The box is not static during the simulation. Is it NVT ensemble?\");\n    } catch (H5::GroupIException not_found_error) {\n      ds_edges_ = new H5::DataSet(g_box.openDataSet(\"edges\"));\n      has_static_box_ = true;\n    }\n\n    \/\/ Gets the force group.\n    try {\n      std::string force_group_name = *particle_group_name + \"\/force\";\n      atom_force_group_ = new H5::Group(particle_group_->openGroup(force_group_name));\n      ds_atom_force_ = new H5::DataSet(atom_force_group_->openDataSet(\"value\"));\n    } catch (H5::GroupIException not_found) {\n      has_force_ = false;\n    }\n    \/\/ Gets the velocity group.\n    try {\n      std::string velocity_group_name = *particle_group_name + \"\/velocity\";\n      atom_velocity_group_ = new H5::Group(particle_group_->openGroup(velocity_group_name));\n      ds_atom_velocity_ = new H5::DataSet(atom_velocity_group_->openDataSet(\"value\"));\n    } catch (H5::GroupIException not_found) {\n      has_velocity_ = false;\n    }\n    delete particle_group_name;\n  }\n  NextFrame(top);\n  return true;\n}\n\ndouble* H5MDTrajectoryReader::ReadData(H5::DataSet *ds, int row){\n  hsize_t offset[3] = {row, 0, 0};\n  H5::DataSpace dsp = H5::DataSpace(ds->getSpace());\n  dsp.selectHyperslab(H5S_SELECT_SET, chunk_rows_, offset);\n  H5::DataSpace mspace1(variables_, chunk_rows_);\n  double *data_out = new double[N_particles_ * variables_];\n  ds->read(data_out, H5::PredType::NATIVE_DOUBLE, mspace1, dsp);\n  return data_out;\n}\n\n\/\/\/ Reading the data.\nbool H5MDTrajectoryReader::NextFrame(Topology &top) {  \/\/ NOLINT const reference\n  \/\/ Reads the position row.\n  H5::Exception::dontPrint();\n  idx_frame_++;\n  std::cout << '\\r' << \"Reading frame: \" << idx_frame_;\n  std::cout.flush();\n  hsize_t offset[3] = {idx_frame_, 0, 0};\n  double *positions;\n  try {\n    positions = ReadData(ds_atom_position_, idx_frame_);\n  } catch (H5::DataSetIException not_found) {\n      return false;\n  }\n\n  double *forces = NULL;\n  double *velocities = NULL;\n  if (has_velocity_) {\n    velocities = ReadData(ds_atom_velocity_, idx_frame_);\n  }\n\n  if (has_force_) {\n    forces = ReadData(ds_atom_force_, idx_frame_);\n  }\n\n  \/\/Process atoms.\n  for (int at_idx = 0; at_idx < N_particles_; at_idx++) {\n    double x, y, z;\n    int array_index = at_idx*variables_;\n    x = positions[array_index];\n    y = positions[array_index + 1];\n    z = positions[array_index + 2];\n    \/\/ Topology has to be defined in the xml file or in other\n    \/\/ topology files. The h5md only stores the trajectory data.\n    Bead *b = top.getBead(at_idx);\n    b->setPos(vec(x, y, z));\n    if (has_velocity_) {\n      double vx, vy, vz;\n      vx = velocities[array_index];\n      vy = velocities[array_index + 1];\n      vz = velocities[array_index + 2];\n      b->setVel(vec(vx, vy, vz));\n    }\n\n    if (has_force_) {\n      double fx, fy, fz;\n      fx = forces[array_index];\n      fy = forces[array_index + 1];\n      fz = forces[array_index + 2];\n      b->setF(vec(fx, fy, fz));\n    }\n  }\n\n  \/\/ Clean up pointers.\n  delete[] positions;\n  delete[] forces;\n  delete[] velocities;\n\n  return true;\n}\n\n}  \/\/ end csg\n}  \/\/ end votca\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ RUN: %clangxx_asan -fsized-deallocation -O0 %s -o %t\n\/\/ RUN:                                         not %run %t scalar 2>&1 | FileCheck %s -check-prefix=SCALAR\n\/\/ RUN: ASAN_OPTIONS=new_delete_type_mismatch=1 not %run %t scalar 2>&1 | FileCheck %s -check-prefix=SCALAR\n\/\/ RUN:                                         not %run %t array  2>&1 | FileCheck %s -check-prefix=ARRAY\n\/\/ RUN: ASAN_OPTIONS=new_delete_type_mismatch=1 not %run %t array  2>&1 | FileCheck %s -check-prefix=ARRAY\n\/\/ RUN: ASAN_OPTIONS=new_delete_type_mismatch=0     %run %t scalar\n\/\/ RUN: ASAN_OPTIONS=new_delete_type_mismatch=0     %run %t array\n\n\/\/ FIXME: the following two lines are not true after r232788.\n\/\/ Sized-delete is implemented with a weak delete() definition.\n\/\/ Weak symbols are kind of broken on Android.\n\/\/ XFAIL: android, asan-dynamic-runtime\n\n#include <new>\n#include <stdio.h>\n#include <string>\n\ninline void break_optimization(void *arg) {\n  __asm__ __volatile__(\"\" : : \"r\" (arg) : \"memory\");\n}\n\nstruct S12 {\n  int a, b, c;\n};\n\nstruct S20 {\n  int a, b, c, d, e;\n};\n\nstruct D1 {\n  int a, b, c;\n  ~D1() { fprintf(stderr, \"D1::~D1\\n\"); }\n};\n\nstruct D2 {\n  int a, b, c, d, e;\n  ~D2() { fprintf(stderr, \"D2::~D2\\n\"); }\n};\n\nvoid Del12(S12 *x) {\n  break_optimization(x);\n  delete x;\n}\nvoid Del12NoThrow(S12 *x) {\n  break_optimization(x);\n  operator delete(x, std::nothrow);\n}\nvoid Del12Ar(S12 *x) {\n  break_optimization(x);\n  delete [] x;\n}\nvoid Del12ArNoThrow(S12 *x) {\n  break_optimization(x);\n  operator delete[](x, std::nothrow);\n}\n\nint main(int argc, char **argv) {\n  if (argc != 2) return 1;\n  std::string flag = argv[1];\n  \/\/ These are correct.\n  Del12(new S12);\n  Del12NoThrow(new S12);\n  Del12Ar(new S12[100]);\n  Del12ArNoThrow(new S12[100]);\n\n  \/\/ Here we pass wrong type of pointer to delete,\n  \/\/ but [] and nothrow variants of delete are not sized.\n  Del12Ar(reinterpret_cast<S12*>(new S20[100]));\n  Del12NoThrow(reinterpret_cast<S12*>(new S20));\n  Del12ArNoThrow(reinterpret_cast<S12*>(new S20[100]));\n  fprintf(stderr, \"OK SO FAR\\n\");\n  \/\/ SCALAR: OK SO FAR\n  \/\/ ARRAY: OK SO FAR\n  if (flag == \"scalar\") {\n    \/\/ Here asan should bark as we are passing a wrong type of pointer\n    \/\/ to sized delete.\n    Del12(reinterpret_cast<S12*>(new S20));\n    \/\/ SCALAR: AddressSanitizer: new-delete-type-mismatch\n    \/\/ SCALAR:  object passed to delete has wrong type:\n    \/\/ SCALAR:  size of the allocated type:   20 bytes;\n    \/\/ SCALAR:  size of the deallocated type: 12 bytes.\n    \/\/ SCALAR: is located 0 bytes inside of 20-byte region\n    \/\/ SCALAR: SUMMARY: AddressSanitizer: new-delete-type-mismatch\n  } else if (flag == \"array\") {\n    D1 *d1 = reinterpret_cast<D1*>(new D2[10]);\n    break_optimization(d1);\n    delete [] d1;\n    \/\/ ARRAY-NOT: D2::~D2\n    \/\/ ARRAY: D1::~D1\n    \/\/ ARRAY: AddressSanitizer: new-delete-type-mismatch\n    \/\/ ARRAY:  size of the allocated type:   20{{4|8}} bytes;\n    \/\/ ARRAY:  size of the deallocated type: 12{{4|8}} bytes.\n  }\n}\n<commit_msg>[ASan] Remove XFAIL from now passing test.<commit_after>\/\/ RUN: %clangxx_asan -fsized-deallocation -O0 %s -o %t\n\/\/ RUN:                                         not %run %t scalar 2>&1 | FileCheck %s -check-prefix=SCALAR\n\/\/ RUN: ASAN_OPTIONS=new_delete_type_mismatch=1 not %run %t scalar 2>&1 | FileCheck %s -check-prefix=SCALAR\n\/\/ RUN:                                         not %run %t array  2>&1 | FileCheck %s -check-prefix=ARRAY\n\/\/ RUN: ASAN_OPTIONS=new_delete_type_mismatch=1 not %run %t array  2>&1 | FileCheck %s -check-prefix=ARRAY\n\/\/ RUN: ASAN_OPTIONS=new_delete_type_mismatch=0     %run %t scalar\n\/\/ RUN: ASAN_OPTIONS=new_delete_type_mismatch=0     %run %t array\n\n\/\/ FIXME: the following two lines are not true after r232788.\n\/\/ Sized-delete is implemented with a weak delete() definition.\n\/\/ Weak symbols are kind of broken on Android.\n\/\/ XFAIL: android\n\n#include <new>\n#include <stdio.h>\n#include <string>\n\ninline void break_optimization(void *arg) {\n  __asm__ __volatile__(\"\" : : \"r\" (arg) : \"memory\");\n}\n\nstruct S12 {\n  int a, b, c;\n};\n\nstruct S20 {\n  int a, b, c, d, e;\n};\n\nstruct D1 {\n  int a, b, c;\n  ~D1() { fprintf(stderr, \"D1::~D1\\n\"); }\n};\n\nstruct D2 {\n  int a, b, c, d, e;\n  ~D2() { fprintf(stderr, \"D2::~D2\\n\"); }\n};\n\nvoid Del12(S12 *x) {\n  break_optimization(x);\n  delete x;\n}\nvoid Del12NoThrow(S12 *x) {\n  break_optimization(x);\n  operator delete(x, std::nothrow);\n}\nvoid Del12Ar(S12 *x) {\n  break_optimization(x);\n  delete [] x;\n}\nvoid Del12ArNoThrow(S12 *x) {\n  break_optimization(x);\n  operator delete[](x, std::nothrow);\n}\n\nint main(int argc, char **argv) {\n  if (argc != 2) return 1;\n  std::string flag = argv[1];\n  \/\/ These are correct.\n  Del12(new S12);\n  Del12NoThrow(new S12);\n  Del12Ar(new S12[100]);\n  Del12ArNoThrow(new S12[100]);\n\n  \/\/ Here we pass wrong type of pointer to delete,\n  \/\/ but [] and nothrow variants of delete are not sized.\n  Del12Ar(reinterpret_cast<S12*>(new S20[100]));\n  Del12NoThrow(reinterpret_cast<S12*>(new S20));\n  Del12ArNoThrow(reinterpret_cast<S12*>(new S20[100]));\n  fprintf(stderr, \"OK SO FAR\\n\");\n  \/\/ SCALAR: OK SO FAR\n  \/\/ ARRAY: OK SO FAR\n  if (flag == \"scalar\") {\n    \/\/ Here asan should bark as we are passing a wrong type of pointer\n    \/\/ to sized delete.\n    Del12(reinterpret_cast<S12*>(new S20));\n    \/\/ SCALAR: AddressSanitizer: new-delete-type-mismatch\n    \/\/ SCALAR:  object passed to delete has wrong type:\n    \/\/ SCALAR:  size of the allocated type:   20 bytes;\n    \/\/ SCALAR:  size of the deallocated type: 12 bytes.\n    \/\/ SCALAR: is located 0 bytes inside of 20-byte region\n    \/\/ SCALAR: SUMMARY: AddressSanitizer: new-delete-type-mismatch\n  } else if (flag == \"array\") {\n    D1 *d1 = reinterpret_cast<D1*>(new D2[10]);\n    break_optimization(d1);\n    delete [] d1;\n    \/\/ ARRAY-NOT: D2::~D2\n    \/\/ ARRAY: D1::~D1\n    \/\/ ARRAY: AddressSanitizer: new-delete-type-mismatch\n    \/\/ ARRAY:  size of the allocated type:   20{{4|8}} bytes;\n    \/\/ ARRAY:  size of the deallocated type: 12{{4|8}} bytes.\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- llvm-nm.cpp - Symbol table dumping utility for llvm ---------------===\/\/\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 a utility that works like traditional Unix \"nm\",\n\/\/ that is, it prints out the names of symbols in a bitcode file,\n\/\/ along with some information about each symbol.\n\/\/\n\/\/ This \"nm\" does not print symbols' addresses. It supports many of\n\/\/ the features of GNU \"nm\", including its different output formats.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/LLVMContext.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/Bitcode\/ReaderWriter.h\"\n#include \"llvm\/Bitcode\/Archive.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/ManagedStatic.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include \"llvm\/Support\/PrettyStackTrace.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/System\/Signals.h\"\n#include <algorithm>\n#include <cctype>\n#include <cerrno>\n#include <cstring>\nusing namespace llvm;\n\nnamespace {\n  enum OutputFormatTy { bsd, sysv, posix };\n  cl::opt<OutputFormatTy>\n  OutputFormat(\"format\",\n       cl::desc(\"Specify output format\"),\n         cl::values(clEnumVal(bsd,   \"BSD format\"),\n                    clEnumVal(sysv,  \"System V format\"),\n                    clEnumVal(posix, \"POSIX.2 format\"),\n                    clEnumValEnd), cl::init(bsd));\n  cl::alias OutputFormat2(\"f\", cl::desc(\"Alias for --format\"),\n                          cl::aliasopt(OutputFormat));\n\n  cl::list<std::string>\n  InputFilenames(cl::Positional, cl::desc(\"<input bitcode files>\"),\n                 cl::ZeroOrMore);\n\n  cl::opt<bool> UndefinedOnly(\"undefined-only\",\n                              cl::desc(\"Show only undefined symbols\"));\n  cl::alias UndefinedOnly2(\"u\", cl::desc(\"Alias for --undefined-only\"),\n                           cl::aliasopt(UndefinedOnly));\n\n  cl::opt<bool> DefinedOnly(\"defined-only\",\n                            cl::desc(\"Show only defined symbols\"));\n\n  cl::opt<bool> ExternalOnly(\"extern-only\",\n                             cl::desc(\"Show only external symbols\"));\n  cl::alias ExternalOnly2(\"g\", cl::desc(\"Alias for --extern-only\"),\n                          cl::aliasopt(ExternalOnly));\n\n  cl::opt<bool> BSDFormat(\"B\", cl::desc(\"Alias for --format=bsd\"));\n  cl::opt<bool> POSIXFormat(\"P\", cl::desc(\"Alias for --format=posix\"));\n\n  bool MultipleFiles = false;\n\n  std::string ToolName;\n}\n\nstatic char TypeCharForSymbol(GlobalValue &GV) {\n  if (GV.isDeclaration())                                  return 'U';\n  if (GV.hasLinkOnceLinkage())                             return 'C';\n  if (GV.hasCommonLinkage())                               return 'C';\n  if (GV.hasWeakLinkage())                                 return 'W';\n  if (isa<Function>(GV) && GV.hasInternalLinkage())        return 't';\n  if (isa<Function>(GV))                                   return 'T';\n  if (isa<GlobalVariable>(GV) && GV.hasInternalLinkage())  return 'd';\n  if (isa<GlobalVariable>(GV))                             return 'D';\n  if (const GlobalAlias *GA = dyn_cast<GlobalAlias>(&GV)) {\n    const GlobalValue *AliasedGV = GA->getAliasedGlobal();\n    if (isa<Function>(AliasedGV))                          return 'T';\n    if (isa<GlobalVariable>(AliasedGV))                    return 'D';\n  }\n                                                           return '?';\n}\n\nstatic void DumpSymbolNameForGlobalValue(GlobalValue &GV) {\n  \/\/ Private linkage and available_externally linkage don't exist in symtab.\n  if (GV.hasPrivateLinkage() || GV.hasLinkerPrivateLinkage() ||\n      GV.hasAvailableExternallyLinkage()) return;\n  \n  const std::string SymbolAddrStr = \"        \"; \/\/ Not used yet...\n  char TypeChar = TypeCharForSymbol(GV);\n  if ((TypeChar != 'U') && UndefinedOnly)\n    return;\n  if ((TypeChar == 'U') && DefinedOnly)\n    return;\n  if (GV.hasLocalLinkage () && ExternalOnly)\n    return;\n  if (OutputFormat == posix) {\n    outs() << GV.getName () << \" \" << TypeCharForSymbol(GV) << \" \"\n           << SymbolAddrStr << \"\\n\";\n  } else if (OutputFormat == bsd) {\n    outs() << SymbolAddrStr << \" \" << TypeCharForSymbol(GV) << \" \"\n           << GV.getName () << \"\\n\";\n  } else if (OutputFormat == sysv) {\n    std::string PaddedName (GV.getName ());\n    while (PaddedName.length () < 20)\n      PaddedName += \" \";\n    outs() << PaddedName << \"|\" << SymbolAddrStr << \"|   \"\n           << TypeCharForSymbol(GV)\n           << \"  |                  |      |     |\\n\";\n  }\n}\n\nstatic void DumpSymbolNamesFromModule(Module *M) {\n  const std::string &Filename = M->getModuleIdentifier ();\n  if (OutputFormat == posix && MultipleFiles) {\n    outs() << Filename << \":\\n\";\n  } else if (OutputFormat == bsd && MultipleFiles) {\n    outs() << \"\\n\" << Filename << \":\\n\";\n  } else if (OutputFormat == sysv) {\n    outs() << \"\\n\\nSymbols from \" << Filename << \":\\n\\n\"\n           << \"Name                  Value   Class        Type\"\n           << \"         Size   Line  Section\\n\";\n  }\n  std::for_each (M->begin(), M->end(), DumpSymbolNameForGlobalValue);\n  std::for_each (M->global_begin(), M->global_end(),\n                 DumpSymbolNameForGlobalValue);\n  std::for_each (M->alias_begin(), M->alias_end(),\n                 DumpSymbolNameForGlobalValue);\n}\n\nstatic void DumpSymbolNamesFromFile(std::string &Filename) {\n  LLVMContext &Context = getGlobalContext();\n  std::string ErrorMessage;\n  sys::Path aPath(Filename);\n  \/\/ Note: Currently we do not support reading an archive from stdin.\n  if (Filename == \"-\" || aPath.isBitcodeFile()) {\n    std::auto_ptr<MemoryBuffer> Buffer(\n                   MemoryBuffer::getFileOrSTDIN(Filename, &ErrorMessage));\n    Module *Result = 0;\n    if (Buffer.get())\n      Result = ParseBitcodeFile(Buffer.get(), Context, &ErrorMessage);\n    \n    if (Result)\n      DumpSymbolNamesFromModule(Result);\n    else {\n      errs() << ToolName << \": \" << Filename << \": \" << ErrorMessage << \"\\n\";\n      return;\n    }\n    \n  } else if (aPath.isArchive()) {\n    std::string ErrMsg;\n    Archive* archive = Archive::OpenAndLoad(sys::Path(Filename), Context,\n                                            &ErrorMessage);\n    if (!archive)\n      errs() << ToolName << \": \" << Filename << \": \" << ErrorMessage << \"\\n\";\n    std::vector<Module *> Modules;\n    if (archive->getAllModules(Modules, &ErrorMessage)) {\n      errs() << ToolName << \": \" << Filename << \": \" << ErrorMessage << \"\\n\";\n      return;\n    }\n    MultipleFiles = true;\n    std::for_each (Modules.begin(), Modules.end(), DumpSymbolNamesFromModule);\n  } else {\n    errs() << ToolName << \": \" << Filename << \": \"\n           << \"unrecognizable file type\\n\";\n    return;\n  }\n}\n\nint main(int argc, char **argv) {\n  \/\/ Print a stack trace if we signal out.\n  sys::PrintStackTraceOnErrorSignal();\n  PrettyStackTraceProgram X(argc, argv);\n  \n  llvm_shutdown_obj Y;  \/\/ Call llvm_shutdown() on exit.\n  cl::ParseCommandLineOptions(argc, argv, \"llvm symbol table dumper\\n\");\n\n  ToolName = argv[0];\n  if (BSDFormat) OutputFormat = bsd;\n  if (POSIXFormat) OutputFormat = posix;\n\n  switch (InputFilenames.size()) {\n  case 0: InputFilenames.push_back(\"-\");\n  case 1: break;\n  default: MultipleFiles = true;\n  }\n\n  std::for_each(InputFilenames.begin(), InputFilenames.end(),\n                DumpSymbolNamesFromFile);\n  return 0;\n}\n<commit_msg>fix leakage of Module<commit_after>\/\/===-- llvm-nm.cpp - Symbol table dumping utility for llvm ---------------===\/\/\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 a utility that works like traditional Unix \"nm\",\n\/\/ that is, it prints out the names of symbols in a bitcode file,\n\/\/ along with some information about each symbol.\n\/\/\n\/\/ This \"nm\" does not print symbols' addresses. It supports many of\n\/\/ the features of GNU \"nm\", including its different output formats.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/LLVMContext.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/Bitcode\/ReaderWriter.h\"\n#include \"llvm\/Bitcode\/Archive.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/ManagedStatic.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include \"llvm\/Support\/PrettyStackTrace.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/System\/Signals.h\"\n#include <algorithm>\n#include <cctype>\n#include <cerrno>\n#include <cstring>\nusing namespace llvm;\n\nnamespace {\n  enum OutputFormatTy { bsd, sysv, posix };\n  cl::opt<OutputFormatTy>\n  OutputFormat(\"format\",\n       cl::desc(\"Specify output format\"),\n         cl::values(clEnumVal(bsd,   \"BSD format\"),\n                    clEnumVal(sysv,  \"System V format\"),\n                    clEnumVal(posix, \"POSIX.2 format\"),\n                    clEnumValEnd), cl::init(bsd));\n  cl::alias OutputFormat2(\"f\", cl::desc(\"Alias for --format\"),\n                          cl::aliasopt(OutputFormat));\n\n  cl::list<std::string>\n  InputFilenames(cl::Positional, cl::desc(\"<input bitcode files>\"),\n                 cl::ZeroOrMore);\n\n  cl::opt<bool> UndefinedOnly(\"undefined-only\",\n                              cl::desc(\"Show only undefined symbols\"));\n  cl::alias UndefinedOnly2(\"u\", cl::desc(\"Alias for --undefined-only\"),\n                           cl::aliasopt(UndefinedOnly));\n\n  cl::opt<bool> DefinedOnly(\"defined-only\",\n                            cl::desc(\"Show only defined symbols\"));\n\n  cl::opt<bool> ExternalOnly(\"extern-only\",\n                             cl::desc(\"Show only external symbols\"));\n  cl::alias ExternalOnly2(\"g\", cl::desc(\"Alias for --extern-only\"),\n                          cl::aliasopt(ExternalOnly));\n\n  cl::opt<bool> BSDFormat(\"B\", cl::desc(\"Alias for --format=bsd\"));\n  cl::opt<bool> POSIXFormat(\"P\", cl::desc(\"Alias for --format=posix\"));\n\n  bool MultipleFiles = false;\n\n  std::string ToolName;\n}\n\nstatic char TypeCharForSymbol(GlobalValue &GV) {\n  if (GV.isDeclaration())                                  return 'U';\n  if (GV.hasLinkOnceLinkage())                             return 'C';\n  if (GV.hasCommonLinkage())                               return 'C';\n  if (GV.hasWeakLinkage())                                 return 'W';\n  if (isa<Function>(GV) && GV.hasInternalLinkage())        return 't';\n  if (isa<Function>(GV))                                   return 'T';\n  if (isa<GlobalVariable>(GV) && GV.hasInternalLinkage())  return 'd';\n  if (isa<GlobalVariable>(GV))                             return 'D';\n  if (const GlobalAlias *GA = dyn_cast<GlobalAlias>(&GV)) {\n    const GlobalValue *AliasedGV = GA->getAliasedGlobal();\n    if (isa<Function>(AliasedGV))                          return 'T';\n    if (isa<GlobalVariable>(AliasedGV))                    return 'D';\n  }\n                                                           return '?';\n}\n\nstatic void DumpSymbolNameForGlobalValue(GlobalValue &GV) {\n  \/\/ Private linkage and available_externally linkage don't exist in symtab.\n  if (GV.hasPrivateLinkage() || GV.hasLinkerPrivateLinkage() ||\n      GV.hasAvailableExternallyLinkage()) return;\n  \n  const std::string SymbolAddrStr = \"        \"; \/\/ Not used yet...\n  char TypeChar = TypeCharForSymbol(GV);\n  if ((TypeChar != 'U') && UndefinedOnly)\n    return;\n  if ((TypeChar == 'U') && DefinedOnly)\n    return;\n  if (GV.hasLocalLinkage () && ExternalOnly)\n    return;\n  if (OutputFormat == posix) {\n    outs() << GV.getName () << \" \" << TypeCharForSymbol(GV) << \" \"\n           << SymbolAddrStr << \"\\n\";\n  } else if (OutputFormat == bsd) {\n    outs() << SymbolAddrStr << \" \" << TypeCharForSymbol(GV) << \" \"\n           << GV.getName () << \"\\n\";\n  } else if (OutputFormat == sysv) {\n    std::string PaddedName (GV.getName ());\n    while (PaddedName.length () < 20)\n      PaddedName += \" \";\n    outs() << PaddedName << \"|\" << SymbolAddrStr << \"|   \"\n           << TypeCharForSymbol(GV)\n           << \"  |                  |      |     |\\n\";\n  }\n}\n\nstatic void DumpSymbolNamesFromModule(Module *M) {\n  const std::string &Filename = M->getModuleIdentifier ();\n  if (OutputFormat == posix && MultipleFiles) {\n    outs() << Filename << \":\\n\";\n  } else if (OutputFormat == bsd && MultipleFiles) {\n    outs() << \"\\n\" << Filename << \":\\n\";\n  } else if (OutputFormat == sysv) {\n    outs() << \"\\n\\nSymbols from \" << Filename << \":\\n\\n\"\n           << \"Name                  Value   Class        Type\"\n           << \"         Size   Line  Section\\n\";\n  }\n  std::for_each (M->begin(), M->end(), DumpSymbolNameForGlobalValue);\n  std::for_each (M->global_begin(), M->global_end(),\n                 DumpSymbolNameForGlobalValue);\n  std::for_each (M->alias_begin(), M->alias_end(),\n                 DumpSymbolNameForGlobalValue);\n}\n\nstatic void DumpSymbolNamesFromFile(std::string &Filename) {\n  LLVMContext &Context = getGlobalContext();\n  std::string ErrorMessage;\n  sys::Path aPath(Filename);\n  \/\/ Note: Currently we do not support reading an archive from stdin.\n  if (Filename == \"-\" || aPath.isBitcodeFile()) {\n    std::auto_ptr<MemoryBuffer> Buffer(\n                   MemoryBuffer::getFileOrSTDIN(Filename, &ErrorMessage));\n    Module *Result = 0;\n    if (Buffer.get())\n      Result = ParseBitcodeFile(Buffer.get(), Context, &ErrorMessage);\n    \n    if (Result) {\n      DumpSymbolNamesFromModule(Result);\n      delete Result;\n    } else\n      errs() << ToolName << \": \" << Filename << \": \" << ErrorMessage << \"\\n\";\n    \n  } else if (aPath.isArchive()) {\n    std::string ErrMsg;\n    Archive* archive = Archive::OpenAndLoad(sys::Path(Filename), Context,\n                                            &ErrorMessage);\n    if (!archive)\n      errs() << ToolName << \": \" << Filename << \": \" << ErrorMessage << \"\\n\";\n    std::vector<Module *> Modules;\n    if (archive->getAllModules(Modules, &ErrorMessage)) {\n      errs() << ToolName << \": \" << Filename << \": \" << ErrorMessage << \"\\n\";\n      return;\n    }\n    MultipleFiles = true;\n    std::for_each (Modules.begin(), Modules.end(), DumpSymbolNamesFromModule);\n  } else {\n    errs() << ToolName << \": \" << Filename << \": \"\n           << \"unrecognizable file type\\n\";\n    return;\n  }\n}\n\nint main(int argc, char **argv) {\n  \/\/ Print a stack trace if we signal out.\n  sys::PrintStackTraceOnErrorSignal();\n  PrettyStackTraceProgram X(argc, argv);\n  \n  llvm_shutdown_obj Y;  \/\/ Call llvm_shutdown() on exit.\n  cl::ParseCommandLineOptions(argc, argv, \"llvm symbol table dumper\\n\");\n\n  ToolName = argv[0];\n  if (BSDFormat) OutputFormat = bsd;\n  if (POSIXFormat) OutputFormat = posix;\n\n  switch (InputFilenames.size()) {\n  case 0: InputFilenames.push_back(\"-\");\n  case 1: break;\n  default: MultipleFiles = true;\n  }\n\n  std::for_each(InputFilenames.begin(), InputFilenames.end(),\n                DumpSymbolNamesFromFile);\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Fix in initialization of last particle in the stack, needed for the separate simulation of trigger event (#1189)<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>(Hopefully) fix msvc build.<commit_after><|endoftext|>"}
{"text":"<commit_before>#ifndef ABSTRACT_ALGEBRA_HPP\n#define ABSTRACT_ALGEBRA_HPP\n\n#include <algorithm>\n#include <forward_list>\n#include <iostream>\n#include <fstream>\n#include <list>\n#include <memory>\n#include <numeric>\n#include <set>\n#include <stack>\n#include <string>\n#include <unordered_map>\n#include <unordered_set>\n\n\/\/ TODO: Rethink how to track remaining elements. Loading a set with all elements could be a space hog with for large permutations.\n\/\/ TODO: Add usage and comment functions\nnamespace Permutation\n{\n    \n    namespace utility\n    {\n        size_t gcd( size_t a, size_t b)\n        {\n            for (;;)\n            {\n                if ( a == 0)\n                {\n                    return b;\n                }\n                b %= a;\n                if ( b == 0)\n                {\n                    return a;\n                }\n                a %= b;\n            }\n        }\n\n        size_t lcm( size_t a, size_t b)\n        {\n            size_t temp = gcd( a, b);\n            return temp ? (a \/ temp * b) : 0;\n        }\n    }\n    \n    typedef std::unordered_map<size_t, size_t> nPermutation;\n    typedef std::list<nPermutation> composition;\n    typedef std::pair<size_t, size_t> movesToPair;\n    \n    inline void printPermutation( nPermutation &permutation)\n    {\n        for( auto &it : permutation)\n        {\n            printf( \"%zu -> %zu\\n\", it.first, it.second);\n        }\n    }\n    \n    inline bool isIdentity( nPermutation &permutation)\n    {\n        for( auto& p : permutation)\n        {\n            if( p.first != p.second)\n            {\n                return false;\n            }\n        }\n        return true;\n    }\n    \n    void printCycleNotation( nPermutation &permutation)\n    {\n        if( isIdentity(permutation))\n        {\n            printf( \"( 1 ) \");\n            return;\n        }\n\n        std::set<size_t> remaining;\n        for( auto &it : permutation)\n        {\n            remaining.insert( it.first);\n        }\n        \n        while( !remaining.empty())\n        {\n            auto begin = *(remaining.begin());\n            remaining.erase( begin);\n            \n            auto destination = permutation.at( begin);\n            if( destination == begin)\n            {\n                continue;\n            }\n\n            printf( \"( %zu\", begin);\n            \n            while(  destination != begin )\n            {\n                printf( \" %zu\", destination);\n                remaining.erase( destination);\n                destination = permutation.at( destination);\n            }\n\n            printf( \" ) \");\n            \n        }            \n    }\n    \n    void printCOF(composition& permutations)\n    {\n        composition::iterator it = permutations.begin();\n        if( it == permutations.end())\n        {\n            return;\n        }\n        printCycleNotation( *(it++));            \n        \n        while( it != permutations.end())\n        {\n            if( (*it).empty())\n            {\n                continue;\n            }\n\n            printf(\" ∘ \");\n            printCycleNotation( *(it++));\n        }\n        \n    }\n    \n    std::unique_ptr<nPermutation> compose( composition& permutations)\n    {\n        std::unique_ptr<nPermutation> result = std::make_unique<nPermutation>();\n        composition::reverse_iterator rit = permutations.rbegin();\n        \n        std::unordered_set<size_t> keys;\n        \n        for( ; rit != permutations.rend(); ++rit)\n        {\n            for( auto& p : *rit)\n            {\n                keys.insert( p.first);\n            }\n        }\n        \n        rit = permutations.rbegin();\n        \n        for( auto& element : keys)\n        {\n            auto destination = element;\n            while( rit != permutations.rend())\n            {\n                if( (*rit).count( destination))\n                {\n                    destination = (*rit).at( destination);\n                }\n                ++rit;\n            }\n            result->insert( movesToPair( element, destination));\n            rit = permutations.rbegin();\n        }\n        \n        return result;\n    }\n    \n    std::unique_ptr<nPermutation> inverse( nPermutation& permutation)\n    {\n        std::unique_ptr<nPermutation> inv = std::make_unique<nPermutation>();\n        for( auto& pair : permutation)\n        {\n            inv->insert( movesToPair( pair.second, pair.first));\n        }\n        return inv;\n    }\n\n    size_t order( nPermutation& permutation)\n    {\n        std::set<size_t> remaining;\n        for( auto &it : permutation)\n        {\n            remaining.insert( it.first);\n        }\n        \n        std::forward_list<size_t> lengthsOfCycles;\n        while( !remaining.empty())\n        {\n            auto begin = *(remaining.begin());\n            remaining.erase( begin);\n            \n            auto destination = permutation.at( begin);\n            if( destination == begin)\n            {\n                continue;\n            }\n\n            size_t length = 1;\n            while(  destination != begin )\n            {\n                remaining.erase( destination);\n                destination = permutation.at( destination);\n                ++length;\n            }\n            lengthsOfCycles.push_front( length);\n\n        }            \n\n        return std::accumulate( lengthsOfCycles.begin(), lengthsOfCycles.end(), 1, utility::lcm);\n    }\n    \n    std::unique_ptr<std::unordered_map<std::string, nPermutation>> readPermutations( const char* filename)\n    {\n        std::ifstream fin{ filename};\n\n        if( !fin.is_open())\n        {\n            std::cerr << filename << \" was not opened properly. Please check if the filename is correct. The function will return 'nullptr'.\" << std::endl;\n            return nullptr;\n        }\n\n        std::unique_ptr<std::unordered_map<std::string,nPermutation>> hash_bag = std::make_unique<std::unordered_map<std::string,nPermutation>>();\n\n        std::string key;\n        size_t totalPermutations = 0;\n\n        fin >> totalPermutations;\n        if( fin.good())\n        {\n            size_t first, second;\n            for(; totalPermutations > 0; --totalPermutations)\n            {\n                std::unique_ptr<nPermutation> perm = std::make_unique<nPermutation>();\n                fin >> key;\n                while( fin >> first >> second)\n                {\n                    perm->insert( movesToPair( first, second));\n                }\n\n                hash_bag->insert( std::make_pair(key, *(perm.release())));\n                fin.clear();\n            }\n        }\n        fin.close();\n        return hash_bag;\n    }\n\n    void printProductOfTrans( nPermutation& permutation)\n    {\n        std::set<size_t> remaining;\n        for( auto&it : permutation)\n        {\n            remaining.insert( it.first);\n        }\n\n        while( !remaining.empty())\n        {\n            std::stack<size_t> inCycle;\n\n            size_t begin = *remaining.begin();\n            remaining.erase( begin);\n            \n            auto destination = permutation.at( begin);\n            while( destination != begin )\n            {\n                inCycle.push(destination);\n                remaining.erase( destination);\n                destination = permutation.at( destination);\n            }\n\n            while( !inCycle.empty())\n            {\n                printf( \"( %zu %zu ) \", begin, inCycle.top());\n                inCycle.pop();\n            }\n        }\n    }\n\n    bool isEven( nPermutation& permutation)\n    {\n        std::set<size_t> remaining;\n        for( auto&it : permutation)\n        {\n            remaining.insert( it.first);\n        }\n\n        size_t count = 0;\n        while( !remaining.empty())\n        {\n           size_t begin = *remaining.begin();\n           remaining.erase( begin);\n\n            auto destination = permutation.at( begin);\n            while( destination != begin)\n            {\n                count = (count+1) % 2;\n                remaining.erase( destination);\n                destination = permutation.at( destination);\n            }\n        }\n        return count ? 0 : 1;\n    }\n\n} \/\/ end of namespace Permutation\n\n#endif \/\/ SYMMETRIC_HPP\n<commit_msg>minor edit<commit_after>#ifndef ABSTRACT_ALGEBRA_HPP\n#define ABSTRACT_ALGEBRA_HPP\n\n#include <algorithm>\n#include <forward_list>\n#include <iostream>\n#include <fstream>\n#include <list>\n#include <memory>\n#include <numeric>\n#include <set>\n#include <stack>\n#include <string>\n#include <unordered_map>\n#include <unordered_set>\n\n\/\/ TODO: Rethink how to track remaining elements. Loading a set with all elements could be a space hog with for large permutations.\n\/\/ TODO: Add usage and comment functions\nnamespace Permutation\n{\n    \n    namespace utility\n    {\n        size_t gcd( size_t a, size_t b)\n        {\n            for (;;)\n            {\n                if ( a == 0)\n                {\n                    return b;\n                }\n                b %= a;\n                if ( b == 0)\n                {\n                    return a;\n                }\n                a %= b;\n            }\n        }\n\n        size_t lcm( size_t a, size_t b)\n        {\n            size_t temp = gcd( a, b);\n            return temp ? (a \/ temp * b) : 0;\n        }\n    }\n    \n    typedef std::unordered_map<size_t, size_t> nPermutation;\n    typedef std::list<nPermutation> composition;\n    typedef std::pair<size_t, size_t> movesToPair;\n    \n    inline void printPermutation( nPermutation &permutation)\n    {\n        for( auto &it : permutation)\n        {\n            printf( \"%zu -> %zu\\n\", it.first, it.second);\n        }\n    }\n    \n    inline bool isIdentity( nPermutation &permutation)\n    {\n        for( auto& p : permutation)\n        {\n            if( p.first != p.second)\n            {\n                return false;\n            }\n        }\n        return true;\n    }\n    \n    void printCycleNotation( nPermutation &permutation)\n    {\n        if( isIdentity(permutation))\n        {\n            printf( \"( 1 ) \");\n            return;\n        }\n\n        std::set<size_t> remaining;\n        for( auto &it : permutation)\n        {\n            remaining.insert( it.first);\n        }\n        \n        while( !remaining.empty())\n        {\n            auto begin = *(remaining.begin());\n            remaining.erase( begin);\n            \n            auto destination = permutation.at( begin);\n            if( destination == begin)\n            {\n                continue;\n            }\n\n            printf( \"( %zu\", begin);\n            \n            while(  destination != begin )\n            {\n                printf( \" %zu\", destination);\n                remaining.erase( destination);\n                destination = permutation.at( destination);\n            }\n\n            printf( \" ) \");\n            \n        }            \n    }\n    \n    void printCOF( composition& permutations)\n    {\n        composition::iterator it = permutations.begin();\n        if( it == permutations.end())\n        {\n            return;\n        }\n        printCycleNotation( *(it++));            \n        \n        while( it != permutations.end())\n        {\n            if( (*it).empty())\n            {\n                continue;\n            }\n\n            printf(\" ∘ \");\n            printCycleNotation( *(it++));\n        }\n        \n    }\n    \n    std::unique_ptr<nPermutation> compose( composition& permutations)\n    {\n        std::unique_ptr<nPermutation> result = std::make_unique<nPermutation>();\n        composition::reverse_iterator rit = permutations.rbegin();\n        \n        std::unordered_set<size_t> keys;\n        \n        for( ; rit != permutations.rend(); ++rit)\n        {\n            for( auto& p : *rit)\n            {\n                keys.insert( p.first);\n            }\n        }\n        \n        rit = permutations.rbegin();\n        \n        for( auto& element : keys)\n        {\n            auto destination = element;\n            while( rit != permutations.rend())\n            {\n                if( (*rit).count( destination))\n                {\n                    destination = (*rit).at( destination);\n                }\n                ++rit;\n            }\n            result->insert( movesToPair( element, destination));\n            rit = permutations.rbegin();\n        }\n        \n        return result;\n    }\n    \n    std::unique_ptr<nPermutation> inverse( nPermutation& permutation)\n    {\n        std::unique_ptr<nPermutation> inv = std::make_unique<nPermutation>();\n        for( auto& pair : permutation)\n        {\n            inv->insert( movesToPair( pair.second, pair.first));\n        }\n        return inv;\n    }\n\n    size_t order( nPermutation& permutation)\n    {\n        std::set<size_t> remaining;\n        for( auto &it : permutation)\n        {\n            remaining.insert( it.first);\n        }\n        \n        std::forward_list<size_t> lengthsOfCycles;\n        while( !remaining.empty())\n        {\n            auto begin = *(remaining.begin());\n            remaining.erase( begin);\n            \n            auto destination = permutation.at( begin);\n            if( destination == begin)\n            {\n                continue;\n            }\n\n            size_t length = 1;\n            while(  destination != begin )\n            {\n                remaining.erase( destination);\n                destination = permutation.at( destination);\n                ++length;\n            }\n            lengthsOfCycles.push_front( length);\n\n        }            \n\n        return std::accumulate( lengthsOfCycles.begin(), lengthsOfCycles.end(), 1, utility::lcm);\n    }\n    \n    std::unique_ptr<std::unordered_map<std::string, nPermutation>> readPermutations( const char* filename)\n    {\n        std::ifstream fin{ filename};\n\n        if( !fin.is_open())\n        {\n            std::cerr << filename << \" was not opened properly. Please check if the filename is correct. The function will return 'nullptr'.\" << std::endl;\n            return nullptr;\n        }\n\n        std::unique_ptr<std::unordered_map<std::string,nPermutation>> hash_bag = std::make_unique<std::unordered_map<std::string,nPermutation>>();\n\n        std::string key;\n        size_t totalPermutations = 0;\n\n        fin >> totalPermutations;\n        if( fin.good())\n        {\n            size_t first, second;\n            for(; totalPermutations > 0; --totalPermutations)\n            {\n                std::unique_ptr<nPermutation> perm = std::make_unique<nPermutation>();\n                fin >> key;\n                while( fin >> first >> second)\n                {\n                    perm->insert( movesToPair( first, second));\n                }\n\n                hash_bag->insert( std::make_pair(key, *(perm.release())));\n                fin.clear();\n            }\n        }\n        fin.close();\n        return hash_bag;\n    }\n\n    void printProductOfTrans( nPermutation& permutation)\n    {\n        std::set<size_t> remaining;\n        for( auto&it : permutation)\n        {\n            remaining.insert( it.first);\n        }\n\n        while( !remaining.empty())\n        {\n            std::stack<size_t> inCycle;\n\n            size_t begin = *remaining.begin();\n            remaining.erase( begin);\n            \n            auto destination = permutation.at( begin);\n            while( destination != begin )\n            {\n                inCycle.push(destination);\n                remaining.erase( destination);\n                destination = permutation.at( destination);\n            }\n\n            while( !inCycle.empty())\n            {\n                printf( \"( %zu %zu ) \", begin, inCycle.top());\n                inCycle.pop();\n            }\n        }\n    }\n\n    bool isEven( nPermutation& permutation)\n    {\n        std::set<size_t> remaining;\n        for( auto&it : permutation)\n        {\n            remaining.insert( it.first);\n        }\n\n        size_t count = 0;\n        while( !remaining.empty())\n        {\n           size_t begin = *remaining.begin();\n           remaining.erase( begin);\n\n            auto destination = permutation.at( begin);\n            while( destination != begin)\n            {\n                count = (count+1) % 2;\n                remaining.erase( destination);\n                destination = permutation.at( destination);\n            }\n        }\n        return count ? 0 : 1;\n    }\n\n} \/\/ end of namespace Permutation\n\n#endif \/\/ SYMMETRIC_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\n***************************************\r\n*   Asylum3D @ 2014-12-17\r\n***************************************\r\n*\/\r\n\r\n#ifndef __ASYLUM3D_HPP__\r\n#define __ASYLUM3D_HPP__\r\n\r\n\/* Asylum Namespace *\/\r\nnamespace asy {\r\n\r\n\/***********\/\r\n\/* VertexN *\/\r\n\/***********\/\r\nstruct vertex_n\r\n{\r\n    vec3d_t pos;\r\n    vec3d_t nrm;\r\n};\r\n\r\n\/************\/\r\n\/* VertexT2 *\/\r\n\/************\/\r\nstruct vertex_t2\r\n{\r\n    vec3d_t pos;\r\n    vec2d_t tex;\r\n};\r\n\r\n\/************\/\r\n\/* VertexT3 *\/\r\n\/************\/\r\nstruct vertex_t3\r\n{\r\n    vec3d_t pos;\r\n    vec3d_t tex;\r\n};\r\n\r\n\/*************\/\r\n\/* VertexNT2 *\/\r\n\/*************\/\r\nstruct vertex_nt2\r\n{\r\n    vec3d_t pos;\r\n    vec3d_t nrm;\r\n    vec2d_t tex;\r\n};\r\n\r\n\/*************\/\r\n\/* VertexNT3 *\/\r\n\/*************\/\r\nstruct vertex_nt3\r\n{\r\n    vec3d_t pos;\r\n    vec3d_t nrm;\r\n    vec3d_t tex;\r\n};\r\n\r\n\/***************\/\r\n\/* Effect Port *\/\r\n\/***************\/\r\nclass effect_i : public asylum\r\n{\r\npublic:\r\n    \/* ================= *\/\r\n    virtual ~effect_i () {}\r\n\r\npublic:\r\n    \/* ==================== *\/\r\n    virtual void enter () = 0;\r\n\r\n    \/* ==================== *\/\r\n    virtual void leave () = 0;\r\n};\r\n\r\n\/*****************\/\r\n\/* Material Port *\/\r\n\/*****************\/\r\nclass material_i : public asylum\r\n{\r\npublic:\r\n    \/* =================== *\/\r\n    virtual ~material_i () {}\r\n\r\npublic:\r\n    \/* =============================== *\/\r\n    virtual void commit (bool trans) = 0;\r\n};\r\n\r\n}   \/* namespace *\/\r\n\r\n#endif  \/* __ASYLUM3D_HPP__ *\/\r\n<commit_msg>Asylum: 使用新的接口<commit_after>\/*\r\n***************************************\r\n*   Asylum3D @ 2014-12-17\r\n***************************************\r\n*\/\r\n\r\n#ifndef __ASYLUM3D_HPP__\r\n#define __ASYLUM3D_HPP__\r\n\r\n\/* Asylum Namespace *\/\r\nnamespace asy {\r\n\r\n\/***********\/\r\n\/* VertexN *\/\r\n\/***********\/\r\nstruct vertex_n\r\n{\r\n    vec3d_t pos;\r\n    vec3d_t nrm;\r\n};\r\n\r\n\/************\/\r\n\/* VertexT2 *\/\r\n\/************\/\r\nstruct vertex_t2\r\n{\r\n    vec3d_t pos;\r\n    vec2d_t tex;\r\n};\r\n\r\n\/************\/\r\n\/* VertexT3 *\/\r\n\/************\/\r\nstruct vertex_t3\r\n{\r\n    vec3d_t pos;\r\n    vec3d_t tex;\r\n};\r\n\r\n\/*************\/\r\n\/* VertexNT2 *\/\r\n\/*************\/\r\nstruct vertex_nt2\r\n{\r\n    vec3d_t pos;\r\n    vec3d_t nrm;\r\n    vec2d_t tex;\r\n};\r\n\r\n\/*************\/\r\n\/* VertexNT3 *\/\r\n\/*************\/\r\nstruct vertex_nt3\r\n{\r\n    vec3d_t pos;\r\n    vec3d_t nrm;\r\n    vec3d_t tex;\r\n};\r\n\r\n\/***************\/\r\n\/* Effect Port *\/\r\n\/***************\/\r\nclass IEffect : public asylum\r\n{\r\npublic:\r\n    \/* ================ *\/\r\n    virtual ~IEffect () {}\r\n\r\npublic:\r\n    \/* ==================== *\/\r\n    virtual void enter () = 0;\r\n\r\n    \/* ==================== *\/\r\n    virtual void leave () = 0;\r\n};\r\n\r\n\/******************\/\r\n\/* Attribute Port *\/\r\n\/******************\/\r\nclass IAttrib : public asylum\r\n{\r\npublic:\r\n    \/* ================ *\/\r\n    virtual ~IAttrib () {}\r\n\r\npublic:\r\n    \/* ===================== *\/\r\n    virtual void commit () = 0;\r\n\r\n    \/* ===================== *\/\r\n    virtual int32u type () = 0;\r\n};\r\n\r\n\/*************\/\r\n\/* Mesh Port *\/\r\n\/*************\/\r\nclass IMesh : public asylum\r\n{\r\npublic:\r\n    \/* ============== *\/\r\n    virtual ~IMesh () {}\r\n\r\n    \/* ===================== *\/\r\n    virtual void commit () = 0;\r\n\r\n    \/* ============================================== *\/\r\n    virtual void bound (sAABB* aabb, sSPHERE* ball) = 0;\r\n};\r\n\r\n}   \/* namespace *\/\r\n\r\n#endif  \/* __ASYLUM3D_HPP__ *\/\r\n<|endoftext|>"}
{"text":"<commit_before>\n#include <Beard\/detail\/gr_ceformat.hpp>\n#include <Beard\/tty\/TerminalInfo.hpp>\n\n#include <duct\/EndianUtils.hpp>\n#include <duct\/IO\/arithmetic.hpp>\n#include <duct\/IO\/unicode.hpp>\n\n#include <istream>\n\nnamespace Beard {\nnamespace tty {\n\n\/\/ class TerminalInfo implementation\n\n#define BEARD_SCOPE_CLASS tty::TerminalInfo\n\nTerminalInfo::~TerminalInfo() noexcept = default;\n\nTerminalInfo::TerminalInfo() noexcept\n\t: m_initialized(false)\n\t, m_names()\n\t, m_cap_flags()\n\t, m_cap_numbers()\n\t, m_cap_strings()\n{}\n\nTerminalInfo::TerminalInfo(TerminalInfo&&) noexcept = default;\nTerminalInfo::TerminalInfo(TerminalInfo const&) = default;\nTerminalInfo& TerminalInfo::operator=(TerminalInfo&&) noexcept = default;\n\n\/\/ serialization\n\n\/\/ TODO: <tic.h> specifies some differences:\n\/\/ 1. max names field size is 512 (XSI);\n\/\/ 2. there are two different \"signed\" values specifying\n\/\/\t  different meanings for capabilities;\n\n\/\/ terminfo format:\n\/*\n\tuint16_t magic = 0x011a\n\n\tuint16_t names_size\n\tuint16_t flag_count\n\tuint16_t number_count\n\tuint16_t string_offset_count\n\tuint16_t string_table_size\n\n\t\/\/ Names for terminal type, separated by '|'\n\tchar names[names_size]\n\n\t\/\/ Boolean flags\n\tuint8_t flags[flag_count]\n\n\t\/\/ Seek ahead to align to 2-byte word (ergo: possible dead byte)\n\n\tuint16_t numbers[number_count]\n\n\t\/\/ Offsets are relative to string_table\n\tuint16_t string_offsets[string_offset_count]\n\tchar string_table[string_table_size]\n*\/\n\nnamespace {\nenum : unsigned {\n\tterminfo_magic = 0x011a,\n\tterminfo_max_names_size = 128u,\n\n\tterminfo_table_offset_empty = 0xFFFFu,\n\tmask_offset_signbit = 0x8000,\n};\n\nconstexpr auto const\nterminfo_endian = duct::Endian::little;\n\nstruct terminfo_header {\n\tuint16_t magic{0};\n\tuint16_t names_size{0};\n\tuint16_t flag_count{0};\n\tuint16_t number_count{0};\n\tuint16_t string_offset_count{0};\n\tuint16_t string_table_size{0};\n};\n} \/\/ anonymous namespace\n\n#define BEARD_TERMINFO_CHECK_IO_ERROR_(m_)\t\t\t\t\\\n\tif (stream.fail()) {\t\t\t\t\t\t\t\t\\\n\t\tBEARD_THROW_FQN(\t\t\t\t\t\t\t\t\\\n\t\t\tErrorCode::serialization_io_failed,\t\t\t\\\n\t\t\tm_\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\\\n\t}\n\/\/\n\n#define BEARD_SCOPE_FUNC deserialize\nnamespace {\nBEARD_DEF_FMT_FQN(\n\ts_err_bad_magic,\n\t\"bad magic encountered: expected %-#04x, got %-#04x\"\n);\nBEARD_DEF_FMT_FQN(\n\ts_err_name_too_large,\n\t\"names section too large: expected s <= %u, got s = %u\"\n);\nBEARD_DEF_FMT_FQN(\n\ts_err_string_offset_invalid,\n\t\"index %u offset %u overflows string table (size = %u)\"\n);\n} \/\/ anonymous namespace\n\nvoid\nTerminalInfo::deserialize(\n\tstd::istream& stream\n) {\n\tm_initialized = false;\n\tm_names.clear();\n\tm_cap_flags.clear();\n\tm_cap_numbers.clear();\n\tm_cap_strings.clear();\n\n\tterminfo_header hdr{};\n\n\t\/\/ header\n\tduct::IO::read_arithmetic(stream, hdr.magic, terminfo_endian);\n\tduct::IO::read_arithmetic(stream, hdr.names_size, terminfo_endian);\n\tduct::IO::read_arithmetic(stream, hdr.flag_count, terminfo_endian);\n\tduct::IO::read_arithmetic(stream, hdr.number_count, terminfo_endian);\n\tduct::IO::read_arithmetic(stream, hdr.string_offset_count, terminfo_endian);\n\tduct::IO::read_arithmetic(stream, hdr.string_table_size, terminfo_endian);\n\n\tBEARD_TERMINFO_CHECK_IO_ERROR_(\n\t\t\"failed to read header\"\n\t);\n\n\tif (terminfo_magic != hdr.magic) {\n\t\tBEARD_THROW_FMT(\n\t\t\tErrorCode::serialization_data_malformed,\n\t\t\ts_err_bad_magic,\n\t\t\tstatic_cast<unsigned>(terminfo_magic),\n\t\t\tstatic_cast<unsigned>(hdr.magic)\n\t\t);\n\t}\n\n\tif (terminfo_max_names_size < hdr.names_size) {\n\t\tBEARD_THROW_FMT(\n\t\t\tErrorCode::serialization_data_malformed,\n\t\t\ts_err_name_too_large,\n\t\t\tstatic_cast<unsigned>(terminfo_max_names_size),\n\t\t\tstatic_cast<unsigned>(hdr.names_size)\n\t\t);\n\t}\n\n\t\/\/ names\n\t\/\/ Assuming ASCII encoding -- compatible with UTF-8, so no\n\t\/\/ decoding necessary.\n\n\tString names_glob{};\n\tduct::IO::read_string_copy(\n\t\tstream,\n\t\tnames_glob,\n\t\tstatic_cast<std::size_t>(hdr.names_size),\n\t\tterminfo_endian\n\t);\n\tBEARD_TERMINFO_CHECK_IO_ERROR_(\n\t\t\"failed to read names field\"\n\t);\n\n\tif (0u < names_glob.size() && '\\0' == *names_glob.crbegin()) {\n\t\tnames_glob.pop_back();\n\t}\n\n\tString::size_type pos = 0u, next = String::npos;\n\tfor (;;) {\n\t\tnext = names_glob.find('|', pos + 1u);\n\t\tif (String::npos == next) {\n\t\t\tm_names.emplace_back(names_glob.substr(pos, String::npos));\n\t\t\tbreak;\n\t\t} else if (next > (pos + 1u)) {\n\t\t\tm_names.emplace_back(names_glob.substr(pos, next - pos));\n\t\t\tpos = next + 1u;\n\t\t} else {\n\t\t\t\/\/ next <= pos (empty block)\n\t\t\t++pos;\n\t\t\tcontinue;\n\t\t}\n\t}\n\n\t\/\/ flags\n\tm_cap_flags.resize(static_cast<std::size_t>(hdr.flag_count));\n\tduct::IO::read_arithmetic_array(\n\t\tstream,\n\t\tm_cap_flags.data(),\n\t\tm_cap_flags.size(),\n\t\tterminfo_endian\n\t);\n\tBEARD_TERMINFO_CHECK_IO_ERROR_(\n\t\t\"failed to read flag section\"\n\t);\n\n\t\/\/ align\n\t\/\/ names_size and flag_count will indicate unalignment if\n\t\/\/ their sum is uneven because their respective elements are\n\t\/\/ bytes.\n\tif ((hdr.names_size + hdr.flag_count) % 2) {\n\t\tchar dead_byte;\n\t\tstream.read(&dead_byte, 1u);\n\t\tBEARD_TERMINFO_CHECK_IO_ERROR_(\n\t\t\t\"failed to read dead byte for alignment\"\n\t\t);\n\t}\n\n\t\/\/ numbers\n\tm_cap_numbers.resize(static_cast<std::size_t>(hdr.number_count));\n\tduct::IO::read_arithmetic_array(\n\t\tstream,\n\t\tm_cap_numbers.data(),\n\t\tm_cap_numbers.size(),\n\t\tterminfo_endian\n\t);\n\tBEARD_TERMINFO_CHECK_IO_ERROR_(\n\t\t\"failed to read number section\"\n\t);\n\n\t\/\/ string offsets\n\taux::vector<uint16_t> string_offsets(\n\t\tstatic_cast<std::size_t>(hdr.string_offset_count)\n\t);\n\tduct::IO::read_arithmetic_array(\n\t\tstream,\n\t\tstring_offsets.data(),\n\t\tstring_offsets.size(),\n\t\tterminfo_endian\n\t);\n\tBEARD_TERMINFO_CHECK_IO_ERROR_(\n\t\t\"failed to read string offsets section\"\n\t);\n\n\t\/\/ string table\n\t\/\/ Again assuming ASCII.\n\taux::vector<char> string_table(\n\t\tstatic_cast<std::size_t>(hdr.string_table_size)\n\t);\n\tduct::IO::read(\n\t\tstream,\n\t\tstring_table.data(),\n\t\tstring_table.size()\n\t);\n\tBEARD_TERMINFO_CHECK_IO_ERROR_(\n\t\t\"failed to read string table\"\n\t);\n\n\tunsigned index = 0u, offset = 0u;\n\tauto\n\t\tit_start = string_table.cend(),\n\t\tit_cnull = it_start\n\t;\n\tfor (\n\t\tauto it = string_offsets.cbegin();\n\t\tstring_offsets.cend() != it;\n\t\t++it, ++index\n\t) {\n\t\toffset = static_cast<unsigned>(*it);\n\n\t\t\/\/ -1 means terminal does not support capability, and\n\t\t\/\/ \"other negative values are illegal\".\n\t\t\/\/ And in Unix fashion, \/you will get illegal values\/.\n\t\tif (\n\t\t\tterminfo_table_offset_empty == offset\n\t\t||  (mask_offset_signbit & offset)\n\t\t) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (string_table.size() <= offset) {\n\t\t\tBEARD_THROW_FMT(\n\t\t\t\tErrorCode::serialization_data_malformed,\n\t\t\t\ts_err_string_offset_invalid,\n\t\t\t\tindex,\n\t\t\t\toffset,\n\t\t\t\tstring_table.size()\n\t\t\t);\n\t\t}\n\n\t\tit_start = string_table.cbegin() + offset;\n\t\tit_cnull = std::find(\n\t\t\tit_start,\n\t\t\tstring_table.cend(),\n\t\t\t'\\0'\n\t\t);\n\t\tm_cap_strings.emplace(\n\t\t\tindex,\n\t\t\tString{it_start, it_cnull}\n\t\t);\n\t}\n\n\tm_initialized = true;\n}\n#undef BEARD_SCOPE_FUNC\n\n#undef BEARD_SCOPE_CLASS\n\n} \/\/ namespace tty\n} \/\/ namespace Beard\n<commit_msg>tty::TerminalInfo: prefixed all uses of fixed-size integral types with `std::`.<commit_after>\n#include <Beard\/detail\/gr_ceformat.hpp>\n#include <Beard\/tty\/TerminalInfo.hpp>\n\n#include <duct\/EndianUtils.hpp>\n#include <duct\/IO\/arithmetic.hpp>\n#include <duct\/IO\/unicode.hpp>\n\n#include <istream>\n\nnamespace Beard {\nnamespace tty {\n\n\/\/ class TerminalInfo implementation\n\n#define BEARD_SCOPE_CLASS tty::TerminalInfo\n\nTerminalInfo::~TerminalInfo() noexcept = default;\n\nTerminalInfo::TerminalInfo() noexcept\n\t: m_initialized(false)\n\t, m_names()\n\t, m_cap_flags()\n\t, m_cap_numbers()\n\t, m_cap_strings()\n{}\n\nTerminalInfo::TerminalInfo(TerminalInfo&&) noexcept = default;\nTerminalInfo::TerminalInfo(TerminalInfo const&) = default;\nTerminalInfo& TerminalInfo::operator=(TerminalInfo&&) noexcept = default;\n\n\/\/ serialization\n\n\/\/ TODO: <tic.h> specifies some differences:\n\/\/ 1. max names field size is 512 (XSI);\n\/\/ 2. there are two different \"signed\" values specifying\n\/\/\t  different meanings for capabilities;\n\n\/\/ terminfo format:\n\/*\n\tuint16_t magic = 0x011a\n\n\tuint16_t names_size\n\tuint16_t flag_count\n\tuint16_t number_count\n\tuint16_t string_offset_count\n\tuint16_t string_table_size\n\n\t\/\/ Names for terminal type, separated by '|'\n\tchar names[names_size]\n\n\t\/\/ Boolean flags\n\tuint8_t flags[flag_count]\n\n\t\/\/ Seek ahead to align to 2-byte word (ergo: possible dead byte)\n\n\tuint16_t numbers[number_count]\n\n\t\/\/ Offsets are relative to string_table\n\tuint16_t string_offsets[string_offset_count]\n\tchar string_table[string_table_size]\n*\/\n\nnamespace {\nenum : unsigned {\n\tterminfo_magic = 0x011a,\n\tterminfo_max_names_size = 128u,\n\n\tterminfo_table_offset_empty = 0xFFFFu,\n\tmask_offset_signbit = 0x8000,\n};\n\nconstexpr auto const\nterminfo_endian = duct::Endian::little;\n\nstruct terminfo_header {\n\tstd::uint16_t magic{0};\n\tstd::uint16_t names_size{0};\n\tstd::uint16_t flag_count{0};\n\tstd::uint16_t number_count{0};\n\tstd::uint16_t string_offset_count{0};\n\tstd::uint16_t string_table_size{0};\n};\n} \/\/ anonymous namespace\n\n#define BEARD_TERMINFO_CHECK_IO_ERROR_(m_)\t\t\t\t\\\n\tif (stream.fail()) {\t\t\t\t\t\t\t\t\\\n\t\tBEARD_THROW_FQN(\t\t\t\t\t\t\t\t\\\n\t\t\tErrorCode::serialization_io_failed,\t\t\t\\\n\t\t\tm_\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\\\n\t}\n\/\/\n\n#define BEARD_SCOPE_FUNC deserialize\nnamespace {\nBEARD_DEF_FMT_FQN(\n\ts_err_bad_magic,\n\t\"bad magic encountered: expected %-#04x, got %-#04x\"\n);\nBEARD_DEF_FMT_FQN(\n\ts_err_name_too_large,\n\t\"names section too large: expected s <= %u, got s = %u\"\n);\nBEARD_DEF_FMT_FQN(\n\ts_err_string_offset_invalid,\n\t\"index %u offset %u overflows string table (size = %u)\"\n);\n} \/\/ anonymous namespace\n\nvoid\nTerminalInfo::deserialize(\n\tstd::istream& stream\n) {\n\tm_initialized = false;\n\tm_names.clear();\n\tm_cap_flags.clear();\n\tm_cap_numbers.clear();\n\tm_cap_strings.clear();\n\n\tterminfo_header hdr{};\n\n\t\/\/ header\n\tduct::IO::read_arithmetic(stream, hdr.magic, terminfo_endian);\n\tduct::IO::read_arithmetic(stream, hdr.names_size, terminfo_endian);\n\tduct::IO::read_arithmetic(stream, hdr.flag_count, terminfo_endian);\n\tduct::IO::read_arithmetic(stream, hdr.number_count, terminfo_endian);\n\tduct::IO::read_arithmetic(stream, hdr.string_offset_count, terminfo_endian);\n\tduct::IO::read_arithmetic(stream, hdr.string_table_size, terminfo_endian);\n\n\tBEARD_TERMINFO_CHECK_IO_ERROR_(\n\t\t\"failed to read header\"\n\t);\n\n\tif (terminfo_magic != hdr.magic) {\n\t\tBEARD_THROW_FMT(\n\t\t\tErrorCode::serialization_data_malformed,\n\t\t\ts_err_bad_magic,\n\t\t\tstatic_cast<unsigned>(terminfo_magic),\n\t\t\tstatic_cast<unsigned>(hdr.magic)\n\t\t);\n\t}\n\n\tif (terminfo_max_names_size < hdr.names_size) {\n\t\tBEARD_THROW_FMT(\n\t\t\tErrorCode::serialization_data_malformed,\n\t\t\ts_err_name_too_large,\n\t\t\tstatic_cast<unsigned>(terminfo_max_names_size),\n\t\t\tstatic_cast<unsigned>(hdr.names_size)\n\t\t);\n\t}\n\n\t\/\/ names\n\t\/\/ Assuming ASCII encoding -- compatible with UTF-8, so no\n\t\/\/ decoding necessary.\n\n\tString names_glob{};\n\tduct::IO::read_string_copy(\n\t\tstream,\n\t\tnames_glob,\n\t\tstatic_cast<std::size_t>(hdr.names_size),\n\t\tterminfo_endian\n\t);\n\tBEARD_TERMINFO_CHECK_IO_ERROR_(\n\t\t\"failed to read names field\"\n\t);\n\n\tif (0u < names_glob.size() && '\\0' == *names_glob.crbegin()) {\n\t\tnames_glob.pop_back();\n\t}\n\n\tString::size_type pos = 0u, next = String::npos;\n\tfor (;;) {\n\t\tnext = names_glob.find('|', pos + 1u);\n\t\tif (String::npos == next) {\n\t\t\tm_names.emplace_back(names_glob.substr(pos, String::npos));\n\t\t\tbreak;\n\t\t} else if (next > (pos + 1u)) {\n\t\t\tm_names.emplace_back(names_glob.substr(pos, next - pos));\n\t\t\tpos = next + 1u;\n\t\t} else {\n\t\t\t\/\/ next <= pos (empty block)\n\t\t\t++pos;\n\t\t\tcontinue;\n\t\t}\n\t}\n\n\t\/\/ flags\n\tm_cap_flags.resize(static_cast<std::size_t>(hdr.flag_count));\n\tduct::IO::read_arithmetic_array(\n\t\tstream,\n\t\tm_cap_flags.data(),\n\t\tm_cap_flags.size(),\n\t\tterminfo_endian\n\t);\n\tBEARD_TERMINFO_CHECK_IO_ERROR_(\n\t\t\"failed to read flag section\"\n\t);\n\n\t\/\/ align\n\t\/\/ names_size and flag_count will indicate unalignment if\n\t\/\/ their sum is uneven because their respective elements are\n\t\/\/ bytes.\n\tif ((hdr.names_size + hdr.flag_count) % 2) {\n\t\tchar dead_byte;\n\t\tstream.read(&dead_byte, 1u);\n\t\tBEARD_TERMINFO_CHECK_IO_ERROR_(\n\t\t\t\"failed to read dead byte for alignment\"\n\t\t);\n\t}\n\n\t\/\/ numbers\n\tm_cap_numbers.resize(static_cast<std::size_t>(hdr.number_count));\n\tduct::IO::read_arithmetic_array(\n\t\tstream,\n\t\tm_cap_numbers.data(),\n\t\tm_cap_numbers.size(),\n\t\tterminfo_endian\n\t);\n\tBEARD_TERMINFO_CHECK_IO_ERROR_(\n\t\t\"failed to read number section\"\n\t);\n\n\t\/\/ string offsets\n\taux::vector<uint16_t> string_offsets(\n\t\tstatic_cast<std::size_t>(hdr.string_offset_count)\n\t);\n\tduct::IO::read_arithmetic_array(\n\t\tstream,\n\t\tstring_offsets.data(),\n\t\tstring_offsets.size(),\n\t\tterminfo_endian\n\t);\n\tBEARD_TERMINFO_CHECK_IO_ERROR_(\n\t\t\"failed to read string offsets section\"\n\t);\n\n\t\/\/ string table\n\t\/\/ Again assuming ASCII.\n\taux::vector<char> string_table(\n\t\tstatic_cast<std::size_t>(hdr.string_table_size)\n\t);\n\tduct::IO::read(\n\t\tstream,\n\t\tstring_table.data(),\n\t\tstring_table.size()\n\t);\n\tBEARD_TERMINFO_CHECK_IO_ERROR_(\n\t\t\"failed to read string table\"\n\t);\n\n\tunsigned index = 0u, offset = 0u;\n\tauto\n\t\tit_start = string_table.cend(),\n\t\tit_cnull = it_start\n\t;\n\tfor (\n\t\tauto it = string_offsets.cbegin();\n\t\tstring_offsets.cend() != it;\n\t\t++it, ++index\n\t) {\n\t\toffset = static_cast<unsigned>(*it);\n\n\t\t\/\/ -1 means terminal does not support capability, and\n\t\t\/\/ \"other negative values are illegal\".\n\t\t\/\/ And in Unix fashion, \/you will get illegal values\/.\n\t\tif (\n\t\t\tterminfo_table_offset_empty == offset\n\t\t||  (mask_offset_signbit & offset)\n\t\t) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (string_table.size() <= offset) {\n\t\t\tBEARD_THROW_FMT(\n\t\t\t\tErrorCode::serialization_data_malformed,\n\t\t\t\ts_err_string_offset_invalid,\n\t\t\t\tindex,\n\t\t\t\toffset,\n\t\t\t\tstring_table.size()\n\t\t\t);\n\t\t}\n\n\t\tit_start = string_table.cbegin() + offset;\n\t\tit_cnull = std::find(\n\t\t\tit_start,\n\t\t\tstring_table.cend(),\n\t\t\t'\\0'\n\t\t);\n\t\tm_cap_strings.emplace(\n\t\t\tindex,\n\t\t\tString{it_start, it_cnull}\n\t\t);\n\t}\n\n\tm_initialized = true;\n}\n#undef BEARD_SCOPE_FUNC\n\n#undef BEARD_SCOPE_CLASS\n\n} \/\/ namespace tty\n} \/\/ namespace Beard\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\/recordio\/chunk.h\"\n\n#include <sstream>\n\n#include \"gtest\/gtest.h\"\n\nTEST(Chunk, SaveLoad) {\n  paddle::recordio::Chunk ch;\n  ch.Add(std::string(\"12345\", 6));\n  ch.Add(std::string(\"123\", 4));\n  std::stringstream ss;\n  ch.Write(ss, paddle::recordio::Compressor::kNoCompress);\n  ss.seekg(0);\n  ch.Parse(ss);\n  ASSERT_EQ(ch.NumBytes(), 10U);\n}\n\nTEST(Chunk, Compressor) {\n  paddle::recordio::Chunk ch;\n  ch.Add(std::string(\"12345\", 6));\n  ch.Add(std::string(\"123\", 4));\n  ch.Add(std::string(\"123\", 4));\n  ch.Add(std::string(\"123\", 4));\n  std::stringstream ss;\n  ch.Write(ss, paddle::recordio::Compressor::kSnappy);\n  std::stringstream ss2;\n  ch.Write(ss2, paddle::recordio::Compressor::kNoCompress);\n  ASSERT_LE(ss.tellp(), ss2.tellp());  \/\/ Compress should contain less data;\n\n  ch.Clear();\n  ch.Parse(ss);\n  ASSERT_EQ(ch.NumBytes(), 18);\n}\n<commit_msg>Fix warnings in chunk_test<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\/recordio\/chunk.h\"\n\n#include <sstream>\n\n#include \"gtest\/gtest.h\"\n\nTEST(Chunk, SaveLoad) {\n  paddle::recordio::Chunk ch;\n  ch.Add(std::string(\"12345\", 6));\n  ch.Add(std::string(\"123\", 4));\n  std::stringstream ss;\n  ch.Write(ss, paddle::recordio::Compressor::kNoCompress);\n  ss.seekg(0);\n  ch.Parse(ss);\n  ASSERT_EQ(ch.NumBytes(), 10U);\n}\n\nTEST(Chunk, Compressor) {\n  paddle::recordio::Chunk ch;\n  ch.Add(std::string(\"12345\", 6));\n  ch.Add(std::string(\"123\", 4));\n  ch.Add(std::string(\"123\", 4));\n  ch.Add(std::string(\"123\", 4));\n  std::stringstream ss;\n  ch.Write(ss, paddle::recordio::Compressor::kSnappy);\n  std::stringstream ss2;\n  ch.Write(ss2, paddle::recordio::Compressor::kNoCompress);\n  ASSERT_LE(ss.tellp(), ss2.tellp());  \/\/ Compress should contain less data;\n\n  ch.Clear();\n  ch.Parse(ss);\n  ASSERT_EQ(ch.NumBytes(), 18ul);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n*\t The MIT License (MIT)\n*\n*\t Copyright (c) 2015 Alisa Dolinsky\n*\n*\t Permission is hereby granted, free of charge, to any person obtaining a copy\n*\t of this software and associated documentation files (the \"Software\"), to deal\n*\t in the Software without restriction, including without limitation the rights\n*\t to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n*\t copies of the Software, and to permit persons to whom the Software is\n*\t furnished to do so, subject to the following conditions:\n*\n*\t The above copyright notice and this permission notice shall be included in all\n*\t copies or substantial portions of the Software.\n*\n*\t THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n*\t IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n*\t FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n*\t AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n*\t LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n*\t OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n*\t SOFTWARE.\n*\/\n\n#include \"PhantomGunsDemo.h\"\n#include \"TclComponent.h\"\n#include \"Library.hpp\"\n\n\nvoid* UTclComponent::handle = nullptr;\n_Tcl_CreateInterpProto UTclComponent::_Tcl_CreateInterp = nullptr;\n_Tcl_DeleteInterpProto UTclComponent::_Tcl_DeleteInterp = nullptr;\n_Tcl_EvalProto UTclComponent::_Tcl_Eval = nullptr;\n_Tcl_CreateObjCommandProto UTclComponent::_Tcl_CreateObjCommand = nullptr;\n_Tcl_SetObjResultProto UTclComponent::_Tcl_SetObjResult = nullptr;\n_Tcl_NewObjProto UTclComponent::_Tcl_NewObj = nullptr;\n_Tcl_NewBooleanObjProto UTclComponent::_Tcl_NewBooleanObj = nullptr;\n_Tcl_NewLongObjProto UTclComponent::_Tcl_NewLongObj = nullptr;\n_Tcl_NewDoubleObjProto UTclComponent::_Tcl_NewDoubleObj = nullptr;\n_Tcl_NewStringObjProto UTclComponent::_Tcl_NewStringObj = nullptr;\n_Tcl_NewListObjProto UTclComponent::_Tcl_NewListObj = nullptr;\n_Tcl_SetVar2ExProto UTclComponent::_Tcl_SetVar2Ex = nullptr;\n_Tcl_GetBooleanFromObjProto UTclComponent::_Tcl_GetBooleanFromObj = nullptr;\n_Tcl_GetLongFromObjProto UTclComponent::_Tcl_GetLongFromObj = nullptr;\n_Tcl_GetDoubleFromObjProto UTclComponent::_Tcl_GetDoubleFromObj = nullptr;\n_Tcl_GetStringFromObjProto UTclComponent::_Tcl_GetStringFromObj = nullptr;\n\nUTclComponent::UTclComponent(const FObjectInitializer& ObjectInitializer) : Super(ObjectInitializer) {\n\tbWantsBeginPlay = true;\n\tPrimaryComponentTick.bCanEverTick = false;\n\n}\n\nvoid UTclComponent::fill(Tcl_Obj* obj) {\n\tbuffer = obj;\n\n}\nTcl_Obj* UTclComponent::purge() {\n\tauto obj = buffer;\n\tbuffer = nullptr;\n\treturn obj;\n\n}\n\nint UTclComponent::init() {\n\tstatic const Tcl_ObjType type = { \"NIL\", &Tcl_FreeInternalRepProc, &Tcl_DupInternalRepProc, &Tcl_UpdateStringProc, &Tcl_SetFromAnyProc };\n\tinterpreter = _Tcl_CreateInterp();\n\tauto val = _Tcl_NewObj();\n\tval->typePtr = &type;\n\t*val = *(_Tcl_SetVar2Ex(interpreter, \"NIL\", nullptr, val, TCL_GLOBAL_ONLY | TCL_LEAVE_ERR_MSG));\n\tthis->bindstatic<TSubclassOf<UObject>, FString>(&Library::FindClass, \"FindClass\");\n\tthis->bindmethod<UTclComponent, void, Tcl_Obj*>(this, &UTclComponent::fill, \"Fill\");\n\tthis->bindstatic<Tcl_Obj*, AActor*>(&Library::Purge, \"Purge\");\n\treturn TCL_OK;\n\n}\n\nvoid UTclComponent::BeginPlay() {\n\tSuper::BeginPlay();\n\tif (handle == nullptr) {\n\t\tauto dllPath = FPaths::Combine(*FPaths::GameDir(), TEXT(\"ThirdParty\/\"), TEXT(_TCL_DLL_FNAME_));\n\t\tif (FPaths::FileExists(dllPath)) {\n\t\t\thandle = FPlatformProcess::GetDllHandle(*dllPath);\n\t\t\tif (handle == nullptr) { UE_LOG(LogClass, Error, TEXT(\"Tcl bootstrapping failed\")) }\n\t\t\telse {\n\t\t\t\tFString procName = \"\";\n\t\t\t\tprocName = \"Tcl_CreateInterp\";\n\t\t\t\t_Tcl_CreateInterp = static_cast<_Tcl_CreateInterpProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_DeleteInterp\";\n\t\t\t\t_Tcl_DeleteInterp = static_cast<_Tcl_DeleteInterpProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_Eval\";\n\t\t\t\t_Tcl_Eval = static_cast<_Tcl_EvalProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_CreateObjCommand\";\n\t\t\t\t_Tcl_CreateObjCommand = static_cast<_Tcl_CreateObjCommandProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_SetObjResult\";\n\t\t\t\t_Tcl_SetObjResult = static_cast<_Tcl_SetObjResultProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_NewObj\";\n\t\t\t\t_Tcl_NewObj = static_cast<_Tcl_NewObjProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_NewBooleanObj\";\n\t\t\t\t_Tcl_NewBooleanObj = static_cast<_Tcl_NewBooleanObjProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_NewLongObj\";\n\t\t\t\t_Tcl_NewLongObj = static_cast<_Tcl_NewLongObjProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_NewDoubleObj\";\n\t\t\t\t_Tcl_NewDoubleObj = static_cast<_Tcl_NewDoubleObjProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_NewStringObj\";\n\t\t\t\t_Tcl_NewStringObj = static_cast<_Tcl_NewStringObjProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_NewListObj\";\n\t\t\t\t_Tcl_NewListObj = static_cast<_Tcl_NewListObjProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_SetVar2Ex\";\n\t\t\t\t_Tcl_SetVar2Ex = static_cast<_Tcl_SetVar2ExProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_GetBooleanFromObj\";\n\t\t\t\t_Tcl_GetBooleanFromObj = static_cast<_Tcl_GetBooleanFromObjProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_GetLongFromObj\";\n\t\t\t\t_Tcl_GetLongFromObj = static_cast<_Tcl_GetLongFromObjProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_GetDoubleFromObj\";\n\t\t\t\t_Tcl_GetDoubleFromObj = static_cast<_Tcl_GetDoubleFromObjProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_GetStringFromObj\";\n\t\t\t\t_Tcl_GetStringFromObj = static_cast<_Tcl_GetStringFromObjProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tif (_Tcl_CreateInterp == nullptr ||\n\t\t\t\t\t_Tcl_DeleteInterp == nullptr ||\n\t\t\t\t\t_Tcl_Eval == nullptr ||\n\t\t\t\t\t_Tcl_CreateObjCommand == nullptr ||\n\t\t\t\t\t_Tcl_SetObjResult == nullptr ||\n\t\t\t\t\t_Tcl_NewObj == nullptr ||\n\t\t\t\t\t_Tcl_NewBooleanObj == nullptr ||\n\t\t\t\t\t_Tcl_NewLongObj == nullptr ||\n\t\t\t\t\t_Tcl_NewDoubleObj == nullptr ||\n\t\t\t\t\t_Tcl_NewStringObj == nullptr ||\n\t\t\t\t\t_Tcl_NewListObj == nullptr ||\n\t\t\t\t\t_Tcl_SetVar2Ex == nullptr ||\n\t\t\t\t\t_Tcl_GetBooleanFromObj == nullptr ||\n\t\t\t\t\t_Tcl_GetLongFromObj == nullptr ||\n\t\t\t\t\t_Tcl_GetDoubleFromObj == nullptr ||\n\t\t\t\t\t_Tcl_GetStringFromObj == nullptr) {\n\t\t\t\t\thandle = nullptr;\n\t\t\t\t\tUE_LOG(LogClass, Error, TEXT(\"Bootstrapping one or more functions for Tcl failed!\"))\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tinit();\n\t\t\t\t\tUE_LOG(LogClass, Log, TEXT(\"Bootstrapping Tcl and its functions succeeded!\"))\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse { UE_LOG(LogClass, Error, TEXT(\"Cannot find %s for Tcl!\"), _TCL_DLL_FNAME_) }\n\t} else { init(); }\n\t\n}\n\nvoid UTclComponent::BeginDestroy() {\n\tSuper::BeginDestroy();\n\tif(interpreter != nullptr) { _Tcl_DeleteInterp(interpreter); }\n\n}\n\nvoid UTclComponent::Tcl_FreeInternalRepProc(Tcl_Obj* obj) { }\nvoid UTclComponent::Tcl_DupInternalRepProc(Tcl_Obj* srcPtr, Tcl_Obj* dupPtr) { }\nvoid UTclComponent::Tcl_UpdateStringProc(Tcl_Obj* obj) { }\nint UTclComponent::Tcl_SetFromAnyProc(Tcl_Interp* interp, Tcl_Obj* obj) { return 0; }\n\nbool UTclComponent::handleIsMissing() { return handle == nullptr; }\n\n_Tcl_CreateObjCommandProto UTclComponent::get_Tcl_CreateObjCommand() { return _Tcl_CreateObjCommand; }\n_Tcl_SetObjResultProto UTclComponent::get_Tcl_SetObjResult() { return _Tcl_SetObjResult; }\n_Tcl_SetVar2ExProto UTclComponent::get_Tcl_SetVar2Ex() { return _Tcl_SetVar2Ex; }\n_Tcl_NewObjProto UTclComponent::get_Tcl_NewObj() { return _Tcl_NewObj; }\n_Tcl_NewBooleanObjProto UTclComponent::get_Tcl_NewBooleanObj() { return _Tcl_NewBooleanObj; }\n_Tcl_NewLongObjProto UTclComponent::get_Tcl_NewLongObj() { return _Tcl_NewLongObj; };\n_Tcl_NewDoubleObjProto UTclComponent::get_Tcl_NewDoubleObj() { return _Tcl_NewDoubleObj; }\n_Tcl_NewStringObjProto UTclComponent::get_Tcl_NewStringObj() { return _Tcl_NewStringObj; }\n_Tcl_GetBooleanFromObjProto UTclComponent::get_Tcl_GetBooleanFromObj() { return _Tcl_GetBooleanFromObj; }\n_Tcl_GetLongFromObjProto UTclComponent::get_Tcl_GetLongFromObj() { return _Tcl_GetLongFromObj; }\n_Tcl_GetDoubleFromObjProto UTclComponent::get_Tcl_GetDoubleFromObj() { return _Tcl_GetDoubleFromObj; }\n_Tcl_GetStringFromObjProto UTclComponent::get_Tcl_GetStringFromObj() { return _Tcl_GetStringFromObj; }\n\nint UTclComponent::eval(const char* code) {\n\tif (handle == nullptr || interpreter == nullptr) { return _TCL_BOOTSTRAP_FAIL_; }\n\telse { return _Tcl_Eval(interpreter, code); }\n\n}\n\nint32 UTclComponent::Eval(FString Filename, FString Code) {\n\tFString fname = \"\";\n\tif(!Filename.IsEmpty()) {\n\t\tfname = FPaths::GameContentDir() + \"Scripts\/\" + Filename;\n\t\tif(FPaths::FileExists(fname)) {\n\t\t\tUE_LOG(LogClass, Log, TEXT(\"Tcl loaded a script file at path: %s\"), *fname)\n\t\t\tFFileHelper::LoadFileToString(Code, *fname);\n\t\t} else {\n\t\t\tUE_LOG(LogClass, Warning, TEXT(\"File at path: %s doesn't exist! Executing the Code field\"), *fname)\n\t\t}\n\t}\n\tauto status = eval(TCHAR_TO_ANSI(*Code));\n\tif (status == TCL_ERROR) { UE_LOG(LogClass, Error, TEXT(\"Tcl script error for! filepath: '%s' with code: '%s'!\"), *fname, *Code) }\n\treturn status;\n\n}<commit_msg>nullpointer check.<commit_after>\/*\n*\t The MIT License (MIT)\n*\n*\t Copyright (c) 2015 Alisa Dolinsky\n*\n*\t Permission is hereby granted, free of charge, to any person obtaining a copy\n*\t of this software and associated documentation files (the \"Software\"), to deal\n*\t in the Software without restriction, including without limitation the rights\n*\t to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n*\t copies of the Software, and to permit persons to whom the Software is\n*\t furnished to do so, subject to the following conditions:\n*\n*\t The above copyright notice and this permission notice shall be included in all\n*\t copies or substantial portions of the Software.\n*\n*\t THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n*\t IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n*\t FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n*\t AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n*\t LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n*\t OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n*\t SOFTWARE.\n*\/\n\n#include \"PhantomGunsDemo.h\"\n#include \"TclComponent.h\"\n#include \"Library.hpp\"\n\n\nvoid* UTclComponent::handle = nullptr;\n_Tcl_CreateInterpProto UTclComponent::_Tcl_CreateInterp = nullptr;\n_Tcl_DeleteInterpProto UTclComponent::_Tcl_DeleteInterp = nullptr;\n_Tcl_EvalProto UTclComponent::_Tcl_Eval = nullptr;\n_Tcl_CreateObjCommandProto UTclComponent::_Tcl_CreateObjCommand = nullptr;\n_Tcl_SetObjResultProto UTclComponent::_Tcl_SetObjResult = nullptr;\n_Tcl_NewObjProto UTclComponent::_Tcl_NewObj = nullptr;\n_Tcl_NewBooleanObjProto UTclComponent::_Tcl_NewBooleanObj = nullptr;\n_Tcl_NewLongObjProto UTclComponent::_Tcl_NewLongObj = nullptr;\n_Tcl_NewDoubleObjProto UTclComponent::_Tcl_NewDoubleObj = nullptr;\n_Tcl_NewStringObjProto UTclComponent::_Tcl_NewStringObj = nullptr;\n_Tcl_NewListObjProto UTclComponent::_Tcl_NewListObj = nullptr;\n_Tcl_SetVar2ExProto UTclComponent::_Tcl_SetVar2Ex = nullptr;\n_Tcl_GetBooleanFromObjProto UTclComponent::_Tcl_GetBooleanFromObj = nullptr;\n_Tcl_GetLongFromObjProto UTclComponent::_Tcl_GetLongFromObj = nullptr;\n_Tcl_GetDoubleFromObjProto UTclComponent::_Tcl_GetDoubleFromObj = nullptr;\n_Tcl_GetStringFromObjProto UTclComponent::_Tcl_GetStringFromObj = nullptr;\n\nUTclComponent::UTclComponent(const FObjectInitializer& ObjectInitializer) : Super(ObjectInitializer) {\n\tbWantsBeginPlay = true;\n\tPrimaryComponentTick.bCanEverTick = false;\n\n}\n\nvoid UTclComponent::fill(Tcl_Obj* obj) {\n\tbuffer = obj;\n\tif(buffer != nullptr) { buffer->refCount++; }\n\n}\nTcl_Obj* UTclComponent::purge() {\n\tauto obj = buffer;\n\tbuffer = nullptr;\n\tif(obj == nullptr) { obj = _Tcl_NewObj(); } else { obj->refCount--; }\n\treturn obj;\n\n}\n\nint UTclComponent::init() {\n\tstatic const Tcl_ObjType type = { \"NIL\", &Tcl_FreeInternalRepProc, &Tcl_DupInternalRepProc, &Tcl_UpdateStringProc, &Tcl_SetFromAnyProc };\n\tinterpreter = _Tcl_CreateInterp();\n\tauto val = _Tcl_NewObj();\n\tval->typePtr = &type;\n\t*val = *(_Tcl_SetVar2Ex(interpreter, \"NIL\", nullptr, val, TCL_GLOBAL_ONLY | TCL_LEAVE_ERR_MSG));\n\tthis->bindstatic<TSubclassOf<UObject>, FString>(&Library::FindClass, \"FindClass\");\n\tthis->bindmethod<UTclComponent, void, Tcl_Obj*>(this, &UTclComponent::fill, \"Fill\");\n\tthis->bindstatic<Tcl_Obj*, AActor*>(&Library::Purge, \"Purge\");\n\treturn TCL_OK;\n\n}\n\nvoid UTclComponent::BeginPlay() {\n\tSuper::BeginPlay();\n\tif (handle == nullptr) {\n\t\tauto dllPath = FPaths::Combine(*FPaths::GameDir(), TEXT(\"ThirdParty\/\"), TEXT(_TCL_DLL_FNAME_));\n\t\tif (FPaths::FileExists(dllPath)) {\n\t\t\thandle = FPlatformProcess::GetDllHandle(*dllPath);\n\t\t\tif (handle == nullptr) { UE_LOG(LogClass, Error, TEXT(\"Tcl bootstrapping failed\")) }\n\t\t\telse {\n\t\t\t\tFString procName = \"\";\n\t\t\t\tprocName = \"Tcl_CreateInterp\";\n\t\t\t\t_Tcl_CreateInterp = static_cast<_Tcl_CreateInterpProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_DeleteInterp\";\n\t\t\t\t_Tcl_DeleteInterp = static_cast<_Tcl_DeleteInterpProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_Eval\";\n\t\t\t\t_Tcl_Eval = static_cast<_Tcl_EvalProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_CreateObjCommand\";\n\t\t\t\t_Tcl_CreateObjCommand = static_cast<_Tcl_CreateObjCommandProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_SetObjResult\";\n\t\t\t\t_Tcl_SetObjResult = static_cast<_Tcl_SetObjResultProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_NewObj\";\n\t\t\t\t_Tcl_NewObj = static_cast<_Tcl_NewObjProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_NewBooleanObj\";\n\t\t\t\t_Tcl_NewBooleanObj = static_cast<_Tcl_NewBooleanObjProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_NewLongObj\";\n\t\t\t\t_Tcl_NewLongObj = static_cast<_Tcl_NewLongObjProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_NewDoubleObj\";\n\t\t\t\t_Tcl_NewDoubleObj = static_cast<_Tcl_NewDoubleObjProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_NewStringObj\";\n\t\t\t\t_Tcl_NewStringObj = static_cast<_Tcl_NewStringObjProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_NewListObj\";\n\t\t\t\t_Tcl_NewListObj = static_cast<_Tcl_NewListObjProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_SetVar2Ex\";\n\t\t\t\t_Tcl_SetVar2Ex = static_cast<_Tcl_SetVar2ExProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_GetBooleanFromObj\";\n\t\t\t\t_Tcl_GetBooleanFromObj = static_cast<_Tcl_GetBooleanFromObjProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_GetLongFromObj\";\n\t\t\t\t_Tcl_GetLongFromObj = static_cast<_Tcl_GetLongFromObjProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_GetDoubleFromObj\";\n\t\t\t\t_Tcl_GetDoubleFromObj = static_cast<_Tcl_GetDoubleFromObjProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tprocName = \"Tcl_GetStringFromObj\";\n\t\t\t\t_Tcl_GetStringFromObj = static_cast<_Tcl_GetStringFromObjProto>(FPlatformProcess::GetDllExport(handle, *procName));\n\t\t\t\tif (_Tcl_CreateInterp == nullptr ||\n\t\t\t\t\t_Tcl_DeleteInterp == nullptr ||\n\t\t\t\t\t_Tcl_Eval == nullptr ||\n\t\t\t\t\t_Tcl_CreateObjCommand == nullptr ||\n\t\t\t\t\t_Tcl_SetObjResult == nullptr ||\n\t\t\t\t\t_Tcl_NewObj == nullptr ||\n\t\t\t\t\t_Tcl_NewBooleanObj == nullptr ||\n\t\t\t\t\t_Tcl_NewLongObj == nullptr ||\n\t\t\t\t\t_Tcl_NewDoubleObj == nullptr ||\n\t\t\t\t\t_Tcl_NewStringObj == nullptr ||\n\t\t\t\t\t_Tcl_NewListObj == nullptr ||\n\t\t\t\t\t_Tcl_SetVar2Ex == nullptr ||\n\t\t\t\t\t_Tcl_GetBooleanFromObj == nullptr ||\n\t\t\t\t\t_Tcl_GetLongFromObj == nullptr ||\n\t\t\t\t\t_Tcl_GetDoubleFromObj == nullptr ||\n\t\t\t\t\t_Tcl_GetStringFromObj == nullptr) {\n\t\t\t\t\thandle = nullptr;\n\t\t\t\t\tUE_LOG(LogClass, Error, TEXT(\"Bootstrapping one or more functions for Tcl failed!\"))\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tinit();\n\t\t\t\t\tUE_LOG(LogClass, Log, TEXT(\"Bootstrapping Tcl and its functions succeeded!\"))\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse { UE_LOG(LogClass, Error, TEXT(\"Cannot find %s for Tcl!\"), _TCL_DLL_FNAME_) }\n\t} else { init(); }\n\t\n}\n\nvoid UTclComponent::BeginDestroy() {\n\tSuper::BeginDestroy();\n\tif(interpreter != nullptr) { _Tcl_DeleteInterp(interpreter); }\n\n}\n\nvoid UTclComponent::Tcl_FreeInternalRepProc(Tcl_Obj* obj) { }\nvoid UTclComponent::Tcl_DupInternalRepProc(Tcl_Obj* srcPtr, Tcl_Obj* dupPtr) { }\nvoid UTclComponent::Tcl_UpdateStringProc(Tcl_Obj* obj) { }\nint UTclComponent::Tcl_SetFromAnyProc(Tcl_Interp* interp, Tcl_Obj* obj) { return 0; }\n\nbool UTclComponent::handleIsMissing() { return handle == nullptr; }\n\n_Tcl_CreateObjCommandProto UTclComponent::get_Tcl_CreateObjCommand() { return _Tcl_CreateObjCommand; }\n_Tcl_SetObjResultProto UTclComponent::get_Tcl_SetObjResult() { return _Tcl_SetObjResult; }\n_Tcl_SetVar2ExProto UTclComponent::get_Tcl_SetVar2Ex() { return _Tcl_SetVar2Ex; }\n_Tcl_NewObjProto UTclComponent::get_Tcl_NewObj() { return _Tcl_NewObj; }\n_Tcl_NewBooleanObjProto UTclComponent::get_Tcl_NewBooleanObj() { return _Tcl_NewBooleanObj; }\n_Tcl_NewLongObjProto UTclComponent::get_Tcl_NewLongObj() { return _Tcl_NewLongObj; };\n_Tcl_NewDoubleObjProto UTclComponent::get_Tcl_NewDoubleObj() { return _Tcl_NewDoubleObj; }\n_Tcl_NewStringObjProto UTclComponent::get_Tcl_NewStringObj() { return _Tcl_NewStringObj; }\n_Tcl_GetBooleanFromObjProto UTclComponent::get_Tcl_GetBooleanFromObj() { return _Tcl_GetBooleanFromObj; }\n_Tcl_GetLongFromObjProto UTclComponent::get_Tcl_GetLongFromObj() { return _Tcl_GetLongFromObj; }\n_Tcl_GetDoubleFromObjProto UTclComponent::get_Tcl_GetDoubleFromObj() { return _Tcl_GetDoubleFromObj; }\n_Tcl_GetStringFromObjProto UTclComponent::get_Tcl_GetStringFromObj() { return _Tcl_GetStringFromObj; }\n\nint UTclComponent::eval(const char* code) {\n\tif (handle == nullptr || interpreter == nullptr) { return _TCL_BOOTSTRAP_FAIL_; }\n\telse { return _Tcl_Eval(interpreter, code); }\n\n}\n\nint32 UTclComponent::Eval(FString Filename, FString Code) {\n\tFString fname = \"\";\n\tif(!Filename.IsEmpty()) {\n\t\tfname = FPaths::GameContentDir() + \"Scripts\/\" + Filename;\n\t\tif(FPaths::FileExists(fname)) {\n\t\t\tUE_LOG(LogClass, Log, TEXT(\"Tcl loaded a script file at path: %s\"), *fname)\n\t\t\tFFileHelper::LoadFileToString(Code, *fname);\n\t\t} else {\n\t\t\tUE_LOG(LogClass, Warning, TEXT(\"File at path: %s doesn't exist! Executing the Code field\"), *fname)\n\t\t}\n\t}\n\tauto status = eval(TCHAR_TO_ANSI(*Code));\n\tif (status == TCL_ERROR) { UE_LOG(LogClass, Error, TEXT(\"Tcl script error for! filepath: '%s' with code: '%s'!\"), *fname, *Code) }\n\treturn status;\n\n}<|endoftext|>"}
{"text":"<commit_before>#include \"mex.h\"\n#include <Eigen\/Dense>\n#include <cmath>\n#include <iostream>\n#include \"drakeUtil.h\"\n#include \"Polynomial.h\"\n\nusing namespace Eigen;\nusing namespace std;\n\/*\n * c++ version of\n *     function xdot = dynamicsRHS(~,~,x,~)\n *\/\n\nMatrix<Polynomiald, Dynamic, Dynamic> msspolyToEigen(const mxArray* msspoly)\n{\n  auto dim = matlabToEigenMap(mxGetPropertySafe(msspoly,0,\"dim\"));\n  auto sub = matlabToEigenMap(mxGetPropertySafe(msspoly,0,\"sub\"));\n  auto var = matlabToEigenMap(mxGetPropertySafe(msspoly,0,\"var\"));\n  auto pow = matlabToEigenMap(mxGetPropertySafe(msspoly,0,\"pow\"));\n  auto coeff = matlabToEigenMap(mxGetPropertySafe(msspoly,0,\"coeff\"));\n  \n  assert(sub.rows()==var.rows());\n  assert(sub.rows()==pow.rows());\n  assert(sub.rows()==coeff.rows());\n  assert(var.cols()==pow.cols());\n\n  Matrix<Polynomiald, Dynamic, Dynamic> poly((int)dim(0),(int)dim(1));\n  for (int i=0; i<sub.rows(); i++) {\n    vector<Polynomiald::VarType> vars;    \n    vector<Polynomiald::PowerType> powers;\n    int j=0;\n    while (j<var.cols() && var(i,j)>0) {\n      vars.push_back(var(i,j));\n      powers.push_back(pow(i,j));\n      j++;\n    }\n    Polynomiald p(coeff(i),vars,powers);\n    poly(sub(i,0)-1,sub(i,1)-1) += p;\n  }\n\n  cout << poly << endl;\n  \n  return poly;\n}\n\ntemplate< int Rows, int Cols >\nmxArray* eigenToMSSPoly(const Matrix<Polynomiald,Rows,Cols> & poly)\n{\n  int num_monomials = 0, max_vars = 0;\n  for (int i=0; i<poly.size(); i++) {\n    auto monomials = poly(i).getMonomials();\n    num_monomials += monomials.size();\n    for (vector<Polynomiald::Monomial>::const_iterator iter=monomials.begin(); iter!=monomials.end(); iter++) {\n      if (iter->vars.size() > max_vars)\n        max_vars = iter->vars.size();\n    }\n  }\n  \n  Matrix<double,1,2> dim; dim << poly.rows(), poly.cols();\n  MatrixXd sub(num_monomials,2);\n  MatrixXd var = MatrixXd::Zero(num_monomials,max_vars);\n  MatrixXd pow = MatrixXd::Zero(num_monomials,max_vars);\n  VectorXd coeff(num_monomials);\n\n  int index=0;\n  for (int i=0; i<poly.rows(); i++) {\n    for (int j=0; j<poly.cols(); j++) {\n      auto monomials = poly(i,j).getMonomials();\n      for (vector<Polynomiald::Monomial>::const_iterator iter=monomials.begin(); iter!=monomials.end(); iter++) {\n        sub(index,0) = i+1;\n        sub(index,1) = j+1;\n        for (int k=0; k<iter->vars.size(); k++) {\n          var(index,k)=(double)iter->vars[k];\n          pow(index,k)=(double)iter->powers[k];\n        }\n        coeff(index) = iter->coefficient;\n        index++;\n      }\n    }\n  }\n\n  mxArray* plhs[1];\n  mxArray* prhs[5];\n  prhs[0] = eigenToMatlab(dim);\n  prhs[1] = eigenToMatlab(sub);\n  prhs[2] = eigenToMatlab(var);\n  prhs[3] = eigenToMatlab(pow);\n  prhs[4] = eigenToMatlab(coeff);\n  mexCallMATLABsafe(1,plhs,5,prhs,\"msspoly\");\n  return plhs[0];\n}\n\ntemplate <typename DerivedA, typename DerivedB>\nvoid dynamicsRHS(const MatrixBase<DerivedA> &x, MatrixBase<DerivedB> &xdot) \n{\n  xdot << x(1), -x(0)-x(1)*(x(0)*x(0)-1);\n}        \n        \nvoid mexFunction( int nlhs, mxArray *plhs[],int nrhs, const mxArray *prhs[] ) \n{\n  if (mxIsDouble(prhs[2])) {\n    Map<Vector2d> x(mxGetPrSafe(prhs[2]));\n    plhs[0] = mxCreateDoubleMatrix(2,1,mxREAL);\n    Map<Vector2d> xdot(mxGetPr(plhs[0]));\n    dynamicsRHS(x,xdot);\n  } else if (isa(prhs[2],\"msspoly\")) {\n    auto x = msspolyToEigen(prhs[2]);\n    Matrix< Polynomiald, 2, 1> xdot;\n    dynamicsRHS(x,xdot);\n    cout << xdot << endl;\n    plhs[0] = eigenToMSSPoly(xdot);\n\/\/    plhs[0] = mxCreateDoubleMatrix(2,1,mxREAL);\n  } else {\n    mexErrMsgIdAndTxt(\"Drake:VanDerPolCpp:UnknownType\",\"don't know how to handle the datatype passed in for x (yet)\");\n  }\n}\n<commit_msg>remove printouts<commit_after>#include \"mex.h\"\n#include <Eigen\/Dense>\n#include <cmath>\n#include <iostream>\n#include \"drakeUtil.h\"\n#include \"Polynomial.h\"\n\nusing namespace Eigen;\nusing namespace std;\n\/*\n * c++ version of\n *     function xdot = dynamicsRHS(~,~,x,~)\n *\/\n\nMatrix<Polynomiald, Dynamic, Dynamic> msspolyToEigen(const mxArray* msspoly)\n{\n  auto dim = matlabToEigenMap(mxGetPropertySafe(msspoly,0,\"dim\"));\n  auto sub = matlabToEigenMap(mxGetPropertySafe(msspoly,0,\"sub\"));\n  auto var = matlabToEigenMap(mxGetPropertySafe(msspoly,0,\"var\"));\n  auto pow = matlabToEigenMap(mxGetPropertySafe(msspoly,0,\"pow\"));\n  auto coeff = matlabToEigenMap(mxGetPropertySafe(msspoly,0,\"coeff\"));\n  \n  assert(sub.rows()==var.rows());\n  assert(sub.rows()==pow.rows());\n  assert(sub.rows()==coeff.rows());\n  assert(var.cols()==pow.cols());\n\n  Matrix<Polynomiald, Dynamic, Dynamic> poly((int)dim(0),(int)dim(1));\n  for (int i=0; i<sub.rows(); i++) {\n    vector<Polynomiald::VarType> vars;    \n    vector<Polynomiald::PowerType> powers;\n    int j=0;\n    while (j<var.cols() && var(i,j)>0) {\n      vars.push_back(var(i,j));\n      powers.push_back(pow(i,j));\n      j++;\n    }\n    Polynomiald p(coeff(i),vars,powers);\n    poly(sub(i,0)-1,sub(i,1)-1) += p;\n  }\n\n\/\/  cout << poly << endl;\n  \n  return poly;\n}\n\ntemplate< int Rows, int Cols >\nmxArray* eigenToMSSPoly(const Matrix<Polynomiald,Rows,Cols> & poly)\n{\n  int num_monomials = 0, max_vars = 0;\n  for (int i=0; i<poly.size(); i++) {\n    auto monomials = poly(i).getMonomials();\n    num_monomials += monomials.size();\n    for (vector<Polynomiald::Monomial>::const_iterator iter=monomials.begin(); iter!=monomials.end(); iter++) {\n      if (iter->vars.size() > max_vars)\n        max_vars = iter->vars.size();\n    }\n  }\n  \n  Matrix<double,1,2> dim; dim << poly.rows(), poly.cols();\n  MatrixXd sub(num_monomials,2);\n  MatrixXd var = MatrixXd::Zero(num_monomials,max_vars);\n  MatrixXd pow = MatrixXd::Zero(num_monomials,max_vars);\n  VectorXd coeff(num_monomials);\n\n  int index=0;\n  for (int i=0; i<poly.rows(); i++) {\n    for (int j=0; j<poly.cols(); j++) {\n      auto monomials = poly(i,j).getMonomials();\n      for (vector<Polynomiald::Monomial>::const_iterator iter=monomials.begin(); iter!=monomials.end(); iter++) {\n        sub(index,0) = i+1;\n        sub(index,1) = j+1;\n        for (int k=0; k<iter->vars.size(); k++) {\n          var(index,k)=(double)iter->vars[k];\n          pow(index,k)=(double)iter->powers[k];\n        }\n        coeff(index) = iter->coefficient;\n        index++;\n      }\n    }\n  }\n\n  mxArray* plhs[1];\n  mxArray* prhs[5];\n  prhs[0] = eigenToMatlab(dim);\n  prhs[1] = eigenToMatlab(sub);\n  prhs[2] = eigenToMatlab(var);\n  prhs[3] = eigenToMatlab(pow);\n  prhs[4] = eigenToMatlab(coeff);\n  mexCallMATLABsafe(1,plhs,5,prhs,\"msspoly\");\n  return plhs[0];\n}\n\ntemplate <typename DerivedA, typename DerivedB>\nvoid dynamicsRHS(const MatrixBase<DerivedA> &x, MatrixBase<DerivedB> &xdot) \n{\n  xdot << x(1), -x(0)-x(1)*(x(0)*x(0)-1);\n}        \n        \nvoid mexFunction( int nlhs, mxArray *plhs[],int nrhs, const mxArray *prhs[] ) \n{\n  if (mxIsDouble(prhs[2])) {\n    Map<Vector2d> x(mxGetPrSafe(prhs[2]));\n    plhs[0] = mxCreateDoubleMatrix(2,1,mxREAL);\n    Map<Vector2d> xdot(mxGetPr(plhs[0]));\n    dynamicsRHS(x,xdot);\n  } else if (isa(prhs[2],\"msspoly\")) {\n    auto x = msspolyToEigen(prhs[2]);\n    Matrix< Polynomiald, 2, 1> xdot;\n    dynamicsRHS(x,xdot);\n\/\/    cout << xdot << endl;\n    plhs[0] = eigenToMSSPoly(xdot);\n\/\/    plhs[0] = mxCreateDoubleMatrix(2,1,mxREAL);\n  } else {\n    mexErrMsgIdAndTxt(\"Drake:VanDerPolCpp:UnknownType\",\"don't know how to handle the datatype passed in for x (yet)\");\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ --------------------------------------------------------------------\n\/\/  DnnLayerFullyConnected.cpp\n\/\/\n\/\/  Created by Barrett Davis on 5\/8\/16.\n\/\/  Copyright © 2016 Tree Frog Software. All rights reserved.\n\/\/ --------------------------------------------------------------------\n#include \"DnnLayerFullyConnected.h\"\n#include \"Error.h\"\n\nnamespace tfs {\n    \n    static const char *NAME = \"fc\";\n\n    const char*\n    DnnLayerFullyConnected::className( void ) {\n        return NAME;\n    }\n\n    DnnLayerFullyConnected::DnnLayerFullyConnected( DnnLayer *previousLayer, unsigned long neuronCount, const bool trainable ):\n    DnnLayer( NAME, previousLayer ),\n    m_neuron_count( neuronCount ),\n    m_l1_decay_mul( 0.0 ),\n    m_l2_decay_mul( 1.0 ) {         \/\/ Constructor\n        if( previousLayer != 0 ) {  \/\/ previousLayer should not be null.\n            setup( previousLayer, trainable );\n        } else {\n            log_error( \"previousLayer is null\" );\n        }\n    }\n    \n    DnnLayerFullyConnected::~DnnLayerFullyConnected( void ) {\n        \/\/ Destructor\n    }\n    \n    void\n    DnnLayerFullyConnected::setup( DnnLayer *previousLayer, const bool trainable ) {\n        \/\/ -----------------------------------------------------------------------------------\n        \/\/ n = number of neurons\n        \/\/ s = size of input data\n        \/\/  w[n,s+1] = neuron weight + bias weight\n        \/\/ dw[n,s+1] = gradiant + d\/dw bais\n        \/\/  a[n]     = activations of each neuron\n        \/\/ -----------------------------------------------------------------------------------\n        teardown();\n        const unsigned long s = previousLayer->aSize();\n\n        m_w = new Matrix( m_neuron_count, s + 1, 1 );\n        if( trainable ) {\n            m_dw = new Matrix( m_neuron_count, s + 1, 1 );\n        }\n        m_a = new Matrix( m_neuron_count, 1, 1 );\n        return;\n    }\n    \n    unsigned long\n    DnnLayerFullyConnected::neuronCount( void ) const {\n        return m_neuron_count;\n    }\n    \n    DNN_NUMERIC\n    DnnLayerFullyConnected::l1DecayMultiplier( void ) const {\n        return m_l1_decay_mul;\n    }\n    DNN_NUMERIC\n    DnnLayerFullyConnected::l1DecayMultiplier( DNN_NUMERIC value ) {\n        return m_l1_decay_mul = value;\n    }\n\n    DNN_NUMERIC\n    DnnLayerFullyConnected::l2DecayMultiplier( void ) const {\n        return m_l2_decay_mul;\n    }\n    DNN_NUMERIC\n    DnnLayerFullyConnected::l2DecayMultiplier( DNN_NUMERIC value ) {\n        return m_l2_decay_mul = value;\n    }\n    \n    \/\/forward: function(V, is_training) {\n    \/\/    this.in_act = V;\n    \/\/    var A = new Vol(1, 1, this.out_depth, 0.0);\n    \/\/    var Vw = V.w;\n    \/\/    for(var i=0;i<this.out_depth;i++) {\n    \/\/        var a = 0.0;\n    \/\/        var wi = this.filters[i].w;\n    \/\/        for(var d=0;d<this.num_inputs;d++) {\n    \/\/            a += Vw[d] * wi[d]; \/\/ for efficiency use Vols directly for now\n    \/\/        }\n    \/\/        a += this.biases.w[i];\n    \/\/        A.w[i] = a;\n    \/\/    }\n    \/\/    this.out_act = A;\n    \/\/    return this.out_act;\n    \/\/},\n\n    bool\n    DnnLayerFullyConnected::forward( void ) {\n        \/\/ -----------------------------------------------------------------------------------\n        \/\/ Forward propagate while training\n        \/\/ n = number of neurons\n        \/\/ s = size of input data\n        \/\/ m_w[n,s+1] = neuron weight + bias weight\n        \/\/ m_a[n]     = activations of each neuron\n        \/\/ -----------------------------------------------------------------------------------\n        if( m_w == 0 || m_dw == 0 || m_a == 0 || m_pa == 0 ) {\n            return log_error( \"Not configured for training\" );\n        }\n        const DNN_NUMERIC *input = m_pa->dataReadOnly();\n        const DNN_NUMERIC *iEnd  = m_pa->end();\n        const DNN_NUMERIC *ww    = m_w->data();  \/\/ weights[n,s]\n              DNN_NUMERIC *aa    = m_a->data();  \/\/ activations[n] for the neurons in this layer\n        const DNN_NUMERIC *aEnd  = m_a->end();   \/\/ A pointer just past the end of the activations\n        \n        while( aa < aEnd ) {\n            *aa = 0.0;\n            const DNN_NUMERIC *in = input;\n            while( in < iEnd ) {\n                *aa += *ww++ * *in++;\n            }\n            *aa += *ww++;   \/\/ = 1.0 * bias\n            aa++;\n        }\n\n        if( m_next_layer != 0 ) {\n            return m_next_layer->forward();\n        }\n        return true;\n    }\n\n\/\/backward: function() {\n\/\/    var V = this.in_act;\n\/\/    V.dw = global.zeros(V.w.length); \/\/ zero out the gradient in input Vol\n\/\/    \n\/\/    \/\/ compute gradient wrt weights and data\n\/\/    for(var i=0;i<this.out_depth;i++) {\n\/\/        var tfi = this.filters[i];\n\/\/        var chain_grad = this.out_act.dw[i];\n\/\/        for(var d=0;d<this.num_inputs;d++) {\n\/\/            V.dw[d] += tfi.w[d]*chain_grad; \/\/ grad wrt input data\n\/\/            tfi.dw[d] += V.w[d]*chain_grad; \/\/ grad wrt params\n\/\/        }\n\/\/        this.biases.dw[i] += chain_grad;\n\/\/    }\n\/\/},\n\/\/\n    bool\n    DnnLayerFullyConnected::backprop( void ) {\n        \/\/ Back propagate while training\n        if( m_w == 0 || m_dw == 0 || m_a == 0 || m_pa == 0 ) {\n            return log_error( \"Not configured for training\" );\n        }\n        if( m_prev_layer != 0 ) {\n            return m_prev_layer->backprop();\n        }\n        return true;\n    }\n    \n    bool\n    DnnLayerFullyConnected::predict( const Matrix &data ) {\n        \/\/ Forward progagate when predicting\n        if( m_w == 0 || m_a == 0 ) {\n            return log_error( \"Not configured for predicting\" );\n        }\n        if( m_w->size() != data.size()) {\n            return log_error( \"Input matrix does not match expected size\" );\n        }\n        if( m_next_layer != 0 ) {\n            return m_next_layer->predict( data );\n        }\n        return true;\n    }\n\n\n    \n}   \/\/ namespace tfs\n<commit_msg>tightening up the fully connected forward() pass<commit_after>\/\/ --------------------------------------------------------------------\n\/\/  DnnLayerFullyConnected.cpp\n\/\/\n\/\/  Created by Barrett Davis on 5\/8\/16.\n\/\/  Copyright © 2016 Tree Frog Software. All rights reserved.\n\/\/ --------------------------------------------------------------------\n#include \"DnnLayerFullyConnected.h\"\n#include \"Error.h\"\n\nnamespace tfs {\n    \n    static const char *NAME = \"fc\";\n\n    const char*\n    DnnLayerFullyConnected::className( void ) {\n        return NAME;\n    }\n\n    DnnLayerFullyConnected::DnnLayerFullyConnected( DnnLayer *previousLayer, unsigned long neuronCount, const bool trainable ):\n    DnnLayer( NAME, previousLayer ),\n    m_neuron_count( neuronCount ),\n    m_l1_decay_mul( 0.0 ),\n    m_l2_decay_mul( 1.0 ) {         \/\/ Constructor\n        if( previousLayer != 0 ) {  \/\/ previousLayer should not be null.\n            setup( previousLayer, trainable );\n        } else {\n            log_error( \"previousLayer is null\" );\n        }\n    }\n    \n    DnnLayerFullyConnected::~DnnLayerFullyConnected( void ) {\n        \/\/ Destructor\n    }\n    \n    void\n    DnnLayerFullyConnected::setup( DnnLayer *previousLayer, const bool trainable ) {\n        \/\/ -----------------------------------------------------------------------------------\n        \/\/ n = number of neurons\n        \/\/ s = size of input data\n        \/\/  w[n,s+1] = neuron weight + bias weight\n        \/\/ dw[n,s+1] = gradiant + d\/dw bais\n        \/\/  a[n]     = activations of each neuron\n        \/\/ -----------------------------------------------------------------------------------\n        teardown();\n        const unsigned long N = m_neuron_count;\n        const unsigned long S = previousLayer->aSize();\n\n        m_w = new Matrix( N, S + 1, 1 );\n        if( trainable ) {\n            m_dw = new Matrix( N, S + 1, 1 );\n        }\n        m_a = new Matrix( N, 1, 1 );\n        return;\n    }\n    \n    unsigned long\n    DnnLayerFullyConnected::neuronCount( void ) const {\n        return m_neuron_count;\n    }\n    \n    DNN_NUMERIC\n    DnnLayerFullyConnected::l1DecayMultiplier( void ) const {\n        return m_l1_decay_mul;\n    }\n    DNN_NUMERIC\n    DnnLayerFullyConnected::l1DecayMultiplier( DNN_NUMERIC value ) {\n        return m_l1_decay_mul = value;\n    }\n\n    DNN_NUMERIC\n    DnnLayerFullyConnected::l2DecayMultiplier( void ) const {\n        return m_l2_decay_mul;\n    }\n    DNN_NUMERIC\n    DnnLayerFullyConnected::l2DecayMultiplier( DNN_NUMERIC value ) {\n        return m_l2_decay_mul = value;\n    }\n    \n    bool\n    DnnLayerFullyConnected::forward( void ) {\n        \/\/ -----------------------------------------------------------------------------------\n        \/\/ Forward propagate while training\n        \/\/ n = number of neurons\n        \/\/ s = size of input data\n        \/\/ m_w[n,s+1] = neuron weight + bias weight\n        \/\/ m_a[n]     = activations of each neuron\n        \/\/ -----------------------------------------------------------------------------------\n        if( m_w == 0 || m_dw == 0 || m_a == 0 || m_pa == 0 ) {\n            return log_error( \"Not configured for training\" );\n        }\n        const DNN_NUMERIC *      input = m_pa->dataReadOnly();\n        const DNN_NUMERIC * const iEnd = m_pa->end(); \/\/ A pointer just past the end of the input\n        const DNN_NUMERIC *         ww = m_w->data(); \/\/ weights[n,s]\n              DNN_NUMERIC *         aa = m_a->data(); \/\/ activations[n] for the neurons in this layer\n        const DNN_NUMERIC * const aEnd = m_a->end();  \/\/ A pointer just past the end of the activations\n        \n        while( aa < aEnd ) {                    \/\/ Loop for each neuron activation\n            *aa = 0.0;\n            const DNN_NUMERIC *in = input;\n            while( in < iEnd ) {                \/\/ Loop for each input element\n                *aa += *ww++ * *in++;\n            }\n            *aa += *ww++;                       \/\/ Add the bias (1.0 * bias)\n            aa++;\n        }\n\n        if( m_next_layer != 0 ) {\n            return m_next_layer->forward();\n        }\n        return true;\n    }\n\n\/\/backward: function() {\n\/\/    var V = this.in_act;\n\/\/    V.dw = global.zeros(V.w.length); \/\/ zero out the gradient in input Vol\n\/\/    \n\/\/    \/\/ compute gradient wrt weights and data\n\/\/    for(var i=0;i<this.out_depth;i++) {\n\/\/        var tfi = this.filters[i];\n\/\/        var chain_grad = this.out_act.dw[i];\n\/\/        for(var d=0;d<this.num_inputs;d++) {\n\/\/            V.dw[d] += tfi.w[d]*chain_grad; \/\/ grad wrt input data\n\/\/            tfi.dw[d] += V.w[d]*chain_grad; \/\/ grad wrt params\n\/\/        }\n\/\/        this.biases.dw[i] += chain_grad;\n\/\/    }\n\/\/},\n\/\/\n    bool\n    DnnLayerFullyConnected::backprop( void ) {\n        \/\/ -----------------------------------------------------------------------------------\n        \/\/ Back propagate while training\n        \/\/ n = number of neurons\n        \/\/ s = size of input data\n        \/\/ m_w[n,s+1] = neuron weight + bias weight\n        \/\/ m_a[n]     = activations of each neuron\n        \/\/ -----------------------------------------------------------------------------------\n        if( m_w == 0 || m_dw == 0 || m_a == 0 || m_pa == 0 ) {\n            return log_error( \"Not configured for training\" );\n        }\n        if( m_prev_layer != 0 ) {\n            return m_prev_layer->backprop();\n        }\n        return true;\n    }\n    \n    bool\n    DnnLayerFullyConnected::predict( const Matrix &data ) {\n        \/\/ Forward progagate when predicting\n        if( m_w == 0 || m_a == 0 ) {\n            return log_error( \"Not configured for predicting\" );\n        }\n        if( m_w->size() != data.size()) {\n            return log_error( \"Input matrix does not match expected size\" );\n        }\n        if( m_next_layer != 0 ) {\n            return m_next_layer->predict( data );\n        }\n        return true;\n    }\n\n\n    \n}   \/\/ namespace tfs\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Update g_tcp_server.cpp<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n  Stepper.cpp - - Stepper library for Wiring\/Arduino - Version 0.4\n  \n  Original library     (0.1) by Tom Igoe.\n  Two-wire modifications   (0.2) by Sebastian Gassner\n  Combination version   (0.3) by Tom Igoe and David Mellis\n  Bug fix for four-wire   (0.4) by Tom Igoe, bug fix from Noah Shibley  \n\n  Drives a unipolar or bipolar stepper motor using  2 wires or 4 wires\n\n  When wiring multiple stepper motors to a microcontroller,\n  you quickly run out of output pins, with each motor requiring 4 connections. \n\n  By making use of the fact that at any time two of the four motor\n  coils are the inverse  of the other two, the number of\n  control connections can be reduced from 4 to 2. \n\n  A slightly modified circuit around a Darlington transistor array or an L293 H-bridge\n  connects to only 2 microcontroler pins, inverts the signals received,\n  and delivers the 4 (2 plus 2 inverted ones) output signals required\n  for driving a stepper motor.\n\n  The sequence of control signals for 4 control wires is as follows:\n\n  Step C0 C1 C2 C3\n     1  1  0  1  0\n     2  0  1  1  0\n     3  0  1  0  1\n     4  1  0  0  1\n\n  The sequence of controls signals for 2 control wires is as follows\n  (columns C1 and C2 from above):\n\n  Step C0 C1\n     1  0  1\n     2  1  1\n     3  1  0\n     4  0  0\n\n  The circuits can be found at \n \nhttp:\/\/www.arduino.cc\/en\/Tutorial\/Stepper\n \n \n *\/\n\n\n#include \"WProgram.h\"\n#include \"Stepper.h\"\n\n\/*\n * two-wire constructor.\n * Sets which wires should control the motor.\n *\/\nStepper::Stepper(int number_of_steps, int motor_pin_1, int motor_pin_2)\n{\n  this->step_number = 0;      \/\/ which step the motor is on\n  this->speed = 0;        \/\/ the motor speed, in revolutions per minute\n  this->step_delay = -1;  \/\/ step delay defaulted to max (minium rpms)\n  this->direction = 0;      \/\/ motor direction\n  this->last_step_time = 0;    \/\/ time stamp in ms of the last step taken\n  this->number_of_steps = number_of_steps;    \/\/ total number of steps for this motor\n  \n  \/\/ Arduino pins for the motor control connection:\n  this->motor_pin_1 = motor_pin_1;\n  this->motor_pin_2 = motor_pin_2;\n\n  \/\/ setup the pins on the microcontroller:\n  pinMode(this->motor_pin_1, OUTPUT);\n  pinMode(this->motor_pin_2, OUTPUT);\n  \n  \/\/ When there are only 2 pins, set the other two to 0:\n  this->motor_pin_3 = 0;\n  this->motor_pin_4 = 0;\n  \n  \/\/ pin_count is used by the stepMotor() method:\n  this->pin_count = 2;\n}\n\n\n\/*\n *   constructor for four-pin version\n *   Sets which wires should control the motor.\n *\/\n\nStepper::Stepper(int number_of_steps, int motor_pin_1, int motor_pin_2, int motor_pin_3, int motor_pin_4)\n{\n  this->step_number = 0;      \/\/ which step the motor is on\n  this->speed = 0;        \/\/ the motor speed, in revolutions per minute\n  this->step_delay = -1;  \/\/ step delay defaulted to max (minimum rpms)\n  this->direction = 0;      \/\/ motor direction\n  this->last_step_time = 0;    \/\/ time stamp in ms of the last step taken\n  this->number_of_steps = number_of_steps;    \/\/ total number of steps for this motor\n  \n  \/\/ Arduino pins for the motor control connection:\n  this->motor_pin_1 = motor_pin_1;\n  this->motor_pin_2 = motor_pin_2;\n  this->motor_pin_3 = motor_pin_3;\n  this->motor_pin_4 = motor_pin_4;\n\n  \/\/ setup the pins on the microcontroller:\n  pinMode(this->motor_pin_1, OUTPUT);\n  pinMode(this->motor_pin_2, OUTPUT);\n  pinMode(this->motor_pin_3, OUTPUT);\n  pinMode(this->motor_pin_4, OUTPUT);\n\n  \/\/ pin_count is used by the stepMotor() method:  \n  this->pin_count = 4;  \n}\n\n\/*\n  Sets the speed in revs per minute\n\n*\/\nvoid Stepper::setSpeed(long whatSpeed)\n{\n  \/\/ avoid divide by 0\n  if (whatSpeed > 0) {\n    this->step_delay = 60L * 1000L \/ this->number_of_steps \/ whatSpeed;\n  } else {\n    \/\/ divide by 0 attempted, set speed to minimum rpms\n    this->step_delay = -1; \n  }\n}\n\n\/*\n  Moves the motor steps_to_move steps.  If the number is negative, \n   the motor moves in the reverse direction.\n *\/\nvoid Stepper::step(int steps_to_move)\n{  \n  int steps_left = abs(steps_to_move);  \/\/ how many steps to take\n  \n  \/\/ determine direction based on whether steps_to_mode is + or -:\n  if (steps_to_move > 0) {this->direction = 1;}\n  if (steps_to_move < 0) {this->direction = 0;}\n    \n    \n  \/\/ decrement the number of steps, moving one step each time:\n  while(steps_left > 0) {\n  \/\/ move only if the appropriate delay has passed:\n  if (millis() - this->last_step_time >= this->step_delay) {\n      \/\/ get the timeStamp of when you stepped:\n      this->last_step_time = millis();\n      \/\/ increment or decrement the step number,\n      \/\/ depending on direction:\n      if (this->direction == 1) {\n        this->step_number++;\n        if (this->step_number == this->number_of_steps) {\n          this->step_number = 0;\n        }\n      } \n      else { \n        if (this->step_number == 0) {\n          this->step_number = this->number_of_steps;\n        }\n        this->step_number--;\n      }\n      \/\/ decrement the steps left:\n      steps_left--;\n      \/\/ step the motor to step number 0, 1, 2, or 3:\n      stepMotor(this->step_number % 4);\n    }\n  }\n}\n\n\/*\n * Moves the motor forward or backwards.\n *\/\nvoid Stepper::stepMotor(int thisStep)\n{\n  if (this->pin_count == 2) {\n    switch (thisStep) {\n      case 0: \/* 01 *\/\n      digitalWrite(motor_pin_1, LOW);\n      digitalWrite(motor_pin_2, HIGH);\n      break;\n      case 1: \/* 11 *\/\n      digitalWrite(motor_pin_1, HIGH);\n      digitalWrite(motor_pin_2, HIGH);\n      break;\n      case 2: \/* 10 *\/\n      digitalWrite(motor_pin_1, HIGH);\n      digitalWrite(motor_pin_2, LOW);\n      break;\n      case 3: \/* 00 *\/\n      digitalWrite(motor_pin_1, LOW);\n      digitalWrite(motor_pin_2, LOW);\n      break;\n    } \n  }\n  if (this->pin_count == 4) {\n    switch (thisStep) {\n      case 0:    \/\/ 1010\n      digitalWrite(motor_pin_1, HIGH);\n      digitalWrite(motor_pin_2, LOW);\n      digitalWrite(motor_pin_3, HIGH);\n      digitalWrite(motor_pin_4, LOW);\n      break;\n      case 1:    \/\/ 0110\n      digitalWrite(motor_pin_1, LOW);\n      digitalWrite(motor_pin_2, HIGH);\n      digitalWrite(motor_pin_3, HIGH);\n      digitalWrite(motor_pin_4, LOW);\n      break;\n      case 2:    \/\/0101\n      digitalWrite(motor_pin_1, LOW);\n      digitalWrite(motor_pin_2, HIGH);\n      digitalWrite(motor_pin_3, LOW);\n      digitalWrite(motor_pin_4, HIGH);\n      break;\n      case 3:    \/\/1001\n      digitalWrite(motor_pin_1, HIGH);\n      digitalWrite(motor_pin_2, LOW);\n      digitalWrite(motor_pin_3, LOW);\n      digitalWrite(motor_pin_4, HIGH);\n      break;\n    } \n  }\n}\n\n\/*\n  version() returns the version of the library:\n*\/\nint Stepper::version(void)\n{\n  return 4;\n}\n<commit_msg>Added check to step() for step_delay > 0<commit_after>\/*\n  Stepper.cpp - - Stepper library for Wiring\/Arduino - Version 0.4\n  \n  Original library     (0.1) by Tom Igoe.\n  Two-wire modifications   (0.2) by Sebastian Gassner\n  Combination version   (0.3) by Tom Igoe and David Mellis\n  Bug fix for four-wire   (0.4) by Tom Igoe, bug fix from Noah Shibley  \n\n  Drives a unipolar or bipolar stepper motor using  2 wires or 4 wires\n\n  When wiring multiple stepper motors to a microcontroller,\n  you quickly run out of output pins, with each motor requiring 4 connections. \n\n  By making use of the fact that at any time two of the four motor\n  coils are the inverse  of the other two, the number of\n  control connections can be reduced from 4 to 2. \n\n  A slightly modified circuit around a Darlington transistor array or an L293 H-bridge\n  connects to only 2 microcontroler pins, inverts the signals received,\n  and delivers the 4 (2 plus 2 inverted ones) output signals required\n  for driving a stepper motor.\n\n  The sequence of control signals for 4 control wires is as follows:\n\n  Step C0 C1 C2 C3\n     1  1  0  1  0\n     2  0  1  1  0\n     3  0  1  0  1\n     4  1  0  0  1\n\n  The sequence of controls signals for 2 control wires is as follows\n  (columns C1 and C2 from above):\n\n  Step C0 C1\n     1  0  1\n     2  1  1\n     3  1  0\n     4  0  0\n\n  The circuits can be found at \n \nhttp:\/\/www.arduino.cc\/en\/Tutorial\/Stepper\n \n \n *\/\n\n\n#include \"WProgram.h\"\n#include \"Stepper.h\"\n\n\/*\n * two-wire constructor.\n * Sets which wires should control the motor.\n *\/\nStepper::Stepper(int number_of_steps, int motor_pin_1, int motor_pin_2)\n{\n  this->step_number = 0;      \/\/ which step the motor is on\n  this->speed = 0;        \/\/ the motor speed, in revolutions per minute\n  this->step_delay = -1;  \/\/ step delay defaulted to max (minium rpms)\n  this->direction = 0;      \/\/ motor direction\n  this->last_step_time = 0;    \/\/ time stamp in ms of the last step taken\n  this->number_of_steps = number_of_steps;    \/\/ total number of steps for this motor\n  \n  \/\/ Arduino pins for the motor control connection:\n  this->motor_pin_1 = motor_pin_1;\n  this->motor_pin_2 = motor_pin_2;\n\n  \/\/ setup the pins on the microcontroller:\n  pinMode(this->motor_pin_1, OUTPUT);\n  pinMode(this->motor_pin_2, OUTPUT);\n  \n  \/\/ When there are only 2 pins, set the other two to 0:\n  this->motor_pin_3 = 0;\n  this->motor_pin_4 = 0;\n  \n  \/\/ pin_count is used by the stepMotor() method:\n  this->pin_count = 2;\n}\n\n\n\/*\n *   constructor for four-pin version\n *   Sets which wires should control the motor.\n *\/\n\nStepper::Stepper(int number_of_steps, int motor_pin_1, int motor_pin_2, int motor_pin_3, int motor_pin_4)\n{\n  this->step_number = 0;      \/\/ which step the motor is on\n  this->speed = 0;        \/\/ the motor speed, in revolutions per minute\n  this->step_delay = -1;  \/\/ step delay defaulted to max (minimum rpms)\n  this->direction = 0;      \/\/ motor direction\n  this->last_step_time = 0;    \/\/ time stamp in ms of the last step taken\n  this->number_of_steps = number_of_steps;    \/\/ total number of steps for this motor\n  \n  \/\/ Arduino pins for the motor control connection:\n  this->motor_pin_1 = motor_pin_1;\n  this->motor_pin_2 = motor_pin_2;\n  this->motor_pin_3 = motor_pin_3;\n  this->motor_pin_4 = motor_pin_4;\n\n  \/\/ setup the pins on the microcontroller:\n  pinMode(this->motor_pin_1, OUTPUT);\n  pinMode(this->motor_pin_2, OUTPUT);\n  pinMode(this->motor_pin_3, OUTPUT);\n  pinMode(this->motor_pin_4, OUTPUT);\n\n  \/\/ pin_count is used by the stepMotor() method:  \n  this->pin_count = 4;  \n}\n\n\/*\n  Sets the speed in revs per minute\n\n*\/\nvoid Stepper::setSpeed(long whatSpeed)\n{\n  \/\/ avoid divide by 0\n  if (whatSpeed > 0) {\n    this->step_delay = 60L * 1000L \/ this->number_of_steps \/ whatSpeed;\n  } else {\n    \/\/ divide by 0 attempted, set speed to minimum rpms\n    this->step_delay = -1; \n  }\n}\n\n\/*\n  Moves the motor steps_to_move steps.  If the number is negative, \n   the motor moves in the reverse direction.\n *\/\nvoid Stepper::step(int steps_to_move)\n{  \n  int steps_left = abs(steps_to_move);  \/\/ how many steps to take\n  \n  \/\/ determine direction based on whether steps_to_mode is + or -:\n  if (steps_to_move > 0) {this->direction = 1;}\n  if (steps_to_move < 0) {this->direction = 0;}\n    \n  \/\/ check that step_delay has a valid value  \n  if(step_delay > 0)  {\n    \/\/ decrement the number of steps, moving one step each time:\n    while(steps_left > 0) {\n    \/\/ move only if the appropriate delay has passed:\n    if (millis() - this->last_step_time >= this->step_delay) {\n       \/\/ get the timeStamp of when you stepped:\n       this->last_step_time = millis();\n       \/\/ increment or decrement the step number,\n       \/\/ depending on direction:\n       if (this->direction == 1) {\n         this->step_number++;\n         if (this->step_number == this->number_of_steps) {\n           this->step_number = 0;\n         }\n       } \n       else { \n         if (this->step_number == 0) {\n           this->step_number = this->number_of_steps;\n         }\n         this->step_number--;\n       }\n       \/\/ decrement the steps left:\n       steps_left--;\n       \/\/ step the motor to step number 0, 1, 2, or 3:\n       stepMotor(this->step_number % 4);\n     }\n    }\n  }\n}\n\n\/*\n * Moves the motor forward or backwards.\n *\/\nvoid Stepper::stepMotor(int thisStep)\n{\n  if (this->pin_count == 2) {\n    switch (thisStep) {\n      case 0: \/* 01 *\/\n      digitalWrite(motor_pin_1, LOW);\n      digitalWrite(motor_pin_2, HIGH);\n      break;\n      case 1: \/* 11 *\/\n      digitalWrite(motor_pin_1, HIGH);\n      digitalWrite(motor_pin_2, HIGH);\n      break;\n      case 2: \/* 10 *\/\n      digitalWrite(motor_pin_1, HIGH);\n      digitalWrite(motor_pin_2, LOW);\n      break;\n      case 3: \/* 00 *\/\n      digitalWrite(motor_pin_1, LOW);\n      digitalWrite(motor_pin_2, LOW);\n      break;\n    } \n  }\n  if (this->pin_count == 4) {\n    switch (thisStep) {\n      case 0:    \/\/ 1010\n      digitalWrite(motor_pin_1, HIGH);\n      digitalWrite(motor_pin_2, LOW);\n      digitalWrite(motor_pin_3, HIGH);\n      digitalWrite(motor_pin_4, LOW);\n      break;\n      case 1:    \/\/ 0110\n      digitalWrite(motor_pin_1, LOW);\n      digitalWrite(motor_pin_2, HIGH);\n      digitalWrite(motor_pin_3, HIGH);\n      digitalWrite(motor_pin_4, LOW);\n      break;\n      case 2:    \/\/0101\n      digitalWrite(motor_pin_1, LOW);\n      digitalWrite(motor_pin_2, HIGH);\n      digitalWrite(motor_pin_3, LOW);\n      digitalWrite(motor_pin_4, HIGH);\n      break;\n      case 3:    \/\/1001\n      digitalWrite(motor_pin_1, HIGH);\n      digitalWrite(motor_pin_2, LOW);\n      digitalWrite(motor_pin_3, LOW);\n      digitalWrite(motor_pin_4, HIGH);\n      break;\n    } \n  }\n}\n\n\/*\n  version() returns the version of the library:\n*\/\nint Stepper::version(void)\n{\n  return 4;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>-calib3d updates documentation<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>navi: added theta for lane marker based ref line.<commit_after><|endoftext|>"}
{"text":"<commit_before>#include <pybind11\/pybind11.h>\n\n#include \"Models\/MvnBase.hpp\"\n#include \"Models\/MvnModel.hpp\"\n#include \"Models\/MvnGivenScalarSigma.hpp\"\n#include \"Models\/MvnGivenSigma.hpp\"\n#include \"cpputil\/Ptr.hpp\"\n#include \"uint.hpp\"\n\nnamespace py = pybind11;\nPYBIND11_DECLARE_HOLDER_TYPE(T, BOOM::Ptr<T>, true);\n\nnamespace BayesBoom {\n  using namespace BOOM;\n  using BOOM::uint;\n\n  void MvnModel_def(py::module &boom) {\n\n    py::class_<MvnSuf,\n               BOOM::Ptr<MvnSuf>>(boom, \"MvnSuf\")\n        .def(py::init<int>(),\n             py::arg(\"dim\") = 0,\n             \"Args:\\n\"\n             \"  dim: The dimension of the model to be fit.\")\n        ;\n\n    py::class_<MvnBase,\n               BOOM::Ptr<MvnBase>>(boom, \"MvnBase\", py::multiple_inheritance())\n        .def_property_readonly(\n            \"dim\",\n            &MvnBase::dim,\n            \"The dimension of the random variable being modeled.\")\n        .def_property_readonly(\n            \"mu\",\n            &MvnBase::mu,\n            \"Mean of the distribution\")\n        .def_property_readonly(\n            \"Sigma\",\n            &MvnBase::Sigma,\n            \"Variance of the distribution\")\n        .def_property_readonly(\n            \"siginv\",\n            &MvnBase::siginv,\n            \"Precision (inverse variance) of the distribution\")\n        ;\n\n    py::class_<MvnBaseWithParams,\n               MvnBase,\n               BOOM::Ptr<MvnBaseWithParams>>(boom, \"MvnBaseWithParams\", py::multiple_inheritance())\n        .def_property_readonly(\n            \"mu\",\n            &MvnBaseWithParams::mu,\n            \"Mean of the distribution.\")\n        .def_property_readonly(\n            \"Sigma\",\n            &MvnBaseWithParams::Sigma,\n            \"Variance of the distribution.\")\n        .def_property_readonly(\n            \"siginv\",\n            &MvnBaseWithParams::siginv,\n            \"Precision (inverse variance) of the distribution.\")\n        .def(\"set_mu\",\n             [](MvnBaseWithParams &model, const Vector &mu) {\n               model.set_mu(mu);\n             },\n             \"Args:\\n\"\n             \"  mu: Mean of the distribution (boom Vector).\")\n        .def(\"set_Sigma\",\n             [](MvnBaseWithParams &model, const SpdMatrix &Sigma) {\n               model.set_Sigma(Sigma);\n             },\n             \"Args:\\n\"\n             \"  Sigma: Variance of the distribution (boom SpdMatrix).\")\n        .def(\"set_siginv\",\n             [](MvnBaseWithParams &model, const SpdMatrix &siginv) {\n               model.set_siginv(siginv);\n             },\n             \"Args:\\n\"\n             \"  siginv: Precision (inverse variance) of the distribution (boom SpdMatrix).\")\n        ;\n\n    py::class_<MvnModel,\n               MvnBaseWithParams,\n               PriorPolicy,\n               BOOM::Ptr<MvnModel>>(boom, \"MvnModel\", py::multiple_inheritance())\n        .def(py::init<uint, double, double>(),\n             py::arg(\"dim\"),\n             py::arg(\"mu\") = 0.0,\n             py::arg(\"sd\") = 1.0,\n             \"Create a mulitivariate normal model with identical means and \"\n             \"standard deviations for each element.\\n\\n\"\n             \"Args:\\n\"\n             \"  dim:  The dimension of the distribution.\\n\"\n             \"  mu:  The mean of each element.\\n\"\n             \"  sd:  The standard deviation of each element.\\n\")\n        .def(py::init<Vector, SpdMatrix, bool>(),\n             py::arg(\"mu\"),\n             py::arg(\"SigmaOrSiginv\"),\n             py::arg(\"ivar\") = false,\n             \"Create a MvnModel by specifying moments with a vector and a matrix.\\n\\n\"\n             \"Args:\\n\"\n             \"  mu:  mean of the distribution.\\n\"\n             \"  Sigma:  Variance or precision of the distribution.\\n\"\n             \"  ivar:  If True then Sigma is a precision (inverse variance).  \\n\"\n             \"         If False then Sigma is a variance matrix.\"\n             )\n        .def(py::init( [] (const Ptr<VectorParams> &mean,\n                           const Ptr<SpdParams> &var) {\n                         return new MvnModel(mean, var);\n                       }),\n             py::arg(\"mu\"),\n             py::arg(\"Sigma\"),\n             \"Create a MvnModel using parameter objects.\\n\\n\"\n             \"Args:\\n\"\n             \"  mu:  mean of the distribution.\\n\"\n             \"  Sigma:  Variance or precision of the distribution.\\n\"\n             )\n        .def(\"set_data\",\n             [](MvnModel &model, const Matrix &data) {\n               int n = data.nrow();\n               for (int i = 0; i < n; ++i) {\n                 NEW(VectorData, data_point)(data.row(i));\n                 model.add_data(data_point);\n               }\n             },\n             \"Assign a data set to the model.\\n\\n\"\n             \"Args:\\n\"\n             \"  data: boom.Matrix.  Rows are observations.  Columns are variables.\"\n             )\n        .def_property_readonly(\n            \"mean_parameter\",\n            [](const MvnModel &model) { return model.Mu_prm();},\n            \"The VectorParams object representing the mean of the distribution.\")\n        .def_property_readonly(\n            \"variance_parameter\",\n            [](const MvnModel &model) { return model.Sigma_prm();},\n            \"The SpdParams object representing the variance of the distribution.\")\n        .def(\"mle\",\n             &MvnModel::mle,\n             \"Set parameters to their maximum likelihood estimates.\")\n        .def(\"sim\",\n             &MvnModel::sim,\n             \"Simulate a draw from the distribution.\")\n        .def(\"__repr__\",\n             [](const Ptr<MvnModel> &model) {\n               std::ostringstream out;\n               out << \"A BOOM MvnModel with mean \" << model->mu()\n                   << std::endl\n                   << \"and variance matrix \";\n               if (model->dim() > 20) {\n                 out << \"too large to display.\" << std::endl;\n               } else {\n                 out << \"\\n\" << model->Sigma();\n               }\n               return out.str();\n             })\n        ;\n\n    \/\/=========================================================================\n\n    py::class_<MvnGivenScalarSigma,\n               MvnBase,\n               PriorPolicy,\n               Ptr<MvnGivenScalarSigma>>(boom, \"MvnGivenScalarSigma\", py::multiple_inheritance())\n        .def(py::init<const SpdMatrix&, const Ptr<UnivParams> &>(),\n             py::arg(\"ominv\"),\n             py::arg(\"sigsq\"),\n             \"\"\n             )\n        .def(py::init<const Vector &, const SpdMatrix&, const Ptr<UnivParams> &>(),\n             py::arg(\"mu\"),\n             py::arg(\"ominv\"),\n             py::arg(\"sigsq\"),\n             \"\"\n             )\n        ;\n\n    \/\/=========================================================================\n    py::class_<MvnGivenSigma,\n               MvnBase,\n               PriorPolicy,\n               Ptr<MvnGivenSigma>>(boom, \"MvnGivenSigma\", py::multiple_inheritance())\n        .def(py::init(\n            [](const Vector &mu, double kappa) {\n              return new MvnGivenSigma(mu, kappa);\n            }),\n             py::arg(\"mu\"),\n             py::arg(\"kappa\") = 1.0,\n             \"A prior distribution on the mean parameter of a multivariate \"\n             \"normal model.  The model is: \\n   \"\n             \"'mean | Sigma' ~ N(mu, Sigma \/ kappa).\\n\\n\"\n             \"Args:\\n\\n\"\n             \"  mu:  The mean of the distribution.\\n\"\n             \"  kappa:  The prior sample size.\\n\")\n        ;\n\n\n  }  \/\/ Module\n\n}  \/\/ namespace BayesBoom\n<commit_msg>Expose base class to python.<commit_after>#include <pybind11\/pybind11.h>\n\n#include \"Models\/MvnBase.hpp\"\n#include \"Models\/MvnModel.hpp\"\n#include \"Models\/MvnGivenScalarSigma.hpp\"\n#include \"Models\/MvnGivenSigma.hpp\"\n#include \"cpputil\/Ptr.hpp\"\n#include \"uint.hpp\"\n\nnamespace py = pybind11;\nPYBIND11_DECLARE_HOLDER_TYPE(T, BOOM::Ptr<T>, true);\n\nnamespace BayesBoom {\n  using namespace BOOM;\n  using BOOM::uint;\n\n  void MvnModel_def(py::module &boom) {\n\n    py::class_<MvnSuf,\n               BOOM::Ptr<MvnSuf>>(boom, \"MvnSuf\")\n        .def(py::init<int>(),\n             py::arg(\"dim\") = 0,\n             \"Args:\\n\"\n             \"  dim: The dimension of the model to be fit.\")\n        ;\n\n    py::class_<MvnBase,\n               BOOM::Ptr<MvnBase>>(boom, \"MvnBase\", py::multiple_inheritance())\n        .def_property_readonly(\n            \"dim\",\n            &MvnBase::dim,\n            \"The dimension of the random variable being modeled.\")\n        .def_property_readonly(\n            \"mu\",\n            &MvnBase::mu,\n            \"Mean of the distribution\")\n        .def_property_readonly(\n            \"Sigma\",\n            &MvnBase::Sigma,\n            \"Variance of the distribution\")\n        .def_property_readonly(\n            \"siginv\",\n            &MvnBase::siginv,\n            \"Precision (inverse variance) of the distribution\")\n        ;\n\n    py::class_<MvnBaseWithParams,\n               MvnBase,\n               BOOM::Ptr<MvnBaseWithParams>>(boom, \"MvnBaseWithParams\", py::multiple_inheritance())\n        .def_property_readonly(\n            \"mu\",\n            &MvnBaseWithParams::mu,\n            \"Mean of the distribution.\")\n        .def_property_readonly(\n            \"Sigma\",\n            &MvnBaseWithParams::Sigma,\n            \"Variance of the distribution.\")\n        .def_property_readonly(\n            \"siginv\",\n            &MvnBaseWithParams::siginv,\n            \"Precision (inverse variance) of the distribution.\")\n        .def(\"set_mu\",\n             [](MvnBaseWithParams &model, const Vector &mu) {\n               model.set_mu(mu);\n             },\n             \"Args:\\n\"\n             \"  mu: Mean of the distribution (boom Vector).\")\n        .def(\"set_Sigma\",\n             [](MvnBaseWithParams &model, const SpdMatrix &Sigma) {\n               model.set_Sigma(Sigma);\n             },\n             \"Args:\\n\"\n             \"  Sigma: Variance of the distribution (boom SpdMatrix).\")\n        .def(\"set_siginv\",\n             [](MvnBaseWithParams &model, const SpdMatrix &siginv) {\n               model.set_siginv(siginv);\n             },\n             \"Args:\\n\"\n             \"  siginv: Precision (inverse variance) of the distribution (boom SpdMatrix).\")\n        ;\n\n    py::class_<MvnModel,\n               MvnBaseWithParams,\n               PriorPolicy,\n               BOOM::Ptr<MvnModel>>(boom, \"MvnModel\", py::multiple_inheritance())\n        .def(py::init<uint, double, double>(),\n             py::arg(\"dim\"),\n             py::arg(\"mu\") = 0.0,\n             py::arg(\"sd\") = 1.0,\n             \"Create a mulitivariate normal model with identical means and \"\n             \"standard deviations for each element.\\n\\n\"\n             \"Args:\\n\"\n             \"  dim:  The dimension of the distribution.\\n\"\n             \"  mu:  The mean of each element.\\n\"\n             \"  sd:  The standard deviation of each element.\\n\")\n        .def(py::init<Vector, SpdMatrix, bool>(),\n             py::arg(\"mu\"),\n             py::arg(\"SigmaOrSiginv\"),\n             py::arg(\"ivar\") = false,\n             \"Create a MvnModel by specifying moments with a vector and a matrix.\\n\\n\"\n             \"Args:\\n\"\n             \"  mu:  mean of the distribution.\\n\"\n             \"  Sigma:  Variance or precision of the distribution.\\n\"\n             \"  ivar:  If True then Sigma is a precision (inverse variance).  \\n\"\n             \"         If False then Sigma is a variance matrix.\"\n             )\n        .def(py::init( [] (const Ptr<VectorParams> &mean,\n                           const Ptr<SpdParams> &var) {\n                         return new MvnModel(mean, var);\n                       }),\n             py::arg(\"mu\"),\n             py::arg(\"Sigma\"),\n             \"Create a MvnModel using parameter objects.\\n\\n\"\n             \"Args:\\n\"\n             \"  mu:  mean of the distribution.\\n\"\n             \"  Sigma:  Variance or precision of the distribution.\\n\"\n             )\n        .def(\"set_data\",\n             [](MvnModel &model, const Matrix &data) {\n               int n = data.nrow();\n               for (int i = 0; i < n; ++i) {\n                 NEW(VectorData, data_point)(data.row(i));\n                 model.add_data(data_point);\n               }\n             },\n             \"Assign a data set to the model.\\n\\n\"\n             \"Args:\\n\"\n             \"  data: boom.Matrix.  Rows are observations.  Columns are variables.\"\n             )\n        .def_property_readonly(\n            \"mean_parameter\",\n            [](const MvnModel &model) { return model.Mu_prm();},\n            \"The VectorParams object representing the mean of the distribution.\")\n        .def_property_readonly(\n            \"variance_parameter\",\n            [](const MvnModel &model) { return model.Sigma_prm();},\n            \"The SpdParams object representing the variance of the distribution.\")\n        .def(\"mle\",\n             &MvnModel::mle,\n             \"Set parameters to their maximum likelihood estimates.\")\n        .def(\"sim\",\n             &MvnModel::sim,\n             \"Simulate a draw from the distribution.\")\n        .def(\"__repr__\",\n             [](const Ptr<MvnModel> &model) {\n               std::ostringstream out;\n               out << \"A BOOM MvnModel with mean \" << model->mu()\n                   << std::endl\n                   << \"and variance matrix \";\n               if (model->dim() > 20) {\n                 out << \"too large to display.\" << std::endl;\n               } else {\n                 out << \"\\n\" << model->Sigma();\n               }\n               return out.str();\n             })\n        ;\n\n    \/\/=========================================================================\n    py::class_<MvnGivenScalarSigmaBase,\n               MvnBase,\n               Ptr<MvnGivenScalarSigmaBase>>(boom, \"MvnGivenScalarSigmaBase\", py::multiple_inheritance())\n        ;\n\n    py::class_<MvnGivenScalarSigma,\n               MvnGivenScalarSigmaBase,\n               PriorPolicy,\n               Ptr<MvnGivenScalarSigma>>(boom, \"MvnGivenScalarSigma\", py::multiple_inheritance())\n        .def(py::init<const SpdMatrix&, const Ptr<UnivParams> &>(),\n             py::arg(\"ominv\"),\n             py::arg(\"sigsq\"),\n             \"\"\n             )\n        .def(py::init<const Vector &, const SpdMatrix&, const Ptr<UnivParams> &>(),\n             py::arg(\"mu\"),\n             py::arg(\"ominv\"),\n             py::arg(\"sigsq\"),\n             \"\"\n             )\n        ;\n\n    \/\/=========================================================================\n    py::class_<MvnGivenSigma,\n               MvnBase,\n               PriorPolicy,\n               Ptr<MvnGivenSigma>>(boom, \"MvnGivenSigma\", py::multiple_inheritance())\n        .def(py::init(\n            [](const Vector &mu, double kappa) {\n              return new MvnGivenSigma(mu, kappa);\n            }),\n             py::arg(\"mu\"),\n             py::arg(\"kappa\") = 1.0,\n             \"A prior distribution on the mean parameter of a multivariate \"\n             \"normal model.  The model is: \\n   \"\n             \"'mean | Sigma' ~ N(mu, Sigma \/ kappa).\\n\\n\"\n             \"Args:\\n\\n\"\n             \"  mu:  The mean of the distribution.\\n\"\n             \"  kappa:  The prior sample size.\\n\")\n        ;\n\n\n  }  \/\/ Module\n\n}  \/\/ namespace BayesBoom\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\n#include \"chrome\/browser\/guest_view\/web_view\/chrome_web_view_guest_delegate.h\"\n\n#include \"chrome\/browser\/extensions\/chrome_extension_web_contents_observer.h\"\n#include \"chrome\/browser\/favicon\/favicon_helper.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/renderer_context_menu\/render_view_context_menu.h\"\n#include \"chrome\/browser\/ui\/pdf\/chrome_pdf_web_contents_helper_client.h\"\n#include \"chrome\/common\/chrome_version_info.h\"\n#include \"components\/browsing_data\/storage_partition_http_cache_data_remover.h\"\n#include \"components\/guest_view\/browser\/guest_view_event.h\"\n#include \"components\/pdf\/browser\/pdf_web_contents_helper.h\"\n#include \"components\/renderer_context_menu\/context_menu_delegate.h\"\n#include \"content\/public\/browser\/render_process_host.h\"\n#include \"extensions\/browser\/api\/web_request\/web_request_api.h\"\n#include \"extensions\/browser\/guest_view\/web_view\/web_view_constants.h\"\n\n#if defined(ENABLE_PRINTING)\n#if defined(ENABLE_PRINT_PREVIEW)\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_PRINT_PREVIEW)\n#endif  \/\/ defined(ENABLE_PRINTING)\n\nusing guest_view::GuestViewEvent;\n\nnamespace extensions {\n\nChromeWebViewGuestDelegate::ChromeWebViewGuestDelegate(\n    WebViewGuest* web_view_guest)\n    : pending_context_menu_request_id_(0),\n      chromevox_injected_(false),\n      web_view_guest_(web_view_guest),\n      weak_ptr_factory_(this) {\n}\n\nChromeWebViewGuestDelegate::~ChromeWebViewGuestDelegate() {\n}\n\nbool ChromeWebViewGuestDelegate::HandleContextMenu(\n    const content::ContextMenuParams& params) {\n  ContextMenuDelegate* menu_delegate =\n      ContextMenuDelegate::FromWebContents(guest_web_contents());\n  DCHECK(menu_delegate);\n\n  pending_menu_ = menu_delegate->BuildMenu(guest_web_contents(), params);\n\n  \/\/ Pass it to embedder.\n  int request_id = ++pending_context_menu_request_id_;\n  scoped_ptr<base::DictionaryValue> args(new base::DictionaryValue());\n  scoped_ptr<base::ListValue> items =\n      MenuModelToValue(pending_menu_->menu_model());\n  args->Set(webview::kContextMenuItems, items.release());\n  args->SetInteger(webview::kRequestId, request_id);\n  web_view_guest()->DispatchEventToView(\n      new GuestViewEvent(webview::kEventContextMenuShow, args.Pass()));\n  return true;\n}\n\n\/\/ TODO(hanxi) Investigate which of these observers should move to the\n\/\/ extension module in the future.\nvoid ChromeWebViewGuestDelegate::OnAttachWebViewHelpers(\n    content::WebContents* contents) {\n  favicon::CreateContentFaviconDriverForWebContents(contents);\n  ChromeExtensionWebContentsObserver::CreateForWebContents(contents);\n#if defined(ENABLE_PRINTING)\n#if defined(ENABLE_PRINT_PREVIEW)\n  printing::PrintViewManager::CreateForWebContents(contents);\n  printing::PrintPreviewMessageHandler::CreateForWebContents(contents);\n#else\n  printing::PrintViewManagerBasic::CreateForWebContents(contents);\n#endif  \/\/ defined(ENABLE_PRINT_PREVIEW)\n#endif  \/\/ defined(ENABLE_PRINTING)\n  pdf::PDFWebContentsHelper::CreateForWebContentsWithClient(\n      contents,\n      scoped_ptr<pdf::PDFWebContentsHelperClient>(\n          new ChromePDFWebContentsHelperClient()));\n}\n\nvoid ChromeWebViewGuestDelegate::OnDidInitialize() {\n#if defined(OS_CHROMEOS)\n  chromeos::AccessibilityManager* accessibility_manager =\n      chromeos::AccessibilityManager::Get();\n  CHECK(accessibility_manager);\n  accessibility_subscription_ = accessibility_manager->RegisterCallback(\n      base::Bind(&ChromeWebViewGuestDelegate::OnAccessibilityStatusChanged,\n                 weak_ptr_factory_.GetWeakPtr()));\n#endif\n}\n\nvoid ChromeWebViewGuestDelegate::OnGuestDestroyed() {\n  \/\/ Clean up custom context menu items for this guest.\n  MenuManager* menu_manager = MenuManager::Get(\n      Profile::FromBrowserContext(web_view_guest()->browser_context()));\n  menu_manager->RemoveAllContextItems(MenuItem::ExtensionKey(\n      web_view_guest()->owner_host(),\n      web_view_guest()->view_instance_id()));\n}\n\n\/\/ static\nscoped_ptr<base::ListValue> ChromeWebViewGuestDelegate::MenuModelToValue(\n    const ui::SimpleMenuModel& menu_model) {\n  scoped_ptr<base::ListValue> items(new base::ListValue());\n  for (int i = 0; i < menu_model.GetItemCount(); ++i) {\n    base::DictionaryValue* item_value = new base::DictionaryValue();\n    \/\/ TODO(lazyboy): We need to expose some kind of enum equivalent of\n    \/\/ |command_id| instead of plain integers.\n    item_value->SetInteger(webview::kMenuItemCommandId,\n                           menu_model.GetCommandIdAt(i));\n    item_value->SetString(webview::kMenuItemLabel, menu_model.GetLabelAt(i));\n    items->Append(item_value);\n  }\n  return items.Pass();\n}\n\nvoid ChromeWebViewGuestDelegate::OnShowContextMenu(\n    int request_id,\n    const MenuItemVector* items) {\n  if (!pending_menu_.get())\n    return;\n\n  \/\/ Make sure this was the correct request.\n  if (request_id != pending_context_menu_request_id_)\n    return;\n\n  \/\/ TODO(lazyboy): Implement.\n  DCHECK(!items);\n\n  ContextMenuDelegate* menu_delegate =\n      ContextMenuDelegate::FromWebContents(guest_web_contents());\n  menu_delegate->ShowMenu(pending_menu_.Pass());\n}\n\nvoid ChromeWebViewGuestDelegate::InjectChromeVoxIfNeeded(\n    content::RenderViewHost* render_view_host) {\n#if defined(OS_CHROMEOS)\n  if (!chromevox_injected_) {\n    chromeos::AccessibilityManager* manager =\n        chromeos::AccessibilityManager::Get();\n    if (manager && manager->IsSpokenFeedbackEnabled()) {\n      manager->InjectChromeVox(render_view_host);\n      chromevox_injected_ = true;\n    }\n  }\n#endif\n}\n\n#if defined(OS_CHROMEOS)\nvoid ChromeWebViewGuestDelegate::OnAccessibilityStatusChanged(\n    const chromeos::AccessibilityStatusEventDetails& details) {\n  if (details.notification_type == chromeos::ACCESSIBILITY_MANAGER_SHUTDOWN) {\n    accessibility_subscription_.reset();\n  } else if (details.notification_type ==\n      chromeos::ACCESSIBILITY_TOGGLE_SPOKEN_FEEDBACK) {\n    if (details.enabled)\n      InjectChromeVoxIfNeeded(guest_web_contents()->GetRenderViewHost());\n    else\n      chromevox_injected_ = false;\n  }\n}\n#endif\n\n}  \/\/ namespace extensions\n<commit_msg>Speculative fix for ChromeWebViewGuestDelegate crash.<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\n#include \"chrome\/browser\/guest_view\/web_view\/chrome_web_view_guest_delegate.h\"\n\n#include \"chrome\/browser\/extensions\/chrome_extension_web_contents_observer.h\"\n#include \"chrome\/browser\/favicon\/favicon_helper.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/renderer_context_menu\/render_view_context_menu.h\"\n#include \"chrome\/browser\/ui\/pdf\/chrome_pdf_web_contents_helper_client.h\"\n#include \"chrome\/common\/chrome_version_info.h\"\n#include \"components\/browsing_data\/storage_partition_http_cache_data_remover.h\"\n#include \"components\/guest_view\/browser\/guest_view_event.h\"\n#include \"components\/pdf\/browser\/pdf_web_contents_helper.h\"\n#include \"components\/renderer_context_menu\/context_menu_delegate.h\"\n#include \"content\/public\/browser\/render_process_host.h\"\n#include \"extensions\/browser\/api\/web_request\/web_request_api.h\"\n#include \"extensions\/browser\/guest_view\/web_view\/web_view_constants.h\"\n\n#if defined(ENABLE_PRINTING)\n#if defined(ENABLE_PRINT_PREVIEW)\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_PRINT_PREVIEW)\n#endif  \/\/ defined(ENABLE_PRINTING)\n\nusing guest_view::GuestViewEvent;\n\nnamespace extensions {\n\nChromeWebViewGuestDelegate::ChromeWebViewGuestDelegate(\n    WebViewGuest* web_view_guest)\n    : pending_context_menu_request_id_(0),\n      chromevox_injected_(false),\n      web_view_guest_(web_view_guest),\n      weak_ptr_factory_(this) {\n}\n\nChromeWebViewGuestDelegate::~ChromeWebViewGuestDelegate() {\n}\n\nbool ChromeWebViewGuestDelegate::HandleContextMenu(\n    const content::ContextMenuParams& params) {\n  ContextMenuDelegate* menu_delegate =\n      ContextMenuDelegate::FromWebContents(guest_web_contents());\n  DCHECK(menu_delegate);\n\n  pending_menu_ = menu_delegate->BuildMenu(guest_web_contents(), params);\n  \/\/ It's possible for the returned menu to be null, so early out to avoid\n  \/\/ a crash. TODO(wjmaclean): find out why it's possible for this to happen\n  \/\/ in the first place, and if it's an error.\n  if (!pending_menu_)\n    return false;\n\n  \/\/ Pass it to embedder.\n  int request_id = ++pending_context_menu_request_id_;\n  scoped_ptr<base::DictionaryValue> args(new base::DictionaryValue());\n  scoped_ptr<base::ListValue> items =\n      MenuModelToValue(pending_menu_->menu_model());\n  args->Set(webview::kContextMenuItems, items.release());\n  args->SetInteger(webview::kRequestId, request_id);\n  web_view_guest()->DispatchEventToView(\n      new GuestViewEvent(webview::kEventContextMenuShow, args.Pass()));\n  return true;\n}\n\n\/\/ TODO(hanxi) Investigate which of these observers should move to the\n\/\/ extension module in the future.\nvoid ChromeWebViewGuestDelegate::OnAttachWebViewHelpers(\n    content::WebContents* contents) {\n  favicon::CreateContentFaviconDriverForWebContents(contents);\n  ChromeExtensionWebContentsObserver::CreateForWebContents(contents);\n#if defined(ENABLE_PRINTING)\n#if defined(ENABLE_PRINT_PREVIEW)\n  printing::PrintViewManager::CreateForWebContents(contents);\n  printing::PrintPreviewMessageHandler::CreateForWebContents(contents);\n#else\n  printing::PrintViewManagerBasic::CreateForWebContents(contents);\n#endif  \/\/ defined(ENABLE_PRINT_PREVIEW)\n#endif  \/\/ defined(ENABLE_PRINTING)\n  pdf::PDFWebContentsHelper::CreateForWebContentsWithClient(\n      contents,\n      scoped_ptr<pdf::PDFWebContentsHelperClient>(\n          new ChromePDFWebContentsHelperClient()));\n}\n\nvoid ChromeWebViewGuestDelegate::OnDidInitialize() {\n#if defined(OS_CHROMEOS)\n  chromeos::AccessibilityManager* accessibility_manager =\n      chromeos::AccessibilityManager::Get();\n  CHECK(accessibility_manager);\n  accessibility_subscription_ = accessibility_manager->RegisterCallback(\n      base::Bind(&ChromeWebViewGuestDelegate::OnAccessibilityStatusChanged,\n                 weak_ptr_factory_.GetWeakPtr()));\n#endif\n}\n\nvoid ChromeWebViewGuestDelegate::OnGuestDestroyed() {\n  \/\/ Clean up custom context menu items for this guest.\n  MenuManager* menu_manager = MenuManager::Get(\n      Profile::FromBrowserContext(web_view_guest()->browser_context()));\n  menu_manager->RemoveAllContextItems(MenuItem::ExtensionKey(\n      web_view_guest()->owner_host(),\n      web_view_guest()->view_instance_id()));\n}\n\n\/\/ static\nscoped_ptr<base::ListValue> ChromeWebViewGuestDelegate::MenuModelToValue(\n    const ui::SimpleMenuModel& menu_model) {\n  scoped_ptr<base::ListValue> items(new base::ListValue());\n  for (int i = 0; i < menu_model.GetItemCount(); ++i) {\n    base::DictionaryValue* item_value = new base::DictionaryValue();\n    \/\/ TODO(lazyboy): We need to expose some kind of enum equivalent of\n    \/\/ |command_id| instead of plain integers.\n    item_value->SetInteger(webview::kMenuItemCommandId,\n                           menu_model.GetCommandIdAt(i));\n    item_value->SetString(webview::kMenuItemLabel, menu_model.GetLabelAt(i));\n    items->Append(item_value);\n  }\n  return items.Pass();\n}\n\nvoid ChromeWebViewGuestDelegate::OnShowContextMenu(\n    int request_id,\n    const MenuItemVector* items) {\n  if (!pending_menu_.get())\n    return;\n\n  \/\/ Make sure this was the correct request.\n  if (request_id != pending_context_menu_request_id_)\n    return;\n\n  \/\/ TODO(lazyboy): Implement.\n  DCHECK(!items);\n\n  ContextMenuDelegate* menu_delegate =\n      ContextMenuDelegate::FromWebContents(guest_web_contents());\n  menu_delegate->ShowMenu(pending_menu_.Pass());\n}\n\nvoid ChromeWebViewGuestDelegate::InjectChromeVoxIfNeeded(\n    content::RenderViewHost* render_view_host) {\n#if defined(OS_CHROMEOS)\n  if (!chromevox_injected_) {\n    chromeos::AccessibilityManager* manager =\n        chromeos::AccessibilityManager::Get();\n    if (manager && manager->IsSpokenFeedbackEnabled()) {\n      manager->InjectChromeVox(render_view_host);\n      chromevox_injected_ = true;\n    }\n  }\n#endif\n}\n\n#if defined(OS_CHROMEOS)\nvoid ChromeWebViewGuestDelegate::OnAccessibilityStatusChanged(\n    const chromeos::AccessibilityStatusEventDetails& details) {\n  if (details.notification_type == chromeos::ACCESSIBILITY_MANAGER_SHUTDOWN) {\n    accessibility_subscription_.reset();\n  } else if (details.notification_type ==\n      chromeos::ACCESSIBILITY_TOGGLE_SPOKEN_FEEDBACK) {\n    if (details.enabled)\n      InjectChromeVoxIfNeeded(guest_web_contents()->GetRenderViewHost());\n    else\n      chromevox_injected_ = false;\n  }\n}\n#endif\n\n}  \/\/ namespace extensions\n<|endoftext|>"}
{"text":"<commit_before>#include \"otbVectorImage.h\"\n#include \"otbImage.h\"\n#include \"otbImageFileReader.h\"\n#include \"otbStreamingImageFileWriter.h\"\n#include \"otbImageFileWriter.h\"\n#include \"otbCommandLineArgumentParser.h\"\n#include \"itkEuclideanDistance.h\"\n#include \"itkImageRegionSplitter.h\"\n#include \"otbStreamingTraits.h\"\n#include \"otbKMeansImageClassificationFilter.h\"\n#include \"itkImageRegionConstIterator.h\"\n#include \"itkListSample.h\"\n#include \"itkWeightedCentroidKdTreeGenerator.h\"\n#include \"itkKdTreeBasedKmeansEstimator.h\"\n\nint main(int argc, char * argv[])\n{\n\n  \/\/ Parse command line parameters\n  typedef otb::CommandLineArgumentParser ParserType;\n  ParserType::Pointer parser = ParserType::New();\n\n  parser->SetProgramDescription(\"Unsupervised KMeans image classification\");\n  parser->AddInputImage();\n  parser->AddOutputImage();\n  parser->AddOption(\"--ValidityMask\",\"Validity mask\",\"-vm\", 1, true);\n  parser->AddOption(\"--MaxTrainingSetSize\",\"Size of the training set\",\"-ts\", 1, true);\n  parser->AddOption(\"--TrainingSetProbability\",\"Probability for a sample to be selected in the training set\",\"-tp\", 1, true);\n  parser->AddOption(\"--NumberOfClasses\",\"Number of classes\",\"-nc\", 1, true);\n  parser->AddOption(\"--InitialCentroidProbability\",\"Probability for a pixel to be selected as an initial class centroid\",\"-cp\", 1, true);\n  parser->AddOption(\"--StreamingNumberOfLines\",\"Number of lined for each streaming block\",\"-sl\", 1, true);\n\n\n  typedef otb::CommandLineArgumentParseResult ParserResultType;\n  ParserResultType::Pointer  parseResult = ParserResultType::New();\n\n  try\n  {\n    parser->ParseCommandLine(argc, argv, parseResult);\n  }\n  catch ( itk::ExceptionObject & err )\n  {\n    std::string descriptionException = err.GetDescription();\n    if (descriptionException.find(\"ParseCommandLine(): Help Parser\") != std::string::npos)\n    {\n      return EXIT_SUCCESS;\n    }\n    if (descriptionException.find(\"ParseCommandLine(): Version Parser\") != std::string::npos)\n    {\n      return EXIT_SUCCESS;\n    }\n    return EXIT_FAILURE;\n  }\n\n  \/\/ initiating random number generation\n  srand(time(NULL));\n\n  std::string infname = parseResult->GetInputImage();\n  std::string maskfname = parseResult->GetParameterString(\"--ValidityMask\", 0);\n  std::string outfname = parseResult->GetOutputImage();\n  const unsigned int nbsamples = parseResult->GetParameterUInt(\"--MaxTrainingSetSize\");\n  const double trainingProb =parseResult->GetParameterDouble(\"--TrainingSetProbability\");\n  const double initProb = parseResult->GetParameterDouble(\"--InitialCentroidProbability\");\n  const unsigned int nbLinesForStreaming = parseResult->GetParameterUInt(\"--StreamingNumberOfLines\");\n  const unsigned int nb_classes = parseResult->GetParameterUInt(\"--NumberOfClasses\");\n\n  typedef unsigned short PixelType;\n  typedef unsigned short LabeledPixelType;\n\n  typedef otb::VectorImage<PixelType, 2> ImageType;\n  typedef otb::Image<LabeledPixelType, 2> LabeledImageType;\n  typedef otb::ImageFileReader<ImageType> ImageReaderType;\n  typedef otb::ImageFileReader<LabeledImageType> LabeledImageReaderType;\n  typedef otb::StreamingImageFileWriter<LabeledImageType> WriterType;\n\n  typedef itk::FixedArray<PixelType, 108> SampleType;\n  typedef itk::Statistics::ListSample<SampleType> ListSampleType;\n  typedef itk::Statistics::WeightedCentroidKdTreeGenerator<ListSampleType>   TreeGeneratorType;\n  typedef  TreeGeneratorType::KdTreeType                                     TreeType;\n  typedef itk::Statistics::KdTreeBasedKmeansEstimator<TreeType>              EstimatorType;\n\n  typedef otb::StreamingTraits<ImageType> StreamingTraitsType;\n  typedef itk::ImageRegionSplitter<2>  SplitterType;\n  typedef ImageType::RegionType RegionType;\n\n  typedef itk::ImageRegionConstIterator<ImageType> IteratorType;\n  typedef itk::ImageRegionConstIterator<LabeledImageType> LabeledIteratorType;\n\n  typedef otb::KMeansImageClassificationFilter<ImageType, LabeledImageType, 108> ClassificationFilterType;\n\n\n  ImageReaderType::Pointer reader = ImageReaderType::New();\n  LabeledImageReaderType::Pointer maskReader = LabeledImageReaderType::New();\n\n  reader->SetFileName(infname);\n  maskReader->SetFileName(maskfname);\n\n  \/*******************************************\/\n  \/*           Sampling data                 *\/\n  \/*******************************************\/\n  std::cout<<std::endl;\n  std::cout<<\"-- SAMPLING DATA --\"<<std::endl;\n  std::cout<<std::endl;\n\n  \/\/ Update input images information\n  reader->GenerateOutputInformation();\n  maskReader->GenerateOutputInformation();\n\n  if (reader->GetOutput()->GetLargestPossibleRegion()\n      != maskReader->GetOutput()->GetLargestPossibleRegion()\n     )\n  {\n    std::cerr<<\"Mask image and input image have different sizes.\"<<std::endl;\n    return EXIT_FAILURE;\n  }\n\n  RegionType largestRegion = reader->GetOutput()->GetLargestPossibleRegion();\n\n  \/\/ Setting up local streaming capabilities\n  SplitterType::Pointer splitter = SplitterType::New();\n  unsigned int numberOfStreamDivisions = StreamingTraitsType::CalculateNumberOfStreamDivisions(reader->GetOutput(),\n                                         largestRegion,\n                                         splitter,\n                                         otb::SET_BUFFER_NUMBER_OF_LINES,\n                                         0, 0, nbLinesForStreaming);\n\n  std::cout<<\"The images will be streamed into \"<<numberOfStreamDivisions<<\" parts.\"<<std::endl;\n\n  \/\/ Training sample lists\n  ListSampleType::Pointer sampleList = ListSampleType::New();\n  EstimatorType::ParametersType initialMeans(108*nb_classes);\n  initialMeans.Fill(0);\n  unsigned int init_means_index = 0;\n\n  \/\/ Sample dimension and max dimension\n  unsigned int maxDimension = SampleType::Dimension;\n  unsigned int sampleSize = std::min(reader->GetOutput()->GetNumberOfComponentsPerPixel(), maxDimension);\n  unsigned int totalSamples = 0;\n  std::cout<<\"Sample max possible dimension: \"<<maxDimension<<std::endl;\n  std::cout<<\"The following sample size will be used: \"<<sampleSize<<std::endl;\n  std::cout<<std::endl;\n  \/\/ local streaming variables\n  unsigned int piece = 0;\n  RegionType streamingRegion;\n\n  while ((totalSamples<nbsamples)&&(init_means_index<108*nb_classes))\n  {\n    piece = static_cast<unsigned int>(static_cast<double>(numberOfStreamDivisions)*rand()\/(RAND_MAX));\n\n    streamingRegion = splitter->GetSplit(piece, numberOfStreamDivisions, largestRegion);\n\n    std::cout<<\"Processing region: \"<<streamingRegion<<std::endl;\n\n    reader->GetOutput()->SetRequestedRegion(streamingRegion);\n    reader->GetOutput()->PropagateRequestedRegion();\n    reader->GetOutput()->UpdateOutputData();\n\n    maskReader->GetOutput()->SetRequestedRegion(streamingRegion);\n    maskReader->GetOutput()->PropagateRequestedRegion();\n    maskReader->GetOutput()->UpdateOutputData();\n\n    IteratorType it(reader->GetOutput(), streamingRegion);\n    LabeledIteratorType maskIt(maskReader->GetOutput(), streamingRegion);\n\n    it.GoToBegin();\n    maskIt.GoToBegin();\n\n    unsigned int localNbSamples=0;\n\n    \/\/ Loop on the image\n    while (!it.IsAtEnd()&&!maskIt.IsAtEnd()&&(totalSamples<nbsamples)&&(init_means_index<108*nb_classes))\n    {\n      \/\/ If the current pixel is labeled\n      if (maskIt.Get()>0)\n      {\n        if ((rand()<trainingProb*RAND_MAX))\n        {\n          SampleType newSample;\n\n          \/\/ build the sample\n          newSample.Fill(0);\n          for (unsigned int i = 0; i<sampleSize; ++i)\n          {\n            newSample[i]=it.Get()[i];\n          }\n          \/\/ Update the the sample lists\n          sampleList->PushBack(newSample);\n          ++totalSamples;\n          ++localNbSamples;\n        }\n        else if ((init_means_index<108*nb_classes)&&(rand()<initProb*RAND_MAX))\n        {\n          for (unsigned int i = 0; i<sampleSize; ++i)\n          {\n            initialMeans[init_means_index+i]=it.Get()[i];\n          }\n          init_means_index += 108;\n        }\n      }\n      ++it;\n      ++maskIt;\n    }\n    std::cout<<localNbSamples<<\" samples added to the training set.\"<<std::endl;\n    std::cout<<std::endl;\n  }\n\n  std::cout<<\"The final training set contains \"<<totalSamples<<\" samples.\"<<std::endl;\n\n\n  std::cout<<std::endl;\n  std::cout<<\"Data sampling completed.\"<<std::endl;\n  std::cout<<std::endl;\n\n  \/*******************************************\/\n  \/*           Learning                      *\/\n  \/*******************************************\/\n\n  std::cout<<\"-- LEARNING --\"<<std::endl;\n  std::cout<<std::endl;\n\n  std::cout<<\"Initial centroids are: \"<<std::endl;\n\n  for (unsigned int i=0; i<nb_classes; ++i)\n  {\n    std::cout<<\"Class \"<<i<<\": \";\n    for (unsigned int j = 0; j<sampleSize; ++j)\n    {\n      std::cout<<initialMeans[i*108+j]<<\"\\t\";\n    }\n    std::cout<<std::endl;\n  }\n  std::cout<<std::endl;\n\n  std::cout<<\"Starting optimization.\"<<std::endl;\n  std::cout<<std::endl;\n  EstimatorType::Pointer estimator = EstimatorType::New();\n\n  TreeGeneratorType::Pointer treeGenerator = TreeGeneratorType::New();\n  treeGenerator->SetSample(sampleList);\n  treeGenerator->SetBucketSize(100);\n  treeGenerator->Update();\n\n  estimator->SetParameters(initialMeans);\n  estimator->SetKdTree(treeGenerator->GetOutput());\n  estimator->SetMaximumIteration(100000000);\n  estimator->SetCentroidPositionChangesThreshold(0.001);\n  estimator->StartOptimization();\n\n  EstimatorType::ParametersType estimatedMeans = estimator->GetParameters();\n\n  std::cout<<\"Optimization completed.\"<<std::endl;\n  std::cout<<std::endl;\n  std::cout<<\"Estimated centroids are: \"<<std::endl;\n\n  for (unsigned int i=0; i<nb_classes; ++i)\n  {\n    std::cout<<\"Class \"<<i<<\": \";\n    for (unsigned int j = 0; j<sampleSize; ++j)\n    {\n      std::cout<<estimatedMeans[i*108+j]<<\"\\t\";\n    }\n    std::cout<<std::endl;\n  }\n\n  std::cout<<std::endl;\n  std::cout<<\"Learning completed.\"<<std::endl;\n  std::cout<<std::endl;\n\n\n  \/*******************************************\/\n  \/*           Classification                *\/\n  \/*******************************************\/\n\n  std::cout<<\"-- CLASSIFICATION --\"<<std::endl;\n  std::cout<<std::endl;\n  ClassificationFilterType::Pointer classifier = ClassificationFilterType::New();\n  classifier->SetInput(reader->GetOutput());\n  classifier->SetInputMask(maskReader->GetOutput());\n  classifier->SetCentroids(estimator->GetParameters());\n\n  WriterType::Pointer writer = WriterType::New();\n  writer->SetFileName(outfname);\n  writer->SetInput(classifier->GetOutput());\n  writer->SetNumberOfStreamDivisions(numberOfStreamDivisions);\n  writer->Update();\n\n  std::cout<<\"Classification completed.\"<<std::endl;\n  std::cout<<std::endl;\n\n  return EXIT_SUCCESS;\n}\n<commit_msg>WRG: remove deprecated calls<commit_after>#include \"otbVectorImage.h\"\n#include \"otbImage.h\"\n#include \"otbImageFileReader.h\"\n#include \"otbStreamingImageFileWriter.h\"\n#include \"otbImageFileWriter.h\"\n#include \"otbCommandLineArgumentParser.h\"\n#include \"itkEuclideanDistance.h\"\n#include \"itkImageRegionSplitter.h\"\n#include \"otbStreamingTraits.h\"\n#include \"otbKMeansImageClassificationFilter.h\"\n#include \"itkImageRegionConstIterator.h\"\n#include \"itkListSample.h\"\n#include \"itkWeightedCentroidKdTreeGenerator.h\"\n#include \"itkKdTreeBasedKmeansEstimator.h\"\n\nint main(int argc, char * argv[])\n{\n\n  \/\/ Parse command line parameters\n  typedef otb::CommandLineArgumentParser ParserType;\n  ParserType::Pointer parser = ParserType::New();\n\n  parser->SetProgramDescription(\"Unsupervised KMeans image classification\");\n  parser->AddInputImage();\n  parser->AddOutputImage();\n  parser->AddOption(\"--ValidityMask\",\"Validity mask\",\"-vm\", 1, true);\n  parser->AddOption(\"--MaxTrainingSetSize\",\"Size of the training set\",\"-ts\", 1, true);\n  parser->AddOption(\"--TrainingSetProbability\",\"Probability for a sample to be selected in the training set\",\"-tp\", 1, true);\n  parser->AddOption(\"--NumberOfClasses\",\"Number of classes\",\"-nc\", 1, true);\n  parser->AddOption(\"--InitialCentroidProbability\",\"Probability for a pixel to be selected as an initial class centroid\",\"-cp\", 1, true);\n  parser->AddOption(\"--StreamingNumberOfLines\",\"Number of lined for each streaming block\",\"-sl\", 1, true);\n\n\n  typedef otb::CommandLineArgumentParseResult ParserResultType;\n  ParserResultType::Pointer  parseResult = ParserResultType::New();\n\n  try\n  {\n    parser->ParseCommandLine(argc, argv, parseResult);\n  }\n  catch ( itk::ExceptionObject & err )\n  {\n    std::string descriptionException = err.GetDescription();\n    if (descriptionException.find(\"ParseCommandLine(): Help Parser\") != std::string::npos)\n    {\n      return EXIT_SUCCESS;\n    }\n    if (descriptionException.find(\"ParseCommandLine(): Version Parser\") != std::string::npos)\n    {\n      return EXIT_SUCCESS;\n    }\n    return EXIT_FAILURE;\n  }\n\n  \/\/ initiating random number generation\n  srand(time(NULL));\n\n  std::string infname = parseResult->GetInputImage();\n  std::string maskfname = parseResult->GetParameterString(\"--ValidityMask\", 0);\n  std::string outfname = parseResult->GetOutputImage();\n  const unsigned int nbsamples = parseResult->GetParameterUInt(\"--MaxTrainingSetSize\");\n  const double trainingProb =parseResult->GetParameterDouble(\"--TrainingSetProbability\");\n  const double initProb = parseResult->GetParameterDouble(\"--InitialCentroidProbability\");\n  const unsigned int nbLinesForStreaming = parseResult->GetParameterUInt(\"--StreamingNumberOfLines\");\n  const unsigned int nb_classes = parseResult->GetParameterUInt(\"--NumberOfClasses\");\n\n  typedef unsigned short PixelType;\n  typedef unsigned short LabeledPixelType;\n\n  typedef otb::VectorImage<PixelType, 2> ImageType;\n  typedef otb::Image<LabeledPixelType, 2> LabeledImageType;\n  typedef otb::ImageFileReader<ImageType> ImageReaderType;\n  typedef otb::ImageFileReader<LabeledImageType> LabeledImageReaderType;\n  typedef otb::StreamingImageFileWriter<LabeledImageType> WriterType;\n\n  typedef itk::FixedArray<PixelType, 108> SampleType;\n  typedef itk::Statistics::ListSample<SampleType> ListSampleType;\n  typedef itk::Statistics::WeightedCentroidKdTreeGenerator<ListSampleType>   TreeGeneratorType;\n  typedef  TreeGeneratorType::KdTreeType                                     TreeType;\n  typedef itk::Statistics::KdTreeBasedKmeansEstimator<TreeType>              EstimatorType;\n\n  typedef otb::StreamingTraits<ImageType> StreamingTraitsType;\n  typedef itk::ImageRegionSplitter<2>  SplitterType;\n  typedef ImageType::RegionType RegionType;\n\n  typedef itk::ImageRegionConstIterator<ImageType> IteratorType;\n  typedef itk::ImageRegionConstIterator<LabeledImageType> LabeledIteratorType;\n\n  typedef otb::KMeansImageClassificationFilter<ImageType, LabeledImageType, 108> ClassificationFilterType;\n\n\n  ImageReaderType::Pointer reader = ImageReaderType::New();\n  LabeledImageReaderType::Pointer maskReader = LabeledImageReaderType::New();\n\n  reader->SetFileName(infname);\n  maskReader->SetFileName(maskfname);\n\n  \/*******************************************\/\n  \/*           Sampling data                 *\/\n  \/*******************************************\/\n  std::cout<<std::endl;\n  std::cout<<\"-- SAMPLING DATA --\"<<std::endl;\n  std::cout<<std::endl;\n\n  \/\/ Update input images information\n  reader->GenerateOutputInformation();\n  maskReader->GenerateOutputInformation();\n\n  if (reader->GetOutput()->GetLargestPossibleRegion()\n      != maskReader->GetOutput()->GetLargestPossibleRegion()\n     )\n  {\n    std::cerr<<\"Mask image and input image have different sizes.\"<<std::endl;\n    return EXIT_FAILURE;\n  }\n\n  RegionType largestRegion = reader->GetOutput()->GetLargestPossibleRegion();\n\n  \/\/ Setting up local streaming capabilities\n  SplitterType::Pointer splitter = SplitterType::New();\n  unsigned int numberOfStreamDivisions = StreamingTraitsType::CalculateNumberOfStreamDivisions(reader->GetOutput(),\n                                         largestRegion,\n                                         splitter,\n                                         otb::SET_BUFFER_NUMBER_OF_LINES,\n                                         0, 0, nbLinesForStreaming);\n\n  std::cout<<\"The images will be streamed into \"<<numberOfStreamDivisions<<\" parts.\"<<std::endl;\n\n  \/\/ Training sample lists\n  ListSampleType::Pointer sampleList = ListSampleType::New();\n  EstimatorType::ParametersType initialMeans(108*nb_classes);\n  initialMeans.Fill(0);\n  unsigned int init_means_index = 0;\n\n  \/\/ Sample dimension and max dimension\n  unsigned int maxDimension = SampleType::Dimension;\n  unsigned int sampleSize = std::min(reader->GetOutput()->GetNumberOfComponentsPerPixel(), maxDimension);\n  unsigned int totalSamples = 0;\n  std::cout<<\"Sample max possible dimension: \"<<maxDimension<<std::endl;\n  std::cout<<\"The following sample size will be used: \"<<sampleSize<<std::endl;\n  std::cout<<std::endl;\n  \/\/ local streaming variables\n  unsigned int piece = 0;\n  RegionType streamingRegion;\n\n  while ((totalSamples<nbsamples)&&(init_means_index<108*nb_classes))\n  {\n    piece = static_cast<unsigned int>(static_cast<double>(numberOfStreamDivisions)*rand()\/(RAND_MAX));\n\n    streamingRegion = splitter->GetSplit(piece, numberOfStreamDivisions, largestRegion);\n\n    std::cout<<\"Processing region: \"<<streamingRegion<<std::endl;\n\n    reader->GetOutput()->SetRequestedRegion(streamingRegion);\n    reader->GetOutput()->PropagateRequestedRegion();\n    reader->GetOutput()->UpdateOutputData();\n\n    maskReader->GetOutput()->SetRequestedRegion(streamingRegion);\n    maskReader->GetOutput()->PropagateRequestedRegion();\n    maskReader->GetOutput()->UpdateOutputData();\n\n    IteratorType it(reader->GetOutput(), streamingRegion);\n    LabeledIteratorType maskIt(maskReader->GetOutput(), streamingRegion);\n\n    it.GoToBegin();\n    maskIt.GoToBegin();\n\n    unsigned int localNbSamples=0;\n\n    \/\/ Loop on the image\n    while (!it.IsAtEnd()&&!maskIt.IsAtEnd()&&(totalSamples<nbsamples)&&(init_means_index<108*nb_classes))\n    {\n      \/\/ If the current pixel is labeled\n      if (maskIt.Get()>0)\n      {\n        if ((rand()<trainingProb*RAND_MAX))\n        {\n          SampleType newSample;\n\n          \/\/ build the sample\n          newSample.Fill(0);\n          for (unsigned int i = 0; i<sampleSize; ++i)\n          {\n            newSample[i]=it.Get()[i];\n          }\n          \/\/ Update the the sample lists\n          sampleList->PushBack(newSample);\n          ++totalSamples;\n          ++localNbSamples;\n        }\n        else if ((init_means_index<108*nb_classes)&&(rand()<initProb*RAND_MAX))\n        {\n          for (unsigned int i = 0; i<sampleSize; ++i)\n          {\n            initialMeans[init_means_index+i]=it.Get()[i];\n          }\n          init_means_index += 108;\n        }\n      }\n      ++it;\n      ++maskIt;\n    }\n    std::cout<<localNbSamples<<\" samples added to the training set.\"<<std::endl;\n    std::cout<<std::endl;\n  }\n\n  std::cout<<\"The final training set contains \"<<totalSamples<<\" samples.\"<<std::endl;\n\n\n  std::cout<<std::endl;\n  std::cout<<\"Data sampling completed.\"<<std::endl;\n  std::cout<<std::endl;\n\n  \/*******************************************\/\n  \/*           Learning                      *\/\n  \/*******************************************\/\n\n  std::cout<<\"-- LEARNING --\"<<std::endl;\n  std::cout<<std::endl;\n\n  std::cout<<\"Initial centroids are: \"<<std::endl;\n\n  for (unsigned int i=0; i<nb_classes; ++i)\n  {\n    std::cout<<\"Class \"<<i<<\": \";\n    for (unsigned int j = 0; j<sampleSize; ++j)\n    {\n      std::cout<<initialMeans[i*108+j]<<\"\\t\";\n    }\n    std::cout<<std::endl;\n  }\n  std::cout<<std::endl;\n\n  std::cout<<\"Starting optimization.\"<<std::endl;\n  std::cout<<std::endl;\n  EstimatorType::Pointer estimator = EstimatorType::New();\n\n  TreeGeneratorType::Pointer treeGenerator = TreeGeneratorType::New();\n  treeGenerator->SetSample(sampleList);\n  treeGenerator->SetBucketSize(100);\n  treeGenerator->Update();\n\n  estimator->SetParameters(initialMeans);\n  estimator->SetKdTree(treeGenerator->GetOutput());\n  estimator->SetMaximumIteration(100000000);\n  estimator->SetCentroidPositionChangesThreshold(0.001);\n  estimator->StartOptimization();\n\n  EstimatorType::ParametersType estimatedMeans = estimator->GetParameters();\n\n  std::cout<<\"Optimization completed.\"<<std::endl;\n  std::cout<<std::endl;\n  std::cout<<\"Estimated centroids are: \"<<std::endl;\n\n  for (unsigned int i=0; i<nb_classes; ++i)\n  {\n    std::cout<<\"Class \"<<i<<\": \";\n    for (unsigned int j = 0; j<sampleSize; ++j)\n    {\n      std::cout<<estimatedMeans[i*108+j]<<\"\\t\";\n    }\n    std::cout<<std::endl;\n  }\n\n  std::cout<<std::endl;\n  std::cout<<\"Learning completed.\"<<std::endl;\n  std::cout<<std::endl;\n\n\n  \/*******************************************\/\n  \/*           Classification                *\/\n  \/*******************************************\/\n\n  std::cout<<\"-- CLASSIFICATION --\"<<std::endl;\n  std::cout<<std::endl;\n  ClassificationFilterType::Pointer classifier = ClassificationFilterType::New();\n  classifier->SetInput(reader->GetOutput());\n  classifier->SetInputMask(maskReader->GetOutput());\n  classifier->SetCentroids(estimator->GetParameters());\n\n  WriterType::Pointer writer = WriterType::New();\n  writer->SetFileName(outfname);\n  writer->SetInput(classifier->GetOutput());\n  writer->SetNumberOfDivisionsStrippedStreaming(numberOfStreamDivisions);\n  writer->Update();\n\n  std::cout<<\"Classification completed.\"<<std::endl;\n  std::cout<<std::endl;\n\n  return EXIT_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before><?hh \/\/ strict\n\nnamespace Dust\\Evaluate;\n\nuse Dust\\Ast;\nuse Dust\\Dust;\nuse Dust\\Filter;\n\nclass Evaluator\n{\n    \/**\n     * @var \\Dust\\Dust\n     *\/\n    public Dust $dust;\n    \n    \/**\n     * @var \\Dust\\Evaluate\\EvaluatorOptions\n     *\/\n    public EvaluatorOptions $options;\n\n    \/**\n     * @param \\Dust\\Dust $dust\n     * @param \\Dust\\Evaluate\\EvaluatorOptions $options\n     *\/\n    public function __construct(Dust $dust, ?EvaluatorOptions $options = NULL): void {\n        $this->dust = $dust;\n        $this->options = ($options !== NULL) ? $options : new EvaluatorOptions;\n    }\n\n    \/**\n     * @param \\Dust\\Ast\\Ast $ast\n     * @param string $message\n     * @throws \\Dust\\Evaluate\\EvaluateException\n     *\/\n    public function error(?Ast\\Ast $ast = NULL, ?string $message = NULL): void {\n        throw new EvaluateException($ast, $message);\n    }\n\n    \/**\n     * @param \\Dust\\Ast\\Body $source\n     * @param $state\n     * @return\n     *\/\n    public function evaluate(Ast\\Body $source, $state) {\n        return trim($this->evaluateBody($source, new Context($this, NULL, new State($state)), new Chunk($this))->getOut());\n    }\n\n    \/**\n     * @param \\Dust\\Ast\\Body $body\n     * @param \\Dust\\Evaluate\\Context $ctx\n     * @param \\Dust\\Evaluate\\Chunk $chunk\n     * @return \\Dust\\Evaluate\\Chunk\n     *\/\n    public function evaluateBody(Ast\\Body $body, Context $ctx, Chunk $chunk): Chunk {\n        \/\/ Go ahead and set the file path on the current context\n        if ($body->filePath !== NULL)\n            $ctx->currentFilePath = $body->filePath;\n        \n        foreach ($body->parts as $part)\n        {\n            if ($part instanceof Ast\\Comment) {}\n            else if ($part instanceof Ast\\Section)\n                $chunk = $this->evaluateSection($part, $ctx, $chunk);\n            else if ($part instanceof Ast\\Partial)\n                $chunk = $this->evaluatePartial($part, $ctx, $chunk);\n            else if ($part instanceof Ast\\Special)\n                $chunk = $this->evaluateSpecial($part, $ctx, $chunk);\n            else if ($part instanceof Ast\\Reference)\n                $chunk = $this->evaluateReference($part, $ctx, $chunk);\n            else if ($part instanceof Ast\\Buffer)\n                $chunk = $this->evaluateBuffer($part, $ctx, $chunk);\n        }\n\n        return $chunk;\n    }\n    \n    \/**\n     * @param \\Dust\\Ast\\Buffer $buffer\n     * @param \\Dust\\Evaluate\\Context $ctx\n     * @param \\Dust\\Evaluate\\Chunk $chunk\n     * @return \\Dust\\Evaluate\\Chunk\n     *\/\n    public function evaluateBuffer(Ast\\Buffer $buffer, Context $ctx, Chunk $chunk): Chunk {\n        $chunk->write($buffer->contents);\n        return $chunk;\n    }\n    \n    \/**\n     * @param \\Dust\\Ast\\Section $section\n     * @param \\Dust\\Evaluate\\Context $ctx\n     * @param \\Dust\\Evaluate\\Chunk $chunk\n     * @return \\Dust\\Evaluate\\Chunk\n     *\/\n    public function evaluateElseBody(Ast\\Section $section, Context $ctx, Chunk $chunk): Chunk {\n        if ($section->bodies != NULL && count($section->bodies) > 0)\n        {\n            foreach ($section->bodies as $value)\n            {\n                if ($value->key == \"else\")\n                    $chunk = $this->evaluateBody($value->body, $ctx, $chunk);\n            }\n        }\n\n        return $chunk;\n    }\n    \n    \/**\n     * @param array $params\n     * @param \\Dust\\Evaluate\\Context $ctx\n     * @return array\n     *\/\n    public function evaluateParameters(array $params, Context $ctx): array {\n        $ret = [];\n        \n        foreach ($params as $value)\n        {\n            if ($value instanceof Ast\\NumericParameter)\n            {\n                if(strpos($value->value, '.') === false)\n                    $ret[$value->key] = intval($value->value);\n                else\n                    $ret[$value->key] = floatval($value->value);\n            }\n            else if ($value instanceof Ast\\IdentifierParameter)\n                $ret[$value->key] = $ctx->resolve($value->value);\n            else\n            {\n                \/\/ We just set this as the actual AST since it is resolved where it's emitted\n                $ret[$value->key] = $value->value;\n            }\n        }\n\n        return $ret;\n    }\n    \n    \/**\n     * @param \\Dust\\Ast\\Partial $partial\n     * @param \\Dust\\Evaluate\\Context $ctx\n     * @param \\Dust\\Evaluate\\Chunk $chunk\n     * @return \\Dust\\Evaluate\\Chunk\n     *\/\n    public function evaluatePartial(Ast\\Partial $partial, Context $ctx, Chunk $chunk): Chunk {\n        $partialName = $partial->key;\n        \n        if ($partialName == NULL) $partialName = $this->toDustString($this->normalizeResolved($ctx, $partial->inline, $chunk));\n        if ($partialName == NULL) return $chunk;\n        \n        \/\/ Is a named block\n        if ($partial->type == \"+\")\n        {\n            \/\/ Mark beginning\n            $chunk->markNamedBlockBegin($partialName);\n            \/\/ Go ahead and try to replace\n            $chunk->replaceNamedBlock($partialName);\n\n            return $chunk;\n        }\n        \n        \/\/ Otherwise, we're > ; get base directory\n        $basePath = $ctx->currentFilePath;\n        if ($basePath != NULL)\n            $basePath = dirname($basePath);\n        \n        \/\/ Load partial\n        $partialBody = $this->dust->loadTemplate($partialName, $basePath);\n        if ($partialBody == NULL)\n            return $chunk;\n        \n        \/\/ Null main state\n        $state = new State(NULL);\n        \/\/ Partial context?\n        if ($partial->context != NULL)\n            $state->forcedParent = $ctx->resolve($partial->context->identifier);\n        \n        \/\/ Params?\n        if (!empty($partial->parameters))\n            $state->params = $this->evaluateParameters($partial->parameters, $ctx);\n\n        \/\/ Render the partial then\n        return $this->evaluateBody($partialBody, $ctx->pushState($state), $chunk);\n    }\n    \n    \/**\n     * @param \\Dust\\Ast\\Reference $ref\n     * @param \\Dust\\Evaluate\\Context $ctx\n     * @param \\Dust\\Evaluate\\Chunk $chunk\n     * @return \\Dust\\Evaluate\\Chunk\n     *\/\n    public function evaluateReference(Ast\\Reference $ref, Context $ctx, Chunk $chunk): Chunk {\n        \/\/ Resolve\n        $resolved = $this->normalizeResolved($ctx, $ctx->resolve($ref->identifier), $chunk);\n\n        if (!$this->isEmpty($resolved))\n        {\n            if ($resolved instanceof Chunk)\n                return $resolved;\n            \n            \/\/ Make the string\n            if (empty($ref->filters))\n            {\n                \/\/ Fefault filters\n                $resolved = array_reduce($this->dust->automaticFilters, function ($prev, Filter\\Filter $filter) {\n                    return $filter->apply($prev);\n                }, $resolved);\n            }\n            else\n            {\n                \/\/ Apply filters in order...\n                $resolved = array_reduce($ref->filters, function ($prev, Ast\\Filter $curr)\n                {\n                    if (array_key_exists($curr->key, $this->dust->filters))\n                    {\n                        $filter = $this->dust->filters[$curr->key];\n                        return $filter->apply($prev);\n                    }\n                    else\n                        return $prev;\n                }, $resolved);\n            }\n            $chunk->write($this->toDustString($resolved));\n        }\n\n        return $chunk;\n    }\n    \n    \/**\n     * @param \\Dust\\Ast\\Section $section\n     * @param \\Dust\\Evaluate\\Context $ctx\n     * @param \\Dust\\Evaluate\\Chunk $chunk\n     * @return \\Dust\\Evaluate\\Chunk\n     *\/\n    public function evaluateSection(Ast\\Section $section, Context $ctx, Chunk $chunk): Chunk {\n        \/\/ Stuff that doesn't need resolution\n        if ($section->type == \"+\")\n        {\n            if($section->identifier->key == NULL)\n                $this->error($section->identifier, \"Evaluated identifier for partial not supported\");\n            \n            \/\/ Mark beginning\n            $block = $chunk->markNamedBlockBegin($section->identifier->key);\n            \/\/ Render default contents\n            if ($section->body != NULL)\n            {\n                $chunk = $this->evaluateBody($section->body, $ctx, $chunk);\n                \/\/ Mark ending\n                $chunk->markNamedBlockEnd($block);\n            }\n            \/\/ Go ahead and try to replace\n            $chunk->replaceNamedBlock($section->identifier->key);\n        }\n        else if ($section->type == \"<\")\n        {\n            if ($section->identifier->key == NULL)\n                $this->error($section->identifier, \"Evaluated identifier for partial not supported\");\n            \n            $chunk->setAndReplaceNamedBlock($section, $ctx);\n        }\n        else if ($section->type == \"@\")\n        {\n            if ($section->identifier->key == NULL)\n                $this->error($section->identifier, \"Evaluated identifier for helper not supported\");\n            \n            \/\/ Do we have the helper?\n            if(!isset($this->dust->helpers[$section->identifier->key]))\n                $this->error($section->identifier, \"Unable to find helper\");\n            \n            $helper = $this->dust->helpers[$section->identifier->key];\n            \n            \/\/ Build state w\/ no current value\n            $state = new State(NULL);\n            \n            \/\/ Do we have an explicit context?\n            if ($section->context != NULL)\n                $state->forcedParent = $ctx->resolve($section->context->identifier);\n            \n            \/\/ How about params?\n            if (!empty($section->parameters))\n                $state->params = $this->evaluateParameters($section->parameters, $ctx);\n            \n            \/\/ Now run the helper\n            $chunk = $this->handleCallback($ctx->pushState($state), $helper, $chunk, $section);\n        }\n        else\n        {\n            \/\/ Build a new state set\n            $resolved = $ctx->resolve($section->identifier);\n            \n            \/\/ Build state if not empty\n            $state = new State($resolved);\n            \n            \/\/ Do we have an explicit context?\n            if($section->context != NULL)\n                $state->forcedParent = $ctx->resolve($section->context->identifier);\n            \n            \/\/ How about params?\n            if (!empty($section->parameters))\n                $state->params = $this->evaluateParameters($section->parameters, $ctx);\n            \n            \/\/ Normalize resolution\n            $resolved = $this->normalizeResolved($ctx->pushState($state), $resolved, $chunk, $section);\n            \n            \/\/ Do the needful per type\n            switch ($section->type)\n            {\n                case \"#\":\n                    \/\/ Empty means try else\n                    if ($this->isEmpty($resolved))\n                        $chunk = $this->evaluateElseBody($section, $ctx, $chunk);\n                    else if (is_array($resolved) || $resolved instanceof \\Traversable)\n                    {\n                        \/\/ Array means loop\n                        $iterationCount = -1;\n                        foreach ($resolved as $index => $value)\n                            $chunk = $this->evaluateBody($section->body, $ctx->push($value, $index, count($resolved), ++$iterationCount), $chunk);\n                    }\n                    else if ($resolved instanceof Chunk)\n                        $chunk = $resolved;\n                    else\n                    {\n                        \/\/ Otherwise, just do the body\n                        $chunk = $this->evaluateBody($section->body, $ctx->pushState($state), $chunk);\n                    }\n                    break;\n                case \"?\":\n                    \/\/ Only if it exists\n                    if ($this->exists($resolved))\n                        $chunk = $this->evaluateBody($section->body, $ctx, $chunk);\n                    else\n                        $chunk = $this->evaluateElseBody($section, $ctx, $chunk);\n                    break;\n                case \"^\":\n                    \/\/ Only if it doesn't exist\n                    if (!$this->exists($resolved))\n                        $chunk = $this->evaluateBody($section->body, $ctx, $chunk);\n                    else\n                        $chunk = $this->evaluateElseBody($section, $ctx, $chunk);\n                    break;\n                default:\n                    throw new EvaluateException($section, \"Unrecognized type: \" . $section->type);\n            }\n        }\n\n        return $chunk;\n    }\n    \n    \/**\n     * @param \\Dust\\Ast\\Special $spl\n     * @param \\Dust\\Evaluate\\Context $ctx\n     * @param \\Dust\\Evaluate\\Chunk $chunk\n     * @return \\Dust\\Evaluate\\Chunk\n     *\/\n    public function evaluateSpecial(Ast\\Special $spl, Context $ctx, Chunk $chunk): Chunk {\n        switch ($spl->key)\n        {\n            case \"n\":\n                $chunk->write(\"\\n\");\n                break;\n            case \"r\":\n                $chunk->write(\"\\r\");\n                break;\n            case \"lb\":\n                $chunk->write(\"{\");\n                break;\n            case \"rb\":\n                $chunk->write(\"}\");\n                break;\n            case \"s\":\n                $chunk->write(\" \");\n                break;\n            default:\n                throw new EvaluateException($spl, \"Unrecognized special: \" . $spl->key);\n        }\n\n        return $chunk;\n    }\n    \n    \/**\n     * @param $val\n     * @return bool\n     *\/\n    public function exists($val): bool {\n        \/\/ Object exists\n        if (is_object($val))\n            return true;\n        \n        \/\/ Numeric exists\n        if (is_numeric($val))\n            return true;\n        \n        \/\/ Empty string does not exist\n        if (is_string($val))\n            return !empty($val);\n        \n        \/\/ False does not exist\n        if (is_bool($val))\n            return $val;\n        \n        \/\/ Empty arrays do not exist\n        if (is_array($val))\n            return !empty($val);\n        \n\n        \/\/ Nulls do not exist\n        return !is_null($val);\n    }\n    \n    \/**\n     * @param \\Dust\\Evaluate\\Context $ctx\n     * @param \\Dust\\Evaluate\\Chunk $chunk\n     * @param \\Dust\\Ast\\Section $section\n     * @return array\n     *\/\n    public function handleCallback(Context $ctx, $callback, Chunk $chunk, ?Ast\\Section $section = NULL): Chunk {\n        \/\/ Reset \"this\" on closures\n        if ($callback instanceof \\Closure)\n        {\n            \/\/ Find non-closure new \"this\"\n            $newThis = $ctx->head->value;\n            if ($newThis instanceof \\Closure)\n            {\n                \/\/ Forced parent?\n                if ($ctx->head->forcedParent !== NULL)\n                    $newThis = $ctx->head->forcedParent;\n                else if ($ctx->parent !== NULL)\n                    $newThis = $ctx->parent->head->value;\n            }\n            \/\/ Must be non-closure object\n            if (is_object($newThis) && !($newThis instanceof \\Closure))\n                $callback = \\Closure::bind($callback, $newThis);\n        }\n        \n        if (is_object($callback) && method_exists($callback, '__invoke'))\n            $reflected = new \\ReflectionMethod($callback, '__invoke');\n        else\n            $reflected = new \\ReflectionFunction($callback);\n        \n        $paramCount = $reflected->getNumberOfParameters();\n        $args = [];\n        if ($paramCount > 0)\n        {\n            $args[] = $chunk;\n            if ($paramCount > 1)\n            {\n                $args[] = $ctx;\n                if ($paramCount > 2 && $section != NULL)\n                {\n                    $args[] = new Bodies($section);\n                    if ($paramCount > 3)\n                        $args[] = new Parameters($this, $ctx);\n                }\n            }\n        }\n\n        \/\/ Invoke\n        return call_user_func_array($callback, $args);\n    }\n    \n    \/**\n     * @param $val\n     * @return bool\n     *\/\n    public function isEmpty($val): bool {\n        \/\/ Numeric not empty\n        if (is_numeric($val))\n            return false;\n\n        \/\/ Otherwise, normal empty check\n        return empty($val);\n    }\n    \n    \/**\n     * @param \\Dust\\Evaluate\\Context $ctx\n     * @param mixed $resolved\n     * @param \\Dust\\Evaluate\\Chunk $chunk\n     * @param \\Dust\\Evaluate\\Section $section\n     * @return string\n     *\/\n    public function normalizeResolved(Context $ctx, $resolved, Chunk $chunk, ?Ast\\Section $section = NULL) {\n        $handledSpecial = true;\n        while ($handledSpecial)\n        {\n            if (is_callable($resolved) && !is_string($resolved))\n                $resolved = $this->handleCallback($ctx, $resolved, $chunk, $section);\n            else if ($resolved instanceof Ast\\Inline)\n            {\n                \/\/ Resolve full inline parameter\n                $newChunk = $chunk->newChild();\n                foreach ($resolved->parts as $value)\n                {\n                    if ($value instanceof Ast\\Reference)\n                        $newChunk = $this->evaluateReference($value, $ctx, $newChunk);\n                    else if ($value instanceof Ast\\Special)\n                        $newChunk = $this->evaluateSpecial($value, $ctx, $newChunk);\n                    else\n                        $newChunk->write((string)$value);\n                }\n                \n                $resolved = $newChunk->getOut();\n                break;\n            }\n            else\n                $handledSpecial = false;\n        }\n\n        return $resolved;\n    }\n\n    \/**\n     * @param $val\n     * @return bool\n     *\/\n    public function toDustString($val): string {\n        if (is_bool($val))\n            return $val ? \"true\" : \"false\";\n        \n        if (is_array($val))\n            return implode(\",\", $val);\n        \n        if (is_object($val) && !method_exists($val, \"__toString\"))\n            return get_class($val);\n\n        return (string) $val;\n    }\n}<commit_msg>Unable to find helper - gives more information to improve debugging<commit_after><?hh \/\/ strict\n\nnamespace Dust\\Evaluate;\n\nuse Dust\\Ast;\nuse Dust\\Dust;\nuse Dust\\Filter;\n\nclass Evaluator\n{\n    \/**\n     * @var \\Dust\\Dust\n     *\/\n    public Dust $dust;\n    \n    \/**\n     * @var \\Dust\\Evaluate\\EvaluatorOptions\n     *\/\n    public EvaluatorOptions $options;\n\n    \/**\n     * @param \\Dust\\Dust $dust\n     * @param \\Dust\\Evaluate\\EvaluatorOptions $options\n     *\/\n    public function __construct(Dust $dust, ?EvaluatorOptions $options = NULL): void {\n        $this->dust = $dust;\n        $this->options = ($options !== NULL) ? $options : new EvaluatorOptions;\n    }\n\n    \/**\n     * @param \\Dust\\Ast\\Ast $ast\n     * @param string $message\n     * @throws \\Dust\\Evaluate\\EvaluateException\n     *\/\n    public function error(?Ast\\Ast $ast = NULL, ?string $message = NULL): void {\n        throw new EvaluateException($ast, $message);\n    }\n\n    \/**\n     * @param \\Dust\\Ast\\Body $source\n     * @param $state\n     * @return\n     *\/\n    public function evaluate(Ast\\Body $source, $state) {\n        return trim($this->evaluateBody($source, new Context($this, NULL, new State($state)), new Chunk($this))->getOut());\n    }\n\n    \/**\n     * @param \\Dust\\Ast\\Body $body\n     * @param \\Dust\\Evaluate\\Context $ctx\n     * @param \\Dust\\Evaluate\\Chunk $chunk\n     * @return \\Dust\\Evaluate\\Chunk\n     *\/\n    public function evaluateBody(Ast\\Body $body, Context $ctx, Chunk $chunk): Chunk {\n        \/\/ Go ahead and set the file path on the current context\n        if ($body->filePath !== NULL)\n            $ctx->currentFilePath = $body->filePath;\n        \n        foreach ($body->parts as $part)\n        {\n            if ($part instanceof Ast\\Comment) {}\n            else if ($part instanceof Ast\\Section)\n                $chunk = $this->evaluateSection($part, $ctx, $chunk);\n            else if ($part instanceof Ast\\Partial)\n                $chunk = $this->evaluatePartial($part, $ctx, $chunk);\n            else if ($part instanceof Ast\\Special)\n                $chunk = $this->evaluateSpecial($part, $ctx, $chunk);\n            else if ($part instanceof Ast\\Reference)\n                $chunk = $this->evaluateReference($part, $ctx, $chunk);\n            else if ($part instanceof Ast\\Buffer)\n                $chunk = $this->evaluateBuffer($part, $ctx, $chunk);\n        }\n\n        return $chunk;\n    }\n    \n    \/**\n     * @param \\Dust\\Ast\\Buffer $buffer\n     * @param \\Dust\\Evaluate\\Context $ctx\n     * @param \\Dust\\Evaluate\\Chunk $chunk\n     * @return \\Dust\\Evaluate\\Chunk\n     *\/\n    public function evaluateBuffer(Ast\\Buffer $buffer, Context $ctx, Chunk $chunk): Chunk {\n        $chunk->write($buffer->contents);\n        return $chunk;\n    }\n    \n    \/**\n     * @param \\Dust\\Ast\\Section $section\n     * @param \\Dust\\Evaluate\\Context $ctx\n     * @param \\Dust\\Evaluate\\Chunk $chunk\n     * @return \\Dust\\Evaluate\\Chunk\n     *\/\n    public function evaluateElseBody(Ast\\Section $section, Context $ctx, Chunk $chunk): Chunk {\n        if ($section->bodies != NULL && count($section->bodies) > 0)\n        {\n            foreach ($section->bodies as $value)\n            {\n                if ($value->key == \"else\")\n                    $chunk = $this->evaluateBody($value->body, $ctx, $chunk);\n            }\n        }\n\n        return $chunk;\n    }\n    \n    \/**\n     * @param array $params\n     * @param \\Dust\\Evaluate\\Context $ctx\n     * @return array\n     *\/\n    public function evaluateParameters(array $params, Context $ctx): array {\n        $ret = [];\n        \n        foreach ($params as $value)\n        {\n            if ($value instanceof Ast\\NumericParameter)\n            {\n                if(strpos($value->value, '.') === false)\n                    $ret[$value->key] = intval($value->value);\n                else\n                    $ret[$value->key] = floatval($value->value);\n            }\n            else if ($value instanceof Ast\\IdentifierParameter)\n                $ret[$value->key] = $ctx->resolve($value->value);\n            else\n            {\n                \/\/ We just set this as the actual AST since it is resolved where it's emitted\n                $ret[$value->key] = $value->value;\n            }\n        }\n\n        return $ret;\n    }\n    \n    \/**\n     * @param \\Dust\\Ast\\Partial $partial\n     * @param \\Dust\\Evaluate\\Context $ctx\n     * @param \\Dust\\Evaluate\\Chunk $chunk\n     * @return \\Dust\\Evaluate\\Chunk\n     *\/\n    public function evaluatePartial(Ast\\Partial $partial, Context $ctx, Chunk $chunk): Chunk {\n        $partialName = $partial->key;\n        \n        if ($partialName == NULL) $partialName = $this->toDustString($this->normalizeResolved($ctx, $partial->inline, $chunk));\n        if ($partialName == NULL) return $chunk;\n        \n        \/\/ Is a named block\n        if ($partial->type == \"+\")\n        {\n            \/\/ Mark beginning\n            $chunk->markNamedBlockBegin($partialName);\n            \/\/ Go ahead and try to replace\n            $chunk->replaceNamedBlock($partialName);\n\n            return $chunk;\n        }\n        \n        \/\/ Otherwise, we're > ; get base directory\n        $basePath = $ctx->currentFilePath;\n        if ($basePath != NULL)\n            $basePath = dirname($basePath);\n        \n        \/\/ Load partial\n        $partialBody = $this->dust->loadTemplate($partialName, $basePath);\n        if ($partialBody == NULL)\n            return $chunk;\n        \n        \/\/ Null main state\n        $state = new State(NULL);\n        \/\/ Partial context?\n        if ($partial->context != NULL)\n            $state->forcedParent = $ctx->resolve($partial->context->identifier);\n        \n        \/\/ Params?\n        if (!empty($partial->parameters))\n            $state->params = $this->evaluateParameters($partial->parameters, $ctx);\n\n        \/\/ Render the partial then\n        return $this->evaluateBody($partialBody, $ctx->pushState($state), $chunk);\n    }\n    \n    \/**\n     * @param \\Dust\\Ast\\Reference $ref\n     * @param \\Dust\\Evaluate\\Context $ctx\n     * @param \\Dust\\Evaluate\\Chunk $chunk\n     * @return \\Dust\\Evaluate\\Chunk\n     *\/\n    public function evaluateReference(Ast\\Reference $ref, Context $ctx, Chunk $chunk): Chunk {\n        \/\/ Resolve\n        $resolved = $this->normalizeResolved($ctx, $ctx->resolve($ref->identifier), $chunk);\n\n        if (!$this->isEmpty($resolved))\n        {\n            if ($resolved instanceof Chunk)\n                return $resolved;\n            \n            \/\/ Make the string\n            if (empty($ref->filters))\n            {\n                \/\/ Fefault filters\n                $resolved = array_reduce($this->dust->automaticFilters, function ($prev, Filter\\Filter $filter) {\n                    return $filter->apply($prev);\n                }, $resolved);\n            }\n            else\n            {\n                \/\/ Apply filters in order...\n                $resolved = array_reduce($ref->filters, function ($prev, Ast\\Filter $curr)\n                {\n                    if (array_key_exists($curr->key, $this->dust->filters))\n                    {\n                        $filter = $this->dust->filters[$curr->key];\n                        return $filter->apply($prev);\n                    }\n                    else\n                        return $prev;\n                }, $resolved);\n            }\n            $chunk->write($this->toDustString($resolved));\n        }\n\n        return $chunk;\n    }\n    \n    \/**\n     * @param \\Dust\\Ast\\Section $section\n     * @param \\Dust\\Evaluate\\Context $ctx\n     * @param \\Dust\\Evaluate\\Chunk $chunk\n     * @return \\Dust\\Evaluate\\Chunk\n     *\/\n    public function evaluateSection(Ast\\Section $section, Context $ctx, Chunk $chunk): Chunk {\n        \/\/ Stuff that doesn't need resolution\n        if ($section->type == \"+\")\n        {\n            if($section->identifier->key == NULL)\n                $this->error($section->identifier, \"Evaluated identifier for partial not supported\");\n            \n            \/\/ Mark beginning\n            $block = $chunk->markNamedBlockBegin($section->identifier->key);\n            \/\/ Render default contents\n            if ($section->body != NULL)\n            {\n                $chunk = $this->evaluateBody($section->body, $ctx, $chunk);\n                \/\/ Mark ending\n                $chunk->markNamedBlockEnd($block);\n            }\n            \/\/ Go ahead and try to replace\n            $chunk->replaceNamedBlock($section->identifier->key);\n        }\n        else if ($section->type == \"<\")\n        {\n            if ($section->identifier->key == NULL)\n                $this->error($section->identifier, \"Evaluated identifier for partial not supported\");\n            \n            $chunk->setAndReplaceNamedBlock($section, $ctx);\n        }\n        else if ($section->type == \"@\")\n        {\n            if ($section->identifier->key == NULL)\n                $this->error($section->identifier, \"Evaluated identifier for helper not supported\");\n            \n            \/\/ Do we have the helper?\n            if(!isset($this->dust->helpers[$section->identifier->key]))\n                $this->error($section->identifier, \"Unable to find helper: \" . $section->identifier->key);\n            \n            $helper = $this->dust->helpers[$section->identifier->key];\n            \n            \/\/ Build state w\/ no current value\n            $state = new State(NULL);\n            \n            \/\/ Do we have an explicit context?\n            if ($section->context != NULL)\n                $state->forcedParent = $ctx->resolve($section->context->identifier);\n            \n            \/\/ How about params?\n            if (!empty($section->parameters))\n                $state->params = $this->evaluateParameters($section->parameters, $ctx);\n            \n            \/\/ Now run the helper\n            $chunk = $this->handleCallback($ctx->pushState($state), $helper, $chunk, $section);\n        }\n        else\n        {\n            \/\/ Build a new state set\n            $resolved = $ctx->resolve($section->identifier);\n            \n            \/\/ Build state if not empty\n            $state = new State($resolved);\n            \n            \/\/ Do we have an explicit context?\n            if($section->context != NULL)\n                $state->forcedParent = $ctx->resolve($section->context->identifier);\n            \n            \/\/ How about params?\n            if (!empty($section->parameters))\n                $state->params = $this->evaluateParameters($section->parameters, $ctx);\n            \n            \/\/ Normalize resolution\n            $resolved = $this->normalizeResolved($ctx->pushState($state), $resolved, $chunk, $section);\n            \n            \/\/ Do the needful per type\n            switch ($section->type)\n            {\n                case \"#\":\n                    \/\/ Empty means try else\n                    if ($this->isEmpty($resolved))\n                        $chunk = $this->evaluateElseBody($section, $ctx, $chunk);\n                    else if (is_array($resolved) || $resolved instanceof \\Traversable)\n                    {\n                        \/\/ Array means loop\n                        $iterationCount = -1;\n                        foreach ($resolved as $index => $value)\n                            $chunk = $this->evaluateBody($section->body, $ctx->push($value, $index, count($resolved), ++$iterationCount), $chunk);\n                    }\n                    else if ($resolved instanceof Chunk)\n                        $chunk = $resolved;\n                    else\n                    {\n                        \/\/ Otherwise, just do the body\n                        $chunk = $this->evaluateBody($section->body, $ctx->pushState($state), $chunk);\n                    }\n                    break;\n                case \"?\":\n                    \/\/ Only if it exists\n                    if ($this->exists($resolved))\n                        $chunk = $this->evaluateBody($section->body, $ctx, $chunk);\n                    else\n                        $chunk = $this->evaluateElseBody($section, $ctx, $chunk);\n                    break;\n                case \"^\":\n                    \/\/ Only if it doesn't exist\n                    if (!$this->exists($resolved))\n                        $chunk = $this->evaluateBody($section->body, $ctx, $chunk);\n                    else\n                        $chunk = $this->evaluateElseBody($section, $ctx, $chunk);\n                    break;\n                default:\n                    throw new EvaluateException($section, \"Unrecognized type: \" . $section->type);\n            }\n        }\n\n        return $chunk;\n    }\n    \n    \/**\n     * @param \\Dust\\Ast\\Special $spl\n     * @param \\Dust\\Evaluate\\Context $ctx\n     * @param \\Dust\\Evaluate\\Chunk $chunk\n     * @return \\Dust\\Evaluate\\Chunk\n     *\/\n    public function evaluateSpecial(Ast\\Special $spl, Context $ctx, Chunk $chunk): Chunk {\n        switch ($spl->key)\n        {\n            case \"n\":\n                $chunk->write(\"\\n\");\n                break;\n            case \"r\":\n                $chunk->write(\"\\r\");\n                break;\n            case \"lb\":\n                $chunk->write(\"{\");\n                break;\n            case \"rb\":\n                $chunk->write(\"}\");\n                break;\n            case \"s\":\n                $chunk->write(\" \");\n                break;\n            default:\n                throw new EvaluateException($spl, \"Unrecognized special: \" . $spl->key);\n        }\n\n        return $chunk;\n    }\n    \n    \/**\n     * @param $val\n     * @return bool\n     *\/\n    public function exists($val): bool {\n        \/\/ Object exists\n        if (is_object($val))\n            return true;\n        \n        \/\/ Numeric exists\n        if (is_numeric($val))\n            return true;\n        \n        \/\/ Empty string does not exist\n        if (is_string($val))\n            return !empty($val);\n        \n        \/\/ False does not exist\n        if (is_bool($val))\n            return $val;\n        \n        \/\/ Empty arrays do not exist\n        if (is_array($val))\n            return !empty($val);\n        \n\n        \/\/ Nulls do not exist\n        return !is_null($val);\n    }\n    \n    \/**\n     * @param \\Dust\\Evaluate\\Context $ctx\n     * @param \\Dust\\Evaluate\\Chunk $chunk\n     * @param \\Dust\\Ast\\Section $section\n     * @return array\n     *\/\n    public function handleCallback(Context $ctx, $callback, Chunk $chunk, ?Ast\\Section $section = NULL): Chunk {\n        \/\/ Reset \"this\" on closures\n        if ($callback instanceof \\Closure)\n        {\n            \/\/ Find non-closure new \"this\"\n            $newThis = $ctx->head->value;\n            if ($newThis instanceof \\Closure)\n            {\n                \/\/ Forced parent?\n                if ($ctx->head->forcedParent !== NULL)\n                    $newThis = $ctx->head->forcedParent;\n                else if ($ctx->parent !== NULL)\n                    $newThis = $ctx->parent->head->value;\n            }\n            \/\/ Must be non-closure object\n            if (is_object($newThis) && !($newThis instanceof \\Closure))\n                $callback = \\Closure::bind($callback, $newThis);\n        }\n        \n        if (is_object($callback) && method_exists($callback, '__invoke'))\n            $reflected = new \\ReflectionMethod($callback, '__invoke');\n        else\n            $reflected = new \\ReflectionFunction($callback);\n        \n        $paramCount = $reflected->getNumberOfParameters();\n        $args = [];\n        if ($paramCount > 0)\n        {\n            $args[] = $chunk;\n            if ($paramCount > 1)\n            {\n                $args[] = $ctx;\n                if ($paramCount > 2 && $section != NULL)\n                {\n                    $args[] = new Bodies($section);\n                    if ($paramCount > 3)\n                        $args[] = new Parameters($this, $ctx);\n                }\n            }\n        }\n\n        \/\/ Invoke\n        return call_user_func_array($callback, $args);\n    }\n    \n    \/**\n     * @param $val\n     * @return bool\n     *\/\n    public function isEmpty($val): bool {\n        \/\/ Numeric not empty\n        if (is_numeric($val))\n            return false;\n\n        \/\/ Otherwise, normal empty check\n        return empty($val);\n    }\n    \n    \/**\n     * @param \\Dust\\Evaluate\\Context $ctx\n     * @param mixed $resolved\n     * @param \\Dust\\Evaluate\\Chunk $chunk\n     * @param \\Dust\\Evaluate\\Section $section\n     * @return string\n     *\/\n    public function normalizeResolved(Context $ctx, $resolved, Chunk $chunk, ?Ast\\Section $section = NULL) {\n        $handledSpecial = true;\n        while ($handledSpecial)\n        {\n            if (is_callable($resolved) && !is_string($resolved))\n                $resolved = $this->handleCallback($ctx, $resolved, $chunk, $section);\n            else if ($resolved instanceof Ast\\Inline)\n            {\n                \/\/ Resolve full inline parameter\n                $newChunk = $chunk->newChild();\n                foreach ($resolved->parts as $value)\n                {\n                    if ($value instanceof Ast\\Reference)\n                        $newChunk = $this->evaluateReference($value, $ctx, $newChunk);\n                    else if ($value instanceof Ast\\Special)\n                        $newChunk = $this->evaluateSpecial($value, $ctx, $newChunk);\n                    else\n                        $newChunk->write((string)$value);\n                }\n                \n                $resolved = $newChunk->getOut();\n                break;\n            }\n            else\n                $handledSpecial = false;\n        }\n\n        return $resolved;\n    }\n\n    \/**\n     * @param $val\n     * @return bool\n     *\/\n    public function toDustString($val): string {\n        if (is_bool($val))\n            return $val ? \"true\" : \"false\";\n        \n        if (is_array($val))\n            return implode(\",\", $val);\n        \n        if (is_object($val) && !method_exists($val, \"__toString\"))\n            return get_class($val);\n\n        return (string) $val;\n    }\n}<|endoftext|>"}
{"text":"<commit_before><commit_msg>Planning: add naive calculation to s, a and da to inference result<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"lax_p2p_sync_client.h\"\n#include \"simulator.h\"\n#include \"tile_manager.h\"\n#include \"config.h\"\n#include \"packetize.h\"\n#include \"network.h\"\n#include \"core.h\"\n#include \"core_model.h\"\n#include \"log.h\"\n\nUInt64 LaxP2PSyncClient::MAX_TIME = ((UInt64) 1) << 60;\n\nLaxP2PSyncClient::LaxP2PSyncClient(Core* core):\n   _core(core),\n   _last_sync_time(0),\n   _quantum(0),\n   _slack(0),\n   _sleep_fraction(0.0)\n{\n   LOG_ASSERT_ERROR(Sim()->getConfig()->getApplicationTiles() >= 3, \n         \"Number of Cores must be >= 3 if 'random_pairs' scheme is used\");\n\n   try\n   {\n      _slack = (UInt64) Sim()->getCfg()->getInt(\"clock_skew_minimization\/lax_p2p\/slack\");\n      _quantum = (UInt64) Sim()->getCfg()->getInt(\"clock_skew_minimization\/lax_p2p\/quantum\");\n      _sleep_fraction = Sim()->getCfg()->getFloat(\"clock_skew_minimization\/lax_p2p\/sleep_fraction\");\n   }\n   catch(...)\n   {\n      LOG_PRINT_ERROR(\"Could not read clock_skew_minimization\/random_pairs variables from config file\");\n   }\n\n   gettimeofday(&_start_wall_clock_time, NULL);\n   _rand_num.seed(1);\n\n   \/\/ Register Call-back\n   _core->getTile()->getNetwork()->registerCallback(CLOCK_SKEW_MINIMIZATION, ClockSkewMinimizationClientNetworkCallback, this);\n}\n\nLaxP2PSyncClient::~LaxP2PSyncClient()\n{\n   _core->getTile()->getNetwork()->unregisterCallback(CLOCK_SKEW_MINIMIZATION);\n}\n\nvoid \nLaxP2PSyncClient::enable()\n{\n   _enabled = true;\n  \n   assert(_last_sync_time == 0); \n   gettimeofday(&_start_wall_clock_time, NULL);\n   assert(_msg_queue.empty());\n}\n\nvoid\nLaxP2PSyncClient::disable()\n{\n   _enabled = false;\n}\n\n\/\/ Called by network thread\nvoid\nLaxP2PSyncClient::netProcessSyncMsg(const NetPacket& recv_pkt)\n{\n   UInt32 msg_type;\n   UInt64 time;\n\n   UnstructuredBuffer recv_buf;\n   recv_buf << make_pair(recv_pkt.data, recv_pkt.length);\n   \n   recv_buf >> msg_type >> time;\n   SyncMsg sync_msg(recv_pkt.sender, (SyncMsg::MsgType) msg_type, time);\n\n   LOG_PRINT(\"Core(%i,%i), SyncMsg[sender(%i), type(%u), time(%llu)]\",\n         _core->getTile()->getId(), sync_msg.sender.tile_id, sync_msg.sender.core_type, sync_msg.type, sync_msg.time);\n\n   LOG_ASSERT_ERROR(time < MAX_TIME, \n         \"SyncMsg[sender(%i, %i), msg_type(%u), time(%llu)]\",\n         recv_pkt.sender.tile_id, recv_pkt.sender.core_type, msg_type, time);\n\n   _lock.acquire();\n\n   \/\/ SyncMsg\n   \/\/  - sender\n   \/\/  - type (REQ,ACK,WAIT)\n   \/\/  - time\n   \/\/ Called by the Network thread\n   Core::State core_state = _core->getState();\n   if (core_state == Core::RUNNING)\n   {\n      \/\/ Thread is RUNNING on tile\n      \/\/ Network thread must process the random sync requests\n      if (sync_msg.type == SyncMsg::REQ)\n      {\n         \/\/ This may generate some WAIT messages\n         processSyncReq(sync_msg, false);\n      }\n      else if (sync_msg.type == SyncMsg::ACK)\n      {\n         \/\/ sync_msg.type == SyncMsg::ACK with '0' or non-zero wait time\n         _msg_queue.push_back(sync_msg);\n         _cond.signal();\n      }\n      else\n      {\n         LOG_PRINT_ERROR(\"Unrecognized Sync Msg, type(%u) from(%i)\", sync_msg.type, sync_msg.sender);\n      }\n   }\n   else if (core_state == Core::SLEEPING)\n   {\n      LOG_ASSERT_ERROR(sync_msg.type == SyncMsg::REQ,\n            \"sync_msg.type(%u)\", sync_msg.type);\n      \n      processSyncReq(sync_msg, true);\n   }\n   else\n   {\n      \/\/ I dont want to synchronize against a non-running tile\n      LOG_ASSERT_ERROR(sync_msg.type == SyncMsg::REQ,\n            \"sync_msg.type(%u)\", sync_msg.type);\n\n      LOG_PRINT(\"Tile(%i) not RUNNING: Sending ACK\", _core->getTile()->getId());\n\n      UnstructuredBuffer send_buf;\n      send_buf << (UInt32) SyncMsg::ACK << (UInt64) 0;\n      _core->getTile()->getNetwork()->netSend(sync_msg.sender, CLOCK_SKEW_MINIMIZATION, send_buf.getBuffer(), send_buf.size());\n   }\n\n   _lock.release();\n}\n\nvoid\nLaxP2PSyncClient::processSyncReq(const SyncMsg& sync_msg, bool sleeping)\n{\n   assert(sync_msg.time >= _slack);\n\n   \/\/ I dont want to lock this, so I just try to read the cycle count\n   \/\/ Even if this is an approximate value, this is OK\n   \n   \/\/ Tile Clock to Global clock conversion\n   UInt64 curr_time = _core->getModel()->getCurrTime().toNanosec();\n\n   LOG_ASSERT_ERROR(curr_time < MAX_TIME, \"curr_time(%llu)\", curr_time);\n\n   LOG_PRINT(\"Core(%i, %i): Time(%llu), SyncReq[sender(%i), msg_type(%u), time(%llu)]\", \n      _core->getId().tile_id, _core->getId().core_type, curr_time, sync_msg.sender, sync_msg.type, sync_msg.time);\n\n   \/\/ 3 possible scenarios\n   if (curr_time > (sync_msg.time + _slack))\n   {\n      \/\/ Wait till the other tile reaches this one\n      UnstructuredBuffer send_buf;\n      send_buf << (UInt32) SyncMsg::ACK << (UInt64) 0;\n      _core->getTile()->getNetwork()->netSend(sync_msg.sender, CLOCK_SKEW_MINIMIZATION, send_buf.getBuffer(), send_buf.size());\n\n      if (!sleeping)\n      {\n         \/\/ Goto sleep for a few microseconds\n         \/\/ Self generate a WAIT msg\n         LOG_PRINT(\"Core(%i, %i): WAIT: Time(%llu)\", _core->getId().tile_id, _core->getId().core_type, curr_time - sync_msg.time);\n         LOG_ASSERT_ERROR((curr_time - sync_msg.time) < MAX_TIME,\n               \"[>]: curr_time(%llu), sync_msg[sender(%i, %i), msg_type(%u), time(%llu)]\", \n               curr_time, sync_msg.sender.tile_id, sync_msg.sender.core_type, sync_msg.type, sync_msg.time);\n\n         SyncMsg wait_msg(_core->getId(), SyncMsg::WAIT, curr_time - sync_msg.time);\n         _msg_queue.push_back(wait_msg);\n      }\n   }\n   else if ((curr_time <= (sync_msg.time + _slack)) && (curr_time >= (sync_msg.time - _slack)))\n   {\n      \/\/ Both the cores are in sync (Good)\n      UnstructuredBuffer send_buf;\n      send_buf << (UInt32) SyncMsg::ACK << (UInt64) 0;\n      _core->getTile()->getNetwork()->netSend(sync_msg.sender, CLOCK_SKEW_MINIMIZATION, send_buf.getBuffer(), send_buf.size());\n   }\n   else if (curr_time < (sync_msg.time - _slack))\n   {\n      LOG_ASSERT_ERROR((sync_msg.time - curr_time) < MAX_TIME,\n            \"[<]: curr_time(%llu), sync_msg[sender(%i), msg_type(%u), time(%llu)]\",\n            curr_time, sync_msg.sender, sync_msg.type, sync_msg.time);\n\n      \/\/ Double up and catch up. Meanwhile, ask the other tile to wait\n      UnstructuredBuffer send_buf;\n      send_buf << (UInt32) SyncMsg::ACK << (UInt64) (sync_msg.time - curr_time);\n      _core->getTile()->getNetwork()->netSend(sync_msg.sender, CLOCK_SKEW_MINIMIZATION, send_buf.getBuffer(), send_buf.size());\n   }\n   else\n   {\n      LOG_PRINT_ERROR(\"Strange cycle counts: curr_time(%llu), sender(%i), sender_time(%llu)\",\n            curr_time, sync_msg.sender, sync_msg.time);\n   }\n}\n\n\/\/ Called by user thread\nvoid\nLaxP2PSyncClient::synchronize(Time time)\n{\n   LOG_ASSERT_ERROR(time == 0, \"tiem(%llu), Cannot be used\", time.toNanosec());\n\n   if (! _enabled)\n      return;\n\n   if (_core->getState() == Core::WAKING_UP)\n      _core->setState(Core::RUNNING);\n\n   UInt64 curr_time = _core->getModel()->getCurrTime().toNanosec();\n\n   assert(curr_time >= _last_sync_time);\n\n   LOG_ASSERT_ERROR(curr_time < MAX_TIME, \"curr_time(%llu)\", curr_time);\n\n   if ((curr_time - _last_sync_time) >= _quantum)\n   {\n      LOG_PRINT(\"Tile(%i): Starting Synchronization: curr_time(%llu), _last_sync_time(%llu)\",\n            _core->getTile()->getId(), curr_time, _last_sync_time);\n\n      _lock.acquire();\n\n      _last_sync_time = (curr_time \/ _quantum) * _quantum;\n\n      LOG_ASSERT_ERROR(_last_sync_time < MAX_TIME,\n            \"_last_sync_time(%llu)\", _last_sync_time);\n\n      \/\/ Send SyncMsg to another tile\n      sendRandomSyncMsg(curr_time);\n\n      \/\/ Wait for Acknowledgement and other Wait messages\n      _cond.wait(_lock);\n\n      UInt64 wait_time = userProcessSyncMsgList();\n\n      LOG_PRINT(\"Wait Time (%llu)\", wait_time);\n\n      gotoSleep(wait_time);\n      \n      _lock.release();\n\n   }\n}\n\nvoid\nLaxP2PSyncClient::sendRandomSyncMsg(UInt64 curr_time)\n{\n   LOG_ASSERT_ERROR(curr_time < MAX_TIME, \"curr_time(%llu)\", curr_time);\n\n   UInt32 num_app_cores = Config::getSingleton()->getApplicationTiles();\n   SInt32 offset = 1 + (SInt32) _rand_num.next((Random::value_t) ((num_app_cores - 1) \/ 2));\n   tile_id_t receiver = (_core->getTile()->getId() + offset) % num_app_cores;\n\n   LOG_ASSERT_ERROR((receiver >= 0) && (receiver < (tile_id_t) num_app_cores), \n         \"receiver(%i)\", receiver);\n\n   LOG_PRINT(\"Tile(%i) Sending SyncReq to %i, curr_time(%llu)\", _core->getTile()->getId(), receiver, curr_time);\n\n   UnstructuredBuffer send_buf;\n   send_buf << (UInt32) SyncMsg::REQ << curr_time;\n\n   _core->getTile()->getNetwork()->netSend(Tile::getMainCoreId(receiver), CLOCK_SKEW_MINIMIZATION, send_buf.getBuffer(), send_buf.size());\n}\n\nUInt64\nLaxP2PSyncClient::userProcessSyncMsgList()\n{\n   bool ack_present = false;\n   UInt64 max_wait_time = 0;\n\n   std::list<SyncMsg>::iterator it;\n   for (it = _msg_queue.begin(); it != _msg_queue.end(); it++)\n   {\n      LOG_PRINT(\"Tile(%i) Process Sync Msg List: SyncMsg[sender(%i), type(%u), wait_time(%llu)]\", \n            _core->getTile()->getId(), (*it).sender, (*it).type, (*it).time);\n      \n      LOG_ASSERT_ERROR((*it).time < MAX_TIME,\n            \"sync_msg[sender(%i), msg_type(%u), time(%llu)]\",\n            (*it).sender, (*it).type, (*it).time);\n\n      assert(((*it).type == SyncMsg::WAIT) || ((*it).type == SyncMsg::ACK));\n\n      if ((*it).time >= max_wait_time)\n         max_wait_time = (*it).time;\n      if ((*it).type == SyncMsg::ACK)\n         ack_present = true;\n   }\n   \n   assert(ack_present);\n   _msg_queue.clear();\n\n   return max_wait_time;\n}\n\nvoid\nLaxP2PSyncClient::gotoSleep(const UInt64 sleep_time)\n{\n   LOG_ASSERT_ERROR(sleep_time < MAX_TIME, \"sleep_time(%llu)\", sleep_time);\n\n   if (sleep_time > 0)\n   {\n      LOG_PRINT(\"Tile(%i) going to sleep\", _core->getTile()->getId());\n\n      \/\/ Set the CoreState to 'SLEEPING'\n      _core->setState(Core::SLEEPING);\n\n      UInt64 elapsed_simulated_time = _core->getModel()->getCurrTime().toNanosec();\n\n      UInt64 elapsed_wall_clock_time = getElapsedWallClockTime();\n\n      \/\/ elapsed_simulated_time, sleep_time - in cycles (of target architecture)\n      \/\/ elapsed_wall_clock_time - in microseconds\n      assert(elapsed_simulated_time != 0);\n\n      float wall_clock_time_per_simulated_cycle = float(elapsed_wall_clock_time) \/ elapsed_simulated_time;\n      useconds_t sleep_wall_clock_time = (useconds_t) (_sleep_fraction * wall_clock_time_per_simulated_cycle * sleep_time);\n      if (sleep_wall_clock_time > 1000000)\n      {\n         \/\/ LOG_PRINT_WARNING(\"Large Sleep Time(%u microseconds), SimSleep Time(%llu), elapsed_wall_clock_time(%llu), elapsed_simulated_time(%llu)\", sleep_wall_clock_time, sleep_time, elapsed_wall_clock_time, elapsed_simulated_time);\n         sleep_wall_clock_time = 1000000;\n      }\n     \n      _lock.release();\n\n      assert(usleep(sleep_wall_clock_time) == 0);\n\n      _lock.acquire();\n\n      \/\/ Set the CoreState to 'RUNNING'\n      _core->setState(Core::RUNNING);\n      \n      LOG_PRINT(\"Tile(%i) woken up\", _core->getTile()->getId());\n   }\n}\n\nUInt64\nLaxP2PSyncClient::getElapsedWallClockTime()\n{\n   \/\/ Returns the elapsed time in microseconds\n   struct timeval curr_wall_clock_time;\n   gettimeofday(&curr_wall_clock_time, NULL);\n\n   if (curr_wall_clock_time.tv_usec < _start_wall_clock_time.tv_usec)\n   {\n      curr_wall_clock_time.tv_usec += 1000000;\n      curr_wall_clock_time.tv_sec -= 1;\n   }\n   return ( ((UInt64) (curr_wall_clock_time.tv_sec - _start_wall_clock_time.tv_sec)) * 1000000 +\n      (UInt64) (curr_wall_clock_time.tv_usec - _start_wall_clock_time.tv_usec));\n}\n<commit_msg>[lax_p2p] Used lax_p2p instead of random_pairs in the sync client<commit_after>#include \"lax_p2p_sync_client.h\"\n#include \"simulator.h\"\n#include \"tile_manager.h\"\n#include \"config.h\"\n#include \"packetize.h\"\n#include \"network.h\"\n#include \"core.h\"\n#include \"core_model.h\"\n#include \"log.h\"\n\nUInt64 LaxP2PSyncClient::MAX_TIME = ((UInt64) 1) << 60;\n\nLaxP2PSyncClient::LaxP2PSyncClient(Core* core):\n   _core(core),\n   _last_sync_time(0),\n   _quantum(0),\n   _slack(0),\n   _sleep_fraction(0.0)\n{\n   LOG_ASSERT_ERROR(Sim()->getConfig()->getApplicationTiles() >= 3, \n         \"Number of Cores must be >= 3 if 'lax_p2p' scheme is used\");\n\n   try\n   {\n      _slack = (UInt64) Sim()->getCfg()->getInt(\"clock_skew_minimization\/lax_p2p\/slack\");\n      _quantum = (UInt64) Sim()->getCfg()->getInt(\"clock_skew_minimization\/lax_p2p\/quantum\");\n      _sleep_fraction = Sim()->getCfg()->getFloat(\"clock_skew_minimization\/lax_p2p\/sleep_fraction\");\n   }\n   catch(...)\n   {\n      LOG_PRINT_ERROR(\"Could not read clock_skew_minimization\/lax_p2p parameters from config file\");\n   }\n\n   gettimeofday(&_start_wall_clock_time, NULL);\n   _rand_num.seed(1);\n\n   \/\/ Register Call-back\n   _core->getTile()->getNetwork()->registerCallback(CLOCK_SKEW_MINIMIZATION, ClockSkewMinimizationClientNetworkCallback, this);\n}\n\nLaxP2PSyncClient::~LaxP2PSyncClient()\n{\n   _core->getTile()->getNetwork()->unregisterCallback(CLOCK_SKEW_MINIMIZATION);\n}\n\nvoid \nLaxP2PSyncClient::enable()\n{\n   _enabled = true;\n  \n   assert(_last_sync_time == 0); \n   gettimeofday(&_start_wall_clock_time, NULL);\n   assert(_msg_queue.empty());\n}\n\nvoid\nLaxP2PSyncClient::disable()\n{\n   _enabled = false;\n}\n\n\/\/ Called by network thread\nvoid\nLaxP2PSyncClient::netProcessSyncMsg(const NetPacket& recv_pkt)\n{\n   UInt32 msg_type;\n   UInt64 time;\n\n   UnstructuredBuffer recv_buf;\n   recv_buf << make_pair(recv_pkt.data, recv_pkt.length);\n   \n   recv_buf >> msg_type >> time;\n   SyncMsg sync_msg(recv_pkt.sender, (SyncMsg::MsgType) msg_type, time);\n\n   LOG_PRINT(\"Core(%i,%i), SyncMsg[sender(%i), type(%u), time(%llu)]\",\n         _core->getTile()->getId(), sync_msg.sender.tile_id, sync_msg.sender.core_type, sync_msg.type, sync_msg.time);\n\n   LOG_ASSERT_ERROR(time < MAX_TIME, \n         \"SyncMsg[sender(%i, %i), msg_type(%u), time(%llu)]\",\n         recv_pkt.sender.tile_id, recv_pkt.sender.core_type, msg_type, time);\n\n   _lock.acquire();\n\n   \/\/ SyncMsg\n   \/\/  - sender\n   \/\/  - type (REQ,ACK,WAIT)\n   \/\/  - time\n   \/\/ Called by the Network thread\n   Core::State core_state = _core->getState();\n   if (core_state == Core::RUNNING)\n   {\n      \/\/ Thread is RUNNING on tile\n      \/\/ Network thread must process the random sync requests\n      if (sync_msg.type == SyncMsg::REQ)\n      {\n         \/\/ This may generate some WAIT messages\n         processSyncReq(sync_msg, false);\n      }\n      else if (sync_msg.type == SyncMsg::ACK)\n      {\n         \/\/ sync_msg.type == SyncMsg::ACK with '0' or non-zero wait time\n         _msg_queue.push_back(sync_msg);\n         _cond.signal();\n      }\n      else\n      {\n         LOG_PRINT_ERROR(\"Unrecognized Sync Msg, type(%u) from(%i)\", sync_msg.type, sync_msg.sender);\n      }\n   }\n   else if (core_state == Core::SLEEPING)\n   {\n      LOG_ASSERT_ERROR(sync_msg.type == SyncMsg::REQ,\n            \"sync_msg.type(%u)\", sync_msg.type);\n      \n      processSyncReq(sync_msg, true);\n   }\n   else\n   {\n      \/\/ I dont want to synchronize against a non-running tile\n      LOG_ASSERT_ERROR(sync_msg.type == SyncMsg::REQ,\n            \"sync_msg.type(%u)\", sync_msg.type);\n\n      LOG_PRINT(\"Tile(%i) not RUNNING: Sending ACK\", _core->getTile()->getId());\n\n      UnstructuredBuffer send_buf;\n      send_buf << (UInt32) SyncMsg::ACK << (UInt64) 0;\n      _core->getTile()->getNetwork()->netSend(sync_msg.sender, CLOCK_SKEW_MINIMIZATION, send_buf.getBuffer(), send_buf.size());\n   }\n\n   _lock.release();\n}\n\nvoid\nLaxP2PSyncClient::processSyncReq(const SyncMsg& sync_msg, bool sleeping)\n{\n   assert(sync_msg.time >= _slack);\n\n   \/\/ I dont want to lock this, so I just try to read the cycle count\n   \/\/ Even if this is an approximate value, this is OK\n   \n   \/\/ Tile Clock to Global clock conversion\n   UInt64 curr_time = _core->getModel()->getCurrTime().toNanosec();\n\n   LOG_ASSERT_ERROR(curr_time < MAX_TIME, \"curr_time(%llu)\", curr_time);\n\n   LOG_PRINT(\"Core(%i, %i): Time(%llu), SyncReq[sender(%i), msg_type(%u), time(%llu)]\", \n      _core->getId().tile_id, _core->getId().core_type, curr_time, sync_msg.sender, sync_msg.type, sync_msg.time);\n\n   \/\/ 3 possible scenarios\n   if (curr_time > (sync_msg.time + _slack))\n   {\n      \/\/ Wait till the other tile reaches this one\n      UnstructuredBuffer send_buf;\n      send_buf << (UInt32) SyncMsg::ACK << (UInt64) 0;\n      _core->getTile()->getNetwork()->netSend(sync_msg.sender, CLOCK_SKEW_MINIMIZATION, send_buf.getBuffer(), send_buf.size());\n\n      if (!sleeping)\n      {\n         \/\/ Goto sleep for a few microseconds\n         \/\/ Self generate a WAIT msg\n         LOG_PRINT(\"Core(%i, %i): WAIT: Time(%llu)\", _core->getId().tile_id, _core->getId().core_type, curr_time - sync_msg.time);\n         LOG_ASSERT_ERROR((curr_time - sync_msg.time) < MAX_TIME,\n               \"[>]: curr_time(%llu), sync_msg[sender(%i, %i), msg_type(%u), time(%llu)]\", \n               curr_time, sync_msg.sender.tile_id, sync_msg.sender.core_type, sync_msg.type, sync_msg.time);\n\n         SyncMsg wait_msg(_core->getId(), SyncMsg::WAIT, curr_time - sync_msg.time);\n         _msg_queue.push_back(wait_msg);\n      }\n   }\n   else if ((curr_time <= (sync_msg.time + _slack)) && (curr_time >= (sync_msg.time - _slack)))\n   {\n      \/\/ Both the cores are in sync (Good)\n      UnstructuredBuffer send_buf;\n      send_buf << (UInt32) SyncMsg::ACK << (UInt64) 0;\n      _core->getTile()->getNetwork()->netSend(sync_msg.sender, CLOCK_SKEW_MINIMIZATION, send_buf.getBuffer(), send_buf.size());\n   }\n   else if (curr_time < (sync_msg.time - _slack))\n   {\n      LOG_ASSERT_ERROR((sync_msg.time - curr_time) < MAX_TIME,\n            \"[<]: curr_time(%llu), sync_msg[sender(%i), msg_type(%u), time(%llu)]\",\n            curr_time, sync_msg.sender, sync_msg.type, sync_msg.time);\n\n      \/\/ Double up and catch up. Meanwhile, ask the other tile to wait\n      UnstructuredBuffer send_buf;\n      send_buf << (UInt32) SyncMsg::ACK << (UInt64) (sync_msg.time - curr_time);\n      _core->getTile()->getNetwork()->netSend(sync_msg.sender, CLOCK_SKEW_MINIMIZATION, send_buf.getBuffer(), send_buf.size());\n   }\n   else\n   {\n      LOG_PRINT_ERROR(\"Strange cycle counts: curr_time(%llu), sender(%i), sender_time(%llu)\",\n            curr_time, sync_msg.sender, sync_msg.time);\n   }\n}\n\n\/\/ Called by user thread\nvoid\nLaxP2PSyncClient::synchronize(Time time)\n{\n   LOG_ASSERT_ERROR(time == 0, \"tiem(%llu), Cannot be used\", time.toNanosec());\n\n   if (! _enabled)\n      return;\n\n   if (_core->getState() == Core::WAKING_UP)\n      _core->setState(Core::RUNNING);\n\n   UInt64 curr_time = _core->getModel()->getCurrTime().toNanosec();\n\n   assert(curr_time >= _last_sync_time);\n\n   LOG_ASSERT_ERROR(curr_time < MAX_TIME, \"curr_time(%llu)\", curr_time);\n\n   if ((curr_time - _last_sync_time) >= _quantum)\n   {\n      LOG_PRINT(\"Tile(%i): Starting Synchronization: curr_time(%llu), _last_sync_time(%llu)\",\n            _core->getTile()->getId(), curr_time, _last_sync_time);\n\n      _lock.acquire();\n\n      _last_sync_time = (curr_time \/ _quantum) * _quantum;\n\n      LOG_ASSERT_ERROR(_last_sync_time < MAX_TIME,\n            \"_last_sync_time(%llu)\", _last_sync_time);\n\n      \/\/ Send SyncMsg to another tile\n      sendRandomSyncMsg(curr_time);\n\n      \/\/ Wait for Acknowledgement and other Wait messages\n      _cond.wait(_lock);\n\n      UInt64 wait_time = userProcessSyncMsgList();\n\n      LOG_PRINT(\"Wait Time (%llu)\", wait_time);\n\n      gotoSleep(wait_time);\n      \n      _lock.release();\n\n   }\n}\n\nvoid\nLaxP2PSyncClient::sendRandomSyncMsg(UInt64 curr_time)\n{\n   LOG_ASSERT_ERROR(curr_time < MAX_TIME, \"curr_time(%llu)\", curr_time);\n\n   UInt32 num_app_cores = Config::getSingleton()->getApplicationTiles();\n   SInt32 offset = 1 + (SInt32) _rand_num.next((Random::value_t) ((num_app_cores - 1) \/ 2));\n   tile_id_t receiver = (_core->getTile()->getId() + offset) % num_app_cores;\n\n   LOG_ASSERT_ERROR((receiver >= 0) && (receiver < (tile_id_t) num_app_cores), \n         \"receiver(%i)\", receiver);\n\n   LOG_PRINT(\"Tile(%i) Sending SyncReq to %i, curr_time(%llu)\", _core->getTile()->getId(), receiver, curr_time);\n\n   UnstructuredBuffer send_buf;\n   send_buf << (UInt32) SyncMsg::REQ << curr_time;\n\n   _core->getTile()->getNetwork()->netSend(Tile::getMainCoreId(receiver), CLOCK_SKEW_MINIMIZATION, send_buf.getBuffer(), send_buf.size());\n}\n\nUInt64\nLaxP2PSyncClient::userProcessSyncMsgList()\n{\n   bool ack_present = false;\n   UInt64 max_wait_time = 0;\n\n   std::list<SyncMsg>::iterator it;\n   for (it = _msg_queue.begin(); it != _msg_queue.end(); it++)\n   {\n      LOG_PRINT(\"Tile(%i) Process Sync Msg List: SyncMsg[sender(%i), type(%u), wait_time(%llu)]\", \n            _core->getTile()->getId(), (*it).sender, (*it).type, (*it).time);\n      \n      LOG_ASSERT_ERROR((*it).time < MAX_TIME,\n            \"sync_msg[sender(%i), msg_type(%u), time(%llu)]\",\n            (*it).sender, (*it).type, (*it).time);\n\n      assert(((*it).type == SyncMsg::WAIT) || ((*it).type == SyncMsg::ACK));\n\n      if ((*it).time >= max_wait_time)\n         max_wait_time = (*it).time;\n      if ((*it).type == SyncMsg::ACK)\n         ack_present = true;\n   }\n   \n   assert(ack_present);\n   _msg_queue.clear();\n\n   return max_wait_time;\n}\n\nvoid\nLaxP2PSyncClient::gotoSleep(const UInt64 sleep_time)\n{\n   LOG_ASSERT_ERROR(sleep_time < MAX_TIME, \"sleep_time(%llu)\", sleep_time);\n\n   if (sleep_time > 0)\n   {\n      LOG_PRINT(\"Tile(%i) going to sleep\", _core->getTile()->getId());\n\n      \/\/ Set the CoreState to 'SLEEPING'\n      _core->setState(Core::SLEEPING);\n\n      UInt64 elapsed_simulated_time = _core->getModel()->getCurrTime().toNanosec();\n\n      UInt64 elapsed_wall_clock_time = getElapsedWallClockTime();\n\n      \/\/ elapsed_simulated_time, sleep_time - in cycles (of target architecture)\n      \/\/ elapsed_wall_clock_time - in microseconds\n      assert(elapsed_simulated_time != 0);\n\n      float wall_clock_time_per_simulated_cycle = float(elapsed_wall_clock_time) \/ elapsed_simulated_time;\n      useconds_t sleep_wall_clock_time = (useconds_t) (_sleep_fraction * wall_clock_time_per_simulated_cycle * sleep_time);\n      if (sleep_wall_clock_time > 1000000)\n      {\n         \/\/ LOG_PRINT_WARNING(\"Large Sleep Time(%u microseconds), SimSleep Time(%llu), elapsed_wall_clock_time(%llu), elapsed_simulated_time(%llu)\", sleep_wall_clock_time, sleep_time, elapsed_wall_clock_time, elapsed_simulated_time);\n         sleep_wall_clock_time = 1000000;\n      }\n     \n      _lock.release();\n\n      assert(usleep(sleep_wall_clock_time) == 0);\n\n      _lock.acquire();\n\n      \/\/ Set the CoreState to 'RUNNING'\n      _core->setState(Core::RUNNING);\n      \n      LOG_PRINT(\"Tile(%i) woken up\", _core->getTile()->getId());\n   }\n}\n\nUInt64\nLaxP2PSyncClient::getElapsedWallClockTime()\n{\n   \/\/ Returns the elapsed time in microseconds\n   struct timeval curr_wall_clock_time;\n   gettimeofday(&curr_wall_clock_time, NULL);\n\n   if (curr_wall_clock_time.tv_usec < _start_wall_clock_time.tv_usec)\n   {\n      curr_wall_clock_time.tv_usec += 1000000;\n      curr_wall_clock_time.tv_sec -= 1;\n   }\n   return ( ((UInt64) (curr_wall_clock_time.tv_sec - _start_wall_clock_time.tv_sec)) * 1000000 +\n      (UInt64) (curr_wall_clock_time.tv_usec - _start_wall_clock_time.tv_usec));\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *\n * Convert.hpp                                                                 *\n *                                                                             *\n * Copyright (c) 2015 Tory Gaurnier                                            *\n *                                                                             *\n * Distributed under the MIT License.                                          *\n * See accompanying file LICENSE or copy at http:\/\/opensource.org\/licenses\/MIT *\n * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *\/\n\n\n#ifndef CONVERT_HPP\n#define CONVERT_HPP\n\n\n#include <Box2D\/Box2D.h>\n\n\nclass Convert {\n\tpublic:\n\t\tConvert() = delete;\n\n\t\tstatic void init(float meters_per_screen_height);\n\t\tstatic float metersToPixels(float meters);\n\t\tstatic float pixelsToMeters(float pixels);\n\t\tstatic b2Vec2 screenToWorldPos(b2Vec2 screen_pos);\n\t\tstatic float screenToWorldPosX(float screen_x);\n\t\tstatic float screenToWorldPosY(float screen_y);\n\t\tstatic b2Vec2 worldToScreenPos(b2Vec2 world_pos);\n\t\tstatic float worldToScreenPosX(float world_x);\n\t\tstatic float worldToScreenPosY(float world_y);\n\n\n\tprivate:\n\t\tstatic float pixels_per_meter;\n};\n\n\n#endif\n<commit_msg>Added default value to Convert::init(float)<commit_after>\/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *\n * Convert.hpp                                                                 *\n *                                                                             *\n * Copyright (c) 2015 Tory Gaurnier                                            *\n *                                                                             *\n * Distributed under the MIT License.                                          *\n * See accompanying file LICENSE or copy at http:\/\/opensource.org\/licenses\/MIT *\n * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *\/\n\n\n#ifndef CONVERT_HPP\n#define CONVERT_HPP\n\n\n#include <Box2D\/Box2D.h>\n\n\nclass Convert {\n\tpublic:\n\t\tConvert() = delete;\n\n\t\tstatic void init(float meters_per_screen_height = 10.0f);\n\t\tstatic float metersToPixels(float meters);\n\t\tstatic float pixelsToMeters(float pixels);\n\t\tstatic b2Vec2 screenToWorldPos(b2Vec2 screen_pos);\n\t\tstatic float screenToWorldPosX(float screen_x);\n\t\tstatic float screenToWorldPosY(float screen_y);\n\t\tstatic b2Vec2 worldToScreenPos(b2Vec2 world_pos);\n\t\tstatic float worldToScreenPosX(float world_x);\n\t\tstatic float worldToScreenPosY(float world_y);\n\n\n\tprivate:\n\t\tstatic float pixels_per_meter;\n};\n\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/VBA_NestFunc.cpp\n\/\/Copyright (c) 2015 mmYYmmdd\n#include \"stdafx.h\"\n#include \"VBA_NestFunc.hpp\"\n\n\n\/\/VBA配列の次元取得\n__int32 __stdcall Dimension(const VARIANT* pv)\n{\n\tif ( !pv || 0 == (VT_ARRAY & pv->vt ) )\n\t\treturn\t0;\n\tif ( 0 == (VT_BYREF & pv->vt) )\n\t\treturn ::SafeArrayGetDim(pv->parray);\n\telse\n\t\treturn (pv->pparray)? ::SafeArrayGetDim(*pv->pparray): 0;\n}\n\n\/\/プレースホルダの生成\nVARIANT __stdcall placeholder(__int32 n)\n{\n    VARIANT ret;\n    ::VariantInit(&ret);\n    ret.vt = VT_ERROR;\n    ret.scode = n;\n    return ret;\n}\n\n\/\/プレースホルダの判定\n__int32 __stdcall is_placeholder(const VARIANT* pv)\n{\n    return ( pv && (pv->vt == VT_ERROR) && 0 <= pv->scode && pv->scode <= 2 ) ? 1 : 0;\n}\n\n\/\/===================================================================\nsafearrayRef::safearrayRef(const VARIANT* pv)\n    :psa(nullptr), pvt(0), dim(0), elemsize(0), it(nullptr)\/\/, size{1,1,1}\n{\n    ::VariantInit(&val_);\n    if (!pv || 0 == (VT_ARRAY & pv->vt))            return;\n    psa = (0 == (VT_BYREF & pv->vt))? pv->parray: *pv->pparray;\n    if (!psa)                                       return;\n    SafeArrayAccessData(psa, reinterpret_cast<void**>(&it));\n    dim = SafeArrayGetDim(psa);\n    if (!it || 3 < dim)\n    {\n        dim = 0;\n        return;\n    }\n    elemsize = SafeArrayGetElemsize(psa);\n    SafeArrayGetVartype(psa, &pvt);\n    val_.vt = pvt | VT_BYREF;   \/\/ここ\n    size[0] = size[1] = size[2] = 1;\n    for (decltype(dim) i = 0; i < dim; ++i)\n    {\n        LONG ub = 0, lb = 0;\n        ::SafeArrayGetUBound(psa, static_cast<UINT>(i+1), &ub);\n        ::SafeArrayGetLBound(psa, static_cast<UINT>(i+1), &lb);\n        size[i] = ub - lb + 1;\n    }\n}\nsafearrayRef::~safearrayRef()\n{\n    if(psa)     SafeArrayUnaccessData(psa);\n    VariantClear(&val_);\n}\n\nstd::size_t safearrayRef::getDim() const\n{\n    return dim;\n}\n\nstd::size_t safearrayRef::getSize(std::size_t i) const\n{\n    return size[i-1];\n}\n\nstd::size_t safearrayRef::getOriginalLBound(std::size_t i) const\n{\n    LONG lb = 0;\n    ::SafeArrayGetLBound(psa, static_cast<UINT>(i), &lb);\n    return lb;\n}\n\nVARIANT& safearrayRef::operator()(std::size_t i, std::size_t j, std::size_t k)\n{\n    auto distance = size[0]*size[1]*k + size[0]*j + i;\n    if ( pvt == VT_VARIANT)\n    {\n        return *reinterpret_cast<VARIANT*>(it + distance*elemsize);\n    }\n    else\n    {\n        val_.pvarVal = reinterpret_cast<VARIANT*>(it + distance*elemsize);\n        return val_;\n    }\n}\n\n\/\/===================================================================\nfuncExpr_i::~funcExpr_i()\n{   }\n\n\/\/--------------------------------------------------------\nclass valueExpr : public funcExpr_i    {\n    VARIANT     val;\npublic:\n    valueExpr(VARIANT* v)\n    {\n        ::VariantInit(&val);\n        ::VariantCopyInd(&val, v);\n    }\n    ~valueExpr()    { ::VariantClear(&val); }\n    VARIANT* eval(VARIANT*, VARIANT*, int left_right = 0)   {   return &val;    }\n};\n\n\/\/--------------------------------------------------------\nclass placeholder0 : public funcExpr_i    {\npublic:\n    ~placeholder0()  {   }\n    VARIANT* eval(VARIANT* x, VARIANT* y, int left_right = 0)\n    {\n        return ( left_right == 1 )?  x: ( left_right == 2 )?  y:  0;\n    }\n};\n\nclass placeholder1 : public funcExpr_i    {\npublic:\n    ~placeholder1()  {   }\n    VARIANT* eval(VARIANT* x, VARIANT* y, int left_right = 0)\n    {   return x;   }\n};\n\nclass placeholder2 : public funcExpr_i    {\npublic:\n    ~placeholder2()  {   }\n    VARIANT* eval(VARIANT* x, VARIANT* y, int left_right = 0)\n    {   return y;   }\n};\n\n\/\/-------------------------------------------------------------\nnamespace   {\n    int placeholder_num(const VARIANT* pv)\n    {\n        return ( pv && (pv->vt == VT_ERROR) ) ?  pv->scode :  -1;\n    }\n}\n\/\/-------------------------------------------------------------\nfunctionExpr::VBCallbackFunc_::VBCallbackFunc_(const VARIANT* bfun) : fun(0)\n{\n    ::VariantInit(&elem1);\n    ::VariantInit(&elem2);\n    safearrayRef arRef(bfun);\n    if ( 1 != arRef.getDim() )         return;\n    if ( arRef.getSize(1) < 4 )        return;\n    if ( placeholder_num(&arRef(3)) < 0 )   return;\n    {\n        VARIANT pF;\n        VariantInit(&pF);\n        if ( S_OK != ::VariantChangeType(&pF, &arRef(0), 0, VT_I8))     return;\n        fun = reinterpret_cast<vbCallbackFunc_t>(pF.llVal);\n        VariantClear(&pF);\n    }\n    ::VariantCopyInd(&elem1, &arRef(1));\n    ::VariantCopyInd(&elem2, &arRef(2));\n}\n\nfunctionExpr::VBCallbackFunc_::~VBCallbackFunc_()\n{\n    ::VariantClear(&elem1);\n    ::VariantClear(&elem2);\n}\n\nfunctionExpr::VBCallbackFunc_::operator bool() const\n{\n    return 0 != fun;\n}\n\n\/\/--------------------------------------------------------\nfunctionExpr::functionExpr(VBCallbackFunc_& callback) : fun(callback.fun)\n{\n    ::VariantInit(&val);\n    {\n        VBCallbackFunc_ fun1(&callback.elem1);\n        int pn = -1;\n        if ( fun1 )\n            left.reset(new functionExpr(fun1));\n        else if ( 0 == (pn = placeholder_num(&callback.elem1)) )\n            left.reset(new placeholder0);\n        else if ( 1 == pn )\n            left.reset(new placeholder1);\n        else if ( 2 == pn )\n            left.reset(new placeholder2);\n        else\n            left.reset(new valueExpr(&callback.elem1));\n    }\n    {\n        VBCallbackFunc_ fun2(&callback.elem2);\n        int pn = -1;\n        if ( fun2 )\n            right.reset(new functionExpr(fun2));\n        else if ( 0 == (pn = placeholder_num(&callback.elem2)) )\n            right.reset(new placeholder0);\n        else if ( 1 == pn )\n            right.reset(new placeholder1);\n        else if ( 2 == pn )\n            right.reset(new placeholder2);\n        else\n            right.reset(new valueExpr(&callback.elem2));\n    }\n}\n\nfunctionExpr::~functionExpr()\n{\n    ::VariantClear(&val);\n}\n\nVARIANT* functionExpr::eval(VARIANT* x, VARIANT* y, int left_right) \/\/ = 0\n{\n    if ( fun )\n    {\n        VARIANT tmp = fun(  left->eval(x, y, left_right? left_right : 1),\n                           right->eval(x, y, left_right? left_right : 2)    );\n        ::VariantClear(&val);\n        std::swap(val, tmp);\n    }\n    return &val;\n}\n<commit_msg>Variant変数の実体→ポインタによる高速化<commit_after>\/\/VBA_NestFunc.cpp\n\/\/Copyright (c) 2015 mmYYmmdd\n#include \"stdafx.h\"\n#include \"VBA_NestFunc.hpp\"\n\n\n\/\/VBA配列の次元取得\n__int32 __stdcall Dimension(const VARIANT* pv)\n{\n\tif ( !pv || 0 == (VT_ARRAY & pv->vt ) )\n\t\treturn\t0;\n\tif ( 0 == (VT_BYREF & pv->vt) )\n\t\treturn ::SafeArrayGetDim(pv->parray);\n\telse\n\t\treturn (pv->pparray)? ::SafeArrayGetDim(*pv->pparray): 0;\n}\n\n\/\/プレースホルダの生成\nVARIANT __stdcall placeholder(__int32 n)\n{\n    VARIANT ret;\n    ::VariantInit(&ret);\n    ret.vt = VT_ERROR;\n    ret.scode = n;\n    return ret;\n}\n\n\/\/プレースホルダの判定\n__int32 __stdcall is_placeholder(const VARIANT* pv)\n{\n    return ( pv && (pv->vt == VT_ERROR) && 0 <= pv->scode && pv->scode <= 2 ) ? 1 : 0;\n}\n\n\/\/===================================================================\nsafearrayRef::safearrayRef(const VARIANT* pv)\n    :psa(nullptr), pvt(0), dim(0), elemsize(0), it(nullptr)\/\/, size{1,1,1}\n{\n    ::VariantInit(&val_);\n    if (!pv || 0 == (VT_ARRAY & pv->vt))            return;\n    psa = (0 == (VT_BYREF & pv->vt))? pv->parray: *pv->pparray;\n    if (!psa)                                       return;\n    SafeArrayAccessData(psa, reinterpret_cast<void**>(&it));\n    dim = SafeArrayGetDim(psa);\n    if (!it || 3 < dim)\n    {\n        dim = 0;\n        return;\n    }\n    elemsize = SafeArrayGetElemsize(psa);\n    SafeArrayGetVartype(psa, &pvt);\n    val_.vt = pvt | VT_BYREF;   \/\/ここ\n    size[0] = size[1] = size[2] = 1;\n    for (decltype(dim) i = 0; i < dim; ++i)\n    {\n        LONG ub = 0, lb = 0;\n        ::SafeArrayGetUBound(psa, static_cast<UINT>(i+1), &ub);\n        ::SafeArrayGetLBound(psa, static_cast<UINT>(i+1), &lb);\n        size[i] = ub - lb + 1;\n    }\n}\nsafearrayRef::~safearrayRef()\n{\n    if(psa)     SafeArrayUnaccessData(psa);\n    VariantClear(&val_);\n}\n\nstd::size_t safearrayRef::getDim() const\n{\n    return dim;\n}\n\nstd::size_t safearrayRef::getSize(std::size_t i) const\n{\n    return size[i-1];\n}\n\nstd::size_t safearrayRef::getOriginalLBound(std::size_t i) const\n{\n    LONG lb = 0;\n    ::SafeArrayGetLBound(psa, static_cast<UINT>(i), &lb);\n    return lb;\n}\n\nVARIANT& safearrayRef::operator()(std::size_t i, std::size_t j, std::size_t k)\n{\n    auto distance = size[0]*size[1]*k + size[0]*j + i;\n    if ( pvt == VT_VARIANT)\n    {\n        return *reinterpret_cast<VARIANT*>(it + distance*elemsize);\n    }\n    else\n    {\n        val_.pvarVal = reinterpret_cast<VARIANT*>(it + distance*elemsize);\n        return val_;\n    }\n}\n\n\/\/===================================================================\nfuncExpr_i::~funcExpr_i()\n{   }\n\n\/\/--------------------------------------------------------\nclass valueExpr : public funcExpr_i    {\n    VARIANT*     val;\npublic:\n    valueExpr(VARIANT* v) : val(v)    {    }\n    VARIANT* eval(VARIANT*, VARIANT*, int left_right = 0)   {   return val;    }\n};\n\n\/\/--------------------------------------------------------\nclass placeholder0 : public funcExpr_i    {\npublic:\n    ~placeholder0()  {   }\n    VARIANT* eval(VARIANT* x, VARIANT* y, int left_right = 0)\n    {\n        return ( left_right == 1 )?  x: ( left_right == 2 )?  y:  0;\n    }\n};\n\nclass placeholder1 : public funcExpr_i    {\npublic:\n    ~placeholder1()  {   }\n    VARIANT* eval(VARIANT* x, VARIANT* y, int left_right = 0)\n    {   return x;   }\n};\n\nclass placeholder2 : public funcExpr_i    {\npublic:\n    ~placeholder2()  {   }\n    VARIANT* eval(VARIANT* x, VARIANT* y, int left_right = 0)\n    {   return y;   }\n};\n\n\/\/-------------------------------------------------------------\nnamespace   {\n    int placeholder_num(const VARIANT* pv)\n    {\n        return ( pv && (pv->vt == VT_ERROR) ) ?  pv->scode :  -1;\n    }\n}\n\/\/-------------------------------------------------------------\nfunctionExpr::VBCallbackFunc_::VBCallbackFunc_(const VARIANT* bfun) : fun(0), elem1(0), elem2(0)\n{\n    safearrayRef arRef(bfun);\n    if ( 1 != arRef.getDim() )         return;\n    if ( arRef.getSize(1) < 4 )        return;\n    if ( placeholder_num(&arRef(3)) < 0 )   return;\n    {\n        VARIANT pF;\n        VariantInit(&pF);\n        if ( S_OK != ::VariantChangeType(&pF, &arRef(0), 0, VT_I8))     return;\n        fun = reinterpret_cast<vbCallbackFunc_t>(pF.llVal);\n        VariantClear(&pF);\n    }\n    elem1 = &arRef(1);\n    elem2 = &arRef(2);\n}\n\nfunctionExpr::VBCallbackFunc_::operator bool() const\n{\n    return 0 != fun;\n}\n\n\/\/--------------------------------------------------------\nfunctionExpr::functionExpr(VBCallbackFunc_& callback) : fun(callback.fun)\n{\n    ::VariantInit(&val);\n    {\n        VBCallbackFunc_ fun1(callback.elem1);\n        int pn = -1;\n        if ( fun1 )\n            left.reset(new functionExpr(fun1));\n        else if ( 0 == (pn = placeholder_num(callback.elem1)) )\n            left.reset(new placeholder0);\n        else if ( 1 == pn )\n            left.reset(new placeholder1);\n        else if ( 2 == pn )\n            left.reset(new placeholder2);\n        else\n            left.reset(new valueExpr(callback.elem1));\n    }\n    {\n        VBCallbackFunc_ fun2(callback.elem2);\n        int pn = -1;\n        if ( fun2 )\n            right.reset(new functionExpr(fun2));\n        else if ( 0 == (pn = placeholder_num(callback.elem2)) )\n            right.reset(new placeholder0);\n        else if ( 1 == pn )\n            right.reset(new placeholder1);\n        else if ( 2 == pn )\n            right.reset(new placeholder2);\n        else\n            right.reset(new valueExpr(callback.elem2));\n    }\n}\n\nfunctionExpr::~functionExpr()\n{\n    ::VariantClear(&val);\n}\n\nVARIANT* functionExpr::eval(VARIANT* x, VARIANT* y, int left_right) \/\/ = 0\n{\n    if ( fun )\n    {\n        VARIANT tmp = fun(  left->eval(x, y, left_right? left_right : 1),\n                           right->eval(x, y, left_right? left_right : 2)    );\n        ::VariantClear(&val);\n        std::swap(val, tmp);\n    }\n    return &val;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/VBA_NestFunc.cpp\n\/\/Copyright (c) 2015 mmYYmmdd\n#include \"stdafx.h\"\n#include \"OAIdl.h\"      \/\/wtypes.h\n#include \"VBA_NestFunc.hpp\"\n\n\n\/\/VBA配列の次元取得\n__int32 __stdcall Dimension(const VARIANT* pv)\n{\n\tif ( !pv || 0 == (VT_ARRAY & pv->vt ) )\n\t\treturn\t0;\n\tif ( 0 == (VT_BYREF & pv->vt) )\n\t\treturn ::SafeArrayGetDim(pv->parray);\n\telse\n\t\treturn (pv->pparray)? ::SafeArrayGetDim(*pv->pparray): 0;\n}\n\n\/\/プレースホルダの生成\nVARIANT __stdcall placeholder(__int32 n)\n{\n    VARIANT ret;\n    ::VariantInit(&ret);\n    ret.vt = VT_ERROR;\n    ret.scode = n;\n    return ret;\n}\n\n\/\/プレースホルダの判定\n__int32 __stdcall is_placeholder(const VARIANT* pv)\n{\n    return ( pv && (pv->vt == VT_ERROR) && 0 <= pv->scode && pv->scode <= 2 ) ? 1 : 0;\n}\n\n\/\/要素数とLBoundを取得\nvoid safeArrayBounds(SAFEARRAY* pArray, UINT dim, SAFEARRAYBOUND bounds[3])\n{\n    for ( ULONG i = 0; i < dim; ++i )\n    {\n        ::SafeArrayGetLBound(pArray, i+1, &bounds[i].lLbound);\n        LONG ub = 0;\n        ::SafeArrayGetUBound(pArray, i+1, &ub);\n        bounds[i].cElements = 1 + ub - bounds[i].lLbound;\n    }\n}\n\n\/\/===================================================================\nfuncExpr_i::~funcExpr_i()\n{   }\n\n\/\/--------------------------------------------------------\nclass valueExpr : public funcExpr_i    {\n    VARIANT     val;\npublic:\n    valueExpr(VARIANT* v)\n    {\n        ::VariantInit(&val);\n        ::VariantCopy(&val, v);\n    }\n    ~valueExpr()    {   }\n    VARIANT* eval(VARIANT*, VARIANT*, int left_right = 0)   {   return &val;    }\n};\n\n\/\/--------------------------------------------------------\nclass placeholder0 : public funcExpr_i    {\npublic:\n    ~placeholder0()  {   }\n    VARIANT* eval(VARIANT* x, VARIANT* y, int left_right = 0)\n    {\n        return ( left_right == 1 )?  x: ( left_right == 2 )?  y:  0;\n    }\n};\n\nclass placeholder1 : public funcExpr_i    {\npublic:\n    ~placeholder1()  {   }\n    VARIANT* eval(VARIANT* x, VARIANT* y, int left_right = 0)\n    {   return x;   }\n};\n\nclass placeholder2 : public funcExpr_i    {\npublic:\n    ~placeholder2()  {   }\n    VARIANT* eval(VARIANT* x, VARIANT* y, int left_right = 0)\n    {   return y;   }\n};\n\n\/\/-------------------------------------------------------------\nnamespace   {\n    int placeholder_num(const VARIANT* pv)\n    {\n        return ( pv && (pv->vt == VT_ERROR) ) ?  pv->scode :  -1;\n    }\n}\n\/\/-------------------------------------------------------------\nfunctionExpr::VBCallbackFunc_::VBCallbackFunc_(const VARIANT* bfun) : fun(0)\n{\n    ::VariantInit(&elem1);\n    ::VariantInit(&elem2);\n    if ( 1 != Dimension(bfun) )         return;\n    SAFEARRAY* pArray = ( 0 == (VT_BYREF & bfun->vt) )?  (bfun->parray): (*bfun->pparray);\n    if ( !pArray )                      return;\n    SAFEARRAYBOUND bounds = {1,0};   \/\/要素数、LBound\n    safeArrayBounds(pArray, 1, &bounds);\n    if ( bounds.cElements < 4 )         return;\n    LONG index = bounds.lLbound + 3;\n    {\n        VARIANT elem3;\n        ::VariantInit(&elem3);\n        ::SafeArrayGetElement(pArray, &index, &elem3);\n        auto isP = placeholder_num(&elem3);\n        ::VariantClear(&elem3);\n        if ( isP < 0 )                     return;\n    }\n    {\n        VARIANT elem0;\n        ::VariantInit(&elem0);\n        index = bounds.lLbound + 0;\n        ::SafeArrayGetElement(pArray, &index, &elem0);\n        if ( elem0.vt != VT_I4 || elem0.lVal == 0 )\n        {\n            ::VariantClear(&elem0);\n            return;\n        }\n        fun = reinterpret_cast<vbCallbackFunc_t>(elem0.lVal);\n        ::VariantClear(&elem0);\n    }\n    {\n        index = bounds.lLbound + 1;\n        ::SafeArrayGetElement(pArray, &index, &elem1);\n        index = bounds.lLbound + 2;\n        ::SafeArrayGetElement(pArray, &index, &elem2);\n    }\n}\n\nfunctionExpr::VBCallbackFunc_::~VBCallbackFunc_()\n{\n    ::VariantClear(&elem1);\n    ::VariantClear(&elem2);\n}\n\nfunctionExpr::VBCallbackFunc_::operator bool() const\n{\n    return 0 != fun;\n}\n\n\/\/--------------------------------------------------------\nfunctionExpr::functionExpr(VBCallbackFunc_& callback) : fun(callback.fun)\n{\n    ::VariantInit(&val);\n    {\n        VBCallbackFunc_ fun1(&callback.elem1);\n        int pn = -1;\n        if ( fun1 )\n            left.reset(new functionExpr(fun1));\n        else if ( 0 == (pn = placeholder_num(&callback.elem1)) )\n            left.reset(new placeholder0);\n        else if ( 1 == pn )\n            left.reset(new placeholder1);\n        else if ( 2 == pn )\n            left.reset(new placeholder2);\n        else\n            left.reset(new valueExpr(&callback.elem1));\n    }\n    {\n        VBCallbackFunc_ fun2(&callback.elem2);\n        int pn = -1;\n        if ( fun2 )\n            right.reset(new functionExpr(fun2));\n        else if ( 0 == (pn = placeholder_num(&callback.elem2)) )\n            right.reset(new placeholder0);\n        else if ( 1 == pn )\n            right.reset(new placeholder1);\n        else if ( 2 == pn )\n            right.reset(new placeholder2);\n        else\n            right.reset(new valueExpr(&callback.elem2));\n    }\n}\n\nfunctionExpr::~functionExpr()\n{\n    ::VariantClear(&val);\n}\n\nVARIANT* functionExpr::eval(VARIANT* x, VARIANT* y, int left_right) \/\/ = 0\n{\n    if ( fun )\n    {\n        VARIANT tmp = fun(  left->eval(x, y, left_right? left_right : 1),\n                           right->eval(x, y, left_right? left_right : 2)    );\n        ::VariantClear(&val);\n        std::swap(val, tmp);\n    }\n    return &val;\n}\n<commit_msg>#include \"OAIdl.h を VBA_NestFunc.hpp に移動<commit_after>\/\/VBA_NestFunc.cpp\n\/\/Copyright (c) 2015 mmYYmmdd\n#include \"stdafx.h\"\n#include \"VBA_NestFunc.hpp\"\n\n\n\/\/VBA配列の次元取得\n__int32 __stdcall Dimension(const VARIANT* pv)\n{\n\tif ( !pv || 0 == (VT_ARRAY & pv->vt ) )\n\t\treturn\t0;\n\tif ( 0 == (VT_BYREF & pv->vt) )\n\t\treturn ::SafeArrayGetDim(pv->parray);\n\telse\n\t\treturn (pv->pparray)? ::SafeArrayGetDim(*pv->pparray): 0;\n}\n\n\/\/プレースホルダの生成\nVARIANT __stdcall placeholder(__int32 n)\n{\n    VARIANT ret;\n    ::VariantInit(&ret);\n    ret.vt = VT_ERROR;\n    ret.scode = n;\n    return ret;\n}\n\n\/\/プレースホルダの判定\n__int32 __stdcall is_placeholder(const VARIANT* pv)\n{\n    return ( pv && (pv->vt == VT_ERROR) && 0 <= pv->scode && pv->scode <= 2 ) ? 1 : 0;\n}\n\n\/\/要素数とLBoundを取得\nvoid safeArrayBounds(SAFEARRAY* pArray, UINT dim, SAFEARRAYBOUND bounds[3])\n{\n    for ( ULONG i = 0; i < dim; ++i )\n    {\n        ::SafeArrayGetLBound(pArray, i+1, &bounds[i].lLbound);\n        LONG ub = 0;\n        ::SafeArrayGetUBound(pArray, i+1, &ub);\n        bounds[i].cElements = 1 + ub - bounds[i].lLbound;\n    }\n}\n\n\/\/===================================================================\nfuncExpr_i::~funcExpr_i()\n{   }\n\n\/\/--------------------------------------------------------\nclass valueExpr : public funcExpr_i    {\n    VARIANT     val;\npublic:\n    valueExpr(VARIANT* v)\n    {\n        ::VariantInit(&val);\n        ::VariantCopy(&val, v);\n    }\n    ~valueExpr()    {   }\n    VARIANT* eval(VARIANT*, VARIANT*, int left_right = 0)   {   return &val;    }\n};\n\n\/\/--------------------------------------------------------\nclass placeholder0 : public funcExpr_i    {\npublic:\n    ~placeholder0()  {   }\n    VARIANT* eval(VARIANT* x, VARIANT* y, int left_right = 0)\n    {\n        return ( left_right == 1 )?  x: ( left_right == 2 )?  y:  0;\n    }\n};\n\nclass placeholder1 : public funcExpr_i    {\npublic:\n    ~placeholder1()  {   }\n    VARIANT* eval(VARIANT* x, VARIANT* y, int left_right = 0)\n    {   return x;   }\n};\n\nclass placeholder2 : public funcExpr_i    {\npublic:\n    ~placeholder2()  {   }\n    VARIANT* eval(VARIANT* x, VARIANT* y, int left_right = 0)\n    {   return y;   }\n};\n\n\/\/-------------------------------------------------------------\nnamespace   {\n    int placeholder_num(const VARIANT* pv)\n    {\n        return ( pv && (pv->vt == VT_ERROR) ) ?  pv->scode :  -1;\n    }\n}\n\/\/-------------------------------------------------------------\nfunctionExpr::VBCallbackFunc_::VBCallbackFunc_(const VARIANT* bfun) : fun(0)\n{\n    ::VariantInit(&elem1);\n    ::VariantInit(&elem2);\n    if ( 1 != Dimension(bfun) )         return;\n    SAFEARRAY* pArray = ( 0 == (VT_BYREF & bfun->vt) )?  (bfun->parray): (*bfun->pparray);\n    if ( !pArray )                      return;\n    SAFEARRAYBOUND bounds = {1,0};   \/\/要素数、LBound\n    safeArrayBounds(pArray, 1, &bounds);\n    if ( bounds.cElements < 4 )         return;\n    LONG index = bounds.lLbound + 3;\n    {\n        VARIANT elem3;\n        ::VariantInit(&elem3);\n        ::SafeArrayGetElement(pArray, &index, &elem3);\n        auto isP = placeholder_num(&elem3);\n        ::VariantClear(&elem3);\n        if ( isP < 0 )                     return;\n    }\n    {\n        VARIANT elem0;\n        ::VariantInit(&elem0);\n        index = bounds.lLbound + 0;\n        ::SafeArrayGetElement(pArray, &index, &elem0);\n        if ( elem0.vt != VT_I4 || elem0.lVal == 0 )\n        {\n            ::VariantClear(&elem0);\n            return;\n        }\n        fun = reinterpret_cast<vbCallbackFunc_t>(elem0.lVal);\n        ::VariantClear(&elem0);\n    }\n    {\n        index = bounds.lLbound + 1;\n        ::SafeArrayGetElement(pArray, &index, &elem1);\n        index = bounds.lLbound + 2;\n        ::SafeArrayGetElement(pArray, &index, &elem2);\n    }\n}\n\nfunctionExpr::VBCallbackFunc_::~VBCallbackFunc_()\n{\n    ::VariantClear(&elem1);\n    ::VariantClear(&elem2);\n}\n\nfunctionExpr::VBCallbackFunc_::operator bool() const\n{\n    return 0 != fun;\n}\n\n\/\/--------------------------------------------------------\nfunctionExpr::functionExpr(VBCallbackFunc_& callback) : fun(callback.fun)\n{\n    ::VariantInit(&val);\n    {\n        VBCallbackFunc_ fun1(&callback.elem1);\n        int pn = -1;\n        if ( fun1 )\n            left.reset(new functionExpr(fun1));\n        else if ( 0 == (pn = placeholder_num(&callback.elem1)) )\n            left.reset(new placeholder0);\n        else if ( 1 == pn )\n            left.reset(new placeholder1);\n        else if ( 2 == pn )\n            left.reset(new placeholder2);\n        else\n            left.reset(new valueExpr(&callback.elem1));\n    }\n    {\n        VBCallbackFunc_ fun2(&callback.elem2);\n        int pn = -1;\n        if ( fun2 )\n            right.reset(new functionExpr(fun2));\n        else if ( 0 == (pn = placeholder_num(&callback.elem2)) )\n            right.reset(new placeholder0);\n        else if ( 1 == pn )\n            right.reset(new placeholder1);\n        else if ( 2 == pn )\n            right.reset(new placeholder2);\n        else\n            right.reset(new valueExpr(&callback.elem2));\n    }\n}\n\nfunctionExpr::~functionExpr()\n{\n    ::VariantClear(&val);\n}\n\nVARIANT* functionExpr::eval(VARIANT* x, VARIANT* y, int left_right) \/\/ = 0\n{\n    if ( fun )\n    {\n        VARIANT tmp = fun(  left->eval(x, y, left_right? left_right : 1),\n                           right->eval(x, y, left_right? left_right : 2)    );\n        ::VariantClear(&val);\n        std::swap(val, tmp);\n    }\n    return &val;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkSocket.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 \"vtkSocket.h\"\n\n#include \"vtkObjectFactory.h\"\n\n#if defined(_WIN32) && !defined(__CYGWIN__)\n  #define VTK_WINDOWS_FULL\n  #include \"vtkWindows.h\"\n#else\n  #include <sys\/types.h>\n  #include <sys\/socket.h>\n  #include <netinet\/in.h>\n  #include <netinet\/tcp.h>\n  #include <arpa\/inet.h>\n  #include <netdb.h>\n  #include <unistd.h>\n  #include <sys\/time.h>\n#endif\n\n#if defined(_WIN32) && !defined(__CYGWIN__)\n#define WSA_VERSION MAKEWORD(1,1)\n#define vtkCloseSocketMacro(sock) (closesocket(sock))\n#else\n#define vtkCloseSocketMacro(sock) (close(sock))\n#endif\n\nvtkCxxRevisionMacro(vtkSocket, \"1.1\");\n\/\/-----------------------------------------------------------------------------\nvtkSocket::vtkSocket()\n{\n  this->SocketDescriptor = -1;\n  \n}\n\n\/\/-----------------------------------------------------------------------------\nvtkSocket::~vtkSocket()\n{\n  if (this->SocketDescriptor != -1)\n    {\n    this->CloseSocket(this->SocketDescriptor);\n    this->SocketDescriptor = -1;\n    }\n}\n\n\/\/-----------------------------------------------------------------------------\nint vtkSocket::CreateSocket()\n{\n  int sock = socket(AF_INET, SOCK_STREAM, 0);\n  \/\/ Elimate windows 0.2 second delay sending (buffering) data.\n  int on = 1;\n  if (setsockopt(sock, IPPROTO_TCP, TCP_NODELAY, (char*)&on, sizeof(on)))\n    {\n    return -1;\n    }\n  return sock;\n}\n\n\/\/-----------------------------------------------------------------------------\nint vtkSocket::BindSocket(int socketdescriptor, int port)\n{\n  struct sockaddr_in server;\n\n  server.sin_family = AF_INET;\n  server.sin_addr.s_addr = INADDR_ANY;\n  server.sin_port = htons(port);\n  \/\/ Allow the socket to be bound to an address that is already in use\n  int opt=1;\n#ifdef _WIN32\n  setsockopt(socketdescriptor, SOL_SOCKET, SO_REUSEADDR, (char*) &opt, sizeof(int));\n#else\n  setsockopt(socketdescriptor, SOL_SOCKET, SO_REUSEADDR, (void *) &opt, sizeof(int));\n#endif\n\n  if ( bind(socketdescriptor, reinterpret_cast<sockaddr*>(&server), sizeof(server)) )\n    {\n    return -1;\n    }\n  return 0;\n}\n\n\/\/-----------------------------------------------------------------------------\nint vtkSocket::Accept(int socketdescriptor)\n{\n  if (socketdescriptor < 0)\n    {\n    return -1;\n    }\n  return accept(socketdescriptor, 0, 0);\n}\n\n\/\/-----------------------------------------------------------------------------\nint vtkSocket::Listen(int socketdescriptor)\n{\n  if (socketdescriptor < 0)\n    {\n    return -1;\n    }\n  return listen(socketdescriptor, 1);\n}\n\n\/\/-----------------------------------------------------------------------------\nint vtkSocket::SelectSocket(int socketdescriptor, unsigned long msec)\n{\n  if (socketdescriptor < 0 )\n    {\n    \/\/ invalid socket descriptor.\n    return -1;\n    }\n  \n  fd_set rset;\n  struct timeval tval;\n  struct timeval* tvalptr = 0;\n  if ( msec > 0 )\n    {\n    tval.tv_sec = msec \/ 1000;\n    tval.tv_usec = (msec % 1000)*1000;\n    tvalptr = &tval;\n    }\n  FD_ZERO(&rset);\n  FD_SET(socketdescriptor, &rset);\n  int res = select(socketdescriptor + 1, &rset, 0, 0, tvalptr);\n  if(res == 0)\n    {\n    return 0;\/\/for time limit expire\n    }\n\n  if ( res < 0 || !(FD_ISSET(socketdescriptor, &rset)) )\n    {\n    \/\/ Some error.\n    return -1;\n    }\n  \/\/ The indicated socket has some activity on it.\n  return 1;\n}\n\n\/\/-----------------------------------------------------------------------------\nint vtkSocket::SelectSockets(const int* sockets_to_select, int size,\n    unsigned long msec, int* selected_index)\n{\n  int i;\n  int max_fd = -1;\n  *selected_index = -1;\n  if (size <  0)\n    {\n    return -1;\n    }\n  \n  fd_set rset;\n  struct timeval tval;\n  struct timeval* tvalptr = 0;\n  if ( msec > 0 )\n    {\n    tval.tv_sec = msec \/ 1000;\n    tval.tv_usec = msec % 1000;\n    tvalptr = &tval;\n    }\n  FD_ZERO(&rset);\n  for (i=0; i<size; i++)\n    {\n    FD_SET(sockets_to_select[i],&rset);\n    max_fd = (sockets_to_select[i] > max_fd)? sockets_to_select[i] : max_fd;\n    }\n  \n  int res = select(max_fd + 1, &rset, 0, 0, tvalptr);\n  if (res == 0)\n    {\n    return 0; \/\/Timeout\n    }\n  if (res < 0)\n    {\n    \/\/ SelectSocket error.\n    return -1;\n    }\n  \n  \/\/check which socket has some activity.\n  for (i=0; i<size; i++)\n    {\n    if ( FD_ISSET(sockets_to_select[i],&rset) )\n      {\n      *selected_index = i;\n      return 1;\n      }\n    }\n  return -1; \n}\n\n\/\/-----------------------------------------------------------------------------\nint vtkSocket::Connect(int socketdescriptor, const char* hostName, int port)\n{\n  if (socketdescriptor < 0)\n    {\n    return -1;\n    }\n\n  struct hostent* hp;\n  hp = gethostbyname(hostName);\n  if (!hp)\n    {\n    unsigned long addr = inet_addr(hostName);\n    hp = gethostbyaddr((char *)&addr, sizeof(addr), AF_INET);\n    }\n\n  if (!hp)\n    {\n    \/\/ vtkErrorMacro(\"Unknown host: \" << hostName);\n    return -1;\n    }\n\n  struct sockaddr_in name;\n  name.sin_family = AF_INET;\n  memcpy(&name.sin_addr, hp->h_addr, hp->h_length);\n  name.sin_port = htons(port);\n\n  return connect(socketdescriptor, reinterpret_cast<sockaddr*>(&name), \n    sizeof(name));\n}\n\n\/\/-----------------------------------------------------------------------------\nint vtkSocket::GetPort(int sock)\n{\n  struct sockaddr_in sockinfo;\n  memset(&sockinfo, 0, sizeof(sockinfo));\n#if defined(VTK_HAVE_GETSOCKNAME_WITH_SOCKLEN_T)\n  socklen_t sizebuf = sizeof(sockinfo);\n#else\n  int sizebuf = sizeof(sockinfo);\n#endif\n  if(getsockname(sock, reinterpret_cast<sockaddr*>(&sockinfo), &sizebuf) != 0)\n    {\n    return 0;\n    }\n  return ntohs(sockinfo.sin_port);\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkSocket::CloseSocket(int socketdescriptor)\n{\n  if (socketdescriptor < 0)\n    {\n    return;\n    }\n  vtkCloseSocketMacro(socketdescriptor);\n}\n\n\/\/-----------------------------------------------------------------------------\nint vtkSocket::Send(void* data, int length)\n{\n  if (!this->GetConnected())\n    {\n    return 0;\n    }\n  if (length == 0)\n    {\n    \/\/ nothing to send.\n    return 1;\n    }\n  char* buffer = reinterpret_cast<char*>(data);\n  int total = 0;\n  do\n    {\n    int n = send(this->SocketDescriptor, buffer+total, length-total, MSG_NOSIGNAL);\n    if(n < 0)\n      {\n      vtkErrorMacro(\"Socket Error: Send failed.\");\n      return 0;\n      }\n    total += n;\n    } while(total < length);\n  return 1;\n}\n\n\/\/-----------------------------------------------------------------------------\nint vtkSocket::Receive(void* data, int length, int readFully\/*=1*\/)\n{\n  if (!this->GetConnected())\n    {\n    return 0;\n    }\n\n  char* buffer = reinterpret_cast<char*>(data);\n  int total = 0;\n  do\n    {\n#if defined(_WIN32) && !defined(__CYGWIN__)\n    int trys = 0;\n#endif\n    int n = recv(this->SocketDescriptor, buffer+total, length-total, 0);\n    if(n < 1)\n      {\n#if defined(_WIN32) && !defined(__CYGWIN__)\n      \/\/ On long messages, Windows recv sometimes fails with WSAENOBUFS, but\n      \/\/ will work if you try again.\n      int error = WSAGetLastError();\n      if ((error == WSAENOBUFS) && (trys++ < 1000))\n        {\n        Sleep(1);\n        continue;\n        }\n#endif\n      vtkErrorMacro(\"Socket Error: Receive failed.\");\n      return 0;\n      }\n    total += n;\n    } while(readFully && total < length);\n  return total;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkSocket::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os, indent);\n  os << indent << \"SocketDescriptor: \" << this->SocketDescriptor << endl;\n}\n<commit_msg>BUG: fixed build issues on Windows<commit_after>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkSocket.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 \"vtkSocket.h\"\n\n#include \"vtkObjectFactory.h\"\n\n#if defined(_WIN32) && !defined(__CYGWIN__)\n  #define VTK_WINDOWS_FULL\n  #include \"vtkWindows.h\"\n#else\n  #include <sys\/types.h>\n  #include <sys\/socket.h>\n  #include <netinet\/in.h>\n  #include <netinet\/tcp.h>\n  #include <arpa\/inet.h>\n  #include <netdb.h>\n  #include <unistd.h>\n  #include <sys\/time.h>\n#endif\n\n#if defined(_WIN32) && !defined(__CYGWIN__)\n#define WSA_VERSION MAKEWORD(1,1)\n#define vtkCloseSocketMacro(sock) (closesocket(sock))\n#else\n#define vtkCloseSocketMacro(sock) (close(sock))\n#endif\n\nvtkCxxRevisionMacro(vtkSocket, \"1.2\");\n\/\/-----------------------------------------------------------------------------\nvtkSocket::vtkSocket()\n{\n  this->SocketDescriptor = -1;\n  \n}\n\n\/\/-----------------------------------------------------------------------------\nvtkSocket::~vtkSocket()\n{\n  if (this->SocketDescriptor != -1)\n    {\n    this->CloseSocket(this->SocketDescriptor);\n    this->SocketDescriptor = -1;\n    }\n}\n\n\/\/-----------------------------------------------------------------------------\nint vtkSocket::CreateSocket()\n{\n  int sock = socket(AF_INET, SOCK_STREAM, 0);\n  \/\/ Elimate windows 0.2 second delay sending (buffering) data.\n  int on = 1;\n  if (setsockopt(sock, IPPROTO_TCP, TCP_NODELAY, (char*)&on, sizeof(on)))\n    {\n    return -1;\n    }\n  return sock;\n}\n\n\/\/-----------------------------------------------------------------------------\nint vtkSocket::BindSocket(int socketdescriptor, int port)\n{\n  struct sockaddr_in server;\n\n  server.sin_family = AF_INET;\n  server.sin_addr.s_addr = INADDR_ANY;\n  server.sin_port = htons(port);\n  \/\/ Allow the socket to be bound to an address that is already in use\n  int opt=1;\n#ifdef _WIN32\n  setsockopt(socketdescriptor, SOL_SOCKET, SO_REUSEADDR, (char*) &opt, sizeof(int));\n#else\n  setsockopt(socketdescriptor, SOL_SOCKET, SO_REUSEADDR, (void *) &opt, sizeof(int));\n#endif\n\n  if ( bind(socketdescriptor, reinterpret_cast<sockaddr*>(&server), sizeof(server)) )\n    {\n    return -1;\n    }\n  return 0;\n}\n\n\/\/-----------------------------------------------------------------------------\nint vtkSocket::Accept(int socketdescriptor)\n{\n  if (socketdescriptor < 0)\n    {\n    return -1;\n    }\n  return accept(socketdescriptor, 0, 0);\n}\n\n\/\/-----------------------------------------------------------------------------\nint vtkSocket::Listen(int socketdescriptor)\n{\n  if (socketdescriptor < 0)\n    {\n    return -1;\n    }\n  return listen(socketdescriptor, 1);\n}\n\n\/\/-----------------------------------------------------------------------------\nint vtkSocket::SelectSocket(int socketdescriptor, unsigned long msec)\n{\n  if (socketdescriptor < 0 )\n    {\n    \/\/ invalid socket descriptor.\n    return -1;\n    }\n  \n  fd_set rset;\n  struct timeval tval;\n  struct timeval* tvalptr = 0;\n  if ( msec > 0 )\n    {\n    tval.tv_sec = msec \/ 1000;\n    tval.tv_usec = (msec % 1000)*1000;\n    tvalptr = &tval;\n    }\n  FD_ZERO(&rset);\n  FD_SET(socketdescriptor, &rset);\n  int res = select(socketdescriptor + 1, &rset, 0, 0, tvalptr);\n  if(res == 0)\n    {\n    return 0;\/\/for time limit expire\n    }\n\n  if ( res < 0 || !(FD_ISSET(socketdescriptor, &rset)) )\n    {\n    \/\/ Some error.\n    return -1;\n    }\n  \/\/ The indicated socket has some activity on it.\n  return 1;\n}\n\n\/\/-----------------------------------------------------------------------------\nint vtkSocket::SelectSockets(const int* sockets_to_select, int size,\n    unsigned long msec, int* selected_index)\n{\n  int i;\n  int max_fd = -1;\n  *selected_index = -1;\n  if (size <  0)\n    {\n    return -1;\n    }\n  \n  fd_set rset;\n  struct timeval tval;\n  struct timeval* tvalptr = 0;\n  if ( msec > 0 )\n    {\n    tval.tv_sec = msec \/ 1000;\n    tval.tv_usec = msec % 1000;\n    tvalptr = &tval;\n    }\n  FD_ZERO(&rset);\n  for (i=0; i<size; i++)\n    {\n    FD_SET(sockets_to_select[i],&rset);\n    max_fd = (sockets_to_select[i] > max_fd)? sockets_to_select[i] : max_fd;\n    }\n  \n  int res = select(max_fd + 1, &rset, 0, 0, tvalptr);\n  if (res == 0)\n    {\n    return 0; \/\/Timeout\n    }\n  if (res < 0)\n    {\n    \/\/ SelectSocket error.\n    return -1;\n    }\n  \n  \/\/check which socket has some activity.\n  for (i=0; i<size; i++)\n    {\n    if ( FD_ISSET(sockets_to_select[i],&rset) )\n      {\n      *selected_index = i;\n      return 1;\n      }\n    }\n  return -1; \n}\n\n\/\/-----------------------------------------------------------------------------\nint vtkSocket::Connect(int socketdescriptor, const char* hostName, int port)\n{\n  if (socketdescriptor < 0)\n    {\n    return -1;\n    }\n\n  struct hostent* hp;\n  hp = gethostbyname(hostName);\n  if (!hp)\n    {\n    unsigned long addr = inet_addr(hostName);\n    hp = gethostbyaddr((char *)&addr, sizeof(addr), AF_INET);\n    }\n\n  if (!hp)\n    {\n    \/\/ vtkErrorMacro(\"Unknown host: \" << hostName);\n    return -1;\n    }\n\n  struct sockaddr_in name;\n  name.sin_family = AF_INET;\n  memcpy(&name.sin_addr, hp->h_addr, hp->h_length);\n  name.sin_port = htons(port);\n\n  return connect(socketdescriptor, reinterpret_cast<sockaddr*>(&name), \n    sizeof(name));\n}\n\n\/\/-----------------------------------------------------------------------------\nint vtkSocket::GetPort(int sock)\n{\n  struct sockaddr_in sockinfo;\n  memset(&sockinfo, 0, sizeof(sockinfo));\n#if defined(VTK_HAVE_GETSOCKNAME_WITH_SOCKLEN_T)\n  socklen_t sizebuf = sizeof(sockinfo);\n#else\n  int sizebuf = sizeof(sockinfo);\n#endif\n  if(getsockname(sock, reinterpret_cast<sockaddr*>(&sockinfo), &sizebuf) != 0)\n    {\n    return 0;\n    }\n  return ntohs(sockinfo.sin_port);\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkSocket::CloseSocket(int socketdescriptor)\n{\n  if (socketdescriptor < 0)\n    {\n    return;\n    }\n  vtkCloseSocketMacro(socketdescriptor);\n}\n\n\/\/-----------------------------------------------------------------------------\nint vtkSocket::Send(void* data, int length)\n{\n  if (!this->GetConnected())\n    {\n    return 0;\n    }\n  if (length == 0)\n    {\n    \/\/ nothing to send.\n    return 1;\n    }\n  char* buffer = reinterpret_cast<char*>(data);\n  int total = 0;\n  do\n    {\n    int flags;\n#if defined(_WIN32) && !defined(__CYGWIN__)\n    flags = 0;\n#else\n    flags = MSG_NOSIGNAL; \/\/disable signal on Unix boxes.\n#endif\n    int n = send(this->SocketDescriptor, buffer+total, length-total, flags);\n    if(n < 0)\n      {\n      vtkErrorMacro(\"Socket Error: Send failed.\");\n      return 0;\n      }\n    total += n;\n    } while(total < length);\n  return 1;\n}\n\n\/\/-----------------------------------------------------------------------------\nint vtkSocket::Receive(void* data, int length, int readFully\/*=1*\/)\n{\n  if (!this->GetConnected())\n    {\n    return 0;\n    }\n\n  char* buffer = reinterpret_cast<char*>(data);\n  int total = 0;\n  do\n    {\n#if defined(_WIN32) && !defined(__CYGWIN__)\n    int trys = 0;\n#endif\n    int n = recv(this->SocketDescriptor, buffer+total, length-total, 0);\n    if(n < 1)\n      {\n#if defined(_WIN32) && !defined(__CYGWIN__)\n      \/\/ On long messages, Windows recv sometimes fails with WSAENOBUFS, but\n      \/\/ will work if you try again.\n      int error = WSAGetLastError();\n      if ((error == WSAENOBUFS) && (trys++ < 1000))\n        {\n        Sleep(1);\n        continue;\n        }\n#endif\n      vtkErrorMacro(\"Socket Error: Receive failed.\");\n      return 0;\n      }\n    total += n;\n    } while(readFully && total < length);\n  return total;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkSocket::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os, indent);\n  os << indent << \"SocketDescriptor: \" << this->SocketDescriptor << endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"utilities.h\"\r\n\r\n\/\/ C++\r\n#include <string>\r\n\r\n\/\/ C\r\n#include <stdio.h>\r\n#include <stdlib.h>\r\n#include <string.h>\r\n#include <limits.h>\r\n\r\n\/\/ FILE and fxxx()\r\n#ifndef _WIN32\r\n#include <unistd.h>\r\n#else\r\n#include <io.h>\r\n#endif\r\n\r\n\/\/ custom\r\n#include \"synchronize.h\"\r\n#include \"json.h\"\r\n\r\nchar* Utilities::CreateCharBuffer(Handle<String> v8String)\r\n{\r\n    char* charBuffer = (char*)malloc(v8String->Length() + 1);\r\n    memset(charBuffer, 0, v8String->Length() + 1);\r\n    String::AsciiValue bufferValue(v8String);\r\n    memcpy(charBuffer, *bufferValue, v8String->Length());\r\n\r\n    return charBuffer;\r\n}\r\n\r\n\/\/ taken from examples given at: http:\/\/izs.me\/v8-docs\/classv8_1_1String_1_1Utf8Value.html\r\nconst char* Utilities::ToCString(const String::Utf8Value& value)\r\n{\r\n    return *value ? *value : \"<string conversion failed>\";\r\n}\r\n\r\nconst char* Utilities::ReadFile(const char* fileName, int* fileSize)\r\n{\r\n    \/\/ reference to c-string version of file\r\n    char *fileBuffer = 0;\r\n\r\n    \/\/ attempt to open the file\r\n    FILE* fd = fopen(fileName, \"rb\");\r\n\r\n    \/\/ clear file size\r\n    *fileSize = 0;\r\n\r\n    \/\/ file was valid\r\n    if(fd != 0)\r\n    {\r\n        \/\/ get size of file\r\n        fseek(fd, 0, SEEK_END);\r\n        *fileSize = ftell(fd);\r\n        rewind(fd);\r\n\r\n        \/\/ allocate file buffer for file contents\r\n        fileBuffer = (char*)malloc(*fileSize + 1);\r\n        fileBuffer[*fileSize] = 0;\r\n\r\n        \/\/ copy file contents\r\n        for (int charCount = 0; charCount < *fileSize;)\r\n        {\r\n            int charRead = static_cast<int>(fread(&fileBuffer[charCount], 1, *fileSize - charCount, fd));\r\n            charCount += charRead;\r\n        }\r\n\r\n        \/\/ close the file\r\n        fclose(fd);\r\n    }\r\n\r\n    return fileBuffer;\r\n}\r\n\r\n\/\/ https:\/\/code.google.com\/p\/v8\/source\/browse\/trunk\/samples\/shell.cc\r\nchar* Utilities::HandleException(TryCatch* tryCatch, bool createExceptionObject)\r\n{\r\n    \/\/ return value\r\n    char* exceptionBuffer = NULL;\r\n\r\n    \/\/ create scope for exception\r\n    HandleScope handleScope;\r\n\r\n    \/\/ get the exception message\r\n    Handle<Message> exceptionMessage = tryCatch->Message();\r\n\r\n    \/\/ the exception message was not valid\r\n    if (exceptionMessage.IsEmpty())\r\n    {\r\n        \/\/ build exception object if required\r\n        if(createExceptionObject == true)\r\n        {\r\n            Handle<Object> exceptionObject = Object::New();\r\n            exceptionObject->Set(String::NewSymbol(\"message\"), tryCatch->Exception());\r\n            exceptionBuffer = JSON::Stringify(exceptionObject);\r\n        }\r\n    } \r\n    \/\/ there was a valid message attached to the exception\r\n    else\r\n    {\r\n        \/\/ build exception object if required\r\n        if(createExceptionObject == true)\r\n        {\r\n            Handle<Object> exceptionObject = Object::New();\r\n\r\n            exceptionObject->Set(String::NewSymbol(\"message\"), tryCatch->Message()->Get());\r\n            exceptionObject->Set(String::NewSymbol(\"resourceName\"), exceptionMessage->GetScriptResourceName());\r\n            exceptionObject->Set(String::NewSymbol(\"lineNum\"), Number::New(exceptionMessage->GetLineNumber()));\r\n            exceptionObject->Set(String::NewSymbol(\"sourceLine\"), exceptionMessage->GetSourceLine());\r\n            exceptionObject->Set(String::NewSymbol(\"scriptData\"), exceptionMessage->GetScriptData());\r\n            if(!tryCatch->StackTrace().IsEmpty())\r\n            {\r\n                exceptionObject->Set(String::NewSymbol(\"stackTrace\"), tryCatch->StackTrace());\r\n            }\r\n            else\r\n            {\r\n                exceptionObject->Set(String::NewSymbol(\"stackTrace\"), Null());\r\n            }\r\n\r\n            exceptionBuffer = JSON::Stringify(exceptionObject);\r\n        }\r\n    }\r\n\r\n    return exceptionBuffer;\r\n}\r\n\r\nvoid Utilities::PrintObjectProperties(Handle<Object> objectHandle)\r\n{\r\n    Local<Array> propertyKeys = (*objectHandle)->GetPropertyNames();\r\n    for (uint32_t keyIndex = 0; keyIndex < propertyKeys->Length(); keyIndex++)\r\n    {\r\n        Handle<v8::String> keyString = propertyKeys->Get(keyIndex)->ToString();\r\n        String::AsciiValue propertyName(keyString);\r\n        fprintf(stdout, \"[ Property %u ] %s\\n\", keyIndex, *propertyName);\r\n    }\r\n}\r\n\r\nFILE_INFO* Utilities::GetFileInfo(const char* relativePath, const char* currentDirectory)\r\n{\r\n    \/\/ return value\r\n    FILE_INFO* fileInfo = (FILE_INFO*)malloc(sizeof(FILE_INFO));\r\n    memset(fileInfo, 0, sizeof(FILE_INFO));\r\n\r\n    \/\/ check if relative path should be combined with current directory\r\n    std::string filePath(relativePath);\r\n    if((currentDirectory != NULL) && (strlen(relativePath) > 2))\r\n    {\r\n        \/\/ combine current directory to relative path if it starts with '.\/' or '..\/'\r\n        if(((relativePath[0] == '.') && ((relativePath[1] == '\\\\') || (relativePath[1] == '\/'))) ||\r\n            (relativePath[0] == '.' && relativePath[1] == '.' && ((relativePath[2] == '\\\\') || (relativePath[2] == '\/'))))\r\n        {\r\n            filePath.insert(0, currentDirectory);\r\n        }\r\n    }\r\n\r\n    \/\/ get the full path of the file\r\n    #ifdef _WIN32\r\n        \/\/ http:\/\/msdn.microsoft.com\/en-us\/library\/506720ff.aspx\r\n        fileInfo->fullPath = (const char*)malloc(_MAX_PATH);\r\n        memset((void*)fileInfo->fullPath, 0, _MAX_PATH);\r\n        _fullpath((char*)fileInfo->fullPath, filePath.c_str(), _MAX_PATH);\r\n        \r\n        \/\/ http:\/\/msdn.microsoft.com\/en-us\/library\/a2xs1dts.aspx\r\n        if((_access_s((char*)fileInfo->fullPath, 0 )) == -1)\r\n        {\r\n            \/\/fprintf(stdout, \"[ Utilities - Error ] Invalid File: %s\\n\", filePath.c_str());\r\n            free((void*)fileInfo->fullPath);\r\n            fileInfo->fullPath = 0;\r\n        }\r\n    #else\r\n        fileInfo->fullPath = (char*)malloc(PATH_MAX);\r\n        memset((void*)fileInfo->fullPath, 0, PATH_MAX);\r\n        if(realpath(filePath.c_str(), (char *)fileInfo->fullPath) == NULL)\r\n        {\r\n            \/\/fprintf(stdout, \"[ Utilities - Error ] Invalid File: %s\\n\", filePath.c_str());\r\n            free((void*)fileInfo->fullPath);\r\n            fileInfo->fullPath = 0;\r\n        }\r\n    #endif\r\n\r\n    \/\/ path is valid\r\n    if(fileInfo->fullPath != 0)\r\n    {\r\n        \/\/ get the file name only\r\n        \/\/ http:\/\/stackoverflow.com\/a\/5902743\r\n        const char *charPtr = fileInfo->fullPath + strlen(fileInfo->fullPath);\r\n        for (; charPtr > fileInfo->fullPath; charPtr--)\r\n        {\r\n            if ((*charPtr == '\\\\') || (*charPtr == '\/'))\r\n            {\r\n                fileInfo->fileName = ++charPtr;\r\n                break;\r\n            }\r\n        }\r\n\r\n        \/\/ allocate and store the folder only path\r\n        unsigned int folderPathLength = strlen(fileInfo->fullPath) - strlen(fileInfo->fileName);\r\n        fileInfo->folderPath = (const char*)malloc(folderPathLength + 1);\r\n        memset((void*)fileInfo->folderPath, 0, folderPathLength + 1);\r\n        memcpy((void*)fileInfo->folderPath, fileInfo->fullPath, folderPathLength);\r\n\r\n        \/\/ allocate file buffer\r\n        fileInfo->fileBuffer = Utilities::ReadFile(fileInfo->fullPath, &(fileInfo->fileBufferLength));\r\n    }\r\n\r\n    \/\/fprintf(stdout, \"[ Utilities - File ] Full Path: %s\\n\", fileInfo->fullPath);\r\n    \/\/fprintf(stdout, \"[ Utilities - File ] Folder Path: %s\\n\", fileInfo->folderPath);\r\n    \/\/fprintf(stdout, \"[ Utilities - File ] File Name: %s\\n\", fileInfo->fileName);\r\n\r\n    return fileInfo;\r\n}\r\n\r\nvoid Utilities::FreeFileInfo(const FILE_INFO* fileInfo)\r\n{\r\n    free((void*)fileInfo->fullPath);\r\n    free((void*)fileInfo->folderPath);\r\n    free((void*)fileInfo->fileBuffer);\r\n\r\n    free((FILE_INFO*)fileInfo);\r\n}<commit_msg>Fixed the check for invalid file on windows since _access_s returns 0 on success.<commit_after>#include \"utilities.h\"\r\n\r\n\/\/ C++\r\n#include <string>\r\n\r\n\/\/ C\r\n#include <stdio.h>\r\n#include <stdlib.h>\r\n#include <string.h>\r\n#include <limits.h>\r\n\r\n\/\/ FILE and fxxx()\r\n#ifndef _WIN32\r\n#include <unistd.h>\r\n#else\r\n#include <io.h>\r\n#endif\r\n\r\n\/\/ custom\r\n#include \"synchronize.h\"\r\n#include \"json.h\"\r\n\r\nchar* Utilities::CreateCharBuffer(Handle<String> v8String)\r\n{\r\n    char* charBuffer = (char*)malloc(v8String->Length() + 1);\r\n    memset(charBuffer, 0, v8String->Length() + 1);\r\n    String::AsciiValue bufferValue(v8String);\r\n    memcpy(charBuffer, *bufferValue, v8String->Length());\r\n\r\n    return charBuffer;\r\n}\r\n\r\n\/\/ taken from examples given at: http:\/\/izs.me\/v8-docs\/classv8_1_1String_1_1Utf8Value.html\r\nconst char* Utilities::ToCString(const String::Utf8Value& value)\r\n{\r\n    return *value ? *value : \"<string conversion failed>\";\r\n}\r\n\r\nconst char* Utilities::ReadFile(const char* fileName, int* fileSize)\r\n{\r\n    \/\/ reference to c-string version of file\r\n    char *fileBuffer = 0;\r\n\r\n    \/\/ attempt to open the file\r\n    FILE* fd = fopen(fileName, \"rb\");\r\n\r\n    \/\/ clear file size\r\n    *fileSize = 0;\r\n\r\n    \/\/ file was valid\r\n    if(fd != 0)\r\n    {\r\n        \/\/ get size of file\r\n        fseek(fd, 0, SEEK_END);\r\n        *fileSize = ftell(fd);\r\n        rewind(fd);\r\n\r\n        \/\/ allocate file buffer for file contents\r\n        fileBuffer = (char*)malloc(*fileSize + 1);\r\n        fileBuffer[*fileSize] = 0;\r\n\r\n        \/\/ copy file contents\r\n        for (int charCount = 0; charCount < *fileSize;)\r\n        {\r\n            int charRead = static_cast<int>(fread(&fileBuffer[charCount], 1, *fileSize - charCount, fd));\r\n            charCount += charRead;\r\n        }\r\n\r\n        \/\/ close the file\r\n        fclose(fd);\r\n    }\r\n\r\n    return fileBuffer;\r\n}\r\n\r\n\/\/ https:\/\/code.google.com\/p\/v8\/source\/browse\/trunk\/samples\/shell.cc\r\nchar* Utilities::HandleException(TryCatch* tryCatch, bool createExceptionObject)\r\n{\r\n    \/\/ return value\r\n    char* exceptionBuffer = NULL;\r\n\r\n    \/\/ create scope for exception\r\n    HandleScope handleScope;\r\n\r\n    \/\/ get the exception message\r\n    Handle<Message> exceptionMessage = tryCatch->Message();\r\n\r\n    \/\/ the exception message was not valid\r\n    if (exceptionMessage.IsEmpty())\r\n    {\r\n        \/\/ build exception object if required\r\n        if(createExceptionObject == true)\r\n        {\r\n            Handle<Object> exceptionObject = Object::New();\r\n            exceptionObject->Set(String::NewSymbol(\"message\"), tryCatch->Exception());\r\n            exceptionBuffer = JSON::Stringify(exceptionObject);\r\n        }\r\n    } \r\n    \/\/ there was a valid message attached to the exception\r\n    else\r\n    {\r\n        \/\/ build exception object if required\r\n        if(createExceptionObject == true)\r\n        {\r\n            Handle<Object> exceptionObject = Object::New();\r\n\r\n            exceptionObject->Set(String::NewSymbol(\"message\"), tryCatch->Message()->Get());\r\n            exceptionObject->Set(String::NewSymbol(\"resourceName\"), exceptionMessage->GetScriptResourceName());\r\n            exceptionObject->Set(String::NewSymbol(\"lineNum\"), Number::New(exceptionMessage->GetLineNumber()));\r\n            exceptionObject->Set(String::NewSymbol(\"sourceLine\"), exceptionMessage->GetSourceLine());\r\n            exceptionObject->Set(String::NewSymbol(\"scriptData\"), exceptionMessage->GetScriptData());\r\n            if(!tryCatch->StackTrace().IsEmpty())\r\n            {\r\n                exceptionObject->Set(String::NewSymbol(\"stackTrace\"), tryCatch->StackTrace());\r\n            }\r\n            else\r\n            {\r\n                exceptionObject->Set(String::NewSymbol(\"stackTrace\"), Null());\r\n            }\r\n\r\n            exceptionBuffer = JSON::Stringify(exceptionObject);\r\n        }\r\n    }\r\n\r\n    return exceptionBuffer;\r\n}\r\n\r\nvoid Utilities::PrintObjectProperties(Handle<Object> objectHandle)\r\n{\r\n    Local<Array> propertyKeys = (*objectHandle)->GetPropertyNames();\r\n    for (uint32_t keyIndex = 0; keyIndex < propertyKeys->Length(); keyIndex++)\r\n    {\r\n        Handle<v8::String> keyString = propertyKeys->Get(keyIndex)->ToString();\r\n        String::AsciiValue propertyName(keyString);\r\n        fprintf(stdout, \"[ Property %u ] %s\\n\", keyIndex, *propertyName);\r\n    }\r\n}\r\n\r\nFILE_INFO* Utilities::GetFileInfo(const char* relativePath, const char* currentDirectory)\r\n{\r\n    \/\/ return value\r\n    FILE_INFO* fileInfo = (FILE_INFO*)malloc(sizeof(FILE_INFO));\r\n    memset(fileInfo, 0, sizeof(FILE_INFO));\r\n\r\n    \/\/ check if relative path should be combined with current directory\r\n    std::string filePath(relativePath);\r\n    if((currentDirectory != NULL) && (strlen(relativePath) > 2))\r\n    {\r\n        \/\/ combine current directory to relative path if it starts with '.\/' or '..\/'\r\n        if(((relativePath[0] == '.') && ((relativePath[1] == '\\\\') || (relativePath[1] == '\/'))) ||\r\n            (relativePath[0] == '.' && relativePath[1] == '.' && ((relativePath[2] == '\\\\') || (relativePath[2] == '\/'))))\r\n        {\r\n            filePath.insert(0, currentDirectory);\r\n        }\r\n    }\r\n\r\n    \/\/ get the full path of the file\r\n    #ifdef _WIN32\r\n        \/\/ http:\/\/msdn.microsoft.com\/en-us\/library\/506720ff.aspx\r\n        fileInfo->fullPath = (const char*)malloc(_MAX_PATH);\r\n        memset((void*)fileInfo->fullPath, 0, _MAX_PATH);\r\n        _fullpath((char*)fileInfo->fullPath, filePath.c_str(), _MAX_PATH);\r\n        \r\n        \/\/ http:\/\/msdn.microsoft.com\/en-us\/library\/a2xs1dts.aspx\r\n        if((_access_s((char*)fileInfo->fullPath, 0)) != 0)\r\n        {\r\n            \/\/fprintf(stdout, \"[ Utilities - Error ] Invalid File: %s\\n\", filePath.c_str());\r\n            free((void*)fileInfo->fullPath);\r\n            fileInfo->fullPath = 0;\r\n        }\r\n    #else\r\n        fileInfo->fullPath = (char*)malloc(PATH_MAX);\r\n        memset((void*)fileInfo->fullPath, 0, PATH_MAX);\r\n        if(realpath(filePath.c_str(), (char *)fileInfo->fullPath) == NULL)\r\n        {\r\n            \/\/fprintf(stdout, \"[ Utilities - Error ] Invalid File: %s\\n\", filePath.c_str());\r\n            free((void*)fileInfo->fullPath);\r\n            fileInfo->fullPath = 0;\r\n        }\r\n    #endif\r\n\r\n    \/\/ path is valid\r\n    if(fileInfo->fullPath != 0)\r\n    {\r\n        \/\/ get the file name only\r\n        \/\/ http:\/\/stackoverflow.com\/a\/5902743\r\n        const char *charPtr = fileInfo->fullPath + strlen(fileInfo->fullPath);\r\n        for (; charPtr > fileInfo->fullPath; charPtr--)\r\n        {\r\n            if ((*charPtr == '\\\\') || (*charPtr == '\/'))\r\n            {\r\n                fileInfo->fileName = ++charPtr;\r\n                break;\r\n            }\r\n        }\r\n\r\n        \/\/ allocate and store the folder only path\r\n        unsigned int folderPathLength = strlen(fileInfo->fullPath) - strlen(fileInfo->fileName);\r\n        fileInfo->folderPath = (const char*)malloc(folderPathLength + 1);\r\n        memset((void*)fileInfo->folderPath, 0, folderPathLength + 1);\r\n        memcpy((void*)fileInfo->folderPath, fileInfo->fullPath, folderPathLength);\r\n\r\n        \/\/ allocate file buffer\r\n        fileInfo->fileBuffer = Utilities::ReadFile(fileInfo->fullPath, &(fileInfo->fileBufferLength));\r\n    }\r\n\r\n    \/\/fprintf(stdout, \"[ Utilities - File ] Full Path: %s\\n\", fileInfo->fullPath);\r\n    \/\/fprintf(stdout, \"[ Utilities - File ] Folder Path: %s\\n\", fileInfo->folderPath);\r\n    \/\/fprintf(stdout, \"[ Utilities - File ] File Name: %s\\n\", fileInfo->fileName);\r\n\r\n    return fileInfo;\r\n}\r\n\r\nvoid Utilities::FreeFileInfo(const FILE_INFO* fileInfo)\r\n{\r\n    free((void*)fileInfo->fullPath);\r\n    free((void*)fileInfo->folderPath);\r\n    free((void*)fileInfo->fileBuffer);\r\n\r\n    free((FILE_INFO*)fileInfo);\r\n}<|endoftext|>"}
{"text":"<commit_before>#include \"..\/..\/ui.h\"\n#include \"..\/ui-node.h\"\n#include \"nbind\/nbind.h\"\n\nUiOpenTypeFeatures::UiOpenTypeFeatures(uiOpenTypeFeatures *feat) {\n\tf = feat;\n}\n\nUiOpenTypeFeatures::UiOpenTypeFeatures() {\n\tf = uiNewOpenTypeFeatures();\n}\n\nvoid UiOpenTypeFeatures::free() {\n\tuiFreeOpenTypeFeatures(f);\n}\n\nuiOpenTypeFeatures *UiOpenTypeFeatures::getHandle() {\n\treturn f;\n}\n\nUiOpenTypeFeatures *UiOpenTypeFeatures::clone(UiOpenTypeFeatures *f2) {\n\treturn new UiOpenTypeFeatures(uiOpenTypeFeaturesClone(f2->f));\n}\n\nvoid UiOpenTypeFeatures::add(const char *c, uint32_t value) {\n\tuiOpenTypeFeaturesAdd(f, c[0], c[1], c[2], c[3], value);\n}\n\nvoid UiOpenTypeFeatures::remove(const char *c) {\n\tuiOpenTypeFeaturesRemove(f, c[0], c[1], c[2], c[3]);\n}\n\n\/\/ uiOpenTypeFeaturesGet() determines whether the given feature\n\/\/ tag is present in otf. If it is, *value is set to the tag's value and\n\/\/ nonzero is returned. Otherwise, zero is returned.\n\/\/\n\/\/ Note that if uiOpenTypeFeaturesGet() returns zero, value isn't\n\/\/ changed. This is important: if a feature is not present in a\n\/\/ uiOpenTypeFeatures, the feature is NOT treated as if its\n\/\/ value was zero anyway. Script-specific font shaping rules and\n\/\/ font-specific feature settings may use a different default value\n\/\/ for a feature. You should likewise not treat a missing feature as\n\/\/ having a value of zero either. Instead, a missing feature should\n\/\/ be treated as having some unspecified default value.\nint UiOpenTypeFeatures::get(const char *c, uint32_t *value) {\n\treturn uiOpenTypeFeaturesGet(f, c[0], c[1], c[2], c[3], value);\n}\n\nstatic unsigned int UiOpenTypeFeatures__forEach(const uiOpenTypeFeatures *otf, char a, char b, char c, char d, uint32_t value, void *data) {\n\tconst char str[5] = {a, b, c, d, '\\0'};\n\tnbind::cbFunction *cb = (nbind::cbFunction *) data;\n\treturn cb->call<unsigned int>(\n\t\tUiOpenTypeFeatures((uiOpenTypeFeatures*)otf),\n\t\tstr, value, NULL);\n}\n\nvoid UiOpenTypeFeatures::forEach(nbind::cbFunction& cb) {\n\tuiOpenTypeFeaturesForEach(f, UiOpenTypeFeatures__forEach, &cb);\n}\n\nNBIND_CLASS(UiOpenTypeFeatures) {\n\tconstruct<>();\n\tmethod(free);\n\tmethod(clone);\n\tmethod(add);\n\tmethod(remove);\n\tmethod(get);\n\tmethod(forEach);\n}\n<commit_msg>Try to cast the char[] arg to char*<commit_after>#include \"..\/..\/ui.h\"\n#include \"..\/ui-node.h\"\n#include \"nbind\/nbind.h\"\n\nUiOpenTypeFeatures::UiOpenTypeFeatures(uiOpenTypeFeatures *feat) {\n\tf = feat;\n}\n\nUiOpenTypeFeatures::UiOpenTypeFeatures() {\n\tf = uiNewOpenTypeFeatures();\n}\n\nvoid UiOpenTypeFeatures::free() {\n\tuiFreeOpenTypeFeatures(f);\n}\n\nuiOpenTypeFeatures *UiOpenTypeFeatures::getHandle() {\n\treturn f;\n}\n\nUiOpenTypeFeatures *UiOpenTypeFeatures::clone(UiOpenTypeFeatures *f2) {\n\treturn new UiOpenTypeFeatures(uiOpenTypeFeaturesClone(f2->f));\n}\n\nvoid UiOpenTypeFeatures::add(const char *c, uint32_t value) {\n\tuiOpenTypeFeaturesAdd(f, c[0], c[1], c[2], c[3], value);\n}\n\nvoid UiOpenTypeFeatures::remove(const char *c) {\n\tuiOpenTypeFeaturesRemove(f, c[0], c[1], c[2], c[3]);\n}\n\n\/\/ uiOpenTypeFeaturesGet() determines whether the given feature\n\/\/ tag is present in otf. If it is, *value is set to the tag's value and\n\/\/ nonzero is returned. Otherwise, zero is returned.\n\/\/\n\/\/ Note that if uiOpenTypeFeaturesGet() returns zero, value isn't\n\/\/ changed. This is important: if a feature is not present in a\n\/\/ uiOpenTypeFeatures, the feature is NOT treated as if its\n\/\/ value was zero anyway. Script-specific font shaping rules and\n\/\/ font-specific feature settings may use a different default value\n\/\/ for a feature. You should likewise not treat a missing feature as\n\/\/ having a value of zero either. Instead, a missing feature should\n\/\/ be treated as having some unspecified default value.\nint UiOpenTypeFeatures::get(const char *c, uint32_t *value) {\n\treturn uiOpenTypeFeaturesGet(f, c[0], c[1], c[2], c[3], value);\n}\n\nstatic unsigned int UiOpenTypeFeatures__forEach(const uiOpenTypeFeatures *otf, char a, char b, char c, char d, uint32_t value, void *data) {\n\tconst char str[5] = {a, b, c, d, '\\0'};\n\tnbind::cbFunction *cb = (nbind::cbFunction *) data;\n\treturn cb->call<unsigned int>(\n\t\tUiOpenTypeFeatures((uiOpenTypeFeatures*)otf),\n\t\t&str[0], value, NULL);\n}\n\nvoid UiOpenTypeFeatures::forEach(nbind::cbFunction& cb) {\n\tuiOpenTypeFeaturesForEach(f, UiOpenTypeFeatures__forEach, &cb);\n}\n\nNBIND_CLASS(UiOpenTypeFeatures) {\n\tconstruct<>();\n\tmethod(free);\n\tmethod(clone);\n\tmethod(add);\n\tmethod(remove);\n\tmethod(get);\n\tmethod(forEach);\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 \"mitkColorBarAnnotation.h\"\n#include \"mitkLookupTable.h\"\n#include \"mitkLookupTableProperty.h\"\n#include <vtkScalarBarActor.h>\n\nmitk::ColorBarAnnotation::ColorBarAnnotation()\n{\n  SetDrawAnnotations(true);\n\n  SetDrawTickLabels(true);\n\n  SetOrientationToVertical();\n\n  SetMaxNumberOfColors(100);\n  SetNumberOfLabels(4);\n\n  SetAnnotationTextScaling(false);\n\n  SetLookupTable(nullptr);\n}\n\nmitk::ColorBarAnnotation::~ColorBarAnnotation()\n{\n  for (BaseRenderer *renderer : m_LSH.GetRegisteredBaseRenderer())\n  {\n    if (renderer)\n    {\n      this->RemoveFromBaseRenderer(renderer);\n    }\n  }\n}\n\nmitk::ColorBarAnnotation::LocalStorage::~LocalStorage()\n{\n}\n\nmitk::ColorBarAnnotation::LocalStorage::LocalStorage()\n{\n  m_ScalarBarActor = vtkSmartPointer<vtkScalarBarActor>::New();\n}\n\nvoid mitk::ColorBarAnnotation::UpdateVtkAnnotation(mitk::BaseRenderer *renderer)\n{\n  LocalStorage *ls = this->m_LSH.GetLocalStorage(renderer);\n\n  if (ls->IsGenerateDataRequired(renderer, this))\n  {\n    ls->m_ScalarBarActor->SetDrawAnnotations(this->GetDrawAnnotations());\n    ls->m_ScalarBarActor->SetLookupTable(this->GetLookupTable());\n    ls->m_ScalarBarActor->SetOrientation(this->GetOrientation());\n    ls->m_ScalarBarActor->SetDrawTickLabels(this->GetDrawTickLabels());\n    ls->m_ScalarBarActor->SetMaximumNumberOfColors(this->GetMaxNumberOfColors());\n    ls->m_ScalarBarActor->SetNumberOfLabels(this->GetNumberOfLabels());\n    ls->m_ScalarBarActor->SetAnnotationTextScaling(this->GetAnnotationTextScaling());\n    \/\/ manually set position so there is no overlap with mitk logo in 3d renderwindow\n    if (this->GetOrientation() == 1)\n    {\n      ls->m_ScalarBarActor->SetPosition(0.80, 0.15);\n      ls->m_ScalarBarActor->SetWidth(0.15);\n      ls->m_ScalarBarActor->SetHeight(0.85);\n    }\n    else\n    {\n      ls->m_ScalarBarActor->SetPosition(0.03, 0.03);\n      ls->m_ScalarBarActor->SetWidth(0.8);\n      ls->m_ScalarBarActor->SetHeight(0.15);\n    }\n  }\n}\n\nvtkProp *mitk::ColorBarAnnotation::GetVtkProp(BaseRenderer *renderer) const\n{\n  LocalStorage *ls = this->m_LSH.GetLocalStorage(renderer);\n  return ls->m_ScalarBarActor;\n}\n\nvoid mitk::ColorBarAnnotation::SetDrawAnnotations(bool annotations)\n{\n  SetBoolProperty(\"ColorBarAnnotation.DrawAnnotations\", annotations);\n}\n\nbool mitk::ColorBarAnnotation::GetDrawAnnotations() const\n{\n  bool annotations;\n  GetPropertyList()->GetBoolProperty(\"ColorBarAnnotation.DrawAnnotations\", annotations);\n  return annotations;\n}\n\nvoid mitk::ColorBarAnnotation::SetLookupTable(vtkSmartPointer<vtkLookupTable> table)\n{\n  mitk::LookupTable::Pointer lut = mitk::LookupTable::New();\n  mitk::LookupTableProperty::Pointer prop = mitk::LookupTableProperty::New(lut);\n  lut->SetVtkLookupTable(table);\n  prop->SetLookupTable(lut);\n  SetProperty(\"ColorBarAnnotation.LookupTable\", prop.GetPointer());\n}\n\nvtkSmartPointer<vtkLookupTable> mitk::ColorBarAnnotation::GetLookupTable() const\n{\n  mitk::LookupTable::Pointer lut = mitk::LookupTable::New();\n  lut = dynamic_cast<mitk::LookupTableProperty *>(GetPropertyList()->GetProperty(\"ColorBarAnnotation.LookupTable\"))\n          ->GetLookupTable();\n  return lut->GetVtkLookupTable();\n}\n\nvoid mitk::ColorBarAnnotation::SetOrientation(int orientation)\n{\n  SetIntProperty(\"ColorBarAnnotation.Orientation\", orientation);\n}\n\nint mitk::ColorBarAnnotation::GetOrientation() const\n{\n  int orientation;\n  GetPropertyList()->GetIntProperty(\"ColorBarAnnotation.Orientation\", orientation);\n  return orientation;\n}\n\nvoid mitk::ColorBarAnnotation::SetDrawTickLabels(bool ticks)\n{\n  SetBoolProperty(\"ColorBarAnnotation.DrawTicks\", ticks);\n}\n\nbool mitk::ColorBarAnnotation::GetDrawTickLabels() const\n{\n  bool ticks;\n  GetPropertyList()->GetBoolProperty(\"ColorBarAnnotation.DrawTicks\", ticks);\n  return ticks;\n}\n\nvoid mitk::ColorBarAnnotation::SetOrientationToHorizontal()\n{\n  SetOrientation(0);\n}\n\nvoid mitk::ColorBarAnnotation::SetOrientationToVertical()\n{\n  SetOrientation(1);\n}\n\nvoid mitk::ColorBarAnnotation::SetMaxNumberOfColors(int numberOfColors)\n{\n  SetIntProperty(\"ColorBarAnnotation.MaximumNumberOfColors\", numberOfColors);\n}\n\nint mitk::ColorBarAnnotation::GetMaxNumberOfColors() const\n{\n  int numberOfColors;\n  GetPropertyList()->GetIntProperty(\"ColorBarAnnotation.MaximumNumberOfColors\", numberOfColors);\n  return numberOfColors;\n}\n\nvoid mitk::ColorBarAnnotation::SetNumberOfLabels(int numberOfLabels)\n{\n  SetIntProperty(\"ColorBarAnnotation.NumberOfLabels\", numberOfLabels);\n}\n\nint mitk::ColorBarAnnotation::GetNumberOfLabels() const\n{\n  int numberOfLabels;\n  GetPropertyList()->GetIntProperty(\"ColorBarAnnotation.NumberOfLabels\", numberOfLabels);\n  return numberOfLabels;\n}\n\nvoid mitk::ColorBarAnnotation::SetAnnotationTextScaling(bool scale)\n{\n  SetBoolProperty(\"ColorBarAnnotation.ScaleAnnotationText\", scale);\n}\n\nbool mitk::ColorBarAnnotation::GetAnnotationTextScaling() const\n{\n  bool scale;\n  GetPropertyList()->GetBoolProperty(\"ColorBarAnnotation.ScaleAnnotationText\", scale);\n  return scale;\n}\n<commit_msg>set colorbar placement to correct height<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 \"mitkColorBarAnnotation.h\"\n#include \"mitkLookupTable.h\"\n#include \"mitkLookupTableProperty.h\"\n#include <vtkScalarBarActor.h>\n\nmitk::ColorBarAnnotation::ColorBarAnnotation()\n{\n  SetDrawAnnotations(true);\n\n  SetDrawTickLabels(true);\n\n  SetOrientationToVertical();\n\n  SetMaxNumberOfColors(100);\n  SetNumberOfLabels(4);\n\n  SetAnnotationTextScaling(false);\n\n  SetLookupTable(nullptr);\n}\n\nmitk::ColorBarAnnotation::~ColorBarAnnotation()\n{\n  for (BaseRenderer *renderer : m_LSH.GetRegisteredBaseRenderer())\n  {\n    if (renderer)\n    {\n      this->RemoveFromBaseRenderer(renderer);\n    }\n  }\n}\n\nmitk::ColorBarAnnotation::LocalStorage::~LocalStorage()\n{\n}\n\nmitk::ColorBarAnnotation::LocalStorage::LocalStorage()\n{\n  m_ScalarBarActor = vtkSmartPointer<vtkScalarBarActor>::New();\n}\n\nvoid mitk::ColorBarAnnotation::UpdateVtkAnnotation(mitk::BaseRenderer *renderer)\n{\n  LocalStorage *ls = this->m_LSH.GetLocalStorage(renderer);\n\n  if (ls->IsGenerateDataRequired(renderer, this))\n  {\n    ls->m_ScalarBarActor->SetDrawAnnotations(this->GetDrawAnnotations());\n    ls->m_ScalarBarActor->SetLookupTable(this->GetLookupTable());\n    ls->m_ScalarBarActor->SetOrientation(this->GetOrientation());\n    ls->m_ScalarBarActor->SetDrawTickLabels(this->GetDrawTickLabels());\n    ls->m_ScalarBarActor->SetMaximumNumberOfColors(this->GetMaxNumberOfColors());\n    ls->m_ScalarBarActor->SetNumberOfLabels(this->GetNumberOfLabels());\n    ls->m_ScalarBarActor->SetAnnotationTextScaling(this->GetAnnotationTextScaling());\n    \/\/ manually set position so there is no overlap with mitk logo in 3d renderwindow\n    if (this->GetOrientation() == 1)\n    {\n      ls->m_ScalarBarActor->SetPosition(0.80, 0.10);\n      ls->m_ScalarBarActor->SetWidth(0.15);\n      ls->m_ScalarBarActor->SetHeight(0.85);\n    }\n    else\n    {\n      ls->m_ScalarBarActor->SetPosition(0.03, 0.03);\n      ls->m_ScalarBarActor->SetWidth(0.8);\n      ls->m_ScalarBarActor->SetHeight(0.15);\n    }\n  }\n}\n\nvtkProp *mitk::ColorBarAnnotation::GetVtkProp(BaseRenderer *renderer) const\n{\n  LocalStorage *ls = this->m_LSH.GetLocalStorage(renderer);\n  return ls->m_ScalarBarActor;\n}\n\nvoid mitk::ColorBarAnnotation::SetDrawAnnotations(bool annotations)\n{\n  SetBoolProperty(\"ColorBarAnnotation.DrawAnnotations\", annotations);\n}\n\nbool mitk::ColorBarAnnotation::GetDrawAnnotations() const\n{\n  bool annotations;\n  GetPropertyList()->GetBoolProperty(\"ColorBarAnnotation.DrawAnnotations\", annotations);\n  return annotations;\n}\n\nvoid mitk::ColorBarAnnotation::SetLookupTable(vtkSmartPointer<vtkLookupTable> table)\n{\n  mitk::LookupTable::Pointer lut = mitk::LookupTable::New();\n  mitk::LookupTableProperty::Pointer prop = mitk::LookupTableProperty::New(lut);\n  lut->SetVtkLookupTable(table);\n  prop->SetLookupTable(lut);\n  SetProperty(\"ColorBarAnnotation.LookupTable\", prop.GetPointer());\n}\n\nvtkSmartPointer<vtkLookupTable> mitk::ColorBarAnnotation::GetLookupTable() const\n{\n  mitk::LookupTable::Pointer lut = mitk::LookupTable::New();\n  lut = dynamic_cast<mitk::LookupTableProperty *>(GetPropertyList()->GetProperty(\"ColorBarAnnotation.LookupTable\"))\n          ->GetLookupTable();\n  return lut->GetVtkLookupTable();\n}\n\nvoid mitk::ColorBarAnnotation::SetOrientation(int orientation)\n{\n  SetIntProperty(\"ColorBarAnnotation.Orientation\", orientation);\n}\n\nint mitk::ColorBarAnnotation::GetOrientation() const\n{\n  int orientation;\n  GetPropertyList()->GetIntProperty(\"ColorBarAnnotation.Orientation\", orientation);\n  return orientation;\n}\n\nvoid mitk::ColorBarAnnotation::SetDrawTickLabels(bool ticks)\n{\n  SetBoolProperty(\"ColorBarAnnotation.DrawTicks\", ticks);\n}\n\nbool mitk::ColorBarAnnotation::GetDrawTickLabels() const\n{\n  bool ticks;\n  GetPropertyList()->GetBoolProperty(\"ColorBarAnnotation.DrawTicks\", ticks);\n  return ticks;\n}\n\nvoid mitk::ColorBarAnnotation::SetOrientationToHorizontal()\n{\n  SetOrientation(0);\n}\n\nvoid mitk::ColorBarAnnotation::SetOrientationToVertical()\n{\n  SetOrientation(1);\n}\n\nvoid mitk::ColorBarAnnotation::SetMaxNumberOfColors(int numberOfColors)\n{\n  SetIntProperty(\"ColorBarAnnotation.MaximumNumberOfColors\", numberOfColors);\n}\n\nint mitk::ColorBarAnnotation::GetMaxNumberOfColors() const\n{\n  int numberOfColors;\n  GetPropertyList()->GetIntProperty(\"ColorBarAnnotation.MaximumNumberOfColors\", numberOfColors);\n  return numberOfColors;\n}\n\nvoid mitk::ColorBarAnnotation::SetNumberOfLabels(int numberOfLabels)\n{\n  SetIntProperty(\"ColorBarAnnotation.NumberOfLabels\", numberOfLabels);\n}\n\nint mitk::ColorBarAnnotation::GetNumberOfLabels() const\n{\n  int numberOfLabels;\n  GetPropertyList()->GetIntProperty(\"ColorBarAnnotation.NumberOfLabels\", numberOfLabels);\n  return numberOfLabels;\n}\n\nvoid mitk::ColorBarAnnotation::SetAnnotationTextScaling(bool scale)\n{\n  SetBoolProperty(\"ColorBarAnnotation.ScaleAnnotationText\", scale);\n}\n\nbool mitk::ColorBarAnnotation::GetAnnotationTextScaling() const\n{\n  bool scale;\n  GetPropertyList()->GetBoolProperty(\"ColorBarAnnotation.ScaleAnnotationText\", scale);\n  return scale;\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 \"itkVersion.h\"\n#include \"itkMINCTransformIOFactory.h\"\n#include \"itkCreateObjectFunction.h\"\n#include \"itkMINCTransformIO.h\"\n#include \"itkTransformFactory.h\"\n\nnamespace itk\n{\n  void MINCTransformIOFactory::PrintSelf(std::ostream &, Indent) const\n  {}\n\n  MINCTransformIOFactory::MINCTransformIOFactory()\n  {\n    this->RegisterOverride( \"itkTransformIOBaseTemplate\",\n                            \"itkMINCTransformIO\",\n                            \"MINC XFM Transform float IO\",\n                            1,\n                            CreateObjectFunction< MINCTransformIOTemplate< float > >::New() );\n\n    this->RegisterOverride( \"itkTransformIOBaseTemplate\",\n                            \"itkMINCTransformIO\",\n                            \"MINC XFM Transform double IO\",\n                            1,\n                            CreateObjectFunction< MINCTransformIOTemplate< double > >::New() );\n  }\n\n  MINCTransformIOFactory::~MINCTransformIOFactory()\n  {}\n\n  const char *\n  MINCTransformIOFactory::GetITKSourceVersion(void) const\n  {\n    return ITK_SOURCE_VERSION;\n  }\n\n  const char *\n  MINCTransformIOFactory::GetDescription() const\n  {\n    return \"MINC XFM TransformIO Factory, allows the\"\n          \" loading of Minc XFM transforms into insight\";\n  }\n\n  \/\/ Undocumented API used to register during static initialization.\n  \/\/ DO NOT CALL DIRECTLY.\n  static bool MINCTransformIOFactoryHasBeenRegistered;\n\n  void MINCTransformIOFactoryRegister__Private(void)\n  {\n    if( ! MINCTransformIOFactoryHasBeenRegistered )\n    {\n      MINCTransformIOFactoryHasBeenRegistered = true;\n      MINCTransformIOFactory::RegisterOneFactory();\n\n      \/\/TransformFactory< DisplacementFieldTransform<double,3> >::RegisterTransform ();\n      \/\/ register additional transform type\n    }\n  }\n} \/\/ end namespace itk\n<commit_msg>BUG: Missing ITKIOMINC_EXPORT on __Private()<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 \"itkVersion.h\"\n#include \"itkMINCTransformIOFactory.h\"\n#include \"itkCreateObjectFunction.h\"\n#include \"itkMINCTransformIO.h\"\n#include \"itkTransformFactory.h\"\n\nnamespace itk\n{\n  void MINCTransformIOFactory::PrintSelf(std::ostream &, Indent) const\n  {}\n\n  MINCTransformIOFactory::MINCTransformIOFactory()\n  {\n    this->RegisterOverride( \"itkTransformIOBaseTemplate\",\n                            \"itkMINCTransformIO\",\n                            \"MINC XFM Transform float IO\",\n                            1,\n                            CreateObjectFunction< MINCTransformIOTemplate< float > >::New() );\n\n    this->RegisterOverride( \"itkTransformIOBaseTemplate\",\n                            \"itkMINCTransformIO\",\n                            \"MINC XFM Transform double IO\",\n                            1,\n                            CreateObjectFunction< MINCTransformIOTemplate< double > >::New() );\n  }\n\n  MINCTransformIOFactory::~MINCTransformIOFactory()\n  {}\n\n  const char *\n  MINCTransformIOFactory::GetITKSourceVersion(void) const\n  {\n    return ITK_SOURCE_VERSION;\n  }\n\n  const char *\n  MINCTransformIOFactory::GetDescription() const\n  {\n    return \"MINC XFM TransformIO Factory, allows the\"\n          \" loading of Minc XFM transforms into insight\";\n  }\n\n  \/\/ Undocumented API used to register during static initialization.\n  \/\/ DO NOT CALL DIRECTLY.\n  static bool MINCTransformIOFactoryHasBeenRegistered;\n\n  void ITKIOMINC_EXPORT MINCTransformIOFactoryRegister__Private(void)\n  {\n    if( ! MINCTransformIOFactoryHasBeenRegistered )\n    {\n      MINCTransformIOFactoryHasBeenRegistered = true;\n      MINCTransformIOFactory::RegisterOneFactory();\n\n      \/\/TransformFactory< DisplacementFieldTransform<double,3> >::RegisterTransform ();\n      \/\/ register additional transform type\n    }\n  }\n} \/\/ end namespace itk\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* Copyright (C) 2008-2012 J-P Nurmi <jpnurmi@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\n#include \"maintabwidget.h\"\n#include \"sessiontabwidget.h\"\n#include \"settings.h\"\n#include <QShortcut>\n#include <QTabBar>\n\nMainTabWidget::MainTabWidget(QWidget* parent) : TabWidget(parent)\n{\n    setTabPosition(QTabWidget::West);\n    setStyleSheet(\".MainTabWidget::pane { border: 0px; }\");\n\n    connect(this, SIGNAL(currentChanged(int)), this, SLOT(tabActivated(int)));\n    connect(this, SIGNAL(tabMenuRequested(int,QPoint)), this, SLOT(onTabMenuRequested(int,QPoint)));\n\n    d.tabUpShortcut = new QShortcut(this);\n    connect(d.tabUpShortcut, SIGNAL(activated()), this, SLOT(moveToPrevTab()));\n\n    d.tabDownShortcut = new QShortcut(this);\n    connect(d.tabDownShortcut, SIGNAL(activated()), this, SLOT(moveToNextTab()));\n\n    QShortcut* shortcut = new QShortcut(QKeySequence::New, this);\n    connect(shortcut, SIGNAL(activated()), this, SIGNAL(newTabRequested()));\n}\n\nvoid MainTabWidget::tabInserted(int index)\n{\n    TabWidget::tabInserted(index);\n    tabBar()->setVisible(count() > 2);\n}\n\nvoid MainTabWidget::tabRemoved(int index)\n{\n    TabWidget::tabRemoved(index);\n    tabBar()->setVisible(count() > 2);\n}\n\nvoid MainTabWidget::tabActivated(int index)\n{\n    if (index > 0 && index < count() - 1)\n    {\n        SessionTabWidget* tab = qobject_cast<SessionTabWidget*>(widget(index));\n        if (tab)\n        {\n            setWindowFilePath(tab->tabText(tab->currentIndex()));\n            QMetaObject::invokeMethod(tab, \"delayedTabReset\");\n        }\n    }\n}\n\nvoid MainTabWidget::applySettings(const Settings& settings)\n{\n    d.tabUpShortcut->setKey(QKeySequence(settings.shortcuts.value(Settings::TabUp)));\n    d.tabDownShortcut->setKey(QKeySequence(settings.shortcuts.value(Settings::TabDown)));\n\n    QColor color(settings.colors.value(Settings::Highlight));\n    setAlertColor(color);\n    setHighlightColor(color);\n\n    for (int i = 0; i < count(); ++i)\n    {\n        SessionTabWidget* tabWidget = qobject_cast<SessionTabWidget*>(widget(i));\n        if (tabWidget)\n            tabWidget->applySettings(settings);\n    }\n}\n\nvoid MainTabWidget::setSessionTitle(const QString& title)\n{\n    int index = senderIndex();\n    if (index != -1)\n        setTabText(index, title);\n}\n\nvoid MainTabWidget::setInactive(bool inactive)\n{\n    int index = senderIndex();\n    if (index != -1)\n        setTabInactive(index, inactive);\n}\n\nvoid MainTabWidget::setAlerted(bool alerted)\n{\n    int index = senderIndex();\n    if (index != -1)\n        setTabAlert(index, alerted);\n}\n\nvoid MainTabWidget::setHighlighted(bool highlighted)\n{\n    int index = senderIndex();\n    if (index != -1)\n        setTabHighlight(index, highlighted);\n}\n\nint MainTabWidget::senderIndex() const\n{\n    if (!sender() || !sender()->isWidgetType())\n        return -1;\n\n    return indexOf(static_cast<QWidget*>(sender()));\n}\n\nvoid MainTabWidget::onTabMenuRequested(int index, const QPoint& pos)\n{\n    if (index > 0 && index < count() - 1)\n    {\n        SessionTabWidget* tabWidget = qobject_cast<SessionTabWidget*>(widget(index));\n        if (tabWidget)\n            QMetaObject::invokeMethod(tabWidget, \"onTabMenuRequested\", Q_ARG(int, 0), Q_ARG(QPoint, pos));\n    }\n}\n<commit_msg>MainTabWidget: don't ignore first tab, but rely on casting<commit_after>\/*\n* Copyright (C) 2008-2012 J-P Nurmi <jpnurmi@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\n#include \"maintabwidget.h\"\n#include \"sessiontabwidget.h\"\n#include \"settings.h\"\n#include <QShortcut>\n#include <QTabBar>\n\nMainTabWidget::MainTabWidget(QWidget* parent) : TabWidget(parent)\n{\n    setTabPosition(QTabWidget::West);\n    setStyleSheet(\".MainTabWidget::pane { border: 0px; }\");\n\n    connect(this, SIGNAL(currentChanged(int)), this, SLOT(tabActivated(int)));\n    connect(this, SIGNAL(tabMenuRequested(int,QPoint)), this, SLOT(onTabMenuRequested(int,QPoint)));\n\n    d.tabUpShortcut = new QShortcut(this);\n    connect(d.tabUpShortcut, SIGNAL(activated()), this, SLOT(moveToPrevTab()));\n\n    d.tabDownShortcut = new QShortcut(this);\n    connect(d.tabDownShortcut, SIGNAL(activated()), this, SLOT(moveToNextTab()));\n\n    QShortcut* shortcut = new QShortcut(QKeySequence::New, this);\n    connect(shortcut, SIGNAL(activated()), this, SIGNAL(newTabRequested()));\n}\n\nvoid MainTabWidget::tabInserted(int index)\n{\n    TabWidget::tabInserted(index);\n    tabBar()->setVisible(count() > 2);\n}\n\nvoid MainTabWidget::tabRemoved(int index)\n{\n    TabWidget::tabRemoved(index);\n    tabBar()->setVisible(count() > 2);\n}\n\nvoid MainTabWidget::tabActivated(int index)\n{\n    if (index < count() - 1)\n    {\n        SessionTabWidget* tab = qobject_cast<SessionTabWidget*>(widget(index));\n        if (tab)\n        {\n            setWindowFilePath(tab->tabText(tab->currentIndex()));\n            QMetaObject::invokeMethod(tab, \"delayedTabReset\");\n        }\n    }\n}\n\nvoid MainTabWidget::applySettings(const Settings& settings)\n{\n    d.tabUpShortcut->setKey(QKeySequence(settings.shortcuts.value(Settings::TabUp)));\n    d.tabDownShortcut->setKey(QKeySequence(settings.shortcuts.value(Settings::TabDown)));\n\n    QColor color(settings.colors.value(Settings::Highlight));\n    setAlertColor(color);\n    setHighlightColor(color);\n\n    for (int i = 0; i < count(); ++i)\n    {\n        SessionTabWidget* tabWidget = qobject_cast<SessionTabWidget*>(widget(i));\n        if (tabWidget)\n            tabWidget->applySettings(settings);\n    }\n}\n\nvoid MainTabWidget::setSessionTitle(const QString& title)\n{\n    int index = senderIndex();\n    if (index != -1)\n        setTabText(index, title);\n}\n\nvoid MainTabWidget::setInactive(bool inactive)\n{\n    int index = senderIndex();\n    if (index != -1)\n        setTabInactive(index, inactive);\n}\n\nvoid MainTabWidget::setAlerted(bool alerted)\n{\n    int index = senderIndex();\n    if (index != -1)\n        setTabAlert(index, alerted);\n}\n\nvoid MainTabWidget::setHighlighted(bool highlighted)\n{\n    int index = senderIndex();\n    if (index != -1)\n        setTabHighlight(index, highlighted);\n}\n\nint MainTabWidget::senderIndex() const\n{\n    if (!sender() || !sender()->isWidgetType())\n        return -1;\n\n    return indexOf(static_cast<QWidget*>(sender()));\n}\n\nvoid MainTabWidget::onTabMenuRequested(int index, const QPoint& pos)\n{\n    if (index < count() - 1)\n    {\n        SessionTabWidget* tabWidget = qobject_cast<SessionTabWidget*>(widget(index));\n        if (tabWidget)\n            QMetaObject::invokeMethod(tabWidget, \"onTabMenuRequested\", Q_ARG(int, 0), Q_ARG(QPoint, pos));\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright (c) 2013-2016 the Civetweb developers\n * Copyright (c) 2013 No Face Press, LLC\n * License http:\/\/opensource.org\/licenses\/mit-license.php MIT License\n *\/\n\n\/\/ Simple example program on how to use Embedded C++ interface.\n\n#include \"CivetServer.h\"\n\n#ifdef _WIN32\n#include <windows.h>\n#else\n#include <unistd.h>\n#endif\n\n#define DOCUMENT_ROOT \".\"\n#define PORT \"8081\"\n#define EXAMPLE_URI \"\/example\"\n#define EXIT_URI \"\/exit\"\nbool exitNow = false;\n\nclass ExampleHandler : public CivetHandler\n{\n  public:\n\tbool\n\thandleGet(CivetServer *server, struct mg_connection *conn)\n\t{\n\t\tmg_printf(conn,\n\t\t          \"HTTP\/1.1 200 OK\\r\\nContent-Type: \"\n\t\t          \"text\/html\\r\\nConnection: close\\r\\n\\r\\n\");\n\t\tmg_printf(conn, \"<html><body>\\r\\n\");\n\t\tmg_printf(conn,\n\t\t          \"<h2>This is an example text from a C++ handler<\/h2>\\r\\n\");\n\t\tmg_printf(conn,\n\t\t          \"<p>To see a page from the A handler <a \"\n\t\t          \"href=\\\"a\\\">click here<\/a><\/p>\\r\\n\");\n\t\tmg_printf(conn,\n\t\t          \"<p>To see a page from the A handler with a parameter \"\n\t\t          \"<a href=\\\"a?param=1\\\">click here<\/a><\/p>\\r\\n\");\n\t\tmg_printf(conn,\n\t\t          \"<p>To see a page from the A\/B handler <a \"\n\t\t          \"href=\\\"a\/b\\\">click here<\/a><\/p>\\r\\n\");\n\t\tmg_printf(conn,\n\t\t          \"<p>To see a page from the *.foo handler <a \"\n\t\t          \"href=\\\"xy.foo\\\">click here<\/a><\/p>\\r\\n\");\n\t\tmg_printf(conn,\n\t\t          \"<p>To exit <a href=\\\"%s\\\">click here<\/a><\/p>\\r\\n\",\n\t\t          EXIT_URI);\n\t\tmg_printf(conn, \"<\/body><\/html>\\r\\n\");\n\t\treturn true;\n\t}\n};\n\nclass ExitHandler : public CivetHandler\n{\n  public:\n\tbool\n\thandleGet(CivetServer *server, struct mg_connection *conn)\n\t{\n\t\tmg_printf(conn,\n\t\t          \"HTTP\/1.1 200 OK\\r\\nContent-Type: \"\n\t\t          \"text\/plain\\r\\nConnection: close\\r\\n\\r\\n\");\n\t\tmg_printf(conn, \"Bye!\\n\");\n\t\texitNow = true;\n\t\treturn true;\n\t}\n};\n\nclass AHandler : public CivetHandler\n{\n  private:\n\tbool\n\thandleAll(const char *method,\n\t          CivetServer *server,\n\t          struct mg_connection *conn)\n\t{\n\t\tstd::string s = \"\";\n\t\tmg_printf(conn,\n\t\t          \"HTTP\/1.1 200 OK\\r\\nContent-Type: \"\n\t\t          \"text\/html\\r\\nConnection: close\\r\\n\\r\\n\");\n\t\tmg_printf(conn, \"<html><body>\");\n\t\tmg_printf(conn, \"<h2>This is the A handler for \\\"%s\\\" !<\/h2>\", method);\n\t\tif (CivetServer::getParam(conn, \"param\", s)) {\n\t\t\tmg_printf(conn, \"<p>param set to %s<\/p>\", s.c_str());\n\t\t} else {\n\t\t\tmg_printf(conn, \"<p>param not set<\/p>\");\n\t\t}\n\t\tmg_printf(conn, \"<\/body><\/html>\\n\");\n\t\treturn true;\n\t}\n\n  public:\n\tbool\n\thandleGet(CivetServer *server, struct mg_connection *conn)\n\t{\n\t\treturn handleAll(\"GET\", server, conn);\n\t}\n\tbool\n\thandlePost(CivetServer *server, struct mg_connection *conn)\n\t{\n\t\treturn handleAll(\"POST\", server, conn);\n\t}\n};\n\nclass ABHandler : public CivetHandler\n{\n  public:\n\tbool\n\thandleGet(CivetServer *server, struct mg_connection *conn)\n\t{\n\t\tmg_printf(conn,\n\t\t          \"HTTP\/1.1 200 OK\\r\\nContent-Type: \"\n\t\t          \"text\/html\\r\\nConnection: close\\r\\n\\r\\n\");\n\t\tmg_printf(conn, \"<html><body>\");\n\t\tmg_printf(conn, \"<h2>This is the AB handler!!!<\/h2>\");\n\t\tmg_printf(conn, \"<\/body><\/html>\\n\");\n\t\treturn true;\n\t}\n};\n\nclass FooHandler : public CivetHandler\n{\n  public:\n\tbool\n\thandleGet(CivetServer *server, struct mg_connection *conn)\n\t{\n\t\t\/* Handler may access the request info using mg_get_request_info *\/\n\t\tconst struct mg_request_info *req_info = mg_get_request_info(conn);\n\n\t\tmg_printf(conn,\n\t\t          \"HTTP\/1.1 200 OK\\r\\nContent-Type: \"\n\t\t          \"text\/html\\r\\nConnection: close\\r\\n\\r\\n\");\n\n\t\tmg_printf(conn, \"<html><body>\\n\");\n\t\tmg_printf(conn, \"<h2>This is the Foo GET handler!!!<\/h2>\\n\");\n\t\tmg_printf(conn,\n\t\t          \"<p>The request was:<br><pre>%s %s HTTP\/%s<\/pre><\/p>\\n\",\n\t\t          req_info->request_method,\n\t\t          req_info->uri,\n\t\t          req_info->http_version);\n\t\tmg_printf(conn, \"<\/body><\/html>\\n\");\n\n\t\treturn true;\n\t}\n\tbool\n\thandlePost(CivetServer *server, struct mg_connection *conn)\n\t{\n\t\t\/* Handler may access the request info using mg_get_request_info *\/\n\t\tconst struct mg_request_info *req_info = mg_get_request_info(conn);\n\t\tlong long rlen, wlen;\n\t\tlong long nlen = 0;\n\t\tlong long tlen = req_info->content_length;\n\t\tchar buf[1024];\n\n\t\tmg_printf(conn,\n\t\t          \"HTTP\/1.1 200 OK\\r\\nContent-Type: \"\n\t\t          \"text\/html\\r\\nConnection: close\\r\\n\\r\\n\");\n\n\t\tmg_printf(conn, \"<html><body>\\n\");\n\t\tmg_printf(conn, \"<h2>This is the Foo POST handler!!!<\/h2>\\n\");\n\t\tmg_printf(conn,\n\t\t          \"<p>The request was:<br><pre>%s %s HTTP\/%s<\/pre><\/p>\\n\",\n\t\t          req_info->request_method,\n\t\t          req_info->uri,\n\t\t          req_info->http_version);\n\t\tmg_printf(conn, \"<p>Content Length: %li<\/p>\\n\", (long)tlen);\n\t\tmg_printf(conn, \"<pre>\\n\");\n\n\t\twhile (nlen < tlen) {\n\t\t\trlen = tlen - nlen;\n\t\t\tif (rlen > sizeof(buf)) {\n\t\t\t\trlen = sizeof(buf);\n\t\t\t}\n\t\t\trlen = mg_read(conn, buf, (size_t)rlen);\n\t\t\tif (rlen <= 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\twlen = mg_write(conn, buf, (size_t)rlen);\n\t\t\tif (rlen != rlen) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tnlen += wlen;\n\t\t}\n\n\t\tmg_printf(conn, \"\\n<\/pre>\\n\");\n\t\tmg_printf(conn, \"<\/body><\/html>\\n\");\n\n\t\treturn true;\n\t}\n\n    #define fopen_recursive fopen\n\n    bool\n        handlePut(CivetServer *server, struct mg_connection *conn)\n    {\n        \/* Handler may access the request info using mg_get_request_info *\/\n        const struct mg_request_info *req_info = mg_get_request_info(conn);\n        long long rlen, wlen;\n        long long nlen = 0;\n        long long tlen = req_info->content_length;\n        FILE * f;\n        char buf[1024];\n        int fail = 0;\n\n#ifdef _WIN32\n        _snprintf(buf, sizeof(buf), \"D:\\\\somewhere\\\\%s\\\\%s\", req_info->remote_user, req_info->local_uri);\n        buf[sizeof(buf)-1] = 0; \/* TODO: check overflow *\/\n        f = fopen_recursive(buf, \"wb\");\n#else\n        snprintf(buf, sizeof(buf), \"~\/somewhere\/%s\/%s\", req_info->remote_user, req_info->local_uri);\n        buf[sizeof(buf)-1] = 0; \/* TODO: check overflow *\/\n        f = fopen_recursive(buf, \"w\");\n#endif\n\n        if (!f) {\n            fail = 1;\n        } else {\n            while (nlen < tlen) {\n                rlen = tlen - nlen;\n                if (rlen > sizeof(buf)) {\n                    rlen = sizeof(buf);\n                }\n                rlen = mg_read(conn, buf, (size_t)rlen);\n                if (rlen <= 0) {\n                    fail = 1;\n                    break;\n                }\n                wlen = fwrite(buf, 1, (size_t)rlen, f);\n                if (rlen != rlen) {\n                    fail = 1;\n                    break;\n                }\n                nlen += wlen;\n            }\n            fclose(f);\n        }\n\n        if (fail) {\n            mg_printf(conn,\n                \"HTTP\/1.1 409 Conflict\\r\\n\"\n                \"Content-Type: text\/plain\\r\\n\"\n                \"Connection: close\\r\\n\\r\\n\");\n        } else {\n            mg_printf(conn,\n                \"HTTP\/1.1 201 Created\\r\\n\"\n                \"Content-Type: text\/plain\\r\\n\"\n                \"Connection: close\\r\\n\\r\\n\");\n        }\n\n        return true;\n    }\n};\n\n\nint\nmain(int argc, char *argv[])\n{\n\tconst char *options[] = {\n\t    \"document_root\", DOCUMENT_ROOT, \"listening_ports\", PORT, 0};\n    \n    std::vector<std::string> cpp_options;\n    for (int i=0; i<(sizeof(options)\/sizeof(options[0])-1); i++) {\n        cpp_options.push_back(options[i]);\n    }\n\n\t\/\/ CivetServer server(options); \/\/ <-- C style start\n    CivetServer server(cpp_options); \/\/ <-- C++ style start\n\n\tExampleHandler h_ex;\n\tserver.addHandler(EXAMPLE_URI, h_ex);\n\n\tExitHandler h_exit;\n\tserver.addHandler(EXIT_URI, h_exit);\n\n\tAHandler h_a;\n\tserver.addHandler(\"\/a\", h_a);\n\n\tABHandler h_ab;\n\tserver.addHandler(\"\/a\/b\", h_ab);\n\n\tFooHandler h_foo;\n\tserver.addHandler(\"\", h_foo);\n\n\tprintf(\"Browse files at http:\/\/localhost:%s\/\\n\", PORT);\n\tprintf(\"Run example at http:\/\/localhost:%s%s\\n\", PORT, EXAMPLE_URI);\n\tprintf(\"Exit at http:\/\/localhost:%s%s\\n\", PORT, EXIT_URI);\n\n\twhile (!exitNow) {\n#ifdef _WIN32\n\t\tSleep(1000);\n#else\n\t\tsleep(1);\n#endif\n\t}\n\n\tprintf(\"Bye!\\n\");\n\n\treturn 0;\n}\n<commit_msg>Fix TODO in C++ example code<commit_after>\/* Copyright (c) 2013-2016 the Civetweb developers\n * Copyright (c) 2013 No Face Press, LLC\n * License http:\/\/opensource.org\/licenses\/mit-license.php MIT License\n *\/\n\n\/\/ Simple example program on how to use Embedded C++ interface.\n\n#include \"CivetServer.h\"\n\n#ifdef _WIN32\n#include <windows.h>\n#else\n#include <unistd.h>\n#endif\n\n#define DOCUMENT_ROOT \".\"\n#define PORT \"8081\"\n#define EXAMPLE_URI \"\/example\"\n#define EXIT_URI \"\/exit\"\nbool exitNow = false;\n\nclass ExampleHandler : public CivetHandler\n{\n  public:\n\tbool\n\thandleGet(CivetServer *server, struct mg_connection *conn)\n\t{\n\t\tmg_printf(conn,\n\t\t          \"HTTP\/1.1 200 OK\\r\\nContent-Type: \"\n\t\t          \"text\/html\\r\\nConnection: close\\r\\n\\r\\n\");\n\t\tmg_printf(conn, \"<html><body>\\r\\n\");\n\t\tmg_printf(conn,\n\t\t          \"<h2>This is an example text from a C++ handler<\/h2>\\r\\n\");\n\t\tmg_printf(conn,\n\t\t          \"<p>To see a page from the A handler <a \"\n\t\t          \"href=\\\"a\\\">click here<\/a><\/p>\\r\\n\");\n\t\tmg_printf(conn,\n\t\t          \"<p>To see a page from the A handler with a parameter \"\n\t\t          \"<a href=\\\"a?param=1\\\">click here<\/a><\/p>\\r\\n\");\n\t\tmg_printf(conn,\n\t\t          \"<p>To see a page from the A\/B handler <a \"\n\t\t          \"href=\\\"a\/b\\\">click here<\/a><\/p>\\r\\n\");\n\t\tmg_printf(conn,\n\t\t          \"<p>To see a page from the *.foo handler <a \"\n\t\t          \"href=\\\"xy.foo\\\">click here<\/a><\/p>\\r\\n\");\n\t\tmg_printf(conn,\n\t\t          \"<p>To exit <a href=\\\"%s\\\">click here<\/a><\/p>\\r\\n\",\n\t\t          EXIT_URI);\n\t\tmg_printf(conn, \"<\/body><\/html>\\r\\n\");\n\t\treturn true;\n\t}\n};\n\nclass ExitHandler : public CivetHandler\n{\n  public:\n\tbool\n\thandleGet(CivetServer *server, struct mg_connection *conn)\n\t{\n\t\tmg_printf(conn,\n\t\t          \"HTTP\/1.1 200 OK\\r\\nContent-Type: \"\n\t\t          \"text\/plain\\r\\nConnection: close\\r\\n\\r\\n\");\n\t\tmg_printf(conn, \"Bye!\\n\");\n\t\texitNow = true;\n\t\treturn true;\n\t}\n};\n\nclass AHandler : public CivetHandler\n{\n  private:\n\tbool\n\thandleAll(const char *method,\n\t          CivetServer *server,\n\t          struct mg_connection *conn)\n\t{\n\t\tstd::string s = \"\";\n\t\tmg_printf(conn,\n\t\t          \"HTTP\/1.1 200 OK\\r\\nContent-Type: \"\n\t\t          \"text\/html\\r\\nConnection: close\\r\\n\\r\\n\");\n\t\tmg_printf(conn, \"<html><body>\");\n\t\tmg_printf(conn, \"<h2>This is the A handler for \\\"%s\\\" !<\/h2>\", method);\n\t\tif (CivetServer::getParam(conn, \"param\", s)) {\n\t\t\tmg_printf(conn, \"<p>param set to %s<\/p>\", s.c_str());\n\t\t} else {\n\t\t\tmg_printf(conn, \"<p>param not set<\/p>\");\n\t\t}\n\t\tmg_printf(conn, \"<\/body><\/html>\\n\");\n\t\treturn true;\n\t}\n\n  public:\n\tbool\n\thandleGet(CivetServer *server, struct mg_connection *conn)\n\t{\n\t\treturn handleAll(\"GET\", server, conn);\n\t}\n\tbool\n\thandlePost(CivetServer *server, struct mg_connection *conn)\n\t{\n\t\treturn handleAll(\"POST\", server, conn);\n\t}\n};\n\nclass ABHandler : public CivetHandler\n{\n  public:\n\tbool\n\thandleGet(CivetServer *server, struct mg_connection *conn)\n\t{\n\t\tmg_printf(conn,\n\t\t          \"HTTP\/1.1 200 OK\\r\\nContent-Type: \"\n\t\t          \"text\/html\\r\\nConnection: close\\r\\n\\r\\n\");\n\t\tmg_printf(conn, \"<html><body>\");\n\t\tmg_printf(conn, \"<h2>This is the AB handler!!!<\/h2>\");\n\t\tmg_printf(conn, \"<\/body><\/html>\\n\");\n\t\treturn true;\n\t}\n};\n\nclass FooHandler : public CivetHandler\n{\n  public:\n\tbool\n\thandleGet(CivetServer *server, struct mg_connection *conn)\n\t{\n\t\t\/* Handler may access the request info using mg_get_request_info *\/\n\t\tconst struct mg_request_info *req_info = mg_get_request_info(conn);\n\n\t\tmg_printf(conn,\n\t\t          \"HTTP\/1.1 200 OK\\r\\nContent-Type: \"\n\t\t          \"text\/html\\r\\nConnection: close\\r\\n\\r\\n\");\n\n\t\tmg_printf(conn, \"<html><body>\\n\");\n\t\tmg_printf(conn, \"<h2>This is the Foo GET handler!!!<\/h2>\\n\");\n\t\tmg_printf(conn,\n\t\t          \"<p>The request was:<br><pre>%s %s HTTP\/%s<\/pre><\/p>\\n\",\n\t\t          req_info->request_method,\n\t\t          req_info->uri,\n\t\t          req_info->http_version);\n\t\tmg_printf(conn, \"<\/body><\/html>\\n\");\n\n\t\treturn true;\n\t}\n\tbool\n\thandlePost(CivetServer *server, struct mg_connection *conn)\n\t{\n\t\t\/* Handler may access the request info using mg_get_request_info *\/\n\t\tconst struct mg_request_info *req_info = mg_get_request_info(conn);\n\t\tlong long rlen, wlen;\n\t\tlong long nlen = 0;\n\t\tlong long tlen = req_info->content_length;\n\t\tchar buf[1024];\n\n\t\tmg_printf(conn,\n\t\t          \"HTTP\/1.1 200 OK\\r\\nContent-Type: \"\n\t\t          \"text\/html\\r\\nConnection: close\\r\\n\\r\\n\");\n\n\t\tmg_printf(conn, \"<html><body>\\n\");\n\t\tmg_printf(conn, \"<h2>This is the Foo POST handler!!!<\/h2>\\n\");\n\t\tmg_printf(conn,\n\t\t          \"<p>The request was:<br><pre>%s %s HTTP\/%s<\/pre><\/p>\\n\",\n\t\t          req_info->request_method,\n\t\t          req_info->uri,\n\t\t          req_info->http_version);\n\t\tmg_printf(conn, \"<p>Content Length: %li<\/p>\\n\", (long)tlen);\n\t\tmg_printf(conn, \"<pre>\\n\");\n\n\t\twhile (nlen < tlen) {\n\t\t\trlen = tlen - nlen;\n\t\t\tif (rlen > sizeof(buf)) {\n\t\t\t\trlen = sizeof(buf);\n\t\t\t}\n\t\t\trlen = mg_read(conn, buf, (size_t)rlen);\n\t\t\tif (rlen <= 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\twlen = mg_write(conn, buf, (size_t)rlen);\n\t\t\tif (rlen != rlen) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tnlen += wlen;\n\t\t}\n\n\t\tmg_printf(conn, \"\\n<\/pre>\\n\");\n\t\tmg_printf(conn, \"<\/body><\/html>\\n\");\n\n\t\treturn true;\n\t}\n\n    #define fopen_recursive fopen\n\n    bool\n        handlePut(CivetServer *server, struct mg_connection *conn)\n    {\n        \/* Handler may access the request info using mg_get_request_info *\/\n        const struct mg_request_info *req_info = mg_get_request_info(conn);\n        long long rlen, wlen;\n        long long nlen = 0;\n        long long tlen = req_info->content_length;\n        FILE * f;\n        char buf[1024];\n        int fail = 0;\n\n#ifdef _WIN32\n        _snprintf(buf, sizeof(buf), \"D:\\\\somewhere\\\\%s\\\\%s\", req_info->remote_user, req_info->local_uri);\n        buf[sizeof(buf)-1] = 0;\n        if (strlen(buf)>255) {\n            \/* Windows will not work with path > 260 (MAX_PATH), unless we use\n             * the unicode API. However, this is just an example code: A real\n             * code will probably never store anything to D:\\\\somewhere and\n             * must be adapted to the specific needs anyhow. *\/\n            fail = 1;\n            f = NULL;\n        } else {\n            f = fopen_recursive(buf, \"wb\");\n        }\n#else\n        snprintf(buf, sizeof(buf), \"~\/somewhere\/%s\/%s\", req_info->remote_user, req_info->local_uri);\n        buf[sizeof(buf)-1] = 0;\n        if (strlen(buf)>1020) {\n            \/* The string is too long and probably truncated. Make sure an\n             * UTF-8 string is never truncated between the UTF-8 code bytes.\n             * This example code must be adapted to the specific needs. *\/\n            fail = 1;\n            f = NULL;\n        } else {\n            f = fopen_recursive(buf, \"w\");\n        }\n#endif\n\n        if (!f) {\n            fail = 1;\n        } else {\n            while (nlen < tlen) {\n                rlen = tlen - nlen;\n                if (rlen > sizeof(buf)) {\n                    rlen = sizeof(buf);\n                }\n                rlen = mg_read(conn, buf, (size_t)rlen);\n                if (rlen <= 0) {\n                    fail = 1;\n                    break;\n                }\n                wlen = fwrite(buf, 1, (size_t)rlen, f);\n                if (rlen != rlen) {\n                    fail = 1;\n                    break;\n                }\n                nlen += wlen;\n            }\n            fclose(f);\n        }\n\n        if (fail) {\n            mg_printf(conn,\n                \"HTTP\/1.1 409 Conflict\\r\\n\"\n                \"Content-Type: text\/plain\\r\\n\"\n                \"Connection: close\\r\\n\\r\\n\");\n        } else {\n            mg_printf(conn,\n                \"HTTP\/1.1 201 Created\\r\\n\"\n                \"Content-Type: text\/plain\\r\\n\"\n                \"Connection: close\\r\\n\\r\\n\");\n        }\n\n        return true;\n    }\n};\n\n\nint\nmain(int argc, char *argv[])\n{\n\tconst char *options[] = {\n\t    \"document_root\", DOCUMENT_ROOT, \"listening_ports\", PORT, 0};\n    \n    std::vector<std::string> cpp_options;\n    for (int i=0; i<(sizeof(options)\/sizeof(options[0])-1); i++) {\n        cpp_options.push_back(options[i]);\n    }\n\n\t\/\/ CivetServer server(options); \/\/ <-- C style start\n    CivetServer server(cpp_options); \/\/ <-- C++ style start\n\n\tExampleHandler h_ex;\n\tserver.addHandler(EXAMPLE_URI, h_ex);\n\n\tExitHandler h_exit;\n\tserver.addHandler(EXIT_URI, h_exit);\n\n\tAHandler h_a;\n\tserver.addHandler(\"\/a\", h_a);\n\n\tABHandler h_ab;\n\tserver.addHandler(\"\/a\/b\", h_ab);\n\n\tFooHandler h_foo;\n\tserver.addHandler(\"\", h_foo);\n\n\tprintf(\"Browse files at http:\/\/localhost:%s\/\\n\", PORT);\n\tprintf(\"Run example at http:\/\/localhost:%s%s\\n\", PORT, EXAMPLE_URI);\n\tprintf(\"Exit at http:\/\/localhost:%s%s\\n\", PORT, EXIT_URI);\n\n\twhile (!exitNow) {\n#ifdef _WIN32\n\t\tSleep(1000);\n#else\n\t\tsleep(1);\n#endif\n\t}\n\n\tprintf(\"Bye!\\n\");\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* This file is part of VoltDB.\n * Copyright (C) 2008-2013 VoltDB Inc.\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\n#include \"harness.h\"\n#include \"common\/TupleSchema.h\"\n#include \"common\/types.h\"\n#include \"common\/NValue.hpp\"\n#include \"common\/ValueFactory.hpp\"\n#include \"common\/serializeio.h\"\n#include \"execution\/VoltDBEngine.h\"\n#include \"storage\/persistenttable.h\"\n#include \"storage\/tablefactory.h\"\n#include \"storage\/tableutil.h\"\n#include \"indexes\/tableindex.h\"\n#include <vector>\n#include <string>\n#include <stdint.h>\n\nusing namespace voltdb;\n\nclass PersistentTableLogTest : public Test {\npublic:\n    PersistentTableLogTest() {\n        m_engine = new voltdb::VoltDBEngine();\n        int partitionCount = 1;\n        m_engine->initialize(1,1, 0, 0, \"\", DEFAULT_TEMP_TABLE_MEMORY);\n        m_engine->updateHashinator( HASHINATOR_LEGACY, (char*)&partitionCount, NULL, 0);\n\n        m_columnNames.push_back(\"1\");\n        m_columnNames.push_back(\"2\");\n        m_columnNames.push_back(\"3\");\n        m_columnNames.push_back(\"4\");\n        m_columnNames.push_back(\"5\");\n        m_columnNames.push_back(\"6\");\n        m_columnNames.push_back(\"7\");\n        m_columnNames.push_back(\"8\");\n        m_columnNames.push_back(\"9\");\n        m_columnNames.push_back(\"10\");\n\n        m_tableSchemaTypes.push_back(voltdb::VALUE_TYPE_BIGINT);\n        m_tableSchemaTypes.push_back(voltdb::VALUE_TYPE_TINYINT);\n        m_tableSchemaTypes.push_back(voltdb::VALUE_TYPE_INTEGER);\n        m_tableSchemaTypes.push_back(voltdb::VALUE_TYPE_BIGINT);\n        m_tableSchemaTypes.push_back(voltdb::VALUE_TYPE_SMALLINT);\n        m_tableSchemaTypes.push_back(voltdb::VALUE_TYPE_DOUBLE);\n        m_tableSchemaTypes.push_back(voltdb::VALUE_TYPE_VARCHAR);\n        m_tableSchemaTypes.push_back(voltdb::VALUE_TYPE_VARCHAR);\n        m_tableSchemaTypes.push_back(voltdb::VALUE_TYPE_VARCHAR);\n        m_tableSchemaTypes.push_back(voltdb::VALUE_TYPE_VARCHAR);\n\n        m_tableSchemaColumnSizes.push_back(NValue::getTupleStorageSize(voltdb::VALUE_TYPE_BIGINT));\n        m_tableSchemaColumnSizes.push_back(NValue::getTupleStorageSize(voltdb::VALUE_TYPE_TINYINT));\n        m_tableSchemaColumnSizes.push_back(NValue::getTupleStorageSize(voltdb::VALUE_TYPE_INTEGER));\n        m_tableSchemaColumnSizes.push_back(NValue::getTupleStorageSize(voltdb::VALUE_TYPE_BIGINT));\n        m_tableSchemaColumnSizes.push_back(NValue::getTupleStorageSize(voltdb::VALUE_TYPE_SMALLINT));\n        m_tableSchemaColumnSizes.push_back(NValue::getTupleStorageSize(voltdb::VALUE_TYPE_DOUBLE));\n        m_tableSchemaColumnSizes.push_back(300);\n        m_tableSchemaColumnSizes.push_back(16);\n        m_tableSchemaColumnSizes.push_back(500);\n        m_tableSchemaColumnSizes.push_back(32);\n\n        m_tableSchemaAllowNull.push_back(false);\n        m_tableSchemaAllowNull.push_back(false);\n        m_tableSchemaAllowNull.push_back(true);\n        m_tableSchemaAllowNull.push_back(true);\n        m_tableSchemaAllowNull.push_back(true);\n        m_tableSchemaAllowNull.push_back(true);\n        m_tableSchemaAllowNull.push_back(false);\n        m_tableSchemaAllowNull.push_back(false);\n        m_tableSchemaAllowNull.push_back(true);\n        m_tableSchemaAllowNull.push_back(true);\n\n        m_primaryKeyIndexColumns.push_back(0);\n        m_primaryKeyIndexColumns.push_back(1);\n        m_primaryKeyIndexColumns.push_back(6);\n        m_primaryKeyIndexColumns.push_back(7);\n\n        m_engine->setUndoToken(INT64_MIN + 1);\n    }\n\n    ~PersistentTableLogTest() {\n        delete m_engine;\n        delete m_table;\n    }\n\n    void initTable(bool allowInlineStrings) {\n        m_tableSchema = voltdb::TupleSchema::createTupleSchema(m_tableSchemaTypes,\n                                                               m_tableSchemaColumnSizes,\n                                                               m_tableSchemaAllowNull,\n                                                               allowInlineStrings);\n\n        voltdb::TableIndexScheme indexScheme(\"primaryKeyIndex\",\n                                             voltdb::BALANCED_TREE_INDEX,\n                                             m_primaryKeyIndexColumns,\n                                             TableIndex::simplyIndexColumns(),\n                                             true, true, m_tableSchema);\n        std::vector<voltdb::TableIndexScheme> indexes;\n\n        m_table = dynamic_cast<voltdb::PersistentTable*>(\n            voltdb::TableFactory::getPersistentTable(0, \"Foo\", m_tableSchema, m_columnNames, 0));\n\n        TableIndex *pkeyIndex = TableIndexFactory::TableIndexFactory::getInstance(indexScheme);\n        assert(pkeyIndex);\n        m_table->addIndex(pkeyIndex);\n        m_table->setPrimaryKeyIndex(pkeyIndex);\n    }\n\n\n\n    voltdb::VoltDBEngine *m_engine;\n    voltdb::TupleSchema *m_tableSchema;\n    voltdb::PersistentTable *m_table;\n    std::vector<std::string> m_columnNames;\n    std::vector<voltdb::ValueType> m_tableSchemaTypes;\n    std::vector<int32_t> m_tableSchemaColumnSizes;\n    std::vector<bool> m_tableSchemaAllowNull;\n    std::vector<int> m_primaryKeyIndexColumns;\n};\n\nclass StackCleaner {\npublic:\n    StackCleaner(TableTuple tuple) : m_tuple(tuple) {}\n    ~StackCleaner() {\n        m_tuple.freeObjectColumns();\n        delete [] m_tuple.address();\n    }\nprivate:\n    TableTuple m_tuple;\n};\n\nTEST_F(PersistentTableLogTest, InsertDeleteThenUndoOneTest) {\n    initTable(true);\n    tableutil::addRandomTuples(m_table, 1000);\n    voltdb::TableTuple tuple(m_tableSchema);\n\n    tableutil::getRandomTuple(m_table, tuple);\n\n    ASSERT_FALSE( m_table->lookupTuple(tuple).isNullTuple());\n\n    voltdb::TableTuple tupleBackup(m_tableSchema);\n    tupleBackup.move(new char[tupleBackup.tupleLength()]);\n    tupleBackup.copyForPersistentInsert(tuple);\n    StackCleaner cleaner(tupleBackup);\n\n    m_engine->setUndoToken(INT64_MIN + 2);\n    \/\/ this next line is a testing hack until engine data is\n    \/\/ de-duplicated with executorcontext data\n    m_engine->getExecutorContext();\n\n    m_table->deleteTuple(tuple, true);\n\n    ASSERT_TRUE( m_table->lookupTuple(tupleBackup).isNullTuple());\n\n    m_engine->undoUndoToken(INT64_MIN + 2);\n\n    ASSERT_FALSE(m_table->lookupTuple(tuple).isNullTuple());\n}\n\nTEST_F(PersistentTableLogTest, LoadTableThenUndoTest) {\n    initTable(true);\n    tableutil::addRandomTuples(m_table, 1000);\n\n    CopySerializeOutput serialize_out;\n    m_table->serializeTo(serialize_out);\n\n    m_engine->setUndoToken(INT64_MIN + 2);\n    \/\/ this next line is a testing hack until engine data is\n    \/\/ de-duplicated with executorcontext data\n    m_engine->getExecutorContext();\n\n    m_table->deleteAllTuples(true);\n    m_engine->releaseUndoToken(INT64_MIN + 2);\n\n    delete m_table;\n\n    initTable(true);\n\n    ReferenceSerializeInput serialize_in(serialize_out.data() + sizeof(int32_t), serialize_out.size() - sizeof(int32_t));\n\n    m_engine->setUndoToken(INT64_MIN + 3);\n    \/\/ this next line is a testing hack until engine data is\n    \/\/ de-duplicated with executorcontext data\n    m_engine->getExecutorContext();\n\n    m_table->loadTuplesFrom(serialize_in, NULL, NULL);\n    voltdb::TableTuple tuple(m_tableSchema);\n\n    tableutil::getRandomTuple(m_table, tuple);\n    ASSERT_FALSE( m_table->lookupTuple(tuple).isNullTuple());\n\n    m_engine->undoUndoToken(INT64_MIN + 3);\n\n    ASSERT_TRUE(m_table->lookupTuple(tuple).isNullTuple());\n    ASSERT_TRUE(m_table->activeTupleCount() == (int64_t)0);\n}\n\nTEST_F(PersistentTableLogTest, LoadTableThenReleaseTest) {\n    initTable(true);\n    tableutil::addRandomTuples(m_table, 1000);\n\n    CopySerializeOutput serialize_out;\n    m_table->serializeTo(serialize_out);\n\n    m_engine->setUndoToken(INT64_MIN + 2);\n    \/\/ this next line is a testing hack until engine data is\n    \/\/ de-duplicated with executorcontext data\n    m_engine->getExecutorContext();\n\n    m_table->deleteAllTuples(true);\n    m_engine->releaseUndoToken(INT64_MIN + 2);\n\n    delete m_table;\n\n    initTable(true);\n\n    ReferenceSerializeInput serialize_in(serialize_out.data() + sizeof(int32_t), serialize_out.size() - sizeof(int32_t));\n\n    m_engine->setUndoToken(INT64_MIN + 3);\n    \/\/ this next line is a testing hack until engine data is\n    \/\/ de-duplicated with executorcontext data\n    m_engine->getExecutorContext();\n\n    m_table->loadTuplesFrom(serialize_in, NULL, NULL);\n    voltdb::TableTuple tuple(m_tableSchema);\n\n    tableutil::getRandomTuple(m_table, tuple);\n    ASSERT_FALSE( m_table->lookupTuple(tuple).isNullTuple());\n\n    m_engine->releaseUndoToken(INT64_MIN + 3);\n\n    ASSERT_FALSE(m_table->lookupTuple(tuple).isNullTuple());\n    ASSERT_TRUE(m_table->activeTupleCount() == (int64_t)1000);\n}\n\nTEST_F(PersistentTableLogTest, InsertUpdateThenUndoOneTest) {\n    initTable(true);\n    tableutil::addRandomTuples(m_table, 1);\n    voltdb::TableTuple tuple(m_tableSchema);\n\n    tableutil::getRandomTuple(m_table, tuple);\n    \/\/std::cout << \"Retrieved random tuple \" << std::endl << tuple.debugNoHeader() << std::endl;\n\n    ASSERT_FALSE( m_table->lookupTuple(tuple).isNullTuple());\n\n    \/*\n     * A backup copy of what the tuple looked like before updates\n     *\/\n    voltdb::TableTuple tupleBackup(m_tableSchema);\n    tupleBackup.move(new char[tupleBackup.tupleLength()]);\n    tupleBackup.copyForPersistentInsert(tuple);\n\n    \/*\n     * A copy of the tuple to modify and use as a source tuple when updating the new tuple.\n     *\/\n    voltdb::TableTuple tupleCopy(m_tableSchema);\n    tupleCopy.move(new char[tupleCopy.tupleLength()]);\n    tupleCopy.copyForPersistentInsert(tuple);\n\n    m_engine->setUndoToken(INT64_MIN + 2);\n\n    \/\/ this next line is a testing hack until engine data is\n    \/\/ de-duplicated with executorcontext data\n    m_engine->getExecutorContext();\n\n    \/*\n     * Update a few columns\n     *\/\n    tupleCopy.setNValue(0, ValueFactory::getBigIntValue(5));\n    NValue newStringValue = ValueFactory::getStringValue(\"foo\");\n    tupleCopy.setNValue(7, newStringValue);\n    NValue oldStringValue = tupleCopy.getNValue(6);\n    tupleCopy.setNValue(6, ValueFactory::getStringValue(\"bar\"));\n\n    m_table->updateTuple(tuple, tupleCopy);\n\n    ASSERT_TRUE( m_table->lookupTuple(tupleBackup).isNullTuple());\n    ASSERT_FALSE( m_table->lookupTuple(tupleCopy).isNullTuple());\n    m_engine->undoUndoToken(INT64_MIN + 2);\n\n    ASSERT_FALSE(m_table->lookupTuple(tuple).isNullTuple());\n    ASSERT_TRUE( m_table->lookupTuple(tupleCopy).isNullTuple());\n    tupleBackup.freeObjectColumns();\n    tupleCopy.freeObjectColumns();\n    delete [] tupleBackup.address();\n    delete [] tupleCopy.address();\n    newStringValue.free();\n    oldStringValue.free();\n}\n\nTEST_F(PersistentTableLogTest, InsertThenUndoInsertsOneTest) {\n    initTable(true);\n    tableutil::addRandomTuples(m_table, 10);\n    ASSERT_EQ( m_table->activeTupleCount(), 10);\n    m_engine->undoUndoToken(INT64_MIN + 1);\n    ASSERT_EQ( m_table->activeTupleCount(), 0);\n}\n\nTEST_F(PersistentTableLogTest, FindBlockTest) {\n    const int blockSize = 20;\n\n    \/\/ these will be used as artificial tuple block addresses\n    char addr1[1];\n    char addr2[1];\n    char addr3[1];\n    TBPtr block1((TupleBlock *)addr1);\n    TBPtr block2((TupleBlock *)addr2);\n    TBPtr block3((TupleBlock *)addr3);\n\n    TBMap blocks;\n    char *base = block1->address();\n\n    \/\/ block2 is adjacent to block1, block3 is 1 block away from block2\n    blocks.insert(base,                 block1);\n    blocks.insert(base + blockSize,     block2);\n    blocks.insert(base + blockSize * 3, block3);\n\n    \/\/ in the middle but land on a missing boundary\n    ASSERT_EQ(PersistentTable::findBlock(base + blockSize * 2, blocks, blockSize).get(), NULL);\n    \/\/ past the end but on a boundary\n    ASSERT_EQ(PersistentTable::findBlock(base + blockSize * 4, blocks, blockSize).get(), NULL);\n\n    \/\/ the following tuples should be found in the map\n    ASSERT_EQ(PersistentTable::findBlock(base,                     blocks, blockSize)->address(),\n              block1->address());\n    ASSERT_EQ(PersistentTable::findBlock(base + blockSize - 1,     blocks, blockSize)->address(),\n              block1->address());\n    ASSERT_EQ(PersistentTable::findBlock(base + blockSize * 4 - 1, blocks, blockSize)->address(),\n              block3->address());\n}\n\nint main() {\n    return TestSuite::globalInstance()->runAll();\n}\n<commit_msg>ENG-5601: Fix new findBlock test in EE.<commit_after>\/* This file is part of VoltDB.\n * Copyright (C) 2008-2013 VoltDB Inc.\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\n#include \"harness.h\"\n#include \"common\/TupleSchema.h\"\n#include \"common\/types.h\"\n#include \"common\/NValue.hpp\"\n#include \"common\/ValueFactory.hpp\"\n#include \"common\/serializeio.h\"\n#include \"execution\/VoltDBEngine.h\"\n#include \"storage\/persistenttable.h\"\n#include \"storage\/tablefactory.h\"\n#include \"storage\/tableutil.h\"\n#include \"indexes\/tableindex.h\"\n#include <vector>\n#include <string>\n#include <stdint.h>\n\nusing namespace voltdb;\n\nclass PersistentTableLogTest : public Test {\npublic:\n    PersistentTableLogTest() {\n        m_engine = new voltdb::VoltDBEngine();\n        int partitionCount = 1;\n        m_engine->initialize(1,1, 0, 0, \"\", DEFAULT_TEMP_TABLE_MEMORY);\n        m_engine->updateHashinator( HASHINATOR_LEGACY, (char*)&partitionCount, NULL, 0);\n\n        m_columnNames.push_back(\"1\");\n        m_columnNames.push_back(\"2\");\n        m_columnNames.push_back(\"3\");\n        m_columnNames.push_back(\"4\");\n        m_columnNames.push_back(\"5\");\n        m_columnNames.push_back(\"6\");\n        m_columnNames.push_back(\"7\");\n        m_columnNames.push_back(\"8\");\n        m_columnNames.push_back(\"9\");\n        m_columnNames.push_back(\"10\");\n\n        m_tableSchemaTypes.push_back(voltdb::VALUE_TYPE_BIGINT);\n        m_tableSchemaTypes.push_back(voltdb::VALUE_TYPE_TINYINT);\n        m_tableSchemaTypes.push_back(voltdb::VALUE_TYPE_INTEGER);\n        m_tableSchemaTypes.push_back(voltdb::VALUE_TYPE_BIGINT);\n        m_tableSchemaTypes.push_back(voltdb::VALUE_TYPE_SMALLINT);\n        m_tableSchemaTypes.push_back(voltdb::VALUE_TYPE_DOUBLE);\n        m_tableSchemaTypes.push_back(voltdb::VALUE_TYPE_VARCHAR);\n        m_tableSchemaTypes.push_back(voltdb::VALUE_TYPE_VARCHAR);\n        m_tableSchemaTypes.push_back(voltdb::VALUE_TYPE_VARCHAR);\n        m_tableSchemaTypes.push_back(voltdb::VALUE_TYPE_VARCHAR);\n\n        m_tableSchemaColumnSizes.push_back(NValue::getTupleStorageSize(voltdb::VALUE_TYPE_BIGINT));\n        m_tableSchemaColumnSizes.push_back(NValue::getTupleStorageSize(voltdb::VALUE_TYPE_TINYINT));\n        m_tableSchemaColumnSizes.push_back(NValue::getTupleStorageSize(voltdb::VALUE_TYPE_INTEGER));\n        m_tableSchemaColumnSizes.push_back(NValue::getTupleStorageSize(voltdb::VALUE_TYPE_BIGINT));\n        m_tableSchemaColumnSizes.push_back(NValue::getTupleStorageSize(voltdb::VALUE_TYPE_SMALLINT));\n        m_tableSchemaColumnSizes.push_back(NValue::getTupleStorageSize(voltdb::VALUE_TYPE_DOUBLE));\n        m_tableSchemaColumnSizes.push_back(300);\n        m_tableSchemaColumnSizes.push_back(16);\n        m_tableSchemaColumnSizes.push_back(500);\n        m_tableSchemaColumnSizes.push_back(32);\n\n        m_tableSchemaAllowNull.push_back(false);\n        m_tableSchemaAllowNull.push_back(false);\n        m_tableSchemaAllowNull.push_back(true);\n        m_tableSchemaAllowNull.push_back(true);\n        m_tableSchemaAllowNull.push_back(true);\n        m_tableSchemaAllowNull.push_back(true);\n        m_tableSchemaAllowNull.push_back(false);\n        m_tableSchemaAllowNull.push_back(false);\n        m_tableSchemaAllowNull.push_back(true);\n        m_tableSchemaAllowNull.push_back(true);\n\n        m_primaryKeyIndexColumns.push_back(0);\n        m_primaryKeyIndexColumns.push_back(1);\n        m_primaryKeyIndexColumns.push_back(6);\n        m_primaryKeyIndexColumns.push_back(7);\n\n        m_engine->setUndoToken(INT64_MIN + 1);\n    }\n\n    ~PersistentTableLogTest() {\n        delete m_engine;\n        delete m_table;\n    }\n\n    void initTable(bool allowInlineStrings) {\n        m_tableSchema = voltdb::TupleSchema::createTupleSchema(m_tableSchemaTypes,\n                                                               m_tableSchemaColumnSizes,\n                                                               m_tableSchemaAllowNull,\n                                                               allowInlineStrings);\n\n        voltdb::TableIndexScheme indexScheme(\"primaryKeyIndex\",\n                                             voltdb::BALANCED_TREE_INDEX,\n                                             m_primaryKeyIndexColumns,\n                                             TableIndex::simplyIndexColumns(),\n                                             true, true, m_tableSchema);\n        std::vector<voltdb::TableIndexScheme> indexes;\n\n        m_table = dynamic_cast<voltdb::PersistentTable*>(\n            voltdb::TableFactory::getPersistentTable(0, \"Foo\", m_tableSchema, m_columnNames, 0));\n\n        TableIndex *pkeyIndex = TableIndexFactory::TableIndexFactory::getInstance(indexScheme);\n        assert(pkeyIndex);\n        m_table->addIndex(pkeyIndex);\n        m_table->setPrimaryKeyIndex(pkeyIndex);\n    }\n\n\n\n    voltdb::VoltDBEngine *m_engine;\n    voltdb::TupleSchema *m_tableSchema;\n    voltdb::PersistentTable *m_table;\n    std::vector<std::string> m_columnNames;\n    std::vector<voltdb::ValueType> m_tableSchemaTypes;\n    std::vector<int32_t> m_tableSchemaColumnSizes;\n    std::vector<bool> m_tableSchemaAllowNull;\n    std::vector<int> m_primaryKeyIndexColumns;\n};\n\nclass StackCleaner {\npublic:\n    StackCleaner(TableTuple tuple) : m_tuple(tuple) {}\n    ~StackCleaner() {\n        m_tuple.freeObjectColumns();\n        delete [] m_tuple.address();\n    }\nprivate:\n    TableTuple m_tuple;\n};\n\nTEST_F(PersistentTableLogTest, InsertDeleteThenUndoOneTest) {\n    initTable(true);\n    tableutil::addRandomTuples(m_table, 1000);\n    voltdb::TableTuple tuple(m_tableSchema);\n\n    tableutil::getRandomTuple(m_table, tuple);\n\n    ASSERT_FALSE( m_table->lookupTuple(tuple).isNullTuple());\n\n    voltdb::TableTuple tupleBackup(m_tableSchema);\n    tupleBackup.move(new char[tupleBackup.tupleLength()]);\n    tupleBackup.copyForPersistentInsert(tuple);\n    StackCleaner cleaner(tupleBackup);\n\n    m_engine->setUndoToken(INT64_MIN + 2);\n    \/\/ this next line is a testing hack until engine data is\n    \/\/ de-duplicated with executorcontext data\n    m_engine->getExecutorContext();\n\n    m_table->deleteTuple(tuple, true);\n\n    ASSERT_TRUE( m_table->lookupTuple(tupleBackup).isNullTuple());\n\n    m_engine->undoUndoToken(INT64_MIN + 2);\n\n    ASSERT_FALSE(m_table->lookupTuple(tuple).isNullTuple());\n}\n\nTEST_F(PersistentTableLogTest, LoadTableThenUndoTest) {\n    initTable(true);\n    tableutil::addRandomTuples(m_table, 1000);\n\n    CopySerializeOutput serialize_out;\n    m_table->serializeTo(serialize_out);\n\n    m_engine->setUndoToken(INT64_MIN + 2);\n    \/\/ this next line is a testing hack until engine data is\n    \/\/ de-duplicated with executorcontext data\n    m_engine->getExecutorContext();\n\n    m_table->deleteAllTuples(true);\n    m_engine->releaseUndoToken(INT64_MIN + 2);\n\n    delete m_table;\n\n    initTable(true);\n\n    ReferenceSerializeInput serialize_in(serialize_out.data() + sizeof(int32_t), serialize_out.size() - sizeof(int32_t));\n\n    m_engine->setUndoToken(INT64_MIN + 3);\n    \/\/ this next line is a testing hack until engine data is\n    \/\/ de-duplicated with executorcontext data\n    m_engine->getExecutorContext();\n\n    m_table->loadTuplesFrom(serialize_in, NULL, NULL);\n    voltdb::TableTuple tuple(m_tableSchema);\n\n    tableutil::getRandomTuple(m_table, tuple);\n    ASSERT_FALSE( m_table->lookupTuple(tuple).isNullTuple());\n\n    m_engine->undoUndoToken(INT64_MIN + 3);\n\n    ASSERT_TRUE(m_table->lookupTuple(tuple).isNullTuple());\n    ASSERT_TRUE(m_table->activeTupleCount() == (int64_t)0);\n}\n\nTEST_F(PersistentTableLogTest, LoadTableThenReleaseTest) {\n    initTable(true);\n    tableutil::addRandomTuples(m_table, 1000);\n\n    CopySerializeOutput serialize_out;\n    m_table->serializeTo(serialize_out);\n\n    m_engine->setUndoToken(INT64_MIN + 2);\n    \/\/ this next line is a testing hack until engine data is\n    \/\/ de-duplicated with executorcontext data\n    m_engine->getExecutorContext();\n\n    m_table->deleteAllTuples(true);\n    m_engine->releaseUndoToken(INT64_MIN + 2);\n\n    delete m_table;\n\n    initTable(true);\n\n    ReferenceSerializeInput serialize_in(serialize_out.data() + sizeof(int32_t), serialize_out.size() - sizeof(int32_t));\n\n    m_engine->setUndoToken(INT64_MIN + 3);\n    \/\/ this next line is a testing hack until engine data is\n    \/\/ de-duplicated with executorcontext data\n    m_engine->getExecutorContext();\n\n    m_table->loadTuplesFrom(serialize_in, NULL, NULL);\n    voltdb::TableTuple tuple(m_tableSchema);\n\n    tableutil::getRandomTuple(m_table, tuple);\n    ASSERT_FALSE( m_table->lookupTuple(tuple).isNullTuple());\n\n    m_engine->releaseUndoToken(INT64_MIN + 3);\n\n    ASSERT_FALSE(m_table->lookupTuple(tuple).isNullTuple());\n    ASSERT_TRUE(m_table->activeTupleCount() == (int64_t)1000);\n}\n\nTEST_F(PersistentTableLogTest, InsertUpdateThenUndoOneTest) {\n    initTable(true);\n    tableutil::addRandomTuples(m_table, 1);\n    voltdb::TableTuple tuple(m_tableSchema);\n\n    tableutil::getRandomTuple(m_table, tuple);\n    \/\/std::cout << \"Retrieved random tuple \" << std::endl << tuple.debugNoHeader() << std::endl;\n\n    ASSERT_FALSE( m_table->lookupTuple(tuple).isNullTuple());\n\n    \/*\n     * A backup copy of what the tuple looked like before updates\n     *\/\n    voltdb::TableTuple tupleBackup(m_tableSchema);\n    tupleBackup.move(new char[tupleBackup.tupleLength()]);\n    tupleBackup.copyForPersistentInsert(tuple);\n\n    \/*\n     * A copy of the tuple to modify and use as a source tuple when updating the new tuple.\n     *\/\n    voltdb::TableTuple tupleCopy(m_tableSchema);\n    tupleCopy.move(new char[tupleCopy.tupleLength()]);\n    tupleCopy.copyForPersistentInsert(tuple);\n\n    m_engine->setUndoToken(INT64_MIN + 2);\n\n    \/\/ this next line is a testing hack until engine data is\n    \/\/ de-duplicated with executorcontext data\n    m_engine->getExecutorContext();\n\n    \/*\n     * Update a few columns\n     *\/\n    tupleCopy.setNValue(0, ValueFactory::getBigIntValue(5));\n    NValue newStringValue = ValueFactory::getStringValue(\"foo\");\n    tupleCopy.setNValue(7, newStringValue);\n    NValue oldStringValue = tupleCopy.getNValue(6);\n    tupleCopy.setNValue(6, ValueFactory::getStringValue(\"bar\"));\n\n    m_table->updateTuple(tuple, tupleCopy);\n\n    ASSERT_TRUE( m_table->lookupTuple(tupleBackup).isNullTuple());\n    ASSERT_FALSE( m_table->lookupTuple(tupleCopy).isNullTuple());\n    m_engine->undoUndoToken(INT64_MIN + 2);\n\n    ASSERT_FALSE(m_table->lookupTuple(tuple).isNullTuple());\n    ASSERT_TRUE( m_table->lookupTuple(tupleCopy).isNullTuple());\n    tupleBackup.freeObjectColumns();\n    tupleCopy.freeObjectColumns();\n    delete [] tupleBackup.address();\n    delete [] tupleCopy.address();\n    newStringValue.free();\n    oldStringValue.free();\n}\n\nTEST_F(PersistentTableLogTest, InsertThenUndoInsertsOneTest) {\n    initTable(true);\n    tableutil::addRandomTuples(m_table, 10);\n    ASSERT_EQ( m_table->activeTupleCount(), 10);\n    m_engine->undoUndoToken(INT64_MIN + 1);\n    ASSERT_EQ( m_table->activeTupleCount(), 0);\n}\n\nTEST_F(PersistentTableLogTest, FindBlockTest) {\n    const int blockSize = 20;\n\n    \/\/ these will be used as artificial tuple block addresses\n    TBPtr block1((TupleBlock *)malloc(1));\n    TBPtr block2((TupleBlock *)malloc(1));\n    TBPtr block3((TupleBlock *)malloc(1));\n\n    TBMap blocks;\n    char *base = block1->address();\n\n    \/\/ block2 is adjacent to block1, block3 is 1 block away from block2\n    blocks.insert(base,                 block1);\n    blocks.insert(base + blockSize,     block2);\n    blocks.insert(base + blockSize * 3, block3);\n\n    \/\/ in the middle but land on a missing boundary\n    ASSERT_EQ(PersistentTable::findBlock(base + blockSize * 2, blocks, blockSize).get(), NULL);\n    \/\/ past the end but on a boundary\n    ASSERT_EQ(PersistentTable::findBlock(base + blockSize * 4, blocks, blockSize).get(), NULL);\n\n    \/\/ the following tuples should be found in the map\n    ASSERT_EQ(PersistentTable::findBlock(base,                     blocks, blockSize)->address(),\n              block1->address());\n    ASSERT_EQ(PersistentTable::findBlock(base + blockSize - 1,     blocks, blockSize)->address(),\n              block1->address());\n    ASSERT_EQ(PersistentTable::findBlock(base + blockSize * 4 - 1, blocks, blockSize)->address(),\n              block3->address());\n}\n\nint main() {\n    return TestSuite::globalInstance()->runAll();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*++\n\nModule Name:\n\n    ReadWriter.cpp\n\nAbstract:\n\n    General file writer.\n\nEnvironment:\n\n    User mode service.\n\n    Not thread safe.\n\n--*\/\n\n#include \"stdafx.h\"\n#include \"BigAlloc.h\"\n#include \"Compat.h\"\n#include \"Read.h\"\n#include \"SAM.h\"\n#include \"Tables.h\"\n#include \"RangeSplitter.h\"\n#include \"ParallelTask.h\"\n#include \"Util.h\"\n#include \"ReadSupplierQueue.h\"\n#include \"FileFormat.h\"\n#include \"exit.h\"\n\nclass SimpleReadWriter : public ReadWriter\n{\npublic:\n    SimpleReadWriter(const FileFormat* i_format, DataWriter* i_writer, const Genome* i_genome)\n        : format(i_format), writer(i_writer), genome(i_genome)\n    {}\n\n    virtual ~SimpleReadWriter()\n    {\n        delete writer;\n    }\n\n    virtual bool writeHeader(const ReaderContext& context, bool sorted, int argc, const char **argv, const char *version, const char *rgLine);\n\n    virtual bool writeRead(Read *read, AlignmentResult result, int mapQuality, unsigned genomeLocation, Direction direction);\n\n    virtual bool writePair(Read *read0, Read *read1, PairedAlignmentResult *result);\n\n    virtual void close();\n\nprivate:\n    const FileFormat* format;\n    DataWriter* writer;\n    const Genome* genome;\n    LandauVishkinWithCigar lvc;\n};\n\n    bool\nSimpleReadWriter::writeHeader(\n    const ReaderContext& context,\n    bool sorted,\n    int argc,\n    const char **argv,\n    const char *version,\n    const char *rgLine)\n{\n    char* buffer;\n    size_t size;\n    size_t used;\n\n\twriter->inHeader(true);\n    if (! writer->getBuffer(&buffer, &size)) {\n        return false;\n    }\n\n    if (! format->writeHeader(context, buffer, size, &used, sorted, argc, argv, version, rgLine)) {\n        fprintf(stderr, \"Failed to write header into fresh buffer\\n\");\n        return false;\n    }\n\n    writer->advance((unsigned)used, 0);\n\twriter->nextBatch();\n\twriter->inHeader(false);\n    return true;\n}\n\n    bool\nSimpleReadWriter::writeRead(\n    Read *read,\n    AlignmentResult result,\n    int mapQuality,\n    unsigned genomeLocation,\n    Direction direction)\n{\n    char* buffer;\n    size_t size;\n    size_t used;\n    if (result == NotFound) {\n        genomeLocation = UINT32_MAX;\n    }\n    for (int pass = 0; pass < 2; pass++) {\n        if (! writer->getBuffer(&buffer, &size)) {\n            return false;\n        }\n        if (format->writeRead(genome, &lvc, buffer, size, &used, read->getIdLength(), read, result, mapQuality, genomeLocation, direction)) {\n            _ASSERT(used <= size);\n\n        if (used > 0xffffffff) {\n            fprintf(stderr,\"SimpleReadWriter:writeRead: used too big\\n\");\n            soft_exit(1);\n        }\n\n        writer->advance((unsigned)used, genomeLocation);\n            return true;\n        }\n        if (pass == 1) {\n            fprintf(stderr, \"Failed to write into fresh buffer\\n\");\n            soft_exit(1);\n        }\n        if (! writer->nextBatch()) {\n            return false;\n        }\n    }\n    return false; \/\/ will never get here\n}\n\n    bool\nSimpleReadWriter::writePair(\n    Read *read0,\n    Read *read1,\n    PairedAlignmentResult *result)\n{\n    \/\/\n    \/\/ We need to write both halves of the pair into the same buffer, so that a write from\n    \/\/ some other thread doesn't separate them.  So, try the writes and if either doesn't\n    \/\/ work start IO and try again.\n    \/\/\n    Read *reads[2] = {read0, read1};\n    size_t sizeUsed[2];\n\n    \/\/\n    \/\/ For paired reads, we need to have the same QNAME for both of them, and it needs to be unique among all other\n    \/\/ reads in the dataset.  For now, all we do is see if the read names end in \/1 and \/2, and if so truncate them.\n    \/\/\n    size_t idLengths[2];\n    idLengths[0] = read0->getIdLength();\n    idLengths[1] = read1->getIdLength();\n    if (idLengths[0] == idLengths[1] && idLengths[0] > 2 && read0->getId()[idLengths[0]-2] == '\/' && read1->getId()[idLengths[0]-2] == '\/') {\n        char lastChar0, lastChar1;\n        lastChar0 = read0->getId()[idLengths[0] - 1];\n        lastChar1 = read1->getId()[idLengths[1] - 1];\n        if ((lastChar0 == '1' || lastChar0 == '2') && (lastChar0 == '1' || lastChar1 == '2') && \n            lastChar0 != lastChar1) {\n                idLengths[0] -= 2;\n                idLengths[1] -= 2;\n        }\n    }\n    unsigned locations[2];\n    locations[0] = result->status[0] != NotFound ? result->location[0] : UINT32_MAX;\n    locations[1] = result->status[1] != NotFound ? result->location[1] : UINT32_MAX;\n    int first = locations[0] > locations[1];\n    int second = 1 - first;\n    for (int pass = 0; pass < 2; pass++) {\n        \n        char* buffer;\n        size_t size;\n\n        if (! writer->getBuffer(&buffer, &size)) {\n            return false;\n        }\n\n        bool writesFit = format->writeRead(genome, &lvc, buffer, size, &sizeUsed[first],\n                            idLengths[first], reads[first], result->status[first], result->mapq[first], locations[first], result->direction[first], true, true,\n                            reads[second], result->status[second], locations[second], result->direction[second]);\n\n        if (writesFit) {\n            writesFit = format->writeRead(genome, &lvc, buffer + sizeUsed[first], size - sizeUsed[first], &sizeUsed[second],\n                idLengths[second], reads[second], result->status[second], result->mapq[second], locations[second], result->direction[second], true, false,\n                reads[first], result->status[first], locations[first], result->direction[first]);\n            if (writesFit) {\n                break;\n            }\n        }\n\n        if (pass == 1) {\n            fprintf(stderr,\"ReadWriter: write into fresh buffer failed\\n\");\n            return false;\n        }\n\n        if (! writer->nextBatch()) {\n            return false;\n        }\n    }\n\n    if (sizeUsed[0] > 0xffffffff || sizeUsed[1] > 0xffffffff) {\n        fprintf(stderr,\"SimpleReadWriter::writePair: one or the other (or both) sizeUsed too big\\n\");\n        soft_exit(1);\n    }\n\n    \/\/\n    \/\/ The strange code that determines the sort key (which uses the coordinate of the mate for unmapped reads) is because we list unmapped reads\n    \/\/ with mapped mates at their mates' location so they sort together.  If both halves are unmapped, then  \n    writer->advance((unsigned)sizeUsed[first],\n        locations[first] != UINT32_MAX ? locations[first] : locations[second]);\n\n    writer->advance((unsigned)sizeUsed[second],\n        locations[second] != UINT32_MAX ? locations[second] : locations[first]);\n    return true;\n}\n\n    void\nSimpleReadWriter::close()\n{\n    writer->close();\n}\n\nclass SimpleReadWriterSupplier : public ReadWriterSupplier\n{\npublic:\n    SimpleReadWriterSupplier(const FileFormat* i_format, DataWriterSupplier* i_dataSupplier, const Genome* i_genome)\n        :\n        format(i_format),\n        dataSupplier(i_dataSupplier),\n        genome(i_genome)\n    {}\n\n    ~SimpleReadWriterSupplier()\n    {\n        delete dataSupplier;\n    }\n\n    virtual ReadWriter* getWriter()\n    {\n        return new SimpleReadWriter(format, dataSupplier->getWriter(), genome);\n    }\n\n    virtual void close()\n    {\n        dataSupplier->close();\n    }\n\nprivate:\n    const FileFormat* format;\n    DataWriterSupplier* dataSupplier;\n    const Genome* genome;\n};\n\n    ReadWriterSupplier*\nReadWriterSupplier::create(\n    const FileFormat* format,\n    DataWriterSupplier* dataSupplier,\n    const Genome* genome)\n{\n    return new SimpleReadWriterSupplier(format, dataSupplier, genome);\n}\n\n<commit_msg>Fix typo in id cleanup<commit_after>\/*++\n\nModule Name:\n\n    ReadWriter.cpp\n\nAbstract:\n\n    General file writer.\n\nEnvironment:\n\n    User mode service.\n\n    Not thread safe.\n\n--*\/\n\n#include \"stdafx.h\"\n#include \"BigAlloc.h\"\n#include \"Compat.h\"\n#include \"Read.h\"\n#include \"SAM.h\"\n#include \"Tables.h\"\n#include \"RangeSplitter.h\"\n#include \"ParallelTask.h\"\n#include \"Util.h\"\n#include \"ReadSupplierQueue.h\"\n#include \"FileFormat.h\"\n#include \"exit.h\"\n\nclass SimpleReadWriter : public ReadWriter\n{\npublic:\n    SimpleReadWriter(const FileFormat* i_format, DataWriter* i_writer, const Genome* i_genome)\n        : format(i_format), writer(i_writer), genome(i_genome)\n    {}\n\n    virtual ~SimpleReadWriter()\n    {\n        delete writer;\n    }\n\n    virtual bool writeHeader(const ReaderContext& context, bool sorted, int argc, const char **argv, const char *version, const char *rgLine);\n\n    virtual bool writeRead(Read *read, AlignmentResult result, int mapQuality, unsigned genomeLocation, Direction direction);\n\n    virtual bool writePair(Read *read0, Read *read1, PairedAlignmentResult *result);\n\n    virtual void close();\n\nprivate:\n    const FileFormat* format;\n    DataWriter* writer;\n    const Genome* genome;\n    LandauVishkinWithCigar lvc;\n};\n\n    bool\nSimpleReadWriter::writeHeader(\n    const ReaderContext& context,\n    bool sorted,\n    int argc,\n    const char **argv,\n    const char *version,\n    const char *rgLine)\n{\n    char* buffer;\n    size_t size;\n    size_t used;\n\n\twriter->inHeader(true);\n    if (! writer->getBuffer(&buffer, &size)) {\n        return false;\n    }\n\n    if (! format->writeHeader(context, buffer, size, &used, sorted, argc, argv, version, rgLine)) {\n        fprintf(stderr, \"Failed to write header into fresh buffer\\n\");\n        return false;\n    }\n\n    writer->advance((unsigned)used, 0);\n\twriter->nextBatch();\n\twriter->inHeader(false);\n    return true;\n}\n\n    bool\nSimpleReadWriter::writeRead(\n    Read *read,\n    AlignmentResult result,\n    int mapQuality,\n    unsigned genomeLocation,\n    Direction direction)\n{\n    char* buffer;\n    size_t size;\n    size_t used;\n    if (result == NotFound) {\n        genomeLocation = UINT32_MAX;\n    }\n    for (int pass = 0; pass < 2; pass++) {\n        if (! writer->getBuffer(&buffer, &size)) {\n            return false;\n        }\n        if (format->writeRead(genome, &lvc, buffer, size, &used, read->getIdLength(), read, result, mapQuality, genomeLocation, direction)) {\n            _ASSERT(used <= size);\n\n        if (used > 0xffffffff) {\n            fprintf(stderr,\"SimpleReadWriter:writeRead: used too big\\n\");\n            soft_exit(1);\n        }\n\n        writer->advance((unsigned)used, genomeLocation);\n            return true;\n        }\n        if (pass == 1) {\n            fprintf(stderr, \"Failed to write into fresh buffer\\n\");\n            soft_exit(1);\n        }\n        if (! writer->nextBatch()) {\n            return false;\n        }\n    }\n    return false; \/\/ will never get here\n}\n\n    bool\nSimpleReadWriter::writePair(\n    Read *read0,\n    Read *read1,\n    PairedAlignmentResult *result)\n{\n    \/\/\n    \/\/ We need to write both halves of the pair into the same buffer, so that a write from\n    \/\/ some other thread doesn't separate them.  So, try the writes and if either doesn't\n    \/\/ work start IO and try again.\n    \/\/\n    Read *reads[2] = {read0, read1};\n    size_t sizeUsed[2];\n\n    \/\/\n    \/\/ For paired reads, we need to have the same QNAME for both of them, and it needs to be unique among all other\n    \/\/ reads in the dataset.  For now, all we do is see if the read names end in \/1 and \/2, and if so truncate them.\n    \/\/\n    size_t idLengths[2];\n    idLengths[0] = read0->getIdLength();\n    idLengths[1] = read1->getIdLength();\n    if (idLengths[0] == idLengths[1] && idLengths[0] > 2 && read0->getId()[idLengths[0]-2] == '\/' && read1->getId()[idLengths[0]-2] == '\/') {\n        char lastChar0, lastChar1;\n        lastChar0 = read0->getId()[idLengths[0] - 1];\n        lastChar1 = read1->getId()[idLengths[1] - 1];\n        if ((lastChar0 == '1' || lastChar0 == '2') && (lastChar1 == '1' || lastChar1 == '2') && \n            lastChar0 != lastChar1) {\n                idLengths[0] -= 2;\n                idLengths[1] -= 2;\n        }\n    }\n    unsigned locations[2];\n    locations[0] = result->status[0] != NotFound ? result->location[0] : UINT32_MAX;\n    locations[1] = result->status[1] != NotFound ? result->location[1] : UINT32_MAX;\n    int first = locations[0] > locations[1];\n    int second = 1 - first;\n    for (int pass = 0; pass < 2; pass++) {\n        \n        char* buffer;\n        size_t size;\n\n        if (! writer->getBuffer(&buffer, &size)) {\n            return false;\n        }\n\n        bool writesFit = format->writeRead(genome, &lvc, buffer, size, &sizeUsed[first],\n                            idLengths[first], reads[first], result->status[first], result->mapq[first], locations[first], result->direction[first], true, true,\n                            reads[second], result->status[second], locations[second], result->direction[second]);\n\n        if (writesFit) {\n            writesFit = format->writeRead(genome, &lvc, buffer + sizeUsed[first], size - sizeUsed[first], &sizeUsed[second],\n                idLengths[second], reads[second], result->status[second], result->mapq[second], locations[second], result->direction[second], true, false,\n                reads[first], result->status[first], locations[first], result->direction[first]);\n            if (writesFit) {\n                break;\n            }\n        }\n\n        if (pass == 1) {\n            fprintf(stderr,\"ReadWriter: write into fresh buffer failed\\n\");\n            return false;\n        }\n\n        if (! writer->nextBatch()) {\n            return false;\n        }\n    }\n\n    if (sizeUsed[0] > 0xffffffff || sizeUsed[1] > 0xffffffff) {\n        fprintf(stderr,\"SimpleReadWriter::writePair: one or the other (or both) sizeUsed too big\\n\");\n        soft_exit(1);\n    }\n\n    \/\/\n    \/\/ The strange code that determines the sort key (which uses the coordinate of the mate for unmapped reads) is because we list unmapped reads\n    \/\/ with mapped mates at their mates' location so they sort together.  If both halves are unmapped, then  \n    writer->advance((unsigned)sizeUsed[first],\n        locations[first] != UINT32_MAX ? locations[first] : locations[second]);\n\n    writer->advance((unsigned)sizeUsed[second],\n        locations[second] != UINT32_MAX ? locations[second] : locations[first]);\n    return true;\n}\n\n    void\nSimpleReadWriter::close()\n{\n    writer->close();\n}\n\nclass SimpleReadWriterSupplier : public ReadWriterSupplier\n{\npublic:\n    SimpleReadWriterSupplier(const FileFormat* i_format, DataWriterSupplier* i_dataSupplier, const Genome* i_genome)\n        :\n        format(i_format),\n        dataSupplier(i_dataSupplier),\n        genome(i_genome)\n    {}\n\n    ~SimpleReadWriterSupplier()\n    {\n        delete dataSupplier;\n    }\n\n    virtual ReadWriter* getWriter()\n    {\n        return new SimpleReadWriter(format, dataSupplier->getWriter(), genome);\n    }\n\n    virtual void close()\n    {\n        dataSupplier->close();\n    }\n\nprivate:\n    const FileFormat* format;\n    DataWriterSupplier* dataSupplier;\n    const Genome* genome;\n};\n\n    ReadWriterSupplier*\nReadWriterSupplier::create(\n    const FileFormat* format,\n    DataWriterSupplier* dataSupplier,\n    const Genome* genome)\n{\n    return new SimpleReadWriterSupplier(format, dataSupplier, genome);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\tThis file is part of the Rendering library.\n\tCopyright (C) 2014 Sascha Brandt <myeti@mail.upb.de>\n\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#ifdef RENDERING_HAS_LIB_OPENCL\n#include \"Context.h\"\n\n#include \"Platform.h\"\n#include \"Device.h\"\n#include \"CLUtils.h\"\n\n\n#include <Rendering\/Helper.h>\n\n#include <Util\/Macros.h>\n\n#include <CL\/cl.hpp>\n\n\n#if defined __APPLE__ || defined(MACOSX)\n#else\n    #if defined WIN32\n    #else\n        \/\/needed for context sharing functions\n        #include <GL\/glx.h>\n    #endif\n#endif\n\nnamespace Rendering {\nnamespace CL {\n\nvoid* getCurrentContext() {\n\t#if defined (__APPLE__) || defined(MACOSX)\n        CGLContextObj kCGLContext = CGLGetCurrentContext();\n        CGLShareGroupObj kCGLShareGroup = CGLGetShareGroup(kCGLContext);\n\t\treturn reinterpret_cast<void*>(kCGLShareGroup);\n    #else\n        #if defined WIN32 \/\/ Win32\n\t\t\treturn reinterpret_cast<void*>(wglGetCurrentContext());\n        #else\n\t\t\treturn reinterpret_cast<void*>(glXGetCurrentContext());\n        #endif\n    #endif\n}\n\nvoid* getCurrentDisplay() {\n\t#if defined (__APPLE__) || defined(MACOSX)\n\t\treturn nullptr;\n\t#else\n\t\t#if defined WIN32 \/\/ Win32\n\t\t\treturn reinterpret_cast<void*>(wglGetCurrentDC());\n\t\t#else\n\t\t\treturn reinterpret_cast<void*>(glXGetCurrentDisplay());\n\t\t#endif\n\t#endif\n}\n\nstd::vector<cl_context_properties> getContextProperties(const cl::Platform& platform, bool shareGLContext) {\n\tif(shareGLContext) {\n\t\t#if defined (__APPLE__) || defined(MACOSX)\n\t\t\treturn {\n\t\t\t\tCL_CONTEXT_PROPERTY_USE_CGL_SHAREGROUP_APPLE, reinterpret_cast<cl_context_properties>(getCurrentContext()),\n\t\t\t\tCL_CONTEXT_PLATFORM, reinterpret_cast<cl_context_properties>(platform()),\n\t\t\t\t0\n\t\t\t};\n\t\t#else\n\t\t\t#if defined WIN32 \/\/ Win32\n\t\t\t\treturn {\n\t\t\t\t\tCL_GL_CONTEXT_KHR, (cl_context_properties)getCurrentContext(),\n\t\t\t\t\tCL_WGL_HDC_KHR, (cl_context_properties)getCurrentDisplay(),\n\t\t\t\t\tCL_CONTEXT_PLATFORM, (cl_context_properties)(platform()),\n\t\t\t\t\t0\n\t\t\t\t};\n\t\t\t#else\n\t\t\t\treturn {\n\t\t\t\t\tCL_GL_CONTEXT_KHR, (cl_context_properties)getCurrentContext(),\n\t\t\t\t\tCL_GLX_DISPLAY_KHR, (cl_context_properties)getCurrentDisplay(),\n\t\t\t\t\tCL_CONTEXT_PLATFORM, reinterpret_cast<cl_context_properties>(platform()),\n\t\t\t\t\t0\n\t\t\t\t};\n\t\t\t#endif\n\t\t#endif\n\t} else {\n\t\treturn {CL_CONTEXT_PLATFORM, reinterpret_cast<cl_context_properties>(platform()), 0};\n\t}\n}\n\nContext::Context(Platform* platform, uint32_t device_type, bool shareGLContext \/*= false*\/) : platform(platform), glInterop(shareGLContext) {\n\tcl_int err;\n\tauto cprops = getContextProperties(*platform->_internal(), shareGLContext);\n\tcontext.reset(new cl::Context(static_cast<cl_device_type>(device_type), cprops.data(), nullptr, nullptr, &err));\n\tif(err != CL_SUCCESS)\n\t\tWARN(\"Could not create context (\" + getErrorString(err) + \")\");\n\tFAIL_IF(err != CL_SUCCESS);\n}\n\nContext::~Context() = default;\n\nContext::Context(Platform* platform, const std::vector<DeviceRef>& devices, bool shareGLContext \/*= false*\/) : platform(platform), devices(devices), glInterop(shareGLContext) {\n\n\tcl_int err;\n\tauto cprops = getContextProperties(*platform->_internal(), shareGLContext);\n\tstd::vector<cl::Device> cl_devices;\n\tfor(auto device : devices)\n\t\tcl_devices.push_back(*device->_internal());\n\tcontext.reset(new cl::Context(cl_devices, cprops.data(), nullptr, nullptr, &err));\n\tif(err != CL_SUCCESS)\n\t\tWARN(\"Could not create context (\" + getErrorString(err) + \")\");\n\tFAIL_IF(err != CL_SUCCESS);\n}\n\nContext::Context(Platform* platform, Device* device, bool shareGLContext \/*= false*\/) : platform(platform), devices(std::vector<DeviceRef>{device}), glInterop(shareGLContext) {\n\tcl_int err;\n\tauto cprops = getContextProperties(*platform->_internal(), shareGLContext);\n\tstd::vector<cl::Device> cl_devices;\n\tcontext.reset(new cl::Context({*device->_internal()}, cprops.data(), nullptr, nullptr, &err));\n\tif(err != CL_SUCCESS)\n\t\tWARN(\"Could not create context (\" + getErrorString(err) + \")\");\n\tFAIL_IF(err != CL_SUCCESS);\n}\n\nContext::Context(const Context& context) : context(new cl::Context(*context.context.get())), platform(context.platform), devices(context.devices), glInterop(context.glInterop) { }\n\n\/\/Context::Context(Context&& context) = default;\n\/\/\n\/\/Context& Context::operator=(Context&&) = default;\n\nstd::vector<intptr_t> Context::getProperties() const {\n\treturn context->getInfo<CL_CONTEXT_PROPERTIES>();\n}\n\nstd::vector<DeviceRef> Context::getDevices() {\n\tif(devices.empty()) {\n\t\tstd::vector<cl::Device> cl_devices = context->getInfo<CL_CONTEXT_DEVICES>();\n\t\tfor(auto device : cl_devices)\n\t\t\tdevices.push_back(new Device(&device));\n\t}\n\treturn devices;\n}\n\n\n} \/* namespace CL *\/\n} \/* namespace Rendering *\/\n#endif \/* RENDERING_HAS_LIB_OPENCL *\/\n<commit_msg>removed getCurrentContext and getCurrentDisplay (directly using glXGetCurrentContext or wglGetCurrentContext)<commit_after>\/*\n\tThis file is part of the Rendering library.\n\tCopyright (C) 2014 Sascha Brandt <myeti@mail.upb.de>\n\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#ifdef RENDERING_HAS_LIB_OPENCL\n#include \"Context.h\"\n\n#include \"Platform.h\"\n#include \"Device.h\"\n#include \"CLUtils.h\"\n\n\n#include <Rendering\/Helper.h>\n\n#include <Util\/Macros.h>\n\n#include <CL\/cl.hpp>\n\n\n#if defined __APPLE__ || defined(MACOSX)\n#else\n    #if defined WIN32\n    #else\n        \/\/needed for context sharing functions\n        #include <GL\/glx.h>\n    #endif\n#endif\n\nnamespace Rendering {\nnamespace CL {\n\nstd::vector<cl_context_properties> getContextProperties(const cl::Platform& platform, bool shareGLContext) {\n\tif(shareGLContext) {\n\n\n\t\t#if defined (__APPLE__) || defined(MACOSX)\n\t\t\tCGLContextObj kCGLContext = CGLGetCurrentContext();\n\t\t\tCGLShareGroupObj kCGLShareGroup = CGLGetShareGroup(kCGLContext);\n\t\t\treturn {\n\t\t\t\tCL_CONTEXT_PROPERTY_USE_CGL_SHAREGROUP_APPLE, reinterpret_cast<cl_context_properties>(kCGLShareGroup),\n\t\t\t\tCL_CONTEXT_PLATFORM, reinterpret_cast<cl_context_properties>(platform()),\n\t\t\t\t0\n\t\t\t};\n\t\t#else\n\t\t\t#if defined WIN32 \/\/ Win32\n\t\t\t\treturn {\n\t\t\t\t\tCL_GL_CONTEXT_KHR, reinterpret_cast<cl_context_properties>(wglGetCurrentContext()),\n\t\t\t\t\tCL_WGL_HDC_KHR, reinterpret_cast<cl_context_properties>(wglGetCurrentDC()),\n\t\t\t\t\tCL_CONTEXT_PLATFORM, reinterpret_cast<cl_context_properties>(platform()),\n\t\t\t\t\t0\n\t\t\t\t};\n\t\t\t#else\n\t\t\t\treturn {\n\t\t\t\t\tCL_GL_CONTEXT_KHR, reinterpret_cast<cl_context_properties>(glXGetCurrentContext()),\n\t\t\t\t\tCL_GLX_DISPLAY_KHR, reinterpret_cast<cl_context_properties>(glXGetCurrentDisplay()),\n\t\t\t\t\tCL_CONTEXT_PLATFORM, reinterpret_cast<cl_context_properties>(platform()),\n\t\t\t\t\t0\n\t\t\t\t};\n\t\t\t#endif\n\t\t#endif\n\t} else {\n\t\treturn {CL_CONTEXT_PLATFORM, reinterpret_cast<cl_context_properties>(platform()), 0};\n\t}\n}\n\nContext::Context(Platform* platform, uint32_t device_type, bool shareGLContext \/*= false*\/) : platform(platform), glInterop(shareGLContext) {\n\tcl_int err;\n\tauto cprops = getContextProperties(*platform->_internal(), shareGLContext);\n\tcontext.reset(new cl::Context(static_cast<cl_device_type>(device_type), cprops.data(), nullptr, nullptr, &err));\n\tif(err != CL_SUCCESS)\n\t\tWARN(\"Could not create context (\" + getErrorString(err) + \")\");\n\tFAIL_IF(err != CL_SUCCESS);\n}\n\nContext::~Context() = default;\n\nContext::Context(Platform* platform, const std::vector<DeviceRef>& devices, bool shareGLContext \/*= false*\/) : platform(platform), devices(devices), glInterop(shareGLContext) {\n\n\tcl_int err;\n\tauto cprops = getContextProperties(*platform->_internal(), shareGLContext);\n\tstd::vector<cl::Device> cl_devices;\n\tfor(auto device : devices)\n\t\tcl_devices.push_back(*device->_internal());\n\tcontext.reset(new cl::Context(cl_devices, cprops.data(), nullptr, nullptr, &err));\n\tif(err != CL_SUCCESS)\n\t\tWARN(\"Could not create context (\" + getErrorString(err) + \")\");\n\tFAIL_IF(err != CL_SUCCESS);\n}\n\nContext::Context(Platform* platform, Device* device, bool shareGLContext \/*= false*\/) : platform(platform), devices(std::vector<DeviceRef>{device}), glInterop(shareGLContext) {\n\tcl_int err;\n\tauto cprops = getContextProperties(*platform->_internal(), shareGLContext);\n\tstd::vector<cl::Device> cl_devices;\n\tcontext.reset(new cl::Context({*device->_internal()}, cprops.data(), nullptr, nullptr, &err));\n\tif(err != CL_SUCCESS)\n\t\tWARN(\"Could not create context (\" + getErrorString(err) + \")\");\n\tFAIL_IF(err != CL_SUCCESS);\n}\n\nContext::Context(const Context& context) : context(new cl::Context(*context.context.get())), platform(context.platform), devices(context.devices), glInterop(context.glInterop) { }\n\n\/\/Context::Context(Context&& context) = default;\n\/\/\n\/\/Context& Context::operator=(Context&&) = default;\n\nstd::vector<intptr_t> Context::getProperties() const {\n\treturn context->getInfo<CL_CONTEXT_PROPERTIES>();\n}\n\nstd::vector<DeviceRef> Context::getDevices() {\n\tif(devices.empty()) {\n\t\tstd::vector<cl::Device> cl_devices = context->getInfo<CL_CONTEXT_DEVICES>();\n\t\tfor(auto device : cl_devices)\n\t\t\tdevices.push_back(new Device(&device));\n\t}\n\treturn devices;\n}\n\n\n} \/* namespace CL *\/\n} \/* namespace Rendering *\/\n#endif \/* RENDERING_HAS_LIB_OPENCL *\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"Genes\/Total_Force_Gene.h\"\n\n#include <string>\n#include <numeric>\n#include <cmath>\n#include <algorithm>\n\n#include \"Game\/Board.h\"\n#include \"Game\/Piece.h\"\n#include \"Game\/Color.h\"\n#include \"Genes\/Gene.h\"\n#include \"Genes\/Piece_Strength_Gene.h\"\n\nTotal_Force_Gene::Total_Force_Gene(const Piece_Strength_Gene* const piece_strength_source_in) noexcept : piece_strength_source(piece_strength_source_in)\n{\n}\n\ndouble Total_Force_Gene::score_board(const Board& board, const Piece_Color perspective, size_t, double) const noexcept\n{\n    assert(piece_strength_source);\n    const auto& values = piece_strength_source->piece_values();\n    return std::accumulate(Square::all_squares().begin(), Square::all_squares().end(), 0.0,\n                           [&values, &board, perspective](auto sum, auto square)\n                           {\n                               const auto piece = board.piece_on_square(square);\n                               if(piece && piece.color() == perspective)\n                               {\n                                   return sum + values[static_cast<size_t>(piece.type())];\n                               }\n                               else\n                               {\n                                   return sum;\n                               }\n                           });\n}\n\nstd::string Total_Force_Gene::name() const noexcept\n{\n    return \"Total Force Gene\";\n}\n\nvoid Total_Force_Gene::reset_piece_strength_gene(const Piece_Strength_Gene* const psg) noexcept\n{\n    piece_strength_source = psg;\n}\n\ndouble Total_Force_Gene::game_progress(const Board& board) const noexcept\n{\n    const auto king_value = std::abs(piece_strength_source->piece_value({Piece_Color::WHITE, Piece_Type::KING}));\n    std::array<double, 2> piece_value_left{};\n    for(auto square : Square::all_squares())\n    {\n        if(const auto piece = board.piece_on_square(square))\n        {\n            piece_value_left[static_cast<size_t>(piece.color())] += std::abs(piece_strength_source->piece_value(piece));\n        }\n    }\n\n    return (1.0 - *std::min_element(piece_value_left.begin(), piece_value_left.end()))\/(1.0 - king_value);\n}\n<commit_msg>Split overlong line<commit_after>#include \"Genes\/Total_Force_Gene.h\"\n\n#include <string>\n#include <numeric>\n#include <cmath>\n#include <algorithm>\n\n#include \"Game\/Board.h\"\n#include \"Game\/Piece.h\"\n#include \"Game\/Color.h\"\n#include \"Genes\/Gene.h\"\n#include \"Genes\/Piece_Strength_Gene.h\"\n\nTotal_Force_Gene::Total_Force_Gene(const Piece_Strength_Gene* const piece_strength_source_in) noexcept :\n    piece_strength_source(piece_strength_source_in)\n{\n}\n\ndouble Total_Force_Gene::score_board(const Board& board, const Piece_Color perspective, size_t, double) const noexcept\n{\n    assert(piece_strength_source);\n    const auto& values = piece_strength_source->piece_values();\n    return std::accumulate(Square::all_squares().begin(), Square::all_squares().end(), 0.0,\n                           [&values, &board, perspective](auto sum, auto square)\n                           {\n                               const auto piece = board.piece_on_square(square);\n                               if(piece && piece.color() == perspective)\n                               {\n                                   return sum + values[static_cast<size_t>(piece.type())];\n                               }\n                               else\n                               {\n                                   return sum;\n                               }\n                           });\n}\n\nstd::string Total_Force_Gene::name() const noexcept\n{\n    return \"Total Force Gene\";\n}\n\nvoid Total_Force_Gene::reset_piece_strength_gene(const Piece_Strength_Gene* const psg) noexcept\n{\n    piece_strength_source = psg;\n}\n\ndouble Total_Force_Gene::game_progress(const Board& board) const noexcept\n{\n    const auto king_value = std::abs(piece_strength_source->piece_value({Piece_Color::WHITE, Piece_Type::KING}));\n    std::array<double, 2> piece_value_left{};\n    for(auto square : Square::all_squares())\n    {\n        if(const auto piece = board.piece_on_square(square))\n        {\n            piece_value_left[static_cast<size_t>(piece.color())] += std::abs(piece_strength_source->piece_value(piece));\n        }\n    }\n\n    return (1.0 - *std::min_element(piece_value_left.begin(), piece_value_left.end()))\/(1.0 - king_value);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  Copyright (c) 2007-2008, 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\/static_assert.hpp\"\n#include \"boost\/format.hpp\"\n#include \"boost\/mpl\/eval_if.hpp\"\n\n#include \"boost\/type_traits\/is_same.hpp\"\n\n#include \"OpenEXR\/half.h\"\n#include \"OpenEXR\/ImathLimits.h\"\n\n#include \"IECore\/TIFFImageWriter.h\"\n#include \"IECore\/MessageHandler.h\"\n#include \"IECore\/VectorTypedData.h\"\n#include \"IECore\/ByteOrder.h\"\n#include \"IECore\/ImagePrimitive.h\"\n#include \"IECore\/FileNameParameter.h\"\n#include \"IECore\/Parameter.h\"\n#include \"IECore\/NumericParameter.h\"\n#include \"IECore\/ScopedTIFFExceptionTranslator.h\"\n#include \"IECore\/DataConvert.h\"\n#include \"IECore\/ScaledDataConversion.h\"\n#include \"IECore\/TypeTraits.h\"\n#include \"IECore\/DespatchTypedData.h\"\n\n#include \"tiffio.h\"\n\nusing namespace IECore;\nusing namespace std;\nusing namespace Imath;\nusing namespace boost;\n\nconst Writer::WriterDescription<TIFFImageWriter> TIFFImageWriter::m_writerDescription(\"tiff tif\");\n\nTIFFImageWriter::TIFFImageWriter()\n\t\t: \tImageWriter(\"TIFFImageWriter\", \"Serializes images to the Tagged Image File Format (TIFF) format\")\n{\n\tconstructParameters();\n}\n\nTIFFImageWriter::TIFFImageWriter( ObjectPtr image, const string &fileName )\n\t\t: \tImageWriter(\"TIFFImageWriter\", \"Serializes images to the Tagged Image File Format (TIFF) format\")\n{\n\tconstructParameters();\n\tm_objectParameter->setValue( image );\n\tm_fileNameParameter->setTypedValue( fileName );\n}\n\nvoid TIFFImageWriter::constructParameters()\n{\n\tIntParameter::PresetsMap bitDepthPresets;\n\tbitDepthPresets[\"8\"] = 8;\n\tbitDepthPresets[\"16\"] = 16;\n\tbitDepthPresets[\"32\"] = 32;\n\n\tm_bitDepthParameter = new IntParameter(\n\t        \"bitdepth\",\n\t        \"Output TIFF bit depth\",\n\t        16,\n\t        8,\n\t        32,\n\t        bitDepthPresets,\n\t        true);\n\n\tparameters()->addParameter( m_bitDepthParameter );\n\n\t\/\/ compression parameter\n\tIntParameter::PresetsMap compressionPresets;\n\tcompressionPresets[\"none\"]    = COMPRESSION_NONE;\n\tcompressionPresets[\"lzw\"]     = COMPRESSION_LZW;\n\tcompressionPresets[\"jpeg\"]    = COMPRESSION_JPEG;\n\tcompressionPresets[\"deflate\"] = COMPRESSION_DEFLATE;\n\n\t\/\/\/ Verify min\n\tBOOST_STATIC_ASSERT( COMPRESSION_NONE < COMPRESSION_LZW );\n\tBOOST_STATIC_ASSERT( COMPRESSION_NONE < COMPRESSION_JPEG );\n\tBOOST_STATIC_ASSERT( COMPRESSION_NONE < COMPRESSION_DEFLATE );\n\n\t\/\/\/ Verify max\n\tBOOST_STATIC_ASSERT( COMPRESSION_DEFLATE > COMPRESSION_NONE );\n\tBOOST_STATIC_ASSERT( COMPRESSION_DEFLATE > COMPRESSION_LZW );\n\tBOOST_STATIC_ASSERT( COMPRESSION_DEFLATE > COMPRESSION_JPEG );\n\n\tm_compressionParameter = new IntParameter(\n\t        \"compression\",\n\t        \"TIFF compression method\",\n\t        compressionPresets[\"lzw\"],\n\t        COMPRESSION_NONE,\n\t        COMPRESSION_DEFLATE,\n\t        compressionPresets,\n\t        true\n\t);\n\n\tparameters()->addParameter( m_compressionParameter );\n}\n\nTIFFImageWriter::~TIFFImageWriter()\n{\n}\n\ntemplate<typename ChannelData>\nstruct TIFFImageWriter::ChannelConverter\n{\n\ttypedef typename ChannelData::Ptr ReturnType;\n\t\n\tstd::string m_channelName;\n\t\n\tChannelConverter( const std::string &channelName ) : m_channelName( channelName )\n\t{\n\t}\n\n\ttemplate<typename T>\n\tReturnType operator()( typename T::Ptr data )\n\t{\n\t\tassert( data );\n\t\t\t\n\t\treturn DataConvert < T, ChannelData, ScaledDataConversion< typename T::ValueType::value_type, typename ChannelData::ValueType::value_type> >()\n\t\t(\n\t\t\tboost::static_pointer_cast<const T>( data )\n\t\t);\n\t};\n\t\n\tstruct ErrorHandler\n\t{\n\t\ttemplate<typename T, typename F>\n\t\tvoid operator()( typename T::ConstPtr data, const F& functor )\n\t\t{\n\t\t\tassert( data );\n\t\t\n\t\t\tthrow InvalidArgumentException( ( boost::format( \"TIFFImageWriter: Invalid data type \\\"%s\\\" for channel \\\"%s\\\".\" ) % Object::typeNameFromTypeId( data->typeId() ) % functor.m_channelName ).str() );\t\t\n\t\t}\n\t};\n};\n\ntemplate<typename T>\nvoid TIFFImageWriter::encodeChannels( ConstImagePrimitivePtr image, const vector<string> &names, const Imath::Box2i &dataWindow, tiff *tiffImage, size_t bufSize, unsigned int numStrips ) const\n{\n\tassert( tiffImage );\n\n\tint width  = 1 + dataWindow.max.x - dataWindow.min.x;\n\tint height = 1 + dataWindow.max.y - dataWindow.min.y;\n\tint area = width * height;\n\n\tint samplesPerPixel = names.size();\n\n\t\/\/ Build a vector in which we place all the image channels\n\n\ttypedef TypedData< vector<T> > ChannelData;\n\n\tvector<T> imageBuffer( samplesPerPixel * area, 0 );\n\n\t\/\/ Encode eaech individual channel into the buffer\n\tint channelOffset = 0;\n\tfor ( vector<string>::const_iterator i = names.begin(); i != names.end(); ++i, ++channelOffset )\n\t{\n\t\tDataPtr dataContainer = image->variables.find(i->c_str())->second.data;\n\t\tassert( dataContainer );\n\n\t\tChannelConverter<ChannelData> converter( *i );\n\t\t\n\t\ttypename ChannelData::Ptr channelData = despatchTypedData<\t\t\t\n\t\t\tChannelConverter<ChannelData>, \n\t\t\tTypeTraits::IsNumericVectorTypedData,\n\t\t\ttypename ChannelConverter<ChannelData>::ErrorHandler\n\t\t>( dataContainer, converter );\n\n\t\tassert( channelData );\n\n\t\tif ( channelData->readable().size() == 0)\n\t\t{\n\t\t\tthrow InvalidArgumentException( (boost::format( \"TIFFImageWriter: Invalid data size \\\"%s\\\" for channel \\\"%s\\\".\" ) % Object::typeNameFromTypeId(dataContainer->typeId()) % *i).str() );\n\t\t}\n\n\t\tfor ( typename ChannelData::ValueType::size_type j = 0; j < channelData->readable().size(); ++j )\n\t\t{\n\t\t\timageBuffer[ samplesPerPixel*j + channelOffset ] = channelData->readable()[j];\n\t\t}\n\t}\n\n\t\/\/\/ Write the image buffer to the TIFF file, strip by strip\n\tint offset = 0;\n\tfor ( tstrip_t strip = 0; strip < numStrips; ++strip )\n\t{\n\t\tint tss = TIFFStripSize(tiffImage);\n\t\tassert( tss >= 0 );\n\n\t\tint remaining = bufSize - offset;\n\t\tassert( remaining >= 0 );\n\n\t\ttsize_t lc = TIFFWriteEncodedStrip( tiffImage, strip,  (char *) &imageBuffer[0] + offset, tss < remaining ? tss : remaining );\n\t\tif ( lc == -1 )\n\t\t{\n\t\t\tthrow IOException( ( boost::format( \"TIFFImageWriter: Error writing strip %d to %s\" ) % strip % fileName() ).str() );\n\t\t}\n\n\t\toffset += lc;\n\t}\n}\n\nvoid TIFFImageWriter::writeImage( const vector<string> &names, ConstImagePrimitivePtr image, const Box2i &dataWindow ) const\n{\n\tScopedTIFFExceptionTranslator errorHandler;\n\n\t\/\/ create the tiff file\n\tTIFF *tiffImage;\n\tif ((tiffImage = TIFFOpen(fileName().c_str(), \"w\")) == NULL)\n\t{\n\t\tthrow IOException(\"TIFFImageWriter: Could not open '\" + fileName() + \"' for writing.\");\n\t}\n\n\tassert( tiffImage );\n\n\ttry\n\t{\n\t\t\/\/\/ Get the channels RGBA at the front, in that order, if they exist\n\t\tvector<string> desiredChannelOrder;\n\t\tdesiredChannelOrder.push_back( \"R\" );\n\t\tdesiredChannelOrder.push_back( \"G\" );\n\t\tdesiredChannelOrder.push_back( \"B\" );\n\t\tdesiredChannelOrder.push_back( \"A\" );\n\n\t\tvector<string> namesCopy = names;\n\t\tvector<string> filteredNames;\n\n\t\tint rgbChannelsFound = 0;\n\t\tbool haveAlpha = false;\n\t\tfor ( vector<string>::const_iterator it = desiredChannelOrder.begin(); it != desiredChannelOrder.end(); ++it )\n\t\t{\n\t\t\tvector<string>::iterator res = find( namesCopy.begin(), namesCopy.end(), *it );\n\t\t\tif ( res != namesCopy.end() )\n\t\t\t{\n\t\t\t\tif ( *it == \"A\" )\n\t\t\t\t{\n\t\t\t\t\thaveAlpha = true;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\trgbChannelsFound ++;\n\t\t\t\t}\n\t\t\t\tnamesCopy.erase( res );\n\t\t\t\tfilteredNames.push_back( *it );\n\t\t\t}\n\t\t}\n\n\t\tfor ( vector<string>::const_iterator it = namesCopy.begin(); it != namesCopy.end(); ++it )\n\t\t{\n\t\t\tfilteredNames.push_back( *it );\n\t\t}\n\n\t\tassert( names.size() == filteredNames.size() );\n\n\t\tif ( rgbChannelsFound == 0 )\n\t\t{\n\t\t\tTIFFSetField( tiffImage, TIFFTAG_PHOTOMETRIC, (uint16)PHOTOMETRIC_MINISBLACK );\n\t\t}\n\t\telse if ( rgbChannelsFound == 3 )\n\t\t{\n\t\t\tTIFFSetField( tiffImage, TIFFTAG_PHOTOMETRIC, (uint16)PHOTOMETRIC_RGB );\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthrow IOException(\"TIFFImageWriter: Incorrect number of RGB channels specified while writing \" + fileName() );\n\t\t}\n\n\t\t\/\/ compute the number of channels\n\t\tint samplesPerPixel = filteredNames.size();\n\n\t\tTIFFSetField( tiffImage, TIFFTAG_SAMPLESPERPIXEL, (uint16)samplesPerPixel );\n\n\t\tint numExtraSamples = filteredNames.size() - rgbChannelsFound;\n\t\tassert( numExtraSamples >= 0 );\n\n\t\tvector<uint16> extraSamples;\n\t\tif ( haveAlpha )\n\t\t{\n\t\t\textraSamples.push_back( (uint16)EXTRASAMPLE_UNASSALPHA );\n\t\t}\n\n\t\tif ( numExtraSamples )\n\t\t{\n\t\t\twhile ( (int)extraSamples.size() < numExtraSamples )\n\t\t\t{\n\t\t\t\textraSamples.push_back( EXTRASAMPLE_UNSPECIFIED );\n\t\t\t}\n\n\t\t\tassert( (int)extraSamples.size() == numExtraSamples );\n\n\t\t\tTIFFSetField( tiffImage, TIFFTAG_EXTRASAMPLES, extraSamples.size(), (uint16*)&extraSamples[0] );\n\t\t}\n\n\t\t\/\/ compute the writebox\n\t\tint width  = 1 + dataWindow.max.x - dataWindow.min.x;\n\t\tint height = 1 + dataWindow.max.y - dataWindow.min.y;\n\n\t\t\/\/\/ \\todo different compression methods have a bearing on other attributes, eg. the strip size\n\t\t\/\/\/ handle these issues a bit better and perhaps more explicitly here.  also, we should probably\n\t\t\/\/\/ warn the user in cases where parameter settings are not permitted (eg 16 bit jpeg)\n\t\tint compression = parameters()->parameter<IntParameter>(\"compression\")->getNumericValue();\n\t\tTIFFSetField( tiffImage, TIFFTAG_COMPRESSION, compression );\n\n\t\tint bitDepth = m_bitDepthParameter->getNumericValue();\n\t\tif ( compression == COMPRESSION_JPEG )\n\t\t{\n\t\t\t\/\/\/ \\todo Warn\n\t\t\t\/\/\/ \\todo Decide whether to change the compression method or the bitdepth\n\t\t\tbitDepth = 8;\n\t\t}\n\n\t\tswitch ( bitDepth )\n\t\t{\n\t\tcase 8:\n\t\t\tTIFFSetField( tiffImage, TIFFTAG_SAMPLEFORMAT, (uint16)SAMPLEFORMAT_UINT );\n\t\t\tbreak;\n\t\tcase 16:\n\t\t\tTIFFSetField( tiffImage, TIFFTAG_SAMPLEFORMAT, (uint16)SAMPLEFORMAT_UINT );\n\t\t\tbreak;\n\t\tcase 32:\n\t\t\tTIFFSetField( tiffImage, TIFFTAG_SAMPLEFORMAT, (uint16)SAMPLEFORMAT_IEEEFP );\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tassert( 0 );\n\t\t}\n\n\t\t\/\/ number of strips to write.  TIFF's JPEG compression requires rps to be a multiple of 8\n\t\tint rowsPerStrip = 8;\n\n\t\t\/\/ now properly compute # of strips\n\t\tint strips = height \/ rowsPerStrip + (height % rowsPerStrip > 0 ? 1 : 0);\n\n\t\t\/\/ set the basic values\n\t\tTIFFSetField( tiffImage, TIFFTAG_IMAGEWIDTH, (uint32)width );\n\t\tTIFFSetField( tiffImage, TIFFTAG_IMAGELENGTH, (uint32)height );\n\n\t\tif ( dataWindow != image->getDisplayWindow() )\n\t\t{\n\t\t\tV2i position = dataWindow.min - image->getDisplayWindow().min;\n\n\t\t\tTIFFSetField( tiffImage, TIFFTAG_XPOSITION, (float) position.x );\n\t\t\tTIFFSetField( tiffImage, TIFFTAG_YPOSITION, (float) position.y );\n\n\t\t\tint displayWidth = 1 + image->getDisplayWindow().size().x;\n\t\t\tint displayHeight = 1 + image->getDisplayWindow().size().y;\n\t\t\tTIFFSetField( tiffImage, TIFFTAG_PIXAR_IMAGEFULLWIDTH, (uint32)( displayWidth ) );\n\t\t\tTIFFSetField( tiffImage, TIFFTAG_PIXAR_IMAGEFULLLENGTH, (uint32)( displayHeight ) );\n\t\t}\n\n\t\tTIFFSetField( tiffImage, TIFFTAG_BITSPERSAMPLE, (uint16)bitDepth );\n\t\tTIFFSetField( tiffImage, TIFFTAG_ROWSPERSTRIP, (uint32)rowsPerStrip );\n\n\t\t\/\/\/ \\todo What about files written on big endian platforms?\n\t\tTIFFSetField( tiffImage, TIFFTAG_FILLORDER, (uint16)FILLORDER_MSB2LSB );\n\t\tTIFFSetField( tiffImage, TIFFTAG_PLANARCONFIG, (uint16)PLANARCONFIG_CONTIG );\n\n\t\tTIFFSetField( tiffImage, TIFFTAG_XRESOLUTION, 1 );\n\t\tTIFFSetField( tiffImage, TIFFTAG_YRESOLUTION, 1 );\n\t\tTIFFSetField( tiffImage, TIFFTAG_RESOLUTIONUNIT, (uint16)RESUNIT_NONE );\n\n\t\tsize_t bufSize = (size_t)( (float)bitDepth \/ 8 * samplesPerPixel * width * height );\n\t\tassert( bufSize );\n\n\t\tswitch ( bitDepth )\n\t\t{\n\t\tcase 8:\n\t\t\tencodeChannels<unsigned char>(image, filteredNames, dataWindow, tiffImage, bufSize, strips );\n\t\t\tbreak;\n\n\t\tcase 16:\n\t\t\tencodeChannels<uint16>(image, filteredNames, dataWindow, tiffImage, bufSize, strips );\n\t\t\tbreak;\n\n\t\tcase 32:\n\t\t\tencodeChannels<float>(image, filteredNames, dataWindow, tiffImage, bufSize, strips );\n\t\t\tbreak;\n\t\t}\n\t}\n\tcatch (...)\n\t{\n\t\tTIFFClose( tiffImage );\n\t\tthrow;\n\t}\n\n\tTIFFClose( tiffImage );\n}\n<commit_msg>Implemented todo<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  Copyright (c) 2007-2008, 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\/static_assert.hpp\"\n#include \"boost\/format.hpp\"\n#include \"boost\/mpl\/eval_if.hpp\"\n\n#include \"boost\/type_traits\/is_same.hpp\"\n\n#include \"OpenEXR\/half.h\"\n#include \"OpenEXR\/ImathLimits.h\"\n\n#include \"IECore\/TIFFImageWriter.h\"\n#include \"IECore\/MessageHandler.h\"\n#include \"IECore\/VectorTypedData.h\"\n#include \"IECore\/ByteOrder.h\"\n#include \"IECore\/ImagePrimitive.h\"\n#include \"IECore\/FileNameParameter.h\"\n#include \"IECore\/Parameter.h\"\n#include \"IECore\/NumericParameter.h\"\n#include \"IECore\/ScopedTIFFExceptionTranslator.h\"\n#include \"IECore\/DataConvert.h\"\n#include \"IECore\/ScaledDataConversion.h\"\n#include \"IECore\/TypeTraits.h\"\n#include \"IECore\/DespatchTypedData.h\"\n\n#include \"tiffio.h\"\n\nusing namespace IECore;\nusing namespace std;\nusing namespace Imath;\nusing namespace boost;\n\nconst Writer::WriterDescription<TIFFImageWriter> TIFFImageWriter::m_writerDescription(\"tiff tif\");\n\nTIFFImageWriter::TIFFImageWriter()\n\t\t: \tImageWriter(\"TIFFImageWriter\", \"Serializes images to the Tagged Image File Format (TIFF) format\")\n{\n\tconstructParameters();\n}\n\nTIFFImageWriter::TIFFImageWriter( ObjectPtr image, const string &fileName )\n\t\t: \tImageWriter(\"TIFFImageWriter\", \"Serializes images to the Tagged Image File Format (TIFF) format\")\n{\n\tconstructParameters();\n\tm_objectParameter->setValue( image );\n\tm_fileNameParameter->setTypedValue( fileName );\n}\n\nvoid TIFFImageWriter::constructParameters()\n{\n\tIntParameter::PresetsMap bitDepthPresets;\n\tbitDepthPresets[\"8\"] = 8;\n\tbitDepthPresets[\"16\"] = 16;\n\tbitDepthPresets[\"32\"] = 32;\n\n\tm_bitDepthParameter = new IntParameter(\n\t        \"bitdepth\",\n\t        \"Output TIFF bit depth\",\n\t        16,\n\t        8,\n\t        32,\n\t        bitDepthPresets,\n\t        true);\n\n\tparameters()->addParameter( m_bitDepthParameter );\n\n\t\/\/ compression parameter\n\tIntParameter::PresetsMap compressionPresets;\n\tcompressionPresets[\"none\"]    = COMPRESSION_NONE;\n\tcompressionPresets[\"lzw\"]     = COMPRESSION_LZW;\n\tcompressionPresets[\"jpeg\"]    = COMPRESSION_JPEG;\n\tcompressionPresets[\"deflate\"] = COMPRESSION_DEFLATE;\n\n\t\/\/\/ Verify min\n\tBOOST_STATIC_ASSERT( COMPRESSION_NONE < COMPRESSION_LZW );\n\tBOOST_STATIC_ASSERT( COMPRESSION_NONE < COMPRESSION_JPEG );\n\tBOOST_STATIC_ASSERT( COMPRESSION_NONE < COMPRESSION_DEFLATE );\n\n\t\/\/\/ Verify max\n\tBOOST_STATIC_ASSERT( COMPRESSION_DEFLATE > COMPRESSION_NONE );\n\tBOOST_STATIC_ASSERT( COMPRESSION_DEFLATE > COMPRESSION_LZW );\n\tBOOST_STATIC_ASSERT( COMPRESSION_DEFLATE > COMPRESSION_JPEG );\n\n\tm_compressionParameter = new IntParameter(\n\t        \"compression\",\n\t        \"TIFF compression method\",\n\t        compressionPresets[\"lzw\"],\n\t        COMPRESSION_NONE,\n\t        COMPRESSION_DEFLATE,\n\t        compressionPresets,\n\t        true\n\t);\n\n\tparameters()->addParameter( m_compressionParameter );\n}\n\nTIFFImageWriter::~TIFFImageWriter()\n{\n}\n\ntemplate<typename ChannelData>\nstruct TIFFImageWriter::ChannelConverter\n{\n\ttypedef typename ChannelData::Ptr ReturnType;\n\t\n\tstd::string m_channelName;\n\t\n\tChannelConverter( const std::string &channelName ) : m_channelName( channelName )\n\t{\n\t}\n\n\ttemplate<typename T>\n\tReturnType operator()( typename T::Ptr data )\n\t{\n\t\tassert( data );\n\t\t\t\n\t\treturn DataConvert < T, ChannelData, ScaledDataConversion< typename T::ValueType::value_type, typename ChannelData::ValueType::value_type> >()\n\t\t(\n\t\t\tboost::static_pointer_cast<const T>( data )\n\t\t);\n\t};\n\t\n\tstruct ErrorHandler\n\t{\n\t\ttemplate<typename T, typename F>\n\t\tvoid operator()( typename T::ConstPtr data, const F& functor )\n\t\t{\n\t\t\tassert( data );\n\t\t\n\t\t\tthrow InvalidArgumentException( ( boost::format( \"TIFFImageWriter: Invalid data type \\\"%s\\\" for channel \\\"%s\\\".\" ) % Object::typeNameFromTypeId( data->typeId() ) % functor.m_channelName ).str() );\t\t\n\t\t}\n\t};\n};\n\ntemplate<typename T>\nvoid TIFFImageWriter::encodeChannels( ConstImagePrimitivePtr image, const vector<string> &names, const Imath::Box2i &dataWindow, tiff *tiffImage, size_t bufSize, unsigned int numStrips ) const\n{\n\tassert( tiffImage );\n\n\tint width  = 1 + dataWindow.max.x - dataWindow.min.x;\n\tint height = 1 + dataWindow.max.y - dataWindow.min.y;\n\tint area = width * height;\n\n\tint samplesPerPixel = names.size();\n\n\t\/\/ Build a vector in which we place all the image channels\n\n\ttypedef TypedData< vector<T> > ChannelData;\n\n\tvector<T> imageBuffer( samplesPerPixel * area, 0 );\n\n\t\/\/ Encode eaech individual channel into the buffer\n\tint channelOffset = 0;\n\tfor ( vector<string>::const_iterator i = names.begin(); i != names.end(); ++i, ++channelOffset )\n\t{\n\t\tDataPtr dataContainer = image->variables.find(i->c_str())->second.data;\n\t\tassert( dataContainer );\n\n\t\tChannelConverter<ChannelData> converter( *i );\n\t\t\n\t\ttypename ChannelData::Ptr channelData = despatchTypedData<\t\t\t\n\t\t\tChannelConverter<ChannelData>, \n\t\t\tTypeTraits::IsNumericVectorTypedData,\n\t\t\ttypename ChannelConverter<ChannelData>::ErrorHandler\n\t\t>( dataContainer, converter );\n\n\t\tassert( channelData );\n\n\t\tif ( channelData->readable().size() == 0)\n\t\t{\n\t\t\tthrow InvalidArgumentException( (boost::format( \"TIFFImageWriter: Invalid data size \\\"%s\\\" for channel \\\"%s\\\".\" ) % Object::typeNameFromTypeId(dataContainer->typeId()) % *i).str() );\n\t\t}\n\n\t\tfor ( typename ChannelData::ValueType::size_type j = 0; j < channelData->readable().size(); ++j )\n\t\t{\n\t\t\timageBuffer[ samplesPerPixel*j + channelOffset ] = channelData->readable()[j];\n\t\t}\n\t}\n\n\t\/\/\/ Write the image buffer to the TIFF file, strip by strip\n\tint offset = 0;\n\tfor ( tstrip_t strip = 0; strip < numStrips; ++strip )\n\t{\n\t\tint tss = TIFFStripSize(tiffImage);\n\t\tassert( tss >= 0 );\n\n\t\tint remaining = bufSize - offset;\n\t\tassert( remaining >= 0 );\n\n\t\ttsize_t lc = TIFFWriteEncodedStrip( tiffImage, strip,  (char *) &imageBuffer[0] + offset, tss < remaining ? tss : remaining );\n\t\tif ( lc == -1 )\n\t\t{\n\t\t\tthrow IOException( ( boost::format( \"TIFFImageWriter: Error writing strip %d to %s\" ) % strip % fileName() ).str() );\n\t\t}\n\n\t\toffset += lc;\n\t}\n}\n\nvoid TIFFImageWriter::writeImage( const vector<string> &names, ConstImagePrimitivePtr image, const Box2i &dataWindow ) const\n{\n\tScopedTIFFExceptionTranslator errorHandler;\n\n\t\/\/ create the tiff file\n\tTIFF *tiffImage;\n\tif ((tiffImage = TIFFOpen(fileName().c_str(), \"w\")) == NULL)\n\t{\n\t\tthrow IOException(\"TIFFImageWriter: Could not open '\" + fileName() + \"' for writing.\");\n\t}\n\n\tassert( tiffImage );\n\n\ttry\n\t{\n\t\t\/\/\/ Get the channels RGBA at the front, in that order, if they exist\n\t\tvector<string> desiredChannelOrder;\n\t\tdesiredChannelOrder.push_back( \"R\" );\n\t\tdesiredChannelOrder.push_back( \"G\" );\n\t\tdesiredChannelOrder.push_back( \"B\" );\n\t\tdesiredChannelOrder.push_back( \"A\" );\n\n\t\tvector<string> namesCopy = names;\n\t\tvector<string> filteredNames;\n\n\t\tint rgbChannelsFound = 0;\n\t\tbool haveAlpha = false;\n\t\tfor ( vector<string>::const_iterator it = desiredChannelOrder.begin(); it != desiredChannelOrder.end(); ++it )\n\t\t{\n\t\t\tvector<string>::iterator res = find( namesCopy.begin(), namesCopy.end(), *it );\n\t\t\tif ( res != namesCopy.end() )\n\t\t\t{\n\t\t\t\tif ( *it == \"A\" )\n\t\t\t\t{\n\t\t\t\t\thaveAlpha = true;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\trgbChannelsFound ++;\n\t\t\t\t}\n\t\t\t\tnamesCopy.erase( res );\n\t\t\t\tfilteredNames.push_back( *it );\n\t\t\t}\n\t\t}\n\n\t\tfor ( vector<string>::const_iterator it = namesCopy.begin(); it != namesCopy.end(); ++it )\n\t\t{\n\t\t\tfilteredNames.push_back( *it );\n\t\t}\n\n\t\tassert( names.size() == filteredNames.size() );\n\n\t\tif ( rgbChannelsFound == 0 )\n\t\t{\n\t\t\tTIFFSetField( tiffImage, TIFFTAG_PHOTOMETRIC, (uint16)PHOTOMETRIC_MINISBLACK );\n\t\t}\n\t\telse if ( rgbChannelsFound == 3 )\n\t\t{\n\t\t\tTIFFSetField( tiffImage, TIFFTAG_PHOTOMETRIC, (uint16)PHOTOMETRIC_RGB );\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthrow IOException(\"TIFFImageWriter: Incorrect number of RGB channels specified while writing \" + fileName() );\n\t\t}\n\n\t\t\/\/ compute the number of channels\n\t\tint samplesPerPixel = filteredNames.size();\n\n\t\tTIFFSetField( tiffImage, TIFFTAG_SAMPLESPERPIXEL, (uint16)samplesPerPixel );\n\n\t\tint numExtraSamples = filteredNames.size() - rgbChannelsFound;\n\t\tassert( numExtraSamples >= 0 );\n\n\t\tvector<uint16> extraSamples;\n\t\tif ( haveAlpha )\n\t\t{\n\t\t\textraSamples.push_back( (uint16)EXTRASAMPLE_UNASSALPHA );\n\t\t}\n\n\t\tif ( numExtraSamples )\n\t\t{\n\t\t\twhile ( (int)extraSamples.size() < numExtraSamples )\n\t\t\t{\n\t\t\t\textraSamples.push_back( EXTRASAMPLE_UNSPECIFIED );\n\t\t\t}\n\n\t\t\tassert( (int)extraSamples.size() == numExtraSamples );\n\n\t\t\tTIFFSetField( tiffImage, TIFFTAG_EXTRASAMPLES, extraSamples.size(), (uint16*)&extraSamples[0] );\n\t\t}\n\n\t\t\/\/ compute the writebox\n\t\tint width  = 1 + dataWindow.max.x - dataWindow.min.x;\n\t\tint height = 1 + dataWindow.max.y - dataWindow.min.y;\n\n\t\t\/\/\/ \\todo different compression methods have a bearing on other attributes, eg. the strip size\n\t\t\/\/\/ handle these issues a bit better and perhaps more explicitly here.  also, we should probably\n\t\t\/\/\/ warn the user in cases where parameter settings are not permitted (eg 16 bit jpeg)\n\t\tint compression = parameters()->parameter<IntParameter>(\"compression\")->getNumericValue();\n\t\tTIFFSetField( tiffImage, TIFFTAG_COMPRESSION, compression );\n\n\t\tint bitDepth = m_bitDepthParameter->getNumericValue();\n\t\tif ( compression == COMPRESSION_JPEG && bitDepth != 8 )\n\t\t{\n\t\t\t\/\/\/ Change the compression method rather than the bitDepth, so at least we get the output we expected at the\n\t\t\t\/\/\/ expense of a possibly larger file size. This is arguably better than switching the bitDepth to 8, which would\n\t\t\t\/\/\/ change the format of the output to something unexpected.\n\t\t\tmsg( Msg::Warning, \"TIFFImageWriter\", \"JPEG compression only compatible with 8-bit images. Switching to Deflate compression.\" );\n\t\t\tcompression = COMPRESSION_DEFLATE;\n\t\t}\n\n\t\tswitch ( bitDepth )\n\t\t{\n\t\tcase 8:\n\t\t\tTIFFSetField( tiffImage, TIFFTAG_SAMPLEFORMAT, (uint16)SAMPLEFORMAT_UINT );\n\t\t\tbreak;\n\t\tcase 16:\n\t\t\tTIFFSetField( tiffImage, TIFFTAG_SAMPLEFORMAT, (uint16)SAMPLEFORMAT_UINT );\n\t\t\tbreak;\n\t\tcase 32:\n\t\t\tTIFFSetField( tiffImage, TIFFTAG_SAMPLEFORMAT, (uint16)SAMPLEFORMAT_IEEEFP );\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tassert( 0 );\n\t\t}\n\n\t\t\/\/ number of strips to write.  TIFF's JPEG compression requires rps to be a multiple of 8\n\t\tint rowsPerStrip = 8;\n\n\t\t\/\/ now properly compute # of strips\n\t\tint strips = height \/ rowsPerStrip + (height % rowsPerStrip > 0 ? 1 : 0);\n\n\t\t\/\/ set the basic values\n\t\tTIFFSetField( tiffImage, TIFFTAG_IMAGEWIDTH, (uint32)width );\n\t\tTIFFSetField( tiffImage, TIFFTAG_IMAGELENGTH, (uint32)height );\n\n\t\tif ( dataWindow != image->getDisplayWindow() )\n\t\t{\n\t\t\tV2i position = dataWindow.min - image->getDisplayWindow().min;\n\n\t\t\tTIFFSetField( tiffImage, TIFFTAG_XPOSITION, (float) position.x );\n\t\t\tTIFFSetField( tiffImage, TIFFTAG_YPOSITION, (float) position.y );\n\n\t\t\tint displayWidth = 1 + image->getDisplayWindow().size().x;\n\t\t\tint displayHeight = 1 + image->getDisplayWindow().size().y;\n\t\t\tTIFFSetField( tiffImage, TIFFTAG_PIXAR_IMAGEFULLWIDTH, (uint32)( displayWidth ) );\n\t\t\tTIFFSetField( tiffImage, TIFFTAG_PIXAR_IMAGEFULLLENGTH, (uint32)( displayHeight ) );\n\t\t}\n\n\t\tTIFFSetField( tiffImage, TIFFTAG_BITSPERSAMPLE, (uint16)bitDepth );\n\t\tTIFFSetField( tiffImage, TIFFTAG_ROWSPERSTRIP, (uint32)rowsPerStrip );\n\n\t\t\/\/\/ \\todo What about files written on big endian platforms?\n\t\tTIFFSetField( tiffImage, TIFFTAG_FILLORDER, (uint16)FILLORDER_MSB2LSB );\n\t\tTIFFSetField( tiffImage, TIFFTAG_PLANARCONFIG, (uint16)PLANARCONFIG_CONTIG );\n\n\t\tTIFFSetField( tiffImage, TIFFTAG_XRESOLUTION, 1 );\n\t\tTIFFSetField( tiffImage, TIFFTAG_YRESOLUTION, 1 );\n\t\tTIFFSetField( tiffImage, TIFFTAG_RESOLUTIONUNIT, (uint16)RESUNIT_NONE );\n\n\t\tsize_t bufSize = (size_t)( (float)bitDepth \/ 8 * samplesPerPixel * width * height );\n\t\tassert( bufSize );\n\n\t\tswitch ( bitDepth )\n\t\t{\n\t\tcase 8:\n\t\t\tencodeChannels<unsigned char>(image, filteredNames, dataWindow, tiffImage, bufSize, strips );\n\t\t\tbreak;\n\n\t\tcase 16:\n\t\t\tencodeChannels<uint16>(image, filteredNames, dataWindow, tiffImage, bufSize, strips );\n\t\t\tbreak;\n\n\t\tcase 32:\n\t\t\tencodeChannels<float>(image, filteredNames, dataWindow, tiffImage, bufSize, strips );\n\t\t\tbreak;\n\t\t}\n\t}\n\tcatch (...)\n\t{\n\t\tTIFFClose( tiffImage );\n\t\tthrow;\n\t}\n\n\tTIFFClose( tiffImage );\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  Copyright (c) 2007, Image Engine Design Inc. All rights reserved.\n\/\/\n\/\/  Redistribution and use in source and binary forms, with or without\n\/\/  modification, are permitted provided that the following conditions are\n\/\/  met:\n\/\/\n\/\/     * Redistributions of source code must retain the above copyright\n\/\/       notice, this list of conditions and the following disclaimer.\n\/\/\n\/\/     * Redistributions in binary form must reproduce the above copyright\n\/\/       notice, this list of conditions and the following disclaimer in the\n\/\/       documentation and\/or other materials provided with the distribution.\n\/\/\n\/\/     * Neither the name of Image Engine Design nor the names of any\n\/\/       other contributors to this software may be used to endorse or\n\/\/       promote products derived from this software without specific prior\n\/\/       written permission.\n\/\/\n\/\/  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n\/\/  IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\n\/\/  THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n\/\/  PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n\/\/  CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\/\/  EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/  PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\/\/  PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\/\/  LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/  NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"IECoreRI\/ParameterList.h\"\n\n#include \"IECore\/MessageHandler.h\"\n#include \"IECore\/TypedDataDespatch.h\"\n\n#include \"boost\/format.hpp\"\n\nusing namespace IECore;\nusing namespace IECoreRI;\nusing namespace std;\nusing namespace boost;\n\nParameterList::ParameterList( const IECore::CompoundDataMap &parameters, const std::map<std::string, std::string> *typeHints )\n{\n\treserveParameters( parameters.size() );\n\tCompoundDataMap::const_iterator it;\n\tfor( it=parameters.begin(); it!=parameters.end(); it++ )\n\t{\n\t\tappendParameter( it->first, it->second, typeHints );\n\t}\n}\n\nParameterList::ParameterList( const IECore::CompoundDataMap &parameters, const std::string &prefix,\n\tconst std::map<std::string, std::string> *typeHints )\n{\n\treserveParameters( parameters.size() );\n\tCompoundDataMap::const_iterator it;\n\tfor( it=parameters.begin(); it!=parameters.end(); it++ )\n\t{\n\t\tif( 0==it->first.compare( 0, prefix.size(), prefix ) )\n\t\t{\n\t\t\tappendParameter( string( it->first, prefix.size() ), it->second, typeHints );\n\t\t}\n\t}\n}\n\t\t\t\nParameterList::ParameterList( const std::string &name, IECore::ConstDataPtr parameter, const std::map<std::string, std::string> *typeHints )\n{\n\treserveParameters( 1 );\n\tappendParameter( name, parameter, typeHints );\n}\n\t\t\t\nint ParameterList::n()\n{\n\treturn m_tokens.size();\n}\n\nchar **ParameterList::tokens()\n{\n\treturn (char **)&*(m_tokens.begin());\n}\n\nvoid **ParameterList::values()\n{\n\treturn (void **)&*(m_values.begin());\n}\n\nconst char *ParameterList::type( const std::string &name, IECore::ConstDataPtr d, size_t &arraySize, const std::map<std::string, std::string> *typeHints )\n{\n\tarraySize = 0;\n\tswitch( d->typeId() )\n\t{\n\t\tcase V3fVectorDataTypeId :\n\t\t\tarraySize = static_pointer_cast<const V3fVectorData>( d )->readable().size();\n\t\tcase V3fDataTypeId :\n\t\t\tif( typeHints )\n\t\t\t{\n\t\t\t\tmap<string, string>::const_iterator it = typeHints->find( name );\n\t\t\t\tif( it!=typeHints->end() )\n\t\t\t\t{\n\t\t\t\t\treturn it->second.c_str();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn \"vector\";\n\t\tcase Color3fVectorDataTypeId :\n\t\t\tarraySize = static_pointer_cast<const Color3fVectorData>( d )->readable().size();\n\t\tcase Color3fDataTypeId :\n\t\t\treturn \"color\";\n\t\tcase FloatVectorDataTypeId :\n\t\t\tarraySize = static_pointer_cast<const FloatVectorData>( d )->readable().size();\n\t\tcase FloatDataTypeId :\n\t\t\treturn \"float\";\n\t\tcase IntVectorDataTypeId :\n\t\t\tarraySize = static_pointer_cast<const IntVectorData>( d )->readable().size();\n\t\tcase IntDataTypeId :\n\t\tcase BoolDataTypeId :\n\t\t\treturn \"int\";\n\t\tcase StringVectorDataTypeId :\n\t\t\tarraySize = static_pointer_cast<const StringVectorData>( d )->readable().size();\n\t\tcase StringDataTypeId :\n\t\t\treturn \"string\";\n\t\tdefault :\n\t\t\tmsg( Msg::Warning, \"ParameterList::type\", format( \"Variable \\\"%s\\\" has unsupported datatype.\" ) % name );\n\t\t\treturn 0;\n\t}\n}\n\nconst void *ParameterList::value( IECore::ConstDataPtr d )\n{\n\tif( d->typeId()==StringData::staticTypeId() )\n\t{\n\t\tconst char *v = static_pointer_cast<const StringData>( d )->readable().c_str();\n\t\tm_charPtrs.push_back( v );\n\t\treturn &*(m_charPtrs.rbegin());\n\t}\n\tif( d->typeId()==BoolData::staticTypeId() )\n\t{\n\t\tm_ints.push_back( static_pointer_cast<const BoolData>( d )->readable() );\n\t\treturn &*(m_ints.rbegin());\n\t}\n\t\n\ttry\n\t{\n\t\treturn despatchSimpleTypedDataFn<const void *, SimpleTypedDataAddress, SimpleTypedDataAddressArgs>( const_pointer_cast<Data>( d ), SimpleTypedDataAddressArgs() );\n\t}\n\tcatch( ... )\n\t{\n\t}\n\t\n\ttry\n\t{\n\t\treturn despatchVectorTypedDataFn<const void *, VectorTypedDataAddress, VectorTypedDataAddressArgs>( const_pointer_cast<Data>( d ), VectorTypedDataAddressArgs() );\n\t}\n\tcatch( ... )\n\t{\n\t}\n\treturn 0;\n}\n\nvoid ParameterList::reserveParameters( size_t n )\n{\n\tm_strings.reserve( n );\n\tm_charPtrs.reserve( n );\n\tm_ints.reserve( n );\n}\n\nvoid ParameterList::appendParameter( const std::string &name, IECore::ConstDataPtr d, const std::map<std::string, std::string> *typeHints )\n{\n\tsize_t arraySize = 0;\n\tconst char *t = type( name, d, arraySize, typeHints );\n\tif( t )\n\t{\n\t\tif( arraySize )\n\t\t{\n\t\t\tm_strings.push_back( boost::str( boost::format( \"%s %s[%d]\" ) % t % name % arraySize ) );\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_strings.push_back( string( t ) + \" \" + name );\n\t\t}\n\t\tm_tokens.push_back( m_strings.rbegin()->c_str() );\n\t\tm_values.push_back( value( d ) );\n\t}\n}\n<commit_msg>Added support for M44fData in ParameterLists.<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  Copyright (c) 2007, Image Engine Design Inc. All rights reserved.\n\/\/\n\/\/  Redistribution and use in source and binary forms, with or without\n\/\/  modification, are permitted provided that the following conditions are\n\/\/  met:\n\/\/\n\/\/     * Redistributions of source code must retain the above copyright\n\/\/       notice, this list of conditions and the following disclaimer.\n\/\/\n\/\/     * Redistributions in binary form must reproduce the above copyright\n\/\/       notice, this list of conditions and the following disclaimer in the\n\/\/       documentation and\/or other materials provided with the distribution.\n\/\/\n\/\/     * Neither the name of Image Engine Design nor the names of any\n\/\/       other contributors to this software may be used to endorse or\n\/\/       promote products derived from this software without specific prior\n\/\/       written permission.\n\/\/\n\/\/  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n\/\/  IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\n\/\/  THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n\/\/  PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n\/\/  CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\/\/  EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/  PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\/\/  PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\/\/  LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/  NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"IECoreRI\/ParameterList.h\"\n\n#include \"IECore\/MessageHandler.h\"\n#include \"IECore\/TypedDataDespatch.h\"\n\n#include \"boost\/format.hpp\"\n\nusing namespace IECore;\nusing namespace IECoreRI;\nusing namespace std;\nusing namespace boost;\n\nParameterList::ParameterList( const IECore::CompoundDataMap &parameters, const std::map<std::string, std::string> *typeHints )\n{\n\treserveParameters( parameters.size() );\n\tCompoundDataMap::const_iterator it;\n\tfor( it=parameters.begin(); it!=parameters.end(); it++ )\n\t{\n\t\tappendParameter( it->first, it->second, typeHints );\n\t}\n}\n\nParameterList::ParameterList( const IECore::CompoundDataMap &parameters, const std::string &prefix,\n\tconst std::map<std::string, std::string> *typeHints )\n{\n\treserveParameters( parameters.size() );\n\tCompoundDataMap::const_iterator it;\n\tfor( it=parameters.begin(); it!=parameters.end(); it++ )\n\t{\n\t\tif( 0==it->first.compare( 0, prefix.size(), prefix ) )\n\t\t{\n\t\t\tappendParameter( string( it->first, prefix.size() ), it->second, typeHints );\n\t\t}\n\t}\n}\n\t\t\t\nParameterList::ParameterList( const std::string &name, IECore::ConstDataPtr parameter, const std::map<std::string, std::string> *typeHints )\n{\n\treserveParameters( 1 );\n\tappendParameter( name, parameter, typeHints );\n}\n\t\t\t\nint ParameterList::n()\n{\n\treturn m_tokens.size();\n}\n\nchar **ParameterList::tokens()\n{\n\treturn (char **)&*(m_tokens.begin());\n}\n\nvoid **ParameterList::values()\n{\n\treturn (void **)&*(m_values.begin());\n}\n\nconst char *ParameterList::type( const std::string &name, IECore::ConstDataPtr d, size_t &arraySize, const std::map<std::string, std::string> *typeHints )\n{\n\tarraySize = 0;\n\tswitch( d->typeId() )\n\t{\n\t\tcase V3fVectorDataTypeId :\n\t\t\tarraySize = static_pointer_cast<const V3fVectorData>( d )->readable().size();\n\t\tcase V3fDataTypeId :\n\t\t\tif( typeHints )\n\t\t\t{\n\t\t\t\tmap<string, string>::const_iterator it = typeHints->find( name );\n\t\t\t\tif( it!=typeHints->end() )\n\t\t\t\t{\n\t\t\t\t\treturn it->second.c_str();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn \"vector\";\n\t\tcase Color3fVectorDataTypeId :\n\t\t\tarraySize = static_pointer_cast<const Color3fVectorData>( d )->readable().size();\n\t\tcase Color3fDataTypeId :\n\t\t\treturn \"color\";\n\t\tcase FloatVectorDataTypeId :\n\t\t\tarraySize = static_pointer_cast<const FloatVectorData>( d )->readable().size();\n\t\tcase FloatDataTypeId :\n\t\t\treturn \"float\";\n\t\tcase IntVectorDataTypeId :\n\t\t\tarraySize = static_pointer_cast<const IntVectorData>( d )->readable().size();\n\t\tcase IntDataTypeId :\n\t\tcase BoolDataTypeId :\n\t\t\treturn \"int\";\n\t\tcase StringVectorDataTypeId :\n\t\t\tarraySize = static_pointer_cast<const StringVectorData>( d )->readable().size();\n\t\tcase StringDataTypeId :\n\t\t\treturn \"string\";\n\t\tcase M44fDataTypeId :\n\t\t\treturn \"matrix\";\n\t\tdefault :\n\t\t\tmsg( Msg::Warning, \"ParameterList::type\", format( \"Variable \\\"%s\\\" has unsupported datatype.\" ) % name );\n\t\t\treturn 0;\n\t}\n}\n\nconst void *ParameterList::value( IECore::ConstDataPtr d )\n{\n\tif( d->typeId()==StringData::staticTypeId() )\n\t{\n\t\tconst char *v = static_pointer_cast<const StringData>( d )->readable().c_str();\n\t\tm_charPtrs.push_back( v );\n\t\treturn &*(m_charPtrs.rbegin());\n\t}\n\tif( d->typeId()==BoolData::staticTypeId() )\n\t{\n\t\tm_ints.push_back( static_pointer_cast<const BoolData>( d )->readable() );\n\t\treturn &*(m_ints.rbegin());\n\t}\n\t\n\ttry\n\t{\n\t\treturn despatchSimpleTypedDataFn<const void *, SimpleTypedDataAddress, SimpleTypedDataAddressArgs>( const_pointer_cast<Data>( d ), SimpleTypedDataAddressArgs() );\n\t}\n\tcatch( ... )\n\t{\n\t}\n\t\n\ttry\n\t{\n\t\treturn despatchVectorTypedDataFn<const void *, VectorTypedDataAddress, VectorTypedDataAddressArgs>( const_pointer_cast<Data>( d ), VectorTypedDataAddressArgs() );\n\t}\n\tcatch( ... )\n\t{\n\t}\n\treturn 0;\n}\n\nvoid ParameterList::reserveParameters( size_t n )\n{\n\tm_strings.reserve( n );\n\tm_charPtrs.reserve( n );\n\tm_ints.reserve( n );\n}\n\nvoid ParameterList::appendParameter( const std::string &name, IECore::ConstDataPtr d, const std::map<std::string, std::string> *typeHints )\n{\n\tsize_t arraySize = 0;\n\tconst char *t = type( name, d, arraySize, typeHints );\n\tif( t )\n\t{\n\t\tif( arraySize )\n\t\t{\n\t\t\tm_strings.push_back( boost::str( boost::format( \"%s %s[%d]\" ) % t % name % arraySize ) );\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_strings.push_back( string( t ) + \" \" + name );\n\t\t}\n\t\tm_tokens.push_back( m_strings.rbegin()->c_str() );\n\t\tm_values.push_back( value( d ) );\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <osre\/App\/AppBase.h>\n#include <osre\/Common\/ArgumentParser.h>\n#include <osre\/Properties\/Settings.h>\n#include <osre\/Platform\/PlatformInterface.h>\n#include <osre\/Platform\/AbstractTimer.h>\n#include <osre\/RenderBackend\/RenderBackendService.h>\n#include <osre\/Scene\/Stage.h>\n\n\/\/ private includes\n#include <src\/Platform\/PlatformPluginFactory.h>\n\nnamespace OSRE {\nnamespace App {\n\nusing namespace ::OSRE::Common;\n\nconst String API_Arg = \"api\";\nconst String Tag     = \"AppBase\";\n\nstruct AppBase::Impl {\n    enum State {\n        Uninited,\n        Created,\n        Running,\n        Destroyed\n    };\n    State m_state;\n    d32 m_timediff;\n    ArgumentParser m_argParser;\n    Properties::Settings *m_settings;\n    Platform::PlatformInterface *m_platformInterface;\n    Platform::AbstractTimer *m_timer;\n    RenderBackend::RenderBackendService *m_rbService;\n    Scene::Stage *m_stage;\n    \n    Impl( i32 argc, c8 *argv[], const String &supportedArgs, const String &desc )\n    : m_state( Uninited )\n    , m_timediff( 0.0 )\n    , m_argParser( argc, argv, supportedArgs, desc )\n    , m_settings( nullptr )\n    , m_platformInterface( nullptr )\n    , m_timer( nullptr )\n    , m_rbService( nullptr )\n    , m_stage( nullptr ) {\n        m_settings = new Properties::Settings;\n        m_settings->setString( Properties::Settings::RenderAPI, \"opengl\" );\n        m_settings->setBool( Properties::Settings::PollingMode, true );\n\n#ifdef OSRE_WINDOWS\n        \/\/pConfig->setInt( Properties::ConfigurationMap::PlatformPlugin, static_cast<i32>( Platform::SDL2Plugin) );\n        m_settings->setInt( Properties::Settings::PlatformPlugin, static_cast< i32 >( Platform::WindowsPlugin ) );\n#else\n        m_settings->setInt( Properties::Settings::PlatformPlugin, static_cast< i32 >( Platform::SDL2Plugin ) );\n#endif \n    }\n\n    ~Impl(){\n        m_settings = nullptr;\n    }\n};\n\nAppBase::AppBase( i32 argc, c8 *argv[], const String &supportedArgs, const String &desc )\n: m_impl( new Impl( argc, argv, supportedArgs, desc ) ) {\n    \/\/ empty\n}\n\nAppBase::~AppBase() {\n    delete m_impl;\n    m_impl = nullptr;\n}\n\nbool AppBase::create( Properties::Settings *config ) {\n    return onCreate( config  );\n}\n\nbool AppBase::destroy() {\n    return onDestroy();\n}\n\nvoid AppBase::update() {\n    if( m_impl->m_state == Impl::Created ) {\n        m_impl->m_state = Impl::Running;\n        osre_debug(Tag, \"Set application state to running.\" );\n    }\n\n    m_impl->m_timediff = m_impl->m_timer->getTimeDiff();\n\n    onUpdate();\n}\n\nvoid AppBase::requestNextFrame() {\n    m_impl->m_rbService->update( m_impl->m_timediff );\n\n}\n\nbool AppBase::handleEvents() {\n    if( nullptr == m_impl->m_platformInterface ) {\n        osre_debug( Tag, \"AppBase::PlatforInterface not in proper state: not nullptr.\" );\n        return false;\n    }\n\n    return m_impl->m_platformInterface->update( m_impl->m_timediff );\n\n}\n\nProperties::Settings *AppBase::getSettings() const {\n    if( nullptr == m_impl ) {\n        return nullptr;\n    }\n\n    return m_impl->m_settings;\n}\n\nScene::Stage *AppBase::createStage( const String &name ) {\n    if( name.empty() ) {\n        return nullptr;\n    }\n\n    m_impl->m_stage = new Scene::Stage( \"HelloWorld\", m_impl->m_rbService );\n    \n    return m_impl->m_stage;\n}\n\nbool AppBase::onCreate( Properties::Settings *config ) {\n    if( m_impl->m_state != Impl::Uninited ) {\n        osre_debug( Tag, \"AppBase::State not in proper state: Uninited.\" );\n        return false;\n    }\n\n    \/\/ create the platform abstraction\n    if( nullptr != config ) {\n        delete m_impl->m_settings;\n        m_impl->m_settings = config;\n    }\n\n    m_impl->m_platformInterface = Platform::PlatformInterface::create( m_impl->m_settings );\n    if( m_impl->m_platformInterface ) {\n        if( !m_impl->m_platformInterface->open() ) {\n            return false;\n        }\n    }\n\n    \/\/ register any available platform-specific log streams\n    Common::AbstractLogStream *stream = Platform::PlatformPluginFactory::createPlatformLogStream();\n    if( nullptr != stream ) {\n        Logger::getInstance()->registerLogStream( stream );\n    }\n\n    m_impl->m_rbService = new RenderBackend::RenderBackendService();\n    if( !m_impl->m_rbService->open() ) {\n        m_impl->m_rbService->release();\n        m_impl->m_rbService = nullptr;\n    }\n\n    \/\/ enable render-backend\n    if( m_impl->m_platformInterface ) {\n        RenderBackend::CreateRendererEventData *data = new RenderBackend::CreateRendererEventData( m_impl->m_platformInterface->getRootSurface() );\n        m_impl->m_rbService->sendEvent( &RenderBackend::OnCreateRendererEvent, data );\n    }\n\n    \/\/ store timer instance\n    m_impl->m_timer = Platform::PlatformInterface::getInstance()->getTimer();\n\n    \/\/ set application state to Created\n    osre_debug( Tag, \"Set application state to Created.\" );\n    m_impl->m_state = Impl::Created;\n    \n    return true;\n}\n\nbool AppBase::onDestroy() {\n    if( m_impl->m_state != Impl::Running ) {\n        osre_debug( Tag, \"AppBase::State not in proper state: Running.\" );\n        return false;\n    }\n\n    if( m_impl->m_platformInterface ) {\n        Platform::PlatformInterface::destroy();\n        m_impl->m_platformInterface = nullptr;\n    }\n\n\n    osre_debug( Tag, \"Set application state to destroyed.\" );\n    m_impl->m_state = Impl::Destroyed;\n    Logger::kill();\n\n    return true;\n}\n\nvoid AppBase::onUpdate() {\n\n}\n\n}\n}\n<commit_msg>ApBase: fix invalid delete call on configuration.<commit_after>#include <osre\/App\/AppBase.h>\n#include <osre\/Common\/ArgumentParser.h>\n#include <osre\/Properties\/Settings.h>\n#include <osre\/Platform\/PlatformInterface.h>\n#include <osre\/Platform\/AbstractTimer.h>\n#include <osre\/RenderBackend\/RenderBackendService.h>\n#include <osre\/Scene\/Stage.h>\n\n\/\/ private includes\n#include <src\/Platform\/PlatformPluginFactory.h>\n\nnamespace OSRE {\nnamespace App {\n\nusing namespace ::OSRE::Common;\n\nconst String API_Arg = \"api\";\nconst String Tag     = \"AppBase\";\n\nstruct AppBase::Impl {\n    enum State {\n        Uninited,\n        Created,\n        Running,\n        Destroyed\n    };\n    State m_state;\n    d32 m_timediff;\n    ArgumentParser m_argParser;\n    Properties::Settings *m_settings;\n    Platform::PlatformInterface *m_platformInterface;\n    Platform::AbstractTimer *m_timer;\n    RenderBackend::RenderBackendService *m_rbService;\n    Scene::Stage *m_stage;\n    \n    Impl( i32 argc, c8 *argv[], const String &supportedArgs, const String &desc )\n    : m_state( Uninited )\n    , m_timediff( 0.0 )\n    , m_argParser( argc, argv, supportedArgs, desc )\n    , m_settings( nullptr )\n    , m_platformInterface( nullptr )\n    , m_timer( nullptr )\n    , m_rbService( nullptr )\n    , m_stage( nullptr ) {\n        m_settings = new Properties::Settings;\n        m_settings->setString( Properties::Settings::RenderAPI, \"opengl\" );\n        m_settings->setBool( Properties::Settings::PollingMode, true );\n\n#ifdef OSRE_WINDOWS\n        \/\/pConfig->setInt( Properties::ConfigurationMap::PlatformPlugin, static_cast<i32>( Platform::SDL2Plugin) );\n        m_settings->setInt( Properties::Settings::PlatformPlugin, static_cast< i32 >( Platform::WindowsPlugin ) );\n#else\n        m_settings->setInt( Properties::Settings::PlatformPlugin, static_cast< i32 >( Platform::SDL2Plugin ) );\n#endif \n    }\n\n    ~Impl(){\n        m_settings = nullptr;\n    }\n};\n\nAppBase::AppBase( i32 argc, c8 *argv[], const String &supportedArgs, const String &desc )\n: m_impl( new Impl( argc, argv, supportedArgs, desc ) ) {\n    \/\/ empty\n}\n\nAppBase::~AppBase() {\n    delete m_impl;\n    m_impl = nullptr;\n}\n\nbool AppBase::create( Properties::Settings *config ) {\n    return onCreate( config  );\n}\n\nbool AppBase::destroy() {\n    return onDestroy();\n}\n\nvoid AppBase::update() {\n    if( m_impl->m_state == Impl::Created ) {\n        m_impl->m_state = Impl::Running;\n        osre_debug(Tag, \"Set application state to running.\" );\n    }\n\n    m_impl->m_timediff = m_impl->m_timer->getTimeDiff();\n\n    onUpdate();\n}\n\nvoid AppBase::requestNextFrame() {\n    m_impl->m_rbService->update( m_impl->m_timediff );\n\n}\n\nbool AppBase::handleEvents() {\n    if( nullptr == m_impl->m_platformInterface ) {\n        osre_debug( Tag, \"AppBase::PlatforInterface not in proper state: not nullptr.\" );\n        return false;\n    }\n\n    return m_impl->m_platformInterface->update( m_impl->m_timediff );\n\n}\n\nProperties::Settings *AppBase::getSettings() const {\n    if( nullptr == m_impl ) {\n        return nullptr;\n    }\n\n    return m_impl->m_settings;\n}\n\nScene::Stage *AppBase::createStage( const String &name ) {\n    if( name.empty() ) {\n        return nullptr;\n    }\n\n    m_impl->m_stage = new Scene::Stage( \"HelloWorld\", m_impl->m_rbService );\n    \n    return m_impl->m_stage;\n}\n\nbool AppBase::onCreate( Properties::Settings *config ) {\n    if( m_impl->m_state != Impl::Uninited ) {\n        osre_debug( Tag, \"AppBase::State not in proper state: Uninited.\" );\n        return false;\n    }\n\n    \/\/ create the platform abstraction\n    if( nullptr != config && config != m_impl->m_settings ) {\n        delete m_impl->m_settings;\n        m_impl->m_settings = config;\n    }\n\n    m_impl->m_platformInterface = Platform::PlatformInterface::create( m_impl->m_settings );\n    if( m_impl->m_platformInterface ) {\n        if( !m_impl->m_platformInterface->open() ) {\n            return false;\n        }\n    }\n\n    \/\/ register any available platform-specific log streams\n    Common::AbstractLogStream *stream = Platform::PlatformPluginFactory::createPlatformLogStream();\n    if( nullptr != stream ) {\n        Logger::getInstance()->registerLogStream( stream );\n    }\n\n    m_impl->m_rbService = new RenderBackend::RenderBackendService();\n    if( !m_impl->m_rbService->open() ) {\n        m_impl->m_rbService->release();\n        m_impl->m_rbService = nullptr;\n    }\n\n    \/\/ enable render-backend\n    if( m_impl->m_platformInterface ) {\n        RenderBackend::CreateRendererEventData *data = new RenderBackend::CreateRendererEventData( m_impl->m_platformInterface->getRootSurface() );\n        m_impl->m_rbService->sendEvent( &RenderBackend::OnCreateRendererEvent, data );\n    }\n\n    \/\/ store timer instance\n    m_impl->m_timer = Platform::PlatformInterface::getInstance()->getTimer();\n\n    \/\/ set application state to Created\n    osre_debug( Tag, \"Set application state to Created.\" );\n    m_impl->m_state = Impl::Created;\n    \n    return true;\n}\n\nbool AppBase::onDestroy() {\n    if( m_impl->m_state != Impl::Running ) {\n        osre_debug( Tag, \"AppBase::State not in proper state: Running.\" );\n        return false;\n    }\n\n    if( m_impl->m_platformInterface ) {\n        Platform::PlatformInterface::destroy();\n        m_impl->m_platformInterface = nullptr;\n    }\n\n\n    osre_debug( Tag, \"Set application state to destroyed.\" );\n    m_impl->m_state = Impl::Destroyed;\n    Logger::kill();\n\n    return true;\n}\n\nvoid AppBase::onUpdate() {\n\n}\n\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\n\/*\n *  AudioStream.cpp\n *  sfeMovie project\n *\n *  Copyright (C) 2010-2014 Lucas Soltic\n *  lucas.soltic@orange.fr\n *\n *  This program is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License as published by the Free Software Foundation; either\n *  version 2.1 of the License, or (at your option) any later version.\n *\n *  This program is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this program; if not, write to the Free Software\n *  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n *\n *\/\n\nextern \"C\"\n{\n#include <libavformat\/avformat.h>\n#include <libavcodec\/avcodec.h>\n#include <libavutil\/samplefmt.h>\n#include <libavutil\/opt.h>\n#include <libavutil\/channel_layout.h>\n#include <libswresample\/swresample.h>\n}\n\n#include <cstring>\n#include <iostream>\n#include \"AudioStream.hpp\"\n#include \"Log.hpp\"\n#include <sfeMovie\/Movie.hpp>\n\nnamespace sfe\n{\n    AudioStream::AudioStream(AVFormatContext*& formatCtx, AVStream*& stream, DataSource& dataSource,\n                             std::shared_ptr<Timer> timer) :\n    Stream(formatCtx, stream, dataSource, timer),\n    \n    \/\/ Public properties\n    m_sampleRate(0),\n    \n    \/\/ Private data\n    m_samplesBuffer(nullptr),\n    m_audioFrame(nullptr),\n    \n    \/\/ Resampling\n    m_swrCtx(nullptr),\n    m_dstNbSamples(0),\n    m_maxDstNbSamples(0),\n    m_dstNbChannels(0),\n    m_dstLinesize(0),\n    m_dstData(nullptr)\n    {\n        m_audioFrame = av_frame_alloc();\n        CHECK(m_audioFrame, \"AudioStream::AudioStream() - out of memory\");\n        \n        \/\/ Get some audio informations\n        m_sampleRate = m_stream->codec->sample_rate;\n        \n        \/\/ Alloc a two seconds buffer\n        m_samplesBuffer = (sf::Int16*)av_malloc(sizeof(sf::Int16) * av_get_channel_layout_nb_channels(AV_CH_LAYOUT_STEREO) * m_sampleRate * 2);\n        CHECK(m_samplesBuffer, \"AudioStream::AudioStream() - out of memory\");\n        \n        \/\/ Initialize the sf::SoundStream\n        \/\/ Whatever the channel count is, it'll we resampled to stereo\n        sf::SoundStream::initialize(av_get_channel_layout_nb_channels(AV_CH_LAYOUT_STEREO), m_sampleRate);\n        \n        \/\/ Initialize resampler to be able to give signed 16 bits samples to SFML\n        initResampler();\n    }\n    \n    \/** Default destructor\n     *\/\n    AudioStream::~AudioStream()\n    {\n        if (m_audioFrame)\n        {\n            av_frame_free(&m_audioFrame);\n        }\n        \n        if (m_samplesBuffer)\n        {\n            av_free(m_samplesBuffer);\n        }\n        \n        if (m_dstData)\n        {\n            av_freep(&m_dstData[0]);\n        }\n        av_freep(&m_dstData);\n        \n        swr_free(&m_swrCtx);\n    }\n    \n    void AudioStream::flushBuffers()\n    {\n        \/\/ To be removed once issue with sf::SoundStream::getStatus() is fixed:\n        \/\/ http:\/\/en.sfml-dev.org\/forums\/index.php?topic=17095.msg122898#msg122898\n        \/\/ This should never happen as this stream has already been notified to pause and\n        \/\/ sf::SoundStream::pause() has been called\n        while (sf::SoundStream::getStatus() == sf::SoundStream::Playing)\n            sf::sleep(sf::microseconds(1));\n        \n        sf::SoundStream::Status sfStatus = sf::SoundStream::getStatus();\n        CHECK (sfStatus != sf::SoundStream::Playing, \"Trying to flush while audio is playing, this will introduce an audio glitch!\");\n        \n        \/\/ Flush audio driver\/OpenAL\/SFML buffer\n        if (sfStatus != sf::SoundStream::Stopped)\n            sf::SoundStream::stop();\n        \n        Stream::flushBuffers();\n    }\n    \n    MediaType AudioStream::getStreamKind() const\n    {\n        return Audio;\n    }\n    \n    void AudioStream::update()\n    {\n        sf::SoundStream::Status sfStatus = sf::SoundStream::getStatus();\n        \n        switch (sfStatus)\n        {\n            case sf::SoundStream::Playing:\n                setStatus(sfe::Playing);\n                break;\n                \n            case sf::SoundStream::Paused:\n                setStatus(sfe::Paused);\n                break;\n                \n            case sf::SoundStream::Stopped:\n                setStatus(sfe::Stopped);\n                break;\n                \n            default:\n                break;\n        }\n    }\n    \n    bool AudioStream::onGetData(sf::SoundStream::Chunk& data)\n    {\n        AVPacket* packet = nullptr;\n        data.samples = m_samplesBuffer;\n        \n        while (data.sampleCount < av_get_channel_layout_nb_channels(AV_CH_LAYOUT_STEREO) * m_sampleRate &&\n               (nullptr != (packet = popEncodedData())))\n        {\n            bool needsMoreDecoding = false;\n            bool gotFrame = false;\n            \n            do\n            {\n                needsMoreDecoding = decodePacket(packet, m_audioFrame, gotFrame);\n                \n                if (gotFrame)\n                {\n                    uint8_t* samples = nullptr;\n                    int nbSamples = 0;\n                    int samplesLength = 0;\n                    \n                    resampleFrame(m_audioFrame, samples, nbSamples, samplesLength);\n                    CHECK(samples, \"AudioStream::onGetData() - resampleFrame() error\");\n                    CHECK(nbSamples > 0, \"AudioStream::onGetData() - resampleFrame() error\");\n                    CHECK(nbSamples == samplesLength \/ 2, \"AudioStream::onGetData() resampleFrame() inconsistency\");\n                    \n                    CHECK(data.sampleCount + nbSamples < m_sampleRate * 2 * av_get_channel_layout_nb_channels(AV_CH_LAYOUT_STEREO), \"AudioStream::onGetData() - Going to overflow!!\");\n                    \n                    std::memcpy((void *)(data.samples + data.sampleCount),\n                                samples, samplesLength);\n                    data.sampleCount += nbSamples;\n                }\n            } while (needsMoreDecoding);\n            \n            av_free_packet(packet);\n            av_free(packet);\n        }\n        \n        if (!packet)\n        {\n            sfeLogDebug(\"No more audio packets, do not go further\");\n        }\n        return (packet != nullptr);\n    }\n    \n    void AudioStream::onSeek(sf::Time timeOffset)\n    {\n        \/\/        CHECK(0, \"AudioStream::onSeek() - not implemented\");\n    }\n    \n    bool AudioStream::decodePacket(AVPacket* packet, AVFrame* outputFrame, bool& gotFrame)\n    {\n        bool needsMoreDecoding = false;\n        int igotFrame = 0;\n        \n        int decodedLength = avcodec_decode_audio4(m_stream->codec, outputFrame, &igotFrame, packet);\n        gotFrame = (igotFrame != 0);\n        CHECK(decodedLength >= 0, \"AudioStream::decodePacket() - error: decodedLength=\" + s(decodedLength));\n        \n        if (decodedLength < packet->size)\n        {\n            needsMoreDecoding = true;\n            packet->data += decodedLength;\n            packet->size -= decodedLength;\n        }\n        \n        return needsMoreDecoding;\n    }\n    \n    void AudioStream::initResampler()\n    {\n        CHECK0(m_swrCtx, \"AudioStream::initResampler() - resampler already initialized\");\n        int err = 0;\n        \n        \/* create resampler context *\/\n        m_swrCtx = swr_alloc();\n        CHECK(m_swrCtx, \"AudioStream::initResampler() - out of memory\");\n        \n        \/\/ Some media files don't define the channel layout, in this case take a default one\n        \/\/ according to the channels' count\n        if (m_stream->codec->channel_layout == 0)\n        {\n            m_stream->codec->channel_layout = av_get_default_channel_layout(m_stream->codec->channels);\n        }\n        \n        \/* set options *\/\n        av_opt_set_int        (m_swrCtx, \"in_channel_layout\",  m_stream->codec->channel_layout, 0);\n        av_opt_set_int        (m_swrCtx, \"in_sample_rate\",     m_stream->codec->sample_rate,    0);\n        av_opt_set_sample_fmt (m_swrCtx, \"in_sample_fmt\",      m_stream->codec->sample_fmt,     0);\n        av_opt_set_int        (m_swrCtx, \"out_channel_layout\", AV_CH_LAYOUT_STEREO,             0);\n        av_opt_set_int        (m_swrCtx, \"out_sample_rate\",    m_stream->codec->sample_rate,    0);\n        av_opt_set_sample_fmt (m_swrCtx, \"out_sample_fmt\",     AV_SAMPLE_FMT_S16,               0);\n        \n        \/* initialize the resampling context *\/\n        err = swr_init(m_swrCtx);\n        CHECK(err >= 0, \"AudioStream::initResampler() - resampling context initialization error\");\n        \n        \/* compute the number of converted samples: buffering is avoided\n         * ensuring that the output buffer will contain at least all the\n         * converted input samples *\/\n        m_maxDstNbSamples = m_dstNbSamples = 1024;\n        \n        \/* Create the resampling output buffer *\/\n        m_dstNbChannels = av_get_channel_layout_nb_channels(AV_CH_LAYOUT_STEREO);\n        err = av_samples_alloc_array_and_samples(&m_dstData, &m_dstLinesize, m_dstNbChannels,\n                                                 m_dstNbSamples, AV_SAMPLE_FMT_S16, 0);\n        CHECK(err >= 0, \"AudioStream::initResampler() - av_samples_alloc_array_and_samples error\");\n    }\n    \n    void AudioStream::resampleFrame(const AVFrame* frame, uint8_t*& outSamples, int& outNbSamples, int& outSamplesLength)\n    {\n        CHECK(m_swrCtx, \"AudioStream::resampleFrame() - resampler is not initialized, call AudioStream::initResamplerFirst() !\");\n        CHECK(frame, \"AudioStream::resampleFrame() - invalid argument\");\n        \n        int src_rate, dst_rate, err, dst_bufsize;\n        src_rate = dst_rate = frame->sample_rate;\n        \n        \/* compute destination number of samples *\/\n        m_dstNbSamples = av_rescale_rnd(swr_get_delay(m_swrCtx, src_rate) +\n                                        frame->nb_samples, dst_rate, src_rate, AV_ROUND_UP);\n        if (m_dstNbSamples > m_maxDstNbSamples)\n        {\n            av_free(m_dstData[0]);\n            err = av_samples_alloc(m_dstData, &m_dstLinesize, m_dstNbChannels,\n                                   m_dstNbSamples, AV_SAMPLE_FMT_S16, 1);\n            CHECK(err >= 0, \"AudioStream::resampleFrame() - out of memory\");\n            m_maxDstNbSamples = m_dstNbSamples;\n        }\n        \n        \/* convert to destination format *\/\n        err = swr_convert(m_swrCtx, m_dstData, m_dstNbSamples, (const uint8_t **)frame->extended_data, frame->nb_samples);\n        CHECK(err >= 0, \"AudioStream::resampleFrame() - swr_convert() error\");\n        \n        dst_bufsize = av_samples_get_buffer_size(&m_dstLinesize, m_dstNbChannels,\n                                                 err, AV_SAMPLE_FMT_S16, 1);\n        CHECK(dst_bufsize >= 0, \"AudioStream::resampleFrame() - av_samples_get_buffer_size() error\");\n        \n        outNbSamples = dst_bufsize \/ av_get_bytes_per_sample(AV_SAMPLE_FMT_S16);\n        outSamplesLength = dst_bufsize;\n        outSamples = m_dstData[0];\n    }\n    \n    void AudioStream::willPlay(const Timer &timer)\n    {\n        Stream::willPlay(timer);\n        \n        if (Stream::getStatus() == sfe::Stopped)\n        {\n            sf::Time initialTime = sf::SoundStream::getPlayingOffset();\n            sf::Clock timeout;\n            sf::SoundStream::play();\n            \n            \/\/ Some audio drivers take time before the sound is actually played\n            \/\/ To avoid desynchronization with the timer, we don't return\n            \/\/ until the audio stream is actually started\n            while (sf::SoundStream::getPlayingOffset() == initialTime && timeout.getElapsedTime() < sf::seconds(5))\n                sf::sleep(sf::milliseconds(10));\n            \n            CHECK(sf::SoundStream::getPlayingOffset() != initialTime, \"is your audio device broken? Audio did not start within 5 seconds\");\n        }\n        else\n        {\n            sf::SoundStream::play();\n        }\n    }\n    \n    void AudioStream::didPlay(const Timer& timer, sfe::Status previousStatus)\n    {\n        CHECK(SoundStream::getStatus() == SoundStream::Playing, \"AudioStream::didPlay() - willPlay() not executed!\");\n        Stream::didPlay(timer, previousStatus);\n    }\n    \n    void AudioStream::didPause(const Timer& timer, sfe::Status previousStatus)\n    {\n        sf::SoundStream::pause();\n        Stream::didPause(timer, previousStatus);\n    }\n    \n    void AudioStream::didStop(const Timer& timer, sfe::Status previousStatus)\n    {\n        sf::SoundStream::stop();\n        Stream::didStop(timer, previousStatus);\n    }\n}\n<commit_msg>#6 sf::SoundStream::play()\/pause() methods are asynchronous, in order to keep later sanity checks, wait until OpenAL state really has changed<commit_after>\n\/*\n *  AudioStream.cpp\n *  sfeMovie project\n *\n *  Copyright (C) 2010-2014 Lucas Soltic\n *  lucas.soltic@orange.fr\n *\n *  This program is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License as published by the Free Software Foundation; either\n *  version 2.1 of the License, or (at your option) any later version.\n *\n *  This program is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this program; if not, write to the Free Software\n *  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n *\n *\/\n\nextern \"C\"\n{\n#include <libavformat\/avformat.h>\n#include <libavcodec\/avcodec.h>\n#include <libavutil\/samplefmt.h>\n#include <libavutil\/opt.h>\n#include <libavutil\/channel_layout.h>\n#include <libswresample\/swresample.h>\n}\n\n#include <cstring>\n#include <iostream>\n#include \"AudioStream.hpp\"\n#include \"Log.hpp\"\n#include <sfeMovie\/Movie.hpp>\n\nnamespace sfe\n{\n    AudioStream::AudioStream(AVFormatContext*& formatCtx, AVStream*& stream, DataSource& dataSource,\n                             std::shared_ptr<Timer> timer) :\n    Stream(formatCtx, stream, dataSource, timer),\n    \n    \/\/ Public properties\n    m_sampleRate(0),\n    \n    \/\/ Private data\n    m_samplesBuffer(nullptr),\n    m_audioFrame(nullptr),\n    \n    \/\/ Resampling\n    m_swrCtx(nullptr),\n    m_dstNbSamples(0),\n    m_maxDstNbSamples(0),\n    m_dstNbChannels(0),\n    m_dstLinesize(0),\n    m_dstData(nullptr)\n    {\n        m_audioFrame = av_frame_alloc();\n        CHECK(m_audioFrame, \"AudioStream::AudioStream() - out of memory\");\n        \n        \/\/ Get some audio informations\n        m_sampleRate = m_stream->codec->sample_rate;\n        \n        \/\/ Alloc a two seconds buffer\n        m_samplesBuffer = (sf::Int16*)av_malloc(sizeof(sf::Int16) * av_get_channel_layout_nb_channels(AV_CH_LAYOUT_STEREO) * m_sampleRate * 2);\n        CHECK(m_samplesBuffer, \"AudioStream::AudioStream() - out of memory\");\n        \n        \/\/ Initialize the sf::SoundStream\n        \/\/ Whatever the channel count is, it'll we resampled to stereo\n        sf::SoundStream::initialize(av_get_channel_layout_nb_channels(AV_CH_LAYOUT_STEREO), m_sampleRate);\n        \n        \/\/ Initialize resampler to be able to give signed 16 bits samples to SFML\n        initResampler();\n    }\n    \n    \/** Default destructor\n     *\/\n    AudioStream::~AudioStream()\n    {\n        if (m_audioFrame)\n        {\n            av_frame_free(&m_audioFrame);\n        }\n        \n        if (m_samplesBuffer)\n        {\n            av_free(m_samplesBuffer);\n        }\n        \n        if (m_dstData)\n        {\n            av_freep(&m_dstData[0]);\n        }\n        av_freep(&m_dstData);\n        \n        swr_free(&m_swrCtx);\n    }\n    \n    void AudioStream::flushBuffers()\n    {\n        \/\/ To be removed once issue with sf::SoundStream::getStatus() is fixed:\n        \/\/ http:\/\/en.sfml-dev.org\/forums\/index.php?topic=17095.msg122898#msg122898\n        \/\/ This should never happen as this stream has already been notified to pause and\n        \/\/ sf::SoundStream::pause() has been called\n        while (sf::SoundStream::getStatus() == sf::SoundStream::Playing)\n            sf::sleep(sf::microseconds(1));\n        \n        sf::SoundStream::Status sfStatus = sf::SoundStream::getStatus();\n        CHECK (sfStatus != sf::SoundStream::Playing, \"Trying to flush while audio is playing, this will introduce an audio glitch!\");\n        \n        \/\/ Flush audio driver\/OpenAL\/SFML buffer\n        if (sfStatus != sf::SoundStream::Stopped)\n            sf::SoundStream::stop();\n        \n        Stream::flushBuffers();\n    }\n    \n    MediaType AudioStream::getStreamKind() const\n    {\n        return Audio;\n    }\n    \n    void AudioStream::update()\n    {\n        sf::SoundStream::Status sfStatus = sf::SoundStream::getStatus();\n        \n        switch (sfStatus)\n        {\n            case sf::SoundStream::Playing:\n                setStatus(sfe::Playing);\n                break;\n                \n            case sf::SoundStream::Paused:\n                setStatus(sfe::Paused);\n                break;\n                \n            case sf::SoundStream::Stopped:\n                setStatus(sfe::Stopped);\n                break;\n                \n            default:\n                break;\n        }\n    }\n    \n    bool AudioStream::onGetData(sf::SoundStream::Chunk& data)\n    {\n        AVPacket* packet = nullptr;\n        data.samples = m_samplesBuffer;\n        \n        while (data.sampleCount < av_get_channel_layout_nb_channels(AV_CH_LAYOUT_STEREO) * m_sampleRate &&\n               (nullptr != (packet = popEncodedData())))\n        {\n            bool needsMoreDecoding = false;\n            bool gotFrame = false;\n            \n            do\n            {\n                needsMoreDecoding = decodePacket(packet, m_audioFrame, gotFrame);\n                \n                if (gotFrame)\n                {\n                    uint8_t* samples = nullptr;\n                    int nbSamples = 0;\n                    int samplesLength = 0;\n                    \n                    resampleFrame(m_audioFrame, samples, nbSamples, samplesLength);\n                    CHECK(samples, \"AudioStream::onGetData() - resampleFrame() error\");\n                    CHECK(nbSamples > 0, \"AudioStream::onGetData() - resampleFrame() error\");\n                    CHECK(nbSamples == samplesLength \/ 2, \"AudioStream::onGetData() resampleFrame() inconsistency\");\n                    \n                    CHECK(data.sampleCount + nbSamples < m_sampleRate * 2 * av_get_channel_layout_nb_channels(AV_CH_LAYOUT_STEREO), \"AudioStream::onGetData() - Going to overflow!!\");\n                    \n                    std::memcpy((void *)(data.samples + data.sampleCount),\n                                samples, samplesLength);\n                    data.sampleCount += nbSamples;\n                }\n            } while (needsMoreDecoding);\n            \n            av_free_packet(packet);\n            av_free(packet);\n        }\n        \n        if (!packet)\n        {\n            sfeLogDebug(\"No more audio packets, do not go further\");\n        }\n        return (packet != nullptr);\n    }\n    \n    void AudioStream::onSeek(sf::Time timeOffset)\n    {\n        \/\/        CHECK(0, \"AudioStream::onSeek() - not implemented\");\n    }\n    \n    bool AudioStream::decodePacket(AVPacket* packet, AVFrame* outputFrame, bool& gotFrame)\n    {\n        bool needsMoreDecoding = false;\n        int igotFrame = 0;\n        \n        int decodedLength = avcodec_decode_audio4(m_stream->codec, outputFrame, &igotFrame, packet);\n        gotFrame = (igotFrame != 0);\n        CHECK(decodedLength >= 0, \"AudioStream::decodePacket() - error: decodedLength=\" + s(decodedLength));\n        \n        if (decodedLength < packet->size)\n        {\n            needsMoreDecoding = true;\n            packet->data += decodedLength;\n            packet->size -= decodedLength;\n        }\n        \n        return needsMoreDecoding;\n    }\n    \n    void AudioStream::initResampler()\n    {\n        CHECK0(m_swrCtx, \"AudioStream::initResampler() - resampler already initialized\");\n        int err = 0;\n        \n        \/* create resampler context *\/\n        m_swrCtx = swr_alloc();\n        CHECK(m_swrCtx, \"AudioStream::initResampler() - out of memory\");\n        \n        \/\/ Some media files don't define the channel layout, in this case take a default one\n        \/\/ according to the channels' count\n        if (m_stream->codec->channel_layout == 0)\n        {\n            m_stream->codec->channel_layout = av_get_default_channel_layout(m_stream->codec->channels);\n        }\n        \n        \/* set options *\/\n        av_opt_set_int        (m_swrCtx, \"in_channel_layout\",  m_stream->codec->channel_layout, 0);\n        av_opt_set_int        (m_swrCtx, \"in_sample_rate\",     m_stream->codec->sample_rate,    0);\n        av_opt_set_sample_fmt (m_swrCtx, \"in_sample_fmt\",      m_stream->codec->sample_fmt,     0);\n        av_opt_set_int        (m_swrCtx, \"out_channel_layout\", AV_CH_LAYOUT_STEREO,             0);\n        av_opt_set_int        (m_swrCtx, \"out_sample_rate\",    m_stream->codec->sample_rate,    0);\n        av_opt_set_sample_fmt (m_swrCtx, \"out_sample_fmt\",     AV_SAMPLE_FMT_S16,               0);\n        \n        \/* initialize the resampling context *\/\n        err = swr_init(m_swrCtx);\n        CHECK(err >= 0, \"AudioStream::initResampler() - resampling context initialization error\");\n        \n        \/* compute the number of converted samples: buffering is avoided\n         * ensuring that the output buffer will contain at least all the\n         * converted input samples *\/\n        m_maxDstNbSamples = m_dstNbSamples = 1024;\n        \n        \/* Create the resampling output buffer *\/\n        m_dstNbChannels = av_get_channel_layout_nb_channels(AV_CH_LAYOUT_STEREO);\n        err = av_samples_alloc_array_and_samples(&m_dstData, &m_dstLinesize, m_dstNbChannels,\n                                                 m_dstNbSamples, AV_SAMPLE_FMT_S16, 0);\n        CHECK(err >= 0, \"AudioStream::initResampler() - av_samples_alloc_array_and_samples error\");\n    }\n    \n    void AudioStream::resampleFrame(const AVFrame* frame, uint8_t*& outSamples, int& outNbSamples, int& outSamplesLength)\n    {\n        CHECK(m_swrCtx, \"AudioStream::resampleFrame() - resampler is not initialized, call AudioStream::initResamplerFirst() !\");\n        CHECK(frame, \"AudioStream::resampleFrame() - invalid argument\");\n        \n        int src_rate, dst_rate, err, dst_bufsize;\n        src_rate = dst_rate = frame->sample_rate;\n        \n        \/* compute destination number of samples *\/\n        m_dstNbSamples = av_rescale_rnd(swr_get_delay(m_swrCtx, src_rate) +\n                                        frame->nb_samples, dst_rate, src_rate, AV_ROUND_UP);\n        if (m_dstNbSamples > m_maxDstNbSamples)\n        {\n            av_free(m_dstData[0]);\n            err = av_samples_alloc(m_dstData, &m_dstLinesize, m_dstNbChannels,\n                                   m_dstNbSamples, AV_SAMPLE_FMT_S16, 1);\n            CHECK(err >= 0, \"AudioStream::resampleFrame() - out of memory\");\n            m_maxDstNbSamples = m_dstNbSamples;\n        }\n        \n        \/* convert to destination format *\/\n        err = swr_convert(m_swrCtx, m_dstData, m_dstNbSamples, (const uint8_t **)frame->extended_data, frame->nb_samples);\n        CHECK(err >= 0, \"AudioStream::resampleFrame() - swr_convert() error\");\n        \n        dst_bufsize = av_samples_get_buffer_size(&m_dstLinesize, m_dstNbChannels,\n                                                 err, AV_SAMPLE_FMT_S16, 1);\n        CHECK(dst_bufsize >= 0, \"AudioStream::resampleFrame() - av_samples_get_buffer_size() error\");\n        \n        outNbSamples = dst_bufsize \/ av_get_bytes_per_sample(AV_SAMPLE_FMT_S16);\n        outSamplesLength = dst_bufsize;\n        outSamples = m_dstData[0];\n    }\n    \n    void AudioStream::willPlay(const Timer &timer)\n    {\n        Stream::willPlay(timer);\n        \n        if (Stream::getStatus() == sfe::Stopped)\n        {\n            sf::Time initialTime = sf::SoundStream::getPlayingOffset();\n            sf::Clock timeout;\n            sf::SoundStream::play();\n            \n            \/\/ Some audio drivers take time before the sound is actually played\n            \/\/ To avoid desynchronization with the timer, we don't return\n            \/\/ until the audio stream is actually started\n            while (sf::SoundStream::getPlayingOffset() == initialTime && timeout.getElapsedTime() < sf::seconds(5))\n                sf::sleep(sf::microseconds(10));\n            \n            CHECK(sf::SoundStream::getPlayingOffset() != initialTime, \"is your audio device broken? Audio did not start within 5 seconds\");\n        }\n        else\n        {\n            sf::SoundStream::play();\n            \n            sf::Clock timeout;\n            while (sf::SoundStream::getStatus() != sf::SoundStream::Playing && timeout.getElapsedTime() < sf::seconds(5))\n                sf::sleep(sf::microseconds(10));\n            \n            CHECK(timeout.getElapsedTime() < sf::seconds(5), \"Audio did not start within 5 seconds\");\n        }\n    }\n    \n    void AudioStream::didPlay(const Timer& timer, sfe::Status previousStatus)\n    {\n        CHECK(SoundStream::getStatus() == SoundStream::Playing, \"AudioStream::didPlay() - willPlay() not executed!\");\n        Stream::didPlay(timer, previousStatus);\n    }\n    \n    void AudioStream::didPause(const Timer& timer, sfe::Status previousStatus)\n    {\n        sf::SoundStream::pause();\n        Stream::didPause(timer, previousStatus);\n    }\n    \n    void AudioStream::didStop(const Timer& timer, sfe::Status previousStatus)\n    {\n        sf::SoundStream::stop();\n        Stream::didStop(timer, previousStatus);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * The Seeks proxy and plugin framework are part of the SEEKS project.\n * Copyright (C) 2010 Emmanuel Benazera, ebenazer@seeks-project.info\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 \"db_query_record.h\"\n#include \"db_query_record_msg.pb.h\"\n#include \"miscutil.h\"\n#include \"errlog.h\"\n\n#include \"DHTKey.h\" \/\/ for fixing issue 169.\n#include \"qprocess.h\" \/\/ idem.\n#include \"query_capture_configuration.h\" \/\/ idem.\nusing lsh::qprocess;\n\n#include <algorithm>\n#include <iterator>\n#include <iostream>\n\nusing sp::errlog;\nusing sp::miscutil;\n\nnamespace seeks_plugins\n{\n  \/*- query_data -*\/\n  query_data::query_data(const std::string &query,\n                         const short &radius)\n    :_query(query),_radius(radius),_hits(1),_visited_urls(NULL)\n  {\n  }\n\n  query_data::query_data(const std::string &query,\n                         const short &radius,\n                         const std::string &url)\n    :_query(query),_radius(radius),_hits(1)\n  {\n    _visited_urls = new hash_map<const char*,vurl_data*,hash<const char*>,eqstr>(1);\n    vurl_data *vd = new vurl_data(url);\n    add_vurl(vd);\n  }\n\n  query_data::query_data(const query_data *qd)\n    :_query(qd->_query),_radius(qd->_radius),_hits(qd->_hits),_visited_urls(NULL)\n  {\n    if (qd->_visited_urls)\n      {\n        create_visited_urls();\n        hash_map<const char*,vurl_data*,hash<const char*>,eqstr>::const_iterator hit\n        = qd->_visited_urls->begin();\n        while (hit!=qd->_visited_urls->end())\n          {\n            vurl_data *vd = new vurl_data((*hit).second);\n            add_vurl(vd);\n            ++hit;\n          }\n      }\n  }\n\n  query_data::~query_data()\n  {\n    if (_visited_urls)\n      {\n        hash_map<const char*,vurl_data*,hash<const char*>,eqstr>::iterator dhit;\n        hash_map<const char*,vurl_data*,hash<const char*>,eqstr>::iterator hit\n        = _visited_urls->begin();\n        while (hit!=_visited_urls->end())\n          {\n            vurl_data *vd = (*hit).second;\n            dhit = hit;\n            ++hit;\n            _visited_urls->erase(dhit);\n            delete vd;\n          }\n        delete _visited_urls;\n        _visited_urls = NULL;\n      }\n  }\n\n  void query_data::create_visited_urls()\n  {\n    if (!_visited_urls)\n      _visited_urls = new hash_map<const char*,vurl_data*,hash<const char*>,eqstr>(25);\n    else errlog::log_error(LOG_LEVEL_INFO,\"query_data::create_visited_urls failed: already exists\");\n  }\n\n  void query_data::merge(const query_data *qd)\n  {\n    if (qd->_query != _query)\n      {\n        errlog::log_error(LOG_LEVEL_ERROR,\"trying to merge query record data for different queries\");\n        return;\n      }\n\n    \/\/assert(qd->_radius == _radius);\n\n    if (!qd->_visited_urls)\n      return;\n\n    if (!_visited_urls)\n      create_visited_urls();\n    hash_map<const char*,vurl_data*,hash<const char*>,eqstr>::iterator fhit;\n    hash_map<const char*,vurl_data*,hash<const char*>,eqstr>::const_iterator hit\n    = qd->_visited_urls->begin();\n    while (hit!=qd->_visited_urls->end())\n      {\n        if ((fhit=_visited_urls->find((*hit).first))!=_visited_urls->end())\n          {\n            (*fhit).second->merge((*hit).second);\n          }\n        else\n          {\n            vurl_data *vd = new vurl_data((*hit).second);\n            add_vurl(vd);\n          }\n        ++hit;\n      }\n  }\n\n  void query_data::add_vurl(vurl_data *vd)\n  {\n    if (!_visited_urls)\n      return; \/\/ safe.\n    _visited_urls->insert(std::pair<const char*,vurl_data*>(vd->_url.c_str(),vd));\n  }\n\n  vurl_data* query_data::find_vurl(const std::string &url) const\n  {\n    if (!_visited_urls)\n      return NULL;\n    hash_map<const char*,vurl_data*,hash<const char*>,eqstr>::iterator hit;\n    if ((hit=_visited_urls->find(url.c_str()))!=_visited_urls->end())\n      return (*hit).second;\n    return NULL;\n  }\n\n  float query_data::vurls_total_hits() const\n  {\n    if (!_visited_urls)\n      return 0.0;\n    float res = 0.0;\n    hash_map<const char*,vurl_data*,hash<const char*>,eqstr>::iterator hit\n    = _visited_urls->begin();\n    while (hit!=_visited_urls->end())\n      {\n        res += (*hit).second->_hits;\n        ++hit;\n      }\n  }\n\n  \/*- db_query_record -*\/\n  db_query_record::db_query_record(const time_t &creation_time,\n                                   const std::string &plugin_name)\n    :db_record(creation_time,plugin_name)\n  {\n  }\n\n  db_query_record::db_query_record(const std::string &plugin_name,\n                                   const std::string &query,\n                                   const short &radius)\n    :db_record(plugin_name)\n  {\n    query_data *qd = new query_data(query,radius);\n    _related_queries.insert(std::pair<const char*,query_data*>(qd->_query.c_str(),qd));\n  }\n\n  db_query_record::db_query_record(const std::string &plugin_name,\n                                   const std::string &query,\n                                   const short &radius,\n                                   const std::string &url)\n    :db_record(plugin_name)\n  {\n    query_data *qd = new query_data(query,radius,url);\n    _related_queries.insert(std::pair<const char*,query_data*>(qd->_query.c_str(),qd));\n  }\n\n  db_query_record::db_query_record(const db_query_record &dbr)\n  {\n    hash_map<const char*,query_data*,hash<const char*>,eqstr>::const_iterator hit\n    = dbr._related_queries.begin();\n    while (hit!=dbr._related_queries.end())\n      {\n        query_data *rd = (*hit).second;\n        query_data *crd = new query_data(*rd);\n        _related_queries.insert(std::pair<const char*,query_data*>(crd->_query.c_str(),crd));\n        ++hit;\n      }\n  }\n\n  db_query_record::db_query_record()\n    :db_record()\n  {\n  }\n\n  db_query_record::~db_query_record()\n  {\n    hash_map<const char*,query_data*,hash<const char*>,eqstr>::iterator dhit;\n    hash_map<const char*,query_data*,hash<const char*>,eqstr>::iterator hit\n    = _related_queries.begin();\n    while (hit!=_related_queries.end())\n      {\n        query_data *qd = (*hit).second;\n        dhit = hit;\n        ++hit;\n        _related_queries.erase(dhit);\n        delete qd;\n      }\n  }\n\n  int db_query_record::serialize(std::string &msg) const\n  {\n    sp::db::record r;\n    create_query_record(r);\n    if (!r.SerializeToString(&msg))\n      {\n        errlog::log_error(LOG_LEVEL_ERROR,\"Failed serializing db_query_record\");\n        return 1; \/\/ error.\n      }\n    else return 0;\n  }\n\n  int db_query_record::deserialize(const std::string &msg)\n  {\n    sp::db::record r;\n    if (!r.ParseFromString(msg))\n      {\n        errlog::log_error(LOG_LEVEL_ERROR,\"Failed deserializing db_query_record\");\n        return 1; \/\/ error.\n      }\n    read_query_record(r);\n    return 0;\n  }\n\n  int db_query_record::merge_with(const db_record &dbr)\n  {\n    if (dbr._plugin_name != _plugin_name)\n      return -2;\n\n    const db_query_record &dqr = static_cast<const db_query_record&>(dbr);\n    hash_map<const char*,query_data*,hash<const char*>,eqstr>::iterator fhit;\n    hash_map<const char*,query_data*,hash<const char*>,eqstr>::const_iterator hit\n    = dqr._related_queries.begin();\n    while (hit!=dqr._related_queries.end())\n      {\n        if ((fhit = _related_queries.find((*hit).first))!=_related_queries.end())\n          {\n            \/\/ merge.\n            (*fhit).second->merge((*hit).second);\n          }\n        else\n          {\n            \/\/ add query.\n            query_data *rd = new query_data((*hit).second);\n            _related_queries.insert(std::pair<const char*,query_data*>(rd->_query.c_str(),rd));\n          }\n        ++hit;\n      }\n    return 0;\n  }\n\n  void db_query_record::create_query_record(sp::db::record &r) const\n  {\n    create_base_record(r);\n    sp::db::related_queries *queries = r.MutableExtension(sp::db::queries);\n    hash_map<const char*,query_data*,hash<const char*>,eqstr>::const_iterator hit\n    = _related_queries.begin();\n    while (hit!=_related_queries.end())\n      {\n        query_data *rd = (*hit).second;\n        sp::db::related_query* rq = queries->add_rquery();\n        rq->set_radius(rd->_radius);\n        rq->set_query(rd->_query);\n        rq->set_query_hits((*hit).second->_hits);\n        sp::db::visited_urls *rq_vurls = rq->mutable_vurls();\n\n        if (rd->_visited_urls)\n          {\n            hash_map<const char*,vurl_data*,hash<const char*>,eqstr>::const_iterator vhit\n            = rd->_visited_urls->begin();\n            while (vhit!=rd->_visited_urls->end())\n              {\n                vurl_data *vd = (*vhit).second;\n                if (vd) \/\/ XXX: should not happen.\n                  {\n                    sp::db::visited_url *rq_vurl = rq_vurls->add_vurl();\n                    rq_vurl->set_url(vd->_url);\n                    rq_vurl->set_hits(vd->_hits);\n                  }\n                else std::cerr << \"[Debug]: null vurl_data element in visited_urls...\\n\";\n                ++vhit;\n              }\n          }\n        ++hit;\n      }\n  }\n\n  void db_query_record::read_query_record(sp::db::record &r)\n  {\n    read_base_record(r);\n    sp::db::related_queries *rqueries = r.MutableExtension(sp::db::queries);\n    int nrq = rqueries->rquery_size();\n    for (int i=0; i<nrq; i++)\n      {\n        sp::db::related_query *rq = rqueries->mutable_rquery(i);\n        short radius = rq->radius();\n        std::string query = rq->query();\n        query_data *rd = new query_data(query,radius);\n        rd->_hits = rq->query_hits();\n        sp::db::visited_urls *rq_vurls = rq->mutable_vurls();\n        int nvurls = rq_vurls->vurl_size();\n        if (nvurls > 0)\n          rd->create_visited_urls();\n        for (int j=0; j<nvurls; j++)\n          {\n            sp::db::visited_url *rq_vurl = rq_vurls->mutable_vurl(j);\n            std::string url = rq_vurl->url();\n            short uhits = rq_vurl->hits();\n            vurl_data *vd = new vurl_data(url,uhits);\n            rd->_visited_urls->insert(std::pair<const char*,vurl_data*>(vd->_url.c_str(),vd));\n          }\n        _related_queries.insert(std::pair<const char*,query_data*>(rd->_query.c_str(),rd));\n      }\n  }\n\n  int db_query_record::fix_issue_169(user_db &cudb)\n  {\n    \/\/ lookup a radius 0 query. If one:\n    \/\/ - convert the record's key.\n    \/\/ - generate 0 to max_radius keys for this query.\n    \/\/ - store the newly formed records in to the new DB.\n    \/\/ - change their keys and store them into the new DB.\n    \/\/ if none, skip.\n\n    hash_map<const char*,query_data*,hash<const char*>,eqstr>::const_iterator hit\n    = _related_queries.begin();\n    while (hit!=_related_queries.end())\n      {\n        query_data *qd = (*hit).second;\n        if (qd->_radius != 0)\n          {\n            ++hit;\n            continue;\n          }\n\n        \/\/ generate query hashes with proper hashing function.\n        hash_multimap<uint32_t,DHTKey,id_hash_uint> features;\n        qprocess::generate_query_hashes(qd->_query,0,\n                                        query_capture_configuration::_config->_max_radius,\n                                        features);\n\n        hash_multimap<uint32_t,DHTKey,id_hash_uint>::const_iterator fhit = features.begin();\n        while (fhit!=features.end())\n          {\n            if ((*hit).first == 0)\n              {\n                \/\/ copy this record and store it with fixed key in new db.\n                db_query_record cdqr(*this);\n                cdqr._creation_time = _creation_time; \/\/ reset creation time to original time.\n                std::string key_str = (*fhit).second.to_rstring();\n                cudb.add_dbr(key_str,cdqr);\n              }\n            else\n              {\n                \/\/ store the query fragment with fixed key.\n                db_query_record ndqr(\"query-capture\",qd->_query,(*fhit).first);\n                ndqr._creation_time = _creation_time; \/\/ reset creation time to original time.\n                std::string key_str = (*fhit).second.to_rstring();\n                cudb.add_dbr(key_str,ndqr);\n              }\n            ++fhit;\n          }\n        ++hit;\n      }\n\n    return 0;\n  }\n\n  int db_query_record::fix_issue_263()\n  {\n    std::vector<query_data*> to_insert;\n    hash_map<const char*,query_data*,hash<const char*>,eqstr>::iterator hit\n      = _related_queries.begin();\n    while (hit!=_related_queries.end())\n      {\n        query_data *qd = (*hit).second;\n\tstd::string query = qd->_query;\n\tstd::string fixed_query = miscutil::chomp_cpp(query);\n\tif (fixed_query != qd->_query)\n\t  {\n\t    \/\/std::cerr << \"fix 263: \" << qd->_query << \" -- \" << fixed_query << std::endl;\n\t    hash_map<const char*,query_data*,hash<const char*>,eqstr>::iterator hit2 = hit;\n\t    ++hit;\n\t    _related_queries.erase(hit2);\n\t    qd->_query = fixed_query;\n\t    to_insert.push_back(qd);\n\t  }\n\telse ++hit;\n      }\n    size_t tis = to_insert.size();\n    if (tis > 0)\n      {\n\tfor (size_t i=0;i<tis;i++)\n\t  _related_queries.insert(std::pair<const char*,query_data*>(to_insert.at(i)->_query.c_str(),\n\t\t\t\t\t\t\t\t     to_insert.at(i)));\n\treturn 1;\n      }\n    else return 0;\n  }\n\n} \/* end of namespace. *\/\n<commit_msg>fixed missing return value in total hits computation<commit_after>\/**\n * The Seeks proxy and plugin framework are part of the SEEKS project.\n * Copyright (C) 2010 Emmanuel Benazera, ebenazer@seeks-project.info\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 \"db_query_record.h\"\n#include \"db_query_record_msg.pb.h\"\n#include \"miscutil.h\"\n#include \"errlog.h\"\n\n#include \"DHTKey.h\" \/\/ for fixing issue 169.\n#include \"qprocess.h\" \/\/ idem.\n#include \"query_capture_configuration.h\" \/\/ idem.\nusing lsh::qprocess;\n\n#include <algorithm>\n#include <iterator>\n#include <iostream>\n\nusing sp::errlog;\nusing sp::miscutil;\n\nnamespace seeks_plugins\n{\n  \/*- query_data -*\/\n  query_data::query_data(const std::string &query,\n                         const short &radius)\n    :_query(query),_radius(radius),_hits(1),_visited_urls(NULL)\n  {\n  }\n\n  query_data::query_data(const std::string &query,\n                         const short &radius,\n                         const std::string &url)\n    :_query(query),_radius(radius),_hits(1)\n  {\n    _visited_urls = new hash_map<const char*,vurl_data*,hash<const char*>,eqstr>(1);\n    vurl_data *vd = new vurl_data(url);\n    add_vurl(vd);\n  }\n\n  query_data::query_data(const query_data *qd)\n    :_query(qd->_query),_radius(qd->_radius),_hits(qd->_hits),_visited_urls(NULL)\n  {\n    if (qd->_visited_urls)\n      {\n        create_visited_urls();\n        hash_map<const char*,vurl_data*,hash<const char*>,eqstr>::const_iterator hit\n        = qd->_visited_urls->begin();\n        while (hit!=qd->_visited_urls->end())\n          {\n            vurl_data *vd = new vurl_data((*hit).second);\n            add_vurl(vd);\n            ++hit;\n          }\n      }\n  }\n\n  query_data::~query_data()\n  {\n    if (_visited_urls)\n      {\n        hash_map<const char*,vurl_data*,hash<const char*>,eqstr>::iterator dhit;\n        hash_map<const char*,vurl_data*,hash<const char*>,eqstr>::iterator hit\n        = _visited_urls->begin();\n        while (hit!=_visited_urls->end())\n          {\n            vurl_data *vd = (*hit).second;\n            dhit = hit;\n            ++hit;\n            _visited_urls->erase(dhit);\n            delete vd;\n          }\n        delete _visited_urls;\n        _visited_urls = NULL;\n      }\n  }\n\n  void query_data::create_visited_urls()\n  {\n    if (!_visited_urls)\n      _visited_urls = new hash_map<const char*,vurl_data*,hash<const char*>,eqstr>(25);\n    else errlog::log_error(LOG_LEVEL_INFO,\"query_data::create_visited_urls failed: already exists\");\n  }\n\n  void query_data::merge(const query_data *qd)\n  {\n    if (qd->_query != _query)\n      {\n        errlog::log_error(LOG_LEVEL_ERROR,\"trying to merge query record data for different queries\");\n        return;\n      }\n\n    \/\/assert(qd->_radius == _radius);\n\n    if (!qd->_visited_urls)\n      return;\n\n    if (!_visited_urls)\n      create_visited_urls();\n    hash_map<const char*,vurl_data*,hash<const char*>,eqstr>::iterator fhit;\n    hash_map<const char*,vurl_data*,hash<const char*>,eqstr>::const_iterator hit\n    = qd->_visited_urls->begin();\n    while (hit!=qd->_visited_urls->end())\n      {\n        if ((fhit=_visited_urls->find((*hit).first))!=_visited_urls->end())\n          {\n            (*fhit).second->merge((*hit).second);\n          }\n        else\n          {\n            vurl_data *vd = new vurl_data((*hit).second);\n            add_vurl(vd);\n          }\n        ++hit;\n      }\n  }\n\n  void query_data::add_vurl(vurl_data *vd)\n  {\n    if (!_visited_urls)\n      return; \/\/ safe.\n    _visited_urls->insert(std::pair<const char*,vurl_data*>(vd->_url.c_str(),vd));\n  }\n\n  vurl_data* query_data::find_vurl(const std::string &url) const\n  {\n    if (!_visited_urls)\n      return NULL;\n    hash_map<const char*,vurl_data*,hash<const char*>,eqstr>::iterator hit;\n    if ((hit=_visited_urls->find(url.c_str()))!=_visited_urls->end())\n      return (*hit).second;\n    return NULL;\n  }\n\n  float query_data::vurls_total_hits() const\n  {\n    if (!_visited_urls)\n      return 0.0;\n    float res = 0.0;\n    hash_map<const char*,vurl_data*,hash<const char*>,eqstr>::iterator hit\n    = _visited_urls->begin();\n    while (hit!=_visited_urls->end())\n      {\n        res += (*hit).second->_hits;\n        ++hit;\n      }\n    return res;\n  }\n\n  \/*- db_query_record -*\/\n  db_query_record::db_query_record(const time_t &creation_time,\n                                   const std::string &plugin_name)\n    :db_record(creation_time,plugin_name)\n  {\n  }\n\n  db_query_record::db_query_record(const std::string &plugin_name,\n                                   const std::string &query,\n                                   const short &radius)\n    :db_record(plugin_name)\n  {\n    query_data *qd = new query_data(query,radius);\n    _related_queries.insert(std::pair<const char*,query_data*>(qd->_query.c_str(),qd));\n  }\n\n  db_query_record::db_query_record(const std::string &plugin_name,\n                                   const std::string &query,\n                                   const short &radius,\n                                   const std::string &url)\n    :db_record(plugin_name)\n  {\n    query_data *qd = new query_data(query,radius,url);\n    _related_queries.insert(std::pair<const char*,query_data*>(qd->_query.c_str(),qd));\n  }\n\n  db_query_record::db_query_record(const db_query_record &dbr)\n  {\n    hash_map<const char*,query_data*,hash<const char*>,eqstr>::const_iterator hit\n    = dbr._related_queries.begin();\n    while (hit!=dbr._related_queries.end())\n      {\n        query_data *rd = (*hit).second;\n        query_data *crd = new query_data(*rd);\n        _related_queries.insert(std::pair<const char*,query_data*>(crd->_query.c_str(),crd));\n        ++hit;\n      }\n  }\n\n  db_query_record::db_query_record()\n    :db_record()\n  {\n  }\n\n  db_query_record::~db_query_record()\n  {\n    hash_map<const char*,query_data*,hash<const char*>,eqstr>::iterator dhit;\n    hash_map<const char*,query_data*,hash<const char*>,eqstr>::iterator hit\n    = _related_queries.begin();\n    while (hit!=_related_queries.end())\n      {\n        query_data *qd = (*hit).second;\n        dhit = hit;\n        ++hit;\n        _related_queries.erase(dhit);\n        delete qd;\n      }\n  }\n\n  int db_query_record::serialize(std::string &msg) const\n  {\n    sp::db::record r;\n    create_query_record(r);\n    if (!r.SerializeToString(&msg))\n      {\n        errlog::log_error(LOG_LEVEL_ERROR,\"Failed serializing db_query_record\");\n        return 1; \/\/ error.\n      }\n    else return 0;\n  }\n\n  int db_query_record::deserialize(const std::string &msg)\n  {\n    sp::db::record r;\n    if (!r.ParseFromString(msg))\n      {\n        errlog::log_error(LOG_LEVEL_ERROR,\"Failed deserializing db_query_record\");\n        return 1; \/\/ error.\n      }\n    read_query_record(r);\n    return 0;\n  }\n\n  int db_query_record::merge_with(const db_record &dbr)\n  {\n    if (dbr._plugin_name != _plugin_name)\n      return -2;\n\n    const db_query_record &dqr = static_cast<const db_query_record&>(dbr);\n    hash_map<const char*,query_data*,hash<const char*>,eqstr>::iterator fhit;\n    hash_map<const char*,query_data*,hash<const char*>,eqstr>::const_iterator hit\n    = dqr._related_queries.begin();\n    while (hit!=dqr._related_queries.end())\n      {\n        if ((fhit = _related_queries.find((*hit).first))!=_related_queries.end())\n          {\n            \/\/ merge.\n            (*fhit).second->merge((*hit).second);\n          }\n        else\n          {\n            \/\/ add query.\n            query_data *rd = new query_data((*hit).second);\n            _related_queries.insert(std::pair<const char*,query_data*>(rd->_query.c_str(),rd));\n          }\n        ++hit;\n      }\n    return 0;\n  }\n\n  void db_query_record::create_query_record(sp::db::record &r) const\n  {\n    create_base_record(r);\n    sp::db::related_queries *queries = r.MutableExtension(sp::db::queries);\n    hash_map<const char*,query_data*,hash<const char*>,eqstr>::const_iterator hit\n    = _related_queries.begin();\n    while (hit!=_related_queries.end())\n      {\n        query_data *rd = (*hit).second;\n        sp::db::related_query* rq = queries->add_rquery();\n        rq->set_radius(rd->_radius);\n        rq->set_query(rd->_query);\n        rq->set_query_hits((*hit).second->_hits);\n        sp::db::visited_urls *rq_vurls = rq->mutable_vurls();\n\n        if (rd->_visited_urls)\n          {\n            hash_map<const char*,vurl_data*,hash<const char*>,eqstr>::const_iterator vhit\n            = rd->_visited_urls->begin();\n            while (vhit!=rd->_visited_urls->end())\n              {\n                vurl_data *vd = (*vhit).second;\n                if (vd) \/\/ XXX: should not happen.\n                  {\n                    sp::db::visited_url *rq_vurl = rq_vurls->add_vurl();\n                    rq_vurl->set_url(vd->_url);\n                    rq_vurl->set_hits(vd->_hits);\n                  }\n                else std::cerr << \"[Debug]: null vurl_data element in visited_urls...\\n\";\n                ++vhit;\n              }\n          }\n        ++hit;\n      }\n  }\n\n  void db_query_record::read_query_record(sp::db::record &r)\n  {\n    read_base_record(r);\n    sp::db::related_queries *rqueries = r.MutableExtension(sp::db::queries);\n    int nrq = rqueries->rquery_size();\n    for (int i=0; i<nrq; i++)\n      {\n        sp::db::related_query *rq = rqueries->mutable_rquery(i);\n        short radius = rq->radius();\n        std::string query = rq->query();\n        query_data *rd = new query_data(query,radius);\n        rd->_hits = rq->query_hits();\n        sp::db::visited_urls *rq_vurls = rq->mutable_vurls();\n        int nvurls = rq_vurls->vurl_size();\n        if (nvurls > 0)\n          rd->create_visited_urls();\n        for (int j=0; j<nvurls; j++)\n          {\n            sp::db::visited_url *rq_vurl = rq_vurls->mutable_vurl(j);\n            std::string url = rq_vurl->url();\n            short uhits = rq_vurl->hits();\n            vurl_data *vd = new vurl_data(url,uhits);\n            rd->_visited_urls->insert(std::pair<const char*,vurl_data*>(vd->_url.c_str(),vd));\n          }\n        _related_queries.insert(std::pair<const char*,query_data*>(rd->_query.c_str(),rd));\n      }\n  }\n\n  int db_query_record::fix_issue_169(user_db &cudb)\n  {\n    \/\/ lookup a radius 0 query. If one:\n    \/\/ - convert the record's key.\n    \/\/ - generate 0 to max_radius keys for this query.\n    \/\/ - store the newly formed records in to the new DB.\n    \/\/ - change their keys and store them into the new DB.\n    \/\/ if none, skip.\n\n    hash_map<const char*,query_data*,hash<const char*>,eqstr>::const_iterator hit\n    = _related_queries.begin();\n    while (hit!=_related_queries.end())\n      {\n        query_data *qd = (*hit).second;\n        if (qd->_radius != 0)\n          {\n            ++hit;\n            continue;\n          }\n\n        \/\/ generate query hashes with proper hashing function.\n        hash_multimap<uint32_t,DHTKey,id_hash_uint> features;\n        qprocess::generate_query_hashes(qd->_query,0,\n                                        query_capture_configuration::_config->_max_radius,\n                                        features);\n\n        hash_multimap<uint32_t,DHTKey,id_hash_uint>::const_iterator fhit = features.begin();\n        while (fhit!=features.end())\n          {\n            if ((*hit).first == 0)\n              {\n                \/\/ copy this record and store it with fixed key in new db.\n                db_query_record cdqr(*this);\n                cdqr._creation_time = _creation_time; \/\/ reset creation time to original time.\n                std::string key_str = (*fhit).second.to_rstring();\n                cudb.add_dbr(key_str,cdqr);\n              }\n            else\n              {\n                \/\/ store the query fragment with fixed key.\n                db_query_record ndqr(\"query-capture\",qd->_query,(*fhit).first);\n                ndqr._creation_time = _creation_time; \/\/ reset creation time to original time.\n                std::string key_str = (*fhit).second.to_rstring();\n                cudb.add_dbr(key_str,ndqr);\n              }\n            ++fhit;\n          }\n        ++hit;\n      }\n\n    return 0;\n  }\n\n  int db_query_record::fix_issue_263()\n  {\n    std::vector<query_data*> to_insert;\n    hash_map<const char*,query_data*,hash<const char*>,eqstr>::iterator hit\n      = _related_queries.begin();\n    while (hit!=_related_queries.end())\n      {\n        query_data *qd = (*hit).second;\n\tstd::string query = qd->_query;\n\tstd::string fixed_query = miscutil::chomp_cpp(query);\n\tif (fixed_query != qd->_query)\n\t  {\n\t    \/\/std::cerr << \"fix 263: \" << qd->_query << \" -- \" << fixed_query << std::endl;\n\t    hash_map<const char*,query_data*,hash<const char*>,eqstr>::iterator hit2 = hit;\n\t    ++hit;\n\t    _related_queries.erase(hit2);\n\t    qd->_query = fixed_query;\n\t    to_insert.push_back(qd);\n\t  }\n\telse ++hit;\n      }\n    size_t tis = to_insert.size();\n    if (tis > 0)\n      {\n\tfor (size_t i=0;i<tis;i++)\n\t  _related_queries.insert(std::pair<const char*,query_data*>(to_insert.at(i)->_query.c_str(),\n\t\t\t\t\t\t\t\t     to_insert.at(i)));\n\treturn 1;\n      }\n    else return 0;\n  }\n\n} \/* end of namespace. *\/\n<|endoftext|>"}
{"text":"<commit_before>\/***************************************************************************\n**\n** This file is part of Qt Creator\n**\n** Copyright (c) 2008 Nokia Corporation and\/or its subsidiary(-ies).\n**\n** Contact:  Qt Software Information (qt-info@nokia.com)\n**\n**\n** Non-Open Source Usage\n**\n** Licensees may use this file in accordance with the Qt Beta Version\n** License Agreement, Agreement version 2.2 provided with the Software or,\n** alternatively, in accordance with the terms contained in a written\n** agreement between you and Nokia.\n**\n** GNU General Public License Usage\n**\n** Alternatively, this file may be used under the terms of the GNU General\n** Public License versions 2.0 or 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the packaging\n** of this file.  Please review the following information to ensure GNU\n** General Public Licensing requirements will be met:\n**\n** http:\/\/www.fsf.org\/licensing\/licenses\/info\/GPLv2.html and\n** http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n** In addition, as a special exception, Nokia gives you certain additional\n** rights. These rights are described in the Nokia Qt GPL Exception\n** version 1.2, included in the file GPL_EXCEPTION.txt in this package.\n**\n***************************************************************************\/\n\n#include \"texteditorsettings.h\"\n\n#include \"displaysettings.h\"\n#include \"generalsettingspage.h\"\n#include \"fontsettingspage.h\"\n#include \"storagesettings.h\"\n#include \"tabsettings.h\"\n#include \"texteditorconstants.h\"\n#include \"texteditorplugin.h\"\n\n#include <QApplication>\n\nusing namespace TextEditor;\nusing namespace TextEditor::Constants;\n\nTextEditorSettings *TextEditorSettings::m_instance = 0;\n\nTextEditorSettings::TextEditorSettings(Internal::TextEditorPlugin *plugin,\n                                       QObject *parent)\n    : QObject(parent)\n{\n    Q_ASSERT(!m_instance);\n    m_instance = this;\n\n    ExtensionSystem::PluginManager *pm = ExtensionSystem::PluginManager::instance();\n\n    \/\/ Note: default background colors are coming from FormatDescription::background()\n\n    \/\/ Add font preference page\n    FormatDescriptions formatDescriptions;\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_TEXT), tr(\"Text\")));\n\n    \/\/ Special categories\n    const QPalette p = QApplication::palette();\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_SELECTION), tr(\"Selection\"), p.color(QPalette::HighlightedText)));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_LINE_NUMBER), tr(\"Line Number\")));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_SEARCH_RESULT), tr(\"Search Result\")));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_SEARCH_SCOPE), tr(\"Search Scope\")));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_PARENTHESES), tr(\"Parentheses\")));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_CURRENT_LINE), tr(\"Current Line\")));\n\n    \/\/ Standard categories\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_NUMBER), tr(\"Number\"), Qt::darkBlue));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_STRING), tr(\"String\"), Qt::darkGreen));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_TYPE), tr(\"Type\"), Qt::darkMagenta));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_KEYWORD), tr(\"Keyword\"), Qt::darkYellow));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_OPERATOR), tr(\"Operator\")));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_PREPROCESSOR), tr(\"Preprocessor\"), Qt::darkBlue));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_LABEL), tr(\"Label\"), Qt::darkRed));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_COMMENT), tr(\"Comment\"), Qt::darkGreen));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_DISABLED_CODE), tr(\"Disabled Code\"), Qt::lightGray));\n\n    \/\/ Diff categories\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_ADDED_LINE), tr(\"Added Line\"),  Qt::blue));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_REMOVED_LINE), tr(\"Removed Line\"), Qt::red));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_DIFF_FILE), tr(\"Diff File\"), Qt::black));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_DIFF_LOCATION), tr(\"Diff Location\"), Qt::green));\n\n    \/\/ Pro file categories\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_VARIABLE), tr(\"Variable\"), Qt::blue));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_FUNCTION), tr(\"Function\"), Qt::green));\n\n    m_fontSettingsPage = new FontSettingsPage(formatDescriptions,\n                                              QLatin1String(\"TextEditor\"),\n                                              tr(\"Text Editor\"),\n                                              plugin->core());\n    pm->addObject(m_fontSettingsPage);\n\n    \/\/ Add the GUI used to configure the tab, storage and display settings\n    TextEditor::GeneralSettingsPageParameters generalSettingsPageParameters;\n    generalSettingsPageParameters.name = tr(\"General\");\n    generalSettingsPageParameters.category = QLatin1String(\"TextEditor\");\n    generalSettingsPageParameters.trCategory = tr(\"Text Editor\");\n    generalSettingsPageParameters.settingsPrefix = QLatin1String(\"text\");\n    m_generalSettingsPage = new GeneralSettingsPage(plugin->core(), generalSettingsPageParameters, this);\n    pm->addObject(m_generalSettingsPage);\n\n    connect(m_fontSettingsPage, SIGNAL(changed(TextEditor::FontSettings)),\n            this, SIGNAL(fontSettingsChanged(TextEditor::FontSettings)));\n    connect(m_generalSettingsPage, SIGNAL(tabSettingsChanged(TextEditor::TabSettings)),\n            this, SIGNAL(tabSettingsChanged(TextEditor::TabSettings)));\n    connect(m_generalSettingsPage, SIGNAL(storageSettingsChanged(TextEditor::StorageSettings)),\n            this, SIGNAL(storageSettingsChanged(TextEditor::StorageSettings)));\n    connect(m_generalSettingsPage, SIGNAL(displaySettingsChanged(TextEditor::DisplaySettings)),\n            this, SIGNAL(displaySettingsChanged(TextEditor::DisplaySettings)));\n}\n\nTextEditorSettings::~TextEditorSettings()\n{\n    ExtensionSystem::PluginManager *pm = ExtensionSystem::PluginManager::instance();\n    pm->removeObject(m_generalSettingsPage);\n    pm->removeObject(m_fontSettingsPage);\n\n    m_instance = 0;\n}\n\nTextEditorSettings *TextEditorSettings::instance()\n{\n    return m_instance;\n}\n\nFontSettings TextEditorSettings::fontSettings() const\n{\n    return m_fontSettingsPage->fontSettings();\n}\n\nTabSettings TextEditorSettings::tabSettings() const\n{\n    return m_generalSettingsPage->tabSettings();\n}\n\nStorageSettings TextEditorSettings::storageSettings() const\n{\n    return m_generalSettingsPage->storageSettings();\n}\n\nDisplaySettings TextEditorSettings::displaySettings() const\n{\n    return m_generalSettingsPage->displaySettings();\n}\n<commit_msg>Fixes:    Mem leak in fontsettings page.<commit_after>\/***************************************************************************\n**\n** This file is part of Qt Creator\n**\n** Copyright (c) 2008 Nokia Corporation and\/or its subsidiary(-ies).\n**\n** Contact:  Qt Software Information (qt-info@nokia.com)\n**\n**\n** Non-Open Source Usage\n**\n** Licensees may use this file in accordance with the Qt Beta Version\n** License Agreement, Agreement version 2.2 provided with the Software or,\n** alternatively, in accordance with the terms contained in a written\n** agreement between you and Nokia.\n**\n** GNU General Public License Usage\n**\n** Alternatively, this file may be used under the terms of the GNU General\n** Public License versions 2.0 or 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the packaging\n** of this file.  Please review the following information to ensure GNU\n** General Public Licensing requirements will be met:\n**\n** http:\/\/www.fsf.org\/licensing\/licenses\/info\/GPLv2.html and\n** http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n** In addition, as a special exception, Nokia gives you certain additional\n** rights. These rights are described in the Nokia Qt GPL Exception\n** version 1.2, included in the file GPL_EXCEPTION.txt in this package.\n**\n***************************************************************************\/\n\n#include \"texteditorsettings.h\"\n\n#include \"displaysettings.h\"\n#include \"generalsettingspage.h\"\n#include \"fontsettingspage.h\"\n#include \"storagesettings.h\"\n#include \"tabsettings.h\"\n#include \"texteditorconstants.h\"\n#include \"texteditorplugin.h\"\n\n#include <QApplication>\n\nusing namespace TextEditor;\nusing namespace TextEditor::Constants;\n\nTextEditorSettings *TextEditorSettings::m_instance = 0;\n\nTextEditorSettings::TextEditorSettings(Internal::TextEditorPlugin *plugin,\n                                       QObject *parent)\n    : QObject(parent)\n{\n    Q_ASSERT(!m_instance);\n    m_instance = this;\n\n    ExtensionSystem::PluginManager *pm = ExtensionSystem::PluginManager::instance();\n\n    \/\/ Note: default background colors are coming from FormatDescription::background()\n\n    \/\/ Add font preference page\n    FormatDescriptions formatDescriptions;\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_TEXT), tr(\"Text\")));\n\n    \/\/ Special categories\n    const QPalette p = QApplication::palette();\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_SELECTION), tr(\"Selection\"), p.color(QPalette::HighlightedText)));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_LINE_NUMBER), tr(\"Line Number\")));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_SEARCH_RESULT), tr(\"Search Result\")));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_SEARCH_SCOPE), tr(\"Search Scope\")));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_PARENTHESES), tr(\"Parentheses\")));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_CURRENT_LINE), tr(\"Current Line\")));\n\n    \/\/ Standard categories\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_NUMBER), tr(\"Number\"), Qt::darkBlue));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_STRING), tr(\"String\"), Qt::darkGreen));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_TYPE), tr(\"Type\"), Qt::darkMagenta));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_KEYWORD), tr(\"Keyword\"), Qt::darkYellow));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_OPERATOR), tr(\"Operator\")));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_PREPROCESSOR), tr(\"Preprocessor\"), Qt::darkBlue));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_LABEL), tr(\"Label\"), Qt::darkRed));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_COMMENT), tr(\"Comment\"), Qt::darkGreen));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_DISABLED_CODE), tr(\"Disabled Code\"), Qt::lightGray));\n\n    \/\/ Diff categories\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_ADDED_LINE), tr(\"Added Line\"),  Qt::blue));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_REMOVED_LINE), tr(\"Removed Line\"), Qt::red));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_DIFF_FILE), tr(\"Diff File\"), Qt::black));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_DIFF_LOCATION), tr(\"Diff Location\"), Qt::green));\n\n    \/\/ Pro file categories\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_VARIABLE), tr(\"Variable\"), Qt::blue));\n    formatDescriptions.push_back(FormatDescription(QLatin1String(C_FUNCTION), tr(\"Function\"), Qt::green));\n\n    m_fontSettingsPage = new FontSettingsPage(formatDescriptions,\n                                              QLatin1String(\"TextEditor\"),\n                                              tr(\"Text Editor\"),\n                                              plugin->core());\n    pm->addObject(m_fontSettingsPage);\n\n    \/\/ Add the GUI used to configure the tab, storage and display settings\n    TextEditor::GeneralSettingsPageParameters generalSettingsPageParameters;\n    generalSettingsPageParameters.name = tr(\"General\");\n    generalSettingsPageParameters.category = QLatin1String(\"TextEditor\");\n    generalSettingsPageParameters.trCategory = tr(\"Text Editor\");\n    generalSettingsPageParameters.settingsPrefix = QLatin1String(\"text\");\n    m_generalSettingsPage = new GeneralSettingsPage(plugin->core(), generalSettingsPageParameters, this);\n    pm->addObject(m_generalSettingsPage);\n\n    connect(m_fontSettingsPage, SIGNAL(changed(TextEditor::FontSettings)),\n            this, SIGNAL(fontSettingsChanged(TextEditor::FontSettings)));\n    connect(m_generalSettingsPage, SIGNAL(tabSettingsChanged(TextEditor::TabSettings)),\n            this, SIGNAL(tabSettingsChanged(TextEditor::TabSettings)));\n    connect(m_generalSettingsPage, SIGNAL(storageSettingsChanged(TextEditor::StorageSettings)),\n            this, SIGNAL(storageSettingsChanged(TextEditor::StorageSettings)));\n    connect(m_generalSettingsPage, SIGNAL(displaySettingsChanged(TextEditor::DisplaySettings)),\n            this, SIGNAL(displaySettingsChanged(TextEditor::DisplaySettings)));\n}\n\nTextEditorSettings::~TextEditorSettings()\n{\n    ExtensionSystem::PluginManager *pm = ExtensionSystem::PluginManager::instance();\n    pm->removeObject(m_generalSettingsPage);\n    pm->removeObject(m_fontSettingsPage);\n    delete m_fontSettingsPage;\n\n    m_instance = 0;\n}\n\nTextEditorSettings *TextEditorSettings::instance()\n{\n    return m_instance;\n}\n\nFontSettings TextEditorSettings::fontSettings() const\n{\n    return m_fontSettingsPage->fontSettings();\n}\n\nTabSettings TextEditorSettings::tabSettings() const\n{\n    return m_generalSettingsPage->tabSettings();\n}\n\nStorageSettings TextEditorSettings::storageSettings() const\n{\n    return m_generalSettingsPage->storageSettings();\n}\n\nDisplaySettings TextEditorSettings::displaySettings() const\n{\n    return m_generalSettingsPage->displaySettings();\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>INTEGRATION: CWS tbe21 (1.32.10); FILE MERGED 2005\/02\/25 13:23:53 tbe 1.32.10.1: #i42907# missing control properties in xml im-\/export for dialogs<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>Fix the loss<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>Removed an obsolete documentation reference<commit_after><|endoftext|>"}
{"text":"<commit_before>#include <Demux\/Demux.h>\n#include <HealthEcho\/HealthEcho.h>\n#include <nsh\/nsh.h>\n#include <Packet.h>\n\nnamespace nshdev\n{\n    Demux::Demux():\n\tm_oamConsumer(new HealthEcho())\n    {\n    }\n\n    void Demux::Receive(nshdev::PacketRef& packetRef, nshdev::NetInterface& receiveInterface)\n    {\n\tconst nsh_hdr* nsh = reinterpret_cast<const nsh_hdr*>(packetRef.Data());\n\tif(nsh_is_oam_packet(nsh))\n\t{\n\t    m_oamConsumer->Receive(packetRef, receiveInterface);\n\t}\n\telse if(m_dataConsumer)\n\t{\n\t    m_dataConsumer->Receive(packetRef, receiveInterface);\n\t}\n    }\n}\n\n<commit_msg>Decrement SI in Demux before calling consumer<commit_after>#include <Demux\/Demux.h>\n#include <HealthEcho\/HealthEcho.h>\n#include <nsh\/nsh.h>\n#include <Packet.h>\n\nnamespace nshdev\n{\n    Demux::Demux():\n\tm_oamConsumer(new HealthEcho())\n    {\n    }\n\n    void Demux::Receive(nshdev::PacketRef& packetRef, nshdev::NetInterface& receiveInterface)\n    {\n\tnsh_hdr* nsh = reinterpret_cast<nsh_hdr*>(packetRef.Data());\n\tif(nsh_is_oam_packet(nsh))\n\t{\n\t    m_oamConsumer->Receive(packetRef, receiveInterface);\n\t}\n\telse if(m_dataConsumer)\n\t{\n\t    nsh_decrement_service_index(nsh);\n\t    m_dataConsumer->Receive(packetRef, receiveInterface);\n\t}\n    }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <UtH\/Engine\/Text.hpp>\n#include <UtH\/Platform\/Graphics.hpp>\n#include <UtH\/Engine\/GameObject.hpp>\n#include <UtH\/Platform\/Debug.hpp>\n#include <UtH\/Renderer\/RenderTarget.hpp>\n#include <UtH\/Resources\/ResourceManager.hpp>\n#include <UtH\/Platform\/Configuration.hpp>\n\n#include <freetype-gl\/freetype-gl.h>\n\n#include <cmath>\n\nusing namespace uth;\n\nuth::Text::Text(const std::string& fontPath, const float fontSize, \n\tconst std::string& name \/*= \"Text\"*\/, \n\tconst pmath::Vec4 defaultColor \/*= pmath::Vec4(1,1,1,1)*\/)\n\t: Component(name),\n\tm_fontSize(fontSize),\n\tm_size(0, m_fontSize)\n{\n\/\/#if defined(UTH_SYSTEM_OPENGLES)\n\/\/\tm_textShader.LoadShader(\"Shaders\/DefaultText.vert\", \"Shaders\/esText.frag\");\n\/\/#else\n\tm_textShader.LoadShader(\"Shaders\/DefaultText.vert\", \"Shaders\/DefaultText.frag\");\n\/\/#endif\n\n\tm_atlas = texture_atlas_new(1024, 1024, 1);\n\n\tconst Font* font = uthRS.LoadFont(fontPath);\n\n\tif (font)\n\t{\n\t\tauto& data = font->GetFontData();\n\n\t\tm_font = texture_font_new_from_memory(m_atlas, fontSize, data.ptr(), data.size());\n\t}\n}\n\nText::~Text()\n{\n\ttexture_font_delete(m_font);\n\ttexture_atlas_delete(m_atlas);\n}\n\nvoid Text::Init()\n{\n\tparent->transform.setSize(m_size);\n}\n\nvoid uth::Text::SetText(const std::string& text)\n{\n\tSetText(text, m_color);\n}\nvoid uth::Text::SetText(const std::wstring& text)\n{\n\tSetText(text, m_color);\n}\nvoid Text::SetText(const std::string& text, const pmath::Vec4 color)\n{\n\tSetText(std::wstring(text.begin(), text.end()), color);\n}\nvoid Text::SetText(const std::wstring& text, const pmath::Vec4 color)\n{\n\tm_size = pmath::Vec2(0, m_fontSize);\n\tm_vertexBuffer.clear();\n\tm_lastPos = pmath::Vec2(0, 0);\n\tm_text = std::wstring();\n\n\tAddText(text, color);\n}\n\nvoid uth::Text::AddText(const std::string& text)\n{\n\tAddText(text, m_color);\n}\nvoid uth::Text::AddText(const std::wstring& text)\n{\n\tAddText(text, m_color);\n}\nvoid Text::AddText(const std::string& text, const pmath::Vec4 color)\n{\n\tAddText(std::wstring(text.begin(),text.end()),color);\n}\nvoid Text::AddText(const std::wstring& text, const pmath::Vec4 color)\n{\n\tm_text += text;\n\n\ttexture_font_load_glyphs(m_font, text.c_str());\n\n\tbool newLine = false;\n\tpmath::Vec2 pos = m_lastPos;\n\n\tfor (size_t i = 0; i < text.length(); ++i)\n\t{\n\t\ttexture_glyph_t* glyph = nullptr;\n\t\tif (text.at(i) == L'\\n')\n\t\t{\n\t\t\tnewLine = true;\n\t\t\tpos.y += m_fontSize;\n\t\t\tm_size.y = pos.y + m_fontSize;\n\t\t\tpos.x = 0;\n\t\t}\n\t\telse\n\t\t\tglyph = texture_font_get_glyph(m_font, text.at(i));\n\n\t\tif (glyph != nullptr)\n\t\t{\n\t\t\tfloat kerning = 0.f;\n\t\t\tif (i > 0 && !newLine)\n\t\t\t\tkerning = texture_glyph_get_kerning(glyph, text.at(i - 1));\n\n\t\t\tpos.x += kerning;\n\n\t\t\tconst float x0 = pos.x + glyph->offset_x;\n\t\t\tconst float y0 = pos.y + m_fontSize - glyph->offset_y;\n\t\t\tconst float x1 = x0 + glyph->width;\n\t\t\tconst float y1 = y0 + glyph->height;\n\n\t\t\tconst float s0 = glyph->s0; \/\/ Top left x\n\t\t\tconst float t0 = glyph->t0; \/\/ Top left y\n\t\t\tconst float s1 = glyph->s1; \/\/ Bottom right x\n\t\t\tconst float t1 = glyph->t1; \/\/ Bottom right y\n\n\t\t\tm_vertexBuffer.addVertex(Vertex(pmath::Vec3(x0, y0, 0), pmath::Vec2(s0, t0), color));\n\t\t\tm_vertexBuffer.addVertex(Vertex(pmath::Vec3(x0, y1, 0), pmath::Vec2(s0, t1), color));\n\t\t\tm_vertexBuffer.addVertex(Vertex(pmath::Vec3(x1, y1, 0), pmath::Vec2(s1, t1), color));\n\t\t\tm_vertexBuffer.addVertex(Vertex(pmath::Vec3(x1, y0, 0), pmath::Vec2(s1, t0), color));\n\n\t\t\tstd::vector<unsigned short> indices;\n\t\t\tindices.push_back(0);\n\t\t\tindices.push_back(1);\n\t\t\tindices.push_back(2);\n\t\t\tindices.push_back(0);\n\t\t\tindices.push_back(2);\n\t\t\tindices.push_back(3);\n\t\t\tm_vertexBuffer.addIndices(indices);\n\n\t\t\tpos.x += glyph->advance_x;\n\t\t\tnewLine = false;\n\n\t\t\tif (pos.x>m_size.x)\n\t\t\t{\n\t\t\t\tm_size.x=pos.x;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (parent)\n\t\tparent->transform.setSize(m_size);\n\n\tm_matrix[0][0] = 1;\n\tm_matrix[1][1] = 1;\n\tm_matrix[0][3] = (-0.5f) * m_size.x;\n\tm_matrix[1][3] = (-0.5f) * m_size.y;\n\n\tm_lastPos = pos;\n}\n\nconst std::wstring& Text::GetText() const\n{\n\treturn m_text;\n}\n\nvoid uth::Text::SetColor(const pmath::Vec4 color)\n{\n\tm_color = color;\n\tSetText(m_text, color);\n}\nconst pmath::Vec4 uth::Text::GetDefaultColor()\n{\n\treturn m_color;\n}\n\nvoid Text::Draw(RenderTarget& target)\n{\n\ttarget.Bind();\n\tm_textShader.Use();\n\n\tuth::Graphics::BindTexture(TEXTURE_2D, m_atlas->id);\n\tm_textShader.SetUniform(\"unifSampler\", 0);\n\n\tm_textShader.SetUniform(\"unifModel\", parent->transform.GetTransform() * m_matrix);\n\tm_textShader.SetUniform(\"unifProjection\", target.GetCamera().GetProjectionTransform());\n\n\tm_vertexBuffer.bindArrayBuffer();\n\t\/\/ (position + uv + color) * sizeof(float)\n\tconst int posOffset = (3 + 2 + 4)*sizeof(float);\n\t\/\/ position * sizeof(float)\n\tconst int uvStart = 3*sizeof(float);\n\t\/\/ (position + uv) * sizeof(float)\n\tconst int colorStart = (3 + 2)*sizeof(float);\n\n\t\/\/ Attribute name, number of components, datatype, bytes between first elements,\n\t\/\/ offset of first element in buffer\n\tm_textShader.setAttributeData(\"attrPosition\", 3, FLOAT_TYPE, posOffset, (void*)0);\n\tm_textShader.setAttributeData(\"attrUV\", 2, FLOAT_TYPE, posOffset, (void*)uvStart);\n\tm_textShader.setAttributeData(\"attrColor\", 4, FLOAT_TYPE, posOffset, (void*)colorStart);\n\n\tm_vertexBuffer.bindElementBuffer();\n\tuth::Graphics::DrawElements(TRIANGLES, m_vertexBuffer.getIndices().size(), UNSIGNED_SHORT_TYPE, (void*)0);\n\n\tuth::Graphics::BindBuffer(ARRAY_BUFFER, 0);\n}\n<commit_msg>Actually set the default color<commit_after>#include <UtH\/Engine\/Text.hpp>\n#include <UtH\/Platform\/Graphics.hpp>\n#include <UtH\/Engine\/GameObject.hpp>\n#include <UtH\/Platform\/Debug.hpp>\n#include <UtH\/Renderer\/RenderTarget.hpp>\n#include <UtH\/Resources\/ResourceManager.hpp>\n#include <UtH\/Platform\/Configuration.hpp>\n\n#include <freetype-gl\/freetype-gl.h>\n\n#include <cmath>\n\nusing namespace uth;\n\nuth::Text::Text(const std::string& fontPath, const float fontSize, \n\tconst std::string& name \/*= \"Text\"*\/, \n\tconst pmath::Vec4 defaultColor \/*= pmath::Vec4(1,1,1,1)*\/)\n\t: Component(name),\n\tm_fontSize(fontSize),\n\tm_size(0, m_fontSize),\n    m_color(defaultColor)\n{\n\/\/#if defined(UTH_SYSTEM_OPENGLES)\n\/\/\tm_textShader.LoadShader(\"Shaders\/DefaultText.vert\", \"Shaders\/esText.frag\");\n\/\/#else\n\tm_textShader.LoadShader(\"Shaders\/DefaultText.vert\", \"Shaders\/DefaultText.frag\");\n\/\/#endif\n\n\tm_atlas = texture_atlas_new(1024, 1024, 1);\n\n\tconst Font* font = uthRS.LoadFont(fontPath);\n\n\tif (font)\n\t{\n\t\tauto& data = font->GetFontData();\n\n\t\tm_font = texture_font_new_from_memory(m_atlas, fontSize, data.ptr(), data.size());\n\t}\n}\n\nText::~Text()\n{\n\ttexture_font_delete(m_font);\n\ttexture_atlas_delete(m_atlas);\n}\n\nvoid Text::Init()\n{\n\tparent->transform.setSize(m_size);\n}\n\nvoid uth::Text::SetText(const std::string& text)\n{\n\tSetText(text, m_color);\n}\nvoid uth::Text::SetText(const std::wstring& text)\n{\n\tSetText(text, m_color);\n}\nvoid Text::SetText(const std::string& text, const pmath::Vec4 color)\n{\n\tSetText(std::wstring(text.begin(), text.end()), color);\n}\nvoid Text::SetText(const std::wstring& text, const pmath::Vec4 color)\n{\n\tm_size = pmath::Vec2(0, m_fontSize);\n\tm_vertexBuffer.clear();\n\tm_lastPos = pmath::Vec2(0, 0);\n\tm_text = std::wstring();\n\n\tAddText(text, color);\n}\n\nvoid uth::Text::AddText(const std::string& text)\n{\n\tAddText(text, m_color);\n}\nvoid uth::Text::AddText(const std::wstring& text)\n{\n\tAddText(text, m_color);\n}\nvoid Text::AddText(const std::string& text, const pmath::Vec4 color)\n{\n\tAddText(std::wstring(text.begin(),text.end()),color);\n}\nvoid Text::AddText(const std::wstring& text, const pmath::Vec4 color)\n{\n\tm_text += text;\n\n\ttexture_font_load_glyphs(m_font, text.c_str());\n\n\tbool newLine = false;\n\tpmath::Vec2 pos = m_lastPos;\n\n\tfor (size_t i = 0; i < text.length(); ++i)\n\t{\n\t\ttexture_glyph_t* glyph = nullptr;\n\t\tif (text.at(i) == L'\\n')\n\t\t{\n\t\t\tnewLine = true;\n\t\t\tpos.y += m_fontSize;\n\t\t\tm_size.y = pos.y + m_fontSize;\n\t\t\tpos.x = 0;\n\t\t}\n\t\telse\n\t\t\tglyph = texture_font_get_glyph(m_font, text.at(i));\n\n\t\tif (glyph != nullptr)\n\t\t{\n\t\t\tfloat kerning = 0.f;\n\t\t\tif (i > 0 && !newLine)\n\t\t\t\tkerning = texture_glyph_get_kerning(glyph, text.at(i - 1));\n\n\t\t\tpos.x += kerning;\n\n\t\t\tconst float x0 = pos.x + glyph->offset_x;\n\t\t\tconst float y0 = pos.y + m_fontSize - glyph->offset_y;\n\t\t\tconst float x1 = x0 + glyph->width;\n\t\t\tconst float y1 = y0 + glyph->height;\n\n\t\t\tconst float s0 = glyph->s0; \/\/ Top left x\n\t\t\tconst float t0 = glyph->t0; \/\/ Top left y\n\t\t\tconst float s1 = glyph->s1; \/\/ Bottom right x\n\t\t\tconst float t1 = glyph->t1; \/\/ Bottom right y\n\n\t\t\tm_vertexBuffer.addVertex(Vertex(pmath::Vec3(x0, y0, 0), pmath::Vec2(s0, t0), color));\n\t\t\tm_vertexBuffer.addVertex(Vertex(pmath::Vec3(x0, y1, 0), pmath::Vec2(s0, t1), color));\n\t\t\tm_vertexBuffer.addVertex(Vertex(pmath::Vec3(x1, y1, 0), pmath::Vec2(s1, t1), color));\n\t\t\tm_vertexBuffer.addVertex(Vertex(pmath::Vec3(x1, y0, 0), pmath::Vec2(s1, t0), color));\n\n\t\t\tstd::vector<unsigned short> indices;\n\t\t\tindices.push_back(0);\n\t\t\tindices.push_back(1);\n\t\t\tindices.push_back(2);\n\t\t\tindices.push_back(0);\n\t\t\tindices.push_back(2);\n\t\t\tindices.push_back(3);\n\t\t\tm_vertexBuffer.addIndices(indices);\n\n\t\t\tpos.x += glyph->advance_x;\n\t\t\tnewLine = false;\n\n\t\t\tif (pos.x>m_size.x)\n\t\t\t{\n\t\t\t\tm_size.x=pos.x;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (parent)\n\t\tparent->transform.setSize(m_size);\n\n\tm_matrix[0][0] = 1;\n\tm_matrix[1][1] = 1;\n\tm_matrix[0][3] = (-0.5f) * m_size.x;\n\tm_matrix[1][3] = (-0.5f) * m_size.y;\n\n\tm_lastPos = pos;\n}\n\nconst std::wstring& Text::GetText() const\n{\n\treturn m_text;\n}\n\nvoid uth::Text::SetColor(const pmath::Vec4 color)\n{\n\tm_color = color;\n\tSetText(m_text, color);\n}\nconst pmath::Vec4 uth::Text::GetDefaultColor()\n{\n\treturn m_color;\n}\n\nvoid Text::Draw(RenderTarget& target)\n{\n\ttarget.Bind();\n\tm_textShader.Use();\n\n\tuth::Graphics::BindTexture(TEXTURE_2D, m_atlas->id);\n\tm_textShader.SetUniform(\"unifSampler\", 0);\n\n\tm_textShader.SetUniform(\"unifModel\", parent->transform.GetTransform() * m_matrix);\n\tm_textShader.SetUniform(\"unifProjection\", target.GetCamera().GetProjectionTransform());\n\n\tm_vertexBuffer.bindArrayBuffer();\n\t\/\/ (position + uv + color) * sizeof(float)\n\tconst int posOffset = (3 + 2 + 4)*sizeof(float);\n\t\/\/ position * sizeof(float)\n\tconst int uvStart = 3*sizeof(float);\n\t\/\/ (position + uv) * sizeof(float)\n\tconst int colorStart = (3 + 2)*sizeof(float);\n\n\t\/\/ Attribute name, number of components, datatype, bytes between first elements,\n\t\/\/ offset of first element in buffer\n\tm_textShader.setAttributeData(\"attrPosition\", 3, FLOAT_TYPE, posOffset, (void*)0);\n\tm_textShader.setAttributeData(\"attrUV\", 2, FLOAT_TYPE, posOffset, (void*)uvStart);\n\tm_textShader.setAttributeData(\"attrColor\", 4, FLOAT_TYPE, posOffset, (void*)colorStart);\n\n\tm_vertexBuffer.bindElementBuffer();\n\tuth::Graphics::DrawElements(TRIANGLES, m_vertexBuffer.getIndices().size(), UNSIGNED_SHORT_TYPE, (void*)0);\n\n\tuth::Graphics::BindBuffer(ARRAY_BUFFER, 0);\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Refactor producer plugin start_block into a few methods to make the logic easier to follow<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>Fix auth base64 computation when HMAC return string contains \\0 character<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ WulfGame\/Game\/Player.cpp\n\/\/ Copyright (C) 2012 Lexi Robinson\n\/\/ This code is freely available under the MIT licence.\n\/\/\n#include \"Game\/Player.h\"\n\n#include <iostream>\n\nusing namespace Wulf;\n\nPlayer::Player()\n\t: Entity()\n#ifdef FREE_VIEW\n\t, fhViewAngle(0.0f), fvViewAngle(3.14f * 2.0f)\n\t, mUp(0, 0, 1)\n#else \/\/ !FREE_VIEW\n\t, fViewAngle(0.0f)\n#endif \/\/ \/FREE_VIEW\n{\n\t\/\/ Woo.\n}\n\n\/\/ TODO: Sensitivity settings!\nstatic const float fMouseSpeed = 0.005f;\nstatic const float fKeySpeed   = 3.0f;\n#ifdef FREE_VIEW\n\tstatic const float clampUp = 3.14f * 2.2f;\n\tstatic const float clampDn = 3.14f * 1.8f;\n#else\n\tstatic const Vector up(0, 0, 1);\n#endif\n\nvoid Player::ProcessUserInput(const Input::Data& input, const double dtime)\n{\n\t\/\/ Lose some precision\n\tconst float ftime = static_cast<float>(dtime);\n\n\t\/\/ Viewage\n#ifdef FREE_VIEW\n\tfhViewAngle -= fMouseSpeed * input.DeltaViewX;\n\tfvViewAngle -= fMouseSpeed * input.DeltaViewY;\n\tfvViewAngle = (fvViewAngle > clampUp) ? clampUp : fvViewAngle;\n\tfvViewAngle = (fvViewAngle < clampDn) ? clampDn : fvViewAngle;\n\n\tmDir = glm::vec3(\n\t\tsin(fhViewAngle) * cos(fvViewAngle),\n\t\tcos(fhViewAngle) * cos(fvViewAngle),\n\t\t\t\t\t\t   sin(fvViewAngle)\n\t);\n\tfloat fhvang = fhViewAngle - 3.14f \/ 2.0f;\n\tglm::vec3 right(\n\t\tsin(fhvang),\n\t\tcos(fhvang),\n\t\t0\n\t);\n\tmUp = glm::cross(mDir, right);\n#else\n\tfViewAngle -= fMouseSpeed * input.DeltaView;\n\tmDir = glm::vec3(\n\t\tsin(fViewAngle),\n\t\tcos(fViewAngle),\n\t\t0\n\t);\n\tglm::vec3 right = glm::cross(up, mDir);\n#endif\n\tglm::vec3 vel(0, 0, 0);\n\tfloat amt = ftime * fKeySpeed;\n\tif (input.Forwards)\n\t\tvel += mDir * amt;\n\tif (input.Backwards)\n\t\tvel -= mDir * amt;\n\tif (input.Left)\n\t\tvel += right * amt;\n\tif (input.Right)\n\t\tvel -= right * amt;\n#ifdef FREE_VIEW\n\tmPos += vel;\n#else\n\tthis->Move(vel);\n#endif\n}\n\nvoid Player::ProcessMapInput(const Map::Map& map)\n{\n\tmPos = map.spawnPos;\n#ifdef FREE_VIEW\n\tfhViewAngle = map.spawnAng;\n\tfvViewAngle = 3.14f * 2.0f;\n\tmDir = glm::vec3(\n\t\tsin(fhViewAngle) * cos(fvViewAngle),\n\t\tcos(fhViewAngle) * cos(fvViewAngle),\n\t\t\t\t\t\t   sin(fvViewAngle)\n\t);\n\tfloat fhvang = fhViewAngle - 3.14f \/ 2.0f;\n\tglm::vec3 right(\n\t\tsin(fhvang),\n\t\tcos(fhvang),\n\t\t0\n\t);\n\tmUp = glm::cross(mDir, right);\n#else \/\/ !FREE_VIEW\n\tfViewAngle = map.spawnAng;\n\tmDir = glm::vec3(\n\t\tsin(fViewAngle),\n\t\tcos(fViewAngle),\n\t\t0\n\t);\n#endif \/\/ \/FREE_VIEW\n}\n<commit_msg>Initialize the player's fields<commit_after>\/\/\n\/\/ WulfGame\/Game\/Player.cpp\n\/\/ Copyright (C) 2012 Lexi Robinson\n\/\/ This code is freely available under the MIT licence.\n\/\/\n#include \"Game\/Player.h\"\n\n#include <iostream>\n\nusing namespace Wulf;\n\nPlayer::Player()\n\t: Entity()\n\t, Score(0), Ammo(8)\n#ifdef FREE_VIEW\n\t, fhViewAngle(0.0f), fvViewAngle(3.14f * 2.0f)\n\t, mUp(0, 0, 1)\n#else \/\/ !FREE_VIEW\n\t, fViewAngle(0.0f)\n#endif \/\/ \/FREE_VIEW\n{\n\t\/\/ Woo.\n}\n\n\/\/ TODO: Sensitivity settings!\nstatic const float fMouseSpeed = 0.005f;\nstatic const float fKeySpeed   = 3.0f;\n#ifdef FREE_VIEW\n\tstatic const float clampUp = 3.14f * 2.2f;\n\tstatic const float clampDn = 3.14f * 1.8f;\n#else\n\tstatic const Vector up(0, 0, 1);\n#endif\n\nvoid Player::ProcessUserInput(const Input::Data& input, const double dtime)\n{\n\t\/\/ Lose some precision\n\tconst float ftime = static_cast<float>(dtime);\n\n\t\/\/ Viewage\n#ifdef FREE_VIEW\n\tfhViewAngle -= fMouseSpeed * input.DeltaViewX;\n\tfvViewAngle -= fMouseSpeed * input.DeltaViewY;\n\tfvViewAngle = (fvViewAngle > clampUp) ? clampUp : fvViewAngle;\n\tfvViewAngle = (fvViewAngle < clampDn) ? clampDn : fvViewAngle;\n\n\tmDir = glm::vec3(\n\t\tsin(fhViewAngle) * cos(fvViewAngle),\n\t\tcos(fhViewAngle) * cos(fvViewAngle),\n\t\t\t\t\t\t   sin(fvViewAngle)\n\t);\n\tfloat fhvang = fhViewAngle - 3.14f \/ 2.0f;\n\tglm::vec3 right(\n\t\tsin(fhvang),\n\t\tcos(fhvang),\n\t\t0\n\t);\n\tmUp = glm::cross(mDir, right);\n#else\n\tfViewAngle -= fMouseSpeed * input.DeltaView;\n\tmDir = glm::vec3(\n\t\tsin(fViewAngle),\n\t\tcos(fViewAngle),\n\t\t0\n\t);\n\tglm::vec3 right = glm::cross(up, mDir);\n#endif\n\tglm::vec3 vel(0, 0, 0);\n\tfloat amt = ftime * fKeySpeed;\n\tif (input.Forwards)\n\t\tvel += mDir * amt;\n\tif (input.Backwards)\n\t\tvel -= mDir * amt;\n\tif (input.Left)\n\t\tvel += right * amt;\n\tif (input.Right)\n\t\tvel -= right * amt;\n#ifdef FREE_VIEW\n\tmPos += vel;\n#else\n\tthis->Move(vel);\n#endif\n}\n\nvoid Player::ProcessMapInput(const Map::Map& map)\n{\n\tmPos = map.spawnPos;\n#ifdef FREE_VIEW\n\tfhViewAngle = map.spawnAng;\n\tfvViewAngle = 3.14f * 2.0f;\n\tmDir = glm::vec3(\n\t\tsin(fhViewAngle) * cos(fvViewAngle),\n\t\tcos(fhViewAngle) * cos(fvViewAngle),\n\t\t\t\t\t\t   sin(fvViewAngle)\n\t);\n\tfloat fhvang = fhViewAngle - 3.14f \/ 2.0f;\n\tglm::vec3 right(\n\t\tsin(fhvang),\n\t\tcos(fhvang),\n\t\t0\n\t);\n\tmUp = glm::cross(mDir, right);\n#else \/\/ !FREE_VIEW\n\tfViewAngle = map.spawnAng;\n\tmDir = glm::vec3(\n\t\tsin(fViewAngle),\n\t\tcos(fViewAngle),\n\t\t0\n\t);\n#endif \/\/ \/FREE_VIEW\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\nqgvdial is a cross platform Google Voice Dialer\nCopyright (C) 2010  Yuvraaj Kelkar\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\nContact: yuvraaj@gmail.com\n*\/\n\n#include \"GvXMLParser.h\"\n#include <QtXmlPatterns>\n\nGvXMLParser::GvXMLParser (QObject *parent)\n: QObject (parent)\n, bEmitLog (true)\n{\n}\/\/GvXMLParser::GvXMLParser\n\nbool\nGvXMLParser::startElement (const QString        & \/*namespaceURI*\/,\n                           const QString        & \/*localName   *\/,\n                           const QString        & \/*qName       *\/,\n                           const QXmlAttributes & \/*atts        *\/)\n{\n    strChars.clear ();\n    return (true);\n}\/\/GvXMLParser::startElement\n\nbool\nGvXMLParser::endElement (const QString & \/*namespaceURI*\/,\n                         const QString &localName   ,\n                         const QString & \/*qName       *\/)\n{\n    if (localName == \"json\") {\n        strJson = strChars;\n        if (bEmitLog) qDebug (\"Got json characters\");\n\n#if 0\n        QFile temp(\"dump-json.txt\");\n        temp.open (QIODevice::ReadWrite);\n        temp.write (strJson.toAscii ());\n        temp.close ();\n#endif\n    }\n\n    if (localName == \"html\") {\n        strHtml = \"<html>\" + strChars + \"<\/html>\";\n        if (bEmitLog) qDebug (\"Got html characters\");\n\n#if 0\n        QFile temp(\"dump-html.txt\");\n        temp.open (QIODevice::ReadWrite);\n        temp.write (strHtml.toAscii ());\n        temp.close ();\n#endif\n    }\/\/ if html\n    return (true);\n}\/\/GvXMLParser::endElement\n\nbool\nGvXMLParser::characters (const QString &ch)\n{\n    strChars += ch;\n    return (true);\n}\/\/GvXMLParser::characters\n\nvoid\nGvXMLParser::setEmitLog (bool enable)\n{\n    bEmitLog = enable;\n}\/\/GvXMLParser::setEmitLog\n<commit_msg>trim the xml<commit_after>\/*\nqgvdial is a cross platform Google Voice Dialer\nCopyright (C) 2010  Yuvraaj Kelkar\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\nContact: yuvraaj@gmail.com\n*\/\n\n#include \"GvXMLParser.h\"\n#include <QtXmlPatterns>\n\nGvXMLParser::GvXMLParser (QObject *parent)\n: QObject (parent)\n, bEmitLog (true)\n{\n}\/\/GvXMLParser::GvXMLParser\n\nbool\nGvXMLParser::startElement (const QString        & \/*namespaceURI*\/,\n                           const QString        & \/*localName   *\/,\n                           const QString        & \/*qName       *\/,\n                           const QXmlAttributes & \/*atts        *\/)\n{\n    strChars.clear ();\n    return (true);\n}\/\/GvXMLParser::startElement\n\nbool\nGvXMLParser::endElement (const QString & \/*namespaceURI*\/,\n                         const QString &localName   ,\n                         const QString & \/*qName       *\/)\n{\n    if (localName == \"json\") {\n        strJson = strChars;\n        if (bEmitLog) qDebug (\"Got json characters\");\n\n#if 0\n        QFile temp(\"dump-json.txt\");\n        temp.open (QIODevice::ReadWrite);\n        temp.write (strJson.toAscii ());\n        temp.close ();\n#endif\n    }\n\n    if (localName == \"html\") {\n        strHtml = \"<html>\" + strChars.trimmed ()+ \"<\/html>\";\n        if (bEmitLog) qDebug (\"Got html characters\");\n\n#if 0\n        QFile temp(\"dump-html.txt\");\n        temp.open (QIODevice::ReadWrite);\n        temp.write (strHtml.toAscii ());\n        temp.close ();\n#endif\n    }\/\/ if html\n    return (true);\n}\/\/GvXMLParser::endElement\n\nbool\nGvXMLParser::characters (const QString &ch)\n{\n    strChars += ch;\n    return (true);\n}\/\/GvXMLParser::characters\n\nvoid\nGvXMLParser::setEmitLog (bool enable)\n{\n    bEmitLog = enable;\n}\/\/GvXMLParser::setEmitLog\n<|endoftext|>"}
{"text":"<commit_before>#include <ros\/ros.h>\n\n#include <math.h>\n#include <stdint.h>\n#include <stdbool.h>\n\n#include <cv_bridge\/cv_bridge.h>\n#include <image_transport\/image_transport.h>\n#include <nav_msgs\/GetMap.h>\n#include <nav_msgs\/OccupancyGrid.h>\n#include <opencv2\/highgui\/highgui.hpp>\n#include <quirkd\/Alert.h>\n#include <sensor_msgs\/LaserScan.h>\n#include <sensor_msgs\/image_encodings.h>\n#include <tf\/transform_listener.h>\n#include <tf\/transform_datatypes.h>\n\nclass ImageTester {\n    public:\n        ImageTester() \n            : it_(n_)\n        {\n            static_image_pub_ = it_.advertise(\"\/quirkd\/test\/static_image\", 1);\n            dynamic_image_pub_ = it_.advertise(\"\/quirkd\/test\/dynamic_image\", 1);\n            heatmap_pub_ = it_.advertise(\"\/quirkd\/test\/heatmap\", 1);\n        }\n        void preprocessImages(cv::Mat* static_image, cv::Mat* dynamic_image) {\n            cv::Mat blurryStatic;\n            cv::Mat blurryDynamic;\n            cv::blur(*static_image, blurryStatic, cv::Size(5, 5));\n            cv::blur(*dynamic_image, blurryDynamic, cv::Size(5, 5));\n            \/\/ *static_image = blurryStatic;\n            \/\/ *dynamic_image = blurryDynamic;\n        }\n        int quantifyDifference(cv::Mat* static_processed, cv::Mat* dynamic_processed) {\n            \/\/ src = static_processed\n\n            cv::imshow(\"source\", *static_processed);\n            cv::Mat dst, cdst;\n            cv::Canny(*static_processed, dst, 50, 200, 3); \/\/ TODO check these parameters\n            cv::imshow(\"dst after Canny\", dst);\n            cv::cvtColor(dst, cdst, CV_GRAY2BGR);\n            std::vector<cv::Vec4i> lines;\n            cv::HoughLinesP(dst, lines, 1, CV_PI\/180, 50, 50, 10); \/\/ TODO check these parameters\n            for( size_t i = 0; i < lines.size(); i++ ) {\n                cv::Vec4i l = lines[i];\n                cv::line( cdst, cv::Point(l[0], l[1]), cv::Point(l[2], l[3]), cv::Scalar(0,0,255), 3, CV_AA);\n            }\n            cv::imshow(\"detected lines\", cdst);\n            cv::waitKey(0);\n\n            \/\/ OLD VERSION\n            cv::Mat absdiff;\n            cv::absdiff(*static_processed, *dynamic_processed, absdiff);\n            cv::convertScaleAbs(absdiff, absdiff, 2.55, 0.0);\n            \n            \/\/ use absdiff as a mask to visualize difference with \"heatmap\" (bgr)\n            cv::Mat redBase(static_processed->rows, static_processed->cols, CV_8UC3, cv::Scalar(0, 0, 255));\n            cv::Mat byChannel[3];\n            cv::split(redBase, byChannel);\n            byChannel[2] = absdiff;\n            cv::merge(byChannel, 3, redBase);\n\n            cv_bridge::CvImage heatmap;\n            heatmap.encoding = sensor_msgs::image_encodings::BGR8;\n            heatmap.image = redBase;\n            ROS_INFO(\"publish heatmap\");\n            heatmap_pub_.publish(heatmap.toImageMsg());\n            cv::imshow(\"Absdiff\", absdiff);\n\n            \/\/ return sum of the absdiff\n            return cv::sum(absdiff)[0];\n        }\n        int measureDifference(cv_bridge::CvImage static_image, cv_bridge::CvImage dynamic_image) {\n            \/\/ two images (static (base) image and dynamic image)\n            \/\/ perimeter encoded as part of the alert and images aligned to alert perimeter\n\n            \/* Compute difference\n             * Steps:\n             * - manhattan distance\n             *\/\n\n            \/\/ Manhattan Distance\n            this->preprocessImages(&(static_image.image), &(dynamic_image.image));\n            cv::imshow(\"Static Map\", static_image.image);\n            cv::imshow(\"Dynamic Map\", dynamic_image.image);\n            int result = this->quantifyDifference(&(static_image.image), &(dynamic_image.image));\n            cv::waitKey(0);\n            return result;\n        }\n    private:\n        ros::NodeHandle n_;\n        image_transport::ImageTransport it_;\n        image_transport::Publisher static_image_pub_;\n        image_transport::Publisher dynamic_image_pub_;\n        image_transport::Publisher heatmap_pub_;\n};\n\nint main(int argc, char** argv) {\n    ros::init(argc, argv, \"ImageTester\");\n    ImageTester it;\n    cv_bridge::CvImage image1;\n    cv_bridge::CvImage image2;\n    image1.image = cv::imread(\"images\/filterInProgress\/static001.png\", cv::IMREAD_GRAYSCALE);\n    image2.image = cv::imread(\"images\/filterInProgress\/dynamic001.png\", cv::IMREAD_GRAYSCALE);\n    int result = it.measureDifference(image1, image2);\n    ROS_INFO(\"ImageTester Exited. Image diff of %d\", result);\n    return 0;\n}\n<commit_msg>Edge detection seems to work nicely. Now I need to pair edges<commit_after>#include <ros\/ros.h>\n\n#include <math.h>\n#include <stdint.h>\n#include <stdbool.h>\n#include <sstream>\n\n#include <cv_bridge\/cv_bridge.h>\n#include <image_transport\/image_transport.h>\n#include <nav_msgs\/GetMap.h>\n#include <nav_msgs\/OccupancyGrid.h>\n#include <opencv2\/highgui\/highgui.hpp>\n#include <quirkd\/Alert.h>\n#include <sensor_msgs\/LaserScan.h>\n#include <sensor_msgs\/image_encodings.h>\n#include <tf\/transform_listener.h>\n#include <tf\/transform_datatypes.h>\n\nclass ImageTester {\n    public:\n        ImageTester() \n            : it_(n_)\n        {\n            static_image_pub_ = it_.advertise(\"\/quirkd\/test\/static_image\", 1);\n            dynamic_image_pub_ = it_.advertise(\"\/quirkd\/test\/dynamic_image\", 1);\n            heatmap_pub_ = it_.advertise(\"\/quirkd\/test\/heatmap\", 1);\n        }\n        void preprocessImages(cv::Mat* static_image, cv::Mat* dynamic_image) {\n            cv::Mat blurryStatic;\n            cv::Mat blurryDynamic;\n            cv::blur(*static_image, blurryStatic, cv::Size(5, 5));\n            cv::blur(*dynamic_image, blurryDynamic, cv::Size(5, 5));\n            \/\/ *static_image = blurryStatic;\n            \/\/ *dynamic_image = blurryDynamic;\n        }\n        int quantifyDifference(cv::Mat* static_processed, cv::Mat* dynamic_processed) {\n            \/\/ src = static_processed\n\n            ROS_INFO(\"src size %d x %d\", (*static_processed).cols, (*static_processed).rows);\n            \/\/ cv::imshow(\"source\", *static_processed);\n            cv::Mat static_edges, dynamic_edges, static_cdst, dynamic_cdst;\n            cv::Canny(*static_processed, static_edges, 50, 200, 3); \/\/ TODO check these parameters\n            cv::Canny(*dynamic_processed, dynamic_edges, 50, 200, 3);\n\n            cv::imshow(\"static_edges after Canny\", static_edges);\n            cv::imshow(\"dynamic_edges after Canny\", dynamic_edges);\n\n            cv::cvtColor(static_edges, static_cdst, CV_GRAY2BGR);\n            cv::cvtColor(dynamic_edges, dynamic_cdst, CV_GRAY2BGR);\n            \n            \/\/ Hough Parameters\n            std::vector<cv::Vec4i> static_lines, dynamic_lines;\n            const int radius_resolution = 1;\n            const double theta_resolution = CV_PI\/180 \/ 4;\n            const int min_line_length = 8;\n            const int threshold = min_line_length; \/\/ number of interesections to make a line\n            const int max_line_gap = min_line_length - 2; \/\/ largest gap (in pixels) considered on the same line\n            std::string stitle = \"detected lines \";\n\n            cv::HoughLinesP(static_edges, static_lines, radius_resolution, theta_resolution, threshold, min_line_length, max_line_gap);\n            for( size_t i = 0; i < static_lines.size(); i++ ) {\n                cv::Vec4i l = static_lines[i];\n                cv::line( static_cdst, cv::Point(l[0], l[1]), cv::Point(l[2], l[3]), cv::Scalar(0,0,255), 3, CV_AA);\n            }\n            cv::HoughLinesP(dynamic_edges, dynamic_lines, radius_resolution, theta_resolution, threshold, min_line_length, max_line_gap);\n            for( size_t i = 0; i < dynamic_lines.size(); i++ ) {\n                cv::Vec4i l = dynamic_lines[i];\n                cv::line( dynamic_cdst, cv::Point(l[0], l[1]), cv::Point(l[2], l[3]), cv::Scalar(0,0,255), 3, CV_AA);\n            }\n            std::ostringstream title;\n            title << stitle << min_line_length;\n            cv::imshow(\"static detected\", static_cdst);\n            cv::imshow(\"dynamic detected\", dynamic_cdst);\n            \n\n            \/\/ OLD VERSION\n            cv::Mat absdiff;\n            cv::absdiff(*static_processed, *dynamic_processed, absdiff);\n            cv::convertScaleAbs(absdiff, absdiff, 2.55, 0.0);\n            \n            \/\/ use absdiff as a mask to visualize difference with \"heatmap\" (bgr)\n            cv::Mat redBase(static_processed->rows, static_processed->cols, CV_8UC3, cv::Scalar(0, 0, 255));\n            cv::Mat byChannel[3];\n            cv::split(redBase, byChannel);\n            byChannel[2] = absdiff;\n            cv::merge(byChannel, 3, redBase);\n\n            cv_bridge::CvImage heatmap;\n            heatmap.encoding = sensor_msgs::image_encodings::BGR8;\n            heatmap.image = redBase;\n            ROS_INFO(\"publish heatmap\");\n            heatmap_pub_.publish(heatmap.toImageMsg());\n            \/\/ cv::imshow(\"Absdiff\", absdiff);\n\n            \/\/ return sum of the absdiff\n            return cv::sum(absdiff)[0];\n        }\n        int measureDifference(cv_bridge::CvImage static_image, cv_bridge::CvImage dynamic_image) {\n            ROS_INFO(\"static map original size %d x %d\", static_image.image.cols, static_image.image.rows);\n            this->preprocessImages(&(static_image.image), &(dynamic_image.image));\n            ROS_INFO(\"static map size %d x %d\", static_image.image.cols, static_image.image.rows);\n            cv::imshow(\"Static Map\", static_image.image);\n            ROS_INFO(\"dynamic map size %d x %d\", dynamic_image.image.cols, dynamic_image.image.rows);\n            cv::imshow(\"Dynamic Map\", dynamic_image.image);\n            int result = this->quantifyDifference(&(static_image.image), &(dynamic_image.image));\n            cv::waitKey(0);\n            return result;\n        }\n    private:\n        ros::NodeHandle n_;\n        image_transport::ImageTransport it_;\n        image_transport::Publisher static_image_pub_;\n        image_transport::Publisher dynamic_image_pub_;\n        image_transport::Publisher heatmap_pub_;\n};\n\nint main(int argc, char** argv) {\n    ros::init(argc, argv, \"ImageTester\");\n    ImageTester it;\n    cv_bridge::CvImage image1;\n    cv_bridge::CvImage image2;\n    image1.image = cv::imread(\"images\/filterInProgress\/static001.png\", cv::IMREAD_GRAYSCALE);\n    ROS_INFO(\"imread1 size %d x %d\", image1.image.cols, image1.image.rows);\n    image2.image = cv::imread(\"images\/filterInProgress\/dynamic001.png\", cv::IMREAD_GRAYSCALE);\n    \n    if (!(image1.image.cols > 0 && image1.image.rows > 0 && image2.image.cols > 0 && image2.image.rows > 0)) {\n        ROS_ERROR(\"Did not properly load images\");\n        return 1;\n    }\n\n    int result = it.measureDifference(image1, image2);\n\n    ROS_INFO(\"ImageTester Exited. Image diff of %d\", result);\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"IndexParser.h\"\n#include \"RegExpIndexer.h\"\n#include \"FieldIndexer.h\"\n#include \"ExternalIndexer.h\"\n#include <iostream>\n#include <fstream>\n#include <stdexcept>\n\nvoid IndexParser::buildIndexes(Index::Builder *builder, ConsoleLog& log) {\n    std::ifstream in(fileName_, std::ifstream::in);\n    std::string contents((std::istreambuf_iterator<char>(in)),\n                         std::istreambuf_iterator<char>());\n    cJSON * root = cJSON_Parse(contents.c_str());\n    if(root == nullptr) {\n        throw std::runtime_error(\"Could not parse the json config file. \"\n                                         \"Careful, this is a strict parser.\");\n    }\n    if (!cJSON_HasObjectItem(root, \"indexes\")) {\n        throw std::runtime_error(\"No indexes to be found in the config file.\");\n    }\n    cJSON* indexes = cJSON_GetObjectItem(root,\"indexes\");\n    auto arraySize = cJSON_GetArraySize(indexes);\n    for (int i =0; i < arraySize; i++) {\n        parseIndex(cJSON_GetArrayItem(indexes, i), builder, log);\n    }\n}\n\nvoid IndexParser::parseIndex(cJSON *index, Index::Builder *builder, ConsoleLog& log) {\n    if (!cJSON_HasObjectItem(index, \"type\")) {\n        throw std::runtime_error(\"All indexes must have a type field, i.e. Regex, Field, \");\n    }\n    std::string indexName = \"default\";\n    if (cJSON_HasObjectItem(index, \"name\")) {\n        indexName = cJSON_GetObjectItem(index, \"name\")->valuestring;\n    }\n    std::string type = cJSON_GetObjectItem(index, \"type\")->valuestring;\n    Index::IndexConfig config{};\n    config.numeric = cJSON_GetObjectItem(index, \"numeric\") && strcmp(\"true\", cJSON_GetObjectItem(index, \"numeric\")->string);\n    config.unique = cJSON_GetObjectItem(index, \"unique\") && strcmp(\"true\", cJSON_GetObjectItem(index, \"unique\")->string);\n    config.sparse = cJSON_GetObjectItem(index, \"sparse\") && strcmp(\"true\", cJSON_GetObjectItem(index, \"sparse\")->string);\n    config.indexLineOffsets = cJSON_GetObjectItem(index, \"indexLineOffsets\") && strcmp(\"true\", cJSON_GetObjectItem(index, \"indexLineOffsets\")->string);\n\n    if (type == \"regex\") {\n        std::string regex = cJSON_GetObjectItem(index, \"regex\")->valuestring;\n        if (cJSON_HasObjectItem(index, \"capture\")) {\n            uint capture = cJSON_GetObjectItem(index, \"capture\")->valueint;\n            builder->addIndexer(indexName, regex, config,\n                               std::unique_ptr<LineIndexer>(new RegExpIndexer(regex, capture)));\n        } else {\n            builder->addIndexer(indexName, regex, config,\n                               std::unique_ptr<LineIndexer>(new RegExpIndexer(regex)));\n        }\n    } else if (type == \"field\") {\n        std::string delimiter = cJSON_GetObjectItem(index, \"delimiter\")->valuestring;\n        uint fieldNum = cJSON_GetObjectItem(index, \"fieldNum\")->valueint;\n        std::ostringstream name;\n        name << \"Field \" << fieldNum << \" delimited by '\"\n            << delimiter << \"'\";\n        builder->addIndexer(indexName, name.str(), config,\n                           std::unique_ptr<LineIndexer>(new FieldIndexer(delimiter, fieldNum)));\n    } else if (type == \"pipe\") {\n        std::string pipeCommand = cJSON_GetObjectItem(index, \"command\")->valuestring;\n        std::string delimiter = cJSON_GetObjectItem(index, \"delimiter\")->valuestring;\n\n        builder->addIndexer(indexName, pipeCommand, config, std::move(\n                        std::unique_ptr<LineIndexer>(new ExternalIndexer(log,\n                                            pipeCommand, delimiter))));\n    } else {\n        throw std::runtime_error(\"unknown index \" + type);\n    }\n}\n<commit_msg>Add a TODO for later<commit_after>#include \"IndexParser.h\"\n#include \"RegExpIndexer.h\"\n#include \"FieldIndexer.h\"\n#include \"ExternalIndexer.h\"\n#include <iostream>\n#include <fstream>\n#include <stdexcept>\n\nvoid IndexParser::buildIndexes(Index::Builder *builder, ConsoleLog& log) {\n    std::ifstream in(fileName_, std::ifstream::in);\n    std::string contents((std::istreambuf_iterator<char>(in)),\n                         std::istreambuf_iterator<char>());\n    cJSON * root = cJSON_Parse(contents.c_str());\n    if(root == nullptr) {\n        throw std::runtime_error(\"Could not parse the json config file. \"\n                                         \"Careful, this is a strict parser.\");\n    }\n    if (!cJSON_HasObjectItem(root, \"indexes\")) {\n        throw std::runtime_error(\"No indexes to be found in the config file.\");\n    }\n    cJSON* indexes = cJSON_GetObjectItem(root,\"indexes\");\n    auto arraySize = cJSON_GetArraySize(indexes);\n    for (int i =0; i < arraySize; i++) {\n        parseIndex(cJSON_GetArrayItem(indexes, i), builder, log);\n    }\n}\n\nvoid IndexParser::parseIndex(cJSON *index, Index::Builder *builder, ConsoleLog& log) {\n    if (!cJSON_HasObjectItem(index, \"type\")) {\n        throw std::runtime_error(\"All indexes must have a type field, i.e. Regex, Field, \");\n    }\n    std::string indexName = \"default\";\n    if (cJSON_HasObjectItem(index, \"name\")) {\n        indexName = cJSON_GetObjectItem(index, \"name\")->valuestring;\n    }\n    std::string type = cJSON_GetObjectItem(index, \"type\")->valuestring;\n    Index::IndexConfig config{};\n    config.numeric = cJSON_GetObjectItem(index, \"numeric\") && strcmp(\"true\", cJSON_GetObjectItem(index, \"numeric\")->string);\n    config.unique = cJSON_GetObjectItem(index, \"unique\") && strcmp(\"true\", cJSON_GetObjectItem(index, \"unique\")->string);\n    config.sparse = cJSON_GetObjectItem(index, \"sparse\") && strcmp(\"true\", cJSON_GetObjectItem(index, \"sparse\")->string);\n    config.indexLineOffsets = cJSON_GetObjectItem(index, \"indexLineOffsets\") && strcmp(\"true\", cJSON_GetObjectItem(index, \"indexLineOffsets\")->string);\n\n    \/\/ TODO: if anything is missing here we segfault\n    if (type == \"regex\") {\n        std::string regex = cJSON_GetObjectItem(index, \"regex\")->valuestring;\n        if (cJSON_HasObjectItem(index, \"capture\")) {\n            uint capture = cJSON_GetObjectItem(index, \"capture\")->valueint;\n            builder->addIndexer(indexName, regex, config,\n                               std::unique_ptr<LineIndexer>(new RegExpIndexer(regex, capture)));\n        } else {\n            builder->addIndexer(indexName, regex, config,\n                               std::unique_ptr<LineIndexer>(new RegExpIndexer(regex)));\n        }\n    } else if (type == \"field\") {\n        std::string delimiter = cJSON_GetObjectItem(index, \"delimiter\")->valuestring;\n        uint fieldNum = cJSON_GetObjectItem(index, \"fieldNum\")->valueint;\n        std::ostringstream name;\n        name << \"Field \" << fieldNum << \" delimited by '\"\n            << delimiter << \"'\";\n        builder->addIndexer(indexName, name.str(), config,\n                           std::unique_ptr<LineIndexer>(new FieldIndexer(delimiter, fieldNum)));\n    } else if (type == \"pipe\") {\n        std::string pipeCommand = cJSON_GetObjectItem(index, \"command\")->valuestring;\n        std::string delimiter = cJSON_GetObjectItem(index, \"delimiter\")->valuestring;\n\n        builder->addIndexer(indexName, pipeCommand, config, std::move(\n                        std::unique_ptr<LineIndexer>(new ExternalIndexer(log,\n                                            pipeCommand, delimiter))));\n    } else {\n        throw std::runtime_error(\"unknown index \" + type);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"CameraBase.h\"\n#include \"sys\/SysControl.h\"\n#include \"HMDWrapper.h\"\n#include \"Engine.h\"\n#include \"Game.h\"\n\nusing namespace MathLib;\n\n\n#ifdef MEMORY_INFO\n#define new new(__FILE__, __LINE__) \n#endif \/\/ MEMORY_INFO\n\n#define CAMERA_BASE_CLAMP            89.9f\n\n\nCCameraBase::CCameraBase(): CPlayer(PLAYER_SPECTATOR) \n{\n\tm_nFlush = 0;\n    m_vPosition = Vec3_zero;\n    m_fPhiAngle = 0.0f;\n    m_fThetaAngle = 0.0f;\n    m_pLastPlayer = NULL;\n\tm_nEnabelMouse = 1;\n    SetRadius(1.0f);\n\n\tSetMinThetaAngle(-90.0f);\n    SetMaxThetaAngle(90.0f);\n    SetTurning(90.0f);\n\t\n    SetViewDirection(vec3(0.0f,1.0f,0.0f));\n\n    SetEnabled(0);\n    SetHMDEnabled(1);\n}\n\nCCameraBase::~CCameraBase()\n{\n    Leave();\n}\n\nvoid CCameraBase::SetEnabled(int nEnable)\n{\n\tif(nEnable)\n\t{\n\t\tm_pLastPlayer =  g_Engine.pGame->GetPlayer();\n        CPlayer::SetEnabled(nEnable);\n\t\tg_Engine.pGame->SetPlayer(this);\n\n\t}\n\telse\n\t{\n\t\tif (m_pLastPlayer)\n        {\n            g_Engine.pGame->SetPlayer(m_pLastPlayer);\n            CPlayer::SetEnabled(nEnable);\n        }\n\t}\n}\n\n\nint CCameraBase::IsEnabled() const\n{\n    return CPlayer::IsEnabled();\n}\nvoid CCameraBase::SetHMDEnabled(int nEnable)\n{\n    m_nHMDEnable = nEnable;\n}\n\nint CCameraBase::IsHMDEnabled() const\n{\n    return m_nHMDEnable;\n}\n\nvoid CCameraBase::SetRadius(float r)\n{\n    m_fRadius = r;\n}\n\nfloat CCameraBase::GetRadius() const\n{\n    return m_fRadius;\n}\n\/******************************************************************************\\\n*\n* Parameters\n*\n\\******************************************************************************\/\n\n\/*\n *\/\nvoid CCameraBase::Update_Bounds() \n{\n    m_BoundSphere.Set(vec3_zero,m_fRadius);\n    m_BoundBox.Set(m_BoundSphere);\n    Update_World_Position();\n}\n\nvoid CCameraBase::SetMinThetaAngle(float angle)\n{\n    m_fMinThetaAngle = Clamp(angle,-CAMERA_BASE_CLAMP,CAMERA_BASE_CLAMP);\n}\n\nfloat CCameraBase::GetMinThetaAngle() const\n{\n    return m_fMinThetaAngle;\n}\n\n\/*\n*\/\nvoid CCameraBase::SetMaxThetaAngle(float angle)\n{\n\tm_fMaxThetaAngle = Clamp(angle, -CAMERA_BASE_CLAMP, CAMERA_BASE_CLAMP);\n}\nfloat CCameraBase::GetMaxThetaAngle() const\n{\n\treturn m_fMaxThetaAngle;\n}\nfloat CCameraBase::GetTurning() const\n{\n\treturn m_fTurning;\n}\nvoid CCameraBase::SetPhiAngle(float angle)\n{\n\tangle = angle - m_fPhiAngle;\n\tm_vDirection = quat(m_vUp, angle) * m_vDirection;\n\tm_fPhiAngle += angle;\n\n\tFlushTransform();\n}\n\n\nfloat CCameraBase::GetPhiAngle() const\n{\n\treturn m_fPhiAngle;\n}\n\nvoid CCameraBase::SetThetaAngle(float angle)\t\t\n{\n\tangle = Clamp(angle, m_fMinThetaAngle, m_fMaxThetaAngle) - m_fThetaAngle;\t\n\tm_vDirection = quat(Cross(m_vUp, m_vDirection), angle) * m_vDirection;\n\tm_fThetaAngle += angle;\n\n\n\tFlushTransform();\n}\n\n\nfloat CCameraBase::GetThetaAngle() const\n{\n\treturn m_fThetaAngle;\n}\n\n\/*\n*\n*\/\n\nvoid CCameraBase::SetViewDirection(const vec3 &d)\n{\n\tm_vDirection = Normalize(d);\n\n\t\/\/ ortho basis\n\tvec3 tangent, binormal;\n\tOrthoBasis(m_vUp, tangent, binormal);\n\n\t\/\/ decompose direction\n\tm_fPhiAngle = CMathCore::ATan2(Dot(m_vDirection, tangent), Dot(m_vDirection, binormal)) * RAD2DEG;\n\tm_fThetaAngle = CMathCore::ACos(Clamp(Dot(m_vDirection, m_vUp), -1.0f, 1.0f)) * RAD2DEG - 90.0f;\n\tm_fThetaAngle = Clamp(m_fThetaAngle, m_fMinThetaAngle, m_fMaxThetaAngle);\n\n\n\n\tFlushTransform();\n}\nconst vec3 &CCameraBase::GetViewDirection() const\n{\n\treturn m_vDirection;\n}\n\nvoid CCameraBase::UpdateControls(float ifps)\n{\n\tif (g_pHMD->GetUseHMD() && m_nHMDEnable)\n\t{\n\t\tUpdate_HMD(ifps);\n\t}\n\telse\n\t{\n\t\tUpdate_Controls(ifps);\n\t}\n}\n\n<commit_msg>Signed-off-by: mrlitong <litongtongxue@gmail.com><commit_after>#include \"CameraBase.h\"\n#include \"sys\/SysControl.h\"\n#include \"HMDWrapper.h\"\n#include \"Engine.h\"\n#include \"Game.h\"\n\nusing namespace MathLib;\n\n\n#ifdef MEMORY_INFO\n#define new new(__FILE__, __LINE__) \n#endif \/\/ MEMORY_INFO\n\n#define CAMERA_BASE_CLAMP            89.9f\n\n\nCCameraBase::CCameraBase(): CPlayer(PLAYER_SPECTATOR) \n{\n\tm_nFlush = 0;\n    m_vPosition = Vec3_zero;\n    m_fPhiAngle = 0.0f;\n    m_fThetaAngle = 0.0f;\n    m_pLastPlayer = NULL;\n\tm_nEnabelMouse = 1;\n    SetRadius(1.0f);\n\n\tSetMinThetaAngle(-90.0f);\n    SetMaxThetaAngle(90.0f);\n    SetTurning(90.0f);\n\t\n    SetViewDirection(vec3(0.0f,1.0f,0.0f));\n\n    SetEnabled(0);\n    SetHMDEnabled(1);\n}\n\nCCameraBase::~CCameraBase()\n{\n    Leave();\n}\n\nvoid CCameraBase::SetEnabled(int nEnable)\n{\n\tif(nEnable)\n\t{\n\t\tm_pLastPlayer =  g_Engine.pGame->GetPlayer();\n        CPlayer::SetEnabled(nEnable);\n\t\tg_Engine.pGame->SetPlayer(this);\n\n\t}\n\telse\n\t{\n\t\tif (m_pLastPlayer)\n        {\n            g_Engine.pGame->SetPlayer(m_pLastPlayer);\n            CPlayer::SetEnabled(nEnable);\n        }\n\t}\n}\n\n\nint CCameraBase::IsEnabled() const\n{\n    return CPlayer::IsEnabled();\n}\nvoid CCameraBase::SetHMDEnabled(int nEnable)\n{\n    m_nHMDEnable = nEnable;\n}\n\nint CCameraBase::IsHMDEnabled() const\n{\n    return m_nHMDEnable;\n}\n\nvoid CCameraBase::SetRadius(float r)\n{\n    m_fRadius = r;\n}\n\nfloat CCameraBase::GetRadius() const\n{\n    return m_fRadius;\n}\n\/******************************************************************************\\\n*\n* Parameters\n*\n\\******************************************************************************\/\n\n\/*\n *\/\nvoid CCameraBase::Update_Bounds() \n{\n    m_BoundSphere.Set(vec3_zero,m_fRadius);\n    m_BoundBox.Set(m_BoundSphere);\n    Update_World_Position();\n}\n\nvoid CCameraBase::SetMinThetaAngle(float angle)\n{\n    m_fMinThetaAngle = Clamp(angle,-CAMERA_BASE_CLAMP,CAMERA_BASE_CLAMP);\n}\n\nfloat CCameraBase::GetMinThetaAngle() const\n{\n    return m_fMinThetaAngle;\n}\n\n\/*\n*\/\nvoid CCameraBase::SetMaxThetaAngle(float angle)\n{\n\tm_fMaxThetaAngle = Clamp(angle, -CAMERA_BASE_CLAMP, CAMERA_BASE_CLAMP);\n}\nfloat CCameraBase::GetMaxThetaAngle() const\n{\n\treturn m_fMaxThetaAngle;\n}\nfloat CCameraBase::GetTurning() const\n{\n\treturn m_fTurning;\n}\nvoid CCameraBase::SetPhiAngle(float angle)\n{\n\tangle = angle - m_fPhiAngle;\n\tm_vDirection = quat(m_vUp, angle) * m_vDirection;\n\tm_fPhiAngle += angle;\n\n\tFlushTransform();\n}\n\n\nfloat CCameraBase::GetPhiAngle() const\n{\n\treturn m_fPhiAngle;\n}\n\nvoid CCameraBase::SetThetaAngle(float angle)\t\t\n{\n\tangle = Clamp(angle, m_fMinThetaAngle, m_fMaxThetaAngle) - m_fThetaAngle;\t\n\tm_vDirection = quat(Cross(m_vUp, m_vDirection), angle) * m_vDirection;\n\tm_fThetaAngle += angle;\n\n\n\tFlushTransform();\n}\n\n\nfloat CCameraBase::GetThetaAngle() const\n{\n\treturn m_fThetaAngle;\n}\n\n\/*\n*\n*\/\n\nvoid CCameraBase::SetViewDirection(const vec3 &d)\n{\n\tm_vDirection = Normalize(d);\n\n\t\/\/ ortho basis\n\tvec3 tangent, binormal;\n\tOrthoBasis(m_vUp, tangent, binormal);\n\n\t\/\/ decompose direction\n\tm_fPhiAngle = CMathCore::ATan2(Dot(m_vDirection, tangent), Dot(m_vDirection, binormal)) * RAD2DEG;\n\tm_fThetaAngle = CMathCore::ACos(Clamp(Dot(m_vDirection, m_vUp), -1.0f, 1.0f)) * RAD2DEG - 90.0f;\n\tm_fThetaAngle = Clamp(m_fThetaAngle, m_fMinThetaAngle, m_fMaxThetaAngle);\n\n\n\n\tFlushTransform();\n}\nconst vec3 &CCameraBase::GetViewDirection() const\n{\n\treturn m_vDirection;\n}\n\nvoid CCameraBase::UpdateControls(float ifps)\n{\n\tif (g_pHMD->GetUseHMD() && m_nHMDEnable)\n\t{\n\t\tUpdate_HMD(ifps);\n\t}\n\telse\n\t{\n\t\tUpdate_Controls(ifps);\n\t}\n}\n\n\n\/******************************************************************************\\\n*\n* Flush\n*\n\\******************************************************************************\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2010 - 2013 Leap Motion. All rights reserved. Proprietary and confidential.\n#include \"stdafx.h\"\n#include \"CoreThread.h\"\n#include \"CoreContext.h\"\n#include <boost\/thread.hpp>\n\nCoreThread::CoreThread(const char* pName):\n  ContextMember(pName),\n  m_stop(false),\n  m_ready(false),\n  m_running(false),\n  m_completed(false),\n  m_canAccept(false)\n{\n}\n\nvoid CoreThread::DoRun(std::shared_ptr<Object> && outstanding) {\n  ASSERT(m_running);\n\n  \/\/ Make our own session current before we do anything else:\n  CurrentContextPusher pusher(GetContext());\n\n  \/\/ Set the thread name no matter what:\n  if(GetName())\n    SetCurrentThreadName();\n\n  \/\/ Now we wait for the thread to be good to go:\n  DelayUntilReady();\n  try {\n    Run();\n  } catch(dispatch_aborted_exception&) {\n    \/\/ Okay, this is fine, a dispatcher is terminating--this is a normal way to\n    \/\/ end a dispatcher loop.\n  } catch(...) {\n    try {\n      \/\/ Ask that the enclosing context filter this exception, if possible:\n      GetContext()->FilterException();\n    } catch(...) {\n      \/\/ Generic exception, unhandled, we can't print anything off.\n      CoreContext::DebugPrintCurrentExceptionInformation();\n    }\n\n    \/\/ Signal shutdown on the enclosing context\n    GetContext()->SignalShutdown();\n  }\n\n  \/\/ Unconditionally shut off dispatch delivery:\n  RejectDispatchDelivery();\n  \n  \/\/ Perform a manual notification of teardown listeners\n  NotifyTeardownListeners();\n\n  {\n    \/\/ Notify everyone that we're completed:\n    boost::lock_guard<boost::mutex> lk(m_lock);\n    m_stop = true;\n    m_completed = true;\n    m_running = false;\n  \n    \/\/ Notify other other threads that we are done\n    m_stateCondition.notify_all();\n  \n    \/\/ Pop the CurrentContextPusher so the reference to this context is destroyed.\n    pusher.Pop();\n  \n    \/\/ Reset reference from closure so context is destroyed\n    outstanding.reset();\n  }\n\n  \/\/ No longer running, we MUST release the thread pointer to ensure proper teardown\n  m_thisThread.detach();\n}\n\nbool CoreThread::ShouldStop(void) const {\n  shared_ptr<CoreContext> context = ContextMember::GetContext();\n  return m_stop || !context || context->ShouldStop();\n}\n\nvoid CoreThread::ThreadSleep(long millisecond) {\n  boost::this_thread::sleep(boost::posix_time::milliseconds(millisecond));\n}\n\nbool CoreThread::DelayUntilCanAccept(void) {\n  boost::unique_lock<boost::mutex> lk(m_lock);\n  m_stateCondition.wait(lk, [this] {return ShouldStop() || CanAccept();});\n  return !ShouldStop();\n}\n\nbool CoreThread::Start(std::shared_ptr<Object> outstanding) {\n  std::shared_ptr<CoreContext> context = m_context.lock();\n  if(!context)\n    return false;\n\n  {\n    boost::lock_guard<boost::mutex> lk(m_lock);\n    if(m_running)\n      \/\/ Already running, short-circuit\n      return true;\n\n    \/\/ Currently running:\n    m_running = true;\n    m_stateCondition.notify_all();\n  }\n\n  \/\/ Kick off a thread and return here\n  m_thisThread = boost::thread(\n    [this, outstanding] () mutable {\n      this->DoRun(std::move(outstanding));\n    }\n  );\n  return true;\n}\n\nvoid CoreThread::Run() {\n  AcceptDispatchDelivery();\n  while(!ShouldStop())\n    WaitForEvent();\n\n  \/\/ If we are asked to rundown while we still have elements in our dispatch queue,\n  \/\/ we must try to process them:\n  DispatchAllEvents();\n}\n<commit_msg>Teardown listener notification must occur while the lock is being held<commit_after>\/\/ Copyright (c) 2010 - 2013 Leap Motion. All rights reserved. Proprietary and confidential.\n#include \"stdafx.h\"\n#include \"CoreThread.h\"\n#include \"CoreContext.h\"\n#include <boost\/thread.hpp>\n\nCoreThread::CoreThread(const char* pName):\n  ContextMember(pName),\n  m_stop(false),\n  m_ready(false),\n  m_running(false),\n  m_completed(false),\n  m_canAccept(false)\n{\n}\n\nvoid CoreThread::DoRun(std::shared_ptr<Object> && outstanding) {\n  ASSERT(m_running);\n\n  \/\/ Make our own session current before we do anything else:\n  CurrentContextPusher pusher(GetContext());\n\n  \/\/ Set the thread name no matter what:\n  if(GetName())\n    SetCurrentThreadName();\n\n  \/\/ Now we wait for the thread to be good to go:\n  DelayUntilReady();\n  try {\n    Run();\n  } catch(dispatch_aborted_exception&) {\n    \/\/ Okay, this is fine, a dispatcher is terminating--this is a normal way to\n    \/\/ end a dispatcher loop.\n  } catch(...) {\n    try {\n      \/\/ Ask that the enclosing context filter this exception, if possible:\n      GetContext()->FilterException();\n    } catch(...) {\n      \/\/ Generic exception, unhandled, we can't print anything off.\n      CoreContext::DebugPrintCurrentExceptionInformation();\n    }\n\n    \/\/ Signal shutdown on the enclosing context\n    GetContext()->SignalShutdown();\n  }\n\n  \/\/ Unconditionally shut off dispatch delivery:\n  RejectDispatchDelivery();\n\n  {\n    \/\/ Notify everyone that we're completed:\n    boost::lock_guard<boost::mutex> lk(m_lock);\n    m_stop = true;\n    m_completed = true;\n    m_running = false;\n\n    \/\/ Notify other other threads that we are done\n    m_stateCondition.notify_all();\n\n    \/\/ Perform a manual notification of teardown listeners\n    NotifyTeardownListeners();\n\n    \/\/ Pop the CurrentContextPusher so the reference to this context is destroyed.\n    pusher.Pop();\n\n    \/\/ Reset reference from closure so context is destroyed\n    outstanding.reset();\n  }\n\n  \/\/ No longer running, we MUST release the thread pointer to ensure proper teardown\n  m_thisThread.detach();\n}\n\nbool CoreThread::ShouldStop(void) const {\n  shared_ptr<CoreContext> context = ContextMember::GetContext();\n  return m_stop || !context || context->ShouldStop();\n}\n\nvoid CoreThread::ThreadSleep(long millisecond) {\n  boost::this_thread::sleep(boost::posix_time::milliseconds(millisecond));\n}\n\nbool CoreThread::DelayUntilCanAccept(void) {\n  boost::unique_lock<boost::mutex> lk(m_lock);\n  m_stateCondition.wait(lk, [this] {return ShouldStop() || CanAccept();});\n  return !ShouldStop();\n}\n\nbool CoreThread::Start(std::shared_ptr<Object> outstanding) {\n  std::shared_ptr<CoreContext> context = m_context.lock();\n  if(!context)\n    return false;\n\n  {\n    boost::lock_guard<boost::mutex> lk(m_lock);\n    if(m_running)\n      \/\/ Already running, short-circuit\n      return true;\n\n    \/\/ Currently running:\n    m_running = true;\n    m_stateCondition.notify_all();\n  }\n\n  \/\/ Kick off a thread and return here\n  m_thisThread = boost::thread(\n    [this, outstanding] () mutable {\n      this->DoRun(std::move(outstanding));\n    }\n  );\n  return true;\n}\n\nvoid CoreThread::Run() {\n  AcceptDispatchDelivery();\n  while(!ShouldStop())\n    WaitForEvent();\n\n  \/\/ If we are asked to rundown while we still have elements in our dispatch queue,\n  \/\/ we must try to process them:\n  DispatchAllEvents();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"opencv2\/core\/core.hpp\"\n#include \"opencv2\/imgproc\/imgproc.hpp\"\n#include \"opencv2\/highgui\/highgui.hpp\"\n#include \"opencv2\/contrib\/contrib.hpp\"\n#include <math.h>\n#include <iostream>\nusing namespace cv;\nusing namespace std;\n\nint* meshgrid_x(int width);\nint* meshgrid_y(int height);\n\nint main(int argc, char ** argv)\n{\n    if( argc < 2 ){\n        cout << \"usage: ColorTie imagepath k deltaZ epsilon\" << endl;\n        return 0;\n    }\n    int k, delta_z, epsilon;\n    const char* filename = argv[1];\n    if(argc == 5){\n        k = strtol(argv[2], NULL, 10);\n        delta_z = strtol(argv[3], NULL, 10);\n        epsilon = strtol(argv[4], NULL, 10);\n    } else {\n        k = 10;\n        delta_z = 1000;\n        epsilon = 100;\n    }\n    cout << k << endl;\n    cout << delta_z << endl;\n    cout << epsilon << endl;\n    Mat I = imread(filename, CV_LOAD_IMAGE_COLOR);\n    if(I.empty())\n        return -1;\n    vector<Mat> rgb;\n    split(I, rgb);\n    \n    Mat red, green, blue;\n    rgb[0].convertTo(blue, CV_64F);\n    rgb[1].convertTo(green, CV_64F);\n    rgb[2].convertTo(red, CV_64F);\n    \n    double offset = 10;\n    \n    Mat G = (k\/(green + offset)).mul((blue - red)*(1.0\/delta_z)); \n     \n    Mat padded;                            \/\/expand input image to optimal size\n    int m = getOptimalDFTSize( G.rows );\n    int n = getOptimalDFTSize( G.cols ); \/\/ on the border add zero values\n    copyMakeBorder(G, padded, 0, m - G.rows, 0, n - G.cols, BORDER_CONSTANT, Scalar::all(0));\n\n    Mat planes[] = {Mat_<double>(padded), Mat::zeros(padded.size(), CV_64F)};\n    Mat complexG;\n    merge(planes, 2, complexG);         \/\/ Add to the expanded another plane with zeros\n\n    dft(complexG, complexG);            \/\/ this way the result may fit in the source matrix\n\n    \/\/ compute the magnitude and switch to logarithmic scale\n    \/\/ => log(1 + sqrt(Re(DFT(I))^2 + Im(DFT(I))^2))\n    split(complexG, planes);                   \/\/ planes[0] = Re(DFT(I), planes[1] = Im(DFT(I))\n    \n    int * mesh_x = meshgrid_x(planes[0].cols);\n    int * mesh_y = meshgrid_y(planes[0].rows);\n    double pi_squared = pow(M_PI, 2);\n\n    for(int y = 0; y < planes[0].rows; y++){\n        for(int x = 0; x < planes[0].cols; x++){\n            double denom = -4*pi_squared*(pow(mesh_x[x], 2) + pow(mesh_y[y], 2)) + epsilon;\n            planes[0].at<double>(y,x) \/= denom;\n            planes[1].at<double>(y,x) \/= denom;\n        }\n    }\n\n    merge(planes, 2, complexG);\n    Mat result;\n    dft(complexG, result, DFT_INVERSE|DFT_REAL_OUTPUT); \n    \n    normalize(result, result, 0, 1, CV_MINMAX);\n    imshow(\"original image\"       , I);    \/\/ Show the result\n    imshow(\"qualitative phase image\", result); \n    waitKey();\n\n    return 0;\n}\n\nint* meshgrid_x(int width){\n    int * mesh_x = new int[width];\n    for(int i = 0; i < width; i++){\n        if(i <= (width-1)\/2){\n            mesh_x[i] = i;\n        } else {\n            mesh_x[i] = i - width;\n        }\n    }\n    return mesh_x; \n}\n\nint* meshgrid_y(int height){\n    int * mesh_y = new int[height];\n    for(int i = 0; i < height; i++){\n        if(i <= (height-1)\/2){\n            mesh_y[i] = -1*i;\n        } else {\n            mesh_y[i] = height - i;\n        }\n    }\n    return mesh_y; \n}\n<commit_msg>write to file instead of displaying<commit_after>#include \"opencv2\/core\/core.hpp\"\n#include \"opencv2\/imgproc\/imgproc.hpp\"\n#include \"opencv2\/highgui\/highgui.hpp\"\n#include \"opencv2\/contrib\/contrib.hpp\"\n#include <math.h>\n#include <iostream>\nusing namespace cv;\nusing namespace std;\n\nint* meshgrid_x(int width);\nint* meshgrid_y(int height);\n\nint main(int argc, char ** argv)\n{\n    if( argc < 2 ){\n        cout << \"usage: ColorTie imagepath k deltaZ epsilon outputpath\" << endl;\n        return 0;\n    }\n    double k, delta_z, epsilon;\n    const char* filename = argv[1];\n    if(argc == 6){\n        k = strtol(argv[2], NULL, 10);\n        delta_z = strtol(argv[3], NULL, 10);\n        epsilon = strtol(argv[4], NULL, 10);\n    } else {\n        k = 10;\n        delta_z = 1000;\n        epsilon = 100;\n    }\n    Mat I = imread(filename, CV_LOAD_IMAGE_COLOR);\n    if(I.empty())\n        return -1;\n    vector<Mat> rgb;\n    split(I, rgb);\n    \n    Mat red, green, blue;\n    rgb[0].convertTo(blue, CV_64F);\n    rgb[1].convertTo(green, CV_64F);\n    rgb[2].convertTo(red, CV_64F);\n    \n    double offset = 10;\n    \n    Mat G = (k\/(green + offset)).mul((blue - red)*(1.0\/delta_z)); \n     \n    Mat padded;                            \/\/expand input image to optimal size\n    int m = getOptimalDFTSize( G.rows );\n    int n = getOptimalDFTSize( G.cols ); \/\/ on the border add zero values\n    copyMakeBorder(G, padded, 0, m - G.rows, 0, n - G.cols, BORDER_CONSTANT, Scalar::all(0));\n\n    Mat planes[] = {Mat_<double>(padded), Mat::zeros(padded.size(), CV_64F)};\n    Mat complexG;\n    merge(planes, 2, complexG);         \/\/ Add to the expanded another plane with zeros\n\n    dft(complexG, complexG);            \/\/ this way the result may fit in the source matrix\n\n    \/\/ compute the magnitude and switch to logarithmic scale\n    \/\/ => log(1 + sqrt(Re(DFT(I))^2 + Im(DFT(I))^2))\n    split(complexG, planes);                   \/\/ planes[0] = Re(DFT(I), planes[1] = Im(DFT(I))\n    \n    int * mesh_x = meshgrid_x(planes[0].cols);\n    int * mesh_y = meshgrid_y(planes[0].rows);\n    double pi_squared = pow(M_PI, 2);\n\n    for(int y = 0; y < planes[0].rows; y++){\n        for(int x = 0; x < planes[0].cols; x++){\n            double denom = -4*pi_squared*(pow(mesh_x[x], 2) + pow(mesh_y[y], 2)) + epsilon;\n            planes[0].at<double>(y,x) \/= denom;\n            planes[1].at<double>(y,x) \/= denom;\n        }\n    }\n\n    merge(planes, 2, complexG);\n    Mat result;\n    dft(complexG, result, DFT_INVERSE|DFT_REAL_OUTPUT); \n    \n    string result_path = \"results\/\";\n    result_path.append(argv[5]);\n    normalize(result, result, 0, 1, CV_MINMAX);\n    \/\/result.convertTo(result, CV_32F);\n    \/\/imshow(\"original image\"       , I);    \/\/ Show the result\n    \/\/imshow(\"qualitative phase image\", result); \n    result.convertTo(result, CV_8U, 255.0);\n    imwrite(result_path, result);\n\n    return 0;\n}\n\nint* meshgrid_x(int width){\n    int * mesh_x = new int[width];\n    for(int i = 0; i < width; i++){\n        if(i <= (width-1)\/2){\n            mesh_x[i] = i;\n        } else {\n            mesh_x[i] = i - width;\n        }\n    }\n    return mesh_x; \n}\n\nint* meshgrid_y(int height){\n    int * mesh_y = new int[height];\n    for(int i = 0; i < height; i++){\n        if(i <= (height-1)\/2){\n            mesh_y[i] = -1*i;\n        } else {\n            mesh_y[i] = height - i;\n        }\n    }\n    return mesh_y; \n}\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        assert(nread == UV_EOF);\n      }\n    });\n    if (r != 0) \/\/ stdout pipe error.\n      return r;\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        assert(nread == UV_EOF);\n      }\n    });\n    if (r != 0) \/\/ stderr pipe error.\n      return r;\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>bug fix. kill the child when pipe error raised<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\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        assert(nread == UV_EOF);\n      }\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        assert(nread == UV_EOF);\n      }\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>\/**************************************************************************\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 \"TParticle.h\"\n#include \"TVirtualMC.h\"\n\n\/\/ --- Standard library ---\n\n\/\/ --- AliRoot header files ---\n#include \"AliEMCALv1.h\"\n#include \"AliEMCALHit.h\"\n#include \"AliEMCALGeometry.h\"\n#include \"AliRun.h\"\n#include \"AliMC.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->GetMCApp()->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->GetMCApp()->GetCurrentTrackNumber();\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->GetMCApp()->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->GetMCApp()->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 a bug in StepManager when calculating the if from layer #<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 \"TParticle.h\"\n#include \"TVirtualMC.h\"\n\n\/\/ --- Standard library ---\n\n\/\/ --- AliRoot header files ---\n#include \"AliEMCALv1.h\"\n#include \"AliEMCALHit.h\"\n#include \"AliEMCALGeometry.h\"\n#include \"AliRun.h\"\n#include \"AliMC.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->GetMCApp()->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 tower\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->GetMCApp()->GetCurrentTrackNumber();\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->GetMCApp()->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() + geom->GetNPRLayers() )\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->GetMCApp()->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>\/**************************************************************\n * ESP8266WiFiSetup is a library for the ESP8266\/Arduino platform\n * to easily setup wifi credentials.\n * inspired by: AlexT https:\/\/github.com\/tzapu\n * Built by Peter Kristensen\n * Licensed under MIT license\n **************************************************************\/\n\n#include \"ESP8266WiFiSetup.h\"\n\nESP8266WiFiSetup::ESP8266WiFiSetup() : server(80) {\n}\n\nboolean ESP8266WiFiSetup::begin() {\n  String ssid = \"ESP\" + String(ESP.getChipId());\n  return begin(ssid.c_str());\n}\nboolean ESP8266WiFiSetup::begin(const char *ssid) {\n  return begin(ssid, \"\");\n}\n\nboolean ESP8266WiFiSetup::begin(const char *ssid, const char *pass) {\n  DEBUG_PRINT(\"\");\n  DEBUG_PRINT(\"AutoConnect\");\n\n  if(WiFi.SSID().equals(\"\")){\n    DEBUG_PRINT(\"No previously known wifi network. Setting up as AP...\");\n  }else{\n    DEBUG_PRINT(\"Connecting to\");\n    DEBUG_PRINT(WiFi.SSID());\n\n    WiFi.mode(WIFI_STA);\n    WiFi.begin(WiFi.SSID().c_str(), WiFi.psk().c_str());\n    if(WiFi.waitForConnectResult() == WL_CONNECTED){\n      DEBUG_PRINT(\"Success.\");\n      DEBUG_PRINT(\"IP Address:\");\n      DEBUG_PRINT(WiFi.localIP());\n      \/\/connected\n      return true;\n    }else{\n      DEBUG_PRINT(\"Failed. Setting up as AP...\");\n    }\n  }\n\n  WiFi.mode(WIFI_AP);\n  tryToConnect = false;\n  setupAP(ssid, pass);\n  while(timeout == 0 || millis() < start + timeout) {\n    if(tryToConnect) {\n      \/\/delay(2000);\n      DEBUG_PRINT(\"Connecting to: \");\n      DEBUG_PRINT(_ssid);\n\n      WiFi.begin(_ssid.c_str(), _pass.c_str());\n      if(WiFi.waitForConnectResult() == WL_CONNECTED){\n        DEBUG_PRINT(\"Success.\");\n        DEBUG_PRINT(\"IP Address:\");\n        DEBUG_PRINT(WiFi.localIP());\n        WiFi.mode(WIFI_STA);\n        return true;\n      }else{\n        DEBUG_PRINT(\"Failed. Setting up as AP...\");\n        tryToConnect = false;\n      }\n    }\n    dnsServer.processNextRequest();\n    server.handleClient();\n    delay(1);\n  }\n  return  WiFi.status() == WL_CONNECTED;\n}\n\nvoid ESP8266WiFiSetup::setupAP(const char *ssid, const char *pass) {\n\n  DEBUG_PRINT(\"\");\n  start = millis();\n\n  DEBUG_PRINT(\"Configuring access point... \");\n  DEBUG_PRINT(ssid);\n  \/\/optional soft ip config\n  if (_ip) {\n    DEBUG_PRINT(\"Custom IP\/GW\/Subnet\");\n    WiFi.softAPConfig(_ip, _gw, _sn);\n  }\n\n  if(strcmp(pass,\"\") == 0){\n    DEBUG_PRINT(\"No password\");\n    WiFi.softAP(ssid);\n  }else{\n    DEBUG_PRINT(\"Password protected\");\n    WiFi.softAP(ssid, pass);\n  }\n  delay(500); \/\/ Without delay I've seen the IP address blank\n  DEBUG_PRINT(\"AP IP address: \");\n  DEBUG_PRINT(WiFi.softAPIP());\n\n  \/* Setup the DNS server redirecting all the domains to the apIP *\/\n  dnsServer.setErrorReplyCode(DNSReplyCode::NoError);\n  dnsServer.start(DNS_PORT, \"*\", WiFi.softAPIP());\n\n  \/* Setup web pages: root, wifi config pages, SO captive portal detectors and not found. *\/\n  server.on(\"\/\", std::bind(&ESP8266WiFiSetup::handleRoot, this));\n  server.on(\"\/getNetworks\", std::bind(&ESP8266WiFiSetup::handleGetNetworks, this));\n  server.on(\"\/connect\", std::bind(&ESP8266WiFiSetup::handleConnect, this));\n  server.on(\"\/generate_204\", std::bind(&ESP8266WiFiSetup::handle204, this));  \/\/Android\/Chrome OS captive portal check.\n  server.on(\"\/fwlink\", std::bind(&ESP8266WiFiSetup::handleRoot, this));  \/\/Microsoft captive portal. Maybe not needed. Might be handled by notFound handler.\n  server.onNotFound (std::bind(&ESP8266WiFiSetup::handleNotFound, this));\n  server.begin(); \/\/ Web server start\n  DEBUG_PRINT(\"HTTP server started\");\n}\n\nvoid ESP8266WiFiSetup::clearSettings() {\n  DEBUG_PRINT(\"Settings invalidated\");\n  WiFi.disconnect();\n  delay(200);\n}\n\nvoid ESP8266WiFiSetup::setTimeout(unsigned long seconds) {\n  timeout = seconds * 1000;\n}\n\nvoid ESP8266WiFiSetup::setDebugOutput(boolean debug) {\n  _debug = debug;\n}\n\nvoid ESP8266WiFiSetup::setAPConfig(IPAddress ip, IPAddress gw, IPAddress sn) {\n  _ip = ip;\n  _gw = gw;\n  _sn = sn;\n}\n\n\/** Handle root or redirect to captive portal *\/\nvoid ESP8266WiFiSetup::handleRoot() {\n  DEBUG_PRINT(\"Handle root\");\n  if (captivePortal()) { \/\/ If caprive portal redirect instead of displaying the page.\n    return;\n  }\n  server.sendHeader(\"Cache-Control\", \"no-cache, no-store, must-revalidate\");\n  server.sendHeader(\"Pragma\", \"no-cache\");\n  server.sendHeader(\"Expires\", \"-1\");\n  server.send_P(200, \"text\/html\", WIFI_SETUP_HTML);\n}\n\nvoid ESP8266WiFiSetup::handleGetNetworks() {\n  DEBUG_PRINT(\"Handle getNetworks\");\n  server.sendHeader(\"Cache-Control\", \"no-cache, no-store, must-revalidate\");\n  server.sendHeader(\"Pragma\", \"no-cache\");\n  server.sendHeader(\"Expires\", \"-1\");\n  server.send(200, \"text\/json\", getWifiNetworks()); \/\/ Empty content inhibits Content-length header so we have to close the socket ourselves.\n}\n\nString ESP8266WiFiSetup::getWifiNetworks(){\n  DEBUG_PRINT(\"Scanning for networks\");\n  int n = WiFi.scanNetworks();\n  if (n == 0) {\n    DEBUG_PRINT(\"No networks found\");\n  }else{\n    String networks = \"[\";\n    for (uint8_t i = 0; i < n; ++i){\n      DEBUG_PRINT(WiFi.SSID(i));\n      String enc = WiFi.encryptionType(i) == ENC_TYPE_NONE ? \"false\":\"true\";\n      if(i == n-1){ \/\/Don't add the last comma\n        networks += \"{\\\"ssid\\\":\\\"\" + WiFi.SSID(i) + \"\\\",\\\"rssi\\\":\\\"\" + WiFi.RSSI(i) + \"\\\",\\\"encrypted\\\":\" + enc + \"}\";\n      }else{\n        networks += \"{\\\"ssid\\\":\\\"\" + WiFi.SSID(i) + \"\\\",\\\"rssi\\\":\\\"\" + WiFi.RSSI(i) + \"\\\",\\\"encrypted\\\":\" + enc + \"},\";\n      }\n      yield();\n    }\n    networks += \"]\";\n    return networks;\n  }\n\n}\n\n\/** Handle the WLAN save form and redirect to WLAN config page again *\/\nvoid ESP8266WiFiSetup::handleConnect() {\n  DEBUG_PRINT(\"handleConnect\");\n  _ssid = urldecode(server.arg(\"s\").c_str());\n  _pass = urldecode(server.arg(\"p\").c_str());\n\n  server.sendHeader(\"Cache-Control\", \"no-cache, no-store, must-revalidate\");\n  server.sendHeader(\"Pragma\", \"no-cache\");\n  server.sendHeader(\"Expires\", \"-1\");\n  server.send(200, \"text\/json\", \"{\\\"response\\\":\\\"ok\\\"}\");\n\n  tryToConnect = true; \/\/signal ready to connect\/reset\n}\n\nvoid ESP8266WiFiSetup::handle204() {\n  DEBUG_PRINT(\"204 No Response\");\n  server.sendHeader(\"Cache-Control\", \"no-cache, no-store, must-revalidate\");\n  server.sendHeader(\"Pragma\", \"no-cache\");\n  server.sendHeader(\"Expires\", \"-1\");\n  server.send ( 204, \"text\/plain\", \"\");\n  server.client().stop();\n}\n\nvoid ESP8266WiFiSetup::handleNotFound() {\n  if (captivePortal()) { \/\/ If captive portal redirect instead of displaying the error page.\n    return;\n  }\n  server.sendHeader(\"Cache-Control\", \"no-cache, no-store, must-revalidate\");\n  server.sendHeader(\"Pragma\", \"no-cache\");\n  server.sendHeader(\"Expires\", \"-1\");\n  server.send(404, \"text\/plain\", \"NOT FOUND\");\n}\n\n\n\/** Redirect to captive portal if we got a request for another domain. Return true in that case so the page handler do not try to handle the request again. *\/\nboolean ESP8266WiFiSetup::captivePortal() {\n  if (!isIp(server.hostHeader()) ) {\n    DEBUG_PRINT(\"Request redirected to captive portal\");\n    server.sendHeader(\"Location\", String(\"http:\/\/\") + WiFi.softAPIP().toString(), true);\n    server.send ( 302, \"text\/plain\", \"\"); \/\/ Empty content inhibits Content-length header so we have to close the socket ourselves.\n    server.client().stop(); \/\/ Stop is needed because we sent no content length\n    return true;\n  }\n  return false;\n}\n\n\ntemplate <typename Generic>\nvoid ESP8266WiFiSetup::DEBUG_PRINT(Generic text) {\n  if(_debug) {\n    Serial.print(\"*WS: \");\n    Serial.println(text);\n  }\n}\n\n\/** Is this an IP? *\/\nboolean ESP8266WiFiSetup::isIp(String str) {\n  for (int i = 0; i < str.length(); i++) {\n    int c = str.charAt(i);\n    if (c != '.' && (c < '0' || c > '9')) {\n      return false;\n    }\n  }\n  return true;\n}\n\nString ESP8266WiFiSetup::urldecode(const char *src){\n  String decoded = \"\";\n  char a, b;\n  while (*src) {\n    if ((*src == '%') &&\n        ((a = src[1]) && (b = src[2])) &&\n        (isxdigit(a) && isxdigit(b))) {\n      if (a >= 'a')\n        a -= 'a' - 'A';\n      if (a >= 'A')\n        a -= ('A' - 10);\n      else\n        a -= '0';\n      if (b >= 'a')\n        b -= 'a' - 'A';\n      if (b >= 'A')\n        b -= ('A' - 10);\n      else\n        b -= '0';\n\n      decoded += char(16 * a + b);\n      src += 3;\n    } else if (*src == '+') {\n      decoded += ' ';\n      *src++;\n    } else {\n      decoded += *src;\n      *src++;\n    }\n  }\n  decoded += '\\0';\n\n  return decoded;\n}\n<commit_msg>Remvoed send_P again. hmm<commit_after>\/**************************************************************\n * ESP8266WiFiSetup is a library for the ESP8266\/Arduino platform\n * to easily setup wifi credentials.\n * inspired by: AlexT https:\/\/github.com\/tzapu\n * Built by Peter Kristensen\n * Licensed under MIT license\n **************************************************************\/\n\n#include \"ESP8266WiFiSetup.h\"\n\nESP8266WiFiSetup::ESP8266WiFiSetup() : server(80) {\n}\n\nboolean ESP8266WiFiSetup::begin() {\n  String ssid = \"ESP\" + String(ESP.getChipId());\n  return begin(ssid.c_str());\n}\nboolean ESP8266WiFiSetup::begin(const char *ssid) {\n  return begin(ssid, \"\");\n}\n\nboolean ESP8266WiFiSetup::begin(const char *ssid, const char *pass) {\n  DEBUG_PRINT(\"\");\n  DEBUG_PRINT(\"AutoConnect\");\n\n  if(WiFi.SSID().equals(\"\")){\n    DEBUG_PRINT(\"No previously known wifi network. Setting up as AP...\");\n  }else{\n    DEBUG_PRINT(\"Connecting to\");\n    DEBUG_PRINT(WiFi.SSID());\n\n    WiFi.mode(WIFI_STA);\n    WiFi.begin(WiFi.SSID().c_str(), WiFi.psk().c_str());\n    if(WiFi.waitForConnectResult() == WL_CONNECTED){\n      DEBUG_PRINT(\"Success.\");\n      DEBUG_PRINT(\"IP Address:\");\n      DEBUG_PRINT(WiFi.localIP());\n      \/\/connected\n      return true;\n    }else{\n      DEBUG_PRINT(\"Failed. Setting up as AP...\");\n    }\n  }\n\n  WiFi.mode(WIFI_AP);\n  tryToConnect = false;\n  setupAP(ssid, pass);\n  while(timeout == 0 || millis() < start + timeout) {\n    if(tryToConnect) {\n      \/\/delay(2000);\n      DEBUG_PRINT(\"Connecting to: \");\n      DEBUG_PRINT(_ssid);\n\n      WiFi.begin(_ssid.c_str(), _pass.c_str());\n      if(WiFi.waitForConnectResult() == WL_CONNECTED){\n        DEBUG_PRINT(\"Success.\");\n        DEBUG_PRINT(\"IP Address:\");\n        DEBUG_PRINT(WiFi.localIP());\n        WiFi.mode(WIFI_STA);\n        return true;\n      }else{\n        DEBUG_PRINT(\"Failed. Setting up as AP...\");\n        tryToConnect = false;\n      }\n    }\n    dnsServer.processNextRequest();\n    server.handleClient();\n    delay(1);\n  }\n  return  WiFi.status() == WL_CONNECTED;\n}\n\nvoid ESP8266WiFiSetup::setupAP(const char *ssid, const char *pass) {\n\n  DEBUG_PRINT(\"\");\n  start = millis();\n\n  DEBUG_PRINT(\"Configuring access point... \");\n  DEBUG_PRINT(ssid);\n  \/\/optional soft ip config\n  if (_ip) {\n    DEBUG_PRINT(\"Custom IP\/GW\/Subnet\");\n    WiFi.softAPConfig(_ip, _gw, _sn);\n  }\n\n  if(strcmp(pass,\"\") == 0){\n    DEBUG_PRINT(\"No password\");\n    WiFi.softAP(ssid);\n  }else{\n    DEBUG_PRINT(\"Password protected\");\n    WiFi.softAP(ssid, pass);\n  }\n  delay(500); \/\/ Without delay I've seen the IP address blank\n  DEBUG_PRINT(\"AP IP address: \");\n  DEBUG_PRINT(WiFi.softAPIP());\n\n  \/* Setup the DNS server redirecting all the domains to the apIP *\/\n  dnsServer.setErrorReplyCode(DNSReplyCode::NoError);\n  dnsServer.start(DNS_PORT, \"*\", WiFi.softAPIP());\n\n  \/* Setup web pages: root, wifi config pages, SO captive portal detectors and not found. *\/\n  server.on(\"\/\", std::bind(&ESP8266WiFiSetup::handleRoot, this));\n  server.on(\"\/getNetworks\", std::bind(&ESP8266WiFiSetup::handleGetNetworks, this));\n  server.on(\"\/connect\", std::bind(&ESP8266WiFiSetup::handleConnect, this));\n  server.on(\"\/generate_204\", std::bind(&ESP8266WiFiSetup::handle204, this));  \/\/Android\/Chrome OS captive portal check.\n  server.on(\"\/fwlink\", std::bind(&ESP8266WiFiSetup::handleRoot, this));  \/\/Microsoft captive portal. Maybe not needed. Might be handled by notFound handler.\n  server.onNotFound (std::bind(&ESP8266WiFiSetup::handleNotFound, this));\n  server.begin(); \/\/ Web server start\n  DEBUG_PRINT(\"HTTP server started\");\n}\n\nvoid ESP8266WiFiSetup::clearSettings() {\n  DEBUG_PRINT(\"Settings invalidated\");\n  WiFi.disconnect();\n  delay(200);\n}\n\nvoid ESP8266WiFiSetup::setTimeout(unsigned long seconds) {\n  timeout = seconds * 1000;\n}\n\nvoid ESP8266WiFiSetup::setDebugOutput(boolean debug) {\n  _debug = debug;\n}\n\nvoid ESP8266WiFiSetup::setAPConfig(IPAddress ip, IPAddress gw, IPAddress sn) {\n  _ip = ip;\n  _gw = gw;\n  _sn = sn;\n}\n\n\/** Handle root or redirect to captive portal *\/\nvoid ESP8266WiFiSetup::handleRoot() {\n  DEBUG_PRINT(\"Handle root\");\n  if (captivePortal()) { \/\/ If caprive portal redirect instead of displaying the page.\n    return;\n  }\n  server.sendHeader(\"Cache-Control\", \"no-cache, no-store, must-revalidate\");\n  server.sendHeader(\"Pragma\", \"no-cache\");\n  server.sendHeader(\"Expires\", \"-1\");\n  server.send(200, \"text\/html\", WIFI_SETUP_HTML);\n}\n\nvoid ESP8266WiFiSetup::handleGetNetworks() {\n  DEBUG_PRINT(\"Handle getNetworks\");\n  server.sendHeader(\"Cache-Control\", \"no-cache, no-store, must-revalidate\");\n  server.sendHeader(\"Pragma\", \"no-cache\");\n  server.sendHeader(\"Expires\", \"-1\");\n  server.send(200, \"text\/json\", getWifiNetworks()); \/\/ Empty content inhibits Content-length header so we have to close the socket ourselves.\n}\n\nString ESP8266WiFiSetup::getWifiNetworks(){\n  DEBUG_PRINT(\"Scanning for networks\");\n  int n = WiFi.scanNetworks();\n  if (n == 0) {\n    DEBUG_PRINT(\"No networks found\");\n  }else{\n    String networks = \"[\";\n    for (uint8_t i = 0; i < n; ++i){\n      DEBUG_PRINT(WiFi.SSID(i));\n      String enc = WiFi.encryptionType(i) == ENC_TYPE_NONE ? \"false\":\"true\";\n      if(i == n-1){ \/\/Don't add the last comma\n        networks += \"{\\\"ssid\\\":\\\"\" + WiFi.SSID(i) + \"\\\",\\\"rssi\\\":\\\"\" + WiFi.RSSI(i) + \"\\\",\\\"encrypted\\\":\" + enc + \"}\";\n      }else{\n        networks += \"{\\\"ssid\\\":\\\"\" + WiFi.SSID(i) + \"\\\",\\\"rssi\\\":\\\"\" + WiFi.RSSI(i) + \"\\\",\\\"encrypted\\\":\" + enc + \"},\";\n      }\n      yield();\n    }\n    networks += \"]\";\n    return networks;\n  }\n\n}\n\n\/** Handle the WLAN save form and redirect to WLAN config page again *\/\nvoid ESP8266WiFiSetup::handleConnect() {\n  DEBUG_PRINT(\"handleConnect\");\n  _ssid = urldecode(server.arg(\"s\").c_str());\n  _pass = urldecode(server.arg(\"p\").c_str());\n\n  server.sendHeader(\"Cache-Control\", \"no-cache, no-store, must-revalidate\");\n  server.sendHeader(\"Pragma\", \"no-cache\");\n  server.sendHeader(\"Expires\", \"-1\");\n  server.send(200, \"text\/json\", \"{\\\"response\\\":\\\"ok\\\"}\");\n\n  tryToConnect = true; \/\/signal ready to connect\/reset\n}\n\nvoid ESP8266WiFiSetup::handle204() {\n  DEBUG_PRINT(\"204 No Response\");\n  server.sendHeader(\"Cache-Control\", \"no-cache, no-store, must-revalidate\");\n  server.sendHeader(\"Pragma\", \"no-cache\");\n  server.sendHeader(\"Expires\", \"-1\");\n  server.send ( 204, \"text\/plain\", \"\");\n  server.client().stop();\n}\n\nvoid ESP8266WiFiSetup::handleNotFound() {\n  if (captivePortal()) { \/\/ If captive portal redirect instead of displaying the error page.\n    return;\n  }\n  server.sendHeader(\"Cache-Control\", \"no-cache, no-store, must-revalidate\");\n  server.sendHeader(\"Pragma\", \"no-cache\");\n  server.sendHeader(\"Expires\", \"-1\");\n  server.send(404, \"text\/plain\", \"NOT FOUND\");\n}\n\n\n\/** Redirect to captive portal if we got a request for another domain. Return true in that case so the page handler do not try to handle the request again. *\/\nboolean ESP8266WiFiSetup::captivePortal() {\n  if (!isIp(server.hostHeader()) ) {\n    DEBUG_PRINT(\"Request redirected to captive portal\");\n    server.sendHeader(\"Location\", String(\"http:\/\/\") + WiFi.softAPIP().toString(), true);\n    server.send ( 302, \"text\/plain\", \"\"); \/\/ Empty content inhibits Content-length header so we have to close the socket ourselves.\n    server.client().stop(); \/\/ Stop is needed because we sent no content length\n    return true;\n  }\n  return false;\n}\n\n\ntemplate <typename Generic>\nvoid ESP8266WiFiSetup::DEBUG_PRINT(Generic text) {\n  if(_debug) {\n    Serial.print(\"*WS: \");\n    Serial.println(text);\n  }\n}\n\n\/** Is this an IP? *\/\nboolean ESP8266WiFiSetup::isIp(String str) {\n  for (int i = 0; i < str.length(); i++) {\n    int c = str.charAt(i);\n    if (c != '.' && (c < '0' || c > '9')) {\n      return false;\n    }\n  }\n  return true;\n}\n\nString ESP8266WiFiSetup::urldecode(const char *src){\n  String decoded = \"\";\n  char a, b;\n  while (*src) {\n    if ((*src == '%') &&\n        ((a = src[1]) && (b = src[2])) &&\n        (isxdigit(a) && isxdigit(b))) {\n      if (a >= 'a')\n        a -= 'a' - 'A';\n      if (a >= 'A')\n        a -= ('A' - 10);\n      else\n        a -= '0';\n      if (b >= 'a')\n        b -= 'a' - 'A';\n      if (b >= 'A')\n        b -= ('A' - 10);\n      else\n        b -= '0';\n\n      decoded += char(16 * a + b);\n      src += 3;\n    } else if (*src == '+') {\n      decoded += ' ';\n      *src++;\n    } else {\n      decoded += *src;\n      *src++;\n    }\n  }\n  decoded += '\\0';\n\n  return decoded;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/#ifndef __CINT__\n#include \"iostream\"\n#include \"fstream\"\n#include \"TFile.h\"\n#include \"TTree.h\"\n#include \"TChain.h\"\n#include \"TBranch.h\"\n#include \"TF1.h\"\n#include \"TH1F.h\"\n#include \"TProfile.h\"\n#include \"TMath.h\"\n#include <math.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n\/\/#endif\nusing namespace std;\n\n\/* modify for # of front end Boards *\/\nconst Int_t numBoardsInFile   =  3;\n\/************************************\/\nconst Int_t numChannelsPerBoard= 30;\nconst Int_t numChipsOnBoard =    5;\nconst Int_t psecSampleCells =    256;\n\nvoid ConvertACDCdata(char *filein, char *fileout, bool applyGainCorrection=true){ \n  \/\/char filein[200] = \"test.txt\";\n  \/\/char fileout[200] = \"test.root\";\n  \/\/bool applyGainCorrection=true;\n     \n  float*** VoltageLUT;\n  VoltageLUT = new float**[numChannelsPerBoard*numBoardsInFile];\n  for(int j=0; j<numBoardsInFile; j++){\n    for(int chan=0; chan<numChannelsPerBoard; chan++){\n      VoltageLUT[chan+j*numChannelsPerBoard] = new float*[psecSampleCells];\n      for(int samp=0; samp<psecSampleCells; samp++) VoltageLUT[chan+j*numChannelsPerBoard][samp] = new float[4096];\n    }\n  }\n  if( applyGainCorrection){\n    TFile *Flut = new TFile(\"calibrations\/LUT.root\");\n    TTree *T_lut = (TTree*)Flut->Get(\"Tlut\");\n    \/\/T_lut->Print();\n    int entry;\n    \n    float Voltage[numChannelsPerBoard*numBoardsInFile][psecSampleCells]; \n        \/\/int ADC[4096];\n    \/\/int numBoardsinLUTFile = 0;\n    \/\/T_lut->SetBranchAddress(\"numBoardsforLUT\", numBoardsinLUTFile);\n    TBranch* Entrylut  = T_lut->GetBranch(\"count\"); \n    TBranch* Vlut  = T_lut->GetBranch(\"Voltage\"); \n    \/\/TBranch* ADlut  = T_lut->GetBranch(\"ADC\"); \n    \n    Entrylut->SetAddress( &entry);\n    Vlut->SetAddress( &Voltage);\n    \/\/ADlut->SetAddress( &ADC);\n    \n    for(int i=0; i< T_lut->GetEntries(); i++){\n      T_lut->GetEntry(i);\n      \/\/cout << i << endl;\n      for(int j=0; j<numBoardsInFile; j++){\n\tfor(int chan=0; chan<numChannelsPerBoard; chan++){\n\t  for(int samp=0; samp<psecSampleCells; samp++){\n\t    VoltageLUT[chan+j*numChannelsPerBoard][samp][i]=\n\t      Voltage[chan+j*numChannelsPerBoard][samp];\n\t  }\n\t}\n      }\n    }\n\n    T_lut->Delete();\n    Flut->Delete();\n  }\n  \n  TFile *f = new TFile(fileout, \"RECREATE\");\n\n  int nSample = psecSampleCells;\n  int sample[psecSampleCells], unwrap_sample[psecSampleCells];\n  int nCell = 0, event = 0;\n  float Data[numBoardsInFile*numChannelsPerBoard][psecSampleCells];\n  int Pedestals[numBoardsInFile*numChannelsPerBoard][psecSampleCells];\n  float metaData[numBoardsInFile][psecSampleCells];\n  char data_leaf[200], meta_data_leaf[200];\n  sprintf(data_leaf, \"Data[%i][256]\/F\",numBoardsInFile*numChannelsPerBoard); \n  sprintf(meta_data_leaf, \"metaData[%i][256]\/F\",numBoardsInFile);  \n  \n  TTree *T = new TTree(\"T\", \"T\");\n  T->Branch(\"event\", &event, \"event\/I\");\n  T->Branch(\"sample\", sample, \"sample[256]\/I\");\n  T->Branch(\"unwrap_sample\", unwrap_sample, \"unwrap_sample[256]\/I\");\n  T->Branch(\"Data\", &Data, data_leaf);\n  T->Branch(\"metaData\", &metaData, meta_data_leaf);\n\n  \/* open data .txt file *\/\n  ifstream ifs;\n  ifs.open(filein, ios::in);\n  if(!ifs) cout << \"error opening *.txt file\" << endl;\n  \n  int data_tmp=0, dummy=0;\n  float wfm_temp=0., ped_temp=0.;\n  \/* go through data file *\/\n  while(ifs){\n    \/* read pedestal values (first 'dummy event') *\/\n    if(event==0){\n      ifs >> sample[nCell] >> dummy;\n      for(int j=0; j<numBoardsInFile; j++){\n\tfor(int i=0; i<numChannelsPerBoard+1; i++){\n\t  if(i==numChannelsPerBoard) ifs >> dummy;\n\t  else ifs >> Pedestals[i+j*numChannelsPerBoard][nCell];\n\t} \n      }\t\t\t       \n    }\n    else{\n    \/* read real data line-by-line *\/\n      ifs >> sample[nCell] >> unwrap_sample[nCell];\n    \n      for(int j=0; j<numBoardsInFile; j++){\n\tfor(int i=0; i<numChannelsPerBoard+1; i++){\n\t  if(i==numChannelsPerBoard) ifs >> metaData[j][nCell];\n\t  else{\n\t    \n\t    ifs >> data_tmp;\n\n\t    \/* data saved in Volts... *\/\n\t    if( applyGainCorrection){\n\t      \/* look up waveform voltage *\/\n\t      \/\/cout << VoltageLUT[i+j*numChannelsPerBoard][nCell][2];\n\t      wfm_temp = VoltageLUT[i+j*numChannelsPerBoard][nCell][data_tmp];\n\t      \/* look up pedestal voltage *\/\n\t      ped_temp = VoltageLUT[i+j*numChannelsPerBoard][nCell][Pedestals[i+j*numChannelsPerBoard][nCell]];\n\t      \/* subtract the two *\/\n\t      Data[i+j*numChannelsPerBoard][nCell]= wfm_temp-ped_temp;\n\t    }\n\t    \/* OR, data saved in ADC counts *\/\n\t    else Data[i+j*numChannelsPerBoard][nCell]=data_tmp-Pedestals[i+j*numChannelsPerBoard][nCell];\n\t    \n\t  }\n\t}\n      }\n    }\n    \/\/cout << nCell << \":\" << sample[nCell] << \":\" << event << endl;\n    nCell++;\n  \n    if(nCell==nSample){\n      T->Fill();\n      event++;\n      nCell = 0;\n    }\n  }\n\n  cout << \"converted \" << event-1 << \" events\" << endl;\n  T->Write();\n  f->Close();\n  ifs.close();\n  return;\n}\t\t\t\t  \n\n<commit_msg>analysis<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Convert AC\/DC board data into .root format. Compresses data by ~3X\n\/\/ specify number of boards in file\/DAQ system in line # 42 \n\/\/ \n\/\/-----\n\/\/ to run:\n\/\/ open root, i.e. type 'root' at command line:\n\/\/\n\/\/ .L ROOT-conversion-and-calibration\/ConvertACDCdata.C+\n\/\/  ...  takes 2 (required) filein, filout, and option to correct \n\/\/  ...  to correct for cell-by-cell voltage gain calibration\n\/\/  ConvertACDCdata(\"test.txt\", \"test.root\")\n\/\/\n\/\/  to quickly plot\n\/\/  re-open root (.q previous session)\n\/\/  \n\/\/  TFile *f = new TFile(\"test.root\")\n\/\/  ...  to look at waveform in channel 4 at 5th event, for example:\n\/\/  T->Draw(\"Data[4]:sample\", \"event==5\")\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/#ifndef __CINT__\n#include \"iostream\"\n#include \"fstream\"\n#include \"TFile.h\"\n#include \"TTree.h\"\n#include \"TChain.h\"\n#include \"TBranch.h\"\n#include \"TF1.h\"\n#include \"TH1F.h\"\n#include \"TProfile.h\"\n#include \"TMath.h\"\n#include <math.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n\/\/#endif\nusing namespace std;\n\n\/* modify for # of front end Boards *\/\nconst Int_t numBoardsInFile   =  3;\n\/************************************\/\nconst Int_t numChannelsPerBoard= 30;\nconst Int_t numChipsOnBoard =    5;\nconst Int_t psecSampleCells =    256;\n\nvoid ConvertACDCdata(char *filein, char *fileout, bool applyGainCorrection=true){ \n     \n  float*** VoltageLUT;\n  VoltageLUT = new float**[numChannelsPerBoard*numBoardsInFile];\n  for(int j=0; j<numBoardsInFile; j++){\n    for(int chan=0; chan<numChannelsPerBoard; chan++){\n      VoltageLUT[chan+j*numChannelsPerBoard] = new float*[psecSampleCells];\n      for(int samp=0; samp<psecSampleCells; samp++) VoltageLUT[chan+j*numChannelsPerBoard][samp] = new float[4096];\n    }\n  }\n  if( applyGainCorrection){\n    TFile *Flut = new TFile(\"calibrations\/LUT.root\");\n    TTree *T_lut = (TTree*)Flut->Get(\"Tlut\");\n    \/\/T_lut->Print();\n    int entry;\n    \n    float Voltage[numChannelsPerBoard*numBoardsInFile][psecSampleCells]; \n    \/\/int numBoardsinLUTFile = 0;\n    \/\/T_lut->SetBranchAddress(\"numBoardsforLUT\", numBoardsinLUTFile);\n    TBranch* Entrylut  = T_lut->GetBranch(\"ADC\"); \n    TBranch* Vlut  =     T_lut->GetBranch(\"Voltage\"); \n    \/\/TBranch* ADlut  = T_lut->GetBranch(\"ADC\"); \n    \n    Entrylut->SetAddress( &entry);\n    Vlut->SetAddress( &Voltage);\n    \/\/ADlut->SetAddress( &ADC);\n    \n    for(int i=0; i< T_lut->GetEntries(); i++){\n      T_lut->GetEntry(i);\n      for(int j=0; j<numBoardsInFile; j++){\n\tfor(int chan=0; chan<numChannelsPerBoard; chan++){\n\t  for(int samp=0; samp<psecSampleCells; samp++){\n\t    VoltageLUT[chan+j*numChannelsPerBoard][samp][i]=\n\t      Voltage[chan+j*numChannelsPerBoard][samp];\n\t  }\n\t}\n      }\n    }\n\n    T_lut->Delete();\n    Flut->Delete();\n  }\n  \n  TFile *f = new TFile(fileout, \"RECREATE\");\n\n  int nSample = psecSampleCells;\n  int sample[psecSampleCells], unwrap_sample[psecSampleCells];\n  int nCell = 0, event = 0;\n  float Data[numBoardsInFile*numChannelsPerBoard][psecSampleCells];\n  int Pedestals[numBoardsInFile*numChannelsPerBoard][psecSampleCells];\n  float metaData[numBoardsInFile][psecSampleCells];\n  char data_leaf[200], meta_data_leaf[200];\n  sprintf(data_leaf, \"Data[%i][256]\/F\",numBoardsInFile*numChannelsPerBoard); \n  sprintf(meta_data_leaf, \"metaData[%i][256]\/F\",numBoardsInFile);  \n  \n  TTree *T = new TTree(\"T\", \"T\");\n  T->Branch(\"event\", &event, \"event\/I\");\n  T->Branch(\"sample\", sample, \"sample[256]\/I\");\n  T->Branch(\"unwrap_sample\", unwrap_sample, \"unwrap_sample[256]\/I\");\n  T->Branch(\"Data\", &Data, data_leaf);\n  T->Branch(\"metaData\", &metaData, meta_data_leaf);\n\n  \/* open data .txt file *\/\n  ifstream ifs;\n  ifs.open(filein, ios::in);\n  if(!ifs) cout << \"error opening *.txt file\" << endl;\n  \n  int data_tmp=0, dummy=0;\n  float wfm_temp=0., ped_temp=0.;\n  \/* go through data file *\/\n  while(ifs){\n    \/* read pedestal values (first 'dummy event') *\/\n    if(event==0){\n      ifs >> sample[nCell] >> dummy;\n      for(int j=0; j<numBoardsInFile; j++){\n\tfor(int i=0; i<numChannelsPerBoard+1; i++){\n\t  if(i==numChannelsPerBoard) ifs >> dummy;\n\t  else ifs >> Pedestals[i+j*numChannelsPerBoard][nCell];\n\t} \n      }\t\t\t       \n    }\n    else{\n    \/* read real data line-by-line *\/\n      ifs >> sample[nCell] >> unwrap_sample[nCell];\n    \n      for(int j=0; j<numBoardsInFile; j++){\n\tfor(int i=0; i<numChannelsPerBoard+1; i++){\n\t  if(i==numChannelsPerBoard) ifs >> metaData[j][nCell];\n\t  else{\n\t    \n\t    ifs >> data_tmp;\n\n\t    \/* data saved in Volts... *\/\n\t    if( applyGainCorrection){\n\t      \/* look up waveform voltage *\/\n\t      \/\/cout << VoltageLUT[i+j*numChannelsPerBoard][nCell][2];\n\t      wfm_temp = VoltageLUT[i+j*numChannelsPerBoard][nCell][data_tmp];\n\t      \/* look up pedestal voltage *\/\n\t      ped_temp = VoltageLUT[i+j*numChannelsPerBoard][nCell][Pedestals[i+j*numChannelsPerBoard][nCell]];\n\t      \/* subtract the two *\/\n\t      Data[i+j*numChannelsPerBoard][nCell]= wfm_temp-ped_temp;\n\t    }\n\t    \/* OR, data saved in ADC counts *\/\n\t    else Data[i+j*numChannelsPerBoard][nCell]=data_tmp-Pedestals[i+j*numChannelsPerBoard][nCell];\n\t    \n\t  }\n\t}\n      }\n    }\n    \/\/cout << nCell << \":\" << sample[nCell] << \":\" << event << endl;\n    nCell++;\n  \n    if(nCell==nSample){\n      T->Fill();\n      event++;\n      nCell = 0;\n    }\n  }\n\n  cout << \"converted \" << event-1 << \" events\" << endl;\n  T->Write();\n  f->Close();\n  ifs.close();\n  return;\n}\t\t\t\t  \n\n<|endoftext|>"}
{"text":"<commit_before>#include <time.h>\n\n#include <boost\/make_shared.hpp>\n#include <ompl\/config.h>\n#define OMPL_VERSION_COMP (  OMPL_MAJOR_VERSION * 1000000 \\\n                           + OMPL_MINOR_VERSION * 1000 \\\n                           + OMPL_PATCH_VERSION)\n\n#include <ompl\/base\/StateSpaceTypes.h>\n#include <ompl\/base\/StateSpace.h>\n#include <ompl\/base\/spaces\/RealVectorStateSpace.h>\n#include <ompl\/geometric\/planners\/PlannerIncludes.h>\n#include <ompl\/geometric\/planners\/est\/EST.h>\n#include <ompl\/geometric\/planners\/kpiece\/KPIECE1.h>\n#include <ompl\/geometric\/planners\/kpiece\/BKPIECE1.h>\n#include <ompl\/geometric\/planners\/kpiece\/LBKPIECE1.h>\n\n#if OMPL_VERSION_COMP >= 000010002\n#  include <ompl\/geometric\/planners\/prm\/PRM.h>\n#else\n#  include <ompl\/geometric\/planners\/prm\/BasicPRM.h>\n#endif\n\n#include <ompl\/geometric\/planners\/rrt\/RRT.h>\n#include <ompl\/geometric\/planners\/rrt\/RRTConnect.h>\n#include <ompl\/geometric\/planners\/rrt\/LazyRRT.h>\n#include <ompl\/geometric\/planners\/rrt\/pRRT.h>\n#include <ompl\/geometric\/planners\/sbl\/SBL.h>\n#include <ompl\/geometric\/planners\/sbl\/pSBL.h>\n#include <ompl\/contrib\/rrt_star\/RRTstar.h>\n#include <ompl\/contrib\/rrt_star\/BallTreeRRTstar.h>\n\n#include \"OMPLPlanner.h\"\n\nusing namespace OpenRAVE;\n\n#define CD_OS_TIMESPEC_SET_ZERO(t) do { (t)->tv_sec = 0; (t)->tv_nsec = 0; } while (0)\n#define CD_OS_TIMESPEC_ADD(dst, src) do { (dst)->tv_sec += (src)->tv_sec; (dst)->tv_nsec += (src)->tv_nsec; \\\n   if ((dst)->tv_nsec > 999999999) { (dst)->tv_sec += 1; (dst)->tv_nsec -= 1000000000; } } while (0)\n#define CD_OS_TIMESPEC_SUB(dst, src) do { (dst)->tv_sec -= (src)->tv_sec; (dst)->tv_nsec -= (src)->tv_nsec; \\\n   if ((dst)->tv_nsec < 0) { (dst)->tv_sec -= 1; (dst)->tv_nsec += 1000000000; } } while (0)\n#define CD_OS_TIMESPEC_DOUBLE(src) ((src)->tv_sec + ((double)((src)->tv_nsec))\/1000000000.0)\n\n#define TIME_COLLISION_CHECKS\n\nnamespace or_ompl\n{\n\nOMPLPlanner::OMPLPlanner(OpenRAVE::EnvironmentBasePtr penv)\n    : OpenRAVE::PlannerBase(penv)\n{\n}\n\nOMPLPlanner::~OMPLPlanner()\n{\n}\n\nbool OMPLPlanner::InitPlan(OpenRAVE::RobotBasePtr robot, std::istream& input)\n{\n    m_totalCollisionTime = 0.0;\n    m_numCollisionChecks = 0;\n\n    OMPLPlannerParameters* params = new OMPLPlannerParameters();\n    input >> (*params);\n\n    return InitPlan(robot, PlannerParametersConstPtr(params));\n}\n\nbool OMPLPlanner::InitPlan(RobotBasePtr robot, PlannerParametersConstPtr params)\n{\n    RAVELOG_DEBUG(\"Initializing plan\\n\");\n    if (m_simpleSetup) {\n        m_simpleSetup.reset();\n    }\n\n    m_parameters = boost::make_shared<OMPLPlannerParameters>();\n    m_parameters->copy(params);\n    \n    if (m_parameters->m_seed)\n    {\n       RAVELOG_DEBUG(\"Setting random seed to %u ...\\n\", m_parameters->m_seed);\n       ompl::RNG::setSeed(m_parameters->m_seed);\n       if (ompl::RNG::getSeed() != m_parameters->m_seed) {\n          RAVELOG_ERROR(\"Could not set the seed! Was this the first or_ompl plan attempted?\\n\");\n          return false;\n       }\n    }\n    else {\n       RAVELOG_DEBUG(\"Using default (time-based) seed (%u) for OMPL ...\\n\", ompl::RNG::getSeed());\n    }\n\n    m_robot = robot;\n\n    RAVELOG_DEBUG(\"Setting state space\\n\");\n    m_stateSpace = boost::make_shared<ompl::base::RealVectorStateSpace>(robot->GetActiveDOF());\n\n    RAVELOG_DEBUG(\"Setting joint limits\\n\");\n    ompl::base::RealVectorBounds bounds(m_robot->GetActiveDOF());\n    std::vector<double> lowerLimits, upperLimits;\n    m_robot->GetActiveDOFLimits(lowerLimits, upperLimits);\n\n    for (int i = 0; i < m_robot->GetActiveDOF(); i++) {\n        bounds.setLow(i, lowerLimits[i]);\n        bounds.setHigh(i, upperLimits[i]);\n    }\n\n    m_stateSpace->as<ompl::base::RealVectorStateSpace>()->setBounds(bounds);\n    \n    RAVELOG_DEBUG(\"Setting up simplesetup class.\\n\");\n    m_simpleSetup = boost::make_shared<ompl::geometric::SimpleSetup>(GetStateSpace());\n\n    RAVELOG_DEBUG(\"Initializing the planner.\\n\");\n    if (!InitializePlanner()) {\n        return false;\n    }\n\n    RAVELOG_DEBUG(\"Setting the planner.\\n\");\n    m_simpleSetup->setPlanner(m_planner);\n\n    RAVELOG_DEBUG(\"Creating the start pose.\\n\");\n    ompl::base::ScopedState<ompl::base::RealVectorStateSpace> startPose(m_stateSpace);\n    for (int i = 0; i < m_robot->GetActiveDOF(); i++) {\n        startPose->values[i] = m_parameters->vinitialconfig[i];\n    }\n\n    RAVELOG_DEBUG(\"Checking collisions.\\n\");\n    if (IsInOrCollision(params->vinitialconfig)) {\n        RAVELOG_ERROR(\"Can't plan. Initial configuration in collision!\\n\");\n        return false;\n    }\n\n    RAVELOG_DEBUG(\"Setting the end pose.\\n\");\n    ompl::base::ScopedState<ompl::base::RealVectorStateSpace> endPose(m_stateSpace);\n    for (int i = 0; i < m_robot->GetActiveDOF(); i++) {\n        endPose->values[i] = params->vgoalconfig[i];\n    }\n\n    RAVELOG_DEBUG(\"Checking collisions\\n\");\n    if (IsInOrCollision(params->vgoalconfig)) {\n        RAVELOG_ERROR(\"Can't plan. Final configuration is in collision!\");\n        return false;\n    }\n\n    RAVELOG_DEBUG(\"Setting state validity checker\\n\");\n    m_simpleSetup->setStateValidityChecker(boost::bind(&or_ompl::OMPLPlanner::IsStateValid, this, _1));\n    m_simpleSetup->setStartState(startPose);\n    m_simpleSetup->setGoalState(endPose);\n\n    m_collisionReport = boost::make_shared<CollisionReport>();\n\n    return true;\n}\n\nbool OMPLPlanner::InitializePlanner()\n{\n    RAVELOG_DEBUG(\"Getting planner name.\\n\");\n    std::string plannerName = m_parameters->m_plannerType;\n\n    RAVELOG_DEBUG(\"Setting up space information\\n\");\n    ompl::base::SpaceInformationPtr spaceInformation = m_simpleSetup->getSpaceInformation();\n    if(plannerName == \"KPIECE\")\n    {\n        m_planner.reset(new ompl::geometric::KPIECE1(spaceInformation));\n    }\n    else if(plannerName == \"BKPIECE\")\n    {\n        m_planner.reset(new ompl::geometric::BKPIECE1(spaceInformation));\n    }\n    else if(plannerName == \"LBKPIECE\")\n    {\n        m_planner.reset(new ompl::geometric::LBKPIECE1(spaceInformation));\n    }\n    else if(plannerName == \"EST\")\n    {\n        m_planner.reset(new ompl::geometric::EST(spaceInformation));\n    }\n    else if(plannerName == \"RRT\")\n    {\n        ompl::geometric::RRT* rrt = new ompl::geometric::RRT(spaceInformation);\n        m_planner.reset(rrt);\n        rrt->setGoalBias(m_parameters->m_rrtGoalBias);\n        rrt->setRange(m_parameters->m_rrtRange);\n    }\n    else if(plannerName == \"RRTConnect\")\n    {\n        ompl::geometric::RRTConnect* rrtConnect = new ompl::geometric::RRTConnect(spaceInformation);\n        m_planner.reset(rrtConnect);\n        printf(\"setting range to be %f!\\n\", m_parameters->m_rrtRange);\n        rrtConnect->setRange(m_parameters->m_rrtRange);\n    }\n    else if(plannerName == \"pRRT\")\n    {\n        ompl::geometric::pRRT* prrt = new ompl::geometric::pRRT(spaceInformation);\n        m_planner.reset(prrt);\n        prrt->setRange(m_parameters->m_rrtRange);\n        prrt->setGoalBias(m_parameters->m_rrtGoalBias);\n    }\n    else if(plannerName == \"LazyRRT\")\n    {\n        ompl::geometric::LazyRRT* lazyRRT = new ompl::geometric::LazyRRT(spaceInformation);\n        m_planner.reset(new ompl::geometric::LazyRRT(spaceInformation));\n        lazyRRT->setGoalBias(m_parameters->m_rrtGoalBias);\n        lazyRRT->setRange(m_parameters->m_rrtRange);\n    }\n    else if(plannerName == \"PRM\")\n    {\n#if OMPL_VERSION_COMP >= 000010002\n        m_planner.reset(new ompl::geometric::PRM(spaceInformation));\n#else\n        m_planner.reset(new ompl::geometric::BasicPRM(spaceInformation));\n#endif\n    }\n    else if(plannerName == \"RRTstar\")\n    {\n        RAVELOG_DEBUG(\"RRT Star Planner name\\n\");\n\n        ompl::geometric::RRTstar* rrtStar = new ompl::geometric::RRTstar(spaceInformation);\n\n        RAVELOG_DEBUG(\"Created RRTStar\\n\");\n\n        m_planner.reset(rrtStar);\n\n        RAVELOG_DEBUG(\"Setting parameters\\n\");\n        rrtStar->setGoalBias(m_parameters->m_rrtGoalBias);\n        rrtStar->setMaxBallRadius(m_parameters->m_rrtStarMaxBallRadius);\n        rrtStar->setRange(m_parameters->m_rrtRange);\n    }\n    else if(plannerName == \"BallTreeRRTstar\")\n    {\n        ompl::geometric::BallTreeRRTstar* ballTree = new ompl::geometric::BallTreeRRTstar(spaceInformation);\n        m_planner.reset(ballTree);\n        ballTree->setGoalBias(m_parameters->m_rrtGoalBias);\n        ballTree->setMaxBallRadius(m_parameters->m_rrtStarMaxBallRadius);\n        ballTree->setRange(m_parameters->m_rrtRange);\n    }\n    else\n    {\n        RAVELOG_ERROR(\"Urecognized planner: %s\", plannerName.c_str());\n        return false;\n    }\n    return true;\n}\n\nOpenRAVE::PlannerStatus OMPLPlanner::PlanPath(OpenRAVE::TrajectoryBasePtr ptraj)\n{\n    OpenRAVE::EnvironmentMutex::scoped_lock lockenv(GetEnv()->GetMutex());\n    if (!m_simpleSetup) {\n        RAVELOG_ERROR(\"Unable to plan. Did you call InitPlan?\");\n        return OpenRAVE::PS_Failed;\n    }\n    \/* also, set something max path length so it continues after finding a solution! *\/\n    \/\/m_simpleSetup->getGoal()->setMaximumPathLength(0.0);\n   \n    \/\/ TODO: What is all of this? Should this really be in the planner?\n    struct timespec tic;\n    clock_gettime(CLOCK_THREAD_CPUTIME_ID, &tic);\n\n    bool success;\n    success = m_simpleSetup->solve(m_parameters->m_timeLimit);\n\n    struct timespec toc;\n    clock_gettime(CLOCK_THREAD_CPUTIME_ID, &toc);\n    CD_OS_TIMESPEC_SUB(&toc, &tic);\n    printf(\"cputime seconds: %f\\n\", CD_OS_TIMESPEC_DOUBLE(&toc));\n\n    if (success) { \n        return ToORTrajectory(m_simpleSetup->getSolutionPath(), ptraj);\n    } else {\n        return OpenRAVE::PS_Failed;\n    }\n}\n\nbool OMPLPlanner::IsInOrCollision(std::vector<double> values)\n{\n#ifdef TIME_COLLISION_CHECKS\n    struct timespec tic;\n    clock_gettime(CLOCK_THREAD_CPUTIME_ID, &tic);\n#endif\n    OpenRAVE::EnvironmentMutex::scoped_lock lockenv(GetEnv()->GetMutex());\n    m_robot->SetActiveDOFValues(values, false);\n    bool collided = (GetEnv()->CheckCollision(KinBodyConstPtr(m_robot), m_collisionReport)) || (m_robot->CheckSelfCollision(m_collisionReport));\n    m_numCollisionChecks++;\n\n#ifdef TIME_COLLISION_CHECKS\n    struct timespec toc;\n    clock_gettime(CLOCK_THREAD_CPUTIME_ID, &toc);\n    CD_OS_TIMESPEC_SUB(&toc, &tic);\n    m_totalCollisionTime += CD_OS_TIMESPEC_DOUBLE(&toc);\n#endif\n    return collided;\n}\n\nbool OMPLPlanner::IsStateValid(ompl::base::State const *state)\n{\n    ompl::base::RealVectorStateSpace::StateType const* realVectorState = state->as<ompl::base::RealVectorStateSpace::StateType>();\n\n    if (!realVectorState) {\n        RAVELOG_ERROR(\"State type requested was invalid!\");\n        return false;\n    } else {\n        std::vector<double> values;\n        for (int i = 0; i < m_robot->GetActiveDOF(); i++) {\n            values.push_back(realVectorState->values[i]);\n        }\n        return !IsInOrCollision(values);\n    }\n}\n\nOpenRAVE::PlannerStatus OMPLPlanner::ToORTrajectory(\n        ompl::geometric::PathGeometric &ompl_traj,\n        OpenRAVE::TrajectoryBasePtr or_traj) const\n{\n#if OMPL_VERSION_COMP >= 000010002\n    std::vector<ompl::base::State*> const &states = ompl_traj.getStates();\n#else\n    std::vector<ompl::base::State*> const &states = ompl_traj.states;\n#endif\n\n    size_t const num_dof = m_robot->GetActiveDOF();\n    or_traj->Init(m_robot->GetActiveConfigurationSpecification());\n\n    for (size_t i = 0; i < states.size(); ++i){\n        ompl::base::RealVectorStateSpace::StateType const *state\n            = states[i]->as<ompl::base::RealVectorStateSpace::StateType>();\n        if (!state) {\n            RAVELOG_ERROR(\"Unable to convert output trajectory.\"\n                          \"State is not a RealVectorStateSpace::StateType.\");\n            return OpenRAVE::PS_Failed;\n        }\n\n        std::vector<OpenRAVE::dReal> sample(num_dof);\n        for (size_t j = 0; j < num_dof; ++j) {\n            sample[j] = (*state)[j];\n        }\n        or_traj->Insert(i, sample, true);\n    }\n    return OpenRAVE::PS_HasSolution;\n}\n\n} \/* namespace or_ompl *\/\n<commit_msg>Removed 'using namespace'.<commit_after>#include <time.h>\n\n#include <boost\/make_shared.hpp>\n#include <ompl\/config.h>\n#define OMPL_VERSION_COMP (  OMPL_MAJOR_VERSION * 1000000 \\\n                           + OMPL_MINOR_VERSION * 1000 \\\n                           + OMPL_PATCH_VERSION)\n\n#include <ompl\/base\/StateSpaceTypes.h>\n#include <ompl\/base\/StateSpace.h>\n#include <ompl\/base\/spaces\/RealVectorStateSpace.h>\n#include <ompl\/geometric\/planners\/PlannerIncludes.h>\n#include <ompl\/geometric\/planners\/est\/EST.h>\n#include <ompl\/geometric\/planners\/kpiece\/KPIECE1.h>\n#include <ompl\/geometric\/planners\/kpiece\/BKPIECE1.h>\n#include <ompl\/geometric\/planners\/kpiece\/LBKPIECE1.h>\n\n#if OMPL_VERSION_COMP >= 000010002\n#  include <ompl\/geometric\/planners\/prm\/PRM.h>\n#else\n#  include <ompl\/geometric\/planners\/prm\/BasicPRM.h>\n#endif\n\n#include <ompl\/geometric\/planners\/rrt\/RRT.h>\n#include <ompl\/geometric\/planners\/rrt\/RRTConnect.h>\n#include <ompl\/geometric\/planners\/rrt\/LazyRRT.h>\n#include <ompl\/geometric\/planners\/rrt\/pRRT.h>\n#include <ompl\/geometric\/planners\/sbl\/SBL.h>\n#include <ompl\/geometric\/planners\/sbl\/pSBL.h>\n#include <ompl\/contrib\/rrt_star\/RRTstar.h>\n#include <ompl\/contrib\/rrt_star\/BallTreeRRTstar.h>\n\n#include \"OMPLPlanner.h\"\n\n#define CD_OS_TIMESPEC_SET_ZERO(t) do { (t)->tv_sec = 0; (t)->tv_nsec = 0; } while (0)\n#define CD_OS_TIMESPEC_ADD(dst, src) do { (dst)->tv_sec += (src)->tv_sec; (dst)->tv_nsec += (src)->tv_nsec; \\\n   if ((dst)->tv_nsec > 999999999) { (dst)->tv_sec += 1; (dst)->tv_nsec -= 1000000000; } } while (0)\n#define CD_OS_TIMESPEC_SUB(dst, src) do { (dst)->tv_sec -= (src)->tv_sec; (dst)->tv_nsec -= (src)->tv_nsec; \\\n   if ((dst)->tv_nsec < 0) { (dst)->tv_sec -= 1; (dst)->tv_nsec += 1000000000; } } while (0)\n#define CD_OS_TIMESPEC_DOUBLE(src) ((src)->tv_sec + ((double)((src)->tv_nsec))\/1000000000.0)\n\n#define TIME_COLLISION_CHECKS\n\nnamespace or_ompl\n{\n\nOMPLPlanner::OMPLPlanner(OpenRAVE::EnvironmentBasePtr penv)\n    : OpenRAVE::PlannerBase(penv)\n{\n}\n\nOMPLPlanner::~OMPLPlanner()\n{\n}\n\nbool OMPLPlanner::InitPlan(OpenRAVE::RobotBasePtr robot, std::istream& input)\n{\n    m_totalCollisionTime = 0.0;\n    m_numCollisionChecks = 0;\n\n    OMPLPlannerParameters* params = new OMPLPlannerParameters();\n    input >> (*params);\n\n    return InitPlan(robot, PlannerParametersConstPtr(params));\n}\n\nbool OMPLPlanner::InitPlan(OpenRAVE::RobotBasePtr robot,\n                           PlannerParametersConstPtr params)\n{\n    RAVELOG_DEBUG(\"Initializing plan\\n\");\n    if (m_simpleSetup) {\n        m_simpleSetup.reset();\n    }\n\n    m_parameters = boost::make_shared<OMPLPlannerParameters>();\n    m_parameters->copy(params);\n    \n    if (m_parameters->m_seed)\n    {\n       RAVELOG_DEBUG(\"Setting random seed to %u ...\\n\", m_parameters->m_seed);\n       ompl::RNG::setSeed(m_parameters->m_seed);\n       if (ompl::RNG::getSeed() != m_parameters->m_seed) {\n          RAVELOG_ERROR(\"Could not set the seed! Was this the first or_ompl plan attempted?\\n\");\n          return false;\n       }\n    }\n    else {\n       RAVELOG_DEBUG(\"Using default (time-based) seed (%u) for OMPL ...\\n\", ompl::RNG::getSeed());\n    }\n\n    m_robot = robot;\n\n    RAVELOG_DEBUG(\"Setting state space\\n\");\n    m_stateSpace = boost::make_shared<ompl::base::RealVectorStateSpace>(robot->GetActiveDOF());\n\n    RAVELOG_DEBUG(\"Setting joint limits\\n\");\n    ompl::base::RealVectorBounds bounds(m_robot->GetActiveDOF());\n    std::vector<double> lowerLimits, upperLimits;\n    m_robot->GetActiveDOFLimits(lowerLimits, upperLimits);\n\n    for (int i = 0; i < m_robot->GetActiveDOF(); i++) {\n        bounds.setLow(i, lowerLimits[i]);\n        bounds.setHigh(i, upperLimits[i]);\n    }\n\n    m_stateSpace->as<ompl::base::RealVectorStateSpace>()->setBounds(bounds);\n    \n    RAVELOG_DEBUG(\"Setting up simplesetup class.\\n\");\n    m_simpleSetup = boost::make_shared<ompl::geometric::SimpleSetup>(GetStateSpace());\n\n    RAVELOG_DEBUG(\"Initializing the planner.\\n\");\n    if (!InitializePlanner()) {\n        return false;\n    }\n\n    RAVELOG_DEBUG(\"Setting the planner.\\n\");\n    m_simpleSetup->setPlanner(m_planner);\n\n    RAVELOG_DEBUG(\"Creating the start pose.\\n\");\n    ompl::base::ScopedState<ompl::base::RealVectorStateSpace> startPose(m_stateSpace);\n    for (int i = 0; i < m_robot->GetActiveDOF(); i++) {\n        startPose->values[i] = m_parameters->vinitialconfig[i];\n    }\n\n    RAVELOG_DEBUG(\"Checking collisions.\\n\");\n    if (IsInOrCollision(params->vinitialconfig)) {\n        RAVELOG_ERROR(\"Can't plan. Initial configuration in collision!\\n\");\n        return false;\n    }\n\n    RAVELOG_DEBUG(\"Setting the end pose.\\n\");\n    ompl::base::ScopedState<ompl::base::RealVectorStateSpace> endPose(m_stateSpace);\n    for (int i = 0; i < m_robot->GetActiveDOF(); i++) {\n        endPose->values[i] = params->vgoalconfig[i];\n    }\n\n    RAVELOG_DEBUG(\"Checking collisions\\n\");\n    if (IsInOrCollision(params->vgoalconfig)) {\n        RAVELOG_ERROR(\"Can't plan. Final configuration is in collision!\");\n        return false;\n    }\n\n    RAVELOG_DEBUG(\"Setting state validity checker\\n\");\n    m_simpleSetup->setStateValidityChecker(boost::bind(&or_ompl::OMPLPlanner::IsStateValid, this, _1));\n    m_simpleSetup->setStartState(startPose);\n    m_simpleSetup->setGoalState(endPose);\n\n    m_collisionReport = boost::make_shared<OpenRAVE::CollisionReport>();\n\n    return true;\n}\n\nbool OMPLPlanner::InitializePlanner()\n{\n    RAVELOG_DEBUG(\"Getting planner name.\\n\");\n    std::string plannerName = m_parameters->m_plannerType;\n\n    RAVELOG_DEBUG(\"Setting up space information\\n\");\n    ompl::base::SpaceInformationPtr spaceInformation = m_simpleSetup->getSpaceInformation();\n    if(plannerName == \"KPIECE\")\n    {\n        m_planner.reset(new ompl::geometric::KPIECE1(spaceInformation));\n    }\n    else if(plannerName == \"BKPIECE\")\n    {\n        m_planner.reset(new ompl::geometric::BKPIECE1(spaceInformation));\n    }\n    else if(plannerName == \"LBKPIECE\")\n    {\n        m_planner.reset(new ompl::geometric::LBKPIECE1(spaceInformation));\n    }\n    else if(plannerName == \"EST\")\n    {\n        m_planner.reset(new ompl::geometric::EST(spaceInformation));\n    }\n    else if(plannerName == \"RRT\")\n    {\n        ompl::geometric::RRT* rrt = new ompl::geometric::RRT(spaceInformation);\n        m_planner.reset(rrt);\n        rrt->setGoalBias(m_parameters->m_rrtGoalBias);\n        rrt->setRange(m_parameters->m_rrtRange);\n    }\n    else if(plannerName == \"RRTConnect\")\n    {\n        ompl::geometric::RRTConnect* rrtConnect = new ompl::geometric::RRTConnect(spaceInformation);\n        m_planner.reset(rrtConnect);\n        printf(\"setting range to be %f!\\n\", m_parameters->m_rrtRange);\n        rrtConnect->setRange(m_parameters->m_rrtRange);\n    }\n    else if(plannerName == \"pRRT\")\n    {\n        ompl::geometric::pRRT* prrt = new ompl::geometric::pRRT(spaceInformation);\n        m_planner.reset(prrt);\n        prrt->setRange(m_parameters->m_rrtRange);\n        prrt->setGoalBias(m_parameters->m_rrtGoalBias);\n    }\n    else if(plannerName == \"LazyRRT\")\n    {\n        ompl::geometric::LazyRRT* lazyRRT = new ompl::geometric::LazyRRT(spaceInformation);\n        m_planner.reset(new ompl::geometric::LazyRRT(spaceInformation));\n        lazyRRT->setGoalBias(m_parameters->m_rrtGoalBias);\n        lazyRRT->setRange(m_parameters->m_rrtRange);\n    }\n    else if(plannerName == \"PRM\")\n    {\n#if OMPL_VERSION_COMP >= 000010002\n        m_planner.reset(new ompl::geometric::PRM(spaceInformation));\n#else\n        m_planner.reset(new ompl::geometric::BasicPRM(spaceInformation));\n#endif\n    }\n    else if(plannerName == \"RRTstar\")\n    {\n        RAVELOG_DEBUG(\"RRT Star Planner name\\n\");\n\n        ompl::geometric::RRTstar* rrtStar = new ompl::geometric::RRTstar(spaceInformation);\n\n        RAVELOG_DEBUG(\"Created RRTStar\\n\");\n\n        m_planner.reset(rrtStar);\n\n        RAVELOG_DEBUG(\"Setting parameters\\n\");\n        rrtStar->setGoalBias(m_parameters->m_rrtGoalBias);\n        rrtStar->setMaxBallRadius(m_parameters->m_rrtStarMaxBallRadius);\n        rrtStar->setRange(m_parameters->m_rrtRange);\n    }\n    else if(plannerName == \"BallTreeRRTstar\")\n    {\n        ompl::geometric::BallTreeRRTstar* ballTree = new ompl::geometric::BallTreeRRTstar(spaceInformation);\n        m_planner.reset(ballTree);\n        ballTree->setGoalBias(m_parameters->m_rrtGoalBias);\n        ballTree->setMaxBallRadius(m_parameters->m_rrtStarMaxBallRadius);\n        ballTree->setRange(m_parameters->m_rrtRange);\n    }\n    else\n    {\n        RAVELOG_ERROR(\"Urecognized planner: %s\", plannerName.c_str());\n        return false;\n    }\n    return true;\n}\n\nOpenRAVE::PlannerStatus OMPLPlanner::PlanPath(OpenRAVE::TrajectoryBasePtr ptraj)\n{\n    OpenRAVE::EnvironmentMutex::scoped_lock lockenv(GetEnv()->GetMutex());\n    if (!m_simpleSetup) {\n        RAVELOG_ERROR(\"Unable to plan. Did you call InitPlan?\");\n        return OpenRAVE::PS_Failed;\n    }\n    \/* also, set something max path length so it continues after finding a solution! *\/\n    \/\/m_simpleSetup->getGoal()->setMaximumPathLength(0.0);\n   \n    \/\/ TODO: What is all of this? Should this really be in the planner?\n    struct timespec tic;\n    clock_gettime(CLOCK_THREAD_CPUTIME_ID, &tic);\n\n    bool success;\n    success = m_simpleSetup->solve(m_parameters->m_timeLimit);\n\n    struct timespec toc;\n    clock_gettime(CLOCK_THREAD_CPUTIME_ID, &toc);\n    CD_OS_TIMESPEC_SUB(&toc, &tic);\n    printf(\"cputime seconds: %f\\n\", CD_OS_TIMESPEC_DOUBLE(&toc));\n\n    if (success) { \n        return ToORTrajectory(m_simpleSetup->getSolutionPath(), ptraj);\n    } else {\n        return OpenRAVE::PS_Failed;\n    }\n}\n\nbool OMPLPlanner::IsInOrCollision(std::vector<double> values)\n{\n#ifdef TIME_COLLISION_CHECKS\n    struct timespec tic;\n    clock_gettime(CLOCK_THREAD_CPUTIME_ID, &tic);\n#endif\n    OpenRAVE::EnvironmentMutex::scoped_lock lockenv(GetEnv()->GetMutex());\n    m_robot->SetActiveDOFValues(values, false);\n    bool collided = (GetEnv()->CheckCollision(m_robot, m_collisionReport))\n                 || (m_robot->CheckSelfCollision(m_collisionReport));\n    m_numCollisionChecks++;\n\n#ifdef TIME_COLLISION_CHECKS\n    struct timespec toc;\n    clock_gettime(CLOCK_THREAD_CPUTIME_ID, &toc);\n    CD_OS_TIMESPEC_SUB(&toc, &tic);\n    m_totalCollisionTime += CD_OS_TIMESPEC_DOUBLE(&toc);\n#endif\n    return collided;\n}\n\nbool OMPLPlanner::IsStateValid(ompl::base::State const *state)\n{\n    ompl::base::RealVectorStateSpace::StateType const* realVectorState = state->as<ompl::base::RealVectorStateSpace::StateType>();\n\n    if (!realVectorState) {\n        RAVELOG_ERROR(\"State type requested was invalid!\");\n        return false;\n    } else {\n        std::vector<double> values;\n        for (int i = 0; i < m_robot->GetActiveDOF(); i++) {\n            values.push_back(realVectorState->values[i]);\n        }\n        return !IsInOrCollision(values);\n    }\n}\n\nOpenRAVE::PlannerStatus OMPLPlanner::ToORTrajectory(\n        ompl::geometric::PathGeometric &ompl_traj,\n        OpenRAVE::TrajectoryBasePtr or_traj) const\n{\n#if OMPL_VERSION_COMP >= 000010002\n    std::vector<ompl::base::State*> const &states = ompl_traj.getStates();\n#else\n    std::vector<ompl::base::State*> const &states = ompl_traj.states;\n#endif\n\n    size_t const num_dof = m_robot->GetActiveDOF();\n    or_traj->Init(m_robot->GetActiveConfigurationSpecification());\n\n    for (size_t i = 0; i < states.size(); ++i){\n        ompl::base::RealVectorStateSpace::StateType const *state\n            = states[i]->as<ompl::base::RealVectorStateSpace::StateType>();\n        if (!state) {\n            RAVELOG_ERROR(\"Unable to convert output trajectory.\"\n                          \"State is not a RealVectorStateSpace::StateType.\");\n            return OpenRAVE::PS_Failed;\n        }\n\n        std::vector<OpenRAVE::dReal> sample(num_dof);\n        for (size_t j = 0; j < num_dof; ++j) {\n            sample[j] = (*state)[j];\n        }\n        or_traj->Insert(i, sample, true);\n    }\n    return OpenRAVE::PS_HasSolution;\n}\n\n} \/* namespace or_ompl *\/\n<|endoftext|>"}
{"text":"<commit_before>#ifndef PIPEMANAGER_CPP_\n#define PIPEMANAGER_CPP_\n\n#include <queue>\n#include <vector>\n#include <string>\n#include <OthUtil.h>\n#include <OthFile.h>\n#include <Keywords.h>\n#include <Function.h>\n#include <ParsedCall.h>\n#include <sstream> \/\/ for to_string\n\nusing namespace std;\n\nstatic int replaceForwardingCharacters(vector<ParsedCall> &calls, int startID) { \/\/TODO I think this might have an issue with blocks....\n\tqueue<string> forwardedPipes;\n\tint replacementID = startID;\n\tfor (int callN = 0; callN < calls.size(); callN++) {\n\t\tParsedCall call = calls[callN];\n\t\tfor (string &param : call.inParams) {\n\t\t\tparse_validate(param != \">\", call.lineN, \"Encountered > pipe in inputs\");\n\t\t\tif (param == \"<\") {\n\t\t\t\tparse_validate(!forwardedPipes.empty(), call.lineN, \"Encountered < but no forwarded pipes exist!\");\n\t\t\t\tparam = forwardedPipes.front();\n\t\t\t\tforwardedPipes.pop();\n\t\t\t}\n\t\t}\n\t\tfor (string &param : call.outParams) {\n\t\t\tparse_validate(param != \"<\", call.lineN, \"Encountered < pipe in outputs\");\n\t\t\tif (param == \">\") {\n\t\t\t\tstd::stringstream ss;\n\t\t\t\tss << \"_fwd_\" << replacementID++;\n\t\t\t\tparam = ss.str();\n\t\t\t\tforwardedPipes.push(ss.str());\n\t\t\t}\n\t\t}\n\t\tfor (vector<ParsedCall> &confNodes : call.confNodes) {\n\t\t\treplacementID = replaceForwardingCharacters(confNodes, replacementID);\n\t\t}\n\t\tcalls[callN] = call;\n\t}\n\treturn replacementID;\n}\n\nstatic void setPipeCodes(OthFile &file) {\n\t\/\/TODO first validate pipe names (so that we can start inserting illegal names like < replacements)\n\t\/\/\t\ti.e. _ as first character is illegal\n\tfor (Function &f : file.functionList) {\n\t\treplaceForwardingCharacters(f.callList, 0);\n\t}\n}\n\n#endif\n<commit_msg>Checking for hanging ><commit_after>#ifndef PIPEMANAGER_CPP_\n#define PIPEMANAGER_CPP_\n\n#include <queue>\n#include <vector>\n#include <string>\n#include <OthUtil.h>\n#include <OthFile.h>\n#include <Keywords.h>\n#include <Function.h>\n#include <ParsedCall.h>\n#include <sstream> \/\/ for to_string\n\nusing namespace std;\n\nstatic int replaceForwardingCharacters(vector<ParsedCall> &calls, int startID) { \/\/TODO I think this might have an issue with blocks....\n\tqueue<string> forwardedPipes;\n\tint replacementID = startID;\n\tParsedCall call;\n\tint lastForwardIndex = 0;\n\tfor (int callN = 0; callN < calls.size(); callN++) {\n\t\tcall = calls[callN];\n\t\tfor (string &param : call.inParams) {\n\t\t\tparse_validate(param != \">\", call.lineN, \"Encountered > pipe in inputs\");\n\t\t\tif (param == \"<\") {\n\t\t\t\tparse_validate(!forwardedPipes.empty(), call.lineN, \"Encountered < but no forwarded pipes exist!\");\n\t\t\t\tparam = forwardedPipes.front();\n\t\t\t\tforwardedPipes.pop();\n\t\t\t}\n\t\t}\n\t\tfor (string &param : call.outParams) {\n\t\t\tparse_validate(param != \"<\", call.lineN, \"Encountered < pipe in outputs\");\n\t\t\tif (param == \">\") {\n\t\t\t\tstd::stringstream ss;\n\t\t\t\tss << \"_fwd_\" << replacementID++ << \"_\" << call.lineN;\n\t\t\t\tparam = ss.str();\n\t\t\t\tforwardedPipes.push(ss.str());\n\t\t\t\tlastForwardIndex = call.lineN; \/\/for error messages if needed\n\t\t\t}\n\t\t}\n\t\tfor (vector<ParsedCall> &confNodes : call.confNodes) {\n\t\t\treplacementID = replaceForwardingCharacters(confNodes, replacementID);\n\t\t}\n\t\tcalls[callN] = call;\n\t}\n\tparse_validate(forwardedPipes.empty(), lastForwardIndex, \"Hanging forwarding pipes left at end of function\");\n\treturn replacementID;\n}\n\nstatic void setPipeCodes(OthFile &file) {\n\t\/\/TODO first validate pipe names (so that we can start inserting illegal names like < replacements)\n\t\/\/\t\ti.e. _ as first character is illegal\n\tfor (Function &f : file.functionList) {\n\t\treplaceForwardingCharacters(f.callList, 0);\n\t}\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"PlasmaState.h\"\n#include \"Abundance.h\"\n#include \"Composition.h\"\n#include \"GslBrentWrapper.h\"\n#include \"PhysicalConstants.h\"\n#include \"PlasmaFunctions.h\"\n\n#include <cassert>\n#include <limits>\n#include <vector>\n\n\n\/\/ helper functions used in initializing the plasma state\nnamespace {\n\n  \/\/ alias for convenience\n  const double& mp = PhysicalConstantsCGS::ProtonMass;\n\n  double computeNe(const double rho, const Composition& comp) {\n    return rho \/ (mp * comp.meanMolecularWeightPerElectron);\n  }\n\n  std::vector<double> computeNi(double rho, const Composition& comp) {\n    const std::vector<Abundance>& abundances = comp.abundances;\n    std::vector<double> result(abundances.size());\n    for (size_t elem=0; elem<abundances.size(); ++elem) {\n      result[elem] = rho * abundances[elem].massFraction\n                     \/ (mp * abundances[elem].element.A);\n    }\n    return result;\n  }\n\n  class ChiFunction : public GslFunction {\n    const double ne_target_;\n    const double kt_;\n    const double tau_;\n    public:\n    ChiFunction(const double ne_t, const double kt, const double tau)\n      : ne_target_(ne_t), kt_(kt), tau_(tau) {}\n    double f(const double chi) const {\n      \/\/ argument phi = 0 in this rootfind\n      return ne_target_ - Plasma::ne(chi, 0.0, kt_, tau_);\n    }\n  };\n\n  double invertForChi(const double ne, const double kt, const double tau) {\n    \/\/ start by initializing some values\n    const ChiFunction func(ne, kt, tau);\n\n    \/\/ find a chi interval which brackets the root\n    \/\/ ne(chi) is an INCREASING function, so ChiFunction(chi) is DECREASING\n    double chiA = 0;\n    double deltaA = func.f(chiA);\n    if (deltaA == 0.0) return chiA;\n    double chiB = (deltaA > 0) - (deltaA < 0); \/\/ this is the sign operator\n    double deltaB = func.f(chiB);\n    while (deltaA*deltaB > 0.0) {\n      chiA = chiB;\n      deltaA = deltaB;\n      chiB = 2*chiB;\n      deltaB = func.f(chiB);\n    }\n\n    \/\/ find the root\n    const double chi_eps = std::numeric_limits<double>::epsilon();\n    return GslBrent(func, chiA, chiB, chi_eps);\n  }\n\n} \/\/ helper namespace\n\n\n\nPlasmaState::\nPlasmaState(const double rho, const double kt, const Composition& comp,\n    const bool isRel)\n: rho(rho),\n  kt(kt),\n  comp(comp),\n  isRelativistic(isRel),\n  ne(computeNe(rho, comp)),\n  ni(computeNi(rho, comp)),\n  tau(isRel ? (kt \/ PhysicalConstantsCGS::MeCC) : 0.0),\n  chi(invertForChi(ne, kt, tau))\n{\n  assert(kt>0);\n  assert(rho>0);\n}\n\n<commit_msg>PlasmaState: Minor edit<commit_after>\n#include \"PlasmaState.h\"\n#include \"Abundance.h\"\n#include \"Composition.h\"\n#include \"GslBrentWrapper.h\"\n#include \"PhysicalConstants.h\"\n#include \"PlasmaFunctions.h\"\n\n#include <cassert>\n#include <limits>\n#include <vector>\n\n\n\/\/ helper functions used in initializing the plasma state\nnamespace {\n\n  double computeNe(const double rho, const Composition& comp) {\n    const double& mp = PhysicalConstantsCGS::ProtonMass;\n    return rho \/ (mp * comp.meanMolecularWeightPerElectron);\n  }\n\n  std::vector<double> computeNi(double rho, const Composition& comp) {\n    const std::vector<Abundance>& abundances = comp.abundances;\n    const double& mp = PhysicalConstantsCGS::ProtonMass;\n    std::vector<double> result(abundances.size());\n    for (size_t elem=0; elem<abundances.size(); ++elem) {\n      result[elem] = rho * abundances[elem].massFraction\n                     \/ (mp * abundances[elem].element.A);\n    }\n    return result;\n  }\n\n  class ChiFunction : public GslFunction {\n    const double ne_target_;\n    const double kt_;\n    const double tau_;\n    public:\n    ChiFunction(const double ne_t, const double kt, const double tau)\n      : ne_target_(ne_t), kt_(kt), tau_(tau) {}\n    double f(const double chi) const {\n      \/\/ argument phi = 0 in this rootfind\n      return ne_target_ - Plasma::ne(chi, 0.0, kt_, tau_);\n    }\n  };\n\n  double invertForChi(const double ne, const double kt, const double tau) {\n    \/\/ start by initializing some values\n    const ChiFunction func(ne, kt, tau);\n\n    \/\/ find a chi interval which brackets the root\n    \/\/ ne(chi) is an INCREASING function, so ChiFunction(chi) is DECREASING\n    double chiA = 0;\n    double deltaA = func.f(chiA);\n    if (deltaA == 0.0) return chiA;\n    double chiB = (deltaA > 0) - (deltaA < 0); \/\/ this is the sign operator\n    double deltaB = func.f(chiB);\n    while (deltaA*deltaB > 0.0) {\n      chiA = chiB;\n      deltaA = deltaB;\n      chiB = 2*chiB;\n      deltaB = func.f(chiB);\n    }\n\n    \/\/ find the root\n    const double chi_eps = std::numeric_limits<double>::epsilon();\n    return GslBrent(func, chiA, chiB, chi_eps);\n  }\n\n} \/\/ helper namespace\n\n\n\nPlasmaState::\nPlasmaState(const double rho, const double kt, const Composition& comp,\n    const bool isRel)\n: rho(rho),\n  kt(kt),\n  comp(comp),\n  isRelativistic(isRel),\n  ne(computeNe(rho, comp)),\n  ni(computeNi(rho, comp)),\n  tau(isRel ? (kt \/ PhysicalConstantsCGS::MeCC) : 0.0),\n  chi(invertForChi(ne, kt, tau))\n{\n  assert(kt>0);\n  assert(rho>0);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ PythonStuff.cpp\n\/\/ Copyright (c) 2009, Dan Heeks\n\/\/ This program is released under the BSD license. See the file COPYING for details.\n\n#include \"stdafx.h\"\n#include <wx\/file.h>\n#include <wx\/mimetype.h>\n#include <wx\/stdpaths.h>\n#include <wx\/filename.h>\n#include <wx\/txtstrm.h>\n#include <wx\/log.h>\n#include \"PythonStuff.h\"\n#include \"ProgramCanvas.h\"\n#include \"OutputCanvas.h\"\n#include \"Program.h\"\n#include \"CNCConfig.h\"\n#include \"interface\/PropertyString.h\"\n\n\/\/static\nbool CPyProcess::redirect = false;\n\nCPyProcess::CPyProcess(void)\n{\n  m_pid = 0;\n  wxProcess(heeksCAD->GetMainFrame());\n  Connect(wxEVT_TIMER, wxTimerEventHandler(CPyProcess::OnTimer));\n  m_timer.SetOwner(this);\n\n}\n\nvoid CPyProcess::OnTimer(wxTimerEvent& event)\n{\n  HandleInput();\n}\n\nvoid CPyProcess::HandleInput(void) {\n\twxInputStream *m_in, *m_err;\n\n\tm_in = GetInputStream();\n\tm_err = GetErrorStream();\n\n\tif (m_in) {\n\t\twxString s;\n\t\twhile (m_in->CanRead()) {\n\t\t\tchar buffer[4096];\n\t\t\tm_in->Read(buffer, sizeof(buffer));\n\t\t\ts += wxString::From8BitData(buffer, m_in->LastRead());\n\t\t}\n\t\tif (s.Length() > 0) {\n\t\t\twxLogMessage(_T(\"> %s\"), s.c_str());\n\t\t}\n\t}\n\tif (m_err) {\n\t\twxString s;\n\t\twhile (m_err->CanRead()) {\n\t\t\tchar buffer[4096];\n\t\t\tm_err->Read(buffer, sizeof(buffer));\n\t\t\ts += wxString::From8BitData(buffer, m_err->LastRead());\n\t\t}\n\t\tif (s.Length() > 0) {\n\t\t\twxLogMessage(_T(\"! %s\"), s.c_str());\n\t\t}\n\t}\n}\n\nvoid CPyProcess::Execute(const wxChar* cmd)\n{\n\tif(redirect) {\n\t\tRedirect();\n\t}\n\t\/\/ make process group leader so Cancel kan terminate process including children\n\tm_pid = wxExecute(cmd, wxEXEC_ASYNC|wxEXEC_MAKE_GROUP_LEADER, this);\n\tif (!m_pid) {\n\t  wxLogMessage(_T(\"could not execute '%s'\"),cmd);\n\t} else {\n\t  wxLogMessage(_T(\"starting '%s' (%d)\"),cmd,m_pid);\n\t}\n\tif (redirect) {\n\t\tm_timer.Start(100);   \/\/msec\n\t}\n}\n\nvoid CPyProcess::Cancel(void)\n{\n\tif (m_pid)\n\t{\n\t\twxKillError kerror;\n\t\twxSignal sig = wxSIGTERM;\n\t\tint retcode;\n\n\t\tif ( wxProcess::Exists(m_pid) ) {\n\t\t\tretcode = wxKill(m_pid, sig, &kerror, wxKILL_CHILDREN);\n\t\t\tswitch (kerror) {\n\t\t\tcase wxKILL_OK:\n\t\t\t\twxLogMessage(_T(\"sent signal %d to process %d\"),sig, m_pid);\n\t\t\t\tbreak;\n\t\t\tcase wxKILL_NO_PROCESS:\n\t\t\t\twxLogMessage(_T(\"process %d already exited\"),m_pid);\n\t\t\t\tbreak;\n\t\t\tcase wxKILL_ACCESS_DENIED:\n\t\t\t\twxLogMessage(_T(\"sending signal %d to process %d - access denied\"),sig, m_pid);\n\t\t\t\tbreak;\n\t\t\tcase wxKILL_BAD_SIGNAL:      \/\/ no such signal\n\t\t\t\twxLogMessage(_T(\"no such signal: %d\"),sig);\n\t\t\t\tbreak;\n\t\t\tcase wxKILL_ERROR:            \/\/ another, unspecified error\n\t\t\t\twxLogMessage(_T(\"unspecified error sending signal %d to process %d\"),sig, m_pid);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t} else {\n\t\t\twxLogMessage(_T(\"process %d has gone away\"), m_pid);\n\t\t}\n\t\tm_pid = 0;\n\t}\n}\n\nvoid CPyProcess::OnTerminate(int pid, int status)\n{\n\tif (pid == m_pid)\n\t{\n\t  if (redirect) {\n\t\t  m_timer.Stop();\n\t\t  HandleInput();   \/\/ anything left?\n\t  }\n\t  if (status) {\n\t\t  wxLogMessage(_T(\"process %d exit(%d)\"),pid, status);\n\t  } else {\n\t\t  wxLogDebug(_T(\"process %d exit(0)\"),pid);\n\t  }\n\t  m_pid = 0;\n\t  ThenDo();\n\t}\n\t\/\/ else: the process already was already treated with Cancel() so m_pid is 0\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass CPyBackPlot : public CPyProcess\n{\nprotected:\n\tconst CProgram* m_program;\n\tHeeksObj* m_into;\n\twxString m_filename;\n\twxBusyCursor *m_busy_cursor;\n\n\tstatic CPyBackPlot* m_object;\n\npublic:\n\tCPyBackPlot(const CProgram* program, HeeksObj* into, const wxChar* filename): m_program(program), m_into(into),m_filename(filename),m_busy_cursor(NULL) { m_object = this; }\n\t~CPyBackPlot(void) { m_object = NULL; }\n\n\tstatic void StaticCancel(void) { if (m_object) m_object->Cancel(); }\n\n\tvoid Do(void)\n\t{\n\t\tif(m_busy_cursor == NULL)m_busy_cursor = new wxBusyCursor();\n\n\t\tif (m_program->m_machine.file_name == _T(\"not found\"))\n\t\t{\n\t\t\twxMessageBox(_T(\"Machine name (defined in Program Properties) not found\"));\n\t\t} \/\/ End if - then\n\t\telse\n\t\t{\n\t\t\t#ifdef WIN32\n\t\t\t\tExecute(wxString(_T(\"\\\"\")) + theApp.GetDllFolder() + _T(\"\\\\nc_read.bat\\\" \") + m_program->m_machine.file_name + _T(\" \\\"\") + m_filename + _T(\"\\\"\"));\n\t\t\t#else\n\t\t\t\t#ifdef RUNINPLACE\n\t\t\t\t\twxString path(theApp.GetDllFolder() +_T(\"\/..\/nc\/\"));\n\t\t\t\t#else\n\t\t\t\t\t#ifdef CMAKE_UNIX\n\t\t\t\t\t\twxString path(_T(\"\/usr\/lib\/heekscnc\/nc\/\"));\n\t\t\t\t\t#else\n\t\t\t\t\t\twxString path(theApp.GetDllFolder() + _T(\"\/..\/heekscnc\/nc\/\"));\n\t\t\t\t\t#endif\n\t\t\t\t#endif\n\n\t\t\t\tExecute(wxString(_T(\"python \\\"\")) + path + wxString(_T(\"backplot.py\\\" \\\"\")) + m_program->m_machine.file_name + wxString(_T(\"\\\" \\\"\")) + m_filename + wxString(_T(\"\\\"\")) );\n\t\t\t#endif\n\t\t} \/\/ End if - else\n\t}\n\tvoid ThenDo(void)\n\t{\n\t\t\/\/ there should now be a .nc.xml written\n\t\twxString xml_file_str = m_filename + wxString(_T(\".nc.xml\"));\n\t\twxFile ofs(xml_file_str.c_str());\n\t\tif(!ofs.IsOpened())\n\t\t{\n\t\t\twxMessageBox(wxString(_(\"Couldn't open file\")) + _T(\" - \") + xml_file_str);\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ read the xml file, just like paste, into the program\n\t\theeksCAD->OpenXMLFile(xml_file_str, m_into);\n\t\theeksCAD->Repaint();\n\n\t\t\/\/ in Windows, at least, executing the bat file was making HeeksCAD change it's Z order\n\t\theeksCAD->GetMainFrame()->Raise();\n\n\t\tdelete m_busy_cursor;\n\t\tm_busy_cursor = NULL;\n\t}\n};\n\nCPyBackPlot* CPyBackPlot::m_object = NULL;\n\nclass CPyPostProcess : public CPyProcess\n{\nprotected:\n\tconst CProgram* m_program;\n\twxString m_filename;\n\tbool m_include_backplot_processing;\n\n\tstatic CPyPostProcess* m_object;\n\npublic:\n\tCPyPostProcess(const CProgram* program,\n\t\t\tconst wxChar* filename,\n\t\t\tconst bool include_backplot_processing = true ) :\n\t\tm_program(program), m_filename(filename), m_include_backplot_processing(include_backplot_processing)\n\t{\n\t\tm_object = this;\n\t}\n\n\t~CPyPostProcess(void) { m_object = NULL; }\n\n\tstatic void StaticCancel(void) { if (m_object) m_object->Cancel(); }\n\n\tvoid Do(void)\n\t{\n\t\twxBusyCursor wait; \/\/ show an hour glass until the end of this function\n\t\twxStandardPaths standard_paths;\n\t\twxFileName path( standard_paths.GetTempDir().c_str(), _T(\"post.py\"));\n\n#ifdef WIN32\n        Execute(wxString(_T(\"\\\"\")) + theApp.GetDllFolder() + wxString(_T(\"\\\\post.bat\\\" \\\"\")) + path.GetFullPath() + wxString(_T(\"\\\"\")));\n#else\n\n        wxString post_path = wxString(_T(\"python \")) + path.GetFullPath();\n\t\tExecute(post_path);\n#endif\n\t}\n\tvoid ThenDo(void)\n\t{\n\t\tif (m_include_backplot_processing)\n\t\t{\n\t\t\t(new CPyBackPlot(m_program, (HeeksObj*)m_program, m_filename))->Do();\n\t\t}\n\t}\n};\n\nCPyPostProcess* CPyPostProcess::m_object = NULL;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic bool write_python_file(const wxString& python_file_path)\n{\n\twxFile ofs(python_file_path.c_str(), wxFile::write);\n\tif(!ofs.IsOpened())return false;\n\n\tofs.Write(theApp.m_program->m_python_program.c_str());\n\n\treturn true;\n}\n\nbool HeeksPyPostProcess(const CProgram* program, const wxString &filepath, const bool include_backplot_processing)\n{\n\ttry{\n\t\ttheApp.m_output_canvas->m_textCtrl->Clear(); \/\/ clear the output window\n\n\t\t\/\/ write the python file\n\t\twxStandardPaths standard_paths;\n\t\twxFileName file_str( standard_paths.GetTempDir().c_str(), _T(\"post.py\"));\n\n\t\tif(!write_python_file(file_str.GetFullPath()))\n\t\t{\n\t\t    wxString error;\n\t\t    error << _T(\"couldn't write \") << file_str.GetFullPath();\n\t\t    wxMessageBox(error.c_str());\n\t\t}\n\t\telse\n\t\t{\n#ifdef WIN32\n\t\t\t\/\/ Set the working directory to the area that contains the DLL so that\n\t\t\t\/\/ the system can find the post.bat file correctly.\n\t\t\t::wxSetWorkingDirectory(theApp.GetDllFolder());\n#else\n\t\t\t::wxSetWorkingDirectory(standard_paths.GetTempDir());\n#endif\n\n\t\t\t\/\/ call the python file\n\t\t\t(new CPyPostProcess(program, filepath, include_backplot_processing))->Do();\n\n\t\t\treturn true;\n\t\t}\n\t}\n\tcatch(...)\n\t{\n\t\twxMessageBox(_T(\"Error while post-processing the program!\"));\n\t}\n\treturn false;\n}\n\nbool HeeksPyBackplot(const CProgram* program, HeeksObj* into, const wxString &filepath)\n{\n\ttry{\n\t\ttheApp.m_output_canvas->m_textCtrl->Clear(); \/\/ clear the output window\n\n\t\t::wxSetWorkingDirectory(theApp.GetDllFolder());\n\n\t\t\/\/ call the python file\n\t\t(new CPyBackPlot(program, into, filepath))->Do();\n\n\t\t\/\/ in Windows, at least, executing the bat file was making HeeksCAD change it's Z order\n\t\theeksCAD->GetMainFrame()->Raise();\n\n\t\treturn true;\n\t}\n\tcatch(...)\n\t{\n\t\twxMessageBox(_T(\"Error while backplotting the program!\"));\n\t}\n\treturn false;\n}\n\nvoid HeeksPyCancel(void)\n{\n\tCPyBackPlot::StaticCancel();\n\tCPyPostProcess::StaticCancel();\n}\n\n\n\/\/ create a temporary ngc file\n\/\/ make your favorite machine load it\nvoid CSendToMachine::Cancel(void) { CPyProcess::Cancel(); }\nvoid CSendToMachine::SendGCode(const wxChar *gcode)\n\t{\n\t\twxBusyCursor wait; \/\/ show an hour glass until the end of this function\n\n\t\t\/\/ write the ngc file\n\t\twxStandardPaths standard_paths;\n\t\twxFileName ngcpath( standard_paths.GetTempDir().c_str(), wxString::Format(_T(\"heekscnc-%d.ngc\"), m_serial));\n\t\tm_serial++;\n\t\t{\n\t\t\twxFile ofs(ngcpath.GetFullPath(), wxFile::write);\n\t\t\tif(!ofs.IsOpened())\n\t\t\t{\n\t\t\t\twxMessageBox(wxString(_(\"Couldn't open file\")) + _T(\" - \") + ngcpath.GetFullPath());\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tofs.Write(theApp.m_output_canvas->m_textCtrl->GetValue());\n\t\t}\n\t\twxLogDebug(_T(\"created '%s')\"), ngcpath.GetFullPath().c_str());\n\n#ifdef WIN32\n        Execute(wxString(_T(\"\\\"\")) + theApp.GetDllFolder() +wxString(_T(\"\\\\\")) + m_command + wxString(_T(\"\\\" \\\"\")) + ngcpath.GetFullPath() + wxString(_T(\"\\\"\")));\n#else\n        wxString sendto_cmdline = m_command + wxString(_T(\" \")) + ngcpath.GetFullPath();\n        wxLogDebug(_T(\"executing '%s')\"), sendto_cmdline.c_str());\n\t\tExecute(sendto_cmdline);\n#endif\n\t}\n\n\nint CSendToMachine::m_serial;\nwxString CSendToMachine::m_command;\n\nstatic void on_set_to_machine_command(const wxChar *value, HeeksObj* object)\n{\n\tCSendToMachine::m_command = value;\n\tCSendToMachine::WriteToConfig();\n}\n\n\/\/ static\nvoid CSendToMachine::GetOptions(std::list<Property *> *list)\n{\n\tlist->push_back(new PropertyString(_(\"send-to-machine command\"), m_command, NULL, on_set_to_machine_command));\n}\n\n\/\/ static\nvoid CSendToMachine::ReadFromConfig()\n{\n        CNCConfig config(CSendToMachine::ConfigScope());\n        config.Read(_T(\"SendToMachineCommand\"), &m_command , _T(\"axis-remote\"));\n}\n\/\/ static\nvoid CSendToMachine::WriteToConfig()\n{\n        CNCConfig config(CSendToMachine::ConfigScope());\n        config.Write(_T(\"SendToMachineCommand\"), m_command);\n}\n\n\nstatic CSendToMachine *send_to;\n\nbool HeeksSendToMachine(const wxString &gcode)\n{\n\tif (send_to != NULL) {\n\t\tsend_to->Cancel();\n\t\tdelete send_to;\n\t}\n\tsend_to = new CSendToMachine;\n\tsend_to->SendGCode(gcode);\n\n\treturn false;\n}\n\n<commit_msg>trying again<commit_after>\/\/ PythonStuff.cpp\n\/\/ Copyright (c) 2009, Dan Heeks\n\/\/ This program is released under the BSD license. See the file COPYING for details.\n\n#include \"stdafx.h\"\n#include <wx\/file.h>\n#include <wx\/mimetype.h>\n#include <wx\/stdpaths.h>\n#include <wx\/filename.h>\n#include <wx\/txtstrm.h>\n#include <wx\/log.h>\n#include \"PythonStuff.h\"\n#include \"ProgramCanvas.h\"\n#include \"OutputCanvas.h\"\n#include \"Program.h\"\n#include \"CNCConfig.h\"\n#include \"interface\/PropertyString.h\"\n\n\/\/static\nbool CPyProcess::redirect = false;\n\nCPyProcess::CPyProcess(void)\n{\n  m_pid = 0;\n  wxProcess(heeksCAD->GetMainFrame());\n  Connect(wxEVT_TIMER, wxTimerEventHandler(CPyProcess::OnTimer));\n  m_timer.SetOwner(this);\n\n}\n\nvoid CPyProcess::OnTimer(wxTimerEvent& event)\n{\n  HandleInput();\n}\n\nvoid CPyProcess::HandleInput(void) {\n\twxInputStream *m_in, *m_err;\n\n\tm_in = GetInputStream();\n\tm_err = GetErrorStream();\n\n\tif (m_in) {\n\t\twxString s;\n\t\twhile (m_in->CanRead()) {\n\t\t\tchar buffer[4096];\n\t\t\tm_in->Read(buffer, sizeof(buffer));\n\t\t\ts += wxString::From8BitData(buffer, m_in->LastRead());\n\t\t}\n\t\tif (s.Length() > 0) {\n\t\t\twxLogMessage(_T(\"> %s\"), s.c_str());\n\t\t}\n\t}\n\tif (m_err) {\n\t\twxString s;\n\t\twhile (m_err->CanRead()) {\n\t\t\tchar buffer[4096];\n\t\t\tm_err->Read(buffer, sizeof(buffer));\n\t\t\ts += wxString::From8BitData(buffer, m_err->LastRead());\n\t\t}\n\t\tif (s.Length() > 0) {\n\t\t\twxLogMessage(_T(\"! %s\"), s.c_str());\n\t\t}\n\t}\n}\n\nvoid CPyProcess::Execute(const wxChar* cmd)\n{\n\tif(redirect) {\n\t\tRedirect();\n\t}\n\t\/\/ make process group leader so Cancel kan terminate process including children\n\tm_pid = wxExecute(cmd, wxEXEC_ASYNC|wxEXEC_MAKE_GROUP_LEADER, this);\n\tif (!m_pid) {\n\t  wxLogMessage(_T(\"could not execute '%s'\"),cmd);\n\t} else {\n\t  wxLogMessage(_T(\"starting '%s' (%d)\"),cmd,m_pid);\n\t}\n\tif (redirect) {\n\t\tm_timer.Start(100);   \/\/msec\n\t}\n}\n\nvoid CPyProcess::Cancel(void)\n{\n\tif (m_pid)\n\t{\n\t\twxKillError kerror;\n\t\twxSignal sig = wxSIGTERM;\n\t\tint retcode;\n\n\t\tif ( wxProcess::Exists(m_pid) ) {\n\t\t\tretcode = wxKill(m_pid, sig, &kerror, wxKILL_CHILDREN);\n\t\t\tswitch (kerror) {\n\t\t\tcase wxKILL_OK:\n\t\t\t\twxLogMessage(_T(\"sent signal %d to process %d\"),sig, m_pid);\n\t\t\t\tbreak;\n\t\t\tcase wxKILL_NO_PROCESS:\n\t\t\t\twxLogMessage(_T(\"process %d already exited\"),m_pid);\n\t\t\t\tbreak;\n\t\t\tcase wxKILL_ACCESS_DENIED:\n\t\t\t\twxLogMessage(_T(\"sending signal %d to process %d - access denied\"),sig, m_pid);\n\t\t\t\tbreak;\n\t\t\tcase wxKILL_BAD_SIGNAL:      \/\/ no such signal\n\t\t\t\twxLogMessage(_T(\"no such signal: %d\"),sig);\n\t\t\t\tbreak;\n\t\t\tcase wxKILL_ERROR:            \/\/ another, unspecified error\n\t\t\t\twxLogMessage(_T(\"unspecified error sending signal %d to process %d\"),sig, m_pid);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t} else {\n\t\t\twxLogMessage(_T(\"process %d has gone away\"), m_pid);\n\t\t}\n\t\tm_pid = 0;\n\t}\n}\n\nvoid CPyProcess::OnTerminate(int pid, int status)\n{\n\tif (pid == m_pid)\n\t{\n\t  if (redirect) {\n\t\t  m_timer.Stop();\n\t\t  HandleInput();   \/\/ anything left?\n\t  }\n\t  if (status) {\n\t\t  wxLogMessage(_T(\"process %d exit(%d)\"),pid, status);\n\t  } else {\n\t\t  wxLogDebug(_T(\"process %d exit(0)\"),pid);\n\t  }\n\t  m_pid = 0;\n\t  ThenDo();\n\t}\n\t\/\/ else: the process already was already treated with Cancel() so m_pid is 0\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass CPyBackPlot : public CPyProcess\n{\nprotected:\n\tconst CProgram* m_program;\n\tHeeksObj* m_into;\n\twxString m_filename;\n\twxBusyCursor *m_busy_cursor;\n\n\tstatic CPyBackPlot* m_object;\n\npublic:\n\tCPyBackPlot(const CProgram* program, HeeksObj* into, const wxChar* filename): m_program(program), m_into(into),m_filename(filename),m_busy_cursor(NULL) { m_object = this; }\n\t~CPyBackPlot(void) { m_object = NULL; }\n\n\tstatic void StaticCancel(void) { if (m_object) m_object->Cancel(); }\n\n\tvoid Do(void)\n\t{\n\t\tif(m_busy_cursor == NULL)m_busy_cursor = new wxBusyCursor();\n\n\t\tif (m_program->m_machine.file_name == _T(\"not found\"))\n\t\t{\n\t\t\twxMessageBox(_T(\"Machine name (defined in Program Properties) not found\"));\n\t\t} \/\/ End if - then\n\t\telse\n\t\t{\n\t\t\t#ifdef WIN32\n\t\t\t\tExecute(wxString(_T(\"\\\"\")) + theApp.GetDllFolder() + _T(\"\\\\nc_read.bat\\\" \") + m_program->m_machine.file_name + _T(\" \\\"\") + m_filename + _T(\"\\\"\"));\n\t\t\t#else\n\t\t\t\t#ifdef RUNINPLACE\n\t\t\t\t\twxString path(theApp.GetDllFolder() +_T(\"\/..\/\"));\n\t\t\t\t#else\n\t\t\t\t\t#ifdef CMAKE_UNIX\n\t\t\t\t\t\twxString path(_T(\"\/usr\/lib\/heekscnc\/\"));\n\t\t\t\t\t#else\n\t\t\t\t\t\twxString path(theApp.GetDllFolder() + _T(\"\/..\/heekscnc\/\"));\n\t\t\t\t\t#endif\n\t\t\t\t#endif\n\n\t\t\t\tExecute(wxString(_T(\"python \\\"\")) + path + wxString(_T(\"backplot.py\\\" \\\"\")) + m_program->m_machine.file_name + wxString(_T(\"\\\" \\\"\")) + m_filename + wxString(_T(\"\\\"\")) );\n\t\t\t#endif\n\t\t} \/\/ End if - else\n\t}\n\tvoid ThenDo(void)\n\t{\n\t\t\/\/ there should now be a .nc.xml written\n\t\twxString xml_file_str = m_filename + wxString(_T(\".nc.xml\"));\n\t\twxFile ofs(xml_file_str.c_str());\n\t\tif(!ofs.IsOpened())\n\t\t{\n\t\t\twxMessageBox(wxString(_(\"Couldn't open file\")) + _T(\" - \") + xml_file_str);\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ read the xml file, just like paste, into the program\n\t\theeksCAD->OpenXMLFile(xml_file_str, m_into);\n\t\theeksCAD->Repaint();\n\n\t\t\/\/ in Windows, at least, executing the bat file was making HeeksCAD change it's Z order\n\t\theeksCAD->GetMainFrame()->Raise();\n\n\t\tdelete m_busy_cursor;\n\t\tm_busy_cursor = NULL;\n\t}\n};\n\nCPyBackPlot* CPyBackPlot::m_object = NULL;\n\nclass CPyPostProcess : public CPyProcess\n{\nprotected:\n\tconst CProgram* m_program;\n\twxString m_filename;\n\tbool m_include_backplot_processing;\n\n\tstatic CPyPostProcess* m_object;\n\npublic:\n\tCPyPostProcess(const CProgram* program,\n\t\t\tconst wxChar* filename,\n\t\t\tconst bool include_backplot_processing = true ) :\n\t\tm_program(program), m_filename(filename), m_include_backplot_processing(include_backplot_processing)\n\t{\n\t\tm_object = this;\n\t}\n\n\t~CPyPostProcess(void) { m_object = NULL; }\n\n\tstatic void StaticCancel(void) { if (m_object) m_object->Cancel(); }\n\n\tvoid Do(void)\n\t{\n\t\twxBusyCursor wait; \/\/ show an hour glass until the end of this function\n\t\twxStandardPaths standard_paths;\n\t\twxFileName path( standard_paths.GetTempDir().c_str(), _T(\"post.py\"));\n\n#ifdef WIN32\n        Execute(wxString(_T(\"\\\"\")) + theApp.GetDllFolder() + wxString(_T(\"\\\\post.bat\\\" \\\"\")) + path.GetFullPath() + wxString(_T(\"\\\"\")));\n#else\n\n        wxString post_path = wxString(_T(\"python \")) + path.GetFullPath();\n\t\tExecute(post_path);\n#endif\n\t}\n\tvoid ThenDo(void)\n\t{\n\t\tif (m_include_backplot_processing)\n\t\t{\n\t\t\t(new CPyBackPlot(m_program, (HeeksObj*)m_program, m_filename))->Do();\n\t\t}\n\t}\n};\n\nCPyPostProcess* CPyPostProcess::m_object = NULL;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic bool write_python_file(const wxString& python_file_path)\n{\n\twxFile ofs(python_file_path.c_str(), wxFile::write);\n\tif(!ofs.IsOpened())return false;\n\n\tofs.Write(theApp.m_program->m_python_program.c_str());\n\n\treturn true;\n}\n\nbool HeeksPyPostProcess(const CProgram* program, const wxString &filepath, const bool include_backplot_processing)\n{\n\ttry{\n\t\ttheApp.m_output_canvas->m_textCtrl->Clear(); \/\/ clear the output window\n\n\t\t\/\/ write the python file\n\t\twxStandardPaths standard_paths;\n\t\twxFileName file_str( standard_paths.GetTempDir().c_str(), _T(\"post.py\"));\n\n\t\tif(!write_python_file(file_str.GetFullPath()))\n\t\t{\n\t\t    wxString error;\n\t\t    error << _T(\"couldn't write \") << file_str.GetFullPath();\n\t\t    wxMessageBox(error.c_str());\n\t\t}\n\t\telse\n\t\t{\n#ifdef WIN32\n\t\t\t\/\/ Set the working directory to the area that contains the DLL so that\n\t\t\t\/\/ the system can find the post.bat file correctly.\n\t\t\t::wxSetWorkingDirectory(theApp.GetDllFolder());\n#else\n\t\t\t::wxSetWorkingDirectory(standard_paths.GetTempDir());\n#endif\n\n\t\t\t\/\/ call the python file\n\t\t\t(new CPyPostProcess(program, filepath, include_backplot_processing))->Do();\n\n\t\t\treturn true;\n\t\t}\n\t}\n\tcatch(...)\n\t{\n\t\twxMessageBox(_T(\"Error while post-processing the program!\"));\n\t}\n\treturn false;\n}\n\nbool HeeksPyBackplot(const CProgram* program, HeeksObj* into, const wxString &filepath)\n{\n\ttry{\n\t\ttheApp.m_output_canvas->m_textCtrl->Clear(); \/\/ clear the output window\n\n\t\t::wxSetWorkingDirectory(theApp.GetDllFolder());\n\n\t\t\/\/ call the python file\n\t\t(new CPyBackPlot(program, into, filepath))->Do();\n\n\t\t\/\/ in Windows, at least, executing the bat file was making HeeksCAD change it's Z order\n\t\theeksCAD->GetMainFrame()->Raise();\n\n\t\treturn true;\n\t}\n\tcatch(...)\n\t{\n\t\twxMessageBox(_T(\"Error while backplotting the program!\"));\n\t}\n\treturn false;\n}\n\nvoid HeeksPyCancel(void)\n{\n\tCPyBackPlot::StaticCancel();\n\tCPyPostProcess::StaticCancel();\n}\n\n\n\/\/ create a temporary ngc file\n\/\/ make your favorite machine load it\nvoid CSendToMachine::Cancel(void) { CPyProcess::Cancel(); }\nvoid CSendToMachine::SendGCode(const wxChar *gcode)\n\t{\n\t\twxBusyCursor wait; \/\/ show an hour glass until the end of this function\n\n\t\t\/\/ write the ngc file\n\t\twxStandardPaths standard_paths;\n\t\twxFileName ngcpath( standard_paths.GetTempDir().c_str(), wxString::Format(_T(\"heekscnc-%d.ngc\"), m_serial));\n\t\tm_serial++;\n\t\t{\n\t\t\twxFile ofs(ngcpath.GetFullPath(), wxFile::write);\n\t\t\tif(!ofs.IsOpened())\n\t\t\t{\n\t\t\t\twxMessageBox(wxString(_(\"Couldn't open file\")) + _T(\" - \") + ngcpath.GetFullPath());\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tofs.Write(theApp.m_output_canvas->m_textCtrl->GetValue());\n\t\t}\n\t\twxLogDebug(_T(\"created '%s')\"), ngcpath.GetFullPath().c_str());\n\n#ifdef WIN32\n        Execute(wxString(_T(\"\\\"\")) + theApp.GetDllFolder() +wxString(_T(\"\\\\\")) + m_command + wxString(_T(\"\\\" \\\"\")) + ngcpath.GetFullPath() + wxString(_T(\"\\\"\")));\n#else\n        wxString sendto_cmdline = m_command + wxString(_T(\" \")) + ngcpath.GetFullPath();\n        wxLogDebug(_T(\"executing '%s')\"), sendto_cmdline.c_str());\n\t\tExecute(sendto_cmdline);\n#endif\n\t}\n\n\nint CSendToMachine::m_serial;\nwxString CSendToMachine::m_command;\n\nstatic void on_set_to_machine_command(const wxChar *value, HeeksObj* object)\n{\n\tCSendToMachine::m_command = value;\n\tCSendToMachine::WriteToConfig();\n}\n\n\/\/ static\nvoid CSendToMachine::GetOptions(std::list<Property *> *list)\n{\n\tlist->push_back(new PropertyString(_(\"send-to-machine command\"), m_command, NULL, on_set_to_machine_command));\n}\n\n\/\/ static\nvoid CSendToMachine::ReadFromConfig()\n{\n        CNCConfig config(CSendToMachine::ConfigScope());\n        config.Read(_T(\"SendToMachineCommand\"), &m_command , _T(\"axis-remote\"));\n}\n\/\/ static\nvoid CSendToMachine::WriteToConfig()\n{\n        CNCConfig config(CSendToMachine::ConfigScope());\n        config.Write(_T(\"SendToMachineCommand\"), m_command);\n}\n\n\nstatic CSendToMachine *send_to;\n\nbool HeeksSendToMachine(const wxString &gcode)\n{\n\tif (send_to != NULL) {\n\t\tsend_to->Cancel();\n\t\tdelete send_to;\n\t}\n\tsend_to = new CSendToMachine;\n\tsend_to->SendGCode(gcode);\n\n\treturn false;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"SceneViewer.h\"\n#include \"Utils.h\"\n\n#include <stdlib.h>\n\n\/\/ Declare our game instance\nSceneViewer game;\n\nSceneViewer::SceneViewer()\n   : _scene(NULL),_form(NULL),_selected(NULL),\n     _sliderLightVectorX(NULL),_sliderLightVectorY(NULL),_sliderLightVectorZ(NULL),\n     _sliderClearColorRed(NULL),_sliderClearColorGreen(NULL),_sliderClearColorBlue(NULL),\n     _bPlayAll(NULL),_bPlaySelected(NULL)\n{\n}\n\nvoid SceneViewer::initialize()\n{\n   \/\/ Load game scene from file\n\n    int argc; \n    char **argv;\n    this->getArguments(&argc, &argv);\n    if (argc<2) {\n       _scene = Scene::load(\"res\/scene.gpb\");\n\t   if (!_scene)\n\t   {\n\t\t   LOG(\"Could not load res\/scene.gpb\");\n\t\t   exit();\n\t   }\n\t}\n\telse {\n        std::string path = std::string(\"res\/\")+std::string(argv[1])+std::string(\".gpb\");\n        puts(path.c_str());\n        _scene = Scene::load(path.c_str());\n\t\tif (!_scene)\n\t\t{\n\t\t\tLOG(\"Could not load %s\", path.c_str());\n\t\t\texit();\n\t\t}\n\t}\n\n   _shift_key = false;\n   _control_key = false;\n   _rotate_active = true;\n   _pan_active = false;\n   _zoom_active = false;\n   _touch_x = 0;\n   _touch_y = 0;\n   _grid_on = 1;\n\n\n   Camera * cam = _scene->getActiveCamera();\n   if (cam) {\n      \/\/ Set the aspect ratio for the scene's camera to match the current resolution\n      cam->setAspectRatio(getAspectRatio());\n      cam->getNode()->rotateY(MATH_DEG_TO_RAD(-90));\n   }\n\n   \/\/ Try to use any significant light source for the scene light vector.\n   \/\/ This is just a temporary hack until I manage to tap into the\n   \/\/ material file from the python addon.\n   Node * light = _scene->findNode(\"Spot\") ? _scene->findNode(\"Spot\") :\n                                             _scene->findNode(\"Area\") ? _scene->findNode(\"Area\") :\n                                                                        _scene->findNode(\"Sun\") ? _scene->findNode(\"Sun\") : 0;\n   if (light) _directionalLightVector = light->getForwardVector();\n\n   \/\/ Setup the form and callbacks\n   _form = Form::create(\"res\/editor.form\");\n   _sliderLightVectorX = (Slider *)_form->getControl(\"lvx\");\n   _sliderLightVectorY = (Slider *)_form->getControl(\"lvy\");\n   _sliderLightVectorZ = (Slider *)_form->getControl(\"lvz\");\n   _sliderClearColorRed = (Slider *)_form->getControl(\"ccRed\");\n   _sliderClearColorGreen = (Slider *)_form->getControl(\"ccGreen\");\n   _sliderClearColorBlue = (Slider *)_form->getControl(\"ccBlue\");\n   _bPlayAll = (Button *)_form->getControl(\"playAll\");\n   _bPlaySelected = (Button *)_form->getControl(\"playSelected\");\n   _bPlaySelected->setEnabled(false);\n\n   _gridCheckBox = static_cast<CheckBox*>(_form->getControl(\"gridCheckBox\"));\n\n\n\n   Slider * sliders[] = { _sliderLightVectorX, _sliderLightVectorY, _sliderLightVectorZ,\n                        _sliderClearColorRed, _sliderClearColorGreen, _sliderClearColorBlue }, *s;\n   FOREACH(s, sliders) {\n      s->addListener(this, Listener::VALUE_CHANGED);\n   }\n\n   _bPlayAll->addListener(this, Listener::CLICK);\n   _bPlaySelected->addListener(this, Listener::CLICK);\n\n   _gridCheckBox->addListener(this, Control::Listener::VALUE_CHANGED);\n   _gridCheckBox->setEnabled(true);\n\n   \/\/ Set the metarial lighting\n   _scene->visit(this, &SceneViewer::setLights);\n\n   _clearColor = Vector4::zero();\n\n   \/\/ let add a node to have the Camera looking at\n   Node *rootNode = _scene->addNode(\"root\");\n   rootNode->setTranslation(0, 0, 0);\n   Node *cameraNode = _scene->getActiveCamera()->getNode();\n   rootNode->addChild(cameraNode);\n\n   \/\/ Create the grid and add it to the scene.\n   Model* model = createGridModel();\n   _scene->addNode(\"grid\")->setModel(model);\n   model->release();\n}\n\nvoid SceneViewer::finalize()\n{\n   SAFE_RELEASE(_form);\n   SAFE_RELEASE(_scene);\n}\n\nbool SceneViewer::setLights(Node* node)\n{\n   if (node->getModel()) {\n      Material * m = node->getModel()->getMaterial(0);\n\t  if (m != NULL)\n\t  {\n\t\t  m->getTechnique()->getParameter(\"u_directionalLightColor[0]\")->setValue(Vector3(1, 1, 1));\n\t\t  m->getTechnique()->getParameter(\"u_directionalLightDirection[0]\")->setValue(_directionalLightVector);\n\t  }\n   }\n   return true;\n}\n\nvoid SceneViewer::update(float elapsedTime)\n{\n\n}\n\nvoid SceneViewer::render(float elapsedTime)\n{\n   \/\/ Clear the color and depth buffers\n   clear(CLEAR_COLOR_DEPTH, _clearColor, 1.0f, 0);\n\n   \/\/ Visit all the nodes in the scene for drawing\n   _scene->visit(this, &SceneViewer::drawScene);\n   _form->draw();\n}\n\nvoid SceneViewer::playNodeAmination(Node * node)\n{\n   Animation * anim = node->getAnimation(\"animations\");\n   if (anim==NULL) anim = node->getAnimation();\n   if (anim) {\n      if (anim->getDuration()>1)\n         anim->play();\n   }\n}\n\nbool SceneViewer::startAnims(Node* node)\n{\n   if (node->getModel()) {\n      this->playNodeAmination(node);\n   }\n   return false;\n}\n\nbool SceneViewer::drawScene(Node* node)\n{\n   \/\/ If the node visited contains a model, draw it\n   Model* model = node->getModel();\n   std::string id = node->getId();\n   \/\/LOG(\"nodel id=%s\", id.c_str());\n   if (model && (id.compare(0, 5, \"grid\") == 0)) {\n      if (_gridCheckBox->isChecked())\n         model->draw();\n      \/\/LOG(\"nodel id=%s\", id.c_str());\n   }\n   else if (model\/* && id.compare(0,1,\"_\")*\/)\n   {\n      model->draw();\n   }\n   return true;\n}\n\n\/\/ Key Mapping for view rotation, pan and zoom\n\/\/ ===========================================\n\/\/\n\/\/ Ideally, to match Blender, we should have:\n\/\/     Rotation:  KEY_ALT                 (LMB + drag)\n\/\/     Zoom:      KEY_CTRL  + KEY_ALT     (LMB + drag)\n\/\/     PAN:       KEY_SHIFT + KEY_ALT     (LMB + drag)\n\/\/\n\/\/ However, as KEY_ALT for Win8 event seems to not be working. So the mapping will be:\n\/\/     Rotation:                          (LMB + drag)\n\/\/     PAN:       KEY_SHIFT               (LMB + drag)\n\/\/     Zoom:      KEY_CTRL                (LMB + drag)\n\nvoid SceneViewer::keyEvent(Keyboard::KeyEvent evt, int key)\n{\n   if (evt == Keyboard::KEY_PRESS)\n   {\n      switch (key)\n      {\n      case Keyboard::KEY_ESCAPE:\n         exit();\n         break;\n      case Keyboard::KEY_CTRL:\n         _control_key = true;\n         break;\n      case Keyboard::KEY_SHIFT:\n         _shift_key = true;\n         break;\n      default: break;\n\n      }\n   }\n   else if (evt == Keyboard::KEY_RELEASE) {\n      switch (key)\n      {\n      case Keyboard::KEY_CTRL:\n         _control_key = false;\n         break;\n      case Keyboard::KEY_SHIFT:\n         _shift_key = false;\n         break;\n      default: break;\n      }\n   }\n   \/\/ update view rotation, pan and zoom flags\n\/*   if (_control_key && _shift_key) {\n      _rotate_active = false;\n      _zoom_active = true;\n      _pan_active = false;\n   }\n   else *\/ if (_control_key) {\n      _rotate_active = false;\n      _zoom_active = true;\n      _pan_active = false;\n   }\n   else if (_shift_key) {\n      _rotate_active = false;\n      _zoom_active = false;\n      _pan_active = true;\n   }\n   else {\n      _rotate_active = true;\n      _zoom_active = false;\n      _pan_active = false;\n   }\n\n}\n\nvoid SceneViewer::controlEvent(Control *control, EventType evt) {\n   switch(evt) {\n   case Listener::CLICK:\n      if (control==_bPlayAll) {\n         _scene->visit(this, &SceneViewer::startAnims);\n      }\n      if (control==_bPlaySelected) {\n         this->playNodeAmination(_selected);\n      }\n      break;\n   case Listener::VALUE_CHANGED:\n      if (control==_sliderLightVectorX) {\n         _directionalLightVector.x =  _sliderLightVectorX->getValue();\n         _scene->visit(this, &SceneViewer::setLights);\n      }\n      if (control==_sliderLightVectorY) {\n         _directionalLightVector.y =  _sliderLightVectorY->getValue();\n         _scene->visit(this, &SceneViewer::setLights);\n      }\n      if (control==_sliderLightVectorZ) {\n         _directionalLightVector.z =  _sliderLightVectorZ->getValue();\n         _scene->visit(this, &SceneViewer::setLights);\n      }\n      if (control==_sliderClearColorRed) {\n         _clearColor.x = _sliderClearColorRed->getValue();\n      }\n      if (control==_sliderClearColorGreen) {\n         _clearColor.y = _sliderClearColorGreen->getValue();\n      }\n      if (control==_sliderClearColorBlue) {\n         _clearColor.z = _sliderClearColorBlue->getValue();\n      }\n   }\n}\n\nbool SceneViewer::checkScene(Node* node, Ray* ray)\n{\n   Model* model = node->getModel();\n   if (model)\n   {\n      BoundingBox worldSpaceBoundingBox(model->getMesh()->getBoundingBox());\n      worldSpaceBoundingBox.transform(node->getWorldMatrix());\n\n      float distance = FLT_MAX;\n      if( (distance = ray->intersects(worldSpaceBoundingBox)) != Ray::INTERSECTS_NONE )\n      {\n         _selected = node;\n         _bPlaySelected->setText(node->getId());\n         _bPlaySelected->setEnabled(true);\n         return true;\n      }\n   }\n   return false;\n}\n\nvoid SceneViewer::rotateCameraLocal(float pitch, float yaw)\n{\n   Node * cameraNode = _scene->getActiveCamera()->getNode();\n   cameraNode->setRotation(Quaternion::identity());\n   cameraNode->rotateY(yaw);\n   cameraNode->rotateX(pitch);\n}\n\nvoid SceneViewer::rotateCameraView(float x, float y)\n{\n   Node *rootNode = _scene->findNode(\"root\");\n   rootNode->rotateX(y);\n   rootNode->rotateY(x);\n}\nvoid SceneViewer::zoomCameraView(float x, float y)\n{\n   Node * cameraNode = _scene->getActiveCamera()->getNode();\n   cameraNode->translateForward(-y);\n}\n\nvoid SceneViewer::panCameraView(float x, float y)\n{\n   Node *rootNode = _scene->findNode(\"root\");\n   float location_x = rootNode->getTranslationX();\n   float location_y = rootNode->getTranslationY();\n   float inv_x = location_x - x;\n   rootNode->setTranslationX( inv_x );\n   rootNode->setTranslationY(location_y + y);\n}\n\nvoid SceneViewer::touchEvent(Touch::TouchEvent evt, int x, int y, unsigned int contactIndex)\n{\n   switch (evt)\n   {\n   case Touch::TOUCH_PRESS:\n      if (contactIndex == 0) {\n         _touch_x = x;\n         _touch_y = y;\n         \/\/LOG(\"snap: x=%d, Y=%d\", x, y);\n      }\n      break;\n   case Touch::TOUCH_RELEASE:\n      {\n         Ray ray;\n         Camera* camera = _scene->getActiveCamera();\n         if (camera) {\n            camera->pickRay(getViewport(), x, y, &ray);\n            _scene->visit(this, &SceneViewer::checkScene, &ray);\n         }\n      }\n      break;\n\n   case Touch::TOUCH_MOVE:\n\n      if (contactIndex == 0) {\n         int sx = 1;\n         int sy = 1;\n         int  delta_x, delta_y;\n         Node * cameraNode = _scene->getActiveCamera()->getNode();\n\n         delta_x = x - _touch_x;\n         delta_y = y - _touch_y;\n         _touch_x = x;\n         _touch_y = y;\n         if (_zoom_active) {\n            zoomCameraView(-delta_x \/ 200.f, -delta_y \/ 200.f);\n         }\n\n         if (_rotate_active) {\n            rotateCameraView(-delta_x \/ 500.f, delta_y \/ 500.f);\n         }\n\n         if (_pan_active) {\n            panCameraView(-delta_x \/ 500.f, delta_y \/ 500.f);\n         }\n      }\n\n\n      break;\n   }\n}\n\nvoid SceneViewer::lookAt(Node* node, const Vector3& eye, const Vector3& target, const Vector3& up)\n{\n   \/\/ Create lookAt matrix\n   Matrix matrix;\n   Matrix::createLookAt(eye, target, up, &matrix);\n   matrix.transpose();\n\n   \/\/ Pull rotation out of matrix\n   Quaternion rotation;\n   matrix.getRotation(&rotation);\n\n   \/\/ Set rotation on node\n   node->setRotation(rotation);\n}\n\nModel* SceneViewer::createGridModel(unsigned int lineCount)\n{\n   \/\/ There needs to be an odd number of lines\n   lineCount |= 1;\n   const unsigned int pointCount = lineCount * 4;\n   const unsigned int verticesSize = pointCount * (3 + 3);  \/\/ (3 (position(xyz) + 3 color(rgb))\n\n   std::vector<float> vertices;\n   vertices.resize(verticesSize);\n\n   const float gridLength = (float)(lineCount \/ 2);\n   float value = -gridLength;\n   for (unsigned int i = 0; i < verticesSize; ++i)\n   {\n      \/\/ Default line color is dark grey\n      Vector4 color(0.3f, 0.3f, 0.3f, 1.0f);\n\n      \/\/ Very 10th line is brighter grey\n      if (((int)value) % 10 == 0)\n      {\n         color.set(0.45f, 0.45f, 0.45f, 1.0f);\n      }\n\n      \/\/ The Z axis is blue\n      if (value == 0.0f)\n      {\n         color.set(0.15f, 0.15f, 0.7f, 1.0f);\n      }\n\n      \/\/ Build the lines\n      vertices[i] = value;\n      vertices[++i] = 0.0f;\n      vertices[++i] = -gridLength;\n      vertices[++i] = color.x;\n      vertices[++i] = color.y;\n      vertices[++i] = color.z;\n\n      vertices[++i] = value;\n      vertices[++i] = 0.0f;\n      vertices[++i] = gridLength;\n      vertices[++i] = color.x;\n      vertices[++i] = color.y;\n      vertices[++i] = color.z;\n\n      \/\/ The X axis is red\n      if (value == 0.0f)\n      {\n         color.set(0.7f, 0.15f, 0.15f, 1.0f);\n      }\n      vertices[++i] = -gridLength;\n      vertices[++i] = 0.0f;\n      vertices[++i] = value;\n      vertices[++i] = color.x;\n      vertices[++i] = color.y;\n      vertices[++i] = color.z;\n\n      vertices[++i] = gridLength;\n      vertices[++i] = 0.0f;\n      vertices[++i] = value;\n      vertices[++i] = color.x;\n      vertices[++i] = color.y;\n      vertices[++i] = color.z;\n\n      value += 1.0f;\n   }\n   VertexFormat::Element elements[] =\n   {\n      VertexFormat::Element(VertexFormat::POSITION, 3),\n      VertexFormat::Element(VertexFormat::COLOR, 3)\n   };\n   Mesh* mesh = Mesh::createMesh(VertexFormat(elements, 2), pointCount, false);\n   if (mesh == NULL)\n   {\n      return NULL;\n   }\n   mesh->setPrimitiveType(Mesh::LINES);\n   mesh->setVertexData(&vertices[0], 0, pointCount);\n\n   Model* model = Model::create(mesh);\n   model->setMaterial(\"res\/scene_viewer.material#grid\");\n   SAFE_RELEASE(mesh);\n   return model;\n}\n<commit_msg>fixed LOG macro compilation error<commit_after>#include \"SceneViewer.h\"\n#include \"Utils.h\"\n\n#include <stdlib.h>\n\n\/\/ Declare our game instance\nSceneViewer game;\n\nSceneViewer::SceneViewer()\n   : _scene(NULL),_form(NULL),_selected(NULL),\n     _sliderLightVectorX(NULL),_sliderLightVectorY(NULL),_sliderLightVectorZ(NULL),\n     _sliderClearColorRed(NULL),_sliderClearColorGreen(NULL),_sliderClearColorBlue(NULL),\n     _bPlayAll(NULL),_bPlaySelected(NULL)\n{\n}\n\nvoid SceneViewer::initialize()\n{\n   \/\/ Load game scene from file\n\n    int argc; \n    char **argv;\n    this->getArguments(&argc, &argv);\n    if (argc<2) {\n       _scene = Scene::load(\"res\/scene.gpb\");\n\t   if (!_scene)\n\t   {\n\t\t   LOG(\"Could not load %s\",\"res\/scene.gpb\");\n\t\t   exit();\n\t   }\n\t}\n\telse {\n        std::string path = std::string(\"res\/\")+std::string(argv[1])+std::string(\".gpb\");\n        puts(path.c_str());\n        _scene = Scene::load(path.c_str());\n\t\tif (!_scene)\n\t\t{\n\t\t\tLOG(\"Could not load %s\", path.c_str());\n\t\t\texit();\n\t\t}\n\t}\n\n   _shift_key = false;\n   _control_key = false;\n   _rotate_active = true;\n   _pan_active = false;\n   _zoom_active = false;\n   _touch_x = 0;\n   _touch_y = 0;\n   _grid_on = 1;\n\n\n   Camera * cam = _scene->getActiveCamera();\n   if (cam) {\n      \/\/ Set the aspect ratio for the scene's camera to match the current resolution\n      cam->setAspectRatio(getAspectRatio());\n      cam->getNode()->rotateY(MATH_DEG_TO_RAD(-90));\n   }\n\n   \/\/ Try to use any significant light source for the scene light vector.\n   \/\/ This is just a temporary hack until I manage to tap into the\n   \/\/ material file from the python addon.\n   Node * light = _scene->findNode(\"Spot\") ? _scene->findNode(\"Spot\") :\n                                             _scene->findNode(\"Area\") ? _scene->findNode(\"Area\") :\n                                                                        _scene->findNode(\"Sun\") ? _scene->findNode(\"Sun\") : 0;\n   if (light) _directionalLightVector = light->getForwardVector();\n\n   \/\/ Setup the form and callbacks\n   _form = Form::create(\"res\/editor.form\");\n   _sliderLightVectorX = (Slider *)_form->getControl(\"lvx\");\n   _sliderLightVectorY = (Slider *)_form->getControl(\"lvy\");\n   _sliderLightVectorZ = (Slider *)_form->getControl(\"lvz\");\n   _sliderClearColorRed = (Slider *)_form->getControl(\"ccRed\");\n   _sliderClearColorGreen = (Slider *)_form->getControl(\"ccGreen\");\n   _sliderClearColorBlue = (Slider *)_form->getControl(\"ccBlue\");\n   _bPlayAll = (Button *)_form->getControl(\"playAll\");\n   _bPlaySelected = (Button *)_form->getControl(\"playSelected\");\n   _bPlaySelected->setEnabled(false);\n\n   _gridCheckBox = static_cast<CheckBox*>(_form->getControl(\"gridCheckBox\"));\n\n\n\n   Slider * sliders[] = { _sliderLightVectorX, _sliderLightVectorY, _sliderLightVectorZ,\n                        _sliderClearColorRed, _sliderClearColorGreen, _sliderClearColorBlue }, *s;\n   FOREACH(s, sliders) {\n      s->addListener(this, Listener::VALUE_CHANGED);\n   }\n\n   _bPlayAll->addListener(this, Listener::CLICK);\n   _bPlaySelected->addListener(this, Listener::CLICK);\n\n   _gridCheckBox->addListener(this, Control::Listener::VALUE_CHANGED);\n   _gridCheckBox->setEnabled(true);\n\n   \/\/ Set the metarial lighting\n   _scene->visit(this, &SceneViewer::setLights);\n\n   _clearColor = Vector4::zero();\n\n   \/\/ let add a node to have the Camera looking at\n   Node *rootNode = _scene->addNode(\"root\");\n   rootNode->setTranslation(0, 0, 0);\n   Node *cameraNode = _scene->getActiveCamera()->getNode();\n   rootNode->addChild(cameraNode);\n\n   \/\/ Create the grid and add it to the scene.\n   Model* model = createGridModel();\n   _scene->addNode(\"grid\")->setModel(model);\n   model->release();\n}\n\nvoid SceneViewer::finalize()\n{\n   SAFE_RELEASE(_form);\n   SAFE_RELEASE(_scene);\n}\n\nbool SceneViewer::setLights(Node* node)\n{\n   if (node->getModel()) {\n      Material * m = node->getModel()->getMaterial(0);\n\t  if (m != NULL)\n\t  {\n\t\t  m->getTechnique()->getParameter(\"u_directionalLightColor[0]\")->setValue(Vector3(1, 1, 1));\n\t\t  m->getTechnique()->getParameter(\"u_directionalLightDirection[0]\")->setValue(_directionalLightVector);\n\t  }\n   }\n   return true;\n}\n\nvoid SceneViewer::update(float elapsedTime)\n{\n\n}\n\nvoid SceneViewer::render(float elapsedTime)\n{\n   \/\/ Clear the color and depth buffers\n   clear(CLEAR_COLOR_DEPTH, _clearColor, 1.0f, 0);\n\n   \/\/ Visit all the nodes in the scene for drawing\n   _scene->visit(this, &SceneViewer::drawScene);\n   _form->draw();\n}\n\nvoid SceneViewer::playNodeAmination(Node * node)\n{\n   Animation * anim = node->getAnimation(\"animations\");\n   if (anim==NULL) anim = node->getAnimation();\n   if (anim) {\n      if (anim->getDuration()>1)\n         anim->play();\n   }\n}\n\nbool SceneViewer::startAnims(Node* node)\n{\n   if (node->getModel()) {\n      this->playNodeAmination(node);\n   }\n   return false;\n}\n\nbool SceneViewer::drawScene(Node* node)\n{\n   \/\/ If the node visited contains a model, draw it\n   Model* model = node->getModel();\n   std::string id = node->getId();\n   \/\/LOG(\"nodel id=%s\", id.c_str());\n   if (model && (id.compare(0, 5, \"grid\") == 0)) {\n      if (_gridCheckBox->isChecked())\n         model->draw();\n      \/\/LOG(\"nodel id=%s\", id.c_str());\n   }\n   else if (model\/* && id.compare(0,1,\"_\")*\/)\n   {\n      model->draw();\n   }\n   return true;\n}\n\n\/\/ Key Mapping for view rotation, pan and zoom\n\/\/ ===========================================\n\/\/\n\/\/ Ideally, to match Blender, we should have:\n\/\/     Rotation:  KEY_ALT                 (LMB + drag)\n\/\/     Zoom:      KEY_CTRL  + KEY_ALT     (LMB + drag)\n\/\/     PAN:       KEY_SHIFT + KEY_ALT     (LMB + drag)\n\/\/\n\/\/ However, as KEY_ALT for Win8 event seems to not be working. So the mapping will be:\n\/\/     Rotation:                          (LMB + drag)\n\/\/     PAN:       KEY_SHIFT               (LMB + drag)\n\/\/     Zoom:      KEY_CTRL                (LMB + drag)\n\nvoid SceneViewer::keyEvent(Keyboard::KeyEvent evt, int key)\n{\n   if (evt == Keyboard::KEY_PRESS)\n   {\n      switch (key)\n      {\n      case Keyboard::KEY_ESCAPE:\n         exit();\n         break;\n      case Keyboard::KEY_CTRL:\n         _control_key = true;\n         break;\n      case Keyboard::KEY_SHIFT:\n         _shift_key = true;\n         break;\n      default: break;\n\n      }\n   }\n   else if (evt == Keyboard::KEY_RELEASE) {\n      switch (key)\n      {\n      case Keyboard::KEY_CTRL:\n         _control_key = false;\n         break;\n      case Keyboard::KEY_SHIFT:\n         _shift_key = false;\n         break;\n      default: break;\n      }\n   }\n   \/\/ update view rotation, pan and zoom flags\n\/*   if (_control_key && _shift_key) {\n      _rotate_active = false;\n      _zoom_active = true;\n      _pan_active = false;\n   }\n   else *\/ if (_control_key) {\n      _rotate_active = false;\n      _zoom_active = true;\n      _pan_active = false;\n   }\n   else if (_shift_key) {\n      _rotate_active = false;\n      _zoom_active = false;\n      _pan_active = true;\n   }\n   else {\n      _rotate_active = true;\n      _zoom_active = false;\n      _pan_active = false;\n   }\n\n}\n\nvoid SceneViewer::controlEvent(Control *control, EventType evt) {\n   switch(evt) {\n   case Listener::CLICK:\n      if (control==_bPlayAll) {\n         _scene->visit(this, &SceneViewer::startAnims);\n      }\n      if (control==_bPlaySelected) {\n         this->playNodeAmination(_selected);\n      }\n      break;\n   case Listener::VALUE_CHANGED:\n      if (control==_sliderLightVectorX) {\n         _directionalLightVector.x =  _sliderLightVectorX->getValue();\n         _scene->visit(this, &SceneViewer::setLights);\n      }\n      if (control==_sliderLightVectorY) {\n         _directionalLightVector.y =  _sliderLightVectorY->getValue();\n         _scene->visit(this, &SceneViewer::setLights);\n      }\n      if (control==_sliderLightVectorZ) {\n         _directionalLightVector.z =  _sliderLightVectorZ->getValue();\n         _scene->visit(this, &SceneViewer::setLights);\n      }\n      if (control==_sliderClearColorRed) {\n         _clearColor.x = _sliderClearColorRed->getValue();\n      }\n      if (control==_sliderClearColorGreen) {\n         _clearColor.y = _sliderClearColorGreen->getValue();\n      }\n      if (control==_sliderClearColorBlue) {\n         _clearColor.z = _sliderClearColorBlue->getValue();\n      }\n   }\n}\n\nbool SceneViewer::checkScene(Node* node, Ray* ray)\n{\n   Model* model = node->getModel();\n   if (model)\n   {\n      BoundingBox worldSpaceBoundingBox(model->getMesh()->getBoundingBox());\n      worldSpaceBoundingBox.transform(node->getWorldMatrix());\n\n      float distance = FLT_MAX;\n      if( (distance = ray->intersects(worldSpaceBoundingBox)) != Ray::INTERSECTS_NONE )\n      {\n         _selected = node;\n         _bPlaySelected->setText(node->getId());\n         _bPlaySelected->setEnabled(true);\n         return true;\n      }\n   }\n   return false;\n}\n\nvoid SceneViewer::rotateCameraLocal(float pitch, float yaw)\n{\n   Node * cameraNode = _scene->getActiveCamera()->getNode();\n   cameraNode->setRotation(Quaternion::identity());\n   cameraNode->rotateY(yaw);\n   cameraNode->rotateX(pitch);\n}\n\nvoid SceneViewer::rotateCameraView(float x, float y)\n{\n   Node *rootNode = _scene->findNode(\"root\");\n   rootNode->rotateX(y);\n   rootNode->rotateY(x);\n}\nvoid SceneViewer::zoomCameraView(float x, float y)\n{\n   Node * cameraNode = _scene->getActiveCamera()->getNode();\n   cameraNode->translateForward(-y);\n}\n\nvoid SceneViewer::panCameraView(float x, float y)\n{\n   Node *rootNode = _scene->findNode(\"root\");\n   float location_x = rootNode->getTranslationX();\n   float location_y = rootNode->getTranslationY();\n   float inv_x = location_x - x;\n   rootNode->setTranslationX( inv_x );\n   rootNode->setTranslationY(location_y + y);\n}\n\nvoid SceneViewer::touchEvent(Touch::TouchEvent evt, int x, int y, unsigned int contactIndex)\n{\n   switch (evt)\n   {\n   case Touch::TOUCH_PRESS:\n      if (contactIndex == 0) {\n         _touch_x = x;\n         _touch_y = y;\n         \/\/LOG(\"snap: x=%d, Y=%d\", x, y);\n      }\n      break;\n   case Touch::TOUCH_RELEASE:\n      {\n         Ray ray;\n         Camera* camera = _scene->getActiveCamera();\n         if (camera) {\n            camera->pickRay(getViewport(), x, y, &ray);\n            _scene->visit(this, &SceneViewer::checkScene, &ray);\n         }\n      }\n      break;\n\n   case Touch::TOUCH_MOVE:\n\n      if (contactIndex == 0) {\n         int sx = 1;\n         int sy = 1;\n         int  delta_x, delta_y;\n         Node * cameraNode = _scene->getActiveCamera()->getNode();\n\n         delta_x = x - _touch_x;\n         delta_y = y - _touch_y;\n         _touch_x = x;\n         _touch_y = y;\n         if (_zoom_active) {\n            zoomCameraView(-delta_x \/ 200.f, -delta_y \/ 200.f);\n         }\n\n         if (_rotate_active) {\n            rotateCameraView(-delta_x \/ 500.f, delta_y \/ 500.f);\n         }\n\n         if (_pan_active) {\n            panCameraView(-delta_x \/ 500.f, delta_y \/ 500.f);\n         }\n      }\n\n\n      break;\n   }\n}\n\nvoid SceneViewer::lookAt(Node* node, const Vector3& eye, const Vector3& target, const Vector3& up)\n{\n   \/\/ Create lookAt matrix\n   Matrix matrix;\n   Matrix::createLookAt(eye, target, up, &matrix);\n   matrix.transpose();\n\n   \/\/ Pull rotation out of matrix\n   Quaternion rotation;\n   matrix.getRotation(&rotation);\n\n   \/\/ Set rotation on node\n   node->setRotation(rotation);\n}\n\nModel* SceneViewer::createGridModel(unsigned int lineCount)\n{\n   \/\/ There needs to be an odd number of lines\n   lineCount |= 1;\n   const unsigned int pointCount = lineCount * 4;\n   const unsigned int verticesSize = pointCount * (3 + 3);  \/\/ (3 (position(xyz) + 3 color(rgb))\n\n   std::vector<float> vertices;\n   vertices.resize(verticesSize);\n\n   const float gridLength = (float)(lineCount \/ 2);\n   float value = -gridLength;\n   for (unsigned int i = 0; i < verticesSize; ++i)\n   {\n      \/\/ Default line color is dark grey\n      Vector4 color(0.3f, 0.3f, 0.3f, 1.0f);\n\n      \/\/ Very 10th line is brighter grey\n      if (((int)value) % 10 == 0)\n      {\n         color.set(0.45f, 0.45f, 0.45f, 1.0f);\n      }\n\n      \/\/ The Z axis is blue\n      if (value == 0.0f)\n      {\n         color.set(0.15f, 0.15f, 0.7f, 1.0f);\n      }\n\n      \/\/ Build the lines\n      vertices[i] = value;\n      vertices[++i] = 0.0f;\n      vertices[++i] = -gridLength;\n      vertices[++i] = color.x;\n      vertices[++i] = color.y;\n      vertices[++i] = color.z;\n\n      vertices[++i] = value;\n      vertices[++i] = 0.0f;\n      vertices[++i] = gridLength;\n      vertices[++i] = color.x;\n      vertices[++i] = color.y;\n      vertices[++i] = color.z;\n\n      \/\/ The X axis is red\n      if (value == 0.0f)\n      {\n         color.set(0.7f, 0.15f, 0.15f, 1.0f);\n      }\n      vertices[++i] = -gridLength;\n      vertices[++i] = 0.0f;\n      vertices[++i] = value;\n      vertices[++i] = color.x;\n      vertices[++i] = color.y;\n      vertices[++i] = color.z;\n\n      vertices[++i] = gridLength;\n      vertices[++i] = 0.0f;\n      vertices[++i] = value;\n      vertices[++i] = color.x;\n      vertices[++i] = color.y;\n      vertices[++i] = color.z;\n\n      value += 1.0f;\n   }\n   VertexFormat::Element elements[] =\n   {\n      VertexFormat::Element(VertexFormat::POSITION, 3),\n      VertexFormat::Element(VertexFormat::COLOR, 3)\n   };\n   Mesh* mesh = Mesh::createMesh(VertexFormat(elements, 2), pointCount, false);\n   if (mesh == NULL)\n   {\n      return NULL;\n   }\n   mesh->setPrimitiveType(Mesh::LINES);\n   mesh->setVertexData(&vertices[0], 0, pointCount);\n\n   Model* model = Model::create(mesh);\n   model->setMaterial(\"res\/scene_viewer.material#grid\");\n   SAFE_RELEASE(mesh);\n   return model;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Reduce nesting in Littlefs1FileSystem class<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*-------------------------------------------------------------------------\n *\n * tuple_transformer.cpp\n * file description\n *\n * Copyright(c) 2015, CMU\n *\n * \/n-store\/src\/bridge\/tuple_transformer.cpp\n *\n *-------------------------------------------------------------------------\n *\/\n\n#include <iostream>\n\n#include \"backend\/bridge\/dml\/tuple\/tuple_transformer.h\"\n#include \"backend\/common\/logger.h\"\n#include \"backend\/common\/value_peeker.h\"\n#include \"backend\/storage\/tuple.h\"\n#include \"backend\/common\/types.h\"\n#include \"backend\/bridge\/ddl\/ddl.h\"\n\n#include \"access\/htup_details.h\"\n#include \"nodes\/print.h\"\n#include \"utils\/builtins.h\"\n\nnamespace peloton {\nnamespace bridge {\n\n\/**\n * @brief Convert from Datum to Value.\n * @return converted Value.\n *\/\nValue TupleTransformer::GetValue(Datum datum, Oid atttypid) {\n  Value value;\n\n  switch (atttypid) {\n    case POSTGRES_VALUE_TYPE_SMALLINT: {\n      int16_t smallint = DatumGetInt16(datum);\n      LOG_TRACE(\"%d\\n\", smallint);\n      value = ValueFactory::GetSmallIntValue(smallint);\n    } break;\n\n    case POSTGRES_VALUE_TYPE_INTEGER: {\n      int32_t integer = DatumGetInt32(datum);\n      LOG_TRACE(\"%d\\n\", integer);\n      value = ValueFactory::GetIntegerValue(integer);\n    } break;\n\n    case POSTGRES_VALUE_TYPE_BIGINT: {\n      int64_t bigint = DatumGetInt64(datum);\n      LOG_TRACE(\"%ld\\n\", bigint);\n      value = ValueFactory::GetBigIntValue(bigint);\n    } break;\n\n    \/*\n     * In PG, BPCHAR and VARCHAR and TEXT are represented using\n     * 'struct varlena',\n     * which is a 4-byte header followed by the meat.\n     * However, the 4-byte header should not be accessed directly.\n     * It should be used in MACROS:\n     * VARSIZE(ptr), VARDATA(ptr) and VARHDRSZ.\n     * NB1: VARSIZE(ptr) is the size of the meat PLUS the header.\n     * NB2: DON'T assume strings have terminating-null's.\n     *\/\n    case POSTGRES_VALUE_TYPE_BPCHAR: {\n      struct varlena *bpcharptr = reinterpret_cast<struct varlena *>(datum);\n      int len = VARSIZE(bpcharptr) - VARHDRSZ;\n      char *varchar = static_cast<char *>(VARDATA(bpcharptr));\n      Pool *data_pool = nullptr;\n      std::string str(varchar, len);\n      LOG_TRACE(\"len = %d , bpchar = \\\"%s\\\"\", len, str.c_str());\n      value = ValueFactory::GetStringValue(str, data_pool);\n\n    } break;\n\n    case POSTGRES_VALUE_TYPE_VARCHAR2: {\n      struct varlena *varlenptr = reinterpret_cast<struct varlena *>(datum);\n      int len = VARSIZE(varlenptr) - VARHDRSZ;\n      char *varchar = static_cast<char *>(VARDATA(varlenptr));\n      Pool *data_pool = nullptr;\n      std::string str(varchar, len);\n      LOG_TRACE(\"len = %d , varchar = \\\"%s\\\"\", len, str.c_str());\n      value = ValueFactory::GetStringValue(str, data_pool);\n    } break;\n\n    case POSTGRES_VALUE_TYPE_TEXT: {\n      struct varlena *textptr = reinterpret_cast<struct varlena *>(datum);\n      int len = VARSIZE(textptr) - VARHDRSZ;\n      char *varchar = static_cast<char *>(VARDATA(textptr));\n      Pool *data_pool = nullptr;\n      std::string str(varchar, len);\n      LOG_TRACE(\"len = %d , text = \\\"%s\\\"\", len, str.c_str());\n      value = ValueFactory::GetStringValue(str, data_pool);\n    } break;\n\n    case POSTGRES_VALUE_TYPE_TIMESTAMPS: {\n      long int timestamp = DatumGetInt64(datum);\n      value = ValueFactory::GetTimestampValue(timestamp);\n    } break;\n\n    default:\n      LOG_ERROR(\"Unknown atttypeid : %u \", atttypid);\n      break;\n  }\n\n  return value;\n}\n\n\/**\n * @brief Convert from Value to Datum.\n * @return converted Datum.\n *\/\nDatum TupleTransformer::GetDatum(Value value) {\n  ValueType value_type;\n  Datum datum;\n\n  value_type = value.GetValueType();\n  switch (value_type) {\n    case VALUE_TYPE_SMALLINT: {\n      int16_t smallint = ValuePeeker::PeekSmallInt(value);\n      LOG_TRACE(\"%d\\n\", smallint);\n      datum = Int16GetDatum(smallint);\n    } break;\n\n    case VALUE_TYPE_INTEGER: {\n      int32_t integer = ValuePeeker::PeekInteger(value);\n      LOG_TRACE(\"%d\\n\", integer);\n      datum = Int32GetDatum(integer);\n    } break;\n\n    case VALUE_TYPE_BIGINT: {\n      int64_t bigint = ValuePeeker::PeekBigInt(value);\n      LOG_TRACE(\"%ld\\n\", bigint);\n      datum = Int64GetDatum(bigint);\n    } break;\n\n    case VALUE_TYPE_DOUBLE: {\n      double double_precision = ValuePeeker::PeekDouble(value);\n      LOG_TRACE(\"%f\\n\", double_precision);\n      datum = Float8GetDatum(double_precision);\n    } break;\n\n    case VALUE_TYPE_VARCHAR: {\n      char *data_ptr = static_cast<char *>(ValuePeeker::PeekObjectValue(value));\n      auto data_len = ValuePeeker::PeekObjectLength(value);\n      \/\/ NB: Peloton object don't have terminating-null's, so\n      \/\/ we should use PG functions that take explicit length.\n      datum = PointerGetDatum(cstring_to_text_with_len(data_ptr, data_len));\n    } break;\n\n    case VALUE_TYPE_TIMESTAMP: {\n      long int timestamp = ValuePeeker::PeekTimestamp(value);\n      datum = Int64GetDatum(timestamp);\n      LOG_TRACE(\"%s\\n\", DatumGetCString(timestamp));\n    } break;\n\n    default:\n      datum = PointerGetDatum(nullptr);\n      LOG_ERROR(\"Unrecognized value type : %u\\n\", value_type);\n      break;\n  }\n\n  return datum;\n}\n\n\/**\n * @brief Convert a Postgres tuple into Peloton tuple\n * @param slot Postgres tuple\n * @param schema Peloton scheme of the table to which the tuple belongs\n * @return a Peloton tuple\n *\/\nstorage::Tuple *TupleTransformer::GetPelotonTuple(\n    TupleTableSlot *slot, const catalog::Schema *schema) {\n  assert(slot);\n\n  TupleDesc tuple_desc = slot->tts_tupleDescriptor;\n  int natts = tuple_desc->natts;\n  bool isnull;\n\n  \/\/ Allocate space for a new tuple with given schema\n  storage::Tuple *tuple = new storage::Tuple(schema, true);\n\n  \/\/ Go over each attribute and convert Datum to Value\n  for (oid_t att_itr = 0; att_itr < natts; ++att_itr) {\n    Datum attr = slot_getattr(slot, att_itr + 1, &isnull);\n    if (isnull) continue;\n\n    Form_pg_attribute attribute_info = tuple_desc->attrs[att_itr];\n    Oid attribute_type_id = attribute_info->atttypid;\n\n    Value value = GetValue(attr, attribute_type_id);\n    tuple->SetValue(att_itr++, value);\n  }\n\n  return tuple;\n}\n\n\/**\n * @brief Convert a Peloton tuple into Postgres tuple slot\n * @param tuple Peloton tuple\n * @return a Postgres tuple\n *\/\nTupleTableSlot *TupleTransformer::GetPostgresTuple(storage::Tuple *tuple,\n                                                   TupleDesc tuple_desc) {\n  assert(tuple);\n  assert(tuple_desc);\n\n  TupleTableSlot *slot = NULL;\n  HeapTuple heap_tuple;\n  int natts = tuple_desc->natts;\n  Datum *datums;\n  bool *nulls;\n\n  if (tuple->GetColumnCount() != natts) {\n    LOG_WARN(\"tuple attr count : %u tuple desc attr count : %d \\n\",\n             tuple->GetColumnCount(), natts);\n    return nullptr;\n  }\n\n  \/\/ Allocate space for datums\n  datums = (Datum *)palloc0(natts * sizeof(Datum));\n  nulls = (bool *)palloc0(natts * sizeof(bool));\n\n  \/\/ Go over each attribute and convert Value to Datum\n  for (oid_t att_itr = 0; att_itr < natts; ++att_itr) {\n    Value value = tuple->GetValue(att_itr);\n    Datum datum = GetDatum(value);\n\n    assert(tuple_desc->attrs[att_itr]->attbyval == true ||\n           value.GetValueType() == VALUE_TYPE_VARCHAR ||\n           value.GetValueType() == VALUE_TYPE_VARBINARY);\n\n    datums[att_itr] = datum;\n    nulls[att_itr] = tuple->IsNull(att_itr) ? true : false;\n  }\n\n  \/\/ Construct tuple\n  \/\/ PG does a deep copy in heap_form_tuple()\n  heap_tuple = heap_form_tuple(tuple_desc, datums, nulls);\n\n  \/\/ Construct slot\n  slot = MakeSingleTupleTableSlot(tuple_desc);\n\n  \/\/ Store tuple in slot\n  \/\/ This function just sets a point in slot to the heap_tuple.\n  ExecStoreTuple(heap_tuple, slot, InvalidBuffer, true);\n\n  \/\/ Clean up Datums (A-B): seems we have to do the cleaning manually (no PG\n  \/\/ utility?)\n\n  \/\/ (A) Clean up any possible varlena's\n  for (oid_t att_itr = 0; att_itr < natts; ++att_itr) {\n    if (tuple_desc->attrs[att_itr]->attlen < 0) {  \/\/ should be a varlena\n      assert(tuple_desc->attrs[att_itr]->attbyval == false);\n\n      pfree((void *)(datums[att_itr]));\n    }\n  }\n\n  \/\/ (B) Free the datum array itself\n  pfree(datums);\n\n  pfree(nulls);\n\n  return slot;\n}\n\n}  \/\/ namespace bridge\n}  \/\/ namespace peloton\n<commit_msg>trying to support decimal.<commit_after>\/*-------------------------------------------------------------------------\n *\n * tuple_transformer.cpp\n * file description\n *\n * Copyright(c) 2015, CMU\n *\n * \/n-store\/src\/bridge\/tuple_transformer.cpp\n *\n *-------------------------------------------------------------------------\n *\/\n\n#include <iostream>\n\n#include \"backend\/bridge\/dml\/tuple\/tuple_transformer.h\"\n#include \"backend\/common\/logger.h\"\n#include \"backend\/common\/value_peeker.h\"\n#include \"backend\/storage\/tuple.h\"\n#include \"backend\/common\/types.h\"\n#include \"backend\/bridge\/ddl\/ddl.h\"\n\n#include \"access\/htup_details.h\"\n#include \"nodes\/print.h\"\n#include \"utils\/builtins.h\"\n#include \"utils\/numeric.h\"\n\n\nextern struct NumericVar;\n\nnamespace peloton {\nnamespace bridge {\n\n\/**\n * @brief Convert from Datum to Value.\n * @return converted Value.\n *\/\nValue TupleTransformer::GetValue(Datum datum, Oid atttypid) {\n  Value value;\n\n  switch (atttypid) {\n    case POSTGRES_VALUE_TYPE_SMALLINT: {\n      int16_t smallint = DatumGetInt16(datum);\n      LOG_TRACE(\"%d\\n\", smallint);\n      value = ValueFactory::GetSmallIntValue(smallint);\n    } break;\n\n    case POSTGRES_VALUE_TYPE_INTEGER: {\n      int32_t integer = DatumGetInt32(datum);\n      LOG_TRACE(\"%d\\n\", integer);\n      value = ValueFactory::GetIntegerValue(integer);\n    } break;\n\n    case POSTGRES_VALUE_TYPE_BIGINT: {\n      int64_t bigint = DatumGetInt64(datum);\n      LOG_TRACE(\"%ld\\n\", bigint);\n      value = ValueFactory::GetBigIntValue(bigint);\n    } break;\n\n    \/*\n     * In PG, BPCHAR and VARCHAR and TEXT are represented using\n     * 'struct varlena',\n     * which is a 4-byte header followed by the meat.\n     * However, the 4-byte header should not be accessed directly.\n     * It should be used in MACROS:\n     * VARSIZE(ptr), VARDATA(ptr) and VARHDRSZ.\n     * NB1: VARSIZE(ptr) is the size of the meat PLUS the header.\n     * NB2: DON'T assume strings have terminating-null's.\n     *\/\n    case POSTGRES_VALUE_TYPE_BPCHAR: {\n      struct varlena *bpcharptr = reinterpret_cast<struct varlena *>(datum);\n      int len = VARSIZE(bpcharptr) - VARHDRSZ;\n      char *varchar = static_cast<char *>(VARDATA(bpcharptr));\n      Pool *data_pool = nullptr;\n      std::string str(varchar, len);\n      LOG_TRACE(\"len = %d , bpchar = \\\"%s\\\"\", len, str.c_str());\n      value = ValueFactory::GetStringValue(str, data_pool);\n\n    } break;\n\n    case POSTGRES_VALUE_TYPE_VARCHAR2: {\n      struct varlena *varlenptr = reinterpret_cast<struct varlena *>(datum);\n      int len = VARSIZE(varlenptr) - VARHDRSZ;\n      char *varchar = static_cast<char *>(VARDATA(varlenptr));\n      Pool *data_pool = nullptr;\n      std::string str(varchar, len);\n      LOG_TRACE(\"len = %d , varchar = \\\"%s\\\"\", len, str.c_str());\n      value = ValueFactory::GetStringValue(str, data_pool);\n    } break;\n\n    case POSTGRES_VALUE_TYPE_TEXT: {\n      struct varlena *textptr = reinterpret_cast<struct varlena *>(datum);\n      int len = VARSIZE(textptr) - VARHDRSZ;\n      char *varchar = static_cast<char *>(VARDATA(textptr));\n      Pool *data_pool = nullptr;\n      std::string str(varchar, len);\n      LOG_TRACE(\"len = %d , text = \\\"%s\\\"\", len, str.c_str());\n      value = ValueFactory::GetStringValue(str, data_pool);\n    } break;\n\n    case POSTGRES_VALUE_TYPE_TIMESTAMPS: {\n      long int timestamp = DatumGetInt64(datum);\n      value = ValueFactory::GetTimestampValue(timestamp);\n    } break;\n\n    case POSTGRES_VALUE_TYPE_DECIMAL:{\n\n      \/\/ 1. Get string representation of the PG numeric (this is tricky)\n      char* cstr = DatumGetCString(DirectFunctionCall1(numeric_out, datum));\n\n      \/\/ 2. Construct Peloton Decimal from a string\n      value = ValueFactory::GetDecimalValueFromString(std::string(cstr));\n\n      pfree(cstr);\n    } break;\n\n    default:\n      LOG_ERROR(\"Unknown atttypeid : %u \", atttypid);\n      break;\n  }\n\n  return value;\n}\n\n\/**\n * @brief Convert from Value to Datum.\n * @return converted Datum.\n *\/\nDatum TupleTransformer::GetDatum(Value value) {\n  ValueType value_type;\n  Datum datum;\n\n  value_type = value.GetValueType();\n  switch (value_type) {\n    case VALUE_TYPE_SMALLINT: {\n      int16_t smallint = ValuePeeker::PeekSmallInt(value);\n      LOG_TRACE(\"%d\\n\", smallint);\n      datum = Int16GetDatum(smallint);\n    } break;\n\n    case VALUE_TYPE_INTEGER: {\n      int32_t integer = ValuePeeker::PeekInteger(value);\n      LOG_TRACE(\"%d\\n\", integer);\n      datum = Int32GetDatum(integer);\n    } break;\n\n    case VALUE_TYPE_BIGINT: {\n      int64_t bigint = ValuePeeker::PeekBigInt(value);\n      LOG_TRACE(\"%ld\\n\", bigint);\n      datum = Int64GetDatum(bigint);\n    } break;\n\n    case VALUE_TYPE_DOUBLE: {\n      double double_precision = ValuePeeker::PeekDouble(value);\n      LOG_TRACE(\"%f\\n\", double_precision);\n      datum = Float8GetDatum(double_precision);\n    } break;\n\n    case VALUE_TYPE_VARCHAR: {\n      char *data_ptr = static_cast<char *>(ValuePeeker::PeekObjectValue(value));\n      auto data_len = ValuePeeker::PeekObjectLength(value);\n      \/\/ NB: Peloton object don't have terminating-null's, so\n      \/\/ we should use PG functions that take explicit length.\n      datum = PointerGetDatum(cstring_to_text_with_len(data_ptr, data_len));\n    } break;\n\n    case VALUE_TYPE_TIMESTAMP: {\n      long int timestamp = ValuePeeker::PeekTimestamp(value);\n      datum = Int64GetDatum(timestamp);\n      LOG_TRACE(\"%s\\n\", DatumGetCString(timestamp));\n    } break;\n\n    default:\n      datum = PointerGetDatum(nullptr);\n      LOG_ERROR(\"Unrecognized value type : %u\\n\", value_type);\n      break;\n  }\n\n  return datum;\n}\n\n\/**\n * @brief Convert a Postgres tuple into Peloton tuple\n * @param slot Postgres tuple\n * @param schema Peloton scheme of the table to which the tuple belongs\n * @return a Peloton tuple\n *\/\nstorage::Tuple *TupleTransformer::GetPelotonTuple(\n    TupleTableSlot *slot, const catalog::Schema *schema) {\n  assert(slot);\n\n  TupleDesc tuple_desc = slot->tts_tupleDescriptor;\n  int natts = tuple_desc->natts;\n  bool isnull;\n\n  \/\/ Allocate space for a new tuple with given schema\n  storage::Tuple *tuple = new storage::Tuple(schema, true);\n\n  \/\/ Go over each attribute and convert Datum to Value\n  for (oid_t att_itr = 0; att_itr < natts; ++att_itr) {\n    Datum attr = slot_getattr(slot, att_itr + 1, &isnull);\n    if (isnull) continue;\n\n    Form_pg_attribute attribute_info = tuple_desc->attrs[att_itr];\n    Oid attribute_type_id = attribute_info->atttypid;\n\n    Value value = GetValue(attr, attribute_type_id);\n    tuple->SetValue(att_itr++, value);\n  }\n\n  return tuple;\n}\n\n\/**\n * @brief Convert a Peloton tuple into Postgres tuple slot\n * @param tuple Peloton tuple\n * @return a Postgres tuple\n *\/\nTupleTableSlot *TupleTransformer::GetPostgresTuple(storage::Tuple *tuple,\n                                                   TupleDesc tuple_desc) {\n  assert(tuple);\n  assert(tuple_desc);\n\n  TupleTableSlot *slot = NULL;\n  HeapTuple heap_tuple;\n  int natts = tuple_desc->natts;\n  Datum *datums;\n  bool *nulls;\n\n  if (tuple->GetColumnCount() != natts) {\n    LOG_WARN(\"tuple attr count : %u tuple desc attr count : %d \\n\",\n             tuple->GetColumnCount(), natts);\n    return nullptr;\n  }\n\n  \/\/ Allocate space for datums\n  datums = (Datum *)palloc0(natts * sizeof(Datum));\n  nulls = (bool *)palloc0(natts * sizeof(bool));\n\n  \/\/ Go over each attribute and convert Value to Datum\n  for (oid_t att_itr = 0; att_itr < natts; ++att_itr) {\n    Value value = tuple->GetValue(att_itr);\n    Datum datum = GetDatum(value);\n\n    assert(tuple_desc->attrs[att_itr]->attbyval == true ||\n           value.GetValueType() == VALUE_TYPE_VARCHAR ||\n           value.GetValueType() == VALUE_TYPE_VARBINARY);\n\n    datums[att_itr] = datum;\n    nulls[att_itr] = tuple->IsNull(att_itr) ? true : false;\n  }\n\n  \/\/ Construct tuple\n  \/\/ PG does a deep copy in heap_form_tuple()\n  heap_tuple = heap_form_tuple(tuple_desc, datums, nulls);\n\n  \/\/ Construct slot\n  slot = MakeSingleTupleTableSlot(tuple_desc);\n\n  \/\/ Store tuple in slot\n  \/\/ This function just sets a point in slot to the heap_tuple.\n  ExecStoreTuple(heap_tuple, slot, InvalidBuffer, true);\n\n  \/\/ Clean up Datums (A-B): seems we have to do the cleaning manually (no PG\n  \/\/ utility?)\n\n  \/\/ (A) Clean up any possible varlena's\n  for (oid_t att_itr = 0; att_itr < natts; ++att_itr) {\n    if (tuple_desc->attrs[att_itr]->attlen < 0) {  \/\/ should be a varlena\n      assert(tuple_desc->attrs[att_itr]->attbyval == false);\n\n      pfree((void *)(datums[att_itr]));\n    }\n  }\n\n  \/\/ (B) Free the datum array itself\n  pfree(datums);\n\n  pfree(nulls);\n\n  return slot;\n}\n\n}  \/\/ namespace bridge\n}  \/\/ namespace peloton\n<|endoftext|>"}
{"text":"<commit_before>#include \"nui.h\"\n\n#include \"nglApplication.h\"\n#include \"nglTimer.h\"\n#include <math.h>\n#include <set>\n\n#define TIMER_MIN_PERIOD     0.00001 \/\/ (somewhat 'reasonable')\n\nstatic std::set<nglTimer*> gNGLTimers;\n\nnglTimer::nglTimer(nglTime Period) : mPeriod(Period), mLastTime(0)\n{\n  mCallCnt = 0;\n  mRunning = false;\n  \n  mpCFRunLoop = NULL;\n  mpCFRunLoopTimer = NULL;\n  gNGLTimers.insert(this);\n}\n\nnglTimer::~nglTimer()\n{\n  Stop();\n  if (mpCFRunLoopTimer)\n    CFRelease(mpCFRunLoopTimer);\n  gNGLTimers.erase(this);\n}\n\n\nuint nglTimer::GetTickCount()\n{\n  return mCallCnt;\n}\n\nnglTime nglTimer::GetMinPeriod()\n{\n  return nglTime(TIMER_MIN_PERIOD);\n}\n\nnglTime nglTimer::GetPeriod()\n{\n  return mPeriod;\n}\n\nbool nglTimer::SetPeriod(nglTime Period)\n{\n  if (Period < TIMER_MIN_PERIOD)\n  {\n    mPeriod = TIMER_MIN_PERIOD;\n    return false;\n  }\n  mPeriod = Period;\n  return true;\n}\n\nvoid nglTimerAction(CFRunLoopTimerRef       pCFTimer,\n                    void*                   pUserData)\n{\n  nglTimer* pTimer = (nglTimer*)(pUserData);\n  if (!pTimer)\n    return;\n\n  std::set<nglTimer*>::iterator it = gNGLTimers.find(pTimer);\n  std::set<nglTimer*>::iterator end = gNGLTimers.end();\n  if (it == end) \n    return;\n    \n  bool running = pTimer->IsRunning();\n  if (!running)\n    return;\n  \n  pTimer->TimerAction();\n}\n\nvoid nglTimer::TimerAction()\n{\n  nglTime now;\n  OnTick(now - mLastTime);\n  mLastTime = now;\n  mCallCnt++;\n}\n\nbool nglTimer::Start(bool Immediate, bool Reset)\n{\n  Stop();\n  nglTime now;\n  \n  if (Reset)\n    mCallCnt = 0;\n\n  mLastTime = now;\n\n  if (!mpCFRunLoopTimer)\n  {\n    CFRunLoopTimerContext ctx;\n    ctx.version = 0;\n    ctx.info = (void*)this;\n    ctx.retain = NULL;\n    ctx.release = NULL;\n    ctx.copyDescription = NULL;\n\n    CFAbsoluteTime absTime = CFAbsoluteTimeGetCurrent() + (Immediate ? 0 : (double)mPeriod);\n    mpCFRunLoopTimer =\n      CFRunLoopTimerCreate( kCFAllocatorDefault,\n                            absTime,\n                            mPeriod, \n                            0,\/\/ option flags, not implemented so far\n                            0,\/\/ timer order, not implemented so far\n                            &nglTimerAction,\n                            &ctx);\n  }\n  NGL_ASSERT(mpCFRunLoopTimer);\n  if (!mpCFRunLoopTimer)\n    return false;\n  \n  mpCFRunLoop = CFRunLoopGetCurrent();\n  NGL_ASSERT(mpCFRunLoop);\n  \n  mRunning = true;\n  CFRunLoopAddTimer(mpCFRunLoop, mpCFRunLoopTimer, kCFRunLoopCommonModes);\n\n  return true;\n}\n\nvoid nglTimer::Stop()\n{\n  if (mRunning) {\n    NGL_ASSERT(mpCFRunLoopTimer);\n    CFRunLoopRef currentRunLoop = CFRunLoopGetCurrent();\n    NGL_ASSERT(mpCFRunLoop == currentRunLoop);\n    CFRunLoopRemoveTimer(currentRunLoop, mpCFRunLoopTimer, kCFRunLoopCommonModes);\n  }\n  mRunning = false;\n}\n\nbool nglTimer::IsRunning()\n{\n  return mRunning;\n}\n\n\n<commit_msg>fixed bug in nglTimer CoreFoundation<commit_after>#include \"nui.h\"\n\n#include \"nglApplication.h\"\n#include \"nglTimer.h\"\n#include <math.h>\n#include <set>\n\n#define TIMER_MIN_PERIOD     0.00001 \/\/ (somewhat 'reasonable')\n\nstatic std::set<nglTimer*> gNGLTimers;\n\nnglTimer::nglTimer(nglTime Period) : mPeriod(Period), mLastTime(0)\n{\n  mCallCnt = 0;\n  mRunning = false;\n  \n  mpCFRunLoop = NULL;\n  mpCFRunLoopTimer = NULL;\n  gNGLTimers.insert(this);\n}\n\nnglTimer::~nglTimer()\n{\n  Stop();\n  if (mpCFRunLoopTimer)\n    CFRelease(mpCFRunLoopTimer);\n  gNGLTimers.erase(this);\n}\n\n\nuint nglTimer::GetTickCount()\n{\n  return mCallCnt;\n}\n\nnglTime nglTimer::GetMinPeriod()\n{\n  return nglTime(TIMER_MIN_PERIOD);\n}\n\nnglTime nglTimer::GetPeriod()\n{\n  return mPeriod;\n}\n\nbool nglTimer::SetPeriod(nglTime Period)\n{\n  if (Period < TIMER_MIN_PERIOD)\n  {\n    mPeriod = TIMER_MIN_PERIOD;\n    return false;\n  }\n  mPeriod = Period;\n  return true;\n}\n\nvoid nglTimerAction(CFRunLoopTimerRef       pCFTimer,\n                    void*                   pUserData)\n{\n  nglTimer* pTimer = (nglTimer*)(pUserData);\n  if (!pTimer)\n    return;\n\n  std::set<nglTimer*>::iterator it = gNGLTimers.find(pTimer);\n  std::set<nglTimer*>::iterator end = gNGLTimers.end();\n  if (it == end) \n    return;\n    \n  bool running = pTimer->IsRunning();\n  if (!running)\n    return;\n  \n  pTimer->TimerAction();\n}\n\nvoid nglTimer::TimerAction()\n{\n  nglTime now;\n  OnTick(now - mLastTime);\n  mLastTime = now;\n  mCallCnt++;\n}\n\nbool nglTimer::Start(bool Immediate, bool Reset)\n{\n  Stop();\n  nglTime now;\n  \n  if (Reset)\n    mCallCnt = 0;\n\n  mLastTime = now;\n\n  if (!mpCFRunLoopTimer)\n  {\n    CFRunLoopTimerContext ctx;\n    ctx.version = 0;\n    ctx.info = (void*)this;\n    ctx.retain = NULL;\n    ctx.release = NULL;\n    ctx.copyDescription = NULL;\n\n    CFAbsoluteTime absTime = CFAbsoluteTimeGetCurrent() + (Immediate ? 0 : (double)mPeriod);\n    \n    mpCFRunLoopTimer =\n      CFRunLoopTimerCreate( kCFAllocatorDefault,\n                            absTime,\n                            mPeriod, \n                            0,\/\/ option flags, not implemented so far\n                            0,\/\/ timer order, not implemented so far\n                            &nglTimerAction,\n                            &ctx);\n  }\n  NGL_ASSERT(mpCFRunLoopTimer);\n  if (!mpCFRunLoopTimer)\n    return false;\n  \n  mpCFRunLoop = CFRunLoopGetCurrent();\n  NGL_ASSERT(mpCFRunLoop);\n  \n  mRunning = true;\n  CFRunLoopAddTimer(mpCFRunLoop, mpCFRunLoopTimer, kCFRunLoopCommonModes);\n\n  return true;\n}\n\nvoid nglTimer::Stop()\n{\n  if (mRunning) {\n    NGL_ASSERT(mpCFRunLoopTimer);\n    CFRunLoopRef currentRunLoop = CFRunLoopGetCurrent();\n    NGL_ASSERT(mpCFRunLoop == currentRunLoop);\n    CFRunLoopRemoveTimer(currentRunLoop, mpCFRunLoopTimer, kCFRunLoopCommonModes);\n    mpCFRunLoopTimer = NULL;\n  }\n  mRunning = false;\n}\n\nbool nglTimer::IsRunning()\n{\n  return mRunning;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- AMDGPUTargetMachine.cpp - TargetMachine for hw codegen targets-----===\/\/\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\/\/ The AMDGPU target machine contains all of the hardware specific information\n\/\/ needed to emit code for R600 and SI GPUs.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"AMDGPUTargetMachine.h\"\n#include \"AMDGPU.h\"\n#include \"R600ISelLowering.h\"\n#include \"R600InstrInfo.h\"\n#include \"SIISelLowering.h\"\n#include \"SIInstrInfo.h\"\n#include \"llvm\/Analysis\/Passes.h\"\n#include \"llvm\/Analysis\/Verifier.h\"\n#include \"llvm\/CodeGen\/MachineFunctionAnalysis.h\"\n#include \"llvm\/CodeGen\/MachineModuleInfo.h\"\n#include \"llvm\/CodeGen\/Passes.h\"\n#include \"llvm\/MC\/MCAsmInfo.h\"\n#include \"llvm\/PassManager.h\"\n#include \"llvm\/Support\/TargetRegistry.h\"\n#include \"llvm\/Support\/raw_os_ostream.h\"\n#include \"llvm\/Transforms\/IPO.h\"\n#include \"llvm\/Transforms\/Scalar.h\"\n#include <llvm\/CodeGen\/Passes.h>\n\nusing namespace llvm;\n\nextern \"C\" void LLVMInitializeAMDGPUTarget() {\n  \/\/ Register the target\n  RegisterTargetMachine<AMDGPUTargetMachine> X(TheAMDGPUTarget);\n}\n\nAMDGPUTargetMachine::AMDGPUTargetMachine(const Target &T, StringRef TT,\n    StringRef CPU, StringRef FS,\n  TargetOptions Options,\n  Reloc::Model RM, CodeModel::Model CM,\n  CodeGenOpt::Level OptLevel\n)\n:\n  LLVMTargetMachine(T, TT, CPU, FS, Options, RM, CM, OptLevel),\n  Subtarget(TT, CPU, FS),\n  DataLayout(Subtarget.getDataLayout()),\n  FrameLowering(TargetFrameLowering::StackGrowsUp,\n      Subtarget.device()->getStackAlignment(), 0),\n  IntrinsicInfo(this),\n  InstrItins(&Subtarget.getInstrItineraryData()),\n  mDump(false)\n\n{\n  \/\/ TLInfo uses InstrInfo so it must be initialized after.\n  if (Subtarget.device()->getGeneration() <= AMDGPUDeviceInfo::HD6XXX) {\n    InstrInfo = new R600InstrInfo(*this);\n    TLInfo = new R600TargetLowering(*this);\n  } else {\n    InstrInfo = new SIInstrInfo(*this);\n    TLInfo = new SITargetLowering(*this);\n  }\n}\n\nAMDGPUTargetMachine::~AMDGPUTargetMachine()\n{\n}\n\nnamespace {\nclass AMDGPUPassConfig : public TargetPassConfig {\npublic:\n  AMDGPUPassConfig(AMDGPUTargetMachine *TM, PassManagerBase &PM)\n    : TargetPassConfig(TM, PM) {}\n\n  AMDGPUTargetMachine &getAMDGPUTargetMachine() const {\n    return getTM<AMDGPUTargetMachine>();\n  }\n\n  virtual bool addPreISel();\n  virtual bool addInstSelector();\n  virtual bool addPreRegAlloc();\n  virtual bool addPostRegAlloc();\n  virtual bool addPreSched2();\n  virtual bool addPreEmitPass();\n};\n} \/\/ End of anonymous namespace\n\nTargetPassConfig *AMDGPUTargetMachine::createPassConfig(PassManagerBase &PM) {\n  return new AMDGPUPassConfig(this, PM);\n}\n\nbool\nAMDGPUPassConfig::addPreISel()\n{\n  return false;\n}\n\nbool AMDGPUPassConfig::addInstSelector() {\n  PM->add(createAMDGPUPeepholeOpt(*TM));\n  PM->add(createAMDGPUISelDag(getAMDGPUTargetMachine()));\n  return false;\n}\n\nbool AMDGPUPassConfig::addPreRegAlloc() {\n  const AMDGPUSubtarget &ST = TM->getSubtarget<AMDGPUSubtarget>();\n\n  if (ST.device()->getGeneration() > AMDGPUDeviceInfo::HD6XXX) {\n    PM->add(createSIAssignInterpRegsPass(*TM));\n  }\n  PM->add(createAMDGPUConvertToISAPass(*TM));\n  return false;\n}\n\nbool AMDGPUPassConfig::addPostRegAlloc() {\n  return false;\n}\n\nbool AMDGPUPassConfig::addPreSched2() {\n\n  addPass(IfConverterID);\n  return false;\n}\n\nbool AMDGPUPassConfig::addPreEmitPass() {\n  PM->add(createAMDGPUCFGPreparationPass(*TM));\n  PM->add(createAMDGPUCFGStructurizerPass(*TM));\n\n  const AMDGPUSubtarget &ST = TM->getSubtarget<AMDGPUSubtarget>();\n  if (ST.device()->getGeneration() <= AMDGPUDeviceInfo::HD6XXX) {\n    PM->add(createR600ExpandSpecialInstrsPass(*TM));\n    addPass(FinalizeMachineBundlesID);\n  } else {\n    PM->add(createSILowerLiteralConstantsPass(*TM));\n    PM->add(createSILowerFlowControlPass(*TM));\n  }\n\n  return false;\n}\n\n<commit_msg>radeon\/llvm: Disable SI flow control again for now.<commit_after>\/\/===-- AMDGPUTargetMachine.cpp - TargetMachine for hw codegen targets-----===\/\/\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\/\/ The AMDGPU target machine contains all of the hardware specific information\n\/\/ needed to emit code for R600 and SI GPUs.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"AMDGPUTargetMachine.h\"\n#include \"AMDGPU.h\"\n#include \"R600ISelLowering.h\"\n#include \"R600InstrInfo.h\"\n#include \"SIISelLowering.h\"\n#include \"SIInstrInfo.h\"\n#include \"llvm\/Analysis\/Passes.h\"\n#include \"llvm\/Analysis\/Verifier.h\"\n#include \"llvm\/CodeGen\/MachineFunctionAnalysis.h\"\n#include \"llvm\/CodeGen\/MachineModuleInfo.h\"\n#include \"llvm\/CodeGen\/Passes.h\"\n#include \"llvm\/MC\/MCAsmInfo.h\"\n#include \"llvm\/PassManager.h\"\n#include \"llvm\/Support\/TargetRegistry.h\"\n#include \"llvm\/Support\/raw_os_ostream.h\"\n#include \"llvm\/Transforms\/IPO.h\"\n#include \"llvm\/Transforms\/Scalar.h\"\n#include <llvm\/CodeGen\/Passes.h>\n\nusing namespace llvm;\n\nextern \"C\" void LLVMInitializeAMDGPUTarget() {\n  \/\/ Register the target\n  RegisterTargetMachine<AMDGPUTargetMachine> X(TheAMDGPUTarget);\n}\n\nAMDGPUTargetMachine::AMDGPUTargetMachine(const Target &T, StringRef TT,\n    StringRef CPU, StringRef FS,\n  TargetOptions Options,\n  Reloc::Model RM, CodeModel::Model CM,\n  CodeGenOpt::Level OptLevel\n)\n:\n  LLVMTargetMachine(T, TT, CPU, FS, Options, RM, CM, OptLevel),\n  Subtarget(TT, CPU, FS),\n  DataLayout(Subtarget.getDataLayout()),\n  FrameLowering(TargetFrameLowering::StackGrowsUp,\n      Subtarget.device()->getStackAlignment(), 0),\n  IntrinsicInfo(this),\n  InstrItins(&Subtarget.getInstrItineraryData()),\n  mDump(false)\n\n{\n  \/\/ TLInfo uses InstrInfo so it must be initialized after.\n  if (Subtarget.device()->getGeneration() <= AMDGPUDeviceInfo::HD6XXX) {\n    InstrInfo = new R600InstrInfo(*this);\n    TLInfo = new R600TargetLowering(*this);\n  } else {\n    InstrInfo = new SIInstrInfo(*this);\n    TLInfo = new SITargetLowering(*this);\n  }\n}\n\nAMDGPUTargetMachine::~AMDGPUTargetMachine()\n{\n}\n\nnamespace {\nclass AMDGPUPassConfig : public TargetPassConfig {\npublic:\n  AMDGPUPassConfig(AMDGPUTargetMachine *TM, PassManagerBase &PM)\n    : TargetPassConfig(TM, PM) {}\n\n  AMDGPUTargetMachine &getAMDGPUTargetMachine() const {\n    return getTM<AMDGPUTargetMachine>();\n  }\n\n  virtual bool addPreISel();\n  virtual bool addInstSelector();\n  virtual bool addPreRegAlloc();\n  virtual bool addPostRegAlloc();\n  virtual bool addPreSched2();\n  virtual bool addPreEmitPass();\n};\n} \/\/ End of anonymous namespace\n\nTargetPassConfig *AMDGPUTargetMachine::createPassConfig(PassManagerBase &PM) {\n  return new AMDGPUPassConfig(this, PM);\n}\n\nbool\nAMDGPUPassConfig::addPreISel()\n{\n  return false;\n}\n\nbool AMDGPUPassConfig::addInstSelector() {\n  PM->add(createAMDGPUPeepholeOpt(*TM));\n  PM->add(createAMDGPUISelDag(getAMDGPUTargetMachine()));\n  return false;\n}\n\nbool AMDGPUPassConfig::addPreRegAlloc() {\n  const AMDGPUSubtarget &ST = TM->getSubtarget<AMDGPUSubtarget>();\n\n  if (ST.device()->getGeneration() > AMDGPUDeviceInfo::HD6XXX) {\n    PM->add(createSIAssignInterpRegsPass(*TM));\n  }\n  PM->add(createAMDGPUConvertToISAPass(*TM));\n  return false;\n}\n\nbool AMDGPUPassConfig::addPostRegAlloc() {\n  return false;\n}\n\nbool AMDGPUPassConfig::addPreSched2() {\n\n  addPass(IfConverterID);\n  return false;\n}\n\nbool AMDGPUPassConfig::addPreEmitPass() {\n  PM->add(createAMDGPUCFGPreparationPass(*TM));\n  PM->add(createAMDGPUCFGStructurizerPass(*TM));\n\n  const AMDGPUSubtarget &ST = TM->getSubtarget<AMDGPUSubtarget>();\n  if (ST.device()->getGeneration() <= AMDGPUDeviceInfo::HD6XXX) {\n    PM->add(createR600ExpandSpecialInstrsPass(*TM));\n    addPass(FinalizeMachineBundlesID);\n  } else {\n    PM->add(createSILowerLiteralConstantsPass(*TM));\n    \/\/ piglit is unreliable (VM protection faults, GPU lockups) with this pass:\n    \/\/PM->add(createSILowerFlowControlPass(*TM));\n  }\n\n  return false;\n}\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Made ILP-based tests in AssignBondOrderProcessor_test conditional on lp_solve<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ The MIT License (MIT)\n\n\/\/ Copyright (c) 2016, Microsoft\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 <cstring>  \/\/ For strcmp.\n\n#include \"BitFunnel\/Allocators\/IAllocator.h\"\n\/\/#include \"BitFunnel\/Factories.h\"\n#include \"BitFunnel\/Exceptions.h\"\n#include \"BitFunnel\/IObjectFormatter.h\"\n#include \"BitFunnel\/IObjectParser.h\"\n#include \"BitFunnel\/TermMatchNode.h\"\n#include \"LoggerInterfaces\/Logging.h\"\n#include \"ObjectFormatter.h\"\n#include \"PlanNodeUtilities.h\"\n#include \"StringVector.h\"\n#include \"TextObjectParser.h\"\n\n\nnamespace BitFunnel\n{\n    namespace Factories\n    {\n        TermMatchNode const &\n            CreateTermMatchNode(std::istream& input,\n                                IAllocator& allocator);\n    }\n\n    \/\/*************************************************************************\n    \/\/\n    \/\/ Factory methods.\n    \/\/\n    \/\/*************************************************************************\n    TermMatchNode const &\n        Factories::CreateTermMatchNode(std::istream& input,\n                                       IAllocator& allocator)\n    {\n        TextObjectParser parser(input, allocator, TermMatchNode::GetType);\n        return TermMatchNode::Parse(parser);\n    }\n\n\n    \/\/*************************************************************************\n    \/\/\n    \/\/ Temporary helpers.\n    \/\/\n    \/\/*************************************************************************\n    static const char* const c_classificationNames[] = {\n        \"full\",\n        \"nonbody\",\n        \"metaword\",\n        \"clickboost\"\n    };\n\n    Classification StringToClassification(const std::string& s)\n    {\n        for (size_t i = 0; i < sizeof(c_classificationNames) \/ sizeof(const char*); ++i)\n        {\n            if (s.compare(c_classificationNames[i]) == 0)\n            {\n                LogAssertB(i < ClassificationCount, \"Bad classification.\");\n                return static_cast<Classification>(i);\n            }\n        }\n\n        return Invalid;\n    }\n\n\n    const char* ClassificationToString(Classification classification)\n    {\n        LogAssertB(classification != Invalid, \"Invalid classification.\");\n        LogAssertB(classification < ClassificationCount, \"Classification out of range.\");\n        return c_classificationNames[classification];\n    }\n\n    \/\/*************************************************************************\n    \/\/\n    \/\/ TermMatchNode\n    \/\/\n    \/\/*************************************************************************\n    \/\/ These text constants correspond to the values of the enumeration\n    \/\/ TermMatchNode::NodeType.\n    static const char* const c_typenames[] = {\n        \/\/ Match nodes\n        \"And\",\n        \"Not\",\n        \"Or\",\n        \"Phrase\",\n        \"Unigram\",\n        \"Fact\"\n    };\n\n\n    int TermMatchNode::GetTypeTag() const\n    {\n        return GetType();\n    }\n\n\n    char const * TermMatchNode::GetTypeName() const\n    {\n        NodeType type = GetType();\n        LogAssertB(type < TypeCount, \"Invalid type.\");\n        return c_typenames[type];\n    }\n\n\n    \/\/ TODO: REVIEW: Can this method return size_t to avoid static_cast?\n    int TermMatchNode::GetType(char const * name)\n    {\n        if (name[0] == 0)\n        {\n            return Null;\n        }\n        else\n        {\n            for (size_t i = 0; i < sizeof(c_typenames) \/ sizeof(char const *); ++i)\n            {\n                if (strcmp(name, c_typenames[i]) == 0)\n                {\n                    return static_cast<int>(i);\n                }\n            }\n        }\n\n        return Invalid;\n    }\n\n\n    TermMatchNode const & TermMatchNode::Parse(IObjectParser& parser)\n    {\n        int nodeType = parser.ReadTypeTag();\n\n        switch (nodeType)\n        {\n        case AndMatch:\n            return And::Parse(parser);\n        case NotMatch:\n            return ParseNode<Not>(parser);\n        case OrMatch:\n            return Or::Parse(parser);\n        case PhraseMatch:\n            return ParseNode<Phrase>(parser);\n        case UnigramMatch:\n            return ParseNode<Unigram>(parser);\n        case FactMatch:\n            return ParseNode<Fact>(parser);\n        default:\n            LogAbortB(\"Invalid node type.\");\n        }\n\n        \/\/ Should never reach this line.\n        BitFunnel::RecoverableError error(\"TermMatchNode::Parse: bad node type.\");\n        throw error;\n    }\n\n\n    \/\/*************************************************************************\n    \/\/\n    \/\/ TermMatchNode::And\n    \/\/\n    \/\/*************************************************************************\n    char const * TermMatchNode::And::c_childrenFieldName = \"Children\";\n\n\n    TermMatchNode::And::And(TermMatchNode const & left,\n                            TermMatchNode const & right)\n        : m_left(left),\n          m_right(right)\n    {\n    }\n\n\n    void TermMatchNode::And::Format(IObjectFormatter& formatter) const\n    {\n        \/\/ WARNING: Field format order must be consistent with the order the\n        \/\/ fields are declared in the header file. The reason is that the\n        \/\/ initializers in the constructor will parse the fields in declaration\n        \/\/ order.\n\n        formatter.OpenObject(*this);\n\n        formatter.OpenObjectField(c_childrenFieldName);\n        formatter.OpenList();\n\n        FormatList(*this, formatter);\n\n        formatter.CloseList();\n        formatter.CloseObject();\n    }\n\n\n    TermMatchNode::NodeType TermMatchNode::And::GetType() const\n    {\n        return TermMatchNode::AndMatch;\n    }\n\n\n    TermMatchNode const & TermMatchNode::And::GetLeft() const\n    {\n        return m_left;\n    }\n\n\n    TermMatchNode const & TermMatchNode::And::GetRight() const\n    {\n        return m_right;\n    }\n\n\n    TermMatchNode::And const & TermMatchNode::And::Parse(IObjectParser& parser)\n    {\n        parser.OpenObject();\n        parser.OpenObjectField(c_childrenFieldName);\n\n        parser.OpenList();\n\n        \/\/ And nodes must have exactly two children.\n        LogAssertB(parser.OpenListItem(), \"OpenListItem() failed.\");\n        And const & node = dynamic_cast<And const &>(ParseList<TermMatchNode, And>(parser));\n\n        parser.CloseList();\n        parser.CloseObject();\n\n        return node;\n    }\n\n\n    \/\/*************************************************************************\n    \/\/\n    \/\/ TermMatchNode::Not\n    \/\/\n    \/\/*************************************************************************\n    char const * TermMatchNode::Not::c_childFieldName = \"Child\";\n\n\n    TermMatchNode::Not::Not(TermMatchNode const & child)\n        : m_child(child)\n    {\n        LogAssertB(child.GetType() != TermMatchNode::NotMatch,\n                   \"Expected TermMatchNode::NotMatch\");\n    }\n\n\n    TermMatchNode::Not::Not(IObjectParser& parser)\n        : m_child((parser.OpenObject(),\n                   ParseNodeField<TermMatchNode>(parser, c_childFieldName)))\n    {\n        parser.CloseObject();\n    }\n\n\n    void TermMatchNode::Not::Format(IObjectFormatter& formatter) const\n    {\n        formatter.OpenObject(*this);\n        formatter.OpenObjectField(c_childFieldName);\n        GetChild().Format(formatter);\n        formatter.CloseObject();\n    }\n\n\n    TermMatchNode::NodeType TermMatchNode::Not::GetType() const\n    {\n        return TermMatchNode::NotMatch;\n    }\n\n\n    TermMatchNode const & TermMatchNode::Not::GetChild() const\n    {\n        return m_child;\n    }\n\n\n    \/\/*************************************************************************\n    \/\/\n    \/\/ TermMatchNode::Or\n    \/\/\n    \/\/*************************************************************************\n    char const * TermMatchNode::Or::c_childrenFieldName = \"Children\";\n\n\n    TermMatchNode::Or::Or(TermMatchNode const & left,\n                          TermMatchNode const & right)\n        : m_left(left),\n          m_right(right)\n    {\n    }\n\n\n    void TermMatchNode::Or::Format(IObjectFormatter& formatter) const\n    {\n        \/\/ WARNING: Field format order must be consistent with the order the\n        \/\/ fields are declared in the header file. The reason is that the\n        \/\/ initializers in the constructor will parse the fields in declaration\n        \/\/ order.\n\n        formatter.OpenObject(*this);\n\n        formatter.OpenObjectField(c_childrenFieldName);\n        formatter.OpenList();\n\n        FormatList(*this, formatter);\n\n        formatter.CloseList();\n        formatter.CloseObject();\n    }\n\n\n    TermMatchNode::NodeType TermMatchNode::Or::GetType() const\n    {\n        return TermMatchNode::OrMatch;\n    }\n\n\n    TermMatchNode const & TermMatchNode::Or::GetLeft() const\n    {\n        return m_left;\n    }\n\n\n    TermMatchNode const & TermMatchNode::Or::GetRight() const\n    {\n        return m_right;\n    }\n\n\n    TermMatchNode::Or const & TermMatchNode::Or::Parse(IObjectParser& parser)\n    {\n        parser.OpenObject();\n        parser.OpenObjectField(c_childrenFieldName);\n\n        parser.OpenList();\n\n        \/\/ Or nodes must have exactly two children.\n        LogAssertB(parser.OpenListItem(), \"OpenListItem() failed.\");\n        Or const & node = dynamic_cast<Or const &>(ParseList<TermMatchNode, Or>(parser));\n\n        parser.CloseList();\n        parser.CloseObject();\n\n        return node;\n    }\n\n\n    \/\/*************************************************************************\n    \/\/\n    \/\/ TermMatchNode::Phrase\n    \/\/\n    \/\/*************************************************************************\n    char const * TermMatchNode::Phrase::c_streamIdFieldName = \"StreamId\";\n    char const * TermMatchNode::Phrase::c_gramsFieldName = \"Grams\";\n\n\n    TermMatchNode::Phrase::Phrase(StringVector const & grams,\n                                  Term::StreamId streamId)\n        : m_streamId(streamId),\n          m_grams(grams)\n    {\n        LogAssertB(m_grams.GetSize() >= 2, \"Phase mush have at least 2 terms.\");\n    }\n\n\n    TermMatchNode::Phrase::Phrase(IObjectParser& parser)\n        : m_streamId((parser.OpenObject(),\n                      static_cast<Term::StreamId>(\n                          ParseObjectField<uint64_t>(parser, c_streamIdFieldName)))),\n          m_grams((parser.OpenObjectField(c_gramsFieldName),\n                   StringVector::Parse(parser, c_defaultInitialCapacity)))\n    {\n        \/\/ Phrase nodes must have at least two Terms.\n        LogAssertB(m_grams.GetSize() >= 2, \"Phase mush have at least 2 terms.\");\n        parser.CloseObject();\n    }\n\n\n    void TermMatchNode::Phrase::Format(IObjectFormatter& formatter) const\n    {\n        \/\/ WARNING: Field format order must be consistent with the order the\n        \/\/ fields are declared in the header file. The reason is that the\n        \/\/ initializers in the constructor will parse the fields in declaration\n        \/\/ order.\n\n        formatter.OpenObject(*this);\n\n        formatter.OpenObjectField(c_streamIdFieldName);\n        formatter.Format(static_cast<size_t>(m_streamId));\n\n        formatter.OpenObjectField(c_gramsFieldName);\n        m_grams.Format(formatter);\n\n        formatter.CloseObject();\n    }\n\n\n    TermMatchNode::NodeType TermMatchNode::Phrase::GetType() const\n    {\n        return TermMatchNode::PhraseMatch;\n    }\n\n\n    Term::StreamId TermMatchNode::Phrase::GetStreamId() const\n    {\n        return m_streamId;\n    }\n\n\n    StringVector const & TermMatchNode::Phrase::GetGrams() const\n    {\n        return m_grams;\n    }\n\n\n    \/\/*************************************************************************\n    \/\/\n    \/\/ TermMatchNode::Unigram\n    \/\/\n    \/\/*************************************************************************\n    TermMatchNode::Unigram::Unigram(char const * text,\n                                    Term::StreamId streamId)\n        : m_text(text),\n          m_streamId(streamId)\n    {\n    }\n\n\n    TermMatchNode::Unigram::Unigram(IObjectParser& parser)\n        : m_text((parser.OpenPrimitive(\"\"),\n                  ParsePrimitiveItem<char const *>(parser))),\n          m_streamId(static_cast<Term::StreamId>(ParsePrimitiveItem<uint64_t>(parser)))\n    {\n        parser.ClosePrimitive();\n    }\n\n\n    void TermMatchNode::Unigram::Format(IObjectFormatter& formatter) const\n    {\n        \/\/ WARNING: Field format order must be consistent with the order the\n        \/\/ fields are declared in the header file. The reason is that the\n        \/\/ initializers in the constructor will parse the fields in declaration\n        \/\/ order.\n\n        formatter.OpenPrimitive(GetTypeName());\n\n        formatter.OpenPrimitiveItem();\n        formatter.FormatStringLiteral(m_text);\n\n        formatter.OpenPrimitiveItem();\n        formatter.Format(static_cast<size_t>(m_streamId));\n\n        formatter.ClosePrimitive();\n    }\n\n\n    TermMatchNode::NodeType TermMatchNode::Unigram::GetType() const\n    {\n        return TermMatchNode::UnigramMatch;\n    }\n\n\n    char const * TermMatchNode::Unigram::GetText() const\n    {\n        return m_text;\n    }\n\n\n    Term::StreamId TermMatchNode::Unigram::GetStreamId() const\n    {\n        return m_streamId;\n    }\n\n\n    \/\/*************************************************************************\n    \/\/\n    \/\/ TermMatchNode::Fact\n    \/\/\n    \/\/*************************************************************************\n    TermMatchNode::Fact::Fact(FactHandle fact)\n        : m_fact(fact)\n    {\n    }\n\n\n    TermMatchNode::Fact::Fact(IObjectParser& parser)\n        : m_fact((parser.OpenPrimitive(\"\"),\n                  ParsePrimitiveItem<FactHandle>(parser)))\n    {\n        parser.ClosePrimitive();\n    }\n\n\n    FactHandle TermMatchNode::Fact::GetFact() const\n    {\n        return m_fact;\n    }\n\n\n    TermMatchNode::NodeType TermMatchNode::Fact::GetType() const\n    {\n        return TermMatchNode::FactMatch;\n    }\n\n\n    void TermMatchNode::Fact::Format(IObjectFormatter& formatter) const\n    {\n        \/\/ WARNING: Field format order must be consistent with the order the\n        \/\/ fields are declared in the header file. The reason is that the\n        \/\/ initializers in the constructor will parse the fields in declaration\n        \/\/ order.\n\n        formatter.OpenPrimitive(GetTypeName());\n\n        formatter.OpenPrimitiveItem();\n        formatter.Format(static_cast<size_t>(m_fact));\n\n        formatter.ClosePrimitive();\n    }\n\n\n    \/\/*************************************************************************\n    \/\/\n    \/\/ TermMatchNode::Builder\n    \/\/\n    \/\/*************************************************************************\n    TermMatchNode::Builder::Builder(TermMatchNode const & parent,\n                                    IAllocator& allocator)\n        : m_allocator(allocator),\n          m_targetType(parent.GetType()),\n          m_firstChild(nullptr),\n          m_node(nullptr)\n    {\n        if (parent.GetType() == TermMatchNode::PhraseMatch\n            || parent.GetType() == TermMatchNode::UnigramMatch)\n        {\n            m_firstChild = &parent;\n        }\n    }\n\n\n    TermMatchNode::Builder::Builder(TermMatchNode::NodeType nodeType,\n                                    IAllocator& allocator)\n        : m_allocator(allocator),\n          m_targetType(nodeType),\n          m_firstChild(nullptr),\n          m_node(nullptr)\n    {\n        LogAssertB(nodeType == TermMatchNode::AndMatch\n                   || nodeType == TermMatchNode::NotMatch\n                   || nodeType == TermMatchNode::OrMatch,\n                   \"Invalid node type\");\n    }\n\n\n    void TermMatchNode::Builder::AddChild(TermMatchNode const * childNode)\n    {\n        switch (m_targetType)\n        {\n        case TermMatchNode::AndMatch:\n            if (m_firstChild == nullptr)\n            {\n                m_firstChild = childNode;\n            }\n            else if (childNode != nullptr)\n            {\n                if (m_node == nullptr)\n                {\n                    m_node = new (m_allocator.Allocate(sizeof(And)))\n                                 And(*childNode, *m_firstChild);\n                }\n                else\n                {\n                    m_node = new (m_allocator.Allocate(sizeof(And)))\n                                 And(*childNode, *m_node);\n                }\n            }\n            break;\n        case TermMatchNode::NotMatch:\n            LogAssertB(m_firstChild == nullptr, \"Expected a child node.\");\n            if (childNode != nullptr)\n            {\n                if (childNode->GetType() == TermMatchNode::NotMatch)\n                {\n                    m_firstChild = &dynamic_cast<Not const &>(*childNode).GetChild();\n                }\n                else\n                {\n                    m_firstChild = new (m_allocator.Allocate(sizeof(Not)))\n                                       Not(*childNode);\n                }\n            }\n            break;\n        case TermMatchNode::OrMatch:\n            if (m_firstChild == nullptr)\n            {\n                m_firstChild = childNode;\n            }\n            else if (childNode != nullptr)\n            {\n                if (m_node == nullptr)\n                {\n                    m_node = new (m_allocator.Allocate(sizeof(Or)))\n                                 Or(*childNode, *m_firstChild);\n                }\n                else\n                {\n                    m_node = new (m_allocator.Allocate(sizeof(Or)))\n                                 Or(*childNode, *m_node);\n                }\n            }\n            break;\n        default:\n            LogAbortB(\"Unknown node type.\");\n        };\n    }\n\n\n    TermMatchNode const * TermMatchNode::Builder::Complete()\n    {\n        if (m_node == nullptr)\n        {\n            m_node = m_firstChild;\n        }\n\n        return m_node;\n    }\n\n\n    TermMatchNode const *\n    TermMatchNode::Builder::CreatePhraseNode(StringVector const & grams,\n                                             Term::StreamId streamId,\n                                             IAllocator& allocator)\n    {\n        return\n            new (allocator.Allocate(sizeof(Phrase)))\n            Phrase(grams, streamId);\n    }\n\n\n    TermMatchNode const *\n    TermMatchNode::Builder::CreateUnigramNode(char const * text,\n                                              Term::StreamId streamId,\n                                              IAllocator& allocator)\n    {\n        return\n            new (allocator.Allocate(sizeof(Unigram)))\n            Unigram(text, streamId);\n    }\n\n\n    TermMatchNode const *\n    TermMatchNode::Builder::CreateFactNode(FactHandle fact,\n                                           IAllocator& allocator)\n    {\n        return new (allocator.Allocate(sizeof(Fact))) Fact(fact);\n    }\n}\n<commit_msg>Remove classification from TermMatchNode.<commit_after>\/\/ The MIT License (MIT)\n\n\/\/ Copyright (c) 2016, Microsoft\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 <cstring>  \/\/ For strcmp.\n\n#include \"BitFunnel\/Allocators\/IAllocator.h\"\n\/\/#include \"BitFunnel\/Factories.h\"\n#include \"BitFunnel\/Exceptions.h\"\n#include \"BitFunnel\/IObjectFormatter.h\"\n#include \"BitFunnel\/IObjectParser.h\"\n#include \"BitFunnel\/TermMatchNode.h\"\n#include \"LoggerInterfaces\/Logging.h\"\n#include \"ObjectFormatter.h\"\n#include \"PlanNodeUtilities.h\"\n#include \"StringVector.h\"\n#include \"TextObjectParser.h\"\n\n\nnamespace BitFunnel\n{\n    namespace Factories\n    {\n        TermMatchNode const &\n            CreateTermMatchNode(std::istream& input,\n                                IAllocator& allocator);\n    }\n\n    \/\/*************************************************************************\n    \/\/\n    \/\/ Factory methods.\n    \/\/\n    \/\/*************************************************************************\n    TermMatchNode const &\n        Factories::CreateTermMatchNode(std::istream& input,\n                                       IAllocator& allocator)\n    {\n        TextObjectParser parser(input, allocator, TermMatchNode::GetType);\n        return TermMatchNode::Parse(parser);\n    }\n\n\n    \/\/*************************************************************************\n    \/\/\n    \/\/ TermMatchNode\n    \/\/\n    \/\/*************************************************************************\n    \/\/ These text constants correspond to the values of the enumeration\n    \/\/ TermMatchNode::NodeType.\n    static const char* const c_typenames[] = {\n        \/\/ Match nodes\n        \"And\",\n        \"Not\",\n        \"Or\",\n        \"Phrase\",\n        \"Unigram\",\n        \"Fact\"\n    };\n\n\n    int TermMatchNode::GetTypeTag() const\n    {\n        return GetType();\n    }\n\n\n    char const * TermMatchNode::GetTypeName() const\n    {\n        NodeType type = GetType();\n        LogAssertB(type < TypeCount, \"Invalid type.\");\n        return c_typenames[type];\n    }\n\n\n    \/\/ TODO: REVIEW: Can this method return size_t to avoid static_cast?\n    int TermMatchNode::GetType(char const * name)\n    {\n        if (name[0] == 0)\n        {\n            return Null;\n        }\n        else\n        {\n            for (size_t i = 0; i < sizeof(c_typenames) \/ sizeof(char const *); ++i)\n            {\n                if (strcmp(name, c_typenames[i]) == 0)\n                {\n                    return static_cast<int>(i);\n                }\n            }\n        }\n\n        return Invalid;\n    }\n\n\n    TermMatchNode const & TermMatchNode::Parse(IObjectParser& parser)\n    {\n        int nodeType = parser.ReadTypeTag();\n\n        switch (nodeType)\n        {\n        case AndMatch:\n            return And::Parse(parser);\n        case NotMatch:\n            return ParseNode<Not>(parser);\n        case OrMatch:\n            return Or::Parse(parser);\n        case PhraseMatch:\n            return ParseNode<Phrase>(parser);\n        case UnigramMatch:\n            return ParseNode<Unigram>(parser);\n        case FactMatch:\n            return ParseNode<Fact>(parser);\n        default:\n            LogAbortB(\"Invalid node type.\");\n        }\n\n        \/\/ Should never reach this line.\n        BitFunnel::RecoverableError error(\"TermMatchNode::Parse: bad node type.\");\n        throw error;\n    }\n\n\n    \/\/*************************************************************************\n    \/\/\n    \/\/ TermMatchNode::And\n    \/\/\n    \/\/*************************************************************************\n    char const * TermMatchNode::And::c_childrenFieldName = \"Children\";\n\n\n    TermMatchNode::And::And(TermMatchNode const & left,\n                            TermMatchNode const & right)\n        : m_left(left),\n          m_right(right)\n    {\n    }\n\n\n    void TermMatchNode::And::Format(IObjectFormatter& formatter) const\n    {\n        \/\/ WARNING: Field format order must be consistent with the order the\n        \/\/ fields are declared in the header file. The reason is that the\n        \/\/ initializers in the constructor will parse the fields in declaration\n        \/\/ order.\n\n        formatter.OpenObject(*this);\n\n        formatter.OpenObjectField(c_childrenFieldName);\n        formatter.OpenList();\n\n        FormatList(*this, formatter);\n\n        formatter.CloseList();\n        formatter.CloseObject();\n    }\n\n\n    TermMatchNode::NodeType TermMatchNode::And::GetType() const\n    {\n        return TermMatchNode::AndMatch;\n    }\n\n\n    TermMatchNode const & TermMatchNode::And::GetLeft() const\n    {\n        return m_left;\n    }\n\n\n    TermMatchNode const & TermMatchNode::And::GetRight() const\n    {\n        return m_right;\n    }\n\n\n    TermMatchNode::And const & TermMatchNode::And::Parse(IObjectParser& parser)\n    {\n        parser.OpenObject();\n        parser.OpenObjectField(c_childrenFieldName);\n\n        parser.OpenList();\n\n        \/\/ And nodes must have exactly two children.\n        LogAssertB(parser.OpenListItem(), \"OpenListItem() failed.\");\n        And const & node = dynamic_cast<And const &>(ParseList<TermMatchNode, And>(parser));\n\n        parser.CloseList();\n        parser.CloseObject();\n\n        return node;\n    }\n\n\n    \/\/*************************************************************************\n    \/\/\n    \/\/ TermMatchNode::Not\n    \/\/\n    \/\/*************************************************************************\n    char const * TermMatchNode::Not::c_childFieldName = \"Child\";\n\n\n    TermMatchNode::Not::Not(TermMatchNode const & child)\n        : m_child(child)\n    {\n        LogAssertB(child.GetType() != TermMatchNode::NotMatch,\n                   \"Expected TermMatchNode::NotMatch\");\n    }\n\n\n    TermMatchNode::Not::Not(IObjectParser& parser)\n        : m_child((parser.OpenObject(),\n                   ParseNodeField<TermMatchNode>(parser, c_childFieldName)))\n    {\n        parser.CloseObject();\n    }\n\n\n    void TermMatchNode::Not::Format(IObjectFormatter& formatter) const\n    {\n        formatter.OpenObject(*this);\n        formatter.OpenObjectField(c_childFieldName);\n        GetChild().Format(formatter);\n        formatter.CloseObject();\n    }\n\n\n    TermMatchNode::NodeType TermMatchNode::Not::GetType() const\n    {\n        return TermMatchNode::NotMatch;\n    }\n\n\n    TermMatchNode const & TermMatchNode::Not::GetChild() const\n    {\n        return m_child;\n    }\n\n\n    \/\/*************************************************************************\n    \/\/\n    \/\/ TermMatchNode::Or\n    \/\/\n    \/\/*************************************************************************\n    char const * TermMatchNode::Or::c_childrenFieldName = \"Children\";\n\n\n    TermMatchNode::Or::Or(TermMatchNode const & left,\n                          TermMatchNode const & right)\n        : m_left(left),\n          m_right(right)\n    {\n    }\n\n\n    void TermMatchNode::Or::Format(IObjectFormatter& formatter) const\n    {\n        \/\/ WARNING: Field format order must be consistent with the order the\n        \/\/ fields are declared in the header file. The reason is that the\n        \/\/ initializers in the constructor will parse the fields in declaration\n        \/\/ order.\n\n        formatter.OpenObject(*this);\n\n        formatter.OpenObjectField(c_childrenFieldName);\n        formatter.OpenList();\n\n        FormatList(*this, formatter);\n\n        formatter.CloseList();\n        formatter.CloseObject();\n    }\n\n\n    TermMatchNode::NodeType TermMatchNode::Or::GetType() const\n    {\n        return TermMatchNode::OrMatch;\n    }\n\n\n    TermMatchNode const & TermMatchNode::Or::GetLeft() const\n    {\n        return m_left;\n    }\n\n\n    TermMatchNode const & TermMatchNode::Or::GetRight() const\n    {\n        return m_right;\n    }\n\n\n    TermMatchNode::Or const & TermMatchNode::Or::Parse(IObjectParser& parser)\n    {\n        parser.OpenObject();\n        parser.OpenObjectField(c_childrenFieldName);\n\n        parser.OpenList();\n\n        \/\/ Or nodes must have exactly two children.\n        LogAssertB(parser.OpenListItem(), \"OpenListItem() failed.\");\n        Or const & node = dynamic_cast<Or const &>(ParseList<TermMatchNode, Or>(parser));\n\n        parser.CloseList();\n        parser.CloseObject();\n\n        return node;\n    }\n\n\n    \/\/*************************************************************************\n    \/\/\n    \/\/ TermMatchNode::Phrase\n    \/\/\n    \/\/*************************************************************************\n    char const * TermMatchNode::Phrase::c_streamIdFieldName = \"StreamId\";\n    char const * TermMatchNode::Phrase::c_gramsFieldName = \"Grams\";\n\n\n    TermMatchNode::Phrase::Phrase(StringVector const & grams,\n                                  Term::StreamId streamId)\n        : m_streamId(streamId),\n          m_grams(grams)\n    {\n        LogAssertB(m_grams.GetSize() >= 2, \"Phase mush have at least 2 terms.\");\n    }\n\n\n    TermMatchNode::Phrase::Phrase(IObjectParser& parser)\n        : m_streamId((parser.OpenObject(),\n                      static_cast<Term::StreamId>(\n                          ParseObjectField<uint64_t>(parser, c_streamIdFieldName)))),\n          m_grams((parser.OpenObjectField(c_gramsFieldName),\n                   StringVector::Parse(parser, c_defaultInitialCapacity)))\n    {\n        \/\/ Phrase nodes must have at least two Terms.\n        LogAssertB(m_grams.GetSize() >= 2, \"Phase mush have at least 2 terms.\");\n        parser.CloseObject();\n    }\n\n\n    void TermMatchNode::Phrase::Format(IObjectFormatter& formatter) const\n    {\n        \/\/ WARNING: Field format order must be consistent with the order the\n        \/\/ fields are declared in the header file. The reason is that the\n        \/\/ initializers in the constructor will parse the fields in declaration\n        \/\/ order.\n\n        formatter.OpenObject(*this);\n\n        formatter.OpenObjectField(c_streamIdFieldName);\n        formatter.Format(static_cast<size_t>(m_streamId));\n\n        formatter.OpenObjectField(c_gramsFieldName);\n        m_grams.Format(formatter);\n\n        formatter.CloseObject();\n    }\n\n\n    TermMatchNode::NodeType TermMatchNode::Phrase::GetType() const\n    {\n        return TermMatchNode::PhraseMatch;\n    }\n\n\n    Term::StreamId TermMatchNode::Phrase::GetStreamId() const\n    {\n        return m_streamId;\n    }\n\n\n    StringVector const & TermMatchNode::Phrase::GetGrams() const\n    {\n        return m_grams;\n    }\n\n\n    \/\/*************************************************************************\n    \/\/\n    \/\/ TermMatchNode::Unigram\n    \/\/\n    \/\/*************************************************************************\n    TermMatchNode::Unigram::Unigram(char const * text,\n                                    Term::StreamId streamId)\n        : m_text(text),\n          m_streamId(streamId)\n    {\n    }\n\n\n    TermMatchNode::Unigram::Unigram(IObjectParser& parser)\n        : m_text((parser.OpenPrimitive(\"\"),\n                  ParsePrimitiveItem<char const *>(parser))),\n          m_streamId(static_cast<Term::StreamId>(ParsePrimitiveItem<uint64_t>(parser)))\n    {\n        parser.ClosePrimitive();\n    }\n\n\n    void TermMatchNode::Unigram::Format(IObjectFormatter& formatter) const\n    {\n        \/\/ WARNING: Field format order must be consistent with the order the\n        \/\/ fields are declared in the header file. The reason is that the\n        \/\/ initializers in the constructor will parse the fields in declaration\n        \/\/ order.\n\n        formatter.OpenPrimitive(GetTypeName());\n\n        formatter.OpenPrimitiveItem();\n        formatter.FormatStringLiteral(m_text);\n\n        formatter.OpenPrimitiveItem();\n        formatter.Format(static_cast<size_t>(m_streamId));\n\n        formatter.ClosePrimitive();\n    }\n\n\n    TermMatchNode::NodeType TermMatchNode::Unigram::GetType() const\n    {\n        return TermMatchNode::UnigramMatch;\n    }\n\n\n    char const * TermMatchNode::Unigram::GetText() const\n    {\n        return m_text;\n    }\n\n\n    Term::StreamId TermMatchNode::Unigram::GetStreamId() const\n    {\n        return m_streamId;\n    }\n\n\n    \/\/*************************************************************************\n    \/\/\n    \/\/ TermMatchNode::Fact\n    \/\/\n    \/\/*************************************************************************\n    TermMatchNode::Fact::Fact(FactHandle fact)\n        : m_fact(fact)\n    {\n    }\n\n\n    TermMatchNode::Fact::Fact(IObjectParser& parser)\n        : m_fact((parser.OpenPrimitive(\"\"),\n                  ParsePrimitiveItem<FactHandle>(parser)))\n    {\n        parser.ClosePrimitive();\n    }\n\n\n    FactHandle TermMatchNode::Fact::GetFact() const\n    {\n        return m_fact;\n    }\n\n\n    TermMatchNode::NodeType TermMatchNode::Fact::GetType() const\n    {\n        return TermMatchNode::FactMatch;\n    }\n\n\n    void TermMatchNode::Fact::Format(IObjectFormatter& formatter) const\n    {\n        \/\/ WARNING: Field format order must be consistent with the order the\n        \/\/ fields are declared in the header file. The reason is that the\n        \/\/ initializers in the constructor will parse the fields in declaration\n        \/\/ order.\n\n        formatter.OpenPrimitive(GetTypeName());\n\n        formatter.OpenPrimitiveItem();\n        formatter.Format(static_cast<size_t>(m_fact));\n\n        formatter.ClosePrimitive();\n    }\n\n\n    \/\/*************************************************************************\n    \/\/\n    \/\/ TermMatchNode::Builder\n    \/\/\n    \/\/*************************************************************************\n    TermMatchNode::Builder::Builder(TermMatchNode const & parent,\n                                    IAllocator& allocator)\n        : m_allocator(allocator),\n          m_targetType(parent.GetType()),\n          m_firstChild(nullptr),\n          m_node(nullptr)\n    {\n        if (parent.GetType() == TermMatchNode::PhraseMatch\n            || parent.GetType() == TermMatchNode::UnigramMatch)\n        {\n            m_firstChild = &parent;\n        }\n    }\n\n\n    TermMatchNode::Builder::Builder(TermMatchNode::NodeType nodeType,\n                                    IAllocator& allocator)\n        : m_allocator(allocator),\n          m_targetType(nodeType),\n          m_firstChild(nullptr),\n          m_node(nullptr)\n    {\n        LogAssertB(nodeType == TermMatchNode::AndMatch\n                   || nodeType == TermMatchNode::NotMatch\n                   || nodeType == TermMatchNode::OrMatch,\n                   \"Invalid node type\");\n    }\n\n\n    void TermMatchNode::Builder::AddChild(TermMatchNode const * childNode)\n    {\n        switch (m_targetType)\n        {\n        case TermMatchNode::AndMatch:\n            if (m_firstChild == nullptr)\n            {\n                m_firstChild = childNode;\n            }\n            else if (childNode != nullptr)\n            {\n                if (m_node == nullptr)\n                {\n                    m_node = new (m_allocator.Allocate(sizeof(And)))\n                                 And(*childNode, *m_firstChild);\n                }\n                else\n                {\n                    m_node = new (m_allocator.Allocate(sizeof(And)))\n                                 And(*childNode, *m_node);\n                }\n            }\n            break;\n        case TermMatchNode::NotMatch:\n            LogAssertB(m_firstChild == nullptr, \"Expected a child node.\");\n            if (childNode != nullptr)\n            {\n                if (childNode->GetType() == TermMatchNode::NotMatch)\n                {\n                    m_firstChild = &dynamic_cast<Not const &>(*childNode).GetChild();\n                }\n                else\n                {\n                    m_firstChild = new (m_allocator.Allocate(sizeof(Not)))\n                                       Not(*childNode);\n                }\n            }\n            break;\n        case TermMatchNode::OrMatch:\n            if (m_firstChild == nullptr)\n            {\n                m_firstChild = childNode;\n            }\n            else if (childNode != nullptr)\n            {\n                if (m_node == nullptr)\n                {\n                    m_node = new (m_allocator.Allocate(sizeof(Or)))\n                                 Or(*childNode, *m_firstChild);\n                }\n                else\n                {\n                    m_node = new (m_allocator.Allocate(sizeof(Or)))\n                                 Or(*childNode, *m_node);\n                }\n            }\n            break;\n        default:\n            LogAbortB(\"Unknown node type.\");\n        };\n    }\n\n\n    TermMatchNode const * TermMatchNode::Builder::Complete()\n    {\n        if (m_node == nullptr)\n        {\n            m_node = m_firstChild;\n        }\n\n        return m_node;\n    }\n\n\n    TermMatchNode const *\n    TermMatchNode::Builder::CreatePhraseNode(StringVector const & grams,\n                                             Term::StreamId streamId,\n                                             IAllocator& allocator)\n    {\n        return\n            new (allocator.Allocate(sizeof(Phrase)))\n            Phrase(grams, streamId);\n    }\n\n\n    TermMatchNode const *\n    TermMatchNode::Builder::CreateUnigramNode(char const * text,\n                                              Term::StreamId streamId,\n                                              IAllocator& allocator)\n    {\n        return\n            new (allocator.Allocate(sizeof(Unigram)))\n            Unigram(text, streamId);\n    }\n\n\n    TermMatchNode const *\n    TermMatchNode::Builder::CreateFactNode(FactHandle fact,\n                                           IAllocator& allocator)\n    {\n        return new (allocator.Allocate(sizeof(Fact))) Fact(fact);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 3 of the License, or\n * (at your option) any later version.\n *\n * Written (W) 2012 Sergey Lisitsyn\n * Written (W) 2012 Heiko Strathmann\n *\/\n\n#include <shogun\/evaluation\/CrossValidationMKLStorage.h>\n#include <shogun\/kernel\/CombinedKernel.h>\n#include <shogun\/classifier\/mkl\/MKL.h>\n\nusing namespace shogun;\n\nvoid CCrossValidationMKLStorage::update_trained_machine(\n\t\tCMachine* machine, const char* prefix)\n{\n\tif (!dynamic_cast<CMKL*>(machine))\n\t{\n\t\tSG_ERROR(\"%s::update_trained_machine(): This method is only usable \"\n\t\t\t\t\"with CMKL derived machines. This one is \\\"s\\\"\\n\", get_name(),\n\t\t\t\tmachine->get_name());\n\t}\n\n\tCMKL* mkl=(CMKL*)machine;\n\tCCombinedKernel* kernel=dynamic_cast<CCombinedKernel*>(\n\t\t\tmkl->get_kernel());\n\n\tSGVector<float64_t> w=kernel->get_subkernel_weights();\n\n\t\/* evtl re-allocate memory (different number of runs from evaluation before) *\/\n\tif (m_mkl_weights.num_rows!=w.vlen ||\n\t\t\tm_mkl_weights.num_cols!=m_num_folds*m_num_runs)\n\t{\n\t\tif (m_mkl_weights.matrix)\n\t\t{\n\t\t\tSG_DEBUG(\"deleting memory for mkl weight matrix\\n\");\n\t\t\tm_mkl_weights=SGMatrix<float64_t>();\n\t\t}\n\t}\n\n\t\/* evtl allocate memory (first call) *\/\n\tif (!m_mkl_weights.matrix)\n\t{\n\t\tSG_DEBUG(\"allocating memory for mkl weight matrix\\n\");\n\t\tm_mkl_weights=SGMatrix<float64_t>(w.vlen,m_num_folds*m_num_runs);\n\t}\n\n\t\/* put current mkl weights into matrix, copy memory vector wise to make\n\t * things fast. Compute index of address to where vector goes *\/\n\n\t\/* number of runs is w.vlen*m_num_folds shift *\/\n\tindex_t run_shift=m_current_run_index*w.vlen*m_num_folds;\n\n\t\/* fold shift is m_current_fold_index*w-vlen *\/\n\tindex_t fold_shift=m_current_fold_index*w.vlen;\n\n\t\/* add both index shifts *\/\n\tindex_t first_idx=run_shift+fold_shift;\n\tSG_DEBUG(\"run %d, fold %d, matrix index %d\\n\",m_current_run_index,\n\t\t\tm_current_fold_index, first_idx);\n\n\t\/* copy memory *\/\n\tmemcpy(&m_mkl_weights.matrix[first_idx], w.vector,\n\t\t\tw.vlen*sizeof(float64_t));\n\n\tSG_UNREF(kernel);\n}\n<commit_msg>added propper error messages<commit_after>\/*\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 3 of the License, or\n * (at your option) any later version.\n *\n * Written (W) 2012 Sergey Lisitsyn\n * Written (W) 2012 Heiko Strathmann\n *\/\n\n#include <shogun\/evaluation\/CrossValidationMKLStorage.h>\n#include <shogun\/kernel\/CombinedKernel.h>\n#include <shogun\/classifier\/mkl\/MKL.h>\n\nusing namespace shogun;\n\nvoid CCrossValidationMKLStorage::update_trained_machine(\n\t\tCMachine* machine, const char* prefix)\n{\n\tREQUIRE(machine, \"%s::update_trained_machine(): Provided Machine is NULL!\\n\",\n\t\t\tget_name());\n\n\tCMKL* mkl=dynamic_cast<CMKL*>(machine);\n\tREQUIRE(mkl, \"%s::update_trained_machine(): This method is only usable \"\n\t\t\t\t\"with CMKL derived machines. This one is \\\"s\\\"\\n\", get_name(),\n\t\t\t\tmachine->get_name());\n\n\tCKernel* kernel=mkl->get_kernel();\n\tREQUIRE(kernel, \"%s::update_trained_machine(): No kernel assigned to \"\n\t\t\t\"machine of type \\\"%s\\\"\\n\", get_name(), machine->get_name());\n\n\tCCombinedKernel* combined_kernel=dynamic_cast<CCombinedKernel*>(kernel);\n\tREQUIRE(combined_kernel, \"%s::update_trained_machine(): This method is only\"\n\t\t\t\" usable with CCombinedKernel on machines. This one is \\\"s\\\"\\n\",\n\t\t\tget_name(), kernel->get_name());\n\n\tSGVector<float64_t> w=combined_kernel->get_subkernel_weights();\n\n\t\/* evtl re-allocate memory (different number of runs from evaluation before) *\/\n\tif (m_mkl_weights.num_rows!=w.vlen ||\n\t\t\tm_mkl_weights.num_cols!=m_num_folds*m_num_runs)\n\t{\n\t\tif (m_mkl_weights.matrix)\n\t\t{\n\t\t\tSG_DEBUG(\"deleting memory for mkl weight matrix\\n\");\n\t\t\tm_mkl_weights=SGMatrix<float64_t>();\n\t\t}\n\t}\n\n\t\/* evtl allocate memory (first call) *\/\n\tif (!m_mkl_weights.matrix)\n\t{\n\t\tSG_DEBUG(\"allocating memory for mkl weight matrix\\n\");\n\t\tm_mkl_weights=SGMatrix<float64_t>(w.vlen,m_num_folds*m_num_runs);\n\t}\n\n\t\/* put current mkl weights into matrix, copy memory vector wise to make\n\t * things fast. Compute index of address to where vector goes *\/\n\n\t\/* number of runs is w.vlen*m_num_folds shift *\/\n\tindex_t run_shift=m_current_run_index*w.vlen*m_num_folds;\n\n\t\/* fold shift is m_current_fold_index*w-vlen *\/\n\tindex_t fold_shift=m_current_fold_index*w.vlen;\n\n\t\/* add both index shifts *\/\n\tindex_t first_idx=run_shift+fold_shift;\n\tSG_DEBUG(\"run %d, fold %d, matrix index %d\\n\",m_current_run_index,\n\t\t\tm_current_fold_index, first_idx);\n\n\t\/* copy memory *\/\n\tmemcpy(&m_mkl_weights.matrix[first_idx], w.vector,\n\t\t\tw.vlen*sizeof(float64_t));\n\n\tSG_UNREF(kernel);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Copyright (c) 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\/\/ EGLContextCompatibilityTest.cpp:\n\/\/   This test will try to use all combinations of context configs and\n\/\/   surface configs. If the configs are compatible, it checks that simple\n\/\/   rendering works, otherwise it checks an error is generated one MakeCurrent.\n#include <gtest\/gtest.h>\n\n#include <vector>\n#include <EGL\/egl.h>\n#include <EGL\/eglext.h>\n\n#include \"OSWindow.h\"\n#include \"test_utils\/ANGLETest.h\"\n#include \"test_utils\/angle_test_configs.h\"\n\nusing namespace angle;\n\nnamespace\n{\n\nconst EGLint contextAttribs[] =\n{\n    EGL_CONTEXT_CLIENT_VERSION, 2,\n    EGL_NONE\n};\n\n}\n\nclass EGLContextCompatibilityTest : public ANGLETest\n{\n  public:\n    EGLContextCompatibilityTest()\n      : mDisplay(0)\n    {\n    }\n\n    void SetUp() override\n    {\n        PFNEGLGETPLATFORMDISPLAYEXTPROC eglGetPlatformDisplayEXT = reinterpret_cast<PFNEGLGETPLATFORMDISPLAYEXTPROC>(eglGetProcAddress(\"eglGetPlatformDisplayEXT\"));\n        ASSERT_TRUE(eglGetPlatformDisplayEXT != nullptr);\n\n        EGLint dispattrs[] =\n        {\n            EGL_PLATFORM_ANGLE_TYPE_ANGLE, GetParam().getRenderer(),\n            EGL_NONE\n        };\n        mDisplay = eglGetPlatformDisplayEXT(EGL_PLATFORM_ANGLE_ANGLE, EGL_DEFAULT_DISPLAY, dispattrs);\n        ASSERT_TRUE(mDisplay != EGL_NO_DISPLAY);\n\n        ASSERT_TRUE(eglInitialize(mDisplay, nullptr, nullptr) == EGL_TRUE);\n\n        int nConfigs = 0;\n        ASSERT_TRUE(eglGetConfigs(mDisplay, nullptr, 0, &nConfigs) == EGL_TRUE);\n        ASSERT_TRUE(nConfigs != 0);\n\n        int nReturnedConfigs = 0;\n        mConfigs.resize(nConfigs);\n        ASSERT_TRUE(eglGetConfigs(mDisplay, mConfigs.data(), nConfigs, &nReturnedConfigs) == EGL_TRUE);\n        ASSERT_TRUE(nConfigs == nReturnedConfigs);\n    }\n\n    void TearDown() override\n    {\n        eglMakeCurrent(mDisplay, EGL_NO_SURFACE, EGL_NO_SURFACE, EGL_NO_CONTEXT);\n        eglTerminate(mDisplay);\n    };\n\n  protected:\n    bool areConfigsCompatible(EGLConfig c1, EGLConfig c2, EGLint surfaceBit)\n    {\n        EGLint colorBufferType1, colorBufferType2;\n        EGLint red1, red2, green1, green2, blue1, blue2, alpha1, alpha2;\n        EGLint depth1, depth2, stencil1, stencil2;\n        EGLint surfaceType1, surfaceType2;\n\n        eglGetConfigAttrib(mDisplay, c1, EGL_COLOR_BUFFER_TYPE, &colorBufferType1);\n        eglGetConfigAttrib(mDisplay, c2, EGL_COLOR_BUFFER_TYPE, &colorBufferType2);\n\n        eglGetConfigAttrib(mDisplay, c1, EGL_RED_SIZE, &red1);\n        eglGetConfigAttrib(mDisplay, c2, EGL_RED_SIZE, &red2);\n        eglGetConfigAttrib(mDisplay, c1, EGL_GREEN_SIZE, &green1);\n        eglGetConfigAttrib(mDisplay, c2, EGL_GREEN_SIZE, &green2);\n        eglGetConfigAttrib(mDisplay, c1, EGL_BLUE_SIZE, &blue1);\n        eglGetConfigAttrib(mDisplay, c2, EGL_BLUE_SIZE, &blue2);\n        eglGetConfigAttrib(mDisplay, c1, EGL_ALPHA_SIZE, &alpha1);\n        eglGetConfigAttrib(mDisplay, c2, EGL_ALPHA_SIZE, &alpha2);\n\n        eglGetConfigAttrib(mDisplay, c1, EGL_DEPTH_SIZE, &depth1);\n        eglGetConfigAttrib(mDisplay, c2, EGL_DEPTH_SIZE, &depth2);\n        eglGetConfigAttrib(mDisplay, c1, EGL_STENCIL_SIZE, &stencil1);\n        eglGetConfigAttrib(mDisplay, c2, EGL_STENCIL_SIZE, &stencil2);\n\n        eglGetConfigAttrib(mDisplay, c1, EGL_SURFACE_TYPE, &surfaceType1);\n        eglGetConfigAttrib(mDisplay, c2, EGL_SURFACE_TYPE, &surfaceType2);\n\n        return colorBufferType1 == colorBufferType2 &&\n               red1 == red2 && green1 == green2 && blue1 == blue2 && alpha1 == alpha2 &&\n               depth1 == depth2 && stencil1 == stencil2 &&\n               (surfaceType1 & surfaceBit) != 0 &&\n               (surfaceType2 & surfaceBit) != 0;\n    }\n\n    void testWindowCompatibility(EGLConfig windowConfig, EGLConfig contextConfig, bool compatible) const\n    {\n        OSWindow *osWindow = CreateOSWindow();\n        ASSERT_TRUE(osWindow != nullptr);\n        osWindow->initialize(\"EGLContextCompatibilityTest\", 500, 500);\n        osWindow->setVisible(true);\n\n        EGLContext context = eglCreateContext(mDisplay, contextConfig, EGL_NO_CONTEXT, contextAttribs);\n        ASSERT_TRUE(context != EGL_NO_CONTEXT);\n\n        EGLSurface window = eglCreateWindowSurface(mDisplay, windowConfig, osWindow->getNativeWindow(), nullptr);\n        ASSERT_EGL_SUCCESS();\n\n        if (compatible)\n        {\n            testClearSurface(window, context);\n        }\n        else\n        {\n            testMakeCurrentFails(window, context);\n        }\n\n        eglDestroySurface(mDisplay, window);\n        ASSERT_EGL_SUCCESS();\n\n        eglDestroyContext(mDisplay, context);\n        ASSERT_EGL_SUCCESS();\n\n        SafeDelete(osWindow);\n    }\n\n    void testPbufferCompatibility(EGLConfig pbufferConfig, EGLConfig contextConfig, bool compatible) const\n    {\n        EGLContext context = eglCreateContext(mDisplay, contextConfig, EGL_NO_CONTEXT, contextAttribs);\n        ASSERT_TRUE(context != EGL_NO_CONTEXT);\n\n        const EGLint pBufferAttribs[] =\n        {\n            EGL_WIDTH, 500,\n            EGL_HEIGHT, 500,\n            EGL_NONE,\n        };\n        EGLSurface pbuffer = eglCreatePbufferSurface(mDisplay, pbufferConfig, pBufferAttribs);\n        ASSERT_TRUE(pbuffer != EGL_NO_SURFACE);\n\n        if (compatible)\n        {\n            testClearSurface(pbuffer, context);\n        }\n        else\n        {\n            testMakeCurrentFails(pbuffer, context);\n        }\n\n        eglDestroySurface(mDisplay, pbuffer);\n        ASSERT_EGL_SUCCESS();\n\n        eglDestroyContext(mDisplay, context);\n        ASSERT_EGL_SUCCESS();\n    }\n\n    std::vector<EGLConfig> mConfigs;\n    EGLDisplay mDisplay;\n\n  private:\n    void testClearSurface(EGLSurface surface, EGLContext context) const\n    {\n        eglMakeCurrent(mDisplay, surface, surface, context);\n        ASSERT_EGL_SUCCESS();\n\n        glViewport(0, 0, 500, 500);\n        glClearColor(0.0f, 0.0f, 1.0f, 1.0f);\n        glClear(GL_COLOR_BUFFER_BIT);\n        ASSERT_GL_NO_ERROR();\n        EXPECT_PIXEL_EQ(250, 250, 0, 0, 255, 255);\n\n        eglMakeCurrent(mDisplay, EGL_NO_SURFACE, EGL_NO_SURFACE, EGL_NO_CONTEXT);\n        ASSERT_EGL_SUCCESS();\n    }\n\n    void testMakeCurrentFails(EGLSurface surface, EGLContext context) const\n    {\n        eglMakeCurrent(mDisplay, surface, surface, context);\n        EXPECT_EGL_ERROR(EGL_BAD_MATCH);\n    }\n};\n\n\/\/ The test is split in several subtest so that simple cases\n\/\/ are tested separately. Also each surface types are not tested\n\/\/ together.\n\n\/\/ Basic test checking contexts and windows created with the\n\/\/ same config can render.\nTEST_P(EGLContextCompatibilityTest, WindowSameConfig)\n{\n    for (size_t i = 0; i < mConfigs.size(); i++)\n    {\n        EGLConfig config = mConfigs[i];\n\n        EGLint surfaceType;\n        eglGetConfigAttrib(mDisplay, config, EGL_SURFACE_TYPE, &surfaceType);\n        ASSERT_EGL_SUCCESS();\n\n        if ((surfaceType & EGL_WINDOW_BIT) != 0)\n        {\n            testWindowCompatibility(config, config, true);\n        }\n    }\n}\n\n\/\/ Basic test checking contexts and pbuffers created with the\n\/\/ same config can render.\nTEST_P(EGLContextCompatibilityTest, PbufferSameConfig)\n{\n    for (size_t i = 0; i < mConfigs.size(); i++)\n    {\n        EGLConfig config = mConfigs[i];\n\n        EGLint surfaceType;\n        eglGetConfigAttrib(mDisplay, config, EGL_SURFACE_TYPE, &surfaceType);\n        ASSERT_EGL_SUCCESS();\n\n        if ((surfaceType & EGL_PBUFFER_BIT) != 0)\n        {\n            testPbufferCompatibility(config, config, true);\n        }\n    }\n}\n\n\/\/ Check that a context rendering to a window with a different\n\/\/ config works or errors according to the EGL compatibility rules\nTEST_P(EGLContextCompatibilityTest, WindowDifferentConfig)\n{\n    for (size_t i = 0; i < mConfigs.size(); i++)\n    {\n        EGLConfig config1 = mConfigs[i];\n        EGLint surfaceType;\n        eglGetConfigAttrib(mDisplay, config1, EGL_SURFACE_TYPE, &surfaceType);\n        ASSERT_EGL_SUCCESS();\n\n        if ((surfaceType & EGL_WINDOW_BIT) == 0)\n        {\n            continue;\n        }\n\n        for (size_t j = 0; j < mConfigs.size(); j++)\n        {\n            EGLConfig config2 = mConfigs[j];\n            testPbufferCompatibility(config1, config2, areConfigsCompatible(config1, config2, EGL_WINDOW_BIT));\n        }\n    }\n}\n\n\/\/ Check that a context rendering to a pbuffer with a different\n\/\/ config works or errors according to the EGL compatibility rules\nTEST_P(EGLContextCompatibilityTest, PbufferDifferentConfig)\n{\n    for (size_t i = 0; i < mConfigs.size(); i++)\n    {\n        EGLConfig config1 = mConfigs[i];\n        EGLint surfaceType;\n        eglGetConfigAttrib(mDisplay, config1, EGL_SURFACE_TYPE, &surfaceType);\n        ASSERT_EGL_SUCCESS();\n\n        if ((surfaceType & EGL_PBUFFER_BIT) == 0)\n        {\n            continue;\n        }\n\n        for (size_t j = 0; j < mConfigs.size(); j++)\n        {\n            EGLConfig config2 = mConfigs[j];\n            testPbufferCompatibility(config1, config2, areConfigsCompatible(config1, config2, EGL_PBUFFER_BIT));\n        }\n    }\n}\n\nANGLE_INSTANTIATE_TEST(EGLContextCompatibilityTest, ES2_D3D9(), ES2_D3D11(), ES2_OPENGL());\n<commit_msg>EGLContextCompatTest: fix typo in WindowDifferentConfig<commit_after>\/\/\n\/\/ Copyright (c) 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\/\/ EGLContextCompatibilityTest.cpp:\n\/\/   This test will try to use all combinations of context configs and\n\/\/   surface configs. If the configs are compatible, it checks that simple\n\/\/   rendering works, otherwise it checks an error is generated one MakeCurrent.\n#include <gtest\/gtest.h>\n\n#include <vector>\n#include <EGL\/egl.h>\n#include <EGL\/eglext.h>\n\n#include \"OSWindow.h\"\n#include \"test_utils\/ANGLETest.h\"\n#include \"test_utils\/angle_test_configs.h\"\n\nusing namespace angle;\n\nnamespace\n{\n\nconst EGLint contextAttribs[] =\n{\n    EGL_CONTEXT_CLIENT_VERSION, 2,\n    EGL_NONE\n};\n\n}\n\nclass EGLContextCompatibilityTest : public ANGLETest\n{\n  public:\n    EGLContextCompatibilityTest()\n      : mDisplay(0)\n    {\n    }\n\n    void SetUp() override\n    {\n        PFNEGLGETPLATFORMDISPLAYEXTPROC eglGetPlatformDisplayEXT = reinterpret_cast<PFNEGLGETPLATFORMDISPLAYEXTPROC>(eglGetProcAddress(\"eglGetPlatformDisplayEXT\"));\n        ASSERT_TRUE(eglGetPlatformDisplayEXT != nullptr);\n\n        EGLint dispattrs[] =\n        {\n            EGL_PLATFORM_ANGLE_TYPE_ANGLE, GetParam().getRenderer(),\n            EGL_NONE\n        };\n        mDisplay = eglGetPlatformDisplayEXT(EGL_PLATFORM_ANGLE_ANGLE, EGL_DEFAULT_DISPLAY, dispattrs);\n        ASSERT_TRUE(mDisplay != EGL_NO_DISPLAY);\n\n        ASSERT_TRUE(eglInitialize(mDisplay, nullptr, nullptr) == EGL_TRUE);\n\n        int nConfigs = 0;\n        ASSERT_TRUE(eglGetConfigs(mDisplay, nullptr, 0, &nConfigs) == EGL_TRUE);\n        ASSERT_TRUE(nConfigs != 0);\n\n        int nReturnedConfigs = 0;\n        mConfigs.resize(nConfigs);\n        ASSERT_TRUE(eglGetConfigs(mDisplay, mConfigs.data(), nConfigs, &nReturnedConfigs) == EGL_TRUE);\n        ASSERT_TRUE(nConfigs == nReturnedConfigs);\n    }\n\n    void TearDown() override\n    {\n        eglMakeCurrent(mDisplay, EGL_NO_SURFACE, EGL_NO_SURFACE, EGL_NO_CONTEXT);\n        eglTerminate(mDisplay);\n    };\n\n  protected:\n    bool areConfigsCompatible(EGLConfig c1, EGLConfig c2, EGLint surfaceBit)\n    {\n        EGLint colorBufferType1, colorBufferType2;\n        EGLint red1, red2, green1, green2, blue1, blue2, alpha1, alpha2;\n        EGLint depth1, depth2, stencil1, stencil2;\n        EGLint surfaceType1, surfaceType2;\n\n        eglGetConfigAttrib(mDisplay, c1, EGL_COLOR_BUFFER_TYPE, &colorBufferType1);\n        eglGetConfigAttrib(mDisplay, c2, EGL_COLOR_BUFFER_TYPE, &colorBufferType2);\n\n        eglGetConfigAttrib(mDisplay, c1, EGL_RED_SIZE, &red1);\n        eglGetConfigAttrib(mDisplay, c2, EGL_RED_SIZE, &red2);\n        eglGetConfigAttrib(mDisplay, c1, EGL_GREEN_SIZE, &green1);\n        eglGetConfigAttrib(mDisplay, c2, EGL_GREEN_SIZE, &green2);\n        eglGetConfigAttrib(mDisplay, c1, EGL_BLUE_SIZE, &blue1);\n        eglGetConfigAttrib(mDisplay, c2, EGL_BLUE_SIZE, &blue2);\n        eglGetConfigAttrib(mDisplay, c1, EGL_ALPHA_SIZE, &alpha1);\n        eglGetConfigAttrib(mDisplay, c2, EGL_ALPHA_SIZE, &alpha2);\n\n        eglGetConfigAttrib(mDisplay, c1, EGL_DEPTH_SIZE, &depth1);\n        eglGetConfigAttrib(mDisplay, c2, EGL_DEPTH_SIZE, &depth2);\n        eglGetConfigAttrib(mDisplay, c1, EGL_STENCIL_SIZE, &stencil1);\n        eglGetConfigAttrib(mDisplay, c2, EGL_STENCIL_SIZE, &stencil2);\n\n        eglGetConfigAttrib(mDisplay, c1, EGL_SURFACE_TYPE, &surfaceType1);\n        eglGetConfigAttrib(mDisplay, c2, EGL_SURFACE_TYPE, &surfaceType2);\n\n        return colorBufferType1 == colorBufferType2 &&\n               red1 == red2 && green1 == green2 && blue1 == blue2 && alpha1 == alpha2 &&\n               depth1 == depth2 && stencil1 == stencil2 &&\n               (surfaceType1 & surfaceBit) != 0 &&\n               (surfaceType2 & surfaceBit) != 0;\n    }\n\n    void testWindowCompatibility(EGLConfig windowConfig, EGLConfig contextConfig, bool compatible) const\n    {\n        OSWindow *osWindow = CreateOSWindow();\n        ASSERT_TRUE(osWindow != nullptr);\n        osWindow->initialize(\"EGLContextCompatibilityTest\", 500, 500);\n        osWindow->setVisible(true);\n\n        EGLContext context = eglCreateContext(mDisplay, contextConfig, EGL_NO_CONTEXT, contextAttribs);\n        ASSERT_TRUE(context != EGL_NO_CONTEXT);\n\n        EGLSurface window = eglCreateWindowSurface(mDisplay, windowConfig, osWindow->getNativeWindow(), nullptr);\n        ASSERT_EGL_SUCCESS();\n\n        if (compatible)\n        {\n            testClearSurface(window, context);\n        }\n        else\n        {\n            testMakeCurrentFails(window, context);\n        }\n\n        eglDestroySurface(mDisplay, window);\n        ASSERT_EGL_SUCCESS();\n\n        eglDestroyContext(mDisplay, context);\n        ASSERT_EGL_SUCCESS();\n\n        SafeDelete(osWindow);\n    }\n\n    void testPbufferCompatibility(EGLConfig pbufferConfig, EGLConfig contextConfig, bool compatible) const\n    {\n        EGLContext context = eglCreateContext(mDisplay, contextConfig, EGL_NO_CONTEXT, contextAttribs);\n        ASSERT_TRUE(context != EGL_NO_CONTEXT);\n\n        const EGLint pBufferAttribs[] =\n        {\n            EGL_WIDTH, 500,\n            EGL_HEIGHT, 500,\n            EGL_NONE,\n        };\n        EGLSurface pbuffer = eglCreatePbufferSurface(mDisplay, pbufferConfig, pBufferAttribs);\n        ASSERT_TRUE(pbuffer != EGL_NO_SURFACE);\n\n        if (compatible)\n        {\n            testClearSurface(pbuffer, context);\n        }\n        else\n        {\n            testMakeCurrentFails(pbuffer, context);\n        }\n\n        eglDestroySurface(mDisplay, pbuffer);\n        ASSERT_EGL_SUCCESS();\n\n        eglDestroyContext(mDisplay, context);\n        ASSERT_EGL_SUCCESS();\n    }\n\n    std::vector<EGLConfig> mConfigs;\n    EGLDisplay mDisplay;\n\n  private:\n    void testClearSurface(EGLSurface surface, EGLContext context) const\n    {\n        eglMakeCurrent(mDisplay, surface, surface, context);\n        ASSERT_EGL_SUCCESS();\n\n        glViewport(0, 0, 500, 500);\n        glClearColor(0.0f, 0.0f, 1.0f, 1.0f);\n        glClear(GL_COLOR_BUFFER_BIT);\n        ASSERT_GL_NO_ERROR();\n        EXPECT_PIXEL_EQ(250, 250, 0, 0, 255, 255);\n\n        eglMakeCurrent(mDisplay, EGL_NO_SURFACE, EGL_NO_SURFACE, EGL_NO_CONTEXT);\n        ASSERT_EGL_SUCCESS();\n    }\n\n    void testMakeCurrentFails(EGLSurface surface, EGLContext context) const\n    {\n        eglMakeCurrent(mDisplay, surface, surface, context);\n        EXPECT_EGL_ERROR(EGL_BAD_MATCH);\n    }\n};\n\n\/\/ The test is split in several subtest so that simple cases\n\/\/ are tested separately. Also each surface types are not tested\n\/\/ together.\n\n\/\/ Basic test checking contexts and windows created with the\n\/\/ same config can render.\nTEST_P(EGLContextCompatibilityTest, WindowSameConfig)\n{\n    for (size_t i = 0; i < mConfigs.size(); i++)\n    {\n        EGLConfig config = mConfigs[i];\n\n        EGLint surfaceType;\n        eglGetConfigAttrib(mDisplay, config, EGL_SURFACE_TYPE, &surfaceType);\n        ASSERT_EGL_SUCCESS();\n\n        if ((surfaceType & EGL_WINDOW_BIT) != 0)\n        {\n            testWindowCompatibility(config, config, true);\n        }\n    }\n}\n\n\/\/ Basic test checking contexts and pbuffers created with the\n\/\/ same config can render.\nTEST_P(EGLContextCompatibilityTest, PbufferSameConfig)\n{\n    for (size_t i = 0; i < mConfigs.size(); i++)\n    {\n        EGLConfig config = mConfigs[i];\n\n        EGLint surfaceType;\n        eglGetConfigAttrib(mDisplay, config, EGL_SURFACE_TYPE, &surfaceType);\n        ASSERT_EGL_SUCCESS();\n\n        if ((surfaceType & EGL_PBUFFER_BIT) != 0)\n        {\n            testPbufferCompatibility(config, config, true);\n        }\n    }\n}\n\n\/\/ Check that a context rendering to a window with a different\n\/\/ config works or errors according to the EGL compatibility rules\nTEST_P(EGLContextCompatibilityTest, WindowDifferentConfig)\n{\n    for (size_t i = 0; i < mConfigs.size(); i++)\n    {\n        EGLConfig config1 = mConfigs[i];\n        EGLint surfaceType;\n        eglGetConfigAttrib(mDisplay, config1, EGL_SURFACE_TYPE, &surfaceType);\n        ASSERT_EGL_SUCCESS();\n\n        if ((surfaceType & EGL_WINDOW_BIT) == 0)\n        {\n            continue;\n        }\n\n        for (size_t j = 0; j < mConfigs.size(); j++)\n        {\n            EGLConfig config2 = mConfigs[j];\n            testWindowCompatibility(config1, config2,\n                                    areConfigsCompatible(config1, config2, EGL_WINDOW_BIT));\n        }\n    }\n}\n\n\/\/ Check that a context rendering to a pbuffer with a different\n\/\/ config works or errors according to the EGL compatibility rules\nTEST_P(EGLContextCompatibilityTest, PbufferDifferentConfig)\n{\n    for (size_t i = 0; i < mConfigs.size(); i++)\n    {\n        EGLConfig config1 = mConfigs[i];\n        EGLint surfaceType;\n        eglGetConfigAttrib(mDisplay, config1, EGL_SURFACE_TYPE, &surfaceType);\n        ASSERT_EGL_SUCCESS();\n\n        if ((surfaceType & EGL_PBUFFER_BIT) == 0)\n        {\n            continue;\n        }\n\n        for (size_t j = 0; j < mConfigs.size(); j++)\n        {\n            EGLConfig config2 = mConfigs[j];\n            testPbufferCompatibility(config1, config2, areConfigsCompatible(config1, config2, EGL_PBUFFER_BIT));\n        }\n    }\n}\n\nANGLE_INSTANTIATE_TEST(EGLContextCompatibilityTest, ES2_D3D9(), ES2_D3D11(), ES2_OPENGL());\n<|endoftext|>"}
{"text":"<commit_before>#include \"Application.hpp\"\n#include \"Stdafx.hpp\"\n\n\/* ----------------------------------------------------------------------\n* Author: Octav\n* Date: 2nd August 2014\n* Description: Constructs an application.\n* ----------------------------------------------------------------------\n*\/\n\tApplication::Application() \n\t: window(sf::VideoMode(SCREEN_WIDTH, SCREEN_HEIGHT, 32), \"Flume Tiled Map Editor\")\n\t{\n\t\tauto tools = sfg::Window::Create();\n\t\tauto box = sfg::Box::Create(sfg::Box::Orientation::VERTICAL, 5.0f);\n\t\tauto button_row = sfg::Box::Create(sfg::Box::Orientation::HORIZONTAL, 5.0f);\n\t\tauto button1 = sfg::Button::Create(\"New layer\");\n\t\tauto button2 = sfg::Button::Create(\"Load Tileset\");\n\t\tauto infoframe = sfg::Frame::Create(\"info\");\n\n\t\ttools->SetTitle(\"Tool window\");\n\t\t\n\t\tauto infotext = sfg::Label::Create(\"This is the alpha version of Flume.\");\n\t\tinfoframe->Add(infotext);\n\n\t\tbutton_row->Pack(button1, false, false);\n\t\tbutton_row->Pack(button2, false, false);\n\t\tbox->Pack(button_row);\n\t\tbox->Pack(infoframe);\n\t\ttools->Add(box);\n\t\tdesktop.Add(tools);\n\t}\n\n\/* ----------------------------------------------------------------------\n* Author: Octav\n* Date: 2nd August 2014\n* Description: Constructs an application.\n* ----------------------------------------------------------------------\n*\/\n\tvoid Application::Run()\n\t{\n\t\twindow.resetGLStates();\n\n\t\twhile (window.isOpen()) {\n\t\t\twhile (window.pollEvent(event)) {\n\t\t\t\tdesktop.HandleEvent(event);\n\n\t\t\t\tif (event.type == sf::Event::Closed) {\n\t\t\t\t\twindow.close();\n\t\t\t\t}\n\n\t\t\t\telse if (event.type == sf::Event::KeyPressed && sf::Keyboard::isKeyPressed(sf::Keyboard::Escape))\n\t\t\t\t\twindow.close();\n\t\t\t}\n\n\t\t\tdesktop.Update(clock.restart().asSeconds());\n\n\t\t\twindow.clear();\n\t\t\tm_sfgui.Display(window);\n\t\t\twindow.display();\n\t\t}\n\t}<commit_msg>Added a basic layout and some components<commit_after>#include \"Application.hpp\"\n#include \"Stdafx.hpp\"\n\n\/* ----------------------------------------------------------------------\n* Author: Octav\n* Date: 2nd August 2014\n* Description: Constructs an application.\n* ----------------------------------------------------------------------\n*\/\n\tApplication::Application() \n\t: window(sf::VideoMode(SCREEN_WIDTH, SCREEN_HEIGHT, 32), \"Flume Tiled Map Editor\")\n\t{\n\t\tauto tools = sfg::Window::Create();\n\t\tauto layers = sfg::Window::Create();\n\t\tauto box = sfg::Box::Create(sfg::Box::Orientation::VERTICAL, 5.0f);\n\t\tauto layersBox = sfg::Box::Create(sfg::Box::Orientation::VERTICAL, 5.0f);\n\t\tauto button_row = sfg::Box::Create(sfg::Box::Orientation::HORIZONTAL, 0.0f);\n\t\tauto button1 = sfg::Button::Create(\"Save Map\");\n\t\tauto button2 = sfg::Button::Create(\"Load Map\");\n\t\tauto infoframe = sfg::Frame::Create(\"info\");\n\t\tauto scrolledwindow = sfg::ScrolledWindow::Create();\n\n\t\tscrolledwindow->SetScrollbarPolicy(sfg::ScrolledWindow::HORIZONTAL_NEVER | sfg::ScrolledWindow::VERTICAL_AUTOMATIC);\n\t\tscrolledwindow->SetRequisition(sf::Vector2f(170.f, 100.f));\n\t\ttools->SetTitle(\"Tool window\");\n\t\tlayers->SetTitle(\"Layer List\");\n\t\ttools->SetPosition(sf::Vector2f(30,30));\n\n\t\tstd::string frameText = wrap(\"This is the alpha version of Flume. Use the buttons above to create a new layer and save your work\", 20);\n\t\t\n\t\tauto infotext = sfg::Label::Create(frameText);\n\t\tinfoframe->Add(infotext);\n\t\tlayers->SetPosition(sf::Vector2f(tools->GetAbsolutePosition().x, tools->GetAbsolutePosition().y+tools->GetClientRect().height*5));\n\n\t\tbutton_row->Pack(button1, true);\n\t\tbutton_row->Pack(button2, true);\n\t\tbox->Pack(button_row);\n\t\tbox->Pack(infoframe);\n\t\tlayersBox->Pack(sfg::Label::Create(\"Layer list: \"), false, true);\n\t\tlayersBox->Pack(scrolledwindow, false, true);\n\t\ttools->Add(box);\n\t\tlayers->Add(layersBox);\n\t\tdesktop.Add(tools);\n\t\tdesktop.Add(layers);\n\t}\n\n\/* ----------------------------------------------------------------------\n* Author: Octav\n* Date: 2nd August 2014\n* Description: Constructs an application.\n* ----------------------------------------------------------------------\n*\/\n\tvoid Application::Run()\n\t{\n\t\twindow.resetGLStates();\n\n\t\twhile (window.isOpen()) {\n\t\t\twhile (window.pollEvent(event)) {\n\t\t\t\tdesktop.HandleEvent(event);\n\n\t\t\t\tif (event.type == sf::Event::Closed) {\n\t\t\t\t\twindow.close();\n\t\t\t\t}\n\n\t\t\t\telse if (event.type == sf::Event::KeyPressed && sf::Keyboard::isKeyPressed(sf::Keyboard::Escape))\n\t\t\t\t\twindow.close();\n\t\t\t}\n\n\t\t\tdesktop.Update(clock.restart().asSeconds());\n\n\t\t\twindow.clear();\n\t\t\tm_sfgui.Display(window);\n\t\t\twindow.display();\n\t\t}\n\t}<|endoftext|>"}
{"text":"<commit_before>\/\/Copyright (c) 2017 Ultimaker B.V.\n\/\/CuraEngine is released under the terms of the AGPLv3 or higher.\n\n#include \"utils\/intpoint.h\" \/\/To normalize vectors.\n#include \"utils\/math.h\" \/\/For round_up_divide and PI.\n#include \"utils\/MinimumSpanningTree.h\" \/\/For connecting the correct nodes together to form an efficient tree.\n#include \"utils\/polygonUtils.h\" \/\/For moveInside.\n\n#include \"TreeSupport.h\"\n\n#define SQRT_2 1.4142135623730950488 \/\/Square root of 2.\n#define CIRCLE_RESOLUTION 10 \/\/The number of vertices in each circle.\n\nnamespace cura\n{\n\nTreeSupport::TreeSupport()\n{\n}\n\nvoid TreeSupport::generateSupportAreas(SliceDataStorage& storage)\n{\n    std::vector<std::unordered_set<Point>> contact_points;\n    std::vector<std::unordered_map<Point, Node>> contact_nodes;\n    contact_points.reserve(storage.support.supportLayers.size());\n    contact_nodes.reserve(storage.support.supportLayers.size());\n    for (size_t layer_nr = 0; layer_nr < storage.support.supportLayers.size(); layer_nr++) \/\/Generate empty layers to store the points in.\n    {\n        contact_points.emplace_back();\n        contact_nodes.emplace_back();\n    }\n    for (SliceMeshStorage& mesh : storage.meshes)\n    {\n        if (!mesh.getSettingBoolean(\"support_tree_enable\"))\n        {\n            return;\n        }\n        generateContactPoints(mesh, contact_points, contact_nodes);\n    }\n\n    \/\/Generate areas that have to be avoided.\n    const coord_t layer_height = storage.getSettingInMicrons(\"layer_height\");\n    const double angle = storage.getSettingInAngleRadians(\"support_tree_angle\");\n    const coord_t maximum_move_distance = tan(angle) * layer_height;\n    const coord_t branch_radius = storage.getSettingInMicrons(\"support_tree_branch_diameter\") >> 1;\n    std::vector<Polygons> model_collision; \/\/Areas that have to be avoided by the tips of the branches.\n    std::vector<Polygons> model_collision_branch_radius; \/\/Areas that have to be avoided by the base of the branches (with branch diameter added for a better approximation).\n    const coord_t xy_distance = storage.getSettingInMicrons(\"support_xy_distance\");\n    constexpr bool include_helper_parts = false;\n    model_collision.push_back(storage.getLayerOutlines(0, include_helper_parts).offset(xy_distance, ClipperLib::JoinType::jtRound));\n    model_collision_branch_radius.push_back(model_collision[0].offset(branch_radius, ClipperLib::JoinType::jtRound));\n    \/\/TODO: If allowing support to rest on model, these need to be just the model outlines.\n    for (size_t layer_nr = 1; layer_nr < storage.print_layer_count; layer_nr++)\n    {\n        \/\/Generate an area above the current layer where you'd still collide with the current layer if you were to move with at most maximum_move_distance.\n        model_collision.push_back(model_collision[layer_nr - 1].offset(-maximum_move_distance, ClipperLib::JoinType::jtRound)); \/\/Inset previous layer with maximum_move_distance to allow some movement.\n        model_collision[layer_nr] = model_collision[layer_nr].unionPolygons(storage.getLayerOutlines(layer_nr, include_helper_parts).offset(xy_distance, ClipperLib::JoinType::jtRound)); \/\/Add current layer's collision to that.\n        model_collision_branch_radius.push_back(model_collision[layer_nr].offset(branch_radius, ClipperLib::JoinType::jtRound));\n    }\n\n    \/\/Use Minimum Spanning Tree to connect the points on each layer and move them while dropping them down.\n    const coord_t line_width = storage.getSettingInMicrons(\"support_line_width\");\n    const double diameter_angle_scale_factor = sin(storage.getSettingInAngleRadians(\"support_tree_branch_diameter_angle\")) * layer_height \/ branch_radius; \/\/Scale factor per layer to produce the desired angle.\n    const size_t tip_layers = branch_radius \/ layer_height; \/\/The number of layers to be shrinking the circle to create a tip. This produces a 45 degree angle.\n    for (size_t layer_nr = contact_points.size() - 1; layer_nr > 0; layer_nr--) \/\/Skip layer 0, since we can't drop down the vertices there.\n    {\n        MinimumSpanningTree mst(contact_points[layer_nr]);\n        for (Point vertex : contact_points[layer_nr])\n        {\n            const Node node = contact_nodes[layer_nr][vertex];\n            Point next_layer_vertex = vertex;\n            std::vector<Point> neighbours = mst.adjacentNodes(vertex);\n            if (!neighbours.empty()) \/\/Need to move towards the neighbours.\n            {\n                Point sum_direction(0, 0);\n                for (Point neighbour : neighbours)\n                {\n                    sum_direction += neighbour - vertex;\n                }\n                Point motion = normal(sum_direction, maximum_move_distance);\n                if (neighbours.size() == 1 && vSize2(sum_direction) < maximum_move_distance * maximum_move_distance)\n                {\n                    if (mst.adjacentNodes(neighbours[0]).size() == 1) \/\/We just have two nodes left!\n                    {\n                        next_layer_vertex += motion \/ 2;\n                    }\n                    else \/\/This is a leaf that's about to collapse. Leave it out on the next layer.\n                    {\n                        contact_nodes[layer_nr - 1][neighbours[0]].distance_to_top = std::max(contact_nodes[layer_nr - 1][neighbours[0]].distance_to_top, node.distance_to_top);\n                        contact_nodes[layer_nr - 1][neighbours[0]].support_roof_layers_below = std::max(contact_nodes[layer_nr - 1][neighbours[0]].support_roof_layers_below, node.support_roof_layers_below);\n                        continue;\n                    }\n                }\n                else\n                {\n                    next_layer_vertex += motion;\n                }\n            }\n\n            \/\/Avoid collisions.\n            if (node.distance_to_top > tip_layers) \/\/Main branch.\n            {\n                const coord_t branch_radius_node = branch_radius * node.distance_to_top * diameter_angle_scale_factor;\n                PolygonUtils::moveOutside(model_collision_branch_radius[layer_nr - 1], next_layer_vertex, branch_radius_node, maximum_move_distance * maximum_move_distance);\n            }\n            else \/\/Tip.\n            {\n                const coord_t branch_radius_node = branch_radius * node.distance_to_top \/ tip_layers;\n                PolygonUtils::moveOutside(model_collision[layer_nr - 1], next_layer_vertex, branch_radius_node, maximum_move_distance * maximum_move_distance);\n            }\n            if (model_collision[layer_nr].inside(next_layer_vertex)) \/\/We're stuck inside the model down there! Sadly, this branch will have to rest on the model.\n            {\n                continue;\n            }\n            contact_points[layer_nr - 1].insert(next_layer_vertex);\n            contact_nodes[layer_nr - 1][next_layer_vertex].distance_to_top = node.distance_to_top + 1;\n            contact_nodes[layer_nr - 1][next_layer_vertex].skin_direction = node.skin_direction;\n            contact_nodes[layer_nr - 1][next_layer_vertex].support_roof_layers_below = node.support_roof_layers_below - 1;\n        }\n    }\n\n    const unsigned int wall_count = storage.getSettingAsCount(\"support_tree_wall_count\");\n    Polygon branch_circle; \/\/Pre-generate a circle with correct diameter so that we don't have to recompute those (co)sines every time.\n    for (unsigned int i = 0; i < CIRCLE_RESOLUTION; i++)\n    {\n        const double angle = (double)i \/ CIRCLE_RESOLUTION * 2 * M_PI; \/\/In radians.\n        branch_circle.emplace_back(cos(angle) * branch_radius, sin(angle) * branch_radius);\n    }\n    const coord_t circle_side_length = 2 * branch_radius * sin(M_PI \/ CIRCLE_RESOLUTION); \/\/Side length of a regular polygon.\n    for (size_t layer_nr = 0; layer_nr < contact_points.size(); layer_nr++)\n    {\n        Polygons support_layer;\n        Polygons& roof_layer = storage.support.supportLayers[layer_nr].support_roof;\n\n        for (const Point point : contact_points[layer_nr])\n        {\n            const Node& node = contact_nodes[layer_nr][point];\n            Polygon circle;\n            const double scale = (double)(node.distance_to_top + 1) \/ tip_layers;\n            for (Point corner : branch_circle)\n            {\n                if (node.distance_to_top < tip_layers) \/\/We're in the tip.\n                {\n                    if (node.skin_direction)\n                    {\n                        corner = Point(corner.X * (0.5 + scale \/ 2) + corner.Y * (0.5 - scale \/ 2), corner.X * (0.5 - scale \/ 2) + corner.Y * (0.5 + scale \/ 2));\n                    }\n                    else\n                    {\n                        corner = Point(corner.X * (0.5 + scale \/ 2) - corner.Y * (0.5 - scale \/ 2), corner.X * (-0.5 + scale \/ 2) + corner.Y * (0.5 + scale \/ 2));\n                    }\n                }\n                else\n                {\n                    corner *= 1 + (double)(node.distance_to_top - tip_layers) * diameter_angle_scale_factor;\n                }\n                circle.add(point + corner);\n            }\n            if (node.support_roof_layers_below >= 0)\n            {\n                roof_layer.add(circle);\n            }\n            else\n            {\n                support_layer.add(circle);\n            }\n        }\n        support_layer = support_layer.unionPolygons();\n        roof_layer = roof_layer.unionPolygons();\n        support_layer = support_layer.difference(roof_layer);\n        \/\/We smooth this support as much as possible without altering single circles. So we remove any line less than the side length of those circles.\n        const double diameter_angle_scale_factor_this_layer = (double)(storage.support.supportLayers.size() - layer_nr - tip_layers) * diameter_angle_scale_factor; \/\/Maximum scale factor.\n        support_layer.simplify(circle_side_length * (1 + diameter_angle_scale_factor_this_layer), line_width >> 2); \/\/Deviate at most a quarter of a line so that the lines still stack properly.\n        for (PolygonRef part : support_layer) \/\/Convert every part into a PolygonsPart for the support.\n        {\n            PolygonsPart outline;\n            outline.add(part);\n            storage.support.supportLayers[layer_nr].support_infill_parts.emplace_back(outline, line_width, wall_count);\n        }\n        if (!storage.support.supportLayers[layer_nr].support_infill_parts.empty() || !storage.support.supportLayers[layer_nr].support_roof.empty())\n        {\n            storage.support.layer_nr_max_filled_layer = layer_nr;\n        }\n    }\n\n    storage.support.generated = true;\n}\n\nvoid TreeSupport::generateContactPoints(const SliceMeshStorage& mesh, std::vector<std::unordered_set<Point>>& contact_points, std::vector<std::unordered_map<Point, TreeSupport::Node>>& contact_nodes)\n{\n    const coord_t layer_height = mesh.getSettingInMicrons(\"layer_height\");\n    const coord_t z_distance_top = mesh.getSettingInMicrons(\"support_top_distance\");\n    const size_t z_distance_top_layers = std::max(0U, round_up_divide(z_distance_top, layer_height)) + 1; \/\/Support must always be 1 layer below overhang.\n    const size_t support_roof_layers = mesh.getSettingBoolean(\"support_roof_enable\") ? round_divide(mesh.getSettingInMicrons(\"support_roof_height\"), mesh.getSettingInMicrons(\"layer_height\")) : 0; \/\/How many roof layers, if roof is enabled.\n    for (size_t layer_nr = 0; layer_nr < mesh.overhang_areas.size() - z_distance_top_layers; layer_nr++)\n    {\n        const Polygons& overhang = mesh.overhang_areas[layer_nr + z_distance_top_layers];\n        if (overhang.empty())\n        {\n            continue;\n        }\n\n        \/\/First generate a lot of points in a grid pattern.\n        const Polygons outside_polygons = overhang.getOutsidePolygons();\n        const AABB bounding_box(outside_polygons); \/\/To know how far we should generate points.\n        const coord_t point_spread = mesh.getSettingInMicrons(\"support_tree_branch_distance\");\n\n        \/\/We want to create the grid pattern at an angle, so compute the bounding box required to cover that angle.\n        constexpr double rotate_angle = 22.0 \/ 180.0 * M_PI; \/\/Rotation of 22 degrees provides better support of diagonal lines.\n        const Point bounding_box_size = bounding_box.max - bounding_box.min;\n        AABB rotated_bounding_box;\n        rotated_bounding_box.include(Point(0, 0));\n        rotated_bounding_box.include(rotate(bounding_box_size, -rotate_angle));\n        rotated_bounding_box.include(rotate(Point(0, bounding_box_size.Y), -rotate_angle));\n        rotated_bounding_box.include(rotate(Point(bounding_box_size.X, 0), -rotate_angle));\n        AABB unrotated_bounding_box;\n        unrotated_bounding_box.include(rotate(rotated_bounding_box.min, rotate_angle));\n        unrotated_bounding_box.include(rotate(rotated_bounding_box.max, rotate_angle));\n        unrotated_bounding_box.include(rotate(Point(rotated_bounding_box.min.X, rotated_bounding_box.max.Y), rotate_angle));\n        unrotated_bounding_box.include(rotate(Point(rotated_bounding_box.max.X, rotated_bounding_box.min.Y), rotate_angle));\n\n        for (const ConstPolygonRef overhang_part : outside_polygons)\n        {\n            bool added = false; \/\/Did we add a point this way?\n            for (coord_t x = unrotated_bounding_box.min.X; x <= unrotated_bounding_box.max.X; x += point_spread)\n            {\n                for (coord_t y = unrotated_bounding_box.min.Y; y <= unrotated_bounding_box.max.Y; y += point_spread)\n                {\n                    Point candidate = rotate(Point(x, y), rotate_angle) + bounding_box.min;\n                    constexpr bool border_is_inside = true;\n                    if (overhang_part.inside(candidate, border_is_inside))\n                    {\n                        contact_points[layer_nr].insert(candidate);\n                        contact_nodes[layer_nr][candidate] = Node();\n                        contact_nodes[layer_nr][candidate].skin_direction = (layer_nr + z_distance_top_layers) % 2;\n                        contact_nodes[layer_nr][candidate].support_roof_layers_below = support_roof_layers;\n                        added = true;\n                    }\n                }\n            }\n            if (!added) \/\/If we didn't add any points due to bad luck, we want to add one anyway such that loose parts are also supported.\n            {\n                Point candidate = bounding_box.getMiddle();\n                PolygonUtils::moveInside(overhang_part, candidate);\n                contact_points[layer_nr].insert(candidate);\n                contact_nodes[layer_nr][candidate] = Node();\n                contact_nodes[layer_nr][candidate].skin_direction = layer_nr % 2;\n                contact_nodes[layer_nr][candidate].support_roof_layers_below = support_roof_layers;\n            }\n        }\n    }\n}\n\n}<commit_msg>Fix generating model collision areas with offset<commit_after>\/\/Copyright (c) 2017 Ultimaker B.V.\n\/\/CuraEngine is released under the terms of the AGPLv3 or higher.\n\n#include \"utils\/intpoint.h\" \/\/To normalize vectors.\n#include \"utils\/math.h\" \/\/For round_up_divide and PI.\n#include \"utils\/MinimumSpanningTree.h\" \/\/For connecting the correct nodes together to form an efficient tree.\n#include \"utils\/polygonUtils.h\" \/\/For moveInside.\n\n#include \"TreeSupport.h\"\n\n#define SQRT_2 1.4142135623730950488 \/\/Square root of 2.\n#define CIRCLE_RESOLUTION 10 \/\/The number of vertices in each circle.\n\nnamespace cura\n{\n\nTreeSupport::TreeSupport()\n{\n}\n\nvoid TreeSupport::generateSupportAreas(SliceDataStorage& storage)\n{\n    std::vector<std::unordered_set<Point>> contact_points;\n    std::vector<std::unordered_map<Point, Node>> contact_nodes;\n    contact_points.reserve(storage.support.supportLayers.size());\n    contact_nodes.reserve(storage.support.supportLayers.size());\n    for (size_t layer_nr = 0; layer_nr < storage.support.supportLayers.size(); layer_nr++) \/\/Generate empty layers to store the points in.\n    {\n        contact_points.emplace_back();\n        contact_nodes.emplace_back();\n    }\n    for (SliceMeshStorage& mesh : storage.meshes)\n    {\n        if (!mesh.getSettingBoolean(\"support_tree_enable\"))\n        {\n            return;\n        }\n        generateContactPoints(mesh, contact_points, contact_nodes);\n    }\n\n    \/\/Generate areas that have to be avoided.\n    const coord_t layer_height = storage.getSettingInMicrons(\"layer_height\");\n    const double angle = storage.getSettingInAngleRadians(\"support_tree_angle\");\n    const coord_t maximum_move_distance = tan(angle) * layer_height;\n    const coord_t branch_radius = storage.getSettingInMicrons(\"support_tree_branch_diameter\") >> 1;\n    std::vector<Polygons> model_collision; \/\/Areas that have to be avoided by the tips of the branches.\n    std::vector<Polygons> model_collision_branch_radius; \/\/Areas that have to be avoided by the base of the branches (with branch diameter added for a better approximation).\n    const coord_t xy_distance = storage.getSettingInMicrons(\"support_xy_distance\");\n    constexpr bool include_helper_parts = false;\n    model_collision.push_back(storage.getLayerOutlines(0, include_helper_parts).offset(xy_distance, ClipperLib::JoinType::jtRound));\n    model_collision_branch_radius.push_back(model_collision[0].offset(branch_radius, ClipperLib::JoinType::jtRound));\n    \/\/TODO: If allowing support to rest on model, these need to be just the model outlines.\n    for (size_t layer_nr = 1; layer_nr < storage.print_layer_count; layer_nr++)\n    {\n        \/\/Generate an area above the current layer where you'd still collide with the current layer if you were to move with at most maximum_move_distance.\n        model_collision.push_back(model_collision[layer_nr - 1].offset(-maximum_move_distance, ClipperLib::JoinType::jtRound)); \/\/Inset previous layer with maximum_move_distance to allow some movement.\n        model_collision[layer_nr] = model_collision[layer_nr].unionPolygons(storage.getLayerOutlines(layer_nr, include_helper_parts).offset(xy_distance, ClipperLib::JoinType::jtRound)); \/\/Add current layer's collision to that.\n        model_collision_branch_radius.push_back(model_collision_branch_radius[layer_nr - 1].offset(-maximum_move_distance, ClipperLib::JoinType::jtRound));\n        model_collision_branch_radius[layer_nr] = model_collision_branch_radius[layer_nr].unionPolygons(storage.getLayerOutlines(layer_nr, include_helper_parts).offset(xy_distance + branch_radius, ClipperLib::JoinType::jtRound));\n    }\n\n    \/\/Use Minimum Spanning Tree to connect the points on each layer and move them while dropping them down.\n    const coord_t line_width = storage.getSettingInMicrons(\"support_line_width\");\n    const double diameter_angle_scale_factor = sin(storage.getSettingInAngleRadians(\"support_tree_branch_diameter_angle\")) * layer_height \/ branch_radius; \/\/Scale factor per layer to produce the desired angle.\n    const size_t tip_layers = branch_radius \/ layer_height; \/\/The number of layers to be shrinking the circle to create a tip. This produces a 45 degree angle.\n    for (size_t layer_nr = contact_points.size() - 1; layer_nr > 0; layer_nr--) \/\/Skip layer 0, since we can't drop down the vertices there.\n    {\n        MinimumSpanningTree mst(contact_points[layer_nr]);\n        for (Point vertex : contact_points[layer_nr])\n        {\n            const Node node = contact_nodes[layer_nr][vertex];\n            Point next_layer_vertex = vertex;\n            std::vector<Point> neighbours = mst.adjacentNodes(vertex);\n            if (!neighbours.empty()) \/\/Need to move towards the neighbours.\n            {\n                Point sum_direction(0, 0);\n                for (Point neighbour : neighbours)\n                {\n                    sum_direction += neighbour - vertex;\n                }\n                Point motion = normal(sum_direction, maximum_move_distance);\n                if (neighbours.size() == 1 && vSize2(sum_direction) < maximum_move_distance * maximum_move_distance)\n                {\n                    if (mst.adjacentNodes(neighbours[0]).size() == 1) \/\/We just have two nodes left!\n                    {\n                        next_layer_vertex += motion \/ 2;\n                    }\n                    else \/\/This is a leaf that's about to collapse. Leave it out on the next layer.\n                    {\n                        contact_nodes[layer_nr - 1][neighbours[0]].distance_to_top = std::max(contact_nodes[layer_nr - 1][neighbours[0]].distance_to_top, node.distance_to_top);\n                        contact_nodes[layer_nr - 1][neighbours[0]].support_roof_layers_below = std::max(contact_nodes[layer_nr - 1][neighbours[0]].support_roof_layers_below, node.support_roof_layers_below);\n                        continue;\n                    }\n                }\n                else\n                {\n                    next_layer_vertex += motion;\n                }\n            }\n\n            \/\/Avoid collisions.\n            if (node.distance_to_top > tip_layers) \/\/Main branch.\n            {\n                const coord_t branch_radius_node = branch_radius * node.distance_to_top * diameter_angle_scale_factor;\n                PolygonUtils::moveOutside(model_collision_branch_radius[layer_nr - 1], next_layer_vertex, branch_radius_node, maximum_move_distance * maximum_move_distance);\n            }\n            else \/\/Tip.\n            {\n                const coord_t branch_radius_node = branch_radius * node.distance_to_top \/ tip_layers;\n                PolygonUtils::moveOutside(model_collision[layer_nr - 1], next_layer_vertex, branch_radius_node, maximum_move_distance * maximum_move_distance);\n            }\n            if (model_collision[layer_nr].inside(next_layer_vertex)) \/\/We're stuck inside the model down there! Sadly, this branch will have to rest on the model.\n            {\n                continue;\n            }\n            contact_points[layer_nr - 1].insert(next_layer_vertex);\n            contact_nodes[layer_nr - 1][next_layer_vertex].distance_to_top = node.distance_to_top + 1;\n            contact_nodes[layer_nr - 1][next_layer_vertex].skin_direction = node.skin_direction;\n            contact_nodes[layer_nr - 1][next_layer_vertex].support_roof_layers_below = node.support_roof_layers_below - 1;\n        }\n    }\n\n    const unsigned int wall_count = storage.getSettingAsCount(\"support_tree_wall_count\");\n    Polygon branch_circle; \/\/Pre-generate a circle with correct diameter so that we don't have to recompute those (co)sines every time.\n    for (unsigned int i = 0; i < CIRCLE_RESOLUTION; i++)\n    {\n        const double angle = (double)i \/ CIRCLE_RESOLUTION * 2 * M_PI; \/\/In radians.\n        branch_circle.emplace_back(cos(angle) * branch_radius, sin(angle) * branch_radius);\n    }\n    const coord_t circle_side_length = 2 * branch_radius * sin(M_PI \/ CIRCLE_RESOLUTION); \/\/Side length of a regular polygon.\n    for (size_t layer_nr = 0; layer_nr < contact_points.size(); layer_nr++)\n    {\n        Polygons support_layer;\n        Polygons& roof_layer = storage.support.supportLayers[layer_nr].support_roof;\n\n        for (const Point point : contact_points[layer_nr])\n        {\n            const Node& node = contact_nodes[layer_nr][point];\n            Polygon circle;\n            const double scale = (double)(node.distance_to_top + 1) \/ tip_layers;\n            for (Point corner : branch_circle)\n            {\n                if (node.distance_to_top < tip_layers) \/\/We're in the tip.\n                {\n                    if (node.skin_direction)\n                    {\n                        corner = Point(corner.X * (0.5 + scale \/ 2) + corner.Y * (0.5 - scale \/ 2), corner.X * (0.5 - scale \/ 2) + corner.Y * (0.5 + scale \/ 2));\n                    }\n                    else\n                    {\n                        corner = Point(corner.X * (0.5 + scale \/ 2) - corner.Y * (0.5 - scale \/ 2), corner.X * (-0.5 + scale \/ 2) + corner.Y * (0.5 + scale \/ 2));\n                    }\n                }\n                else\n                {\n                    corner *= 1 + (double)(node.distance_to_top - tip_layers) * diameter_angle_scale_factor;\n                }\n                circle.add(point + corner);\n            }\n            if (node.support_roof_layers_below >= 0)\n            {\n                roof_layer.add(circle);\n            }\n            else\n            {\n                support_layer.add(circle);\n            }\n        }\n        support_layer = support_layer.unionPolygons();\n        roof_layer = roof_layer.unionPolygons();\n        support_layer = support_layer.difference(roof_layer);\n        \/\/We smooth this support as much as possible without altering single circles. So we remove any line less than the side length of those circles.\n        const double diameter_angle_scale_factor_this_layer = (double)(storage.support.supportLayers.size() - layer_nr - tip_layers) * diameter_angle_scale_factor; \/\/Maximum scale factor.\n        support_layer.simplify(circle_side_length * (1 + diameter_angle_scale_factor_this_layer), line_width >> 2); \/\/Deviate at most a quarter of a line so that the lines still stack properly.\n        for (PolygonRef part : support_layer) \/\/Convert every part into a PolygonsPart for the support.\n        {\n            PolygonsPart outline;\n            outline.add(part);\n            storage.support.supportLayers[layer_nr].support_infill_parts.emplace_back(outline, line_width, wall_count);\n        }\n        PolygonsPart debug;\n        debug.add(model_collision_branch_radius[layer_nr]);\n        storage.support.supportLayers[layer_nr].support_infill_parts.emplace_back(debug, line_width, wall_count);\n        if (!storage.support.supportLayers[layer_nr].support_infill_parts.empty() || !storage.support.supportLayers[layer_nr].support_roof.empty())\n        {\n            storage.support.layer_nr_max_filled_layer = layer_nr;\n        }\n    }\n\n    storage.support.generated = true;\n}\n\nvoid TreeSupport::generateContactPoints(const SliceMeshStorage& mesh, std::vector<std::unordered_set<Point>>& contact_points, std::vector<std::unordered_map<Point, TreeSupport::Node>>& contact_nodes)\n{\n    const coord_t layer_height = mesh.getSettingInMicrons(\"layer_height\");\n    const coord_t z_distance_top = mesh.getSettingInMicrons(\"support_top_distance\");\n    const size_t z_distance_top_layers = std::max(0U, round_up_divide(z_distance_top, layer_height)) + 1; \/\/Support must always be 1 layer below overhang.\n    const size_t support_roof_layers = mesh.getSettingBoolean(\"support_roof_enable\") ? round_divide(mesh.getSettingInMicrons(\"support_roof_height\"), mesh.getSettingInMicrons(\"layer_height\")) : 0; \/\/How many roof layers, if roof is enabled.\n    for (size_t layer_nr = 0; layer_nr < mesh.overhang_areas.size() - z_distance_top_layers; layer_nr++)\n    {\n        const Polygons& overhang = mesh.overhang_areas[layer_nr + z_distance_top_layers];\n        if (overhang.empty())\n        {\n            continue;\n        }\n\n        \/\/First generate a lot of points in a grid pattern.\n        const Polygons outside_polygons = overhang.getOutsidePolygons();\n        const AABB bounding_box(outside_polygons); \/\/To know how far we should generate points.\n        const coord_t point_spread = mesh.getSettingInMicrons(\"support_tree_branch_distance\");\n\n        \/\/We want to create the grid pattern at an angle, so compute the bounding box required to cover that angle.\n        constexpr double rotate_angle = 22.0 \/ 180.0 * M_PI; \/\/Rotation of 22 degrees provides better support of diagonal lines.\n        const Point bounding_box_size = bounding_box.max - bounding_box.min;\n        AABB rotated_bounding_box;\n        rotated_bounding_box.include(Point(0, 0));\n        rotated_bounding_box.include(rotate(bounding_box_size, -rotate_angle));\n        rotated_bounding_box.include(rotate(Point(0, bounding_box_size.Y), -rotate_angle));\n        rotated_bounding_box.include(rotate(Point(bounding_box_size.X, 0), -rotate_angle));\n        AABB unrotated_bounding_box;\n        unrotated_bounding_box.include(rotate(rotated_bounding_box.min, rotate_angle));\n        unrotated_bounding_box.include(rotate(rotated_bounding_box.max, rotate_angle));\n        unrotated_bounding_box.include(rotate(Point(rotated_bounding_box.min.X, rotated_bounding_box.max.Y), rotate_angle));\n        unrotated_bounding_box.include(rotate(Point(rotated_bounding_box.max.X, rotated_bounding_box.min.Y), rotate_angle));\n\n        for (const ConstPolygonRef overhang_part : outside_polygons)\n        {\n            bool added = false; \/\/Did we add a point this way?\n            for (coord_t x = unrotated_bounding_box.min.X; x <= unrotated_bounding_box.max.X; x += point_spread)\n            {\n                for (coord_t y = unrotated_bounding_box.min.Y; y <= unrotated_bounding_box.max.Y; y += point_spread)\n                {\n                    Point candidate = rotate(Point(x, y), rotate_angle) + bounding_box.min;\n                    constexpr bool border_is_inside = true;\n                    if (overhang_part.inside(candidate, border_is_inside))\n                    {\n                        contact_points[layer_nr].insert(candidate);\n                        contact_nodes[layer_nr][candidate] = Node();\n                        contact_nodes[layer_nr][candidate].skin_direction = (layer_nr + z_distance_top_layers) % 2;\n                        contact_nodes[layer_nr][candidate].support_roof_layers_below = support_roof_layers;\n                        added = true;\n                    }\n                }\n            }\n            if (!added) \/\/If we didn't add any points due to bad luck, we want to add one anyway such that loose parts are also supported.\n            {\n                Point candidate = bounding_box.getMiddle();\n                PolygonUtils::moveInside(overhang_part, candidate);\n                contact_points[layer_nr].insert(candidate);\n                contact_nodes[layer_nr][candidate] = Node();\n                contact_nodes[layer_nr][candidate].skin_direction = layer_nr % 2;\n                contact_nodes[layer_nr][candidate].support_roof_layers_below = support_roof_layers;\n            }\n        }\n    }\n}\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 StraightLine.cpp\n *\/\n\n#include \"StraightLine.hpp\"\n#include <mathlib\/mathlib.h>\n#include <float.h>\n\n#define VEL_ZERO_THRESHOLD 0.001f \/\/ Threshold to compare if the target velocity is zero\n#define DECELERATION_MAX 8.0f     \/\/ The vehicles maximum deceleration TODO check to create param\n\nusing namespace matrix;\n\nStraightLine::StraightLine(ModuleParams *parent, const float &deltatime, const matrix::Vector3f &pos) :\n\tModuleParams(parent),\n\t_deltatime(deltatime), _pos(pos)\n{\n\n}\n\nvoid StraightLine::generateSetpoints(matrix::Vector3f &position_setpoint, matrix::Vector3f &velocity_setpoint)\n{\n\t\/\/ Check if target position has been reached\n\tif (_is_target_reached || (_desired_speed_at_target < VEL_ZERO_THRESHOLD &&\n\t\t\t\t   (_pos - _target).length() < NAV_ACC_RAD.get())) {\n\t\t\/\/ Vehicle has reached target. Lock position\n\t\tposition_setpoint = _target;\n\t\tvelocity_setpoint = Vector3f(0.0f, 0.0f, 0.0f);\n\t\t_is_target_reached = true;\n\n\t\treturn;\n\t}\n\n\t\/\/ unit vector in the direction of the straight line\n\tVector3f u_orig_to_target = (_target - _origin).unit_or_zero();\n\t\/\/ vector from origin to current position\n\tVector3f orig_to_pos = _pos - _origin;\n\t\/\/ current position projected perpendicularly onto desired line\n\tVector3f closest_pt_on_line = _origin + u_orig_to_target * (orig_to_pos * u_orig_to_target);\n\t\/\/ previous velocity in the direction of the line\n\tfloat speed_sp_prev = math::max(velocity_setpoint * u_orig_to_target, 0.0f);\n\n\t\/\/ Calculate accelerating\/decelerating distance depending on speed, speed at target and acceleration\/deceleration (add 10% safety margin)\n\tfloat acc_dec_distance = 1.1f * fabs(powf(_desired_speed, 2) - powf(_desired_speed_at_target, 2)) \/ 2.0f;\n\tacc_dec_distance \/= _desired_speed > _desired_speed_at_target ? _desired_deceleration : _desired_acceleration;\n\n\tfloat dist_to_target = (_target - _pos).length(); \/\/ distance to target\n\n\t\/\/ Either accelerate or decelerate\n\tfloat speed_sp    = dist_to_target > acc_dec_distance ? _desired_speed        :  _desired_speed_at_target;\n\tfloat max_acc_dec = speed_sp > speed_sp_prev          ? _desired_acceleration : -_desired_deceleration;\n\n\tfloat acc_track = (speed_sp - speed_sp_prev) \/ _deltatime;\n\n\tif (fabs(acc_track) > fabs(max_acc_dec)) {\n\t\t\/\/ accelerate\/decelerate with desired acceleration\/deceleration towards target\n\t\tspeed_sp = speed_sp_prev + max_acc_dec * _deltatime;\n\t}\n\n\t\/\/ constrain the velocity\n\tspeed_sp = math::constrain(speed_sp, 0.0f, _desired_speed);\n\n\t\/\/ set the position and velocity setpoints\n\tposition_setpoint = closest_pt_on_line;\n\tvelocity_setpoint = u_orig_to_target * speed_sp;\n\n}\n\nfloat StraightLine::getMaxAcc()\n{\n\t\/\/ unit vector in the direction of the straight line\n\tVector3f u_orig_to_target = (_target - _origin).unit_or_zero();\n\n\t\/\/ calculate the maximal horizontal acceleration\n\tfloat divider = (sqrt(powf(u_orig_to_target(0), 2) + powf(u_orig_to_target(1), 2)));\n\tfloat max_acc_hor = MPC_ACC_HOR_MAX.get();\n\n\tif (divider > FLT_EPSILON) {\n\t\tmax_acc_hor \/= divider;\n\n\t} else {\n\t\tmax_acc_hor *= 1000.0f;\n\t}\n\n\t\/\/ calculate the maximal vertical acceleration\n\tfloat max_acc_vert_original = u_orig_to_target(2) < 0 ? MPC_ACC_UP_MAX.get() : MPC_ACC_DOWN_MAX.get();\n\tfloat max_acc_vert = max_acc_vert_original;\n\n\tif (fabs(u_orig_to_target(2)) > FLT_EPSILON) {\n\t\tmax_acc_vert \/= fabs(u_orig_to_target(2));\n\n\t} else {\n\t\tmax_acc_vert *= 1000.0f;\n\t}\n\n\treturn math::min(max_acc_hor, max_acc_vert);\n}\n\nfloat StraightLine::getMaxVel()\n{\n\t\/\/ unit vector in the direction of the straight line\n\tVector3f u_orig_to_target = (_target - _origin).unit_or_zero();\n\n\t\/\/ calculate the maximal horizontal velocity\n\tfloat divider = (sqrt(powf(u_orig_to_target(0), 2) + powf(u_orig_to_target(1), 2)));\n\tfloat max_vel_hor = MPC_XY_VEL_MAX.get();\n\n\tif (divider > FLT_EPSILON) {\n\t\tmax_vel_hor \/= divider;\n\n\t} else {\n\t\tmax_vel_hor *= 1000.0f;\n\t}\n\n\t\/\/ calculate the maximal vertical velocity\n\tfloat max_vel_vert_directional = u_orig_to_target(2) < 0 ? MPC_Z_VEL_MAX_UP.get() : MPC_Z_VEL_MAX_DN.get();\n\tfloat max_vel_vert = max_vel_vert_directional;\n\n\tif (fabs(u_orig_to_target(2)) > FLT_EPSILON) {\n\t\tmax_vel_vert \/= fabs(u_orig_to_target(2));\n\n\t} else {\n\t\tmax_vel_vert *= 1000.0f;\n\t}\n\n\treturn math::min(max_vel_hor, max_vel_vert);\n}\n\nvoid StraightLine::setAllDefaults()\n{\n\t_desired_speed = getMaxVel();\n\t_desired_speed_at_target = 0.0f;\n\t_desired_acceleration = getMaxAcc();\n\t_desired_deceleration = DECELERATION_MAX;\n}\n\nvoid StraightLine::setTarget(const matrix::Vector3f &target)\n{\n\tif (PX4_ISFINITE(target(0)) && PX4_ISFINITE(target(1)) && PX4_ISFINITE(target(2))) {\n\t\t_target = target;\n\t\t_is_target_reached = false;\n\n\t\t\/\/ set all parameters to their default value (depends on the direction)\n\t\tsetAllDefaults();\n\t}\n}\n\nvoid StraightLine::setOrigin(const matrix::Vector3f &origin)\n{\n\tif (PX4_ISFINITE(origin(0)) && PX4_ISFINITE(origin(1)) && PX4_ISFINITE(origin(2))) {\n\t\t_origin = origin;\n\t}\n}\n\nvoid StraightLine::setSpeed(const float &speed)\n{\n\tif (speed > 0 && speed < getMaxVel()) {\n\t\t_desired_speed = speed;\n\t}\n}\n\nvoid StraightLine::setSpeedAtTarget(const float &speed_at_target)\n{\n\tif (speed_at_target > 0 && speed_at_target < getMaxVel()) {\n\t\t_desired_speed_at_target = speed_at_target;\n\t}\n}\n\nvoid StraightLine::setAcceleration(const float &acc)\n{\n\tif (acc > 0 && acc < getMaxAcc()) {\n\t\t_desired_acceleration = acc;\n\t}\n}\n\nvoid StraightLine::setDeceleration(const float &dec)\n{\n\tif (dec > 0 && dec < DECELERATION_MAX) {\n\t\t_desired_deceleration = dec;\n\t}\n}<commit_msg>FlightTask StraightLine: remove 10% safety margin<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 StraightLine.cpp\n *\/\n\n#include \"StraightLine.hpp\"\n#include <mathlib\/mathlib.h>\n#include <float.h>\n\n#define VEL_ZERO_THRESHOLD 0.001f \/\/ Threshold to compare if the target velocity is zero\n#define DECELERATION_MAX 8.0f     \/\/ The vehicles maximum deceleration TODO check to create param\n\nusing namespace matrix;\n\nStraightLine::StraightLine(ModuleParams *parent, const float &deltatime, const matrix::Vector3f &pos) :\n\tModuleParams(parent),\n\t_deltatime(deltatime), _pos(pos)\n{\n\n}\n\nvoid StraightLine::generateSetpoints(matrix::Vector3f &position_setpoint, matrix::Vector3f &velocity_setpoint)\n{\n\t\/\/ Check if target position has been reached\n\tif (_is_target_reached || (_desired_speed_at_target < VEL_ZERO_THRESHOLD &&\n\t\t\t\t   (_pos - _target).length() < NAV_ACC_RAD.get())) {\n\t\t\/\/ Vehicle has reached target. Lock position\n\t\tposition_setpoint = _target;\n\t\tvelocity_setpoint = Vector3f(0.0f, 0.0f, 0.0f);\n\t\t_is_target_reached = true;\n\n\t\treturn;\n\t}\n\n\t\/\/ unit vector in the direction of the straight line\n\tVector3f u_orig_to_target = (_target - _origin).unit_or_zero();\n\t\/\/ vector from origin to current position\n\tVector3f orig_to_pos = _pos - _origin;\n\t\/\/ current position projected perpendicularly onto desired line\n\tVector3f closest_pt_on_line = _origin + u_orig_to_target * (orig_to_pos * u_orig_to_target);\n\t\/\/ previous velocity in the direction of the line\n\tfloat speed_sp_prev = math::max(velocity_setpoint * u_orig_to_target, 0.0f);\n\n\t\/\/ Calculate accelerating\/decelerating distance depending on speed, speed at target and acceleration\/deceleration\n\tfloat acc_dec_distance = fabs(powf(_desired_speed, 2) - powf(_desired_speed_at_target, 2)) \/ 2.0f;\n\tacc_dec_distance \/= _desired_speed > _desired_speed_at_target ? _desired_deceleration : _desired_acceleration;\n\n\tfloat dist_to_target = (_target - _pos).length(); \/\/ distance to target\n\n\t\/\/ Either accelerate or decelerate\n\tfloat speed_sp    = dist_to_target > acc_dec_distance ? _desired_speed        :  _desired_speed_at_target;\n\tfloat max_acc_dec = speed_sp > speed_sp_prev          ? _desired_acceleration : -_desired_deceleration;\n\n\tfloat acc_track = (speed_sp - speed_sp_prev) \/ _deltatime;\n\n\tif (fabs(acc_track) > fabs(max_acc_dec)) {\n\t\t\/\/ accelerate\/decelerate with desired acceleration\/deceleration towards target\n\t\tspeed_sp = speed_sp_prev + max_acc_dec * _deltatime;\n\t}\n\n\t\/\/ constrain the velocity\n\tspeed_sp = math::constrain(speed_sp, 0.0f, _desired_speed);\n\n\t\/\/ set the position and velocity setpoints\n\tposition_setpoint = closest_pt_on_line;\n\tvelocity_setpoint = u_orig_to_target * speed_sp;\n\n}\n\nfloat StraightLine::getMaxAcc()\n{\n\t\/\/ unit vector in the direction of the straight line\n\tVector3f u_orig_to_target = (_target - _origin).unit_or_zero();\n\n\t\/\/ calculate the maximal horizontal acceleration\n\tfloat divider = (sqrt(powf(u_orig_to_target(0), 2) + powf(u_orig_to_target(1), 2)));\n\tfloat max_acc_hor = MPC_ACC_HOR_MAX.get();\n\n\tif (divider > FLT_EPSILON) {\n\t\tmax_acc_hor \/= divider;\n\n\t} else {\n\t\tmax_acc_hor *= 1000.0f;\n\t}\n\n\t\/\/ calculate the maximal vertical acceleration\n\tfloat max_acc_vert_original = u_orig_to_target(2) < 0 ? MPC_ACC_UP_MAX.get() : MPC_ACC_DOWN_MAX.get();\n\tfloat max_acc_vert = max_acc_vert_original;\n\n\tif (fabs(u_orig_to_target(2)) > FLT_EPSILON) {\n\t\tmax_acc_vert \/= fabs(u_orig_to_target(2));\n\n\t} else {\n\t\tmax_acc_vert *= 1000.0f;\n\t}\n\n\treturn math::min(max_acc_hor, max_acc_vert);\n}\n\nfloat StraightLine::getMaxVel()\n{\n\t\/\/ unit vector in the direction of the straight line\n\tVector3f u_orig_to_target = (_target - _origin).unit_or_zero();\n\n\t\/\/ calculate the maximal horizontal velocity\n\tfloat divider = (sqrt(powf(u_orig_to_target(0), 2) + powf(u_orig_to_target(1), 2)));\n\tfloat max_vel_hor = MPC_XY_VEL_MAX.get();\n\n\tif (divider > FLT_EPSILON) {\n\t\tmax_vel_hor \/= divider;\n\n\t} else {\n\t\tmax_vel_hor *= 1000.0f;\n\t}\n\n\t\/\/ calculate the maximal vertical velocity\n\tfloat max_vel_vert_directional = u_orig_to_target(2) < 0 ? MPC_Z_VEL_MAX_UP.get() : MPC_Z_VEL_MAX_DN.get();\n\tfloat max_vel_vert = max_vel_vert_directional;\n\n\tif (fabs(u_orig_to_target(2)) > FLT_EPSILON) {\n\t\tmax_vel_vert \/= fabs(u_orig_to_target(2));\n\n\t} else {\n\t\tmax_vel_vert *= 1000.0f;\n\t}\n\n\treturn math::min(max_vel_hor, max_vel_vert);\n}\n\nvoid StraightLine::setAllDefaults()\n{\n\t_desired_speed = getMaxVel();\n\t_desired_speed_at_target = 0.0f;\n\t_desired_acceleration = getMaxAcc();\n\t_desired_deceleration = DECELERATION_MAX;\n}\n\nvoid StraightLine::setTarget(const matrix::Vector3f &target)\n{\n\tif (PX4_ISFINITE(target(0)) && PX4_ISFINITE(target(1)) && PX4_ISFINITE(target(2))) {\n\t\t_target = target;\n\t\t_is_target_reached = false;\n\n\t\t\/\/ set all parameters to their default value (depends on the direction)\n\t\tsetAllDefaults();\n\t}\n}\n\nvoid StraightLine::setOrigin(const matrix::Vector3f &origin)\n{\n\tif (PX4_ISFINITE(origin(0)) && PX4_ISFINITE(origin(1)) && PX4_ISFINITE(origin(2))) {\n\t\t_origin = origin;\n\t}\n}\n\nvoid StraightLine::setSpeed(const float &speed)\n{\n\tif (speed > 0 && speed < getMaxVel()) {\n\t\t_desired_speed = speed;\n\t}\n}\n\nvoid StraightLine::setSpeedAtTarget(const float &speed_at_target)\n{\n\tif (speed_at_target > 0 && speed_at_target < getMaxVel()) {\n\t\t_desired_speed_at_target = speed_at_target;\n\t}\n}\n\nvoid StraightLine::setAcceleration(const float &acc)\n{\n\tif (acc > 0 && acc < getMaxAcc()) {\n\t\t_desired_acceleration = acc;\n\t}\n}\n\nvoid StraightLine::setDeceleration(const float &dec)\n{\n\tif (dec > 0 && dec < DECELERATION_MAX) {\n\t\t_desired_deceleration = dec;\n\t}\n}<|endoftext|>"}
{"text":"<commit_before>\n\/\/ ---------------------------------------------------\n\/\/ The FDiffDelete Project\n\/\/ Github: https:\/\/github.com\/shishir993\/fdiffdelete\n\/\/ Author: Shishir Bhat\n\/\/ The MIT License (MIT)\n\/\/ Copyright (c) 2014\n\/\/\n\n#include \"HashFactory.h\"\n#include <WinCrypt.h>\n\nHRESULT HashFactoryInit(_Out_ HCRYPTPROV *phCrypt)\n{\n    HRESULT hr = S_OK;\n\n    *phCrypt = NULL;\n\n    HCRYPTPROV hCrypt = NULL;\n    if (CryptAcquireContext(\n        &hCrypt,\/\/ handle out\n        NULL,   \/\/ container\n        NULL,   \/\/ provider\n        PROV_DSS,           \/\/ provider type\n        CRYPT_VERIFYCONTEXT))   \/\/ flags\n    {\n        *phCrypt = hCrypt;\n    }\n    else\n    {\n        hr = HRESULT_FROM_WIN32(GetLastError());\n        logerr(L\"CryptAcquireContext() failed.\");\n    }\n    return hr;\n}\n\nvoid HashFactoryDestroy(_In_ HCRYPTPROV hCrypt)\n{\n    SB_ASSERT(hCrypt != NULL);\n    CryptReleaseContext(hCrypt, 0);\n}\n\nHRESULT CalculateSHA1(_In_ HCRYPTPROV hCrypt, _In_ HANDLE hFile, _Out_bytecap_c_(HASHLEN_SHA1) PBYTE pbHash)\n{\n    SB_ASSERT(hCrypt != NULL);\n\n    HRESULT hr = S_OK;\n    HCRYPTHASH hHash = NULL;\n    HANDLE hMapObj = NULL;\n    HANDLE hMapView = NULL;\n    DWORD dwHashSize = HASHLEN_SHA1;\n    LARGE_INTEGER fileSize = {};\n\n    if (!CryptCreateHash(hCrypt, CALG_SHA1, NULL, 0, &hHash))\n    {\n        hr = HRESULT_FROM_WIN32(GetLastError());\n        logerr(L\"CryptCreateHash() failed\");\n        goto fend;\n    }\n\n    hr = CHL_GnCreateMemMapOfFile(hFile, PAGE_READONLY, &hMapObj, &hMapView);\n    if (FAILED(hr))\n    {\n        logerr(L\"Failed to mem-map file, hr: %x\", hr);\n        goto fend;\n    }\n\n    if (!GetFileSizeEx(hFile, &fileSize))\n    {\n        hr = HRESULT_FROM_WIN32(GetLastError());\n        logerr(L\"GetFileSizeEx failed, hr: %x\", hr);\n        goto fend;\n    }\n    if (MAXDWORD < fileSize.QuadPart)\n    {\n        hr = HRESULT_FROM_WIN32(ERROR_NOT_SUPPORTED);\n        logerr(L\"File too big\");\n        goto fend;\n    }\n\n    if (!CryptHashData(hHash, (PBYTE)hMapView, fileSize.LowPart, 0))\n    {\n        hr = HRESULT_FROM_WIN32(GetLastError());\n        logerr(L\"CryptHashData failed, hr: %x\", hr);\n        goto fend;\n    }\n\n    if (CryptGetHashParam(hHash, HP_HASHVAL, pbHash, &dwHashSize, 0))\n    {\n        hr = HRESULT_FROM_WIN32(GetLastError());\n        logerr(L\"CryptGetHashParam failed, hr: %x\");\n        goto fend;\n    }\n\n#ifdef _DEBUG\n    CHAR szHash[STRLEN_SHA1];\n    HashValueToString(pbHash, szHash);\n    wprintf(L\"Hash string = [%S]\\n\", szHash);\n#endif\n\nfend:\n    if (hHash != NULL)\n    {\n        CryptDestroyHash(hHash);\n        hHash = NULL;\n    }\n\n    if (hMapView != NULL)\n    {\n        UnmapViewOfFile(hMapView);\n        hMapView = NULL;\n    }\n\n    if (hMapObj != NULL)\n    {\n        CloseHandle(hMapObj);\n        hMapObj = NULL;\n    }\n\n    return hr;\n}\n\nvoid HashValueToString(_In_bytecount_c_(HASHLEN_SHA1) PBYTE pbHash, _Inout_z_ PSTR pszHashValue)\n{\n    for (int i = 0; i < HASHLEN_SHA1; ++i)\n    {\n        sprintf_s(pszHashValue + (i << 1), STRLEN_SHA1 - (i << 1), \"%02x\", pbHash[i]);\n    }\n    pszHashValue[STRLEN_SHA1 - 1] = 0;\n}\n<commit_msg>Incorrectly logs that CryptGetHashParam has failed<commit_after>\n\/\/ ---------------------------------------------------\n\/\/ The FDiffDelete Project\n\/\/ Github: https:\/\/github.com\/shishir993\/fdiffdelete\n\/\/ Author: Shishir Bhat\n\/\/ The MIT License (MIT)\n\/\/ Copyright (c) 2014\n\/\/\n\n#include \"HashFactory.h\"\n#include <WinCrypt.h>\n\nHRESULT HashFactoryInit(_Out_ HCRYPTPROV *phCrypt)\n{\n    HRESULT hr = S_OK;\n\n    *phCrypt = NULL;\n\n    HCRYPTPROV hCrypt = NULL;\n    if (CryptAcquireContext(\n        &hCrypt,\/\/ handle out\n        NULL,   \/\/ container\n        NULL,   \/\/ provider\n        PROV_DSS,           \/\/ provider type\n        CRYPT_VERIFYCONTEXT))   \/\/ flags\n    {\n        *phCrypt = hCrypt;\n    }\n    else\n    {\n        hr = HRESULT_FROM_WIN32(GetLastError());\n        logerr(L\"CryptAcquireContext() failed.\");\n    }\n    return hr;\n}\n\nvoid HashFactoryDestroy(_In_ HCRYPTPROV hCrypt)\n{\n    SB_ASSERT(hCrypt != NULL);\n    CryptReleaseContext(hCrypt, 0);\n}\n\nHRESULT CalculateSHA1(_In_ HCRYPTPROV hCrypt, _In_ HANDLE hFile, _Out_bytecap_c_(HASHLEN_SHA1) PBYTE pbHash)\n{\n    SB_ASSERT(hCrypt != NULL);\n\n    HRESULT hr = S_OK;\n    HCRYPTHASH hHash = NULL;\n    HANDLE hMapObj = NULL;\n    HANDLE hMapView = NULL;\n    DWORD dwHashSize = HASHLEN_SHA1;\n    LARGE_INTEGER fileSize = {};\n\n    if (!CryptCreateHash(hCrypt, CALG_SHA1, NULL, 0, &hHash))\n    {\n        hr = HRESULT_FROM_WIN32(GetLastError());\n        logerr(L\"CryptCreateHash() failed\");\n        goto fend;\n    }\n\n    hr = CHL_GnCreateMemMapOfFile(hFile, PAGE_READONLY, &hMapObj, &hMapView);\n    if (FAILED(hr))\n    {\n        logerr(L\"Failed to mem-map file, hr: %x\", hr);\n        goto fend;\n    }\n\n    if (!GetFileSizeEx(hFile, &fileSize))\n    {\n        hr = HRESULT_FROM_WIN32(GetLastError());\n        logerr(L\"GetFileSizeEx failed, hr: %x\", hr);\n        goto fend;\n    }\n    if (MAXDWORD < fileSize.QuadPart)\n    {\n        hr = HRESULT_FROM_WIN32(ERROR_NOT_SUPPORTED);\n        logerr(L\"File too big\");\n        goto fend;\n    }\n\n    if (!CryptHashData(hHash, (PBYTE)hMapView, fileSize.LowPart, 0))\n    {\n        hr = HRESULT_FROM_WIN32(GetLastError());\n        logerr(L\"CryptHashData failed, hr: %x\", hr);\n        goto fend;\n    }\n\n    if (!CryptGetHashParam(hHash, HP_HASHVAL, pbHash, &dwHashSize, 0))\n    {\n        hr = HRESULT_FROM_WIN32(GetLastError());\n        logerr(L\"CryptGetHashParam failed, hr: %x\", hr);\n        goto fend;\n    }\n\n#ifdef _DEBUG\n    CHAR szHash[STRLEN_SHA1];\n    HashValueToString(pbHash, szHash);\n    logdbg(L\"Hash string = [%S]\", szHash);\n#endif\n\nfend:\n    if (hHash != NULL)\n    {\n        CryptDestroyHash(hHash);\n        hHash = NULL;\n    }\n\n    if (hMapView != NULL)\n    {\n        UnmapViewOfFile(hMapView);\n        hMapView = NULL;\n    }\n\n    if (hMapObj != NULL)\n    {\n        CloseHandle(hMapObj);\n        hMapObj = NULL;\n    }\n\n    return hr;\n}\n\nvoid HashValueToString(_In_bytecount_c_(HASHLEN_SHA1) PBYTE pbHash, _Inout_z_ PSTR pszHashValue)\n{\n    for (int i = 0; i < HASHLEN_SHA1; ++i)\n    {\n        sprintf_s(pszHashValue + (i << 1), STRLEN_SHA1 - (i << 1), \"%02x\", pbHash[i]);\n    }\n    pszHashValue[STRLEN_SHA1 - 1] = 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"GUIHandler.h\"\n\n\nGUIHandler::GUIHandler(Adafruit_ST7735 *tftDisplay)\n{\n\ttft = tftDisplay; \n}\n\n\nGUIHandler::~GUIHandler()\n{\n}\n\nvoid GUIHandler::Start()\n{\n\n}\n\nvoid GUIHandler::Update()\n{\n\n}\n\nvoid GUIHandler::DrawInGameGUI()\n{\n\ttft->fillRoundRect(0, -5, DISPLAY_WIDTH, 20, 7, WW_COLOR_WHITE);\n\ttft->fillRoundRect(0, DISPLAY_HEIGHT - 15, DISPLAY_WIDTH, 20, 7, WW_COLOR_WHITE);\n}\n<commit_msg>added text to game gui<commit_after>#include \"GUIHandler.h\"\n\n\nGUIHandler::GUIHandler(Adafruit_ST7735 *tftDisplay)\n{\n\ttft = tftDisplay; \n}\n\n\nGUIHandler::~GUIHandler()\n{\n}\n\nvoid GUIHandler::Start()\n{\n\n}\n\nvoid GUIHandler::Update()\n{\n\n}\n\nvoid GUIHandler::DrawInGameGUI()\n{\n\ttft->fillRoundRect(0, -3, DISPLAY_WIDTH, 20, 7, WW_COLOR_WHITE);\n\ttft->fillRoundRect(0, DISPLAY_HEIGHT - 15, DISPLAY_WIDTH, 20, 7, WW_COLOR_WHITE);\n\ttft->setCursor(10, 5);\n\ttft->setTextColor(WW_COLOR_DARKBLUE); \n\ttft->print(\"Score:\");\n\ttft->setCursor(10, DISPLAY_HEIGHT - 11);\n\ttft->print(\"High Score:\");\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Capture\/Replay: Disable swap limit in sample.<commit_after><|endoftext|>"}
{"text":"<commit_before>#pragma once\r\n\/\/=====================================================================\/\/\r\n\/*!\t@file\r\n\t@brief\tMAX6675 クラス @n\r\n\t\t\tCold-Junction-Compensated @n\r\n\t\t\tK-Thermocouple to Digital Converter 0 C to 1024 C\r\n\t\t\tCopyright 2017 Kunihito Hiramatsu\r\n\t@author\t平松邦仁 (hira@rvf-rc45.net)\r\n*\/\r\n\/\/=====================================================================\/\/\r\n#include <cmath>\r\n\r\nnamespace chip {\r\n\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\/*!\r\n\t\t@brief  MAX6675 テンプレートクラス\r\n\t\t@param[in]\tSPI\tspi クラス\r\n\t\t@param[in]\tCS\tチップ・セレクト\r\n\t*\/\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\ttemplate <class SPI, class CS>\r\n\tclass MAX6675 {\r\n\r\n\t\tSPI&\tspi_;\r\n\r\n\tpublic:\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\tコンストラクタ\r\n\t\t *\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tMAX6675(SPI& spi) : spi_(spi) { }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t開始\r\n\t\t *\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tvoid start()\r\n\t\t{\r\n\t\t\tCS::DIR = 1;\r\n\t\t\tCS::P = 1;\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@return 変換温度 (0 to 4095) 0.25 C\r\n\t\t *\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tuint16_t operator () ()\r\n\t\t{\r\n\t\t\tCS::P = 0;\r\n\t\t\tuint8_t tmp[2];\r\n\t\t\tspi_.read(tmp, 2);\r\n\t\t\tuint16_t v = (static_cast<uint16_t>(tmp[0]) << 6) | (static_cast<uint16_t>(tmp[1]) >> 2);\r\n\t\t\tCS::P = 1;\r\n\t\t\treturn v;\r\n\t\t}\r\n\t};\r\n}\r\n<commit_msg>fix bit position<commit_after>#pragma once\r\n\/\/=====================================================================\/\/\r\n\/*!\t@file\r\n\t@brief\tMAX6675 クラス @n\r\n\t\t\tCold-Junction-Compensated @n\r\n\t\t\tK-Thermocouple to Digital Converter 0℃ to 1024℃ @n\r\n\t\t\tVcc: 3.3V、5.0V\r\n    @author 平松邦仁 (hira@rvf-rc45.net)\r\n\t@copyright\tCopyright (C) 2017 Kunihito Hiramatsu @n\r\n\t\t\t\tReleased under the MIT license @n\r\n\t\t\t\thttps:\/\/github.com\/hirakuni45\/RX\/blob\/master\/LICENSE\r\n*\/\r\n\/\/=====================================================================\/\/\r\n#include <cmath>\r\n\r\nnamespace chip {\r\n\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\/*!\r\n\t\t@brief  MAX6675 テンプレートクラス\r\n\t\t@param[in]\tSPI\tspi クラス\r\n\t\t@param[in]\tCS\tチップ・セレクト\r\n\t*\/\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\ttemplate <class SPI, class CS>\r\n\tclass MAX6675 {\r\n\r\n\t\tSPI&\tspi_;\r\n\r\n\tpublic:\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\tコンストラクタ\r\n\t\t *\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tMAX6675(SPI& spi) noexcept : spi_(spi) { }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t開始\r\n\t\t *\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tvoid start() noexcept\r\n\t\t{\r\n\t\t\tCS::DIR = 1;\r\n\t\t\tCS::P = 1;\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@return 値、変換温度 (0 to 4095) 0.25℃ (0℃ to 1024℃)\r\n\t\t *\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tuint16_t get() noexcept\r\n\t\t{\r\n\t\t\tCS::P = 0;\r\n\t\t\t\/\/ delay 100ns\r\n\t\t\tutils::delay::nano_second(100);\r\n\t\t\tuint8_t tmp[2];\r\n\t\t\tspi_.recv(tmp, 2);\r\n\t\t\tuint16_t v = (static_cast<uint16_t>(tmp[0]) << 5) | (static_cast<uint16_t>(tmp[1]) >> 3);\r\n\t\t\tCS::P = 1;\r\n\t\t\treturn v;\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@return 温度\r\n\t\t *\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tfloat get_temp() noexcept\r\n\t\t{\r\n\t\t\treturn static_cast<float>(get()) * 0.25f;\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@return 変換温度 (0 to 4095) 0.25℃ (0℃ to 1024℃)\r\n\t\t *\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tuint16_t operator () ()\r\n\t\t{\r\n\t\t\treturn get();\r\n\t\t}\r\n\t};\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>#include \"tpcc_base_fixture.hpp\"\n\n#include <iostream>\n#include <vector>\n\n#include \"storage\/storage_manager.hpp\"\n\nnamespace opossum {\n\nTPCCBenchmarkFixture::TPCCBenchmarkFixture()\n    : _gen(tpcc::TpccTableGenerator()), _random_gen(tpcc::TpccRandomGenerator()) {\n  \/\/ TODO(mp): This constructor is currently run once before each TPCC benchmark.\n  \/\/ Thus we create all tables up to 8 times, which takes quite a long time.\n  std::cout << \"Generating tables (this might take a couple of minutes)...\" << std::endl;\n  \/\/ Generating TPCC tables\n  _tpcc_tables = _gen.generate_all_tables();\n  \/\/ We currently run the benchmarks without a scheduler because there are problems when it is activated.\n  \/\/ The Sort in TPCCDeliveryBenchmark-BM_delivery crashes because of a access @0 in a vector of length 0\n  \/\/ TODO(mp): investigate and fix.\n  \/\/ CurrentScheduler::set(std::make_shared<NodeQueueScheduler>(Topology::create_fake_numa_topology(4, 2)));\n}\n\nvoid TPCCBenchmarkFixture::TearDown(::benchmark::State&) {\n  StorageManager::get().reset();\n  \/\/ CurrentScheduler::set(nullptr);\n}\n\nvoid TPCCBenchmarkFixture::SetUp(::benchmark::State&) {\n  for (auto it = _tpcc_tables.begin(); it != _tpcc_tables.end(); ++it) {\n    StorageManager::get().add_table(it->first, it->second);\n  }\n}\n\nvoid TPCCBenchmarkFixture::clear_cache() {\n  std::vector<int> clear = std::vector<int>();\n  clear.resize(500 * 1000 * 1000, 42);\n  for (uint i = 0; i < clear.size(); i++) {\n    clear[i] += 1;\n  }\n  clear.resize(0);\n}\n\n}  \/\/ namespace opossum\n<commit_msg>Enable Scheduler in TPCC benchmarks (#284)<commit_after>#include \"tpcc_base_fixture.hpp\"\n\n#include <iostream>\n#include <memory>\n#include <vector>\n\n#include \"scheduler\/current_scheduler.hpp\"\n#include \"scheduler\/node_queue_scheduler.hpp\"\n#include \"scheduler\/topology.hpp\"\n#include \"storage\/storage_manager.hpp\"\n\nnamespace opossum {\n\nTPCCBenchmarkFixture::TPCCBenchmarkFixture()\n    : _gen(tpcc::TpccTableGenerator()), _random_gen(tpcc::TpccRandomGenerator()) {\n  \/\/ TODO(mp): This constructor is currently run once before each TPCC benchmark.\n  \/\/ Thus we create all tables up to 8 times, which takes quite a long time.\n  std::cout << \"Generating tables (this might take a couple of minutes)...\" << std::endl;\n  \/\/ Generating TPCC tables\n  _tpcc_tables = _gen.generate_all_tables();\n  CurrentScheduler::set(std::make_shared<NodeQueueScheduler>(Topology::create_fake_numa_topology(4, 2)));\n}\n\nvoid TPCCBenchmarkFixture::TearDown(::benchmark::State&) {\n  StorageManager::get().reset();\n  CurrentScheduler::set(nullptr);\n}\n\nvoid TPCCBenchmarkFixture::SetUp(::benchmark::State&) {\n  for (auto it = _tpcc_tables.begin(); it != _tpcc_tables.end(); ++it) {\n    StorageManager::get().add_table(it->first, it->second);\n  }\n}\n\nvoid TPCCBenchmarkFixture::clear_cache() {\n  std::vector<int> clear = std::vector<int>();\n  clear.resize(500 * 1000 * 1000, 42);\n  for (uint i = 0; i < clear.size(); i++) {\n    clear[i] += 1;\n  }\n  clear.resize(0);\n}\n\n}  \/\/ namespace opossum\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *                                                                       *\n * Open Dynamics Engine, Copyright (C) 2001,2002 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\nquaternions have the format: (s,vx,vy,vz) where (vx,vy,vz) is the\n\"rotation axis\" and s is the \"rotation angle\".\n\n*\/\n\n#include <ode\/rotation.h>\n#include <ode\/odemath.h>\n\n\n#define _R(i,j) R[(i)*4+(j)]\n\n#define SET_3x3_IDENTITY \\\n  _R(0,0) = REAL(1.0); \\\n  _R(0,1) = REAL(0.0); \\\n  _R(0,2) = REAL(0.0); \\\n  _R(0,3) = REAL(0.0); \\\n  _R(1,0) = REAL(0.0); \\\n  _R(1,1) = REAL(1.0); \\\n  _R(1,2) = REAL(0.0); \\\n  _R(1,3) = REAL(0.0); \\\n  _R(2,0) = REAL(0.0); \\\n  _R(2,1) = REAL(0.0); \\\n  _R(2,2) = REAL(1.0); \\\n  _R(2,3) = REAL(0.0);\n\n\nvoid dRSetIdentity (dMatrix3 R)\n{\n  dAASSERT (R);\n  SET_3x3_IDENTITY;\n}\n\n\nvoid dRFromAxisAndAngle (dMatrix3 R, dReal ax, dReal ay, dReal az,\n\t\t\t dReal angle)\n{\n  dAASSERT (R);\n  dQuaternion q;\n  dQFromAxisAndAngle (q,ax,ay,az,angle);\n  dQtoR (q,R);\n}\n\n\nvoid dRFromEulerAngles (dMatrix3 R, dReal phi, dReal theta, dReal psi)\n{\n  dReal sphi,cphi,stheta,ctheta,spsi,cpsi;\n  dAASSERT (R);\n  sphi = dSin(phi);\n  cphi = dCos(phi);\n  stheta = dSin(theta);\n  ctheta = dCos(theta);\n  spsi = dSin(psi);\n  cpsi = dCos(psi);\n  _R(0,0) = cpsi*ctheta;\n  _R(0,1) = spsi*ctheta;\n  _R(0,2) =-stheta;\n  _R(1,0) = cpsi*stheta*sphi - spsi*cphi;\n  _R(1,1) = spsi*stheta*sphi + cpsi*cphi;\n  _R(1,2) = ctheta*sphi;\n  _R(2,0) = cpsi*stheta*cphi + spsi*sphi;\n  _R(2,1) = spsi*stheta*cphi - cpsi*sphi;\n  _R(2,2) = ctheta*cphi;\n}\n\n\nvoid dRFrom2Axes (dMatrix3 R, dReal ax, dReal ay, dReal az,\n\t\t  dReal bx, dReal by, dReal bz)\n{\n  dReal l,k;\n  dAASSERT (R);\n  l = dSqrt (ax*ax + ay*ay + az*az);\n  if (l <= REAL(0.0)) {\n    dDEBUGMSG (\"zero length vector\");\n    return;\n  }\n  l = dRecip(l);\n  ax *= l;\n  ay *= l;\n  az *= l;\n  k = ax*bx + ay*by + az*bz;\n  bx -= k*ax;\n  by -= k*ay;\n  bz -= k*az;\n  l = dSqrt (bx*bx + by*by + bz*bz);\n  if (l <= REAL(0.0)) {\n    dDEBUGMSG (\"zero length vector\");\n    return;\n  }\n  l = dRecip(l);\n  bx *= l;\n  by *= l;\n  bz *= l;\n  _R(0,0) = ax;\n  _R(1,0) = ay;\n  _R(2,0) = az;\n  _R(0,1) = bx;\n  _R(1,1) = by;\n  _R(2,1) = bz;\n  _R(0,2) = - by*az + ay*bz;\n  _R(1,2) = - bz*ax + az*bx;\n  _R(2,2) = - bx*ay + ax*by;\n}\n\n\nvoid dRFromZAxis (dMatrix3 R, dReal ax, dReal ay, dReal az)\n{\n  dVector3 n,p,q;\n  n[0] = ax;\n  n[1] = ay;\n  n[2] = az;\n  dNormalize3 (n);\n  dPlaneSpace (n,p,q);\n  _R(0,0) = p[0];\n  _R(1,0) = p[1];\n  _R(2,0) = p[2];\n  _R(0,1) = q[0];\n  _R(1,1) = q[1];\n  _R(2,1) = q[2];\n  _R(0,2) = n[0];\n  _R(1,2) = n[1];\n  _R(2,2) = n[2];\n}\n\n\nvoid dQSetIdentity (dQuaternion q)\n{\n  dAASSERT (q);\n  q[0] = 1;\n  q[1] = 0;\n  q[2] = 0;\n  q[3] = 0;\n}\n\n\nvoid dQFromAxisAndAngle (dQuaternion q, dReal ax, dReal ay, dReal az,\n\t\t\t dReal angle)\n{\n  dAASSERT (q);\n  dReal l = ax*ax + ay*ay + az*az;\n  if (l > REAL(0.0)) {\n    angle *= REAL(0.5);\n    q[0] = dCos (angle);\n    l = dSin(angle) * dRecipSqrt(l);\n    q[1] = ax*l;\n    q[2] = ay*l;\n    q[3] = az*l;\n  }\n  else {\n    q[0] = 1;\n    q[1] = 0;\n    q[2] = 0;\n    q[3] = 0;\n  }\n}\n\n\nvoid dQMultiply0 (dQuaternion qa, const dQuaternion qb, const dQuaternion qc)\n{\n  dAASSERT (qa && qb && qc);\n  qa[0] = qb[0]*qc[0] - qb[1]*qc[1] - qb[2]*qc[2] - qb[3]*qc[3];\n  qa[1] = qb[0]*qc[1] + qb[1]*qc[0] + qb[2]*qc[3] - qb[3]*qc[2];\n  qa[2] = qb[0]*qc[2] + qb[2]*qc[0] + qb[3]*qc[1] - qb[1]*qc[3];\n  qa[3] = qb[0]*qc[3] + qb[3]*qc[0] + qb[1]*qc[2] - qb[2]*qc[1];\n}\n\n\nvoid dQMultiply1 (dQuaternion qa, const dQuaternion qb, const dQuaternion qc)\n{\n  dAASSERT (qa && qb && qc);\n  qa[0] = qb[0]*qc[0] + qb[1]*qc[1] + qb[2]*qc[2] + qb[3]*qc[3];\n  qa[1] = qb[0]*qc[1] - qb[1]*qc[0] - qb[2]*qc[3] + qb[3]*qc[2];\n  qa[2] = qb[0]*qc[2] - qb[2]*qc[0] - qb[3]*qc[1] + qb[1]*qc[3];\n  qa[3] = qb[0]*qc[3] - qb[3]*qc[0] - qb[1]*qc[2] + qb[2]*qc[1];\n}\n\n\nvoid dQMultiply2 (dQuaternion qa, const dQuaternion qb, const dQuaternion qc)\n{\n  dAASSERT (qa && qb && qc);\n  qa[0] =  qb[0]*qc[0] + qb[1]*qc[1] + qb[2]*qc[2] + qb[3]*qc[3];\n  qa[1] = -qb[0]*qc[1] + qb[1]*qc[0] - qb[2]*qc[3] + qb[3]*qc[2];\n  qa[2] = -qb[0]*qc[2] + qb[2]*qc[0] - qb[3]*qc[1] + qb[1]*qc[3];\n  qa[3] = -qb[0]*qc[3] + qb[3]*qc[0] - qb[1]*qc[2] + qb[2]*qc[1];\n}\n\n\nvoid dQMultiply3 (dQuaternion qa, const dQuaternion qb, const dQuaternion qc)\n{\n  dAASSERT (qa && qb && qc);\n  qa[0] =  qb[0]*qc[0] - qb[1]*qc[1] - qb[2]*qc[2] - qb[3]*qc[3];\n  qa[1] = -qb[0]*qc[1] - qb[1]*qc[0] + qb[2]*qc[3] - qb[3]*qc[2];\n  qa[2] = -qb[0]*qc[2] - qb[2]*qc[0] + qb[3]*qc[1] - qb[1]*qc[3];\n  qa[3] = -qb[0]*qc[3] - qb[3]*qc[0] + qb[1]*qc[2] - qb[2]*qc[1];\n}\n\n\n\/\/ dRfromQ(), dQfromR() and dDQfromW() are derived from equations in \"An Introduction\n\/\/ to Physically Based Modeling: Rigid Body Simulation - 1: Unconstrained\n\/\/ Rigid Body Dynamics\" by David Baraff, Robotics Institute, Carnegie Mellon\n\/\/ University, 1997.\n\nvoid dRfromQ (dMatrix3 R, const dQuaternion q)\n{\n  dAASSERT (q && R);\n  \/\/ q = (s,vx,vy,vz)\n  dReal qq1 = 2*q[1]*q[1];\n  dReal qq2 = 2*q[2]*q[2];\n  dReal qq3 = 2*q[3]*q[3];\n  _R(0,0) = 1 - qq2 - qq3;\n  _R(0,1) = 2*(q[1]*q[2] - q[0]*q[3]);\n  _R(0,2) = 2*(q[1]*q[3] + q[0]*q[2]);\n  _R(1,0) = 2*(q[1]*q[2] + q[0]*q[3]);\n  _R(1,1) = 1 - qq1 - qq3;\n  _R(1,2) = 2*(q[2]*q[3] - q[0]*q[1]);\n  _R(2,0) = 2*(q[1]*q[3] - q[0]*q[2]);\n  _R(2,1) = 2*(q[2]*q[3] + q[0]*q[1]);\n  _R(2,2) = 1 - qq1 - qq2;\n}\n\n\nvoid dQfromR (dQuaternion q, const dMatrix3 R)\n{\n  dAASSERT (q && R);\n  dReal tr,s;\n  tr = _R(0,0) + _R(1,1) + _R(2,2);\n  if (tr >= 0) {\n    s = dSqrt (tr + 1);\n    q[0] = REAL(0.5) * s;\n    s = REAL(0.5) * dRecip(s);\n    q[1] = (_R(2,1) - _R(1,2)) * s;\n    q[2] = (_R(0,2) - _R(2,0)) * s;\n    q[3] = (_R(1,0) - _R(0,1)) * s;\n  }\n  else {\n    \/\/ find the largest diagonal element and jump to the appropriate case\n    if (_R(1,1) > _R(0,0)) {\n      if (_R(2,2) > _R(1,1)) goto case_2;\n      goto case_1;\n    }\n    if (_R(2,2) > _R(0,0)) goto case_2;\n    goto case_0;\n\n    case_0:\n    s = dSqrt((_R(0,0) - (_R(1,1) + _R(2,2))) + 1);\n    q[1] = REAL(0.5) * s;\n    s = REAL(0.5) * dRecip(s);\n    q[2] = (_R(0,1) + _R(1,0)) * s;\n    q[3] = (_R(2,0) + _R(0,2)) * s;\n    q[0] = (_R(2,1) - _R(1,2)) * s;\n    return;\n\n    case_1:\n    s = dSqrt((_R(1,1) - (_R(2,2) + _R(0,0))) + 1);\n    q[2] = REAL(0.5) * s;\n    s = REAL(0.5) * dRecip(s);\n    q[3] = (_R(1,2) + _R(2,1)) * s;\n    q[1] = (_R(0,1) + _R(1,0)) * s;\n    q[0] = (_R(0,2) - _R(2,0)) * s;\n    return;\n\n    case_2:\n    s = dSqrt((_R(2,2) - (_R(0,0) + _R(1,1))) + 1);\n    q[3] = REAL(0.5) * s;\n    s = REAL(0.5) * dRecip(s);\n    q[1] = (_R(2,0) + _R(0,2)) * s;\n    q[2] = (_R(1,2) + _R(2,1)) * s;\n    q[0] = (_R(1,0) - _R(0,1)) * s;\n    return;\n  }\n}\n\n\nvoid dDQfromW (dReal dq[4], const dVector3 w, const dQuaternion q)\n{\n  dAASSERT (w && q && dq);\n  dq[0] = REAL(0.5)*(- w[0]*q[1] - w[1]*q[2] - w[2]*q[3]);\n  dq[1] = REAL(0.5)*(  w[0]*q[0] + w[1]*q[3] - w[2]*q[2]);\n  dq[2] = REAL(0.5)*(- w[0]*q[3] + w[1]*q[0] + w[2]*q[1]);\n  dq[3] = REAL(0.5)*(  w[0]*q[2] - w[1]*q[1] + w[2]*q[0]);\n}\n<commit_msg>Padding set to 0 to comply with specs in doc<commit_after>\/*************************************************************************\n *                                                                       *\n * Open Dynamics Engine, Copyright (C) 2001,2002 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\nquaternions have the format: (s,vx,vy,vz) where (vx,vy,vz) is the\n\"rotation axis\" and s is the \"rotation angle\".\n\n*\/\n\n#include <ode\/rotation.h>\n#include <ode\/odemath.h>\n\n\n#define _R(i,j) R[(i)*4+(j)]\n\n#define SET_3x3_IDENTITY \\\n  _R(0,0) = REAL(1.0); \\\n  _R(0,1) = REAL(0.0); \\\n  _R(0,2) = REAL(0.0); \\\n  _R(0,3) = REAL(0.0); \\\n  _R(1,0) = REAL(0.0); \\\n  _R(1,1) = REAL(1.0); \\\n  _R(1,2) = REAL(0.0); \\\n  _R(1,3) = REAL(0.0); \\\n  _R(2,0) = REAL(0.0); \\\n  _R(2,1) = REAL(0.0); \\\n  _R(2,2) = REAL(1.0); \\\n  _R(2,3) = REAL(0.0);\n\n\nvoid dRSetIdentity (dMatrix3 R)\n{\n  dAASSERT (R);\n  SET_3x3_IDENTITY;\n}\n\n\nvoid dRFromAxisAndAngle (dMatrix3 R, dReal ax, dReal ay, dReal az,\n\t\t\t dReal angle)\n{\n  dAASSERT (R);\n  dQuaternion q;\n  dQFromAxisAndAngle (q,ax,ay,az,angle);\n  dQtoR (q,R);\n}\n\n\nvoid dRFromEulerAngles (dMatrix3 R, dReal phi, dReal theta, dReal psi)\n{\n  dReal sphi,cphi,stheta,ctheta,spsi,cpsi;\n  dAASSERT (R);\n  sphi = dSin(phi);\n  cphi = dCos(phi);\n  stheta = dSin(theta);\n  ctheta = dCos(theta);\n  spsi = dSin(psi);\n  cpsi = dCos(psi);\n  _R(0,0) = cpsi*ctheta;\n  _R(0,1) = spsi*ctheta;\n  _R(0,2) =-stheta;\n  _R(0,3) = REAL(0.0);\n  _R(1,0) = cpsi*stheta*sphi - spsi*cphi;\n  _R(1,1) = spsi*stheta*sphi + cpsi*cphi;\n  _R(1,2) = ctheta*sphi;\n  _R(1,3) = REAL(0.0);\n  _R(2,0) = cpsi*stheta*cphi + spsi*sphi;\n  _R(2,1) = spsi*stheta*cphi - cpsi*sphi;\n  _R(2,2) = ctheta*cphi;\n  _R(2,3) = REAL(0.0);\n}\n\n\nvoid dRFrom2Axes (dMatrix3 R, dReal ax, dReal ay, dReal az,\n\t\t  dReal bx, dReal by, dReal bz)\n{\n  dReal l,k;\n  dAASSERT (R);\n  l = dSqrt (ax*ax + ay*ay + az*az);\n  if (l <= REAL(0.0)) {\n    dDEBUGMSG (\"zero length vector\");\n    return;\n  }\n  l = dRecip(l);\n  ax *= l;\n  ay *= l;\n  az *= l;\n  k = ax*bx + ay*by + az*bz;\n  bx -= k*ax;\n  by -= k*ay;\n  bz -= k*az;\n  l = dSqrt (bx*bx + by*by + bz*bz);\n  if (l <= REAL(0.0)) {\n    dDEBUGMSG (\"zero length vector\");\n    return;\n  }\n  l = dRecip(l);\n  bx *= l;\n  by *= l;\n  bz *= l;\n  _R(0,0) = ax;\n  _R(1,0) = ay;\n  _R(2,0) = az;\n  _R(0,1) = bx;\n  _R(1,1) = by;\n  _R(2,1) = bz;\n  _R(0,2) = - by*az + ay*bz;\n  _R(1,2) = - bz*ax + az*bx;\n  _R(2,2) = - bx*ay + ax*by;\n  _R(0,3) = REAL(0.0);\n  _R(1,3) = REAL(0.0);\n  _R(2,3) = REAL(0.0);\n}\n\n\nvoid dRFromZAxis (dMatrix3 R, dReal ax, dReal ay, dReal az)\n{\n  dVector3 n,p,q;\n  n[0] = ax;\n  n[1] = ay;\n  n[2] = az;\n  dNormalize3 (n);\n  dPlaneSpace (n,p,q);\n  _R(0,0) = p[0];\n  _R(1,0) = p[1];\n  _R(2,0) = p[2];\n  _R(0,1) = q[0];\n  _R(1,1) = q[1];\n  _R(2,1) = q[2];\n  _R(0,2) = n[0];\n  _R(1,2) = n[1];\n  _R(2,2) = n[2];\n  _R(0,3) = REAL(0.0);\n  _R(1,3) = REAL(0.0);\n  _R(2,3) = REAL(0.0);\n}\n\n\nvoid dQSetIdentity (dQuaternion q)\n{\n  dAASSERT (q);\n  q[0] = 1;\n  q[1] = 0;\n  q[2] = 0;\n  q[3] = 0;\n}\n\n\nvoid dQFromAxisAndAngle (dQuaternion q, dReal ax, dReal ay, dReal az,\n\t\t\t dReal angle)\n{\n  dAASSERT (q);\n  dReal l = ax*ax + ay*ay + az*az;\n  if (l > REAL(0.0)) {\n    angle *= REAL(0.5);\n    q[0] = dCos (angle);\n    l = dSin(angle) * dRecipSqrt(l);\n    q[1] = ax*l;\n    q[2] = ay*l;\n    q[3] = az*l;\n  }\n  else {\n    q[0] = 1;\n    q[1] = 0;\n    q[2] = 0;\n    q[3] = 0;\n  }\n}\n\n\nvoid dQMultiply0 (dQuaternion qa, const dQuaternion qb, const dQuaternion qc)\n{\n  dAASSERT (qa && qb && qc);\n  qa[0] = qb[0]*qc[0] - qb[1]*qc[1] - qb[2]*qc[2] - qb[3]*qc[3];\n  qa[1] = qb[0]*qc[1] + qb[1]*qc[0] + qb[2]*qc[3] - qb[3]*qc[2];\n  qa[2] = qb[0]*qc[2] + qb[2]*qc[0] + qb[3]*qc[1] - qb[1]*qc[3];\n  qa[3] = qb[0]*qc[3] + qb[3]*qc[0] + qb[1]*qc[2] - qb[2]*qc[1];\n}\n\n\nvoid dQMultiply1 (dQuaternion qa, const dQuaternion qb, const dQuaternion qc)\n{\n  dAASSERT (qa && qb && qc);\n  qa[0] = qb[0]*qc[0] + qb[1]*qc[1] + qb[2]*qc[2] + qb[3]*qc[3];\n  qa[1] = qb[0]*qc[1] - qb[1]*qc[0] - qb[2]*qc[3] + qb[3]*qc[2];\n  qa[2] = qb[0]*qc[2] - qb[2]*qc[0] - qb[3]*qc[1] + qb[1]*qc[3];\n  qa[3] = qb[0]*qc[3] - qb[3]*qc[0] - qb[1]*qc[2] + qb[2]*qc[1];\n}\n\n\nvoid dQMultiply2 (dQuaternion qa, const dQuaternion qb, const dQuaternion qc)\n{\n  dAASSERT (qa && qb && qc);\n  qa[0] =  qb[0]*qc[0] + qb[1]*qc[1] + qb[2]*qc[2] + qb[3]*qc[3];\n  qa[1] = -qb[0]*qc[1] + qb[1]*qc[0] - qb[2]*qc[3] + qb[3]*qc[2];\n  qa[2] = -qb[0]*qc[2] + qb[2]*qc[0] - qb[3]*qc[1] + qb[1]*qc[3];\n  qa[3] = -qb[0]*qc[3] + qb[3]*qc[0] - qb[1]*qc[2] + qb[2]*qc[1];\n}\n\n\nvoid dQMultiply3 (dQuaternion qa, const dQuaternion qb, const dQuaternion qc)\n{\n  dAASSERT (qa && qb && qc);\n  qa[0] =  qb[0]*qc[0] - qb[1]*qc[1] - qb[2]*qc[2] - qb[3]*qc[3];\n  qa[1] = -qb[0]*qc[1] - qb[1]*qc[0] + qb[2]*qc[3] - qb[3]*qc[2];\n  qa[2] = -qb[0]*qc[2] - qb[2]*qc[0] + qb[3]*qc[1] - qb[1]*qc[3];\n  qa[3] = -qb[0]*qc[3] - qb[3]*qc[0] + qb[1]*qc[2] - qb[2]*qc[1];\n}\n\n\n\/\/ dRfromQ(), dQfromR() and dDQfromW() are derived from equations in \"An Introduction\n\/\/ to Physically Based Modeling: Rigid Body Simulation - 1: Unconstrained\n\/\/ Rigid Body Dynamics\" by David Baraff, Robotics Institute, Carnegie Mellon\n\/\/ University, 1997.\n\nvoid dRfromQ (dMatrix3 R, const dQuaternion q)\n{\n  dAASSERT (q && R);\n  \/\/ q = (s,vx,vy,vz)\n  dReal qq1 = 2*q[1]*q[1];\n  dReal qq2 = 2*q[2]*q[2];\n  dReal qq3 = 2*q[3]*q[3];\n  _R(0,0) = 1 - qq2 - qq3;\n  _R(0,1) = 2*(q[1]*q[2] - q[0]*q[3]);\n  _R(0,2) = 2*(q[1]*q[3] + q[0]*q[2]);\n  _R(0,3) = REAL(0.0);\n  _R(1,0) = 2*(q[1]*q[2] + q[0]*q[3]);\n  _R(1,1) = 1 - qq1 - qq3;\n  _R(1,2) = 2*(q[2]*q[3] - q[0]*q[1]);\n  _R(1,3) = REAL(0.0);\n  _R(2,0) = 2*(q[1]*q[3] - q[0]*q[2]);\n  _R(2,1) = 2*(q[2]*q[3] + q[0]*q[1]);\n  _R(2,2) = 1 - qq1 - qq2;\n  _R(2,3) = REAL(0.0);\n}\n\n\nvoid dQfromR (dQuaternion q, const dMatrix3 R)\n{\n  dAASSERT (q && R);\n  dReal tr,s;\n  tr = _R(0,0) + _R(1,1) + _R(2,2);\n  if (tr >= 0) {\n    s = dSqrt (tr + 1);\n    q[0] = REAL(0.5) * s;\n    s = REAL(0.5) * dRecip(s);\n    q[1] = (_R(2,1) - _R(1,2)) * s;\n    q[2] = (_R(0,2) - _R(2,0)) * s;\n    q[3] = (_R(1,0) - _R(0,1)) * s;\n  }\n  else {\n    \/\/ find the largest diagonal element and jump to the appropriate case\n    if (_R(1,1) > _R(0,0)) {\n      if (_R(2,2) > _R(1,1)) goto case_2;\n      goto case_1;\n    }\n    if (_R(2,2) > _R(0,0)) goto case_2;\n    goto case_0;\n\n    case_0:\n    s = dSqrt((_R(0,0) - (_R(1,1) + _R(2,2))) + 1);\n    q[1] = REAL(0.5) * s;\n    s = REAL(0.5) * dRecip(s);\n    q[2] = (_R(0,1) + _R(1,0)) * s;\n    q[3] = (_R(2,0) + _R(0,2)) * s;\n    q[0] = (_R(2,1) - _R(1,2)) * s;\n    return;\n\n    case_1:\n    s = dSqrt((_R(1,1) - (_R(2,2) + _R(0,0))) + 1);\n    q[2] = REAL(0.5) * s;\n    s = REAL(0.5) * dRecip(s);\n    q[3] = (_R(1,2) + _R(2,1)) * s;\n    q[1] = (_R(0,1) + _R(1,0)) * s;\n    q[0] = (_R(0,2) - _R(2,0)) * s;\n    return;\n\n    case_2:\n    s = dSqrt((_R(2,2) - (_R(0,0) + _R(1,1))) + 1);\n    q[3] = REAL(0.5) * s;\n    s = REAL(0.5) * dRecip(s);\n    q[1] = (_R(2,0) + _R(0,2)) * s;\n    q[2] = (_R(1,2) + _R(2,1)) * s;\n    q[0] = (_R(1,0) - _R(0,1)) * s;\n    return;\n  }\n}\n\n\nvoid dDQfromW (dReal dq[4], const dVector3 w, const dQuaternion q)\n{\n  dAASSERT (w && q && dq);\n  dq[0] = REAL(0.5)*(- w[0]*q[1] - w[1]*q[2] - w[2]*q[3]);\n  dq[1] = REAL(0.5)*(  w[0]*q[0] + w[1]*q[3] - w[2]*q[2]);\n  dq[2] = REAL(0.5)*(- w[0]*q[3] + w[1]*q[0] + w[2]*q[1]);\n  dq[3] = REAL(0.5)*(  w[0]*q[2] - w[1]*q[1] + w[2]*q[0]);\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Cleaner status reporting<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"CoefficientTimeDerivative.h\"\n\ntemplate<>\nInputParameters validParams<CoefficientTimeDerivative>()\n{\n  InputParameters params = validParams<TimeDerivative>();\n  params.addParam<Real>(\"coefficient\", 1.0, \"Time derivative coefficient\");\n  params.addParam<std::string>(\"property\", \"The name of the material property to utilize as the coefficient\");\n  params.addParam<Real>(\"offset\", 0, \"Offset added to the material property value\");\n  params.addParam<Real>(\"scale\", 1, \"Multiplier applied to the material property value\");\n\/\/  params.addParam<Real>(\"hasMaterial\", 0, \"Boolean showing that material property has been assigned\");\n  return params;\n}\n\nCoefficientTimeDerivative::CoefficientTimeDerivative(const std::string & name, InputParameters parameters) :\n    TimeDerivative(name, parameters),\n    _has_material(isParamValid(\"property\")),\n    _coefficient(getParam<Real>(\"coefficient\")),\n    _material_coefficient(NULL),\n    _scale(getParam<Real>(\"scale\")),\n    _offset(getParam<Real>(\"offset\"))\n\n{\n   if (_has_material)\n     _material_coefficient = &getMaterialProperty<Real>(getParam<std::string>(\"property\"));\n}\n\nReal\nCoefficientTimeDerivative::computeQpResidual()\n{\n    if (_has_material)\n   {\n     mooseWarning(\" Material property is being used and ignoring any coefficient inputs.\");\n     return (_scale * ((*_material_coefficient)[_qp]) + _offset) * TimeDerivative::computeQpResidual();\n   }\n\n    else\n      return (_scale *_coefficient+_offset) * TimeDerivative::computeQpResidual();\n}\n\nReal\nCoefficientTimeDerivative::computeQpJacobian()\n{\n    if (_has_material)\n     return (_scale * ((*_material_coefficient)[_qp]) + _offset) * TimeDerivative::computeQpJacobian();\n    else\n      return (_scale *_coefficient+_offset) * TimeDerivative::computeQpJacobian();\n}\n<commit_msg>Moved mooseWarning into constructor<commit_after>#include \"CoefficientTimeDerivative.h\"\n\ntemplate<>\nInputParameters validParams<CoefficientTimeDerivative>()\n{\n  InputParameters params = validParams<TimeDerivative>();\n  params.addParam<Real>(\"coefficient\", 1.0, \"Time derivative coefficient\");\n  params.addParam<std::string>(\"property\", \"The name of the material property to utilize as the coefficient\");\n  params.addParam<Real>(\"offset\", 0, \"Offset added to the material property value\");\n  params.addParam<Real>(\"scale\", 1, \"Multiplier applied to the material property value\");\n\/\/  params.addParam<Real>(\"hasMaterial\", 0, \"Boolean showing that material property has been assigned\");\n  return params;\n}\n\nCoefficientTimeDerivative::CoefficientTimeDerivative(const std::string & name, InputParameters parameters) :\n    TimeDerivative(name, parameters),\n    _has_material(isParamValid(\"property\")),\n    _coefficient(getParam<Real>(\"coefficient\")),\n    _material_coefficient(NULL),\n    _scale(getParam<Real>(\"scale\")),\n    _offset(getParam<Real>(\"offset\"))\n\n{\n   if (_has_material)\n   {\n      mooseWarning(\" Material property is being used and ignoring any coefficient inputs.\");\n      _material_coefficient = &getMaterialProperty<Real>(getParam<std::string>(\"property\"));\n   }\n}\n\nReal\nCoefficientTimeDerivative::computeQpResidual()\n{\n    if (_has_material)\n     return (_scale * ((*_material_coefficient)[_qp]) + _offset) * TimeDerivative::computeQpResidual();\n\n    else\n      return (_scale *_coefficient+_offset) * TimeDerivative::computeQpResidual();\n}\n\nReal\nCoefficientTimeDerivative::computeQpJacobian()\n{\n    if (_has_material)\n     return (_scale * ((*_material_coefficient)[_qp]) + _offset) * TimeDerivative::computeQpJacobian();\n    else\n      return (_scale *_coefficient+_offset) * TimeDerivative::computeQpJacobian();\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\n    This 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 \"rawspeedconfig.h\" \/\/ for HAVE_PTHREAD\n#include \"decoders\/RawDecoder.h\"\n#include \"common\/Common.h\"                          \/\/ for uint32, getThrea...\n#include \"common\/Point.h\"                           \/\/ for iPoint2D, iRecta...\n#include \"decoders\/RawDecoderException.h\"           \/\/ for ThrowRDE, RawDec...\n#include \"decompressors\/UncompressedDecompressor.h\" \/\/ for UncompressedDeco...\n#include \"io\/Buffer.h\"                              \/\/ for Buffer\n#include \"io\/FileIOException.h\"                     \/\/ for FileIOException\n#include \"io\/IOException.h\"                         \/\/ for IOException\n#include \"metadata\/BlackArea.h\"                     \/\/ for BlackArea\n#include \"metadata\/Camera.h\"                        \/\/ for Camera, Hints\n#include \"metadata\/CameraMetaData.h\"                \/\/ for CameraMetaData\n#include \"metadata\/CameraSensorInfo.h\"              \/\/ for CameraSensorInfo\n#include \"metadata\/ColorFilterArray.h\"              \/\/ for ColorFilterArray\n#include \"parsers\/TiffParserException.h\"            \/\/ for TiffParserException\n#include \"tiff\/TiffEntry.h\"                         \/\/ for TiffEntry\n#include \"tiff\/TiffIFD.h\"                           \/\/ for TiffIFD\n#include \"tiff\/TiffTag.h\"                           \/\/ for TiffTag::STRIPOF...\n#include <algorithm>                                \/\/ for min\n#include <memory>                                   \/\/ for allocator_traits...\n#include <string>                                   \/\/ for string, basic_st...\n#include <vector>                                   \/\/ for vector\n\nusing namespace std;\n\nnamespace RawSpeed {\n\nRawDecoder::RawDecoder(Buffer* file) : mRaw(RawImage::create()), mFile(file) {\n  failOnUnknown = false;\n  interpolateBadPixels = true;\n  applyStage1DngOpcodes = true;\n  applyCrop = true;\n  uncorrectedRawValues = false;\n  fujiRotate = true;\n}\n\nvoid RawDecoder::decodeUncompressed(const TiffIFD *rawIFD, BitOrder order) {\n  uint32 nslices = rawIFD->getEntry(STRIPOFFSETS)->count;\n  TiffEntry *offsets = rawIFD->getEntry(STRIPOFFSETS);\n  TiffEntry *counts = rawIFD->getEntry(STRIPBYTECOUNTS);\n  uint32 yPerSlice = rawIFD->getEntry(ROWSPERSTRIP)->getU32();\n  uint32 width = rawIFD->getEntry(IMAGEWIDTH)->getU32();\n  uint32 height = rawIFD->getEntry(IMAGELENGTH)->getU32();\n  uint32 bitPerPixel = rawIFD->getEntry(BITSPERSAMPLE)->getU32();\n\n  vector<RawSlice> slices;\n  uint32 offY = 0;\n\n  for (uint32 s = 0; s < nslices; s++) {\n    RawSlice slice;\n    slice.offset = offsets->getU32(s);\n    slice.count = counts->getU32(s);\n    if (offY + yPerSlice > height)\n      slice.h = height - offY;\n    else\n      slice.h = yPerSlice;\n\n    offY += yPerSlice;\n\n    if (mFile->isValid(slice.offset, slice.count)) \/\/ Only decode if size is valid\n      slices.push_back(slice);\n  }\n\n  if (slices.empty())\n    ThrowRDE(\"No valid slices found. File probably truncated.\");\n\n  mRaw->dim = iPoint2D(width, offY);\n  mRaw->createData();\n  mRaw->whitePoint = (1<<bitPerPixel)-1;\n\n  offY = 0;\n  for (uint32 i = 0; i < slices.size(); i++) {\n    RawSlice slice = slices[i];\n    UncompressedDecompressor u(*mFile, slice.offset, slice.count, mRaw);\n    iPoint2D size(width, slice.h);\n    iPoint2D pos(0, offY);\n    bitPerPixel = (int)((uint64)((uint64)slice.count * 8u) \/ (slice.h * width));\n    try {\n      u.readUncompressedRaw(size, pos, width * bitPerPixel \/ 8, bitPerPixel,\n                            order);\n    } catch (RawDecoderException &e) {\n      if (i>0)\n        mRaw->setError(e.what());\n      else\n        throw;\n    } catch (IOException &e) {\n      if (i>0)\n        mRaw->setError(e.what());\n      else {\n        ThrowRDE(\"IO error occurred in first slice, unable to decode more. \"\n                 \"Error is: %s\",\n                 e.what());\n      }\n    }\n    offY += slice.h;\n  }\n}\n\nvoid RawDecoder::askForSamples(const CameraMetaData* meta, const string& make,\n                               const string& model, const string& mode) const {\n  if (\"dng\" == mode)\n    return;\n\n  writeLog(DEBUG_PRIO_WARNING,\n           \"Unable to find camera in database: '%s' '%s' \"\n           \"'%s'\\nPlease consider providing samples on \"\n           \"<https:\/\/raw.pixls.us\/>, thanks!\",\n           make.c_str(), model.c_str(), mode.c_str());\n}\n\nbool RawDecoder::checkCameraSupported(const CameraMetaData* meta,\n                                      const string& make, const string& model,\n                                      const string& mode) {\n  mRaw->metadata.make = make;\n  mRaw->metadata.model = model;\n  const Camera* cam = meta->getCamera(make, model, mode);\n  if (!cam) {\n    askForSamples(meta, make, model, mode);\n\n    if (failOnUnknown)\n      ThrowRDE(\"Camera '%s' '%s', mode '%s' not supported, and not allowed to guess. Sorry.\", make.c_str(), model.c_str(), mode.c_str());\n\n    \/\/ Assume the camera can be decoded, but return false, so decoders can see that we are unsure.\n    return false;\n  }\n\n  if (!cam->supported)\n    ThrowRDE(\"Camera not supported (explicit). Sorry.\");\n\n  if (cam->decoderVersion > getDecoderVersion())\n    ThrowRDE(\"Camera not supported in this version. Update RawSpeed for support.\");\n\n  hints = cam->hints;\n  return true;\n}\n\nvoid RawDecoder::setMetaData(const CameraMetaData* meta, const string& make,\n                             const string& model, const string& mode,\n                             int iso_speed) {\n  mRaw->metadata.isoSpeed = iso_speed;\n  const Camera* cam = meta->getCamera(make, model, mode);\n  if (!cam) {\n    askForSamples(meta, make, model, mode);\n\n    if (failOnUnknown)\n      ThrowRDE(\"Camera '%s' '%s', mode '%s' not supported, and not allowed to guess. Sorry.\", make.c_str(), model.c_str(), mode.c_str());\n\n    return;\n  }\n\n  mRaw->cfa = cam->cfa;\n  mRaw->metadata.canonical_make = cam->canonical_make;\n  mRaw->metadata.canonical_model = cam->canonical_model;\n  mRaw->metadata.canonical_alias = cam->canonical_alias;\n  mRaw->metadata.canonical_id = cam->canonical_id;\n  mRaw->metadata.make = make;\n  mRaw->metadata.model = model;\n  mRaw->metadata.mode = mode;\n\n  if (applyCrop) {\n    iPoint2D new_size = cam->cropSize;\n\n    \/\/ If crop size is negative, use relative cropping\n    if (new_size.x <= 0)\n      new_size.x = mRaw->dim.x - cam->cropPos.x + new_size.x;\n\n    if (new_size.y <= 0)\n      new_size.y = mRaw->dim.y - cam->cropPos.y + new_size.y;\n\n    mRaw->subFrame(iRectangle2D(cam->cropPos, new_size));\n  }\n\n  const CameraSensorInfo *sensor = cam->getSensorInfo(iso_speed);\n  mRaw->blackLevel = sensor->mBlackLevel;\n  mRaw->whitePoint = sensor->mWhiteLevel;\n  mRaw->blackAreas = cam->blackAreas;\n  if (mRaw->blackAreas.empty() && !sensor->mBlackLevelSeparate.empty()) {\n    auto cfaArea = mRaw->cfa.getSize().area();\n    if (mRaw->isCFA && cfaArea <= sensor->mBlackLevelSeparate.size()) {\n      for (uint32 i = 0; i < cfaArea; i++) {\n        mRaw->blackLevelSeparate[i] = sensor->mBlackLevelSeparate[i];\n      }\n    } else if (!mRaw->isCFA && mRaw->getCpp() <= sensor->mBlackLevelSeparate.size()) {\n      for (uint32 i = 0; i < mRaw->getCpp(); i++) {\n        mRaw->blackLevelSeparate[i] = sensor->mBlackLevelSeparate[i];\n      }\n    }\n  }\n\n  \/\/ Allow overriding individual blacklevels. Values are in CFA order\n  \/\/ (the same order as the in the CFA tag)\n  \/\/ A hint could be:\n  \/\/ <Hint name=\"override_cfa_black\" value=\"10,20,30,20\"\/>\n  string cfa_black = hints.get(\"override_cfa_black\", string());\n  if (!cfa_black.empty()) {\n    vector<string> v = splitString(cfa_black, ',');\n    if (v.size() != 4) {\n      mRaw->setError(\"Expected 4 values '10,20,30,20' as values for override_cfa_black hint.\");\n    } else {\n      for (int i = 0; i < 4; i++) {\n        mRaw->blackLevelSeparate[i] = stoi(v[i]);\n      }\n    }\n  }\n}\n\n\nvoid *RawDecoderDecodeThread(void *_this) {\n  auto *me = (RawDecoderThread *)_this;\n  try {\n     me->parent->decodeThreaded(me);\n  } catch (RawDecoderException &ex) {\n    me->parent->mRaw->setError(ex.what());\n  } catch (IOException &ex) {\n    me->parent->mRaw->setError(ex.what());\n  }\n  return nullptr;\n}\n\nvoid RawDecoder::startThreads() {\n#ifndef HAVE_PTHREAD\n  uint32 threads = 1;\n  RawDecoderThread t(this);\n  t.start_y = 0;\n  t.end_y = mRaw->dim.y;\n  RawDecoderDecodeThread(&t);\n#else\n  uint32 threads;\n  bool fail = false;\n  threads = min((unsigned)mRaw->dim.y, getThreadCount());\n  int y_offset = 0;\n  int y_per_thread = (mRaw->dim.y + threads - 1) \/ threads;\n\n  vector<RawDecoderThread> t(threads, RawDecoderThread(this));\n\n  \/* Initialize and set thread detached attribute *\/\n  pthread_attr_t attr;\n  pthread_attr_init(&attr);\n  pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_JOINABLE);\n\n  for (uint32 i = 0; i < threads; i++) {\n    t[i].start_y = y_offset;\n    t[i].end_y = min(y_offset + y_per_thread, mRaw->dim.y);\n    if (pthread_create(&t[i].threadid, &attr, RawDecoderDecodeThread, &t[i]) != 0) {\n      \/\/ If a failure occurs, we need to wait for the already created threads to finish\n      threads = i-1;\n      fail = true;\n    }\n    y_offset = t[i].end_y;\n  }\n\n  for (uint32 i = 0; i < threads; i++) {\n    pthread_join(t[i].threadid, nullptr);\n  }\n  pthread_attr_destroy(&attr);\n\n  if (fail) {\n    ThrowRDE(\"Unable to start threads\");\n  }\n#endif\n\n  if (mRaw->errors.size() >= threads)\n    ThrowRDE(\"All threads reported errors. Cannot load image.\");\n}\n\nvoid RawDecoder::decodeThreaded(RawDecoderThread * t) {\n  ThrowRDE(\"This class does not support threaded decoding\");\n}\n\nRawSpeed::RawImage RawDecoder::decodeRaw()\n{\n  try {\n    RawImage raw = decodeRawInternal();\n    raw->metadata.pixelAspectRatio =\n        hints.get(\"pixel_aspect_ratio\", raw->metadata.pixelAspectRatio);\n    if (interpolateBadPixels)\n      raw->fixBadPixels();\n    return raw;\n  } catch (TiffParserException &e) {\n    ThrowRDE(\"%s\", e.what());\n  } catch (FileIOException &e) {\n    ThrowRDE(\"%s\", e.what());\n  } catch (IOException &e) {\n    ThrowRDE(\"%s\", e.what());\n  }\n  return RawImage(nullptr);\n}\n\nvoid RawDecoder::decodeMetaData(const CameraMetaData* meta) {\n  try {\n    return decodeMetaDataInternal(meta);\n  } catch (TiffParserException &e) {\n    ThrowRDE(\"%s\", e.what());\n  } catch (FileIOException &e) {\n    ThrowRDE(\"%s\", e.what());\n  } catch (IOException &e) {\n    ThrowRDE(\"%s\", e.what());\n  }\n}\n\nvoid RawDecoder::checkSupport(const CameraMetaData* meta) {\n  try {\n    return checkSupportInternal(meta);\n  } catch (TiffParserException &e) {\n    ThrowRDE(\"%s\", e.what());\n  } catch (FileIOException &e) {\n    ThrowRDE(\"%s\", e.what());\n  } catch (IOException &e) {\n    ThrowRDE(\"%s\", e.what());\n  }\n}\n\nvoid RawDecoder::startTasks( uint32 tasks )\n{\n  uint32 threads;\n  threads = min(tasks, getThreadCount());\n  int ctask = 0;\n  vector<RawDecoderThread> t(threads, RawDecoderThread(this));\n\n  \/\/ We don't need a thread\n  if (threads == 1) {\n    while ((uint32)ctask < tasks) {\n      t[0].taskNo = ctask++;\n      RawDecoderDecodeThread(&t[0]);\n    }\n    return;\n  }\n\n#ifdef HAVE_PTHREAD\n  pthread_attr_t attr;\n\n  \/* Initialize and set thread detached attribute *\/\n  pthread_attr_init(&attr);\n  pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_JOINABLE);\n\n  \/* TODO: Create a way to re-use threads *\/\n  void *status;\n  while ((uint32)ctask < tasks) {\n    for (uint32 i = 0; i < threads && (uint32)ctask < tasks; i++) {\n      t[i].taskNo = ctask++;\n      pthread_create(&t[i].threadid, &attr, RawDecoderDecodeThread, &t[i]);\n    }\n    for (uint32 i = 0; i < threads; i++) {\n      pthread_join(t[i].threadid, &status);\n    }\n  }\n\n  if (mRaw->errors.size() >= tasks)\n    ThrowRDE(\"All threads reported errors. Cannot load image.\");\n\n#else\n  ThrowRDE(\"Unreachable\");\n#endif\n}\n\n} \/\/ namespace RawSpeed\n<commit_msg>RawDecoder: decodeMetaData(), checkSupport(): drop wrong return keyword.<commit_after>\/*\n    RawSpeed - RAW file decoder.\n\n    Copyright (C) 2009-2014 Klaus Post\n    Copyright (C) 2014 Pedro Côrte-Real\n\n    This 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 \"rawspeedconfig.h\" \/\/ for HAVE_PTHREAD\n#include \"decoders\/RawDecoder.h\"\n#include \"common\/Common.h\"                          \/\/ for uint32, getThrea...\n#include \"common\/Point.h\"                           \/\/ for iPoint2D, iRecta...\n#include \"decoders\/RawDecoderException.h\"           \/\/ for ThrowRDE, RawDec...\n#include \"decompressors\/UncompressedDecompressor.h\" \/\/ for UncompressedDeco...\n#include \"io\/Buffer.h\"                              \/\/ for Buffer\n#include \"io\/FileIOException.h\"                     \/\/ for FileIOException\n#include \"io\/IOException.h\"                         \/\/ for IOException\n#include \"metadata\/BlackArea.h\"                     \/\/ for BlackArea\n#include \"metadata\/Camera.h\"                        \/\/ for Camera, Hints\n#include \"metadata\/CameraMetaData.h\"                \/\/ for CameraMetaData\n#include \"metadata\/CameraSensorInfo.h\"              \/\/ for CameraSensorInfo\n#include \"metadata\/ColorFilterArray.h\"              \/\/ for ColorFilterArray\n#include \"parsers\/TiffParserException.h\"            \/\/ for TiffParserException\n#include \"tiff\/TiffEntry.h\"                         \/\/ for TiffEntry\n#include \"tiff\/TiffIFD.h\"                           \/\/ for TiffIFD\n#include \"tiff\/TiffTag.h\"                           \/\/ for TiffTag::STRIPOF...\n#include <algorithm>                                \/\/ for min\n#include <memory>                                   \/\/ for allocator_traits...\n#include <string>                                   \/\/ for string, basic_st...\n#include <vector>                                   \/\/ for vector\n\nusing namespace std;\n\nnamespace RawSpeed {\n\nRawDecoder::RawDecoder(Buffer* file) : mRaw(RawImage::create()), mFile(file) {\n  failOnUnknown = false;\n  interpolateBadPixels = true;\n  applyStage1DngOpcodes = true;\n  applyCrop = true;\n  uncorrectedRawValues = false;\n  fujiRotate = true;\n}\n\nvoid RawDecoder::decodeUncompressed(const TiffIFD *rawIFD, BitOrder order) {\n  uint32 nslices = rawIFD->getEntry(STRIPOFFSETS)->count;\n  TiffEntry *offsets = rawIFD->getEntry(STRIPOFFSETS);\n  TiffEntry *counts = rawIFD->getEntry(STRIPBYTECOUNTS);\n  uint32 yPerSlice = rawIFD->getEntry(ROWSPERSTRIP)->getU32();\n  uint32 width = rawIFD->getEntry(IMAGEWIDTH)->getU32();\n  uint32 height = rawIFD->getEntry(IMAGELENGTH)->getU32();\n  uint32 bitPerPixel = rawIFD->getEntry(BITSPERSAMPLE)->getU32();\n\n  vector<RawSlice> slices;\n  uint32 offY = 0;\n\n  for (uint32 s = 0; s < nslices; s++) {\n    RawSlice slice;\n    slice.offset = offsets->getU32(s);\n    slice.count = counts->getU32(s);\n    if (offY + yPerSlice > height)\n      slice.h = height - offY;\n    else\n      slice.h = yPerSlice;\n\n    offY += yPerSlice;\n\n    if (mFile->isValid(slice.offset, slice.count)) \/\/ Only decode if size is valid\n      slices.push_back(slice);\n  }\n\n  if (slices.empty())\n    ThrowRDE(\"No valid slices found. File probably truncated.\");\n\n  mRaw->dim = iPoint2D(width, offY);\n  mRaw->createData();\n  mRaw->whitePoint = (1<<bitPerPixel)-1;\n\n  offY = 0;\n  for (uint32 i = 0; i < slices.size(); i++) {\n    RawSlice slice = slices[i];\n    UncompressedDecompressor u(*mFile, slice.offset, slice.count, mRaw);\n    iPoint2D size(width, slice.h);\n    iPoint2D pos(0, offY);\n    bitPerPixel = (int)((uint64)((uint64)slice.count * 8u) \/ (slice.h * width));\n    try {\n      u.readUncompressedRaw(size, pos, width * bitPerPixel \/ 8, bitPerPixel,\n                            order);\n    } catch (RawDecoderException &e) {\n      if (i>0)\n        mRaw->setError(e.what());\n      else\n        throw;\n    } catch (IOException &e) {\n      if (i>0)\n        mRaw->setError(e.what());\n      else {\n        ThrowRDE(\"IO error occurred in first slice, unable to decode more. \"\n                 \"Error is: %s\",\n                 e.what());\n      }\n    }\n    offY += slice.h;\n  }\n}\n\nvoid RawDecoder::askForSamples(const CameraMetaData* meta, const string& make,\n                               const string& model, const string& mode) const {\n  if (\"dng\" == mode)\n    return;\n\n  writeLog(DEBUG_PRIO_WARNING,\n           \"Unable to find camera in database: '%s' '%s' \"\n           \"'%s'\\nPlease consider providing samples on \"\n           \"<https:\/\/raw.pixls.us\/>, thanks!\",\n           make.c_str(), model.c_str(), mode.c_str());\n}\n\nbool RawDecoder::checkCameraSupported(const CameraMetaData* meta,\n                                      const string& make, const string& model,\n                                      const string& mode) {\n  mRaw->metadata.make = make;\n  mRaw->metadata.model = model;\n  const Camera* cam = meta->getCamera(make, model, mode);\n  if (!cam) {\n    askForSamples(meta, make, model, mode);\n\n    if (failOnUnknown)\n      ThrowRDE(\"Camera '%s' '%s', mode '%s' not supported, and not allowed to guess. Sorry.\", make.c_str(), model.c_str(), mode.c_str());\n\n    \/\/ Assume the camera can be decoded, but return false, so decoders can see that we are unsure.\n    return false;\n  }\n\n  if (!cam->supported)\n    ThrowRDE(\"Camera not supported (explicit). Sorry.\");\n\n  if (cam->decoderVersion > getDecoderVersion())\n    ThrowRDE(\"Camera not supported in this version. Update RawSpeed for support.\");\n\n  hints = cam->hints;\n  return true;\n}\n\nvoid RawDecoder::setMetaData(const CameraMetaData* meta, const string& make,\n                             const string& model, const string& mode,\n                             int iso_speed) {\n  mRaw->metadata.isoSpeed = iso_speed;\n  const Camera* cam = meta->getCamera(make, model, mode);\n  if (!cam) {\n    askForSamples(meta, make, model, mode);\n\n    if (failOnUnknown)\n      ThrowRDE(\"Camera '%s' '%s', mode '%s' not supported, and not allowed to guess. Sorry.\", make.c_str(), model.c_str(), mode.c_str());\n\n    return;\n  }\n\n  mRaw->cfa = cam->cfa;\n  mRaw->metadata.canonical_make = cam->canonical_make;\n  mRaw->metadata.canonical_model = cam->canonical_model;\n  mRaw->metadata.canonical_alias = cam->canonical_alias;\n  mRaw->metadata.canonical_id = cam->canonical_id;\n  mRaw->metadata.make = make;\n  mRaw->metadata.model = model;\n  mRaw->metadata.mode = mode;\n\n  if (applyCrop) {\n    iPoint2D new_size = cam->cropSize;\n\n    \/\/ If crop size is negative, use relative cropping\n    if (new_size.x <= 0)\n      new_size.x = mRaw->dim.x - cam->cropPos.x + new_size.x;\n\n    if (new_size.y <= 0)\n      new_size.y = mRaw->dim.y - cam->cropPos.y + new_size.y;\n\n    mRaw->subFrame(iRectangle2D(cam->cropPos, new_size));\n  }\n\n  const CameraSensorInfo *sensor = cam->getSensorInfo(iso_speed);\n  mRaw->blackLevel = sensor->mBlackLevel;\n  mRaw->whitePoint = sensor->mWhiteLevel;\n  mRaw->blackAreas = cam->blackAreas;\n  if (mRaw->blackAreas.empty() && !sensor->mBlackLevelSeparate.empty()) {\n    auto cfaArea = mRaw->cfa.getSize().area();\n    if (mRaw->isCFA && cfaArea <= sensor->mBlackLevelSeparate.size()) {\n      for (uint32 i = 0; i < cfaArea; i++) {\n        mRaw->blackLevelSeparate[i] = sensor->mBlackLevelSeparate[i];\n      }\n    } else if (!mRaw->isCFA && mRaw->getCpp() <= sensor->mBlackLevelSeparate.size()) {\n      for (uint32 i = 0; i < mRaw->getCpp(); i++) {\n        mRaw->blackLevelSeparate[i] = sensor->mBlackLevelSeparate[i];\n      }\n    }\n  }\n\n  \/\/ Allow overriding individual blacklevels. Values are in CFA order\n  \/\/ (the same order as the in the CFA tag)\n  \/\/ A hint could be:\n  \/\/ <Hint name=\"override_cfa_black\" value=\"10,20,30,20\"\/>\n  string cfa_black = hints.get(\"override_cfa_black\", string());\n  if (!cfa_black.empty()) {\n    vector<string> v = splitString(cfa_black, ',');\n    if (v.size() != 4) {\n      mRaw->setError(\"Expected 4 values '10,20,30,20' as values for override_cfa_black hint.\");\n    } else {\n      for (int i = 0; i < 4; i++) {\n        mRaw->blackLevelSeparate[i] = stoi(v[i]);\n      }\n    }\n  }\n}\n\n\nvoid *RawDecoderDecodeThread(void *_this) {\n  auto *me = (RawDecoderThread *)_this;\n  try {\n     me->parent->decodeThreaded(me);\n  } catch (RawDecoderException &ex) {\n    me->parent->mRaw->setError(ex.what());\n  } catch (IOException &ex) {\n    me->parent->mRaw->setError(ex.what());\n  }\n  return nullptr;\n}\n\nvoid RawDecoder::startThreads() {\n#ifndef HAVE_PTHREAD\n  uint32 threads = 1;\n  RawDecoderThread t(this);\n  t.start_y = 0;\n  t.end_y = mRaw->dim.y;\n  RawDecoderDecodeThread(&t);\n#else\n  uint32 threads;\n  bool fail = false;\n  threads = min((unsigned)mRaw->dim.y, getThreadCount());\n  int y_offset = 0;\n  int y_per_thread = (mRaw->dim.y + threads - 1) \/ threads;\n\n  vector<RawDecoderThread> t(threads, RawDecoderThread(this));\n\n  \/* Initialize and set thread detached attribute *\/\n  pthread_attr_t attr;\n  pthread_attr_init(&attr);\n  pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_JOINABLE);\n\n  for (uint32 i = 0; i < threads; i++) {\n    t[i].start_y = y_offset;\n    t[i].end_y = min(y_offset + y_per_thread, mRaw->dim.y);\n    if (pthread_create(&t[i].threadid, &attr, RawDecoderDecodeThread, &t[i]) != 0) {\n      \/\/ If a failure occurs, we need to wait for the already created threads to finish\n      threads = i-1;\n      fail = true;\n    }\n    y_offset = t[i].end_y;\n  }\n\n  for (uint32 i = 0; i < threads; i++) {\n    pthread_join(t[i].threadid, nullptr);\n  }\n  pthread_attr_destroy(&attr);\n\n  if (fail) {\n    ThrowRDE(\"Unable to start threads\");\n  }\n#endif\n\n  if (mRaw->errors.size() >= threads)\n    ThrowRDE(\"All threads reported errors. Cannot load image.\");\n}\n\nvoid RawDecoder::decodeThreaded(RawDecoderThread * t) {\n  ThrowRDE(\"This class does not support threaded decoding\");\n}\n\nRawSpeed::RawImage RawDecoder::decodeRaw()\n{\n  try {\n    RawImage raw = decodeRawInternal();\n    raw->metadata.pixelAspectRatio =\n        hints.get(\"pixel_aspect_ratio\", raw->metadata.pixelAspectRatio);\n    if (interpolateBadPixels)\n      raw->fixBadPixels();\n    return raw;\n  } catch (TiffParserException &e) {\n    ThrowRDE(\"%s\", e.what());\n  } catch (FileIOException &e) {\n    ThrowRDE(\"%s\", e.what());\n  } catch (IOException &e) {\n    ThrowRDE(\"%s\", e.what());\n  }\n  return RawImage(nullptr);\n}\n\nvoid RawDecoder::decodeMetaData(const CameraMetaData* meta) {\n  try {\n    decodeMetaDataInternal(meta);\n  } catch (TiffParserException &e) {\n    ThrowRDE(\"%s\", e.what());\n  } catch (FileIOException &e) {\n    ThrowRDE(\"%s\", e.what());\n  } catch (IOException &e) {\n    ThrowRDE(\"%s\", e.what());\n  }\n}\n\nvoid RawDecoder::checkSupport(const CameraMetaData* meta) {\n  try {\n    checkSupportInternal(meta);\n  } catch (TiffParserException &e) {\n    ThrowRDE(\"%s\", e.what());\n  } catch (FileIOException &e) {\n    ThrowRDE(\"%s\", e.what());\n  } catch (IOException &e) {\n    ThrowRDE(\"%s\", e.what());\n  }\n}\n\nvoid RawDecoder::startTasks( uint32 tasks )\n{\n  uint32 threads;\n  threads = min(tasks, getThreadCount());\n  int ctask = 0;\n  vector<RawDecoderThread> t(threads, RawDecoderThread(this));\n\n  \/\/ We don't need a thread\n  if (threads == 1) {\n    while ((uint32)ctask < tasks) {\n      t[0].taskNo = ctask++;\n      RawDecoderDecodeThread(&t[0]);\n    }\n    return;\n  }\n\n#ifdef HAVE_PTHREAD\n  pthread_attr_t attr;\n\n  \/* Initialize and set thread detached attribute *\/\n  pthread_attr_init(&attr);\n  pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_JOINABLE);\n\n  \/* TODO: Create a way to re-use threads *\/\n  void *status;\n  while ((uint32)ctask < tasks) {\n    for (uint32 i = 0; i < threads && (uint32)ctask < tasks; i++) {\n      t[i].taskNo = ctask++;\n      pthread_create(&t[i].threadid, &attr, RawDecoderDecodeThread, &t[i]);\n    }\n    for (uint32 i = 0; i < threads; i++) {\n      pthread_join(t[i].threadid, &status);\n    }\n  }\n\n  if (mRaw->errors.size() >= tasks)\n    ThrowRDE(\"All threads reported errors. Cannot load image.\");\n\n#else\n  ThrowRDE(\"Unreachable\");\n#endif\n}\n\n} \/\/ namespace RawSpeed\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 \"pluginview.h\"\n#include \"pluginmanager.h\"\n#include \"pluginspec.h\"\n#include \"plugincollection.h\"\n#include \"ui_pluginview.h\"\n\n#include <QDir>\n#include <QHeaderView>\n#include <QTreeWidgetItem>\n#include <QPalette>\n\n#include <QDebug>\n\n\/*!\n    \\class ExtensionSystem::PluginView\n    \\brief Widget that shows a list of all plugins and their state.\n\n    This can be embedded e.g. in a dialog in the application that\n    uses the plugin manager.\n    The class also provides notifications for interactions with the list.\n\n    \\sa ExtensionSystem::PluginDetailsView\n    \\sa ExtensionSystem::PluginErrorView\n*\/\n\n\/*!\n    \\fn void PluginView::currentPluginChanged(ExtensionSystem::PluginSpec *spec)\n    The current selection in the plugin list has changed to the\n    plugin corresponding to \\a spec.\n*\/\n\n\/*!\n    \\fn void PluginView::pluginActivated(ExtensionSystem::PluginSpec *spec)\n    The plugin list entry corresponding to \\a spec has been activated,\n    e.g. by a double-click.\n*\/\n\nusing namespace ExtensionSystem;\n\nQ_DECLARE_METATYPE(ExtensionSystem::PluginSpec*)\nQ_DECLARE_METATYPE(ExtensionSystem::PluginCollection*)\n\n\/*!\n    \\fn PluginView::PluginView(PluginManager *manager, QWidget *parent)\n    Constructs a PluginView that gets the list of plugins from the\n    given plugin \\a manager with a given \\a parent widget.\n*\/\nPluginView::PluginView(QWidget *parent)\n    : QWidget(parent),\n      m_ui(new Internal::Ui::PluginView),\n      m_allowCheckStateUpdate(true),\n      C_LOAD(1)\n{\n    m_ui->setupUi(this);\n    QHeaderView *header = m_ui->categoryWidget->header();\n    header->setResizeMode(0, QHeaderView::ResizeToContents);\n    header->setResizeMode(2, QHeaderView::ResizeToContents);\n\n    m_okIcon = QIcon(QLatin1String(\":\/extensionsystem\/images\/ok.png\"));\n    m_errorIcon = QIcon(QLatin1String(\":\/extensionsystem\/images\/error.png\"));\n    m_notLoadedIcon = QIcon(QLatin1String(\":\/extensionsystem\/images\/notloaded.png\"));\n\n    m_ui->categoryWidget->setColumnWidth(C_LOAD, 40);\n\n    \/\/ cannot disable these\n    m_whitelist << QString::fromLatin1(\"Core\") << QString::fromLatin1(\"Locator\")\n                << QString::fromLatin1(\"Find\") << QString::fromLatin1(\"TextEditor\");\n\n    connect(PluginManager::instance(), SIGNAL(pluginsChanged()), this, SLOT(updateList()));\n    connect(m_ui->categoryWidget, SIGNAL(currentItemChanged(QTreeWidgetItem*,QTreeWidgetItem*)),\n            this, SLOT(selectPlugin(QTreeWidgetItem*)));\n    connect(m_ui->categoryWidget, SIGNAL(itemActivated(QTreeWidgetItem*,int)),\n            this, SLOT(activatePlugin(QTreeWidgetItem*)));\n\n    updateList();\n}\n\n\/*!\n    \\fn PluginView::~PluginView()\n    \\internal\n*\/\nPluginView::~PluginView()\n{\n    delete m_ui;\n}\n\n\/*!\n    \\fn PluginSpec *PluginView::currentPlugin() const\n    Returns the current selection in the list of plugins.\n*\/\nPluginSpec *PluginView::currentPlugin() const\n{\n    if (!m_ui->categoryWidget->currentItem())\n        return 0;\n    if (!m_ui->categoryWidget->currentItem()->data(0, Qt::UserRole).isNull())\n        return m_ui->categoryWidget->currentItem()->data(0, Qt::UserRole).value<PluginSpec *>();\n    return 0;\n}\n\nvoid PluginView::updateList()\n{\n    connect(m_ui->categoryWidget, SIGNAL(itemChanged(QTreeWidgetItem*,int)),\n            this, SLOT(updatePluginSettings(QTreeWidgetItem*,int)));\n\n    PluginCollection *defaultCollection = 0;\n    foreach (PluginCollection *collection, PluginManager::pluginCollections()) {\n        if (collection->name().isEmpty()) {\n            defaultCollection = collection;\n            continue;\n        }\n        \/\/ State, name, load, version, vendor.\n        QTreeWidgetItem *collectionItem = new QTreeWidgetItem(QStringList()\n            << collection->name()\n            << QString()    \/\/ state\n            << QString()    \/\/ load\n            << QString()    \/\/ version\n            << QString());  \/\/ vendor\n        m_items.append(collectionItem);\n\n        Qt::CheckState groupState = Qt::Unchecked;\n        int state = parsePluginSpecs(collectionItem, groupState, collection->plugins());\n\n        collectionItem->setIcon(0, iconForState(state));\n        collectionItem->setData(C_LOAD, Qt::CheckStateRole, QVariant(groupState));\n        collectionItem->setToolTip(C_LOAD, tr(\"Load on Startup\"));\n        collectionItem->setData(0, Qt::UserRole, qVariantFromValue(collection));\n    }\n\n    \/\/ add all non-categorized plugins into utilities. could also be added as root items\n    \/\/ but that makes the tree ugly.\n    QTreeWidgetItem *defaultCollectionItem = new QTreeWidgetItem(QStringList()\n        << QString(tr(\"Utilities\"))\n        << QString()\n        << QString()\n        << QString()\n        << QString());\n\n    m_items.append(defaultCollectionItem);\n    Qt::CheckState groupState = Qt::Unchecked;\n    int state = parsePluginSpecs(defaultCollectionItem, groupState, defaultCollection ? defaultCollection->plugins() : QList<PluginSpec *>());\n\n    defaultCollectionItem->setIcon(0, iconForState(state));\n    defaultCollectionItem->setData(C_LOAD, Qt::CheckStateRole, QVariant(groupState));\n    defaultCollectionItem->setToolTip(C_LOAD, tr(\"Load on Startup\"));\n    defaultCollectionItem->setData(0, Qt::UserRole, qVariantFromValue(defaultCollection));\n\n    updatePluginDependencies();\n\n    m_ui->categoryWidget->clear();\n    if (!m_items.isEmpty()) {\n        m_ui->categoryWidget->addTopLevelItems(m_items);\n        m_ui->categoryWidget->expandAll();\n    }\n\n    m_ui->categoryWidget->sortItems(0, Qt::AscendingOrder);\n    if (m_ui->categoryWidget->topLevelItemCount())\n        m_ui->categoryWidget->setCurrentItem(m_ui->categoryWidget->topLevelItem(0));\n}\n\nint PluginView::parsePluginSpecs(QTreeWidgetItem *parentItem, Qt::CheckState &groupState, QList<PluginSpec*> plugins)\n{\n    int ret = 0;\n    int checkedCount = 0;\n\n    for (int i = 0; i < plugins.length(); ++i) {\n        PluginSpec *spec = plugins[i];\n        if (spec->hasError())\n            ret |= ParsedWithErrors;\n\n        QTreeWidgetItem *pluginItem = new QTreeWidgetItem(QStringList()\n            << spec->name()\n            << QString()    \/\/ load on startup\n            << QString::fromLatin1(\"%1 (%2)\").arg(spec->version(), spec->compatVersion())\n            << spec->vendor());\n\n        pluginItem->setToolTip(0, QDir::toNativeSeparators(spec->filePath()));\n        bool ok = !spec->hasError();\n        QIcon icon = ok ? m_okIcon : m_errorIcon;\n        if (ok && (spec->state() != PluginSpec::Running))\n            icon = m_notLoadedIcon;\n\n        pluginItem->setIcon(0, icon);\n        pluginItem->setData(0, Qt::UserRole, qVariantFromValue(spec));\n\n        Qt::CheckState state = Qt::Unchecked;\n        if (spec->isEnabledInSettings()) {\n            state = Qt::Checked;\n            ++checkedCount;\n        }\n\n        if (!m_whitelist.contains(spec->name())) {\n            pluginItem->setData(C_LOAD, Qt::CheckStateRole, state);\n        } else {\n            pluginItem->setData(C_LOAD, Qt::CheckStateRole, Qt::Checked);\n            pluginItem->setFlags(Qt::ItemIsSelectable);\n        }\n\n        pluginItem->setToolTip(C_LOAD, tr(\"Load on Startup\"));\n\n        m_specToItem.insert(spec, pluginItem);\n\n        if (parentItem)\n            parentItem->addChild(pluginItem);\n        else\n            m_items.append(pluginItem);\n\n    }\n\n    if (checkedCount == plugins.length()) {\n        groupState = Qt::Checked;\n        ret |= ParsedAll;\n    } else if (checkedCount == 0) {\n        groupState = Qt::Unchecked;\n        ret |= ParsedNone;\n    } else {\n        groupState = Qt::PartiallyChecked;\n        ret = ret | ParsedPartial;\n    }\n    return ret;\n}\n\nQIcon PluginView::iconForState(int state)\n{\n    if (state & ParsedWithErrors)\n        return m_errorIcon;\n\n    if (state & ParsedNone || state & ParsedPartial)\n        return m_notLoadedIcon;\n\n    return m_okIcon;\n}\n\nvoid PluginView::selectPlugin(QTreeWidgetItem *current)\n{\n    if (!current)\n        emit currentPluginChanged(0);\n    else if (current->data(0, Qt::UserRole).canConvert<PluginSpec*>())\n        emit currentPluginChanged(current->data(0, Qt::UserRole).value<PluginSpec *>());\n    else\n        emit currentPluginChanged(0);\n\n}\n\nvoid PluginView::activatePlugin(QTreeWidgetItem *item)\n{\n    if (item->data(0, Qt::UserRole).canConvert<PluginSpec*>()) {\n        emit pluginActivated(item->data(0, Qt::UserRole).value<PluginSpec *>());\n    } else\n        emit pluginActivated(0);\n}\n\nvoid PluginView::updatePluginSettings(QTreeWidgetItem *item, int column)\n{\n    if (!m_allowCheckStateUpdate)\n        return;\n\n    m_allowCheckStateUpdate = false;\n\n    bool loadOnStartup = item->data(C_LOAD, Qt::CheckStateRole).toBool();\n\n    if (item->data(0, Qt::UserRole).canConvert<PluginSpec*>()) {\n        PluginSpec *spec = item->data(0, Qt::UserRole).value<PluginSpec *>();\n\n        if (column == C_LOAD) {\n\n            spec->setEnabled(loadOnStartup);\n            updatePluginDependencies();\n\n            if (item->parent()) {\n                PluginCollection *collection = item->parent()->data(0, Qt::UserRole).value<PluginCollection *>();\n                Qt::CheckState state = Qt::PartiallyChecked;\n                int loadCount = 0;\n                for (int i = 0; i < collection->plugins().length(); ++i) {\n                    if (collection->plugins().at(i)->isEnabledInSettings())\n                        ++loadCount;\n                }\n                if (loadCount == collection->plugins().length())\n                    state = Qt::Checked;\n                else if (loadCount == 0)\n                    state = Qt::Unchecked;\n\n                item->parent()->setData(C_LOAD, Qt::CheckStateRole, state);\n            }\n\n            emit pluginSettingsChanged(spec);\n        }\n\n    } else {\n        PluginCollection *collection = item->data(0, Qt::UserRole).value<PluginCollection *>();\n        for (int i = 0; i < collection->plugins().length(); ++i) {\n            PluginSpec *spec = collection->plugins().at(i);\n            QTreeWidgetItem *child = m_specToItem.value(spec);\n\n            if (!m_whitelist.contains(spec->name())) {\n                spec->setEnabled(loadOnStartup);\n                Qt::CheckState state = (loadOnStartup ? Qt::Checked : Qt::Unchecked);\n                child->setData(C_LOAD, Qt::CheckStateRole, state);\n            } else {\n                child->setData(C_LOAD, Qt::CheckStateRole, Qt::Checked);\n                child->setFlags(Qt::ItemIsSelectable);\n            }\n        }\n        updatePluginDependencies();\n        emit pluginSettingsChanged(collection->plugins().first());\n    }\n\n    m_allowCheckStateUpdate = true;\n}\n\nvoid PluginView::updatePluginDependencies()\n{\n    foreach (PluginSpec *spec, PluginManager::loadQueue()) {\n        bool disableIndirectly = false;\n        if (m_whitelist.contains(spec->name()))\n            continue;\n\n        QHashIterator<PluginDependency, PluginSpec *> it(spec->dependencySpecs());\n        while (it.hasNext()) {\n            it.next();\n            if (it.key().type == PluginDependency::Optional)\n                continue;\n            PluginSpec *depSpec = it.value();\n            if (!depSpec->isEnabledInSettings() || depSpec->isDisabledIndirectly()) {\n                disableIndirectly = true;\n                break;\n            }\n        }\n        QTreeWidgetItem *childItem = m_specToItem.value(spec);\n        childItem->setDisabled(disableIndirectly);\n\n        if (disableIndirectly == spec->isDisabledIndirectly())\n            continue;\n        spec->setDisabledIndirectly(disableIndirectly);\n\n        if (childItem->parent() && !childItem->parent()->isExpanded())\n            childItem->parent()->setExpanded(true);\n    }\n}\n<commit_msg>Fix crash if plugins list is empty<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 \"pluginview.h\"\n#include \"pluginmanager.h\"\n#include \"pluginspec.h\"\n#include \"plugincollection.h\"\n#include \"ui_pluginview.h\"\n\n#include <QDir>\n#include <QHeaderView>\n#include <QTreeWidgetItem>\n#include <QPalette>\n\n#include <QDebug>\n\n\/*!\n    \\class ExtensionSystem::PluginView\n    \\brief Widget that shows a list of all plugins and their state.\n\n    This can be embedded e.g. in a dialog in the application that\n    uses the plugin manager.\n    The class also provides notifications for interactions with the list.\n\n    \\sa ExtensionSystem::PluginDetailsView\n    \\sa ExtensionSystem::PluginErrorView\n*\/\n\n\/*!\n    \\fn void PluginView::currentPluginChanged(ExtensionSystem::PluginSpec *spec)\n    The current selection in the plugin list has changed to the\n    plugin corresponding to \\a spec.\n*\/\n\n\/*!\n    \\fn void PluginView::pluginActivated(ExtensionSystem::PluginSpec *spec)\n    The plugin list entry corresponding to \\a spec has been activated,\n    e.g. by a double-click.\n*\/\n\nusing namespace ExtensionSystem;\n\nQ_DECLARE_METATYPE(ExtensionSystem::PluginSpec*)\nQ_DECLARE_METATYPE(ExtensionSystem::PluginCollection*)\n\n\/*!\n    \\fn PluginView::PluginView(PluginManager *manager, QWidget *parent)\n    Constructs a PluginView that gets the list of plugins from the\n    given plugin \\a manager with a given \\a parent widget.\n*\/\nPluginView::PluginView(QWidget *parent)\n    : QWidget(parent),\n      m_ui(new Internal::Ui::PluginView),\n      m_allowCheckStateUpdate(true),\n      C_LOAD(1)\n{\n    m_ui->setupUi(this);\n    QHeaderView *header = m_ui->categoryWidget->header();\n    header->setResizeMode(0, QHeaderView::ResizeToContents);\n    header->setResizeMode(2, QHeaderView::ResizeToContents);\n\n    m_okIcon = QIcon(QLatin1String(\":\/extensionsystem\/images\/ok.png\"));\n    m_errorIcon = QIcon(QLatin1String(\":\/extensionsystem\/images\/error.png\"));\n    m_notLoadedIcon = QIcon(QLatin1String(\":\/extensionsystem\/images\/notloaded.png\"));\n\n    m_ui->categoryWidget->setColumnWidth(C_LOAD, 40);\n\n    \/\/ cannot disable these\n    m_whitelist << QString::fromLatin1(\"Core\") << QString::fromLatin1(\"Locator\")\n                << QString::fromLatin1(\"Find\") << QString::fromLatin1(\"TextEditor\");\n\n    connect(PluginManager::instance(), SIGNAL(pluginsChanged()), this, SLOT(updateList()));\n    connect(m_ui->categoryWidget, SIGNAL(currentItemChanged(QTreeWidgetItem*,QTreeWidgetItem*)),\n            this, SLOT(selectPlugin(QTreeWidgetItem*)));\n    connect(m_ui->categoryWidget, SIGNAL(itemActivated(QTreeWidgetItem*,int)),\n            this, SLOT(activatePlugin(QTreeWidgetItem*)));\n\n    updateList();\n}\n\n\/*!\n    \\fn PluginView::~PluginView()\n    \\internal\n*\/\nPluginView::~PluginView()\n{\n    delete m_ui;\n}\n\n\/*!\n    \\fn PluginSpec *PluginView::currentPlugin() const\n    Returns the current selection in the list of plugins.\n*\/\nPluginSpec *PluginView::currentPlugin() const\n{\n    if (!m_ui->categoryWidget->currentItem())\n        return 0;\n    if (!m_ui->categoryWidget->currentItem()->data(0, Qt::UserRole).isNull())\n        return m_ui->categoryWidget->currentItem()->data(0, Qt::UserRole).value<PluginSpec *>();\n    return 0;\n}\n\nvoid PluginView::updateList()\n{\n    connect(m_ui->categoryWidget, SIGNAL(itemChanged(QTreeWidgetItem*,int)),\n            this, SLOT(updatePluginSettings(QTreeWidgetItem*,int)));\n\n    PluginCollection *defaultCollection = 0;\n    foreach (PluginCollection *collection, PluginManager::pluginCollections()) {\n        if (collection->name().isEmpty()) {\n            defaultCollection = collection;\n            continue;\n        }\n        \/\/ State, name, load, version, vendor.\n        QTreeWidgetItem *collectionItem = new QTreeWidgetItem(QStringList()\n            << collection->name()\n            << QString()    \/\/ state\n            << QString()    \/\/ load\n            << QString()    \/\/ version\n            << QString());  \/\/ vendor\n        m_items.append(collectionItem);\n\n        Qt::CheckState groupState = Qt::Unchecked;\n        int state = parsePluginSpecs(collectionItem, groupState, collection->plugins());\n\n        collectionItem->setIcon(0, iconForState(state));\n        collectionItem->setData(C_LOAD, Qt::CheckStateRole, QVariant(groupState));\n        collectionItem->setToolTip(C_LOAD, tr(\"Load on Startup\"));\n        collectionItem->setData(0, Qt::UserRole, qVariantFromValue(collection));\n    }\n\n    \/\/ add all non-categorized plugins into utilities. could also be added as root items\n    \/\/ but that makes the tree ugly.\n    QTreeWidgetItem *defaultCollectionItem = new QTreeWidgetItem(QStringList()\n        << QString(tr(\"Utilities\"))\n        << QString()\n        << QString()\n        << QString()\n        << QString());\n\n    m_items.append(defaultCollectionItem);\n    Qt::CheckState groupState = Qt::Unchecked;\n    int state = parsePluginSpecs(defaultCollectionItem, groupState, defaultCollection ? defaultCollection->plugins() : QList<PluginSpec *>());\n\n    defaultCollectionItem->setIcon(0, iconForState(state));\n    defaultCollectionItem->setData(C_LOAD, Qt::CheckStateRole, QVariant(groupState));\n    defaultCollectionItem->setToolTip(C_LOAD, tr(\"Load on Startup\"));\n    defaultCollectionItem->setData(0, Qt::UserRole, qVariantFromValue(defaultCollection));\n\n    updatePluginDependencies();\n\n    m_ui->categoryWidget->clear();\n    if (!m_items.isEmpty()) {\n        m_ui->categoryWidget->addTopLevelItems(m_items);\n        m_ui->categoryWidget->expandAll();\n    }\n\n    m_ui->categoryWidget->sortItems(0, Qt::AscendingOrder);\n    if (m_ui->categoryWidget->topLevelItemCount())\n        m_ui->categoryWidget->setCurrentItem(m_ui->categoryWidget->topLevelItem(0));\n}\n\nint PluginView::parsePluginSpecs(QTreeWidgetItem *parentItem, Qt::CheckState &groupState, QList<PluginSpec*> plugins)\n{\n    int ret = 0;\n    int checkedCount = 0;\n\n    for (int i = 0; i < plugins.length(); ++i) {\n        PluginSpec *spec = plugins[i];\n        if (spec->hasError())\n            ret |= ParsedWithErrors;\n\n        QTreeWidgetItem *pluginItem = new QTreeWidgetItem(QStringList()\n            << spec->name()\n            << QString()    \/\/ load on startup\n            << QString::fromLatin1(\"%1 (%2)\").arg(spec->version(), spec->compatVersion())\n            << spec->vendor());\n\n        pluginItem->setToolTip(0, QDir::toNativeSeparators(spec->filePath()));\n        bool ok = !spec->hasError();\n        QIcon icon = ok ? m_okIcon : m_errorIcon;\n        if (ok && (spec->state() != PluginSpec::Running))\n            icon = m_notLoadedIcon;\n\n        pluginItem->setIcon(0, icon);\n        pluginItem->setData(0, Qt::UserRole, qVariantFromValue(spec));\n\n        Qt::CheckState state = Qt::Unchecked;\n        if (spec->isEnabledInSettings()) {\n            state = Qt::Checked;\n            ++checkedCount;\n        }\n\n        if (!m_whitelist.contains(spec->name())) {\n            pluginItem->setData(C_LOAD, Qt::CheckStateRole, state);\n        } else {\n            pluginItem->setData(C_LOAD, Qt::CheckStateRole, Qt::Checked);\n            pluginItem->setFlags(Qt::ItemIsSelectable);\n        }\n\n        pluginItem->setToolTip(C_LOAD, tr(\"Load on Startup\"));\n\n        m_specToItem.insert(spec, pluginItem);\n\n        if (parentItem)\n            parentItem->addChild(pluginItem);\n        else\n            m_items.append(pluginItem);\n\n    }\n\n    if (checkedCount == plugins.length()) {\n        groupState = Qt::Checked;\n        ret |= ParsedAll;\n    } else if (checkedCount == 0) {\n        groupState = Qt::Unchecked;\n        ret |= ParsedNone;\n    } else {\n        groupState = Qt::PartiallyChecked;\n        ret = ret | ParsedPartial;\n    }\n    return ret;\n}\n\nQIcon PluginView::iconForState(int state)\n{\n    if (state & ParsedWithErrors)\n        return m_errorIcon;\n\n    if (state & ParsedNone || state & ParsedPartial)\n        return m_notLoadedIcon;\n\n    return m_okIcon;\n}\n\nvoid PluginView::selectPlugin(QTreeWidgetItem *current)\n{\n    if (!current)\n        emit currentPluginChanged(0);\n    else if (current->data(0, Qt::UserRole).canConvert<PluginSpec*>())\n        emit currentPluginChanged(current->data(0, Qt::UserRole).value<PluginSpec *>());\n    else\n        emit currentPluginChanged(0);\n\n}\n\nvoid PluginView::activatePlugin(QTreeWidgetItem *item)\n{\n    if (item->data(0, Qt::UserRole).canConvert<PluginSpec*>()) {\n        emit pluginActivated(item->data(0, Qt::UserRole).value<PluginSpec *>());\n    } else\n        emit pluginActivated(0);\n}\n\nvoid PluginView::updatePluginSettings(QTreeWidgetItem *item, int column)\n{\n    if (!m_allowCheckStateUpdate)\n        return;\n\n    m_allowCheckStateUpdate = false;\n\n    bool loadOnStartup = item->data(C_LOAD, Qt::CheckStateRole).toBool();\n\n    if (item->data(0, Qt::UserRole).canConvert<PluginSpec*>()) {\n        PluginSpec *spec = item->data(0, Qt::UserRole).value<PluginSpec *>();\n\n        if (column == C_LOAD) {\n\n            spec->setEnabled(loadOnStartup);\n            updatePluginDependencies();\n\n            if (item->parent()) {\n                PluginCollection *collection = item->parent()->data(0, Qt::UserRole).value<PluginCollection *>();\n                Qt::CheckState state = Qt::PartiallyChecked;\n                int loadCount = 0;\n                for (int i = 0; i < collection->plugins().length(); ++i) {\n                    if (collection->plugins().at(i)->isEnabledInSettings())\n                        ++loadCount;\n                }\n                if (loadCount == collection->plugins().length())\n                    state = Qt::Checked;\n                else if (loadCount == 0)\n                    state = Qt::Unchecked;\n\n                item->parent()->setData(C_LOAD, Qt::CheckStateRole, state);\n            }\n\n            emit pluginSettingsChanged(spec);\n        }\n\n    } else {\n        PluginCollection *collection = item->data(0, Qt::UserRole).value<PluginCollection *>();\n        for (int i = 0; i < collection->plugins().length(); ++i) {\n            PluginSpec *spec = collection->plugins().at(i);\n            QTreeWidgetItem *child = m_specToItem.value(spec);\n\n            if (!m_whitelist.contains(spec->name())) {\n                spec->setEnabled(loadOnStartup);\n                Qt::CheckState state = (loadOnStartup ? Qt::Checked : Qt::Unchecked);\n                child->setData(C_LOAD, Qt::CheckStateRole, state);\n            } else {\n                child->setData(C_LOAD, Qt::CheckStateRole, Qt::Checked);\n                child->setFlags(Qt::ItemIsSelectable);\n            }\n        }\n        updatePluginDependencies();\n        if (!collection->plugins().isEmpty())\n            emit pluginSettingsChanged(collection->plugins().first());\n    }\n\n    m_allowCheckStateUpdate = true;\n}\n\nvoid PluginView::updatePluginDependencies()\n{\n    foreach (PluginSpec *spec, PluginManager::loadQueue()) {\n        bool disableIndirectly = false;\n        if (m_whitelist.contains(spec->name()))\n            continue;\n\n        QHashIterator<PluginDependency, PluginSpec *> it(spec->dependencySpecs());\n        while (it.hasNext()) {\n            it.next();\n            if (it.key().type == PluginDependency::Optional)\n                continue;\n            PluginSpec *depSpec = it.value();\n            if (!depSpec->isEnabledInSettings() || depSpec->isDisabledIndirectly()) {\n                disableIndirectly = true;\n                break;\n            }\n        }\n        QTreeWidgetItem *childItem = m_specToItem.value(spec);\n        childItem->setDisabled(disableIndirectly);\n\n        if (disableIndirectly == spec->isDisabledIndirectly())\n            continue;\n        spec->setDisabledIndirectly(disableIndirectly);\n\n        if (childItem->parent() && !childItem->parent()->isExpanded())\n            childItem->parent()->setExpanded(true);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: desktopterminationobserver.cxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 01:27: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_unotools.hxx\"\n\n#ifndef UNOTOOLS_INC_UNOTOOLS_DESKTOPTERMINATIONOBSERVER_HXX\n#include <unotools\/desktopterminationobserver.hxx>\n#endif\n\n\/** === begin UNO includes === **\/\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\/** === end UNO includes === **\/\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#include <list>\n\n\/\/........................................................................\nnamespace utl\n{\n\/\/........................................................................\n\n    using namespace ::com::sun::star::uno;\n    using namespace ::com::sun::star::lang;\n    using namespace ::com::sun::star::frame;\n\n    namespace\n    {\n        \/\/................................................................\n        typedef ::std::list< ITerminationListener* > Listeners;\n\n        struct ListenerAdminData\n        {\n            Listeners   aListeners;\n            bool        bAlreadyTerminated;\n            bool        bCreatedAdapter;\n\n            ListenerAdminData() : bAlreadyTerminated( false ), bCreatedAdapter( false ) { }\n        };\n\n        \/\/................................................................\n        ListenerAdminData& getListenerAdminData()\n        {\n            static ListenerAdminData s_aData;\n            return s_aData;\n        }\n\n        \/\/================================================================\n        \/\/= OObserverImpl\n        \/\/================================================================\n        class OObserverImpl : public ::cppu::WeakImplHelper1< XTerminateListener >\n        {\n        public:\n            static void ensureObservation();\n\n        protected:\n            OObserverImpl();\n            ~OObserverImpl();\n\n        private:\n            \/\/ XTerminateListener\n            virtual void SAL_CALL queryTermination( const EventObject& Event ) throw (TerminationVetoException, RuntimeException);\n            virtual void SAL_CALL notifyTermination( const EventObject& Event ) throw (RuntimeException);\n\n            \/\/ XEventListener\n            virtual void SAL_CALL disposing( const ::com::sun::star::lang::EventObject& Source ) throw (::com::sun::star::uno::RuntimeException);\n        };\n\n        \/\/--------------------------------------------------------------------\n        OObserverImpl::OObserverImpl()\n        {\n        }\n\n        \/\/--------------------------------------------------------------------\n        OObserverImpl::~OObserverImpl()\n        {\n        }\n\n        \/\/--------------------------------------------------------------------\n        void OObserverImpl::ensureObservation()\n        {\n            {\n                if ( getListenerAdminData().bCreatedAdapter )\n                    return;\n                ::osl::MutexGuard aGuard( ::osl::Mutex::getGlobalMutex() );\n                if ( getListenerAdminData().bCreatedAdapter )\n                    return;\n\n                getListenerAdminData().bCreatedAdapter = true;\n            }\n\n            try\n            {\n                Reference< XDesktop > xDesktop;\n                xDesktop = xDesktop.query( ::comphelper::getProcessServiceFactory()->createInstance( ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.frame.Desktop\" ) ) ) );\n                OSL_ENSURE( xDesktop.is(), \"OObserverImpl::ensureObservation: could not ensureObservation the desktop!\" );\n                if ( xDesktop.is() )\n                    xDesktop->addTerminateListener( new OObserverImpl );\n            }\n            catch( const Exception& )\n            {\n                OSL_ENSURE( sal_False, \"OObserverImpl::ensureObservation: caught an exception!\" );\n            }\n        }\n\n        \/\/--------------------------------------------------------------------\n        void SAL_CALL OObserverImpl::queryTermination( const EventObject& \/*Event*\/ ) throw (TerminationVetoException, RuntimeException)\n        {\n            Listeners aToNotify;\n            {\n                ::osl::MutexGuard aGuard( ::osl::Mutex::getGlobalMutex() );\n                aToNotify = getListenerAdminData().aListeners;\n            }\n\n            for ( Listeners::const_iterator listener = aToNotify.begin();\n                  listener != aToNotify.end();\n                  ++listener\n                )\n            {\n                if ( !(*listener)->queryTermination() )\n                    throw TerminationVetoException();\n            }\n        }\n\n        \/\/--------------------------------------------------------------------\n        void SAL_CALL OObserverImpl::notifyTermination( const EventObject& \/*Event*\/ ) throw (RuntimeException)\n        {\n            \/\/ get the listeners\n            Listeners aToNotify;\n            {\n                ::osl::MutexGuard aGuard( ::osl::Mutex::getGlobalMutex() );\n                OSL_ENSURE( !getListenerAdminData().bAlreadyTerminated, \"OObserverImpl::notifyTermination: terminated twice?\" );\n                aToNotify = getListenerAdminData().aListeners;\n                getListenerAdminData().bAlreadyTerminated = true;\n            }\n\n            \/\/ notify the listeners\n            for ( Listeners::const_iterator listener = aToNotify.begin();\n                  listener != aToNotify.end();\n                  ++listener\n                )\n            {\n                (*listener)->notifyTermination();\n            }\n\n            \/\/ clear the listener container\n            {\n                ::osl::MutexGuard aGuard( ::osl::Mutex::getGlobalMutex() );\n                getListenerAdminData().aListeners.clear();\n            }\n        }\n\n        \/\/--------------------------------------------------------------------\n        void SAL_CALL OObserverImpl::disposing( const EventObject& \/*Event*\/ ) throw (RuntimeException)\n        {\n#if OSL_DEBUG_LEVEL > 0\n            ::osl::MutexGuard aGuard( ::osl::Mutex::getGlobalMutex() );\n            OSL_ENSURE( getListenerAdminData().bAlreadyTerminated, \"OObserverImpl::disposing: disposing without terminated?\" );\n#endif\n            \/\/ not interested in\n        }\n    }\n\n    \/\/====================================================================\n    \/\/= DesktopTerminationObserver\n    \/\/====================================================================\n    \/\/--------------------------------------------------------------------\n    void DesktopTerminationObserver::registerTerminationListener( ITerminationListener* _pListener )\n    {\n        if ( !_pListener )\n            return;\n\n        {\n            ::osl::MutexGuard aGuard( ::osl::Mutex::getGlobalMutex() );\n            if ( getListenerAdminData().bAlreadyTerminated )\n            {\n                _pListener->notifyTermination();\n                return;\n            }\n\n            getListenerAdminData().aListeners.push_back( _pListener );\n        }\n\n        OObserverImpl::ensureObservation();\n    }\n\n    \/\/--------------------------------------------------------------------\n    void DesktopTerminationObserver::revokeTerminationListener( ITerminationListener* _pListener )\n    {\n        ::osl::MutexGuard aGuard( ::osl::Mutex::getGlobalMutex() );\n        if ( getListenerAdminData().bAlreadyTerminated )\n        {\n            _pListener->notifyTermination();\n            return;\n        }\n\n        Listeners& rListeners = getListenerAdminData().aListeners;\n        for ( Listeners::iterator lookup = rListeners.begin();\n              lookup != rListeners.end();\n              ++lookup\n              )\n        {\n            if ( *lookup == _pListener )\n            {\n                rListeners.erase( lookup );\n                break;\n            }\n        }\n    }\n\n\/\/........................................................................\n} \/\/ namespace utl\n\/\/........................................................................\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.5.84); FILE MERGED 2008\/04\/01 16:03:33 thb 1.5.84.3: #i85898# Stripping all external header guards 2008\/04\/01 12:59:54 thb 1.5.84.2: #i85898# Stripping all external header guards 2008\/03\/31 13:03:40 rt 1.5.84.1: #i87441# Change license header to LPGL v3.<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: desktopterminationobserver.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_unotools.hxx\"\n#include <unotools\/desktopterminationobserver.hxx>\n\n\/** === begin UNO includes === **\/\n#include <com\/sun\/star\/frame\/XTerminateListener.hpp>\n#include <com\/sun\/star\/frame\/XDesktop.hpp>\n\/** === end UNO includes === **\/\n#include <cppuhelper\/implbase1.hxx>\n#include <comphelper\/processfactory.hxx>\n\n#include <list>\n\n\/\/........................................................................\nnamespace utl\n{\n\/\/........................................................................\n\n    using namespace ::com::sun::star::uno;\n    using namespace ::com::sun::star::lang;\n    using namespace ::com::sun::star::frame;\n\n    namespace\n    {\n        \/\/................................................................\n        typedef ::std::list< ITerminationListener* > Listeners;\n\n        struct ListenerAdminData\n        {\n            Listeners   aListeners;\n            bool        bAlreadyTerminated;\n            bool        bCreatedAdapter;\n\n            ListenerAdminData() : bAlreadyTerminated( false ), bCreatedAdapter( false ) { }\n        };\n\n        \/\/................................................................\n        ListenerAdminData& getListenerAdminData()\n        {\n            static ListenerAdminData s_aData;\n            return s_aData;\n        }\n\n        \/\/================================================================\n        \/\/= OObserverImpl\n        \/\/================================================================\n        class OObserverImpl : public ::cppu::WeakImplHelper1< XTerminateListener >\n        {\n        public:\n            static void ensureObservation();\n\n        protected:\n            OObserverImpl();\n            ~OObserverImpl();\n\n        private:\n            \/\/ XTerminateListener\n            virtual void SAL_CALL queryTermination( const EventObject& Event ) throw (TerminationVetoException, RuntimeException);\n            virtual void SAL_CALL notifyTermination( const EventObject& Event ) throw (RuntimeException);\n\n            \/\/ XEventListener\n            virtual void SAL_CALL disposing( const ::com::sun::star::lang::EventObject& Source ) throw (::com::sun::star::uno::RuntimeException);\n        };\n\n        \/\/--------------------------------------------------------------------\n        OObserverImpl::OObserverImpl()\n        {\n        }\n\n        \/\/--------------------------------------------------------------------\n        OObserverImpl::~OObserverImpl()\n        {\n        }\n\n        \/\/--------------------------------------------------------------------\n        void OObserverImpl::ensureObservation()\n        {\n            {\n                if ( getListenerAdminData().bCreatedAdapter )\n                    return;\n                ::osl::MutexGuard aGuard( ::osl::Mutex::getGlobalMutex() );\n                if ( getListenerAdminData().bCreatedAdapter )\n                    return;\n\n                getListenerAdminData().bCreatedAdapter = true;\n            }\n\n            try\n            {\n                Reference< XDesktop > xDesktop;\n                xDesktop = xDesktop.query( ::comphelper::getProcessServiceFactory()->createInstance( ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.frame.Desktop\" ) ) ) );\n                OSL_ENSURE( xDesktop.is(), \"OObserverImpl::ensureObservation: could not ensureObservation the desktop!\" );\n                if ( xDesktop.is() )\n                    xDesktop->addTerminateListener( new OObserverImpl );\n            }\n            catch( const Exception& )\n            {\n                OSL_ENSURE( sal_False, \"OObserverImpl::ensureObservation: caught an exception!\" );\n            }\n        }\n\n        \/\/--------------------------------------------------------------------\n        void SAL_CALL OObserverImpl::queryTermination( const EventObject& \/*Event*\/ ) throw (TerminationVetoException, RuntimeException)\n        {\n            Listeners aToNotify;\n            {\n                ::osl::MutexGuard aGuard( ::osl::Mutex::getGlobalMutex() );\n                aToNotify = getListenerAdminData().aListeners;\n            }\n\n            for ( Listeners::const_iterator listener = aToNotify.begin();\n                  listener != aToNotify.end();\n                  ++listener\n                )\n            {\n                if ( !(*listener)->queryTermination() )\n                    throw TerminationVetoException();\n            }\n        }\n\n        \/\/--------------------------------------------------------------------\n        void SAL_CALL OObserverImpl::notifyTermination( const EventObject& \/*Event*\/ ) throw (RuntimeException)\n        {\n            \/\/ get the listeners\n            Listeners aToNotify;\n            {\n                ::osl::MutexGuard aGuard( ::osl::Mutex::getGlobalMutex() );\n                OSL_ENSURE( !getListenerAdminData().bAlreadyTerminated, \"OObserverImpl::notifyTermination: terminated twice?\" );\n                aToNotify = getListenerAdminData().aListeners;\n                getListenerAdminData().bAlreadyTerminated = true;\n            }\n\n            \/\/ notify the listeners\n            for ( Listeners::const_iterator listener = aToNotify.begin();\n                  listener != aToNotify.end();\n                  ++listener\n                )\n            {\n                (*listener)->notifyTermination();\n            }\n\n            \/\/ clear the listener container\n            {\n                ::osl::MutexGuard aGuard( ::osl::Mutex::getGlobalMutex() );\n                getListenerAdminData().aListeners.clear();\n            }\n        }\n\n        \/\/--------------------------------------------------------------------\n        void SAL_CALL OObserverImpl::disposing( const EventObject& \/*Event*\/ ) throw (RuntimeException)\n        {\n#if OSL_DEBUG_LEVEL > 0\n            ::osl::MutexGuard aGuard( ::osl::Mutex::getGlobalMutex() );\n            OSL_ENSURE( getListenerAdminData().bAlreadyTerminated, \"OObserverImpl::disposing: disposing without terminated?\" );\n#endif\n            \/\/ not interested in\n        }\n    }\n\n    \/\/====================================================================\n    \/\/= DesktopTerminationObserver\n    \/\/====================================================================\n    \/\/--------------------------------------------------------------------\n    void DesktopTerminationObserver::registerTerminationListener( ITerminationListener* _pListener )\n    {\n        if ( !_pListener )\n            return;\n\n        {\n            ::osl::MutexGuard aGuard( ::osl::Mutex::getGlobalMutex() );\n            if ( getListenerAdminData().bAlreadyTerminated )\n            {\n                _pListener->notifyTermination();\n                return;\n            }\n\n            getListenerAdminData().aListeners.push_back( _pListener );\n        }\n\n        OObserverImpl::ensureObservation();\n    }\n\n    \/\/--------------------------------------------------------------------\n    void DesktopTerminationObserver::revokeTerminationListener( ITerminationListener* _pListener )\n    {\n        ::osl::MutexGuard aGuard( ::osl::Mutex::getGlobalMutex() );\n        if ( getListenerAdminData().bAlreadyTerminated )\n        {\n            _pListener->notifyTermination();\n            return;\n        }\n\n        Listeners& rListeners = getListenerAdminData().aListeners;\n        for ( Listeners::iterator lookup = rListeners.begin();\n              lookup != rListeners.end();\n              ++lookup\n              )\n        {\n            if ( *lookup == _pListener )\n            {\n                rListeners.erase( lookup );\n                break;\n            }\n        }\n    }\n\n\/\/........................................................................\n} \/\/ namespace utl\n\/\/........................................................................\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  Z80.hpp\n\/\/  Clock Signal\n\/\/\n\/\/  Created by Thomas Harte on 14\/05\/2017.\n\/\/  Copyright 2017 Thomas Harte. All rights reserved.\n\/\/\n\n#ifndef Z80_hpp\n#define Z80_hpp\n\n#include <cassert>\n#include <vector>\n#include <cstdint>\n\n#include \"..\/RegisterSizes.hpp\"\n#include \"..\/..\/ClockReceiver\/ClockReceiver.hpp\"\n\nnamespace CPU {\nnamespace Z80 {\n\n\/*\n\tThe list of registers that can be accessed via @c set_value_of_register and @c set_value_of_register.\n*\/\nenum Register {\n\tProgramCounter,\n\tStackPointer,\n\n\tA,\t\tFlags,\tAF,\n\tB,\t\tC,\t\tBC,\n\tD,\t\tE,\t\tDE,\n\tH,\t\tL,\t\tHL,\n\n\tADash,\t\tFlagsDash,\tAFDash,\n\tBDash,\t\tCDash,\t\tBCDash,\n\tDDash,\t\tEDash,\t\tDEDash,\n\tHDash,\t\tLDash,\t\tHLDash,\n\n\tIXh,\tIXl,\tIX,\n\tIYh,\tIYl,\tIY,\n\tR,\t\tI,\t\tRefresh,\n\n\tIFF1,\tIFF2,\tIM,\n\n\tMemPtr\n};\n\n\/*\n\tFlags as defined on the Z80; can be used to decode the result of getting or setting @c Flags.\n*\/\nenum Flag: uint8_t {\n\tSign\t\t= 0x80,\n\tZero\t\t= 0x40,\n\tBit5\t\t= 0x20,\n\tHalfCarry\t= 0x10,\n\tBit3\t\t= 0x08,\n\tParity\t\t= 0x04,\n\tOverflow\t= 0x04,\n\tSubtract\t= 0x02,\n\tCarry\t\t= 0x01\n};\n\n\/*!\n\tSubclasses will be given the task of performing partial machine cycles, allowing them to provide whatever interface they like\n\tbetween a Z80 and the rest of the system. @c PartialMachineCycle defines the information they will be handed for each unit\n\tof execution.\n*\/\nstruct PartialMachineCycle {\n\tenum Operation {\n\t\tReadOpcode = 0,\n\t\tRead,\n\t\tWrite,\n\t\tInput,\n\t\tOutput,\n\t\tInterrupt,\n\n\t\tRefresh,\n\t\tInternal,\n\t\tBusAcknowledge,\n\n\t\tReadOpcodeWait,\n\t\tReadWait,\n\t\tWriteWait,\n\t\tInputWait,\n\t\tOutputWait,\n\t\tInterruptWait,\n\n\t\tReadOpcodeStart,\n\t\tReadStart,\n\t\tWriteStart,\n\t\tInputStart,\n\t\tOutputStart,\n\t\tInterruptStart,\n\t};\n\t\/\/\/ The operation being carried out by the Z80. See the various getters below for better classification.\n\tconst Operation operation;\n\t\/\/\/ The length of this operation.\n\tconst HalfCycles length;\n\t\/\/\/ The current value of the address bus.\n\tconst uint16_t *const address;\n\t\/\/\/ If the Z80 is outputting to the data bus, a pointer to that value. Otherwise, a pointer to the lcoation where the current data bus value should be placed.\n\tuint8_t *const value;\n\t\/\/\/ @c true if this operation is occurring only because of an external request; @c false otherwise.\n\tconst bool was_requested;\n\n\t\/*!\n\t\t@returns @c true if the processor believes that the bus handler should actually do something with\n\t\tthe content of this PartialMachineCycle; @c false otherwise.\n\t*\/\n\tinline bool expects_action() const {\n\t\treturn operation <= Operation::Interrupt;\n\t}\n\t\/*!\n\t\t@returns @c true if this partial machine cycle completes one of the documented full machine cycles;\n\t\t@c false otherwise.\n\t*\/\n\tinline bool is_terminal() const {\n\t\treturn operation <= Operation::BusAcknowledge;\n\t}\n\t\/*!\n\t\t@returns @c true if this partial machine cycle is a wait cycle; @c false otherwise.\n\t*\/\n\tinline bool is_wait() const {\n\t\treturn operation >= Operation::ReadOpcodeWait && operation <= Operation::InterruptWait;\n\t}\n\n\tPartialMachineCycle(const PartialMachineCycle &rhs) noexcept;\n\tPartialMachineCycle(Operation operation, HalfCycles length, uint16_t *address, uint8_t *value, bool was_requested) noexcept;\n\tPartialMachineCycle() noexcept;\n};\n\n\/*!\n\tA class providing empty implementations of the methods a Z80 uses to access the bus. To wire the Z80 to a bus,\n\tmachines should subclass BusHandler and then declare a realisation of the Z80 template, suplying their bus\n\thandler.\n*\/\nclass BusHandler {\n\tpublic:\n\t\t\/*!\n\t\t\tAnnounces that the Z80 has performed the partial machine cycle defined by @c cycle.\n\n\t\t\t@returns The number of additional HalfCycles that passed in objective time while this Z80 operation was ongoing.\n\t\t\tOn an archetypal machine this will be HalfCycles(0) but some architectures may choose not to clock the Z80\n\t\t\tduring some periods or may impose wait states so predictably that it's more efficient just to add them\n\t\t\tvia this mechanism.\n\t\t*\/\n\t\tHalfCycles perform_machine_cycle(const PartialMachineCycle &cycle) {\n\t\t\treturn HalfCycles(0);\n\t\t}\n\n\t\t\/*!\n\t\t\tAnnounces completion of all the cycles supplied to a .run_for request on the 6502. Intended to allow\n\t\t\tbus handlers to perform any deferred output work.\n\t\t*\/\n\t\tvoid flush() {}\n};\n\n#include \"Implementation\/Z80Storage.hpp\"\n\n\/*!\n\tA base class from which the Z80 descends; separated for implementation reasons only.\n*\/\nclass ProcessorBase: public ProcessorStorage {\n\tpublic:\n\t\t\/*!\n\t\t\tGets the value of a register.\n\n\t\t\t@see set_value_of_register\n\n\t\t\t@param r The register to set.\n\t\t\t@returns The value of the register. 8-bit registers will be returned as unsigned.\n\t\t*\/\n\t\tuint16_t get_value_of_register(Register r);\n\n\t\t\/*!\n\t\t\tSets the value of a register.\n\n\t\t\t@see get_value_of_register\n\n\t\t\t@param r The register to set.\n\t\t\t@param value The value to set. If the register is only 8 bit, the value will be truncated.\n\t\t*\/\n\t\tvoid set_value_of_register(Register r, uint16_t value);\n\n\t\t\/*!\n\t\t\tGets the value of the HALT output line.\n\t\t*\/\n\t\tinline bool get_halt_line();\n\n\t\t\/*!\n\t\t\tSets the logical value of the interrupt line.\n\n\t\t\t@param offset If called while within perform_machine_cycle this may be a value indicating\n\t\t\thow many cycles before now the line changed state. The value may not be longer than the\n\t\t\tcurrent machine cycle. If called at any other time, this must be zero.\n\t\t*\/\n\t\tinline void set_interrupt_line(bool value, HalfCycles offset = 0);\n\n\t\t\/*!\n\t\t\tGets the value of the interrupt line.\n\t\t*\/\n\t\tinline bool get_interrupt_line();\n\n\t\t\/*!\n\t\t\tSets the logical value of the non-maskable interrupt line.\n\n\t\t\t@param offset See discussion in set_interrupt_line.\n\t\t*\/\n\t\tinline void set_non_maskable_interrupt_line(bool value, HalfCycles offset = 0);\n\n\t\t\/*!\n\t\t\tGets the value of the non-maskable interrupt line.\n\t\t*\/\n\t\tinline bool get_non_maskable_interrupt_line();\n\n\t\t\/*!\n\t\t\tSets the logical value of the reset line.\n\t\t*\/\n\t\tinline void set_reset_line(bool value);\n\n\t\t\/*!\n\t\t\tThis emulation automatically sets itself up in power-on state at creation, which has the effect of triggering a\n\t\t\treset at the first opportunity. Use @c reset_power_on to disable that behaviour.\n\t\t*\/\n\t\tvoid reset_power_on();\n};\n\n\/*!\n\t@abstact Template providing emulation of a Z80 processor.\n\n\t@discussion Users should provide as the first template parameter a subclass of CPU::Z80::BusHandler; the Z80\n\twill announce its activity via the bus handler, which is responsible for marrying it to a bus. Users\n\tcan also nominate whether the processor includes support for the bus request and\/or wait lines. Declining to\n\tsupport either can produce a minor runtime performance improvement.\n*\/\ntemplate <class T, bool uses_bus_request, bool uses_wait_line> class Processor: public ProcessorBase {\n\tpublic:\n\t\tProcessor(T &bus_handler);\n\n\t\t\/*!\n\t\t\tRuns the Z80 for a supplied number of cycles.\n\n\t\t\t@discussion Subclasses must implement @c perform_machine_cycle(const PartialMachineCycle &cycle) .\n\n\t\t\tIf it is a read operation then @c value will be seeded with the value 0xff.\n\n\t\t\t@param cycles The number of cycles to run for.\n\t\t*\/\n\t\tvoid run_for(const HalfCycles cycles);\n\n\t\t\/*!\n\t\t\tSets the logical value of the bus request line, having asserted that this Z80 supports the bus request line.\n\t\t*\/\n\t\tvoid set_bus_request_line(bool value);\n\n\t\t\/*!\n\t\t\tGets the logical value of the bus request line.\n\t\t*\/\n\t\tbool get_bus_request_line();\n\n\t\t\/*!\n\t\t\tSets the logical value of the wait line, having asserted that this Z80 supports the wait line.\n\t\t*\/\n\t\tvoid set_wait_line(bool value);\n\n\t\t\/*!\n\t\t\tGets the logical value of the bus request line.\n\t\t*\/\n\t\tbool get_wait_line();\n\n\tprivate:\n\t\tT &bus_handler_;\n\n\t\tvoid assemble_page(InstructionPage &target, InstructionTable &table, bool add_offsets);\n\t\tvoid copy_program(const MicroOp *source, std::vector<MicroOp> &destination);\n};\n\n#include \"Implementation\/Z80Implementation.hpp\"\n\n}\n}\n\n#endif \/* Z80_hpp *\/\n<commit_msg>Correct typos in Z80.hpp<commit_after>\/\/\n\/\/  Z80.hpp\n\/\/  Clock Signal\n\/\/\n\/\/  Created by Thomas Harte on 14\/05\/2017.\n\/\/  Copyright 2017 Thomas Harte. All rights reserved.\n\/\/\n\n#ifndef Z80_hpp\n#define Z80_hpp\n\n#include <cassert>\n#include <vector>\n#include <cstdint>\n\n#include \"..\/RegisterSizes.hpp\"\n#include \"..\/..\/ClockReceiver\/ClockReceiver.hpp\"\n\nnamespace CPU {\nnamespace Z80 {\n\n\/*\n\tThe list of registers that can be accessed via @c set_value_of_register and @c set_value_of_register.\n*\/\nenum Register {\n\tProgramCounter,\n\tStackPointer,\n\n\tA,\t\tFlags,\tAF,\n\tB,\t\tC,\t\tBC,\n\tD,\t\tE,\t\tDE,\n\tH,\t\tL,\t\tHL,\n\n\tADash,\t\tFlagsDash,\tAFDash,\n\tBDash,\t\tCDash,\t\tBCDash,\n\tDDash,\t\tEDash,\t\tDEDash,\n\tHDash,\t\tLDash,\t\tHLDash,\n\n\tIXh,\tIXl,\tIX,\n\tIYh,\tIYl,\tIY,\n\tR,\t\tI,\t\tRefresh,\n\n\tIFF1,\tIFF2,\tIM,\n\n\tMemPtr\n};\n\n\/*\n\tFlags as defined on the Z80; can be used to decode the result of getting or setting @c Flags.\n*\/\nenum Flag: uint8_t {\n\tSign\t\t= 0x80,\n\tZero\t\t= 0x40,\n\tBit5\t\t= 0x20,\n\tHalfCarry\t= 0x10,\n\tBit3\t\t= 0x08,\n\tParity\t\t= 0x04,\n\tOverflow\t= 0x04,\n\tSubtract\t= 0x02,\n\tCarry\t\t= 0x01\n};\n\n\/*!\n\tSubclasses will be given the task of performing partial machine cycles, allowing them to provide whatever interface they like\n\tbetween a Z80 and the rest of the system. @c PartialMachineCycle defines the information they will be handed for each unit\n\tof execution.\n*\/\nstruct PartialMachineCycle {\n\tenum Operation {\n\t\tReadOpcode = 0,\n\t\tRead,\n\t\tWrite,\n\t\tInput,\n\t\tOutput,\n\t\tInterrupt,\n\n\t\tRefresh,\n\t\tInternal,\n\t\tBusAcknowledge,\n\n\t\tReadOpcodeWait,\n\t\tReadWait,\n\t\tWriteWait,\n\t\tInputWait,\n\t\tOutputWait,\n\t\tInterruptWait,\n\n\t\tReadOpcodeStart,\n\t\tReadStart,\n\t\tWriteStart,\n\t\tInputStart,\n\t\tOutputStart,\n\t\tInterruptStart,\n\t};\n\t\/\/\/ The operation being carried out by the Z80. See the various getters below for better classification.\n\tconst Operation operation;\n\t\/\/\/ The length of this operation.\n\tconst HalfCycles length;\n\t\/\/\/ The current value of the address bus.\n\tconst uint16_t *const address;\n\t\/\/\/ If the Z80 is outputting to the data bus, a pointer to that value. Otherwise, a pointer to the location where the current data bus value should be placed.\n\tuint8_t *const value;\n\t\/\/\/ @c true if this operation is occurring only because of an external request; @c false otherwise.\n\tconst bool was_requested;\n\n\t\/*!\n\t\t@returns @c true if the processor believes that the bus handler should actually do something with\n\t\tthe content of this PartialMachineCycle; @c false otherwise.\n\t*\/\n\tinline bool expects_action() const {\n\t\treturn operation <= Operation::Interrupt;\n\t}\n\t\/*!\n\t\t@returns @c true if this partial machine cycle completes one of the documented full machine cycles;\n\t\t@c false otherwise.\n\t*\/\n\tinline bool is_terminal() const {\n\t\treturn operation <= Operation::BusAcknowledge;\n\t}\n\t\/*!\n\t\t@returns @c true if this partial machine cycle is a wait cycle; @c false otherwise.\n\t*\/\n\tinline bool is_wait() const {\n\t\treturn operation >= Operation::ReadOpcodeWait && operation <= Operation::InterruptWait;\n\t}\n\n\tPartialMachineCycle(const PartialMachineCycle &rhs) noexcept;\n\tPartialMachineCycle(Operation operation, HalfCycles length, uint16_t *address, uint8_t *value, bool was_requested) noexcept;\n\tPartialMachineCycle() noexcept;\n};\n\n\/*!\n\tA class providing empty implementations of the methods a Z80 uses to access the bus. To wire the Z80 to a bus,\n\tmachines should subclass BusHandler and then declare a realisation of the Z80 template, supplying their bus\n\thandler.\n*\/\nclass BusHandler {\n\tpublic:\n\t\t\/*!\n\t\t\tAnnounces that the Z80 has performed the partial machine cycle defined by @c cycle.\n\n\t\t\t@returns The number of additional HalfCycles that passed in objective time while this Z80 operation was ongoing.\n\t\t\tOn an archetypal machine this will be HalfCycles(0) but some architectures may choose not to clock the Z80\n\t\t\tduring some periods or may impose wait states so predictably that it's more efficient just to add them\n\t\t\tvia this mechanism.\n\t\t*\/\n\t\tHalfCycles perform_machine_cycle(const PartialMachineCycle &cycle) {\n\t\t\treturn HalfCycles(0);\n\t\t}\n\n\t\t\/*!\n\t\t\tAnnounces completion of all the cycles supplied to a .run_for request on the Z80. Intended to allow\n\t\t\tbus handlers to perform any deferred output work.\n\t\t*\/\n\t\tvoid flush() {}\n};\n\n#include \"Implementation\/Z80Storage.hpp\"\n\n\/*!\n\tA base class from which the Z80 descends; separated for implementation reasons only.\n*\/\nclass ProcessorBase: public ProcessorStorage {\n\tpublic:\n\t\t\/*!\n\t\t\tGets the value of a register.\n\n\t\t\t@see set_value_of_register\n\n\t\t\t@param r The register to set.\n\t\t\t@returns The value of the register. 8-bit registers will be returned as unsigned.\n\t\t*\/\n\t\tuint16_t get_value_of_register(Register r);\n\n\t\t\/*!\n\t\t\tSets the value of a register.\n\n\t\t\t@see get_value_of_register\n\n\t\t\t@param r The register to set.\n\t\t\t@param value The value to set. If the register is only 8 bit, the value will be truncated.\n\t\t*\/\n\t\tvoid set_value_of_register(Register r, uint16_t value);\n\n\t\t\/*!\n\t\t\tGets the value of the HALT output line.\n\t\t*\/\n\t\tinline bool get_halt_line();\n\n\t\t\/*!\n\t\t\tSets the logical value of the interrupt line.\n\n\t\t\t@param offset If called while within perform_machine_cycle this may be a value indicating\n\t\t\thow many cycles before now the line changed state. The value may not be longer than the\n\t\t\tcurrent machine cycle. If called at any other time, this must be zero.\n\t\t*\/\n\t\tinline void set_interrupt_line(bool value, HalfCycles offset = 0);\n\n\t\t\/*!\n\t\t\tGets the value of the interrupt line.\n\t\t*\/\n\t\tinline bool get_interrupt_line();\n\n\t\t\/*!\n\t\t\tSets the logical value of the non-maskable interrupt line.\n\n\t\t\t@param offset See discussion in set_interrupt_line.\n\t\t*\/\n\t\tinline void set_non_maskable_interrupt_line(bool value, HalfCycles offset = 0);\n\n\t\t\/*!\n\t\t\tGets the value of the non-maskable interrupt line.\n\t\t*\/\n\t\tinline bool get_non_maskable_interrupt_line();\n\n\t\t\/*!\n\t\t\tSets the logical value of the reset line.\n\t\t*\/\n\t\tinline void set_reset_line(bool value);\n\n\t\t\/*!\n\t\t\tThis emulation automatically sets itself up in power-on state at creation, which has the effect of triggering a\n\t\t\treset at the first opportunity. Use @c reset_power_on to disable that behaviour.\n\t\t*\/\n\t\tvoid reset_power_on();\n};\n\n\/*!\n\t@abstact Template providing emulation of a Z80 processor.\n\n\t@discussion Users should provide as the first template parameter a subclass of CPU::Z80::BusHandler; the Z80\n\twill announce its activity via the bus handler, which is responsible for marrying it to a bus. Users\n\tcan also nominate whether the processor includes support for the bus request and\/or wait lines. Declining to\n\tsupport either can produce a minor runtime performance improvement.\n*\/\ntemplate <class T, bool uses_bus_request, bool uses_wait_line> class Processor: public ProcessorBase {\n\tpublic:\n\t\tProcessor(T &bus_handler);\n\n\t\t\/*!\n\t\t\tRuns the Z80 for a supplied number of cycles.\n\n\t\t\t@discussion Subclasses must implement @c perform_machine_cycle(const PartialMachineCycle &cycle) .\n\n\t\t\tIf it is a read operation then @c value will be seeded with the value 0xff.\n\n\t\t\t@param cycles The number of cycles to run for.\n\t\t*\/\n\t\tvoid run_for(const HalfCycles cycles);\n\n\t\t\/*!\n\t\t\tSets the logical value of the bus request line, having asserted that this Z80 supports the bus request line.\n\t\t*\/\n\t\tvoid set_bus_request_line(bool value);\n\n\t\t\/*!\n\t\t\tGets the logical value of the bus request line.\n\t\t*\/\n\t\tbool get_bus_request_line();\n\n\t\t\/*!\n\t\t\tSets the logical value of the wait line, having asserted that this Z80 supports the wait line.\n\t\t*\/\n\t\tvoid set_wait_line(bool value);\n\n\t\t\/*!\n\t\t\tGets the logical value of the bus request line.\n\t\t*\/\n\t\tbool get_wait_line();\n\n\tprivate:\n\t\tT &bus_handler_;\n\n\t\tvoid assemble_page(InstructionPage &target, InstructionTable &table, bool add_offsets);\n\t\tvoid copy_program(const MicroOp *source, std::vector<MicroOp> &destination);\n};\n\n#include \"Implementation\/Z80Implementation.hpp\"\n\n}\n}\n\n#endif \/* Z80_hpp *\/\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Create 1168 - LED.cpp<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>Bug: Used C++ 2011 string::stoul() - not on Debian<commit_after><|endoftext|>"}
{"text":"<commit_before>\n#include <QDebug>\n#include \"QVerbalExpressions.h\"\n\nQVerbalExpressions::QVerbalExpressions()\n: modifiers(0)\n{\n}\n\nQVerbalExpressions& QVerbalExpressions::add(const QString& value)\n{\n    source += value;\n    pattern = prefixes % source % suffixes;\n\n    return *this;\n}\n\nQVerbalExpressions& QVerbalExpressions::startOfLine(bool enable)\n{\n    prefixes = enable ? \"^\" : \"\";\n    return add();\n}\n\nQVerbalExpressions& QVerbalExpressions::endOfLine(bool enable)\n{\n    suffixes = enable ? \"$\" : \"\";\n    return add();\n}\n\nQVerbalExpressions& QVerbalExpressions::then(const QString& value)\n{\n    return add(\"(?:\" % value % \")\");\n}\n\nQVerbalExpressions& QVerbalExpressions::find(const QString& value)\n{\n    return then(value);\n}\n\nQVerbalExpressions& QVerbalExpressions::maybe(const QString& value)\n{\n    return add(\"(?:\" % value % \")?\");\n}\n\nQVerbalExpressions& QVerbalExpressions::anything()\n{\n    return add(\"(?:.*)\");\n}\n\nQVerbalExpressions& QVerbalExpressions::anythingBut(const QString& value)\n{\n    return add(\"(?:[^\" % value % \"]*)\");\n}\n\nQVerbalExpressions& QVerbalExpressions::something()\n{\n    return add(\"(?:.+)\");\n}\n\nQVerbalExpressions& QVerbalExpressions::somethingBut(const QString& value)\n{\n    return add(\"(?:[^\" % value % \"]+)\");\n}\n\nQVerbalExpressions& QVerbalExpressions::lineBreak()\n{\n    return add(\"(?:(?:\\\\n)|(?:\\\\r\\\\n))\");\n}\n\nQVerbalExpressions& QVerbalExpressions::br()\n{\n    return lineBreak();\n}\n\nQVerbalExpressions& QVerbalExpressions::tab()\n{\n    return add(\"\\\\t\");\n}\n\nQVerbalExpressions& QVerbalExpressions::word()\n{\n    return add(\"\\\\w+\");\n}\n\nQVerbalExpressions& QVerbalExpressions::anyOf(const QString& value)\n{\n    return add(\"[\" % value % \"]\");\n}\n\nQVerbalExpressions& QVerbalExpressions::any(const QString& value)\n{\n    return anyOf(value);\n}\n\nQVerbalExpressions& QVerbalExpressions::addModifier(char modifier)\n{\n    switch (modifier)\n    {\n        case 'i':\n            modifiers |= QRegularExpression::CaseInsensitiveOption;\n            break;\n\n        case 'm':\n            modifiers |= QRegularExpression::MultilineOption;\n            break;\n\n        case 'g':\n            \/\/ TODO\n            break;\n\n        default:\n            break;\n    }\n\n    return *this;\n}\n\nQVerbalExpressions& QVerbalExpressions::removeModifier(char modifier)\n{\n    switch (modifier)\n    {\n        case 'i':\n            modifiers ^= QRegularExpression::CaseInsensitiveOption;\n            break;\n\n        case 'm':\n            modifiers ^= QRegularExpression::MultilineOption;\n            break;\n\n        case 'g':\n            \/\/ TODO\n            break;\n\n        default:\n            break;\n    }\n\n    return *this;\n\n}\n\nQVerbalExpressions& QVerbalExpressions::withAnyCase(bool enable)\n{\n    if (enable)\n        addModifier('i');\n    else\n        removeModifier('i');\n\n    return *this;\n}\n\nQVerbalExpressions& QVerbalExpressions::searchOneLine(bool enable)\n{\n    if (enable)\n        removeModifier('m');\n    else\n        addModifier('m');\n\n    return *this;\n}\n\nQVerbalExpressions& QVerbalExpressions::searchGlobal(bool enable)\n{\n    if (enable)\n        addModifier('g');\n    else\n        removeModifier('g');\n\n    return *this;\n}\n\nQVerbalExpressions& QVerbalExpressions::multiple(const QString& value)\n{\n    if (!value.startsWith('*') || !value.startsWith('*'))\n        add(\"+\");\n\n    return add(value);\n}\n\nQVerbalExpressions& QVerbalExpressions::alt(const QString& value)\n{\n    if (!prefixes.contains('('))\n        prefixes += '(';\n\n    if (!suffixes.contains(')'))\n        suffixes = ')' % suffixes;\n\n    add(\")|(\");\n    return then(value);\n}\n\n#ifdef Q_COMPILER_INITIALIZER_LISTS\nQVerbalExpressions& QVerbalExpressions::range(const std::initializer_list<QString> & args)\n{\n    \/\/ TODO\n    return *this;\n}\n#endif\n\nbool QVerbalExpressions::test(const QString& value)\n{\n    \/\/\/ TODO\n\n    return value.contains(QRegularExpression(pattern, modifiers));\n}\n\nQString QVerbalExpressions::replace(QString& source, const QString& value)\n{\n    return source.replace(QRegularExpression(pattern), value);\n}\n<commit_msg>and so the crazy refactoring process sees the sunlight after some months in the dark!<commit_after>\n#include <QDebug>\n#include \"QVerbalExpressions.h\"\n\nQVerbalExpressions::QVerbalExpressions()\n{\n    modifiers = QRegularExpression::NoMatchOption;\n}\n\nQVerbalExpressions& QVerbalExpressions::add(const QString& value)\n{\n    source += value;\n    pattern = prefixes % source % suffixes;\n\n    return *this;\n}\n\nQVerbalExpressions& QVerbalExpressions::startOfLine(bool enable)\n{\n    prefixes = enable ? \"^\" : \"\";\n    return add();\n}\n\nQVerbalExpressions& QVerbalExpressions::endOfLine(bool enable)\n{\n    suffixes = enable ? \"$\" : \"\";\n    return add();\n}\n\nQVerbalExpressions& QVerbalExpressions::then(const QString& value)\n{\n    return add(\"(?:\" % value % \")\");\n}\n\nQVerbalExpressions& QVerbalExpressions::find(const QString& value)\n{\n    return then(value);\n}\n\nQVerbalExpressions& QVerbalExpressions::maybe(const QString& value)\n{\n    return add(\"(?:\" % value % \")?\");\n}\n\nQVerbalExpressions& QVerbalExpressions::anything()\n{\n    return add(\"(?:.*)\");\n}\n\nQVerbalExpressions& QVerbalExpressions::anythingBut(const QString& value)\n{\n    return add(\"(?:[^\" % value % \"]*)\");\n}\n\nQVerbalExpressions& QVerbalExpressions::something()\n{\n    return add(\"(?:.+)\");\n}\n\nQVerbalExpressions& QVerbalExpressions::somethingBut(const QString& value)\n{\n    return add(\"(?:[^\" % value % \"]+)\");\n}\n\nQVerbalExpressions& QVerbalExpressions::lineBreak()\n{\n    return add(\"(?:(?:\\\\n)|(?:\\\\r\\\\n))\");\n}\n\nQVerbalExpressions& QVerbalExpressions::br()\n{\n    return lineBreak();\n}\n\nQVerbalExpressions& QVerbalExpressions::tab()\n{\n    return add(\"\\\\t\");\n}\n\nQVerbalExpressions& QVerbalExpressions::word()\n{\n    return add(\"\\\\w+\");\n}\n\nQVerbalExpressions& QVerbalExpressions::anyOf(const QString& value)\n{\n    return add(\"[\" % value % \"]\");\n}\n\nQVerbalExpressions& QVerbalExpressions::any(const QString& value)\n{\n    return anyOf(value);\n}\n\nQVerbalExpressions& QVerbalExpressions::addModifier(char modifier)\n{\n    switch (modifier)\n    {\n        case 'i':\n            modifiers |= QRegularExpression::CaseInsensitiveOption;\n            break;\n\n        case 'm':\n            modifiers |= QRegularExpression::MultilineOption;\n            break;\n\n        case 'g':\n            \/\/ TODO\n            break;\n\n        default:\n            break;\n    }\n\n    return *this;\n}\n\nQVerbalExpressions& QVerbalExpressions::removeModifier(char modifier)\n{\n    switch (modifier)\n    {\n        case 'i':\n            modifiers ^= QRegularExpression::CaseInsensitiveOption;\n            break;\n\n        case 'm':\n            modifiers ^= QRegularExpression::MultilineOption;\n            break;\n\n        case 'g':\n            \/\/ TODO\n            break;\n\n        default:\n            break;\n    }\n\n    return *this;\n\n}\n\nQVerbalExpressions& QVerbalExpressions::withAnyCase(bool enable)\n{\n    if (enable)\n        addModifier('i');\n    else\n        removeModifier('i');\n\n    return *this;\n}\n\nQVerbalExpressions& QVerbalExpressions::searchOneLine(bool enable)\n{\n    if (enable)\n        removeModifier('m');\n    else\n        addModifier('m');\n\n    return *this;\n}\n\nQVerbalExpressions& QVerbalExpressions::searchGlobal(bool enable)\n{\n    if (enable)\n        addModifier('g');\n    else\n        removeModifier('g');\n\n    return *this;\n}\n\nQVerbalExpressions& QVerbalExpressions::multiple(const QString& value)\n{\n    if (!value.startsWith('*') || !value.startsWith('*'))\n        add(\"+\");\n\n    return add(value);\n}\n\nQVerbalExpressions& QVerbalExpressions::alt(const QString& value)\n{\n    if (!prefixes.contains('('))\n        prefixes += '(';\n\n    if (!suffixes.contains(')'))\n        suffixes = ')' % suffixes;\n\n    add(\")|(\");\n    return then(value);\n}\n\n#ifdef Q_COMPILER_INITIALIZER_LISTS\nQVerbalExpressions& QVerbalExpressions::range(const std::initializer_list<QString> & args)\n{\n    \/\/ TODO\n    return *this;\n}\n#endif\n\nbool QVerbalExpressions::test(const QString& value)\n{\n    \/\/\/ TODO\n\n    return value.contains(QRegularExpression(pattern, modifiers));\n}\n\nQString QVerbalExpressions::replace(QString& source, const QString& value)\n{\n    return source.replace(QRegularExpression(pattern), value);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"BUBBLES.H\"\n\n#include \"DRAW.H\"\n#include \"GPU.H\"\n#include \"ROOMLOAD.H\"\n#include \"SPECIFIC.H\"\n\nvoid DrawFlash()\n{\n\tUNIMPLEMENTED();\n}\n\nvoid insert_psx_clip_window(long x, long y, long w, long h, long arg_10)\n{\n#if 0\n\tDRAWENV env;\/\/0x1F800000\n\tint v0;\n\n\tv0 = db.current_buffer;\n\n\tif (db.current_buffer != 0)\n\t{\n\t\tv0 = 0xF00000;\n\t\ty += SCREEN_HEIGHT;\n\t}\n\t\/\/loc_8FDCC\n\tSetDefDrawEnv(&env, x, y, w, h);\n\t((int*)&env.ofs)[0] = v0;\n\tenv.dtd = 1;\n\tenv.isbg = 0;\n\tSetDrawEnv((DR_ENV*)db.polyptr, &env);\n\tdb.ot[2563] = (unsigned int)db.polyptr;\n\t((unsigned int*)db.polyptr)[0] = (unsigned int)db.ot[2563] | 0x6000000;\n\tdb.polyptr += 0x1C;\n#endif\n}\n\nvoid CalcClipWindow_ONGTE(short room_number, long unknown)\/\/8F374,\n{\n\tUNIMPLEMENTED();\n}\n\nvoid DrawPsxTile(long a0, long a1, long a2, long a3)\/\/8F770(<), 917B4(<) (F)\n{\n\tUNIMPLEMENTED();\n}\n\nvoid TriggerDynamic(long x, long y, long z, int falloff, int r, int g, int b)\n{\n\tUNIMPLEMENTED();\n}\n\n#if PSXPC_VERSION\nvoid SetInventoryLighting(struct MATRIX3D* m)\n{\n#if PSX_VERSION && !USE_ASM\n\tgte_ReadRotMatrix(m);\n\tgte_SetRotMatrix(CamGTE);\n\t\/\/a0 = CamGTE\n#else\n\tUNIMPLEMENTED();\n#endif\n}\n#endif\n\nvoid DrawMonoScreen(int a0)\n{\n}<commit_msg>Update BUBBLES.C<commit_after>#include \"BUBBLES.H\"\n\n#include \"DRAW.H\"\n#include \"GPU.H\"\n#include \"ROOMLOAD.H\"\n#include \"SPECIFIC.H\"\n\nvoid DrawFlash()\n{\n\tUNIMPLEMENTED();\n}\n\nvoid insert_psx_clip_window(long x, long y, long w, long h, long arg_10)\n{\n#if 0\n\tDRAWENV env;\/\/0x1F800000\n\tint v0;\n\n\tv0 = db.current_buffer;\n\n\tif (db.current_buffer != 0)\n\t{\n\t\tv0 = 0xF00000;\n\t\ty += SCREEN_HEIGHT;\n\t}\n\t\/\/loc_8FDCC\n\tSetDefDrawEnv(&env, x, y, w, h);\n\t((int*)&env.ofs)[0] = v0;\n\tenv.dtd = 1;\n\tenv.isbg = 0;\n\tSetDrawEnv((DR_ENV*)db.polyptr, &env);\n\tdb.ot[2563] = (unsigned int)db.polyptr;\n\t((unsigned int*)db.polyptr)[0] = (unsigned int)db.ot[2563] | 0x6000000;\n\tdb.polyptr += 0x1C;\n#endif\n}\n\nvoid CalcClipWindow_ONGTE(short room_number, long unknown)\/\/8F374,\n{\n\tUNIMPLEMENTED();\n}\n\nvoid DrawPsxTile(long a0, long a1, long a2, long a3)\/\/8F770(<), 917B4(<) (F)\n{\n\tUNIMPLEMENTED();\n}\n\nvoid TriggerDynamic(long x, long y, long z, int falloff, int r, int g, int b)\n{\n\tUNIMPLEMENTED();\n}\n\n#if PSXPC_VERSION\nvoid SetInventoryLighting(struct MATRIX3D* m)\n{\n#if PSX_VERSION && !USE_ASM\n\tgte_ReadRotMatrix(m);\n\tgte_SetRotMatrix(CamGTE);\n\t\/\/a0 = CamGTE\n#else\n\tUNIMPLEMENTED();\n#endif\n}\n#endif\n\nvoid DrawMonoScreen(int a0)\n{\n\tint i = 0;\n\tint j = 0;\n\tunsigned long* pp = db.ot;\/\/a2\n\tunsigned long t5 = db.ot[2000];\n\tchar* a00 = db.polyptr;\n\n\t\/\/loc_8F17C\n\tfor(i = 0; i < 4; i++)\n\t{\n\t\t\/\/loc_8F180 \n\t\tfor (j = 0; j < 8; j++)\n\t\t{\n\t\t\t((int*)a00)[2] = 0;\n\t\t\t((int*)a00)[3] = a0 | 0x64000000;\n\t\t\t((int*)a00)[4] = ((i << 6) << 16) | (j << 6);\n\t\t\t((int*)a00)[6] = 0x400040;\n\n\t\t\t((int*)a00)[0] = t5 | 0x6000000;\n\t\t\t((int*)a00)[1] = (((j << 6) >> 8) + 13) | 0xE1000610;\n\t\t\t((short*)a00)[10] = (((i << 6) & 0xFF) << 8) | ((j << 6) & 0xFF);\n\t\t\t((short*)a00)[11] = (ClutStartY << 6) | 0x3C;\n\n\t\t\tt5 = (unsigned long)db.polyptr;\n\t\t\ta00 += 0x1C;\/\/TODO actual polytype\n\t\t}\n\t\tj = 0;\n\t}\n\n\tdb.ot[2000] = (unsigned long)pp;\n\tdb.polyptr = (char*)a00;\n\n\treturn;\n}<|endoftext|>"}
{"text":"<commit_before>#ifndef BMP_MANIP_HH\n#define BMP_MANIP_HH\n\n#include <string>\n#include <fstream>\n#include <sstream>\n#include <iostream>\n#include <cstring>\n\ntypedef std::string bmp_t;\n\n\nstatic int bytes_to_int(const std::string& bytes) {\n  char* dword = new char[4];\n  memcpy(dword, bytes.c_str(), 4);\n  int ret;\n  if (bytes.length() == 2) {\n    short temp = *(short*)dword;\n    ret = temp;\n  } else {\n    ret = *(int*)dword;\n  }\n  delete dword;\n  return ret;\n}\n\nbmp_t open_bmp(const std::string& fname) {\n  std::ifstream ifs(fname, std::ios::binary);\n  std::ostringstream ost;\n  ost << ifs.rdbuf();\n  bmp_t bmp(ost.str());\n  return bmp;\n}\n\n\/\/ returns the offset at which the pixel array begins (The data after the BMP header info)\nunsigned bmp_image_offset(const bmp_t& bmp) {\n  std::string bytes = bmp.substr(0xa, 4);\n  int offset = bytes_to_int(bytes);\n  return offset;\n}\n\nunsigned bmp_bits_per_pixel(const bmp_t& bmp) {\n  std::string bytes = bmp.substr(0x1c, 2);\n  int bpp = bytes_to_int(bytes);\n  return bpp;\n}\n\nint bmp_width(const bmp_t& bmp) {\n  std::string bytes = bmp.substr(0x12, 4);\n  int w = bytes_to_int(bytes);\n  return w;\n}\n\nint bmp_height(const bmp_t& bmp) {\n  std::string bytes = bmp.substr(0x16, 4);\n  int h = bytes_to_int(bytes);\n  return h;\n}\n\nbool is_bmp_valid(const bmp_t& bmp) {\n  std::string validation = bmp.substr(0, 2);\n  return validation == \"BM\";\n}\n\n#endif \/\/ BMP_MANIP_HH\n<commit_msg>Moving bmp manipulation into a class<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nPlik:\tTexture.cpp\nAutor:\tReal_Noname (real_noname@wp.pl)\n(C):\tCODE RULERS (Real_Noname)\nWWW:\twww.coderulers.prv.pl\nOpis:\tPatrz -> Texture.h\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/*\/\n#include \"Texture.h\"\n#include \"Log.h\"\n#include <fstream>\n\nioTexture::ioTexture() :\n\tloaded(false),\n\tfile(\"-\"),\n\ttexture(0)\n{\n\tloaded = false;\n\tfile = \"-\";\n}\n\nioTexture::ioTexture( std::string filename ) :\n\tloaded(false),\n\tfile(\"-\"),\n\ttexture(0)\n{\n\tLoadTGA( filename );\n}\n\nioTexture::~ioTexture()\n{\n\tFree();\n}\n\nbool\tioTexture::LoadTGA( std::string filename )\n{\n\t\/*\teby odczyta plik TGA\n\t\tpotrzebne s odpowiednie\n\t\tzmienne pomocnicze.\n\t*\/\n\t\/\/\tTa tablica jest do porwnania i trzyma nagwek nieskompresowanego pliku TGA\n\tunsigned char TGAheader[12] = {0,0,2,0,0,0,0,0,0,0,0,0};\n\n\t\/\/ Waciwa tablica, ktra bdzie trzymac nagwek z pliku\n\tunsigned char TGAcompare[12];\t\t\t\t\n\t\n\t\/\/ Nagwek opisujcy zapisany obraz\n\tunsigned char header[6];\n\n\t\/\/ Zmienna bdzie trzyma ilo bajtw na pixel\n\tunsigned int bytesPerPixel;\t\t\t\t\n\n\t\/\/ Rozmiar tablicy trzymajcej dane z pliku\n\tunsigned int imageSize;\t\t\n\n\t\/\/ Tablica trzymajca dane ( a raczej wskanik na ni )\n\tunsigned char *imageData;\n\n\t\/\/ Zmienna pomocnicza\n\tunsigned int temp;\t\n\t\n\t\/\/ Typ zapisanego obrazu\n\tunsigned int type = GL_RGBA;\n\n\t\/\/ Ilo bitw kolorw obrazu\n\tunsigned int bpp;\n\n\t\/\/ Jego wysoko i szeroko\n\tunsigned int width;\n\tunsigned int height;\n\n\n\t\/\/ Otwieramy plik\n\tstd::fstream fileStream(filename, std::ios::in);\n\n\tLog.Log(\"TGATEX( \" + file + \" ): adowanie pliku \" + filename + \"...\");\n\t\/\/ Teraz sprawdzamy pare rzeczy\n\tif(\tfileStream.bad() || \/\/ Czy otwarcie pliku si udao\n\t\tfileStream.read( (char*)TGAcompare, sizeof(char) * 12 ) ||\t\/\/ Czy mona odczyta 12 bajtw nagwka\n\t\tmemcmp( TGAheader, TGAcompare, sizeof( TGAheader ) ) != 0 ||                    \/\/ Czy to jest nagwek ktrego szukamy?\n\t\tfileStream.read( (char*)header, sizeof(char) * 6 ) )\t\t\t\/\/ Jeeli tak, to czytamy nastpne 6 bajtw\n\t{\n\t\t\/\/ Na wypadek gdyby co si nie udao, to zwracamy false\n\t\tif ( fileStream.bad() )\n\t\t{\n\t\t\tLog.Error( \"TGATEX( \" + file + \" ): Nieprawidowa cieka lub plik nie istnieje!\" );\n\t\t\treturn false;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tLog.Error( \"TGATEX( \" + file + \" ): Bd z nagwkiem pliku!\" );\n\t\t\treturn false;\n\t\t}\n\t}\n\t\n\tif( loaded )\n\t{\n\t\tFree();\n\t\tLog.Report( \"TGATEX( \" + file + \" ): Przeadowanie tekstury na \" + filename );\n\t}\n\tfile = filename;\n\n\twidth  = header[1] * 256 + header[0];\t\t\/\/ Opracuj szeroko obrazka\n\theight = header[3] * 256 + header[2];\t\t\/\/ i jego wysokosc\n    \n \tif(\twidth  <= 0\t||\t\t\t\/\/ Jeeli szeroko\n\t\theight <= 0\t||\t\t\t\/\/ lub wysokoc jest mniejsza lub rwna zeru\n\t\t( header[4] != 24 && header[4] != 32 ) )\t\t\/\/ Lub to nie jest ani obraz 24 Bity, ani 32 Bity\n\t{\n\t\t\/\/ To zatrzymaj\n\t\tLog.Error( \"TGATEX( \" + file + \" ): Nieprawidowy obraz w pliku TGA!\" );\n\t\treturn false;\n\t}\n\n\t\/\/ Odczytaj Bity kolorw obrazu\n\tbpp = header[4];\n\n\t\/\/ Oblicz ile to bajtw na pixel\n\tbytesPerPixel = bpp \/ 8;\n\n\t\/\/ Oblicz wielko tablicy\n\timageSize = width * height * bytesPerPixel;\n\n\t\/\/ I zarezerwuj tyle miejsca\n\timageData = (unsigned char *)malloc( imageSize );\n\n\t\/*\tTeraz troch teorii\n\t\teby zrobi teksture dla OpenGL\n\t\tpotrzebna jest tablica z informajcami\n\t\to kolorach. To jest poowa roboty, a pierwsz\n\t\tto wydoby te dane z pliku :) Co ju za chwile\n\t\twykonamy.\n\t*\/\n\t\n\tif(\timageData == NULL ||\t\/\/ Sprawd czy pami jest zarezerwowana\n\t\tfileStream.read( (char*)imageData, imageSize * sizeof(char) ))\t\/\/ Sprawd czy NA PEWNO odczytalimy tyle z pliku ile chcielimy\n\t{\n\t\t\/\/ Jeeli co si nie zgadza, to przerywamy\n\t\tif( imageData != NULL)\n\t\t\tfree( imageData );\n\n\t\tLog.Error( \"TGATEX( \" + file + \" ): Bd pamici!\" );\n\t\treturn false;\t\n\t}\n\n\t\/*\tA teraz may kruczek. Jak zapewne\n\t\twiadomo, s trzy kolory skadowe:\n\t\tczerwony (Red), zielony (Green) oraz\n\t\tniebieski (Blue), czyli poprawny kolotw format powinien\n\t\tby RGB. Ale z niewiadomych przyczyn w pliku TGA jest... BGR?\n\t\tMusimy to poprawi dlatego teraz zamieniamy\n\t\tmiejscami dwa feralne bajty.\n\t*\/\n\tfor( unsigned int i = 0; i < int( imageSize ); i += bytesPerPixel )\t\n\t{\t\t\t\t\t\t\t\t\n\t\ttemp = imageData[i];\t\t\t\t\/\/ Wkadamy pierwszy bajt ( Blue ) do zmiennej pomocniczej\n\t\timageData[i] = imageData[i + 2];\t\/\/ Przekadamy ostatni ( Red ) na pierwsze miejsce\n\t\timageData[i + 2] = temp;\t\t\t\/\/ I zastpujemy ostatni wartoci ze zmiennej pomocniczej\n\t}\n\n\t\/\/ Zamykamy plik\n\tfileStream.close();\n\n\t\/\/ Musimy jeszcze zmieni format jeeli to nie jest obraz 32 Bity, tylko 24 Bity\n\tif ( bpp == 24 )\n\t\ttype = GL_RGB;\n\n\t\/*\tTeraz to dopiero jaja...\n\t\tKonwertujemy uzyskane dane na\n\t\tteksture(y). Ale dlaczego a 3?\n\t\tBy mie moliwo wyboru jakoci tekstury :)\n\t\tW zalenoci od parametrw jak ma si zachowywa\n\t\ttekstura, kiedy jest wiksza, lub mniejsza ni\n\t\tw oryginale, to zachowuje rn jako.\n\t\tDodatkowo w najwyszej jakoci uyty jest mipmaping, \n\t\tktry daje lepszy wygld gdy tekstura jest pod duym ktem.\n\t\tPo wicej informacji zapraszam do dokumentacji OpenGL (RTFM!) :) \n\t*\/\n\n\t\/\/ Stwrz pi niezdefinowanych tekstur\n\tglGenTextures( 1, &texture );\n\n\t\/\/ I same tekstury\n\n\t\/\/===================Najwysza jako MipMapingu====================\n\tglBindTexture( GL_TEXTURE_2D, texture );\t\t\t\/\/ Bind Our Texture\n\tglTexParameterf( GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR_MIPMAP_LINEAR ); \n\tglTexParameterf( GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR_MIPMAP_LINEAR );\n\tgluBuild2DMipmaps(GL_TEXTURE_2D, type, width, height, type, GL_UNSIGNED_BYTE, imageData );\n\n\t\/\/ Po wszystkim, te dane s ju niepotrzebne\n\tdelete[] imageData;\n\n\t\/\/ zaznaczamy, e by odczyt i potwierdzamy poprawne zaadowanie pliku\n\tloaded = true;\n\treturn true;\n}\n\nvoid ioTexture::Activate( unsigned int tex )\n{\n\tif( !loaded )\n\t\treturn;\n\n\tglBindTexture( GL_TEXTURE_2D, texture );\n}\n\nstd::string ioTexture::GetFile()\n{\n\treturn file;\n}\n\nvoid ioTexture::Free()\n{\n\tif( !loaded )\n\t\treturn;\n\n\tglDeleteTextures( 1, &texture );\n\n\tloaded = false;\n}\n\n\n\n\nioTexManager::ioTexManager()\n{\n}\n\nioTexManager::~ioTexManager()\n{\n\tClear();\n}\n\nioTexture* ioTexManager::Get( std::string filename )\n{\n\tif( filename == \"\" )\n\t{\n\t\tLog.Error( \"TEXMANAGER(): Pusty cig znakw!\" );\n\t\treturn 0;\n\t}\n\n\tunsigned int i;\n\tioTexture* NewTex;\n\tfor( i = 0; i < List.size(); i++ )\n\t{\n\t\tNewTex = GetTexture( i );\n\t\tif( NewTex->GetFile() == filename )\n\t\t\treturn NewTex;\n\t}\n\n\tNewTex = new ioTexture;\n\tif( !NewTex->LoadTGA( filename ) )\n\t{\n\t\tLog.Error( \"TEXMANAGER(): Nieudane zaadowanie tekstury: \" + filename );\n\t\tdelete NewTex;\n\t\treturn 0;\n\t}\n\n\tAddTexture( NewTex );\n\tLog.Log( \"TEXMANAGER(): Dodano now teksture: \" + filename );\n\t\n\treturn NewTex;\n}\n\nvoid ioTexManager::AddTexture( ioTexture *Tex )\n{\n\tList.push_back( Tex );\n}\n\nvoid ioTexManager::DeleteTexture( unsigned int index )\n{\n\tif( index >= List.size() )\n\t\treturn;\n\n\tdelete List[index];\n\tList.erase( List.begin() + index );\n}\n\nioTexture* ioTexManager::GetTexture( unsigned int index )\n{\n\tif( index >= List.size() )\n\t\treturn 0;\n\n\treturn List[index];\n}\n\nvoid ioTexManager::Clear()\n{\n\tfor(unsigned i = 0; i < List.size(); i++)\n\t{\n\t\tdelete List[i];\n\t}\n\tList.clear();\n}\n\nioTexManager TManager;<commit_msg>Texture loading correction - only binary files should be loaded.<commit_after>\/*\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nPlik:\tTexture.cpp\nAutor:\tReal_Noname (real_noname@wp.pl)\n(C):\tCODE RULERS (Real_Noname)\nWWW:\twww.coderulers.prv.pl\nOpis:\tPatrz -> Texture.h\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/*\/\n#include \"Texture.h\"\n#include \"Log.h\"\n#include <fstream>\n\nioTexture::ioTexture() :\n\tloaded(false),\n\tfile(\"-\"),\n\ttexture(0)\n{\n\tloaded = false;\n\tfile = \"-\";\n}\n\nioTexture::ioTexture( std::string filename ) :\n\tloaded(false),\n\tfile(\"-\"),\n\ttexture(0)\n{\n\tLoadTGA( filename );\n}\n\nioTexture::~ioTexture()\n{\n\tFree();\n}\n\nbool\tioTexture::LoadTGA( std::string filename )\n{\n\t\/*\teby odczyta plik TGA\n\t\tpotrzebne s odpowiednie\n\t\tzmienne pomocnicze.\n\t*\/\n\t\/\/\tTa tablica jest do porwnania i trzyma nagwek nieskompresowanego pliku TGA\n\tunsigned char TGAheader[12] = {0,0,2,0,0,0,0,0,0,0,0,0};\n\n\t\/\/ Waciwa tablica, ktra bdzie trzymac nagwek z pliku\n\tunsigned char TGAcompare[12];\t\t\t\t\n\t\n\t\/\/ Nagwek opisujcy zapisany obraz\n\tunsigned char header[6];\n\n\t\/\/ Zmienna bdzie trzyma ilo bajtw na pixel\n\tunsigned int bytesPerPixel;\t\t\t\t\n\n\t\/\/ Rozmiar tablicy trzymajcej dane z pliku\n\tunsigned int imageSize;\t\t\n\n\t\/\/ Tablica trzymajca dane ( a raczej wskanik na ni )\n\tunsigned char *imageData;\n\n\t\/\/ Zmienna pomocnicza\n\tunsigned int temp;\t\n\t\n\t\/\/ Typ zapisanego obrazu\n\tunsigned int type = GL_RGBA;\n\n\t\/\/ Ilo bitw kolorw obrazu\n\tunsigned int bpp;\n\n\t\/\/ Jego wysoko i szeroko\n\tunsigned int width;\n\tunsigned int height;\n\n\n\t\/\/ Otwieramy plik\n\tstd::fstream fileStream(filename, std::ios::in | std::ios::binary);\n\t\n\tLog.Log(\"TGATEX( \" + file + \" ): adowanie pliku \" + filename + \"...\");\n\t\/\/ Teraz sprawdzamy pare rzeczy\n\tif(\tfileStream.bad() || \/\/ Czy otwarcie pliku si udao\n\t\t!fileStream.read( (char*)TGAcompare, sizeof(char) * 12 ) ||\t\/\/ Czy mona odczyta 12 bajtw nagwka\n\t\tmemcmp( TGAheader, TGAcompare, sizeof( TGAheader ) ) != 0 ||                    \/\/ Czy to jest nagwek ktrego szukamy?\n\t\t!fileStream.read( (char*)header, sizeof(char) * 6 ) )\t\t\t\/\/ Jeeli tak, to czytamy nastpne 6 bajtw\n\t{\n\t\t\/\/ Na wypadek gdyby co si nie udao, to zwracamy false\n\t\tif ( fileStream.bad() )\n\t\t{\n\t\t\tLog.Error( \"TGATEX( \" + file + \" ): Nieprawidowa cieka lub plik nie istnieje!\" );\n\t\t\treturn false;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tLog.Error( \"TGATEX( \" + file + \" ): Bd z nagwkiem pliku!\" );\n\t\t\treturn false;\n\t\t}\n\t}\n\t\n\tif( loaded )\n\t{\n\t\tFree();\n\t\tLog.Report( \"TGATEX( \" + file + \" ): Przeadowanie tekstury na \" + filename );\n\t}\n\tfile = filename;\n\n\twidth  = header[1] * 256 + header[0];\t\t\/\/ Opracuj szeroko obrazka\n\theight = header[3] * 256 + header[2];\t\t\/\/ i jego wysokosc\n    \n \tif(\twidth  <= 0\t||\t\t\t\/\/ Jeeli szeroko\n\t\theight <= 0\t||\t\t\t\/\/ lub wysokoc jest mniejsza lub rwna zeru\n\t\t( header[4] != 24 && header[4] != 32 ) )\t\t\/\/ Lub to nie jest ani obraz 24 Bity, ani 32 Bity\n\t{\n\t\t\/\/ To zatrzymaj\n\t\tLog.Error( \"TGATEX( \" + file + \" ): Nieprawidowy obraz w pliku TGA!\" );\n\t\treturn false;\n\t}\n\n\t\/\/ Odczytaj Bity kolorw obrazu\n\tbpp = header[4];\n\n\t\/\/ Oblicz ile to bajtw na pixel\n\tbytesPerPixel = bpp \/ 8;\n\n\t\/\/ Oblicz wielko tablicy\n\timageSize = width * height * bytesPerPixel;\n\n\t\/\/ I zarezerwuj tyle miejsca\n\timageData = new unsigned char[imageSize];\n\tmemset(imageData, 0, sizeof(unsigned char) * imageSize);\n\n\t\/*\tTeraz troch teorii\n\t\teby zrobi teksture dla OpenGL\n\t\tpotrzebna jest tablica z informajcami\n\t\to kolorach. To jest poowa roboty, a pierwsz\n\t\tto wydoby te dane z pliku :) Co ju za chwile\n\t\twykonamy.\n\t*\/\n\t\n\tif(\timageData == NULL ||\t\/\/ Sprawd czy pami jest zarezerwowana\n\t\t!fileStream.read( (char*)imageData, imageSize * sizeof(char) ))\t\/\/ Sprawd czy NA PEWNO odczytalimy tyle z pliku ile chcielimy\n\t{\n\t\t\/\/ Jeeli co si nie zgadza, to przerywamy\n\t\tif( imageData != NULL)\n\t\t\tfree( imageData );\n\n\t\tLog.Error( \"TGATEX( \" + file + \" ): Bd pamici!\" );\n\t\treturn false;\t\n\t}\n\t;\n\n\t\/*\tA teraz may kruczek. Jak zapewne\n\t\twiadomo, s trzy kolory skadowe:\n\t\tczerwony (Red), zielony (Green) oraz\n\t\tniebieski (Blue), czyli poprawny kolotw format powinien\n\t\tby RGB. Ale z niewiadomych przyczyn w pliku TGA jest... BGR?\n\t\tMusimy to poprawi dlatego teraz zamieniamy\n\t\tmiejscami dwa feralne bajty.\n\t*\/\n\tfor( unsigned int i = 0; i < int( imageSize ); i += bytesPerPixel )\t\n\t{\t\t\t\t\t\t\t\t\n\t\ttemp = imageData[i];\t\t\t\t\/\/ Wkadamy pierwszy bajt ( Blue ) do zmiennej pomocniczej\n\t\timageData[i] = imageData[i + 2];\t\/\/ Przekadamy ostatni ( Red ) na pierwsze miejsce\n\t\timageData[i + 2] = temp;\t\t\t\/\/ I zastpujemy ostatni wartoci ze zmiennej pomocniczej\n\t}\n\n\t\/\/ Zamykamy plik\n\tfileStream.close();\n\n\t\/\/ Musimy jeszcze zmieni format jeeli to nie jest obraz 32 Bity, tylko 24 Bity\n\tif ( bpp == 24 )\n\t\ttype = GL_RGB;\n\n\t\/*\tTeraz to dopiero jaja...\n\t\tKonwertujemy uzyskane dane na\n\t\tteksture(y). Ale dlaczego a 3?\n\t\tBy mie moliwo wyboru jakoci tekstury :)\n\t\tW zalenoci od parametrw jak ma si zachowywa\n\t\ttekstura, kiedy jest wiksza, lub mniejsza ni\n\t\tw oryginale, to zachowuje rn jako.\n\t\tDodatkowo w najwyszej jakoci uyty jest mipmaping, \n\t\tktry daje lepszy wygld gdy tekstura jest pod duym ktem.\n\t\tPo wicej informacji zapraszam do dokumentacji OpenGL (RTFM!) :) \n\t*\/\n\n\t\/\/ Stwrz pi niezdefinowanych tekstur\n\tglGenTextures( 1, &texture );\n\n\t\/\/ I same tekstury\n\n\t\/\/===================Najwysza jako MipMapingu====================\n\tglBindTexture( GL_TEXTURE_2D, texture );\t\t\t\/\/ Bind Our Texture\n\tglTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR ); \n\tglTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR );\n\tglTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT );\n\tglTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT );\n\t\/\/glTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA, width, height, 0, type, GL_UNSIGNED_BYTE, imageData);\n\tgluBuild2DMipmaps(GL_TEXTURE_2D, GL_RGBA8, width, height, type, GL_UNSIGNED_BYTE, imageData );\n\tglBindTexture( GL_TEXTURE_2D, 0 );\n\n\t\/\/ Po wszystkim, te dane s ju niepotrzebne\n\tdelete[] imageData;\n\n\t\/\/ zaznaczamy, e by odczyt i potwierdzamy poprawne zaadowanie pliku\n\tloaded = true;\n\treturn true;\n}\n\nvoid ioTexture::Activate( unsigned int tex )\n{\n\tif( !loaded )\n\t\treturn;\n\n\tglBindTexture( GL_TEXTURE_2D, texture );\n}\n\nstd::string ioTexture::GetFile()\n{\n\treturn file;\n}\n\nvoid ioTexture::Free()\n{\n\tif( !loaded )\n\t\treturn;\n\n\tglDeleteTextures( 1, &texture );\n\n\tloaded = false;\n}\n\n\n\n\nioTexManager::ioTexManager()\n{\n}\n\nioTexManager::~ioTexManager()\n{\n\tClear();\n}\n\nioTexture* ioTexManager::Get( std::string filename )\n{\n\tif( filename == \"\" )\n\t{\n\t\tLog.Error( \"TEXMANAGER(): Pusty cig znakw!\" );\n\t\treturn 0;\n\t}\n\n\tunsigned int i;\n\tioTexture* NewTex;\n\tfor( i = 0; i < List.size(); i++ )\n\t{\n\t\tNewTex = GetTexture( i );\n\t\tif( NewTex->GetFile() == filename )\n\t\t\treturn NewTex;\n\t}\n\n\tNewTex = new ioTexture;\n\tif( !NewTex->LoadTGA( filename ) )\n\t{\n\t\tLog.Error( \"TEXMANAGER(): Nieudane zaadowanie tekstury: \" + filename );\n\t\tdelete NewTex;\n\t\treturn 0;\n\t}\n\n\tAddTexture( NewTex );\n\tLog.Log( \"TEXMANAGER(): Dodano now teksture: \" + filename );\n\t\n\treturn NewTex;\n}\n\nvoid ioTexManager::AddTexture( ioTexture *Tex )\n{\n\tList.push_back( Tex );\n}\n\nvoid ioTexManager::DeleteTexture( unsigned int index )\n{\n\tif( index >= List.size() )\n\t\treturn;\n\n\tdelete List[index];\n\tList.erase( List.begin() + index );\n}\n\nioTexture* ioTexManager::GetTexture( unsigned int index )\n{\n\tif( index >= List.size() )\n\t\treturn 0;\n\n\treturn List[index];\n}\n\nvoid ioTexManager::Clear()\n{\n\tfor(unsigned i = 0; i < List.size(); i++)\n\t{\n\t\tdelete List[i];\n\t}\n\tList.clear();\n}\n\nioTexManager TManager;<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\/\/ (C) Copyright 2015 Just Software Solutions Ltd\n\/\/\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/\n\/\/ Boost Software License - Version 1.0 - August 17th, 2003\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person or\n\/\/ organization obtaining a copy of the software and accompanying\n\/\/ documentation covered by this license (the \"Software\") to use,\n\/\/ reproduce, display, distribute, execute, and transmit the\n\/\/ Software, and to prepare derivative works of the Software, and\n\/\/ to permit third-parties to whom the Software is furnished to\n\/\/ do so, all subject to the following:\n\/\/\n\/\/ The copyright notices in the Software and this entire\n\/\/ statement, including the above license grant, this restriction\n\/\/ and the following disclaimer, must be included in all copies\n\/\/ of the Software, in whole or in part, and all derivative works\n\/\/ of the Software, unless such copies or derivative works are\n\/\/ solely in the form of machine-executable object code generated\n\/\/ by a source language processor.\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\n\/\/ PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE\n\/\/ LIABLE FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN\n\/\/ CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n\/\/ CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\n\/\/ Thanks! https:\/\/www.justsoftwaresolutions.co.uk\/cplusplus\/using-enum-classes-as-bitfields.html\n\n#include<type_traits>\n\ntemplate<typename E>\nstruct enable_bitmask_operators\n{\n\tstatic const bool enable = false;\n};\n\ntemplate<typename E>\ntypename std::enable_if<enable_bitmask_operators<E>::enable, E>::type\noperator|(E lhs, E rhs)\n{\n\ttypedef typename std::underlying_type<E>::type underlying;\n\treturn static_cast<E>(static_cast<underlying>(lhs) | static_cast<underlying>(rhs));\n}\n\ntemplate<typename E>\ntypename std::enable_if<enable_bitmask_operators<E>::enable, E>::type\noperator&(E lhs, E rhs)\n{\n\ttypedef typename std::underlying_type<E>::type underlying;\n\treturn static_cast<E>(static_cast<underlying>(lhs) & static_cast<underlying>(rhs));\n}\n\ntemplate<typename E>\ntypename std::enable_if<enable_bitmask_operators<E>::enable, E>::type\noperator^(E lhs, E rhs)\n{\n\ttypedef typename std::underlying_type<E>::type underlying;\n\treturn static_cast<E>(static_cast<underlying>(lhs) ^ static_cast<underlying>(rhs));\n}\n\ntemplate<typename E>\ntypename std::enable_if<enable_bitmask_operators<E>::enable, E>::type\noperator~(E lhs)\n{\n\ttypedef typename std::underlying_type<E>::type underlying;\n\treturn static_cast<E>(~static_cast<underlying>(lhs));\n}\n\ntemplate<typename E>\ntypename std::enable_if<enable_bitmask_operators<E>::enable, E&>::type\noperator|=(E& lhs, E rhs)\n{\n\ttypedef typename std::underlying_type<E>::type underlying;\n\tlhs = static_cast<E>(static_cast<underlying>(lhs) | static_cast<underlying>(rhs));\n\treturn lhs;\n}\n\ntemplate<typename E>\ntypename std::enable_if<enable_bitmask_operators<E>::enable, E&>::type\noperator&=(E& lhs, E rhs)\n{\n\ttypedef typename std::underlying_type<E>::type underlying;\n\tlhs = static_cast<E>( static_cast<underlying>(lhs) & static_cast<underlying>(rhs));\n\treturn lhs;\n}\n\ntemplate<typename E>\ntypename std::enable_if<enable_bitmask_operators<E>::enable, E&>::type\noperator^=(E& lhs, E rhs)\n{\n\ttypedef typename std::underlying_type<E>::type underlying;\n\tlhs = static_cast<E>(static_cast<underlying>(lhs) ^ static_cast<underlying>(rhs));\n\treturn lhs;\n}\n<commit_msg>Fixed formatting misshaps caused by CLion in BitmaskOperators<commit_after>#pragma once\n\/\/ (C) Copyright 2015 Just Software Solutions Ltd\n\/\/\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/\n\/\/ Boost Software License - Version 1.0 - August 17th, 2003\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person or\n\/\/ organization obtaining a copy of the software and accompanying\n\/\/ documentation covered by this license (the \"Software\") to use,\n\/\/ reproduce, display, distribute, execute, and transmit the\n\/\/ Software, and to prepare derivative works of the Software, and\n\/\/ to permit third-parties to whom the Software is furnished to\n\/\/ do so, all subject to the following:\n\/\/\n\/\/ The copyright notices in the Software and this entire\n\/\/ statement, including the above license grant, this restriction\n\/\/ and the following disclaimer, must be included in all copies\n\/\/ of the Software, in whole or in part, and all derivative works\n\/\/ of the Software, unless such copies or derivative works are\n\/\/ solely in the form of machine-executable object code generated\n\/\/ by a source language processor.\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\n\/\/ PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE\n\/\/ LIABLE FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN\n\/\/ CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n\/\/ CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\n\/\/ Thanks! https:\/\/www.justsoftwaresolutions.co.uk\/cplusplus\/using-enum-classes-as-bitfields.html\n\n#include<type_traits>\n\ntemplate<typename E>\nstruct enable_bitmask_operators\n{\n\tstatic const bool enable = false;\n};\n\ntemplate<typename E>\ntypename std::enable_if<enable_bitmask_operators<E>::enable, E>::type operator|(E lhs, E rhs)\n{\n\ttypedef typename std::underlying_type<E>::type underlying;\n\treturn static_cast<E>(static_cast<underlying>(lhs) | static_cast<underlying>(rhs));\n}\n\ntemplate<typename E>\ntypename std::enable_if<enable_bitmask_operators<E>::enable, E>::type operator&(E lhs, E rhs)\n{\n\ttypedef typename std::underlying_type<E>::type underlying;\n\treturn static_cast<E>(static_cast<underlying>(lhs) & static_cast<underlying>(rhs));\n}\n\ntemplate<typename E>\ntypename std::enable_if<enable_bitmask_operators<E>::enable, E>::type operator^(E lhs, E rhs)\n{\n\ttypedef typename std::underlying_type<E>::type underlying;\n\treturn static_cast<E>(static_cast<underlying>(lhs) ^ static_cast<underlying>(rhs));\n}\n\ntemplate<typename E>\ntypename std::enable_if<enable_bitmask_operators<E>::enable, E>::type operator~(E lhs)\n{\n\ttypedef typename std::underlying_type<E>::type underlying;\n\treturn static_cast<E>(~static_cast<underlying>(lhs));\n}\n\ntemplate<typename E>\ntypename std::enable_if<enable_bitmask_operators<E>::enable, E&>::type operator|=(E& lhs, E rhs)\n{\n\ttypedef typename std::underlying_type<E>::type underlying;\n\tlhs = static_cast<E>(static_cast<underlying>(lhs) | static_cast<underlying>(rhs));\n\treturn lhs;\n}\n\ntemplate<typename E>\ntypename std::enable_if<enable_bitmask_operators<E>::enable, E&>::type operator&=(E& lhs, E rhs)\n{\n\ttypedef typename std::underlying_type<E>::type underlying;\n\tlhs = static_cast<E>( static_cast<underlying>(lhs) & static_cast<underlying>(rhs));\n\treturn lhs;\n}\n\ntemplate<typename E>\ntypename std::enable_if<enable_bitmask_operators<E>::enable, E&>::type operator^=(E& lhs, E rhs)\n{\n\ttypedef typename std::underlying_type<E>::type underlying;\n\tlhs = static_cast<E>(static_cast<underlying>(lhs) ^ static_cast<underlying>(rhs));\n\treturn lhs;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Update main.cpp<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"MessageDirector.h\"\n#include <algorithm>\n#include <functional>\n#include <boost\/icl\/interval_bounds.hpp>\n\n#include \"core\/global.h\"\n#include \"core\/msgtypes.h\"\n#include \"config\/ConfigVariable.h\"\n#include \"config\/constraints.h\"\n#include \"net\/TcpAcceptor.h\"\n#include \"MDNetworkParticipant.h\"\n#include \"MDNetworkUpstream.h\"\n\nusing boost::asio::ip::tcp;\n\nstatic ConfigGroup md_config(\"messagedirector\");\nstatic ConfigVariable<std::string> bind_addr(\"bind\", \"unspecified\", md_config);\nstatic ConfigVariable<std::string> connect_addr(\"connect\", \"unspecified\", md_config);\nstatic ValidAddressConstraint valid_bind_addr(bind_addr);\nstatic ValidAddressConstraint valid_connect_addr(connect_addr);\nstatic ConfigVariable<bool> threaded_mode(\"threaded\", true, md_config);\n\nstatic ConfigGroup daemon_config(\"daemon\");\nstatic ConfigVariable<std::string> daemon_name(\"name\", \"<unnamed>\", daemon_config);\nstatic ConfigVariable<std::string> daemon_url(\"url\", \"\", daemon_config);\n\nMessageDirector MessageDirector::singleton;\n\n\nMessageDirector::MessageDirector() :  m_initialized(false), m_net_acceptor(NULL), m_upstream(NULL),\n    m_thread(NULL), m_main_thread(std::this_thread::get_id()), m_log(\"msgdir\", \"Message Director\")\n{\n}\n\nMessageDirector::~MessageDirector()\n{\n    shutdown_threading();\n\n    for(auto it = m_participants.begin(); it != m_participants.end(); ++it) {\n        delete *it;\n    }\n    m_participants.clear();\n}\n\nvoid MessageDirector::init_network()\n{\n    if(!m_initialized) {\n        \/\/ Bind to port and listen for downstream servers\n        if(bind_addr.get_val() != \"unspecified\") {\n            m_log.info() << \"Opening listening socket...\" << std::endl;\n\n            TcpAcceptorCallback callback = std::bind(&MessageDirector::handle_connection,\n                                           this, std::placeholders::_1);\n            m_net_acceptor = new TcpAcceptor(io_service, callback);\n            boost::system::error_code ec;\n            ec = m_net_acceptor->bind(bind_addr.get_val(), 7199);\n            if(ec.value() != 0) {\n                m_log.fatal() << \"Could not bind listening port: \"\n                              << bind_addr.get_val() << std::endl;\n                m_log.fatal() << \"Error code: \" << ec.value()\n                              << \"(\" << ec.category().message(ec.value()) << \")\"\n                              << std::endl;\n                exit(1);\n            }\n            m_net_acceptor->start();\n        }\n\n        \/\/ Connect to upstream server and start handling received messages\n        if(connect_addr.get_val() != \"unspecified\") {\n            m_log.info() << \"Connecting upstream...\" << std::endl;\n\n            MDNetworkUpstream *upstream = new MDNetworkUpstream(this);\n\n            boost::system::error_code ec;\n            upstream->connect(connect_addr.get_val());\n            if(ec.value() != 0) {\n                m_log.fatal() << \"Could not connect to remote MD at IP: \"\n                              << connect_addr.get_val() << std::endl;\n                m_log.fatal() << \"Error code: \" << ec.value()\n                              << \"(\" << ec.category().message(ec.value()) << \")\"\n                              << std::endl;\n                exit(1);\n            }\n\n            m_upstream = upstream;\n        }\n\n        if(threaded_mode.get_val()) {\n            m_thread = new std::thread(std::bind(&MessageDirector::routing_thread, this));\n        }\n\n        m_initialized = true;\n    }\n}\n\nvoid MessageDirector::shutdown_threading()\n{\n    if(!m_thread) {\n        return;\n    }\n\n    \/\/ Signal routing thread to shut down:\n    {\n        std::lock_guard<std::mutex> lock(m_messages_lock);\n        m_shutdown = true;\n        m_cv.notify_one();\n    }\n\n    \/\/ Wait for it to do so:\n    m_thread->join();\n    delete m_thread;\n}\n\nvoid MessageDirector::route_datagram(MDParticipantInterface *p, DatagramHandle dg)\n{\n    if(m_thread) {\n        \/\/ Threaded mode! First, we have to get the lock to our queue:\n        std::lock_guard<std::mutex> lock(m_messages_lock);\n\n        \/\/ Now, we put the message into our queue and ring the bell:\n        m_messages.push(std::make_pair(p, dg));\n        m_cv.notify_one();\n    } else if(std::this_thread::get_id() != m_main_thread) {\n        \/\/ We aren't working in threaded mode, but we aren't in the main thread\n        \/\/ either. For safety, we should post this down to the main thread.\n        io_service.post(boost::bind(&MessageDirector::process_datagram, this, p, dg));\n    } else {\n        \/\/ Main thread; we can just process it here.\n        process_datagram(p, dg);\n    }\n}\n\n\/\/ This function runs in a thread; it loops until it's told to shut down:\nvoid MessageDirector::routing_thread()\n{\n    std::unique_lock<std::mutex> lock(m_messages_lock);\n\n    while(true) {\n        \/\/ Wait for something interesting to handle...\n        while(m_messages.empty() && !m_shutdown) {\n            m_cv.wait(lock);\n        }\n\n        if(m_shutdown) {\n            \/\/ Ehh, we've been told to shut off:\n            return;\n        }\n\n        \/\/ Get and process the message:\n        auto msg = m_messages.front();\n        m_messages.pop();\n\n        lock.unlock();\n        process_datagram(msg.first, msg.second);\n        lock.lock();\n    }\n}\n\nvoid MessageDirector::process_datagram(MDParticipantInterface *p, DatagramHandle dg)\n{\n    m_log.trace() << \"Processing datagram....\" << std::endl;\n\n    std::list<channel_t> channels;\n    DatagramIterator dgi(dg);\n    try {\n        uint8_t channel_count = dgi.read_uint8();\n\n        \/\/ Route messages to participants\n        auto receive_log = m_log.trace();\n        receive_log << \"Receivers: \";\n        for(uint8_t i = 0; i < channel_count; ++i) {\n            channel_t channel = dgi.read_channel();\n            receive_log << channel << \", \";\n            channels.push_back(channel);\n        }\n        receive_log << std::endl;\n    } catch(DatagramIteratorEOF &) {\n        if(p) {\n            \/\/ Log error with receivers output\n            m_log.error() << \"Detected truncated datagram reading header from '\"\n                          << p->m_name << \"'.\\n\";\n        } else {\n            \/\/ Log error with receivers output\n            m_log.error() << \"Detected truncated datagram reading header from unknown participant.\\n\";\n        }\n        return;\n    }\n\n\n    \/\/ Lock the participants while we're using values from ChannelMap,\n    \/\/ we don't want to delete the participants while we're iterating through them.\n    {\n        std::unique_lock<std::mutex> lock(m_participants_lock);\n\n        std::set<ChannelSubscriber*> receiving_participants;\n        lookup_channels(channels, receiving_participants);\n\n        \/\/ Participants never send to themselves\n        if(p) { receiving_participants.erase(p); }\n\n        \/\/ Dispatch the datagram to each participant\n        for(auto it = receiving_participants.begin(); it != receiving_participants.end(); ++it) {\n            auto participant = static_cast<MDParticipantInterface*>(*it);\n            DatagramIterator msg_dgi(dg, dgi.tell());\n            try {\n                participant->handle_datagram(dg, msg_dgi);\n            } catch(DatagramIteratorEOF &) {\n                \/\/ Log error with receivers output\n                m_log.error() << \"Detected truncated datagram in handle_datagram for '\"\n                              << participant->m_name << \"' from participant '\"\n                              << p->m_name << \"'.\\n\";\n                return;\n            }\n        }\n    }\n\n    if(p && m_upstream) { \/\/ Send message upstream\n        m_upstream->handle_datagram(dg);\n        m_log.trace() << \"...routing upstream.\" << std::endl;\n    } else if(!p) { \/\/ If there is no participant, then it came from the upstream\n        m_log.trace() << \"...not routing upstream: It came from there.\" << std::endl;\n    } else { \/\/ Otherwise is root node\n        m_log.trace() << \"...not routing upstream: There is none.\" << std::endl;\n    }\n}\n\nvoid MessageDirector::on_add_channel(channel_t c)\n{\n    if(m_upstream) {\n        \/\/ Send upstream control message\n        m_upstream->subscribe_channel(c);\n    }\n}\n\nvoid MessageDirector::on_remove_channel(channel_t c)\n{\n    if(m_upstream) {\n        \/\/ Send upstream control message\n        m_upstream->unsubscribe_channel(c);\n    }\n}\n\nvoid MessageDirector::on_add_range(channel_t lo, channel_t hi)\n{\n    if(m_upstream) {\n        \/\/ Send upstream control message\n        m_upstream->subscribe_range(lo, hi);\n    }\n}\n\nvoid MessageDirector::on_remove_range(channel_t lo, channel_t hi)\n{\n    if(m_upstream) {\n        \/\/ Send upstream control message\n        m_upstream->unsubscribe_range(lo, hi);\n    }\n}\n\nvoid MessageDirector::handle_connection(tcp::socket *socket)\n{\n    boost::asio::ip::tcp::endpoint remote;\n    remote = socket->remote_endpoint();\n    m_log.info() << \"Got an incoming connection from \"\n                 << remote.address() << \":\" << remote.port() << std::endl;\n    new MDNetworkParticipant(socket); \/\/ It deletes itself when connection is lost\n}\n\nvoid MessageDirector::add_participant(MDParticipantInterface* p)\n{\n    std::lock_guard<std::mutex> lock(m_participants_lock);\n\n    m_participants.insert(m_participants.end(), p);\n}\n\nvoid MessageDirector::remove_participant(MDParticipantInterface* p)\n{\n    std::lock_guard<std::mutex> lock(m_participants_lock);\n\n    unsubscribe_all(p);\n\n    \/\/ Stop tracking participant\n    m_participants.remove(p);\n\n    \/\/ Send out any post-remove messages the participant may have added.\n    \/\/ N.B. this is done last, because we don't want to send messages\n    \/\/ through the Director while a participant is being removed, as\n    \/\/ certain data structures may not have their invariants satisfied\n    \/\/ during that time.\n    p->post_remove();\n}\n\nvoid MessageDirector::preroute_post_remove(channel_t sender, DatagramHandle post_remove)\n{\n    \/\/ Add post remove upstream\n    if(m_upstream != nullptr) {\n        DatagramPtr dg = Datagram::create(CONTROL_ADD_POST_REMOVE);\n        dg->add_channel(sender);\n        dg->add_blob(post_remove);\n        m_upstream->handle_datagram(dg);\n    }\n}\n\nvoid MessageDirector::recall_post_removes(channel_t sender)\n{\n    \/\/ Clear post removes upstream\n    if(m_upstream != nullptr) {\n        DatagramPtr dg = Datagram::create(CONTROL_CLEAR_POST_REMOVES);\n        dg->add_channel(sender);\n        m_upstream->handle_datagram(dg);\n    }\n}\n\nvoid MessageDirector::receive_datagram(DatagramHandle dg)\n{\n    route_datagram(NULL, dg);\n}\n\nvoid MessageDirector::receive_disconnect()\n{\n    m_log.fatal() << \"Lost connection to upstream md\" << std::endl;\n    exit(1);\n}\n<commit_msg>Revert \"Bugfix: Lock participants while distributing a datagram.\"<commit_after>#include \"MessageDirector.h\"\n#include <algorithm>\n#include <functional>\n#include <boost\/icl\/interval_bounds.hpp>\n\n#include \"core\/global.h\"\n#include \"core\/msgtypes.h\"\n#include \"config\/ConfigVariable.h\"\n#include \"config\/constraints.h\"\n#include \"net\/TcpAcceptor.h\"\n#include \"MDNetworkParticipant.h\"\n#include \"MDNetworkUpstream.h\"\n\nusing boost::asio::ip::tcp;\n\nstatic ConfigGroup md_config(\"messagedirector\");\nstatic ConfigVariable<std::string> bind_addr(\"bind\", \"unspecified\", md_config);\nstatic ConfigVariable<std::string> connect_addr(\"connect\", \"unspecified\", md_config);\nstatic ValidAddressConstraint valid_bind_addr(bind_addr);\nstatic ValidAddressConstraint valid_connect_addr(connect_addr);\nstatic ConfigVariable<bool> threaded_mode(\"threaded\", true, md_config);\n\nstatic ConfigGroup daemon_config(\"daemon\");\nstatic ConfigVariable<std::string> daemon_name(\"name\", \"<unnamed>\", daemon_config);\nstatic ConfigVariable<std::string> daemon_url(\"url\", \"\", daemon_config);\n\nMessageDirector MessageDirector::singleton;\n\n\nMessageDirector::MessageDirector() :  m_initialized(false), m_net_acceptor(NULL), m_upstream(NULL),\n    m_thread(NULL), m_main_thread(std::this_thread::get_id()), m_log(\"msgdir\", \"Message Director\")\n{\n}\n\nMessageDirector::~MessageDirector()\n{\n    shutdown_threading();\n\n    for(auto it = m_participants.begin(); it != m_participants.end(); ++it) {\n        delete *it;\n    }\n    m_participants.clear();\n}\n\nvoid MessageDirector::init_network()\n{\n    if(!m_initialized) {\n        \/\/ Bind to port and listen for downstream servers\n        if(bind_addr.get_val() != \"unspecified\") {\n            m_log.info() << \"Opening listening socket...\" << std::endl;\n\n            TcpAcceptorCallback callback = std::bind(&MessageDirector::handle_connection,\n                                           this, std::placeholders::_1);\n            m_net_acceptor = new TcpAcceptor(io_service, callback);\n            boost::system::error_code ec;\n            ec = m_net_acceptor->bind(bind_addr.get_val(), 7199);\n            if(ec.value() != 0) {\n                m_log.fatal() << \"Could not bind listening port: \"\n                              << bind_addr.get_val() << std::endl;\n                m_log.fatal() << \"Error code: \" << ec.value()\n                              << \"(\" << ec.category().message(ec.value()) << \")\"\n                              << std::endl;\n                exit(1);\n            }\n            m_net_acceptor->start();\n        }\n\n        \/\/ Connect to upstream server and start handling received messages\n        if(connect_addr.get_val() != \"unspecified\") {\n            m_log.info() << \"Connecting upstream...\" << std::endl;\n\n            MDNetworkUpstream *upstream = new MDNetworkUpstream(this);\n\n            boost::system::error_code ec;\n            upstream->connect(connect_addr.get_val());\n            if(ec.value() != 0) {\n                m_log.fatal() << \"Could not connect to remote MD at IP: \"\n                              << connect_addr.get_val() << std::endl;\n                m_log.fatal() << \"Error code: \" << ec.value()\n                              << \"(\" << ec.category().message(ec.value()) << \")\"\n                              << std::endl;\n                exit(1);\n            }\n\n            m_upstream = upstream;\n        }\n\n        if(threaded_mode.get_val()) {\n            m_thread = new std::thread(std::bind(&MessageDirector::routing_thread, this));\n        }\n\n        m_initialized = true;\n    }\n}\n\nvoid MessageDirector::shutdown_threading()\n{\n    if(!m_thread) {\n        return;\n    }\n\n    \/\/ Signal routing thread to shut down:\n    {\n        std::lock_guard<std::mutex> lock(m_messages_lock);\n        m_shutdown = true;\n        m_cv.notify_one();\n    }\n\n    \/\/ Wait for it to do so:\n    m_thread->join();\n    delete m_thread;\n}\n\nvoid MessageDirector::route_datagram(MDParticipantInterface *p, DatagramHandle dg)\n{\n    if(m_thread) {\n        \/\/ Threaded mode! First, we have to get the lock to our queue:\n        std::lock_guard<std::mutex> lock(m_messages_lock);\n\n        \/\/ Now, we put the message into our queue and ring the bell:\n        m_messages.push(std::make_pair(p, dg));\n        m_cv.notify_one();\n    } else if(std::this_thread::get_id() != m_main_thread) {\n        \/\/ We aren't working in threaded mode, but we aren't in the main thread\n        \/\/ either. For safety, we should post this down to the main thread.\n        io_service.post(boost::bind(&MessageDirector::process_datagram, this, p, dg));\n    } else {\n        \/\/ Main thread; we can just process it here.\n        process_datagram(p, dg);\n    }\n}\n\n\/\/ This function runs in a thread; it loops until it's told to shut down:\nvoid MessageDirector::routing_thread()\n{\n    std::unique_lock<std::mutex> lock(m_messages_lock);\n\n    while(true) {\n        \/\/ Wait for something interesting to handle...\n        while(m_messages.empty() && !m_shutdown) {\n            m_cv.wait(lock);\n        }\n\n        if(m_shutdown) {\n            \/\/ Ehh, we've been told to shut off:\n            return;\n        }\n\n        \/\/ Get and process the message:\n        auto msg = m_messages.front();\n        m_messages.pop();\n\n        lock.unlock();\n        process_datagram(msg.first, msg.second);\n        lock.lock();\n    }\n}\n\nvoid MessageDirector::process_datagram(MDParticipantInterface *p, DatagramHandle dg)\n{\n    m_log.trace() << \"Processing datagram....\" << std::endl;\n\n    std::list<channel_t> channels;\n    DatagramIterator dgi(dg);\n    std::set<ChannelSubscriber*> receiving_participants;\n    try {\n        uint8_t channel_count = dgi.read_uint8();\n\n        \/\/ Route messages to participants\n        auto receive_log = m_log.trace();\n        receive_log << \"Receivers: \";\n        for(uint8_t i = 0; i < channel_count; ++i) {\n            channel_t channel = dgi.read_channel();\n            receive_log << channel << \", \";\n            channels.push_back(channel);\n        }\n        receive_log << std::endl;\n    } catch(DatagramIteratorEOF &) {\n        if(p) {\n            \/\/ Log error with receivers output\n            m_log.error() << \"Detected truncated datagram reading header from '\"\n                          << p->m_name << \"'.\\n\";\n        } else {\n            \/\/ Log error with receivers output\n            m_log.error() << \"Detected truncated datagram reading header from unknown participant.\\n\";\n        }\n        return;\n    }\n\n    lookup_channels(channels, receiving_participants);\n\n    if(p) {\n        receiving_participants.erase(p);\n    }\n\n    for(auto it = receiving_participants.begin(); it != receiving_participants.end(); ++it) {\n        auto participant = static_cast<MDParticipantInterface*>(*it);\n        DatagramIterator msg_dgi(dg, dgi.tell());\n        try {\n            participant->handle_datagram(dg, msg_dgi);\n        } catch(DatagramIteratorEOF &) {\n            \/\/ Log error with receivers output\n            m_log.error() << \"Detected truncated datagram in handle_datagram for '\" << participant->m_name <<\n                          \"'\"\n                          \" from participant '\" << p->m_name << \"'.\" << std::endl;\n            return;\n        }\n    }\n\n    if(p && m_upstream) { \/\/ Send message upstream\n        m_upstream->handle_datagram(dg);\n        m_log.trace() << \"...routing upstream.\" << std::endl;\n    } else if(!p) { \/\/ If there is no participant, then it came from the upstream\n        m_log.trace() << \"...not routing upstream: It came from there.\" << std::endl;\n    } else { \/\/ Otherwise is root node\n        m_log.trace() << \"...not routing upstream: There is none.\" << std::endl;\n    }\n}\n\nvoid MessageDirector::on_add_channel(channel_t c)\n{\n    if(m_upstream) {\n        \/\/ Send upstream control message\n        m_upstream->subscribe_channel(c);\n    }\n}\n\nvoid MessageDirector::on_remove_channel(channel_t c)\n{\n    if(m_upstream) {\n        \/\/ Send upstream control message\n        m_upstream->unsubscribe_channel(c);\n    }\n}\n\nvoid MessageDirector::on_add_range(channel_t lo, channel_t hi)\n{\n    if(m_upstream) {\n        \/\/ Send upstream control message\n        m_upstream->subscribe_range(lo, hi);\n    }\n}\n\nvoid MessageDirector::on_remove_range(channel_t lo, channel_t hi)\n{\n    if(m_upstream) {\n        \/\/ Send upstream control message\n        m_upstream->unsubscribe_range(lo, hi);\n    }\n}\n\nvoid MessageDirector::handle_connection(tcp::socket *socket)\n{\n    boost::asio::ip::tcp::endpoint remote;\n    remote = socket->remote_endpoint();\n    m_log.info() << \"Got an incoming connection from \"\n                 << remote.address() << \":\" << remote.port() << std::endl;\n    new MDNetworkParticipant(socket); \/\/ It deletes itself when connection is lost\n}\n\nvoid MessageDirector::add_participant(MDParticipantInterface* p)\n{\n    std::lock_guard<std::mutex> lock(m_participants_lock);\n\n    m_participants.insert(m_participants.end(), p);\n}\n\nvoid MessageDirector::remove_participant(MDParticipantInterface* p)\n{\n    std::lock_guard<std::mutex> lock(m_participants_lock);\n\n    unsubscribe_all(p);\n\n    \/\/ Stop tracking participant\n    m_participants.remove(p);\n\n    \/\/ Send out any post-remove messages the participant may have added.\n    \/\/ N.B. this is done last, because we don't want to send messages\n    \/\/ through the Director while a participant is being removed, as\n    \/\/ certain data structures may not have their invariants satisfied\n    \/\/ during that time.\n    p->post_remove();\n}\n\nvoid MessageDirector::preroute_post_remove(channel_t sender, DatagramHandle post_remove)\n{\n    \/\/ Add post remove upstream\n    if(m_upstream != nullptr) {\n        DatagramPtr dg = Datagram::create(CONTROL_ADD_POST_REMOVE);\n        dg->add_channel(sender);\n        dg->add_blob(post_remove);\n        m_upstream->handle_datagram(dg);\n    }\n}\n\nvoid MessageDirector::recall_post_removes(channel_t sender)\n{\n    \/\/ Clear post removes upstream\n    if(m_upstream != nullptr) {\n        DatagramPtr dg = Datagram::create(CONTROL_CLEAR_POST_REMOVES);\n        dg->add_channel(sender);\n        m_upstream->handle_datagram(dg);\n    }\n}\n\nvoid MessageDirector::receive_datagram(DatagramHandle dg)\n{\n    route_datagram(NULL, dg);\n}\n\nvoid MessageDirector::receive_disconnect()\n{\n    m_log.fatal() << \"Lost connection to upstream md\" << std::endl;\n    exit(1);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file sparse_coding_test.cpp\n *\n * Test for Sparse Coding\n *\/\n\n\/\/ Note: We don't use BOOST_REQUIRE_CLOSE in the code below because we need\n\/\/ to use FPC_WEAK, and it's not at all intuitive how to do that.\n\n#include <mlpack\/core.hpp>\n#include <mlpack\/methods\/sparse_coding\/sparse_coding.hpp>\n\n#include <boost\/test\/unit_test.hpp>\n#include \"old_boost_test_definitions.hpp\"\n#include \"serialization.hpp\"\n\nusing namespace arma;\nusing namespace mlpack;\nusing namespace mlpack::regression;\nusing namespace mlpack::sparse_coding;\n\nBOOST_AUTO_TEST_SUITE(SparseCodingTest);\n\nvoid SCVerifyCorrectness(vec beta, vec errCorr, double lambda)\n{\n  const double tol = 1e-12;\n  size_t nDims = beta.n_elem;\n  for(size_t j = 0; j < nDims; j++)\n  {\n    if (beta(j) == 0)\n    {\n      \/\/ Make sure that errCorr(j) <= lambda.\n      BOOST_REQUIRE_SMALL(std::max(fabs(errCorr(j)) - lambda, 0.0), tol);\n    }\n    else if (beta(j) < 0)\n    {\n      \/\/ Make sure that errCorr(j) == lambda.\n      BOOST_REQUIRE_SMALL(errCorr(j) - lambda, tol);\n    }\n    else \/\/ beta(j) > 0.\n    {\n      \/\/ Make sure that errCorr(j) == -lambda.\n      BOOST_REQUIRE_SMALL(errCorr(j) + lambda, tol);\n    }\n  }\n}\n\nBOOST_AUTO_TEST_CASE(SparseCodingTestCodingStepLasso)\n{\n  double lambda1 = 0.1;\n  uword nAtoms = 25;\n\n  mat X;\n  X.load(\"mnist_first250_training_4s_and_9s.arm\");\n  uword nPoints = X.n_cols;\n\n  \/\/ Normalize each point since these are images.\n  for (uword i = 0; i < nPoints; ++i) {\n    X.col(i) \/= norm(X.col(i), 2);\n  }\n\n  SparseCoding sc(nAtoms, lambda1);\n  mat Z;\n  DataDependentRandomInitializer::Initialize(X, 25, sc.Dictionary());\n  sc.Encode(X, Z);\n\n  mat D = sc.Dictionary();\n\n  for (uword i = 0; i < nPoints; ++i)\n  {\n    vec errCorr = trans(D) * (D * Z.unsafe_col(i) - X.unsafe_col(i));\n    SCVerifyCorrectness(Z.unsafe_col(i), errCorr, lambda1);\n  }\n}\n\nBOOST_AUTO_TEST_CASE(SparseCodingTestCodingStepElasticNet)\n{\n  double lambda1 = 0.1;\n  double lambda2 = 0.2;\n  uword nAtoms = 25;\n\n  mat X;\n  X.load(\"mnist_first250_training_4s_and_9s.arm\");\n  uword nPoints = X.n_cols;\n\n  \/\/ Normalize each point since these are images.\n  for (uword i = 0; i < nPoints; ++i)\n    X.col(i) \/= norm(X.col(i), 2);\n\n  SparseCoding sc(nAtoms, lambda1, lambda2);\n  mat Z;\n  DataDependentRandomInitializer::Initialize(X, 25, sc.Dictionary());\n  sc.Encode(X, Z);\n\n  mat D = sc.Dictionary();\n\n  for(uword i = 0; i < nPoints; ++i)\n  {\n    vec errCorr =\n      (trans(D) * D + lambda2 * eye(nAtoms, nAtoms)) * Z.unsafe_col(i)\n      - trans(D) * X.unsafe_col(i);\n\n    SCVerifyCorrectness(Z.unsafe_col(i), errCorr, lambda1);\n  }\n}\n\nBOOST_AUTO_TEST_CASE(SparseCodingTestDictionaryStep)\n{\n  const double tol = 1e-6;\n\n  double lambda1 = 0.1;\n  uword nAtoms = 25;\n\n  mat X;\n  X.load(\"mnist_first250_training_4s_and_9s.arm\");\n  uword nPoints = X.n_cols;\n\n  \/\/ Normalize each point since these are images.\n  for (uword i = 0; i < nPoints; ++i)\n    X.col(i) \/= norm(X.col(i), 2);\n\n  SparseCoding sc(nAtoms, lambda1, 0.0, 0, 0.01, 1e-8);\n  mat Z;\n  DataDependentRandomInitializer::Initialize(X, 25, sc.Dictionary());\n  sc.Encode(X, Z);\n\n  mat D = sc.Dictionary();\n\n  uvec adjacencies = find(Z);\n  double normGradient = sc.OptimizeDictionary(X, Z, adjacencies);\n\n  BOOST_REQUIRE_SMALL(normGradient, tol);\n}\n\nBOOST_AUTO_TEST_CASE(SerializationTest)\n{\n  mat X = randu<mat>(100, 100);\n  size_t nAtoms = 25;\n\n  SparseCoding sc(nAtoms, 0.05, 0.1);\n  sc.Train(X);\n\n  mat Y = randu<mat>(100, 200);\n  mat codes;\n  sc.Encode(Y, codes);\n\n  SparseCoding scXml(50, 0.01), scText(nAtoms, 0.05), scBinary(0, 0.0);\n  SerializeObjectAll(sc, scXml, scText, scBinary);\n\n  CheckMatrices(sc.Dictionary(), scXml.Dictionary(), scText.Dictionary(),\n      scBinary.Dictionary());\n\n  mat xmlCodes, textCodes, binaryCodes;\n  scXml.Encode(Y, xmlCodes);\n  scText.Encode(Y, textCodes);\n  scBinary.Encode(Y, binaryCodes);\n\n  CheckMatrices(codes, xmlCodes, textCodes, binaryCodes);\n\n  \/\/ Check the parameters, too.\n  BOOST_REQUIRE_EQUAL(sc.Atoms(), scXml.Atoms());\n  BOOST_REQUIRE_EQUAL(sc.Atoms(), scText.Atoms());\n  BOOST_REQUIRE_EQUAL(sc.Atoms(), scBinary.Atoms());\n\n  BOOST_REQUIRE_CLOSE(sc.Lambda1(), scXml.Lambda1(), 1e-5);\n  BOOST_REQUIRE_CLOSE(sc.Lambda1(), scText.Lambda1(), 1e-5);\n  BOOST_REQUIRE_CLOSE(sc.Lambda1(), scBinary.Lambda1(), 1e-5);\n\n  BOOST_REQUIRE_CLOSE(sc.Lambda2(), scXml.Lambda2(), 1e-5);\n  BOOST_REQUIRE_CLOSE(sc.Lambda2(), scText.Lambda2(), 1e-5);\n  BOOST_REQUIRE_CLOSE(sc.Lambda2(), scBinary.Lambda2(), 1e-5);\n\n  BOOST_REQUIRE_EQUAL(sc.MaxIterations(), scXml.MaxIterations());\n  BOOST_REQUIRE_EQUAL(sc.MaxIterations(), scText.MaxIterations());\n  BOOST_REQUIRE_EQUAL(sc.MaxIterations(), scBinary.MaxIterations());\n\n  BOOST_REQUIRE_CLOSE(sc.ObjTolerance(), scXml.ObjTolerance(), 1e-5);\n  BOOST_REQUIRE_CLOSE(sc.ObjTolerance(), scText.ObjTolerance(), 1e-5);\n  BOOST_REQUIRE_CLOSE(sc.ObjTolerance(), scBinary.ObjTolerance(), 1e-5);\n\n  BOOST_REQUIRE_CLOSE(sc.NewtonTolerance(), scXml.NewtonTolerance(), 1e-5);\n  BOOST_REQUIRE_CLOSE(sc.NewtonTolerance(), scText.NewtonTolerance(), 1e-5);\n  BOOST_REQUIRE_CLOSE(sc.NewtonTolerance(), scBinary.NewtonTolerance(), 1e-5);\n}\n\n\nBOOST_AUTO_TEST_SUITE_END();\n<commit_msg>Fix issue that caused hanging tests: use the intended tolerance.<commit_after>\/**\n * @file sparse_coding_test.cpp\n *\n * Test for Sparse Coding\n *\/\n\n\/\/ Note: We don't use BOOST_REQUIRE_CLOSE in the code below because we need\n\/\/ to use FPC_WEAK, and it's not at all intuitive how to do that.\n\n#include <mlpack\/core.hpp>\n#include <mlpack\/methods\/sparse_coding\/sparse_coding.hpp>\n\n#include <boost\/test\/unit_test.hpp>\n#include \"old_boost_test_definitions.hpp\"\n#include \"serialization.hpp\"\n\nusing namespace arma;\nusing namespace mlpack;\nusing namespace mlpack::regression;\nusing namespace mlpack::sparse_coding;\n\nBOOST_AUTO_TEST_SUITE(SparseCodingTest);\n\nvoid SCVerifyCorrectness(vec beta, vec errCorr, double lambda)\n{\n  const double tol = 1e-12;\n  size_t nDims = beta.n_elem;\n  for(size_t j = 0; j < nDims; j++)\n  {\n    if (beta(j) == 0)\n    {\n      \/\/ Make sure that errCorr(j) <= lambda.\n      BOOST_REQUIRE_SMALL(std::max(fabs(errCorr(j)) - lambda, 0.0), tol);\n    }\n    else if (beta(j) < 0)\n    {\n      \/\/ Make sure that errCorr(j) == lambda.\n      BOOST_REQUIRE_SMALL(errCorr(j) - lambda, tol);\n    }\n    else \/\/ beta(j) > 0.\n    {\n      \/\/ Make sure that errCorr(j) == -lambda.\n      BOOST_REQUIRE_SMALL(errCorr(j) + lambda, tol);\n    }\n  }\n}\n\nBOOST_AUTO_TEST_CASE(SparseCodingTestCodingStepLasso)\n{\n  double lambda1 = 0.1;\n  uword nAtoms = 25;\n\n  mat X;\n  X.load(\"mnist_first250_training_4s_and_9s.arm\");\n  uword nPoints = X.n_cols;\n\n  \/\/ Normalize each point since these are images.\n  for (uword i = 0; i < nPoints; ++i) {\n    X.col(i) \/= norm(X.col(i), 2);\n  }\n\n  SparseCoding sc(nAtoms, lambda1);\n  mat Z;\n  DataDependentRandomInitializer::Initialize(X, 25, sc.Dictionary());\n  sc.Encode(X, Z);\n\n  mat D = sc.Dictionary();\n\n  for (uword i = 0; i < nPoints; ++i)\n  {\n    vec errCorr = trans(D) * (D * Z.unsafe_col(i) - X.unsafe_col(i));\n    SCVerifyCorrectness(Z.unsafe_col(i), errCorr, lambda1);\n  }\n}\n\nBOOST_AUTO_TEST_CASE(SparseCodingTestCodingStepElasticNet)\n{\n  double lambda1 = 0.1;\n  double lambda2 = 0.2;\n  uword nAtoms = 25;\n\n  mat X;\n  X.load(\"mnist_first250_training_4s_and_9s.arm\");\n  uword nPoints = X.n_cols;\n\n  \/\/ Normalize each point since these are images.\n  for (uword i = 0; i < nPoints; ++i)\n    X.col(i) \/= norm(X.col(i), 2);\n\n  SparseCoding sc(nAtoms, lambda1, lambda2);\n  mat Z;\n  DataDependentRandomInitializer::Initialize(X, 25, sc.Dictionary());\n  sc.Encode(X, Z);\n\n  mat D = sc.Dictionary();\n\n  for(uword i = 0; i < nPoints; ++i)\n  {\n    vec errCorr =\n      (trans(D) * D + lambda2 * eye(nAtoms, nAtoms)) * Z.unsafe_col(i)\n      - trans(D) * X.unsafe_col(i);\n\n    SCVerifyCorrectness(Z.unsafe_col(i), errCorr, lambda1);\n  }\n}\n\nBOOST_AUTO_TEST_CASE(SparseCodingTestDictionaryStep)\n{\n  const double tol = 1e-6;\n\n  double lambda1 = 0.1;\n  uword nAtoms = 25;\n\n  mat X;\n  X.load(\"mnist_first250_training_4s_and_9s.arm\");\n  uword nPoints = X.n_cols;\n\n  \/\/ Normalize each point since these are images.\n  for (uword i = 0; i < nPoints; ++i)\n    X.col(i) \/= norm(X.col(i), 2);\n\n  SparseCoding sc(nAtoms, lambda1, 0.0, 0, 0.01, tol);\n  mat Z;\n  DataDependentRandomInitializer::Initialize(X, 25, sc.Dictionary());\n  sc.Encode(X, Z);\n\n  mat D = sc.Dictionary();\n\n  uvec adjacencies = find(Z);\n  double normGradient = sc.OptimizeDictionary(X, Z, adjacencies);\n\n  BOOST_REQUIRE_SMALL(normGradient, tol);\n}\n\nBOOST_AUTO_TEST_CASE(SerializationTest)\n{\n  mat X = randu<mat>(100, 100);\n  size_t nAtoms = 25;\n\n  SparseCoding sc(nAtoms, 0.05, 0.1);\n  sc.Train(X);\n\n  mat Y = randu<mat>(100, 200);\n  mat codes;\n  sc.Encode(Y, codes);\n\n  SparseCoding scXml(50, 0.01), scText(nAtoms, 0.05), scBinary(0, 0.0);\n  SerializeObjectAll(sc, scXml, scText, scBinary);\n\n  CheckMatrices(sc.Dictionary(), scXml.Dictionary(), scText.Dictionary(),\n      scBinary.Dictionary());\n\n  mat xmlCodes, textCodes, binaryCodes;\n  scXml.Encode(Y, xmlCodes);\n  scText.Encode(Y, textCodes);\n  scBinary.Encode(Y, binaryCodes);\n\n  CheckMatrices(codes, xmlCodes, textCodes, binaryCodes);\n\n  \/\/ Check the parameters, too.\n  BOOST_REQUIRE_EQUAL(sc.Atoms(), scXml.Atoms());\n  BOOST_REQUIRE_EQUAL(sc.Atoms(), scText.Atoms());\n  BOOST_REQUIRE_EQUAL(sc.Atoms(), scBinary.Atoms());\n\n  BOOST_REQUIRE_CLOSE(sc.Lambda1(), scXml.Lambda1(), 1e-5);\n  BOOST_REQUIRE_CLOSE(sc.Lambda1(), scText.Lambda1(), 1e-5);\n  BOOST_REQUIRE_CLOSE(sc.Lambda1(), scBinary.Lambda1(), 1e-5);\n\n  BOOST_REQUIRE_CLOSE(sc.Lambda2(), scXml.Lambda2(), 1e-5);\n  BOOST_REQUIRE_CLOSE(sc.Lambda2(), scText.Lambda2(), 1e-5);\n  BOOST_REQUIRE_CLOSE(sc.Lambda2(), scBinary.Lambda2(), 1e-5);\n\n  BOOST_REQUIRE_EQUAL(sc.MaxIterations(), scXml.MaxIterations());\n  BOOST_REQUIRE_EQUAL(sc.MaxIterations(), scText.MaxIterations());\n  BOOST_REQUIRE_EQUAL(sc.MaxIterations(), scBinary.MaxIterations());\n\n  BOOST_REQUIRE_CLOSE(sc.ObjTolerance(), scXml.ObjTolerance(), 1e-5);\n  BOOST_REQUIRE_CLOSE(sc.ObjTolerance(), scText.ObjTolerance(), 1e-5);\n  BOOST_REQUIRE_CLOSE(sc.ObjTolerance(), scBinary.ObjTolerance(), 1e-5);\n\n  BOOST_REQUIRE_CLOSE(sc.NewtonTolerance(), scXml.NewtonTolerance(), 1e-5);\n  BOOST_REQUIRE_CLOSE(sc.NewtonTolerance(), scText.NewtonTolerance(), 1e-5);\n  BOOST_REQUIRE_CLOSE(sc.NewtonTolerance(), scBinary.NewtonTolerance(), 1e-5);\n}\n\n\nBOOST_AUTO_TEST_SUITE_END();\n<|endoftext|>"}
{"text":"<commit_before>#include \"motor\/esra_payload_motor_mapper.hpp\"\n\n#include <array>\n#include <cstddef>\n\n#include \"protocol\/messages.hpp\"\n\nEsraPayloadMotorMapper::EsraPayloadMotorMapper(PWMDeviceGroup<1>& motors, Communicator& communicator)\n  : motors(motors),\n    throttleStream(communicator, 5) {\n}\n\nvoid EsraPayloadMotorMapper::run(bool armed, ActuatorSetpoint& input) {\n  \/\/ We only have one motor for now, but just in case..\n  std::array<float, 1> outputs;\n  outputs[0] = input.throttle;\n  motors.set(armed, outputs);\n\n  if(throttleStream.ready()) {\n    protocol::message::motor_throttle_message_t msg;\n    msg.throttles[0] = outputs[0];\n    msg.throttles[1] = 0;\n    msg.throttles[2] = 0;\n    msg.throttles[3] = 0;\n    throttleStream.publish(msg);\n  }\n}\n<commit_msg>Set throttle timestamp.<commit_after>#include \"motor\/esra_payload_motor_mapper.hpp\"\n#include \"util\/time.hpp\"\n\n#include <array>\n#include <cstddef>\n\n#include \"protocol\/messages.hpp\"\n\nEsraPayloadMotorMapper::EsraPayloadMotorMapper(PWMDeviceGroup<1>& motors, Communicator& communicator)\n  : motors(motors),\n    throttleStream(communicator, 5) {\n}\n\nvoid EsraPayloadMotorMapper::run(bool armed, ActuatorSetpoint& input) {\n  \/\/ We only have one motor for now, but just in case..\n  std::array<float, 1> outputs;\n  outputs[0] = input.throttle;\n  motors.set(armed, outputs);\n\n  if(throttleStream.ready()) {\n    protocol::message::motor_throttle_message_t msg;\n    msg.time = ST2MS(chibios_rt::System::getTime()),\n    msg.throttles[0] = outputs[0];\n    msg.throttles[1] = 0;\n    msg.throttles[2] = 0;\n    msg.throttles[3] = 0;\n    throttleStream.publish(msg);\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"mapper_004.h\"\n\n#include <cassert>\n#include <cstdio>\n#include <cstring>\n\nMapper_004::Mapper_004(const ROM_File& rom_file)\n: Mapper(4, \"MMC3\", rom_file, 0x2000, 0x400)\n, prg_ram(0x2000)\n{\n  this->fourscreen_mirroring = rom_file.meta.mirror_mode == Mirroring::FourScreen;\n\n  if (this->fourscreen_mirroring) {\n    this->four_screen_ram = new RAM (0x1000, \"Mapper_004 FourScreen RAM\");\n  } else {\n    this->four_screen_ram = nullptr;\n  }\n}\n\nMapper_004::~Mapper_004() {\n  if (this->four_screen_ram)\n    delete four_screen_ram;\n}\n\nu8 Mapper_004::read(u16 addr) {\n  \/\/ Wired to the PPU MMU\n  if (in_range(addr, 0x0000, 0x1FFF)) {\n    \/\/ The MMC3 scanline counter is based entirely on PPU A12,\n    \/\/ being clocked on A12's rising edge\n    bool next = nth_bit(addr, 12);\n    if (this->last_A12 == 0 && next == 1) { \/\/ Rising Edge\n      if (this->reg.irq_counter == 0) {\n        this->reg.irq_counter = this->reg.irq_latch;\n      } else {\n        this->reg.irq_counter--;\n      }\n\n      if (this->reg.irq_counter == 0) {\n        if (this->reg.irq_enabled)\n          this->irq_trigger();\n\n        _did_irq_callbacks.run(this, this->reg.irq_enabled);\n      }\n    }\n    this->last_A12 = next;\n\n    return this->chr_bank[addr \/ 0x400]->read(addr % 0x400);\n  }\n\n  \/\/ 4 Screen RAM\n  if (in_range(addr, 0x2000, 0x2FFF)) {\n    assert(this->four_screen_ram);\n    return this->four_screen_ram->read(addr - 0x2000);\n  }\n\n  \/\/ Wired to the CPU MMU\n  if (in_range(addr, 0x4020, 0x5FFF)) return 0x00; \/\/ Nothing in \"Expansion ROM\"\n  if (in_range(addr, 0x6000, 0x7FFF)) return this->reg.ram_protect.enable_ram\n                                           ? this->prg_ram.read(addr - 0x6000)\n                                           : 0x00; \/\/ should be open bus...\n  if (in_range(addr, 0x8000, 0xFFFF)) {\n    return this->prg_bank[(addr - 0x8000) \/ 0x2000]->read(addr % 0x2000);\n  }\n\n  assert(false);\n  return 0x00;\n}\n\nu8 Mapper_004::peek(u16 addr) const {\n  \/\/ Wired to the PPU MMU\n  if (in_range(addr, 0x0000, 0x1FFF)) {\n    return this->chr_bank[addr \/ 0x400]->peek(addr % 0x400);\n  }\n\n  \/\/ 4 Screen RAM\n  if (in_range(addr, 0x2000, 0x2FFF)) {\n    assert(this->four_screen_ram);\n    return this->four_screen_ram->peek(addr - 0x2000);\n  }\n\n  \/\/ Wired to the CPU MMU\n  if (in_range(addr, 0x4020, 0x5FFF)) return 0x00; \/\/ Nothing in \"Expansion ROM\"\n  if (in_range(addr, 0x6000, 0x7FFF)) return this->reg.ram_protect.enable_ram\n                                           ? this->prg_ram.peek(addr - 0x6000)\n                                           : 0x00; \/\/ should be open bus...\n  if (in_range(addr, 0x8000, 0xFFFF)) {\n    return this->prg_bank[(addr - 0x8000) \/ 0x2000]->peek(addr % 0x2000);\n  }\n\n  assert(false);\n  return 0x00;\n}\n\nvoid Mapper_004::write(u16 addr, u8 val) {\n  if (in_range(addr, 0x0000, 0x1FFF)) {\n    \/\/ CHR might be RAM (potentially)\n    return this->chr_bank[addr \/ 0x400]->write(addr % 0x400, val);\n  }\n  \/\/ 4 Screen RAM\n  if (in_range(addr, 0x2000, 0x2FFF)) {\n    assert(this->four_screen_ram);\n    return this->four_screen_ram->write(addr - 0x2000, val);\n  }\n  if (in_range(addr, 0x4020, 0x5FFF)) return; \/\/ do nothing to expansion ROM\n  if (in_range(addr, 0x6000, 0x7FFF)) {\n    (this->reg.ram_protect.write_enable == 0)\n      ? this->prg_ram.write(addr - 0x6000, val)\n      : void();\n  }\n\n  \/\/ Otherwise, handle writing to registers\n\n  switch(addr & 0xE001) {\n  \/\/ Memory Mapping\n  case 0x8000: this->reg.bank_select.val = val; this->update_banks(); return;\n  case 0x8001: this->reg.bank_values[this->reg.bank_select.bank] = val;\n                                                this->update_banks(); return;\n  case 0xA000: this->reg.mirroring.val   = val; this->update_banks(); return;\n  case 0xA001: this->reg.ram_protect.val = val; this->update_banks(); return;\n  \/\/ IRQ\n  case 0xC000: this->reg.irq_latch = val;     return;\n  case 0xC001: this->reg.irq_counter = 0;     return;\n  case 0xE000: this->irq_service();\n               this->reg.irq_enabled = false; return;\n  case 0xE001: this->reg.irq_enabled = true;  return;\n  }\n}\n\nvoid Mapper_004::update_banks() {\n  \/\/ https:\/\/wiki.nesdev.com\/w\/index.php\/MMC3#PRG_Banks\n  #define PBANK(i, val) \\\n    this->prg_bank[i] = &this->get_prg_bank(val);\n  if (this->reg.bank_select.prg_rom_mode == 0) {\n    PBANK(0, this->reg.bank_values[6]);\n    PBANK(1, this->reg.bank_values[7]);\n    PBANK(2, this->get_prg_bank_len() - 2);\n    PBANK(3, this->get_prg_bank_len() - 1);\n  } else {\n    PBANK(0, this->get_prg_bank_len() - 2);\n    PBANK(1, this->reg.bank_values[7]);\n    PBANK(2, this->reg.bank_values[6]);\n    PBANK(3, this->get_prg_bank_len() - 1);\n  }\n  #undef PBANK\n\n  \/\/ https:\/\/wiki.nesdev.com\/w\/index.php\/MMC3#CHR_Banks\n  #define CBANK(i, val) \\\n    this->chr_bank[i] = &this->get_chr_bank(val);\n  if (this->reg.bank_select.chr_inversion == 0) {\n    CBANK(0, this->reg.bank_values[0] & 0xFE);\n    CBANK(1, this->reg.bank_values[0] | 0x01);\n    CBANK(2, this->reg.bank_values[1] & 0xFE);\n    CBANK(3, this->reg.bank_values[1] | 0x01);\n    CBANK(4, this->reg.bank_values[2]);\n    CBANK(5, this->reg.bank_values[3]);\n    CBANK(6, this->reg.bank_values[4]);\n    CBANK(7, this->reg.bank_values[5]);\n  } else {\n    CBANK(0, this->reg.bank_values[2]);\n    CBANK(1, this->reg.bank_values[3]);\n    CBANK(2, this->reg.bank_values[4]);\n    CBANK(3, this->reg.bank_values[5]);\n    CBANK(4, this->reg.bank_values[0] & 0xFE);\n    CBANK(5, this->reg.bank_values[0] | 0x01);\n    CBANK(6, this->reg.bank_values[1] & 0xFE);\n    CBANK(7, this->reg.bank_values[1] | 0x01);\n  }\n  #undef CBANK\n}\n\nMirroring::Type Mapper_004::mirroring() const {\n  if (this->fourscreen_mirroring)\n    return Mirroring::FourScreen;\n\n  return this->reg.mirroring.mode\n    ? Mirroring::Horizontal\n    : Mirroring::Vertical;\n}\n\nvoid Mapper_004::power_cycle() {\n  this->last_A12 = false;\n  Mapper::power_cycle();\n}\n\nvoid Mapper_004::reset() {\n  memset(&this->reg, 0, sizeof this->reg);\n}\n<commit_msg>Update mapper_004.cc<commit_after>#include \"mapper_004.h\"\n\n#include <cassert>\n#include <cstdio>\n#include <cstring>\n\nMapper_004::Mapper_004(const ROM_File& rom_file)\n: Mapper(4, \"MMC3\", rom_file, 0x2000, 0x400)\n, prg_ram(0x2000)\n{\n  this->fourscreen_mirroring = rom_file.meta.mirror_mode == Mirroring::FourScreen;\n\n  if (this->fourscreen_mirroring) {\n    this->four_screen_ram = new RAM (0x1000, \"Mapper_004 FourScreen RAM\");\n  } else {\n    this->four_screen_ram = nullptr;\n  }\n}\n\nMapper_004::~Mapper_004() {\n  if (this->four_screen_ram)\n    delete four_screen_ram;\n}\n\nu8 Mapper_004::read(u16 addr) {\n  \/\/ Wired to the PPU MMU\n  if (in_range(addr, 0x0000, 0x1FFF)) {\n    \/\/ The MMC3 scanline counter is based entirely on PPU A12,\n    \/\/ being clocked on A12's rising edge\n    bool next = nth_bit(addr, 12);\n    if (this->last_A12 == 0 && next == 1) { \/\/ Rising Edge\n      if (this->reg.irq_counter == 0) {\n        this->reg.irq_counter = this->reg.irq_latch;\n      } else {\n        this->reg.irq_counter--;\n      }\n\n      if (this->reg.irq_counter == 0) {\n        if (this->reg.irq_enabled)\n          this->irq_trigger();\n\n        _did_irq_callbacks.run(this, this->reg.irq_enabled);\n      }\n    }\n    this->last_A12 = next;\n\n    return this->chr_bank[addr \/ 0x400]->read(addr % 0x400);\n  }\n\n  \/\/ 4 Screen RAM\n  if (in_range(addr, 0x2000, 0x2FFF)) {\n    assert(this->four_screen_ram);\n    return this->four_screen_ram->read(addr - 0x2000);\n  }\n\n  \/\/ Wired to the CPU MMU\n  if (in_range(addr, 0x4020, 0x5FFF)) return 0x00; \/\/ Nothing in \"Expansion ROM\"\n  if (in_range(addr, 0x6000, 0x7FFF)) return this->reg.ram_protect.enable_ram\n                                           ? this->prg_ram.read(addr - 0x6000)\n                                           : 0x00; \/\/ should be open bus...\n  if (in_range(addr, 0x8000, 0xFFFF)) {\n    return this->prg_bank[(addr - 0x8000) \/ 0x2000]->read(addr % 0x2000);\n  }\n\n  assert(false);\n  return 0x00;\n}\n\nu8 Mapper_004::peek(u16 addr) const {\n  \/\/ Wired to the PPU MMU\n  if (in_range(addr, 0x0000, 0x1FFF)) {\n    return this->chr_bank[addr \/ 0x400]->peek(addr % 0x400);\n  }\n\n  \/\/ 4 Screen RAM\n  if (in_range(addr, 0x2000, 0x2FFF)) {\n    assert(this->four_screen_ram);\n    return this->four_screen_ram->peek(addr - 0x2000);\n  }\n\n  \/\/ Wired to the CPU MMU\n  if (in_range(addr, 0x4020, 0x5FFF)) return 0x00; \/\/ Nothing in \"Expansion ROM\"\n  if (in_range(addr, 0x6000, 0x7FFF)) return this->reg.ram_protect.enable_ram\n                                           ? this->prg_ram.peek(addr - 0x6000)\n                                           : 0x00; \/\/ should be open bus...\n  if (in_range(addr, 0x8000, 0xFFFF)) {\n    return this->prg_bank[(addr - 0x8000) \/ 0x2000]->peek(addr % 0x2000);\n  }\n\n  assert(false);\n  return 0x00;\n}\n\nvoid Mapper_004::write(u16 addr, u8 val) {\n  if (in_range(addr, 0x0000, 0x1FFF)) {\n    \/\/ CHR might be RAM (potentially)\n    return this->chr_bank[addr \/ 0x400]->write(addr % 0x400, val);\n  }\n  \/\/ 4 Screen RAM\n  if (in_range(addr, 0x2000, 0x2FFF)) {\n    assert(this->four_screen_ram);\n    return this->four_screen_ram->write(addr - 0x2000, val);\n  }\n  if (in_range(addr, 0x4020, 0x5FFF)) return; \/\/ do nothing to expansion ROM\n  if (in_range(addr, 0x6000, 0x7FFF)) {\n    (this->reg.ram_protect.write_enable == 0)\n      ? this->prg_ram.write(addr - 0x6000, val)\n      : void();\n  }\n\n  \/\/ Otherwise, handle writing to registers\n\n  switch(addr & 0xE001) {\n  \/\/ Memory Mapping\n  case 0x8000: this->reg.bank_select.val = val; this->update_banks(); return;\n  case 0x8001: this->reg.bank_values[this->reg.bank_select.bank] = val;\n                                                this->update_banks(); return;\n  case 0xA000: this->reg.mirroring.val   = val; this->update_banks(); return;\n  case 0xA001: this->reg.ram_protect.val = val; this->update_banks(); return;\n  \/\/ IRQ\n  case 0xC000: this->reg.irq_latch = val;     return;\n  case 0xC001: this->reg.irq_counter = 0;     return;\n  case 0xE000: this->irq_service();\n               this->reg.irq_enabled = false; return;\n  case 0xE001: this->reg.irq_enabled = true;  return;\n  }\n}\n\nvoid Mapper_004::update_banks() {\n  \/\/ https:\/\/wiki.nesdev.com\/w\/index.php\/MMC3#PRG_Banks\n  #define PBANK(i, val) \\\n    this->prg_bank[i] = &this->get_prg_bank(val);\n  if (this->reg.bank_select.prg_rom_mode == 0) {\n    PBANK(0, this->reg.bank_values[6]);\n    PBANK(1, this->reg.bank_values[7]);\n    PBANK(2, this->get_prg_bank_len() - 2);\n    PBANK(3, this->get_prg_bank_len() - 1);\n  } else {\n    PBANK(0, this->get_prg_bank_len() - 2);\n    PBANK(1, this->reg.bank_values[7]);\n    PBANK(2, this->reg.bank_values[6]);\n    PBANK(3, this->get_prg_bank_len() - 1);\n  }\n  #undef PBANK\n\n  \/\/ https:\/\/wiki.nesdev.com\/w\/index.php\/MMC3#CHR_Banks\n  #define CBANK(i, val) \\\n    this->chr_bank[i] = &this->get_chr_bank(val);\n  if (this->reg.bank_select.chr_inversion == 0) {\n    CBANK(0, this->reg.bank_values[0] & 0xFE);\n    CBANK(1, this->reg.bank_values[0] | 0x01);\n    CBANK(2, this->reg.bank_values[1] & 0xFE);\n    CBANK(3, this->reg.bank_values[1] | 0x01);\n    CBANK(4, this->reg.bank_values[2]);\n    CBANK(5, this->reg.bank_values[3]);\n    CBANK(6, this->reg.bank_values[4]);\n    CBANK(7, this->reg.bank_values[5]);\n  } else {\n    CBANK(0, this->reg.bank_values[2]);\n    CBANK(1, this->reg.bank_values[3]);\n    CBANK(2, this->reg.bank_values[4]);\n    CBANK(3, this->reg.bank_values[5]);\n    CBANK(4, this->reg.bank_values[0] & 0xFE);\n    CBANK(5, this->reg.bank_values[0] | 0x01);\n    CBANK(6, this->reg.bank_values[1] & 0xFE);\n    CBANK(7, this->reg.bank_values[1] | 0x01);\n  }\n  #undef CBANK\n}\n\nMirroring::Type Mapper_004::mirroring() const {\n  if (this->fourscreen_mirroring)\n    return Mirroring::FourScreen;\n\n  return this->reg.mirroring.mode\n    ? Mirroring::Horizontal\n    : Mirroring::Vertical;\n}\n\nvoid Mapper_004::power_cycle() {\n  this->last_A12 = false;\n  Mapper::power_cycle();\n}\n\nvoid Mapper_004::reset() {\n  memset((char*)&this->reg, 0, sizeof this->reg);\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Unused variable.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/* -------------------------------------------------------------------------- *\n *                        OpenSim:  testInitState.cpp                         *\n * -------------------------------------------------------------------------- *\n * The OpenSim API is a toolkit for musculoskeletal modeling and simulation.  *\n * See http:\/\/opensim.stanford.edu and the NOTICE file for more information.  *\n * OpenSim is developed at Stanford University and supported by the US        *\n * National Institutes of Health (U54 GM072970, R24 HD065690) and by DARPA    *\n * through the Warrior Web program.                                           *\n *                                                                            *\n * Copyright (c) 2005-2016 Stanford University and the Authors                *\n * Author(s): Peter Eastman, 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#include <stdint.h>\n#include <OpenSim\/Simulation\/Manager\/Manager.h>\n#include <OpenSim\/Simulation\/Control\/ControlSetController.h>\n#include <OpenSim\/Simulation\/Model\/Model.h>\n#include <OpenSim\/Common\/LoadOpenSimLibrary.h>\n#include <OpenSim\/Auxiliary\/auxiliaryTestFunctions.h>\n\nusing namespace OpenSim;\nusing namespace std;\n\n\/\/==============================================================================\n\/\/ testInitState tests that a Model consistently generates the same default \n\/\/ state from its initSystem() method. It also tests that when the properties\n\/\/ are updated (after a simulation) that the defaults match the values in the \n\/\/ new state.\n\/\/==============================================================================\nvoid testStates(const string& modelFile);\n\/\/==============================================================================\n\/\/ testMemoryUsage tests that repeated initialization of the state does not  \n\/\/ cause the memory footprint of the process to increase significantly.\n\/\/==============================================================================\nvoid testMemoryUsage(const string& modelFile);\n\nstatic const int MAX_N_TRIES = 100;\n\nint main()\n{\n    try {\n        LoadOpenSimLibrary(\"osimActuators\");\n        testStates(\"arm26.osim\");\n        testMemoryUsage(\"arm26.osim\");\n        testMemoryUsage(\"PushUpToesOnGroundWithMuscles.osim\");\n    }\n    catch (const Exception& e) {\n        cout << \"testInitState failed: \";\n        e.print(cout); \n        return 1;\n    }\n    catch (const std::exception& e) {\n        cout << \"testInitState failed: \" << e.what() << endl;\n        return 1;\n    }\n    cout << \"Done\" << endl;\n    return 0;\n}\n\n\/\/==============================================================================\n\/\/ Test Cases\n\/\/==============================================================================\nvoid testStates(const string& modelFile)\n{\n    using namespace SimTK;\n\n    \/\/==========================================================================\n    \/\/ Setup OpenSim model\n    Model model(modelFile);\n    ControlSetController* controller = new ControlSetController();\n    controller->setControlSetFileName(\"arm26_StaticOptimization_controls.xml\");\n  \n    model.addController( controller );\n    \/\/ original default state\n    State& state = model.initSystem();\n\n    \/\/ hold on to original default continuous state variables\n    Vector y1 = state.getY();\n    y1 = state.getY();\n    y1.dump(\"y1: Initial state:\");\n\n    \/\/ update state to contain muscle states that yield muscle equilibrium\n    model.equilibrateMuscles(state);\n    state.getY().dump(\"y1: State after equilibrateMuscles:\");\n    \/\/==========================================================================\n    \/\/ Compute the force and torque at the specified times.\n\n    RungeKuttaMersonIntegrator integrator(model.getMultibodySystem());\n    Manager manager(model, integrator);\n    manager.setInitialTime(0.0);\n    manager.setFinalTime(0.05);\n\n    \/\/ update state after a short simulation forward in time\n    manager.integrate(state);\n\n    \/\/ continuous state variables after simulation\n    Vector y2 = state.getY();\n    y2.dump(\"y2: State after integration:\");\n\n    \/\/ reset model working state to default state\n    State& state2 = model.initializeState();\n\n    \/\/ another version of default continuous state variables \n    \/\/ should be unaffected by simulation of the system\n    Vector y3 = state2.getY();\n    y3.dump(\"y3: Model reset to Initial state:\");\n\n    \/\/ update state to contain muscle states that yield muscle equilibrium\n    model.equilibrateMuscles(state2);\n    state.getY().dump(\"y3: State after equilibrateMuscles:\");\n    \/\/==========================================================================\n    \/\/ Compute the force and torque at the specified times.\n\n    RungeKuttaMersonIntegrator integrator2(model.getMultibodySystem());\n    Manager manager2(model, integrator);\n    manager2.setInitialTime(0.0);\n    manager2.setFinalTime(0.05);\n\n    \/\/ update state after a short simulation forward in time\n    manager2.integrate(state2);\n\n    \/\/ get the default continuous state variables updated\n    \/\/ from the state after the simulation\n    Vector y4 = state2.getY();\n    \n    y4.dump(\"y4: Default State after second simulation:\");\n\n    for (int i = 0; i < y1.size(); i++) \n    {\n        cout << i <<\" : y1[i] = \" << y1[i] << \" :: y3[i] = \" << y3[i] << endl;\n        ASSERT_EQUAL(y1[i], y3[i], 1e-5,__FILE__, __LINE__, \n            \"Model failed to maintain default state after simulation.\");\n        cout << i <<\" : y2[i] = \" << y2[i] << \" :: y4[i] = \" << y4[i] << endl;\n        ASSERT_EQUAL(y2[i], y4[i], 1e-5,__FILE__, __LINE__, \n            \"Model failed to properly update default state after simulation.\");\n    }\n    ASSERT(max(abs(y1-y2)) > 1e-4);\n}\n\nvoid testMemoryUsage(const string& modelFile)\n{\n    using namespace SimTK;\n\n    \/\/=========================================================================\n    \/\/ Setup OpenSim model\n    \/\/ base footprint\n    size_t mem0 = getCurrentRSS();\n    size_t current_size{ 0 };\n\n    Model model;\n\n    \/\/ getCurrentRSS() can be unreliable at evaluating the memory usage of a\n    \/\/ current process because of caching, shared memory and a litany of \n    \/\/ other reason including some platform specific details.\n    \/\/ When this occurs, the model_size is determined to be zero, which is not\n    \/\/ possible. This was leading to an invalid (NaN) leak % and the test was\n    \/\/ failing. Redoing the test (or restarting the CI tests) often remedies\n    \/\/ the issue (see #473) but it is a waste of time and CI resources.\n    \/\/ The following code was added to retry loading the model until a nonzero\n    \/\/ value is registered so that the test can proceed without requiring \n    \/\/ to be rerun. It is not 100% that it will work, but it should be an\n    \/\/ improvement.\n    int ntries = 0;\n    while (ntries++ < 10) {\n        model = Model(modelFile);\n        current_size = getCurrentRSS();\n\n        \/\/ Exit if memory footprint increased.\n        if (current_size > mem0)\n            break;\n\n        \/\/ Update mem0 if memory footprint decreased.\n        if (current_size < mem0)\n            mem0 = current_size;\n    }\n\n    \/\/ Ensure subtraction does not wrap unsigned int through zero.\n    const size_t model_size = current_size > mem0 ? current_size-mem0 : 0;\n\n    if (ntries > 1) {\n        cout << \"testMemoryUsage: required \" << to_string(ntries);\n        cout << \" load attempts to record a nonzero model_size.\" << endl;\n    }\n\n    cout << \"*********************** testMemoryUsage ***********************\" << endl;\n    cout << \"MODEL: \" << modelFile << \" uses \" << model_size \/ 1024.0 << \"KB\" << endl;\n\n    ASSERT(model_size > 0, __FILE__, __LINE__,\n        \"testMemoryUsage: model size was found to be zero.\\n\"\n        \"Memory instrumentation code failed to estimate model size correctly.\");\n\n    State state = model.initSystem();\n\n    \/\/ initial footprint\n    size_t mem1 = getCurrentRSS();\n\n    \/\/ also time how long initializing the state takes\n    clock_t startTime = clock();\n\n    for(int i=0; i< MAX_N_TRIES; ++i){\n        state = model.initializeState();\n    }\n\n    \/\/ New memory footprint after MAX_N_TRIES.\n    size_t mem2 = getCurrentRSS();\n    \/\/ Increase in memory footprint.\n    int64_t memory_increase = mem2 > mem1 ? mem2-mem1 : 0;\n    int64_t leak = memory_increase\/MAX_N_TRIES;\n\n    long double leak_percent = 100.0 * double(leak)\/model_size;\n\n    long double dT = (long double)(clock()-startTime) \/ CLOCKS_PER_SEC;\n    long double meanT = 1.0e3 * dT\/MAX_N_TRIES; \/\/ in ms\n    \n    cout << memory_increase\/1024 << \"KB increase in memory use after \"\n         << MAX_N_TRIES << \" state initializations.\" << endl;\n    cout << \"Approximate leak size: \" << leak\/1024.0 << \"KB or \" << \n             leak_percent << \"% of model size.\" << endl;\n    cout << \"Average initialization time: \" << meanT << \"ms\" << endl;\n\n    \/\/ If we are leaking more than 0.5% of the model's footprint that is significant\n    ASSERT( (leak_percent) < 0.5, __FILE__, __LINE__, \n        \"testMemoryUsage: state initialization leak > 0.5% of model memory footprint.\");\n\n    \/\/ If we ever leak over 100MB total we should know about it.\n    ASSERT( memory_increase < 1e8, __FILE__, __LINE__, \n        \"testMemoryUsage: total estimated memory leaked > 100MB.\");\n}\n<commit_msg>Clarify comments in testInitState about repeated calls to getCurrentRSS()<commit_after>\/* -------------------------------------------------------------------------- *\n *                        OpenSim:  testInitState.cpp                         *\n * -------------------------------------------------------------------------- *\n * The OpenSim API is a toolkit for musculoskeletal modeling and simulation.  *\n * See http:\/\/opensim.stanford.edu and the NOTICE file for more information.  *\n * OpenSim is developed at Stanford University and supported by the US        *\n * National Institutes of Health (U54 GM072970, R24 HD065690) and by DARPA    *\n * through the Warrior Web program.                                           *\n *                                                                            *\n * Copyright (c) 2005-2016 Stanford University and the Authors                *\n * Author(s): Peter Eastman, 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#include <stdint.h>\n#include <OpenSim\/Simulation\/Manager\/Manager.h>\n#include <OpenSim\/Simulation\/Control\/ControlSetController.h>\n#include <OpenSim\/Simulation\/Model\/Model.h>\n#include <OpenSim\/Common\/LoadOpenSimLibrary.h>\n#include <OpenSim\/Auxiliary\/auxiliaryTestFunctions.h>\n\nusing namespace OpenSim;\nusing namespace std;\n\n\/\/==============================================================================\n\/\/ testInitState tests that a Model consistently generates the same default \n\/\/ state from its initSystem() method. It also tests that when the properties\n\/\/ are updated (after a simulation) that the defaults match the values in the \n\/\/ new state.\n\/\/==============================================================================\nvoid testStates(const string& modelFile);\n\/\/==============================================================================\n\/\/ testMemoryUsage tests that repeated initialization of the state does not  \n\/\/ cause the memory footprint of the process to increase significantly.\n\/\/==============================================================================\nvoid testMemoryUsage(const string& modelFile);\n\nstatic const int MAX_N_TRIES = 100;\n\nint main()\n{\n    try {\n        LoadOpenSimLibrary(\"osimActuators\");\n        testStates(\"arm26.osim\");\n        testMemoryUsage(\"arm26.osim\");\n        testMemoryUsage(\"PushUpToesOnGroundWithMuscles.osim\");\n    }\n    catch (const Exception& e) {\n        cout << \"testInitState failed: \";\n        e.print(cout); \n        return 1;\n    }\n    catch (const std::exception& e) {\n        cout << \"testInitState failed: \" << e.what() << endl;\n        return 1;\n    }\n    cout << \"Done\" << endl;\n    return 0;\n}\n\n\/\/==============================================================================\n\/\/ Test Cases\n\/\/==============================================================================\nvoid testStates(const string& modelFile)\n{\n    using namespace SimTK;\n\n    \/\/==========================================================================\n    \/\/ Setup OpenSim model\n    Model model(modelFile);\n    ControlSetController* controller = new ControlSetController();\n    controller->setControlSetFileName(\"arm26_StaticOptimization_controls.xml\");\n  \n    model.addController( controller );\n    \/\/ original default state\n    State& state = model.initSystem();\n\n    \/\/ hold on to original default continuous state variables\n    Vector y1 = state.getY();\n    y1 = state.getY();\n    y1.dump(\"y1: Initial state:\");\n\n    \/\/ update state to contain muscle states that yield muscle equilibrium\n    model.equilibrateMuscles(state);\n    state.getY().dump(\"y1: State after equilibrateMuscles:\");\n    \/\/==========================================================================\n    \/\/ Compute the force and torque at the specified times.\n\n    RungeKuttaMersonIntegrator integrator(model.getMultibodySystem());\n    Manager manager(model, integrator);\n    manager.setInitialTime(0.0);\n    manager.setFinalTime(0.05);\n\n    \/\/ update state after a short simulation forward in time\n    manager.integrate(state);\n\n    \/\/ continuous state variables after simulation\n    Vector y2 = state.getY();\n    y2.dump(\"y2: State after integration:\");\n\n    \/\/ reset model working state to default state\n    State& state2 = model.initializeState();\n\n    \/\/ another version of default continuous state variables \n    \/\/ should be unaffected by simulation of the system\n    Vector y3 = state2.getY();\n    y3.dump(\"y3: Model reset to Initial state:\");\n\n    \/\/ update state to contain muscle states that yield muscle equilibrium\n    model.equilibrateMuscles(state2);\n    state.getY().dump(\"y3: State after equilibrateMuscles:\");\n    \/\/==========================================================================\n    \/\/ Compute the force and torque at the specified times.\n\n    RungeKuttaMersonIntegrator integrator2(model.getMultibodySystem());\n    Manager manager2(model, integrator);\n    manager2.setInitialTime(0.0);\n    manager2.setFinalTime(0.05);\n\n    \/\/ update state after a short simulation forward in time\n    manager2.integrate(state2);\n\n    \/\/ get the default continuous state variables updated\n    \/\/ from the state after the simulation\n    Vector y4 = state2.getY();\n    \n    y4.dump(\"y4: Default State after second simulation:\");\n\n    for (int i = 0; i < y1.size(); i++) \n    {\n        cout << i <<\" : y1[i] = \" << y1[i] << \" :: y3[i] = \" << y3[i] << endl;\n        ASSERT_EQUAL(y1[i], y3[i], 1e-5,__FILE__, __LINE__, \n            \"Model failed to maintain default state after simulation.\");\n        cout << i <<\" : y2[i] = \" << y2[i] << \" :: y4[i] = \" << y4[i] << endl;\n        ASSERT_EQUAL(y2[i], y4[i], 1e-5,__FILE__, __LINE__, \n            \"Model failed to properly update default state after simulation.\");\n    }\n    ASSERT(max(abs(y1-y2)) > 1e-4);\n}\n\nvoid testMemoryUsage(const string& modelFile)\n{\n    using namespace SimTK;\n\n    \/\/=========================================================================\n    \/\/ Setup OpenSim model\n    \/\/ base footprint\n    size_t mem0 = getCurrentRSS();\n    size_t current_size{ 0 };\n\n    Model model;\n\n    \/\/ NOTE: getCurrentRSS() can be unreliable at evaluating the memory usage\n    \/\/ of a current process because of caching, shared memory and a litany of \n    \/\/ other reasons including some platform specific details.\n    \/\/ When this occurs, the model_size is determined to be zero, which is not\n    \/\/ possible. This was leading to an invalid (NaN) leak % and the test was\n    \/\/ failing. Redoing the test (or restarting the CI tests) often remedies\n    \/\/ the issue (see #473) but it is a waste of time and CI resources.\n    \/\/ The following code was added to retry loading the model until a nonzero\n    \/\/ value is registered so that the test can proceed without requiring \n    \/\/ to be rerun. It is not 100% guaranteed that it will work, but it should\n    \/\/  be a significant improvement.\n    int ntries = 0;\n    while (ntries++ < 10) {\n        model = Model(modelFile);\n        current_size = getCurrentRSS();\n\n        \/\/ Exit if memory footprint increased.\n        if (current_size > mem0)\n            break;\n\n        \/\/ Update mem0 if memory footprint decreased.\n        if (current_size < mem0)\n            mem0 = current_size;\n    }\n\n    \/\/ Ensure subtraction does not wrap unsigned int through zero.\n    const size_t model_size = current_size > mem0 ? current_size-mem0 : 0;\n\n    if (ntries > 1) {\n        cout << \"testMemoryUsage: required \" << to_string(ntries);\n        cout << \" load attempts to record a nonzero model_size.\" << endl;\n    }\n\n    cout << \"*********************** testMemoryUsage ***********************\" << endl;\n    cout << \"MODEL: \" << modelFile << \" uses \" << model_size \/ 1024.0 << \"KB\" << endl;\n\n    ASSERT(model_size > 0, __FILE__, __LINE__,\n        \"testMemoryUsage: model size was found to be zero.\\n\"\n        \"Memory instrumentation code failed to estimate model size correctly.\");\n\n    State state = model.initSystem();\n\n    \/\/ initial footprint\n    size_t mem1 = getCurrentRSS();\n\n    \/\/ also time how long initializing the state takes\n    clock_t startTime = clock();\n\n    for(int i=0; i< MAX_N_TRIES; ++i){\n        state = model.initializeState();\n    }\n\n    \/\/ New memory footprint after MAX_N_TRIES.\n    size_t mem2 = getCurrentRSS();\n    \/\/ Increase in memory footprint.\n    int64_t memory_increase = mem2 > mem1 ? mem2-mem1 : 0;\n    int64_t leak = memory_increase\/MAX_N_TRIES;\n\n    long double leak_percent = 100.0 * double(leak)\/model_size;\n\n    long double dT = (long double)(clock()-startTime) \/ CLOCKS_PER_SEC;\n    long double meanT = 1.0e3 * dT\/MAX_N_TRIES; \/\/ in ms\n    \n    cout << memory_increase\/1024 << \"KB increase in memory use after \"\n         << MAX_N_TRIES << \" state initializations.\" << endl;\n    cout << \"Approximate leak size: \" << leak\/1024.0 << \"KB or \" << \n             leak_percent << \"% of model size.\" << endl;\n    cout << \"Average initialization time: \" << meanT << \"ms\" << endl;\n\n    \/\/ If we are leaking more than 0.5% of the model's footprint that is significant\n    ASSERT( (leak_percent) < 0.5, __FILE__, __LINE__, \n        \"testMemoryUsage: state initialization leak > 0.5% of model memory footprint.\");\n\n    \/\/ If we ever leak over 100MB total we should know about it.\n    ASSERT( memory_increase < 1e8, __FILE__, __LINE__, \n        \"testMemoryUsage: total estimated memory leaked > 100MB.\");\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n***********************************************************\n  Implementation of AliReducedBaseEvent class.\n  Contact: iarsene@cern.ch\n  2015\/04\/15\n  *********************************************************\n*\/\n\n#ifndef ALIREDUCEDBASEEVENT_H\n#include \"AliReducedBaseEvent.h\"\n#endif\n\n#include \"AliReducedBaseTrack.h\"\n#include \"AliReducedTrackInfo.h\"\n\nClassImp(AliReducedBaseEvent)\n\nTClonesArray* AliReducedBaseEvent::fgTracks = 0;\nTClonesArray* AliReducedBaseEvent::fgTracks2 = 0;\nTClonesArray* AliReducedBaseEvent::fgCandidates = 0;\n\n\/\/____________________________________________________________________________\nAliReducedBaseEvent::AliReducedBaseEvent() :\n  TObject(),\n  fEventTag(0),\n  fRunNo(0),\n  fVtx(),\n  fNVtxContributors(0),\n  fCentrality(),\n  fCentQuality(0),\n  fNtracks(),\n  fNV0candidates(),\n  fTracks(0x0),\n  fTracks2(0x0),\n  fCandidates(0x0)\n{\n  \/\/\n  \/\/ Constructor\n  \/\/\n  for(Int_t i=0; i<3; ++i) {fVtx[i]=-999.;}\n  for(Int_t i=0; i<7; ++i) fCentrality[i]=-1.;\n  fNtracks[0]=0; fNtracks[1]=0;\n  fNV0candidates[0]=0; fNV0candidates[1]=0;\n}\n\n\n\/\/____________________________________________________________________________\nAliReducedBaseEvent::AliReducedBaseEvent(const Char_t* \/*name*\/, Int_t trackOption \/*=kNoInit*\/, Int_t track2Option \/*=kNoInit*\/) :\n  TObject(),\n  fEventTag(0),\n  fRunNo(0),\n  fVtx(),\n  fNVtxContributors(0),\n  fCentrality(),\n  fCentQuality(0),\n  fNtracks(),\n  fNV0candidates(),\n  fTracks(0x0),\n  fTracks2(0x0),\n  fCandidates(0x0)\n{\n  \/\/\n  \/\/ Constructor\n  \/\/\n  for(Int_t i=0; i<3; ++i) {fVtx[i]=-999.;}\n  for(Int_t i=0; i<4; ++i) fCentrality[i]=-1.;\n  fNtracks[0]=0; fNtracks[1]=0;\n  fNV0candidates[0]=0; fNV0candidates[1]=0;\n  \n  if(trackOption == kUseBaseTracks) {\n    if(!fgTracks) fgTracks = new TClonesArray(\"AliReducedBaseTrack\", 100000);\n    fTracks = fgTracks;\n  }\n  if(trackOption == kUseReducedTracks) {\n     if(!fgTracks) fgTracks = new TClonesArray(\"AliReducedTrackInfo\", 100000);\n     fTracks = fgTracks;\n  }\n  \n  if(track2Option == kUseBaseTracks) {\n     if(!fgTracks2) fgTracks2 = new TClonesArray(\"AliReducedBaseTrack\", 100000);\n     fTracks2 = fgTracks2;\n  }\n  if(track2Option == kUseReducedTracks) {\n     if(!fgTracks2) fgTracks2 = new TClonesArray(\"AliReducedTrackInfo\", 100000);\n     fTracks2 = fgTracks2;\n  }\n  \n  if(!fgCandidates) fgCandidates = new TClonesArray(\"AliReducedPairInfo\", 100000);\n  fCandidates = fgCandidates;\n}\n\n\n\/\/____________________________________________________________________________\nAliReducedBaseEvent::~AliReducedBaseEvent()\n{\n  \/\/\n  \/\/ De-Constructor\n  \/\/\n}\n\n\/\/____________________________________________________________________________\nvoid AliReducedBaseEvent::CopyEventHeader(const AliReducedBaseEvent* other) {\n   \/\/\n   \/\/ assignment operator overloading\n   \/\/ NOTE: the fTracks and fCandidates arrays are not copied\n   \/\/\n   ClearEvent();\n   fEventTag = other->fEventTag;\n   fRunNo = other->fRunNo;\n   for(Int_t i=0; i<3; ++i) fVtx[i] = other->fVtx[i];\n   fNVtxContributors = other->fNVtxContributors;\n   for(Int_t i=0; i<7; ++i) fCentrality[i] = other->fCentrality[i];\n   fCentQuality = other->fCentQuality;\n   fNtracks[0] = other->fNtracks[0]; \n   fNV0candidates[0] = other->fNV0candidates[0];\n}\n\n\/\/_____________________________________________________________________________\nvoid AliReducedBaseEvent::ClearEvent() {\n  \/\/\n  \/\/ clear the event\n  \/\/\n  if(fTracks) fTracks->Clear(\"C\");\n  if(fTracks2) fTracks2->Clear(\"C\");\n  if(fCandidates) fCandidates->Clear(\"C\");\n  fEventTag = 0;\n  fRunNo = 0;\n  fCentQuality = 0;\n  for(Int_t i=0;i<7;++i) fCentrality[i] = -9999.0;\n  fNtracks[0] = 0; fNtracks[1] = 0;\n  fNV0candidates[0] = 0; fNV0candidates[1] = 0;\n  for(Int_t i=0; i<3; ++i) {fVtx[i]=-9999.;}\n  fNVtxContributors = 0;\n}\n<commit_msg>small fix<commit_after>\/*\n***********************************************************\n  Implementation of AliReducedBaseEvent class.\n  Contact: iarsene@cern.ch\n  2015\/04\/15\n  *********************************************************\n*\/\n\n#ifndef ALIREDUCEDBASEEVENT_H\n#include \"AliReducedBaseEvent.h\"\n#endif\n\n#include \"AliReducedBaseTrack.h\"\n#include \"AliReducedTrackInfo.h\"\n\nClassImp(AliReducedBaseEvent)\n\nTClonesArray* AliReducedBaseEvent::fgTracks = 0;\nTClonesArray* AliReducedBaseEvent::fgTracks2 = 0;\nTClonesArray* AliReducedBaseEvent::fgCandidates = 0;\n\n\/\/____________________________________________________________________________\nAliReducedBaseEvent::AliReducedBaseEvent() :\n  TObject(),\n  fEventTag(0),\n  fRunNo(0),\n  fVtx(),\n  fNVtxContributors(0),\n  fCentrality(),\n  fCentQuality(0),\n  fNtracks(),\n  fNV0candidates(),\n  fTracks(0x0),\n  fTracks2(0x0),\n  fCandidates(0x0)\n{\n  \/\/\n  \/\/ Constructor\n  \/\/\n  for(Int_t i=0; i<3; ++i) {fVtx[i]=-999.;}\n  for(Int_t i=0; i<7; ++i) fCentrality[i]=-1.;\n  fNtracks[0]=0; fNtracks[1]=0;\n  fNV0candidates[0]=0; fNV0candidates[1]=0;\n}\n\n\n\/\/____________________________________________________________________________\nAliReducedBaseEvent::AliReducedBaseEvent(const Char_t* \/*name*\/, Int_t trackOption \/*=kNoInit*\/, Int_t track2Option \/*=kNoInit*\/) :\n  TObject(),\n  fEventTag(0),\n  fRunNo(0),\n  fVtx(),\n  fNVtxContributors(0),\n  fCentrality(),\n  fCentQuality(0),\n  fNtracks(),\n  fNV0candidates(),\n  fTracks(0x0),\n  fTracks2(0x0),\n  fCandidates(0x0)\n{\n  \/\/\n  \/\/ Constructor\n  \/\/\n  for(Int_t i=0; i<3; ++i) {fVtx[i]=-999.;}\n  for(Int_t i=0; i<4; ++i) fCentrality[i]=-1.;\n  fNtracks[0]=0; fNtracks[1]=0;\n  fNV0candidates[0]=0; fNV0candidates[1]=0;\n  \n  if(trackOption == kUseBaseTracks) {\n    if(!fgTracks) fgTracks = new TClonesArray(\"AliReducedBaseTrack\", 100000);\n    fTracks = fgTracks;\n  }\n  if(trackOption == kUseReducedTracks) {\n     if(!fgTracks) fgTracks = new TClonesArray(\"AliReducedTrackInfo\", 100000);\n     fTracks = fgTracks;\n  }\n  \n  if(track2Option == kUseBaseTracks || track2Option == kNoInit) {\n     if(!fgTracks2) fgTracks2 = new TClonesArray(\"AliReducedBaseTrack\", 100000);\n     fTracks2 = fgTracks2;\n  }\n  if(track2Option == kUseReducedTracks) {\n     if(!fgTracks2) fgTracks2 = new TClonesArray(\"AliReducedTrackInfo\", 100000);\n     fTracks2 = fgTracks2;\n  }\n  \n  if(!fgCandidates) fgCandidates = new TClonesArray(\"AliReducedPairInfo\", 100000);\n  fCandidates = fgCandidates;\n}\n\n\n\/\/____________________________________________________________________________\nAliReducedBaseEvent::~AliReducedBaseEvent()\n{\n  \/\/\n  \/\/ De-Constructor\n  \/\/\n}\n\n\/\/____________________________________________________________________________\nvoid AliReducedBaseEvent::CopyEventHeader(const AliReducedBaseEvent* other) {\n   \/\/\n   \/\/ assignment operator overloading\n   \/\/ NOTE: the fTracks and fCandidates arrays are not copied\n   \/\/\n   ClearEvent();\n   fEventTag = other->fEventTag;\n   fRunNo = other->fRunNo;\n   for(Int_t i=0; i<3; ++i) fVtx[i] = other->fVtx[i];\n   fNVtxContributors = other->fNVtxContributors;\n   for(Int_t i=0; i<7; ++i) fCentrality[i] = other->fCentrality[i];\n   fCentQuality = other->fCentQuality;\n   fNtracks[0] = other->fNtracks[0]; \n   fNV0candidates[0] = other->fNV0candidates[0];\n}\n\n\/\/_____________________________________________________________________________\nvoid AliReducedBaseEvent::ClearEvent() {\n  \/\/\n  \/\/ clear the event\n  \/\/\n  if(fTracks) fTracks->Clear(\"C\");\n  if(fTracks2) fTracks2->Clear(\"C\");\n  if(fCandidates) fCandidates->Clear(\"C\");\n  fEventTag = 0;\n  fRunNo = 0;\n  fCentQuality = 0;\n  for(Int_t i=0;i<7;++i) fCentrality[i] = -9999.0;\n  fNtracks[0] = 0; fNtracks[1] = 0;\n  fNV0candidates[0] = 0; fNV0candidates[1] = 0;\n  for(Int_t i=0; i<3; ++i) {fVtx[i]=-9999.;}\n  fNVtxContributors = 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\n# ifndef HERTZ_H\n# define HERTZ_H\n\n# include \"..\/PDBaseClass.hpp\"\n\nclass Hertz : public PDBaseClass {\n\nprivate:\n\n   double K;\n   const CommonParams& p;\n\npublic:\n\n   Hertz(const CommonParams&, const GetPot&);\n   ~Hertz();\n   void initParticles();\n   void fijFunc(int,int);\n\n   \/\/ fijFunc params\n   double rij[3]\n   double rijUnit[3];\n   double rijMag;\n   double s2s;\n   double fmag;\n\n};\n\n# endif  \/\/ HERTZ_H\n<commit_msg>fix small compile bug<commit_after>\n# ifndef HERTZ_H\n# define HERTZ_H\n\n# include \"..\/PDBaseClass.hpp\"\n\nclass Hertz : public PDBaseClass {\n\nprivate:\n\n   double K;\n   const CommonParams& p;\n\npublic:\n\n   Hertz(const CommonParams&, const GetPot&);\n   ~Hertz();\n   void initParticles();\n   void fijFunc(int,int);\n\n   \/\/ fijFunc params\n   double rij[3];\n   double rijUnit[3];\n   double rijMag;\n   double s2s;\n   double fmag;\n\n};\n\n# endif  \/\/ HERTZ_H\n<|endoftext|>"}
{"text":"<commit_before>#include <Input\/Input.h>\n#include <GLFW\/glfw3.h>\n#include <imgui\/imgui.h>\n#include <string>\n\nusing namespace Osm;\nusing namespace std;\n\nvoid joystick_callback(int joy, int event)\n{\n\tif (event == GLFW_CONNECTED)\n\t{\n\t\tEngine.Input().AddJoystick(joy);\n\t}\n\telse if (event == GLFW_DISCONNECTED)\n\t{\n\t\tEngine.Input().RemoveJoystick(joy);\n\t}\n}\n\nInputManager::InputManager(CEngine& engine)\n\t: Component(engine)\n\t, _joyState(0)\n{\n\tInit();\n\tglfwSetJoystickCallback(joystick_callback);\n}\n\nvoid InputManager::Init()\n{\n\tfor (int i = GLFW_JOYSTICK_1; i < GLFW_JOYSTICK_LAST; i++)\n\t{\n\t\tif(glfwJoystickPresent(i))\n\t\t\tAddJoystick(i);\t\t\t\n\t}\n}\n\nvoid InputManager::Update()\n{\t\n\tfor (auto& i : _joyState)\n\t{\n\t\tint joy = i.first;\n\t\tJoystickState& state = i.second;\n\n\t\tint count;\t\t\t\t\n\t\tconst float* axes = glfwGetJoystickAxes(joy, &count);\n\n\t\tif (count != state.Axes.size())\n\t\t\tstate.Axes.resize(count);\n\t\tfor (int j = 0; j < count && j < JOYSTICK_AXIS_COUNT; j++)\n\t\t{\n\t\t\tstate.Axes[j] = axes[j];\n\t\t}\t\t\n\n\t\tconst unsigned char* buttons = glfwGetJoystickButtons(joy, &count);\n\t\tif (count != state.Buttons.size())\n\t\t\tstate.Buttons.resize(count);\n\t\tfor (int j = 0; j < count && JOYSTICK_BUTTON_COUNT; j++)\n\t\t{\n\t\t\tstate.Buttons[j] = buttons[j];\n\t\t}\n\t}\n}\n\nbool InputManager::GetJoystickButton(Joystick joystick, JoystickButtons button)\n{\n\tif (joystick < _joyState.size())\n\t{\n\t\treturn _joyState[joystick].Buttons[button];\n\t}\n\treturn false;\n}\n\nfloat InputManager::GetJoystickAxis(Joystick joystick, JoystickAxes axis)\n{\n\tif (joystick < _joyState.size())\n\t{\n\t\treturn _joyState[joystick].Axes[axis];\n\t}\n\treturn 0.0f;\n}\n\nstd::vector<Joystick> InputManager::GetActiveJoysticks() const\n{\n\tstd::vector<Joystick> active;\n\tfor(auto j : _joyState)\n\t\tactive.push_back(j.first);\n\treturn active;\n}\n\nvoid InputManager::AddJoystick(int joy)\n{\n\tJoystickState state;\n\n\tstring name(glfwGetJoystickName(joy));\n\tstate.Name = name + \" \" + to_string(joy);\n\t_joyState[joy] = state;\n}\n\nvoid InputManager::RemoveJoystick(int joy)\n{\n\t_joyState.erase(joy);\n}\n\n#ifdef INSPECTOR\nvoid InputManager::Inspect()\n{\n\tfor (auto i : _joyState)\n\t{\n\t\tauto j = i.second;\n\t\tif (ImGui::CollapsingHeader(j.Name.c_str()))\n\t\t{\n\t\t\tint i = 0;\n\t\t\tfor (auto a : j.Axes)\n\t\t\t{\n\t\t\t\tImGui::DragFloat((string(\"Axis \") + to_string(i)).c_str(), &a);\n\t\t\t\ti++;\n\t\t\t}\n\n\t\t\ti = 0;\n\t\t\tfor (auto b : j.Buttons)\n\t\t\t{\n\t\t\t\tImGui::DragInt((string(\"Buttons \") + to_string(i)).c_str(), &b);\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t}\n}\n#endif\n\nvoid InputManager::InitProfiles()\n{\n\t\/*\n\tProfile xboxOne;\n\txboxOne.Buttons\t\t= \n\t{\n\t\t0,\t\t\/\/ JOYSTICK_BUTTON_A\n\t\t1,\t\t\/\/ JOYSTICK_BUTTON_B\n\t\t2,\t\t\/\/ JOYSTICK_BUTTON_X\n\t\t3,\t\t\/\/ JOYSTICK_BUTTON_Y\n\t\t\/\/ JOYSTICK_BUTTON_LB\n\t\t\/\/ JOYSTICK_BUTTON_RB\n\t\t\/\/ JOYSTICK_BUTTON_BACK\n\t\t\/\/ JOYSTICK_BUTTON_START\n\t\t\/\/ JOYSTICK_BUTTON_DPAD_UP\n\t\t\/\/ JOYSTICK_BUTTON_DPAD_DOWN\n\t\t\/\/ JOYSTICK_BUTTON_DPAD_LEFT\n\t\t\/\/ JOYSTICK_BUTTON_DPAD_RIGHT\n\t\t\/\/ JOYSTICK_BUTTON_R3\n\t\t\/\/ JOYSTICK_BUTTON_L3\n\t};\n\txboxOne.Axes\t\t= {0, 1,  5, 4};\n\t*\/\n}<commit_msg>Working on fixing the input<commit_after>#include <Input\/Input.h>\n#include <GLFW\/glfw3.h>\n#include <imgui\/imgui.h>\n#include <string>\n#include <windows.h>\n\nusing namespace Osm;\nusing namespace std;\n\nDWORD mThread = -1;\nDWORD jThread = -1;\n\nvoid joystick_callback(int joy, int event)\n{\n\tjThread = GetCurrentThreadId();\n\tASSERT(jThread == mThread);\n\n\tif (event == GLFW_CONNECTED)\n\t{\n\t\tEngine.Input().AddJoystick(joy);\t\t\n\t}\n\telse if (event == GLFW_DISCONNECTED)\n\t{\n\t\tEngine.Input().RemoveJoystick(joy);\n\t}\n}\n\nInputManager::InputManager(CEngine& engine)\n\t: Component(engine)\n\t, _joyState(0)\n{\n\tmThread = GetCurrentThreadId();\n\n\tInit();\n\tglfwSetJoystickCallback(joystick_callback);\n}\n\nvoid InputManager::Init()\n{\n\tfor (int i = GLFW_JOYSTICK_1; i < GLFW_JOYSTICK_LAST; i++)\n\t{\n\t\tif(glfwJoystickPresent(i))\n\t\t\tAddJoystick(i);\t\t\t\n\t}\n}\n\nvoid InputManager::Update()\n{\t\n\tif (_joyState.size() == 0)\n\t\treturn;\n\n\tfor (auto& i : _joyState)\n\t{\n\t\tint joy = i.first;\n\t\tJoystickState& state = i.second;\n\n\t\tint count;\t\t\t\t\n\t\tconst float* axes = glfwGetJoystickAxes(joy, &count);\n\n\t\tif (count != state.Axes.size())\n\t\t\tstate.Axes.resize(count);\n\t\tfor (int j = 0; j < count && j < JOYSTICK_AXIS_COUNT; j++)\n\t\t{\n\t\t\tstate.Axes[j] = axes[j];\n\t\t}\t\t\n\n\t\tconst unsigned char* buttons = glfwGetJoystickButtons(joy, &count);\n\t\tif (count != state.Buttons.size())\n\t\t\tstate.Buttons.resize(count);\n\t\tfor (int j = 0; j < count && JOYSTICK_BUTTON_COUNT; j++)\n\t\t{\n\t\t\tstate.Buttons[j] = buttons[j];\n\t\t}\n\t}\n}\n\nbool InputManager::GetJoystickButton(Joystick joystick, JoystickButtons button)\n{\n\tif (joystick < _joyState.size())\n\t{\n\t\treturn _joyState[joystick].Buttons[button];\n\t}\n\treturn false;\n}\n\nfloat InputManager::GetJoystickAxis(Joystick joystick, JoystickAxes axis)\n{\n\tif (joystick < _joyState.size())\n\t{\n\t\treturn _joyState[joystick].Axes[axis];\n\t}\n\treturn 0.0f;\n}\n\nstd::vector<Joystick> InputManager::GetActiveJoysticks() const\n{\n\tstd::vector<Joystick> active;\n\tfor(auto j : _joyState)\n\t\tactive.push_back(j.first);\n\treturn active;\n}\n\nvoid InputManager::AddJoystick(int joy)\n{\n\tstring name(glfwGetJoystickName(joy));\t\n\tJoystickState state;\n\tstate.Name = name + \" \" + to_string(joy);\n\tLOG(\"Joystick %s connected.\", name.c_str());\n\t_joyState[joy] = state;\n\t\n}\n\nvoid InputManager::RemoveJoystick(int joy)\n{\t\n\tauto itr = _joyState.find(joy);\n\tif(itr != _joyState.end())\n\t{\n\t\tJoystickState& state = itr->second;\n\t\tLOG(\"Joystick %s disconnected.\", state.Name.c_str());\n\t\t_joyState.erase(joy);\n\t}\t\n}\n\n#ifdef INSPECTOR\nvoid InputManager::Inspect()\n{\n\tfor (auto i : _joyState)\n\t{\n\t\tauto j = i.second;\n\t\tif (ImGui::CollapsingHeader(j.Name.c_str()))\n\t\t{\n\t\t\tint i = 0;\n\t\t\tfor (auto a : j.Axes)\n\t\t\t{\n\t\t\t\tImGui::DragFloat((string(\"Axis \") + to_string(i)).c_str(), &a);\n\t\t\t\ti++;\n\t\t\t}\n\n\t\t\ti = 0;\n\t\t\tfor (auto b : j.Buttons)\n\t\t\t{\n\t\t\t\tImGui::DragInt((string(\"Buttons \") + to_string(i)).c_str(), &b);\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t}\n}\n#endif\n\nvoid InputManager::InitProfiles()\n{\n\t\/*\n\tProfile xboxOne;\n\txboxOne.Buttons\t\t= \n\t{\n\t\t0,\t\t\/\/ JOYSTICK_BUTTON_A\n\t\t1,\t\t\/\/ JOYSTICK_BUTTON_B\n\t\t2,\t\t\/\/ JOYSTICK_BUTTON_X\n\t\t3,\t\t\/\/ JOYSTICK_BUTTON_Y\n\t\t\/\/ JOYSTICK_BUTTON_LB\n\t\t\/\/ JOYSTICK_BUTTON_RB\n\t\t\/\/ JOYSTICK_BUTTON_BACK\n\t\t\/\/ JOYSTICK_BUTTON_START\n\t\t\/\/ JOYSTICK_BUTTON_DPAD_UP\n\t\t\/\/ JOYSTICK_BUTTON_DPAD_DOWN\n\t\t\/\/ JOYSTICK_BUTTON_DPAD_LEFT\n\t\t\/\/ JOYSTICK_BUTTON_DPAD_RIGHT\n\t\t\/\/ JOYSTICK_BUTTON_R3\n\t\t\/\/ JOYSTICK_BUTTON_L3\n\t};\n\txboxOne.Axes\t\t= {0, 1,  5, 4};\n\t*\/\n}<|endoftext|>"}
{"text":"<commit_before>\/\/first main function\n\n\nvoid main() {\n\n}<commit_msg>testing printf func.<commit_after>\/\/first main function\n#include <stdio.h>\n\nvoid main() {\n\tprintf(\"hello, world!\");\n}<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  KeyObjects.cpp\n\/\/  RIVR\n\/\/\n\/\/  Created by James Rees on 23\/03\/2015.\n\/\/  Copyright (c) 2015 James Rees. All rights reserved.\n\/\/\n\n#include \"KeyObjects.h\"\n#include \"TextureLoader.h\"\n\nKeyObjects::KeyObjects(){\n    this->collidable = true;\n    this->isColliding = false;\n}\n\n\nvoid KeyObjects::generate(){\n    \n    GLfloat vertices[] = {\n        -0.5f, -0.5f, -0.5f,   -0.0f, 0.0f,\n        0.5f, -0.5f, -0.5f,    -1.0f, 0.0f,\n        0.5f,  0.5f, -0.5f,    -1.0f, 1.0f,\n        0.5f,  0.5f, -0.5f,    -1.0f, 1.0f,\n        -0.5f,  0.5f, -0.5f,   -0.0f, 1.0f,\n        -0.5f, -0.5f, -0.5f,   -0.0f, 0.0f,\n        \n        -0.5f, -0.5f,  0.5f,   0.0f, -0.0f,\n        0.5f, -0.5f,  0.5f,    1.0f, -0.0f,\n        0.5f,  0.5f,  0.5f,    1.0f, -1.0f,\n        0.5f,  0.5f,  0.5f,    1.0f, -1.0f,\n        -0.5f,  0.5f,  0.5f,   0.0f, -1.0f,\n        -0.5f, -0.5f,  0.5f,   0.0f, -0.0f,\n        \n        -0.5f,  0.5f,  0.5f,  1.0f, -0.0f,\n        -0.5f,  0.5f, -0.5f,  1.0f, -1.0f,\n        -0.5f, -0.5f, -0.5f,  0.0f, -1.0f,\n        -0.5f, -0.5f, -0.5f,  0.0f, -1.0f,\n        -0.5f, -0.5f,  0.5f,  0.0f, -0.0f,\n        -0.5f,  0.5f,  0.5f,  1.0f, -0.0f,\n        \n        0.5f,  0.5f,  0.5f,  1.0f, -0.0f,\n        0.5f,  0.5f, -0.5f,  1.0f, -1.0f,\n        0.5f, -0.5f, -0.5f,  0.0f, -1.0f,\n        0.5f, -0.5f, -0.5f,  0.0f, -1.0f,\n        0.5f, -0.5f,  0.5f,  0.0f, -0.0f,\n        0.5f,  0.5f,  0.5f,  1.0f, -0.0f,\n        \n        -0.5f, -0.5f, -0.5f,  0.0f, -1.0f,\n        0.5f, -0.5f, -0.5f,  1.0f, -1.0f,\n        0.5f, -0.5f,  0.5f,  1.0f, -0.0f,\n        0.5f, -0.5f,  0.5f,  1.0f, -0.0f,\n        -0.5f, -0.5f,  0.5f,  0.0f,- 0.0f,\n        -0.5f, -0.5f, -0.5f,  0.0f, -1.0f,\n        \n        -0.5f,  0.5f, -0.5f,  0.0f, -1.0f,\n        0.5f,  0.5f, -0.5f,  1.0f, -1.0f,\n        0.5f,  0.5f,  0.5f,  1.0f, -0.0f,\n        0.5f,  0.5f,  0.5f,  1.0f, -0.0f,\n        -0.5f,  0.5f,  0.5f,  0.0f, -0.0f,\n        -0.5f,  0.5f, -0.5f,  0.0f, -1.0f\n    };\n    if(this->isUpper == true){\n        this->textureFilePath = this->upperImagePath;\n    }else{\n        this->textureFilePath = this->lowerImagePath;\n    }\n    \/\/ Create buffers\/arrays\n    glGenVertexArrays(1, &this->VAO);\n    glGenBuffers(1, &this->VBO);\n    \n    \n    glBindVertexArray(VAO);\n    \n    glBindBuffer(GL_ARRAY_BUFFER, VBO);\n    glBufferData(GL_ARRAY_BUFFER, sizeof(vertices), vertices, GL_STATIC_DRAW);\n    \/\/ Position attribute\n    glVertexAttribPointer(0, 3, GL_FLOAT, GL_FALSE, 5 * sizeof(GLfloat), (GLvoid*)0);\n    glEnableVertexAttribArray(0);\n    \/\/ TexCoord attribute\n    glVertexAttribPointer(2, 2, GL_FLOAT, GL_FALSE, 5 * sizeof(GLfloat), (GLvoid*)(3 * sizeof(GLfloat)));\n    glEnableVertexAttribArray(2);\n    \n    glBindVertexArray(0); \/\/ Unbind VAO\n    \n    \n    int width, height;\n    unsigned char* image;\n    \n    \/\/Textues are loaded here.\n    \n    image = SOIL_load_image(this->textureFilePath, &width, &height, 0, SOIL_LOAD_RGB);\n    SOIL_free_image_data(image);\n    this->keyTexture.Generate(width, height, image);\n}\nvoid KeyObjects::update(){\n    \n    \n    \n    \n    if(this->isUpper == true){\n        this->textureFilePath = this->upperImagePath;\n    }else{\n        this->textureFilePath = this->lowerImagePath;\n    }\n    int width, height;\n    unsigned char* image;\n    \n    \/\/Textues are loaded here.\n    \n    image = SOIL_load_image(this->textureFilePath, &width, &height, 0, SOIL_LOAD_RGB);\n    SOIL_free_image_data(image);\n    this->keyTexture.Generate(width, height, image);\n    \n    \n}\nvoid KeyObjects::Draw(glm::mat4 view, glm::mat4 projection, Shader ourShader){\n    \n    \n    ourShader.Use();\n    keyTexture.Bind();\n    glm::mat4 model;\n\/\/ glm::mat4 mv;\n    model = glm::translate(model, glm::vec3(this->getPosition().x, this->getPosition().y , this->getPosition().z));\n\n \/\/   mv = model * view;\n    model = glm::scale(model, glm::vec3(this->getScale().x, this->getScale().y, this->getScale().z));\n    \n   \/\/ this->setTestPosition(mv * glm::vec4(0, 0, 0, 1));\n    \n\n    \n  \/\/  glUniform4f(collidableColorLocation, 1000.0f, 1.5f, 1.0f, 1.0f);\n    glUniformMatrix4fv(modelLocation, 1, GL_FALSE, glm::value_ptr(model));\n    glUniformMatrix4fv(viewLocation, 1, GL_FALSE, glm::value_ptr(view));\n    glUniformMatrix4fv(projectionLocation, 1, GL_FALSE, glm::value_ptr(projection));\n    \n   \n    if(this->isColliding == true){\n        glUniform1f(glGetUniformLocation(ourShader.Program, \"collide\"), 1000.0f);\n    }else{\n        glUniform1f(glGetUniformLocation(ourShader.Program, \"collide\"), 1.0f);\n    }\n\n    \/\/glUniformMatrix4fv(collidableColorLocation, 1, GL_FALSE, glm::value_ptr(colColor));\n   \/\/ glUniform3fv(collidableColorLocation, 1, GL_FALSE, glm::value_ptr(colColor));\n   \n \n    \n    glBindVertexArray(this->VAO);\n    glDrawArrays(GL_TRIANGLES, 0, 36);\n    glBindVertexArray(0);\n}\n\nchar KeyObjects::getKey(){\n   \n    if(this->isUpper == true){\n        return this->key2;\n    }else{\n        return this->key;\n    }\n}\n\nbool KeyObjects::getColliding(){\n    return this->isColliding;\n}\nvoid KeyObjects::setColliding(bool inCollision){\n    isColliding = true;\n  \n\n}\nvoid KeyObjects::setKey(char inChar, char inChar2){\n\n        this->key = inChar;\n        this->key2 = inChar2;\n    \n}\nvoid KeyObjects::setCase(bool letterCase){\n    \n    this->isUpper = letterCase;\n    \n}\nvoid KeyObjects::setUpperImage(const char* image1){\n    this->upperImagePath = image1;\n}\nvoid KeyObjects::setLowerImage(const char* image2){\n    \n    this->lowerImagePath = image2;\n    \n}\nvoid KeyObjects::setShaderUniforms(Shader ourShader){\n    collideLocation = glGetUniformLocation(ourShader.Program, \"collide\");\n    modelLocation = glGetUniformLocation(ourShader.Program, \"model\");\n    viewLocation = glGetUniformLocation(ourShader.Program, \"view\");\n    projectionLocation = glGetUniformLocation(ourShader.Program, \"projection\");\n\n   \n}<commit_msg>Fixed a bug that made the keys stay red.<commit_after>\/\/\n\/\/  KeyObjects.cpp\n\/\/  RIVR\n\/\/\n\/\/  Created by James Rees on 23\/03\/2015.\n\/\/  Copyright (c) 2015 James Rees. All rights reserved.\n\/\/\n\n#include \"KeyObjects.h\"\n#include \"TextureLoader.h\"\n\nKeyObjects::KeyObjects(){\n    this->collidable = true;\n    this->isColliding = false;\n}\n\n\nvoid KeyObjects::generate(){\n    \n    GLfloat vertices[] = {\n        -0.5f, -0.5f, -0.5f,   -0.0f, 0.0f,\n        0.5f, -0.5f, -0.5f,    -1.0f, 0.0f,\n        0.5f,  0.5f, -0.5f,    -1.0f, 1.0f,\n        0.5f,  0.5f, -0.5f,    -1.0f, 1.0f,\n        -0.5f,  0.5f, -0.5f,   -0.0f, 1.0f,\n        -0.5f, -0.5f, -0.5f,   -0.0f, 0.0f,\n        \n        -0.5f, -0.5f,  0.5f,   0.0f, -0.0f,\n        0.5f, -0.5f,  0.5f,    1.0f, -0.0f,\n        0.5f,  0.5f,  0.5f,    1.0f, -1.0f,\n        0.5f,  0.5f,  0.5f,    1.0f, -1.0f,\n        -0.5f,  0.5f,  0.5f,   0.0f, -1.0f,\n        -0.5f, -0.5f,  0.5f,   0.0f, -0.0f,\n        \n        -0.5f,  0.5f,  0.5f,  1.0f, -0.0f,\n        -0.5f,  0.5f, -0.5f,  1.0f, -1.0f,\n        -0.5f, -0.5f, -0.5f,  0.0f, -1.0f,\n        -0.5f, -0.5f, -0.5f,  0.0f, -1.0f,\n        -0.5f, -0.5f,  0.5f,  0.0f, -0.0f,\n        -0.5f,  0.5f,  0.5f,  1.0f, -0.0f,\n        \n        0.5f,  0.5f,  0.5f,  1.0f, -0.0f,\n        0.5f,  0.5f, -0.5f,  1.0f, -1.0f,\n        0.5f, -0.5f, -0.5f,  0.0f, -1.0f,\n        0.5f, -0.5f, -0.5f,  0.0f, -1.0f,\n        0.5f, -0.5f,  0.5f,  0.0f, -0.0f,\n        0.5f,  0.5f,  0.5f,  1.0f, -0.0f,\n        \n        -0.5f, -0.5f, -0.5f,  0.0f, -1.0f,\n        0.5f, -0.5f, -0.5f,  1.0f, -1.0f,\n        0.5f, -0.5f,  0.5f,  1.0f, -0.0f,\n        0.5f, -0.5f,  0.5f,  1.0f, -0.0f,\n        -0.5f, -0.5f,  0.5f,  0.0f,- 0.0f,\n        -0.5f, -0.5f, -0.5f,  0.0f, -1.0f,\n        \n        -0.5f,  0.5f, -0.5f,  0.0f, -1.0f,\n        0.5f,  0.5f, -0.5f,  1.0f, -1.0f,\n        0.5f,  0.5f,  0.5f,  1.0f, -0.0f,\n        0.5f,  0.5f,  0.5f,  1.0f, -0.0f,\n        -0.5f,  0.5f,  0.5f,  0.0f, -0.0f,\n        -0.5f,  0.5f, -0.5f,  0.0f, -1.0f\n    };\n    if(this->isUpper == true){\n        this->textureFilePath = this->upperImagePath;\n    }else{\n        this->textureFilePath = this->lowerImagePath;\n    }\n    \/\/ Create buffers\/arrays\n    glGenVertexArrays(1, &this->VAO);\n    glGenBuffers(1, &this->VBO);\n    \n    \n    glBindVertexArray(VAO);\n    \n    glBindBuffer(GL_ARRAY_BUFFER, VBO);\n    glBufferData(GL_ARRAY_BUFFER, sizeof(vertices), vertices, GL_STATIC_DRAW);\n    \/\/ Position attribute\n    glVertexAttribPointer(0, 3, GL_FLOAT, GL_FALSE, 5 * sizeof(GLfloat), (GLvoid*)0);\n    glEnableVertexAttribArray(0);\n    \/\/ TexCoord attribute\n    glVertexAttribPointer(2, 2, GL_FLOAT, GL_FALSE, 5 * sizeof(GLfloat), (GLvoid*)(3 * sizeof(GLfloat)));\n    glEnableVertexAttribArray(2);\n    \n    glBindVertexArray(0); \/\/ Unbind VAO\n    \n    \n    int width, height;\n    unsigned char* image;\n    \n    \/\/Textues are loaded here.\n    \n    image = SOIL_load_image(this->textureFilePath, &width, &height, 0, SOIL_LOAD_RGB);\n    SOIL_free_image_data(image);\n    this->keyTexture.Generate(width, height, image);\n}\nvoid KeyObjects::update(){\n    \n    \n    \n    \n    if(this->isUpper == true){\n        this->textureFilePath = this->upperImagePath;\n    }else{\n        this->textureFilePath = this->lowerImagePath;\n    }\n    int width, height;\n    unsigned char* image;\n    \n    \/\/Textues are loaded here.\n    \n    image = SOIL_load_image(this->textureFilePath, &width, &height, 0, SOIL_LOAD_RGB);\n    SOIL_free_image_data(image);\n    this->keyTexture.Generate(width, height, image);\n    \n    \n}\nvoid KeyObjects::Draw(glm::mat4 view, glm::mat4 projection, Shader ourShader){\n    \n    \n    ourShader.Use();\n    keyTexture.Bind();\n    glm::mat4 model;\n\/\/ glm::mat4 mv;\n    model = glm::translate(model, glm::vec3(this->getPosition().x, this->getPosition().y , this->getPosition().z));\n\n \/\/   mv = model * view;\n    model = glm::scale(model, glm::vec3(this->getScale().x, this->getScale().y, this->getScale().z));\n    \n   \/\/ this->setTestPosition(mv * glm::vec4(0, 0, 0, 1));\n    \n\n    \n  \/\/  glUniform4f(collidableColorLocation, 1000.0f, 1.5f, 1.0f, 1.0f);\n    glUniformMatrix4fv(modelLocation, 1, GL_FALSE, glm::value_ptr(model));\n    glUniformMatrix4fv(viewLocation, 1, GL_FALSE, glm::value_ptr(view));\n    glUniformMatrix4fv(projectionLocation, 1, GL_FALSE, glm::value_ptr(projection));\n    \n   \n    if(this->getColliding() == true){\n        glUniform1f(glGetUniformLocation(ourShader.Program, \"collide\"), 1000.0f);\n    }else{\n        glUniform1f(glGetUniformLocation(ourShader.Program, \"collide\"), 1.0f);\n    }\n\n    \/\/glUniformMatrix4fv(collidableColorLocation, 1, GL_FALSE, glm::value_ptr(colColor));\n   \/\/ glUniform3fv(collidableColorLocation, 1, GL_FALSE, glm::value_ptr(colColor));\n   \n \n    \n    glBindVertexArray(this->VAO);\n    glDrawArrays(GL_TRIANGLES, 0, 36);\n    glBindVertexArray(0);\n}\n\nchar KeyObjects::getKey(){\n   \n    if(this->isUpper == true){\n        return this->key2;\n    }else{\n        return this->key;\n    }\n}\n\nbool KeyObjects::getColliding(){\n    return this->isColliding;\n}\nvoid KeyObjects::setColliding(bool inCollision){\n    isColliding = inCollision;\n}\nvoid KeyObjects::setKey(char inChar, char inChar2){\n\n        this->key = inChar;\n        this->key2 = inChar2;\n    \n}\nvoid KeyObjects::setCase(bool letterCase){\n    \n    this->isUpper = letterCase;\n    \n}\nvoid KeyObjects::setUpperImage(const char* image1){\n    this->upperImagePath = image1;\n}\nvoid KeyObjects::setLowerImage(const char* image2){\n    \n    this->lowerImagePath = image2;\n    \n}\nvoid KeyObjects::setShaderUniforms(Shader ourShader){\n    collideLocation = glGetUniformLocation(ourShader.Program, \"collide\");\n    modelLocation = glGetUniformLocation(ourShader.Program, \"model\");\n    viewLocation = glGetUniformLocation(ourShader.Program, \"view\");\n    projectionLocation = glGetUniformLocation(ourShader.Program, \"projection\");\n\n   \n}<|endoftext|>"}
{"text":"<commit_before>\/*\n * OjaKernelConn.cpp\n *\n *  Created on: Oct 10, 2012\n *      Author: pschultz\n *\/\n\n#include \"OjaKernelConn.hpp\"\n\nnamespace PV {\nOjaKernelConn::OjaKernelConn(const char * name, HyPerCol * hc, HyPerLayer * pre, HyPerLayer * post,\n                             const char * filename, InitWeights *weightInit) {\n   initialize_base();\n   initialize(name, hc, pre, post, filename, weightInit);\n}\n\nOjaKernelConn::OjaKernelConn()\n{\n   initialize_base();\n}\n\nOjaKernelConn::~OjaKernelConn() {\n   free(inputFiringRate[0]); inputFiringRate[0] = NULL;\n   free(inputFiringRate); inputFiringRate = NULL;\n   free(outputFiringRate); outputFiringRate = NULL;\n}\n\nint OjaKernelConn::initialize_base() {\n   return PV_SUCCESS;\n}\n\nint OjaKernelConn::initialize(const char * name, HyPerCol * hc, HyPerLayer * pre, HyPerLayer * post,\n      const char * filename, InitWeights *weightInit) {\n   int status = KernelConn::initialize(name, hc, pre, post, filename, weightInit);\n   learningTime = readLearningTime();\n   inputTargetRate = 0.001*readInputTargetRate(); \/\/ params file specifies target rates\n   outputTargetRate = 0.001*readOutputTargetRate();\n   integrationTime = readIntegrationTime();\n\n   int numarbors = numberOfAxonalArborLists();\n   int n_pre_ext = getNumWeightPatches();\n   int n_post = post->getNumNeurons();\n   inputFiringRate = (pvdata_t **) calloc(numarbors, sizeof(pvdata_t *));\n   if (inputFiringRate == NULL) {\n      fprintf(stderr, \"OjaKernelConn::initialize error for layer \\\"%s\\\": unable to allocate memory for input firing rates\\n\", name);\n      abort();\n   }\n   inputFiringRate[0] = (pvdata_t *) calloc(n_pre_ext*numarbors, sizeof(pvdata_t));\n   if (inputFiringRate[0] == NULL) {\n      fprintf(stderr, \"OjaKernelConn::initialize error for layer \\\"%s\\\": unable to allocate memory for input firing rates\\n\", name);\n      abort();\n   }\n   for (int arbor=1; arbor<numarbors; arbor++) {\n      inputFiringRate[arbor] = inputFiringRate[0] + arbor*n_post;\n   }\n   outputFiringRate = (pvdata_t *) calloc(n_post, sizeof(pvdata_t *));\n   if (outputFiringRate == NULL) {\n      fprintf(stderr, \"OjaKernelConn::initialize error for layer \\\"%s\\\": unable to allocate memory for output firing rates\\n\", name);\n      abort();\n   }\n   return status;\n}\n\nint OjaKernelConn::updateState(double timef, double dt) {\n\n   float decayfactor = expf(-parent->getDeltaTime()\/integrationTime);\n   \/\/ Update output firing rate\n   const PVLayerLoc * postloc = post->getLayerLoc();\n   for (int kpost=0; kpost<post->getNumNeurons(); kpost++) {\n      int kpostext = kIndexExtended(kpost, postloc->nx, postloc->ny, postloc->nf, postloc->nb);\n      outputFiringRate[kpost] = decayfactor * (outputFiringRate[kpost] + post->getActivity()[kpostext]\/integrationTime);\n   }\n   \/\/ Update input firing rates\n   for (int arbor=0; arbor<numberOfAxonalArborLists(); arbor++) {\n      pvdata_t * input_rate = inputFiringRate[arbor];\n      for (int kex=0; kex<getNumWeightPatches(); kex++) {\n         input_rate[kex] = decayfactor * (input_rate[kex] + pre->getLayerData(getDelay(arbor))[kex]\/integrationTime);\n      }\n   }\n\n\n   \/\/ HyPerConn::updateState calls update_dW and updateWeights; we override update_dW but there is no need to override updateWeights\n   int status = HyPerConn::updateState(timef, dt);\n\n   return status;\n}\n\nint OjaKernelConn::update_dW(int axonId) {\n   int status = PV_SUCCESS;\n   assert(axonId>=0 && axonId<this->numberOfAxonalArborLists());\n   pvdata_t * input_rate = inputFiringRate[axonId];\n\n   \/\/ Update weights\n   int sya = post->getLayerLoc()->nf * post->getLayerLoc()->nx;\n\n   for (int kex=0; kex<getNumWeightPatches(); kex++) {\n      PVPatch * weights = getWeights(kex,axonId);\n      int offset = getGSynPatchStart(kex,axonId)-post->getChannel(channel);\n      int ny = weights->ny;\n      int nk = weights->nx * nfp;\n      pvdata_t * dwdata = get_dwData(axonId, kex);\n      const pvdata_t * wdata = get_wData(axonId, kex);\n      int lineoffsetw = 0;\n      int lineoffsetg = 0;\n      pvdata_t inputFR = input_rate[kex];\n      for( int y=0; y<ny; y++ ) {\n         for( int k=0; k<nk; k++ ) {\n            if(offset+lineoffsetg+k<0 || offset+lineoffsetg+k>=post->getNumNeurons()) {\n               fprintf(stderr, \"%s offset=%d, lineoffseta=%d, k=%d, numNeurons=%d\\n\", name, offset, lineoffsetg, k, post->getNumNeurons());\n               abort();\n            }\n            pvdata_t outputFR = outputFiringRate[offset+lineoffsetg+k];\n            dwdata[lineoffsetw + k] += (inputFR - wdata[lineoffsetw+k]*outputFR)*outputFR;\n         }\n         lineoffsetw += syp;\n         lineoffsetg += sya;\n      }\n   }\n   \/\/ Multiply by dt*learningRate, normalize by dividing by inputTargetRate*outputTargetRate, and average by dividing by (numNeurons\/numKernels)\n   int numKernelIndices = getNumDataPatches();\n   int divisor = pre->getNumNeurons()\/numKernelIndices;\n   assert( divisor*numKernelIndices == pre->getNumNeurons() );\n   float scalefactor = parent->getDeltaTime()\/getLearningTime()\/(getInputTargetRate()*getOutputTargetRate())\/((float) divisor);\n   for( int kernelindex=0; kernelindex<numKernelIndices; kernelindex++ ) {\n      int numpatchitems = nxp*nyp*nfp;\n      pvdata_t * dwpatchdata = get_dwDataHead(axonId,kernelindex);\n      for( int n=0; n<numpatchitems; n++ ) {\n         dwpatchdata[n] *= scalefactor;\n      }\n   }\n   \/\/ Averaging across processes is done in reduceKernels().\n\n   return status;\n}\n\nint OjaKernelConn::checkpointRead(const char * cpDir, double * timef) {\n   int status = KernelConn::checkpointRead(cpDir, timef);\n   char filename[PV_PATH_MAX];\n   int chars_needed;\n   chars_needed = snprintf(filename, PV_PATH_MAX, \"%s\/%s_outputFiringRate.pvp\", cpDir, name);\n   if (chars_needed>=PV_PATH_MAX) {\n      if (parent->columnId()==0) {\n         fprintf(stderr, \"OjaKernelConn::checkpointRead error: Path \\\"%s\/%s_outputFiringRate.pvp\\\" is too long.\\n\", cpDir, name);\n         abort();\n      }\n   }\n   double timed;\n   HyPerLayer::readBufferFile(filename, parent->icCommunicator(), &timed, outputFiringRate, 1, \/*extended*\/false, \/*contiguous*\/false, post->getLayerLoc());\n\n   const PVLayerLoc * preloc = pre->getLayerLoc();\n   chars_needed = snprintf(filename, PV_PATH_MAX, \"%s\/%s_inputFiringRate.pvp\", cpDir, name);\n   assert(chars_needed<PV_PATH_MAX);\n   HyPerLayer::readBufferFile(filename, parent->icCommunicator(), &timed, inputFiringRate[0], numberOfAxonalArborLists(), \/*extended*\/true, \/*contiguous*\/false, preloc);\n\n   \/\/ Apply mirror boundary conditions\n\n   \/\/ Exchange borders\n   MPI_Datatype * mpi_datatype = Communicator::newDatatypes(preloc);\n   PVLayerCube cube;\n   memcpy(&cube.loc, preloc, sizeof(PVLayerLoc));\n   cube.numItems = pre->getNumExtended();\n   cube.size = sizeof(pvdata_t)*cube.numItems + sizeof(PVLayerCube); \/\/ Should be okay even though cube's data is not in place, since the mirrorTo functions don't use the size field\n   for (int arbor=0; arbor<numberOfAxonalArborLists(); arbor++) {\n      cube.data = inputFiringRate[0];\n      if ( pre->useMirrorBCs() ) {\n         for (int borderId = 1; borderId < NUM_NEIGHBORHOOD; borderId++){\n            pre->mirrorInteriorToBorder(borderId, &cube, &cube);\n         }\n      }\n      parent->icCommunicator()->exchange(inputFiringRate[0], mpi_datatype, preloc);\n   }\n   Communicator::freeDatatypes(mpi_datatype);\n\n   return status;\n}\nint OjaKernelConn::checkpointWrite(const char * cpDir) {\n   int status = KernelConn::checkpointWrite(cpDir);\n   char filename[PV_PATH_MAX];\n   int chars_needed;\n   chars_needed = snprintf(filename, PV_PATH_MAX, \"%s\/%s_outputFiringRate.pvp\", cpDir, name);\n   if (chars_needed>=PV_PATH_MAX) {\n      if (parent->columnId()==0) {\n         fprintf(stderr, \"OjaKernelConn::checkpointWrite error: Path \\\"%s\/%s_outputFiringRate.pvp\\\" is too long.\\n\", cpDir, name);\n         abort();\n      }\n   }\n   HyPerLayer::writeBufferFile(filename, parent->icCommunicator(), (double) parent->simulationTime(), outputFiringRate, 1, \/*extended*\/ false, \/*contiguous*\/ false, post->getLayerLoc());\n   chars_needed = snprintf(filename, PV_PATH_MAX, \"%s\/%s_inputFiringRate.pvp\", cpDir, name);\n   assert(chars_needed<PV_PATH_MAX);\n   HyPerLayer::writeBufferFile(filename, parent->icCommunicator(), (double) parent->simulationTime(), inputFiringRate[0], numberOfAxonalArborLists(), \/*extended*\/ true, \/*contiguous*\/ false, pre->getLayerLoc());\n   return status;\n}\n\n} \/* namespace PV *\/\n<commit_msg>OjaKernelConn::updateState calls KernelConn::updateState instead of HyPerConn::updateState<commit_after>\/*\n * OjaKernelConn.cpp\n *\n *  Created on: Oct 10, 2012\n *      Author: pschultz\n *\/\n\n#include \"OjaKernelConn.hpp\"\n\nnamespace PV {\nOjaKernelConn::OjaKernelConn(const char * name, HyPerCol * hc, HyPerLayer * pre, HyPerLayer * post,\n                             const char * filename, InitWeights *weightInit) {\n   initialize_base();\n   initialize(name, hc, pre, post, filename, weightInit);\n}\n\nOjaKernelConn::OjaKernelConn()\n{\n   initialize_base();\n}\n\nOjaKernelConn::~OjaKernelConn() {\n   free(inputFiringRate[0]); inputFiringRate[0] = NULL;\n   free(inputFiringRate); inputFiringRate = NULL;\n   free(outputFiringRate); outputFiringRate = NULL;\n}\n\nint OjaKernelConn::initialize_base() {\n   return PV_SUCCESS;\n}\n\nint OjaKernelConn::initialize(const char * name, HyPerCol * hc, HyPerLayer * pre, HyPerLayer * post,\n      const char * filename, InitWeights *weightInit) {\n   int status = KernelConn::initialize(name, hc, pre, post, filename, weightInit);\n   learningTime = readLearningTime();\n   inputTargetRate = 0.001*readInputTargetRate(); \/\/ params file specifies target rates\n   outputTargetRate = 0.001*readOutputTargetRate();\n   integrationTime = readIntegrationTime();\n\n   int numarbors = numberOfAxonalArborLists();\n   int n_pre_ext = getNumWeightPatches();\n   int n_post = post->getNumNeurons();\n   inputFiringRate = (pvdata_t **) calloc(numarbors, sizeof(pvdata_t *));\n   if (inputFiringRate == NULL) {\n      fprintf(stderr, \"OjaKernelConn::initialize error for layer \\\"%s\\\": unable to allocate memory for input firing rates\\n\", name);\n      abort();\n   }\n   inputFiringRate[0] = (pvdata_t *) calloc(n_pre_ext*numarbors, sizeof(pvdata_t));\n   if (inputFiringRate[0] == NULL) {\n      fprintf(stderr, \"OjaKernelConn::initialize error for layer \\\"%s\\\": unable to allocate memory for input firing rates\\n\", name);\n      abort();\n   }\n   for (int arbor=1; arbor<numarbors; arbor++) {\n      inputFiringRate[arbor] = inputFiringRate[0] + arbor*n_post;\n   }\n   outputFiringRate = (pvdata_t *) calloc(n_post, sizeof(pvdata_t *));\n   if (outputFiringRate == NULL) {\n      fprintf(stderr, \"OjaKernelConn::initialize error for layer \\\"%s\\\": unable to allocate memory for output firing rates\\n\", name);\n      abort();\n   }\n   return status;\n}\n\nint OjaKernelConn::updateState(double timef, double dt) {\n\n   float decayfactor = expf(-parent->getDeltaTime()\/integrationTime);\n   \/\/ Update output firing rate\n   const PVLayerLoc * postloc = post->getLayerLoc();\n   for (int kpost=0; kpost<post->getNumNeurons(); kpost++) {\n      int kpostext = kIndexExtended(kpost, postloc->nx, postloc->ny, postloc->nf, postloc->nb);\n      outputFiringRate[kpost] = decayfactor * (outputFiringRate[kpost] + post->getActivity()[kpostext]\/integrationTime);\n   }\n   \/\/ Update input firing rates\n   for (int arbor=0; arbor<numberOfAxonalArborLists(); arbor++) {\n      pvdata_t * input_rate = inputFiringRate[arbor];\n      for (int kex=0; kex<getNumWeightPatches(); kex++) {\n         input_rate[kex] = decayfactor * (input_rate[kex] + pre->getLayerData(getDelay(arbor))[kex]\/integrationTime);\n      }\n   }\n\n\n   \/\/ HyPerConn::updateState calls update_dW and updateWeights; we override update_dW but there is no need to override updateWeights\n   int status = KernelConn::updateState(timef, dt);\n\n   return status;\n}\n\nint OjaKernelConn::update_dW(int axonId) {\n   int status = PV_SUCCESS;\n   assert(axonId>=0 && axonId<this->numberOfAxonalArborLists());\n   pvdata_t * input_rate = inputFiringRate[axonId];\n\n   \/\/ Update weights\n   int syg = post->getLayerLoc()->nf * post->getLayerLoc()->nx;\n\n   for (int kex=0; kex<getNumWeightPatches(); kex++) {\n      PVPatch * weights = getWeights(kex,axonId);\n      int offset = getGSynPatchStart(kex,axonId)-post->getChannel(channel);\n      int ny = weights->ny;\n      int nk = weights->nx * nfp;\n      pvdata_t * dwdata = get_dwData(axonId, kex);\n      const pvdata_t * wdata = get_wData(axonId, kex);\n      int lineoffsetw = 0;\n      int lineoffsetg = 0;\n      pvdata_t inputFR = input_rate[kex];\n      for( int y=0; y<ny; y++ ) {\n         for( int k=0; k<nk; k++ ) {\n            if(offset+lineoffsetg+k<0 || offset+lineoffsetg+k>=post->getNumNeurons()) {\n               fprintf(stderr, \"%s offset=%d, lineoffseta=%d, k=%d, numNeurons=%d\\n\", name, offset, lineoffsetg, k, post->getNumNeurons());\n               abort();\n            }\n            pvdata_t outputFR = outputFiringRate[offset+lineoffsetg+k];\n            dwdata[lineoffsetw + k] += (inputFR - wdata[lineoffsetw+k]*outputFR)*outputFR;\n         }\n         lineoffsetw += syp;\n         lineoffsetg += syg;\n      }\n   }\n   \/\/ Multiply by dt*learningRate, normalize by dividing by inputTargetRate*outputTargetRate, and average by dividing by (numNeurons\/numKernels)\n   int numKernelIndices = getNumDataPatches();\n   int divisor = pre->getNumNeurons()\/numKernelIndices;\n   assert( divisor*numKernelIndices == pre->getNumNeurons() );\n   float scalefactor = parent->getDeltaTime()\/getLearningTime()\/(getInputTargetRate()*getOutputTargetRate())\/((float) divisor);\n   for( int kernelindex=0; kernelindex<numKernelIndices; kernelindex++ ) {\n      int numpatchitems = nxp*nyp*nfp;\n      pvdata_t * dwpatchdata = get_dwDataHead(axonId,kernelindex);\n      for( int n=0; n<numpatchitems; n++ ) {\n         dwpatchdata[n] *= scalefactor;\n      }\n   }\n   \/\/ Averaging across processes is done in reduceKernels().\n\n   return status;\n}\n\nint OjaKernelConn::checkpointRead(const char * cpDir, double * timef) {\n   int status = KernelConn::checkpointRead(cpDir, timef);\n   char filename[PV_PATH_MAX];\n   int chars_needed;\n   chars_needed = snprintf(filename, PV_PATH_MAX, \"%s\/%s_outputFiringRate.pvp\", cpDir, name);\n   if (chars_needed>=PV_PATH_MAX) {\n      if (parent->columnId()==0) {\n         fprintf(stderr, \"OjaKernelConn::checkpointRead error: Path \\\"%s\/%s_outputFiringRate.pvp\\\" is too long.\\n\", cpDir, name);\n         abort();\n      }\n   }\n   double timed;\n   HyPerLayer::readBufferFile(filename, parent->icCommunicator(), &timed, outputFiringRate, 1, \/*extended*\/false, \/*contiguous*\/false, post->getLayerLoc());\n\n   const PVLayerLoc * preloc = pre->getLayerLoc();\n   chars_needed = snprintf(filename, PV_PATH_MAX, \"%s\/%s_inputFiringRate.pvp\", cpDir, name);\n   assert(chars_needed<PV_PATH_MAX);\n   HyPerLayer::readBufferFile(filename, parent->icCommunicator(), &timed, inputFiringRate[0], numberOfAxonalArborLists(), \/*extended*\/true, \/*contiguous*\/false, preloc);\n\n   \/\/ Apply mirror boundary conditions\n\n   \/\/ Exchange borders\n   MPI_Datatype * mpi_datatype = Communicator::newDatatypes(preloc);\n   PVLayerCube cube;\n   memcpy(&cube.loc, preloc, sizeof(PVLayerLoc));\n   cube.numItems = pre->getNumExtended();\n   cube.size = sizeof(pvdata_t)*cube.numItems + sizeof(PVLayerCube); \/\/ Should be okay even though cube's data is not in place, since the mirrorTo functions don't use the size field\n   for (int arbor=0; arbor<numberOfAxonalArborLists(); arbor++) {\n      cube.data = inputFiringRate[0];\n      if ( pre->useMirrorBCs() ) {\n         for (int borderId = 1; borderId < NUM_NEIGHBORHOOD; borderId++){\n            pre->mirrorInteriorToBorder(borderId, &cube, &cube);\n         }\n      }\n      parent->icCommunicator()->exchange(inputFiringRate[0], mpi_datatype, preloc);\n   }\n   Communicator::freeDatatypes(mpi_datatype);\n\n   return status;\n}\nint OjaKernelConn::checkpointWrite(const char * cpDir) {\n   int status = KernelConn::checkpointWrite(cpDir);\n   char filename[PV_PATH_MAX];\n   int chars_needed;\n   chars_needed = snprintf(filename, PV_PATH_MAX, \"%s\/%s_outputFiringRate.pvp\", cpDir, name);\n   if (chars_needed>=PV_PATH_MAX) {\n      if (parent->columnId()==0) {\n         fprintf(stderr, \"OjaKernelConn::checkpointWrite error: Path \\\"%s\/%s_outputFiringRate.pvp\\\" is too long.\\n\", cpDir, name);\n         abort();\n      }\n   }\n   HyPerLayer::writeBufferFile(filename, parent->icCommunicator(), (double) parent->simulationTime(), outputFiringRate, 1, \/*extended*\/ false, \/*contiguous*\/ false, post->getLayerLoc());\n   chars_needed = snprintf(filename, PV_PATH_MAX, \"%s\/%s_inputFiringRate.pvp\", cpDir, name);\n   assert(chars_needed<PV_PATH_MAX);\n   HyPerLayer::writeBufferFile(filename, parent->icCommunicator(), (double) parent->simulationTime(), inputFiringRate[0], numberOfAxonalArborLists(), \/*extended*\/ true, \/*contiguous*\/ false, pre->getLayerLoc());\n   return status;\n}\n\n} \/* namespace PV *\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"containers\/archive\/archive.hpp\"\n\n#include <string.h>\n\n#include <algorithm>\n\n#include \"errors.hpp\"\n#include <boost\/uuid\/uuid.hpp>\n\nint64_t force_read(read_stream_t *s, void *p, int64_t n) {\n    rassert(n >= 0);\n\n    char *chp = static_cast<char *>(p);\n    int64_t written_so_far = 0;\n    while (n > 0) {\n        int64_t res = s->read(chp, n);\n        if (res == 0) {\n            return written_so_far;\n        }\n        if (res == -1) {\n            \/\/ We don't communicate what data has been read so far.\n            \/\/ I'm guessing callers to force_read don't care.\n            return -1;\n        }\n        rassert(res <= n);\n\n        written_so_far += res;\n        chp += res;\n        n -= res;\n    }\n    return written_so_far;\n}\n\nwrite_message_t::~write_message_t() {\n    write_buffer_t *buffer;\n    while ((buffer = buffers_.head())) {\n        buffers_.remove(buffer);\n    }\n}\n\nvoid write_message_t::append(const void *p, int64_t n) {\n    while (n > 0) {\n        if (buffers_.empty() || buffers_.tail()->size == write_buffer_t::DATA_SIZE) {\n            buffers_.push_back(new write_buffer_t);\n        }\n\n        write_buffer_t *b = buffers_.tail();\n        int64_t k = std::min<int64_t>(n, write_buffer_t::DATA_SIZE - b->size);\n\n        memcpy(b->data + b->size, p, k);\n        b->size += k;\n        p = static_cast<const char *>(p) + k;\n        n = n - k;\n    }\n}\n\nint send_write_message(write_stream_t *s, write_message_t *msg) {\n    intrusive_list_t<write_buffer_t> *list = &msg->buffers_;\n    for (write_buffer_t *p = list->head(); p; p = list->next(p)) {\n        int64_t res = s->write(p->data, p->size);\n        if (res == -1) {\n            return -1;\n        }\n        rassert(res == p->size);\n    }\n    return 0;\n}\n\n\nwrite_message_t &operator<<(write_message_t &msg, const boost::uuids::uuid &uuid) {\n    msg.append(uuid.data, boost::uuids::uuid::static_size());\n    return msg;\n}\n\nMUST_USE int deserialize(read_stream_t *s, boost::uuids::uuid *uuid) {\n    int64_t sz = boost::uuids::uuid::static_size();\n    int64_t res = force_read(s, uuid->data, sz);\n\n    if (res == -1) { return ARCHIVE_SOCK_ERROR; }\n    if (res < sz) { return ARCHIVE_SOCK_EOF; }\n    rassert(res == sz);\n    return ARCHIVE_SUCCESS;\n}\n\n<commit_msg>Made the write_message_t destructor be not semi-horribly broken.<commit_after>#include \"containers\/archive\/archive.hpp\"\n\n#include <string.h>\n\n#include <algorithm>\n\n#include \"errors.hpp\"\n#include <boost\/uuid\/uuid.hpp>\n\nint64_t force_read(read_stream_t *s, void *p, int64_t n) {\n    rassert(n >= 0);\n\n    char *chp = static_cast<char *>(p);\n    int64_t written_so_far = 0;\n    while (n > 0) {\n        int64_t res = s->read(chp, n);\n        if (res == 0) {\n            return written_so_far;\n        }\n        if (res == -1) {\n            \/\/ We don't communicate what data has been read so far.\n            \/\/ I'm guessing callers to force_read don't care.\n            return -1;\n        }\n        rassert(res <= n);\n\n        written_so_far += res;\n        chp += res;\n        n -= res;\n    }\n    return written_so_far;\n}\n\nwrite_message_t::~write_message_t() {\n    write_buffer_t *buffer;\n    while ((buffer = buffers_.head())) {\n        buffers_.remove(buffer);\n        delete buffer;\n    }\n}\n\nvoid write_message_t::append(const void *p, int64_t n) {\n    while (n > 0) {\n        if (buffers_.empty() || buffers_.tail()->size == write_buffer_t::DATA_SIZE) {\n            buffers_.push_back(new write_buffer_t);\n        }\n\n        write_buffer_t *b = buffers_.tail();\n        int64_t k = std::min<int64_t>(n, write_buffer_t::DATA_SIZE - b->size);\n\n        memcpy(b->data + b->size, p, k);\n        b->size += k;\n        p = static_cast<const char *>(p) + k;\n        n = n - k;\n    }\n}\n\nint send_write_message(write_stream_t *s, write_message_t *msg) {\n    intrusive_list_t<write_buffer_t> *list = &msg->buffers_;\n    for (write_buffer_t *p = list->head(); p; p = list->next(p)) {\n        int64_t res = s->write(p->data, p->size);\n        if (res == -1) {\n            return -1;\n        }\n        rassert(res == p->size);\n    }\n    return 0;\n}\n\n\nwrite_message_t &operator<<(write_message_t &msg, const boost::uuids::uuid &uuid) {\n    msg.append(uuid.data, boost::uuids::uuid::static_size());\n    return msg;\n}\n\nMUST_USE int deserialize(read_stream_t *s, boost::uuids::uuid *uuid) {\n    int64_t sz = boost::uuids::uuid::static_size();\n    int64_t res = force_read(s, uuid->data, sz);\n\n    if (res == -1) { return ARCHIVE_SOCK_ERROR; }\n    if (res < sz) { return ARCHIVE_SOCK_EOF; }\n    rassert(res == sz);\n    return ARCHIVE_SUCCESS;\n}\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\/libmesh_config.h\"\n\n#ifdef LIBMESH_HAVE_DTK\n\n#include \"libmesh\/dtk_solution_transfer.h\"\n\n#include \"libmesh\/system.h\"\n\n\/\/ Trilinos Includes\n#include <Teuchos_RCP.hpp>\n#include <Teuchos_GlobalMPISession.hpp>\n#include <Teuchos_Ptr.hpp>\n\n\/\/ DTK Includes\n#include <DTK_MeshManager.hpp>\n#include <DTK_MeshContainer.hpp>\n#include <DTK_FieldManager.hpp>\n#include <DTK_FieldContainer.hpp>\n#include <DTK_FieldTools.hpp>\n#include <DTK_CommTools.hpp>\n#include <DTK_CommIndexer.hpp>\n\nnamespace libMesh {\n\nDTKSolutionTransfer::DTKSolutionTransfer()\n{\n  comm_default = Teuchos::DefaultComm<int>::getComm();\n}\n\nDTKSolutionTransfer::~DTKSolutionTransfer()\n{\n  for(std::map<EquationSystems *, DTKAdapter *>::iterator it = adapters.begin();\n      it != adapters.end();\n      ++it)\n    delete it->second;\n\n  for(std::map<std::pair<EquationSystems *, EquationSystems *>, shared_domain_map_type * >::iterator it = dtk_maps.begin();\n      it != dtk_maps.end();\n      ++it)\n    delete it->second;\n}\n\nvoid\nDTKSolutionTransfer::transfer(const Variable & from_var, const Variable & to_var)\n{\n  libmesh_experimental();\n\n  EquationSystems * from_es = &from_var.sys()->get_equation_systems();\n  EquationSystems * to_es = &to_var.sys()->get_equation_systems();\n\n  \/\/ Possibly make an Adapter for from_es\n  if(adapters.find(from_es) == adapters.end())\n    adapters[from_es] = new DTKAdapter(comm_default, *from_es);\n  \n  \/\/ Possibly make an Adapter for to_es\n  if(adapters.find(to_es) == adapters.end())\n    adapters[to_es] = new DTKAdapter(comm_default, *to_es);  \n\n  DTKAdapter * from_adapter = adapters[from_es];\n  DTKAdapter * to_adapter = adapters[to_es];\n\n  std::pair<EquationSystems *, EquationSystems *> from_to(from_es, to_es);\n\n  \/\/ If we haven't created a map for this pair of EquationSystems yet, do it now\n  if(dtk_maps.find(from_to) == dtk_maps.end())\n  {\n    libmesh_assert(from_es->get_mesh().mesh_dimension() == to_es->get_mesh().mesh_dimension());\n    \n    shared_domain_map_type * map = new shared_domain_map_type(comm_default, from_es->get_mesh().mesh_dimension(), true);\n    dtk_maps[from_to] = map;\n\n    \/\/ The tolerance here is for the \"contains_point()\" implementation in DTK.  Set a larger value for a looser tolerance...\n    map->setup(from_adapter->get_mesh_manager(), to_adapter->get_target_coords(), 30*Teuchos::ScalarTraits<double>::eps());\n  }\n\n  DTKAdapter::RCP_Evaluator from_evaluator = from_adapter->get_variable_evaluator(from_var.name());\n  Teuchos::RCP<DataTransferKit::FieldManager<DTKAdapter::FieldContainerType> > to_values = to_adapter->get_values_to_fill(to_var.name());\n  \n  dtk_maps[from_to]->apply(from_evaluator, to_values);\n\n  if(dtk_maps[from_to]->getMissedTargetPoints().size())\n    libMesh::out<<\"Warning: Some points were missed in the transfer of \"<<from_var.name()<<\" to \"<<to_var.name()<<\"!\"<<std::endl;\n\n  to_adapter->update_variable_values(to_var.name());\n}\n\n} \/\/ namespace libMesh\n\n#endif \/\/ #ifdef LIBMESH_HAVE_DTK\n<commit_msg>fix compile error<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\/libmesh_config.h\"\n\n#ifdef LIBMESH_HAVE_DTK\n\n#include \"libmesh\/dtk_solution_transfer.h\"\n\n#include \"libmesh\/system.h\"\n\n\/\/ Trilinos Includes\n#include <Teuchos_RCP.hpp>\n#include <Teuchos_GlobalMPISession.hpp>\n#include <Teuchos_Ptr.hpp>\n\n\/\/ DTK Includes\n#include <DTK_MeshManager.hpp>\n#include <DTK_MeshContainer.hpp>\n#include <DTK_FieldManager.hpp>\n#include <DTK_FieldContainer.hpp>\n#include <DTK_FieldTools.hpp>\n#include <DTK_CommTools.hpp>\n#include <DTK_CommIndexer.hpp>\n\nnamespace libMesh {\n\nDTKSolutionTransfer::DTKSolutionTransfer()\n{\n  comm_default = Teuchos::DefaultComm<int>::getComm();\n}\n\nDTKSolutionTransfer::~DTKSolutionTransfer()\n{\n  for(std::map<EquationSystems *, DTKAdapter *>::iterator it = adapters.begin();\n      it != adapters.end();\n      ++it)\n    delete it->second;\n\n  for(std::map<std::pair<EquationSystems *, EquationSystems *>, shared_domain_map_type * >::iterator it = dtk_maps.begin();\n      it != dtk_maps.end();\n      ++it)\n    delete it->second;\n}\n\nvoid\nDTKSolutionTransfer::transfer(const Variable & from_var, const Variable & to_var)\n{\n  libmesh_experimental();\n\n  EquationSystems * from_es = &from_var.system()->get_equation_systems();\n  EquationSystems * to_es = &to_var.system()->get_equation_systems();\n\n  \/\/ Possibly make an Adapter for from_es\n  if(adapters.find(from_es) == adapters.end())\n    adapters[from_es] = new DTKAdapter(comm_default, *from_es);\n\n  \/\/ Possibly make an Adapter for to_es\n  if(adapters.find(to_es) == adapters.end())\n    adapters[to_es] = new DTKAdapter(comm_default, *to_es);\n\n  DTKAdapter * from_adapter = adapters[from_es];\n  DTKAdapter * to_adapter = adapters[to_es];\n\n  std::pair<EquationSystems *, EquationSystems *> from_to(from_es, to_es);\n\n  \/\/ If we haven't created a map for this pair of EquationSystems yet, do it now\n  if(dtk_maps.find(from_to) == dtk_maps.end())\n  {\n    libmesh_assert(from_es->get_mesh().mesh_dimension() == to_es->get_mesh().mesh_dimension());\n\n    shared_domain_map_type * map = new shared_domain_map_type(comm_default, from_es->get_mesh().mesh_dimension(), true);\n    dtk_maps[from_to] = map;\n\n    \/\/ The tolerance here is for the \"contains_point()\" implementation in DTK.  Set a larger value for a looser tolerance...\n    map->setup(from_adapter->get_mesh_manager(), to_adapter->get_target_coords(), 30*Teuchos::ScalarTraits<double>::eps());\n  }\n\n  DTKAdapter::RCP_Evaluator from_evaluator = from_adapter->get_variable_evaluator(from_var.name());\n  Teuchos::RCP<DataTransferKit::FieldManager<DTKAdapter::FieldContainerType> > to_values = to_adapter->get_values_to_fill(to_var.name());\n\n  dtk_maps[from_to]->apply(from_evaluator, to_values);\n\n  if(dtk_maps[from_to]->getMissedTargetPoints().size())\n    libMesh::out<<\"Warning: Some points were missed in the transfer of \"<<from_var.name()<<\" to \"<<to_var.name()<<\"!\"<<std::endl;\n\n  to_adapter->update_variable_values(to_var.name());\n}\n\n} \/\/ namespace libMesh\n\n#endif \/\/ #ifdef LIBMESH_HAVE_DTK\n<|endoftext|>"}
{"text":"<commit_before>#include \"erlkaf_rd_kafka.h\"\n#include \"nif_utils.h\"\n#include \"macros.h\"\n#include \"topicmanager.h\"\n#include \"erlkaf_nif.h\"\n#include \"erlkaf_config.h\"\n#include \"erlkaf_logger.h\"\n\nconst char* kThreadOptsId = \"librdkafka_thread_opts\";\nconst char* kPollThreadId = \"librdkafka_poll_thread\";\n\nstruct enif_rd_kafka\n{\n    rd_kafka_t* kf;\n    TopicManager* topics;\n    ErlNifThreadOpts* thread_opts;\n    ErlNifTid thread_id;\n    ErlNifPid owner_pid;\n    bool has_dr_callback;\n    bool running;\n};\n\nstruct callback_data\n{\n    ErlNifEnv* env;\n    ERL_NIF_TERM tag;\n    ErlNifPid pid;\n};\n\nvoid* producer_poll_thread(void* arg);\n\ncallback_data* callback_data_alloc(ERL_NIF_TERM ref, const ErlNifPid& pid)\n{\n    callback_data* callback = static_cast<callback_data*>(enif_alloc(sizeof(callback_data)));\n    callback->env = enif_alloc_env();\n    callback->tag = enif_make_copy(callback->env, ref);\n    callback->pid = pid;\n    return callback;\n}\n\nvoid callback_data_free(callback_data* cb)\n{\n    if(cb->env)\n        enif_free_env(cb->env);\n\n    enif_free(cb);\n}\n\nvoid enif_rd_kafka_free(ErlNifEnv* env, void* obj)\n{\n    UNUSED(env);\n\n    enif_rd_kafka* enif_kafka = static_cast<enif_rd_kafka*>(obj);\n    enif_kafka->running = false;\n\n    if(enif_kafka->thread_opts)\n    {\n        void *result = NULL;\n        enif_thread_join(enif_kafka->thread_id, &result);\n        enif_thread_opts_destroy(enif_kafka->thread_opts);\n    }\n\n    if(enif_kafka->topics)\n        delete enif_kafka->topics;\n\n    if(enif_kafka->kf)\n        rd_kafka_destroy(enif_kafka->kf);\n}\n\nenif_rd_kafka* enif_kafka_new(erlkaf_data* data, rd_kafka_t* kf, bool has_dr_callback)\n{\n    scoped_ptr(nif_kafka, enif_rd_kafka, static_cast<enif_rd_kafka*>(enif_alloc_resource(data->res_kafka_handler, sizeof(enif_rd_kafka))), enif_release_resource);\n\n    if(nif_kafka.get() == NULL)\n    {\n        rd_kafka_destroy(kf);\n        return NULL;\n    }\n\n    memset(nif_kafka.get(), 0, sizeof(enif_rd_kafka));\n\n    nif_kafka->topics = new TopicManager(kf);\n    nif_kafka->running = true;\n    nif_kafka->kf = kf;\n    nif_kafka->has_dr_callback = has_dr_callback;\n    nif_kafka->thread_opts = enif_thread_opts_create(const_cast<char*>(kThreadOptsId));\n\n    if (enif_thread_create(const_cast<char*>(kPollThreadId), &nif_kafka->thread_id, producer_poll_thread, nif_kafka.get(), nif_kafka->thread_opts) != 0)\n        return NULL;\n\n    return nif_kafka.release();\n}\n\nvoid delivery_report_callback (rd_kafka_t* rk, const rd_kafka_message_t* msg, void* data)\n{\n    UNUSED(rk);\n    UNUSED(data);\n\n    callback_data* cb = static_cast<callback_data*>(msg->_private);\n\n    ERL_NIF_TERM status = msg->err == 0 ? ATOMS.atomOk : make_error(cb->env, rd_kafka_err2str(msg->err));\n    ERL_NIF_TERM key = msg->key == NULL ? ATOMS.atomUndefined : make_binary(cb->env, reinterpret_cast<const char*>(msg->key), msg->key_len);\n    const char* topic_name = rd_kafka_topic_name(msg->rkt);\n\n    ERL_NIF_TERM term = enif_make_tuple6(cb->env,\n                                        ATOMS.atomMessage,\n                                        make_binary(cb->env, topic_name, strlen(topic_name)),\n                                        enif_make_int(cb->env, msg->partition),\n                                        enif_make_int64(cb->env, msg->offset),\n                                        key,\n                                        make_binary(cb->env, reinterpret_cast<const char*>(msg->payload), msg->len));\n\n    enif_send(NULL, &cb->pid, cb->env, enif_make_tuple4(cb->env, ATOMS.atomDeliveryReport, cb->tag, status, term));\n    callback_data_free(cb);\n}\n\nvoid* producer_poll_thread(void* arg)\n{\n    enif_rd_kafka* enif_kafka = static_cast<enif_rd_kafka*>(arg);\n\n    while (enif_kafka->running)\n        rd_kafka_poll(enif_kafka->kf, 100);\n\n    rd_kafka_flush(enif_kafka->kf, 5000);\n\n    return NULL;\n}\n\nERL_NIF_TERM enif_topic_new(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])\n{\n    UNUSED(argc);\n\n    std::string topic_name;\n    std::string topic_id;\n    enif_rd_kafka* enif_kafka;\n\n    erlkaf_data* data = static_cast<erlkaf_data*>(enif_priv_data(env));\n\n    if(!enif_get_resource(env, argv[0], data->res_kafka_handler, (void**) &enif_kafka))\n        return make_badarg(env);\n\n    if(!get_string(env, argv[1], &topic_id) || !get_string(env, argv[2], &topic_name))\n        return make_badarg(env);\n\n    if(enif_kafka->topics->GetTopic(topic_id))\n        return make_error(env, \"topic already exist\");\n\n    scoped_ptr(config, rd_kafka_topic_conf_t, rd_kafka_topic_conf_new(), rd_kafka_topic_conf_destroy);\n\n    ERL_NIF_TERM parse_result = parse_topic_config(env, argv[3], config.get());\n\n    if(parse_result != ATOMS.atomOk)\n        return parse_result;\n\n    if(!enif_kafka->topics->AddTopic(topic_id, topic_name, config.get()))\n        return make_error(env, \"failed to create topic\");\n\n    config.release();\n    return ATOMS.atomOk;\n}\n\nERL_NIF_TERM enif_producer_new(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])\n{\n    UNUSED(argc);\n\n    bool has_dr_callback;\n\n    if(!get_boolean(argv[0], &has_dr_callback))\n        return make_badarg(env);\n\n    scoped_ptr(config, rd_kafka_conf_t, rd_kafka_conf_new(), rd_kafka_conf_destroy);\n\n    ERL_NIF_TERM parse_result = parse_kafka_config(env, argv[1], config.get());\n\n    if(parse_result != ATOMS.atomOk)\n        return parse_result;\n\n    rd_kafka_conf_set_log_cb(config.get(), logger_callback);\n\n    if(has_dr_callback)\n        rd_kafka_conf_set_dr_msg_cb(config.get(), delivery_report_callback);\n\n    char errstr[512];\n    rd_kafka_t* rk = rd_kafka_new(RD_KAFKA_PRODUCER, config.get(), errstr, sizeof(errstr));\n\n    if (!rk)\n        return make_error(env, errstr);\n\n    config.release();\n\n    erlkaf_data* data = static_cast<erlkaf_data*>(enif_priv_data(env));\n\n    enif_rd_kafka* nif_kafka = enif_kafka_new(data, rk, has_dr_callback);\n\n    if(nif_kafka == NULL)\n        return make_error(env, \"failed to create native kafka object\");\n\n    ERL_NIF_TERM term = enif_make_resource(env, nif_kafka);\n    enif_release_resource(nif_kafka);\n    return enif_make_tuple2(env, ATOMS.atomOk, term);\n}\n\nERL_NIF_TERM enif_client_set_owner(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])\n{\n    UNUSED(argc);\n    erlkaf_data* data = static_cast<erlkaf_data*>(enif_priv_data(env));\n\n    enif_rd_kafka* enif_kafka;\n\n    if(!enif_get_resource(env, argv[0], data->res_kafka_handler, (void**) &enif_kafka))\n        return make_badarg(env);\n\n    if(!enif_get_local_pid(env, argv[1], &enif_kafka->owner_pid))\n        return make_badarg(env);\n\n    return ATOMS.atomOk;\n}\n\nERL_NIF_TERM enif_produce(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])\n{\n    UNUSED(argc);\n\n    erlkaf_data* data = static_cast<erlkaf_data*>(enif_priv_data(env));\n\n    enif_rd_kafka* enif_kafka;\n    std::string topic_id;\n    int32_t partition;\n    ErlNifBinary key;\n    ErlNifBinary value;\n\n    if(!enif_get_resource(env, argv[0], data->res_kafka_handler, (void**) &enif_kafka))\n        return make_badarg(env);\n\n    if(!get_string(env, argv[1], &topic_id))\n        return make_badarg(env);\n\n    rd_kafka_topic_t* topic = enif_kafka->topics->GetTopic(topic_id);\n\n    if(topic == NULL)\n        return make_error(env, \"topic not found\");\n\n    if(!enif_get_int(env, argv[2], &partition))\n        return make_badarg(env);\n\n    if (!get_binary(env, argv[3], &key))\n    {\n        if(!enif_is_identical(ATOMS.atomUndefined, argv[3]))\n            return make_badarg(env);\n\n        memset(&key, 0, sizeof(ErlNifBinary));\n    }\n\n    if (!get_binary(env, argv[4], &value))\n        return make_badarg(env);\n\n    ERL_NIF_TERM tag = enif_make_ref(env);\n\n    callback_data* callback = NULL;\n\n    if(enif_kafka->owner_pid.pid && enif_kafka->has_dr_callback)\n        callback = callback_data_alloc(tag, enif_kafka->owner_pid);\n\n    if (rd_kafka_produce(topic, partition, RD_KAFKA_MSG_F_COPY, value.data, value.size, key.data, key.size, callback) != 0)\n    {\n        if(callback)\n            callback_data_free(callback);\n\n        return make_error(env, enif_make_int(env, rd_kafka_last_error()));\n    }\n\n    return enif_make_tuple2(env, ATOMS.atomOk, tag);\n}\n<commit_msg>Allow fast librdkafka termination<commit_after>#include \"erlkaf_rd_kafka.h\"\n#include \"nif_utils.h\"\n#include \"macros.h\"\n#include \"topicmanager.h\"\n#include \"erlkaf_nif.h\"\n#include \"erlkaf_config.h\"\n#include \"erlkaf_logger.h\"\n\n#include <signal.h>\n\nconst char* kThreadOptsId = \"librdkafka_thread_opts\";\nconst char* kPollThreadId = \"librdkafka_poll_thread\";\n\nstruct enif_rd_kafka\n{\n    rd_kafka_t* kf;\n    TopicManager* topics;\n    ErlNifThreadOpts* thread_opts;\n    ErlNifTid thread_id;\n    ErlNifPid owner_pid;\n    bool has_dr_callback;\n    bool running;\n};\n\nstruct callback_data\n{\n    ErlNifEnv* env;\n    ERL_NIF_TERM tag;\n    ErlNifPid pid;\n};\n\nvoid* producer_poll_thread(void* arg);\n\ncallback_data* callback_data_alloc(ERL_NIF_TERM ref, const ErlNifPid& pid)\n{\n    callback_data* callback = static_cast<callback_data*>(enif_alloc(sizeof(callback_data)));\n    callback->env = enif_alloc_env();\n    callback->tag = enif_make_copy(callback->env, ref);\n    callback->pid = pid;\n    return callback;\n}\n\nvoid callback_data_free(callback_data* cb)\n{\n    if(cb->env)\n        enif_free_env(cb->env);\n\n    enif_free(cb);\n}\n\nvoid enif_rd_kafka_free(ErlNifEnv* env, void* obj)\n{\n    UNUSED(env);\n\n    enif_rd_kafka* enif_kafka = static_cast<enif_rd_kafka*>(obj);\n    enif_kafka->running = false;\n\n    if(enif_kafka->thread_opts)\n    {\n        void *result = NULL;\n        enif_thread_join(enif_kafka->thread_id, &result);\n        enif_thread_opts_destroy(enif_kafka->thread_opts);\n    }\n\n    if(enif_kafka->topics)\n        delete enif_kafka->topics;\n\n    if(enif_kafka->kf)\n        rd_kafka_destroy(enif_kafka->kf);\n}\n\nenif_rd_kafka* enif_kafka_new(erlkaf_data* data, rd_kafka_t* kf, bool has_dr_callback)\n{\n    scoped_ptr(nif_kafka, enif_rd_kafka, static_cast<enif_rd_kafka*>(enif_alloc_resource(data->res_kafka_handler, sizeof(enif_rd_kafka))), enif_release_resource);\n\n    if(nif_kafka.get() == NULL)\n    {\n        rd_kafka_destroy(kf);\n        return NULL;\n    }\n\n    memset(nif_kafka.get(), 0, sizeof(enif_rd_kafka));\n\n    nif_kafka->topics = new TopicManager(kf);\n    nif_kafka->running = true;\n    nif_kafka->kf = kf;\n    nif_kafka->has_dr_callback = has_dr_callback;\n    nif_kafka->thread_opts = enif_thread_opts_create(const_cast<char*>(kThreadOptsId));\n\n    if (enif_thread_create(const_cast<char*>(kPollThreadId), &nif_kafka->thread_id, producer_poll_thread, nif_kafka.get(), nif_kafka->thread_opts) != 0)\n        return NULL;\n\n    return nif_kafka.release();\n}\n\nvoid delivery_report_callback (rd_kafka_t* rk, const rd_kafka_message_t* msg, void* data)\n{\n    UNUSED(rk);\n    UNUSED(data);\n\n    callback_data* cb = static_cast<callback_data*>(msg->_private);\n\n    ERL_NIF_TERM status = msg->err == 0 ? ATOMS.atomOk : make_error(cb->env, rd_kafka_err2str(msg->err));\n    ERL_NIF_TERM key = msg->key == NULL ? ATOMS.atomUndefined : make_binary(cb->env, reinterpret_cast<const char*>(msg->key), msg->key_len);\n    const char* topic_name = rd_kafka_topic_name(msg->rkt);\n\n    ERL_NIF_TERM term = enif_make_tuple6(cb->env,\n                                        ATOMS.atomMessage,\n                                        make_binary(cb->env, topic_name, strlen(topic_name)),\n                                        enif_make_int(cb->env, msg->partition),\n                                        enif_make_int64(cb->env, msg->offset),\n                                        key,\n                                        make_binary(cb->env, reinterpret_cast<const char*>(msg->payload), msg->len));\n\n    enif_send(NULL, &cb->pid, cb->env, enif_make_tuple4(cb->env, ATOMS.atomDeliveryReport, cb->tag, status, term));\n    callback_data_free(cb);\n}\n\nvoid* producer_poll_thread(void* arg)\n{\n    enif_rd_kafka* enif_kafka = static_cast<enif_rd_kafka*>(arg);\n\n    while (enif_kafka->running)\n        rd_kafka_poll(enif_kafka->kf, 100);\n\n    rd_kafka_flush(enif_kafka->kf, 5000);\n\n    return NULL;\n}\n\nERL_NIF_TERM enif_topic_new(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])\n{\n    UNUSED(argc);\n\n    std::string topic_name;\n    std::string topic_id;\n    enif_rd_kafka* enif_kafka;\n\n    erlkaf_data* data = static_cast<erlkaf_data*>(enif_priv_data(env));\n\n    if(!enif_get_resource(env, argv[0], data->res_kafka_handler, (void**) &enif_kafka))\n        return make_badarg(env);\n\n    if(!get_string(env, argv[1], &topic_id) || !get_string(env, argv[2], &topic_name))\n        return make_badarg(env);\n\n    if(enif_kafka->topics->GetTopic(topic_id))\n        return make_error(env, \"topic already exist\");\n\n    scoped_ptr(config, rd_kafka_topic_conf_t, rd_kafka_topic_conf_new(), rd_kafka_topic_conf_destroy);\n\n    ERL_NIF_TERM parse_result = parse_topic_config(env, argv[3], config.get());\n\n    if(parse_result != ATOMS.atomOk)\n        return parse_result;\n\n    if(!enif_kafka->topics->AddTopic(topic_id, topic_name, config.get()))\n        return make_error(env, \"failed to create topic\");\n\n    config.release();\n    return ATOMS.atomOk;\n}\n\nERL_NIF_TERM enif_producer_new(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])\n{\n    UNUSED(argc);\n\n    bool has_dr_callback;\n\n    if(!get_boolean(argv[0], &has_dr_callback))\n        return make_badarg(env);\n\n    scoped_ptr(config, rd_kafka_conf_t, rd_kafka_conf_new(), rd_kafka_conf_destroy);\n\n    ERL_NIF_TERM parse_result = parse_kafka_config(env, argv[1], config.get());\n\n    if(parse_result != ATOMS.atomOk)\n        return parse_result;\n\n#ifdef SIGIO\n    \/\/quick termination\n    char tmp[128];\n    snprintf(tmp, sizeof(tmp), \"%i\", SIGIO);\n    rd_kafka_conf_set(config.get(), \"internal.termination.signal\", tmp, NULL, 0);\n#endif\n\n    rd_kafka_conf_set_log_cb(config.get(), logger_callback);\n\n    if(has_dr_callback)\n        rd_kafka_conf_set_dr_msg_cb(config.get(), delivery_report_callback);\n\n    char errstr[512];\n    rd_kafka_t* rk = rd_kafka_new(RD_KAFKA_PRODUCER, config.get(), errstr, sizeof(errstr));\n\n    if (!rk)\n        return make_error(env, errstr);\n\n    config.release();\n\n    erlkaf_data* data = static_cast<erlkaf_data*>(enif_priv_data(env));\n\n    enif_rd_kafka* nif_kafka = enif_kafka_new(data, rk, has_dr_callback);\n\n    if(nif_kafka == NULL)\n        return make_error(env, \"failed to create native kafka object\");\n\n    ERL_NIF_TERM term = enif_make_resource(env, nif_kafka);\n    enif_release_resource(nif_kafka);\n    return enif_make_tuple2(env, ATOMS.atomOk, term);\n}\n\nERL_NIF_TERM enif_client_set_owner(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])\n{\n    UNUSED(argc);\n    erlkaf_data* data = static_cast<erlkaf_data*>(enif_priv_data(env));\n\n    enif_rd_kafka* enif_kafka;\n\n    if(!enif_get_resource(env, argv[0], data->res_kafka_handler, (void**) &enif_kafka))\n        return make_badarg(env);\n\n    if(!enif_get_local_pid(env, argv[1], &enif_kafka->owner_pid))\n        return make_badarg(env);\n\n    return ATOMS.atomOk;\n}\n\nERL_NIF_TERM enif_produce(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])\n{\n    UNUSED(argc);\n\n    erlkaf_data* data = static_cast<erlkaf_data*>(enif_priv_data(env));\n\n    enif_rd_kafka* enif_kafka;\n    std::string topic_id;\n    int32_t partition;\n    ErlNifBinary key;\n    ErlNifBinary value;\n\n    if(!enif_get_resource(env, argv[0], data->res_kafka_handler, (void**) &enif_kafka))\n        return make_badarg(env);\n\n    if(!get_string(env, argv[1], &topic_id))\n        return make_badarg(env);\n\n    rd_kafka_topic_t* topic = enif_kafka->topics->GetTopic(topic_id);\n\n    if(topic == NULL)\n        return make_error(env, \"topic not found\");\n\n    if(!enif_get_int(env, argv[2], &partition))\n        return make_badarg(env);\n\n    if (!get_binary(env, argv[3], &key))\n    {\n        if(!enif_is_identical(ATOMS.atomUndefined, argv[3]))\n            return make_badarg(env);\n\n        memset(&key, 0, sizeof(ErlNifBinary));\n    }\n\n    if (!get_binary(env, argv[4], &value))\n        return make_badarg(env);\n\n    ERL_NIF_TERM tag = enif_make_ref(env);\n\n    callback_data* callback = NULL;\n\n    if(enif_kafka->owner_pid.pid && enif_kafka->has_dr_callback)\n        callback = callback_data_alloc(tag, enif_kafka->owner_pid);\n\n    if (rd_kafka_produce(topic, partition, RD_KAFKA_MSG_F_COPY, value.data, value.size, key.data, key.size, callback) != 0)\n    {\n        if(callback)\n            callback_data_free(callback);\n\n        return make_error(env, enif_make_int(env, rd_kafka_last_error()));\n    }\n\n    return enif_make_tuple2(env, ATOMS.atomOk, tag);\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef STAN__VARIATIONAL__ADVI_PARAMS_FULLRANK__HPP\n#define STAN__VARIATIONAL__ADVI_PARAMS_FULLRANK__HPP\n\n#include <stan\/math\/prim\/mat\/fun\/Eigen.hpp>\n#include <stan\/math\/prim\/mat\/fun\/LDLT_factor.hpp>\n#include <stan\/math\/prim\/scal\/meta\/constants.hpp>\n\n#include <stan\/math\/prim\/mat\/err\/check_square.hpp>\n#include <stan\/math\/prim\/mat\/err\/check_cholesky_factor.hpp>\n#include <stan\/math\/prim\/scal\/err\/check_size_match.hpp>\n#include <stan\/math\/prim\/scal\/err\/check_not_nan.hpp>\n\n#include <vector>\n\nnamespace stan {\n\n  namespace variational {\n\n    class advi_params_fullrank {\n    private:\n      Eigen::VectorXd mu_;      \/\/ Mean of location-scale family\n      Eigen::MatrixXd L_chol_;  \/\/ Cholesky factor of scale matrix\n                                \/\/ NOTE: \\Sigma = L_chol_ * L_chol_.transpose()\n      int dimension_;\n\n    public:\n      advi_params_fullrank(const Eigen::VectorXd& mu,\n                           const Eigen::MatrixXd& L_chol) :\n      mu_(mu), L_chol_(L_chol), dimension_(mu.size()) {\n        static const char* function =\n          \"stan::variational::advi_params_fullrank\";\n\n        stan::math::check_size_match(function,\n                               \"Dimension of mean vector\",     dimension_,\n                               \"Dimension of Cholesky factor\", L_chol_.rows() );\n        for (int i = 0; i < dimension_; ++i)\n          stan::math::check_not_nan(function, \"Mean vector\", mu_(i));\n        stan::math::check_cholesky_factor(function,\n                               \"Cholesky factor\", L_chol_);\n      }\n\n      virtual ~advi_params_fullrank() {}  \/\/ No-op\n\n      \/\/ Accessors\n      int dimension() const { return dimension_; }\n      const Eigen::VectorXd& mu()     const { return mu_; }\n      const Eigen::MatrixXd& L_chol() const { return L_chol_; }\n\n      \/\/ Mutators\n      void set_mu(const Eigen::VectorXd& mu) {\n        static const char* function =\n          \"stan::variational::advi_params_fullrank::set_mu\";\n\n        stan::math::check_size_match(function,\n                               \"Dimension of input vector\", mu.size(),\n                               \"Dimension of current vector\", dimension_);\n        for (int i = 0; i < dimension_; ++i)\n          stan::math::check_not_nan(function, \"Input vector\", mu(i));\n        mu_ = mu;\n      }\n\n      void set_L_chol(const Eigen::MatrixXd& L_chol) {\n        static const char* function =\n          \"stan::variational::advi_params_fullrank::set_L_chol\";\n\n        stan::math::check_size_match(function,\n                               \"Dimension of mean vector\",     dimension_,\n                               \"Dimension of Cholesky factor\", L_chol.rows());\n        stan::math::check_cholesky_factor(function,\n                               \"Cholesky factor\", L_chol);\n\n        L_chol_ = L_chol;\n      }\n\n      \/\/ Entropy of normal:\n      \/\/ 0.5 * dim * (1+log2pi) + 0.5 * log det (L^T L) =\n      \/\/ 0.5 * dim * (1+log2pi) + sum(log(abs(diag(L))))\n      double entropy() const {\n        double tmp(0.0);\n        double result(\n          0.5 * static_cast<double>(dimension_)\n          * (1.0 + stan::prob::LOG_TWO_PI));\n        for (int d = 0; d < dimension_; ++d) {\n          tmp = fabs(L_chol_(d, d));\n          if (tmp != 0.0) {\n            result += log(tmp);\n          }\n        }\n        return result;\n      }\n\n      \/\/ \/\/ Calculate natural parameters\n      \/\/ Eigen::VectorXd nat_params() const {\n\n      \/\/   \/\/ FIXME: stupid Eigen. can't initialize LLT factor with L.\n      \/\/   \/\/ Compute the covariance matrix\n      \/\/   Eigen::MatrixXd Sigma = L_chol_ * L_chol_.transpose();\n      \/\/   stan::math::LDLT_factor<double,-1,-1> Sigma_LDLT(Sigma);\n\n      \/\/   \/\/ Create a vector twice the dimension size\n      \/\/   Eigen::VectorXd natural_params(dimension_ + dimension_^2);\n\n      \/\/   \/\/ Concatenate the natural parameters\n      \/\/   natural_params << (Sigma_LDLT.solve(mu_)).array(),\n      \/\/                     (Sigma_LDLT.solve(\n      \/\/                       Eigen::MatrixXd::Identity(dimension_,dimension_))\n      \/\/                     ).array();\n\n      \/\/   return natural_params;\n      \/\/ }\n\n      \/\/ Implements f^{-1}(\\check{z}) = L\\check{z} + \\mu\n      Eigen::VectorXd to_unconstrained(const Eigen::VectorXd& z_check) const {\n        static const char* function = \"stan::variational::advi_params_fullrank\"\n                                      \"::to_unconstrained\";\n\n        stan::math::check_size_match(function,\n                         \"Dimension of input vector\", z_check.size(),\n                         \"Dimension of mean vector\",  dimension_);\n        for (int i = 0; i < dimension_; ++i)\n          stan::math::check_not_nan(function, \"Input vector\", z_check(i));\n\n        return L_chol_*z_check + mu_;\n      }\n    };\n  }  \/\/ variational\n}  \/\/ stan\n\n#endif\n<commit_msg>fixed cholesky check with lower triangular<commit_after>#ifndef STAN__VARIATIONAL__ADVI_PARAMS_FULLRANK__HPP\n#define STAN__VARIATIONAL__ADVI_PARAMS_FULLRANK__HPP\n\n#include <stan\/math\/prim\/mat\/fun\/Eigen.hpp>\n#include <stan\/math\/prim\/mat\/fun\/LDLT_factor.hpp>\n#include <stan\/math\/prim\/scal\/meta\/constants.hpp>\n\n#include <stan\/math\/prim\/mat\/err\/check_square.hpp>\n#include <stan\/math\/prim\/mat\/err\/check_lower_triangular.hpp>\n#include <stan\/math\/prim\/scal\/err\/check_size_match.hpp>\n#include <stan\/math\/prim\/scal\/err\/check_not_nan.hpp>\n\n#include <vector>\n\nnamespace stan {\n\n  namespace variational {\n\n    class advi_params_fullrank {\n    private:\n      Eigen::VectorXd mu_;      \/\/ Mean of location-scale family\n      Eigen::MatrixXd L_chol_;  \/\/ Cholesky factor of scale matrix\n                                \/\/ NOTE: \\Sigma = L_chol_ * L_chol_.transpose()\n      int dimension_;\n\n    public:\n      advi_params_fullrank(const Eigen::VectorXd& mu,\n                           const Eigen::MatrixXd& L_chol) :\n      mu_(mu), L_chol_(L_chol), dimension_(mu.size()) {\n        static const char* function =\n          \"stan::variational::advi_params_fullrank\";\n\n        stan::math::check_size_match(function,\n                               \"Dimension of mean vector\",     dimension_,\n                               \"Dimension of Cholesky factor\", L_chol_.rows() );\n        for (int i = 0; i < dimension_; ++i)\n          stan::math::check_not_nan(function, \"Mean vector\", mu_(i));\n        stan::math::check_lower_triangular(function,\n                               \"Cholesky factor\", L_chol_);\n      }\n\n      virtual ~advi_params_fullrank() {}  \/\/ No-op\n\n      \/\/ Accessors\n      int dimension() const { return dimension_; }\n      const Eigen::VectorXd& mu()     const { return mu_; }\n      const Eigen::MatrixXd& L_chol() const { return L_chol_; }\n\n      \/\/ Mutators\n      void set_mu(const Eigen::VectorXd& mu) {\n        static const char* function =\n          \"stan::variational::advi_params_fullrank::set_mu\";\n\n        stan::math::check_size_match(function,\n                               \"Dimension of input vector\", mu.size(),\n                               \"Dimension of current vector\", dimension_);\n        for (int i = 0; i < dimension_; ++i)\n          stan::math::check_not_nan(function, \"Input vector\", mu(i));\n        mu_ = mu;\n      }\n\n      void set_L_chol(const Eigen::MatrixXd& L_chol) {\n        static const char* function =\n          \"stan::variational::advi_params_fullrank::set_L_chol\";\n\n        stan::math::check_size_match(function,\n                               \"Dimension of mean vector\",     dimension_,\n                               \"Dimension of Cholesky factor\", L_chol.rows());\n        stan::math::check_lower_triangular(function,\n                               \"Cholesky factor\", L_chol);\n\n        L_chol_ = L_chol;\n      }\n\n      \/\/ Entropy of normal:\n      \/\/ 0.5 * dim * (1+log2pi) + 0.5 * log det (L^T L) =\n      \/\/ 0.5 * dim * (1+log2pi) + sum(log(abs(diag(L))))\n      double entropy() const {\n        double tmp(0.0);\n        double result(\n          0.5 * static_cast<double>(dimension_)\n          * (1.0 + stan::prob::LOG_TWO_PI));\n        for (int d = 0; d < dimension_; ++d) {\n          tmp = fabs(L_chol_(d, d));\n          if (tmp != 0.0) {\n            result += log(tmp);\n          }\n        }\n        return result;\n      }\n\n      \/\/ \/\/ Calculate natural parameters\n      \/\/ Eigen::VectorXd nat_params() const {\n\n      \/\/   \/\/ FIXME: stupid Eigen. can't initialize LLT factor with L.\n      \/\/   \/\/ Compute the covariance matrix\n      \/\/   Eigen::MatrixXd Sigma = L_chol_ * L_chol_.transpose();\n      \/\/   stan::math::LDLT_factor<double,-1,-1> Sigma_LDLT(Sigma);\n\n      \/\/   \/\/ Create a vector twice the dimension size\n      \/\/   Eigen::VectorXd natural_params(dimension_ + dimension_^2);\n\n      \/\/   \/\/ Concatenate the natural parameters\n      \/\/   natural_params << (Sigma_LDLT.solve(mu_)).array(),\n      \/\/                     (Sigma_LDLT.solve(\n      \/\/                       Eigen::MatrixXd::Identity(dimension_,dimension_))\n      \/\/                     ).array();\n\n      \/\/   return natural_params;\n      \/\/ }\n\n      \/\/ Implements f^{-1}(\\check{z}) = L\\check{z} + \\mu\n      Eigen::VectorXd to_unconstrained(const Eigen::VectorXd& z_check) const {\n        static const char* function = \"stan::variational::advi_params_fullrank\"\n                                      \"::to_unconstrained\";\n\n        stan::math::check_size_match(function,\n                         \"Dimension of input vector\", z_check.size(),\n                         \"Dimension of mean vector\",  dimension_);\n        for (int i = 0; i < dimension_; ++i)\n          stan::math::check_not_nan(function, \"Input vector\", z_check(i));\n\n        return L_chol_*z_check + mu_;\n      }\n    };\n  }  \/\/ variational\n}  \/\/ stan\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/\tDDCPP\/standard\/bits\/experimental\/DDLab_Find.hpp\n#ifndef DDLAB_FIND_HPP_INCLUDED_\n#\tdefine DDLAB_FIND_HPP_INCLUDED_ 1\n\n\n\n#\tinclude \"DD_experimental_definitions.hpp\"\n\n\n\nDD_LAB_DETAIL_BEGIN_\nstruct Find {\n\ttemplate <typename UndirectionalIteratorT_, typename ValueT_, typename BinaryPredicateT_>\n\tstatic UndirectionalIteratorT_ call(\n\t\tUndirectionalIteratorT_ begin__,\n\t\tUndirectionalIteratorT_ end__,\n\t\tValueT_ value__,\n\t\tBinaryPredicateT_ equal__\n\t) {\n\t\twhile (begin__ != end__ && !equal__(*begin__, value__) {\n\t\t\t++begin__;\n\t\t}\n\t\treturn begin__;\n\t}\n\n\n} DD_CONSTANT find;\n\n\n\nDD_LAB_DETAIL_END_\n\n\n\nDD_LAB_BEGIN_\nusing detail_::Find;\n\nusing detail_::find;\n\n\n\nDD_LAB_END_\n\n\n\n#endif\n<commit_msg>Some preparations<commit_after>\/\/\tDDCPP\/standard\/bits\/experimental\/DDLab_Find.hpp\n#ifndef DDLAB_FIND_HPP_INCLUDED_\n#\tdefine DDLAB_FIND_HPP_INCLUDED_ 1\n\n\n\n#\tinclude \"DD_experimental_definitions.hpp\"\n\n\n\nDD_LAB_DETAIL_BEGIN_\nstruct Find {\n\ttemplate <typename UndirectionalIteratorT_, typename ValueT_, typename BinaryPredicateT_>\n\tstatic UndirectionalIteratorT_ call(\n\t\tUndirectionalIteratorT_ begin__,\n\t\tUndirectionalIteratorT_ end__,\n\t\tValueT_ value__,\n\t\tBinaryPredicateT_ equal__\n\t) {\n\t\twhile (begin__ != end__ && !equal__(*begin__, value__) {\n\t\t\t++begin__;\n\t\t}\n\t\treturn begin__;\n\t}\n\n\ttemplate <typename PolicyT_, typename UndirectionalIteratorT_, typename ValueT_, typename BinaryPredicateT_>\n\tstatic UndirectionalIteratorT_ call(\n\t\tPolicyT_&& executor_,\n\t\tUndirectionalIteratorT_ begin__,\n\t\tUndirectionalIteratorT_ end__,\n\t\tValueT_ value__,\n\t\tBinaryPredicateT_ equal__\n\t);\n\n\n} DD_CONSTANT find;\n\n\n\nDD_LAB_DETAIL_END_\n\n\n\nDD_LAB_BEGIN_\nusing detail_::Find;\n\nusing detail_::find;\n\n\n\nDD_LAB_END_\n\n\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  Created by Derek van Vliet on 2014-12-10.\n\/\/  Copyright (c) 2015 Get Set Games Inc. All rights reserved.\n\/\/\n\n#include \"ChartboostPrivatePCH.h\"\n\n#if PLATFORM_IOS\n#import <Chartboost\/Chartboost.h>\n#import <Chartboost\/CBNewsfeed.h>\n#import <CommonCrypto\/CommonDigest.h>\n#import <AdSupport\/AdSupport.h>\n#endif\n\nFString UChartboostFunctions::GetLocationString(EChartboost::Location Location) {\n\tconst UEnum* EnumPtr = FindObject<UEnum>(ANY_PACKAGE, TEXT(\"EChartboost\"), true);\n\tif (!EnumPtr) {\n\t\treturn TEXT(\"\");\n\t}\n \n\tFString LocationString = EnumPtr->GetEnumName(Location);\n\t\n\treturn LocationString;\n}\n\nbool UChartboostFunctions::ChartboostAdIsVisible() {\n#if PLATFORM_IOS\n\treturn [Chartboost isAnyViewVisible];\n#endif\n\n\treturn false;\n}\n\nvoid UChartboostFunctions::SetAgeGatePassed(bool pass) {\n#if PLATFORM_IOS\n\t[Chartboost didPassAgeGate:pass];\n#endif\n}\n\nvoid UChartboostFunctions::SetCustomId(FString customId) {\n#if PLATFORM_IOS\n\t[Chartboost setCustomId:customId.GetNSString()];\n#endif\n}\n\nFString UChartboostFunctions::GetCustomId() {\n#if PLATFORM_IOS\n\treturn FString([Chartboost getCustomId]);\n#endif\n\t\n\treturn nullptr;\n}\n\n#pragma mark Interstitials\n\nbool UChartboostFunctions::HasInterstitial(EChartboost::Location Location) {\n\tFString LocationString = UChartboostFunctions::GetLocationString(Location);\n\tif (LocationString.IsEmpty()) {\n\t\treturn false;\n\t}\n\t\n#if PLATFORM_IOS\n\treturn [Chartboost hasInterstitial:LocationString.GetNSString()];\n#endif\n\t\n\treturn false;\n}\n\nvoid UChartboostFunctions::ShowInterstitial(EChartboost::Location Location) {\n\tFString LocationString = UChartboostFunctions::GetLocationString(Location);\n\tif (LocationString.IsEmpty()) {\n\t\treturn;\n\t}\n\t\n\tUE_LOG(LogChartboost, Log, TEXT(\"Showing interstitial for location: %s\"), *LocationString);\n\t\n#if PLATFORM_IOS\n\t[Chartboost showInterstitial:LocationString.GetNSString()];\n#endif\n}\n\nvoid UChartboostFunctions::CacheInterstitial(EChartboost::Location Location) {\n\tFString LocationString = UChartboostFunctions::GetLocationString(Location);\n\tif (LocationString.IsEmpty()) {\n\t\treturn;\n\t}\n\t\n\tUE_LOG(LogChartboost, Log, TEXT(\"Caching interstitial for location: %s\"), *LocationString);\n\t\n#if PLATFORM_IOS\n\t[Chartboost cacheInterstitial:LocationString.GetNSString()];\n#endif\n}\n\n#pragma mark More Apps\n\nbool UChartboostFunctions::HasMoreApps(EChartboost::Location Location) {\n\tFString LocationString = UChartboostFunctions::GetLocationString(Location);\n\tif (LocationString.IsEmpty()) {\n\t\treturn false;\n\t}\n\t\n#if PLATFORM_IOS\n\treturn [Chartboost hasMoreApps:LocationString.GetNSString()];\n#endif\n\t\n\treturn false;\n}\n\nvoid UChartboostFunctions::ShowMoreApps(EChartboost::Location Location) {\n\tFString LocationString = UChartboostFunctions::GetLocationString(Location);\n\tif (LocationString.IsEmpty()) return;\n\t\n\tUE_LOG(LogChartboost, Log, TEXT(\"Showing more apps for location: %s\"), *LocationString);\n\t\n#if PLATFORM_IOS\n\t[Chartboost showMoreApps:LocationString.GetNSString()];\n#endif\n}\n\nvoid UChartboostFunctions::CacheMoreApps(EChartboost::Location Location) {\n\tFString LocationString = UChartboostFunctions::GetLocationString(Location);\n\tif (LocationString.IsEmpty()) {\n\t\treturn;\n\t}\n\t\n\tUE_LOG(LogChartboost, Log, TEXT(\"Caching more apps for location: %s\"), *LocationString);\n\t\n#if PLATFORM_IOS\n\t[Chartboost cacheMoreApps:LocationString.GetNSString()];\n#endif\n}\n\n#pragma mark Rewarded Video\n\nbool UChartboostFunctions::HasRewardedVideo(EChartboost::Location Location) {\n\tFString LocationString = UChartboostFunctions::GetLocationString(Location);\n\tif (LocationString.IsEmpty()) {\n\t\treturn false;\n\t}\n\t\n#if PLATFORM_IOS\n\treturn [Chartboost hasRewardedVideo:LocationString.GetNSString()];\n#endif\n\t\n\treturn false;\n}\n\nvoid UChartboostFunctions::ShowRewardedVideo(EChartboost::Location Location) {\n\tFString LocationString = UChartboostFunctions::GetLocationString(Location);\n\tif (LocationString.IsEmpty()) return;\n\t\n\tUE_LOG(LogChartboost, Log, TEXT(\"Showing rewarded video for location: %s\"), *LocationString);\n\t\n#if PLATFORM_IOS\n\t[Chartboost showRewardedVideo:LocationString.GetNSString()];\n#endif\n}\n\nvoid UChartboostFunctions::CacheRewardedVideo(EChartboost::Location Location) {\n\tFString LocationString = UChartboostFunctions::GetLocationString(Location);\n\tif (LocationString.IsEmpty()) {\n\t\treturn;\n\t}\n\t\n\tUE_LOG(LogChartboost, Log, TEXT(\"Caching rewarded video for location: %s\"), *LocationString);\n\t\n#if PLATFORM_IOS\n\t[Chartboost cacheRewardedVideo:LocationString.GetNSString()];\n#endif\n}<commit_msg>UChartboostFunctions::GetCustomId returns an empty FString instead of nullptr if no other results<commit_after>\/\/\n\/\/  Created by Derek van Vliet on 2014-12-10.\n\/\/  Copyright (c) 2015 Get Set Games Inc. All rights reserved.\n\/\/\n\n#include \"ChartboostPrivatePCH.h\"\n\n#if PLATFORM_IOS\n#import <Chartboost\/Chartboost.h>\n#import <Chartboost\/CBNewsfeed.h>\n#import <CommonCrypto\/CommonDigest.h>\n#import <AdSupport\/AdSupport.h>\n#endif\n\nFString UChartboostFunctions::GetLocationString(EChartboost::Location Location) {\n\tconst UEnum* EnumPtr = FindObject<UEnum>(ANY_PACKAGE, TEXT(\"EChartboost\"), true);\n\tif (!EnumPtr) {\n\t\treturn TEXT(\"\");\n\t}\n \n\tFString LocationString = EnumPtr->GetEnumName(Location);\n\t\n\treturn LocationString;\n}\n\nbool UChartboostFunctions::ChartboostAdIsVisible() {\n#if PLATFORM_IOS\n\treturn [Chartboost isAnyViewVisible];\n#endif\n\n\treturn false;\n}\n\nvoid UChartboostFunctions::SetAgeGatePassed(bool pass) {\n#if PLATFORM_IOS\n\t[Chartboost didPassAgeGate:pass];\n#endif\n}\n\nvoid UChartboostFunctions::SetCustomId(FString customId) {\n#if PLATFORM_IOS\n\t[Chartboost setCustomId:customId.GetNSString()];\n#endif\n}\n\nFString UChartboostFunctions::GetCustomId() {\n#if PLATFORM_IOS\n\treturn FString([Chartboost getCustomId]);\n#endif\n\t\n\treturn FString();\n}\n\n#pragma mark Interstitials\n\nbool UChartboostFunctions::HasInterstitial(EChartboost::Location Location) {\n\tFString LocationString = UChartboostFunctions::GetLocationString(Location);\n\tif (LocationString.IsEmpty()) {\n\t\treturn false;\n\t}\n\t\n#if PLATFORM_IOS\n\treturn [Chartboost hasInterstitial:LocationString.GetNSString()];\n#endif\n\t\n\treturn false;\n}\n\nvoid UChartboostFunctions::ShowInterstitial(EChartboost::Location Location) {\n\tFString LocationString = UChartboostFunctions::GetLocationString(Location);\n\tif (LocationString.IsEmpty()) {\n\t\treturn;\n\t}\n\t\n\tUE_LOG(LogChartboost, Log, TEXT(\"Showing interstitial for location: %s\"), *LocationString);\n\t\n#if PLATFORM_IOS\n\t[Chartboost showInterstitial:LocationString.GetNSString()];\n#endif\n}\n\nvoid UChartboostFunctions::CacheInterstitial(EChartboost::Location Location) {\n\tFString LocationString = UChartboostFunctions::GetLocationString(Location);\n\tif (LocationString.IsEmpty()) {\n\t\treturn;\n\t}\n\t\n\tUE_LOG(LogChartboost, Log, TEXT(\"Caching interstitial for location: %s\"), *LocationString);\n\t\n#if PLATFORM_IOS\n\t[Chartboost cacheInterstitial:LocationString.GetNSString()];\n#endif\n}\n\n#pragma mark More Apps\n\nbool UChartboostFunctions::HasMoreApps(EChartboost::Location Location) {\n\tFString LocationString = UChartboostFunctions::GetLocationString(Location);\n\tif (LocationString.IsEmpty()) {\n\t\treturn false;\n\t}\n\t\n#if PLATFORM_IOS\n\treturn [Chartboost hasMoreApps:LocationString.GetNSString()];\n#endif\n\t\n\treturn false;\n}\n\nvoid UChartboostFunctions::ShowMoreApps(EChartboost::Location Location) {\n\tFString LocationString = UChartboostFunctions::GetLocationString(Location);\n\tif (LocationString.IsEmpty()) return;\n\t\n\tUE_LOG(LogChartboost, Log, TEXT(\"Showing more apps for location: %s\"), *LocationString);\n\t\n#if PLATFORM_IOS\n\t[Chartboost showMoreApps:LocationString.GetNSString()];\n#endif\n}\n\nvoid UChartboostFunctions::CacheMoreApps(EChartboost::Location Location) {\n\tFString LocationString = UChartboostFunctions::GetLocationString(Location);\n\tif (LocationString.IsEmpty()) {\n\t\treturn;\n\t}\n\t\n\tUE_LOG(LogChartboost, Log, TEXT(\"Caching more apps for location: %s\"), *LocationString);\n\t\n#if PLATFORM_IOS\n\t[Chartboost cacheMoreApps:LocationString.GetNSString()];\n#endif\n}\n\n#pragma mark Rewarded Video\n\nbool UChartboostFunctions::HasRewardedVideo(EChartboost::Location Location) {\n\tFString LocationString = UChartboostFunctions::GetLocationString(Location);\n\tif (LocationString.IsEmpty()) {\n\t\treturn false;\n\t}\n\t\n#if PLATFORM_IOS\n\treturn [Chartboost hasRewardedVideo:LocationString.GetNSString()];\n#endif\n\t\n\treturn false;\n}\n\nvoid UChartboostFunctions::ShowRewardedVideo(EChartboost::Location Location) {\n\tFString LocationString = UChartboostFunctions::GetLocationString(Location);\n\tif (LocationString.IsEmpty()) return;\n\t\n\tUE_LOG(LogChartboost, Log, TEXT(\"Showing rewarded video for location: %s\"), *LocationString);\n\t\n#if PLATFORM_IOS\n\t[Chartboost showRewardedVideo:LocationString.GetNSString()];\n#endif\n}\n\nvoid UChartboostFunctions::CacheRewardedVideo(EChartboost::Location Location) {\n\tFString LocationString = UChartboostFunctions::GetLocationString(Location);\n\tif (LocationString.IsEmpty()) {\n\t\treturn;\n\t}\n\t\n\tUE_LOG(LogChartboost, Log, TEXT(\"Caching rewarded video for location: %s\"), *LocationString);\n\t\n#if PLATFORM_IOS\n\t[Chartboost cacheRewardedVideo:LocationString.GetNSString()];\n#endif\n}<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2007-2016 musikcube team\n\/\/\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/\n\/\/    * Redistributions of source code must retain the above copyright notice,\n\/\/      this list of conditions and the following disclaimer.\n\/\/\n\/\/    * Redistributions in binary form must reproduce the above copyright\n\/\/      notice, this list of conditions and the following disclaimer in the\n\/\/      documentation and\/or other materials provided with the distribution.\n\/\/\n\/\/    * Neither the name of the author nor the names of other contributors may\n\/\/      be used to endorse or promote products derived from this software\n\/\/      without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"PulseOut.h\"\n#include <pulse\/volume.h>\n#include <math.h>\n\nusing namespace musik::core::sdk;\n\ntypedef std::unique_lock<std::recursive_mutex> Lock;\n\nPulseOut::PulseOut() {\n    std::cerr << \"PulseOut::PulseOut() called\" << std::endl;\n    this->audioConnection = nullptr;\n    this->state = StateStopped;\n    this->volume = 1.0f;\n    this->channels = 0;\n    this->rate = 0;\n}\n\nPulseOut::~PulseOut() {\n    std::cerr << \"PulseOut: destructor\\n\";\n    this->CloseDevice();\n}\n\nvoid PulseOut::CloseDevice() {\n    std::cerr << \"PulseOut: closing device\\n\";\n\n    Lock lock(this->stateMutex);\n    if (this->audioConnection) {\n        int error = 0;\n        pa_blocking_flush(this->audioConnection, &error);\n        pa_blocking_free(this->audioConnection);\n        this->audioConnection = nullptr;\n        this->rate = 0;\n        this->channels = 0;\n    }\n}\n\nvoid PulseOut::OpenDevice(musik::core::sdk::IBuffer* buffer) {\n    \n    if (!this->audioConnection ||\n        this->rate != buffer->SampleRate() ||\n        this->channels != buffer->Channels())\n    {\n        this->CloseDevice();\n\n        pa_sample_spec spec;\n        spec.format = PA_SAMPLE_FLOAT32LE;\n        spec.channels = buffer->Channels();\n        spec.rate = buffer->SampleRate();\n\n        std::cerr << \"PulseOut: opening device\\n\";\n        this->audioConnection = pa_blocking_new(\n            nullptr,\n            \"musikbox\",\n            PA_STREAM_PLAYBACK,\n            nullptr,\n            \"music\",\n            &spec,\n            nullptr,\n            nullptr,\n            0);\n\n        if (this->audioConnection) {\n            this->SetVolume(this->volume);\n            this->rate = buffer->SampleRate();\n            this->channels = buffer->Channels();\n            this->state = StatePlaying;\n        }\n    }\n}\n\nvoid PulseOut::Destroy() {\n    std::cerr << \"PulseOut: destroy\\n\";\n    delete this;\n}\n\nvoid PulseOut::Stop() {\n    std::cerr << \"PulseOut: stop\\n\";\n\n    Lock lock(this->stateMutex);\n    if (this->audioConnection) {\n        pa_blocking_flush(this->audioConnection, 0);\n        this->state = StateStopped;\n    }\n}\n\nvoid PulseOut::Pause() {\n    std::cerr << \"PulseOut: pause\\n\";\n\n    Lock lock(this->stateMutex);\n    if (this->audioConnection) {\n        pa_blocking_flush(this->audioConnection, 0);\n        this->state = StatePaused;\n    }\n}\n\nvoid PulseOut::Resume() {\n    std::cerr << \"PulseOut: resume\\n\";\n    \n    Lock lock(this->stateMutex);\n    if (this->audioConnection) {\n        this->state = StatePlaying;\n    }\n}\n\nvoid PulseOut::SetVolume(double volume) {\n    std::cerr << \"PulseOut: volume\\n\";\n\n    Lock lock(this->stateMutex);\n    if (this->audioConnection) {\n        this->volume = volume;\n        int normalized =  (int) round((double) PA_VOLUME_NORM * volume);\n        pa_blocking_set_volume(this->audioConnection, normalized, 0);\n    }\n}\n\nbool PulseOut::Play(IBuffer *buffer, IBufferProvider* provider) {\n    int error = 0;\n\n    {\n        Lock lock(this->stateMutex);\n\n        this->OpenDevice(buffer);\n\n        if (!this->audioConnection || this->state != StatePlaying) {\n            return false;\n        }\n\n        pa_blocking_write(\n            this->audioConnection,\n            buffer->BufferPointer(),\n            buffer->Samples() * sizeof(float),\n            &error);\n    }\n\n    provider->OnBufferProcessed(buffer);\n    return true;\n}\n\ndouble PulseOut::Latency() {\n    Lock lock(this->stateMutex);\n    \n    if (!this->audioConnection) {\n        return 0.0;\n    }\n\n    int error = 0;\n    unsigned long long latency = pa_blocking_get_latency(this->audioConnection, &error);\n    return (double) latency \/ 1000000.0; \/* microseconds to seconds *\/\n}\n<commit_msg>Fixed volume initialization in PulseOut<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2007-2016 musikcube team\n\/\/\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/\n\/\/    * Redistributions of source code must retain the above copyright notice,\n\/\/      this list of conditions and the following disclaimer.\n\/\/\n\/\/    * Redistributions in binary form must reproduce the above copyright\n\/\/      notice, this list of conditions and the following disclaimer in the\n\/\/      documentation and\/or other materials provided with the distribution.\n\/\/\n\/\/    * Neither the name of the author nor the names of other contributors may\n\/\/      be used to endorse or promote products derived from this software\n\/\/      without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"PulseOut.h\"\n#include <pulse\/volume.h>\n#include <math.h>\n\nusing namespace musik::core::sdk;\n\ntypedef std::unique_lock<std::recursive_mutex> Lock;\n\nPulseOut::PulseOut() {\n    std::cerr << \"PulseOut::PulseOut() called\" << std::endl;\n    this->audioConnection = nullptr;\n    this->state = StateStopped;\n    this->volume = 1.0f;\n    this->channels = 0;\n    this->rate = 0;\n}\n\nPulseOut::~PulseOut() {\n    std::cerr << \"PulseOut: destructor\\n\";\n    this->CloseDevice();\n}\n\nvoid PulseOut::CloseDevice() {\n    std::cerr << \"PulseOut: closing device\\n\";\n\n    Lock lock(this->stateMutex);\n    if (this->audioConnection) {\n        int error = 0;\n        pa_blocking_flush(this->audioConnection, &error);\n        pa_blocking_free(this->audioConnection);\n        this->audioConnection = nullptr;\n        this->rate = 0;\n        this->channels = 0;\n    }\n}\n\nvoid PulseOut::OpenDevice(musik::core::sdk::IBuffer* buffer) {\n    \n    if (!this->audioConnection ||\n        this->rate != buffer->SampleRate() ||\n        this->channels != buffer->Channels())\n    {\n        this->CloseDevice();\n\n        pa_sample_spec spec;\n        spec.format = PA_SAMPLE_FLOAT32LE;\n        spec.channels = buffer->Channels();\n        spec.rate = buffer->SampleRate();\n\n        std::cerr << \"PulseOut: opening device\\n\";\n        this->audioConnection = pa_blocking_new(\n            nullptr,\n            \"musikbox\",\n            PA_STREAM_PLAYBACK,\n            nullptr,\n            \"music\",\n            &spec,\n            nullptr,\n            nullptr,\n            0);\n\n        if (this->audioConnection) {\n            this->SetVolume(this->volume);\n            this->rate = buffer->SampleRate();\n            this->channels = buffer->Channels();\n            this->state = StatePlaying;\n        }\n    }\n}\n\nvoid PulseOut::Destroy() {\n    std::cerr << \"PulseOut: destroy\\n\";\n    delete this;\n}\n\nvoid PulseOut::Stop() {\n    std::cerr << \"PulseOut: stop\\n\";\n\n    Lock lock(this->stateMutex);\n    if (this->audioConnection) {\n        pa_blocking_flush(this->audioConnection, 0);\n        this->state = StateStopped;\n    }\n}\n\nvoid PulseOut::Pause() {\n    std::cerr << \"PulseOut: pause\\n\";\n\n    Lock lock(this->stateMutex);\n    if (this->audioConnection) {\n        pa_blocking_flush(this->audioConnection, 0);\n        this->state = StatePaused;\n    }\n}\n\nvoid PulseOut::Resume() {\n    std::cerr << \"PulseOut: resume\\n\";\n    \n    Lock lock(this->stateMutex);\n    if (this->audioConnection) {\n        this->state = StatePlaying;\n    }\n}\n\nvoid PulseOut::SetVolume(double volume) {\n    std::cerr << \"PulseOut: volume\\n\";\n\n    Lock lock(this->stateMutex);\n    this->volume = volume;\n    if (this->audioConnection) {\n        int normalized = (int) round((double) PA_VOLUME_NORM * volume);\n        pa_blocking_set_volume(this->audioConnection, normalized, 0);\n    }\n}\n\nbool PulseOut::Play(IBuffer *buffer, IBufferProvider* provider) {\n    int error = 0;\n\n    {\n        Lock lock(this->stateMutex);\n\n        this->OpenDevice(buffer);\n\n        if (!this->audioConnection || this->state != StatePlaying) {\n            return false;\n        }\n\n        pa_blocking_write(\n            this->audioConnection,\n            buffer->BufferPointer(),\n            buffer->Samples() * sizeof(float),\n            &error);\n    }\n\n    provider->OnBufferProcessed(buffer);\n    return true;\n}\n\ndouble PulseOut::Latency() {\n    Lock lock(this->stateMutex);\n    \n    if (!this->audioConnection) {\n        return 0.0;\n    }\n\n    int error = 0;\n    unsigned long long latency = pa_blocking_get_latency(this->audioConnection, &error);\n    return (double) latency \/ 1000000.0; \/* microseconds to seconds *\/\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <unistd.h>\n#include <chrono>\n#include <thread>\n\n#include \"Hardware.h\"\n#include \"Fido\/Fido.h\"\n#include \"..\/..\/Connection.h\"\n\nvoid lSleep(double seconds) {\n    usleep(seconds*1000000.0);\n}\n\nvoid goStraight() {\n\tdouble maxRotate = 100;\n\tdouble exploration = 0.2;\n\n\tConnection connection;\n    int receiverNum;\n    do {\n        receiverNum = atoi(connection.getString().c_str());\n    } while(receiverNum != 5 && receiverNum != 6);\n\n    Hardware hardware;\n\n\trl::WireFitQLearn learner = rl::WireFitQLearn(1, 1, 1, 3, 4, {-1}, {1}, 11, new rl::LSInterpolator(), net::Backpropagation(0.01, 0.9, 0.1, 35000), 0.95, 0.4);\n\tlearner.reset();\n    \n    std::cout << \"Done with initialization\\n\";\n\twhile(true) {\n\t\trl::Action action = learner.chooseBoltzmanAction({1}, exploration);\n        std::cout << \"Action: \" << action[0] << \"\\n\";\n\n\t\thardware.goHolonomic(0, 50, action[0]*maxRotate);\n\t\tstd::this_thread::sleep_for(std::chrono::milliseconds(500));\n\t\thardware.goHolonomic(0, 0, 0);\n\t    \n        double reward = connection.getReward();\n        if(fabs(reward - (-2)) < 0.001) break;\n\t\tlearner.applyReinforcementToLastAction(reward, {1});\n\t}\n\n    while(true) {\n        rl::Action action = learner.chooseBoltzmanAction({1}, 0.001);\n        hardware.goHolonomic(0, 50, action[0]*maxRotate);\n        std::this_thread::sleep_for(std::chrono::milliseconds(50));\n        std::cout << \"Action: \" << action[0] << \"\\n\";\n    }\n}\n\nint main() {\n    goStraight();\n\n    return 0;\n}\n<commit_msg>Added goStraightKiwi<commit_after>#include <iostream>\n#include <unistd.h>\n#include <chrono>\n#include <thread>\n\n#include \"Hardware.h\"\n#include \"Fido\/Fido.h\"\n#include \"..\/..\/Connection.h\"\n\nvoid lSleep(double seconds) {\n    usleep(seconds*1000000.0);\n}\n\nvoid goStraight() {\n\tdouble maxRotate = 100;\n\tdouble exploration = 0.2;\n\n\tConnection connection;\n    int receiverNum;\n    do {\n        receiverNum = atoi(connection.getString().c_str());\n    } while(receiverNum != 5 && receiverNum != 6);\n\n    Hardware hardware;\n\n\trl::WireFitQLearn learner = rl::WireFitQLearn(1, 1, 1, 3, 4, {-1}, {1}, 11, new rl::LSInterpolator(), net::Backpropagation(0.01, 0.9, 0.1, 35000), 0.95, 0.4);\n\tlearner.reset();\n    \n    std::cout << \"Done with initialization\\n\";\n\twhile(true) {\n\t\trl::Action action = learner.chooseBoltzmanAction({1}, exploration);\n        std::cout << \"Action: \" << action[0] << \"\\n\";\n\n\t\thardware.goHolonomic(0, 50, action[0]*maxRotate);\n\t\tstd::this_thread::sleep_for(std::chrono::milliseconds(500));\n\t\thardware.goHolonomic(0, 0, 0);\n\t    \n        double reward = connection.getReward();\n        if(fabs(reward - (-2)) < 0.001) break;\n\t\tlearner.applyReinforcementToLastAction(reward, {1});\n\t}\n\n    while(true) {\n        rl::Action action = learner.chooseBoltzmanAction({1}, 0.001);\n        hardware.goHolonomic(0, 50, action[0]*maxRotate);\n        std::this_thread::sleep_for(std::chrono::milliseconds(50));\n        std::cout << \"Action: \" << action[0] << \"\\n\";\n    }\n}\n\nvoid goStraightKiwi() {\n    double maxMove = 100;\n    double exploration = 0.2;\n\n    Connection connection;\n    int receiverNum;\n    do {\n        receiverNum = atoi(connection.getString().c_str());\n    } while(receiverNum != 5 && receiverNum != 6);\n\n    Hardware hardware;\n\n    rl::WireFitQLearn learner = rl::WireFitQLearn(1, 3, 1, 8, 4, {-1, -1, -1}, {1, 1, 1}, 3, new rl::LSInterpolator(), net::Backpropagation(0.01, 0.9, 0.1, 35000), 0.95, 0.4);\n    learner.reset();\n    \n    std::cout << \"Done with initialization\\n\";\n    while(true) {\n        rl::Action action = learner.chooseBoltzmanAction({1}, exploration);\n        std::cout << \"Action: \" << action[0] << \"\\n\";\n\n        hardware.setMotos(action[0]*maxMove, action[1]*maxMove, action[2]*maxMove);\n        std::this_thread::sleep_for(std::chrono::milliseconds(500));\n        hardware.setMotors(0, 0, 0);\n        \n        double reward = connection.getReward();\n        if(fabs(reward - (-2)) < 0.001) break;\n        learner.applyReinforcementToLastAction(reward, {1});\n    }\n\n    while(true) {\n        rl::Action action = learner.chooseBoltzmanAction({1}, 0.001);\n        hardware.goHolonomic(0, 50, action[0]*maxRotate);\n        std::this_thread::sleep_for(std::chrono::milliseconds(50));\n        std::cout << \"Action: \" << action[0] << \"\\n\";\n    }\n}\n\nint main() {\n    goStraightKiwi();\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/usr\/diag\/prdf\/common\/plat\/p9\/prdfCenPll.C $               *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2012,2018                        *\/\n\/* [+] International Business Machines Corp.                              *\/\n\/*                                                                        *\/\n\/*                                                                        *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\");        *\/\n\/* you may not use this file except in compliance with the License.       *\/\n\/* You may obtain a copy of the License at                                *\/\n\/*                                                                        *\/\n\/*     http:\/\/www.apache.org\/licenses\/LICENSE-2.0                         *\/\n\/*                                                                        *\/\n\/* Unless required by applicable law or agreed to in writing, software    *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS,      *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or        *\/\n\/* implied. See the License for the specific language governing           *\/\n\/* permissions and limitations under the License.                         *\/\n\/*                                                                        *\/\n\/* IBM_PROLOG_END_TAG                                                     *\/\n\n\/** @file  prdfCenPLL.C\n *  @brief Contains all common plugin code for the Centaur PLL logic.\n *\/\n\n#include <iipServiceDataCollector.h>\n#include <prdfExtensibleChip.H>\n#include <prdfPluginMap.H>\n#include <prdfFsiCapUtil.H>\n\nnamespace PRDF\n{\n\nusing namespace PLL;\nusing namespace PlatServices;\n\nnamespace cen_centaur\n{\n\nenum\n{\n    PLL_DETECT_CENT_NEST = 19,  \/\/ nest PLL error bit\n    PLL_DETECT_CENT_MEM  = 20   \/\/ mem PLL error bit\n};\n\n\/**\n  * @brief Query the PLL chip for a PLL error on Centaur Plugin\n  * @param  i_chip Centaur chip\n  * @param  o_result set to true in the presence of PLL error\n  * @returns Failure or Success of query.\n  * @note\n  *\/\nint32_t QueryPll( ExtensibleChip * i_chip,\n                        bool & o_result)\n{\n    #define PRDF_FUNC \"[cen_centaur::QueryPll] \"\n\n    int32_t rc = SUCCESS;\n    o_result = false;\n\n    SCAN_COMM_REGISTER_CLASS * TP_LFIR = i_chip->getRegister(\"TP_LFIR\");\n    SCAN_COMM_REGISTER_CLASS * TP_LFIRmask =\n                                         i_chip->getRegister(\"TP_LFIR_MASK\");\n\n    do\n    {\n        rc = TP_LFIR->Read();\n        if (rc != SUCCESS)\n        {\n            PRDF_ERR(PRDF_FUNC \"TP_LFIR read failed\"\n                 \"for 0x%08x\", i_chip->GetId());\n            break;\n        }\n\n        rc = TP_LFIRmask->Read();\n        if (rc != SUCCESS)\n        {\n            PRDF_ERR(PRDF_FUNC \"TP_LFIR_MASK read failed\"\n                 \"for 0x%08x\", i_chip->GetId());\n            break;\n        }\n\n        if((TP_LFIR->IsBitSet(PLL_DETECT_CENT_MEM)  &&\n            !(TP_LFIRmask->IsBitSet(PLL_DETECT_CENT_MEM))) ||\n           (TP_LFIR->IsBitSet(PLL_DETECT_CENT_NEST) &&\n            !(TP_LFIRmask->IsBitSet(PLL_DETECT_CENT_NEST))))\n        {\n            o_result = true;\n        }\n\n    } while(0);\n\n    return rc;\n\n    #undef PRDF_FUNC\n}\nPRDF_PLUGIN_DEFINE( cen_centaur, QueryPll );\n\n\/**\n  * @brief Clear the PLL error for Centaur Plugin\n  * @param  i_chip Centaur chip\n  * @param  i_sc   The step code data struct.\n  * @returns Failure or Success of query.\n  * @note\n  *\/\nint32_t ClearPll( ExtensibleChip * i_chip,\n                        STEP_CODE_DATA_STRUCT & i_sc)\n{\n    #define PRDF_FUNC \"[cen_centaur::ClearPll] \"\n    int32_t rc = SUCCESS;\n\n    if (CHECK_STOP != i_sc.service_data->getPrimaryAttnType())\n    {\n        SCAN_COMM_REGISTER_CLASS * TP_LFIR = i_chip->getRegister(\"TP_LFIR_AND\");\n        TP_LFIR->setAllBits();\n        TP_LFIR->ClearBit(PLL_DETECT_CENT_MEM);\n        TP_LFIR->ClearBit(PLL_DETECT_CENT_NEST);\n        rc = TP_LFIR->Write();\n        if (rc != SUCCESS)\n        {\n            PRDF_ERR(PRDF_FUNC \"TP_LFIR_AND write failed\"\n                 \"for 0x%08x\", i_chip->GetId());\n        }\n    }\n\n    return rc;\n\n    #undef PRDF_FUNC\n}\nPRDF_PLUGIN_DEFINE( cen_centaur, ClearPll );\n\n\/**\n  * @brief Mask the PLL error for Centaur Plugin\n  * @param  i_chip Centaur chip\n  * @param Output Unused.\n  * @returns Failure or Success of query.\n  * @note\n  *\/\nint32_t MaskPll( ExtensibleChip * i_chip,void * unused)\n{\n    #define PRDF_FUNC \"[cen_centaur::MaskPll] \"\n    int32_t rc = SUCCESS;\n\n    SCAN_COMM_REGISTER_CLASS * TP_LFIR_maskOr =\n             i_chip->getRegister(\"TP_LFIR_MASK_OR\");\n\n    TP_LFIR_maskOr->clearAllBits();\n\n    TP_LFIR_maskOr->SetBit(PLL_DETECT_CENT_MEM);\n    TP_LFIR_maskOr->SetBit(PLL_DETECT_CENT_NEST);\n\n    rc = TP_LFIR_maskOr->Write();\n    if (rc != SUCCESS)\n    {\n        PRDF_ERR(PRDF_FUNC \"TP_LFIR_MASK_OR write failed\"\n                 \"for 0x%08x\", i_chip->GetId());\n    }\n\n    return rc;\n\n    #undef PRDF_FUNC\n}\nPRDF_PLUGIN_DEFINE( cen_centaur, MaskPll );\n\n\/**\n * @brief   capture additional PLL FFDC\n * @param   i_chip   Centaur chip\n * @param   i_sc     service data collector\n * @returns Success\n *\/\nint32_t capturePllFfdc( ExtensibleChip * i_chip,\n                        STEP_CODE_DATA_STRUCT & io_sc )\n{\n    #define PRDF_FUNC \"[cen_centaur::capturePllFfdc] \"\n\n    \/\/ Add FSI status reg\n    captureFsiStatusReg( i_chip, io_sc );\n\n    return SUCCESS;\n\n    #undef PRDF_FUNC\n}\nPRDF_PLUGIN_DEFINE( cen_centaur, capturePllFfdc );\n\n\n} \/\/ end namespace cen_centaur\n\n} \/\/ end namespace PRDF\n<commit_msg>PRD: Add missing centaur PLL CheckErrorType plugin<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/usr\/diag\/prdf\/common\/plat\/p9\/prdfCenPll.C $               *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2012,2018                        *\/\n\/* [+] International Business Machines Corp.                              *\/\n\/*                                                                        *\/\n\/*                                                                        *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\");        *\/\n\/* you may not use this file except in compliance with the License.       *\/\n\/* You may obtain a copy of the License at                                *\/\n\/*                                                                        *\/\n\/*     http:\/\/www.apache.org\/licenses\/LICENSE-2.0                         *\/\n\/*                                                                        *\/\n\/* Unless required by applicable law or agreed to in writing, software    *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS,      *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or        *\/\n\/* implied. See the License for the specific language governing           *\/\n\/* permissions and limitations under the License.                         *\/\n\/*                                                                        *\/\n\/* IBM_PROLOG_END_TAG                                                     *\/\n\n\/** @file  prdfCenPLL.C\n *  @brief Contains all common plugin code for the Centaur PLL logic.\n *\/\n\n#include <iipServiceDataCollector.h>\n#include <prdfExtensibleChip.H>\n#include <prdfPluginMap.H>\n#include <prdfFsiCapUtil.H>\n#include <prdfP9Pll.H>\n\nnamespace PRDF\n{\n\nusing namespace PLL;\nusing namespace PlatServices;\n\nnamespace cen_centaur\n{\n\nenum\n{\n    PLL_DETECT_CENT_NEST = 19,  \/\/ nest PLL error bit\n    PLL_DETECT_CENT_MEM  = 20   \/\/ mem PLL error bit\n};\n\n\/**\n  * @brief Query the PLL chip for a PLL error on Centaur Plugin\n  * @param  i_chip Centaur chip\n  * @param  o_result set to true in the presence of PLL error\n  * @returns Failure or Success of query.\n  * @note\n  *\/\nint32_t QueryPll( ExtensibleChip * i_chip,\n                        bool & o_result)\n{\n    #define PRDF_FUNC \"[cen_centaur::QueryPll] \"\n\n    int32_t rc = SUCCESS;\n    o_result = false;\n\n    SCAN_COMM_REGISTER_CLASS * TP_LFIR = i_chip->getRegister(\"TP_LFIR\");\n    SCAN_COMM_REGISTER_CLASS * TP_LFIRmask =\n                                         i_chip->getRegister(\"TP_LFIR_MASK\");\n\n    do\n    {\n        rc = TP_LFIR->Read();\n        if (rc != SUCCESS)\n        {\n            PRDF_ERR(PRDF_FUNC \"TP_LFIR read failed\"\n                 \"for 0x%08x\", i_chip->GetId());\n            break;\n        }\n\n        rc = TP_LFIRmask->Read();\n        if (rc != SUCCESS)\n        {\n            PRDF_ERR(PRDF_FUNC \"TP_LFIR_MASK read failed\"\n                 \"for 0x%08x\", i_chip->GetId());\n            break;\n        }\n\n        if((TP_LFIR->IsBitSet(PLL_DETECT_CENT_MEM)  &&\n            !(TP_LFIRmask->IsBitSet(PLL_DETECT_CENT_MEM))) ||\n           (TP_LFIR->IsBitSet(PLL_DETECT_CENT_NEST) &&\n            !(TP_LFIRmask->IsBitSet(PLL_DETECT_CENT_NEST))))\n        {\n            o_result = true;\n        }\n\n    } while(0);\n\n    return rc;\n\n    #undef PRDF_FUNC\n}\nPRDF_PLUGIN_DEFINE( cen_centaur, QueryPll );\n\n\/**\n *  @brief Examine chiplets to determine which type of PLL error has ocurred.\n *         There are no PCI clocks or switchovers reported on centaur, so the\n *         only errType to report here is SYS_PLL_UNLOCK\n *  @param i_chip Centaur chip\n *  @param o_errType enum indicating which type of PLL error is detected\n *  @returns Failure or Success\n *\/\nint32_t CheckErrorType( ExtensibleChip * i_chip, uint32_t & o_errType )\n{\n    #define PRDF_FUNC \"[Proc::CheckErrorType] \"\n    int32_t rc = SUCCESS;\n    bool errFound = false;\n\n    rc = QueryPll( i_chip, errFound );\n\n    if ( (SUCCESS == rc) && errFound )\n        o_errType |= SYS_PLL_UNLOCK;\n\n    return SUCCESS;\n    #undef PRDF_FUNC\n}\nPRDF_PLUGIN_DEFINE( cen_centaur, CheckErrorType );\n\n\/**\n  * @brief Clear the PLL error for Centaur Plugin\n  * @param  i_chip Centaur chip\n  * @param  i_sc   The step code data struct.\n  * @returns Failure or Success of query.\n  * @note\n  *\/\nint32_t ClearPll( ExtensibleChip * i_chip,\n                        STEP_CODE_DATA_STRUCT & i_sc)\n{\n    #define PRDF_FUNC \"[cen_centaur::ClearPll] \"\n    int32_t rc = SUCCESS;\n\n    if (CHECK_STOP != i_sc.service_data->getPrimaryAttnType())\n    {\n        SCAN_COMM_REGISTER_CLASS * TP_LFIR = i_chip->getRegister(\"TP_LFIR_AND\");\n        TP_LFIR->setAllBits();\n        TP_LFIR->ClearBit(PLL_DETECT_CENT_MEM);\n        TP_LFIR->ClearBit(PLL_DETECT_CENT_NEST);\n        rc = TP_LFIR->Write();\n        if (rc != SUCCESS)\n        {\n            PRDF_ERR(PRDF_FUNC \"TP_LFIR_AND write failed\"\n                 \"for 0x%08x\", i_chip->GetId());\n        }\n    }\n\n    return rc;\n\n    #undef PRDF_FUNC\n}\nPRDF_PLUGIN_DEFINE( cen_centaur, ClearPll );\n\n\/**\n  * @brief Mask the PLL error for Centaur Plugin\n  * @param  i_chip Centaur chip\n  * @param Output Unused.\n  * @returns Failure or Success of query.\n  * @note\n  *\/\nint32_t MaskPll( ExtensibleChip * i_chip,void * unused)\n{\n    #define PRDF_FUNC \"[cen_centaur::MaskPll] \"\n    int32_t rc = SUCCESS;\n\n    SCAN_COMM_REGISTER_CLASS * TP_LFIR_maskOr =\n             i_chip->getRegister(\"TP_LFIR_MASK_OR\");\n\n    TP_LFIR_maskOr->clearAllBits();\n\n    TP_LFIR_maskOr->SetBit(PLL_DETECT_CENT_MEM);\n    TP_LFIR_maskOr->SetBit(PLL_DETECT_CENT_NEST);\n\n    rc = TP_LFIR_maskOr->Write();\n    if (rc != SUCCESS)\n    {\n        PRDF_ERR(PRDF_FUNC \"TP_LFIR_MASK_OR write failed\"\n                 \"for 0x%08x\", i_chip->GetId());\n    }\n\n    return rc;\n\n    #undef PRDF_FUNC\n}\nPRDF_PLUGIN_DEFINE( cen_centaur, MaskPll );\n\n\/**\n * @brief   capture additional PLL FFDC\n * @param   i_chip   Centaur chip\n * @param   i_sc     service data collector\n * @returns Success\n *\/\nint32_t capturePllFfdc( ExtensibleChip * i_chip,\n                        STEP_CODE_DATA_STRUCT & io_sc )\n{\n    #define PRDF_FUNC \"[cen_centaur::capturePllFfdc] \"\n\n    \/\/ Add FSI status reg\n    captureFsiStatusReg( i_chip, io_sc );\n\n    return SUCCESS;\n\n    #undef PRDF_FUNC\n}\nPRDF_PLUGIN_DEFINE( cen_centaur, capturePllFfdc );\n\n\n} \/\/ end namespace cen_centaur\n\n} \/\/ end namespace PRDF\n<|endoftext|>"}
{"text":"<commit_before>#ifndef _WIN32\n\n#include \"Socket.h\"\n#include \"System\/Log.h\"\n#include \"System\/Common.h\"\n#include <netinet\/in.h>\n#include <netinet\/tcp.h>\n#include <sys\/socket.h>\n#include <arpa\/inet.h>\n#include <fcntl.h>\n#include <unistd.h>\n#include <errno.h>\n\n#ifndef INADDR_NONE\n#define INADDR_NONE 0xffffffff\n#endif\n\nunsigned long iftonl(const char* interface);\n\nSocket::Socket()\n{\n    fd = -1;\n    listening = false;\n}\n\nbool Socket::Create()\n{\n    if (fd >= 0)\n    {\n        Log_Trace(\"Called Create() on existing socket\");\n        return false;\n    }\n    \n    fd = socket(AF_INET, SOCK_STREAM, 0);\n    if (fd < 0)\n    {\n        Log_Errno();\n        return false;\n    }\n        \n    proto = proto_;\n    listening = false;\n    \n\/\/    SetReceiveBufferSize(64*KiB);\n    \n    return true;\n}\n\nbool Socket::SetNonblocking()\n{\n    int ret;\n    \n    if (fd < 0)\n    {\n        Log_Trace(\"SetNonblocking on invalid file descriptor\");\n        return false;\n    }\n    \n    ret = fcntl(fd, F_GETFL, 0);\n    if (ret < 0)\n    {\n        Log_Errno();\n        return false;\n    }\n\n    ret = fcntl(fd, F_SETFL, ret | O_NONBLOCK);\n    if (ret < 0)\n    {\n        Log_Errno();\n        return false;\n    }\n    \n    return true;\n}\n\nbool Socket::SetNodelay()\n{\n    int     ret;\n    int     sockopt;\n\n    if (fd < 0)\n    {\n        Log_Trace(\"SetNodelay on invalid file descriptor\");\n        return false;\n    }\n    \n    sockopt = 1;\n    ret = setsockopt(fd, IPPROTO_TCP, TCP_NODELAY, &sockopt, sizeof(sockopt));\n    if (ret < 0)\n    {\n        Log_Errno();\n        return false;\n    }\n    \n    return true;\n}\n\nbool Socket::SetReceiveBufferSize(unsigned size)\n{\n    int     ret;\n\n    if (fd < 0)\n    {\n        Log_Trace(\"SetRecieveBufferSize on invalid file descriptor\");\n        return false;\n    }\n    \n    ret = setsockopt(fd, IPPROTO_TCP, SO_RCVBUF, &size, sizeof(size));\n    if (ret < 0)\n    {\n        Log_Errno();\n        return false;\n    }\n    \n    return true;\n}\n\nbool Socket::Bind(int port)\n{\n    int                 ret;\n    struct sockaddr_in  sa;\n    int                 sockopt;\n\n    sockopt = 1;\n    ret = setsockopt(fd, SOL_SOCKET, SO_REUSEADDR, &sockopt, sizeof(sockopt));\n    if (ret < 0)\n    {\n        Log_Errno();\n        Close();\n        return false;\n    }\n    \n    memset(&sa, 0, sizeof(sa));\n    sa.sin_port = htons((uint16_t)port);\n    sa.sin_addr.s_addr = htonl(INADDR_ANY);\n    \n    ret = bind(fd, (struct sockaddr *)&sa, sizeof(struct sockaddr_in));\n    if (ret < 0)\n    {\n        Log_Errno();\n        Close();\n        return false;\n    }\n    \n    return true;\n}\n\nbool Socket::Listen(int port, int backlog)\n{\n    int ret;\n    \n    if (!Bind(port))\n        return false;\n    \n    ret = listen(fd, backlog);\n    if (ret < 0)\n    {\n        Log_Errno();\n        Close();\n        return false;\n    }\n    \n    listening = true;\n    \n    return true;\n}\n\nbool Socket::Accept(Socket *newSocket)\n{\n    newSocket->fd = accept(fd, NULL, NULL);\n    if (newSocket->fd < 0)\n    {\n        Log_Errno();\n        Close();\n        return false;\n    }\n    \n    return true;\n}\n\nbool Socket::Connect(Endpoint &endpoint)\n{\n    int ret;\n    struct sockaddr* sa = (struct sockaddr*) endpoint.GetSockAddr();\n    \n    ret = connect(fd, sa, ENDPOINT_SOCKADDR_SIZE);\n    \n    if (ret < 0)\n    {\n        if (errno != EINPROGRESS)\n        {\n            Log_Errno();\n            return false;\n        }\n    }\n\n    return true;\n}\n\nbool Socket::GetEndpoint(Endpoint &endpoint)\n{\n    int ret;\n    struct sockaddr* sa = (struct sockaddr*) endpoint.GetSockAddr();\n    socklen_t len = ENDPOINT_SOCKADDR_SIZE;\n    \n    ret = getpeername(fd, sa, &len);\n    \n    if (ret < 0)\n    {\n        Log_Errno();\n        Close();\n        return false;\n    }\n    \n    return true;\n}\n\nconst char* Socket::ToString(char s[ENDPOINT_STRING_SIZE])\n{\n    Endpoint    endpoint;\n    \n    if (!GetEndpoint(endpoint))\n        return \"\";\n    \n    return endpoint.ToString(s);\n}\n\nbool Socket::SendTo(void *data, int count, const Endpoint &endpoint)\n{\n    int ret;\n    const struct sockaddr* sa =\n    (const struct sockaddr*) ((Endpoint&) endpoint).GetSockAddr();\n    \n    ret = sendto(fd, data, count, 0, sa, ENDPOINT_SOCKADDR_SIZE);\n    \n    if (ret < 0)\n    {\n        Log_Errno();\n        return false;\n    }\n    \n    return true;\n}\n\nint Socket::Send(const char* data, int count, int timeout)\n{\n    size_t      left;\n    ssize_t     nwritten;\n    timeval     tv;\n    fd_set      fds;\n    int         ret;\n    \n    left = count;\n    while (left > 0)\n    {\n        if ((nwritten = write(fd, data, count)) < 0)\n        {\n            if (errno == EINTR)\n            {\n                nwritten = 0;\n            }\n            else if (errno == EPIPE)\n            {\n                return -1;\n            }\n            else if (errno == EAGAIN)\n            {\n                FD_ZERO(&fds);\n                FD_SET(fd, &fds);\n                if (timeout)\n                {\n                    tv.tv_sec = timeout \/ 1000;\n                    tv.tv_usec = (timeout % 1000) * 1000;\n                    ret = select(fd + 1, NULL, &fds, NULL, &tv);\n                }\n                else\n                    ret = select(fd + 1, NULL, &fds, NULL, NULL);\n\n                if (ret <= 0)\n                    return -1;\n\n                nwritten = 0;\n            }\n            else\n                return -1;\n        }\n\n        left -= nwritten;\n        data += nwritten;\n    }\n    \n    return count;\n}\n\nint Socket::Read(char* data, int count, int timeout)\n{\n    ssize_t     nread;\n    timeval     tv;\n    fd_set      fds;\n    int         ret;\n    \nagain:\n    if ((nread = read(fd, data, count)) < 0)\n    {\n        Log_Errno();\n        if (errno == EINTR)\n        {\n            nread = 0;\n            goto again;\n        }\n        else if (errno == EAGAIN)\n        {\n            FD_ZERO(&fds);\n            FD_SET(fd, &fds);\n            if (timeout)\n            {\n                tv.tv_sec = timeout \/ 1000;\n                tv.tv_usec = (timeout % 1000) * 1000;\n                ret = select(fd + 1, &fds, NULL, &fds, &tv);\n            }\n            else\n                ret = select(fd + 1, &fds, NULL, &fds, NULL);\n\n            if (ret <= 0)\n                return -1;\n\n            goto again;\n        }\n        else\n            return -1;\n    }\n\n    return nread;\n}\n\nvoid Socket::Close()\n{\n    int ret;\n    \n    if (fd != -1)\n    {\n        ret = close(fd);\n\n        if (ret < 0)\n            Log_Errno();\n\n        fd = -1;\n    }\n}\n\nunsigned long iftonl(const char* interface)\n{\n    int pos;\n    int len;\n    unsigned long a;\n    unsigned long b;\n    unsigned long c;\n    unsigned long d;\n    unsigned long addr;\n    unsigned nread;\n    \n    nread = 0;\n    pos = 0;\n    len = strlen(interface);\n    \n    a = BufferToUInt64(interface + pos, len - pos, &nread);\n    if (nread == 0 || a > 255)\n        return INADDR_NONE;\n    \n    pos += nread;\n    if (interface[pos++] != '.')\n        return INADDR_NONE;\n    \n    b = BufferToUInt64(interface + pos, len - pos, &nread);\n    if (nread == 0 || b > 255)\n        return INADDR_NONE;\n    \n    pos += nread;\n    if (interface[pos++] != '.')\n        return INADDR_NONE;\n\n    c = BufferToUInt64(interface + pos, len - pos, &nread);\n    if (nread == 0 || c > 255)\n        return INADDR_NONE;\n    \n    pos += nread;\n    if (interface[pos++] != '.')\n        return INADDR_NONE;\n\n    d = BufferToUInt64(interface + pos, len - pos, &nread);\n    if (nread == 0 || d > 255)\n        return INADDR_NONE;\n    \n    pos += nread;\n    if (interface[pos] != '\\0' &&\n        interface[pos] != ':')\n        return INADDR_NONE;\n    \n    addr = (d & 0xff) << 24 | (c & 0xff) << 16 | (b & 0xff) << 8 | (a & 0xff);\n    return addr;\n}\n\n#endif\n<commit_msg>Fixed bug in previous commit: Removed UDP from IOProcessor and Socket.<commit_after>#ifndef _WIN32\n\n#include \"Socket.h\"\n#include \"System\/Log.h\"\n#include \"System\/Common.h\"\n#include <netinet\/in.h>\n#include <netinet\/tcp.h>\n#include <sys\/socket.h>\n#include <arpa\/inet.h>\n#include <fcntl.h>\n#include <unistd.h>\n#include <errno.h>\n\n#ifndef INADDR_NONE\n#define INADDR_NONE 0xffffffff\n#endif\n\nunsigned long iftonl(const char* interface);\n\nSocket::Socket()\n{\n    fd = -1;\n    listening = false;\n}\n\nbool Socket::Create()\n{\n    if (fd >= 0)\n    {\n        Log_Trace(\"Called Create() on existing socket\");\n        return false;\n    }\n    \n    fd = socket(AF_INET, SOCK_STREAM, 0);\n    if (fd < 0)\n    {\n        Log_Errno();\n        return false;\n    }\n        \n    listening = false;\n    \n\/\/    SetReceiveBufferSize(64*KiB);\n    \n    return true;\n}\n\nbool Socket::SetNonblocking()\n{\n    int ret;\n    \n    if (fd < 0)\n    {\n        Log_Trace(\"SetNonblocking on invalid file descriptor\");\n        return false;\n    }\n    \n    ret = fcntl(fd, F_GETFL, 0);\n    if (ret < 0)\n    {\n        Log_Errno();\n        return false;\n    }\n\n    ret = fcntl(fd, F_SETFL, ret | O_NONBLOCK);\n    if (ret < 0)\n    {\n        Log_Errno();\n        return false;\n    }\n    \n    return true;\n}\n\nbool Socket::SetNodelay()\n{\n    int     ret;\n    int     sockopt;\n\n    if (fd < 0)\n    {\n        Log_Trace(\"SetNodelay on invalid file descriptor\");\n        return false;\n    }\n    \n    sockopt = 1;\n    ret = setsockopt(fd, IPPROTO_TCP, TCP_NODELAY, &sockopt, sizeof(sockopt));\n    if (ret < 0)\n    {\n        Log_Errno();\n        return false;\n    }\n    \n    return true;\n}\n\nbool Socket::SetReceiveBufferSize(unsigned size)\n{\n    int     ret;\n\n    if (fd < 0)\n    {\n        Log_Trace(\"SetRecieveBufferSize on invalid file descriptor\");\n        return false;\n    }\n    \n    ret = setsockopt(fd, IPPROTO_TCP, SO_RCVBUF, &size, sizeof(size));\n    if (ret < 0)\n    {\n        Log_Errno();\n        return false;\n    }\n    \n    return true;\n}\n\nbool Socket::Bind(int port)\n{\n    int                 ret;\n    struct sockaddr_in  sa;\n    int                 sockopt;\n\n    sockopt = 1;\n    ret = setsockopt(fd, SOL_SOCKET, SO_REUSEADDR, &sockopt, sizeof(sockopt));\n    if (ret < 0)\n    {\n        Log_Errno();\n        Close();\n        return false;\n    }\n    \n    memset(&sa, 0, sizeof(sa));\n    sa.sin_port = htons((uint16_t)port);\n    sa.sin_addr.s_addr = htonl(INADDR_ANY);\n    \n    ret = bind(fd, (struct sockaddr *)&sa, sizeof(struct sockaddr_in));\n    if (ret < 0)\n    {\n        Log_Errno();\n        Close();\n        return false;\n    }\n    \n    return true;\n}\n\nbool Socket::Listen(int port, int backlog)\n{\n    int ret;\n    \n    if (!Bind(port))\n        return false;\n    \n    ret = listen(fd, backlog);\n    if (ret < 0)\n    {\n        Log_Errno();\n        Close();\n        return false;\n    }\n    \n    listening = true;\n    \n    return true;\n}\n\nbool Socket::Accept(Socket *newSocket)\n{\n    newSocket->fd = accept(fd, NULL, NULL);\n    if (newSocket->fd < 0)\n    {\n        Log_Errno();\n        Close();\n        return false;\n    }\n    \n    return true;\n}\n\nbool Socket::Connect(Endpoint &endpoint)\n{\n    int ret;\n    struct sockaddr* sa = (struct sockaddr*) endpoint.GetSockAddr();\n    \n    ret = connect(fd, sa, ENDPOINT_SOCKADDR_SIZE);\n    \n    if (ret < 0)\n    {\n        if (errno != EINPROGRESS)\n        {\n            Log_Errno();\n            return false;\n        }\n    }\n\n    return true;\n}\n\nbool Socket::GetEndpoint(Endpoint &endpoint)\n{\n    int ret;\n    struct sockaddr* sa = (struct sockaddr*) endpoint.GetSockAddr();\n    socklen_t len = ENDPOINT_SOCKADDR_SIZE;\n    \n    ret = getpeername(fd, sa, &len);\n    \n    if (ret < 0)\n    {\n        Log_Errno();\n        Close();\n        return false;\n    }\n    \n    return true;\n}\n\nconst char* Socket::ToString(char s[ENDPOINT_STRING_SIZE])\n{\n    Endpoint    endpoint;\n    \n    if (!GetEndpoint(endpoint))\n        return \"\";\n    \n    return endpoint.ToString(s);\n}\n\nbool Socket::SendTo(void *data, int count, const Endpoint &endpoint)\n{\n    int ret;\n    const struct sockaddr* sa =\n    (const struct sockaddr*) ((Endpoint&) endpoint).GetSockAddr();\n    \n    ret = sendto(fd, data, count, 0, sa, ENDPOINT_SOCKADDR_SIZE);\n    \n    if (ret < 0)\n    {\n        Log_Errno();\n        return false;\n    }\n    \n    return true;\n}\n\nint Socket::Send(const char* data, int count, int timeout)\n{\n    size_t      left;\n    ssize_t     nwritten;\n    timeval     tv;\n    fd_set      fds;\n    int         ret;\n    \n    left = count;\n    while (left > 0)\n    {\n        if ((nwritten = write(fd, data, count)) < 0)\n        {\n            if (errno == EINTR)\n            {\n                nwritten = 0;\n            }\n            else if (errno == EPIPE)\n            {\n                return -1;\n            }\n            else if (errno == EAGAIN)\n            {\n                FD_ZERO(&fds);\n                FD_SET(fd, &fds);\n                if (timeout)\n                {\n                    tv.tv_sec = timeout \/ 1000;\n                    tv.tv_usec = (timeout % 1000) * 1000;\n                    ret = select(fd + 1, NULL, &fds, NULL, &tv);\n                }\n                else\n                    ret = select(fd + 1, NULL, &fds, NULL, NULL);\n\n                if (ret <= 0)\n                    return -1;\n\n                nwritten = 0;\n            }\n            else\n                return -1;\n        }\n\n        left -= nwritten;\n        data += nwritten;\n    }\n    \n    return count;\n}\n\nint Socket::Read(char* data, int count, int timeout)\n{\n    ssize_t     nread;\n    timeval     tv;\n    fd_set      fds;\n    int         ret;\n    \nagain:\n    if ((nread = read(fd, data, count)) < 0)\n    {\n        Log_Errno();\n        if (errno == EINTR)\n        {\n            nread = 0;\n            goto again;\n        }\n        else if (errno == EAGAIN)\n        {\n            FD_ZERO(&fds);\n            FD_SET(fd, &fds);\n            if (timeout)\n            {\n                tv.tv_sec = timeout \/ 1000;\n                tv.tv_usec = (timeout % 1000) * 1000;\n                ret = select(fd + 1, &fds, NULL, &fds, &tv);\n            }\n            else\n                ret = select(fd + 1, &fds, NULL, &fds, NULL);\n\n            if (ret <= 0)\n                return -1;\n\n            goto again;\n        }\n        else\n            return -1;\n    }\n\n    return nread;\n}\n\nvoid Socket::Close()\n{\n    int ret;\n    \n    if (fd != -1)\n    {\n        ret = close(fd);\n\n        if (ret < 0)\n            Log_Errno();\n\n        fd = -1;\n    }\n}\n\nunsigned long iftonl(const char* interface)\n{\n    int pos;\n    int len;\n    unsigned long a;\n    unsigned long b;\n    unsigned long c;\n    unsigned long d;\n    unsigned long addr;\n    unsigned nread;\n    \n    nread = 0;\n    pos = 0;\n    len = strlen(interface);\n    \n    a = BufferToUInt64(interface + pos, len - pos, &nread);\n    if (nread == 0 || a > 255)\n        return INADDR_NONE;\n    \n    pos += nread;\n    if (interface[pos++] != '.')\n        return INADDR_NONE;\n    \n    b = BufferToUInt64(interface + pos, len - pos, &nread);\n    if (nread == 0 || b > 255)\n        return INADDR_NONE;\n    \n    pos += nread;\n    if (interface[pos++] != '.')\n        return INADDR_NONE;\n\n    c = BufferToUInt64(interface + pos, len - pos, &nread);\n    if (nread == 0 || c > 255)\n        return INADDR_NONE;\n    \n    pos += nread;\n    if (interface[pos++] != '.')\n        return INADDR_NONE;\n\n    d = BufferToUInt64(interface + pos, len - pos, &nread);\n    if (nread == 0 || d > 255)\n        return INADDR_NONE;\n    \n    pos += nread;\n    if (interface[pos] != '\\0' &&\n        interface[pos] != ':')\n        return INADDR_NONE;\n    \n    addr = (d & 0xff) << 24 | (c & 0xff) << 16 | (b & 0xff) << 8 | (a & 0xff);\n    return addr;\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/-------------------------------------------\n\/\/\n\/\/  Example of the registration hierarchy\n\/\/\n\/\/-------------------------------------------\n\n\n#include <itkPoint.h>\n#include <itkVectorContainer.h>\n#include <itkRegistrationMethod.h>\n#include <itkRegistrationOptimizer.h>\n#include <itkRegistrationTransformationAffine.h>\n#include <itkRegistrationMetricProcrustes.h>\n\n\nint main()\n{\n\n  const unsigned int Dimension = 3;\n\n  typedef itk::VectorContainer< \n                          unsigned short, \n                          double >               ParameterType;\n\n  typedef vnl_vector< double >                   MeasureType;\n  typedef vnl_matrix< double >                   DerivativeType;\n                                 \n  typedef itk::RegistrationTransformationAffine< \n                          ParameterType,\n                          Dimension      >       TransformationType;\n  \n\n  typedef itk::RegistrationMetricProcrustes< TransformationType,\n                                Dimension >       MetricType;\n\n  typedef MetricType::TargetType         TargetType;\n  typedef MetricType::ReferenceType      ReferenceType;\n\n  typedef itk::RegistrationOptimizer< \n                                MetricType >      OptimizerType;\n\n  typedef itk::RegistrationMethod< MetricType,\n                               OptimizerType >   RegistrationType;\n\n  TargetType::Pointer         target            = TargetType::New();\n  ReferenceType::Pointer      reference         = ReferenceType::New();\n  TransformationType::Pointer transformation    = TransformationType::New();\n  RegistrationType::Pointer   registration      = RegistrationType::New();\n\n  registration->SetTarget( target );\n  registration->SetReference( reference );\n  registration->SetTransformation( transformation );\n\n  registration->StartRegistration();\n\n  return 0;\n\n}\n\n\n\n<commit_msg>ENH: Verified that compiles with the vnl wrapped minimizers.<commit_after>\/\/-------------------------------------------\n\/\/\n\/\/  Example of the registration hierarchy\n\/\/\n\/\/-------------------------------------------\n\n\n#include <itkPoint.h>\n#include <itkVectorContainer.h>\n#include <itkRegistrationMethod.h>\n#include <itkRegistrationOptimizerLBFGS.h>\n#include <itkRegistrationTransformationAffine.h>\n#include <itkRegistrationMetricProcrustes.h>\n\n\nint main()\n{\n\n  const unsigned int Dimension = 3;\n\n  typedef itk::VectorContainer< \n                          unsigned short, \n                          double >               ParameterType;\n\n  typedef vnl_vector< double >                   MeasureType;\n  typedef vnl_matrix< double >                   DerivativeType;\n                                 \n  typedef itk::RegistrationTransformationAffine< \n                          ParameterType,\n                          Dimension      >       TransformationType;\n  \n\n  typedef itk::RegistrationMetricProcrustes< TransformationType,\n                                Dimension >       MetricType;\n\n  typedef MetricType::TargetType         TargetType;\n  typedef MetricType::ReferenceType      ReferenceType;\n\n  typedef itk::RegistrationOptimizerLBFGS< \n                                MetricType >      OptimizerType;\n\n  typedef itk::RegistrationMethod< MetricType,\n                               OptimizerType >   RegistrationType;\n\n  TargetType::Pointer         target            = TargetType::New();\n  ReferenceType::Pointer      reference         = ReferenceType::New();\n  TransformationType::Pointer transformation    = TransformationType::New();\n  RegistrationType::Pointer   registration      = RegistrationType::New();\n\n  registration->SetTarget( target );\n  registration->SetReference( reference );\n  registration->SetTransformation( transformation );\n\n  registration->StartRegistration();\n\n  return 0;\n\n}\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ ComponentTests.cpp\n#include <gtest\/gtest.h>\n\n#include \"Component.h\"\n#include \"CycException.h\"\n#include \"StubThermal.h\"\n#include \"StubNuclide.h\"\n\nusing namespace std;\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nclass ComponentTest : public ::testing::Test {\n  protected:\n    ComponentPtr test_component_;\n    Temp OneHundredCinK;\n    string name_;\n    double infty_;\n    ComponentType type_;\n    Radius inner_radius_, outer_radius_;\n    ThermalModelPtr thermal_model_;\n    NuclideModelPtr nuclide_model_;\n\n    virtual void SetUp(){\n      test_component_ = ComponentPtr(new Component());\n      OneHundredCinK=373;\n      name_ = \"Test\";\n      infty_ = numeric_limits<double>::infinity();\n      type_ = BUFFER;\n      inner_radius_ = 2;\n      outer_radius_ = 10;\n      thermal_model_ = StubThermalPtr(new StubThermal());\n      nuclide_model_ = StubNuclidePtr(new StubNuclide());\n    }\n    virtual void TearDown() {\n    }\n};\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(ComponentTest, defaultConstructor) {\n  ASSERT_EQ(\"\", test_component_->name());\n  ASSERT_EQ(LAST_EBS, test_component_->type());\n  ASSERT_FLOAT_EQ(0,test_component_->inner_radius());\n  ASSERT_EQ(infty_, test_component_->outer_radius());\n\n  ASSERT_FLOAT_EQ(0, test_component_->centroid().x_);\n  ASSERT_FLOAT_EQ(0, test_component_->centroid().y_);\n  ASSERT_FLOAT_EQ(0, test_component_->centroid().z_);\n\n  ASSERT_FLOAT_EQ(0, test_component_->x());\n  ASSERT_FLOAT_EQ(0, test_component_->y());\n  ASSERT_FLOAT_EQ(0, test_component_->z());\n\n  ASSERT_FLOAT_EQ(0, test_component_->temp());\n  ASSERT_FLOAT_EQ(OneHundredCinK, test_component_->temp_lim());\n  ASSERT_EQ(LAST_THERMAL, test_component_->thermal_model()->type());\n  ASSERT_EQ(LAST_NUCLIDE, test_component_->nuclide_model()->type());\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(ComponentTest, initFunctionNoXML) { \n  EXPECT_NO_THROW(test_component_->init(name_, type_, inner_radius_, outer_radius_, \n        thermal_model_, nuclide_model_));\n  ASSERT_EQ(name_, test_component_->name());\n  ASSERT_EQ(type_, test_component_->type());\n  ASSERT_EQ(inner_radius_, test_component_->inner_radius());\n  ASSERT_EQ(outer_radius_, test_component_->outer_radius());\n  ASSERT_EQ(thermal_model_, test_component_->thermal_model());\n  ASSERT_EQ(nuclide_model_, test_component_->nuclide_model());\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(ComponentTest, copy) {\n  ComponentPtr test_copy = ComponentPtr(new Component());\n  ASSERT_THROW(test_copy->copy(test_copy), CycException);\n\n  EXPECT_NO_THROW(test_component_->init(name_, type_, inner_radius_, outer_radius_, \n        thermal_model_, nuclide_model_));\n  EXPECT_NO_THROW(test_copy->copy(test_component_));\n\n  EXPECT_EQ(inner_radius_, test_copy->inner_radius());\n  EXPECT_EQ(outer_radius_, test_copy->outer_radius());\n  EXPECT_EQ(\"STUB_THERMAL\", test_copy->thermal_model()->name());\n  EXPECT_EQ(\"STUB_NUCLIDE\", test_copy->nuclide_model()->name());\n}\n<commit_msg>fixed poorly defined Component thermalmodel\/nuclidemodel test to conform to smartpointer changes.<commit_after>\/\/ ComponentTests.cpp\n#include <gtest\/gtest.h>\n\n#include \"Component.h\"\n#include \"CycException.h\"\n#include \"StubThermal.h\"\n#include \"StubNuclide.h\"\n\nusing namespace std;\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nclass ComponentTest : public ::testing::Test {\n  protected:\n    ComponentPtr test_component_;\n    Temp OneHundredCinK;\n    string name_;\n    double infty_;\n    ComponentType type_;\n    Radius inner_radius_, outer_radius_;\n    ThermalModelPtr thermal_model_;\n    NuclideModelPtr nuclide_model_;\n\n    virtual void SetUp(){\n      test_component_ = ComponentPtr(new Component());\n      OneHundredCinK=373;\n      name_ = \"Test\";\n      infty_ = numeric_limits<double>::infinity();\n      type_ = BUFFER;\n      inner_radius_ = 2;\n      outer_radius_ = 10;\n      thermal_model_ = StubThermalPtr(new StubThermal());\n      nuclide_model_ = StubNuclidePtr(new StubNuclide());\n    }\n    virtual void TearDown() {\n    }\n};\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(ComponentTest, defaultConstructor) {\n  ASSERT_EQ(\"\", test_component_->name());\n  ASSERT_EQ(LAST_EBS, test_component_->type());\n  ASSERT_FLOAT_EQ(0,test_component_->inner_radius());\n  ASSERT_EQ(infty_, test_component_->outer_radius());\n\n  ASSERT_FLOAT_EQ(0, test_component_->centroid().x_);\n  ASSERT_FLOAT_EQ(0, test_component_->centroid().y_);\n  ASSERT_FLOAT_EQ(0, test_component_->centroid().z_);\n\n  ASSERT_FLOAT_EQ(0, test_component_->x());\n  ASSERT_FLOAT_EQ(0, test_component_->y());\n  ASSERT_FLOAT_EQ(0, test_component_->z());\n\n  ASSERT_FLOAT_EQ(0, test_component_->temp());\n  ASSERT_FLOAT_EQ(OneHundredCinK, test_component_->temp_lim());\n  ASSERT_EQ(true, !test_component_->thermal_model());\n  ASSERT_EQ(true, !test_component_->nuclide_model());\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(ComponentTest, initFunctionNoXML) { \n  EXPECT_NO_THROW(test_component_->init(name_, type_, inner_radius_, outer_radius_, \n        thermal_model_, nuclide_model_));\n  ASSERT_EQ(name_, test_component_->name());\n  ASSERT_EQ(type_, test_component_->type());\n  ASSERT_EQ(inner_radius_, test_component_->inner_radius());\n  ASSERT_EQ(outer_radius_, test_component_->outer_radius());\n  ASSERT_EQ(thermal_model_, test_component_->thermal_model());\n  ASSERT_EQ(nuclide_model_, test_component_->nuclide_model());\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(ComponentTest, copy) {\n  ComponentPtr test_copy = ComponentPtr(new Component());\n  ASSERT_THROW(test_copy->copy(test_copy), CycException);\n\n  EXPECT_NO_THROW(test_component_->init(name_, type_, inner_radius_, outer_radius_, \n        thermal_model_, nuclide_model_));\n  EXPECT_NO_THROW(test_copy->copy(test_component_));\n\n  EXPECT_EQ(inner_radius_, test_copy->inner_radius());\n  EXPECT_EQ(outer_radius_, test_copy->outer_radius());\n  EXPECT_EQ(\"STUB_THERMAL\", test_copy->thermal_model()->name());\n  EXPECT_EQ(\"STUB_NUCLIDE\", test_copy->nuclide_model()->name());\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef STAN_MATH_OPENCL_PRIM_NEG_BINOMIAL_2_LPMF_HPP\n#define STAN_MATH_OPENCL_PRIM_NEG_BINOMIAL_2_LPMF_HPP\n#ifdef STAN_OPENCL\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\/elt_divide.hpp>\n#include <stan\/math\/prim\/fun\/elt_multiply.hpp>\n#include <stan\/math\/prim\/fun\/exp.hpp>\n#include <stan\/math\/opencl\/kernel_generator.hpp>\n#include <stan\/math\/prim\/functor\/operands_and_partials.hpp>\n\nnamespace stan {\nnamespace math {\n\n\/** \\ingroup opencl\n * The log of the negative binomial density for the specified scalars given\n * the specified mean(s) and deviation(s). n, mu, or phi can\n * each be either a scalar or a vector matrix_cl. Any vector inputs\n * 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_n_cl type of scalar\n * @tparam T_location_cl type of location parameter\n * @tparam T_precision_cl type of precision parameter\n * @param n (Sequence of) scalar(s).\n * @param mu (Sequence of) location parameter(s)\n * @param phi (Sequence of) precision parameters\n * @return The log of the product of the densities.\n * @throw std::domain_error if the scale is not positive.\n *\/\ntemplate <bool propto, typename T_n_cl, typename T_location_cl,\n          typename T_precision_cl,\n          require_all_prim_or_rev_kernel_expression_t<\n              T_n_cl, T_location_cl, T_precision_cl>* = nullptr,\n          require_any_not_stan_scalar_t<T_n_cl, T_location_cl,\n                                        T_precision_cl>* = nullptr>\ninline return_type_t<T_n_cl, T_location_cl, T_precision_cl> neg_binomial_2_lpmf(\n    const T_n_cl& n, const T_location_cl& mu, const T_precision_cl& phi) {\n  static const char* function = \"neg_binomial_2_lpmf(OpenCL)\";\n  using T_partials_return\n      = partials_return_t<T_n_cl, T_location_cl, T_precision_cl>;\n  using std::isfinite;\n  using std::isnan;\n\n  check_consistent_sizes(function, \"Failures variable\", n, \"Location parameter\",\n                         mu, \"Precision parameter\", phi);\n  const size_t N = max_size(n, mu, phi);\n  if (N == 0) {\n    return 0.0;\n  }\n  if (!include_summand<propto, T_n_cl, T_location_cl, T_precision_cl>::value) {\n    return 0.0;\n  }\n\n  const auto& mu_val = value_of(mu);\n  const auto& phi_val = value_of(phi);\n\n  auto check_n_nonnegative\n      = check_cl(function, \"Failures variable\", n, \"nonnegative\");\n  auto n_nonnegative = n >= 0;\n  auto check_mu_positive_finite\n      = check_cl(function, \"Log location parameter\", mu_val, \"positive finite\");\n  auto mu_positive_finite = 0 < mu_val && isfinite(mu_val);\n  auto check_phi_positive_finite\n      = check_cl(function, \"Precision parameter\", phi_val, \"positive finite\");\n  auto phi_positive_finite = 0 < phi_val && isfinite(phi_val);\n\n  auto log_phi = log(phi_val);\n  auto mu_plus_phi = mu_val + phi_val;\n  auto log_mu_plus_phi = log(mu_plus_phi);\n  auto n_plus_phi = n + phi_val;\n\n  auto logp1 = -elt_multiply(phi_val, log1p(elt_divide(mu_val, phi_val)))\n               - elt_multiply(n, log_mu_plus_phi);\n  auto logp2 = static_select<include_summand<propto, T_precision_cl>::value>(\n      logp1 + binomial_coefficient_log(n_plus_phi - 1, n), logp1);\n  auto logp_expr = colwise_sum(\n      static_select<include_summand<propto, T_location_cl>::value>(\n          logp2 + multiply_log(n, mu_val), logp2));\n\n  auto mu_deriv = elt_divide(n, mu_val) - elt_divide(n + phi_val, mu_plus_phi);\n  auto log_term\n      = select(mu_val < phi_val, log1p(-elt_divide(mu_val, mu_plus_phi)),\n               log_phi - log_mu_plus_phi);\n  auto phi_deriv = elt_divide(mu_val - n, mu_plus_phi) + log_term\n                   - digamma(phi_val) + digamma(n_plus_phi);\n\n  matrix_cl<double> logp_cl;\n  matrix_cl<double> mu_deriv_cl;\n  matrix_cl<double> phi_deriv_cl;\n\n  results(check_n_nonnegative, check_mu_positive_finite,\n          check_phi_positive_finite, logp_cl, mu_deriv_cl, phi_deriv_cl)\n      = expressions(n_nonnegative, mu_positive_finite, phi_positive_finite,\n                    logp_expr,\n                    calc_if<!is_constant<T_location_cl>::value>(mu_deriv),\n                    calc_if<!is_constant<T_precision_cl>::value>(phi_deriv));\n\n  T_partials_return logp = sum(from_matrix_cl(logp_cl));\n\n  operands_and_partials<T_location_cl, T_precision_cl> ops_partials(mu, phi);\n\n  if (!is_constant<T_location_cl>::value) {\n    ops_partials.edge1_.partials_ = std::move(mu_deriv_cl);\n  }\n  if (!is_constant<T_precision_cl>::value) {\n    ops_partials.edge2_.partials_ = std::move(phi_deriv_cl);\n  }\n  return ops_partials.build(logp);\n}\n\n}  \/\/ namespace math\n}  \/\/ namespace stan\n#endif\n#endif\n<commit_msg>fix for neg_binomial_2<commit_after>#ifndef STAN_MATH_OPENCL_PRIM_NEG_BINOMIAL_2_LPMF_HPP\n#define STAN_MATH_OPENCL_PRIM_NEG_BINOMIAL_2_LPMF_HPP\n#ifdef STAN_OPENCL\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\/elt_divide.hpp>\n#include <stan\/math\/prim\/fun\/elt_multiply.hpp>\n#include <stan\/math\/prim\/fun\/exp.hpp>\n#include <stan\/math\/opencl\/kernel_generator.hpp>\n#include <stan\/math\/prim\/functor\/operands_and_partials.hpp>\n#include <stan\/math\/prim\/fun\/multiply_log.hpp>\n\nnamespace stan {\nnamespace math {\n\n\/** \\ingroup opencl\n * The log of the negative binomial density for the specified scalars given\n * the specified mean(s) and deviation(s). n, mu, or phi can\n * each be either a scalar or a vector matrix_cl. Any vector inputs\n * 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_n_cl type of scalar\n * @tparam T_location_cl type of location parameter\n * @tparam T_precision_cl type of precision parameter\n * @param n (Sequence of) scalar(s).\n * @param mu (Sequence of) location parameter(s)\n * @param phi (Sequence of) precision parameters\n * @return The log of the product of the densities.\n * @throw std::domain_error if the scale is not positive.\n *\/\ntemplate <bool propto, typename T_n_cl, typename T_location_cl,\n          typename T_precision_cl,\n          require_all_prim_or_rev_kernel_expression_t<\n              T_n_cl, T_location_cl, T_precision_cl>* = nullptr,\n          require_any_not_stan_scalar_t<T_n_cl, T_location_cl,\n                                        T_precision_cl>* = nullptr>\ninline return_type_t<T_n_cl, T_location_cl, T_precision_cl> neg_binomial_2_lpmf(\n    const T_n_cl& n, const T_location_cl& mu, const T_precision_cl& phi) {\n  static const char* function = \"neg_binomial_2_lpmf(OpenCL)\";\n  using T_partials_return\n      = partials_return_t<T_n_cl, T_location_cl, T_precision_cl>;\n  using std::isfinite;\n  using std::isnan;\n\n  check_consistent_sizes(function, \"Failures variable\", n, \"Location parameter\",\n                         mu, \"Precision parameter\", phi);\n  const size_t N = max_size(n, mu, phi);\n  if (N == 0) {\n    return 0.0;\n  }\n  if (!include_summand<propto, T_n_cl, T_location_cl, T_precision_cl>::value) {\n    return 0.0;\n  }\n\n  const auto& mu_val = value_of(mu);\n  const auto& phi_val = value_of(phi);\n\n  auto check_n_nonnegative\n      = check_cl(function, \"Failures variable\", n, \"nonnegative\");\n  auto n_nonnegative = n >= 0;\n  auto check_mu_positive_finite\n      = check_cl(function, \"Log location parameter\", mu_val, \"positive finite\");\n  auto mu_positive_finite = 0 < mu_val && isfinite(mu_val);\n  auto check_phi_positive_finite\n      = check_cl(function, \"Precision parameter\", phi_val, \"positive finite\");\n  auto phi_positive_finite = 0 < phi_val && isfinite(phi_val);\n\n  auto log_phi = log(phi_val);\n  auto mu_plus_phi = mu_val + phi_val;\n  auto log_mu_plus_phi = log(mu_plus_phi);\n  auto n_plus_phi = n + phi_val;\n\n  auto logp1 = -elt_multiply(phi_val, log1p(elt_divide(mu_val, phi_val)))\n               - elt_multiply(n, log_mu_plus_phi);\n  auto logp2 = static_select<include_summand<propto, T_precision_cl>::value>(\n      logp1 + binomial_coefficient_log(n_plus_phi - 1, n), logp1);\n  auto logp_expr = colwise_sum(\n      static_select<include_summand<propto, T_location_cl>::value>(\n          logp2 + multiply_log(n, mu_val), logp2));\n\n  auto mu_deriv = elt_divide(n, mu_val) - elt_divide(n + phi_val, mu_plus_phi);\n  auto log_term\n      = select(mu_val < phi_val, log1p(-elt_divide(mu_val, mu_plus_phi)),\n               log_phi - log_mu_plus_phi);\n  auto phi_deriv = elt_divide(mu_val - n, mu_plus_phi) + log_term\n                   - digamma(phi_val) + digamma(n_plus_phi);\n\n  matrix_cl<double> logp_cl;\n  matrix_cl<double> mu_deriv_cl;\n  matrix_cl<double> phi_deriv_cl;\n\n  results(check_n_nonnegative, check_mu_positive_finite,\n          check_phi_positive_finite, logp_cl, mu_deriv_cl, phi_deriv_cl)\n      = expressions(n_nonnegative, mu_positive_finite, phi_positive_finite,\n                    logp_expr,\n                    calc_if<!is_constant<T_location_cl>::value>(mu_deriv),\n                    calc_if<!is_constant<T_precision_cl>::value>(phi_deriv));\n\n  T_partials_return logp = sum(from_matrix_cl(logp_cl));\n\n  operands_and_partials<T_location_cl, T_precision_cl> ops_partials(mu, phi);\n\n  if (!is_constant<T_location_cl>::value) {\n    ops_partials.edge1_.partials_ = std::move(mu_deriv_cl);\n  }\n  if (!is_constant<T_precision_cl>::value) {\n    ops_partials.edge2_.partials_ = std::move(phi_deriv_cl);\n  }\n  return ops_partials.build(logp);\n}\n\n}  \/\/ namespace math\n}  \/\/ namespace stan\n#endif\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/ ======================================================================== \/\/\n\/\/ Copyright 2016-2018 Intel Corporation                                    \/\/\n\/\/                                                                          \/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");          \/\/\n\/\/ you may not use this file except in compliance with the License.         \/\/\n\/\/ You may obtain a copy of the License at                                  \/\/\n\/\/                                                                          \/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0                           \/\/\n\/\/                                                                          \/\/\n\/\/ Unless required by applicable law or agreed to in writing, software      \/\/\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,        \/\/\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. \/\/\n\/\/ See the License for the specific language governing permissions and      \/\/\n\/\/ limitations under the License.                                           \/\/\n\/\/ ======================================================================== \/\/\n\n#include \"pico_bench\/pico_bench.h\"\n#include \"ospapp\/OSPApp.h\"\n#include \"common\/sg\/SceneGraph.h\"\n#include \"ospcommon\/utility\/SaveImage.h\"\n\n#include \"sg\/Renderer.h\"\n#include \"sg\/common\/FrameBuffer.h\"\n\nnamespace ospray {\n  namespace app {\n\n    struct OSPBenchmark : public OSPApp\n    {\n      OSPBenchmark();\n\n    private:\n\n      void render(const std::shared_ptr<sg::Frame> &) override;\n      int parseCommandLine(int &ac, const char **&av) override;\n\n      template <typename T>\n      void outputStats(const T &stats);\n      size_t numWarmupFrames = 10;\n      size_t numBenchFrames = 100;\n      std::string imageOutputFile = \"\";\n    };\n\n    OSPBenchmark::OSPBenchmark()\n    {\n      addPlane = false; \/\/ NOTE(jda) - override default behavior, can still\n                        \/\/             force on\/off via standard command-line\n                        \/\/             options\n    }\n\n    void OSPBenchmark::render(const std::shared_ptr<sg::Frame> &root)\n    {\n      for (size_t i = 0; i < numWarmupFrames; ++i)\n        root->renderFrame();\n\n      auto benchmarker =\n          pico_bench::Benchmarker<std::chrono::milliseconds>{ numBenchFrames };\n\n      auto stats = benchmarker([&]() {\n        root->renderFrame();\n        \/\/ TODO: measure just ospRenderFrame() time from within ospray_sg\n        \/\/ return std::chrono::milliseconds{500};\n      });\n\n      if (!imageOutputFile.empty()) {\n        auto fb = root->child(\"frameBuffer\").nodeAs<sg::FrameBuffer>();\n        auto *srcPB = (const uint32_t *)fb->map();\n        utility::writePPM(imageOutputFile + \".ppm\", width, height, srcPB);\n        fb->unmap(srcPB);\n      }\n\n      outputStats(stats);\n    }\n\n    int OSPBenchmark::parseCommandLine(int &ac, const char **&av)\n    {\n      for (int i = 1; i < ac; i++) {\n        const std::string arg = av[i];\n        if (arg == \"-i\" || arg == \"--image\") {\n          imageOutputFile = av[i + 1];\n          removeArgs(ac, av, i, 2);\n          --i;\n        } else if (arg == \"-wf\" || arg == \"--warmup\") {\n          numWarmupFrames = atoi(av[i + 1]);\n          removeArgs(ac, av, i, 2);\n          --i;\n        } else if (arg == \"-bf\" || arg == \"--bench\") {\n          numBenchFrames = atoi(av[i + 1]);\n          removeArgs(ac, av, i, 2);\n          --i;\n        }\n      }\n      return 0;\n    }\n\n    \/\/ NOTE(jda) - Issues with template type deduction w\/ GCC 7.1 and Clang 4.0,\n    \/\/             thus defining the use of operator<<() from pico_bench here\n    \/\/             before OSPCommon.h (offending file) gets eventually included\n    \/\/             through ospray_sg headers. [blech]\n    template <typename T>\n    void OSPBenchmark::outputStats(const T &stats)\n    {\n      std::cout << stats << std::endl;\n    }\n\n  } \/\/ ::ospray::app\n} \/\/ ::ospray\n\nint main(int ac, const char **av)\n{\n  ospray::app::OSPBenchmark ospApp;\n  return ospApp.main(ac, av);\n}\n<commit_msg>allow 0 bench frames in ospBenchmark to permit testing only load times<commit_after>\/\/ ======================================================================== \/\/\n\/\/ Copyright 2016-2018 Intel Corporation                                    \/\/\n\/\/                                                                          \/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");          \/\/\n\/\/ you may not use this file except in compliance with the License.         \/\/\n\/\/ You may obtain a copy of the License at                                  \/\/\n\/\/                                                                          \/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0                           \/\/\n\/\/                                                                          \/\/\n\/\/ Unless required by applicable law or agreed to in writing, software      \/\/\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,        \/\/\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. \/\/\n\/\/ See the License for the specific language governing permissions and      \/\/\n\/\/ limitations under the License.                                           \/\/\n\/\/ ======================================================================== \/\/\n\n#include \"pico_bench\/pico_bench.h\"\n#include \"ospapp\/OSPApp.h\"\n#include \"common\/sg\/SceneGraph.h\"\n#include \"ospcommon\/utility\/SaveImage.h\"\n\n#include \"sg\/Renderer.h\"\n#include \"sg\/common\/FrameBuffer.h\"\n\nnamespace ospray {\n  namespace app {\n\n    struct OSPBenchmark : public OSPApp\n    {\n      OSPBenchmark();\n\n    private:\n\n      void render(const std::shared_ptr<sg::Frame> &) override;\n      int parseCommandLine(int &ac, const char **&av) override;\n\n      template <typename T>\n      void outputStats(const T &stats);\n      size_t numWarmupFrames = 10;\n      size_t numBenchFrames = 100;\n      std::string imageOutputFile = \"\";\n    };\n\n    OSPBenchmark::OSPBenchmark()\n    {\n      addPlane = false; \/\/ NOTE(jda) - override default behavior, can still\n                        \/\/             force on\/off via standard command-line\n                        \/\/             options\n    }\n\n    void OSPBenchmark::render(const std::shared_ptr<sg::Frame> &root)\n    {\n      for (size_t i = 0; i < numWarmupFrames; ++i)\n        root->renderFrame();\n\n      \/\/ NOTE(jda) - allow 0 bench frames to enable testing only data load times\n      if (numBenchFrames <= 0)\n        return;\n\n      auto benchmarker =\n          pico_bench::Benchmarker<std::chrono::milliseconds>{ numBenchFrames };\n\n      auto stats = benchmarker([&]() {\n        root->renderFrame();\n        \/\/ TODO: measure just ospRenderFrame() time from within ospray_sg\n        \/\/ return std::chrono::milliseconds{500};\n      });\n\n      if (!imageOutputFile.empty()) {\n        auto fb = root->child(\"frameBuffer\").nodeAs<sg::FrameBuffer>();\n        auto *srcPB = (const uint32_t *)fb->map();\n        utility::writePPM(imageOutputFile + \".ppm\", width, height, srcPB);\n        fb->unmap(srcPB);\n      }\n\n      outputStats(stats);\n    }\n\n    int OSPBenchmark::parseCommandLine(int &ac, const char **&av)\n    {\n      for (int i = 1; i < ac; i++) {\n        const std::string arg = av[i];\n        if (arg == \"-i\" || arg == \"--image\") {\n          imageOutputFile = av[i + 1];\n          removeArgs(ac, av, i, 2);\n          --i;\n        } else if (arg == \"-wf\" || arg == \"--warmup\") {\n          numWarmupFrames = atoi(av[i + 1]);\n          removeArgs(ac, av, i, 2);\n          --i;\n        } else if (arg == \"-bf\" || arg == \"--bench\") {\n          numBenchFrames = atoi(av[i + 1]);\n          removeArgs(ac, av, i, 2);\n          --i;\n        }\n      }\n      return 0;\n    }\n\n    \/\/ NOTE(jda) - Issues with template type deduction w\/ GCC 7.1 and Clang 4.0,\n    \/\/             thus defining the use of operator<<() from pico_bench here\n    \/\/             before OSPCommon.h (offending file) gets eventually included\n    \/\/             through ospray_sg headers. [blech]\n    template <typename T>\n    void OSPBenchmark::outputStats(const T &stats)\n    {\n      std::cout << stats << std::endl;\n    }\n\n  } \/\/ ::ospray::app\n} \/\/ ::ospray\n\nint main(int ac, const char **av)\n{\n  ospray::app::OSPBenchmark ospApp;\n  return ospApp.main(ac, av);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Author: Henrik Tydesjo                                           \/\/\n\/\/ This class implements the use of a map of integers.              \/\/\n\/\/ The values are kept in a binary tree, which is automatically     \/\/\n\/\/ reordered to be more balanced when the tree height gets too large\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/  \n\n#include \"AliITSIntMap.h\"\n#include \"AliITSIntMapNode.h\"\n#include <TMath.h>\n#include <TError.h>\n\nAliITSIntMap::AliITSIntMap():\n  fNrEntries(0),\n  fRoot(NULL),\n  fFastAccess(kFALSE),\n  fFastAccessSerialize(kFALSE),\n  fFastAccessArray(NULL),\n  fDummyIndex(0)\n{}\n\nAliITSIntMap::AliITSIntMap(AliITSIntMapNode* root, UInt_t nrEntries):\n  fNrEntries(nrEntries),\n  fRoot(root),\n  fFastAccess(kFALSE),\n  fFastAccessSerialize(kFALSE),\n  fFastAccessArray(NULL),\n  fDummyIndex(0)\n{}\n\nAliITSIntMap::AliITSIntMap(const AliITSIntMap& imap):\n  fNrEntries(0),\n  fRoot(NULL),\n  fFastAccess(kFALSE),\n  fFastAccessSerialize(kFALSE),\n  fFastAccessArray(NULL),\n  fDummyIndex(0)\n{\n  \/\/ copy constructor\n  *this = imap;\n}\n\nAliITSIntMap::~AliITSIntMap() {\n  Clear();\n}\n\nAliITSIntMap& AliITSIntMap::operator=(const AliITSIntMap& imap) {\n  \/\/ assignment operator\n  if (this!=&imap) {\n    this->Clear();\n    fRoot = CloneNode(imap.fRoot);\n    fFastAccess=kFALSE;\n    fFastAccessSerialize=kFALSE;\n    fFastAccessArray=NULL;\n    fDummyIndex=0;\n  }\n  return *this;\n}\n\nvoid AliITSIntMap::Clear() {\n  \/\/ clear the whole map\n  ClearFastAccess();\n  ClearNode(fRoot);\n}\n\nvoid AliITSIntMap::ClearNode(AliITSIntMapNode* &node) {\n  \/\/ clear this node and all children nodes\n  if (node==NULL) return;\n  ClearNode(node->Left());\n  ClearNode(node->Right());\n  delete node;\n  fNrEntries--;\n  node = NULL;\n  fFastAccess=kFALSE;\n  fFastAccessSerialize=kFALSE;\n}\n\nAliITSIntMap* AliITSIntMap::Clone() const {\n  \/\/ returns a clone of the map\n  AliITSIntMapNode* newRoot;\n  newRoot = CloneNode(fRoot);\n  AliITSIntMap* newMap = new AliITSIntMap(newRoot,fNrEntries);\n  return newMap;\n}\n\nAliITSIntMapNode* AliITSIntMap::CloneNode(AliITSIntMapNode* node) const {\n  if (node==NULL) return NULL;\n  else return new AliITSIntMapNode(node->Key(),node->Val(),CloneNode(node->Left()),CloneNode(node->Right()));\n}\n\nBool_t AliITSIntMap::Insert(Int_t key, Int_t val) {\n  \/\/ insert a new node into the map (returns true if the node was not present before)\n  UInt_t entriesBefore = fNrEntries;\n  InsertNode(key,val,fRoot,0);\n  if (fNrEntries>entriesBefore) return kTRUE;\n  else return kFALSE;\n}\n\nvoid AliITSIntMap::InsertNode(Int_t key, Int_t val, AliITSIntMapNode* &node, UInt_t height) {\n  \/\/ method to insert a node in the tree (used recursively)\n  height++;\n  if (node==NULL) {\n    node = new AliITSIntMapNode(key,val,NULL,NULL);\n    fNrEntries++;\n    fFastAccess=kFALSE;\n    fFastAccessSerialize=kFALSE;\n    UInt_t balanceHeight = (UInt_t) (log(fNrEntries+1)\/log(2)+1);\n    if ( (height-balanceHeight)*(height-balanceHeight) > fNrEntries ) {\n      Balance();\n    }\n  }\n  else if (key < node->Key()) {\n    InsertNode(key,val,node->Left(),height);\n  }\n  else if (key > node->Key()) {\n    InsertNode(key,val,node->Right(),height);\n  }\n  else { \/\/ (key==node->Key()): do nothing (avoid duplicates)\n    \/\/    Warning(\"AliITSIntMap::InsertNode\",\"Node with key %d already in map. Not inserted.\",key);\n  }\n}\n\nBool_t AliITSIntMap::Remove(Int_t key) {\n  \/\/ remove a node from the map (returns true if the node was found)\n  UInt_t entriesBefore = fNrEntries;\n  RemoveNode(key,fRoot);\n  if (fNrEntries<entriesBefore) return kTRUE;\n  else return kFALSE;\n}\n\nvoid AliITSIntMap::RemoveNode(Int_t key, AliITSIntMapNode* &node) {\n  \/\/ method to remove a node in the tree (used recursively)\n  if (node == NULL) return;   \/\/ node not found; do nothing\n  if (key < node->Key()) {\n    RemoveNode(key,node->Left());\n  }\n  else if (key > node->Key()) {\n    RemoveNode(key,node->Right());\n  }\n  else if (node->Left()!=NULL && node->Right()!=NULL) { \/\/ Two children\n    if (fNrEntries%2==0) { \/\/ for better balance, remove from left or right sub tree\n      AliITSIntMapNode* moveNode = FindMinNode(node->Right());\n      node->SetKey(moveNode->Key());\n      node->SetVal(moveNode->Val());\n      RemoveNode(moveNode->Key(),node->Right());\n    }\n    else {\n      AliITSIntMapNode* moveNode = FindMaxNode(node->Left());\n      node->SetKey(moveNode->Key());\n      node->SetVal(moveNode->Val());\n      RemoveNode(moveNode->Key(),node->Left());\n    }\n  }\n  else {\n    AliITSIntMapNode* oldNode = node;\n    node = (node->Left()!=NULL) ? node->Left() : node->Right();\n    fNrEntries--;\n    delete oldNode;\n    fFastAccess=kFALSE;\n    fFastAccessSerialize=kFALSE;\n  }\n}\n\nBool_t AliITSIntMap::Pop(Int_t& key, Int_t& val) {\n  \/\/ removes one entry (root) from tree, giving its key,val pair\n  if (fRoot!=NULL) {\n    key = fRoot->Key();\n    val = fRoot->Val();\n    return Remove(key);\n  }\n  else return kFALSE;\n}\n\nAliITSIntMapNode* AliITSIntMap::FindMinNode(AliITSIntMapNode* node) const {\n  \/\/ returns the node with smallest key in the sub tree starting from node\n  if (node==NULL) return NULL;\n  else if (node->Left()==NULL) return node;\n  else return FindMinNode(node->Left());\n}\n\nAliITSIntMapNode* AliITSIntMap::FindMaxNode(AliITSIntMapNode* node) const {\n  \/\/ returns the node with largest key in the sub tree starting from node\n  if (node==NULL) return NULL;\n  else if (node->Right()==NULL) return node;\n  else return FindMaxNode(node->Right());\n}\n\nAliITSIntMapNode* AliITSIntMap::Find(Int_t key) const {\n  \/\/ finds a node and returns it (returns NULL if not found)\n  return FindNode(key,fRoot,0);\n}\n\nAliITSIntMapNode*  AliITSIntMap::FindNode(Int_t key, AliITSIntMapNode* node, UInt_t height) const {\n  \/\/ method to find a node in the tree (used recursively)\n  if (node==NULL) return NULL;\n  height++;\n  if (key<node->Key()) return FindNode(key,node->Left(),height);\n  else if (key>node->Key()) return FindNode(key,node->Right(),height);\n  else { \/\/ Match\n\/\/    \/\/*** balance if height too high. const above have to be removed if this is needed ***\n\/\/    UInt_t balanceHeight = (UInt_t) (log(fNrEntries+1)\/log(2)+1);\n\/\/    if ( (height-balanceHeight)*(height-balanceHeight) > fNrEntries ) {\n\/\/      Balance();\n\/\/    }\n    return node;\n  }\n}\n\nInt_t AliITSIntMap::GetVal(Int_t key) const {\n  \/\/ returns the value for the node with key\n  AliITSIntMapNode* node = Find(key);\n  if (node!=NULL) {\n    return node->Val();\n  }\n  else {\n    Warning(\"AliITSIntMap::GetVal\",\"Node with key %d not found in map. Returning -999.\",key);\n    return -999;\n  }\n}\n\nvoid AliITSIntMap::Balance() {\n  \/\/ method to balance the tree\n  \/\/  printf(\"balance H=%d --> \",GetTreeHeight());\n  if (fNrEntries==0) return;\n  if (!fFastAccess) InitFastAccess();\n  fRoot = BalanceNode(0,fNrEntries-1);\n  \/\/  printf(\"H=%d\\n\",GetTreeHeight());\n}\n\nAliITSIntMapNode* AliITSIntMap::BalanceNode(Int_t lowInd, Int_t highInd) {\n  \/\/ balances the tree by selecting the center of an index range \n  \/\/ (used recursively)\n  if (lowInd>highInd) return NULL;\n  Int_t thisInd = lowInd+(highInd-lowInd)\/2;\n  fFastAccessArray[thisInd]->Left() = BalanceNode(lowInd,thisInd-1);\n  fFastAccessArray[thisInd]->Right() = BalanceNode(thisInd+1,highInd);\n  return fFastAccessArray[thisInd];\n}\n\nvoid AliITSIntMap::ClearFastAccess(){\n  \/\/ clears the fast access array of pointers\n  if (fFastAccessArray!=NULL) {\n    delete [] fFastAccessArray;\n    fFastAccessArray=NULL;\n  }\n  fFastAccess=kFALSE;\n  fFastAccessSerialize=kFALSE;\n}\n\nvoid AliITSIntMap::InitFastAccess(){\n  \/\/ initializes the fast access array\n  if (fFastAccess) return;\n  ClearFastAccess();\n  if (fNrEntries>0) {\n    fFastAccessArray = new AliITSIntMapNode*[fNrEntries];\n    fDummyIndex=0;\n    InitFastAccessNode(fRoot);\n    fFastAccess=kTRUE;\n  }\n}\n\nvoid AliITSIntMap::InitFastAccessNode(AliITSIntMapNode* node) {\n  \/\/ initializes the fast access array starting from node (used recursively)\n  if (node==NULL) return;\n  InitFastAccessNode(node->Left());\n  fFastAccessArray[fDummyIndex++] = node;\n  InitFastAccessNode(node->Right());\n}\n\nvoid AliITSIntMap::InitFastAccessSerialize(){\n  \/\/ initializes the fast access array\n  if (fFastAccessSerialize) return;\n  ClearFastAccess();\n  if (fNrEntries>0) {\n    fFastAccessArray = new AliITSIntMapNode*[fNrEntries];\n    fDummyIndex=0;\n    InitFastAccessSerializeNode(fRoot);\n    fFastAccessSerialize=kTRUE;\n  }\n}\n\nvoid AliITSIntMap::InitFastAccessSerializeNode(AliITSIntMapNode* node) {\n  \/\/ initializes the fast access array for tree ordering starting from node (used recursively)\n  if (node==NULL) return;\n  fFastAccessArray[fDummyIndex++] = node;\n  InitFastAccessSerializeNode(node->Left());\n  InitFastAccessSerializeNode(node->Right());\n}\n\nInt_t AliITSIntMap::GetKeyIndex(UInt_t index) {\n  \/\/ returns the key of the node at position 'index' in the map\n  \/\/ returns -1 if out of bounds\n  if (index<fNrEntries) {\n    if (!fFastAccess && !fFastAccessSerialize) InitFastAccess();\n    return fFastAccessArray[index]->Key();\n  }\n  return -1;\n}\n\nInt_t AliITSIntMap::GetValIndex(UInt_t index) {\n  \/\/ returns the value of the node at position 'index' in the map\n  \/\/ returns -1 if out of bounds\n  if (index<fNrEntries) {\n    if (!fFastAccess && !fFastAccessSerialize) InitFastAccess();\n    return fFastAccessArray[index]->Val();\n  }\n  return -1;\n}\n\nAliITSIntMapNode* AliITSIntMap::FindNodeIndex(UInt_t index, AliITSIntMapNode* node) const {\n  \/\/ method to find the index:th node in the tree (used recursively)\n  \/\/ this method should not be needed anymore, since GetKeyIndex\/GetValIndex is faster\n  static UInt_t fTmpInd;\n  if (node==fRoot) fTmpInd=0;\n  if (node->Left()!=NULL) {\n    AliITSIntMapNode* tmpResult = FindNodeIndex(index,node->Left());\n    if (tmpResult != NULL) {\n      return tmpResult;\n    }\n  }\n  if (fTmpInd==index) return node;\n  fTmpInd++;\n  if (node->Right()!=NULL) {\n    AliITSIntMapNode* tmpResult = FindNodeIndex(index,node->Right());\n    if (tmpResult != NULL) {\n      return tmpResult;\n    }\n  }\n  return NULL;\n}\n\nvoid AliITSIntMap::PrintEntries() const {\n  \/\/ prints all the entries (key,value pairs) of the map\n  printf(\"*** Map Entries: (key , value)***\\n\");\n  PrintNode(fRoot);\n  printf(\"*********************************\\n\");\n}\n\nvoid AliITSIntMap::PrintNode(AliITSIntMapNode* node) const {\n  \/\/ method to print node entry (key,value) (used recursively)\n  if (node==NULL) return;\n  if (node->Left()!=NULL) PrintNode(node->Left());\n  printf(\"%d , %d\\n\",node->Key(),node->Val());\n  if (node->Right()!=NULL) PrintNode(node->Right());\n}\n\nUInt_t AliITSIntMap::GetTreeHeight() const {\n  \/\/ returns the height of the tree\n  return GetTreeHeightNode(fRoot);\n}\n\nUInt_t AliITSIntMap::GetTreeHeightNode(AliITSIntMapNode* node) const {\n  \/\/ returns tree height for the sub tree starting from node (used recursively)\n  if (node==NULL) return 0;\n  UInt_t leftH = GetTreeHeightNode(node->Left());\n  UInt_t rightH = GetTreeHeightNode(node->Right());\n  if (leftH>=rightH) return leftH+1;\n  else               return rightH+1;\n}\n<commit_msg>Using TMath::Log instead of log<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Author: Henrik Tydesjo                                           \/\/\n\/\/ This class implements the use of a map of integers.              \/\/\n\/\/ The values are kept in a binary tree, which is automatically     \/\/\n\/\/ reordered to be more balanced when the tree height gets too large\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/  \n\n#include \"AliITSIntMap.h\"\n#include \"AliITSIntMapNode.h\"\n#include <TMath.h>\n#include <TError.h>\n\nAliITSIntMap::AliITSIntMap():\n  fNrEntries(0),\n  fRoot(NULL),\n  fFastAccess(kFALSE),\n  fFastAccessSerialize(kFALSE),\n  fFastAccessArray(NULL),\n  fDummyIndex(0)\n{}\n\nAliITSIntMap::AliITSIntMap(AliITSIntMapNode* root, UInt_t nrEntries):\n  fNrEntries(nrEntries),\n  fRoot(root),\n  fFastAccess(kFALSE),\n  fFastAccessSerialize(kFALSE),\n  fFastAccessArray(NULL),\n  fDummyIndex(0)\n{}\n\nAliITSIntMap::AliITSIntMap(const AliITSIntMap& imap):\n  fNrEntries(0),\n  fRoot(NULL),\n  fFastAccess(kFALSE),\n  fFastAccessSerialize(kFALSE),\n  fFastAccessArray(NULL),\n  fDummyIndex(0)\n{\n  \/\/ copy constructor\n  *this = imap;\n}\n\nAliITSIntMap::~AliITSIntMap() {\n  Clear();\n}\n\nAliITSIntMap& AliITSIntMap::operator=(const AliITSIntMap& imap) {\n  \/\/ assignment operator\n  if (this!=&imap) {\n    this->Clear();\n    fRoot = CloneNode(imap.fRoot);\n    fFastAccess=kFALSE;\n    fFastAccessSerialize=kFALSE;\n    fFastAccessArray=NULL;\n    fDummyIndex=0;\n  }\n  return *this;\n}\n\nvoid AliITSIntMap::Clear() {\n  \/\/ clear the whole map\n  ClearFastAccess();\n  ClearNode(fRoot);\n}\n\nvoid AliITSIntMap::ClearNode(AliITSIntMapNode* &node) {\n  \/\/ clear this node and all children nodes\n  if (node==NULL) return;\n  ClearNode(node->Left());\n  ClearNode(node->Right());\n  delete node;\n  fNrEntries--;\n  node = NULL;\n  fFastAccess=kFALSE;\n  fFastAccessSerialize=kFALSE;\n}\n\nAliITSIntMap* AliITSIntMap::Clone() const {\n  \/\/ returns a clone of the map\n  AliITSIntMapNode* newRoot;\n  newRoot = CloneNode(fRoot);\n  AliITSIntMap* newMap = new AliITSIntMap(newRoot,fNrEntries);\n  return newMap;\n}\n\nAliITSIntMapNode* AliITSIntMap::CloneNode(AliITSIntMapNode* node) const {\n  if (node==NULL) return NULL;\n  else return new AliITSIntMapNode(node->Key(),node->Val(),CloneNode(node->Left()),CloneNode(node->Right()));\n}\n\nBool_t AliITSIntMap::Insert(Int_t key, Int_t val) {\n  \/\/ insert a new node into the map (returns true if the node was not present before)\n  UInt_t entriesBefore = fNrEntries;\n  InsertNode(key,val,fRoot,0);\n  if (fNrEntries>entriesBefore) return kTRUE;\n  else return kFALSE;\n}\n\nvoid AliITSIntMap::InsertNode(Int_t key, Int_t val, AliITSIntMapNode* &node, UInt_t height) {\n  \/\/ method to insert a node in the tree (used recursively)\n  height++;\n  if (node==NULL) {\n    node = new AliITSIntMapNode(key,val,NULL,NULL);\n    fNrEntries++;\n    fFastAccess=kFALSE;\n    fFastAccessSerialize=kFALSE;\n    UInt_t balanceHeight = (UInt_t) (TMath::Log(fNrEntries+1)\/TMath::Log(2)+1);\n    if ( (height-balanceHeight)*(height-balanceHeight) > fNrEntries ) {\n      Balance();\n    }\n  }\n  else if (key < node->Key()) {\n    InsertNode(key,val,node->Left(),height);\n  }\n  else if (key > node->Key()) {\n    InsertNode(key,val,node->Right(),height);\n  }\n  else { \/\/ (key==node->Key()): do nothing (avoid duplicates)\n    \/\/    Warning(\"AliITSIntMap::InsertNode\",\"Node with key %d already in map. Not inserted.\",key);\n  }\n}\n\nBool_t AliITSIntMap::Remove(Int_t key) {\n  \/\/ remove a node from the map (returns true if the node was found)\n  UInt_t entriesBefore = fNrEntries;\n  RemoveNode(key,fRoot);\n  if (fNrEntries<entriesBefore) return kTRUE;\n  else return kFALSE;\n}\n\nvoid AliITSIntMap::RemoveNode(Int_t key, AliITSIntMapNode* &node) {\n  \/\/ method to remove a node in the tree (used recursively)\n  if (node == NULL) return;   \/\/ node not found; do nothing\n  if (key < node->Key()) {\n    RemoveNode(key,node->Left());\n  }\n  else if (key > node->Key()) {\n    RemoveNode(key,node->Right());\n  }\n  else if (node->Left()!=NULL && node->Right()!=NULL) { \/\/ Two children\n    if (fNrEntries%2==0) { \/\/ for better balance, remove from left or right sub tree\n      AliITSIntMapNode* moveNode = FindMinNode(node->Right());\n      node->SetKey(moveNode->Key());\n      node->SetVal(moveNode->Val());\n      RemoveNode(moveNode->Key(),node->Right());\n    }\n    else {\n      AliITSIntMapNode* moveNode = FindMaxNode(node->Left());\n      node->SetKey(moveNode->Key());\n      node->SetVal(moveNode->Val());\n      RemoveNode(moveNode->Key(),node->Left());\n    }\n  }\n  else {\n    AliITSIntMapNode* oldNode = node;\n    node = (node->Left()!=NULL) ? node->Left() : node->Right();\n    fNrEntries--;\n    delete oldNode;\n    fFastAccess=kFALSE;\n    fFastAccessSerialize=kFALSE;\n  }\n}\n\nBool_t AliITSIntMap::Pop(Int_t& key, Int_t& val) {\n  \/\/ removes one entry (root) from tree, giving its key,val pair\n  if (fRoot!=NULL) {\n    key = fRoot->Key();\n    val = fRoot->Val();\n    return Remove(key);\n  }\n  else return kFALSE;\n}\n\nAliITSIntMapNode* AliITSIntMap::FindMinNode(AliITSIntMapNode* node) const {\n  \/\/ returns the node with smallest key in the sub tree starting from node\n  if (node==NULL) return NULL;\n  else if (node->Left()==NULL) return node;\n  else return FindMinNode(node->Left());\n}\n\nAliITSIntMapNode* AliITSIntMap::FindMaxNode(AliITSIntMapNode* node) const {\n  \/\/ returns the node with largest key in the sub tree starting from node\n  if (node==NULL) return NULL;\n  else if (node->Right()==NULL) return node;\n  else return FindMaxNode(node->Right());\n}\n\nAliITSIntMapNode* AliITSIntMap::Find(Int_t key) const {\n  \/\/ finds a node and returns it (returns NULL if not found)\n  return FindNode(key,fRoot,0);\n}\n\nAliITSIntMapNode*  AliITSIntMap::FindNode(Int_t key, AliITSIntMapNode* node, UInt_t height) const {\n  \/\/ method to find a node in the tree (used recursively)\n  if (node==NULL) return NULL;\n  height++;\n  if (key<node->Key()) return FindNode(key,node->Left(),height);\n  else if (key>node->Key()) return FindNode(key,node->Right(),height);\n  else { \/\/ Match\n\/\/    \/\/*** balance if height too high. const above have to be removed if this is needed ***\n\/\/    UInt_t balanceHeight = (UInt_t) (TMath::Log(fNrEntries+1)\/TMath::Log(2)+1);\n\/\/    if ( (height-balanceHeight)*(height-balanceHeight) > fNrEntries ) {\n\/\/      Balance();\n\/\/    }\n    return node;\n  }\n}\n\nInt_t AliITSIntMap::GetVal(Int_t key) const {\n  \/\/ returns the value for the node with key\n  AliITSIntMapNode* node = Find(key);\n  if (node!=NULL) {\n    return node->Val();\n  }\n  else {\n    Warning(\"AliITSIntMap::GetVal\",\"Node with key %d not found in map. Returning -999.\",key);\n    return -999;\n  }\n}\n\nvoid AliITSIntMap::Balance() {\n  \/\/ method to balance the tree\n  \/\/  printf(\"balance H=%d --> \",GetTreeHeight());\n  if (fNrEntries==0) return;\n  if (!fFastAccess) InitFastAccess();\n  fRoot = BalanceNode(0,fNrEntries-1);\n  \/\/  printf(\"H=%d\\n\",GetTreeHeight());\n}\n\nAliITSIntMapNode* AliITSIntMap::BalanceNode(Int_t lowInd, Int_t highInd) {\n  \/\/ balances the tree by selecting the center of an index range \n  \/\/ (used recursively)\n  if (lowInd>highInd) return NULL;\n  Int_t thisInd = lowInd+(highInd-lowInd)\/2;\n  fFastAccessArray[thisInd]->Left() = BalanceNode(lowInd,thisInd-1);\n  fFastAccessArray[thisInd]->Right() = BalanceNode(thisInd+1,highInd);\n  return fFastAccessArray[thisInd];\n}\n\nvoid AliITSIntMap::ClearFastAccess(){\n  \/\/ clears the fast access array of pointers\n  if (fFastAccessArray!=NULL) {\n    delete [] fFastAccessArray;\n    fFastAccessArray=NULL;\n  }\n  fFastAccess=kFALSE;\n  fFastAccessSerialize=kFALSE;\n}\n\nvoid AliITSIntMap::InitFastAccess(){\n  \/\/ initializes the fast access array\n  if (fFastAccess) return;\n  ClearFastAccess();\n  if (fNrEntries>0) {\n    fFastAccessArray = new AliITSIntMapNode*[fNrEntries];\n    fDummyIndex=0;\n    InitFastAccessNode(fRoot);\n    fFastAccess=kTRUE;\n  }\n}\n\nvoid AliITSIntMap::InitFastAccessNode(AliITSIntMapNode* node) {\n  \/\/ initializes the fast access array starting from node (used recursively)\n  if (node==NULL) return;\n  InitFastAccessNode(node->Left());\n  fFastAccessArray[fDummyIndex++] = node;\n  InitFastAccessNode(node->Right());\n}\n\nvoid AliITSIntMap::InitFastAccessSerialize(){\n  \/\/ initializes the fast access array\n  if (fFastAccessSerialize) return;\n  ClearFastAccess();\n  if (fNrEntries>0) {\n    fFastAccessArray = new AliITSIntMapNode*[fNrEntries];\n    fDummyIndex=0;\n    InitFastAccessSerializeNode(fRoot);\n    fFastAccessSerialize=kTRUE;\n  }\n}\n\nvoid AliITSIntMap::InitFastAccessSerializeNode(AliITSIntMapNode* node) {\n  \/\/ initializes the fast access array for tree ordering starting from node (used recursively)\n  if (node==NULL) return;\n  fFastAccessArray[fDummyIndex++] = node;\n  InitFastAccessSerializeNode(node->Left());\n  InitFastAccessSerializeNode(node->Right());\n}\n\nInt_t AliITSIntMap::GetKeyIndex(UInt_t index) {\n  \/\/ returns the key of the node at position 'index' in the map\n  \/\/ returns -1 if out of bounds\n  if (index<fNrEntries) {\n    if (!fFastAccess && !fFastAccessSerialize) InitFastAccess();\n    return fFastAccessArray[index]->Key();\n  }\n  return -1;\n}\n\nInt_t AliITSIntMap::GetValIndex(UInt_t index) {\n  \/\/ returns the value of the node at position 'index' in the map\n  \/\/ returns -1 if out of bounds\n  if (index<fNrEntries) {\n    if (!fFastAccess && !fFastAccessSerialize) InitFastAccess();\n    return fFastAccessArray[index]->Val();\n  }\n  return -1;\n}\n\nAliITSIntMapNode* AliITSIntMap::FindNodeIndex(UInt_t index, AliITSIntMapNode* node) const {\n  \/\/ method to find the index:th node in the tree (used recursively)\n  \/\/ this method should not be needed anymore, since GetKeyIndex\/GetValIndex is faster\n  static UInt_t fTmpInd;\n  if (node==fRoot) fTmpInd=0;\n  if (node->Left()!=NULL) {\n    AliITSIntMapNode* tmpResult = FindNodeIndex(index,node->Left());\n    if (tmpResult != NULL) {\n      return tmpResult;\n    }\n  }\n  if (fTmpInd==index) return node;\n  fTmpInd++;\n  if (node->Right()!=NULL) {\n    AliITSIntMapNode* tmpResult = FindNodeIndex(index,node->Right());\n    if (tmpResult != NULL) {\n      return tmpResult;\n    }\n  }\n  return NULL;\n}\n\nvoid AliITSIntMap::PrintEntries() const {\n  \/\/ prints all the entries (key,value pairs) of the map\n  printf(\"*** Map Entries: (key , value)***\\n\");\n  PrintNode(fRoot);\n  printf(\"*********************************\\n\");\n}\n\nvoid AliITSIntMap::PrintNode(AliITSIntMapNode* node) const {\n  \/\/ method to print node entry (key,value) (used recursively)\n  if (node==NULL) return;\n  if (node->Left()!=NULL) PrintNode(node->Left());\n  printf(\"%d , %d\\n\",node->Key(),node->Val());\n  if (node->Right()!=NULL) PrintNode(node->Right());\n}\n\nUInt_t AliITSIntMap::GetTreeHeight() const {\n  \/\/ returns the height of the tree\n  return GetTreeHeightNode(fRoot);\n}\n\nUInt_t AliITSIntMap::GetTreeHeightNode(AliITSIntMapNode* node) const {\n  \/\/ returns tree height for the sub tree starting from node (used recursively)\n  if (node==NULL) return 0;\n  UInt_t leftH = GetTreeHeightNode(node->Left());\n  UInt_t rightH = GetTreeHeightNode(node->Right());\n  if (leftH>=rightH) return leftH+1;\n  else               return rightH+1;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ -*- mode:C++; tab-width:4; c-basic-offset:4; indent-tabs-mode:nil -*-\n\n#ifndef __ROBOT_DEVASTATION_HPP__\n#define __ROBOT_DEVASTATION_HPP__\n\n#include <iostream>\n#include <string>\n#include <sstream>\n\n#include <yarp\/os\/RFModule.h>\n\n#include \"RdUtils.hpp\"\n#include \"SDLAudioManager.hpp\"\n#include \"RdMentalMap.hpp\"\n#include \"RdInputManager.hpp\"\n#include \"RdSDLInputManager.hpp\"\n#include \"RdInputEventListener.hpp\"\n#include \"RdYarpNetworkManager.hpp\"\n#include \"RdRobotManager.hpp\"\n#include \"RdYarpRobotManager.hpp\"\n#include \"RdMockupRobotManager.hpp\"\n#include \"StateMachine.hpp\"\n#include \"RdImageManager.hpp\"\n#include \"RdYarpImageManager.hpp\"\n#include \"RdYarpLocalImageManager.hpp\"\n#include \"RdMockupImageManager.hpp\"\n#include \"RdProcessorImageEventListener.hpp\"\n#include \"SDLScreenManager.hpp\"\n\n\/\/-- Game FSM\n#include \"StateMachine.hpp\"\n#include \"StateMachineBuilder.hpp\"\n#include \"InitState.hpp\"\n#include \"GameState.hpp\"\n#include \"DeadState.hpp\"\n\nnamespace rd\n{\n\n\/**\n * @ingroup robotDevastation\n * @brief The parent Robot Devastation class of the \\ref robotDevastation program.\n *\/\nclass RobotDevastation : public yarp::os::RFModule\n{\n    public:\n        \/** Called on initialization. *\/\n        virtual bool configure(yarp::os::ResourceFinder &rf);\n\n    private:\n\n        template<typename T> void getInfoFromUser(const std::string& question, T& info, const bool& no_empty=false)\n        {\n\n            std::string answer;\n            do {\n                printf(\"%s?>\",question.c_str());\n                std::getline(std::cin, answer);\n            } while(no_empty && answer.empty());\n\n            if (!answer.empty())\n            {\n                std::stringstream ss(answer);\n                ss >> info;\n            }\n        }\n\n        FiniteStateMachine * gameFSM;\n\n        RdInputManager *  inputManager;\n        AudioManager * audioManager;\n        RdMentalMap * mentalMap;\n        RdNetworkManager * networkManager;\n        RdRobotManager * robotManager;\n        FiniteStateMachine * stateMachine;\n        RdImageManager * imageManager;\n        ScreenManager * screenManager;\n\n        bool interruptModule();\n        double getPeriod();\n        bool updateModule();\n\n        bool initPlayerInfo(yarp::os::ResourceFinder &rf);\n        bool initSound(yarp::os::ResourceFinder &rf);\n        bool initGameFSM();\n        bool cleanup();\n\n        \/\/-- Player data\n        int id;\n        std::string name;\n        int team;\n        std::string robotName;\n};\n\n}  \/\/ namespace rd\n\n#endif  \/\/ __ROBOT_DEVASTATION_HPP__\n\n<commit_msg>[hot-fix] remove unused FiniteStateMachine * stateMachine; using FiniteStateMachine * gameFSM;<commit_after>\/\/ -*- mode:C++; tab-width:4; c-basic-offset:4; indent-tabs-mode:nil -*-\n\n#ifndef __ROBOT_DEVASTATION_HPP__\n#define __ROBOT_DEVASTATION_HPP__\n\n#include <iostream>\n#include <string>\n#include <sstream>\n\n#include <yarp\/os\/RFModule.h>\n\n#include \"RdUtils.hpp\"\n#include \"SDLAudioManager.hpp\"\n#include \"RdMentalMap.hpp\"\n#include \"RdInputManager.hpp\"\n#include \"RdSDLInputManager.hpp\"\n#include \"RdInputEventListener.hpp\"\n#include \"RdYarpNetworkManager.hpp\"\n#include \"RdRobotManager.hpp\"\n#include \"RdYarpRobotManager.hpp\"\n#include \"RdMockupRobotManager.hpp\"\n#include \"StateMachine.hpp\"\n#include \"RdImageManager.hpp\"\n#include \"RdYarpImageManager.hpp\"\n#include \"RdYarpLocalImageManager.hpp\"\n#include \"RdMockupImageManager.hpp\"\n#include \"RdProcessorImageEventListener.hpp\"\n#include \"SDLScreenManager.hpp\"\n\n\/\/-- Game FSM\n#include \"StateMachine.hpp\"\n#include \"StateMachineBuilder.hpp\"\n#include \"InitState.hpp\"\n#include \"GameState.hpp\"\n#include \"DeadState.hpp\"\n\nnamespace rd\n{\n\n\/**\n * @ingroup robotDevastation\n * @brief The parent Robot Devastation class of the \\ref robotDevastation program.\n *\/\nclass RobotDevastation : public yarp::os::RFModule\n{\n    public:\n        \/** Called on initialization. *\/\n        virtual bool configure(yarp::os::ResourceFinder &rf);\n\n    private:\n\n        template<typename T> void getInfoFromUser(const std::string& question, T& info, const bool& no_empty=false)\n        {\n\n            std::string answer;\n            do {\n                printf(\"%s?>\",question.c_str());\n                std::getline(std::cin, answer);\n            } while(no_empty && answer.empty());\n\n            if (!answer.empty())\n            {\n                std::stringstream ss(answer);\n                ss >> info;\n            }\n        }\n\n        FiniteStateMachine * gameFSM;\n\n        RdInputManager *  inputManager;\n        AudioManager * audioManager;\n        RdMentalMap * mentalMap;\n        RdNetworkManager * networkManager;\n        RdRobotManager * robotManager;\n        RdImageManager * imageManager;\n        ScreenManager * screenManager;\n\n        bool interruptModule();\n        double getPeriod();\n        bool updateModule();\n\n        bool initPlayerInfo(yarp::os::ResourceFinder &rf);\n        bool initSound(yarp::os::ResourceFinder &rf);\n        bool initGameFSM();\n        bool cleanup();\n\n        \/\/-- Player data\n        int id;\n        std::string name;\n        int team;\n        std::string robotName;\n};\n\n}  \/\/ namespace rd\n\n#endif  \/\/ __ROBOT_DEVASTATION_HPP__\n\n<|endoftext|>"}
{"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/usr\/isteps\/istep16\/call_host_activate_master.C $          *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2015,2016                        *\/\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\/\/ Error Handling\n#include    <errl\/errlentry.H>\n#include    <errl\/errlmanager.H>\n#include    <initservice\/isteps_trace.H>\n#include    <isteps\/hwpisteperror.H>\n#include    <errl\/errludtarget.H>\n#include    <intr\/interrupt.H>\n#include    <console\/consoleif.H>\n\n\/\/  targeting support\n#include    <targeting\/namedtarget.H>\n#include    <targeting\/attrsync.H>\n#include    <fapi2\/target.H>\n\n\/\/SBE interfacing\n#include    <sbeio\/sbeioif.H>\n#include    <sys\/misc.h>\n\n\/\/Import directory (EKB)\n#include    <p9_block_wakeup_intr.H>\n#include    <p9_cpu_special_wakeup.H>\n\n\/\/HWP invoker\n#include    <fapi2\/plat_hwp_invoker.H>\n\nusing   namespace   ERRORLOG;\nusing   namespace   TARGETING;\nusing   namespace   ISTEP;\nusing   namespace   ISTEP_ERROR;\nusing   namespace   p9specialWakeup;\n\n\nnamespace ISTEP_16\n{\nvoid* call_host_activate_master (void *io_pArgs)\n{\n    IStepError  l_stepError;\n\n    TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n               \"call_host_activate_master entry\" );\n\n    errlHndl_t  l_errl  =   NULL;\n\n    do  {\n        \/\/ find the master core, i.e. the one we are running on\n        TRACDCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                   \"call_host_activate_master: Find master core: \" );\n\n        const TARGETING::Target*  l_masterCore  = getMasterCore( );\n        assert( l_masterCore != NULL );\n\n        TARGETING::Target* l_core_target = const_cast<TARGETING::Target *>\n                                          ( getParentChip( l_masterCore ) );\n\n        \/\/ Cast OUR type of target to a FAPI2 type of target.\n        const fapi2::Target<fapi2::TARGET_TYPE_CORE> l_fapi2_coreTarget(\n                                const_cast<TARGETING::Target*> (l_core_target));\n\n        TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                   \"call_host_activate_master: About to start deadman loop... \"\n                   \"Target HUID %.8X\",\n                    TARGETING::get_huid(l_fapi2_coreTarget));\n\n         \/\/In the future possibly move default \"waitTime\" value to SBEIO code\n         uint64_t waitTime = 10000;\n         l_errl = SBEIO::startDeadmanLoop(waitTime);\n\n        if ( l_errl )\n        {\n            TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n            \"startDeadmanLoop ERROR : Returning errorlog, reason=0x%x\",\n                l_errl->reasonCode() );\n\n            \/\/ capture the target data in the elog\n            ErrlUserDetailsTarget(l_core_target).addToLog( l_errl );\n\n            break;\n        }\n        else\n        {\n            TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                       \"startDeadManLoop SUCCESS\"  );\n        }\n        \/\/Need to indicate to PHYP to save HRMOR and other SPR Data to be\n        \/\/ applied during wakeup\n        MAGIC_INSTRUCTION(MAGIC_SIMICS_CORESTATESAVE);\n\n        \/\/Because of a bug in how the SBE injects the IPI used to wake\n        \/\/up the master core, need to ensure no mailbox traffic\n        \/\/or even an interrupt in the interrupt presenter\n        \/\/ 1) suspend the mailbox with interrupt disable\n        \/\/ 2) ensure that interrupt presenter is drained\n        l_errl = MBOX::suspend(true, true);\n        if (l_errl)\n        {\n            TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                       \"call_host_activate_master ERROR : MBOX::suspend\");\n            break;\n        }\n           \/\/@TODO RTC:137564 Support for thread-specific interrupts\n\/\/         TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace, \"draining interrupt Q\");\n\/\/         INTR::drainQueue();\n\n\n        \/\/ Call p9_block_wakeup_intr to prevent stray interrupts from\n        \/\/ popping core out of winkle before SBE sees it.\n\n        TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                   \"call_host_activated_master: call p9_block_wakeup_intr(SET) \"\n                   \"Target HUID %.8x\",\n                   TARGETING::get_huid(l_fapi2_coreTarget) );\n\n        FAPI_INVOKE_HWP( l_errl,\n                        p9_block_wakeup_intr,\n                        l_fapi2_coreTarget,\n                        p9pmblockwkup::SET );\n\n        if ( l_errl )\n        {\n            TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n            \"p9_block_wakeup_intr ERROR : Returning errorlog, reason=0x%x\",\n                l_errl->reasonCode() );\n\n            \/\/ capture the target data in the elog\n            ErrlUserDetailsTarget(l_core_target).addToLog( l_errl );\n\n            break;\n        }\n        else\n        {\n            TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                       \"p9_block_wakeup_intr SUCCESS\"  );\n        }\n\n        \/\/ Clear special wakeup\n        TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                   \"Disable special wakeup on master core\");\n\n        FAPI_INVOKE_HWP(l_errl, p9_cpu_special_wakeup,\n                        l_fapi2_coreTarget,\n                        SPCWKUP_DISABLE,\n                        HOST);\n\n\n        if(l_errl)\n        {\n            TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n            \"Disable p9_cpu_special_wakeup ERROR : Returning errorlog,\"\n            \" reason=0x%x\",\n                l_errl->reasonCode() );\n\n            \/\/ capture the target data in the elog\n            ErrlUserDetailsTarget(l_core_target).addToLog( l_errl );\n\n            break;\n        }\n        else\n        {\n            TRACFCOMP(ISTEPS_TRACE::g_trac_isteps_trace,\n                      \"Disable special wakeup on master core SUCCESS\");\n        }\n\n\n        \/\/  put the master into winkle.\n        TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                   \"call_host_activate_master: put master into winkle...\" );\n\n        \/\/ Flush any lingering console traces first\n        CONSOLE::flush();\n        bool l_fusedCores = is_fused_mode();\n\n        int l_rc    =   cpu_master_winkle(l_fusedCores);\n        if ( l_rc )\n        {\n            TRACFCOMP(ISTEPS_TRACE::g_trac_isteps_trace,\n                      \"ERROR : failed to winkle master, rc=0x%x\",\n                      l_rc  );\n            \/*@\n             * @errortype\n             * @reasoncode  RC_FAIL_MASTER_WINKLE\n             * @severity    ERRORLOG::ERRL_SEV_UNRECOVERABLE\n             * @moduleid    MOD_HOST_ACTIVATE_MASTER\n             * @userdata1   return code from cpu_master_winkle\n             * @userdata2   Fused core indicator\n             *\n             * @devdesc cpu_master_winkle returned an error\n             *\/\n            l_errl =\n            new ERRORLOG::ErrlEntry(ERRORLOG::ERRL_SEV_UNRECOVERABLE,\n                                    MOD_HOST_ACTIVATE_MASTER,\n                                    RC_FAIL_MASTER_WINKLE,\n                                    l_rc, l_fusedCores );\n            break;\n        }\n\n\n        \/\/  --------------------------------------------------------\n        \/\/  should return from Winkle at this point\n        \/\/  --------------------------------------------------------\n        TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                   \"Returned from Winkle.\" );\n\n        \/\/Re-enable the mailbox\n        l_errl = MBOX::resume();\n        if (l_errl)\n        {\n            TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                       \"call_host_activate_master ERROR : MBOX::resume\");\n            break;\n        }\n\n        TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                   \"Call proc_stop_deadman_timer. Target %.8X\",\n                    TARGETING::get_huid(l_core_target) );\n\n        l_errl = SBEIO::stopDeadmanLoop();\n\n        if ( l_errl )\n        {\n            TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                       \"stopDeadmanLoop ERROR : \"\n                       \"Returning errorlog, reason=0x%x\",\n                       l_errl->reasonCode() );\n\n            \/\/ capture the target data in the elog\n            ErrlUserDetailsTarget(l_core_target).addToLog( l_errl );\n\n            break;\n        }\n        else\n        {\n            TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                       \"stopDeadmanLoop SUCCESS\"  );\n        }\n        TARGETING::Target* sys = NULL;\n        TARGETING::targetService().getTopLevelTarget(sys);\n\n        TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                   \"Enable special wakeup on master core\");\n\n\n        FAPI_INVOKE_HWP(l_errl, p9_cpu_special_wakeup,\n                        l_fapi2_coreTarget,\n                        SPCWKUP_ENABLE,\n                        HOST);\n\n        if(l_errl)\n        {\n            TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n            \"Enable p9_cpu_special_wakeup ERROR : Returning errorlog, \"\n            \"reason=0x%x\",\n                l_errl->reasonCode() );\n\n            \/\/ capture the target data in the elog\n            ErrlUserDetailsTarget(l_core_target).addToLog( l_errl );\n\n            break;\n        }\n        else\n        {\n            TRACFCOMP(ISTEPS_TRACE::g_trac_isteps_trace,\n                      \"Enable special wakeup on master core SUCCESS\");\n        }\n\n    }   while ( 0 );\n\n    if( l_errl )\n    {\n        \/\/ Create IStep error log and cross reference error that occurred\n        l_stepError.addErrorDetails( l_errl );\n\n        \/\/ Commit Error\n        errlCommit( l_errl, HWPF_COMP_ID );\n    }\n\n    TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n               \"call_host_activate_master exit\" );\n    \/\/ end task, returning any errorlogs to IStepDisp\n    return l_stepError.getErrorHandle();\n\n}\n\n\n\n};\n<commit_msg>Call p9_block_wakeup_intr and p9_cpu_special_wakeup with core tgt<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/usr\/isteps\/istep16\/call_host_activate_master.C $          *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2015,2016                        *\/\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\/\/ Error Handling\n#include    <errl\/errlentry.H>\n#include    <errl\/errlmanager.H>\n#include    <initservice\/isteps_trace.H>\n#include    <isteps\/hwpisteperror.H>\n#include    <errl\/errludtarget.H>\n#include    <intr\/interrupt.H>\n#include    <console\/consoleif.H>\n\n\/\/  targeting support\n#include    <targeting\/namedtarget.H>\n#include    <targeting\/attrsync.H>\n#include    <fapi2\/target.H>\n\n\/\/SBE interfacing\n#include    <sbeio\/sbeioif.H>\n#include    <sys\/misc.h>\n\n\/\/Import directory (EKB)\n#include    <p9_block_wakeup_intr.H>\n#include    <p9_cpu_special_wakeup.H>\n\n\/\/HWP invoker\n#include    <fapi2\/plat_hwp_invoker.H>\n\nusing   namespace   ERRORLOG;\nusing   namespace   TARGETING;\nusing   namespace   ISTEP;\nusing   namespace   ISTEP_ERROR;\nusing   namespace   p9specialWakeup;\n\n\nnamespace ISTEP_16\n{\nvoid* call_host_activate_master (void *io_pArgs)\n{\n    IStepError  l_stepError;\n\n    TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n               \"call_host_activate_master entry\" );\n\n    errlHndl_t  l_errl  =   NULL;\n\n    do  {\n        \/\/ find the master core, i.e. the one we are running on\n        TRACDCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                   \"call_host_activate_master: Find master core: \" );\n\n        const TARGETING::Target*  l_masterCore  = getMasterCore( );\n        assert( l_masterCore != NULL );\n\n        TARGETING::Target* l_proc_target = const_cast<TARGETING::Target *>\n                                          ( getParentChip( l_masterCore ) );\n\n        \/\/ Cast OUR type of target to a FAPI2 type of target.\n        const fapi2::Target<fapi2::TARGET_TYPE_CORE> l_fapi2_coreTarget(\n                                const_cast<TARGETING::Target*> (l_masterCore));\n\n        TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                   \"call_host_activate_master: About to start deadman loop... \"\n                   \"Target HUID %.8X\",\n                    TARGETING::get_huid(l_proc_target));\n\n         \/\/In the future possibly move default \"waitTime\" value to SBEIO code\n         uint64_t waitTime = 10000;\n         l_errl = SBEIO::startDeadmanLoop(waitTime);\n\n        if ( l_errl )\n        {\n            TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n            \"startDeadmanLoop ERROR : Returning errorlog, reason=0x%x\",\n                l_errl->reasonCode() );\n\n            \/\/ capture the target data in the elog\n            ErrlUserDetailsTarget(l_proc_target).addToLog( l_errl );\n\n            break;\n        }\n        else\n        {\n            TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                       \"startDeadManLoop SUCCESS\"  );\n        }\n        \/\/Need to indicate to PHYP to save HRMOR and other SPR Data to be\n        \/\/ applied during wakeup\n        MAGIC_INSTRUCTION(MAGIC_SIMICS_CORESTATESAVE);\n\n        \/\/Because of a bug in how the SBE injects the IPI used to wake\n        \/\/up the master core, need to ensure no mailbox traffic\n        \/\/or even an interrupt in the interrupt presenter\n        \/\/ 1) suspend the mailbox with interrupt disable\n        \/\/ 2) ensure that interrupt presenter is drained\n        l_errl = MBOX::suspend(true, true);\n        if (l_errl)\n        {\n            TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                       \"call_host_activate_master ERROR : MBOX::suspend\");\n            break;\n        }\n           \/\/@TODO RTC:137564 Support for thread-specific interrupts\n\/\/         TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace, \"draining interrupt Q\");\n\/\/         INTR::drainQueue();\n\n\n        \/\/ Call p9_block_wakeup_intr to prevent stray interrupts from\n        \/\/ popping core out of winkle before SBE sees it.\n\n        TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                   \"call_host_activated_master: call p9_block_wakeup_intr(SET) \"\n                   \"Target HUID %.8x\",\n                   TARGETING::get_huid(l_fapi2_coreTarget) );\n\n        FAPI_INVOKE_HWP( l_errl,\n                        p9_block_wakeup_intr,\n                        l_fapi2_coreTarget,\n                        p9pmblockwkup::SET );\n\n        if ( l_errl )\n        {\n            TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n            \"p9_block_wakeup_intr ERROR : Returning errorlog, reason=0x%x\",\n                l_errl->reasonCode() );\n\n            \/\/ capture the target data in the elog\n            ErrlUserDetailsTarget(l_masterCore).addToLog( l_errl );\n\n            break;\n        }\n        else\n        {\n            TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                       \"p9_block_wakeup_intr SUCCESS\"  );\n        }\n\n        \/\/ Clear special wakeup\n        TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                   \"Disable special wakeup on master core\");\n\n        FAPI_INVOKE_HWP(l_errl, p9_cpu_special_wakeup,\n                        l_fapi2_coreTarget,\n                        SPCWKUP_DISABLE,\n                        HOST);\n\n\n        if(l_errl)\n        {\n            TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n            \"Disable p9_cpu_special_wakeup ERROR : Returning errorlog,\"\n            \" reason=0x%x\",\n                l_errl->reasonCode() );\n\n            \/\/ capture the target data in the elog\n            ErrlUserDetailsTarget(l_masterCore).addToLog( l_errl );\n\n            break;\n        }\n        else\n        {\n            TRACFCOMP(ISTEPS_TRACE::g_trac_isteps_trace,\n                      \"Disable special wakeup on master core SUCCESS\");\n        }\n\n\n        \/\/  put the master into winkle.\n        TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                   \"call_host_activate_master: put master into winkle...\" );\n\n        \/\/ Flush any lingering console traces first\n        CONSOLE::flush();\n        bool l_fusedCores = is_fused_mode();\n\n        int l_rc    =   cpu_master_winkle(l_fusedCores);\n        if ( l_rc )\n        {\n            TRACFCOMP(ISTEPS_TRACE::g_trac_isteps_trace,\n                      \"ERROR : failed to winkle master, rc=0x%x\",\n                      l_rc  );\n            \/*@\n             * @errortype\n             * @reasoncode  RC_FAIL_MASTER_WINKLE\n             * @severity    ERRORLOG::ERRL_SEV_UNRECOVERABLE\n             * @moduleid    MOD_HOST_ACTIVATE_MASTER\n             * @userdata1   return code from cpu_master_winkle\n             * @userdata2   Fused core indicator\n             *\n             * @devdesc cpu_master_winkle returned an error\n             *\/\n            l_errl =\n            new ERRORLOG::ErrlEntry(ERRORLOG::ERRL_SEV_UNRECOVERABLE,\n                                    MOD_HOST_ACTIVATE_MASTER,\n                                    RC_FAIL_MASTER_WINKLE,\n                                    l_rc, l_fusedCores );\n            break;\n        }\n\n\n        \/\/  --------------------------------------------------------\n        \/\/  should return from Winkle at this point\n        \/\/  --------------------------------------------------------\n        TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                   \"Returned from Winkle.\" );\n\n        \/\/Re-enable the mailbox\n        l_errl = MBOX::resume();\n        if (l_errl)\n        {\n            TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                       \"call_host_activate_master ERROR : MBOX::resume\");\n            break;\n        }\n\n        TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                   \"Call proc_stop_deadman_timer. Target %.8X\",\n                    TARGETING::get_huid(l_proc_target) );\n\n        l_errl = SBEIO::stopDeadmanLoop();\n\n        if ( l_errl )\n        {\n            TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                       \"stopDeadmanLoop ERROR : \"\n                       \"Returning errorlog, reason=0x%x\",\n                       l_errl->reasonCode() );\n\n            \/\/ capture the target data in the elog\n            ErrlUserDetailsTarget(l_proc_target).addToLog( l_errl );\n\n            break;\n        }\n        else\n        {\n            TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                       \"stopDeadmanLoop SUCCESS\"  );\n        }\n        TARGETING::Target* sys = NULL;\n        TARGETING::targetService().getTopLevelTarget(sys);\n\n        TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n                   \"Enable special wakeup on master core\");\n\n\n        FAPI_INVOKE_HWP(l_errl, p9_cpu_special_wakeup,\n                        l_fapi2_coreTarget,\n                        SPCWKUP_ENABLE,\n                        HOST);\n\n        if(l_errl)\n        {\n            TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n            \"Enable p9_cpu_special_wakeup ERROR : Returning errorlog, \"\n            \"reason=0x%x\",\n                l_errl->reasonCode() );\n\n            \/\/ capture the target data in the elog\n            ErrlUserDetailsTarget(l_masterCore).addToLog( l_errl );\n\n            break;\n        }\n        else\n        {\n            TRACFCOMP(ISTEPS_TRACE::g_trac_isteps_trace,\n                      \"Enable special wakeup on master core SUCCESS\");\n        }\n\n    }   while ( 0 );\n\n    if( l_errl )\n    {\n        \/\/ Create IStep error log and cross reference error that occurred\n        l_stepError.addErrorDetails( l_errl );\n\n        \/\/ Commit Error\n        errlCommit( l_errl, HWPF_COMP_ID );\n    }\n\n    TRACFCOMP( ISTEPS_TRACE::g_trac_isteps_trace,\n               \"call_host_activate_master exit\" );\n    \/\/ end task, returning any errorlogs to IStepDisp\n    return l_stepError.getErrorHandle();\n\n}\n\n\n\n};\n<|endoftext|>"}
{"text":"<commit_before>\/\/(c) 2016 by Authors\n\/\/This file is a part of ABruijn program.\n\/\/Released under the BSD license (see LICENSE file)\n\n#include <vector>\n#include <iostream>\n#include <unordered_set>\n#include <unordered_map>\n\n#include \"chimera.h\"\n#include \"logger.h\"\n\n\nvoid ChimeraDetector::detectChimeras()\n{\n\tLogger::get().debug() << \"Overlap-estimated coverage: \"\n\t\t\t\t\t\t  << this->estimateOverlapCoverage();\n\tfor (auto& seqHash : _seqContainer.getIndex())\n\t{\n\t\tif (this->testReadByCoverage(seqHash.first))\n\t\t\/\/if (this->testSelfOverlap(seqHash.first))\n\t\t{\n\t\t\t_chimeras.insert(seqHash.first);\n\t\t}\n\n\t\t\/\/Logger::get().debug() << \"Chimeric: \" << seqHash.second.description;\n\t}\n\n\tLogger::get().debug() << _chimeras.size() \/ 2 \n\t\t\t\t\t\t  << \" sequences were marked as chimeric\";\n}\n\nint ChimeraDetector::estimateOverlapCoverage()\n{\n\tsize_t total = 0;\n\tfor (auto& seqHash : _seqContainer.getIndex())\n\t{\n\t\ttotal += _ovlpDetector.getOverlapIndex().at(seqHash.first).size();\n\t}\n\treturn total \/ _seqContainer.getIndex().size();\n}\n\nbool ChimeraDetector::testReadByCoverage(FastaRecord::Id readId)\n{\n\tstatic const int WINDOW = _maximumJump;\n\t\/\/static const float COV_THRESHOLD = 0.1f;\n\tconst int FLANK = (_maximumJump + _maximumOverhang) \/ WINDOW;\n\n\tstd::vector<int> coverage;\n\tint numWindows = _seqContainer.seqLen(readId) \/ WINDOW;\n\tif (numWindows - 2 * FLANK <= 0) return false;\n\n\tcoverage.assign(numWindows - 2 * FLANK, 0);\n\tfor (auto& ovlp : _ovlpDetector.getOverlapIndex().at(readId))\n\t{\n\t\tif (ovlp.curId == ovlp.extId.rc()) continue;\n\n\t\tfor (int pos = (ovlp.curBegin + _maximumJump) \/ WINDOW; \n\t\t\t pos < (ovlp.curEnd - _maximumJump) \/ WINDOW; ++pos)\n\t\t{\n\t\t\tif (pos - FLANK >= 0 && \n\t\t\t\tpos - FLANK < (int)coverage.size())\n\t\t\t{\n\t\t\t\t++coverage[pos - FLANK];\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/int sum = 0;\n\t\/\/for (int cov : coverage) sum += cov;\n\t\/\/int minCoverage = (float)sum \/ coverage.size() * COV_THRESHOLD;\n\n\tLogger::get().debug() << _seqContainer.seqName(readId);\n\tstd::string covStr;\n\tfor (int cov : coverage)\n\t{\n\t\tcovStr += std::to_string(cov) + \" \";\n\t}\n\tLogger::get().debug() << covStr;\n\n\tbool zeroStrip = false;\n\tfor (size_t i = 0; i < coverage.size() - 1; ++i)\n\t{\n\t\tif (!zeroStrip && coverage[i] != 0 && coverage[i + 1] == 0)\n\t\t{\n\t\t\tzeroStrip = true;\n\t\t}\n\t\tif (zeroStrip && coverage[i + 1] != 0)\n\t\t{\n\t\t\tLogger::get().debug() << \"Chimeric!\";\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nbool ChimeraDetector::testSelfOverlap(FastaRecord::Id readId)\n{\n\tauto& overlaps = _ovlpDetector.getOverlapIndex().at(readId);\n\tfor (auto& ovlp : overlaps)\n\t{\n\t\tif (ovlp.extId == readId.rc()) return true;\n\t}\n\treturn false;\n}\n<commit_msg>code cleanup<commit_after>\/\/(c) 2016 by Authors\n\/\/This file is a part of ABruijn program.\n\/\/Released under the BSD license (see LICENSE file)\n\n#include <vector>\n#include <iostream>\n#include <unordered_set>\n#include <unordered_map>\n\n#include \"chimera.h\"\n#include \"logger.h\"\n\n\nvoid ChimeraDetector::detectChimeras()\n{\n\tLogger::get().debug() << \"Overlap-estimated coverage: \"\n\t\t\t\t\t\t  << this->estimateOverlapCoverage();\n\tfor (auto& seqHash : _seqContainer.getIndex())\n\t{\n\t\tif (this->testReadByCoverage(seqHash.first))\n\t\t\/\/if (this->testSelfOverlap(seqHash.first))\n\t\t{\n\t\t\t_chimeras.insert(seqHash.first);\n\t\t}\n\t}\n\n\tLogger::get().debug() << _chimeras.size() \/ 2 \n\t\t\t\t\t\t  << \" sequences were marked as chimeric\";\n}\n\nint ChimeraDetector::estimateOverlapCoverage()\n{\n\tsize_t total = 0;\n\tfor (auto& seqHash : _seqContainer.getIndex())\n\t{\n\t\ttotal += _ovlpDetector.getOverlapIndex().at(seqHash.first).size();\n\t}\n\treturn total \/ _seqContainer.getIndex().size();\n}\n\nbool ChimeraDetector::testReadByCoverage(FastaRecord::Id readId)\n{\n\tstatic const int WINDOW = _maximumJump;\n\tconst int FLANK = (_maximumJump + _maximumOverhang) \/ WINDOW;\n\n\tstd::vector<int> coverage;\n\tint numWindows = _seqContainer.seqLen(readId) \/ WINDOW;\n\tif (numWindows - 2 * FLANK <= 0) return false;\n\n\tcoverage.assign(numWindows - 2 * FLANK, 0);\n\tfor (auto& ovlp : _ovlpDetector.getOverlapIndex().at(readId))\n\t{\n\t\tif (ovlp.curId == ovlp.extId.rc()) continue;\n\n\t\tfor (int pos = (ovlp.curBegin + _maximumJump) \/ WINDOW; \n\t\t\t pos < (ovlp.curEnd - _maximumJump) \/ WINDOW; ++pos)\n\t\t{\n\t\t\tif (pos - FLANK >= 0 && \n\t\t\t\tpos - FLANK < (int)coverage.size())\n\t\t\t{\n\t\t\t\t++coverage[pos - FLANK];\n\t\t\t}\n\t\t}\n\t}\n\n\tLogger::get().debug() << _seqContainer.seqName(readId);\n\tstd::string covStr;\n\tfor (int cov : coverage)\n\t{\n\t\tcovStr += std::to_string(cov) + \" \";\n\t}\n\tLogger::get().debug() << covStr;\n\n\tbool zeroStrip = false;\n\tfor (size_t i = 0; i < coverage.size() - 1; ++i)\n\t{\n\t\tif (!zeroStrip && coverage[i] != 0 && coverage[i + 1] == 0)\n\t\t{\n\t\t\tzeroStrip = true;\n\t\t}\n\t\tif (zeroStrip && coverage[i + 1] != 0)\n\t\t{\n\t\t\tLogger::get().debug() << \"Chimeric!\";\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nbool ChimeraDetector::testSelfOverlap(FastaRecord::Id readId)\n{\n\tauto& overlaps = _ovlpDetector.getOverlapIndex().at(readId);\n\tfor (auto& ovlp : overlaps)\n\t{\n\t\tif (ovlp.extId == readId.rc()) return true;\n\t}\n\treturn false;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 1999-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#if !defined(DIRECTORY_ENUMERATOR_HEADER_GUARD_1357924680)\n#define DIRECTORY_ENUMERATOR_HEADER_GUARD_1357924680\n\n\n\n\/\/ Base header file.  Must be first.\n#include <xalanc\/PlatformSupport\/PlatformSupportDefinitions.hpp>\n\n\n\n#if defined(_MSC_VER)\n#include <io.h>\n#else\n#include <unistd.h>\n#include <dirent.h>\n#include <sys\/stat.h>\n#include <errno.h>\n#endif\n\n\n\n#include <functional>\n#include <iterator>\n\n\n#include \"xercesc\/framework\/MemoryManager.hpp\"\n\n\n\n#include \"xalanc\/PlatformSupport\/XalanFileOutputStream.hpp\"\n#include \"xalanc\/PlatformSupport\/DOMStringHelper.hpp\"\n#include \"xalanc\/PlatformSupport\/XalanUnicode.hpp\"\n\n\n\nXALAN_CPP_NAMESPACE_BEGIN\n\n\n\nXALAN_USING_XERCES(MemoryManager)\n\n\n\n#if defined(_MSC_VER)\n\nstruct FindFileStruct : public _wfinddata_t\n{\n\n\tenum eAttributes\n\t{\n\t\teAttributeArchive = _A_ARCH,\n\t\teAttributeDirectory = _A_SUBDIR,\n\t\teAttributeHidden = _A_HIDDEN,\n\t\teAttributeNormal = _A_NORMAL,\n\t\teReadOnly = _A_RDONLY,\n\t\teSystem = _A_SYSTEM\n\t};\n\npublic:\n\n\t\/**\n\t * Retrieve name of file\n\t *\n\t * @return file name\n\t *\/\n\tconst XalanDOMChar*\n\tgetName() const\n\t{\n\t\treturn name;\n\t}\n\n\t\/**\n\t * Determine whether file is a directory\n\t *\n\t * @return true if file is a directory\n\t *\/\n\tbool\n\tisDirectory() const\n\t{\n\t\treturn attrib & eAttributeDirectory ? true : false;\n\t}\n\n\tbool\n\tisSelfOrParent() const\n\t{\n\t\tif (isDirectory() == false)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\telse if (name[0] == '.')\n\t\t{\n\t\t\tif (name[1] == '\\0')\n\t\t\t{\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\telse if (name[1] == '.' &&\n\t\t\t\t\t name[2] == '\\0')\n\t\t\t{\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n};\n\n#else\n\nstruct FindFileStruct : public dirent\n{\npublic:\n\n\t\/**\n\t * Retrieve name of file\n\t *\n\t * @return file name\n\t *\/\n\tconst char* getName() const\n\t{\n\t\treturn d_name;\n\t}\n\n\t\/**\n\t * Determine whether file is a directory\n\t *\n\t * @return true if file is a directory\n\t *\/\n\tbool isDirectory() const\n\t{\n\n\t\tstruct\tstat stat_Info;\n\t\tconst int   retCode = stat(d_name, &stat_Info);\n \n        return retCode == -1 ? false : S_ISDIR(stat_Info.st_mode);\n\t}\n\n\tbool\n\tisSelfOrParent() const\n\t{\t\t\n\t\tif (isDirectory() == false)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\telse if (d_name[0] == '.')\n\t\t{\n\t\t\tif (d_name[1] == '\\0')\n\t\t\t{\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\telse if (d_name[1] == '.' &&\n\t\t\t\t\t d_name[2] == '\\0')\n\t\t\t{\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n};\n\n#endif\n\n\n\n#if defined(XALAN_NO_STD_NAMESPACE)\nstruct DirectoryFilterPredicate : public unary_function<FindFileStruct, bool>\n#else\nstruct DirectoryFilterPredicate : public std::unary_function<FindFileStruct, bool>\n#endif\n{\n\tresult_type\n\toperator()(const argument_type&\ttheFindData) const\n\t{\n\t\treturn theFindData.isDirectory();\n\t}\n};\n\n\n\n#if defined(XALAN_NO_STD_NAMESPACE)\nstruct FilesOnlyFilterPredicate : public unary_function<FindFileStruct, bool>\n#else\nstruct FilesOnlyFilterPredicate : public std::unary_function<FindFileStruct, bool>\n#endif\n{\n\tresult_type\n\toperator()(const argument_type&\ttheFindData) const\n\t{\n\t\tDirectoryFilterPredicate\t\ttheDirectoryPredicate;\n\n\t\treturn !theDirectoryPredicate(theFindData);\n\t\t\t   \n\t}\n};\n\n\n\ntemplate<class OutputIteratorType,\n\t\t class FilterPredicateType,\n\t\t class StringType,\n\t\t class StringConversionFunction>\nvoid\nEnumerateDirectory(\n            MemoryManager&              theMemoryManager,\n\t\t\tconst StringType&\t\t\ttheFullSearchSpec,\n\t\t\tOutputIteratorType\t\t\ttheOutputIterator,\n\t\t\tFilterPredicateType\t\t\ttheFilterPredicate,\n\t\t\tStringConversionFunction\ttheConversionFunction,\n#if defined(XALAN_TEMPLATE_FUNCTION_NO_DEFAULT_PARAMETERS)\n\t\t\tbool\t\t\t\t\t\tfIncludeSelfAndParent)\n#else\n\t\t\tbool\t\t\t\t\t\tfIncludeSelfAndParent = false)\n#endif\n{\n#if defined(_MSC_VER)\n\tFindFileStruct \t\ttheFindData;\n\t\n\t#ifdef _WIN64\n\t\ttypedef\tintptr_t\ttheHandleType;\n\t#else\n\t\ttypedef\tlong\ttheHandleType;\n\t#endif\n\n#pragma warning(push)\n#pragma warning(disable: 4244)\n\ttheHandleType\ttheSearchHandle =\n        _wfindfirst(\n            const_cast<wchar_t*>(theConversionFunction(theFullSearchSpec)),\n\t\t\t&theFindData);\n#pragma warning(pop)\n\n\tif (theSearchHandle != -1)\n\t{\n  \n\t\ttry\n\t\t{\n\t\t\tdo\n\t\t\t{\n\t\t\t\tif ((fIncludeSelfAndParent == true || theFindData.isSelfOrParent() == false) &&\n\t\t\t\t\ttheFilterPredicate(theFindData) == true)\n\t\t\t\t{\n\t\t\t\t\t*theOutputIterator = StringType(theFindData.getName(), theMemoryManager);\n\t\t\t\t}\n\t\t\t}\n\t\t\twhile(_wfindnext(theSearchHandle,\n\t\t\t\t\t\t\t &theFindData) == 0);\n\t\t}\n\t\tcatch(...)\n\t\t{\n\t\t\t_findclose(theSearchHandle);\n\n\t\t\tthrow;\n\t\t}\n\n\t\t_findclose(theSearchHandle);\n\t}\n\n\n#else\t\n\n\tCharVectorType\ttheTargetVector(theMemoryManager);\n\n\tTranscodeToLocalCodePage(theFullSearchSpec, theTargetVector, false);\n\n\tconst CharVectorType::size_type\t\ttheSize = theTargetVector.size();\n\tint  indexSuffix=0, indexName=0;\n\tbool target_Dir = false; \n\n\tif (theSize > 0)\n\t{\n\t\tif (theTargetVector.back() == '*')\n\t\t{\n\t\t\ttarget_Dir = true;\n\t\t\ttheTargetVector.pop_back();\n\n\t\t\tif (theSize == 1)\n\t\t\t{\n\t\t\t\ttheTargetVector.push_back('.');\n\t\t\t}\n\t\t\n\t\t}\n\t\telse\n        {\n\t\t\ttarget_Dir = false;\n\n\t\t\twhile(theTargetVector.back() != '*')\n\t\t\t{\n\t\t\t\ttheTargetVector.pop_back();\n\t\t\t\tindexSuffix++;\n\t\t\t}\n\n\t\t\ttheTargetVector.pop_back();\n\t\t\twhile(theTargetVector.back() != '\/')\n\t\t\t{ \n\t\t\t\ttheTargetVector.pop_back();\n\t\t\t\tindexName++;\n\t\t\t}\n\t\t}      \n\n\t\ttheTargetVector.push_back('\\0');\n\n\t\tconst char* const\ttheSpec = c_str(theTargetVector);\n\t\tassert(theSpec != 0);\n\t\t\n\t\tXalanDOMString\t\ttheName(theMemoryManager);\n\t\tXalanDOMString\t\ttheSuffix(theMemoryManager);\n\t\tif ( !target_Dir )\n\t\t{\n#if defined(XALAN_STRICT_ANSI_HEADERS)\n            using std::strlen;\n#endif\n\n\t\t\tint lenSpec = strlen(theSpec); \n\t\t\ttheFullSearchSpec.substr(theName, lenSpec, indexName); \n\t\t\ttheFullSearchSpec.substr(theSuffix, lenSpec+indexName+1, indexSuffix);\n\t\t}\n\n\t\tDIR* const\ttheDirectory = opendir(theSpec);\n\n\t\tif (theDirectory != 0)\n\t\t{\n\t\t\tchdir(theSpec);\n\t\t\ttry\n\t\t\t{\n\t\t\t\tconst FindFileStruct*\ttheEntry =\n\t\t\t\t\t(FindFileStruct*)readdir(theDirectory);\n\t\n\t\t\t\twhile(theEntry != 0)\n\t\t\t\t{\n\t\t\t\t\tif ((fIncludeSelfAndParent == true || theEntry->isSelfOrParent() == false))\n\t\t\t\t\t{\n\t\t\t\t\t\tif (theFilterPredicate(*theEntry) == true)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif( target_Dir )\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t*theOutputIterator = StringType(theEntry->getName(), theMemoryManager);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tXalanDOMString\tGetname(theEntry->getName(), theMemoryManager);\n\t\t\t\t\t\t\t\tint\tCheck_1 = Getname.compare(theName);\n\t\t\t\t\t\t\t\tXalanDOMString\tGetnameSuffix(theMemoryManager);\n                                Getname.substr(GetnameSuffix, Getname.size() -indexSuffix, indexSuffix);            \n\t\t\t\t\t\t\t\tint Check_2 = GetnameSuffix.compare(theSuffix);\n\t\t\t\t\t\t\t\tif ( Check_1 == 1 && (!Check_2) )\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t*theOutputIterator = StringType(theEntry->getName(), theMemoryManager);\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\ttheEntry = (FindFileStruct*)readdir(theDirectory);\n\t\t\t\t} \/\/while\n\t\t\t}\/\/try\n\n\t\t\tcatch(...)\n\t\t\t{\n\t\t\t\tclosedir(theDirectory);\n\n\t\t\t\tthrow;\n\t\t\t}\n\t\t\tif( target_Dir )\n                           chdir(\"..\");\n                         else\n                           chdir(\"..\/..\");\n\t\t\tclosedir(theDirectory);\n\t\t}\n\t}\n\n#endif\n}\n\n\n\ntemplate<class OutputIteratorType,\n\t\t class FilterPredicateType,\n\t\t class StringType,\n\t\t class StringConversionFunction>\nvoid\nEnumerateDirectory(\n            MemoryManager&              theMemoryManager,\n\t\t\tconst StringType&\t\t\ttheDirectory,\n\t\t\tconst StringType&\t\t\ttheSearchSpec,\n\t\t\tOutputIteratorType\t\t\ttheOutputIterator,\n\t\t\tFilterPredicateType\t\t\ttheFilterPredicate,\n\t\t\tStringConversionFunction\ttheConversionFunction,\n#if defined(XALAN_TEMPLATE_FUNCTION_NO_DEFAULT_PARAMETERS)\n\t\t\tbool\t\t\t\t\t\tfIncludeSelfAndParent)\n#else\n\t\t\tbool\t\t\t\t\t\tfIncludeSelfAndParent = false)\n#endif\n{\n\tStringType\ttheFullSearchSpec(theDirectory, theMemoryManager);\n\n\ttheFullSearchSpec += theSearchSpec;\n\n\tEnumerateDirectory(\n        theMemoryManager,\n        theFullSearchSpec,\n        theOutputIterator,\n        theFilterPredicate,\n        theConversionFunction,\n        fIncludeSelfAndParent);\n}\n\n\n\n#if defined(XALAN_NO_DEFAULT_TEMPLATE_ARGUMENTS)\ntemplate<class CollectionType, class StringType>\nstruct DirectoryEnumeratorFunctor\n{\n\tCollectionType\n\toperator()(const StringType&\ttheDirectory) const\n\t{\n\t\tCollectionType\t\ttheCollection;\n\n\t\toperator()(theDirectory,\n\t\t\t   theCollection);\n\n\t\treturn theCollection;\n\t}\n\n\tvoid\n\toperator()(\n\t\tconst StringType&,\n\t\tconst CollectionType&) const\n\t{\n\t}\n};\n#else\ntemplate<class CollectionType,\n  \t class StringType = XalanDOMString,\n  \t class FilterPredicateType = FilesOnlyFilterPredicate,\n  \t class StringConversionFunction = c_wstr_functor>\n#if defined(XALAN_NO_STD_NAMESPACE)\nstruct DirectoryEnumeratorFunctor : public unary_function<StringType, CollectionType>\n#else\nstruct DirectoryEnumeratorFunctor : public std::unary_function<StringType, CollectionType>\n#endif\n{\n#if defined(XALAN_NO_STD_NAMESPACE)\n\ttypedef unary_function<StringType, CollectionType>\tBaseClassType;\n#else\n\ttypedef std::unary_function<StringType, CollectionType>\tBaseClassType;\n#endif\n\n\ttypedef typename BaseClassType::result_type\t\tresult_type;\n\ttypedef typename BaseClassType::argument_type\targument_type;\n\n\texplicit\n\tDirectoryEnumeratorFunctor(\n                MemoryManager&  theMemoryManager,\n                bool            fIncludeSelfAndParent = false) :\n\t\tm_includeSelfAndParent(fIncludeSelfAndParent),\n        m_memoryManager(theMemoryManager)\n\t{\n\t}\n\t\t\t\n\tvoid\n\toperator()(\n\t\t\tconst argument_type&\ttheFullSearchSpec,\n\t\t\tCollectionType&\t\t\ttheCollection) const\n\t{\n\t\tXALAN_USING_STD(back_inserter)\n\n\t\tEnumerateDirectory(\n            m_memoryManager,\n\t\t\ttheFullSearchSpec,\n\t\t\tXALAN_STD_QUALIFIER back_inserter(theCollection),\n\t\t\tm_filterPredicate,\n\t\t\tm_conversionFunction,\n\t\t\tm_includeSelfAndParent);\n\t}\n\n\tresult_type\n\toperator()(const argument_type&\t\ttheFullSearchSpec) const\n\t{\n\t\tresult_type\t\ttheCollection;\n\n\t\toperator()(\n\t\t\t\ttheFullSearchSpec,\n\t\t\t\ttheCollection);\n\n\t\treturn theCollection;\n\t}\n\n\tvoid\n\toperator()(\n\t\t\tconst argument_type&\ttheDirectory,\n\t\t\tconst argument_type&\ttheSearchSpec,\n\t\t\tCollectionType&\t\t\ttheCollection) const\n\t{\n\t\tEnumerateDirectory(\n            m_memoryManager,\n\t\t    theDirectory,\n\t\t\ttheSearchSpec,\n\t\t\tXALAN_STD_QUALIFIER back_inserter(theCollection),\n\t\t\tm_filterPredicate,\n\t\t\tm_conversionFunction,\n\t\t\tm_includeSelfAndParent);\n\t}\n\n\tresult_type\n\toperator()(\n\t\t\tconst argument_type&\ttheDirectory,\n\t\t\tconst argument_type&\ttheSearchSpec) const\n\t{\n\t\tresult_type\t\ttheCollection;\n\n\t\toperator()(\n\t\t\t\ttheDirectory,\n\t\t\t\ttheSearchSpec,\n\t\t\t\ttheCollection);\n\n\t\treturn theCollection;\n\t}\n\nprivate:\n\n\tFilterPredicateType\t\t\tm_filterPredicate;\n\n\tStringConversionFunction\tm_conversionFunction;\n\n\tconst bool\t\t\t\t\tm_includeSelfAndParent;\n\n    MemoryManager&              m_memoryManager;\n};\n#endif\n\n\n\nXALAN_CPP_NAMESPACE_END\n\n\n\n#endif\t\/\/ DIRECTORY_ENUMERATOR_HEADER_GUARD_1357924680\n<commit_msg>Fix for Jira issue XALANC-505.<commit_after>\/*\n * Copyright 1999-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#if !defined(DIRECTORY_ENUMERATOR_HEADER_GUARD_1357924680)\n#define DIRECTORY_ENUMERATOR_HEADER_GUARD_1357924680\n\n\n\n\/\/ Base header file.  Must be first.\n#include <xalanc\/PlatformSupport\/PlatformSupportDefinitions.hpp>\n\n\n\n#if defined(_MSC_VER)\n#include <io.h>\n#else\n#include <unistd.h>\n#include <dirent.h>\n#include <sys\/stat.h>\n#include <errno.h>\n#endif\n\n\n\n#include <functional>\n#include <iterator>\n\n\n#include \"xercesc\/framework\/MemoryManager.hpp\"\n\n\n\n#include \"xalanc\/PlatformSupport\/XalanFileOutputStream.hpp\"\n#include \"xalanc\/PlatformSupport\/DOMStringHelper.hpp\"\n#include \"xalanc\/PlatformSupport\/XalanUnicode.hpp\"\n\n\n\nXALAN_CPP_NAMESPACE_BEGIN\n\n\n\nXALAN_USING_XERCES(MemoryManager)\n\n\n\n#if defined(_MSC_VER)\n\nstruct FindFileStruct : public _wfinddata_t\n{\n\n\tenum eAttributes\n\t{\n\t\teAttributeArchive = _A_ARCH,\n\t\teAttributeDirectory = _A_SUBDIR,\n\t\teAttributeHidden = _A_HIDDEN,\n\t\teAttributeNormal = _A_NORMAL,\n\t\teReadOnly = _A_RDONLY,\n\t\teSystem = _A_SYSTEM\n\t};\n\npublic:\n\n\t\/**\n\t * Retrieve name of file\n\t *\n\t * @return file name\n\t *\/\n\tconst XalanDOMChar*\n\tgetName() const\n\t{\n\t\treturn name;\n\t}\n\n\t\/**\n\t * Determine whether file is a directory\n\t *\n\t * @return true if file is a directory\n\t *\/\n\tbool\n\tisDirectory() const\n\t{\n\t\treturn attrib & eAttributeDirectory ? true : false;\n\t}\n\n\tbool\n\tisSelfOrParent() const\n\t{\n\t\tif (isDirectory() == false)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\telse if (name[0] == '.')\n\t\t{\n\t\t\tif (name[1] == '\\0')\n\t\t\t{\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\telse if (name[1] == '.' &&\n\t\t\t\t\t name[2] == '\\0')\n\t\t\t{\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n};\n\n#else\n\nstruct FindFileStruct : public dirent\n{\npublic:\n\n\t\/**\n\t * Retrieve name of file\n\t *\n\t * @return file name\n\t *\/\n\tconst char* getName() const\n\t{\n\t\treturn d_name;\n\t}\n\n\t\/**\n\t * Determine whether file is a directory\n\t *\n\t * @return true if file is a directory\n\t *\/\n\tbool isDirectory() const\n\t{\n#if defined(__SunOS_5_10) && (__SUNPRO_CC >= 0x570)\n            struct stat64 stat_Info;\n\n            const int   retCode = stat64(d_name, &stat_Info);\n#else\n            struct\tstat stat_Info;\n\t\t\n            const int   retCode = stat(d_name, &stat_Info);\n#endif\n\n        return retCode == -1 ? false : S_ISDIR(stat_Info.st_mode);\n\t}\n\n\tbool\n\tisSelfOrParent() const\n\t{\t\t\n\t\tif (isDirectory() == false)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\telse if (d_name[0] == '.')\n\t\t{\n\t\t\tif (d_name[1] == '\\0')\n\t\t\t{\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\telse if (d_name[1] == '.' &&\n\t\t\t\t\t d_name[2] == '\\0')\n\t\t\t{\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n};\n\n#endif\n\n\n\n#if defined(XALAN_NO_STD_NAMESPACE)\nstruct DirectoryFilterPredicate : public unary_function<FindFileStruct, bool>\n#else\nstruct DirectoryFilterPredicate : public std::unary_function<FindFileStruct, bool>\n#endif\n{\n\tresult_type\n\toperator()(const argument_type&\ttheFindData) const\n\t{\n\t\treturn theFindData.isDirectory();\n\t}\n};\n\n\n\n#if defined(XALAN_NO_STD_NAMESPACE)\nstruct FilesOnlyFilterPredicate : public unary_function<FindFileStruct, bool>\n#else\nstruct FilesOnlyFilterPredicate : public std::unary_function<FindFileStruct, bool>\n#endif\n{\n\tresult_type\n\toperator()(const argument_type&\ttheFindData) const\n\t{\n\t\tDirectoryFilterPredicate\t\ttheDirectoryPredicate;\n\n\t\treturn !theDirectoryPredicate(theFindData);\n\t\t\t   \n\t}\n};\n\n\n\ntemplate<class OutputIteratorType,\n\t\t class FilterPredicateType,\n\t\t class StringType,\n\t\t class StringConversionFunction>\nvoid\nEnumerateDirectory(\n            MemoryManager&              theMemoryManager,\n\t\t\tconst StringType&\t\t\ttheFullSearchSpec,\n\t\t\tOutputIteratorType\t\t\ttheOutputIterator,\n\t\t\tFilterPredicateType\t\t\ttheFilterPredicate,\n\t\t\tStringConversionFunction\ttheConversionFunction,\n#if defined(XALAN_TEMPLATE_FUNCTION_NO_DEFAULT_PARAMETERS)\n\t\t\tbool\t\t\t\t\t\tfIncludeSelfAndParent)\n#else\n\t\t\tbool\t\t\t\t\t\tfIncludeSelfAndParent = false)\n#endif\n{\n#if defined(_MSC_VER)\n\tFindFileStruct \t\ttheFindData;\n\t\n\t#ifdef _WIN64\n\t\ttypedef\tintptr_t\ttheHandleType;\n\t#else\n\t\ttypedef\tlong\ttheHandleType;\n\t#endif\n\n#pragma warning(push)\n#pragma warning(disable: 4244)\n\ttheHandleType\ttheSearchHandle =\n        _wfindfirst(\n            const_cast<wchar_t*>(theConversionFunction(theFullSearchSpec)),\n\t\t\t&theFindData);\n#pragma warning(pop)\n\n\tif (theSearchHandle != -1)\n\t{\n  \n\t\ttry\n\t\t{\n\t\t\tdo\n\t\t\t{\n\t\t\t\tif ((fIncludeSelfAndParent == true || theFindData.isSelfOrParent() == false) &&\n\t\t\t\t\ttheFilterPredicate(theFindData) == true)\n\t\t\t\t{\n\t\t\t\t\t*theOutputIterator = StringType(theFindData.getName(), theMemoryManager);\n\t\t\t\t}\n\t\t\t}\n\t\t\twhile(_wfindnext(theSearchHandle,\n\t\t\t\t\t\t\t &theFindData) == 0);\n\t\t}\n\t\tcatch(...)\n\t\t{\n\t\t\t_findclose(theSearchHandle);\n\n\t\t\tthrow;\n\t\t}\n\n\t\t_findclose(theSearchHandle);\n\t}\n\n\n#else\t\n\n\tCharVectorType\ttheTargetVector(theMemoryManager);\n\n\tTranscodeToLocalCodePage(theFullSearchSpec, theTargetVector, false);\n\n\tconst CharVectorType::size_type\t\ttheSize = theTargetVector.size();\n\tint  indexSuffix=0, indexName=0;\n\tbool target_Dir = false; \n\n\tif (theSize > 0)\n\t{\n\t\tif (theTargetVector.back() == '*')\n\t\t{\n\t\t\ttarget_Dir = true;\n\t\t\ttheTargetVector.pop_back();\n\n\t\t\tif (theSize == 1)\n\t\t\t{\n\t\t\t\ttheTargetVector.push_back('.');\n\t\t\t}\n\t\t\n\t\t}\n\t\telse\n        {\n\t\t\ttarget_Dir = false;\n\n\t\t\twhile(theTargetVector.back() != '*')\n\t\t\t{\n\t\t\t\ttheTargetVector.pop_back();\n\t\t\t\tindexSuffix++;\n\t\t\t}\n\n\t\t\ttheTargetVector.pop_back();\n\t\t\twhile(theTargetVector.back() != '\/')\n\t\t\t{ \n\t\t\t\ttheTargetVector.pop_back();\n\t\t\t\tindexName++;\n\t\t\t}\n\t\t}      \n\n\t\ttheTargetVector.push_back('\\0');\n\n\t\tconst char* const\ttheSpec = c_str(theTargetVector);\n\t\tassert(theSpec != 0);\n\t\t\n\t\tXalanDOMString\t\ttheName(theMemoryManager);\n\t\tXalanDOMString\t\ttheSuffix(theMemoryManager);\n\t\tif ( !target_Dir )\n\t\t{\n#if defined(XALAN_STRICT_ANSI_HEADERS)\n            using std::strlen;\n#endif\n\n\t\t\tint lenSpec = strlen(theSpec); \n\t\t\ttheFullSearchSpec.substr(theName, lenSpec, indexName); \n\t\t\ttheFullSearchSpec.substr(theSuffix, lenSpec+indexName+1, indexSuffix);\n\t\t}\n\n\t\tDIR* const\ttheDirectory = opendir(theSpec);\n\n\t\tif (theDirectory != 0)\n\t\t{\n\t\t\tchdir(theSpec);\n\t\t\ttry\n\t\t\t{\n\t\t\t\tconst FindFileStruct*\ttheEntry =\n\t\t\t\t\t(FindFileStruct*)readdir(theDirectory);\n\t\n\t\t\t\twhile(theEntry != 0)\n\t\t\t\t{\n\t\t\t\t\tif ((fIncludeSelfAndParent == true || theEntry->isSelfOrParent() == false))\n\t\t\t\t\t{\n\t\t\t\t\t\tif (theFilterPredicate(*theEntry) == true)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif( target_Dir )\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t*theOutputIterator = StringType(theEntry->getName(), theMemoryManager);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tXalanDOMString\tGetname(theEntry->getName(), theMemoryManager);\n\t\t\t\t\t\t\t\tint\tCheck_1 = Getname.compare(theName);\n\t\t\t\t\t\t\t\tXalanDOMString\tGetnameSuffix(theMemoryManager);\n                                Getname.substr(GetnameSuffix, Getname.size() -indexSuffix, indexSuffix);            \n\t\t\t\t\t\t\t\tint Check_2 = GetnameSuffix.compare(theSuffix);\n\t\t\t\t\t\t\t\tif ( Check_1 == 1 && (!Check_2) )\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t*theOutputIterator = StringType(theEntry->getName(), theMemoryManager);\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\ttheEntry = (FindFileStruct*)readdir(theDirectory);\n\t\t\t\t} \/\/while\n\t\t\t}\/\/try\n\n\t\t\tcatch(...)\n\t\t\t{\n\t\t\t\tclosedir(theDirectory);\n\n\t\t\t\tthrow;\n\t\t\t}\n\t\t\tif( target_Dir )\n                           chdir(\"..\");\n                         else\n                           chdir(\"..\/..\");\n\t\t\tclosedir(theDirectory);\n\t\t}\n\t}\n\n#endif\n}\n\n\n\ntemplate<class OutputIteratorType,\n\t\t class FilterPredicateType,\n\t\t class StringType,\n\t\t class StringConversionFunction>\nvoid\nEnumerateDirectory(\n            MemoryManager&              theMemoryManager,\n\t\t\tconst StringType&\t\t\ttheDirectory,\n\t\t\tconst StringType&\t\t\ttheSearchSpec,\n\t\t\tOutputIteratorType\t\t\ttheOutputIterator,\n\t\t\tFilterPredicateType\t\t\ttheFilterPredicate,\n\t\t\tStringConversionFunction\ttheConversionFunction,\n#if defined(XALAN_TEMPLATE_FUNCTION_NO_DEFAULT_PARAMETERS)\n\t\t\tbool\t\t\t\t\t\tfIncludeSelfAndParent)\n#else\n\t\t\tbool\t\t\t\t\t\tfIncludeSelfAndParent = false)\n#endif\n{\n\tStringType\ttheFullSearchSpec(theDirectory, theMemoryManager);\n\n\ttheFullSearchSpec += theSearchSpec;\n\n\tEnumerateDirectory(\n        theMemoryManager,\n        theFullSearchSpec,\n        theOutputIterator,\n        theFilterPredicate,\n        theConversionFunction,\n        fIncludeSelfAndParent);\n}\n\n\n\n#if defined(XALAN_NO_DEFAULT_TEMPLATE_ARGUMENTS)\ntemplate<class CollectionType, class StringType>\nstruct DirectoryEnumeratorFunctor\n{\n\tCollectionType\n\toperator()(const StringType&\ttheDirectory) const\n\t{\n\t\tCollectionType\t\ttheCollection;\n\n\t\toperator()(theDirectory,\n\t\t\t   theCollection);\n\n\t\treturn theCollection;\n\t}\n\n\tvoid\n\toperator()(\n\t\tconst StringType&,\n\t\tconst CollectionType&) const\n\t{\n\t}\n};\n#else\ntemplate<class CollectionType,\n  \t class StringType = XalanDOMString,\n  \t class FilterPredicateType = FilesOnlyFilterPredicate,\n  \t class StringConversionFunction = c_wstr_functor>\n#if defined(XALAN_NO_STD_NAMESPACE)\nstruct DirectoryEnumeratorFunctor : public unary_function<StringType, CollectionType>\n#else\nstruct DirectoryEnumeratorFunctor : public std::unary_function<StringType, CollectionType>\n#endif\n{\n#if defined(XALAN_NO_STD_NAMESPACE)\n\ttypedef unary_function<StringType, CollectionType>\tBaseClassType;\n#else\n\ttypedef std::unary_function<StringType, CollectionType>\tBaseClassType;\n#endif\n\n\ttypedef typename BaseClassType::result_type\t\tresult_type;\n\ttypedef typename BaseClassType::argument_type\targument_type;\n\n\texplicit\n\tDirectoryEnumeratorFunctor(\n                MemoryManager&  theMemoryManager,\n                bool            fIncludeSelfAndParent = false) :\n\t\tm_includeSelfAndParent(fIncludeSelfAndParent),\n        m_memoryManager(theMemoryManager)\n\t{\n\t}\n\t\t\t\n\tvoid\n\toperator()(\n\t\t\tconst argument_type&\ttheFullSearchSpec,\n\t\t\tCollectionType&\t\t\ttheCollection) const\n\t{\n\t\tXALAN_USING_STD(back_inserter)\n\n\t\tEnumerateDirectory(\n            m_memoryManager,\n\t\t\ttheFullSearchSpec,\n\t\t\tXALAN_STD_QUALIFIER back_inserter(theCollection),\n\t\t\tm_filterPredicate,\n\t\t\tm_conversionFunction,\n\t\t\tm_includeSelfAndParent);\n\t}\n\n\tresult_type\n\toperator()(const argument_type&\t\ttheFullSearchSpec) const\n\t{\n\t\tresult_type\t\ttheCollection;\n\n\t\toperator()(\n\t\t\t\ttheFullSearchSpec,\n\t\t\t\ttheCollection);\n\n\t\treturn theCollection;\n\t}\n\n\tvoid\n\toperator()(\n\t\t\tconst argument_type&\ttheDirectory,\n\t\t\tconst argument_type&\ttheSearchSpec,\n\t\t\tCollectionType&\t\t\ttheCollection) const\n\t{\n\t\tEnumerateDirectory(\n            m_memoryManager,\n\t\t    theDirectory,\n\t\t\ttheSearchSpec,\n\t\t\tXALAN_STD_QUALIFIER back_inserter(theCollection),\n\t\t\tm_filterPredicate,\n\t\t\tm_conversionFunction,\n\t\t\tm_includeSelfAndParent);\n\t}\n\n\tresult_type\n\toperator()(\n\t\t\tconst argument_type&\ttheDirectory,\n\t\t\tconst argument_type&\ttheSearchSpec) const\n\t{\n\t\tresult_type\t\ttheCollection;\n\n\t\toperator()(\n\t\t\t\ttheDirectory,\n\t\t\t\ttheSearchSpec,\n\t\t\t\ttheCollection);\n\n\t\treturn theCollection;\n\t}\n\nprivate:\n\n\tFilterPredicateType\t\t\tm_filterPredicate;\n\n\tStringConversionFunction\tm_conversionFunction;\n\n\tconst bool\t\t\t\t\tm_includeSelfAndParent;\n\n    MemoryManager&              m_memoryManager;\n};\n#endif\n\n\n\nXALAN_CPP_NAMESPACE_END\n\n\n\n#endif\t\/\/ DIRECTORY_ENUMERATOR_HEADER_GUARD_1357924680\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n#include <fstream>\n\nnamespace Doremi\n{\n    namespace Utilities\n    {\n        namespace Chrono\n        {\n            class Timer;\n        }\n        namespace Logging\n        {\n            enum class LogTag;\n            struct LogTextData;\n        }\n    }\n}\n\nclass SpecificLogFile\n{\npublic:\n    SpecificLogFile();\n    virtual ~SpecificLogFile();\n\n    void Initialize(const Doremi::Utilities::Logging::LogTag& p_logTag);\n\n    void Write(const Doremi::Utilities::Logging::LogTextData& p_data);\n\n    \/**\n    TODO DOCS\n    *\/\n    void Flush();\n\nprivate:\n    void BuildLogFile(const std::string& p_fileName);\n    void OpenFileStream(const std::string& p_fileName);\n    std::ofstream* m_fileStream;\n    Doremi::Utilities::Chrono::Timer* m_timer;\n    double m_flushTimerLimit;\n    double m_elapsedTime;\n};<commit_msg>Added docs to a file<commit_after>#pragma once\n#include <fstream>\n\nnamespace Doremi\n{\n    namespace Utilities\n    {\n        namespace Chrono\n        {\n            class Timer;\n        }\n        namespace Logging\n        {\n            enum class LogTag;\n            struct LogTextData;\n        }\n    }\n}\n\nclass SpecificLogFile\n{\npublic:\n    \/**\n    Constructor\n    *\/\n    SpecificLogFile();\n\n    \/**\n    Destructor\n    *\/\n    virtual ~SpecificLogFile();\n\n    \/**\n    Initializes the logfile with a specific tag, each tag is one file.\n    *\/\n    void Initialize(const Doremi::Utilities::Logging::LogTag& p_logTag);\n\n    \/**\n    Writes to buffer for file, calls flush with regular intervalls.\n    *\/\n    void Write(const Doremi::Utilities::Logging::LogTextData& p_data);\n\n    \/**\n    Forcily flushes the data in the buffer to a file on the disk.\n    *\/\n    void Flush();\n\nprivate:\n    void BuildLogFile(const std::string& p_fileName);\n    void OpenFileStream(const std::string& p_fileName);\n    std::ofstream* m_fileStream;\n    Doremi::Utilities::Chrono::Timer* m_timer;\n    double m_flushTimerLimit;\n    double m_elapsedTime;\n};<|endoftext|>"}
{"text":"<commit_before>\/\/ $Id$\n\nAliAnalysisTaskSE *AddTaskEMCALTenderUsingDatasetDef(\n  const char *perstr  = \"LHC11h\",\n  const char *pass    = 0 \/*should not be needed*\/\n) \n{\n  AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n  if (!mgr)\n  {\n    Error(\"AddTaskEMCALTenderUsingDatasetDef\",\"No analysis manager found.\");\n    return 0;\n  }\n\n  AliVEventHandler *evhand = mgr->GetInputEventHandler();\n  if (!evhand) {\n    Error(\"AddTaskEMCALTenderUsingDatasetDef\", \"This task requires an input event handler\");\n    return NULL;\n  }\n\n  gROOT->LoadMacro(\"$ALICE_ROOT\/PWG\/EMCAL\/macros\/AddTaskEMCALTender.C\");\n\n  Bool_t distBC         = kTRUE;   \/\/distance to bad channel\n  Bool_t recalibClus    = kTRUE;   \/\/recalibrate cluster energy\n  Bool_t recalcClusPos  = kTRUE;   \/\/recalculate cluster position\n  Bool_t nonLinearCorr  = kTRUE;   \/\/apply non-linearity\n  Bool_t remExotic      = kTRUE;   \/\/remove exotic cells\n  Bool_t fidRegion      = kFALSE;  \/\/apply fiducial cuts\n  Bool_t calibEnergy    = kTRUE;   \/\/calibrate energy\n  Bool_t calibTime      = kTRUE;   \/\/calibrate timing\n  Bool_t remBC          = kTRUE;   \/\/remove bad channels\n  UInt_t nonLinFunct    = AliEMCALRecoUtils::kBeamTestCorrected;\n  Bool_t reclusterize   = kFALSE;  \/\/reclusterize\n  Float_t seedthresh    = 0.100;   \/\/seed threshold\n  Float_t cellthresh    = 0.050;   \/\/cell threshold\n  UInt_t clusterizer    = AliEMCALRecParam::kClusterizerv2;\n  Bool_t trackMatch     = kTRUE;   \/\/track matching\n  Bool_t updateCellOnly = kFALSE;  \/\/only change if you run your own clusterizer task\n  Float_t timeMin       = -50e6;   \/\/minimum time of physical signal in a cell\/digit (s)\n  Float_t timeMax       =  50e6;   \/\/maximum time of physical signal in a cell\/digit (s)\n  Float_t timeCut       =   1e6;   \/\/maximum time difference between the digits inside EMC cluster (s)\n\n  Bool_t isMC = kFALSE;\n\n  TString period(perstr);\n  period.ToLower();\n\n  if (period == \"lhc11h\") {\n    trackMatch = kFALSE;\n    timeMin = -50e-9;\n    timeMax =  50e-9;\n    timeCut =  1e6;\n  }\n  else if (period == \"lhc12a15e\" || period == \"lhc12a15e_fix\") {\n    nonLinFunct = AliEMCALRecoUtils::kPi0MCv3;\n    isMC = kTRUE;\n  }\n  else if (period == \"lhc12a15a\") {\n    nonLinFunct = AliEMCALRecoUtils::kPi0MCv2;\n    isMC = kTRUE;\n  }\n  else if(period == \"lhc12a\" || period == \"lhc12b\" || period == \"lhc12c\" || period == \"lhc12d\" || period == \"lhc12e\" || period == \"lhc12f\" || period == \"lhc12g\" || period == \"lhc12h\" || period == \"lhc12i\") {\n    reclusterize = kTRUE;\n    seedthresh = 0.3;\n    cellthresh = 0.05;\n    timeMin = -50e-9;\n    timeMax =  50e-9;\n    timeCut =  1e6;\n  }\n  else if(period == \"lhc13b\" || period == \"lhc13c\" || period == \"lhc13d\" || period == \"lhc13e\" || period == \"lhc13f\" || period == \"lhc13g\" || \n\t  period == \"lhc13b4\" || period == \"lhc13b4_fix\" || period == \"lhc13b4_plus\") {\n    reclusterize = kTRUE;\n    seedthresh = 0.3;\n    cellthresh = 0.05;\n    if(period == \"lhc13b\" || period == \"lhc13c\" || period == \"lhc13d\" || period == \"lhc13e\" || period == \"lhc13f\" || period == \"lhc13g\") {\n      timeMin = -50e-9;\n      timeMax =  50e-9;\n      timeCut =  1e6;\n    }\n    else if(period == \"lhc13b4\" || period == \"lhc13b4_fix\" || period == \"lhc13b4_plus\") {\n      nonLinFunct = AliEMCALRecoUtils::kPi0MCv3;\n      isMC = kTRUE;\n    }\n  }\n\n  if(isMC) { \/\/no timing cuts when running on MC\n    timeMin = -1;\n    timeMax =  1e6;\n    timeCut =  1e6;\n  }\n\n  if (!evhand->InheritsFrom(\"AliESDInputHandler\"))\n    trackMatch = kFALSE;\n\n  AliAnalysisTaskSE *task = AddTaskEMCALTender(\n    distBC, recalibClus, recalcClusPos, nonLinearCorr,\n    remExotic, fidRegion, calibEnergy, calibTime, remBC, nonLinFunct, \n    reclusterize, seedthresh, cellthresh, clusterizer, trackMatch, updateCellOnly,\n    timeMin, timeMax, timeCut, pass);\n\n  return task;\n}\n<commit_msg>add more data sets to automatic configuration<commit_after>\/\/ $Id$\n\nAliAnalysisTaskSE *AddTaskEMCALTenderUsingDatasetDef(\n  const char *perstr  = \"LHC11h\",\n  const char *pass    = 0 \/*should not be needed*\/\n) \n{\n  AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n  if (!mgr)\n  {\n    Error(\"AddTaskEMCALTenderUsingDatasetDef\",\"No analysis manager found.\");\n    return 0;\n  }\n\n  AliVEventHandler *evhand = mgr->GetInputEventHandler();\n  if (!evhand) {\n    Error(\"AddTaskEMCALTenderUsingDatasetDef\", \"This task requires an input event handler\");\n    return NULL;\n  }\n\n  gROOT->LoadMacro(\"$ALICE_ROOT\/PWG\/EMCAL\/macros\/AddTaskEMCALTender.C\");\n\n  Bool_t distBC         = kTRUE;   \/\/distance to bad channel\n  Bool_t recalibClus    = kTRUE;   \/\/recalibrate cluster energy\n  Bool_t recalcClusPos  = kTRUE;   \/\/recalculate cluster position\n  Bool_t nonLinearCorr  = kTRUE;   \/\/apply non-linearity\n  Bool_t remExoticCell  = kTRUE;   \/\/remove exotic cells\n  Bool_t remExoticClus  = kTRUE;   \/\/remove exotic clusters\n  Bool_t fidRegion      = kFALSE;  \/\/apply fiducial cuts\n  Bool_t calibEnergy    = kTRUE;   \/\/calibrate energy\n  Bool_t calibTime      = kTRUE;   \/\/calibrate timing\n  Bool_t remBC          = kTRUE;   \/\/remove bad channels\n  UInt_t nonLinFunct    = AliEMCALRecoUtils::kBeamTestCorrected;\n  Bool_t reclusterize   = kFALSE;  \/\/reclusterize\n  Float_t seedthresh    = 0.100;   \/\/seed threshold\n  Float_t cellthresh    = 0.050;   \/\/cell threshold\n  UInt_t clusterizer    = AliEMCALRecParam::kClusterizerv2;\n  Bool_t trackMatch     = kTRUE;   \/\/track matching\n  Bool_t updateCellOnly = kFALSE;  \/\/only change if you run your own clusterizer task\n  Float_t timeMin       = -50e6;   \/\/minimum time of physical signal in a cell\/digit (s)\n  Float_t timeMax       =  50e6;   \/\/maximum time of physical signal in a cell\/digit (s)\n  Float_t timeCut       =   1e6;   \/\/maximum time difference between the digits inside EMC cluster (s)\n\n  Bool_t isMC = kFALSE;\n\n  TString period(perstr);\n  period.ToLower();\n  Printf(\"Configuring tender for run period: %s\",period.Data());\n\n  if (period == \"lhc11h\") {\n    trackMatch = kFALSE;\n    timeMin = -50e-9;\n    timeMax =  50e-9;\n    timeCut =  1e6;\n  }\n  else if (period == \"lhc12a15e\" || period == \"lhc12a15e_fix\" || \n\t   period == \"lhc12a17a_fix\" || period == \"lhc12a17b_fix\" || period == \"lhc12a17c_fix\" || period == \"lhc12a17d_fix\" || \n\t   period == \"lhc12a17e_fix\" || period == \"lhc12a17f_fix\" || period == \"lhc12a17g_fix\" || period == \"lhc12a17h_fix\" || \n\t   period == \"lhc12a17i_fix\") {\n    nonLinFunct = AliEMCALRecoUtils::kPi0MCv3;\n    isMC = kTRUE;\n  }\n  else if (period == \"lhc12a15a\") {\n    nonLinFunct = AliEMCALRecoUtils::kPi0MCv2;\n    isMC = kTRUE;\n  }\n  else if(period == \"lhc12a\" || period == \"lhc12b\" || period == \"lhc12c\" || period == \"lhc12d\" || period == \"lhc12e\" || period == \"lhc12f\" || period == \"lhc12g\" || period == \"lhc12h\" || period == \"lhc12i\") {\n    reclusterize = kTRUE;\n    seedthresh = 0.3;\n    cellthresh = 0.05;\n    timeMin = -50e-9;\n    timeMax =  50e-9;\n    timeCut =  1e6;\n  }\n  else if(period == \"lhc13b\" || period == \"lhc13c\" || period == \"lhc13d\" || period == \"lhc13e\" || period == \"lhc13f\" || period == \"lhc13g\" || \n\t  period == \"lhc13b4\" || period == \"lhc13b4_fix\" || period == \"lhc13b4_plus\") {\n    reclusterize = kTRUE;\n    seedthresh = 0.3;\n    cellthresh = 0.05;\n    if(period == \"lhc13b\" || period == \"lhc13c\" || period == \"lhc13d\" || period == \"lhc13e\" || period == \"lhc13f\" || period == \"lhc13g\") {\n      timeMin = -50e-9;\n      timeMax =  50e-9;\n      timeCut =  1e6;\n    }\n    else if(period == \"lhc13b4\" || period == \"lhc13b4_fix\" || period == \"lhc13b4_plus\") {\n      nonLinFunct = AliEMCALRecoUtils::kPi0MCv3;\n      isMC = kTRUE;\n    }\n  }\n\n  if(isMC) { \/\/no timing cuts when running on MC\n    timeMin = -1;\n    timeMax =  1e6;\n    timeCut =  1e6;\n  }\n\n  if (!evhand->InheritsFrom(\"AliESDInputHandler\"))\n    trackMatch = kFALSE;\n\n  AliAnalysisTaskSE *task = AddTaskEMCALTender(\n    distBC, recalibClus, recalcClusPos, nonLinearCorr,\n    remExoticCell, remExoticClus, fidRegion, calibEnergy, \n    calibTime, remBC, nonLinFunct, reclusterize, seedthresh, \n    cellthresh, clusterizer, trackMatch, updateCellOnly,\n    timeMin, timeMax, timeCut, pass);\n\n  return task;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Added function that initialize arrays Started to clean up the code by exporting the debugging tools in another file (retriever_test.cpp)<commit_after><|endoftext|>"}
{"text":"<commit_before>\/* fssfinder.cpp\n\nCopyright (c) 2015, Nikolaj Schlej. All rights reserved.\nThis program and the accompanying materials\nare licensed and made available under the terms and conditions of the BSD License\nwhich accompanies this distribution.  The full text of the license may be found at\nhttp:\/\/opensource.org\/licenses\/bsd-license.php\n\nTHE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.\n\n*\/\n\n#include \"ffsfinder.h\"\n\nUSTATUS FfsFinder::findHexPattern(const UModelIndex & index, const UByteArray & hexPattern, const UINT8 mode)\n{\n    \/\/TODO: use FfsUtils.\n\n    if (!index.isValid())\n        return U_SUCCESS;\n\n    if (hexPattern.isEmpty())\n        return U_INVALID_PARAMETER;\n\n    \/\/ Check for \"all substrings\" pattern\n    if (hexPattern.count('.') == hexPattern.length())\n        return U_SUCCESS;\n\n    bool hasChildren = (model->rowCount(index) > 0);\n    for (int i = 0; i < model->rowCount(index); i++) {\n        findHexPattern(index.child(i, index.column()), hexPattern, mode);\n    }\n\n    UByteArray data;\n    if (hasChildren) {\n        if (mode == SEARCH_MODE_HEADER)\n            data = model->header(index);\n        else if (mode == SEARCH_MODE_ALL)\n            data = model->header(index) + model->body(index);\n    }\n    else {\n        if (mode == SEARCH_MODE_HEADER)\n            data = model->header(index);\n        else if (mode == SEARCH_MODE_BODY)\n            data = model->body(index);\n        else\n            data = model->header(index) + model->body(index);\n    }\n\n    UString hexBody = UString(data.toHex());\n    QRegExp regexp = QRegExp(UString(hexPattern), Qt::CaseInsensitive);\n    INT32 offset = regexp.indexIn(hexBody);\n    while (offset >= 0) {\n        if (offset % 2 == 0) {\n            \/\/ For patterns that cross header|body boundary, skip patterns entirely located in body, since\n            \/\/ children search above has already found them.\n            if (!(hasChildren && mode == SEARCH_MODE_ALL && offset\/2 >= model->header(index).size())) {\n                msg(UString(\"Hex pattern \\\"\") + UString(hexPattern)\n                    + UString(\"\\\" found as \\\"\") + hexBody.mid(offset, hexPattern.length()).toUpper()\n                    + UString(\"\\\" in \") + model->name(index)\n                    + UString(\" (\") + model->name(model->parent(index))\n                    + usprintf(\") at %s-offset %02Xh\", mode == SEARCH_MODE_BODY ? \"body\" : \"header\", offset \/ 2),\n                    index);\n            }\n        }\n        offset = regexp.indexIn(hexBody, offset + 1);\n    }\n\n    return U_SUCCESS;\n}\n\nUSTATUS FfsFinder::findGuidPattern(const UModelIndex & index, const UByteArray & guidPattern, const UINT8 mode)\n{\n    if (guidPattern.isEmpty())\n        return U_INVALID_PARAMETER;\n\n    if (!index.isValid())\n        return U_SUCCESS;\n\n    bool hasChildren = (model->rowCount(index) > 0);\n    for (int i = 0; i < model->rowCount(index); i++) {\n        findGuidPattern(index.child(i, index.column()), guidPattern, mode);\n    }\n\n    UByteArray data;\n    if (hasChildren) {\n        if (mode != SEARCH_MODE_BODY)\n            data = model->header(index);\n    }\n    else {\n        if (mode == SEARCH_MODE_HEADER)\n            data.append(model->header(index));\n        else if (mode == SEARCH_MODE_BODY)\n            data.append(model->body(index));\n        else\n            data.append(model->header(index)).append(model->body(index));\n    }\n\n    UString hexBody = UString(data.toHex());\n    QList<UByteArray> list = guidPattern.split('-');\n    if (list.count() != 5)\n        return U_INVALID_PARAMETER;\n\n    UByteArray hexPattern;\n    \/\/ Reverse first GUID block\n    hexPattern.append(list.at(0).mid(6, 2));\n    hexPattern.append(list.at(0).mid(4, 2));\n    hexPattern.append(list.at(0).mid(2, 2));\n    hexPattern.append(list.at(0).mid(0, 2));\n    \/\/ Reverse second GUID block\n    hexPattern.append(list.at(1).mid(2, 2));\n    hexPattern.append(list.at(1).mid(0, 2));\n    \/\/ Reverse third GUID block\n    hexPattern.append(list.at(2).mid(2, 2));\n    hexPattern.append(list.at(2).mid(0, 2));\n    \/\/ Append fourth and fifth GUID blocks as is\n    hexPattern.append(list.at(3)).append(list.at(4));\n\n    \/\/ Check for \"all substrings\" pattern\n    if (hexPattern.count('.') == hexPattern.length())\n        return U_SUCCESS;\n\n    QRegExp regexp(UString(hexPattern), Qt::CaseInsensitive);\n    INT32 offset = regexp.indexIn(hexBody);\n    while (offset >= 0) {\n        if (offset % 2 == 0) {\n            msg(UString(\"GUID pattern \\\"\") + UString(guidPattern)\n                + UString(\"\\\" found as \\\"\") + hexBody.mid(offset, hexPattern.length()).toUpper()\n                + UString(\"\\\" in \") + model->name(index)\n                + UString(\" (\") + model->name(model->parent(index))\n                + usprintf(\") at %s-offset %02Xh\", mode == SEARCH_MODE_BODY ? \"body\" : \"header\", offset \/ 2),\n                index);\n        }\n        offset = regexp.indexIn(hexBody, offset + 1);\n    }\n\n    return U_SUCCESS;\n}\n\nUSTATUS FfsFinder::findTextPattern(const UModelIndex & index, const UString & pattern, const UINT8 mode, const bool unicode, const Qt::CaseSensitivity caseSensitive)\n{\n    if (pattern.isEmpty())\n        return U_INVALID_PARAMETER;\n\n    if (!index.isValid())\n        return U_SUCCESS;\n\n    bool hasChildren = (model->rowCount(index) > 0);\n    for (int i = 0; i < model->rowCount(index); i++) {\n        findTextPattern(index.child(i, index.column()), pattern, mode, unicode, caseSensitive);\n    }\n\n    UByteArray body;\n    if (hasChildren) {\n        if (mode != SEARCH_MODE_BODY)\n            body = model->header(index);\n    }\n    else {\n        if (mode == SEARCH_MODE_HEADER)\n            body.append(model->header(index));\n        else if (mode == SEARCH_MODE_BODY)\n            body.append(model->body(index));\n        else\n            body.append(model->header(index)).append(model->body(index));\n    }\n\n    UString data;\n    if (unicode)\n        data = UString::fromUtf16((const ushort*)body.constData(), body.length() \/ 2);\n    else\n        data = UString::fromLatin1((const char*)body.constData(), body.length());\n\n    int offset = -1;\n    while ((offset = data.indexOf(pattern, offset + 1, caseSensitive)) >= 0) {\n\n        msg((unicode ? UString(\"Unicode\") : UString(\"ASCII\")) + UString(\" text \\\"\") + UString(pattern)\n            + UString(\"\\\" found in \") + model->name(index)\n            + UString(\" (\") + model->name(model->parent(index))\n            + usprintf(\") at %s-offset %02Xh\", mode == SEARCH_MODE_BODY ? \"body\" : \"header\", (unicode ? offset * 2 : offset)),\n            index);\n    }\n\n    return U_SUCCESS;\n}\n<commit_msg>Print found item as \"parent\/child\" path (#203)<commit_after>\/* fssfinder.cpp\n\nCopyright (c) 2015, Nikolaj Schlej. All rights reserved.\nThis program and the accompanying materials\nare licensed and made available under the terms and conditions of the BSD License\nwhich accompanies this distribution.  The full text of the license may be found at\nhttp:\/\/opensource.org\/licenses\/bsd-license.php\n\nTHE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.\n\n*\/\n\n#include \"ffsfinder.h\"\n\nUSTATUS FfsFinder::findHexPattern(const UModelIndex & index, const UByteArray & hexPattern, const UINT8 mode)\n{\n    \/\/TODO: use FfsUtils.\n\n    if (!index.isValid())\n        return U_SUCCESS;\n\n    if (hexPattern.isEmpty())\n        return U_INVALID_PARAMETER;\n\n    \/\/ Check for \"all substrings\" pattern\n    if (hexPattern.count('.') == hexPattern.length())\n        return U_SUCCESS;\n\n    bool hasChildren = (model->rowCount(index) > 0);\n    for (int i = 0; i < model->rowCount(index); i++) {\n        findHexPattern(index.child(i, index.column()), hexPattern, mode);\n    }\n\n    UByteArray data;\n    if (hasChildren) {\n        if (mode == SEARCH_MODE_HEADER)\n            data = model->header(index);\n        else if (mode == SEARCH_MODE_ALL)\n            data = model->header(index) + model->body(index);\n    }\n    else {\n        if (mode == SEARCH_MODE_HEADER)\n            data = model->header(index);\n        else if (mode == SEARCH_MODE_BODY)\n            data = model->body(index);\n        else\n            data = model->header(index) + model->body(index);\n    }\n\n    UString hexBody = UString(data.toHex());\n    QRegExp regexp = QRegExp(UString(hexPattern), Qt::CaseInsensitive);\n    INT32 offset = regexp.indexIn(hexBody);\n    while (offset >= 0) {\n        if (offset % 2 == 0) {\n            \/\/ For patterns that cross header|body boundary, skip patterns entirely located in body, since\n            \/\/ children search above has already found them.\n            if (!(hasChildren && mode == SEARCH_MODE_ALL && offset\/2 >= model->header(index).size())) {\n                msg(UString(\"Hex pattern \\\"\") + UString(hexPattern)\n                    + UString(\"\\\" found as \\\"\") + hexBody.mid(offset, hexPattern.length()).toUpper()\n                    + UString(\"\\\" in \") + model->name(model->parent(index))\n                    + UString(\"\/\") + model->name(index)\n                    + usprintf(\" at %s-offset %02Xh\", mode == SEARCH_MODE_BODY ? \"body\" : \"header\", offset \/ 2),\n                    index);\n            }\n        }\n        offset = regexp.indexIn(hexBody, offset + 1);\n    }\n\n    return U_SUCCESS;\n}\n\nUSTATUS FfsFinder::findGuidPattern(const UModelIndex & index, const UByteArray & guidPattern, const UINT8 mode)\n{\n    if (guidPattern.isEmpty())\n        return U_INVALID_PARAMETER;\n\n    if (!index.isValid())\n        return U_SUCCESS;\n\n    bool hasChildren = (model->rowCount(index) > 0);\n    for (int i = 0; i < model->rowCount(index); i++) {\n        findGuidPattern(index.child(i, index.column()), guidPattern, mode);\n    }\n\n    UByteArray data;\n    if (hasChildren) {\n        if (mode != SEARCH_MODE_BODY)\n            data = model->header(index);\n    }\n    else {\n        if (mode == SEARCH_MODE_HEADER)\n            data.append(model->header(index));\n        else if (mode == SEARCH_MODE_BODY)\n            data.append(model->body(index));\n        else\n            data.append(model->header(index)).append(model->body(index));\n    }\n\n    UString hexBody = UString(data.toHex());\n    QList<UByteArray> list = guidPattern.split('-');\n    if (list.count() != 5)\n        return U_INVALID_PARAMETER;\n\n    UByteArray hexPattern;\n    \/\/ Reverse first GUID block\n    hexPattern.append(list.at(0).mid(6, 2));\n    hexPattern.append(list.at(0).mid(4, 2));\n    hexPattern.append(list.at(0).mid(2, 2));\n    hexPattern.append(list.at(0).mid(0, 2));\n    \/\/ Reverse second GUID block\n    hexPattern.append(list.at(1).mid(2, 2));\n    hexPattern.append(list.at(1).mid(0, 2));\n    \/\/ Reverse third GUID block\n    hexPattern.append(list.at(2).mid(2, 2));\n    hexPattern.append(list.at(2).mid(0, 2));\n    \/\/ Append fourth and fifth GUID blocks as is\n    hexPattern.append(list.at(3)).append(list.at(4));\n\n    \/\/ Check for \"all substrings\" pattern\n    if (hexPattern.count('.') == hexPattern.length())\n        return U_SUCCESS;\n\n    QRegExp regexp(UString(hexPattern), Qt::CaseInsensitive);\n    INT32 offset = regexp.indexIn(hexBody);\n    while (offset >= 0) {\n        if (offset % 2 == 0) {\n            msg(UString(\"GUID pattern \\\"\") + UString(guidPattern)\n                + UString(\"\\\" found as \\\"\") + hexBody.mid(offset, hexPattern.length()).toUpper()\n                + UString(\"\\\" in \") + model->name(model->parent(index))\n                + UString(\"\/\") + model->name(index)\n                + usprintf(\" at %s-offset %02Xh\", mode == SEARCH_MODE_BODY ? \"body\" : \"header\", offset \/ 2),\n                index);\n        }\n        offset = regexp.indexIn(hexBody, offset + 1);\n    }\n\n    return U_SUCCESS;\n}\n\nUSTATUS FfsFinder::findTextPattern(const UModelIndex & index, const UString & pattern, const UINT8 mode, const bool unicode, const Qt::CaseSensitivity caseSensitive)\n{\n    if (pattern.isEmpty())\n        return U_INVALID_PARAMETER;\n\n    if (!index.isValid())\n        return U_SUCCESS;\n\n    bool hasChildren = (model->rowCount(index) > 0);\n    for (int i = 0; i < model->rowCount(index); i++) {\n        findTextPattern(index.child(i, index.column()), pattern, mode, unicode, caseSensitive);\n    }\n\n    UByteArray body;\n    if (hasChildren) {\n        if (mode != SEARCH_MODE_BODY)\n            body = model->header(index);\n    }\n    else {\n        if (mode == SEARCH_MODE_HEADER)\n            body.append(model->header(index));\n        else if (mode == SEARCH_MODE_BODY)\n            body.append(model->body(index));\n        else\n            body.append(model->header(index)).append(model->body(index));\n    }\n\n    UString data;\n    if (unicode)\n        data = UString::fromUtf16((const ushort*)body.constData(), body.length() \/ 2);\n    else\n        data = UString::fromLatin1((const char*)body.constData(), body.length());\n\n    int offset = -1;\n    while ((offset = data.indexOf(pattern, offset + 1, caseSensitive)) >= 0) {\n\n        msg((unicode ? UString(\"Unicode\") : UString(\"ASCII\")) + UString(\" text \\\"\") + UString(pattern)\n            + UString(\"\\\" in \") + model->name(model->parent(index))\n            + UString(\"\/\") + model->name(index)\n            + usprintf(\" at %s-offset %02Xh\", mode == SEARCH_MODE_BODY ? \"body\" : \"header\", (unicode ? offset * 2 : offset)),\n            index);\n    }\n\n    return U_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <cstdlib>\n#include <unistd.h>\n#include \"Shell.h\"\n#include \"Commands.h\"\n#include <cstdio>\n#include <cstring>\n#include <sys\/types.h>\n#include <sys\/wait.h>\nusing namespace std;\n\nCommands::Commands(char c[]){\n    strcpy(str, c);\n}\n\nbool Commands::execute() {\n    pid_t child;\n    int status;\n    \n    char* argv[100];\n    parse(argv);\n    \n    child = fork();\n    if (child < 0) {\n        \/\/ ERROR FORKING CHILD\n        return false;\n    }\n    else if (child == 0) {\n        \/\/ USER ENTERED EXIT COMMAND\n        \/\/ FIX ME\n        if(strcmp(argv[0], \"exit\")){\n            exit(0);\n        }\n        execvp(argv[0], argv);\n        \n        \/\/ EXECVP SHOULD NOT CONTINUE HERE\n        return false;\n    }\n    else if (child > 0) {\n        while(wait(&status) != child);\n        return true;\n    }\n    else {\n        \/\/ SOMETHING ELSE WENT WRONG\n        return false;\n    }\n}\n\nvoid Commands::parse(char* argv[]){\n    \/\/ char str[] =\"- This, a sample string.\";\n    char* pch;\n    pch = strtok (str,\" \");\n    unsigned i = 0;\n    while (pch != NULL)\n    {\n        argv[i] = pch;\n        pch = strtok (NULL, \" \");\n        i++;\n    }\n}<commit_msg>Delete Commands.cpp<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#ifndef INCLUDED_SVX_SOURCE_SIDEBAR_LINE_LINEPROPERTYPANEL_HXX\n#define INCLUDED_SVX_SOURCE_SIDEBAR_LINE_LINEPROPERTYPANEL_HXX\n\n#include <svx\/xdash.hxx>\n#include <vcl\/ctrl.hxx>\n#include <sfx2\/sidebar\/SidebarPanelBase.hxx>\n#include <sfx2\/sidebar\/ControllerItem.hxx>\n#include <vcl\/fixed.hxx>\n#include <vcl\/field.hxx>\n#include <boost\/scoped_ptr.hpp>\n#include <boost\/scoped_array.hpp>\n#include <svx\/sidebar\/ColorPopup.hxx>\n#include <svx\/sidebar\/PanelLayout.hxx>\n#include <svx\/xtable.hxx>\n#include \"LineWidthPopup.hxx\"\n\n\nnamespace svx { class ToolboxButtonColorUpdater; }\nclass SvxLineColorPage;\nclass SvxLineStylePage;\nclass SvxLineWidthPage;\nclass XLineStyleItem;\nclass XLineDashItem;\nclass XLineStartItem;\nclass XLineEndItem;\nclass XLineEndList;\nclass XDashList;\nclass ListBox;\nclass ToolBox;\nclass FloatingWindow;\n\nnamespace {\n    #define SIDEBAR_LINE_WIDTH_GLOBAL_VALUE \"PopupPanel_LineWidth\"\n} \/\/end of anonymous namespace\n\nnamespace svx { namespace sidebar {\n\nclass PopupContainer;\nclass ColorPopup;\nclass LineWidthControl;\n\n\nclass LinePropertyPanel\n:   public PanelLayout,\n    public ::sfx2::sidebar::ControllerItem::ItemUpdateReceiverInterface\n{\nprivate:\n    friend class ::SvxLineStylePage;\n    friend class ::SvxLineWidthPage;\n\npublic:\n    static LinePropertyPanel* Create(\n        Window* pParent,\n        const cssu::Reference<css::frame::XFrame>& rxFrame,\n        SfxBindings* pBindings);\n\n    virtual void DataChanged(\n        const DataChangedEvent& rEvent) SAL_OVERRIDE;\n\n    virtual void NotifyItemUpdate(\n        const sal_uInt16 nSId,\n        const SfxItemState eState,\n        const SfxPoolItem* pState,\n        const bool bIsEnabled) SAL_OVERRIDE;\n\n    SfxBindings* GetBindings();\n\n    void SetWidth(long nWidth);\n    void SetWidthIcon(int n);\n    void SetWidthIcon();\n\n    void EndLineWidthPopupMode (void);\n\nprivate:\n    \/\/ui controls\n    FixedText*                        mpFTWidth;\n    ToolBox*                          mpTBWidth;\n    FixedText*                        mpFTColor;\n    ToolBox*                          mpTBColor;\n    FixedText*                        mpFTStyle;\n    ListBox*                          mpLBStyle;\n    FixedText*                        mpFTTrancparency;\n    MetricField*                      mpMFTransparent;\n    FixedText*                        mpFTArrow;\n    ListBox*                          mpLBStart;\n    ListBox*                          mpLBEnd;\n    FixedText*                        mpFTEdgeStyle;\n    ListBox*                          mpLBEdgeStyle;\n    FixedText*                        mpFTCapStyle;\n    ListBox*                          mpLBCapStyle;\n\n    \/\/ControllerItem\n    ::sfx2::sidebar::ControllerItem                         maStyleControl;\n    ::sfx2::sidebar::ControllerItem                         maDashControl;\n    ::sfx2::sidebar::ControllerItem                         maWidthControl;\n    ::sfx2::sidebar::ControllerItem                         maColorControl;\n    ::sfx2::sidebar::ControllerItem                         maStartControl;\n    ::sfx2::sidebar::ControllerItem                         maEndControl;\n    ::sfx2::sidebar::ControllerItem                         maLineEndListControl;\n    ::sfx2::sidebar::ControllerItem                         maLineStyleListControl;\n    ::sfx2::sidebar::ControllerItem                         maTransControl;\n    ::sfx2::sidebar::ControllerItem                         maEdgeStyle;\n    ::sfx2::sidebar::ControllerItem                         maCapStyle;\n\n    Color                                                   maColor;\n    ::boost::scoped_ptr< ::svx::ToolboxButtonColorUpdater > mpColorUpdater;\n    ::boost::scoped_ptr< XLineStyleItem >                   mpStyleItem;\n    ::boost::scoped_ptr< XLineDashItem >                    mpDashItem;\n    sal_uInt16                                              mnTrans;\n    SfxMapUnit                                              meMapUnit;\n    sal_Int32                                               mnWidthCoreValue;\n    XLineEndListRef                                         mxLineEndList;\n    XDashListRef                                            mxLineStyleList;\n    ::boost::scoped_ptr< XLineStartItem >                   mpStartItem;\n    ::boost::scoped_ptr< XLineEndItem >                     mpEndItem;\n\n    \/\/popup windows\n    ColorPopup maColorPopup;\n    LineWidthPopup maLineWidthPopup;\n\n    \/\/ images from ressource\n    Image                                                   maIMGColor;\n    Image                                                   maIMGNone;\n\n    \/\/ multi-images\n    ::boost::scoped_array<Image>                            mpIMGWidthIcon;\n\n    cssu::Reference< css::frame::XFrame >                   mxFrame;\n    SfxBindings*                                            mpBindings;\n\n    \/\/\/ bitfield\n    bool                mbColorAvailable : 1;\n    bool                mbWidthValuable : 1;\n\n    void SetupIcons(void);\n    void Initialize();\n    void FillLineEndList();\n    void FillLineStyleList();\n    void SelectEndStyle(bool bStart);\n    void SelectLineStyle();\n\n    DECL_LINK(ImplWidthPopupModeEndHdl, FloatingWindow* );\n    DECL_LINK(ToolboxColorSelectHdl, ToolBox*);\n    DECL_LINK(ChangeLineStyleHdl, void*);\n    DECL_LINK(ToolboxWidthSelectHdl, ToolBox*);\n    DECL_LINK(ChangeTransparentHdl , void *);\n    DECL_LINK(ChangeStartHdl, void *);\n    DECL_LINK(ChangeEndHdl, void *);\n    DECL_LINK(ChangeEdgeStyleHdl, void *);\n    DECL_LINK(ChangeCapStyleHdl, void *);\n\n    \/\/ constructor\/destuctor\n    LinePropertyPanel(\n        Window* pParent,\n        const cssu::Reference<css::frame::XFrame>& rxFrame,\n        SfxBindings* pBindings);\n    virtual ~LinePropertyPanel(void);\n\n    void SetColor(\n        const OUString& rsColorName,\n        const Color aColor);\n\n    PopupControl* CreateColorPopupControl (PopupContainer* pParent);\n    PopupControl* CreateLineWidthPopupControl (PopupContainer* pParent);\n};\n\n} } \/\/ end of namespace svx::sidebar\n\n#endif\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>remove some useless lines<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_SVX_SOURCE_SIDEBAR_LINE_LINEPROPERTYPANEL_HXX\n#define INCLUDED_SVX_SOURCE_SIDEBAR_LINE_LINEPROPERTYPANEL_HXX\n\n#include <svx\/xdash.hxx>\n#include <vcl\/ctrl.hxx>\n#include <sfx2\/sidebar\/SidebarPanelBase.hxx>\n#include <sfx2\/sidebar\/ControllerItem.hxx>\n#include <vcl\/fixed.hxx>\n#include <vcl\/field.hxx>\n#include <boost\/scoped_ptr.hpp>\n#include <boost\/scoped_array.hpp>\n#include <svx\/sidebar\/ColorPopup.hxx>\n#include <svx\/sidebar\/PanelLayout.hxx>\n#include <svx\/xtable.hxx>\n#include \"LineWidthPopup.hxx\"\n\n\nnamespace svx { class ToolboxButtonColorUpdater; }\nclass XLineStyleItem;\nclass XLineDashItem;\nclass XLineStartItem;\nclass XLineEndItem;\nclass XLineEndList;\nclass XDashList;\nclass ListBox;\nclass ToolBox;\nclass FloatingWindow;\n\nnamespace {\n    #define SIDEBAR_LINE_WIDTH_GLOBAL_VALUE \"PopupPanel_LineWidth\"\n} \/\/end of anonymous namespace\n\nnamespace svx { namespace sidebar {\n\nclass PopupContainer;\nclass ColorPopup;\nclass LineWidthControl;\n\n\nclass LinePropertyPanel\n:   public PanelLayout,\n    public ::sfx2::sidebar::ControllerItem::ItemUpdateReceiverInterface\n{\npublic:\n    static LinePropertyPanel* Create(\n        Window* pParent,\n        const cssu::Reference<css::frame::XFrame>& rxFrame,\n        SfxBindings* pBindings);\n\n    virtual void DataChanged(\n        const DataChangedEvent& rEvent) SAL_OVERRIDE;\n\n    virtual void NotifyItemUpdate(\n        const sal_uInt16 nSId,\n        const SfxItemState eState,\n        const SfxPoolItem* pState,\n        const bool bIsEnabled) SAL_OVERRIDE;\n\n    SfxBindings* GetBindings();\n\n    void SetWidth(long nWidth);\n    void SetWidthIcon(int n);\n    void SetWidthIcon();\n\n    void EndLineWidthPopupMode (void);\n\nprivate:\n    \/\/ui controls\n    FixedText*                        mpFTWidth;\n    ToolBox*                          mpTBWidth;\n    FixedText*                        mpFTColor;\n    ToolBox*                          mpTBColor;\n    FixedText*                        mpFTStyle;\n    ListBox*                          mpLBStyle;\n    FixedText*                        mpFTTrancparency;\n    MetricField*                      mpMFTransparent;\n    FixedText*                        mpFTArrow;\n    ListBox*                          mpLBStart;\n    ListBox*                          mpLBEnd;\n    FixedText*                        mpFTEdgeStyle;\n    ListBox*                          mpLBEdgeStyle;\n    FixedText*                        mpFTCapStyle;\n    ListBox*                          mpLBCapStyle;\n\n    \/\/ControllerItem\n    ::sfx2::sidebar::ControllerItem                         maStyleControl;\n    ::sfx2::sidebar::ControllerItem                         maDashControl;\n    ::sfx2::sidebar::ControllerItem                         maWidthControl;\n    ::sfx2::sidebar::ControllerItem                         maColorControl;\n    ::sfx2::sidebar::ControllerItem                         maStartControl;\n    ::sfx2::sidebar::ControllerItem                         maEndControl;\n    ::sfx2::sidebar::ControllerItem                         maLineEndListControl;\n    ::sfx2::sidebar::ControllerItem                         maLineStyleListControl;\n    ::sfx2::sidebar::ControllerItem                         maTransControl;\n    ::sfx2::sidebar::ControllerItem                         maEdgeStyle;\n    ::sfx2::sidebar::ControllerItem                         maCapStyle;\n\n    Color                                                   maColor;\n    ::boost::scoped_ptr< ::svx::ToolboxButtonColorUpdater > mpColorUpdater;\n    ::boost::scoped_ptr< XLineStyleItem >                   mpStyleItem;\n    ::boost::scoped_ptr< XLineDashItem >                    mpDashItem;\n    sal_uInt16                                              mnTrans;\n    SfxMapUnit                                              meMapUnit;\n    sal_Int32                                               mnWidthCoreValue;\n    XLineEndListRef                                         mxLineEndList;\n    XDashListRef                                            mxLineStyleList;\n    ::boost::scoped_ptr< XLineStartItem >                   mpStartItem;\n    ::boost::scoped_ptr< XLineEndItem >                     mpEndItem;\n\n    \/\/popup windows\n    ColorPopup maColorPopup;\n    LineWidthPopup maLineWidthPopup;\n\n    \/\/ images from ressource\n    Image                                                   maIMGColor;\n    Image                                                   maIMGNone;\n\n    \/\/ multi-images\n    ::boost::scoped_array<Image>                            mpIMGWidthIcon;\n\n    cssu::Reference< css::frame::XFrame >                   mxFrame;\n    SfxBindings*                                            mpBindings;\n\n    \/\/\/ bitfield\n    bool                mbColorAvailable : 1;\n    bool                mbWidthValuable : 1;\n\n    void SetupIcons(void);\n    void Initialize();\n    void FillLineEndList();\n    void FillLineStyleList();\n    void SelectEndStyle(bool bStart);\n    void SelectLineStyle();\n\n    DECL_LINK(ImplWidthPopupModeEndHdl, FloatingWindow* );\n    DECL_LINK(ToolboxColorSelectHdl, ToolBox*);\n    DECL_LINK(ChangeLineStyleHdl, void*);\n    DECL_LINK(ToolboxWidthSelectHdl, ToolBox*);\n    DECL_LINK(ChangeTransparentHdl , void *);\n    DECL_LINK(ChangeStartHdl, void *);\n    DECL_LINK(ChangeEndHdl, void *);\n    DECL_LINK(ChangeEdgeStyleHdl, void *);\n    DECL_LINK(ChangeCapStyleHdl, void *);\n\n    \/\/ constructor\/destuctor\n    LinePropertyPanel(\n        Window* pParent,\n        const cssu::Reference<css::frame::XFrame>& rxFrame,\n        SfxBindings* pBindings);\n    virtual ~LinePropertyPanel(void);\n\n    void SetColor(\n        const OUString& rsColorName,\n        const Color aColor);\n\n    PopupControl* CreateColorPopupControl (PopupContainer* pParent);\n    PopupControl* CreateLineWidthPopupControl (PopupContainer* pParent);\n};\n\n} } \/\/ end of namespace svx::sidebar\n\n#endif\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before>#include <QPainter>\n#include \"Data\/LevelObject.h\"\n#include \"MapItem.h\"\n\nMapItem::MapItem(LevelObject *obj, QGraphicsItem *parent)\n    : QGraphicsItem(parent)\n    , obj_(obj)\n{\n    Q_ASSERT(obj);\n    Q_ASSERT(!obj->parent());\n\n    obj->setParent(this);\n    setPos(obj->position());\n    connect(obj, SIGNAL(positionChanged(QPointF)),\n            this, SLOT(onPositionChanged(QPointF)));\n}\n\nQRectF MapItem::boundingRect() const\n{\n    QSizeF size = obj_->image().size();\n    if (size.isEmpty())\n        size = QSizeF(100, 50);\n\n    return QRectF(-size.width() \/ 2, -size.height() \/ 2,\n                  size.width(), size.height());\n}\n\nvoid MapItem::paint(QPainter *painter, const QStyleOptionGraphicsItem *option, QWidget *widget)\n{\n    Q_UNUSED(option);\n    Q_UNUSED(widget);\n\n    QRectF rect = boundingRect();\n\n    \/\/painter->drawImage(rect.topLeft(), obj_->image());\n    painter->save();\n    QTransform transf = painter->transform();\n    bool flipX = obj_->flipX();\n    bool flipY = obj_->flipY();\n    transf.scale(flipX ? -1 : 1, flipY ? -1 : 1);\n    painter->setTransform(transf);\n    QImage image = obj_->image();\n    painter->drawImage(rect.topLeft(),\n                       image);\n    painter->restore();\n\n    if (selected_) {\n        painter->setPen(Qt::DashLine);\n        painter->drawRect(rect);\n    } else if (active_) {\n        painter->setPen(Qt::DotLine);\n        painter->drawRect(rect);\n    }\n}\n\nvoid MapItem::setActive(bool active)\n{\n    if (active_ != active) {\n        active_ = active;\n        update();\n        emit activeChanged(active);\n    }\n}\n\nvoid MapItem::setSelected(bool selected)\n{\n    if (selected_ != selected) {\n        selected_ = selected;\n        update();\n        emit selectedChanged(selected);\n    }\n}\n\nvoid MapItem::onPositionChanged(const QPointF &pos)\n{\n    setPos(pos);\n}\n<commit_msg>Optimize non-flipped draw<commit_after>#include <QPainter>\n#include \"Data\/LevelObject.h\"\n#include \"MapItem.h\"\n\nMapItem::MapItem(LevelObject *obj, QGraphicsItem *parent)\n    : QGraphicsItem(parent)\n    , obj_(obj)\n{\n    Q_ASSERT(obj);\n    Q_ASSERT(!obj->parent());\n\n    obj->setParent(this);\n    setPos(obj->position());\n    connect(obj, SIGNAL(positionChanged(QPointF)),\n            this, SLOT(onPositionChanged(QPointF)));\n}\n\nQRectF MapItem::boundingRect() const\n{\n    QSizeF size = obj_->image().size();\n    if (size.isEmpty())\n        size = QSizeF(100, 50);\n\n    return QRectF(-size.width() \/ 2, -size.height() \/ 2,\n                  size.width(), size.height());\n}\n\nvoid MapItem::paint(QPainter *painter, const QStyleOptionGraphicsItem *option, QWidget *widget)\n{\n    Q_UNUSED(option);\n    Q_UNUSED(widget);\n\n    QRectF rect = boundingRect();\n\n    bool flipX = obj_->flipX();\n    bool flipY = obj_->flipY();\n    if (!flipX && !flipY) {\n        painter->drawImage(rect.topLeft(), obj_->image());\n    } else {\n        painter->save();\n        QTransform transf = painter->transform();\n        transf.scale(flipX ? -1 : 1, flipY ? -1 : 1);\n        painter->setTransform(transf);\n        QImage image = obj_->image();\n        painter->drawImage(rect.topLeft(), image);\n        painter->restore();\n    }\n\n    if (selected_) {\n        painter->setPen(Qt::DashLine);\n        painter->drawRect(rect);\n    } else if (active_) {\n        painter->setPen(Qt::DotLine);\n        painter->drawRect(rect);\n    }\n}\n\nvoid MapItem::setActive(bool active)\n{\n    if (active_ != active) {\n        active_ = active;\n        update();\n        emit activeChanged(active);\n    }\n}\n\nvoid MapItem::setSelected(bool selected)\n{\n    if (selected_ != selected) {\n        selected_ = selected;\n        update();\n        emit selectedChanged(selected);\n    }\n}\n\nvoid MapItem::onPositionChanged(const QPointF &pos)\n{\n    setPos(pos);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2017 ASMlover. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions\n\/\/ are met:\n\/\/\n\/\/  * Redistributions of source code must retain the above copyright\n\/\/    notice, this list ofconditions and the following disclaimer.\n\/\/\n\/\/  * Redistributions in binary form must reproduce the above copyright\n\/\/    notice, this list of conditions and the following disclaimer in\n\/\/    the documentation and\/or other materialsprovided with the\n\/\/    distribution.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n\/\/ FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n\/\/ COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n\/\/ INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n\/\/ BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\/\/ LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\/\/ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n\/\/ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n\/\/ ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n#include <algorithm>\n#include <Chaos\/Platform.h>\n#include <Chaos\/Types.h>\n#include <Chaos\/Logging\/Logging.h>\n#include <Neptune\/Kern\/NetOps.h>\n#include <Neptune\/IgnoreSigPipe.h>\n#include <Neptune\/Channel.h>\n#include <Neptune\/Poller.h>\n#include <Neptune\/TimerQueue.h>\n#include <Neptune\/WakeupSignaler.h>\n#include <Neptune\/EventLoop.h>\n\nnamespace Neptune {\n\n__chaos_tl EventLoop* t_loopthread = nullptr;\nconst int kPollMicrosecond = 10000;\n\nNeptune::IgnoreSigPipe g_ignore_sigpipe;\n\nEventLoop::EventLoop(void)\n  : tid_(Chaos::CurrentThread::get_tid())\n  , poller_(Poller::get_poller(this))\n  , timer_queue_(new TimerQueue(this))\n  , wakeup_(new WakeupSignaler())\n  , wakeup_channel_(new Channel(this, wakeup_->get_reader()))\n{\n  CHAOSLOG_DEBUG << \"EventLoop::EventLoop - created \" << this << \" in thread \" << tid_;\n  if (t_loopthread)\n    CHAOSLOG_SYSFATAL << \"EventLoop::EventLoop - another EventLoop \" << t_loopthread << \" exists in thread \" << tid_;\n  else\n    t_loopthread = this;\n\n  wakeup_channel_->bind_read_functor(std::bind(&EventLoop::do_handle_read, this));\n  wakeup_channel_->enabled_reading();\n\n#if defined(CHAOS_POSIX)\n  CHAOS_UNUSED(init_);\n#endif\n}\n\nEventLoop::~EventLoop(void) {\n  CHAOSLOG_DEBUG << \"EventLoop::~EventLoop - \" << this << \" of thread \" << tid_\n    << \" destructs in thread \" << Chaos::CurrentThread::get_tid();\n\n  wakeup_channel_->disabled_all();\n  wakeup_channel_->remove();\n  t_loopthread = nullptr;\n}\n\nvoid EventLoop::loop(void) {\n  CHAOS_CHECK(!looping_, \"event loop should not running\");\n  assert_in_loopthread();\n\n  looping_ = true;\n  quit_ = false;\n  CHAOSLOG_TRACE << \"EventLoop::loop - \" << this << \" start looping\";\n\n  while (!quit_) {\n    active_channels_.clear();\n    poll_return_time_ = poller_->poll(kPollMicrosecond, active_channels_);\n    ++iteration_;\n    if (Chaos::Logger::get_loglevel() <= Chaos::LoggingLevel::LOGGINGLEVEL_TRACE)\n      debug_active_channels();\n\n    event_handling_ = true;\n    for (auto ch : active_channels_) {\n      current_active_channel_ = ch;\n      current_active_channel_->handle_event(poll_return_time_);\n    }\n    current_active_channel_ = nullptr;\n    event_handling_ = false;\n\n    do_pending_functors();\n#if !defined(CHAOS_LINUX)\n    timer_queue_->poll_timer();\n#endif\n  }\n  CHAOSLOG_TRACE << \"EventLoop::loop - \" << this << \" stop looping\";\n  looping_ = false;\n}\n\nvoid EventLoop::quit(void) {\n  quit_ = true;\n  if (!in_loopthread())\n    wakeup();\n}\n\nvoid EventLoop::wakeup(void) {\n  std::uint64_t one = 1;\n  int n = wakeup_->set_signal(&one, sizeof(one));\n  if (n != sizeof(one))\n    CHAOSLOG_ERROR << \"EventLoop::wakeup - writes \" << n << \" bytes instead of `8`\";\n}\n\nvoid EventLoop::cancel(Neptune::TimerID timerid) {\n  timer_queue_->cancel(timerid);\n}\n\nvoid EventLoop::update_channel(Channel* channel) {\n  CHAOS_CHECK(channel->get_loop() == this, \"channel operations should in self thread\");\n  assert_in_loopthread();\n  poller_->update_channel(channel);\n}\n\nvoid EventLoop::remove_channel(Channel* channel) {\n  CHAOS_CHECK(channel->get_loop() == this, \"channel operations should in self thread\");\n  assert_in_loopthread();\n\n  if (event_handling_) {\n    CHAOS_CHECK(current_active_channel_ == channel ||\n        std::find(active_channels_.begin(), active_channels_.end(), channel) == active_channels_.end(),\n        \"channel should be current thread or not in active channels list\");\n  }\n  poller_->remove_channel(channel);\n}\n\nbool EventLoop::has_channel(Channel* channel) {\n  CHAOS_CHECK(channel->get_loop() == this, \"channel operations should in self thread\");\n  assert_in_loopthread();\n  return poller_->has_channel(channel);\n}\n\nstd::size_t EventLoop::get_functor_count(void) const {\n  Chaos::ScopedLock<Chaos::Mutex> guard(mutex_);\n  return pending_functors_.size();\n}\n\nNeptune::TimerID EventLoop::run_at(Chaos::Timestamp time, const Neptune::TimerCallback& fn) {\n  return timer_queue_->add_timer(fn, time, 0.0);\n}\n\nNeptune::TimerID EventLoop::run_at(Chaos::Timestamp time, Neptune::TimerCallback&& fn) {\n  return timer_queue_->add_timer(std::move(fn), time, 0.0);\n}\n\nNeptune::TimerID EventLoop::run_after(double delay, const Neptune::TimerCallback& fn) {\n  Chaos::Timestamp time(Chaos::time_add(Chaos::Timestamp::now(), delay));\n  return run_at(time, fn);\n}\n\nNeptune::TimerID EventLoop::run_after(double delay, Neptune::TimerCallback&& fn) {\n  Chaos::Timestamp time(Chaos::time_add(Chaos::Timestamp::now(), delay));\n  return run_at(time, std::move(fn));\n}\n\nNeptune::TimerID EventLoop::run_every(double interval, const Neptune::TimerCallback& fn) {\n  Chaos::Timestamp time(Chaos::time_add(Chaos::Timestamp::now(), interval));\n  return timer_queue_->add_timer(fn, time, interval);\n}\n\nNeptune::TimerID EventLoop::run_every(double interval, Neptune::TimerCallback&& fn) {\n  Chaos::Timestamp time(Chaos::time_add(Chaos::Timestamp::now(), interval));\n  return timer_queue_->add_timer(std::move(fn), time, interval);\n}\n\nvoid EventLoop::run_in_loop(const PendFunction& fn) {\n  if (in_loopthread())\n    fn();\n  else\n    put_in_loop(fn);\n}\n\nvoid EventLoop::run_in_loop(PendFunction&& fn) {\n  if (in_loopthread())\n    fn();\n  else\n    put_in_loop(std::move(fn));\n}\n\nvoid EventLoop::put_in_loop(const PendFunction& fn) {\n  {\n    Chaos::ScopedLock<Chaos::Mutex> guard(mutex_);\n    pending_functors_.push_back(fn);\n  }\n\n  if (!in_loopthread() || calling_pending_functors_)\n    wakeup();\n}\n\nvoid EventLoop::put_in_loop(PendFunction&& fn) {\n  {\n    Chaos::ScopedLock<Chaos::Mutex> guard(mutex_);\n    pending_functors_.push_back(std::move(fn));\n  }\n\n  if (!in_loopthread() || calling_pending_functors_)\n    wakeup();\n}\n\nEventLoop* EventLoop::get_loop_in_currentthread(void) {\n  return t_loopthread;\n}\n\nvoid EventLoop::abort_not_in_loopthread(void) {\n  CHAOSLOG_SYSFATAL << \"EventLoop::abort_not_in_loopthread - \" << this\n    << \" was created in thread: \" << tid_\n    << \" current thread: \" << Chaos::CurrentThread::get_tid();\n}\n\nvoid EventLoop::do_handle_read(void) {\n  std::uint64_t one = 1;\n  int n = wakeup_->get_signal(sizeof(one), &one);\n  if (n != sizeof(one))\n    CHAOSLOG_ERROR << \"EventLoop::do_handle_read - reads \" << n << \" bytes instead of `8`\";\n}\n\nvoid EventLoop::do_pending_functors(void) {\n  std::vector<PendFunction> functors;\n\n  calling_pending_functors_ = true;\n  {\n    Chaos::ScopedLock<Chaos::Mutex> guard(mutex_);\n    functors.swap(pending_functors_);\n  }\n  for (auto& fn : functors)\n    fn();\n  calling_pending_functors_ = false;\n}\n\nvoid EventLoop::debug_active_channels(void) const {\n  for (auto ch : active_channels_)\n    CHAOSLOG_TRACE << \"EventLoop::debug_active_channels - {\" << ch->revents_to_string() << \"}\";\n}\n\n}\n<commit_msg>:construction: chore(eventloop): updated the coding style of event loop<commit_after>\/\/ Copyright (c) 2017 ASMlover. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions\n\/\/ are met:\n\/\/\n\/\/  * Redistributions of source code must retain the above copyright\n\/\/    notice, this list ofconditions and the following disclaimer.\n\/\/\n\/\/  * Redistributions in binary form must reproduce the above copyright\n\/\/    notice, this list of conditions and the following disclaimer in\n\/\/    the documentation and\/or other materialsprovided with the\n\/\/    distribution.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n\/\/ FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n\/\/ COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n\/\/ INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n\/\/ BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\/\/ LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\/\/ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n\/\/ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n\/\/ ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n#include <algorithm>\n#include <Chaos\/Platform.h>\n#include <Chaos\/Types.h>\n#include <Chaos\/Logging\/Logging.h>\n#include <Neptune\/Kern\/NetOps.h>\n#include <Neptune\/IgnoreSigPipe.h>\n#include <Neptune\/Channel.h>\n#include <Neptune\/Poller.h>\n#include <Neptune\/TimerQueue.h>\n#include <Neptune\/WakeupSignaler.h>\n#include <Neptune\/EventLoop.h>\n\nnamespace Neptune {\n\n__chaos_tl EventLoop* t_loopthread = nullptr;\nconst int kPollMicrosecond = 10000;\n\nNeptune::IgnoreSigPipe g_ignore_sigpipe;\n\nEventLoop::EventLoop(void)\n  : tid_(Chaos::CurrentThread::get_tid())\n  , poller_(Poller::get_poller(this))\n  , timer_queue_(new TimerQueue(this))\n  , wakeup_(new WakeupSignaler())\n  , wakeup_channel_(new Channel(this, wakeup_->get_reader())) {\n  CHAOSLOG_DEBUG << \"EventLoop::EventLoop - created \" << this << \" in thread \" << tid_;\n  if (t_loopthread)\n    CHAOSLOG_SYSFATAL << \"EventLoop::EventLoop - another EventLoop \" << t_loopthread << \" exists in thread \" << tid_;\n  else\n    t_loopthread = this;\n\n  wakeup_channel_->bind_read_functor(std::bind(&EventLoop::do_handle_read, this));\n  wakeup_channel_->enabled_reading();\n\n#if defined(CHAOS_POSIX)\n  CHAOS_UNUSED(init_);\n#endif\n}\n\nEventLoop::~EventLoop(void) {\n  CHAOSLOG_DEBUG << \"EventLoop::~EventLoop - \" << this << \" of thread \" << tid_\n    << \" destructs in thread \" << Chaos::CurrentThread::get_tid();\n\n  wakeup_channel_->disabled_all();\n  wakeup_channel_->remove();\n  t_loopthread = nullptr;\n}\n\nvoid EventLoop::loop(void) {\n  CHAOS_CHECK(!looping_, \"event loop should not running\");\n  assert_in_loopthread();\n\n  looping_ = true;\n  quit_ = false;\n  CHAOSLOG_TRACE << \"EventLoop::loop - \" << this << \" start looping\";\n\n  while (!quit_) {\n    active_channels_.clear();\n    poll_return_time_ = poller_->poll(kPollMicrosecond, active_channels_);\n    ++iteration_;\n    if (Chaos::Logger::get_loglevel() <= Chaos::LoggingLevel::LOGGINGLEVEL_TRACE)\n      debug_active_channels();\n\n    event_handling_ = true;\n    for (auto ch : active_channels_) {\n      current_active_channel_ = ch;\n      current_active_channel_->handle_event(poll_return_time_);\n    }\n    current_active_channel_ = nullptr;\n    event_handling_ = false;\n\n    do_pending_functors();\n#if !defined(CHAOS_LINUX)\n    timer_queue_->poll_timer();\n#endif\n  }\n  CHAOSLOG_TRACE << \"EventLoop::loop - \" << this << \" stop looping\";\n  looping_ = false;\n}\n\nvoid EventLoop::quit(void) {\n  quit_ = true;\n  if (!in_loopthread())\n    wakeup();\n}\n\nvoid EventLoop::wakeup(void) {\n  std::uint64_t one = 1;\n  int n = wakeup_->set_signal(&one, sizeof(one));\n  if (n != sizeof(one))\n    CHAOSLOG_ERROR << \"EventLoop::wakeup - writes \" << n << \" bytes instead of `8`\";\n}\n\nvoid EventLoop::cancel(Neptune::TimerID timerid) {\n  timer_queue_->cancel(timerid);\n}\n\nvoid EventLoop::update_channel(Channel* channel) {\n  CHAOS_CHECK(channel->get_loop() == this, \"channel operations should in self thread\");\n  assert_in_loopthread();\n  poller_->update_channel(channel);\n}\n\nvoid EventLoop::remove_channel(Channel* channel) {\n  CHAOS_CHECK(channel->get_loop() == this, \"channel operations should in self thread\");\n  assert_in_loopthread();\n\n  if (event_handling_) {\n    CHAOS_CHECK(current_active_channel_ == channel ||\n        std::find(active_channels_.begin(), active_channels_.end(), channel) == active_channels_.end(),\n        \"channel should be current thread or not in active channels list\");\n  }\n  poller_->remove_channel(channel);\n}\n\nbool EventLoop::has_channel(Channel* channel) {\n  CHAOS_CHECK(channel->get_loop() == this, \"channel operations should in self thread\");\n  assert_in_loopthread();\n  return poller_->has_channel(channel);\n}\n\nstd::size_t EventLoop::get_functor_count(void) const {\n  Chaos::ScopedLock<Chaos::Mutex> guard(mutex_);\n  return pending_functors_.size();\n}\n\nNeptune::TimerID EventLoop::run_at(Chaos::Timestamp time, const Neptune::TimerCallback& fn) {\n  return timer_queue_->add_timer(fn, time, 0.0);\n}\n\nNeptune::TimerID EventLoop::run_at(Chaos::Timestamp time, Neptune::TimerCallback&& fn) {\n  return timer_queue_->add_timer(std::move(fn), time, 0.0);\n}\n\nNeptune::TimerID EventLoop::run_after(double delay, const Neptune::TimerCallback& fn) {\n  Chaos::Timestamp time(Chaos::time_add(Chaos::Timestamp::now(), delay));\n  return run_at(time, fn);\n}\n\nNeptune::TimerID EventLoop::run_after(double delay, Neptune::TimerCallback&& fn) {\n  Chaos::Timestamp time(Chaos::time_add(Chaos::Timestamp::now(), delay));\n  return run_at(time, std::move(fn));\n}\n\nNeptune::TimerID EventLoop::run_every(double interval, const Neptune::TimerCallback& fn) {\n  Chaos::Timestamp time(Chaos::time_add(Chaos::Timestamp::now(), interval));\n  return timer_queue_->add_timer(fn, time, interval);\n}\n\nNeptune::TimerID EventLoop::run_every(double interval, Neptune::TimerCallback&& fn) {\n  Chaos::Timestamp time(Chaos::time_add(Chaos::Timestamp::now(), interval));\n  return timer_queue_->add_timer(std::move(fn), time, interval);\n}\n\nvoid EventLoop::run_in_loop(const PendFunction& fn) {\n  if (in_loopthread())\n    fn();\n  else\n    put_in_loop(fn);\n}\n\nvoid EventLoop::run_in_loop(PendFunction&& fn) {\n  if (in_loopthread())\n    fn();\n  else\n    put_in_loop(std::move(fn));\n}\n\nvoid EventLoop::put_in_loop(const PendFunction& fn) {\n  {\n    Chaos::ScopedLock<Chaos::Mutex> guard(mutex_);\n    pending_functors_.push_back(fn);\n  }\n\n  if (!in_loopthread() || calling_pending_functors_)\n    wakeup();\n}\n\nvoid EventLoop::put_in_loop(PendFunction&& fn) {\n  {\n    Chaos::ScopedLock<Chaos::Mutex> guard(mutex_);\n    pending_functors_.push_back(std::move(fn));\n  }\n\n  if (!in_loopthread() || calling_pending_functors_)\n    wakeup();\n}\n\nEventLoop* EventLoop::get_loop_in_currentthread(void) {\n  return t_loopthread;\n}\n\nvoid EventLoop::abort_not_in_loopthread(void) {\n  CHAOSLOG_SYSFATAL << \"EventLoop::abort_not_in_loopthread - \" << this\n    << \" was created in thread: \" << tid_\n    << \" current thread: \" << Chaos::CurrentThread::get_tid();\n}\n\nvoid EventLoop::do_handle_read(void) {\n  std::uint64_t one = 1;\n  int n = wakeup_->get_signal(sizeof(one), &one);\n  if (n != sizeof(one))\n    CHAOSLOG_ERROR << \"EventLoop::do_handle_read - reads \" << n << \" bytes instead of `8`\";\n}\n\nvoid EventLoop::do_pending_functors(void) {\n  std::vector<PendFunction> functors;\n\n  calling_pending_functors_ = true;\n  {\n    Chaos::ScopedLock<Chaos::Mutex> guard(mutex_);\n    functors.swap(pending_functors_);\n  }\n  for (auto& fn : functors)\n    fn();\n  calling_pending_functors_ = false;\n}\n\nvoid EventLoop::debug_active_channels(void) const {\n  for (auto ch : active_channels_)\n    CHAOSLOG_TRACE << \"EventLoop::debug_active_channels - {\" << ch->revents_to_string() << \"}\";\n}\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\n#include \"tensorflow\/core\/platform\/cloud\/file_block_cache.h\"\n#include <cstring>\n#include <memory>\n#include \"tensorflow\/core\/lib\/gtl\/cleanup.h\"\n#include \"tensorflow\/core\/platform\/env.h\"\n\nnamespace tensorflow {\n\nbool FileBlockCache::BlockNotStale(const std::shared_ptr<Block>& block) {\n  mutex_lock l(block->mu);\n  if (block->state != FetchState::FINISHED) {\n    return true;  \/\/ No need to check for staleness.\n  }\n  if (max_staleness_ == 0) return true;  \/\/ Not enforcing staleness.\n  return env_->NowSeconds() - block->timestamp <= max_staleness_;\n}\n\nstd::shared_ptr<FileBlockCache::Block> FileBlockCache::Lookup(const Key& key) {\n  mutex_lock lock(mu_);\n  auto entry = block_map_.find(key);\n  if (entry != block_map_.end()) {\n    if (BlockNotStale(entry->second)) {\n      return entry->second;\n    } else {\n      \/\/ Remove the stale block and continue.\n      RemoveFile_Locked(key.first);\n    }\n  }\n\n  \/\/ Insert a new empty block, setting the bookkeeping to sentinel values\n  \/\/ in order to update them as appropriate.\n  auto new_entry = std::make_shared<Block>();\n  lru_list_.push_front(key);\n  lra_list_.push_front(key);\n  new_entry->lru_iterator = lru_list_.begin();\n  new_entry->lra_iterator = lra_list_.begin();\n  new_entry->timestamp = env_->NowSeconds();\n  block_map_.emplace(std::make_pair(key, new_entry));\n  return new_entry;\n}\n\n\/\/ Remove blocks from the cache until we do not exceed our maximum size.\nvoid FileBlockCache::Trim() {\n  while (!lru_list_.empty() && cache_size_ > max_bytes_) {\n    RemoveBlock(block_map_.find(lru_list_.back()));\n  }\n}\n\n\/\/\/ Move the block to the front of the LRU list if it isn't already there.\nStatus FileBlockCache::UpdateLRU(const Key& key,\n                                 const std::shared_ptr<Block>& block) {\n  mutex_lock lock(mu_);\n  if (block->timestamp == 0) {\n    \/\/ The block was evicted from another thread. Allow it to remain evicted.\n    return Status::OK();\n  }\n  if (block->lru_iterator != lru_list_.begin()) {\n    lru_list_.erase(block->lru_iterator);\n    lru_list_.push_front(key);\n    block->lru_iterator = lru_list_.begin();\n  }\n\n  \/\/ Check for inconsistent state. If there is a block later in the same file\n  \/\/ in the cache, and our current block is not block size, this likely means\n  \/\/ we have inconsistent state within the cache. Note: it's possible some\n  \/\/ incomplete reads may still go undetected.\n  if (block->data.size() < block_size_) {\n    Key fmax = std::make_pair(key.first, std::numeric_limits<size_t>::max());\n    auto fcmp = block_map_.upper_bound(fmax);\n    if (fcmp != block_map_.begin() && key < (--fcmp)->first) {\n      return errors::Internal(\"Block cache contents are inconsistent.\");\n    }\n  }\n\n  Trim();\n\n  return Status::OK();\n}\n\nStatus FileBlockCache::MaybeFetch(const Key& key,\n                                  const std::shared_ptr<Block>& block) {\n  bool downloaded_block = false;\n  auto reconcile_state =\n      gtl::MakeCleanup([this, &downloaded_block, &key, &block] {\n        \/\/ Perform this action in a cleanup callback to avoid locking mu_ after\n        \/\/ locking block->mu.\n        if (downloaded_block) {\n          mutex_lock l(mu_);\n          \/\/ Do not update state if the block is already to be evicted.\n          if (block->timestamp != 0) {\n            cache_size_ += block->data.size();\n            \/\/ Put to beginning of LRA list.\n            lra_list_.erase(block->lra_iterator);\n            lra_list_.push_front(key);\n            block->lra_iterator = lra_list_.begin();\n            block->timestamp = env_->NowSeconds();\n          }\n        }\n      });\n  \/\/ Loop until either block content is successfully fetched, or our request\n  \/\/ encounters an error.\n  mutex_lock l(block->mu);\n  Status status = Status::OK();\n  while (true) {\n    switch (block->state) {\n      case FetchState::ERROR:\n        TF_FALLTHROUGH_INTENDED;\n      case FetchState::CREATED:\n        block->state = FetchState::FETCHING;\n        block->mu.unlock();  \/\/ Release the lock while making the API call.\n        block->data.clear();\n        block->data.resize(block_size_, 0);\n        size_t bytes_transferred;\n        status.Update(block_fetcher_(key.first, key.second, block_size_,\n                                     block->data.data(), &bytes_transferred));\n        block->mu.lock();  \/\/ Reacquire the lock immediately afterwards\n        if (status.ok()) {\n          block->data.resize(bytes_transferred, 0);\n          downloaded_block = true;\n          block->state = FetchState::FINISHED;\n        } else {\n          block->state = FetchState::ERROR;\n        }\n        block->cond_var.notify_all();\n        return status;\n      case FetchState::FETCHING:\n        block->cond_var.wait_for(l, std::chrono::seconds(60));\n        if (block->state == FetchState::FINISHED) {\n          return Status::OK();\n        }\n        \/\/ Re-loop in case of errors.\n        break;\n      case FetchState::FINISHED:\n        return Status::OK();\n    }\n  }\n  return errors::Internal(\n      \"Control flow should never reach the end of FileBlockCache::Fetch.\");\n}\n\nStatus FileBlockCache::Read(const string& filename, size_t offset, size_t n,\n                            char* buffer, size_t* bytes_transferred) {\n  *bytes_transferred = 0;\n  if (n == 0) {\n    return Status::OK();\n  }\n  if (block_size_ == 0 || max_bytes_ == 0) {\n    \/\/ The cache is effectively disabled, so we pass the read through to the\n    \/\/ fetcher without breaking it up into blocks.\n    return block_fetcher_(filename, offset, n, buffer, bytes_transferred);\n  }\n  \/\/ Calculate the block-aligned start and end of the read.\n  size_t start = block_size_ * (offset \/ block_size_);\n  size_t finish = block_size_ * ((offset + n) \/ block_size_);\n  if (finish < offset + n) {\n    finish += block_size_;\n  }\n  size_t total_bytes_transferred = 0;\n  \/\/ Now iterate through the blocks, reading them one at a time.\n  for (size_t pos = start; pos < finish; pos += block_size_) {\n    Key key = std::make_pair(filename, pos);\n    \/\/ Look up the block, fetching and inserting it if necessary, and update the\n    \/\/ LRU iterator for the key and block.\n    std::shared_ptr<Block> block = Lookup(key);\n    DCHECK(block) << \"No block for key \" << key.first << \"@\" << key.second;\n    TF_RETURN_IF_ERROR(MaybeFetch(key, block));\n    TF_RETURN_IF_ERROR(UpdateLRU(key, block));\n    \/\/ Copy the relevant portion of the block into the result buffer.\n    const auto& data = block->data;\n    if (offset >= pos + data.size()) {\n      \/\/ The requested offset is at or beyond the end of the file. This can\n      \/\/ happen if `offset` is not block-aligned, and the read returns the last\n      \/\/ block in the file, which does not extend all the way out to `offset`.\n      *bytes_transferred = total_bytes_transferred;\n      return errors::OutOfRange(\"EOF at offset \", offset, \" in file \", filename,\n                                \" at position \", pos, \"with data size \",\n                                data.size());\n    }\n    auto begin = data.begin();\n    if (offset > pos) {\n      \/\/ The block begins before the slice we're reading.\n      begin += offset - pos;\n    }\n    auto end = data.end();\n    if (pos + data.size() > offset + n) {\n      \/\/ The block extends past the end of the slice we're reading.\n      end -= (pos + data.size()) - (offset + n);\n    }\n    if (begin < end) {\n      size_t bytes_to_copy = end - begin;\n      memcpy(&buffer[total_bytes_transferred], &*begin, bytes_to_copy);\n      total_bytes_transferred += bytes_to_copy;\n    }\n    if (data.size() < block_size_) {\n      \/\/ The block was a partial block and thus signals EOF at its upper bound.\n      break;\n    }\n  }\n  *bytes_transferred = total_bytes_transferred;\n  return Status::OK();\n}\n\nsize_t FileBlockCache::CacheSize() const {\n  mutex_lock lock(mu_);\n  return cache_size_;\n}\n\nvoid FileBlockCache::Prune() {\n  while (!WaitForNotificationWithTimeout(&stop_pruning_thread_, 1000000)) {\n    mutex_lock lock(mu_);\n    uint64 now = env_->NowSeconds();\n    while (!lra_list_.empty()) {\n      auto it = block_map_.find(lra_list_.back());\n      if (now - it->second->timestamp <= max_staleness_) {\n        \/\/ The oldest block is not yet expired. Come back later.\n        break;\n      }\n      \/\/ We need to make a copy of the filename here, since it could otherwise\n      \/\/ be used within RemoveFile_Locked after `it` is deleted.\n      RemoveFile_Locked(std::string(it->first.first));\n    }\n  }\n}\n\nvoid FileBlockCache::Flush() {\n  mutex_lock lock(mu_);\n  block_map_.clear();\n  lru_list_.clear();\n  lra_list_.clear();\n  cache_size_ = 0;\n}\n\nvoid FileBlockCache::RemoveFile(const string& filename) {\n  mutex_lock lock(mu_);\n  RemoveFile_Locked(filename);\n}\n\nvoid FileBlockCache::RemoveFile_Locked(const string& filename) {\n  Key begin = std::make_pair(filename, 0);\n  auto it = block_map_.lower_bound(begin);\n  while (it != block_map_.end() && it->first.first == filename) {\n    auto next = std::next(it);\n    RemoveBlock(it);\n    it = next;\n  }\n}\n\nvoid FileBlockCache::RemoveBlock(BlockMap::iterator entry) {\n  \/\/ This signals that the block is removed, and should not be inadvertently\n  \/\/ reinserted into the cache in UpdateLRU.\n  entry->second->timestamp = 0;\n  lru_list_.erase(entry->second->lru_iterator);\n  lra_list_.erase(entry->second->lra_iterator);\n  cache_size_ -= entry->second->data.size();\n  block_map_.erase(entry);\n}\n\n}  \/\/ namespace tensorflow\n<commit_msg>Reduce memory wasted by GCS cache by shrinking buffer capacity, after a cache fill completes.<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\/core\/platform\/cloud\/file_block_cache.h\"\n#include <cstring>\n#include <memory>\n#include \"tensorflow\/core\/lib\/gtl\/cleanup.h\"\n#include \"tensorflow\/core\/platform\/env.h\"\n\nnamespace tensorflow {\n\nbool FileBlockCache::BlockNotStale(const std::shared_ptr<Block>& block) {\n  mutex_lock l(block->mu);\n  if (block->state != FetchState::FINISHED) {\n    return true;  \/\/ No need to check for staleness.\n  }\n  if (max_staleness_ == 0) return true;  \/\/ Not enforcing staleness.\n  return env_->NowSeconds() - block->timestamp <= max_staleness_;\n}\n\nstd::shared_ptr<FileBlockCache::Block> FileBlockCache::Lookup(const Key& key) {\n  mutex_lock lock(mu_);\n  auto entry = block_map_.find(key);\n  if (entry != block_map_.end()) {\n    if (BlockNotStale(entry->second)) {\n      return entry->second;\n    } else {\n      \/\/ Remove the stale block and continue.\n      RemoveFile_Locked(key.first);\n    }\n  }\n\n  \/\/ Insert a new empty block, setting the bookkeeping to sentinel values\n  \/\/ in order to update them as appropriate.\n  auto new_entry = std::make_shared<Block>();\n  lru_list_.push_front(key);\n  lra_list_.push_front(key);\n  new_entry->lru_iterator = lru_list_.begin();\n  new_entry->lra_iterator = lra_list_.begin();\n  new_entry->timestamp = env_->NowSeconds();\n  block_map_.emplace(std::make_pair(key, new_entry));\n  return new_entry;\n}\n\n\/\/ Remove blocks from the cache until we do not exceed our maximum size.\nvoid FileBlockCache::Trim() {\n  while (!lru_list_.empty() && cache_size_ > max_bytes_) {\n    RemoveBlock(block_map_.find(lru_list_.back()));\n  }\n}\n\n\/\/\/ Move the block to the front of the LRU list if it isn't already there.\nStatus FileBlockCache::UpdateLRU(const Key& key,\n                                 const std::shared_ptr<Block>& block) {\n  mutex_lock lock(mu_);\n  if (block->timestamp == 0) {\n    \/\/ The block was evicted from another thread. Allow it to remain evicted.\n    return Status::OK();\n  }\n  if (block->lru_iterator != lru_list_.begin()) {\n    lru_list_.erase(block->lru_iterator);\n    lru_list_.push_front(key);\n    block->lru_iterator = lru_list_.begin();\n  }\n\n  \/\/ Check for inconsistent state. If there is a block later in the same file\n  \/\/ in the cache, and our current block is not block size, this likely means\n  \/\/ we have inconsistent state within the cache. Note: it's possible some\n  \/\/ incomplete reads may still go undetected.\n  if (block->data.size() < block_size_) {\n    Key fmax = std::make_pair(key.first, std::numeric_limits<size_t>::max());\n    auto fcmp = block_map_.upper_bound(fmax);\n    if (fcmp != block_map_.begin() && key < (--fcmp)->first) {\n      return errors::Internal(\"Block cache contents are inconsistent.\");\n    }\n  }\n\n  Trim();\n\n  return Status::OK();\n}\n\nStatus FileBlockCache::MaybeFetch(const Key& key,\n                                  const std::shared_ptr<Block>& block) {\n  bool downloaded_block = false;\n  auto reconcile_state =\n      gtl::MakeCleanup([this, &downloaded_block, &key, &block] {\n        \/\/ Perform this action in a cleanup callback to avoid locking mu_ after\n        \/\/ locking block->mu.\n        if (downloaded_block) {\n          mutex_lock l(mu_);\n          \/\/ Do not update state if the block is already to be evicted.\n          if (block->timestamp != 0) {\n            cache_size_ += block->data.size();\n            \/\/ Put to beginning of LRA list.\n            lra_list_.erase(block->lra_iterator);\n            lra_list_.push_front(key);\n            block->lra_iterator = lra_list_.begin();\n            block->timestamp = env_->NowSeconds();\n          }\n        }\n      });\n  \/\/ Loop until either block content is successfully fetched, or our request\n  \/\/ encounters an error.\n  mutex_lock l(block->mu);\n  Status status = Status::OK();\n  while (true) {\n    switch (block->state) {\n      case FetchState::ERROR:\n        TF_FALLTHROUGH_INTENDED;\n      case FetchState::CREATED:\n        block->state = FetchState::FETCHING;\n        block->mu.unlock();  \/\/ Release the lock while making the API call.\n        block->data.clear();\n        block->data.resize(block_size_, 0);\n        size_t bytes_transferred;\n        status.Update(block_fetcher_(key.first, key.second, block_size_,\n                                     block->data.data(), &bytes_transferred));\n        block->mu.lock();  \/\/ Reacquire the lock immediately afterwards\n        if (status.ok()) {\n          block->data.resize(bytes_transferred, 0);\n          block->data.shrink_to_fit();\n          downloaded_block = true;\n          block->state = FetchState::FINISHED;\n        } else {\n          block->state = FetchState::ERROR;\n        }\n        block->cond_var.notify_all();\n        return status;\n      case FetchState::FETCHING:\n        block->cond_var.wait_for(l, std::chrono::seconds(60));\n        if (block->state == FetchState::FINISHED) {\n          return Status::OK();\n        }\n        \/\/ Re-loop in case of errors.\n        break;\n      case FetchState::FINISHED:\n        return Status::OK();\n    }\n  }\n  return errors::Internal(\n      \"Control flow should never reach the end of FileBlockCache::Fetch.\");\n}\n\nStatus FileBlockCache::Read(const string& filename, size_t offset, size_t n,\n                            char* buffer, size_t* bytes_transferred) {\n  *bytes_transferred = 0;\n  if (n == 0) {\n    return Status::OK();\n  }\n  if (block_size_ == 0 || max_bytes_ == 0) {\n    \/\/ The cache is effectively disabled, so we pass the read through to the\n    \/\/ fetcher without breaking it up into blocks.\n    return block_fetcher_(filename, offset, n, buffer, bytes_transferred);\n  }\n  \/\/ Calculate the block-aligned start and end of the read.\n  size_t start = block_size_ * (offset \/ block_size_);\n  size_t finish = block_size_ * ((offset + n) \/ block_size_);\n  if (finish < offset + n) {\n    finish += block_size_;\n  }\n  size_t total_bytes_transferred = 0;\n  \/\/ Now iterate through the blocks, reading them one at a time.\n  for (size_t pos = start; pos < finish; pos += block_size_) {\n    Key key = std::make_pair(filename, pos);\n    \/\/ Look up the block, fetching and inserting it if necessary, and update the\n    \/\/ LRU iterator for the key and block.\n    std::shared_ptr<Block> block = Lookup(key);\n    DCHECK(block) << \"No block for key \" << key.first << \"@\" << key.second;\n    TF_RETURN_IF_ERROR(MaybeFetch(key, block));\n    TF_RETURN_IF_ERROR(UpdateLRU(key, block));\n    \/\/ Copy the relevant portion of the block into the result buffer.\n    const auto& data = block->data;\n    if (offset >= pos + data.size()) {\n      \/\/ The requested offset is at or beyond the end of the file. This can\n      \/\/ happen if `offset` is not block-aligned, and the read returns the last\n      \/\/ block in the file, which does not extend all the way out to `offset`.\n      *bytes_transferred = total_bytes_transferred;\n      return errors::OutOfRange(\"EOF at offset \", offset, \" in file \", filename,\n                                \" at position \", pos, \"with data size \",\n                                data.size());\n    }\n    auto begin = data.begin();\n    if (offset > pos) {\n      \/\/ The block begins before the slice we're reading.\n      begin += offset - pos;\n    }\n    auto end = data.end();\n    if (pos + data.size() > offset + n) {\n      \/\/ The block extends past the end of the slice we're reading.\n      end -= (pos + data.size()) - (offset + n);\n    }\n    if (begin < end) {\n      size_t bytes_to_copy = end - begin;\n      memcpy(&buffer[total_bytes_transferred], &*begin, bytes_to_copy);\n      total_bytes_transferred += bytes_to_copy;\n    }\n    if (data.size() < block_size_) {\n      \/\/ The block was a partial block and thus signals EOF at its upper bound.\n      break;\n    }\n  }\n  *bytes_transferred = total_bytes_transferred;\n  return Status::OK();\n}\n\nsize_t FileBlockCache::CacheSize() const {\n  mutex_lock lock(mu_);\n  return cache_size_;\n}\n\nvoid FileBlockCache::Prune() {\n  while (!WaitForNotificationWithTimeout(&stop_pruning_thread_, 1000000)) {\n    mutex_lock lock(mu_);\n    uint64 now = env_->NowSeconds();\n    while (!lra_list_.empty()) {\n      auto it = block_map_.find(lra_list_.back());\n      if (now - it->second->timestamp <= max_staleness_) {\n        \/\/ The oldest block is not yet expired. Come back later.\n        break;\n      }\n      \/\/ We need to make a copy of the filename here, since it could otherwise\n      \/\/ be used within RemoveFile_Locked after `it` is deleted.\n      RemoveFile_Locked(std::string(it->first.first));\n    }\n  }\n}\n\nvoid FileBlockCache::Flush() {\n  mutex_lock lock(mu_);\n  block_map_.clear();\n  lru_list_.clear();\n  lra_list_.clear();\n  cache_size_ = 0;\n}\n\nvoid FileBlockCache::RemoveFile(const string& filename) {\n  mutex_lock lock(mu_);\n  RemoveFile_Locked(filename);\n}\n\nvoid FileBlockCache::RemoveFile_Locked(const string& filename) {\n  Key begin = std::make_pair(filename, 0);\n  auto it = block_map_.lower_bound(begin);\n  while (it != block_map_.end() && it->first.first == filename) {\n    auto next = std::next(it);\n    RemoveBlock(it);\n    it = next;\n  }\n}\n\nvoid FileBlockCache::RemoveBlock(BlockMap::iterator entry) {\n  \/\/ This signals that the block is removed, and should not be inadvertently\n  \/\/ reinserted into the cache in UpdateLRU.\n  entry->second->timestamp = 0;\n  lru_list_.erase(entry->second->lru_iterator);\n  lra_list_.erase(entry->second->lra_iterator);\n  cache_size_ -= entry->second->data.size();\n  block_map_.erase(entry);\n}\n\n}  \/\/ namespace tensorflow\n<|endoftext|>"}
{"text":"<commit_before>\/\/ RUN: %clang_cc1 -std=c++1y -fsyntax-only -verify %s\n\n\/\/ -- The argument list of the specialization shall not be identical\n\/\/    to the implicit argument list of the primary template.\n\ntemplate<typename T, int N, template<typename> class X> int v1;\ntemplate<typename T, int N, template<typename> class X> int v1<T, N, X>;\n\/\/ expected-error@-1{{variable template partial specialization does not specialize any template argument; to define the primary template, remove the template argument list}}\n\ntemplate<typename...T> int v2;\ntemplate<typename...T> int v2<T...>;\n\/\/ expected-error@-1{{variable template partial specialization does not specialize any template argument; to define the primary template, remove the template argument list}}\n\ntemplate<int...N> int v3;\ntemplate<int...N> int v3<N...>;\n\/\/ expected-error@-1{{variable template partial specialization does not specialize any template argument; to define the primary template, remove the template argument list}}\n\ntemplate<template<typename> class...X> int v4;\ntemplate<template<typename> class...X> int v4<X...>;\n\/\/ expected-error@-1{{variable template partial specialization does not specialize any template argument; to define the primary template, remove the template argument list}}\n\ntemplate<typename Outer> struct X {\n  template<typename Inner> static int y;\n  template<typename Inner> static int y<Outer>; \/\/ expected-warning {{can not be deduced}} expected-note {{'Inner'}}\n  template<typename Inner> static int y<Inner>; \/\/ expected-error {{does not specialize}}\n};\ntemplate<typename Outer> template<typename Inner> int X<Outer>::y<Outer>; \/\/ expected-warning {{can not be deduced}} expected-note {{'Inner'}}\ntemplate<typename Outer> template<typename Inner> int X<Outer>::y<Inner>; \/\/ expected-error {{does not specialize}}\ntemplate<> template<typename Inner> int X<int>::y<Inner>; \/\/ expected-error {{does not specialize}}\n<commit_msg>Hopefully unbreak bots which are seeing an assert in this test. Temporary, real fix to come once I've tracked down the problem (which is pre-existing and not related to the change which introduced this test).<commit_after>\/\/ RUN: %clang_cc1 -std=c++1y -fsyntax-only -verify %s\n\n\/\/ -- The argument list of the specialization shall not be identical\n\/\/    to the implicit argument list of the primary template.\n\ntemplate<typename T, int N, template<typename> class X> int v1;\ntemplate<typename T, int N, template<typename> class X> int v1<T, N, X>;\n\/\/ expected-error@-1{{variable template partial specialization does not specialize any template argument; to define the primary template, remove the template argument list}}\n\ntemplate<typename...T> int v2;\ntemplate<typename...T> int v2<T...>;\n\/\/ expected-error@-1{{variable template partial specialization does not specialize any template argument; to define the primary template, remove the template argument list}}\n\ntemplate<int...N> int v3;\ntemplate<int...N> int v3<N...>;\n\/\/ expected-error@-1{{variable template partial specialization does not specialize any template argument; to define the primary template, remove the template argument list}}\n\ntemplate<template<typename> class...X> int v4;\ntemplate<template<typename> class...X> int v4<X...>;\n\/\/ expected-error@-1{{variable template partial specialization does not specialize any template argument; to define the primary template, remove the template argument list}}\n\ntemplate<typename Outer> struct X {\n  template<typename Inner> static int y;\n  template<typename Inner> static int y<Outer>; \/\/ expected-warning {{can not be deduced}} expected-note {{'Inner'}}\n  template<typename Inner> static int y<Inner>; \/\/ expected-error {{does not specialize}}\n};\ntemplate<typename Outer> template<typename Inner> int X<Outer>::y<Outer>; \/\/ expected-warning {{can not be deduced}} expected-note {{'Inner'}}\ntemplate<typename Outer> template<typename Inner> int X<Outer>::y<Inner>; \/\/ expected-error {{does not specialize}}\n\n\/\/ FIXME: Merging this with the above class causes an assertion failure when\n\/\/ instantiating one of the bogus partial specializations.\ntemplate<typename Outer> struct Y {\n  template<typename Inner> static int y;\n};\ntemplate<> template<typename Inner> int Y<int>::y<Inner>; \/\/ expected-error {{does not specialize}}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file    test_threads.cpp\n * @ingroup\n * @author  Tony Pan <tpan7@gatech.edu>\n * @brief\n * @details\n *\n * Copyright (c) 2014 Georgia Institute of Technology.  All Rights Reserved.\n *\n * TODO add License\n *\/\n#include \"config.hpp\"\n\n#include <unistd.h>  \/\/ get hostname\n\n\n#include <functional>\n#include <random>\n#include <algorithm>\n#include <string>\n#include <sstream>\n#include <chrono>\n#include <iostream>  \/\/ for system(\"pause\");\n#include \"utils\/logging.h\"\n#include \"common\/alphabets.hpp\"\n#include \"common\/kmer.hpp\"\n#include \"common\/base_types.hpp\"\n#include \"utils\/kmer_utils.hpp\"\n\n#include \"io\/mxx_support.hpp\"\n#include \"io\/sequence_iterator.hpp\"\n#include \"io\/sequence_id_iterator.hpp\"\n#include \"iterators\/transform_iterator.hpp\"\n#include \"common\/kmer_iterators.hpp\"\n#include \"iterators\/zip_iterator.hpp\"\n#include \"index\/quality_score_iterator.hpp\"\n\n#include \"wip\/kmer_index.hpp\"\n\n#include \"utils\/timer.hpp\"\n\n\ntemplate <typename KmerType>\nstd::vector<KmerType> readForQuery(const std::string & filename, MPI_Comm comm) {\n  using FileLoaderType = bliss::io::FASTQLoader<CharType, true, false>; \/\/ raw data type :  use CharType\n\n  \/\/====  now process the file, one L1 block (block partition by MPI Rank) at a time\n  \/\/ from FileLoader type, get the block iter type and range type\n  using FileBlockIterType = typename FileLoaderType::L1BlockType::iterator;\n\n  using ParserType = bliss::io::FASTQParser<FileBlockIterType, void>;\n  using SeqType = typename ParserType::SequenceType;\n  using SeqIterType = bliss::io::SequencesIterator<ParserType>;\n\n  using Alphabet = typename KmerType::KmerAlphabet;\n\n  \/\/\/ converter from ascii to alphabet values\n  using BaseCharIterator = bliss::iterator::transform_iterator<typename SeqType::IteratorType, bliss::common::ASCII2<Alphabet> >;\n\n  \/\/\/ kmer generation iterator\n  using KmerIterType = bliss::common::KmerGenerationIterator<BaseCharIterator, KmerType>;\n  std::vector< KmerType > query;\n\n  int commSize, rank;\n  MPI_Comm_size(comm, &commSize);\n  MPI_Comm_rank(comm, &rank);\n\n\n  {\n    \/\/==== create file Loader\n    FileLoaderType loader(comm, filename, 1, sysconf(_SC_PAGE_SIZE));  \/\/ this handle is alive through the entire building process.\n    typename FileLoaderType::L1BlockType partition = loader.getNextL1Block();\n    size_t est_size = (loader.getKmerCountEstimate(KmerType::size) + commSize - 1) \/ commSize;\n\n    \/\/ == create kmer iterator\n    \/\/            kmer_iter start(data, range);\n    \/\/            kmer_iter end(range.second,range.second);\n\n    query.reserve(est_size);\n\n    ParserType parser;\n    \/\/=== copy into array\n    while (partition.getRange().size() > 0) {\n      \/\/== process the chunk of data\n      SeqType read;\n\n      \/\/==  and wrap the chunk inside an iterator that emits Reads.\n      SeqIterType seqs_start(parser, partition.begin(), partition.end(), partition.getRange().start);\n      SeqIterType seqs_end(partition.end());\n\n\n      \/\/== loop over the reads\n      for (; seqs_start != seqs_end; ++seqs_start)\n      {\n        \/\/ first get read\n        read = *seqs_start;\n\n        \/\/ then compute and store into index (this will generate kmers and insert into index)\n        if (read.seqBegin == read.seqEnd) continue;\n\n        \/\/== set up the kmer generating iterators.\n        KmerIterType start(BaseCharIterator(read.seqBegin, bliss::common::ASCII2<Alphabet>()), true);\n        KmerIterType end(BaseCharIterator(read.seqEnd, bliss::common::ASCII2<Alphabet>()), false);\n\n\n        query.insert(query.end(), start, end);\n        \/\/        for (auto it = index_start; it != index_end; ++it) {\n        \/\/          temp.push_back(*it);\n        \/\/        }\n        \/\/std::copy(index_start, index_end, temp.end());\n        \/\/        INFOF(\"R %d inserted.  new temp size = %lu\", rank, temp.size());\n      }\n\n      partition = loader.getNextL1Block();\n    }\n  }\n  return query;\n}\n\n\n\ntemplate<typename KmerType>\nvoid sample(std::vector<KmerType> &query, size_t n, unsigned int seed) {\n  std::shuffle(query.begin(), query.begin() + ::std::min(4 * n, query.size()), std::default_random_engine(seed));\n  query.erase(query.begin() + n, query.end());\n}\n\n\n\n\ntemplate <typename IndexType>\nvoid testIndex(MPI_Comm comm, const std::string & filename, std::string test ) {\n\n  int nprocs = 1;\n  int rank = 0;\n  MPI_Comm_size(comm, &nprocs);\n  MPI_Comm_rank(comm, &rank);\n\n  IndexType idx(comm, nprocs);\n\n  using KmerType = typename IndexType::map_type::key_type;\n\n  TIMER_INIT(test);\n\n  if (rank == 0) INFOF(\"RANK %d \/ %d: Testing %s\", rank, nprocs, test.c_str());\n\n  TIMER_START(test);\n  idx.build(filename, comm);\n  TIMER_END(test, \"build\", idx.local_size());\n\n\n\n  TIMER_START(test);\n  auto query = readForQuery<KmerType>(filename, comm);\n  TIMER_END(test, \"read query\", query.size());\n\n\n  \/\/ for testing, query 1% (else could run out of memory.  if a kmer exists r times, then we may need r^2\/p total storage.\n  TIMER_START(test);\n  unsigned seed = rank * 23;\n  sample(query, query.size() \/ 100, seed);\n  TIMER_END(test, \"select 1%\", query.size());\n\n  auto query_orig = query;\n\n  auto query1 = query_orig;\n  query1.resize(1);\n\n  \/\/ query 1\n  TIMER_START(test);\n  auto results3 = idx.find(query1);\n  TIMER_END(test, \"query 1\", results3.size());\n\n  query1 = query_orig;\n  query1.resize(1);\n\n  \/\/ query 1\n  TIMER_START(test);\n  auto results4 = idx.count(query1);\n  TIMER_END(test, \"count 1\", results4.size());\n\n\n\n  query = query_orig;\n\n  \/\/ process query\n  \/\/ query\n  TIMER_START(test);\n  auto results = idx.find(query);\n  TIMER_END(test, \"query 1%\", results.size());\n\n  query = query_orig;\n\n  \/\/ count\n  TIMER_START(test);\n  auto results2 = idx.count(query);\n  TIMER_END(test, \"count 1%\", results2.size());\n\n\n\n\n  TIMER_REPORT_MPI(test, rank, comm);\n\n}\n\n\n\n\n\/**\n *\n * @param argc\n * @param argv\n * @return\n *\/\nint main(int argc, char** argv) {\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ init logging\n  LOG_INIT();\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ parse parameters\n\n  \/\/std::string filename(\"\/home\/tpan\/src\/bliss\/test\/data\/test.medium.fastq\");\n  std::string filename(\"\/home\/tpan\/src\/bliss\/test\/data\/test.fastq\");\n\n  if (argc > 1)\n  {\n    filename.assign(argv[1]);\n  }\n\n  int which = -1;\n  if (argc > 2)\n\twhich = atoi(argv[2]);\n\n\n  int rank = 0;\n\tint nthreads = 1;\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ initialize MPI and openMP\n#ifdef USE_MPI\n\n  if (nthreads > 1) {\n\n    int provided;\n\n    \/\/ one thread will be making all MPI calls.\n    MPI_Init_thread(&argc, &argv, MPI_THREAD_FUNNELED, &provided);\n\n    if (provided < MPI_THREAD_FUNNELED) {\n      ERRORF(\"The MPI Library Does not have thread support.\");\n      MPI_Abort(MPI_COMM_WORLD, 1);\n    }\n  } else {\n    MPI_Init(&argc, &argv);\n  }\n\n  MPI_Comm comm = MPI_COMM_WORLD;\n\n  MPI_Comm_rank(comm, &rank);\n\n  {\n    char hostname[256];\n    memset(hostname, 0, 256);\n    gethostname(hostname, 256);\n    \/\/INFOF(\"Rank %d hostname [%s]\", rank, hostname);\n  }\n  MPI_Barrier(comm);\n\n  if (rank == 0) INFOF(\"USE_MPI is set\");\n#else\n  static_assert(false, \"MPI used although compilation is not set to use MPI\");\n#endif\n  \n  if (which != -1) std::cin.get();\n\n\n  using Alphabet = bliss::common::DNA;\n  using KmerType = bliss::common::Kmer<21, Alphabet, WordType>;\n\n  using IdType = bliss::io::FASTQ::SequenceId;\n  using QualType = float;\n  using KmerInfoType = std::pair<IdType, QualType>;\n\n  if (which == -1 || which == 1) \n  {\n  using MapType = ::dsc::unordered_multimap_vec<\n      KmerType, IdType, int,\n      bliss::kmer::transform::lex_less,\n      bliss::kmer::hash::farm >;\n  testIndex<bliss::index::kmer::PositionIndex<MapType> >(comm, filename, \"ST, hashvec, position index.\");\n  \n  MPI_Barrier(comm);\n\t}\n\/*\n  if (which == -1 || which == 2)\n  {\n  using MapType = ::dsc::counting_unordered_map<\n      KmerType, uint32_t, int,\n      bliss::kmer::transform::lex_less,\n      bliss::kmer::hash::farm >;\n  testIndex<bliss::index::kmer::CountIndex<MapType> > (comm, filename, \"ST, hash, count index.\");\n    MPI_Barrier(comm);\n}\n\n  if (which == -1 || which == 3)\n  {\n  using MapType = ::dsc::counting_sorted_map<\n      KmerType, uint32_t, int,\n      bliss::kmer::transform::lex_less>;\n  testIndex<bliss::index::kmer::CountIndex<MapType> > (comm, filename, \"ST, sort, count index.\");\n    MPI_Barrier(comm);\n}\n\n  if (which == -1 || which == 4)\n  {\n  using MapType = ::dsc::unordered_multimap<\n      KmerType, IdType, int,\n      bliss::kmer::transform::lex_less,\n      bliss::kmer::hash::farm >;\n  testIndex<bliss::index::kmer::PositionIndex<MapType> >(comm, filename, \"ST, hash, position index.\");\n    MPI_Barrier(comm);\n}\n*\/\n    if (which == -1 || which == 5)\n{\n  using MapType = ::dsc::sorted_multimap<\n      KmerType, IdType, int,\n      bliss::kmer::transform::lex_less>;\n  testIndex<bliss::index::kmer::PositionIndex<MapType> >(comm, filename, \"ST, sort, position index.\");\n    MPI_Barrier(comm);\n}\n\/*\n  if (which == -1 || which == 6)\n  {\n  using MapType = ::dsc::unordered_multimap_vec<\n      KmerType, KmerInfoType, int,\n      bliss::kmer::transform::lex_less,\n      bliss::kmer::hash::farm >;\n  testIndex<bliss::index::kmer::PositionQualityIndex<MapType> >(comm, filename , \"ST, hashvec, pos+qual index\");\n    MPI_Barrier(comm);\n}\n\n\n  if (which == -1 || which == 7)\n  {\n  using MapType = ::dsc::unordered_multimap<\n      KmerType, KmerInfoType, int,\n      bliss::kmer::transform::lex_less,\n      bliss::kmer::hash::farm >;\n  testIndex<bliss::index::kmer::PositionQualityIndex<MapType> >(comm, filename , \"ST, hash, pos+qual index\");\n    MPI_Barrier(comm);\n}\n\n\n  if (which == -1 || which == 8)\n  {\n  using MapType = ::dsc::sorted_multimap<\n      KmerType, KmerInfoType, int,\n      bliss::kmer::transform::lex_less>;\n  testIndex<bliss::index::kmer::PositionQualityIndex<MapType> >(comm, filename , \"ST, sort, pos+qual index\");\n    MPI_Barrier(comm);\n}\n*\/\n\/\/\n\/\/\n\/\/  if (which == 9)\n\/\/  {\n\/\/  using MapType = ::dsc::counting_map<\n\/\/      KmerType, uint32_t, int,\n\/\/      bliss::kmer::transform::lex_less,\n\/\/      bliss::kmer::hash::farm >;\n\/\/  testIndex<bliss::index::kmer::CountIndex<MapType> > (comm, filename, \"ST, map, count index.\");\n\/\/    MPI_Barrier(comm);\n\/\/}\n\/\/\n\/\/  if (which == 10)\n\/\/  {\n\/\/  using MapType = ::dsc::multimap<\n\/\/      KmerType, IdType, int,\n\/\/      bliss::kmer::transform::lex_less,\n\/\/      bliss::kmer::hash::farm >;\n\/\/  testIndex<bliss::index::kmer::PositionIndex<MapType> >(comm, filename, \"ST, map, position index.\");\n\/\/    MPI_Barrier(comm);\n\/\/}\n\/\/\n\/\/  if (which == 11)\n\/\/  {\n\/\/  using MapType = ::dsc::multimap<\n\/\/      KmerType, KmerInfoType, int,\n\/\/      bliss::kmer::transform::lex_less,\n\/\/      bliss::kmer::hash::farm >;\n\/\/  testIndex<bliss::index::kmer::PositionQualityIndex<MapType> >(comm, filename , \"ST, map, pos+qual index\");\n\/\/    MPI_Barrier(comm);\n\/\/}\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/  clean up MPI.\n  MPI_Finalize();\n\n  \/\/INFOF(\"M Rank %d called MPI_Finalize\", rank);\n\n\n\n  return 0;\n}\n<commit_msg>FIX: uncomment all tests for CyEnce run<commit_after>\/**\n * @file    test_threads.cpp\n * @ingroup\n * @author  Tony Pan <tpan7@gatech.edu>\n * @brief\n * @details\n *\n * Copyright (c) 2014 Georgia Institute of Technology.  All Rights Reserved.\n *\n * TODO add License\n *\/\n#include \"config.hpp\"\n\n#include <unistd.h>  \/\/ get hostname\n\n\n#include <functional>\n#include <random>\n#include <algorithm>\n#include <string>\n#include <sstream>\n#include <chrono>\n#include <iostream>  \/\/ for system(\"pause\");\n#include \"utils\/logging.h\"\n#include \"common\/alphabets.hpp\"\n#include \"common\/kmer.hpp\"\n#include \"common\/base_types.hpp\"\n#include \"utils\/kmer_utils.hpp\"\n\n#include \"io\/mxx_support.hpp\"\n#include \"io\/sequence_iterator.hpp\"\n#include \"io\/sequence_id_iterator.hpp\"\n#include \"iterators\/transform_iterator.hpp\"\n#include \"common\/kmer_iterators.hpp\"\n#include \"iterators\/zip_iterator.hpp\"\n#include \"index\/quality_score_iterator.hpp\"\n\n#include \"wip\/kmer_index.hpp\"\n\n#include \"utils\/timer.hpp\"\n\n\ntemplate <typename KmerType>\nstd::vector<KmerType> readForQuery(const std::string & filename, MPI_Comm comm) {\n  using FileLoaderType = bliss::io::FASTQLoader<CharType, true, false>; \/\/ raw data type :  use CharType\n\n  \/\/====  now process the file, one L1 block (block partition by MPI Rank) at a time\n  \/\/ from FileLoader type, get the block iter type and range type\n  using FileBlockIterType = typename FileLoaderType::L1BlockType::iterator;\n\n  using ParserType = bliss::io::FASTQParser<FileBlockIterType, void>;\n  using SeqType = typename ParserType::SequenceType;\n  using SeqIterType = bliss::io::SequencesIterator<ParserType>;\n\n  using Alphabet = typename KmerType::KmerAlphabet;\n\n  \/\/\/ converter from ascii to alphabet values\n  using BaseCharIterator = bliss::iterator::transform_iterator<typename SeqType::IteratorType, bliss::common::ASCII2<Alphabet> >;\n\n  \/\/\/ kmer generation iterator\n  using KmerIterType = bliss::common::KmerGenerationIterator<BaseCharIterator, KmerType>;\n  std::vector< KmerType > query;\n\n  int commSize, rank;\n  MPI_Comm_size(comm, &commSize);\n  MPI_Comm_rank(comm, &rank);\n\n\n  {\n    \/\/==== create file Loader\n    FileLoaderType loader(comm, filename, 1, sysconf(_SC_PAGE_SIZE));  \/\/ this handle is alive through the entire building process.\n    typename FileLoaderType::L1BlockType partition = loader.getNextL1Block();\n    size_t est_size = (loader.getKmerCountEstimate(KmerType::size) + commSize - 1) \/ commSize;\n\n    \/\/ == create kmer iterator\n    \/\/            kmer_iter start(data, range);\n    \/\/            kmer_iter end(range.second,range.second);\n\n    query.reserve(est_size);\n\n    ParserType parser;\n    \/\/=== copy into array\n    while (partition.getRange().size() > 0) {\n      \/\/== process the chunk of data\n      SeqType read;\n\n      \/\/==  and wrap the chunk inside an iterator that emits Reads.\n      SeqIterType seqs_start(parser, partition.begin(), partition.end(), partition.getRange().start);\n      SeqIterType seqs_end(partition.end());\n\n\n      \/\/== loop over the reads\n      for (; seqs_start != seqs_end; ++seqs_start)\n      {\n        \/\/ first get read\n        read = *seqs_start;\n\n        \/\/ then compute and store into index (this will generate kmers and insert into index)\n        if (read.seqBegin == read.seqEnd) continue;\n\n        \/\/== set up the kmer generating iterators.\n        KmerIterType start(BaseCharIterator(read.seqBegin, bliss::common::ASCII2<Alphabet>()), true);\n        KmerIterType end(BaseCharIterator(read.seqEnd, bliss::common::ASCII2<Alphabet>()), false);\n\n\n        query.insert(query.end(), start, end);\n        \/\/        for (auto it = index_start; it != index_end; ++it) {\n        \/\/          temp.push_back(*it);\n        \/\/        }\n        \/\/std::copy(index_start, index_end, temp.end());\n        \/\/        INFOF(\"R %d inserted.  new temp size = %lu\", rank, temp.size());\n      }\n\n      partition = loader.getNextL1Block();\n    }\n  }\n  return query;\n}\n\n\n\ntemplate<typename KmerType>\nvoid sample(std::vector<KmerType> &query, size_t n, unsigned int seed) {\n  std::shuffle(query.begin(), query.begin() + ::std::min(4 * n, query.size()), std::default_random_engine(seed));\n  query.erase(query.begin() + n, query.end());\n}\n\n\n\n\ntemplate <typename IndexType>\nvoid testIndex(MPI_Comm comm, const std::string & filename, std::string test ) {\n\n  int nprocs = 1;\n  int rank = 0;\n  MPI_Comm_size(comm, &nprocs);\n  MPI_Comm_rank(comm, &rank);\n\n  IndexType idx(comm, nprocs);\n\n  using KmerType = typename IndexType::map_type::key_type;\n\n  TIMER_INIT(test);\n\n  if (rank == 0) INFOF(\"RANK %d \/ %d: Testing %s\", rank, nprocs, test.c_str());\n\n  TIMER_START(test);\n  idx.build(filename, comm);\n  TIMER_END(test, \"build\", idx.local_size());\n\n\n\n  TIMER_START(test);\n  auto query = readForQuery<KmerType>(filename, comm);\n  TIMER_END(test, \"read query\", query.size());\n\n\n  \/\/ for testing, query 1% (else could run out of memory.  if a kmer exists r times, then we may need r^2\/p total storage.\n  TIMER_START(test);\n  unsigned seed = rank * 23;\n  sample(query, query.size() \/ 100, seed);\n  TIMER_END(test, \"select 1%\", query.size());\n\n  auto query_orig = query;\n\n  auto query1 = query_orig;\n  query1.resize(1);\n\n  \/\/ query 1\n  TIMER_START(test);\n  auto results3 = idx.find(query1);\n  TIMER_END(test, \"query 1\", results3.size());\n\n  query1 = query_orig;\n  query1.resize(1);\n\n  \/\/ query 1\n  TIMER_START(test);\n  auto results4 = idx.count(query1);\n  TIMER_END(test, \"count 1\", results4.size());\n\n\n\n  query = query_orig;\n\n  \/\/ process query\n  \/\/ query\n  TIMER_START(test);\n  auto results = idx.find(query);\n  TIMER_END(test, \"query 1%\", results.size());\n\n  query = query_orig;\n\n  \/\/ count\n  TIMER_START(test);\n  auto results2 = idx.count(query);\n  TIMER_END(test, \"count 1%\", results2.size());\n\n\n\n\n  TIMER_REPORT_MPI(test, rank, comm);\n\n}\n\n\n\n\n\/**\n *\n * @param argc\n * @param argv\n * @return\n *\/\nint main(int argc, char** argv) {\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ init logging\n  LOG_INIT();\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ parse parameters\n\n  \/\/std::string filename(\"\/home\/tpan\/src\/bliss\/test\/data\/test.medium.fastq\");\n  std::string filename(\"\/home\/tpan\/src\/bliss\/test\/data\/test.fastq\");\n\n  if (argc > 1)\n  {\n    filename.assign(argv[1]);\n  }\n\n  int which = -1;\n  if (argc > 2)\n\twhich = atoi(argv[2]);\n\n\n  int rank = 0;\n\tint nthreads = 1;\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ initialize MPI and openMP\n#ifdef USE_MPI\n\n  if (nthreads > 1) {\n\n    int provided;\n\n    \/\/ one thread will be making all MPI calls.\n    MPI_Init_thread(&argc, &argv, MPI_THREAD_FUNNELED, &provided);\n\n    if (provided < MPI_THREAD_FUNNELED) {\n      ERRORF(\"The MPI Library Does not have thread support.\");\n      MPI_Abort(MPI_COMM_WORLD, 1);\n    }\n  } else {\n    MPI_Init(&argc, &argv);\n  }\n\n  MPI_Comm comm = MPI_COMM_WORLD;\n\n  MPI_Comm_rank(comm, &rank);\n\n  {\n    char hostname[256];\n    memset(hostname, 0, 256);\n    gethostname(hostname, 256);\n    \/\/INFOF(\"Rank %d hostname [%s]\", rank, hostname);\n  }\n  MPI_Barrier(comm);\n\n  if (rank == 0) INFOF(\"USE_MPI is set\");\n#else\n  static_assert(false, \"MPI used although compilation is not set to use MPI\");\n#endif\n  \n  if (which != -1) std::cin.get();\n\n\n  using Alphabet = bliss::common::DNA;\n  using KmerType = bliss::common::Kmer<21, Alphabet, WordType>;\n\n  using IdType = bliss::io::FASTQ::SequenceId;\n  using QualType = float;\n  using KmerInfoType = std::pair<IdType, QualType>;\n\n\n  if (which == -1 || which == 2)\n  {\n  using MapType = ::dsc::counting_unordered_map<\n      KmerType, uint32_t, int,\n      bliss::kmer::transform::lex_less,\n      bliss::kmer::hash::farm >;\n  testIndex<bliss::index::kmer::CountIndex<MapType> > (comm, filename, \"ST, hash, count index.\");\n    MPI_Barrier(comm);\n}\n\n  if (which == -1 || which == 4)\n  {\n  using MapType = ::dsc::unordered_multimap<\n      KmerType, IdType, int,\n      bliss::kmer::transform::lex_less,\n      bliss::kmer::hash::farm >;\n  testIndex<bliss::index::kmer::PositionIndex<MapType> >(comm, filename, \"ST, hash, position index.\");\n    MPI_Barrier(comm);\n}\n  if (which == -1 || which == 7)\n  {\n  using MapType = ::dsc::unordered_multimap<\n      KmerType, KmerInfoType, int,\n      bliss::kmer::transform::lex_less,\n      bliss::kmer::hash::farm >;\n  testIndex<bliss::index::kmer::PositionQualityIndex<MapType> >(comm, filename , \"ST, hash, pos+qual index\");\n    MPI_Barrier(comm);\n}\n\n  if (which == -1 || which == 1)\n  {\n  using MapType = ::dsc::unordered_multimap_vec<\n      KmerType, IdType, int,\n      bliss::kmer::transform::lex_less,\n      bliss::kmer::hash::farm >;\n  testIndex<bliss::index::kmer::PositionIndex<MapType> >(comm, filename, \"ST, hashvec, position index.\");\n\n  MPI_Barrier(comm);\n  }\n\n  if (which == -1 || which == 6)\n  {\n  using MapType = ::dsc::unordered_multimap_vec<\n      KmerType, KmerInfoType, int,\n      bliss::kmer::transform::lex_less,\n      bliss::kmer::hash::farm >;\n  testIndex<bliss::index::kmer::PositionQualityIndex<MapType> >(comm, filename , \"ST, hashvec, pos+qual index\");\n    MPI_Barrier(comm);\n}\n\n\n  if (which == -1 || which == 3)\n  {\n  using MapType = ::dsc::counting_sorted_map<\n      KmerType, uint32_t, int,\n      bliss::kmer::transform::lex_less>;\n  testIndex<bliss::index::kmer::CountIndex<MapType> > (comm, filename, \"ST, sort, count index.\");\n    MPI_Barrier(comm);\n}\n\n    if (which == -1 || which == 5)\n{\n  using MapType = ::dsc::sorted_multimap<\n      KmerType, IdType, int,\n      bliss::kmer::transform::lex_less>;\n  testIndex<bliss::index::kmer::PositionIndex<MapType> >(comm, filename, \"ST, sort, position index.\");\n    MPI_Barrier(comm);\n}\n\n  if (which == -1 || which == 8)\n  {\n  using MapType = ::dsc::sorted_multimap<\n      KmerType, KmerInfoType, int,\n      bliss::kmer::transform::lex_less>;\n  testIndex<bliss::index::kmer::PositionQualityIndex<MapType> >(comm, filename , \"ST, sort, pos+qual index\");\n    MPI_Barrier(comm);\n}\n\n\/\/\n\/\/\n\/\/  if (which == 9)\n\/\/  {\n\/\/  using MapType = ::dsc::counting_map<\n\/\/      KmerType, uint32_t, int,\n\/\/      bliss::kmer::transform::lex_less,\n\/\/      bliss::kmer::hash::farm >;\n\/\/  testIndex<bliss::index::kmer::CountIndex<MapType> > (comm, filename, \"ST, map, count index.\");\n\/\/    MPI_Barrier(comm);\n\/\/}\n\/\/\n\/\/  if (which == 10)\n\/\/  {\n\/\/  using MapType = ::dsc::multimap<\n\/\/      KmerType, IdType, int,\n\/\/      bliss::kmer::transform::lex_less,\n\/\/      bliss::kmer::hash::farm >;\n\/\/  testIndex<bliss::index::kmer::PositionIndex<MapType> >(comm, filename, \"ST, map, position index.\");\n\/\/    MPI_Barrier(comm);\n\/\/}\n\/\/\n\/\/  if (which == 11)\n\/\/  {\n\/\/  using MapType = ::dsc::multimap<\n\/\/      KmerType, KmerInfoType, int,\n\/\/      bliss::kmer::transform::lex_less,\n\/\/      bliss::kmer::hash::farm >;\n\/\/  testIndex<bliss::index::kmer::PositionQualityIndex<MapType> >(comm, filename , \"ST, map, pos+qual index\");\n\/\/    MPI_Barrier(comm);\n\/\/}\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/  clean up MPI.\n  MPI_Finalize();\n\n  \/\/INFOF(\"M Rank %d called MPI_Finalize\", rank);\n\n\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\n\/*\n  Copyright(c) 2015 - 2018 Denis Blank <denis.blank at outlook dot 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 THE\n  SOFTWARE.\n**\/\n\n#include <array>\n#include <cstddef>\n#include <cstdint>\n#include <list>\n#include <memory>\n#include <set>\n#include <type_traits>\n#include <utility>\n#include <vector>\n\n#include <continuable\/continuable-traverse-async.hpp>\n#include <continuable\/detail\/traits.hpp>\n#include <continuable\/detail\/util.hpp>\n\n#include \"test-continuable.hpp\"\n\nusing std::get;\nusing std::make_tuple;\nusing std::tuple;\n\nusing cti::async_traverse_complete_tag;\nusing cti::async_traverse_detach_tag;\nusing cti::async_traverse_in_place_tag;\nusing cti::async_traverse_visit_tag;\nusing cti::detail::util::unused;\nusing cti::traverse_pack_async;\n\n\/\/\/ A tag which isn't accepted by any mapper\nstruct not_accepted_tag {};\n\ntemplate <typename Child>\nclass async_counter_base : public std::enable_shared_from_this<Child> {\n  std::size_t counter_ = 0;\n\npublic:\n  async_counter_base() = default;\n\n  virtual ~async_counter_base() {\n  }\n\n  std::size_t const& counter() const noexcept {\n    return counter_;\n  }\n\n  std::size_t& counter() noexcept {\n    return counter_;\n  }\n};\n\ntemplate <std::size_t ArgCount>\nstruct async_increasing_int_sync_visitor\n    : async_counter_base<async_increasing_int_sync_visitor<ArgCount>> {\n  explicit async_increasing_int_sync_visitor(int \/*dummy*\/) {\n  }\n\n  bool operator()(async_traverse_visit_tag, std::size_t i) {\n    EXPECT_EQ(i, this->counter());\n    ++this->counter();\n    return true;\n  }\n\n  template <typename N>\n  void operator()(async_traverse_detach_tag, std::size_t i, N&& next) {\n    unused(i);\n    unused(next);\n\n    \/\/ Should never be called!\n    EXPECT_TRUE(false);\n  }\n\n  template <typename T>\n  void operator()(async_traverse_complete_tag, T&& pack) {\n    unused(pack);\n\n    EXPECT_EQ(this->counter(), ArgCount);\n    ++this->counter();\n  }\n};\n\ntemplate <std::size_t ArgCount>\nstruct async_increasing_int_visitor\n    : async_counter_base<async_increasing_int_visitor<ArgCount>> {\n  explicit async_increasing_int_visitor(int \/*dummy*\/) {\n  }\n\n  bool operator()(async_traverse_visit_tag, std::size_t i) const {\n    EXPECT_EQ(i, this->counter());\n    return false;\n  }\n\n  template <typename N>\n  void operator()(async_traverse_detach_tag, std::size_t i, N&& next) {\n    unused(i);\n\n    ++this->counter();\n    std::forward<N>(next)();\n  }\n\n  template <typename T>\n  void operator()(async_traverse_complete_tag, T&& pack) {\n    unused(pack);\n\n    EXPECT_EQ(this->counter(), ArgCount);\n    ++this->counter();\n  }\n};\n\ntemplate <std::size_t ArgCount, typename... Args>\nvoid test_async_traversal_base(Args&&... args) {\n  \/\/ Test that every element is traversed in the correct order\n  \/\/ when we detach the control flow on every visit.\n  {\n    auto result =\n        traverse_pack_async(async_traverse_in_place_tag<\n                                async_increasing_int_sync_visitor<ArgCount>>{},\n                            42, args...);\n    EXPECT_EQ(result->counter(), ArgCount + 1U);\n  }\n\n  \/\/ Test that every element is traversed in the correct order\n  \/\/ when we detach the control flow on every visit.\n  {\n    auto result = traverse_pack_async(\n        async_traverse_in_place_tag<async_increasing_int_visitor<ArgCount>>{},\n        42, args...);\n    EXPECT_EQ(result->counter(), ArgCount + 1U);\n  }\n}\n\nTEST(async_traversal, base) {\n  \/\/ Just test everything using a casual int pack\n  test_async_traversal_base<4U>(not_accepted_tag{}, 0U, 1U, not_accepted_tag{},\n                                2U, 3U, not_accepted_tag{});\n}\n\ntemplate <typename ContainerFactory>\nvoid test_async_container_traversal_impl(ContainerFactory&& container_of) {\n  \/\/ Test by passing a containers in the middle\n  test_async_traversal_base<4U>(0U, container_of(1U, 2U), 3U);\n  \/\/ Test by splitting the pack in two containers\n  test_async_traversal_base<4U>(container_of(0U, 1U), container_of(2U, 3U));\n  \/\/ Test by passing a huge containers to the traversal\n  test_async_traversal_base<4U>(container_of(0U, 1U, 2U, 3U));\n}\n\ntemplate <typename T>\nstruct common_container_factory {\n  template <typename... Args>\n  T operator()(Args&&... args) {\n    return T{std::forward<Args>(args)...};\n  }\n};\n\ntemplate <typename T>\nstruct array_container_factory {\n  template <typename... Args, typename Array = std::array<T, sizeof...(Args)>>\n  Array operator()(Args&&... args) {\n    return Array{{std::forward<Args>(args)...}};\n  }\n};\n\nTEST(async_traversal_container, visit_vector) {\n  common_container_factory<std::vector<std::size_t>> factory;\n  test_async_container_traversal_impl(factory);\n}\n\nTEST(async_traversal_container, visit_list) {\n  common_container_factory<std::list<std::size_t>> factory;\n  test_async_container_traversal_impl(factory);\n}\n\nTEST(async_traversal_container, visit_set) {\n  common_container_factory<std::set<std::size_t>> factory;\n  test_async_container_traversal_impl(factory);\n}\n\nTEST(async_traversal_container, visit_array) {\n  array_container_factory<std::size_t> factory;\n  test_async_container_traversal_impl(factory);\n}\n\n\/\/ Test by passing a tuple in the middle\nTEST(async_traversal_tuple_like, visit_tuple) {\n  test_async_traversal_base<4U>(not_accepted_tag{}, 0U,\n                                make_tuple(1U, not_accepted_tag{}, 2U), 3U);\n}\n\n\/\/ Test by splitting the pack in two tuples\nTEST(async_traversal_tuple_like, visit_tuple_nested) {\n  test_async_traversal_base<4U>(make_tuple(0U, not_accepted_tag{}, 1U),\n                                make_tuple(2U, 3U));\n}\n\n\/\/ Test by passing a huge tuple to the traversal\nTEST(async_traversal_tuple_like, visit_tuple_huge) {\n  test_async_traversal_base<4U>(make_tuple(0U, 1U, 2U, 3U));\n}\n\ntemplate <typename T, typename... Args,\n          typename Vector = std::vector<typename std::decay<T>::type>>\nVector vector_of(T&& first, Args&&... args) {\n  return Vector{std::forward<T>(first), std::forward<Args>(args)...};\n}\n\n\/\/ Test hierarchies where container and tuple like types are mixed\nTEST(async_traversal_mixed_traversal, visit_tuple_container) {\n  test_async_traversal_base<4U>(\n      0U, make_tuple(std::vector<std::size_t>{1U, 2U}), 3U);\n}\n\nTEST(async_traversal_mixed_traversal, visit_mixed_non_accepted) {\n  test_async_traversal_base<4U>(\n      make_tuple(0U, vector_of(not_accepted_tag{}), vector_of(vector_of(1U))),\n      make_tuple(2U, 3U));\n}\n\nTEST(async_traversal_mixed_traversal, visit_vector_vector_tuple) {\n  test_async_traversal_base<4U>(\n      vector_of(vector_of(make_tuple(0U, 1U, 2U, 3U))));\n}\n\ntemplate <std::size_t ArgCount>\nstruct async_unique_sync_visitor\n    : async_counter_base<async_unique_sync_visitor<ArgCount>> {\n  explicit async_unique_sync_visitor(int \/*dummy*\/) {\n  }\n\n  bool operator()(async_traverse_visit_tag, std::unique_ptr<std::size_t>& i) {\n    EXPECT_EQ(*i, this->counter());\n    ++this->counter();\n    return true;\n  }\n\n  template <typename N>\n  void operator()(async_traverse_detach_tag, std::unique_ptr<std::size_t>& i,\n                  N&& next) {\n    unused(i);\n    unused(next);\n\n    \/\/ Should never be called!\n    EXPECT_TRUE(false);\n  }\n\n  template <typename T>\n  void operator()(async_traverse_complete_tag, T&& pack) {\n    unused(pack);\n\n    EXPECT_EQ(this->counter(), ArgCount);\n    ++this->counter();\n  }\n};\n\ntemplate <std::size_t ArgCount>\nstruct async_unique_visitor\n    : async_counter_base<async_unique_visitor<ArgCount>> {\n  explicit async_unique_visitor(int \/*dummy*\/) {\n  }\n\n  bool operator()(async_traverse_visit_tag,\n                  std::unique_ptr<std::size_t>& i) const {\n    EXPECT_EQ(*i, this->counter());\n    return false;\n  }\n\n  template <typename N>\n  void operator()(async_traverse_detach_tag, std::unique_ptr<std::size_t>& i,\n                  N&& next) {\n    unused(i);\n\n    ++this->counter();\n    std::forward<N>(next)();\n  }\n\n  template <typename T>\n  void operator()(async_traverse_complete_tag, T&& pack) {\n    unused(pack);\n\n    EXPECT_EQ(this->counter(), ArgCount);\n    ++this->counter();\n  }\n};\n\ntemplate <typename T>\nconstexpr auto of(T i) {\n  return std::make_unique<T>(i);\n}\n\nTEST(async_traverse_in_place, construct_inplace_sync) {\n  auto result = traverse_pack_async(\n      async_traverse_in_place_tag<async_unique_sync_visitor<4>>{}, 42, of(0),\n      of(1), of(2), of(3));\n  EXPECT_EQ(result->counter(), 5U);\n}\n\nTEST(async_traverse_in_place, construct_inplace_async) {\n  auto result = traverse_pack_async(\n      async_traverse_in_place_tag<async_unique_visitor<4>>{}, 42, of(0), of(1),\n      of(2), of(3));\n  EXPECT_EQ(result->counter(), 5U);\n}\n\nstruct invalidate_visitor : async_counter_base<invalidate_visitor> {\n  explicit invalidate_visitor(int \/*dummy*\/) {\n  }\n\n  bool operator()(async_traverse_visit_tag, std::shared_ptr<int>& i) const {\n    EXPECT_EQ(*i, 22);\n    return false;\n  }\n\n  template <typename N>\n  void operator()(async_traverse_detach_tag, std::shared_ptr<int>& i,\n                  N&& next) {\n    unused(i);\n\n    std::forward<N>(next)();\n  }\n\n  \/\/ Test whether the passed pack was passed as r-value reference\n  void operator()(async_traverse_complete_tag,\n                  tuple<std::shared_ptr<int>>&& pack) const {\n    \/\/ Invalidate the moved object\n    tuple<std::shared_ptr<int>> moved = std::move(pack);\n\n    unused(moved);\n  }\n};\n\n\/\/ Check whether the arguments are invalidated (moved out) when called\nTEST(async_complete_invalidation, check_whether_frame_released) {\n  auto value = std::make_shared<int>(22);\n\n  auto frame = traverse_pack_async(\n      async_traverse_in_place_tag<invalidate_visitor>{}, 42, value);\n\n  EXPECT_EQ(value.use_count(), 1L);\n}\n<commit_msg>Remove the 42 in_place_tag workaround<commit_after>\n\/*\n  Copyright(c) 2015 - 2018 Denis Blank <denis.blank at outlook dot 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 THE\n  SOFTWARE.\n**\/\n\n#include <array>\n#include <cstddef>\n#include <cstdint>\n#include <list>\n#include <memory>\n#include <set>\n#include <type_traits>\n#include <utility>\n#include <vector>\n\n#include <continuable\/continuable-traverse-async.hpp>\n#include <continuable\/detail\/traits.hpp>\n#include <continuable\/detail\/util.hpp>\n\n#include \"test-continuable.hpp\"\n\nusing std::get;\nusing std::make_tuple;\nusing std::tuple;\n\nusing cti::async_traverse_complete_tag;\nusing cti::async_traverse_detach_tag;\nusing cti::async_traverse_in_place_tag;\nusing cti::async_traverse_visit_tag;\nusing cti::detail::util::unused;\nusing cti::traverse_pack_async;\n\n\/\/\/ A tag which isn't accepted by any mapper\nstruct not_accepted_tag {};\n\ntemplate <typename Child>\nclass async_counter_base : public std::enable_shared_from_this<Child> {\n  std::size_t counter_ = 0;\n\npublic:\n  async_counter_base() = default;\n\n  virtual ~async_counter_base() {\n  }\n\n  std::size_t const& counter() const noexcept {\n    return counter_;\n  }\n\n  std::size_t& counter() noexcept {\n    return counter_;\n  }\n};\n\ntemplate <std::size_t ArgCount>\nstruct async_increasing_int_sync_visitor\n    : async_counter_base<async_increasing_int_sync_visitor<ArgCount>> {\n  bool operator()(async_traverse_visit_tag, std::size_t i) {\n    EXPECT_EQ(i, this->counter());\n    ++this->counter();\n    return true;\n  }\n\n  template <typename N>\n  void operator()(async_traverse_detach_tag, std::size_t i, N&& next) {\n    unused(i);\n    unused(next);\n\n    \/\/ Should never be called!\n    EXPECT_TRUE(false);\n  }\n\n  template <typename T>\n  void operator()(async_traverse_complete_tag, T&& pack) {\n    unused(pack);\n\n    EXPECT_EQ(this->counter(), ArgCount);\n    ++this->counter();\n  }\n};\n\ntemplate <std::size_t ArgCount>\nstruct async_increasing_int_visitor\n    : async_counter_base<async_increasing_int_visitor<ArgCount>> {\n\n  bool operator()(async_traverse_visit_tag, std::size_t i) const {\n    EXPECT_EQ(i, this->counter());\n    return false;\n  }\n\n  template <typename N>\n  void operator()(async_traverse_detach_tag, std::size_t i, N&& next) {\n    unused(i);\n\n    ++this->counter();\n    std::forward<N>(next)();\n  }\n\n  template <typename T>\n  void operator()(async_traverse_complete_tag, T&& pack) {\n    unused(pack);\n\n    EXPECT_EQ(this->counter(), ArgCount);\n    ++this->counter();\n  }\n};\n\ntemplate <std::size_t ArgCount, typename... Args>\nvoid test_async_traversal_base(Args&&... args) {\n  \/\/ Test that every element is traversed in the correct order\n  \/\/ when we detach the control flow on every visit.\n  {\n    auto result = traverse_pack_async(\n        async_increasing_int_sync_visitor<ArgCount>{}, args...);\n    EXPECT_EQ(result->counter(), ArgCount + 1U);\n  }\n\n  \/\/ Test that every element is traversed in the correct order\n  \/\/ when we detach the control flow on every visit.\n  {\n    auto result =\n        traverse_pack_async(async_increasing_int_visitor<ArgCount>{}, args...);\n    EXPECT_EQ(result->counter(), ArgCount + 1U);\n  }\n}\n\nTEST(async_traversal, base) {\n  \/\/ Just test everything using a casual int pack\n  test_async_traversal_base<4U>(not_accepted_tag{}, 0U, 1U, not_accepted_tag{},\n                                2U, 3U, not_accepted_tag{});\n}\n\ntemplate <typename ContainerFactory>\nvoid test_async_container_traversal_impl(ContainerFactory&& container_of) {\n  \/\/ Test by passing a containers in the middle\n  test_async_traversal_base<4U>(0U, container_of(1U, 2U), 3U);\n  \/\/ Test by splitting the pack in two containers\n  test_async_traversal_base<4U>(container_of(0U, 1U), container_of(2U, 3U));\n  \/\/ Test by passing a huge containers to the traversal\n  test_async_traversal_base<4U>(container_of(0U, 1U, 2U, 3U));\n}\n\ntemplate <typename T>\nstruct common_container_factory {\n  template <typename... Args>\n  T operator()(Args&&... args) {\n    return T{std::forward<Args>(args)...};\n  }\n};\n\ntemplate <typename T>\nstruct array_container_factory {\n  template <typename... Args, typename Array = std::array<T, sizeof...(Args)>>\n  Array operator()(Args&&... args) {\n    return Array{{std::forward<Args>(args)...}};\n  }\n};\n\nTEST(async_traversal_container, visit_vector) {\n  common_container_factory<std::vector<std::size_t>> factory;\n  test_async_container_traversal_impl(factory);\n}\n\nTEST(async_traversal_container, visit_list) {\n  common_container_factory<std::list<std::size_t>> factory;\n  test_async_container_traversal_impl(factory);\n}\n\nTEST(async_traversal_container, visit_set) {\n  common_container_factory<std::set<std::size_t>> factory;\n  test_async_container_traversal_impl(factory);\n}\n\nTEST(async_traversal_container, visit_array) {\n  array_container_factory<std::size_t> factory;\n  test_async_container_traversal_impl(factory);\n}\n\n\/\/ Test by passing a tuple in the middle\nTEST(async_traversal_tuple_like, visit_tuple) {\n  test_async_traversal_base<4U>(not_accepted_tag{}, 0U,\n                                make_tuple(1U, not_accepted_tag{}, 2U), 3U);\n}\n\n\/\/ Test by splitting the pack in two tuples\nTEST(async_traversal_tuple_like, visit_tuple_nested) {\n  test_async_traversal_base<4U>(make_tuple(0U, not_accepted_tag{}, 1U),\n                                make_tuple(2U, 3U));\n}\n\n\/\/ Test by passing a huge tuple to the traversal\nTEST(async_traversal_tuple_like, visit_tuple_huge) {\n  test_async_traversal_base<4U>(make_tuple(0U, 1U, 2U, 3U));\n}\n\ntemplate <typename T, typename... Args,\n          typename Vector = std::vector<typename std::decay<T>::type>>\nVector vector_of(T&& first, Args&&... args) {\n  return Vector{std::forward<T>(first), std::forward<Args>(args)...};\n}\n\n\/\/ Test hierarchies where container and tuple like types are mixed\nTEST(async_traversal_mixed_traversal, visit_tuple_container) {\n  test_async_traversal_base<4U>(\n      0U, make_tuple(std::vector<std::size_t>{1U, 2U}), 3U);\n}\n\nTEST(async_traversal_mixed_traversal, visit_mixed_non_accepted) {\n  test_async_traversal_base<4U>(\n      make_tuple(0U, vector_of(not_accepted_tag{}), vector_of(vector_of(1U))),\n      make_tuple(2U, 3U));\n}\n\nTEST(async_traversal_mixed_traversal, visit_vector_vector_tuple) {\n  test_async_traversal_base<4U>(\n      vector_of(vector_of(make_tuple(0U, 1U, 2U, 3U))));\n}\n\ntemplate <std::size_t ArgCount>\nstruct async_unique_sync_visitor\n    : async_counter_base<async_unique_sync_visitor<ArgCount>> {\n\n  explicit async_unique_sync_visitor() = default;\n  explicit async_unique_sync_visitor(not_accepted_tag) {\n  }\n\n  bool operator()(async_traverse_visit_tag, std::unique_ptr<std::size_t>& i) {\n    EXPECT_EQ(*i, this->counter());\n    ++this->counter();\n    return true;\n  }\n\n  template <typename N>\n  void operator()(async_traverse_detach_tag, std::unique_ptr<std::size_t>& i,\n                  N&& next) {\n    unused(i);\n    unused(next);\n\n    \/\/ Should never be called!\n    EXPECT_TRUE(false);\n  }\n\n  template <typename T>\n  void operator()(async_traverse_complete_tag, T&& pack) {\n    unused(pack);\n\n    EXPECT_EQ(this->counter(), ArgCount);\n    ++this->counter();\n  }\n};\n\ntemplate <std::size_t ArgCount>\nstruct async_unique_visitor\n    : async_counter_base<async_unique_visitor<ArgCount>> {\n\n  explicit async_unique_visitor() = default;\n  explicit async_unique_visitor(not_accepted_tag) {\n  }\n\n  bool operator()(async_traverse_visit_tag,\n                  std::unique_ptr<std::size_t>& i) const {\n    EXPECT_EQ(*i, this->counter());\n    return false;\n  }\n\n  template <typename N>\n  void operator()(async_traverse_detach_tag, std::unique_ptr<std::size_t>& i,\n                  N&& next) {\n    unused(i);\n\n    ++this->counter();\n    std::forward<N>(next)();\n  }\n\n  template <typename T>\n  void operator()(async_traverse_complete_tag, T&& pack) {\n    unused(pack);\n\n    EXPECT_EQ(this->counter(), ArgCount);\n    ++this->counter();\n  }\n};\n\ntemplate <typename T>\nconstexpr auto of(T i) {\n  return std::make_unique<T>(i);\n}\n\nTEST(async_traverse_in_place, construct_inplace_sync) {\n  auto result = traverse_pack_async(\n      async_traverse_in_place_tag<async_unique_sync_visitor<4>>{},\n      not_accepted_tag{}, of(0), of(1), of(2), of(3));\n  EXPECT_EQ(result->counter(), 5U);\n}\n\nTEST(async_traverse_in_place, construct_inplace_async) {\n  auto result = traverse_pack_async(\n      async_traverse_in_place_tag<async_unique_visitor<4>>{},\n      not_accepted_tag{}, of(0), of(1), of(2), of(3));\n  EXPECT_EQ(result->counter(), 5U);\n}\n\nstruct invalidate_visitor : async_counter_base<invalidate_visitor> {\n  bool operator()(async_traverse_visit_tag, std::shared_ptr<int>& i) const {\n    EXPECT_EQ(*i, 22);\n    return false;\n  }\n\n  template <typename N>\n  void operator()(async_traverse_detach_tag, std::shared_ptr<int>& i,\n                  N&& next) {\n    unused(i);\n\n    std::forward<N>(next)();\n  }\n\n  \/\/ Test whether the passed pack was passed as r-value reference\n  void operator()(async_traverse_complete_tag,\n                  tuple<std::shared_ptr<int>>&& pack) const {\n    \/\/ Invalidate the moved object\n    tuple<std::shared_ptr<int>> moved = std::move(pack);\n\n    unused(moved);\n  }\n};\n\n\/\/ Check whether the arguments are invalidated (moved out) when called\nTEST(async_complete_invalidation, check_whether_frame_released) {\n  auto value = std::make_shared<int>(22);\n\n  auto frame = traverse_pack_async(invalidate_visitor{}, value);\n\n  EXPECT_EQ(value.use_count(), 1L);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*********************************************************************\n * tm700_demo_node.cpp\n *\n * Copyright 2016 Copyright 2016 Techman Robot 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: Yun-Hsuan Tsai\n *\/\n\n#include <ros\/ros.h>\n#include <ros\/console.h>\n\n#include <moveit\/move_group_interface\/move_group.h>\n#include <moveit\/planning_scene_interface\/planning_scene_interface.h>\n#include <moveit\/robot_state\/robot_state.h>\n#include <moveit\/robot_state\/conversions.h>\n\n#include <moveit_msgs\/DisplayRobotState.h>\n#include <moveit_msgs\/DisplayTrajectory.h>\n\n#include <moveit_msgs\/AttachedCollisionObject.h>\n#include <moveit_msgs\/CollisionObject.h>\n\n#include <stdlib.h>\n#include <iostream>\n#include <fstream>\n#include <string>\n#include <vector>\n#include <cmath>\n\n#include \"tm_msgs\/SetIO.h\"\n\/\/#include \"tm_msgs\/SetIORequest.h\"\n\/\/#include \"tm_msgs\/SetIOResponse.h\"\n\n\n\n\/\/get current joint values of TM5\nvoid get_current_joint_values(moveit::planning_interface::MoveGroup& group,\n                              moveit::planning_interface::MoveGroup::Plan& plan,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t){\n\t\t\/\/if(!ros::ok()) return false;\n\t\tbool success = false;\n\n\t\tstd::vector<double> joint_value;\n\t\tjoint_value = group.getCurrentJointValues();\n\n\t\tfor(int i = 0; i<joint_value.size(); i++){\n\t\t\tjoint_value[i] = joint_value[i]*180\/M_PI;\n\t\t\tprintf(\"Joint %d: %lf\\n\",i+1 joint_value[i]);\n\t\t}\n}\n\nbool try_move_to_named_target(moveit::planning_interface::MoveGroup& group,\n\t\t\t      moveit::planning_interface::MoveGroup::Plan& plan,\n\t\t\t      const std::string& target_name,\n\t\t\t      unsigned int max_try_times = 1\n\t\t\t     ) {\n  if(!ros::ok()) return false;\n  bool success = false;\n\n  for(unsigned int i = 0; i < max_try_times; i++) {\n\n    group.setNamedTarget(target_name);\n\n    if(group.move()) {\n      success = true;\n      break;\n    }\n    else {\n      if(!ros::ok()) break;\n      sleep(1);\n    }\n  }\n  return success;\n}\n\nbool try_move_to_joint_target(moveit::planning_interface::MoveGroup& group,\n\t\t\t      moveit::planning_interface::MoveGroup::Plan& plan,\n\t\t\t      const std::vector<double>& joint_target,\n\t\t\t      unsigned int max_try_times = 1\n\t\t\t     ) {\n  if(!ros::ok()) return false;\n  bool success = false;\n\n  for(unsigned int i = 0; i < max_try_times; i++) {\n\n    group.setJointValueTarget(joint_target);\n\n    if(group.move()) {\n      success = true;\n      break;\n    }\n    else {\n      if(!ros::ok()) break;\n      sleep(1);\n    }\n  }\n}\n\nint main(int argc, char **argv)\n{\n\n  ros::init(argc, argv, \"tm700_demo_test\");\n  ros::NodeHandle node_handle;\n  ros::ServiceClient set_io_client = node_handle.serviceClient<tm_msgs::SetIO>(\"tm_driver\/set_io\");\n  tm_msgs::SetIO io_srv;\n  io_srv.request.fun = 2;\/\/tm_msgs::SetIORequest::FUN_SET_EE_DIGITAL_OUT;\n  io_srv.request.ch = 0;\n  io_srv.request.value = 0.0;\n\n  \/\/ start a background \"spinner\", so our node can process ROS messages\n  \/\/  - this lets us know when the move is completed\n  ros::AsyncSpinner spinner(1);\n  spinner.start();\n\n  sleep(1);\n\n  \/\/ Setup\n  \/\/ ^^^^^\n  \/\/ The :move_group_interface:`MoveGroup` class can be easily\n  \/\/ setup using just the name\n  \/\/ of the group you would like to control and plan for.\n  moveit::planning_interface::MoveGroup group(\"manipulator\");\n  \/\/ We will use the :planning_scene_interface:`PlanningSceneInterface`\n  \/\/ class to deal directly with the world.\n  moveit::planning_interface::PlanningSceneInterface planning_scene_interface;\n  \/\/ (Optional) Create a publisher for visualizing plans in Rviz.\n  \/\/ros::Publisher display_publisher = node_handle.advertise<moveit_msgs::DisplayTrajectory>(\"\/move_group\/display_planned_path\", 1, true);\n  \/\/moveit_msgs::DisplayTrajectory display_trajectory;\n\n  \/\/ Getting Basic Information\n  \/\/ ^^^^^^^^^^^^^^^^^^^^^^^^^\n  \/\/ We can print the name of the reference frame for this robot.\n  ROS_INFO(\"Reference frame: %s\", group.getPlanningFrame().c_str());\n  \/\/ We can also print the name of the end-effector link for this group.\n  ROS_INFO(\"Reference frame: %s\", group.getEndEffectorLink().c_str());\n\n  moveit::planning_interface::MoveGroup::Plan my_plan;\n\n  set_io_client.call(io_srv);\n\n  group.setPlanningTime(30.0);\n\n  \/\/try_move_to_named_target(group, my_plan, \"home\", 100);\n\n  std::vector<double> joint_target_1;\n  std::vector<double> joint_target_2;\n\n  joint_target_1.assign(6, 0.0f);\n  joint_target_1[0] = 0.0174533*( 30.0);\n  joint_target_1[1] = 0.0174533*( 15.0);\n  joint_target_1[2] = 0.0174533*(105.0);\n  joint_target_1[3] = 0.0174533*(-30.0);\n  joint_target_1[4] = 0.0174533*( 90.0);\n  joint_target_1[5] = 0.0174533*( 30.0);\n\n  joint_target_2.assign(6, 0.0f);\n  joint_target_2[0] = 0.0174533*(-30.0);\n  joint_target_2[1] = 0.0174533*(-15.0);\n  joint_target_2[2] = 0.0174533*( 90.0);\n  joint_target_2[3] = 0.0174533*(-75.0);\n  joint_target_2[4] = 0.0174533*(120.0);\n\n  int step = 0;\n\n  while (ros::ok()) {\n    switch (step) {\n      case 0: \/\/gripper off\n\tio_srv.request.fun = 2;\n\tio_srv.request.ch = 0;\n\tio_srv.request.value = 0.0;\n\tif (set_io_client.call(io_srv))\n\t  ROS_INFO(\"Set IO success\");\n\telse\n\t  ROS_WARN(\"Failed to call service set_io\");\n\tbreak;\n\n      case 1: \/\/move to ready\n\tROS_INFO(\"move...\");\n\t\/\/try_move_to_named_target(group, my_plan, \"ready\", 100);\n\tbreak;\n\n      case 2: \/\/light on\n\/*\n\tio_srv.request.fun = 2;\n\tio_srv.request.ch = 3;\n\tio_srv.request.value = 1.0;\n*\/\n\tif (set_io_client.call(io_srv))\n\t  ROS_INFO(\"Set IO success\");\n\telse\n\t  ROS_WARN(\"Failed to call service set_io\");\n\tbreak;\n\n      case 3: \/\/wait 3 sec\n\tsleep(3);\n\tbreak;\n\n      case 4: \/\/light off\n\tio_srv.request.fun = 2;\n\tio_srv.request.ch = 3;\n\tio_srv.request.value = 0.0;\n\tif (set_io_client.call(io_srv))\n\t  ROS_INFO(\"Set IO success\");\n\telse\n\t  ROS_WARN(\"Failed to call service set_io\");\n\tbreak;\n\n      case 5: \/\/move 1\n\t\/\/ROS_INFO(\"move...\");\n\t\/\/try_move_to_joint_target(group, my_plan, joint_target_1, 100);\n\tROS_INFO(\"Read Joints Values\");\n\tget_current_joint_values(group, my_plan);\n\tbreak;\n\n      case 6: \/\/gripper on\n\tio_srv.request.fun = 2;\n\tio_srv.request.ch = 0;\n\tio_srv.request.value = 1.0;\n\tif (set_io_client.call(io_srv))\n\t  ROS_INFO(\"Set IO success\");\n\telse\n\t  ROS_WARN(\"Failed to call service set_io\");\n\tbreak;\n\n      case 7: \/\/wait 1 sec\n\tsleep(1);\n\tbreak;\n\n      case 8: \/\/move 2...\n\tROS_INFO(\"move...\");\n\t\/\/try_move_to_joint_target(group, my_plan, joint_target_2, 100);\n\tbreak;\n    }\n    step = (step + 1) % 9;\n  }\n  return 0;\n}\n<commit_msg>Fix the bug in get_current_joint_values()<commit_after>\/*********************************************************************\n * tm700_demo_node.cpp\n *\n * Copyright 2016 Copyright 2016 Techman Robot 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: Yun-Hsuan Tsai\n *\/\n\n#include <ros\/ros.h>\n#include <ros\/console.h>\n\n#include <moveit\/move_group_interface\/move_group.h>\n#include <moveit\/planning_scene_interface\/planning_scene_interface.h>\n#include <moveit\/robot_state\/robot_state.h>\n#include <moveit\/robot_state\/conversions.h>\n\n#include <moveit_msgs\/DisplayRobotState.h>\n#include <moveit_msgs\/DisplayTrajectory.h>\n\n#include <moveit_msgs\/AttachedCollisionObject.h>\n#include <moveit_msgs\/CollisionObject.h>\n\n#include <stdlib.h>\n#include <iostream>\n#include <fstream>\n#include <string>\n#include <vector>\n#include <cmath>\n\n#include \"tm_msgs\/SetIO.h\"\n\/\/#include \"tm_msgs\/SetIORequest.h\"\n\/\/#include \"tm_msgs\/SetIOResponse.h\"\n\n\n\n\/\/get current joint values of TM5\nvoid get_current_joint_values(moveit::planning_interface::MoveGroup& group,\n                              moveit::planning_interface::MoveGroup::Plan& plan\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t){\n\t\t\/\/if(!ros::ok()) return false;\n\t\tbool success = false;\n\n\t\tstd::vector<double> joint_value;\n\t\tjoint_value = group.getCurrentJointValues();\n\n\t\tfor(int i = 0; i<joint_value.size(); i++){\n\t\t\tjoint_value[i] = joint_value[i]*180\/M_PI;\n\t\t\tprintf(\"Joint %d: %lf\\n\",i+1, joint_value[i]);\n\t\t}\n}\n\nbool try_move_to_named_target(moveit::planning_interface::MoveGroup& group,\n\t\t\t      moveit::planning_interface::MoveGroup::Plan& plan,\n\t\t\t      const std::string& target_name,\n\t\t\t      unsigned int max_try_times = 1\n\t\t\t     ) {\n  if(!ros::ok()) return false;\n  bool success = false;\n\n  for(unsigned int i = 0; i < max_try_times; i++) {\n\n    group.setNamedTarget(target_name);\n\n    if(group.move()) {\n      success = true;\n      break;\n    }\n    else {\n      if(!ros::ok()) break;\n      sleep(1);\n    }\n  }\n  return success;\n}\n\nbool try_move_to_joint_target(moveit::planning_interface::MoveGroup& group,\n\t\t\t      moveit::planning_interface::MoveGroup::Plan& plan,\n\t\t\t      const std::vector<double>& joint_target,\n\t\t\t      unsigned int max_try_times = 1\n\t\t\t     ) {\n  if(!ros::ok()) return false;\n  bool success = false;\n\n  for(unsigned int i = 0; i < max_try_times; i++) {\n\n    group.setJointValueTarget(joint_target);\n\n    if(group.move()) {\n      success = true;\n      break;\n    }\n    else {\n      if(!ros::ok()) break;\n      sleep(1);\n    }\n  }\n}\n\nint main(int argc, char **argv)\n{\n\n  ros::init(argc, argv, \"tm700_demo_test\");\n  ros::NodeHandle node_handle;\n  ros::ServiceClient set_io_client = node_handle.serviceClient<tm_msgs::SetIO>(\"tm_driver\/set_io\");\n  tm_msgs::SetIO io_srv;\n  io_srv.request.fun = 2;\/\/tm_msgs::SetIORequest::FUN_SET_EE_DIGITAL_OUT;\n  io_srv.request.ch = 0;\n  io_srv.request.value = 0.0;\n\n  \/\/ start a background \"spinner\", so our node can process ROS messages\n  \/\/  - this lets us know when the move is completed\n  ros::AsyncSpinner spinner(1);\n  spinner.start();\n\n  sleep(1);\n\n  \/\/ Setup\n  \/\/ ^^^^^\n  \/\/ The :move_group_interface:`MoveGroup` class can be easily\n  \/\/ setup using just the name\n  \/\/ of the group you would like to control and plan for.\n  moveit::planning_interface::MoveGroup group(\"manipulator\");\n  \/\/ We will use the :planning_scene_interface:`PlanningSceneInterface`\n  \/\/ class to deal directly with the world.\n  moveit::planning_interface::PlanningSceneInterface planning_scene_interface;\n  \/\/ (Optional) Create a publisher for visualizing plans in Rviz.\n  \/\/ros::Publisher display_publisher = node_handle.advertise<moveit_msgs::DisplayTrajectory>(\"\/move_group\/display_planned_path\", 1, true);\n  \/\/moveit_msgs::DisplayTrajectory display_trajectory;\n\n  \/\/ Getting Basic Information\n  \/\/ ^^^^^^^^^^^^^^^^^^^^^^^^^\n  \/\/ We can print the name of the reference frame for this robot.\n  ROS_INFO(\"Reference frame: %s\", group.getPlanningFrame().c_str());\n  \/\/ We can also print the name of the end-effector link for this group.\n  ROS_INFO(\"Reference frame: %s\", group.getEndEffectorLink().c_str());\n\n  moveit::planning_interface::MoveGroup::Plan my_plan;\n\n  set_io_client.call(io_srv);\n\n  group.setPlanningTime(30.0);\n\n  \/\/try_move_to_named_target(group, my_plan, \"home\", 100);\n\n  std::vector<double> joint_target_1;\n  std::vector<double> joint_target_2;\n\n  joint_target_1.assign(6, 0.0f);\n  joint_target_1[0] = 0.0174533*( 30.0);\n  joint_target_1[1] = 0.0174533*( 15.0);\n  joint_target_1[2] = 0.0174533*(105.0);\n  joint_target_1[3] = 0.0174533*(-30.0);\n  joint_target_1[4] = 0.0174533*( 90.0);\n  joint_target_1[5] = 0.0174533*( 30.0);\n\n  joint_target_2.assign(6, 0.0f);\n  joint_target_2[0] = 0.0174533*(-30.0);\n  joint_target_2[1] = 0.0174533*(-15.0);\n  joint_target_2[2] = 0.0174533*( 90.0);\n  joint_target_2[3] = 0.0174533*(-75.0);\n  joint_target_2[4] = 0.0174533*(120.0);\n\n  int step = 0;\n\n  while (ros::ok()) {\n    switch (step) {\n      case 0: \/\/gripper off\n\tio_srv.request.fun = 2;\n\tio_srv.request.ch = 0;\n\tio_srv.request.value = 0.0;\n\tif (set_io_client.call(io_srv))\n\t  ROS_INFO(\"Set IO success\");\n\telse\n\t  ROS_WARN(\"Failed to call service set_io\");\n\tbreak;\n\n      case 1: \/\/move to ready\n\tROS_INFO(\"move...\");\n\t\/\/try_move_to_named_target(group, my_plan, \"ready\", 100);\n\tbreak;\n\n      case 2: \/\/light on\n\/*\n\tio_srv.request.fun = 2;\n\tio_srv.request.ch = 3;\n\tio_srv.request.value = 1.0;\n*\/\n\tif (set_io_client.call(io_srv))\n\t  ROS_INFO(\"Set IO success\");\n\telse\n\t  ROS_WARN(\"Failed to call service set_io\");\n\tbreak;\n\n      case 3: \/\/wait 3 sec\n\tsleep(3);\n\tbreak;\n\n      case 4: \/\/light off\n\tio_srv.request.fun = 2;\n\tio_srv.request.ch = 3;\n\tio_srv.request.value = 0.0;\n\tif (set_io_client.call(io_srv))\n\t  ROS_INFO(\"Set IO success\");\n\telse\n\t  ROS_WARN(\"Failed to call service set_io\");\n\tbreak;\n\n      case 5: \/\/move 1\n\t\/\/ROS_INFO(\"move...\");\n\t\/\/try_move_to_joint_target(group, my_plan, joint_target_1, 100);\n\tROS_INFO(\"Read Joints Values\");\n\tget_current_joint_values(group, my_plan);\n\tbreak;\n\n      case 6: \/\/gripper on\n\tio_srv.request.fun = 2;\n\tio_srv.request.ch = 0;\n\tio_srv.request.value = 1.0;\n\tif (set_io_client.call(io_srv))\n\t  ROS_INFO(\"Set IO success\");\n\telse\n\t  ROS_WARN(\"Failed to call service set_io\");\n\tbreak;\n\n      case 7: \/\/wait 1 sec\n\tsleep(1);\n\tbreak;\n\n      case 8: \/\/move 2...\n\tROS_INFO(\"move...\");\n\t\/\/try_move_to_joint_target(group, my_plan, joint_target_2, 100);\n\tbreak;\n    }\n    step = (step + 1) % 9;\n  }\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"consoleui.h\"\n#include <iostream>\n#include <iomanip>\nusing namespace std;\n\nconsoleUI::consoleUI()\n{\n\n}\n\nconsoleUI::consoleUI(int chooseNumber)\n{\n    _chooseNumber = chooseNumber;\n}\n\nbool consoleUI::digitCheck(int digit)\n{\n    if(isdigit(digit))\n    {\n        return true;\n    }\n    return false;\n}\n\nvoid consoleUI::run()\n{\n    int chooseNumber;\n\n    cout << \"           _______ _______ ______ _______ ______      ______ \" << endl;\n    cout << \"          |   |   |       |   __ \\\\   |   |   __ \\\\    |  __  |\" << endl;\n    cout << \"          |       |   -   |    __\/   |   |      <    |__    |\" << endl;\n    cout << \"          |___|___|_______|___|  |_______|___|__|    |______|\" << endl;\n\n\n    cout << \"------------------------------------------------------------------\" << endl;\n    cout << \"*------ Database for Scientist ----------*--------Glossary-------*\" << endl;\n    cout << \"* 1:  Display entire list.               * Y.O.D = date of death *\" << endl;\n    cout << \"* 2:  Search by name.                    * Y.O.B = date of birth *\"<< endl;\n    cout << \"* 3:  Search if alive.                   * Y.O.A = year of award *\" << endl;\n    cout << \"* 4:  Sort by award year.                *                       *\" << endl;\n    cout << \"* 5:  Add new scientist.                 *                       *\" << endl;\n    cout << \"* 6:  Search for birth year.             *                       *\" << endl;\n    cout << \"* 7:  Disply list in alphabetical order  *                       *\" << endl;\n    cout << \"* 8:  Sort by birthyear.                 *                       *\" << endl;\n    cout << \"* 9:  Search for Turing award winner.    *                       *\" << endl;\n    cout << \"* 10: Chuck Norris.                      *                       *\" << endl;\n    cout << \"*----------------------------------------*-----------------------*\" << endl;\n    cout << \"-----------------------------------------------------------------\" << endl;\n    cout << \"Enter number: \";\n\n    cin >> chooseNumber;\n\n\n    if((chooseNumber < 1) || (chooseNumber > 11) || digitCheck(chooseNumber))\n    {\n        cout << \"Please enter a valid input: \" << endl;\n        exit(1);\n    }\n    else\n    {\n    }\n\n\n    \/\/This function sends you (from the number you pick) to the right corresponding case\n    switch (chooseNumber)\n    {\n        \/\/This function displays a list of all the scientists (that is there full names, dob, dod and year of award)\n        case 1:\n        {\n            listServices scientists;\n            cout << \"***List of all scientists***\" << endl;\n            print();\n            printNames(scientists);\n        }\n            break;\n\n        \/\/This function lets you search for a scientist from their name (either the first or last name)\n        case 2:\n            {\n                listServices scientists;\n                \/\/listServices searchName2;\n                string searchTerm;\n                cout << \"Enter a single name to search: \";\n                cin >> searchTerm;\n                scientists.changeTo(_scientist.searchName(searchTerm));\n                print();\n                printNames(scientists);\n\n            }\n            break;\n\n        \/\/This function organizes the living scientists from oldest to youngest\n        case 3:\n            {\n                listServices scientists;\n                string searchTerm;\n                scientists.changeTo(_scientist.searchAlive());\n                cout << \"An organized list starting with the oldest living scientist\" << endl;\n                print();\n                printNames(scientists);\n             }\n              break;\n\n        \/\/This function sorts the scientists by the year they received an award\n        case 4:\n            {\n                listServices scientistsByAward;\n                scientistsByAward.changeTo(_scientist.sortByAward());\n                cout << \"An organized list of scientists in order of when they received the Turing award.\" << endl;\n                print();\n                printNames(scientistsByAward);\n             }\n            break;\n\n        case 5:\n            {\n                \/\/addNew\n                string firstName;\n                string lastName;\n                char gender;\n                int birthYear;\n                char isAlive;\n                int deathYear;\n                char isWinner;\n                int awardYear;\n                bool cont = false;\n                bool hasOnlyChar = true;\n\n\n                firstName = nameChecker(\"first name\");\n                lastName = nameChecker(\"last name\");\n                gender = genderChecker();\n                cout << \"Enter the scientist's birth year: \";\n                cin >> birthYear;\n                cout << \"Is the scientist still alive? (y\/n) \";\n                cin >> isAlive;\n                if(isAlive == 'n')\n                {\n                    cout << \"Enter the scientist's year of death: \";\n                    cin >>  deathYear;\n                }\n                else if(isAlive == 'y')\n                {\n                    deathYear = 0;\n                }\n                else\n                {\n                    cout << \"Invalid entry.  Please enter either y (yes) or n (no)\";\n                }\n                cout << \"Did the scientist win a Turing award? (y\/n)\";\n                cin >> isWinner;\n                if(isWinner == 'y')\n                {\n                    cout << \"Enter the year the scientist won: \";\n                    cin >>  awardYear;\n                }\n                else if(isWinner == 'n')\n                {\n                    awardYear = 0;\n                }\n                else\n                {\n                    cout << \"Invalid entry.  Please enter either y (yes) or n (no)\";\n                }\n\n                _scientist.addNew(firstName, lastName, gender, birthYear, deathYear, awardYear);\n            }\n            break;\n\n    \/\/searchBirth\n    case 6:\n        {\n            int year;\n            cout << \"Enter year: \";\n            cin >> year;\n            listServices scientistsBirth;\n            scientistsBirth.changeTo(scientistsBirth.searchBirth(year, year));\n            cout << \"A list of scientists born in your year of choice\" << endl;\n            print();\n            printNames(scientistsBirth);\n         }\n          break;\n\n    \/\/This function sorts all the scientists by their name in an alpabetical order\n    case 7:\n    {\n        listServices sort;\n        sort.changeTo(_scientist.sortByName());\n        cout << \"A list of scinetists in alphabetical order\" << endl;\n        print();\n        printNames(sort);\n\n    }\n        break;\n\n    \/\/This function displays the scientists in an organized list from oldest to youngest\n    case 8:\n            _scientist.changeTo(_scientist.sortByBirth());\n            cout << \"An organized list starting with the oldest scientist\" << endl;\n            print();\n            printNames(_scientist);\n        break;\n\n    \/\/This function sorts the scientists by the year they recived the Turning Award\n    case 9:\n            _scientist.changeTo(_scientist.sortByAward());\n            cout << \"An organized list of scientists in order of when they received a Turing award.\" << endl;\n            print();\n            printNames(_scientist);\n         break;\n\n    \/\/All the scientist will become infinitely more awesome because this function changes all of there names to Chuck Norris\n    case 10:\n    {\n        listServices norris;\n \/* for(int i = 0; i < _scientist.chuckNorris(); i++){\n       _scientist.chu\n  }*\/\n\n\n        norris.changeTo(_scientist.chuckNorris());\n        print();\n        printNames(norris);\n\n        break;\n    }\n    }\n\n}\n\n\n\nstring consoleUI::nameChecker(string nameType)\n{\n    string name;\n    bool cont = false;\n    bool hasOnlyChar = true;\n\n       while(!cont)\n       {\n       cout << \"Please enter the scientist's \" << nameType << \": \";\n       cin >> name;\n       for(unsigned int i = 0; i < name.length(); i++)\n       {\n           if(!isalpha(name[i]) && name[i] != '.')\n           {\n               hasOnlyChar = false;\n           }\n       }\n       if(name.length() <2 || name.length()>16)\n          {\n           cout <<\"Error: Names must be between 2 and 16 characters.\" << endl;\n           }\n       else if(!hasOnlyChar)\n       {\n          cout << \"Error: Names can only contain characters from the latin alphabet.\" << endl;\n          hasOnlyChar = true;\n       }\n       else\n       {\n          cont = true;\n       }\n       }\n\n       return name;\n}\n\n\/\/prompts the user for\nchar consoleUI::genderChecker()\n{\n    bool cont = false;\n    string gender;\n\n    while(!cont)\n    {\n        cout << \"Enter the scientist's gender (m\/f\/o) : \" ;\n        cin >> gender;\n\n        if(isalpha(gender[0]) && (gender[0] == 'm' || gender[0] == 'f' || gender[0] == 'o') && gender.size() == 1)\n        {\n            cont = true;\n        }\n        else\n        {\n            cout << \"Invalid input.  Please enter either 'm' for male or 'f' for female or 'o' for other.\" << endl;\n        }\n    }\n\n    return gender[0];\n}\n\n\nvoid consoleUI::print()\n{\n    listServices scientists;\n\n    cout.width(4);\n    cout << left << \"No.\";\n    cout.width(scientists.searchLongestName());\n    cout << \"Firstname\" << left;\n    cout.width(10);\n    cout << \"Lastname\" << left;\n    cout.width(10);\n    cout << \"gender\" << left;\n    cout.width(10);\n    cout << \"Y.O.B\" << left;\n    cout.width(10);\n    cout << \"Y.O.D\" << left;\n    cout.width(scientists.searchLongestName());\n    cout << \"Y.O.A\" << left << endl;\n    for(int i = 0 ; i < 9 ; i++)\n    {\n        cout << \"--------\";\n    }\n    cout << endl;\n}\n\nvoid consoleUI::printNames (listServices scientistsToPrint)\n{\n    int counter = 1;\n    for(int i = 0; i < scientistsToPrint.getSize() ; i++)\n    {\n        string sex;\n        string isDead;\n        if(scientistsToPrint.getSexFromList(i) == 'm')\n        {\n            sex = \"male\";\n        }\n        else if(scientistsToPrint.getSexFromList(i) == 'f')\n        {\n            sex = \"female\";\n        }\n        else\n        {\n            sex = \"other\";\n        }\n        cout.width(5);\n        cout << left << counter;\n        counter++;\n        cout.width(10);\n        cout << scientistsToPrint.getFirstNameFromList(i) << left;\n        cout.width(10);\n        cout << scientistsToPrint.getLastNameFromList(i) << left;\n        cout.width(10);\n        cout << sex << left;\n        cout.width(10);\n        cout << scientistsToPrint.dobFromList(i) << left;\n        if(scientistsToPrint.dodFromList(i) == 0)\n        {\n            isDead = \"Alive\";\n            cout.width(10);\n            cout << isDead << left;\n        }\n        else\n        {\n            cout.width(10);\n            cout << scientistsToPrint.dodFromList(i) << left;\n        }\n        cout.width(10);\n        cout << scientistsToPrint.getAwardsFromList(i) << left;;\n        cout << \"   *\" << endl;\n\n    }\n    for(int i = 0 ; i < 9 ; i++)\n    {\n        cout << \"--------\";\n    }\n    cout << endl;\n}\n<commit_msg>looooooop<commit_after>#include \"consoleui.h\"\n#include <iostream>\n#include <iomanip>\nusing namespace std;\n\nconsoleUI::consoleUI()\n{\n\n}\n\nconsoleUI::consoleUI(int chooseNumber)\n{\n    _chooseNumber = chooseNumber;\n}\n\nbool consoleUI::digitCheck(int digit)\n{\n    if(isdigit(digit))\n    {\n        return true;\n    }\n    return false;\n}\n\nvoid consoleUI::run()\n{\n    int chooseNumber;\n\n    cout << \"           _______ _______ ______ _______ ______      ______ \" << endl;\n    cout << \"          |   |   |       |   __ \\\\   |   |   __ \\\\    |  __  |\" << endl;\n    cout << \"          |       |   -   |    __\/   |   |      <    |__    |\" << endl;\n    cout << \"          |___|___|_______|___|  |_______|___|__|    |______|\" << endl;\n\n    bool stillLooping = true;\n\n    while(stillLooping)\n    {\n    cout << \"------------------------------------------------------------------\" << endl;\n    cout << \"*------ Database for Scientist ----------*--------Glossary-------*\" << endl;\n    cout << \"* 1:  Display entire list.               * Y.O.D = date of death *\" << endl;\n    cout << \"* 2:  Search by name.                    * Y.O.B = date of birth *\"<< endl;\n    cout << \"* 3:  Search if alive.                   * Y.O.A = year of award *\" << endl;\n    cout << \"* 4:  Sort by award year.                *                       *\" << endl;\n    cout << \"* 5:  Add new scientist.                 *                       *\" << endl;\n    cout << \"* 6:  Search for birth year.             *                       *\" << endl;\n    cout << \"* 7:  Disply list in alphabetical order  *                       *\" << endl;\n    cout << \"* 8:  Sort by birthyear.                 *                       *\" << endl;\n    cout << \"* 9:  Search for Turing award winner.    *                       *\" << endl;\n    cout << \"* 10: Chuck Norris.                      *                       *\" << endl;\n    cout << \"*----------------------------------------*-----------------------*\" << endl;\n    cout << \"-----------------------------------------------------------------\" << endl;\n    cout << \"Enter number: \";\n\n    cin >> chooseNumber;\n\n\n    if((chooseNumber < 1) || (chooseNumber > 11) || digitCheck(chooseNumber))\n    {\n        cout << \"Please enter a valid input: \" << endl;\n        exit(1);\n    }\n    else\n    {\n    }\n\n\n    \/\/This function sends you (from the number you pick) to the right corresponding case\n    switch (chooseNumber)\n    {\n        \/\/This function displays a list of all the scientists (that is there full names, dob, dod and year of award)\n        case 1:\n        {\n            listServices scientists;\n            cout << \"***List of all scientists***\" << endl;\n            print();\n            printNames(scientists);\n        }\n            break;\n\n        \/\/This function lets you search for a scientist from their name (either the first or last name)\n        case 2:\n            {\n                listServices scientists;\n                \/\/listServices searchName2;\n                string searchTerm;\n                cout << \"Enter a single name to search: \";\n                cin >> searchTerm;\n                scientists.changeTo(_scientist.searchName(searchTerm));\n                print();\n                printNames(scientists);\n\n            }\n            break;\n\n        \/\/This function organizes the living scientists from oldest to youngest\n        case 3:\n            {\n                listServices scientists;\n                string searchTerm;\n                scientists.changeTo(_scientist.searchAlive());\n                cout << \"An organized list starting with the oldest living scientist\" << endl;\n                print();\n                printNames(scientists);\n             }\n              break;\n\n        \/\/This function sorts the scientists by the year they received an award\n        case 4:\n            {\n                listServices scientistsByAward;\n                scientistsByAward.changeTo(_scientist.sortByAward());\n                cout << \"An organized list of scientists in order of when they received the Turing award.\" << endl;\n                print();\n                printNames(scientistsByAward);\n             }\n            break;\n\n        case 5:\n            {\n                \/\/addNew\n                string firstName;\n                string lastName;\n                char gender;\n                int birthYear;\n                char isAlive;\n                int deathYear;\n                char isWinner;\n                int awardYear;\n                bool cont = false;\n                bool hasOnlyChar = true;\n\n\n                firstName = nameChecker(\"first name\");\n                lastName = nameChecker(\"last name\");\n                gender = genderChecker();\n                cout << \"Enter the scientist's birth year: \";\n                cin >> birthYear;\n                cout << \"Is the scientist still alive? (y\/n) \";\n                cin >> isAlive;\n                if(isAlive == 'n')\n                {\n                    cout << \"Enter the scientist's year of death: \";\n                    cin >>  deathYear;\n                }\n                else if(isAlive == 'y')\n                {\n                    deathYear = 0;\n                }\n                else\n                {\n                    cout << \"Invalid entry.  Please enter either y (yes) or n (no)\";\n                }\n                cout << \"Did the scientist win a Turing award? (y\/n)\";\n                cin >> isWinner;\n                if(isWinner == 'y')\n                {\n                    cout << \"Enter the year the scientist won: \";\n                    cin >>  awardYear;\n                }\n                else if(isWinner == 'n')\n                {\n                    awardYear = 0;\n                }\n                else\n                {\n                    cout << \"Invalid entry.  Please enter either y (yes) or n (no)\";\n                }\n\n                _scientist.addNew(firstName, lastName, gender, birthYear, deathYear, awardYear);\n            }\n            break;\n\n    \/\/searchBirth\n    case 6:\n        {\n            int year;\n            cout << \"Enter year: \";\n            cin >> year;\n            listServices scientistsBirth;\n            scientistsBirth.changeTo(scientistsBirth.searchBirth(year, year));\n            cout << \"A list of scientists born in your year of choice\" << endl;\n            print();\n            printNames(scientistsBirth);\n         }\n          break;\n\n    \/\/This function sorts all the scientists by their name in an alpabetical order\n    case 7:\n    {\n        listServices sort;\n        sort.changeTo(_scientist.sortByName());\n        cout << \"A list of scinetists in alphabetical order\" << endl;\n        print();\n        printNames(sort);\n\n    }\n        break;\n\n    \/\/This function displays the scientists in an organized list from oldest to youngest\n    case 8:\n            _scientist.changeTo(_scientist.sortByBirth());\n            cout << \"An organized list starting with the oldest scientist\" << endl;\n            print();\n            printNames(_scientist);\n        break;\n\n    \/\/This function sorts the scientists by the year they recived the Turning Award\n    case 9:\n            _scientist.changeTo(_scientist.sortByAward());\n            cout << \"An organized list of scientists in order of when they received a Turing award.\" << endl;\n            print();\n            printNames(_scientist);\n         break;\n\n    \/\/All the scientist will become infinitely more awesome because this function changes all of there names to Chuck Norris\n    case 10:\n    {\n        listServices norris;\n \/* for(int i = 0; i < _scientist.chuckNorris(); i++){\n       _scientist.chu\n  }*\/\n\n\n        norris.changeTo(_scientist.chuckNorris());\n        print();\n        printNames(norris);\n\n        break;\n    }\n    }\n\n}\n}\n\n\n\nstring consoleUI::nameChecker(string nameType)\n{\n    string name;\n    bool cont = false;\n    bool hasOnlyChar = true;\n\n       while(!cont)\n       {\n       cout << \"Please enter the scientist's \" << nameType << \": \";\n       cin >> name;\n       for(unsigned int i = 0; i < name.length(); i++)\n       {\n           if(!isalpha(name[i]) && name[i] != '.')\n           {\n               hasOnlyChar = false;\n           }\n       }\n       if(name.length() <2 || name.length()>16)\n          {\n           cout <<\"Error: Names must be between 2 and 16 characters.\" << endl;\n           }\n       else if(!hasOnlyChar)\n       {\n          cout << \"Error: Names can only contain characters from the latin alphabet.\" << endl;\n          hasOnlyChar = true;\n       }\n       else\n       {\n          cont = true;\n       }\n       }\n\n       return name;\n}\n\n\/\/prompts the user for\nchar consoleUI::genderChecker()\n{\n    bool cont = false;\n    string gender;\n\n    while(!cont)\n    {\n        cout << \"Enter the scientist's gender (m\/f\/o) : \" ;\n        cin >> gender;\n\n        if(isalpha(gender[0]) && (gender[0] == 'm' || gender[0] == 'f' || gender[0] == 'o') && gender.size() == 1)\n        {\n            cont = true;\n        }\n        else\n        {\n            cout << \"Invalid input.  Please enter either 'm' for male or 'f' for female or 'o' for other.\" << endl;\n        }\n    }\n\n    return gender[0];\n}\n\n\nvoid consoleUI::print()\n{\n    listServices scientists;\n\n    cout.width(4);\n    cout << left << \"No.\";\n    cout.width(scientists.searchLongestName());\n    cout << \"Firstname\" << left;\n    cout.width(10);\n    cout << \"Lastname\" << left;\n    cout.width(10);\n    cout << \"gender\" << left;\n    cout.width(10);\n    cout << \"Y.O.B\" << left;\n    cout.width(10);\n    cout << \"Y.O.D\" << left;\n    cout.width(scientists.searchLongestName());\n    cout << \"Y.O.A\" << left << endl;\n    for(int i = 0 ; i < 9 ; i++)\n    {\n        cout << \"--------\";\n    }\n    cout << endl;\n}\n\nvoid consoleUI::printNames (listServices scientistsToPrint)\n{\n    int counter = 1;\n    for(int i = 0; i < scientistsToPrint.getSize() ; i++)\n    {\n        string sex;\n        string isDead;\n        if(scientistsToPrint.getSexFromList(i) == 'm')\n        {\n            sex = \"male\";\n        }\n        else if(scientistsToPrint.getSexFromList(i) == 'f')\n        {\n            sex = \"female\";\n        }\n        else\n        {\n            sex = \"other\";\n        }\n        cout.width(5);\n        cout << left << counter;\n        counter++;\n        cout.width(10);\n        cout << scientistsToPrint.getFirstNameFromList(i) << left;\n        cout.width(10);\n        cout << scientistsToPrint.getLastNameFromList(i) << left;\n        cout.width(10);\n        cout << sex << left;\n        cout.width(10);\n        cout << scientistsToPrint.dobFromList(i) << left;\n        if(scientistsToPrint.dodFromList(i) == 0)\n        {\n            isDead = \"Alive\";\n            cout.width(10);\n            cout << isDead << left;\n        }\n        else\n        {\n            cout.width(10);\n            cout << scientistsToPrint.dodFromList(i) << left;\n        }\n        cout.width(10);\n        cout << scientistsToPrint.getAwardsFromList(i) << left;;\n        cout << \"   *\" << endl;\n\n    }\n    for(int i = 0 ; i < 9 ; i++)\n    {\n        cout << \"--------\";\n    }\n    cout << endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef SETUP_H\n#define SETUP_H\n\n#include \"STYPES.H\"\n#include \"OBJECTS.H\"\n\n#include <stdio.h>\n\n#ifndef PSX_FILE_VERSION\n\t#define PSX_FILE_VERSION OBJECT_VERSION * -1\n#endif\n\n#if DISC_VERSION\n\textern void LoadLevel();\n#else\n\t#if PSX_VERSION || SAT_VERSION\n\t\textern void LoadLevel(int nHandle);\n\t#elif PSXPC_VERSION\n\t\textern void LoadLevel(FILE* nHandle);\n\t#endif\n#endif\n\nextern int LoadSoundEffects(int numSoundEffects, long* pSoundWadLengths, char* pSoundData, int soundWadSize);\nextern void InitialiseObjects();\nextern void BaddyObjects();\nextern void ObjectObjects();\nextern void TrapObjects();\nextern void InitialiseClosedDoors();\nextern void SetupGame();\nextern void init_water_table();\nextern void InitialiseSqrtTable();\nextern void InitialiseAnimatedTextures();\nextern void InitialiseFootPrints();\nextern void InitBinoculars();\nextern void InitTarget();\nextern void InitialiseGameFlags();\nextern void InitialiseLaraCarriedItems(long keep_carried_items);\nextern void GetCarriedItems();\nextern void InitialiseEffects();\nextern void reset_cutseq_vars();\nextern void GetAIPickups();\nextern void InitialiseResidentCut(unsigned char a0, unsigned char a1, unsigned char a2, unsigned char a3);\n#if (PSX_VERSION || SAT_VERSION)\nextern char* ReadResidentData(int residentIndex, int nHandle);\n#elif PSXPC_VERSION\nextern char* ReadResidentData(int residentIndex, FILE* nHandle);\n#endif\nextern long sub_BA148(short* ptr);\n\n#if PSXPC_VERSION || PSXPC_TEST || SAT_VERSION\nstruct object_container\n{\n\tstruct object_info m_objects[NUMBER_OBJECTS];\n\tstruct static_info m_static_objects[NUMBER_STATIC_OBJECTS];\n\tchar m_SkinVertNums[480];\n\tchar m_ScratchVertNums[480];\n};\n#endif\n\nstruct Level\n{\n\t\/\/0x0\n\tint objectVersion;\n\tint offsetSoundPointers;\n\tint offsetSoundData;\n\tint offsetTextiles;\n\n\t\/\/0x10\n\tint offsetAnimFrames;\n\tint offsetRoomInfo;\n\tint offsetObjects;\n\tint unk06;\n\n\t\/\/0x20\n\tint unk07;\n\tint numSoundEffects;\n\tint soundWadLength;\n\tunsigned short clutStartY;\n\tunsigned short numRooms;\n\t\n\t\/\/0x30\n\tunsigned short laraDrawType : 3;\n\tunsigned short weatherType : 2;\n\tunsigned short roomDrawType : 2;\n\tunsigned short reserved : 9;\n\n\tunsigned short numLevelItems;\n\tunsigned short numAnimTextureRanges;\/\/0x34\n\tunsigned short numAnimUVRanges;\n\n\tint roomInfoLength;\n\tint floorDataLength;\n\n\t\/\/0x40\n\tint outsideRoomTableLength;\n\tint roomBoundingBoxesLength;\n\tunsigned short numBones;\n\tunsigned short numAnims;\n\tint meshBaseLength;\n\n\t\/\/0x50\n\tint meshesLength;\n\tint animsLength;\n\tint changesLength;\n\tint rangesLength;\n\n\t\/\/0x60\n\tint commandsLength;\n\tint bonesLength;\n\tint frameDataLength;\n\tint textureInfoLength;\n\n\t\/\/0x70\n\tint spriteInfoLength;\n\tint mmTextureInfoLength;\n\tint animTextureRangesLength;\n\tint soundEffectInfoLength;\n\n\t\/\/0x80\n\tint sampleInfoLength;\n\tint unk33;\n\tint unk34;\n\tint numBoxes;\n\n\t\/\/0x90\n\tint boxesLength;\n\tint overlapsLength;\n\tint groundZoneLength;\n\tint groundZone2Length;\n\n\t\/\/0xA0\n\tint groundZone3Length;\n\tint groundZone4Length;\n\tint groundZone5Length;\n\tint numFixedCameras;\n\n\t\/\/0xB0\n\tunsigned short numSpotCameras;\n\tunsigned short fixedCameraLength;\n\tint unk455;\n\tint unk46;\n\tunsigned short numAIObjects;\n\tunsigned short unk0003;\n\n\t\/\/0xC0\n\tint numAiModules;\n\tchar aiModuleIndices[4];\n\tint unk50;\n\tint unk51;\n\n\t\/\/0xD0\n\tint unk53;\n\tint unk54;\n\tint unk55;\n\tint unk56;\n\n\t\/\/0xE0\n\tint unk57;\n};\n\n#if (PSX_VERSION && !(PSXPC_TEST || SAT_VERSION)) || PC_VERSION\nextern struct object_info objects[NUMBER_OBJECTS];\nextern struct static_info static_objects[NUMBER_STATIC_OBJECTS];\nextern char SkinVertNums[480];\nextern char ScratchVertNums[480];\n#elif PSXPC_VERSION || PSXPC_TEST || SAT_VERSION\nextern struct object_info* objects;\nextern struct static_info* static_objects;\nextern char* SkinVertNums;\nextern char* ScratchVertNums;\n#endif\n\nenum setup_functions\n{\n\tINITIALISE_GAME_FLAGS,\n\tINITIALISE_OBJECTS,\n\tGET_CARRIED_ITEMS,\n\tGET_AI_PICKUPS,\n\tSETUP_GAME,\n\tLOAD_LEVEL\n};\n\n#endif<commit_msg>[Specific-PSX\/Specific-PSXPC_N] Fix Level struct.<commit_after>#ifndef SETUP_H\n#define SETUP_H\n\n#include \"STYPES.H\"\n#include \"OBJECTS.H\"\n\n#include <stdio.h>\n\n#ifndef PSX_FILE_VERSION\n\t#define PSX_FILE_VERSION OBJECT_VERSION * -1\n#endif\n\n#if DISC_VERSION\n\textern void LoadLevel();\n#else\n\t#if PSX_VERSION || SAT_VERSION\n\t\textern void LoadLevel(int nHandle);\n\t#elif PSXPC_VERSION\n\t\textern void LoadLevel(FILE* nHandle);\n\t#endif\n#endif\n\nextern int LoadSoundEffects(int numSoundEffects, long* pSoundWadLengths, char* pSoundData, int soundWadSize);\nextern void InitialiseObjects();\nextern void BaddyObjects();\nextern void ObjectObjects();\nextern void TrapObjects();\nextern void InitialiseClosedDoors();\nextern void SetupGame();\nextern void init_water_table();\nextern void InitialiseSqrtTable();\nextern void InitialiseAnimatedTextures();\nextern void InitialiseFootPrints();\nextern void InitBinoculars();\nextern void InitTarget();\nextern void InitialiseGameFlags();\nextern void InitialiseLaraCarriedItems(long keep_carried_items);\nextern void GetCarriedItems();\nextern void InitialiseEffects();\nextern void reset_cutseq_vars();\nextern void GetAIPickups();\nextern void InitialiseResidentCut(unsigned char a0, unsigned char a1, unsigned char a2, unsigned char a3);\n#if (PSX_VERSION || SAT_VERSION)\nextern char* ReadResidentData(int residentIndex, int nHandle);\n#elif PSXPC_VERSION\nextern char* ReadResidentData(int residentIndex, FILE* nHandle);\n#endif\nextern long sub_BA148(short* ptr);\n\n#if PSXPC_VERSION || PSXPC_TEST || SAT_VERSION\nstruct object_container\n{\n\tstruct object_info m_objects[NUMBER_OBJECTS];\n\tstruct static_info m_static_objects[NUMBER_STATIC_OBJECTS];\n\tchar m_SkinVertNums[480];\n\tchar m_ScratchVertNums[480];\n};\n#endif\n\nstruct Level\n{\n\t\/\/0x0\n\tint objectVersion;\n\tint offsetSoundPointers;\n\tint offsetSoundData;\n\tint offsetTextiles;\n\n\t\/\/0x10\n\tint offsetAnimFrames;\n\tint offsetRoomInfo;\n\tint offsetObjects;\n\tint unk06;\n\n\t\/\/0x20\n\tint unk07;\n\tint numSoundEffects;\n\tint soundWadLength;\n\tunsigned short clutStartY;\n\tunsigned short numRooms;\n\t\n\t\/\/0x30\n\tunsigned short laraDrawType : 3;\n\tunsigned short weatherType : 2;\n\tunsigned short roomDrawType : 2;\n\tunsigned short reserved : 9;\n\n\tunsigned short numLevelItems;\n\tunsigned short numAnimTextureRanges;\/\/0x34\n\tunsigned short numAnimUVRanges;\n\n\tint roomInfoLength;\n\tint floorDataLength;\n\n\t\/\/0x40\n\tint outsideRoomTableLength;\n\tint roomBoundingBoxesLength;\n\tunsigned short numBones;\n\tunsigned short numAnims;\n\tint meshBaseLength;\n\n\t\/\/0x50\n\tint meshesLength;\n\tint animsLength;\n\tint changesLength;\n\tint rangesLength;\n\n\t\/\/0x60\n\tint commandsLength;\n\tint bonesLength;\n\tint frameDataLength;\n\tint textureInfoLength;\n\n\t\/\/0x70\n\tint spriteInfoLength;\n\tint mmTextureInfoLength;\n\tint animTextureRangesLength;\n\tint soundEffectInfoLength;\n\n\t\/\/0x80\n\tint sampleInfoLength;\n\tint unk33;\n\tint unk34;\n\tint numBoxes;\n\n\t\/\/0x90\n\tint boxesLength;\n\tint overlapsLength;\n\tint groundZoneLength;\n\tint groundZone2Length;\n\n\t\/\/0xA0\n\tint groundZone3Length;\n\tint groundZone4Length;\n\tint groundZone5Length;\n\tint numFixedCameras;\n\n\t\/\/0xB0\n\tunsigned short numSpotCameras;\n\tint fixedCameraLength;\n\tint unk46;\n\tunsigned short numAIObjects;\n\tunsigned short unk0003;\n\n\t\/\/0xC0\n\tint numAiModules;\n\tchar aiModuleIndices[4];\n\tint unk50;\n\tint unk51;\n\n\t\/\/0xD0\n\tint unk53;\n\tint unk54;\n\tint unk55;\n\tint unk56;\n\n\t\/\/0xE0\n\tint unk57;\n};\n\n#if (PSX_VERSION && !(PSXPC_TEST || SAT_VERSION)) || PC_VERSION\nextern struct object_info objects[NUMBER_OBJECTS];\nextern struct static_info static_objects[NUMBER_STATIC_OBJECTS];\nextern char SkinVertNums[480];\nextern char ScratchVertNums[480];\n#elif PSXPC_VERSION || PSXPC_TEST || SAT_VERSION\nextern struct object_info* objects;\nextern struct static_info* static_objects;\nextern char* SkinVertNums;\nextern char* ScratchVertNums;\n#endif\n\nenum setup_functions\n{\n\tINITIALISE_GAME_FLAGS,\n\tINITIALISE_OBJECTS,\n\tGET_CARRIED_ITEMS,\n\tGET_AI_PICKUPS,\n\tSETUP_GAME,\n\tLOAD_LEVEL\n};\n\n#endif<|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 \"SemanticalException.hpp\"\n#include \"VisitorUtils.hpp\"\n#include \"mangling.hpp\"\n#include \"Options.hpp\"\n#include \"Type.hpp\"\n#include \"GlobalContext.hpp\"\n#include \"FunctionContext.hpp\"\n#include \"Variable.hpp\"\n\n#include \"ast\/FunctionsAnnotator.hpp\"\n#include \"ast\/SourceFile.hpp\"\n#include \"ast\/TypeTransformer.hpp\"\n#include \"ast\/ASTVisitor.hpp\"\n#include \"ast\/GetTypeVisitor.hpp\"\n#include \"ast\/TemplateEngine.hpp\"\n\nusing namespace eddic;\n\nnamespace {\n\ntemplate<typename T>\nvoid annotate(T& declaration, ast::Struct& current_struct){\n    declaration.Content->struct_name = current_struct.Content->name;\n    declaration.Content->struct_type = current_struct.Content->struct_type;\n\n    ast::PointerType paramType;\n\n    if(current_struct.Content->template_types.empty()){\n        ast::SimpleType struct_type;\n        struct_type.type = current_struct.Content->name;\n        struct_type.const_ = false;\n\n        paramType.type = struct_type;\n    } else {\n        ast::TemplateType struct_type;\n        struct_type.type = current_struct.Content->name;\n        struct_type.template_types = current_struct.Content->template_types;\n        struct_type.resolved = true;\n\n        paramType.type = struct_type;\n    }\n\n    ast::FunctionParameter param;\n    param.parameterName = \"this\";\n    param.parameterType = paramType;\n\n    declaration.Content->parameters.insert(declaration.Content->parameters.begin(), param);\n}\n\nclass FunctionCheckerVisitor : public boost::static_visitor<> {\n    public:\n        std::shared_ptr<GlobalContext> context;\n        std::shared_ptr<Function> currentFunction;\n        std::shared_ptr<ast::TemplateEngine> template_engine;\n\n        FunctionCheckerVisitor(std::shared_ptr<ast::TemplateEngine> template_engine) : template_engine(template_engine) {}\n\n        AUTO_RECURSE_GLOBAL_DECLARATION() \n        AUTO_RECURSE_MEMBER_VALUE()\n\n        void operator()(ast::DefaultCase& default_case){\n            check_each(default_case.instructions);\n        }\n\n        void operator()(ast::Foreach& foreach_){\n            check_each(foreach_.Content->instructions);\n        }\n\n        void operator()(ast::ForeachIn& foreach_){\n            check_each(foreach_.Content->instructions);\n        }\n\n        void operator()(ast::If& if_){\n            check_value(if_.Content->condition);\n            check_each(if_.Content->instructions);\n            visit_each_non_variant(*this, if_.Content->elseIfs);\n            visit_optional_non_variant(*this, if_.Content->else_);\n        }\n\n        void operator()(ast::ElseIf& elseIf){\n            check_value(elseIf.condition);\n            check_each(elseIf.instructions);\n        }\n        \n        void operator()(ast::Else& else_){\n            check_each(else_.instructions);\n        }\n\n        template<typename T>\n        void check_each(std::vector<T>& values){\n            for(std::size_t i = 0; i < values.size(); ++i){\n                check_value(values[i]);\n            }\n        }\n\n        template<typename V>\n        void check_value(V& value){\n            if(auto* ptr = boost::get<ast::FunctionCall>(&value)){\n                auto functionCall = *ptr;\n            \n                template_engine->check_function(functionCall);\n\n                if(functionCall.Content->template_types.empty() || functionCall.Content->resolved){\n                    check_each(functionCall.Content->values);\n\n                    \/\/If the function has already been resolved, we can return directly\n                    if(functionCall.Content->function){\n                        return;\n                    }\n                \n                    \/\/It is possible that the values contains an object that has not been handled by the template engine at this point\n                    for(auto& value : functionCall.Content->values){\n                        if(auto* ptr = boost::get<ast::MemberFunctionCall>(&value)){\n                            if(!is_init(ptr->Content->object)){\n                                return;\n                            }\n                        }\n                    }\n\n                    std::string name = functionCall.Content->function_name;\n\n                    auto types = get_types(functionCall);\n\n                    auto mangled = mangle(name, types);\n                    auto original_mangled = mangled;\n\n                    \/\/If the function does not exists, try implicit conversions to pointers\n                    if(!context->exists(mangled)){\n                        auto perms = permutations(types);\n\n                        for(auto& perm : perms){\n                            mangled = mangle(name, perm);\n\n                            if(context->exists(mangled)){\n                                break;\n                            }\n                        }\n                    }\n\n                    if(context->exists(mangled)){\n                        context->addReference(mangled);\n\n                        functionCall.Content->mangled_name = mangled;\n                        functionCall.Content->function = context->getFunction(mangled);\n                    } else {\n                        auto local_context = functionCall.Content->context->function();\n\n                        if(local_context && local_context->struct_type && context->struct_exists(local_context->struct_type->mangle())){\n                            auto struct_type = local_context->struct_type;\n\n                            mangled = mangle(name, types, struct_type);\n\n                            \/\/If the function does not exists, try implicit conversions to pointers\n                            if(!context->exists(mangled)){\n                                auto perms = permutations(types);\n\n                                for(auto& perm : perms){\n                                    mangled = mangle(name, perm, struct_type);\n\n                                    if(context->exists(mangled)){\n                                        break;\n                                    }\n                                }\n                            }\n\n                            if(context->exists(mangled)){\n                                context->addReference(mangled);\n\n                                ast::VariableValue variable_value;\n                                variable_value.Content->context = functionCall.Content->context;\n                                variable_value.Content->position = functionCall.Content->position;\n                                variable_value.Content->variableName = \"this\";\n                                variable_value.Content->var = functionCall.Content->context->getVariable(\"this\");\n\n                                ast::MemberFunctionCall member_function_call;\n                                member_function_call.Content->function = context->getFunction(mangled);\n                                member_function_call.Content->mangled_name = mangled;\n                                member_function_call.Content->position = functionCall.Content->position;\n                                member_function_call.Content->object = variable_value;\n                                member_function_call.Content->function_name = functionCall.Content->function_name;\n                                member_function_call.Content->resolved = functionCall.Content->resolved;\n                                member_function_call.Content->template_types = functionCall.Content->template_types;\n                                member_function_call.Content->values = functionCall.Content->values;\n\n                                value = member_function_call;\n\n                                return;\n                            }\n                        }\n\n                        throw SemanticalException(\"The function \\\"\" + unmangle(original_mangled) + \"\\\" does not exists\", functionCall.Content->position);\n                    }\n                }\n            } else {\n                visit(*this, value);\n            }\n        }\n\n        void operator()(ast::For& for_){\n            if(for_.Content->start){\n                check_value(*for_.Content->start);\n            }\n            \n            if(for_.Content->condition){\n                check_value(*for_.Content->condition);\n            }\n            \n            if(for_.Content->repeat){\n                check_value(*for_.Content->repeat);\n            }\n\n            check_each(for_.Content->instructions);\n        }\n        \n        void operator()(ast::While& while_){\n            check_value(while_.Content->condition);\n            check_each(while_.Content->instructions);\n        }\n        \n        void operator()(ast::DoWhile& while_){\n            check_value(while_.Content->condition);\n            check_each(while_.Content->instructions);\n        }\n\n        void operator()(ast::SourceFile& program){\n            context = program.Content->context;\n\n            visit_each(*this, program.Content->blocks);\n        }\n\n        void permute(std::vector<std::vector<std::shared_ptr<const Type>>>& perms, std::vector<std::shared_ptr<const Type>>& types, int start){\n            for(std::size_t i = start; i < types.size(); ++i){\n                if(!types[i]->is_pointer() && !types[i]->is_array()){\n                    std::vector<std::shared_ptr<const Type>> copy = types;\n\n                    copy[i] = new_pointer_type(types[i]);\n\n                    perms.push_back(copy);\n\n                    permute(perms, copy, i + 1);\n                }\n            }\n        }\n\n        std::vector<std::vector<std::shared_ptr<const Type>>> permutations(std::vector<std::shared_ptr<const Type>>& types){\n            std::vector<std::vector<std::shared_ptr<const Type>>> perms;\n\n            permute(perms, types, 0);\n\n            return perms;\n        }\n    \n        template<typename T>\n        std::vector<std::shared_ptr<const Type>> get_types(T& functionCall){\n            std::vector<std::shared_ptr<const Type>> types;\n\n            ast::GetTypeVisitor visitor;\n            for(auto& value : functionCall.Content->values){\n                if(auto* ptr = boost::get<ast::MemberFunctionCall>(&value)){\n                    if(!is_init(ptr->Content->object)){\n                        ;\n                    }\n                }\n\n                types.push_back(visit(visitor, value));\n            }\n\n            return types;\n        }\n\n        void operator()(ast::FunctionCall&){\n            ASSERT_PATH_NOT_TAKEN(\"Should be handled by check_value\");\n        }\n\n        bool is_init(ast::Value& value){\n            if(auto* ptr = boost::get<ast::VariableValue>(&value)){\n                return ptr->Content->var != 0;\n            }\n\n            ASSERT_PATH_NOT_TAKEN(\"Unhandled value type\");\n        }\n\n        void operator()(ast::MemberFunctionCall& functionCall){\n            template_engine->check_member_function(functionCall);\n\n            if(functionCall.Content->template_types.empty() || functionCall.Content->resolved){\n                \/\/It is possible that the object has not been handled by the template engine at this point\n                if(!is_init(functionCall.Content->object)){\n                    return;\n                }\n                \n                \/\/It is possible that the values contains an object that has not been handled by the template engine at this point\n                for(auto& value : functionCall.Content->values){\n                    if(auto* ptr = boost::get<ast::MemberFunctionCall>(&value)){\n                        if(!is_init(ptr->Content->object)){\n                            return;\n                        }\n                    }\n                }\n\n                check_value(functionCall.Content->object);\n                check_each(functionCall.Content->values);\n\n                \/\/If the function has already been resolved, we can return directly\n                if(functionCall.Content->function){\n                    return;\n                }\n\n                auto type = visit(ast::GetTypeVisitor(), functionCall.Content->object);\n                auto struct_type = type->is_pointer() ? type->data_type() : type;\n\n                std::string name = functionCall.Content->function_name;\n\n                auto types = get_types(functionCall);\n\n                std::string mangled = mangle(name, types, struct_type);\n\n                \/\/If the function does not exists, try implicit conversions to pointers\n                if(!context->exists(mangled)){\n                    auto perms = permutations(types);\n\n                    for(auto& perm : perms){\n                        mangled = mangle(name, perm, struct_type);\n\n                        if(context->exists(mangled)){\n                            break;\n                        }\n                    }\n                }\n\n                if(context->exists(mangled)){\n                    context->addReference(mangled);\n\n                    functionCall.Content->mangled_name = mangled;\n                    functionCall.Content->function = context->getFunction(mangled);\n                } else {\n                    throw SemanticalException(\"The member function \\\"\" + unmangle(mangled) + \"\\\" does not exists\", functionCall.Content->position);\n                }\n            }\n        }\n        \n        void operator()(ast::Switch& switch_){\n            check_value(switch_.Content->value);\n            visit_each_non_variant(*this, switch_.Content->cases);\n            visit_optional_non_variant(*this, switch_.Content->default_case);\n        }\n\n        void operator()(ast::SwitchCase& switch_case){\n            check_value(switch_case.value);\n            check_each(switch_case.instructions);\n        }\n\n        void operator()(ast::Assignment& assignment){\n            visit(*this, assignment.Content->left_value);\n            check_value(assignment.Content->value);\n        }\n\n        void operator()(ast::VariableDeclaration& declaration){\n            if(declaration.Content->value){\n                check_value(*declaration.Content->value);\n            }\n        }\n\n        void operator()(ast::Unary& value){\n            check_value(value.Content->value);\n        }\n\n        void operator()(ast::BuiltinOperator& builtin){\n            check_each(builtin.Content->values);\n        }\n\n        void operator()(ast::Expression& value){\n            check_value(value.Content->first);\n\n            for_each(value.Content->operations.begin(), value.Content->operations.end(), \n                [&](ast::Operation& operation){ check_value(operation.get<1>()); });\n        }\n\n        void operator()(ast::Return& return_){\n            return_.Content->function = currentFunction;\n\n            check_value(return_.Content->value);\n        }\n\n        AUTO_IGNORE_OTHERS()\n};\n\n} \/\/end of anonymous namespace\n        \nvoid ast::MemberFunctionCollectionPass::apply_struct(ast::Struct& struct_, bool){\n    current_struct = struct_;\n}\n    \nvoid ast::MemberFunctionCollectionPass::apply_struct_function(ast::FunctionDeclaration& function){\n    annotate(function, current_struct);\n}\n\nvoid ast::MemberFunctionCollectionPass::apply_struct_constructor(ast::Constructor& constructor){\n    annotate(constructor, current_struct);\n}\n\nvoid ast::MemberFunctionCollectionPass::apply_struct_destructor(ast::Destructor& destructor){\n    annotate(destructor, current_struct);\n}\n    \nvoid ast::FunctionCollectionPass::apply_function(ast::FunctionDeclaration& declaration){\n    auto return_type = visit(ast::TypeTransformer(context), declaration.Content->returnType);\n    auto signature = std::make_shared<Function>(return_type, declaration.Content->functionName);\n\n    if(return_type->is_array()){\n        throw SemanticalException(\"Cannot return array from function\", declaration.Content->position);\n    }\n\n    if(return_type->is_custom_type()){\n        throw SemanticalException(\"Cannot return struct from function\", declaration.Content->position);\n    }\n\n    for(auto& param : declaration.Content->parameters){\n        auto paramType = visit(ast::TypeTransformer(context), param.parameterType);\n        signature->parameters.push_back(ParameterType(param.parameterName, paramType));\n    }\n\n    signature->struct_ = declaration.Content->struct_name;\n    signature->struct_type = declaration.Content->struct_type;\n    signature->context = declaration.Content->context;\n\n    declaration.Content->mangledName = signature->mangledName = mangle(signature);\n\n    if(context->exists(signature->mangledName)){\n        throw SemanticalException(\"The function \" + signature->mangledName + \" has already been defined\", declaration.Content->position);\n    }\n\n    context->addFunction(signature);\n}\n\nvoid ast::FunctionCollectionPass::apply_struct_function(ast::FunctionDeclaration& function){\n   apply_function(function); \n}\n\nvoid ast::FunctionCollectionPass::apply_struct_constructor(ast::Constructor& constructor){\n    auto signature = std::make_shared<Function>(VOID, \"ctor\");\n\n    for(auto& param : constructor.Content->parameters){\n        auto paramType = visit(ast::TypeTransformer(context), param.parameterType);\n        signature->parameters.push_back(ParameterType(param.parameterName, paramType));\n    }\n\n    signature->struct_ = constructor.Content->struct_name;\n    signature->struct_type = constructor.Content->struct_type;\n\n    constructor.Content->mangledName = signature->mangledName = mangle_ctor(signature);\n\n    if(context->exists(signature->mangledName)){\n        throw SemanticalException(\"The constructor \" + signature->name + \" has already been defined\", constructor.Content->position);\n    }\n\n    context->addFunction(signature);\n    context->getFunction(signature->mangledName)->context = constructor.Content->context;\n}\n\nvoid ast::FunctionCollectionPass::apply_struct_destructor(ast::Destructor& destructor){\n    auto signature = std::make_shared<Function>(VOID, \"dtor\");\n\n    for(auto& param : destructor.Content->parameters){\n        auto paramType = visit(ast::TypeTransformer(context), param.parameterType);\n        signature->parameters.push_back(ParameterType(param.parameterName, paramType));\n    }\n\n    signature->struct_ = destructor.Content->struct_name;\n    signature->struct_type = destructor.Content->struct_type;\n\n    destructor.Content->mangledName = signature->mangledName = mangle_dtor(signature);\n\n    if(context->exists(signature->mangledName)){\n        throw SemanticalException(\"Only one destructor per struct is allowed\", destructor.Content->position);\n    }\n\n    context->addFunction(signature);\n    context->getFunction(signature->mangledName)->context = destructor.Content->context;\n}\n    \nvoid ast::FunctionCheckPass::apply_function(ast::FunctionDeclaration& declaration){\n    FunctionCheckerVisitor visitor(template_engine);\n    visitor.context = context;\n    visitor.currentFunction = context->getFunction(declaration.Content->mangledName);\n    visitor.check_each(declaration.Content->instructions);\n}\n\nvoid ast::FunctionCheckPass::apply_struct_function(ast::FunctionDeclaration& function){\n    apply_function(function);\n}\n\nvoid ast::FunctionCheckPass::apply_struct_constructor(ast::Constructor& constructor){\n    FunctionCheckerVisitor visitor(template_engine);\n    visitor.context = context;\n    visitor.check_each(constructor.Content->instructions);\n}\n\nvoid ast::FunctionCheckPass::apply_struct_destructor(ast::Destructor& destructor){\n    FunctionCheckerVisitor visitor(template_engine);\n    visitor.context = context;\n    visitor.check_each(destructor.Content->instructions);\n}\n<commit_msg>Remove is_init calls, should not happen anymore with the new template system<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 \"SemanticalException.hpp\"\n#include \"VisitorUtils.hpp\"\n#include \"mangling.hpp\"\n#include \"Options.hpp\"\n#include \"Type.hpp\"\n#include \"GlobalContext.hpp\"\n#include \"FunctionContext.hpp\"\n#include \"Variable.hpp\"\n\n#include \"ast\/FunctionsAnnotator.hpp\"\n#include \"ast\/SourceFile.hpp\"\n#include \"ast\/TypeTransformer.hpp\"\n#include \"ast\/ASTVisitor.hpp\"\n#include \"ast\/GetTypeVisitor.hpp\"\n#include \"ast\/TemplateEngine.hpp\"\n\nusing namespace eddic;\n\nnamespace {\n\ntemplate<typename T>\nvoid annotate(T& declaration, ast::Struct& current_struct){\n    declaration.Content->struct_name = current_struct.Content->name;\n    declaration.Content->struct_type = current_struct.Content->struct_type;\n\n    ast::PointerType paramType;\n\n    if(current_struct.Content->template_types.empty()){\n        ast::SimpleType struct_type;\n        struct_type.type = current_struct.Content->name;\n        struct_type.const_ = false;\n\n        paramType.type = struct_type;\n    } else {\n        ast::TemplateType struct_type;\n        struct_type.type = current_struct.Content->name;\n        struct_type.template_types = current_struct.Content->template_types;\n        struct_type.resolved = true;\n\n        paramType.type = struct_type;\n    }\n\n    ast::FunctionParameter param;\n    param.parameterName = \"this\";\n    param.parameterType = paramType;\n\n    declaration.Content->parameters.insert(declaration.Content->parameters.begin(), param);\n}\n\nclass FunctionCheckerVisitor : public boost::static_visitor<> {\n    public:\n        std::shared_ptr<GlobalContext> context;\n        std::shared_ptr<Function> currentFunction;\n        std::shared_ptr<ast::TemplateEngine> template_engine;\n\n        FunctionCheckerVisitor(std::shared_ptr<ast::TemplateEngine> template_engine) : template_engine(template_engine) {}\n\n        AUTO_RECURSE_GLOBAL_DECLARATION() \n        AUTO_RECURSE_MEMBER_VALUE()\n\n        void operator()(ast::DefaultCase& default_case){\n            check_each(default_case.instructions);\n        }\n\n        void operator()(ast::Foreach& foreach_){\n            check_each(foreach_.Content->instructions);\n        }\n\n        void operator()(ast::ForeachIn& foreach_){\n            check_each(foreach_.Content->instructions);\n        }\n\n        void operator()(ast::If& if_){\n            check_value(if_.Content->condition);\n            check_each(if_.Content->instructions);\n            visit_each_non_variant(*this, if_.Content->elseIfs);\n            visit_optional_non_variant(*this, if_.Content->else_);\n        }\n\n        void operator()(ast::ElseIf& elseIf){\n            check_value(elseIf.condition);\n            check_each(elseIf.instructions);\n        }\n        \n        void operator()(ast::Else& else_){\n            check_each(else_.instructions);\n        }\n\n        template<typename T>\n        void check_each(std::vector<T>& values){\n            for(std::size_t i = 0; i < values.size(); ++i){\n                check_value(values[i]);\n            }\n        }\n\n        template<typename V>\n        void check_value(V& value){\n            if(auto* ptr = boost::get<ast::FunctionCall>(&value)){\n                auto functionCall = *ptr;\n            \n                template_engine->check_function(functionCall);\n\n                if(functionCall.Content->template_types.empty() || functionCall.Content->resolved){\n                    check_each(functionCall.Content->values);\n\n                    \/\/If the function has already been resolved, we can return directly\n                    if(functionCall.Content->function){\n                        return;\n                    }\n\n                    std::string name = functionCall.Content->function_name;\n\n                    auto types = get_types(functionCall);\n\n                    auto mangled = mangle(name, types);\n                    auto original_mangled = mangled;\n\n                    \/\/If the function does not exists, try implicit conversions to pointers\n                    if(!context->exists(mangled)){\n                        auto perms = permutations(types);\n\n                        for(auto& perm : perms){\n                            mangled = mangle(name, perm);\n\n                            if(context->exists(mangled)){\n                                break;\n                            }\n                        }\n                    }\n\n                    if(context->exists(mangled)){\n                        context->addReference(mangled);\n\n                        functionCall.Content->mangled_name = mangled;\n                        functionCall.Content->function = context->getFunction(mangled);\n                    } else {\n                        auto local_context = functionCall.Content->context->function();\n\n                        if(local_context && local_context->struct_type && context->struct_exists(local_context->struct_type->mangle())){\n                            auto struct_type = local_context->struct_type;\n\n                            mangled = mangle(name, types, struct_type);\n\n                            \/\/If the function does not exists, try implicit conversions to pointers\n                            if(!context->exists(mangled)){\n                                auto perms = permutations(types);\n\n                                for(auto& perm : perms){\n                                    mangled = mangle(name, perm, struct_type);\n\n                                    if(context->exists(mangled)){\n                                        break;\n                                    }\n                                }\n                            }\n\n                            if(context->exists(mangled)){\n                                context->addReference(mangled);\n\n                                ast::VariableValue variable_value;\n                                variable_value.Content->context = functionCall.Content->context;\n                                variable_value.Content->position = functionCall.Content->position;\n                                variable_value.Content->variableName = \"this\";\n                                variable_value.Content->var = functionCall.Content->context->getVariable(\"this\");\n\n                                ast::MemberFunctionCall member_function_call;\n                                member_function_call.Content->function = context->getFunction(mangled);\n                                member_function_call.Content->mangled_name = mangled;\n                                member_function_call.Content->position = functionCall.Content->position;\n                                member_function_call.Content->object = variable_value;\n                                member_function_call.Content->function_name = functionCall.Content->function_name;\n                                member_function_call.Content->resolved = functionCall.Content->resolved;\n                                member_function_call.Content->template_types = functionCall.Content->template_types;\n                                member_function_call.Content->values = functionCall.Content->values;\n\n                                value = member_function_call;\n\n                                return;\n                            }\n                        }\n\n                        throw SemanticalException(\"The function \\\"\" + unmangle(original_mangled) + \"\\\" does not exists\", functionCall.Content->position);\n                    }\n                }\n            } else {\n                visit(*this, value);\n            }\n        }\n\n        void operator()(ast::For& for_){\n            if(for_.Content->start){\n                check_value(*for_.Content->start);\n            }\n            \n            if(for_.Content->condition){\n                check_value(*for_.Content->condition);\n            }\n            \n            if(for_.Content->repeat){\n                check_value(*for_.Content->repeat);\n            }\n\n            check_each(for_.Content->instructions);\n        }\n        \n        void operator()(ast::While& while_){\n            check_value(while_.Content->condition);\n            check_each(while_.Content->instructions);\n        }\n        \n        void operator()(ast::DoWhile& while_){\n            check_value(while_.Content->condition);\n            check_each(while_.Content->instructions);\n        }\n\n        void operator()(ast::SourceFile& program){\n            context = program.Content->context;\n\n            visit_each(*this, program.Content->blocks);\n        }\n\n        void permute(std::vector<std::vector<std::shared_ptr<const Type>>>& perms, std::vector<std::shared_ptr<const Type>>& types, int start){\n            for(std::size_t i = start; i < types.size(); ++i){\n                if(!types[i]->is_pointer() && !types[i]->is_array()){\n                    std::vector<std::shared_ptr<const Type>> copy = types;\n\n                    copy[i] = new_pointer_type(types[i]);\n\n                    perms.push_back(copy);\n\n                    permute(perms, copy, i + 1);\n                }\n            }\n        }\n\n        std::vector<std::vector<std::shared_ptr<const Type>>> permutations(std::vector<std::shared_ptr<const Type>>& types){\n            std::vector<std::vector<std::shared_ptr<const Type>>> perms;\n\n            permute(perms, types, 0);\n\n            return perms;\n        }\n    \n        template<typename T>\n        std::vector<std::shared_ptr<const Type>> get_types(T& functionCall){\n            std::vector<std::shared_ptr<const Type>> types;\n\n            ast::GetTypeVisitor visitor;\n            for(auto& value : functionCall.Content->values){\n                types.push_back(visit(visitor, value));\n            }\n\n            return types;\n        }\n\n        void operator()(ast::FunctionCall&){\n            ASSERT_PATH_NOT_TAKEN(\"Should be handled by check_value\");\n        }\n\n        void operator()(ast::MemberFunctionCall& functionCall){\n            template_engine->check_member_function(functionCall);\n\n            if(functionCall.Content->template_types.empty() || functionCall.Content->resolved){\n                check_value(functionCall.Content->object);\n                check_each(functionCall.Content->values);\n\n                \/\/If the function has already been resolved, we can return directly\n                if(functionCall.Content->function){\n                    return;\n                }\n\n                auto type = visit(ast::GetTypeVisitor(), functionCall.Content->object);\n                auto struct_type = type->is_pointer() ? type->data_type() : type;\n\n                std::string name = functionCall.Content->function_name;\n\n                auto types = get_types(functionCall);\n\n                std::string mangled = mangle(name, types, struct_type);\n\n                \/\/If the function does not exists, try implicit conversions to pointers\n                if(!context->exists(mangled)){\n                    auto perms = permutations(types);\n\n                    for(auto& perm : perms){\n                        mangled = mangle(name, perm, struct_type);\n\n                        if(context->exists(mangled)){\n                            break;\n                        }\n                    }\n                }\n\n                if(context->exists(mangled)){\n                    context->addReference(mangled);\n\n                    functionCall.Content->mangled_name = mangled;\n                    functionCall.Content->function = context->getFunction(mangled);\n                } else {\n                    throw SemanticalException(\"The member function \\\"\" + unmangle(mangled) + \"\\\" does not exists\", functionCall.Content->position);\n                }\n            }\n        }\n        \n        void operator()(ast::Switch& switch_){\n            check_value(switch_.Content->value);\n            visit_each_non_variant(*this, switch_.Content->cases);\n            visit_optional_non_variant(*this, switch_.Content->default_case);\n        }\n\n        void operator()(ast::SwitchCase& switch_case){\n            check_value(switch_case.value);\n            check_each(switch_case.instructions);\n        }\n\n        void operator()(ast::Assignment& assignment){\n            visit(*this, assignment.Content->left_value);\n            check_value(assignment.Content->value);\n        }\n\n        void operator()(ast::VariableDeclaration& declaration){\n            if(declaration.Content->value){\n                check_value(*declaration.Content->value);\n            }\n        }\n\n        void operator()(ast::Unary& value){\n            check_value(value.Content->value);\n        }\n\n        void operator()(ast::BuiltinOperator& builtin){\n            check_each(builtin.Content->values);\n        }\n\n        void operator()(ast::Expression& value){\n            check_value(value.Content->first);\n\n            for_each(value.Content->operations.begin(), value.Content->operations.end(), \n                [&](ast::Operation& operation){ check_value(operation.get<1>()); });\n        }\n\n        void operator()(ast::Return& return_){\n            return_.Content->function = currentFunction;\n\n            check_value(return_.Content->value);\n        }\n\n        AUTO_IGNORE_OTHERS()\n};\n\n} \/\/end of anonymous namespace\n        \nvoid ast::MemberFunctionCollectionPass::apply_struct(ast::Struct& struct_, bool){\n    current_struct = struct_;\n}\n    \nvoid ast::MemberFunctionCollectionPass::apply_struct_function(ast::FunctionDeclaration& function){\n    annotate(function, current_struct);\n}\n\nvoid ast::MemberFunctionCollectionPass::apply_struct_constructor(ast::Constructor& constructor){\n    annotate(constructor, current_struct);\n}\n\nvoid ast::MemberFunctionCollectionPass::apply_struct_destructor(ast::Destructor& destructor){\n    annotate(destructor, current_struct);\n}\n    \nvoid ast::FunctionCollectionPass::apply_function(ast::FunctionDeclaration& declaration){\n    auto return_type = visit(ast::TypeTransformer(context), declaration.Content->returnType);\n    auto signature = std::make_shared<Function>(return_type, declaration.Content->functionName);\n\n    if(return_type->is_array()){\n        throw SemanticalException(\"Cannot return array from function\", declaration.Content->position);\n    }\n\n    if(return_type->is_custom_type()){\n        throw SemanticalException(\"Cannot return struct from function\", declaration.Content->position);\n    }\n\n    for(auto& param : declaration.Content->parameters){\n        auto paramType = visit(ast::TypeTransformer(context), param.parameterType);\n        signature->parameters.push_back(ParameterType(param.parameterName, paramType));\n    }\n\n    signature->struct_ = declaration.Content->struct_name;\n    signature->struct_type = declaration.Content->struct_type;\n    signature->context = declaration.Content->context;\n\n    declaration.Content->mangledName = signature->mangledName = mangle(signature);\n\n    std::cout << \"collect function \" << declaration.Content->mangledName << std::endl;\n\n    if(context->exists(signature->mangledName)){\n        throw SemanticalException(\"The function \" + signature->mangledName + \" has already been defined\", declaration.Content->position);\n    }\n\n    context->addFunction(signature);\n}\n\nvoid ast::FunctionCollectionPass::apply_struct_function(ast::FunctionDeclaration& function){\n   apply_function(function); \n}\n\nvoid ast::FunctionCollectionPass::apply_struct_constructor(ast::Constructor& constructor){\n    auto signature = std::make_shared<Function>(VOID, \"ctor\");\n\n    for(auto& param : constructor.Content->parameters){\n        auto paramType = visit(ast::TypeTransformer(context), param.parameterType);\n        signature->parameters.push_back(ParameterType(param.parameterName, paramType));\n    }\n\n    signature->struct_ = constructor.Content->struct_name;\n    signature->struct_type = constructor.Content->struct_type;\n\n    constructor.Content->mangledName = signature->mangledName = mangle_ctor(signature);\n\n    if(context->exists(signature->mangledName)){\n        throw SemanticalException(\"The constructor \" + signature->name + \" has already been defined\", constructor.Content->position);\n    }\n\n    context->addFunction(signature);\n    context->getFunction(signature->mangledName)->context = constructor.Content->context;\n}\n\nvoid ast::FunctionCollectionPass::apply_struct_destructor(ast::Destructor& destructor){\n    auto signature = std::make_shared<Function>(VOID, \"dtor\");\n\n    for(auto& param : destructor.Content->parameters){\n        auto paramType = visit(ast::TypeTransformer(context), param.parameterType);\n        signature->parameters.push_back(ParameterType(param.parameterName, paramType));\n    }\n\n    signature->struct_ = destructor.Content->struct_name;\n    signature->struct_type = destructor.Content->struct_type;\n\n    destructor.Content->mangledName = signature->mangledName = mangle_dtor(signature);\n\n    if(context->exists(signature->mangledName)){\n        throw SemanticalException(\"Only one destructor per struct is allowed\", destructor.Content->position);\n    }\n\n    context->addFunction(signature);\n    context->getFunction(signature->mangledName)->context = destructor.Content->context;\n}\n    \nvoid ast::FunctionCheckPass::apply_function(ast::FunctionDeclaration& declaration){\n    FunctionCheckerVisitor visitor(template_engine);\n    visitor.context = context;\n    visitor.currentFunction = context->getFunction(declaration.Content->mangledName);\n    visitor.check_each(declaration.Content->instructions);\n}\n\nvoid ast::FunctionCheckPass::apply_struct_function(ast::FunctionDeclaration& function){\n    apply_function(function);\n}\n\nvoid ast::FunctionCheckPass::apply_struct_constructor(ast::Constructor& constructor){\n    FunctionCheckerVisitor visitor(template_engine);\n    visitor.context = context;\n    visitor.check_each(constructor.Content->instructions);\n}\n\nvoid ast::FunctionCheckPass::apply_struct_destructor(ast::Destructor& destructor){\n    FunctionCheckerVisitor visitor(template_engine);\n    visitor.context = context;\n    visitor.check_each(destructor.Content->instructions);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Selective ros2lcm translator\n\/\/ mfallon aug,sept 2012\n\n#include <boost\/thread.hpp>\n#include <boost\/shared_ptr.hpp>\n\n\n#include <ros\/ros.h>\n#include <ros\/console.h>\n\/\/#include <std_msgs\/String.h>\n#include <cstdlib>\n#include <sys\/time.h>\n#include <time.h>\n#include <iostream>\n\n#include <message_filters\/subscriber.h>\n#include <message_filters\/time_synchronizer.h>\n#include <message_filters\/synchronizer.h>\n#include <message_filters\/sync_policies\/approximate_time.h>\n#include <image_transport\/image_transport.h>\n#include <image_transport\/subscriber_filter.h>\n#include <image_geometry\/stereo_camera_model.h>\n\n#include <sensor_msgs\/image_encodings.h>\n#include <cv_bridge\/cv_bridge.h>\n#include <opencv2\/imgproc\/imgproc.hpp>\n#include <opencv2\/highgui\/highgui.hpp>\n\n#include <sensor_msgs\/LaserScan.h>\n#include <sensor_msgs\/Image.h>\n#include <atlas_gazebo_msgs\/RobotState.h>\n\n#include <lcm\/lcm-cpp.hpp>\n#include <lcmtypes\/bot_core.hpp>\n#include <lcmtypes\/drc_lcmtypes.hpp>\n\n#define VERBOSE false\nusing namespace std;\n\/\/using namespace cv;\n\nint width =640; \/\/ hardcoded\nint height =480; \/\/ hardcoded\nuint8_t* s_data = new uint8_t [width*height*2]; \/\/ 2 grey scale images stacked\n\nclass App{\npublic:\n  App(const std::string & stereo_in,\n      const std::string & stereo_out);\n  ~App();\n\nprivate:\n  lcm::LCM lcm_publish_ ;\n  ros::NodeHandle node_;\n\n  ros::Subscriber base_scan_sub_,rstate_sub_;\n  void base_scan_cb(const sensor_msgs::LaserScanConstPtr& msg);\n  void rstate_cb(const atlas_gazebo_msgs::RobotState::ConstPtr& msg);\n  void send_lidar(const sensor_msgs::LaserScanConstPtr& msg,string channel );\n\n  \/\/ Stereo Image:\n  void image_cb(const sensor_msgs::ImageConstPtr& l_image,\n      const sensor_msgs::CameraInfoConstPtr& l_cam_info,\n      const sensor_msgs::ImageConstPtr& r_image,\n      const sensor_msgs::CameraInfoConstPtr& r_cam_info);\n\n  image_transport::ImageTransport it_;\n  image_transport::SubscriberFilter l_image_sub_, r_image_sub_;\n  message_filters::Subscriber<sensor_msgs::CameraInfo> l_info_sub_, r_info_sub_;\n  message_filters::TimeSynchronizer<sensor_msgs::Image, sensor_msgs::CameraInfo,\n  sensor_msgs::Image, sensor_msgs::CameraInfo> sync_;\n  const std::string stereo_in_,stereo_out_;\n  int counter;\n};\n\nApp::App(const std::string & stereo_in,\n    const std::string & stereo_out):\n    stereo_in_(stereo_in),\n    stereo_out_(stereo_out),\n    it_(node_),\n    sync_(10) {\n  ROS_INFO(\"Initializing Translator\");\n\n  if(!lcm_publish_.good()){\n      std::cerr <<\"ERROR: lcm is not good()\" <<std::endl;\n  }\n\n  base_scan_sub_ = node_.subscribe(string(\"\/base_scan\"), 10, &App::base_scan_cb,this);\n  rstate_sub_ = node_.subscribe(\"true_robot_state\", 10, &App::rstate_cb,this);\n\n  \/\/ Stereo Image:\n  std::string lim_string = stereo_in_ + \"\/left\/image_mono\";\n  std::string lin_string = stereo_in_ + \"\/left\/camera_info\";\n  std::string rim_string = stereo_in_ + \"\/right\/image_mono\";\n  std::string rin_string = stereo_in_ + \"\/right\/camera_info\";\n  l_image_sub_.subscribe(it_, ros::names::resolve( lim_string ), 3);\n  l_info_sub_.subscribe(node_, ros::names::resolve( lin_string ), 3);\n  r_image_sub_.subscribe(it_, ros::names::resolve( rim_string ), 3);\n  r_info_sub_.subscribe(node_, ros::names::resolve( rin_string ), 3);\n  sync_.connectInput(l_image_sub_, l_info_sub_, r_image_sub_, r_info_sub_);\n  sync_.registerCallback( boost::bind(&App::image_cb, this, _1, _2, _3, _4) );\n  counter=0;\n};\n\nApp::~App()  {\n}\n\nvoid App::image_cb(const sensor_msgs::ImageConstPtr& l_image,\n    const sensor_msgs::CameraInfoConstPtr& l_cam_info,\n    const sensor_msgs::ImageConstPtr& r_image,\n    const sensor_msgs::CameraInfoConstPtr& r_cam_info)\n{\n  ros::Time current_time = l_image->header.stamp;\n  int64_t current_utime = (int64_t) floor(l_image->header.stamp.toSec()  * 1E6);\n\n  counter++;\n  if (counter%10 ==0){\n    std::cout << counter << \"\\n\";\n  }\n\n  namespace enc = sensor_msgs::image_encodings;\n\n  cv_bridge::CvImageConstPtr left_ptr;\n  cv_bridge::CvImageConstPtr right_ptr;\n\n  try {\n    left_ptr =  cv_bridge::toCvShare(l_image, enc::MONO8);\n    right_ptr =  cv_bridge::toCvShare(r_image, enc::MONO8);\n  }catch (cv_bridge::Exception& e)\n  {\n    ROS_ERROR(\"cv_bridge exception: %s\", e.what());\n    return;\n  }\n\n  bot_core::image_t stereo;\n  stereo.utime =current_utime;\n  stereo.width =l_image->width;\n  stereo.height =2*l_image->height;\n  stereo.row_stride =l_image->width;\n  stereo.pixelformat =bot_core::image_t::PIXEL_FORMAT_GRAY;\n  \/\/ BOT_CORE_IMAGE_T_PIXEL_FORMAT_GRAY;\n  stereo.size =stereo.width*stereo.height;\n  copy(l_image->data.begin(), l_image->data.end(), s_data);\n  copy(r_image->data.begin(), r_image->data.end(), s_data + (l_image->width*l_image->height));\n  stereo.data.assign(s_data, s_data + (2*l_image->width*l_image->height));\n  stereo.nmetadata =0;\n  \/\/ stereo.metadata =NULL;\n  lcm_publish_.publish(stereo_out_.c_str(), &stereo);\n  \/\/ bot_core_image_t_publish(lcmref_, stereo_out_.c_str(), &stereo);\n}\n\n\n\/\/ typical contents: 640 x 480 images\n\/\/ points: xyz\n\/\/ channels: rgb u v\n\/\/void App::left_image_cb(const sensor_msgs::ImageConstPtr& msg){\n\/\/  send_image(msg, \"WIDE_LEFT_RECT\");\n\/\/}\n\/\/void App::right_image_cb(const sensor_msgs::ImageConstPtr& msg){\n\/\/  send_image(msg, \"WIDE_RIGHT_RECT\");\n\/\/}\n\n\/\/ TODO: jpeg compression:\n\/\/       look into openni_utils\/openni_ros2rgb for code\n\/\/ TODO: pre-allocate image_data and retain for speed - when size is known\n\/*void App::send_image(const sensor_msgs::ImageConstPtr& msg,string channel ){\n  image_data = new uint8_t [640*480*3];\n  IplImage *imageBGR = cvCreateImage(cvSize( msg->width ,   msg->height), 8, 3);\n  IplImage* imageRGB = cvCreateImage(cvSize( msg->width ,   msg->height), 8, 3);\n\n  copy(msg->data.begin(), msg->data.end(), image_data);\n  imageBGR->imageData = (char*) image_data;\n  cvCvtColor( imageBGR, imageRGB, CV_BGR2RGB );\n  Mat imageRGBmat(imageRGB);\n\n  bot_core_image_t img;\n  img.utime = (int64_t) floor(msg->header.stamp.toSec()  * 1E6);\n  img.width = msg->width;\n  img.height =msg->height;\n  img.row_stride = 3*msg->width; \/\/ check this\n  img.size = msg->width*msg->height*3;\n  img.nmetadata=0;\n  img.metadata=NULL;\n  img.data=imageRGBmat.data;\n  img.pixelformat =BOT_CORE_IMAGE_T_PIXEL_FORMAT_RGB;\n  bot_core_image_t_publish(lcm_publish_,channel.c_str(), &img);\n\n  if (VERBOSE){\n    cout << \"got: \" << channel<< \"\\n\";\n    cout << msg->width << \", \" << msg->height << \", \"\n        << msg->encoding << \", \" << ((int) msg->is_bigendian) << \", \" << msg->step << \"\\n\";\n    \/\/640, 480, mono8, 0, 640\n    cout << img.utime << \"\\n\";\n  }\n  cvReleaseImage(&imageBGR);\n  cvReleaseImage(&imageRGB);\n  delete[] image_data;\n}*\/\n\n\nvoid App::rstate_cb(const atlas_gazebo_msgs::RobotState::ConstPtr& msg){\n  drc::robot_state_t robot_state_msg;\n  robot_state_msg.utime = msg->header.stamp.toNSec()\/1000; \/\/ from nsec to usec\n  robot_state_msg.robot_name = msg->robot_name;\n  robot_state_msg.origin_position.translation.x = msg->body_pose.position.x;\n  robot_state_msg.origin_position.translation.y = msg->body_pose.position.y;\n  robot_state_msg.origin_position.translation.z = msg->body_pose.position.z;\n  robot_state_msg.origin_position.rotation.x = msg->body_pose.orientation.x;\n  robot_state_msg.origin_position.rotation.y = msg->body_pose.orientation.y;\n  robot_state_msg.origin_position.rotation.z = msg->body_pose.orientation.z;\n  robot_state_msg.origin_position.rotation.w = msg->body_pose.orientation.w;\n\n  robot_state_msg.origin_twist.linear_velocity.x =msg->body_twist.linear.x;\n  robot_state_msg.origin_twist.linear_velocity.y =msg->body_twist.linear.y;\n  robot_state_msg.origin_twist.linear_velocity.z =msg->body_twist.linear.z;\n  robot_state_msg.origin_twist.angular_velocity.x =msg->body_twist.angular.x;\n  robot_state_msg.origin_twist.angular_velocity.y =msg->body_twist.angular.y;\n  robot_state_msg.origin_twist.angular_velocity.z =msg->body_twist.angular.z;\n\n  int i,j;\n  for(i = 0; i < 6; i++)  {\n    for(j = 0; j < 6; j++) {\n      robot_state_msg.origin_cov.position_cov[i][j] = 0;\n      robot_state_msg.origin_cov.twist_cov[i][j] = 0;\n    }\n  }\n\n  robot_state_msg.num_joints = msg->joint_name.size();\n  robot_state_msg.joint_name = msg->joint_name;\n\n  drc::joint_covariance_t j_cov;\n  j_cov.variance = 0;\n\n  for (std::vector<int>::size_type i = 0; i != robot_state_msg.joint_name.size(); i++)  {\n    robot_state_msg.joint_position.push_back(msg->joint_position[i]);\n    robot_state_msg.joint_velocity.push_back(msg->joint_velocity[i]);\n    robot_state_msg.measured_effort.push_back(0);\n    robot_state_msg.joint_cov.push_back(j_cov);\n  }\n\n  \/\/ dummy ground contact states\n  robot_state_msg.contacts.num_contacts =2;\n  robot_state_msg.contacts.id.push_back(\"Left_Foot\");\n  robot_state_msg.contacts.id.push_back(\"Right_Foot\");\n  robot_state_msg.contacts.inContact.push_back(0);\n  robot_state_msg.contacts.inContact.push_back(0);\n\n  lcm_publish_.publish(\"TRUE_ROBOT_STATE\", &robot_state_msg);\n}\n\n\nvoid App::base_scan_cb(const sensor_msgs::LaserScanConstPtr& msg){\n  send_lidar(msg, \"BASE_SCAN\");\n}\n\nvoid App::send_lidar(const sensor_msgs::LaserScanConstPtr& msg,string channel ){\n  bot_core::planar_lidar_t scan_out;\n\n  float range_line[msg->ranges.size()];\n  for (size_t i=0; i < msg->ranges.size(); i++){\n    scan_out.ranges.push_back( msg->ranges[i] );\n    \/\/range_line[i] = msg->ranges[i];\n  }\n  scan_out.utime = (int64_t) floor(msg->header.stamp.toSec()  * 1E6);\n  scan_out.nranges =msg->ranges.size();\n  \/\/  scan_out.ranges=range_line;\n  scan_out.nintensities=0;\n  \/\/scan_out.intensities=NULL;\n  scan_out.rad0 = msg->angle_min;\n  scan_out.radstep = msg->angle_increment;\n\n  lcm_publish_.publish(channel.c_str(), &scan_out);\n  \/\/  bot_core_planar_lidar_t_publish(lcm_publish_,channel.c_str(),&scan_out);\n  if (VERBOSE) cout << channel << \": \"<< scan_out.utime << \"\\n\";\n}\n\n\nint main(int argc, char **argv){\n  std::cout << \"ros2lcm_translator launched\\n\";\n  ros::init(argc, argv, \"ros2lcm_translator\");\n  std::cout << \"ros2lcm_translator converter\\n\";\n  std::cout << \"Arguments: ros2lcm_translator ROS_stereo_channel LCM_stereo_channel\\n\";\n  std::cout << \"ros2lcm_translator wide_stereo WIDE_STEREO_IMAGE\\n\";\n\n  std::cout << \"    program: \" << argv[ 0 ] << \"\\n\";\n  std::cout << \"ROS channel: \" << argv[ 1 ] << \" [Input]\\n\";\n  std::cout << \"LCM channel: \" << argv[ 2 ] << \" [Output]\\n\";\n\n  App *app = new App(argv[ 1 ], argv[ 2 ]);\n  ros::spin();\n  return 0;\n}\n<commit_msg>harded coded params<commit_after>\/\/ Selective ros2lcm translator\n\/\/ mfallon aug,sept 2012\n\n#include <boost\/thread.hpp>\n#include <boost\/shared_ptr.hpp>\n\n\n#include <ros\/ros.h>\n#include <ros\/console.h>\n\/\/#include <std_msgs\/String.h>\n#include <cstdlib>\n#include <sys\/time.h>\n#include <time.h>\n#include <iostream>\n\n#include <message_filters\/subscriber.h>\n#include <message_filters\/time_synchronizer.h>\n#include <message_filters\/synchronizer.h>\n#include <message_filters\/sync_policies\/approximate_time.h>\n#include <image_transport\/image_transport.h>\n#include <image_transport\/subscriber_filter.h>\n#include <image_geometry\/stereo_camera_model.h>\n\n#include <sensor_msgs\/image_encodings.h>\n#include <cv_bridge\/cv_bridge.h>\n#include <opencv2\/imgproc\/imgproc.hpp>\n#include <opencv2\/highgui\/highgui.hpp>\n\n#include <sensor_msgs\/LaserScan.h>\n#include <sensor_msgs\/Image.h>\n#include <atlas_gazebo_msgs\/RobotState.h>\n\n#include <lcm\/lcm-cpp.hpp>\n#include <lcmtypes\/bot_core.hpp>\n#include <lcmtypes\/drc_lcmtypes.hpp>\n\n#define VERBOSE false\nusing namespace std;\n\/\/using namespace cv;\n\nint width =640; \/\/ hardcoded\nint height =480; \/\/ hardcoded\nuint8_t* s_data = new uint8_t [width*height*2]; \/\/ 2 grey scale images stacked\n\nclass App{\npublic:\n  App(const std::string & stereo_in,\n      const std::string & stereo_out);\n  ~App();\n\nprivate:\n  lcm::LCM lcm_publish_ ;\n  ros::NodeHandle node_;\n\n  ros::Subscriber base_scan_sub_,rstate_sub_;\n  void base_scan_cb(const sensor_msgs::LaserScanConstPtr& msg);\n  void rstate_cb(const atlas_gazebo_msgs::RobotState::ConstPtr& msg);\n  void send_lidar(const sensor_msgs::LaserScanConstPtr& msg,string channel );\n\n  \/\/ Stereo Image:\n  void image_cb(const sensor_msgs::ImageConstPtr& l_image,\n      const sensor_msgs::CameraInfoConstPtr& l_cam_info,\n      const sensor_msgs::ImageConstPtr& r_image,\n      const sensor_msgs::CameraInfoConstPtr& r_cam_info);\n\n  image_transport::ImageTransport it_;\n  image_transport::SubscriberFilter l_image_sub_, r_image_sub_;\n  message_filters::Subscriber<sensor_msgs::CameraInfo> l_info_sub_, r_info_sub_;\n  message_filters::TimeSynchronizer<sensor_msgs::Image, sensor_msgs::CameraInfo,\n  sensor_msgs::Image, sensor_msgs::CameraInfo> sync_;\n  const std::string stereo_in_,stereo_out_;\n  int counter;\n};\n\nApp::App(const std::string & stereo_in,\n    const std::string & stereo_out):\n    stereo_in_(stereo_in),\n    stereo_out_(stereo_out),\n    it_(node_),\n    sync_(10) {\n  ROS_INFO(\"Initializing Translator\");\n\n  if(!lcm_publish_.good()){\n      std::cerr <<\"ERROR: lcm is not good()\" <<std::endl;\n  }\n\n  base_scan_sub_ = node_.subscribe(string(\"\/base_scan\"), 10, &App::base_scan_cb,this);\n  rstate_sub_ = node_.subscribe(\"true_robot_state\", 10, &App::rstate_cb,this);\n\n  \/\/ Stereo Image:\n  std::string lim_string = stereo_in_ + \"\/left\/image_mono\";\n  std::string lin_string = stereo_in_ + \"\/left\/camera_info\";\n  std::string rim_string = stereo_in_ + \"\/right\/image_mono\";\n  std::string rin_string = stereo_in_ + \"\/right\/camera_info\";\n  l_image_sub_.subscribe(it_, ros::names::resolve( lim_string ), 3);\n  l_info_sub_.subscribe(node_, ros::names::resolve( lin_string ), 3);\n  r_image_sub_.subscribe(it_, ros::names::resolve( rim_string ), 3);\n  r_info_sub_.subscribe(node_, ros::names::resolve( rin_string ), 3);\n  sync_.connectInput(l_image_sub_, l_info_sub_, r_image_sub_, r_info_sub_);\n  sync_.registerCallback( boost::bind(&App::image_cb, this, _1, _2, _3, _4) );\n  counter=0;\n};\n\nApp::~App()  {\n}\n\nvoid App::image_cb(const sensor_msgs::ImageConstPtr& l_image,\n    const sensor_msgs::CameraInfoConstPtr& l_cam_info,\n    const sensor_msgs::ImageConstPtr& r_image,\n    const sensor_msgs::CameraInfoConstPtr& r_cam_info)\n{\n  ros::Time current_time = l_image->header.stamp;\n  int64_t current_utime = (int64_t) floor(l_image->header.stamp.toSec()  * 1E6);\n\n  counter++;\n  if (counter%10 ==0){\n    std::cout << counter << \"\\n\";\n  }\n\n  namespace enc = sensor_msgs::image_encodings;\n\n  cv_bridge::CvImageConstPtr left_ptr;\n  cv_bridge::CvImageConstPtr right_ptr;\n\n  try {\n    left_ptr =  cv_bridge::toCvShare(l_image, enc::MONO8);\n    right_ptr =  cv_bridge::toCvShare(r_image, enc::MONO8);\n  }catch (cv_bridge::Exception& e)\n  {\n    ROS_ERROR(\"cv_bridge exception: %s\", e.what());\n    return;\n  }\n\n  bot_core::image_t stereo;\n  stereo.utime =current_utime;\n  stereo.width =l_image->width;\n  stereo.height =2*l_image->height;\n  stereo.row_stride =l_image->width;\n  stereo.pixelformat =bot_core::image_t::PIXEL_FORMAT_GRAY;\n  \/\/ BOT_CORE_IMAGE_T_PIXEL_FORMAT_GRAY;\n  stereo.size =stereo.width*stereo.height;\n  copy(l_image->data.begin(), l_image->data.end(), s_data);\n  copy(r_image->data.begin(), r_image->data.end(), s_data + (l_image->width*l_image->height));\n  stereo.data.assign(s_data, s_data + (2*l_image->width*l_image->height));\n  stereo.nmetadata =0;\n  \/\/ stereo.metadata =NULL;\n  lcm_publish_.publish(stereo_out_.c_str(), &stereo);\n  \/\/ bot_core_image_t_publish(lcmref_, stereo_out_.c_str(), &stereo);\n}\n\n\n\/\/ typical contents: 640 x 480 images\n\/\/ points: xyz\n\/\/ channels: rgb u v\n\/\/void App::left_image_cb(const sensor_msgs::ImageConstPtr& msg){\n\/\/  send_image(msg, \"WIDE_LEFT_RECT\");\n\/\/}\n\/\/void App::right_image_cb(const sensor_msgs::ImageConstPtr& msg){\n\/\/  send_image(msg, \"WIDE_RIGHT_RECT\");\n\/\/}\n\n\/\/ TODO: jpeg compression:\n\/\/       look into openni_utils\/openni_ros2rgb for code\n\/\/ TODO: pre-allocate image_data and retain for speed - when size is known\n\/*void App::send_image(const sensor_msgs::ImageConstPtr& msg,string channel ){\n  image_data = new uint8_t [640*480*3];\n  IplImage *imageBGR = cvCreateImage(cvSize( msg->width ,   msg->height), 8, 3);\n  IplImage* imageRGB = cvCreateImage(cvSize( msg->width ,   msg->height), 8, 3);\n\n  copy(msg->data.begin(), msg->data.end(), image_data);\n  imageBGR->imageData = (char*) image_data;\n  cvCvtColor( imageBGR, imageRGB, CV_BGR2RGB );\n  Mat imageRGBmat(imageRGB);\n\n  bot_core_image_t img;\n  img.utime = (int64_t) floor(msg->header.stamp.toSec()  * 1E6);\n  img.width = msg->width;\n  img.height =msg->height;\n  img.row_stride = 3*msg->width; \/\/ check this\n  img.size = msg->width*msg->height*3;\n  img.nmetadata=0;\n  img.metadata=NULL;\n  img.data=imageRGBmat.data;\n  img.pixelformat =BOT_CORE_IMAGE_T_PIXEL_FORMAT_RGB;\n  bot_core_image_t_publish(lcm_publish_,channel.c_str(), &img);\n\n  if (VERBOSE){\n    cout << \"got: \" << channel<< \"\\n\";\n    cout << msg->width << \", \" << msg->height << \", \"\n        << msg->encoding << \", \" << ((int) msg->is_bigendian) << \", \" << msg->step << \"\\n\";\n    \/\/640, 480, mono8, 0, 640\n    cout << img.utime << \"\\n\";\n  }\n  cvReleaseImage(&imageBGR);\n  cvReleaseImage(&imageRGB);\n  delete[] image_data;\n}*\/\n\n\nvoid App::rstate_cb(const atlas_gazebo_msgs::RobotState::ConstPtr& msg){\n  drc::robot_state_t robot_state_msg;\n  robot_state_msg.utime = msg->header.stamp.toNSec()\/1000; \/\/ from nsec to usec\n  robot_state_msg.robot_name = msg->robot_name;\n  robot_state_msg.origin_position.translation.x = msg->body_pose.position.x;\n  robot_state_msg.origin_position.translation.y = msg->body_pose.position.y;\n  robot_state_msg.origin_position.translation.z = msg->body_pose.position.z;\n  robot_state_msg.origin_position.rotation.x = msg->body_pose.orientation.x;\n  robot_state_msg.origin_position.rotation.y = msg->body_pose.orientation.y;\n  robot_state_msg.origin_position.rotation.z = msg->body_pose.orientation.z;\n  robot_state_msg.origin_position.rotation.w = msg->body_pose.orientation.w;\n\n  robot_state_msg.origin_twist.linear_velocity.x =msg->body_twist.linear.x;\n  robot_state_msg.origin_twist.linear_velocity.y =msg->body_twist.linear.y;\n  robot_state_msg.origin_twist.linear_velocity.z =msg->body_twist.linear.z;\n  robot_state_msg.origin_twist.angular_velocity.x =msg->body_twist.angular.x;\n  robot_state_msg.origin_twist.angular_velocity.y =msg->body_twist.angular.y;\n  robot_state_msg.origin_twist.angular_velocity.z =msg->body_twist.angular.z;\n\n  int i,j;\n  for(i = 0; i < 6; i++)  {\n    for(j = 0; j < 6; j++) {\n      robot_state_msg.origin_cov.position_cov[i][j] = 0;\n      robot_state_msg.origin_cov.twist_cov[i][j] = 0;\n    }\n  }\n\n  robot_state_msg.num_joints = msg->joint_name.size();\n  robot_state_msg.joint_name = msg->joint_name;\n\n  drc::joint_covariance_t j_cov;\n  j_cov.variance = 0;\n\n  for (std::vector<int>::size_type i = 0; i != robot_state_msg.joint_name.size(); i++)  {\n    robot_state_msg.joint_position.push_back(msg->joint_position[i]);\n    robot_state_msg.joint_velocity.push_back(msg->joint_velocity[i]);\n    robot_state_msg.measured_effort.push_back(0);\n    robot_state_msg.joint_cov.push_back(j_cov);\n  }\n\n  \/\/ dummy ground contact states\n  robot_state_msg.contacts.num_contacts =2;\n  robot_state_msg.contacts.id.push_back(\"Left_Foot\");\n  robot_state_msg.contacts.id.push_back(\"Right_Foot\");\n  robot_state_msg.contacts.inContact.push_back(0);\n  robot_state_msg.contacts.inContact.push_back(0);\n\n  lcm_publish_.publish(\"TRUE_ROBOT_STATE\", &robot_state_msg);\n}\n\n\nvoid App::base_scan_cb(const sensor_msgs::LaserScanConstPtr& msg){\n  send_lidar(msg, \"BASE_SCAN\");\n}\n\nvoid App::send_lidar(const sensor_msgs::LaserScanConstPtr& msg,string channel ){\n  bot_core::planar_lidar_t scan_out;\n\n  float range_line[msg->ranges.size()];\n  for (size_t i=0; i < msg->ranges.size(); i++){\n    scan_out.ranges.push_back( msg->ranges[i] );\n    \/\/range_line[i] = msg->ranges[i];\n  }\n  scan_out.utime = (int64_t) floor(msg->header.stamp.toSec()  * 1E6);\n  scan_out.nranges =msg->ranges.size();\n  \/\/  scan_out.ranges=range_line;\n  scan_out.nintensities=0;\n  \/\/scan_out.intensities=NULL;\n  scan_out.rad0 = msg->angle_min;\n  scan_out.radstep = msg->angle_increment;\n\n  lcm_publish_.publish(channel.c_str(), &scan_out);\n  \/\/  bot_core_planar_lidar_t_publish(lcm_publish_,channel.c_str(),&scan_out);\n  if (VERBOSE) cout << channel << \": \"<< scan_out.utime << \"\\n\";\n}\n\n\nint main(int argc, char **argv){\n  std::cout << \"ros2lcm_translator_combined launched\\n\";\n  ros::init(argc, argv, \"ros2lcm_translator_combined\");\n\n  App *app = new App(\"wide_stereo\", \"WIDE_STEREO_IMAGE\");\n\n\/*\n  std::cout << \"Arguments: ros2lcm_translator_combined ROS_stereo_channel LCM_stereo_channel\\n\";\n  std::cout << \"ros2lcm_translator_combined wide_stereo WIDE_STEREO_IMAGE\\n\";\n  std::cout << \"    program: \" << argv[ 0 ] << \"\\n\";\n  std::cout << \"ROS channel: \" << argv[ 1 ] << \" [Input]\\n\";\n  std::cout << \"LCM channel: \" << argv[ 2 ] << \" [Output]\\n\";\n  App *app = new App(argv[ 1 ], argv[ 2 ]);*\/\n  ros::spin();\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"mainwindow.h\"\n\n#include <QLabel>\n#include <QDockWidget>\n#include <QSettings>\n#include <QAction>\n#include <QMenuBar>\n#include <QMenu>\n\n#include <libblockdia.h>\n\n#include <blockbrowser.h>\n\n\nMainWindow::MainWindow(QWidget *parent)\n    : QMainWindow(parent)\n{\n    \/\/ menu - file\n    QMenu *menuFile = new QMenu(\"File\", this);\n    this->menuBar()->addMenu(menuFile);\n\n    \/\/ action - new block\n    QAction *actNewBlock = new QAction(\"new block\", this);\n    menuFile->addAction(actNewBlock);\n    actNewBlock->setShortcut(Qt::Key_N | Qt::CTRL);\n    connect(actNewBlock, SIGNAL(triggered(bool)), this, SLOT(slotActionNewBlock()));\n\n    \/\/ action - quit\n    QAction *actQuit = new QAction(\"quit\", this);\n    menuFile->addAction(actQuit);\n    actQuit->setShortcut(Qt::Key_Q | Qt::CTRL);\n    connect(actQuit, SIGNAL(triggered(bool)), this, SLOT(slotActionQuit()));\n\n    \/\/ central widget\n    this->widgetMain = new QTabWidget(this);\n    this->setCentralWidget(this->widgetMain);\n\n    \/\/ block browser dock\n    QDockWidget *dock = new QDockWidget(\"\", this);\n    dock->setObjectName(\"BlockBrowser\");\n    dock->setAllowedAreas(Qt::LeftDockWidgetArea);\n    dock->setWidget(new BlockBrowser(this));\n    dock->setFloating(false);\n    dock->setFeatures(QDockWidget::NoDockWidgetFeatures);\n    this->addDockWidget(Qt::LeftDockWidgetArea, dock);\n\n    \/\/ restore window state\n    QSettings s;\n    this->restoreState(s.value(\"Mainwindow\/State\").toByteArray());\n    this->restoreGeometry(s.value(\"MainWindow\/Geometry\").toByteArray());\n}\n\nMainWindow::~MainWindow()\n{\n    \/\/ save window state\n    QSettings s;\n    s.setValue(\"MainWindow\/State\", this->saveState());\n    s.setValue(\"MainWindow\/Geometry\", this->saveGeometry());\n}\n\nvoid MainWindow::slotActionNewBlock()\n{\n    \/\/ create new block editor\n    libblockdia::Block *block = new libblockdia::Block(this);\n    block->setTypeName(\"New Block Type *\");\n    block->setTypeId(\"NBT\");\n    libblockdia::ViewBlockEditor *bEditor = new libblockdia::ViewBlockEditor(block);\n\n    \/\/ add block editor to central widget\n    QTabWidget *tw = (QTabWidget *) this->centralWidget();\n    tw->addTab(bEditor, block->typeId() + \"*\");\n}\n\nvoid MainWindow::slotActionQuit()\n{\n    this->close();\n}\n<commit_msg>bring new block in front when creating new block<commit_after>#include \"mainwindow.h\"\n\n#include <QLabel>\n#include <QDockWidget>\n#include <QSettings>\n#include <QAction>\n#include <QMenuBar>\n#include <QMenu>\n\n#include <libblockdia.h>\n\n#include <blockbrowser.h>\n\n\nMainWindow::MainWindow(QWidget *parent)\n    : QMainWindow(parent)\n{\n    \/\/ menu - file\n    QMenu *menuFile = new QMenu(\"File\", this);\n    this->menuBar()->addMenu(menuFile);\n\n    \/\/ action - new block\n    QAction *actNewBlock = new QAction(\"new block\", this);\n    menuFile->addAction(actNewBlock);\n    actNewBlock->setShortcut(Qt::Key_N | Qt::CTRL);\n    connect(actNewBlock, SIGNAL(triggered(bool)), this, SLOT(slotActionNewBlock()));\n\n    \/\/ action - quit\n    QAction *actQuit = new QAction(\"quit\", this);\n    menuFile->addAction(actQuit);\n    actQuit->setShortcut(Qt::Key_Q | Qt::CTRL);\n    connect(actQuit, SIGNAL(triggered(bool)), this, SLOT(slotActionQuit()));\n\n    \/\/ central widget\n    this->widgetMain = new QTabWidget(this);\n    this->setCentralWidget(this->widgetMain);\n\n    \/\/ block browser dock\n    QDockWidget *dock = new QDockWidget(\"\", this);\n    dock->setObjectName(\"BlockBrowser\");\n    dock->setAllowedAreas(Qt::LeftDockWidgetArea);\n    dock->setWidget(new BlockBrowser(this));\n    dock->setFloating(false);\n    dock->setFeatures(QDockWidget::NoDockWidgetFeatures);\n    this->addDockWidget(Qt::LeftDockWidgetArea, dock);\n\n    \/\/ restore window state\n    QSettings s;\n    this->restoreState(s.value(\"Mainwindow\/State\").toByteArray());\n    this->restoreGeometry(s.value(\"MainWindow\/Geometry\").toByteArray());\n}\n\nMainWindow::~MainWindow()\n{\n    \/\/ save window state\n    QSettings s;\n    s.setValue(\"MainWindow\/State\", this->saveState());\n    s.setValue(\"MainWindow\/Geometry\", this->saveGeometry());\n}\n\nvoid MainWindow::slotActionNewBlock()\n{\n    \/\/ create new block editor\n    libblockdia::Block *block = new libblockdia::Block(this);\n    block->setTypeName(\"New Block Type *\");\n    block->setTypeId(\"NBT\");\n    libblockdia::ViewBlockEditor *bEditor = new libblockdia::ViewBlockEditor(block);\n\n    \/\/ add block editor to central widget\n    QTabWidget *tw = (QTabWidget *) this->centralWidget();\n    int index = tw->addTab(bEditor, block->typeId() + \"*\");\n    tw->setCurrentIndex(index);\n}\n\nvoid MainWindow::slotActionQuit()\n{\n    this->close();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* bzflag\n* Copyright (c) 1993 - 2008 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\/* interface header *\/\n#include \"WorldEventManager.h\"\n\n\/* system implementation headers *\/\n#include <string>\n\n\/* common implementation headers *\/\n#include \"global.h\"\n#include \"bzfsAPI.h\"\n\n\nextern bz_eTeamType convertTeam(TeamColor team);\nextern TeamColor convertTeam(bz_eTeamType team);\n\n\/\/-------------------WorldEventManager--------------------\nWorldEventManager::WorldEventManager()\n{\n}\n\nWorldEventManager::~WorldEventManager()\n{\n\ttmEventTypeList::iterator eventItr = eventList.begin();\n\twhile (eventItr != eventList.end()) {\n\t\ttvEventList::iterator itr = eventItr->second.begin();\n\t\twhile (itr != eventItr->second.end()) {\n\t\t\tif ((*itr) && (*itr)->autoDelete())\n\t\t\t\tdelete (*itr);\n\t\t\t*itr = NULL;\n\n\t\t\titr++;\n\t\t}\n\t\teventItr++;\n\t}\n}\n\nvoid WorldEventManager::addEvent(bz_eEventType eventType, bz_EventHandler* theEvent)\n{\n\tif (!theEvent)\n\t\treturn;\n\n\tif (eventList.find(eventType) == eventList.end()) {\n\t\ttvEventList newList;\n\t\teventList[eventType] = newList;\n\t}\n\n\teventList.find(eventType)->second.push_back(theEvent);\n}\n\nvoid WorldEventManager::removeEvent(bz_eEventType eventType, bz_EventHandler* theEvent)\n{\n\tif (!theEvent)\n\t\treturn;\n\n\ttmEventTypeList::iterator eventTypeItr = eventList.find(eventType);\n\tif (eventTypeItr == eventList.end())\n\t\treturn;\n\n\ttvEventList::iterator itr = eventTypeItr->second.begin();\n\twhile (itr != eventTypeItr->second.end()) {\n\t\tif (*itr == theEvent)\n\t\t\titr = eventTypeItr->second.erase(itr);\n\t\telse\n\t\t\titr++;\n\t}\n}\n\ntvEventList WorldEventManager::getEventList (bz_eEventType eventType)\n{\n\ttvEventList\teList;\n\n\ttmEventTypeList::iterator itr = eventList.find(eventType);\n\tif (itr == eventList.end())\n\t\treturn eList;\n\n\teList = itr->second;\n\treturn eList;\n}\n\nvoid WorldEventManager::callEvents(bz_eEventType eventType, bz_EventData *eventData)\n{\n\tif (!eventData)\n\t\treturn;\n\n\ttvEventList\teList = getEventList(eventType);\n\n\tfor (unsigned int i = 0; i < eList.size(); i++)\n\t\teList[i]->process(eventData);\n}\n\nint WorldEventManager::getEventCount(bz_eEventType eventType)\n{\n\treturn (int)getEventList(eventType).size();\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>Whitespace<commit_after>\/* bzflag\n * Copyright (c) 1993 - 2008 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\/* interface header *\/\n#include \"WorldEventManager.h\"\n\n\/* system implementation headers *\/\n#include <string>\n\n\/* common implementation headers *\/\n#include \"global.h\"\n#include \"bzfsAPI.h\"\n\n\nextern bz_eTeamType convertTeam(TeamColor team);\nextern TeamColor convertTeam(bz_eTeamType team);\n\n\/\/-------------------WorldEventManager--------------------\nWorldEventManager::WorldEventManager()\n{\n}\n\nWorldEventManager::~WorldEventManager()\n{\n  tmEventTypeList::iterator eventItr = eventList.begin();\n  while (eventItr != eventList.end()) {\n    tvEventList::iterator itr = eventItr->second.begin();\n    while (itr != eventItr->second.end()) {\n      if ((*itr) && (*itr)->autoDelete())\n\tdelete (*itr);\n      *itr = NULL;\n\n      itr++;\n    }\n    eventItr++;\n  }\n}\n\nvoid WorldEventManager::addEvent(bz_eEventType eventType, bz_EventHandler* theEvent)\n{\n  if (!theEvent)\n    return;\n\n  if (eventList.find(eventType) == eventList.end()) {\n    tvEventList newList;\n    eventList[eventType] = newList;\n  }\n\n  eventList.find(eventType)->second.push_back(theEvent);\n}\n\nvoid WorldEventManager::removeEvent(bz_eEventType eventType, bz_EventHandler* theEvent)\n{\n  if (!theEvent)\n    return;\n\n  tmEventTypeList::iterator eventTypeItr = eventList.find(eventType);\n  if (eventTypeItr == eventList.end())\n    return;\n\n  tvEventList::iterator itr = eventTypeItr->second.begin();\n  while (itr != eventTypeItr->second.end()) {\n    if (*itr == theEvent)\n      itr = eventTypeItr->second.erase(itr);\n    else\n      itr++;\n  }\n}\n\ntvEventList WorldEventManager::getEventList (bz_eEventType eventType)\n{\n  tvEventList\teList;\n\n  tmEventTypeList::iterator itr = eventList.find(eventType);\n  if (itr == eventList.end())\n    return eList;\n\n  eList = itr->second;\n  return eList;\n}\n\nvoid WorldEventManager::callEvents(bz_eEventType eventType, bz_EventData *eventData)\n{\n  if (!eventData)\n    return;\n\n  tvEventList\teList = getEventList(eventType);\n\n  for (unsigned int i = 0; i < eList.size(); i++)\n    eList[i]->process(eventData);\n}\n\nint WorldEventManager::getEventCount(bz_eEventType eventType)\n{\n  return (int)getEventList(eventType).size();\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 * Copyright (c) 2011-2015, Intel Corporation\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without modification,\n * are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation and\/or\n * other materials provided with the distribution.\n *\n * 3. Neither the name of the copyright holder nor the names of its contributors\n * may be used to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON\n * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"LogarithmicParameterAdaptation.h\"\n#include \"Utility.h\"\n#include <math.h>\n\n#define base CLinearParameterAdaptation\n\n\/\/ M_E is the base of the natural logarithm for 'e' from math.h\nCLogarithmicParameterAdaptation::CLogarithmicParameterAdaptation() : base(\"Logarithmic\"),\n    _dLogarithmBase(M_E), _dFloorValue(-INFINITY)\n{\n}\n\n\/\/ Element properties\nvoid CLogarithmicParameterAdaptation::showProperties(std::string& strResult) const\n{\n    base::showProperties(strResult);\n\n    strResult += \" - LogarithmBase: \";\n    strResult += CUtility::toString(_dLogarithmBase);\n    strResult += \"\\n\";\n    strResult += \" - FloorValue: \";\n    strResult += CUtility::toString(_dFloorValue);\n    strResult += \"\\n\";\n}\n\nbool CLogarithmicParameterAdaptation::fromXml(const CXmlElement& xmlElement,\n                                            CXmlSerializingContext& serializingContext)\n{\n    if (xmlElement.getAttribute(\"LogarithmBase\", _dLogarithmBase)\n        && (_dLogarithmBase <= 0 || _dLogarithmBase == 1)) {\n        \/\/ Avoid negative and 1 values\n        serializingContext.setError(\"LogarithmBase attribute cannot be negative or 1 on element\"\n                                    + xmlElement.getPath());\n\n        return false;\n    }\n\n    xmlElement.getAttribute(\"FloorValue\", _dFloorValue);\n\n    \/\/ Base\n    return base::fromXml(xmlElement, serializingContext);\n}\n\n\nint64_t CLogarithmicParameterAdaptation::fromUserValue(double dValue) const\n{\n    return fmax(round(base::fromUserValue(log(dValue) \/ log(_dLogarithmBase))),\n                        _dFloorValue);\n}\n\ndouble CLogarithmicParameterAdaptation::toUserValue(int64_t iValue) const\n{\n    return exp(base::toUserValue(iValue) * log(_dLogarithmBase));\n}\n<commit_msg>Use exp(1) to get e value<commit_after>\/*\n * Copyright (c) 2011-2015, Intel Corporation\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without modification,\n * are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation and\/or\n * other materials provided with the distribution.\n *\n * 3. Neither the name of the copyright holder nor the names of its contributors\n * may be used to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON\n * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"LogarithmicParameterAdaptation.h\"\n#include \"Utility.h\"\n#include <cmath>\n\n#define base CLinearParameterAdaptation\n\nCLogarithmicParameterAdaptation::CLogarithmicParameterAdaptation() : base(\"Logarithmic\"),\n    \/\/ std::exp(1) == e^1 == e == natural logarithm base\n    \/\/ Make sure there is no precision lose by using std::exp overload that\n    \/\/ return the same type as _dLogarithmBase\n    _dLogarithmBase{std::exp(decltype(_dLogarithmBase){1})},\n    _dFloorValue(-INFINITY)\n{\n}\n\n\/\/ Element properties\nvoid CLogarithmicParameterAdaptation::showProperties(std::string& strResult) const\n{\n    base::showProperties(strResult);\n\n    strResult += \" - LogarithmBase: \";\n    strResult += CUtility::toString(_dLogarithmBase);\n    strResult += \"\\n\";\n    strResult += \" - FloorValue: \";\n    strResult += CUtility::toString(_dFloorValue);\n    strResult += \"\\n\";\n}\n\nbool CLogarithmicParameterAdaptation::fromXml(const CXmlElement& xmlElement,\n                                            CXmlSerializingContext& serializingContext)\n{\n    if (xmlElement.getAttribute(\"LogarithmBase\", _dLogarithmBase)\n        && (_dLogarithmBase <= 0 || _dLogarithmBase == 1)) {\n        \/\/ Avoid negative and 1 values\n        serializingContext.setError(\"LogarithmBase attribute cannot be negative or 1 on element\"\n                                    + xmlElement.getPath());\n\n        return false;\n    }\n\n    xmlElement.getAttribute(\"FloorValue\", _dFloorValue);\n\n    \/\/ Base\n    return base::fromXml(xmlElement, serializingContext);\n}\n\n\nint64_t CLogarithmicParameterAdaptation::fromUserValue(double dValue) const\n{\n    return fmax(round(base::fromUserValue(log(dValue) \/ log(_dLogarithmBase))),\n                        _dFloorValue);\n}\n\ndouble CLogarithmicParameterAdaptation::toUserValue(int64_t iValue) const\n{\n    return exp(base::toUserValue(iValue) * log(_dLogarithmBase));\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"tfd_modules\/tfdm_eval_interface.h\"\n#include <stdio.h>\n#include <fstream>\n#include <iostream>\n#include <sstream>\n#include <sys\/stat.h>\n#include <ros\/ros.h>\n#include \"planParser.h\"\n#include \"domainParser.h\"\n#include <pluginlib\/class_list_macros.h>\n\nPLUGINLIB_DECLARE_CLASS(tfd_modules, tfdm_eval_interface,\n        tfd_modules::TFDMEvalInterface, continual_planning_executive::PlannerInterface)\n\nusing namespace std;\n\nnamespace tfd_modules\n{\n    bool setupRunLazyEvalPartialCaching()\n    {\n        \/\/ set params for module, etc.\n        ros::NodeHandle nh(\"\/tfd_modules\");\n        nh.setParam(\"run_name\", \"lazy_eval_partial_caching\");\n        nh.setParam(\"lazy_state_module_evaluation\", 1);\n\n        \/\/ record all other settings\n\n        return true;\n    }\n\n    bool setupRunEagerEvalPartialCaching()\n    {\n        \/\/ set params for module, etc.\n        ros::NodeHandle nh(\"\/tfd_modules\");\n        nh.setParam(\"run_name\", \"eager_eval_partial_caching\");\n        nh.setParam(\"lazy_state_module_evaluation\", 0);\n\n        \/\/ record all settings\n\n        return true;\n    }\n\n\n    TFDMEvalInterface::TFDMEvalInterface()\n    {\n        runs.insert(make_pair(\"lazy_eval_partial_caching\", setupRunLazyEvalPartialCaching));\n        runs.insert(make_pair(\"eager_eval_partial_caching\", setupRunEagerEvalPartialCaching));\n        defaultRun = \"lazy_eval_partial_caching\";\n    }\n\n    TFDMEvalInterface::~TFDMEvalInterface()\n    {\n    }\n\n    void TFDMEvalInterface::initialize(const std::string & domainFile, const std::vector<std::string> & options)\n    {\n        TFDMInterface::initialize(domainFile, options);\n\n        ROS_INFO(\"I am in %s\", get_current_dir_name());\/\/leak\n\n        ros::NodeHandle nhConfig(\"\/tfd_modules\/eval\");\n        if(!nhConfig.getParam(\"eval_dir\", evalOutputDir)) {\n            ROS_FATAL(\"TFDMEvalInterface: \/tfd_modules\/eval\/eval_dir was not set!\");\n            evalOutputDir = \"\/tmp\";\n        }\n\n        \/\/ add date\n        time_t rawtime;\n        struct tm* timeinfo;\n        char buffer[1024];\n\n        time(&rawtime);\n        timeinfo = localtime(&rawtime);\n\n        strftime(buffer, 1024, \"\/%Y-%m-%d_%H-%M-%S\", timeinfo);\n\n        evalOutputDir += buffer;\n        ROS_INFO(\"evalOutputDir is %s\", evalOutputDir.c_str());\n        nhConfig.setParam(\"eval_current_dir\", evalOutputDir);\n\n        int ret = mkdir(evalOutputDir.c_str(), S_IRWXU | S_IRWXG | S_IROTH | S_IXOTH);\n        if(ret != 0) {\n            ROS_FATAL(\"Failed to create evalOutputDir: %s (%d)\", evalOutputDir.c_str(), ret);\n        }\n\n        safeCopy(this->_domainFile, evalOutputDir + \"\/domain.pddl\");\n\n        callNumber = 0;\n    }\n\n    continual_planning_executive::PlannerInterface::PlannerResult TFDMEvalInterface::plan(\n            const SymbolicState & init, const SymbolicState & goal, Plan & plan)\n    {\n        if(!writeProblem(init, goal))\n            return PR_FAILURE_OTHER;\n\n        if(!setupRuns()) {\n            ROS_FATAL(\"Failed to setup runs.\");\n        }\n\n        if(!recordProblemData(init)) {\n            ROS_ERROR(\"Failed to record problem data\");\n        }\n\n        PlannerResult defaultResult = PR_FAILURE_OTHER;\n\n        for(map<string, setupRunFunction>::iterator it = runs.begin(); it != runs.end(); it++) {\n            if(!setupRun(it->first)) {\n                ROS_ERROR(\"Failed to setup run for %s\", it->first.c_str());\n                continue;\n            }\n\n            \/\/ call the run specific setup function\n            if(! (it->second()) ) {\n                ROS_ERROR(\"Failed run specific setup for %s\", it->first.c_str());\n                continue;\n            }\n\n            if(system(\"rosparam dump planner_params.yaml \/tfd_modules\") != 0) {\n                ROS_ERROR(\"Failed to dump planner_params\");\n            }\n\n            \/\/ perfrom the planner call\n            std::string planNamePrefix = \"plan\";\n            ROS_INFO(\"Performing planner call for: %s\", it->first.c_str());\n            PlannerResult result = callPlanner(this->_domainFile, _problemFileName, planNamePrefix);\n\n            if(it->first == defaultRun) {   \/\/ actually use this one for plan + result\n                std::string planName = planNamePrefix + \".best\";\n\n                defaultResult = result;\n\n                \/\/ parse plan\n                if(result == PR_SUCCESS_TIMEOUT || result == PR_SUCCESS) {\n                    std::ifstream planFile(planName.c_str());\n                    bool ok = PlanParser::parsePlan(planFile, plan);\n                    planFile.close();\n                    if(!ok) {\n                        ROS_WARN_STREAM(\"No plan generated or failure in parsing!\" << std::endl);\n                        defaultResult = PR_FAILURE_OTHER;\n                    }\n                }\n            }\n        }\n\n        return defaultResult;\n    }\n\n    continual_planning_executive::PlannerInterface::PlannerResult TFDMEvalInterface::callPlanner(const std::string & domain, const std::string & problem,\n            const std::string & planNamePrefix)\n    {\n        const bool failOnPlannerError = false;  \/\/ default: switch off\n\n        string curPlan = planNamePrefix + \".best\";\n        remove(curPlan.c_str());\n\n        \/\/ set plan name\n        ros::param::set(\"tfd_modules\/plan_name\", planNamePrefix);\n        \/\/ Determine the planner call command\n        std::stringstream plannerCmdStr;\n        plannerCmdStr << \"rosrun tfd_modules tfd_plan_log \" << domain << \" \" << problem << \" tfdsearch.out\";\n        plannerCmdStr << \" __name:=tfd_modules\";\n\n        \/\/ Later: other features for optional debugging???\n        std::string plannerCmd = plannerCmdStr.str();\n\n        ROS_INFO_STREAM(\"calling planner: \" << plannerCmd << std::endl);\n\n        \/\/ ACTUAL PLANNER CALL\n        int ret = system(plannerCmd.c_str());\n        if(ret % 256 == 0)   \/\/ for child processed -> returning exitstatus * 256\n            ret \/= 256;\n        else\n            ret %= 256;\n        ROS_INFO_STREAM(\"Planner returned: \" << ret);\n\n        bool plannerError = false;\n        bool plannerTimeout = false;\n        if(ret != 0) {\n            ROS_WARN_STREAM(\"Something in the symbolic planner failed! (Signal \" << ret << \")\\n\");\n            plannerError = true;\n            if(ret == 137) {\n                plannerTimeout = true;\n                ROS_WARN_STREAM(\"Planner timeout!\" << std::endl);\n            } else {\n                ROS_WARN_STREAM(\"Planner failure: \" << ret << std::endl);\n                if(failOnPlannerError) {\n                    ROS_FATAL(\"Aborting run\\n\");\n                    exit(1);\n                }\n            }\n        }\n\n        \/\/ check if plan.best exists for return value\n        struct stat st;\n        bool planWritten = false;\n        if(stat(curPlan.c_str(), &st) == 0) {\n            planWritten = true;\n        }\n\n        if(planWritten) {\n            if(plannerTimeout)\n                return PR_SUCCESS_TIMEOUT;\n            \/\/ FIXME: on error still return success as there is a new plan\n            return PR_SUCCESS;\n        } \n\n        if(plannerError) {\n            if(plannerTimeout)\n                return PR_FAILURE_TIMEOUT;\n            return PR_FAILURE_OTHER;\n        }\n\n        \/\/ FIXME: when completely explored and no plan, the planner returns fine (no error)\n        \/\/ so this really IS an error\n        return PR_FAILURE_UNREACHABLE;\n\n    }\n\n    continual_planning_executive::PlannerInterface::PlannerResult TFDMEvalInterface::monitor(\n            const SymbolicState & init, const SymbolicState & goal, const Plan & plan)\n    {\n        return TFDMInterface::monitor(init, goal, plan);\n    }\n\n    bool TFDMEvalInterface::setupRuns()\n    {\n        bool ok = true;\n\n        callNumber++;\n        char buf[1024];\n        sprintf(buf, \"\/call%03d\", callNumber);\n\n        callDir = evalOutputDir + buf;\n\n        \/\/ create change call dir.\n        \/\/ set and record all params, things that are the same for all runs (problem, etc.)\n        int ret = mkdir(callDir.c_str(), S_IRWXU | S_IRWXG | S_IROTH | S_IXOTH);\n        if(ret != 0) {\n            ROS_FATAL(\"Failed to create callDir: %s (%d)\", callDir.c_str(), ret);\n            ok = false;\n            return ok;\n        }\n\n        ret = chdir(callDir.c_str());\n        if(ret != 0) {\n            ROS_FATAL(\"Failed to change to callDir: %s (%d)\", callDir.c_str(), ret);\n            ok = false;\n            return ok;\n        }\n\n        return ok;\n    }\n\n    bool TFDMEvalInterface::setupRun(const string & runName)\n    {\n        bool ok = true;\n\n        \/\/ create\/change to run dir, etc.\n        int ret = chdir(callDir.c_str());\n        if(ret != 0) {\n            ROS_FATAL(\"Failed to change to callDir: %s (%d)\", callDir.c_str(), ret);\n            ok = false;\n            return ok;\n        }\n\n        ret = mkdir(runName.c_str(), S_IRWXU | S_IRWXG | S_IROTH | S_IXOTH);\n        if(ret != 0) {\n            ROS_FATAL(\"Failed to create run dir: %s (%d)\", runName.c_str(), ret);\n            ok = false;\n            return ok;\n        }\n\n        ret = chdir(runName.c_str());\n        if(ret != 0) {\n            ROS_FATAL(\"Failed to change to run dir: %s (%d)\", runName.c_str(), ret);\n            ok = false;\n            return ok;\n        }\n\n        \/\/ Clean all intermediate data (plan.1\/.best\/.times), params???, other output files from modules\n        \/\/ FIXME: done by changing to new dir.\n\n        return ok;\n    }\n\n    bool TFDMEvalInterface::recordProblemData(const SymbolicState & init)\n    {\n        bool ok = true;\n\n        ok &= safeCopy(_problemFileName, \"problem.pddl\");\n\n        \/\/ record how many objects there are per type\n        map<string, int> numObjectsMap;\n        \/\/ type -> object\n        for(SymbolicState::TypedObjectConstIterator it = init.getTypedObjects().begin();\n                it != init.getTypedObjects().end(); it++) {\n            if(numObjectsMap.find(it->first) == numObjectsMap.end()) {\n                numObjectsMap[it->first] = 1;\n            } else {\n                numObjectsMap[it->first]++;\n            }\n        }\n\n        ofstream probData(\"problem.data\");\n        ok &= probData.good();\n        for(map<string, int>::iterator it = numObjectsMap.begin(); it != numObjectsMap.end(); it++) {\n            probData << it->first << \" \" << it->second << endl;\n        }\n        probData.close();\n\n        return ok;\n    }\n\n    bool TFDMEvalInterface::safeCopy(const string & from, const string & to)\n    {\n        string cmd = \"cp \" + from + \" \" + to;\n        int ret = system(cmd.c_str());\n        if(ret != 0) {\n            ROS_ERROR(\"%s: Error %d when calling \\\"%s\\\".\", __func__, ret, cmd.c_str());\n            return false;\n        }\n        return true;\n    }\n\n};\n\n<commit_msg>fixed bug where output data was overwritten<commit_after>#include \"tfd_modules\/tfdm_eval_interface.h\"\n#include <stdio.h>\n#include <fstream>\n#include <iostream>\n#include <sstream>\n#include <sys\/stat.h>\n#include <ros\/ros.h>\n#include \"planParser.h\"\n#include \"domainParser.h\"\n#include <pluginlib\/class_list_macros.h>\n\nPLUGINLIB_DECLARE_CLASS(tfd_modules, tfdm_eval_interface,\n        tfd_modules::TFDMEvalInterface, continual_planning_executive::PlannerInterface)\n\nusing namespace std;\n\nnamespace tfd_modules\n{\n    bool setupRunLazyEvalPartialCaching()\n    {\n        \/\/ set params for module, etc.\n        ros::NodeHandle nh(\"\/tfd_modules\");\n        nh.setParam(\"run_name\", \"lazy_eval_partial_caching\");\n        nh.setParam(\"lazy_state_module_evaluation\", 1);\n\n        \/\/ record all other settings\n\n        return true;\n    }\n\n    bool setupRunEagerEvalPartialCaching()\n    {\n        \/\/ set params for module, etc.\n        ros::NodeHandle nh(\"\/tfd_modules\");\n        nh.setParam(\"run_name\", \"eager_eval_partial_caching\");\n        nh.setParam(\"lazy_state_module_evaluation\", 0);\n\n        \/\/ record all settings\n\n        return true;\n    }\n\n\n    TFDMEvalInterface::TFDMEvalInterface()\n    {\n        runs.insert(make_pair(\"lazy_eval_partial_caching\", setupRunLazyEvalPartialCaching));\n        runs.insert(make_pair(\"eager_eval_partial_caching\", setupRunEagerEvalPartialCaching));\n        defaultRun = \"lazy_eval_partial_caching\";\n    }\n\n    TFDMEvalInterface::~TFDMEvalInterface()\n    {\n    }\n\n    void TFDMEvalInterface::initialize(const std::string & domainFile, const std::vector<std::string> & options)\n    {\n        TFDMInterface::initialize(domainFile, options);\n\n        ROS_INFO(\"I am in %s\", get_current_dir_name());\/\/leak\n\n        ros::NodeHandle nhConfig(\"\/tfd_modules\/eval\");\n        if(!nhConfig.getParam(\"eval_dir\", evalOutputDir)) {\n            ROS_FATAL(\"TFDMEvalInterface: \/tfd_modules\/eval\/eval_dir was not set!\");\n            evalOutputDir = \"\/tmp\";\n        }\n\n        \/\/ add date\n        time_t rawtime;\n        struct tm* timeinfo;\n        char buffer[1024];\n\n        time(&rawtime);\n        timeinfo = localtime(&rawtime);\n\n        strftime(buffer, 1024, \"\/%Y-%m-%d_%H-%M-%S\", timeinfo);\n\n        evalOutputDir += buffer;\n        ROS_INFO(\"evalOutputDir is %s\", evalOutputDir.c_str());\n        nhConfig.setParam(\"eval_current_dir\", evalOutputDir);\n\n        int ret = mkdir(evalOutputDir.c_str(), S_IRWXU | S_IRWXG | S_IROTH | S_IXOTH);\n        if(ret != 0) {\n            ROS_FATAL(\"Failed to create evalOutputDir: %s (%d)\", evalOutputDir.c_str(), ret);\n        }\n\n        safeCopy(this->_domainFile, evalOutputDir + \"\/domain.pddl\");\n\n        callNumber = 0;\n    }\n\n    continual_planning_executive::PlannerInterface::PlannerResult TFDMEvalInterface::plan(\n            const SymbolicState & init, const SymbolicState & goal, Plan & plan)\n    {\n        if(!writeProblem(init, goal))\n            return PR_FAILURE_OTHER;\n\n        if(!setupRuns()) {\n            ROS_FATAL(\"Failed to setup runs.\");\n        }\n\n        if(!recordProblemData(init)) {\n            ROS_ERROR(\"Failed to record problem data\");\n        }\n\n        PlannerResult defaultResult = PR_FAILURE_OTHER;\n\n        for(map<string, setupRunFunction>::iterator it = runs.begin(); it != runs.end(); it++) {\n            if(!setupRun(it->first)) {\n                ROS_ERROR(\"Failed to setup run for %s\", it->first.c_str());\n                continue;\n            }\n\n            \/\/ call the run specific setup function\n            if(! (it->second()) ) {\n                ROS_ERROR(\"Failed run specific setup for %s\", it->first.c_str());\n                continue;\n            }\n\n            if(system(\"rosparam dump planner_params.yaml \/tfd_modules\") != 0) {\n                ROS_ERROR(\"Failed to dump planner_params\");\n            }\n\n            \/\/ perfrom the planner call\n            std::string planNamePrefix = \"plan\";\n            ROS_INFO(\"Performing planner call for: %s\", it->first.c_str());\n            PlannerResult result = callPlanner(this->_domainFile, _problemFileName, planNamePrefix);\n\n            if(it->first == defaultRun) {   \/\/ actually use this one for plan + result\n                std::string planName = planNamePrefix + \".best\";\n\n                defaultResult = result;\n\n                \/\/ parse plan\n                if(result == PR_SUCCESS_TIMEOUT || result == PR_SUCCESS) {\n                    std::ifstream planFile(planName.c_str());\n                    bool ok = PlanParser::parsePlan(planFile, plan);\n                    planFile.close();\n                    if(!ok) {\n                        ROS_WARN_STREAM(\"No plan generated or failure in parsing!\" << std::endl);\n                        defaultResult = PR_FAILURE_OTHER;\n                    }\n                }\n            }\n        }\n\n        \/\/ change out of the nicely set directories to prevent something (like monitoring) over-writing \n        \/\/ data in the current run dir.\n        chdir(\"\/tmp\");\n\n        return defaultResult;\n    }\n\n    continual_planning_executive::PlannerInterface::PlannerResult TFDMEvalInterface::callPlanner(const std::string & domain, const std::string & problem,\n            const std::string & planNamePrefix)\n    {\n        const bool failOnPlannerError = false;  \/\/ default: switch off\n\n        string curPlan = planNamePrefix + \".best\";\n        remove(curPlan.c_str());\n\n        \/\/ set plan name\n        ros::param::set(\"tfd_modules\/plan_name\", planNamePrefix);\n        \/\/ Determine the planner call command\n        std::stringstream plannerCmdStr;\n        plannerCmdStr << \"rosrun tfd_modules tfd_plan_log \" << domain << \" \" << problem << \" tfdsearch.out\";\n        plannerCmdStr << \" __name:=tfd_modules\";\n\n        \/\/ Later: other features for optional debugging???\n        std::string plannerCmd = plannerCmdStr.str();\n\n        ROS_INFO_STREAM(\"calling planner: \" << plannerCmd << std::endl);\n\n        \/\/ ACTUAL PLANNER CALL\n        int ret = system(plannerCmd.c_str());\n        if(ret % 256 == 0)   \/\/ for child processed -> returning exitstatus * 256\n            ret \/= 256;\n        else\n            ret %= 256;\n        ROS_INFO_STREAM(\"Planner returned: \" << ret);\n\n        bool plannerError = false;\n        bool plannerTimeout = false;\n        if(ret != 0) {\n            ROS_WARN_STREAM(\"Something in the symbolic planner failed! (Signal \" << ret << \")\\n\");\n            plannerError = true;\n            if(ret == 137) {\n                plannerTimeout = true;\n                ROS_WARN_STREAM(\"Planner timeout!\" << std::endl);\n            } else {\n                ROS_WARN_STREAM(\"Planner failure: \" << ret << std::endl);\n                if(failOnPlannerError) {\n                    ROS_FATAL(\"Aborting run\\n\");\n                    exit(1);\n                }\n            }\n        }\n\n        \/\/ check if plan.best exists for return value\n        struct stat st;\n        bool planWritten = false;\n        if(stat(curPlan.c_str(), &st) == 0) {\n            planWritten = true;\n        }\n\n        if(planWritten) {\n            if(plannerTimeout)\n                return PR_SUCCESS_TIMEOUT;\n            \/\/ FIXME: on error still return success as there is a new plan\n            return PR_SUCCESS;\n        } \n\n        if(plannerError) {\n            if(plannerTimeout)\n                return PR_FAILURE_TIMEOUT;\n            return PR_FAILURE_OTHER;\n        }\n\n        \/\/ FIXME: when completely explored and no plan, the planner returns fine (no error)\n        \/\/ so this really IS an error\n        return PR_FAILURE_UNREACHABLE;\n\n    }\n\n    continual_planning_executive::PlannerInterface::PlannerResult TFDMEvalInterface::monitor(\n            const SymbolicState & init, const SymbolicState & goal, const Plan & plan)\n    {\n        return TFDMInterface::monitor(init, goal, plan);\n    }\n\n    bool TFDMEvalInterface::setupRuns()\n    {\n        bool ok = true;\n\n        callNumber++;\n        char buf[1024];\n        sprintf(buf, \"\/call%03d\", callNumber);\n\n        callDir = evalOutputDir + buf;\n\n        \/\/ create change call dir.\n        \/\/ set and record all params, things that are the same for all runs (problem, etc.)\n        int ret = mkdir(callDir.c_str(), S_IRWXU | S_IRWXG | S_IROTH | S_IXOTH);\n        if(ret != 0) {\n            ROS_FATAL(\"Failed to create callDir: %s (%d)\", callDir.c_str(), ret);\n            ok = false;\n            return ok;\n        }\n\n        ret = chdir(callDir.c_str());\n        if(ret != 0) {\n            ROS_FATAL(\"Failed to change to callDir: %s (%d)\", callDir.c_str(), ret);\n            ok = false;\n            return ok;\n        }\n\n        return ok;\n    }\n\n    bool TFDMEvalInterface::setupRun(const string & runName)\n    {\n        bool ok = true;\n\n        \/\/ create\/change to run dir, etc.\n        int ret = chdir(callDir.c_str());\n        if(ret != 0) {\n            ROS_FATAL(\"Failed to change to callDir: %s (%d)\", callDir.c_str(), ret);\n            ok = false;\n            return ok;\n        }\n\n        ret = mkdir(runName.c_str(), S_IRWXU | S_IRWXG | S_IROTH | S_IXOTH);\n        if(ret != 0) {\n            ROS_FATAL(\"Failed to create run dir: %s (%d)\", runName.c_str(), ret);\n            ok = false;\n            return ok;\n        }\n\n        ret = chdir(runName.c_str());\n        if(ret != 0) {\n            ROS_FATAL(\"Failed to change to run dir: %s (%d)\", runName.c_str(), ret);\n            ok = false;\n            return ok;\n        }\n\n        \/\/ this should be the same for all\n        ok &= safeCopy(_problemFileName, \"problem.pddl\");\n\n        \/\/ Clean all intermediate data (plan.1\/.best\/.times), params???, other output files from modules\n        \/\/ FIXME: done by changing to new dir.\n\n        return ok;\n    }\n\n    bool TFDMEvalInterface::recordProblemData(const SymbolicState & init)\n    {\n        bool ok = true;\n\n        ok &= safeCopy(_problemFileName, \"problem.pddl\");\n\n        \/\/ record how many objects there are per type\n        map<string, int> numObjectsMap;\n        \/\/ type -> object\n        for(SymbolicState::TypedObjectConstIterator it = init.getTypedObjects().begin();\n                it != init.getTypedObjects().end(); it++) {\n            if(numObjectsMap.find(it->first) == numObjectsMap.end()) {\n                numObjectsMap[it->first] = 1;\n            } else {\n                numObjectsMap[it->first]++;\n            }\n        }\n\n        ofstream probData(\"problem.data\");\n        ok &= probData.good();\n        for(map<string, int>::iterator it = numObjectsMap.begin(); it != numObjectsMap.end(); it++) {\n            probData << it->first << \" \" << it->second << endl;\n        }\n        probData.close();\n\n        return ok;\n    }\n\n    bool TFDMEvalInterface::safeCopy(const string & from, const string & to)\n    {\n        string cmd = \"cp \" + from + \" \" + to;\n        int ret = system(cmd.c_str());\n        if(ret != 0) {\n            ROS_ERROR(\"%s: Error %d when calling \\\"%s\\\".\", __func__, ret, cmd.c_str());\n            return false;\n        }\n        return true;\n    }\n\n};\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Created by Axel Naumann on 09\/12\/15.\n\/\/\n\n#include \"cling\/Interpreter\/Interpreter.h\"\n#include \"cling\/Interpreter\/Value.h\"\n\nextern \"C\" {\n\/\/\/\\{\n\/\/\/\\name Cling4CTypes\n\/\/\/ The Python compatible view of cling\n\n\/\/\/ The Interpreter object cast to void*\nusing TheInterpreter = void ;\n\n\/\/\/ Create an interpreter object.\nTheInterpreter *cling_create(int argc, const char *argv[], const char* llvmdir) {\n  auto interp = new cling::Interpreter(argc, argv, llvmdir);\n  printf(\"Interpreter @%p\\n\", interp);\n  return interp;\n}\n\n\/\/\/ Evaluate a string of code. Returns 0 on success.\nint cling_eval(TheInterpreter *interpVP, const char *code) {\n  cling::Interpreter *interp = (cling::Interpreter *) interpVP;\n  \/\/cling::Value V;\n  cling::Interpreter::CompilationResult Res = interp->process(code \/*, V*\/);\n  if (Res != cling::Interpreter::kSuccess)\n    return 1;\n  return 0;\n}\n\/\/\/\\}\n\n} \/\/ extern \"C\"\n<commit_msg>Add destruction of Interpreter.<commit_after>\/\/\n\/\/ Created by Axel Naumann on 09\/12\/15.\n\/\/\n\n#include \"cling\/Interpreter\/Interpreter.h\"\n#include \"cling\/Interpreter\/Value.h\"\n\nextern \"C\" {\n\/\/\/\\{\n\/\/\/\\name Cling4CTypes\n\/\/\/ The Python compatible view of cling\n\n\/\/\/ The Interpreter object cast to void*\nusing TheInterpreter = void ;\n\n\/\/\/ Create an interpreter object.\nTheInterpreter *cling_create(int argc, const char *argv[], const char* llvmdir) {\n  auto interp = new cling::Interpreter(argc, argv, llvmdir);\n  printf(\"Interpreter @%p\\n\", interp);\n  return interp;\n}\n\n\n\/\/\/ Destroy the interpreter.\nvoid cling_destroy(TheInterpreter *interpVP) {\n  cling::Interpreter *interp = (cling::Interpreter *) interpVP;\n  delete interp;\n}\n\n\n\/\/\/ Evaluate a string of code. Returns 0 on success.\nint cling_eval(TheInterpreter *interpVP, const char *code) {\n  cling::Interpreter *interp = (cling::Interpreter *) interpVP;\n  \/\/cling::Value V;\n  cling::Interpreter::CompilationResult Res = interp->process(code \/*, V*\/);\n  if (Res != cling::Interpreter::kSuccess)\n    return 1;\n  return 0;\n}\n\/\/\/\\}\n\n} \/\/ extern \"C\"\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  yas_audio_device_stream.cpp\n\/\/  Copyright (c) 2015 Yuki Yasoshima.\n\/\/\n\n#include \"yas_audio_device.h\"\n\n#if (TARGET_OS_MAC && !TARGET_OS_IPHONE)\n\nusing namespace yas;\n\nusing listener_f =\n    std::function<void(const UInt32 in_number_addresses, const AudioObjectPropertyAddress *in_addresses)>;\n\n#pragma mark - property_info\n\naudio::device::stream::property_info::property_info(const stream::property property, const AudioObjectID object_id,\n                                                    const AudioObjectPropertyAddress &address)\n    : property(property), object_id(object_id), address(address)\n{\n}\n\nbool audio::device::stream::property_info::operator<(const stream::property_info &info) const\n{\n    if (property != info.property) {\n        return property < info.property;\n    }\n\n    if (object_id != info.object_id) {\n        return object_id < info.object_id;\n    }\n\n    if (address.mSelector != info.address.mSelector) {\n        return address.mSelector < info.address.mSelector;\n    }\n\n    if (address.mScope != info.address.mScope) {\n        return address.mScope < info.address.mScope;\n    }\n\n    return address.mElement < info.address.mElement;\n}\n\n#pragma mark - change_info\n\naudio::device::stream::change_info::change_info(std::vector<property_info> &&infos) : property_infos(infos)\n{\n}\n\n#pragma mark - private\n\nclass audio::device::stream::impl : public base::impl\n{\n   public:\n    AudioStreamID stream_id;\n    AudioDeviceID device_id;\n    yas::subject<change_info> subject;\n\n    impl(const AudioStreamID stream_id, const AudioDeviceID device_id)\n        : stream_id(stream_id), device_id(device_id), subject()\n    {\n    }\n\n    listener_f listener(const device::stream &stream)\n    {\n        auto weak_stream = to_weak(stream);\n\n        return [weak_stream](UInt32 address_count, const AudioObjectPropertyAddress *addresses) {\n            if (auto stream = weak_stream.lock()) {\n                const AudioStreamID object_id = stream.stream_id();\n                std::vector<property_info> infos;\n                for (UInt32 i = 0; i < address_count; i++) {\n                    if (addresses[i].mSelector == kAudioStreamPropertyVirtualFormat) {\n                        infos.push_back(property_info(stream::property::virtual_format, object_id, addresses[i]));\n                    } else if (addresses[i].mSelector == kAudioStreamPropertyIsActive) {\n                        infos.push_back(property_info(stream::property::is_active, object_id, addresses[i]));\n                    } else if (addresses[i].mSelector == kAudioStreamPropertyStartingChannel) {\n                        infos.push_back(property_info(stream::property::starting_channel, object_id, addresses[i]));\n                    }\n                }\n                change_info change_info{std::move(infos)};\n                stream.subject().notify(stream::stream_did_change_key, change_info);\n            }\n        };\n    }\n\n    void add_listener(const AudioObjectPropertySelector &selector, listener_f function)\n    {\n        const AudioObjectPropertyAddress address = {.mSelector = selector,\n                                                    .mScope = kAudioObjectPropertyScopeGlobal,\n                                                    .mElement = kAudioObjectPropertyElementMaster};\n\n        yas_raise_if_au_error(\n            AudioObjectAddPropertyListenerBlock(stream_id, &address, dispatch_get_main_queue(),\n                                                ^(UInt32 address_count, const AudioObjectPropertyAddress *addresses) {\n                                                    function(address_count, addresses);\n                                                }));\n    }\n};\n\n#pragma mark - main\n\naudio::device::stream::stream(std::nullptr_t) : super_class(nullptr)\n{\n}\n\naudio::device::stream::stream(const AudioStreamID stream_id, const AudioDeviceID device_id)\n    : super_class(std::make_shared<impl>(stream_id, device_id))\n{\n    auto imp = impl_ptr<impl>();\n    auto function = imp->listener(*this);\n    imp->add_listener(kAudioStreamPropertyVirtualFormat, function);\n    imp->add_listener(kAudioStreamPropertyIsActive, function);\n    imp->add_listener(kAudioStreamPropertyStartingChannel, function);\n}\n\naudio::device::stream::~stream() = default;\n\nbool audio::device::stream::operator==(const device::stream &rhs) const\n{\n    if (impl_ptr() && rhs.impl_ptr()) {\n        return stream_id() == rhs.stream_id();\n    }\n    return false;\n}\n\nbool audio::device::stream::operator!=(const device::stream &rhs) const\n{\n    if (impl_ptr() && rhs.impl_ptr()) {\n        return stream_id() != rhs.stream_id();\n    }\n    return true;\n}\n\nAudioStreamID audio::device::stream::stream_id() const\n{\n    return impl_ptr<impl>()->stream_id;\n}\n\naudio::device audio::device::stream::device() const\n{\n    return device::device_for_id(impl_ptr<impl>()->device_id);\n}\n\nbool audio::device::stream::is_active() const\n{\n    auto data = _property_data<UInt32>(stream_id(), kAudioStreamPropertyIsActive);\n    if (data) {\n        return *data->data() > 0;\n    }\n    return false;\n}\n\ndirection audio::device::stream::direction() const\n{\n    auto data = _property_data<UInt32>(stream_id(), kAudioStreamPropertyDirection);\n    if (data) {\n        if (*data->data() == 1) {\n            return direction::input;\n        }\n    }\n    return direction::output;\n}\n\naudio::format audio::device::stream::virtual_format() const\n{\n    auto data = _property_data<AudioStreamBasicDescription>(stream_id(), kAudioStreamPropertyVirtualFormat);\n    if (!data) {\n        throw std::runtime_error(std::string(__PRETTY_FUNCTION__) + \" : can't get virtual format.\");\n    }\n    return audio::format(*data->data());\n}\n\nUInt32 audio::device::stream::starting_channel() const\n{\n    auto data = _property_data<UInt32>(stream_id(), kAudioStreamPropertyStartingChannel);\n    if (data) {\n        return *data->data();\n    }\n    return 0;\n}\n\nyas::subject<yas::audio::device::stream::change_info> &audio::device::stream::subject() const\n{\n    return impl_ptr<impl>()->subject;\n}\n\n#endif\n<commit_msg>replace device::stream<commit_after>\/\/\n\/\/  yas_audio_device_stream.cpp\n\/\/  Copyright (c) 2015 Yuki Yasoshima.\n\/\/\n\n#include \"yas_audio_device.h\"\n\n#if (TARGET_OS_MAC && !TARGET_OS_IPHONE)\n\nusing namespace yas;\n\nusing listener_f =\n    std::function<void(const UInt32 in_number_addresses, const AudioObjectPropertyAddress *in_addresses)>;\n\n#pragma mark - property_info\n\naudio::device::stream::property_info::property_info(const stream::property property, const AudioObjectID object_id,\n                                                    const AudioObjectPropertyAddress &address)\n    : property(property), object_id(object_id), address(address)\n{\n}\n\nbool audio::device::stream::property_info::operator<(const property_info &info) const\n{\n    if (property != info.property) {\n        return property < info.property;\n    }\n\n    if (object_id != info.object_id) {\n        return object_id < info.object_id;\n    }\n\n    if (address.mSelector != info.address.mSelector) {\n        return address.mSelector < info.address.mSelector;\n    }\n\n    if (address.mScope != info.address.mScope) {\n        return address.mScope < info.address.mScope;\n    }\n\n    return address.mElement < info.address.mElement;\n}\n\n#pragma mark - change_info\n\naudio::device::stream::change_info::change_info(std::vector<property_info> &&infos) : property_infos(infos)\n{\n}\n\n#pragma mark - private\n\nclass audio::device::stream::impl : public base::impl\n{\n   public:\n    AudioStreamID stream_id;\n    AudioDeviceID device_id;\n    yas::subject<change_info> subject;\n\n    impl(const AudioStreamID stream_id, const AudioDeviceID device_id)\n        : stream_id(stream_id), device_id(device_id), subject()\n    {\n    }\n\n    listener_f listener(const stream &stream)\n    {\n        auto weak_stream = to_weak(stream);\n\n        return [weak_stream](UInt32 address_count, const AudioObjectPropertyAddress *addresses) {\n            if (auto stream = weak_stream.lock()) {\n                const AudioStreamID object_id = stream.stream_id();\n                std::vector<property_info> infos;\n                for (UInt32 i = 0; i < address_count; i++) {\n                    if (addresses[i].mSelector == kAudioStreamPropertyVirtualFormat) {\n                        infos.push_back(property_info(stream::property::virtual_format, object_id, addresses[i]));\n                    } else if (addresses[i].mSelector == kAudioStreamPropertyIsActive) {\n                        infos.push_back(property_info(stream::property::is_active, object_id, addresses[i]));\n                    } else if (addresses[i].mSelector == kAudioStreamPropertyStartingChannel) {\n                        infos.push_back(property_info(stream::property::starting_channel, object_id, addresses[i]));\n                    }\n                }\n                change_info change_info{std::move(infos)};\n                stream.subject().notify(stream::stream_did_change_key, change_info);\n            }\n        };\n    }\n\n    void add_listener(const AudioObjectPropertySelector &selector, listener_f function)\n    {\n        const AudioObjectPropertyAddress address = {.mSelector = selector,\n                                                    .mScope = kAudioObjectPropertyScopeGlobal,\n                                                    .mElement = kAudioObjectPropertyElementMaster};\n\n        yas_raise_if_au_error(\n            AudioObjectAddPropertyListenerBlock(stream_id, &address, dispatch_get_main_queue(),\n                                                ^(UInt32 address_count, const AudioObjectPropertyAddress *addresses) {\n                                                    function(address_count, addresses);\n                                                }));\n    }\n};\n\n#pragma mark - main\n\naudio::device::stream::stream(std::nullptr_t) : super_class(nullptr)\n{\n}\n\naudio::device::stream::stream(const AudioStreamID stream_id, const AudioDeviceID device_id)\n    : super_class(std::make_shared<impl>(stream_id, device_id))\n{\n    auto imp = impl_ptr<impl>();\n    auto function = imp->listener(*this);\n    imp->add_listener(kAudioStreamPropertyVirtualFormat, function);\n    imp->add_listener(kAudioStreamPropertyIsActive, function);\n    imp->add_listener(kAudioStreamPropertyStartingChannel, function);\n}\n\naudio::device::stream::~stream() = default;\n\nbool audio::device::stream::operator==(const stream &rhs) const\n{\n    if (impl_ptr() && rhs.impl_ptr()) {\n        return stream_id() == rhs.stream_id();\n    }\n    return false;\n}\n\nbool audio::device::stream::operator!=(const stream &rhs) const\n{\n    if (impl_ptr() && rhs.impl_ptr()) {\n        return stream_id() != rhs.stream_id();\n    }\n    return true;\n}\n\nAudioStreamID audio::device::stream::stream_id() const\n{\n    return impl_ptr<impl>()->stream_id;\n}\n\naudio::device audio::device::stream::device() const\n{\n    return device::device_for_id(impl_ptr<impl>()->device_id);\n}\n\nbool audio::device::stream::is_active() const\n{\n    auto data = _property_data<UInt32>(stream_id(), kAudioStreamPropertyIsActive);\n    if (data) {\n        return *data->data() > 0;\n    }\n    return false;\n}\n\ndirection audio::device::stream::direction() const\n{\n    auto data = _property_data<UInt32>(stream_id(), kAudioStreamPropertyDirection);\n    if (data) {\n        if (*data->data() == 1) {\n            return direction::input;\n        }\n    }\n    return direction::output;\n}\n\naudio::format audio::device::stream::virtual_format() const\n{\n    auto data = _property_data<AudioStreamBasicDescription>(stream_id(), kAudioStreamPropertyVirtualFormat);\n    if (!data) {\n        throw std::runtime_error(std::string(__PRETTY_FUNCTION__) + \" : can't get virtual format.\");\n    }\n    return audio::format(*data->data());\n}\n\nUInt32 audio::device::stream::starting_channel() const\n{\n    auto data = _property_data<UInt32>(stream_id(), kAudioStreamPropertyStartingChannel);\n    if (data) {\n        return *data->data();\n    }\n    return 0;\n}\n\nyas::subject<yas::audio::device::stream::change_info> &audio::device::stream::subject() const\n{\n    return impl_ptr<impl>()->subject;\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright 2022 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\/tests\/gpu_codegen_test.h\"\n#include \"tensorflow\/compiler\/xla\/tests\/hlo_test_base.h\"\n\nnamespace xla {\nnamespace gpu {\nnamespace {\n\nclass FusionLogicalIndexTest : public GpuCodegenTest {};\n\nTEST_F(FusionLogicalIndexTest, FusionLogicalIndexStore) {\n  const char* hlo_text = R\"(\nHloModule TestModule\n\nfused_computation.18 {\n  select.12 = f32[768000,16]{1,0} parameter(0)\n  select.13 = f32[768000,16]{1,0} parameter(1)\n  maximum.1 = f32[768000,16]{1,0} maximum(select.13, select.12)\n  ROOT reshape.437 = f32[1,480,400,64]{2,1,3,0} reshape(maximum.1)\n}\n\n\nENTRY entry {\n    select.12 = f32[768000,16]{1,0} parameter(0)\n    select.13 = f32[768000,16]{1,0} parameter(1)\n    ROOT fusion.18 = f32[1,480,400,64]{2,1,3,0} fusion(select.12, select.13), kind=kLoop, calls=fused_computation.18\n}\n)\";\n\n  EXPECT_TRUE(RunAndCompare(hlo_text, ErrorSpec{1e-5, 1e-5}));\n\n  CompileAndVerifyIr(hlo_text, R\"(\n; CHECK:  %[[block_id:.*]] = call i32 @llvm.nvvm.read.ptx.sreg.ctaid.x()\n; CHECK:  %[[thread_id:.*]] = call i32 @llvm.nvvm.read.ptx.sreg.tid.x()\n; CHECK:  %[[block_start_index:.*]] = mul nuw nsw i32 %[[block_id]], [[block_size:.*]]\n; CHECK:  %[[linear_index:.*]] = add nuw nsw i32 %[[block_start_index]], %[[thread_id]]\n; CHECK:  %[[index_1:.*]] = urem i32 %[[linear_index]], 64\n; CHECK:  %[[base_1:.*]] = udiv i32 %[[linear_index]], 64\n; CHECK:  %[[index_3:.*]] = urem i32 %[[base_1]], 400\n; CHECK:  %[[base_3:.*]] = udiv i32 %[[base_1]], 400\n; CHECK:  %[[index_2:.*]] = urem i32 %[[base_3]], 480\n; CHECK:  %[[pointer:.*]] = getelementptr inbounds [1 x [64 x [480 x [400 x float]]]], [1 x [64 x [480 x [400 x float]]]]* %5, i32 0, i32 0, i32 %[[index_1]], i32 %[[index_2]], i32 %[[index_3]]\n; CHECK:  store float %[[result_value:.*]], float* %[[pointer]], align 4\n)\");\n}\n\n}  \/\/ namespace\n}  \/\/ namespace gpu\n}  \/\/ namespace xla\n<commit_msg>Enhance fusion_logical_index_test to work on AMDGPU\/ROCm.<commit_after>\/* Copyright 2022 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\/tests\/gpu_codegen_test.h\"\n#include \"tensorflow\/compiler\/xla\/tests\/hlo_test_base.h\"\n\nnamespace xla {\nnamespace gpu {\nnamespace {\n\nclass FusionLogicalIndexTest : public GpuCodegenTest {};\n\nTEST_F(FusionLogicalIndexTest, FusionLogicalIndexStore) {\n  const char* hlo_text = R\"(\nHloModule TestModule\n\nfused_computation.18 {\n  select.12 = f32[768000,16]{1,0} parameter(0)\n  select.13 = f32[768000,16]{1,0} parameter(1)\n  maximum.1 = f32[768000,16]{1,0} maximum(select.13, select.12)\n  ROOT reshape.437 = f32[1,480,400,64]{2,1,3,0} reshape(maximum.1)\n}\n\n\nENTRY entry {\n    select.12 = f32[768000,16]{1,0} parameter(0)\n    select.13 = f32[768000,16]{1,0} parameter(1)\n    ROOT fusion.18 = f32[1,480,400,64]{2,1,3,0} fusion(select.12, select.13), kind=kLoop, calls=fused_computation.18\n}\n)\";\n\n  EXPECT_TRUE(RunAndCompare(hlo_text, ErrorSpec{1e-5, 1e-5}));\n\n  auto expected_ir = is_built_with_rocm_ ? R\"(\n; CHECK:  %[[block_id:.*]] = call i32 @llvm.amdgcn.workgroup.id.x(), !range !1\n; CHECK:  %[[thread_id:.*]] = call i32 @llvm.amdgcn.workitem.id.x(), !range !2\n; CHECK:  %[[block_start_index:.*]] = mul nuw nsw i32 %[[block_id]], [[block_size:.*]]\n; CHECK:  %[[linear_index:.*]] = add nuw nsw i32 %[[block_start_index]], %[[thread_id]]\n; CHECK:  %[[index_1:.*]] = urem i32 %[[linear_index]], 64\n; CHECK:  %[[base_1:.*]] = udiv i32 %[[linear_index]], 64\n; CHECK:  %[[index_3:.*]] = urem i32 %[[base_1]], 400\n; CHECK:  %[[base_3:.*]] = udiv i32 %[[base_1]], 400\n; CHECK:  %[[index_2:.*]] = urem i32 %[[base_3]], 480\n; CHECK:  %[[pointer:.*]] = getelementptr inbounds [1 x [64 x [480 x [400 x float]]]], [1 x [64 x [480 x [400 x float]]]]* %5, i32 0, i32 0, i32 %[[index_1]], i32 %[[index_2]], i32 %[[index_3]]\n; CHECK:  store float %[[result_value:.*]], float* %[[pointer]], align 4\n  )\"                                     : R\"(\n; CHECK:  %[[block_id:.*]] = call i32 @llvm.nvvm.read.ptx.sreg.ctaid.x()\n; CHECK:  %[[thread_id:.*]] = call i32 @llvm.nvvm.read.ptx.sreg.tid.x()\n; CHECK:  %[[block_start_index:.*]] = mul nuw nsw i32 %[[block_id]], [[block_size:.*]]\n; CHECK:  %[[linear_index:.*]] = add nuw nsw i32 %[[block_start_index]], %[[thread_id]]\n; CHECK:  %[[index_1:.*]] = urem i32 %[[linear_index]], 64\n; CHECK:  %[[base_1:.*]] = udiv i32 %[[linear_index]], 64\n; CHECK:  %[[index_3:.*]] = urem i32 %[[base_1]], 400\n; CHECK:  %[[base_3:.*]] = udiv i32 %[[base_1]], 400\n; CHECK:  %[[index_2:.*]] = urem i32 %[[base_3]], 480\n; CHECK:  %[[pointer:.*]] = getelementptr inbounds [1 x [64 x [480 x [400 x float]]]], [1 x [64 x [480 x [400 x float]]]]* %5, i32 0, i32 0, i32 %[[index_1]], i32 %[[index_2]], i32 %[[index_3]]\n; CHECK:  store float %[[result_value:.*]], float* %[[pointer]], align 4\n  )\";\n\n  CompileAndVerifyIr(hlo_text, expected_ir);\n}\n\n}  \/\/ namespace\n}  \/\/ namespace gpu\n}  \/\/ namespace xla\n<|endoftext|>"}
{"text":"<commit_before>\/\/ terark-db-schema-compile.cpp : Defines the entry point for the console application.\n\/\/\n\n#include \"stdafx.h\"\n\n#define TERARK_DB_SCHEMA_COMPILER\n#include <terark\/db\/db_conf.cpp>\n\n#if defined(_WIN32) || defined(_WIN64)\n#include <getopt.c>\n#endif\n\nusing namespace std;\nusing namespace terark;\nusing namespace terark::db;\n\nvoid compileOneSchema(const Schema& schema, const char* className) {\n\tconst size_t colnum = schema.columnNum();\n\tprintf(\"  struct %s {\\n\", className);\n\tfor (size_t i = 0; i < colnum; ++i) {\n\t\tconst ColumnMeta& colmeta = schema.getColumnMeta(i);\n\t\tconst fstring     colname = schema.getColumnName(i);\n\t\tswitch (colmeta.type) {\n\t\tcase ColumnType::Any:\n\t\t\tassert(0); \/\/ not supported now\n\t\t\tbreak;\n\t\tcase ColumnType::Nested:\n\t\t\tassert(0); \/\/ not supported now\n\t\t\tbreak;\n\t\tcase ColumnType::Uint08:\n\t\t\tprintf(\"    unsigned char %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Sint08:\n\t\t\tprintf(\"    signed char %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Uint16:\n\t\t\tprintf(\"    std::uint16_t %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Sint16:\n\t\t\tprintf(\"    std::int16_t %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Uint32:\n\t\t\tprintf(\"    std::uint32_t %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Sint32:\n\t\t\tprintf(\"    std::int32_t %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Uint64:\n\t\t\tprintf(\"    std::uint64_t %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Sint64:\n\t\t\tprintf(\"    std::int64_t %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Uint128:\n\t\t\tprintf(\"    unsigned __int128 %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Sint128:\n\t\t\tprintf(\"    signed __int128 %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Float32:\n\t\t\tprintf(\"    float %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Float64:\n\t\t\tprintf(\"    double %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Float128:\n\t\t\tprintf(\"    __float128 %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Decimal128:\n\t\t\tprintf(\"    __decimal128 %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Uuid:\n\t\t\tprintf(\"    terark::db::Schema::Fixed<16> %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Fixed:\n\t\t\tif (colmeta.realtype.empty()) {\n\t\t\t\tprintf(\"    terark::db::Schema::Fixed<%d> %s;\\n\", int(colmeta.fixedLen), colname.p);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tconst char* realtype = colmeta.realtype.c_str();\n\t\t\t\tconst int fixlen = int(colmeta.fixedLen);\n\t\t\t\tprintf(R\"EOS(\n    %s %s;\n \/\/ dumpable type does not require sizeof(T)==fixlen, it only requires that\n \/\/ dump_size(T)==fixlen, but check for dump_size(T)==fixlen is cumbersome\n \/\/ and requires big changes for terark.dataio\n \/\/ so we static assert sizeof(T)==fixlen here:\n    BOOST_STATIC_ASSERT(sizeof(%s) == %d);\n    BOOST_STATIC_ASSERT((terark::DataIO_is_dump<terark::NativeDataInput<terark::MemIO>, %s >::value));\n\n)EOS\", realtype, colname.p, realtype, fixlen, realtype);\n\t\t\t}\n\t\t\tbreak;\n\t\tcase ColumnType::VarSint:\n\t\t\tprintf(\"    terark::var_int64_t %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::VarUint:\n\t\t\tprintf(\"    terark::var_uint64_t %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::StrZero:\n\t\t\tprintf(\"    std::string %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::TwoStrZero:\n\t\t\tprintf(\"    terark::db::Schema::TwoStrZero %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Binary:\n\t\t\tif (colmeta.realtype.empty()) {\n\t\t\t\tprintf(\"    std::string %s;\\n\", colname.p);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tconst char* realtype = colmeta.realtype.c_str();\n\t\t\t\tprintf(\"    %s %s;\\n\", realtype, colname.p);\n\t\t\t}\n\t\t\tbreak;\n\t\tcase ColumnType::CarBin:\n\t\t\tif (colmeta.realtype.empty()) {\n\t\t\t\tprintf(\"    terark::db::Schema::CarBin %s;\\n\", colname.p);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tconst char* realtype = colmeta.realtype.c_str();\n\t\t\t\tprintf(\"    %s %s;\\n\", realtype, colname.p);\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\tprintf(\"\\n\");\n\tprintf(\"    DATA_IO_LOAD_SAVE(%s,\\n\", className);\n\tfor (size_t i = 0; i < colnum; ++i) {\n\t\tconst ColumnMeta& colmeta = schema.getColumnMeta(i);\n\t\tconst fstring     colname = schema.getColumnName(i);\n\t\tswitch (colmeta.type) {\n\t\tcase ColumnType::Any:\n\t\t\tassert(0); \/\/ not supported now\n\t\t\tbreak;\n\t\tcase ColumnType::Nested:\n\t\t\tassert(0); \/\/ not supported now\n\t\t\tbreak;\n\t\tcase ColumnType::Uint08:\n\t\tcase ColumnType::Sint08:\n\t\tcase ColumnType::Uint16:\n\t\tcase ColumnType::Sint16:\n\t\tcase ColumnType::Uint32:\n\t\tcase ColumnType::Sint32:\n\t\tcase ColumnType::Uint64:\n\t\tcase ColumnType::Sint64:\n\t\tcase ColumnType::Uint128:\n\t\tcase ColumnType::Sint128:\n\t\tcase ColumnType::Float32:\n\t\tcase ColumnType::Float64:\n\t\tcase ColumnType::Float128:\n\t\tcase ColumnType::Decimal128:\n\t\tcase ColumnType::Uuid:\n\t\tcase ColumnType::Fixed:\n\t\tcase ColumnType::VarSint:\n\t\tcase ColumnType::VarUint:\n\t\t\tprintf(\"      &%s\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::StrZero:\n\t\t\tif (i < colnum-1) {\n\t\t\t\tprintf(\"      &terark::db::Schema::StrZero(%s)\\n\", colname.p);\n\t\t\t} else {\n\t\t\t\tprintf(\"      &terark::RestAll(%s)\\n\", colname.p);\n\t\t\t}\n\t\t\tbreak;\n\t\tcase ColumnType::TwoStrZero:\n\t\tcase ColumnType::Binary:\n\t\tCase_Binary:\n\t\t\tif (i < colnum-1) {\n\t\t\t\tprintf(\"      &%s\\n\", colname.p);\n\t\t\t} else {\n\t\t\t\tprintf(\"      &terark::RestAll(%s)\\n\", colname.p);\n\t\t\t}\n\t\t\tbreak;\n\t\tcase ColumnType::CarBin:\n\t\t\tif (colmeta.realtype.empty()) {\n\t\t\t\tgoto Case_Binary;\n\t\t\t}\n\t\t\tif (i < colnum-1) {\n\t\t\t\t\/\/ read carbin size and check carbin size with real size\n\t\t\t\tprintf(\"      &terark::db::Schema::CarBinPack(%s)\\n\", colname.p);\n\t\t\t} else {\n\t\t\t\tprintf(\"      &%s\\n\", colname.p);\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\tprintf(\"    )\\n\");\n\tprintf(\nR\"EOS(\n    %s& decode(terark::fstring row) {\n      terark::NativeDataInput<terark::MemIO> dio(row.range());\n      dio >> *this;\n      return *this;\n    }\n    terark::fstring\n    encode(terark::NativeDataOutput<terark::AutoGrownMemIO>& dio) const {\n      dio.rewind();\n      dio << *this;\n      return dio.written();\n    }\n)EOS\", className\n\t);\n\tprintf(\"  }; \/\/ %s\\n\\n\", className);\n}\n\nint usage(const char* prog) {\n\tfprintf(stderr, \"usage: %s [ options ] terark-db-schema-file namespace table-name\\n\", prog);\n\treturn 1;\n}\n\nint main(int argc, char* argv[]) {\n\tstd::vector<const char*> includes;\n\tfor (;;) {\n\t\tint opt = getopt(argc, argv, \"i:\");\n\t\tswitch (opt) {\n\t\tcase -1:\n\t\t\tgoto GetoptDone;\n\t\tcase '?':\n\t\t\treturn 1;\n\t\tcase 'i':\n\t\t\tincludes.push_back(optarg);\n\t\t\tbreak;\n\t\t}\n\t}\nGetoptDone:\n\tif (argc - optind < 3) {\n\t\treturn usage(argv[0]);\n\t}\n\tconst char* jsonFilePath = argv[optind + 0];\n\tconst char* ns = argv[optind + 1];\n\tconst char* tabName = argv[optind + 2];\n\tSchemaConfig sconf;\n\ttry {\n\t\tsconf.loadJsonFile(jsonFilePath);\n\t}\n\tcatch (const std::exception& ex) {\n\t\tfprintf(stderr, \"ERROR: loadJsonFile(%s) failed: %s\\n\", jsonFilePath, ex.what());\n\t\treturn 1;\n\t}\n\tprintf(R\"EOS(#pragma once\n#include <terark\/db\/db_table.hpp>\n#include <terark\/io\/DataIO.hpp>\n#include <terark\/io\/MemStream.hpp>\n#include <terark\/io\/RangeStream.hpp>\n\n)EOS\");\n\tfor (const char* inc : includes) {\n\t\tprintf(\"#include \\\"%s\\\"\\n\", inc);\n\t}\n\tprintf(\"\\n\");\n\tprintf(\"namespace %s {\\n\", ns);\n\tcompileOneSchema(*sconf.m_rowSchema, tabName);\n\tfor (size_t i = 0; i < sconf.m_colgroupSchemaSet->indexNum(); ++i) {\n\t\tconst Schema& schema = *sconf.m_colgroupSchemaSet->getSchema(i);\n\t\tif (schema.columnNum() == 1)\n\t\t\tcontinue;\n\t\tstd::string cgName = schema.m_name;\n\t\tstd::transform(cgName.begin(), cgName.end(), cgName.begin(),\n\t\t\t[](unsigned char ch) -> char {\n\t\t\t\tif (isalnum(ch) || '_' == ch)\n\t\t\t\t\treturn ch;\n\t\t\t\telse\n\t\t\t\t\treturn '_';\n\t\t\t});\n\t\tstd::string className = tabName;\n\t\tclassName += \"_Colgroup_\";\n\t\tclassName += cgName;\n\t\tcompileOneSchema(schema, className.c_str());\n\t\tif (i < sconf.m_indexSchemaSet->indexNum()) {\n\t\t\tprintf(\"  typedef %s %s_Index_%s;\\n\\n\", className.c_str(), tabName, cgName.c_str());\n\t\t}\n\t}\n\tprintf(\"} \/\/ namespace %s\\n\", ns);\n    return 0;\n}\n\n<commit_msg>chema-compile.cpp: Add select and assign_to<commit_after>\/\/ terark-db-schema-compile.cpp : Defines the entry point for the console application.\n\/\/\n\n#include \"stdafx.h\"\n\n#define TERARK_DB_SCHEMA_COMPILER\n#include <terark\/db\/db_conf.cpp>\n\n#if defined(_WIN32) || defined(_WIN64)\n#include <getopt.c>\n#endif\n\nusing namespace std;\nusing namespace terark;\nusing namespace terark::db;\n\nint maxColnameLen(const Schema& schema) {\n\tconst size_t colnum = schema.columnNum();\n\tint maxNameLen = 0;\n\tfor (size_t i = 0; i < colnum; ++i) {\n\t\tconst fstring colname = schema.getColumnName(i);\n\t\tmaxNameLen = std::max(maxNameLen, colname.ilen());\n\t}\n\treturn maxNameLen;\n}\n\nvoid compileOneSchema(const Schema& schema, const char* className,\n\t\t\t\t\t  const char* rowClassName) {\n\tconst size_t colnum = schema.columnNum();\n\tprintf(\"  struct %s {\\n\", className);\n\tfor (size_t i = 0; i < colnum; ++i) {\n\t\tconst ColumnMeta& colmeta = schema.getColumnMeta(i);\n\t\tconst fstring     colname = schema.getColumnName(i);\n\t\tswitch (colmeta.type) {\n\t\tcase ColumnType::Any:\n\t\t\tassert(0); \/\/ not supported now\n\t\t\tbreak;\n\t\tcase ColumnType::Nested:\n\t\t\tassert(0); \/\/ not supported now\n\t\t\tbreak;\n\t\tcase ColumnType::Uint08:\n\t\t\tprintf(\"    unsigned char %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Sint08:\n\t\t\tprintf(\"    signed char %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Uint16:\n\t\t\tprintf(\"    std::uint16_t %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Sint16:\n\t\t\tprintf(\"    std::int16_t %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Uint32:\n\t\t\tprintf(\"    std::uint32_t %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Sint32:\n\t\t\tprintf(\"    std::int32_t %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Uint64:\n\t\t\tprintf(\"    std::uint64_t %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Sint64:\n\t\t\tprintf(\"    std::int64_t %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Uint128:\n\t\t\tprintf(\"    unsigned __int128 %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Sint128:\n\t\t\tprintf(\"    signed __int128 %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Float32:\n\t\t\tprintf(\"    float %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Float64:\n\t\t\tprintf(\"    double %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Float128:\n\t\t\tprintf(\"    __float128 %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Decimal128:\n\t\t\tprintf(\"    __decimal128 %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Uuid:\n\t\t\tprintf(\"    terark::db::Schema::Fixed<16> %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Fixed:\n\t\t\tif (colmeta.realtype.empty()) {\n\t\t\t\tprintf(\"    terark::db::Schema::Fixed<%d> %s;\\n\", int(colmeta.fixedLen), colname.p);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tconst char* realtype = colmeta.realtype.c_str();\n\t\t\t\tconst int fixlen = int(colmeta.fixedLen);\n\t\t\t\tprintf(R\"EOS(\n    %s %s;\n \/\/ dumpable type does not require sizeof(T)==fixlen, it only requires that\n \/\/ dump_size(T)==fixlen, but check for dump_size(T)==fixlen is cumbersome\n \/\/ and requires big changes for terark.dataio\n \/\/ so we static assert sizeof(T)==fixlen here:\n    BOOST_STATIC_ASSERT(sizeof(%s) == %d);\n    BOOST_STATIC_ASSERT((terark::DataIO_is_dump<terark::NativeDataInput<terark::MemIO>, %s >::value));\n\n)EOS\", realtype, colname.p, realtype, fixlen, realtype);\n\t\t\t}\n\t\t\tbreak;\n\t\tcase ColumnType::VarSint:\n\t\t\tprintf(\"    terark::var_int64_t %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::VarUint:\n\t\t\tprintf(\"    terark::var_uint64_t %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::StrZero:\n\t\t\tprintf(\"    std::string %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::TwoStrZero:\n\t\t\tprintf(\"    terark::db::Schema::TwoStrZero %s;\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::Binary:\n\t\t\tif (colmeta.realtype.empty()) {\n\t\t\t\tprintf(\"    std::string %s;\\n\", colname.p);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tconst char* realtype = colmeta.realtype.c_str();\n\t\t\t\tprintf(\"    %s %s;\\n\", realtype, colname.p);\n\t\t\t}\n\t\t\tbreak;\n\t\tcase ColumnType::CarBin:\n\t\t\tif (colmeta.realtype.empty()) {\n\t\t\t\tprintf(\"    terark::db::Schema::CarBin %s;\\n\", colname.p);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tconst char* realtype = colmeta.realtype.c_str();\n\t\t\t\tprintf(\"    %s %s;\\n\", realtype, colname.p);\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\tprintf(\"\\n\");\n\tprintf(\"    DATA_IO_LOAD_SAVE(%s,\\n\", className);\n\tfor (size_t i = 0; i < colnum; ++i) {\n\t\tconst ColumnMeta& colmeta = schema.getColumnMeta(i);\n\t\tconst fstring     colname = schema.getColumnName(i);\n\t\tswitch (colmeta.type) {\n\t\tcase ColumnType::Any:\n\t\t\tassert(0); \/\/ not supported now\n\t\t\tbreak;\n\t\tcase ColumnType::Nested:\n\t\t\tassert(0); \/\/ not supported now\n\t\t\tbreak;\n\t\tcase ColumnType::Uint08:\n\t\tcase ColumnType::Sint08:\n\t\tcase ColumnType::Uint16:\n\t\tcase ColumnType::Sint16:\n\t\tcase ColumnType::Uint32:\n\t\tcase ColumnType::Sint32:\n\t\tcase ColumnType::Uint64:\n\t\tcase ColumnType::Sint64:\n\t\tcase ColumnType::Uint128:\n\t\tcase ColumnType::Sint128:\n\t\tcase ColumnType::Float32:\n\t\tcase ColumnType::Float64:\n\t\tcase ColumnType::Float128:\n\t\tcase ColumnType::Decimal128:\n\t\tcase ColumnType::Uuid:\n\t\tcase ColumnType::Fixed:\n\t\tcase ColumnType::VarSint:\n\t\tcase ColumnType::VarUint:\n\t\t\tprintf(\"      &%s\\n\", colname.p);\n\t\t\tbreak;\n\t\tcase ColumnType::StrZero:\n\t\t\tif (i < colnum-1) {\n\t\t\t\tprintf(\"      &terark::db::Schema::StrZero(%s)\\n\", colname.p);\n\t\t\t} else {\n\t\t\t\tprintf(\"      &terark::RestAll(%s)\\n\", colname.p);\n\t\t\t}\n\t\t\tbreak;\n\t\tcase ColumnType::TwoStrZero:\n\t\tcase ColumnType::Binary:\n\t\tCase_Binary:\n\t\t\tif (i < colnum-1) {\n\t\t\t\tprintf(\"      &%s\\n\", colname.p);\n\t\t\t} else {\n\t\t\t\tprintf(\"      &terark::RestAll(%s)\\n\", colname.p);\n\t\t\t}\n\t\t\tbreak;\n\t\tcase ColumnType::CarBin:\n\t\t\tif (colmeta.realtype.empty()) {\n\t\t\t\tgoto Case_Binary;\n\t\t\t}\n\t\t\tif (i < colnum-1) {\n\t\t\t\t\/\/ read carbin size and check carbin size with real size\n\t\t\t\tprintf(\"      &terark::db::Schema::CarBinPack(%s)\\n\", colname.p);\n\t\t\t} else {\n\t\t\t\tprintf(\"      &%s\\n\", colname.p);\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\tprintf(\"    )\\n\");\n\tprintf(\nR\"EOS(\n    %s& decode(terark::fstring ___row) {\n      terark::NativeDataInput<terark::MemIO> ___dio(___row.range());\n      ___dio >> *this;\n      return *this;\n    }\n    terark::fstring\n    encode(terark::NativeDataOutput<terark::AutoGrownMemIO>& ___dio) const {\n      ___dio.rewind();\n      ___dio << *this;\n      return ___dio.written();\n    }\n)EOS\", className\n\t);\n\tint maxNameLen = maxColnameLen(schema);\n\tprintf(\"    %s& select(const %s& ___row) {\\n\", className, rowClassName);\n\tfor (size_t i = 0; i < colnum; ++i) {\n\t\tconst char* colname = schema.getColumnName(i).c_str();\n\t\tprintf(\"      %-*s = ___row.%s;\\n\", maxNameLen, colname, colname);\n\t}\n\tprintf(\"      return *this;\\n\"); \/\/ select\n\tprintf(\"    }\\n\"); \/\/ select\n\tprintf(\"    void assign_to(%s& ___row) const {\\n\", rowClassName);\n\tfor (size_t i = 0; i < colnum; ++i) {\n\t\tconst char* colname = schema.getColumnName(i).c_str();\n\t\tprintf(\"      ___row.%-*s = %s;\\n\", maxNameLen, colname, colname);\n\t}\n\tprintf(\"    }\\n\"); \/\/ select\n\n\tprintf(\"  }; \/\/ %s\\n\\n\", className);\n}\n\nint usage(const char* prog) {\n\tfprintf(stderr, \"usage: %s [ options ] terark-db-schema-file namespace table-name\\n\", prog);\n\treturn 1;\n}\n\nint main(int argc, char* argv[]) {\n\tstd::vector<const char*> includes;\n\tfor (;;) {\n\t\tint opt = getopt(argc, argv, \"i:\");\n\t\tswitch (opt) {\n\t\tcase -1:\n\t\t\tgoto GetoptDone;\n\t\tcase '?':\n\t\t\treturn usage(argv[0]);\n\t\tcase 'i':\n\t\t\tincludes.push_back(optarg);\n\t\t\tbreak;\n\t\t}\n\t}\nGetoptDone:\n\tif (argc - optind < 3) {\n\t\treturn usage(argv[0]);\n\t}\n\tconst char* jsonFilePath = argv[optind + 0];\n\tconst char* ns = argv[optind + 1];\n\tconst char* tabName = argv[optind + 2];\n\tSchemaConfig sconf;\n\ttry {\n\t\tsconf.loadJsonFile(jsonFilePath);\n\t}\n\tcatch (const std::exception& ex) {\n\t\tfprintf(stderr, \"ERROR: loadJsonFile(%s) failed: %s\\n\", jsonFilePath, ex.what());\n\t\treturn 1;\n\t}\n\tprintf(R\"EOS(#pragma once\n#include <terark\/db\/db_table.hpp>\n#include <terark\/io\/DataIO.hpp>\n#include <terark\/io\/MemStream.hpp>\n#include <terark\/io\/RangeStream.hpp>\n#include <boost\/static_assert.hpp>\n\n)EOS\");\n\tfor (const char* inc : includes) {\n\t\tprintf(\"#include \\\"%s\\\"\\n\", inc);\n\t}\n\tprintf(\"\\n\");\n\tprintf(\"namespace %s {\\n\", ns);\n\tcompileOneSchema(*sconf.m_rowSchema, tabName, tabName);\n\tfor (size_t i = 0; i < sconf.m_colgroupSchemaSet->indexNum(); ++i) {\n\t\tconst Schema& schema = *sconf.m_colgroupSchemaSet->getSchema(i);\n\t\tif (schema.columnNum() == 1)\n\t\t\tcontinue;\n\t\tstd::string cgName = schema.m_name;\n\t\tstd::transform(cgName.begin(), cgName.end(), cgName.begin(),\n\t\t\t[](unsigned char ch) -> char {\n\t\t\t\tif (isalnum(ch) || '_' == ch)\n\t\t\t\t\treturn ch;\n\t\t\t\telse\n\t\t\t\t\treturn '_';\n\t\t\t});\n\t\tstd::string className = tabName;\n\t\tclassName += \"_Colgroup_\";\n\t\tclassName += cgName;\n\t\tcompileOneSchema(schema, className.c_str(), tabName);\n\t\tif (i < sconf.m_indexSchemaSet->indexNum()) {\n\t\t\tprintf(\"  typedef %s %s_Index_%s;\\n\\n\", className.c_str(), tabName, cgName.c_str());\n\t\t}\n\t}\n\tprintf(\"} \/\/ namespace %s\\n\", ns);\n    return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/ \\file ROOT\/TPad.hxx\n\/\/\/ \\ingroup Gpad ROOT7\n\/\/\/ \\author Axel Naumann <axel@cern.ch>\n\/\/\/ \\date 2017-07-06\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-2017, 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 ROOT7_TPad\n#define ROOT7_TPad\n\n#include <memory>\n#include <vector>\n\n#include \"ROOT\/TDrawable.hxx\"\n#include \"ROOT\/TDrawingAttr.hxx\"\n#include \"ROOT\/TDrawingOptsBase.hxx\"\n#include \"ROOT\/TFrame.hxx\"\n#include \"ROOT\/TPadExtent.hxx\"\n#include \"ROOT\/TPadPos.hxx\"\n#include \"ROOT\/TPadUserAxis.hxx\"\n#include \"ROOT\/TypeTraits.hxx\"\n\nnamespace ROOT {\nnamespace Experimental {\n\nclass TPad;\nclass TCanvas;\n\n\/** \\class ROOT::Experimental::TPadBase\n  Base class for graphic containers for `TDrawable`-s.\n  *\/\n\nclass TPadBase {\npublic:\n   using Primitives_t = std::vector<std::shared_ptr<TDrawable>>;\n\nprivate:\n   \/\/\/ Content of the pad.\n   Primitives_t fPrimitives;\n\n   \/\/\/ TFrame with user coordinate system, if used by this pad.\n   std::unique_ptr<TFrame> fFrame;\n\n   \/\/\/ Disable copy construction.\n   TPadBase(const TPadBase &) = delete;\n\n   \/\/\/ Disable assignment.\n   TPadBase &operator=(const TPadBase &) = delete;\n\n   void AssignUniqueID(std::shared_ptr<TDrawable> &ptr);\n\n   \/\/\/ Adds a `DRAWABLE` to `fPrimitives`, returning a `shared_ptr` to `DRAWABLE::GetOptions()`.\n   template <class DRAWABLE>\n   auto AddDrawable(std::shared_ptr<DRAWABLE> &&uPtr)\n   {\n      fPrimitives.emplace_back(std::move(uPtr));\n\n      AssignUniqueID(fPrimitives.back());\n\n      using Options_t = typename std::remove_reference<decltype(uPtr->GetOptions())>::type;\n      auto spDrawable = std::static_pointer_cast<DRAWABLE>(fPrimitives.back());\n      \/\/ Return a shared_ptr to the GetOptions() sub-object of the drawable inserted into fPrimitives,\n      \/\/ where the entry in fPrimitives defines the lifetime.\n      return std::shared_ptr<Options_t>(spDrawable, &spDrawable->GetOptions());\n   }\n\nprotected:\n   \/\/\/ Allow derived classes to default construct a TPadBase.\n   TPadBase() = default;\n\npublic:\n   virtual ~TPadBase();\n\n   \/\/\/ Divide this pad into a grid of subpads with padding in between.\n   \/\/\/ \\param nHoriz Number of horizontal pads.\n   \/\/\/ \\param nVert Number of vertical pads.\n   \/\/\/ \\param padding Padding between pads.\n   \/\/\/ \\returns vector of vector (ret[x][y]) of created pads.\n   std::vector<std::vector<TPad *>> Divide(int nHoriz, int nVert, const TPadExtent &padding = {});\n\n   \/\/\/ Add something to be painted.\n   \/\/\/ The pad observes what's lifetime through a weak pointer.\n   \/\/\/ Drawing options will be constructed through `args`, which can be empty for default-constructed options.\n   template <class T, class... ARGS>\n   auto Draw(const std::shared_ptr<T> &what, ARGS... args)\n   {\n      \/\/ Requires GetDrawable(what) to be known!\n      return AddDrawable(GetDrawable(what, args...));\n   }\n\n   \/\/\/ Add something to be painted. The pad claims ownership.\n   \/\/\/ Drawing options will be constructed through `args`, which can be empty for default-constructed options.\n   template <class T, class... ARGS>\n   auto Draw(std::unique_ptr<T> &&what, ARGS... args)\n   {\n      \/\/ Requires GetDrawable(what) to be known!\n      return AddDrawable(GetDrawable(std::move(what), args...));\n   }\n\n   \/\/\/ Add a copy of something to be painted.\n   \/\/\/ Drawing options will be constructed through `args`, which can be empty for default-constructed options.\n   template <class T, class... ARGS, class = typename std::enable_if<!ROOT::TypeTraits::IsSmartOrDumbPtr<T>::value>::type>\n   auto Draw(const T &what, ARGS... args)\n   {\n      \/\/ Requires GetDrawable(what) to be known!\n      return Draw(std::make_unique<T>(what), args...);\n   }\n\n   \/\/\/ Remove an object from the list of primitives.\n   bool Remove(TDrawingOptsBase& opts) {\n      auto iter = std::find_if(fPrimitives.begin(), fPrimitives.end(),\n         [&opts](const std::shared_ptr<TDrawable>& drawable) { return &drawable->GetOptionsBase() == &opts; });\n      if (iter == fPrimitives.end())\n         return false;\n      iter->reset();\n      return true;\n   }\n\n   std::shared_ptr<TDrawable> FindDrawable(const std::string &id) const;\n\n   \/\/\/ Wipe the pad by clearing the list of primitives.\n   void Wipe()\n   {\n      fPrimitives.clear();\n   }\n\n   void CreateFrameIfNeeded();\n\n   const TFrame *GetFrame() const { return fFrame.get(); }\n\n   TPadUserAxisBase* GetAxis(size_t dimension) const;\n   TPadUserAxisBase* GetExistingAxis(size_t dimension) const;\n\n   void SetAxisBounds(int dimension, double begin, double end);\n   void SetAxisBound(int dimension, TPadUserAxisBase::EAxisBoundsKind boundsKind, double bound);\n   void SetAxisAutoBounds(int dimension);\n\n   void SetAllAxisBounds(const std::vector<std::array<double, 2>> &vecBeginAndEnd);\n\n   \/\/\/ Simple struct representing an axis bound.\n   struct BoundKindAndValue {\n      TPadUserAxisBase::EAxisBoundsKind fKind;\n      double fBound;\n   };\n   void SetAllAxisBound(const std::vector<BoundKindAndValue> &vecBoundAndKind);\n   void SetAllAxisAutoBounds();\n\n   \/\/\/ Get the elements contained in the canvas.\n   const Primitives_t &GetPrimitives() const { return fPrimitives; }\n\n   \/\/\/ Convert a `Pixel` position to Canvas-normalized positions.\n   virtual std::array<TPadLength::Normal, 2> PixelsToNormal(const std::array<TPadLength::Pixel, 2> &pos) const = 0;\n\n   \/\/\/ Access to the top-most canvas, if any (const version).\n   virtual const TCanvas *GetCanvas() const = 0;\n\n   \/\/\/ Access to the top-most canvas, if any (non-const version).\n   virtual TCanvas *GetCanvas() = 0;\n\n   \/\/\/ Convert user coordinates to normal coordinates.\n   std::array<TPadLength::Normal, 2> UserToNormal(const std::array<TPadLength::User, 2> &pos) const\n   {\n      return fFrame->UserToNormal(pos);\n   }\n};\n\nclass TPadDrawable;\n\n\/** \\class ROOT::Experimental::TPad\n  Graphic container for `TDrawable`-s.\n  *\/\n\nclass TPad: public TPadBase {\nprivate:\n   \/\/\/ Pad containing this pad as a sub-pad.\n   TPadBase *fParent = nullptr; \/\/\/ The parent pad, if this pad has one.\n\n   \/\/\/ Size of the pad in the parent's (!) coordinate system.\n   TPadExtent fSize = {1._normal, 1._normal}; \/\/ {640_px, 400_px};\n\npublic:\n   friend std::unique_ptr<TPadDrawable> GetDrawable(std::unique_ptr<TPad> &&pad);\n\n   \/\/\/ Create a topmost, non-paintable pad.\n   TPad() = default;\n\n   \/\/\/ Create a child pad.\n   TPad(TPadBase &parent, const TPadExtent &size): fParent(&parent), fSize(size) {}\n\n   \/\/\/ Destructor to have a vtable.\n   virtual ~TPad();\n\n   \/\/\/ Access to the parent pad (const version).\n   const TPadBase *GetParent() const { return fParent; }\n\n   \/\/\/ Access to the parent pad (non-const version).\n   TPadBase *GetParent() { return fParent; }\n\n   \/\/\/ Access to the top-most canvas (const version).\n   const TCanvas *GetCanvas() const override { return fParent ? fParent->GetCanvas() : nullptr; }\n\n   \/\/\/ Access to the top-most canvas (non-const version).\n   TCanvas *GetCanvas() override { return fParent ? fParent->GetCanvas() : nullptr; }\n\n   \/\/\/ Get the size of the pad in parent (!) coordinates.\n   const TPadExtent &GetSize() const { return fSize; }\n\n   \/\/\/ Convert a `Pixel` position to Canvas-normalized positions.\n   std::array<TPadLength::Normal, 2> PixelsToNormal(const std::array<TPadLength::Pixel, 2> &pos) const override\n   {\n      std::array<TPadLength::Normal, 2> posInParentNormal = fParent->PixelsToNormal(pos);\n      std::array<TPadLength::Normal, 2> myPixelInNormal =\n         fParent->PixelsToNormal({{fSize.fHoriz.fPixel, fSize.fVert.fPixel}});\n      std::array<TPadLength::Normal, 2> myUserInNormal =\n         fParent->UserToNormal({{fSize.fHoriz.fUser, fSize.fVert.fUser}});\n      \/\/ If the parent says pos is at 0.6 in normal coords, and our size converted to normal is 0.2, then pos in our\n      \/\/ coord system is 3.0!\n      return {{posInParentNormal[0] \/ (fSize.fHoriz.fNormal + myPixelInNormal[0] + myUserInNormal[0]),\n               posInParentNormal[1] \/ (fSize.fVert.fNormal + myPixelInNormal[1] + myUserInNormal[1])}};\n   }\n\n   \/\/\/ Convert a TPadPos to [x, y] of normalized coordinates.\n   std::array<TPadLength::Normal, 2> ToNormal(const Internal::TPadHorizVert &pos) const\n   {\n      std::array<TPadLength::Normal, 2> pixelsInNormal = PixelsToNormal({{pos.fHoriz.fPixel, pos.fVert.fPixel}});\n      std::array<TPadLength::Normal, 2> userInNormal = UserToNormal({{pos.fHoriz.fUser, pos.fVert.fUser}});\n      return {{pos.fHoriz.fNormal + pixelsInNormal[0] + userInNormal[0],\n               pos.fVert.fNormal + pixelsInNormal[1] + userInNormal[1]}};\n   }\n};\n\n\/** \\class TPadDrawingOpts\n Drawing options for a TPad\n *\/\n\nclass TPadDrawingOpts: public TDrawingOptsBase {\n   TDrawingAttr<TPadPos> fPos{*this, \"PadOffset\"}; \/\/\/< Offset with respect to parent TPad.\n\npublic:\n   TPadDrawingOpts() = default;\n\n   \/\/\/ Construct the drawing options.\n   TPadDrawingOpts(const TPadPos& pos): fPos(*this, \"PadOffset\", pos) {}\n\n   \/\/\/ Set the position of this pad with respect to the parent pad.\n   TPadDrawingOpts &At(const TPadPos &pos)\n   {\n      fPos = pos;\n      return *this;\n   }\n\n   TDrawingAttr<TPadPos> &GetOffset() { return fPos; }\n   const TDrawingAttr<TPadPos> &GetOffset() const { return fPos; }\n};\n\n\/** \\class TPadDrawable\n   Draw a TPad, by drawing its contained graphical elements at the pad offset in the parent pad.'\n   *\/\nclass TPadDrawable: public TDrawableBase<TPadDrawable> {\nprivate:\n   const std::shared_ptr<TPad> fPad; \/\/\/< The pad to be painted\n   TPadDrawingOpts fOpts;            \/\/\/< The drawing options.\n\npublic:\n   \/\/\/ Move a sub-pad into this (i.e. parent's) list of drawables.\n   TPadDrawable(std::shared_ptr<TPad> pPad, const TPadDrawingOpts& opts = {});\n\n   \/\/\/ Paint primitives from the pad.\n   void Paint(Internal::TPadPainter &) final;\n\n   TPad *Get() const { return fPad.get(); }\n\n   \/\/\/ Drawing options.\n   TPadDrawingOpts &GetOptions() { return fOpts; }\n};\n\ntemplate <class... ARGS>\ninline std::shared_ptr<TPadDrawable> GetDrawable(std::unique_ptr<TPad> &&pad, ARGS... args)\n{\n   return std::make_shared<TPadDrawable>(std::move(pad), TPadDrawingOpts(args...));\n}\n\ntemplate <class... ARGS>\ninline std::shared_ptr<TPadDrawable> GetDrawable(const std::shared_ptr<TPad> &pad, ARGS... args)\n{\n   return std::make_shared<TPadDrawable>(pad, TPadDrawingOpts(args...));\n}\n\n} \/\/ namespace Experimental\n} \/\/ namespace ROOT\n\n#endif\n<commit_msg>Initialize BoundKindAndValue members.<commit_after>\/\/\/ \\file ROOT\/TPad.hxx\n\/\/\/ \\ingroup Gpad ROOT7\n\/\/\/ \\author Axel Naumann <axel@cern.ch>\n\/\/\/ \\date 2017-07-06\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-2017, 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 ROOT7_TPad\n#define ROOT7_TPad\n\n#include <memory>\n#include <vector>\n\n#include \"ROOT\/TDrawable.hxx\"\n#include \"ROOT\/TDrawingAttr.hxx\"\n#include \"ROOT\/TDrawingOptsBase.hxx\"\n#include \"ROOT\/TFrame.hxx\"\n#include \"ROOT\/TPadExtent.hxx\"\n#include \"ROOT\/TPadPos.hxx\"\n#include \"ROOT\/TPadUserAxis.hxx\"\n#include \"ROOT\/TypeTraits.hxx\"\n\nnamespace ROOT {\nnamespace Experimental {\n\nclass TPad;\nclass TCanvas;\n\n\/** \\class ROOT::Experimental::TPadBase\n  Base class for graphic containers for `TDrawable`-s.\n  *\/\n\nclass TPadBase {\npublic:\n   using Primitives_t = std::vector<std::shared_ptr<TDrawable>>;\n\nprivate:\n   \/\/\/ Content of the pad.\n   Primitives_t fPrimitives;\n\n   \/\/\/ TFrame with user coordinate system, if used by this pad.\n   std::unique_ptr<TFrame> fFrame;\n\n   \/\/\/ Disable copy construction.\n   TPadBase(const TPadBase &) = delete;\n\n   \/\/\/ Disable assignment.\n   TPadBase &operator=(const TPadBase &) = delete;\n\n   void AssignUniqueID(std::shared_ptr<TDrawable> &ptr);\n\n   \/\/\/ Adds a `DRAWABLE` to `fPrimitives`, returning a `shared_ptr` to `DRAWABLE::GetOptions()`.\n   template <class DRAWABLE>\n   auto AddDrawable(std::shared_ptr<DRAWABLE> &&uPtr)\n   {\n      fPrimitives.emplace_back(std::move(uPtr));\n\n      AssignUniqueID(fPrimitives.back());\n\n      using Options_t = typename std::remove_reference<decltype(uPtr->GetOptions())>::type;\n      auto spDrawable = std::static_pointer_cast<DRAWABLE>(fPrimitives.back());\n      \/\/ Return a shared_ptr to the GetOptions() sub-object of the drawable inserted into fPrimitives,\n      \/\/ where the entry in fPrimitives defines the lifetime.\n      return std::shared_ptr<Options_t>(spDrawable, &spDrawable->GetOptions());\n   }\n\nprotected:\n   \/\/\/ Allow derived classes to default construct a TPadBase.\n   TPadBase() = default;\n\npublic:\n   virtual ~TPadBase();\n\n   \/\/\/ Divide this pad into a grid of subpads with padding in between.\n   \/\/\/ \\param nHoriz Number of horizontal pads.\n   \/\/\/ \\param nVert Number of vertical pads.\n   \/\/\/ \\param padding Padding between pads.\n   \/\/\/ \\returns vector of vector (ret[x][y]) of created pads.\n   std::vector<std::vector<TPad *>> Divide(int nHoriz, int nVert, const TPadExtent &padding = {});\n\n   \/\/\/ Add something to be painted.\n   \/\/\/ The pad observes what's lifetime through a weak pointer.\n   \/\/\/ Drawing options will be constructed through `args`, which can be empty for default-constructed options.\n   template <class T, class... ARGS>\n   auto Draw(const std::shared_ptr<T> &what, ARGS... args)\n   {\n      \/\/ Requires GetDrawable(what) to be known!\n      return AddDrawable(GetDrawable(what, args...));\n   }\n\n   \/\/\/ Add something to be painted. The pad claims ownership.\n   \/\/\/ Drawing options will be constructed through `args`, which can be empty for default-constructed options.\n   template <class T, class... ARGS>\n   auto Draw(std::unique_ptr<T> &&what, ARGS... args)\n   {\n      \/\/ Requires GetDrawable(what) to be known!\n      return AddDrawable(GetDrawable(std::move(what), args...));\n   }\n\n   \/\/\/ Add a copy of something to be painted.\n   \/\/\/ Drawing options will be constructed through `args`, which can be empty for default-constructed options.\n   template <class T, class... ARGS, class = typename std::enable_if<!ROOT::TypeTraits::IsSmartOrDumbPtr<T>::value>::type>\n   auto Draw(const T &what, ARGS... args)\n   {\n      \/\/ Requires GetDrawable(what) to be known!\n      return Draw(std::make_unique<T>(what), args...);\n   }\n\n   \/\/\/ Remove an object from the list of primitives.\n   bool Remove(TDrawingOptsBase& opts) {\n      auto iter = std::find_if(fPrimitives.begin(), fPrimitives.end(),\n         [&opts](const std::shared_ptr<TDrawable>& drawable) { return &drawable->GetOptionsBase() == &opts; });\n      if (iter == fPrimitives.end())\n         return false;\n      iter->reset();\n      return true;\n   }\n\n   std::shared_ptr<TDrawable> FindDrawable(const std::string &id) const;\n\n   \/\/\/ Wipe the pad by clearing the list of primitives.\n   void Wipe()\n   {\n      fPrimitives.clear();\n   }\n\n   void CreateFrameIfNeeded();\n\n   const TFrame *GetFrame() const { return fFrame.get(); }\n\n   TPadUserAxisBase* GetAxis(size_t dimension) const;\n   TPadUserAxisBase* GetExistingAxis(size_t dimension) const;\n\n   void SetAxisBounds(int dimension, double begin, double end);\n   void SetAxisBound(int dimension, TPadUserAxisBase::EAxisBoundsKind boundsKind, double bound);\n   void SetAxisAutoBounds(int dimension);\n\n   void SetAllAxisBounds(const std::vector<std::array<double, 2>> &vecBeginAndEnd);\n\n   \/\/\/ Simple struct representing an axis bound.\n   struct BoundKindAndValue {\n      TPadUserAxisBase::EAxisBoundsKind fKind = TPadUserAxisBase::kAxisBoundsAuto;\n      double fBound = 0.;\n   };\n   void SetAllAxisBound(const std::vector<BoundKindAndValue> &vecBoundAndKind);\n   void SetAllAxisAutoBounds();\n\n   \/\/\/ Get the elements contained in the canvas.\n   const Primitives_t &GetPrimitives() const { return fPrimitives; }\n\n   \/\/\/ Convert a `Pixel` position to Canvas-normalized positions.\n   virtual std::array<TPadLength::Normal, 2> PixelsToNormal(const std::array<TPadLength::Pixel, 2> &pos) const = 0;\n\n   \/\/\/ Access to the top-most canvas, if any (const version).\n   virtual const TCanvas *GetCanvas() const = 0;\n\n   \/\/\/ Access to the top-most canvas, if any (non-const version).\n   virtual TCanvas *GetCanvas() = 0;\n\n   \/\/\/ Convert user coordinates to normal coordinates.\n   std::array<TPadLength::Normal, 2> UserToNormal(const std::array<TPadLength::User, 2> &pos) const\n   {\n      return fFrame->UserToNormal(pos);\n   }\n};\n\nclass TPadDrawable;\n\n\/** \\class ROOT::Experimental::TPad\n  Graphic container for `TDrawable`-s.\n  *\/\n\nclass TPad: public TPadBase {\nprivate:\n   \/\/\/ Pad containing this pad as a sub-pad.\n   TPadBase *fParent = nullptr; \/\/\/ The parent pad, if this pad has one.\n\n   \/\/\/ Size of the pad in the parent's (!) coordinate system.\n   TPadExtent fSize = {1._normal, 1._normal}; \/\/ {640_px, 400_px};\n\npublic:\n   friend std::unique_ptr<TPadDrawable> GetDrawable(std::unique_ptr<TPad> &&pad);\n\n   \/\/\/ Create a topmost, non-paintable pad.\n   TPad() = default;\n\n   \/\/\/ Create a child pad.\n   TPad(TPadBase &parent, const TPadExtent &size): fParent(&parent), fSize(size) {}\n\n   \/\/\/ Destructor to have a vtable.\n   virtual ~TPad();\n\n   \/\/\/ Access to the parent pad (const version).\n   const TPadBase *GetParent() const { return fParent; }\n\n   \/\/\/ Access to the parent pad (non-const version).\n   TPadBase *GetParent() { return fParent; }\n\n   \/\/\/ Access to the top-most canvas (const version).\n   const TCanvas *GetCanvas() const override { return fParent ? fParent->GetCanvas() : nullptr; }\n\n   \/\/\/ Access to the top-most canvas (non-const version).\n   TCanvas *GetCanvas() override { return fParent ? fParent->GetCanvas() : nullptr; }\n\n   \/\/\/ Get the size of the pad in parent (!) coordinates.\n   const TPadExtent &GetSize() const { return fSize; }\n\n   \/\/\/ Convert a `Pixel` position to Canvas-normalized positions.\n   std::array<TPadLength::Normal, 2> PixelsToNormal(const std::array<TPadLength::Pixel, 2> &pos) const override\n   {\n      std::array<TPadLength::Normal, 2> posInParentNormal = fParent->PixelsToNormal(pos);\n      std::array<TPadLength::Normal, 2> myPixelInNormal =\n         fParent->PixelsToNormal({{fSize.fHoriz.fPixel, fSize.fVert.fPixel}});\n      std::array<TPadLength::Normal, 2> myUserInNormal =\n         fParent->UserToNormal({{fSize.fHoriz.fUser, fSize.fVert.fUser}});\n      \/\/ If the parent says pos is at 0.6 in normal coords, and our size converted to normal is 0.2, then pos in our\n      \/\/ coord system is 3.0!\n      return {{posInParentNormal[0] \/ (fSize.fHoriz.fNormal + myPixelInNormal[0] + myUserInNormal[0]),\n               posInParentNormal[1] \/ (fSize.fVert.fNormal + myPixelInNormal[1] + myUserInNormal[1])}};\n   }\n\n   \/\/\/ Convert a TPadPos to [x, y] of normalized coordinates.\n   std::array<TPadLength::Normal, 2> ToNormal(const Internal::TPadHorizVert &pos) const\n   {\n      std::array<TPadLength::Normal, 2> pixelsInNormal = PixelsToNormal({{pos.fHoriz.fPixel, pos.fVert.fPixel}});\n      std::array<TPadLength::Normal, 2> userInNormal = UserToNormal({{pos.fHoriz.fUser, pos.fVert.fUser}});\n      return {{pos.fHoriz.fNormal + pixelsInNormal[0] + userInNormal[0],\n               pos.fVert.fNormal + pixelsInNormal[1] + userInNormal[1]}};\n   }\n};\n\n\/** \\class TPadDrawingOpts\n Drawing options for a TPad\n *\/\n\nclass TPadDrawingOpts: public TDrawingOptsBase {\n   TDrawingAttr<TPadPos> fPos{*this, \"PadOffset\"}; \/\/\/< Offset with respect to parent TPad.\n\npublic:\n   TPadDrawingOpts() = default;\n\n   \/\/\/ Construct the drawing options.\n   TPadDrawingOpts(const TPadPos& pos): fPos(*this, \"PadOffset\", pos) {}\n\n   \/\/\/ Set the position of this pad with respect to the parent pad.\n   TPadDrawingOpts &At(const TPadPos &pos)\n   {\n      fPos = pos;\n      return *this;\n   }\n\n   TDrawingAttr<TPadPos> &GetOffset() { return fPos; }\n   const TDrawingAttr<TPadPos> &GetOffset() const { return fPos; }\n};\n\n\/** \\class TPadDrawable\n   Draw a TPad, by drawing its contained graphical elements at the pad offset in the parent pad.'\n   *\/\nclass TPadDrawable: public TDrawableBase<TPadDrawable> {\nprivate:\n   const std::shared_ptr<TPad> fPad; \/\/\/< The pad to be painted\n   TPadDrawingOpts fOpts;            \/\/\/< The drawing options.\n\npublic:\n   \/\/\/ Move a sub-pad into this (i.e. parent's) list of drawables.\n   TPadDrawable(std::shared_ptr<TPad> pPad, const TPadDrawingOpts& opts = {});\n\n   \/\/\/ Paint primitives from the pad.\n   void Paint(Internal::TPadPainter &) final;\n\n   TPad *Get() const { return fPad.get(); }\n\n   \/\/\/ Drawing options.\n   TPadDrawingOpts &GetOptions() { return fOpts; }\n};\n\ntemplate <class... ARGS>\ninline std::shared_ptr<TPadDrawable> GetDrawable(std::unique_ptr<TPad> &&pad, ARGS... args)\n{\n   return std::make_shared<TPadDrawable>(std::move(pad), TPadDrawingOpts(args...));\n}\n\ntemplate <class... ARGS>\ninline std::shared_ptr<TPadDrawable> GetDrawable(const std::shared_ptr<TPad> &pad, ARGS... args)\n{\n   return std::make_shared<TPadDrawable>(pad, TPadDrawingOpts(args...));\n}\n\n} \/\/ namespace Experimental\n} \/\/ namespace ROOT\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\/\/=====================================================================\/\/\n\/*!\t@file\n\t@brief\tRX600 グループ・ポート・レジスター定義 @n\n\t\t\tCopyright 2016 Kunihito Hiramatsu\n\t@author\t平松邦仁 (hira@rvf-rc45.net)\n*\/\n\/\/=====================================================================\/\/\n#include \"common\/io_utils.hpp\"\n\nnamespace device {\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  ポート定義基底クラス（PDR, PODR, PIDR, PMR, ODR0, ODR1, PCR, DSCR）\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <uint32_t base>\n\tstruct port_t {\n\n\t\tstatic const uint32_t base_address_ = base;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  PDR レジスタ\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstatic basic_rw_t<rw8_t<base + 0x00> > PDR;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  PODR レジスタ\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstatic basic_rw_t<rw8_t<base + 0x20> > PODR;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  PIDR\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstatic basic_ro_t<rw8_t<base + 0x40> > PIDR;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  PMR レジスタ\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstatic basic_rw_t<rw8_t<base + 0x60> > PMR;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  ODR0 レジスタ\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\ttypedef rw8_t<base + 0x80>  odr0_io;\n\t\tstruct odr0_t : public odr0_io {\n\t\t\tusing odr0_io::operator =;\n\t\t\tusing odr0_io::operator ();\n\t\t\tusing odr0_io::operator |=;\n\t\t\tusing odr0_io::operator &=;\n\n\t\t\tbit_rw_t<odr0_io, bitpos::B0> B0;\n\t\t\tbit_rw_t<odr0_io, bitpos::B2> B2;\n\t\t\tbit_rw_t<odr0_io, bitpos::B3> B3;\n\t\t\tbit_rw_t<odr0_io, bitpos::B4> B4;\n\t\t\tbit_rw_t<odr0_io, bitpos::B6> B6;\n\t\t};\n\t\tstatic odr0_t ODR0;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  ODR1 レジスタ\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\ttypedef rw8_t<base + 0x81>  odr1_io;\n\t\tstruct odr1_t : public odr1_io {\n\t\t\tusing odr1_io::operator =;\n\t\t\tusing odr1_io::operator ();\n\t\t\tusing odr1_io::operator |=;\n\t\t\tusing odr1_io::operator &=;\n\n\t\t\tbit_rw_t<odr1_io, bitpos::B0> B0;\n\t\t\tbit_rw_t<odr1_io, bitpos::B2> B2;\n\t\t\tbit_rw_t<odr1_io, bitpos::B4> B4;\n\t\t\tbit_rw_t<odr1_io, bitpos::B6> B6;\n\t\t};\n\t\tstatic odr1_t ODR1;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  PCR レジスタ\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstatic basic_rw_t<rw8_t<base + 0xC0> > PCR;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  DSCR レジスタ\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstatic basic_rw_t<rw8_t<base + 0xE0> > DSCR;\n\n\t};\n\n\ttypedef port_t<0x0008C000> PORT0;\n\ttypedef port_t<0x0008C001> PORT1;\n\ttypedef port_t<0x0008C002> PORT2;\n\ttypedef port_t<0x0008C003> PORT3;\n\ttypedef port_t<0x0008C004> PORT4;\n\ttypedef port_t<0x0008C005> PORT5;\n\ttypedef port_t<0x0008C006> PORT6;\n\ttypedef port_t<0x0008C007> PORT7;\n\ttypedef port_t<0x0008C008> PORT8;\n\ttypedef port_t<0x0008C009> PORT9;\n\ttypedef port_t<0x0008C00a> PORTA;\n\ttypedef port_t<0x0008C00b> PORTB;\n\ttypedef port_t<0x0008C00d> PORTD;\n\ttypedef port_t<0x0008C00e> PORTE;\n\ttypedef port_t<0x0008C00f> PORTF;\n\ttypedef port_t<0x0008C010> PORTG;\n\ttypedef port_t<0x0008C012> PORTJ;\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  単ポート定義テンプレート\n\t\t@param[in]\tPORTx\tポート・クラス\n\t\t@param[in]\tbpos\tビット位置\t\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class PORTx, bitpos bpos>\n\tstruct PORT {\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  方向・レジスタ\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstatic bit_rw_t<rw8_t<PORTx::base_address_ + 0x00>, bpos> DIR;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  ポート・レジスタ\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstatic bit_rw_t<rw8_t<PORTx::base_address_ + 0x20>, bpos> P;\n\n\t};\n}\n<commit_msg>fix port input\/output<commit_after>#pragma once\n\/\/=====================================================================\/\/\n\/*!\t@file\n\t@brief\tRX600 グループ・ポート・レジスター定義 @n\n\t\t\tCopyright 2016 Kunihito Hiramatsu\n\t@author\t平松邦仁 (hira@rvf-rc45.net)\n*\/\n\/\/=====================================================================\/\/\n#include \"common\/io_utils.hpp\"\n\nnamespace device {\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  ポート定義基底クラス（PDR, PODR, PIDR, PMR, ODR0, ODR1, PCR, DSCR）\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <uint32_t base>\n\tstruct port_t {\n\n\t\tstatic const uint32_t base_address_ = base;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  ポート方向レジスタ（PDR）\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstatic basic_rw_t<rw8_t<base + 0x00> > PDR;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  ポート出力データレジスタ（PODR）\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstatic basic_rw_t<rw8_t<base + 0x20> > PODR;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  ポート入力データレジスタ（PIDR）\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstatic basic_ro_t<ro8_t<base + 0x40> > PIDR;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  ポートモードレジスタ（PMR）\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstatic basic_rw_t<rw8_t<base + 0x60> > PMR;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  オープンドレイン制御レジスタ 0（ODR0）\n\t\t\t@param[in]\tofs\tオフセット\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\ttemplate <uint32_t ofs>\n\t\tstruct odr0_t : public rw8_t<ofs> {\n\t\t\ttypedef rw8_t<ofs>  io_;\n\t\t\tusing io_::operator =;\n\t\t\tusing io_::operator ();\n\t\t\tusing io_::operator |=;\n\t\t\tusing io_::operator &=;\n\n\t\t\tbit_rw_t<io_, bitpos::B0> B0;\n\t\t\tbit_rw_t<io_, bitpos::B2> B2;\n\t\t\tbit_rw_t<io_, bitpos::B3> B3;\n\t\t\tbit_rw_t<io_, bitpos::B4> B4;\n\t\t\tbit_rw_t<io_, bitpos::B6> B6;\n\t\t};\n\t\tstatic odr0_t<base + 0x80> ODR0;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  オープンドレイン制御レジスタ 1（ODR1）\n\t\t\t@param[in]\tofs\tオフセット\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\ttemplate <uint32_t ofs>\n\t\tstruct odr1_t : public rw8_t<ofs> {\n\t\t\ttypedef rw8_t<ofs>  io_;\n\t\t\tusing io_::operator =;\n\t\t\tusing io_::operator ();\n\t\t\tusing io_::operator |=;\n\t\t\tusing io_::operator &=;\n\n\t\t\tbit_rw_t<io_, bitpos::B0> B0;\n\t\t\tbit_rw_t<io_, bitpos::B2> B2;\n\t\t\tbit_rw_t<io_, bitpos::B4> B4;\n\t\t\tbit_rw_t<io_, bitpos::B6> B6;\n\t\t};\n\t\tstatic odr1_t<base + 0x81> ODR1;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  プルアップ制御レジスタ（PCR）\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstatic basic_rw_t<rw8_t<base + 0xC0> > PCR;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  駆動能力制御レジスタ（DSCR）\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstatic basic_rw_t<rw8_t<base + 0xE0> > DSCR;\n\n\t};\n\n\ttypedef port_t<0x0008C000> PORT0;\n\ttypedef port_t<0x0008C001> PORT1;\n\ttypedef port_t<0x0008C002> PORT2;\n\ttypedef port_t<0x0008C003> PORT3;\n\ttypedef port_t<0x0008C004> PORT4;\n\ttypedef port_t<0x0008C005> PORT5;\n\ttypedef port_t<0x0008C006> PORT6;\n\ttypedef port_t<0x0008C007> PORT7;\n\ttypedef port_t<0x0008C008> PORT8;\n\ttypedef port_t<0x0008C009> PORT9;\n\ttypedef port_t<0x0008C00a> PORTA;\n\ttypedef port_t<0x0008C00b> PORTB;\n\ttypedef port_t<0x0008C00d> PORTD;\n\ttypedef port_t<0x0008C00e> PORTE;\n\ttypedef port_t<0x0008C00f> PORTF;\n\ttypedef port_t<0x0008C010> PORTG;\n\ttypedef port_t<0x0008C012> PORTJ;\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  単ポート定義テンプレート\n\t\t@param[in]\tPORTx\tポート・クラス\n\t\t@param[in]\tbpos\tビット位置\t\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class PORTx, bitpos bpos>\n\tstruct PORT {\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  ポート方向レジスタ\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstatic bit_rw_t<rw8_t<PORTx::base_address_ + 0x00>, bpos> DIR;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  プルアップ制御・レジスタ\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstatic bit_rw_t<rw8_t<PORTx::base_address_ + 0xC0>, bpos> PU;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief  ポート・レジスタ @n\n\t\t\t\t\t※ポート出力と、ポート入力が異なる\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstruct port_t {\n\t\t\tstatic bit_rw_t<rw8_t<PORTx::base_address_ + 0x20>, bpos> PO;  \/\/ ポート出力用\n\t\t\tstatic bit_ro_t<ro8_t<PORTx::base_address_ + 0x40>, bpos> PI;  \/\/ ポート入力用\n\n\t\t\tvoid operator = (bool val) { PO = val; }\n\t\t\tbool operator () () { return PI(); }\n\t\t};\n\t\tstatic port_t P;\n\n\t};\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 \"Deflater.h\"\n\n#include <stdio.h>\n#include <assert.h>\n\n#ifdef HAVE_STRING_H\n#include <string.h>\n#endif\n#ifdef HAVE_STRINGS_H\n#include <strings.h>\n#endif\n\n#include <decaf\/internal\/util\/zip\/zlib.h>\n\n#include <decaf\/lang\/exceptions\/RuntimeException.h>\n\nusing namespace decaf;\nusing namespace decaf::lang;\nusing namespace decaf::lang::exceptions;\nusing namespace decaf::util;\nusing namespace decaf::util::zip;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nnamespace decaf{\nnamespace util{\nnamespace zip{\n\n    class DeflaterData {\n    public:\n\n        int level;\n        bool nowrap;\n        int strategy;\n        int flush;\n        bool finished;\n        bool ended;\n\n        unsigned char* inputBuffer;\n        std::size_t inRead;\n        std::size_t inLength;\n\n        z_stream* stream;\n\n    public:\n\n        static void initZLibDeflate( DeflaterData* handle, int level, bool nowrap = false ) {\n\n            if( handle == NULL ) {\n                throw NullPointerException(\n                    __FILE__, __LINE__, \"Error While initializing the Compression Library.\" );\n            }\n\n            handle->stream = new z_stream;\n            handle->ended = false;\n            handle->level = level;\n            handle->strategy = 0;\n            handle->nowrap = nowrap;\n            handle->finished = false;\n            handle->flush = Z_NO_FLUSH;\n\n            \/\/ Init the ZLib stream to defaults\n            handle->stream->zalloc = Z_NULL;\n            handle->stream->zfree = Z_NULL;\n            handle->stream->opaque = Z_NULL;\n            handle->stream->avail_in = 0;\n            handle->stream->next_in = Z_NULL;\n\n            int result = Z_OK;\n            if( nowrap == false ) {\n                result = deflateInit( handle->stream, handle->level );\n            } else {\n\n                \/\/ Turn off ZLib header wrapping and encode raw.  Attempts\n                \/\/ to set all other values to their normal defaults.\n                result = deflateInit2( handle->stream,\n                                       handle->level,\n                                       Z_DEFLATED,\n                                       -15, 8,\n                                       Z_DEFAULT_STRATEGY );\n            }\n\n            if( result != Z_OK ) {\n                throw RuntimeException(\n                    __FILE__, __LINE__, \"Error While initializing the Compression Library.\" );\n            }\n        }\n\n        static void finishZlibDeflate( DeflaterData* handle ) {\n\n            if( handle == NULL ) {\n                throw NullPointerException(\n                    __FILE__, __LINE__, \"Error While initializing the Compression Library.\" );\n            }\n\n            handle->ended = true;\n\n            if( handle->stream != NULL ) {\n\n                \/\/ Shutdown the ZLib stream\n                deflateEnd( handle->stream );\n                delete handle->stream;\n                handle->stream = NULL;\n            }\n        }\n\n        static void resetZlibStream( DeflaterData* handle ) {\n\n            if( handle == NULL ) {\n                throw NullPointerException(\n                    __FILE__, __LINE__, \"Error While initializing the Compression Library.\" );\n            }\n\n            if( handle->stream != NULL ) {\n\n                handle->finished = false;\n                handle->flush = Z_NO_FLUSH;\n                handle->ended = false;\n                handle->flush = Z_NO_FLUSH;\n\n                \/\/ Ask ZLib to do the reset.\n                deflateReset( handle->stream );\n\n                \/\/ Clear any old data that might still be around.\n                handle->stream->opaque = Z_NULL;\n                handle->stream->avail_in = 0;\n                handle->stream->next_in = Z_NULL;\n            }\n        }\n\n    };\n\n}}}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nconst int Deflater::BEST_COMPRESSION = 9;\nconst int Deflater::BEST_SPEED = 1;\nconst int Deflater::NO_COMPRESSION = 0;\nconst int Deflater::DEFAULT_COMPRESSION = -1;\n\nconst int Deflater::DEFAULT_STRATEGY = 0;\nconst int Deflater::DEFLATED = 0;\nconst int Deflater::FILTERED = 1;\nconst int Deflater::HUFFMAN_ONLY = 2;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nDeflater::Deflater( int level, bool nowrap ) {\n\n    if( level < DEFAULT_COMPRESSION || level > BEST_COMPRESSION ) {\n        throw IllegalArgumentException(\n            __FILE__, __LINE__, \"Compression level passed was Invalid: %d\", level );\n    }\n\n    this->data = new DeflaterData();\n\n    \/\/ Initialize all the ZLib structures.\n    DeflaterData::initZLibDeflate( this->data, level, nowrap );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nDeflater::Deflater() {\n\n    this->data = new DeflaterData();\n\n    \/\/ Initialize all the ZLib structures.\n    DeflaterData::initZLibDeflate( this->data, DEFAULT_COMPRESSION );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nDeflater::~Deflater() {\n    try{\n        this->end();\n        delete this->data;\n    }\n    DECAF_CATCH_NOTHROW( Exception )\n    DECAF_CATCHALL_NOTHROW()\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid Deflater::setInput( const unsigned char* buffer, std::size_t size, std::size_t offset, std::size_t length )\n    throw( decaf::lang::exceptions::NullPointerException,\n           decaf::lang::exceptions::IndexOutOfBoundsException,\n           decaf::lang::exceptions::IllegalStateException ) {\n\n    try{\n\n        if( buffer == NULL ) {\n            throw NullPointerException(\n                __FILE__, __LINE__, \"Buffer passed cannot be NULL.\" );\n        }\n\n        if( this->data->stream == NULL ) {\n            throw IllegalStateException(\n                __FILE__, __LINE__, \"The Deflator has already been ended.\" );\n        }\n\n        if( offset + length > size ) {\n            throw IndexOutOfBoundsException(\n                __FILE__, __LINE__, \"Given offset + length greater than the size of the buffer.\" );\n        }\n\n\n        \/\/ We can only change the level and strategy once an entire block of data is compressed.\n        if( this->data->stream->next_in == NULL ) {\n            deflateParams( this->data->stream, this->data->level, this->data->strategy );\n        }\n\n        this->data->stream->avail_in = length;\n        this->data->stream->next_in = (Bytef*)( buffer + offset );\n    }\n    DECAF_CATCH_RETHROW( NullPointerException )\n    DECAF_CATCH_RETHROW( IllegalStateException )\n    DECAF_CATCH_RETHROW( IndexOutOfBoundsException )\n    DECAF_CATCHALL_THROW( IllegalStateException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid Deflater::setInput( const std::vector<unsigned char>& buffer, std::size_t offset, std::size_t length )\n    throw( decaf::lang::exceptions::IndexOutOfBoundsException,\n           decaf::lang::exceptions::IllegalStateException ) {\n\n    this->setInput( &buffer[0], buffer.size(), offset, length );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid Deflater::setInput( const std::vector<unsigned char>& buffer )\n    throw( decaf::lang::exceptions::IllegalStateException ) {\n\n    if( buffer.empty() ) {\n        return;\n    }\n\n    this->setInput( &buffer[0], buffer.size(), 0, buffer.size() );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid Deflater::setDictionary( const unsigned char* buffer, std::size_t size, std::size_t offset, std::size_t length )\n    throw( decaf::lang::exceptions::NullPointerException,\n           decaf::lang::exceptions::IndexOutOfBoundsException,\n           decaf::lang::exceptions::IllegalStateException ) {\n\n    try{\n\n        if( buffer == NULL ) {\n            throw NullPointerException(\n                __FILE__, __LINE__, \"Buffer passed cannot be NULL.\" );\n        }\n\n        if( this->data->stream == NULL ) {\n            throw IllegalStateException(\n                __FILE__, __LINE__, \"The Deflator has already been ended.\" );\n        }\n\n        if( offset + length > size ) {\n            throw IndexOutOfBoundsException(\n                __FILE__, __LINE__, \"Given offset + length greater than the size of the buffer.\" );\n        }\n\n        \/\/ From the ZLib documentation.\n        \/\/ deflateSetDictionary returns Z_OK if success, or Z_STREAM_ERROR if a parameter is invalid\n        \/\/ (such as NULL dictionary) or the stream state is inconsistent (for example if deflate has\n        \/\/ already been called for this stream or if the compression method is bsort).\n        \/\/ deflateSetDictionary does not perform any compression: this will be done by deflate().\n        if( deflateSetDictionary( this->data->stream, buffer + offset, length ) != Z_OK ) {\n            throw IllegalStateException(\n                __FILE__, __LINE__, \"Deflator could not accept the dictionary.\" );\n        }\n    }\n    DECAF_CATCH_RETHROW( NullPointerException )\n    DECAF_CATCH_RETHROW( IllegalStateException )\n    DECAF_CATCH_RETHROW( IndexOutOfBoundsException )\n    DECAF_CATCHALL_THROW( IllegalStateException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid Deflater::setDictionary( const std::vector<unsigned char>& buffer, std::size_t offset, std::size_t length )\n    throw( decaf::lang::exceptions::IndexOutOfBoundsException,\n           decaf::lang::exceptions::IllegalStateException ) {\n\n    this->setDictionary( &buffer[0], buffer.size(), offset, length );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid Deflater::setDictionary( const std::vector<unsigned char>& buffer )\n    throw( decaf::lang::exceptions::IllegalStateException ) {\n\n    if( buffer.empty() ) {\n        return;\n    }\n\n    this->setDictionary( &buffer[0], buffer.size(), 0, buffer.size() );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid Deflater::setStrategy( int strategy )\n    throw( decaf::lang::exceptions::IllegalArgumentException,\n           decaf::lang::exceptions::IllegalStateException ) {\n\n    if( strategy < DEFAULT_STRATEGY || strategy > HUFFMAN_ONLY ) {\n        throw IllegalArgumentException(\n            __FILE__, __LINE__, \"Strategy value {%d} is not valid.\", strategy );\n    }\n\n    if( this->data->stream == NULL && !this->data->ended ) {\n        throw IllegalStateException(\n            __FILE__, __LINE__, \"The Deflator is in an invalid state.\" );\n    }\n\n    this->data->strategy = strategy;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid Deflater::setLevel( int level )\n    throw( decaf::lang::exceptions::IllegalArgumentException,\n           decaf::lang::exceptions::IllegalStateException ) {\n\n    if( level < DEFAULT_COMPRESSION || level > BEST_COMPRESSION ) {\n        throw IllegalArgumentException(\n            __FILE__, __LINE__, \"Strategy value {%d} is not valid.\", level );\n    }\n\n    if( this->data->stream == NULL && !this->data->ended ) {\n        throw IllegalStateException(\n            __FILE__, __LINE__, \"The Deflator is in an invalid state.\" );\n    }\n\n    this->data->level = level;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool Deflater::needsInput() const {\n    if( this->data->stream == NULL ) {\n        return false;\n    }\n\n    return this->data->stream->avail_in == 0;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid Deflater::finish() {\n    this->data->flush = Z_FINISH;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool Deflater::finished() const {\n    return this->data->finished;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstd::size_t Deflater::deflate( unsigned char* buffer, std::size_t size, std::size_t offset, std::size_t length )\n    throw( decaf::lang::exceptions::NullPointerException,\n           decaf::lang::exceptions::IndexOutOfBoundsException,\n           decaf::lang::exceptions::IllegalStateException ) {\n\n    try{\n\n        if( buffer == NULL ) {\n            throw NullPointerException(\n                __FILE__, __LINE__, \"Buffer passed cannot be NULL.\" );\n        }\n\n        if( this->data->stream == NULL ) {\n            throw IllegalStateException(\n                __FILE__, __LINE__, \"The Deflator has already been ended.\" );\n        }\n\n        if( offset + length > size ) {\n            throw IndexOutOfBoundsException(\n                __FILE__, __LINE__, \"Given offset + length greater than the size of the buffer.\" );\n        }\n\n        std::size_t outStart = this->data->stream->total_out;\n\n        this->data->stream->next_out = buffer + offset;\n        this->data->stream->avail_out = length;\n\n        \/\/ Call ZLib and then process the resulting data to figure out what happened.\n        int result = ::deflate( this->data->stream, this->data->flush );\n\n        if( result == Z_STREAM_END ) {\n            this->data->finished = true;\n        }\n\n        return this->data->stream->total_out - outStart;\n    }\n    DECAF_CATCH_RETHROW( NullPointerException )\n    DECAF_CATCH_RETHROW( IllegalStateException )\n    DECAF_CATCH_RETHROW( IndexOutOfBoundsException )\n    DECAF_CATCHALL_THROW( IllegalStateException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstd::size_t Deflater::deflate( std::vector<unsigned char>& buffer, std::size_t offset, std::size_t length )\n    throw( decaf::lang::exceptions::IndexOutOfBoundsException,\n           decaf::lang::exceptions::IllegalStateException ) {\n\n    return this->deflate( &buffer[0], buffer.size(), offset, length );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstd::size_t Deflater::deflate( std::vector<unsigned char>& buffer )\n    throw( decaf::lang::exceptions::IllegalStateException ){\n\n    return this->deflate( &buffer[0], buffer.size(), 0, buffer.size() );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstd::size_t Deflater::getAdler() const throw( decaf::lang::exceptions::IllegalStateException ) {\n    if( this->data->stream == NULL ) {\n        throw IllegalStateException(\n            __FILE__, __LINE__, \"The Deflator has already been ended.\" );\n    }\n\n    return this->data->stream->adler;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nlong long Deflater::getBytesRead() const throw( decaf::lang::exceptions::IllegalStateException ) {\n    if( this->data->stream == NULL ) {\n        throw IllegalStateException(\n            __FILE__, __LINE__, \"The Deflator has already been ended.\" );\n    }\n\n    return this->data->stream->total_in;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nlong long Deflater::getBytesWritten() const throw( decaf::lang::exceptions::IllegalStateException ) {\n    if( this->data->stream == NULL ) {\n        throw IllegalStateException(\n            __FILE__, __LINE__, \"The Deflator has already been ended.\" );\n    }\n\n    return this->data->stream->total_out;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid Deflater::reset() throw( decaf::lang::exceptions::IllegalStateException ) {\n\n    if( this->data->stream == NULL ) {\n        throw IllegalStateException(\n            __FILE__, __LINE__, \"The Deflator has already been ended.\" );\n    }\n\n    DeflaterData::resetZlibStream( this->data );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid Deflater::end() {\n\n    if( this->data ) {\n        DeflaterData::finishZlibDeflate( this->data );\n    }\n}\n<commit_msg>https:\/\/issues.apache.org\/activemq\/browse\/AMQCPP-287<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 \"Deflater.h\"\n\n#include <stdio.h>\n#include <assert.h>\n\n#ifdef HAVE_STRING_H\n#include <string.h>\n#endif\n#ifdef HAVE_STRINGS_H\n#include <strings.h>\n#endif\n\n#include <decaf\/internal\/util\/zip\/zlib.h>\n\n#include <decaf\/lang\/exceptions\/RuntimeException.h>\n\nusing namespace decaf;\nusing namespace decaf::lang;\nusing namespace decaf::lang::exceptions;\nusing namespace decaf::util;\nusing namespace decaf::util::zip;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nnamespace decaf{\nnamespace util{\nnamespace zip{\n\n    class DeflaterData {\n    public:\n\n        int level;\n        bool nowrap;\n        int strategy;\n        int flush;\n        bool finished;\n        bool ended;\n\n        z_stream* stream;\n\n    public:\n\n        static void initZLibDeflate( DeflaterData* handle, int level, bool nowrap = false ) {\n\n            if( handle == NULL ) {\n                throw NullPointerException(\n                    __FILE__, __LINE__, \"Error While initializing the Compression Library.\" );\n            }\n\n            handle->stream = new z_stream;\n            handle->ended = false;\n            handle->level = level;\n            handle->strategy = 0;\n            handle->nowrap = nowrap;\n            handle->finished = false;\n            handle->flush = Z_NO_FLUSH;\n\n            \/\/ Init the ZLib stream to defaults\n            handle->stream->zalloc = Z_NULL;\n            handle->stream->zfree = Z_NULL;\n            handle->stream->opaque = Z_NULL;\n            handle->stream->avail_in = 0;\n            handle->stream->next_in = Z_NULL;\n\n            int result = Z_OK;\n            if( nowrap == false ) {\n                result = deflateInit( handle->stream, handle->level );\n            } else {\n\n                \/\/ Turn off ZLib header wrapping and encode raw.  Attempts\n                \/\/ to set all other values to their normal defaults.\n                result = deflateInit2( handle->stream,\n                                       handle->level,\n                                       Z_DEFLATED,\n                                       -15, 8,\n                                       Z_DEFAULT_STRATEGY );\n            }\n\n            if( result != Z_OK ) {\n                throw RuntimeException(\n                    __FILE__, __LINE__, \"Error While initializing the Compression Library.\" );\n            }\n        }\n\n        static void finishZlibDeflate( DeflaterData* handle ) {\n\n            if( handle == NULL ) {\n                throw NullPointerException(\n                    __FILE__, __LINE__, \"Error While initializing the Compression Library.\" );\n            }\n\n            handle->ended = true;\n\n            if( handle->stream != NULL ) {\n\n                \/\/ Shutdown the ZLib stream\n                deflateEnd( handle->stream );\n                delete handle->stream;\n                handle->stream = NULL;\n            }\n        }\n\n        static void resetZlibStream( DeflaterData* handle ) {\n\n            if( handle == NULL ) {\n                throw NullPointerException(\n                    __FILE__, __LINE__, \"Error While initializing the Compression Library.\" );\n            }\n\n            if( handle->stream != NULL ) {\n\n                handle->finished = false;\n                handle->flush = Z_NO_FLUSH;\n                handle->ended = false;\n\n                \/\/ Ask ZLib to do the reset.\n                deflateReset( handle->stream );\n\n                \/\/ Clear any old data that might still be around.\n                handle->stream->opaque = Z_NULL;\n                handle->stream->avail_in = 0;\n                handle->stream->next_in = Z_NULL;\n            }\n        }\n\n    };\n\n}}}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nconst int Deflater::BEST_COMPRESSION = 9;\nconst int Deflater::BEST_SPEED = 1;\nconst int Deflater::NO_COMPRESSION = 0;\nconst int Deflater::DEFAULT_COMPRESSION = -1;\n\nconst int Deflater::DEFAULT_STRATEGY = 0;\nconst int Deflater::DEFLATED = 0;\nconst int Deflater::FILTERED = 1;\nconst int Deflater::HUFFMAN_ONLY = 2;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nDeflater::Deflater( int level, bool nowrap ) {\n\n    if( level < DEFAULT_COMPRESSION || level > BEST_COMPRESSION ) {\n        throw IllegalArgumentException(\n            __FILE__, __LINE__, \"Compression level passed was Invalid: %d\", level );\n    }\n\n    this->data = new DeflaterData();\n\n    \/\/ Initialize all the ZLib structures.\n    DeflaterData::initZLibDeflate( this->data, level, nowrap );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nDeflater::Deflater() {\n\n    this->data = new DeflaterData();\n\n    \/\/ Initialize all the ZLib structures.\n    DeflaterData::initZLibDeflate( this->data, DEFAULT_COMPRESSION );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nDeflater::~Deflater() {\n    try{\n        this->end();\n        delete this->data;\n    }\n    DECAF_CATCH_NOTHROW( Exception )\n    DECAF_CATCHALL_NOTHROW()\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid Deflater::setInput( const unsigned char* buffer, std::size_t size, std::size_t offset, std::size_t length )\n    throw( decaf::lang::exceptions::NullPointerException,\n           decaf::lang::exceptions::IndexOutOfBoundsException,\n           decaf::lang::exceptions::IllegalStateException ) {\n\n    try{\n\n        if( buffer == NULL ) {\n            throw NullPointerException(\n                __FILE__, __LINE__, \"Buffer passed cannot be NULL.\" );\n        }\n\n        if( this->data->stream == NULL ) {\n            throw IllegalStateException(\n                __FILE__, __LINE__, \"The Deflator has already been ended.\" );\n        }\n\n        if( offset + length > size ) {\n            throw IndexOutOfBoundsException(\n                __FILE__, __LINE__, \"Given offset + length greater than the size of the buffer.\" );\n        }\n\n\n        \/\/ We can only change the level and strategy once an entire block of data is compressed.\n        if( this->data->stream->next_in == NULL ) {\n            deflateParams( this->data->stream, this->data->level, this->data->strategy );\n        }\n\n        this->data->stream->avail_in = length;\n        this->data->stream->next_in = (Bytef*)( buffer + offset );\n    }\n    DECAF_CATCH_RETHROW( NullPointerException )\n    DECAF_CATCH_RETHROW( IllegalStateException )\n    DECAF_CATCH_RETHROW( IndexOutOfBoundsException )\n    DECAF_CATCHALL_THROW( IllegalStateException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid Deflater::setInput( const std::vector<unsigned char>& buffer, std::size_t offset, std::size_t length )\n    throw( decaf::lang::exceptions::IndexOutOfBoundsException,\n           decaf::lang::exceptions::IllegalStateException ) {\n\n    this->setInput( &buffer[0], buffer.size(), offset, length );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid Deflater::setInput( const std::vector<unsigned char>& buffer )\n    throw( decaf::lang::exceptions::IllegalStateException ) {\n\n    if( buffer.empty() ) {\n        return;\n    }\n\n    this->setInput( &buffer[0], buffer.size(), 0, buffer.size() );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid Deflater::setDictionary( const unsigned char* buffer, std::size_t size, std::size_t offset, std::size_t length )\n    throw( decaf::lang::exceptions::NullPointerException,\n           decaf::lang::exceptions::IndexOutOfBoundsException,\n           decaf::lang::exceptions::IllegalStateException ) {\n\n    try{\n\n        if( buffer == NULL ) {\n            throw NullPointerException(\n                __FILE__, __LINE__, \"Buffer passed cannot be NULL.\" );\n        }\n\n        if( this->data->stream == NULL ) {\n            throw IllegalStateException(\n                __FILE__, __LINE__, \"The Deflator has already been ended.\" );\n        }\n\n        if( offset + length > size ) {\n            throw IndexOutOfBoundsException(\n                __FILE__, __LINE__, \"Given offset + length greater than the size of the buffer.\" );\n        }\n\n        \/\/ From the ZLib documentation.\n        \/\/ deflateSetDictionary returns Z_OK if success, or Z_STREAM_ERROR if a parameter is invalid\n        \/\/ (such as NULL dictionary) or the stream state is inconsistent (for example if deflate has\n        \/\/ already been called for this stream or if the compression method is bsort).\n        \/\/ deflateSetDictionary does not perform any compression: this will be done by deflate().\n        if( deflateSetDictionary( this->data->stream, buffer + offset, length ) != Z_OK ) {\n            throw IllegalStateException(\n                __FILE__, __LINE__, \"Deflator could not accept the dictionary.\" );\n        }\n    }\n    DECAF_CATCH_RETHROW( NullPointerException )\n    DECAF_CATCH_RETHROW( IllegalStateException )\n    DECAF_CATCH_RETHROW( IndexOutOfBoundsException )\n    DECAF_CATCHALL_THROW( IllegalStateException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid Deflater::setDictionary( const std::vector<unsigned char>& buffer, std::size_t offset, std::size_t length )\n    throw( decaf::lang::exceptions::IndexOutOfBoundsException,\n           decaf::lang::exceptions::IllegalStateException ) {\n\n    this->setDictionary( &buffer[0], buffer.size(), offset, length );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid Deflater::setDictionary( const std::vector<unsigned char>& buffer )\n    throw( decaf::lang::exceptions::IllegalStateException ) {\n\n    if( buffer.empty() ) {\n        return;\n    }\n\n    this->setDictionary( &buffer[0], buffer.size(), 0, buffer.size() );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid Deflater::setStrategy( int strategy )\n    throw( decaf::lang::exceptions::IllegalArgumentException,\n           decaf::lang::exceptions::IllegalStateException ) {\n\n    if( strategy < DEFAULT_STRATEGY || strategy > HUFFMAN_ONLY ) {\n        throw IllegalArgumentException(\n            __FILE__, __LINE__, \"Strategy value {%d} is not valid.\", strategy );\n    }\n\n    if( this->data->stream == NULL && !this->data->ended ) {\n        throw IllegalStateException(\n            __FILE__, __LINE__, \"The Deflator is in an invalid state.\" );\n    }\n\n    this->data->strategy = strategy;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid Deflater::setLevel( int level )\n    throw( decaf::lang::exceptions::IllegalArgumentException,\n           decaf::lang::exceptions::IllegalStateException ) {\n\n    if( level < DEFAULT_COMPRESSION || level > BEST_COMPRESSION ) {\n        throw IllegalArgumentException(\n            __FILE__, __LINE__, \"Strategy value {%d} is not valid.\", level );\n    }\n\n    if( this->data->stream == NULL && !this->data->ended ) {\n        throw IllegalStateException(\n            __FILE__, __LINE__, \"The Deflator is in an invalid state.\" );\n    }\n\n    this->data->level = level;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool Deflater::needsInput() const {\n    if( this->data->stream == NULL ) {\n        return false;\n    }\n\n    return this->data->stream->avail_in == 0;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid Deflater::finish() {\n    this->data->flush = Z_FINISH;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool Deflater::finished() const {\n    return this->data->finished;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstd::size_t Deflater::deflate( unsigned char* buffer, std::size_t size, std::size_t offset, std::size_t length )\n    throw( decaf::lang::exceptions::NullPointerException,\n           decaf::lang::exceptions::IndexOutOfBoundsException,\n           decaf::lang::exceptions::IllegalStateException ) {\n\n    try{\n\n        if( buffer == NULL ) {\n            throw NullPointerException(\n                __FILE__, __LINE__, \"Buffer passed cannot be NULL.\" );\n        }\n\n        if( this->data->stream == NULL ) {\n            throw IllegalStateException(\n                __FILE__, __LINE__, \"The Deflator has already been ended.\" );\n        }\n\n        if( offset + length > size ) {\n            throw IndexOutOfBoundsException(\n                __FILE__, __LINE__, \"Given offset + length greater than the size of the buffer.\" );\n        }\n\n        std::size_t outStart = this->data->stream->total_out;\n\n        this->data->stream->next_out = buffer + offset;\n        this->data->stream->avail_out = length;\n\n        \/\/ Call ZLib and then process the resulting data to figure out what happened.\n        int result = ::deflate( this->data->stream, this->data->flush );\n\n        if( result == Z_STREAM_END ) {\n            this->data->finished = true;\n        }\n\n        return this->data->stream->total_out - outStart;\n    }\n    DECAF_CATCH_RETHROW( NullPointerException )\n    DECAF_CATCH_RETHROW( IllegalStateException )\n    DECAF_CATCH_RETHROW( IndexOutOfBoundsException )\n    DECAF_CATCHALL_THROW( IllegalStateException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstd::size_t Deflater::deflate( std::vector<unsigned char>& buffer, std::size_t offset, std::size_t length )\n    throw( decaf::lang::exceptions::IndexOutOfBoundsException,\n           decaf::lang::exceptions::IllegalStateException ) {\n\n    return this->deflate( &buffer[0], buffer.size(), offset, length );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstd::size_t Deflater::deflate( std::vector<unsigned char>& buffer )\n    throw( decaf::lang::exceptions::IllegalStateException ){\n\n    return this->deflate( &buffer[0], buffer.size(), 0, buffer.size() );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstd::size_t Deflater::getAdler() const throw( decaf::lang::exceptions::IllegalStateException ) {\n    if( this->data->stream == NULL ) {\n        throw IllegalStateException(\n            __FILE__, __LINE__, \"The Deflator has already been ended.\" );\n    }\n\n    return this->data->stream->adler;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nlong long Deflater::getBytesRead() const throw( decaf::lang::exceptions::IllegalStateException ) {\n    if( this->data->stream == NULL ) {\n        throw IllegalStateException(\n            __FILE__, __LINE__, \"The Deflator has already been ended.\" );\n    }\n\n    return this->data->stream->total_in;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nlong long Deflater::getBytesWritten() const throw( decaf::lang::exceptions::IllegalStateException ) {\n    if( this->data->stream == NULL ) {\n        throw IllegalStateException(\n            __FILE__, __LINE__, \"The Deflator has already been ended.\" );\n    }\n\n    return this->data->stream->total_out;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid Deflater::reset() throw( decaf::lang::exceptions::IllegalStateException ) {\n\n    if( this->data->stream == NULL ) {\n        throw IllegalStateException(\n            __FILE__, __LINE__, \"The Deflator has already been ended.\" );\n    }\n\n    DeflaterData::resetZlibStream( this->data );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid Deflater::end() {\n\n    if( this->data ) {\n        DeflaterData::finishZlibDeflate( this->data );\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright 2009 SPARTA, Inc., dba Cobham Analytic Solutions\n * \n * This file is part of WATCHER.\n * \n *     WATCHER 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 *     WATCHER is distributed in the hope that it will be 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 Watcher.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n\/**\n * Connects to a Watcher server and writes the event stream to a KML file suitable for use\n * with Google Earth.\n *\n * @author michael.elkins@cobham.com\n *\/\n\n#include <unistd.h>\n#include <getopt.h>\n#include <stdint.h>\n\n#include <cassert>\n#include <iostream>\n#include <cstdlib>\n\n#include \"logger.h\"\n#include \"initConfig.h\"\n#include \"singletonConfig.h\"\n#include \"libwatcher\/messageStream.h\"\n#include \"libwatcher\/watcherGraph.h\"\n#include \"libwatcher\/playbackTimeRange.h\"\n\n#define TOOL_NAME \"earthWatcher\"\nDECLARE_GLOBAL_LOGGER(TOOL_NAME);\n\nusing namespace watcher;\n\nvoid write_kml(const WatcherGraph& graph, const std::string& outputFile); \/\/ kml.cc\n\nnamespace watcher {\n    float LayerPadding = 10;\n    float Lonoff = 0.0;\n    float Latoff = 0.0;\n    float Altoff = 0.0;\n    float IconScale = 1.0;\n    int SplineSteps = 20;\n    std::string IconPath ( \"placemark_circle.png\") ;\n}\n\nnamespace {\n\n\/\/arguments to getopt_long()\nconst option OPTIONS[] = {\n    { \"latoff\", required_argument, 0, 'a' },\n    { \"altoff\", required_argument, 0, 'A' },\n    { \"config\", required_argument, 0, 'c' },\n    { \"help\", no_argument, 0, 'h' },\n    { \"output\", required_argument, 0, 'o' },\n    { \"lonoff\", required_argument, 0, 'O' },\n    { \"refresh\", required_argument, 0, 'r' },\n    { \"seek\", required_argument, 0, 'S' },\n    { \"server\", required_argument, 0, 's' },\n    { \"speed\", required_argument, 0, 'd' },\n    { \"steps\", required_argument, 0, 't' },\n    { \"icon-scale\", required_argument, 0, 'i' },\n    { \"icon-path\", required_argument, 0, 'I' },\n    { 0, 0, 0, 0 }\n};\n\nconst char *CONFIG_FILE = TOOL_NAME \".cfg\";\nconst char *OUTPUT_FILE = \"watcher.kml\";\nconst char *PROPERTY_FILE = TOOL_NAME \".log.properties\";\nconst char *DEFAULT_HOST = \"127.0.0.1\";\nconst unsigned int DEFAULT_REFRESH = 1; \/\/ SECONDS\n\nvoid usage()\n{\n    const char *SEP = \"\\t\\t\";   \/\/ separator for argument\/description columns\n\n    std::cout << \"usage: earthWatcher [ -h ] [ -c FILE ]\\n\"\n        \"  -a, --latoff OFF\" << SEP << \"translate GPS coordinates relative to a given latitude\\n\"\n        \"  -A, --altoff OFF\" << SEP << \"translate GPS coordinates relative to the given altitude\\n\"\n        \"  -c, --config FILE\" << SEP << \"specify a configuration file (default: \" << CONFIG_FILE << \")\\n\"\n        \"  -d, --speed SPEED\" << SEP << \"specify the event playback rate (default: 1.0)\\n\"\n        \"  -h, --help\\t\" << SEP << \"display this help message\\n\"\n        \"  -i, --icon-scale=NUM\" << SEP << \"adjust the size of node icons\\n\"\n        \"  -I, --icon-path=STR\" << SEP << \"specify the node icon to use (default: \" << IconPath << \")\\n\"\n        \"  -o, --output FILE\" << SEP << \"specifies the output KML file (default: \" << OUTPUT_FILE << \")\\n\"\n        \"  -O, --lonoff OFF\" << SEP << \"translate GPS coordinates relative to a given longitude\\n\"\n        \"  -r, --refresh SECS\" << SEP << \"write the the output every SECS seconds (default: \" << DEFAULT_REFRESH << \")\\n\"\n        \"  -s, --server HOST\" << SEP << \"connect to the watcher server on the given host (default: \" << DEFAULT_HOST << \")\\n\"\n        \"  -S, --seek POS\" << SEP << \"start event playback at timestamp POS (default: -1)\\n\"\n        \"  -t, --steps NUM\" << SEP << \"number of points to use when drawing a spline (default: \" << SplineSteps << \")\\n\"\n        \"\\tPOS may be specified relative to the first and last timestamps in the Watcher database by prefixing the offset with + or -\\n\"\n        \"\\tExample: +5000 means 5 seconds after the first event in the database.\\n\"\n        << std::endl;\n}\n\n} \/\/ end namespace\n\nint main(int argc, char **argv)\n{\n    TRACE_ENTER();\n\n    const char *output_file = 0;\n    Timestamp start_timestamp = -1 ; \/\/ default to EOF (live playback)\n    unsigned int refresh = DEFAULT_REFRESH;\n    float speed = 1.0;\n    bool relativeTS = false; \/\/ when true, start_timestamp is relative to first or last event in the Watcher DB\n    unsigned int args = 0;\n    enum {\n        argLayerPadding = (1<<0),\n        argLonoff = (1<<1),\n        argLatoff = (1<<2),\n        argAltoff = (1<<3),\n        argOutputFile = (1<<4),\n        argServerName = (1<<5),\n        argSplineSteps = (1<<6),\n        argIconPath = (1<<7)\n    };\n    std::string outputFile(OUTPUT_FILE);\n    std::string serverName(DEFAULT_HOST);\n\n    for (int i; (i = getopt_long(argc, argv, \"a:A:hi:I:c:d:o:O:r:s:S:t:\", OPTIONS, 0)) != -1; ) {\n        switch (i) {\n            case 'c':\n                break; \/\/handled by initConfig()\n\n            case 'a':\n                Latoff = atof(optarg);\n                args |= argLatoff;\n                break;\n\n            case 'A':\n                Altoff = atof(optarg);\n                args |= argAltoff;\n                break;\n\n            case 'd':\n                speed = atof(optarg);\n                break;\n\n            case 'i':\n                IconScale = atof(optarg);\n                break;\n\n            case 'I':\n                IconPath = optarg;\n                args |= argIconPath;\n                break;\n\n            case 'o': \/\/ output-file\n                outputFile = optarg;\n                args |= argOutputFile;\n                break;\n\n            case 'O':\n                Lonoff = atof(optarg);\n                args |= argLonoff;\n                break;\n\n            case 'r':\n                refresh = atoi(optarg);\n                break;\n\n            case 'S':\n                relativeTS = (optarg[0] == '+' || optarg[0] == '-'); \/\/ when +\/- is prefix, seek relative to starting\/ending event\n                start_timestamp = atol(optarg);\n                if (start_timestamp == -1)\n                    relativeTS = false; \/\/ special case for EOF value\n                break;\n\n            case 's':\n                serverName = optarg;\n                args |= argServerName;\n                break;\n\n            case 't':\n                SplineSteps = atoi(optarg);\n                if (SplineSteps < 2) {\n                    std::cerr << \"error: number of steps can not be less than 2\" << std::endl;\n                    return EXIT_FAILURE;\n                }\n                args |= argSplineSteps;\n                break;\n\n            case 'h':\n            default:\n                usage();\n                TRACE_EXIT_RET(EXIT_SUCCESS);\n                return EXIT_SUCCESS;\n                break;\n        }\n    }\n\n    libconfig::Config& config = SingletonConfig::instance();\n    SingletonConfig::lock();\n    std::string configFilename; \/\/filled by initConfig()\n    if (! watcher::initConfig(config, argc, argv, configFilename))\n        std::cout << \"Configuration file not found. Creating new configuration file and using default runtime values.\" << std::endl;\n    SingletonConfig::unlock();\n\n    \/* handle log.properties file as a special case *\/\n    std::string logConf(PROPERTY_FILE);\n    if (!config.lookupValue(\"logProperties\", logConf)) {\n        config.getRoot().add(\"logProperties\", libconfig::Setting::TypeString) = logConf;\n    }\n    LOAD_LOG_PROPS(logConf); \n    LOG_INFO(\"Logger initialized from file \\\"\" << logConf << \"\\\"\");\n\n    std::string service(\"watcherd\");\n    struct {\n        const char *configName;\n        std::string *value;\n        unsigned int bit;\n    } ConfigString[] = {\n        { \"server\", &serverName, argServerName },\n        { \"service\", &service, 0 },\n        { \"outputFile\", &outputFile, argOutputFile },\n        { \"iconPath\", &IconPath, argIconPath },\n        { 0, 0, 0 } \/\/ terminator\n    };\n\n    for (size_t i = 0; ConfigString[i].configName != 0; ++i) {\n        if ((args & ConfigString[i].bit) == 0 && !config.lookupValue(ConfigString[i].configName, *ConfigString[i].value)) {\n            LOG_INFO(\"'\" << ConfigString[i].configName << \"' not found in the configuration file, using default: \" << *ConfigString[i].value\n                     << \" and adding this to the configuration file.\");\n            config.getRoot().add(ConfigString[i].configName, libconfig::Setting::TypeString) = *ConfigString[i].value;\n        }\n    }\n\n    LOG_DEBUG(\"latOff=\" << Latoff << \" lonOff=\" << Lonoff << \" altOff=\" << Altoff);\n\n    struct {\n        const char *configName;\n        float* value;\n        unsigned int bit;\n    } ConfigFloat[] = {\n        { \"layerPadding\", &LayerPadding, argLayerPadding },\n        { \"lonOff\", &Lonoff, argLonoff },\n        { \"latOff\", &Latoff, argLatoff },\n        { \"altOff\", &Altoff, argAltoff },\n        { 0, 0, 0 } \/\/ terminator\n    };\n\n    for (size_t i = 0; ConfigFloat[i].configName != 0; ++i) {\n        if ((args & ConfigFloat[i].bit) == 0 && !config.lookupValue(ConfigFloat[i].configName, *ConfigFloat[i].value)) {\n            LOG_INFO(\"'\" << ConfigFloat[i].configName << \"' not found in the configuration file, using default: \" << *ConfigFloat[i].value\n                     << \" and adding this to the configuration file.\");\n            config.getRoot().add(ConfigFloat[i].configName, libconfig::Setting::TypeFloat) = *ConfigFloat[i].value;\n        }\n    }\n\n    struct {\n        const char *configName;\n        int* value;\n        unsigned int bit;\n    } ConfigInt[] = {\n        { \"splineSteps\", &SplineSteps, argSplineSteps },\n        { 0, 0, 0 } \/\/ terminator\n    };\n\n    for (size_t i = 0; ConfigInt[i].configName != 0; ++i) {\n        if ((args & ConfigInt[i].bit) == 0 && !config.lookupValue(ConfigInt[i].configName, *ConfigInt[i].value)) {\n            LOG_INFO(\"'\" << ConfigInt[i].configName << \"' not found in the configuration file, using default: \" << *ConfigInt[i].value\n                     << \" and adding this to the configuration file.\");\n            config.getRoot().add(ConfigInt[i].configName, libconfig::Setting::TypeInt) = *ConfigInt[i].value;\n        }\n    }\n\n    \/\/ open a message stream of live events for now\n    MessageStreamPtr ms(MessageStream::createNewMessageStream(serverName, service, start_timestamp, speed));\n    if (!ms) {\n        LOG_FATAL(\"Unable to create new message stream to server \\\"\" << serverName << \"\\\" using service (or port) \\\"\" << service);\n        TRACE_EXIT_RET(EXIT_FAILURE); \n        return EXIT_FAILURE;\n    }\n\n    if (relativeTS) {\n        ms->getMessageTimeRange();\n    } else {\n        LOG_INFO(\"Starting event playback\");\n        ms->startStream(); \n    }\n\n    WatcherGraph graph;\n\n    unsigned int messageNumber = 0;\n    MessagePtr mp;\n    time_t last_output = 0; \/\/ counter to allow for writing the kml file on a fixed time interval\n    bool changed = false;\n    bool needTimeRange = relativeTS;\n\n    const char *cfname = configFilename.c_str();\n    struct stat sb;\n    time_t cftime;      \/\/ time at which config file was last modified\n    if (stat(cfname, &sb) == -1) {\n        std::cerr << \"stat: \" << strerror(errno) << std::endl;\n        return EXIT_FAILURE;\n    }\n    cftime = sb.st_mtime;\n\n    LOG_INFO(\"Waiting for events \");\n    while (ms->getNextMessage(mp)) {\n\n        if (needTimeRange) {\n            PlaybackTimeRangeMessagePtr trp(boost::dynamic_pointer_cast<PlaybackTimeRangeMessage>(mp));\n            if (trp.get() != 0) {\n                LOG_INFO( \"first offset=\" << trp->min_ << \", last offset=\" << trp->max_ );\n                needTimeRange = false;\n\n                Timestamp off = start_timestamp + (( start_timestamp >= 0 ) ? trp->min_ : trp->max_ );\n                ms->setStreamTimeStart(off);\n\n                LOG_INFO(\"Starting event playback\");\n                ms->startStream(); \n\n                continue;\n            }\n        }\n\n        changed |= graph.updateGraph(mp);\n\n        if (changed) {\n            time_t now = time(0);\n            if (now - last_output >= refresh) {\n                \/\/ reload config file if changed\n                if (stat(cfname, &sb) == -1) {\n                    LOG_ERROR( \"stat: \" << strerror(errno) );\n                    return EXIT_FAILURE;\n                }\n                if (sb.st_mtime > cftime) {\n                    cftime = sb.st_mtime;\n                    LOG_INFO(\"reloading configuration file\");\n                    SingletonConfig::lock();\n                    config.readFile(cfname);\n                    SingletonConfig::unlock();\n                }\n\n                graph.doMaintanence(); \/\/ expire stale links\n                LOG_DEBUG(\"writing kml file\");\n                last_output = now;\n                write_kml(graph, outputFile);\n            }\n            changed = false; \/\/ reset flag\n        }\n    }\n\n    \/\/ Save any configuration changes made during the run.\n    LOG_INFO(\"Saving last known configuration to \" << configFilename); \n    SingletonConfig::lock();\n    config.writeFile(configFilename.c_str());\n\n    TRACE_EXIT_RET(0);\n    return 0;\n}\n<commit_msg>default to 2 points in the spline<commit_after>\/* Copyright 2009 SPARTA, Inc., dba Cobham Analytic Solutions\n * \n * This file is part of WATCHER.\n * \n *     WATCHER 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 *     WATCHER is distributed in the hope that it will be 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 Watcher.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n\/**\n * Connects to a Watcher server and writes the event stream to a KML file suitable for use\n * with Google Earth.\n *\n * @author michael.elkins@cobham.com\n *\/\n\n#include <unistd.h>\n#include <getopt.h>\n#include <stdint.h>\n\n#include <cassert>\n#include <iostream>\n#include <cstdlib>\n\n#include \"logger.h\"\n#include \"initConfig.h\"\n#include \"singletonConfig.h\"\n#include \"libwatcher\/messageStream.h\"\n#include \"libwatcher\/watcherGraph.h\"\n#include \"libwatcher\/playbackTimeRange.h\"\n\n#define TOOL_NAME \"earthWatcher\"\nDECLARE_GLOBAL_LOGGER(TOOL_NAME);\n\nusing namespace watcher;\n\nvoid write_kml(const WatcherGraph& graph, const std::string& outputFile); \/\/ kml.cc\n\nnamespace watcher {\n    float LayerPadding = 10;\n    float Lonoff = 0.0;\n    float Latoff = 0.0;\n    float Altoff = 0.0;\n    float IconScale = 1.0;\n    int SplineSteps = 2;\n    std::string IconPath ( \"placemark_circle.png\") ;\n}\n\nnamespace {\n\n\/\/arguments to getopt_long()\nconst option OPTIONS[] = {\n    { \"latoff\", required_argument, 0, 'a' },\n    { \"altoff\", required_argument, 0, 'A' },\n    { \"config\", required_argument, 0, 'c' },\n    { \"help\", no_argument, 0, 'h' },\n    { \"output\", required_argument, 0, 'o' },\n    { \"lonoff\", required_argument, 0, 'O' },\n    { \"refresh\", required_argument, 0, 'r' },\n    { \"seek\", required_argument, 0, 'S' },\n    { \"server\", required_argument, 0, 's' },\n    { \"speed\", required_argument, 0, 'd' },\n    { \"steps\", required_argument, 0, 't' },\n    { \"icon-scale\", required_argument, 0, 'i' },\n    { \"icon-path\", required_argument, 0, 'I' },\n    { 0, 0, 0, 0 }\n};\n\nconst char *CONFIG_FILE = TOOL_NAME \".cfg\";\nconst char *OUTPUT_FILE = \"watcher.kml\";\nconst char *PROPERTY_FILE = TOOL_NAME \".log.properties\";\nconst char *DEFAULT_HOST = \"127.0.0.1\";\nconst unsigned int DEFAULT_REFRESH = 1; \/\/ SECONDS\n\nvoid usage()\n{\n    const char *SEP = \"\\t\\t\";   \/\/ separator for argument\/description columns\n\n    std::cout << \"usage: earthWatcher [ -h ] [ -c FILE ]\\n\"\n        \"  -a, --latoff OFF\" << SEP << \"translate GPS coordinates relative to a given latitude\\n\"\n        \"  -A, --altoff OFF\" << SEP << \"translate GPS coordinates relative to the given altitude\\n\"\n        \"  -c, --config FILE\" << SEP << \"specify a configuration file (default: \" << CONFIG_FILE << \")\\n\"\n        \"  -d, --speed SPEED\" << SEP << \"specify the event playback rate (default: 1.0)\\n\"\n        \"  -h, --help\\t\" << SEP << \"display this help message\\n\"\n        \"  -i, --icon-scale=NUM\" << SEP << \"adjust the size of node icons\\n\"\n        \"  -I, --icon-path=STR\" << SEP << \"specify the node icon to use (default: \" << IconPath << \")\\n\"\n        \"  -o, --output FILE\" << SEP << \"specifies the output KML file (default: \" << OUTPUT_FILE << \")\\n\"\n        \"  -O, --lonoff OFF\" << SEP << \"translate GPS coordinates relative to a given longitude\\n\"\n        \"  -r, --refresh SECS\" << SEP << \"write the the output every SECS seconds (default: \" << DEFAULT_REFRESH << \")\\n\"\n        \"  -s, --server HOST\" << SEP << \"connect to the watcher server on the given host (default: \" << DEFAULT_HOST << \")\\n\"\n        \"  -S, --seek POS\" << SEP << \"start event playback at timestamp POS (default: -1)\\n\"\n        \"  -t, --steps NUM\" << SEP << \"number of points to use when drawing a spline (default: \" << SplineSteps << \")\\n\"\n        \"\\tPOS may be specified relative to the first and last timestamps in the Watcher database by prefixing the offset with + or -\\n\"\n        \"\\tExample: +5000 means 5 seconds after the first event in the database.\\n\"\n        << std::endl;\n}\n\n} \/\/ end namespace\n\nint main(int argc, char **argv)\n{\n    TRACE_ENTER();\n\n    const char *output_file = 0;\n    Timestamp start_timestamp = -1 ; \/\/ default to EOF (live playback)\n    unsigned int refresh = DEFAULT_REFRESH;\n    float speed = 1.0;\n    bool relativeTS = false; \/\/ when true, start_timestamp is relative to first or last event in the Watcher DB\n    unsigned int args = 0;\n    enum {\n        argLayerPadding = (1<<0),\n        argLonoff = (1<<1),\n        argLatoff = (1<<2),\n        argAltoff = (1<<3),\n        argOutputFile = (1<<4),\n        argServerName = (1<<5),\n        argSplineSteps = (1<<6),\n        argIconPath = (1<<7)\n    };\n    std::string outputFile(OUTPUT_FILE);\n    std::string serverName(DEFAULT_HOST);\n\n    for (int i; (i = getopt_long(argc, argv, \"a:A:hi:I:c:d:o:O:r:s:S:t:\", OPTIONS, 0)) != -1; ) {\n        switch (i) {\n            case 'c':\n                break; \/\/handled by initConfig()\n\n            case 'a':\n                Latoff = atof(optarg);\n                args |= argLatoff;\n                break;\n\n            case 'A':\n                Altoff = atof(optarg);\n                args |= argAltoff;\n                break;\n\n            case 'd':\n                speed = atof(optarg);\n                break;\n\n            case 'i':\n                IconScale = atof(optarg);\n                break;\n\n            case 'I':\n                IconPath = optarg;\n                args |= argIconPath;\n                break;\n\n            case 'o': \/\/ output-file\n                outputFile = optarg;\n                args |= argOutputFile;\n                break;\n\n            case 'O':\n                Lonoff = atof(optarg);\n                args |= argLonoff;\n                break;\n\n            case 'r':\n                refresh = atoi(optarg);\n                break;\n\n            case 'S':\n                relativeTS = (optarg[0] == '+' || optarg[0] == '-'); \/\/ when +\/- is prefix, seek relative to starting\/ending event\n                start_timestamp = atol(optarg);\n                if (start_timestamp == -1)\n                    relativeTS = false; \/\/ special case for EOF value\n                break;\n\n            case 's':\n                serverName = optarg;\n                args |= argServerName;\n                break;\n\n            case 't':\n                SplineSteps = atoi(optarg);\n                if (SplineSteps < 2) {\n                    std::cerr << \"error: number of steps can not be less than 2\" << std::endl;\n                    return EXIT_FAILURE;\n                }\n                args |= argSplineSteps;\n                break;\n\n            case 'h':\n            default:\n                usage();\n                TRACE_EXIT_RET(EXIT_SUCCESS);\n                return EXIT_SUCCESS;\n                break;\n        }\n    }\n\n    libconfig::Config& config = SingletonConfig::instance();\n    SingletonConfig::lock();\n    std::string configFilename; \/\/filled by initConfig()\n    if (! watcher::initConfig(config, argc, argv, configFilename))\n        std::cout << \"Configuration file not found. Creating new configuration file and using default runtime values.\" << std::endl;\n    SingletonConfig::unlock();\n\n    \/* handle log.properties file as a special case *\/\n    std::string logConf(PROPERTY_FILE);\n    if (!config.lookupValue(\"logProperties\", logConf)) {\n        config.getRoot().add(\"logProperties\", libconfig::Setting::TypeString) = logConf;\n    }\n    LOAD_LOG_PROPS(logConf); \n    LOG_INFO(\"Logger initialized from file \\\"\" << logConf << \"\\\"\");\n\n    std::string service(\"watcherd\");\n    struct {\n        const char *configName;\n        std::string *value;\n        unsigned int bit;\n    } ConfigString[] = {\n        { \"server\", &serverName, argServerName },\n        { \"service\", &service, 0 },\n        { \"outputFile\", &outputFile, argOutputFile },\n        { \"iconPath\", &IconPath, argIconPath },\n        { 0, 0, 0 } \/\/ terminator\n    };\n\n    for (size_t i = 0; ConfigString[i].configName != 0; ++i) {\n        if ((args & ConfigString[i].bit) == 0 && !config.lookupValue(ConfigString[i].configName, *ConfigString[i].value)) {\n            LOG_INFO(\"'\" << ConfigString[i].configName << \"' not found in the configuration file, using default: \" << *ConfigString[i].value\n                     << \" and adding this to the configuration file.\");\n            config.getRoot().add(ConfigString[i].configName, libconfig::Setting::TypeString) = *ConfigString[i].value;\n        }\n    }\n\n    LOG_DEBUG(\"latOff=\" << Latoff << \" lonOff=\" << Lonoff << \" altOff=\" << Altoff);\n\n    struct {\n        const char *configName;\n        float* value;\n        unsigned int bit;\n    } ConfigFloat[] = {\n        { \"layerPadding\", &LayerPadding, argLayerPadding },\n        { \"lonOff\", &Lonoff, argLonoff },\n        { \"latOff\", &Latoff, argLatoff },\n        { \"altOff\", &Altoff, argAltoff },\n        { 0, 0, 0 } \/\/ terminator\n    };\n\n    for (size_t i = 0; ConfigFloat[i].configName != 0; ++i) {\n        if ((args & ConfigFloat[i].bit) == 0 && !config.lookupValue(ConfigFloat[i].configName, *ConfigFloat[i].value)) {\n            LOG_INFO(\"'\" << ConfigFloat[i].configName << \"' not found in the configuration file, using default: \" << *ConfigFloat[i].value\n                     << \" and adding this to the configuration file.\");\n            config.getRoot().add(ConfigFloat[i].configName, libconfig::Setting::TypeFloat) = *ConfigFloat[i].value;\n        }\n    }\n\n    struct {\n        const char *configName;\n        int* value;\n        unsigned int bit;\n    } ConfigInt[] = {\n        { \"splineSteps\", &SplineSteps, argSplineSteps },\n        { 0, 0, 0 } \/\/ terminator\n    };\n\n    for (size_t i = 0; ConfigInt[i].configName != 0; ++i) {\n        if ((args & ConfigInt[i].bit) == 0 && !config.lookupValue(ConfigInt[i].configName, *ConfigInt[i].value)) {\n            LOG_INFO(\"'\" << ConfigInt[i].configName << \"' not found in the configuration file, using default: \" << *ConfigInt[i].value\n                     << \" and adding this to the configuration file.\");\n            config.getRoot().add(ConfigInt[i].configName, libconfig::Setting::TypeInt) = *ConfigInt[i].value;\n        }\n    }\n\n    \/\/ open a message stream of live events for now\n    MessageStreamPtr ms(MessageStream::createNewMessageStream(serverName, service, start_timestamp, speed));\n    if (!ms) {\n        LOG_FATAL(\"Unable to create new message stream to server \\\"\" << serverName << \"\\\" using service (or port) \\\"\" << service);\n        TRACE_EXIT_RET(EXIT_FAILURE); \n        return EXIT_FAILURE;\n    }\n\n    if (relativeTS) {\n        ms->getMessageTimeRange();\n    } else {\n        LOG_INFO(\"Starting event playback\");\n        ms->startStream(); \n    }\n\n    WatcherGraph graph;\n\n    unsigned int messageNumber = 0;\n    MessagePtr mp;\n    time_t last_output = 0; \/\/ counter to allow for writing the kml file on a fixed time interval\n    bool changed = false;\n    bool needTimeRange = relativeTS;\n\n    const char *cfname = configFilename.c_str();\n    struct stat sb;\n    time_t cftime;      \/\/ time at which config file was last modified\n    if (stat(cfname, &sb) == -1) {\n        std::cerr << \"stat: \" << strerror(errno) << std::endl;\n        return EXIT_FAILURE;\n    }\n    cftime = sb.st_mtime;\n\n    LOG_INFO(\"Waiting for events \");\n    while (ms->getNextMessage(mp)) {\n\n        if (needTimeRange) {\n            PlaybackTimeRangeMessagePtr trp(boost::dynamic_pointer_cast<PlaybackTimeRangeMessage>(mp));\n            if (trp.get() != 0) {\n                LOG_INFO( \"first offset=\" << trp->min_ << \", last offset=\" << trp->max_ );\n                needTimeRange = false;\n\n                Timestamp off = start_timestamp + (( start_timestamp >= 0 ) ? trp->min_ : trp->max_ );\n                ms->setStreamTimeStart(off);\n\n                LOG_INFO(\"Starting event playback\");\n                ms->startStream(); \n\n                continue;\n            }\n        }\n\n        changed |= graph.updateGraph(mp);\n\n        if (changed) {\n            time_t now = time(0);\n            if (now - last_output >= refresh) {\n                \/\/ reload config file if changed\n                if (stat(cfname, &sb) == -1) {\n                    LOG_ERROR( \"stat: \" << strerror(errno) );\n                    return EXIT_FAILURE;\n                }\n                if (sb.st_mtime > cftime) {\n                    cftime = sb.st_mtime;\n                    LOG_INFO(\"reloading configuration file\");\n                    SingletonConfig::lock();\n                    config.readFile(cfname);\n                    SingletonConfig::unlock();\n                }\n\n                graph.doMaintanence(); \/\/ expire stale links\n                LOG_DEBUG(\"writing kml file\");\n                last_output = now;\n                write_kml(graph, outputFile);\n            }\n            changed = false; \/\/ reset flag\n        }\n    }\n\n    \/\/ Save any configuration changes made during the run.\n    LOG_INFO(\"Saving last known configuration to \" << configFilename); \n    SingletonConfig::lock();\n    config.writeFile(configFilename.c_str());\n\n    TRACE_EXIT_RET(0);\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Remove unused classes.<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"classcreator.h\"\n#include <QLabel>\n\/\/#include <QGridLayout>\n#include <QFormLayout>\n#include <QPushButton>\n#include <QComboBox>\n#include <QLineEdit>\n\n\/*CLASSCREATOR*\/\nCQTs_ClassEditor::CQTs_ClassEditor(QWidget *parent)\n    : QWidget(parent)\n{\n    QLabel *tLabel = new QLabel(tr(\"Name (in english):\"));\n    QFormLayout *grid = new QFormLayout();\n    QLineEdit *Line_Name = new  QLineEdit();\n    grid->addRow(tLabel,Line_Name);\n    tLabel = new QLabel(tr(\"Hit Die:\"));\n    QComboBox *Combo_HD = new QComboBox();\n    QStringList List;\n    List <<\"d4\"<<\"d6\"<<\"d8\"<<\"d10\"<<\"d12\";\n    Combo_HD->addItems(List);\n    grid->addRow(tLabel,Combo_HD);\n    tLabel = new QLabel(tr(\"Skill Points at Each Level:\"));\n    List.clear();\n    List << \"2\" << \"4\" << \"6\" << \"8\";\n    QComboBox *Combo_Ranks = new QComboBox();\n    Combo_Ranks->addItems(List);\n    grid->addRow(tLabel,Combo_Ranks);\n    QPushButton *BT_Weapon, *BT_Armor, *BT_Skills;\n    BT_Weapon = new QPushButton(tr(\"Set Weapons Proficiency\"));\n    BT_Armor = new QPushButton(tr(\"Set Armor Proficiency\"));\n    BT_Skills = new QPushButton(tr(\"Set Class Skills\"));\n    BT_Weapon->setEnabled(false);\n    grid->addRow(BT_Weapon);\n    BT_Armor->setEnabled(false);\n    grid->addRow(BT_Armor);\n    grid->addRow(BT_Skills);\n    setLayout(grid);\n}\n\n\/*SPECIAL EDITOR*\/\nCQTs_ClassSpecialEdit::CQTs_ClassSpecialEdit(QWidget *parent)\n    : QWidget(parent)\n{\n\n}\n<commit_msg>Finished base skin for class editor<commit_after>#include \"classcreator.h\"\n#include <QLabel>\n\/\/#include <QGridLayout>\n#include <QFormLayout>\n#include <QPushButton>\n#include <QScrollArea>\n#include <QComboBox>\n#include <QLineEdit>\n\n\/*CLASSCREATOR*\/\nCQTs_ClassEditor::CQTs_ClassEditor(QWidget *parent)\n    : QWidget(parent)\n{\n    QLabel *tLabel = new QLabel(tr(\"Name (in english):\"));\n    QFormLayout *grid = new QFormLayout();\n    QLineEdit *Line_Name = new  QLineEdit();\n    grid->addRow(tLabel,Line_Name);\n    tLabel = new QLabel(tr(\"Hit Die:\"));\n    QComboBox *Combo_HD, *Combo_BaB, *Combo_TSFort, *Combo_TSRef, *Combo_TSWill;\n    Combo_HD = new QComboBox();\n    QStringList List;\n    List <<\"d4\"<<\"d6\"<<\"d8\"<<\"d10\"<<\"d12\";\n    Combo_HD->addItems(List);\n    grid->addRow(tLabel,Combo_HD);\n    tLabel = new QLabel(tr(\"Skill Points at Each Level:\"));\n    List.clear();\n    List << \"2\" << \"4\" << \"6\" << \"8\";\n    QComboBox *Combo_Ranks = new QComboBox();\n    Combo_Ranks->addItems(List);\n    grid->addRow(tLabel,Combo_Ranks);\n    \/\/BAB\n    List.clear();\n    List << tr(\"Poor\") << tr(\"Average\") << tr(\"Good\");\n    Combo_BaB = new QComboBox();\n    Combo_BaB->addItems(List);\n    tLabel = new QLabel(tr(\"Base Attack Bonus:\"));\n    \/\/Save trows\n    List.clear();\n    List << tr(\"Poor\") << tr(\"Good\");\n    grid->addRow(tLabel,Combo_BaB);\n    Combo_TSFort = new QComboBox();\n    Combo_TSFort->addItems(List);\n    tLabel = new QLabel(tr(\"Base save: Fortitude:\"));\n    grid->addRow(tLabel,Combo_TSFort);\n    Combo_TSRef = new QComboBox();\n    Combo_TSRef->addItems(List);\n    tLabel = new QLabel(tr(\"Base save: Reflexes:\"));\n    grid->addRow(tLabel,Combo_TSRef);\n    Combo_TSWill = new QComboBox();\n    Combo_TSWill->addItems(List);\n    tLabel = new QLabel(tr(\"Base save: Will:\"));\n    grid->addRow(tLabel,Combo_TSWill);\n    \/\/infos\n    QPushButton *BT_Weapon, *BT_Armor, *BT_Skills;\n    BT_Weapon = new QPushButton(tr(\"Set Weapons Proficiency\"));\n    BT_Armor = new QPushButton(tr(\"Set Armor Proficiency\"));\n    BT_Skills = new QPushButton(tr(\"Set Class Skills\"));\n    BT_Weapon->setEnabled(false);\n    grid->addRow(BT_Weapon);\n    BT_Armor->setEnabled(false);\n    grid->addRow(BT_Armor);\n    grid->addRow(BT_Skills);\n    QScrollArea *Scroll_Levels = new QScrollArea();\n    grid->addRow(Scroll_Levels);\n    QFormLayout *Levelgrid = new QFormLayout();\n    Levelgrid->addRow(new QLabel(\"1:\"),new QPushButton(tr(\"Add Level\")));\n    Scroll_Levels->setLayout(Levelgrid);\n    setLayout(grid);\n}\n\n\/*SPECIAL EDITOR*\/\nCQTs_ClassSpecialEdit::CQTs_ClassSpecialEdit(QWidget *parent)\n    : QWidget(parent)\n{\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"Canvas.h\"\n#include \"TextMetrics.h\"\nnamespace NodeBinding\n{\n    Napi::FunctionReference Canvas::constructor;\n\n    Canvas::Canvas(const Napi::CallbackInfo &info) : Napi::ObjectWrap<Canvas>(info)\n    {\n        Napi::Env env = info.Env();\n        Napi::HandleScope scope(env);\n\n        checkArgs(info, 2);\n        mWidth = info[0].As<Napi::Number>().Int32Value();\n        mHeight = info[1].As<Napi::Number>().Int32Value();\n        mRenderContext = std::make_shared<GRenderContext>(mWidth, mHeight);\n        mRenderContext->initRenderEnviroment();\n\n        \n    }\n\n    int Canvas::getWidth()\n    {\n        return mWidth;\n    }\n\n    int Canvas::getHeight()\n    {\n        return mHeight;\n    }\n\n    Napi::Value Canvas::getWidth(const Napi::CallbackInfo &info)\n    {\n        return Napi::Number::New(info.Env(), mWidth);\n    }\n\n    Napi::Value Canvas::getHeight(const Napi::CallbackInfo &info)\n    {\n        return Napi::Number::New(info.Env(), mHeight);\n    }\n\n    void Canvas::Init(Napi::Env env, Napi::Object exports)\n    {\n        Napi::HandleScope scope(env);\n\n        Napi::Function func =\n            DefineClass(env,\n                        \"Canvas\",\n                        {\n                            InstanceAccessor(\"width\", &Canvas::getWidth, nullptr),\n                            InstanceAccessor(\"height\", &Canvas::getHeight, nullptr),\n                            InstanceMethod(\"getContext\", &Canvas::getContext),\n                            InstanceMethod(\"createPNG\", &Canvas::createPNG),\n                            InstanceMethod(\"createJPEG\", &Canvas::createJPEG),\n                            InstanceMethod(\"createPNGStreamSync\", &Canvas::createPNGStreamSync),\n                            InstanceMethod(\"createJPGStreamSync\", &Canvas::createJPGStreamSync),\n                        });              \n        constructor = Napi::Persistent(func);\n        constructor.SuppressDestruct();\n        return;\n    }\n\n    Napi::Object Canvas::NewInstance(Napi::Env env, Napi::Value arg, Napi::Value arg2)\n    {\n        Napi::Object obj = constructor.New({arg, arg2});\n        obj.Set(\"name\", Napi::String::New(env, \"gcanvas\"));\n        Canvas *canvas = Napi::ObjectWrap<Canvas>::Unwrap(obj);\n        canvas->mRef = Napi::ObjectReference::New(obj);\n        return obj;\n    }\n\n    Napi::Value Canvas::getContext(const Napi::CallbackInfo &info)\n    {\n        Napi::Env env = info.Env();\n        checkArgs(info, 1);\n        std::string type = info[0].As<Napi::String>().Utf8Value();\n        if (type == \"2d\")\n        {\n            if (this->context2dRef.IsEmpty())\n            {\n                Napi::Object obj = Context2D::NewInstance(env);\n                this->context2dRef = Napi::ObjectReference::New(obj);\n                Context2D *ctx = Napi::ObjectWrap<Context2D>::Unwrap(obj);\n                ctx->setRenderContext(this->mRenderContext);\n                ctx->setCanvasRef(this);\n                return obj;\n            }\n            else\n            {\n                return this->context2dRef.Value();\n            }\n        }\n        else\n        {\n            throwError(info, \"only support 2d now\");\n            return Napi::Object::New(env);\n        }\n    }\n    void Canvas::createPNG(const Napi::CallbackInfo &info)\n    {\n        NodeBinding::checkArgs(info, 1);\n        std::string arg = info[0].As<Napi::String>().Utf8Value();\n        if (this->mRenderContext)\n        {\n            this->mRenderContext->makeCurrent();\n            this->mRenderContext->drawFrame();\n            this->mRenderContext->render2file(arg.c_str(), PNG_FORAMT);\n        }\n        return;\n    }\n    void Canvas::createJPEG(const Napi::CallbackInfo &info)\n    {\n        NodeBinding::checkArgs(info, 1);\n        std::string arg = info[0].As<Napi::String>().Utf8Value();\n        if (this->mRenderContext)\n        {\n            this->mRenderContext->makeCurrent();\n            this->mRenderContext->drawFrame();\n            this->mRenderContext->render2file(arg.c_str(), JPEG_FORMAT);\n        }\n        return;\n    }\n    Napi::Value Canvas::createJPGStreamSync(const Napi::CallbackInfo &info)\n    {\n        NodeBinding::checkArgs(info, 2);\n        Napi::Function callback = info[0].As<Napi::Function>();\n        if (this->mRenderContext)\n        {\n            this->mRenderContext->makeCurrent();\n            this->mRenderContext->drawFrame();\n        }\n        unsigned char *data = (unsigned char *)malloc(1 * sizeof(unsigned char));\n        unsigned long size = 0;\n        int ret = this->mRenderContext->getImagePixelJPG(&data, size);\n        if (ret == 0 && size > 0)\n        {\n            \/\/handlescope 表示作用域,一般调用callback函数时使用\n            Napi::HandleScope scope(info.Env());\n            Napi::Buffer<unsigned char> buffer = Napi::Buffer<unsigned char>::Copy(info.Env(), data, size);\n            callback.Call({info.Env().Null(),\n                           buffer,\n                           Napi::Number::New(info.Env(), size)});\n        }\n        else\n        {\n            Napi::HandleScope scope(info.Env());\n            callback.Call({Napi::String::New(Env(), \"createJPGStreamFail\"),\n                           info.Env().Null(),\n                           info.Env().Null()});\n        }\n        if (data)\n        {\n            delete data;\n            data = nullptr;\n        }\n    }\n\n    Napi::Value Canvas::createPNGStreamSync(const Napi::CallbackInfo &info)\n    {\n        NodeBinding::checkArgs(info, 2);\n        Napi::Function callback = info[0].As<Napi::Function>();\n        if (this->mRenderContext)\n        {\n            this->mRenderContext->makeCurrent();\n            this->mRenderContext->drawFrame();\n        }\n        std::vector<unsigned char> in;\n        int ret = this->mRenderContext->getImagePixelPNG(in);\n        if (ret == 0)\n        {\n            \/\/handlescope 表示作用域,一般调用callback函数时使用\n            Napi::HandleScope scope(info.Env());\n            Napi::Buffer<unsigned char> buffer = Napi::Buffer<unsigned char>::Copy(info.Env(), &in[0], in.size());\n            callback.Call({info.Env().Null(),\n                           buffer,\n                           Napi::Number::New(info.Env(), in.size())});\n        }\n        else\n        {\n            Napi::HandleScope scope(info.Env());\n            callback.Call({Napi::String::New(Env(), \"createPNGStreamFail\"),\n                           info.Env().Null(),\n                           info.Env().Null()});\n        }\n    }\n    Canvas::~Canvas()\n    {\n        this->mRenderContext = nullptr;\n    }\n} \/\/ namespace NodeBinding<commit_msg>fix:修复jpegstream的crash:buffer delte有关<commit_after>#include \"Canvas.h\"\n#include \"TextMetrics.h\"\nnamespace NodeBinding\n{\n    Napi::FunctionReference Canvas::constructor;\n\n    Canvas::Canvas(const Napi::CallbackInfo &info) : Napi::ObjectWrap<Canvas>(info)\n    {\n        Napi::Env env = info.Env();\n        Napi::HandleScope scope(env);\n\n        checkArgs(info, 2);\n        mWidth = info[0].As<Napi::Number>().Int32Value();\n        mHeight = info[1].As<Napi::Number>().Int32Value();\n        mRenderContext = std::make_shared<GRenderContext>(mWidth, mHeight);\n        mRenderContext->initRenderEnviroment();\n\n        \n    }\n\n    int Canvas::getWidth()\n    {\n        return mWidth;\n    }\n\n    int Canvas::getHeight()\n    {\n        return mHeight;\n    }\n\n    Napi::Value Canvas::getWidth(const Napi::CallbackInfo &info)\n    {\n        return Napi::Number::New(info.Env(), mWidth);\n    }\n\n    Napi::Value Canvas::getHeight(const Napi::CallbackInfo &info)\n    {\n        return Napi::Number::New(info.Env(), mHeight);\n    }\n\n    void Canvas::Init(Napi::Env env, Napi::Object exports)\n    {\n        Napi::HandleScope scope(env);\n\n        Napi::Function func =\n            DefineClass(env,\n                        \"Canvas\",\n                        {\n                            InstanceAccessor(\"width\", &Canvas::getWidth, nullptr),\n                            InstanceAccessor(\"height\", &Canvas::getHeight, nullptr),\n                            InstanceMethod(\"getContext\", &Canvas::getContext),\n                            InstanceMethod(\"createPNG\", &Canvas::createPNG),\n                            InstanceMethod(\"createJPEG\", &Canvas::createJPEG),\n                            InstanceMethod(\"createPNGStreamSync\", &Canvas::createPNGStreamSync),\n                            InstanceMethod(\"createJPGStreamSync\", &Canvas::createJPGStreamSync),\n                        });              \n        constructor = Napi::Persistent(func);\n        constructor.SuppressDestruct();\n        return;\n    }\n\n    Napi::Object Canvas::NewInstance(Napi::Env env, Napi::Value arg, Napi::Value arg2)\n    {\n        Napi::Object obj = constructor.New({arg, arg2});\n        obj.Set(\"name\", Napi::String::New(env, \"gcanvas\"));\n        Canvas *canvas = Napi::ObjectWrap<Canvas>::Unwrap(obj);\n        canvas->mRef = Napi::ObjectReference::New(obj);\n        return obj;\n    }\n\n    Napi::Value Canvas::getContext(const Napi::CallbackInfo &info)\n    {\n        Napi::Env env = info.Env();\n        checkArgs(info, 1);\n        std::string type = info[0].As<Napi::String>().Utf8Value();\n        if (type == \"2d\")\n        {\n            if (this->context2dRef.IsEmpty())\n            {\n                Napi::Object obj = Context2D::NewInstance(env);\n                this->context2dRef = Napi::ObjectReference::New(obj);\n                Context2D *ctx = Napi::ObjectWrap<Context2D>::Unwrap(obj);\n                ctx->setRenderContext(this->mRenderContext);\n                ctx->setCanvasRef(this);\n                return obj;\n            }\n            else\n            {\n                return this->context2dRef.Value();\n            }\n        }\n        else\n        {\n            throwError(info, \"only support 2d now\");\n            return Napi::Object::New(env);\n        }\n    }\n    void Canvas::createPNG(const Napi::CallbackInfo &info)\n    {\n        NodeBinding::checkArgs(info, 1);\n        std::string arg = info[0].As<Napi::String>().Utf8Value();\n        if (this->mRenderContext)\n        {\n            this->mRenderContext->makeCurrent();\n            this->mRenderContext->drawFrame();\n            this->mRenderContext->render2file(arg.c_str(), PNG_FORAMT);\n        }\n        return;\n    }\n    void Canvas::createJPEG(const Napi::CallbackInfo &info)\n    {\n        NodeBinding::checkArgs(info, 1);\n        std::string arg = info[0].As<Napi::String>().Utf8Value();\n        if (this->mRenderContext)\n        {\n            this->mRenderContext->makeCurrent();\n            this->mRenderContext->drawFrame();\n            this->mRenderContext->render2file(arg.c_str(), JPEG_FORMAT);\n        }\n        return;\n    }\n    Napi::Value Canvas::createJPGStreamSync(const Napi::CallbackInfo &info)\n    {\n        NodeBinding::checkArgs(info, 2);\n        Napi::Function callback = info[0].As<Napi::Function>();\n        if (this->mRenderContext)\n        {\n            this->mRenderContext->makeCurrent();\n            this->mRenderContext->drawFrame();\n        }\n        unsigned char *data = (unsigned char *)malloc(1 * sizeof(unsigned char));\n        unsigned long size = 0;\n        int ret = this->mRenderContext->getImagePixelJPG(&data, size);\n        if (ret == 0 && size > 0)\n        {\n            \/\/handlescope 表示作用域,一般调用callback函数时使用\n            Napi::HandleScope scope(info.Env());\n\n            Napi::Buffer<unsigned char> buffer = Napi::Buffer<unsigned char>::Copy(info.Env(), data, size);\n            callback.Call({info.Env().Null(),\n                           buffer,\n                           Napi::Number::New(info.Env(), size)});\n        }\n        else\n        {\n            Napi::HandleScope scope(info.Env());\n            callback.Call({Napi::String::New(Env(), \"createJPGStreamFail\"),\n                           info.Env().Null(),\n                           info.Env().Null()});\n        }\n    }\n\n    Napi::Value Canvas::createPNGStreamSync(const Napi::CallbackInfo &info)\n    {\n        NodeBinding::checkArgs(info, 2);\n        Napi::Function callback = info[0].As<Napi::Function>();\n        if (this->mRenderContext)\n        {\n            this->mRenderContext->makeCurrent();\n            this->mRenderContext->drawFrame();\n        }\n        std::vector<unsigned char> in;\n        int ret = this->mRenderContext->getImagePixelPNG(in);\n        if (ret == 0)\n        {\n            \/\/handlescope 表示作用域,一般调用callback函数时使用\n            Napi::HandleScope scope(info.Env());\n            Napi::Buffer<unsigned char> buffer = Napi::Buffer<unsigned char>::Copy(info.Env(), &in[0], in.size());\n            callback.Call({info.Env().Null(),\n                           buffer,\n                           Napi::Number::New(info.Env(), in.size())});\n        }\n        else\n        {\n            Napi::HandleScope scope(info.Env());\n            callback.Call({Napi::String::New(Env(), \"createPNGStreamFail\"),\n                           info.Env().Null(),\n                           info.Env().Null()});\n        }\n    }\n    Canvas::~Canvas()\n    {\n        this->mRenderContext = nullptr;\n    }\n} \/\/ namespace NodeBinding<|endoftext|>"}
{"text":"<commit_before>#include \"fastlib\/fastlib.h\"\n\n#define A1 1\n\n#define epsilon 1e-4\n\n#define LOGCOSH 0\n#define EXP 1\n#define KURTOSIS 2\n\n\/\/ n indicates number of points\n\/\/ d indicates number of dimensions (number of components or variables)\n\n\nnamespace {\n\n\n  void SaveCorrectly(const char *filename, Matrix a) {\n    Matrix a_transpose;\n    la::TransposeInit(a, &a_transpose);\n    data::Save(filename, a_transpose);\n  }\n  \n\n  void RandVector(Vector &v) {\n\n    index_t d = v.length();\n    v.SetZero();\n  \n    for(index_t i = 0; i+1 < d; i+=2) {\n      double a = drand48();\n      double b = drand48();\n      double first_term = sqrt(-2 * log(a));\n      double second_term = 2 * M_PI * b;\n      v[i] =   first_term * cos(second_term);\n      v[i+1] = first_term * sin(second_term);\n    }\n  \n    if((d % 2) == 1) {\n      v[d - 1] = sqrt(-2 * log(drand48())) * cos(2 * M_PI * drand48());\n    }\n\n    la::Scale(1\/sqrt(la::Dot(v, v)), &v);\n\n  }\n\n\n  void Center(Matrix X, Matrix &X_centered) {\n    Vector col_vector_sum;\n    col_vector_sum.Init(X.n_rows());\n    col_vector_sum.SetZero();\n  \n    index_t n = X.n_cols();\n \n    for(index_t i = 0; i < n; i++) {\n      Vector cur_col_vector;\n      X.MakeColumnVector(i, &cur_col_vector);\n      la::AddTo(cur_col_vector, &col_vector_sum);\n    }\n\n    la::Scale(1\/(double) n, &col_vector_sum);\n\n    X_centered.CopyValues(X);\n\n    for(index_t i = 0; i < n; i++) {\n      Vector cur_col_vector;\n      X_centered.MakeColumnVector(i, &cur_col_vector);\n      la::SubFrom(col_vector_sum, &cur_col_vector);\n    }\n\n  }\n\n\n  void Whiten(Matrix X, Matrix &whitening, Matrix &X_whitened) {\n    Matrix X_transpose, X_cov, D, E, E_times_D;\n    Vector D_vector;\n\n    la::TransposeInit(X, &X_transpose);\n    la::MulInit(X, X_transpose, &X_cov);\n\n    la::Scale(1 \/ (double) (X.n_cols() - 1), &X_cov);\n\n    X_cov.PrintDebug(\"X_cov\");\n\n    la::EigenvectorsInit(X_cov, &D_vector, &E);\n    D.InitDiagonal(D_vector);\n  \n    index_t d = D.n_rows();\n    for(index_t i = 0; i < d; i++) {\n      D.set(i, i, 1 \/ sqrt(D.get(i, i)));\n    }\n\n    la::MulInit(E, D, &E_times_D);\n    la::MulTransBOverwrite(E_times_D, E, &whitening);\n  \n    la::MulOverwrite(whitening, X, &X_whitened);\n  }\n\n\n  void Orthogonalize(Matrix W_old, Matrix &W) {\n\n    Matrix W_squared, W_squared_inv_sqrt;\n    \n    la::MulTransAInit(W, W, &W_squared);\n    \n    Matrix D, E, E_times_D;\n    Vector D_vector;\n    \n    la::EigenvectorsInit(W_squared, &D_vector, &E);\n    D.InitDiagonal(D_vector);\n    \n    index_t d = D.n_rows();\n    for(index_t i = 0; i < d; i++) {\n      D.set(i, i, 1 \/ sqrt(D.get(i, i)));\n    }\n    \n    la::MulInit(E, D, &E_times_D);\n    la::MulTransBInit(E_times_D, E, &W_squared_inv_sqrt);\n\t\n    \/\/ note that up until this point, W == W_old\n    la::MulOverwrite(W_old, W_squared_inv_sqrt, &W);\n  }\n  \n  \n  void UnivariateFastICA(Matrix X, int contrast_type, Matrix fixed_subspace,\n\t\t\t index_t dim_num, double tolerance, Vector &w) {\n    index_t d = X.n_rows();\n    index_t n = X.n_cols();\n\n    RandVector(w);\n\n  \n    Vector w_old;\n    w_old.Init(d);\n    w_old.SetZero();\n\n\n\n    bool converged = false;\n\n  \n    for(index_t epoch = 0; !converged; epoch++) {\n\n      printf(\"\\nEPOCH %\"LI\"d\\n\", epoch);\n\n      w.PrintDebug(\"w at beginning of epoch\");\n\n    \n\n\n      Vector first_deriv_component;\n      first_deriv_component.Init(d);\n      first_deriv_component.SetZero();\n\n      double second_deriv_scale_factor = 0;\n\n      \n      if(contrast_type == LOGCOSH) {\n\n\tVector first_deriv_dots;\n\tfirst_deriv_dots.Init(n);\n\t\n\tfor(index_t i = 0; i < n; i++) {\n\t  Vector x;\n\t  X.MakeColumnVector(i, &x);\n\t  first_deriv_dots[i] = tanh(A1 * la::Dot(w, x));\n\t  la::AddExpert(first_deriv_dots[i], x, &first_deriv_component);\n\t}\n\tla::Scale(1\/(double) n, &first_deriv_component);\n\t\n\t\n\tfor(index_t i = 0; i < n; i++) {\n\t  second_deriv_scale_factor += first_deriv_dots[i] * first_deriv_dots[i];\n\t}\n\t\n\tsecond_deriv_scale_factor *= A1 \/ (double) n;\n\tsecond_deriv_scale_factor -= A1;\n\t\n\n      }\n      else if(contrast_type == EXP) {\n\n\tVector dots;\n\tVector exp_dots;\n\tdots.Init(n);\n\texp_dots.Init(n);\n\n\tfor(index_t i = 0; i < n; i++) {\n\t  Vector x;\n\t  X.MakeColumnVector(i, &x);\n\n\t  double dot = la::Dot(w, x);\n\t  dots[i] = dot;\n\t  exp_dots[i] = exp(-dot * dot \/ 2);\n\n\t  la::AddExpert(dot * exp_dots[i], x, &first_deriv_component);\n\t}\n\tla::Scale(1\/(double) n, &first_deriv_component);\n\t\n\t\n\tfor(index_t i = 0; i < n; i++) {\n\t  second_deriv_scale_factor += exp_dots[i] * (dots[i] * dots[i] - 1);\n\t}\n\t\n\tsecond_deriv_scale_factor \/= (double) n;\n      }\n      else if(contrast_type == KURTOSIS) {\n\n\tVector dots_cubed;\n\tdots_cubed.Init(n);\n\n\tfor(index_t i = 0; i < n; i++) {\n\t  Vector x;\n\t  X.MakeColumnVector(i, &x);\n\n\t  double dot = la::Dot(w, x);\n\t  dots_cubed[i] = pow(dot, 3);\n\n\t  la::AddExpert(dots_cubed[i], x, &first_deriv_component);\n\t}\n\n\tla::Scale(1 \/ (double) n, &first_deriv_component);\n\n\tsecond_deriv_scale_factor = -3;\n      }\n      else {\n\tprintf(\"ERROR: invalid contrast function: contrast_type = %d\\n\",\n\t       contrast_type);\n\texit(SUCCESS_FAIL);\n      }\n      \n      \n      la::Scale(second_deriv_scale_factor, &w);\n      la::AddTo(first_deriv_component, &w);\n\n      first_deriv_component.PrintDebug(\"first_deriv_component\");\n      printf(\"second_deriv_scale_factor = %f\\n\", second_deriv_scale_factor);\n\n\n\n      \/\/ normalize\n      la::Scale(1\/sqrt(la::Dot(w, w)), &w);\n\n      w.PrintDebug(\"before correction\");\n    \n      \/\/ make orthogonal to fixed_subspace\n\n      for(index_t i = 0; i < dim_num; i++) {\n\tVector w_i;\n\tfixed_subspace.MakeColumnVector(i, &w_i);\n      \n\tla::AddExpert(-la::Dot(w_i, w), w_i, &w);\n\n      }\n    \n    \n      \/\/ normalize\n      la::Scale(1\/sqrt(la::Dot(w, w)), &w);\n    \n\n      w.PrintDebug(\"after correction\");\n    \n      \/\/ check for convergence\n\n      Vector w_diff;\n      la::SubInit(w_old, w, &w_diff);\n\n      if(la::Dot(w_diff, w_diff) < epsilon) {\n\tconverged = true;\n      }\n      else {\n\tla::AddOverwrite(w_old, w, &w_diff);\n    \n\tif(la::Dot(w_diff, w_diff) < epsilon) {\n\t  converged = true;\n\t}\n      }\n\n      w_old.CopyValues(w);\n\n\n    }\n\n  }\n\n\n  void DeflationICA(Matrix X, int contrast_type,\n\t\t    double tolerance, Matrix &fixed_subspace) {\n    \n    printf(\"Deflation ICA\\n\");\n    \n    index_t d = X.n_rows();\n    \n    printf(\"%\"LI\"d Components\\n\", d);\n  \n    for(index_t i = 0; i < d; i++) {\n      printf(\"\\n\\nExtracting component %\"LI\"d\\n\", i);\n      Vector w;\n      w.Init(d);\n      UnivariateFastICA(X, contrast_type, fixed_subspace, i, tolerance, w);\n      Vector fixed_subspace_vector_i;\n      fixed_subspace.MakeColumnVector(i, &fixed_subspace_vector_i);\n      fixed_subspace_vector_i.CopyValues(w);\n    }\n  \n  }\n\n  \n  void SymmetricICA(Matrix X, int contrast_type,\n\t\t    double tolerance, Matrix &W) {\n\n    printf(\"Symmetric ICA\\n\");\n\n    index_t d = X.n_rows();\n    index_t n = X.n_cols();\n\n      \n\n    \/\/generate random W\n      \n    for(index_t i = 0; i < d; i++) {\n      Vector w;\n      W.MakeColumnVector(i, &w);\n      RandVector(w);\n    }\n      \n      \n\n    Matrix W_old;\n    W_old.Init(d, d);\n      \n      \n    bool converged = false;\n      \n    while(!converged) {\n\t\n      \/\/ orthogonalize W via: newW = W * (W' * W) ^ -.5;\n\n      W_old.CopyValues(W);\n\n      \/\/ at this point, W_old == W, and W will be changed by Orthogonalize()\n      Orthogonalize(W_old, W);\n\n      \n      \/\/ use Newton-Raphson to update W\n\n      Matrix first_deriv_part;\n      \n      \n      if(contrast_type == LOGCOSH) {\n\t\n\t\n\t\/\/tanh(A1 * X' * W);\n\tMatrix tanh_dot_products;\n\tla::MulTransAInit(X, W, &tanh_dot_products);\n\tfor(index_t i = 0; i < d; i++) {\n\t  for(index_t j = 0; j < n; j++) {\n\t    tanh_dot_products.set(j, i,\n\t\t\t\t  tanh(A1 * tanh_dot_products.get(j, i)));\n\t  }\n\t}\n\n\tla::MulInit(X, tanh_dot_products, &first_deriv_part);\n\tla::Scale(1 \/ (double) n, &first_deriv_part);\n\n\t\n\t\/\/ take the mean of each column of tanh_dot_products\n\tfor(index_t i = 0; i < d; i++) {\n\t  Vector w;\n\t  W.MakeColumnVector(i, &w);\n\n\t  Vector tanh_dot_products_col_i;\n\t  tanh_dot_products.MakeColumnVector(i, &tanh_dot_products_col_i);\n\n\t  double second_deriv_scale_factor = 0;\n\t  for(index_t j = 0; j < n; j++) {\n\t    second_deriv_scale_factor +=\n\t      tanh_dot_products_col_i[j] * tanh_dot_products_col_i[j];\n\t  }\n\t  second_deriv_scale_factor =\n\t    (second_deriv_scale_factor * A1 \/ (double) n) - A1;\n\n\t  la::Scale(second_deriv_scale_factor, &w);\n\t}\n\n      }\n      else if(contrast_type == EXP) {\n\n\tMatrix dot_products, exp_dot_products, u_exp_dot_products;\n\tla::MulTransAInit(X, W, &dot_products);\n\texp_dot_products.Init(n, d);\n\tu_exp_dot_products.Init(n, d);\n\tfor(index_t i = 0; i < d; i++) {\n\t  for(index_t j = 0; j < n; j++) {\n\t    double dot = dot_products.get(j, i);\n\t    double exp_dot_product = exp(- dot * dot \/ 2);\n\t    exp_dot_products.set(j, i, exp_dot_product);\n\t    u_exp_dot_products.set(j, i, dot * exp_dot_product);\n\t  }\n\t}\n\n\tla::MulInit(X, u_exp_dot_products, &first_deriv_part);\n\tla::Scale(1 \/ (double) n, &first_deriv_part);\n\n\n\tfor(index_t i = 0; i < d; i++) {\n\t  Vector w;\n\t  W.MakeColumnVector(i, &w);\n\n\t  Vector dot_products_col_i, exp_dot_products_col_i;\n\t  dot_products.MakeColumnVector(i, &dot_products_col_i);\n\t  exp_dot_products.MakeColumnVector(i, &exp_dot_products_col_i);\n\t  \n\t  double second_deriv_scale_factor = 0;\n\t  for(index_t j = 0; j < n; j++) {\n\t    double dot = dot_products_col_i[j];\n\t    second_deriv_scale_factor +=\n\t      exp_dot_products_col_i[j] * (dot * dot - 1);\n\t  }\n\t  second_deriv_scale_factor \/= (double) n;\n\n\t  la::Scale(second_deriv_scale_factor, &w);\n\t}\n      }\n      else if(contrast_type == KURTOSIS) {\n\t\n\tMatrix dot_products_cubed;\n\tla::MulTransAInit(X, W, &dot_products_cubed);\n\tfor(index_t i = 0; i < d; i++) {\n\t  for(index_t j = 0; j < n; j++) {\n\t    dot_products_cubed.set(j, i, pow(dot_products_cubed.get(j, i), 3));\n\t  }\n\t}\n\n\n\tla::MulInit(X, dot_products_cubed, &first_deriv_part);\n\tla::Scale(1 \/ (double) n, &first_deriv_part);\n\n\n\tla::Scale(-3, &W);\n\n      }\n      else {\n\tprintf(\"ERROR: invalid contrast function: contrast_type = %d\\n\",\n\t       contrast_type);\n\texit(SUCCESS_FAIL);\n      }\n      \n\n      la::AddTo(first_deriv_part, &W);\n\n\n      Matrix temp;\n      temp.Copy(W);\n      Orthogonalize(temp, W);\n      \n      W_old.PrintDebug(\"W_old\");\n      W.PrintDebug(\"W\");\n      \n      \/\/ compare W to W_old using some method\n      \n      \n      Matrix W_delta_cov;\n      la::MulTransAInit(W, W_old, &W_delta_cov);\n      \n      double min_abs_diag = DBL_MAX;\n      for(index_t i = 0; i < d; i++) {\n\tdouble current_diag = fabs(W_delta_cov.get(i, i));\n\tif(current_diag < min_abs_diag) {\n\t  min_abs_diag = current_diag;\n\t}\n      }\n      \n      printf(\"min_abs_diag = %f\\n\", min_abs_diag);\n\n      if(1 - min_abs_diag < epsilon) {\n\tconverged = true;\n      }\n      \n      \n    }\n    \n    \n  }\n\n  index_t GetSamples(int max, double percentage, Vector *selected_indices) {\n    \n    int num_selected = 0;\n    Vector rand_nums;\n    rand_nums.Init(max);\n    for(index_t i = 0; i < max; i++) {\n      double rand_num = drand48();\n      rand_nums[i] = rand_num;\n      if(rand_num <= percentage) {\n\tnum_selected++;\n      }\n    }\n    \n    selected_indices -> Init(num_selected);\n    \n    int j = 0;\n    for(index_t i = 0; i < max; i++) {\n      if(rand_nums[i] <= percentage) {\n\t(*selected_indices)[j] = i;\n\tj++;\n      }\n    }\n    \n    return num_selected;\n  }  \n\n\n  void MakeSubMatrixByColumns(Vector column_indices, Matrix A, Matrix *A_sub) {\n\n    index_t num_selected = column_indices.length();\n\n    A_sub->Init(A.n_rows(), num_selected);\n\n    for(index_t i = 0; i < num_selected; i++) {\n      index_t index = (index_t)column_indices[i];\n      Vector A_col_index_i, A_sub_col_i;\n      A.MakeColumnVector(index, &A_col_index_i);\n      A_sub->MakeColumnVector(i, &A_sub_col_i);\n      A_sub_col_i.CopyValues(A_col_index_i);\n    }\n  }\n\n  \n  \n  \n}\n\n\n\n\n\nint main(int argc, char *argv[]) {\n  fx_init(argc, argv);\n\n  srand(time(0));\n  srand48(time(0));\n  \/*\n  const char *data = fx_param_str(NULL, \"data\", NULL);\n\n  Matrix X, X_centered, whitening, X_whitened;\n  data::Load(data, &X);\n\n  index_t d = X.n_rows(); \/\/ number of dimensions\n  index_t n = X.n_cols(); \/\/ number of points\n\n  printf(\"d = %d, n = %d\\n\", d, n);\n\n\n  \n  X_centered.Init(d, n);\n  X_whitened.Init(d, n);\n  whitening.Init(d, d);\n  \n\n  printf(\"centering\\n\");\n  Center(X, X_centered);\n \n\n\n  printf(\"whitening\\n\");\n\n  Whiten(X_centered, whitening, X_whitened);\n\n\n  double tolerance = 1e-4;\n\n  Matrix post_whitening_W_transpose;\n  post_whitening_W_transpose.Init(d, d);\n  \n\n\n  \/\/DeflationICA(X_whitened, KURTOSIS, tolerance, post_whitening_W_transpose);\n\n  SymmetricICA(X_whitened, KURTOSIS, tolerance, post_whitening_W_transpose);\n  \n  Matrix post_whitening_W;\n  la::TransposeInit(post_whitening_W_transpose, &post_whitening_W);\n\n\n\n\n  Matrix W;\n  la::MulInit(post_whitening_W, whitening, &W);\n\n\n  Matrix Y;\n  la::MulInit(post_whitening_W, X_whitened, &Y);\n      \n  \/\/SaveCorrectly(\"post_whitening_W.dat\", post_whitening_W);  \n  \/\/SaveCorrectly(\"whitening.dat\", whitening);\n\n  SaveCorrectly(\"W.dat\", W);\n\n  \/\/SaveCorrectly(\"X_centered.dat\", X_centered);\n  SaveCorrectly(\"X_whitened.dat\", X_whitened);\n  SaveCorrectly(\"Y.dat\", Y);\n  \n\n  \/\/fx_done();\n  *\/\n\n  Matrix A;\n  A.Init(4,10);\n  for(int i = 0;  i < 4; i++) {\n    for(int j = 0; j < 10; j++) {\n      A.set(i, j, (j * 10) + i);\n    }\n  }\n\n\n  Vector selected_indices;\n  index_t num_selected = GetSamples(10, .5, &selected_indices);\n\n  Matrix A_sub;\n  MakeSubMatrixByColumns(selected_indices, A, &A_sub);\n\n  A.PrintDebug(\"A\");\n\n  selected_indices.PrintDebug(\"selected indices\");\n\n  printf(\"num_selected = %d\\n\", num_selected);\n\n  A_sub.PrintDebug(\"A_sub\");\n\n\n  \n\n  \n    \n  return 0;\n}\n<commit_msg>deleted old fastica -nishant<commit_after><|endoftext|>"}
{"text":"<commit_before>#include <cmath>\n#include <cstdint>\n#include <cstdlib>\n#include \"constants.h\"\n#include \"fork_motor_controller.h\"\n#include \"MPU6050.h\"\n#include \"SystemState.h\"\n\nnamespace hardware {\n\nconst uint8_t ccr_channel = 2;                 \/\/ PWM Channel 2\nconst float max_current = 6.0f;                \/\/ Copley Controls ACJ-055-18\nconst float torque_constant = 106.459f * constants::Nm_per_ozfin;\nconst float max_steer_angle = 45.0f * constants::rad_per_degree;\n\nForkMotorController::ForkMotorController()\n  : MotorController(\"Fork\"),\n  e_(STM32_TIM3, constants::fork_counts_per_revolution),\n  m_(GPIOF, GPIOF_STEER_DIR, GPIOF_STEER_ENABLE, GPIOF_STEER_FAULT,\n     STM32_TIM1, ccr_channel, max_current, torque_constant),\n  derivative_filter_{0, 10*2*constants::pi,\n                     10*2*constants::pi, constants::loop_period_s},\n  yaw_rate_command_{0.0f},\n  x_pi_{0.0f},\n  estimation_threshold_{-1.0f \/ constants::wheel_radius},\n  estimation_triggered_{false},\n  control_triggered_{false},\n  control_delay_{10u}\n{\n  instances[fork] = this;\n}\n\nForkMotorController::~ForkMotorController()\n{\n  instances[fork] = 0;\n}\n\nvoid ForkMotorController::set_reference(float yaw_rate)\n{\n  yaw_rate_command_ = yaw_rate;\n}\n\nvoid ForkMotorController::set_estimation_threshold(float speed)\n{\n  estimation_threshold_  = speed \/ -constants::wheel_radius;\n}\n\nvoid ForkMotorController::set_control_delay(uint32_t N)\n{\n  control_delay_= N;\n}\n\nvoid ForkMotorController::disable()\n{\n  m_.disable();\n}\n\nvoid ForkMotorController::enable()\n{\n  m_.enable();\n}\n\nvoid ForkMotorController::set_estimation_threshold_shell(BaseSequentialStream *chp,\n                                                         int argc, char *argv[])\n{\n  if (argc == 1) {\n      ForkMotorController* fmc = reinterpret_cast<ForkMotorController*>(instances[fork]);\n      if (fmc) {\n        fmc->set_estimation_threshold(tofloat(argv[0]));\n        chprintf(chp, \"%s estimation threshold set to %f.\\r\\n\", fmc->name(),\n                 fmc->estimation_threshold_);\n      } else {\n        chprintf(chp, \"Enable collection before setting estimation threshold.\\r\\n\");\n      }\n  } else {\n    chprintf(chp, \"Invalid usage.\\r\\n\");\n  }\n}\n\nvoid ForkMotorController::set_control_delay_shell(BaseSequentialStream *chp,\n                                                  int argc, char *argv[])\n{\n  if (argc == 1) {\n      ForkMotorController* fmc = reinterpret_cast<ForkMotorController*>(instances[fork]);\n      if (fmc) {\n        uint32_t N = std::atoi(argv[0]);\n        fmc->set_control_delay(N);\n        chprintf(chp, \"%s control delay set to begin %u samples after estimation.\\r\\n\", fmc->name(),\n                 fmc->control_delay_);\n      } else {\n        chprintf(chp, \"Enable collection before setting control threshold.\\r\\n\");\n      }\n  } else {\n    chprintf(chp, \"Invalid usage.\\r\\n\");\n  }\n}\n\nvoid ForkMotorController::set_thresholds_shell(BaseSequentialStream *chp,\n                                               int argc, char *argv[])\n{\n  if (argc == 2) {\n    ForkMotorController* fmc = reinterpret_cast<ForkMotorController*>(instances[fork]);\n    fmc->set_estimation_threshold(tofloat(argv[0]));\n    uint32_t N = std::atoi(argv[0]);\n    fmc->set_control_delay(N);\n    chprintf(chp, \"%s estimation threshold set to %f.\\r\\n\", fmc->name(),\n             fmc->estimation_threshold_);\n    chprintf(chp, \"%s control delay set to begin %u samples after estimation.\\r\\n\",\n             fmc->name(), fmc->control_delay_);\n  } else {\n    chprintf(chp, \"Invalid usage.\\r\\n\");\n  }\n}\n\nvoid ForkMotorController::update(Sample & s)\n{\n  s.encoder.steer = e_.get_angle();\n  s.encoder.steer_rate = derivative_filter_.output(s.encoder.steer);\n  derivative_filter_.update(s.encoder.steer); \/\/ update for next iteration\n\n  s.set_point.psi_dot = yaw_rate_command_;\n  s.yaw_rate_pi.e = s.set_point.psi_dot - MPU6050::psi_dot(s);\n  x_pi_ += s.yaw_rate_pi.e;\n  s.yaw_rate_pi.x = x_pi_;\n\n  s.motor_torque.desired_steer = 0.0f;\n  if (should_estimate(s) && fork_control_.set_sample(s)) {\n    const float torque = fork_control_.compute_updated_torque(m_.get_torque());\n    if (should_control(s)) {\n      s.motor_torque.desired_steer = torque;\n      m_.set_torque(torque);\n    } else {\n      m_.set_torque(0.0f);\n    }\n  } else {\n    m_.set_torque(0.0f);\n  }\n  s.motor_torque.steer = m_.get_torque();\n\n  if (e_.rotation_direction())\n    s.system_state |= systemstate::SteerEncoderDir;\n  if (m_.is_enabled())\n    s.system_state |= systemstate::SteerMotorEnable;\n  if (m_.has_fault())\n    s.system_state |= systemstate::SteerMotorFault;\n  if (m_.current_direction())\n    s.system_state |= systemstate::SteerMotorCurrentDir;\n  s.threshold.estimation = estimation_threshold_;\n  s.threshold.control = 0.0f; \/\/  control_threshold_;\n  s.has_threshold = true;\n}\n\n\/\/ estimation\/control thresholds are in terms of wheel rate, which is defined\n\/\/ to be negative when the speed of the bicycle is positive. estimation\/control\n\/\/ should occur when speed > threshold which is equivalent to rate < threshold.\nbool ForkMotorController::should_estimate(const Sample& s)\n{\n  if (!estimation_triggered_) {\n    estimation_triggered_ = s.encoder.rear_wheel_rate < estimation_threshold_;\n    fork_control_.set_state(s.gyro_lean.angle, s.encoder.steer,\n                            s.mpu6050.gyroscope_y, s.encoder.steer_rate);\n  }\n  return estimation_triggered_;\n}\n\nbool ForkMotorController::should_control(const Sample& s)\n{\n  if (!control_triggered_)\n    control_triggered_ = --control_delay_ == 0;\n  return control_triggered_ && std::abs(s.encoder.steer) < max_steer_angle;\n}\n\n} \/\/ namespace hardware\n<commit_msg>Initial lean angle estimate set to zero.<commit_after>#include <cmath>\n#include <cstdint>\n#include <cstdlib>\n#include \"constants.h\"\n#include \"fork_motor_controller.h\"\n#include \"MPU6050.h\"\n#include \"SystemState.h\"\n\nnamespace hardware {\n\nconst uint8_t ccr_channel = 2;                 \/\/ PWM Channel 2\nconst float max_current = 6.0f;                \/\/ Copley Controls ACJ-055-18\nconst float torque_constant = 106.459f * constants::Nm_per_ozfin;\nconst float max_steer_angle = 45.0f * constants::rad_per_degree;\n\nForkMotorController::ForkMotorController()\n  : MotorController(\"Fork\"),\n  e_(STM32_TIM3, constants::fork_counts_per_revolution),\n  m_(GPIOF, GPIOF_STEER_DIR, GPIOF_STEER_ENABLE, GPIOF_STEER_FAULT,\n     STM32_TIM1, ccr_channel, max_current, torque_constant),\n  derivative_filter_{0, 10*2*constants::pi,\n                     10*2*constants::pi, constants::loop_period_s},\n  yaw_rate_command_{0.0f},\n  x_pi_{0.0f},\n  estimation_threshold_{-1.0f \/ constants::wheel_radius},\n  estimation_triggered_{false},\n  control_triggered_{false},\n  control_delay_{10u}\n{\n  instances[fork] = this;\n}\n\nForkMotorController::~ForkMotorController()\n{\n  instances[fork] = 0;\n}\n\nvoid ForkMotorController::set_reference(float yaw_rate)\n{\n  yaw_rate_command_ = yaw_rate;\n}\n\nvoid ForkMotorController::set_estimation_threshold(float speed)\n{\n  estimation_threshold_  = speed \/ -constants::wheel_radius;\n}\n\nvoid ForkMotorController::set_control_delay(uint32_t N)\n{\n  control_delay_= N;\n}\n\nvoid ForkMotorController::disable()\n{\n  m_.disable();\n}\n\nvoid ForkMotorController::enable()\n{\n  m_.enable();\n}\n\nvoid ForkMotorController::set_estimation_threshold_shell(BaseSequentialStream *chp,\n                                                         int argc, char *argv[])\n{\n  if (argc == 1) {\n      ForkMotorController* fmc = reinterpret_cast<ForkMotorController*>(instances[fork]);\n      if (fmc) {\n        fmc->set_estimation_threshold(tofloat(argv[0]));\n        chprintf(chp, \"%s estimation threshold set to %f.\\r\\n\", fmc->name(),\n                 fmc->estimation_threshold_);\n      } else {\n        chprintf(chp, \"Enable collection before setting estimation threshold.\\r\\n\");\n      }\n  } else {\n    chprintf(chp, \"Invalid usage.\\r\\n\");\n  }\n}\n\nvoid ForkMotorController::set_control_delay_shell(BaseSequentialStream *chp,\n                                                  int argc, char *argv[])\n{\n  if (argc == 1) {\n      ForkMotorController* fmc = reinterpret_cast<ForkMotorController*>(instances[fork]);\n      if (fmc) {\n        uint32_t N = std::atoi(argv[0]);\n        fmc->set_control_delay(N);\n        chprintf(chp, \"%s control delay set to begin %u samples after estimation.\\r\\n\", fmc->name(),\n                 fmc->control_delay_);\n      } else {\n        chprintf(chp, \"Enable collection before setting control threshold.\\r\\n\");\n      }\n  } else {\n    chprintf(chp, \"Invalid usage.\\r\\n\");\n  }\n}\n\nvoid ForkMotorController::set_thresholds_shell(BaseSequentialStream *chp,\n                                               int argc, char *argv[])\n{\n  if (argc == 2) {\n    ForkMotorController* fmc = reinterpret_cast<ForkMotorController*>(instances[fork]);\n    fmc->set_estimation_threshold(tofloat(argv[0]));\n    uint32_t N = std::atoi(argv[0]);\n    fmc->set_control_delay(N);\n    chprintf(chp, \"%s estimation threshold set to %f.\\r\\n\", fmc->name(),\n             fmc->estimation_threshold_);\n    chprintf(chp, \"%s control delay set to begin %u samples after estimation.\\r\\n\",\n             fmc->name(), fmc->control_delay_);\n  } else {\n    chprintf(chp, \"Invalid usage.\\r\\n\");\n  }\n}\n\nvoid ForkMotorController::update(Sample & s)\n{\n  s.encoder.steer = e_.get_angle();\n  s.encoder.steer_rate = derivative_filter_.output(s.encoder.steer);\n  derivative_filter_.update(s.encoder.steer); \/\/ update for next iteration\n\n  s.set_point.psi_dot = yaw_rate_command_;\n  s.yaw_rate_pi.e = s.set_point.psi_dot - MPU6050::psi_dot(s);\n  x_pi_ += s.yaw_rate_pi.e;\n  s.yaw_rate_pi.x = x_pi_;\n\n  s.motor_torque.desired_steer = 0.0f;\n  if (should_estimate(s) && fork_control_.set_sample(s)) {\n    const float torque = fork_control_.compute_updated_torque(m_.get_torque());\n    if (should_control(s)) {\n      s.motor_torque.desired_steer = torque;\n      m_.set_torque(torque);\n    } else {\n      m_.set_torque(0.0f);\n    }\n  } else {\n    m_.set_torque(0.0f);\n  }\n  s.motor_torque.steer = m_.get_torque();\n\n  if (e_.rotation_direction())\n    s.system_state |= systemstate::SteerEncoderDir;\n  if (m_.is_enabled())\n    s.system_state |= systemstate::SteerMotorEnable;\n  if (m_.has_fault())\n    s.system_state |= systemstate::SteerMotorFault;\n  if (m_.current_direction())\n    s.system_state |= systemstate::SteerMotorCurrentDir;\n  s.threshold.estimation = estimation_threshold_;\n  s.threshold.control = 0.0f; \/\/  control_threshold_;\n  s.has_threshold = true;\n}\n\n\/\/ estimation\/control thresholds are in terms of wheel rate, which is defined\n\/\/ to be negative when the speed of the bicycle is positive. estimation\/control\n\/\/ should occur when speed > threshold which is equivalent to rate < threshold.\nbool ForkMotorController::should_estimate(const Sample& s)\n{\n  if (!estimation_triggered_) {\n    estimation_triggered_ = s.encoder.rear_wheel_rate < estimation_threshold_;\n    fork_control_.set_state(0.0f, s.encoder.steer,\n                            s.mpu6050.gyroscope_y, s.encoder.steer_rate);\n  }\n  return estimation_triggered_;\n}\n\nbool ForkMotorController::should_control(const Sample& s)\n{\n  if (!control_triggered_)\n    control_triggered_ = --control_delay_ == 0;\n  return control_triggered_ && std::abs(s.encoder.steer) < max_steer_angle;\n}\n\n} \/\/ namespace hardware\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 <stdint.h>\n#include <sys\/mman.h>\n#include <unistd.h>\n#include \"pagemanager.h\"\n#include <fnordmetric\/environment.h>\n#include <fnordmetric\/io\/file.h>\n#include <fnordmetric\/io\/fileutil.h>\n\nnamespace fnord {\nnamespace io {\n\nPageManager::PageManager(\n  size_t block_size,\n  size_t end_pos \/* = 0 *\/) :\n  end_pos_(end_pos),\n  block_size_(block_size) {}\n\n\/\/PageManager::PageManager(size_t block_size, const LogSnapshot& log_snapshot) :\n\/\/  block_size_(block_size),\n\/\/  end_pos_(log_snapshot.last_used_byte) {}\n\nPageManager::PageManager(const PageManager&& move) :\n  end_pos_(move.end_pos_),\n  block_size_(move.block_size_),\n  freelist_(std::move(move.freelist_)) {}\n\nPageManager::Page PageManager::allocPage(size_t min_size) {\n  PageManager::Page page;\n\n  \/* align the request size to the next largest block boundary *\/\n  uint64_t min_size_aligned =\n      ((min_size + block_size_ - 1) \/ block_size_) * block_size_;\n\n  mutex_.lock();\n  if (!findFreePage(min_size_aligned, &page)) {\n    page.offset = end_pos_;\n    page.size   = min_size_aligned;\n    end_pos_   += page.size;\n  }\n  mutex_.unlock();\n\n  return page;\n}\n\n\/\/ FIXPAUL: proper freelist implementation\nvoid PageManager::freePage(const PageManager::Page& page) {\n  mutex_.lock();\n  freelist_.emplace_back(std::make_pair(page.size, page.offset));\n  mutex_.unlock();\n}\n\n\/\/ FIXPAUL: proper freelist implementation\nbool PageManager::findFreePage(size_t min_size, Page* destination) {\n  for (auto iter = freelist_.begin(); iter != freelist_.end(); ++iter) {\n    if (std::get<0>(*iter) >= min_size) {\n      destination->offset = std::get<1>(*iter);\n      destination->size   = std::get<0>(*iter);\n      \/\/destination->used   = 0;\n      freelist_.erase(iter);\n      return true;\n    }\n  }\n\n  return false;\n}\n\nPageManager::Page::Page(uint64_t offset_, uint64_t size_) :\n    offset(offset_),\n    size(size_) {}\n\nPageManager::Page::Page() : offset(0), size(0) {}\n\nPageManager::PageRef::PageRef(const PageManager::Page& page) :\n    page_(page) {}\n\nvoid* PageManager::PageRef::operator*() const {\n  return getPtr();\n}\n\nPageManager::PageRef::~PageRef() {};\n\nMmapPageManager::MmapPageManager(\n    const std::string& filename,\n    size_t file_size) :\n    PageManager(1, file_size),\n    filename_(filename),\n    file_size_(file_size),\n    used_bytes_(file_size),\n    current_mapping_(nullptr) {\n  sys_page_size_ = sysconf(_SC_PAGESIZE);\n}\n\nMmapPageManager::MmapPageManager(MmapPageManager&& move) :\n    PageManager(std::move(move)),\n    filename_(move.filename_),\n    file_size_(move.file_size_),\n    used_bytes_(move.used_bytes_),\n    current_mapping_(move.current_mapping_),\n    sys_page_size_(move.sys_page_size_) {\n  move.file_size_ = 0;\n  move.used_bytes_ = 0;\n  move.current_mapping_ = nullptr;\n}\n\nMmapPageManager::~MmapPageManager() {\n  if (current_mapping_ != nullptr) {\n    current_mapping_->decrRefs();\n  }\n}\n\nvoid MmapPageManager::shrinkFile() {\n  FileUtil::truncate(filename_, used_bytes_);\n}\n\nstd::unique_ptr<PageManager::PageRef> MmapPageManager::getPage(\n    const PageManager::Page& page) {\n  return getPageImpl(page, true);\n}\n\nstd::unique_ptr<PageManager::PageRef> MmapPageManager::getPage(\n    const PageManager::Page& page,\n    kNoPadding no_padding) {\n  return getPageImpl(page, false);\n}\n\nstd::unique_ptr<PageManager::PageRef> MmapPageManager::getPageImpl(\n    const PageManager::Page& page,\n    bool allow_padding) {\n  uint64_t last_byte = page.offset + page.size;\n\n  mmap_mutex_.lock();\n\n  if (last_byte > used_bytes_) {\n    used_bytes_ = last_byte;\n  }\n\n  if (last_byte > file_size_) {\n    size_t new_size;\n    if (allow_padding) {\n      new_size = ((last_byte \/ kMmapSizeMultiplier) + 1) * kMmapSizeMultiplier;\n    } else {\n      new_size = last_byte;\n    }\n\n    if (fnordmetric::env()->verbose()) {\n      fnordmetric::env()->logger()->printf(\n          \"DEBUG\",\n          \"Truncating file %s to %lu bytes\",\n          filename_.c_str(),\n          (long unsigned) new_size);\n    }\n\n    FileUtil::truncate(filename_, new_size);\n    file_size_ = new_size;\n  }\n\n  auto page_ref = new MmappedPageRef(\n      page,\n      getMmappedFile(last_byte),\n      sys_page_size_);\n\n  mmap_mutex_.unlock();\n\n  return std::unique_ptr<PageManager::PageRef>(page_ref);\n}\n\nMmapPageManager::MmappedFile* MmapPageManager::getMmappedFile(\n    uint64_t last_byte) {\n  if (current_mapping_ == nullptr || last_byte > current_mapping_->size) {\n    \/* align mmap size to the next larger block boundary *\/\n    auto file = fnord::io::File::openFile(\n        filename_,\n        File::O_READ | File::O_WRITE);\n\n    auto mmap_size = file.size();\n\n    void* addr = mmap(\n        nullptr,\n        mmap_size,\n        PROT_WRITE | PROT_READ,\n        MAP_SHARED,\n        file.fd(),\n        0);\n\n    if (addr == MAP_FAILED) {\n      RAISE(kMallocError, \"mmap() failed\");\n    }\n\n    if (current_mapping_ != nullptr) {\n      current_mapping_->decrRefs();\n    }\n\n    current_mapping_ = new MmappedFile(addr, mmap_size);\n  }\n\n  return current_mapping_;\n}\n\nMmapPageManager::MmappedFile::MmappedFile(\n  void* __data,\n  const size_t __size) :\n  data(__data),\n  size(__size),\n  refs(1) {}\n\nMmapPageManager::MmappedFile::~MmappedFile() {\n  munmap(data, size);\n}\n\nvoid MmapPageManager::MmappedFile::incrRefs() {\n  refs++;\n}\n\nvoid MmapPageManager::MmappedFile::decrRefs() {\n  if (refs.fetch_sub(1) == 1) {\n    assert(refs.load() == 0);\n    delete this;\n  }\n}\n\nMmapPageManager::MmappedPageRef::MmappedPageRef(\n    const PageManager::Page& page,\n    MmappedFile* file,\n    size_t sys_page_size) :\n    PageRef(page),\n    file_(file),\n    sys_page_size_(sys_page_size) {\n  file_->incrRefs();\n}\n\nMmapPageManager::MmappedPageRef::MmappedPageRef(\n    MmapPageManager::MmappedPageRef&& move) :\n    PageRef(move.page_),\n    file_(move.file_),\n    sys_page_size_(move.sys_page_size_) {\n  move.file_ = nullptr;\n}\n\nvoid* MmapPageManager::MmappedPageRef::getPtr() const {\n  return file_->data;\n}\n\nvoid MmapPageManager::MmappedPageRef::sync(bool async \/* = false *\/) const {\n  uintptr_t ptr = (uintptr_t) ((char *) getPtr()) + page_.offset;\n  auto sptr = (ptr \/ (sys_page_size_)) * sys_page_size_;\n  auto ssize = page_.size + (ptr - sptr);\n  msync((void *) sptr, ssize, async ? MS_SYNC : MS_ASYNC);\n}\n\nMmapPageManager::MmappedPageRef::~MmappedPageRef() {\n  file_->decrRefs();\n}\n\n}\n}\n<commit_msg>fixes<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 <stdint.h>\n#include <sys\/mman.h>\n#include <unistd.h>\n#include \"pagemanager.h\"\n#include <fnordmetric\/environment.h>\n#include <fnordmetric\/io\/file.h>\n#include <fnordmetric\/io\/fileutil.h>\n\nnamespace fnord {\nnamespace io {\n\nPageManager::PageManager(\n  size_t block_size,\n  size_t end_pos \/* = 0 *\/) :\n  end_pos_(end_pos),\n  block_size_(block_size) {}\n\n\/\/PageManager::PageManager(size_t block_size, const LogSnapshot& log_snapshot) :\n\/\/  block_size_(block_size),\n\/\/  end_pos_(log_snapshot.last_used_byte) {}\n\nPageManager::PageManager(const PageManager&& move) :\n  end_pos_(move.end_pos_),\n  block_size_(move.block_size_),\n  freelist_(std::move(move.freelist_)) {}\n\nPageManager::Page PageManager::allocPage(size_t min_size) {\n  PageManager::Page page;\n\n  \/* align the request size to the next largest block boundary *\/\n  uint64_t min_size_aligned =\n      ((min_size + block_size_ - 1) \/ block_size_) * block_size_;\n\n  mutex_.lock();\n  if (!findFreePage(min_size_aligned, &page)) {\n    page.offset = end_pos_;\n    page.size   = min_size_aligned;\n    end_pos_   += page.size;\n  }\n  mutex_.unlock();\n\n  return page;\n}\n\n\/\/ FIXPAUL: proper freelist implementation\nvoid PageManager::freePage(const PageManager::Page& page) {\n  mutex_.lock();\n  freelist_.emplace_back(std::make_pair(page.size, page.offset));\n  mutex_.unlock();\n}\n\n\/\/ FIXPAUL: proper freelist implementation\nbool PageManager::findFreePage(size_t min_size, Page* destination) {\n  for (auto iter = freelist_.begin(); iter != freelist_.end(); ++iter) {\n    if (std::get<0>(*iter) >= min_size) {\n      destination->offset = std::get<1>(*iter);\n      destination->size   = std::get<0>(*iter);\n      \/\/destination->used   = 0;\n      freelist_.erase(iter);\n      return true;\n    }\n  }\n\n  return false;\n}\n\nPageManager::Page::Page(uint64_t offset_, uint64_t size_) :\n    offset(offset_),\n    size(size_) {}\n\nPageManager::Page::Page() : offset(0), size(0) {}\n\nPageManager::PageRef::PageRef(const PageManager::Page& page) :\n    page_(page) {}\n\nvoid* PageManager::PageRef::operator*() const {\n  return getPtr();\n}\n\nPageManager::PageRef::~PageRef() {};\n\nMmapPageManager::MmapPageManager(\n    const std::string& filename,\n    size_t file_size) :\n    PageManager(1, file_size),\n    filename_(filename),\n    file_size_(file_size),\n    used_bytes_(file_size),\n    current_mapping_(nullptr) {\n  sys_page_size_ = sysconf(_SC_PAGESIZE);\n}\n\nMmapPageManager::MmapPageManager(MmapPageManager&& move) :\n    PageManager(std::move(move)),\n    filename_(move.filename_),\n    file_size_(move.file_size_),\n    used_bytes_(move.used_bytes_),\n    current_mapping_(move.current_mapping_),\n    sys_page_size_(move.sys_page_size_) {\n  move.file_size_ = 0;\n  move.used_bytes_ = 0;\n  move.current_mapping_ = nullptr;\n}\n\nMmapPageManager::~MmapPageManager() {\n  if (current_mapping_ != nullptr) {\n    current_mapping_->decrRefs();\n  }\n}\n\nvoid MmapPageManager::shrinkFile() {\n  FileUtil::truncate(filename_, used_bytes_);\n  file_size_ = used_bytes_;\n}\n\nstd::unique_ptr<PageManager::PageRef> MmapPageManager::getPage(\n    const PageManager::Page& page) {\n  return getPageImpl(page, true);\n}\n\nstd::unique_ptr<PageManager::PageRef> MmapPageManager::getPage(\n    const PageManager::Page& page,\n    kNoPadding no_padding) {\n  return getPageImpl(page, false);\n}\n\nstd::unique_ptr<PageManager::PageRef> MmapPageManager::getPageImpl(\n    const PageManager::Page& page,\n    bool allow_padding) {\n  uint64_t last_byte = page.offset + page.size;\n\n  mmap_mutex_.lock();\n\n  if (last_byte > used_bytes_) {\n    used_bytes_ = last_byte;\n  }\n\n  if (last_byte > file_size_) {\n    size_t new_size;\n    if (allow_padding) {\n      new_size = ((last_byte \/ kMmapSizeMultiplier) + 1) * kMmapSizeMultiplier;\n    } else {\n      new_size = last_byte;\n    }\n\n    if (fnordmetric::env()->verbose()) {\n      fnordmetric::env()->logger()->printf(\n          \"DEBUG\",\n          \"Truncating file %s to %lu bytes\",\n          filename_.c_str(),\n          (long unsigned) new_size);\n    }\n\n    FileUtil::truncate(filename_, new_size);\n    file_size_ = new_size;\n  }\n\n  auto page_ref = new MmappedPageRef(\n      page,\n      getMmappedFile(last_byte),\n      sys_page_size_);\n\n  mmap_mutex_.unlock();\n\n  return std::unique_ptr<PageManager::PageRef>(page_ref);\n}\n\nMmapPageManager::MmappedFile* MmapPageManager::getMmappedFile(\n    uint64_t last_byte) {\n  if (current_mapping_ == nullptr || last_byte > current_mapping_->size) {\n    \/* align mmap size to the next larger block boundary *\/\n    auto file = fnord::io::File::openFile(\n        filename_,\n        File::O_READ | File::O_WRITE);\n\n    auto mmap_size = file.size();\n\n    void* addr = mmap(\n        nullptr,\n        mmap_size,\n        PROT_WRITE | PROT_READ,\n        MAP_SHARED,\n        file.fd(),\n        0);\n\n    if (addr == MAP_FAILED) {\n      RAISE(kMallocError, \"mmap() failed\");\n    }\n\n    if (current_mapping_ != nullptr) {\n      current_mapping_->decrRefs();\n    }\n\n    current_mapping_ = new MmappedFile(addr, mmap_size);\n  }\n\n  return current_mapping_;\n}\n\nMmapPageManager::MmappedFile::MmappedFile(\n  void* __data,\n  const size_t __size) :\n  data(__data),\n  size(__size),\n  refs(1) {}\n\nMmapPageManager::MmappedFile::~MmappedFile() {\n  munmap(data, size);\n}\n\nvoid MmapPageManager::MmappedFile::incrRefs() {\n  refs++;\n}\n\nvoid MmapPageManager::MmappedFile::decrRefs() {\n  if (refs.fetch_sub(1) == 1) {\n    assert(refs.load() == 0);\n    delete this;\n  }\n}\n\nMmapPageManager::MmappedPageRef::MmappedPageRef(\n    const PageManager::Page& page,\n    MmappedFile* file,\n    size_t sys_page_size) :\n    PageRef(page),\n    file_(file),\n    sys_page_size_(sys_page_size) {\n  file_->incrRefs();\n}\n\nMmapPageManager::MmappedPageRef::MmappedPageRef(\n    MmapPageManager::MmappedPageRef&& move) :\n    PageRef(move.page_),\n    file_(move.file_),\n    sys_page_size_(move.sys_page_size_) {\n  move.file_ = nullptr;\n}\n\nvoid* MmapPageManager::MmappedPageRef::getPtr() const {\n  return file_->data;\n}\n\nvoid MmapPageManager::MmappedPageRef::sync(bool async \/* = false *\/) const {\n  uintptr_t ptr = (uintptr_t) ((char *) getPtr()) + page_.offset;\n  auto sptr = (ptr \/ (sys_page_size_)) * sys_page_size_;\n  auto ssize = page_.size + (ptr - sptr);\n  msync((void *) sptr, ssize, async ? MS_SYNC : MS_ASYNC);\n}\n\nMmapPageManager::MmappedPageRef::~MmappedPageRef() {\n  file_->decrRefs();\n}\n\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: toolbar.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: obo $ $Date: 2004-07-06 17:01:44 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n\/\/_________________________________________________________________________________________________________________\n\/\/  my own includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef __FRAMEWORK_UIELEMENT_TOOLBAR_HXX_\n#include <uielement\/toolbar.hxx>\n#endif\n\n#ifndef __FRAMEWORK_UIELEMENT_TOOLBARMANAGER_HXX_\n#include <uielement\/toolbarmanager.hxx>\n#endif\n\nnamespace framework\n{\n\nToolBar::ToolBar( Window* pParent, WinBits nWinBits ) :\n    ToolBox( pParent, nWinBits )\n    ,   m_pToolBarManager( 0 )\n{\n}\n\nToolBar::~ToolBar()\n{\n}\n\nvoid ToolBar::SetToolBarManager( ToolBarManager* pTbMgr )\n{\n    m_pToolBarManager = pTbMgr;\n}\n\nvoid ToolBar::Command( const CommandEvent& rCEvt )\n{\n    if ( m_aCommandHandler.IsSet() )\n        m_aCommandHandler.Call( (void *)( &rCEvt ));\n    ToolBox::Command( rCEvt );\n}\n\nvoid ToolBar::StateChanged( StateChangedType nType )\n{\n    ToolBox::StateChanged( nType );\n    if ( m_aStateChangedHandler.IsSet() )\n        m_aStateChangedHandler.Call( &nType );\n}\n\nvoid ToolBar::DataChanged( const DataChangedEvent& rDCEvt )\n{\n    ToolBox::DataChanged( rDCEvt );\n    if ( m_aDataChangedHandler.IsSet() )\n        m_aDataChangedHandler.Call( (void*)&rDCEvt );\n}\n\n}\n<commit_msg>INTEGRATION: CWS ooo19126 (1.2.288); FILE MERGED 2005\/09\/05 13:07:15 rt 1.2.288.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: toolbar.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 01:58: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\/\/_________________________________________________________________________________________________________________\n\/\/  my own includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef __FRAMEWORK_UIELEMENT_TOOLBAR_HXX_\n#include <uielement\/toolbar.hxx>\n#endif\n\n#ifndef __FRAMEWORK_UIELEMENT_TOOLBARMANAGER_HXX_\n#include <uielement\/toolbarmanager.hxx>\n#endif\n\nnamespace framework\n{\n\nToolBar::ToolBar( Window* pParent, WinBits nWinBits ) :\n    ToolBox( pParent, nWinBits )\n    ,   m_pToolBarManager( 0 )\n{\n}\n\nToolBar::~ToolBar()\n{\n}\n\nvoid ToolBar::SetToolBarManager( ToolBarManager* pTbMgr )\n{\n    m_pToolBarManager = pTbMgr;\n}\n\nvoid ToolBar::Command( const CommandEvent& rCEvt )\n{\n    if ( m_aCommandHandler.IsSet() )\n        m_aCommandHandler.Call( (void *)( &rCEvt ));\n    ToolBox::Command( rCEvt );\n}\n\nvoid ToolBar::StateChanged( StateChangedType nType )\n{\n    ToolBox::StateChanged( nType );\n    if ( m_aStateChangedHandler.IsSet() )\n        m_aStateChangedHandler.Call( &nType );\n}\n\nvoid ToolBar::DataChanged( const DataChangedEvent& rDCEvt )\n{\n    ToolBox::DataChanged( rDCEvt );\n    if ( m_aDataChangedHandler.IsSet() )\n        m_aDataChangedHandler.Call( (void*)&rDCEvt );\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: xmlnamespaces.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 02:05: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#include <xml\/xmlnamespaces.hxx>\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star::xml::sax;\nusing namespace ::com::sun::star::uno;\n\nconst OUString aXMLAttributeNamespace( RTL_CONSTASCII_USTRINGPARAM( \"xmlns\" ));\n\nnamespace framework\n{\n\nXMLNamespaces::XMLNamespaces()\n{\n}\n\nXMLNamespaces::XMLNamespaces( const XMLNamespaces& aXMLNamespaces )\n{\n    m_aDefaultNamespace = aXMLNamespaces.m_aDefaultNamespace;\n    m_aNamespaceMap = aXMLNamespaces.m_aNamespaceMap;\n}\n\nXMLNamespaces::~XMLNamespaces()\n{\n}\n\nvoid XMLNamespaces::addNamespace( const OUString& aName, const OUString& aValue ) throw( SAXException )\n{\n    NamespaceMap::iterator p;\n    OUString aNamespaceName( aName );\n    sal_Int32 nXMLNamespaceLength = aXMLAttributeNamespace.getLength();\n\n    \/\/ delete preceding \"xmlns\"\n    if ( aNamespaceName.compareTo( aXMLAttributeNamespace, nXMLNamespaceLength ) == 0 )\n    {\n        if ( aNamespaceName.getLength() == nXMLNamespaceLength )\n        {\n            aNamespaceName = OUString();\n        }\n        else if ( aNamespaceName.getLength() >= nXMLNamespaceLength+2 )\n        {\n            aNamespaceName = aNamespaceName.copy( nXMLNamespaceLength+1 );\n        }\n        else\n        {\n            \/\/ a xml namespace without name is not allowed (e.g. \"xmlns:\" )\n            OUString aErrorMessage( RTL_CONSTASCII_USTRINGPARAM( \"A xml namespace without name is not allowed!\" ));\n            throw SAXException( aErrorMessage, Reference< XInterface >(), Any() );\n        }\n    }\n\n    if ( aValue.getLength() == 0 && aNamespaceName.getLength() > 0 )\n    {\n        \/\/ namespace should be reseted - as xml draft states this is only allowed\n        \/\/ for the default namespace - check and throw exception if check fails\n        OUString aErrorMessage( RTL_CONSTASCII_USTRINGPARAM( \"Clearing xml namespace only allowed for default namespace!\" ));\n        throw SAXException( aErrorMessage, Reference< XInterface >(), Any() );\n    }\n    else\n    {\n        if ( aNamespaceName.getLength() == 0 )\n            m_aDefaultNamespace = aValue;\n        else\n        {\n            p = m_aNamespaceMap.find( aNamespaceName );\n            if ( p != m_aNamespaceMap.end() )\n            {\n                \/\/ replace current namespace definition\n                m_aNamespaceMap.erase( p );\n                m_aNamespaceMap.insert( NamespaceMap::value_type( aNamespaceName, aValue ));\n            }\n            else\n            {\n                m_aNamespaceMap.insert( NamespaceMap::value_type( aNamespaceName, aValue ));\n            }\n        }\n    }\n}\n\nOUString XMLNamespaces::applyNSToAttributeName( const OUString& aName ) const throw( SAXException )\n{\n    \/\/ xml draft: there is no default namespace for attributes!\n\n    int index;\n    if (( index = aName.indexOf( ':' )) > 0 )\n    {\n        if ( aName.getLength() > index+1 )\n        {\n            OUString aAttributeName = getNamespaceValue( aName.copy( 0, index ) );\n            aAttributeName += OUString::createFromAscii( \"^\" );\n            aAttributeName += aName.copy( index+1 );\n            return aAttributeName;\n        }\n        else\n        {\n            \/\/ attribute with namespace but without name \"namespace:\" is not allowed!!\n            OUString aErrorMessage( RTL_CONSTASCII_USTRINGPARAM( \"Attribute has no name only preceding namespace!\" ));\n            throw SAXException( aErrorMessage, Reference< XInterface >(), Any() );\n        }\n    }\n\n    return aName;\n}\n\nOUString XMLNamespaces::applyNSToElementName( const OUString& aName ) const throw( SAXException )\n{\n    \/\/ xml draft: element names can have a default namespace\n\n    int         index = aName.indexOf( ':' );\n    OUString    aNamespace;\n    OUString    aElementName = aName;\n\n    if ( index > 0 )\n        aNamespace = getNamespaceValue( aName.copy( 0, index ) );\n    else\n        aNamespace = m_aDefaultNamespace;\n\n    if ( aNamespace.getLength() > 0 )\n    {\n        aElementName = aNamespace;\n        aElementName += OUString::createFromAscii( \"^\" );\n    }\n    else\n        return aName;\n\n    if ( index > 0 )\n    {\n        if ( aName.getLength() > index+1 )\n            aElementName += aName.copy( index+1 );\n        else\n        {\n            \/\/ attribute with namespace but without a name is not allowed (e.g. \"cfg:\" )\n            OUString aErrorMessage( RTL_CONSTASCII_USTRINGPARAM( \"Attribute has no name only preceding namespace!\" ));\n            throw SAXException( aErrorMessage, Reference< XInterface >(), Any() );\n        }\n    }\n    else\n        aElementName += aName;\n\n    return aElementName;\n}\n\nOUString XMLNamespaces::getNamespaceValue( const OUString& aNamespace ) const throw( SAXException )\n{\n    if ( aNamespace.getLength() == 0 )\n        return m_aDefaultNamespace;\n    else\n    {\n        NamespaceMap::const_iterator p;\n        p = m_aNamespaceMap.find( aNamespace );\n        if ( p != m_aNamespaceMap.end() )\n            return p->second;\n        else\n        {\n            \/\/ namespace not defined => throw exception!\n            OUString aErrorMessage( RTL_CONSTASCII_USTRINGPARAM( \"XML namespace used but not defined!\" ));\n            throw SAXException( aErrorMessage, Reference< XInterface >(), Any() );\n        }\n    }\n}\n\n}\n<commit_msg>INTEGRATION: CWS pchfix02 (1.3.202); FILE MERGED 2006\/09\/01 17:29:35 kaib 1.3.202.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: xmlnamespaces.cxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-16 14:32: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_framework.hxx\"\n\n#include <xml\/xmlnamespaces.hxx>\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star::xml::sax;\nusing namespace ::com::sun::star::uno;\n\nconst OUString aXMLAttributeNamespace( RTL_CONSTASCII_USTRINGPARAM( \"xmlns\" ));\n\nnamespace framework\n{\n\nXMLNamespaces::XMLNamespaces()\n{\n}\n\nXMLNamespaces::XMLNamespaces( const XMLNamespaces& aXMLNamespaces )\n{\n    m_aDefaultNamespace = aXMLNamespaces.m_aDefaultNamespace;\n    m_aNamespaceMap = aXMLNamespaces.m_aNamespaceMap;\n}\n\nXMLNamespaces::~XMLNamespaces()\n{\n}\n\nvoid XMLNamespaces::addNamespace( const OUString& aName, const OUString& aValue ) throw( SAXException )\n{\n    NamespaceMap::iterator p;\n    OUString aNamespaceName( aName );\n    sal_Int32 nXMLNamespaceLength = aXMLAttributeNamespace.getLength();\n\n    \/\/ delete preceding \"xmlns\"\n    if ( aNamespaceName.compareTo( aXMLAttributeNamespace, nXMLNamespaceLength ) == 0 )\n    {\n        if ( aNamespaceName.getLength() == nXMLNamespaceLength )\n        {\n            aNamespaceName = OUString();\n        }\n        else if ( aNamespaceName.getLength() >= nXMLNamespaceLength+2 )\n        {\n            aNamespaceName = aNamespaceName.copy( nXMLNamespaceLength+1 );\n        }\n        else\n        {\n            \/\/ a xml namespace without name is not allowed (e.g. \"xmlns:\" )\n            OUString aErrorMessage( RTL_CONSTASCII_USTRINGPARAM( \"A xml namespace without name is not allowed!\" ));\n            throw SAXException( aErrorMessage, Reference< XInterface >(), Any() );\n        }\n    }\n\n    if ( aValue.getLength() == 0 && aNamespaceName.getLength() > 0 )\n    {\n        \/\/ namespace should be reseted - as xml draft states this is only allowed\n        \/\/ for the default namespace - check and throw exception if check fails\n        OUString aErrorMessage( RTL_CONSTASCII_USTRINGPARAM( \"Clearing xml namespace only allowed for default namespace!\" ));\n        throw SAXException( aErrorMessage, Reference< XInterface >(), Any() );\n    }\n    else\n    {\n        if ( aNamespaceName.getLength() == 0 )\n            m_aDefaultNamespace = aValue;\n        else\n        {\n            p = m_aNamespaceMap.find( aNamespaceName );\n            if ( p != m_aNamespaceMap.end() )\n            {\n                \/\/ replace current namespace definition\n                m_aNamespaceMap.erase( p );\n                m_aNamespaceMap.insert( NamespaceMap::value_type( aNamespaceName, aValue ));\n            }\n            else\n            {\n                m_aNamespaceMap.insert( NamespaceMap::value_type( aNamespaceName, aValue ));\n            }\n        }\n    }\n}\n\nOUString XMLNamespaces::applyNSToAttributeName( const OUString& aName ) const throw( SAXException )\n{\n    \/\/ xml draft: there is no default namespace for attributes!\n\n    int index;\n    if (( index = aName.indexOf( ':' )) > 0 )\n    {\n        if ( aName.getLength() > index+1 )\n        {\n            OUString aAttributeName = getNamespaceValue( aName.copy( 0, index ) );\n            aAttributeName += OUString::createFromAscii( \"^\" );\n            aAttributeName += aName.copy( index+1 );\n            return aAttributeName;\n        }\n        else\n        {\n            \/\/ attribute with namespace but without name \"namespace:\" is not allowed!!\n            OUString aErrorMessage( RTL_CONSTASCII_USTRINGPARAM( \"Attribute has no name only preceding namespace!\" ));\n            throw SAXException( aErrorMessage, Reference< XInterface >(), Any() );\n        }\n    }\n\n    return aName;\n}\n\nOUString XMLNamespaces::applyNSToElementName( const OUString& aName ) const throw( SAXException )\n{\n    \/\/ xml draft: element names can have a default namespace\n\n    int         index = aName.indexOf( ':' );\n    OUString    aNamespace;\n    OUString    aElementName = aName;\n\n    if ( index > 0 )\n        aNamespace = getNamespaceValue( aName.copy( 0, index ) );\n    else\n        aNamespace = m_aDefaultNamespace;\n\n    if ( aNamespace.getLength() > 0 )\n    {\n        aElementName = aNamespace;\n        aElementName += OUString::createFromAscii( \"^\" );\n    }\n    else\n        return aName;\n\n    if ( index > 0 )\n    {\n        if ( aName.getLength() > index+1 )\n            aElementName += aName.copy( index+1 );\n        else\n        {\n            \/\/ attribute with namespace but without a name is not allowed (e.g. \"cfg:\" )\n            OUString aErrorMessage( RTL_CONSTASCII_USTRINGPARAM( \"Attribute has no name only preceding namespace!\" ));\n            throw SAXException( aErrorMessage, Reference< XInterface >(), Any() );\n        }\n    }\n    else\n        aElementName += aName;\n\n    return aElementName;\n}\n\nOUString XMLNamespaces::getNamespaceValue( const OUString& aNamespace ) const throw( SAXException )\n{\n    if ( aNamespace.getLength() == 0 )\n        return m_aDefaultNamespace;\n    else\n    {\n        NamespaceMap::const_iterator p;\n        p = m_aNamespaceMap.find( aNamespace );\n        if ( p != m_aNamespaceMap.end() )\n            return p->second;\n        else\n        {\n            \/\/ namespace not defined => throw exception!\n            OUString aErrorMessage( RTL_CONSTASCII_USTRINGPARAM( \"XML namespace used but not defined!\" ));\n            throw SAXException( aErrorMessage, Reference< XInterface >(), Any() );\n        }\n    }\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2017.  All rights reserved\n *\/\n#include \"..\/StroikaPreComp.h\"\n\n#include \"..\/Characters\/Format.h\"\n#include \"..\/Characters\/StringBuilder.h\"\n#include \"..\/Characters\/ToString.h\"\n#include \"..\/Containers\/MultiSet.h\"\n#include \"..\/Debug\/Trace.h\"\n#include \"..\/Time\/Date.h\"\n#include \"..\/Time\/DateRange.h\"\n#include \"..\/Time\/DateTime.h\"\n#include \"..\/Time\/DateTimeRange.h\"\n#include \"..\/Time\/Duration.h\"\n#include \"..\/Time\/DurationRange.h\"\n\n#include \"ObjectVariantMapper.h\"\n\nusing namespace Stroika::Foundation;\nusing namespace Stroika::Foundation::DataExchange;\n\nusing Memory::Optional;\nusing Time::Date;\nusing Time::DateTime;\nusing Time::Duration;\nusing Time::TimeOfDay;\n\n\/\/ Comment this in to turn on aggressive noisy DbgTrace in this module\n\/\/#define   USE_NOISY_TRACE_IN_THIS_MODULE_       1\n\nnamespace {\n    template <typename T>\n    using FromObjectMapperType = ObjectVariantMapper::FromObjectMapperType<T>;\n    template <typename T>\n    using ToObjectMapperType = ObjectVariantMapper::ToObjectMapperType<T>;\n\n    using TypeMappingDetails = ObjectVariantMapper::TypeMappingDetails;\n}\n\n\/*\n ********************************************************************************\n **************** DataExchange::ObjectVariantMapper::TypeMappingDetails *********\n ********************************************************************************\n *\/\nString ObjectVariantMapper::TypeMappingDetails::ToString () const\n{\n    Characters::StringBuilder sb;\n    sb += L\"for-type: \" + Characters::ToString (fForType);\n    \/\/ @todo maybe also print function pointers? Not sure a good reason\n    return sb.str ();\n}\n\n\/*\n ********************************************************************************\n ****************** DataExchange::ObjectVariantMapper::TypesRegistry ************\n ********************************************************************************\n *\/\nString ObjectVariantMapper::TypesRegistry::ToString () const\n{\n    Characters::StringBuilder sb;\n    sb += L\"type-mappers: \" + Characters::ToString (fSerializers.Keys ()); \/\/ for now the values are not interesting\n    return sb.str ();\n}\n\n\/*\n ********************************************************************************\n ********************* DataExchange::ObjectVariantMapper ************************\n ********************************************************************************\n *\/\nnamespace {\n    template <typename T, typename UseVariantType>\n    TypeMappingDetails mkSerializerInfo_ ()\n    {\n        FromObjectMapperType<T> fromObjectMapper = [](const ObjectVariantMapper& mapper, const T* fromObjOfTypeT) -> VariantValue {\n            RequireNotNull (fromObjOfTypeT);\n            return VariantValue (static_cast<UseVariantType> (*fromObjOfTypeT));\n        };\n        ToObjectMapperType<T> toObjectMapper = [](const ObjectVariantMapper& mapper, const VariantValue& d, T* intoObjOfTypeT) -> void {\n            RequireNotNull (intoObjOfTypeT);\n            *intoObjOfTypeT = static_cast<T> (d.As<UseVariantType> ());\n        };\n        return TypeMappingDetails{typeid (T), fromObjectMapper, toObjectMapper};\n    }\n}\n\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer_ (const void*)\n{\n    FromObjectMapperType<void> fromObjectMapper = [](const ObjectVariantMapper& mapper, const void* fromObjOfTypeT) -> VariantValue {\n        return VariantValue{};\n    };\n    ToObjectMapperType<void> toObjectMapper = [](const ObjectVariantMapper& mapper, const VariantValue& d, void* intoObjOfTypeT) -> void {\n    };\n    return TypeMappingDetails{typeid (void), fromObjectMapper, toObjectMapper};\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<bool> ()\n{\n    return mkSerializerInfo_<bool, bool> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<signed char> ()\n{\n    return mkSerializerInfo_<signed char, signed char> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<short int> ()\n{\n    return mkSerializerInfo_<short int, short int> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<int> ()\n{\n    return mkSerializerInfo_<int, int> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<long int> ()\n{\n    return mkSerializerInfo_<long int, long int> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<long long int> ()\n{\n    return mkSerializerInfo_<long long int, long long int> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<unsigned char> ()\n{\n    return mkSerializerInfo_<unsigned char, unsigned char> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<unsigned short int> ()\n{\n    return mkSerializerInfo_<unsigned short int, unsigned short int> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<unsigned int> ()\n{\n    return mkSerializerInfo_<unsigned int, unsigned int> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<unsigned long int> ()\n{\n    return mkSerializerInfo_<unsigned long int, unsigned long int> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<unsigned long long int> ()\n{\n    return mkSerializerInfo_<unsigned long long int, unsigned long long int> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<float> ()\n{\n    return mkSerializerInfo_<float, float> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<double> ()\n{\n    return mkSerializerInfo_<double, double> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<long double> ()\n{\n    return mkSerializerInfo_<long double, long double> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<Time::Date> ()\n{\n    return mkSerializerInfo_<Time::Date, Time::Date> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<Time::DateTime> ()\n{\n    return mkSerializerInfo_<Time::DateTime, Time::DateTime> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<Characters::String> ()\n{\n    return mkSerializerInfo_<Characters::String, Characters::String> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<VariantValue> ()\n{\n    FromObjectMapperType<VariantValue> fromObjectMapper = [](const ObjectVariantMapper& mapper, const VariantValue* fromObjOfTypeT) -> VariantValue {\n        return *fromObjOfTypeT;\n    };\n    ToObjectMapperType<VariantValue> toObjectMapper = [](const ObjectVariantMapper& mapper, const VariantValue& d, VariantValue* intoObjOfTypeT) -> void {\n        *reinterpret_cast<VariantValue*> (intoObjOfTypeT) = d;\n    };\n    return TypeMappingDetails{typeid (VariantValue), fromObjectMapper, toObjectMapper};\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<Time::Duration> ()\n{\n    FromObjectMapperType<Time::Duration> fromObjectMapper = [](const ObjectVariantMapper& mapper, const Time::Duration* fromObjOfTypeT) -> VariantValue {\n        return VariantValue ((fromObjOfTypeT)->As<String> ());\n    };\n    ToObjectMapperType<Time::Duration> toObjectMapper = [](const ObjectVariantMapper& mapper, const VariantValue& d, Time::Duration* intoObjOfTypeT) -> void {\n        *intoObjOfTypeT = Duration (d.As<String> ());\n    };\n    return TypeMappingDetails{typeid (Duration), fromObjectMapper, toObjectMapper};\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<Time::TimeOfDay> ()\n{\n    FromObjectMapperType<Time::TimeOfDay> fromObjectMapper = [](const ObjectVariantMapper& mapper, const Time::TimeOfDay* fromObjOfTypeT) -> VariantValue {\n        return VariantValue (fromObjOfTypeT->GetAsSecondsCount ());\n    };\n    ToObjectMapperType<Time::TimeOfDay> toObjectMapper = [](const ObjectVariantMapper& mapper, const VariantValue& d, Time::TimeOfDay* intoObjOfTypeT) -> void {\n        *reinterpret_cast<TimeOfDay*> (intoObjOfTypeT) = TimeOfDay (d.As<uint32_t> ());\n    };\n    return TypeMappingDetails{typeid (TimeOfDay), fromObjectMapper, toObjectMapper};\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<Containers::Mapping<Characters::String, Characters::String>> ()\n{\n    using ACTUAL_ELEMENT_TYPE                                  = Mapping<String, String>;\n    FromObjectMapperType<ACTUAL_ELEMENT_TYPE> fromObjectMapper = [](const ObjectVariantMapper& mapper, const ACTUAL_ELEMENT_TYPE* fromObjOfTypeT) -> VariantValue {\n        Mapping<String, VariantValue> m;\n        for (auto i : *fromObjOfTypeT) {\n            \/\/ really could do either way - but second more efficient\n            \/\/m.Add (i.first, mapper.Serialize (typeid (String), reinterpret_cast<const Byte*> (&i.second)));\n            m.Add (i.fKey, i.fValue);\n        }\n        return VariantValue (m);\n    };\n    ToObjectMapperType<ACTUAL_ELEMENT_TYPE> toObjectMapper = [](const ObjectVariantMapper& mapper, const VariantValue& d, ACTUAL_ELEMENT_TYPE* intoObjOfTypeT) -> void {\n        Mapping<String, VariantValue> m = d.As<Mapping<String, VariantValue>> ();\n        intoObjOfTypeT->clear ();\n        for (auto i : m) {\n            \/\/ really could do either way - but second more efficient\n            \/\/actualInto->Add (i.first, mapper.ToObject<String> (i.second));\n            intoObjOfTypeT->Add (i.fKey, i.fValue.As<String> ());\n        }\n    };\n    return TypeMappingDetails{typeid (ACTUAL_ELEMENT_TYPE), fromObjectMapper, toObjectMapper};\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<Containers::Mapping<Characters::String, VariantValue>> ()\n{\n    using ACTUAL_ELEMENT_TYPE                                  = Mapping<String, VariantValue>;\n    FromObjectMapperType<ACTUAL_ELEMENT_TYPE> fromObjectMapper = [](const ObjectVariantMapper& mapper, const ACTUAL_ELEMENT_TYPE* fromObjOfTypeT) -> VariantValue {\n        return VariantValue (*fromObjOfTypeT);\n    };\n    ToObjectMapperType<ACTUAL_ELEMENT_TYPE> toObjectMapper = [](const ObjectVariantMapper& mapper, const VariantValue& d, ACTUAL_ELEMENT_TYPE* intoObjOfTypeT) -> void {\n        *intoObjOfTypeT = d.As<Mapping<String, VariantValue>> ();\n    };\n    return TypeMappingDetails{typeid (ACTUAL_ELEMENT_TYPE), fromObjectMapper, toObjectMapper};\n}\n\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer_ (const IO::Network::URL*, IO::Network::URL::ParseOptions parseOptions)\n{\n    using T                                  = IO::Network::URL;\n    FromObjectMapperType<T> fromObjectMapper = [](const ObjectVariantMapper& mapper, const T* fromObjOfTypeT) -> VariantValue {\n        return VariantValue (fromObjOfTypeT->GetFullURL ());\n    };\n    ToObjectMapperType<T> toObjectMapper = [parseOptions](const ObjectVariantMapper& mapper, const VariantValue& d, T* intoObjOfTypeT) -> void {\n        *intoObjOfTypeT = IO::Network::URL (d.As<String> (), parseOptions);\n    };\n    return TypeMappingDetails{typeid (IO::Network::URL), fromObjectMapper, toObjectMapper};\n}\n\nnamespace {\n    ObjectVariantMapper::TypesRegistry GetDefaultTypeMappers_ ()\n    {\n        using TypesRegistry                   = ObjectVariantMapper::TypesRegistry;\n        static const TypesRegistry sDefaults_ = {Set<TypeMappingDetails>{\n            ObjectVariantMapper::MakeCommonSerializer<void> (),\n            ObjectVariantMapper::MakeCommonSerializer<bool> (),\n            ObjectVariantMapper::MakeCommonSerializer<signed char> (),\n            ObjectVariantMapper::MakeCommonSerializer<short int> (),\n            ObjectVariantMapper::MakeCommonSerializer<int> (),\n            ObjectVariantMapper::MakeCommonSerializer<long int> (),\n            ObjectVariantMapper::MakeCommonSerializer<long long int> (),\n            ObjectVariantMapper::MakeCommonSerializer<unsigned char> (),\n            ObjectVariantMapper::MakeCommonSerializer<unsigned short> (),\n            ObjectVariantMapper::MakeCommonSerializer<unsigned int> (),\n            ObjectVariantMapper::MakeCommonSerializer<unsigned long int> (),\n            ObjectVariantMapper::MakeCommonSerializer<unsigned long long int> (),\n            ObjectVariantMapper::MakeCommonSerializer<float> (),\n            ObjectVariantMapper::MakeCommonSerializer<double> (),\n            ObjectVariantMapper::MakeCommonSerializer<long double> (),\n            ObjectVariantMapper::MakeCommonSerializer<Date> (),\n            ObjectVariantMapper::MakeCommonSerializer<DateTime> (),\n            ObjectVariantMapper::MakeCommonSerializer<String> (),\n            ObjectVariantMapper::MakeCommonSerializer<VariantValue> (),\n            ObjectVariantMapper::MakeCommonSerializer<Time::Duration> (),\n            ObjectVariantMapper::MakeCommonSerializer<Time::TimeOfDay> (),\n            ObjectVariantMapper::MakeCommonSerializer<Mapping<String, String>> (),\n            ObjectVariantMapper::MakeCommonSerializer<Mapping<String, VariantValue>> (),\n            ObjectVariantMapper::MakeCommonSerializer<Time::DurationRange> (),\n            ObjectVariantMapper::MakeCommonSerializer<Time::DateRange> (),\n            ObjectVariantMapper::MakeCommonSerializer<Time::DateTimeRange> (),\n        }};\n        return sDefaults_;\n    }\n}\n\nObjectVariantMapper::ObjectVariantMapper ()\n    : fTypeMappingRegistry_ (GetDefaultTypeMappers_ ())\n{\n}\n\nvoid ObjectVariantMapper::Add (const TypeMappingDetails& s)\n{\n    fTypeMappingRegistry_.Add (s);\n}\n\nvoid ObjectVariantMapper::Add (const Set<TypeMappingDetails>& s)\n{\n    s.Apply ([this](const TypeMappingDetails& arg) { Add (arg); });\n}\n\nvoid ObjectVariantMapper::Add (const TypesRegistry& s)\n{\n    s.GetMappers ().Apply ([this](const TypeMappingDetails& arg) { Add (arg); });\n}\n\nvoid ObjectVariantMapper::Add (const ObjectVariantMapper& s)\n{\n    Add (s.fTypeMappingRegistry_);\n}\n\nvoid ObjectVariantMapper::ResetToDefaultTypeRegistry ()\n{\n    fTypeMappingRegistry_ = GetDefaultTypeMappers_ ();\n}\n\nObjectVariantMapper::TypeMappingDetails ObjectVariantMapper::Lookup_ (const type_index& forTypeInfo) const\n{\n    auto i = fTypeMappingRegistry_.Lookup (forTypeInfo);\n#if qDebug\n    if (not i.IsPresent ()) {\n        Debug::TraceContextBumper ctx (\"ObjectVariantMapper::Lookup_\");\n        DbgTrace (L\"(forTypeInfo = %s) - UnRegistered Type!\", Characters::ToString (forTypeInfo).c_str ());\n    }\n#endif\n    Require (i.IsPresent ()); \/\/ if not present, this is a usage error - only use types which are registered\n    return *i;\n}\n\nString ObjectVariantMapper::ToString () const\n{\n    Characters::StringBuilder sb;\n    sb += L\"type-map-registry: \" + Characters::ToString (fTypeMappingRegistry_);\n    return sb.str ();\n}<commit_msg>tweak ToString () methods<commit_after>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2017.  All rights reserved\n *\/\n#include \"..\/StroikaPreComp.h\"\n\n#include \"..\/Characters\/Format.h\"\n#include \"..\/Characters\/StringBuilder.h\"\n#include \"..\/Characters\/ToString.h\"\n#include \"..\/Containers\/MultiSet.h\"\n#include \"..\/Debug\/Trace.h\"\n#include \"..\/Time\/Date.h\"\n#include \"..\/Time\/DateRange.h\"\n#include \"..\/Time\/DateTime.h\"\n#include \"..\/Time\/DateTimeRange.h\"\n#include \"..\/Time\/Duration.h\"\n#include \"..\/Time\/DurationRange.h\"\n\n#include \"ObjectVariantMapper.h\"\n\nusing namespace Stroika::Foundation;\nusing namespace Stroika::Foundation::DataExchange;\n\nusing Memory::Optional;\nusing Time::Date;\nusing Time::DateTime;\nusing Time::Duration;\nusing Time::TimeOfDay;\n\n\/\/ Comment this in to turn on aggressive noisy DbgTrace in this module\n\/\/#define   USE_NOISY_TRACE_IN_THIS_MODULE_       1\n\nnamespace {\n    template <typename T>\n    using FromObjectMapperType = ObjectVariantMapper::FromObjectMapperType<T>;\n    template <typename T>\n    using ToObjectMapperType = ObjectVariantMapper::ToObjectMapperType<T>;\n\n    using TypeMappingDetails = ObjectVariantMapper::TypeMappingDetails;\n}\n\n\/*\n ********************************************************************************\n **************** DataExchange::ObjectVariantMapper::TypeMappingDetails *********\n ********************************************************************************\n *\/\nString ObjectVariantMapper::TypeMappingDetails::ToString () const\n{\n    Characters::StringBuilder sb;\n    sb += L\"{\";\n    sb += L\"for-type: \" + Characters::ToString (fForType);\n    \/\/ @todo maybe also print function pointers? Not sure a good reason\n    sb += L\"}\";\n    return sb.str ();\n}\n\n\/*\n ********************************************************************************\n ****************** DataExchange::ObjectVariantMapper::TypesRegistry ************\n ********************************************************************************\n *\/\nString ObjectVariantMapper::TypesRegistry::ToString () const\n{\n    Characters::StringBuilder sb;\n    sb += L\"{\";\n    sb += L\"type-mappers: \" + Characters::ToString (fSerializers.Keys ()); \/\/ for now the values are not interesting\n    sb += L\"}\";\n    return sb.str ();\n}\n\n\/*\n ********************************************************************************\n ********************* DataExchange::ObjectVariantMapper ************************\n ********************************************************************************\n *\/\nnamespace {\n    template <typename T, typename UseVariantType>\n    TypeMappingDetails mkSerializerInfo_ ()\n    {\n        FromObjectMapperType<T> fromObjectMapper = [](const ObjectVariantMapper& mapper, const T* fromObjOfTypeT) -> VariantValue {\n            RequireNotNull (fromObjOfTypeT);\n            return VariantValue (static_cast<UseVariantType> (*fromObjOfTypeT));\n        };\n        ToObjectMapperType<T> toObjectMapper = [](const ObjectVariantMapper& mapper, const VariantValue& d, T* intoObjOfTypeT) -> void {\n            RequireNotNull (intoObjOfTypeT);\n            *intoObjOfTypeT = static_cast<T> (d.As<UseVariantType> ());\n        };\n        return TypeMappingDetails{typeid (T), fromObjectMapper, toObjectMapper};\n    }\n}\n\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer_ (const void*)\n{\n    FromObjectMapperType<void> fromObjectMapper = [](const ObjectVariantMapper& mapper, const void* fromObjOfTypeT) -> VariantValue {\n        return VariantValue{};\n    };\n    ToObjectMapperType<void> toObjectMapper = [](const ObjectVariantMapper& mapper, const VariantValue& d, void* intoObjOfTypeT) -> void {\n    };\n    return TypeMappingDetails{typeid (void), fromObjectMapper, toObjectMapper};\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<bool> ()\n{\n    return mkSerializerInfo_<bool, bool> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<signed char> ()\n{\n    return mkSerializerInfo_<signed char, signed char> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<short int> ()\n{\n    return mkSerializerInfo_<short int, short int> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<int> ()\n{\n    return mkSerializerInfo_<int, int> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<long int> ()\n{\n    return mkSerializerInfo_<long int, long int> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<long long int> ()\n{\n    return mkSerializerInfo_<long long int, long long int> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<unsigned char> ()\n{\n    return mkSerializerInfo_<unsigned char, unsigned char> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<unsigned short int> ()\n{\n    return mkSerializerInfo_<unsigned short int, unsigned short int> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<unsigned int> ()\n{\n    return mkSerializerInfo_<unsigned int, unsigned int> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<unsigned long int> ()\n{\n    return mkSerializerInfo_<unsigned long int, unsigned long int> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<unsigned long long int> ()\n{\n    return mkSerializerInfo_<unsigned long long int, unsigned long long int> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<float> ()\n{\n    return mkSerializerInfo_<float, float> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<double> ()\n{\n    return mkSerializerInfo_<double, double> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<long double> ()\n{\n    return mkSerializerInfo_<long double, long double> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<Time::Date> ()\n{\n    return mkSerializerInfo_<Time::Date, Time::Date> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<Time::DateTime> ()\n{\n    return mkSerializerInfo_<Time::DateTime, Time::DateTime> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<Characters::String> ()\n{\n    return mkSerializerInfo_<Characters::String, Characters::String> ();\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<VariantValue> ()\n{\n    FromObjectMapperType<VariantValue> fromObjectMapper = [](const ObjectVariantMapper& mapper, const VariantValue* fromObjOfTypeT) -> VariantValue {\n        return *fromObjOfTypeT;\n    };\n    ToObjectMapperType<VariantValue> toObjectMapper = [](const ObjectVariantMapper& mapper, const VariantValue& d, VariantValue* intoObjOfTypeT) -> void {\n        *reinterpret_cast<VariantValue*> (intoObjOfTypeT) = d;\n    };\n    return TypeMappingDetails{typeid (VariantValue), fromObjectMapper, toObjectMapper};\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<Time::Duration> ()\n{\n    FromObjectMapperType<Time::Duration> fromObjectMapper = [](const ObjectVariantMapper& mapper, const Time::Duration* fromObjOfTypeT) -> VariantValue {\n        return VariantValue ((fromObjOfTypeT)->As<String> ());\n    };\n    ToObjectMapperType<Time::Duration> toObjectMapper = [](const ObjectVariantMapper& mapper, const VariantValue& d, Time::Duration* intoObjOfTypeT) -> void {\n        *intoObjOfTypeT = Duration (d.As<String> ());\n    };\n    return TypeMappingDetails{typeid (Duration), fromObjectMapper, toObjectMapper};\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<Time::TimeOfDay> ()\n{\n    FromObjectMapperType<Time::TimeOfDay> fromObjectMapper = [](const ObjectVariantMapper& mapper, const Time::TimeOfDay* fromObjOfTypeT) -> VariantValue {\n        return VariantValue (fromObjOfTypeT->GetAsSecondsCount ());\n    };\n    ToObjectMapperType<Time::TimeOfDay> toObjectMapper = [](const ObjectVariantMapper& mapper, const VariantValue& d, Time::TimeOfDay* intoObjOfTypeT) -> void {\n        *reinterpret_cast<TimeOfDay*> (intoObjOfTypeT) = TimeOfDay (d.As<uint32_t> ());\n    };\n    return TypeMappingDetails{typeid (TimeOfDay), fromObjectMapper, toObjectMapper};\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<Containers::Mapping<Characters::String, Characters::String>> ()\n{\n    using ACTUAL_ELEMENT_TYPE                                  = Mapping<String, String>;\n    FromObjectMapperType<ACTUAL_ELEMENT_TYPE> fromObjectMapper = [](const ObjectVariantMapper& mapper, const ACTUAL_ELEMENT_TYPE* fromObjOfTypeT) -> VariantValue {\n        Mapping<String, VariantValue> m;\n        for (auto i : *fromObjOfTypeT) {\n            \/\/ really could do either way - but second more efficient\n            \/\/m.Add (i.first, mapper.Serialize (typeid (String), reinterpret_cast<const Byte*> (&i.second)));\n            m.Add (i.fKey, i.fValue);\n        }\n        return VariantValue (m);\n    };\n    ToObjectMapperType<ACTUAL_ELEMENT_TYPE> toObjectMapper = [](const ObjectVariantMapper& mapper, const VariantValue& d, ACTUAL_ELEMENT_TYPE* intoObjOfTypeT) -> void {\n        Mapping<String, VariantValue> m = d.As<Mapping<String, VariantValue>> ();\n        intoObjOfTypeT->clear ();\n        for (auto i : m) {\n            \/\/ really could do either way - but second more efficient\n            \/\/actualInto->Add (i.first, mapper.ToObject<String> (i.second));\n            intoObjOfTypeT->Add (i.fKey, i.fValue.As<String> ());\n        }\n    };\n    return TypeMappingDetails{typeid (ACTUAL_ELEMENT_TYPE), fromObjectMapper, toObjectMapper};\n}\n\ntemplate <>\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer<Containers::Mapping<Characters::String, VariantValue>> ()\n{\n    using ACTUAL_ELEMENT_TYPE                                  = Mapping<String, VariantValue>;\n    FromObjectMapperType<ACTUAL_ELEMENT_TYPE> fromObjectMapper = [](const ObjectVariantMapper& mapper, const ACTUAL_ELEMENT_TYPE* fromObjOfTypeT) -> VariantValue {\n        return VariantValue (*fromObjOfTypeT);\n    };\n    ToObjectMapperType<ACTUAL_ELEMENT_TYPE> toObjectMapper = [](const ObjectVariantMapper& mapper, const VariantValue& d, ACTUAL_ELEMENT_TYPE* intoObjOfTypeT) -> void {\n        *intoObjOfTypeT = d.As<Mapping<String, VariantValue>> ();\n    };\n    return TypeMappingDetails{typeid (ACTUAL_ELEMENT_TYPE), fromObjectMapper, toObjectMapper};\n}\n\nTypeMappingDetails ObjectVariantMapper::MakeCommonSerializer_ (const IO::Network::URL*, IO::Network::URL::ParseOptions parseOptions)\n{\n    using T                                  = IO::Network::URL;\n    FromObjectMapperType<T> fromObjectMapper = [](const ObjectVariantMapper& mapper, const T* fromObjOfTypeT) -> VariantValue {\n        return VariantValue (fromObjOfTypeT->GetFullURL ());\n    };\n    ToObjectMapperType<T> toObjectMapper = [parseOptions](const ObjectVariantMapper& mapper, const VariantValue& d, T* intoObjOfTypeT) -> void {\n        *intoObjOfTypeT = IO::Network::URL (d.As<String> (), parseOptions);\n    };\n    return TypeMappingDetails{typeid (IO::Network::URL), fromObjectMapper, toObjectMapper};\n}\n\nnamespace {\n    ObjectVariantMapper::TypesRegistry GetDefaultTypeMappers_ ()\n    {\n        using TypesRegistry                   = ObjectVariantMapper::TypesRegistry;\n        static const TypesRegistry sDefaults_ = {Set<TypeMappingDetails>{\n            ObjectVariantMapper::MakeCommonSerializer<void> (),\n            ObjectVariantMapper::MakeCommonSerializer<bool> (),\n            ObjectVariantMapper::MakeCommonSerializer<signed char> (),\n            ObjectVariantMapper::MakeCommonSerializer<short int> (),\n            ObjectVariantMapper::MakeCommonSerializer<int> (),\n            ObjectVariantMapper::MakeCommonSerializer<long int> (),\n            ObjectVariantMapper::MakeCommonSerializer<long long int> (),\n            ObjectVariantMapper::MakeCommonSerializer<unsigned char> (),\n            ObjectVariantMapper::MakeCommonSerializer<unsigned short> (),\n            ObjectVariantMapper::MakeCommonSerializer<unsigned int> (),\n            ObjectVariantMapper::MakeCommonSerializer<unsigned long int> (),\n            ObjectVariantMapper::MakeCommonSerializer<unsigned long long int> (),\n            ObjectVariantMapper::MakeCommonSerializer<float> (),\n            ObjectVariantMapper::MakeCommonSerializer<double> (),\n            ObjectVariantMapper::MakeCommonSerializer<long double> (),\n            ObjectVariantMapper::MakeCommonSerializer<Date> (),\n            ObjectVariantMapper::MakeCommonSerializer<DateTime> (),\n            ObjectVariantMapper::MakeCommonSerializer<String> (),\n            ObjectVariantMapper::MakeCommonSerializer<VariantValue> (),\n            ObjectVariantMapper::MakeCommonSerializer<Time::Duration> (),\n            ObjectVariantMapper::MakeCommonSerializer<Time::TimeOfDay> (),\n            ObjectVariantMapper::MakeCommonSerializer<Mapping<String, String>> (),\n            ObjectVariantMapper::MakeCommonSerializer<Mapping<String, VariantValue>> (),\n            ObjectVariantMapper::MakeCommonSerializer<Time::DurationRange> (),\n            ObjectVariantMapper::MakeCommonSerializer<Time::DateRange> (),\n            ObjectVariantMapper::MakeCommonSerializer<Time::DateTimeRange> (),\n        }};\n        return sDefaults_;\n    }\n}\n\nObjectVariantMapper::ObjectVariantMapper ()\n    : fTypeMappingRegistry_ (GetDefaultTypeMappers_ ())\n{\n}\n\nvoid ObjectVariantMapper::Add (const TypeMappingDetails& s)\n{\n    fTypeMappingRegistry_.Add (s);\n}\n\nvoid ObjectVariantMapper::Add (const Set<TypeMappingDetails>& s)\n{\n    s.Apply ([this](const TypeMappingDetails& arg) { Add (arg); });\n}\n\nvoid ObjectVariantMapper::Add (const TypesRegistry& s)\n{\n    s.GetMappers ().Apply ([this](const TypeMappingDetails& arg) { Add (arg); });\n}\n\nvoid ObjectVariantMapper::Add (const ObjectVariantMapper& s)\n{\n    Add (s.fTypeMappingRegistry_);\n}\n\nvoid ObjectVariantMapper::ResetToDefaultTypeRegistry ()\n{\n    fTypeMappingRegistry_ = GetDefaultTypeMappers_ ();\n}\n\nObjectVariantMapper::TypeMappingDetails ObjectVariantMapper::Lookup_ (const type_index& forTypeInfo) const\n{\n    auto i = fTypeMappingRegistry_.Lookup (forTypeInfo);\n#if qDebug\n    if (not i.IsPresent ()) {\n        Debug::TraceContextBumper ctx (\"ObjectVariantMapper::Lookup_\");\n        DbgTrace (L\"(forTypeInfo = %s) - UnRegistered Type!\", Characters::ToString (forTypeInfo).c_str ());\n    }\n#endif\n    Require (i.IsPresent ()); \/\/ if not present, this is a usage error - only use types which are registered\n    return *i;\n}\n\nString ObjectVariantMapper::ToString () const\n{\n    Characters::StringBuilder sb;\n    sb += L\"{\";\n    sb += L\"type-map-registry: \" + Characters::ToString (fTypeMappingRegistry_);\n    sb += L\"}\";\n    return sb.str ();\n}<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2015 The Qt Company Ltd.\n** Contact: http:\/\/www.qt.io\/licensing\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and The Qt Company.  For licensing terms and\n** conditions see http:\/\/www.qt.io\/terms-conditions.  For further information\n** use the contact form at http:\/\/www.qt.io\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 or version 3 as published by the Free\n** Software Foundation and appearing in the file LICENSE.LGPLv21 and\n** LICENSE.LGPLv3 included in the packaging of this file.  Please review the\n** following information to ensure the GNU Lesser General Public License\n** requirements will be met: https:\/\/www.gnu.org\/licenses\/lgpl.html and\n** http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, The Qt Company gives you certain additional\n** rights.  These rights are described in The Qt Company LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n****************************************************************************\/\n\n#include \"outputwindow.h\"\n\n#include \"actionmanager\/actionmanager.h\"\n#include \"coreconstants.h\"\n#include \"icore.h\"\n\n#include <utils\/outputformatter.h>\n#include <utils\/synchronousprocess.h>\n\n#include <QAction>\n#include <QScrollBar>\n\nusing namespace Utils;\n\nnamespace Core {\n\nnamespace Internal {\n\nclass OutputWindowPrivate\n{\npublic:\n    OutputWindowPrivate(QTextDocument *document)\n        : outputWindowContext(0)\n        , formatter(0)\n        , enforceNewline(false)\n        , scrollToBottom(false)\n        , linksActive(true)\n        , mousePressed(false)\n        , maxLineCount(100000)\n        , cursor(document)\n    {\n    }\n\n    ~OutputWindowPrivate()\n    {\n        ICore::removeContextObject(outputWindowContext);\n        delete outputWindowContext;\n    }\n\n    IContext *outputWindowContext;\n    Utils::OutputFormatter *formatter;\n\n    bool enforceNewline;\n    bool scrollToBottom;\n    bool linksActive;\n    bool mousePressed;\n    int maxLineCount;\n    QTextCursor cursor;\n};\n\n} \/\/ namespace Internal\n\n\/*******************\/\n\nOutputWindow::OutputWindow(Context context, QWidget *parent)\n    : QPlainTextEdit(parent)\n    , d(new Internal::OutputWindowPrivate(document()))\n{\n    setVerticalScrollBarPolicy(Qt::ScrollBarAlwaysOn);\n    \/\/setCenterOnScroll(false);\n    setFrameShape(QFrame::NoFrame);\n    setMouseTracking(true);\n    setUndoRedoEnabled(false);\n\n    d->outputWindowContext = new IContext;\n    d->outputWindowContext->setContext(context);\n    d->outputWindowContext->setWidget(this);\n    ICore::addContextObject(d->outputWindowContext);\n\n    QAction *undoAction = new QAction(this);\n    QAction *redoAction = new QAction(this);\n    QAction *cutAction = new QAction(this);\n    QAction *copyAction = new QAction(this);\n    QAction *pasteAction = new QAction(this);\n    QAction *selectAllAction = new QAction(this);\n\n    ActionManager::registerAction(undoAction, Constants::UNDO, context);\n    ActionManager::registerAction(redoAction, Constants::REDO, context);\n    ActionManager::registerAction(cutAction, Constants::CUT, context);\n    ActionManager::registerAction(copyAction, Constants::COPY, context);\n    ActionManager::registerAction(pasteAction, Constants::PASTE, context);\n    ActionManager::registerAction(selectAllAction, Constants::SELECTALL, context);\n\n    connect(undoAction, SIGNAL(triggered()), this, SLOT(undo()));\n    connect(redoAction, SIGNAL(triggered()), this, SLOT(redo()));\n    connect(cutAction, SIGNAL(triggered()), this, SLOT(cut()));\n    connect(copyAction, SIGNAL(triggered()), this, SLOT(copy()));\n    connect(pasteAction, SIGNAL(triggered()), this, SLOT(paste()));\n    connect(selectAllAction, SIGNAL(triggered()), this, SLOT(selectAll()));\n\n    connect(this, SIGNAL(undoAvailable(bool)), undoAction, SLOT(setEnabled(bool)));\n    connect(this, SIGNAL(redoAvailable(bool)), redoAction, SLOT(setEnabled(bool)));\n    connect(this, SIGNAL(copyAvailable(bool)), cutAction, SLOT(setEnabled(bool)));  \/\/ OutputWindow never read-only\n    connect(this, SIGNAL(copyAvailable(bool)), copyAction, SLOT(setEnabled(bool)));\n\n    undoAction->setEnabled(false);\n    redoAction->setEnabled(false);\n    cutAction->setEnabled(false);\n    copyAction->setEnabled(false);\n}\n\nOutputWindow::~OutputWindow()\n{\n    delete d;\n}\n\nvoid OutputWindow::mousePressEvent(QMouseEvent * e)\n{\n    d->mousePressed = true;\n    QPlainTextEdit::mousePressEvent(e);\n}\n\nvoid OutputWindow::mouseReleaseEvent(QMouseEvent *e)\n{\n    d->mousePressed = false;\n\n    if (d->linksActive) {\n        const QString href = anchorAt(e->pos());\n        if (d->formatter)\n            d->formatter->handleLink(href);\n    }\n\n    \/\/ Mouse was released, activate links again\n    d->linksActive = true;\n\n    QPlainTextEdit::mouseReleaseEvent(e);\n}\n\nvoid OutputWindow::mouseMoveEvent(QMouseEvent *e)\n{\n    \/\/ Cursor was dragged to make a selection, deactivate links\n    if (d->mousePressed && textCursor().hasSelection())\n        d->linksActive = false;\n\n    if (!d->linksActive || anchorAt(e->pos()).isEmpty())\n        viewport()->setCursor(Qt::IBeamCursor);\n    else\n        viewport()->setCursor(Qt::PointingHandCursor);\n    QPlainTextEdit::mouseMoveEvent(e);\n}\n\nvoid OutputWindow::resizeEvent(QResizeEvent *e)\n{\n    \/\/Keep scrollbar at bottom of window while resizing, to ensure we keep scrolling\n    \/\/This can happen if window is resized while building, or if the horizontal scrollbar appears\n    bool atBottom = isScrollbarAtBottom();\n    QPlainTextEdit::resizeEvent(e);\n    if (atBottom)\n        scrollToBottom();\n}\n\nvoid OutputWindow::keyPressEvent(QKeyEvent *ev)\n{\n    QPlainTextEdit::keyPressEvent(ev);\n\n    \/\/Ensure we scroll also on Ctrl+Home or Ctrl+End\n    if (ev->matches(QKeySequence::MoveToStartOfDocument))\n        verticalScrollBar()->triggerAction(QAbstractSlider::SliderToMinimum);\n    else if (ev->matches(QKeySequence::MoveToEndOfDocument))\n        verticalScrollBar()->triggerAction(QAbstractSlider::SliderToMaximum);\n}\n\nOutputFormatter *OutputWindow::formatter() const\n{\n    return d->formatter;\n}\n\nvoid OutputWindow::setFormatter(OutputFormatter *formatter)\n{\n    d->formatter = formatter;\n    d->formatter->setPlainTextEdit(this);\n}\n\nvoid OutputWindow::showEvent(QShowEvent *e)\n{\n    QPlainTextEdit::showEvent(e);\n    if (d->scrollToBottom)\n        verticalScrollBar()->setValue(verticalScrollBar()->maximum());\n    d->scrollToBottom = false;\n}\n\nQString OutputWindow::doNewlineEnforcement(const QString &out)\n{\n    d->scrollToBottom = true;\n    QString s = out;\n    if (d->enforceNewline) {\n        s.prepend(QLatin1Char('\\n'));\n        d->enforceNewline = false;\n    }\n\n    if (s.endsWith(QLatin1Char('\\n'))) {\n        d->enforceNewline = true; \/\/ make appendOutputInline put in a newline next time\n        s.chop(1);\n    }\n\n    return s;\n}\n\nvoid OutputWindow::setMaxLineCount(int count)\n{\n    d->maxLineCount = count;\n    setMaximumBlockCount(d->maxLineCount);\n}\n\nint OutputWindow::maxLineCount() const\n{\n    return d->maxLineCount;\n}\n\nvoid OutputWindow::appendMessage(const QString &output, OutputFormat format)\n{\n    const QString out = SynchronousProcess::normalizeNewlines(output);\n    setMaximumBlockCount(d->maxLineCount);\n    const bool atBottom = isScrollbarAtBottom();\n\n    if (format == ErrorMessageFormat || format == NormalMessageFormat) {\n\n        d->formatter->appendMessage(doNewlineEnforcement(out), format);\n\n    } else {\n\n        bool sameLine = format == StdOutFormatSameLine\n                     || format == StdErrFormatSameLine;\n\n        if (sameLine) {\n            d->scrollToBottom = true;\n\n            int newline = -1;\n            bool enforceNewline = d->enforceNewline;\n            d->enforceNewline = false;\n\n            if (!enforceNewline) {\n                newline = out.indexOf(QLatin1Char('\\n'));\n                moveCursor(QTextCursor::End);\n                if (newline != -1)\n                    d->formatter->appendMessage(out.left(newline), format);\/\/ doesn't enforce new paragraph like appendPlainText\n            }\n\n            QString s = out.mid(newline+1);\n            if (s.isEmpty()) {\n                d->enforceNewline = true;\n            } else {\n                if (s.endsWith(QLatin1Char('\\n'))) {\n                    d->enforceNewline = true;\n                    s.chop(1);\n                }\n                d->formatter->appendMessage(QLatin1Char('\\n') + s, format);\n            }\n        } else {\n            d->formatter->appendMessage(doNewlineEnforcement(out), format);\n        }\n    }\n\n    if (atBottom)\n        scrollToBottom();\n    enableUndoRedo();\n}\n\n\/\/ TODO rename\nvoid OutputWindow::appendText(const QString &textIn, const QTextCharFormat &format)\n{\n    const QString text = SynchronousProcess::normalizeNewlines(textIn);\n    if (d->maxLineCount > 0 && document()->blockCount() >= d->maxLineCount)\n        return;\n    const bool atBottom = isScrollbarAtBottom();\n    if (!d->cursor.atEnd())\n        d->cursor.movePosition(QTextCursor::End);\n    d->cursor.beginEditBlock();\n    d->cursor.insertText(doNewlineEnforcement(text), format);\n\n    if (d->maxLineCount > 0 && document()->blockCount() >= d->maxLineCount) {\n        QTextCharFormat tmp;\n        tmp.setFontWeight(QFont::Bold);\n        d->cursor.insertText(doNewlineEnforcement(tr(\"Additional output omitted\") + QLatin1Char('\\n')), tmp);\n    }\n\n    d->cursor.endEditBlock();\n    if (atBottom)\n        scrollToBottom();\n}\n\nbool OutputWindow::isScrollbarAtBottom() const\n{\n    return verticalScrollBar()->value() == verticalScrollBar()->maximum();\n}\n\nvoid OutputWindow::clear()\n{\n    d->enforceNewline = false;\n    QPlainTextEdit::clear();\n}\n\nvoid OutputWindow::scrollToBottom()\n{\n    verticalScrollBar()->setValue(verticalScrollBar()->maximum());\n    \/\/ QPlainTextEdit destroys the first calls value in case of multiline\n    \/\/ text, so make sure that the scroll bar actually gets the value set.\n    \/\/ Is a noop if the first call succeeded.\n    verticalScrollBar()->setValue(verticalScrollBar()->maximum());\n}\n\nvoid OutputWindow::grayOutOldContent()\n{\n    if (!d->cursor.atEnd())\n        d->cursor.movePosition(QTextCursor::End);\n    QTextCharFormat endFormat = d->cursor.charFormat();\n\n    d->cursor.select(QTextCursor::Document);\n\n    QTextCharFormat format;\n    const QColor bkgColor = palette().base().color();\n    const QColor fgdColor = palette().text().color();\n    double bkgFactor = 0.50;\n    double fgdFactor = 1.-bkgFactor;\n    format.setForeground(QColor((bkgFactor * bkgColor.red() + fgdFactor * fgdColor.red()),\n                             (bkgFactor * bkgColor.green() + fgdFactor * fgdColor.green()),\n                             (bkgFactor * bkgColor.blue() + fgdFactor * fgdColor.blue()) ));\n    d->cursor.mergeCharFormat(format);\n\n    if (!d->cursor.atEnd())\n        d->cursor.movePosition(QTextCursor::End);\n    d->cursor.setCharFormat(endFormat);\n    d->cursor.insertBlock(QTextBlockFormat());\n}\n\nvoid OutputWindow::enableUndoRedo()\n{\n    setMaximumBlockCount(0);\n    setUndoRedoEnabled(true);\n}\n\nvoid OutputWindow::setWordWrapEnabled(bool wrap)\n{\n    if (wrap)\n        setWordWrapMode(QTextOption::WrapAtWordBoundaryOrAnywhere);\n    else\n        setWordWrapMode(QTextOption::NoWrap);\n}\n\n} \/\/ namespace Core\n<commit_msg>ProjectExplorer: Fix to eager clearing of output window<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2015 The Qt Company Ltd.\n** Contact: http:\/\/www.qt.io\/licensing\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and The Qt Company.  For licensing terms and\n** conditions see http:\/\/www.qt.io\/terms-conditions.  For further information\n** use the contact form at http:\/\/www.qt.io\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 or version 3 as published by the Free\n** Software Foundation and appearing in the file LICENSE.LGPLv21 and\n** LICENSE.LGPLv3 included in the packaging of this file.  Please review the\n** following information to ensure the GNU Lesser General Public License\n** requirements will be met: https:\/\/www.gnu.org\/licenses\/lgpl.html and\n** http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, The Qt Company gives you certain additional\n** rights.  These rights are described in The Qt Company LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n****************************************************************************\/\n\n#include \"outputwindow.h\"\n\n#include \"actionmanager\/actionmanager.h\"\n#include \"coreconstants.h\"\n#include \"icore.h\"\n\n#include <utils\/outputformatter.h>\n#include <utils\/synchronousprocess.h>\n\n#include <QAction>\n#include <QScrollBar>\n\nusing namespace Utils;\n\nnamespace Core {\n\nnamespace Internal {\n\nclass OutputWindowPrivate\n{\npublic:\n    OutputWindowPrivate(QTextDocument *document)\n        : outputWindowContext(0)\n        , formatter(0)\n        , enforceNewline(false)\n        , scrollToBottom(false)\n        , linksActive(true)\n        , mousePressed(false)\n        , maxLineCount(100000)\n        , cursor(document)\n    {\n    }\n\n    ~OutputWindowPrivate()\n    {\n        ICore::removeContextObject(outputWindowContext);\n        delete outputWindowContext;\n    }\n\n    IContext *outputWindowContext;\n    Utils::OutputFormatter *formatter;\n\n    bool enforceNewline;\n    bool scrollToBottom;\n    bool linksActive;\n    bool mousePressed;\n    int maxLineCount;\n    QTextCursor cursor;\n};\n\n} \/\/ namespace Internal\n\n\/*******************\/\n\nOutputWindow::OutputWindow(Context context, QWidget *parent)\n    : QPlainTextEdit(parent)\n    , d(new Internal::OutputWindowPrivate(document()))\n{\n    setVerticalScrollBarPolicy(Qt::ScrollBarAlwaysOn);\n    \/\/setCenterOnScroll(false);\n    setFrameShape(QFrame::NoFrame);\n    setMouseTracking(true);\n    setUndoRedoEnabled(false);\n\n    d->outputWindowContext = new IContext;\n    d->outputWindowContext->setContext(context);\n    d->outputWindowContext->setWidget(this);\n    ICore::addContextObject(d->outputWindowContext);\n\n    QAction *undoAction = new QAction(this);\n    QAction *redoAction = new QAction(this);\n    QAction *cutAction = new QAction(this);\n    QAction *copyAction = new QAction(this);\n    QAction *pasteAction = new QAction(this);\n    QAction *selectAllAction = new QAction(this);\n\n    ActionManager::registerAction(undoAction, Constants::UNDO, context);\n    ActionManager::registerAction(redoAction, Constants::REDO, context);\n    ActionManager::registerAction(cutAction, Constants::CUT, context);\n    ActionManager::registerAction(copyAction, Constants::COPY, context);\n    ActionManager::registerAction(pasteAction, Constants::PASTE, context);\n    ActionManager::registerAction(selectAllAction, Constants::SELECTALL, context);\n\n    connect(undoAction, SIGNAL(triggered()), this, SLOT(undo()));\n    connect(redoAction, SIGNAL(triggered()), this, SLOT(redo()));\n    connect(cutAction, SIGNAL(triggered()), this, SLOT(cut()));\n    connect(copyAction, SIGNAL(triggered()), this, SLOT(copy()));\n    connect(pasteAction, SIGNAL(triggered()), this, SLOT(paste()));\n    connect(selectAllAction, SIGNAL(triggered()), this, SLOT(selectAll()));\n\n    connect(this, SIGNAL(undoAvailable(bool)), undoAction, SLOT(setEnabled(bool)));\n    connect(this, SIGNAL(redoAvailable(bool)), redoAction, SLOT(setEnabled(bool)));\n    connect(this, SIGNAL(copyAvailable(bool)), cutAction, SLOT(setEnabled(bool)));  \/\/ OutputWindow never read-only\n    connect(this, SIGNAL(copyAvailable(bool)), copyAction, SLOT(setEnabled(bool)));\n\n    undoAction->setEnabled(false);\n    redoAction->setEnabled(false);\n    cutAction->setEnabled(false);\n    copyAction->setEnabled(false);\n}\n\nOutputWindow::~OutputWindow()\n{\n    delete d;\n}\n\nvoid OutputWindow::mousePressEvent(QMouseEvent * e)\n{\n    d->mousePressed = true;\n    QPlainTextEdit::mousePressEvent(e);\n}\n\nvoid OutputWindow::mouseReleaseEvent(QMouseEvent *e)\n{\n    d->mousePressed = false;\n\n    if (d->linksActive) {\n        const QString href = anchorAt(e->pos());\n        if (d->formatter)\n            d->formatter->handleLink(href);\n    }\n\n    \/\/ Mouse was released, activate links again\n    d->linksActive = true;\n\n    QPlainTextEdit::mouseReleaseEvent(e);\n}\n\nvoid OutputWindow::mouseMoveEvent(QMouseEvent *e)\n{\n    \/\/ Cursor was dragged to make a selection, deactivate links\n    if (d->mousePressed && textCursor().hasSelection())\n        d->linksActive = false;\n\n    if (!d->linksActive || anchorAt(e->pos()).isEmpty())\n        viewport()->setCursor(Qt::IBeamCursor);\n    else\n        viewport()->setCursor(Qt::PointingHandCursor);\n    QPlainTextEdit::mouseMoveEvent(e);\n}\n\nvoid OutputWindow::resizeEvent(QResizeEvent *e)\n{\n    \/\/Keep scrollbar at bottom of window while resizing, to ensure we keep scrolling\n    \/\/This can happen if window is resized while building, or if the horizontal scrollbar appears\n    bool atBottom = isScrollbarAtBottom();\n    QPlainTextEdit::resizeEvent(e);\n    if (atBottom)\n        scrollToBottom();\n}\n\nvoid OutputWindow::keyPressEvent(QKeyEvent *ev)\n{\n    QPlainTextEdit::keyPressEvent(ev);\n\n    \/\/Ensure we scroll also on Ctrl+Home or Ctrl+End\n    if (ev->matches(QKeySequence::MoveToStartOfDocument))\n        verticalScrollBar()->triggerAction(QAbstractSlider::SliderToMinimum);\n    else if (ev->matches(QKeySequence::MoveToEndOfDocument))\n        verticalScrollBar()->triggerAction(QAbstractSlider::SliderToMaximum);\n}\n\nOutputFormatter *OutputWindow::formatter() const\n{\n    return d->formatter;\n}\n\nvoid OutputWindow::setFormatter(OutputFormatter *formatter)\n{\n    d->formatter = formatter;\n    d->formatter->setPlainTextEdit(this);\n}\n\nvoid OutputWindow::showEvent(QShowEvent *e)\n{\n    QPlainTextEdit::showEvent(e);\n    if (d->scrollToBottom)\n        verticalScrollBar()->setValue(verticalScrollBar()->maximum());\n    d->scrollToBottom = false;\n}\n\nQString OutputWindow::doNewlineEnforcement(const QString &out)\n{\n    d->scrollToBottom = true;\n    QString s = out;\n    if (d->enforceNewline) {\n        s.prepend(QLatin1Char('\\n'));\n        d->enforceNewline = false;\n    }\n\n    if (s.endsWith(QLatin1Char('\\n'))) {\n        d->enforceNewline = true; \/\/ make appendOutputInline put in a newline next time\n        s.chop(1);\n    }\n\n    return s;\n}\n\nvoid OutputWindow::setMaxLineCount(int count)\n{\n    d->maxLineCount = count;\n    setMaximumBlockCount(d->maxLineCount);\n}\n\nint OutputWindow::maxLineCount() const\n{\n    return d->maxLineCount;\n}\n\nvoid OutputWindow::appendMessage(const QString &output, OutputFormat format)\n{\n    const QString out = SynchronousProcess::normalizeNewlines(output);\n    setMaximumBlockCount(d->maxLineCount);\n    const bool atBottom = isScrollbarAtBottom();\n\n    if (format == ErrorMessageFormat || format == NormalMessageFormat) {\n\n        d->formatter->appendMessage(doNewlineEnforcement(out), format);\n\n    } else {\n\n        bool sameLine = format == StdOutFormatSameLine\n                     || format == StdErrFormatSameLine;\n\n        if (sameLine) {\n            d->scrollToBottom = true;\n\n            int newline = -1;\n            bool enforceNewline = d->enforceNewline;\n            d->enforceNewline = false;\n\n            if (!enforceNewline) {\n                newline = out.indexOf(QLatin1Char('\\n'));\n                moveCursor(QTextCursor::End);\n                if (newline != -1)\n                    d->formatter->appendMessage(out.left(newline), format);\/\/ doesn't enforce new paragraph like appendPlainText\n            }\n\n            QString s = out.mid(newline+1);\n            if (s.isEmpty()) {\n                d->enforceNewline = true;\n            } else {\n                if (s.endsWith(QLatin1Char('\\n'))) {\n                    d->enforceNewline = true;\n                    s.chop(1);\n                }\n                d->formatter->appendMessage(QLatin1Char('\\n') + s, format);\n            }\n        } else {\n            d->formatter->appendMessage(doNewlineEnforcement(out), format);\n        }\n    }\n\n    if (atBottom)\n        scrollToBottom();\n    enableUndoRedo();\n}\n\n\/\/ TODO rename\nvoid OutputWindow::appendText(const QString &textIn, const QTextCharFormat &format)\n{\n    const QString text = SynchronousProcess::normalizeNewlines(textIn);\n    if (d->maxLineCount > 0 && document()->blockCount() >= d->maxLineCount)\n        return;\n    const bool atBottom = isScrollbarAtBottom();\n    if (!d->cursor.atEnd())\n        d->cursor.movePosition(QTextCursor::End);\n    d->cursor.beginEditBlock();\n    d->cursor.insertText(doNewlineEnforcement(text), format);\n\n    if (d->maxLineCount > 0 && document()->blockCount() >= d->maxLineCount) {\n        QTextCharFormat tmp;\n        tmp.setFontWeight(QFont::Bold);\n        d->cursor.insertText(doNewlineEnforcement(tr(\"Additional output omitted\") + QLatin1Char('\\n')), tmp);\n    }\n\n    d->cursor.endEditBlock();\n    if (atBottom)\n        scrollToBottom();\n}\n\nbool OutputWindow::isScrollbarAtBottom() const\n{\n    return verticalScrollBar()->value() == verticalScrollBar()->maximum();\n}\n\nvoid OutputWindow::clear()\n{\n    d->enforceNewline = false;\n    QPlainTextEdit::clear();\n}\n\nvoid OutputWindow::scrollToBottom()\n{\n    verticalScrollBar()->setValue(verticalScrollBar()->maximum());\n    \/\/ QPlainTextEdit destroys the first calls value in case of multiline\n    \/\/ text, so make sure that the scroll bar actually gets the value set.\n    \/\/ Is a noop if the first call succeeded.\n    verticalScrollBar()->setValue(verticalScrollBar()->maximum());\n}\n\nvoid OutputWindow::grayOutOldContent()\n{\n    if (!d->cursor.atEnd())\n        d->cursor.movePosition(QTextCursor::End);\n    QTextCharFormat endFormat = d->cursor.charFormat();\n\n    d->cursor.select(QTextCursor::Document);\n\n    QTextCharFormat format;\n    const QColor bkgColor = palette().base().color();\n    const QColor fgdColor = palette().text().color();\n    double bkgFactor = 0.50;\n    double fgdFactor = 1.-bkgFactor;\n    format.setForeground(QColor((bkgFactor * bkgColor.red() + fgdFactor * fgdColor.red()),\n                             (bkgFactor * bkgColor.green() + fgdFactor * fgdColor.green()),\n                             (bkgFactor * bkgColor.blue() + fgdFactor * fgdColor.blue()) ));\n    d->cursor.mergeCharFormat(format);\n\n    d->cursor.movePosition(QTextCursor::End);\n    d->cursor.setCharFormat(endFormat);\n    d->cursor.insertBlock(QTextBlockFormat());\n}\n\nvoid OutputWindow::enableUndoRedo()\n{\n    setMaximumBlockCount(0);\n    setUndoRedoEnabled(true);\n}\n\nvoid OutputWindow::setWordWrapEnabled(bool wrap)\n{\n    if (wrap)\n        setWordWrapMode(QTextOption::WrapAtWordBoundaryOrAnywhere);\n    else\n        setWordWrapMode(QTextOption::NoWrap);\n}\n\n} \/\/ namespace Core\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 \"otbWrapperCompositeApplication.h\"\n#include \"otbWrapperApplicationFactory.h\"\n\n#include \"otbOGRDataToSamplePositionFilter.h\"\n\nnamespace otb\n{\nnamespace Wrapper\n{\n\nclass TrainImagesRegression : public CompositeApplication\n{\npublic:\n  \/** Standard class typedefs. *\/\n  typedef TrainImagesRegression Self;\n  typedef CompositeApplication Superclass;\n  typedef itk::SmartPointer<Self> Pointer;\n  typedef itk::SmartPointer<const Self> ConstPointer;\n\n  \/** Standard macro *\/\n  itkNewMacro(Self);\n\n  \/** Standard macro *\/\n  itkTypeMacro( TrainImagesRegression, Superclass );\n  \nprotected:\n\n  void AddRegressionField()\n  {\n    auto setFieldAppli = GetInternalApplication(\"setfield\");\n    auto inputFileNames = GetParameterStringList( \"io.vd\" );\n    auto& outputFileNames =  m_FileHandler[ \"inputWithClassField\" ]; \n    \n    setFieldAppli->SetParameterString(\"fn\", m_ClassFieldName);\n    setFieldAppli->SetParameterString(\"fv\", \"0\");\n    \n    for (unsigned int i =0; i < inputFileNames.size(); i++)\n    {\n      outputFileNames.push_back(\"setfield\"+ std::to_string(i) +\".shp\");\/\/ TODO io file handler\n      setFieldAppli->SetParameterString(\"in\", inputFileNames[i]);\n      setFieldAppli->SetParameterString(\"out\", outputFileNames[i]);\n      \n      \/\/ Call ExecuteAndWriteOutput because VectorDataSetField's ExecuteInternal() does not write vector data.\n      setFieldAppli->ExecuteAndWriteOutput();\n    }\n  }\n\n  void ComputePolygonStatistics()\n  {\n    auto polygonClassAppli = GetInternalApplication(\"polystat\");\n    auto& input = m_FileHandler[ \"inputWithClassField\" ];\n    auto& output = m_FileHandler[ \"statsFiles\" ];\n    FloatVectorImageListType* inputImageList = GetParameterImageList( \"io.il\" );\n    \n    \n    for (unsigned int i =0; i < input.size(); i++)\n    {\n      output.push_back(\"polygonstat\"+ std::to_string(i) +\".xml\");\n      \n      polygonClassAppli->SetParameterInputImage( \"in\", inputImageList->GetNthElement(i) );\n      polygonClassAppli->SetParameterString( \"vec\", input[i]);\n      polygonClassAppli->SetParameterString( \"out\", output[i]);\n  \n      polygonClassAppli->UpdateParameters();\n      polygonClassAppli->SetParameterString( \"field\", m_ClassFieldName);\n    \n      ExecuteInternal( \"polystat\" );\n    }\n    \n  }\n\n  void ComputeSamplingRate()\n  {\n    auto samplingRateAppli = GetInternalApplication(\"rates\");\n    \n    samplingRateAppli->SetParameterStringList( \"il\", m_FileHandler[ \"statsFiles\" ]);\n    \n    std::string outputFileName = \"rates.csv\";\n    samplingRateAppli->SetParameterString(\"out\", outputFileName);\n    \n    if (HasValue(\"sample.nt\"))\n    {\n      samplingRateAppli->SetParameterString(\"strategy\", \"constant\");\n      \n      \/\/ TODO why nb is a string in MultiImageSamplingRate + MultiImageSamplingRate seems to return nb-1 samples ...\n      samplingRateAppli->SetParameterString(\"strategy.constant.nb\", std::to_string(GetParameterInt(\"sample.nt\")));\n    }\n    else\n    {\n      samplingRateAppli->SetParameterString(\"strategy\", \"all\");\n    }\n    \n    ExecuteInternal( \"rates\");\n    \n    auto& rateFiles = m_FileHandler[\"rateFiles\"];\n    for (unsigned int i = 0; i< m_FileHandler[\"statsFiles\"].size(); i++)\n    {\n      rateFiles.push_back(\"rates_\"+std::to_string(i+1)+\".csv\");\n    }\n    \n  }\n\n  void SelectSamples()\n  {\n    auto sampleSelection = GetInternalApplication(\"select\");\n    \n    FloatVectorImageListType* inputImageList = GetParameterImageList( \"io.il\" );\n    auto& inputVectorFiles = m_FileHandler[ \"inputWithClassField\" ];\n    auto& outputVectorFiles = m_FileHandler[ \"samples\" ];\n    auto& rateFiles = m_FileHandler [\"rateFiles\"];\n    auto& statFiles = m_FileHandler [\"statsFiles\"];\n    \n    for (unsigned int i =0; i < inputVectorFiles.size(); i++)\n    {\n      outputVectorFiles.push_back(\"samples\"+std::to_string(i)+\".shp\");\n      sampleSelection->SetParameterInputImage(\"in\", inputImageList->GetNthElement(i));\n      sampleSelection->SetParameterString(\"vec\", inputVectorFiles[i]);\n      sampleSelection->SetParameterString(\"instats\", statFiles[i]);\n      sampleSelection->SetParameterString(\"strategy\", \"byclass\");\n      sampleSelection->SetParameterString(\"strategy.byclass.in\", rateFiles[i]);\n      sampleSelection->SetParameterString(\"out\", outputVectorFiles[i]);\n      \n      sampleSelection->UpdateParameters();\n      sampleSelection->SetParameterString(\"field\", m_ClassFieldName);\n      \n      ExecuteInternal(\"select\");\n    }\n  }\n  \n  void ExtractSamples()\n  {\n    auto sampleExtraction = GetInternalApplication(\"extraction\");\n    \n    FloatVectorImageListType* featureImageList = GetParameterImageList( \"io.il\" );\n    FloatVectorImageListType* predictorImageList = GetParameterImageList(\"io.ip\");\n    auto& vectorFiles = m_FileHandler[ \"samples\" ];\n \n    for (unsigned int i =0; i < vectorFiles.size(); i++)\n    {\n      sampleExtraction->SetParameterString(\"vec\", vectorFiles[i]);\n      sampleExtraction->UpdateParameters();\n      sampleExtraction->SetParameterString(\"field\", m_ClassFieldName);\n      \n      \/\/First Extraction\n      sampleExtraction->SetParameterInputImage(\"in\", featureImageList->GetNthElement(i));\n      sampleExtraction->SetParameterString(\"outfield\", \"prefix\");\n      sampleExtraction->SetParameterString(\"outfield.prefix.name\", \"value_\");\n      ExecuteInternal(\"extraction\");\n      \n      \/\/Second Extraction\n      sampleExtraction->SetParameterInputImage(\"in\", predictorImageList->GetNthElement(i));\n      sampleExtraction->SetParameterString(\"outfield\", \"list\");\n      sampleExtraction->SetParameterStringList(\"outfield.list.names\", {m_PredictionFieldName});\n      ExecuteInternal(\"extraction\");\n    }\n  }\n  \n  void TrainModel()\n  {\n    \n  }\n  \n  void InitIO()\n  {\n    AddParameter( ParameterType_Group, \"io\", \"Input and output data\" );\n    SetParameterDescription( \"io\", \"This group of parameters allows setting input and output data.\" );\n\n    AddParameter( ParameterType_InputImageList, \"io.il\", \"Input Image List\" );\n    SetParameterDescription( \"io.il\", \"A list of input images.\" );\n    MandatoryOn( \"io.il\" );\n    \n    AddParameter( ParameterType_InputImageList, \"io.ip\", \"Input Predictor Image List\" );\n    SetParameterDescription( \"io.ip\", \"A list of input images.\" );\n    MandatoryOn( \"io.ip\" );\n    \n    AddParameter( ParameterType_InputVectorDataList, \"io.vd\", \"Input Vector Data List\" );\n    SetParameterDescription( \"io.vd\", \"A list of vector data to select the training samples.\" );\n    MandatoryOn( \"io.vd\" );\n  }\n  \n  void InitSampling()\n  {  \n    AddApplication( \"VectorDataSetField\", \"setfield\", \"Set additional vector field\");\n    AddApplication( \"PolygonClassStatistics\", \"polystat\", \"Polygon analysis\" );\n    AddApplication( \"MultiImageSamplingRate\", \"rates\", \"Sampling rates\" );\n    \n    AddParameter( ParameterType_Group, \"sample\", \"Sampling parameters\" );\n    SetParameterDescription( \"sample\", \"This group of parameters allows setting sampling parameters\" );\n\n    AddParameter( ParameterType_Int, \"sample.nt\", \"Number of training samples\" );\n    SetParameterDescription( \"sample.nt\", \"Number of training samples.\" );\n    MandatoryOff( \"sample.nt\" );\n    \n    AddApplication( \"SampleSelection\", \"select\", \"Sample selection\" );\n    AddApplication( \"SampleExtraction\", \"extraction\", \"Sample extraction\" );\n    \n  }\n  \n  void InitLearning()\n  {\n    AddApplication( \"TrainVectorRegression\", \"trainregression\", \"Train vector regression\"); \n    \n  }\n\nprivate:\n\n  void DoInit() override\n  {\n    SetName(\"TrainImagesRegression\");\n    SetDescription(\" \");\n\n    SetDocLongDescription(\" \");\n    SetDocLimitations(\" \");\n    SetDocAuthors(\"OTB-Team\");\n    SetDocSeeAlso(\" \");\n    \n    AddDocTag(Tags::Learning);\n    \n    SetOfficialDocLink();\n    \n    ClearApplications();\n    \n    InitIO();\n    InitSampling();\n    InitLearning();\n    \n    AddParameter( ParameterType_Bool, \"cleanup\", \"Temporary files cleaning\" );\n    SetParameterDescription( \"cleanup\",\n                           \"If activated, the application will try to clean all temporary files it created\" );\n    SetParameterInt( \"cleanup\", 1);\n  }\n  \n  void DoUpdateParameters() override\n  {\n  }\n\n  bool ClearFileHandler()\n  {\n    bool res = true;\n    for (const auto & fileNameList : m_FileHandler)\n    {\n      for (const auto & filename : fileNameList.second)\n      {\n        res = true;\n        if( itksys::SystemTools::FileExists( filename ) )\n        {\n          size_t posExt = filename.rfind( '.' );\n          if( posExt != std::string::npos && filename.compare( posExt, std::string::npos, \".shp\" ) == 0 )\n          {\n            std::string shxPath = filename.substr( 0, posExt ) + std::string( \".shx\" );\n            std::string dbfPath = filename.substr( 0, posExt ) + std::string( \".dbf\" );\n            std::string prjPath = filename.substr( 0, posExt ) + std::string( \".prj\" );\n            itksys::SystemTools::RemoveFile( shxPath );\n            itksys::SystemTools::RemoveFile( dbfPath );\n            itksys::SystemTools::RemoveFile( prjPath );\n          }\n        res = itksys::SystemTools::RemoveFile( filename );\n        }\n      }\n    }\n    m_FileHandler.clear();\n    return res;\n  }\n  \n  void DoExecute() override\n  {\n    \/\/TODO validation set ??\n    \n    AddRegressionField();\n    \n    std::cout << \"Regression field added\" << std::endl;\n    \n    ComputePolygonStatistics();\n      \n    std::cout << \"Polygon class statistic done\" << std::endl;\n    \n    ComputeSamplingRate();\n  \n    std::cout << \"Sampling rate computation done\" << std::endl;\n    \n    SelectSamples();\n    \n    ExtractSamples();\n    \n    TrainModel();\n   \n    if (GetParameterInt(\"cleanup\"))\n    {\n      otbAppLogINFO( \"Cleaning temporary files ...\" );\n      ClearFileHandler();\n    }\n  }\n  \n  std::string m_ClassFieldName = \"regclass\";\n  \n  std::string m_PredictionFieldName = \"prediction\";\n  \n  std::map< std::string, std::vector<std::string>> m_FileHandler;\n  \n};\n\n} \/\/end namespace Wrapper\n} \/\/end namespace otb\n\nOTB_APPLICATION_EXPORT(otb::Wrapper::TrainImagesRegression)\n<commit_msg>ENH: added vector training step<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 \"otbWrapperCompositeApplication.h\"\n#include \"otbWrapperApplicationFactory.h\"\n\n#include \"otbOGRDataToSamplePositionFilter.h\"\n\nnamespace otb\n{\nnamespace Wrapper\n{\n\nclass TrainImagesRegression : public CompositeApplication\n{\npublic:\n  \/** Standard class typedefs. *\/\n  typedef TrainImagesRegression Self;\n  typedef CompositeApplication Superclass;\n  typedef itk::SmartPointer<Self> Pointer;\n  typedef itk::SmartPointer<const Self> ConstPointer;\n\n  \/** Standard macro *\/\n  itkNewMacro(Self);\n\n  \/** Standard macro *\/\n  itkTypeMacro( TrainImagesRegression, Superclass );\n  \nprotected:\n\n  void AddRegressionField()\n  {\n    auto setFieldAppli = GetInternalApplication(\"setfield\");\n    auto inputFileNames = GetParameterStringList( \"io.vd\" );\n    auto& outputFileNames =  m_FileHandler[ \"inputWithClassField\" ]; \n    \n    setFieldAppli->SetParameterString(\"fn\", m_ClassFieldName);\n    setFieldAppli->SetParameterString(\"fv\", \"0\");\n    \n    for (unsigned int i =0; i < inputFileNames.size(); i++)\n    {\n      outputFileNames.push_back(\"setfield\"+ std::to_string(i) +\".shp\");\/\/ TODO io file handler\n      setFieldAppli->SetParameterString(\"in\", inputFileNames[i]);\n      setFieldAppli->SetParameterString(\"out\", outputFileNames[i]);\n      \n      \/\/ Call ExecuteAndWriteOutput because VectorDataSetField's ExecuteInternal() does not write vector data.\n      setFieldAppli->ExecuteAndWriteOutput();\n    }\n  }\n\n  void ComputePolygonStatistics()\n  {\n    auto polygonClassAppli = GetInternalApplication(\"polystat\");\n    auto& input = m_FileHandler[ \"inputWithClassField\" ];\n    auto& output = m_FileHandler[ \"statsFiles\" ];\n    FloatVectorImageListType* inputImageList = GetParameterImageList( \"io.il\" );\n    \n    \n    for (unsigned int i =0; i < input.size(); i++)\n    {\n      output.push_back(\"polygonstat\"+ std::to_string(i) +\".xml\");\n      \n      polygonClassAppli->SetParameterInputImage( \"in\", inputImageList->GetNthElement(i) );\n      polygonClassAppli->SetParameterString( \"vec\", input[i]);\n      polygonClassAppli->SetParameterString( \"out\", output[i]);\n  \n      polygonClassAppli->UpdateParameters();\n      polygonClassAppli->SetParameterString( \"field\", m_ClassFieldName);\n    \n      ExecuteInternal( \"polystat\" );\n    }\n    \n  }\n\n  void ComputeSamplingRate()\n  {\n    auto samplingRateAppli = GetInternalApplication(\"rates\");\n    \n    samplingRateAppli->SetParameterStringList( \"il\", m_FileHandler[ \"statsFiles\" ]);\n    \n    std::string outputFileName = \"rates.csv\";\n    samplingRateAppli->SetParameterString(\"out\", outputFileName);\n    \n    if (HasValue(\"sample.nt\"))\n    {\n      samplingRateAppli->SetParameterString(\"strategy\", \"constant\");\n      \n      \/\/ TODO why nb is a string in MultiImageSamplingRate + MultiImageSamplingRate seems to return nb-1 samples ...\n      samplingRateAppli->SetParameterString(\"strategy.constant.nb\", std::to_string(GetParameterInt(\"sample.nt\")));\n    }\n    else\n    {\n      samplingRateAppli->SetParameterString(\"strategy\", \"all\");\n    }\n    \n    ExecuteInternal( \"rates\");\n    \n    auto& rateFiles = m_FileHandler[\"rateFiles\"];\n    for (unsigned int i = 0; i< m_FileHandler[\"statsFiles\"].size(); i++)\n    {\n      rateFiles.push_back(\"rates_\"+std::to_string(i+1)+\".csv\");\n    }\n    \n  }\n\n  void SelectSamples()\n  {\n    auto sampleSelection = GetInternalApplication(\"select\");\n    \n    FloatVectorImageListType* inputImageList = GetParameterImageList( \"io.il\" );\n    auto& inputVectorFiles = m_FileHandler[ \"inputWithClassField\" ];\n    auto& outputVectorFiles = m_FileHandler[ \"samples\" ];\n    auto& rateFiles = m_FileHandler [\"rateFiles\"];\n    auto& statFiles = m_FileHandler [\"statsFiles\"];\n    \n    for (unsigned int i =0; i < inputVectorFiles.size(); i++)\n    {\n      outputVectorFiles.push_back(\"samples\"+std::to_string(i)+\".shp\");\n      sampleSelection->SetParameterInputImage(\"in\", inputImageList->GetNthElement(i));\n      sampleSelection->SetParameterString(\"vec\", inputVectorFiles[i]);\n      sampleSelection->SetParameterString(\"instats\", statFiles[i]);\n      sampleSelection->SetParameterString(\"strategy\", \"byclass\");\n      sampleSelection->SetParameterString(\"strategy.byclass.in\", rateFiles[i]);\n      sampleSelection->SetParameterString(\"out\", outputVectorFiles[i]);\n      \n      sampleSelection->UpdateParameters();\n      sampleSelection->SetParameterString(\"field\", m_ClassFieldName);\n      \n      ExecuteInternal(\"select\");\n    }\n  }\n  \n  void ExtractSamples()\n  {\n    auto sampleExtraction = GetInternalApplication(\"extraction\");\n    \n    FloatVectorImageListType* featureImageList = GetParameterImageList( \"io.il\" );\n    FloatVectorImageListType* predictorImageList = GetParameterImageList(\"io.ip\");\n    auto& vectorFiles = m_FileHandler[ \"samples\" ];\n \n    for (unsigned int i =0; i < vectorFiles.size(); i++)\n    {\n      sampleExtraction->SetParameterString(\"vec\", vectorFiles[i]);\n      sampleExtraction->UpdateParameters();\n      sampleExtraction->SetParameterString(\"field\", m_ClassFieldName);\n      \n      \/\/First Extraction\n      sampleExtraction->SetParameterInputImage(\"in\", featureImageList->GetNthElement(i));\n      sampleExtraction->SetParameterString(\"outfield\", \"prefix\");\n      sampleExtraction->SetParameterString(\"outfield.prefix.name\", m_FeaturePrefix);\n      ExecuteInternal(\"extraction\");\n      \n      \/\/Second Extraction\n      sampleExtraction->SetParameterInputImage(\"in\", predictorImageList->GetNthElement(i));\n      sampleExtraction->SetParameterString(\"outfield\", \"list\");\n      sampleExtraction->SetParameterStringList(\"outfield.list.names\", {m_PredictionFieldName});\n      ExecuteInternal(\"extraction\");\n    }\n  }\n  \n  void TrainModel()\n  {\n    auto trainVectorRegression = GetInternalApplication(\"training\");\n    \n    auto& sampleFileNameList = m_FileHandler[\"samples\"];\n    std::vector<std::string> featureNames;\n    for (unsigned int i = 0; i<sampleFileNameList.size(); i++)\n    {\n      featureNames.push_back(m_FeaturePrefix+std::to_string(i));\n    }\n    \n    trainVectorRegression->SetParameterStringList(\"io.vd\", sampleFileNameList);\n    trainVectorRegression->UpdateParameters();\n    trainVectorRegression->SetParameterString(\"cfield\", m_PredictionFieldName);\n    trainVectorRegression->SetParameterStringList(\"feat\", featureNames);\n    ExecuteInternal(\"training\");\n  }\n  \n  void InitIO()\n  {\n    AddParameter( ParameterType_Group, \"io\", \"Input and output data\" );\n    SetParameterDescription( \"io\", \"This group of parameters allows setting input and output data.\" );\n\n    AddParameter( ParameterType_InputImageList, \"io.il\", \"Input Image List\" );\n    SetParameterDescription( \"io.il\", \"A list of input images.\" );\n    MandatoryOn( \"io.il\" );\n    \n    AddParameter( ParameterType_InputImageList, \"io.ip\", \"Input Predictor Image List\" );\n    SetParameterDescription( \"io.ip\", \"A list of input images.\" );\n    MandatoryOn( \"io.ip\" );\n    \n    AddParameter( ParameterType_InputVectorDataList, \"io.vd\", \"Input Vector Data List\" );\n    SetParameterDescription( \"io.vd\", \"A list of vector data to select the training samples.\" );\n    MandatoryOn( \"io.vd\" );\n  }\n  \n  void InitSampling()\n  {  \n    AddApplication( \"VectorDataSetField\", \"setfield\", \"Set additional vector field\");\n    AddApplication( \"PolygonClassStatistics\", \"polystat\", \"Polygon analysis\" );\n    AddApplication( \"MultiImageSamplingRate\", \"rates\", \"Sampling rates\" );\n    \n    AddParameter( ParameterType_Group, \"sample\", \"Sampling parameters\" );\n    SetParameterDescription( \"sample\", \"This group of parameters allows setting sampling parameters\" );\n\n    AddParameter( ParameterType_Int, \"sample.nt\", \"Number of training samples\" );\n    SetParameterDescription( \"sample.nt\", \"Number of training samples.\" );\n    MandatoryOff( \"sample.nt\" );\n    \n    AddApplication( \"SampleSelection\", \"select\", \"Sample selection\" );\n    AddApplication( \"SampleExtraction\", \"extraction\", \"Sample extraction\" );\n    \n  }\n  \n  void InitLearning()\n  {\n    AddApplication( \"TrainVectorRegression\", \"training\", \"Train vector regression\"); \n    \n    ShareParameter( \"io.imstat\", \"training.io.stats\" );\n    ShareParameter( \"io.out\", \"training.io.out\" );\n\n    ShareParameter( \"classifier\", \"training.classifier\" );\n    ShareParameter( \"rand\", \"training.rand\" );\n\n    ShareParameter( \"io.mse\", \"training.io.mse\" );\n  }\n\nprivate:\n\n  void DoInit() override\n  {\n    SetName(\"TrainImagesRegression\");\n    SetDescription(\" \");\n\n    SetDocLongDescription(\" \");\n    SetDocLimitations(\" \");\n    SetDocAuthors(\"OTB-Team\");\n    SetDocSeeAlso(\" \");\n    \n    AddDocTag(Tags::Learning);\n    \n    SetOfficialDocLink();\n    \n    ClearApplications();\n    \n    InitIO();\n    InitSampling();\n    InitLearning();\n    \n    AddParameter( ParameterType_Bool, \"cleanup\", \"Temporary files cleaning\" );\n    SetParameterDescription( \"cleanup\",\n                           \"If activated, the application will try to clean all temporary files it created\" );\n    SetParameterInt( \"cleanup\", 1);\n  }\n  \n  void DoUpdateParameters() override\n  {\n  }\n\n  bool ClearFileHandler()\n  {\n    bool res = true;\n    for (const auto & fileNameList : m_FileHandler)\n    {\n      for (const auto & filename : fileNameList.second)\n      {\n        res = true;\n        if( itksys::SystemTools::FileExists( filename ) )\n        {\n          size_t posExt = filename.rfind( '.' );\n          if( posExt != std::string::npos && filename.compare( posExt, std::string::npos, \".shp\" ) == 0 )\n          {\n            std::string shxPath = filename.substr( 0, posExt ) + std::string( \".shx\" );\n            std::string dbfPath = filename.substr( 0, posExt ) + std::string( \".dbf\" );\n            std::string prjPath = filename.substr( 0, posExt ) + std::string( \".prj\" );\n            itksys::SystemTools::RemoveFile( shxPath );\n            itksys::SystemTools::RemoveFile( dbfPath );\n            itksys::SystemTools::RemoveFile( prjPath );\n          }\n        res = itksys::SystemTools::RemoveFile( filename );\n        }\n      }\n    }\n    m_FileHandler.clear();\n    return res;\n  }\n  \n  void DoExecute() override\n  {\n    \/\/TODO validation set ??\n    \n    AddRegressionField();\n    \n    std::cout << \"Regression field added\" << std::endl;\n    \n    ComputePolygonStatistics();\n      \n    std::cout << \"Polygon class statistic done\" << std::endl;\n    \n    ComputeSamplingRate();\n  \n    std::cout << \"Sampling rate computation done\" << std::endl;\n    \n    SelectSamples();\n    \n    ExtractSamples();\n    \n    TrainModel();\n   \n    if (GetParameterInt(\"cleanup\"))\n    {\n      otbAppLogINFO( \"Cleaning temporary files ...\" );\n      ClearFileHandler();\n    }\n  }\n  \n  std::string m_ClassFieldName = \"regclass\";\n  \n  std::string m_PredictionFieldName = \"prediction\";\n  \n  std::string m_FeaturePrefix = \"value_\";\n  \n  std::map< std::string, std::vector<std::string>> m_FileHandler;\n  \n};\n\n} \/\/end namespace Wrapper\n} \/\/end namespace otb\n\nOTB_APPLICATION_EXPORT(otb::Wrapper::TrainImagesRegression)\n<|endoftext|>"}
{"text":"<commit_before>\/\/ rabidRabbit.cpp : Defines the entry point for the DLL application.\n\n#include \"bzfsAPI.h\"\n#include <string>\n#include <vector>\n#include <map>\n#include <math.h>\n\nBZ_GET_PLUGIN_VERSION\n\nclass RabidRabbitHandler : public bz_CustomMapObjectHandler\n{\npublic:\n\tvirtual bool handle ( bzApiString object, bz_CustomMapObjectInfo *data );\n};\n\nRabidRabbitHandler\trabidrabbithandler;\n\nclass RabidRabbitEventHandler : public bz_EventHandler\n{\npublic:\n\tvirtual void process ( bz_EventData *eventData );\n};\n\nRabidRabbitEventHandler\trabidrabbiteventHandler;\n\nclass RabidRabbitDieEventHandler : public bz_EventHandler\n{\npublic:\n\tvirtual void process ( bz_EventData *eventData );\n};\n\nRabidRabbitDieEventHandler rabidrabbitdieeventhandler;\n\nBZF_PLUGIN_CALL int bz_Load (const char* \/*commandLineParameter*\/){\n\n\tbz_debugMessage(4,\"rabidRabbit plugin loaded\");\n\tbz_registerCustomMapObject(\"RABIDRABBITZONE\",&rabidrabbithandler);\n\tbz_registerCustomMapObject(\"RRSOUNDOFF\",&rabidrabbithandler);\n\tbz_registerCustomMapObject(\"RRCYCLEONDIE\",&rabidrabbithandler);\n\tbz_registerEvent(bz_eTickEvent,&rabidrabbiteventHandler);\n\tbz_registerEvent(bz_ePlayerDieEvent ,&rabidrabbitdieeventhandler);\n\treturn 0;\n}\n\nBZF_PLUGIN_CALL int bz_Unload (void){\n\n\tbz_removeEvent(bz_eTickEvent,&rabidrabbiteventHandler);\n\tbz_removeEvent(bz_ePlayerDieEvent,&rabidrabbitdieeventhandler);\n\tbz_removeCustomMapObject(\"RABIDRABBITZONE\");\n\tbz_removeCustomMapObject(\"RRSOUNDOFF\");\n\tbz_removeCustomMapObject(\"RRCYCLEONDIE\");\n\tbz_debugMessage(4,\"rabidRabbit plugin unloaded\");\n\treturn 0;\n\n}\n\nclass RRZoneInfo\n{\npublic:\n\tRRZoneInfo()\n\t{\n\t\tcurrentKillZone = 0;\n\t\trabbitNotifiedWrongZone = false;\n\t\trabbitNotifiedWrongZoneNum = 0;\n\t\tsoundEnabled = true;\n\t\tcycleOnDie = false;\n\t}\n\n\tunsigned int currentKillZone;\n\tunsigned int rabbitNotifiedWrongZoneNum;\n\tbool rabbitNotifiedWrongZone, soundEnabled, cycleOnDie;\n\n};\n\nRRZoneInfo rrzoneinfo;\n\nclass RabidRabbitZone\n{\npublic:\n\tRabidRabbitZone()\n\t{\n\t\tzonekillhunter = false;\n\t\tbox = false;\n\t\txMax = xMin = yMax = yMin = zMax = zMin = rad = 0;\n\t\tWW = \"\";\n\t\tWWLifetime = 0;\n\t\tWWPosition[0] = 0;\n\t\tWWPosition[1] = 0;\n\t\tWWPosition[2] = 0;\n\t\tWWTilt = 0;\n\t\tWWDirection = 0;\n\t\tWWShotID = 0;\n\t\tWWDT = 0;\n\t\tWWRepeat = 0.5;\n\t\tWWFired = false;\n\t\tWWLastFired = 0;\n\t\tpi = 3.14159265358979323846;\n\t}\n\n\tbool zonekillhunter;\n\tbool box;\n\tfloat xMax,xMin,yMax,yMin,zMax,zMin;\n\tfloat rad;\n\n\tbzApiString WW;\n\tfloat WWLifetime, WWPosition[3], WWTilt, WWDirection, WWDT;\n\tdouble pi, WWLastFired, WWRepeat;\n\tbool WWFired;\n\tint WWShotID;\n\n\tstd::string playermessage;\n\tstd::string servermessage;\n\n\tbool pointIn ( float pos[3] )\n\t{\n\t\tif ( box )\n\t\t{\n\t\t\tif ( pos[0] > xMax || pos[0] < xMin )\n\t\t\t\treturn false;\n\n\t\t\tif ( pos[1] > yMax || pos[1] < yMin )\n\t\t\t\treturn false;\n\n\t\t\tif ( pos[2] > zMax || pos[2] < zMin )\n\t\t\t\treturn false;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfloat vec[3];\n\t\t\tvec[0] = pos[0]-xMax;\n\t\t\tvec[1] = pos[1]-yMax;\n\t\t\tvec[2] = pos[2]-zMax;\n\n\t\t\tfloat dist = sqrt(vec[0]*vec[0]+vec[1]*vec[1]);\n\t\t\tif ( dist > rad)\n\t\t\t\treturn false;\n\n\t\t\tif ( pos[2] > zMax || pos[2] < zMin )\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n};\n\nstd::vector <RabidRabbitZone> zoneList;\n\nbool RabidRabbitHandler::handle ( bzApiString object, bz_CustomMapObjectInfo *data )\n{\n\tif (object == \"RRSOUNDOFF\")\n\t\trrzoneinfo.soundEnabled = false;\n\n\tif (object == \"RRCYCLEONDIE\")\n\t\trrzoneinfo.cycleOnDie = true;\n\n\tif (object != \"RABIDRABBITZONE\" || !data)\n\t\treturn false;\n\n\tRabidRabbitZone newZone;\n\n\t\/\/ parse all the chunks\n\tfor ( unsigned int i = 0; i < data->data.size(); i++ )\n\t{\n\t\tstd::string line = data->data.get(i).c_str();\n\n\t\tbzAPIStringList *nubs = bz_newStringList();\n\t\tnubs->tokenize(line.c_str(),\" \",0,true);\n\n\t\tif ( nubs->size() > 0)\n\t\t{\n\t\t\tstd::string key = bz_toupper(nubs->get(0).c_str());\n\n\t\t\tif ( key == \"BBOX\" && nubs->size() > 6)\n\t\t\t{\n\t\t\t\tnewZone.box = true;\n\t\t\t\tnewZone.xMin = (float)atof(nubs->get(1).c_str());\n\t\t\t\tnewZone.xMax = (float)atof(nubs->get(2).c_str());\n\t\t\t\tnewZone.yMin = (float)atof(nubs->get(3).c_str());\n\t\t\t\tnewZone.yMax = (float)atof(nubs->get(4).c_str());\n\t\t\t\tnewZone.zMin = (float)atof(nubs->get(5).c_str());\n\t\t\t\tnewZone.zMax = (float)atof(nubs->get(6).c_str());\n\t\t\t}\n\t\t\telse if ( key == \"CYLINDER\" && nubs->size() > 5)\n\t\t\t{\n\t\t\t\tnewZone.box = false;\n\t\t\t\tnewZone.rad = (float)atof(nubs->get(5).c_str());\n\t\t\t\tnewZone.xMax =(float)atof(nubs->get(1).c_str());\n\t\t\t\tnewZone.yMax =(float)atof(nubs->get(2).c_str());\n\t\t\t\tnewZone.zMin =(float)atof(nubs->get(3).c_str());\n\t\t\t\tnewZone.zMax =(float)atof(nubs->get(4).c_str());\n\t\t\t}\n\t\t\telse if ( key == \"RRZONEWW\" && nubs->size() > 10)\n\t\t\t{\n\t\t\t\tnewZone.WW = nubs->get(1);\n\t\t\t\tnewZone.WWLifetime = (float)atof(nubs->get(2).c_str());\n\t\t\t\tnewZone.WWPosition[0] = (float)atof(nubs->get(3).c_str());\n\t\t\t\tnewZone.WWPosition[1] = (float)atof(nubs->get(4).c_str());\n\t\t\t\tnewZone.WWPosition[2] = (float)atof(nubs->get(5).c_str());\n\t\t\t\tnewZone.WWTilt = (float)atof(nubs->get(6).c_str());\n\t\t\t\tnewZone.WWTilt = (newZone.WWTilt \/ 360) * (2 * (float)newZone.pi);\n\t\t\t\tnewZone.WWDirection = (float)atof(nubs->get(7).c_str());\n\t\t\t\tnewZone.WWDirection = (newZone.WWDirection \/ 360) * (2 * (float)newZone.pi);\n\t\t\t\tnewZone.WWShotID = (int)atoi(nubs->get(8).c_str());\n\t\t\t\tnewZone.WWDT = (float)atof(nubs->get(9).c_str());\n\t\t\t\tnewZone.WWRepeat = (float)atof(nubs->get(10).c_str());\n\t\t\t}\n\t\t\telse if ( key == \"SERVERMESSAGE\" && nubs->size() > 1 )\n\t\t\t{\n\t\t\t\tnewZone.servermessage = nubs->get(1).c_str();\n\t\t\t}\n\t\t\telse if ( key == \"ZONEKILLHUNTER\" )\n\t\t\t{\n\t\t\t\tif (nubs->size() > 1)\n\t\t\t\t\tnewZone.playermessage = nubs->get(1).c_str();\n\t\t\t\tnewZone.zonekillhunter = true;\n\t\t\t}\n\t\t}\n\t\tbz_deleteStringList(nubs);\n\t}\n\n\tzoneList.push_back(newZone);\n\tbz_setMaxWaitTime ( (float)0.1 );\n\treturn true;\n}\n\nvoid killAllHunters(std::string messagepass)\n{\n\tbzAPIIntList *playerList = bz_newIntList();\n\tbz_getPlayerIndexList ( playerList );\n\n\n\tfor ( unsigned int i = 0; i < playerList->size(); i++ ){\n\n\t\tbz_PlayerRecord *player = bz_getPlayerByIndex(playerList->operator[](i));\n\n\t\tif (player)\n\t\t{\n\t\t\tif (player->team != eRabbitTeam)\n\t\t\t{\n\t\t\t\tbz_killPlayer(player->playerID, true, BZ_SERVER);\n\t\t\t\tbz_sendTextMessage (BZ_SERVER, player->playerID, messagepass.c_str());\n\t\t\t\tif (rrzoneinfo.soundEnabled)\n\t\t\t\t\t\tbz_sendPlayCustomLocalSound(player->playerID,\"flag_lost\");\n\t\t\t}\n\t\t\tif (player->team == eRabbitTeam && rrzoneinfo.soundEnabled && bz_getTeamCount(eHunterTeam) > 0)\n\t\t\t\tbz_sendPlayCustomLocalSound(player->playerID,\"flag_won\");\n\n\t\t}\n\n\t\tbz_freePlayerRecord(player);\n\t}\n\n\tbz_deleteIntList(playerList);\n\n\treturn;\n}\n\n\nvoid RabidRabbitEventHandler::process ( bz_EventData *eventData )\n{\n\tif ((eventData->eventType != bz_eTickEvent) || (zoneList.size() < 2))\n\t\treturn;\n\n\tfor ( unsigned int i = 0; i < zoneList.size(); i++ )\n\t{\n\t\tif (!zoneList[i].WWFired && rrzoneinfo.currentKillZone == i)\n\t\t{\n\t\t\tbz_fireWorldWep (zoneList[i].WW.c_str(),zoneList[i].WWLifetime,BZ_SERVER,zoneList[i].WWPosition,zoneList[i].WWTilt,zoneList[i].WWDirection,zoneList[i].WWShotID,zoneList[i].WWDT);\n\t\t\tzoneList[i].WWFired = true;\n\t\t\tzoneList[i].WWLastFired = bz_getCurrentTime();\n\t\t}\n\t\telse\n\t\t\t{\n\t\t\tif ((bz_getCurrentTime() - zoneList[i].WWLastFired) > zoneList[i].WWRepeat)\n\t\t\tzoneList[i].WWFired = false;\n\t\t}\n\t}\n\n\n\tbzAPIIntList *playerList = bz_newIntList();\n\tbz_getPlayerIndexList ( playerList );\n\n\tfor ( unsigned int h = 0; h < playerList->size(); h++ )\n\t{\n\tbz_PlayerRecord *player = bz_getPlayerByIndex(playerList->operator[](h));\n\n\t\t\tif (player){\n\n\t\t\t\tfor ( unsigned int i = 0; i < zoneList.size(); i++ )\n\t\t\t\t{\n\t\t\t\t\tif (zoneList[i].pointIn(player->pos) && player->spawned && player->team == eRabbitTeam && rrzoneinfo.currentKillZone != i && !rrzoneinfo.rabbitNotifiedWrongZone)\n\t\t\t\t\t{\n\t\t\t\t\t\tbz_sendTextMessage(BZ_SERVER,player->playerID,\"You are not in the current Rabid Rabbit zone - try another.\");\n\t\t\t\t\t\trrzoneinfo.rabbitNotifiedWrongZone = true;\n\t\t\t\t\t\trrzoneinfo.rabbitNotifiedWrongZoneNum = i;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (!zoneList[i].pointIn(player->pos) && player->spawned && player->team == eRabbitTeam && rrzoneinfo.rabbitNotifiedWrongZone && rrzoneinfo.rabbitNotifiedWrongZoneNum == i)\n\t\t\t\t\t\trrzoneinfo.rabbitNotifiedWrongZone = false;\n\n\t\t\t\t\tif (zoneList[i].pointIn(player->pos) && player->spawned && player->team == eRabbitTeam && rrzoneinfo.currentKillZone == i && bz_getTeamCount(eHunterTeam) > 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tkillAllHunters(zoneList[i].servermessage);\n\n\t\t\t\t\t\trrzoneinfo.rabbitNotifiedWrongZone = true;\n\t\t\t\t\t\trrzoneinfo.rabbitNotifiedWrongZoneNum = i;\n\n\t\t\t\t\t\tif (i == (zoneList.size() - 1))\n\t\t\t\t\t\t\trrzoneinfo.currentKillZone = 0;\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\trrzoneinfo.currentKillZone++;\n\n\t\t\t\t\t\trrzoneinfo.rabbitNotifiedWrongZone = true;\n\t\t\t\t\t\trrzoneinfo.rabbitNotifiedWrongZoneNum = i;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (zoneList[i].pointIn(player->pos) && player->spawned && player->team != eRabbitTeam && zoneList[i].zonekillhunter)\n\t\t\t\t\t{\n\t\t\t\t\t\tbz_killPlayer(player->playerID, true, BZ_SERVER);\n\t\t\t\t\t\tbz_sendTextMessage (BZ_SERVER, player->playerID, zoneList[i].playermessage.c_str());\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tbz_freePlayerRecord(player);\n\t}\n\n\tbz_deleteIntList(playerList);\n\treturn;\n}\n\nvoid RabidRabbitDieEventHandler::process ( bz_EventData *eventData )\n{\n\tif (eventData->eventType != bz_ePlayerDieEvent )\n\t\treturn;\n\n\tbz_PlayerDieEventData *DieData = (bz_PlayerDieEventData*)eventData;\n\n\tif (rrzoneinfo.cycleOnDie && DieData->team == eRabbitTeam)\n\t{\n\t\tunsigned int i = rrzoneinfo.currentKillZone;\n\t\tif (i == (zoneList.size() - 1))\n\t\t\trrzoneinfo.currentKillZone = 0;\n\t\telse\n\t\t\trrzoneinfo.currentKillZone++;\n\t}\n\n\treturn;\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>Whitespace<commit_after>\/\/ rabidRabbit.cpp : Defines the entry point for the DLL application.\n\n#include \"bzfsAPI.h\"\n#include <string>\n#include <vector>\n#include <map>\n#include <math.h>\n\nBZ_GET_PLUGIN_VERSION\n\nclass RabidRabbitHandler : public bz_CustomMapObjectHandler\n{\npublic:\n  virtual bool handle(bzApiString object, bz_CustomMapObjectInfo *data);\n};\n\nRabidRabbitHandler rabidrabbithandler;\n\nclass RabidRabbitEventHandler : public bz_EventHandler\n{\npublic:\n  virtual void process(bz_EventData *eventData);\n};\n\nRabidRabbitEventHandler\trabidrabbiteventHandler;\n\nclass RabidRabbitDieEventHandler : public bz_EventHandler\n{\npublic:\n  virtual void process(bz_EventData *eventData);\n};\n\nRabidRabbitDieEventHandler rabidrabbitdieeventhandler;\n\nBZF_PLUGIN_CALL int bz_Load(const char* \/*commandLineParameter*\/)\n{\n  bz_debugMessage(4,\"rabidRabbit plugin loaded\");\n  bz_registerCustomMapObject(\"RABIDRABBITZONE\",&rabidrabbithandler);\n  bz_registerCustomMapObject(\"RRSOUNDOFF\",&rabidrabbithandler);\n  bz_registerCustomMapObject(\"RRCYCLEONDIE\",&rabidrabbithandler);\n  bz_registerEvent(bz_eTickEvent,&rabidrabbiteventHandler);\n  bz_registerEvent(bz_ePlayerDieEvent ,&rabidrabbitdieeventhandler);\n  return 0;\n}\n\nBZF_PLUGIN_CALL int bz_Unload(void)\n{\n  bz_removeEvent(bz_eTickEvent,&rabidrabbiteventHandler);\n  bz_removeEvent(bz_ePlayerDieEvent,&rabidrabbitdieeventhandler);\n  bz_removeCustomMapObject(\"RABIDRABBITZONE\");\n  bz_removeCustomMapObject(\"RRSOUNDOFF\");\n  bz_removeCustomMapObject(\"RRCYCLEONDIE\");\n  bz_debugMessage(4,\"rabidRabbit plugin unloaded\");\n  return 0;\n}\n\nclass RRZoneInfo\n{\npublic:\n  RRZoneInfo()\n  {\n    currentKillZone = 0;\n    rabbitNotifiedWrongZone = false;\n    rabbitNotifiedWrongZoneNum = 0;\n    soundEnabled = true;\n    cycleOnDie = false;\n  }\n\n  unsigned int currentKillZone;\n  unsigned int rabbitNotifiedWrongZoneNum;\n  bool rabbitNotifiedWrongZone;\n  bool soundEnabled;\n  bool cycleOnDie;\n};\n\nRRZoneInfo rrzoneinfo;\n\nclass RabidRabbitZone\n{\npublic:\n  RabidRabbitZone()\n  {\n    zonekillhunter = false;\n    box = false;\n    xMax = xMin = yMax = yMin = zMax = zMin = rad = 0;\n    WW = \"\";\n    WWLifetime = 0;\n    WWPosition[0] = 0;\n    WWPosition[1] = 0;\n    WWPosition[2] = 0;\n    WWTilt = 0;\n    WWDirection = 0;\n    WWShotID = 0;\n    WWDT = 0;\n    WWRepeat = 0.5;\n    WWFired = false;\n    WWLastFired = 0;\n    pi = 3.14159265358979323846;\n  }\n\n  bool zonekillhunter;\n  bool box;\n  float xMax,xMin,yMax,yMin,zMax,zMin;\n  float rad;\n\n  bzApiString WW;\n  float WWLifetime, WWPosition[3], WWTilt, WWDirection, WWDT;\n  double pi, WWLastFired, WWRepeat;\n  bool WWFired;\n  int WWShotID;\n\n  std::string playermessage;\n  std::string servermessage;\n\n  bool pointIn(float pos[3])\n  {\n    if (box) {\n      if (pos[0] > xMax || pos[0] < xMin)\n\treturn false;\n\n      if (pos[1] > yMax || pos[1] < yMin)\n\treturn false;\n\n      if (pos[2] > zMax || pos[2] < zMin)\n\treturn false;\n    } else {\n      float vec[3];\n      vec[0] = pos[0]-xMax;\n      vec[1] = pos[1]-yMax;\n      vec[2] = pos[2]-zMax;\n\n      float dist = sqrt(vec[0]*vec[0]+vec[1]*vec[1]);\n      if (dist > rad)\n\treturn false;\n\n      if (pos[2] > zMax || pos[2] < zMin)\n\treturn false;\n    }\n    return true;\n  }\n};\n\nstd::vector <RabidRabbitZone> zoneList;\n\nbool RabidRabbitHandler::handle(bzApiString object, bz_CustomMapObjectInfo *data)\n{\n  if (object == \"RRSOUNDOFF\")\n    rrzoneinfo.soundEnabled = false;\n\n  if (object == \"RRCYCLEONDIE\")\n    rrzoneinfo.cycleOnDie = true;\n\n  if (object != \"RABIDRABBITZONE\" || !data)\n    return false;\n\n  RabidRabbitZone newZone;\n\n  \/\/ parse all the chunks\n  for (unsigned int i = 0; i < data->data.size(); i++) {\n    std::string line = data->data.get(i).c_str();\n\n    bzAPIStringList *nubs = bz_newStringList();\n    nubs->tokenize(line.c_str(),\" \",0,true);\n\n    if (nubs->size() > 0) {\n      std::string key = bz_toupper(nubs->get(0).c_str());\n\n      if (key == \"BBOX\" && nubs->size() > 6) {\n\tnewZone.box = true;\n\tnewZone.xMin = (float)atof(nubs->get(1).c_str());\n\tnewZone.xMax = (float)atof(nubs->get(2).c_str());\n\tnewZone.yMin = (float)atof(nubs->get(3).c_str());\n\tnewZone.yMax = (float)atof(nubs->get(4).c_str());\n\tnewZone.zMin = (float)atof(nubs->get(5).c_str());\n\tnewZone.zMax = (float)atof(nubs->get(6).c_str());\n      } else if (key == \"CYLINDER\" && nubs->size() > 5) {\n\tnewZone.box = false;\n\tnewZone.rad = (float)atof(nubs->get(5).c_str());\n\tnewZone.xMax =(float)atof(nubs->get(1).c_str());\n\tnewZone.yMax =(float)atof(nubs->get(2).c_str());\n\tnewZone.zMin =(float)atof(nubs->get(3).c_str());\n\tnewZone.zMax =(float)atof(nubs->get(4).c_str());\n      } else if (key == \"RRZONEWW\" && nubs->size() > 10) {\n\tnewZone.WW = nubs->get(1);\n\tnewZone.WWLifetime = (float)atof(nubs->get(2).c_str());\n\tnewZone.WWPosition[0] = (float)atof(nubs->get(3).c_str());\n\tnewZone.WWPosition[1] = (float)atof(nubs->get(4).c_str());\n\tnewZone.WWPosition[2] = (float)atof(nubs->get(5).c_str());\n\tnewZone.WWTilt = (float)atof(nubs->get(6).c_str());\n\tnewZone.WWTilt = (newZone.WWTilt \/ 360) * (2 * (float)newZone.pi);\n\tnewZone.WWDirection = (float)atof(nubs->get(7).c_str());\n\tnewZone.WWDirection = (newZone.WWDirection \/ 360) * (2 * (float)newZone.pi);\n\tnewZone.WWShotID = (int)atoi(nubs->get(8).c_str());\n\tnewZone.WWDT = (float)atof(nubs->get(9).c_str());\n\tnewZone.WWRepeat = (float)atof(nubs->get(10).c_str());\n      } else if (key == \"SERVERMESSAGE\" && nubs->size() > 1) {\n\tnewZone.servermessage = nubs->get(1).c_str();\n      } else if (key == \"ZONEKILLHUNTER\") {\n\tif (nubs->size() > 1)\n\t  newZone.playermessage = nubs->get(1).c_str();\n\tnewZone.zonekillhunter = true;\n      }\n    }\n    bz_deleteStringList(nubs);\n  }\n\n  zoneList.push_back(newZone);\n  bz_setMaxWaitTime((float)0.1);\n  return true;\n}\n\nvoid killAllHunters(std::string messagepass)\n{\n  bzAPIIntList *playerList = bz_newIntList();\n  bz_getPlayerIndexList(playerList);\n\n\n  for (unsigned int i = 0; i < playerList->size(); i++){\n\n    bz_PlayerRecord *player = bz_getPlayerByIndex(playerList->operator[](i));\n\n    if (player) {\n      if (player->team != eRabbitTeam) {\n\tbz_killPlayer(player->playerID, true, BZ_SERVER);\n\tbz_sendTextMessage(BZ_SERVER, player->playerID, messagepass.c_str());\n\tif (rrzoneinfo.soundEnabled)\n\t  bz_sendPlayCustomLocalSound(player->playerID,\"flag_lost\");\n      }\n      if (player->team == eRabbitTeam &&\n\t  rrzoneinfo.soundEnabled &&\n\t  bz_getTeamCount(eHunterTeam) > 0)\n\tbz_sendPlayCustomLocalSound(player->playerID,\"flag_won\");\n    }\n\n    bz_freePlayerRecord(player);\n  }\n\n  bz_deleteIntList(playerList);\n\n  return;\n}\n\n\nvoid RabidRabbitEventHandler::process(bz_EventData *eventData)\n{\n  if ((eventData->eventType != bz_eTickEvent) || (zoneList.size() < 2))\n    return;\n\n  for (unsigned int i = 0; i < zoneList.size(); i++) {\n    if (!zoneList[i].WWFired && rrzoneinfo.currentKillZone == i) {\n      bz_fireWorldWep(zoneList[i].WW.c_str(),\n\t\t      zoneList[i].WWLifetime,\n\t\t      BZ_SERVER,zoneList[i].WWPosition,\n\t\t      zoneList[i].WWTilt,\n\t\t      zoneList[i].WWDirection,\n\t\t      zoneList[i].WWShotID,\n\t\t      zoneList[i].WWDT);\n      zoneList[i].WWFired = true;\n      zoneList[i].WWLastFired = bz_getCurrentTime();\n    } else {\n      if ((bz_getCurrentTime() - zoneList[i].WWLastFired) > zoneList[i].WWRepeat)\n\tzoneList[i].WWFired = false;\n    }\n  }\n\n  bzAPIIntList *playerList = bz_newIntList();\n  bz_getPlayerIndexList(playerList);\n\n  for (unsigned int h = 0; h < playerList->size(); h++) {\n    bz_PlayerRecord *player = bz_getPlayerByIndex(playerList->operator[](h));\n\n    if (player) {\n\n      for (unsigned int i = 0; i < zoneList.size(); i++) {\n\tif (zoneList[i].pointIn(player->pos) &&\n\t    player->spawned && player->team == eRabbitTeam &&\n\t    rrzoneinfo.currentKillZone != i && !rrzoneinfo.rabbitNotifiedWrongZone) {\n\t  bz_sendTextMessage(BZ_SERVER,player->playerID,\n\t\t\t     \"You are not in the current Rabid Rabbit zone - try another.\");\n\t  rrzoneinfo.rabbitNotifiedWrongZone = true;\n\t  rrzoneinfo.rabbitNotifiedWrongZoneNum = i;\n\t}\n\n\tif (!zoneList[i].pointIn(player->pos) &&\n\t    player->spawned && player->team == eRabbitTeam &&\n\t    rrzoneinfo.rabbitNotifiedWrongZone &&\n\t    rrzoneinfo.rabbitNotifiedWrongZoneNum == i)\n\t  rrzoneinfo.rabbitNotifiedWrongZone = false;\n\n\tif (zoneList[i].pointIn(player->pos) &&\n\t    player->spawned &&\n\t    player->team == eRabbitTeam &&\n\t    rrzoneinfo.currentKillZone == i &&\n\t    bz_getTeamCount(eHunterTeam) > 0) {\n\t  killAllHunters(zoneList[i].servermessage);\n\n\t  rrzoneinfo.rabbitNotifiedWrongZone = true;\n\t  rrzoneinfo.rabbitNotifiedWrongZoneNum = i;\n\n\t  if (i == (zoneList.size() - 1))\n\t    rrzoneinfo.currentKillZone = 0;\n\t  else\n\t    rrzoneinfo.currentKillZone++;\n\n\t  rrzoneinfo.rabbitNotifiedWrongZone = true;\n\t  rrzoneinfo.rabbitNotifiedWrongZoneNum = i;\n\t}\n\n\tif (zoneList[i].pointIn(player->pos) &&\n\t    player->spawned &&\n\t    player->team != eRabbitTeam &&\n\t    zoneList[i].zonekillhunter) {\n\t  bz_killPlayer(player->playerID, true, BZ_SERVER);\n\t  bz_sendTextMessage (BZ_SERVER, player->playerID, zoneList[i].playermessage.c_str());\n\t}\n      }\n    }\n    bz_freePlayerRecord(player);\n  }\n\n  bz_deleteIntList(playerList);\n  return;\n}\n\nvoid RabidRabbitDieEventHandler::process(bz_EventData *eventData)\n{\n  if (eventData->eventType != bz_ePlayerDieEvent)\n    return;\n\n  bz_PlayerDieEventData *DieData = (bz_PlayerDieEventData*)eventData;\n\n  if (rrzoneinfo.cycleOnDie && DieData->team == eRabbitTeam) {\n    unsigned int i = rrzoneinfo.currentKillZone;\n    if (i == (zoneList.size() - 1))\n      rrzoneinfo.currentKillZone = 0;\n    else\n      rrzoneinfo.currentKillZone++;\n  }\n\n  return;\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  Program:   ORFEO Toolbox\n  Language:  C++\n  Date:      $Date$\n  Version:   $Revision$\n\n\n  Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n  See OTBCopyright.txt for details.\n\n\n  This software is distributed WITHOUT ANY WARRANTY; without even\n  the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n  PURPOSE.  See the above copyright notices for more information.\n\n=========================================================================*\/\n\n#include \"otbImage.h\"\n#include \"otbVectorImage.h\"\n#include \"otbGridResampleImageFilter.h\"\n#include \"itkResampleImageFilter.h\"\n#include \"itkRandomImageSource.h\"\n#include \"itkIdentityTransform.h\"\n#include \"itkTestingComparisonImageFilter.h\"\n\nint otbGridResampleImageFilter(int itkNotUsed(argc), char * itkNotUsed(argv)[])\n{\n\n  \/\/ This test is only to check that filter builds with VectorImage\n  \/\/ too  \n  typedef otb::VectorImage<double> VectorImageType;\n  typedef otb::GridResampleImageFilter<VectorImageType,VectorImageType> VectorFilterType;\n\n  VectorFilterType::Pointer vectorFilter = VectorFilterType::New();\n  \n  typedef otb::Image<double> ImageType;\n  typedef otb::GridResampleImageFilter<ImageType,ImageType> FilterType;\n  \n  FilterType::Pointer filter = FilterType::New();\n  \n  typedef itk::ResampleImageFilter<ImageType,ImageType> RefFilterType;\n\n  RefFilterType::Pointer refFilter = RefFilterType::New();\n\n  \/\/ We will resample a random image with GridResampleImageFilter and\n  \/\/ ResampleImageFilter, and check that outputs are the same\n  typedef itk::RandomImageSource<ImageType> RandomImageSourceType;\n\n  RandomImageSourceType::Pointer randomImageSource = RandomImageSourceType::New();\n\n  ImageType::SizeType size;\n  size.Fill(100);\n\n  randomImageSource->SetSize(size);\n  randomImageSource->Update();\n\n  filter->SetInput(randomImageSource->GetOutput());\n\n  refFilter->SetInput(randomImageSource->GetOutput());\n\n  typedef itk::IdentityTransform<double,2> IdentityTransformType;\n\n  IdentityTransformType::Pointer idTransform = IdentityTransformType::New();\n  refFilter->SetTransform(idTransform);\n\n  ImageType::SpacingType spacing;\n  spacing[0]=2.0;\n  spacing[1]=-2.0;\n  ImageType::PointType origin;\n  origin[0]=10.;\n  origin[1]=90.;\n  ImageType::SizeType outSize;\n  outSize.Fill(200);\n\n  filter->SetOutputSize(outSize);\n  filter->SetOutputOrigin(origin);\n  filter->SetOutputSpacing(spacing);\n  filter->Update();\n  \n  refFilter->SetSize(outSize);\n  refFilter->SetOutputOrigin(origin);\n  refFilter->SetOutputSpacing(spacing);\n  refFilter->Update();\n\n  typedef itk::Testing::ComparisonImageFilter<ImageType,ImageType> ComparisonFilterType;\n\n  ComparisonFilterType::Pointer comparisonFilter = ComparisonFilterType::New();\n  comparisonFilter->SetValidInput(refFilter->GetOutput());\n  comparisonFilter->SetTestInput(filter->GetOutput());\n  comparisonFilter->Update();\n\n  unsigned int nbPixelsWithDiff = comparisonFilter->GetNumberOfPixelsWithDifferences();\n\n  std::cout<<\"Number of pixels with differences: \"<<nbPixelsWithDiff<<std::endl;\n\n  if(nbPixelsWithDiff)\n    {\n    std::cerr<<\"Output of itk::GridResampleImageFilter does not match output of itk::ResampleImageFilter with same parameters\"<<std::endl;\n\n    return EXIT_FAILURE;\n    }\n  \n\n  return EXIT_SUCCESS;\n}\n<commit_msg>TEST: Add bounds for image values and write diff image if comparison fails<commit_after>\/*=========================================================================\n\n  Program:   ORFEO Toolbox\n  Language:  C++\n  Date:      $Date$\n  Version:   $Revision$\n\n\n  Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n  See OTBCopyright.txt for details.\n\n\n  This software is distributed WITHOUT ANY WARRANTY; without even\n  the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n  PURPOSE.  See the above copyright notices for more information.\n\n=========================================================================*\/\n\n#include \"otbImage.h\"\n#include \"otbVectorImage.h\"\n#include \"otbGridResampleImageFilter.h\"\n#include \"itkResampleImageFilter.h\"\n#include \"itkRandomImageSource.h\"\n#include \"itkIdentityTransform.h\"\n#include \"itkTestingComparisonImageFilter.h\"\n\n#include \"otbImageFileWriter.h\"\n\nint otbGridResampleImageFilter(int itkNotUsed(argc), char * itkNotUsed(argv)[])\n{\n\n  \/\/ This test is only to check that filter builds with VectorImage\n  \/\/ too  \n  typedef otb::VectorImage<double> VectorImageType;\n  typedef otb::GridResampleImageFilter<VectorImageType,VectorImageType> VectorFilterType;\n\n  VectorFilterType::Pointer vectorFilter = VectorFilterType::New();\n  \n  typedef otb::Image<double> ImageType;\n  typedef otb::GridResampleImageFilter<ImageType,ImageType> FilterType;\n  \n  FilterType::Pointer filter = FilterType::New();\n  \n  typedef itk::ResampleImageFilter<ImageType,ImageType> RefFilterType;\n\n  RefFilterType::Pointer refFilter = RefFilterType::New();\n\n  \/\/ We will resample a random image with GridResampleImageFilter and\n  \/\/ ResampleImageFilter, and check that outputs are the same\n  typedef itk::RandomImageSource<ImageType> RandomImageSourceType;\n\n  RandomImageSourceType::Pointer randomImageSource = RandomImageSourceType::New();\n\n  ImageType::SizeType size;\n  size.Fill(100);\n\n  randomImageSource->SetSize(size);\n  randomImageSource->SetMin(0);\n  randomImageSource->SetMax(1000);\n  \n  randomImageSource->Update();\n\n  filter->SetInput(randomImageSource->GetOutput());\n\n  refFilter->SetInput(randomImageSource->GetOutput());\n\n  typedef itk::IdentityTransform<double,2> IdentityTransformType;\n\n  IdentityTransformType::Pointer idTransform = IdentityTransformType::New();\n  refFilter->SetTransform(idTransform);\n\n  ImageType::SpacingType spacing;\n  spacing[0]=2.0;\n  spacing[1]=-2.0;\n  ImageType::PointType origin;\n  origin[0]=10.;\n  origin[1]=90.;\n  ImageType::SizeType outSize;\n  outSize.Fill(200);\n\n  filter->SetOutputSize(outSize);\n  filter->SetOutputOrigin(origin);\n  filter->SetOutputSpacing(spacing);\n  filter->Update();\n  \n  refFilter->SetSize(outSize);\n  refFilter->SetOutputOrigin(origin);\n  refFilter->SetOutputSpacing(spacing);\n  refFilter->Update();\n\n  typedef itk::Testing::ComparisonImageFilter<ImageType,ImageType> ComparisonFilterType;\n\n  ComparisonFilterType::Pointer comparisonFilter = ComparisonFilterType::New();\n  comparisonFilter->SetValidInput(refFilter->GetOutput());\n  comparisonFilter->SetTestInput(filter->GetOutput());\n  comparisonFilter->Update();\n\n  unsigned int nbPixelsWithDiff = comparisonFilter->GetNumberOfPixelsWithDifferences();\n\n  std::cout<<\"Number of pixels with differences: \"<<nbPixelsWithDiff<<std::endl;\n\n  if(nbPixelsWithDiff)\n    {\n    std::cerr<<\"Output of itk::GridResampleImageFilter does not match output of itk::ResampleImageFilter with same parameters\"<<std::endl;\n\n    typedef otb::ImageFileWriter<ImageType> WriterType;\n    WriterType::Pointer writer = WriterType::New();\n    writer->SetInput(comparisonFilter->GetOutput());\n    writer->SetFileName(\"otbGridResampleImageFilterTestOutput.tif\");\n    writer->Update();\n    \n    return EXIT_FAILURE;\n    }\n  \n\n  return EXIT_SUCCESS;\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 \"mitkGrabCutOpenCVImageFilter.h\"\n#include <mitkTestingMacros.h>\n\n#include \"itkIndex.h\"\n\n#include <highgui.h>\n#include <cv.h>\n\n#include <sys\/time.h>\n\nstatic void GrabCutTestLoadedImage(std::string imagePath, std::string maskPath)\n{\n  \/\/ load test images\n  cv::Mat image = cvLoadImage(imagePath.c_str());\n  cv::Mat maskImage = cvLoadImage(maskPath.c_str());\n\n  \/\/ make sure that loaded mask is a gray scale image\n  cv::Mat maskImageGray;\n  cv::cvtColor(maskImage, maskImageGray, CV_RGB2GRAY, 1);\n\n  \/\/ extract foreground points from loaded mask image\n  cv::Mat foregroundMask;\n  cv::compare(maskImageGray, 250, foregroundMask, cv::CMP_GE);\n\n  cv::Mat foregroundPoints;\n  cv::findNonZero(foregroundMask, foregroundPoints);\n\n  std::vector<itk::Index<2> > foregroundPointsVector;\n  for ( size_t n = 0; n < foregroundPoints.total(); ++n)\n  {\n    itk::Index<2> index;\n    index = {{foregroundPoints.at<cv::Point>(n).x, foregroundPoints.at<cv::Point>(n).y}};\n    foregroundPointsVector.push_back(index);\n  }\n\n  mitk::GrabCutOpenCVImageFilter::Pointer grabCutFilter\n      = mitk::GrabCutOpenCVImageFilter::New();\n\n  MITK_TEST_CONDITION(!grabCutFilter->FilterImage(image), \"Filtering should return false as no foreground points are set.\")\n\n  grabCutFilter->AddForegroundPoints(foregroundPointsVector);\n\n  timeval t1, t2;\n  gettimeofday(&t1, NULL); \/\/ start timer\n\n  MITK_TEST_CONDITION(grabCutFilter->FilterImage(image), \"Filtering should return true for sucess.\")\n\n  gettimeofday(&t2, NULL); \/\/ stop timer\n\n  double elapsedTime = (t2.tv_sec - t1.tv_sec) * 1000.0;  \/\/ sec to ms\n  elapsedTime += (t2.tv_usec - t1.tv_usec) \/ 1000.0;      \/\/ us to ms\n\n  MITK_INFO << \"GrabCut duration: \" << elapsedTime << \"ms\";\n\n  cv::imwrite(\"\/home\/wintersa\/output.png\", grabCutFilter->GetResultMask());\n}\n\nint mitkGrabCutOpenCVImageFilterTest(int argc, char* argv[])\n{\n  MITK_TEST_BEGIN(\"GrabCutOpenCVImageFilter\")\n\n  MITK_TEST_CONDITION_REQUIRED(argc == 3, \"Test needs three command line parameters.\")\n\n  GrabCutTestLoadedImage(argv[1], argv[2]);\n\n  MITK_TEST_END() \/\/ always end with this!\n}\n<commit_msg>Testing cropped image.<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 \"mitkGrabCutOpenCVImageFilter.h\"\n#include <mitkTestingMacros.h>\n\n#include \"itkIndex.h\"\n\n#include <highgui.h>\n#include <cv.h>\n\n#include <sys\/time.h>\n\nstatic void GrabCutTestLoadedImage(std::string imagePath, std::string maskPath)\n{\n  \/\/ load test images\n  cv::Mat image = cvLoadImage(imagePath.c_str());\n  cv::Mat maskImage = cvLoadImage(maskPath.c_str());\n\n  \/\/ make sure that loaded mask is a gray scale image\n  cv::Mat maskImageGray;\n  cv::cvtColor(maskImage, maskImageGray, CV_RGB2GRAY, 1);\n\n  cv::Mat foregroundMask; cv::Mat foregroundPoints;\n  cv::compare(maskImageGray, 200, foregroundMask, cv::CMP_GE);\n  cv::findNonZero(foregroundMask, foregroundPoints);\n  cv::Rect foregroundRect = cv::boundingRect(foregroundPoints);\n\n  \/\/cv::Rect foregroundRect(0,0,image.cols,image.rows);\n\n  \/\/ extract foreground points from loaded mask image\n  cv::compare(maskImageGray, 250, foregroundMask, cv::CMP_GE);\n\n  cv::findNonZero(foregroundMask(foregroundRect), foregroundPoints);\n\n  std::vector<itk::Index<2> > foregroundPointsVector;\n  for ( size_t n = 0; n < foregroundPoints.total(); ++n)\n  {\n    itk::Index<2> index;\n    index = {{foregroundPoints.at<cv::Point>(n).x, foregroundPoints.at<cv::Point>(n).y}};\n    foregroundPointsVector.push_back(index);\n  }\n\n  mitk::GrabCutOpenCVImageFilter::Pointer grabCutFilter\n      = mitk::GrabCutOpenCVImageFilter::New();\n\n  cv::Mat croppedImage = image(foregroundRect);\n  \/\/imwrite(\"\/home\/wintersa\/output-cropped.png\", croppedImage);\n  MITK_TEST_CONDITION(!grabCutFilter->FilterImage(croppedImage), \"Filtering should return false as no foreground points are set.\")\n\n  grabCutFilter->AddForegroundPoints(foregroundPointsVector);\n\n  timeval t1, t2;\n  gettimeofday(&t1, NULL); \/\/ start timer\n\n  MITK_TEST_CONDITION(grabCutFilter->FilterImage(croppedImage), \"Filtering should return true for sucess.\")\n\n  gettimeofday(&t2, NULL); \/\/ stop timer\n\n  double elapsedTime = (t2.tv_sec - t1.tv_sec) * 1000.0;  \/\/ sec to ms\n  elapsedTime += (t2.tv_usec - t1.tv_usec) \/ 1000.0;      \/\/ us to ms\n\n  MITK_INFO << \"GrabCut duration: \" << elapsedTime << \"ms\";\n\n  cv::imwrite(\"\/home\/wintersa\/output.png\", grabCutFilter->GetResultMask());\n}\n\nint mitkGrabCutOpenCVImageFilterTest(int argc, char* argv[])\n{\n  MITK_TEST_BEGIN(\"GrabCutOpenCVImageFilter\")\n\n  MITK_TEST_CONDITION_REQUIRED(argc == 3, \"Test needs three command line parameters.\")\n\n  GrabCutTestLoadedImage(argv[1], argv[2]);\n\n  MITK_TEST_END() \/\/ always end with this!\n}\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2014 Digia Plc and\/or its subsidiary(-ies).\n** Contact: http:\/\/www.qt-project.org\/legal\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia.  For licensing terms and\n** conditions see http:\/\/qt.digia.com\/licensing.  For further information\n** use the contact form at http:\/\/qt.digia.com\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Digia gives you certain additional\n** rights.  These rights are described in the Digia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n****************************************************************************\/\n\n#include \"iosrunconfiguration.h\"\n#include \"iosmanager.h\"\n#include \"iosdeploystep.h\"\n#include \"ui_iosrunconfiguration.h\"\n\n#include <projectexplorer\/kitinformation.h>\n#include <projectexplorer\/target.h>\n#include <projectexplorer\/deployconfiguration.h>\n#include <projectexplorer\/devicesupport\/devicemanager.h>\n#include <projectexplorer\/buildstep.h>\n#include <projectexplorer\/buildsteplist.h>\n#include <qmakeprojectmanager\/qmakebuildconfiguration.h>\n#include <qmakeprojectmanager\/qmakeproject.h>\n#include <qmakeprojectmanager\/qmakenodes.h>\n#include <qtsupport\/qtoutputformatter.h>\n#include <qtsupport\/qtkitinformation.h>\n\n#include <QList>\n\n#include <utils\/qtcprocess.h>\n#include <utils\/qtcassert.h>\n\nusing namespace ProjectExplorer;\nusing namespace QmakeProjectManager;\nusing namespace Utils;\n\nnamespace Ios {\nnamespace Internal {\n\nconst QLatin1String runConfigurationKey(\"Ios.run_arguments\");\n\nclass IosRunConfigurationWidget : public RunConfigWidget\n{\n    Q_OBJECT\n\npublic:\n    IosRunConfigurationWidget(IosRunConfiguration *runConfiguration);\n    ~IosRunConfigurationWidget();\n    QString argListToString(const QStringList &args) const;\n    QStringList stringToArgList(const QString &args) const;\n    QString displayName() const;\n\nprivate slots:\n    void argumentsLineEditTextEdited();\n    void updateValues();\n\nprivate:\n    Ui::IosRunConfiguration *m_ui;\n    IosRunConfiguration *m_runConfiguration;\n};\n\nIosRunConfiguration::IosRunConfiguration(Target *parent, Core::Id id, const QString &path)\n    : RunConfiguration(parent, id)\n    , m_profilePath(path)\n{\n    init();\n}\n\nIosRunConfiguration::IosRunConfiguration(Target *parent, IosRunConfiguration *source)\n    : RunConfiguration(parent, source)\n    , m_profilePath(source->m_profilePath)\n    , m_arguments(source->m_arguments)\n{\n    init();\n}\n\nvoid IosRunConfiguration::init()\n{\n    QmakeProject *project = static_cast<QmakeProject *>(target()->project());\n    m_parseSuccess = project->validParse(m_profilePath);\n    m_parseInProgress = project->parseInProgress(m_profilePath);\n    m_lastIsEnabled = isEnabled();\n    m_lastDisabledReason = disabledReason();\n    connect(DeviceManager::instance(), SIGNAL(updated()),\n            SLOT(deviceChanges()));\n    connect(KitManager::instance(), SIGNAL(kitsChanged()),\n            SLOT(deviceChanges()));\n    connect(target()->project(), SIGNAL(proFileUpdated(QmakeProjectManager::QmakeProFileNode*,bool,bool)),\n            this, SLOT(proFileUpdated(QmakeProjectManager::QmakeProFileNode*,bool,bool)));\n}\n\nvoid IosRunConfiguration::enabledCheck()\n{\n    bool newIsEnabled = isEnabled();\n    QString newDisabledReason = disabledReason();\n    if (newDisabledReason != m_lastDisabledReason || newIsEnabled != m_lastIsEnabled) {\n        m_lastDisabledReason = newDisabledReason;\n        m_lastIsEnabled = newIsEnabled;\n        emit enabledChanged();\n    }\n}\n\nvoid IosRunConfiguration::deviceChanges() {\n    setDefaultDisplayName(defaultDisplayName());\n    enabledCheck();\n}\n\nvoid IosRunConfiguration::proFileUpdated(QmakeProjectManager::QmakeProFileNode *pro, bool success,\n                                         bool parseInProgress)\n{\n    if (m_profilePath != pro->path())\n        return;\n    m_parseSuccess = success;\n    m_parseInProgress = parseInProgress;\n    enabledCheck();\n}\n\nQWidget *IosRunConfiguration::createConfigurationWidget()\n{\n    return new IosRunConfigurationWidget(this);\n}\n\nUtils::OutputFormatter *IosRunConfiguration::createOutputFormatter() const\n{\n    return new QtSupport::QtOutputFormatter(target()->project());\n}\n\nQStringList IosRunConfiguration::commandLineArguments()\n{\n    return m_arguments;\n}\n\nQString IosRunConfiguration::defaultDisplayName()\n{\n    ProjectExplorer::IDevice::ConstPtr dev =\n            ProjectExplorer::DeviceKitInformation::device(target()->kit());\n    const QString devName = dev.isNull() ? IosDevice::name() : dev->displayName();\n    return tr(\"Run on %1\").arg(devName);\n}\n\nIosDeployStep *IosRunConfiguration::deployStep() const\n{\n    IosDeployStep * step = 0;\n    DeployConfiguration *config = target()->activeDeployConfiguration();\n    ProjectExplorer::BuildStepList *bsl = config->stepList();\n    if (bsl) {\n        const QList<ProjectExplorer::BuildStep *> &buildSteps = bsl->steps();\n        for (int i = buildSteps.count() - 1; i >= 0; --i) {\n            step = qobject_cast<IosDeployStep *>(buildSteps.at(i));\n            if (step)\n                break;\n        }\n    }\n    Q_ASSERT_X(step, Q_FUNC_INFO, \"Impossible: iOS build configuration without deploy step.\");\n    return step;\n}\n\nQString IosRunConfiguration::profilePath() const\n{\n    return m_profilePath;\n}\n\nQString IosRunConfiguration::appName() const\n{\n    QmakeProject *pro = qobject_cast<QmakeProject *>(target()->project());\n    if (pro) {\n        const QmakeProFileNode *node = pro->rootQmakeProjectNode()->findProFileFor(profilePath());\n        if (node) {\n            TargetInformation ti = node->targetInformation();\n            if (ti.valid)\n                return ti.target;\n        }\n    }\n    qDebug() << \"IosRunConfiguration::appName failed\";\n    return QString();\n}\n\nUtils::FileName IosRunConfiguration::bundleDir() const\n{\n    Utils::FileName res;\n    Core::Id devType = ProjectExplorer::DeviceTypeKitInformation::deviceTypeId(target()->kit());\n    bool isDevice = (devType == Constants::IOS_DEVICE_TYPE);\n    if (!isDevice && devType != Constants::IOS_SIMULATOR_TYPE) {\n        qDebug() << \"unexpected device type in bundleDirForTarget: \" << devType.toString();\n        return res;\n    }\n    QmakeBuildConfiguration *bc =\n            qobject_cast<QmakeBuildConfiguration *>(target()->activeBuildConfiguration());\n    if (bc) {\n        QmakeProject *pro = qobject_cast<QmakeProject *>(target()->project());\n        const QmakeProFileNode *node = pro->rootQmakeProjectNode()->findProFileFor(profilePath());\n        if (node) {\n            TargetInformation ti = node->targetInformation();\n            if (ti.valid)\n                res = FileName::fromString(ti.buildDir);\n        }\n        if (res.isEmpty())\n            res = bc->buildDirectory();\n        switch (bc->buildType()) {\n        case BuildConfiguration::Debug :\n        case BuildConfiguration::Unknown :\n            if (isDevice)\n                res.appendPath(QLatin1String(\"Debug-iphoneos\"));\n            else\n                res.appendPath(QLatin1String(\"Debug-iphonesimulator\"));\n            break;\n        case BuildConfiguration::Release :\n            if (isDevice)\n                res.appendPath(QLatin1String(\"Release-iphoneos\"));\n            else\n                res.appendPath(QLatin1String(\"\/Release-iphonesimulator\"));\n            break;\n        default:\n            qDebug() << \"IosBuildStep had an unknown buildType \"\n                     << target()->activeBuildConfiguration()->buildType();\n        }\n    }\n    res.appendPath(appName() + QLatin1String(\".app\"));\n    return res;\n}\n\nUtils::FileName IosRunConfiguration::exePath() const\n{\n    return bundleDir().appendPath(appName());\n}\n\nbool IosRunConfiguration::fromMap(const QVariantMap &map)\n{\n    m_arguments = map.value(runConfigurationKey).toStringList();\n    return RunConfiguration::fromMap(map);\n}\n\nQVariantMap IosRunConfiguration::toMap() const\n{\n    QVariantMap res = RunConfiguration::toMap();\n    res[runConfigurationKey] = m_arguments;\n    return res;\n}\n\nbool IosRunConfiguration::isEnabled() const\n{\n    if (m_parseInProgress || !m_parseSuccess)\n        return false;\n    Core::Id devType = ProjectExplorer::DeviceTypeKitInformation::deviceTypeId(target()->kit());\n    if (devType != Constants::IOS_DEVICE_TYPE && devType != Constants::IOS_SIMULATOR_TYPE)\n        return false;\n    IDevice::ConstPtr dev = ProjectExplorer::DeviceKitInformation::device(target()->kit());\n    if (dev.isNull() || dev->deviceState() != IDevice::DeviceReadyToUse)\n        return false;\n    return RunConfiguration::isEnabled();\n}\n\nQString IosRunConfiguration::disabledReason() const\n{\n    if (m_parseInProgress)\n        return tr(\"The .pro file '%1' is currently being parsed.\")\n                .arg(QFileInfo(m_profilePath).fileName());\n    if (!m_parseSuccess)\n        return static_cast<QmakeProject *>(target()->project())\n                ->disabledReasonForRunConfiguration(m_profilePath);\n    Core::Id devType = ProjectExplorer::DeviceTypeKitInformation::deviceTypeId(target()->kit());\n    if (devType != Constants::IOS_DEVICE_TYPE && devType != Constants::IOS_SIMULATOR_TYPE)\n        return tr(\"Kit has incorrect device type for running on iOS devices.\");\n    IDevice::ConstPtr dev = ProjectExplorer::DeviceKitInformation::device(target()->kit());\n    QString validDevName;\n    bool hasConncetedDev = false;\n    if (devType == Constants::IOS_DEVICE_TYPE) {\n        DeviceManager *dm = DeviceManager::instance();\n        for (int idev = 0; idev < dm->deviceCount(); ++idev) {\n            IDevice::ConstPtr availDev = dm->deviceAt(idev);\n            if (!availDev.isNull() && availDev->type() == Constants::IOS_DEVICE_TYPE) {\n                if (availDev->deviceState() == IDevice::DeviceReadyToUse) {\n                    validDevName += QLatin1String(\" \");\n                    validDevName += availDev->displayName();\n                } else if (availDev->deviceState() == IDevice::DeviceConnected) {\n                    hasConncetedDev = true;\n                }\n            }\n        }\n    }\n\n    if (dev.isNull()) {\n        if (!validDevName.isEmpty())\n            return tr(\"No device chosen. Select %1.\").arg(validDevName); \/\/ should not happen\n        else if (hasConncetedDev)\n            return tr(\"No device chosen. Enable developer mode on a device.\"); \/\/ should not happen\n        else\n            return tr(\"No device available.\");\n    } else {\n        switch (dev->deviceState()) {\n        case IDevice::DeviceReadyToUse:\n            break;\n        case IDevice::DeviceConnected:\n            return tr(\"To use this device you need to enable developer mode on it.\");\n        case IDevice::DeviceDisconnected:\n        case IDevice::DeviceStateUnknown:\n            if (!validDevName.isEmpty())\n                return tr(\"%1 is not connected. Select %2?\")\n                        .arg(dev->displayName(), validDevName);\n            else if (hasConncetedDev)\n                return tr(\"%1 is not connected. Enable developer mode on a device?\")\n                        .arg(dev->displayName());\n            else\n                return tr(\"%1 is not connected.\").arg(dev->displayName());\n        }\n    }\n    return RunConfiguration::disabledReason();\n}\n\nIosRunConfigurationWidget::IosRunConfigurationWidget(IosRunConfiguration *runConfiguration) :\n    m_ui(new Ui::IosRunConfiguration), m_runConfiguration(runConfiguration)\n{\n    m_ui->setupUi(this);\n\n    updateValues();\n    connect(m_ui->argumentsLineEdit, SIGNAL(editingFinished()),\n            SLOT(argumentsLineEditTextEdited()));\n    connect(runConfiguration->target(), SIGNAL(buildDirectoryChanged()),\n            SLOT(updateValues()));\n}\n\nIosRunConfigurationWidget::~IosRunConfigurationWidget()\n{\n    delete m_ui;\n}\n\nQString IosRunConfigurationWidget::argListToString(const QStringList &args) const\n{\n    return Utils::QtcProcess::joinArgs(args);\n}\n\nQStringList IosRunConfigurationWidget::stringToArgList(const QString &args) const\n{\n    QtcProcess::SplitError err;\n    QStringList res = QtcProcess::splitArgs(args, OsTypeMac, false, &err);\n    switch (err) {\n    case QtcProcess::SplitOk:\n        break;\n    case QtcProcess::BadQuoting:\n        if (args.at(args.size()-1) == QLatin1Char('\\\\')) {\n            res = QtcProcess::splitArgs(args + QLatin1Char('\\\\'), OsTypeMac, false, &err);\n            if (err != QtcProcess::SplitOk)\n                res = QtcProcess::splitArgs(args + QLatin1Char('\\\\') + QLatin1Char('\\''),\n                                            OsTypeMac, false, &err);\n            if (err != QtcProcess::SplitOk)\n                res = QtcProcess::splitArgs(args + QLatin1Char('\\\\') + QLatin1Char('\\\"'),\n                                            OsTypeMac, false, &err);\n        }\n        if (err != QtcProcess::SplitOk)\n            res = QtcProcess::splitArgs(args + QLatin1Char('\\''), OsTypeMac, false, &err);\n        if (err != QtcProcess::SplitOk)\n            res = QtcProcess::splitArgs(args + QLatin1Char('\\\"'), OsTypeMac, false, &err);\n        break;\n    case QtcProcess::FoundMeta:\n        qDebug() << \"IosRunConfigurationWidget FoundMeta (should not happen)\";\n        break;\n    }\n    return res;\n}\n\nQString IosRunConfigurationWidget::displayName() const\n{\n    return tr(\"iOS run settings\");\n}\n\nvoid IosRunConfigurationWidget::argumentsLineEditTextEdited()\n{\n    QString argsString = m_ui->argumentsLineEdit->text();\n    QStringList args = stringToArgList(argsString);\n    m_runConfiguration->m_arguments = args;\n    m_ui->argumentsLineEdit->setText(argListToString(args));\n}\n\nvoid IosRunConfigurationWidget::updateValues()\n{\n    QStringList args = m_runConfiguration->m_arguments;\n    QString argsString = argListToString(args);\n    m_ui->argumentsLineEdit->setText(argsString);\n    m_ui->executableLineEdit->setText(m_runConfiguration->exePath().toUserOutput());\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace Ios\n\n#include \"iosrunconfiguration.moc\"\n<commit_msg>ios: use consistent paths in build dir creation<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2014 Digia Plc and\/or its subsidiary(-ies).\n** Contact: http:\/\/www.qt-project.org\/legal\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia.  For licensing terms and\n** conditions see http:\/\/qt.digia.com\/licensing.  For further information\n** use the contact form at http:\/\/qt.digia.com\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Digia gives you certain additional\n** rights.  These rights are described in the Digia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n****************************************************************************\/\n\n#include \"iosrunconfiguration.h\"\n#include \"iosmanager.h\"\n#include \"iosdeploystep.h\"\n#include \"ui_iosrunconfiguration.h\"\n\n#include <projectexplorer\/kitinformation.h>\n#include <projectexplorer\/target.h>\n#include <projectexplorer\/deployconfiguration.h>\n#include <projectexplorer\/devicesupport\/devicemanager.h>\n#include <projectexplorer\/buildstep.h>\n#include <projectexplorer\/buildsteplist.h>\n#include <qmakeprojectmanager\/qmakebuildconfiguration.h>\n#include <qmakeprojectmanager\/qmakeproject.h>\n#include <qmakeprojectmanager\/qmakenodes.h>\n#include <qtsupport\/qtoutputformatter.h>\n#include <qtsupport\/qtkitinformation.h>\n\n#include <QList>\n\n#include <utils\/qtcprocess.h>\n#include <utils\/qtcassert.h>\n\nusing namespace ProjectExplorer;\nusing namespace QmakeProjectManager;\nusing namespace Utils;\n\nnamespace Ios {\nnamespace Internal {\n\nconst QLatin1String runConfigurationKey(\"Ios.run_arguments\");\n\nclass IosRunConfigurationWidget : public RunConfigWidget\n{\n    Q_OBJECT\n\npublic:\n    IosRunConfigurationWidget(IosRunConfiguration *runConfiguration);\n    ~IosRunConfigurationWidget();\n    QString argListToString(const QStringList &args) const;\n    QStringList stringToArgList(const QString &args) const;\n    QString displayName() const;\n\nprivate slots:\n    void argumentsLineEditTextEdited();\n    void updateValues();\n\nprivate:\n    Ui::IosRunConfiguration *m_ui;\n    IosRunConfiguration *m_runConfiguration;\n};\n\nIosRunConfiguration::IosRunConfiguration(Target *parent, Core::Id id, const QString &path)\n    : RunConfiguration(parent, id)\n    , m_profilePath(path)\n{\n    init();\n}\n\nIosRunConfiguration::IosRunConfiguration(Target *parent, IosRunConfiguration *source)\n    : RunConfiguration(parent, source)\n    , m_profilePath(source->m_profilePath)\n    , m_arguments(source->m_arguments)\n{\n    init();\n}\n\nvoid IosRunConfiguration::init()\n{\n    QmakeProject *project = static_cast<QmakeProject *>(target()->project());\n    m_parseSuccess = project->validParse(m_profilePath);\n    m_parseInProgress = project->parseInProgress(m_profilePath);\n    m_lastIsEnabled = isEnabled();\n    m_lastDisabledReason = disabledReason();\n    connect(DeviceManager::instance(), SIGNAL(updated()),\n            SLOT(deviceChanges()));\n    connect(KitManager::instance(), SIGNAL(kitsChanged()),\n            SLOT(deviceChanges()));\n    connect(target()->project(), SIGNAL(proFileUpdated(QmakeProjectManager::QmakeProFileNode*,bool,bool)),\n            this, SLOT(proFileUpdated(QmakeProjectManager::QmakeProFileNode*,bool,bool)));\n}\n\nvoid IosRunConfiguration::enabledCheck()\n{\n    bool newIsEnabled = isEnabled();\n    QString newDisabledReason = disabledReason();\n    if (newDisabledReason != m_lastDisabledReason || newIsEnabled != m_lastIsEnabled) {\n        m_lastDisabledReason = newDisabledReason;\n        m_lastIsEnabled = newIsEnabled;\n        emit enabledChanged();\n    }\n}\n\nvoid IosRunConfiguration::deviceChanges() {\n    setDefaultDisplayName(defaultDisplayName());\n    enabledCheck();\n}\n\nvoid IosRunConfiguration::proFileUpdated(QmakeProjectManager::QmakeProFileNode *pro, bool success,\n                                         bool parseInProgress)\n{\n    if (m_profilePath != pro->path())\n        return;\n    m_parseSuccess = success;\n    m_parseInProgress = parseInProgress;\n    enabledCheck();\n}\n\nQWidget *IosRunConfiguration::createConfigurationWidget()\n{\n    return new IosRunConfigurationWidget(this);\n}\n\nUtils::OutputFormatter *IosRunConfiguration::createOutputFormatter() const\n{\n    return new QtSupport::QtOutputFormatter(target()->project());\n}\n\nQStringList IosRunConfiguration::commandLineArguments()\n{\n    return m_arguments;\n}\n\nQString IosRunConfiguration::defaultDisplayName()\n{\n    ProjectExplorer::IDevice::ConstPtr dev =\n            ProjectExplorer::DeviceKitInformation::device(target()->kit());\n    const QString devName = dev.isNull() ? IosDevice::name() : dev->displayName();\n    return tr(\"Run on %1\").arg(devName);\n}\n\nIosDeployStep *IosRunConfiguration::deployStep() const\n{\n    IosDeployStep * step = 0;\n    DeployConfiguration *config = target()->activeDeployConfiguration();\n    ProjectExplorer::BuildStepList *bsl = config->stepList();\n    if (bsl) {\n        const QList<ProjectExplorer::BuildStep *> &buildSteps = bsl->steps();\n        for (int i = buildSteps.count() - 1; i >= 0; --i) {\n            step = qobject_cast<IosDeployStep *>(buildSteps.at(i));\n            if (step)\n                break;\n        }\n    }\n    Q_ASSERT_X(step, Q_FUNC_INFO, \"Impossible: iOS build configuration without deploy step.\");\n    return step;\n}\n\nQString IosRunConfiguration::profilePath() const\n{\n    return m_profilePath;\n}\n\nQString IosRunConfiguration::appName() const\n{\n    QmakeProject *pro = qobject_cast<QmakeProject *>(target()->project());\n    if (pro) {\n        const QmakeProFileNode *node = pro->rootQmakeProjectNode()->findProFileFor(profilePath());\n        if (node) {\n            TargetInformation ti = node->targetInformation();\n            if (ti.valid)\n                return ti.target;\n        }\n    }\n    qDebug() << \"IosRunConfiguration::appName failed\";\n    return QString();\n}\n\nUtils::FileName IosRunConfiguration::bundleDir() const\n{\n    Utils::FileName res;\n    Core::Id devType = ProjectExplorer::DeviceTypeKitInformation::deviceTypeId(target()->kit());\n    bool isDevice = (devType == Constants::IOS_DEVICE_TYPE);\n    if (!isDevice && devType != Constants::IOS_SIMULATOR_TYPE) {\n        qDebug() << \"unexpected device type in bundleDirForTarget: \" << devType.toString();\n        return res;\n    }\n    QmakeBuildConfiguration *bc =\n            qobject_cast<QmakeBuildConfiguration *>(target()->activeBuildConfiguration());\n    if (bc) {\n        QmakeProject *pro = qobject_cast<QmakeProject *>(target()->project());\n        const QmakeProFileNode *node = pro->rootQmakeProjectNode()->findProFileFor(profilePath());\n        if (node) {\n            TargetInformation ti = node->targetInformation();\n            if (ti.valid)\n                res = FileName::fromString(ti.buildDir);\n        }\n        if (res.isEmpty())\n            res = bc->buildDirectory();\n        switch (bc->buildType()) {\n        case BuildConfiguration::Debug :\n        case BuildConfiguration::Unknown :\n            if (isDevice)\n                res.appendPath(QLatin1String(\"Debug-iphoneos\"));\n            else\n                res.appendPath(QLatin1String(\"Debug-iphonesimulator\"));\n            break;\n        case BuildConfiguration::Release :\n            if (isDevice)\n                res.appendPath(QLatin1String(\"Release-iphoneos\"));\n            else\n                res.appendPath(QLatin1String(\"Release-iphonesimulator\"));\n            break;\n        default:\n            qDebug() << \"IosBuildStep had an unknown buildType \"\n                     << target()->activeBuildConfiguration()->buildType();\n        }\n    }\n    res.appendPath(appName() + QLatin1String(\".app\"));\n    return res;\n}\n\nUtils::FileName IosRunConfiguration::exePath() const\n{\n    return bundleDir().appendPath(appName());\n}\n\nbool IosRunConfiguration::fromMap(const QVariantMap &map)\n{\n    m_arguments = map.value(runConfigurationKey).toStringList();\n    return RunConfiguration::fromMap(map);\n}\n\nQVariantMap IosRunConfiguration::toMap() const\n{\n    QVariantMap res = RunConfiguration::toMap();\n    res[runConfigurationKey] = m_arguments;\n    return res;\n}\n\nbool IosRunConfiguration::isEnabled() const\n{\n    if (m_parseInProgress || !m_parseSuccess)\n        return false;\n    Core::Id devType = ProjectExplorer::DeviceTypeKitInformation::deviceTypeId(target()->kit());\n    if (devType != Constants::IOS_DEVICE_TYPE && devType != Constants::IOS_SIMULATOR_TYPE)\n        return false;\n    IDevice::ConstPtr dev = ProjectExplorer::DeviceKitInformation::device(target()->kit());\n    if (dev.isNull() || dev->deviceState() != IDevice::DeviceReadyToUse)\n        return false;\n    return RunConfiguration::isEnabled();\n}\n\nQString IosRunConfiguration::disabledReason() const\n{\n    if (m_parseInProgress)\n        return tr(\"The .pro file '%1' is currently being parsed.\")\n                .arg(QFileInfo(m_profilePath).fileName());\n    if (!m_parseSuccess)\n        return static_cast<QmakeProject *>(target()->project())\n                ->disabledReasonForRunConfiguration(m_profilePath);\n    Core::Id devType = ProjectExplorer::DeviceTypeKitInformation::deviceTypeId(target()->kit());\n    if (devType != Constants::IOS_DEVICE_TYPE && devType != Constants::IOS_SIMULATOR_TYPE)\n        return tr(\"Kit has incorrect device type for running on iOS devices.\");\n    IDevice::ConstPtr dev = ProjectExplorer::DeviceKitInformation::device(target()->kit());\n    QString validDevName;\n    bool hasConncetedDev = false;\n    if (devType == Constants::IOS_DEVICE_TYPE) {\n        DeviceManager *dm = DeviceManager::instance();\n        for (int idev = 0; idev < dm->deviceCount(); ++idev) {\n            IDevice::ConstPtr availDev = dm->deviceAt(idev);\n            if (!availDev.isNull() && availDev->type() == Constants::IOS_DEVICE_TYPE) {\n                if (availDev->deviceState() == IDevice::DeviceReadyToUse) {\n                    validDevName += QLatin1String(\" \");\n                    validDevName += availDev->displayName();\n                } else if (availDev->deviceState() == IDevice::DeviceConnected) {\n                    hasConncetedDev = true;\n                }\n            }\n        }\n    }\n\n    if (dev.isNull()) {\n        if (!validDevName.isEmpty())\n            return tr(\"No device chosen. Select %1.\").arg(validDevName); \/\/ should not happen\n        else if (hasConncetedDev)\n            return tr(\"No device chosen. Enable developer mode on a device.\"); \/\/ should not happen\n        else\n            return tr(\"No device available.\");\n    } else {\n        switch (dev->deviceState()) {\n        case IDevice::DeviceReadyToUse:\n            break;\n        case IDevice::DeviceConnected:\n            return tr(\"To use this device you need to enable developer mode on it.\");\n        case IDevice::DeviceDisconnected:\n        case IDevice::DeviceStateUnknown:\n            if (!validDevName.isEmpty())\n                return tr(\"%1 is not connected. Select %2?\")\n                        .arg(dev->displayName(), validDevName);\n            else if (hasConncetedDev)\n                return tr(\"%1 is not connected. Enable developer mode on a device?\")\n                        .arg(dev->displayName());\n            else\n                return tr(\"%1 is not connected.\").arg(dev->displayName());\n        }\n    }\n    return RunConfiguration::disabledReason();\n}\n\nIosRunConfigurationWidget::IosRunConfigurationWidget(IosRunConfiguration *runConfiguration) :\n    m_ui(new Ui::IosRunConfiguration), m_runConfiguration(runConfiguration)\n{\n    m_ui->setupUi(this);\n\n    updateValues();\n    connect(m_ui->argumentsLineEdit, SIGNAL(editingFinished()),\n            SLOT(argumentsLineEditTextEdited()));\n    connect(runConfiguration->target(), SIGNAL(buildDirectoryChanged()),\n            SLOT(updateValues()));\n}\n\nIosRunConfigurationWidget::~IosRunConfigurationWidget()\n{\n    delete m_ui;\n}\n\nQString IosRunConfigurationWidget::argListToString(const QStringList &args) const\n{\n    return Utils::QtcProcess::joinArgs(args);\n}\n\nQStringList IosRunConfigurationWidget::stringToArgList(const QString &args) const\n{\n    QtcProcess::SplitError err;\n    QStringList res = QtcProcess::splitArgs(args, OsTypeMac, false, &err);\n    switch (err) {\n    case QtcProcess::SplitOk:\n        break;\n    case QtcProcess::BadQuoting:\n        if (args.at(args.size()-1) == QLatin1Char('\\\\')) {\n            res = QtcProcess::splitArgs(args + QLatin1Char('\\\\'), OsTypeMac, false, &err);\n            if (err != QtcProcess::SplitOk)\n                res = QtcProcess::splitArgs(args + QLatin1Char('\\\\') + QLatin1Char('\\''),\n                                            OsTypeMac, false, &err);\n            if (err != QtcProcess::SplitOk)\n                res = QtcProcess::splitArgs(args + QLatin1Char('\\\\') + QLatin1Char('\\\"'),\n                                            OsTypeMac, false, &err);\n        }\n        if (err != QtcProcess::SplitOk)\n            res = QtcProcess::splitArgs(args + QLatin1Char('\\''), OsTypeMac, false, &err);\n        if (err != QtcProcess::SplitOk)\n            res = QtcProcess::splitArgs(args + QLatin1Char('\\\"'), OsTypeMac, false, &err);\n        break;\n    case QtcProcess::FoundMeta:\n        qDebug() << \"IosRunConfigurationWidget FoundMeta (should not happen)\";\n        break;\n    }\n    return res;\n}\n\nQString IosRunConfigurationWidget::displayName() const\n{\n    return tr(\"iOS run settings\");\n}\n\nvoid IosRunConfigurationWidget::argumentsLineEditTextEdited()\n{\n    QString argsString = m_ui->argumentsLineEdit->text();\n    QStringList args = stringToArgList(argsString);\n    m_runConfiguration->m_arguments = args;\n    m_ui->argumentsLineEdit->setText(argListToString(args));\n}\n\nvoid IosRunConfigurationWidget::updateValues()\n{\n    QStringList args = m_runConfiguration->m_arguments;\n    QString argsString = argListToString(args);\n    m_ui->argumentsLineEdit->setText(argsString);\n    m_ui->executableLineEdit->setText(m_runConfiguration->exePath().toUserOutput());\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace Ios\n\n#include \"iosrunconfiguration.moc\"\n<|endoftext|>"}
{"text":"<commit_before>#include \"tabwidget.h\"\n\n#include <QApplication>\n#include <QPainter>\n#include <QPaintEvent>\n\nnamespace OpenCOR {\nnamespace Core {\n\nTabWidget::TabWidget(const QString &pLogoFileName, QWidget *pParent) :\n    QTabWidget(pParent),\n    CommonWidget(pParent)\n{\n    \/\/ Set some properties\n    \/\/ Note: we give a strong focus policy to the tab widget so that it can also\n    \/\/       get focus by being clicked on\n\n    setMovable(true);\n    setTabsClosable(true);\n    setFocusPolicy(Qt::StrongFocus);\n\n    \/\/ Logo settings\n\n    mLogoRenderer.load(pLogoFileName);\n\n    mLogoWidth  = mLogoRenderer.defaultSize().width();\n    mLogoHeight = mLogoRenderer.defaultSize().height();\n\n    mLogoOneOverWidth  = 1.0\/mLogoWidth;\n    mLogoOneOverHeight = 1.0\/mLogoHeight;\n\n    mLogoWidthOverHeight = (double) mLogoWidth\/mLogoHeight;\n    mLogoHeightOverWidth = (double) mLogoHeight\/mLogoWidth;\n\n    \/\/ A connection to handle the change of tab\n\n    connect(this, SIGNAL(currentChanged(int)),\n            this, SLOT(tabChanged(const int &)));\n    connect(qApp, SIGNAL(focusChanged(QWidget *, QWidget *)),\n            this, SLOT(getFocus(QWidget *, QWidget *)));\n}\n\nvoid TabWidget::paintEvent(QPaintEvent *pEvent)\n{\n    \/\/ Display the CellML logo in place of the tab widget itself, in case the\n    \/\/ tab widget doesn't have any tab associated with it\n\n    if (!count()) {\n        \/\/ There are no tabs, so display our logo\n\n        QPainter painter(this);\n\n        \/\/ Paint the widget's background\n\n        int widgetWidth  = width();\n        int widgetHeight = height();\n\n        painter.fillRect(QRect(0, 0, widgetWidth, widgetHeight),\n                         palette().color(QPalette::Base));\n\n        \/\/ Determine what the dimensions of the logo should be, based on the\n        \/\/ widget's current dimensions\n\n        const int padding = 30;\n\n        int logoWidth  = mLogoWidth;\n        int logoHeight = mLogoHeight;\n\n        bool needResizeWidth  = false;\n        bool needResizeHeight = false;\n\n        if (widgetWidth < mLogoWidth+padding) {\n            if (widgetHeight < mLogoHeight+padding)\n                needResizeWidth =   widgetWidth*mLogoOneOverWidth\n                                  < widgetHeight*mLogoOneOverHeight;\n            else\n                needResizeWidth = true;\n\n            needResizeHeight = !needResizeWidth;\n        } else {\n            needResizeHeight = widgetHeight < mLogoHeight+padding;\n        }\n\n        if (needResizeWidth) {\n            logoWidth  = widgetWidth-padding;\n            logoHeight = logoWidth*mLogoHeightOverWidth;\n        } else if (needResizeHeight) {\n            logoHeight = widgetHeight-padding;\n            logoWidth  = logoHeight*mLogoWidthOverHeight;\n        }\n\n        \/\/ Render the logo itself\n\n        mLogoRenderer.render(&painter,\n                             QRect(0.5*(widgetWidth-logoWidth),\n                                   0.5*(widgetHeight-logoHeight),\n                                   logoWidth, logoHeight));\n\n        \/\/ Accept the event\n\n        pEvent->accept();\n    } else {\n        \/\/ There are tabs, so revert to the default paint handler\n\n        QTabWidget::paintEvent(pEvent);\n    }\n}\n\nvoid TabWidget::tabChanged(const int &pIndex) const\n{\n    \/\/ A new tab has been selected, so give the focus to its widget\n\n    QWidget *crtWidget = widget(pIndex);\n\n    if (crtWidget)\n        crtWidget->setFocus();\n}\n\nvoid TabWidget::getFocus(QWidget *, QWidget *pNew) const\n{\n    \/\/ The tab widget (or a part of it) has just received the focus and, here,\n    \/\/ we want to take advantage of this to give the focus to the widget of the\n    \/\/ active tab as a result of the user clicking on the active tab (since this\n    \/\/ won't emit the currentChanged signal). In our case, this means we are\n    \/\/ after pNew being of QTabBar type and that, more importantly, its parent\n    \/\/ is this tab widget\n\n    if (pNew && (pNew->parentWidget() == this))\n        \/\/ The tab widget didn't have the focus, but the user has just clicked\n        \/\/ on the tab widget's active tab, thus giving the focus to the tab\n        \/\/ widget, so now we need to give the focus to the active tab's widget\n\n        tabChanged(currentIndex());\n}\n\n} }\n<commit_msg>Make sure that the logo in the tab view never ends up with dimensions of (0, 0) which would be equivalent to using all of the viewport to render the logo (which is clearly not what we want!).<commit_after>#include \"tabwidget.h\"\n\n#include <QApplication>\n#include <QPainter>\n#include <QPaintEvent>\n\nnamespace OpenCOR {\nnamespace Core {\n\nTabWidget::TabWidget(const QString &pLogoFileName, QWidget *pParent) :\n    QTabWidget(pParent),\n    CommonWidget(pParent)\n{\n    \/\/ Set some properties\n    \/\/ Note: we give a strong focus policy to the tab widget so that it can also\n    \/\/       get focus by being clicked on\n\n    setMovable(true);\n    setTabsClosable(true);\n    setFocusPolicy(Qt::StrongFocus);\n\n    \/\/ Logo settings\n\n    mLogoRenderer.load(pLogoFileName);\n\n    mLogoWidth  = mLogoRenderer.defaultSize().width();\n    mLogoHeight = mLogoRenderer.defaultSize().height();\n\n    mLogoOneOverWidth  = 1.0\/mLogoWidth;\n    mLogoOneOverHeight = 1.0\/mLogoHeight;\n\n    mLogoWidthOverHeight = (double) mLogoWidth\/mLogoHeight;\n    mLogoHeightOverWidth = (double) mLogoHeight\/mLogoWidth;\n\n    \/\/ A connection to handle the change of tab\n\n    connect(this, SIGNAL(currentChanged(int)),\n            this, SLOT(tabChanged(const int &)));\n    connect(qApp, SIGNAL(focusChanged(QWidget *, QWidget *)),\n            this, SLOT(getFocus(QWidget *, QWidget *)));\n}\n\nvoid TabWidget::paintEvent(QPaintEvent *pEvent)\n{\n    \/\/ Display the CellML logo in place of the tab widget itself, in case the\n    \/\/ tab widget doesn't have any tab associated with it\n\n    if (!count()) {\n        \/\/ There are no tabs, so display our logo\n\n        QPainter painter(this);\n\n        \/\/ Paint the widget's background\n\n        int widgetWidth  = width();\n        int widgetHeight = height();\n\n        painter.fillRect(QRect(0, 0, widgetWidth, widgetHeight),\n                         palette().color(QPalette::Base));\n\n        \/\/ Determine what the dimensions of the logo should be, based on the\n        \/\/ widget's current dimensions\n\n        const int padding = 30;\n\n        int logoWidth  = mLogoWidth;\n        int logoHeight = mLogoHeight;\n\n        bool needResizeWidth  = false;\n        bool needResizeHeight = false;\n\n        if (widgetWidth < mLogoWidth+padding) {\n            if (widgetHeight < mLogoHeight+padding)\n                needResizeWidth =   widgetWidth*mLogoOneOverWidth\n                                  < widgetHeight*mLogoOneOverHeight;\n            else\n                needResizeWidth = true;\n\n            needResizeHeight = !needResizeWidth;\n        } else {\n            needResizeHeight = widgetHeight < mLogoHeight+padding;\n        }\n\n        if (needResizeWidth) {\n            logoWidth  = qMax(1, widgetWidth-padding);\n            logoHeight = logoWidth*mLogoHeightOverWidth;\n        } else if (needResizeHeight) {\n            logoHeight = qMax(1, widgetHeight-padding);\n            logoWidth  = logoHeight*mLogoWidthOverHeight;\n        }\n\n        \/\/ Render the logo itself\n\n        mLogoRenderer.render(&painter,\n                             QRect(0.5*(widgetWidth-logoWidth),\n                                   0.5*(widgetHeight-logoHeight),\n                                   logoWidth, logoHeight));\n\n        \/\/ Accept the event\n\n        pEvent->accept();\n    } else {\n        \/\/ There are tabs, so revert to the default paint handler\n\n        QTabWidget::paintEvent(pEvent);\n    }\n}\n\nvoid TabWidget::tabChanged(const int &pIndex) const\n{\n    \/\/ A new tab has been selected, so give the focus to its widget\n\n    QWidget *crtWidget = widget(pIndex);\n\n    if (crtWidget)\n        crtWidget->setFocus();\n}\n\nvoid TabWidget::getFocus(QWidget *, QWidget *pNew) const\n{\n    \/\/ The tab widget (or a part of it) has just received the focus and, here,\n    \/\/ we want to take advantage of this to give the focus to the widget of the\n    \/\/ active tab as a result of the user clicking on the active tab (since this\n    \/\/ won't emit the currentChanged signal). In our case, this means we are\n    \/\/ after pNew being of QTabBar type and that, more importantly, its parent\n    \/\/ is this tab widget\n\n    if (pNew && (pNew->parentWidget() == this))\n        \/\/ The tab widget didn't have the focus, but the user has just clicked\n        \/\/ on the tab widget's active tab, thus giving the focus to the tab\n        \/\/ widget, so now we need to give the focus to the active tab's widget\n\n        tabChanged(currentIndex());\n}\n\n} }\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2010-2012 ARM Limited\n * Copyright (c) 2013 Advanced Micro Devices, Inc.\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) 2004-2006 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: Kevin Lim\n *          Korey Sewell\n *\/\n\n#ifndef __CPU_O3_THREAD_CONTEXT_IMPL_HH__\n#define __CPU_O3_THREAD_CONTEXT_IMPL_HH__\n\n#include \"arch\/kernel_stats.hh\"\n#include \"arch\/registers.hh\"\n#include \"config\/the_isa.hh\"\n#include \"cpu\/o3\/thread_context.hh\"\n#include \"cpu\/quiesce_event.hh\"\n#include \"debug\/O3CPU.hh\"\n#include \"debug\/DtuPower.hh\"\n\ntemplate <class Impl>\nFSTranslatingPortProxy&\nO3ThreadContext<Impl>::getVirtProxy()\n{\n    return thread->getVirtProxy();\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::dumpFuncProfile()\n{\n    thread->dumpFuncProfile();\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::takeOverFrom(ThreadContext *old_context)\n{\n    ::takeOverFrom(*this, *old_context);\n    TheISA::Decoder *newDecoder = getDecoderPtr();\n    TheISA::Decoder *oldDecoder = old_context->getDecoderPtr();\n    newDecoder->takeOverFrom(oldDecoder);\n\n    thread->kernelStats = old_context->getKernelStats();\n    thread->funcExeInst = old_context->readFuncExeInst();\n\n    thread->noSquashFromTC = false;\n    thread->trapPending = false;\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::activate()\n{\n    DPRINTF(O3CPU, \"Calling activate on Thread Context %d\\n\",\n            threadId());\n\n    if (thread->status() == ThreadContext::Active)\n        return;\n\n    thread->lastActivate = curTick();\n    thread->setStatus(ThreadContext::Active);\n\n    \/\/ status() == Suspended\n    cpu->activateContext(thread->threadId());\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::suspend()\n{\n    DPRINTF(O3CPU, \"Calling suspend on Thread Context %d\\n\",\n            threadId());\n\n    if (thread->status() == ThreadContext::Suspended)\n        return;\n\n    if (cpu->_denySuspend)\n    {\n        DPRINTFS(DtuPower, cpu, \"Ignoring suspend; messages pending\\n\");\n        return;\n    }\n\n    DPRINTFS(DtuPower, cpu, \"Suspending core\\n\");\n\n    thread->lastActivate = curTick();\n    thread->lastSuspend = curTick();\n\n    thread->setStatus(ThreadContext::Suspended);\n    cpu->suspendContext(thread->threadId());\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::halt()\n{\n    DPRINTF(O3CPU, \"Calling halt on Thread Context %d\\n\", threadId());\n\n    if (thread->status() == ThreadContext::Halted)\n        return;\n\n    thread->setStatus(ThreadContext::Halted);\n    cpu->haltContext(thread->threadId());\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::regStats(const std::string &name)\n{\n    if (FullSystem) {\n        thread->kernelStats = new TheISA::Kernel::Statistics(cpu->system);\n        thread->kernelStats->regStats(name + \".kern\");\n    }\n}\n\ntemplate <class Impl>\nTick\nO3ThreadContext<Impl>::readLastActivate()\n{\n    return thread->lastActivate;\n}\n\ntemplate <class Impl>\nTick\nO3ThreadContext<Impl>::readLastSuspend()\n{\n    return thread->lastSuspend;\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::profileClear()\n{\n    thread->profileClear();\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::profileSample()\n{\n    thread->profileSample();\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::copyArchRegs(ThreadContext *tc)\n{\n    \/\/ Prevent squashing\n    thread->noSquashFromTC = true;\n    TheISA::copyRegs(tc, this);\n    thread->noSquashFromTC = false;\n\n    if (!FullSystem)\n        this->thread->funcExeInst = tc->readFuncExeInst();\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::clearArchRegs()\n{\n    cpu->isa[thread->threadId()]->clear();\n}\n\ntemplate <class Impl>\nuint64_t\nO3ThreadContext<Impl>::readIntRegFlat(int reg_idx)\n{\n    return cpu->readArchIntReg(reg_idx, thread->threadId());\n}\n\ntemplate <class Impl>\nTheISA::FloatReg\nO3ThreadContext<Impl>::readFloatRegFlat(int reg_idx)\n{\n    return cpu->readArchFloatReg(reg_idx, thread->threadId());\n}\n\ntemplate <class Impl>\nTheISA::FloatRegBits\nO3ThreadContext<Impl>::readFloatRegBitsFlat(int reg_idx)\n{\n    return cpu->readArchFloatRegInt(reg_idx, thread->threadId());\n}\n\ntemplate <class Impl>\nTheISA::CCReg\nO3ThreadContext<Impl>::readCCRegFlat(int reg_idx)\n{\n    return cpu->readArchCCReg(reg_idx, thread->threadId());\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::setIntRegFlat(int reg_idx, uint64_t val)\n{\n    cpu->setArchIntReg(reg_idx, val, thread->threadId());\n\n    conditionalSquash();\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::setFloatRegFlat(int reg_idx, FloatReg val)\n{\n    cpu->setArchFloatReg(reg_idx, val, thread->threadId());\n\n    conditionalSquash();\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::setFloatRegBitsFlat(int reg_idx, FloatRegBits val)\n{\n    cpu->setArchFloatRegInt(reg_idx, val, thread->threadId());\n\n    conditionalSquash();\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::setCCRegFlat(int reg_idx, TheISA::CCReg val)\n{\n    cpu->setArchCCReg(reg_idx, val, thread->threadId());\n\n    conditionalSquash();\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::pcState(const TheISA::PCState &val)\n{\n    cpu->pcState(val, thread->threadId());\n\n    conditionalSquash();\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::pcStateNoRecord(const TheISA::PCState &val)\n{\n    cpu->pcState(val, thread->threadId());\n\n    conditionalSquash();\n}\n\ntemplate <class Impl>\nint\nO3ThreadContext<Impl>::flattenIntIndex(int reg)\n{\n    return cpu->isa[thread->threadId()]->flattenIntIndex(reg);\n}\n\ntemplate <class Impl>\nint\nO3ThreadContext<Impl>::flattenFloatIndex(int reg)\n{\n    return cpu->isa[thread->threadId()]->flattenFloatIndex(reg);\n}\n\ntemplate <class Impl>\nint\nO3ThreadContext<Impl>::flattenCCIndex(int reg)\n{\n    return cpu->isa[thread->threadId()]->flattenCCIndex(reg);\n}\n\ntemplate <class Impl>\nint\nO3ThreadContext<Impl>::flattenMiscIndex(int reg)\n{\n    return cpu->isa[thread->threadId()]->flattenMiscIndex(reg);\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::setMiscRegNoEffect(int misc_reg, const MiscReg &val)\n{\n    cpu->setMiscRegNoEffect(misc_reg, val, thread->threadId());\n\n    conditionalSquash();\n}\n\n#endif\/\/__CPU_O3_THREAD_CONTEXT_IMPL_HH__\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::setMiscReg(int misc_reg, const MiscReg &val)\n{\n    cpu->setMiscReg(misc_reg, val, thread->threadId());\n\n    conditionalSquash();\n}\n\n<commit_msg>Workaround for suspend with O3 CPU.<commit_after>\/*\n * Copyright (c) 2010-2012 ARM Limited\n * Copyright (c) 2013 Advanced Micro Devices, Inc.\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) 2004-2006 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: Kevin Lim\n *          Korey Sewell\n *\/\n\n#ifndef __CPU_O3_THREAD_CONTEXT_IMPL_HH__\n#define __CPU_O3_THREAD_CONTEXT_IMPL_HH__\n\n#include \"arch\/kernel_stats.hh\"\n#include \"arch\/registers.hh\"\n#include \"config\/the_isa.hh\"\n#include \"cpu\/o3\/thread_context.hh\"\n#include \"cpu\/quiesce_event.hh\"\n#include \"debug\/O3CPU.hh\"\n#include \"debug\/DtuPower.hh\"\n\nclass WakeupEvent : public Event\n{\n  private:\n    BaseCPU *cpu;\n\n  public:\n    WakeupEvent(BaseCPU *_cpu) : Event(), cpu(_cpu) {}\n\n    void process()\n    {\n        cpu->system->threadContexts[0]->activate();\n        setFlags(AutoDelete);\n    }\n};\n\ntemplate <class Impl>\nFSTranslatingPortProxy&\nO3ThreadContext<Impl>::getVirtProxy()\n{\n    return thread->getVirtProxy();\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::dumpFuncProfile()\n{\n    thread->dumpFuncProfile();\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::takeOverFrom(ThreadContext *old_context)\n{\n    ::takeOverFrom(*this, *old_context);\n    TheISA::Decoder *newDecoder = getDecoderPtr();\n    TheISA::Decoder *oldDecoder = old_context->getDecoderPtr();\n    newDecoder->takeOverFrom(oldDecoder);\n\n    thread->kernelStats = old_context->getKernelStats();\n    thread->funcExeInst = old_context->readFuncExeInst();\n\n    thread->noSquashFromTC = false;\n    thread->trapPending = false;\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::activate()\n{\n    DPRINTF(O3CPU, \"Calling activate on Thread Context %d\\n\",\n            threadId());\n\n    if (thread->status() == ThreadContext::Active)\n        return;\n\n    thread->lastActivate = curTick();\n    thread->setStatus(ThreadContext::Active);\n\n    \/\/ status() == Suspended\n    cpu->activateContext(thread->threadId());\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::suspend()\n{\n    DPRINTF(O3CPU, \"Calling suspend on Thread Context %d\\n\",\n            threadId());\n\n    if (thread->status() == ThreadContext::Suspended)\n        return;\n\n    if (cpu->_denySuspend)\n    {\n        DPRINTFS(DtuPower, cpu, \"Ignoring suspend; messages pending\\n\");\n        cpu->schedule(new WakeupEvent(cpu), cpu->clockEdge(Cycles(1)));\n    }\n    else\n    {\n        DPRINTFS(DtuPower, cpu, \"Suspending core\\n\");\n    }\n\n    thread->lastActivate = curTick();\n    thread->lastSuspend = curTick();\n\n    thread->setStatus(ThreadContext::Suspended);\n    cpu->suspendContext(thread->threadId());\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::halt()\n{\n    DPRINTF(O3CPU, \"Calling halt on Thread Context %d\\n\", threadId());\n\n    if (thread->status() == ThreadContext::Halted)\n        return;\n\n    thread->setStatus(ThreadContext::Halted);\n    cpu->haltContext(thread->threadId());\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::regStats(const std::string &name)\n{\n    if (FullSystem) {\n        thread->kernelStats = new TheISA::Kernel::Statistics(cpu->system);\n        thread->kernelStats->regStats(name + \".kern\");\n    }\n}\n\ntemplate <class Impl>\nTick\nO3ThreadContext<Impl>::readLastActivate()\n{\n    return thread->lastActivate;\n}\n\ntemplate <class Impl>\nTick\nO3ThreadContext<Impl>::readLastSuspend()\n{\n    return thread->lastSuspend;\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::profileClear()\n{\n    thread->profileClear();\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::profileSample()\n{\n    thread->profileSample();\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::copyArchRegs(ThreadContext *tc)\n{\n    \/\/ Prevent squashing\n    thread->noSquashFromTC = true;\n    TheISA::copyRegs(tc, this);\n    thread->noSquashFromTC = false;\n\n    if (!FullSystem)\n        this->thread->funcExeInst = tc->readFuncExeInst();\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::clearArchRegs()\n{\n    cpu->isa[thread->threadId()]->clear();\n}\n\ntemplate <class Impl>\nuint64_t\nO3ThreadContext<Impl>::readIntRegFlat(int reg_idx)\n{\n    return cpu->readArchIntReg(reg_idx, thread->threadId());\n}\n\ntemplate <class Impl>\nTheISA::FloatReg\nO3ThreadContext<Impl>::readFloatRegFlat(int reg_idx)\n{\n    return cpu->readArchFloatReg(reg_idx, thread->threadId());\n}\n\ntemplate <class Impl>\nTheISA::FloatRegBits\nO3ThreadContext<Impl>::readFloatRegBitsFlat(int reg_idx)\n{\n    return cpu->readArchFloatRegInt(reg_idx, thread->threadId());\n}\n\ntemplate <class Impl>\nTheISA::CCReg\nO3ThreadContext<Impl>::readCCRegFlat(int reg_idx)\n{\n    return cpu->readArchCCReg(reg_idx, thread->threadId());\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::setIntRegFlat(int reg_idx, uint64_t val)\n{\n    cpu->setArchIntReg(reg_idx, val, thread->threadId());\n\n    conditionalSquash();\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::setFloatRegFlat(int reg_idx, FloatReg val)\n{\n    cpu->setArchFloatReg(reg_idx, val, thread->threadId());\n\n    conditionalSquash();\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::setFloatRegBitsFlat(int reg_idx, FloatRegBits val)\n{\n    cpu->setArchFloatRegInt(reg_idx, val, thread->threadId());\n\n    conditionalSquash();\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::setCCRegFlat(int reg_idx, TheISA::CCReg val)\n{\n    cpu->setArchCCReg(reg_idx, val, thread->threadId());\n\n    conditionalSquash();\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::pcState(const TheISA::PCState &val)\n{\n    cpu->pcState(val, thread->threadId());\n\n    conditionalSquash();\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::pcStateNoRecord(const TheISA::PCState &val)\n{\n    cpu->pcState(val, thread->threadId());\n\n    conditionalSquash();\n}\n\ntemplate <class Impl>\nint\nO3ThreadContext<Impl>::flattenIntIndex(int reg)\n{\n    return cpu->isa[thread->threadId()]->flattenIntIndex(reg);\n}\n\ntemplate <class Impl>\nint\nO3ThreadContext<Impl>::flattenFloatIndex(int reg)\n{\n    return cpu->isa[thread->threadId()]->flattenFloatIndex(reg);\n}\n\ntemplate <class Impl>\nint\nO3ThreadContext<Impl>::flattenCCIndex(int reg)\n{\n    return cpu->isa[thread->threadId()]->flattenCCIndex(reg);\n}\n\ntemplate <class Impl>\nint\nO3ThreadContext<Impl>::flattenMiscIndex(int reg)\n{\n    return cpu->isa[thread->threadId()]->flattenMiscIndex(reg);\n}\n\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::setMiscRegNoEffect(int misc_reg, const MiscReg &val)\n{\n    cpu->setMiscRegNoEffect(misc_reg, val, thread->threadId());\n\n    conditionalSquash();\n}\n\n#endif\/\/__CPU_O3_THREAD_CONTEXT_IMPL_HH__\ntemplate <class Impl>\nvoid\nO3ThreadContext<Impl>::setMiscReg(int misc_reg, const MiscReg &val)\n{\n    cpu->setMiscReg(misc_reg, val, thread->threadId());\n\n    conditionalSquash();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"RRCameraQueue.hpp\"\n\nRRCameraQueue::RRCameraQueue()\n{\n\trrIndex = 0;\n\tsize = 0;\n}\n\nvoid RRCameraQueue::enqueueInternal(CameraData data)\n{\n\tif (queues.count(data.camNo) == 0) {\n\t\tcamNos.push_back(data.camNo);\n\t\tqueues[data.camNo] = std::queue<CameraData>();\n\t}\n\t\n\tqueues[data.camNo].push(data);\n\tsize++;\n}\n\nstd::vector<CameraData> RRCameraQueue::dequeue()\n{\n\tif (size == 0) {\n\t\treturn getInvalidCameraDataVector();\n\t}\n\t\n\tint index = rrIndex;\n\t\n\tdo {\n\t\tif (queues[camNos[index]].size() > 0) {\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tindex++;\n\t} while (index != rrIndex);\n\t\n\tif (index == rrIndex) {\n\t\treturn getInvalidCameraDataVector();\n\t} else {\n\t\trrIndex = (index + 1) % camNos.size();\n\t\tCameraData result = queues[camNos[index]].front();\n\t\tqueues[camNos[index]].pop();\n\t\tsize--;\n\t\t\n\t\treturn toVector(result);\n\t}\n}\n\nbool RRCameraQueue::dataAvailable()\n{\n\treturn size > 0;\n}\n\nsize_t RRCameraQueue::getSize()\n{\n\treturn size;\n}<commit_msg>More debug output<commit_after>#include \"RRCameraQueue.hpp\"\n\nRRCameraQueue::RRCameraQueue()\n{\n\trrIndex = 0;\n\tsize = 0;\n}\n\nvoid RRCameraQueue::enqueueInternal(CameraData data)\n{\n\tif (queues.count(data.camNo) == 0) {\n\t\tcamNos.push_back(data.camNo);\n\t\tqueues[data.camNo] = std::queue<CameraData>();\n\t}\n\t\n\tqueues[data.camNo].push(data);\n\tsize++;\n}\n\nstd::vector<CameraData> RRCameraQueue::dequeue()\n{\n\tif (size == 0) {\n\t\tROS_DEBUG(\"Size is 0\");\n\t\treturn getInvalidCameraDataVector();\n\t}\n\t\n\tint index = rrIndex;\n\t\n\tdo {\n\t\tif (queues[camNos[index]].size() > 0) {\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tindex = (index + 1) % camNos.size();\n\t} while (index != rrIndex);\n\t\n\tif (index == rrIndex) {\n\t\tROS_DEBUG(\"Didn't find CameraData\");\n\t\treturn getInvalidCameraDataVector();\n\t} else {\n\t\tROS_DEBUG(\"Found CameraData\");\n\t\trrIndex = (index + 1) % camNos.size();\n\t\tCameraData result = queues[camNos[index]].front();\n\t\tqueues[camNos[index]].pop();\n\t\tsize--;\n\t\t\n\t\treturn toVector(result);\n\t}\n}\n\nbool RRCameraQueue::dataAvailable()\n{\n\treturn size > 0;\n}\n\nsize_t RRCameraQueue::getSize()\n{\n\treturn size;\n}<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2012 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\/\/ Implementation of StackFrameSymbolizer, which encapsulates the logic of how\n\/\/ SourceLineResolverInterface interacts with SymbolSupplier to fill source\n\/\/ line information in a stack frame, and also looks up WindowsFrameInfo or\n\/\/ CFIFrameInfo for a stack frame.\n\n#include \"google_breakpad\/processor\/stack_frame_symbolizer.h\"\n\n#include <assert.h>\n\n#include \"google_breakpad\/processor\/code_module.h\"\n#include \"google_breakpad\/processor\/code_modules.h\"\n#include \"google_breakpad\/processor\/source_line_resolver_interface.h\"\n#include \"google_breakpad\/processor\/stack_frame.h\"\n#include \"google_breakpad\/processor\/symbol_supplier.h\"\n#include \"google_breakpad\/processor\/system_info.h\"\n#include \"processor\/linked_ptr.h\"\n#include \"processor\/logging.h\"\n#include \"processor\/scoped_ptr.h\"\n\nnamespace google_breakpad {\n\nStackFrameSymbolizer::StackFrameSymbolizer(\n    SymbolSupplier* supplier,\n    SourceLineResolverInterface* resolver) : supplier_(supplier),\n                                             resolver_(resolver) { }\n\nStackFrameSymbolizer::SymbolizerResult StackFrameSymbolizer::FillSourceLineInfo(\n    const CodeModules* modules,\n    const SystemInfo* system_info,\n    StackFrame* frame) {\n  assert(frame);\n\n  if (!modules) return ERROR;\n  const CodeModule* module = modules->GetModuleForAddress(frame->instruction);\n  if (!module) return ERROR;\n  frame->module = module;\n\n  if (!resolver_) return ERROR;  \/\/ no resolver.\n  \/\/ If module is known to have missing symbol file, return.\n  if (no_symbol_modules_.find(module->code_file()) !=\n      no_symbol_modules_.end()) {\n    return ERROR;\n  }\n\n  \/\/ If module is already loaded, go ahead to fill source line info and return.\n  if (resolver_->HasModule(frame->module)) {\n    resolver_->FillSourceLineInfo(frame);\n    return NO_ERROR;\n  }\n\n  \/\/ Module needs to fetch symbol file. First check to see if supplier exists.\n  if (!supplier_) {\n    return ERROR;\n  }\n\n  \/\/ Start fetching symbol from supplier.\n  string symbol_file;\n  char* symbol_data = NULL;\n  SymbolSupplier::SymbolResult symbol_result = supplier_->GetCStringSymbolData(\n      module, system_info, &symbol_file, &symbol_data);\n\n  switch (symbol_result) {\n    case SymbolSupplier::FOUND: {\n      bool load_success = resolver_->LoadModuleUsingMemoryBuffer(frame->module,\n                                                                 symbol_data);\n      if (resolver_->ShouldDeleteMemoryBufferAfterLoadModule()) {\n        supplier_->FreeSymbolData(module);\n      }\n\n      if (load_success) {\n        resolver_->FillSourceLineInfo(frame);\n        return NO_ERROR;\n      } else {\n        BPLOG(ERROR) << \"Failed to load symbol file in resolver.\";\n        no_symbol_modules_.insert(module->code_file());\n        return ERROR;\n      }\n    }\n\n    case SymbolSupplier::NOT_FOUND:\n      no_symbol_modules_.insert(module->code_file());\n      return ERROR;\n\n    case SymbolSupplier::INTERRUPT:\n      return INTERRUPT;\n  }\n}\n\nWindowsFrameInfo* StackFrameSymbolizer::FindWindowsFrameInfo(\n    const StackFrame* frame) {\n  return resolver_ ? resolver_->FindWindowsFrameInfo(frame) : NULL;\n}\n\nCFIFrameInfo* StackFrameSymbolizer::FindCFIFrameInfo(\n    const StackFrame* frame) {\n  return resolver_ ? resolver_->FindCFIFrameInfo(frame) : NULL;\n}\n\n}  \/\/ namespace google_breakpad\n<commit_msg>Fix a compile warning in stack_frame_symbolizer.cc<commit_after>\/\/ Copyright (c) 2012 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\/\/ Implementation of StackFrameSymbolizer, which encapsulates the logic of how\n\/\/ SourceLineResolverInterface interacts with SymbolSupplier to fill source\n\/\/ line information in a stack frame, and also looks up WindowsFrameInfo or\n\/\/ CFIFrameInfo for a stack frame.\n\n#include \"google_breakpad\/processor\/stack_frame_symbolizer.h\"\n\n#include <assert.h>\n\n#include \"google_breakpad\/processor\/code_module.h\"\n#include \"google_breakpad\/processor\/code_modules.h\"\n#include \"google_breakpad\/processor\/source_line_resolver_interface.h\"\n#include \"google_breakpad\/processor\/stack_frame.h\"\n#include \"google_breakpad\/processor\/symbol_supplier.h\"\n#include \"google_breakpad\/processor\/system_info.h\"\n#include \"processor\/linked_ptr.h\"\n#include \"processor\/logging.h\"\n#include \"processor\/scoped_ptr.h\"\n\nnamespace google_breakpad {\n\nStackFrameSymbolizer::StackFrameSymbolizer(\n    SymbolSupplier* supplier,\n    SourceLineResolverInterface* resolver) : supplier_(supplier),\n                                             resolver_(resolver) { }\n\nStackFrameSymbolizer::SymbolizerResult StackFrameSymbolizer::FillSourceLineInfo(\n    const CodeModules* modules,\n    const SystemInfo* system_info,\n    StackFrame* frame) {\n  assert(frame);\n\n  if (!modules) return ERROR;\n  const CodeModule* module = modules->GetModuleForAddress(frame->instruction);\n  if (!module) return ERROR;\n  frame->module = module;\n\n  if (!resolver_) return ERROR;  \/\/ no resolver.\n  \/\/ If module is known to have missing symbol file, return.\n  if (no_symbol_modules_.find(module->code_file()) !=\n      no_symbol_modules_.end()) {\n    return ERROR;\n  }\n\n  \/\/ If module is already loaded, go ahead to fill source line info and return.\n  if (resolver_->HasModule(frame->module)) {\n    resolver_->FillSourceLineInfo(frame);\n    return NO_ERROR;\n  }\n\n  \/\/ Module needs to fetch symbol file. First check to see if supplier exists.\n  if (!supplier_) {\n    return ERROR;\n  }\n\n  \/\/ Start fetching symbol from supplier.\n  string symbol_file;\n  char* symbol_data = NULL;\n  SymbolSupplier::SymbolResult symbol_result = supplier_->GetCStringSymbolData(\n      module, system_info, &symbol_file, &symbol_data);\n\n  switch (symbol_result) {\n    case SymbolSupplier::FOUND: {\n      bool load_success = resolver_->LoadModuleUsingMemoryBuffer(frame->module,\n                                                                 symbol_data);\n      if (resolver_->ShouldDeleteMemoryBufferAfterLoadModule()) {\n        supplier_->FreeSymbolData(module);\n      }\n\n      if (load_success) {\n        resolver_->FillSourceLineInfo(frame);\n        return NO_ERROR;\n      } else {\n        BPLOG(ERROR) << \"Failed to load symbol file in resolver.\";\n        no_symbol_modules_.insert(module->code_file());\n        return ERROR;\n      }\n    }\n\n    case SymbolSupplier::NOT_FOUND:\n      no_symbol_modules_.insert(module->code_file());\n      return ERROR;\n\n    case SymbolSupplier::INTERRUPT:\n      return INTERRUPT;\n\n    default:\n      BPLOG(ERROR) << \"Unknown SymbolResult enum: \" << symbol_result;\n      return ERROR;\n  }\n}\n\nWindowsFrameInfo* StackFrameSymbolizer::FindWindowsFrameInfo(\n    const StackFrame* frame) {\n  return resolver_ ? resolver_->FindWindowsFrameInfo(frame) : NULL;\n}\n\nCFIFrameInfo* StackFrameSymbolizer::FindCFIFrameInfo(\n    const StackFrame* frame) {\n  return resolver_ ? resolver_->FindCFIFrameInfo(frame) : NULL;\n}\n\n}  \/\/ namespace google_breakpad\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/ui\/gtk\/accelerators_gtk.h\"\n\n#include <gdk\/gdk.h>\n#include <gdk\/gdkkeysyms.h>\n#include <X11\/XF86keysym.h>\n\n#include \"base\/memory\/singleton.h\"\n#include \"chrome\/app\/chrome_command_ids.h\"\n\nnamespace {\n\n\/\/ A mostly complete list of chrome's accelerators. When one command has\n\/\/ multiple shortcuts, the first one in this list is considered \"primary\",\n\/\/ meaning that it will be displayed in context menus.\nconst struct AcceleratorMapping {\n  guint keyval;\n  int command_id;\n  GdkModifierType modifier_type;\n} kAcceleratorMap[] = {\n  \/\/ Focus.\n  { GDK_k, IDC_FOCUS_SEARCH, GDK_CONTROL_MASK },\n  { GDK_e, IDC_FOCUS_SEARCH, GDK_CONTROL_MASK },\n  { XF86XK_Search, IDC_FOCUS_SEARCH, GdkModifierType(0) },\n  { GDK_l, IDC_FOCUS_LOCATION, GDK_CONTROL_MASK },\n  { GDK_d, IDC_FOCUS_LOCATION, GDK_MOD1_MASK },\n  { GDK_F6, IDC_FOCUS_LOCATION, GdkModifierType(0) },\n  { XF86XK_OpenURL, IDC_FOCUS_LOCATION, GdkModifierType(0) },\n  { XF86XK_Go, IDC_FOCUS_LOCATION, GdkModifierType(0) },\n\n  \/\/ Tab\/window controls.\n  { GDK_Page_Down, IDC_SELECT_NEXT_TAB, GDK_CONTROL_MASK },\n  { GDK_Page_Up, IDC_SELECT_PREVIOUS_TAB, GDK_CONTROL_MASK },\n  { GDK_Page_Down, IDC_MOVE_TAB_NEXT,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n  { GDK_Page_Up, IDC_MOVE_TAB_PREVIOUS,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n  { GDK_Page_Up, IDC_SELECT_PREVIOUS_TAB, GDK_CONTROL_MASK },\n  { GDK_w, IDC_CLOSE_TAB, GDK_CONTROL_MASK },\n  { GDK_t, IDC_RESTORE_TAB,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n  { GDK_t, IDC_NEW_TAB, GDK_CONTROL_MASK },\n  { GDK_n, IDC_NEW_WINDOW, GDK_CONTROL_MASK },\n  { GDK_n, IDC_NEW_INCOGNITO_WINDOW,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n\n  { GDK_1, IDC_SELECT_TAB_0, GDK_CONTROL_MASK },\n  { GDK_2, IDC_SELECT_TAB_1, GDK_CONTROL_MASK },\n  { GDK_3, IDC_SELECT_TAB_2, GDK_CONTROL_MASK },\n  { GDK_4, IDC_SELECT_TAB_3, GDK_CONTROL_MASK },\n  { GDK_5, IDC_SELECT_TAB_4, GDK_CONTROL_MASK },\n  { GDK_6, IDC_SELECT_TAB_5, GDK_CONTROL_MASK },\n  { GDK_7, IDC_SELECT_TAB_6, GDK_CONTROL_MASK },\n  { GDK_8, IDC_SELECT_TAB_7, GDK_CONTROL_MASK },\n  { GDK_9, IDC_SELECT_LAST_TAB, GDK_CONTROL_MASK },\n\n  { GDK_1, IDC_SELECT_TAB_0, GDK_MOD1_MASK },\n  { GDK_2, IDC_SELECT_TAB_1, GDK_MOD1_MASK },\n  { GDK_3, IDC_SELECT_TAB_2, GDK_MOD1_MASK },\n  { GDK_4, IDC_SELECT_TAB_3, GDK_MOD1_MASK },\n  { GDK_5, IDC_SELECT_TAB_4, GDK_MOD1_MASK },\n  { GDK_6, IDC_SELECT_TAB_5, GDK_MOD1_MASK },\n  { GDK_7, IDC_SELECT_TAB_6, GDK_MOD1_MASK },\n  { GDK_8, IDC_SELECT_TAB_7, GDK_MOD1_MASK },\n  { GDK_9, IDC_SELECT_LAST_TAB, GDK_MOD1_MASK },\n\n  { GDK_KP_1, IDC_SELECT_TAB_0, GDK_CONTROL_MASK },\n  { GDK_KP_2, IDC_SELECT_TAB_1, GDK_CONTROL_MASK },\n  { GDK_KP_3, IDC_SELECT_TAB_2, GDK_CONTROL_MASK },\n  { GDK_KP_4, IDC_SELECT_TAB_3, GDK_CONTROL_MASK },\n  { GDK_KP_5, IDC_SELECT_TAB_4, GDK_CONTROL_MASK },\n  { GDK_KP_6, IDC_SELECT_TAB_5, GDK_CONTROL_MASK },\n  { GDK_KP_7, IDC_SELECT_TAB_6, GDK_CONTROL_MASK },\n  { GDK_KP_8, IDC_SELECT_TAB_7, GDK_CONTROL_MASK },\n  { GDK_KP_9, IDC_SELECT_LAST_TAB, GDK_CONTROL_MASK },\n\n  { GDK_KP_1, IDC_SELECT_TAB_0, GDK_MOD1_MASK },\n  { GDK_KP_2, IDC_SELECT_TAB_1, GDK_MOD1_MASK },\n  { GDK_KP_3, IDC_SELECT_TAB_2, GDK_MOD1_MASK },\n  { GDK_KP_4, IDC_SELECT_TAB_3, GDK_MOD1_MASK },\n  { GDK_KP_5, IDC_SELECT_TAB_4, GDK_MOD1_MASK },\n  { GDK_KP_6, IDC_SELECT_TAB_5, GDK_MOD1_MASK },\n  { GDK_KP_7, IDC_SELECT_TAB_6, GDK_MOD1_MASK },\n  { GDK_KP_8, IDC_SELECT_TAB_7, GDK_MOD1_MASK },\n  { GDK_KP_9, IDC_SELECT_LAST_TAB, GDK_MOD1_MASK },\n\n  { GDK_F4, IDC_CLOSE_TAB, GDK_CONTROL_MASK },\n  { GDK_F4, IDC_CLOSE_WINDOW, GDK_MOD1_MASK },\n\n  \/\/ Zoom level.\n  { GDK_KP_Add, IDC_ZOOM_PLUS, GDK_CONTROL_MASK },\n  { GDK_plus, IDC_ZOOM_PLUS,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n  { GDK_equal, IDC_ZOOM_PLUS, GDK_CONTROL_MASK },\n  { XF86XK_ZoomIn, IDC_ZOOM_PLUS, GdkModifierType(0) },\n  { GDK_KP_0, IDC_ZOOM_NORMAL, GDK_CONTROL_MASK },\n  { GDK_0, IDC_ZOOM_NORMAL, GDK_CONTROL_MASK },\n  { GDK_KP_Subtract, IDC_ZOOM_MINUS, GDK_CONTROL_MASK },\n  { GDK_minus, IDC_ZOOM_MINUS, GDK_CONTROL_MASK },\n  { GDK_underscore, IDC_ZOOM_MINUS,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n  { XF86XK_ZoomOut, IDC_ZOOM_MINUS, GdkModifierType(0) },\n\n  \/\/ Find in page.\n  { GDK_g, IDC_FIND_NEXT, GDK_CONTROL_MASK },\n  { GDK_F3, IDC_FIND_NEXT, GdkModifierType(0) },\n  { GDK_g, IDC_FIND_PREVIOUS,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n  { GDK_F3, IDC_FIND_PREVIOUS, GDK_SHIFT_MASK },\n\n  \/\/ Navigation \/ toolbar buttons.\n  { GDK_Home, IDC_HOME, GDK_MOD1_MASK },\n  { XF86XK_HomePage, IDC_HOME, GdkModifierType(0) },\n  { GDK_Escape, IDC_STOP, GdkModifierType(0) },\n  { XF86XK_Stop, IDC_STOP, GdkModifierType(0) },\n  { GDK_Left, IDC_BACK, GDK_MOD1_MASK },\n  { XF86XK_Back, IDC_BACK, GdkModifierType(0) },\n  { GDK_Right, IDC_FORWARD, GDK_MOD1_MASK },\n  { XF86XK_Forward, IDC_FORWARD, GdkModifierType(0) },\n  { GDK_r, IDC_RELOAD, GDK_CONTROL_MASK },\n  { GDK_r, IDC_RELOAD_IGNORING_CACHE,\n    GdkModifierType(GDK_CONTROL_MASK|GDK_SHIFT_MASK) },\n  { GDK_F5, IDC_RELOAD, GdkModifierType(0) },\n  { GDK_F5, IDC_RELOAD_IGNORING_CACHE, GDK_CONTROL_MASK },\n  { GDK_F5, IDC_RELOAD_IGNORING_CACHE, GDK_SHIFT_MASK },\n  { XF86XK_Reload, IDC_RELOAD, GdkModifierType(0) },\n  { XF86XK_Refresh, IDC_RELOAD, GdkModifierType(0) },\n\n  \/\/ Dev tools.\n  { GDK_u, IDC_VIEW_SOURCE, GDK_CONTROL_MASK },\n  { GDK_i, IDC_DEV_TOOLS,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n  { GDK_F12, IDC_DEV_TOOLS, GdkModifierType(0) },\n  { GDK_j, IDC_DEV_TOOLS_CONSOLE,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n  { GDK_c, IDC_DEV_TOOLS_INSPECT,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n  { GDK_Escape, IDC_TASK_MANAGER, GDK_SHIFT_MASK },\n\n  \/\/ Editing.\n  { GDK_c, IDC_COPY, GDK_CONTROL_MASK },\n  { GDK_x, IDC_CUT, GDK_CONTROL_MASK },\n  { GDK_v, IDC_PASTE, GDK_CONTROL_MASK },\n\n  \/\/ Autofill.\n  { GDK_a, IDC_AUTOFILL_DEFAULT,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n\n  \/\/ Miscellany.\n  { GDK_d, IDC_BOOKMARK_ALL_TABS,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n  { GDK_d, IDC_BOOKMARK_PAGE, GDK_CONTROL_MASK },\n  { GDK_o, IDC_OPEN_FILE, GDK_CONTROL_MASK },\n  { GDK_f, IDC_FIND, GDK_CONTROL_MASK },\n  { GDK_p, IDC_PRINT, GDK_CONTROL_MASK },\n  { GDK_b, IDC_SHOW_BOOKMARK_BAR,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n  { GDK_F11, IDC_FULLSCREEN, GdkModifierType(0) },\n  { GDK_Delete, IDC_CLEAR_BROWSING_DATA,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n  { GDK_h, IDC_SHOW_HISTORY, GDK_CONTROL_MASK },\n  { GDK_j, IDC_SHOW_DOWNLOADS, GDK_CONTROL_MASK },\n  { GDK_F1, IDC_HELP_PAGE, GdkModifierType(0) },\n  { XF86XK_AddFavorite, IDC_BOOKMARK_PAGE, GdkModifierType(0) },\n  { XF86XK_Favorites, IDC_SHOW_BOOKMARK_BAR, GdkModifierType(0) },\n  { XF86XK_History, IDC_SHOW_HISTORY, GdkModifierType(0) },\n  { GDK_q, IDC_EXIT, GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n  { GDK_s, IDC_SAVE_PAGE, GDK_CONTROL_MASK },\n  { GDK_e, IDC_SHOW_APP_MENU, GDK_MOD1_MASK },\n  { GDK_f, IDC_SHOW_APP_MENU, GDK_MOD1_MASK },\n};\n\n}  \/\/ namespace\n\nAcceleratorsGtk::AcceleratorsGtk() {\n  for (size_t i = 0; i < arraysize(kAcceleratorMap); ++i) {\n    int command_id = kAcceleratorMap[i].command_id;\n    ui::AcceleratorGtk accelerator(kAcceleratorMap[i].keyval,\n                                      kAcceleratorMap[i].modifier_type);\n    all_accelerators_.push_back(\n        std::pair<int, ui::AcceleratorGtk>(command_id, accelerator));\n\n    if (primary_accelerators_.find(command_id) ==\n        primary_accelerators_.end()) {\n      primary_accelerators_[command_id] = accelerator;\n    }\n  }\n}\n\nAcceleratorsGtk::~AcceleratorsGtk() {}\n\n\/\/ static\nAcceleratorsGtk* AcceleratorsGtk::GetInstance() {\n  return Singleton<AcceleratorsGtk>::get();\n}\n\nconst ui::AcceleratorGtk* AcceleratorsGtk::GetPrimaryAcceleratorForCommand(\n    int command_id) {\n  base::hash_map<int, ui::AcceleratorGtk>::const_iterator iter =\n      primary_accelerators_.find(command_id);\n\n  if (iter == primary_accelerators_.end())\n    return NULL;\n\n  return &iter->second;\n}\n<commit_msg>Added Ctrl+Shift+w keyboard shortcut to close a window.<commit_after>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/ui\/gtk\/accelerators_gtk.h\"\n\n#include <gdk\/gdk.h>\n#include <gdk\/gdkkeysyms.h>\n#include <X11\/XF86keysym.h>\n\n#include \"base\/memory\/singleton.h\"\n#include \"chrome\/app\/chrome_command_ids.h\"\n\nnamespace {\n\n\/\/ A mostly complete list of chrome's accelerators. When one command has\n\/\/ multiple shortcuts, the first one in this list is considered \"primary\",\n\/\/ meaning that it will be displayed in context menus.\nconst struct AcceleratorMapping {\n  guint keyval;\n  int command_id;\n  GdkModifierType modifier_type;\n} kAcceleratorMap[] = {\n  \/\/ Focus.\n  { GDK_k, IDC_FOCUS_SEARCH, GDK_CONTROL_MASK },\n  { GDK_e, IDC_FOCUS_SEARCH, GDK_CONTROL_MASK },\n  { XF86XK_Search, IDC_FOCUS_SEARCH, GdkModifierType(0) },\n  { GDK_l, IDC_FOCUS_LOCATION, GDK_CONTROL_MASK },\n  { GDK_d, IDC_FOCUS_LOCATION, GDK_MOD1_MASK },\n  { GDK_F6, IDC_FOCUS_LOCATION, GdkModifierType(0) },\n  { XF86XK_OpenURL, IDC_FOCUS_LOCATION, GdkModifierType(0) },\n  { XF86XK_Go, IDC_FOCUS_LOCATION, GdkModifierType(0) },\n\n  \/\/ Tab\/window controls.\n  { GDK_Page_Down, IDC_SELECT_NEXT_TAB, GDK_CONTROL_MASK },\n  { GDK_Page_Up, IDC_SELECT_PREVIOUS_TAB, GDK_CONTROL_MASK },\n  { GDK_Page_Down, IDC_MOVE_TAB_NEXT,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n  { GDK_Page_Up, IDC_MOVE_TAB_PREVIOUS,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n  { GDK_Page_Up, IDC_SELECT_PREVIOUS_TAB, GDK_CONTROL_MASK },\n  { GDK_w, IDC_CLOSE_TAB, GDK_CONTROL_MASK },\n  { GDK_t, IDC_RESTORE_TAB,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n  { GDK_t, IDC_NEW_TAB, GDK_CONTROL_MASK },\n  { GDK_n, IDC_NEW_WINDOW, GDK_CONTROL_MASK },\n  { GDK_n, IDC_NEW_INCOGNITO_WINDOW,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n  { GDK_w, IDC_CLOSE_WINDOW,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n\n  { GDK_1, IDC_SELECT_TAB_0, GDK_CONTROL_MASK },\n  { GDK_2, IDC_SELECT_TAB_1, GDK_CONTROL_MASK },\n  { GDK_3, IDC_SELECT_TAB_2, GDK_CONTROL_MASK },\n  { GDK_4, IDC_SELECT_TAB_3, GDK_CONTROL_MASK },\n  { GDK_5, IDC_SELECT_TAB_4, GDK_CONTROL_MASK },\n  { GDK_6, IDC_SELECT_TAB_5, GDK_CONTROL_MASK },\n  { GDK_7, IDC_SELECT_TAB_6, GDK_CONTROL_MASK },\n  { GDK_8, IDC_SELECT_TAB_7, GDK_CONTROL_MASK },\n  { GDK_9, IDC_SELECT_LAST_TAB, GDK_CONTROL_MASK },\n\n  { GDK_1, IDC_SELECT_TAB_0, GDK_MOD1_MASK },\n  { GDK_2, IDC_SELECT_TAB_1, GDK_MOD1_MASK },\n  { GDK_3, IDC_SELECT_TAB_2, GDK_MOD1_MASK },\n  { GDK_4, IDC_SELECT_TAB_3, GDK_MOD1_MASK },\n  { GDK_5, IDC_SELECT_TAB_4, GDK_MOD1_MASK },\n  { GDK_6, IDC_SELECT_TAB_5, GDK_MOD1_MASK },\n  { GDK_7, IDC_SELECT_TAB_6, GDK_MOD1_MASK },\n  { GDK_8, IDC_SELECT_TAB_7, GDK_MOD1_MASK },\n  { GDK_9, IDC_SELECT_LAST_TAB, GDK_MOD1_MASK },\n\n  { GDK_KP_1, IDC_SELECT_TAB_0, GDK_CONTROL_MASK },\n  { GDK_KP_2, IDC_SELECT_TAB_1, GDK_CONTROL_MASK },\n  { GDK_KP_3, IDC_SELECT_TAB_2, GDK_CONTROL_MASK },\n  { GDK_KP_4, IDC_SELECT_TAB_3, GDK_CONTROL_MASK },\n  { GDK_KP_5, IDC_SELECT_TAB_4, GDK_CONTROL_MASK },\n  { GDK_KP_6, IDC_SELECT_TAB_5, GDK_CONTROL_MASK },\n  { GDK_KP_7, IDC_SELECT_TAB_6, GDK_CONTROL_MASK },\n  { GDK_KP_8, IDC_SELECT_TAB_7, GDK_CONTROL_MASK },\n  { GDK_KP_9, IDC_SELECT_LAST_TAB, GDK_CONTROL_MASK },\n\n  { GDK_KP_1, IDC_SELECT_TAB_0, GDK_MOD1_MASK },\n  { GDK_KP_2, IDC_SELECT_TAB_1, GDK_MOD1_MASK },\n  { GDK_KP_3, IDC_SELECT_TAB_2, GDK_MOD1_MASK },\n  { GDK_KP_4, IDC_SELECT_TAB_3, GDK_MOD1_MASK },\n  { GDK_KP_5, IDC_SELECT_TAB_4, GDK_MOD1_MASK },\n  { GDK_KP_6, IDC_SELECT_TAB_5, GDK_MOD1_MASK },\n  { GDK_KP_7, IDC_SELECT_TAB_6, GDK_MOD1_MASK },\n  { GDK_KP_8, IDC_SELECT_TAB_7, GDK_MOD1_MASK },\n  { GDK_KP_9, IDC_SELECT_LAST_TAB, GDK_MOD1_MASK },\n\n  { GDK_F4, IDC_CLOSE_TAB, GDK_CONTROL_MASK },\n  { GDK_F4, IDC_CLOSE_WINDOW, GDK_MOD1_MASK },\n\n  \/\/ Zoom level.\n  { GDK_KP_Add, IDC_ZOOM_PLUS, GDK_CONTROL_MASK },\n  { GDK_plus, IDC_ZOOM_PLUS,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n  { GDK_equal, IDC_ZOOM_PLUS, GDK_CONTROL_MASK },\n  { XF86XK_ZoomIn, IDC_ZOOM_PLUS, GdkModifierType(0) },\n  { GDK_KP_0, IDC_ZOOM_NORMAL, GDK_CONTROL_MASK },\n  { GDK_0, IDC_ZOOM_NORMAL, GDK_CONTROL_MASK },\n  { GDK_KP_Subtract, IDC_ZOOM_MINUS, GDK_CONTROL_MASK },\n  { GDK_minus, IDC_ZOOM_MINUS, GDK_CONTROL_MASK },\n  { GDK_underscore, IDC_ZOOM_MINUS,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n  { XF86XK_ZoomOut, IDC_ZOOM_MINUS, GdkModifierType(0) },\n\n  \/\/ Find in page.\n  { GDK_g, IDC_FIND_NEXT, GDK_CONTROL_MASK },\n  { GDK_F3, IDC_FIND_NEXT, GdkModifierType(0) },\n  { GDK_g, IDC_FIND_PREVIOUS,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n  { GDK_F3, IDC_FIND_PREVIOUS, GDK_SHIFT_MASK },\n\n  \/\/ Navigation \/ toolbar buttons.\n  { GDK_Home, IDC_HOME, GDK_MOD1_MASK },\n  { XF86XK_HomePage, IDC_HOME, GdkModifierType(0) },\n  { GDK_Escape, IDC_STOP, GdkModifierType(0) },\n  { XF86XK_Stop, IDC_STOP, GdkModifierType(0) },\n  { GDK_Left, IDC_BACK, GDK_MOD1_MASK },\n  { XF86XK_Back, IDC_BACK, GdkModifierType(0) },\n  { GDK_Right, IDC_FORWARD, GDK_MOD1_MASK },\n  { XF86XK_Forward, IDC_FORWARD, GdkModifierType(0) },\n  { GDK_r, IDC_RELOAD, GDK_CONTROL_MASK },\n  { GDK_r, IDC_RELOAD_IGNORING_CACHE,\n    GdkModifierType(GDK_CONTROL_MASK|GDK_SHIFT_MASK) },\n  { GDK_F5, IDC_RELOAD, GdkModifierType(0) },\n  { GDK_F5, IDC_RELOAD_IGNORING_CACHE, GDK_CONTROL_MASK },\n  { GDK_F5, IDC_RELOAD_IGNORING_CACHE, GDK_SHIFT_MASK },\n  { XF86XK_Reload, IDC_RELOAD, GdkModifierType(0) },\n  { XF86XK_Refresh, IDC_RELOAD, GdkModifierType(0) },\n\n  \/\/ Dev tools.\n  { GDK_u, IDC_VIEW_SOURCE, GDK_CONTROL_MASK },\n  { GDK_i, IDC_DEV_TOOLS,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n  { GDK_F12, IDC_DEV_TOOLS, GdkModifierType(0) },\n  { GDK_j, IDC_DEV_TOOLS_CONSOLE,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n  { GDK_c, IDC_DEV_TOOLS_INSPECT,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n  { GDK_Escape, IDC_TASK_MANAGER, GDK_SHIFT_MASK },\n\n  \/\/ Editing.\n  { GDK_c, IDC_COPY, GDK_CONTROL_MASK },\n  { GDK_x, IDC_CUT, GDK_CONTROL_MASK },\n  { GDK_v, IDC_PASTE, GDK_CONTROL_MASK },\n\n  \/\/ Autofill.\n  { GDK_a, IDC_AUTOFILL_DEFAULT,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n\n  \/\/ Miscellany.\n  { GDK_d, IDC_BOOKMARK_ALL_TABS,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n  { GDK_d, IDC_BOOKMARK_PAGE, GDK_CONTROL_MASK },\n  { GDK_o, IDC_OPEN_FILE, GDK_CONTROL_MASK },\n  { GDK_f, IDC_FIND, GDK_CONTROL_MASK },\n  { GDK_p, IDC_PRINT, GDK_CONTROL_MASK },\n  { GDK_b, IDC_SHOW_BOOKMARK_BAR,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n  { GDK_F11, IDC_FULLSCREEN, GdkModifierType(0) },\n  { GDK_Delete, IDC_CLEAR_BROWSING_DATA,\n    GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n  { GDK_h, IDC_SHOW_HISTORY, GDK_CONTROL_MASK },\n  { GDK_j, IDC_SHOW_DOWNLOADS, GDK_CONTROL_MASK },\n  { GDK_F1, IDC_HELP_PAGE, GdkModifierType(0) },\n  { XF86XK_AddFavorite, IDC_BOOKMARK_PAGE, GdkModifierType(0) },\n  { XF86XK_Favorites, IDC_SHOW_BOOKMARK_BAR, GdkModifierType(0) },\n  { XF86XK_History, IDC_SHOW_HISTORY, GdkModifierType(0) },\n  { GDK_q, IDC_EXIT, GdkModifierType(GDK_CONTROL_MASK | GDK_SHIFT_MASK) },\n  { GDK_s, IDC_SAVE_PAGE, GDK_CONTROL_MASK },\n  { GDK_e, IDC_SHOW_APP_MENU, GDK_MOD1_MASK },\n  { GDK_f, IDC_SHOW_APP_MENU, GDK_MOD1_MASK },\n};\n\n}  \/\/ namespace\n\nAcceleratorsGtk::AcceleratorsGtk() {\n  for (size_t i = 0; i < arraysize(kAcceleratorMap); ++i) {\n    int command_id = kAcceleratorMap[i].command_id;\n    ui::AcceleratorGtk accelerator(kAcceleratorMap[i].keyval,\n                                      kAcceleratorMap[i].modifier_type);\n    all_accelerators_.push_back(\n        std::pair<int, ui::AcceleratorGtk>(command_id, accelerator));\n\n    if (primary_accelerators_.find(command_id) ==\n        primary_accelerators_.end()) {\n      primary_accelerators_[command_id] = accelerator;\n    }\n  }\n}\n\nAcceleratorsGtk::~AcceleratorsGtk() {}\n\n\/\/ static\nAcceleratorsGtk* AcceleratorsGtk::GetInstance() {\n  return Singleton<AcceleratorsGtk>::get();\n}\n\nconst ui::AcceleratorGtk* AcceleratorsGtk::GetPrimaryAcceleratorForCommand(\n    int command_id) {\n  base::hash_map<int, ui::AcceleratorGtk>::const_iterator iter =\n      primary_accelerators_.find(command_id);\n\n  if (iter == primary_accelerators_.end())\n    return NULL;\n\n  return &iter->second;\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 \"org_mitk_gui_qt_simulation_Activator.h\"\n#include \"QmitkBaseItemDelegate.h\"\n#include \"QmitkNoEditItemDelegate.h\"\n#include \"QmitkSimulationView.h\"\n#include <mitkISimulationService.h>\n#include <mitkNodePredicateDataType.h>\n#include <mitkScheduler.h>\n#include <mitkSimulation.h>\n#include <mitkSurface.h>\n#include <mitkVtkModel.h>\n#include <usModuleRegistry.h>\n\ntemplate <class T>\nstatic T* GetService()\n{\n  ctkPluginContext* context = mitk::org_mitk_gui_qt_simulation_Activator::GetContext();\n\n  if (context == NULL)\n    return NULL;\n\n  ctkServiceReference serviceReference = context->getServiceReference<T>();\n\n  return serviceReference\n    ? context->getService<T>(serviceReference)\n    : NULL;\n}\n\nstatic mitk::SimulationInteractor::Pointer CreateSimulationInteractor()\n{\n  const us::Module* simulationModule = us::ModuleRegistry::GetModule(\"MitkSimulation\");\n\n  mitk::SimulationInteractor::Pointer interactor = mitk::SimulationInteractor::New();\n  interactor->LoadStateMachine(\"Simulation.xml\", simulationModule);\n  interactor->SetEventConfig(\"SimulationConfig.xml\", simulationModule);\n\n  return interactor;\n}\n\nclass Equals\n{\npublic:\n  explicit Equals(mitk::DataNode::Pointer dataNode)\n    : m_DataNode(dataNode)\n  {\n  }\n\n  bool operator()(const mitk::DataStorage::SetOfObjects::value_type& object)\n  {\n    return object == m_DataNode;\n  }\n\nprivate:\n  mitk::DataNode::Pointer m_DataNode;\n};\n\nQmitkSimulationView::QmitkSimulationView()\n  : m_SimulationService(GetService<mitk::ISimulationService>()),\n    m_Interactor(CreateSimulationInteractor()),\n    m_VtkModelContextMenu(NULL),\n    m_Timer(this)\n{\n  this->GetDataStorage()->RemoveNodeEvent.AddListener(\n    mitk::MessageDelegate1<QmitkSimulationView, const mitk::DataNode*>(this, &QmitkSimulationView::OnNodeRemovedFromDataStorage));\n\n  connect(&m_Timer, SIGNAL(timeout()), this, SLOT(OnTimeout()));\n}\n\nQmitkSimulationView::~QmitkSimulationView()\n{\n  this->GetDataStorage()->RemoveNodeEvent.RemoveListener(\n    mitk::MessageDelegate1<QmitkSimulationView, const mitk::DataNode*>(this, &QmitkSimulationView::OnNodeRemovedFromDataStorage));\n}\n\nvoid QmitkSimulationView::CreateQtPartControl(QWidget* parent)\n{\n  m_Ui.setupUi(parent);\n\n  m_Ui.simulationComboBox->SetDataStorage(this->GetDataStorage());\n  m_Ui.simulationComboBox->SetPredicate(mitk::NodePredicateDataType::New(\"Simulation\"));\n\n  QAction* vtkModelModeAction = new QAction(\/*QIcon(\":\/Qmitk\/Surface_48.png\"),*\/ \"Render to Surface\", m_VtkModelContextMenu);\n  vtkModelModeAction->setCheckable(true);\n\n  m_VtkModelContextMenu = new QMenu(m_Ui.sceneTreeWidget);\n  m_VtkModelContextMenu->addAction(vtkModelModeAction);\n\n  connect(m_Ui.simulationComboBox, SIGNAL(OnSelectionChanged(const mitk::DataNode*)), this, SLOT(OnSelectedSimulationChanged(const mitk::DataNode*)));\n  connect(m_Ui.animateButton, SIGNAL(toggled(bool)), this, SLOT(OnAnimateButtonToggled(bool)));\n  connect(m_Ui.stepButton, SIGNAL(clicked()), this, SLOT(OnStepButtonClicked()));\n  connect(m_Ui.resetButton, SIGNAL(clicked()), this, SLOT(OnResetButtonClicked()));\n  connect(m_Ui.dtSpinBox, SIGNAL(valueChanged(double)), this, SLOT(OnDtChanged(double)));\n  connect(m_Ui.sceneTreeWidget, SIGNAL(itemSelectionChanged()), this, SLOT(OnSelectedBaseChanged()));\n  connect(m_Ui.sceneTreeWidget, SIGNAL(customContextMenuRequested(const QPoint&)), this, SLOT(OnBaseContextMenuRequested(const QPoint&)));\n\n  if (m_Ui.simulationComboBox->GetSelectedNode().IsNotNull())\n  {\n    this->OnSelectedSimulationChanged(m_Ui.simulationComboBox->GetSelectedNode());\n  }\n  else\n  {\n    this->SetSimulationControlsEnabled(false);\n  }\n}\n\nvoid QmitkSimulationView::OnAnimateButtonToggled(bool toggled)\n{\n  mitk::Scheduler* scheduler = m_SimulationService->GetScheduler();\n\n  if (toggled)\n  {\n    mitk::Simulation::Pointer simulation = static_cast<mitk::Simulation*>(m_Selection->GetData());\n\n    simulation->SetAnimationFlag(true);\n    scheduler->AddProcess(simulation);\n\n    m_Ui.stepButton->setEnabled(false);\n  }\n  else if (m_Selection.IsNotNull())\n  {\n    mitk::Simulation::Pointer simulation = static_cast<mitk::Simulation*>(m_Selection->GetData());\n\n    scheduler->RemoveProcess(simulation);\n    simulation->SetAnimationFlag(false);\n\n    m_Ui.stepButton->setEnabled(true);\n  }\n\n  if (!scheduler->IsEmpty())\n  {\n    if (!m_Timer.isActive())\n      m_Timer.start(0);\n  }\n  else\n  {\n    m_Timer.stop();\n  }\n}\n\nvoid QmitkSimulationView::OnBaseContextMenuRequested(const QPoint& point)\n{\n  typedef mitk::DataStorage::SetOfObjects SetOfObjects;\n\n  QTreeWidgetItem* item = m_Ui.sceneTreeWidget->itemAt(point);\n\n  if (item == NULL)\n    return;\n\n  QmitkSceneTreeWidget::Base* base = m_Ui.sceneTreeWidget->GetBaseFromItem(item);\n\n  if (base == NULL)\n    return;\n\n  mitk::VtkModel* vtkModel = dynamic_cast<mitk::VtkModel*>(base);\n\n  if (vtkModel == NULL)\n    return;\n\n  QAction* action = m_VtkModelContextMenu->exec(m_Ui.sceneTreeWidget->mapToGlobal(point));\n\n  if (action == NULL)\n    return;\n\n  if (action->text() == \"Render to Surface\")\n  {\n    mitk::DataStorage::Pointer dataStorage = this->GetDataStorage();\n    SetOfObjects::ConstPointer objects = dataStorage->GetSubset(NULL);\n\n    if (action->isChecked())\n    {\n      vtkModel->SetMode(mitk::VtkModel::Surface);\n      mitk::DataNode::Pointer dataNode = vtkModel->GetDataNode();\n\n      if (std::find_if(objects->begin(), objects->end(), Equals(dataNode)) == objects->end())\n        dataStorage->Add(dataNode, m_Selection);\n    }\n    else\n    {\n      mitk::DataNode::Pointer dataNode = vtkModel->GetDataNode();\n\n      if (std::find_if(objects->begin(), objects->end(), Equals(dataNode)) != objects->end())\n        dataStorage->Remove(dataNode);\n\n      vtkModel->SetMode(mitk::VtkModel::OpenGL);\n    }\n  }\n}\n\nvoid QmitkSimulationView::OnDtChanged(double dt)\n{\n  if (m_Selection.IsNull())\n    return;\n\n  mitk::Simulation::Pointer simulation = static_cast<mitk::Simulation*>(m_Selection->GetData());\n  simulation->SetDt(std::max(0.0, dt));\n}\n\nvoid QmitkSimulationView::OnNodeRemovedFromDataStorage(const mitk::DataNode* node)\n{\n  mitk::Simulation::Pointer simulation = dynamic_cast<mitk::Simulation*>(node->GetData());\n\n  if (simulation.IsNotNull())\n  {\n    mitk::Scheduler* scheduler = m_SimulationService->GetScheduler();\n\n    scheduler->RemoveProcess(simulation);\n\n    if (scheduler->IsEmpty() && m_Timer.isActive())\n      m_Timer.stop();\n\n    if (m_SimulationService->GetActiveSimulation() == simulation)\n      m_SimulationService->SetActiveSimulation(NULL);\n  }\n}\n\nvoid QmitkSimulationView::OnResetButtonClicked()\n{\n  mitk::Simulation::Pointer simulation = static_cast<mitk::Simulation*>(m_Selection->GetData());\n  m_SimulationService->SetActiveSimulation(simulation);\n\n  m_Ui.dtSpinBox->setValue(simulation->GetRootNode()->getDt());\n  simulation->Reset();\n\n  this->RequestRenderWindowUpdate(mitk::RenderingManager::REQUEST_UPDATE_ALL);\n}\n\nvoid QmitkSimulationView::OnSelectedSimulationChanged(const mitk::DataNode* node)\n{\n  if (node != NULL)\n  {\n    m_Selection = m_Ui.simulationComboBox->GetSelectedNode();\n    mitk::Simulation* simulation = static_cast<mitk::Simulation*>(m_Selection->GetData());\n\n    m_Ui.animateButton->setChecked(simulation->GetAnimationFlag());\n    m_Ui.dtSpinBox->setValue(simulation->GetRootNode()->getDt());\n    this->SetSimulationControlsEnabled(true);\n  }\n  else\n  {\n    m_Selection = NULL;\n\n    this->SetSimulationControlsEnabled(false);\n    m_Ui.animateButton->setChecked(false);\n    m_Ui.dtSpinBox->setValue(0.0);\n  }\n\n  m_Interactor->SetDataNode(m_Selection);\n\n  this->ResetSceneTreeWidget();\n}\n\nvoid QmitkSimulationView::OnSelectedBaseChanged()\n{\n  QList<QTreeWidgetItem*> selectedBaseItems = m_Ui.sceneTreeWidget->selectedItems();\n\n  m_Ui.baseTreeWidget->OnSelectedBaseChanged(!selectedBaseItems.isEmpty()\n    ? m_Ui.sceneTreeWidget->GetBaseFromItem(selectedBaseItems[0])\n    : NULL);\n}\n\nvoid QmitkSimulationView::OnStep(bool renderWindowUpdate)\n{\n  mitk::Scheduler* scheduler = m_SimulationService->GetScheduler();\n  mitk::Simulation::Pointer simulation = dynamic_cast<mitk::Simulation*>(scheduler->GetNextProcess());\n\n  m_SimulationService->SetActiveSimulation(simulation);\n\n  if (simulation.IsNotNull())\n    simulation->Animate();\n\n  if (renderWindowUpdate)\n    this->RequestRenderWindowUpdate(mitk::RenderingManager::REQUEST_UPDATE_ALL);\n}\n\nvoid QmitkSimulationView::OnStepButtonClicked()\n{\n  if (m_Selection.IsNull())\n    return;\n\n  mitk::Simulation::Pointer simulation = static_cast<mitk::Simulation*>(m_Selection->GetData());\n\n  m_SimulationService->SetActiveSimulation(simulation);\n  simulation->Animate();\n\n  this->RequestRenderWindowUpdate(mitk::RenderingManager::REQUEST_UPDATE_ALL);\n}\n\nvoid QmitkSimulationView::OnTimeout()\n{\n  QTime currentTime = QTime::currentTime();\n\n  if (currentTime.msecsTo(m_NextRenderWindowUpdate) > 0)\n  {\n    this->OnStep(false);\n  }\n  else\n  {\n    m_NextRenderWindowUpdate = currentTime.addMSecs(MSecsPerFrame);\n    this->OnStep(true);\n  }\n}\n\nvoid QmitkSimulationView::ResetSceneTreeWidget()\n{\n  m_Ui.sceneTreeWidget->clear();\n\n  if (m_Selection.IsNull())\n    return;\n\n  mitk::Simulation::Pointer simulation = static_cast<mitk::Simulation*>(m_Selection->GetData());\n\n  m_Ui.sceneTreeWidget->addChild(NULL, simulation->GetRootNode().get());\n  m_Ui.sceneTreeWidget->expandItem(m_Ui.sceneTreeWidget->topLevelItem(0));\n}\n\nvoid QmitkSimulationView::SetSimulationControlsEnabled(bool enabled)\n{\n  m_Ui.animateButton->setEnabled(enabled);\n  m_Ui.stepButton->setEnabled(enabled);\n  m_Ui.resetButton->setEnabled(enabled);\n  m_Ui.dtLabel->setEnabled(enabled);\n  m_Ui.dtSpinBox->setEnabled(enabled);\n}\n\nvoid QmitkSimulationView::SetFocus()\n{\n  m_Ui.animateButton->setFocus();\n}\n<commit_msg>Fixed context menu checked state.<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 \"org_mitk_gui_qt_simulation_Activator.h\"\n#include \"QmitkBaseItemDelegate.h\"\n#include \"QmitkNoEditItemDelegate.h\"\n#include \"QmitkSimulationView.h\"\n#include <mitkISimulationService.h>\n#include <mitkNodePredicateDataType.h>\n#include <mitkScheduler.h>\n#include <mitkSimulation.h>\n#include <mitkSurface.h>\n#include <mitkVtkModel.h>\n#include <usModuleRegistry.h>\n\ntemplate <class T>\nstatic T* GetService()\n{\n  ctkPluginContext* context = mitk::org_mitk_gui_qt_simulation_Activator::GetContext();\n\n  if (context == NULL)\n    return NULL;\n\n  ctkServiceReference serviceReference = context->getServiceReference<T>();\n\n  return serviceReference\n    ? context->getService<T>(serviceReference)\n    : NULL;\n}\n\nstatic mitk::SimulationInteractor::Pointer CreateSimulationInteractor()\n{\n  const us::Module* simulationModule = us::ModuleRegistry::GetModule(\"MitkSimulation\");\n\n  mitk::SimulationInteractor::Pointer interactor = mitk::SimulationInteractor::New();\n  interactor->LoadStateMachine(\"Simulation.xml\", simulationModule);\n  interactor->SetEventConfig(\"SimulationConfig.xml\", simulationModule);\n\n  return interactor;\n}\n\nclass Equals\n{\npublic:\n  explicit Equals(mitk::DataNode::Pointer dataNode)\n    : m_DataNode(dataNode)\n  {\n  }\n\n  bool operator()(const mitk::DataStorage::SetOfObjects::value_type& object)\n  {\n    return object == m_DataNode;\n  }\n\nprivate:\n  mitk::DataNode::Pointer m_DataNode;\n};\n\nQmitkSimulationView::QmitkSimulationView()\n  : m_SimulationService(GetService<mitk::ISimulationService>()),\n    m_Interactor(CreateSimulationInteractor()),\n    m_VtkModelContextMenu(NULL),\n    m_Timer(this)\n{\n  this->GetDataStorage()->RemoveNodeEvent.AddListener(\n    mitk::MessageDelegate1<QmitkSimulationView, const mitk::DataNode*>(this, &QmitkSimulationView::OnNodeRemovedFromDataStorage));\n\n  connect(&m_Timer, SIGNAL(timeout()), this, SLOT(OnTimeout()));\n}\n\nQmitkSimulationView::~QmitkSimulationView()\n{\n  this->GetDataStorage()->RemoveNodeEvent.RemoveListener(\n    mitk::MessageDelegate1<QmitkSimulationView, const mitk::DataNode*>(this, &QmitkSimulationView::OnNodeRemovedFromDataStorage));\n}\n\nvoid QmitkSimulationView::CreateQtPartControl(QWidget* parent)\n{\n  m_Ui.setupUi(parent);\n\n  m_Ui.simulationComboBox->SetDataStorage(this->GetDataStorage());\n  m_Ui.simulationComboBox->SetPredicate(mitk::NodePredicateDataType::New(\"Simulation\"));\n\n  QAction* vtkModelModeAction = new QAction(\/*QIcon(\":\/Qmitk\/Surface_48.png\"),*\/ \"Render to Surface\", m_VtkModelContextMenu);\n  vtkModelModeAction->setCheckable(true);\n\n  m_VtkModelContextMenu = new QMenu(m_Ui.sceneTreeWidget);\n  m_VtkModelContextMenu->addAction(vtkModelModeAction);\n\n  connect(m_Ui.simulationComboBox, SIGNAL(OnSelectionChanged(const mitk::DataNode*)), this, SLOT(OnSelectedSimulationChanged(const mitk::DataNode*)));\n  connect(m_Ui.animateButton, SIGNAL(toggled(bool)), this, SLOT(OnAnimateButtonToggled(bool)));\n  connect(m_Ui.stepButton, SIGNAL(clicked()), this, SLOT(OnStepButtonClicked()));\n  connect(m_Ui.resetButton, SIGNAL(clicked()), this, SLOT(OnResetButtonClicked()));\n  connect(m_Ui.dtSpinBox, SIGNAL(valueChanged(double)), this, SLOT(OnDtChanged(double)));\n  connect(m_Ui.sceneTreeWidget, SIGNAL(itemSelectionChanged()), this, SLOT(OnSelectedBaseChanged()));\n  connect(m_Ui.sceneTreeWidget, SIGNAL(customContextMenuRequested(const QPoint&)), this, SLOT(OnBaseContextMenuRequested(const QPoint&)));\n\n  if (m_Ui.simulationComboBox->GetSelectedNode().IsNotNull())\n  {\n    this->OnSelectedSimulationChanged(m_Ui.simulationComboBox->GetSelectedNode());\n  }\n  else\n  {\n    this->SetSimulationControlsEnabled(false);\n  }\n}\n\nvoid QmitkSimulationView::OnAnimateButtonToggled(bool toggled)\n{\n  mitk::Scheduler* scheduler = m_SimulationService->GetScheduler();\n\n  if (toggled)\n  {\n    mitk::Simulation::Pointer simulation = static_cast<mitk::Simulation*>(m_Selection->GetData());\n\n    simulation->SetAnimationFlag(true);\n    scheduler->AddProcess(simulation);\n\n    m_Ui.stepButton->setEnabled(false);\n  }\n  else if (m_Selection.IsNotNull())\n  {\n    mitk::Simulation::Pointer simulation = static_cast<mitk::Simulation*>(m_Selection->GetData());\n\n    scheduler->RemoveProcess(simulation);\n    simulation->SetAnimationFlag(false);\n\n    m_Ui.stepButton->setEnabled(true);\n  }\n\n  if (!scheduler->IsEmpty())\n  {\n    if (!m_Timer.isActive())\n      m_Timer.start(0);\n  }\n  else\n  {\n    m_Timer.stop();\n  }\n}\n\nvoid QmitkSimulationView::OnBaseContextMenuRequested(const QPoint& point)\n{\n  typedef mitk::DataStorage::SetOfObjects SetOfObjects;\n\n  QTreeWidgetItem* item = m_Ui.sceneTreeWidget->itemAt(point);\n\n  if (item == NULL)\n    return;\n\n  QmitkSceneTreeWidget::Base* base = m_Ui.sceneTreeWidget->GetBaseFromItem(item);\n\n  if (base == NULL)\n    return;\n\n  mitk::VtkModel* vtkModel = dynamic_cast<mitk::VtkModel*>(base);\n\n  if (vtkModel == NULL)\n    return;\n\n  m_VtkModelContextMenu->actions().first()->setChecked(vtkModel->GetMode() == mitk::VtkModel::Surface);\n\n  QAction* action = m_VtkModelContextMenu->exec(m_Ui.sceneTreeWidget->mapToGlobal(point));\n\n  if (action == NULL)\n    return;\n\n  if (action->text() == \"Render to Surface\")\n  {\n    mitk::DataStorage::Pointer dataStorage = this->GetDataStorage();\n    SetOfObjects::ConstPointer objects = dataStorage->GetSubset(NULL);\n\n    if (action->isChecked())\n    {\n      vtkModel->SetMode(mitk::VtkModel::Surface);\n      mitk::DataNode::Pointer dataNode = vtkModel->GetDataNode();\n\n      if (std::find_if(objects->begin(), objects->end(), Equals(dataNode)) == objects->end())\n        dataStorage->Add(dataNode, m_Selection);\n    }\n    else\n    {\n      mitk::DataNode::Pointer dataNode = vtkModel->GetDataNode();\n\n      if (std::find_if(objects->begin(), objects->end(), Equals(dataNode)) != objects->end())\n        dataStorage->Remove(dataNode);\n\n      vtkModel->SetMode(mitk::VtkModel::OpenGL);\n    }\n  }\n}\n\nvoid QmitkSimulationView::OnDtChanged(double dt)\n{\n  if (m_Selection.IsNull())\n    return;\n\n  mitk::Simulation::Pointer simulation = static_cast<mitk::Simulation*>(m_Selection->GetData());\n  simulation->SetDt(std::max(0.0, dt));\n}\n\nvoid QmitkSimulationView::OnNodeRemovedFromDataStorage(const mitk::DataNode* node)\n{\n  mitk::Simulation::Pointer simulation = dynamic_cast<mitk::Simulation*>(node->GetData());\n\n  if (simulation.IsNotNull())\n  {\n    mitk::Scheduler* scheduler = m_SimulationService->GetScheduler();\n\n    scheduler->RemoveProcess(simulation);\n\n    if (scheduler->IsEmpty() && m_Timer.isActive())\n      m_Timer.stop();\n\n    if (m_SimulationService->GetActiveSimulation() == simulation)\n      m_SimulationService->SetActiveSimulation(NULL);\n  }\n}\n\nvoid QmitkSimulationView::OnResetButtonClicked()\n{\n  mitk::Simulation::Pointer simulation = static_cast<mitk::Simulation*>(m_Selection->GetData());\n  m_SimulationService->SetActiveSimulation(simulation);\n\n  m_Ui.dtSpinBox->setValue(simulation->GetRootNode()->getDt());\n  simulation->Reset();\n\n  this->RequestRenderWindowUpdate(mitk::RenderingManager::REQUEST_UPDATE_ALL);\n}\n\nvoid QmitkSimulationView::OnSelectedSimulationChanged(const mitk::DataNode* node)\n{\n  if (node != NULL)\n  {\n    m_Selection = m_Ui.simulationComboBox->GetSelectedNode();\n    mitk::Simulation* simulation = static_cast<mitk::Simulation*>(m_Selection->GetData());\n\n    m_Ui.animateButton->setChecked(simulation->GetAnimationFlag());\n    m_Ui.dtSpinBox->setValue(simulation->GetRootNode()->getDt());\n    this->SetSimulationControlsEnabled(true);\n  }\n  else\n  {\n    m_Selection = NULL;\n\n    this->SetSimulationControlsEnabled(false);\n    m_Ui.animateButton->setChecked(false);\n    m_Ui.dtSpinBox->setValue(0.0);\n  }\n\n  m_Interactor->SetDataNode(m_Selection);\n\n  this->ResetSceneTreeWidget();\n}\n\nvoid QmitkSimulationView::OnSelectedBaseChanged()\n{\n  QList<QTreeWidgetItem*> selectedBaseItems = m_Ui.sceneTreeWidget->selectedItems();\n\n  m_Ui.baseTreeWidget->OnSelectedBaseChanged(!selectedBaseItems.isEmpty()\n    ? m_Ui.sceneTreeWidget->GetBaseFromItem(selectedBaseItems[0])\n    : NULL);\n}\n\nvoid QmitkSimulationView::OnStep(bool renderWindowUpdate)\n{\n  mitk::Scheduler* scheduler = m_SimulationService->GetScheduler();\n  mitk::Simulation::Pointer simulation = dynamic_cast<mitk::Simulation*>(scheduler->GetNextProcess());\n\n  m_SimulationService->SetActiveSimulation(simulation);\n\n  if (simulation.IsNotNull())\n    simulation->Animate();\n\n  if (renderWindowUpdate)\n    this->RequestRenderWindowUpdate(mitk::RenderingManager::REQUEST_UPDATE_ALL);\n}\n\nvoid QmitkSimulationView::OnStepButtonClicked()\n{\n  if (m_Selection.IsNull())\n    return;\n\n  mitk::Simulation::Pointer simulation = static_cast<mitk::Simulation*>(m_Selection->GetData());\n\n  m_SimulationService->SetActiveSimulation(simulation);\n  simulation->Animate();\n\n  this->RequestRenderWindowUpdate(mitk::RenderingManager::REQUEST_UPDATE_ALL);\n}\n\nvoid QmitkSimulationView::OnTimeout()\n{\n  QTime currentTime = QTime::currentTime();\n\n  if (currentTime.msecsTo(m_NextRenderWindowUpdate) > 0)\n  {\n    this->OnStep(false);\n  }\n  else\n  {\n    m_NextRenderWindowUpdate = currentTime.addMSecs(MSecsPerFrame);\n    this->OnStep(true);\n  }\n}\n\nvoid QmitkSimulationView::ResetSceneTreeWidget()\n{\n  m_Ui.sceneTreeWidget->clear();\n\n  if (m_Selection.IsNull())\n    return;\n\n  mitk::Simulation::Pointer simulation = static_cast<mitk::Simulation*>(m_Selection->GetData());\n\n  m_Ui.sceneTreeWidget->addChild(NULL, simulation->GetRootNode().get());\n  m_Ui.sceneTreeWidget->expandItem(m_Ui.sceneTreeWidget->topLevelItem(0));\n}\n\nvoid QmitkSimulationView::SetSimulationControlsEnabled(bool enabled)\n{\n  m_Ui.animateButton->setEnabled(enabled);\n  m_Ui.stepButton->setEnabled(enabled);\n  m_Ui.resetButton->setEnabled(enabled);\n  m_Ui.dtLabel->setEnabled(enabled);\n  m_Ui.dtSpinBox->setEnabled(enabled);\n}\n\nvoid QmitkSimulationView::SetFocus()\n{\n  m_Ui.animateButton->setFocus();\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\/*!\n * \\file src\/relay\/transforms\/merge_composite.cc\n * \\brief Merges expressions matching patterns into functions marked\n * as 'composite'. This is primarily intended to be used alongside the\n * external codegen infrastructure to support the case where multiple\n * Relay operators map to a single external operator.\n *\/\n\n#include <tvm\/relay\/analysis.h>\n#include <tvm\/relay\/expr_functor.h>\n#include <tvm\/relay\/op_attr_types.h>\n#include <tvm\/relay\/transform.h>\n#include <tvm\/te\/operation.h>\n\nnamespace tvm {\nnamespace relay {\nnamespace merge_composite {\n\nclass MergeCompositeWrapper : public ExprMutator {\n public:\n  explicit MergeCompositeWrapper(const std::string& pattern_name, const Expr& pattern,\n                                 const PackedFunc& check)\n      : pattern_name_(pattern_name), pattern_(pattern), check_(check) {}\n\n  Expr ExtractPattern(const Var& pattern, const Expr& root,\n                      Map<std::string, Array<Expr>>* var_map) {\n    if (var_map->find(pattern->name_hint()) == var_map->end()) {\n      \/\/ if we haven't encountered this var yet, make a new free var and associate\n      \/\/ it with the value at 'root'\n      auto free_var = Var(pattern->name_hint(), Type());\n      var_map->Set(pattern->name_hint(), Array<Expr>({free_var, root}));\n      return std::move(free_var);\n    } else {\n      \/\/ if we have encountered this var already, return the free var that was created\n      auto vars = (*var_map)[pattern->name_hint()];\n      auto free_var = vars[0];\n      auto graph_expr = vars[1];\n      \/\/ make sure to first check they both map to the same node in the graph\n      if (graph_expr != root) {\n        return Expr();\n      }\n      return (*var_map)[pattern->name_hint()][0];\n    }\n  }\n\n  Expr ExtractPattern(const Constant& pattern, const Expr& root,\n                      Map<std::string, Array<Expr>>* var_map) {\n    return root;\n  }\n\n  Expr ExtractPattern(const TupleGetItem& pattern, const Expr& root,\n                      Map<std::string, Array<Expr>>* var_map, Map<Expr, Expr>* call_map) {\n    if (!root->IsInstance<TupleGetItemNode>()) {\n      return Expr();\n    }\n    auto root_node = Downcast<TupleGetItem>(root);\n    if (pattern->index != root_node->index) {\n      return Expr();\n    }\n    if (pattern->tuple->IsInstance<CallNode>() && root_node->tuple->IsInstance<CallNode>()) {\n      Expr new_arg;\n      if (call_map->find(pattern->tuple) != call_map->end()) {\n        new_arg = (*call_map)[pattern->tuple];\n      } else {\n        new_arg = ExtractPattern(Downcast<Call>(pattern->tuple), Downcast<Call>(root_node->tuple),\n                                 var_map, call_map);\n        call_map->Set(pattern->tuple, new_arg);\n      }\n      return TupleGetItem(new_arg, root_node->index);\n    }\n    return Expr();\n  }\n\n  \/*!\n   * \\brief Try and extract a given pattern from a graph as a subgraph.\n   * \\param pattern The pattern to extract.\n   * \\param root The graph to extract from.\n   * \\param var_map A map between free vars in the subgraph and nodes in the graph.\n   * \\return The extracted subgraph.\n   *\n   * \\note How does this work?\n   *\n   * A pattern consists of Relay expression containing only operator call nodes, constants\n   * and free variables. The free variables indicate where the pattern can 'attach' in your\n   * graph. This function takes the final call node of the pattern and the call node currently\n   * being traversed in the Relay graph. It traverses through the pattern in lockstep with call node\n   * from the graph (referred to as the 'root' node here) to check they're identical. If at any\n   * point they differ, an empty expression is returned to signify the extract failed. If a free var\n   * is reached in the pattern, the corresponding value in the root is associated with the name of\n   * the free var (via the var_map) so that when we construct the composite function, the inputs\n   * match up correctly with the rest of the graph. The return value of this function when\n   * successful is a new Relay expression ready to be wrapped into a composite function.\n   *\/\n  Expr ExtractPattern(const Call& pattern, const Call& root, Map<std::string, Array<Expr>>* var_map,\n                      Map<Expr, Expr>* call_map) {\n    \/\/ check to make sure both calls are to operators (not functions)\n    if (!root.defined()) return Expr();\n    if (!pattern->op->IsInstance<OpNode>() || !root->op->IsInstance<OpNode>()) return Expr();\n    if (pattern->op.as<OpNode>()->name != root->op.as<OpNode>()->name) return Expr();\n\n    unsigned int i = 0;\n    Array<Expr> new_args;\n    for (const auto& arg : pattern->args) {\n      Expr new_arg;\n      if (arg->IsInstance<CallNode>()) {\n        new_arg =\n            ExtractPattern(Downcast<Call>(arg), Downcast<Call>(root->args[i]), var_map, call_map);\n        \/\/ if we've already processed this call node, return the previous result\n        if (call_map->find(arg) != call_map->end() && new_arg.defined()) {\n          new_arg = (*call_map)[arg];\n        } else {\n          call_map->Set(arg, new_arg);\n        }\n      } else if (arg->IsInstance<VarNode>()) {\n        \/\/ if there's a var in the pattern, it must be a free var\n        \/\/ so call the function to update the var_map\n        new_arg = ExtractPattern(Downcast<Var>(arg), root->args[i], var_map);\n      } else if (arg->IsInstance<ConstantNode>()) {\n        \/\/ if there's a constant, simply get the corresponding\n        \/\/ value of the constant from the root\n        new_arg = ExtractPattern(Downcast<Constant>(arg), root->args[i], var_map);\n      } else if (arg->IsInstance<TupleGetItemNode>()) {\n        new_arg = ExtractPattern(Downcast<TupleGetItem>(arg), root->args[i], var_map, call_map);\n      }\n      if (!new_arg.defined()) {\n        return Expr();\n      }\n      new_args.push_back(new_arg);\n      i++;\n    }\n    return Call(root->op, new_args, root->attrs);\n  }\n\n  Expr VisitExpr_(const CallNode* cn) {\n    Call call = GetRef<Call>(cn);\n    if (call->op->IsInstance<FunctionNode>()) {\n      Function func = Downcast<Function>(call->op);\n      CHECK(func.defined());\n      auto name_node = func->GetAttr<String>(attr::kComposite);\n      \/\/ don't step into existing composite functions\n      if (name_node.defined() && name_node != \"\") {\n        tvm::Array<tvm::relay::Expr> new_args;\n        for (const auto& arg : call->args) {\n          auto new_e = this->Mutate(arg);\n          new_args.push_back(new_e);\n        }\n        return Call(call->op, new_args, call->attrs);\n      }\n    }\n\n    Expr expr = ExprMutator::VisitExpr_(cn);\n    call = Downcast<Call>(expr);\n    if (!call->op->IsInstance<OpNode>()) return std::move(call);\n\n    \/\/ only call patterns are supported\n    Call pattern = Downcast<Call>(pattern_);\n    CHECK(pattern.defined());\n    Map<std::string, Array<Expr>> args_map;\n    Map<Expr, Expr> call_map;\n    auto extract = ExtractPattern(pattern, call, &args_map, &call_map);\n    if (extract.defined() && static_cast<bool>(check_(extract))) {\n      auto free_vars = FreeVars(extract);\n      \/\/ make the composite function\n      auto f = Function(free_vars, extract, call->checked_type_, {}, DictAttrs());\n      f = WithAttr(std::move(f), attr::kComposite, runtime::String(pattern_name_));\n      \/\/ find the expressions associated with the free vars using the args_map\n      \/\/ this tells us which expressions should be given as inputs to the composite function\n      Array<Expr> args;\n      for (const auto& free_var : free_vars) {\n        args.push_back(args_map[free_var->name_hint()][1]);\n      }\n      auto new_call = Call(f, args);\n      return std::move(new_call);\n    }\n    return std::move(call);\n  }\n\n private:\n  \/*! \\brief The name of the pattern to match *\/\n  std::string pattern_name_;\n  \/*! \\brief The pattern to match *\/\n  Expr pattern_;\n  \/*! \\brief The function to check whether an extract is supported *\/\n  PackedFunc check_;\n};\n\nExpr MergeComposite(const Expr& expr, const Array<runtime::String>& pattern_names,\n                    const Array<Expr>& patterns, const std::vector<PackedFunc>& checks) {\n  CHECK_EQ(pattern_names.size(), patterns.size());\n  Expr merged_expr = expr;\n  \/\/ merge the patterns one-by-one in order\n  for (size_t i = 0; i < patterns.size(); i++) {\n    merged_expr =\n        MergeCompositeWrapper(pattern_names[i], patterns[i], checks[i]).Mutate(merged_expr);\n  }\n  return merged_expr;\n}\n\n}  \/\/ namespace merge_composite\n\nnamespace transform {\n\nPass MergeComposite(const tvm::Array<runtime::String>& pattern_names,\n                    const tvm::Array<Expr>& patterns, const std::vector<PackedFunc>& checks) {\n  runtime::TypedPackedFunc<Function(Function, IRModule, PassContext)> pass_func =\n      [=](Function f, IRModule m, PassContext pc) {\n        return Downcast<Function>(\n            relay::merge_composite::MergeComposite(f, pattern_names, patterns, checks));\n      };\n  auto func_pass = CreateFunctionPass(pass_func, 0, \"MergeComposite\", {});\n  return func_pass;\n}\n\nTVM_REGISTER_GLOBAL(\"relay._transform.MergeComposite\").set_body([](TVMArgs args, TVMRetValue* rv) {\n  tvm::Array<runtime::String> pattern_names = args[0];\n  tvm::Array<Expr> patterns = args[1];\n  std::vector<PackedFunc> checks;\n  for (int i = 2; i < args.size(); i++) {\n    checks.push_back(args[i]);\n  }\n  *rv = MergeComposite(pattern_names, patterns, checks);\n});\n\n}  \/\/ namespace transform\n\n}  \/\/ namespace relay\n}  \/\/ namespace tvm\n<commit_msg>[BYOC][MergeComposite] if root->args[i] isn't a CallNode, then Donwcast<Call> will check fail (#5623)<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 src\/relay\/transforms\/merge_composite.cc\n * \\brief Merges expressions matching patterns into functions marked\n * as 'composite'. This is primarily intended to be used alongside the\n * external codegen infrastructure to support the case where multiple\n * Relay operators map to a single external operator.\n *\/\n\n#include <tvm\/relay\/analysis.h>\n#include <tvm\/relay\/expr_functor.h>\n#include <tvm\/relay\/op_attr_types.h>\n#include <tvm\/relay\/transform.h>\n#include <tvm\/te\/operation.h>\n\nnamespace tvm {\nnamespace relay {\nnamespace merge_composite {\n\nclass MergeCompositeWrapper : public ExprMutator {\n public:\n  explicit MergeCompositeWrapper(const std::string& pattern_name, const Expr& pattern,\n                                 const PackedFunc& check)\n      : pattern_name_(pattern_name), pattern_(pattern), check_(check) {}\n\n  Expr ExtractPattern(const Var& pattern, const Expr& root,\n                      Map<std::string, Array<Expr>>* var_map) {\n    if (var_map->find(pattern->name_hint()) == var_map->end()) {\n      \/\/ if we haven't encountered this var yet, make a new free var and associate\n      \/\/ it with the value at 'root'\n      auto free_var = Var(pattern->name_hint(), Type());\n      var_map->Set(pattern->name_hint(), Array<Expr>({free_var, root}));\n      return std::move(free_var);\n    } else {\n      \/\/ if we have encountered this var already, return the free var that was created\n      auto vars = (*var_map)[pattern->name_hint()];\n      auto free_var = vars[0];\n      auto graph_expr = vars[1];\n      \/\/ make sure to first check they both map to the same node in the graph\n      if (graph_expr != root) {\n        return Expr();\n      }\n      return (*var_map)[pattern->name_hint()][0];\n    }\n  }\n\n  Expr ExtractPattern(const Constant& pattern, const Expr& root,\n                      Map<std::string, Array<Expr>>* var_map) {\n    return root;\n  }\n\n  Expr ExtractPattern(const TupleGetItem& pattern, const Expr& root,\n                      Map<std::string, Array<Expr>>* var_map, Map<Expr, Expr>* call_map) {\n    if (!root->IsInstance<TupleGetItemNode>()) {\n      return Expr();\n    }\n    auto root_node = Downcast<TupleGetItem>(root);\n    if (pattern->index != root_node->index) {\n      return Expr();\n    }\n    if (pattern->tuple->IsInstance<CallNode>() && root_node->tuple->IsInstance<CallNode>()) {\n      Expr new_arg;\n      if (call_map->find(pattern->tuple) != call_map->end()) {\n        new_arg = (*call_map)[pattern->tuple];\n      } else {\n        new_arg = ExtractPattern(Downcast<Call>(pattern->tuple), Downcast<Call>(root_node->tuple),\n                                 var_map, call_map);\n        call_map->Set(pattern->tuple, new_arg);\n      }\n      return TupleGetItem(new_arg, root_node->index);\n    }\n    return Expr();\n  }\n\n  \/*!\n   * \\brief Try and extract a given pattern from a graph as a subgraph.\n   * \\param pattern The pattern to extract.\n   * \\param root The graph to extract from.\n   * \\param var_map A map between free vars in the subgraph and nodes in the graph.\n   * \\return The extracted subgraph.\n   *\n   * \\note How does this work?\n   *\n   * A pattern consists of Relay expression containing only operator call nodes, constants\n   * and free variables. The free variables indicate where the pattern can 'attach' in your\n   * graph. This function takes the final call node of the pattern and the call node currently\n   * being traversed in the Relay graph. It traverses through the pattern in lockstep with call node\n   * from the graph (referred to as the 'root' node here) to check they're identical. If at any\n   * point they differ, an empty expression is returned to signify the extract failed. If a free var\n   * is reached in the pattern, the corresponding value in the root is associated with the name of\n   * the free var (via the var_map) so that when we construct the composite function, the inputs\n   * match up correctly with the rest of the graph. The return value of this function when\n   * successful is a new Relay expression ready to be wrapped into a composite function.\n   *\/\n  Expr ExtractPattern(const Call& pattern, const Call& root, Map<std::string, Array<Expr>>* var_map,\n                      Map<Expr, Expr>* call_map) {\n    \/\/ check to make sure both calls are to operators (not functions)\n    if (!root.defined()) return Expr();\n    if (!pattern->op->IsInstance<OpNode>() || !root->op->IsInstance<OpNode>()) return Expr();\n    if (pattern->op.as<OpNode>()->name != root->op.as<OpNode>()->name) return Expr();\n\n    unsigned int i = 0;\n    Array<Expr> new_args;\n    for (const auto& arg : pattern->args) {\n      Expr new_arg;\n      if (arg->IsInstance<CallNode>() && root->args[i]->IsInstance<CallNode>()) {\n        new_arg =\n            ExtractPattern(Downcast<Call>(arg), Downcast<Call>(root->args[i]), var_map, call_map);\n        \/\/ if we've already processed this call node, return the previous result\n        if (call_map->find(arg) != call_map->end() && new_arg.defined()) {\n          new_arg = (*call_map)[arg];\n        } else {\n          call_map->Set(arg, new_arg);\n        }\n      } else if (arg->IsInstance<VarNode>()) {\n        \/\/ if there's a var in the pattern, it must be a free var\n        \/\/ so call the function to update the var_map\n        new_arg = ExtractPattern(Downcast<Var>(arg), root->args[i], var_map);\n      } else if (arg->IsInstance<ConstantNode>()) {\n        \/\/ if there's a constant, simply get the corresponding\n        \/\/ value of the constant from the root\n        new_arg = ExtractPattern(Downcast<Constant>(arg), root->args[i], var_map);\n      } else if (arg->IsInstance<TupleGetItemNode>()) {\n        new_arg = ExtractPattern(Downcast<TupleGetItem>(arg), root->args[i], var_map, call_map);\n      }\n      if (!new_arg.defined()) {\n        return Expr();\n      }\n      new_args.push_back(new_arg);\n      i++;\n    }\n    return Call(root->op, new_args, root->attrs);\n  }\n\n  Expr VisitExpr_(const CallNode* cn) {\n    Call call = GetRef<Call>(cn);\n    if (call->op->IsInstance<FunctionNode>()) {\n      Function func = Downcast<Function>(call->op);\n      CHECK(func.defined());\n      auto name_node = func->GetAttr<String>(attr::kComposite);\n      \/\/ don't step into existing composite functions\n      if (name_node.defined() && name_node != \"\") {\n        tvm::Array<tvm::relay::Expr> new_args;\n        for (const auto& arg : call->args) {\n          auto new_e = this->Mutate(arg);\n          new_args.push_back(new_e);\n        }\n        return Call(call->op, new_args, call->attrs);\n      }\n    }\n\n    Expr expr = ExprMutator::VisitExpr_(cn);\n    call = Downcast<Call>(expr);\n    if (!call->op->IsInstance<OpNode>()) return std::move(call);\n\n    \/\/ only call patterns are supported\n    Call pattern = Downcast<Call>(pattern_);\n    CHECK(pattern.defined());\n    Map<std::string, Array<Expr>> args_map;\n    Map<Expr, Expr> call_map;\n    auto extract = ExtractPattern(pattern, call, &args_map, &call_map);\n    if (extract.defined() && static_cast<bool>(check_(extract))) {\n      auto free_vars = FreeVars(extract);\n      \/\/ make the composite function\n      auto f = Function(free_vars, extract, call->checked_type_, {}, DictAttrs());\n      f = WithAttr(std::move(f), attr::kComposite, runtime::String(pattern_name_));\n      \/\/ find the expressions associated with the free vars using the args_map\n      \/\/ this tells us which expressions should be given as inputs to the composite function\n      Array<Expr> args;\n      for (const auto& free_var : free_vars) {\n        args.push_back(args_map[free_var->name_hint()][1]);\n      }\n      auto new_call = Call(f, args);\n      return std::move(new_call);\n    }\n    return std::move(call);\n  }\n\n private:\n  \/*! \\brief The name of the pattern to match *\/\n  std::string pattern_name_;\n  \/*! \\brief The pattern to match *\/\n  Expr pattern_;\n  \/*! \\brief The function to check whether an extract is supported *\/\n  PackedFunc check_;\n};\n\nExpr MergeComposite(const Expr& expr, const Array<runtime::String>& pattern_names,\n                    const Array<Expr>& patterns, const std::vector<PackedFunc>& checks) {\n  CHECK_EQ(pattern_names.size(), patterns.size());\n  Expr merged_expr = expr;\n  \/\/ merge the patterns one-by-one in order\n  for (size_t i = 0; i < patterns.size(); i++) {\n    merged_expr =\n        MergeCompositeWrapper(pattern_names[i], patterns[i], checks[i]).Mutate(merged_expr);\n  }\n  return merged_expr;\n}\n\n}  \/\/ namespace merge_composite\n\nnamespace transform {\n\nPass MergeComposite(const tvm::Array<runtime::String>& pattern_names,\n                    const tvm::Array<Expr>& patterns, const std::vector<PackedFunc>& checks) {\n  runtime::TypedPackedFunc<Function(Function, IRModule, PassContext)> pass_func =\n      [=](Function f, IRModule m, PassContext pc) {\n        return Downcast<Function>(\n            relay::merge_composite::MergeComposite(f, pattern_names, patterns, checks));\n      };\n  auto func_pass = CreateFunctionPass(pass_func, 0, \"MergeComposite\", {});\n  return func_pass;\n}\n\nTVM_REGISTER_GLOBAL(\"relay._transform.MergeComposite\").set_body([](TVMArgs args, TVMRetValue* rv) {\n  tvm::Array<runtime::String> pattern_names = args[0];\n  tvm::Array<Expr> patterns = args[1];\n  std::vector<PackedFunc> checks;\n  for (int i = 2; i < args.size(); i++) {\n    checks.push_back(args[i]);\n  }\n  *rv = MergeComposite(pattern_names, patterns, checks);\n});\n\n}  \/\/ namespace transform\n\n}  \/\/ namespace relay\n}  \/\/ namespace tvm\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>INTEGRATION: CWS dba24a (1.54.6); FILE MERGED 2007\/08\/30 10:44:41 oj 1.54.6.1: #i78257# wrong assertion<commit_after><|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#ifndef _EXECUTORCONTEXT_HPP_\n#define _EXECUTORCONTEXT_HPP_\n\n#include \"Topend.h\"\n#include \"common\/UndoQuantum.h\"\n\nnamespace voltdb {\n\n\/*\n * EE site global data required by executors at runtime.\n *\n * This data is factored into common to avoid creating dependencies on\n * execution\/VoltDBEngine throughout the storage and executor code.\n * This facilitates easier test case writing and breaks circular\n * dependencies between ee component directories.\n *\n * A better implementation that meets these goals is always welcome if\n * you see a preferable refactoring.\n *\/\nclass ExecutorContext {\n  public:\n    ~ExecutorContext();\n\n    ExecutorContext(int64_t siteId,\n                    CatalogId partitionId,\n                    UndoQuantum *undoQuantum,\n                    Topend* topend,\n                    Pool* tempStringPool,\n                    bool exportEnabled,\n                    std::string hostname,\n                    CatalogId hostId);\n\n    \/\/ It is the thread-hopping VoltDBEngine's responsibility to re-establish the EC for each new thread it runs on.\n    void bindToThread();\n\n    \/\/ not always known at initial construction\n    void setPartitionId(CatalogId partitionId) {\n        m_partitionId = partitionId;\n    }\n\n    \/\/ not always known at initial construction\n    void setEpoch(int64_t epoch) {\n        m_epoch = epoch;\n    }\n\n    \/\/ helper to configure the context for a new jni call\n    void setupForPlanFragments(UndoQuantum *undoQuantum,\n                               int64_t spHandle,\n                               int64_t lastCommittedSpHandle,\n                               int64_t uniqueId)\n    {\n        m_undoQuantum = undoQuantum;\n        m_spHandle = spHandle;\n        m_lastCommittedSpHandle = lastCommittedSpHandle;\n        m_currentTxnTimestamp = (m_uniqueId >> 23) + m_epoch;\n        m_uniqueId = uniqueId;\n    }\n\n    \/\/ data available via tick()\n    void setupForTick(int64_t lastCommittedSpHandle)\n    {\n        m_lastCommittedSpHandle = lastCommittedSpHandle;\n    }\n\n    \/\/ data available via quiesce()\n    void setupForQuiesce(int64_t lastCommittedSpHandle) {\n        m_lastCommittedSpHandle = lastCommittedSpHandle;\n    }\n\n    \/\/ for test (VoltDBEngine::getExecutorContext())\n    void setupForPlanFragments(UndoQuantum *undoQuantum) {\n        m_undoQuantum = undoQuantum;\n    }\n\n    UndoQuantum *getCurrentUndoQuantum() {\n        return m_undoQuantum;\n    }\n\n    static UndoQuantum *currentUndoQuantum() {\n        return getExecutorContext()->m_undoQuantum;\n    }\n\n    Topend* getTopend() {\n        return m_topEnd;\n    }\n    \n    \/** Current or most recently sp handle *\/\n    int64_t currentSpHandle() {\n        return m_spHandle;\n    }\n\n    \/** Timestamp from unique id for this transaction *\/\n    int64_t currentUniqueId() {\n        return m_uniqueId;\n    }\n    \n    \/** Timestamp from unique id for this transaction *\/\n    int64_t currentTxnTimestamp() {\n        return m_currentTxnTimestamp;\n    }\n\n    \/** Last committed transaction known to this EE *\/\n    int64_t lastCommittedSpHandle() {\n        return m_lastCommittedSpHandle;\n    }\n\n    static ExecutorContext* getExecutorContext();\n\n    static Pool* getTempStringPool() {\n        ExecutorContext* singleton = getExecutorContext();\n        assert(singleton != NULL);\n        assert(singleton->m_tempStringPool != NULL);\n        return singleton->m_tempStringPool;\n    }\n\n  private:\n    Topend *m_topEnd;\n    Pool *m_tempStringPool;\n    UndoQuantum *m_undoQuantum;\n    int64_t m_spHandle;\n    int64_t m_uniqueId;\n    int64_t m_currentTxnTimestamp;\n  public:\n    int64_t m_lastCommittedSpHandle;\n    int64_t m_siteId;\n    CatalogId m_partitionId;\n    std::string m_hostname;\n    CatalogId m_hostId;\n    bool m_exportEnabled;\n\n    \/** local epoch for voltdb, somtime around 2008, pulled from catalog *\/\n    int64_t m_epoch;\n};\n\n}\n\n#endif\n<commit_msg>Fix whitespace<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#ifndef _EXECUTORCONTEXT_HPP_\n#define _EXECUTORCONTEXT_HPP_\n\n#include \"Topend.h\"\n#include \"common\/UndoQuantum.h\"\n\nnamespace voltdb {\n\n\/*\n * EE site global data required by executors at runtime.\n *\n * This data is factored into common to avoid creating dependencies on\n * execution\/VoltDBEngine throughout the storage and executor code.\n * This facilitates easier test case writing and breaks circular\n * dependencies between ee component directories.\n *\n * A better implementation that meets these goals is always welcome if\n * you see a preferable refactoring.\n *\/\nclass ExecutorContext {\n  public:\n    ~ExecutorContext();\n\n    ExecutorContext(int64_t siteId,\n                    CatalogId partitionId,\n                    UndoQuantum *undoQuantum,\n                    Topend* topend,\n                    Pool* tempStringPool,\n                    bool exportEnabled,\n                    std::string hostname,\n                    CatalogId hostId);\n\n    \/\/ It is the thread-hopping VoltDBEngine's responsibility to re-establish the EC for each new thread it runs on.\n    void bindToThread();\n\n    \/\/ not always known at initial construction\n    void setPartitionId(CatalogId partitionId) {\n        m_partitionId = partitionId;\n    }\n\n    \/\/ not always known at initial construction\n    void setEpoch(int64_t epoch) {\n        m_epoch = epoch;\n    }\n\n    \/\/ helper to configure the context for a new jni call\n    void setupForPlanFragments(UndoQuantum *undoQuantum,\n                               int64_t spHandle,\n                               int64_t lastCommittedSpHandle,\n                               int64_t uniqueId)\n    {\n        m_undoQuantum = undoQuantum;\n        m_spHandle = spHandle;\n        m_lastCommittedSpHandle = lastCommittedSpHandle;\n        m_currentTxnTimestamp = (m_uniqueId >> 23) + m_epoch;\n        m_uniqueId = uniqueId;\n    }\n\n    \/\/ data available via tick()\n    void setupForTick(int64_t lastCommittedSpHandle)\n    {\n        m_lastCommittedSpHandle = lastCommittedSpHandle;\n    }\n\n    \/\/ data available via quiesce()\n    void setupForQuiesce(int64_t lastCommittedSpHandle) {\n        m_lastCommittedSpHandle = lastCommittedSpHandle;\n    }\n\n    \/\/ for test (VoltDBEngine::getExecutorContext())\n    void setupForPlanFragments(UndoQuantum *undoQuantum) {\n        m_undoQuantum = undoQuantum;\n    }\n\n    UndoQuantum *getCurrentUndoQuantum() {\n        return m_undoQuantum;\n    }\n\n    static UndoQuantum *currentUndoQuantum() {\n        return getExecutorContext()->m_undoQuantum;\n    }\n\n    Topend* getTopend() {\n        return m_topEnd;\n    }\n\n    \/** Current or most recently sp handle *\/\n    int64_t currentSpHandle() {\n        return m_spHandle;\n    }\n\n    \/** Timestamp from unique id for this transaction *\/\n    int64_t currentUniqueId() {\n        return m_uniqueId;\n    }\n\n    \/** Timestamp from unique id for this transaction *\/\n    int64_t currentTxnTimestamp() {\n        return m_currentTxnTimestamp;\n    }\n\n    \/** Last committed transaction known to this EE *\/\n    int64_t lastCommittedSpHandle() {\n        return m_lastCommittedSpHandle;\n    }\n\n    static ExecutorContext* getExecutorContext();\n\n    static Pool* getTempStringPool() {\n        ExecutorContext* singleton = getExecutorContext();\n        assert(singleton != NULL);\n        assert(singleton->m_tempStringPool != NULL);\n        return singleton->m_tempStringPool;\n    }\n\n  private:\n    Topend *m_topEnd;\n    Pool *m_tempStringPool;\n    UndoQuantum *m_undoQuantum;\n    int64_t m_spHandle;\n    int64_t m_uniqueId;\n    int64_t m_currentTxnTimestamp;\n  public:\n    int64_t m_lastCommittedSpHandle;\n    int64_t m_siteId;\n    CatalogId m_partitionId;\n    std::string m_hostname;\n    CatalogId m_hostId;\n    bool m_exportEnabled;\n\n    \/** local epoch for voltdb, somtime around 2008, pulled from catalog *\/\n    int64_t m_epoch;\n};\n\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"hierarchy.h\"\n#include \"engine\/blob.h\"\n#include \"engine\/crc32.h\"\n#include \"engine\/hash_map.h\"\n#include \"engine\/json_serializer.h\"\n#include \"engine\/engine.h\"\n#include \"engine\/property_register.h\"\n#include \"universe.h\"\n\n\nnamespace Lumix\n{\n\n\nstatic const ComponentType HIERARCHY_TYPE_HANDLE = PropertyRegister::getComponentType(\"hierarchy\");\n\n\nclass HierarchyImpl : public Hierarchy\n{\nprivate:\n\ttypedef HashMap<Entity, Entity> Parents;\n\npublic:\n\tHierarchyImpl(IPlugin& system, Universe& universe, IAllocator& allocator)\n\t\t: m_universe(universe)\n\t\t, m_parents(allocator)\n\t\t, m_children(allocator)\n\t\t, m_allocator(allocator)\n\t\t, m_system(system)\n\t{\n\t\tm_is_processing = false;\n\t\tuniverse.entityDestroyed().bind<HierarchyImpl, &HierarchyImpl::onEntityDestroyed>(this);\n\t\tuniverse.entityTransformed().bind<HierarchyImpl, &HierarchyImpl::onEntityMoved>(this);\n\t}\n\n\n\t~HierarchyImpl()\n\t{\n\t\tauto iter = m_children.begin(), end = m_children.end();\n\t\twhile (iter != end)\n\t\t{\n\t\t\tLUMIX_DELETE(m_allocator, iter.value());\n\t\t\t++iter;\n\t\t}\n\t}\n\n\n\tComponentIndex createComponent(ComponentType type, Entity entity) override \n\t{\n\t\tif (HIERARCHY_TYPE_HANDLE == type)\n\t\t{\n\t\t\tm_parents.insert(entity, INVALID_ENTITY);\n\t\t\tm_universe.addComponent(entity, type, this, entity.index);\n\t\t\treturn entity.index;\n\t\t}\n\t\treturn INVALID_COMPONENT;\n\t}\n\n\n\tvoid destroyComponent(ComponentIndex component, ComponentType type) override \n\t{\n\t\tif (HIERARCHY_TYPE_HANDLE == type)\n\t\t{\n\t\t\tauto parent_iter = m_parents.find({component});\n\n\t\t\tif (parent_iter.isValid())\n\t\t\t{\n\t\t\t\tauto iter = m_children.find({parent_iter.value()});\n\t\t\t\tif (iter != m_children.end())\n\t\t\t\t{\n\t\t\t\t\tLUMIX_DELETE(m_allocator, iter.value());\n\t\t\t\t\tm_children.erase(iter);\n\t\t\t\t}\n\t\t\t\tm_parents.erase(parent_iter);\n\t\t\t}\n\t\t\t\n\t\t\tm_universe.destroyComponent({component}, type, this, component);\n\t\t}\n\t}\n\n\n\tIPlugin& getPlugin() const override { return m_system; }\n\tvoid update(float time_delta, bool paused) override {}\n\tbool ownComponentType(ComponentType type) const override { return HIERARCHY_TYPE_HANDLE == type; }\n\tUniverse& getUniverse() override { return m_universe; }\n\tIAllocator& getAllocator() { return m_allocator; }\n\n\n\tComponentIndex getComponent(Entity entity, ComponentType type) override\n\t{\n\t\tASSERT(ownComponentType(type));\n\t\treturn m_parents.find(entity) != m_parents.end() ? entity.index : INVALID_COMPONENT;\n\t}\n\n\n\tvoid onEntityDestroyed(Entity entity)\n\t{\n\t\tauto iter = m_children.find(entity);\n\t\tif (iter != m_children.end())\n\t\t{\n\t\t\tfor (auto& x : *iter.value())\n\t\t\t{\n\t\t\t\tm_parents.erase(x.m_entity);\n\t\t\t}\n\t\t\tLUMIX_DELETE(m_allocator, iter.value());\n\t\t\tm_children.erase(iter);\n\t\t}\n\t}\n\n\n\tvoid onEntityMoved(Entity entity)\n\t{\n\t\tbool was_processing = m_is_processing;\n\t\tm_is_processing = true;\n\t\tChildren::iterator iter = m_children.find(entity);\n\t\tif (iter.isValid())\n\t\t{\n\t\t\tMatrix parent_matrix = m_universe.getPositionAndRotation(entity);\n\t\t\tArray<Child>& children = *iter.value();\n\t\t\tfor (int i = 0, c = children.size(); i < c; ++i)\n\t\t\t{\n\t\t\t\tm_universe.setMatrix(\n\t\t\t\t\tchildren[i].m_entity, parent_matrix * children[i].m_local_matrix);\n\t\t\t}\n\t\t}\n\t\tm_is_processing = was_processing;\n\n\t\tif (m_is_processing) return;\n\n\t\tParents::iterator parent_iter = m_parents.find(entity);\n\t\tif (parent_iter.isValid())\n\t\t{\n\t\t\tEntity parent(parent_iter.value());\n\t\t\tChildren::iterator child_iter = m_children.find(parent);\n\t\t\tif (child_iter.isValid())\n\t\t\t{\n\t\t\t\tArray<Child>& children = *child_iter.value();\n\t\t\t\tfor (int i = 0, c = children.size(); i < c; ++i)\n\t\t\t\t{\n\t\t\t\t\tif (children[i].m_entity == entity)\n\t\t\t\t\t{\n\t\t\t\t\t\tMatrix inv_parent_matrix = m_universe.getPositionAndRotation(parent);\n\t\t\t\t\t\tinv_parent_matrix.inverse();\n\t\t\t\t\t\tchildren[i].m_local_matrix =\n\t\t\t\t\t\t\tinv_parent_matrix * m_universe.getPositionAndRotation(entity);\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\n\tvoid setLocalPosition(ComponentIndex cmp, const Vec3& position) override\n\t{\n\t\tEntity entity = {cmp};\n\t\tParents::iterator parent_iter = m_parents.find(entity);\n\n\t\tif (parent_iter.isValid())\n\t\t{\n\t\t\tQuat parent_rot = m_universe.getRotation(parent_iter.value());\n\t\t\tVec3 parent_pos = m_universe.getPosition(parent_iter.value());\n\t\t\tm_universe.setPosition(entity, parent_pos + parent_rot * position);\n\t\t\treturn;\n\t\t}\n\n\t\tm_universe.setPosition(entity, position);\n\t}\n\n\n\tVec3 getLocalPosition(ComponentIndex cmp) override\n\t{\n\t\tEntity entity = {cmp};\n\t\tParents::iterator parent_iter = m_parents.find(entity);\n\n\t\tif (parent_iter.isValid() && isValid(parent_iter.value()))\n\t\t{\n\t\t\tauto child_iter = m_children.find(parent_iter.value());\n\t\t\tASSERT(child_iter.isValid());\n\n\t\t\tfor (auto& child : *child_iter.value())\n\t\t\t{\n\t\t\t\tif (child.m_entity == entity)\n\t\t\t\t{\n\t\t\t\t\treturn child.m_local_matrix.getTranslation();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn m_universe.getPosition(entity);\n\t}\n\n\n\tvoid setLocalRotation(Entity entity, const Quat& rotation) override\n\t{\n\t\tParents::iterator parent_iter = m_parents.find(entity);\n\n\t\tif (parent_iter.isValid())\n\t\t{\n\t\t\tQuat parent_rot = m_universe.getRotation(parent_iter.value());\n\t\t\tm_universe.setRotation(entity, rotation * parent_rot);\n\t\t\treturn;\n\t\t}\n\n\t\tm_universe.setRotation(entity, rotation);\n\t}\n\n\n\tQuat getLocalRotation(ComponentIndex cmp) override\n\t{\n\t\tEntity entity = {cmp};\n\t\tParents::iterator parent_iter = m_parents.find(entity);\n\n\t\tif (parent_iter.isValid())\n\t\t{\n\t\t\tauto child_iter = m_children.find(parent_iter.value());\n\t\t\tASSERT(child_iter.isValid());\n\n\t\t\tfor (auto& child : *child_iter.value())\n\t\t\t{\n\t\t\t\tif (child.m_entity == entity)\n\t\t\t\t{\n\t\t\t\t\tQuat rot;\n\t\t\t\t\tchild.m_local_matrix.getRotation(rot);\n\t\t\t\t\treturn rot;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn m_universe.getRotation(entity);\n\t}\n\n\tconst Children& getAllChildren() const override { return m_children; }\n\n\n\tvoid setParent(ComponentIndex child, Entity parent) override\n\t{\n\t\tEntity child_entity = {child};\n\t\tParents::iterator old_parent_iter = m_parents.find(child_entity);\n\t\tif (old_parent_iter.isValid())\n\t\t{\n\t\t\tif (isValid(old_parent_iter.value()))\n\t\t\t{\n\t\t\t\tChildren::iterator child_iter = m_children.find(old_parent_iter.value());\n\t\t\t\tASSERT(child_iter.isValid());\n\t\t\t\tArray<Child>& children = *child_iter.value();\n\t\t\t\tfor (int i = 0; i < children.size(); ++i)\n\t\t\t\t{\n\t\t\t\t\tif (children[i].m_entity == child_entity)\n\t\t\t\t\t{\n\t\t\t\t\t\tchildren.erase(i);\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\tm_parents.erase(old_parent_iter);\n\t\t}\n\n\t\tif (isValid(parent))\n\t\t{\n\t\t\tm_parents.insert(child_entity, parent);\n\n\t\t\tChildren::iterator child_iter = m_children.find(parent);\n\t\t\tif (!child_iter.isValid())\n\t\t\t{\n\t\t\t\tm_children.insert(parent, LUMIX_NEW(m_allocator, Array<Child>)(m_allocator));\n\t\t\t\tchild_iter = m_children.find(parent);\n\t\t\t}\n\t\t\tChild& c = child_iter.value()->emplace();\n\t\t\tc.m_entity = child_entity;\n\t\t\tMatrix inv_parent_matrix = m_universe.getPositionAndRotation(parent);\n\t\t\tinv_parent_matrix.inverse();\n\t\t\tc.m_local_matrix = inv_parent_matrix * m_universe.getPositionAndRotation(child_entity);\n\t\t}\n\t}\n\n\n\tEntity getParent(ComponentIndex child) override\n\t{\n\t\tEntity child_entity = {child};\n\t\tParents::iterator parent_iter = m_parents.find(child_entity);\n\t\tif (parent_iter.isValid())\n\t\t{\n\t\t\treturn Entity(parent_iter.value());\n\t\t}\n\t\treturn INVALID_ENTITY;\n\t}\n\n\n\tvoid serialize(OutputBlob& serializer) override\n\t{\n\t\tint size = m_parents.size();\n\t\tserializer.write((int32)size);\n\t\tParents::iterator iter = m_parents.begin(), end = m_parents.end();\n\t\twhile (iter != end)\n\t\t{\n\t\t\tserializer.write(iter.key());\n\t\t\tserializer.write(iter.value());\n\t\t\t++iter;\n\t\t}\n\t}\n\n\n\tvoid deserialize(InputBlob& serializer, int \/*version*\/) override\n\t{\n\t\tint32 size;\n\t\tserializer.read(size);\n\t\tfor (int i = 0; i < size; ++i)\n\t\t{\n\t\t\tint32 child, parent;\n\t\t\tserializer.read(child);\n\t\t\tserializer.read(parent);\n\t\t\tsetParent({child}, {parent});\n\t\t\tm_universe.addComponent({child}, HIERARCHY_TYPE_HANDLE, this, child);\n\t\t}\n\t}\n\n\n\tArray<Child>* getChildren(Entity parent) override\n\t{\n\t\tChildren::iterator iter = m_children.find(parent);\n\t\tif (iter.isValid())\n\t\t{\n\t\t\treturn iter.value();\n\t\t}\n\t\treturn nullptr;\n\t}\n\n\nprivate:\n\tIAllocator& m_allocator;\n\tUniverse& m_universe;\n\tParents m_parents;\n\tChildren m_children;\n\tIPlugin& m_system;\n\tbool m_is_processing;\n};\n\n\nIScene* HierarchyPlugin::createScene(Universe& ctx)\n{\n\treturn Hierarchy::create(*this, ctx, m_allocator);\n}\n\n\nvoid HierarchyPlugin::destroyScene(IScene* scene)\n{\n\tHierarchy::destroy(static_cast<Hierarchy*>(scene));\n}\n\n\nHierarchy* Hierarchy::create(IPlugin& system, Universe& universe, IAllocator& allocator)\n{\n\treturn LUMIX_NEW(allocator, HierarchyImpl)(system, universe, allocator);\n}\n\n\nvoid Hierarchy::destroy(Hierarchy* hierarchy)\n{\n\tLUMIX_DELETE(static_cast<HierarchyImpl*>(hierarchy)->getAllocator(), hierarchy);\n}\n\n\n} \/\/ namespace Lumix\n<commit_msg>fixed linux build<commit_after>#include \"hierarchy.h\"\n#include \"engine\/blob.h\"\n#include \"engine\/crc32.h\"\n#include \"engine\/hash_map.h\"\n#include \"engine\/json_serializer.h\"\n#include \"engine\/engine.h\"\n#include \"engine\/property_register.h\"\n#include \"universe.h\"\n\n\nnamespace Lumix\n{\n\n\nstatic const ComponentType HIERARCHY_TYPE_HANDLE = PropertyRegister::getComponentType(\"hierarchy\");\n\n\nclass HierarchyImpl : public Hierarchy\n{\nprivate:\n\ttypedef HashMap<Entity, Entity> Parents;\n\npublic:\n\tHierarchyImpl(IPlugin& system, Universe& universe, IAllocator& allocator)\n\t\t: m_universe(universe)\n\t\t, m_parents(allocator)\n\t\t, m_children(allocator)\n\t\t, m_allocator(allocator)\n\t\t, m_system(system)\n\t{\n\t\tm_is_processing = false;\n\t\tuniverse.entityDestroyed().bind<HierarchyImpl, &HierarchyImpl::onEntityDestroyed>(this);\n\t\tuniverse.entityTransformed().bind<HierarchyImpl, &HierarchyImpl::onEntityMoved>(this);\n\t}\n\n\n\t~HierarchyImpl()\n\t{\n\t\tauto iter = m_children.begin(), end = m_children.end();\n\t\twhile (iter != end)\n\t\t{\n\t\t\tLUMIX_DELETE(m_allocator, iter.value());\n\t\t\t++iter;\n\t\t}\n\t}\n\n\n\tComponentIndex createComponent(ComponentType type, Entity entity) override \n\t{\n\t\tif (HIERARCHY_TYPE_HANDLE == type)\n\t\t{\n\t\t\tm_parents.insert(entity, INVALID_ENTITY);\n\t\t\tm_universe.addComponent(entity, type, this, entity.index);\n\t\t\treturn entity.index;\n\t\t}\n\t\treturn INVALID_COMPONENT;\n\t}\n\n\n\tvoid destroyComponent(ComponentIndex component, ComponentType type) override \n\t{\n\t\tif (HIERARCHY_TYPE_HANDLE == type)\n\t\t{\n\t\t\tauto parent_iter = m_parents.find({component});\n\n\t\t\tif (parent_iter.isValid())\n\t\t\t{\n\t\t\t\tauto iter = m_children.find(parent_iter.value());\n\t\t\t\tif (iter != m_children.end())\n\t\t\t\t{\n\t\t\t\t\tLUMIX_DELETE(m_allocator, iter.value());\n\t\t\t\t\tm_children.erase(iter);\n\t\t\t\t}\n\t\t\t\tm_parents.erase(parent_iter);\n\t\t\t}\n\t\t\t\n\t\t\tm_universe.destroyComponent({component}, type, this, component);\n\t\t}\n\t}\n\n\n\tIPlugin& getPlugin() const override { return m_system; }\n\tvoid update(float time_delta, bool paused) override {}\n\tbool ownComponentType(ComponentType type) const override { return HIERARCHY_TYPE_HANDLE == type; }\n\tUniverse& getUniverse() override { return m_universe; }\n\tIAllocator& getAllocator() { return m_allocator; }\n\n\n\tComponentIndex getComponent(Entity entity, ComponentType type) override\n\t{\n\t\tASSERT(ownComponentType(type));\n\t\treturn m_parents.find(entity) != m_parents.end() ? entity.index : INVALID_COMPONENT;\n\t}\n\n\n\tvoid onEntityDestroyed(Entity entity)\n\t{\n\t\tauto iter = m_children.find(entity);\n\t\tif (iter != m_children.end())\n\t\t{\n\t\t\tfor (auto& x : *iter.value())\n\t\t\t{\n\t\t\t\tm_parents.erase(x.m_entity);\n\t\t\t}\n\t\t\tLUMIX_DELETE(m_allocator, iter.value());\n\t\t\tm_children.erase(iter);\n\t\t}\n\t}\n\n\n\tvoid onEntityMoved(Entity entity)\n\t{\n\t\tbool was_processing = m_is_processing;\n\t\tm_is_processing = true;\n\t\tChildren::iterator iter = m_children.find(entity);\n\t\tif (iter.isValid())\n\t\t{\n\t\t\tMatrix parent_matrix = m_universe.getPositionAndRotation(entity);\n\t\t\tArray<Child>& children = *iter.value();\n\t\t\tfor (int i = 0, c = children.size(); i < c; ++i)\n\t\t\t{\n\t\t\t\tm_universe.setMatrix(\n\t\t\t\t\tchildren[i].m_entity, parent_matrix * children[i].m_local_matrix);\n\t\t\t}\n\t\t}\n\t\tm_is_processing = was_processing;\n\n\t\tif (m_is_processing) return;\n\n\t\tParents::iterator parent_iter = m_parents.find(entity);\n\t\tif (parent_iter.isValid())\n\t\t{\n\t\t\tEntity parent(parent_iter.value());\n\t\t\tChildren::iterator child_iter = m_children.find(parent);\n\t\t\tif (child_iter.isValid())\n\t\t\t{\n\t\t\t\tArray<Child>& children = *child_iter.value();\n\t\t\t\tfor (int i = 0, c = children.size(); i < c; ++i)\n\t\t\t\t{\n\t\t\t\t\tif (children[i].m_entity == entity)\n\t\t\t\t\t{\n\t\t\t\t\t\tMatrix inv_parent_matrix = m_universe.getPositionAndRotation(parent);\n\t\t\t\t\t\tinv_parent_matrix.inverse();\n\t\t\t\t\t\tchildren[i].m_local_matrix =\n\t\t\t\t\t\t\tinv_parent_matrix * m_universe.getPositionAndRotation(entity);\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\n\tvoid setLocalPosition(ComponentIndex cmp, const Vec3& position) override\n\t{\n\t\tEntity entity = {cmp};\n\t\tParents::iterator parent_iter = m_parents.find(entity);\n\n\t\tif (parent_iter.isValid())\n\t\t{\n\t\t\tQuat parent_rot = m_universe.getRotation(parent_iter.value());\n\t\t\tVec3 parent_pos = m_universe.getPosition(parent_iter.value());\n\t\t\tm_universe.setPosition(entity, parent_pos + parent_rot * position);\n\t\t\treturn;\n\t\t}\n\n\t\tm_universe.setPosition(entity, position);\n\t}\n\n\n\tVec3 getLocalPosition(ComponentIndex cmp) override\n\t{\n\t\tEntity entity = {cmp};\n\t\tParents::iterator parent_iter = m_parents.find(entity);\n\n\t\tif (parent_iter.isValid() && isValid(parent_iter.value()))\n\t\t{\n\t\t\tauto child_iter = m_children.find(parent_iter.value());\n\t\t\tASSERT(child_iter.isValid());\n\n\t\t\tfor (auto& child : *child_iter.value())\n\t\t\t{\n\t\t\t\tif (child.m_entity == entity)\n\t\t\t\t{\n\t\t\t\t\treturn child.m_local_matrix.getTranslation();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn m_universe.getPosition(entity);\n\t}\n\n\n\tvoid setLocalRotation(Entity entity, const Quat& rotation) override\n\t{\n\t\tParents::iterator parent_iter = m_parents.find(entity);\n\n\t\tif (parent_iter.isValid())\n\t\t{\n\t\t\tQuat parent_rot = m_universe.getRotation(parent_iter.value());\n\t\t\tm_universe.setRotation(entity, rotation * parent_rot);\n\t\t\treturn;\n\t\t}\n\n\t\tm_universe.setRotation(entity, rotation);\n\t}\n\n\n\tQuat getLocalRotation(ComponentIndex cmp) override\n\t{\n\t\tEntity entity = {cmp};\n\t\tParents::iterator parent_iter = m_parents.find(entity);\n\n\t\tif (parent_iter.isValid())\n\t\t{\n\t\t\tauto child_iter = m_children.find(parent_iter.value());\n\t\t\tASSERT(child_iter.isValid());\n\n\t\t\tfor (auto& child : *child_iter.value())\n\t\t\t{\n\t\t\t\tif (child.m_entity == entity)\n\t\t\t\t{\n\t\t\t\t\tQuat rot;\n\t\t\t\t\tchild.m_local_matrix.getRotation(rot);\n\t\t\t\t\treturn rot;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn m_universe.getRotation(entity);\n\t}\n\n\tconst Children& getAllChildren() const override { return m_children; }\n\n\n\tvoid setParent(ComponentIndex child, Entity parent) override\n\t{\n\t\tEntity child_entity = {child};\n\t\tParents::iterator old_parent_iter = m_parents.find(child_entity);\n\t\tif (old_parent_iter.isValid())\n\t\t{\n\t\t\tif (isValid(old_parent_iter.value()))\n\t\t\t{\n\t\t\t\tChildren::iterator child_iter = m_children.find(old_parent_iter.value());\n\t\t\t\tASSERT(child_iter.isValid());\n\t\t\t\tArray<Child>& children = *child_iter.value();\n\t\t\t\tfor (int i = 0; i < children.size(); ++i)\n\t\t\t\t{\n\t\t\t\t\tif (children[i].m_entity == child_entity)\n\t\t\t\t\t{\n\t\t\t\t\t\tchildren.erase(i);\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\tm_parents.erase(old_parent_iter);\n\t\t}\n\n\t\tif (isValid(parent))\n\t\t{\n\t\t\tm_parents.insert(child_entity, parent);\n\n\t\t\tChildren::iterator child_iter = m_children.find(parent);\n\t\t\tif (!child_iter.isValid())\n\t\t\t{\n\t\t\t\tm_children.insert(parent, LUMIX_NEW(m_allocator, Array<Child>)(m_allocator));\n\t\t\t\tchild_iter = m_children.find(parent);\n\t\t\t}\n\t\t\tChild& c = child_iter.value()->emplace();\n\t\t\tc.m_entity = child_entity;\n\t\t\tMatrix inv_parent_matrix = m_universe.getPositionAndRotation(parent);\n\t\t\tinv_parent_matrix.inverse();\n\t\t\tc.m_local_matrix = inv_parent_matrix * m_universe.getPositionAndRotation(child_entity);\n\t\t}\n\t}\n\n\n\tEntity getParent(ComponentIndex child) override\n\t{\n\t\tEntity child_entity = {child};\n\t\tParents::iterator parent_iter = m_parents.find(child_entity);\n\t\tif (parent_iter.isValid())\n\t\t{\n\t\t\treturn Entity(parent_iter.value());\n\t\t}\n\t\treturn INVALID_ENTITY;\n\t}\n\n\n\tvoid serialize(OutputBlob& serializer) override\n\t{\n\t\tint size = m_parents.size();\n\t\tserializer.write((int32)size);\n\t\tParents::iterator iter = m_parents.begin(), end = m_parents.end();\n\t\twhile (iter != end)\n\t\t{\n\t\t\tserializer.write(iter.key());\n\t\t\tserializer.write(iter.value());\n\t\t\t++iter;\n\t\t}\n\t}\n\n\n\tvoid deserialize(InputBlob& serializer, int \/*version*\/) override\n\t{\n\t\tint32 size;\n\t\tserializer.read(size);\n\t\tfor (int i = 0; i < size; ++i)\n\t\t{\n\t\t\tint32 child, parent;\n\t\t\tserializer.read(child);\n\t\t\tserializer.read(parent);\n\t\t\tsetParent({child}, {parent});\n\t\t\tm_universe.addComponent({child}, HIERARCHY_TYPE_HANDLE, this, child);\n\t\t}\n\t}\n\n\n\tArray<Child>* getChildren(Entity parent) override\n\t{\n\t\tChildren::iterator iter = m_children.find(parent);\n\t\tif (iter.isValid())\n\t\t{\n\t\t\treturn iter.value();\n\t\t}\n\t\treturn nullptr;\n\t}\n\n\nprivate:\n\tIAllocator& m_allocator;\n\tUniverse& m_universe;\n\tParents m_parents;\n\tChildren m_children;\n\tIPlugin& m_system;\n\tbool m_is_processing;\n};\n\n\nIScene* HierarchyPlugin::createScene(Universe& ctx)\n{\n\treturn Hierarchy::create(*this, ctx, m_allocator);\n}\n\n\nvoid HierarchyPlugin::destroyScene(IScene* scene)\n{\n\tHierarchy::destroy(static_cast<Hierarchy*>(scene));\n}\n\n\nHierarchy* Hierarchy::create(IPlugin& system, Universe& universe, IAllocator& allocator)\n{\n\treturn LUMIX_NEW(allocator, HierarchyImpl)(system, universe, allocator);\n}\n\n\nvoid Hierarchy::destroy(Hierarchy* hierarchy)\n{\n\tLUMIX_DELETE(static_cast<HierarchyImpl*>(hierarchy)->getAllocator(), hierarchy);\n}\n\n\n} \/\/ namespace Lumix\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file serialportclient.cpp\n * @date 17.07.2015\n * @author Alexandre Poirot <alexandre.poirot@legrand.fr>\n * @brief serialportclient.cpp\n *\/\n\n#include <cstdlib>\n#include <iostream>\n#include <jsonrpccpp\/client.h>\n#include <jsonrpccpp\/client\/connectors\/linuxserialportclient.h>\n\nusing namespace jsonrpc;\nusing namespace std;\n\nint main(int argc, char **argv) {\n  string deviceName;\n\n  if (argc == 2) {\n    deviceName = string(argv[1]);\n  } else {\n    deviceName = \"tty0\";\n  }\n\n  cout << \"Params are :\" << endl;\n  cout << \"\\t deviceName: \" << deviceName << endl;\n\n  LinuxSerialPortClient client(deviceName);\n  Client c(client);\n\n  Json::Value params;\n  params[\"name\"] = \"Peter\";\n\n  try {\n    cout << c.CallMethod(\"sayHello\", params) << endl;\n  } catch (JsonRpcException &e) {\n    cerr << e.what() << endl;\n  }\n}\n<commit_msg>Updated author.<commit_after>\/**\n * @file serialportclient.cpp\n * @date 01.11.2019\n * @author Billy Araujo\n * @brief serialportclient.cpp\n *\/\n\n#include <cstdlib>\n#include <iostream>\n#include <jsonrpccpp\/client.h>\n#include <jsonrpccpp\/client\/connectors\/linuxserialportclient.h>\n\nusing namespace jsonrpc;\nusing namespace std;\n\nint main(int argc, char **argv) {\n  string deviceName;\n\n  if (argc == 2) {\n    deviceName = string(argv[1]);\n  } else {\n    deviceName = \"tty0\";\n  }\n\n  cout << \"Params are :\" << endl;\n  cout << \"\\t deviceName: \" << deviceName << endl;\n\n  LinuxSerialPortClient client(deviceName);\n  Client c(client);\n\n  Json::Value params;\n  params[\"name\"] = \"Peter\";\n\n  try {\n    cout << c.CallMethod(\"sayHello\", params) << endl;\n  } catch (JsonRpcException &e) {\n    cerr << e.what() << endl;\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Check max_travel_time validity in remove_from_routes.<commit_after><|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 \"api\/video_codecs\/builtin_video_encoder_factory.h\"\n\n#include <vector>\n\n#include \"absl\/memory\/memory.h\"\n#include \"absl\/strings\/match.h\"\n#include \"api\/video_codecs\/sdp_video_format.h\"\n#include \"api\/video_codecs\/video_encoder.h\"\n#include \"media\/base\/codec.h\"\n#include \"media\/base\/media_constants.h\"\n#include \"media\/engine\/encoder_simulcast_proxy.h\"\n#include \"media\/engine\/internal_encoder_factory.h\"\n#include \"rtc_base\/checks.h\"\n\nnamespace webrtc {\n\nnamespace {\n\nbool IsFormatSupported(const std::vector<SdpVideoFormat>& supported_formats,\n                       const SdpVideoFormat& format) {\n  for (const SdpVideoFormat& supported_format : supported_formats) {\n    if (cricket::IsSameCodec(format.name, format.parameters,\n                             supported_format.name,\n                             supported_format.parameters)) {\n      return true;\n    }\n  }\n  return false;\n}\n\n\/\/ This class wraps the internal factory and adds simulcast.\nclass BuiltinVideoEncoderFactory : public VideoEncoderFactory {\n public:\n  BuiltinVideoEncoderFactory()\n      : internal_encoder_factory_(new InternalEncoderFactory()) {}\n\n  VideoEncoderFactory::CodecInfo QueryVideoEncoder(\n      const SdpVideoFormat& format) const override {\n    \/\/ Format must be one of the internal formats.\n    RTC_DCHECK(IsFormatSupported(\n        internal_encoder_factory_->GetSupportedFormats(), format));\n    VideoEncoderFactory::CodecInfo info;\n    info.has_internal_source = false;\n    info.is_hardware_accelerated = false;\n    return info;\n  }\n\n  std::unique_ptr<VideoEncoder> CreateVideoEncoder(\n      const SdpVideoFormat& format) override {\n    \/\/ Try creating internal encoder.\n    std::unique_ptr<VideoEncoder> internal_encoder;\n    if (IsFormatSupported(internal_encoder_factory_->GetSupportedFormats(),\n                          format)) {\n      internal_encoder =\n          absl::EqualsIgnoreCase(format.name, cricket::kVp8CodecName)\n              ? absl::make_unique<EncoderSimulcastProxy>(\n                    internal_encoder_factory_.get(), format)\n              : internal_encoder_factory_->CreateVideoEncoder(format);\n    }\n\n    return internal_encoder;\n  }\n\n  std::vector<SdpVideoFormat> GetSupportedFormats() const override {\n    return internal_encoder_factory_->GetSupportedFormats();\n  }\n\n private:\n  const std::unique_ptr<VideoEncoderFactory> internal_encoder_factory_;\n};\n\n}  \/\/ namespace\n\nstd::unique_ptr<VideoEncoderFactory> CreateBuiltinVideoEncoderFactory() {\n  return absl::make_unique<BuiltinVideoEncoderFactory>();\n}\n\n}  \/\/ namespace webrtc\n<commit_msg>Use EncoderSimulcastProxy for all codecs<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 \"api\/video_codecs\/builtin_video_encoder_factory.h\"\n\n#include <vector>\n\n#include \"absl\/memory\/memory.h\"\n#include \"absl\/strings\/match.h\"\n#include \"api\/video_codecs\/sdp_video_format.h\"\n#include \"api\/video_codecs\/video_encoder.h\"\n#include \"media\/base\/codec.h\"\n#include \"media\/base\/media_constants.h\"\n#include \"media\/engine\/encoder_simulcast_proxy.h\"\n#include \"media\/engine\/internal_encoder_factory.h\"\n#include \"rtc_base\/checks.h\"\n\nnamespace webrtc {\n\nnamespace {\n\nbool IsFormatSupported(const std::vector<SdpVideoFormat>& supported_formats,\n                       const SdpVideoFormat& format) {\n  for (const SdpVideoFormat& supported_format : supported_formats) {\n    if (cricket::IsSameCodec(format.name, format.parameters,\n                             supported_format.name,\n                             supported_format.parameters)) {\n      return true;\n    }\n  }\n  return false;\n}\n\n\/\/ This class wraps the internal factory and adds simulcast.\nclass BuiltinVideoEncoderFactory : public VideoEncoderFactory {\n public:\n  BuiltinVideoEncoderFactory()\n      : internal_encoder_factory_(new InternalEncoderFactory()) {}\n\n  VideoEncoderFactory::CodecInfo QueryVideoEncoder(\n      const SdpVideoFormat& format) const override {\n    \/\/ Format must be one of the internal formats.\n    RTC_DCHECK(IsFormatSupported(\n        internal_encoder_factory_->GetSupportedFormats(), format));\n    VideoEncoderFactory::CodecInfo info;\n    info.has_internal_source = false;\n    info.is_hardware_accelerated = false;\n    return info;\n  }\n\n  std::unique_ptr<VideoEncoder> CreateVideoEncoder(\n      const SdpVideoFormat& format) override {\n    \/\/ Try creating internal encoder.\n    std::unique_ptr<VideoEncoder> internal_encoder;\n    if (IsFormatSupported(internal_encoder_factory_->GetSupportedFormats(),\n                          format)) {\n      internal_encoder = absl::make_unique<EncoderSimulcastProxy>(\n          internal_encoder_factory_.get(), format);\n    }\n\n    return internal_encoder;\n  }\n\n  std::vector<SdpVideoFormat> GetSupportedFormats() const override {\n    return internal_encoder_factory_->GetSupportedFormats();\n  }\n\n private:\n  const std::unique_ptr<VideoEncoderFactory> internal_encoder_factory_;\n};\n\n}  \/\/ namespace\n\nstd::unique_ptr<VideoEncoderFactory> CreateBuiltinVideoEncoderFactory() {\n  return absl::make_unique<BuiltinVideoEncoderFactory>();\n}\n\n}  \/\/ namespace webrtc\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\n * Project: RooFit                                                           *\n * Package: RooFitCore                                                       *\n *    File: $Id: RooDataProjBinding.cc,v 1.6 2002\/09\/05 04:33:22 verkerke Exp $\n * Authors:                                                                  *\n *   WV, Wouter Verkerke, UC Santa Barbara, verkerke@slac.stanford.edu       *\n *   DK, David Kirkby,    UC Irvine,         dkirkby@uci.edu                 *\n *                                                                           *\n * Copyright (c) 2000-2002, Regents of the University of California          *\n *                          and Stanford University. All rights reserved.    *\n *                                                                           *\n * Redistribution and use in source and binary forms,                        *\n * with or without modification, are permitted according to the terms        *\n * listed in LICENSE (http:\/\/roofit.sourceforge.net\/license.txt)             *\n *****************************************************************************\/\n\n\/\/ -- CLASS DESCRIPTION [AUX] --\n\/\/ Lightweight interface adaptor that projects a real function via summation\n\/\/ of states provided in a dataset. The real function must be attached to\n\/\/ the dataset before creating this binding object.\n\/\/\n\/\/ If the dataset only contains category variables, the summation is optimized\n\/\/ performing a weighted sum over the states of a RooSuperCategory that is\n\/\/ constructed from all the categories in the dataset\n\n#include \"RooFitCore\/RooDataProjBinding.hh\"\n#include \"RooFitCore\/RooAbsReal.hh\"\n#include \"RooFitCore\/RooAbsData.hh\"\n#include \"RooFitCore\/Roo1DTable.hh\"\n#include \"RooFitCore\/RooSuperCategory.hh\"\n#include \"RooFitCore\/RooCategory.hh\"\n#include \"RooFitCore\/RooAbsPdf.hh\"\n\n#include <assert.h>\n\nClassImp(RooDataProjBinding)\n;\n\n\nRooDataProjBinding::RooDataProjBinding(const RooAbsReal &real, const RooAbsData& data, \n\t\t\t\t       const RooArgSet &vars, const RooArgSet* nset) :\n  RooRealBinding(real,vars,0), _data(&data), _real(&real), _nset(nset), \n  _catTable(0), _superCat(0), _first(kTRUE)\n{  \n  \/\/ Constructor\n\n  \/\/ Determine if dataset contains only categories\n  TIterator* iter = data.get()->createIterator() ;\n  Bool_t allCat(kTRUE) ;\n  RooAbsArg* arg ;\n  while(arg=(RooAbsArg*)iter->Next()) {\n    if (!dynamic_cast<RooCategory*>(arg)) allCat = kFALSE ;\n  }\n  delete iter ;\n\n  \/\/ Determine weights of various super categories fractions\n  \/\/allCat = kFALSE ;\n  if (allCat) {\n     _superCat = new RooSuperCategory(\"superCat\",\"superCat\",*data.get()) ;\n     _catTable = data.table(*_superCat) ;\n  }\n}\n\n\n\nRooDataProjBinding::~RooDataProjBinding() \n{\n  \/\/ Destructor, delete owned objects\n  if (_superCat) delete _superCat ;\n  if (_catTable) delete _catTable ;\n}\n\n\n\nDouble_t RooDataProjBinding::operator()(const Double_t xvector[]) const \n{\n  \/\/ Evaluate data-projected values of boud real function.\n  assert(isValid());\n  loadValues(xvector);    \n\n  RooAbsArg::setDirtyInhibit(kTRUE) ;\n\n  Double_t result(0) ;\n  Double_t wgtSum(0) ;  \n\n  if (_catTable) {\n\n    \/\/ Data contains only categories, sum over weighted supercategory states\n    TIterator* iter = _superCat->typeIterator() ;\n    RooCatType* type ;\n    while(type=(RooCatType*)iter->Next()) {\n      \/\/ Backprop state to data set so that _real takes appropriate value\n      _superCat->setIndex(type->getVal()) ;\n\n      \/\/ Add weighted sum\n      Double_t wgt = _catTable->get(type->GetName()) ;\n      if (wgt) {\n\tresult += wgt * _real->getVal(_nset) ;\n\twgtSum += wgt ;\n      }\n    }\n    delete iter ;\n    \n  } else {\n\n    \/\/ Data contains reals, sum over all entries\n    Int_t i ;\n    Int_t nEvt = _data->numEntries() ;\n\n    \/\/ Procedure might be lengthy, give some progress indication\n    if (_first) {\n      cout << \"RooDataProjBinding::operator() projecting over \" << nEvt << \" events\" << endl ;\n      _first = kFALSE ;\n    } else {\n      cout << \".\" ; cout.flush() ;\n    }\n\n    for (i=0 ; i<nEvt ; i++) {\n      _data->get(i) ;\n\n      Double_t wgt = _data->weight() ;\n      if (wgt) {\n\tif (i==0) RooAbsPdf::verboseEval(-1) ;\n\tresult += wgt * _real->getVal(_nset) ;\n\tif (i==0) RooAbsPdf::verboseEval(0) ;\n\twgtSum += wgt ;\n      }      \n    }\n  }\n\n  RooAbsArg::setDirtyInhibit(kFALSE) ;\n\n  if (wgtSum==0) return 0 ;\n  return result \/ wgtSum ;\n}\n<commit_msg><commit_after>\/*****************************************************************************\n * Project: RooFit                                                           *\n * Package: RooFitCore                                                       *\n *    File: $Id: RooDataProjBinding.cc,v 1.7 2002\/09\/30 00:57:28 verkerke Exp $\n * Authors:                                                                  *\n *   WV, Wouter Verkerke, UC Santa Barbara, verkerke@slac.stanford.edu       *\n *   DK, David Kirkby,    UC Irvine,         dkirkby@uci.edu                 *\n *                                                                           *\n * Copyright (c) 2000-2002, Regents of the University of California          *\n *                          and Stanford University. All rights reserved.    *\n *                                                                           *\n * Redistribution and use in source and binary forms,                        *\n * with or without modification, are permitted according to the terms        *\n * listed in LICENSE (http:\/\/roofit.sourceforge.net\/license.txt)             *\n *****************************************************************************\/\n\n\/\/ -- CLASS DESCRIPTION [AUX] --\n\/\/ Lightweight interface adaptor that projects a real function via summation\n\/\/ of states provided in a dataset. The real function must be attached to\n\/\/ the dataset before creating this binding object.\n\/\/\n\/\/ If the dataset only contains category variables, the summation is optimized\n\/\/ performing a weighted sum over the states of a RooSuperCategory that is\n\/\/ constructed from all the categories in the dataset\n\n#include \"RooFitCore\/RooDataProjBinding.hh\"\n#include \"RooFitCore\/RooAbsReal.hh\"\n#include \"RooFitCore\/RooAbsData.hh\"\n#include \"RooFitCore\/Roo1DTable.hh\"\n#include \"RooFitCore\/RooSuperCategory.hh\"\n#include \"RooFitCore\/RooCategory.hh\"\n#include \"RooFitCore\/RooAbsPdf.hh\"\n\n#include <assert.h>\n\nClassImp(RooDataProjBinding)\n;\n\n\nRooDataProjBinding::RooDataProjBinding(const RooAbsReal &real, const RooAbsData& data, \n\t\t\t\t       const RooArgSet &vars, const RooArgSet* nset) :\n  RooRealBinding(real,vars,0), _data(&data), _real(&real), _nset(nset), \n  _catTable(0), _superCat(0), _first(kTRUE)\n{  \n  \/\/ Constructor\n\n  \/\/ Determine if dataset contains only categories\n  TIterator* iter = data.get()->createIterator() ;\n  Bool_t allCat(kTRUE) ;\n  RooAbsArg* arg ;\n  while(arg=(RooAbsArg*)iter->Next()) {\n    if (!dynamic_cast<RooCategory*>(arg)) allCat = kFALSE ;\n  }\n  delete iter ;\n\n  \/\/ Determine weights of various super categories fractions\n  \/\/allCat = kFALSE ;\n  if (allCat) {\n     _superCat = new RooSuperCategory(\"superCat\",\"superCat\",*data.get()) ;\n     _catTable = data.table(*_superCat) ;\n  }\n}\n\n\n\nRooDataProjBinding::~RooDataProjBinding() \n{\n  \/\/ Destructor, delete owned objects\n  if (_superCat) delete _superCat ;\n  if (_catTable) delete _catTable ;\n}\n\n\n\nDouble_t RooDataProjBinding::operator()(const Double_t xvector[]) const \n{\n  \/\/ Evaluate data-projected values of boud real function.\n  assert(isValid());\n  loadValues(xvector);    \n\n  \/\/RooAbsArg::setDirtyInhibit(kTRUE) ;\n\n  Double_t result(0) ;\n  Double_t wgtSum(0) ;  \n\n  if (_catTable) {\n\n    \/\/ Data contains only categories, sum over weighted supercategory states\n    TIterator* iter = _superCat->typeIterator() ;\n    RooCatType* type ;\n    while(type=(RooCatType*)iter->Next()) {\n      \/\/ Backprop state to data set so that _real takes appropriate value\n      _superCat->setIndex(type->getVal()) ;\n\n      \/\/ Add weighted sum\n      Double_t wgt = _catTable->get(type->GetName()) ;\n      if (wgt) {\n\tresult += wgt * _real->getVal(_nset) ;\n\twgtSum += wgt ;\n      }\n    }\n    delete iter ;\n    \n  } else {\n\n    \/\/ Data contains reals, sum over all entries\n    Int_t i ;\n    Int_t nEvt = _data->numEntries() ;\n\n    \/\/ Procedure might be lengthy, give some progress indication\n    if (_first) {\n      cout << \"RooDataProjBinding::operator() projecting over \" << nEvt << \" events\" << endl ;\n      _first = kFALSE ;\n    } else {\n      cout << \".\" ; cout.flush() ;\n    }\n\n    for (i=0 ; i<nEvt ; i++) {\n      _data->get(i) ;\n\n      Double_t wgt = _data->weight() ;\n      if (wgt) {\n\tif (i==0) RooAbsPdf::verboseEval(-1) ;\n\tresult += wgt * _real->getVal(_nset) ;\n\tif (i==0) RooAbsPdf::verboseEval(0) ;\n\twgtSum += wgt ;\n      }      \n    }\n  }\n\n  \/\/RooAbsArg::setDirtyInhibit(kFALSE) ;\n\n  if (wgtSum==0) return 0 ;\n  return result \/ wgtSum ;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"generator\/LLBkg_Generator.h\"\n\n\/\/ from ROOT\n#include \"TRandom.h\"\n\n\/\/ from project - generator\n#include \"generator\/CompGeneratorFactory.h\"\n#include \"generator\/generator.h\"\n#include \"generator\/Observables.h\"\n\n\/\/ from project - configuration\n#include \"configuration\/CompConfig.h\"\n\nnamespace cptoymc {\nnamespace generator {\n\n\nLLBkg_Generator::LLBkg_Generator() :\n  CompGenerator(),\n  params_mass_{0.},\n  params_timeandcp_{1.,0.},\n  params_timeresol_{0.,0.05},\n  params_taggingeffs_{0.30,0.06,0.04},\n  params_taggingOS_{0.4,0.},\n  params_taggingSS_{0.4,0.},\n  comp_cat_(-1001)\n{\n  \n}\n\nLLBkg_Generator::~LLBkg_Generator() {\n  \n}\n\nvoid LLBkg_Generator::Configure(const configuration::CompConfig& comp_config) {\n  auto config_ptree = comp_config.model_ptree();\n\n  comp_cat_ = comp_config.comp_cat();\n  \n  \/\/ Mass\n  auto sub_config_ptree = config_ptree.get_child(\"Mass\");\n  params_mass_.expo  = sub_config_ptree.get(\"expo\", params_mass_.expo);\n  \n  \/\/ TimeAndCP\n  sub_config_ptree = config_ptree.get_child(\"TimeAndCP\");\n  params_timeandcp_.tau       = sub_config_ptree.get(\"tau\", params_timeandcp_.tau);\n  params_timeandcp_.prod_asym = sub_config_ptree.get(\"AP\" , params_timeandcp_.prod_asym);\n  \n  sub_config_ptree = config_ptree.get_child(\"TimeResol\");\n  params_timeresol_.bias  = sub_config_ptree.get(\"bias\" , params_timeresol_.bias  );\n  params_timeresol_.sigma = sub_config_ptree.get(\"sigma\", params_timeresol_.sigma );\n  \n  \/\/ Tagging\n  sub_config_ptree = config_ptree.get_child(\"Tagging\");\n  params_taggingeffs_.eff_OS    = sub_config_ptree.get(\"eff_OS\"   ,params_taggingeffs_.eff_OS   );\n  params_taggingeffs_.eff_SS    = sub_config_ptree.get(\"eff_SS\"   ,params_taggingeffs_.eff_SS   );\n  params_taggingeffs_.eff_SSOS  = sub_config_ptree.get(\"eff_SSOS\" ,params_taggingeffs_.eff_SSOS );\n  \n  params_taggingOS_.omega   = sub_config_ptree.get(\"omega_OS\"  , params_taggingOS_.omega  );\n  params_taggingOS_.domega  = sub_config_ptree.get(\"domega_OS\" , params_taggingOS_.domega );\n  params_taggingSS_.omega   = sub_config_ptree.get(\"omega_SS\"  , params_taggingSS_.omega );\n  params_taggingSS_.domega  = sub_config_ptree.get(\"domega_SS\" , params_taggingSS_.domega );\n}\n\nbool LLBkg_Generator::TryGenerateEvent(TRandom& rndm, Observables& observables) {\n  bool gen_success = true;\n  \n  observables.comp_cat.set_value(comp_cat_);\n  \n  gen_success &= GenerateMass(rndm, observables.mass_true, observables.mass_meas);\n  gen_success &= GenerateTimeAndTrueTag(rndm, observables.time_true, observables.tag_true, observables.time_meas);\n  gen_success &= GenerateTagAndEta(rndm, observables.tag_true,\n                                   observables.tag_OS, observables.eta_OS,\n                                   observables.tag_SS, observables.eta_SS,\n                                   observables.tag_class);\n  return gen_success;\n}\n  \nbool LLBkg_Generator::GenerateMass(TRandom& rndm, ObservableReal& obs_mass_true, ObservableReal& obs_mass_meas) {\n  bool gen_success = true;\n  \n  obs_mass_true.value_ = -1000.;\n  gen_success &= GenerateExpo(rndm,-1.*params_mass_.expo,obs_mass_meas.value_,\n                              obs_mass_meas.min_value(),obs_mass_meas.max_value());\n  \n  return gen_success;\n}\n\nbool LLBkg_Generator::GenerateTimeAndTrueTag(TRandom& rndm, ObservableReal& obs_time_true, ObservableInt& obs_tag_true, ObservableReal& obs_time_meas) {\n  bool gen_success = true;\n  \n  \/\/ true \"tag\" according to prodasym\n  obs_tag_true.value_ = (rndm.Uniform() < (1. - params_timeandcp_.prod_asym)\/2.) ? +1 : -1;\n  \n  \/\/ decay time\n  gen_success &= GenerateExpo(rndm,1.\/params_timeandcp_.tau,obs_time_true.value_,obs_time_true.min_value(),obs_time_true.max_value());\n  \n  gen_success &= GenerateResolSingleGauss(rndm, params_timeresol_.bias, params_timeresol_.sigma, obs_time_true.value(), obs_time_meas.value_);\n  \n  return gen_success;\n}\n\n\nbool LLBkg_Generator::GenerateTagAndEta(TRandom& rndm, const ObservableInt& obs_tag_true,\n                                                ObservableInt& obs_tag_OS, ObservableReal& obs_eta_OS,\n                                                ObservableInt& obs_tag_SS, ObservableReal& obs_eta_SS,\n                                                ObservableInt& obs_tag_class)\n{\n  bool gen_success = true;\n  double random_val = rndm.Uniform();\n  \n  if (random_val < params_taggingeffs_.eff_OS) {\n    gen_success &= GenerateEtaFlat(rndm, obs_eta_OS.value_);\n    gen_success &= GenerateTag(rndm, params_taggingOS_.omega, params_taggingOS_.domega,\n                obs_tag_true.value(), obs_tag_OS.value_);\n    obs_tag_SS.value_ = 1;\n    obs_eta_SS.value_ = 0.5;\n    obs_tag_class.value_ = 1;\n  }\n  else if (random_val < (params_taggingeffs_.eff_OS + params_taggingeffs_.eff_SS)) {\n    gen_success &= GenerateEtaFlat(rndm, obs_eta_SS.value_);\n    gen_success &= GenerateTag(rndm, params_taggingSS_.omega, params_taggingSS_.domega,\n                obs_tag_true.value(), obs_tag_SS.value_);\n    obs_tag_OS.value_ = 1;\n    obs_eta_OS.value_ = 0.5;\n    obs_tag_class.value_ = -1;\n  }\n  else if (random_val < (  params_taggingeffs_.eff_OS\n                         + params_taggingeffs_.eff_SS\n                         + params_taggingeffs_.eff_SSOS) ) {\n    gen_success &= GenerateEtaFlat(rndm, obs_eta_OS.value_);\n    gen_success &= GenerateTag(rndm, params_taggingOS_.omega, params_taggingOS_.domega,\n                               obs_tag_true.value(), obs_tag_OS.value_);\n    gen_success &= GenerateEtaFlat(rndm, obs_eta_SS.value_);\n    gen_success &= GenerateTag(rndm, params_taggingSS_.omega, params_taggingSS_.domega,\n                               obs_tag_true.value(), obs_tag_SS.value_);\n    obs_tag_class.value_ = 10;\n  }\n  else {\n    obs_tag_SS.value_ = 1;\n    obs_eta_SS.value_ = 0.5;\n    obs_tag_OS.value_ = 1;\n    obs_eta_OS.value_ = 0.5;\n    obs_tag_class.value_ = 0;\n  }\n  \n  return gen_success;\n}\n \n\n} \/\/ namespace generator\n} \/\/ namespace cptoymc\n<commit_msg>LLBkg_Generator: changed tagging category to: +1 for excl OS tagged, -1 for SS tagged, 0 for untagged<commit_after>#include \"generator\/LLBkg_Generator.h\"\n\n\/\/ from ROOT\n#include \"TRandom.h\"\n\n\/\/ from project - generator\n#include \"generator\/CompGeneratorFactory.h\"\n#include \"generator\/generator.h\"\n#include \"generator\/Observables.h\"\n\n\/\/ from project - configuration\n#include \"configuration\/CompConfig.h\"\n\nnamespace cptoymc {\nnamespace generator {\n\n\nLLBkg_Generator::LLBkg_Generator() :\n  CompGenerator(),\n  params_mass_{0.},\n  params_timeandcp_{1.,0.},\n  params_timeresol_{0.,0.05},\n  params_taggingeffs_{0.30,0.06,0.04},\n  params_taggingOS_{0.4,0.},\n  params_taggingSS_{0.4,0.},\n  comp_cat_(-1001)\n{\n  \n}\n\nLLBkg_Generator::~LLBkg_Generator() {\n  \n}\n\nvoid LLBkg_Generator::Configure(const configuration::CompConfig& comp_config) {\n  auto config_ptree = comp_config.model_ptree();\n\n  comp_cat_ = comp_config.comp_cat();\n  \n  \/\/ Mass\n  auto sub_config_ptree = config_ptree.get_child(\"Mass\");\n  params_mass_.expo  = sub_config_ptree.get(\"expo\", params_mass_.expo);\n  \n  \/\/ TimeAndCP\n  sub_config_ptree = config_ptree.get_child(\"TimeAndCP\");\n  params_timeandcp_.tau       = sub_config_ptree.get(\"tau\", params_timeandcp_.tau);\n  params_timeandcp_.prod_asym = sub_config_ptree.get(\"AP\" , params_timeandcp_.prod_asym);\n  \n  sub_config_ptree = config_ptree.get_child(\"TimeResol\");\n  params_timeresol_.bias  = sub_config_ptree.get(\"bias\" , params_timeresol_.bias  );\n  params_timeresol_.sigma = sub_config_ptree.get(\"sigma\", params_timeresol_.sigma );\n  \n  \/\/ Tagging\n  sub_config_ptree = config_ptree.get_child(\"Tagging\");\n  params_taggingeffs_.eff_OS    = sub_config_ptree.get(\"eff_OS\"   ,params_taggingeffs_.eff_OS   );\n  params_taggingeffs_.eff_SS    = sub_config_ptree.get(\"eff_SS\"   ,params_taggingeffs_.eff_SS   );\n  params_taggingeffs_.eff_SSOS  = sub_config_ptree.get(\"eff_SSOS\" ,params_taggingeffs_.eff_SSOS );\n  \n  params_taggingOS_.omega   = sub_config_ptree.get(\"omega_OS\"  , params_taggingOS_.omega  );\n  params_taggingOS_.domega  = sub_config_ptree.get(\"domega_OS\" , params_taggingOS_.domega );\n  params_taggingSS_.omega   = sub_config_ptree.get(\"omega_SS\"  , params_taggingSS_.omega );\n  params_taggingSS_.domega  = sub_config_ptree.get(\"domega_SS\" , params_taggingSS_.domega );\n}\n\nbool LLBkg_Generator::TryGenerateEvent(TRandom& rndm, Observables& observables) {\n  bool gen_success = true;\n  \n  observables.comp_cat.set_value(comp_cat_);\n  \n  gen_success &= GenerateMass(rndm, observables.mass_true, observables.mass_meas);\n  gen_success &= GenerateTimeAndTrueTag(rndm, observables.time_true, observables.tag_true, observables.time_meas);\n  gen_success &= GenerateTagAndEta(rndm, observables.tag_true,\n                                   observables.tag_OS, observables.eta_OS,\n                                   observables.tag_SS, observables.eta_SS,\n                                   observables.tag_class);\n  return gen_success;\n}\n  \nbool LLBkg_Generator::GenerateMass(TRandom& rndm, ObservableReal& obs_mass_true, ObservableReal& obs_mass_meas) {\n  bool gen_success = true;\n  \n  obs_mass_true.value_ = -1000.;\n  gen_success &= GenerateExpo(rndm,-1.*params_mass_.expo,obs_mass_meas.value_,\n                              obs_mass_meas.min_value(),obs_mass_meas.max_value());\n  \n  return gen_success;\n}\n\nbool LLBkg_Generator::GenerateTimeAndTrueTag(TRandom& rndm, ObservableReal& obs_time_true, ObservableInt& obs_tag_true, ObservableReal& obs_time_meas) {\n  bool gen_success = true;\n  \n  \/\/ true \"tag\" according to prodasym\n  obs_tag_true.value_ = (rndm.Uniform() < (1. - params_timeandcp_.prod_asym)\/2.) ? +1 : -1;\n  \n  \/\/ decay time\n  gen_success &= GenerateExpo(rndm,1.\/params_timeandcp_.tau,obs_time_true.value_,obs_time_true.min_value(),obs_time_true.max_value());\n  \n  gen_success &= GenerateResolSingleGauss(rndm, params_timeresol_.bias, params_timeresol_.sigma, obs_time_true.value(), obs_time_meas.value_);\n  \n  return gen_success;\n}\n\n\nbool LLBkg_Generator::GenerateTagAndEta(TRandom& rndm, const ObservableInt& obs_tag_true,\n                                                ObservableInt& obs_tag_OS, ObservableReal& obs_eta_OS,\n                                                ObservableInt& obs_tag_SS, ObservableReal& obs_eta_SS,\n                                                ObservableInt& obs_tag_class)\n{\n  bool gen_success = true;\n  double random_val = rndm.Uniform();\n  \n  if (random_val < params_taggingeffs_.eff_OS) { \/\/ generate OS tags and mistags\n    gen_success &= GenerateEtaFlat(rndm, obs_eta_OS.value_);\n    gen_success &= GenerateTag(rndm, params_taggingOS_.omega, params_taggingOS_.domega,\n                obs_tag_true.value(), obs_tag_OS.value_);\n    obs_tag_SS.value_ = 1;\n    obs_eta_SS.value_ = 0.5;\n    obs_tag_class.value_ = 1;\n  }\n  else if (random_val < (params_taggingeffs_.eff_OS + params_taggingeffs_.eff_SS)) { \/\/ generate SS tags and mistags\n    gen_success &= GenerateEtaFlat(rndm, obs_eta_SS.value_);\n    gen_success &= GenerateTag(rndm, params_taggingSS_.omega, params_taggingSS_.domega,\n                obs_tag_true.value(), obs_tag_SS.value_);\n    obs_tag_OS.value_ = 1;\n    obs_eta_OS.value_ = 0.5;\n    obs_tag_class.value_ = -1;\n  }\n  else if (random_val < (  params_taggingeffs_.eff_OS\n                         + params_taggingeffs_.eff_SS\n                         + params_taggingeffs_.eff_SSOS) ) { \/\/ generate overlap tags and mistags\n    gen_success &= GenerateEtaFlat(rndm, obs_eta_OS.value_);\n    gen_success &= GenerateTag(rndm, params_taggingOS_.omega, params_taggingOS_.domega,\n                               obs_tag_true.value(), obs_tag_OS.value_);\n    gen_success &= GenerateEtaFlat(rndm, obs_eta_SS.value_);\n    gen_success &= GenerateTag(rndm, params_taggingSS_.omega, params_taggingSS_.domega,\n                               obs_tag_true.value(), obs_tag_SS.value_);\n    obs_tag_class.value_ = -1;\n  }\n  else { \/\/ untagged\n    obs_tag_SS.value_ = 1;\n    obs_eta_SS.value_ = 0.5;\n    obs_tag_OS.value_ = 1;\n    obs_eta_OS.value_ = 0.5;\n    obs_tag_class.value_ = 0;\n  }\n  \n  return gen_success;\n}\n \n\n} \/\/ namespace generator\n} \/\/ namespace cptoymc\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\n * roipropertyview.cpp\r\n *\r\n *  Created on: 03.02.2012\r\n *      Author: Ralph\r\n *\/\r\n#include \"roipropertyview.h\"\r\n\r\n\r\nROIPropertyView::ROIPropertyView( QWidget* parent ) :\r\n    m_selected( QItemSelection() )\r\n{\r\n}\r\n\r\nROIPropertyView::~ROIPropertyView()\r\n{\r\n}\r\n\r\nQRect ROIPropertyView::visualRect( const QModelIndex &index ) const\r\n{\r\n    return QRect( 0, 0, 0, 0 );\r\n}\r\n\r\nvoid ROIPropertyView::scrollTo( const QModelIndex &index, ScrollHint hint )\r\n{\r\n}\r\n\r\nQModelIndex ROIPropertyView::indexAt( const QPoint &point ) const\r\n{\r\n    return QModelIndex();\r\n}\r\n\r\nQModelIndex ROIPropertyView::moveCursor( CursorAction cursorAction, Qt::KeyboardModifiers modifiers )\r\n{\r\n    return QModelIndex();\r\n}\r\n\r\nint ROIPropertyView::horizontalOffset() const\r\n{\r\n    return 0;\r\n}\r\n\r\nint ROIPropertyView::verticalOffset() const\r\n{\r\n    return 0;\r\n}\r\n\r\nbool ROIPropertyView::isIndexHidden( const QModelIndex &index ) const\r\n{\r\n    return false;\r\n}\r\n\r\nvoid ROIPropertyView::setSelection( const QRect &rect, QItemSelectionModel::SelectionFlags flags )\r\n{\r\n}\r\n\r\nQRegion ROIPropertyView::visualRegionForSelection( const QItemSelection &selection ) const\r\n{\r\n    return QRegion();\r\n}\r\n\r\nQModelIndex ROIPropertyView::getSelectedIndex( int column )\r\n{\r\n    if ( m_selected.indexes().size() > 0 )\r\n    {\r\n        int sel = -1;\r\n        sel = m_selected.indexes().first().row();\r\n        QModelIndex index = model()->index( sel, column );\r\n        return index;\r\n    }\r\n    return QModelIndex();\r\n}\r\n\r\nvoid ROIPropertyView::selectionChanged( const QItemSelection &selected, const QItemSelection &deselected )\r\n{\r\n    m_selected = selected;\r\n\r\n    if ( m_selected.indexes().size() > 0 )\r\n    {\r\n        emit( selectedChanged() );\r\n    }\r\n}\r\n\r\nvoid ROIPropertyView::dataChanged( const QModelIndex &topLeft, const QModelIndex &bottomRight )\r\n{\r\n    if ( m_selected.indexes().size() > 0 )\r\n    {\r\n       \/\/ emit( selectedChanged() );\r\n    }\r\n}\r\n<commit_msg>fixed index for child rois<commit_after>\/*\r\n * roipropertyview.cpp\r\n *\r\n *  Created on: 03.02.2012\r\n *      Author: Ralph\r\n *\/\r\n#include \"roipropertyview.h\"\r\n\r\n\r\nROIPropertyView::ROIPropertyView( QWidget* parent ) :\r\n    m_selected( QItemSelection() )\r\n{\r\n}\r\n\r\nROIPropertyView::~ROIPropertyView()\r\n{\r\n}\r\n\r\nQRect ROIPropertyView::visualRect( const QModelIndex &index ) const\r\n{\r\n    return QRect( 0, 0, 0, 0 );\r\n}\r\n\r\nvoid ROIPropertyView::scrollTo( const QModelIndex &index, ScrollHint hint )\r\n{\r\n}\r\n\r\nQModelIndex ROIPropertyView::indexAt( const QPoint &point ) const\r\n{\r\n    return QModelIndex();\r\n}\r\n\r\nQModelIndex ROIPropertyView::moveCursor( CursorAction cursorAction, Qt::KeyboardModifiers modifiers )\r\n{\r\n    return QModelIndex();\r\n}\r\n\r\nint ROIPropertyView::horizontalOffset() const\r\n{\r\n    return 0;\r\n}\r\n\r\nint ROIPropertyView::verticalOffset() const\r\n{\r\n    return 0;\r\n}\r\n\r\nbool ROIPropertyView::isIndexHidden( const QModelIndex &index ) const\r\n{\r\n    return false;\r\n}\r\n\r\nvoid ROIPropertyView::setSelection( const QRect &rect, QItemSelectionModel::SelectionFlags flags )\r\n{\r\n}\r\n\r\nQRegion ROIPropertyView::visualRegionForSelection( const QItemSelection &selection ) const\r\n{\r\n    return QRegion();\r\n}\r\n\r\nQModelIndex ROIPropertyView::getSelectedIndex( int column )\r\n{\r\n    if ( m_selected.indexes().size() > 0 )\r\n    {\r\n        int sel = -1;\r\n        sel = m_selected.indexes().first().row();\r\n        QModelIndex index = model()->index( sel, column, model()->parent( m_selected.indexes().first() ) );\r\n        return index;\r\n    }\r\n    return QModelIndex();\r\n}\r\n\r\nvoid ROIPropertyView::selectionChanged( const QItemSelection &selected, const QItemSelection &deselected )\r\n{\r\n    m_selected = selected;\r\n\r\n    if ( m_selected.indexes().size() > 0 )\r\n    {\r\n        emit( selectedChanged() );\r\n    }\r\n}\r\n\r\nvoid ROIPropertyView::dataChanged( const QModelIndex &topLeft, const QModelIndex &bottomRight )\r\n{\r\n    if ( m_selected.indexes().size() > 0 )\r\n    {\r\n       \/\/ emit( selectedChanged() );\r\n    }\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>rewrote config to element class meta functions, removing elements\/boundary cell storage works now<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>INTEGRATION: CWS ooo19126 (1.12.122); FILE MERGED 2005\/09\/05 12:58:58 rt 1.12.122.1: #i54170# Change license header: remove SISSL<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>INTEGRATION: CWS changefileheader (1.6.318); FILE MERGED 2008\/04\/01 15:18:31 thb 1.6.318.3: #i85898# Stripping all external header guards 2008\/04\/01 10:58:00 thb 1.6.318.2: #i85898# Stripping all external header guards 2008\/03\/28 15:34:59 rt 1.6.318.1: #i87441# Change license header to LPGL v3.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Module:    itkOpeningByReconstructionImageFilterTest.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 \"itkOpeningByReconstructionImageFilter.h\"\n#include \"itkImageFileReader.h\"\n#include \"itkImageFileWriter.h\"\n#include \"itkImage.h\"\n#include \"itkBinaryBallStructuringElement.h\"\n#include \"itkSubtractImageFilter.h\"\n\nint itkOpeningByReconstructionImageFilterTest(int argc, char* argv [] ) \n{\n if ( argc < 5 )\n  {\n    std::cerr << \"Missing arguments\" << std::endl;\n    std::cerr << \"Usage: \" << argv[0] << \" Inputimage OutputImage Radius PreserveIntensities(0,1) [Diffmage]\" << std::endl;\n    return EXIT_FAILURE;\n  } \n  \n  const int Dimension = 2;\n  typedef unsigned char PixelType;\n  typedef itk::Image< PixelType, Dimension >   InputImageType;\n  typedef itk::Image< PixelType, Dimension >   OutputImageType;\n  \n  typedef itk::ImageFileReader< InputImageType >   ReaderType;\n  typedef itk::ImageFileWriter< OutputImageType >  WriterType;\n  \n  \/\/ Declare the type of the Structuring element to be used\n  typedef itk::BinaryBallStructuringElement< \n                            PixelType,\n                            Dimension>                  StructuringElementType;\n\n  \/\/ Declare the type for the Morphology Filters to be Tested\n  typedef itk::OpeningByReconstructionImageFilter< \n                                InputImageType, \n                                OutputImageType, \n                                StructuringElementType >  MorphologicalFilterType;\n  \n  ReaderType::Pointer           reader = ReaderType::New();\n  WriterType::Pointer           writer = WriterType::New();\n\n  \/\/ Create the reader and writer\n  reader->SetFileName( argv[1] );\n  writer->SetFileName( argv[2] );\n\n  \/\/ Create the filter\n  MorphologicalFilterType::Pointer   filter = MorphologicalFilterType::New();\n \n  StructuringElementType   structuringElement;\n\n  structuringElement.SetRadius(atoi(argv[3]));\n  structuringElement.CreateStructuringElement();\n\n  filter->SetKernel( structuringElement );\n  if (atoi(argv[4]) == 0)\n    {\n    filter->PreserveIntensitiesOff();\n    }\n  else\n    {\n    filter->PreserveIntensitiesOn();\n    }\n\n  \/\/ Connect the pipelines\n  filter->SetInput ( reader-> GetOutput() );\n  writer->SetInput ( filter-> GetOutput() );\n\n\n  \/\/ Execute print\n  filter->Print( std::cout );\n\n  \/\/ Execute the filter\n  try\n  {\n    writer->Update();\n  }\n  catch( itk::ExceptionObject & excp )\n  {\n    std::cerr << \"Exception caught:\" << excp << std::endl;\n    return  EXIT_FAILURE;\n  }\n   \n  \/\/ Create a difference image if one is requested\n  if (argc == 6)\n    {\n    itk::SubtractImageFilter<InputImageType, OutputImageType, OutputImageType>::Pointer subtract = itk::SubtractImageFilter<InputImageType, OutputImageType, OutputImageType>::New();\n    subtract->SetInput( 0, reader->GetOutput() );\n    subtract->SetInput( 1, filter->GetOutput() );\n    try\n      {\n      writer->SetFileName( argv[5] );\n      writer->SetInput( subtract->GetOutput() );\n      writer->Update();\n      }\n    catch( itk::ExceptionObject & excp )\n      {\n      std::cerr << \"Exception caught writing diff image:\" << excp << std::endl;\n      return  EXIT_FAILURE;\n      }\n    }\n  return EXIT_SUCCESS;\n\n}\n\n\n\n\n<commit_msg>ENH: Added SimpleFilterWatcher.<commit_after>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Module:    itkOpeningByReconstructionImageFilterTest.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 \"itkOpeningByReconstructionImageFilter.h\"\n#include \"itkImageFileReader.h\"\n#include \"itkImageFileWriter.h\"\n#include \"itkImage.h\"\n#include \"itkBinaryBallStructuringElement.h\"\n#include \"itkSubtractImageFilter.h\"\n#include \"itkSimpleFilterWatcher.h\"\n\nint itkOpeningByReconstructionImageFilterTest(int argc, char* argv [] ) \n{\n if ( argc < 5 )\n  {\n    std::cerr << \"Missing arguments\" << std::endl;\n    std::cerr << \"Usage: \" << argv[0] << \" Inputimage OutputImage Radius PreserveIntensities(0,1) [Diffmage]\" << std::endl;\n    return EXIT_FAILURE;\n  } \n  \n  const int Dimension = 2;\n  typedef unsigned char PixelType;\n  typedef itk::Image< PixelType, Dimension >   InputImageType;\n  typedef itk::Image< PixelType, Dimension >   OutputImageType;\n  \n  typedef itk::ImageFileReader< InputImageType >   ReaderType;\n  typedef itk::ImageFileWriter< OutputImageType >  WriterType;\n  \n  \/\/ Declare the type of the Structuring element to be used\n  typedef itk::BinaryBallStructuringElement< \n                            PixelType,\n                            Dimension>                  StructuringElementType;\n\n  \/\/ Declare the type for the Morphology Filters to be Tested\n  typedef itk::OpeningByReconstructionImageFilter< \n                                InputImageType, \n                                OutputImageType, \n                                StructuringElementType >  MorphologicalFilterType;\n  \n  ReaderType::Pointer           reader = ReaderType::New();\n  WriterType::Pointer           writer = WriterType::New();\n\n  \/\/ Create the reader and writer\n  reader->SetFileName( argv[1] );\n  writer->SetFileName( argv[2] );\n\n  \/\/ Create the filter\n  MorphologicalFilterType::Pointer   filter = MorphologicalFilterType::New();\n  itk::SimpleFilterWatcher watcher(filter, \"Opening\"); watcher.QuietOn();\n \n  StructuringElementType   structuringElement;\n\n  structuringElement.SetRadius(atoi(argv[3]));\n  structuringElement.CreateStructuringElement();\n\n  filter->SetKernel( structuringElement );\n  if (atoi(argv[4]) == 0)\n    {\n    filter->PreserveIntensitiesOff();\n    }\n  else\n    {\n    filter->PreserveIntensitiesOn();\n    }\n\n  \/\/ Connect the pipelines\n  filter->SetInput ( reader-> GetOutput() );\n  writer->SetInput ( filter-> GetOutput() );\n\n\n  \/\/ Execute print\n  filter->Print( std::cout );\n\n  \/\/ Execute the filter\n  try\n  {\n    writer->Update();\n  }\n  catch( itk::ExceptionObject & excp )\n  {\n    std::cerr << \"Exception caught:\" << excp << std::endl;\n    return  EXIT_FAILURE;\n  }\n   \n  \/\/ Create a difference image if one is requested\n  if (argc == 6)\n    {\n    itk::SubtractImageFilter<InputImageType, OutputImageType, OutputImageType>::Pointer subtract = itk::SubtractImageFilter<InputImageType, OutputImageType, OutputImageType>::New();\n    subtract->SetInput( 0, reader->GetOutput() );\n    subtract->SetInput( 1, filter->GetOutput() );\n    try\n      {\n      writer->SetFileName( argv[5] );\n      writer->SetInput( subtract->GetOutput() );\n      writer->Update();\n      }\n    catch( itk::ExceptionObject & excp )\n      {\n      std::cerr << \"Exception caught writing diff image:\" << excp << std::endl;\n      return  EXIT_FAILURE;\n      }\n    }\n  return EXIT_SUCCESS;\n\n}\n\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\r\n**\r\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\r\n** All rights reserved.\r\n** Contact: Nokia Corporation (qt-info@nokia.com)\r\n**\r\n** This file is part of the Qt Mobility Components.\r\n**\r\n** $QT_BEGIN_LICENSE:LGPL$\r\n** No Commercial Usage\r\n** This file contains pre-release code and may not be distributed.\r\n** You may use this file in accordance with the terms and conditions\r\n** contained in the Technology Preview License Agreement accompanying\r\n** this package.\r\n**\r\n** GNU Lesser General Public License Usage\r\n** Alternatively, this file may be used under the terms of the GNU Lesser\r\n** General Public License version 2.1 as published by the Free Software\r\n** Foundation and appearing in the file LICENSE.LGPL included in the\r\n** packaging of this file.  Please review the following information to\r\n** ensure the GNU Lesser General Public License version 2.1 requirements\r\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\r\n**\r\n** In addition, as a special exception, Nokia gives you certain additional\r\n** rights.  These rights are described in the Nokia Qt LGPL Exception\r\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\r\n**\r\n** If you have questions regarding the use of this file, please contact\r\n** Nokia at qt-info@nokia.com.\r\n**\r\n**\r\n**\r\n**\r\n**\r\n**\r\n**\r\n**\r\n** $QT_END_LICENSE$\r\n**\r\n****************************************************************************\/\r\n\r\n#include <QObject>\r\n#include <QTimer>\r\n\r\n#include <wlanmgmtclient.h>\r\n#include <wlanmgmtinterface.h>\r\n#include <wlanmgmtcommon.h>\r\n#include \"wlaninfo_s60.h\"\r\n\r\nconst int KWlanInfoSignalStrengthMax = 60;\r\nconst int KWlanInfoSignalStrengthMin = 100;\r\n\r\nCWlanInfo::CWlanInfo(QObject *parent) : QObject(parent)\r\n    , m_wlanStatus(false)\r\n    , m_wlanSsid(NULL)\r\n    , m_wlanSignalStrength(-1)\r\n{\r\n#ifndef __WINSCW__    \r\n    TRAP_IGNORE(\r\n        m_wlanMgmtClient = CWlanMgmtClient::NewL();\r\n        m_wlanMgmtClient->ActivateNotificationsL(*this);\r\n    )\r\n\r\n    m_timer = new QTimer(this);\r\n    connect(m_timer, SIGNAL(timeout()), this, SLOT(checkWlanInfo()));\r\n    m_timer->setInterval(1000);\r\n    m_timer->start();\r\n#endif    \r\n}\r\n\r\nCWlanInfo::~CWlanInfo()\r\n{\r\n    m_wlanMgmtClient->CancelNotifications();\r\n    delete m_wlanMgmtClient;\r\n}\r\n\r\nQString CWlanInfo::wlanNetworkName() const\r\n{\r\n    return m_wlanSsid;\r\n}\r\n\r\nint CWlanInfo::wlanNetworkSignalStrength() const\r\n{\r\n    return m_wlanSignalStrength;\r\n}\r\n\r\nbool CWlanInfo::wlanNetworkConnectionStatus() const\r\n{\r\n    return m_wlanStatus;\r\n}\r\n\r\nvoid CWlanInfo::checkWlanInfo()\r\n{\r\n#ifndef __WINSCW__    \r\n    TWlanConnectionMode connectionMode;\r\n    TInt err = m_wlanMgmtClient->GetConnectionMode(connectionMode);\r\n    if (err == KErrNone && connectionMode != EWlanConnectionModeNotConnected) {\r\n        m_wlanStatus = true;\r\n        emit wlanNetworkStatusChanged();\r\n    } else {\r\n        stopPolling();\r\n        return;\r\n    }\r\n\r\n    TWlanSsid ssid;\r\n    err = m_wlanMgmtClient->GetConnectionSsid(ssid);\r\n    ssid.ZeroTerminate();\r\n    if (err == KErrNone && m_wlanSsid != (char*)ssid.Ptr()) {\r\n        m_wlanSsid = (char*)ssid.Ptr();\r\n        emit wlanNetworkNameChanged();\r\n    }\r\n\r\n    TInt32 signalQuality;\r\n    err = m_wlanMgmtClient->GetConnectionSignalQuality(signalQuality);\r\n\r\n    if (err == KErrNone && m_wlanSignalStrength != signalQuality) {\r\n        if (signalQuality <= KWlanInfoSignalStrengthMax && signalQuality >= 0)\r\n            m_wlanSignalStrength = 100;\r\n        else if (signalQuality >= KWlanInfoSignalStrengthMin)\r\n            m_wlanSignalStrength = 0;\r\n        else {\r\n            m_wlanSignalStrength = (KWlanInfoSignalStrengthMin - signalQuality) * 100 \/\r\n            (KWlanInfoSignalStrengthMin - KWlanInfoSignalStrengthMax);\r\n        }\r\n        emit wlanNetworkSignalStrengthChanged();\r\n    }\r\n#endif\r\n}\r\n\r\nvoid CWlanInfo::ConnectionStateChanged(TWlanConnectionMode aNewState)\r\n{\r\n    if (aNewState == EWlanConnectionModeNotConnected)\r\n        stopPolling();\r\n    else {\r\n        m_timer->start();\r\n        checkWlanInfo();\r\n    }\r\n}\r\n\r\nvoid CWlanInfo::stopPolling()\r\n{\r\n    m_timer->stop();\r\n    m_wlanStatus = false;\r\n    m_wlanSsid = \"\";\r\n    m_wlanSignalStrength = 0;\r\n\r\n    emit wlanNetworkStatusChanged();\r\n    emit wlanNetworkNameChanged();\r\n    emit wlanNetworkSignalStrengthChanged();\r\n}\r\n<commit_msg>fix build in 4.7<commit_after>\/****************************************************************************\r\n**\r\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\r\n** All rights reserved.\r\n** Contact: Nokia Corporation (qt-info@nokia.com)\r\n**\r\n** This file is part of the Qt Mobility Components.\r\n**\r\n** $QT_BEGIN_LICENSE:LGPL$\r\n** No Commercial Usage\r\n** This file contains pre-release code and may not be distributed.\r\n** You may use this file in accordance with the terms and conditions\r\n** contained in the Technology Preview License Agreement accompanying\r\n** this package.\r\n**\r\n** GNU Lesser General Public License Usage\r\n** Alternatively, this file may be used under the terms of the GNU Lesser\r\n** General Public License version 2.1 as published by the Free Software\r\n** Foundation and appearing in the file LICENSE.LGPL included in the\r\n** packaging of this file.  Please review the following information to\r\n** ensure the GNU Lesser General Public License version 2.1 requirements\r\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\r\n**\r\n** In addition, as a special exception, Nokia gives you certain additional\r\n** rights.  These rights are described in the Nokia Qt LGPL Exception\r\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\r\n**\r\n** If you have questions regarding the use of this file, please contact\r\n** Nokia at qt-info@nokia.com.\r\n**\r\n**\r\n**\r\n**\r\n**\r\n**\r\n**\r\n**\r\n** $QT_END_LICENSE$\r\n**\r\n****************************************************************************\/\r\n\r\n#include <QObject>\r\n#include <QTimer>\r\n\r\n#include <wlanmgmtclient.h>\r\n#include <wlanmgmtinterface.h>\r\n#include <wlanmgmtcommon.h>\r\n#include \"wlaninfo_s60.h\"\r\n\r\nconst int KWlanInfoSignalStrengthMax = 60;\r\nconst int KWlanInfoSignalStrengthMin = 100;\r\n\r\nCWlanInfo::CWlanInfo(QObject *parent) : QObject(parent)\r\n    , m_wlanStatus(false)\r\n    , m_wlanSsid()\r\n    , m_wlanSignalStrength(-1)\r\n{\r\n#ifndef __WINSCW__    \r\n    TRAP_IGNORE(\r\n        m_wlanMgmtClient = CWlanMgmtClient::NewL();\r\n        m_wlanMgmtClient->ActivateNotificationsL(*this);\r\n    )\r\n\r\n    m_timer = new QTimer(this);\r\n    connect(m_timer, SIGNAL(timeout()), this, SLOT(checkWlanInfo()));\r\n    m_timer->setInterval(1000);\r\n    m_timer->start();\r\n#endif    \r\n}\r\n\r\nCWlanInfo::~CWlanInfo()\r\n{\r\n    m_wlanMgmtClient->CancelNotifications();\r\n    delete m_wlanMgmtClient;\r\n}\r\n\r\nQString CWlanInfo::wlanNetworkName() const\r\n{\r\n    return m_wlanSsid;\r\n}\r\n\r\nint CWlanInfo::wlanNetworkSignalStrength() const\r\n{\r\n    return m_wlanSignalStrength;\r\n}\r\n\r\nbool CWlanInfo::wlanNetworkConnectionStatus() const\r\n{\r\n    return m_wlanStatus;\r\n}\r\n\r\nvoid CWlanInfo::checkWlanInfo()\r\n{\r\n#ifndef __WINSCW__    \r\n    TWlanConnectionMode connectionMode;\r\n    TInt err = m_wlanMgmtClient->GetConnectionMode(connectionMode);\r\n    if (err == KErrNone && connectionMode != EWlanConnectionModeNotConnected) {\r\n        m_wlanStatus = true;\r\n        emit wlanNetworkStatusChanged();\r\n    } else {\r\n        stopPolling();\r\n        return;\r\n    }\r\n\r\n    TWlanSsid ssid;\r\n    err = m_wlanMgmtClient->GetConnectionSsid(ssid);\r\n    ssid.ZeroTerminate();\r\n    if (err == KErrNone && m_wlanSsid != (char*)ssid.Ptr()) {\r\n        m_wlanSsid = (char*)ssid.Ptr();\r\n        emit wlanNetworkNameChanged();\r\n    }\r\n\r\n    TInt32 signalQuality;\r\n    err = m_wlanMgmtClient->GetConnectionSignalQuality(signalQuality);\r\n\r\n    if (err == KErrNone && m_wlanSignalStrength != signalQuality) {\r\n        if (signalQuality <= KWlanInfoSignalStrengthMax && signalQuality >= 0)\r\n            m_wlanSignalStrength = 100;\r\n        else if (signalQuality >= KWlanInfoSignalStrengthMin)\r\n            m_wlanSignalStrength = 0;\r\n        else {\r\n            m_wlanSignalStrength = (KWlanInfoSignalStrengthMin - signalQuality) * 100 \/\r\n            (KWlanInfoSignalStrengthMin - KWlanInfoSignalStrengthMax);\r\n        }\r\n        emit wlanNetworkSignalStrengthChanged();\r\n    }\r\n#endif\r\n}\r\n\r\nvoid CWlanInfo::ConnectionStateChanged(TWlanConnectionMode aNewState)\r\n{\r\n    if (aNewState == EWlanConnectionModeNotConnected)\r\n        stopPolling();\r\n    else {\r\n        m_timer->start();\r\n        checkWlanInfo();\r\n    }\r\n}\r\n\r\nvoid CWlanInfo::stopPolling()\r\n{\r\n    m_timer->stop();\r\n    m_wlanStatus = false;\r\n    m_wlanSsid = \"\";\r\n    m_wlanSignalStrength = 0;\r\n\r\n    emit wlanNetworkStatusChanged();\r\n    emit wlanNetworkNameChanged();\r\n    emit wlanNetworkSignalStrengthChanged();\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>ExtGlobalContext::onCreateContext: warning C4702: unreachable code<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>Don't overflow case to default so that adding of case will never overflow<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: basscript.hxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 02:24: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 SCRIPTING_BASSCRIPT_HXX\n#define SCRIPTING_BASSCRIPT_HXX\n\n#ifndef _COM_SUN_STAR_SCRIPT_PROVIDER_XSCRIPT_HPP_\n#include <com\/sun\/star\/script\/provider\/XScript.hpp>\n#endif\n#ifndef _CPPUHELPER_IMPLBASE1_HXX_\n#include <cppuhelper\/implbase1.hxx>\n#endif\n\n#ifndef _SB_SBMETH_HXX\n#include <basic\/sbmeth.hxx>\n#endif\n\n\n\/\/.........................................................................\nnamespace basprov\n{\n\/\/.........................................................................\n\n    \/\/  ----------------------------------------------------\n    \/\/  class BasicScriptImpl\n    \/\/  ----------------------------------------------------\n\n    typedef ::cppu::WeakImplHelper1<\n        ::com::sun::star::script::provider::XScript > BasicScriptImpl_BASE;\n\n\n    class BasicScriptImpl : public BasicScriptImpl_BASE\n    {\n    private:\n        SbMethodRef m_xMethod;\n        ::rtl::OUString m_funcName;\n    public:\n        BasicScriptImpl( const ::rtl::OUString& funcName, SbMethodRef xMethod );\n        virtual ~BasicScriptImpl();\n\n        \/\/ XScript\n        virtual ::com::sun::star::uno::Any SAL_CALL invoke(\n            const ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any >& aParams,\n            ::com::sun::star::uno::Sequence< sal_Int16 >& aOutParamIndex,\n            ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any >& aOutParam )\n            throw (\n                    ::com::sun::star::script::provider::ScriptFrameworkErrorException,\n                    ::com::sun::star::reflection::InvocationTargetException,\n                    ::com::sun::star::uno::RuntimeException );\n    };\n\n\/\/.........................................................................\n}   \/\/ namespace basprov\n\/\/.........................................................................\n\n#endif \/\/ SCRIPTING_BASSCRIPT_HXX\n<commit_msg>INTEGRATION: CWS odbmacros2 (1.6.90); FILE MERGED 2007\/12\/19 13:24:57 fs 1.6.90.1: #i49133# when invoking a script, temporarily set the XScriptInvocationContext as ThisComponent at the script<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: basscript.hxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: kz $ $Date: 2008-03-06 16:19: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 SCRIPTING_BASSCRIPT_HXX\n#define SCRIPTING_BASSCRIPT_HXX\n\n#ifndef _COM_SUN_STAR_SCRIPT_PROVIDER_XSCRIPT_HPP_\n#include <com\/sun\/star\/script\/provider\/XScript.hpp>\n#endif\n#ifndef _COM_SUN_STAR_DOCUMENT_XSCRIPTINVOCATIONCONTEXT_HPP_\n#include <com\/sun\/star\/document\/XScriptInvocationContext.hpp>\n#endif\n#ifndef _CPPUHELPER_IMPLBASE1_HXX_\n#include <cppuhelper\/implbase1.hxx>\n#endif\n\n#ifndef _SB_SBMETH_HXX\n#include <basic\/sbmeth.hxx>\n#endif\n\n\nclass BasicManager;\n\n\/\/.........................................................................\nnamespace basprov\n{\n\/\/.........................................................................\n\n    \/\/  ----------------------------------------------------\n    \/\/  class BasicScriptImpl\n    \/\/  ----------------------------------------------------\n\n    typedef ::cppu::WeakImplHelper1<\n        ::com::sun::star::script::provider::XScript > BasicScriptImpl_BASE;\n\n\n    class BasicScriptImpl : public BasicScriptImpl_BASE\n    {\n    private:\n        SbMethodRef         m_xMethod;\n        ::rtl::OUString     m_funcName;\n        BasicManager*       m_documentBasicManager;\n        ::com::sun::star::uno::Reference< ::com::sun::star::document::XScriptInvocationContext >\n                            m_xDocumentScriptContext;\n\n    public:\n        BasicScriptImpl(\n            const ::rtl::OUString& funcName,\n            SbMethodRef xMethod\n        );\n        BasicScriptImpl(\n            const ::rtl::OUString& funcName,\n            SbMethodRef xMethod,\n            BasicManager& documentBasicManager,\n            const ::com::sun::star::uno::Reference< ::com::sun::star::document::XScriptInvocationContext >& documentScriptContext\n        );\n        virtual ~BasicScriptImpl();\n\n        \/\/ XScript\n        virtual ::com::sun::star::uno::Any SAL_CALL invoke(\n            const ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any >& aParams,\n            ::com::sun::star::uno::Sequence< sal_Int16 >& aOutParamIndex,\n            ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any >& aOutParam )\n            throw (\n                    ::com::sun::star::script::provider::ScriptFrameworkErrorException,\n                    ::com::sun::star::reflection::InvocationTargetException,\n                    ::com::sun::star::uno::RuntimeException );\n    };\n\n\/\/.........................................................................\n}   \/\/ namespace basprov\n\/\/.........................................................................\n\n#endif \/\/ SCRIPTING_BASSCRIPT_HXX\n<|endoftext|>"}
{"text":"<commit_before>#include \"ILOptimizer.h\"\n#include <core\/IL\/ILProgram.h>\n#include <iostream>\n#include <cstdlib>\n\nILOptimizer::ILOptimizer()\n{\n\n}\n\nILOptimizer::~ILOptimizer()\n{\n\n\n}\n\nint ILOptimizer::OperandUsedTwice(ILFunction* f, IL::ILOperand* opr)\n{\n    int n = 0;\n     \n    for (std::vector<IL>::iterator iit = f->Body.begin(); iit != f->Body.end(); ++iit)\n    {\n        for (std::vector<IL::ILOperand>::iterator iopr = iit->Operands.begin(); iopr != iit->Operands.end(); iopr++) {\n            if (opr->Equal(&(*iopr))) {\n                n++;\n            }\n        };\n    }\n    \n    return (n == 2);\n}\n\nint ILOptimizer::DeleteNops(ILFunction* f)\n{\n    int n = 0;\n    std::vector<IL> ils;\n    ils = f->Body;\n    \n    f->Body.clear();\n    \n    for (std::vector<IL>::iterator iit = ils.begin(); iit != ils.end(); ++iit)\n    {\n        if (iit->Opcode == IL::Nop) {\n            n++;\n        }\n        else {\n            f->Body.push_back(*iit);\n        }\n    }\n    \n    return n;\n}\n\n\nint ILOptimizer::OptimizeFunction(ILFunction *f)\n{\n    int optimized = 0;\n    std::vector<IL> ils;\n    ils = f->Body;\n    \n    std::cout << \"Optimizing: function START\" << std::endl;\n    \n    for (std::vector<IL>::iterator iit = ils.begin(); iit != ils.end(); ++iit)\n    {\n        IL &il = *iit;\n        \n        \/\/ safety ensurance\n        if ((iit+1) == f->Body.end() || iit == ils.begin()) {\n            continue;\n        }\n        \n        \/\/ branch\n        std::cout << \"Optimizing: \" << il.ToString() << std::endl;\n        if(il.Opcode == IL::CompLt || il.Opcode == IL::CompLe || il.Opcode == IL::CompGt || il.Opcode == IL::CompGe || il.Opcode == IL::CompEq || il.Opcode == IL::CompNe) {\n            \/\/ std::cout << \"Ah ha! I got you! clt\" << std::endl;\n            IL &il2 = *(iit+1);\n\n            if(il2.Opcode == IL::BrZ) {               \n                std::cout << \"Ah ha! I got you! bz after clt -->\";\n                \/\/ and the __temp varaible is not used anymore\n                if (il2.Operands.at(0).Equal(&il.Operands.at(0)) &&\n                    OperandUsedTwice(f, &il.Operands.at(0))\n                ) {\n                    \n                    std::cout << \"Good to optimize.\" << std::endl;\n                    std::cout << \"Optimizing: \" << il2.ToString() << std::endl;\n                    \/\/ changed to: \n                    if (il.Opcode == IL::CompLt) {\n                        il = *(new IL(IL::BrLe, il.Operands.at(2), il.Operands.at(1), il2.Operands.at(1)));\n                    } else if (il.Opcode == IL::CompLe) {\n                        il = *(new IL(IL::BrLt, il.Operands.at(2), il.Operands.at(1), il2.Operands.at(1)));\n                    } else if (il.Opcode == IL::CompGt) {\n                        il = *(new IL(IL::BrLe, il.Operands.at(1), il.Operands.at(2), il2.Operands.at(1)));\n                    } else if (il.Opcode == IL::CompGe) {\n                        il = *(new IL(IL::BrLt, il.Operands.at(1), il.Operands.at(2), il2.Operands.at(1)));\n                    } else if (il.Opcode == IL::CompEq) {\n                        il = *(new IL(IL::BrNe, il.Operands.at(1), il.Operands.at(2), il2.Operands.at(1)));\n                    } else if (il.Opcode == IL::CompNe) {\n                        il = *(new IL(IL::BrEq, il.Operands.at(1), il.Operands.at(2), il2.Operands.at(1)));\n                    } else {\n                        abort();\n                    }\n                    il2 = *(new IL(IL::Nop));\n                    std::cout << \"Optimized: \" << il.ToString() << std::endl;\n                    optimized = 1;\n                }\n                else {\n                    std::cout << \"Sadly not okay to optimize.\" << std::endl;\n                }\n            }\n            if(il2.Opcode == IL::BrNz) {\n                std::cout << \"Ah ha! I got you! bnz after clt -->\";\n                if (il2.Operands.at(0).Equal(&il.Operands.at(0)) &&\n                    OperandUsedTwice(f, &il.Operands.at(0))\n                ) {\n\n                    std::cout << \"Good to optimize.\" << std::endl;\n                    std::cout << \"Optimizing: \" << il2.ToString() << std::endl;\n                    \/\/ changed to: \n                    if (il.Opcode == IL::CompLt) {\n                        il = *(new IL(IL::BrLt, il.Operands.at(1), il.Operands.at(2), il2.Operands.at(1)));\n                    } else if (il.Opcode == IL::CompLe) {\n                        il = *(new IL(IL::BrLe, il.Operands.at(1), il.Operands.at(2), il2.Operands.at(1)));\n                    } else if (il.Opcode == IL::CompGt) {\n                        il = *(new IL(IL::BrLt, il.Operands.at(2), il.Operands.at(1), il2.Operands.at(1)));\n                    } else if (il.Opcode == IL::CompGe) {\n                        il = *(new IL(IL::BrLe, il.Operands.at(2), il.Operands.at(1), il2.Operands.at(1)));\n                    } else if (il.Opcode == IL::CompEq) {\n                        il = *(new IL(IL::BrEq, il.Operands.at(1), il.Operands.at(2), il2.Operands.at(1)));\n                    } else if (il.Opcode == IL::CompNe) {\n                        il = *(new IL(IL::BrNe, il.Operands.at(1), il.Operands.at(2), il2.Operands.at(1)));\n                    } else {\n                        abort();\n                    }\n                    il2 = *(new IL(IL::Nop));\n                    std::cout << \"Optimized: \" << il.ToString() << std::endl;\n                    optimized = 1;\n                }\n                else {\n                    std::cout << \"Sadly not okay to optimize.\" << std::endl;\n                }\n\n            }\n        }\n        \n        \/*\n        \/\/ copy proporgation (partial)\n        if(il.Opcode == IL::Add) {\n            \/\/ std::cout << \"Ah ha! I got you! clt\" << std::endl;\n            IL &il2 = *(iit+1);\n            if(il2.Opcode == IL::Mov) {\n                std::cout << \"Ah ha! I got you! mov after add -->\";\n                if (il2.Operands.at(1).Equal(&il.Operands.at(0)) &&\n                    OperandUsedTwice(f, &il.Operands.at(0))\n                ) {\n                    std::cout << \"Good to optimize.\" << std::endl;\n                    std::cout << \"Optimizing: \" << il2.ToString() << std::endl;\n                    \/\/ changed to: \n                    il = *(new IL(IL::Add, il2.Operands.at(0), il.Operands.at(1), il.Operands.at(2)));\n                    il2 = *(new IL(IL::Nop));\n                    std::cout << \"Optimized: \" << il.ToString() << std::endl;     \n                }\n                else {\n                    std::cout << \"Sadly not okay to optimize.\" << std::endl;\n                }\n            }\n        }\n        *\/\n        \/\/ copy proporgation (partial)\n        if(il.Opcode == IL::Mov || il.Opcode == IL::Conv) { \/\/ Mov and Conv are identical\n            \/\/ safety check: only if it is not converting types\n            if (il.Operands.at(0).OperandType != il.Operands.at(1).OperandType) {\n                continue;\n            }\n            \n            \/\/ previous instruction\n            IL &il2 = *(iit-1);\n            switch (il2.Opcode) {\n                \/\/ there should be more instructions that are okay.\n                \/\/ For safety, we only allow a set\n                \/\/ extend it later\n                case IL::Add:\n                case IL::And:\n                case IL::Sub:\n                case IL::Mul:\n                case IL::Div:\n                \/\/ il2.Opcode == IL::Conv ||\n                case IL::Ldelem:\n                case IL::Ldelema:\n                    if (\n                        il2.Operands.at(0).Equal(&il.Operands.at(1)) &&\n                        \/\/ not used in other places\n                        OperandUsedTwice(f, &il2.Operands.at(0)) &&\n                        \/\/ is a variable\n                        il2.Operands.at(0).OperandKind == IL::Variable &&\n                        \/\/ is local\n                        il2.Operands.at(0).SymRef->Scope->GetScopeKind() == SymbolScope::Block\n                        \n                    ) {\n                        std::cout << \"Ah ha! I got you! mov after some instructions -->\";\n                        std::cout << \"Good to optimize.\" << std::endl;\n                        \/\/ changed to: \n                        il2 = *(new IL(il2.Opcode, il.Operands.at(0), il2.Operands.at(1), il2.Operands.at(2)));\n                        std::cout << \"Optimized: \" << il2.ToString() << std::endl;\n                        il= *(new IL(IL::Nop));\n                        std::cout << \"Optimized: \" << il.ToString() << std::endl;\n                        optimized = 1;\n                    }\n                    else {\n                        std::cout << \"Sadly not okay to optimize.\" << std::endl;\n                        \/\/ std::cout << \"Equal: \" << il2.Operands.at(0).Equal(&il.Operands.at(1)) << std::endl;\n                        \/\/ std::cout << \"TWice: \" << OperandUsedTwice(f, &il2.Operands.at(0)) << std::endl;\n                    }\n                    break;\n                case IL::Conv:\n                case IL::Neg:\n                case IL::Ldind:\n                    if (\n                        il2.Operands.at(0).Equal(&il.Operands.at(1)) &&\n                        \/\/ not used in other places\n                        OperandUsedTwice(f, &il2.Operands.at(0)) &&\n                        \/\/ is a variable\n                        il2.Operands.at(0).OperandKind == IL::Variable &&\n                        \/\/ is local\n                        il2.Operands.at(0).SymRef->Scope->GetScopeKind() == SymbolScope::Block\n                    ) {\n                        std::cout << \"Ah ha! I got you! mov after conv instructions -->\";\n                        std::cout << \"Good to optimize.\" << std::endl;\n                        \/\/ changed to: \n                        il2 = *(new IL(il2.Opcode, il.Operands.at(0), il2.Operands.at(1)));\n                        std::cout << \"Optimized: \" << il2.ToString() << std::endl;\n                        il= *(new IL(IL::Nop));\n                        std::cout << \"Optimized: \" << il.ToString() << std::endl;\n                        optimized = 1;\n                    }\n                    else {\n                        std::cout << \"Sadly not okay to optimize.\" << std::endl;\n                        \/\/ std::cout << \"Equal: \" << il2.Operands.at(0).Equal(&il.Operands.at(1)) << std::endl;\n                        \/\/ std::cout << \"TWice: \" << OperandUsedTwice(f, &il2.Operands.at(0)) << std::endl;\n                    }\n                    break;\n                default:\n                    break;\n            }   \n        }\n    }\n    \n    f->Body = ils;\n    \n    int n_del_nops = DeleteNops(f);\n    \n    std::cout << \"Optimized: Deleted \" << n_del_nops << \" Nops.\" << std::endl;\n    \n    std::cout << \"Optimizing: function END\" << std::endl;\n    \n    return optimized;\n}\n\nILProgram* ILOptimizer::Optimize(ILProgram* il)\n{\n    \/\/ Visit(il);\n    _il = new ILProgram();\n    \n    \/\/ make a copy\n    *_il = *il;\n    \n    \/\/ optimize now\n    for (std::vector<ILClass *>::iterator cit = _il->Claases.begin(); cit != _il->Claases.end(); ++cit)\n    {\n        ILClass *c = *cit;\n        \n        \/\/ EnterClass(c);\n        \n        for (std::vector<ILFunction *>::iterator fit = c->Functions.begin(); fit != c->Functions.end(); ++fit)\n        {\n            ILFunction *f = *fit;\n         \n            \/\/ optimize till no place to optimize\n            while (OptimizeFunction(f)) {;};\n\t    \n            \/\/ EnterFunction(f);\n            \n            \/\/ for (std::vector<IL>::iterator iit = f->Body.begin(); iit != f->Body.end(); ++iit)\n            \/\/ {\n            \/\/    ;\n            \/\/ iit->Accept(this);\n            \/\/ }\n            \n            \/\/ LeaveFunction(f);\n        }\n        \n        \/\/ LeaveClass(c);\n    }\n    \n    \n    return _il;\n    \/\/ return il;\n}\n\n<commit_msg>Bugfix: http:\/\/baijia.info\/showthread.php?tid=2572<commit_after>#include \"ILOptimizer.h\"\n#include <core\/IL\/ILProgram.h>\n#include <iostream>\n#include <cstdlib>\n\nILOptimizer::ILOptimizer()\n{\n\n}\n\nILOptimizer::~ILOptimizer()\n{\n\n\n}\n\nint ILOptimizer::OperandUsedTwice(ILFunction* f, IL::ILOperand* opr)\n{\n    int n = 0;\n\n    for (std::vector<IL>::iterator iit = f->Body.begin(); iit != f->Body.end(); ++iit)\n    {\n        for (std::vector<IL::ILOperand>::iterator iopr = iit->Operands.begin(); iopr != iit->Operands.end(); iopr++) {\n            if (opr->Equal(&(*iopr))) {\n                n++;\n            }\n        };\n    }\n\n    return (n == 2);\n}\n\nint ILOptimizer::DeleteNops(ILFunction* f)\n{\n    int n = 0;\n    std::vector<IL> ils;\n    ils = f->Body;\n\n    f->Body.clear();\n\n    for (std::vector<IL>::iterator iit = ils.begin(); iit != ils.end(); ++iit)\n    {\n        if (iit->Opcode == IL::Nop) {\n            n++;\n        }\n        else {\n            f->Body.push_back(*iit);\n        }\n    }\n\n    return n;\n}\n\n\nint ILOptimizer::OptimizeFunction(ILFunction *f)\n{\n    int optimized = 0;\n    std::vector<IL> ils;\n    ils = f->Body;\n\n    std::cout << \"Optimizing: function START\" << std::endl;\n\n    for (std::vector<IL>::iterator iit = ils.begin(); iit != ils.end(); ++iit)\n    {\n        IL &il = *iit;\n\n        \/\/ safety ensurance\n        \/\/ if ((iit+1) == f->Body.end() || iit == ils.begin()) {\n        if ((iit+1) == ils.end() || iit == ils.begin()) {\n            continue;\n        }\n\n        \/\/ branch\n        std::cout << \"Optimizing: \" << il.ToString() << std::endl;\n        if(il.Opcode == IL::CompLt || il.Opcode == IL::CompLe || il.Opcode == IL::CompGt || il.Opcode == IL::CompGe || il.Opcode == IL::CompEq || il.Opcode == IL::CompNe) {\n            \/\/ std::cout << \"Ah ha! I got you! clt\" << std::endl;\n            IL &il2 = *(iit+1);\n\n            if(il2.Opcode == IL::BrZ) {\n                std::cout << \"Ah ha! I got you! bz after clt -->\";\n                \/\/ and the __temp varaible is not used anymore\n                if (il2.Operands.at(0).Equal(&il.Operands.at(0)) &&\n                    OperandUsedTwice(f, &il.Operands.at(0))\n                ) {\n\n                    std::cout << \"Good to optimize.\" << std::endl;\n                    std::cout << \"Optimizing: \" << il2.ToString() << std::endl;\n                    \/\/ changed to:\n                    if (il.Opcode == IL::CompLt) {\n                        il = *(new IL(IL::BrLe, il.Operands.at(2), il.Operands.at(1), il2.Operands.at(1)));\n                    } else if (il.Opcode == IL::CompLe) {\n                        il = *(new IL(IL::BrLt, il.Operands.at(2), il.Operands.at(1), il2.Operands.at(1)));\n                    } else if (il.Opcode == IL::CompGt) {\n                        il = *(new IL(IL::BrLe, il.Operands.at(1), il.Operands.at(2), il2.Operands.at(1)));\n                    } else if (il.Opcode == IL::CompGe) {\n                        il = *(new IL(IL::BrLt, il.Operands.at(1), il.Operands.at(2), il2.Operands.at(1)));\n                    } else if (il.Opcode == IL::CompEq) {\n                        il = *(new IL(IL::BrNe, il.Operands.at(1), il.Operands.at(2), il2.Operands.at(1)));\n                    } else if (il.Opcode == IL::CompNe) {\n                        il = *(new IL(IL::BrEq, il.Operands.at(1), il.Operands.at(2), il2.Operands.at(1)));\n                    } else {\n                        abort();\n                    }\n                    il2 = *(new IL(IL::Nop));\n                    std::cout << \"Optimized: \" << il.ToString() << std::endl;\n                    optimized = 1;\n                }\n                else {\n                    std::cout << \"Sadly not okay to optimize.\" << std::endl;\n                }\n            }\n            if(il2.Opcode == IL::BrNz) {\n                std::cout << \"Ah ha! I got you! bnz after clt -->\";\n                if (il2.Operands.at(0).Equal(&il.Operands.at(0)) &&\n                    OperandUsedTwice(f, &il.Operands.at(0))\n                ) {\n\n                    std::cout << \"Good to optimize.\" << std::endl;\n                    std::cout << \"Optimizing: \" << il2.ToString() << std::endl;\n                    \/\/ changed to:\n                    if (il.Opcode == IL::CompLt) {\n                        il = *(new IL(IL::BrLt, il.Operands.at(1), il.Operands.at(2), il2.Operands.at(1)));\n                    } else if (il.Opcode == IL::CompLe) {\n                        il = *(new IL(IL::BrLe, il.Operands.at(1), il.Operands.at(2), il2.Operands.at(1)));\n                    } else if (il.Opcode == IL::CompGt) {\n                        il = *(new IL(IL::BrLt, il.Operands.at(2), il.Operands.at(1), il2.Operands.at(1)));\n                    } else if (il.Opcode == IL::CompGe) {\n                        il = *(new IL(IL::BrLe, il.Operands.at(2), il.Operands.at(1), il2.Operands.at(1)));\n                    } else if (il.Opcode == IL::CompEq) {\n                        il = *(new IL(IL::BrEq, il.Operands.at(1), il.Operands.at(2), il2.Operands.at(1)));\n                    } else if (il.Opcode == IL::CompNe) {\n                        il = *(new IL(IL::BrNe, il.Operands.at(1), il.Operands.at(2), il2.Operands.at(1)));\n                    } else {\n                        abort();\n                    }\n                    il2 = *(new IL(IL::Nop));\n                    std::cout << \"Optimized: \" << il.ToString() << std::endl;\n                    optimized = 1;\n                }\n                else {\n                    std::cout << \"Sadly not okay to optimize.\" << std::endl;\n                }\n\n            }\n        }\n\n        \/*\n        \/\/ copy proporgation (partial)\n        if(il.Opcode == IL::Add) {\n            \/\/ std::cout << \"Ah ha! I got you! clt\" << std::endl;\n            IL &il2 = *(iit+1);\n            if(il2.Opcode == IL::Mov) {\n                std::cout << \"Ah ha! I got you! mov after add -->\";\n                if (il2.Operands.at(1).Equal(&il.Operands.at(0)) &&\n                    OperandUsedTwice(f, &il.Operands.at(0))\n                ) {\n                    std::cout << \"Good to optimize.\" << std::endl;\n                    std::cout << \"Optimizing: \" << il2.ToString() << std::endl;\n                    \/\/ changed to:\n                    il = *(new IL(IL::Add, il2.Operands.at(0), il.Operands.at(1), il.Operands.at(2)));\n                    il2 = *(new IL(IL::Nop));\n                    std::cout << \"Optimized: \" << il.ToString() << std::endl;\n                }\n                else {\n                    std::cout << \"Sadly not okay to optimize.\" << std::endl;\n                }\n            }\n        }\n        *\/\n        \/\/ copy proporgation (partial)\n        if(il.Opcode == IL::Mov || il.Opcode == IL::Conv) { \/\/ Mov and Conv are identical\n            \/\/ safety check: only if it is not converting types\n            if (il.Operands.at(0).OperandType != il.Operands.at(1).OperandType) {\n                continue;\n            }\n\n            \/\/ previous instruction\n            IL &il2 = *(iit-1);\n            switch (il2.Opcode) {\n                \/\/ there should be more instructions that are okay.\n                \/\/ For safety, we only allow a set\n                \/\/ extend it later\n                case IL::Add:\n                case IL::And:\n                case IL::Sub:\n                case IL::Mul:\n                case IL::Div:\n                \/\/ il2.Opcode == IL::Conv ||\n                case IL::Ldelem:\n                case IL::Ldelema:\n                    if (\n                        il2.Operands.at(0).Equal(&il.Operands.at(1)) &&\n                        \/\/ not used in other places\n                        OperandUsedTwice(f, &il2.Operands.at(0)) &&\n                        \/\/ is a variable\n                        il2.Operands.at(0).OperandKind == IL::Variable &&\n                        \/\/ is local\n                        il2.Operands.at(0).SymRef->Scope->GetScopeKind() == SymbolScope::Block\n\n                    ) {\n                        std::cout << \"Ah ha! I got you! mov after some instructions -->\";\n                        std::cout << \"Good to optimize.\" << std::endl;\n                        \/\/ changed to:\n                        il2 = *(new IL(il2.Opcode, il.Operands.at(0), il2.Operands.at(1), il2.Operands.at(2)));\n                        std::cout << \"Optimized: \" << il2.ToString() << std::endl;\n                        il= *(new IL(IL::Nop));\n                        std::cout << \"Optimized: \" << il.ToString() << std::endl;\n                        optimized = 1;\n                    }\n                    else {\n                        std::cout << \"Sadly not okay to optimize.\" << std::endl;\n                        \/\/ std::cout << \"Equal: \" << il2.Operands.at(0).Equal(&il.Operands.at(1)) << std::endl;\n                        \/\/ std::cout << \"TWice: \" << OperandUsedTwice(f, &il2.Operands.at(0)) << std::endl;\n                    }\n                    break;\n                case IL::Conv:\n                case IL::Neg:\n                case IL::Ldind:\n                    if (\n                        il2.Operands.at(0).Equal(&il.Operands.at(1)) &&\n                        \/\/ not used in other places\n                        OperandUsedTwice(f, &il2.Operands.at(0)) &&\n                        \/\/ is a variable\n                        il2.Operands.at(0).OperandKind == IL::Variable &&\n                        \/\/ is local\n                        il2.Operands.at(0).SymRef->Scope->GetScopeKind() == SymbolScope::Block\n                    ) {\n                        std::cout << \"Ah ha! I got you! mov after conv instructions -->\";\n                        std::cout << \"Good to optimize.\" << std::endl;\n                        \/\/ changed to:\n                        il2 = *(new IL(il2.Opcode, il.Operands.at(0), il2.Operands.at(1)));\n                        std::cout << \"Optimized: \" << il2.ToString() << std::endl;\n                        il= *(new IL(IL::Nop));\n                        std::cout << \"Optimized: \" << il.ToString() << std::endl;\n                        optimized = 1;\n                    }\n                    else {\n                        std::cout << \"Sadly not okay to optimize.\" << std::endl;\n                        \/\/ std::cout << \"Equal: \" << il2.Operands.at(0).Equal(&il.Operands.at(1)) << std::endl;\n                        \/\/ std::cout << \"TWice: \" << OperandUsedTwice(f, &il2.Operands.at(0)) << std::endl;\n                    }\n                    break;\n                default:\n                    break;\n            }\n        }\n    }\n\n    f->Body = ils;\n\n    int n_del_nops = DeleteNops(f);\n\n    std::cout << \"Optimized: Deleted \" << n_del_nops << \" Nops.\" << std::endl;\n\n    std::cout << \"Optimizing: function END\" << std::endl;\n\n    return optimized;\n}\n\nILProgram* ILOptimizer::Optimize(ILProgram* il)\n{\n    \/\/ Visit(il);\n    _il = new ILProgram();\n\n    \/\/ make a copy\n    *_il = *il;\n\n    \/\/ optimize now\n    for (std::vector<ILClass *>::iterator cit = _il->Claases.begin(); cit != _il->Claases.end(); ++cit)\n    {\n        ILClass *c = *cit;\n\n        \/\/ EnterClass(c);\n\n        for (std::vector<ILFunction *>::iterator fit = c->Functions.begin(); fit != c->Functions.end(); ++fit)\n        {\n            ILFunction *f = *fit;\n\n            \/\/ optimize till no place to optimize\n            while (OptimizeFunction(f)) {;};\n\n            \/\/ EnterFunction(f);\n\n            \/\/ for (std::vector<IL>::iterator iit = f->Body.begin(); iit != f->Body.end(); ++iit)\n            \/\/ {\n            \/\/    ;\n            \/\/ iit->Accept(this);\n            \/\/ }\n\n            \/\/ LeaveFunction(f);\n        }\n\n        \/\/ LeaveClass(c);\n    }\n\n\n    return _il;\n    \/\/ return il;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"list_pwd.h\"\n#include <string.h>\n#include <string>\n#include <iostream>\n#include <sstream>\n\n#include <windows.h>\n\nstd::string ListPwd::prefix(ppk_entry_type type)\n{\n\tstatic const char* ppk_network_string = \"ppasskeeper_network:\/\/\";\n\tstatic const char* ppk_app_string = \"ppasskeeper_app:\/\/\";\n\tstatic const char* ppk_item_string = \"ppasskeeper_item:\/\/\";\n\n\tswitch(type)\n\t{\n\t\tcase ppk_network:\n\t\t\treturn ppk_network_string;\n\t\t\tbreak;\n\t\tcase ppk_application:\n\t\t\treturn ppk_app_string;\n\t\t\tbreak;\n\t\tcase ppk_item:\n\t\t\treturn ppk_item_string;\n\t\t\tbreak;\n\t}\n\treturn std::string();\n}\n\nbool ListPwd::addNetworkPassword(std::string stripped_name)\n{\n\t\/\/Parse the file's name\n\tunsigned int pos_at=stripped_name.find_first_of(\"@\");\n\tunsigned int pos_sc=stripped_name.find(\":\",pos_at+1);\n\n\t\/\/if it has found the separators\n\tif(pos_at!=std::string::npos && pos_sc!=std::string::npos)\n\t{\n\t\tstd::string user=stripped_name.substr(0,pos_at);\n\t\tstd::string host=stripped_name.substr(pos_at+1,pos_sc-(pos_at+1));\n\t\tstd::string s_port=stripped_name.substr(pos_sc+1);\n\n\t\t\/\/Get the port into a number\n\t\tunsigned int port;\n\t\tstd::istringstream i(s_port);\n\t\tif (!(i >> port))\n\t\t\treturn false;\n\n\t\t\/\/Add the content to pwdList\n\t\tnetworkList tmp;\n\t\ttmp.host=host;\n\t\ttmp.user=user;\n\t\ttmp.port=port;\n\t\tlistNet.push_back(tmp);\n\n\t\treturn true;\n\t}\n\telse\n\t\treturn false;\n}\nbool ListPwd::addAppPassword(std::string stripped_name)\n{\n\t\/\/Parse the file's name\n\tunsigned int pos_at=stripped_name.find_first_of(\"@\");\n\n\t\/\/if it has found the separators\n\tif(pos_at!=std::string::npos)\n\t{\n\t\tstd::string user=stripped_name.substr(0,pos_at);\n\t\tstd::string app=stripped_name.substr(pos_at+1);\n\n\t\t\/\/Add the content to pwdList\n\t\tappList tmp;\n\t\ttmp.app=app;\n\t\ttmp.user=user;\n\t\tlistApp.push_back(tmp);\n\n\t\treturn true;\n\t}\n\telse\n\t\treturn false;\n}\n\nbool ListPwd::addItemPassword(std::string stripped_name)\n{\n\tif(\tstripped_name.size()>0)\n\t{\n\t\t\/\/Add the content to pwdList\n\t\titemList tmp;\n\t\ttmp.key=stripped_name;\n\t\tlistItem.push_back(tmp);\n\n\t\treturn true;\n\t}\n\telse\n\t\treturn false;\n}\n\nbool ListPwd::parseFileName(std::string filename, unsigned int entry_types, unsigned int flags)\n{\n\tstd::string prefix_net=prefix(ppk_network);\n\tstd::string prefix_app=prefix(ppk_application);\n\tstd::string prefix_item=prefix(ppk_item);\n\n\tif(filename.size() > prefix_net.size() && strncmp(filename.c_str(), prefix_net.c_str(), prefix_net.size())==0)\n\t\treturn (entry_types|ppk_network)>0 && addNetworkPassword(filename.substr(prefix_net.size()));\n\telse if(filename.size() > prefix_app.size() && strncmp(filename.c_str(), prefix_app.c_str(), prefix_app.size())==0)\n\t\treturn (entry_types|ppk_application)>0 && addAppPassword(filename.substr(prefix_app.size()));\n\telse if(filename.size() > prefix_item.size() && strncmp(filename.c_str(), prefix_item.c_str(), prefix_item.size())==0)\n\t\treturn (entry_types|ppk_item)>0 && addItemPassword(filename.substr(prefix_item.size()));\n\telse\n\t\treturn false;\n}\n\n\t\nunsigned int ListPwd::updateDataBase(const char* baseKey, unsigned int entry_types, unsigned int flags)\n{\t\n\tHKEY hk;\n\tunsigned int pwdCount=0;\n\tstatic char name[101];\n\t\n\t\/\/Clear needed buffers\n\tif((entry_types&ppk_network)>0)\n\t\tlistNet.clear();\n\tif((entry_types&ppk_application)>0)\n\t\tlistApp.clear();\n\tif((entry_types&ppk_item)>0)\t\n\t\tlistItem.clear();\n\t\n\tif(!RegOpenKeyEx(HKEY_LOCAL_MACHINE, baseKey, 0, KEY_ALL_ACCESS, &hk))\n\t{\n\t\tint i=0, res;\n\t\tdo\n\t\t{\n\t\t\tDWORD nameSize=sizeof(name)-1;\n\t\t\tres=RegEnumValue(hk, i, name, &nameSize, 0, 0, NULL, NULL);\n\n\t\t\tif(parseFileName(name, entry_types, flags))\n\t\t\t\tpwdCount++;\n\t\t\t\t\n\t\t\ti++;\n\t\t}while(res==ERROR_SUCCESS);\n\t}\n\t\n\treturn pwdCount;\n}\n\nunsigned int ListPwd::copyDBToPwdList(unsigned int entry_types, ppk_entry *entryList, unsigned int nbEntries)\n{\n\tunsigned int len=0;\n\t\n\tif((entry_types&ppk_network)>0)\n\t\tlen+=copyNetworkToPwdList(entryList+len, nbEntries-len);\n\tif((entry_types&ppk_application)>0)\n\t\tlen+=copyApplicationToPwdList(entryList+len, nbEntries-len);\n\tif((entry_types&ppk_item)>0)\n\t\tlen+=copyItemToPwdList(entryList+len, nbEntries-len);\n\n\treturn len;\n}\nunsigned int ListPwd::copyNetworkToPwdList(ppk_entry *entryList, unsigned int nbEntries)\n{\n\tint i;\n\tfor(i=0;i<listNet.size() && i<nbEntries;i++)\n\t{\n\t\tentryList[i].type=ppk_network;\n\t\tentryList[i].net.host=listNet[i].host.c_str();\n\t\tentryList[i].net.login=listNet[i].user.c_str();\n\t\tentryList[i].net.port=listNet[i].port;\n\t}\n\n\treturn i;\n}\nunsigned int ListPwd::copyApplicationToPwdList(ppk_entry *entryList, unsigned int nbEntries)\n{\n\tint i;\n\tfor(i=0;i<listApp.size() && i<nbEntries;i++)\n\t{\n\t\tentryList[i].type=ppk_application;\n\t\tentryList[i].app.app_name=listApp[i].app.c_str();\n\t\tentryList[i].app.username=listApp[i].user.c_str();\n\t}\n\n\treturn i;\n}\n\nunsigned int ListPwd::copyItemToPwdList(ppk_entry *entryList, unsigned int nbEntries)\n{\n\tint i;\n\tfor(i=0;i<listItem.size() && i<nbEntries;i++)\n\t{\n\t\tentryList[i].type=ppk_item;\n\t\tentryList[i].item=listItem[i].key.c_str();\n\t}\n\n\treturn i;\n}\n\nunsigned int ListPwd::getEntryListCount(const char* baseKey, unsigned int entry_types, unsigned int flags)\n{\n\t\/\/Update the database and return how many password were found\n\treturn updateDataBase(baseKey, entry_types, flags);\n}\n\nunsigned int ListPwd::getEntryList(const char* baseKey, unsigned int entry_types, ppk_entry *entryList, unsigned int nbEntries, unsigned int flags)\n{\n\t\/\/Update the database before putting data into pwdList\n\tupdateDataBase(baseKey, entry_types, flags);\n\n\t\/\/Put data into pwdList\n\treturn copyDBToPwdList(entry_types, entryList, nbEntries);\n}\n<commit_msg>beta 1 version<commit_after>#include \"list_pwd.h\"\n#include <string.h>\n#include <string>\n#include <iostream>\n#include <sstream>\n\n#include <windows.h>\n\nstd::string ListPwd::prefix(ppk_entry_type type)\n{\n\tstatic const char* ppk_network_string = \"ppasskeeper_network:\/\/\";\n\tstatic const char* ppk_app_string = \"ppasskeeper_app:\/\/\";\n\tstatic const char* ppk_item_string = \"ppasskeeper_item:\/\/\";\n\n\tswitch(type)\n\t{\n\t\tcase ppk_network:\n\t\t\treturn ppk_network_string;\n\t\t\tbreak;\n\t\tcase ppk_application:\n\t\t\treturn ppk_app_string;\n\t\t\tbreak;\n\t\tcase ppk_item:\n\t\t\treturn ppk_item_string;\n\t\t\tbreak;\n\t}\n\treturn std::string();\n}\n\nbool ListPwd::addNetworkPassword(std::string stripped_name)\n{\n\t\/\/Parse the file's name\n\tunsigned int pos_at=stripped_name.find_first_of(\"@\");\n\tunsigned int pos_sc=stripped_name.find(\":\",pos_at+1);\n\n\t\/\/if it has found the separators\n\tif(pos_at!=std::string::npos && pos_sc!=std::string::npos)\n\t{\n\t\tstd::string user=stripped_name.substr(0,pos_at);\n\t\tstd::string host=stripped_name.substr(pos_at+1,pos_sc-(pos_at+1));\n\t\tstd::string s_port=stripped_name.substr(pos_sc+1);\n\n\t\t\/\/Get the port into a number\n\t\tunsigned int port;\n\t\tstd::istringstream i(s_port);\n\t\tif (!(i >> port))\n\t\t\treturn false;\n\n\t\t\/\/Add the content to pwdList\n\t\tnetworkList tmp;\n\t\ttmp.host=host;\n\t\ttmp.user=user;\n\t\ttmp.port=port;\n\t\tlistNet.push_back(tmp);\n\n\t\treturn true;\n\t}\n\telse\n\t\treturn false;\n}\nbool ListPwd::addAppPassword(std::string stripped_name)\n{\n\t\/\/Parse the file's name\n\tunsigned int pos_at=stripped_name.find_first_of(\"@\");\n\n\t\/\/if it has found the separators\n\tif(pos_at!=std::string::npos)\n\t{\n\t\tstd::string user=stripped_name.substr(0,pos_at);\n\t\tstd::string app=stripped_name.substr(pos_at+1);\n\n\t\t\/\/Add the content to pwdList\n\t\tappList tmp;\n\t\ttmp.app=app;\n\t\ttmp.user=user;\n\t\tlistApp.push_back(tmp);\n\n\t\treturn true;\n\t}\n\telse\n\t\treturn false;\n}\n\nbool ListPwd::addItemPassword(std::string stripped_name)\n{\n\tif(\tstripped_name.size()>0)\n\t{\n\t\t\/\/Add the content to pwdList\n\t\titemList tmp;\n\t\ttmp.key=stripped_name;\n\t\tlistItem.push_back(tmp);\n\n\t\treturn true;\n\t}\n\telse\n\t\treturn false;\n}\n\nbool ListPwd::parseFileName(std::string filename, unsigned int entry_types, unsigned int flags)\n{\n\tstd::string prefix_net=prefix(ppk_network);\n\tstd::string prefix_app=prefix(ppk_application);\n\tstd::string prefix_item=prefix(ppk_item);\n\n\tif(filename.size() > prefix_net.size() && strncmp(filename.c_str(), prefix_net.c_str(), prefix_net.size())==0)\n\t\treturn (entry_types|ppk_network)>0 && addNetworkPassword(filename.substr(prefix_net.size()));\n\telse if(filename.size() > prefix_app.size() && strncmp(filename.c_str(), prefix_app.c_str(), prefix_app.size())==0)\n\t\treturn (entry_types|ppk_application)>0 && addAppPassword(filename.substr(prefix_app.size()));\n\telse if(filename.size() > prefix_item.size() && strncmp(filename.c_str(), prefix_item.c_str(), prefix_item.size())==0)\n\t\treturn (entry_types|ppk_item)>0 && addItemPassword(filename.substr(prefix_item.size()));\n\telse\n\t\treturn false;\n}\n\n\t\nunsigned int ListPwd::updateDataBase(const char* baseKey, unsigned int entry_types, unsigned int flags)\n{\t\n\tHKEY hk;\n\tunsigned int pwdCount=0;\n\tstatic char name[101];\n\t\n\t\/\/Clear needed buffers\n\tif((entry_types&ppk_network)>0)\n\t\tlistNet.clear();\n\tif((entry_types&ppk_application)>0)\n\t\tlistApp.clear();\n\tif((entry_types&ppk_item)>0)\t\n\t\tlistItem.clear();\n\t\n\tif(!RegOpenKeyEx(HKEY_LOCAL_MACHINE, baseKey, 0, KEY_ALL_ACCESS, &hk))\n\t{\n\t\tint i=0, res;\n\t\tdo\n\t\t{\n\t\t\tDWORD nameSize=sizeof(name)-1;\n\t\t\tres=RegEnumValue(hk, i, name, &nameSize, 0, 0, NULL, NULL);\n\n\t\t\tif(res==ERROR_SUCCESS && parseFileName(name, entry_types, flags))\n\t\t\t\tpwdCount++;\n\t\t\t\t\n\t\t\ti++;\n\t\t}while(res==ERROR_SUCCESS);\n\t}\n\t\n\treturn pwdCount;\n}\n\nunsigned int ListPwd::copyDBToPwdList(unsigned int entry_types, ppk_entry *entryList, unsigned int nbEntries)\n{\n\tunsigned int len=0;\n\t\n\tif((entry_types&ppk_network)>0)\n\t\tlen+=copyNetworkToPwdList(entryList+len, nbEntries-len);\n\tif((entry_types&ppk_application)>0)\n\t\tlen+=copyApplicationToPwdList(entryList+len, nbEntries-len);\n\tif((entry_types&ppk_item)>0)\n\t\tlen+=copyItemToPwdList(entryList+len, nbEntries-len);\n\n\treturn len;\n}\nunsigned int ListPwd::copyNetworkToPwdList(ppk_entry *entryList, unsigned int nbEntries)\n{\n\tint i;\n\tfor(i=0;i<listNet.size() && i<nbEntries;i++)\n\t{\n\t\tentryList[i].type=ppk_network;\n\t\tentryList[i].net.host=listNet[i].host.c_str();\n\t\tentryList[i].net.login=listNet[i].user.c_str();\n\t\tentryList[i].net.port=listNet[i].port;\n\t}\n\n\treturn i;\n}\nunsigned int ListPwd::copyApplicationToPwdList(ppk_entry *entryList, unsigned int nbEntries)\n{\n\tint i;\n\tfor(i=0;i<listApp.size() && i<nbEntries;i++)\n\t{\n\t\tentryList[i].type=ppk_application;\n\t\tentryList[i].app.app_name=listApp[i].app.c_str();\n\t\tentryList[i].app.username=listApp[i].user.c_str();\n\t}\n\n\treturn i;\n}\n\nunsigned int ListPwd::copyItemToPwdList(ppk_entry *entryList, unsigned int nbEntries)\n{\n\tint i;\n\tfor(i=0;i<listItem.size() && i<nbEntries;i++)\n\t{\n\t\tentryList[i].type=ppk_item;\n\t\tentryList[i].item=listItem[i].key.c_str();\n\t}\n\n\treturn i;\n}\n\nunsigned int ListPwd::getEntryListCount(const char* baseKey, unsigned int entry_types, unsigned int flags)\n{\n\t\/\/Update the database and return how many password were found\n\treturn updateDataBase(baseKey, entry_types, flags);\n}\n\nunsigned int ListPwd::getEntryList(const char* baseKey, unsigned int entry_types, ppk_entry *entryList, unsigned int nbEntries, unsigned int flags)\n{\n\t\/\/Update the database before putting data into pwdList\n\tupdateDataBase(baseKey, entry_types, flags);\n\n\t\/\/Put data into pwdList\n\treturn copyDBToPwdList(entry_types, entryList, nbEntries);\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef GF2_UTIL_HPP\n#define GF2_UTIL_HPP\n\n#include <vector>\n#include \"Eigen\/Dense\"\n#include \"opencv2\/core\/core.hpp\"\n\nnamespace GF2 {\nnamespace util {\n\ntemplate <typename Scalar>\ninline ::cv::Point3f\nhsv2rgb( ::cv::Point3_<Scalar> const& in )\n{\n    double      hh, p, q, t, ff;\n    long        i;\n    ::cv::Point3f out;\n\n    if ( in.y <= 0.f ) \/\/ < is bogus, just shuts up warnings\n    {\n        out.x = in.z;\n        out.y = in.z;\n        out.z = in.z;\n        return out;\n    }\n\n    hh = in.x;\n    if ( hh >= 360.f ) hh = 0.f;\n    hh \/= 60.f;\n    i = (long)hh;\n    ff = hh - i;\n    p = in.z * (1.f - in.y);\n    q = in.z * (1.f - (in.y * ff));\n    t = in.z * (1.f - (in.y * (1.f - ff)));\n\n    switch(i) {\n        case 0:\n            out.x = in.z;\n            out.y = t;\n            out.z = p;\n            break;\n        case 1:\n            out.x = q;\n            out.y = in.z;\n            out.z = p;\n            break;\n        case 2:\n            out.x = p;\n            out.y = in.z;\n            out.z = t;\n            break;\n\n        case 3:\n            out.x = p;\n            out.y = q;\n            out.z = in.z;\n            break;\n        case 4:\n            out.x = t;\n            out.y = p;\n            out.z = in.z;\n            break;\n\n        case 5:\n        default:\n            out.x = in.z;\n            out.y = p;\n            out.z = q;\n            break;\n    }\n\n    return out;\n}\n\n\/\/ generates n different colours\n\/\/ assumes hue [0, 360), saturation [0, 100), lightness [0, 100)\ntemplate <typename Scalar>\ninline std::vector< ::cv::Point3f >\nnColoursCv(int n, Scalar scale, bool random_shuffle, float min_value = 50.f, float min_saturation = 90.f )\n{\n    std::vector< ::cv::Point3f > out;\n    \/\/srand(time(NULL));\n\n    float step = 360. \/ n;\n    const float saturation_rest = 100.f - min_saturation;\n    const float value_rest = 100.f - min_value;\n    for ( int i = 0; i < n; ++i )\n    {\n        ::cv::Point3f c;\n        c.x = i * step; \/\/ hue\n        c.y = (min_saturation + rand()\/(float)RAND_MAX * saturation_rest) \/ 100.f; \/\/ saturation\n        c.z = (min_value      + rand()\/(float)RAND_MAX * value_rest     ) \/ 100.f; \/\/ value\n\n        \/\/ convert and store\n        out.push_back( hsv2rgb(c) * scale );\n    }\n\n    if ( random_shuffle )\n        std::random_shuffle( out.begin(), out.end() );\n\n    return out;\n}\n\ntemplate <typename Scalar>\ninline std::vector< ::Eigen::Vector3f >\nnColoursEigen( int n, Scalar scale, bool random_shuffle )\n{\n    typedef std::vector< ::cv::Point3f > CvPointsT;\n    CvPointsT colours = nColoursCv( n, scale, random_shuffle );\n    std::vector< ::Eigen::Vector3f > colours_eigen;\n    \/\/for ( CvPointsT::value_type const& colour : colours )\n    for ( CvPointsT::const_iterator it = colours.begin(); it != colours.end(); ++it )\n    {\n        \/\/colours_eigen.push_back( (Eigen::Vector3f() << colour.x, colour.y, colour.z).finished() );\n        colours_eigen.push_back( (Eigen::Vector3f() << it->x, it->y, it->z).finished() );\n    }\n\n    return colours_eigen;\n}\n\ninline std::vector< ::Eigen::Vector3f >\npaletteLightColoursEigen()\n{\n    \/\/ don't have template parameters, since we return Vector3f....\n    std::vector< ::Eigen::Vector3f > colours_eigen;\n    colours_eigen.resize(7);\n    colours_eigen [0] << 242.f, 175.f, 173.f;\n    colours_eigen [1] << 217.f, 228.f, 170.f;\n    colours_eigen [2] << 184.f, 210.f, 236.f;\n    colours_eigen [3] << 243.f, 209.f, 176.f;\n    colours_eigen [4] << 213.f, 178.f, 212.f;\n    colours_eigen [5] << 221.f, 185.f, 169.f;\n    colours_eigen [6] << 235.f, 192.f, 218.f;\n\n    return colours_eigen;\n}\n\ninline Eigen::Vector3f\npaletteLightNeutralColour(){\n    return Eigen::Vector3f(204.f, 204.f, 204.f);\n}\n\ninline std::vector< ::Eigen::Vector3f >\npaletteMediumColoursEigen()\n{\n    \/\/ don't have template parameters, since we return Vector3f....\n    std::vector< ::Eigen::Vector3f > colours_eigen;\n    colours_eigen.resize(7);\n    colours_eigen [0] << 241.f, 090.f, 096.f;\n    colours_eigen [1] << 122.f, 195.f, 106.f;\n    colours_eigen [2] << 090.f, 155.f, 212.f;\n    colours_eigen [3] << 250.f, 167.f, 091.f;\n    colours_eigen [4] << 158.f, 103.f, 171.f;\n    colours_eigen [5] << 206.f, 112.f, 088.f;\n    colours_eigen [6] << 215.f, 127.f, 180.f;\n\n    return colours_eigen;\n}\n\ninline Eigen::Vector3f\npaletteMediumNeutralColour(){\n    return Eigen::Vector3f(115.f, 115.f, 115.f);\n}\n\ninline std::vector< ::Eigen::Vector3f >\npaletteDarkColoursEigen()\n{\n    \/\/ don't have template parameters, since we return Vector3f....\n    std::vector< ::Eigen::Vector3f > colours_eigen;\n    colours_eigen.resize(7);\n    colours_eigen [0] << 238.f, 046.f, 047.f;\n    colours_eigen [1] << 000.f, 140.f, 072.f;\n    colours_eigen [2] << 024.f, 090.f, 169.f;\n    colours_eigen [3] << 244.f, 125.f, 035.f;\n    colours_eigen [4] << 102.f, 044.f, 145.f;\n    colours_eigen [5] << 162.f, 029.f, 033.f;\n    colours_eigen [6] << 180.f, 056.f, 148.f;\n\n    return colours_eigen;\n}\n\ninline Eigen::Vector3f\npaletteDarkNeutralColour(){\n    return Eigen::Vector3f(001.f, 002.f, 002.f);\n}\n\ninline std::string timestamp2Str()\n{\n    time_t rawtime;\n    struct tm * timeinfo;\n    char buffer [80];\n\n    time ( &rawtime );\n    timeinfo = localtime (&rawtime);\n\n    strftime ( buffer, 80, \"_%Y%m%d_%H%M\", timeinfo );\n\n    return std::string( buffer );\n} \/\/...timestamp2Str()\n\ninline int parseIteration( std::string const& input_prims_path )\n{\n    int iteration = 0;\n\n    size_t it_loc = input_prims_path.find(\"_it\");\n    if ( it_loc == std::string::npos )\n        iteration = -1;\n    else\n    {\n        iteration = atoi( input_prims_path.substr( it_loc+3,1 ).c_str() );\n    }\n\n    return iteration;\n}\n\n#if 0\ntemplate <class ExtremaT, class PrimitiveT>\nvoid printme (ExtremaT& extre, PrimitiveT& prim, std::ofstream& mstream)\n{\n    using std::endl;\n\n    mstream << extre.rbegin()->transpose() << endl;\n    mstream << extre.begin()->transpose() << endl << endl << endl;\n\n    auto mit_local = extre.begin();\n    auto mit_localn = extre.begin()+1;\n\n    for ( ; mit_localn != extre.end(); ++mit_local, ++mit_localn )\n    {\n        mstream << mit_local->transpose() << endl;\n        mstream << mit_localn->transpose() << endl << endl << endl;\n    }\n    typedef typename ExtremaT::value_type PointT;\n    typedef typename PointT::Scalar _Scalar;\n\n    PointT center (PointT::Zero());\n    std::for_each(extre.begin(), extre.end(), [&center] (const PointT& p){ center+=p; });\n    center \/= _Scalar(extre.size());\n\n    \/\/ display normal\n    mstream << center.transpose() << endl;\n    mstream << (center+prim.normal()).transpose() << endl << endl << endl;\n\n    \/\/ display normal from extrema\n    mstream << center.transpose() << endl;\n    mstream << (center+(extre[1]-extre[0]).normalized().cross((extre[2]-extre[1])).normalized()).transpose() << endl << endl << endl;\n}\n\nstd::ofstream f(\"onplanecloud.plot\");\nfor ( int i = 0; i != on_plane_cloud.size(); ++i )\n{\n    f << on_plane_cloud[i].template pos().transpose() << \"\\n\";\n}\nf.close();\nstd::ofstream f2(\"onplanecloud_normal.plot\");\nf2 << this->pos().transpose() << \"\\n\"\n   << (this->pos() + this->dir()).transpose() << \"\\n\";\nf2 << \"\\n\\n\"\n   << this->pos().transpose() << \"\\n\"\n   << (this->pos() + (minMax[2] - minMax[1]).normalized().cross( (minMax[1] - minMax[0]).normalized() ).normalized()).transpose() << \"\\n\";\n\nf2.close();\nsystem( \"gnuplot -e \\\"splot 'onplanecloud.plot' w points, 'onplanecloud_normal.plot' w lines\\\" -p\" );\n#endif\n\n} \/\/...namespace util\n} \/\/...namespace GF2\n\n#endif \/\/ GF2_UTIL_HPP\n<commit_msg>Change color order to avoir red first<commit_after>#ifndef GF2_UTIL_HPP\n#define GF2_UTIL_HPP\n\n#include <vector>\n#include \"Eigen\/Dense\"\n#include \"opencv2\/core\/core.hpp\"\n\nnamespace GF2 {\nnamespace util {\n\ntemplate <typename Scalar>\ninline ::cv::Point3f\nhsv2rgb( ::cv::Point3_<Scalar> const& in )\n{\n    double      hh, p, q, t, ff;\n    long        i;\n    ::cv::Point3f out;\n\n    if ( in.y <= 0.f ) \/\/ < is bogus, just shuts up warnings\n    {\n        out.x = in.z;\n        out.y = in.z;\n        out.z = in.z;\n        return out;\n    }\n\n    hh = in.x;\n    if ( hh >= 360.f ) hh = 0.f;\n    hh \/= 60.f;\n    i = (long)hh;\n    ff = hh - i;\n    p = in.z * (1.f - in.y);\n    q = in.z * (1.f - (in.y * ff));\n    t = in.z * (1.f - (in.y * (1.f - ff)));\n\n    switch(i) {\n        case 0:\n            out.x = in.z;\n            out.y = t;\n            out.z = p;\n            break;\n        case 1:\n            out.x = q;\n            out.y = in.z;\n            out.z = p;\n            break;\n        case 2:\n            out.x = p;\n            out.y = in.z;\n            out.z = t;\n            break;\n\n        case 3:\n            out.x = p;\n            out.y = q;\n            out.z = in.z;\n            break;\n        case 4:\n            out.x = t;\n            out.y = p;\n            out.z = in.z;\n            break;\n\n        case 5:\n        default:\n            out.x = in.z;\n            out.y = p;\n            out.z = q;\n            break;\n    }\n\n    return out;\n}\n\n\/\/ generates n different colours\n\/\/ assumes hue [0, 360), saturation [0, 100), lightness [0, 100)\ntemplate <typename Scalar>\ninline std::vector< ::cv::Point3f >\nnColoursCv(int n, Scalar scale, bool random_shuffle, float min_value = 50.f, float min_saturation = 90.f )\n{\n    std::vector< ::cv::Point3f > out;\n    \/\/srand(time(NULL));\n\n    float step = 360. \/ n;\n    const float saturation_rest = 100.f - min_saturation;\n    const float value_rest = 100.f - min_value;\n    for ( int i = 0; i < n; ++i )\n    {\n        ::cv::Point3f c;\n        c.x = i * step; \/\/ hue\n        c.y = (min_saturation + rand()\/(float)RAND_MAX * saturation_rest) \/ 100.f; \/\/ saturation\n        c.z = (min_value      + rand()\/(float)RAND_MAX * value_rest     ) \/ 100.f; \/\/ value\n\n        \/\/ convert and store\n        out.push_back( hsv2rgb(c) * scale );\n    }\n\n    if ( random_shuffle )\n        std::random_shuffle( out.begin(), out.end() );\n\n    return out;\n}\n\ntemplate <typename Scalar>\ninline std::vector< ::Eigen::Vector3f >\nnColoursEigen( int n, Scalar scale, bool random_shuffle )\n{\n    typedef std::vector< ::cv::Point3f > CvPointsT;\n    CvPointsT colours = nColoursCv( n, scale, random_shuffle );\n    std::vector< ::Eigen::Vector3f > colours_eigen;\n    \/\/for ( CvPointsT::value_type const& colour : colours )\n    for ( CvPointsT::const_iterator it = colours.begin(); it != colours.end(); ++it )\n    {\n        \/\/colours_eigen.push_back( (Eigen::Vector3f() << colour.x, colour.y, colour.z).finished() );\n        colours_eigen.push_back( (Eigen::Vector3f() << it->x, it->y, it->z).finished() );\n    }\n\n    return colours_eigen;\n}\n\ninline std::vector< ::Eigen::Vector3f >\npaletteLightColoursEigen()\n{\n    \/\/ don't have template parameters, since we return Vector3f....\n    std::vector< ::Eigen::Vector3f > colours_eigen;\n    colours_eigen.resize(7);\n    colours_eigen [0] << 184.f, 210.f, 236.f;\n    colours_eigen [1] << 217.f, 228.f, 170.f;\n    colours_eigen [2] << 242.f, 175.f, 173.f;\n    colours_eigen [3] << 243.f, 209.f, 176.f;\n    colours_eigen [4] << 213.f, 178.f, 212.f;\n    colours_eigen [5] << 221.f, 185.f, 169.f;\n    colours_eigen [6] << 235.f, 192.f, 218.f;\n\n    return colours_eigen;\n}\n\ninline Eigen::Vector3f\npaletteLightNeutralColour(){\n    return Eigen::Vector3f(204.f, 204.f, 204.f);\n}\n\ninline std::vector< ::Eigen::Vector3f >\npaletteMediumColoursEigen()\n{\n    \/\/ don't have template parameters, since we return Vector3f....\n    std::vector< ::Eigen::Vector3f > colours_eigen;\n    colours_eigen.resize(7);\n    colours_eigen [0] << 090.f, 155.f, 212.f;\n    colours_eigen [1] << 122.f, 195.f, 106.f;\n    colours_eigen [2] << 241.f, 090.f, 096.f;\n    colours_eigen [3] << 250.f, 167.f, 091.f;\n    colours_eigen [4] << 158.f, 103.f, 171.f;\n    colours_eigen [5] << 206.f, 112.f, 088.f;\n    colours_eigen [6] << 215.f, 127.f, 180.f;\n\n    return colours_eigen;\n}\n\ninline Eigen::Vector3f\npaletteMediumNeutralColour(){\n    return Eigen::Vector3f(115.f, 115.f, 115.f);\n}\n\ninline std::vector< ::Eigen::Vector3f >\npaletteDarkColoursEigen()\n{\n    \/\/ don't have template parameters, since we return Vector3f....\n    std::vector< ::Eigen::Vector3f > colours_eigen;\n    colours_eigen.resize(7);\n    colours_eigen [0] << 024.f, 090.f, 169.f;\n    colours_eigen [1] << 000.f, 140.f, 072.f;\n    colours_eigen [2] << 238.f, 046.f, 047.f;\n    colours_eigen [3] << 244.f, 125.f, 035.f;\n    colours_eigen [4] << 102.f, 044.f, 145.f;\n    colours_eigen [5] << 162.f, 029.f, 033.f;\n    colours_eigen [6] << 180.f, 056.f, 148.f;\n\n    return colours_eigen;\n}\n\ninline Eigen::Vector3f\npaletteDarkNeutralColour(){\n    return Eigen::Vector3f(001.f, 002.f, 002.f);\n}\n\ninline std::string timestamp2Str()\n{\n    time_t rawtime;\n    struct tm * timeinfo;\n    char buffer [80];\n\n    time ( &rawtime );\n    timeinfo = localtime (&rawtime);\n\n    strftime ( buffer, 80, \"_%Y%m%d_%H%M\", timeinfo );\n\n    return std::string( buffer );\n} \/\/...timestamp2Str()\n\ninline int parseIteration( std::string const& input_prims_path )\n{\n    int iteration = 0;\n\n    size_t it_loc = input_prims_path.find(\"_it\");\n    if ( it_loc == std::string::npos )\n        iteration = -1;\n    else\n    {\n        iteration = atoi( input_prims_path.substr( it_loc+3,1 ).c_str() );\n    }\n\n    return iteration;\n}\n\n#if 0\ntemplate <class ExtremaT, class PrimitiveT>\nvoid printme (ExtremaT& extre, PrimitiveT& prim, std::ofstream& mstream)\n{\n    using std::endl;\n\n    mstream << extre.rbegin()->transpose() << endl;\n    mstream << extre.begin()->transpose() << endl << endl << endl;\n\n    auto mit_local = extre.begin();\n    auto mit_localn = extre.begin()+1;\n\n    for ( ; mit_localn != extre.end(); ++mit_local, ++mit_localn )\n    {\n        mstream << mit_local->transpose() << endl;\n        mstream << mit_localn->transpose() << endl << endl << endl;\n    }\n    typedef typename ExtremaT::value_type PointT;\n    typedef typename PointT::Scalar _Scalar;\n\n    PointT center (PointT::Zero());\n    std::for_each(extre.begin(), extre.end(), [&center] (const PointT& p){ center+=p; });\n    center \/= _Scalar(extre.size());\n\n    \/\/ display normal\n    mstream << center.transpose() << endl;\n    mstream << (center+prim.normal()).transpose() << endl << endl << endl;\n\n    \/\/ display normal from extrema\n    mstream << center.transpose() << endl;\n    mstream << (center+(extre[1]-extre[0]).normalized().cross((extre[2]-extre[1])).normalized()).transpose() << endl << endl << endl;\n}\n\nstd::ofstream f(\"onplanecloud.plot\");\nfor ( int i = 0; i != on_plane_cloud.size(); ++i )\n{\n    f << on_plane_cloud[i].template pos().transpose() << \"\\n\";\n}\nf.close();\nstd::ofstream f2(\"onplanecloud_normal.plot\");\nf2 << this->pos().transpose() << \"\\n\"\n   << (this->pos() + this->dir()).transpose() << \"\\n\";\nf2 << \"\\n\\n\"\n   << this->pos().transpose() << \"\\n\"\n   << (this->pos() + (minMax[2] - minMax[1]).normalized().cross( (minMax[1] - minMax[0]).normalized() ).normalized()).transpose() << \"\\n\";\n\nf2.close();\nsystem( \"gnuplot -e \\\"splot 'onplanecloud.plot' w points, 'onplanecloud_normal.plot' w lines\\\" -p\" );\n#endif\n\n} \/\/...namespace util\n} \/\/...namespace GF2\n\n#endif \/\/ GF2_UTIL_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/\/===--- KnownMetadata.cpp - Swift Language ABI Known Metadata Objects ----===\/\/\n\/\/\n\/\/ This source file is part of the Swift.org open source project\n\/\/\n\/\/ Copyright (c) 2014 - 2017 Apple Inc. and the Swift project authors\n\/\/ Licensed under Apache License v2.0 with Runtime Library Exception\n\/\/\n\/\/ See https:\/\/swift.org\/LICENSE.txt for license information\n\/\/ See https:\/\/swift.org\/CONTRIBUTORS.txt for the list of Swift project authors\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ Definitions of some builtin metadata objects.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"swift\/Runtime\/Metadata.h\"\n#include \"swift\/Runtime\/HeapObject.h\"\n#include \"MetadataImpl.h\"\n#include \"Private.h\"\n#include <cstring>\n#include <climits>\n\nusing namespace swift;\nusing namespace metadataimpl;\n\n\/\/\/ Copy a value from one object to another based on the size in the\n\/\/\/ given type metadata.\nOpaqueValue *swift::swift_copyPOD(OpaqueValue *dest, OpaqueValue *src,\n                                  const Metadata *type) {\n  return (OpaqueValue*) memcpy(dest, src, type->getValueWitnesses()->size);\n}\n\nnamespace {\n  \/\/ A type sized and aligned the way Swift wants Int128 (and Float80\/Float128)\n  \/\/ to be sized and aligned.\n  struct alignas(16) int128_like {\n    char data[16];\n  };\n\n  struct alignas(32) int256_like {\n    char data[32];\n  };\n  struct alignas(64) int512_like {\n    char data[64];\n  };\n} \/\/ end anonymous namespace\n\n\/\/ We use explicit sizes and alignments here just in case the C ABI\n\/\/ under-aligns any or all of them.\nconst ValueWitnessTable swift::VALUE_WITNESS_SYM(Bi8_) =\n  ValueWitnessTableForBox<NativeBox<uint8_t, 1>>::table;\nconst ValueWitnessTable swift::VALUE_WITNESS_SYM(Bi16_) =\n  ValueWitnessTableForBox<NativeBox<uint16_t, 2>>::table;\nconst ValueWitnessTable swift::VALUE_WITNESS_SYM(Bi32_) =\n  ValueWitnessTableForBox<NativeBox<uint32_t, 4>>::table;\nconst ValueWitnessTable swift::VALUE_WITNESS_SYM(Bi64_) =\n  ValueWitnessTableForBox<NativeBox<uint64_t, 8>>::table;\nconst ValueWitnessTable swift::VALUE_WITNESS_SYM(Bi128_) =\n  ValueWitnessTableForBox<NativeBox<int128_like, 16>>::table;\nconst ValueWitnessTable swift::VALUE_WITNESS_SYM(Bi256_) =\n  ValueWitnessTableForBox<NativeBox<int256_like, 32>>::table;\nconst ValueWitnessTable swift::VALUE_WITNESS_SYM(Bi512_) =\n  ValueWitnessTableForBox<NativeBox<int512_like, 64>>::table;\n\n\/\/\/ The basic value-witness table for Swift object pointers.\nconst ExtraInhabitantsValueWitnessTable swift::VALUE_WITNESS_SYM(Bo) =\n  ValueWitnessTableForBox<SwiftRetainableBox>::table;\n\n\/\/\/ The basic value-witness table for Swift unowned pointers.\nconst ExtraInhabitantsValueWitnessTable swift::UNOWNED_VALUE_WITNESS_SYM(Bo) =\n  ValueWitnessTableForBox<SwiftUnownedRetainableBox>::table;\n\n\/\/\/ The basic value-witness table for Swift weak pointers.\nconst ValueWitnessTable swift::WEAK_VALUE_WITNESS_SYM(Bo) =\n  ValueWitnessTableForBox<SwiftWeakRetainableBox>::table;\n\n\/\/\/ The value-witness table for pointer-aligned unmanaged pointer types.\nconst ExtraInhabitantsValueWitnessTable swift::METATYPE_VALUE_WITNESS_SYM(Bo) =\n  ValueWitnessTableForBox<PointerPointerBox>::table;\n\n\/\/\/ The value-witness table for raw pointers.\nconst ExtraInhabitantsValueWitnessTable swift::VALUE_WITNESS_SYM(Bp) =\n  ValueWitnessTableForBox<RawPointerBox>::table;\n\n\/\/\/ The value-witness table for BridgeObject.\nconst ExtraInhabitantsValueWitnessTable swift::VALUE_WITNESS_SYM(Bb) =\n  ValueWitnessTableForBox<BridgeObjectBox>::table;\n\n\/\/\/ The value-witness table for UnsafeValueBuffer.  You can do layout\n\/\/\/ with this, but the type isn't copyable, so most of the value\n\/\/\/ operations are meaningless.\nstatic const ValueWitnessTable VALUE_WITNESS_SYM(BB) =\n  ValueWitnessTableForBox<NativeBox<ValueBuffer>>::table;\n\n#if SWIFT_OBJC_INTEROP\n\/*** Objective-C pointers ****************************************************\/\n\n\/\/ This section can reasonably be suppressed in builds that don't\n\/\/ need to support Objective-C.\n\n\/\/\/ The basic value-witness table for ObjC object pointers.\nconst ExtraInhabitantsValueWitnessTable swift::VALUE_WITNESS_SYM(BO) =\n  ValueWitnessTableForBox<ObjCRetainableBox>::table;\n\n\/\/\/ The basic value-witness table for ObjC unowned pointers.\nconst ExtraInhabitantsValueWitnessTable swift::UNOWNED_VALUE_WITNESS_SYM(BO) =\n  ValueWitnessTableForBox<ObjCUnownedRetainableBox>::table;\n\n\/\/\/ The basic value-witness table for ObjC weak pointers.\nconst ValueWitnessTable swift::WEAK_VALUE_WITNESS_SYM(BO) =\n  ValueWitnessTableForBox<ObjCWeakRetainableBox>::table;\n\n#endif\n\n\/*** Functions ***************************************************************\/\n\nnamespace {\n  struct ThickFunctionBox\n    : AggregateBox<FunctionPointerBox, SwiftRetainableBox> {\n\n    static constexpr unsigned numExtraInhabitants =\n      FunctionPointerBox::numExtraInhabitants;\n\n    static void storeExtraInhabitant(char *dest, int index) {\n      FunctionPointerBox::storeExtraInhabitant((void**) dest, index);\n    }\n\n    static int getExtraInhabitantIndex(const char *src) {\n      return FunctionPointerBox::getExtraInhabitantIndex((void * const *) src);\n    }\n  };\n} \/\/ end anonymous namespace\n\n\/\/\/ The basic value-witness table for function types.\nconst ExtraInhabitantsValueWitnessTable\n  swift::VALUE_WITNESS_SYM(FUNCTION_MANGLING) =\n    ValueWitnessTableForBox<ThickFunctionBox>::table;\n\n\/\/\/ The basic value-witness table for escaping function types.\nconst ExtraInhabitantsValueWitnessTable\n  swift::VALUE_WITNESS_SYM(NOESCAPE_FUNCTION_MANGLING) =\n    ValueWitnessTableForBox<ThickFunctionBox>::table;\n\n\/\/\/ The basic value-witness table for thin function types.\nconst ExtraInhabitantsValueWitnessTable\n  swift::VALUE_WITNESS_SYM(THIN_FUNCTION_MANGLING) =\n    ValueWitnessTableForBox<FunctionPointerBox>::table;\n\n\/*** Empty tuples ************************************************************\/\n\n\/\/\/ The basic value-witness table for empty types.\nconst ValueWitnessTable swift::VALUE_WITNESS_SYM(EMPTY_TUPLE_MANGLING) =\n  ValueWitnessTableForBox<AggregateBox<>>::table;\n\n\/*** Known metadata **********************************************************\/\n\n\/\/ Define some builtin opaque metadata.\n#define OPAQUE_METADATA(TYPE) \\\n  const FullOpaqueMetadata swift::METADATA_SYM(TYPE) = { \\\n    { &VALUE_WITNESS_SYM(TYPE) },                             \\\n    { { MetadataKind::Opaque } }                 \\\n  };\n#define BUILTIN_TYPE(Symbol, Name) \\\n  OPAQUE_METADATA(Symbol)\n#include \"swift\/Runtime\/BuiltinTypes.def\"\n\n\/\/\/ The standard metadata for the empty tuple.\nconst FullMetadata<TupleTypeMetadata> swift::\nMETADATA_SYM(EMPTY_TUPLE_MANGLING) = {\n  { &VALUE_WITNESS_SYM(EMPTY_TUPLE_MANGLING) },                 \/\/ ValueWitnesses\n  {\n    { MetadataKind::Tuple },   \/\/ Kind\n    0,                         \/\/ NumElements\n    nullptr                    \/\/ Labels\n  }\n};\n<commit_msg>runtime: Implemenation of value witness for @noescape types<commit_after>\/\/===--- KnownMetadata.cpp - Swift Language ABI Known Metadata Objects ----===\/\/\n\/\/\n\/\/ This source file is part of the Swift.org open source project\n\/\/\n\/\/ Copyright (c) 2014 - 2017 Apple Inc. and the Swift project authors\n\/\/ Licensed under Apache License v2.0 with Runtime Library Exception\n\/\/\n\/\/ See https:\/\/swift.org\/LICENSE.txt for license information\n\/\/ See https:\/\/swift.org\/CONTRIBUTORS.txt for the list of Swift project authors\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ Definitions of some builtin metadata objects.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"swift\/Runtime\/Metadata.h\"\n#include \"swift\/Runtime\/HeapObject.h\"\n#include \"MetadataImpl.h\"\n#include \"Private.h\"\n#include <cstring>\n#include <climits>\n\nusing namespace swift;\nusing namespace metadataimpl;\n\n\/\/\/ Copy a value from one object to another based on the size in the\n\/\/\/ given type metadata.\nOpaqueValue *swift::swift_copyPOD(OpaqueValue *dest, OpaqueValue *src,\n                                  const Metadata *type) {\n  return (OpaqueValue*) memcpy(dest, src, type->getValueWitnesses()->size);\n}\n\nnamespace {\n  \/\/ A type sized and aligned the way Swift wants Int128 (and Float80\/Float128)\n  \/\/ to be sized and aligned.\n  struct alignas(16) int128_like {\n    char data[16];\n  };\n\n  struct alignas(32) int256_like {\n    char data[32];\n  };\n  struct alignas(64) int512_like {\n    char data[64];\n  };\n} \/\/ end anonymous namespace\n\n\/\/ We use explicit sizes and alignments here just in case the C ABI\n\/\/ under-aligns any or all of them.\nconst ValueWitnessTable swift::VALUE_WITNESS_SYM(Bi8_) =\n  ValueWitnessTableForBox<NativeBox<uint8_t, 1>>::table;\nconst ValueWitnessTable swift::VALUE_WITNESS_SYM(Bi16_) =\n  ValueWitnessTableForBox<NativeBox<uint16_t, 2>>::table;\nconst ValueWitnessTable swift::VALUE_WITNESS_SYM(Bi32_) =\n  ValueWitnessTableForBox<NativeBox<uint32_t, 4>>::table;\nconst ValueWitnessTable swift::VALUE_WITNESS_SYM(Bi64_) =\n  ValueWitnessTableForBox<NativeBox<uint64_t, 8>>::table;\nconst ValueWitnessTable swift::VALUE_WITNESS_SYM(Bi128_) =\n  ValueWitnessTableForBox<NativeBox<int128_like, 16>>::table;\nconst ValueWitnessTable swift::VALUE_WITNESS_SYM(Bi256_) =\n  ValueWitnessTableForBox<NativeBox<int256_like, 32>>::table;\nconst ValueWitnessTable swift::VALUE_WITNESS_SYM(Bi512_) =\n  ValueWitnessTableForBox<NativeBox<int512_like, 64>>::table;\n\n\/\/\/ The basic value-witness table for Swift object pointers.\nconst ExtraInhabitantsValueWitnessTable swift::VALUE_WITNESS_SYM(Bo) =\n  ValueWitnessTableForBox<SwiftRetainableBox>::table;\n\n\/\/\/ The basic value-witness table for Swift unowned pointers.\nconst ExtraInhabitantsValueWitnessTable swift::UNOWNED_VALUE_WITNESS_SYM(Bo) =\n  ValueWitnessTableForBox<SwiftUnownedRetainableBox>::table;\n\n\/\/\/ The basic value-witness table for Swift weak pointers.\nconst ValueWitnessTable swift::WEAK_VALUE_WITNESS_SYM(Bo) =\n  ValueWitnessTableForBox<SwiftWeakRetainableBox>::table;\n\n\/\/\/ The value-witness table for pointer-aligned unmanaged pointer types.\nconst ExtraInhabitantsValueWitnessTable swift::METATYPE_VALUE_WITNESS_SYM(Bo) =\n  ValueWitnessTableForBox<PointerPointerBox>::table;\n\n\/\/\/ The value-witness table for raw pointers.\nconst ExtraInhabitantsValueWitnessTable swift::VALUE_WITNESS_SYM(Bp) =\n  ValueWitnessTableForBox<RawPointerBox>::table;\n\n\/\/\/ The value-witness table for BridgeObject.\nconst ExtraInhabitantsValueWitnessTable swift::VALUE_WITNESS_SYM(Bb) =\n  ValueWitnessTableForBox<BridgeObjectBox>::table;\n\n\/\/\/ The value-witness table for UnsafeValueBuffer.  You can do layout\n\/\/\/ with this, but the type isn't copyable, so most of the value\n\/\/\/ operations are meaningless.\nstatic const ValueWitnessTable VALUE_WITNESS_SYM(BB) =\n  ValueWitnessTableForBox<NativeBox<ValueBuffer>>::table;\n\n#if SWIFT_OBJC_INTEROP\n\/*** Objective-C pointers ****************************************************\/\n\n\/\/ This section can reasonably be suppressed in builds that don't\n\/\/ need to support Objective-C.\n\n\/\/\/ The basic value-witness table for ObjC object pointers.\nconst ExtraInhabitantsValueWitnessTable swift::VALUE_WITNESS_SYM(BO) =\n  ValueWitnessTableForBox<ObjCRetainableBox>::table;\n\n\/\/\/ The basic value-witness table for ObjC unowned pointers.\nconst ExtraInhabitantsValueWitnessTable swift::UNOWNED_VALUE_WITNESS_SYM(BO) =\n  ValueWitnessTableForBox<ObjCUnownedRetainableBox>::table;\n\n\/\/\/ The basic value-witness table for ObjC weak pointers.\nconst ValueWitnessTable swift::WEAK_VALUE_WITNESS_SYM(BO) =\n  ValueWitnessTableForBox<ObjCWeakRetainableBox>::table;\n\n#endif\n\n\/*** Functions ***************************************************************\/\n\nnamespace {\n  \/\/ @escaping function types.\n  struct ThickFunctionBox\n    : AggregateBox<FunctionPointerBox, SwiftRetainableBox> {\n\n    static constexpr unsigned numExtraInhabitants =\n      FunctionPointerBox::numExtraInhabitants;\n\n    static void storeExtraInhabitant(char *dest, int index) {\n      FunctionPointerBox::storeExtraInhabitant((void**) dest, index);\n    }\n\n    static int getExtraInhabitantIndex(const char *src) {\n      return FunctionPointerBox::getExtraInhabitantIndex((void * const *) src);\n    }\n  };\n  \/\/\/ @noescape function types.\n  struct TrivialThickFunctionBox\n      : AggregateBox<FunctionPointerBox, RawPointerBox> {\n\n    static constexpr unsigned numExtraInhabitants =\n        FunctionPointerBox::numExtraInhabitants;\n\n    static void storeExtraInhabitant(char *dest, int index) {\n      FunctionPointerBox::storeExtraInhabitant((void **)dest, index);\n    }\n\n    static int getExtraInhabitantIndex(const char *src) {\n      return FunctionPointerBox::getExtraInhabitantIndex((void *const *)src);\n    }\n  };\n} \/\/ end anonymous namespace\n\n\/\/\/ The basic value-witness table for @noescape function types.\nconst ExtraInhabitantsValueWitnessTable\n  swift::VALUE_WITNESS_SYM(FUNCTION_MANGLING) =\n    ValueWitnessTableForBox<ThickFunctionBox>::table;\n\n\/\/\/ The basic value-witness table for escaping function types.\nconst ExtraInhabitantsValueWitnessTable\n  swift::VALUE_WITNESS_SYM(NOESCAPE_FUNCTION_MANGLING) =\n    ValueWitnessTableForBox<TrivialThickFunctionBox>::table;\n\n\/\/\/ The basic value-witness table for thin function types.\nconst ExtraInhabitantsValueWitnessTable\n  swift::VALUE_WITNESS_SYM(THIN_FUNCTION_MANGLING) =\n    ValueWitnessTableForBox<FunctionPointerBox>::table;\n\n\/*** Empty tuples ************************************************************\/\n\n\/\/\/ The basic value-witness table for empty types.\nconst ValueWitnessTable swift::VALUE_WITNESS_SYM(EMPTY_TUPLE_MANGLING) =\n  ValueWitnessTableForBox<AggregateBox<>>::table;\n\n\/*** Known metadata **********************************************************\/\n\n\/\/ Define some builtin opaque metadata.\n#define OPAQUE_METADATA(TYPE) \\\n  const FullOpaqueMetadata swift::METADATA_SYM(TYPE) = { \\\n    { &VALUE_WITNESS_SYM(TYPE) },                             \\\n    { { MetadataKind::Opaque } }                 \\\n  };\n#define BUILTIN_TYPE(Symbol, Name) \\\n  OPAQUE_METADATA(Symbol)\n#include \"swift\/Runtime\/BuiltinTypes.def\"\n\n\/\/\/ The standard metadata for the empty tuple.\nconst FullMetadata<TupleTypeMetadata> swift::\nMETADATA_SYM(EMPTY_TUPLE_MANGLING) = {\n  { &VALUE_WITNESS_SYM(EMPTY_TUPLE_MANGLING) },                 \/\/ ValueWitnesses\n  {\n    { MetadataKind::Tuple },   \/\/ Kind\n    0,                         \/\/ NumElements\n    nullptr                    \/\/ Labels\n  }\n};\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\n#include \"..\/itkOptBrent1D.h\"\n#include \"..\/itkOptimizer1D.h\"\n#include \"..\/UserFunc.h\"\n\nclass MyFunc:\n  public itk::UserFunc< double, double > \n  {\n  public:\n    MyFunc( )\n      {\n      };\n    double value( double x )\n      {\n      return vcl_sin(x);\n      };\n  };\n\nclass MyFuncD:\n  public itk::UserFunc< double, double > \n  {\n  public:\n    MyFuncD( )\n      {\n      };\n    double value( double x )\n      {\n      return vcl_cos(x);\n      };\n  };\n\nint itkOptBrentTest( int itkNotUsed(argc), char **itkNotUsed(argv) )\n{\n  double epsilon = 0.000001;\n\n  MyFunc * myFunc = new MyFunc();\n  MyFuncD * myFuncD = new MyFuncD();\n  itk::OptBrent1D * opt = new itk::OptBrent1D( myFunc, myFuncD );\n\n  opt->smallDouble( epsilon );\n\n  MyFunc * myFunc2 = new MyFunc();\n  MyFuncD * myFuncD2 = new MyFuncD();\n  opt->use( myFunc2, myFuncD2 );\n\n  delete myFunc;\n\n  int returnStatus = EXIT_SUCCESS;\n\n  opt->xMin( -3.5 );\n  if( opt->xMin() != -3.5 )\n    {\n    std::cout << \"xMin should be -1 and not \" << opt->xMin() << std::endl;\n    returnStatus = EXIT_FAILURE;\n    }\n\n  opt->xMax( 3.5 );\n  if( opt->xMax() != 3.5 )\n    {\n    std::cout << \"xMax should be 1 and not \" << opt->xMax() << std::endl;\n    returnStatus = EXIT_FAILURE;\n    }\n\n  opt->xStep( 0.1 );\n  if( opt->xStep() != 0.1 )\n    {\n    std::cout << \"xStep should be 0.1 and not \" << opt->xStep() \n      << std::endl;\n    returnStatus = EXIT_FAILURE;\n    }\n\n  opt->tolerance( 0.000001 );\n  if( opt->tolerance() != 0.000001 )\n    {\n    std::cout << \"tolerance should be 0.001 and not \" << opt->tolerance() \n      << std::endl;\n    returnStatus = EXIT_FAILURE;\n    }\n\n  opt->maxIterations( 300 );\n  if( opt->maxIterations() != 300 )\n    {\n    std::cout << \"maxIterations should be 100 and not \" \n      << opt->maxIterations() << std::endl;\n    returnStatus = EXIT_FAILURE;\n    }\n\n  opt->searchForMin( true );\n  if( !opt->searchForMin() )\n    {\n    std::cout << \"searchForMin should be false and not true.\" << std::endl;\n    returnStatus = EXIT_FAILURE;\n    }\n\n  double x = 0.01;\n  double xVal = 0;\n  if( !opt->extreme( &x, &xVal ) )\n    {\n    std::cout << \"Optimization failed!\" << std::endl;\n    returnStatus = EXIT_FAILURE;\n    }\n\n  double idealX = vnl_math::pi \/ 2;\n  if( vnl_math_abs( idealX - x ) > epsilon )\n    {\n    std::cout << \"Optimization not within tolerance!  x=\" << x \n      << \" diff=\" << vnl_math_abs( idealX - x ) << std::endl;\n    returnStatus = EXIT_FAILURE;\n    }\n\n  if( vnl_math_abs( 1-xVal ) > epsilon )\n    {\n    std::cout << \"Optimization not within tolerance!  xVal=\" << xVal \n      << std::endl;\n    returnStatus = EXIT_FAILURE;\n    }\n\n  delete opt;\n  delete myFunc2;\n\n  return returnStatus;\n}\n\n<commit_msg>BUG: Fixed test to support search for minimum.<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\n#include \"..\/itkOptBrent1D.h\"\n#include \"..\/itkOptimizer1D.h\"\n#include \"..\/UserFunc.h\"\n\nclass MyFunc:\n  public itk::UserFunc< double, double > \n  {\n  public:\n    MyFunc( )\n      {\n      };\n    double value( double x )\n      {\n      return vcl_sin(x);\n      };\n  };\n\nclass MyFuncD:\n  public itk::UserFunc< double, double > \n  {\n  public:\n    MyFuncD( )\n      {\n      };\n    double value( double x )\n      {\n      return vcl_cos(x);\n      };\n  };\n\nint itkOptBrentTest( int itkNotUsed(argc), char **itkNotUsed(argv) )\n{\n  double epsilon = 0.000001;\n\n  MyFunc * myFunc = new MyFunc();\n  MyFuncD * myFuncD = new MyFuncD();\n  itk::OptBrent1D * opt = new itk::OptBrent1D( myFunc, myFuncD );\n\n  opt->smallDouble( epsilon );\n\n  MyFunc * myFunc2 = new MyFunc();\n  MyFuncD * myFuncD2 = new MyFuncD();\n  opt->use( myFunc2, myFuncD2 );\n\n  delete myFunc;\n  delete myFuncD;\n\n  int returnStatus = EXIT_SUCCESS;\n\n  opt->xMin( -3.5 );\n  if( opt->xMin() != -3.5 )\n    {\n    std::cout << \"xMin should be -1 and not \" << opt->xMin() << std::endl;\n    returnStatus = EXIT_FAILURE;\n    }\n\n  opt->xMax( 3.5 );\n  if( opt->xMax() != 3.5 )\n    {\n    std::cout << \"xMax should be 1 and not \" << opt->xMax() << std::endl;\n    returnStatus = EXIT_FAILURE;\n    }\n\n  opt->xStep( 0.1 );\n  if( opt->xStep() != 0.1 )\n    {\n    std::cout << \"xStep should be 0.1 and not \" << opt->xStep() \n      << std::endl;\n    returnStatus = EXIT_FAILURE;\n    }\n\n  opt->tolerance( 0.000001 );\n  if( opt->tolerance() != 0.000001 )\n    {\n    std::cout << \"tolerance should be 0.001 and not \" << opt->tolerance() \n      << std::endl;\n    returnStatus = EXIT_FAILURE;\n    }\n\n  opt->maxIterations( 300 );\n  if( opt->maxIterations() != 300 )\n    {\n    std::cout << \"maxIterations should be 100 and not \" \n      << opt->maxIterations() << std::endl;\n    returnStatus = EXIT_FAILURE;\n    }\n\n  opt->searchForMin( true );\n  if( !opt->searchForMin() )\n    {\n    std::cout << \"searchForMin should be false and not true.\" << std::endl;\n    returnStatus = EXIT_FAILURE;\n    }\n\n  double x = 0.01;\n  double xVal = 0;\n  if( !opt->extreme( &x, &xVal ) )\n    {\n    std::cout << \"Optimization failed!\" << std::endl;\n    returnStatus = EXIT_FAILURE;\n    }\n\n  double idealX = - vnl_math::pi \/ 2;\n  if( vnl_math_abs( idealX - x ) > epsilon )\n    {\n    std::cout << \"Optimization not within tolerance!  x=\" << x \n      << \" diff=\" << vnl_math_abs( idealX - x ) << std::endl;\n    returnStatus = EXIT_FAILURE;\n    }\n\n  if( vnl_math_abs( -1 - xVal ) > epsilon )\n    {\n    std::cout << \"Optimization not within tolerance!  xVal=\" << xVal \n      << std::endl;\n    returnStatus = EXIT_FAILURE;\n    }\n\n  delete opt;\n  delete myFunc2;\n  delete myFuncD2;\n\n  return returnStatus;\n}\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>[ReleaseDevirtualizer] fix non-detriministic crash.<commit_after><|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_ADAPTED_HPP\n#define BOOST_BRIGAND_ADAPTED_HPP\n\n#include <brigand\/adapted\/integral_list.hpp>\n#include <brigand\/adapted\/list.hpp>\n#include <brigand\/adapted\/pair.hpp>\n#include <brigand\/adapted\/tuple.hpp>\n\n#if !defined(BRIGAND_NO_BOOST_SUPPORT)\n#include <brigand\/adapted\/fusion.hpp>\n#include <brigand\/adapted\/variant.hpp>\n#endif\n#endif\n<commit_msg>Delete adapted.hpp<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: verttexttbxctrl.cxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 00:53: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#pragma hdrstop\n\n#include \"dialmgr.hxx\"\n#include \"dialogs.hrc\"\n\n#ifndef _SVX_VERT_TEXT_TBXCTRL_HXX\n#include <verttexttbxctrl.hxx>\n#endif\n#ifndef _SVTOOLS_LANGUAGEOPTIONS_HXX\n#include <svtools\/languageoptions.hxx>\n#endif\n#ifndef _SFXAPP_HXX\n#include <sfx2\/app.hxx>\n#endif\n#ifndef _SFXENUMITEM_HXX\n#include <svtools\/eitem.hxx>\n#endif\n#ifndef _SV_TOOLBOX_HXX\n#include <vcl\/toolbox.hxx>\n#endif\n#include <rtl\/ustring.hxx>\n\nSFX_IMPL_TOOLBOX_CONTROL(SvxCTLTextTbxCtrl, SfxBoolItem);\nSFX_IMPL_TOOLBOX_CONTROL(SvxVertTextTbxCtrl, SfxBoolItem);\n\n\/\/ -----------------------------27.04.01 15:50--------------------------------\n\nSvxCTLTextTbxCtrl::SvxCTLTextTbxCtrl(USHORT nSlotId, USHORT nId, ToolBox& rTbx ) :\n    SvxVertCTLTextTbxCtrl( nSlotId, nId, rTbx )\n{\n    SetVert(FALSE);\n    addStatusListener( rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \".uno:CTLFontState\" )));\n}\n\nSvxVertTextTbxCtrl::SvxVertTextTbxCtrl( USHORT nSlotId, USHORT nId, ToolBox& rTbx ) :\n    SvxVertCTLTextTbxCtrl( nSlotId, nId, rTbx )\n{\n    SetVert(TRUE);\n    addStatusListener( rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \".uno:VerticalTextState\" )));\n}\n\n\/* ---------------------------------------------------------------------------*\/\nSvxVertCTLTextTbxCtrl::SvxVertCTLTextTbxCtrl( USHORT nSlotId, USHORT nId, ToolBox& rTbx ) :\n    SfxToolBoxControl( nSlotId, nId, rTbx ),\n    bCheckVertical(sal_True)\n{\n}\n\n\/* -----------------------------27.04.01 15:53--------------------------------\n\n ---------------------------------------------------------------------------*\/\nSvxVertCTLTextTbxCtrl::~SvxVertCTLTextTbxCtrl( )\n{\n}\n\/* -----------------------------27.04.01 15:50--------------------------------\n\n ---------------------------------------------------------------------------*\/\nvoid SvxVertCTLTextTbxCtrl::StateChanged(\n    USHORT nSID,\n    SfxItemState eState,\n    const SfxPoolItem* pState )\n{\n    SvtLanguageOptions aLangOptions;\n    BOOL bCalc = sal_False;\n    BOOL bVisible = GetToolBox().IsItemVisible(GetId());\n    sal_Bool bEnabled = sal_False;\n    if ( nSID == SID_VERTICALTEXT_STATE )\n        bEnabled = aLangOptions.IsVerticalTextEnabled();\n    else if ( nSID == SID_CTLFONT_STATE )\n        bEnabled = aLangOptions.IsCTLFontEnabled();\n    else\n    {\n        SfxToolBoxControl::StateChanged(nSID, eState, pState);\n        return;\n    }\n\n    if(bEnabled)\n    {\n        if(!bVisible)\n        {\n            GetToolBox().ShowItem( GetId(), TRUE );\n            bCalc = sal_True;\n        }\n    }\n    else if(bVisible)\n    {\n        GetToolBox().HideItem( GetId() );\n        bCalc = sal_True;\n    }\n    if(bCalc)\n    {\n        ToolBox& rTbx = GetToolBox();\n        Window* pParent = rTbx.GetParent();\n        WindowType nWinType = pParent->GetType();\n        if(WINDOW_FLOATINGWINDOW == nWinType)\n        {\n            Size aSize(rTbx.CalcWindowSizePixel());\n            rTbx.SetPosSizePixel( Point(), aSize );\n            pParent->SetOutputSizePixel( aSize );\n        }\n    }\n}\n\/* -----------------------------27.04.01 15:50--------------------------------\n\n ---------------------------------------------------------------------------*\/\n\n<commit_msg>INTEGRATION: CWS warnings01 (1.7.222); FILE MERGED 2006\/04\/20 14:50:04 cl 1.7.222.1: warning free code changes<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: verttexttbxctrl.cxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: hr $ $Date: 2006-06-19 16:52:11 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n#include \"dialmgr.hxx\"\n#include \"dialogs.hrc\"\n\n#ifndef _SVX_VERT_TEXT_TBXCTRL_HXX\n#include <verttexttbxctrl.hxx>\n#endif\n#ifndef _SVTOOLS_LANGUAGEOPTIONS_HXX\n#include <svtools\/languageoptions.hxx>\n#endif\n#ifndef _SFXAPP_HXX\n#include <sfx2\/app.hxx>\n#endif\n#ifndef _SFXENUMITEM_HXX\n#include <svtools\/eitem.hxx>\n#endif\n#ifndef _SV_TOOLBOX_HXX\n#include <vcl\/toolbox.hxx>\n#endif\n#include <rtl\/ustring.hxx>\n\nSFX_IMPL_TOOLBOX_CONTROL(SvxCTLTextTbxCtrl, SfxBoolItem);\nSFX_IMPL_TOOLBOX_CONTROL(SvxVertTextTbxCtrl, SfxBoolItem);\n\n\/\/ -----------------------------27.04.01 15:50--------------------------------\n\nSvxCTLTextTbxCtrl::SvxCTLTextTbxCtrl(USHORT nSlotId, USHORT nId, ToolBox& rTbx ) :\n    SvxVertCTLTextTbxCtrl( nSlotId, nId, rTbx )\n{\n    SetVert(FALSE);\n    addStatusListener( rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \".uno:CTLFontState\" )));\n}\n\nSvxVertTextTbxCtrl::SvxVertTextTbxCtrl( USHORT nSlotId, USHORT nId, ToolBox& rTbx ) :\n    SvxVertCTLTextTbxCtrl( nSlotId, nId, rTbx )\n{\n    SetVert(TRUE);\n    addStatusListener( rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \".uno:VerticalTextState\" )));\n}\n\n\/* ---------------------------------------------------------------------------*\/\nSvxVertCTLTextTbxCtrl::SvxVertCTLTextTbxCtrl( USHORT nSlotId, USHORT nId, ToolBox& rTbx ) :\n    SfxToolBoxControl( nSlotId, nId, rTbx ),\n    bCheckVertical(sal_True)\n{\n}\n\n\/* -----------------------------27.04.01 15:53--------------------------------\n\n ---------------------------------------------------------------------------*\/\nSvxVertCTLTextTbxCtrl::~SvxVertCTLTextTbxCtrl( )\n{\n}\n\/* -----------------------------27.04.01 15:50--------------------------------\n\n ---------------------------------------------------------------------------*\/\nvoid SvxVertCTLTextTbxCtrl::StateChanged(\n    USHORT nSID,\n    SfxItemState eState,\n    const SfxPoolItem* pState )\n{\n    SvtLanguageOptions aLangOptions;\n    BOOL bCalc = sal_False;\n    BOOL bVisible = GetToolBox().IsItemVisible(GetId());\n    sal_Bool bEnabled = sal_False;\n    if ( nSID == SID_VERTICALTEXT_STATE )\n        bEnabled = aLangOptions.IsVerticalTextEnabled();\n    else if ( nSID == SID_CTLFONT_STATE )\n        bEnabled = aLangOptions.IsCTLFontEnabled();\n    else\n    {\n        SfxToolBoxControl::StateChanged(nSID, eState, pState);\n        return;\n    }\n\n    if(bEnabled)\n    {\n        if(!bVisible)\n        {\n            GetToolBox().ShowItem( GetId(), TRUE );\n            bCalc = sal_True;\n        }\n    }\n    else if(bVisible)\n    {\n        GetToolBox().HideItem( GetId() );\n        bCalc = sal_True;\n    }\n    if(bCalc)\n    {\n        ToolBox& rTbx = GetToolBox();\n        Window* pParent = rTbx.GetParent();\n        WindowType nWinType = pParent->GetType();\n        if(WINDOW_FLOATINGWINDOW == nWinType)\n        {\n            Size aSize(rTbx.CalcWindowSizePixel());\n            rTbx.SetPosSizePixel( Point(), aSize );\n            pParent->SetOutputSizePixel( aSize );\n        }\n    }\n}\n\/* -----------------------------27.04.01 15:50--------------------------------\n\n ---------------------------------------------------------------------------*\/\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: SwGrammarMarkUp.cxx,v $\n * $Revision: 1.2 $\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#include \"SwGrammarMarkUp.hxx\"\n\nvoid SwGrammarMarkUp::MoveGrammar( xub_StrLen nPos, long nDiff )\n{\n    Move( nPos, nDiff );\n    if( !maSentence.size() )\n        return;\n    std::vector< xub_StrLen >::iterator pIter = maSentence.begin();\n    while( pIter != maSentence.end() && *pIter < nPos )\n        ++pIter;\n    xub_StrLen nEnd = nDiff < 0 ? xub_StrLen(nPos - nDiff) : nPos;\n    while( pIter != maSentence.end() )\n    {\n        if( *pIter >= nEnd )\n            *pIter = xub_StrLen( *pIter + nDiff );\n        else\n            *pIter = nPos;\n        ++pIter;\n    }\n}\n\nSwGrammarMarkUp* SwGrammarMarkUp::SplitGrammarList( xub_StrLen nSplitPos )\n{\n    SwGrammarMarkUp* pNew = (SwGrammarMarkUp*)SplitList( nSplitPos );\n    if( !maSentence.size() )\n        return pNew;\n    std::vector< xub_StrLen >::iterator pIter = maSentence.begin();\n    while( pIter != maSentence.end() && *pIter < nSplitPos )\n        ++pIter;\n    if( pIter != maSentence.begin() )\n    {\n        pNew->maSentence.insert( pNew->maSentence.begin(), maSentence.begin(), pIter );\n        maSentence.erase( maSentence.begin(), pIter );\n    }\n    return pNew;\n}\n\nvoid SwGrammarMarkUp::JoinGrammarList( SwGrammarMarkUp* pNext, xub_StrLen nInsertPos )\n{\n    JoinList( pNext, nInsertPos );\n    if( !pNext->maSentence.size() )\n        return;\n    std::vector< xub_StrLen >::iterator pIter = pNext->maSentence.begin();\n    while( pIter != pNext->maSentence.end() )\n    {\n        *pIter = *pIter + nInsertPos;\n        ++pIter;\n    }\n    maSentence.insert( maSentence.end(), pNext->maSentence.begin(), pNext->maSentence.end() );\n}\n\nvoid SwGrammarMarkUp::ClearGrammarList()\n{\n    ClearList();\n    maSentence.clear();\n}\n\nvoid SwGrammarMarkUp::setSentence( xub_StrLen nStart )\n{\n    std::vector< xub_StrLen >::iterator pIter = maSentence.begin();\n    while( pIter != maSentence.end() && *pIter < nStart )\n        ++pIter;\n    if( pIter == maSentence.end() || *pIter > nStart )\n        maSentence.insert( pIter, nStart );\n}\n\nvoid SwGrammarMarkUp::removeSentence(xub_StrLen nStart, xub_StrLen nLength )\n{\n    std::vector< xub_StrLen >::iterator pIter = maSentence.begin();\n    while( pIter != maSentence.end() && *pIter < nStart )\n        ++pIter;\n    if( nLength == STRING_LEN )\n        nStart = STRING_LEN;\n    else\n        nStart += nLength;\n    std::vector< xub_StrLen >::iterator pLast = pIter;\n    while( pLast != maSentence.end() && *pLast < nStart )\n        ++pLast;\n    maSentence.erase( pIter, pLast );\n}\n\nxub_StrLen SwGrammarMarkUp::getSentenceStart( xub_StrLen nPos )\n{\n    if( !maSentence.size() )\n        return 0;\n    std::vector< xub_StrLen >::iterator pIter = maSentence.begin();\n    while( pIter != maSentence.end() && *pIter < nPos )\n        ++pIter;\n    if( pIter != maSentence.begin() )\n        --pIter;\n    xub_StrLen nRet = 0;\n    if( pIter != maSentence.end() && *pIter < nPos )\n        nRet = *pIter;\n    return nRet;\n}\n\nxub_StrLen SwGrammarMarkUp::getSentenceEnd( xub_StrLen nPos )\n{\n    if( !maSentence.size() )\n        return STRING_LEN;\n    std::vector< xub_StrLen >::iterator pIter = maSentence.begin();\n    while( pIter != maSentence.end() && *pIter <= nPos )\n        ++pIter;\n    xub_StrLen nRet = STRING_LEN;\n    if( pIter != maSentence.end() )\n        nRet = *pIter;\n    return nRet;\n}\n\n<commit_msg>CWS-TOOLING: integrate CWS tl62_DEV300<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: SwGrammarMarkUp.cxx,v $\n * $Revision: 1.2 $\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#include \"SwGrammarMarkUp.hxx\"\n\nvoid SwGrammarMarkUp::MoveGrammar( xub_StrLen nPos, long nDiff )\n{\n    Move( nPos, nDiff );\n    if( !maSentence.size() )\n        return;\n    std::vector< xub_StrLen >::iterator pIter = maSentence.begin();\n    while( pIter != maSentence.end() && *pIter < nPos )\n        ++pIter;\n    xub_StrLen nEnd = nDiff < 0 ? xub_StrLen(nPos - nDiff) : nPos;\n    while( pIter != maSentence.end() )\n    {\n        if( *pIter >= nEnd )\n            *pIter = xub_StrLen( *pIter + nDiff );\n        else\n            *pIter = nPos;\n        ++pIter;\n    }\n}\n\nSwGrammarMarkUp* SwGrammarMarkUp::SplitGrammarList( xub_StrLen nSplitPos )\n{\n    SwGrammarMarkUp* pNew = (SwGrammarMarkUp*)SplitList( nSplitPos );\n    if( !maSentence.size() )\n        return pNew;\n    std::vector< xub_StrLen >::iterator pIter = maSentence.begin();\n    while( pIter != maSentence.end() && *pIter < nSplitPos )\n        ++pIter;\n    if( pIter != maSentence.begin() )\n    {\n        pNew->maSentence.insert( pNew->maSentence.begin(), maSentence.begin(), pIter );\n        maSentence.erase( maSentence.begin(), pIter );\n    }\n    return pNew;\n}\n\nvoid SwGrammarMarkUp::JoinGrammarList( SwGrammarMarkUp* pNext, xub_StrLen nInsertPos )\n{\n    JoinList( pNext, nInsertPos );\n    if (pNext)\n    {\n        if( !pNext->maSentence.size() )\n            return;\n        std::vector< xub_StrLen >::iterator pIter = pNext->maSentence.begin();\n        while( pIter != pNext->maSentence.end() )\n        {\n            *pIter = *pIter + nInsertPos;\n            ++pIter;\n        }\n        maSentence.insert( maSentence.end(), pNext->maSentence.begin(), pNext->maSentence.end() );\n    }\n}\n\nvoid SwGrammarMarkUp::ClearGrammarList()\n{\n    ClearList();\n    maSentence.clear();\n}\n\nvoid SwGrammarMarkUp::setSentence( xub_StrLen nStart )\n{\n    std::vector< xub_StrLen >::iterator pIter = maSentence.begin();\n    while( pIter != maSentence.end() && *pIter < nStart )\n        ++pIter;\n    if( pIter == maSentence.end() || *pIter > nStart )\n        maSentence.insert( pIter, nStart );\n}\n\nvoid SwGrammarMarkUp::removeSentence(xub_StrLen nStart, xub_StrLen nLength )\n{\n    std::vector< xub_StrLen >::iterator pIter = maSentence.begin();\n    while( pIter != maSentence.end() && *pIter < nStart )\n        ++pIter;\n    if( nLength == STRING_LEN )\n        nStart = STRING_LEN;\n    else\n        nStart += nLength;\n    std::vector< xub_StrLen >::iterator pLast = pIter;\n    while( pLast != maSentence.end() && *pLast < nStart )\n        ++pLast;\n    maSentence.erase( pIter, pLast );\n}\n\nxub_StrLen SwGrammarMarkUp::getSentenceStart( xub_StrLen nPos )\n{\n    if( !maSentence.size() )\n        return 0;\n    std::vector< xub_StrLen >::iterator pIter = maSentence.begin();\n    while( pIter != maSentence.end() && *pIter < nPos )\n        ++pIter;\n    if( pIter != maSentence.begin() )\n        --pIter;\n    xub_StrLen nRet = 0;\n    if( pIter != maSentence.end() && *pIter < nPos )\n        nRet = *pIter;\n    return nRet;\n}\n\nxub_StrLen SwGrammarMarkUp::getSentenceEnd( xub_StrLen nPos )\n{\n    if( !maSentence.size() )\n        return STRING_LEN;\n    std::vector< xub_StrLen >::iterator pIter = maSentence.begin();\n    while( pIter != maSentence.end() && *pIter <= nPos )\n        ++pIter;\n    xub_StrLen nRet = STRING_LEN;\n    if( pIter != maSentence.end() )\n        nRet = *pIter;\n    return nRet;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: writerwordglue.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: kz $ $Date: 2004-02-26 12:48:36 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): cmc@openoffice.org\n *\n *\n ************************************************************************\/\n\n\/* -*- Mode: C; tab-width: 4; indent-tabs-mode: nil -*- *\/\n\/\/\/ @HTML\n\n#ifndef SW_WRITERWORDGLUE\n#define SW_WRITERWORDGLUE\n\n#ifndef WW_NEEDED_CAST_HXX\n#   include \"needed_cast.hxx\"\n#endif\n#ifndef WW_TYPES\n#   include \"types.hxx\"\n#endif\n\nclass SwFrmFmt;\nclass SfxItemSet;\nclass SwDoc;\nclass SwTxtFmtColl;\nclass String;\nclass PoolItems;\n\nnamespace sw\n{\n    namespace types\n    {\n        \/** A static_cast style cast for conversion of word types to writer's\n\n            There are a number of places where the winword types are larger\n            than the writer equivalents requiring a cast to silence warnings.\n            To avoid throwing away this useful information writer_cast is used\n            to identify where writer's types are smaller than word's.\n\n            Based on needed_cast it will compile time assert if the cast\n            becomes unnecessary at any time in the future.\n\n            @tplparam\n            Ret the desired return type\n\n            @tplparam\n            Param the type of the in param\n\n            @param\n            in the value to cast from Param to Ret\n\n            @return in casted to type Ret\n        *\/\n        template<typename Ret, typename Param> Ret writer_cast(Param in)\n        {\n            return ww::needed_cast<Ret, Param>(in);\n        }\n\n        \/** A static_cast style cast for conversion of writer types to word's\n\n            There are a number of places where the writer types are larger than\n            the winword equivalents requiring a cast to silence warnings.  To\n            avoid throwing away this useful information writer_cast is used to\n            identify where word's types are smaller than writers's.\n\n            Based on needed_cast it will compile time assert if the cast\n            becomes unnecessary at any time in the future.\n\n            @tplparam\n            Ret the desired return type\n\n            @tplparam\n            Param the type of the in param\n\n            @param\n            in the value to cast from Param to Ret\n\n            @return in casted to type Ret\n        *\/\n        template<typename Ret, typename Param> Ret msword_cast(Param in)\n        {\n            return ww::needed_cast<Ret, Param>(in);\n        }\n\n\n        \/** If a page dimension is close to a standard page size, snap to it.\n\n            Commonly a page dimension is slightly different from a standard\n            page size, so close that its likely a rounding error after\n            creeping in. Use this to snap to standard sizes when within a\n            trivial distance from a standard size.\n\n            @param\n            nSize the dimension to test against standard dimensions\n\n            @return New dimension to use, equal to nSize unless within a\n            trivial amount of a standard page dimension\n\n            @author\n            <a href=\"mailto:cmc@openoffice.org\">Caol&aacute;n McNamara<\/a>\n        *\/\n        long SnapPageDimension(long nSize) throw();\n    }\n\n    namespace util\n    {\n        \/** See if two page formats can be expressed as a single word section\n\n            Word doesn't have the idea of page descriptors and follow styles\n            like writer does, the only thing it has is a section with a\n            different title page. The only difference of the title page from\n            the rest of the section is different headers\/footers, everything\n            else is the same.\n\n            So this function compares two writer page fmts and sees if the\n            follow frame and the title frame are the same from word persecptive\n            except for the content of their headers.\n\n            @return true if the rTitleFmt followed by rFollowFmt could be\n            expressed in word as a single word Section with different title\n            page enabled.\n\n            @author\n            <a href=\"mailto:cmc@openoffice.org\">Caol&aacute;n McNamara<\/a>\n\n            @see #i4320#\/#i14509#\/#i11717# for examples\n        *\/\n        bool IsPlausableSingleWordSection(const SwFrmFmt &rTitleFmt,\n            const SwFrmFmt &rFollowFmt);\n\n        \/** Make export a word section top\/bottom values easy\n\n            The top and bottom margins in word and writer are expressed in very\n            different ways. This class provides the equivalent word values for\n            header\/footer distances from a given writer attrset of a page\n\n            @author\n            <a href=\"mailto:cmc@openoffice.org\">Caol&aacute;n McNamara<\/a>\n        *\/\n        class HdFtDistanceGlue\n        {\n        private:\n            bool mbHasHeader;\n            bool mbHasFooter;\n        public:\n            sal_uInt16 dyaHdrTop;\n            sal_uInt16 dyaHdrBottom;\n            sal_uInt16 dyaTop;\n            sal_uInt16 dyaBottom;\n            HdFtDistanceGlue(const SfxItemSet &rPage);\n            bool HasHeader() const { return mbHasHeader; }\n            bool HasFooter() const { return mbHasFooter; }\n\n            \/** Is the top of the page the same in both objects\n\n                Ignoring the difference in header and footers, will the main\n                document text have the same top\/bottom bounds in word between\n                both these objects.\n\n                @param\n                rOther the other HdFtDistanceGlue to compare against\n\n                @return true if the main text areas top and bottom is at the\n                same location, false otherwise.\n            *\/\n            bool EqualTopBottom(const HdFtDistanceGlue &rOther) const;\n\n        };\n    }\n}\n\n#endif\n\/* vi:set tabstop=4 shiftwidth=4 expandtab: *\/\n<commit_msg>INTEGRATION: CWS ooo19126 (1.4.816); FILE MERGED 2005\/09\/05 13:42:31 rt 1.4.816.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: writerwordglue.hxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 06:07: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\/* -*- Mode: C; tab-width: 4; indent-tabs-mode: nil -*- *\/\n\/\/\/ @HTML\n\n#ifndef SW_WRITERWORDGLUE\n#define SW_WRITERWORDGLUE\n\n#ifndef WW_NEEDED_CAST_HXX\n#   include \"needed_cast.hxx\"\n#endif\n#ifndef WW_TYPES\n#   include \"types.hxx\"\n#endif\n\nclass SwFrmFmt;\nclass SfxItemSet;\nclass SwDoc;\nclass SwTxtFmtColl;\nclass String;\nclass PoolItems;\n\nnamespace sw\n{\n    namespace types\n    {\n        \/** A static_cast style cast for conversion of word types to writer's\n\n            There are a number of places where the winword types are larger\n            than the writer equivalents requiring a cast to silence warnings.\n            To avoid throwing away this useful information writer_cast is used\n            to identify where writer's types are smaller than word's.\n\n            Based on needed_cast it will compile time assert if the cast\n            becomes unnecessary at any time in the future.\n\n            @tplparam\n            Ret the desired return type\n\n            @tplparam\n            Param the type of the in param\n\n            @param\n            in the value to cast from Param to Ret\n\n            @return in casted to type Ret\n        *\/\n        template<typename Ret, typename Param> Ret writer_cast(Param in)\n        {\n            return ww::needed_cast<Ret, Param>(in);\n        }\n\n        \/** A static_cast style cast for conversion of writer types to word's\n\n            There are a number of places where the writer types are larger than\n            the winword equivalents requiring a cast to silence warnings.  To\n            avoid throwing away this useful information writer_cast is used to\n            identify where word's types are smaller than writers's.\n\n            Based on needed_cast it will compile time assert if the cast\n            becomes unnecessary at any time in the future.\n\n            @tplparam\n            Ret the desired return type\n\n            @tplparam\n            Param the type of the in param\n\n            @param\n            in the value to cast from Param to Ret\n\n            @return in casted to type Ret\n        *\/\n        template<typename Ret, typename Param> Ret msword_cast(Param in)\n        {\n            return ww::needed_cast<Ret, Param>(in);\n        }\n\n\n        \/** If a page dimension is close to a standard page size, snap to it.\n\n            Commonly a page dimension is slightly different from a standard\n            page size, so close that its likely a rounding error after\n            creeping in. Use this to snap to standard sizes when within a\n            trivial distance from a standard size.\n\n            @param\n            nSize the dimension to test against standard dimensions\n\n            @return New dimension to use, equal to nSize unless within a\n            trivial amount of a standard page dimension\n\n            @author\n            <a href=\"mailto:cmc@openoffice.org\">Caol&aacute;n McNamara<\/a>\n        *\/\n        long SnapPageDimension(long nSize) throw();\n    }\n\n    namespace util\n    {\n        \/** See if two page formats can be expressed as a single word section\n\n            Word doesn't have the idea of page descriptors and follow styles\n            like writer does, the only thing it has is a section with a\n            different title page. The only difference of the title page from\n            the rest of the section is different headers\/footers, everything\n            else is the same.\n\n            So this function compares two writer page fmts and sees if the\n            follow frame and the title frame are the same from word persecptive\n            except for the content of their headers.\n\n            @return true if the rTitleFmt followed by rFollowFmt could be\n            expressed in word as a single word Section with different title\n            page enabled.\n\n            @author\n            <a href=\"mailto:cmc@openoffice.org\">Caol&aacute;n McNamara<\/a>\n\n            @see #i4320#\/#i14509#\/#i11717# for examples\n        *\/\n        bool IsPlausableSingleWordSection(const SwFrmFmt &rTitleFmt,\n            const SwFrmFmt &rFollowFmt);\n\n        \/** Make export a word section top\/bottom values easy\n\n            The top and bottom margins in word and writer are expressed in very\n            different ways. This class provides the equivalent word values for\n            header\/footer distances from a given writer attrset of a page\n\n            @author\n            <a href=\"mailto:cmc@openoffice.org\">Caol&aacute;n McNamara<\/a>\n        *\/\n        class HdFtDistanceGlue\n        {\n        private:\n            bool mbHasHeader;\n            bool mbHasFooter;\n        public:\n            sal_uInt16 dyaHdrTop;\n            sal_uInt16 dyaHdrBottom;\n            sal_uInt16 dyaTop;\n            sal_uInt16 dyaBottom;\n            HdFtDistanceGlue(const SfxItemSet &rPage);\n            bool HasHeader() const { return mbHasHeader; }\n            bool HasFooter() const { return mbHasFooter; }\n\n            \/** Is the top of the page the same in both objects\n\n                Ignoring the difference in header and footers, will the main\n                document text have the same top\/bottom bounds in word between\n                both these objects.\n\n                @param\n                rOther the other HdFtDistanceGlue to compare against\n\n                @return true if the main text areas top and bottom is at the\n                same location, false otherwise.\n            *\/\n            bool EqualTopBottom(const HdFtDistanceGlue &rOther) const;\n\n        };\n    }\n}\n\n#endif\n\/* vi:set tabstop=4 shiftwidth=4 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before>\/*********************************************************************************\n *\n * Inviwo - Interactive Visualization Workshop\n *\n * Copyright (c) 2022 Inviwo Foundation\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *********************************************************************************\/\n\n#include <inviwo\/dataframe\/processors\/dataframefilter.h>\n#include <inviwo\/core\/properties\/boolcompositeproperty.h>\n#include <inviwo\/core\/properties\/minmaxproperty.h>\n#include <inviwo\/core\/properties\/ordinalproperty.h>\n#include <inviwo\/core\/properties\/stringproperty.h>\n\n#include <inviwo\/dataframe\/util\/dataframeutil.h>\n\nnamespace inviwo {\n\n\/\/ The Class Identifier has to be globally unique. Use a reverse DNS naming scheme\nconst ProcessorInfo DataFrameFilter::processorInfo_{\n    \"org.inviwo.DataFrameFilter\",                 \/\/ Class identifier\n    \"DataFrame Filter\",                           \/\/ Display name\n    \"DataFrame\",                                  \/\/ Category\n    CodeState::Experimental,                      \/\/ Code state\n    Tag::CPU | Tag(\"DataFrame\") | Tag(\"Filter\"),  \/\/ Tags\n};\nconst ProcessorInfo DataFrameFilter::getProcessorInfo() const { return processorInfo_; }\n\nDataFrameFilter::DataFrameFilter()\n    : Processor()\n    , inport_(\"inport\")\n    , brushing_(\"brushing\")\n    , outport_(\"outport\")\n    , enabled_(\"enabled\", \"Enabled\", true)\n    , brushingMode_(\"brushingMode\", \"Brushing and Linking\",\n                    {{\"none\", \"None\", BrushingMode::None},\n                     {\"filterOnly\", \"Filter Only\", BrushingMode::FilterOnly},\n                     {\"applyOnly\", \"Apply Only\", BrushingMode::ApplyOnly},\n                     {\"filterApply\", \"Filter & Apply\", BrushingMode::FilterApply}},\n                    1)\n    , includeFilters_(\"includeFilters\", \"Include Filters\", true,\n                      FilterType::StringItem | FilterType::IntItem | FilterType::IntRange |\n                          FilterType::DoubleItem | FilterType::DoubleRange)\n    , excludeFilters_(\"excludeFilters\", \"Exclude Filters\", true,\n                      FilterType::StringItem | FilterType::IntItem | FilterType::IntRange |\n                          FilterType::DoubleItem | FilterType::DoubleRange) {\n\n    addPort(inport_);\n    addPort(brushing_);\n    addPort(outport_);\n\n    addProperties(enabled_, brushingMode_, includeFilters_, excludeFilters_);\n\n    includeFilters_.setCollapsed(true);\n    excludeFilters_.setCollapsed(true);\n}\n\nvoid DataFrameFilter::process() {\n    auto df = inport_.getData();\n\n    if (!enabled_) {\n        outport_.setData(df);\n        brushing_.filter(getIdentifier(), BitSet());\n        return;\n    }\n\n    if (brushingMode_.isModified()) {\n        if ((brushingMode_ == BrushingMode::None) || (brushingMode_ == BrushingMode::FilterOnly)) {\n            \/\/ unset any previous local filtering\n            brushing_.filter(getIdentifier(), BitSet());\n        }\n    }\n\n    auto rows = dataframe::selectRows(*df, createFilters());\n\n    if ((brushingMode_ == BrushingMode::ApplyOnly) ||\n        (brushingMode_ == BrushingMode::FilterApply)) {\n        BitSet b(rows);\n        b.flipRange(0, static_cast<std::uint32_t>(inport_.getData()->getNumberOfRows()));\n        brushing_.filter(getIdentifier(), b);\n    }\n\n    if ((brushingMode_ == BrushingMode::FilterOnly) ||\n        (brushingMode_ == BrushingMode::FilterApply)) {\n        BitSet b(rows);\n        b -= brushing_.getFilteredIndices();\n        rows = b.toVector();\n    }\n\n    outport_.setData(std::make_shared<DataFrame>(*df, rows));\n}\n\nnamespace detail {\n\ntemplate <typename T>\ndecltype(std::declval<T&>().get()) getValue(PropertyOwner* parent, std::string_view identifier) {\n    if (auto p = dynamic_cast<T*>(parent->getPropertyByIdentifier(identifier))) {\n        return p->get();\n    } else {\n        throw Exception(IVW_CONTEXT_CUSTOM(\"DataFrameFilter::createFilters\"),\n                        \"Invalid filter property '{}', missing sub-property '{}'\",\n                        parent->getIdentifier(), identifier);\n    }\n}\n\n}  \/\/ namespace detail\n\ndataframefilters::Filters DataFrameFilter::createFilters() const {\n    auto startsWith = [](std::string_view str, std::string_view prefix) {\n        return str.substr(0, prefix.size()) == prefix;\n    };\n\n    auto parse = [&](const auto& filterProp, auto& itemFilters) {\n        for (auto prop : filterProp) {\n            if (auto cp = dynamic_cast<BoolCompositeProperty*>(prop)) {\n                if (!cp->isChecked()) continue;\n\n                const auto& identifier = cp->getIdentifier();\n\n                if (startsWith(identifier, \"stringItem\")) {\n                    itemFilters.push_back(dataframefilters::stringMatch(\n                        detail::getValue<IntProperty>(cp, \"column\"),\n                        detail::getValue<TemplateOptionProperty<filters::StringComp>>(cp, \"comp\"),\n                        detail::getValue<StringProperty>(cp, \"match\")));\n                } else if (startsWith(identifier, \"intItem\")) {\n                    itemFilters.push_back(dataframefilters::intMatch(\n                        detail::getValue<IntProperty>(cp, \"column\"),\n                        detail::getValue<TemplateOptionProperty<filters::NumberComp>>(cp, \"comp\"),\n                        detail::getValue<Int64Property>(cp, \"value\")));\n                } else if (startsWith(identifier, \"doubleItem\")) {\n                    itemFilters.push_back(dataframefilters::doubleMatch(\n                        detail::getValue<IntProperty>(cp, \"column\"),\n                        detail::getValue<TemplateOptionProperty<filters::NumberComp>>(cp, \"comp\"),\n                        detail::getValue<DoubleProperty>(cp, \"value\"),\n                        detail::getValue<DoubleProperty>(cp, \"epsilon\")));\n                } else if (startsWith(identifier, \"intRangeItem\")) {\n                    const auto& range = detail::getValue<Int64MinMaxProperty>(cp, \"range\");\n                    itemFilters.push_back(dataframefilters::intRange(\n                        detail::getValue<IntProperty>(cp, \"column\"), range.x, range.y));\n                } else if (startsWith(identifier, \"doubleRangeItem\")) {\n                    const auto& range = detail::getValue<DoubleMinMaxProperty>(cp, \"range\");\n                    itemFilters.push_back(dataframefilters::doubleRange(\n                        detail::getValue<IntProperty>(cp, \"column\"), range.x, range.y));\n                }\n            }\n        }\n    };\n\n    dataframefilters::Filters filters;\n    parse(includeFilters_, filters.include);\n    parse(excludeFilters_, filters.exclude);\n\n    return filters;\n}\n\n}  \/\/ namespace inviwo\n<commit_msg>DataFrame: DataFrame Filter invalidation<commit_after>\/*********************************************************************************\n *\n * Inviwo - Interactive Visualization Workshop\n *\n * Copyright (c) 2022 Inviwo Foundation\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *********************************************************************************\/\n\n#include <inviwo\/dataframe\/processors\/dataframefilter.h>\n#include <inviwo\/core\/properties\/boolcompositeproperty.h>\n#include <inviwo\/core\/properties\/minmaxproperty.h>\n#include <inviwo\/core\/properties\/ordinalproperty.h>\n#include <inviwo\/core\/properties\/stringproperty.h>\n\n#include <inviwo\/dataframe\/util\/dataframeutil.h>\n\nnamespace inviwo {\n\n\/\/ The Class Identifier has to be globally unique. Use a reverse DNS naming scheme\nconst ProcessorInfo DataFrameFilter::processorInfo_{\n    \"org.inviwo.DataFrameFilter\",                 \/\/ Class identifier\n    \"DataFrame Filter\",                           \/\/ Display name\n    \"DataFrame\",                                  \/\/ Category\n    CodeState::Experimental,                      \/\/ Code state\n    Tag::CPU | Tag(\"DataFrame\") | Tag(\"Filter\"),  \/\/ Tags\n};\nconst ProcessorInfo DataFrameFilter::getProcessorInfo() const { return processorInfo_; }\n\nDataFrameFilter::DataFrameFilter()\n    : Processor()\n    , inport_(\"inport\")\n    , brushing_(\"brushing\", {{{BrushingTarget::Row},\n                              BrushingModification::Filtered,\n                              InvalidationLevel::InvalidOutput}})\n    , outport_(\"outport\")\n    , enabled_(\"enabled\", \"Enabled\", true)\n    , brushingMode_(\"brushingMode\", \"Brushing and Linking\",\n                    {{\"none\", \"None\", BrushingMode::None},\n                     {\"filterOnly\", \"Filter Only\", BrushingMode::FilterOnly},\n                     {\"applyOnly\", \"Apply Only\", BrushingMode::ApplyOnly},\n                     {\"filterApply\", \"Filter & Apply\", BrushingMode::FilterApply}},\n                    1)\n    , includeFilters_(\"includeFilters\", \"Include Filters\", true,\n                      FilterType::StringItem | FilterType::IntItem | FilterType::IntRange |\n                          FilterType::DoubleItem | FilterType::DoubleRange)\n    , excludeFilters_(\"excludeFilters\", \"Exclude Filters\", true,\n                      FilterType::StringItem | FilterType::IntItem | FilterType::IntRange |\n                          FilterType::DoubleItem | FilterType::DoubleRange) {\n\n    addPort(inport_);\n    addPort(brushing_);\n    addPort(outport_);\n\n    addProperties(enabled_, brushingMode_, includeFilters_, excludeFilters_);\n\n    includeFilters_.setCollapsed(true);\n    excludeFilters_.setCollapsed(true);\n}\n\nvoid DataFrameFilter::process() {\n    auto df = inport_.getData();\n\n    if (!enabled_) {\n        outport_.setData(df);\n        brushing_.filter(getIdentifier(), BitSet());\n        return;\n    }\n\n    if (brushingMode_.isModified()) {\n        if ((brushingMode_ == BrushingMode::None) || (brushingMode_ == BrushingMode::FilterOnly)) {\n            \/\/ unset any previous local filtering\n            brushing_.filter(getIdentifier(), BitSet());\n        }\n    }\n\n    auto rows = dataframe::selectRows(*df, createFilters());\n\n    if ((brushingMode_ == BrushingMode::ApplyOnly) ||\n        (brushingMode_ == BrushingMode::FilterApply)) {\n        BitSet b(rows);\n        b.flipRange(0, static_cast<std::uint32_t>(inport_.getData()->getNumberOfRows()));\n        brushing_.filter(getIdentifier(), b);\n    }\n\n    if ((brushingMode_ == BrushingMode::FilterOnly) ||\n        (brushingMode_ == BrushingMode::FilterApply)) {\n        BitSet b(rows);\n        b -= brushing_.getFilteredIndices();\n        rows = b.toVector();\n    }\n\n    outport_.setData(std::make_shared<DataFrame>(*df, rows));\n}\n\nnamespace detail {\n\ntemplate <typename T>\ndecltype(std::declval<T&>().get()) getValue(PropertyOwner* parent, std::string_view identifier) {\n    if (auto p = dynamic_cast<T*>(parent->getPropertyByIdentifier(identifier))) {\n        return p->get();\n    } else {\n        throw Exception(IVW_CONTEXT_CUSTOM(\"DataFrameFilter::createFilters\"),\n                        \"Invalid filter property '{}', missing sub-property '{}'\",\n                        parent->getIdentifier(), identifier);\n    }\n}\n\n}  \/\/ namespace detail\n\ndataframefilters::Filters DataFrameFilter::createFilters() const {\n    auto startsWith = [](std::string_view str, std::string_view prefix) {\n        return str.substr(0, prefix.size()) == prefix;\n    };\n\n    auto parse = [&](const auto& filterProp, auto& itemFilters) {\n        for (auto prop : filterProp) {\n            if (auto cp = dynamic_cast<BoolCompositeProperty*>(prop)) {\n                if (!cp->isChecked()) continue;\n\n                const auto& identifier = cp->getIdentifier();\n\n                if (startsWith(identifier, \"stringItem\")) {\n                    itemFilters.push_back(dataframefilters::stringMatch(\n                        detail::getValue<IntProperty>(cp, \"column\"),\n                        detail::getValue<TemplateOptionProperty<filters::StringComp>>(cp, \"comp\"),\n                        detail::getValue<StringProperty>(cp, \"match\")));\n                } else if (startsWith(identifier, \"intItem\")) {\n                    itemFilters.push_back(dataframefilters::intMatch(\n                        detail::getValue<IntProperty>(cp, \"column\"),\n                        detail::getValue<TemplateOptionProperty<filters::NumberComp>>(cp, \"comp\"),\n                        detail::getValue<Int64Property>(cp, \"value\")));\n                } else if (startsWith(identifier, \"doubleItem\")) {\n                    itemFilters.push_back(dataframefilters::doubleMatch(\n                        detail::getValue<IntProperty>(cp, \"column\"),\n                        detail::getValue<TemplateOptionProperty<filters::NumberComp>>(cp, \"comp\"),\n                        detail::getValue<DoubleProperty>(cp, \"value\"),\n                        detail::getValue<DoubleProperty>(cp, \"epsilon\")));\n                } else if (startsWith(identifier, \"intRangeItem\")) {\n                    const auto& range = detail::getValue<Int64MinMaxProperty>(cp, \"range\");\n                    itemFilters.push_back(dataframefilters::intRange(\n                        detail::getValue<IntProperty>(cp, \"column\"), range.x, range.y));\n                } else if (startsWith(identifier, \"doubleRangeItem\")) {\n                    const auto& range = detail::getValue<DoubleMinMaxProperty>(cp, \"range\");\n                    itemFilters.push_back(dataframefilters::doubleRange(\n                        detail::getValue<IntProperty>(cp, \"column\"), range.x, range.y));\n                }\n            }\n        }\n    };\n\n    dataframefilters::Filters filters;\n    parse(includeFilters_, filters.include);\n    parse(excludeFilters_, filters.exclude);\n\n    return filters;\n}\n\n}  \/\/ namespace inviwo\n<|endoftext|>"}
{"text":"<commit_before>#include \"SDLFont.hh\"\r\n\r\n#include \"SDLConfig.hh\"\r\n#include \"SDLResources.inc\"\r\n\r\n\r\n\r\nnamespace RAGE\r\n{\r\nnamespace SDL\r\n{\r\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\t\/\/ DEFAULT FONT IMPLEMENTATION \/\/\r\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\t\r\n\/\/Class implementing the default font character render (with alpha masks)\r\n\tclass FontImpl\r\n\t{\r\n\r\n\t\t\/\/this version keeps the right value for render\r\n\t\tconst RGBSurface _fontsurf;\r\n\r\n\t\t\/\/all the rectangles become {0,0,0,0} on render for some reason\r\n\t\tstd::vector<Rect> alphalookup;\r\n\t\t\r\n\t\tpublic :\r\n\t\t\t\r\n\t\t \/\/image 16x14 character, 225x225 pixels (all start at 0, not 1)\r\n\t\t\tFontImpl()  throw (std::logic_error);\r\n\t\t\tFontImpl(const FontImpl & font);\r\n\t\t\tvirtual ~FontImpl();\r\n\t\t\r\n\t\t\tvirtual Rect getSize(const std::string & text);\r\n\r\n\t\t\tvirtual Font::Style getStyle() { return Font::Default;}\r\n\t\t\tvirtual void setStyle(Font::Style s) { } \/\/does nothing only one style available in default mode.\r\n\t\t\t\r\n\t\t\t\/\/Rendering\r\n\t\t\t\/\/bgc is used only if mode == shaded. Otherwise it s transparent\r\n\t\t\tvirtual SDL_Surface * render(const std::string & text,Color c, Color bgc = Color(), Font::RenderMode mode = Font::Solid ) const;\r\n\t\t\r\n\t};\r\n\r\n\tFontImpl::FontImpl()  throw (std::logic_error)\r\n\t\t\ttry: _fontsurf(RWOps(_defaultFont,sizeof(_defaultFont))), alphalookup()\r\n\t\t\t{\r\n\t\t\t\/\/building alphalookup\r\n\t\t\t\tfor (int line = 0; line < 14; line++)\r\n\t\t\t\t{\r\n\t\t\t\t\tfor (int col = 0; col < 16; col++)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\talphalookup.push_back(Rect(col * 14, line*16, 14,16));\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tcatch (std::exception& e)\r\n\t\t\t{\r\n\t\t\t\tLog << nl << \"Exception caught in internal FontImpl constructor : \" << e.what();\r\n\t\t\t};\r\n\r\n\t\t\tRect FontImpl::getSize(const std::string & text)\r\n\t\t\t{\r\n\t\t\t\/\/number of lines in text -> todo\r\n\r\n\t\t\t\/\/number of character max per line\r\n\t\t\t\tRect r(text.size() * 14,16);\r\n\t\t\t\treturn r;\r\n\t\t\t}\r\n\r\n\t\t\tFontImpl::FontImpl(const FontImpl & font) : _fontsurf(font._fontsurf)\r\n\t\t\t{\r\n\t\t\t\talphalookup.assign(font.alphalookup.begin(),font.alphalookup.end());\r\n\t\t\t}\r\n\r\n\t\t\tFontImpl::~FontImpl()\r\n\t\t\t{\r\n\t\t\t\talphalookup.clear();\r\n\t\t\t}\r\n\r\n\t\t\tSDL_Surface * FontImpl::render(const std::string & text,Color c, Color bgc, Font::RenderMode mode) const\r\n\t\t\t{\r\n\t\t\t\/\/TODO\r\n\/\/  \t\t\tSDL_Surface * result = SDL_CreateRGBSurface(RGBFlags, getSize(text).getw(), getSize(text).geth(), 16, r_default_mask, g_default_mask, b_default_mask, a_default_mask);\r\n\/\/ \t\t\tfor (unsigned int i= 0; i< text.size(); i++)\r\n\/\/ \t\t\t{\r\n\/\/ \t\t\t\tresult->blit(_fontsurf,Rect(0,i*14,14,16),alphalookup[text[i]]);\r\n\/\/ \t\t\t\treturn NULL;\r\n\/\/ \t\t\t}\r\n\/\/ \t\t\treturn result;\r\n\t\t\t\treturn NULL;\r\n\t\t\t}\r\n\r\n\r\n\t\t\t\r\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\t\/\/ TTF FONT IMPLEMENTATION \/\/\r\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\t\r\n\/\/if SDL_TTF used, provide a class to be used as a bridge.\r\n\/\/this way the client doesnt have to take care of which function is available\r\n#ifdef HAVE_SDLTTF\r\n\r\n\tclass FontExtend : public FontImpl\r\n\t{\r\n\t\t\/\/shared between copies of the same instance\r\n\t\tTTF_Font * _ttfstruct;\r\n\t\tint _ref;\r\n\r\n\t\tpublic:\r\n\t\t\t\/\/Constructor\r\n\t\t\tFontExtend(std::string filename, int ptsize) throw (std::logic_error);\r\n\t\t\t\r\n\t\t\t\/\/Copy Constructor\r\n\t\t\t\/\/copy completely the content of *_ttfstruct\r\n\t\t\tFontExtend(const FontExtend & );\r\n\t\t\t\/\/Assignement operator\r\n\t\t\tFontExtend & operator=(const FontExtend &);\r\n\r\n\t\t\t\/\/Destructor\r\n\t\t\t~FontExtend();\r\n\r\n\r\n\t\t\t\/\/Attributes Access\r\n\t\t\tstatic void byteSwapUNICODE(bool swapped);\r\n\r\n\t\t\tFont::Style getStyle();\r\n\t\t\tvoid setStyle(Font::Style s);\r\n\t\t\t\r\n\t\t\tint height();\r\n\t\t\tint ascent();\r\n\t\t\tint descent();\r\n\t\t\tint lineskip();\r\n\t\t\tlong faces();\r\n\t\t\tbool faceIsFixedWidth();\r\n\t\t\tstd::string faceFamilyName();\r\n\t\t\tstd::string faceStyleName();\r\n\t\t\t\r\n\t\t\tRect size(std::string text);\r\n\r\n\t\t\t\/\/The Background color is used only if RenderMode = Shaded otherwise the background is transparent.\r\n\t\t\tSDL_Surface * render(const std::string& text, Color c, Color bgc = Color(), Font::RenderMode mode = Font::Solid) const;\r\n\t};\r\n\r\n\r\n\/\/Implementation of class Font\r\n\tFontExtend::FontExtend(std::string filename, int ptsize) throw (std::logic_error)\r\n\t\t\ttry : FontImpl(),_ttfstruct(TTF_OpenFont(filename.c_str(),ptsize)), _ref(1)\r\n\t\t{\r\n\t\t\tif(_ttfstruct==NULL) {\r\n\t\t\t\tthrow std::logic_error(\"TTF_OpenFont Error : \" + Optional::GetError(Optional::TTF));\r\n\t\t\t}\r\n\t\t}\r\n\t\tcatch (std::exception& e)\r\n\t\t{\r\n\t\t\tLog << nl << \"Exception catched in internal FontExtent Constructor :\"  << nl <<\r\n\t\t\t\t\te.what() << std::endl;\r\n\t\t            \/\/TODO : much more explicit error message...\r\n\t\t};\r\n\r\n\t\tFontExtend::FontExtend(const FontExtend & font)\r\n\t\t{\r\n\t\t\t++_ref;\r\n\t\t\t_ttfstruct = font._ttfstruct;\r\n\t\t}\r\n\r\n\t\tFontExtend::~FontExtend()\r\n\t\t{\r\n\t\t\t--_ref;\r\n\t\t\tif (_ref == 0)\r\n\t\t\t\tTTF_CloseFont(_ttfstruct), _ttfstruct=NULL;\r\n\t\t}\r\n\r\n\t\tSDL_Surface * FontExtend::render(const std::string& text, Color c, Color bgc, Font::RenderMode mode) const\r\n\t\t{\r\n\t\t\tSDL_Surface * surf;\r\n\t\t\tswitch ( mode )\r\n\t\t\t{\r\n\t\t\t\tcase Font::Blended : surf=TTF_RenderText_Blended(_ttfstruct,text.c_str(), c.get_SDL()); break;\r\n\t\t\t\tcase Font::Shaded : surf=TTF_RenderText_Shaded(_ttfstruct,text.c_str(),c.get_SDL(), bgc.get_SDL()); break;\r\n\t\t\t\tcase Font::Solid :\r\n\t\t\t\tdefault: surf=TTF_RenderText_Solid(_ttfstruct,text.c_str(), c.get_SDL()); break;\r\n\t\t\t}\r\n\t\t\treturn surf;\r\n\t\t}\r\n\r\n\t\t\/\/Attributes Access\r\n\t\tvoid FontExtend::byteSwapUNICODE(bool swapped)\r\n\t\t{\r\n\t\t\tTTF_ByteSwappedUNICODE(swapped);\r\n\t\t}\r\n\r\n\t\tFont::Style FontExtend::getStyle()\r\n\t\t{\r\n\t\t\tswitch (TTF_GetFontStyle(_ttfstruct))\r\n\t\t\t{\r\n\t\t\t\tcase TTF_STYLE_NORMAL : return Font::Normal; break;\r\n\t\t\t\tcase TTF_STYLE_BOLD : return Font::Bold; break;\r\n\t\t\t\tcase TTF_STYLE_ITALIC : return Font::Italic; break;\r\n\t\t\t\tcase TTF_STYLE_UNDERLINE :return Font::Underline; break;\r\n\t\t\t}\r\n\t\t\treturn Font::Default;\r\n\t\t}\r\n\r\n\t\tvoid FontExtend::setStyle(Font::Style s)\r\n\t\t\t{\r\n\t\t\t\tswitch (s)\r\n\t\t\t\t{\r\n\t\t\t\t\tcase Font::Normal : TTF_SetFontStyle(_ttfstruct,TTF_STYLE_NORMAL); break;\r\n\t\t\t\t\tcase Font::Bold : TTF_SetFontStyle(_ttfstruct,TTF_STYLE_BOLD); break;\r\n\t\t\t\t\tcase Font::Italic : TTF_SetFontStyle(_ttfstruct,TTF_STYLE_ITALIC); break;\r\n\t\t\t\t\tcase Font::Underline : TTF_SetFontStyle(_ttfstruct,TTF_STYLE_UNDERLINE); break;\r\n\t\t\t\t\tcase Font::Default : \/\/TODO : Implement using parent class\r\n\t\t\t\t\t\tdefault : break;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\t\r\n\t\t\tint FontExtend::height()\r\n\t\t\t{\r\n\t\t\t\treturn TTF_FontHeight(_ttfstruct);\r\n\t\t\t}\r\n\r\n\t\t\tint FontExtend::ascent()\r\n\t\t\t{\r\n\t\t\t\treturn TTF_FontAscent(_ttfstruct);\r\n\t\t\t}\r\n\r\n\t\t\tint FontExtend::descent()\r\n\t\t\t{\r\n\t\t\t\treturn TTF_FontDescent(_ttfstruct);\r\n\t\t\t}\r\n\r\n\t\t\tint FontExtend::lineskip()\r\n\t\t\t{\r\n\t\t\t\treturn TTF_FontLineSkip(_ttfstruct);\r\n\t\t\t}\r\n\r\n\t\t\tlong FontExtend::faces()\r\n\t\t\t{\r\n\t\t\t\treturn TTF_FontFaces(_ttfstruct);\r\n\t\t\t}\r\n\r\n\t\t\tbool FontExtend::faceIsFixedWidth()\r\n\t\t\t{\r\n\t\t\t\treturn TTF_FontFaceIsFixedWidth(_ttfstruct) != 0 ;\r\n\t\t\t}\r\n\r\n\t\t\tstd::string FontExtend::faceFamilyName()\r\n\t\t\t{\r\n\t\t\t\treturn std::string( TTF_FontFaceFamilyName(_ttfstruct) );\r\n\t\t\t}\r\n\r\n\t\t\tstd::string FontExtend::faceStyleName()\r\n\t\t\t{\r\n\t\t\t\treturn std::string( TTF_FontFaceStyleName(_ttfstruct) );\r\n\t\t\t}\r\n\r\n\t\t\tRect FontExtend::size(std::string text)\r\n\t\t\t{\r\n\t\t\t\tint w,h;\r\n\t\t\t\tint test = TTF_SizeText(_ttfstruct,text.c_str(),&w,&h);\r\n\t\t\t\tif (!test) \/\/success\r\n\t\t\t\t\treturn Rect(w,h);\r\n\t\t\t\t\/\/failure\r\n\t\t\t\tLog << nl << Optional::GetError(Optional::TTF);\r\n\t\t\t\treturn Rect(0,0);\r\n\t\t\t}\r\n\r\n\r\n#endif \/\/HAVE_SDLTTF\r\n\r\n\r\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\t\/\/ INTERFACE FONT IMPLEMENTATION \/\/\r\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n\r\n\tFont::Font(std::string filename, int ptsize) throw (std::logic_error)\r\n\r\n#ifdef HAVE_SDLTTF\r\n\t\t\ttry : _font( new FontExtend(filename,ptsize))\r\n#else\r\n\t\t\ttry : _font( new FontImpl(filename,ptsize))\r\n#endif\r\n{\r\n\tif(_font==NULL) {\r\n\t\tthrow std::logic_error(\"Font Support not available\");\r\n    }\r\n}\r\ncatch (std::exception& e)\r\n{\r\n\tLog << nl << \"Exception catched in Font Constructor :\"  << nl <<\r\n            e.what() << std::endl;\r\n            \/\/TODO : much more explicit error message...\r\n};\r\n\r\n\/\/Copy Constructor\r\nFont::Font(const Font &font)\r\n: _font(font._font)\r\n{\r\n}\r\n\r\n\r\n\tFont::~Font()\r\n{\r\n\tdelete _font, _font=NULL;\r\n}\r\n\r\n\r\nRGBSurface * Font::render(std::string text, Color c, RenderMode mode, Color bgc) const\r\n{\r\n\treturn new RGBSurface(_font->render(text,c,bgc,mode));\r\n}\r\n\r\n\tFont::Style Font::getStyle()\r\n\t{\r\n\t\treturn _font->getStyle();\r\n\t}\r\n\r\n\tvoid Font::setStyle(Style s)\r\n\t{\r\n\t\t_font->setStyle(s);\r\n\t}\r\n\t\r\n\r\n\r\n\r\n}\r\n}\r\n<commit_msg>Handled the crash on quit on VS when using fonts (need to be tweaked !).<commit_after>#include \"SDLFont.hh\"\r\n\r\n#include \"SDLConfig.hh\"\r\n#include \"SDLResources.inc\"\r\n\r\n\r\n\r\nnamespace RAGE\r\n{\r\nnamespace SDL\r\n{\r\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\t\/\/ DEFAULT FONT IMPLEMENTATION \/\/\r\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\t\r\n\/\/Class implementing the default font character render (with alpha masks)\r\n\tclass FontImpl\r\n\t{\r\n\r\n\t\t\/\/this version keeps the right value for render\r\n\t\tconst RGBSurface _fontsurf;\r\n\r\n\t\t\/\/all the rectangles become {0,0,0,0} on render for some reason\r\n\t\tstd::vector<Rect> alphalookup;\r\n\t\t\r\n\t\tpublic :\r\n\t\t\t\r\n\t\t \/\/image 16x14 character, 225x225 pixels (all start at 0, not 1)\r\n\t\t\tFontImpl()  throw (std::logic_error);\r\n\t\t\tFontImpl(const FontImpl & font);\r\n\t\t\tvirtual ~FontImpl();\r\n\t\t\r\n\t\t\tvirtual Rect getSize(const std::string & text);\r\n\r\n\t\t\tvirtual Font::Style getStyle() { return Font::Default;}\r\n\t\t\tvirtual void setStyle(Font::Style s) { } \/\/does nothing only one style available in default mode.\r\n\t\t\t\r\n\t\t\t\/\/Rendering\r\n\t\t\t\/\/bgc is used only if mode == shaded. Otherwise it s transparent\r\n\t\t\tvirtual SDL_Surface * render(const std::string & text,Color c, Color bgc = Color(), Font::RenderMode mode = Font::Solid ) const;\r\n\t\t\r\n\t};\r\n\r\n\tFontImpl::FontImpl()  throw (std::logic_error)\r\n\t\t\ttry: _fontsurf(RWOps(_defaultFont,sizeof(_defaultFont))), alphalookup()\r\n\t\t\t{\r\n\t\t\t\/\/building alphalookup\r\n\t\t\t\tfor (int line = 0; line < 14; line++)\r\n\t\t\t\t{\r\n\t\t\t\t\tfor (int col = 0; col < 16; col++)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\talphalookup.push_back(Rect(col * 14, line*16, 14,16));\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tcatch (std::exception& e)\r\n\t\t\t{\r\n\t\t\t\tLog << nl << \"Exception caught in internal FontImpl constructor : \" << e.what();\r\n\t\t\t};\r\n\r\n\t\t\tRect FontImpl::getSize(const std::string & text)\r\n\t\t\t{\r\n\t\t\t\/\/number of lines in text -> todo\r\n\r\n\t\t\t\/\/number of character max per line\r\n\t\t\t\tRect r(text.size() * 14,16);\r\n\t\t\t\treturn r;\r\n\t\t\t}\r\n\r\n\t\t\tFontImpl::FontImpl(const FontImpl & font) : _fontsurf(font._fontsurf)\r\n\t\t\t{\r\n\t\t\t\talphalookup.assign(font.alphalookup.begin(),font.alphalookup.end());\r\n\t\t\t}\r\n\r\n\t\t\tFontImpl::~FontImpl()\r\n\t\t\t{\r\n\t\t\t\talphalookup.clear();\r\n\t\t\t}\r\n\r\n\t\t\tSDL_Surface * FontImpl::render(const std::string & text,Color c, Color bgc, Font::RenderMode mode) const\r\n\t\t\t{\r\n\t\t\t\/\/TODO\r\n\/\/  \t\t\tSDL_Surface * result = SDL_CreateRGBSurface(RGBFlags, getSize(text).getw(), getSize(text).geth(), 16, r_default_mask, g_default_mask, b_default_mask, a_default_mask);\r\n\/\/ \t\t\tfor (unsigned int i= 0; i< text.size(); i++)\r\n\/\/ \t\t\t{\r\n\/\/ \t\t\t\tresult->blit(_fontsurf,Rect(0,i*14,14,16),alphalookup[text[i]]);\r\n\/\/ \t\t\t\treturn NULL;\r\n\/\/ \t\t\t}\r\n\/\/ \t\t\treturn result;\r\n\t\t\t\treturn NULL;\r\n\t\t\t}\r\n\r\n\r\n\t\t\t\r\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\t\/\/ TTF FONT IMPLEMENTATION \/\/\r\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\t\r\n\/\/if SDL_TTF used, provide a class to be used as a bridge.\r\n\/\/this way the client doesnt have to take care of which function is available\r\n#ifdef HAVE_SDLTTF\r\n\r\n\tclass FontExtend : public FontImpl\r\n\t{\r\n\t\t\/\/shared between copies of the same instance\r\n\t\tTTF_Font * _ttfstruct;\r\n\t\tint _ref;\r\n\r\n\t\tpublic:\r\n\t\t\t\/\/Constructor\r\n\t\t\tFontExtend(std::string filename, int ptsize) throw (std::logic_error);\r\n\t\t\t\r\n\t\t\t\/\/Copy Constructor\r\n\t\t\t\/\/copy completely the content of *_ttfstruct\r\n\t\t\tFontExtend(const FontExtend & );\r\n\t\t\t\/\/Assignement operator\r\n\t\t\tFontExtend & operator=(const FontExtend &);\r\n\r\n\t\t\t\/\/Destructor\r\n\t\t\t~FontExtend();\r\n\r\n\r\n\t\t\t\/\/Attributes Access\r\n\t\t\tstatic void byteSwapUNICODE(bool swapped);\r\n\r\n\t\t\tFont::Style getStyle();\r\n\t\t\tvoid setStyle(Font::Style s);\r\n\t\t\t\r\n\t\t\tint height();\r\n\t\t\tint ascent();\r\n\t\t\tint descent();\r\n\t\t\tint lineskip();\r\n\t\t\tlong faces();\r\n\t\t\tbool faceIsFixedWidth();\r\n\t\t\tstd::string faceFamilyName();\r\n\t\t\tstd::string faceStyleName();\r\n\t\t\t\r\n\t\t\tRect size(std::string text);\r\n\r\n\t\t\t\/\/The Background color is used only if RenderMode = Shaded otherwise the background is transparent.\r\n\t\t\tSDL_Surface * render(const std::string& text, Color c, Color bgc = Color(), Font::RenderMode mode = Font::Solid) const;\r\n\t};\r\n\r\n\r\n\/\/Implementation of class Font\r\n\tFontExtend::FontExtend(std::string filename, int ptsize) throw (std::logic_error)\r\n\t\t\ttry : FontImpl(),_ttfstruct(TTF_OpenFont(filename.c_str(),ptsize)), _ref(1)\r\n\t\t{\r\n\t\t\tif(_ttfstruct==NULL) {\r\n\t\t\t\tthrow std::logic_error(\"TTF_OpenFont Error : \" + Optional::GetError(Optional::TTF));\r\n\t\t\t}\r\n\t\t}\r\n\t\tcatch (std::exception& e)\r\n\t\t{\r\n\t\t\tLog << nl << \"Exception catched in internal FontExtent Constructor :\"  << nl <<\r\n\t\t\t\t\te.what() << std::endl;\r\n\t\t            \/\/TODO : much more explicit error message...\r\n\t\t};\r\n\r\n\t\tFontExtend::FontExtend(const FontExtend & font)\r\n\t\t{\r\n\t\t\t++_ref;\r\n\t\t\t_ttfstruct = font._ttfstruct;\r\n\t\t}\r\n\r\n\t\tFontExtend::~FontExtend()\r\n\t\t{\r\n\t\t\t--_ref;\r\n\t\t\tif (_ref == 0)\r\n\t\t\t\tTTF_CloseFont(_ttfstruct), _ttfstruct=NULL;\r\n\t\t}\r\n\r\n\t\tSDL_Surface * FontExtend::render(const std::string& text, Color c, Color bgc, Font::RenderMode mode) const\r\n\t\t{\r\n\t\t\tSDL_Surface * surf;\r\n\t\t\tswitch ( mode )\r\n\t\t\t{\r\n\t\t\t\tcase Font::Blended : surf=TTF_RenderText_Blended(_ttfstruct,text.c_str(), c.get_SDL()); break;\r\n\t\t\t\tcase Font::Shaded : surf=TTF_RenderText_Shaded(_ttfstruct,text.c_str(),c.get_SDL(), bgc.get_SDL()); break;\r\n\t\t\t\tcase Font::Solid :\r\n\t\t\t\tdefault: surf=TTF_RenderText_Solid(_ttfstruct,text.c_str(), c.get_SDL()); break;\r\n\t\t\t}\r\n\t\t\treturn surf;\r\n\t\t}\r\n\r\n\t\t\/\/Attributes Access\r\n\t\tvoid FontExtend::byteSwapUNICODE(bool swapped)\r\n\t\t{\r\n\t\t\tTTF_ByteSwappedUNICODE(swapped);\r\n\t\t}\r\n\r\n\t\tFont::Style FontExtend::getStyle()\r\n\t\t{\r\n\t\t\tswitch (TTF_GetFontStyle(_ttfstruct))\r\n\t\t\t{\r\n\t\t\t\tcase TTF_STYLE_NORMAL : return Font::Normal; break;\r\n\t\t\t\tcase TTF_STYLE_BOLD : return Font::Bold; break;\r\n\t\t\t\tcase TTF_STYLE_ITALIC : return Font::Italic; break;\r\n\t\t\t\tcase TTF_STYLE_UNDERLINE :return Font::Underline; break;\r\n\t\t\t}\r\n\t\t\treturn Font::Default;\r\n\t\t}\r\n\r\n\t\tvoid FontExtend::setStyle(Font::Style s)\r\n\t\t\t{\r\n\t\t\t\tswitch (s)\r\n\t\t\t\t{\r\n\t\t\t\t\tcase Font::Normal : TTF_SetFontStyle(_ttfstruct,TTF_STYLE_NORMAL); break;\r\n\t\t\t\t\tcase Font::Bold : TTF_SetFontStyle(_ttfstruct,TTF_STYLE_BOLD); break;\r\n\t\t\t\t\tcase Font::Italic : TTF_SetFontStyle(_ttfstruct,TTF_STYLE_ITALIC); break;\r\n\t\t\t\t\tcase Font::Underline : TTF_SetFontStyle(_ttfstruct,TTF_STYLE_UNDERLINE); break;\r\n\t\t\t\t\tcase Font::Default : \/\/TODO : Implement using parent class\r\n\t\t\t\t\t\tdefault : break;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\t\r\n\t\t\tint FontExtend::height()\r\n\t\t\t{\r\n\t\t\t\treturn TTF_FontHeight(_ttfstruct);\r\n\t\t\t}\r\n\r\n\t\t\tint FontExtend::ascent()\r\n\t\t\t{\r\n\t\t\t\treturn TTF_FontAscent(_ttfstruct);\r\n\t\t\t}\r\n\r\n\t\t\tint FontExtend::descent()\r\n\t\t\t{\r\n\t\t\t\treturn TTF_FontDescent(_ttfstruct);\r\n\t\t\t}\r\n\r\n\t\t\tint FontExtend::lineskip()\r\n\t\t\t{\r\n\t\t\t\treturn TTF_FontLineSkip(_ttfstruct);\r\n\t\t\t}\r\n\r\n\t\t\tlong FontExtend::faces()\r\n\t\t\t{\r\n\t\t\t\treturn TTF_FontFaces(_ttfstruct);\r\n\t\t\t}\r\n\r\n\t\t\tbool FontExtend::faceIsFixedWidth()\r\n\t\t\t{\r\n\t\t\t\treturn TTF_FontFaceIsFixedWidth(_ttfstruct) != 0 ;\r\n\t\t\t}\r\n\r\n\t\t\tstd::string FontExtend::faceFamilyName()\r\n\t\t\t{\r\n\t\t\t\treturn std::string( TTF_FontFaceFamilyName(_ttfstruct) );\r\n\t\t\t}\r\n\r\n\t\t\tstd::string FontExtend::faceStyleName()\r\n\t\t\t{\r\n\t\t\t\treturn std::string( TTF_FontFaceStyleName(_ttfstruct) );\r\n\t\t\t}\r\n\r\n\t\t\tRect FontExtend::size(std::string text)\r\n\t\t\t{\r\n\t\t\t\tint w,h;\r\n\t\t\t\tint test = TTF_SizeText(_ttfstruct,text.c_str(),&w,&h);\r\n\t\t\t\tif (!test) \/\/success\r\n\t\t\t\t\treturn Rect(w,h);\r\n\t\t\t\t\/\/failure\r\n\t\t\t\tLog << nl << Optional::GetError(Optional::TTF);\r\n\t\t\t\treturn Rect(0,0);\r\n\t\t\t}\r\n\r\n\r\n#endif \/\/HAVE_SDLTTF\r\n\r\n\r\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\t\/\/ INTERFACE FONT IMPLEMENTATION \/\/\r\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n\r\n\tFont::Font(std::string filename, int ptsize) throw (std::logic_error)\r\n\r\n#ifdef HAVE_SDLTTF\r\n\t\t\ttry : _font( new FontExtend(filename,ptsize))\r\n#else\r\n\t\t\ttry : _font( new FontImpl(filename,ptsize))\r\n#endif\r\n{\r\n\tif(_font==NULL) {\r\n\t\tthrow std::logic_error(\"Font Support not available\");\r\n    }\r\n}\r\ncatch (std::exception& e)\r\n{\r\n\tLog << nl << \"Exception catched in Font Constructor :\"  << nl <<\r\n            e.what() << std::endl;\r\n            \/\/TODO : much more explicit error message...\r\n};\r\n\r\n\/\/Copy Constructor\r\nFont::Font(const Font &font)\r\n: _font(font._font)\r\n{\r\n}\r\n\r\n\r\nFont::~Font()\r\n{\r\n \/\/doesn't work on VS coz the destructor is called 2 times and the 2nd time it coz the exception: 0xC0000005: Access violation reading location 0xfeeefeee.\r\n#ifndef WIN32\r\n\tdelete _font, _font=NULL;\r\n#endif\r\n}\r\n\r\n\r\nRGBSurface * Font::render(std::string text, Color c, RenderMode mode, Color bgc) const\r\n{\r\n\treturn new RGBSurface(_font->render(text,c,bgc,mode));\r\n}\r\n\r\n\tFont::Style Font::getStyle()\r\n\t{\r\n\t\treturn _font->getStyle();\r\n\t}\r\n\r\n\tvoid Font::setStyle(Style s)\r\n\t{\r\n\t\t_font->setStyle(s);\r\n\t}\r\n\t\r\n\r\n\r\n\r\n}\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Author: Fabio Federici <fabio.federici@univaq.it>\n * Copyright (c) 2015 Fabio Federici.\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 <sstream>\n\n#include <mraa.hpp>\n#include <grove.hpp>\n#include <jhd1313m1.hpp>\n#include <guvas12d.hpp>\n#include <buzzer.hpp>\n#include <buzzer_tones.h>\n\n\/**\n * This example helps you to avoid sunburn.\n *\/\n\n\/*\n * Some colors for LCD background\n *\/\n#define LIME_GREEN 50,205,50\n#define YELLOW     255,255,0\n#define ORANGE     255,165,0\n#define RED        255,0,0\n#define VIOLET     238,130,238\n\/*\n * From http:\/\/www.seeedstudio.com\/wiki\/Grove_-_UV_Sensor\n * The output and the UV index is linear:\n * illumination intensity = 307 * Vsig\n * where:\n * Vsig is the value of voltage measured from the SIG pin of the Grove interface, unit V.\n * illumination intensity unit: mW\/m2 for the combination strength of UV light with wavelength range: 240nm~370nm\n *\/\n#define GUVA_RAW_TO_INTENSITY_COEFF 307\n\n#define PLATFORM_VOLTAGE            5   \/\/ V\n#define UV_SAMPLE_PER_QUERY         100\n#define UV_INTENSITY_TO_INDEX_COEFF 200\n#define UV_INDEX_THRESHOLD          8\n#define TEMPERATURE_THRESHOLD       30\n\n\/\/ Define the following if using a Grove Pi Shield for UP2 board\n#define USING_GROVE_PI_SHIELD\n\/*\n * Check dangerous conditions and kindly remind the user about risk of sunburn.\n * Use LCD and buzzer to notify warning conditions.\n *\/\nvoid check_warning_conditions(upm::GUVAS12D *UV_sensor,\n    upm::GroveTemp* temperature_sensor, upm::Buzzer* buzzer,\n    upm::Jhd1313m1 *lcd) {\n\n  float raw_uvIntensity = 0;\n  int temperature = 0;\n  std::stringstream row_1, row_2; \/\/LCD rows\n\n  \/\/ Update UV intensity and temperature values\n  raw_uvIntensity = UV_sensor->value(PLATFORM_VOLTAGE, UV_SAMPLE_PER_QUERY);\n  temperature = temperature_sensor->value();\n\n  \/\/ Calculate real UV intensity and estimate intensity index\n  \/\/ See https:\/\/en.wikipedia.org\/wiki\/Ultraviolet_index\n  float uvIntensity = raw_uvIntensity * GUVA_RAW_TO_INTENSITY_COEFF;\n  int uvIndex = uvIntensity \/ UV_INTENSITY_TO_INDEX_COEFF;\n\n  \/\/ Display UV intensity and temperature values on LCD\n  row_1 << \"Temp: \" << temperature << \"    \";\n  lcd->setCursor(0, 0);\n  lcd->write(row_1.str());\n\n  \/\/ Remind possible risk (time to sunburn)\n  lcd->setCursor(1, 0);\n\n  if (uvIndex <= 4) {\n    row_2 << \"UV: \" << uvIntensity << \"(\" << uvIndex << \")    \";\n  } else if (uvIndex > 4 && uvIndex <= 7) {\n    row_2 << \"Sunburn in 30 m\";\n  } else if (uvIndex > 7 && uvIndex <= 9) {\n    row_2 << \"Sunburn in 20 m\";\n  } else if (uvIndex > 9) {\n    row_2 << \"Sunburn in 10 m\";\n  }\n\n  lcd->write(row_2.str());\n\n  \/\/ Color the display according UV index safety\n\n  if (uvIndex <= 2) {\n    lcd->setColor(LIME_GREEN);\n  } else if (uvIndex > 2 && uvIndex <= 5) {\n    lcd->setColor(YELLOW);\n  } else if (uvIndex > 5 && uvIndex <= 7) {\n    lcd->setColor(ORANGE);\n  } else if (uvIndex > 7 && uvIndex <= 10) {\n    lcd->setColor(RED);\n  } else if (uvIndex >= 10) {\n    lcd->setColor(VIOLET);\n  }\n\n  if (uvIndex >= UV_INDEX_THRESHOLD || temperature > TEMPERATURE_THRESHOLD) {\n    buzzer->playSound(BUZZER_DO, 1000000);\n  }\n}\n\nint main() {\n  string unknownPlatformMessage = \"This sample uses the MRAA\/UPM library for I\/O access, \"\n        \"you are running it on an unrecognized platform. \"\n      \"You may need to modify the MRAA\/UPM initialization code to \"\n      \"ensure it works properly on your platform.\\n\\n\";\n\n  int aPinIn1, aPinIn2, dPinOut, i2cPort;\n\n  \/\/ check which board we are running on\n  Platform platform = getPlatformType();\n  switch (platform) {\n    case INTEL_UP2:\n      i2cPort = 0; \/\/ I2C\n#ifdef USING_GROVE_PI_SHIELD \/\/Offset port number by 512\n      aPinIn1 = 1 + 512; \/\/ A1\n      aPinIn2 = 2 + 512; \/\/ A2\n      dPinOut = 3 + 512; \/\/ D3\n      break;\n#else\n      cerr << \"Not using Grove provide your pinout\" << endl;\n      return -1;\n#endif\n    default:\n          cerr << unknownPlatformMessage;\n  }\n#ifdef USING_GROVE_PI_SHIELD\n  addSubplatform(GROVEPI, \"0\");\n#endif\n  \/\/ check if running as root\n  int euid = geteuid();\n  if (euid) {\n    cerr << \"This project uses Mraa I\/O operations, but you're not running as 'root'.\\n\"\n        \"The IO operations below might fail.\\n\"\n        \"See the project's Readme for more info.\\n\\n\";\n  }\n\n  \/\/ UV sensor connected\n  upm::GUVAS12D *UV_sensor = new upm::GUVAS12D(aPinIn1);\n\n  \/\/ Temperature sensor\n  upm::GroveTemp* temp_sensor = new upm::GroveTemp(aPinIn2);\n\n  \/\/ Buzzer connected\n  upm::Buzzer* buzzer = new upm::Buzzer(dPinOut);\n\n  \/\/ LCD connected\n  upm::Jhd1313m1* lcd = new upm::Jhd1313m1(i2cPort);\n\n  \/\/ Simple error checking\n  if ((UV_sensor == NULL) || (temp_sensor == NULL) || (buzzer == NULL)\n      || (lcd == NULL)) {\n    std::cerr << \"Can't create all objects, exiting\" << std::endl;\n    return mraa::ERROR_UNSPECIFIED;\n  }\n\n  buzzer->stopSound();\n\n  \/\/ Loop forever checking warning conditions\n  for (;;) {\n    check_warning_conditions(UV_sensor, temp_sensor, buzzer, lcd);\n    sleep(1);\n  }\n\n  return mraa::SUCCESS;\n}\n<commit_msg>Fixing missing namespace in tanning responsibly<commit_after>\/*\n * Author: Fabio Federici <fabio.federici@univaq.it>\n * Copyright (c) 2015 Fabio Federici.\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 <sstream>\n\n#include <mraa.hpp>\n#include <grove.hpp>\n#include <jhd1313m1.hpp>\n#include <guvas12d.hpp>\n#include <buzzer.hpp>\n#include <buzzer_tones.h>\n\nusing namespace mraa;\nusing namespace std;\n\n\/**\n * This example helps you to avoid sunburn.\n *\/\n\n\/*\n * Some colors for LCD background\n *\/\n#define LIME_GREEN 50,205,50\n#define YELLOW     255,255,0\n#define ORANGE     255,165,0\n#define RED        255,0,0\n#define VIOLET     238,130,238\n\/*\n * From http:\/\/www.seeedstudio.com\/wiki\/Grove_-_UV_Sensor\n * The output and the UV index is linear:\n * illumination intensity = 307 * Vsig\n * where:\n * Vsig is the value of voltage measured from the SIG pin of the Grove interface, unit V.\n * illumination intensity unit: mW\/m2 for the combination strength of UV light with wavelength range: 240nm~370nm\n *\/\n#define GUVA_RAW_TO_INTENSITY_COEFF 307\n\n#define PLATFORM_VOLTAGE            5   \/\/ V\n#define UV_SAMPLE_PER_QUERY         100\n#define UV_INTENSITY_TO_INDEX_COEFF 200\n#define UV_INDEX_THRESHOLD          8\n#define TEMPERATURE_THRESHOLD       30\n\n\/\/ Define the following if using a Grove Pi Shield for UP2 board\n#define USING_GROVE_PI_SHIELD\n\/*\n * Check dangerous conditions and kindly remind the user about risk of sunburn.\n * Use LCD and buzzer to notify warning conditions.\n *\/\nvoid check_warning_conditions(upm::GUVAS12D *UV_sensor,\n    upm::GroveTemp* temperature_sensor, upm::Buzzer* buzzer,\n    upm::Jhd1313m1 *lcd) {\n\n  float raw_uvIntensity = 0;\n  int temperature = 0;\n  std::stringstream row_1, row_2; \/\/LCD rows\n\n  \/\/ Update UV intensity and temperature values\n  raw_uvIntensity = UV_sensor->value(PLATFORM_VOLTAGE, UV_SAMPLE_PER_QUERY);\n  temperature = temperature_sensor->value();\n\n  \/\/ Calculate real UV intensity and estimate intensity index\n  \/\/ See https:\/\/en.wikipedia.org\/wiki\/Ultraviolet_index\n  float uvIntensity = raw_uvIntensity * GUVA_RAW_TO_INTENSITY_COEFF;\n  int uvIndex = uvIntensity \/ UV_INTENSITY_TO_INDEX_COEFF;\n\n  \/\/ Display UV intensity and temperature values on LCD\n  row_1 << \"Temp: \" << temperature << \"    \";\n  lcd->setCursor(0, 0);\n  lcd->write(row_1.str());\n\n  \/\/ Remind possible risk (time to sunburn)\n  lcd->setCursor(1, 0);\n\n  if (uvIndex <= 4) {\n    row_2 << \"UV: \" << uvIntensity << \"(\" << uvIndex << \")    \";\n  } else if (uvIndex > 4 && uvIndex <= 7) {\n    row_2 << \"Sunburn in 30 m\";\n  } else if (uvIndex > 7 && uvIndex <= 9) {\n    row_2 << \"Sunburn in 20 m\";\n  } else if (uvIndex > 9) {\n    row_2 << \"Sunburn in 10 m\";\n  }\n\n  lcd->write(row_2.str());\n\n  \/\/ Color the display according UV index safety\n\n  if (uvIndex <= 2) {\n    lcd->setColor(LIME_GREEN);\n  } else if (uvIndex > 2 && uvIndex <= 5) {\n    lcd->setColor(YELLOW);\n  } else if (uvIndex > 5 && uvIndex <= 7) {\n    lcd->setColor(ORANGE);\n  } else if (uvIndex > 7 && uvIndex <= 10) {\n    lcd->setColor(RED);\n  } else if (uvIndex >= 10) {\n    lcd->setColor(VIOLET);\n  }\n\n  if (uvIndex >= UV_INDEX_THRESHOLD || temperature > TEMPERATURE_THRESHOLD) {\n    buzzer->playSound(BUZZER_DO, 1000000);\n  }\n}\n\nint main() {\n  string unknownPlatformMessage = \"This sample uses the MRAA\/UPM library for I\/O access, \"\n        \"you are running it on an unrecognized platform. \"\n      \"You may need to modify the MRAA\/UPM initialization code to \"\n      \"ensure it works properly on your platform.\\n\\n\";\n\n  int aPinIn1, aPinIn2, dPinOut, i2cPort;\n\n  \/\/ check which board we are running on\n  Platform platform = getPlatformType();\n  switch (platform) {\n    case INTEL_UP2:\n      i2cPort = 0; \/\/ I2C\n#ifdef USING_GROVE_PI_SHIELD \/\/Offset port number by 512\n      aPinIn1 = 1 + 512; \/\/ A1\n      aPinIn2 = 2 + 512; \/\/ A2\n      dPinOut = 3 + 512; \/\/ D3\n      break;\n#else\n      cerr << \"Not using Grove provide your pinout\" << endl;\n      return -1;\n#endif\n    default:\n          cerr << unknownPlatformMessage;\n  }\n#ifdef USING_GROVE_PI_SHIELD\n  addSubplatform(GROVEPI, \"0\");\n#endif\n  \/\/ check if running as root\n  int euid = geteuid();\n  if (euid) {\n    cerr << \"This project uses Mraa I\/O operations, but you're not running as 'root'.\\n\"\n        \"The IO operations below might fail.\\n\"\n        \"See the project's Readme for more info.\\n\\n\";\n  }\n\n  \/\/ UV sensor connected\n  upm::GUVAS12D *UV_sensor = new upm::GUVAS12D(aPinIn1);\n\n  \/\/ Temperature sensor\n  upm::GroveTemp* temp_sensor = new upm::GroveTemp(aPinIn2);\n\n  \/\/ Buzzer connected\n  upm::Buzzer* buzzer = new upm::Buzzer(dPinOut);\n\n  \/\/ LCD connected\n  upm::Jhd1313m1* lcd = new upm::Jhd1313m1(i2cPort);\n\n  \/\/ Simple error checking\n  if ((UV_sensor == NULL) || (temp_sensor == NULL) || (buzzer == NULL)\n      || (lcd == NULL)) {\n    std::cerr << \"Can't create all objects, exiting\" << std::endl;\n    return mraa::ERROR_UNSPECIFIED;\n  }\n\n  buzzer->stopSound();\n\n  \/\/ Loop forever checking warning conditions\n  for (;;) {\n    check_warning_conditions(UV_sensor, temp_sensor, buzzer, lcd);\n    sleep(1);\n  }\n\n  return mraa::SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Update test case to use the IMUPlacer class as well as the calibrateModelFromOrientations method<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright eeGeo Ltd (2012-2015), All Rights Reserved\n\n#include \"SearchMenuView.h\"\n#include \"ReflectionHelpers.h\"\n\nusing namespace ExampleApp::Helpers::ReflectionHelpers;\n\nusing namespace System;\nusing namespace System::Reflection;\n\nnamespace ExampleApp\n{\n    namespace SearchMenu\n    {\n        namespace View\n        {\n            SearchMenuView::SearchMenuView(WindowsNativeState& nativeState,\n                const std::string& viewClassName)\n                : Menu::View::MenuView(nativeState, viewClassName)\n                , m_currentSections(0)\n            {\n                m_uiViewClass = GetTypeFromEntryAssembly(\"ExampleAppWPF.SearchMenuView\");\n\n                mSetSearchSection.SetupMethod(m_uiViewClass, m_uiView, \"SetSearchSection\");\n                mDisableEditText.SetupMethod(m_uiViewClass, m_uiView, \"DisableEditText\");\n                mEnableEditText.SetupMethod(m_uiViewClass, m_uiView, \"EnableEditText\");\n                mSetEditText.SetupMethod(m_uiViewClass, m_uiView, \"SetEditText\");\n                mSetSearchResultCount.SetupMethod(m_uiViewClass, m_uiView, \"SetSearchResultCount\");\n            }\n\n            void SearchMenuView::SetSearchSection(Menu::View::IMenuSectionViewModel& searchSection)\n            {\n                int resultCount = static_cast<int>(searchSection.Size());\n\n                if (resultCount <= 0)\n                {\n                    return;\n                }\n\n                array<System::String^>^ searchResultArray = gcnew array<System::String^>(resultCount);\n\n                for (int i = 0; i < resultCount; ++i)\n                {\n                    System::String^ str = ConvertUTF8ToManagedString(searchSection.GetItemAtIndex(i).SerializeJson());\n                    searchResultArray[i] = str;\n                }\n\n                mSetSearchSection(System::String::Empty, searchResultArray);\n            }\n\n            void SearchMenuView::RemoveSeachKeyboard()\n            {\n                \n            }\n\n            void SearchMenuView::DisableEditText()\n            {\n                mDisableEditText();\n            }\n\n            void SearchMenuView::EnableEditText()\n            {\n                mEnableEditText();\n            }\n\n            void SearchMenuView::SetEditText(const std::string& searchText, bool isCategory)\n            {\n                mSetEditText(gcnew System::String(searchText.c_str()), isCategory);\n            }\n\n            void SearchMenuView::SetSearchResultCount(int searchResultCount)\n            {\n                mSetSearchResultCount(searchResultCount);\n            }\n\n            void SearchMenuView::CollapseAll()\n            {\n                for (Menu::View::TSections::iterator it = m_currentSections.begin(); it != m_currentSections.end(); ++it)\n                {\n                    (*it)->Contract();\n                }\n\n                UpdateMenuSectionViews(m_currentSections);\n            }\n\n            void SearchMenuView::InsertSearchPeformedCallback(Eegeo::Helpers::ICallback1<const std::string&>& callback)\n            {\n                m_searchPerformedCallbacks.AddCallback(callback);\n            }\n\n            void SearchMenuView::RemoveSearchPeformedCallback(Eegeo::Helpers::ICallback1<const std::string&>& callback)\n            {\n                m_searchPerformedCallbacks.RemoveCallback(callback);\n            }\n\n            void SearchMenuView::SearchPerformed(const std::string& searchQuery)\n            {\n                m_searchPerformedCallbacks.ExecuteCallbacks(searchQuery);\n            }\n\n            void SearchMenuView::InsertSearchClearedCallback(Eegeo::Helpers::ICallback0& callback)\n            {\n                m_searchClearedCallbacks.AddCallback(callback);\n            }\n\n            void SearchMenuView::RemoveSearchClearedCallback(Eegeo::Helpers::ICallback0& callback)\n            {\n                m_searchClearedCallbacks.RemoveCallback(callback);\n            }\n\n            void SearchMenuView::OnSearchCleared()\n            {\n                m_searchClearedCallbacks.ExecuteCallbacks();\n            }\n\n            void SearchMenuView::InsertSearchItemSelectedCallback(Eegeo::Helpers::ICallback1<int>& callback)\n            {\n                m_searchItemSelectedCallbacks.AddCallback(callback);\n            }\n\n            void SearchMenuView::RemoveSearchItemSelectedCallback(Eegeo::Helpers::ICallback1<int>& callback)\n            {\n                m_searchItemSelectedCallbacks.RemoveCallback(callback);\n            }\n\n            void SearchMenuView::HandleSearchItemSelected(int index)\n            {\n               m_searchItemSelectedCallbacks.ExecuteCallbacks(index);\n            }\r\n\r\n            bool SearchMenuView::IsTableAnimating() const\n            {\n                return false;\n            }\n\n            void SearchMenuView::UpdateTableAnimation(float dt)\n            {\n\n            }\n\n            void SearchMenuView::SetTableCanInteract(bool interact)\r\n            {\r\n\r\n            }\r\n\r\n            void SearchMenuView::SetMenuSections(const std::vector<Menu::View::IMenuSectionViewModel*>& sections)\r\n            {\r\n                m_currentSections = sections;\r\n            }\r\n        }\n    }\n}<commit_msg>TC fix for Windows build - fixing up call site to UpdateMenuSectionViews. Buddy: Mark S<commit_after>\/\/ Copyright eeGeo Ltd (2012-2015), All Rights Reserved\n\n#include \"SearchMenuView.h\"\n#include \"ReflectionHelpers.h\"\n\nusing namespace ExampleApp::Helpers::ReflectionHelpers;\n\nusing namespace System;\nusing namespace System::Reflection;\n\nnamespace ExampleApp\n{\n    namespace SearchMenu\n    {\n        namespace View\n        {\n            SearchMenuView::SearchMenuView(WindowsNativeState& nativeState,\n                const std::string& viewClassName)\n                : Menu::View::MenuView(nativeState, viewClassName)\n                , m_currentSections(0)\n            {\n                m_uiViewClass = GetTypeFromEntryAssembly(\"ExampleAppWPF.SearchMenuView\");\n\n                mSetSearchSection.SetupMethod(m_uiViewClass, m_uiView, \"SetSearchSection\");\n                mDisableEditText.SetupMethod(m_uiViewClass, m_uiView, \"DisableEditText\");\n                mEnableEditText.SetupMethod(m_uiViewClass, m_uiView, \"EnableEditText\");\n                mSetEditText.SetupMethod(m_uiViewClass, m_uiView, \"SetEditText\");\n                mSetSearchResultCount.SetupMethod(m_uiViewClass, m_uiView, \"SetSearchResultCount\");\n            }\n\n            void SearchMenuView::SetSearchSection(Menu::View::IMenuSectionViewModel& searchSection)\n            {\n                int resultCount = static_cast<int>(searchSection.Size());\n\n                if (resultCount <= 0)\n                {\n                    return;\n                }\n\n                array<System::String^>^ searchResultArray = gcnew array<System::String^>(resultCount);\n\n                for (int i = 0; i < resultCount; ++i)\n                {\n                    System::String^ str = ConvertUTF8ToManagedString(searchSection.GetItemAtIndex(i).SerializeJson());\n                    searchResultArray[i] = str;\n                }\n\n                mSetSearchSection(System::String::Empty, searchResultArray);\n            }\n\n            void SearchMenuView::RemoveSeachKeyboard()\n            {\n                \n            }\n\n            void SearchMenuView::DisableEditText()\n            {\n                mDisableEditText();\n            }\n\n            void SearchMenuView::EnableEditText()\n            {\n                mEnableEditText();\n            }\n\n            void SearchMenuView::SetEditText(const std::string& searchText, bool isCategory)\n            {\n                mSetEditText(gcnew System::String(searchText.c_str()), isCategory);\n            }\n\n            void SearchMenuView::SetSearchResultCount(int searchResultCount)\n            {\n                mSetSearchResultCount(searchResultCount);\n            }\n\n            void SearchMenuView::CollapseAll()\n            {\n                for (Menu::View::TSections::iterator it = m_currentSections.begin(); it != m_currentSections.end(); ++it)\n                {\n                    (*it)->Contract();\n                }\n\n                UpdateMenuSectionViews(m_currentSections, false);\n            }\n\n            void SearchMenuView::InsertSearchPeformedCallback(Eegeo::Helpers::ICallback1<const std::string&>& callback)\n            {\n                m_searchPerformedCallbacks.AddCallback(callback);\n            }\n\n            void SearchMenuView::RemoveSearchPeformedCallback(Eegeo::Helpers::ICallback1<const std::string&>& callback)\n            {\n                m_searchPerformedCallbacks.RemoveCallback(callback);\n            }\n\n            void SearchMenuView::SearchPerformed(const std::string& searchQuery)\n            {\n                m_searchPerformedCallbacks.ExecuteCallbacks(searchQuery);\n            }\n\n            void SearchMenuView::InsertSearchClearedCallback(Eegeo::Helpers::ICallback0& callback)\n            {\n                m_searchClearedCallbacks.AddCallback(callback);\n            }\n\n            void SearchMenuView::RemoveSearchClearedCallback(Eegeo::Helpers::ICallback0& callback)\n            {\n                m_searchClearedCallbacks.RemoveCallback(callback);\n            }\n\n            void SearchMenuView::OnSearchCleared()\n            {\n                m_searchClearedCallbacks.ExecuteCallbacks();\n            }\n\n            void SearchMenuView::InsertSearchItemSelectedCallback(Eegeo::Helpers::ICallback1<int>& callback)\n            {\n                m_searchItemSelectedCallbacks.AddCallback(callback);\n            }\n\n            void SearchMenuView::RemoveSearchItemSelectedCallback(Eegeo::Helpers::ICallback1<int>& callback)\n            {\n                m_searchItemSelectedCallbacks.RemoveCallback(callback);\n            }\n\n            void SearchMenuView::HandleSearchItemSelected(int index)\n            {\n               m_searchItemSelectedCallbacks.ExecuteCallbacks(index);\n            }\r\n\r\n            bool SearchMenuView::IsTableAnimating() const\n            {\n                return false;\n            }\n\n            void SearchMenuView::UpdateTableAnimation(float dt)\n            {\n\n            }\n\n            void SearchMenuView::SetTableCanInteract(bool interact)\r\n            {\r\n\r\n            }\r\n\r\n            void SearchMenuView::SetMenuSections(const std::vector<Menu::View::IMenuSectionViewModel*>& sections)\r\n            {\r\n                m_currentSections = sections;\r\n            }\r\n        }\n    }\n}<|endoftext|>"}
{"text":"<commit_before>#include \"Hotkeys.h\"\n\n#include <CommCtrl.h>\n\n#include \"..\/3RVX\/HotkeyInfo.h\"\n#include \"..\/3RVX\/HotkeyManager.h\"\n#include \"..\/3RVX\/Logger.h\"\n#include \"..\/3RVX\/Settings.h\"\n#include \"..\/3RVX\/SkinInfo.h\"\n\n#include \"resource.h\"\n\nvoid Hotkeys::Initialize() {\n    using std::placeholders::_1;\n\n    INIT_CONTROL(LST_KEYS, ListView, _keyList);\n    _keyList.OnItemChange = std::bind(&Hotkeys::OnKeyListItemChanged, this, _1);\n    INIT_CONTROL(BTN_ADD, Button, _add);\n    INIT_CONTROL(BTN_REMOVE, Button, _remove);\n\n    INIT_CONTROL(BTN_KEYS, Button, _keys);\n    INIT_CONTROL(CMB_ACTION, ComboBox, _action);\n}\n\nvoid Hotkeys::LoadSettings() {\n    Settings *settings = Settings::Instance();\n\n    \/* Make highlighted items span the entire row in the list view *\/\n    _keyList.AddListExStyle(LVS_EX_FULLROWSELECT);\n\n    RECT dims = _keyList.Dimensions();\n    int width = dims.right - dims.left;\n\n    _keyList.AddColumn(hotkeysColumnStr, (int) (width * .485));\n    _keyList.AddColumn(actionColumnStr, (int) (width * .445));\n\n    for (std::wstring action : HotkeyInfo::ActionNames) {\n        _action.AddItem(action);\n    }\n\n    std::unordered_map<int, HotkeyInfo> hotkeys = settings->Hotkeys();\n    for (auto it = hotkeys.begin(); it != hotkeys.end(); ++it) {\n        _keyInfo.push_back(it->second);\n    }\n\n    for (unsigned int i = 0; i < _keyInfo.size(); ++i) {\n        \/\/LoadSelection(i);\n        HotkeyInfo hki = _keyInfo[i];\n        std::wstring hkStr = HotkeyManager::HotkeysToString(hki.keyCombination);\n        int idx = _keyList.AddItem(hkStr);\n        _keyList.ItemText(idx, 1, HotkeyInfo::ActionNames[hki.action]);\n    }\n\n\/\/    SelectItem(0);\n\n\n}\n\nvoid Hotkeys::SaveSettings() {\n    if (_hWnd == NULL) {\n        return;\n    }\n\n    CLOG(L\"Saving: Hotkeys\");\n    Settings *settings = Settings::Instance();\n}\n\nvoid Hotkeys::OnKeyListItemChanged(NMLISTVIEW *lv) {\n    if (lv->uChanged & LVIF_STATE) {\n        if (lv->uNewState & LVIS_SELECTED) {\n            OnKeyListSelectionChanged(lv->iItem);\n        }\n    }\n}\n\nvoid Hotkeys::OnKeyListSelectionChanged(int index) {\n    HotkeyInfo current = _keyInfo[index];\n    CLOG(L\"Selecting key combination %d:\", index);\n    QCLOG(L\"%s\", current.ToString().c_str());\n}<commit_msg>Clean up obsolete code<commit_after>#include \"Hotkeys.h\"\n\n#include <CommCtrl.h>\n\n#include \"..\/3RVX\/HotkeyInfo.h\"\n#include \"..\/3RVX\/HotkeyManager.h\"\n#include \"..\/3RVX\/Logger.h\"\n#include \"..\/3RVX\/Settings.h\"\n#include \"..\/3RVX\/SkinInfo.h\"\n\n#include \"resource.h\"\n\nvoid Hotkeys::Initialize() {\n    using std::placeholders::_1;\n\n    INIT_CONTROL(LST_KEYS, ListView, _keyList);\n    _keyList.OnItemChange = std::bind(&Hotkeys::OnKeyListItemChanged, this, _1);\n    INIT_CONTROL(BTN_ADD, Button, _add);\n    INIT_CONTROL(BTN_REMOVE, Button, _remove);\n\n    INIT_CONTROL(BTN_KEYS, Button, _keys);\n    INIT_CONTROL(CMB_ACTION, ComboBox, _action);\n}\n\nvoid Hotkeys::LoadSettings() {\n    Settings *settings = Settings::Instance();\n\n    \/* Make highlighted items span the entire row in the list view *\/\n    _keyList.AddListExStyle(LVS_EX_FULLROWSELECT);\n\n    RECT dims = _keyList.Dimensions();\n    int width = dims.right - dims.left;\n\n    _keyList.AddColumn(hotkeysColumnStr, (int) (width * .485));\n    _keyList.AddColumn(actionColumnStr, (int) (width * .445));\n\n    for (std::wstring action : HotkeyInfo::ActionNames) {\n        _action.AddItem(action);\n    }\n\n    std::unordered_map<int, HotkeyInfo> hotkeys = settings->Hotkeys();\n    for (auto it = hotkeys.begin(); it != hotkeys.end(); ++it) {\n        _keyInfo.push_back(it->second);\n    }\n\n    for (unsigned int i = 0; i < _keyInfo.size(); ++i) {\n        HotkeyInfo hki = _keyInfo[i];\n        std::wstring hkStr = HotkeyManager::HotkeysToString(hki.keyCombination);\n        int idx = _keyList.AddItem(hkStr);\n        _keyList.ItemText(idx, 1, HotkeyInfo::ActionNames[hki.action]);\n    }\n\n    _keyList.Selection(0);\n}\n\nvoid Hotkeys::SaveSettings() {\n    if (_hWnd == NULL) {\n        return;\n    }\n\n    CLOG(L\"Saving: Hotkeys\");\n    Settings *settings = Settings::Instance();\n}\n\nvoid Hotkeys::OnKeyListItemChanged(NMLISTVIEW *lv) {\n    if (lv->uChanged & LVIF_STATE) {\n        if (lv->uNewState & LVIS_SELECTED) {\n            OnKeyListSelectionChanged(lv->iItem);\n        }\n    }\n}\n\nvoid Hotkeys::OnKeyListSelectionChanged(int index) {\n    HotkeyInfo current = _keyInfo[index];\n    CLOG(L\"Selecting key combination %d:\", index);\n    QCLOG(L\"%s\", current.ToString().c_str());\n}<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\r\n#include <sstream>\nusing namespace std;\r\n\r\nstring itos(int n)\r\n{\r\n    stringstream ss;\r\n    ss << n;\r\n    string s;\r\n    ss >> s;\r\n    ss.clear();\r\n    ss.str(\"\");\r\n    return s;\r\n}\r\n\nint main()\n{\n    int n,m;\r\n    cin>>n>>m;\r\n    m %= n;\r\n    m = n - m;\r\n    string s = \"\";string fs = \"\";\r\n    bool flag1 = false;bool flag2 = false;\r\n    for(int i = 1;i <= n;i++)\r\n    {\r\n        int tempn;\r\n        cin>>tempn;\r\n        if(m == n)\r\n        {\r\n            if(!flag1)\r\n            {\r\n                s = itos(tempn);\r\n                flag1 = true;\r\n            }\r\n            else\r\n            {\r\n                string temps = itos(tempn);\r\n                temps = \" \"+temps;\r\n                s += temps;\r\n            }\r\n        }\r\n        else if(n == 1) {s = itos(tempn);}\r\n        else\r\n        {\r\n            if(i == m)\r\n            {\r\n                string temps = itos(tempn);\r\n                temps = \" \" + temps;\r\n                fs += temps;\r\n                flag2 = true;\r\n            }\r\n            else\r\n            {\r\n                if(!flag1 && flag2)\r\n                {\r\n                    s = itos(tempn);\r\n                    flag1 = true;\r\n                }\r\n                else\r\n                {\r\n                    if(flag2)\r\n                    {\r\n                        string temps = itos(tempn);\r\n                        temps = \" \" + temps;\r\n                        s += temps;\r\n                    }\r\n                    else\r\n                    {\r\n                        string temps = itos(tempn);\r\n                        temps = \" \" + temps;\r\n                        fs += temps;\r\n                    }\r\n                }\r\n            }\r\n        }\r\n    }\r\n    s += fs;\r\n    cout<<s<<endl;\n}\r\n<commit_msg>当时的代码写得好笨拙......<commit_after>#include <iostream>\r\n#include <deque>\r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n    int n,m;\r\n    cin>>n>>m;\r\n    m %= n;\r\n    deque<int> p;\r\n    for(int i = 0;i < n;i++)\r\n    {\r\n        int temp;\r\n        cin>>temp;\r\n        p.push_back(temp);\r\n    }\r\n    for(int i = 0;i < m;i++)\r\n    {\r\n        int temp = p.back();\r\n        p.pop_back();\r\n        p.push_front(temp);\r\n    }\r\n    bool flag = true;\r\n    for(int & i : p)\r\n    {\r\n        if(flag) {cout<<i;flag = false;}\r\n        else cout<<\" \"<<i;\r\n    }\r\n    cout<<endl;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright (c) 2018 PaddlePaddle Authors. All Rights Reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\nhttp:\/\/www.apache.org\/licenses\/LICENSE-2.0\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License. *\/\n#include \"paddle\/fluid\/operators\/math\/jit_kernel.h\"\n#include <math.h>\n#include <limits>\n#include <string>\n#include \"paddle\/fluid\/operators\/math\/jit_kernel_macro.h\"\n#ifdef __AVX__\n#include <immintrin.h>\n#endif\n\nnamespace paddle {\nnamespace operators {\nnamespace math {\nnamespace jitkernel {\n\n\/* Layer Norm JitKernel *\/\ntemplate <typename T, platform::cpu_isa_t isa, jit_block>\nclass LayerNormKernelImpl : public LayerNormKernel<T> {\n public:\n  explicit LayerNormKernelImpl(int right) : LayerNormKernel<T>() {\n    this->num_ = right;\n  }\n\n  void Compute(T* x, T* out, T* mean, T* var, const T* scale, const T* bias,\n               int height, const float epsilon) const override {\n    \/\/ get mean\n    for (int i = 0; i < height; i++) {\n      T sum = 0.0;\n      int offset = i * this->num_;\n      for (int j = 0; j < this->num_; j++) {\n        sum += x[offset + j];\n      }\n      mean[i] = sum \/ this->num_;\n    }\n\n    \/\/ get variance\n    for (int i = 0; i < height; i++) {\n      T sum = 0.0;\n      int offset = i * this->num_;\n      for (int j = 0; j < this->num_; j++) {\n        sum += (x[offset + j] - mean[i]) * (x[offset + j] - mean[i]);\n      }\n      var[i] = sum \/ this->num_;\n    }\n\n    for (int i = 0; i < height; i++) {\n      int offset = i * this->num_;\n      T sqrt_var = sqrt(var[i] + (T)epsilon);\n      for (int j = 0; j < this->num_; j++) {\n        out[offset + j] = (x[offset + j] - mean[i]) \/ sqrt_var;\n      }\n    }\n    if (scale) {\n      for (int i = 0; i < height; i++) {\n        int offset = i * this->num_;\n        for (int j = 0; j < this->num_; j++) {\n          out[offset + j] *= scale[j];\n        }\n      }\n    }\n\n    if (bias) {\n      for (int i = 0; i < height; i++) {\n        int offset = i * this->num_;\n        for (int j = 0; j < this->num_; j++) {\n          out[offset + j] += bias[j];\n        }\n      }\n    }\n  }\n};\n\n#define INTRIAVX_FLOAT(isa, block)                                             \\\n  template <>                                                                  \\\n  LayerNormKernelImpl<float, isa, block>::LayerNormKernelImpl(int right)       \\\n      : LayerNormKernel<float>() {                                             \\\n    this->num_ = right;                                                        \\\n    this->rest_ = this->num_ % YMM_FLOAT_BLOCK;                                \\\n    this->end_ = this->num_ - this->rest_;                                     \\\n  }                                                                            \\\n  template <>                                                                  \\\n  void LayerNormKernelImpl<float, platform::avx, block>::Compute(              \\\n      float* x, float* out, float* mean, float* var, const float* scale,       \\\n      const float* bias, int height, const float epsilon) const {              \\\n    __m256 sum;                                                                \\\n    __m256 mean_vec, var_vec;                                                  \\\n    __m128 hi, lo;                                                             \\\n    __m256 tmp;                                                                \\\n    size_t offset;                                                             \\\n    size_t j;                                                                  \\\n    __m256 reverse_num_vec =                                                   \\\n        _mm256_div_ps(_mm256_set1_ps(1.0), _mm256_set1_ps(this->num_));        \\\n    __m256 epsilon_vec = _mm256_set1_ps(epsilon);                              \\\n    int rest_mask =                                                            \\\n        ((-1) & (~((~0U) >> (sizeof(int) * 8 - (YMM_FLOAT_BLOCK - rest_))))) & \\\n        0x0ff;                                                                 \\\n    __m256i mask_vec = _mm256_set_epi32(                                       \\\n        rest_mask & 0x80 ? 0xffffffff : 0, rest_mask & 0x40 ? 0xffffffff : 0,  \\\n        rest_mask & 0x20 ? 0xffffffff : 0, rest_mask & 0x10 ? 0xffffffff : 0,  \\\n        rest_mask & 0x8 ? 0xffffffff : 0, rest_mask & 0x4 ? 0xffffffff : 0,    \\\n        rest_mask & 0x2 ? 0xffffffff : 0, rest_mask & 0x1 ? 0xffffffff : 0);   \\\n                                                                               \\\n    for (int i = 0; i < height; ++i) {                                         \\\n      offset = i * this->num_;                                                 \\\n                                                                               \\\n      \/* get mean *\/                                                           \\\n      sum = _mm256_setzero_ps();                                               \\\n      for (j = offset; j < end_ + offset; j += block) {                        \\\n        sum = _mm256_add_ps(sum, _mm256_loadu_ps((const float*)x + j));        \\\n      }                                                                        \\\n      if (rest_ != 0) {                                                        \\\n        j = offset + this->num_ - block;                                       \\\n        tmp = _mm256_loadu_ps((const float*)x + j);                            \\\n        tmp = _mm256_blendv_ps(_mm256_setzero_ps(), tmp, (__m256)mask_vec);    \\\n        sum = _mm256_add_ps(sum, tmp);                                         \\\n      }                                                                        \\\n      hi = _mm256_extractf128_ps(sum, 1);                                      \\\n      lo = _mm256_extractf128_ps(sum, 0);                                      \\\n      sum = _mm256_add_ps(                                                     \\\n          sum, _mm256_insertf128_ps(                                           \\\n                   _mm256_insertf128_ps(_mm256_setzero_ps(), hi, 0), lo, 1));  \\\n      sum = _mm256_hadd_ps(sum, sum);                                          \\\n      sum = _mm256_hadd_ps(sum, sum);                                          \\\n      mean_vec = _mm256_mul_ps(sum, reverse_num_vec);                          \\\n      mean[i] = *reinterpret_cast<float*>(&mean_vec);                          \\\n                                                                               \\\n      \/* get variance *\/                                                       \\\n      sum = _mm256_setzero_ps();                                               \\\n      for (j = offset; j < end_ + offset; j += block) {                        \\\n        tmp = _mm256_sub_ps(_mm256_loadu_ps((const float*)x + j), mean_vec);   \\\n        tmp = _mm256_mul_ps(tmp, tmp);                                         \\\n        sum = _mm256_add_ps(sum, tmp);                                         \\\n      }                                                                        \\\n      if (rest_ != 0) {                                                        \\\n        j = offset + this->num_ - block;                                       \\\n        tmp = _mm256_sub_ps(_mm256_loadu_ps((const float*)x + j), mean_vec);   \\\n        tmp = _mm256_mul_ps(tmp, tmp);                                         \\\n        tmp = _mm256_blendv_ps(_mm256_setzero_ps(), tmp, (__m256)mask_vec);    \\\n        sum = _mm256_add_ps(sum, tmp);                                         \\\n      }                                                                        \\\n      hi = _mm256_extractf128_ps(sum, 1);                                      \\\n      lo = _mm256_extractf128_ps(sum, 0);                                      \\\n      sum = _mm256_add_ps(                                                     \\\n          sum, _mm256_insertf128_ps(                                           \\\n                   _mm256_insertf128_ps(_mm256_setzero_ps(), hi, 0), lo, 1));  \\\n      sum = _mm256_hadd_ps(sum, sum);                                          \\\n      sum = _mm256_hadd_ps(sum, sum);                                          \\\n      var_vec = _mm256_mul_ps(sum, reverse_num_vec);                           \\\n      var[i] = *reinterpret_cast<float*>(&var_vec);                            \\\n                                                                               \\\n      \/* get x_norm and calculate output*\/                                     \\\n      for (j = offset; j < end_ + offset; j += block) {                        \\\n        tmp = _mm256_sub_ps(_mm256_loadu_ps((const float*)x + j), mean_vec);   \\\n        tmp = _mm256_div_ps(                                                   \\\n            tmp, _mm256_sqrt_ps(_mm256_add_ps(var_vec, epsilon_vec)));         \\\n        _mm256_storeu_ps(reinterpret_cast<float*>(out) + j, tmp);              \\\n      }                                                                        \\\n      if (rest_ != 0) {                                                        \\\n        j = offset + num_ - block;                                             \\\n        tmp = _mm256_sub_ps(_mm256_loadu_ps((const float*)x + j), mean_vec);   \\\n        tmp = _mm256_div_ps(                                                   \\\n            tmp, _mm256_sqrt_ps(_mm256_add_ps(var_vec, epsilon_vec)));         \\\n        _mm256_storeu_ps(reinterpret_cast<float*>(out) + j, tmp);              \\\n      }                                                                        \\\n                                                                               \\\n      if (scale) {                                                             \\\n        if (rest_ != 0) {                                                      \\\n          j = offset + this->num_ - block;                                     \\\n          tmp = _mm256_loadu_ps((const float*)out + j);                        \\\n        }                                                                      \\\n        for (j = offset; j < end_ + offset; j += block) {                      \\\n          _mm256_storeu_ps(                                                    \\\n              reinterpret_cast<float*>(out) + j,                               \\\n              _mm256_mul_ps(                                                   \\\n                  _mm256_loadu_ps((const float*)out + j),                      \\\n                  _mm256_loadu_ps((const float*)scale + j - offset)));         \\\n        }                                                                      \\\n        if (rest_ != 0) {                                                      \\\n          j = offset + this->num_ - block;                                     \\\n          _mm256_storeu_ps(                                                    \\\n              reinterpret_cast<float*>(out) + j,                               \\\n              _mm256_mul_ps(                                                   \\\n                  tmp, _mm256_loadu_ps((const float*)scale + j - offset)));    \\\n        }                                                                      \\\n      }                                                                        \\\n                                                                               \\\n      if (bias) {                                                              \\\n        if (rest_ != 0) {                                                      \\\n          j = offset + this->num_ - block;                                     \\\n          tmp = _mm256_loadu_ps((const float*)out + j);                        \\\n        }                                                                      \\\n        for (j = offset; j < end_ + offset; j += block) {                      \\\n          _mm256_storeu_ps(                                                    \\\n              reinterpret_cast<float*>(out) + j,                               \\\n              _mm256_add_ps(                                                   \\\n                  _mm256_loadu_ps((const float*)out + j),                      \\\n                  _mm256_loadu_ps((const float*)bias + j - offset)));          \\\n        }                                                                      \\\n        if (rest_ != 0) {                                                      \\\n          j = offset + this->num_ - block;                                     \\\n          _mm256_storeu_ps(                                                    \\\n              reinterpret_cast<float*>(out) + j,                               \\\n              _mm256_add_ps(                                                   \\\n                  tmp, _mm256_loadu_ps((const float*)bias + j - offset)));     \\\n        }                                                                      \\\n      }                                                                        \\\n    }                                                                          \\\n  }\n\n#ifdef __AVX__\nINTRIAVX_FLOAT(platform::avx, kEQ8);\nINTRIAVX_FLOAT(platform::avx, kGT8LT16);\nINTRIAVX_FLOAT(platform::avx, kEQ16);\nINTRIAVX_FLOAT(platform::avx, kGT16);\n#endif\n#ifdef __AVX2__\nINTRIAVX_FLOAT(platform::avx2, kEQ8);\nINTRIAVX_FLOAT(platform::avx2, kGT8LT16);\nINTRIAVX_FLOAT(platform::avx2, kEQ16);\nINTRIAVX_FLOAT(platform::avx2, kGT16);\n#endif\n\n#undef INTRIAVX_FLOAT\n\nREGISTER_JITKERNEL_DEPRECATED(layer_norm, LayerNormKernel);\n\n}  \/\/ namespace jitkernel\n}  \/\/ namespace math\n}  \/\/ namespace operators\n}  \/\/ namespace paddle\n<commit_msg>Fix the issue to run on AVX2 and AVX512F machines (#14851)<commit_after>\/* Copyright (c) 2018 PaddlePaddle Authors. All Rights Reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\nhttp:\/\/www.apache.org\/licenses\/LICENSE-2.0\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License. *\/\n#include \"paddle\/fluid\/operators\/math\/jit_kernel.h\"\n#include <math.h>\n#include <limits>\n#include <string>\n#include \"paddle\/fluid\/operators\/math\/jit_kernel_macro.h\"\n#ifdef __AVX__\n#include <immintrin.h>\n#endif\n\nnamespace paddle {\nnamespace operators {\nnamespace math {\nnamespace jitkernel {\n\n\/* Layer Norm JitKernel *\/\ntemplate <typename T, platform::cpu_isa_t isa, jit_block>\nclass LayerNormKernelImpl : public LayerNormKernel<T> {\n public:\n  explicit LayerNormKernelImpl(int right) : LayerNormKernel<T>() {\n    this->num_ = right;\n  }\n\n  void Compute(T* x, T* out, T* mean, T* var, const T* scale, const T* bias,\n               int height, const float epsilon) const override {\n    \/\/ get mean\n    for (int i = 0; i < height; i++) {\n      T sum = 0.0;\n      int offset = i * this->num_;\n      for (int j = 0; j < this->num_; j++) {\n        sum += x[offset + j];\n      }\n      mean[i] = sum \/ this->num_;\n    }\n\n    \/\/ get variance\n    for (int i = 0; i < height; i++) {\n      T sum = 0.0;\n      int offset = i * this->num_;\n      for (int j = 0; j < this->num_; j++) {\n        sum += (x[offset + j] - mean[i]) * (x[offset + j] - mean[i]);\n      }\n      var[i] = sum \/ this->num_;\n    }\n\n    for (int i = 0; i < height; i++) {\n      int offset = i * this->num_;\n      T sqrt_var = sqrt(var[i] + (T)epsilon);\n      for (int j = 0; j < this->num_; j++) {\n        out[offset + j] = (x[offset + j] - mean[i]) \/ sqrt_var;\n      }\n    }\n    if (scale) {\n      for (int i = 0; i < height; i++) {\n        int offset = i * this->num_;\n        for (int j = 0; j < this->num_; j++) {\n          out[offset + j] *= scale[j];\n        }\n      }\n    }\n\n    if (bias) {\n      for (int i = 0; i < height; i++) {\n        int offset = i * this->num_;\n        for (int j = 0; j < this->num_; j++) {\n          out[offset + j] += bias[j];\n        }\n      }\n    }\n  }\n};\n\n#define INTRIAVX_FLOAT(isa, jit_block)                                         \\\n  template <>                                                                  \\\n  LayerNormKernelImpl<float, isa, jit_block>::LayerNormKernelImpl(int right)   \\\n      : LayerNormKernel<float>() {                                             \\\n    this->num_ = right;                                                        \\\n    this->rest_ = this->num_ % YMM_FLOAT_BLOCK;                                \\\n    this->end_ = this->num_ - this->rest_;                                     \\\n  }                                                                            \\\n  template <>                                                                  \\\n  void LayerNormKernelImpl<float, isa, jit_block>::Compute(                    \\\n      float* x, float* out, float* mean, float* var, const float* scale,       \\\n      const float* bias, int height, const float epsilon) const {              \\\n    __m256 sum;                                                                \\\n    __m256 mean_vec, var_vec;                                                  \\\n    __m128 hi, lo;                                                             \\\n    __m256 tmp;                                                                \\\n    size_t offset;                                                             \\\n    size_t j;                                                                  \\\n    size_t block = YMM_FLOAT_BLOCK;                                            \\\n    __m256 reverse_num_vec =                                                   \\\n        _mm256_div_ps(_mm256_set1_ps(1.0), _mm256_set1_ps(this->num_));        \\\n    __m256 epsilon_vec = _mm256_set1_ps(epsilon);                              \\\n    int rest_mask =                                                            \\\n        ((-1) & (~((~0U) >> (sizeof(int) * 8 - (YMM_FLOAT_BLOCK - rest_))))) & \\\n        0x0ff;                                                                 \\\n    __m256i mask_vec = _mm256_set_epi32(                                       \\\n        rest_mask & 0x80 ? 0xffffffff : 0, rest_mask & 0x40 ? 0xffffffff : 0,  \\\n        rest_mask & 0x20 ? 0xffffffff : 0, rest_mask & 0x10 ? 0xffffffff : 0,  \\\n        rest_mask & 0x8 ? 0xffffffff : 0, rest_mask & 0x4 ? 0xffffffff : 0,    \\\n        rest_mask & 0x2 ? 0xffffffff : 0, rest_mask & 0x1 ? 0xffffffff : 0);   \\\n                                                                               \\\n    for (int i = 0; i < height; ++i) {                                         \\\n      offset = i * this->num_;                                                 \\\n                                                                               \\\n      \/* get mean *\/                                                           \\\n      sum = _mm256_setzero_ps();                                               \\\n      for (j = offset; j < end_ + offset; j += block) {                        \\\n        sum = _mm256_add_ps(sum, _mm256_loadu_ps((const float*)x + j));        \\\n      }                                                                        \\\n      if (rest_ != 0) {                                                        \\\n        j = offset + this->num_ - block;                                       \\\n        tmp = _mm256_loadu_ps((const float*)x + j);                            \\\n        tmp = _mm256_blendv_ps(_mm256_setzero_ps(), tmp, (__m256)mask_vec);    \\\n        sum = _mm256_add_ps(sum, tmp);                                         \\\n      }                                                                        \\\n      hi = _mm256_extractf128_ps(sum, 1);                                      \\\n      lo = _mm256_extractf128_ps(sum, 0);                                      \\\n      sum = _mm256_add_ps(                                                     \\\n          sum, _mm256_insertf128_ps(                                           \\\n                   _mm256_insertf128_ps(_mm256_setzero_ps(), hi, 0), lo, 1));  \\\n      sum = _mm256_hadd_ps(sum, sum);                                          \\\n      sum = _mm256_hadd_ps(sum, sum);                                          \\\n      mean_vec = _mm256_mul_ps(sum, reverse_num_vec);                          \\\n      mean[i] = *reinterpret_cast<float*>(&mean_vec);                          \\\n                                                                               \\\n      \/* get variance *\/                                                       \\\n      sum = _mm256_setzero_ps();                                               \\\n      for (j = offset; j < end_ + offset; j += block) {                        \\\n        tmp = _mm256_sub_ps(_mm256_loadu_ps((const float*)x + j), mean_vec);   \\\n        tmp = _mm256_mul_ps(tmp, tmp);                                         \\\n        sum = _mm256_add_ps(sum, tmp);                                         \\\n      }                                                                        \\\n      if (rest_ != 0) {                                                        \\\n        j = offset + this->num_ - block;                                       \\\n        tmp = _mm256_sub_ps(_mm256_loadu_ps((const float*)x + j), mean_vec);   \\\n        tmp = _mm256_mul_ps(tmp, tmp);                                         \\\n        tmp = _mm256_blendv_ps(_mm256_setzero_ps(), tmp, (__m256)mask_vec);    \\\n        sum = _mm256_add_ps(sum, tmp);                                         \\\n      }                                                                        \\\n      hi = _mm256_extractf128_ps(sum, 1);                                      \\\n      lo = _mm256_extractf128_ps(sum, 0);                                      \\\n      sum = _mm256_add_ps(                                                     \\\n          sum, _mm256_insertf128_ps(                                           \\\n                   _mm256_insertf128_ps(_mm256_setzero_ps(), hi, 0), lo, 1));  \\\n      sum = _mm256_hadd_ps(sum, sum);                                          \\\n      sum = _mm256_hadd_ps(sum, sum);                                          \\\n      var_vec = _mm256_mul_ps(sum, reverse_num_vec);                           \\\n      var[i] = *reinterpret_cast<float*>(&var_vec);                            \\\n                                                                               \\\n      \/* get x_norm and calculate output*\/                                     \\\n      for (j = offset; j < end_ + offset; j += block) {                        \\\n        tmp = _mm256_sub_ps(_mm256_loadu_ps((const float*)x + j), mean_vec);   \\\n        tmp = _mm256_div_ps(                                                   \\\n            tmp, _mm256_sqrt_ps(_mm256_add_ps(var_vec, epsilon_vec)));         \\\n        _mm256_storeu_ps(reinterpret_cast<float*>(out) + j, tmp);              \\\n      }                                                                        \\\n      if (rest_ != 0) {                                                        \\\n        j = offset + num_ - block;                                             \\\n        tmp = _mm256_sub_ps(_mm256_loadu_ps((const float*)x + j), mean_vec);   \\\n        tmp = _mm256_div_ps(                                                   \\\n            tmp, _mm256_sqrt_ps(_mm256_add_ps(var_vec, epsilon_vec)));         \\\n        _mm256_storeu_ps(reinterpret_cast<float*>(out) + j, tmp);              \\\n      }                                                                        \\\n                                                                               \\\n      if (scale) {                                                             \\\n        if (rest_ != 0) {                                                      \\\n          j = offset + this->num_ - block;                                     \\\n          tmp = _mm256_loadu_ps((const float*)out + j);                        \\\n        }                                                                      \\\n        for (j = offset; j < end_ + offset; j += block) {                      \\\n          _mm256_storeu_ps(                                                    \\\n              reinterpret_cast<float*>(out) + j,                               \\\n              _mm256_mul_ps(                                                   \\\n                  _mm256_loadu_ps((const float*)out + j),                      \\\n                  _mm256_loadu_ps((const float*)scale + j - offset)));         \\\n        }                                                                      \\\n        if (rest_ != 0) {                                                      \\\n          j = offset + this->num_ - block;                                     \\\n          _mm256_storeu_ps(                                                    \\\n              reinterpret_cast<float*>(out) + j,                               \\\n              _mm256_mul_ps(                                                   \\\n                  tmp, _mm256_loadu_ps((const float*)scale + j - offset)));    \\\n        }                                                                      \\\n      }                                                                        \\\n                                                                               \\\n      if (bias) {                                                              \\\n        if (rest_ != 0) {                                                      \\\n          j = offset + this->num_ - block;                                     \\\n          tmp = _mm256_loadu_ps((const float*)out + j);                        \\\n        }                                                                      \\\n        for (j = offset; j < end_ + offset; j += block) {                      \\\n          _mm256_storeu_ps(                                                    \\\n              reinterpret_cast<float*>(out) + j,                               \\\n              _mm256_add_ps(                                                   \\\n                  _mm256_loadu_ps((const float*)out + j),                      \\\n                  _mm256_loadu_ps((const float*)bias + j - offset)));          \\\n        }                                                                      \\\n        if (rest_ != 0) {                                                      \\\n          j = offset + this->num_ - block;                                     \\\n          _mm256_storeu_ps(                                                    \\\n              reinterpret_cast<float*>(out) + j,                               \\\n              _mm256_add_ps(                                                   \\\n                  tmp, _mm256_loadu_ps((const float*)bias + j - offset)));     \\\n        }                                                                      \\\n      }                                                                        \\\n    }                                                                          \\\n  }\n\n#ifdef __AVX__\nINTRIAVX_FLOAT(platform::avx, kEQ8);\nINTRIAVX_FLOAT(platform::avx, kGT8LT16);\nINTRIAVX_FLOAT(platform::avx, kEQ16);\nINTRIAVX_FLOAT(platform::avx, kGT16);\nINTRIAVX_FLOAT(platform::avx2, kEQ8);\nINTRIAVX_FLOAT(platform::avx2, kGT8LT16);\nINTRIAVX_FLOAT(platform::avx2, kEQ16);\nINTRIAVX_FLOAT(platform::avx2, kGT16);\nINTRIAVX_FLOAT(platform::avx512f, kEQ8);\nINTRIAVX_FLOAT(platform::avx512f, kGT8LT16);\nINTRIAVX_FLOAT(platform::avx512f, kEQ16);\nINTRIAVX_FLOAT(platform::avx512f, kGT16);\n#endif\n\n#undef INTRIAVX_FLOAT\n\nREGISTER_JITKERNEL_DEPRECATED(layer_norm, LayerNormKernel);\n\n}  \/\/ namespace jitkernel\n}  \/\/ namespace math\n}  \/\/ namespace operators\n}  \/\/ namespace paddle\n<|endoftext|>"}
{"text":"<commit_before>#include \"npc.h\"\n#include \"room.h\"\n#include <iostream>\n\nNpc::Npc(const char* npcName, const char* npcDescription, Room* loc) : Creature(npcName, npcDescription, loc)\n{\n\tname = npcName;\n\tdescription = npcDescription;\n\tentityType = npc;\n\tlocation = loc;\n}\n\nNpc::~Npc()\n{\n}\n\nvoid Npc::checkShip(const Room* playerLocation)\n{\n\tif ((playerLocation->name == \"Poopdeck\" || playerLocation->name == \"Main deck\") && !aware)\n\t{\n\t\taware = true;\n\t\tstd::cout << std::endl;\n\t\tstd::cout << \"---------------------------------------------\" << std::endl;\n\t\tstd::cout << \"Slinger, The Lookout: HEY YOU! What are you doing there? Climb to the crow's nest NOW!!\" << std::endl;\n\t\tstd::cout << \"---------------------------------------------\" << std::endl;\n\t\tstd::cout << \">\";\n\t}\n}\n\nvoid Npc::getMad(const Room* playerLocation)\n{\n\tstd::cout << std::endl;\n\tstd::cout << \"---------------------------------------------\" << std::endl;\n\tif(playerLocation != location)\n\t{\t\t\t\n\t\tswitch (npcMood)\n\t\t{\n\t\t\tcase CALM:\n\t\t\t\tstd::cout << \"Slinger, The Lookout: I told you to climb here right now. I don't like to repeat things, dog. MOVE!!\" << std::endl;\n\t\t\t\tnpcMood = MAD;\n\t\t\t\tbreak;\n\t\t\tcase MAD:\n\t\t\t\tstd::cout << \"Slinger, The Lookout: Do you thing that beeing in this ship for a month gives you permision to question my orders? Don't get me mad, son...\" << std::endl;\n\t\t\t\tnpcMood = VIOLENT;\n\t\t\t\tbreak;\n\t\t\tcase VIOLENT:\n\t\t\t\tstd::cout << \"Slinger, The Lookout: Your choice. This is your last oportunity. (You hear the sound of a musket beeing loaded)\" << std::endl;\n\t\t\t\tnpcMood = KILL;\n\t\t\t\tbreak;\n\t\t\tcase KILL:\n\t\t\t\tstd::cout << \"BANG!!\" << std::endl;\n\t\t\t\tbreak;\n\t\t}\t\t\n\t}\n\telse\n\t{\n\t\tstd::cout << \"Slinger, The Lookout: Bla bla bla... (Boring complains about beeing out of bed... Seems like you only have one way to go)\" << std::endl;\n\t}\n\tstd::cout << \"---------------------------------------------\" << std::endl;\n\tstd::cout << \">\";\n}<commit_msg>Initializing of aware and alive values added<commit_after>#include \"npc.h\"\n#include \"room.h\"\n#include <iostream>\n\nNpc::Npc(const char* npcName, const char* npcDescription, Room* loc) : Creature(npcName, npcDescription, loc)\n{\n\tname = npcName;\n\tdescription = npcDescription;\n\tentityType = npc;\n\tlocation = loc;\n\talive = true;\n\taware = false;\n}\n\nNpc::~Npc()\n{\n}\n\nvoid Npc::checkShip(const Room* playerLocation)\n{\n\tif ((playerLocation->name == \"Poopdeck\" || playerLocation->name == \"Main deck\") && !aware)\n\t{\n\t\taware = true;\n\t\tstd::cout << std::endl;\n\t\tstd::cout << \"---------------------------------------------\" << std::endl;\n\t\tstd::cout << \"Slinger, The Lookout: HEY YOU! What are you doing there? Climb to the crow's nest NOW!!\" << std::endl;\n\t\tstd::cout << \"---------------------------------------------\" << std::endl;\n\t\tstd::cout << \">\";\n\t}\n}\n\nvoid Npc::getMad(const Room* playerLocation)\n{\n\tstd::cout << std::endl;\n\tstd::cout << \"---------------------------------------------\" << std::endl;\n\tif(playerLocation != location)\n\t{\t\t\t\n\t\tswitch (npcMood)\n\t\t{\n\t\t\tcase CALM:\n\t\t\t\tstd::cout << \"Slinger, The Lookout: I told you to climb here right now. I don't like to repeat things, dog. MOVE!!\" << std::endl;\n\t\t\t\tnpcMood = MAD;\n\t\t\t\tbreak;\n\t\t\tcase MAD:\n\t\t\t\tstd::cout << \"Slinger, The Lookout: Do you thing that beeing in this ship for a month gives you permision to question my orders? Don't get me mad, son...\" << std::endl;\n\t\t\t\tnpcMood = VIOLENT;\n\t\t\t\tbreak;\n\t\t\tcase VIOLENT:\n\t\t\t\tstd::cout << \"Slinger, The Lookout: Your choice. This is your last oportunity. (You hear the sound of a musket beeing loaded)\" << std::endl;\n\t\t\t\tnpcMood = KILL;\n\t\t\t\tbreak;\n\t\t\tcase KILL:\n\t\t\t\tstd::cout << \"BANG!!\" << std::endl;\n\t\t\t\tbreak;\n\t\t}\t\t\n\t}\n\telse\n\t{\n\t\tstd::cout << \"Slinger, The Lookout: Bla bla bla... (Boring complains about beeing out of bed... Seems like you only have one way to go)\" << std::endl;\n\t}\n\tstd::cout << \"---------------------------------------------\" << std::endl;\n\tstd::cout << \">\";\n}<|endoftext|>"}
{"text":"<commit_before>\/\/ ======================================================================== \/\/\n\/\/ Copyright 2009-2016 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 \"cy_hair_loader.h\"\n\n#include <stdio.h>\n#include <math.h>\n\nnamespace embree\n{\n  \/\/ -------------------------------------------\n  \/\/ -- Based on the format by Cem Yuksel     --\n  \/\/ -- www.cemyuksel.com\/research\/hairmodels --\n  \/\/ -------------------------------------------\n  \n#define CY_HAIR_FILE_SEGMENTS_BIT\t1\n#define CY_HAIR_FILE_POINTS_BIT\t\t2\n#define CY_HAIR_FILE_THICKNESS_BIT\t4\n#define CY_HAIR_FILE_TRANSPARENCY_BIT\t8\n#define CY_HAIR_FILE_COLORS_BIT\t\t16\n#define CY_HAIR_FILE_INFO_SIZE\t\t88\n  \n  struct cyHeader\n  {\n    char\t\tsignature[4];\t\/\/\/< This should be \"HAIR\"\n    unsigned int\tnumStrands;\t\/\/\/< number of hair strands\n    unsigned int\tnumPoints;\t\/\/\/< total number of points of all strands\n    unsigned int\tbitarrays;\t\t\/\/\/< bit array of data in the file\n    unsigned int\tdefaultSegments;      \/\/\/< default number of segments of each strand\n    float\t\tdefaultThickness;\t        \/\/\/< default thickness of hair strands\n    float\t\tdefaultTransparency;\t        \/\/\/< default transparency of hair strands\n    float\t\tdefaultColor[3];\t\t\/\/\/< default color of hair strands\n    char\t\tinfo[CY_HAIR_FILE_INFO_SIZE];\t\/\/\/< information about the file\n  };\n  \n  class cyHairFile\n  {\n  public:\n    cyHairFile() : segments(nullptr), points(nullptr), thickness(nullptr), transparency(nullptr), colors(nullptr) {init(); }\n    ~cyHairFile() {\n      if ( segments ) delete [] segments;\n      if ( points ) delete [] points;\n      if ( colors ) delete [] colors;\n      if ( thickness ) delete [] thickness;\n      if ( transparency ) delete [] transparency;      \n    }\n    \n    \n    void init()\n    {\n      header.signature[0] = 'H';\n      header.signature[1] = 'A';\n      header.signature[2] = 'I';\n      header.signature[3] = 'R';\n      header.numStrands = 0;\n      header.numPoints = 0;\n      header.bitarrays = 0;\t\n      header.defaultSegments = 0;\n      header.defaultThickness = 1.0f;\n      header.defaultTransparency = 0.0f;\n      header.defaultColor[0] = 1.0f;\n      header.defaultColor[1] = 1.0f;\n      header.defaultColor[2] = 1.0f;\n      memset( header.info, '\\0', CY_HAIR_FILE_INFO_SIZE );\n    }\n    \n    int load( const char *filename )\n    {\n      init();\n      \n      FILE *file;\n      file = fopen( filename, \"rb\" );\n      if ( file == nullptr )\n        THROW_RUNTIME_ERROR(\"can't open file\");\n      \n      size_t h = fread( &header, sizeof(cyHeader), 1, file );\n      \n      if ( h < 1 ) \n        THROW_RUNTIME_ERROR(\"can't read header\");\n      \n      if ( strncmp( header.signature, \"HAIR\", 4) != 0 ) \n        THROW_RUNTIME_ERROR(\"wrong signature\");\n      \n      if ( header.bitarrays & CY_HAIR_FILE_SEGMENTS_BIT ) {\n        segments = new unsigned short[ header.numStrands ];\n        size_t r = fread( segments, sizeof(unsigned short), header.numStrands, file );\n        if ( r < header.numStrands ) \n          THROW_RUNTIME_ERROR(\"error reading segments\");\n      }\n      \n      if ( header.bitarrays & CY_HAIR_FILE_POINTS_BIT ) {\n        points = new float[ header.numPoints*3 ];\n        size_t r = fread( points, sizeof(float), header.numPoints*3, file );\n        if ( r < header.numPoints*3 ) \n          THROW_RUNTIME_ERROR(\"error reading points\");\n      }\n      \n      if ( header.bitarrays & CY_HAIR_FILE_THICKNESS_BIT ) {\n        thickness = new float[ header.numPoints ];\n        size_t r = fread( thickness, sizeof(float), header.numPoints, file );\n        if ( r < header.numPoints ) \n          THROW_RUNTIME_ERROR(\"error reading thickness values\");\n      }\n      \n      if ( header.bitarrays & CY_HAIR_FILE_TRANSPARENCY_BIT ) {\n        transparency = new float[ header.numPoints ];\n        size_t r = fread( transparency, sizeof(float), header.numPoints, file );\n        if ( r < header.numPoints ) \n          THROW_RUNTIME_ERROR(\"error reading transparency values\");          \n      }\n      \n      if ( header.bitarrays & CY_HAIR_FILE_COLORS_BIT ) {\n        colors = new float[ header.numPoints*3 ];\n        size_t r = fread( colors, sizeof(float), header.numPoints*3, file );\n        if ( r < header.numPoints*3 ) \n          THROW_RUNTIME_ERROR(\"error reading color values\");          \n      }\n      \n      fclose( file );\n      \n      return header.numStrands;\n    }\n    \n    \n    cyHeader header;\n    unsigned short\t*segments;\n    float\t\t*points;\n    float\t\t*thickness;\n    float\t\t*transparency;\n    float\t\t*colors;    \n  };\n  \n  Ref<SceneGraph::Node> SceneGraph::loadCYHair(const FileName& fileName)\n  {\n    cyHairFile cyFile;\n    int numHairs = cyFile.load(fileName.c_str());\n    \n    Material objmtl; new (&objmtl) OBJMaterial;\n    Ref<SceneGraph::MaterialNode> material = new SceneGraph::MaterialNode(objmtl);\n    Ref<SceneGraph::HairSetNode> hairset = new SceneGraph::HairSetNode(true,material);\n    \n    for (size_t i=0;i<cyFile.header.numPoints;i++)\n    {\n      Vec3fa v;\n      v.x = cyFile.points[3*i+0];\n      v.y = cyFile.points[3*i+1];\n      v.z = cyFile.points[3*i+2];\n      v.w = cyFile.thickness ? cyFile.thickness[i] : 0.1f;\n      hairset->v.push_back(v);\n    }\n    \n    ssize_t index = 0;\n    for (ssize_t i=0;i<cyFile.header.numStrands;i++)\n    {\n      if (cyFile.segments)\n      {\n        ssize_t numSegments = cyFile.segments[i];       \n        for (ssize_t j=0; j<numSegments-3; j+=3) {\n          hairset->hairs.push_back(SceneGraph::HairSetNode::Hair(index + j,i));\n        }\n        index += numSegments+1;\t\n      }\n      else\n      {\n        ssize_t numSegments = cyFile.header.defaultSegments;       \n        for (ssize_t j=0; j<numSegments-3; j+=3) {\n          hairset->hairs.push_back(SceneGraph::HairSetNode::Hair(index + j,i));\n        }\n        index += numSegments+1;\n      }\n    }\n\n    hairset->verify();\n    return hairset.cast<SceneGraph::Node>();\n  }\n}\n<commit_msg>fixed compile warnings<commit_after>\/\/ ======================================================================== \/\/\n\/\/ Copyright 2009-2016 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 \"cy_hair_loader.h\"\n\n#include <stdio.h>\n#include <math.h>\n\nnamespace embree\n{\n  \/\/ -------------------------------------------\n  \/\/ -- Based on the format by Cem Yuksel     --\n  \/\/ -- www.cemyuksel.com\/research\/hairmodels --\n  \/\/ -------------------------------------------\n  \n#define CY_HAIR_FILE_SEGMENTS_BIT\t1\n#define CY_HAIR_FILE_POINTS_BIT\t\t2\n#define CY_HAIR_FILE_THICKNESS_BIT\t4\n#define CY_HAIR_FILE_TRANSPARENCY_BIT\t8\n#define CY_HAIR_FILE_COLORS_BIT\t\t16\n#define CY_HAIR_FILE_INFO_SIZE\t\t88\n  \n  struct cyHeader\n  {\n    char\t\tsignature[4];\t\/\/\/< This should be \"HAIR\"\n    unsigned int\tnumStrands;\t\/\/\/< number of hair strands\n    unsigned int\tnumPoints;\t\/\/\/< total number of points of all strands\n    unsigned int\tbitarrays;\t\t\/\/\/< bit array of data in the file\n    unsigned int\tdefaultSegments;      \/\/\/< default number of segments of each strand\n    float\t\tdefaultThickness;\t        \/\/\/< default thickness of hair strands\n    float\t\tdefaultTransparency;\t        \/\/\/< default transparency of hair strands\n    float\t\tdefaultColor[3];\t\t\/\/\/< default color of hair strands\n    char\t\tinfo[CY_HAIR_FILE_INFO_SIZE];\t\/\/\/< information about the file\n  };\n  \n  class cyHairFile\n  {\n  public:\n    cyHairFile() : segments(nullptr), points(nullptr), thickness(nullptr), transparency(nullptr), colors(nullptr) {init(); }\n    ~cyHairFile() {\n      if ( segments ) delete [] segments;\n      if ( points ) delete [] points;\n      if ( colors ) delete [] colors;\n      if ( thickness ) delete [] thickness;\n      if ( transparency ) delete [] transparency;      \n    }\n    \n    \n    void init()\n    {\n      header.signature[0] = 'H';\n      header.signature[1] = 'A';\n      header.signature[2] = 'I';\n      header.signature[3] = 'R';\n      header.numStrands = 0;\n      header.numPoints = 0;\n      header.bitarrays = 0;\t\n      header.defaultSegments = 0;\n      header.defaultThickness = 1.0f;\n      header.defaultTransparency = 0.0f;\n      header.defaultColor[0] = 1.0f;\n      header.defaultColor[1] = 1.0f;\n      header.defaultColor[2] = 1.0f;\n      memset( header.info, '\\0', CY_HAIR_FILE_INFO_SIZE );\n    }\n    \n    int load( const char *filename )\n    {\n      init();\n      \n      FILE *file;\n      file = fopen( filename, \"rb\" );\n      if ( file == nullptr )\n        THROW_RUNTIME_ERROR(\"can't open file\");\n      \n      size_t h = fread( &header, sizeof(cyHeader), 1, file );\n      \n      if ( h < 1 ) \n        THROW_RUNTIME_ERROR(\"can't read header\");\n      \n      if ( strncmp( header.signature, \"HAIR\", 4) != 0 ) \n        THROW_RUNTIME_ERROR(\"wrong signature\");\n      \n      if ( header.bitarrays & CY_HAIR_FILE_SEGMENTS_BIT ) {\n        segments = new unsigned short[ header.numStrands ];\n        size_t r = fread( segments, sizeof(unsigned short), header.numStrands, file );\n        if ( r < header.numStrands ) \n          THROW_RUNTIME_ERROR(\"error reading segments\");\n      }\n      \n      if ( header.bitarrays & CY_HAIR_FILE_POINTS_BIT ) {\n        points = new float[ header.numPoints*3 ];\n        size_t r = fread( points, sizeof(float), header.numPoints*3, file );\n        if ( r < header.numPoints*3 ) \n          THROW_RUNTIME_ERROR(\"error reading points\");\n      }\n      \n      if ( header.bitarrays & CY_HAIR_FILE_THICKNESS_BIT ) {\n        thickness = new float[ header.numPoints ];\n        size_t r = fread( thickness, sizeof(float), header.numPoints, file );\n        if ( r < header.numPoints ) \n          THROW_RUNTIME_ERROR(\"error reading thickness values\");\n      }\n      \n      if ( header.bitarrays & CY_HAIR_FILE_TRANSPARENCY_BIT ) {\n        transparency = new float[ header.numPoints ];\n        size_t r = fread( transparency, sizeof(float), header.numPoints, file );\n        if ( r < header.numPoints ) \n          THROW_RUNTIME_ERROR(\"error reading transparency values\");          \n      }\n      \n      if ( header.bitarrays & CY_HAIR_FILE_COLORS_BIT ) {\n        colors = new float[ header.numPoints*3 ];\n        size_t r = fread( colors, sizeof(float), header.numPoints*3, file );\n        if ( r < header.numPoints*3 ) \n          THROW_RUNTIME_ERROR(\"error reading color values\");          \n      }\n      \n      fclose( file );\n      \n      return header.numStrands;\n    }\n    \n    \n    cyHeader header;\n    unsigned short\t*segments;\n    float\t\t*points;\n    float\t\t*thickness;\n    float\t\t*transparency;\n    float\t\t*colors;    \n  };\n  \n  Ref<SceneGraph::Node> SceneGraph::loadCYHair(const FileName& fileName)\n  {\n    cyHairFile cyFile;\n    cyFile.load(fileName.c_str());\n    \n    Material objmtl; new (&objmtl) OBJMaterial;\n    Ref<SceneGraph::MaterialNode> material = new SceneGraph::MaterialNode(objmtl);\n    Ref<SceneGraph::HairSetNode> hairset = new SceneGraph::HairSetNode(true,material);\n    \n    for (size_t i=0;i<cyFile.header.numPoints;i++)\n    {\n      Vec3fa v;\n      v.x = cyFile.points[3*i+0];\n      v.y = cyFile.points[3*i+1];\n      v.z = cyFile.points[3*i+2];\n      v.w = cyFile.thickness ? cyFile.thickness[i] : 0.1f;\n      hairset->v.push_back(v);\n    }\n    \n    ssize_t index = 0;\n    for (ssize_t i=0;i<cyFile.header.numStrands;i++)\n    {\n      if (cyFile.segments)\n      {\n        ssize_t numSegments = cyFile.segments[i];       \n        for (ssize_t j=0; j<numSegments-3; j+=3) {\n          hairset->hairs.push_back(SceneGraph::HairSetNode::Hair(index + j,i));\n        }\n        index += numSegments+1;\t\n      }\n      else\n      {\n        ssize_t numSegments = cyFile.header.defaultSegments;       \n        for (ssize_t j=0; j<numSegments-3; j+=3) {\n          hairset->hairs.push_back(SceneGraph::HairSetNode::Hair(index + j,i));\n        }\n        index += numSegments+1;\n      }\n    }\n\n    hairset->verify();\n    return hairset.cast<SceneGraph::Node>();\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: hierarchyprovider.cxx,v $\n *\n *  $Revision: 1.14 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 13:56: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_ucb.hxx\"\n\n\/**************************************************************************\n                                TODO\n **************************************************************************\n\n - XInitialization::initialize does not work any longer!\n\n *************************************************************************\/\n\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\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_BEANS_XPROPERTYSET_HPP_\n#include <com\/sun\/star\/beans\/XPropertySet.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_UTIL_XOFFICEINSTALLATIONDIRECTORIES_HPP_\n#include <com\/sun\/star\/util\/XOfficeInstallationDirectories.hpp>\n#endif\n#ifndef _UCBHELPER_CONTENTIDENTIFIER_HXX\n#include <ucbhelper\/contentidentifier.hxx>\n#endif\n\n#ifndef _HIERARCHYPROVIDER_HXX\n#include \"hierarchyprovider.hxx\"\n#endif\n#ifndef _HIERARCHYCONTENT_HXX\n#include \"hierarchycontent.hxx\"\n#endif\n#ifndef _HIERARCHYURI_HXX\n#include \"hierarchyuri.hxx\"\n#endif\n\nusing namespace com::sun;\nusing namespace com::sun::star;\n\nusing namespace hierarchy_ucp;\n\n\/\/=========================================================================\n\/\/=========================================================================\n\/\/\n\/\/ HierarchyContentProvider Implementation.\n\/\/\n\/\/=========================================================================\n\/\/=========================================================================\n\nHierarchyContentProvider::HierarchyContentProvider(\n            const uno::Reference< lang::XMultiServiceFactory >& rXSMgr )\n: ::ucb::ContentProviderImplHelper( rXSMgr )\n{\n}\n\n\/\/=========================================================================\n\/\/ virtual\nHierarchyContentProvider::~HierarchyContentProvider()\n{\n}\n\n\/\/=========================================================================\n\/\/\n\/\/ XInterface methods.\n\/\/\n\/\/=========================================================================\n\nXINTERFACE_IMPL_4( HierarchyContentProvider,\n                   lang::XTypeProvider,\n                   lang::XServiceInfo,\n                   star::ucb::XContentProvider,\n                   lang::XInitialization );\n\n\/\/=========================================================================\n\/\/\n\/\/ XTypeProvider methods.\n\/\/\n\/\/=========================================================================\n\nXTYPEPROVIDER_IMPL_4( HierarchyContentProvider,\n                      lang::XTypeProvider,\n                      lang::XServiceInfo,\n                      star::ucb::XContentProvider,\n                      lang::XInitialization );\n\n\/\/=========================================================================\n\/\/\n\/\/ XServiceInfo methods.\n\/\/\n\/\/=========================================================================\n\nXSERVICEINFO_IMPL_1( HierarchyContentProvider,\n                     rtl::OUString::createFromAscii(\n                         \"com.sun.star.comp.ucb.HierarchyContentProvider\" ),\n                     rtl::OUString::createFromAscii(\n                         HIERARCHY_CONTENT_PROVIDER_SERVICE_NAME ) );\n\n\/\/=========================================================================\n\/\/\n\/\/ Service factory implementation.\n\/\/\n\/\/=========================================================================\n\nONE_INSTANCE_SERVICE_FACTORY_IMPL( HierarchyContentProvider );\n\n\/\/=========================================================================\n\/\/\n\/\/ XContentProvider methods.\n\/\/\n\/\/=========================================================================\n\n\/\/ virtual\nuno::Reference< star::ucb::XContent > SAL_CALL\nHierarchyContentProvider::queryContent(\n        const uno::Reference< star::ucb::XContentIdentifier >& Identifier )\n    throw( star::ucb::IllegalIdentifierException, uno::RuntimeException )\n{\n    HierarchyUri aUri( Identifier->getContentIdentifier() );\n    if ( !aUri.isValid() )\n        throw star::ucb::IllegalIdentifierException();\n\n    \/\/ Encode URL and create new Id. This may \"correct\" user-typed-in URL's.\n    uno::Reference< star::ucb::XContentIdentifier > xCanonicId\n        = new ::ucb::ContentIdentifier( m_xSMgr,\n                                        HierarchyUri::encodeURL(\n                                                            aUri.getUri() ) );\n    vos::OGuard aGuard( m_aMutex );\n\n    \/\/ Check, if a content with given id already exists...\n    uno::Reference< star::ucb::XContent > xContent\n        = queryExistingContent( xCanonicId ).getBodyPtr();\n    if ( xContent.is() )\n        return xContent;\n\n    \/\/ Create a new content. Note that the content will insert itself\n    \/\/ into m_pContents by calling addContent(...) from it's ctor.\n\n    xContent = HierarchyContent::create( m_xSMgr, this, xCanonicId );\n\n    if ( xContent.is() && !xContent->getIdentifier().is() )\n        throw star::ucb::IllegalIdentifierException();\n\n    return xContent;\n}\n\n\/\/=========================================================================\n\/\/\n\/\/ XInitialization methods.\n\/\/\n\/\/=========================================================================\n\n\/\/ virtual\nvoid SAL_CALL HierarchyContentProvider::initialize(\n                                const uno::Sequence< uno::Any >& aArguments )\n    throw( uno::Exception, uno::RuntimeException )\n{\n#if 0\n    if ( aArguments.getLength() > 0 )\n    {\n         \/\/ Extract config provider from service init args.\n         aArguments[ 0 ] >>= m_xConfigProvider;\n\n        OSL_ENSURE( m_xConfigProvider.is(),\n                    \"HierarchyContentProvider::initialize - \"\n                    \"No config provider!\" );\n    }\n#else\n    if ( aArguments.getLength() > 0 )\n        OSL_ENSURE( false,\n                    \"HierarchyContentProvider::initialize : not supported!\" );\n#endif\n}\n\n\/\/=========================================================================\n\/\/\n\/\/  Non-interface methods.\n\/\/\n\/\/=========================================================================\n\nuno::Reference< lang::XMultiServiceFactory >\nHierarchyContentProvider::getConfigProvider(\n                                const rtl::OUString & rServiceSpecifier )\n{\n    vos::OGuard aGuard( m_aMutex );\n    ConfigProviderMap::iterator it = m_aConfigProviderMap.find(\n                                                    rServiceSpecifier );\n    if ( it == m_aConfigProviderMap.end() )\n    {\n        try\n        {\n            ConfigProviderMapEntry aEntry;\n            aEntry.xConfigProvider\n                = uno::Reference< lang::XMultiServiceFactory >(\n                                m_xSMgr->createInstance( rServiceSpecifier ),\n                                uno::UNO_QUERY );\n\n            if ( aEntry.xConfigProvider.is() )\n            {\n                m_aConfigProviderMap[ rServiceSpecifier ] = aEntry;\n                return aEntry.xConfigProvider;\n            }\n        }\n        catch ( uno::Exception const & )\n        {\n\/\/            OSL_ENSURE( sal_False,\n\/\/                        \"HierarchyContentProvider::getConfigProvider - \"\n\/\/                        \"caught exception!\" );\n        }\n\n        OSL_ENSURE( sal_False,\n                    \"HierarchyContentProvider::getConfigProvider - \"\n                    \"No config provider!\" );\n\n        return uno::Reference< lang::XMultiServiceFactory >();\n    }\n\n    return (*it).second.xConfigProvider;\n}\n\n\/\/=========================================================================\nuno::Reference< container::XHierarchicalNameAccess >\nHierarchyContentProvider::getRootConfigReadNameAccess(\n                                const rtl::OUString & rServiceSpecifier )\n{\n    vos::OGuard aGuard( m_aMutex );\n    ConfigProviderMap::iterator it = m_aConfigProviderMap.find(\n                                                    rServiceSpecifier );\n    if ( it != m_aConfigProviderMap.end() )\n    {\n        if ( !( (*it).second.xRootReadAccess.is() ) )\n        {\n            if ( (*it).second.bTriedToGetRootReadAccess ) \/\/ #82494#\n            {\n                OSL_ENSURE( sal_False,\n                    \"HierarchyContentProvider::getRootConfigReadNameAccess - \"\n                    \"Unable to read any config data! -> #82494#\" );\n                return uno::Reference< container::XHierarchicalNameAccess >();\n            }\n\n            try\n            {\n                uno::Reference< lang::XMultiServiceFactory > xConfigProv\n                    = getConfigProvider( rServiceSpecifier );\n\n                if ( xConfigProv.is() )\n                {\n                    uno::Sequence< uno::Any > aArguments( 1 );\n                    beans::PropertyValue      aProperty;\n                    aProperty.Name\n                        = rtl::OUString(\n                            RTL_CONSTASCII_USTRINGPARAM( \"nodepath\" ) );\n                    aProperty.Value <<= rtl::OUString(); \/\/ root path\n                    aArguments[ 0 ] <<= aProperty;\n\n                    (*it).second.bTriedToGetRootReadAccess = true;\n\n                    (*it).second.xRootReadAccess\n                        = uno::Reference< container::XHierarchicalNameAccess >(\n                            xConfigProv->createInstanceWithArguments(\n                                rtl::OUString(\n                                    RTL_CONSTASCII_USTRINGPARAM(\n                                        \"com.sun.star.ucb.\"\n                                        \"HierarchyDataReadAccess\" ) ),\n                                aArguments ),\n                            uno::UNO_QUERY );\n                }\n            }\n            catch ( uno::RuntimeException const & )\n            {\n                throw;\n            }\n            catch ( uno::Exception const & )\n            {\n                \/\/ createInstance, createInstanceWithArguments\n\n                OSL_ENSURE( sal_False,\n                    \"HierarchyContentProvider::getRootConfigReadNameAccess - \"\n                    \"caught Exception!\" );\n            }\n        }\n    }\n\n    return (*it).second.xRootReadAccess;\n}\n\n\/\/=========================================================================\nuno::Reference< util::XOfficeInstallationDirectories >\nHierarchyContentProvider::getOfficeInstallationDirectories()\n{\n    if ( !m_xOfficeInstDirs.is() )\n    {\n        vos::OGuard aGuard( m_aMutex );\n        if ( !m_xOfficeInstDirs.is() )\n        {\n            OSL_ENSURE( m_xSMgr.is(), \"No service manager!\" );\n\n            uno::Reference< uno::XComponentContext > xCtx;\n            uno::Reference< beans::XPropertySet > xPropSet(\n                m_xSMgr, uno::UNO_QUERY );\n            if ( xPropSet.is() )\n            {\n                xPropSet->getPropertyValue(\n                    rtl::OUString(\n                        RTL_CONSTASCII_USTRINGPARAM( \"DefaultContext\" ) ) )\n                >>= xCtx;\n            }\n\n            OSL_ENSURE( xCtx.is(),\n                        \"Unable to obtain component context from \"\n                        \"service manager!\" );\n\n            if ( xCtx.is() )\n            {\n                xCtx->getValueByName(\n                    rtl::OUString( RTL_CONSTASCII_USTRINGPARAM(\n                        \"\/singletons\/\"\n                        \"com.sun.star.util.theOfficeInstallationDirectories\" ) ) )\n                >>= m_xOfficeInstDirs;\n\n\/\/ Be silent. singleton only available in an Office environment.\n\/\/                OSL_ENSURE( m_xOfficeInstDirs.is(),\n\/\/                            \"Unable to obtain office directories singleton!\" );\n            }\n        }\n    }\n    return m_xOfficeInstDirs;\n}\n\n<commit_msg>INTEGRATION: CWS ucbfixes01 (1.14.38); FILE MERGED 2007\/04\/23 16:40:11 kso 1.14.38.1: #70959# - Eliminated multiple identical URI helper functionality           implementations.<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: hierarchyprovider.cxx,v $\n *\n *  $Revision: 1.15 $\n *\n *  last change: $Author: kz $ $Date: 2007-05-10 13:04:47 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_ucb.hxx\"\n\n\/**************************************************************************\n                                TODO\n **************************************************************************\n\n - XInitialization::initialize does not work any longer!\n\n *************************************************************************\/\n\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\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_BEANS_XPROPERTYSET_HPP_\n#include <com\/sun\/star\/beans\/XPropertySet.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_UTIL_XOFFICEINSTALLATIONDIRECTORIES_HPP_\n#include <com\/sun\/star\/util\/XOfficeInstallationDirectories.hpp>\n#endif\n#ifndef _UCBHELPER_CONTENTIDENTIFIER_HXX\n#include <ucbhelper\/contentidentifier.hxx>\n#endif\n\n#ifndef _HIERARCHYPROVIDER_HXX\n#include \"hierarchyprovider.hxx\"\n#endif\n#ifndef _HIERARCHYCONTENT_HXX\n#include \"hierarchycontent.hxx\"\n#endif\n#ifndef _HIERARCHYURI_HXX\n#include \"hierarchyuri.hxx\"\n#endif\n\n#include \"..\/inc\/urihelper.hxx\"\n\nusing namespace com::sun;\nusing namespace com::sun::star;\n\nusing namespace hierarchy_ucp;\n\n\/\/=========================================================================\n\/\/=========================================================================\n\/\/\n\/\/ HierarchyContentProvider Implementation.\n\/\/\n\/\/=========================================================================\n\/\/=========================================================================\n\nHierarchyContentProvider::HierarchyContentProvider(\n            const uno::Reference< lang::XMultiServiceFactory >& rXSMgr )\n: ::ucb::ContentProviderImplHelper( rXSMgr )\n{\n}\n\n\/\/=========================================================================\n\/\/ virtual\nHierarchyContentProvider::~HierarchyContentProvider()\n{\n}\n\n\/\/=========================================================================\n\/\/\n\/\/ XInterface methods.\n\/\/\n\/\/=========================================================================\n\nXINTERFACE_IMPL_4( HierarchyContentProvider,\n                   lang::XTypeProvider,\n                   lang::XServiceInfo,\n                   star::ucb::XContentProvider,\n                   lang::XInitialization );\n\n\/\/=========================================================================\n\/\/\n\/\/ XTypeProvider methods.\n\/\/\n\/\/=========================================================================\n\nXTYPEPROVIDER_IMPL_4( HierarchyContentProvider,\n                      lang::XTypeProvider,\n                      lang::XServiceInfo,\n                      star::ucb::XContentProvider,\n                      lang::XInitialization );\n\n\/\/=========================================================================\n\/\/\n\/\/ XServiceInfo methods.\n\/\/\n\/\/=========================================================================\n\nXSERVICEINFO_IMPL_1( HierarchyContentProvider,\n                     rtl::OUString::createFromAscii(\n                         \"com.sun.star.comp.ucb.HierarchyContentProvider\" ),\n                     rtl::OUString::createFromAscii(\n                         HIERARCHY_CONTENT_PROVIDER_SERVICE_NAME ) );\n\n\/\/=========================================================================\n\/\/\n\/\/ Service factory implementation.\n\/\/\n\/\/=========================================================================\n\nONE_INSTANCE_SERVICE_FACTORY_IMPL( HierarchyContentProvider );\n\n\/\/=========================================================================\n\/\/\n\/\/ XContentProvider methods.\n\/\/\n\/\/=========================================================================\n\n\/\/ virtual\nuno::Reference< star::ucb::XContent > SAL_CALL\nHierarchyContentProvider::queryContent(\n        const uno::Reference< star::ucb::XContentIdentifier >& Identifier )\n    throw( star::ucb::IllegalIdentifierException, uno::RuntimeException )\n{\n    HierarchyUri aUri( Identifier->getContentIdentifier() );\n    if ( !aUri.isValid() )\n        throw star::ucb::IllegalIdentifierException();\n\n    \/\/ Encode URL and create new Id. This may \"correct\" user-typed-in URL's.\n    uno::Reference< star::ucb::XContentIdentifier > xCanonicId\n        = new ::ucb::ContentIdentifier( m_xSMgr,\n                                        ::ucb::urihelper::encodeURI(\n                                                            aUri.getUri() ) );\n    vos::OGuard aGuard( m_aMutex );\n\n    \/\/ Check, if a content with given id already exists...\n    uno::Reference< star::ucb::XContent > xContent\n        = queryExistingContent( xCanonicId ).getBodyPtr();\n    if ( xContent.is() )\n        return xContent;\n\n    \/\/ Create a new content. Note that the content will insert itself\n    \/\/ into m_pContents by calling addContent(...) from it's ctor.\n\n    xContent = HierarchyContent::create( m_xSMgr, this, xCanonicId );\n\n    if ( xContent.is() && !xContent->getIdentifier().is() )\n        throw star::ucb::IllegalIdentifierException();\n\n    return xContent;\n}\n\n\/\/=========================================================================\n\/\/\n\/\/ XInitialization methods.\n\/\/\n\/\/=========================================================================\n\n\/\/ virtual\nvoid SAL_CALL HierarchyContentProvider::initialize(\n                                const uno::Sequence< uno::Any >& aArguments )\n    throw( uno::Exception, uno::RuntimeException )\n{\n#if 0\n    if ( aArguments.getLength() > 0 )\n    {\n         \/\/ Extract config provider from service init args.\n         aArguments[ 0 ] >>= m_xConfigProvider;\n\n        OSL_ENSURE( m_xConfigProvider.is(),\n                    \"HierarchyContentProvider::initialize - \"\n                    \"No config provider!\" );\n    }\n#else\n    if ( aArguments.getLength() > 0 )\n        OSL_ENSURE( false,\n                    \"HierarchyContentProvider::initialize : not supported!\" );\n#endif\n}\n\n\/\/=========================================================================\n\/\/\n\/\/  Non-interface methods.\n\/\/\n\/\/=========================================================================\n\nuno::Reference< lang::XMultiServiceFactory >\nHierarchyContentProvider::getConfigProvider(\n                                const rtl::OUString & rServiceSpecifier )\n{\n    vos::OGuard aGuard( m_aMutex );\n    ConfigProviderMap::iterator it = m_aConfigProviderMap.find(\n                                                    rServiceSpecifier );\n    if ( it == m_aConfigProviderMap.end() )\n    {\n        try\n        {\n            ConfigProviderMapEntry aEntry;\n            aEntry.xConfigProvider\n                = uno::Reference< lang::XMultiServiceFactory >(\n                                m_xSMgr->createInstance( rServiceSpecifier ),\n                                uno::UNO_QUERY );\n\n            if ( aEntry.xConfigProvider.is() )\n            {\n                m_aConfigProviderMap[ rServiceSpecifier ] = aEntry;\n                return aEntry.xConfigProvider;\n            }\n        }\n        catch ( uno::Exception const & )\n        {\n\/\/            OSL_ENSURE( sal_False,\n\/\/                        \"HierarchyContentProvider::getConfigProvider - \"\n\/\/                        \"caught exception!\" );\n        }\n\n        OSL_ENSURE( sal_False,\n                    \"HierarchyContentProvider::getConfigProvider - \"\n                    \"No config provider!\" );\n\n        return uno::Reference< lang::XMultiServiceFactory >();\n    }\n\n    return (*it).second.xConfigProvider;\n}\n\n\/\/=========================================================================\nuno::Reference< container::XHierarchicalNameAccess >\nHierarchyContentProvider::getRootConfigReadNameAccess(\n                                const rtl::OUString & rServiceSpecifier )\n{\n    vos::OGuard aGuard( m_aMutex );\n    ConfigProviderMap::iterator it = m_aConfigProviderMap.find(\n                                                    rServiceSpecifier );\n    if ( it != m_aConfigProviderMap.end() )\n    {\n        if ( !( (*it).second.xRootReadAccess.is() ) )\n        {\n            if ( (*it).second.bTriedToGetRootReadAccess ) \/\/ #82494#\n            {\n                OSL_ENSURE( sal_False,\n                    \"HierarchyContentProvider::getRootConfigReadNameAccess - \"\n                    \"Unable to read any config data! -> #82494#\" );\n                return uno::Reference< container::XHierarchicalNameAccess >();\n            }\n\n            try\n            {\n                uno::Reference< lang::XMultiServiceFactory > xConfigProv\n                    = getConfigProvider( rServiceSpecifier );\n\n                if ( xConfigProv.is() )\n                {\n                    uno::Sequence< uno::Any > aArguments( 1 );\n                    beans::PropertyValue      aProperty;\n                    aProperty.Name\n                        = rtl::OUString(\n                            RTL_CONSTASCII_USTRINGPARAM( \"nodepath\" ) );\n                    aProperty.Value <<= rtl::OUString(); \/\/ root path\n                    aArguments[ 0 ] <<= aProperty;\n\n                    (*it).second.bTriedToGetRootReadAccess = true;\n\n                    (*it).second.xRootReadAccess\n                        = uno::Reference< container::XHierarchicalNameAccess >(\n                            xConfigProv->createInstanceWithArguments(\n                                rtl::OUString(\n                                    RTL_CONSTASCII_USTRINGPARAM(\n                                        \"com.sun.star.ucb.\"\n                                        \"HierarchyDataReadAccess\" ) ),\n                                aArguments ),\n                            uno::UNO_QUERY );\n                }\n            }\n            catch ( uno::RuntimeException const & )\n            {\n                throw;\n            }\n            catch ( uno::Exception const & )\n            {\n                \/\/ createInstance, createInstanceWithArguments\n\n                OSL_ENSURE( sal_False,\n                    \"HierarchyContentProvider::getRootConfigReadNameAccess - \"\n                    \"caught Exception!\" );\n            }\n        }\n    }\n\n    return (*it).second.xRootReadAccess;\n}\n\n\/\/=========================================================================\nuno::Reference< util::XOfficeInstallationDirectories >\nHierarchyContentProvider::getOfficeInstallationDirectories()\n{\n    if ( !m_xOfficeInstDirs.is() )\n    {\n        vos::OGuard aGuard( m_aMutex );\n        if ( !m_xOfficeInstDirs.is() )\n        {\n            OSL_ENSURE( m_xSMgr.is(), \"No service manager!\" );\n\n            uno::Reference< uno::XComponentContext > xCtx;\n            uno::Reference< beans::XPropertySet > xPropSet(\n                m_xSMgr, uno::UNO_QUERY );\n            if ( xPropSet.is() )\n            {\n                xPropSet->getPropertyValue(\n                    rtl::OUString(\n                        RTL_CONSTASCII_USTRINGPARAM( \"DefaultContext\" ) ) )\n                >>= xCtx;\n            }\n\n            OSL_ENSURE( xCtx.is(),\n                        \"Unable to obtain component context from \"\n                        \"service manager!\" );\n\n            if ( xCtx.is() )\n            {\n                xCtx->getValueByName(\n                    rtl::OUString( RTL_CONSTASCII_USTRINGPARAM(\n                        \"\/singletons\/\"\n                        \"com.sun.star.util.theOfficeInstallationDirectories\" ) ) )\n                >>= m_xOfficeInstDirs;\n\n\/\/ Be silent. singleton only available in an Office environment.\n\/\/                OSL_ENSURE( m_xOfficeInstDirs.is(),\n\/\/                            \"Unable to obtain office directories singleton!\" );\n            }\n        }\n    }\n    return m_xOfficeInstDirs;\n}\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>1203 - Argus<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>cleanup prints<commit_after><|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_ocb_indir_setup_linear.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\/\/\/ @file p9_pm_ocb_indir_setup_linear.C\n\/\/\/ @brief  Configure OCB Channel for Linear Streaming or Non-streaming mode\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           : 2\n\/\/ *HWP Consumed by     : HS\n\n#ifndef _P9_PM_OCB_INDIR_SETUP_LINEAR_H_\n#define _P9_PM_OCB_INDIR_SETUP_LINEAR_H_\n\n#include <fapi2.H>\n#include <p9_pm_ocb_init.H>\n\ntypedef fapi2::ReturnCode (*p9_pm_ocb_indir_setup_linear_FP_t)\n(const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>&,\n const p9ocb::PM_OCB_CHAN_NUM,\n const p9ocb::PM_OCB_CHAN_TYPE,\n const uint32_t);\n\nextern \"C\"\n{\n\n\/\/------------------------------------------------------------------------------\n\/\/ Function prototype\n\/\/------------------------------------------------------------------------------\n\/\/\/ @brief  Configure OCB Channel for Linear Streaming or Non-streaming mode\n\/\/\/ @param[in]  i_target   Chip Target\n\/\/\/ @param[in]  i_ocb_chan select channel 0-3 to set up      (see p8_ocb_init.H)\n\/\/\/ @param[in]  i_ocb_type linear streaming or non-streaming (see p8_ocb_init.H)\n\/\/\/ @param[in]  i_ocb_bar  32-bit channel base address (29 bits + \"000\")\n\/\/\/ @return FAPI2_RC_SUCCESS on success, else error.\n\n    fapi2::ReturnCode p9_pm_ocb_indir_setup_linear(\n        const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>& i_target,\n        const p9ocb::PM_OCB_CHAN_NUM  i_ocb_chan,\n        const p9ocb::PM_OCB_CHAN_TYPE i_ocb_type,\n        const uint32_t      i_ocb_bar);\n\n} \/\/ extern \"C\"\n\n#endif\n<commit_msg>p9_pm_ocb_indir_access: Modify the interface to accept integer data<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_ocb_indir_setup_linear.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\/\/\/ @file p9_pm_ocb_indir_setup_linear.C\n\/\/\/ @brief  Configure OCB Channel for Linear Streaming or Non-streaming mode\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        : Sangeetha T S <sangeet2@in.ibm.com>\n\/\/ *HWP Team            : PM\n\/\/ *HWP Level           : 2\n\/\/ *HWP Consumed by     : HS\n\n#ifndef _P9_PM_OCB_INDIR_SETUP_LINEAR_H_\n#define _P9_PM_OCB_INDIR_SETUP_LINEAR_H_\n\n#include <fapi2.H>\n#include <p9_pm_ocb_init.H>\n\ntypedef fapi2::ReturnCode (*p9_pm_ocb_indir_setup_linear_FP_t)\n(const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>&,\n const p9ocb::PM_OCB_CHAN_NUM,\n const p9ocb::PM_OCB_CHAN_TYPE,\n const uint32_t);\n\nextern \"C\"\n{\n\n\/\/------------------------------------------------------------------------------\n\/\/ Function prototype\n\/\/------------------------------------------------------------------------------\n\/\/\/ @brief  Configure OCB Channel for Linear Streaming or Non-streaming mode\n\/\/\/ @param[in]  i_target   Chip Target\n\/\/\/ @param[in]  i_ocb_chan select channel 0-3 to set up      (see p8_ocb_init.H)\n\/\/\/ @param[in]  i_ocb_type linear streaming or non-streaming (see p8_ocb_init.H)\n\/\/\/ @param[in]  i_ocb_bar  32-bit channel base address (29 bits + \"000\")\n\/\/\/ @return FAPI2_RC_SUCCESS on success, else error.\n\n    fapi2::ReturnCode p9_pm_ocb_indir_setup_linear(\n        const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>& i_target,\n        const p9ocb::PM_OCB_CHAN_NUM  i_ocb_chan,\n        const p9ocb::PM_OCB_CHAN_TYPE i_ocb_type,\n        const uint32_t      i_ocb_bar);\n\n} \/\/ extern \"C\"\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>glsl: fix optimization of discard nested multiple levels<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>Increased threshold for queue running full warning<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n   Copyright (C) 2018 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 \"ConnectionApi.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 \"ContactsApi.hpp\"\n#include \"CTcpTransport.hpp\"\n#include \"CTelegramTransport.hpp\"\n#include \"DcConfiguration.hpp\"\n\n\/\/ Server\n#include \"TelegramServer.hpp\"\n#include \"RemoteClientConnection.hpp\"\n#include \"TelegramServerUser.hpp\"\n#include \"ServerRpcLayer.hpp\"\n#include \"Session.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 \"TestAuthProvider.hpp\"\n#include \"TestClientUtils.hpp\"\n#include \"TestServerUtils.hpp\"\n#include \"TestUserData.hpp\"\n#include \"TestUtils.hpp\"\n\nusing namespace Telegram;\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\nclass tst_ConnectionApi : public QObject\n{\n    Q_OBJECT\npublic:\n    explicit tst_ConnectionApi(QObject *parent = nullptr);\n\nprivate slots:\n    void initTestCase();\n    void cleanupTestCase();\n    void testClientConnection_data();\n    void testClientConnection();\n    void reconnect();\n};\n\ntst_ConnectionApi::tst_ConnectionApi(QObject *parent) :\n    QObject(parent)\n{\n}\n\nvoid tst_ConnectionApi::initTestCase()\n{\n    qRegisterMetaType<UserData>();\n    QVERIFY(TestKeyData::initKeyFiles());\n\n    if (!qEnvironmentVariableIsSet(BaseTcpTransport::timeoutEnvironmentVariableName())) {\n        qputenv(BaseTcpTransport::timeoutEnvironmentVariableName(), QByteArrayLiteral(\"50\"));\n    }\n    if (!qEnvironmentVariableIsSet(Client::ConnectionApi::reconnectionIntervalsEnvironmentVariableName())) {\n        qputenv(Client::ConnectionApi::reconnectionIntervalsEnvironmentVariableName(), QByteArrayLiteral(\"0,5,5,30,30,60\"));\n    }\n}\n\nvoid tst_ConnectionApi::cleanupTestCase()\n{\n    QVERIFY(TestKeyData::cleanupKeyFiles());\n}\n\nvoid tst_ConnectionApi::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\")\n            << Client::Settings::SessionType::Abridged\n            << userOnDc1\n            << opt;\n    QTest::newRow(\"Obfuscated\")\n            << Client::Settings::SessionType::Obfuscated\n            << userOnDc1\n            << opt;\n\n    QTest::newRow(\"Abridged with migration\")\n            << Client::Settings::SessionType::Abridged\n            << userOnDc2\n            << opt;\n\n    QTest::newRow(\"Obfuscated with migration\")\n            << Client::Settings::SessionType::Obfuscated\n            << userOnDc2\n            << opt;\n\n    opt.id = 0;\n    QTest::newRow(\"Migration from unknown dc (with password)\")\n            << Client::Settings::SessionType::Obfuscated\n            << userOnDc2\n            << opt;\n    QTest::newRow(\"Migration from unknown dc, no password\")\n            << Client::Settings::SessionType::Obfuscated\n            << user2OnDc2\n            << opt;\n}\n\nvoid tst_ConnectionApi::testClientConnection()\n{\n    QFETCH(Telegram::Client::Settings::SessionType, sessionType);\n    QFETCH(UserData, userData);\n    QFETCH(DcOption, clientDcOption);\n\n    const RsaKey publicKey = RsaKey::fromFile(TestKeyData::publicKeyFileName());\n    QVERIFY2(publicKey.isValid(), \"Unable to read public RSA key\");\n    const RsaKey privateKey = RsaKey::fromFile(TestKeyData::privateKeyFileName());\n    QVERIFY2(privateKey.isPrivate(), \"Unable to read private RSA key\");\n\n    Test::AuthProvider authProvider;\n    Telegram::Server::LocalCluster cluster;\n    cluster.setAuthorizationProvider(&authProvider);\n    cluster.setServerPrivateRsaKey(privateKey);\n    cluster.setServerConfiguration(c_localDcConfiguration);\n    QVERIFY(cluster.start());\n\n    Server::ServerApi *server = cluster.getServerApiInstance(userData.dcId);\n    QVERIFY(server);\n\n    Server::LocalUser *user = tryAddUser(&cluster, userData);\n    QVERIFY(user);\n\n    Client::Client client;\n    setupClientHelper(&client, userData, publicKey, clientDcOption, sessionType);\n    Client::ConnectionApi *connectionApi = client.connectionApi();\n\n    QSignalSpy clientConnectionStatusSpy(connectionApi, &Client::ConnectionApi::statusChanged);\n    QCOMPARE(connectionApi->status(), Telegram::Client::ConnectionApi::StatusDisconnected);\n\n    \/\/ --- Sign in ---\n    Client::AuthOperation *signInOperation = connectionApi->startAuthentication();\n    {\n        QSignalSpy serverAuthCodeSpy(&authProvider, &Test::AuthProvider::codeSent);\n        QSignalSpy authCodeSpy(signInOperation, &Client::AuthOperation::authCodeRequired);\n\n        TRY_COMPARE(connectionApi->status(), Telegram::Client::ConnectionApi::StatusWaitForAuthentication);\n        QCOMPARE(clientConnectionStatusSpy.takeFirst().first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusWaitForConnection));\n        QCOMPARE(clientConnectionStatusSpy.takeFirst().first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusConnecting));\n        QCOMPARE(clientConnectionStatusSpy.takeFirst().first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusWaitForAuthentication));\n\n        signInOperation->submitPhoneNumber(userData.phoneNumber);\n        TRY_COMPARE(client.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        clientConnectionStatusSpy.clear();\n        signInOperation->submitAuthCode(authCode);\n    }\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        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    TRY_VERIFY(!clientConnectionStatusSpy.isEmpty());\n    QCOMPARE(clientConnectionStatusSpy.takeFirst().first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusConnected));\n\n    TRY_VERIFY(!clientConnectionStatusSpy.isEmpty());\n    QCOMPARE(connectionApi->status(), Telegram::Client::ConnectionApi::StatusReady);\n    QCOMPARE(clientConnectionStatusSpy.takeFirst().first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusReady));\n    QVERIFY(clientConnectionStatusSpy.isEmpty());\n\n    QCOMPARE(client.accountStorage()->phoneNumber(), userData.phoneNumber);\n    QCOMPARE(client.accountStorage()->dcInfo().id, server->dcId());\n    QCOMPARE(client.accountStorage()->dcInfo().id, userData.dcId);\n    QVERIFY(client.contactsApi()->selfContactId());\n}\n\nvoid tst_ConnectionApi::reconnect()\n{\n    const UserData userData = c_userWithPassword;\n    const DcOption clientDcOption = c_localDcOptions.first();\n\n    const RsaKey publicKey = RsaKey::fromFile(TestKeyData::publicKeyFileName());\n    QVERIFY2(publicKey.isValid(), \"Unable to read public RSA key\");\n    const RsaKey privateKey = RsaKey::fromFile(TestKeyData::privateKeyFileName());\n    QVERIFY2(privateKey.isValid(), \"Unable to read private RSA key\");\n\n    Test::AuthProvider authProvider;\n    Telegram::Server::LocalCluster cluster;\n    cluster.setAuthorizationProvider(&authProvider);\n    cluster.setServerPrivateRsaKey(privateKey);\n    cluster.setServerConfiguration(c_localDcConfiguration);\n    QVERIFY(cluster.start());\n\n    Server::Server *server = cluster.getServerInstance(userData.dcId);\n    QVERIFY(server);\n\n    Server::LocalUser *user = tryAddUser(&cluster, userData);\n    QVERIFY(user);\n\n    Client::Client client;\n    setupClientHelper(&client, userData, publicKey, clientDcOption);\n    Client::ConnectionApi *connectionApi = client.connectionApi();\n\n    QSignalSpy clientConnectionStatusSpy(connectionApi, &Client::ConnectionApi::statusChanged);\n    QCOMPARE(connectionApi->status(), Telegram::Client::ConnectionApi::StatusDisconnected);\n\n    \/\/ --- Sign in ---\n    Client::AuthOperation *signInOperation = connectionApi->startAuthentication();\n    signInOperation->setPhoneNumber(userData.phoneNumber);\n    QSignalSpy serverAuthCodeSpy(&authProvider, &Test::AuthProvider::codeSent);\n    QSignalSpy authCodeSpy(signInOperation, &Client::AuthOperation::authCodeRequired);\n\n    TRY_COMPARE(connectionApi->status(), Telegram::Client::ConnectionApi::StatusWaitForAuthentication);\n    QCOMPARE(clientConnectionStatusSpy.takeFirst().first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusWaitForConnection));\n    QCOMPARE(clientConnectionStatusSpy.takeFirst().first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusConnecting));\n    QCOMPARE(clientConnectionStatusSpy.takeFirst().first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusWaitForAuthentication));\n\n    TRY_COMPARE(client.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        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    TRY_VERIFY(!clientConnectionStatusSpy.isEmpty());\n    QCOMPARE(clientConnectionStatusSpy.takeFirst().first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusConnected));\n\n    TRY_VERIFY(!clientConnectionStatusSpy.isEmpty());\n    QCOMPARE(connectionApi->status(), Telegram::Client::ConnectionApi::StatusReady);\n    QCOMPARE(clientConnectionStatusSpy.takeFirst().first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusReady));\n    QVERIFY(clientConnectionStatusSpy.isEmpty());\n\n    QCOMPARE(client.accountStorage()->phoneNumber(), userData.phoneNumber);\n    QCOMPARE(client.accountStorage()->dcInfo().id, server->dcId());\n    QCOMPARE(client.accountStorage()->dcInfo().id, userData.dcId);\n    QCOMPARE(user->activeSessions().count(), 1);\n    Server::Session *activeSession = user->activeSessions().first();\n    QVERIFY(activeSession);\n    Telegram::BaseTransport *serverSideTransport = activeSession->getConnection()->transport();\n    QVERIFY(serverSideTransport);\n\n    QVERIFY(clientConnectionStatusSpy.isEmpty());\n    \/\/ Brutal disconnect from server side\n    serverSideTransport->disconnectFromHost();\n\n    TRY_VERIFY(!clientConnectionStatusSpy.isEmpty());\n    {\n        QVariantList firstSignal = clientConnectionStatusSpy.takeFirst();\n        QCOMPARE(firstSignal.first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusConnecting));\n        \/\/QCOMPARE(firstSignal.last().value<int>(), static_cast<int>(Client::ConnectionApi::StatusReasonRemote));\n    }\n\n    TRY_COMPARE(connectionApi->status(), Client::ConnectionApi::StatusReady);\n    QVERIFY(!clientConnectionStatusSpy.isEmpty());\n    {\n        QVariantList interestingSignal = clientConnectionStatusSpy.takeLast();\n        QCOMPARE(interestingSignal.first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusReady));\n        interestingSignal = clientConnectionStatusSpy.takeLast();\n        QCOMPARE(interestingSignal.first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusConnected));\n        clientConnectionStatusSpy.clear();\n    }\n\n    server->stop();\n\n    constexpr int c_minReconnectSignals = 4;\n    TRY_VERIFY(clientConnectionStatusSpy.count() >= c_minReconnectSignals);\n    {\n        qDebug() << clientConnectionStatusSpy.mid(clientConnectionStatusSpy.count() - c_minReconnectSignals);\n\n        QVariantList firstSignal = clientConnectionStatusSpy.takeFirst();\n        QCOMPARE(firstSignal.first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusConnecting));\n        QCOMPARE(firstSignal.last().value<int>(), static_cast<int>(Client::ConnectionApi::StatusReasonRemote));\n        clientConnectionStatusSpy.clear();\n    }\n\n    QVERIFY(server->start());\n\n    TRY_COMPARE(connectionApi->status(), Client::ConnectionApi::StatusReady);\n    QVERIFY(!clientConnectionStatusSpy.isEmpty());\n    {\n        QVariantList interestingSignal = clientConnectionStatusSpy.takeLast();\n        QCOMPARE(interestingSignal.first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusReady));\n        interestingSignal = clientConnectionStatusSpy.takeLast();\n        QCOMPARE(interestingSignal.first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusConnected));\n        clientConnectionStatusSpy.clear();\n    }\n}\n\nQTEST_GUILESS_MAIN(tst_ConnectionApi)\n\n#include \"tst_ConnectionApi.moc\"\n<commit_msg>Tests\/ConnectionApi: Add a test that waits for phone requested signal<commit_after>\/*\n   Copyright (C) 2018 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 \"ConnectionApi.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 \"ContactsApi.hpp\"\n#include \"CTcpTransport.hpp\"\n#include \"CTelegramTransport.hpp\"\n#include \"DcConfiguration.hpp\"\n\n\/\/ Server\n#include \"TelegramServer.hpp\"\n#include \"RemoteClientConnection.hpp\"\n#include \"TelegramServerUser.hpp\"\n#include \"ServerRpcLayer.hpp\"\n#include \"Session.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 \"TestAuthProvider.hpp\"\n#include \"TestClientUtils.hpp\"\n#include \"TestServerUtils.hpp\"\n#include \"TestUserData.hpp\"\n#include \"TestUtils.hpp\"\n\nusing namespace Telegram;\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\nclass tst_ConnectionApi : public QObject\n{\n    Q_OBJECT\npublic:\n    explicit tst_ConnectionApi(QObject *parent = nullptr);\n\nprivate slots:\n    void initTestCase();\n    void cleanupTestCase();\n    void testClientConnection_data();\n    void testClientConnection();\n    void reconnect();\n};\n\ntst_ConnectionApi::tst_ConnectionApi(QObject *parent) :\n    QObject(parent)\n{\n}\n\nvoid tst_ConnectionApi::initTestCase()\n{\n    qRegisterMetaType<UserData>();\n    QVERIFY(TestKeyData::initKeyFiles());\n\n    if (!qEnvironmentVariableIsSet(BaseTcpTransport::timeoutEnvironmentVariableName())) {\n        qputenv(BaseTcpTransport::timeoutEnvironmentVariableName(), QByteArrayLiteral(\"50\"));\n    }\n    if (!qEnvironmentVariableIsSet(Client::ConnectionApi::reconnectionIntervalsEnvironmentVariableName())) {\n        qputenv(Client::ConnectionApi::reconnectionIntervalsEnvironmentVariableName(), QByteArrayLiteral(\"0,5,5,30,30,60\"));\n    }\n}\n\nvoid tst_ConnectionApi::cleanupTestCase()\n{\n    QVERIFY(TestKeyData::cleanupKeyFiles());\n}\n\nvoid tst_ConnectionApi::testClientConnection_data()\n{\n    QTest::addColumn<Telegram::Client::Settings::SessionType>(\"sessionType\");\n    QTest::addColumn<UserData>(\"userData\");\n    QTest::addColumn<DcOption>(\"clientDcOption\");\n    QTest::addColumn<bool>(\"waitForPhoneRequest\");\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    constexpr bool c_waitForPhoneRequest = true;\n    constexpr bool c_dontWaitForPhoneRequest = false;\n\n    DcOption opt = c_localDcOptions.first();\n\n    QTest::newRow(\"Abridged\")\n            << Client::Settings::SessionType::Abridged\n            << userOnDc1\n            << opt\n            << c_dontWaitForPhoneRequest;\n\n    QTest::newRow(\"Obfuscated\")\n            << Client::Settings::SessionType::Obfuscated\n            << userOnDc1\n            << opt\n            << c_dontWaitForPhoneRequest;\n\n    QTest::newRow(\"Abridged with migration\")\n            << Client::Settings::SessionType::Abridged\n            << userOnDc2\n            << opt\n            << c_dontWaitForPhoneRequest;\n\n    QTest::newRow(\"Abridged with migration (wait for phone requested)\")\n            << Client::Settings::SessionType::Abridged\n            << userOnDc2\n            << opt\n            << c_waitForPhoneRequest;\n\n    QTest::newRow(\"Obfuscated with migration\")\n            << Client::Settings::SessionType::Obfuscated\n            << userOnDc2\n            << opt\n            << c_dontWaitForPhoneRequest;\n\n    opt.id = 0;\n    QTest::newRow(\"Migration from unknown dc (with password)\")\n            << Client::Settings::SessionType::Obfuscated\n            << userOnDc2\n            << opt\n            << c_dontWaitForPhoneRequest;\n\n    QTest::newRow(\"Migration from unknown dc, no password\")\n            << Client::Settings::SessionType::Obfuscated\n            << user2OnDc2\n            << opt\n            << c_dontWaitForPhoneRequest;\n}\n\nvoid tst_ConnectionApi::testClientConnection()\n{\n    QFETCH(Telegram::Client::Settings::SessionType, sessionType);\n    QFETCH(UserData, userData);\n    QFETCH(DcOption, clientDcOption);\n    QFETCH(bool, waitForPhoneRequest);\n\n    const RsaKey publicKey = RsaKey::fromFile(TestKeyData::publicKeyFileName());\n    QVERIFY2(publicKey.isValid(), \"Unable to read public RSA key\");\n    const RsaKey privateKey = RsaKey::fromFile(TestKeyData::privateKeyFileName());\n    QVERIFY2(privateKey.isPrivate(), \"Unable to read private RSA key\");\n\n    Test::AuthProvider authProvider;\n    Telegram::Server::LocalCluster cluster;\n    cluster.setAuthorizationProvider(&authProvider);\n    cluster.setServerPrivateRsaKey(privateKey);\n    cluster.setServerConfiguration(c_localDcConfiguration);\n    QVERIFY(cluster.start());\n\n    Server::ServerApi *server = cluster.getServerApiInstance(userData.dcId);\n    QVERIFY(server);\n\n    Server::LocalUser *user = tryAddUser(&cluster, userData);\n    QVERIFY(user);\n\n    Client::Client client;\n    setupClientHelper(&client, userData, publicKey, clientDcOption, sessionType);\n    Client::ConnectionApi *connectionApi = client.connectionApi();\n\n    QSignalSpy clientConnectionStatusSpy(connectionApi, &Client::ConnectionApi::statusChanged);\n    QCOMPARE(connectionApi->status(), Telegram::Client::ConnectionApi::StatusDisconnected);\n\n    \/\/ --- Sign in ---\n    Client::AuthOperation *signInOperation = connectionApi->startAuthentication();\n    {\n        QSignalSpy serverAuthCodeSpy(&authProvider, &Test::AuthProvider::codeSent);\n        QSignalSpy authPhoneSpy(signInOperation, &Client::AuthOperation::phoneNumberRequired);\n        QSignalSpy authCodeSpy(signInOperation, &Client::AuthOperation::authCodeRequired);\n\n        if (waitForPhoneRequest) {\n            TRY_VERIFY(!authPhoneSpy.isEmpty());\n            QCOMPARE(authPhoneSpy.count(), 1);\n            signInOperation->submitPhoneNumber(userData.phoneNumber);\n            QCOMPARE(connectionApi->status(), Telegram::Client::ConnectionApi::StatusWaitForAuthentication);\n        } else {\n            signInOperation->setPhoneNumber(userData.phoneNumber);\n            TRY_COMPARE(connectionApi->status(), Telegram::Client::ConnectionApi::StatusWaitForAuthentication);\n        }\n\n        QCOMPARE(clientConnectionStatusSpy.takeFirst().first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusWaitForConnection));\n        QCOMPARE(clientConnectionStatusSpy.takeFirst().first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusConnecting));\n        QCOMPARE(clientConnectionStatusSpy.takeFirst().first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusWaitForAuthentication));\n\n        TRY_COMPARE(client.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        if (!waitForPhoneRequest) {\n            QVERIFY(authPhoneSpy.isEmpty());\n        }\n\n        clientConnectionStatusSpy.clear();\n        signInOperation->submitAuthCode(authCode);\n    }\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        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    TRY_VERIFY(!clientConnectionStatusSpy.isEmpty());\n    QCOMPARE(clientConnectionStatusSpy.takeFirst().first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusConnected));\n\n    TRY_VERIFY(!clientConnectionStatusSpy.isEmpty());\n    QCOMPARE(connectionApi->status(), Telegram::Client::ConnectionApi::StatusReady);\n    QCOMPARE(clientConnectionStatusSpy.takeFirst().first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusReady));\n    QVERIFY(clientConnectionStatusSpy.isEmpty());\n\n    QCOMPARE(client.accountStorage()->phoneNumber(), userData.phoneNumber);\n    QCOMPARE(client.accountStorage()->dcInfo().id, server->dcId());\n    QCOMPARE(client.accountStorage()->dcInfo().id, userData.dcId);\n    QVERIFY(client.contactsApi()->selfContactId());\n}\n\nvoid tst_ConnectionApi::reconnect()\n{\n    const UserData userData = c_userWithPassword;\n    const DcOption clientDcOption = c_localDcOptions.first();\n\n    const RsaKey publicKey = RsaKey::fromFile(TestKeyData::publicKeyFileName());\n    QVERIFY2(publicKey.isValid(), \"Unable to read public RSA key\");\n    const RsaKey privateKey = RsaKey::fromFile(TestKeyData::privateKeyFileName());\n    QVERIFY2(privateKey.isValid(), \"Unable to read private RSA key\");\n\n    Test::AuthProvider authProvider;\n    Telegram::Server::LocalCluster cluster;\n    cluster.setAuthorizationProvider(&authProvider);\n    cluster.setServerPrivateRsaKey(privateKey);\n    cluster.setServerConfiguration(c_localDcConfiguration);\n    QVERIFY(cluster.start());\n\n    Server::Server *server = cluster.getServerInstance(userData.dcId);\n    QVERIFY(server);\n\n    Server::LocalUser *user = tryAddUser(&cluster, userData);\n    QVERIFY(user);\n\n    Client::Client client;\n    setupClientHelper(&client, userData, publicKey, clientDcOption);\n    Client::ConnectionApi *connectionApi = client.connectionApi();\n\n    QSignalSpy clientConnectionStatusSpy(connectionApi, &Client::ConnectionApi::statusChanged);\n    QCOMPARE(connectionApi->status(), Telegram::Client::ConnectionApi::StatusDisconnected);\n\n    \/\/ --- Sign in ---\n    Client::AuthOperation *signInOperation = connectionApi->startAuthentication();\n    signInOperation->setPhoneNumber(userData.phoneNumber);\n    QSignalSpy serverAuthCodeSpy(&authProvider, &Test::AuthProvider::codeSent);\n    QSignalSpy authCodeSpy(signInOperation, &Client::AuthOperation::authCodeRequired);\n\n    TRY_COMPARE(connectionApi->status(), Telegram::Client::ConnectionApi::StatusWaitForAuthentication);\n    QCOMPARE(clientConnectionStatusSpy.takeFirst().first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusWaitForConnection));\n    QCOMPARE(clientConnectionStatusSpy.takeFirst().first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusConnecting));\n    QCOMPARE(clientConnectionStatusSpy.takeFirst().first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusWaitForAuthentication));\n\n    TRY_COMPARE(client.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        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    TRY_VERIFY(!clientConnectionStatusSpy.isEmpty());\n    QCOMPARE(clientConnectionStatusSpy.takeFirst().first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusConnected));\n\n    TRY_VERIFY(!clientConnectionStatusSpy.isEmpty());\n    QCOMPARE(connectionApi->status(), Telegram::Client::ConnectionApi::StatusReady);\n    QCOMPARE(clientConnectionStatusSpy.takeFirst().first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusReady));\n    QVERIFY(clientConnectionStatusSpy.isEmpty());\n\n    QCOMPARE(client.accountStorage()->phoneNumber(), userData.phoneNumber);\n    QCOMPARE(client.accountStorage()->dcInfo().id, server->dcId());\n    QCOMPARE(client.accountStorage()->dcInfo().id, userData.dcId);\n    QCOMPARE(user->activeSessions().count(), 1);\n    Server::Session *activeSession = user->activeSessions().first();\n    QVERIFY(activeSession);\n    Telegram::BaseTransport *serverSideTransport = activeSession->getConnection()->transport();\n    QVERIFY(serverSideTransport);\n\n    QVERIFY(clientConnectionStatusSpy.isEmpty());\n    \/\/ Brutal disconnect from server side\n    serverSideTransport->disconnectFromHost();\n\n    TRY_VERIFY(!clientConnectionStatusSpy.isEmpty());\n    {\n        QVariantList firstSignal = clientConnectionStatusSpy.takeFirst();\n        QCOMPARE(firstSignal.first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusConnecting));\n        \/\/QCOMPARE(firstSignal.last().value<int>(), static_cast<int>(Client::ConnectionApi::StatusReasonRemote));\n    }\n\n    TRY_COMPARE(connectionApi->status(), Client::ConnectionApi::StatusReady);\n    QVERIFY(!clientConnectionStatusSpy.isEmpty());\n    {\n        QVariantList interestingSignal = clientConnectionStatusSpy.takeLast();\n        QCOMPARE(interestingSignal.first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusReady));\n        interestingSignal = clientConnectionStatusSpy.takeLast();\n        QCOMPARE(interestingSignal.first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusConnected));\n        clientConnectionStatusSpy.clear();\n    }\n\n    server->stop();\n\n    constexpr int c_minReconnectSignals = 4;\n    TRY_VERIFY(clientConnectionStatusSpy.count() >= c_minReconnectSignals);\n    {\n        qDebug() << clientConnectionStatusSpy.mid(clientConnectionStatusSpy.count() - c_minReconnectSignals);\n\n        QVariantList firstSignal = clientConnectionStatusSpy.takeFirst();\n        QCOMPARE(firstSignal.first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusConnecting));\n        QCOMPARE(firstSignal.last().value<int>(), static_cast<int>(Client::ConnectionApi::StatusReasonRemote));\n        clientConnectionStatusSpy.clear();\n    }\n\n    QVERIFY(server->start());\n\n    TRY_COMPARE(connectionApi->status(), Client::ConnectionApi::StatusReady);\n    QVERIFY(!clientConnectionStatusSpy.isEmpty());\n    {\n        QVariantList interestingSignal = clientConnectionStatusSpy.takeLast();\n        QCOMPARE(interestingSignal.first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusReady));\n        interestingSignal = clientConnectionStatusSpy.takeLast();\n        QCOMPARE(interestingSignal.first().value<int>(), static_cast<int>(Client::ConnectionApi::StatusConnected));\n        clientConnectionStatusSpy.clear();\n    }\n}\n\nQTEST_GUILESS_MAIN(tst_ConnectionApi)\n\n#include \"tst_ConnectionApi.moc\"\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Don't drop scheduleAnimation when there is no layer tree<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 (qt-info@nokia.com)\n**\n** No Commercial Usage\n**\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the Technology Preview License Agreement accompanying\n** this package.\n**\n** GNU Lesser General Public License Usage\n**\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain additional\n** rights.  These rights are described in the Nokia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at qt-info@nokia.com.\n**\n**************************************************************************\/\n#include \"s60publishingresultspageovi.h\"\n#include \"s60publisherovi.h\"\n\n#include <QDesktopServices>\n#include <QtGui\/QAbstractButton>\n\nnamespace Qt4ProjectManager {\nnamespace Internal {\n\nS60PublishingResultsPageOvi::S60PublishingResultsPageOvi(S60PublisherOvi *publisher, QWidget *parent) :\n    QWizardPage(parent),\n    m_publisher(publisher),\n    ui(new Ui::S60PublishingResultsPageOvi)\n{\n    ui->setupUi(this);\n    connect(m_publisher, SIGNAL(progressReport(QString,QColor)), SLOT(updateResultsPage(QString,QColor)));\n}\n\nS60PublishingResultsPageOvi::~S60PublishingResultsPageOvi()\n{\n    delete ui;\n}\n\nvoid S60PublishingResultsPageOvi::initializePage()\n{\n    wizard()->setButtonText(QWizard::FinishButton, tr(\"Open Containing Folder\"));\n    connect(m_publisher, SIGNAL(succeeded()), SIGNAL(completeChanged()));\n    connect(wizard()->button(QWizard::FinishButton), SIGNAL(clicked()), SLOT(openFileLocation()));\n    m_publisher->buildSis();\n}\n\nbool S60PublishingResultsPageOvi::isComplete() const\n{\n    return m_publisher->hasSucceeded();\n}\n\nvoid S60PublishingResultsPageOvi::updateResultsPage(const QString& status, QColor c)\n{\n    QTextCursor cur(ui->resultsTextBrowser->document());\n    QTextCharFormat tcf = cur.charFormat();\n    tcf.setForeground(c);\n    cur.movePosition(QTextCursor::End);\n    cur.insertText(status, tcf);\n}\n\nvoid S60PublishingResultsPageOvi::openFileLocation()\n{\n#ifdef Q_OS_WIN\n    QProcess::startDetached(\"explorer \/select,\"+ m_publisher->createdSisFilePath());\n#else\n    QDesktopServices::openUrl(QUrl(\"file:\/\/\/\" + m_publisher->getCreatedSisFileContainingFolder()));\n#endif\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace Qt4ProjectManager\n<commit_msg>compile fix<commit_after>\/**************************************************************************\n**\n** This file is part of Qt Creator\n**\n** Copyright (c) 2011 Nokia Corporation and\/or its subsidiary(-ies).\n**\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** No Commercial Usage\n**\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the Technology Preview License Agreement accompanying\n** this package.\n**\n** GNU Lesser General Public License Usage\n**\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain additional\n** rights.  These rights are described in the Nokia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at qt-info@nokia.com.\n**\n**************************************************************************\/\n#include \"s60publishingresultspageovi.h\"\n#include \"s60publisherovi.h\"\n\n#include <QDesktopServices>\n#include <QtGui\/QAbstractButton>\n\nnamespace Qt4ProjectManager {\nnamespace Internal {\n\nS60PublishingResultsPageOvi::S60PublishingResultsPageOvi(S60PublisherOvi *publisher, QWidget *parent) :\n    QWizardPage(parent),\n    m_publisher(publisher),\n    ui(new Ui::S60PublishingResultsPageOvi)\n{\n    ui->setupUi(this);\n    connect(m_publisher, SIGNAL(progressReport(QString,QColor)), SLOT(updateResultsPage(QString,QColor)));\n}\n\nS60PublishingResultsPageOvi::~S60PublishingResultsPageOvi()\n{\n    delete ui;\n}\n\nvoid S60PublishingResultsPageOvi::initializePage()\n{\n    wizard()->setButtonText(QWizard::FinishButton, tr(\"Open Containing Folder\"));\n    connect(m_publisher, SIGNAL(succeeded()), SIGNAL(completeChanged()));\n    connect(wizard()->button(QWizard::FinishButton), SIGNAL(clicked()), SLOT(openFileLocation()));\n    m_publisher->buildSis();\n}\n\nbool S60PublishingResultsPageOvi::isComplete() const\n{\n    return m_publisher->hasSucceeded();\n}\n\nvoid S60PublishingResultsPageOvi::updateResultsPage(const QString& status, QColor c)\n{\n    QTextCursor cur(ui->resultsTextBrowser->document());\n    QTextCharFormat tcf = cur.charFormat();\n    tcf.setForeground(c);\n    cur.movePosition(QTextCursor::End);\n    cur.insertText(status, tcf);\n}\n\nvoid S60PublishingResultsPageOvi::openFileLocation()\n{\n#ifdef Q_OS_WIN\n    QProcess::startDetached(\"explorer \/select,\"+ m_publisher->createdSisFilePath());\n#else\n    QDesktopServices::openUrl(QUrl(\"file:\/\/\/\" + m_publisher->createdSisFileContainingFolder()));\n#endif\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace Qt4ProjectManager\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*\n * This file is part of the LibreOffice project.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\n * This file incorporates work covered by the following license notice:\n *\n *   Licensed to the Apache Software Foundation (ASF) under one or more\n *   contributor license agreements. See the NOTICE file distributed\n *   with this work for additional information regarding copyright\n *   ownership. The ASF licenses this file to you under the Apache\n *   License, Version 2.0 (the \"License\"); you may not use this file\n *   except in compliance with the License. You may obtain a copy of\n *   the License at http:\/\/www.apache.org\/licenses\/LICENSE-2.0 .\n *\/\n\n#ifndef INCLUDED_SUB_SEQUENCE_HXX\n#define INCLUDED_SUB_SEQUENCE_HXX\n\n#include <com\/sun\/star\/uno\/Sequence.hxx>\n\n#include <boost\/shared_ptr.hpp>\n#include <iostream>\n#include <stdio.h>\n#include <ctype.h>\n#include \"exceptions.hxx\"\n#include <WriterFilterDllApi.hxx>\n\nnamespace writerfilter {\nusing namespace ::std;\n\ntemplate <class T>\nclass SubSequence;\n\ntemplate <class T>\nclass SubSequence\n{\n    typedef boost::shared_ptr<com::sun::star::uno::Sequence<T> >\n    SequencePointer;\n\n    SequencePointer mpSequence;\n    sal_uInt32 mnOffset;\n    sal_uInt32 mnCount;\n\npublic:\n    typedef boost::shared_ptr<SubSequence> Pointer_t;\n\n    SubSequence() : mpSequence(new ::com::sun::star::uno::Sequence<T>()),\n                    mnOffset(0), mnCount(0)\n    {\n    }\n\n    SubSequence(SequencePointer pSequence, sal_uInt32 nOffset_,\n                sal_uInt32 nCount_)\n        : mpSequence(pSequence), mnOffset(nOffset_), mnCount(nCount_)\n    {\n    }\n\n    SubSequence(SequencePointer pSequence)\n        : mpSequence(pSequence), mnOffset(0), mnCount(pSequence->getLength())\n    {\n    }\n\n    SubSequence(const SubSequence & rSubSequence, sal_uInt32 nOffset_,\n                sal_uInt32 nCount_)\n        : mpSequence(rSubSequence.mpSequence),\n          mnOffset(rSubSequence.mnOffset + nOffset_),\n          mnCount(nCount_)\n    {\n    }\n\n    SubSequence(const T * pStart, sal_uInt32 nCount_)\n        : mpSequence(new com::sun::star::uno::Sequence<T>(pStart, nCount_)),\n          mnOffset(0), mnCount(nCount_)\n    {\n    }\n\n    SubSequence(sal_Int32 nCount_)\n        : mpSequence(new com::sun::star::uno::Sequence<T>(nCount_)), mnOffset(0),\n          mnCount(nCount_)\n    {\n    }\n\n    ::com::sun::star::uno::Sequence<T> & getSequence()\n    {\n        return *mpSequence;\n    }\n\n    const ::com::sun::star::uno::Sequence<T> & getSequence() const\n    {\n        return *mpSequence;\n    }\n\n    void reset() {\n        mnOffset = 0;\n        mnCount = mpSequence->getLength();\n    }\n\n    sal_uInt32 getOffset() const { return mnOffset; }\n    sal_uInt32 getCount() const { return mnCount; }\n\n    const T & operator[] (sal_uInt32 nIndex) const\n    {\n        if (mnOffset + nIndex >=\n            sal::static_int_cast<sal_uInt32>(mpSequence->getLength()))\n            throw ExceptionOutOfBounds(\"SubSequence::operator[]\");\n\n        return (*mpSequence)[mnOffset + nIndex];\n    }\n\n    void dump(ostream & o) const\n    {\n        {\n            char sBuffer[256];\n\n            snprintf(sBuffer, sizeof(sBuffer),\n                     \"<sequence id='%p' offset='%lx' count='%lx'>\",\n                     mpSequence.get(), mnOffset, mnCount);\n            o << sBuffer << endl;\n        }\n\n        sal_uInt32 n = 0;\n        sal_uInt32 nStep = 16;\n\n        while (n < getCount())\n        {\n            char sBuffer[256];\n\n            o << \"<line>\";\n\n            snprintf(sBuffer, 255, \"%08lx: \", static_cast<unsigned long>(n));\n\n            o << sBuffer;\n\n            for (sal_uInt32 i = 0; i < nStep; i++)\n            {\n                if (n + i < getCount())\n                {\n                    snprintf(sBuffer, 255, \"%02x \", operator[](n + i));\n                    o << sBuffer;\n                }\n                else\n                    o << \"   \";\n\n                if (i % 8 == 7)\n                    o << \" \";\n            }\n\n            {\n                for (sal_uInt32 i = 0; i < nStep; i++)\n                {\n                    if (n + i < getCount())\n                    {\n                        unsigned char c =\n                            static_cast<unsigned char>(operator[](n + i));\n\n                        if (c=='&')\n                            o << \"&amp;\";\n                        else if (c=='<')\n                            o << \"&lt;\";\n                        else if (c=='>')\n                            o << \"&gt;\";\n                        else if (c < 128 && isprint(c))\n                            o << c;\n                        else\n                            o << \".\";\n                    }\n\n                }\n            }\n\n            o << \"<\/line>\" << endl;\n\n            n += nStep;\n        }\n\n        o << \"<\/sequence>\" << endl;\n    }\n\n    string toString() const\n    {\n        sal_uInt32 n = 0;\n        sal_uInt32 nStep = 16;\n\n        string sResult;\n\n        while (n < getCount())\n        {\n            char sBuffer[256];\n\n            snprintf(sBuffer, 255, \"<line>%08\" SAL_PRIxUINT32 \": \", n);\n\n            sResult += sBuffer;\n\n            for (sal_uInt32 i = 0; i < nStep; i++)\n            {\n                if (n + i < getCount())\n                {\n                    snprintf(sBuffer, 255, \"%02x \", operator[](n + i));\n                    sResult += sBuffer;\n                }\n                else\n                    sResult += \"   \";\n\n                if (i % 8 == 7)\n                    sResult += \" \";\n            }\n\n            {\n                for (sal_uInt32 i = 0; i < nStep; i++)\n                {\n                    if (n + i < getCount())\n                    {\n                        unsigned char c =\n                            static_cast<unsigned char>(operator[](n + i));\n\n                        if (c=='&')\n                            sResult += \"&amp;\";\n                        else if (c=='<')\n                            sResult += \"&lt;\";\n                        else if (c=='>')\n                            sResult += \"&gt;\";\n                        else if (c < 128 && isprint(c))\n                            sResult += c;\n                        else\n                            sResult += \".\";\n                    }\n                }\n            }\n\n            sResult += \"<\/line>\\n\";\n\n            n += nStep;\n        }\n\n        return sResult;\n    }\n};\n\n}\n\n#endif \/\/ INCLUDED_SUB_SEQUENCE_HXX\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>writerfilter: unused SubSequence class<commit_after><|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 \"RocksDBTransactionState.h\"\n#include \"Aql\/QueryCache.h\"\n#include \"Basics\/Exceptions.h\"\n#include \"Cache\/CacheManagerFeature.h\"\n#include \"Cache\/Manager.h\"\n#include \"Cache\/Transaction.h\"\n#include \"Logger\/Logger.h\"\n#include \"RestServer\/TransactionManagerFeature.h\"\n#include \"RocksDBEngine\/RocksDBCollection.h\"\n#include \"RocksDBEngine\/RocksDBCommon.h\"\n#include \"RocksDBEngine\/RocksDBCounterManager.h\"\n#include \"RocksDBEngine\/RocksDBEngine.h\"\n#include \"RocksDBEngine\/RocksDBLogValue.h\"\n#include \"RocksDBEngine\/RocksDBTransactionCollection.h\"\n#include \"StorageEngine\/EngineSelectorFeature.h\"\n#include \"StorageEngine\/StorageEngine.h\"\n#include \"StorageEngine\/TransactionCollection.h\"\n#include \"StorageEngine\/TransactionManager.h\"\n#include \"Transaction\/Methods.h\"\n#include \"VocBase\/LogicalCollection.h\"\n#include \"VocBase\/modes.h\"\n#include \"VocBase\/ticks.h\"\n\n#include <rocksdb\/db.h>\n#include <rocksdb\/options.h>\n#include <rocksdb\/status.h>\n#include <rocksdb\/utilities\/optimistic_transaction_db.h>\n#include <rocksdb\/utilities\/transaction.h>\n#include <rocksdb\/utilities\/write_batch_with_index.h>\n\nusing namespace arangodb;\n\n\/\/ for the RocksDB engine we do not need any additional data\nstruct RocksDBTransactionData final : public TransactionData {};\n\nRocksDBSavePoint::RocksDBSavePoint(\n    rocksdb::Transaction* trx, bool handled,\n    std::function<void()> const& rollbackCallback)\n    : _trx(trx), _rollbackCallback(rollbackCallback), _handled(handled) {\n  TRI_ASSERT(trx != nullptr);\n  if (!_handled) {\n    _trx->SetSavePoint();\n  }\n}\n\nRocksDBSavePoint::~RocksDBSavePoint() {\n  if (!_handled) {\n    rollback();\n  }\n}\n\nvoid RocksDBSavePoint::commit() {\n  \/\/ note: _handled may already be true here\n  _handled = true;  \/\/ this will prevent the rollback\n}\n\nvoid RocksDBSavePoint::rollback() {\n  TRI_ASSERT(!_handled);\n  _trx->RollbackToSavePoint();\n  _handled = true;  \/\/ in order to not roll back again by accident\n  _rollbackCallback();\n}\n\n\/\/\/ @brief transaction type\nRocksDBTransactionState::RocksDBTransactionState(\n    TRI_vocbase_t* vocbase, uint64_t maxTransSize,\n    bool intermediateTransactionEnabled, uint64_t intermediateTransactionSize,\n    uint64_t intermediateTransactionNumber)\n    : TransactionState(vocbase),\n      _rocksReadOptions(),\n      _cacheTx(nullptr),\n      _transactionSize(0),\n      _maxTransactionSize(maxTransSize),\n      _intermediateTransactionSize(intermediateTransactionSize),\n      _intermediateTransactionNumber(intermediateTransactionNumber),\n      _numInserts(0),\n      _numUpdates(0),\n      _numRemoves(0),\n      _intermediateTransactionEnabled(intermediateTransactionEnabled),\n      _lastUsedCollection(0) {}\n\n\/\/\/ @brief free a transaction container\nRocksDBTransactionState::~RocksDBTransactionState() {\n  if (_cacheTx != nullptr) {\n    \/\/ note: endTransaction() will delete _cacheTrx!\n    CacheManagerFeature::MANAGER->endTransaction(_cacheTx);\n    _cacheTx = nullptr;\n  }\n}\n\n\/\/\/ @brief start a transaction\nResult RocksDBTransactionState::beginTransaction(transaction::Hints hints) {\n  LOG_TRX(this, _nestingLevel)\n      << \"beginning \" << AccessMode::typeString(_type) << \" transaction\";\n\n  if (_nestingLevel == 0) {\n    \/\/ set hints\n    _hints = hints;\n  }\n\n  Result result = useCollections(_nestingLevel);\n\n  if (result.ok()) {\n    \/\/ all valid\n    if (_nestingLevel == 0) {\n      updateStatus(transaction::Status::RUNNING);\n    }\n  } else {\n    \/\/ something is wrong\n    if (_nestingLevel == 0) {\n      updateStatus(transaction::Status::ABORTED);\n    }\n\n    \/\/ free what we have got so far\n    unuseCollections(_nestingLevel);\n\n    return result;\n  }\n\n  if (_nestingLevel == 0) {\n    \/\/ get a new id\n    _id = TRI_NewTickServer();\n\n    \/\/ register a protector\n    auto data =\n        std::make_unique<RocksDBTransactionData>();  \/\/ intentionally empty\n    TransactionManagerFeature::manager()->registerTransaction(_id,\n                                                              std::move(data));\n\n    TRI_ASSERT(_rocksTransaction == nullptr);\n    TRI_ASSERT(_cacheTx == nullptr);\n\n    \/\/ start cache transaction\n    _cacheTx =\n        CacheManagerFeature::MANAGER->beginTransaction(isReadOnlyTransaction());\n\n    \/\/ start rocks transaction\n    StorageEngine* engine = EngineSelectorFeature::ENGINE;\n    rocksdb::TransactionDB* db = static_cast<RocksDBEngine*>(engine)->db();\n    _rocksTransaction.reset(db->BeginTransaction(\n        _rocksWriteOptions, rocksdb::TransactionOptions()));\n    _rocksTransaction->SetSnapshot();\n    _rocksReadOptions.snapshot = _rocksTransaction->GetSnapshot();\n    _rocksReadOptions.prefix_same_as_start = true;\n\n    if (!isReadOnlyTransaction() &&\n        !hasHint(transaction::Hints::Hint::SINGLE_OPERATION)) {\n      RocksDBLogValue header =\n          RocksDBLogValue::BeginTransaction(_vocbase->id(), _id);\n      _rocksTransaction->PutLogData(header.slice());\n      TRI_ASSERT(++_numLogdata);\n    }\n  } else {\n    TRI_ASSERT(_status == transaction::Status::RUNNING);\n  }\n\n  return result;\n}\n\n\/\/\/ @brief commit a transaction\nResult RocksDBTransactionState::commitTransaction(\n    transaction::Methods* activeTrx) {\n  LOG_TRX(this, _nestingLevel)\n      << \"committing \" << AccessMode::typeString(_type) << \" transaction\";\n\n  TRI_ASSERT(_status == transaction::Status::RUNNING);\n  TRI_IF_FAILURE(\"TransactionWriteCommitMarker\") {\n    return Result(TRI_ERROR_DEBUG);\n  }\n\n  arangodb::Result result;\n\n  if (_nestingLevel == 0) {\n    if (_rocksTransaction != nullptr) {\n      \/\/ if (hasOperations()) {\n      if (_rocksTransaction->GetNumKeys() > 0) {\n        \/\/ set wait for sync flag if required\n        if (waitForSync()) {\n          _rocksWriteOptions.sync = true;\n          _rocksTransaction->SetWriteOptions(_rocksWriteOptions);\n        }\n\n        \/\/ TODO wait for response on github issue to see how we can use the\n        \/\/ sequence number\n        \/\/ double t1 = TRI_microtime();\n        result = rocksutils::convertStatus(_rocksTransaction->Commit());\n\n        \/\/ double t2 = TRI_microtime();\n        \/\/ if (t2 - t1 > 0.25) {\n        \/\/   LOG_TOPIC(ERR, Logger::FIXME)\n        \/\/       << \"COMMIT TOOK: \" << (t2 - t1)\n        \/\/       << \" S. NUMINSERTS: \" << _numInserts\n        \/\/       << \", NUMUPDATES: \" << _numUpdates\n        \/\/       << \", NUMREMOVES: \" << _numRemoves\n        \/\/       << \", TRANSACTIONSIZE: \" << _transactionSize;\n        \/\/ }\n        rocksdb::SequenceNumber latestSeq =\n            rocksutils::globalRocksDB()->GetLatestSequenceNumber();\n        if (!result.ok()) {\n          abortTransaction(activeTrx);\n          return result;\n        }\n\n        if (_cacheTx != nullptr) {\n          \/\/ note: endTransaction() will delete _cacheTx!\n          CacheManagerFeature::MANAGER->endTransaction(_cacheTx);\n          _cacheTx = nullptr;\n        }\n\n        for (auto& trxCollection : _collections) {\n          RocksDBTransactionCollection* collection =\n              static_cast<RocksDBTransactionCollection*>(trxCollection);\n          int64_t adjustment =\n              collection->numInserts() - collection->numRemoves();\n\n          if (collection->numInserts() != 0 || collection->numRemoves() != 0 ||\n              collection->revision() != 0) {\n            RocksDBCollection* coll = static_cast<RocksDBCollection*>(\n                trxCollection->collection()->getPhysical());\n            coll->adjustNumberDocuments(adjustment);\n            coll->setRevision(collection->revision());\n            RocksDBEngine* engine =\n                static_cast<RocksDBEngine*>(EngineSelectorFeature::ENGINE);\n\n            RocksDBCounterManager::CounterAdjustment update(\n                latestSeq, collection->numInserts(), collection->numRemoves(),\n                collection->revision());\n            engine->counterManager()->updateCounter(coll->objectId(), update);\n          }\n        }\n      } else {\n        \/\/ don't write anything if the transaction is empty\n        result = rocksutils::convertStatus(_rocksTransaction->Rollback());\n\n        if (_cacheTx != nullptr) {\n          \/\/ note: endTransaction() will delete _cacheTx!\n          CacheManagerFeature::MANAGER->endTransaction(_cacheTx);\n          _cacheTx = nullptr;\n        }\n      }\n\n      _rocksTransaction.reset();\n    }\n\n    updateStatus(transaction::Status::COMMITTED);\n  }\n\n  unuseCollections(_nestingLevel);\n\n  return result;\n}\n\n\/\/\/ @brief abort and rollback a transaction\nResult RocksDBTransactionState::abortTransaction(\n    transaction::Methods* activeTrx) {\n  LOG_TRX(this, _nestingLevel)\n      << \"aborting \" << AccessMode::typeString(_type) << \" transaction\";\n  TRI_ASSERT(_status == transaction::Status::RUNNING);\n  Result result;\n\n  if (_nestingLevel == 0) {\n    if (_rocksTransaction != nullptr) {\n      rocksdb::Status status = _rocksTransaction->Rollback();\n      result = rocksutils::convertStatus(status);\n\n      if (_cacheTx != nullptr) {\n        \/\/ note: endTransaction() will delete _cacheTx!\n        CacheManagerFeature::MANAGER->endTransaction(_cacheTx);\n        _cacheTx = nullptr;\n      }\n\n      _rocksTransaction.reset();\n    }\n\n    updateStatus(transaction::Status::ABORTED);\n\n    if (hasOperations()) {\n      \/\/ must clean up the query cache because the transaction\n      \/\/ may have queried something via AQL that is now rolled back\n      clearQueryCache();\n    }\n  }\n\n  unuseCollections(_nestingLevel);\n\n  return result;\n}\n\nvoid RocksDBTransactionState::prepareOperation(\n    TRI_voc_cid_t collectionId, TRI_voc_rid_t revisionId, StringRef const& key,\n    TRI_voc_document_operation_e operationType) {\n  TRI_ASSERT(!isReadOnlyTransaction());\n\n  bool singleOp = hasHint(transaction::Hints::Hint::SINGLE_OPERATION);\n  if (collectionId != _lastUsedCollection) {\n    \/\/ single operations should never call this method twice\n    \/\/ singleOp => lastUsedColl == 0\n    TRI_ASSERT(!singleOp || _lastUsedCollection == 0);\n    _lastUsedCollection = collectionId;\n\n    if (!singleOp) {\n      if (operationType != TRI_VOC_DOCUMENT_OPERATION_UNKNOWN) {\n        RocksDBLogValue logValue =\n        RocksDBLogValue::DocumentOpsPrologue(collectionId);\n        _rocksTransaction->PutLogData(logValue.slice());\n        TRI_ASSERT(++_numLogdata);\n      }\n    } else {\n      \/\/ singleOp => no modifications yet\n      TRI_ASSERT(!singleOp ||\n                 _rocksTransaction->GetNumPuts() == 0 &&\n                 _rocksTransaction->GetNumDeletes() == 0);\n      TRI_ASSERT(_numLogdata == 0);\n      \n      switch (operationType) {\n        case TRI_VOC_DOCUMENT_OPERATION_INSERT:\n        case TRI_VOC_DOCUMENT_OPERATION_UPDATE:\n        case TRI_VOC_DOCUMENT_OPERATION_REPLACE: {\n          RocksDBLogValue logValue =\n          RocksDBLogValue::SinglePut(_vocbase->id(), collectionId);\n          _rocksTransaction->PutLogData(logValue.slice());\n          TRI_ASSERT(++_numLogdata);\n          break;\n        }\n        case TRI_VOC_DOCUMENT_OPERATION_REMOVE: {\n          TRI_ASSERT(!key.empty());\n          RocksDBLogValue logValue =\n          RocksDBLogValue::SingleRemove(_vocbase->id(), collectionId, key);\n          _rocksTransaction->PutLogData(logValue.slice());\n          TRI_ASSERT(++_numLogdata);\n        } break;\n        case TRI_VOC_DOCUMENT_OPERATION_UNKNOWN:\n          break;\n      }\n    }\n  }\n  \/\/ we need to log the remove log entry, if we don't have the single\n  \/\/ optimization\n  if (!singleOp && operationType == TRI_VOC_DOCUMENT_OPERATION_REMOVE) {\n    RocksDBLogValue logValue = RocksDBLogValue::DocumentRemove(key);\n    _rocksTransaction->PutLogData(logValue.slice());\n    TRI_ASSERT(++_numLogdata);\n  }\n}\n\n\/\/\/ @brief add an operation for a transaction collection\nRocksDBOperationResult RocksDBTransactionState::addOperation(\n    TRI_voc_cid_t cid, TRI_voc_rid_t revisionId,\n    TRI_voc_document_operation_e operationType, uint64_t operationSize,\n    uint64_t keySize) {\n  RocksDBOperationResult res;\n\n  uint64_t newSize = _transactionSize + operationSize + keySize;\n  if (_maxTransactionSize < newSize) {\n    \/\/ we hit the transaction size limit\n    std::string message =\n        \"aborting transaction because maximal transaction size limit of \" +\n        std::to_string(_maxTransactionSize) + \" bytes is reached\";\n    res.reset(TRI_ERROR_RESOURCE_LIMIT, message);\n    return res;\n  }\n\n  auto collection =\n      static_cast<RocksDBTransactionCollection*>(findCollection(cid));\n\n  if (collection == nullptr) {\n    std::string message = \"collection '\" + std::to_string(cid) +\n                          \"' not found in transaction state\";\n    THROW_ARANGO_EXCEPTION_MESSAGE(TRI_ERROR_INTERNAL, message);\n  }\n\n  \/\/ should not fail or fail with exception\n  collection->addOperation(operationType, operationSize, revisionId);\n\n  \/\/ clear the query cache for this collection\n  if (arangodb::aql::QueryCache::instance()->mayBeActive()) {\n    arangodb::aql::QueryCache::instance()->invalidate(\n        _vocbase, collection->collectionName());\n  }\n\n  switch (operationType) {\n    case TRI_VOC_DOCUMENT_OPERATION_UNKNOWN:\n      break;\n    case TRI_VOC_DOCUMENT_OPERATION_INSERT:\n      ++_numInserts;\n      break;\n    case TRI_VOC_DOCUMENT_OPERATION_UPDATE:\n    case TRI_VOC_DOCUMENT_OPERATION_REPLACE:\n      ++_numUpdates;\n      break;\n    case TRI_VOC_DOCUMENT_OPERATION_REMOVE:\n      ++_numRemoves;\n      break;\n  }\n\n  _transactionSize = newSize;\n  auto numOperations = _numInserts + _numUpdates + _numRemoves;\n\n  \/\/ signal if intermediate commit is required\n  \/\/ this will be done if intermediate transactions are enabled\n  \/\/ and either the \"number of operations\" or the \"transaction size\"\n  \/\/ has reached the limit\n  if (_intermediateTransactionEnabled &&\n      (_intermediateTransactionNumber <= numOperations ||\n       _intermediateTransactionSize <= newSize)) {\n    res.commitRequired(true);\n  }\n\n  return res;\n}\n\nuint64_t RocksDBTransactionState::sequenceNumber() const {\n  return static_cast<uint64_t>(\n      _rocksTransaction->GetSnapshot()->GetSequenceNumber());\n}\n\n\/*\nclass RocksDBBatchTrx : public RocksDBBatch {\n  arangodb::Result Get(RocksDBKey const&, std::string*) override {\n    \n  }\n  \n  arangodb::Result Put(RocksDBKey const&, rocksdb::Slice const&) override {\n    \n  }\n  arangodb::Result Delete(RocksDBKey const&) override ;\n};*\/\n<commit_msg>use maintainer guard<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 \"RocksDBTransactionState.h\"\n#include \"Aql\/QueryCache.h\"\n#include \"Basics\/Exceptions.h\"\n#include \"Cache\/CacheManagerFeature.h\"\n#include \"Cache\/Manager.h\"\n#include \"Cache\/Transaction.h\"\n#include \"Logger\/Logger.h\"\n#include \"RestServer\/TransactionManagerFeature.h\"\n#include \"RocksDBEngine\/RocksDBCollection.h\"\n#include \"RocksDBEngine\/RocksDBCommon.h\"\n#include \"RocksDBEngine\/RocksDBCounterManager.h\"\n#include \"RocksDBEngine\/RocksDBEngine.h\"\n#include \"RocksDBEngine\/RocksDBLogValue.h\"\n#include \"RocksDBEngine\/RocksDBTransactionCollection.h\"\n#include \"StorageEngine\/EngineSelectorFeature.h\"\n#include \"StorageEngine\/StorageEngine.h\"\n#include \"StorageEngine\/TransactionCollection.h\"\n#include \"StorageEngine\/TransactionManager.h\"\n#include \"Transaction\/Methods.h\"\n#include \"VocBase\/LogicalCollection.h\"\n#include \"VocBase\/modes.h\"\n#include \"VocBase\/ticks.h\"\n\n#include <rocksdb\/db.h>\n#include <rocksdb\/options.h>\n#include <rocksdb\/status.h>\n#include <rocksdb\/utilities\/optimistic_transaction_db.h>\n#include <rocksdb\/utilities\/transaction.h>\n#include <rocksdb\/utilities\/write_batch_with_index.h>\n\nusing namespace arangodb;\n\n\/\/ for the RocksDB engine we do not need any additional data\nstruct RocksDBTransactionData final : public TransactionData {};\n\nRocksDBSavePoint::RocksDBSavePoint(\n    rocksdb::Transaction* trx, bool handled,\n    std::function<void()> const& rollbackCallback)\n    : _trx(trx), _rollbackCallback(rollbackCallback), _handled(handled) {\n  TRI_ASSERT(trx != nullptr);\n  if (!_handled) {\n    _trx->SetSavePoint();\n  }\n}\n\nRocksDBSavePoint::~RocksDBSavePoint() {\n  if (!_handled) {\n    rollback();\n  }\n}\n\nvoid RocksDBSavePoint::commit() {\n  \/\/ note: _handled may already be true here\n  _handled = true;  \/\/ this will prevent the rollback\n}\n\nvoid RocksDBSavePoint::rollback() {\n  TRI_ASSERT(!_handled);\n  _trx->RollbackToSavePoint();\n  _handled = true;  \/\/ in order to not roll back again by accident\n  _rollbackCallback();\n}\n\n\/\/\/ @brief transaction type\nRocksDBTransactionState::RocksDBTransactionState(\n    TRI_vocbase_t* vocbase, uint64_t maxTransSize,\n    bool intermediateTransactionEnabled, uint64_t intermediateTransactionSize,\n    uint64_t intermediateTransactionNumber)\n    : TransactionState(vocbase),\n      _rocksReadOptions(),\n      _cacheTx(nullptr),\n      _transactionSize(0),\n      _maxTransactionSize(maxTransSize),\n      _intermediateTransactionSize(intermediateTransactionSize),\n      _intermediateTransactionNumber(intermediateTransactionNumber),\n      _numInserts(0),\n      _numUpdates(0),\n      _numRemoves(0),\n      _intermediateTransactionEnabled(intermediateTransactionEnabled),\n      _lastUsedCollection(0) {}\n\n\/\/\/ @brief free a transaction container\nRocksDBTransactionState::~RocksDBTransactionState() {\n  if (_cacheTx != nullptr) {\n    \/\/ note: endTransaction() will delete _cacheTrx!\n    CacheManagerFeature::MANAGER->endTransaction(_cacheTx);\n    _cacheTx = nullptr;\n  }\n}\n\n\/\/\/ @brief start a transaction\nResult RocksDBTransactionState::beginTransaction(transaction::Hints hints) {\n  LOG_TRX(this, _nestingLevel)\n      << \"beginning \" << AccessMode::typeString(_type) << \" transaction\";\n\n  if (_nestingLevel == 0) {\n    \/\/ set hints\n    _hints = hints;\n  }\n\n  Result result = useCollections(_nestingLevel);\n\n  if (result.ok()) {\n    \/\/ all valid\n    if (_nestingLevel == 0) {\n      updateStatus(transaction::Status::RUNNING);\n    }\n  } else {\n    \/\/ something is wrong\n    if (_nestingLevel == 0) {\n      updateStatus(transaction::Status::ABORTED);\n    }\n\n    \/\/ free what we have got so far\n    unuseCollections(_nestingLevel);\n\n    return result;\n  }\n\n  if (_nestingLevel == 0) {\n    \/\/ get a new id\n    _id = TRI_NewTickServer();\n\n    \/\/ register a protector\n    auto data =\n        std::make_unique<RocksDBTransactionData>();  \/\/ intentionally empty\n    TransactionManagerFeature::manager()->registerTransaction(_id,\n                                                              std::move(data));\n\n    TRI_ASSERT(_rocksTransaction == nullptr);\n    TRI_ASSERT(_cacheTx == nullptr);\n\n    \/\/ start cache transaction\n    _cacheTx =\n        CacheManagerFeature::MANAGER->beginTransaction(isReadOnlyTransaction());\n\n    \/\/ start rocks transaction\n    StorageEngine* engine = EngineSelectorFeature::ENGINE;\n    rocksdb::TransactionDB* db = static_cast<RocksDBEngine*>(engine)->db();\n    _rocksTransaction.reset(db->BeginTransaction(\n        _rocksWriteOptions, rocksdb::TransactionOptions()));\n    _rocksTransaction->SetSnapshot();\n    _rocksReadOptions.snapshot = _rocksTransaction->GetSnapshot();\n    _rocksReadOptions.prefix_same_as_start = true;\n\n    if (!isReadOnlyTransaction() &&\n        !hasHint(transaction::Hints::Hint::SINGLE_OPERATION)) {\n      RocksDBLogValue header =\n          RocksDBLogValue::BeginTransaction(_vocbase->id(), _id);\n      _rocksTransaction->PutLogData(header.slice());\n#ifdef ARANGODB_ENABLE_MAINTAINER_MODE\n      TRI_ASSERT(++_numLogdata);\n#endif\n    }\n  } else {\n    TRI_ASSERT(_status == transaction::Status::RUNNING);\n  }\n\n  return result;\n}\n\n\/\/\/ @brief commit a transaction\nResult RocksDBTransactionState::commitTransaction(\n    transaction::Methods* activeTrx) {\n  LOG_TRX(this, _nestingLevel)\n      << \"committing \" << AccessMode::typeString(_type) << \" transaction\";\n\n  TRI_ASSERT(_status == transaction::Status::RUNNING);\n  TRI_IF_FAILURE(\"TransactionWriteCommitMarker\") {\n    return Result(TRI_ERROR_DEBUG);\n  }\n\n  arangodb::Result result;\n\n  if (_nestingLevel == 0) {\n    if (_rocksTransaction != nullptr) {\n      \/\/ if (hasOperations()) {\n      if (_rocksTransaction->GetNumKeys() > 0) {\n        \/\/ set wait for sync flag if required\n        if (waitForSync()) {\n          _rocksWriteOptions.sync = true;\n          _rocksTransaction->SetWriteOptions(_rocksWriteOptions);\n        }\n\n        \/\/ TODO wait for response on github issue to see how we can use the\n        \/\/ sequence number\n        \/\/ double t1 = TRI_microtime();\n        result = rocksutils::convertStatus(_rocksTransaction->Commit());\n\n        \/\/ double t2 = TRI_microtime();\n        \/\/ if (t2 - t1 > 0.25) {\n        \/\/   LOG_TOPIC(ERR, Logger::FIXME)\n        \/\/       << \"COMMIT TOOK: \" << (t2 - t1)\n        \/\/       << \" S. NUMINSERTS: \" << _numInserts\n        \/\/       << \", NUMUPDATES: \" << _numUpdates\n        \/\/       << \", NUMREMOVES: \" << _numRemoves\n        \/\/       << \", TRANSACTIONSIZE: \" << _transactionSize;\n        \/\/ }\n        rocksdb::SequenceNumber latestSeq =\n            rocksutils::globalRocksDB()->GetLatestSequenceNumber();\n        if (!result.ok()) {\n          abortTransaction(activeTrx);\n          return result;\n        }\n\n        if (_cacheTx != nullptr) {\n          \/\/ note: endTransaction() will delete _cacheTx!\n          CacheManagerFeature::MANAGER->endTransaction(_cacheTx);\n          _cacheTx = nullptr;\n        }\n\n        for (auto& trxCollection : _collections) {\n          RocksDBTransactionCollection* collection =\n              static_cast<RocksDBTransactionCollection*>(trxCollection);\n          int64_t adjustment =\n              collection->numInserts() - collection->numRemoves();\n\n          if (collection->numInserts() != 0 || collection->numRemoves() != 0 ||\n              collection->revision() != 0) {\n            RocksDBCollection* coll = static_cast<RocksDBCollection*>(\n                trxCollection->collection()->getPhysical());\n            coll->adjustNumberDocuments(adjustment);\n            coll->setRevision(collection->revision());\n            RocksDBEngine* engine =\n                static_cast<RocksDBEngine*>(EngineSelectorFeature::ENGINE);\n\n            RocksDBCounterManager::CounterAdjustment update(\n                latestSeq, collection->numInserts(), collection->numRemoves(),\n                collection->revision());\n            engine->counterManager()->updateCounter(coll->objectId(), update);\n          }\n        }\n      } else {\n        \/\/ don't write anything if the transaction is empty\n        result = rocksutils::convertStatus(_rocksTransaction->Rollback());\n\n        if (_cacheTx != nullptr) {\n          \/\/ note: endTransaction() will delete _cacheTx!\n          CacheManagerFeature::MANAGER->endTransaction(_cacheTx);\n          _cacheTx = nullptr;\n        }\n      }\n\n      _rocksTransaction.reset();\n    }\n\n    updateStatus(transaction::Status::COMMITTED);\n  }\n\n  unuseCollections(_nestingLevel);\n\n  return result;\n}\n\n\/\/\/ @brief abort and rollback a transaction\nResult RocksDBTransactionState::abortTransaction(\n    transaction::Methods* activeTrx) {\n  LOG_TRX(this, _nestingLevel)\n      << \"aborting \" << AccessMode::typeString(_type) << \" transaction\";\n  TRI_ASSERT(_status == transaction::Status::RUNNING);\n  Result result;\n\n  if (_nestingLevel == 0) {\n    if (_rocksTransaction != nullptr) {\n      rocksdb::Status status = _rocksTransaction->Rollback();\n      result = rocksutils::convertStatus(status);\n\n      if (_cacheTx != nullptr) {\n        \/\/ note: endTransaction() will delete _cacheTx!\n        CacheManagerFeature::MANAGER->endTransaction(_cacheTx);\n        _cacheTx = nullptr;\n      }\n\n      _rocksTransaction.reset();\n    }\n\n    updateStatus(transaction::Status::ABORTED);\n\n    if (hasOperations()) {\n      \/\/ must clean up the query cache because the transaction\n      \/\/ may have queried something via AQL that is now rolled back\n      clearQueryCache();\n    }\n  }\n\n  unuseCollections(_nestingLevel);\n\n  return result;\n}\n\nvoid RocksDBTransactionState::prepareOperation(\n    TRI_voc_cid_t collectionId, TRI_voc_rid_t revisionId, StringRef const& key,\n    TRI_voc_document_operation_e operationType) {\n  TRI_ASSERT(!isReadOnlyTransaction());\n\n  bool singleOp = hasHint(transaction::Hints::Hint::SINGLE_OPERATION);\n  if (collectionId != _lastUsedCollection) {\n    \/\/ single operations should never call this method twice\n    \/\/ singleOp => lastUsedColl == 0\n    TRI_ASSERT(!singleOp || _lastUsedCollection == 0);\n    _lastUsedCollection = collectionId;\n\n    if (!singleOp) {\n      if (operationType != TRI_VOC_DOCUMENT_OPERATION_UNKNOWN) {\n        RocksDBLogValue logValue =\n        RocksDBLogValue::DocumentOpsPrologue(collectionId);\n        _rocksTransaction->PutLogData(logValue.slice());\n#ifdef ARANGODB_ENABLE_MAINTAINER_MODE\n        TRI_ASSERT(++_numLogdata);\n#endif\n      }\n    } else {\n      \/\/ singleOp => no modifications yet\n      TRI_ASSERT(!singleOp ||\n                 _rocksTransaction->GetNumPuts() == 0 &&\n                 _rocksTransaction->GetNumDeletes() == 0);\n#ifdef ARANGODB_ENABLE_MAINTAINER_MODE\n      TRI_ASSERT(_numLogdata == 0);\n#endif\n      \n      switch (operationType) {\n        case TRI_VOC_DOCUMENT_OPERATION_INSERT:\n        case TRI_VOC_DOCUMENT_OPERATION_UPDATE:\n        case TRI_VOC_DOCUMENT_OPERATION_REPLACE: {\n          RocksDBLogValue logValue =\n          RocksDBLogValue::SinglePut(_vocbase->id(), collectionId);\n          _rocksTransaction->PutLogData(logValue.slice());\n#ifdef ARANGODB_ENABLE_MAINTAINER_MODE\n          TRI_ASSERT(++_numLogdata);\n#endif\n          break;\n        }\n        case TRI_VOC_DOCUMENT_OPERATION_REMOVE: {\n          TRI_ASSERT(!key.empty());\n          RocksDBLogValue logValue =\n          RocksDBLogValue::SingleRemove(_vocbase->id(), collectionId, key);\n          _rocksTransaction->PutLogData(logValue.slice());\n#ifdef ARANGODB_ENABLE_MAINTAINER_MODE\n          TRI_ASSERT(++_numLogdata);\n#endif\n        } break;\n        case TRI_VOC_DOCUMENT_OPERATION_UNKNOWN:\n          break;\n      }\n    }\n  }\n  \/\/ we need to log the remove log entry, if we don't have the single\n  \/\/ optimization\n  if (!singleOp && operationType == TRI_VOC_DOCUMENT_OPERATION_REMOVE) {\n    RocksDBLogValue logValue = RocksDBLogValue::DocumentRemove(key);\n    _rocksTransaction->PutLogData(logValue.slice());\n#ifdef ARANGODB_ENABLE_MAINTAINER_MODE\n    TRI_ASSERT(++_numLogdata);\n#endif\n  }\n}\n\n\/\/\/ @brief add an operation for a transaction collection\nRocksDBOperationResult RocksDBTransactionState::addOperation(\n    TRI_voc_cid_t cid, TRI_voc_rid_t revisionId,\n    TRI_voc_document_operation_e operationType, uint64_t operationSize,\n    uint64_t keySize) {\n  RocksDBOperationResult res;\n\n  uint64_t newSize = _transactionSize + operationSize + keySize;\n  if (_maxTransactionSize < newSize) {\n    \/\/ we hit the transaction size limit\n    std::string message =\n        \"aborting transaction because maximal transaction size limit of \" +\n        std::to_string(_maxTransactionSize) + \" bytes is reached\";\n    res.reset(TRI_ERROR_RESOURCE_LIMIT, message);\n    return res;\n  }\n\n  auto collection =\n      static_cast<RocksDBTransactionCollection*>(findCollection(cid));\n\n  if (collection == nullptr) {\n    std::string message = \"collection '\" + std::to_string(cid) +\n                          \"' not found in transaction state\";\n    THROW_ARANGO_EXCEPTION_MESSAGE(TRI_ERROR_INTERNAL, message);\n  }\n\n  \/\/ should not fail or fail with exception\n  collection->addOperation(operationType, operationSize, revisionId);\n\n  \/\/ clear the query cache for this collection\n  if (arangodb::aql::QueryCache::instance()->mayBeActive()) {\n    arangodb::aql::QueryCache::instance()->invalidate(\n        _vocbase, collection->collectionName());\n  }\n\n  switch (operationType) {\n    case TRI_VOC_DOCUMENT_OPERATION_UNKNOWN:\n      break;\n    case TRI_VOC_DOCUMENT_OPERATION_INSERT:\n      ++_numInserts;\n      break;\n    case TRI_VOC_DOCUMENT_OPERATION_UPDATE:\n    case TRI_VOC_DOCUMENT_OPERATION_REPLACE:\n      ++_numUpdates;\n      break;\n    case TRI_VOC_DOCUMENT_OPERATION_REMOVE:\n      ++_numRemoves;\n      break;\n  }\n\n  _transactionSize = newSize;\n  auto numOperations = _numInserts + _numUpdates + _numRemoves;\n\n  \/\/ signal if intermediate commit is required\n  \/\/ this will be done if intermediate transactions are enabled\n  \/\/ and either the \"number of operations\" or the \"transaction size\"\n  \/\/ has reached the limit\n  if (_intermediateTransactionEnabled &&\n      (_intermediateTransactionNumber <= numOperations ||\n       _intermediateTransactionSize <= newSize)) {\n    res.commitRequired(true);\n  }\n\n  return res;\n}\n\nuint64_t RocksDBTransactionState::sequenceNumber() const {\n  return static_cast<uint64_t>(\n      _rocksTransaction->GetSnapshot()->GetSequenceNumber());\n}\n\n\/*\nclass RocksDBBatchTrx : public RocksDBBatch {\n  arangodb::Result Get(RocksDBKey const&, std::string*) override {\n    \n  }\n  \n  arangodb::Result Put(RocksDBKey const&, rocksdb::Slice const&) override {\n    \n  }\n  arangodb::Result Delete(RocksDBKey const&) override ;\n};*\/\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: XMLClipPropertyHandler.cxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: rt $ $Date: 2008-03-12 10:45: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_xmloff.hxx\"\n\n#ifndef _XMLOFF_XMLCLIPPROPERTYHANDLER_HXX\n#include \"XMLClipPropertyHandler.hxx\"\n#endif\n\n#ifndef _COM_SUN_STAR_UNO_ANY_HXX_\n#include <com\/sun\/star\/uno\/Any.hxx>\n#endif\n\n#ifndef _RTL_USTRBUF_HXX_\n#include <rtl\/ustrbuf.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_TEXT_GRAPHICCROP_HPP_\n#include <com\/sun\/star\/text\/GraphicCrop.hpp>\n#endif\n\n#ifndef _XMLOFF_XMLUCONV_HXX\n#include <xmloff\/xmluconv.hxx>\n#endif\n\n#ifndef _XMLOFF_XMLKYWD_HXX\n#include <xmlkywd.hxx>\n#endif\n#ifndef _XMLOFF_XMLTOKEN_HXX\n#include <xmloff\/xmltoken.hxx>\n#endif\n\nusing ::rtl::OUString;\nusing ::rtl::OUStringBuffer;\n\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::text;\nusing namespace ::xmloff::token;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ class XMLMeasurePropHdl\n\/\/\n\nXMLClipPropertyHandler::~XMLClipPropertyHandler()\n{\n    \/\/ nothing to do\n}\n\nbool XMLClipPropertyHandler::equals(\n        const Any& r1,\n        const Any& r2 ) const\n{\n    GraphicCrop aCrop1, aCrop2;\n    r1 >>= aCrop1;\n    r2 >>= aCrop2;\n\n    return aCrop1.Top == aCrop2.Top &&\n           aCrop1.Bottom == aCrop2.Bottom &&\n           aCrop1.Left == aCrop2.Left &&\n           aCrop1.Right == aCrop2.Right;\n}\n\nsal_Bool XMLClipPropertyHandler::importXML( const OUString& rStrImpValue, uno::Any& rValue, const SvXMLUnitConverter& rUnitConverter ) const\n{\n    sal_Bool bRet = sal_False;\n    sal_Int32 nLen = rStrImpValue.getLength();\n    if( nLen > 6 &&\n        0 == rStrImpValue.compareToAscii( sXML_rect, 4 ) &&\n        rStrImpValue[4] == '(' &&\n        rStrImpValue[nLen-1] == ')' )\n    {\n        GraphicCrop aCrop;\n        OUString sTmp( rStrImpValue.copy( 5, nLen-6 ) );\n        SvXMLTokenEnumerator aTokenEnum( sTmp );\n\n        sal_uInt16 nPos = 0;\n        OUString aToken;\n        while( aTokenEnum.getNextToken( aToken ) )\n        {\n            sal_Int32 nVal = 0;\n            if( !IsXMLToken(aToken, XML_AUTO) &&\n                 !rUnitConverter.convertMeasure( nVal, aToken ) )\n                break;\n\n            switch( nPos )\n            {\n            case 0: aCrop.Top = nVal;   break;\n            case 1: aCrop.Right = nVal; break;\n            case 2: aCrop.Bottom = nVal;    break;\n            case 3: aCrop.Left = nVal;  break;\n            }\n            nPos++;\n        }\n\n        bRet = (4 == nPos );\n        if( bRet )\n            rValue <<= aCrop;\n    }\n\n    return bRet;\n}\n\nsal_Bool XMLClipPropertyHandler::exportXML( OUString& rStrExpValue, const uno::Any& rValue, const SvXMLUnitConverter& rUnitConverter ) const\n{\n    sal_Bool bRet = sal_False;\n      OUStringBuffer aOut(30);\n    GraphicCrop aCrop;\n\n    if( rValue >>= aCrop )\n    {\n        aOut.append( GetXMLToken(XML_RECT) );\n        aOut.append( (sal_Unicode)'(' );\n        rUnitConverter.convertMeasure( aOut, aCrop.Top );\n        aOut.append( (sal_Unicode)' ' );\n        rUnitConverter.convertMeasure( aOut, aCrop.Right );\n        aOut.append( (sal_Unicode)' ' );\n        rUnitConverter.convertMeasure( aOut, aCrop.Bottom );\n        aOut.append( (sal_Unicode)' ' );\n        rUnitConverter.convertMeasure( aOut, aCrop.Left );\n        aOut.append( (sal_Unicode)')' );\n        rStrExpValue = aOut.makeStringAndClear();\n\n        bRet = sal_True;\n    }\n\n    return bRet;\n}\n<commit_msg>INTEGRATION: CWS changefileheader (1.7.18); FILE MERGED 2008\/04\/01 16:09:53 thb 1.7.18.3: #i85898# Stripping all external header guards 2008\/04\/01 13:04:59 thb 1.7.18.2: #i85898# Stripping all external header guards 2008\/03\/31 16:28:20 rt 1.7.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: XMLClipPropertyHandler.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_xmloff.hxx\"\n#include \"XMLClipPropertyHandler.hxx\"\n#include <com\/sun\/star\/uno\/Any.hxx>\n#include <rtl\/ustrbuf.hxx>\n#include <com\/sun\/star\/text\/GraphicCrop.hpp>\n#include <xmloff\/xmluconv.hxx>\n#include <xmlkywd.hxx>\n#include <xmloff\/xmltoken.hxx>\n\nusing ::rtl::OUString;\nusing ::rtl::OUStringBuffer;\n\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::text;\nusing namespace ::xmloff::token;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ class XMLMeasurePropHdl\n\/\/\n\nXMLClipPropertyHandler::~XMLClipPropertyHandler()\n{\n    \/\/ nothing to do\n}\n\nbool XMLClipPropertyHandler::equals(\n        const Any& r1,\n        const Any& r2 ) const\n{\n    GraphicCrop aCrop1, aCrop2;\n    r1 >>= aCrop1;\n    r2 >>= aCrop2;\n\n    return aCrop1.Top == aCrop2.Top &&\n           aCrop1.Bottom == aCrop2.Bottom &&\n           aCrop1.Left == aCrop2.Left &&\n           aCrop1.Right == aCrop2.Right;\n}\n\nsal_Bool XMLClipPropertyHandler::importXML( const OUString& rStrImpValue, uno::Any& rValue, const SvXMLUnitConverter& rUnitConverter ) const\n{\n    sal_Bool bRet = sal_False;\n    sal_Int32 nLen = rStrImpValue.getLength();\n    if( nLen > 6 &&\n        0 == rStrImpValue.compareToAscii( sXML_rect, 4 ) &&\n        rStrImpValue[4] == '(' &&\n        rStrImpValue[nLen-1] == ')' )\n    {\n        GraphicCrop aCrop;\n        OUString sTmp( rStrImpValue.copy( 5, nLen-6 ) );\n        SvXMLTokenEnumerator aTokenEnum( sTmp );\n\n        sal_uInt16 nPos = 0;\n        OUString aToken;\n        while( aTokenEnum.getNextToken( aToken ) )\n        {\n            sal_Int32 nVal = 0;\n            if( !IsXMLToken(aToken, XML_AUTO) &&\n                 !rUnitConverter.convertMeasure( nVal, aToken ) )\n                break;\n\n            switch( nPos )\n            {\n            case 0: aCrop.Top = nVal;   break;\n            case 1: aCrop.Right = nVal; break;\n            case 2: aCrop.Bottom = nVal;    break;\n            case 3: aCrop.Left = nVal;  break;\n            }\n            nPos++;\n        }\n\n        bRet = (4 == nPos );\n        if( bRet )\n            rValue <<= aCrop;\n    }\n\n    return bRet;\n}\n\nsal_Bool XMLClipPropertyHandler::exportXML( OUString& rStrExpValue, const uno::Any& rValue, const SvXMLUnitConverter& rUnitConverter ) const\n{\n    sal_Bool bRet = sal_False;\n      OUStringBuffer aOut(30);\n    GraphicCrop aCrop;\n\n    if( rValue >>= aCrop )\n    {\n        aOut.append( GetXMLToken(XML_RECT) );\n        aOut.append( (sal_Unicode)'(' );\n        rUnitConverter.convertMeasure( aOut, aCrop.Top );\n        aOut.append( (sal_Unicode)' ' );\n        rUnitConverter.convertMeasure( aOut, aCrop.Right );\n        aOut.append( (sal_Unicode)' ' );\n        rUnitConverter.convertMeasure( aOut, aCrop.Bottom );\n        aOut.append( (sal_Unicode)' ' );\n        rUnitConverter.convertMeasure( aOut, aCrop.Left );\n        aOut.append( (sal_Unicode)')' );\n        rStrExpValue = aOut.makeStringAndClear();\n\n        bRet = sal_True;\n    }\n\n    return bRet;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: encryptorimpl.cxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: vg $ $Date: 2005-03-10 18:06: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#include \"encryptorimpl.hxx\"\n\n#ifndef _COM_SUN_STAR_XML_CRYPTO_XXMLENCRYPTIONTEMPLATE_HPP_\n#include <com\/sun\/star\/xml\/crypto\/XXMLEncryptionTemplate.hpp>\n#endif\n#ifndef _COM_SUN_STAR_XML_WRAPPER_XXMLELEMENTWRAPPER_HPP_\n#include <com\/sun\/star\/xml\/wrapper\/XXMLElementWrapper.hpp>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XMULTISERVICEFACTORY_HPP_\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#endif\n\nnamespace cssu = com::sun::star::uno;\nnamespace cssl = com::sun::star::lang;\nnamespace cssxc = com::sun::star::xml::crypto;\nnamespace cssxw = com::sun::star::xml::wrapper;\n\n#define SERVICE_NAME \"com.sun.star.xml.crypto.sax.Encryptor\"\n#define IMPLEMENTATION_NAME \"com.sun.star.xml.security.framework.EncryptorImpl\"\n\n#define DECLARE_ASCII( SASCIIVALUE )                                                                            \\\n    rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( SASCIIVALUE ) )\n\nEncryptorImpl::EncryptorImpl( const cssu::Reference< cssl::XMultiServiceFactory >& rxMSF)\n{\n    m_nReferenceId = -1;\n    mxMSF = rxMSF;\n}\n\nEncryptorImpl::~EncryptorImpl()\n{\n}\n\nbool EncryptorImpl::checkReady() const\n\/****** EncryptorImpl\/checkReady *********************************************\n *\n *   NAME\n *  checkReady -- checks the conditions for the encryption.\n *\n *   SYNOPSIS\n *  bReady = checkReady( );\n *\n *   FUNCTION\n *  checks whether all following conditions are satisfied:\n *  1. the result listener is ready;\n *  2. the EncryptionEngine is ready.\n *\n *   INPUTS\n *  empty\n *\n *   RESULT\n *  bReady - true if all conditions are satisfied, false otherwise\n *\n *   HISTORY\n *  05.01.2004 -    implemented\n *\n *   AUTHOR\n *  Michael Mi\n *  Email: michael.mi@sun.com\n ******************************************************************************\/\n{\n    sal_Int32 nKeyInc = 0;\n    if (m_nIdOfKeyEC != 0)\n    {\n        nKeyInc = 1;\n    }\n\n    return (m_xResultListener.is() &&\n        (m_nReferenceId != -1) &&\n        (2+nKeyInc == m_nNumOfResolvedReferences) &&\n        EncryptionEngine::checkReady());\n}\n\nvoid EncryptorImpl::notifyResultListener() const\n    throw (cssu::Exception, cssu::RuntimeException)\n\/****** DecryptorImpl\/notifyResultListener ***********************************\n *\n *   NAME\n *  notifyResultListener -- notifies the listener about the encryption\n *  result.\n *\n *   SYNOPSIS\n *  notifyResultListener( );\n *\n *   FUNCTION\n *  see NAME.\n *\n *   INPUTS\n *  empty\n *\n *   RESULT\n *  empty\n *\n *   HISTORY\n *  05.01.2004 -    implemented\n *\n *   AUTHOR\n *  Michael Mi\n *  Email: michael.mi@sun.com\n ******************************************************************************\/\n{\n    cssu::Reference< cssxc::sax::XEncryptionResultListener >\n        xEncryptionResultListener ( m_xResultListener , cssu::UNO_QUERY ) ;\n\n    xEncryptionResultListener->encrypted( m_nSecurityId, m_nStatus );\n}\n\nvoid EncryptorImpl::startEngine( const cssu::Reference<\n    cssxc::XXMLEncryptionTemplate >&\n    xEncryptionTemplate)\n        throw (cssu::Exception, cssu::RuntimeException)\n\/****** EncryptorImpl\/startEngine ********************************************\n *\n *   NAME\n *  startEngine -- generates the encryption.\n *\n *   SYNOPSIS\n *  startEngine( xEncryptionTemplate );\n *\n *   FUNCTION\n *  generates the encryption element, then if succeeds, updates the link\n *  of old template element to the new encryption element in\n *  SAXEventKeeper.\n *\n *   INPUTS\n *  xEncryptionTemplate - the encryption template to be encrypted.\n *\n *   RESULT\n *  empty\n *\n *   HISTORY\n *  05.01.2004 -    implemented\n *\n *   AUTHOR\n *  Michael Mi\n *  Email: michael.mi@sun.com\n ******************************************************************************\/\n{\n    cssu::Reference < cssxc::XXMLEncryptionTemplate > xResultTemplate;\n\n    cssu::Reference< cssxw::XXMLElementWrapper >\n        xXMLElement = m_xSAXEventKeeper->getElement( m_nReferenceId );\n    xEncryptionTemplate->setTarget(xXMLElement);\n\n    try\n    {\n        xResultTemplate = m_xXMLEncryption->encrypt(\n            xEncryptionTemplate, m_xSecurityEnvironment);\n        m_nStatus = xResultTemplate->getStatus();\n    }\n    catch( cssu::Exception& )\n    {\n        m_nStatus = cssxc::SecurityOperationStatus_RUNTIMEERROR_FAILED;\n    }\n\n    if (m_nStatus == cssxc::SecurityOperationStatus_OPERATION_SUCCEEDED)\n    {\n        cssu::Reference < cssxw::XXMLElementWrapper > xResultEncryption\n            = xResultTemplate->getTemplate();\n        m_xSAXEventKeeper->setElement(m_nIdOfTemplateEC, xResultEncryption);\n        m_xSAXEventKeeper->setElement(m_nReferenceId, NULL);\n    }\n}\n\n\/* XReferenceCollector *\/\nvoid SAL_CALL EncryptorImpl::setReferenceCount( sal_Int32 count )\n    throw (cssu::Exception, cssu::RuntimeException)\n{\n    \/*\n     * dummp method, because there is only one reference in\n     * encryption, different from signature.\n     * so the referenceNumber is always 1\n     *\/\n}\n\nvoid SAL_CALL EncryptorImpl::setReferenceId( sal_Int32 id )\n    throw (cssu::Exception, cssu::RuntimeException)\n{\n    m_nReferenceId = id;\n}\n\n\/* XEncryptionResultBroadcaster *\/\nvoid SAL_CALL EncryptorImpl::addEncryptionResultListener( const cssu::Reference< cssxc::sax::XEncryptionResultListener >& listener )\n        throw (cssu::Exception, cssu::RuntimeException)\n{\n    m_xResultListener = listener;\n    tryToPerform();\n}\n\nvoid SAL_CALL EncryptorImpl::removeEncryptionResultListener( const cssu::Reference< cssxc::sax::XEncryptionResultListener >& listener )\n        throw (cssu::RuntimeException)\n{\n}\n\n\/* XInitialization *\/\nvoid SAL_CALL EncryptorImpl::initialize( const cssu::Sequence< cssu::Any >& aArguments )\n    throw (cssu::Exception, cssu::RuntimeException)\n{\n    sal_Int32 nLength = aArguments.getLength();\n    OSL_ASSERT(nLength == 5);\n\n    rtl::OUString ouTempString;\n\n    aArguments[0] >>= ouTempString;\n    m_nSecurityId = ouTempString.toInt32();\n    aArguments[1] >>= m_xSAXEventKeeper;\n    aArguments[2] >>= ouTempString;\n    m_nIdOfTemplateEC = ouTempString.toInt32();\n    aArguments[3] >>= m_xSecurityEnvironment;\n    aArguments[4] >>= m_xXMLEncryption;\n}\n\n\nrtl::OUString EncryptorImpl_getImplementationName ()\n    throw (cssu::RuntimeException)\n{\n    return rtl::OUString ( RTL_CONSTASCII_USTRINGPARAM ( IMPLEMENTATION_NAME ) );\n}\n\nsal_Bool SAL_CALL EncryptorImpl_supportsService( const rtl::OUString& ServiceName )\n    throw (cssu::RuntimeException)\n{\n    return ServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM ( SERVICE_NAME ));\n}\n\ncssu::Sequence< rtl::OUString > SAL_CALL EncryptorImpl_getSupportedServiceNames(  )\n    throw (cssu::RuntimeException)\n{\n    cssu::Sequence < rtl::OUString > aRet(1);\n    rtl::OUString* pArray = aRet.getArray();\n    pArray[0] =  rtl::OUString ( RTL_CONSTASCII_USTRINGPARAM ( SERVICE_NAME ) );\n    return aRet;\n}\n#undef SERVICE_NAME\n\ncssu::Reference< cssu::XInterface > SAL_CALL EncryptorImpl_createInstance(\n    const cssu::Reference< cssl::XMultiServiceFactory >& rSMgr)\n    throw( cssu::Exception )\n{\n    return (cppu::OWeakObject*) new EncryptorImpl(rSMgr);\n}\n\n\/* XServiceInfo *\/\nrtl::OUString SAL_CALL EncryptorImpl::getImplementationName(  )\n    throw (cssu::RuntimeException)\n{\n    return EncryptorImpl_getImplementationName();\n}\nsal_Bool SAL_CALL EncryptorImpl::supportsService( const rtl::OUString& rServiceName )\n    throw (cssu::RuntimeException)\n{\n    return EncryptorImpl_supportsService( rServiceName );\n}\ncssu::Sequence< rtl::OUString > SAL_CALL EncryptorImpl::getSupportedServiceNames(  )\n    throw (cssu::RuntimeException)\n{\n    return EncryptorImpl_getSupportedServiceNames();\n}\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.4.52); FILE MERGED 2005\/09\/05 17:01:42 rt 1.4.52.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: encryptorimpl.cxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 17: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#include \"encryptorimpl.hxx\"\n\n#ifndef _COM_SUN_STAR_XML_CRYPTO_XXMLENCRYPTIONTEMPLATE_HPP_\n#include <com\/sun\/star\/xml\/crypto\/XXMLEncryptionTemplate.hpp>\n#endif\n#ifndef _COM_SUN_STAR_XML_WRAPPER_XXMLELEMENTWRAPPER_HPP_\n#include <com\/sun\/star\/xml\/wrapper\/XXMLElementWrapper.hpp>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XMULTISERVICEFACTORY_HPP_\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#endif\n\nnamespace cssu = com::sun::star::uno;\nnamespace cssl = com::sun::star::lang;\nnamespace cssxc = com::sun::star::xml::crypto;\nnamespace cssxw = com::sun::star::xml::wrapper;\n\n#define SERVICE_NAME \"com.sun.star.xml.crypto.sax.Encryptor\"\n#define IMPLEMENTATION_NAME \"com.sun.star.xml.security.framework.EncryptorImpl\"\n\n#define DECLARE_ASCII( SASCIIVALUE )                                                                            \\\n    rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( SASCIIVALUE ) )\n\nEncryptorImpl::EncryptorImpl( const cssu::Reference< cssl::XMultiServiceFactory >& rxMSF)\n{\n    m_nReferenceId = -1;\n    mxMSF = rxMSF;\n}\n\nEncryptorImpl::~EncryptorImpl()\n{\n}\n\nbool EncryptorImpl::checkReady() const\n\/****** EncryptorImpl\/checkReady *********************************************\n *\n *   NAME\n *  checkReady -- checks the conditions for the encryption.\n *\n *   SYNOPSIS\n *  bReady = checkReady( );\n *\n *   FUNCTION\n *  checks whether all following conditions are satisfied:\n *  1. the result listener is ready;\n *  2. the EncryptionEngine is ready.\n *\n *   INPUTS\n *  empty\n *\n *   RESULT\n *  bReady - true if all conditions are satisfied, false otherwise\n *\n *   HISTORY\n *  05.01.2004 -    implemented\n *\n *   AUTHOR\n *  Michael Mi\n *  Email: michael.mi@sun.com\n ******************************************************************************\/\n{\n    sal_Int32 nKeyInc = 0;\n    if (m_nIdOfKeyEC != 0)\n    {\n        nKeyInc = 1;\n    }\n\n    return (m_xResultListener.is() &&\n        (m_nReferenceId != -1) &&\n        (2+nKeyInc == m_nNumOfResolvedReferences) &&\n        EncryptionEngine::checkReady());\n}\n\nvoid EncryptorImpl::notifyResultListener() const\n    throw (cssu::Exception, cssu::RuntimeException)\n\/****** DecryptorImpl\/notifyResultListener ***********************************\n *\n *   NAME\n *  notifyResultListener -- notifies the listener about the encryption\n *  result.\n *\n *   SYNOPSIS\n *  notifyResultListener( );\n *\n *   FUNCTION\n *  see NAME.\n *\n *   INPUTS\n *  empty\n *\n *   RESULT\n *  empty\n *\n *   HISTORY\n *  05.01.2004 -    implemented\n *\n *   AUTHOR\n *  Michael Mi\n *  Email: michael.mi@sun.com\n ******************************************************************************\/\n{\n    cssu::Reference< cssxc::sax::XEncryptionResultListener >\n        xEncryptionResultListener ( m_xResultListener , cssu::UNO_QUERY ) ;\n\n    xEncryptionResultListener->encrypted( m_nSecurityId, m_nStatus );\n}\n\nvoid EncryptorImpl::startEngine( const cssu::Reference<\n    cssxc::XXMLEncryptionTemplate >&\n    xEncryptionTemplate)\n        throw (cssu::Exception, cssu::RuntimeException)\n\/****** EncryptorImpl\/startEngine ********************************************\n *\n *   NAME\n *  startEngine -- generates the encryption.\n *\n *   SYNOPSIS\n *  startEngine( xEncryptionTemplate );\n *\n *   FUNCTION\n *  generates the encryption element, then if succeeds, updates the link\n *  of old template element to the new encryption element in\n *  SAXEventKeeper.\n *\n *   INPUTS\n *  xEncryptionTemplate - the encryption template to be encrypted.\n *\n *   RESULT\n *  empty\n *\n *   HISTORY\n *  05.01.2004 -    implemented\n *\n *   AUTHOR\n *  Michael Mi\n *  Email: michael.mi@sun.com\n ******************************************************************************\/\n{\n    cssu::Reference < cssxc::XXMLEncryptionTemplate > xResultTemplate;\n\n    cssu::Reference< cssxw::XXMLElementWrapper >\n        xXMLElement = m_xSAXEventKeeper->getElement( m_nReferenceId );\n    xEncryptionTemplate->setTarget(xXMLElement);\n\n    try\n    {\n        xResultTemplate = m_xXMLEncryption->encrypt(\n            xEncryptionTemplate, m_xSecurityEnvironment);\n        m_nStatus = xResultTemplate->getStatus();\n    }\n    catch( cssu::Exception& )\n    {\n        m_nStatus = cssxc::SecurityOperationStatus_RUNTIMEERROR_FAILED;\n    }\n\n    if (m_nStatus == cssxc::SecurityOperationStatus_OPERATION_SUCCEEDED)\n    {\n        cssu::Reference < cssxw::XXMLElementWrapper > xResultEncryption\n            = xResultTemplate->getTemplate();\n        m_xSAXEventKeeper->setElement(m_nIdOfTemplateEC, xResultEncryption);\n        m_xSAXEventKeeper->setElement(m_nReferenceId, NULL);\n    }\n}\n\n\/* XReferenceCollector *\/\nvoid SAL_CALL EncryptorImpl::setReferenceCount( sal_Int32 count )\n    throw (cssu::Exception, cssu::RuntimeException)\n{\n    \/*\n     * dummp method, because there is only one reference in\n     * encryption, different from signature.\n     * so the referenceNumber is always 1\n     *\/\n}\n\nvoid SAL_CALL EncryptorImpl::setReferenceId( sal_Int32 id )\n    throw (cssu::Exception, cssu::RuntimeException)\n{\n    m_nReferenceId = id;\n}\n\n\/* XEncryptionResultBroadcaster *\/\nvoid SAL_CALL EncryptorImpl::addEncryptionResultListener( const cssu::Reference< cssxc::sax::XEncryptionResultListener >& listener )\n        throw (cssu::Exception, cssu::RuntimeException)\n{\n    m_xResultListener = listener;\n    tryToPerform();\n}\n\nvoid SAL_CALL EncryptorImpl::removeEncryptionResultListener( const cssu::Reference< cssxc::sax::XEncryptionResultListener >& listener )\n        throw (cssu::RuntimeException)\n{\n}\n\n\/* XInitialization *\/\nvoid SAL_CALL EncryptorImpl::initialize( const cssu::Sequence< cssu::Any >& aArguments )\n    throw (cssu::Exception, cssu::RuntimeException)\n{\n    sal_Int32 nLength = aArguments.getLength();\n    OSL_ASSERT(nLength == 5);\n\n    rtl::OUString ouTempString;\n\n    aArguments[0] >>= ouTempString;\n    m_nSecurityId = ouTempString.toInt32();\n    aArguments[1] >>= m_xSAXEventKeeper;\n    aArguments[2] >>= ouTempString;\n    m_nIdOfTemplateEC = ouTempString.toInt32();\n    aArguments[3] >>= m_xSecurityEnvironment;\n    aArguments[4] >>= m_xXMLEncryption;\n}\n\n\nrtl::OUString EncryptorImpl_getImplementationName ()\n    throw (cssu::RuntimeException)\n{\n    return rtl::OUString ( RTL_CONSTASCII_USTRINGPARAM ( IMPLEMENTATION_NAME ) );\n}\n\nsal_Bool SAL_CALL EncryptorImpl_supportsService( const rtl::OUString& ServiceName )\n    throw (cssu::RuntimeException)\n{\n    return ServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM ( SERVICE_NAME ));\n}\n\ncssu::Sequence< rtl::OUString > SAL_CALL EncryptorImpl_getSupportedServiceNames(  )\n    throw (cssu::RuntimeException)\n{\n    cssu::Sequence < rtl::OUString > aRet(1);\n    rtl::OUString* pArray = aRet.getArray();\n    pArray[0] =  rtl::OUString ( RTL_CONSTASCII_USTRINGPARAM ( SERVICE_NAME ) );\n    return aRet;\n}\n#undef SERVICE_NAME\n\ncssu::Reference< cssu::XInterface > SAL_CALL EncryptorImpl_createInstance(\n    const cssu::Reference< cssl::XMultiServiceFactory >& rSMgr)\n    throw( cssu::Exception )\n{\n    return (cppu::OWeakObject*) new EncryptorImpl(rSMgr);\n}\n\n\/* XServiceInfo *\/\nrtl::OUString SAL_CALL EncryptorImpl::getImplementationName(  )\n    throw (cssu::RuntimeException)\n{\n    return EncryptorImpl_getImplementationName();\n}\nsal_Bool SAL_CALL EncryptorImpl::supportsService( const rtl::OUString& rServiceName )\n    throw (cssu::RuntimeException)\n{\n    return EncryptorImpl_supportsService( rServiceName );\n}\ncssu::Sequence< rtl::OUString > SAL_CALL EncryptorImpl::getSupportedServiceNames(  )\n    throw (cssu::RuntimeException)\n{\n    return EncryptorImpl_getSupportedServiceNames();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef __PROCESS_COLLECT_HPP__\n#define __PROCESS_COLLECT_HPP__\n\n#include <assert.h>\n\n#include <list>\n\n#include <process\/check.hpp>\n#include <process\/defer.hpp>\n#include <process\/delay.hpp>\n#include <process\/future.hpp>\n#include <process\/owned.hpp>\n#include <process\/process.hpp>\n#include <process\/timeout.hpp>\n\n#include <stout\/lambda.hpp>\n#include <stout\/none.hpp>\n#include <stout\/option.hpp>\n#include <stout\/tuple.hpp>\n\n\/\/ TODO(bmahler): Move these into a futures.hpp header to group Future\n\/\/ related utilities.\n\nnamespace process {\n\n\/\/ Waits on each future in the specified list and returns the list of\n\/\/ resulting values in the same order. If any future is discarded then\n\/\/ the result will be a failure. Likewise, if any future fails then\n\/\/ the result future will be a failure.\ntemplate <typename T>\nFuture<std::list<T> > collect(\n    const std::list<Future<T> >& futures,\n    const Option<Timeout>& timeout = None());\n\n\n\/\/ Waits on each future in the specified set and returns the list of\n\/\/ non-pending futures. On timeout, the result will be a failure.\ntemplate <typename T>\nFuture<std::list<Future<T> > > await(\n    const std::list<Future<T> >& futures,\n    const Option<Timeout>& timeout = None());\n\n\n\/\/ Waits on each future specified and returns the wrapping future\n\/\/ typed of a tuple of futures.\ntemplate <typename T1, typename T2>\nFuture<tuples::tuple<Future<T1>, Future<T2> > > await(\n    const Future<T1>& future1,\n    const Future<T2>& future2);\n\n\nnamespace internal {\n\ntemplate <typename T>\nclass CollectProcess : public Process<CollectProcess<T> >\n{\npublic:\n  CollectProcess(\n      const std::list<Future<T> >& _futures,\n      const Option<Timeout>& _timeout,\n      Promise<std::list<T> >* _promise)\n    : futures(_futures),\n      timeout(_timeout),\n      promise(_promise),\n      ready(0) {}\n\n  virtual ~CollectProcess()\n  {\n    delete promise;\n  }\n\n  virtual void initialize()\n  {\n    \/\/ Stop this nonsense if nobody cares.\n    promise->future().onDiscard(defer(this, &CollectProcess::discarded));\n\n    \/\/ Only wait as long as requested.\n    if (timeout.isSome()) {\n      delay(timeout.get().remaining(), this, &CollectProcess::timedout);\n    }\n\n    typename std::list<Future<T> >::const_iterator iterator;\n    for (iterator = futures.begin(); iterator != futures.end(); ++iterator) {\n      (*iterator).onAny(defer(this, &CollectProcess::waited, lambda::_1));\n    }\n  }\n\nprivate:\n  void discarded()\n  {\n    promise->discard();\n    terminate(this);\n  }\n\n  void timedout()\n  {\n    \/\/ Need to discard all of the futures so any of their associated\n    \/\/ resources can get properly cleaned up.\n    typename std::list<Future<T> >::const_iterator iterator;\n    for (iterator = futures.begin(); iterator != futures.end(); ++iterator) {\n      Future<T> future = *iterator; \/\/ Need a non-const copy to discard.\n      future.discard();\n    }\n\n    promise->fail(\"Collect failed: timed out\");\n    terminate(this);\n  }\n\n  void waited(const Future<T>& future)\n  {\n    if (future.isFailed()) {\n      promise->fail(\"Collect failed: \" + future.failure());\n      terminate(this);\n    } else if (future.isDiscarded()) {\n      promise->fail(\"Collect failed: future discarded\");\n      terminate(this);\n    } else {\n      CHECK_READY(future);\n      ready += 1;\n      if (ready == futures.size()) {\n        std::list<T> values;\n        foreach (const Future<T>& future, futures) {\n          values.push_back(future.get());\n        }\n        promise->set(values);\n        terminate(this);\n      }\n    }\n  }\n\n  const std::list<Future<T> > futures;\n  const Option<Timeout> timeout;\n  Promise<std::list<T> >* promise;\n  size_t ready;\n};\n\n\ntemplate <typename T>\nclass AwaitProcess : public Process<AwaitProcess<T> >\n{\npublic:\n  AwaitProcess(\n      const std::list<Future<T> >& _futures,\n      const Option<Timeout>& _timeout,\n      Promise<std::list<Future<T> > >* _promise)\n    : futures(_futures),\n      timeout(_timeout),\n      promise(_promise),\n      ready(0) {}\n\n  virtual ~AwaitProcess()\n  {\n    delete promise;\n  }\n\n  virtual void initialize()\n  {\n    \/\/ Stop this nonsense if nobody cares.\n    promise->future().onDiscard(defer(this, &AwaitProcess::discarded));\n\n    \/\/ Only wait as long as requested.\n    if (timeout.isSome()) {\n      delay(timeout.get().remaining(), this, &AwaitProcess::timedout);\n    }\n\n    typename std::list<Future<T> >::const_iterator iterator;\n    for (iterator = futures.begin(); iterator != futures.end(); ++iterator) {\n      (*iterator).onAny(defer(this, &AwaitProcess::waited, lambda::_1));\n    }\n  }\n\nprivate:\n  void discarded()\n  {\n    promise->discard();\n    terminate(this);\n  }\n\n  void timedout()\n  {\n    \/\/ Need to discard all of the futures so any of their associated\n    \/\/ resources can get properly cleaned up.\n    typename std::list<Future<T> >::const_iterator iterator;\n    for (iterator = futures.begin(); iterator != futures.end(); ++iterator) {\n      Future<T> future = *iterator; \/\/ Need a non-const copy to discard.\n      future.discard();\n    }\n\n    promise->fail(\"Collect failed: timed out\");\n    terminate(this);\n  }\n\n  void waited(const Future<T>& future)\n  {\n    assert(!future.isPending());\n\n    ready += 1;\n    if (ready == futures.size()) {\n      promise->set(futures);\n      terminate(this);\n    }\n  }\n\n  const std::list<Future<T> > futures;\n  const Option<Timeout> timeout;\n  Promise<std::list<Future<T> > >* promise;\n  size_t ready;\n};\n\n\n#if __cplusplus < 201103L\n\ntemplate <typename T>\nvoid _await(\n    const Future<T>& result,\n    Owned<Promise<Nothing> > promise)\n{\n  promise->set(Nothing());\n}\n\n\ntemplate <typename T1, typename T2>\nFuture<tuples::tuple<Future<T1>, Future<T2> > > __await(\n    const tuples::tuple<Future<T1>, Future<T2> >& future)\n{\n  return future;\n}\n\n#endif \/\/ __cplusplus < 201103L\n\n} \/\/ namespace internal {\n\n\ntemplate <typename T>\ninline Future<std::list<T> > collect(\n    const std::list<Future<T> >& futures,\n    const Option<Timeout>& timeout)\n{\n  if (futures.empty()) {\n    return std::list<T>();\n  }\n\n  Promise<std::list<T> >* promise = new Promise<std::list<T> >();\n  Future<std::list<T> > future = promise->future();\n  spawn(new internal::CollectProcess<T>(futures, timeout, promise), true);\n  return future;\n}\n\n\ntemplate <typename T>\ninline Future<std::list<Future<T> > > await(\n    const std::list<Future<T> >& futures,\n    const Option<Timeout>& timeout)\n{\n  if (futures.empty()) {\n    return futures;\n  }\n\n  Promise<std::list<Future<T> > >* promise =\n    new Promise<std::list<Future<T> > >();\n  Future<std::list<Future<T> > > future = promise->future();\n  spawn(new internal::AwaitProcess<T>(futures, timeout, promise), true);\n  return future;\n}\n\n\n#if __cplusplus >= 201103L\n\ntemplate <typename T1, typename T2>\nFuture<tuples::tuple<Future<T1>, Future<T2>>> await(\n    const Future<T1>& future1,\n    const Future<T2>& future2)\n{\n  Owned<Promise<Nothing> > promise1(new Promise<Nothing>());\n\n  future1.onAny([=] () { promise1->set(Nothing()); });\n\n  Owned<Promise<Nothing> > promise2(new Promise<Nothing>());\n\n  future2.onAny([=] () { promise2->set(Nothing()); });\n\n  std::list<Future<Nothing> > futures;\n  futures.push_back(promise1->future());\n  futures.push_back(promise2->future());\n\n  return await(futures)\n    .then([=] () { return tuples::make_tuple(future1, future2); });\n}\n\n#else \/\/ __cplusplus >= 201103L\n\ntemplate <typename T1, typename T2>\nFuture<tuples::tuple<Future<T1>, Future<T2> > > await(\n    const Future<T1>& future1,\n    const Future<T2>& future2)\n{\n  Owned<Promise<Nothing> > promise1(new Promise<Nothing>());\n\n  future1.onAny(lambda::bind(internal::_await<T1>, lambda::_1, promise1));\n\n  Owned<Promise<Nothing> > promise2(new Promise<Nothing>());\n\n  future2.onAny(lambda::bind(internal::_await<T2>, lambda::_1, promise2));\n\n  std::list<Future<Nothing> > futures;\n  futures.push_back(promise1->future());\n  futures.push_back(promise2->future());\n\n  return await(futures)\n    .then(lambda::bind(\n      internal::__await<T1, T2>,\n      tuples::make_tuple(future1, future2)));\n}\n\n#endif \/\/ __cplusplus >= 201103L\n\n} \/\/ namespace process {\n\n#endif \/\/ __PROCESS_COLLECT_HPP__\n<commit_msg>Removed timeouts in interfaces in favor of Future::after.<commit_after>#ifndef __PROCESS_COLLECT_HPP__\n#define __PROCESS_COLLECT_HPP__\n\n#include <list>\n\n#include <process\/check.hpp>\n#include <process\/defer.hpp>\n#include <process\/future.hpp>\n#include <process\/owned.hpp>\n#include <process\/process.hpp>\n\n#include <stout\/lambda.hpp>\n#include <stout\/tuple.hpp>\n\n\/\/ TODO(bmahler): Move these into a futures.hpp header to group Future\n\/\/ related utilities.\n\nnamespace process {\n\n\/\/ Waits on each future in the specified list and returns the list of\n\/\/ resulting values in the same order. If any future is discarded then\n\/\/ the result will be a failure. Likewise, if any future fails then\n\/\/ the result future will be a failure.\ntemplate <typename T>\nFuture<std::list<T> > collect(const std::list<Future<T> >& futures);\n\n\n\/\/ Waits on each future in the specified set and returns the list of\n\/\/ non-pending futures.\ntemplate <typename T>\nFuture<std::list<Future<T> > > await(const std::list<Future<T> >& futures);\n\n\n\/\/ Waits on each future specified and returns the wrapping future\n\/\/ typed of a tuple of futures.\ntemplate <typename T1, typename T2>\nFuture<tuples::tuple<Future<T1>, Future<T2> > > await(\n    const Future<T1>& future1,\n    const Future<T2>& future2);\n\n\nnamespace internal {\n\ntemplate <typename T>\nclass CollectProcess : public Process<CollectProcess<T> >\n{\npublic:\n  CollectProcess(\n      const std::list<Future<T> >& _futures,\n      Promise<std::list<T> >* _promise)\n    : futures(_futures),\n      promise(_promise),\n      ready(0) {}\n\n  virtual ~CollectProcess()\n  {\n    delete promise;\n  }\n\n  virtual void initialize()\n  {\n    \/\/ Stop this nonsense if nobody cares.\n    promise->future().onDiscard(defer(this, &CollectProcess::discarded));\n\n    typename std::list<Future<T> >::const_iterator iterator;\n    for (iterator = futures.begin(); iterator != futures.end(); ++iterator) {\n      (*iterator).onAny(defer(this, &CollectProcess::waited, lambda::_1));\n    }\n  }\n\nprivate:\n  void discarded()\n  {\n    promise->discard();\n    terminate(this);\n  }\n\n  void waited(const Future<T>& future)\n  {\n    if (future.isFailed()) {\n      promise->fail(\"Collect failed: \" + future.failure());\n      terminate(this);\n    } else if (future.isDiscarded()) {\n      promise->fail(\"Collect failed: future discarded\");\n      terminate(this);\n    } else {\n      CHECK_READY(future);\n      ready += 1;\n      if (ready == futures.size()) {\n        std::list<T> values;\n        foreach (const Future<T>& future, futures) {\n          values.push_back(future.get());\n        }\n        promise->set(values);\n        terminate(this);\n      }\n    }\n  }\n\n  const std::list<Future<T> > futures;\n  Promise<std::list<T> >* promise;\n  size_t ready;\n};\n\n\ntemplate <typename T>\nclass AwaitProcess : public Process<AwaitProcess<T> >\n{\npublic:\n  AwaitProcess(\n      const std::list<Future<T> >& _futures,\n      Promise<std::list<Future<T> > >* _promise)\n    : futures(_futures),\n      promise(_promise),\n      ready(0) {}\n\n  virtual ~AwaitProcess()\n  {\n    delete promise;\n  }\n\n  virtual void initialize()\n  {\n    \/\/ Stop this nonsense if nobody cares.\n    promise->future().onDiscard(defer(this, &AwaitProcess::discarded));\n\n    typename std::list<Future<T> >::const_iterator iterator;\n    for (iterator = futures.begin(); iterator != futures.end(); ++iterator) {\n      (*iterator).onAny(defer(this, &AwaitProcess::waited, lambda::_1));\n    }\n  }\n\nprivate:\n  void discarded()\n  {\n    promise->discard();\n    terminate(this);\n  }\n\n  void waited(const Future<T>& future)\n  {\n    CHECK(!future.isPending());\n\n    ready += 1;\n    if (ready == futures.size()) {\n      promise->set(futures);\n      terminate(this);\n    }\n  }\n\n  const std::list<Future<T> > futures;\n  Promise<std::list<Future<T> > >* promise;\n  size_t ready;\n};\n\n\n#if __cplusplus < 201103L\n\ntemplate <typename T>\nvoid _await(\n    const Future<T>& result,\n    Owned<Promise<Nothing> > promise)\n{\n  promise->set(Nothing());\n}\n\n\ntemplate <typename T1, typename T2>\nFuture<tuples::tuple<Future<T1>, Future<T2> > > __await(\n    const tuples::tuple<Future<T1>, Future<T2> >& future)\n{\n  return future;\n}\n\n#endif \/\/ __cplusplus < 201103L\n\n} \/\/ namespace internal {\n\n\ntemplate <typename T>\ninline Future<std::list<T> > collect(\n    const std::list<Future<T> >& futures)\n{\n  if (futures.empty()) {\n    return std::list<T>();\n  }\n\n  Promise<std::list<T> >* promise = new Promise<std::list<T> >();\n  Future<std::list<T> > future = promise->future();\n  spawn(new internal::CollectProcess<T>(futures, promise), true);\n  return future;\n}\n\n\ntemplate <typename T>\ninline Future<std::list<Future<T> > > await(\n    const std::list<Future<T> >& futures)\n{\n  if (futures.empty()) {\n    return futures;\n  }\n\n  Promise<std::list<Future<T> > >* promise =\n    new Promise<std::list<Future<T> > >();\n  Future<std::list<Future<T> > > future = promise->future();\n  spawn(new internal::AwaitProcess<T>(futures, promise), true);\n  return future;\n}\n\n\n#if __cplusplus >= 201103L\n\ntemplate <typename T1, typename T2>\nFuture<tuples::tuple<Future<T1>, Future<T2>>> await(\n    const Future<T1>& future1,\n    const Future<T2>& future2)\n{\n  Owned<Promise<Nothing> > promise1(new Promise<Nothing>());\n\n  future1.onAny([=] () { promise1->set(Nothing()); });\n\n  Owned<Promise<Nothing> > promise2(new Promise<Nothing>());\n\n  future2.onAny([=] () { promise2->set(Nothing()); });\n\n  std::list<Future<Nothing> > futures;\n  futures.push_back(promise1->future());\n  futures.push_back(promise2->future());\n\n  return await(futures)\n    .then([=] () { return tuples::make_tuple(future1, future2); });\n}\n\n#else \/\/ __cplusplus >= 201103L\n\ntemplate <typename T1, typename T2>\nFuture<tuples::tuple<Future<T1>, Future<T2> > > await(\n    const Future<T1>& future1,\n    const Future<T2>& future2)\n{\n  Owned<Promise<Nothing> > promise1(new Promise<Nothing>());\n\n  future1.onAny(lambda::bind(internal::_await<T1>, lambda::_1, promise1));\n\n  Owned<Promise<Nothing> > promise2(new Promise<Nothing>());\n\n  future2.onAny(lambda::bind(internal::_await<T2>, lambda::_1, promise2));\n\n  std::list<Future<Nothing> > futures;\n  futures.push_back(promise1->future());\n  futures.push_back(promise2->future());\n\n  return await(futures)\n    .then(lambda::bind(\n      internal::__await<T1, T2>,\n      tuples::make_tuple(future1, future2)));\n}\n\n#endif \/\/ __cplusplus >= 201103L\n\n} \/\/ namespace process {\n\n#endif \/\/ __PROCESS_COLLECT_HPP__\n<|endoftext|>"}
{"text":"<commit_before>#include \"src\/triangle.h\"\n#include <stdio.h>\n\/\/ simplest case: will plot either a flat bottom or flat top triangles\nenum TriangleType\n{\n    FLAT_BOTTOM,\n    FLAT_TOP\n};\n\n\/\/ internal triangle renderer based on triangle type\nvoid drawTriangleType(const Triangle *t, const Vertex *v0, const Vertex *v1, const Vertex *v2, unsigned char *buffer, enum TriangleType type);\n\n\/\/ draw the triangle!\nvoid drawTriangle(const Triangle *t, unsigned char *buffer)\n{\n    Vertex v0, v1, v2;\n\n    v0 = t->vertices[0];\n    v1 = t->vertices[1];\n    v2 = t->vertices[2];\n\n    if(v2.position.y > v1.position.y)\n    {\n        v2 = t->vertices[1];\n        v1 = t->vertices[2];\n    }\n\n    \/\/ sort vertices so that v0 is topmost, then v1, then v2\n    if(v0.position.y > v1.position.y)\n    {\n        v0 = v1;\n        v1 = t->vertices[0];\n    }\n\n    if(v0.position.y > v2.position.y)\n    {\n        Vertex tmp = v2;\n        v2 = v0;\n        v0 = tmp;\n    }\n\n    \/\/ degenerate triangle?\n    \/\/if((int)v0->position.y == (int)v2->position.y)\n    \/\/    return;\n\n    if(v1.position.y == v2.position.y)\n        drawTriangleType(t, &v0, &v1, &v2, buffer, FLAT_BOTTOM);\n    else if(v0.position.y == v1.position.y)\n        drawTriangleType(t, &v2, &v1, &v0, buffer, FLAT_TOP);\n    else\n    {\n        Vertex v3;\n        Vector4f diff, diff2;\n        double ratioU = 1, ratioV = 1, u1, u2, vv1, vv2;\n\n        v3.position.x = v0.position.x + ((float)(v2.position.y - v0.position.y) \/ (float)(v1.position.y - v0.position.y)) * (v1.position.x - v0.position.x);\n        v3.position.y = v2.position.y;\n        v3.position.z = v2.position.z;\n\n        diff = vecSub(&v3.position, &v0.position);\n        diff2 = vecSub(&v1.position, &v3.position);\n        u1 = v3.position.x - v0.position.x;\n        u2 = v1.position.x - v3.position.x;\n        if(u1+u2 != 0)\n            ratioU = u1 \/ (u1 + u2);\n            \n        vv1 = v3.position.y - v0.position.y;\n        vv2 = v1.position.y - v3.position.y;\n        if(vv1 + vv2 != 0)\n            ratioV = vv1 \/ (vv1 + vv2);\n\n        v3.uv.u = v1.uv.u * ratioU;\n        v3.uv.v = v1.uv.v * ratioV;\n\n        if(v0.uv.u > v1.uv.u)\n            v3.uv.u = v0.uv.u * (1.0 - ratioU);\n\n        if(v0.uv.v > v1.uv.v)\n            v3.uv.v = v0.uv.v * (1.0 - ratioV);\n\n        if(v3.position.x < v2.position.x)\n        {\n            Vertex tmp = v2;\n            v2 = v3;\n            v3 = tmp;\n        }\n\n        fprintf(stdout, \"%.2f %.2f %.2f %.2f\\r\", v0.uv.u, v0.uv.v, v1.uv.u, v1.uv.v);\n        \/\/fprintf(stdout, \"%.2f %.2f %.2f %.2f %.2f %.2f\\r\", v1.uv.u, v1.uv.v, v3.uv.u, v3.uv.v, v2.uv.u, v2.uv.v);\n        \/\/fprintf(stdout, \"%.2f %.2f %.2f %.2f %.2f %.2f\\n\\r\", v1.position.x, v1.position.y, v3.position.x, v3.position.y, v2.position.x, v2.position.y);\n        fflush(stdout);\n\n        \/\/ more degenerate triangle tests\n        \/\/if((int)v0->position.y == (int)v3.position.y)\n        \/\/    return;\n\n        \/\/if((int)v0->position.y == (int)v2->position.y)\n        \/\/    return;\n\n        \/\/fprintf(stdout, \"%.2f %.2f %.2f %.2f %.2f %.2f\\n\\r\", v0.uv.u, v0.uv.v, v3.uv.u, v3.uv.v, v2.uv.u, v2.uv.v);\n        \/\/fprintf(stdout, \"%.2f %.2f %.2f %.2f %.2f %.2f\\n\\r\", v1.uv.u, v1.uv.v, v3.uv.u, v3.uv.v, v2.uv.u, v2.uv.v);\n        \/\/fprintf(stdout, \"%.2f %.2f %.2f %.2f %.2f %.2f\\n\\r\", v0.position.x, v0.position.y, v3.position.x, v3.position.y, v2.position.x, v2.position.y);\n        \/\/fprintf(stdout, \"%.2f %.2f %.2f %.2f %.2f %.2f\\n\\r\", v1.position.x, v1.position.y, v3.position.x, v3.position.y, v2.position.x, v2.position.y);\n        drawTriangleType(t, &v0, &v3, &v2, buffer, FLAT_BOTTOM);\n        drawTriangleType(t, &v1, &v3, &v2, buffer, FLAT_TOP);\n        \n       \/\/ fflush(stdout);\n\n        \/\/if((int)v1->position.y == (int)v3.position.y)\n        \/\/    return;\n\n        \/\/if((int)v1->position.y == (int)v2->position.y)\n        \/\/    return;\n    }\n}\n\n\n\/*\n* Render counter clockwise (v0->v1->v2) for wanted effect.\n* v0         v0----v1\n* |\\         |     \/\n* | \\        |    \/\n* |  \\       |   \/\n* |   \\      |  \/\n* |    \\     | \/\n* |     \\    |\/\n* v2-----v1  v2\n*\/\nvoid drawTriangleType(const Triangle *t, const Vertex *v0, const Vertex *v1, const Vertex *v2, unsigned char *buffer, enum TriangleType type)\n{\n    double invDy, dxLeft, dxRight, xLeft, xRight;\n    double x, y, yDir = 1;\n\n    if(type == FLAT_BOTTOM)\n    {\n        invDy  = 1.f \/ (v2->position.y - v0->position.y);\n    }\n    else\n    {\n        invDy  = 1.f \/ (v0->position.y - v2->position.y);\n        yDir = -1;\n    }\n    dxLeft  = (v2->position.x - v0->position.x) * invDy;\n    dxRight = (v1->position.x - v0->position.x) * invDy;\n    xLeft  = v0->position.x;\n    xRight = xLeft;\n\n    if(!t->texture)\n    {\n        for(y = v0->position.y; ; y += yDir)\n        {\n            \/\/ to avoid pixel wide gaps, render extra line at the junction between two final points\n            if(type == FLAT_TOP && y < v2->position.y)\n            {\n                \/\/drawLine(xLeft-dxLeft, y, xRight-dxRight, y, t->color, buffer);\n                break;\n            }\n            else if(type == FLAT_BOTTOM && y > v2->position.y)\n            {\n                drawLine(xLeft-dxLeft, y, xRight-dxRight, y, t->color, buffer);\n                break;\n            }\n\n            drawLine(xLeft, y, xRight, y, t->color, buffer);\n            xLeft += dxLeft;\n            xRight += dxRight;\n\n        }\n    }\n    else\n    {\n        float texW = t->texture->width - 1;\n        float texH = t->texture->height - 1;\n        float duLeft =  texW * (v2->uv.u - v0->uv.u) * invDy;\n        float dvLeft =  texH * (v2->uv.v - v0->uv.v) * invDy;\n        float duRight = texW * (v1->uv.u - v0->uv.u) * invDy;\n        float dvRight = texH * (v1->uv.v - v0->uv.v) * invDy;\n\n        float uLeft = texW * v0->uv.u;\n        float uRight = uLeft;\n        float vLeft = texH * v0->uv.v;\n        float vRight = vLeft;\n\n        setPalette(t->texture->palette);\n\n        for(y = v0->position.y; ; y += yDir)\n        {\n            int startX = xLeft;\n            int endX  = xRight;\n            float u = uLeft;\n            float v = vLeft;\n            float du, dv;\n            float dx = endX - startX;\n\n           if(type == FLAT_BOTTOM && y > v2->position.y)\n           {\n                u -= du;\n                v -= dv;\n                for(x = startX-dxLeft; x <= endX-dxRight; ++x)\n                {\n                    byte pixel = t->texture->data[(int)u + ((int)v << 6)];\n                    drawPixel(x, y, pixel, buffer);\n                    u += du;\n                    v += dv;\n                }\n                break;\n           }\n            else if ( type == FLAT_TOP && y < v2->position.y)\n                break;\n\n            if(dx > 0)\n            {\n                du = (uRight - uLeft) \/ dx;\n                dv = (vRight - vLeft) \/ dx;\n            }\n            else\n            {\n                du = uRight - uLeft;\n                dv = vRight - vLeft;\n            }\n\n            for(x = startX; x <= endX; ++x)\n            {\n                byte pixel = t->texture->data[(int)u + ((int)v << 6)];\n                drawPixel(x, y, pixel, buffer);\n                u += du;\n                v += dv;\n            }\n\n            xLeft += dxLeft;\n            xRight += dxRight;\n            uLeft += duLeft;\n            uRight += duRight;\n            vLeft += dvLeft;\n            vRight += dvRight;\n        }\n    }\n}\n<commit_msg>Lerp the UVs of texture mapped triangles for correct tex mapping<commit_after>#include \"src\/triangle.h\"\n\n\/\/ simplest case: will plot either a flat bottom or flat top triangles\nenum TriangleType\n{\n    FLAT_BOTTOM,\n    FLAT_TOP\n};\n\n\/\/ internal triangle renderer based on triangle type\nvoid drawTriangleType(const Triangle *t, const Vertex *v0, const Vertex *v1, const Vertex *v2, unsigned char *buffer, enum TriangleType type);\n\n\/\/ draw the triangle!\nvoid drawTriangle(const Triangle *t, unsigned char *buffer)\n{\n    Vertex v0, v1, v2;\n\n    v0 = t->vertices[0];\n    v1 = t->vertices[1];\n    v2 = t->vertices[2];\n\n    \/\/ sort vertices so that v0 is topmost, then v1, then v2\n    if(v2.position.y > v1.position.y)\n    {\n        v2 = t->vertices[1];\n        v1 = t->vertices[2];\n    }\n\n    if(v0.position.y > v1.position.y)\n    {\n        v0 = v1;\n        v1 = t->vertices[0];\n    }\n\n    if(v0.position.y > v2.position.y)\n    {\n        Vertex tmp = v2;\n        v2 = v0;\n        v0 = tmp;\n    }\n\n    \/\/ degenerate triangle?\n    \/\/if((int)v0->position.y == (int)v2->position.y)\n    \/\/    return;\n\n    if(v1.position.y == v2.position.y)\n        drawTriangleType(t, &v0, &v1, &v2, buffer, FLAT_BOTTOM);\n    else if(v0.position.y == v1.position.y)\n        drawTriangleType(t, &v2, &v1, &v0, buffer, FLAT_TOP);\n    else\n    {\n        Vertex v3;\n        Vector4f diff, diff2;\n        double ratioU = 1, ratioV = 1;\n\n        v3.position.x = v0.position.x + ((float)(v2.position.y - v0.position.y) \/ (float)(v1.position.y - v0.position.y)) * (v1.position.x - v0.position.x);\n        v3.position.y = v2.position.y;\n        v3.position.z = v2.position.z;\n\n        diff = vecSub(&v1.position, &v0.position);\n        diff2 = vecSub(&v3.position, &v0.position);\n\n        if(diff.x != 0)\n            ratioU = diff2.x \/ diff.x;\n\n        if(diff.y != 0)\n            ratioV = diff2.y \/ diff.y;\n\n        \/\/ lerp the UV mapping for the triangle\n        v3.uv.u = v1.uv.u * ratioU + v0.uv.u * (1.0 - ratioU);\n        v3.uv.v = v1.uv.v * ratioV + v0.uv.v * (1.0 - ratioV);\n\n        if(v0.uv.u > v1.uv.u)\n            v3.uv.u = v0.uv.u * (1.0 - ratioU);\n\n        if(v0.uv.v > v1.uv.v)\n            v3.uv.v = v0.uv.v * (1.0 - ratioV);\n\n        if(v3.position.x < v2.position.x)\n        {\n            Vertex tmp = v2;\n            v2 = v3;\n            v3 = tmp;\n        }\n\n        \/\/ more degenerate triangle tests\n        \/\/if((int)v0->position.y == (int)v3.position.y)\n        \/\/    return;\n\n        \/\/if((int)v0->position.y == (int)v2->position.y)\n        \/\/    return;\n\n        drawTriangleType(t, &v0, &v3, &v2, buffer, FLAT_BOTTOM);\n        drawTriangleType(t, &v1, &v3, &v2, buffer, FLAT_TOP);\n        \n        \/\/if((int)v1->position.y == (int)v3.position.y)\n        \/\/    return;\n\n        \/\/if((int)v1->position.y == (int)v2->position.y)\n        \/\/    return;\n    }\n}\n\n\n\/*\n* Render counter clockwise (v0->v1->v2) for wanted effect.\n* v0         v0----v1\n* |\\         |     \/\n* | \\        |    \/\n* |  \\       |   \/\n* |   \\      |  \/\n* |    \\     | \/\n* |     \\    |\/\n* v2-----v1  v2\n*\/\nvoid drawTriangleType(const Triangle *t, const Vertex *v0, const Vertex *v1, const Vertex *v2, unsigned char *buffer, enum TriangleType type)\n{\n    double invDy, dxLeft, dxRight, xLeft, xRight;\n    double x, y, yDir = 1;\n\n    if(type == FLAT_BOTTOM)\n    {\n        invDy  = 1.f \/ (v2->position.y - v0->position.y);\n    }\n    else\n    {\n        invDy  = 1.f \/ (v0->position.y - v2->position.y);\n        yDir = -1;\n    }\n    dxLeft  = (v2->position.x - v0->position.x) * invDy;\n    dxRight = (v1->position.x - v0->position.x) * invDy;\n    xLeft  = v0->position.x;\n    xRight = xLeft;\n\n    if(!t->texture)\n    {\n        for(y = v0->position.y; ; y += yDir)\n        {\n            \/\/ to avoid pixel wide gaps, render extra line at the junction between two final points\n            if(type == FLAT_TOP && y < v2->position.y)\n            {\n                \/\/drawLine(xLeft-dxLeft, y, xRight-dxRight, y, t->color, buffer);\n                break;\n            }\n            else if(type == FLAT_BOTTOM && y > v2->position.y)\n            {\n                drawLine(xLeft-dxLeft, y, xRight-dxRight, y, t->color, buffer);\n                break;\n            }\n\n            drawLine(xLeft, y, xRight, y, t->color, buffer);\n            xLeft += dxLeft;\n            xRight += dxRight;\n\n        }\n    }\n    else\n    {\n        float texW = t->texture->width - 1;\n        float texH = t->texture->height - 1;\n        float duLeft =  texW * (v2->uv.u - v0->uv.u) * invDy;\n        float dvLeft =  texH * (v2->uv.v - v0->uv.v) * invDy;\n        float duRight = texW * (v1->uv.u - v0->uv.u) * invDy;\n        float dvRight = texH * (v1->uv.v - v0->uv.v) * invDy;\n\n        float uLeft = texW * v0->uv.u;\n        float uRight = uLeft;\n        float vLeft = texH * v0->uv.v;\n        float vRight = vLeft;\n\n        setPalette(t->texture->palette);\n\n        for(y = v0->position.y; ; y += yDir)\n        {\n            int startX = xLeft;\n            int endX  = xRight;\n            float u = uLeft;\n            float v = vLeft;\n            float du, dv;\n            float dx = endX - startX;\n\n           if(type == FLAT_BOTTOM && y > v2->position.y)\n           {\n                u -= du;\n                v -= dv;\n                for(x = startX-dxLeft; x <= endX-dxRight; ++x)\n                {\n                    byte pixel = t->texture->data[(int)u + ((int)v << 6)];\n                    drawPixel(x, y, pixel, buffer);\n                    u += du;\n                    v += dv;\n                }\n                break;\n           }\n            else if ( type == FLAT_TOP && y < v2->position.y)\n                break;\n\n            if(dx > 0)\n            {\n                du = (uRight - uLeft) \/ dx;\n                dv = (vRight - vLeft) \/ dx;\n            }\n            else\n            {\n                du = uRight - uLeft;\n                dv = vRight - vLeft;\n            }\n\n            for(x = startX; x <= endX; ++x)\n            {\n                byte pixel = t->texture->data[(int)u + ((int)v << 6)];\n                drawPixel(x, y, pixel, buffer);\n                u += du;\n                v += dv;\n            }\n\n            xLeft += dxLeft;\n            xRight += dxRight;\n            uLeft += duLeft;\n            uRight += duRight;\n            vLeft += dvLeft;\n            vRight += dvRight;\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"application.h\"\n#include <SDL.h>\n#include <SDL_video.h>\n#include <SDL_opengl.h>\n#include \"ship_state.h\"\n\n\/\/-------------------------------------------------------------------------------------------------\nApplication::Application() :\n  window_(nullptr)\n{\n\n}\n\n\/\/-------------------------------------------------------------------------------------------------\nApplication::~Application()\n{\n\n}\n\n\/\/-------------------------------------------------------------------------------------------------\nint Application::Run()\n{\n  \/\/ Initialize the application\n  if (!Initialize())\n    return -1;\n\n  \/\/ Main loop\n  while (ProcessEvents())\n  {\n    Update();\n    Draw();\n  }\n\n  \/\/ Tear down the application\n  return Destroy() ? 0 : -1;\n}\n\n\/\/-------------------------------------------------------------------------------------------------\nbool Application::ProcessEvents()\n{\n  bool shouldQuit = false;\n\n  SDL_Event evt;\n  while (SDL_PollEvent(&evt))\n    shouldQuit |= !HandleEvent(evt);\n\n  return !shouldQuit;\n}\n\n\/\/---------------------------------------------------------------------------------------------------\nbool Application::HandleEvent(const SDL_Event& evt)\n{\n  \/\/ Handle quit \n  if (evt.type == SDL_QUIT || evt.type == SDL_WINDOWEVENT_CLOSE)\n    return false;\n\n  \/\/ Handle alt+F4\n  if (evt.type == SDL_KEYDOWN && evt.key.keysym.sym == SDLK_F4 &&\n    (evt.key.keysym.mod == KMOD_LALT || evt.key.keysym.mod == KMOD_RALT))\n    return false;\n\n  return true;\n}\n\n\/\/---------------------------------------------------------------------------------------------------\nvoid Application::Update()\n{\n\n}\n\n\/\/---------------------------------------------------------------------------------------------------\nvoid Application::Draw()\n{\n  \/\/ Set the clear color\n  glClearColor(0.1f, 0.1f, 0.1f, 1.0f);\n\n  \/\/ Actually clear\n  glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n  \/\/ Setup viewport size\n  int vpWidth, vpHeight;\n  SDL_GetWindowSize(window_, &vpWidth, &vpHeight);\n  glViewport(0, 0, vpWidth, vpHeight);\n\n  \/\/ Determine aspect ratio\n  float aspectRatio = (float) vpWidth \/ vpHeight;\n  const float viewportSize = 50.0f;\n  const float halfViewportSize = viewportSize * 0.5f;\n  \n  \/\/ Setup view matrix\n  glLoadIdentity();\n  glOrtho(-halfViewportSize * aspectRatio, halfViewportSize * aspectRatio, -halfViewportSize, halfViewportSize, 0.0f, 1.0f);\n\n  \/\/ Draw the world\n  testShip_->Draw();\n\n  \/\/ Preset the view\n  SDL_GL_SwapWindow(window_);\n}\n\n\/\/-------------------------------------------------------------------------------------------------\nbool Application::Initialize()\n{\n  \/\/ Initialize SDL\n  if (SDL_Init(SDL_INIT_EVERYTHING) < 0)\n  {\n    SDL_LogError(SDL_LOG_CATEGORY_SYSTEM, \"Unable to initialize SDL: %s\", SDL_GetError());\n    return false;\n  }\n\n  \/\/ Create an opengl context\n  SDL_GL_SetAttribute(SDL_GL_DOUBLEBUFFER, 1);\n\n  \/\/ Create a window and a renderer\n  if ((window_ = SDL_CreateWindow(\"aifc\", SDL_WINDOWPOS_CENTERED, SDL_WINDOWPOS_CENTERED, 1280, 800, SDL_WINDOW_OPENGL|SDL_WINDOW_RESIZABLE|SDL_WINDOW_ALLOW_HIGHDPI)) == nullptr)\n  {\n    SDL_LogError(SDL_LOG_CATEGORY_RENDER, \"Unable to initialize SDL graphics: %s\", SDL_GetError());\n    return false;\n  }\n\n  \/\/ Create an opengl context\n  mainContext = SDL_GL_CreateContext(window_);\n  if (!mainContext)\n  {\n    SDL_LogError(SDL_LOG_CATEGORY_RENDER, \"Unable to initialize SDL OpenGL: %s\", SDL_GetError());\n    return false;\n  }\n\n  \/\/ Test\n  testShip_ = std::unique_ptr<ShipState>(new ShipState());\n\n  return true;\n}\n\n\/\/-------------------------------------------------------------------------------------------------\nbool Application::Destroy()\n{\n  \/\/ Shut down SDL\n  SDL_Quit();\n\n  return true;\n}<commit_msg>Fixed high DPI windows<commit_after>#include \"application.h\"\n#include <SDL.h>\n#include <SDL_video.h>\n#include <SDL_opengl.h>\n#include \"ship_state.h\"\n\n\/\/-------------------------------------------------------------------------------------------------\nApplication::Application() :\n  window_(nullptr)\n{\n\n}\n\n\/\/-------------------------------------------------------------------------------------------------\nApplication::~Application()\n{\n\n}\n\n\/\/-------------------------------------------------------------------------------------------------\nint Application::Run()\n{\n  \/\/ Initialize the application\n  if (!Initialize())\n    return -1;\n\n  \/\/ Main loop\n  while (ProcessEvents())\n  {\n    Update();\n    Draw();\n  }\n\n  \/\/ Tear down the application\n  return Destroy() ? 0 : -1;\n}\n\n\/\/-------------------------------------------------------------------------------------------------\nbool Application::ProcessEvents()\n{\n  bool shouldQuit = false;\n\n  SDL_Event evt;\n  while (SDL_PollEvent(&evt))\n    shouldQuit |= !HandleEvent(evt);\n\n  return !shouldQuit;\n}\n\n\/\/---------------------------------------------------------------------------------------------------\nbool Application::HandleEvent(const SDL_Event& evt)\n{\n  \/\/ Handle quit \n  if (evt.type == SDL_QUIT || evt.type == SDL_WINDOWEVENT_CLOSE)\n    return false;\n\n  \/\/ Handle alt+F4\n  if (evt.type == SDL_KEYDOWN && evt.key.keysym.sym == SDLK_F4 &&\n    (evt.key.keysym.mod == KMOD_LALT || evt.key.keysym.mod == KMOD_RALT))\n    return false;\n\n  return true;\n}\n\n\/\/---------------------------------------------------------------------------------------------------\nvoid Application::Update()\n{\n\n}\n\n\/\/---------------------------------------------------------------------------------------------------\nvoid Application::Draw()\n{\n  \/\/ Set the clear color\n  glClearColor(0.1f, 0.1f, 0.1f, 1.0f);\n\n  \/\/ Actually clear\n  glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n  \/\/ Setup viewport size\n  int vpWidth, vpHeight;\n  SDL_GL_GetDrawableSize(window_, &vpWidth, &vpHeight);\n  glViewport(0, 0, vpWidth, vpHeight);\n\n  \/\/ Determine aspect ratio\n  float aspectRatio = (float) vpWidth \/ vpHeight;\n  const float viewportSize = 50.0f;\n  const float halfViewportSize = viewportSize * 0.5f;\n  \n  \/\/ Setup view matrix\n  glLoadIdentity();\n  glOrtho(-halfViewportSize * aspectRatio, halfViewportSize * aspectRatio, -halfViewportSize, halfViewportSize, 0.0f, 1.0f);\n\n  \/\/ Draw the world\n  testShip_->Draw();\n\n  \/\/ Preset the view\n  SDL_GL_SwapWindow(window_);\n}\n\n\/\/-------------------------------------------------------------------------------------------------\nbool Application::Initialize()\n{\n  \/\/ Initialize SDL\n  if (SDL_Init(SDL_INIT_EVERYTHING) < 0)\n  {\n    SDL_LogError(SDL_LOG_CATEGORY_SYSTEM, \"Unable to initialize SDL: %s\", SDL_GetError());\n    return false;\n  }\n\n  \/\/ Create an opengl context\n  SDL_GL_SetAttribute(SDL_GL_DOUBLEBUFFER, 1);\n\n  \/\/ Create a window and a renderer\n  if ((window_ = SDL_CreateWindow(\"aifc\", SDL_WINDOWPOS_CENTERED, SDL_WINDOWPOS_CENTERED, 1280, 800, SDL_WINDOW_OPENGL|SDL_WINDOW_RESIZABLE|SDL_WINDOW_ALLOW_HIGHDPI)) == nullptr)\n  {\n    SDL_LogError(SDL_LOG_CATEGORY_RENDER, \"Unable to initialize SDL graphics: %s\", SDL_GetError());\n    return false;\n  }\n\n  \/\/ Create an opengl context\n  mainContext = SDL_GL_CreateContext(window_);\n  if (!mainContext)\n  {\n    SDL_LogError(SDL_LOG_CATEGORY_RENDER, \"Unable to initialize SDL OpenGL: %s\", SDL_GetError());\n    return false;\n  }\n\n  \/\/ Test\n  testShip_ = std::unique_ptr<ShipState>(new ShipState());\n\n  return true;\n}\n\n\/\/-------------------------------------------------------------------------------------------------\nbool Application::Destroy()\n{\n  \/\/ Shut down SDL\n  SDL_Quit();\n\n  return true;\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2017-2018 Baidu 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 \"openrasp.h\"\n#include \"openrasp_ini.h\"\n\nextern \"C\"\n{\n#ifdef HAVE_CONFIG_H\n#include \"config.h\"\n#endif\n#include \"php.h\"\n#include \"php_ini.h\"\n#include \"ext\/standard\/info.h\"\n}\n#include \"openrasp_log.h\"\n#include \"openrasp_v8.h\"\n#include \"openrasp_hook.h\"\n#include \"openrasp_inject.h\"\n#include \"openrasp_security_policy.h\"\n#include \"openrasp_fswatch.h\"\n#include <new>\n#include \"agent\/openrasp_agent_manager.h\"\n\nZEND_DECLARE_MODULE_GLOBALS(openrasp);\n\nbool is_initialized = false;\nstatic bool make_openrasp_root_dir(TSRMLS_D);\n\nPHP_INI_BEGIN()\nPHP_INI_ENTRY1(\"openrasp.root_dir\", nullptr, PHP_INI_SYSTEM, OnUpdateOpenraspCString, &openrasp_ini.root_dir)\n#ifdef HAVE_GETTEXT\nPHP_INI_ENTRY1(\"openrasp.locale\", nullptr, PHP_INI_SYSTEM, OnUpdateOpenraspCString, &openrasp_ini.locale)\n#endif\nPHP_INI_ENTRY1(\"openrasp.block_url\", \"https:\/\/rasp.baidu.com\/blocked\/\", PHP_INI_SYSTEM, OnUpdateOpenraspCString, &openrasp_ini.block_url)\nPHP_INI_ENTRY1(\"openrasp.slowquery_min_rows\", \"500\", PHP_INI_SYSTEM, OnUpdateOpenraspIntGEZero, &openrasp_ini.slowquery_min_rows)\nPHP_INI_ENTRY1(\"openrasp.enforce_policy\", \"0\", PHP_INI_SYSTEM, OnUpdateOpenraspBool, &openrasp_ini.enforce_policy)\nPHP_INI_ENTRY1(\"openrasp.hooks_ignore\", nullptr, PHP_INI_SYSTEM, OnUpdateOpenraspSet, &openrasp_ini.hooks_ignore)\nPHP_INI_ENTRY1(\"openrasp.callable_blacklists\", \"system,exec,passthru,proc_open,shell_exec,popen,pcntl_exec,assert\", PHP_INI_SYSTEM, OnUpdateOpenraspSet, &openrasp_ini.callable_blacklists)\nPHP_INI_ENTRY1(\"openrasp.inject_urlprefix\", nullptr, PHP_INI_SYSTEM, OnUpdateOpenraspCString, &openrasp_ini.inject_html_urlprefix)\nPHP_INI_ENTRY1(\"openrasp.log_maxburst\", \"100\", PHP_INI_SYSTEM, OnUpdateOpenraspIntGEZero, &openrasp_ini.log_maxburst)\nPHP_INI_ENTRY1(\"openrasp.syslog_server_address\", nullptr, PHP_INI_SYSTEM, OnUpdateOpenraspCString, &openrasp_ini.syslog_server_address)\nPHP_INI_ENTRY1(\"openrasp.syslog_facility\", \"1\", PHP_INI_SYSTEM, OnUpdateOpenraspIntGEZero, &openrasp_ini.syslog_facility)\nPHP_INI_ENTRY1(\"openrasp.syslog_alarm_enable\", \"0\", PHP_INI_SYSTEM, OnUpdateOpenraspBool, &openrasp_ini.syslog_alarm_enable)\nPHP_INI_ENTRY1(\"openrasp.syslog_connection_timeout\", \"50\", PHP_INI_SYSTEM, OnUpdateOpenraspIntGEZero, &openrasp_ini.syslog_connection_timeout)\nPHP_INI_ENTRY1(\"openrasp.syslog_read_timeout\", \"10\", PHP_INI_SYSTEM, OnUpdateOpenraspIntGEZero, &openrasp_ini.syslog_read_timeout)\nPHP_INI_ENTRY1(\"openrasp.syslog_connection_retry_interval\", \"300\", PHP_INI_SYSTEM, OnUpdateOpenraspIntGEZero, &openrasp_ini.syslog_connection_retry_interval)\nPHP_INI_ENTRY1(\"openrasp.timeout_ms\", \"100\", PHP_INI_SYSTEM, OnUpdateOpenraspIntGEZero, &openrasp_ini.timeout_ms)\nPHP_INI_ENTRY1(\"openrasp.block_status_code\", \"302\", PHP_INI_SYSTEM, OnUpdateOpenraspIntGEZero, &openrasp_ini.block_status_code)\nPHP_INI_ENTRY1(\"openrasp.plugin_maxstack\", \"100\", PHP_INI_SYSTEM, OnUpdateOpenraspIntGEZero, &openrasp_ini.plugin_maxstack)\nPHP_INI_ENTRY1(\"openrasp.log_maxstack\", \"10\", PHP_INI_SYSTEM, OnUpdateOpenraspIntGEZero, &openrasp_ini.log_maxstack)\nPHP_INI_ENTRY1(\"openrasp.backend\", \"http:\/\/172.23.232.153:8086\", PHP_INI_SYSTEM, OnUpdateOpenraspCString, &openrasp_ini.backend)\nPHP_INI_ENTRY1(\"openrasp.plugin_update_interval\", \"60\", PHP_INI_SYSTEM, OnUpdateOpenraspIntGEZero, &openrasp_ini.plugin_update_interval)\nPHP_INI_ENTRY1(\"openrasp.log_push_interval\", \"10\", PHP_INI_SYSTEM, OnUpdateOpenraspIntGEZero, &openrasp_ini.log_push_interval)\nPHP_INI_ENTRY1(\"openrasp.clientip_header\", \"http_clientip\", PHP_INI_SYSTEM, OnUpdateOpenraspCString, &openrasp_ini.clientip_header)\nPHP_INI_END()\n\nPHP_GINIT_FUNCTION(openrasp)\n{\n#ifdef ZTS\n    new (openrasp_globals) _zend_openrasp_globals;\n#endif\n}\n\nPHP_GSHUTDOWN_FUNCTION(openrasp)\n{\n#ifdef ZTS\n    openrasp_globals->~_zend_openrasp_globals();\n#endif\n}\n\nPHP_MINIT_FUNCTION(openrasp)\n{\n    ZEND_INIT_MODULE_GLOBALS(openrasp, PHP_GINIT(openrasp), PHP_GSHUTDOWN(openrasp));\n    REGISTER_INI_ENTRIES();\n    if (!make_openrasp_root_dir(TSRMLS_C))\n    {\n        openrasp_error(E_WARNING, CONFIG_ERROR, _(\"openrasp.root_dir is not configured correctly in php.ini (not empty, not root path, not relative path and must be writable), continuing without security protection\"));\n        return SUCCESS;\n    }\n    if (PHP_MINIT(openrasp_log)(INIT_FUNC_ARGS_PASSTHRU) == FAILURE)\n    {\n        return SUCCESS;\n    }\n    if (PHP_MINIT(openrasp_v8)(INIT_FUNC_ARGS_PASSTHRU) == FAILURE)\n    {\n        return SUCCESS;\n    }\n    int result;\n    result = PHP_MINIT(openrasp_hook)(INIT_FUNC_ARGS_PASSTHRU);\n    result = PHP_MINIT(openrasp_inject)(INIT_FUNC_ARGS_PASSTHRU);\n    result = PHP_MINIT(openrasp_security_policy)(INIT_FUNC_ARGS_PASSTHRU);\n    openrasp::oam.startup();\n    \/\/ result = PHP_MINIT(openrasp_fswatch)(INIT_FUNC_ARGS_PASSTHRU);\n    is_initialized = true;\n    return SUCCESS;\n}\n\nPHP_MSHUTDOWN_FUNCTION(openrasp)\n{\n    if (is_initialized)\n    {\n        int result;\n        \/\/ result = PHP_MSHUTDOWN(openrasp_fswatch)(SHUTDOWN_FUNC_ARGS_PASSTHRU);\n        result = PHP_MSHUTDOWN(openrasp_inject)(SHUTDOWN_FUNC_ARGS_PASSTHRU);\n        result = PHP_MSHUTDOWN(openrasp_hook)(SHUTDOWN_FUNC_ARGS_PASSTHRU);\n        result = PHP_MSHUTDOWN(openrasp_v8)(SHUTDOWN_FUNC_ARGS_PASSTHRU);\n        result = PHP_MSHUTDOWN(openrasp_log)(SHUTDOWN_FUNC_ARGS_PASSTHRU);\n    }\n    openrasp::oam.shutdown();\n    UNREGISTER_INI_ENTRIES();\n    ZEND_SHUTDOWN_MODULE_GLOBALS(openrasp, PHP_GSHUTDOWN(openrasp));\n    return SUCCESS;\n}\n\nPHP_RINIT_FUNCTION(openrasp)\n{\n    \t\tstd::string a = std::to_string(getppid());\n\t\trasp_info(a.c_str(), a.size() TSRMLS_CC);\n    if (is_initialized)\n    {\n        int result;\n        \/\/ openrasp_inject must be called before openrasp_log cuz of request_id\n        result = PHP_RINIT(openrasp_inject)(INIT_FUNC_ARGS_PASSTHRU);\n        result = PHP_RINIT(openrasp_log)(INIT_FUNC_ARGS_PASSTHRU);\n    }\n    return SUCCESS;\n}\n\nPHP_RSHUTDOWN_FUNCTION(openrasp)\n{\n    if (is_initialized)\n    {\n        int result;\n        result = PHP_RSHUTDOWN(openrasp_log)(SHUTDOWN_FUNC_ARGS_PASSTHRU);\n        result = PHP_RSHUTDOWN(openrasp_inject)(SHUTDOWN_FUNC_ARGS_PASSTHRU);\n    }\n    return SUCCESS;\n}\n\nPHP_MINFO_FUNCTION(openrasp)\n{\n    php_info_print_table_start();\n    php_info_print_table_row(2, \"Status\", is_initialized ? \"Protected\" : \"Unprotected, Initialization Failed\");\n#ifdef OPENRASP_COMMIT_ID\n    php_info_print_table_row(2, \"Version\", OPENRASP_COMMIT_ID);\n#else\n    php_info_print_table_row(2, \"Version\", \"\");\n#endif\n    php_info_print_table_row(2, \"V8 Version\", ZEND_TOSTR(V8_MAJOR_VERSION) \".\" ZEND_TOSTR(V8_MINOR_VERSION));\n#ifdef HAVE_NATIVE_ANTLR4\n    php_info_print_table_row(2, \"Antlr Version\", antlr4::RuntimeMetaData::VERSION.c_str());\n#else\n    php_info_print_table_row(2, \"Antlr Version\", \"4.7.1 (JavaScript Runtime)\");\n#endif\n    php_info_print_table_end();\n    DISPLAY_INI_ENTRIES();\n}\n\n\/**  module depends\n *\/\n#if ZEND_MODULE_API_NO >= 20050922\nzend_module_dep openrasp_deps[] = {\n    ZEND_MOD_REQUIRED(\"standard\")\n        ZEND_MOD_REQUIRED(\"json\")\n            ZEND_MOD_CONFLICTS(\"xdebug\")\n                ZEND_MOD_END};\n#endif\n\nzend_module_entry openrasp_module_entry = {\n#if ZEND_MODULE_API_NO >= 20050922\n    STANDARD_MODULE_HEADER_EX,\n    NULL,\n    openrasp_deps,\n#else\n    STANDARD_MODULE_HEADER,\n#endif\n    \"openrasp\",\n    NULL,\n    PHP_MINIT(openrasp),\n    PHP_MSHUTDOWN(openrasp),\n    PHP_RINIT(openrasp),\n    PHP_RSHUTDOWN(openrasp),\n    PHP_MINFO(openrasp),\n    PHP_OPENRASP_VERSION,\n    STANDARD_MODULE_PROPERTIES};\n\n#ifdef COMPILE_DL_OPENRASP\nZEND_GET_MODULE(openrasp)\n#endif\n\nstatic bool make_openrasp_root_dir(TSRMLS_D)\n{\n    char *path = openrasp_ini.root_dir;\n    if (!path || !IS_ABSOLUTE_PATH(path, strlen(path)))\n    {\n        return false;\n    }\n    path = expand_filepath(path, nullptr TSRMLS_CC);\n    if (!path || strnlen(path, 2) == 1)\n    {\n        efree(path);\n        return false;\n    }\n    std::string root_dir(path);\n    std::string default_slash(1, DEFAULT_SLASH);\n    efree(path);\n    std::vector<std::string> sub_dir_list{\n        \"assets\",\n        \"conf\",\n        \"plugins\",\n        \"locale\",\n        \"logs\" + default_slash + ALARM_LOG_DIR_NAME,\n        \"logs\" + default_slash + POLICY_LOG_DIR_NAME,\n        \"logs\" + default_slash + PLUGIN_LOG_DIR_NAME,\n        \"logs\" + default_slash + RASP_LOG_DIR_NAME};\n    for (auto dir : sub_dir_list)\n    {\n        std::string path(root_dir + DEFAULT_SLASH + dir);\n        if (!recursive_mkdir(path.c_str(), path.length(), 0777 TSRMLS_CC))\n        {\n            return false;\n        }\n    }\n#ifdef HAVE_GETTEXT\n    if (nullptr != setlocale(LC_ALL, openrasp_ini.locale ? openrasp_ini.locale : \"\"))\n    {\n        std::string locale_path(root_dir + DEFAULT_SLASH + \"locale\" + DEFAULT_SLASH);\n        if (!bindtextdomain(GETTEXT_PACKAGE, locale_path.c_str()))\n        {\n            openrasp_error(E_WARNING, CONFIG_ERROR, _(\"bindtextdomain() failed: %s\"), strerror(errno));\n        }\n        if (!textdomain(GETTEXT_PACKAGE))\n        {\n            openrasp_error(E_WARNING, CONFIG_ERROR, _(\"textdomain() failed: %s\"), strerror(errno));\n        }\n    }\n    else\n    {\n        openrasp_error(E_WARNING, CONFIG_ERROR, _(\"Unable to set OpenRASP locale to %s\"), openrasp_ini.locale);\n    }\n#endif\n    return true;\n}<commit_msg>[PHP]remove debug info<commit_after>\/*\n * Copyright 2017-2018 Baidu 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 \"openrasp.h\"\n#include \"openrasp_ini.h\"\n\nextern \"C\"\n{\n#ifdef HAVE_CONFIG_H\n#include \"config.h\"\n#endif\n#include \"php.h\"\n#include \"php_ini.h\"\n#include \"ext\/standard\/info.h\"\n}\n#include \"openrasp_log.h\"\n#include \"openrasp_v8.h\"\n#include \"openrasp_hook.h\"\n#include \"openrasp_inject.h\"\n#include \"openrasp_security_policy.h\"\n#include \"openrasp_fswatch.h\"\n#include <new>\n#include \"agent\/openrasp_agent_manager.h\"\n\nZEND_DECLARE_MODULE_GLOBALS(openrasp);\n\nbool is_initialized = false;\nstatic bool make_openrasp_root_dir(TSRMLS_D);\n\nPHP_INI_BEGIN()\nPHP_INI_ENTRY1(\"openrasp.root_dir\", nullptr, PHP_INI_SYSTEM, OnUpdateOpenraspCString, &openrasp_ini.root_dir)\n#ifdef HAVE_GETTEXT\nPHP_INI_ENTRY1(\"openrasp.locale\", nullptr, PHP_INI_SYSTEM, OnUpdateOpenraspCString, &openrasp_ini.locale)\n#endif\nPHP_INI_ENTRY1(\"openrasp.block_url\", \"https:\/\/rasp.baidu.com\/blocked\/\", PHP_INI_SYSTEM, OnUpdateOpenraspCString, &openrasp_ini.block_url)\nPHP_INI_ENTRY1(\"openrasp.slowquery_min_rows\", \"500\", PHP_INI_SYSTEM, OnUpdateOpenraspIntGEZero, &openrasp_ini.slowquery_min_rows)\nPHP_INI_ENTRY1(\"openrasp.enforce_policy\", \"0\", PHP_INI_SYSTEM, OnUpdateOpenraspBool, &openrasp_ini.enforce_policy)\nPHP_INI_ENTRY1(\"openrasp.hooks_ignore\", nullptr, PHP_INI_SYSTEM, OnUpdateOpenraspSet, &openrasp_ini.hooks_ignore)\nPHP_INI_ENTRY1(\"openrasp.callable_blacklists\", \"system,exec,passthru,proc_open,shell_exec,popen,pcntl_exec,assert\", PHP_INI_SYSTEM, OnUpdateOpenraspSet, &openrasp_ini.callable_blacklists)\nPHP_INI_ENTRY1(\"openrasp.inject_urlprefix\", nullptr, PHP_INI_SYSTEM, OnUpdateOpenraspCString, &openrasp_ini.inject_html_urlprefix)\nPHP_INI_ENTRY1(\"openrasp.log_maxburst\", \"100\", PHP_INI_SYSTEM, OnUpdateOpenraspIntGEZero, &openrasp_ini.log_maxburst)\nPHP_INI_ENTRY1(\"openrasp.syslog_server_address\", nullptr, PHP_INI_SYSTEM, OnUpdateOpenraspCString, &openrasp_ini.syslog_server_address)\nPHP_INI_ENTRY1(\"openrasp.syslog_facility\", \"1\", PHP_INI_SYSTEM, OnUpdateOpenraspIntGEZero, &openrasp_ini.syslog_facility)\nPHP_INI_ENTRY1(\"openrasp.syslog_alarm_enable\", \"0\", PHP_INI_SYSTEM, OnUpdateOpenraspBool, &openrasp_ini.syslog_alarm_enable)\nPHP_INI_ENTRY1(\"openrasp.syslog_connection_timeout\", \"50\", PHP_INI_SYSTEM, OnUpdateOpenraspIntGEZero, &openrasp_ini.syslog_connection_timeout)\nPHP_INI_ENTRY1(\"openrasp.syslog_read_timeout\", \"10\", PHP_INI_SYSTEM, OnUpdateOpenraspIntGEZero, &openrasp_ini.syslog_read_timeout)\nPHP_INI_ENTRY1(\"openrasp.syslog_connection_retry_interval\", \"300\", PHP_INI_SYSTEM, OnUpdateOpenraspIntGEZero, &openrasp_ini.syslog_connection_retry_interval)\nPHP_INI_ENTRY1(\"openrasp.timeout_ms\", \"100\", PHP_INI_SYSTEM, OnUpdateOpenraspIntGEZero, &openrasp_ini.timeout_ms)\nPHP_INI_ENTRY1(\"openrasp.block_status_code\", \"302\", PHP_INI_SYSTEM, OnUpdateOpenraspIntGEZero, &openrasp_ini.block_status_code)\nPHP_INI_ENTRY1(\"openrasp.plugin_maxstack\", \"100\", PHP_INI_SYSTEM, OnUpdateOpenraspIntGEZero, &openrasp_ini.plugin_maxstack)\nPHP_INI_ENTRY1(\"openrasp.log_maxstack\", \"10\", PHP_INI_SYSTEM, OnUpdateOpenraspIntGEZero, &openrasp_ini.log_maxstack)\nPHP_INI_ENTRY1(\"openrasp.backend\", \"http:\/\/172.23.232.153:8086\", PHP_INI_SYSTEM, OnUpdateOpenraspCString, &openrasp_ini.backend)\nPHP_INI_ENTRY1(\"openrasp.plugin_update_interval\", \"60\", PHP_INI_SYSTEM, OnUpdateOpenraspIntGEZero, &openrasp_ini.plugin_update_interval)\nPHP_INI_ENTRY1(\"openrasp.log_push_interval\", \"10\", PHP_INI_SYSTEM, OnUpdateOpenraspIntGEZero, &openrasp_ini.log_push_interval)\nPHP_INI_ENTRY1(\"openrasp.clientip_header\", \"http_clientip\", PHP_INI_SYSTEM, OnUpdateOpenraspCString, &openrasp_ini.clientip_header)\nPHP_INI_END()\n\nPHP_GINIT_FUNCTION(openrasp)\n{\n#ifdef ZTS\n    new (openrasp_globals) _zend_openrasp_globals;\n#endif\n}\n\nPHP_GSHUTDOWN_FUNCTION(openrasp)\n{\n#ifdef ZTS\n    openrasp_globals->~_zend_openrasp_globals();\n#endif\n}\n\nPHP_MINIT_FUNCTION(openrasp)\n{\n    ZEND_INIT_MODULE_GLOBALS(openrasp, PHP_GINIT(openrasp), PHP_GSHUTDOWN(openrasp));\n    REGISTER_INI_ENTRIES();\n    if (!make_openrasp_root_dir(TSRMLS_C))\n    {\n        openrasp_error(E_WARNING, CONFIG_ERROR, _(\"openrasp.root_dir is not configured correctly in php.ini (not empty, not root path, not relative path and must be writable), continuing without security protection\"));\n        return SUCCESS;\n    }\n    if (PHP_MINIT(openrasp_log)(INIT_FUNC_ARGS_PASSTHRU) == FAILURE)\n    {\n        return SUCCESS;\n    }\n    if (PHP_MINIT(openrasp_v8)(INIT_FUNC_ARGS_PASSTHRU) == FAILURE)\n    {\n        return SUCCESS;\n    }\n    int result;\n    result = PHP_MINIT(openrasp_hook)(INIT_FUNC_ARGS_PASSTHRU);\n    result = PHP_MINIT(openrasp_inject)(INIT_FUNC_ARGS_PASSTHRU);\n    result = PHP_MINIT(openrasp_security_policy)(INIT_FUNC_ARGS_PASSTHRU);\n    openrasp::oam.startup();\n    \/\/ result = PHP_MINIT(openrasp_fswatch)(INIT_FUNC_ARGS_PASSTHRU);\n    is_initialized = true;\n    return SUCCESS;\n}\n\nPHP_MSHUTDOWN_FUNCTION(openrasp)\n{\n    if (is_initialized)\n    {\n        int result;\n        \/\/ result = PHP_MSHUTDOWN(openrasp_fswatch)(SHUTDOWN_FUNC_ARGS_PASSTHRU);\n        result = PHP_MSHUTDOWN(openrasp_inject)(SHUTDOWN_FUNC_ARGS_PASSTHRU);\n        result = PHP_MSHUTDOWN(openrasp_hook)(SHUTDOWN_FUNC_ARGS_PASSTHRU);\n        result = PHP_MSHUTDOWN(openrasp_v8)(SHUTDOWN_FUNC_ARGS_PASSTHRU);\n        result = PHP_MSHUTDOWN(openrasp_log)(SHUTDOWN_FUNC_ARGS_PASSTHRU);\n    }\n    openrasp::oam.shutdown();\n    UNREGISTER_INI_ENTRIES();\n    ZEND_SHUTDOWN_MODULE_GLOBALS(openrasp, PHP_GSHUTDOWN(openrasp));\n    return SUCCESS;\n}\n\nPHP_RINIT_FUNCTION(openrasp)\n{\n    if (is_initialized)\n    {\n        int result;\n        \/\/ openrasp_inject must be called before openrasp_log cuz of request_id\n        result = PHP_RINIT(openrasp_inject)(INIT_FUNC_ARGS_PASSTHRU);\n        result = PHP_RINIT(openrasp_log)(INIT_FUNC_ARGS_PASSTHRU);\n    }\n    return SUCCESS;\n}\n\nPHP_RSHUTDOWN_FUNCTION(openrasp)\n{\n    if (is_initialized)\n    {\n        int result;\n        result = PHP_RSHUTDOWN(openrasp_log)(SHUTDOWN_FUNC_ARGS_PASSTHRU);\n        result = PHP_RSHUTDOWN(openrasp_inject)(SHUTDOWN_FUNC_ARGS_PASSTHRU);\n    }\n    return SUCCESS;\n}\n\nPHP_MINFO_FUNCTION(openrasp)\n{\n    php_info_print_table_start();\n    php_info_print_table_row(2, \"Status\", is_initialized ? \"Protected\" : \"Unprotected, Initialization Failed\");\n#ifdef OPENRASP_COMMIT_ID\n    php_info_print_table_row(2, \"Version\", OPENRASP_COMMIT_ID);\n#else\n    php_info_print_table_row(2, \"Version\", \"\");\n#endif\n    php_info_print_table_row(2, \"V8 Version\", ZEND_TOSTR(V8_MAJOR_VERSION) \".\" ZEND_TOSTR(V8_MINOR_VERSION));\n#ifdef HAVE_NATIVE_ANTLR4\n    php_info_print_table_row(2, \"Antlr Version\", antlr4::RuntimeMetaData::VERSION.c_str());\n#else\n    php_info_print_table_row(2, \"Antlr Version\", \"4.7.1 (JavaScript Runtime)\");\n#endif\n    php_info_print_table_end();\n    DISPLAY_INI_ENTRIES();\n}\n\n\/**  module depends\n *\/\n#if ZEND_MODULE_API_NO >= 20050922\nzend_module_dep openrasp_deps[] = {\n    ZEND_MOD_REQUIRED(\"standard\")\n        ZEND_MOD_REQUIRED(\"json\")\n            ZEND_MOD_CONFLICTS(\"xdebug\")\n                ZEND_MOD_END};\n#endif\n\nzend_module_entry openrasp_module_entry = {\n#if ZEND_MODULE_API_NO >= 20050922\n    STANDARD_MODULE_HEADER_EX,\n    NULL,\n    openrasp_deps,\n#else\n    STANDARD_MODULE_HEADER,\n#endif\n    \"openrasp\",\n    NULL,\n    PHP_MINIT(openrasp),\n    PHP_MSHUTDOWN(openrasp),\n    PHP_RINIT(openrasp),\n    PHP_RSHUTDOWN(openrasp),\n    PHP_MINFO(openrasp),\n    PHP_OPENRASP_VERSION,\n    STANDARD_MODULE_PROPERTIES};\n\n#ifdef COMPILE_DL_OPENRASP\nZEND_GET_MODULE(openrasp)\n#endif\n\nstatic bool make_openrasp_root_dir(TSRMLS_D)\n{\n    char *path = openrasp_ini.root_dir;\n    if (!path || !IS_ABSOLUTE_PATH(path, strlen(path)))\n    {\n        return false;\n    }\n    path = expand_filepath(path, nullptr TSRMLS_CC);\n    if (!path || strnlen(path, 2) == 1)\n    {\n        efree(path);\n        return false;\n    }\n    std::string root_dir(path);\n    std::string default_slash(1, DEFAULT_SLASH);\n    efree(path);\n    std::vector<std::string> sub_dir_list{\n        \"assets\",\n        \"conf\",\n        \"plugins\",\n        \"locale\",\n        \"logs\" + default_slash + ALARM_LOG_DIR_NAME,\n        \"logs\" + default_slash + POLICY_LOG_DIR_NAME,\n        \"logs\" + default_slash + PLUGIN_LOG_DIR_NAME,\n        \"logs\" + default_slash + RASP_LOG_DIR_NAME};\n    for (auto dir : sub_dir_list)\n    {\n        std::string path(root_dir + DEFAULT_SLASH + dir);\n        if (!recursive_mkdir(path.c_str(), path.length(), 0777 TSRMLS_CC))\n        {\n            return false;\n        }\n    }\n#ifdef HAVE_GETTEXT\n    if (nullptr != setlocale(LC_ALL, openrasp_ini.locale ? openrasp_ini.locale : \"\"))\n    {\n        std::string locale_path(root_dir + DEFAULT_SLASH + \"locale\" + DEFAULT_SLASH);\n        if (!bindtextdomain(GETTEXT_PACKAGE, locale_path.c_str()))\n        {\n            openrasp_error(E_WARNING, CONFIG_ERROR, _(\"bindtextdomain() failed: %s\"), strerror(errno));\n        }\n        if (!textdomain(GETTEXT_PACKAGE))\n        {\n            openrasp_error(E_WARNING, CONFIG_ERROR, _(\"textdomain() failed: %s\"), strerror(errno));\n        }\n    }\n    else\n    {\n        openrasp_error(E_WARNING, CONFIG_ERROR, _(\"Unable to set OpenRASP locale to %s\"), openrasp_ini.locale);\n    }\n#endif\n    return true;\n}<|endoftext|>"}
{"text":"<commit_before>\/\/===--- swift-syntax-test.cpp - Reflection Syntax testing application ----===\/\/\n\/\/\n\/\/ This source file is part of the Swift.org open source project\n\/\/\n\/\/ Copyright (c) 2014 - 2017 Apple Inc. and the Swift project authors\n\/\/ Licensed under Apache License v2.0 with Runtime Library Exception\n\/\/\n\/\/ See https:\/\/swift.org\/LICENSE.txt for license information\n\/\/ See https:\/\/swift.org\/CONTRIBUTORS.txt for the list of Swift project authors\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This is a host-side tool to perform round-trip testing of \"full-fidelity\"\n\/\/ lexing and parsing. That is, when this application ingests a .swift file,\n\/\/ it should be able to create a list of full tokens, or a full-fidelity AST,\n\/\/ print them, and get the same file back out. This ensures that we aren't\n\/\/ losing any source information in these structures.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"swift\/AST\/DiagnosticEngine.h\"\n#include \"swift\/AST\/DiagnosticsFrontend.h\"\n#include \"swift\/Basic\/LangOptions.h\"\n#include \"swift\/Basic\/SourceManager.h\"\n#include \"swift\/Frontend\/Frontend.h\"\n#include \"swift\/Frontend\/PrintingDiagnosticConsumer.h\"\n#include \"swift\/Parse\/Lexer.h\"\n#include \"swift\/Parse\/Parser.h\"\n#include \"swift\/Subsystems.h\"\n#include \"swift\/Syntax\/Serialization\/SyntaxSerialization.h\"\n#include \"swift\/Syntax\/SyntaxData.h\"\n#include \"swift\/Syntax\/SyntaxNodes.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/FileSystem.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\nusing namespace swift;\nusing namespace swift::syntax;\nusing llvm::StringRef;\n\nenum class ActionType {\n  DumpRawTokenSyntax,\n  FullLexRoundTrip,\n  FullParseRoundTrip,\n  SerializeRawTree,\n  ParserGen,\n  EOFPos,\n  None\n};\n\nnamespace options {\nstatic llvm::cl::OptionCategory Category(\"swift-syntax-test Options\");\nstatic llvm::cl::opt<ActionType>\nAction(llvm::cl::desc(\"Action (required):\"),\n       llvm::cl::init(ActionType::None),\n       llvm::cl::values(\n        clEnumValN(ActionType::DumpRawTokenSyntax,\n                   \"dump-full-tokens\",\n                   \"Lex the source file and dump the tokens \"\n                   \"and their absolute line\/column locations\"),\n        clEnumValN(ActionType::FullLexRoundTrip,\n                   \"round-trip-lex\",\n                   \"Lex the source file and print it back out for \"\n                   \"comparing against the original\"),\n        clEnumValN(ActionType::FullParseRoundTrip,\n                   \"round-trip-parse\",\n                   \"Parse the source file and print it back out for \"\n                   \"comparing against the input\"),\n        clEnumValN(ActionType::ParserGen,\n                   \"parse-gen\",\n                   \"Parse the source file and print it back out for \"\n                   \"comparing against the input\"),\n        clEnumValN(ActionType::SerializeRawTree,\n                   \"serialize-raw-tree\",\n                   \"Parse the source file and serialize the raw tree\"\n                   \"to JSON\"),\n        clEnumValN(ActionType::EOFPos,\n                   \"eof\",\n                   \"Parse the source file, calculate the absolute position\"\n                   \"of the EOF token, and dump the buffer from the start of the\"\n                   \"file to the EOF token\")));\n\nstatic llvm::cl::opt<std::string>\nInputSourceFilename(\"input-source-filename\",\n                    llvm::cl::desc(\"Path to the input .swift file\"));\n\nstatic llvm::cl::opt<bool>\nPrintNodeKind(\"print-node-kind\",\n              llvm::cl::desc(\"To print syntax node kind\"),\n              llvm::cl::cat(Category),\n              llvm::cl::init(false));\n\nstatic llvm::cl::opt<bool>\nPrintTrivialNodeKind(\"print-trivial-node-kind\",\n                     llvm::cl::desc(\"To print trivial syntax node kind\"),\n                     llvm::cl::cat(Category),\n                     llvm::cl::init(false));\n\nstatic llvm::cl::opt<bool>\nVisual(\"v\",\n       llvm::cl::desc(\"Print visually\"),\n       llvm::cl::cat(Category),\n       llvm::cl::init(false));\n} \/\/ end namespace options\n\nnamespace {\nint getTokensFromFile(unsigned BufferID,\n                      LangOptions &LangOpts,\n                      SourceManager &SourceMgr,\n                      DiagnosticEngine &Diags,\n                      std::vector<std::pair<RC<syntax::RawTokenSyntax>,\n                      syntax::AbsolutePosition>> &Tokens) {\n  Tokens = tokenizeWithTrivia(LangOpts, SourceMgr, BufferID);\n  return Diags.hadAnyError() ? EXIT_FAILURE : EXIT_SUCCESS;\n}\n\n\nint\ngetTokensFromFile(const StringRef InputFilename,\n                  LangOptions &LangOpts,\n                  SourceManager &SourceMgr,\n                  DiagnosticEngine &Diags,\n                  std::vector<std::pair<RC<syntax::RawTokenSyntax>,\n                                        syntax::AbsolutePosition>> &Tokens) {\n  auto Buffer = llvm::MemoryBuffer::getFile(InputFilename);\n  if (!Buffer) {\n    Diags.diagnose(SourceLoc(), diag::cannot_open_file,\n                   InputFilename, Buffer.getError().message());\n    return EXIT_FAILURE;\n  }\n\n  auto BufferID = SourceMgr.addNewSourceBuffer(std::move(Buffer.get()));\n  return getTokensFromFile(BufferID, LangOpts, SourceMgr, Diags, Tokens);\n}\n\nvoid anchorForGetMainExecutable() {}\n\n\nSourceFile *getSourceFile(CompilerInstance &Instance,\n                          StringRef InputFileName,\n                          const char *MainExecutablePath) {\n  CompilerInvocation Invocation;\n  Invocation.getLangOptions().KeepSyntaxInfoInSourceFile = true;\n  Invocation.getFrontendOptions().Inputs.addInputFile(InputFileName);\n  Invocation.setMainExecutablePath(\n    llvm::sys::fs::getMainExecutable(MainExecutablePath,\n      reinterpret_cast<void *>(&anchorForGetMainExecutable)));\n\n  Invocation.setModuleName(\"Test\");\n  PrintingDiagnosticConsumer DiagPrinter;\n  Instance.addDiagnosticConsumer(&DiagPrinter);\n  if (Instance.setup(Invocation)) {\n    return nullptr;\n  }\n\n  \/\/ First, parse the file normally and get the regular old AST.\n  Instance.performParseOnly();\n\n  SourceFile *SF = nullptr;\n  for (auto Unit : Instance.getMainModule()->getFiles()) {\n    SF = dyn_cast<SourceFile>(Unit);\n    if (SF != nullptr) {\n      break;\n    }\n  }\n  assert(SF && \"No source file\");\n  return SF;\n}\n\nint doFullLexRoundTrip(const StringRef InputFilename) {\n  LangOptions LangOpts;\n  SourceManager SourceMgr;\n  DiagnosticEngine Diags(SourceMgr);\n  PrintingDiagnosticConsumer DiagPrinter;\n  Diags.addConsumer(DiagPrinter);\n\n  std::vector<std::pair<RC<syntax::RawTokenSyntax>,\n                                   syntax::AbsolutePosition>> Tokens;\n  if (getTokensFromFile(InputFilename, LangOpts, SourceMgr,\n                        Diags, Tokens) == EXIT_FAILURE) {\n    return EXIT_FAILURE;\n  }\n\n  for (auto TokAndPos : Tokens) {\n    TokAndPos.first->print(llvm::outs());\n  }\n\n  return Diags.hadAnyError() ? EXIT_FAILURE : EXIT_SUCCESS;\n}\n\nint doDumpRawTokenSyntax(const StringRef InputFilename) {\n  LangOptions LangOpts;\n  SourceManager SourceMgr;\n  DiagnosticEngine Diags(SourceMgr);\n  PrintingDiagnosticConsumer DiagPrinter;\n  Diags.addConsumer(DiagPrinter);\n\n  std::vector<std::pair<RC<syntax::RawTokenSyntax>,\n                        syntax::AbsolutePosition>> Tokens;\n  if (getTokensFromFile(InputFilename, LangOpts, SourceMgr,\n                        Diags, Tokens) == EXIT_FAILURE) {\n    return EXIT_FAILURE;\n  }\n\n  for (auto TokAndPos : Tokens) {\n    TokAndPos.second.printLineAndColumn(llvm::outs());\n    llvm::outs() << \"\\n\";\n    TokAndPos.first->dump(llvm::outs());\n    llvm::outs() << \"\\n\";\n  }\n\n  return Diags.hadAnyError() ? EXIT_FAILURE : EXIT_SUCCESS;\n}\n\nint doFullParseRoundTrip(const char *MainExecutablePath,\n                         const StringRef InputFileName) {\n  CompilerInstance Instance;\n  SourceFile *SF = getSourceFile(Instance, InputFileName, MainExecutablePath);\n  SF->getSyntaxRoot().print(llvm::outs(), {});\n  return EXIT_SUCCESS;\n}\n\nint doSerializeRawTree(const char *MainExecutablePath,\n                       const StringRef InputFileName) {\n  CompilerInstance Instance;\n  SourceFile *SF = getSourceFile(Instance, InputFileName, MainExecutablePath);\n\n  auto Root = SF->getSyntaxRoot().getRaw();\n  swift::json::Output out(llvm::outs());\n  out << Root;\n  llvm::outs() << \"\\n\";\n\n  return EXIT_SUCCESS;\n}\n\nint dumpParserGen(const char *MainExecutablePath,\n                  const StringRef InputFileName) {\n  CompilerInstance Instance;\n  SourceFile *SF = getSourceFile(Instance, InputFileName, MainExecutablePath);\n  SyntaxPrintOptions Opts;\n  Opts.PrintSyntaxKind = options::PrintNodeKind;\n  Opts.Visual = options::Visual;\n  Opts.PrintTrivialNodeKind = options::PrintTrivialNodeKind;\n  SF->getSyntaxRoot().print(llvm::outs(), Opts);\n  return 0;\n}\n\nint dumpEOFSourceLoc(const char *MainExecutablePath,\n                     const StringRef InputFileName) {\n  CompilerInstance Instance;\n  SourceFile *SF = getSourceFile(Instance, InputFileName, MainExecutablePath);\n  auto BufferId = *SF->getBufferID();\n  SyntaxPrintOptions Opts;\n  auto Root = SF->getSyntaxRoot();\n  auto AbPos = Root.getEOFToken().getAbsolutePosition(Root);\n\n  SourceManager &SourceMgr = SF->getASTContext().SourceMgr;\n  auto StartLoc = SourceMgr.getLocForBufferStart(BufferId);\n  auto EndLoc = SourceMgr.getLocForOffset(BufferId, AbPos.getOffset());\n\n  \/\/ To ensure the correctness of position when translated to line & column pair.\n  if (SourceMgr.getLineAndColumn(EndLoc) != AbPos.getLineAndColumn()) {\n    llvm::outs() << \"locations should be identical\";\n    return EXIT_FAILURE;\n  }\n  llvm::outs() << CharSourceRange(SourceMgr, StartLoc, EndLoc).str();\n  return 0;\n}\n\n}\/\/ end of anonymous namespace\n\nint main(int argc, char *argv[]) {\n  llvm::cl::ParseCommandLineOptions(argc, argv, \"Swift Syntax Test\\n\");\n\n  int ExitCode = EXIT_SUCCESS;\n\n  if (options::InputSourceFilename.empty()) {\n    llvm::errs() << \"input source file is required\\n\";\n    ExitCode = EXIT_FAILURE;\n  }\n\n  if (ExitCode == EXIT_FAILURE) {\n    llvm::cl::PrintHelpMessage();\n    return ExitCode;\n  }\n\n  switch (options::Action) {\n  case ActionType::DumpRawTokenSyntax:\n    ExitCode = doDumpRawTokenSyntax(options::InputSourceFilename);\n    break;\n  case ActionType::FullLexRoundTrip:\n    ExitCode = doFullLexRoundTrip(options::InputSourceFilename);\n    break;\n  case ActionType::FullParseRoundTrip:\n    ExitCode = doFullParseRoundTrip(argv[0], options::InputSourceFilename);\n    break;\n  case ActionType::SerializeRawTree:\n    ExitCode = doSerializeRawTree(argv[0], options::InputSourceFilename);\n    break;\n  case ActionType::ParserGen:\n    ExitCode = dumpParserGen(argv[0], options::InputSourceFilename);\n    break;\n  case ActionType::EOFPos:\n    ExitCode = dumpEOFSourceLoc(argv[0], options::InputSourceFilename);\n    break;\n  case ActionType::None:\n    llvm::errs() << \"an action is required\\n\";\n    llvm::cl::PrintHelpMessage();\n    ExitCode = EXIT_FAILURE;\n    break;\n  }\n\n  return ExitCode;\n}\n<commit_msg>[Syntax] Add '-parse-only' option to 'swift-syntax-test' tool<commit_after>\/\/===--- swift-syntax-test.cpp - Reflection Syntax testing application ----===\/\/\n\/\/\n\/\/ This source file is part of the Swift.org open source project\n\/\/\n\/\/ Copyright (c) 2014 - 2017 Apple Inc. and the Swift project authors\n\/\/ Licensed under Apache License v2.0 with Runtime Library Exception\n\/\/\n\/\/ See https:\/\/swift.org\/LICENSE.txt for license information\n\/\/ See https:\/\/swift.org\/CONTRIBUTORS.txt for the list of Swift project authors\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This is a host-side tool to perform round-trip testing of \"full-fidelity\"\n\/\/ lexing and parsing. That is, when this application ingests a .swift file,\n\/\/ it should be able to create a list of full tokens, or a full-fidelity AST,\n\/\/ print them, and get the same file back out. This ensures that we aren't\n\/\/ losing any source information in these structures.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"swift\/AST\/DiagnosticEngine.h\"\n#include \"swift\/AST\/DiagnosticsFrontend.h\"\n#include \"swift\/Basic\/LangOptions.h\"\n#include \"swift\/Basic\/SourceManager.h\"\n#include \"swift\/Frontend\/Frontend.h\"\n#include \"swift\/Frontend\/PrintingDiagnosticConsumer.h\"\n#include \"swift\/Parse\/Lexer.h\"\n#include \"swift\/Parse\/Parser.h\"\n#include \"swift\/Subsystems.h\"\n#include \"swift\/Syntax\/Serialization\/SyntaxSerialization.h\"\n#include \"swift\/Syntax\/SyntaxData.h\"\n#include \"swift\/Syntax\/SyntaxNodes.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/FileSystem.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\nusing namespace swift;\nusing namespace swift::syntax;\nusing llvm::StringRef;\n\nenum class ActionType {\n  DumpRawTokenSyntax,\n  FullLexRoundTrip,\n  FullParseRoundTrip,\n  SerializeRawTree,\n  ParseOnly,\n  ParserGen,\n  EOFPos,\n  None\n};\n\nnamespace options {\nstatic llvm::cl::OptionCategory Category(\"swift-syntax-test Options\");\nstatic llvm::cl::opt<ActionType>\nAction(llvm::cl::desc(\"Action (required):\"),\n       llvm::cl::init(ActionType::None),\n       llvm::cl::values(\n        clEnumValN(ActionType::DumpRawTokenSyntax,\n                   \"dump-full-tokens\",\n                   \"Lex the source file and dump the tokens \"\n                   \"and their absolute line\/column locations\"),\n        clEnumValN(ActionType::FullLexRoundTrip,\n                   \"round-trip-lex\",\n                   \"Lex the source file and print it back out for \"\n                   \"comparing against the original\"),\n        clEnumValN(ActionType::FullParseRoundTrip,\n                   \"round-trip-parse\",\n                   \"Parse the source file and print it back out for \"\n                   \"comparing against the input\"),\n        clEnumValN(ActionType::ParseOnly,\n                   \"parse-only\",\n                   \"Parse the source file with syntax nodes and exit\"),\n        clEnumValN(ActionType::ParserGen,\n                   \"parse-gen\",\n                   \"Parse the source file and print it back out for \"\n                   \"comparing against the input\"),\n        clEnumValN(ActionType::SerializeRawTree,\n                   \"serialize-raw-tree\",\n                   \"Parse the source file and serialize the raw tree\"\n                   \"to JSON\"),\n        clEnumValN(ActionType::EOFPos,\n                   \"eof\",\n                   \"Parse the source file, calculate the absolute position\"\n                   \"of the EOF token, and dump the buffer from the start of the\"\n                   \"file to the EOF token\")));\n\nstatic llvm::cl::opt<std::string>\nInputSourceFilename(\"input-source-filename\",\n                    llvm::cl::desc(\"Path to the input .swift file\"));\n\nstatic llvm::cl::opt<bool>\nPrintNodeKind(\"print-node-kind\",\n              llvm::cl::desc(\"To print syntax node kind\"),\n              llvm::cl::cat(Category),\n              llvm::cl::init(false));\n\nstatic llvm::cl::opt<bool>\nPrintTrivialNodeKind(\"print-trivial-node-kind\",\n                     llvm::cl::desc(\"To print trivial syntax node kind\"),\n                     llvm::cl::cat(Category),\n                     llvm::cl::init(false));\n\nstatic llvm::cl::opt<bool>\nVisual(\"v\",\n       llvm::cl::desc(\"Print visually\"),\n       llvm::cl::cat(Category),\n       llvm::cl::init(false));\n} \/\/ end namespace options\n\nnamespace {\nint getTokensFromFile(unsigned BufferID,\n                      LangOptions &LangOpts,\n                      SourceManager &SourceMgr,\n                      DiagnosticEngine &Diags,\n                      std::vector<std::pair<RC<syntax::RawTokenSyntax>,\n                      syntax::AbsolutePosition>> &Tokens) {\n  Tokens = tokenizeWithTrivia(LangOpts, SourceMgr, BufferID);\n  return Diags.hadAnyError() ? EXIT_FAILURE : EXIT_SUCCESS;\n}\n\n\nint\ngetTokensFromFile(const StringRef InputFilename,\n                  LangOptions &LangOpts,\n                  SourceManager &SourceMgr,\n                  DiagnosticEngine &Diags,\n                  std::vector<std::pair<RC<syntax::RawTokenSyntax>,\n                                        syntax::AbsolutePosition>> &Tokens) {\n  auto Buffer = llvm::MemoryBuffer::getFile(InputFilename);\n  if (!Buffer) {\n    Diags.diagnose(SourceLoc(), diag::cannot_open_file,\n                   InputFilename, Buffer.getError().message());\n    return EXIT_FAILURE;\n  }\n\n  auto BufferID = SourceMgr.addNewSourceBuffer(std::move(Buffer.get()));\n  return getTokensFromFile(BufferID, LangOpts, SourceMgr, Diags, Tokens);\n}\n\nvoid anchorForGetMainExecutable() {}\n\n\nSourceFile *getSourceFile(CompilerInstance &Instance,\n                          StringRef InputFileName,\n                          const char *MainExecutablePath) {\n  CompilerInvocation Invocation;\n  Invocation.getLangOptions().KeepSyntaxInfoInSourceFile = true;\n  Invocation.getFrontendOptions().Inputs.addInputFile(InputFileName);\n  Invocation.setMainExecutablePath(\n    llvm::sys::fs::getMainExecutable(MainExecutablePath,\n      reinterpret_cast<void *>(&anchorForGetMainExecutable)));\n\n  Invocation.setModuleName(\"Test\");\n  PrintingDiagnosticConsumer DiagPrinter;\n  Instance.addDiagnosticConsumer(&DiagPrinter);\n  if (Instance.setup(Invocation)) {\n    return nullptr;\n  }\n\n  \/\/ First, parse the file normally and get the regular old AST.\n  Instance.performParseOnly();\n\n  SourceFile *SF = nullptr;\n  for (auto Unit : Instance.getMainModule()->getFiles()) {\n    SF = dyn_cast<SourceFile>(Unit);\n    if (SF != nullptr) {\n      break;\n    }\n  }\n  assert(SF && \"No source file\");\n  return SF;\n}\n\nint doFullLexRoundTrip(const StringRef InputFilename) {\n  LangOptions LangOpts;\n  SourceManager SourceMgr;\n  DiagnosticEngine Diags(SourceMgr);\n  PrintingDiagnosticConsumer DiagPrinter;\n  Diags.addConsumer(DiagPrinter);\n\n  std::vector<std::pair<RC<syntax::RawTokenSyntax>,\n                                   syntax::AbsolutePosition>> Tokens;\n  if (getTokensFromFile(InputFilename, LangOpts, SourceMgr,\n                        Diags, Tokens) == EXIT_FAILURE) {\n    return EXIT_FAILURE;\n  }\n\n  for (auto TokAndPos : Tokens) {\n    TokAndPos.first->print(llvm::outs());\n  }\n\n  return Diags.hadAnyError() ? EXIT_FAILURE : EXIT_SUCCESS;\n}\n\nint doDumpRawTokenSyntax(const StringRef InputFilename) {\n  LangOptions LangOpts;\n  SourceManager SourceMgr;\n  DiagnosticEngine Diags(SourceMgr);\n  PrintingDiagnosticConsumer DiagPrinter;\n  Diags.addConsumer(DiagPrinter);\n\n  std::vector<std::pair<RC<syntax::RawTokenSyntax>,\n                        syntax::AbsolutePosition>> Tokens;\n  if (getTokensFromFile(InputFilename, LangOpts, SourceMgr,\n                        Diags, Tokens) == EXIT_FAILURE) {\n    return EXIT_FAILURE;\n  }\n\n  for (auto TokAndPos : Tokens) {\n    TokAndPos.second.printLineAndColumn(llvm::outs());\n    llvm::outs() << \"\\n\";\n    TokAndPos.first->dump(llvm::outs());\n    llvm::outs() << \"\\n\";\n  }\n\n  return Diags.hadAnyError() ? EXIT_FAILURE : EXIT_SUCCESS;\n}\n\nint doFullParseRoundTrip(const char *MainExecutablePath,\n                         const StringRef InputFileName) {\n  CompilerInstance Instance;\n  SourceFile *SF = getSourceFile(Instance, InputFileName, MainExecutablePath);\n  SF->getSyntaxRoot().print(llvm::outs(), {});\n  return EXIT_SUCCESS;\n}\n\nint doSerializeRawTree(const char *MainExecutablePath,\n                       const StringRef InputFileName) {\n  CompilerInstance Instance;\n  SourceFile *SF = getSourceFile(Instance, InputFileName, MainExecutablePath);\n\n  auto Root = SF->getSyntaxRoot().getRaw();\n  swift::json::Output out(llvm::outs());\n  out << Root;\n  llvm::outs() << \"\\n\";\n\n  return EXIT_SUCCESS;\n}\n\nint doParseOnly(const char *MainExecutablePath,\n                  const StringRef InputFileName) {\n  CompilerInstance Instance;\n  SourceFile *SF = getSourceFile(Instance, InputFileName, MainExecutablePath);\n  return SF ? EXIT_SUCCESS : EXIT_FAILURE;\n}\n\nint dumpParserGen(const char *MainExecutablePath,\n                  const StringRef InputFileName) {\n  CompilerInstance Instance;\n  SourceFile *SF = getSourceFile(Instance, InputFileName, MainExecutablePath);\n  SyntaxPrintOptions Opts;\n  Opts.PrintSyntaxKind = options::PrintNodeKind;\n  Opts.Visual = options::Visual;\n  Opts.PrintTrivialNodeKind = options::PrintTrivialNodeKind;\n  SF->getSyntaxRoot().print(llvm::outs(), Opts);\n  return 0;\n}\n\nint dumpEOFSourceLoc(const char *MainExecutablePath,\n                     const StringRef InputFileName) {\n  CompilerInstance Instance;\n  SourceFile *SF = getSourceFile(Instance, InputFileName, MainExecutablePath);\n  auto BufferId = *SF->getBufferID();\n  SyntaxPrintOptions Opts;\n  auto Root = SF->getSyntaxRoot();\n  auto AbPos = Root.getEOFToken().getAbsolutePosition(Root);\n\n  SourceManager &SourceMgr = SF->getASTContext().SourceMgr;\n  auto StartLoc = SourceMgr.getLocForBufferStart(BufferId);\n  auto EndLoc = SourceMgr.getLocForOffset(BufferId, AbPos.getOffset());\n\n  \/\/ To ensure the correctness of position when translated to line & column pair.\n  if (SourceMgr.getLineAndColumn(EndLoc) != AbPos.getLineAndColumn()) {\n    llvm::outs() << \"locations should be identical\";\n    return EXIT_FAILURE;\n  }\n  llvm::outs() << CharSourceRange(SourceMgr, StartLoc, EndLoc).str();\n  return 0;\n}\n}\/\/ end of anonymous namespace\n\nint main(int argc, char *argv[]) {\n  llvm::cl::ParseCommandLineOptions(argc, argv, \"Swift Syntax Test\\n\");\n\n  int ExitCode = EXIT_SUCCESS;\n\n  if (options::InputSourceFilename.empty()) {\n    llvm::errs() << \"input source file is required\\n\";\n    ExitCode = EXIT_FAILURE;\n  }\n\n  if (ExitCode == EXIT_FAILURE) {\n    llvm::cl::PrintHelpMessage();\n    return ExitCode;\n  }\n\n  switch (options::Action) {\n  case ActionType::DumpRawTokenSyntax:\n    ExitCode = doDumpRawTokenSyntax(options::InputSourceFilename);\n    break;\n  case ActionType::FullLexRoundTrip:\n    ExitCode = doFullLexRoundTrip(options::InputSourceFilename);\n    break;\n  case ActionType::FullParseRoundTrip:\n    ExitCode = doFullParseRoundTrip(argv[0], options::InputSourceFilename);\n    break;\n  case ActionType::SerializeRawTree:\n    ExitCode = doSerializeRawTree(argv[0], options::InputSourceFilename);\n    break;\n  case ActionType::ParseOnly:\n    ExitCode = doParseOnly(argv[0], options::InputSourceFilename);\n    break;\n  case ActionType::ParserGen:\n    ExitCode = dumpParserGen(argv[0], options::InputSourceFilename);\n    break;\n  case ActionType::EOFPos:\n    ExitCode = dumpEOFSourceLoc(argv[0], options::InputSourceFilename);\n    break;\n  case ActionType::None:\n    llvm::errs() << \"an action is required\\n\";\n    llvm::cl::PrintHelpMessage();\n    ExitCode = EXIT_FAILURE;\n    break;\n  }\n\n  return ExitCode;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2001, 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\n#ifndef __BASE_INTMATH_HH__\n#define __BASE_INTMATH_HH__\n\n#include <cassert>\n#include <cstdint>\n#include <type_traits>\n\n#include \"base\/logging.hh\"\n#include \"base\/types.hh\"\n\n\/**\n * @ingroup api_base_utils\n *\/\ninline uint64_t\npower(uint32_t n, uint32_t e)\n{\n    uint64_t result = 1;\n    uint64_t component = n;\n    while (e) {\n        uint64_t last = result;\n        if (e & 0x1)\n            result *= component;\n        warn_if(result < last, \"power() overflowed!\");\n        e >>= 1;\n        component *= component;\n    }\n    return result;\n}\n\n\/**\n * @ingroup api_base_utils\n *\/\ntemplate <class T>\ninline typename std::enable_if_t<std::is_integral<T>::value, int>\nfloorLog2(T x)\n{\n    assert(x > 0);\n\n    \/\/ A guaranteed unsigned version of x.\n    uint64_t ux = (typename std::make_unsigned<T>::type)x;\n\n    int y = 0;\n    constexpr auto ts = sizeof(T);\n\n    if (ts >= 8 && (ux & ULL(0xffffffff00000000))) { y += 32; ux >>= 32; }\n    if (ts >= 4 && (ux & ULL(0x00000000ffff0000))) { y += 16; ux >>= 16; }\n    if (ts >= 2 && (ux & ULL(0x000000000000ff00))) { y +=  8; ux >>=  8; }\n    if (ux & ULL(0x00000000000000f0)) { y +=  4; ux >>=  4; }\n    if (ux & ULL(0x000000000000000c)) { y +=  2; ux >>=  2; }\n    if (ux & ULL(0x0000000000000002)) { y +=  1; }\n\n    return y;\n}\n\n\/**\n * @ingroup api_base_utils\n *\/\ntemplate <class T>\ninline int\nceilLog2(const T& n)\n{\n    assert(n > 0);\n    if (n == 1)\n        return 0;\n\n    return floorLog2(n - (T)1) + 1;\n}\n\n\/**\n * @ingroup api_base_utils\n *\/\ntemplate <class T>\ninline bool\nisPowerOf2(const T& n)\n{\n    \/\/ If n is non-zero, and subtracting one borrows all the way to the MSB\n    \/\/ and flips all bits, then this is a power of 2.\n    return n && !(n & (n - 1));\n}\n\n\/**\n * @ingroup api_base_utils\n *\/\ntemplate <class T, class U>\ninline T\ndivCeil(const T& a, const U& b)\n{\n    return (a + b - 1) \/ b;\n}\n\n\/**\n * This function is used to align addresses in memory.\n *\n * @param val is the address to be aligned.\n * @param align is the alignment. Can only be a power of 2.\n * @return The aligned address. The smallest number divisible\n * by @param align which is greater than or equal to @param val.\n *\n * @ingroup api_base_utils\n *\/\ntemplate <class T, class U>\ninline T\nroundUp(const T& val, const U& align)\n{\n    assert(isPowerOf2(align));\n    T mask = (T)align - 1;\n    return (val + mask) & ~mask;\n}\n\n\/**\n * This function is used to align addresses in memory.\n *\n * @param val is the address to be aligned.\n * @param align is the alignment. Can only be a power of 2.\n * @return The aligned address. The biggest number divisible\n * by @param align which is less than or equal to @param val.\n *\n * @ingroup api_base_utils\n *\/\ntemplate <class T, class U>\ninline T\nroundDown(const T& val, const U& align)\n{\n    assert(isPowerOf2(align));\n    T mask = (T)align - 1;\n    return val & ~mask;\n}\n\n#endif \/\/ __BASE_INTMATH_HH__\n<commit_msg>base: Make the functions in intmath.hh constexpr.<commit_after>\/*\n * Copyright (c) 2001, 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\n#ifndef __BASE_INTMATH_HH__\n#define __BASE_INTMATH_HH__\n\n#include <cassert>\n#include <cstdint>\n#include <type_traits>\n\n#include \"base\/logging.hh\"\n#include \"base\/types.hh\"\n\n\/**\n * @ingroup api_base_utils\n *\/\nstatic constexpr uint64_t\npower(uint32_t n, uint32_t e)\n{\n    uint64_t result = 1;\n    uint64_t component = n;\n    while (e) {\n        uint64_t last = result;\n        if (e & 0x1)\n            result *= component;\n        warn_if(result < last, \"power() overflowed!\");\n        e >>= 1;\n        component *= component;\n    }\n    return result;\n}\n\n\/**\n * @ingroup api_base_utils\n *\/\ntemplate <class T>\nstatic constexpr std::enable_if_t<std::is_integral<T>::value, int>\nfloorLog2(T x)\n{\n    assert(x > 0);\n\n    \/\/ A guaranteed unsigned version of x.\n    uint64_t ux = (typename std::make_unsigned<T>::type)x;\n\n    int y = 0;\n    constexpr auto ts = sizeof(T);\n\n    if (ts >= 8 && (ux & ULL(0xffffffff00000000))) { y += 32; ux >>= 32; }\n    if (ts >= 4 && (ux & ULL(0x00000000ffff0000))) { y += 16; ux >>= 16; }\n    if (ts >= 2 && (ux & ULL(0x000000000000ff00))) { y +=  8; ux >>=  8; }\n    if (ux & ULL(0x00000000000000f0)) { y +=  4; ux >>=  4; }\n    if (ux & ULL(0x000000000000000c)) { y +=  2; ux >>=  2; }\n    if (ux & ULL(0x0000000000000002)) { y +=  1; }\n\n    return y;\n}\n\n\/**\n * @ingroup api_base_utils\n *\/\ntemplate <class T>\nstatic constexpr int\nceilLog2(const T& n)\n{\n    assert(n > 0);\n    if (n == 1)\n        return 0;\n\n    return floorLog2(n - (T)1) + 1;\n}\n\n\/**\n * @ingroup api_base_utils\n *\/\ntemplate <class T>\nstatic constexpr bool\nisPowerOf2(const T& n)\n{\n    \/\/ If n is non-zero, and subtracting one borrows all the way to the MSB\n    \/\/ and flips all bits, then this is a power of 2.\n    return n && !(n & (n - 1));\n}\n\n\/**\n * @ingroup api_base_utils\n *\/\ntemplate <class T, class U>\nstatic constexpr T\ndivCeil(const T& a, const U& b)\n{\n    return (a + b - 1) \/ b;\n}\n\n\/**\n * This function is used to align addresses in memory.\n *\n * @param val is the address to be aligned.\n * @param align is the alignment. Can only be a power of 2.\n * @return The aligned address. The smallest number divisible\n * by @param align which is greater than or equal to @param val.\n *\n * @ingroup api_base_utils\n *\/\ntemplate <class T, class U>\nstatic constexpr T\nroundUp(const T& val, const U& align)\n{\n    assert(isPowerOf2(align));\n    T mask = (T)align - 1;\n    return (val + mask) & ~mask;\n}\n\n\/**\n * This function is used to align addresses in memory.\n *\n * @param val is the address to be aligned.\n * @param align is the alignment. Can only be a power of 2.\n * @return The aligned address. The biggest number divisible\n * by @param align which is less than or equal to @param val.\n *\n * @ingroup api_base_utils\n *\/\ntemplate <class T, class U>\nstatic constexpr T\nroundDown(const T& val, const U& align)\n{\n    assert(isPowerOf2(align));\n    T mask = (T)align - 1;\n    return val & ~mask;\n}\n\n#endif \/\/ __BASE_INTMATH_HH__\n<|endoftext|>"}
{"text":"<commit_before>\/\/ License: Apache 2.0. See LICENSE file in root directory.\n\/\/ Copyright(c) 2021 Intel Corporation. All Rights Reserved.\n\n#include <unit-tests\/catch.h>\n#include <common\/utilities\/time\/waiting-on.h>\n#include <queue>\n\nusing utilities::time::waiting_on;\n\nbool invoke( size_t delay_in_thread, size_t timeout )\n{\n    waiting_on< bool > invoked( false );\n    \n    auto invoked_in_thread = invoked.in_thread();\n    auto lambda = [delay_in_thread, invoked_in_thread]() {\n        \/\/ std::cout << \"In thread\" << std::endl;\n        std::this_thread::sleep_for( std::chrono::seconds( delay_in_thread ) );\n        \/\/ std::cout << \"Signalling\" << std::endl;\n        invoked_in_thread.signal( true );\n    };\n    \/\/std::cout << \"Starting thread\" << std::endl;\n    std::thread( lambda ).detach();\n    \/\/std::cout << \"Waiting\" << std::endl;\n    invoked.wait_until( std::chrono::seconds( timeout ), [&]() {\n        return invoked;\n        } );\n    \/\/std::cout << \"After wait\" << std::endl;\n    return invoked;\n}\n\nTEST_CASE( \"Basic wait\" )\n{\n    REQUIRE( invoke( 1 \/* seconds in thread *\/, 10 \/* timeout *\/ ) );\n}\n\nTEST_CASE( \"Timeout\" )\n{\n    REQUIRE( ! invoke( 10 \/* seconds in thread *\/, 1 \/* timeout *\/ ));\n}\n\nTEST_CASE( \"Struct usage\" )\n{\n    struct value_t\n    {\n        double d;\n        std::atomic_int i{ 0 };\n    };\n    waiting_on< value_t > output;\n    output->d = 2.;\n\n    auto output_ = output.in_thread();\n    std::thread( [output_]() {\n        auto p_output = output_.still_alive();\n        auto & output = *p_output;\n        while( output->i < 30 )\n        {\n            std::this_thread::sleep_for( std::chrono::milliseconds( 50 ) );\n            ++output->i;\n            output.signal();\n        }\n    } ).detach();\n\n    \/\/ Within a second, i should reach ~20, but we'll ask it top stop when it reaches 10\n    output.wait_until( std::chrono::seconds( 1 ), [&]() {\n        return output->i == 10;\n        } );\n\n    auto i1 = output->i.load();\n    CHECK( i1 >= 10 ); \/\/ the thread is still running!\n    CHECK( i1 < 16 );\n    \/\/std::cout << \"i1= \" << i1 << std::endl;\n\n    std::this_thread::sleep_for( std::chrono::milliseconds( 100 ) );\n    auto i2 = output->i.load();\n    CHECK( i2 > i1 ); \/\/ the thread is still running!\n    \/\/std::cout << \"i2= \" << i2 << std::endl;\n\n    \/\/ Wait until it's done, ~30x50ms = 1.5 seconds total\n    REQUIRE( output->i < 30 );\n    output.wait_until( std::chrono::seconds( 3 ), [&]() { return false; } );\n    REQUIRE( output->i == 30 );\n}\n\nTEST_CASE( \"Not invoked but still notified\" )\n{\n    \/\/ Emulate some dispatcher\n    typedef std::function< void () > func;\n    auto dispatcher = new std::queue< func >;\n\n    \/\/ Push some stuff onto it (not important what)\n    int i = 0;\n    dispatcher->push( [&]() { ++i; } );\n    dispatcher->push( [&]() { ++i; } );\n    \n    \/\/ Add something we'll be waiting on\n    utilities::time::waiting_on< bool > invoked( false );\n    auto invoked_in_thread = invoked.in_thread();\n    dispatcher->push( [invoked_in_thread]() { invoked_in_thread.signal( true ); } );\n\n    \/\/ Destroy the dispatcher while we're waiting on the invocation!\n    std::atomic_bool stopped( false );\n    std::thread( [&]() {\n        std::this_thread::sleep_for( std::chrono::seconds( 2 ));\n        stopped = true;\n        delete dispatcher;\n        } ).detach();\n\n    \/\/ Wait for it -- we'd expect that, when 'invoked_in_thread' is destroyed, it'll wake us up and\n    \/\/ not wait for the timeout\n    auto wait_start = std::chrono::high_resolution_clock::now();\n    invoked.wait_until( std::chrono::seconds( 5 ), [&]() {\n        return invoked || stopped;  \/\/ Without stopped, invoked will be false and we'll wait again\n                                    \/\/ even after we're signalled!\n        } );\n    auto wait_end = std::chrono::high_resolution_clock::now();\n    auto waited_ms = std::chrono::duration_cast<std::chrono::milliseconds>( wait_end - wait_start ).count();\n\n    REQUIRE( waited_ms > 1990 );\n    REQUIRE( waited_ms < 3000 );    \/\/ Up to a second buffer\n}\n<commit_msg>removed warnings<commit_after>\/\/ License: Apache 2.0. See LICENSE file in root directory.\n\/\/ Copyright(c) 2021 Intel Corporation. All Rights Reserved.\n\n#include <unit-tests\/catch.h>\n#include <common\/utilities\/time\/waiting-on.h>\n#include <queue>\n\nusing utilities::time::waiting_on;\n\nbool invoke( size_t delay_in_thread, size_t timeout )\n{\n    waiting_on< bool > invoked( false );\n    \n    auto invoked_in_thread = invoked.in_thread();\n    auto lambda = [delay_in_thread, invoked_in_thread]() {\n        \/\/ std::cout << \"In thread\" << std::endl;\n        std::this_thread::sleep_for( std::chrono::seconds( delay_in_thread ) );\n        \/\/ std::cout << \"Signalling\" << std::endl;\n        invoked_in_thread.signal( true );\n    };\n    \/\/std::cout << \"Starting thread\" << std::endl;\n    std::thread( lambda ).detach();\n    \/\/std::cout << \"Waiting\" << std::endl;\n    invoked.wait_until( std::chrono::seconds( timeout ), [&]() {\n        return invoked;\n        } );\n    \/\/std::cout << \"After wait\" << std::endl;\n    return invoked;\n}\n\nTEST_CASE( \"Basic wait\" )\n{\n    REQUIRE( invoke( 1 \/* seconds in thread *\/, 10 \/* timeout *\/ ) );\n}\n\nTEST_CASE( \"Timeout\" )\n{\n    REQUIRE( ! invoke( 10 \/* seconds in thread *\/, 1 \/* timeout *\/ ));\n}\n\nTEST_CASE( \"Struct usage\" )\n{\n    struct value_t\n    {\n        double d;\n        std::atomic_int i{ 0 };\n    };\n    waiting_on< value_t > output;\n    output->d = 2.;\n\n    auto output_ = output.in_thread();\n    std::thread( [output_]() {\n        auto p_output = output_.still_alive();\n        auto & output = *p_output;\n        while( output->i < 30 )\n        {\n            std::this_thread::sleep_for( std::chrono::milliseconds( 50 ) );\n            ++output->i;\n            output.signal();\n        }\n    } ).detach();\n\n    \/\/ Within a second, i should reach ~20, but we'll ask it top stop when it reaches 10\n    output.wait_until( std::chrono::seconds( 1 ), [&]() {\n        return output->i == 10;\n        } );\n\n    auto i1 = output->i.load();\n    CHECK( i1 >= 10 ); \/\/ the thread is still running!\n    CHECK( i1 < 16 );\n    \/\/std::cout << \"i1= \" << i1 << std::endl;\n\n    std::this_thread::sleep_for( std::chrono::milliseconds( 100 ) );\n    auto i2 = output->i.load();\n    CHECK( i2 > i1 ); \/\/ the thread is still running!\n    \/\/std::cout << \"i2= \" << i2 << std::endl;\n\n    \/\/ Wait until it's done, ~30x50ms = 1.5 seconds total\n    REQUIRE( output->i < 30 );\n    output.wait_until( std::chrono::seconds( 3 ), [&]() { return false; } );\n    REQUIRE( output->i == 30 );\n}\n\nTEST_CASE( \"Not invoked but still notified\" )\n{\n    \/\/ Emulate some dispatcher\n    typedef std::function< void () > func;\n    auto dispatcher = new std::queue< func >;\n\n    \/\/ Push some stuff onto it (not important what)\n    int i = 0;\n    dispatcher->push( [&]() { ++i; } );\n    dispatcher->push( [&]() { ++i; } );\n    \n    \/\/ Add something we'll be waiting on\n    utilities::time::waiting_on< bool > invoked( false );\n    dispatcher->push( [invoked_in_thread = invoked.in_thread()]() { invoked_in_thread.signal( true ); } );\n\n    \/\/ Destroy the dispatcher while we're waiting on the invocation!\n    std::atomic_bool stopped( false );\n    std::thread( [&]() {\n        std::this_thread::sleep_for( std::chrono::seconds( 2 ));\n        stopped = true;\n        delete dispatcher;\n        } ).detach();\n\n    \/\/ Wait for it -- we'd expect that, when 'invoked_in_thread' is destroyed, it'll wake us up and\n    \/\/ not wait for the timeout\n    auto wait_start = std::chrono::high_resolution_clock::now();\n    invoked.wait_until( std::chrono::seconds( 5 ), [&]() {\n        return invoked || stopped;  \/\/ Without stopped, invoked will be false and we'll wait again\n                                    \/\/ even after we're signalled!\n        } );\n    auto wait_end = std::chrono::high_resolution_clock::now();\n    auto waited_ms = std::chrono::duration_cast<std::chrono::milliseconds>( wait_end - wait_start ).count();\n\n    REQUIRE( waited_ms > 1990 );\n    REQUIRE( waited_ms < 3000 );    \/\/ Up to a second buffer\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_sd.hxx\"\n\n#include \"PaneDockingWindow.hxx\"\n#include \"Window.hxx\"\n#include \"ViewShellBase.hxx\"\n#include \"framework\/FrameworkHelper.hxx\"\n#include \"sdresid.hxx\"\n#include \"res_bmp.hrc\"\n#include <sfx2\/dispatch.hxx>\n#include <vcl\/toolbox.hxx>\n#include <vcl\/taskpanelist.hxx>\n#include <vcl\/splitwin.hxx>\n#include <vcl\/svapp.hxx>\n#include <tools\/wintypes.hxx>\n#include <boost\/bind.hpp>\n\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::drawing::framework;\n\nnamespace sd {\n\nPaneDockingWindow::PaneDockingWindow (\n    SfxBindings *_pBindings,\n    SfxChildWindow *pChildWindow,\n    ::Window* pParent,\n    const ResId& rResId,\n    const ::rtl::OUString& rsPaneURL,\n    const ::rtl::OUString& rsTitle)\n    : SfxDockingWindow (_pBindings, pChildWindow, pParent, rResId),\n      msPaneURL(rsPaneURL),\n      msTitle(rsTitle),\n      mpTitleToolBox(),\n      maBorder (3,1,3,3),\n      mnChildWindowId(pChildWindow->GetType()),\n      mpContentWindow(new ::Window(this)),\n      mbIsLayoutPending(false)\n{\n    SetBackground (Wallpaper());\n\n    InitializeTitleToolBox();\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    mpContentWindow->Show();\n}\n\n\n\n\nPaneDockingWindow::~PaneDockingWindow (void)\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    mpTitleToolBox.reset();\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    mbIsLayoutPending = true;\n}\n\n\n\n\nvoid PaneDockingWindow::Layout (void)\n{\n    mbIsLayoutPending = false;\n\n    Size aWindowSize (GetOutputSizePixel());\n    Size aToolBoxSize (0,0);\n    mnTitleBarHeight = 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() > mnTitleBarHeight)\n            mnTitleBarHeight = aToolBoxSize.Height();\n        mpTitleToolBox->SetPosSizePixel (\n            Point(aWindowSize.Width()-aToolBoxSize.Width(),\n                (mnTitleBarHeight-aToolBoxSize.Height())\/2),\n            aToolBoxSize);\n    }\n\n    \/\/ Place the content window.\n    if (mnTitleBarHeight < aToolBoxSize.Height())\n        mnTitleBarHeight = aToolBoxSize.Height();\n    aWindowSize.Height() -= mnTitleBarHeight;\n    mpContentWindow->SetPosSizePixel(\n        Point(maBorder.Left(),mnTitleBarHeight+maBorder.Top()),\n        Size (aWindowSize.Width()-maBorder.Left()-maBorder.Right(),\n            aWindowSize.Height()-maBorder.Top()-maBorder.Bottom()));\n}\n\n\n\n\nvoid PaneDockingWindow::Paint (const Rectangle& rRectangle)\n{\n    if (mbIsLayoutPending)\n        Layout();\n\n    SfxDockingWindow::Paint (rRectangle);\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 = mnTitleBarHeight + 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().GetHighContrastMode()\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    USHORT nItemCount (mpTitleToolBox->GetItemCount());\n    USHORT nItemId (nItemCount+1);\n    mpTitleToolBox->InsertItem (\n        nItemId,\n        rsMenuName,\n        TIB_DROPDOWNONLY,\n        nItemCount>0 ? nItemCount-1 : (USHORT)-1);\n    mpTitleToolBox->SetHelpId( nItemId, nHelpId );\n    mpTitleToolBox->SetClickHdl (rCallback);\n    mpTitleToolBox->SetDropdownClickHdl (rCallback);\n\n    \/\/ The tool box has likely changed its size. The title bar has to be\n    \/\/ resized.\n    Resize();\n    Invalidate();\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        case STATE_CHANGE_VISIBLE:\n            \/\/ The visibility of the docking window has changed.  Tell the\n            \/\/ ConfigurationController so that it can activate or deactivate\n            \/\/ a\/the view for the pane.\n            \/\/ Without this the side panes remain empty after closing an\n            \/\/ in-place slide show.\n            ViewShellBase* pBase = ViewShellBase::GetViewShellBase(\n                GetBindings().GetDispatcher()->GetFrame());\n            if (pBase != NULL)\n            {\n                framework::FrameworkHelper::Instance(*pBase)->UpdateConfiguration();\n            }\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) == 0)\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\nvoid PaneDockingWindow::MouseButtonDown (const MouseEvent& rEvent)\n{\n    if (rEvent.GetButtons() == MOUSE_LEFT && mpContentWindow)\n    {\n        \/\/ For some strange reason we have to set the WB_DIALOGCONTROL at\n        \/\/ the content window in order to have it pass focus to its content\n        \/\/ window.  Without setting this flag here that works only on views\n        \/\/ that have not been taken from the cash and relocated to this pane\n        \/\/ docking window.\n        mpContentWindow->SetStyle(mpContentWindow->GetStyle() | WB_DIALOGCONTROL);\n        mpContentWindow->GrabFocus();\n    }\n    SfxDockingWindow::MouseButtonDown(rEvent);\n}\n\n\n\n\n::Window* PaneDockingWindow::GetContentWindow (void)\n{\n    return mpContentWindow.get();\n}\n\n\n\n\n::boost::shared_ptr<ToolBox> PaneDockingWindow::GetTitleToolBox (void) const\n{\n    return mpTitleToolBox;\n}\n\n\n\n\nvoid PaneDockingWindow::SetValidSizeRange (const Range aValidSizeRange)\n{\n    SplitWindow* pSplitWindow = dynamic_cast<SplitWindow*>(GetParent());\n    if (pSplitWindow != NULL)\n    {\n        const USHORT nId (pSplitWindow->GetItemId(static_cast< ::Window*>(this)));\n        const USHORT nSetId (pSplitWindow->GetSet(nId));\n        \/\/ Because the PaneDockingWindow paints its own decoration, we have\n        \/\/ to compensate the valid size range for that.\n        sal_Int32 nCompensation (pSplitWindow->IsHorizontal()\n            ? mnTitleBarHeight + maBorder.Top() + maBorder.Bottom()\n            : maBorder.Left() + maBorder.Right());\n        pSplitWindow->SetItemSizeRange(\n            nSetId,\n            Range(\n                aValidSizeRange.Min() + nCompensation,\n                aValidSizeRange.Max() + nCompensation));\n    }\n}\n\n\n\n\nPaneDockingWindow::Orientation PaneDockingWindow::GetOrientation (void) const\n{\n    SplitWindow* pSplitWindow = dynamic_cast<SplitWindow*>(GetParent());\n    if (pSplitWindow == NULL)\n        return UnknownOrientation;\n    else if (pSplitWindow->IsHorizontal())\n        return HorizontalOrientation;\n    else\n        return VerticalOrientation;\n}\n\n\n\n} \/\/ end of namespace ::sd\n<commit_msg>renaissance1: #i107215# Fixed focus handling of relocated slide sorter.<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_sd.hxx\"\n\n#include \"PaneDockingWindow.hxx\"\n#include \"Window.hxx\"\n#include \"ViewShellBase.hxx\"\n#include \"framework\/FrameworkHelper.hxx\"\n#include \"sdresid.hxx\"\n#include \"res_bmp.hrc\"\n#include <sfx2\/dispatch.hxx>\n#include <vcl\/toolbox.hxx>\n#include <vcl\/taskpanelist.hxx>\n#include <vcl\/splitwin.hxx>\n#include <vcl\/svapp.hxx>\n#include <tools\/wintypes.hxx>\n#include <boost\/bind.hpp>\n\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::drawing::framework;\n\nnamespace sd {\n\nPaneDockingWindow::PaneDockingWindow (\n    SfxBindings *_pBindings,\n    SfxChildWindow *pChildWindow,\n    ::Window* pParent,\n    const ResId& rResId,\n    const ::rtl::OUString& rsPaneURL,\n    const ::rtl::OUString& rsTitle)\n    : SfxDockingWindow (_pBindings, pChildWindow, pParent, rResId),\n      msPaneURL(rsPaneURL),\n      msTitle(rsTitle),\n      mpTitleToolBox(),\n      maBorder (3,1,3,3),\n      mnChildWindowId(pChildWindow->GetType()),\n      mpContentWindow(new ::Window(this)),\n      mbIsLayoutPending(false)\n{\n    SetBackground (Wallpaper());\n\n    InitializeTitleToolBox();\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    mpContentWindow->Show();\n}\n\n\n\n\nPaneDockingWindow::~PaneDockingWindow (void)\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    mpTitleToolBox.reset();\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    mbIsLayoutPending = true;\n}\n\n\n\n\nvoid PaneDockingWindow::Layout (void)\n{\n    mbIsLayoutPending = false;\n\n    Size aWindowSize (GetOutputSizePixel());\n    Size aToolBoxSize (0,0);\n    mnTitleBarHeight = 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() > mnTitleBarHeight)\n            mnTitleBarHeight = aToolBoxSize.Height();\n        mpTitleToolBox->SetPosSizePixel (\n            Point(aWindowSize.Width()-aToolBoxSize.Width(),\n                (mnTitleBarHeight-aToolBoxSize.Height())\/2),\n            aToolBoxSize);\n    }\n\n    \/\/ Place the content window.\n    if (mnTitleBarHeight < aToolBoxSize.Height())\n        mnTitleBarHeight = aToolBoxSize.Height();\n    aWindowSize.Height() -= mnTitleBarHeight;\n    mpContentWindow->SetPosSizePixel(\n        Point(maBorder.Left(),mnTitleBarHeight+maBorder.Top()),\n        Size (aWindowSize.Width()-maBorder.Left()-maBorder.Right(),\n            aWindowSize.Height()-maBorder.Top()-maBorder.Bottom()));\n}\n\n\n\n\nvoid PaneDockingWindow::Paint (const Rectangle& rRectangle)\n{\n    if (mbIsLayoutPending)\n        Layout();\n\n    SfxDockingWindow::Paint (rRectangle);\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 = mnTitleBarHeight + 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().GetHighContrastMode()\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    USHORT nItemCount (mpTitleToolBox->GetItemCount());\n    USHORT nItemId (nItemCount+1);\n    mpTitleToolBox->InsertItem (\n        nItemId,\n        rsMenuName,\n        TIB_DROPDOWNONLY,\n        nItemCount>0 ? nItemCount-1 : (USHORT)-1);\n    mpTitleToolBox->SetHelpId( nItemId, nHelpId );\n    mpTitleToolBox->SetClickHdl (rCallback);\n    mpTitleToolBox->SetDropdownClickHdl (rCallback);\n\n    \/\/ The tool box has likely changed its size. The title bar has to be\n    \/\/ resized.\n    Resize();\n    Invalidate();\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            mpContentWindow->SetStyle(mpContentWindow->GetStyle() | WB_DIALOGCONTROL);\n            break;\n\n        case STATE_CHANGE_VISIBLE:\n            \/\/ The visibility of the docking window has changed.  Tell the\n            \/\/ ConfigurationController so that it can activate or deactivate\n            \/\/ a\/the view for the pane.\n            \/\/ Without this the side panes remain empty after closing an\n            \/\/ in-place slide show.\n            ViewShellBase* pBase = ViewShellBase::GetViewShellBase(\n                GetBindings().GetDispatcher()->GetFrame());\n            if (pBase != NULL)\n            {\n                framework::FrameworkHelper::Instance(*pBase)->UpdateConfiguration();\n            }\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) == 0)\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\nvoid PaneDockingWindow::MouseButtonDown (const MouseEvent& rEvent)\n{\n    if (rEvent.GetButtons() == MOUSE_LEFT && mpContentWindow)\n    {\n        \/\/ For some strange reason we have to set the WB_DIALOGCONTROL at\n        \/\/ the content window in order to have it pass focus to its content\n        \/\/ window.  Without setting this flag here that works only on views\n        \/\/ that have not been taken from the cash and relocated to this pane\n        \/\/ docking window.\n        mpContentWindow->SetStyle(mpContentWindow->GetStyle() | WB_DIALOGCONTROL);\n        mpContentWindow->GrabFocus();\n    }\n    SfxDockingWindow::MouseButtonDown(rEvent);\n}\n\n\n\n\n::Window* PaneDockingWindow::GetContentWindow (void)\n{\n    return mpContentWindow.get();\n}\n\n\n\n\n::boost::shared_ptr<ToolBox> PaneDockingWindow::GetTitleToolBox (void) const\n{\n    return mpTitleToolBox;\n}\n\n\n\n\nvoid PaneDockingWindow::SetValidSizeRange (const Range aValidSizeRange)\n{\n    SplitWindow* pSplitWindow = dynamic_cast<SplitWindow*>(GetParent());\n    if (pSplitWindow != NULL)\n    {\n        const USHORT nId (pSplitWindow->GetItemId(static_cast< ::Window*>(this)));\n        const USHORT nSetId (pSplitWindow->GetSet(nId));\n        \/\/ Because the PaneDockingWindow paints its own decoration, we have\n        \/\/ to compensate the valid size range for that.\n        sal_Int32 nCompensation (pSplitWindow->IsHorizontal()\n            ? mnTitleBarHeight + maBorder.Top() + maBorder.Bottom()\n            : maBorder.Left() + maBorder.Right());\n        pSplitWindow->SetItemSizeRange(\n            nSetId,\n            Range(\n                aValidSizeRange.Min() + nCompensation,\n                aValidSizeRange.Max() + nCompensation));\n    }\n}\n\n\n\n\nPaneDockingWindow::Orientation PaneDockingWindow::GetOrientation (void) const\n{\n    SplitWindow* pSplitWindow = dynamic_cast<SplitWindow*>(GetParent());\n    if (pSplitWindow == NULL)\n        return UnknownOrientation;\n    else if (pSplitWindow->IsHorizontal())\n        return HorizontalOrientation;\n    else\n        return VerticalOrientation;\n}\n\n\n\n} \/\/ end of namespace ::sd\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2017 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 \"riegeli\/brotli\/brotli_writer.h\"\n\n#include <stddef.h>\n#include <stdint.h>\n\n#include <limits>\n#include <memory>\n#include <string>\n#include <utility>\n\n#include \"absl\/base\/optimization.h\"\n#include \"absl\/status\/status.h\"\n#include \"absl\/strings\/str_cat.h\"\n#include \"absl\/strings\/string_view.h\"\n#include \"absl\/types\/optional.h\"\n#include \"brotli\/encode.h\"\n#include \"riegeli\/base\/base.h\"\n#include \"riegeli\/base\/intrusive_ref_count.h\"\n#include \"riegeli\/base\/port.h\"\n#include \"riegeli\/base\/status.h\"\n#include \"riegeli\/brotli\/brotli_reader.h\"\n#include \"riegeli\/bytes\/buffered_writer.h\"\n#include \"riegeli\/bytes\/reader.h\"\n#include \"riegeli\/bytes\/writer.h\"\n\nnamespace riegeli {\n\n\/\/ Before C++17 if a constexpr static data member is ODR-used, its definition at\n\/\/ namespace scope is required. Since C++17 these definitions are deprecated:\n\/\/ http:\/\/en.cppreference.com\/w\/cpp\/language\/static\n#if __cplusplus < 201703\nconstexpr int BrotliWriterBase::Options::kMinCompressionLevel;\nconstexpr int BrotliWriterBase::Options::kMaxCompressionLevel;\nconstexpr int BrotliWriterBase::Options::kDefaultCompressionLevel;\nconstexpr int BrotliWriterBase::Options::kMinWindowLog;\nconstexpr int BrotliWriterBase::Options::kMaxWindowLog;\nconstexpr int BrotliWriterBase::Options::kDefaultWindowLog;\n#endif\n\nnamespace {\n\nstruct BrotliEncoderDictionaryDeleter {\n  void operator()(BrotliEncoderPreparedDictionary* ptr) const {\n    BrotliEncoderDestroyPreparedDictionary(ptr);\n  }\n};\n\n}  \/\/ namespace\n\nvoid BrotliWriterBase::Initialize(Writer* dest, int compression_level,\n                                  int window_log,\n                                  absl::optional<Position> size_hint) {\n  RIEGELI_ASSERT(dest != nullptr)\n      << \"Failed precondition of BrotliWriter: null Writer pointer\";\n  if (ABSL_PREDICT_FALSE(!healthy())) return;\n  if (ABSL_PREDICT_FALSE(!dest->healthy())) {\n    FailWithoutAnnotation(AnnotateOverDest(dest->status()));\n    return;\n  }\n  initial_compressed_pos_ = dest->pos();\n  compressor_.reset(BrotliEncoderCreateInstance(\n      allocator_.alloc_func(), allocator_.free_func(), allocator_.opaque()));\n  if (ABSL_PREDICT_FALSE(compressor_ == nullptr)) {\n    Fail(absl::InternalError(\"BrotliEncoderCreateInstance() failed\"));\n    return;\n  }\n  if (ABSL_PREDICT_FALSE(\n          !BrotliEncoderSetParameter(compressor_.get(), BROTLI_PARAM_QUALITY,\n                                     IntCast<uint32_t>(compression_level)))) {\n    Fail(absl::InternalError(\n        \"BrotliEncoderSetParameter(BROTLI_PARAM_QUALITY) failed\"));\n    return;\n  }\n  \/\/ Reduce `window_log` if `size_hint` indicates that data will be smaller.\n  \/\/ TODO(eustas): Do this automatically in the Brotli engine.\n  if (size_hint != absl::nullopt) {\n#if RIEGELI_INTERNAL_HAS_BUILTIN(__builtin_clzll) || \\\n    RIEGELI_INTERNAL_IS_GCC_VERSION(3, 4)\n    const int ceil_log2 =\n        __builtin_clzll(1) -\n        __builtin_clzll((SaturatingSub(*size_hint, Position{1})) | 1) + 1;\n    window_log =\n        SignedMin(window_log, SignedMax(ceil_log2, Options::kMinWindowLog));\n#else\n    while (Position{1} << (window_log - 1) >= *size_hint &&\n           window_log > Options::kMinWindowLog) {\n      --window_log;\n    }\n#endif\n  }\n  if (ABSL_PREDICT_FALSE(!BrotliEncoderSetParameter(\n          compressor_.get(), BROTLI_PARAM_LARGE_WINDOW,\n          uint32_t{window_log > BROTLI_MAX_WINDOW_BITS}))) {\n    Fail(absl::InternalError(\n        \"BrotliEncoderSetParameter(BROTLI_PARAM_LARGE_WINDOW) failed\"));\n    return;\n  }\n  if (ABSL_PREDICT_FALSE(\n          !BrotliEncoderSetParameter(compressor_.get(), BROTLI_PARAM_LGWIN,\n                                     IntCast<uint32_t>(window_log)))) {\n    Fail(absl::InternalError(\n        \"BrotliEncoderSetParameter(BROTLI_PARAM_LGWIN) failed\"));\n    return;\n  }\n  for (const RefCountedPtr<const BrotliDictionary::Chunk>& chunk :\n       dictionary_.chunks()) {\n    const std::shared_ptr<const BrotliEncoderPreparedDictionary> prepared =\n        chunk->PrepareCompressionDictionary();\n    if (ABSL_PREDICT_FALSE(prepared == nullptr)) {\n      Fail(absl::InternalError(\"BrotliEncoderPrepareDictionary() failed\"));\n      return;\n    }\n    if (ABSL_PREDICT_FALSE(!BrotliEncoderAttachPreparedDictionary(\n            compressor_.get(), prepared.get()))) {\n      Fail(absl::InternalError(\n          \"BrotliEncoderAttachPreparedDictionary() failed\"));\n      return;\n    }\n  }\n  if (size_hint != absl::nullopt) {\n    \/\/ Ignore errors from tuning.\n    BrotliEncoderSetParameter(compressor_.get(), BROTLI_PARAM_SIZE_HINT,\n                              SaturatingIntCast<uint32_t>(*size_hint));\n  }\n}\n\nvoid BrotliWriterBase::DoneBehindBuffer(absl::string_view src) {\n  RIEGELI_ASSERT_EQ(start_to_limit(), 0u)\n      << \"Failed precondition of BufferedWriter::DoneBehindBuffer(): \"\n         \"buffer not empty\";\n  if (ABSL_PREDICT_FALSE(!healthy())) return;\n  Writer& dest = *dest_writer();\n  WriteInternal(src, dest, BROTLI_OPERATION_FINISH);\n}\n\nvoid BrotliWriterBase::Done() {\n  BufferedWriter::Done();\n  compressor_.reset();\n  dictionary_ = BrotliDictionary();\n  allocator_ = BrotliAllocator();\n  associated_reader_.Reset();\n}\n\nabsl::Status BrotliWriterBase::AnnotateStatusImpl(absl::Status status) {\n  if (is_open()) {\n    Writer& dest = *dest_writer();\n    status = dest.AnnotateStatus(std::move(status));\n  }\n  \/\/ The status might have been annotated by `*dest->writer()` with the\n  \/\/ compressed position. Clarify that the current position is the uncompressed\n  \/\/ position instead of delegating to `BufferedWriter::AnnotateStatusImpl()`.\n  return AnnotateOverDest(std::move(status));\n}\n\nabsl::Status BrotliWriterBase::AnnotateOverDest(absl::Status status) {\n  if (is_open()) {\n    return Annotate(status, absl::StrCat(\"at uncompressed byte \", pos()));\n  }\n  return status;\n}\n\nbool BrotliWriterBase::WriteInternal(absl::string_view src) {\n  RIEGELI_ASSERT(!src.empty())\n      << \"Failed precondition of BufferedWriter::WriteInternal(): \"\n         \"nothing to write\";\n  RIEGELI_ASSERT(healthy())\n      << \"Failed precondition of BufferedWriter::WriteInternal(): \" << status();\n  Writer& dest = *dest_writer();\n  return WriteInternal(src, dest, BROTLI_OPERATION_PROCESS);\n}\n\ninline bool BrotliWriterBase::WriteInternal(absl::string_view src, Writer& dest,\n                                            BrotliEncoderOperation op) {\n  RIEGELI_ASSERT(healthy())\n      << \"Failed precondition of BrotliWriterBase::WriteInternal(): \"\n      << status();\n  if (ABSL_PREDICT_FALSE(src.size() >\n                         std::numeric_limits<Position>::max() - start_pos())) {\n    return FailOverflow();\n  }\n  size_t available_in = src.size();\n  const uint8_t* next_in = reinterpret_cast<const uint8_t*>(src.data());\n  size_t available_out = 0;\n  for (;;) {\n    if (ABSL_PREDICT_FALSE(!BrotliEncoderCompressStream(\n            compressor_.get(), op, &available_in, &next_in, &available_out,\n            nullptr, nullptr))) {\n      return Fail(absl::InternalError(\"BrotliEncoderCompressStream() failed\"));\n    }\n    size_t length = 0;\n    const char* const data = reinterpret_cast<const char*>(\n        BrotliEncoderTakeOutput(compressor_.get(), &length));\n    if (length > 0) {\n      if (ABSL_PREDICT_FALSE(!dest.Write(data, length))) {\n        return FailWithoutAnnotation(AnnotateOverDest(dest.status()));\n      }\n    } else if (available_in == 0) {\n      move_start_pos(src.size());\n      return true;\n    }\n  }\n}\n\nbool BrotliWriterBase::FlushBehindBuffer(absl::string_view src,\n                                         FlushType flush_type) {\n  RIEGELI_ASSERT_EQ(start_to_limit(), 0u)\n      << \"Failed precondition of BufferedWriter::FlushBehindBuffer(): \"\n         \"buffer not empty\";\n  if (ABSL_PREDICT_FALSE(!healthy())) return false;\n  Writer& dest = *dest_writer();\n  return WriteInternal(src, dest, BROTLI_OPERATION_FLUSH);\n}\n\nbool BrotliWriterBase::SupportsReadMode() {\n  Writer* const dest = dest_writer();\n  if (dest != nullptr && dest->SupportsReadMode()) {\n    for (const RefCountedPtr<const BrotliDictionary::Chunk>& chunk :\n         dictionary_.chunks()) {\n      if (chunk->type() == BrotliDictionary::Type::kNative) return false;\n    }\n    return true;\n  }\n  return false;\n}\n\nReader* BrotliWriterBase::ReadModeBehindBuffer(Position initial_pos) {\n  RIEGELI_ASSERT_EQ(start_to_limit(), 0u)\n      << \"Failed precondition of BufferedWriter::ReadModeBehindBuffer(): \"\n         \"buffer not empty\";\n  if (ABSL_PREDICT_FALSE(!BrotliWriterBase::FlushBehindBuffer(\n          absl::string_view(), FlushType::kFromObject))) {\n    return nullptr;\n  }\n  Writer& dest = *dest_writer();\n  Reader* const compressed_reader = dest.ReadMode(initial_compressed_pos_);\n  if (ABSL_PREDICT_FALSE(compressed_reader == nullptr)) {\n    FailWithoutAnnotation(AnnotateOverDest(dest.status()));\n    return nullptr;\n  }\n  BrotliReader<>* const reader = associated_reader_.ResetReader(\n      compressed_reader, BrotliReaderBase::Options()\n                             .set_dictionary(dictionary_)\n                             .set_allocator(allocator_));\n  reader->Seek(initial_pos);\n  return reader;\n}\n\n}  \/\/ namespace riegeli\n<commit_msg>Remove redundant check of `healthy()` in `BrotliWriterBase::Initialize()` which was needed in an earlier design of `BrotliDictionary` where `BrotliWriterBase::Reset()` was responsible for propagating a failure from preparing a dictionary.<commit_after>\/\/ Copyright 2017 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 \"riegeli\/brotli\/brotli_writer.h\"\n\n#include <stddef.h>\n#include <stdint.h>\n\n#include <limits>\n#include <memory>\n#include <string>\n#include <utility>\n\n#include \"absl\/base\/optimization.h\"\n#include \"absl\/status\/status.h\"\n#include \"absl\/strings\/str_cat.h\"\n#include \"absl\/strings\/string_view.h\"\n#include \"absl\/types\/optional.h\"\n#include \"brotli\/encode.h\"\n#include \"riegeli\/base\/base.h\"\n#include \"riegeli\/base\/intrusive_ref_count.h\"\n#include \"riegeli\/base\/port.h\"\n#include \"riegeli\/base\/status.h\"\n#include \"riegeli\/brotli\/brotli_reader.h\"\n#include \"riegeli\/bytes\/buffered_writer.h\"\n#include \"riegeli\/bytes\/reader.h\"\n#include \"riegeli\/bytes\/writer.h\"\n\nnamespace riegeli {\n\n\/\/ Before C++17 if a constexpr static data member is ODR-used, its definition at\n\/\/ namespace scope is required. Since C++17 these definitions are deprecated:\n\/\/ http:\/\/en.cppreference.com\/w\/cpp\/language\/static\n#if __cplusplus < 201703\nconstexpr int BrotliWriterBase::Options::kMinCompressionLevel;\nconstexpr int BrotliWriterBase::Options::kMaxCompressionLevel;\nconstexpr int BrotliWriterBase::Options::kDefaultCompressionLevel;\nconstexpr int BrotliWriterBase::Options::kMinWindowLog;\nconstexpr int BrotliWriterBase::Options::kMaxWindowLog;\nconstexpr int BrotliWriterBase::Options::kDefaultWindowLog;\n#endif\n\nnamespace {\n\nstruct BrotliEncoderDictionaryDeleter {\n  void operator()(BrotliEncoderPreparedDictionary* ptr) const {\n    BrotliEncoderDestroyPreparedDictionary(ptr);\n  }\n};\n\n}  \/\/ namespace\n\nvoid BrotliWriterBase::Initialize(Writer* dest, int compression_level,\n                                  int window_log,\n                                  absl::optional<Position> size_hint) {\n  RIEGELI_ASSERT(dest != nullptr)\n      << \"Failed precondition of BrotliWriter: null Writer pointer\";\n  if (ABSL_PREDICT_FALSE(!dest->healthy())) {\n    FailWithoutAnnotation(AnnotateOverDest(dest->status()));\n    return;\n  }\n  initial_compressed_pos_ = dest->pos();\n  compressor_.reset(BrotliEncoderCreateInstance(\n      allocator_.alloc_func(), allocator_.free_func(), allocator_.opaque()));\n  if (ABSL_PREDICT_FALSE(compressor_ == nullptr)) {\n    Fail(absl::InternalError(\"BrotliEncoderCreateInstance() failed\"));\n    return;\n  }\n  if (ABSL_PREDICT_FALSE(\n          !BrotliEncoderSetParameter(compressor_.get(), BROTLI_PARAM_QUALITY,\n                                     IntCast<uint32_t>(compression_level)))) {\n    Fail(absl::InternalError(\n        \"BrotliEncoderSetParameter(BROTLI_PARAM_QUALITY) failed\"));\n    return;\n  }\n  \/\/ Reduce `window_log` if `size_hint` indicates that data will be smaller.\n  \/\/ TODO(eustas): Do this automatically in the Brotli engine.\n  if (size_hint != absl::nullopt) {\n#if RIEGELI_INTERNAL_HAS_BUILTIN(__builtin_clzll) || \\\n    RIEGELI_INTERNAL_IS_GCC_VERSION(3, 4)\n    const int ceil_log2 =\n        __builtin_clzll(1) -\n        __builtin_clzll((SaturatingSub(*size_hint, Position{1})) | 1) + 1;\n    window_log =\n        SignedMin(window_log, SignedMax(ceil_log2, Options::kMinWindowLog));\n#else\n    while (Position{1} << (window_log - 1) >= *size_hint &&\n           window_log > Options::kMinWindowLog) {\n      --window_log;\n    }\n#endif\n  }\n  if (ABSL_PREDICT_FALSE(!BrotliEncoderSetParameter(\n          compressor_.get(), BROTLI_PARAM_LARGE_WINDOW,\n          uint32_t{window_log > BROTLI_MAX_WINDOW_BITS}))) {\n    Fail(absl::InternalError(\n        \"BrotliEncoderSetParameter(BROTLI_PARAM_LARGE_WINDOW) failed\"));\n    return;\n  }\n  if (ABSL_PREDICT_FALSE(\n          !BrotliEncoderSetParameter(compressor_.get(), BROTLI_PARAM_LGWIN,\n                                     IntCast<uint32_t>(window_log)))) {\n    Fail(absl::InternalError(\n        \"BrotliEncoderSetParameter(BROTLI_PARAM_LGWIN) failed\"));\n    return;\n  }\n  for (const RefCountedPtr<const BrotliDictionary::Chunk>& chunk :\n       dictionary_.chunks()) {\n    const std::shared_ptr<const BrotliEncoderPreparedDictionary> prepared =\n        chunk->PrepareCompressionDictionary();\n    if (ABSL_PREDICT_FALSE(prepared == nullptr)) {\n      Fail(absl::InternalError(\"BrotliEncoderPrepareDictionary() failed\"));\n      return;\n    }\n    if (ABSL_PREDICT_FALSE(!BrotliEncoderAttachPreparedDictionary(\n            compressor_.get(), prepared.get()))) {\n      Fail(absl::InternalError(\n          \"BrotliEncoderAttachPreparedDictionary() failed\"));\n      return;\n    }\n  }\n  if (size_hint != absl::nullopt) {\n    \/\/ Ignore errors from tuning.\n    BrotliEncoderSetParameter(compressor_.get(), BROTLI_PARAM_SIZE_HINT,\n                              SaturatingIntCast<uint32_t>(*size_hint));\n  }\n}\n\nvoid BrotliWriterBase::DoneBehindBuffer(absl::string_view src) {\n  RIEGELI_ASSERT_EQ(start_to_limit(), 0u)\n      << \"Failed precondition of BufferedWriter::DoneBehindBuffer(): \"\n         \"buffer not empty\";\n  if (ABSL_PREDICT_FALSE(!healthy())) return;\n  Writer& dest = *dest_writer();\n  WriteInternal(src, dest, BROTLI_OPERATION_FINISH);\n}\n\nvoid BrotliWriterBase::Done() {\n  BufferedWriter::Done();\n  compressor_.reset();\n  dictionary_ = BrotliDictionary();\n  allocator_ = BrotliAllocator();\n  associated_reader_.Reset();\n}\n\nabsl::Status BrotliWriterBase::AnnotateStatusImpl(absl::Status status) {\n  if (is_open()) {\n    Writer& dest = *dest_writer();\n    status = dest.AnnotateStatus(std::move(status));\n  }\n  \/\/ The status might have been annotated by `*dest->writer()` with the\n  \/\/ compressed position. Clarify that the current position is the uncompressed\n  \/\/ position instead of delegating to `BufferedWriter::AnnotateStatusImpl()`.\n  return AnnotateOverDest(std::move(status));\n}\n\nabsl::Status BrotliWriterBase::AnnotateOverDest(absl::Status status) {\n  if (is_open()) {\n    return Annotate(status, absl::StrCat(\"at uncompressed byte \", pos()));\n  }\n  return status;\n}\n\nbool BrotliWriterBase::WriteInternal(absl::string_view src) {\n  RIEGELI_ASSERT(!src.empty())\n      << \"Failed precondition of BufferedWriter::WriteInternal(): \"\n         \"nothing to write\";\n  RIEGELI_ASSERT(healthy())\n      << \"Failed precondition of BufferedWriter::WriteInternal(): \" << status();\n  Writer& dest = *dest_writer();\n  return WriteInternal(src, dest, BROTLI_OPERATION_PROCESS);\n}\n\ninline bool BrotliWriterBase::WriteInternal(absl::string_view src, Writer& dest,\n                                            BrotliEncoderOperation op) {\n  RIEGELI_ASSERT(healthy())\n      << \"Failed precondition of BrotliWriterBase::WriteInternal(): \"\n      << status();\n  if (ABSL_PREDICT_FALSE(src.size() >\n                         std::numeric_limits<Position>::max() - start_pos())) {\n    return FailOverflow();\n  }\n  size_t available_in = src.size();\n  const uint8_t* next_in = reinterpret_cast<const uint8_t*>(src.data());\n  size_t available_out = 0;\n  for (;;) {\n    if (ABSL_PREDICT_FALSE(!BrotliEncoderCompressStream(\n            compressor_.get(), op, &available_in, &next_in, &available_out,\n            nullptr, nullptr))) {\n      return Fail(absl::InternalError(\"BrotliEncoderCompressStream() failed\"));\n    }\n    size_t length = 0;\n    const char* const data = reinterpret_cast<const char*>(\n        BrotliEncoderTakeOutput(compressor_.get(), &length));\n    if (length > 0) {\n      if (ABSL_PREDICT_FALSE(!dest.Write(data, length))) {\n        return FailWithoutAnnotation(AnnotateOverDest(dest.status()));\n      }\n    } else if (available_in == 0) {\n      move_start_pos(src.size());\n      return true;\n    }\n  }\n}\n\nbool BrotliWriterBase::FlushBehindBuffer(absl::string_view src,\n                                         FlushType flush_type) {\n  RIEGELI_ASSERT_EQ(start_to_limit(), 0u)\n      << \"Failed precondition of BufferedWriter::FlushBehindBuffer(): \"\n         \"buffer not empty\";\n  if (ABSL_PREDICT_FALSE(!healthy())) return false;\n  Writer& dest = *dest_writer();\n  return WriteInternal(src, dest, BROTLI_OPERATION_FLUSH);\n}\n\nbool BrotliWriterBase::SupportsReadMode() {\n  Writer* const dest = dest_writer();\n  if (dest != nullptr && dest->SupportsReadMode()) {\n    for (const RefCountedPtr<const BrotliDictionary::Chunk>& chunk :\n         dictionary_.chunks()) {\n      if (chunk->type() == BrotliDictionary::Type::kNative) return false;\n    }\n    return true;\n  }\n  return false;\n}\n\nReader* BrotliWriterBase::ReadModeBehindBuffer(Position initial_pos) {\n  RIEGELI_ASSERT_EQ(start_to_limit(), 0u)\n      << \"Failed precondition of BufferedWriter::ReadModeBehindBuffer(): \"\n         \"buffer not empty\";\n  if (ABSL_PREDICT_FALSE(!BrotliWriterBase::FlushBehindBuffer(\n          absl::string_view(), FlushType::kFromObject))) {\n    return nullptr;\n  }\n  Writer& dest = *dest_writer();\n  Reader* const compressed_reader = dest.ReadMode(initial_compressed_pos_);\n  if (ABSL_PREDICT_FALSE(compressed_reader == nullptr)) {\n    FailWithoutAnnotation(AnnotateOverDest(dest.status()));\n    return nullptr;\n  }\n  BrotliReader<>* const reader = associated_reader_.ResetReader(\n      compressed_reader, BrotliReaderBase::Options()\n                             .set_dictionary(dictionary_)\n                             .set_allocator(allocator_));\n  reader->Seek(initial_pos);\n  return reader;\n}\n\n}  \/\/ namespace riegeli\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n\n#include <libport\/cstring>\n#include <libport\/sysexits.hh>\n\n#include <ast\/dot-print.hh>\n#include <ast\/nary.hh>\n#include <binder\/bind.hh>\n#include <flower\/flow.hh>\n#include <parser\/parse.hh>\n#include <rewrite\/rewrite.hh>\n\nusing namespace ast;\nusing namespace parser;\n\nstatic void\nusage()\n{\n  std::cout <<\n    \"usage: ast-dump FILE.u\\n\"\n    \"\\n\"\n    \"Dump ast in dot format.  Ast is dumped at each step of the\\n\"\n    \"transformation in a different file descriptor:\\n\"\n    \"\\n\"\n    \"  3: parsing\\n\"\n    \"  4: flowing\\n\"\n    \"  5: desugaring\\n\"\n    \"  6: rescoping\\n\"\n    \"  7: binding\\n\"\n    \"\\n\"\n    \"For instance, you might use it like this to see ast after\\n\"\n    \"desugaring:\\n\"\n    \"\\n\"\n    \"  _build\/src\/bin\/ast-dump foo.u 4> ast.dot && dotty ast.dot\\n\"\n    \"\\n\"\n    \"or, with zsh\\n\"\n    \"\\n\"\n    \"  dotty =(_build\/src\/bin\/ast-dump foo.u 4>&1)\\n\";\n  exit (EX_OK);\n}\n\nstatic void\nprint(rAst ast)\n{\n  static int fd = 2;\n  ++fd;\n  std::stringstream output;\n  ast::dot_print(ast, output);\n  size_t s = write(fd, output.str().c_str(), output.str().length());\n  assert(s == output.str().length());\n  (void)s;\n}\n\nint\nmain(int argc, const char* argv[])\n{\n  if (argc != 2\n      || libport::streq(argv[1], \"-h\")\n      || libport::streq(argv[1], \"--help\"))\n    usage();\n\n  rAst res = parse_file(argv[1])->ast_get();\n  print(res);\n\n  res = flower::flow(res);\n  print(res);\n\n  res = rewrite::desugar(res);\n  print(res);\n\n  res = rewrite::rescope(res);\n  print(res);\n\n  res = binder::bind(res);\n  print(res);\n}\n<commit_msg>ast-dump: accept closed fds.<commit_after>#include <iostream>\n\n#include <libport\/cerrno>\n#include <libport\/cstdio>\n#include <libport\/cstring>\n#include <libport\/sysexits.hh>\n\n#include <ast\/dot-print.hh>\n#include <ast\/nary.hh>\n#include <binder\/bind.hh>\n#include <flower\/flow.hh>\n#include <parser\/parse.hh>\n#include <rewrite\/rewrite.hh>\n\nusing namespace ast;\nusing namespace parser;\n\nstatic void\nusage()\n{\n  std::cout <<\n    \"usage: ast-dump FILE.u\\n\"\n    \"\\n\"\n    \"Dump ast in dot format.  Ast is dumped at each step of the\\n\"\n    \"transformation in a different file descriptor:\\n\"\n    \"\\n\"\n    \"  3: parsing\\n\"\n    \"  4: flowing\\n\"\n    \"  5: desugaring\\n\"\n    \"  6: rescoping\\n\"\n    \"  7: binding\\n\"\n    \"\\n\"\n    \"For instance, you might use it like this to see ast after\\n\"\n    \"desugaring:\\n\"\n    \"\\n\"\n    \"  _build\/src\/bin\/ast-dump foo.u 4> ast.dot && dotty ast.dot\\n\"\n    \"\\n\"\n    \"or, with zsh\\n\"\n    \"\\n\"\n    \"  dotty =(_build\/src\/bin\/ast-dump foo.u 4>&1)\\n\";\n  exit (EX_OK);\n}\n\nstatic void\nprint(rAst ast)\n{\n  static int fd = 2;\n  ++fd;\n  std::stringstream output;\n  ast::dot_print(ast, output);\n  ssize_t s = write(fd, output.str().c_str(), output.str().length());\n  if (0 <= s)\n  {\n    assert_eq(static_cast<size_t>(s), output.str().length());\n    std::cerr << \"filled fd \" << fd << std::endl;\n  }\n  else if (errno != EBADF)\n    perror(\"write\");\n  else\n    std::cerr << \"skipped fd \" << fd << std::endl;\n}\n\nint\nmain(int argc, const char* argv[])\n{\n  if (argc != 2\n      || libport::streq(argv[1], \"-h\")\n      || libport::streq(argv[1], \"--help\"))\n    usage();\n\n  rAst res = parse_file(argv[1])->ast_get();\n  print(res);\n\n  res = flower::flow(res);\n  print(res);\n\n  res = rewrite::desugar(res);\n  print(res);\n\n  res = rewrite::rescope(res);\n  print(res);\n\n  res = binder::bind(res);\n  print(res);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/eve:$Id$\n\/\/ Author: Matevz Tadel\n\n\/\/ Demonstrates usage of simple configuration via TEveParamList class.\n\n#include \"TEveManager.h\"\n#include \"TEveParamList.h\"\n#include \"TQObject.h\"\n\nclass TParamFollower\n{\npublic:\n   TParamFollower()\n   {\n      TQObject::Connect(\"TEveParamList\", \"ParamChanged(char*)\",\n                        \"TParamFollower\", this, \"OnParamChanged(char*)\");\n   }\n   virtual ~TParamFollower()\n   {\n      TQObject::Disconnect(\"TParamFollower\", \"ParamChanged(char*)\",\n                           this, \"OnParamChanged(char*)\");\n   }\n\n   void OnParamChanged(const char* parameter)\n   {\n      TEveParamList* pl = dynamic_cast<TEveParamList*>\n         (reinterpret_cast<TQObject*>(gTQSender));\n\n      printf(\"Change in param-list '%s', parameter '%s'.\\n\",\n             pl->GetElementName(), parameter);\n   }\n};\n\nvoid paramlist()\n{\n   TEveManager::Create();\n\n   TEveParamList* x = 0;\n\n   x = new TEveParamList(\"Top config\");\n   gEve->AddToListTree(x, 0);\n\n   x->AddParameter(TEveParamList::FloatConfig_t(\"Pepe\", 20, 0, 110));\n   x->AddParameter(TEveParamList::IntConfig_t(\"Dima\", 100, 0, 110));\n   x->AddParameter(TEveParamList::BoolConfig_t(\"Chris\", 1));\n\n   x = new TEveParamList(\"Another config\");\n   gEve->AddToListTree(x, 0);\n\n   x->AddParameter(TEveParamList::FloatConfig_t(\"MagneticField\", 4, -4, 4));\n   x->AddParameter(TEveParamList::FloatConfig_t(\"Temperature\", 16, -20, 40));\n\n   new TParamFollower;\n}\n<commit_msg>Revert - ClassDef\/ClassImp are still needed.<commit_after>\/\/ @(#)root\/eve:$Id$\n\/\/ Author: Matevz Tadel\n\n\/\/ Demonstrates usage of simple configuration via TEveParamList class.\n\n#include \"TEveManager.h\"\n#include \"TEveParamList.h\"\n#include \"TQObject.h\"\n\nclass TParamFollower\n{\npublic:\n   TParamFollower()\n   {\n      TQObject::Connect(\"TEveParamList\", \"ParamChanged(char*)\",\n                        \"TParamFollower\", this, \"OnParamChanged(char*)\");\n   }\n   virtual ~TParamFollower()\n   {\n      TQObject::Disconnect(\"TParamFollower\", \"ParamChanged(char*)\",\n                           this, \"OnParamChanged(char*)\");\n   }\n\n   void OnParamChanged(const char* parameter)\n   {\n      TEveParamList* pl = dynamic_cast<TEveParamList*>\n         (reinterpret_cast<TQObject*>(gTQSender));\n\n      printf(\"Change in param-list '%s', parameter '%s'.\\n\",\n             pl->GetElementName(), parameter);\n   }\n   \n   ClassDef(TParamFollower, 0);\n};\n\nClassImp(TParamFollower)\n\nvoid paramlist()\n{\n   TEveManager::Create();\n\n   TEveParamList* x = 0;\n\n   x = new TEveParamList(\"Top config\");\n   gEve->AddToListTree(x, 0);\n\n   x->AddParameter(TEveParamList::FloatConfig_t(\"Pepe\", 20, 0, 110));\n   x->AddParameter(TEveParamList::IntConfig_t(\"Dima\", 100, 0, 110));\n   x->AddParameter(TEveParamList::BoolConfig_t(\"Chris\", 1));\n\n   x = new TEveParamList(\"Another config\");\n   gEve->AddToListTree(x, 0);\n\n   x->AddParameter(TEveParamList::FloatConfig_t(\"MagneticField\", 4, -4, 4));\n   x->AddParameter(TEveParamList::FloatConfig_t(\"Temperature\", 16, -20, 40));\n\n   new TParamFollower;\n}\n<|endoftext|>"}
{"text":"<commit_before>TCanvas *vC1;\nTGraph *grxy, *grin, *grout;\n\nvoid approx()\n{\n\/******************************************************************************\n* Author: Christian Stratowa, Vienna, Austria.                                *\n* Created: 26 Aug 2001                            Last modified: 29 Sep 2001  *\n******************************************************************************\/\n\n\/\/ Macro to test interpolation function Approx()\n\n\/\/ test data (square)\n   Int_t n = 11;\n   Double_t x[] = {1,2,3,4,5,6,6,6,8,9,10};\n   Double_t y[] = {1,4,9,16,25,25,36,49,64,81,100};\n   grxy = new TGraph(n,x,y);\n\n\/\/ x values, for which y values should be interpolated\n   Int_t nout = 14;\n   Double_t xout[] = {1.2,1.7,2.5,3.2,4.4,5.2,5.7,6.5,7.6,8.3,9.7,10.4,11.3,13};\n\n\/\/ create Canvas\n   vC1 = new TCanvas(\"vC1\",\"square\",200,10,700,700);\n   vC1->Divide(2,2);\n\n\/\/ initialize graph with data\n   grin = new TGraph(n,x,y);\n\/\/ interpolate at equidistant points (use mean for tied x-values)\n   TGraphSmooth *gs = new TGraphSmooth(\"normal\");\n   grout = gs->Approx(grin,\"linear\");\n   DrawSmooth(1,\"Approx: ties = mean\",\"X-axis\",\"Y-axis\");\n\n\/\/ re-initialize graph with data (since graph points were set to unique vales)\n   grin = new TGraph(n,x,y);\n\/\/ interpolate at given points xout\n   grout = gs->Approx(grin,\"linear\", 14, xout, 0, 130);\n   DrawSmooth(2,\"Approx: ties = mean\",\"\",\"\");\n\n\/\/ print output variables for given values xout\n   Int_t vNout = grout->GetN();\n   Double_t vXout, vYout;\n   for (Int_t k=0;k<vNout;k++) {\n      grout->GetPoint(k, vXout, vYout);\n      cout << \"k= \" << k << \"  vXout[k]= \" << vXout\n           << \"  vYout[k]= \" << vYout << endl;\n   }\n\n\/\/ re-initialize graph with data\n   grin = new TGraph(n,x,y);\n\/\/ interpolate at equidistant points (use min for tied x-values)\n\/\/   grout = gs->Approx(grin,\"linear\", 50, 0, 0, 0, 1, 0, \"min\");\n   grout = gs->Approx(grin,\"constant\", 50, 0, 0, 0, 1, 0.5, \"min\");\n   DrawSmooth(3,\"Approx: ties = min\",\"\",\"\");\n\n\/\/ re-initialize graph with data\n   grin = new TGraph(n,x,y);\n\/\/ interpolate at equidistant points (use max for tied x-values)\n   grout = gs->Approx(grin,\"linear\", 14, xout, 0, 0, 2, 0, \"max\");\n   DrawSmooth(4,\"Approx: ties = max\",\"\",\"\");\n\n\/\/ cleanup\n   delete gs;\n}\n\nvoid DrawSmooth(Int_t pad, const char *title, const char *xt, const char *yt)\n{\n   vC1->cd(pad);\n   TH1F *vFrame = vC1->DrawFrame(0,0,15,150);\n   vFrame->SetTitle(title);\n   vFrame->SetTitleSize(0.2);\n   vFrame->SetXTitle(xt);\n   vFrame->SetYTitle(yt);\n   grxy->SetMarkerColor(kBlue);\n   grxy->SetMarkerStyle(21);\n   grxy->SetMarkerSize(0.5);\n   grxy->Draw(\"P\");\n   grin->SetMarkerColor(kRed);\n   grin->SetMarkerStyle(5);\n   grin->SetMarkerSize(0.7);\n   grin->Draw(\"P\");\n   grout->DrawClone(\"LP\");\n}\n\n<commit_msg>Use gPad->DrawFrame instead of VC1->DrawFrame<commit_after>TCanvas *vC1;\nTGraph *grxy, *grin, *grout;\n\nvoid approx()\n{\n\/******************************************************************************\n* Author: Christian Stratowa, Vienna, Austria.                                *\n* Created: 26 Aug 2001                            Last modified: 29 Sep 2001  *\n******************************************************************************\/\n\n\/\/ Macro to test interpolation function Approx()\n\n\/\/ test data (square)\n   Int_t n = 11;\n   Double_t x[] = {1,2,3,4,5,6,6,6,8,9,10};\n   Double_t y[] = {1,4,9,16,25,25,36,49,64,81,100};\n   grxy = new TGraph(n,x,y);\n\n\/\/ x values, for which y values should be interpolated\n   Int_t nout = 14;\n   Double_t xout[] = {1.2,1.7,2.5,3.2,4.4,5.2,5.7,6.5,7.6,8.3,9.7,10.4,11.3,13};\n\n\/\/ create Canvas\n   vC1 = new TCanvas(\"vC1\",\"square\",200,10,700,700);\n   vC1->Divide(2,2);\n\n\/\/ initialize graph with data\n   grin = new TGraph(n,x,y);\n\/\/ interpolate at equidistant points (use mean for tied x-values)\n   TGraphSmooth *gs = new TGraphSmooth(\"normal\");\n   grout = gs->Approx(grin,\"linear\");\n   DrawSmooth(1,\"Approx: ties = mean\",\"X-axis\",\"Y-axis\");\n\n\/\/ re-initialize graph with data (since graph points were set to unique vales)\n   grin = new TGraph(n,x,y);\n\/\/ interpolate at given points xout\n   grout = gs->Approx(grin,\"linear\", 14, xout, 0, 130);\n   DrawSmooth(2,\"Approx: ties = mean\",\"\",\"\");\n\n\/\/ print output variables for given values xout\n   Int_t vNout = grout->GetN();\n   Double_t vXout, vYout;\n   for (Int_t k=0;k<vNout;k++) {\n      grout->GetPoint(k, vXout, vYout);\n      cout << \"k= \" << k << \"  vXout[k]= \" << vXout\n           << \"  vYout[k]= \" << vYout << endl;\n   }\n\n\/\/ re-initialize graph with data\n   grin = new TGraph(n,x,y);\n\/\/ interpolate at equidistant points (use min for tied x-values)\n\/\/   grout = gs->Approx(grin,\"linear\", 50, 0, 0, 0, 1, 0, \"min\");\n   grout = gs->Approx(grin,\"constant\", 50, 0, 0, 0, 1, 0.5, \"min\");\n   DrawSmooth(3,\"Approx: ties = min\",\"\",\"\");\n\n\/\/ re-initialize graph with data\n   grin = new TGraph(n,x,y);\n\/\/ interpolate at equidistant points (use max for tied x-values)\n   grout = gs->Approx(grin,\"linear\", 14, xout, 0, 0, 2, 0, \"max\");\n   DrawSmooth(4,\"Approx: ties = max\",\"\",\"\");\n\n\/\/ cleanup\n   delete gs;\n}\n\nvoid DrawSmooth(Int_t pad, const char *title, const char *xt, const char *yt)\n{\n   vC1->cd(pad);\n   TH1F *vFrame = gPad->DrawFrame(0,0,15,150);\n   vFrame->SetTitle(title);\n   vFrame->SetTitleSize(0.2);\n   vFrame->SetXTitle(xt);\n   vFrame->SetYTitle(yt);\n   grxy->SetMarkerColor(kBlue);\n   grxy->SetMarkerStyle(21);\n   grxy->SetMarkerSize(0.5);\n   grxy->Draw(\"P\");\n   grin->SetMarkerColor(kRed);\n   grin->SetMarkerStyle(5);\n   grin->SetMarkerSize(0.7);\n   grin->Draw(\"P\");\n   grout->DrawClone(\"LP\");\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * WebRTCConnection.cpp\n *\n *  Created on: Mar 14, 2012\n *      Author: pedro\n *\/\n\n#include \"WebRTCConnection.h\"\n#include \"sdpinfo.h\"\n\n#include <cstdio>\n\n#include <boost\/thread.hpp>\n\nWebRTCConnection::WebRTCConnection(bool standAlone): MediaReceiver() {\n\t\/\/ TODO Auto-generated constructor stub\n\tvideo = 1;\n\taudio = 1;\n\tvideo_ssrc = 55543;\n\taudio_ssrc = 44444;\n\tvideo_receiver = NULL;\n\taudio_receiver = NULL;\n\taudio_nice = NULL;\n\tvideo_nice = NULL;\n\taudio_nice_rtcp = NULL;\n\tvideo_nice_rtcp = NULL;\n\taudio_srtp = NULL;\n\tvideo_srtp = NULL;\n\n\n\tthis->standAlone = standAlone;\n\tif(video){\n\t\tvideo_nice = new NiceConnection(VIDEO_TYPE,\"\");\n\/\/\t\tvideo_nice_rtcp = new NiceConnection(VIDEO_TYPE,\"video_rtcp\");\n\t\tvideo_nice->setWebRTCConnection(this);\n\/\/\t\tvideo_nice_rtcp->setWebRTCConnection(this);\n\t\tvideo_srtp = new SrtpChannel();\n\/\/\t\tvideo_receiver = this;\n\t\tCryptoInfo crytp;\n\t\tcrytp.cipher_suite=std::string(\"AES_CM_128_HMAC_SHA1_80\");\n\t\tcrytp.media_type= VIDEO_TYPE;\n\t\tstd::string key = SrtpChannel::generateBase64Key();\n\n\t\tcrytp.key_params = key;\n\t\tcrytp.tag = 0;\n\/\/\t\tcrytp.key_params = std::string(\"b0c+3druTInEz+C4EH2widkWdh7u9McnEn8vy\/JM\");\n\t\tlocal_sdp.addCrypto(crytp);\n\t\tlocal_sdp.video_ssrc = video_ssrc;\n\t}\n\tif (audio){\n\t\taudio_nice = new NiceConnection(AUDIO_TYPE, \"\");\n\/\/\t\taudio_nice_rtcp = new NiceConnection(AUDIO_TYPE, \"rtcp\");\n\t\taudio_nice->setWebRTCConnection(this);\n\/\/\t\taudio_nice_rtcp->setWebRTCConnection(this);\n\t\taudio_srtp = new SrtpChannel();\n\/\/\t\taudio_receiver = this;\n\t\tCryptoInfo crytp;\n\t\tcrytp.cipher_suite=std::string(\"AES_CM_128_HMAC_SHA1_80\");\n\t\tcrytp.media_type= AUDIO_TYPE;\n\t\tcrytp.tag = 1;\n\t\tstd::string key = SrtpChannel::generateBase64Key();\n\t\tcrytp.key_params = key;\n\/\/\t\tcrytp.key_params = std::string(\"b0c+3druTInEz+C4EH2widkWdh7u9McnEn8vy\/JM\");\n\t\tlocal_sdp.addCrypto(crytp);\n\t\tlocal_sdp.audio_ssrc = audio_ssrc;\n\n\t}\n\tprintf(\"WebRTCConnection constructed with video %d audio %d\\n\", video, audio);\n}\n\nWebRTCConnection::~WebRTCConnection() {\n\tthis->close();\n\/\/\tif (video_nice!=NULL)\n\/\/\t\tdelete video_nice;\n\/\/\tif (video_nice_rtcp)\n\/\/\t\tdelete video_nice_rtcp;\n\/\/\tif(video_srtp!=NULL)\n\/\/\t\tdelete video_srtp;\n\/\/\tif (audio_nice!=NULL)\n\/\/\t\tdelete audio_nice;\n\/\/\tif (audio_nice_rtcp!=NULL)\n\/\/\t\t\tdelete audio_nice_rtcp;\n\/\/\tif (audio_srtp!=NULL)\n\/\/\t\t\tdelete audio_srtp;\n\n\t\/\/ TODO Auto-generated destructor stub\n}\n\nbool WebRTCConnection::init(){\n\tstd::vector<CandidateInfo> *cands;\n\tif (video){\n\n\t\tvideo_nice->start();\n\t\tsleep(1);\n\/\/\t\tvideo_nice_rtcp->start();\n\/\/\t\tsleep(1);\n\n\t\twhile (video_nice->state!=NiceConnection::CANDIDATES_GATHERED){\n\t\t\tsleep(1);\n\t\t}\n\n\n\t\tcands = video_nice->local_candidates;\n\n\t\tfor (unsigned int it = 0; it<cands->size();it++ ){\n\t\t\tCandidateInfo cand = cands->at(it);\n\t\t\tlocal_sdp.addCandidate(cand);\n\t\t}\n\/\/\t\twhile (video_nice_rtcp->state!=NiceConnection::CANDIDATES_GATHERED){\n\/\/\t\t\tsleep(1);\n\/\/\t\t}\n\n\/\/\t\tcands = video_nice_rtcp->local_candidates;\n\/\/\t\tfor (unsigned int it = 0; it<cands->size();it++ ){\n\/\/\t\t\tCandidateInfo cand = cands->at(it);\n\/\/\t\t\tlocal_sdp.addCandidate(cand);\n\/\/\t\t}\n\n\t}\n\tif (audio){\n\t\taudio_nice->start();\n\t\tsleep(1);\n\/\/\t\taudio_nice_rtcp->start();\n\t\tsleep(1);\n\t\twhile (audio_nice->state!=NiceConnection::CANDIDATES_GATHERED){\n\t\t\tsleep(1);\n\t\t}\n\n\t\tcands = audio_nice->local_candidates;\n\n\t\tfor (unsigned int it = 0; it<cands->size();it++ ){\n\t\t\tCandidateInfo cand = cands->at(it);\n\t\t\tlocal_sdp.addCandidate(cand);\n\t\t}\n\/\/\t\twhile (audio_nice_rtcp->state!=NiceConnection::CANDIDATES_GATHERED){\n\/\/\t\t\tsleep(1);\n\/\/\t\t}\n\n\/\/\t\tcands = audio_nice_rtcp->local_candidates;\n\/\/\t\tfor (unsigned int it = 0; it<cands->size();it++ ){\n\/\/\t\t\tCandidateInfo cand = cands->at(it);\n\/\/\t\t\tlocal_sdp.addCandidate(cand);\n\/\/\t\t}\n\n\t}\n\n\treturn true;\n}\n\nvoid WebRTCConnection::close(){\n\tif (audio_nice!=NULL){\n\t\taudio_nice->close();\n\t\taudio_nice->join();\n\t\tdelete audio_nice;\n\t}\n\tif (audio_nice_rtcp!=NULL){\n\t\taudio_nice_rtcp->close();\n\t\taudio_nice_rtcp->join();\n\t\tdelete audio_nice_rtcp;\n\t}\n\tif (video_nice!=NULL){\n\t\tvideo_nice->close();\n\t\tvideo_nice->join();\n\t\tdelete video_nice;\n\t}\n\tif (video_nice_rtcp!=NULL){\n\t\tvideo_nice_rtcp->close();\n\t\tvideo_nice_rtcp->join();\n\t\tdelete video_nice_rtcp;\n\t}\n\tif (audio_srtp!=NULL)\n\t\tdelete audio_srtp;\n\tif (video_srtp!=NULL)\n\t\tdelete video_srtp;\n}\nbool WebRTCConnection::setRemoteSDP(const std::string &sdp){\n\tremote_sdp.initWithSDP(sdp);\n\tstd::vector<CryptoInfo> crypto_remote = remote_sdp.getCryptoInfos();\n\tstd::vector<CryptoInfo> crypto_local = local_sdp.getCryptoInfos();\n\n\tCryptoInfo cryptLocal_video;\n\tCryptoInfo cryptLocal_audio;\n\tCryptoInfo cryptRemote_video;\n\tCryptoInfo cryptRemote_audio;\n\n\tfor (unsigned int it = 0; it < crypto_remote.size(); it++){\n\t\tCryptoInfo cryptemp = crypto_remote[it];\n\t\tif (cryptemp.media_type == VIDEO_TYPE && !cryptemp.cipher_suite.compare(\"AES_CM_128_HMAC_SHA1_80\")){\n\t\t\tcryptRemote_video = cryptemp;\n\t\t}else if (cryptemp.media_type == AUDIO_TYPE && !cryptemp.cipher_suite.compare(\"AES_CM_128_HMAC_SHA1_80\")){\n\t\t\tcryptRemote_audio = cryptemp;\n\t\t}\n\t}\n\tfor (unsigned int it = 0; it < crypto_local.size(); it++){\n\t\tCryptoInfo cryptemp = crypto_local[it];\n\t\tif (cryptemp.media_type == VIDEO_TYPE && !cryptemp.cipher_suite.compare(\"AES_CM_128_HMAC_SHA1_80\")){\n\t\t\tcryptLocal_video = cryptemp;\n\t\t}else if (cryptemp.media_type == AUDIO_TYPE && !cryptemp.cipher_suite.compare(\"AES_CM_128_HMAC_SHA1_80\")){\n\t\t\tcryptLocal_audio = cryptemp;\n\t\t}\n\t}\n\n\tif(video){\n\t\tvideo_nice->setRemoteCandidates(remote_sdp.getCandidateInfos());\n\/\/\t\tvideo_nice_rtcp->setRemoteCandidates(remote_sdp.getCandidateInfos());\n\t\tvideo_srtp->SetRtpParams((char*)cryptLocal_video.key_params.c_str(), (char*)cryptRemote_video.key_params.c_str());\n\n\t}\n\tif (audio){\n\t\taudio_nice->setRemoteCandidates(remote_sdp.getCandidateInfos());\n\/\/\t\taudio_nice_rtcp->setRemoteCandidates(remote_sdp.getCandidateInfos());\n\n\t\taudio_srtp->SetRtpParams((char*)cryptLocal_audio.key_params.c_str(), (char*)cryptRemote_audio.key_params.c_str());\n\t}\n\tif (standAlone){\n\t\tif (audio)\n\t\t\taudio_nice->join();\n\t\telse\n\t\t\tvideo_nice->join();\n\t}\n\n\treturn true;\n}\nstd::string WebRTCConnection::getLocalSDP(){\n\treturn local_sdp.getSDP();\n}\nvoid WebRTCConnection::setAudioReceiver(MediaReceiver *receiv){\n\tthis->audio_receiver = receiv;\n}\nvoid WebRTCConnection::setVideoReceiver(MediaReceiver *receiv){\n\tthis->video_receiver = receiv;\n}\n\nint WebRTCConnection::receiveAudioData(char* buf, int len){\n\tboost::mutex::scoped_lock lock(receiveAudio);\n\n\tint res=-1;\n\tint length= len;\n\tif (audio_srtp){\n\t\taudio_srtp->ProtectRtp(buf, &length);\n\/\/\t\tprintf(\"A mandar %d\\n\", length);\n\t}\n\tif (len<=0)\n\t\t\treturn length;\n\tif (audio_nice){\n\t\tres= audio_nice->sendData(buf, length);\n\t}\n\treturn res;\n}\nint WebRTCConnection::receiveVideoData(char* buf, int len){\n\tboost::mutex::scoped_lock lock(receiveVideo);\n\n\tint res=-1;\n\tint length= len;\n\tif (video_srtp){\n\t\tvideo_srtp->ProtectRtp(buf, &length);\n\/\/\t\tprintf(\"A mandar %d\\n\", length);\n\t}\n\tif (length<=10)\n\t\treturn length;\n\tif (video_nice){\n\t\tres= video_nice->sendData(buf, length);\n\t}\n\treturn res;\n}\n\nint WebRTCConnection::receiveNiceData(char* buf, int len, NiceConnection* nice){\n\tboost::mutex::scoped_lock lock(write_mutex);\n\tif (audio_receiver == NULL && video_receiver == NULL)\n\t\treturn 0;\n\n\tint length = len;\n\n\tif(nice->media_type == AUDIO_TYPE){\n\t\tif (audio_receiver!=NULL){\n\t\t\tif (audio_srtp){\n\/\/\t\t\t\tprintf(\"por aqui %d\\n\", length);\n\t\t\t\taudio_srtp->UnprotectRtp(buf,&length);\n\/\/\t\t\t\tprintf(\"por desprotegido audio %d\\n\", length);\n\t\t\t}\n\t\t\tif(length<=0)\n\t\t\t\treturn length;\n\t\t\trtpheader *head = (rtpheader*) buf;\n\t\t\thead->ssrc = htonl(audio_ssrc);\n\t\t\taudio_receiver->receiveAudioData(buf, length);\n\t\t\treturn length;\n\t\t}\n\t}\n\telse if(nice->media_type == VIDEO_TYPE){\n\/\/\t\tprintf(\"RECIBIDO VIDEO %d\\n\", length);\n\n\t\tif (video_receiver!=NULL){\n\t\t\tif (video_srtp){\n\t\t\t\tvideo_srtp->UnprotectRtp(buf,&length);\n\/\/\t\t\t\tprintf(\"por desprotegido video %d\\n\", length);\n\n\t\t\t}\n\t\t\tif(length<=0)\n\t\t\t\treturn length;\n\t\t\trtpheader *head = (rtpheader*) buf;\n\t\t\thead->ssrc = htonl(video_ssrc);\n\t\t\tvideo_receiver->receiveVideoData(buf, length);\n\t\t\treturn length;\n\t\t}\n\t}\n\treturn -1;\n}\n\n\n\n\n<commit_msg>Now crypto and candidate info is checked when setting up receiving connections (ice and srtp)<commit_after>\/*\n * WebRTCConnection.cpp\n *\n *  Created on: Mar 14, 2012\n *      Author: pedro\n *\/\n\n#include \"WebRTCConnection.h\"\n#include \"sdpinfo.h\"\n\n#include <cstdio>\n\n#include <boost\/thread.hpp>\n\nWebRTCConnection::WebRTCConnection(bool standAlone): MediaReceiver() {\n\t\/\/ TODO Auto-generated constructor stub\n\tvideo = 1;\n\taudio = 1;\n\tvideo_ssrc = 55543;\n\taudio_ssrc = 44444;\n\tvideo_receiver = NULL;\n\taudio_receiver = NULL;\n\taudio_nice = NULL;\n\tvideo_nice = NULL;\n\taudio_nice_rtcp = NULL;\n\tvideo_nice_rtcp = NULL;\n\taudio_srtp = NULL;\n\tvideo_srtp = NULL;\n\n\n\tthis->standAlone = standAlone;\n\tif(video){\n\t\tvideo_nice = new NiceConnection(VIDEO_TYPE,\"\");\n\/\/\t\tvideo_nice_rtcp = new NiceConnection(VIDEO_TYPE,\"video_rtcp\");\n\t\tvideo_nice->setWebRTCConnection(this);\n\/\/\t\tvideo_nice_rtcp->setWebRTCConnection(this);\n\t\tvideo_srtp = new SrtpChannel();\n\/\/\t\tvideo_receiver = this;\n\t\tCryptoInfo crytp;\n\t\tcrytp.cipher_suite=std::string(\"AES_CM_128_HMAC_SHA1_80\");\n\t\tcrytp.media_type= VIDEO_TYPE;\n\t\tstd::string key = SrtpChannel::generateBase64Key();\n\n\t\tcrytp.key_params = key;\n\t\tcrytp.tag = 0;\n\/\/\t\tcrytp.key_params = std::string(\"b0c+3druTInEz+C4EH2widkWdh7u9McnEn8vy\/JM\");\n\t\tlocal_sdp.addCrypto(crytp);\n\t\tlocal_sdp.video_ssrc = video_ssrc;\n\t}\n\tif (audio){\n\t\taudio_nice = new NiceConnection(AUDIO_TYPE, \"\");\n\/\/\t\taudio_nice_rtcp = new NiceConnection(AUDIO_TYPE, \"rtcp\");\n\t\taudio_nice->setWebRTCConnection(this);\n\/\/\t\taudio_nice_rtcp->setWebRTCConnection(this);\n\t\taudio_srtp = new SrtpChannel();\n\/\/\t\taudio_receiver = this;\n\t\tCryptoInfo crytp;\n\t\tcrytp.cipher_suite=std::string(\"AES_CM_128_HMAC_SHA1_80\");\n\t\tcrytp.media_type= AUDIO_TYPE;\n\t\tcrytp.tag = 1;\n\t\tstd::string key = SrtpChannel::generateBase64Key();\n\t\tcrytp.key_params = key;\n\/\/\t\tcrytp.key_params = std::string(\"b0c+3druTInEz+C4EH2widkWdh7u9McnEn8vy\/JM\");\n\t\tlocal_sdp.addCrypto(crytp);\n\t\tlocal_sdp.audio_ssrc = audio_ssrc;\n\n\t}\n\tprintf(\"WebRTCConnection constructed with video %d audio %d\\n\", video, audio);\n}\n\nWebRTCConnection::~WebRTCConnection() {\n\tthis->close();\n\/\/\tif (video_nice!=NULL)\n\/\/\t\tdelete video_nice;\n\/\/\tif (video_nice_rtcp)\n\/\/\t\tdelete video_nice_rtcp;\n\/\/\tif(video_srtp!=NULL)\n\/\/\t\tdelete video_srtp;\n\/\/\tif (audio_nice!=NULL)\n\/\/\t\tdelete audio_nice;\n\/\/\tif (audio_nice_rtcp!=NULL)\n\/\/\t\t\tdelete audio_nice_rtcp;\n\/\/\tif (audio_srtp!=NULL)\n\/\/\t\t\tdelete audio_srtp;\n\n\t\/\/ TODO Auto-generated destructor stub\n}\n\nbool WebRTCConnection::init(){\n\tstd::vector<CandidateInfo> *cands;\n\tif (video){\n\n\t\tvideo_nice->start();\n\t\tsleep(1);\n\/\/\t\tvideo_nice_rtcp->start();\n\/\/\t\tsleep(1);\n\n\t\twhile (video_nice->state!=NiceConnection::CANDIDATES_GATHERED){\n\t\t\tsleep(1);\n\t\t}\n\n\n\t\tcands = video_nice->local_candidates;\n\n\t\tfor (unsigned int it = 0; it<cands->size();it++ ){\n\t\t\tCandidateInfo cand = cands->at(it);\n\t\t\tlocal_sdp.addCandidate(cand);\n\t\t}\n\/\/\t\twhile (video_nice_rtcp->state!=NiceConnection::CANDIDATES_GATHERED){\n\/\/\t\t\tsleep(1);\n\/\/\t\t}\n\n\/\/\t\tcands = video_nice_rtcp->local_candidates;\n\/\/\t\tfor (unsigned int it = 0; it<cands->size();it++ ){\n\/\/\t\t\tCandidateInfo cand = cands->at(it);\n\/\/\t\t\tlocal_sdp.addCandidate(cand);\n\/\/\t\t}\n\n\t}\n\tif (audio){\n\t\taudio_nice->start();\n\t\tsleep(1);\n\/\/\t\taudio_nice_rtcp->start();\n\t\tsleep(1);\n\t\twhile (audio_nice->state!=NiceConnection::CANDIDATES_GATHERED){\n\t\t\tsleep(1);\n\t\t}\n\n\t\tcands = audio_nice->local_candidates;\n\n\t\tfor (unsigned int it = 0; it<cands->size();it++ ){\n\t\t\tCandidateInfo cand = cands->at(it);\n\t\t\tlocal_sdp.addCandidate(cand);\n\t\t}\n\/\/\t\twhile (audio_nice_rtcp->state!=NiceConnection::CANDIDATES_GATHERED){\n\/\/\t\t\tsleep(1);\n\/\/\t\t}\n\n\/\/\t\tcands = audio_nice_rtcp->local_candidates;\n\/\/\t\tfor (unsigned int it = 0; it<cands->size();it++ ){\n\/\/\t\t\tCandidateInfo cand = cands->at(it);\n\/\/\t\t\tlocal_sdp.addCandidate(cand);\n\/\/\t\t}\n\n\t}\n\n\treturn true;\n}\n\nvoid WebRTCConnection::close(){\n\tif (audio_nice!=NULL){\n\t\taudio_nice->close();\n\t\taudio_nice->join();\n\t\tdelete audio_nice;\n\t}\n\tif (audio_nice_rtcp!=NULL){\n\t\taudio_nice_rtcp->close();\n\t\taudio_nice_rtcp->join();\n\t\tdelete audio_nice_rtcp;\n\t}\n\tif (video_nice!=NULL){\n\t\tvideo_nice->close();\n\t\tvideo_nice->join();\n\t\tdelete video_nice;\n\t}\n\tif (video_nice_rtcp!=NULL){\n\t\tvideo_nice_rtcp->close();\n\t\tvideo_nice_rtcp->join();\n\t\tdelete video_nice_rtcp;\n\t}\n\tif (audio_srtp!=NULL)\n\t\tdelete audio_srtp;\n\tif (video_srtp!=NULL)\n\t\tdelete video_srtp;\n}\nbool WebRTCConnection::setRemoteSDP(const std::string &sdp){\n\tremote_sdp.initWithSDP(sdp);\n\tstd::vector<CryptoInfo> crypto_remote = remote_sdp.getCryptoInfos();\n\tstd::vector<CryptoInfo> crypto_local = local_sdp.getCryptoInfos();\n\n\tCryptoInfo cryptLocal_video;\n\tCryptoInfo cryptLocal_audio;\n\tCryptoInfo cryptRemote_video;\n\tCryptoInfo cryptRemote_audio;\n\n\tfor (unsigned int it = 0; it < crypto_remote.size(); it++){\n\t\tCryptoInfo cryptemp = crypto_remote[it];\n\t\tif (cryptemp.media_type == VIDEO_TYPE && !cryptemp.cipher_suite.compare(\"AES_CM_128_HMAC_SHA1_80\")){\n\t\t\tvideo = true;\n\t\t\tcryptRemote_video = cryptemp;\n\t\t}else if (cryptemp.media_type == AUDIO_TYPE && !cryptemp.cipher_suite.compare(\"AES_CM_128_HMAC_SHA1_80\")){\n\t\t\taudio = true;\n\t\t\tcryptRemote_audio = cryptemp;\n\t\t}\n\t}\n\tfor (unsigned int it = 0; it < crypto_local.size(); it++){\n\t\tCryptoInfo cryptemp = crypto_local[it];\n\t\tif (cryptemp.media_type == VIDEO_TYPE && !cryptemp.cipher_suite.compare(\"AES_CM_128_HMAC_SHA1_80\")){\n\t\t\tcryptLocal_video = cryptemp;\n\t\t}else if (cryptemp.media_type == AUDIO_TYPE && !cryptemp.cipher_suite.compare(\"AES_CM_128_HMAC_SHA1_80\")){\n\t\t\tcryptLocal_audio = cryptemp;\n\t\t}\n\t}\n\n\tif(video){\n\t\tvideo_nice->setRemoteCandidates(remote_sdp.getCandidateInfos());\n\/\/\t\tvideo_nice_rtcp->setRemoteCandidates(remote_sdp.getCandidateInfos());\n\t\tvideo_srtp->SetRtpParams((char*)cryptLocal_video.key_params.c_str(), (char*)cryptRemote_video.key_params.c_str());\n\n\t}\n\tif (audio){\n\t\taudio_nice->setRemoteCandidates(remote_sdp.getCandidateInfos());\n\/\/\t\taudio_nice_rtcp->setRemoteCandidates(remote_sdp.getCandidateInfos());\n\n\t\taudio_srtp->SetRtpParams((char*)cryptLocal_audio.key_params.c_str(), (char*)cryptRemote_audio.key_params.c_str());\n\t}\n\tif (standAlone){\n\t\tif (audio)\n\t\t\taudio_nice->join();\n\t\telse\n\t\t\tvideo_nice->join();\n\t}\n\n\treturn true;\n}\nstd::string WebRTCConnection::getLocalSDP(){\n\treturn local_sdp.getSDP();\n}\nvoid WebRTCConnection::setAudioReceiver(MediaReceiver *receiv){\n\tthis->audio_receiver = receiv;\n}\nvoid WebRTCConnection::setVideoReceiver(MediaReceiver *receiv){\n\tthis->video_receiver = receiv;\n}\n\nint WebRTCConnection::receiveAudioData(char* buf, int len){\n\tboost::mutex::scoped_lock lock(receiveAudio);\n\n\tint res=-1;\n\tint length= len;\n\tif (audio_srtp){\n\t\taudio_srtp->ProtectRtp(buf, &length);\n\/\/\t\tprintf(\"A mandar %d\\n\", length);\n\t}\n\tif (len<=0)\n\t\t\treturn length;\n\tif (audio_nice){\n\t\tres= audio_nice->sendData(buf, length);\n\t}\n\treturn res;\n}\nint WebRTCConnection::receiveVideoData(char* buf, int len){\n\tboost::mutex::scoped_lock lock(receiveVideo);\n\n\tint res=-1;\n\tint length= len;\n\tif (video_srtp){\n\t\tvideo_srtp->ProtectRtp(buf, &length);\n\/\/\t\tprintf(\"A mandar %d\\n\", length);\n\t}\n\tif (length<=10)\n\t\treturn length;\n\tif (video_nice){\n\t\tres= video_nice->sendData(buf, length);\n\t}\n\treturn res;\n}\n\nint WebRTCConnection::receiveNiceData(char* buf, int len, NiceConnection* nice){\n\tboost::mutex::scoped_lock lock(write_mutex);\n\tif (audio_receiver == NULL && video_receiver == NULL)\n\t\treturn 0;\n\n\tint length = len;\n\n\tif(nice->media_type == AUDIO_TYPE){\n\t\tif (audio_receiver!=NULL){\n\t\t\tif (audio_srtp){\n\/\/\t\t\t\tprintf(\"por aqui %d\\n\", length);\n\t\t\t\taudio_srtp->UnprotectRtp(buf,&length);\n\/\/\t\t\t\tprintf(\"por desprotegido audio %d\\n\", length);\n\t\t\t}\n\t\t\tif(length<=0)\n\t\t\t\treturn length;\n\t\t\trtpheader *head = (rtpheader*) buf;\n\t\t\thead->ssrc = htonl(audio_ssrc);\n\t\t\taudio_receiver->receiveAudioData(buf, length);\n\t\t\treturn length;\n\t\t}\n\t}\n\telse if(nice->media_type == VIDEO_TYPE){\n\/\/\t\tprintf(\"RECIBIDO VIDEO %d\\n\", length);\n\n\t\tif (video_receiver!=NULL){\n\t\t\tif (video_srtp){\n\t\t\t\tvideo_srtp->UnprotectRtp(buf,&length);\n\/\/\t\t\t\tprintf(\"por desprotegido video %d\\n\", length);\n\n\t\t\t}\n\t\t\tif(length<=0)\n\t\t\t\treturn length;\n\t\t\trtpheader *head = (rtpheader*) buf;\n\t\t\thead->ssrc = htonl(video_ssrc);\n\t\t\tvideo_receiver->receiveVideoData(buf, length);\n\t\t\treturn length;\n\t\t}\n\t}\n\treturn -1;\n}\n\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include <gtest\/gtest.h>\n\n#include \"gisfac.h\"\n\n#include \"agent_tests.h\"\n#include \"context.h\"\n#include \"facility_tests.h\"\n\nusing cyclus::GISFac;\n\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nclass GISFacTest : public ::testing::Test {\n protected:\n  cyclus::TestContext tc_;\n  GISFac* facility_a_;\n  GISFac* facility_b_;\n\n  virtual void SetUp() {}\n\n  virtual void TearDown() {}\n};\n\nTEST_F(GISFacTest, set_longitude) {\n  facility_a_->gis->set_longitude(92.3);\n  EXPECT_EQ(92.3, facility_a_->gis->get_longitude());\n}\n\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nTEST_F(GISFacTest, clone) {\n  GISFac* cloned_fac = dynamic_cast<GISFac*>(facility_a_->Clone());\n}\n\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nTEST_F(GISFacTest, InitialState) {\n  \/\/ Test things about the initial state of the facility here\n  EXPECT_EQ(facility_a_->gis->get_longitude(), 0);\n  EXPECT_EQ(facility_a_->gis->get_latitude(), 0);\n}\n\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nTEST_F(GISFacTest, Print) {\n  EXPECT_NO_THROW(std::string s = facility_a_->str());\n  \/\/ Test GISFac specific aspects of the print method here\n}\n\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\ncyclus::Agent* GISFacConstructor(cyclus::Context* ctx) {\n  return new GISFac(ctx);\n}\n\n\/\/ Required to get functionality in cyclus agent unit tests library\n#ifndef CYCLUS_AGENT_TESTS_CONNECTED\nint ConnectAgentTests();\nstatic int cyclus_agent_tests_connected = ConnectAgentTests();\n#define CYCLUS_AGENT_TESTS_CONNECTED cyclus_agent_tests_connected\n#endif  \/\/ CYCLUS_AGENT_TESTS_CONNECTED\n\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nINSTANTIATE_TEST_CASE_P(GISFacFac, FacilityTests,\n                        ::testing::Values(&GISFacConstructor));\n\nINSTANTIATE_TEST_CASE_P(GISFacFac, AgentTests,\n                        ::testing::Values(&GISFacConstructor));\n<commit_msg>setter functions tested<commit_after>#include <gtest\/gtest.h>\n\n#include \"gisfac.h\"\n\n#include <iostream>\n#include \"agent_tests.h\"\n#include \"context.h\"\n#include \"facility_tests.h\"\n\nusing cyclus::GISFac;\n\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nclass GISFacTest : public ::testing::Test {\n protected:\n  cyclus::TestContext tc_;\n  GISFac* facility_a_;\n  GISFac* facility_b_;\n\n  virtual void SetUp() {}\n\n  virtual void TearDown() {}\n};\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nTEST_F(GISFacTest, set_longitude) {\n  facility_a_->gis->set_longitude(32.5);\n  EXPECT_NEAR(facility_a_->gis->get_longitude(), 32.5, 32.5 * 0.01);\n  facility_a_->gis->set_longitude(-2.5546);\n  EXPECT_NEAR(facility_a_->gis->get_longitude(), -2.5546, 2.5546 * 0.01);\n}\n\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nTEST_F(GISFacTest, set_latitude) {\n  facility_a_->gis->set_latitude(32.5);\n  std::cout << facility_a_->gis->get_latitude() << std::endl;\n  EXPECT_NEAR(facility_a_->gis->get_latitude(), 32.5, 32.5 * 0.01);\n  facility_a_->gis->set_latitude(-2.5546);\n  std::cout << facility_a_->gis->get_latitude() << std::endl;\n  EXPECT_NEAR(facility_a_->gis->get_latitude(), -2.5546, 2.5546 * 0.01);\n}\n\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nTEST_F(GISFacTest, InitialState) {\n  \/\/ Test things about the initial state of the facility here\n  EXPECT_EQ(facility_a_->gis->get_longitude(), 0);\n  EXPECT_EQ(facility_a_->gis->get_latitude(), 0);\n}\n\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\ncyclus::Agent* GISFacConstructor(cyclus::Context* ctx) {\n  return new GISFac(ctx);\n}\n\n\/\/ Required to get functionality in cyclus agent unit tests library\n#ifndef CYCLUS_AGENT_TESTS_CONNECTED\nint ConnectAgentTests();\nstatic int cyclus_agent_tests_connected = ConnectAgentTests();\n#define CYCLUS_AGENT_TESTS_CONNECTED cyclus_agent_tests_connected\n#endif  \/\/ CYCLUS_AGENT_TESTS_CONNECTED\n\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nINSTANTIATE_TEST_CASE_P(GISFacFac, FacilityTests,\n                        ::testing::Values(&GISFacConstructor));\n\nINSTANTIATE_TEST_CASE_P(GISFacFac, AgentTests,\n                        ::testing::Values(&GISFacConstructor));\n<|endoftext|>"}
{"text":"<commit_before>#include \"buffer_utils.hh\"\n\n#include \"buffer_manager.hh\"\n#include \"event_manager.hh\"\n#include \"file.hh\"\n\n#include <unistd.h>\n\n#if defined(__APPLE__)\n#define st_mtim st_mtimespec\n#endif\n\n\nnamespace Kakoune\n{\n\nColumnCount get_column(const Buffer& buffer,\n                       ColumnCount tabstop, BufferCoord coord)\n{\n    auto line = buffer[coord.line];\n    auto col = 0_col;\n    for (auto it = line.begin();\n         it != line.end() and coord.column > (int)(it - line.begin()); )\n    {\n        if (*it == '\\t')\n        {\n            col = (col \/ tabstop + 1) * tabstop;\n            ++it;\n        }\n        else\n            col += codepoint_width(utf8::read_codepoint(it, line.end()));\n    }\n    return col;\n}\n\nByteCount get_byte_to_column(const Buffer& buffer, ColumnCount tabstop, DisplayCoord coord)\n{\n    auto line = buffer[coord.line];\n    auto col = 0_col;\n    auto it = line.begin();\n    while (it != line.end() and coord.column > col)\n    {\n        if (*it == '\\t')\n        {\n            col = (col \/ tabstop + 1) * tabstop;\n            if (col > coord.column) \/\/ the target column was in the tab\n                break;\n            ++it;\n        }\n        else\n        {\n            auto next = it;\n            col += codepoint_width(utf8::read_codepoint(next, line.end()));\n            if (col > coord.column) \/\/ the target column was in the char\n                break;\n            it = next;\n        }\n    }\n    return (int)(it - line.begin());\n}\n\nBuffer* open_file_buffer(StringView filename, Buffer::Flags flags)\n{\n    MappedFile file_data{filename};\n    return BufferManager::instance().create_buffer(\n        filename.str(), Buffer::Flags::File | flags, file_data, file_data.st.st_mtim);\n}\n\nBuffer* open_or_create_file_buffer(StringView filename, Buffer::Flags flags)\n{\n    auto& buffer_manager = BufferManager::instance();\n    if (file_exists(filename))\n    {\n        MappedFile file_data{filename};\n        return buffer_manager.create_buffer(filename.str(), Buffer::Flags::File | flags,\n                                            file_data, file_data.st.st_mtim);\n    }\n    return buffer_manager.create_buffer(\n        filename.str(), Buffer::Flags::File | Buffer::Flags::New,\n        {}, InvalidTime);\n}\n\nvoid reload_file_buffer(Buffer& buffer)\n{\n    kak_assert(buffer.flags() & Buffer::Flags::File);\n    MappedFile file_data{buffer.name()};\n    buffer.reload(file_data, file_data.st.st_mtim);\n}\n\nBuffer* create_fifo_buffer(String name, int fd, bool scroll)\n{\n    static ValueId s_fifo_watcher_id = get_free_value_id();\n\n    auto& buffer_manager = BufferManager::instance();\n    Buffer* buffer = buffer_manager.get_buffer_ifp(name);\n    if (buffer)\n    {\n        buffer->flags() |= Buffer::Flags::NoUndo;\n        buffer->reload({}, InvalidTime);\n    }\n    else\n        buffer = buffer_manager.create_buffer(\n            std::move(name), Buffer::Flags::Fifo | Buffer::Flags::NoUndo);\n\n    auto watcher_deleter = [buffer](FDWatcher* watcher) {\n        kak_assert(buffer->flags() & Buffer::Flags::Fifo);\n        watcher->close_fd();\n        buffer->run_hook_in_own_context(\"BufCloseFifo\", \"\");\n        buffer->flags() &= ~(Buffer::Flags::Fifo | Buffer::Flags::NoUndo);\n        delete watcher;\n    };\n\n    \/\/ capture a non static one to silence a warning.\n    ValueId fifo_watcher_id = s_fifo_watcher_id;\n\n    std::unique_ptr<FDWatcher, decltype(watcher_deleter)> watcher(\n        new FDWatcher(fd, FdEvents::Read,\n                      [buffer, scroll, fifo_watcher_id](FDWatcher& watcher, FdEvents, EventMode mode) {\n        if (mode != EventMode::Normal)\n            return;\n\n        kak_assert(buffer->flags() & Buffer::Flags::Fifo);\n\n        constexpr size_t buffer_size = 2048;\n        \/\/ if we read data slower than it arrives in the fifo, limiting the\n        \/\/ iteration number allows us to go back go back to the event loop and\n        \/\/ handle other events sources (such as input)\n        size_t loops = 16;\n        char data[buffer_size];\n        const int fifo = watcher.fd();\n        ssize_t count = 0;\n        do\n        {\n            count = ::read(fifo, data, buffer_size);\n            auto pos = buffer->back_coord();\n\n            const bool prevent_scrolling = pos == BufferCoord{0,0} and not scroll;\n            if (prevent_scrolling)\n                pos = buffer->next(pos);\n\n            buffer->insert(pos, StringView(data, data+count));\n\n            if (count > 0 and prevent_scrolling)\n            {\n                buffer->erase({0,0}, buffer->next({0,0}));\n                \/\/ in the other case, the buffer will have automatically\n                \/\/ inserted a \\n to guarantee its invariant.\n                if (data[count-1] == '\\n')\n                    buffer->insert(buffer->end_coord(), \"\\n\");\n            }\n        }\n        while (--loops and count > 0 and fd_readable(fifo));\n\n        buffer->run_hook_in_own_context(\"BufReadFifo\", buffer->name());\n\n        if (count <= 0)\n            buffer->values().erase(fifo_watcher_id); \/\/ will delete this\n    }), std::move(watcher_deleter));\n\n    buffer->values()[fifo_watcher_id] = Value(std::move(watcher));\n    buffer->flags() = Buffer::Flags::Fifo | Buffer::Flags::NoUndo;\n    buffer->run_hook_in_own_context(\"BufOpenFifo\", buffer->name());\n\n    return buffer;\n}\n\nvoid write_to_debug_buffer(StringView str)\n{\n    if (not BufferManager::has_instance())\n    {\n        write(2, str);\n        write(2, \"\\n\");\n        return;\n    }\n\n    constexpr StringView debug_buffer_name = \"*debug*\";\n    \/\/ Try to ensure we keep an empty line at the end of the debug buffer\n    \/\/ where the user can put its cursor to scroll with new messages\n    const bool eol_back = not str.empty() and str.back() == '\\n';\n    if (Buffer* buffer = BufferManager::instance().get_buffer_ifp(debug_buffer_name))\n        buffer->insert(buffer->back_coord(), eol_back ? str : str + \"\\n\");\n    else\n    {\n        String line = str + (eol_back ? \"\\n\" : \"\\n\\n\");\n        BufferManager::instance().create_buffer(\n            debug_buffer_name.str(), Buffer::Flags::NoUndo | Buffer::Flags::Debug,\n            line, InvalidTime);\n    }\n}\n\n}\n<commit_msg>Fix fifo reading not handling potential errors from the read call<commit_after>#include \"buffer_utils.hh\"\n\n#include \"buffer_manager.hh\"\n#include \"event_manager.hh\"\n#include \"file.hh\"\n\n#include <unistd.h>\n\n#if defined(__APPLE__)\n#define st_mtim st_mtimespec\n#endif\n\n\nnamespace Kakoune\n{\n\nColumnCount get_column(const Buffer& buffer,\n                       ColumnCount tabstop, BufferCoord coord)\n{\n    auto line = buffer[coord.line];\n    auto col = 0_col;\n    for (auto it = line.begin();\n         it != line.end() and coord.column > (int)(it - line.begin()); )\n    {\n        if (*it == '\\t')\n        {\n            col = (col \/ tabstop + 1) * tabstop;\n            ++it;\n        }\n        else\n            col += codepoint_width(utf8::read_codepoint(it, line.end()));\n    }\n    return col;\n}\n\nByteCount get_byte_to_column(const Buffer& buffer, ColumnCount tabstop, DisplayCoord coord)\n{\n    auto line = buffer[coord.line];\n    auto col = 0_col;\n    auto it = line.begin();\n    while (it != line.end() and coord.column > col)\n    {\n        if (*it == '\\t')\n        {\n            col = (col \/ tabstop + 1) * tabstop;\n            if (col > coord.column) \/\/ the target column was in the tab\n                break;\n            ++it;\n        }\n        else\n        {\n            auto next = it;\n            col += codepoint_width(utf8::read_codepoint(next, line.end()));\n            if (col > coord.column) \/\/ the target column was in the char\n                break;\n            it = next;\n        }\n    }\n    return (int)(it - line.begin());\n}\n\nBuffer* open_file_buffer(StringView filename, Buffer::Flags flags)\n{\n    MappedFile file_data{filename};\n    return BufferManager::instance().create_buffer(\n        filename.str(), Buffer::Flags::File | flags, file_data, file_data.st.st_mtim);\n}\n\nBuffer* open_or_create_file_buffer(StringView filename, Buffer::Flags flags)\n{\n    auto& buffer_manager = BufferManager::instance();\n    if (file_exists(filename))\n    {\n        MappedFile file_data{filename};\n        return buffer_manager.create_buffer(filename.str(), Buffer::Flags::File | flags,\n                                            file_data, file_data.st.st_mtim);\n    }\n    return buffer_manager.create_buffer(\n        filename.str(), Buffer::Flags::File | Buffer::Flags::New,\n        {}, InvalidTime);\n}\n\nvoid reload_file_buffer(Buffer& buffer)\n{\n    kak_assert(buffer.flags() & Buffer::Flags::File);\n    MappedFile file_data{buffer.name()};\n    buffer.reload(file_data, file_data.st.st_mtim);\n}\n\nBuffer* create_fifo_buffer(String name, int fd, bool scroll)\n{\n    static ValueId s_fifo_watcher_id = get_free_value_id();\n\n    auto& buffer_manager = BufferManager::instance();\n    Buffer* buffer = buffer_manager.get_buffer_ifp(name);\n    if (buffer)\n    {\n        buffer->flags() |= Buffer::Flags::NoUndo;\n        buffer->reload({}, InvalidTime);\n    }\n    else\n        buffer = buffer_manager.create_buffer(\n            std::move(name), Buffer::Flags::Fifo | Buffer::Flags::NoUndo);\n\n    auto watcher_deleter = [buffer](FDWatcher* watcher) {\n        kak_assert(buffer->flags() & Buffer::Flags::Fifo);\n        watcher->close_fd();\n        buffer->run_hook_in_own_context(\"BufCloseFifo\", \"\");\n        buffer->flags() &= ~(Buffer::Flags::Fifo | Buffer::Flags::NoUndo);\n        delete watcher;\n    };\n\n    \/\/ capture a non static one to silence a warning.\n    ValueId fifo_watcher_id = s_fifo_watcher_id;\n\n    std::unique_ptr<FDWatcher, decltype(watcher_deleter)> watcher(\n        new FDWatcher(fd, FdEvents::Read,\n                      [buffer, scroll, fifo_watcher_id](FDWatcher& watcher, FdEvents, EventMode mode) {\n        if (mode != EventMode::Normal)\n            return;\n\n        kak_assert(buffer->flags() & Buffer::Flags::Fifo);\n\n        constexpr size_t buffer_size = 2048;\n        \/\/ if we read data slower than it arrives in the fifo, limiting the\n        \/\/ iteration number allows us to go back go back to the event loop and\n        \/\/ handle other events sources (such as input)\n        size_t loops = 16;\n        char data[buffer_size];\n        const int fifo = watcher.fd();\n        do\n        {\n            const ssize_t count = ::read(fifo, data, buffer_size);\n            if (count <= 0)\n            {\n                buffer->values().erase(fifo_watcher_id); \/\/ will delete this\n                return;\n            }\n\n            auto pos = buffer->back_coord();\n            const bool prevent_scrolling = pos == BufferCoord{0,0} and not scroll;\n            if (prevent_scrolling)\n                pos = buffer->next(pos);\n\n            buffer->insert(pos, StringView(data, data+count));\n\n            if (prevent_scrolling)\n            {\n                buffer->erase({0,0}, buffer->next({0,0}));\n                \/\/ in the other case, the buffer will have automatically\n                \/\/ inserted a \\n to guarantee its invariant.\n                if (data[count-1] == '\\n')\n                    buffer->insert(buffer->end_coord(), \"\\n\");\n            }\n        }\n        while (--loops and fd_readable(fifo));\n\n        buffer->run_hook_in_own_context(\"BufReadFifo\", buffer->name());\n    }), std::move(watcher_deleter));\n\n    buffer->values()[fifo_watcher_id] = Value(std::move(watcher));\n    buffer->flags() = Buffer::Flags::Fifo | Buffer::Flags::NoUndo;\n    buffer->run_hook_in_own_context(\"BufOpenFifo\", buffer->name());\n\n    return buffer;\n}\n\nvoid write_to_debug_buffer(StringView str)\n{\n    if (not BufferManager::has_instance())\n    {\n        write(2, str);\n        write(2, \"\\n\");\n        return;\n    }\n\n    constexpr StringView debug_buffer_name = \"*debug*\";\n    \/\/ Try to ensure we keep an empty line at the end of the debug buffer\n    \/\/ where the user can put its cursor to scroll with new messages\n    const bool eol_back = not str.empty() and str.back() == '\\n';\n    if (Buffer* buffer = BufferManager::instance().get_buffer_ifp(debug_buffer_name))\n        buffer->insert(buffer->back_coord(), eol_back ? str : str + \"\\n\");\n    else\n    {\n        String line = str + (eol_back ? \"\\n\" : \"\\n\\n\");\n        BufferManager::instance().create_buffer(\n            debug_buffer_name.str(), Buffer::Flags::NoUndo | Buffer::Flags::Debug,\n            line, InvalidTime);\n    }\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>INTEGRATION: CWS xmlfilter03_DEV300 (1.6.2); FILE MERGED 2008\/02\/06 14:05:10 os 1.6.2.2: creating CharStyles for numbering\/list symbols 2008\/01\/23 14:40:55 os 1.6.2.1: forward fixed<commit_after><|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 \"HybridAutomatonManager.h\"\r\n#include \"HybridAutomatonManagerCmd.h\"\r\n\r\n#include \"msgs\\String.h\"\r\n\r\nstd::vector<double> convert(const dVector& in)\r\n{\r\n\tstd::vector<double> out(in.size());\r\n\tfor(int i = 0; i < in.size(); ++i)\r\n\t\tout[i] = in[i];\r\n\treturn out;\r\n}\r\n\r\nHybridAutomatonManager::HybridAutomatonManager(rDC rdc) \r\n:rControlAlgorithm(rdc)\r\n, _robot(NULL)\r\n, _blackboard(NULL)\r\n, _activeMotionBehavior(NULL)\r\n, _dof()\r\n, _HS()\r\n, _newHAArrived(false)\r\n{\r\n}\r\n\r\nHybridAutomatonManager::~HybridAutomatonManager()\r\n{\r\n\tdelete _activeMotionBehavior;\r\n\r\n\tfor( ::std::vector< MotionBehaviour* >::const_iterator it = _navigationFunction.begin(); it != _navigationFunction.end(); ++it)\r\n\t\tdelete *it;\r\n\t_navigationFunction.clear();\r\n\r\n\tFREE_SYSTEMS();\r\n}\r\n\r\n\r\n\r\nvoid HybridAutomatonManager::init(int mode)\r\n{\r\n\r\n\t\/\/load the parameters of the filter - this can be eliminated once the robot API is there\r\n\t_robot =  LOAD_SYSTEM(_path, _aml, _T0, _q0);\r\n\tassert(_robot);\r\n\r\n\t_dof = _robot->jdof();\r\n\r\n\t\/\/Initialize variables\r\n\t_q.resize(_robot->jointDOF() + _robot->earthDOF() + _robot->constraintDOF());\r\n\t_qdot.resize(_robot->jointDOF() + _robot->earthDOF() + _robot->constraintDOF());\r\n\t_torque.resize(_robot->jointDOF() + _robot->earthDOF() + _robot->constraintDOF());\r\n\r\n\t_q_BB.resize(_dof);\t\t\r\n\t_qdot_BB.resize(_dof);\r\n\t_torque_BB.resize(_dof);\r\n\r\n\t_q.zero();\r\n\t_torque.zero();\r\n\t_qdot.zero();\r\n\t\r\n\t\/\/Find the robot device. This devicce is used to read position and write torques\r\n\t\/\/to the robot\r\n\t_robotDevice = findDevice(_T(\"ROBOT\"));\r\n\tRASSERT(_robotDevice != INVALID_RHANDLE);\r\n\r\n\t_blackboard = RTBlackBoard::getInstance();\r\n}\r\n\r\nvoid HybridAutomatonManager::update(const rTime& t)\r\n{\r\n\tthis->updateHybridAutomaton();\r\n\r\n\trControlAlgorithm::update(t);\r\n\r\n\t_blackboard->setFloat64MultiArray(\"angle\", _q_BB);\r\n\r\n\t_blackboard->setFloat64MultiArray(\"velocity\", _qdot_BB);\r\n\r\n\t_blackboard->setFloat64MultiArray(\"torque\" , _torque_BB);\r\n\r\n\t_blackboard->step();\r\n\r\n}\r\n\r\nvoid HybridAutomatonManager::updateHybridAutomaton()\r\n{\r\n\tif (_blackboard->isUpdated(\"update_hybrid_automaton\"))\r\n\t{\r\n\t\trlab::String* s = dynamic_cast<rlab::String*>(_blackboard->getData(\"update_hybrid_automaton\"));\r\n\t\t_HS = s->get();\r\n\r\n\t\ttry\r\n\t\t{\r\n\t\t\t_plan.fromStringXML(_HS,_robot);\r\n\t\t}\r\n\t\tcatch(::std::string e)\r\n\t\t{\r\n\t\t\t::std::cout << e << ::std::endl;\r\n\t\t}\r\n\r\n\t\t_navigationFunction.clear();\r\n\t\t_activeMotionBehavior = NULL;\r\n\r\n\t\tMilestone* tmpMilestone = _plan.getStartNode();\r\n\t\r\n\t\tfor( int i = 1; i < _plan.getNodeNumber(); ++i)\r\n\t\t{\r\n\t\t\t_navigationFunction.push_back(_plan.outgoingEdges(*tmpMilestone)[0]);\r\n\t\t\ttmpMilestone = _navigationFunction.back()->getChild();\r\n\t\t}\r\n\r\n\t\tdelete tmpMilestone;\r\n\r\n\t\t_newHAArrived = true;\r\n\t}\r\n}\r\n\r\nvoid HybridAutomatonManager::setNominalSystem(const TCHAR* path, const TCHAR* aml, const HTransform& T0, const dVector& q0)\r\n{\r\n\tthis->_path = path;\r\n\r\n\tthis->_aml = aml;\r\n\r\n\tthis->_T0 = T0;\r\n\t\r\n\tthis->_q0 = q0;\r\n}\r\n\r\nvoid HybridAutomatonManager::setPeriod(const rTime& dT)\r\n{\r\n\tthis->_dT = dT;\r\n}\r\n\r\n\r\nvoid HybridAutomatonManager::_readDevices()\r\n{\r\n\t\/\/float* q = new float[_dof] ;\r\n\t\/\/float* qdot = new float[_dof] ;\r\n\r\n\t\/\/int read = readDeviceValue(_robotDevice, q, _dof * sizeof(double), 0);\r\n\t\/\/RASSERT(read > 0);\r\n\r\n\t\/\/read = readDeviceValue(_robotDevice, qdot, _dof * sizeof(double), 1);\r\n\t\/\/RASSERT(read > 0);\r\n\tint read;\r\n\tdouble data[2*7];\r\n\tread = readDeviceValue(_robotDevice, data, 2*sizeof(double)*7);\r\n\r\n\tif (read > 0)\r\n\t{\r\n\t\tdouble rad[7];\r\n\t\tdouble vrad[7];\r\n\r\n\t\tmemcpy(rad, data, sizeof(double)*7);\r\n\t\tdouble* velOffset = data+7;\r\n\t\tmemcpy(vrad, velOffset, sizeof(double)*7);\r\n\t\t_q = dVector(7, rad);\r\n\t\t_qdot = dVector(7, vrad);\r\n\t}\r\n\t_q[6] = 0.0;\r\n\t_qdot[6] = 0.0;\r\n\t_qdot.zero();\r\n\t\/\/for(int i = 0 ; i < _dof; ++i)\r\n\t\/\/{\r\n\t\/\/\t_q[i] = q[i];\r\n\t\/\/\t_qdot[i] = qdot[i];\r\n\t\/\/}\r\n\r\n\t\/\/delete q;\r\n\t\/\/delete qdot;\r\n\r\n\t_q_BB = convert(_q);\r\n\t_qdot_BB = convert(_qdot);\r\n}\r\n\r\n\r\nvoid HybridAutomatonManager::_writeDevices()\r\n{\r\n\tfloat* torque = new float[_dof];\r\n\r\n\tfor(int i = 0 ; i < _dof; ++i)\r\n\t\ttorque[i] = _torque[i];\r\n\r\n\t\/\/int written = writeDeviceValue(_robotDevice, torque, _dof * sizeof(float));\r\n\t\/\/RASSERT(written > 0);\r\n\r\n\tdouble jointTq[7];\t\r\n\t\r\n\tfor (int i=0; i<7; i++)\r\n\t\tjointTq[i] = _torque[i];\r\n\r\n\t_torque[6] = 0.0;\r\n\twriteDeviceValue(_robotDevice, jointTq, sizeof(double)*7);\r\n\r\n\t_torque_BB = convert(_torque);\r\n\r\n\tdelete torque;\r\n}\r\n\r\n\r\nvoid HybridAutomatonManager::_reflect()\r\n{\r\n\t_robot->q(_q);\r\n\r\n\t_robot->qdot(_qdot);\r\n}\r\n\r\n\r\nvoid HybridAutomatonManager::_compute(const double& t)\r\n{\r\n\r\n\r\n\t\/\/TODO change this if statement!!! \r\n\tif((!_activeMotionBehavior || _activeMotionBehavior->hasConverged()) && _navigationFunction.size() > 0)\r\n\t{\r\n\t\t_activeMotionBehavior = _navigationFunction.front();\r\n\t\t_navigationFunction.erase(_navigationFunction.begin());\r\n\t\t_activeMotionBehavior->activate();\r\n\t}\r\n\tif(_activeMotionBehavior)\r\n\t\t_torque = _activeMotionBehavior->update(t);\r\n\t\r\n}\r\n\r\n\r\n\r\nvoid HybridAutomatonManager::_estimate()\r\n{\r\n\r\n}\r\n\r\nint HybridAutomatonManager::command(const short& cmd, const int& arg)\r\n{\r\n\tswitch (cmd)\r\n\t{\r\n\tcase EXECUTE_PLAN:\r\n\t\t{\r\n\t\t}\r\n\t\tbreak;\r\n\tcase PAUSE:\r\n\t\t{\r\n\r\n\t\t}\r\n\t\tbreak;\r\n\tcase RESUME:\r\n\t\t{\r\n\r\n\t\t}\r\n\t\tbreak;\r\n\tdefault:\r\n\t\tbreak;\r\n\t}\r\n\r\n\treturn 0;\r\n}\r\n\r\n\r\nvoid HybridAutomatonManager::datanames (vector<string_type>& names, int channel)\r\n{\r\n}\r\n\r\nvoid HybridAutomatonManager::collect(vector<double>& data, int channel)\r\n{\r\n\tif (channel == 1)\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 == 2)\r\n\t{\r\n\t\tfor(int i = 0; i < _dof; ++i)\r\n\t\t\tdata.push_back(_q[i]);\r\n\t}\r\n\telse if (channel == 3)\r\n\t{\r\n\t\tfor(int i = 0; i < _dof; ++i)\r\n\t\t\tdata.push_back(_qdot[i]);\r\n\t}\r\n}\r\n\r\nvoid HybridAutomatonManager::onSetInterestFrame(const TCHAR* name, const HTransform& T)\r\n{\r\n}\r\n\r\nrControlAlgorithm* CreateControlAlgorithm(rDC& rdc)\r\n{\r\n\treturn new HybridAutomatonManager(rdc);\r\n}\r\n<commit_msg>change the HybridAutomatonManager that it can use the XR4000 separately <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 \"HybridAutomatonManager.h\"\r\n#include \"HybridAutomatonManagerCmd.h\"\r\n\r\n#include \"msgs\\String.h\"\r\n\r\nstd::vector<double> convert(const dVector& in)\r\n{\r\n\tstd::vector<double> out(in.size());\r\n\tfor(int i = 0; i < in.size(); ++i)\r\n\t\tout[i] = in[i];\r\n\treturn out;\r\n}\r\n\r\nHybridAutomatonManager::HybridAutomatonManager(rDC rdc) \r\n:rControlAlgorithm(rdc)\r\n, _robot(NULL)\r\n, _blackboard(NULL)\r\n, _activeMotionBehavior(NULL)\r\n, _dof()\r\n, _HS()\r\n, _newHAArrived(false)\r\n{\r\n}\r\n\r\nHybridAutomatonManager::~HybridAutomatonManager()\r\n{\r\n\tdelete _activeMotionBehavior;\r\n\r\n\tfor( ::std::vector< MotionBehaviour* >::const_iterator it = _navigationFunction.begin(); it != _navigationFunction.end(); ++it)\r\n\t\tdelete *it;\r\n\t_navigationFunction.clear();\r\n\r\n\tFREE_SYSTEMS();\r\n}\r\n\r\n\r\n\r\nvoid HybridAutomatonManager::init(int mode)\r\n{\r\n\r\n\t\/\/load the parameters of the filter - this can be eliminated once the robot API is there\r\n\t_robot =  LOAD_SYSTEM(_path, _aml, _T0, _q0);\r\n\tassert(_robot);\r\n\r\n\t_dof = _robot->jdof();\r\n\r\n\t\/\/Initialize variables\r\n\t_q.resize(_robot->jointDOF() + _robot->earthDOF() + _robot->constraintDOF());\r\n\t_qdot.resize(_robot->jointDOF() + _robot->earthDOF() + _robot->constraintDOF());\r\n\t_torque.resize(_robot->jointDOF() + _robot->earthDOF() + _robot->constraintDOF());\r\n\r\n\t_q_BB.resize(_dof);\t\t\r\n\t_qdot_BB.resize(_dof);\r\n\t_torque_BB.resize(_dof);\r\n\r\n\t_q.zero();\r\n\t_torque.zero();\r\n\t_qdot.zero();\r\n\t\r\n\t\/\/Find the robot device. This devicce is used to read position and write torques\r\n\t\/\/to the robot\r\n\t_robotDevice = findDevice(_T(\"ROBOT\"));\r\n\tRASSERT(_robotDevice != INVALID_RHANDLE);\r\n\r\n\t_blackboard = RTBlackBoard::getInstance();\r\n}\r\n\r\nvoid HybridAutomatonManager::update(const rTime& t)\r\n{\r\n\tthis->updateHybridAutomaton();\r\n\r\n\trControlAlgorithm::update(t);\r\n\r\n\t\/*if(_robot->jdof == 3)\r\n\t{\r\n\t\t_blackboard->setFloat64MultiArray(\"angle\", _q_BB);\r\n\t}\r\n\telse\r\n\t{*\/\r\n\t\t_blackboard->setFloat64MultiArray(\"angle\", _q_BB);\r\n\r\n\t\t_blackboard->setFloat64MultiArray(\"velocity\", _qdot_BB);\r\n\r\n\t\t_blackboard->setFloat64MultiArray(\"torque\" , _torque_BB);\r\n\t\/\/}\r\n\t_blackboard->step();\r\n\r\n}\r\n\r\nvoid HybridAutomatonManager::updateHybridAutomaton()\r\n{\r\n\tif (_blackboard->isUpdated(\"update_hybrid_automaton\"))\r\n\t{\r\n\t\trlab::String* s = dynamic_cast<rlab::String*>(_blackboard->getData(\"update_hybrid_automaton\"));\r\n\t\t_HS = s->get();\r\n\r\n\t\ttry\r\n\t\t{\r\n\t\t\t_plan.fromStringXML(_HS,_robot);\r\n\t\t}\r\n\t\tcatch(::std::string e)\r\n\t\t{\r\n\t\t\t::std::cout << e << ::std::endl;\r\n\t\t}\r\n\r\n\t\t_navigationFunction.clear();\r\n\t\t_activeMotionBehavior = NULL;\r\n\r\n\t\tMilestone* tmpMilestone = _plan.getStartNode();\r\n\t\r\n\t\tfor( int i = 1; i < _plan.getNodeNumber(); ++i)\r\n\t\t{\r\n\t\t\t_navigationFunction.push_back(_plan.outgoingEdges(*tmpMilestone)[0]);\r\n\t\t\ttmpMilestone = _navigationFunction.back()->getChild();\r\n\t\t}\r\n\r\n\t\tdelete tmpMilestone;\r\n\r\n\t\t_newHAArrived = true;\r\n\t}\r\n}\r\n\r\nvoid HybridAutomatonManager::setNominalSystem(const TCHAR* path, const TCHAR* aml, const HTransform& T0, const dVector& q0)\r\n{\r\n\tthis->_path = path;\r\n\r\n\tthis->_aml = aml;\r\n\r\n\tthis->_T0 = T0;\r\n\t\r\n\tthis->_q0 = q0;\r\n}\r\n\r\nvoid HybridAutomatonManager::setPeriod(const rTime& dT)\r\n{\r\n\tthis->_dT = dT;\r\n}\r\n\r\n\r\nvoid HybridAutomatonManager::_readDevices()\r\n{\r\n\t\/\/float* q = new float[_dof] ;\r\n\t\/\/float* qdot = new float[_dof] ;\r\n\r\n\t\/\/int read = readDeviceValue(_robotDevice, q, _dof * sizeof(double), 0);\r\n\t\/\/RASSERT(read > 0);\r\n\r\n\t\/\/read = readDeviceValue(_robotDevice, qdot, _dof * sizeof(double), 1);\r\n\t\/\/RASSERT(read > 0);\r\n\tint read;\r\n\tif(_dof == 3)\r\n\t{\r\n\t\tfloat data[3];\r\n\t\tread = readDeviceValue(_robotDevice, data, sizeof(float)*3, 0);\r\n\t\tRASSERT(read > 0);\r\n\t\tfor( int i = 0;i < 3; i++)\r\n\t\t{\r\n\t\t\t_q[i] = data[i];\r\n\t\t}\r\n\t}\r\n\telse\r\n\t{\r\n\t\tdouble data[2*7];\r\n\t\tread = readDeviceValue(_robotDevice, data, 2*sizeof(double)*7);\r\n\r\n\t\tif (read > 0)\r\n\t\t{\r\n\t\t\tdouble rad[7];\r\n\t\t\tdouble vrad[7];\r\n\r\n\t\t\tmemcpy(rad, data, sizeof(double)*7);\r\n\t\t\tdouble* velOffset = data+7;\r\n\t\t\tmemcpy(vrad, velOffset, sizeof(double)*7);\r\n\t\t\t_q = dVector(7, rad);\r\n\t\t\t_qdot = dVector(7, vrad);\r\n\t\t}\r\n\t\t_q[6] = 0.0;\r\n\t\t_qdot[6] = 0.0;\r\n\t\t_qdot.zero();\r\n\t\t\/\/for(int i = 0 ; i < _dof; ++i)\r\n\t\t\/\/{\r\n\t\t\/\/\t_q[i] = q[i];\r\n\t\t\/\/\t_qdot[i] = qdot[i];\r\n\t\t\/\/}\r\n\r\n\t\t\/\/delete q;\r\n\t\t\/\/delete qdot;\r\n\r\n\t\r\n\t\t_qdot_BB = convert(_qdot);\r\n\t}\r\n\t_q_BB = convert(_q);\r\n}\r\n\r\n\r\nvoid HybridAutomatonManager::_writeDevices()\r\n{\r\n\tfloat* torque = new float[_dof];\r\n\r\n\tfor(int i = 0 ; i < _dof; ++i)\r\n\t\ttorque[i] = _torque[i];\r\n\r\n\t\/\/int written = writeDeviceValue(_robotDevice, torque, _dof * sizeof(float));\r\n\t\/\/RASSERT(written > 0);\r\n\r\n\tdouble jointTq[7];\t\r\n\t\r\n\tfor (int i=0; i<7; i++)\r\n\t\tjointTq[i] = _torque[i];\r\n\r\n\t_torque[6] = 0.0;\r\n\twriteDeviceValue(_robotDevice, jointTq, sizeof(double)*7);\r\n\r\n\t_torque_BB = convert(_torque);\r\n\r\n\tdelete torque;\r\n}\r\n\r\n\r\nvoid HybridAutomatonManager::_reflect()\r\n{\r\n\t_robot->q(_q);\r\n\r\n\t_robot->qdot(_qdot);\r\n}\r\n\r\n\r\nvoid HybridAutomatonManager::_compute(const double& t)\r\n{\r\n\r\n\r\n\t\/\/TODO change this if statement!!! \r\n\tif((!_activeMotionBehavior || _activeMotionBehavior->hasConverged()) && _navigationFunction.size() > 0)\r\n\t{\r\n\t\t_activeMotionBehavior = _navigationFunction.front();\r\n\t\t_navigationFunction.erase(_navigationFunction.begin());\r\n\t\t_activeMotionBehavior->activate();\r\n\t}\r\n\tif(_activeMotionBehavior)\r\n\t\t_torque = _activeMotionBehavior->update(t);\r\n\t\r\n}\r\n\r\n\r\n\r\nvoid HybridAutomatonManager::_estimate()\r\n{\r\n\r\n}\r\n\r\nint HybridAutomatonManager::command(const short& cmd, const int& arg)\r\n{\r\n\tswitch (cmd)\r\n\t{\r\n\tcase EXECUTE_PLAN:\r\n\t\t{\r\n\t\t}\r\n\t\tbreak;\r\n\tcase PAUSE:\r\n\t\t{\r\n\r\n\t\t}\r\n\t\tbreak;\r\n\tcase RESUME:\r\n\t\t{\r\n\r\n\t\t}\r\n\t\tbreak;\r\n\tdefault:\r\n\t\tbreak;\r\n\t}\r\n\r\n\treturn 0;\r\n}\r\n\r\n\r\nvoid HybridAutomatonManager::datanames (vector<string_type>& names, int channel)\r\n{\r\n}\r\n\r\nvoid HybridAutomatonManager::collect(vector<double>& data, int channel)\r\n{\r\n\tif (channel == 1)\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 == 2)\r\n\t{\r\n\t\tfor(int i = 0; i < _dof; ++i)\r\n\t\t\tdata.push_back(_q[i]);\r\n\t}\r\n\telse if (channel == 3)\r\n\t{\r\n\t\tfor(int i = 0; i < _dof; ++i)\r\n\t\t\tdata.push_back(_qdot[i]);\r\n\t}\r\n}\r\n\r\nvoid HybridAutomatonManager::onSetInterestFrame(const TCHAR* name, const HTransform& T)\r\n{\r\n}\r\n\r\nrControlAlgorithm* CreateControlAlgorithm(rDC& rdc)\r\n{\r\n\treturn new HybridAutomatonManager(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\/nest\/p9_putmemproc.C $     *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2017,2019                        *\/\n\/* [+] International Business Machines Corp.                              *\/\n\/*                                                                        *\/\n\/*                                                                        *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\");        *\/\n\/* you may not use this file except in compliance with the License.       *\/\n\/* You may obtain a copy of the License at                                *\/\n\/*                                                                        *\/\n\/*     http:\/\/www.apache.org\/licenses\/LICENSE-2.0                         *\/\n\/*                                                                        *\/\n\/* Unless required by applicable law or agreed to in writing, software    *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS,      *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or        *\/\n\/* implied. See the License for the specific language governing           *\/\n\/* permissions and limitations under the License.                         *\/\n\/*                                                                        *\/\n\/* IBM_PROLOG_END_TAG                                                     *\/\n\/\/\/\n\/\/\/ @file p9_putmemproc.C\n\/\/\/ @brief Invoke ADU putmem chipop\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: 3\n\/\/\/ *HWP Consumed by: HB\n\/\/\/\n\n\/\/------------------------------------------------------------------------------\n\/\/ Includes\n\/\/------------------------------------------------------------------------------\n#include <p9_putmemproc.H>\n#include <p9_adu_setup.H>\n#include <p9_adu_access.H>\n#include <p9_adu_coherent_utils.H>\n\n\/\/------------------------------------------------------------------------------\n\/\/ Function definitions\n\/\/------------------------------------------------------------------------------\n\n\/\/\/ NOTE: doxygen in header\nfapi2::ReturnCode p9_putmemproc(\n    const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>& i_target,\n    const uint64_t i_address,\n    const uint32_t i_bytes,\n    uint8_t* i_data,\n    const uint32_t i_mem_flags)\n{\n    p9_ADU_oper_flag l_flags;\n    uint64_t l_target_address = i_address;\n    uint64_t l_end_address = i_address + i_bytes;\n    uint32_t l_granules_before_setup = 0;\n    uint32_t l_granule = 0;\n    uint8_t l_data[1];\n    bool l_first_access = true;\n\n    FAPI_DBG(\"Start\");\n\n    FAPI_ASSERT(((i_mem_flags & SBE_MEM_ACCESS_FLAGS_TARGET_PROC) == SBE_MEM_ACCESS_FLAGS_TARGET_PROC) &&\n                ((i_mem_flags & SBE_MEM_ACCESS_FLAGS_TARGET_PBA)  == 0) &&\n                ((i_mem_flags & SBE_MEM_ACCESS_FLAGS_LCO_MODE) == 0) &&\n                ((i_mem_flags & SBE_MEM_ACCESS_FLAGS_CACHE_INJECT_MODE) == 0),\n                fapi2::P9_PUTMEMPROC_INVALID_FLAGS().\n                set_TARGET(i_target).\n                set_ADDRESS(i_address).\n                set_BYTES(i_bytes).\n                set_FLAGS(i_mem_flags).\n                set_FLAG_CHECK_OP_TYPE(((i_mem_flags & SBE_MEM_ACCESS_FLAGS_TARGET_PROC) == SBE_MEM_ACCESS_FLAGS_TARGET_PROC) &&\n                                       ((i_mem_flags & SBE_MEM_ACCESS_FLAGS_TARGET_PBA)  == 0)).\n                set_FLAG_CHECK_LCO_MODE((i_mem_flags & SBE_MEM_ACCESS_FLAGS_LCO_MODE) == 0).\n                set_FLAG_CHECK_CACHE_INJECT_MODE((i_mem_flags & SBE_MEM_ACCESS_FLAGS_CACHE_INJECT_MODE) == 0),\n                \"Invalid flag specified for ADU access\");\n\n    FAPI_ASSERT(((i_mem_flags & SBE_MEM_ACCESS_FLAGS_ECC_OVERRIDE) == 0) &&\n                ((i_mem_flags & SBE_MEM_ACCESS_FLAGS_TAG) == 0) &&\n                ((i_mem_flags & SBE_MEM_ACCESS_FLAGS_HOST_PASS_THROUGH) == 0),\n                fapi2::P9_PUTMEMPROC_UNSUPPORTED_FLAGS().\n                set_TARGET(i_target).\n                set_ADDRESS(i_address).\n                set_BYTES(i_bytes).\n                set_FLAGS(i_mem_flags).\n                set_FLAG_CHECK_ECC_OVERRIDE((i_mem_flags & SBE_MEM_ACCESS_FLAGS_ECC_OVERRIDE) == 0).\n                set_FLAG_CHECK_TAG((i_mem_flags & SBE_MEM_ACCESS_FLAGS_TAG) == 0).\n                set_FLAG_CHECK_HOST_PASS_THROUGH((i_mem_flags & SBE_MEM_ACCESS_FLAGS_HOST_PASS_THROUGH) == 0),\n                \"Unsupported flag specified for ADU access\");\n\n    \/\/ set auto-increment\n    l_flags.setAutoIncrement((i_mem_flags & SBE_MEM_ACCESS_FLAGS_AUTO_INCR_ON) == SBE_MEM_ACCESS_FLAGS_AUTO_INCR_ON);\n\n    \/\/ set fast mode\n    l_flags.setFastMode((i_mem_flags & SBE_MEM_ACCESS_FLAGS_FAST_MODE_ON) == SBE_MEM_ACCESS_FLAGS_FAST_MODE_ON);\n\n    \/\/ set operation type and transaction size\n    if ((i_mem_flags & SBE_MEM_ACCESS_FLAGS_CACHE_INHIBITED_MODE) == SBE_MEM_ACCESS_FLAGS_CACHE_INHIBITED_MODE)\n    {\n        l_flags.setOperationType(p9_ADU_oper_flag::CACHE_INHIBIT);\n\n        if (i_bytes == 4)\n        {\n            l_flags.setTransactionSize(p9_ADU_oper_flag::TSIZE_4);\n        }\n        else if (i_bytes == 2)\n        {\n            l_flags.setTransactionSize(p9_ADU_oper_flag::TSIZE_2);\n        }\n        else if (i_bytes == 1)\n        {\n            l_flags.setTransactionSize(p9_ADU_oper_flag::TSIZE_1);\n        }\n        else if (i_bytes == 8)\n        {\n            l_flags.setTransactionSize(p9_ADU_oper_flag::TSIZE_8);\n        }\n        else\n        {\n            FAPI_ASSERT(false,\n                        fapi2::P9_PUTMEMPROC_INVALID_SIZE_CI().\n                        set_TARGET(i_target).\n                        set_ADDRESS(i_address).\n                        set_BYTES(i_bytes).\n                        set_FLAGS(i_mem_flags),\n                        \"Invalid byte count specified for cache-inhibited access\");\n        }\n    }\n    else if ((i_mem_flags & SBE_MEM_ACCESS_FLAGS_PB_DIS_MODE) == SBE_MEM_ACCESS_FLAGS_PB_DIS_MODE)\n    {\n        l_flags.setOperationType(p9_ADU_oper_flag::PB_DIS_OPER);\n    }\n    else if ((i_mem_flags & SBE_MEM_ACCESS_FLAGS_SWITCH_MODE) == SBE_MEM_ACCESS_FLAGS_SWITCH_MODE)\n    {\n        l_flags.setOperationType(p9_ADU_oper_flag::PMISC_OPER);\n    }\n    else if ((i_mem_flags & SBE_MEM_ACCESS_FLAGS_PB_INIT_MODE) == SBE_MEM_ACCESS_FLAGS_PB_INIT_MODE)\n    {\n        l_flags.setOperationType(p9_ADU_oper_flag::PB_INIT_OPER);\n    }\n    else if ((i_mem_flags & SBE_MEM_ACCESS_FLAGS_PRE_SWITCH_CD_MODE) == SBE_MEM_ACCESS_FLAGS_PRE_SWITCH_CD_MODE)\n    {\n        l_flags.setOperationType(p9_ADU_oper_flag::PRE_SWITCH_CD);\n    }\n    else if ((i_mem_flags & SBE_MEM_ACCESS_FLAGS_PRE_SWITCH_AB_MODE) == SBE_MEM_ACCESS_FLAGS_PRE_SWITCH_AB_MODE)\n    {\n        l_flags.setOperationType(p9_ADU_oper_flag::PRE_SWITCH_AB);\n    }\n    else if ((i_mem_flags & SBE_MEM_ACCESS_FLAGS_POST_SWITCH_MODE) == SBE_MEM_ACCESS_FLAGS_POST_SWITCH_MODE)\n    {\n        l_flags.setOperationType(p9_ADU_oper_flag::POST_SWITCH);\n    }\n    else\n    {\n        l_flags.setOperationType(p9_ADU_oper_flag::DMA_PARTIAL);\n\n        if (i_bytes == 4)\n        {\n            l_flags.setTransactionSize(p9_ADU_oper_flag::TSIZE_4);\n        }\n        else if (i_bytes == 2)\n        {\n            l_flags.setTransactionSize(p9_ADU_oper_flag::TSIZE_2);\n        }\n        else if (i_bytes == 1)\n        {\n            l_flags.setTransactionSize(p9_ADU_oper_flag::TSIZE_1);\n        }\n        else if ((i_bytes % 8) == 0)\n        {\n            l_flags.setTransactionSize(p9_ADU_oper_flag::TSIZE_8);\n        }\n        else\n        {\n            FAPI_ASSERT(false,\n                        fapi2::P9_PUTMEMPROC_INVALID_SIZE_DMA().\n                        set_TARGET(i_target).\n                        set_ADDRESS(i_address).\n                        set_BYTES(i_bytes).\n                        set_FLAGS(i_mem_flags),\n                        \"Invalid byte count specified for DMA partial write access\");\n        }\n    }\n\n    while (l_target_address < l_end_address)\n    {\n        \/\/ invoke ADU setup HWP to prepare current stream of contiguous granules\n        FAPI_TRY(p9_adu_setup(i_target,\n                              l_target_address,\n                              false,\n                              l_flags.setFlag(),\n                              l_granules_before_setup),\n                 \"Error from p9_adu_setup\");\n\n        FAPI_DBG(\"Granules before setup: %d\",\n                 l_granules_before_setup);\n        l_first_access = true;\n\n        while (l_granules_before_setup && (l_target_address < l_end_address))\n        {\n            \/\/ invoke ADU access HWP to move one granule (8B)\n            l_data[0] = i_data[l_granule];\n            FAPI_TRY(p9_adu_access(i_target,\n                                   l_target_address,\n                                   false,\n                                   l_flags.setFlag(),\n                                   l_first_access,\n                                   (l_granules_before_setup == 1) ||\n                                   ((l_target_address + 8) >=\n                                    l_end_address),\n                                   l_data),\n                     \"Error from p9_adu_access\");\n\n            l_first_access = false;\n            l_granules_before_setup--;\n            l_target_address += 8;\n            l_granule++;\n        }\n    }\n\nfapi_try_exit:\n    FAPI_DBG(\"End\");\n    return fapi2::current_err;\n}\n<commit_msg>Fix HWSV duplicate enum build errors<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/nest\/p9_putmemproc.C $     *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2017,2019                        *\/\n\/* [+] International Business Machines Corp.                              *\/\n\/*                                                                        *\/\n\/*                                                                        *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\");        *\/\n\/* you may not use this file except in compliance with the License.       *\/\n\/* You may obtain a copy of the License at                                *\/\n\/*                                                                        *\/\n\/*     http:\/\/www.apache.org\/licenses\/LICENSE-2.0                         *\/\n\/*                                                                        *\/\n\/* Unless required by applicable law or agreed to in writing, software    *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS,      *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or        *\/\n\/* implied. See the License for the specific language governing           *\/\n\/* permissions and limitations under the License.                         *\/\n\/*                                                                        *\/\n\/* IBM_PROLOG_END_TAG                                                     *\/\n\/\/\/\n\/\/\/ @file p9_putmemproc.C\n\/\/\/ @brief Invoke ADU putmem chipop\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: 3\n\/\/\/ *HWP Consumed by: HB\n\/\/\/\n\n\/\/------------------------------------------------------------------------------\n\/\/ Includes\n\/\/------------------------------------------------------------------------------\n#include <p9_putmemproc.H>\n#include <p9_adu_setup.H>\n#include <p9_adu_access.H>\n#include <p9_adu_coherent_utils.H>\n\n\/\/------------------------------------------------------------------------------\n\/\/ Function definitions\n\/\/------------------------------------------------------------------------------\n\n\/\/\/ NOTE: doxygen in header\nfapi2::ReturnCode p9_putmemproc(\n    const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>& i_target,\n    const uint64_t i_address,\n    const uint32_t i_bytes,\n    uint8_t* i_data,\n    const uint32_t i_mem_flags)\n{\n    p9_ADU_oper_flag l_flags;\n    uint64_t l_target_address = i_address;\n    uint64_t l_end_address = i_address + i_bytes;\n    uint32_t l_granules_before_setup = 0;\n    uint32_t l_granule = 0;\n    uint8_t l_data[1];\n    bool l_first_access = true;\n\n    FAPI_DBG(\"Start\");\n\n    FAPI_ASSERT(((i_mem_flags & fapi2::SBE_MEM_ACCESS_FLAGS_TARGET_PROC) == fapi2::SBE_MEM_ACCESS_FLAGS_TARGET_PROC) &&\n                ((i_mem_flags & fapi2::SBE_MEM_ACCESS_FLAGS_TARGET_PBA)  == 0) &&\n                ((i_mem_flags & fapi2::SBE_MEM_ACCESS_FLAGS_LCO_MODE) == 0) &&\n                ((i_mem_flags & fapi2::SBE_MEM_ACCESS_FLAGS_CACHE_INJECT_MODE) == 0),\n                fapi2::P9_PUTMEMPROC_INVALID_FLAGS().\n                set_TARGET(i_target).\n                set_ADDRESS(i_address).\n                set_BYTES(i_bytes).\n                set_FLAGS(i_mem_flags).\n                set_FLAG_CHECK_OP_TYPE(((i_mem_flags & fapi2::SBE_MEM_ACCESS_FLAGS_TARGET_PROC) ==\n                                        fapi2::SBE_MEM_ACCESS_FLAGS_TARGET_PROC) &&\n                                       ((i_mem_flags & fapi2::SBE_MEM_ACCESS_FLAGS_TARGET_PBA)  == 0)).\n                set_FLAG_CHECK_LCO_MODE((i_mem_flags & fapi2::SBE_MEM_ACCESS_FLAGS_LCO_MODE) == 0).\n                set_FLAG_CHECK_CACHE_INJECT_MODE((i_mem_flags & fapi2::SBE_MEM_ACCESS_FLAGS_CACHE_INJECT_MODE) == 0),\n                \"Invalid flag specified for ADU access\");\n\n    FAPI_ASSERT(((i_mem_flags & fapi2::SBE_MEM_ACCESS_FLAGS_ECC_OVERRIDE) == 0) &&\n                ((i_mem_flags & fapi2::SBE_MEM_ACCESS_FLAGS_TAG) == 0) &&\n                ((i_mem_flags & fapi2::SBE_MEM_ACCESS_FLAGS_HOST_PASS_THROUGH) == 0),\n                fapi2::P9_PUTMEMPROC_UNSUPPORTED_FLAGS().\n                set_TARGET(i_target).\n                set_ADDRESS(i_address).\n                set_BYTES(i_bytes).\n                set_FLAGS(i_mem_flags).\n                set_FLAG_CHECK_ECC_OVERRIDE((i_mem_flags & fapi2::SBE_MEM_ACCESS_FLAGS_ECC_OVERRIDE) == 0).\n                set_FLAG_CHECK_TAG((i_mem_flags & fapi2::SBE_MEM_ACCESS_FLAGS_TAG) == 0).\n                set_FLAG_CHECK_HOST_PASS_THROUGH((i_mem_flags & fapi2::SBE_MEM_ACCESS_FLAGS_HOST_PASS_THROUGH) == 0),\n                \"Unsupported flag specified for ADU access\");\n\n    \/\/ set auto-increment\n    l_flags.setAutoIncrement((i_mem_flags & fapi2::SBE_MEM_ACCESS_FLAGS_AUTO_INCR_ON) ==\n                             fapi2::SBE_MEM_ACCESS_FLAGS_AUTO_INCR_ON);\n\n    \/\/ set fast mode\n    l_flags.setFastMode((i_mem_flags & fapi2::SBE_MEM_ACCESS_FLAGS_FAST_MODE_ON) ==\n                        fapi2::SBE_MEM_ACCESS_FLAGS_FAST_MODE_ON);\n\n    \/\/ set operation type and transaction size\n    if ((i_mem_flags & fapi2::SBE_MEM_ACCESS_FLAGS_CACHE_INHIBITED_MODE) ==\n        fapi2::SBE_MEM_ACCESS_FLAGS_CACHE_INHIBITED_MODE)\n    {\n        l_flags.setOperationType(p9_ADU_oper_flag::CACHE_INHIBIT);\n\n        if (i_bytes == 4)\n        {\n            l_flags.setTransactionSize(p9_ADU_oper_flag::TSIZE_4);\n        }\n        else if (i_bytes == 2)\n        {\n            l_flags.setTransactionSize(p9_ADU_oper_flag::TSIZE_2);\n        }\n        else if (i_bytes == 1)\n        {\n            l_flags.setTransactionSize(p9_ADU_oper_flag::TSIZE_1);\n        }\n        else if (i_bytes == 8)\n        {\n            l_flags.setTransactionSize(p9_ADU_oper_flag::TSIZE_8);\n        }\n        else\n        {\n            FAPI_ASSERT(false,\n                        fapi2::P9_PUTMEMPROC_INVALID_SIZE_CI().\n                        set_TARGET(i_target).\n                        set_ADDRESS(i_address).\n                        set_BYTES(i_bytes).\n                        set_FLAGS(i_mem_flags),\n                        \"Invalid byte count specified for cache-inhibited access\");\n        }\n    }\n    else if ((i_mem_flags & fapi2::SBE_MEM_ACCESS_FLAGS_PB_DIS_MODE) == fapi2::SBE_MEM_ACCESS_FLAGS_PB_DIS_MODE)\n    {\n        l_flags.setOperationType(p9_ADU_oper_flag::PB_DIS_OPER);\n    }\n    else if ((i_mem_flags & fapi2::SBE_MEM_ACCESS_FLAGS_SWITCH_MODE) == fapi2::SBE_MEM_ACCESS_FLAGS_SWITCH_MODE)\n    {\n        l_flags.setOperationType(p9_ADU_oper_flag::PMISC_OPER);\n    }\n    else if ((i_mem_flags & fapi2::SBE_MEM_ACCESS_FLAGS_PB_INIT_MODE) == fapi2::SBE_MEM_ACCESS_FLAGS_PB_INIT_MODE)\n    {\n        l_flags.setOperationType(p9_ADU_oper_flag::PB_INIT_OPER);\n    }\n    else if ((i_mem_flags & fapi2::SBE_MEM_ACCESS_FLAGS_PRE_SWITCH_CD_MODE) ==\n             fapi2::SBE_MEM_ACCESS_FLAGS_PRE_SWITCH_CD_MODE)\n    {\n        l_flags.setOperationType(p9_ADU_oper_flag::PRE_SWITCH_CD);\n    }\n    else if ((i_mem_flags & fapi2::SBE_MEM_ACCESS_FLAGS_PRE_SWITCH_AB_MODE) ==\n             fapi2::SBE_MEM_ACCESS_FLAGS_PRE_SWITCH_AB_MODE)\n    {\n        l_flags.setOperationType(p9_ADU_oper_flag::PRE_SWITCH_AB);\n    }\n    else if ((i_mem_flags & fapi2::SBE_MEM_ACCESS_FLAGS_POST_SWITCH_MODE) == fapi2::SBE_MEM_ACCESS_FLAGS_POST_SWITCH_MODE)\n    {\n        l_flags.setOperationType(p9_ADU_oper_flag::POST_SWITCH);\n    }\n    else\n    {\n        l_flags.setOperationType(p9_ADU_oper_flag::DMA_PARTIAL);\n\n        if (i_bytes == 4)\n        {\n            l_flags.setTransactionSize(p9_ADU_oper_flag::TSIZE_4);\n        }\n        else if (i_bytes == 2)\n        {\n            l_flags.setTransactionSize(p9_ADU_oper_flag::TSIZE_2);\n        }\n        else if (i_bytes == 1)\n        {\n            l_flags.setTransactionSize(p9_ADU_oper_flag::TSIZE_1);\n        }\n        else if ((i_bytes % 8) == 0)\n        {\n            l_flags.setTransactionSize(p9_ADU_oper_flag::TSIZE_8);\n        }\n        else\n        {\n            FAPI_ASSERT(false,\n                        fapi2::P9_PUTMEMPROC_INVALID_SIZE_DMA().\n                        set_TARGET(i_target).\n                        set_ADDRESS(i_address).\n                        set_BYTES(i_bytes).\n                        set_FLAGS(i_mem_flags),\n                        \"Invalid byte count specified for DMA partial write access\");\n        }\n    }\n\n    while (l_target_address < l_end_address)\n    {\n        \/\/ invoke ADU setup HWP to prepare current stream of contiguous granules\n        FAPI_TRY(p9_adu_setup(i_target,\n                              l_target_address,\n                              false,\n                              l_flags.setFlag(),\n                              l_granules_before_setup),\n                 \"Error from p9_adu_setup\");\n\n        FAPI_DBG(\"Granules before setup: %d\",\n                 l_granules_before_setup);\n        l_first_access = true;\n\n        while (l_granules_before_setup && (l_target_address < l_end_address))\n        {\n            \/\/ invoke ADU access HWP to move one granule (8B)\n            l_data[0] = i_data[l_granule];\n            FAPI_TRY(p9_adu_access(i_target,\n                                   l_target_address,\n                                   false,\n                                   l_flags.setFlag(),\n                                   l_first_access,\n                                   (l_granules_before_setup == 1) ||\n                                   ((l_target_address + 8) >=\n                                    l_end_address),\n                                   l_data),\n                     \"Error from p9_adu_access\");\n\n            l_first_access = false;\n            l_granules_before_setup--;\n            l_target_address += 8;\n            l_granule++;\n        }\n    }\n\nfapi_try_exit:\n    FAPI_DBG(\"End\");\n    return fapi2::current_err;\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include <nxp\/iolpc2387.h>\n#include <assert.h>\n#include <stdio.h>\n#include <string.h>\n#include \"LPC23xx_enet.h\"\n\n\/\/ ============================================================================\n\/*!\n * \\brief EnetTxCtrl_t\n *\n * Transmit descriptor control word\n *\n * See LPC23xx User Manual Ch16, Table 212\n *\n *\/\ntypedef union _EnetTxCtrl_t\n{\n\tunsigned int Data;\n\tstruct\n\t{\n\t\tunsigned int Size     : 11;\n\t\tunsigned int \t\t  : 15;\n\t\tunsigned int Override :  1;\n\t\tunsigned int Huge     :  1;\n\t\tunsigned int Pad      :  1;\n\t\tunsigned int CRC      :  1;\n\t\tunsigned int Last     :  1;\n\t\tunsigned int Intr     :  1;\n\t};\n} EnetTxCtrl_t, *pEnetTxCtrl_t;\n\n\/\/ ============================================================================\n\/*!\n * \\brief EnetTxCtrl_t\n *\n * Transmit descriptor\n *\n * See LPC23xx User Manual Ch16, Table 211\n *\n *\/\ntypedef struct _EnetDmaTxDesc_t\n{\n  unsigned char* pBuffer;\n  EnetTxCtrl_t EnetTxCtrl;\n} EnetDmaTxDesc_t, * pEnetDmaTxDesc_t;\n\n\/\/ ============================================================================\n\/*!\n * \\brief EnetDmaTxStatus_t\n *\n * Transmit status\n *\n * See LPC23xx User Manual Ch16, Table 211\n *\n *\/\ntypedef union _EnetDmaTxStatus_t\n{\n\tunsigned int Data;\n\tstruct\n\t{\n\t\tunsigned int                    :21;\n\t\tunsigned int CollisionCount     : 4;\n\t\tunsigned int Defer              : 1;\n\t\tunsigned int ExcessiveDefer     : 1;\n\t\tunsigned int ExcessiveCollision : 1;\n\t\tunsigned int LateCollision      : 1;\n\t\tunsigned int Underrun           : 1;\n\t\tunsigned int NoDescriptor       : 1;\n\t\tunsigned int Error              : 1;\n\t};\n} EnetDmaTxStatus_t, * pEnetDmaTxStatus_t;\n\n\/\/ ============================================================================\n\/*!\n * \\brief EnetRxCtrl_t\n *\n * Receive descriptor control word\n *\n * See LPC23xx User Manual Ch16, Table 207\n *\n *\/\ntypedef struct _EnetRxCtrl_t\n{\n  unsigned int Size     : 11;\n  unsigned int          : 20;\n  unsigned int Intr     :  1;\n} EnetRxCtrl_t, *pEnetRxCtrl_t;\n\n\/\/ ============================================================================\n\/*!\n * \\brief EnetDmaRxDesc_t\n *\n * Receive descriptor\n *\n * See LPC23xx User Manual Ch16, Table 206\n *\n *\/\ntypedef struct _EnetDmaRxDesc_t\n{\n  unsigned char* pBuffer;\n  EnetRxCtrl_t EnetRxCtrl;\n} EnetDmaRxDesc_t, * pEnetDmaRxDesc_t;\n\n\/\/ ============================================================================\n\/*!\n * \\brief EnetDmaRxStatus_t\n *\n * Receive status\n *\n * See LPC23xx User Manual Ch16, Table 208\n *\n *\/\ntypedef union _EnetDmaRxStatus_t\n{\n\tunsigned int Data[2];\n\tstruct\n\t{\n\t\tunsigned int RxSize         :11;\n\t\tunsigned int                : 7;\n\t\tunsigned int ControlFrame   : 1; \/\/ bit 18\n\t\tunsigned int VLAN           : 1; \/\/ bit 19\n\n\t\tunsigned int FailFilter     : 1; \/\/ bit 20\n\t\tunsigned int Multicast      : 1; \/\/ bit 21\n\t\tunsigned int Broadcast      : 1; \/\/ bit 22\n\t\tunsigned int CRCError       : 1; \/\/ bit 23\n\n\t\tunsigned int SymbolError    : 1; \/\/ bit 24\n\t\tunsigned int LengthError    : 1; \/\/ bit 25\n\t\tunsigned int RangeError     : 1; \/\/ bit 26\n\t\tunsigned int AlignmentError : 1; \/\/ bit 27\n\n\t\tunsigned int Overrun        : 1; \/\/ bit 28\n\t\tunsigned int NoDescriptor   : 1; \/\/ bit 29\n\t\tunsigned int LastFlag       : 1; \/\/ bit 30\n\t\tunsigned int Error          : 1; \/\/ bit 31\n\n\t\tunsigned int SAHashCRC      : 8;\n\t\tunsigned int                : 8;\n\t\tunsigned int DAHashCRC      : 8;\n\t\tunsigned int                : 8;\n\t};\n} EnetDmaRxStatus_t, * pEnetDmaRxStatus_t;\n\n#pragma segment=\"EMAC_DMA_RAM\"\n\n\/\/ ============================================================================\n\/\/ TX\n\n#define TX_BUFFER_COUNT\t\t3\n\n#pragma location=\"EMAC_DMA_RAM\"\n#pragma data_alignment=16\n__no_init static unsigned char txBuffers [TX_BUFFER_COUNT] [MAX_FRAME_SIZE_IN_SOFTWARE];\n\n#pragma location=\"EMAC_DMA_RAM\"\n#pragma data_alignment=8\n__no_init static EnetDmaTxDesc_t EnetDmaTx [TX_BUFFER_COUNT];\n\n#pragma location=\"EMAC_DMA_RAM\"\n#pragma data_alignment=8\n__no_init static EnetDmaTxStatus_t EnetDmaTxSta [TX_BUFFER_COUNT];\n\n\/\/ ============================================================================\n\/\/ RX\n\n#define RX_BUFFER_COUNT\t\t7\n\n#pragma location=\"EMAC_DMA_RAM\"\n#pragma data_alignment=16\n__no_init static unsigned char rxBuffers [RX_BUFFER_COUNT] [MAX_FRAME_SIZE_IN_SOFTWARE];\n\n#pragma location=\"EMAC_DMA_RAM\"\n#pragma data_alignment=8\n__no_init static EnetDmaRxDesc_t EnetDmaRx [RX_BUFFER_COUNT];\n\n#pragma location=\"EMAC_DMA_RAM\"\n#pragma data_alignment=8\n__no_init static EnetDmaRxStatus_t EnetDmaRxSta [RX_BUFFER_COUNT];\n\nvoid ENET_Init (const unsigned char macAddress[6])\n{\n\tunsigned int tout;\n\n\tfor (tout = 100; tout; tout--);\n\n\t\/\/ Power Up the EMAC controller.\n\tPCONP_bit.PCENET = 1;\n\n\t\/\/ Hold on a while while the ethernet controller is initialized after it was powered.\n\tfor (volatile int i = 0; i < 100000; i++)\n\t\t;\n\n\tassert (PINMODE2_bit.P1_0 == 2);\n\tassert (PINSEL2_bit.P1_0 == 1);\n\n\t\/\/ Reset all EMAC internal modules.\n\tMAC1 = (1 << 8) \/\/ MAC1_RES_TX\n\t\t\t| (1 << 9) \/\/ MAC1_RES_MCS_TX\n\t\t\t| (1 << 10) \/\/ MAC1_RES_RX\n\t\t\t| (1 << 11) \/\/ MAC1_RES_MCS_RX\n\t\t\t| (1 << 14) \/\/ MAC1_SIM_RES\n\t\t\t| (1 << 15); \/\/ MAC1_SOFT_RES\n\n\tCOMMAND = (1 << 3) \/\/ CR_REG_RES\n\t\t\t| (1 << 4) \/\/ CR_TX_RES\n\t\t\t| (1 << 5); \/\/ CR_RX_RES\n\n\t\/\/ A short delay after reset.\n\tfor (tout = 100; tout; tout--);\n\n\t\/\/ ------------------------------------------------------------------------\n\n\t\/\/ Initialize MAC control registers.\n\tMAC1 = (1 << 1); \/\/ MAC1_PASS_ALL; - this actually enables\/reenables the MII interface\n\tMAXF = 0x600; \/\/ ETH_MAX_FLEN;\n\n\tCLRT = 0x0000370F;\n\tIPGR = 0x0C12;\n\tIPGT = 0x15;\n\n\tMAC2_bit.FD = COMMAND_bit.FULLDUPLEX = 1;\n\n\tMAC2_bit.PADCRCEN = 1; \/\/ enabled padding\/CRC\n\tMAC2_bit.ADPE = 1; \/\/ auto-detect pad enable\n\n\t\/\/ This bit configures the Reduced MII logic for the current operating speed. When set,\n\t\/\/ 100 Mbps mode is selected. When cleared, 10 Mbps mode is selected.\n\tSUPP_bit.SPEED = 1;\n\n\/\/\t\/\/ MIIM init\n\/\/\tMCFG = 0x8018;  \/\/ clk\/20\n\/\/\tMCMD = 0;\n\/\/\tMCFG_bit.RSTMIIMGMT = 0;\n\tCOMMAND_bit.RMII = 1;\n\n\t\/\/ ----------------------------------------\n\t\/\/ init RX FIFO\n\n\tfor (unsigned int i = 0; i < RX_BUFFER_COUNT; i++)\n\t{\n\t\tEnetDmaRx [i].EnetRxCtrl.Size = MAX_FRAME_SIZE_IN_SOFTWARE - 1;\n\t\tEnetDmaRx [i].pBuffer = rxBuffers [i];\n\t\tEnetDmaRxSta [i].Data [0] = 0;\n\t\tEnetDmaRxSta [i].Data [1] = 0;\n\t}\n\n\t\/\/ Set EMAC Receive Descriptor Registers.\n\tRXDESCRIPTOR   = (unsigned int) EnetDmaRx;\n\tRXSTATUS       = (unsigned int) EnetDmaRxSta;\n\tRXDESCRIPTORNUMBER = RX_BUFFER_COUNT - 1;\n\t\/\/ Rx Descriptors Point to 0\n\tRXCONSUMEINDEX  = 0;\n\n\t\/\/ ----------------------------------------\n\t\/\/ init TX FIFO\n\n\tfor (unsigned int i = 0; i < TX_BUFFER_COUNT; i++)\n\t\tEnetDmaTx [i].pBuffer = txBuffers [i];\n\n\t\/\/ Set EMAC Transmit Descriptor Registers.\n\tTXDESCRIPTOR   = (unsigned int) EnetDmaTx;\n\tTXSTATUS       = (unsigned int) EnetDmaTxSta;\n\tTXDESCRIPTORNUMBER = TX_BUFFER_COUNT - 1;\n\t\/\/ Tx Descriptors Point to 0\n\tTXPRODUCEINDEX  = 0;\n\n\t\/\/ write the station address registers\n\tSA0 = (macAddress[1] << 8) | macAddress[0];\n\tSA1 = (macAddress[3] << 8) | macAddress[2];\n\tSA2 = (macAddress[5] << 8) | macAddress[4];\n\n\tRXFILTERCTRL = (1 << 1)  \/\/ accept broadcast\n\t\t\t\t | (1 << 2)  \/\/ accept multicast\n\t\t\t\t | (1 << 5); \/\/ accept perfect match\n\n\tCOMMAND_bit.RXENABLE = 1;\n\tMAC1_bit.RE = 1;\n\tCOMMAND_bit.TXENABLE = 1;\n}\n\n\/\/ ============================================================================\n\nunsigned int tapdev_read (void* pPacket)\n{\n\tunsigned int index = RXCONSUMEINDEX;\n\tif (index == RXPRODUCEINDEX)\n\t\treturn 0;\n\n\tunsigned int frameSize = 0;\n\n\tconst EnetDmaRxStatus_t* status = &EnetDmaRxSta[index];\n\tif (status->FailFilter)\n\t{\n\t\tprintf (\"FailFilter\\r\\n\");\n\t}\n\telse if (status->NoDescriptor)\n\t{\n\t\tprintf (\"NoDesc\\r\\n\");\n\t}\n\telse if (status->AlignmentError)\n\t{\n\t\tprintf (\"Alignment\\r\\n\");\n\t}\n\telse if (status->LengthError)\n\t{\n\t\tprintf (\"Length\\r\\n\");\n\t}\n\telse if (status->SymbolError)\n\t{\n\t\tprintf (\"Symbol\\r\\n\");\n\t}\n\telse if (status->CRCError)\n\t{\n\t\tprintf (\"CRC\\r\\n\");\n\t}\n\telse if (status->Overrun)\n\t{\n\t\tprintf (\"Overrun\\r\\n\");\n\t}\n\telse\n\t{\n\t\tframeSize = status->RxSize + 1;\n\t\tassert (frameSize >= 64);\n\n\t\t\/\/ strip the CRC at the end\n\t\tframeSize -= 4;\n\n\t\tmemcpy (pPacket, EnetDmaRx[index].pBuffer, frameSize);\n\t}\n\n\tindex++;\n\tif (index == RX_BUFFER_COUNT)\n\t\tindex = 0;\n\tRXCONSUMEINDEX = index;\n\n\treturn frameSize;\n}\n\n\/\/ ============================================================================\n\nvoid tapdev_send (void* pPacket, unsigned int size)\n{\n\tassert ((size > 0) && (size <= MAX_FRAME_SIZE_IN_SOFTWARE));\n\n\tunsigned int nextProduceIndex;\n\n\tdo\n\t{\n\t\tnextProduceIndex = (TXPRODUCEINDEX + 1) % TX_BUFFER_COUNT;\n\t} while (nextProduceIndex == TXCONSUMEINDEX);\n\n\tEnetDmaTxDesc_t* descriptor = &EnetDmaTx [TXPRODUCEINDEX];\n\n\tmemcpy (descriptor->pBuffer, pPacket, size);\n\tdescriptor->EnetTxCtrl.Data =\n\t\t  (size - 1)\n\t\t| (1U << 26) \/\/ Override\n\t\t| (0U << 27) \/\/ Huge\n\t\t| (1U << 28) \/\/ Pad\n\t\t| (1U << 29) \/\/ CRC\n\t\t| (1U << 30) \/\/ Last\n\t\t| (0U << 31);\/\/ Interrupt\n\n\tTXPRODUCEINDEX = nextProduceIndex;\n}\n\n\/\/ ============================================================================\n\nvoid ENET_MIIWriteRegister (unsigned char DevId, unsigned char RegAddr, unsigned short Value)\n{\n\tMCMD = 0;                   \/\/ set read operation\n\tMADR_bit.PHY_ADDR = DevId;  \/\/ set the MII Physical address\n\tMADR_bit.REGADDR = RegAddr; \/\/ set the MII register address\n\tMWTD = Value;\n\twhile(MIND_bit.BUSY)\n\t\t;\n}\n\n\/\/ ============================================================================\n\n#define MIND_BUSY        (1u<<0)\n#define MIND_NOT_VALID   (1u<<2)\n\nunsigned short ENET_MIIReadRegister (unsigned char DevId, unsigned char RegAddr)\n{\n\tMCMD = 0;\n\tMADR_bit.PHY_ADDR = DevId;  \/\/ set the MII Physical address\n\tMADR_bit.REGADDR = RegAddr; \/\/ set the MII register address\n\tMCMD = 1;                   \/\/ set read operation\n\twhile(MIND &(MIND_BUSY | MIND_NOT_VALID))\n\t\t;\n\n\treturn (unsigned short) MRDD;\n}\n\n\n<commit_msg>Bug fix in a sample embedded app.<commit_after>\n#include <nxp\/iolpc2387.h>\n#include <assert.h>\n#include <stdio.h>\n#include <string.h>\n#include \"LPC23xx_enet.h\"\n\n\/\/ ============================================================================\n\/*!\n * \\brief EnetTxCtrl_t\n *\n * Transmit descriptor control word\n *\n * See LPC23xx User Manual Ch16, Table 212\n *\n *\/\ntypedef union _EnetTxCtrl_t\n{\n\tunsigned int Data;\n\tstruct\n\t{\n\t\tunsigned int Size     : 11;\n\t\tunsigned int \t\t  : 15;\n\t\tunsigned int Override :  1;\n\t\tunsigned int Huge     :  1;\n\t\tunsigned int Pad      :  1;\n\t\tunsigned int CRC      :  1;\n\t\tunsigned int Last     :  1;\n\t\tunsigned int Intr     :  1;\n\t};\n} EnetTxCtrl_t, *pEnetTxCtrl_t;\n\n\/\/ ============================================================================\n\/*!\n * \\brief EnetTxCtrl_t\n *\n * Transmit descriptor\n *\n * See LPC23xx User Manual Ch16, Table 211\n *\n *\/\ntypedef struct _EnetDmaTxDesc_t\n{\n  unsigned char* pBuffer;\n  EnetTxCtrl_t EnetTxCtrl;\n} EnetDmaTxDesc_t, * pEnetDmaTxDesc_t;\n\n\/\/ ============================================================================\n\/*!\n * \\brief EnetDmaTxStatus_t\n *\n * Transmit status\n *\n * See LPC23xx User Manual Ch16, Table 211\n *\n *\/\ntypedef union _EnetDmaTxStatus_t\n{\n\tunsigned int Data;\n\tstruct\n\t{\n\t\tunsigned int                    :21;\n\t\tunsigned int CollisionCount     : 4;\n\t\tunsigned int Defer              : 1;\n\t\tunsigned int ExcessiveDefer     : 1;\n\t\tunsigned int ExcessiveCollision : 1;\n\t\tunsigned int LateCollision      : 1;\n\t\tunsigned int Underrun           : 1;\n\t\tunsigned int NoDescriptor       : 1;\n\t\tunsigned int Error              : 1;\n\t};\n} EnetDmaTxStatus_t, * pEnetDmaTxStatus_t;\n\n\/\/ ============================================================================\n\/*!\n * \\brief EnetRxCtrl_t\n *\n * Receive descriptor control word\n *\n * See LPC23xx User Manual Ch16, Table 207\n *\n *\/\ntypedef struct _EnetRxCtrl_t\n{\n  unsigned int Size     : 11;\n  unsigned int          : 20;\n  unsigned int Intr     :  1;\n} EnetRxCtrl_t, *pEnetRxCtrl_t;\n\n\/\/ ============================================================================\n\/*!\n * \\brief EnetDmaRxDesc_t\n *\n * Receive descriptor\n *\n * See LPC23xx User Manual Ch16, Table 206\n *\n *\/\ntypedef struct _EnetDmaRxDesc_t\n{\n  unsigned char* pBuffer;\n  EnetRxCtrl_t EnetRxCtrl;\n} EnetDmaRxDesc_t, * pEnetDmaRxDesc_t;\n\n\/\/ ============================================================================\n\/*!\n * \\brief EnetDmaRxStatus_t\n *\n * Receive status\n *\n * See LPC23xx User Manual Ch16, Table 208\n *\n *\/\ntypedef union _EnetDmaRxStatus_t\n{\n\tunsigned int Data[2];\n\tstruct\n\t{\n\t\tunsigned int RxSize         :11;\n\t\tunsigned int                : 7;\n\t\tunsigned int ControlFrame   : 1; \/\/ bit 18\n\t\tunsigned int VLAN           : 1; \/\/ bit 19\n\n\t\tunsigned int FailFilter     : 1; \/\/ bit 20\n\t\tunsigned int Multicast      : 1; \/\/ bit 21\n\t\tunsigned int Broadcast      : 1; \/\/ bit 22\n\t\tunsigned int CRCError       : 1; \/\/ bit 23\n\n\t\tunsigned int SymbolError    : 1; \/\/ bit 24\n\t\tunsigned int LengthError    : 1; \/\/ bit 25\n\t\tunsigned int RangeError     : 1; \/\/ bit 26\n\t\tunsigned int AlignmentError : 1; \/\/ bit 27\n\n\t\tunsigned int Overrun        : 1; \/\/ bit 28\n\t\tunsigned int NoDescriptor   : 1; \/\/ bit 29\n\t\tunsigned int LastFlag       : 1; \/\/ bit 30\n\t\tunsigned int Error          : 1; \/\/ bit 31\n\n\t\tunsigned int SAHashCRC      : 8;\n\t\tunsigned int                : 8;\n\t\tunsigned int DAHashCRC      : 8;\n\t\tunsigned int                : 8;\n\t};\n} EnetDmaRxStatus_t, * pEnetDmaRxStatus_t;\n\n#pragma segment=\"EMAC_DMA_RAM\"\n\n\/\/ ============================================================================\n\/\/ TX\n\n#define TX_BUFFER_COUNT\t\t3\n\n#pragma location=\"EMAC_DMA_RAM\"\n#pragma data_alignment=16\n__no_init static unsigned char txBuffers [TX_BUFFER_COUNT] [MAX_FRAME_SIZE_IN_SOFTWARE];\n\n#pragma location=\"EMAC_DMA_RAM\"\n#pragma data_alignment=8\n__no_init static EnetDmaTxDesc_t EnetDmaTx [TX_BUFFER_COUNT];\n\n#pragma location=\"EMAC_DMA_RAM\"\n#pragma data_alignment=8\n__no_init static EnetDmaTxStatus_t EnetDmaTxSta [TX_BUFFER_COUNT];\n\n\/\/ ============================================================================\n\/\/ RX\n\n#define RX_BUFFER_COUNT\t\t7\n\n#pragma location=\"EMAC_DMA_RAM\"\n#pragma data_alignment=16\n__no_init static unsigned char rxBuffers [RX_BUFFER_COUNT] [MAX_FRAME_SIZE_IN_SOFTWARE];\n\n#pragma location=\"EMAC_DMA_RAM\"\n#pragma data_alignment=8\n__no_init static EnetDmaRxDesc_t EnetDmaRx [RX_BUFFER_COUNT];\n\n#pragma location=\"EMAC_DMA_RAM\"\n#pragma data_alignment=8\n__no_init static EnetDmaRxStatus_t EnetDmaRxSta [RX_BUFFER_COUNT];\n\nvoid ENET_Init (const unsigned char macAddress[6])\n{\n\tunsigned int tout;\n\n\tfor (tout = 100; tout; tout--);\n\n\t\/\/ Power Up the EMAC controller.\n\tPCONP_bit.PCENET = 1;\n\n\t\/\/ Hold on a while while the ethernet controller is initialized after it was powered.\n\tfor (volatile int i = 0; i < 100000; i++)\n\t\t;\n\n\tassert (PINMODE2_bit.P1_0 == 2);\n\tassert (PINSEL2_bit.P1_0 == 1);\n\n\t\/\/ Reset all EMAC internal modules.\n\tMAC1 = (1 << 8) \/\/ MAC1_RES_TX\n\t\t\t| (1 << 9) \/\/ MAC1_RES_MCS_TX\n\t\t\t| (1 << 10) \/\/ MAC1_RES_RX\n\t\t\t| (1 << 11) \/\/ MAC1_RES_MCS_RX\n\t\t\t| (1 << 14) \/\/ MAC1_SIM_RES\n\t\t\t| (1 << 15); \/\/ MAC1_SOFT_RES\n\n\tCOMMAND = (1 << 3) \/\/ CR_REG_RES\n\t\t\t| (1 << 4) \/\/ CR_TX_RES\n\t\t\t| (1 << 5); \/\/ CR_RX_RES\n\n\t\/\/ A short delay after reset.\n\tfor (tout = 100; tout; tout--);\n\n\t\/\/ ------------------------------------------------------------------------\n\n\t\/\/ Initialize MAC control registers.\n\tMAC1 = (1 << 1); \/\/ MAC1_PASS_ALL; - this actually enables\/reenables the MII interface\n\tMAXF = 0x600; \/\/ ETH_MAX_FLEN;\n\n\tCLRT = 0x0000370F;\n\tIPGR = 0x0C12;\n\tIPGT = 0x15;\n\n\tMAC2_bit.FD = COMMAND_bit.FULLDUPLEX = 1;\n\n\tMAC2_bit.PADCRCEN = 1; \/\/ enabled padding\/CRC\n\tMAC2_bit.ADPE = 1; \/\/ auto-detect pad enable\n\n\t\/\/ This bit configures the Reduced MII logic for the current operating speed. When set,\n\t\/\/ 100 Mbps mode is selected. When cleared, 10 Mbps mode is selected.\n\tSUPP_bit.SPEED = 1;\n\n\/\/\t\/\/ MIIM init\n\/\/\tMCFG = 0x8018;  \/\/ clk\/20\n\/\/\tMCMD = 0;\n\/\/\tMCFG_bit.RSTMIIMGMT = 0;\n\tCOMMAND_bit.RMII = 1;\n\n\t\/\/ ----------------------------------------\n\t\/\/ init RX FIFO\n\n\tfor (unsigned int i = 0; i < RX_BUFFER_COUNT; i++)\n\t{\n\t\tEnetDmaRx [i].EnetRxCtrl.Size = MAX_FRAME_SIZE_IN_SOFTWARE - 1;\n\t\tEnetDmaRx [i].pBuffer = rxBuffers [i];\n\t\tEnetDmaRxSta [i].Data [0] = 0;\n\t\tEnetDmaRxSta [i].Data [1] = 0;\n\t}\n\n\t\/\/ Set EMAC Receive Descriptor Registers.\n\tRXDESCRIPTOR   = (unsigned int) EnetDmaRx;\n\tRXSTATUS       = (unsigned int) EnetDmaRxSta;\n\tRXDESCRIPTORNUMBER = RX_BUFFER_COUNT - 1;\n\t\/\/ Rx Descriptors Point to 0\n\tRXCONSUMEINDEX  = 0;\n\n\t\/\/ ----------------------------------------\n\t\/\/ init TX FIFO\n\n\tfor (unsigned int i = 0; i < TX_BUFFER_COUNT; i++)\n\t\tEnetDmaTx [i].pBuffer = txBuffers [i];\n\n\t\/\/ Set EMAC Transmit Descriptor Registers.\n\tTXDESCRIPTOR   = (unsigned int) EnetDmaTx;\n\tTXSTATUS       = (unsigned int) EnetDmaTxSta;\n\tTXDESCRIPTORNUMBER = TX_BUFFER_COUNT - 1;\n\t\/\/ Tx Descriptors Point to 0\n\tTXPRODUCEINDEX  = 0;\n\n\t\/\/ write the station address registers\n\tSA0 = (macAddress[1] << 8) | macAddress[0];\n\tSA1 = (macAddress[3] << 8) | macAddress[2];\n\tSA2 = (macAddress[5] << 8) | macAddress[4];\n\n\tRXFILTERCTRL = (1 << 1)  \/\/ accept broadcast\n\t\t\t\t | (1 << 2)  \/\/ accept multicast\n\t\t\t\t | (1 << 5); \/\/ accept perfect match\n\n\tCOMMAND_bit.RXENABLE = 1;\n\tMAC1_bit.RE = 1;\n\tCOMMAND_bit.TXENABLE = 1;\n}\n\n\/\/ ============================================================================\n\nunsigned int tapdev_read (void* pPacket)\n{\n\tunsigned int index = RXCONSUMEINDEX;\n\tif (index == RXPRODUCEINDEX)\n\t\treturn 0;\n\n\tunsigned int frameSize = 0;\n\n\tconst EnetDmaRxStatus_t* status = &EnetDmaRxSta[index];\n\tif (status->FailFilter)\n\t{\n\t\tprintf (\"FailFilter\\r\\n\");\n\t}\n\telse if (status->NoDescriptor)\n\t{\n\t\tprintf (\"NoDesc\\r\\n\");\n\t}\n\telse if (status->AlignmentError)\n\t{\n\t\tprintf (\"Alignment\\r\\n\");\n\t}\n\telse if (status->LengthError)\n\t{\n\t\tprintf (\"Length\\r\\n\");\n\t}\n\telse if (status->SymbolError)\n\t{\n\t\tprintf (\"Symbol\\r\\n\");\n\t}\n\telse if (status->CRCError)\n\t{\n\t\tprintf (\"CRC\\r\\n\");\n\t}\n\telse if (status->Overrun)\n\t{\n\t\tprintf (\"Overrun\\r\\n\");\n\t}\n\telse\n\t{\n\t\tframeSize = status->RxSize + 1;\n\t\tassert (frameSize >= 64);\n\n\t\t\/\/ strip the CRC at the end\n\t\tframeSize -= 4;\n\n\t\tmemcpy (pPacket, EnetDmaRx[index].pBuffer, frameSize);\n\t}\n\n\tindex++;\n\tif (index == RX_BUFFER_COUNT)\n\t\tindex = 0;\n\tRXCONSUMEINDEX = index;\n\n\treturn frameSize;\n}\n\n\/\/ ============================================================================\n\nvoid tapdev_send (void* pPacket, unsigned int size)\n{\n\tassert ((size > 0) && (size <= MAX_FRAME_SIZE_IN_SOFTWARE));\n\n\tunsigned int nextProduceIndex;\n\n\tdo\n\t{\n\t\tnextProduceIndex = TXPRODUCEINDEX + 1;\n\t\tif (nextProduceIndex == TX_BUFFER_COUNT)\n\t\t\tnextProduceIndex = 0;\n\t} while (nextProduceIndex == TXCONSUMEINDEX);\n\n\tEnetDmaTxDesc_t* descriptor = &EnetDmaTx [TXPRODUCEINDEX];\n\n\tmemcpy (descriptor->pBuffer, pPacket, size);\n\tdescriptor->EnetTxCtrl.Data =\n\t\t  (size - 1)\n\t\t| (1U << 26) \/\/ Override\n\t\t| (0U << 27) \/\/ Huge\n\t\t| (1U << 28) \/\/ Pad\n\t\t| (1U << 29) \/\/ CRC\n\t\t| (1U << 30) \/\/ Last\n\t\t| (1U << 31);\/\/ Interrupt - needs to be set to avoid a hardware bug, see https:\/\/www.embeddedrelated.com\/showthread\/lpc2000\/49876-1.php\n\n\tTXPRODUCEINDEX = nextProduceIndex;\n}\n\n\/\/ ============================================================================\n\nvoid ENET_MIIWriteRegister (unsigned char DevId, unsigned char RegAddr, unsigned short Value)\n{\n\tMCMD = 0;                   \/\/ set read operation\n\tMADR_bit.PHY_ADDR = DevId;  \/\/ set the MII Physical address\n\tMADR_bit.REGADDR = RegAddr; \/\/ set the MII register address\n\tMWTD = Value;\n\twhile(MIND_bit.BUSY)\n\t\t;\n}\n\n\/\/ ============================================================================\n\n#define MIND_BUSY        (1u<<0)\n#define MIND_NOT_VALID   (1u<<2)\n\nunsigned short ENET_MIIReadRegister (unsigned char DevId, unsigned char RegAddr)\n{\n\tMCMD = 0;\n\tMADR_bit.PHY_ADDR = DevId;  \/\/ set the MII Physical address\n\tMADR_bit.REGADDR = RegAddr; \/\/ set the MII register address\n\tMCMD = 1;                   \/\/ set read operation\n\twhile(MIND &(MIND_BUSY | MIND_NOT_VALID))\n\t\t;\n\n\treturn (unsigned short) MRDD;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Copyright (C) 2008 by Mike Gist, Andrew Mann\n\n    This library is free software; you can redistribute it and\/or\n    modify it under the terms of the GNU Library General Public\n    License as published by the Free Software Foundation; either\n    version 2 of the License, or (at your option) any later version.\n\n    This library is distributed in the hope that it will be useful,\n    but WITHOUT ANY WARRANTY; without even the implied warranty of\n    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n    Library General Public License for more details.\n\n    You should have received a copy of the GNU Library General Public\n    License along with this library; if not, write to the Free\n    Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.\n*\/\n\n#include \"cssysdef.h\"\n\n#include \"speexstream.h\"\n\n\/* Keep these as integer values or the stream may feed portions of a sample to \n * the higher layer which may cause problems\n * 1 , 1 will decode 1\/1 or 1 second of audio in advance *\/\n#define SPEEX_BUFFER_LENGTH_MULTIPLIER  1\n#define SPEEX_BUFFER_LENGTH_DIVISOR     20\n\nSndSysSpeexSoundStream::SndSysSpeexSoundStream (csRef<SndSysSpeexSoundData> pData, \n                                                csSndSysSoundFormat *pRenderFormat, \n                                                int Mode3D) : \nSndSysBasicStream(pRenderFormat, Mode3D), m_pSoundData(pData)\n{\n  \/\/ Allocate an advance buffer\n  m_pCyclicBuffer = new SoundCyclicBuffer (\n    (m_RenderFormat.Bits\/8 * m_RenderFormat.Channels) * \n      (m_RenderFormat.Freq * SPEEX_BUFFER_LENGTH_MULTIPLIER \/ \n\tSPEEX_BUFFER_LENGTH_DIVISOR));\n  CS_ASSERT(m_pCyclicBuffer!=0);\n\n  \/\/ Initialize speex stream.\n  ResetPosition(false);\n}\n\nSndSysSpeexSoundStream::~SndSysSpeexSoundStream ()\n{\n  speex_header_free(header);\n  ogg_stream_clear(&os);\n}\n\nconst char *SndSysSpeexSoundStream::GetDescription()\n{\n  \/\/ Try to retrieve the description from the underlying data component.\n  const char *pDesc=m_pSoundData->GetDescription();\n\n  \/\/ If the data component has no description, return a default description.\n  if (!pDesc)\n    return \"Speex Stream\";\n  return pDesc;\n}\n\nsize_t SndSysSpeexSoundStream::GetFrameCount()\n{\n  const csSndSysSoundFormat *data_format=m_pSoundData->GetFormat();\n\n  uint64 framecount=m_pSoundData->GetFrameCount();\n  framecount*=m_RenderFormat.Freq;\n  framecount\/=data_format->Freq;\n\n  return framecount;\n}\n\nbool SndSysSpeexSoundStream::ResetPosition(bool clear)\n{\n  \/\/ Clear the stream if needed.\n  if(clear)\n  {\n    ogg_stream_clear(&os);\n  }\n\n  \/\/ Set up the sync state and buffers.\n  speex_bits_init(&bits);\n  ogg_sync_init(&oy);\n  oy.data = m_pSoundData->GetDataStore().data;\n  oy.storage = (int)m_pSoundData->GetDataStore().length;\n  ogg_sync_wrote(&oy, (long)m_pSoundData->GetDataStore().length);\n\n  \/\/ Reset flags and counters.\n  stream_init = false;\n  newPage = true;\n  packet_count = 0;\n\n  return true;\n}\n\nvoid SndSysSpeexSoundStream::AdvancePosition(size_t frame_delta)\n{\n  if (m_bPaused || m_bPlaybackReadComplete || frame_delta==0)\n    return;\n\n  \/\/ Figure out how many bytes we need to fill for this advancement\n  size_t needed_bytes = frame_delta * (m_RenderFormat.Bits\/8) * m_RenderFormat.Channels;\n\n  \/\/ If we need more space than is available in the whole cyclic buffer, then we already underbuffered, reduce to just 1 cycle full\n  if ((size_t)needed_bytes > m_pCyclicBuffer->GetLength())\n    needed_bytes=(size_t)(m_pCyclicBuffer->GetLength() & 0x7FFFFFFF);\n\n  \/\/ Free space in the cyclic buffer if necessary\n  if ((size_t)needed_bytes > m_pCyclicBuffer->GetFreeBytes())\n    m_pCyclicBuffer->AdvanceStartValue(needed_bytes - (size_t)(m_pCyclicBuffer->GetFreeBytes() & 0x7FFFFFFF));\n\n  \/\/ Fill in leftover decoded data if needed\n  if (m_PreparedDataBufferUsage > 0)\n    needed_bytes-=CopyBufferBytes(needed_bytes);\n\n  while (needed_bytes > 0)\n  {\n    if(newPage)\n    {\n      if(ogg_sync_pageout(&oy, &og) != 1)\n      {\n        \/\/ Mark as complete if not looping.\n        if (!m_bLooping)\n        {\n          m_bPlaybackReadComplete = true;\n        }\n\n        \/\/ Reset stream.\n        ResetPosition();\n\n        return;\n      }\n\n      if (!stream_init)\n      {\n        ogg_stream_init(&os, ogg_page_serialno(&og));\n        stream_init = true;\n      }\n\n      if (ogg_page_serialno(&og) != os.serialno)\n      {\n        ogg_stream_reset_serialno(&os, ogg_page_serialno(&og));\n      }\n\n      ogg_stream_pagein(&os, &og);\n      newPage = false;\n    }\n\n    if(ogg_stream_packetout(&os, &op) != 1)\n    {\n      newPage = true;\n      continue;\n    }\n\n    \/\/ First packets contain header data.\n    if(packet_count == 0)\n    {\n      if(header)\n      {\n        speex_header_free(header);\n      }\n\n      header = speex_packet_to_header((char*)op.packet, op.bytes);\n      \/\/ const_cast for version compatibility.\n      SpeexMode* mode = const_cast<SpeexMode*>(speex_lib_get_mode (header->mode));\n      state = speex_decoder_init(mode);\n      speex_decoder_ctl(state, SPEEX_SET_SAMPLING_RATE, &header->rate);\n\n      m_OutputFrequency=m_NewOutputFrequency;\n\n      \/\/ Create the pcm sample converter if it's not yet created\n      if (m_pPCMConverter == 0)\n        m_pPCMConverter = new PCMSampleConverter (\n        m_RenderFormat.Channels, m_RenderFormat.Bits,\n        m_RenderFormat.Freq);\n\n      \/\/ Calculate the size of one source sample\n      int source_sample_size = m_RenderFormat.Channels * m_RenderFormat.Bits;\n\n      \/\/ Calculate the needed buffer size for this conversion\n      int needed_buffer = (m_pPCMConverter->GetRequiredOutputBufferMultiple (\n        m_RenderFormat.Channels, m_RenderFormat.Bits, m_OutputFrequency) * \n        (4096 + source_sample_size))\/1024;\n\n      \/\/ Allocate a new buffer.\n      if (m_PreparedDataBufferSize < needed_buffer)\n      {\n        delete[] m_pPreparedDataBuffer;\n        m_pPreparedDataBuffer = new char[needed_buffer];\n        m_PreparedDataBufferSize=needed_buffer;\n      }\n    }\n\n    if(packet_count++ < uint(2+header->extra_headers))\n    {\n      continue;\n    }\n\n    \/\/ Read and decode.\n    speex_bits_read_from(&bits, (char*)op.packet, op.bytes);\n    speex_decode_int(state, &bits, (int16*)m_pPreparedDataBuffer);\n\n    \/\/ Frame size is in shorts.\n    speex_decoder_ctl(state, SPEEX_GET_FRAME_SIZE, &m_PreparedDataBufferUsage);\n    m_PreparedDataBufferUsage *= sizeof(short);\n\n    if (m_PreparedDataBufferUsage > 0)\n      needed_bytes -= CopyBufferBytes (needed_bytes);\n  }\n}\n\n<commit_msg>- Fixed uninit pointer.<commit_after>\/*\n    Copyright (C) 2008 by Mike Gist, Andrew Mann\n\n    This library is free software; you can redistribute it and\/or\n    modify it under the terms of the GNU Library General Public\n    License as published by the Free Software Foundation; either\n    version 2 of the License, or (at your option) any later version.\n\n    This library is distributed in the hope that it will be useful,\n    but WITHOUT ANY WARRANTY; without even the implied warranty of\n    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n    Library General Public License for more details.\n\n    You should have received a copy of the GNU Library General Public\n    License along with this library; if not, write to the Free\n    Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.\n*\/\n\n#include \"cssysdef.h\"\n\n#include \"speexstream.h\"\n\n\/* Keep these as integer values or the stream may feed portions of a sample to \n * the higher layer which may cause problems\n * 1 , 1 will decode 1\/1 or 1 second of audio in advance *\/\n#define SPEEX_BUFFER_LENGTH_MULTIPLIER  1\n#define SPEEX_BUFFER_LENGTH_DIVISOR     20\n\nSndSysSpeexSoundStream::SndSysSpeexSoundStream (csRef<SndSysSpeexSoundData> pData, \n                                                csSndSysSoundFormat *pRenderFormat, \n                                                int Mode3D) : \nSndSysBasicStream(pRenderFormat, Mode3D), m_pSoundData(pData), header(0)\n{\n  \/\/ Allocate an advance buffer\n  m_pCyclicBuffer = new SoundCyclicBuffer (\n    (m_RenderFormat.Bits\/8 * m_RenderFormat.Channels) * \n      (m_RenderFormat.Freq * SPEEX_BUFFER_LENGTH_MULTIPLIER \/ \n\tSPEEX_BUFFER_LENGTH_DIVISOR));\n  CS_ASSERT(m_pCyclicBuffer!=0);\n\n  \/\/ Initialize speex stream.\n  ResetPosition(false);\n}\n\nSndSysSpeexSoundStream::~SndSysSpeexSoundStream ()\n{\n  speex_header_free(header);\n  ogg_stream_clear(&os);\n}\n\nconst char *SndSysSpeexSoundStream::GetDescription()\n{\n  \/\/ Try to retrieve the description from the underlying data component.\n  const char *pDesc=m_pSoundData->GetDescription();\n\n  \/\/ If the data component has no description, return a default description.\n  if (!pDesc)\n    return \"Speex Stream\";\n  return pDesc;\n}\n\nsize_t SndSysSpeexSoundStream::GetFrameCount()\n{\n  const csSndSysSoundFormat *data_format=m_pSoundData->GetFormat();\n\n  uint64 framecount=m_pSoundData->GetFrameCount();\n  framecount*=m_RenderFormat.Freq;\n  framecount\/=data_format->Freq;\n\n  return framecount;\n}\n\nbool SndSysSpeexSoundStream::ResetPosition(bool clear)\n{\n  \/\/ Clear the stream if needed.\n  if(clear)\n  {\n    ogg_stream_clear(&os);\n  }\n\n  \/\/ Set up the sync state and buffers.\n  speex_bits_init(&bits);\n  ogg_sync_init(&oy);\n  oy.data = m_pSoundData->GetDataStore().data;\n  oy.storage = (int)m_pSoundData->GetDataStore().length;\n  ogg_sync_wrote(&oy, (long)m_pSoundData->GetDataStore().length);\n\n  \/\/ Reset flags and counters.\n  stream_init = false;\n  newPage = true;\n  packet_count = 0;\n\n  return true;\n}\n\nvoid SndSysSpeexSoundStream::AdvancePosition(size_t frame_delta)\n{\n  if (m_bPaused || m_bPlaybackReadComplete || frame_delta==0)\n    return;\n\n  \/\/ Figure out how many bytes we need to fill for this advancement\n  size_t needed_bytes = frame_delta * (m_RenderFormat.Bits\/8) * m_RenderFormat.Channels;\n\n  \/\/ If we need more space than is available in the whole cyclic buffer, then we already underbuffered, reduce to just 1 cycle full\n  if ((size_t)needed_bytes > m_pCyclicBuffer->GetLength())\n    needed_bytes=(size_t)(m_pCyclicBuffer->GetLength() & 0x7FFFFFFF);\n\n  \/\/ Free space in the cyclic buffer if necessary\n  if ((size_t)needed_bytes > m_pCyclicBuffer->GetFreeBytes())\n    m_pCyclicBuffer->AdvanceStartValue(needed_bytes - (size_t)(m_pCyclicBuffer->GetFreeBytes() & 0x7FFFFFFF));\n\n  \/\/ Fill in leftover decoded data if needed\n  if (m_PreparedDataBufferUsage > 0)\n    needed_bytes-=CopyBufferBytes(needed_bytes);\n\n  while (needed_bytes > 0)\n  {\n    if(newPage)\n    {\n      if(ogg_sync_pageout(&oy, &og) != 1)\n      {\n        \/\/ Mark as complete if not looping.\n        if (!m_bLooping)\n        {\n          m_bPlaybackReadComplete = true;\n        }\n\n        \/\/ Reset stream.\n        ResetPosition();\n\n        return;\n      }\n\n      if (!stream_init)\n      {\n        ogg_stream_init(&os, ogg_page_serialno(&og));\n        stream_init = true;\n      }\n\n      if (ogg_page_serialno(&og) != os.serialno)\n      {\n        ogg_stream_reset_serialno(&os, ogg_page_serialno(&og));\n      }\n\n      ogg_stream_pagein(&os, &og);\n      newPage = false;\n    }\n\n    if(ogg_stream_packetout(&os, &op) != 1)\n    {\n      newPage = true;\n      continue;\n    }\n\n    \/\/ First packets contain header data.\n    if(packet_count == 0)\n    {\n      if(header)\n      {\n        speex_header_free(header);\n      }\n\n      header = speex_packet_to_header((char*)op.packet, op.bytes);\n      \/\/ const_cast for version compatibility.\n      SpeexMode* mode = const_cast<SpeexMode*>(speex_lib_get_mode (header->mode));\n      state = speex_decoder_init(mode);\n      speex_decoder_ctl(state, SPEEX_SET_SAMPLING_RATE, &header->rate);\n\n      m_OutputFrequency=m_NewOutputFrequency;\n\n      \/\/ Create the pcm sample converter if it's not yet created\n      if (m_pPCMConverter == 0)\n        m_pPCMConverter = new PCMSampleConverter (\n        m_RenderFormat.Channels, m_RenderFormat.Bits,\n        m_RenderFormat.Freq);\n\n      \/\/ Calculate the size of one source sample\n      int source_sample_size = m_RenderFormat.Channels * m_RenderFormat.Bits;\n\n      \/\/ Calculate the needed buffer size for this conversion\n      int needed_buffer = (m_pPCMConverter->GetRequiredOutputBufferMultiple (\n        m_RenderFormat.Channels, m_RenderFormat.Bits, m_OutputFrequency) * \n        (4096 + source_sample_size))\/1024;\n\n      \/\/ Allocate a new buffer.\n      if (m_PreparedDataBufferSize < needed_buffer)\n      {\n        delete[] m_pPreparedDataBuffer;\n        m_pPreparedDataBuffer = new char[needed_buffer];\n        m_PreparedDataBufferSize=needed_buffer;\n      }\n    }\n\n    if(packet_count++ < uint(2+header->extra_headers))\n    {\n      continue;\n    }\n\n    \/\/ Read and decode.\n    speex_bits_read_from(&bits, (char*)op.packet, op.bytes);\n    speex_decode_int(state, &bits, (int16*)m_pPreparedDataBuffer);\n\n    \/\/ Frame size is in shorts.\n    speex_decoder_ctl(state, SPEEX_GET_FRAME_SIZE, &m_PreparedDataBufferUsage);\n    m_PreparedDataBufferUsage *= sizeof(short);\n\n    if (m_PreparedDataBufferUsage > 0)\n      needed_bytes -= CopyBufferBytes (needed_bytes);\n  }\n}\n\n<|endoftext|>"}
{"text":"<commit_before> \/*\n  *   jabberprotocol.cpp  -  Base class for the Kopete Jabber protocol\n  *\n  * Copyright (c) 2002-2003 by Till Gerken <till@tantalo.net>\n  * Copyright (c) 2002 by Daniel Stone <dstone@kde.org>\n  *\n  *  Kopete   (c) 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 <kdebug.h>\n#include <kgenericfactory.h>\n#include <kconfig.h>\n#include <kmessagebox.h>\n#include <kiconloader.h>\n#include <kpopupmenu.h>\n#include <kstandarddirs.h>\n#include <klineeditdlg.h>\n\n#include <qapplication.h>\n#include <qcursor.h>\n#include <qmap.h>\n#include <qtimer.h>\n#include <qpixmap.h>\n#include <qstringlist.h>\n\n#include \"im.h\"\n#include \"xmpp.h\"\n\n#include <sys\/utsname.h>\n\n#include \"kopetecontact.h\"\n#include \"kopetecontactlist.h\"\n#include \"kopetemetacontact.h\"\n#include \"kopetechatsession.h\"\n#include \"kopeteonlinestatusmanager.h\"\n#include \"kopeteaway.h\"\n#include \"kopeteglobal.h\"\n#include \"kopeteprotocol.h\"\n#include \"kopeteplugin.h\"\n#include \"addcontactpage.h\"\n#include \"jabbercontact.h\"\n#include \"dlgjabbersendraw.h\"\n#include \"dlgjabberservices.h\"\n#include \"dlgjabberchatjoin.h\"\n#include \"jabberaddcontactpage.h\"\n#include \"jabberprotocol.h\"\n#include \"jabberaccount.h\"\n#include \"kopeteaccountmanager.h\"\n#include \"jabbereditaccountwidget.h\"\n#include \"kopetecommandhandler.h\"\n\nJabberProtocol *JabberProtocol::protocolInstance = 0;\n\ntypedef KGenericFactory<JabberProtocol> JabberProtocolFactory;\n\nK_EXPORT_COMPONENT_FACTORY( kopete_jabber, JabberProtocolFactory( \"kopete_jabber\" )  )\n\nJabberProtocol::JabberProtocol (QObject * parent, const char *name, const QStringList &)\n: Kopete::Protocol( JabberProtocolFactory::instance(), parent, name ),\n\tJabberKOSChatty(Kopete::OnlineStatus::Online,        100, this, JabberFreeForChat, \"jabber_chatty\", i18n (\"Free for Chat\"), i18n (\"Free for Chat\"), Kopete::OnlineStatusManager::FreeForChat ),\n\tJabberKOSOnline(Kopete::OnlineStatus::Online,         90, this, JabberOnline, QString::null, i18n (\"Online\"), i18n (\"Online\"), Kopete::OnlineStatusManager::Online ),\n\tJabberKOSAway(Kopete::OnlineStatus::Away,             80, this, JabberAway, \"contact_away_overlay\", i18n (\"Away\"), i18n (\"Away\"), Kopete::OnlineStatusManager::Away, Kopete::OnlineStatusManager::HasAwayMessage),\n\tJabberKOSXA(Kopete::OnlineStatus::Away,               70, this, JabberXA, \"contact_xa_overlay\", i18n (\"Extended Away\"), i18n (\"Extended Away\"), 0, Kopete::OnlineStatusManager::HasAwayMessage),\n\tJabberKOSDND(Kopete::OnlineStatus::Away,              60, this, JabberDND, \"contact_busy_overlay\", i18n (\"Do not Disturb\"), i18n (\"Do not Disturb\"), Kopete::OnlineStatusManager::Busy, Kopete::OnlineStatusManager::HasAwayMessage),\n\tJabberKOSOffline(Kopete::OnlineStatus::Offline,       50, this, JabberOffline, QString::null, i18n (\"Offline\") ,i18n (\"Offline\"), Kopete::OnlineStatusManager::Offline ),\n\tJabberKOSInvisible(Kopete::OnlineStatus::Invisible,   40, this, JabberInvisible, \"contact_invisible_overlay\",   i18n (\"Invisible\") ,i18n (\"Invisible\"), Kopete::OnlineStatusManager::Invisible),\n\tJabberKOSConnecting(Kopete::OnlineStatus::Connecting, 30, this, JabberConnecting, \"jabber_connecting\",  i18n(\"Connecting\")),\n\tpropLastSeen(Kopete::Global::Properties::self()->lastSeen()),\n\tpropAwayMessage(Kopete::Global::Properties::self()->awayMessage()),\n\tpropFirstName(Kopete::Global::Properties::self()->firstName()),\n\tpropLastName(Kopete::Global::Properties::self()->lastName()),\n\tpropFullName(Kopete::Global::Properties::self()->fullName()),\n\tpropEmailAddress(Kopete::Global::Properties::self()->emailAddress()),\n\tpropPrivatePhone(Kopete::Global::Properties::self()->privatePhone()),\n\tpropPrivateMobilePhone(Kopete::Global::Properties::self()->privateMobilePhone()),\n\tpropWorkPhone(Kopete::Global::Properties::self()->workPhone()),\n\tpropWorkMobilePhone(Kopete::Global::Properties::self()->workMobilePhone()),\n\tpropNickName(Kopete::Global::Properties::self()->nickName()),\n\tpropSubscriptionStatus(\"jabberSubscriptionStatus\", i18n (\"Subscription\"), QString::null, true, false),\n\tpropAuthorizationStatus(\"jabberAuthorizationStatus\", i18n (\"Authorization Status\"), QString::null, true, false),\n\tpropAvailableResources(\"jabberAvailableResources\", i18n (\"Available Resources\"), \"jabber_chatty\", false, true),\n\tpropVCardCacheTimeStamp(\"jabberVCardCacheTimeStamp\", i18n (\"vCard Cache Timestamp\"), QString::null, true, false, true),\n\tpropJid(\"jabberVCardJid\", i18n(\"Jabber ID\"), QString::null, true, false),\n\tpropBirthday(\"jabberVCardBirthday\", i18n(\"Birthday\"), QString::null, true, false),\n\tpropTimezone(\"jabberVCardTimezone\", i18n(\"Timezone\"), QString::null, true, false),\n\tpropHomepage(\"jabberVCardHomepage\", i18n(\"Homepage\"), QString::null, true, false),\n\tpropCompanyName(\"jabberVCardCompanyName\", i18n(\"Company name\"), QString::null, true, false),\n\tpropCompanyDepartement(\"jabberVCardCompanyDepartement\", i18n(\"Company Departement\"), QString::null, true, false),\n\tpropCompanyPosition(\"jabberVCardCompanyPosition\", i18n(\"Company Position\"), QString::null, true, false),\n\tpropCompanyRole(\"jabberVCardCompanyRole\", i18n(\"Company Role\"), QString::null, true, false),\n\tpropWorkStreet(\"jabberVCardWorkStreet\", i18n(\"Work Street\"), QString::null, true, false),\n\tpropWorkExtAddr(\"jabberVCardWorkExtAddr\", i18n(\"Work Extra Address\"), QString::null, true, false),\n\tpropWorkPOBox(\"jabberVCardWorkPOBox\", i18n(\"Work PO Box\"), QString::null, true, false),\n\tpropWorkCity(\"jabberVCardWorkCity\", i18n(\"Work City\"), QString::null, true, false),\n\tpropWorkPostalCode(\"jabberVCardWorkPostalCode\", i18n(\"Work Postal Code\"), QString::null, true, false),\n\tpropWorkCountry(\"jabberVCardWorkCountry\", i18n(\"Work Country\"), QString::null, true, false),\n\tpropWorkEmailAddress(\"jabberVCardWorkEmailAddress\", i18n(\"Work Email Address\"), QString::null, true, false),\n\tpropHomeStreet(\"jabberVCardHomeStreet\", i18n(\"Home Street\"), QString::null, true, false),\n\tpropHomeExtAddr(\"jabberVCardHomeExt\", i18n(\"Home Extra Address\"), QString::null, true, false),\n\tpropHomePOBox(\"jabberVCardHomePOBox\", i18n(\"Home PO Box\"), QString::null, true, false),\n\tpropHomeCity(\"jabberVCardHomeCity\", i18n(\"Home City\"), QString::null, true, false),\n\tpropHomePostalCode(\"jabberVCardHomePostalCode\", i18n(\"Home Postal Code\"), QString::null, true, false),\n\tpropHomeCountry(\"jabberVCardHomeCountry\", i18n(\"Home Country\"), QString::null, true, false),\n\tpropPhoneFax(\"jabberVCardPhoneFax\", i18n(\"Fax\"), QString::null, true, false),\n\tpropAbout(\"jabberVCardAbout\", i18n(\"About\"), QString::null, true, false)\n\n{\n\n\tkdDebug (JABBER_DEBUG_GLOBAL) << \"[JabberProtocol] Loading ...\" << endl;\n\n\t\/* This is meant to be a singleton, so we will check if we have\n\t * been loaded before. *\/\n\tif (protocolInstance)\n\t{\n\t\tkdDebug (JABBER_DEBUG_GLOBAL) << \"[JabberProtocol] Warning: Protocol already \" << \"loaded, not initializing again.\" << endl;\n\t\treturn;\n\t}\n\n\tprotocolInstance = this;\n\n\taddAddressBookField (\"messaging\/xmpp\", Kopete::Plugin::MakeIndexField);\n}\n\nJabberProtocol::~JabberProtocol ()\n{\n\t\/\/disconnectAll();\n\n\t\/* make sure that the next attempt to load Jabber\n\t * re-initializes the protocol class. *\/\n\tprotocolInstance = 0L;\n}\n\n\n\nAddContactPage *JabberProtocol::createAddContactWidget (QWidget * parent, Kopete::Account * i)\n{\n\tkdDebug (JABBER_DEBUG_GLOBAL) << \"[Jabber Protocol] Create Add Contact  Widget\\n\" << endl;\n\treturn new JabberAddContactPage (i, parent);\n}\n\nKopeteEditAccountWidget *JabberProtocol::createEditAccountWidget (Kopete::Account * account, QWidget * parent)\n{\n\tkdDebug (JABBER_DEBUG_GLOBAL) << \"[Jabber Protocol] Edit Account Widget\\n\" << endl;\n\treturn new JabberEditAccountWidget (this, static_cast < JabberAccount * >(account), parent);\n}\n\nKopete::Account *JabberProtocol::createNewAccount (const QString & accountId)\n{\n\tkdDebug (JABBER_DEBUG_GLOBAL) << \"[Jabber Protocol] Create New Account. ID: \" << accountId << \"\\n\" << endl;\n\treturn new JabberAccount (this, accountId);\n}\n\nKopete::OnlineStatus JabberProtocol::resourceToKOS ( const XMPP::Resource &resource )\n{\n\n\t\/\/ update to offline by default\n\tKopete::OnlineStatus status = JabberKOSOffline;\n\n\tif ( !resource.status().isAvailable () )\n\t{\n\t\t\/\/ resource is offline\n\t\tstatus = JabberKOSOffline;\n\t}\n\telse\n\t{\n\t\tif (resource.status ().show ().isEmpty ())\n\t\t{\n\t\t\tif (resource.status ().isInvisible ())\n\t\t\t{\n\t\t\t\tstatus = JabberKOSInvisible;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tstatus = JabberKOSOnline;\n\t\t\t}\n\t\t}\n\t\telse\n\t\tif (resource.status ().show () == \"chat\")\n\t\t{\n\t\t\tstatus = JabberKOSChatty;\n\t\t}\n\t\telse if (resource.status ().show () == \"away\")\n\t\t{\n\t\t\tstatus = JabberKOSAway;\n\t\t}\n\t\telse if (resource.status ().show () == \"xa\")\n\t\t{\n\t\t\tstatus = JabberKOSXA;\n\t\t}\n\t\telse if (resource.status ().show () == \"dnd\")\n\t\t{\n\t\t\tstatus = JabberKOSDND;\n\t\t}\n\t\telse if (resource.status ().show () == \"connecting\")\n\t\t{\n\t\t\tstatus = JabberKOSConnecting;\n\t\t}\n\t}\n\n\treturn status;\n\n}\n\nJabberProtocol *JabberProtocol::protocol ()\n{\n\t\/\/ return current instance\n\treturn protocolInstance;\n}\n\nKopete::Contact *JabberProtocol::deserializeContact (Kopete::MetaContact * metaContact,\n\t\t\t\t\t\t\t\t\t\t const QMap < QString, QString > &serializedData, const QMap < QString, QString > & \/* addressBookData *\/ )\n{\n\/\/  kdDebug (JABBER_DEBUG_GLOBAL) << k_funcinfo << \"Deserializing data for metacontact \" << metaContact->displayName () << \"\\n\" << endl;\n\n\tQString contactId = serializedData[\"contactId\"];\n\tQString displayName = serializedData[\"displayName\"];\n\tQString accountId = serializedData[\"accountId\"];\n\n\tQDict < Kopete::Account > accounts = Kopete::AccountManager::self ()->accounts (this);\n\tKopete::Account *account = accounts[accountId];\n\n\tif (!account)\n\t{\n\t\tkdDebug(JABBER_DEBUG_GLOBAL) << k_funcinfo << \"WARNING: Account for contact does not exist, skipping.\" << endl;\n\t\treturn 0;\n\t}\n\n\tif (account)\n\t\taccount->addContact (contactId,  metaContact);\n\treturn account->contacts()[contactId];\n}\n\n#include \"jabberprotocol.moc\"\n<commit_msg>Let set a status message for the connected status<commit_after> \/*\n  *   jabberprotocol.cpp  -  Base class for the Kopete Jabber protocol\n  *\n  * Copyright (c) 2002-2003 by Till Gerken <till@tantalo.net>\n  * Copyright (c) 2002 by Daniel Stone <dstone@kde.org>\n  *\n  *  Kopete   (c) 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 <kdebug.h>\n#include <kgenericfactory.h>\n#include <kconfig.h>\n#include <kmessagebox.h>\n#include <kiconloader.h>\n#include <kpopupmenu.h>\n#include <kstandarddirs.h>\n#include <klineeditdlg.h>\n\n#include <qapplication.h>\n#include <qcursor.h>\n#include <qmap.h>\n#include <qtimer.h>\n#include <qpixmap.h>\n#include <qstringlist.h>\n\n#include \"im.h\"\n#include \"xmpp.h\"\n\n#include <sys\/utsname.h>\n\n#include \"kopetecontact.h\"\n#include \"kopetecontactlist.h\"\n#include \"kopetemetacontact.h\"\n#include \"kopetechatsession.h\"\n#include \"kopeteonlinestatusmanager.h\"\n#include \"kopeteaway.h\"\n#include \"kopeteglobal.h\"\n#include \"kopeteprotocol.h\"\n#include \"kopeteplugin.h\"\n#include \"addcontactpage.h\"\n#include \"jabbercontact.h\"\n#include \"dlgjabbersendraw.h\"\n#include \"dlgjabberservices.h\"\n#include \"dlgjabberchatjoin.h\"\n#include \"jabberaddcontactpage.h\"\n#include \"jabberprotocol.h\"\n#include \"jabberaccount.h\"\n#include \"kopeteaccountmanager.h\"\n#include \"jabbereditaccountwidget.h\"\n#include \"kopetecommandhandler.h\"\n\nJabberProtocol *JabberProtocol::protocolInstance = 0;\n\ntypedef KGenericFactory<JabberProtocol> JabberProtocolFactory;\n\nK_EXPORT_COMPONENT_FACTORY( kopete_jabber, JabberProtocolFactory( \"kopete_jabber\" )  )\n\nJabberProtocol::JabberProtocol (QObject * parent, const char *name, const QStringList &)\n: Kopete::Protocol( JabberProtocolFactory::instance(), parent, name ),\n\tJabberKOSChatty(Kopete::OnlineStatus::Online,        100, this, JabberFreeForChat, \"jabber_chatty\", i18n (\"Free for Chat\"), i18n (\"Free for Chat\"), Kopete::OnlineStatusManager::FreeForChat, Kopete::OnlineStatusManager::HasAwayMessage ),\n\tJabberKOSOnline(Kopete::OnlineStatus::Online,         90, this, JabberOnline, QString::null, i18n (\"Online\"), i18n (\"Online\"), Kopete::OnlineStatusManager::Online, Kopete::OnlineStatusManager::HasAwayMessage ),\n\tJabberKOSAway(Kopete::OnlineStatus::Away,             80, this, JabberAway, \"contact_away_overlay\", i18n (\"Away\"), i18n (\"Away\"), Kopete::OnlineStatusManager::Away, Kopete::OnlineStatusManager::HasAwayMessage),\n\tJabberKOSXA(Kopete::OnlineStatus::Away,               70, this, JabberXA, \"contact_xa_overlay\", i18n (\"Extended Away\"), i18n (\"Extended Away\"), 0, Kopete::OnlineStatusManager::HasAwayMessage),\n\tJabberKOSDND(Kopete::OnlineStatus::Away,              60, this, JabberDND, \"contact_busy_overlay\", i18n (\"Do not Disturb\"), i18n (\"Do not Disturb\"), Kopete::OnlineStatusManager::Busy, Kopete::OnlineStatusManager::HasAwayMessage),\n\tJabberKOSOffline(Kopete::OnlineStatus::Offline,       50, this, JabberOffline, QString::null, i18n (\"Offline\") ,i18n (\"Offline\"), Kopete::OnlineStatusManager::Offline ),\n\tJabberKOSInvisible(Kopete::OnlineStatus::Invisible,   40, this, JabberInvisible, \"contact_invisible_overlay\",   i18n (\"Invisible\") ,i18n (\"Invisible\"), Kopete::OnlineStatusManager::Invisible),\n\tJabberKOSConnecting(Kopete::OnlineStatus::Connecting, 30, this, JabberConnecting, \"jabber_connecting\",  i18n(\"Connecting\")),\n\tpropLastSeen(Kopete::Global::Properties::self()->lastSeen()),\n\tpropAwayMessage(Kopete::Global::Properties::self()->awayMessage()),\n\tpropFirstName(Kopete::Global::Properties::self()->firstName()),\n\tpropLastName(Kopete::Global::Properties::self()->lastName()),\n\tpropFullName(Kopete::Global::Properties::self()->fullName()),\n\tpropEmailAddress(Kopete::Global::Properties::self()->emailAddress()),\n\tpropPrivatePhone(Kopete::Global::Properties::self()->privatePhone()),\n\tpropPrivateMobilePhone(Kopete::Global::Properties::self()->privateMobilePhone()),\n\tpropWorkPhone(Kopete::Global::Properties::self()->workPhone()),\n\tpropWorkMobilePhone(Kopete::Global::Properties::self()->workMobilePhone()),\n\tpropNickName(Kopete::Global::Properties::self()->nickName()),\n\tpropSubscriptionStatus(\"jabberSubscriptionStatus\", i18n (\"Subscription\"), QString::null, true, false),\n\tpropAuthorizationStatus(\"jabberAuthorizationStatus\", i18n (\"Authorization Status\"), QString::null, true, false),\n\tpropAvailableResources(\"jabberAvailableResources\", i18n (\"Available Resources\"), \"jabber_chatty\", false, true),\n\tpropVCardCacheTimeStamp(\"jabberVCardCacheTimeStamp\", i18n (\"vCard Cache Timestamp\"), QString::null, true, false, true),\n\tpropJid(\"jabberVCardJid\", i18n(\"Jabber ID\"), QString::null, true, false),\n\tpropBirthday(\"jabberVCardBirthday\", i18n(\"Birthday\"), QString::null, true, false),\n\tpropTimezone(\"jabberVCardTimezone\", i18n(\"Timezone\"), QString::null, true, false),\n\tpropHomepage(\"jabberVCardHomepage\", i18n(\"Homepage\"), QString::null, true, false),\n\tpropCompanyName(\"jabberVCardCompanyName\", i18n(\"Company name\"), QString::null, true, false),\n\tpropCompanyDepartement(\"jabberVCardCompanyDepartement\", i18n(\"Company Departement\"), QString::null, true, false),\n\tpropCompanyPosition(\"jabberVCardCompanyPosition\", i18n(\"Company Position\"), QString::null, true, false),\n\tpropCompanyRole(\"jabberVCardCompanyRole\", i18n(\"Company Role\"), QString::null, true, false),\n\tpropWorkStreet(\"jabberVCardWorkStreet\", i18n(\"Work Street\"), QString::null, true, false),\n\tpropWorkExtAddr(\"jabberVCardWorkExtAddr\", i18n(\"Work Extra Address\"), QString::null, true, false),\n\tpropWorkPOBox(\"jabberVCardWorkPOBox\", i18n(\"Work PO Box\"), QString::null, true, false),\n\tpropWorkCity(\"jabberVCardWorkCity\", i18n(\"Work City\"), QString::null, true, false),\n\tpropWorkPostalCode(\"jabberVCardWorkPostalCode\", i18n(\"Work Postal Code\"), QString::null, true, false),\n\tpropWorkCountry(\"jabberVCardWorkCountry\", i18n(\"Work Country\"), QString::null, true, false),\n\tpropWorkEmailAddress(\"jabberVCardWorkEmailAddress\", i18n(\"Work Email Address\"), QString::null, true, false),\n\tpropHomeStreet(\"jabberVCardHomeStreet\", i18n(\"Home Street\"), QString::null, true, false),\n\tpropHomeExtAddr(\"jabberVCardHomeExt\", i18n(\"Home Extra Address\"), QString::null, true, false),\n\tpropHomePOBox(\"jabberVCardHomePOBox\", i18n(\"Home PO Box\"), QString::null, true, false),\n\tpropHomeCity(\"jabberVCardHomeCity\", i18n(\"Home City\"), QString::null, true, false),\n\tpropHomePostalCode(\"jabberVCardHomePostalCode\", i18n(\"Home Postal Code\"), QString::null, true, false),\n\tpropHomeCountry(\"jabberVCardHomeCountry\", i18n(\"Home Country\"), QString::null, true, false),\n\tpropPhoneFax(\"jabberVCardPhoneFax\", i18n(\"Fax\"), QString::null, true, false),\n\tpropAbout(\"jabberVCardAbout\", i18n(\"About\"), QString::null, true, false)\n\n{\n\n\tkdDebug (JABBER_DEBUG_GLOBAL) << \"[JabberProtocol] Loading ...\" << endl;\n\n\t\/* This is meant to be a singleton, so we will check if we have\n\t * been loaded before. *\/\n\tif (protocolInstance)\n\t{\n\t\tkdDebug (JABBER_DEBUG_GLOBAL) << \"[JabberProtocol] Warning: Protocol already \" << \"loaded, not initializing again.\" << endl;\n\t\treturn;\n\t}\n\n\tprotocolInstance = this;\n\n\taddAddressBookField (\"messaging\/xmpp\", Kopete::Plugin::MakeIndexField);\n}\n\nJabberProtocol::~JabberProtocol ()\n{\n\t\/\/disconnectAll();\n\n\t\/* make sure that the next attempt to load Jabber\n\t * re-initializes the protocol class. *\/\n\tprotocolInstance = 0L;\n}\n\n\n\nAddContactPage *JabberProtocol::createAddContactWidget (QWidget * parent, Kopete::Account * i)\n{\n\tkdDebug (JABBER_DEBUG_GLOBAL) << \"[Jabber Protocol] Create Add Contact  Widget\\n\" << endl;\n\treturn new JabberAddContactPage (i, parent);\n}\n\nKopeteEditAccountWidget *JabberProtocol::createEditAccountWidget (Kopete::Account * account, QWidget * parent)\n{\n\tkdDebug (JABBER_DEBUG_GLOBAL) << \"[Jabber Protocol] Edit Account Widget\\n\" << endl;\n\treturn new JabberEditAccountWidget (this, static_cast < JabberAccount * >(account), parent);\n}\n\nKopete::Account *JabberProtocol::createNewAccount (const QString & accountId)\n{\n\tkdDebug (JABBER_DEBUG_GLOBAL) << \"[Jabber Protocol] Create New Account. ID: \" << accountId << \"\\n\" << endl;\n\treturn new JabberAccount (this, accountId);\n}\n\nKopete::OnlineStatus JabberProtocol::resourceToKOS ( const XMPP::Resource &resource )\n{\n\n\t\/\/ update to offline by default\n\tKopete::OnlineStatus status = JabberKOSOffline;\n\n\tif ( !resource.status().isAvailable () )\n\t{\n\t\t\/\/ resource is offline\n\t\tstatus = JabberKOSOffline;\n\t}\n\telse\n\t{\n\t\tif (resource.status ().show ().isEmpty ())\n\t\t{\n\t\t\tif (resource.status ().isInvisible ())\n\t\t\t{\n\t\t\t\tstatus = JabberKOSInvisible;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tstatus = JabberKOSOnline;\n\t\t\t}\n\t\t}\n\t\telse\n\t\tif (resource.status ().show () == \"chat\")\n\t\t{\n\t\t\tstatus = JabberKOSChatty;\n\t\t}\n\t\telse if (resource.status ().show () == \"away\")\n\t\t{\n\t\t\tstatus = JabberKOSAway;\n\t\t}\n\t\telse if (resource.status ().show () == \"xa\")\n\t\t{\n\t\t\tstatus = JabberKOSXA;\n\t\t}\n\t\telse if (resource.status ().show () == \"dnd\")\n\t\t{\n\t\t\tstatus = JabberKOSDND;\n\t\t}\n\t\telse if (resource.status ().show () == \"connecting\")\n\t\t{\n\t\t\tstatus = JabberKOSConnecting;\n\t\t}\n\t}\n\n\treturn status;\n\n}\n\nJabberProtocol *JabberProtocol::protocol ()\n{\n\t\/\/ return current instance\n\treturn protocolInstance;\n}\n\nKopete::Contact *JabberProtocol::deserializeContact (Kopete::MetaContact * metaContact,\n\t\t\t\t\t\t\t\t\t\t const QMap < QString, QString > &serializedData, const QMap < QString, QString > & \/* addressBookData *\/ )\n{\n\/\/  kdDebug (JABBER_DEBUG_GLOBAL) << k_funcinfo << \"Deserializing data for metacontact \" << metaContact->displayName () << \"\\n\" << endl;\n\n\tQString contactId = serializedData[\"contactId\"];\n\tQString displayName = serializedData[\"displayName\"];\n\tQString accountId = serializedData[\"accountId\"];\n\n\tQDict < Kopete::Account > accounts = Kopete::AccountManager::self ()->accounts (this);\n\tKopete::Account *account = accounts[accountId];\n\n\tif (!account)\n\t{\n\t\tkdDebug(JABBER_DEBUG_GLOBAL) << k_funcinfo << \"WARNING: Account for contact does not exist, skipping.\" << endl;\n\t\treturn 0;\n\t}\n\n\tif (account)\n\t\taccount->addContact (contactId,  metaContact);\n\treturn account->contacts()[contactId];\n}\n\n#include \"jabberprotocol.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#include \"proton\/types.hpp\"\n#include <proton\/codec.h>\n#include <ostream>\n#include <algorithm>\n\nnamespace proton {\n\nnamespace {\ninline std::ostream& print_segment(std::ostream& o, const amqp_uuid& u, size_t begin, size_t end, const char* sep=\"\") {\n    for (const char* p = &u[begin]; p < &u[end]; ++p) o << *p;\n    return o << sep;\n}\n}\n\nstd::ostream& operator<<(std::ostream& o, const amqp_uuid& u) {\n    std::ios_base::fmtflags ff = o.flags();\n    o.flags(std::ios_base::hex);\n    print_segment(o, u, 0, 4, \"-\");\n    print_segment(o, u, 4, 6, \"-\");\n    print_segment(o, u, 6, 8, \"-\");\n    print_segment(o, u, 8, 10, \"-\");\n    print_segment(o, u, 10, 16);\n    o.flags(ff);\n    return o;\n}\n\nstd::string type_name(type_id t) {\n    switch (t) {\n      case NULL_: return \"null\";\n      case BOOLEAN: return \"boolean\";\n      case UBYTE: return \"ubyte\";\n      case BYTE: return \"byte\";\n      case USHORT: return \"ushort\";\n      case SHORT: return \"short\";\n      case UINT: return \"uint\";\n      case INT: return \"int\";\n      case CHAR: return \"char\";\n      case ULONG: return \"ulong\";\n      case LONG: return \"long\";\n      case TIMESTAMP: return \"timestamp\";\n      case FLOAT: return \"float\";\n      case DOUBLE: return \"double\";\n      case DECIMAL32: return \"decimal32\";\n      case DECIMAL64: return \"decimal64\";\n      case DECIMAL128: return \"decimal128\";\n      case UUID: return \"uuid\";\n      case BINARY: return \"binary\";\n      case STRING: return \"string\";\n      case SYMBOL: return \"symbol\";\n      case DESCRIBED: return \"described\";\n      case ARRAY: return \"array\";\n      case LIST: return \"list\";\n      case  MAP: return \"map\";\n      default: return \"unknown\";\n    }\n}\n\nstd::ostream& operator<<(std::ostream& o,type_id t) { return o << type_name(t); }\n\nPN_CPP_EXTERN bool is_container(type_id t) {\n    return (t == LIST || t == MAP || t == ARRAY || t == DESCRIBED);\n}\n\npn_bytes_t pn_bytes(const std::string& s) {\n    pn_bytes_t b = { s.size(), const_cast<char*>(&s[0]) };\n    return b;\n}\n\nstd::string str(const pn_bytes_t& b) { return std::string(b.start, b.size); }\n\nstart::start(type_id t, type_id e, bool d, size_t s) : type(t), element(e), is_described(d), size(s) {}\nstart start::array(type_id element, bool described) { return start(ARRAY, element, described); }\nstart start::list() { return start(LIST); }\nstart start::map() { return start(MAP); }\nstart start::described() { return start(DESCRIBED, NULL_, true); }\n\n}\n<commit_msg>NO-JIRA: cpp binding: Fix printing of UUID using operator<<()<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 \"proton\/types.hpp\"\n#include <proton\/codec.h>\n#include <ostream>\n#include <iomanip>\n#include <algorithm>\n\nnamespace proton {\n\nnamespace {\ninline std::ostream& print_segment(std::ostream& o, const amqp_uuid& u, size_t begin, size_t end, const char* sep=\"\") {\n    for (const char* p = &u[begin]; p < &u[end]; ++p) o << std::setw(2) << std::setfill('0') << ((int)*p & 0xff);\n    return o << sep;\n}\n}\n\nstd::ostream& operator<<(std::ostream& o, const amqp_uuid& u) {\n    std::ios_base::fmtflags ff = o.flags();\n    o.flags(std::ios_base::hex);\n    print_segment(o, u, 0, 4, \"-\");\n    print_segment(o, u, 4, 6, \"-\");\n    print_segment(o, u, 6, 8, \"-\");\n    print_segment(o, u, 8, 10, \"-\");\n    print_segment(o, u, 10, 16);\n    o.flags(ff);\n    return o;\n}\n\nstd::string type_name(type_id t) {\n    switch (t) {\n      case NULL_: return \"null\";\n      case BOOLEAN: return \"boolean\";\n      case UBYTE: return \"ubyte\";\n      case BYTE: return \"byte\";\n      case USHORT: return \"ushort\";\n      case SHORT: return \"short\";\n      case UINT: return \"uint\";\n      case INT: return \"int\";\n      case CHAR: return \"char\";\n      case ULONG: return \"ulong\";\n      case LONG: return \"long\";\n      case TIMESTAMP: return \"timestamp\";\n      case FLOAT: return \"float\";\n      case DOUBLE: return \"double\";\n      case DECIMAL32: return \"decimal32\";\n      case DECIMAL64: return \"decimal64\";\n      case DECIMAL128: return \"decimal128\";\n      case UUID: return \"uuid\";\n      case BINARY: return \"binary\";\n      case STRING: return \"string\";\n      case SYMBOL: return \"symbol\";\n      case DESCRIBED: return \"described\";\n      case ARRAY: return \"array\";\n      case LIST: return \"list\";\n      case  MAP: return \"map\";\n      default: return \"unknown\";\n    }\n}\n\nstd::ostream& operator<<(std::ostream& o,type_id t) { return o << type_name(t); }\n\nPN_CPP_EXTERN bool is_container(type_id t) {\n    return (t == LIST || t == MAP || t == ARRAY || t == DESCRIBED);\n}\n\npn_bytes_t pn_bytes(const std::string& s) {\n    pn_bytes_t b = { s.size(), const_cast<char*>(&s[0]) };\n    return b;\n}\n\nstd::string str(const pn_bytes_t& b) { return std::string(b.start, b.size); }\n\nstart::start(type_id t, type_id e, bool d, size_t s) : type(t), element(e), is_described(d), size(s) {}\nstart start::array(type_id element, bool described) { return start(ARRAY, element, described); }\nstart start::list() { return start(LIST); }\nstart start::map() { return start(MAP); }\nstart start::described() { return start(DESCRIBED, NULL_, true); }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (C) 2016 Elviss Strazdins\n\/\/ This file is part of the Ouzel engine.\n\n#include <cassert>\n#include <algorithm>\n#include \"Camera.h\"\n#include \"core\/Engine.h\"\n#include \"graphics\/Renderer.h\"\n#include \"Layer.h\"\n#include \"graphics\/Texture.h\"\n#include \"graphics\/RenderTarget.h\"\n#include \"math\/Matrix4.h\"\n#include \"utils\/Utils.h\"\n\nnamespace ouzel\n{\n    namespace scene\n    {\n        Camera::Camera()\n        {\n        }\n\n        Camera::~Camera()\n        {\n        }\n\n        void Camera::recalculateProjection()\n        {\n            Size2 renderTargetSize = renderTarget ?\n                renderTarget->getTexture()->getSize() :\n                sharedEngine->getRenderer()->getSize();\n\n            renderViewport.x = renderTargetSize.width * viewport.x;\n            renderViewport.y = renderTargetSize.height * viewport.y;\n            renderViewport.width = renderTargetSize.width * viewport.width;\n            renderViewport.height = renderTargetSize.height * viewport.height;\n\n            assert(renderViewport.width > 0.0f && renderViewport.height > 0.0f);\n\n            if (targetContentSize.width > 0.0f && targetContentSize.height > 0.0f)\n            {\n                contentScale.x = renderViewport.width \/ targetContentSize.width;\n                contentScale.y = renderViewport.height \/ targetContentSize.height;\n                \n                switch (scaleMode)\n                {\n                    case ScaleMode::NONE:\n                    {\n                        break;\n                    }\n                    case ScaleMode::EXACT_FIT:\n                    {\n                        contentScale.x = 1.0f;\n                        contentScale.y = 1.0f;\n                        break;\n                    }\n                    case ScaleMode::NO_BORDER:\n                    {\n                        contentScale.x = contentScale.y = std::max(contentScale.x, contentScale.y);\n                        break;\n                    }\n                    case ScaleMode::SHOW_ALL:\n                    {\n                        contentScale.x = contentScale.y = std::min(contentScale.x, contentScale.y);\n                        break;\n                    }\n                }\n\n                contentSize = Size2(renderViewport.width \/ contentScale.x, renderViewport.height \/ contentScale.y);\n                contentPosition = Vector2((contentSize.width - targetContentSize.width) \/ 2.0f,\n                                          (contentSize.height - targetContentSize.height) \/ 2.0f);\n            }\n            else\n            {\n                contentSize = Size2(renderViewport.width, renderViewport.height);\n                contentScale = Vector2(1.0f, 1.0f);\n            }\n\n            Matrix4::createOrthographic(renderViewport.width \/ contentScale.x, renderViewport.height \/ contentScale.y, -1.0f, 1.0f, projection);\n\n            inverseProjection = projection;\n            inverseProjection.invert();\n\n            viewProjectionDirty = true;\n        }\n\n        const Matrix4& Camera::getViewProjection() const\n        {\n            if (viewProjectionDirty || transformDirty)\n            {\n                viewProjection = projection * getTransform();\n            }\n\n            return viewProjection;\n        }\n\n        void Camera::calculateLocalTransform() const\n        {\n            Matrix4 translationMatrix = Matrix4::IDENTITY;\n            translationMatrix.translate(-position.x, -position.y, 0.0f);\n\n            Matrix4 rotationMatrix = Matrix4::IDENTITY;\n            rotationMatrix.rotate(Vector3(0.0f, 0.0f, -1.0f), -rotation);\n\n            Matrix4 scaleMatrix = Matrix4::IDENTITY;\n            Vector3 inverseScale(0.0f, 0.0f, 1.0f);\n            if (scale.x != 0.0f) inverseScale.x = 1.0f \/ scale.x;\n            if (scale.y != 0.0f) inverseScale.y = 1.0f \/ scale.y;\n            scaleMatrix.scale(inverseScale);\n\n            localTransform = scaleMatrix * rotationMatrix * translationMatrix;\n\n            localTransformDirty = false;\n        }\n\n        Vector2 Camera::convertNormalizedToWorld(const Vector2& position)\n        {\n            Matrix4 inverseViewMatrix = getViewProjection();\n            inverseViewMatrix.invert();\n\n            \/\/ convert window normalized to viewport clip position\n            Vector3 result = Vector3(((position.x - viewport.x) \/ viewport.width - 0.5f) * 2.0f,\n                                     ((position.y - viewport.y) \/ viewport.height - 0.5f) * 2.0f,\n                                     0.0f);\n\n            inverseViewMatrix.transformPoint(result);\n\n            return Vector2(result.x, result.y);\n        }\n\n        Vector2 Camera::convertWorldToNormalized(const Vector2& position)\n        {\n            Vector3 result = Vector3(position.x, position.y, 0.0f);\n            getViewProjection().transformPoint(result);\n\n            \/\/ convert viewport clip position to window normalized\n            return Vector2((result.x \/ 2.0f + 0.5f) * viewport.width + viewport.x,\n                           (result.y \/ 2.0f + 0.5f) * viewport.height + viewport.y);\n        }\n\n        bool Camera::checkVisibility(const Matrix4& boxTransform, const AABB2& boundingBox)\n        {\n            \/\/ transform center point to screen space\n            Vector2 diff = boundingBox.max - boundingBox.min;\n\n            Vector3 v3p(boundingBox.min.x + diff.x \/ 2.0f, boundingBox.min.y + diff.y \/ 2.0f, 0.0f);\n\n            boxTransform.transformPoint(v3p);\n\n            Vector4 clipPos;\n            getViewProjection().transformVector(Vector4(v3p.x, v3p.y, v3p.z, 1.0f), clipPos);\n\n            assert(clipPos.w != 0.0f);\n\n            Vector2 v2p((clipPos.x \/ clipPos.w + 1.0f) * 0.5f * renderViewport.width,\n                        (clipPos.y \/ clipPos.w + 1.0f) * 0.5f * renderViewport.height);\n\n            Size2 halfSize(diff.x \/ 2.0f, diff.y \/ 2.0f);\n\n            \/\/ convert content size to world coordinates\n            Size2 halfWorldSize;\n\n            halfWorldSize.width = std::max(fabsf(halfSize.width * boxTransform.m[0] + halfSize.height * boxTransform.m[4]),\n                                           fabsf(halfSize.width * boxTransform.m[0] - halfSize.height * boxTransform.m[4]));\n            halfWorldSize.height = std::max(fabsf(halfSize.width * boxTransform.m[1] + halfSize.height * boxTransform.m[5]),\n                                            fabsf(halfSize.width * boxTransform.m[1] - halfSize.height * boxTransform.m[5]));\n\n            \/\/ scale half size by camera scale\n            halfWorldSize.width *= transform.m[0] + fabsf(transform.m[4]);\n            halfWorldSize.height *= fabsf(transform.m[1]) + transform.m[5];\n\n            \/\/ enlarge visible rect half size in screen coord\n            Rectangle visibleRect(0.0f, 0.0f, renderViewport.width, renderViewport.height);\n\n            visibleRect.x -= halfWorldSize.width;\n            visibleRect.y -= halfWorldSize.height;\n            visibleRect.width += halfWorldSize.width * 2.0f;\n            visibleRect.height += halfWorldSize.height * 2.0f;\n            \n            return visibleRect.containsPoint(v2p);\n        }\n\n        void Camera::setViewport(const Rectangle& newViewport)\n        {\n            viewport = newViewport;\n            recalculateProjection();\n        }\n\n        void Camera::setScaleMode(ScaleMode newScaleMode)\n        {\n            scaleMode = newScaleMode;\n            recalculateProjection();\n        }\n\n        void Camera::setTargetContentSize(const Size2& newTargetContentSize)\n        {\n            targetContentSize = newTargetContentSize;\n            recalculateProjection();\n        }\n\n        void Camera::addToLayer(Layer* newLayer)\n        {\n            layer = newLayer;\n        }\n\n        void Camera::removeFromLayer()\n        {\n            layer = nullptr;\n        }\n\n        void Camera::setRenderTarget(const graphics::RenderTargetPtr& newRenderTarget)\n        {\n            renderTarget = newRenderTarget;\n\n            recalculateProjection();\n        }\n    } \/\/ namespace scene\n} \/\/ namespace ouzel\n<commit_msg>Use content size for ortho matrix calculation<commit_after>\/\/ Copyright (C) 2016 Elviss Strazdins\n\/\/ This file is part of the Ouzel engine.\n\n#include <cassert>\n#include <algorithm>\n#include \"Camera.h\"\n#include \"core\/Engine.h\"\n#include \"graphics\/Renderer.h\"\n#include \"Layer.h\"\n#include \"graphics\/Texture.h\"\n#include \"graphics\/RenderTarget.h\"\n#include \"math\/Matrix4.h\"\n#include \"utils\/Utils.h\"\n\nnamespace ouzel\n{\n    namespace scene\n    {\n        Camera::Camera()\n        {\n        }\n\n        Camera::~Camera()\n        {\n        }\n\n        void Camera::recalculateProjection()\n        {\n            Size2 renderTargetSize = renderTarget ?\n                renderTarget->getTexture()->getSize() :\n                sharedEngine->getRenderer()->getSize();\n\n            renderViewport.x = renderTargetSize.width * viewport.x;\n            renderViewport.y = renderTargetSize.height * viewport.y;\n            renderViewport.width = renderTargetSize.width * viewport.width;\n            renderViewport.height = renderTargetSize.height * viewport.height;\n\n            assert(renderViewport.width > 0.0f && renderViewport.height > 0.0f);\n\n            if (targetContentSize.width > 0.0f && targetContentSize.height > 0.0f)\n            {\n                contentScale.x = renderViewport.width \/ targetContentSize.width;\n                contentScale.y = renderViewport.height \/ targetContentSize.height;\n                \n                switch (scaleMode)\n                {\n                    case ScaleMode::NONE:\n                    {\n                        break;\n                    }\n                    case ScaleMode::EXACT_FIT:\n                    {\n                        contentScale.x = 1.0f;\n                        contentScale.y = 1.0f;\n                        break;\n                    }\n                    case ScaleMode::NO_BORDER:\n                    {\n                        contentScale.x = contentScale.y = std::max(contentScale.x, contentScale.y);\n                        break;\n                    }\n                    case ScaleMode::SHOW_ALL:\n                    {\n                        contentScale.x = contentScale.y = std::min(contentScale.x, contentScale.y);\n                        break;\n                    }\n                }\n\n                contentSize = Size2(renderViewport.width \/ contentScale.x, renderViewport.height \/ contentScale.y);\n                contentPosition = Vector2((contentSize.width - targetContentSize.width) \/ 2.0f,\n                                          (contentSize.height - targetContentSize.height) \/ 2.0f);\n            }\n            else\n            {\n                contentSize = Size2(renderViewport.width, renderViewport.height);\n                contentScale = Vector2(1.0f, 1.0f);\n            }\n\n            Matrix4::createOrthographic(contentSize.width, contentSize.height, -1.0f, 1.0f, projection);\n\n            inverseProjection = projection;\n            inverseProjection.invert();\n\n            viewProjectionDirty = true;\n        }\n\n        const Matrix4& Camera::getViewProjection() const\n        {\n            if (viewProjectionDirty || transformDirty)\n            {\n                viewProjection = projection * getTransform();\n            }\n\n            return viewProjection;\n        }\n\n        void Camera::calculateLocalTransform() const\n        {\n            Matrix4 translationMatrix = Matrix4::IDENTITY;\n            translationMatrix.translate(-position.x, -position.y, 0.0f);\n\n            Matrix4 rotationMatrix = Matrix4::IDENTITY;\n            rotationMatrix.rotate(Vector3(0.0f, 0.0f, -1.0f), -rotation);\n\n            Matrix4 scaleMatrix = Matrix4::IDENTITY;\n            Vector3 inverseScale(0.0f, 0.0f, 1.0f);\n            if (scale.x != 0.0f) inverseScale.x = 1.0f \/ scale.x;\n            if (scale.y != 0.0f) inverseScale.y = 1.0f \/ scale.y;\n            scaleMatrix.scale(inverseScale);\n\n            localTransform = scaleMatrix * rotationMatrix * translationMatrix;\n\n            localTransformDirty = false;\n        }\n\n        Vector2 Camera::convertNormalizedToWorld(const Vector2& position)\n        {\n            Matrix4 inverseViewMatrix = getViewProjection();\n            inverseViewMatrix.invert();\n\n            \/\/ convert window normalized to viewport clip position\n            Vector3 result = Vector3(((position.x - viewport.x) \/ viewport.width - 0.5f) * 2.0f,\n                                     ((position.y - viewport.y) \/ viewport.height - 0.5f) * 2.0f,\n                                     0.0f);\n\n            inverseViewMatrix.transformPoint(result);\n\n            return Vector2(result.x, result.y);\n        }\n\n        Vector2 Camera::convertWorldToNormalized(const Vector2& position)\n        {\n            Vector3 result = Vector3(position.x, position.y, 0.0f);\n            getViewProjection().transformPoint(result);\n\n            \/\/ convert viewport clip position to window normalized\n            return Vector2((result.x \/ 2.0f + 0.5f) * viewport.width + viewport.x,\n                           (result.y \/ 2.0f + 0.5f) * viewport.height + viewport.y);\n        }\n\n        bool Camera::checkVisibility(const Matrix4& boxTransform, const AABB2& boundingBox)\n        {\n            \/\/ transform center point to screen space\n            Vector2 diff = boundingBox.max - boundingBox.min;\n\n            Vector3 v3p(boundingBox.min.x + diff.x \/ 2.0f, boundingBox.min.y + diff.y \/ 2.0f, 0.0f);\n\n            boxTransform.transformPoint(v3p);\n\n            Vector4 clipPos;\n            getViewProjection().transformVector(Vector4(v3p.x, v3p.y, v3p.z, 1.0f), clipPos);\n\n            assert(clipPos.w != 0.0f);\n\n            Vector2 v2p((clipPos.x \/ clipPos.w + 1.0f) * 0.5f * renderViewport.width,\n                        (clipPos.y \/ clipPos.w + 1.0f) * 0.5f * renderViewport.height);\n\n            Size2 halfSize(diff.x \/ 2.0f, diff.y \/ 2.0f);\n\n            \/\/ convert content size to world coordinates\n            Size2 halfWorldSize;\n\n            halfWorldSize.width = std::max(fabsf(halfSize.width * boxTransform.m[0] + halfSize.height * boxTransform.m[4]),\n                                           fabsf(halfSize.width * boxTransform.m[0] - halfSize.height * boxTransform.m[4]));\n            halfWorldSize.height = std::max(fabsf(halfSize.width * boxTransform.m[1] + halfSize.height * boxTransform.m[5]),\n                                            fabsf(halfSize.width * boxTransform.m[1] - halfSize.height * boxTransform.m[5]));\n\n            \/\/ scale half size by camera scale\n            halfWorldSize.width *= transform.m[0] + fabsf(transform.m[4]);\n            halfWorldSize.height *= fabsf(transform.m[1]) + transform.m[5];\n\n            \/\/ enlarge visible rect half size in screen coord\n            Rectangle visibleRect(0.0f, 0.0f, renderViewport.width, renderViewport.height);\n\n            visibleRect.x -= halfWorldSize.width;\n            visibleRect.y -= halfWorldSize.height;\n            visibleRect.width += halfWorldSize.width * 2.0f;\n            visibleRect.height += halfWorldSize.height * 2.0f;\n            \n            return visibleRect.containsPoint(v2p);\n        }\n\n        void Camera::setViewport(const Rectangle& newViewport)\n        {\n            viewport = newViewport;\n            recalculateProjection();\n        }\n\n        void Camera::setScaleMode(ScaleMode newScaleMode)\n        {\n            scaleMode = newScaleMode;\n            recalculateProjection();\n        }\n\n        void Camera::setTargetContentSize(const Size2& newTargetContentSize)\n        {\n            targetContentSize = newTargetContentSize;\n            recalculateProjection();\n        }\n\n        void Camera::addToLayer(Layer* newLayer)\n        {\n            layer = newLayer;\n        }\n\n        void Camera::removeFromLayer()\n        {\n            layer = nullptr;\n        }\n\n        void Camera::setRenderTarget(const graphics::RenderTargetPtr& newRenderTarget)\n        {\n            renderTarget = newRenderTarget;\n\n            recalculateProjection();\n        }\n    } \/\/ namespace scene\n} \/\/ namespace ouzel\n<|endoftext|>"}
{"text":"<commit_before>#include \"pgsql-connection.h\"\n#include \"pgsql-result.h\"\n#include \"hphp\/runtime\/base\/array-iterator.h\"\n\nnamespace HPHP {\nnamespace Pgsql {\n\nPreparedParameters::PreparedParameters() {}\n\nPreparedParameters::PreparedParameters(PreparedParameters const & prepared)\n        : paramBuffer_(prepared.paramBuffer_), params_(prepared.params_.size()) {\n    for (unsigned i = 0; i < prepared.params_.size(); i++) {\n        auto ptr = prepared.params_[i];\n        if (ptr == nullptr) {\n            params_[i] = nullptr;\n        } else {\n            params_[i] = ptr - prepared.paramBuffer_.data() + paramBuffer_.data();\n        }\n    }\n}\n\nPreparedParameters::PreparedParameters(Array const & params)\n        : params_((ssize_t)params.size()) {\n    unsigned i = 0;\n    std::vector<ssize_t> positions((ssize_t)params.size());\n    for (ArrayIter param(params); param; ++param, ++i) {\n        if (param.second().isNull()) {\n            positions[i] = std::string::npos;\n        } else {\n            auto str = param.second().toString();\n            auto currentBufferPos = paramBuffer_.size();\n            std::copy(str.c_str(), str.c_str() + str.length() + 1, std::back_inserter(paramBuffer_));\n            positions[i] = currentBufferPos;\n        }\n    }\n\n    for (unsigned i = 0; i < positions.size(); i++) {\n        if (positions[i] == std::string::npos) {\n            params_[i] = nullptr;\n        } else {\n            params_[i] = paramBuffer_.data() + positions[i];\n        }\n    }\n}\n\n\nConnectionResource::ConnectionResource(Array params) {\n    beginConnection(params);\n}\n\nConnectionResource::~ConnectionResource() {\n    if (connection_ != nullptr) {\n        PQfinish(connection_);\n    }\n}\n\n\/**\n * Poll libpq so that it can proceed with the connection sequence.\n *\/\nConnectionResource::PollingStatus ConnectionResource::pollConnection() {\n    switch (PQconnectPoll(connection_)) {\n        case PGRES_POLLING_FAILED:  return PollingStatus::Failed;\n        case PGRES_POLLING_READING: return PollingStatus::Reading;\n        case PGRES_POLLING_WRITING: return PollingStatus::Writing;\n        case PGRES_POLLING_OK:      return PollingStatus::Ok;\n        default:\n            throw EnigmaException(\"Unknown value returned from PQconnectPoll()\");\n    }\n}\n\n\/**\n * Reset the communication channel to the server, in a nonblocking manner.\n *\/\nvoid ConnectionResource::resetStart() {\n    ENIG_DEBUG(\"PQresetStart()\");\n    if (PQresetStart(connection_) != 1) {\n        throw EnigmaException(std::string(\"Failed to reset connection: \") + errorMessage());\n    }\n}\n\n\/**\n * Poll libpq so that it can proceed with the reset sequence.\n *\/\nConnectionResource::PollingStatus ConnectionResource::pollReset() {\n    ENIG_DEBUG(\"PQresetPoll()\");\n    switch (PQresetPoll(connection_)) {\n        case PGRES_POLLING_FAILED:  return PollingStatus::Failed;\n        case PGRES_POLLING_READING: return PollingStatus::Reading;\n        case PGRES_POLLING_WRITING: return PollingStatus::Writing;\n        case PGRES_POLLING_OK:      return PollingStatus::Ok;\n        default:\n            throw EnigmaException(\"Unknown value returned from PQresetPoll()\");\n    }\n}\n\n\/**\n * Returns the status of the connection.\n *\/\nConnectionResource::Status ConnectionResource::status() const {\n    ENIG_DEBUG(\"PQstatus()\");\n    switch (PQstatus(connection_)) {\n        case CONNECTION_OK:  return Status::Ok;\n        case CONNECTION_BAD: return Status::Bad;\n            \/\/ The rest of the CONNECTION_ statuses are only used during asynchronous connection\n        default:\n            return Status::Pending;\n    }\n}\n\n\/**\n * Returns the current in-transaction status of the server.\n *\/\nConnectionResource::TransactionStatus ConnectionResource::transactionStatus() const {\n    ENIG_DEBUG(\"PQtransactionStatus()\");\n    switch (PQtransactionStatus(connection_)) {\n        case PQTRANS_IDLE:    return TransactionStatus::Idle;\n        case PQTRANS_ACTIVE:  return TransactionStatus::Active;\n        case PQTRANS_INTRANS: return TransactionStatus::InTransaction;\n        case PQTRANS_INERROR: return TransactionStatus::InError;\n        case PQTRANS_UNKNOWN: return TransactionStatus::Unknown;\n        default:\n            throw EnigmaException(\"Unknown value returned from PQtransactionStatus()\");\n    }\n}\n\nbool ConnectionResource::inTransaction() const {\n    auto state = transactionStatus();\n    return state == TransactionStatus::Active ||\n            state == TransactionStatus::InTransaction ||\n            state == TransactionStatus::InError;\n}\n\n\/**\n * Looks up a current parameter setting of the server.\n *\/\nVariant ConnectionResource::parameterStatus(String const & param) const {\n    auto value = PQparameterStatus(connection_, param.c_str());\n    if (value == nullptr) {\n        return Variant(Variant::NullInit{});\n    } else {\n        return String(value);\n    }\n}\n\n\/**\n * Returns the error message most recently generated by an operation on the connection.\n *\/\nstd::string ConnectionResource::errorMessage() const {\n    auto message = PQerrorMessage(connection_);\n    if (message == nullptr) {\n        return std::string();\n    } else {\n        return std::string(message);\n    }\n}\n\n\/**\n * Obtains the file descriptor number of the connection socket to the server.\n *\/\nint ConnectionResource::socket() const {\n    return PQsocket(connection_);\n}\n\n\/**\n * Returns the process ID (PID) of the backend process handling this connection.\n *\/\nint ConnectionResource::backendPid() const {\n    return PQbackendPID(connection_);\n}\n\n\/**\n * Submits a command to the server without waiting for the result(s).\n *\/\nvoid ConnectionResource::sendQuery(String const & command) {\n    ENIG_DEBUG(\"PQsendQuery()\");\n    if (PQsendQuery(connection_, command.c_str()) != 1) {\n        throw EnigmaException(std::string(\"Failed to send query: \") + errorMessage());\n    }\n}\n\n\/**\n * Submits a command and separate parameters to the server without waiting for the result(s).\n *\/\nvoid ConnectionResource::sendQueryParams(String const & command, PreparedParameters const & params, bool binary) {\n    ENIG_DEBUG(\"PQsendQueryParams()\");\n    if (PQsendQueryParams(connection_, command.c_str(), params.count(), nullptr, params.buffer(), nullptr, nullptr, binary ? 1 : 0) != 1) {\n        throw EnigmaException(std::string(\"Failed to send query: \") + errorMessage());\n    }\n}\n\n\/**\n * Sends a request to create a prepared statement with the given parameters, without waiting for completion.\n *\/\nvoid ConnectionResource::sendPrepare(String const & stmtName, String const & command, int numParams) {\n    ENIG_DEBUG(\"PQsendPrepare()\");\n    if (PQsendPrepare(connection_, stmtName.c_str(), command.c_str(), numParams, nullptr) != 1) {\n        throw EnigmaException(std::string(\"Failed to prepare statement: \") + errorMessage());\n    }\n}\n\n\/**\n * Sends a request to execute a prepared statement with given parameters, without waiting for the result(s).\n *\/\nvoid ConnectionResource::sendQueryPrepared(String const & stmtName, PreparedParameters const & params, bool binary) {\n    ENIG_DEBUG(\"PQsendQueryPrepared()\");\n    if (PQsendQueryPrepared(connection_, stmtName.c_str(), params.count(), params.buffer(), nullptr, nullptr, binary ? 1 : 0) != 1) {\n        throw EnigmaException(std::string(\"Failed to send prepared query: \") + errorMessage());\n    }\n}\n\n\/**\n * Submits a request to obtain information about the specified prepared statement, without waiting for completion.\n *\/\nvoid ConnectionResource::sendDescribePrepared(String const & stmtName) {\n    ENIG_DEBUG(\"PQsendDescribePrepared()\");\n    if (PQsendDescribePrepared(connection_, stmtName.c_str()) != 1) {\n        throw EnigmaException(std::string(\"Failed to describe prepared statement: \") + errorMessage());\n    }\n}\n\n\/**\n * Waits for the next result from a prior sendQuery, sendQueryParams, sendPrepare, or\n * sendQueryPrepared call, and returns it.\n * A null pointer is returned when the command is complete and there will be no more results.\n *\/\nstd::unique_ptr<ResultResource> ConnectionResource::getResult() {\n    ENIG_DEBUG(\"PQgetResult()\");\n    auto result = PQgetResult(connection_);\n    if (result == nullptr) {\n        return std::unique_ptr<ResultResource>();\n    } else {\n        \/*\n         * Only fetch one result when copying in\/out, as the fetch will block\n         * indefinitely until all rows are transferred using PQputCopy\/PQgetCopy.\n         *\/\n        auto status = PQresultStatus(result);\n\n        if (status != PGRES_COPY_IN &&\n            status != PGRES_COPY_OUT &&\n            status != PGRES_COPY_BOTH) {\n            \/*\n             * We don't support multiple result sets, so discard all\n             * subsequent PQresult-s\n             *\/\n            while (auto discarded = PQgetResult(connection_)) {\n                PQclear(discarded);\n            }\n        }\n\n        return std::unique_ptr<ResultResource>(\n                new ResultResource(result));\n    }\n}\n\n\/**\n * If input is available from the server, consume it.\n *\n * Returns false if a command is busy, that is, getResult() would block waiting for input\n *\/\nbool ConnectionResource::consumeInput() {\n    if (PQconsumeInput(connection_) != 1) {\n        throw EnigmaException(std::string(\"Failed to process server response: \") + errorMessage());\n    }\n\n    return PQisBusy(connection_) != 1;\n}\n\n\/**\n * Attempts to flush any queued output data to the server.\n *\n * Returns true if successful, or false if it was unable to send all the data in the send queue yet.\n *\/\nbool ConnectionResource::flush() {\n    ENIG_DEBUG(\"flush()\");\n    switch (PQflush(connection_)) {\n        case 0:\n            return true;\n        case 1:\n            return false;\n        default:\n            throw EnigmaException(std::string(\"Failed to flush connection: \") + errorMessage());\n    }\n}\n\nvoid ConnectionResource::cancel() {\n    char errbuf[256];\n    auto cancel = PQgetCancel(connection_);\n    ENIG_DEBUG(\"PQcancel()\");\n    bool canceled = PQcancel(cancel, errbuf, sizeof(errbuf)) == 1;\n    PQfreeCancel(cancel);\n    if (!canceled) {\n        throw EnigmaException(std::string(\"Failed to cancel query: \") + errbuf);\n    }\n}\n\n\/**\n * Convert an array to a list of raw (const char *) strings.\n * The string vectors must be preallocated to hold at least [values.length()] elements.\n *\/\nvoid ConnectionResource::arrayToStringList(Array const & values, req::vector<String> & strings,\n                                           req::vector<const char *> & ptrs, bool allowNulls) {\n    unsigned i = 0;\n    for (ArrayIter param(values); param; ++param, ++i) {\n        if (allowNulls && param.second().isNull()) {\n            ptrs[i] = nullptr;\n        } else {\n            strings[i] = param.second().toString();\n            ptrs[i] = strings[i].c_str();\n        }\n    }\n}\n\nvoid ConnectionResource::beginConnection(Array const & params) {\n    ssize_t n_params = params.length();\n    req::vector<String> keys(n_params), values(n_params);\n    req::vector<const char *> pg_keys(n_params + 1), pg_values(n_params + 1);\n\n    unsigned i = 0;\n    for (ArrayIter iter(params); iter; ++iter, ++i) {\n        keys[i] = iter.first().toString();\n        pg_keys[i] = keys[i].c_str();\n\n        values[i] = iter.second().toString();\n        pg_values[i] = values[i].c_str();\n    }\n\n    pg_keys[i] = nullptr;\n    pg_values[i] = nullptr;\n\n    ENIG_DEBUG(\"PQconnectStartParams()\");\n    connection_ = PQconnectStartParams(pg_keys.data(), pg_values.data(), 0);\n    if (connection_ == nullptr) {\n        throw EnigmaException(\"Failed to initialize pgsql connection\");\n    }\n\n    if (status() == Status::Bad) {\n        throw EnigmaException(std::string(\"Failed to initialize pgsql connection: \")\n                              + errorMessage());\n    }\n\n    if (PQsetnonblocking(connection_, 1) != 0) {\n        throw EnigmaException(\"Failed to set nonblocking mode on connection\");\n    }\n}\n\n} \/\/ namespace Pgsql\n} \/\/ namespace HPHP\n<commit_msg>Fix bogus transaction state for pending IN\/OUT COPY commands<commit_after>#include \"pgsql-connection.h\"\n#include \"pgsql-result.h\"\n#include \"hphp\/runtime\/base\/array-iterator.h\"\n\nnamespace HPHP {\nnamespace Pgsql {\n\nPreparedParameters::PreparedParameters() {}\n\nPreparedParameters::PreparedParameters(PreparedParameters const & prepared)\n        : paramBuffer_(prepared.paramBuffer_), params_(prepared.params_.size()) {\n    for (unsigned i = 0; i < prepared.params_.size(); i++) {\n        auto ptr = prepared.params_[i];\n        if (ptr == nullptr) {\n            params_[i] = nullptr;\n        } else {\n            params_[i] = ptr - prepared.paramBuffer_.data() + paramBuffer_.data();\n        }\n    }\n}\n\nPreparedParameters::PreparedParameters(Array const & params)\n        : params_((ssize_t)params.size()) {\n    unsigned i = 0;\n    std::vector<ssize_t> positions((ssize_t)params.size());\n    for (ArrayIter param(params); param; ++param, ++i) {\n        if (param.second().isNull()) {\n            positions[i] = std::string::npos;\n        } else {\n            auto str = param.second().toString();\n            auto currentBufferPos = paramBuffer_.size();\n            std::copy(str.c_str(), str.c_str() + str.length() + 1, std::back_inserter(paramBuffer_));\n            positions[i] = currentBufferPos;\n        }\n    }\n\n    for (unsigned i = 0; i < positions.size(); i++) {\n        if (positions[i] == std::string::npos) {\n            params_[i] = nullptr;\n        } else {\n            params_[i] = paramBuffer_.data() + positions[i];\n        }\n    }\n}\n\n\nConnectionResource::ConnectionResource(Array params) {\n    beginConnection(params);\n}\n\nConnectionResource::~ConnectionResource() {\n    if (connection_ != nullptr) {\n        PQfinish(connection_);\n    }\n}\n\n\/**\n * Poll libpq so that it can proceed with the connection sequence.\n *\/\nConnectionResource::PollingStatus ConnectionResource::pollConnection() {\n    switch (PQconnectPoll(connection_)) {\n        case PGRES_POLLING_FAILED:  return PollingStatus::Failed;\n        case PGRES_POLLING_READING: return PollingStatus::Reading;\n        case PGRES_POLLING_WRITING: return PollingStatus::Writing;\n        case PGRES_POLLING_OK:      return PollingStatus::Ok;\n        default:\n            throw EnigmaException(\"Unknown value returned from PQconnectPoll()\");\n    }\n}\n\n\/**\n * Reset the communication channel to the server, in a nonblocking manner.\n *\/\nvoid ConnectionResource::resetStart() {\n    ENIG_DEBUG(\"PQresetStart()\");\n    if (PQresetStart(connection_) != 1) {\n        throw EnigmaException(std::string(\"Failed to reset connection: \") + errorMessage());\n    }\n}\n\n\/**\n * Poll libpq so that it can proceed with the reset sequence.\n *\/\nConnectionResource::PollingStatus ConnectionResource::pollReset() {\n    ENIG_DEBUG(\"PQresetPoll()\");\n    switch (PQresetPoll(connection_)) {\n        case PGRES_POLLING_FAILED:  return PollingStatus::Failed;\n        case PGRES_POLLING_READING: return PollingStatus::Reading;\n        case PGRES_POLLING_WRITING: return PollingStatus::Writing;\n        case PGRES_POLLING_OK:      return PollingStatus::Ok;\n        default:\n            throw EnigmaException(\"Unknown value returned from PQresetPoll()\");\n    }\n}\n\n\/**\n * Returns the status of the connection.\n *\/\nConnectionResource::Status ConnectionResource::status() const {\n    ENIG_DEBUG(\"PQstatus()\");\n    switch (PQstatus(connection_)) {\n        case CONNECTION_OK:  return Status::Ok;\n        case CONNECTION_BAD: return Status::Bad;\n            \/\/ The rest of the CONNECTION_ statuses are only used during asynchronous connection\n        default:\n            return Status::Pending;\n    }\n}\n\n\/**\n * Returns the current in-transaction status of the server.\n *\/\nConnectionResource::TransactionStatus ConnectionResource::transactionStatus() const {\n    ENIG_DEBUG(\"PQtransactionStatus()\");\n    switch (PQtransactionStatus(connection_)) {\n        case PQTRANS_IDLE:    return TransactionStatus::Idle;\n        case PQTRANS_ACTIVE:  return TransactionStatus::Active;\n        case PQTRANS_INTRANS: return TransactionStatus::InTransaction;\n        case PQTRANS_INERROR: return TransactionStatus::InError;\n        case PQTRANS_UNKNOWN: return TransactionStatus::Unknown;\n        default:\n            throw EnigmaException(\"Unknown value returned from PQtransactionStatus()\");\n    }\n}\n\nbool ConnectionResource::inTransaction() const {\n    auto state = transactionStatus();\n    return state == TransactionStatus::InTransaction ||\n            state == TransactionStatus::InError;\n}\n\n\/**\n * Looks up a current parameter setting of the server.\n *\/\nVariant ConnectionResource::parameterStatus(String const & param) const {\n    auto value = PQparameterStatus(connection_, param.c_str());\n    if (value == nullptr) {\n        return Variant(Variant::NullInit{});\n    } else {\n        return String(value);\n    }\n}\n\n\/**\n * Returns the error message most recently generated by an operation on the connection.\n *\/\nstd::string ConnectionResource::errorMessage() const {\n    auto message = PQerrorMessage(connection_);\n    if (message == nullptr) {\n        return std::string();\n    } else {\n        return std::string(message);\n    }\n}\n\n\/**\n * Obtains the file descriptor number of the connection socket to the server.\n *\/\nint ConnectionResource::socket() const {\n    return PQsocket(connection_);\n}\n\n\/**\n * Returns the process ID (PID) of the backend process handling this connection.\n *\/\nint ConnectionResource::backendPid() const {\n    return PQbackendPID(connection_);\n}\n\n\/**\n * Submits a command to the server without waiting for the result(s).\n *\/\nvoid ConnectionResource::sendQuery(String const & command) {\n    ENIG_DEBUG(\"PQsendQuery()\");\n    if (PQsendQuery(connection_, command.c_str()) != 1) {\n        throw EnigmaException(std::string(\"Failed to send query: \") + errorMessage());\n    }\n}\n\n\/**\n * Submits a command and separate parameters to the server without waiting for the result(s).\n *\/\nvoid ConnectionResource::sendQueryParams(String const & command, PreparedParameters const & params, bool binary) {\n    ENIG_DEBUG(\"PQsendQueryParams()\");\n    if (PQsendQueryParams(connection_, command.c_str(), params.count(), nullptr, params.buffer(), nullptr, nullptr, binary ? 1 : 0) != 1) {\n        throw EnigmaException(std::string(\"Failed to send query: \") + errorMessage());\n    }\n}\n\n\/**\n * Sends a request to create a prepared statement with the given parameters, without waiting for completion.\n *\/\nvoid ConnectionResource::sendPrepare(String const & stmtName, String const & command, int numParams) {\n    ENIG_DEBUG(\"PQsendPrepare()\");\n    if (PQsendPrepare(connection_, stmtName.c_str(), command.c_str(), numParams, nullptr) != 1) {\n        throw EnigmaException(std::string(\"Failed to prepare statement: \") + errorMessage());\n    }\n}\n\n\/**\n * Sends a request to execute a prepared statement with given parameters, without waiting for the result(s).\n *\/\nvoid ConnectionResource::sendQueryPrepared(String const & stmtName, PreparedParameters const & params, bool binary) {\n    ENIG_DEBUG(\"PQsendQueryPrepared()\");\n    if (PQsendQueryPrepared(connection_, stmtName.c_str(), params.count(), params.buffer(), nullptr, nullptr, binary ? 1 : 0) != 1) {\n        throw EnigmaException(std::string(\"Failed to send prepared query: \") + errorMessage());\n    }\n}\n\n\/**\n * Submits a request to obtain information about the specified prepared statement, without waiting for completion.\n *\/\nvoid ConnectionResource::sendDescribePrepared(String const & stmtName) {\n    ENIG_DEBUG(\"PQsendDescribePrepared()\");\n    if (PQsendDescribePrepared(connection_, stmtName.c_str()) != 1) {\n        throw EnigmaException(std::string(\"Failed to describe prepared statement: \") + errorMessage());\n    }\n}\n\n\/**\n * Waits for the next result from a prior sendQuery, sendQueryParams, sendPrepare, or\n * sendQueryPrepared call, and returns it.\n * A null pointer is returned when the command is complete and there will be no more results.\n *\/\nstd::unique_ptr<ResultResource> ConnectionResource::getResult() {\n    ENIG_DEBUG(\"PQgetResult()\");\n    auto result = PQgetResult(connection_);\n    if (result == nullptr) {\n        return std::unique_ptr<ResultResource>();\n    } else {\n        \/*\n         * Only fetch one result when copying in\/out, as the fetch will block\n         * indefinitely until all rows are transferred using PQputCopy\/PQgetCopy.\n         *\/\n        auto status = PQresultStatus(result);\n\n        if (status != PGRES_COPY_IN &&\n            status != PGRES_COPY_OUT &&\n            status != PGRES_COPY_BOTH) {\n            \/*\n             * We don't support multiple result sets, so discard all\n             * subsequent PQresult-s\n             *\/\n            while (auto discarded = PQgetResult(connection_)) {\n                PQclear(discarded);\n            }\n        }\n\n        return std::unique_ptr<ResultResource>(\n                new ResultResource(result));\n    }\n}\n\n\/**\n * If input is available from the server, consume it.\n *\n * Returns false if a command is busy, that is, getResult() would block waiting for input\n *\/\nbool ConnectionResource::consumeInput() {\n    if (PQconsumeInput(connection_) != 1) {\n        throw EnigmaException(std::string(\"Failed to process server response: \") + errorMessage());\n    }\n\n    return PQisBusy(connection_) != 1;\n}\n\n\/**\n * Attempts to flush any queued output data to the server.\n *\n * Returns true if successful, or false if it was unable to send all the data in the send queue yet.\n *\/\nbool ConnectionResource::flush() {\n    ENIG_DEBUG(\"flush()\");\n    switch (PQflush(connection_)) {\n        case 0:\n            return true;\n        case 1:\n            return false;\n        default:\n            throw EnigmaException(std::string(\"Failed to flush connection: \") + errorMessage());\n    }\n}\n\nvoid ConnectionResource::cancel() {\n    char errbuf[256];\n    auto cancel = PQgetCancel(connection_);\n    ENIG_DEBUG(\"PQcancel()\");\n    bool canceled = PQcancel(cancel, errbuf, sizeof(errbuf)) == 1;\n    PQfreeCancel(cancel);\n    if (!canceled) {\n        throw EnigmaException(std::string(\"Failed to cancel query: \") + errbuf);\n    }\n}\n\n\/**\n * Convert an array to a list of raw (const char *) strings.\n * The string vectors must be preallocated to hold at least [values.length()] elements.\n *\/\nvoid ConnectionResource::arrayToStringList(Array const & values, req::vector<String> & strings,\n                                           req::vector<const char *> & ptrs, bool allowNulls) {\n    unsigned i = 0;\n    for (ArrayIter param(values); param; ++param, ++i) {\n        if (allowNulls && param.second().isNull()) {\n            ptrs[i] = nullptr;\n        } else {\n            strings[i] = param.second().toString();\n            ptrs[i] = strings[i].c_str();\n        }\n    }\n}\n\nvoid ConnectionResource::beginConnection(Array const & params) {\n    ssize_t n_params = params.length();\n    req::vector<String> keys(n_params), values(n_params);\n    req::vector<const char *> pg_keys(n_params + 1), pg_values(n_params + 1);\n\n    unsigned i = 0;\n    for (ArrayIter iter(params); iter; ++iter, ++i) {\n        keys[i] = iter.first().toString();\n        pg_keys[i] = keys[i].c_str();\n\n        values[i] = iter.second().toString();\n        pg_values[i] = values[i].c_str();\n    }\n\n    pg_keys[i] = nullptr;\n    pg_values[i] = nullptr;\n\n    ENIG_DEBUG(\"PQconnectStartParams()\");\n    connection_ = PQconnectStartParams(pg_keys.data(), pg_values.data(), 0);\n    if (connection_ == nullptr) {\n        throw EnigmaException(\"Failed to initialize pgsql connection\");\n    }\n\n    if (status() == Status::Bad) {\n        throw EnigmaException(std::string(\"Failed to initialize pgsql connection: \")\n                              + errorMessage());\n    }\n\n    if (PQsetnonblocking(connection_, 1) != 0) {\n        throw EnigmaException(\"Failed to set nonblocking mode on connection\");\n    }\n}\n\n} \/\/ namespace Pgsql\n} \/\/ namespace HPHP\n<|endoftext|>"}
{"text":"<commit_before>#include \"HelloWorldScene.h\"\n#include <iostream>\n#include \"cocos-ext.h\"\n\nusing namespace std;\nUSING_NS_CC;\nUSING_NS_CC_EXT;\n\nCCScene* HelloWorld::scene()\n{\n    \/\/ 'scene' is an autorelease object\n    CCScene *scene = CCScene::create();\n    \n    \/\/ 'layer' is an autorelease object\n    HelloWorld *layer = HelloWorld::create();\n\n    \/\/ add layer as a child to scene\n    scene->addChild(layer);\n\n    \/\/ return the scene\n    return scene;\n}\n\n\/\/ on \"init\" you need to initialize your instance\nbool HelloWorld::init()\n{\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ 1. super init first\n    if ( !CCLayer::init() )\n    {\n        return false;\n    }\n    \n    CCSize visibleSize = CCDirector::sharedDirector()->getVisibleSize();\n    CCPoint origin = CCDirector::sharedDirector()->getVisibleOrigin();\n\tCCDirector::sharedDirector()->getTouchDispatcher()->addTargetedDelegate(this,0,true);\n\t\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ 2. add a menu item with \"X\" image, which is clicked to quit the program\n    \/\/    you may modify it.\n\n    \/\/ add a \"close\" icon to exit the progress. it's an autorelease object\n    CCMenuItemImage *pCloseItem = CCMenuItemImage::create(\n                                        \"CloseNormal.png\",\n                                        \"CloseSelected.png\",\n                                        this,\n                                        menu_selector(HelloWorld::menuCloseCallback));\n    \n\tpCloseItem->setPosition(ccp(origin.x + visibleSize.width - pCloseItem->getContentSize().width\/2 ,\n                                origin.y + pCloseItem->getContentSize().height\/2));\n\n    \/\/ create menu, it's an autorelease object\n    CCMenu* pMenu = CCMenu::create(pCloseItem, NULL);\n    pMenu->setPosition(CCPointZero);\n    this->addChild(pMenu, 1);\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ 3. add your codes below...\n\n    \/\/ add a label shows \"Hello World\"\n    \/\/ create and initialize a label\n    \n    CCLabelTTF* pLabel = CCLabelTTF::create(\"Hello COCOS\", \"Arial\", 24);\n    \n    \/\/ position the label on the center of the screen\n    pLabel->setPosition(ccp(origin.x + visibleSize.width\/2,\n                            origin.y + visibleSize.height - pLabel->getContentSize().height));\n\n    \/\/ add the label as a child to this layer\n    this->addChild(pLabel, 1);\n    times = 0;\n\tCCScheduler *scheduler = CCDirector::sharedDirector()->getScheduler();\n\tsprite = CCSprite::create(\"bl_24.png\");\n\tsprite->setPosition(ccp(50.0f,50.0f));\n\tthis->addChild(sprite, 0);\n\tbg = CCSprite::create(\"bg.jpg\");\n\tthis->addChild(bg);\n\tscheduler->scheduleSelector(SEL_SCHEDULE(&HelloWorld::updateByFrame),this,0,false);\n\n\t\n\t\/\/ʹplistΪ\n\tCCTexture2D::PVRImagesHavePremultipliedAlpha(true);\n\tCCSpriteFrameCache::sharedSpriteFrameCache()->addSpriteFramesWithFile(\"feiyunan.plist\");\n\tCCSpriteFrameCache::sharedSpriteFrameCache()->addSpriteFramesWithFile(\"huangfeihu.plist\");\n\n\tplayer = CCSprite::create(\"feiyunan.png\");\n\thfh = CCSprite::create(\"huangfeihu.png\");\n\tplayer->setPosition(ccp(300.0f,400.0f));\n\thfh->setPosition(ccp(100,100));\n\tthis->addChild(player);\n\tthis->addChild(hfh);\n\n\tCCArray* animFrames = CCArray::createWithCapacity(15);\n\tCCArray* hfhFrames = CCArray::createWithCapacity(24);\n\tchar str[100] = {0};\n\tfor(int i=0; i<24; i++)\n\t{\n\t\tsprintf(str,\"feiyu%d.png\",i);\n\t\tCCSpriteFrame* frame = CCSpriteFrameCache::sharedSpriteFrameCache()->spriteFrameByName(str);\n\t\tif( frame != NULL )\n\t\t\tanimFrames->addObject( frame );\n\n\t\tsprintf(str,\"huangfeihu%d.png\",i);\n\t\tframe = CCSpriteFrameCache::sharedSpriteFrameCache()->spriteFrameByName(str);\n\t\tif( frame != NULL )\n\t\t\thfhFrames->addObject( frame );\n\t}\n\t\t\n\tCCAnimation *animation = CCAnimation::createWithSpriteFrames( animFrames,0.1f );\n\tCCAnimation *hfhAnimation = CCAnimation::createWithSpriteFrames( hfhFrames,0.05f );\n\thfhAnimation->setLoops(-1);\n\tanimation->setLoops(-1);\n\tplayer->runAction(CCAnimate::create(animation));\n\thfh->runAction(CCAnimate::create(hfhAnimation));\n\tCCArmatureDataManager::sharedArmatureDataManager()->addArmatureFileInfo(\"dragonbones\/DragonBones_tutorial_Start.png\",\"dragonbones\/DragonBones_tutorial_Start.plist\",\"dragonbones\/DragonBones_tutorial_Start.xml\");\n\tCCArmature *armature = CCArmature::create(\"Dragon\");\n\tarmature->getAnimation()->playByIndex(0);\n\tarmature->getAnimation()->setSpeedScale(1);\n\tarmature->setScaleX(-0.5f);\n\tarmature->setScaleY(0.5f);\n\tarmature->setPosition(ccp(visibleSize.width\/2,visibleSize.height\/2));\n\taddChild(armature);\n    return true;\n}\n\nvoid HelloWorld::updateByFrame(float value)\n{\n\tfloat curPos = hfh->getPositionX();\n\tprintf(\"x====>\",curPos);\n\tif(targetPos.x > curPos)\n\t{\n\t\thfh->setPositionX(curPos+10);\n\t}else\n\t{\n\t\thfh->setPositionX(curPos-10);\n\t}\n\tcurPos = hfh->getPositionY();\n\tprintf(\"y====>\",curPos);\n\tif(targetPos.y > curPos)\n\t{\n\t\thfh->setPositionX(curPos+10);\n\t}else\n\t{\n\t\thfh->setPositionX(curPos-10);\n\t}\n}\n\nbool HelloWorld::ccTouchBegan(CCTouch *pTouch, CCEvent *pEvent)\n{\n\tCCPoint tPoint = CCPoint(pTouch->getLocation());\n\tif( tPoint.x > hfh->getPosition().x )\n\t{\n\t\thfh->setScaleX(1);\n\t}else\n\t{\n\t\thfh->setScaleX(-1);\n\t}\n\ttargetPos = tPoint;\n\treturn false;\n}\n\nvoid HelloWorld::menuCloseCallback(CCObject* pSender)\n{\n#if (CC_TARGET_PLATFORM == CC_PLATFORM_WINRT) || (CC_TARGET_PLATFORM == CC_PLATFORM_WP8)\n\tCCMessageBox(\"You pressed the close button. Windows Store Apps do not implement a close button.\",\"Alert\");\n#else\n    CCDirector::sharedDirector()->end();\n#if (CC_TARGET_PLATFORM == CC_PLATFORM_IOS)\n    exit(0);\n#endif\n#endif\n}\n<commit_msg>MoveToAction test....<commit_after>#include \"HelloWorldScene.h\"\n#include <iostream>\n#include \"cocos-ext.h\"\n\nusing namespace std;\nUSING_NS_CC;\nUSING_NS_CC_EXT;\n\nCCScene* HelloWorld::scene()\n{\n    \/\/ 'scene' is an autorelease object\n    CCScene *scene = CCScene::create();\n    \n    \/\/ 'layer' is an autorelease object\n    HelloWorld *layer = HelloWorld::create();\n\n    \/\/ add layer as a child to scene\n    scene->addChild(layer);\n\n    \/\/ return the scene\n    return scene;\n}\n\n\/\/ on \"init\" you need to initialize your instance\nbool HelloWorld::init()\n{\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ 1. super init first\n    if ( !CCLayer::init() )\n    {\n        return false;\n    }\n    \n    CCSize visibleSize = CCDirector::sharedDirector()->getVisibleSize();\n    CCPoint origin = CCDirector::sharedDirector()->getVisibleOrigin();\n\tCCDirector::sharedDirector()->getTouchDispatcher()->addTargetedDelegate(this,0,true);\n\t\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ 2. add a menu item with \"X\" image, which is clicked to quit the program\n    \/\/    you may modify it.\n\n    \/\/ add a \"close\" icon to exit the progress. it's an autorelease object\n    CCMenuItemImage *pCloseItem = CCMenuItemImage::create(\n                                        \"CloseNormal.png\",\n                                        \"CloseSelected.png\",\n                                        this,\n                                        menu_selector(HelloWorld::menuCloseCallback));\n    \n\tpCloseItem->setPosition(ccp(origin.x + visibleSize.width - pCloseItem->getContentSize().width\/2 ,\n                                origin.y + pCloseItem->getContentSize().height\/2));\n\n    \/\/ create menu, it's an autorelease object\n    CCMenu* pMenu = CCMenu::create(pCloseItem, NULL);\n    pMenu->setPosition(CCPointZero);\n    this->addChild(pMenu, 1);\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ 3. add your codes below...\n\n    \/\/ add a label shows \"Hello World\"\n    \/\/ create and initialize a label\n    \n    CCLabelTTF* pLabel = CCLabelTTF::create(\"Hello COCOS\", \"Arial\", 24);\n    \n    \/\/ position the label on the center of the screen\n    pLabel->setPosition(ccp(origin.x + visibleSize.width\/2,\n                            origin.y + visibleSize.height - pLabel->getContentSize().height));\n\n    \/\/ add the label as a child to this layer\n    this->addChild(pLabel, 1);\n    times = 0;\n\tCCScheduler *scheduler = CCDirector::sharedDirector()->getScheduler();\n\tsprite = CCSprite::create(\"bl_24.png\");\n\tsprite->setPosition(ccp(50.0f,50.0f));\n\tthis->addChild(sprite, 0);\n\tbg = CCSprite::create(\"bg.jpg\");\n\tthis->addChild(bg);\n\tscheduler->scheduleSelector(SEL_SCHEDULE(&HelloWorld::updateByFrame),this,0,false);\n\n\t\n\t\/\/ʹplistΪ\n\tCCTexture2D::PVRImagesHavePremultipliedAlpha(true);\n\tCCSpriteFrameCache::sharedSpriteFrameCache()->addSpriteFramesWithFile(\"feiyunan.plist\");\n\tCCSpriteFrameCache::sharedSpriteFrameCache()->addSpriteFramesWithFile(\"huangfeihu.plist\");\n\n\tplayer = CCSprite::create(\"feiyunan.png\");\n\thfh = CCSprite::create(\"huangfeihu.png\");\n\tplayer->setPosition(ccp(300.0f,400.0f));\n\thfh->setPosition(ccp(100,100));\n\tthis->addChild(player);\n\tthis->addChild(hfh);\n\n\tCCArray* animFrames = CCArray::createWithCapacity(15);\n\tCCArray* hfhFrames = CCArray::createWithCapacity(24);\n\tchar str[100] = {0};\n\tfor(int i=0; i<24; i++)\n\t{\n\t\tsprintf(str,\"feiyu%d.png\",i);\n\t\tCCSpriteFrame* frame = CCSpriteFrameCache::sharedSpriteFrameCache()->spriteFrameByName(str);\n\t\tif( frame != NULL )\n\t\t\tanimFrames->addObject( frame );\n\n\t\tsprintf(str,\"huangfeihu%d.png\",i);\n\t\tframe = CCSpriteFrameCache::sharedSpriteFrameCache()->spriteFrameByName(str);\n\t\tif( frame != NULL )\n\t\t\thfhFrames->addObject( frame );\n\t}\n\t\t\n\tCCAnimation *animation = CCAnimation::createWithSpriteFrames( animFrames,0.1f );\n\tCCAnimation *hfhAnimation = CCAnimation::createWithSpriteFrames( hfhFrames,0.05f );\n\thfhAnimation->setLoops(-1);\n\tanimation->setLoops(-1);\n\tplayer->runAction(CCAnimate::create(animation));\n\thfh->runAction(CCAnimate::create(hfhAnimation));\n\tCCArmatureDataManager::sharedArmatureDataManager()->addArmatureFileInfo(\"dragonbones\/DragonBones_tutorial_Start.png\",\"dragonbones\/DragonBones_tutorial_Start.plist\",\"dragonbones\/DragonBones_tutorial_Start.xml\");\n\tCCArmature *armature = CCArmature::create(\"Dragon\");\n\tarmature->getAnimation()->playByIndex(0);\n\tarmature->getAnimation()->setSpeedScale(0.2);\n\tarmature->setScaleX(-0.5f);\n\tarmature->setScaleY(0.5f);\n\tarmature->setPosition(ccp(visibleSize.width\/2,visibleSize.height\/2));\n\taddChild(armature);\n    return true;\n}\n\nvoid HelloWorld::updateByFrame(float value)\n{\n\t\n}\n\nbool HelloWorld::ccTouchBegan(CCTouch *pTouch, CCEvent *pEvent)\n{\n\tCCPoint tPoint = CCPoint(pTouch->getLocation());\n\tif( tPoint.x > hfh->getPositionX())\n\t{\n\t\thfh->setScaleX(1);\n\t}else\n\t{\n\t\thfh->setScaleX(-1);\n\t}\n\tCCMoveTo *action = CCMoveTo::create(5,tPoint);\n\thfh->runAction(action);\n\treturn false;\n}\n\nvoid HelloWorld::menuCloseCallback(CCObject* pSender)\n{\n#if (CC_TARGET_PLATFORM == CC_PLATFORM_WINRT) || (CC_TARGET_PLATFORM == CC_PLATFORM_WP8)\n\tCCMessageBox(\"You pressed the close button. Windows Store Apps do not implement a close button.\",\"Alert\");\n#else\n    CCDirector::sharedDirector()->end();\n#if (CC_TARGET_PLATFORM == CC_PLATFORM_IOS)\n    exit(0);\n#endif\n#endif\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"MethodDeclHandler.h\"\n\n#include <regex>\n\nnamespace typegrind\n{\n\n      MethodDeclHandler::MethodDeclHandler(clang::Rewriter*& rewriter, RegexSet const& regexes)\n              : mRewriter(rewriter)\n              , mRegexes(regexes)\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        try\n        {\n          if(!mRegexes.matches(prettyName)) return;\n        }\n        catch(...)\n        {\n          return;\n        }\n\n        \/\/if(mVisited.find(prettyName) != mVisited.end()) return;\n        \/\/mVisited.insert(prettyName);\n\n        clang::Stmt *funcBody = decl->getBody();\n        mRewriter->InsertTextAfterToken(funcBody->getSourceRange().getBegin(), \" TYPEGRIND_METHOD_ENTER(\\\"\"+prettyName+\"\\\") \");\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_METHOD_INITIALIZER(\\\"\"+prettyName+\"\\\", (\");\n              mRewriter->InsertTextBefore(initer->getRParenLoc(), \"))\");\n            }\n          }\n        }\n      }\n}\n<commit_msg>RegexSet::matches can't throw exceptions<commit_after>\n#include \"MethodDeclHandler.h\"\n\n#include <regex>\n\nnamespace typegrind\n{\n\n      MethodDeclHandler::MethodDeclHandler(clang::Rewriter*& rewriter, RegexSet const& regexes)\n              : mRewriter(rewriter)\n              , mRegexes(regexes)\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        if(!mRegexes.matches(prettyName)) return;\n\n        \/\/if(mVisited.find(prettyName) != mVisited.end()) return;\n        \/\/mVisited.insert(prettyName);\n\n        clang::Stmt *funcBody = decl->getBody();\n        mRewriter->InsertTextAfterToken(funcBody->getSourceRange().getBegin(), \" TYPEGRIND_METHOD_ENTER(\\\"\"+prettyName+\"\\\") \");\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_METHOD_INITIALIZER(\\\"\"+prettyName+\"\\\", (\");\n              mRewriter->InsertTextBefore(initer->getRParenLoc(), \"))\");\n            }\n          }\n        }\n      }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file websocketConnection.cc\n * @author Konrad Zemek\n * @copyright (C) 2014 ACK CYFRONET AGH\n * @copyright This software is released under the MIT license cited in 'LICENSE.txt'\n *\/\n\n#include \"communication\/websocketConnection.h\"\n\n#include \"communication\/certificateData.h\"\n#include \"communication\/exception.h\"\n#include \"logging.h\"\n\nnamespace veil\n{\nnamespace communication\n{\n\nWebsocketConnection::WebsocketConnection(std::function<void(const std::string&)> onMessageCallback,\n                                         std::function<void(Connection&, std::exception_ptr)> onFailCallback,\n                                         std::function<void(Connection&)> onOpenCallback,\n                                         std::function<void(Connection&)> onErrorCallback,\n                                         endpoint_type &endpoint,\n                                         const std::string &uri,\n                                         std::shared_ptr<const CertificateData> certificateData,\n                                         const bool verifyServerCertificate)\n    : Connection{std::move(onMessageCallback), std::move(onFailCallback),\n                 std::move(onOpenCallback), std::move(onErrorCallback)}\n    , m_endpoint(endpoint)\n    , m_certificateData{std::move(certificateData)}\n    , m_verifyServerCertificate{verifyServerCertificate}\n{\n    using websocketpp::lib::bind;\n    namespace p = websocketpp::lib::placeholders;\n\n    LOG(INFO) << \"Opening connection to '\" << uri << \"'\";\n\n    websocketpp::lib::error_code ec;\n    auto connection = endpoint.get_connection(uri, ec);\n    if(ec)\n        throw ConnectionError{\"cannot connect to the endpoint '\" + uri + \"': \" +\n                              ec.message()};\n\n    connection->set_message_handler     (bind(&WebsocketConnection::onMessage, this, p::_2));\n    connection->set_open_handler        (bind(&WebsocketConnection::onOpen, this));\n    connection->set_close_handler       (bind(&WebsocketConnection::onClose, this));\n    connection->set_fail_handler        (bind(&WebsocketConnection::onFail, this));\n    connection->set_ping_handler        (bind(&WebsocketConnection::onPing, this, p::_2));\n    connection->set_pong_handler        (bind(&WebsocketConnection::onPong, this, p::_2));\n    connection->set_pong_timeout_handler(bind(&WebsocketConnection::onPongTimeout, this, p::_2));\n    connection->set_interrupt_handler   (bind(&WebsocketConnection::onInterrupt, this));\n\n    m_connection = connection;\n\n    endpoint.connect(connection);\n}\n\nWebsocketConnection::~WebsocketConnection()\n{\n    m_onErrorCallback = []{};\n\n    websocketpp::lib::error_code ec;\n    m_endpoint.close(m_connection, websocketpp::close::status::going_away, \"\", ec);\n}\n\nvoid WebsocketConnection::send(const std::string &payload)\n{\n    const auto connection = m_endpoint.get_con_from_hdl(m_connection);\n    if(!connection)\n        throw SendError{\"websocketConnection instance has no associated ASIO \"\n                        \"connection.\"};\n\n    websocketpp::lib::error_code ec;\n    m_endpoint.send(connection, payload,\n                    websocketpp::frame::opcode::binary, ec);\n\n    if(ec)\n        throw SendError{\"error queuing message: \" + ec.message()};\n}\n\nvoid WebsocketConnection::onMessage(message_ptr msg)\n{\n    m_onMessageCallback(msg->get_payload());\n}\n\nvoid WebsocketConnection::onOpen()\n{\n    m_onOpenCallback();\n}\n\nvoid WebsocketConnection::onClose()\n{\n    const auto conn = m_endpoint.get_con_from_hdl(m_connection);\n    if(conn)\n        LOG(WARNING) << \"Connection closed: \" << conn->get_ec().message();\n    else\n        LOG(WARNING) << \"Connection has no associated ASIO connection.\";\n\n    m_onErrorCallback();\n}\n\nvoid WebsocketConnection::onFail()\n{\n    try\n    {\n        const auto conn = m_endpoint.get_con_from_hdl(m_connection);\n        if(conn)\n        {\n            const int verifyResult =\n                SSL_get_verify_result(conn->get_socket().native_handle());\n\n            if(verifyResult != 0 && m_verifyServerCertificate)\n            {\n                InvalidServerCertificate e{\"OpenSSL error: \" + std::to_string(verifyResult)};\n                LOG(WARNING) << \"Server certificate verification failed.\" <<\n                                \"OpenSSL error: \" << e.what();\n                throw e;\n            }\n\n            ConnectionError e{conn->get_ec().message()};\n            LOG(WARNING) << \"Connection failed: \" << e.what();\n            throw e;\n        }\n        else\n            LOG(WARNING) << \"Connection has no associated ASIO connection.\";\n    }\n    catch(Exception&)\n    {\n        m_onFailCallback(std::current_exception());\n        return;\n    }\n\n    m_onFailCallback({});\n}\n\nbool WebsocketConnection::onPing(std::string)\n{\n    return true;\n}\n\nvoid WebsocketConnection::onPong(std::string)\n{\n}\n\nvoid WebsocketConnection::onPongTimeout(std::string)\n{\n}\n\nvoid WebsocketConnection::onInterrupt()\n{\n    const auto conn = m_endpoint.get_con_from_hdl(m_connection);\n    if(conn)\n        LOG(WARNING) << \"Connection interrupted: \" << conn->get_ec().message();\n    else\n        LOG(WARNING) << \"Connection has no associated ASIO connection.\";\n\n    m_onErrorCallback();\n}\n\n} \/\/ namespace communication\n} \/\/ namespace veil\n<commit_msg>Don't call any methods after WebsocketConnection's destructor.<commit_after>\/**\n * @file websocketConnection.cc\n * @author Konrad Zemek\n * @copyright (C) 2014 ACK CYFRONET AGH\n * @copyright This software is released under the MIT license cited in 'LICENSE.txt'\n *\/\n\n#include \"communication\/websocketConnection.h\"\n\n#include \"communication\/certificateData.h\"\n#include \"communication\/exception.h\"\n#include \"logging.h\"\n\nnamespace veil\n{\nnamespace communication\n{\n\nWebsocketConnection::WebsocketConnection(std::function<void(const std::string&)> onMessageCallback,\n                                         std::function<void(Connection&, std::exception_ptr)> onFailCallback,\n                                         std::function<void(Connection&)> onOpenCallback,\n                                         std::function<void(Connection&)> onErrorCallback,\n                                         endpoint_type &endpoint,\n                                         const std::string &uri,\n                                         std::shared_ptr<const CertificateData> certificateData,\n                                         const bool verifyServerCertificate)\n    : Connection{std::move(onMessageCallback), std::move(onFailCallback),\n                 std::move(onOpenCallback), std::move(onErrorCallback)}\n    , m_endpoint(endpoint)\n    , m_certificateData{std::move(certificateData)}\n    , m_verifyServerCertificate{verifyServerCertificate}\n{\n    using websocketpp::lib::bind;\n    namespace p = websocketpp::lib::placeholders;\n\n    LOG(INFO) << \"Opening connection to '\" << uri << \"'\";\n\n    websocketpp::lib::error_code ec;\n    auto connection = endpoint.get_connection(uri, ec);\n    if(ec)\n        throw ConnectionError{\"cannot connect to the endpoint '\" + uri + \"': \" +\n                              ec.message()};\n\n    connection->set_message_handler     (bind(&WebsocketConnection::onMessage, this, p::_2));\n    connection->set_open_handler        (bind(&WebsocketConnection::onOpen, this));\n    connection->set_close_handler       (bind(&WebsocketConnection::onClose, this));\n    connection->set_fail_handler        (bind(&WebsocketConnection::onFail, this));\n    connection->set_ping_handler        (bind(&WebsocketConnection::onPing, this, p::_2));\n    connection->set_pong_handler        (bind(&WebsocketConnection::onPong, this, p::_2));\n    connection->set_pong_timeout_handler(bind(&WebsocketConnection::onPongTimeout, this, p::_2));\n    connection->set_interrupt_handler   (bind(&WebsocketConnection::onInterrupt, this));\n\n    m_connection = connection;\n\n    endpoint.connect(connection);\n}\n\nWebsocketConnection::~WebsocketConnection()\n{\n    websocketpp::lib::error_code ec;\n    const auto conn = m_endpoint.get_con_from_hdl(m_connection, ec);\n\n    m_onErrorCallback = []{};\n\n    if(ec)\n        LOG(WARNING) << \"Error retrieving connection pointer: \" << ec.message();\n    else if(!conn)\n        LOG(WARNING) << \"Connection has no associated ASIO connection.\";\n    else\n    {\n        conn->set_close_handler(nullptr);\n        m_endpoint.close(m_connection, websocketpp::close::status::going_away, \"\", ec);\n        if(ec)\n            LOG(WARNING) << \"Error closing connection: \" << ec.message();\n    }\n}\n\nvoid WebsocketConnection::send(const std::string &payload)\n{\n    websocketpp::lib::error_code ec;\n    const auto conn = m_endpoint.get_con_from_hdl(m_connection, ec);\n\n    if(ec)\n        throw SendError{\"error retrieving connection pointer: \" + ec.message()};\n\n    if(!conn)\n        throw SendError{\"websocketConnection instance has no associated ASIO \"\n                        \"connection.\"};\n\n    m_endpoint.send(conn, payload, websocketpp::frame::opcode::binary, ec);\n\n    if(ec)\n        throw SendError{\"error queuing message: \" + ec.message()};\n}\n\nvoid WebsocketConnection::onMessage(message_ptr msg)\n{\n    m_onMessageCallback(msg->get_payload());\n}\n\nvoid WebsocketConnection::onOpen()\n{\n    m_onOpenCallback();\n}\n\nvoid WebsocketConnection::onClose()\n{\n    websocketpp::lib::error_code ec;\n    const auto conn = m_endpoint.get_con_from_hdl(m_connection, ec);\n\n    if(ec)\n        LOG(WARNING) << \"Error retrieving connection pointer: \" << ec.message();\n    else if(!conn)\n        LOG(WARNING) << \"Connection has no associated ASIO connection.\";\n    else\n        LOG(WARNING) << \"Connection closed: \" << conn->get_ec().message();\n\n    m_onErrorCallback();\n}\n\nvoid WebsocketConnection::onFail()\n{\n    try\n    {\n        websocketpp::lib::error_code ec;\n        const auto conn = m_endpoint.get_con_from_hdl(m_connection, ec);\n\n        if(ec)\n        {\n            LOG(WARNING) << \"Error retrieving connection pointer: \" << ec.message();\n        }\n        else if(!conn)\n        {\n            LOG(WARNING) << \"Connection has no associated ASIO connection.\";\n        }\n        else\n        {\n            const int verifyResult =\n                SSL_get_verify_result(conn->get_socket().native_handle());\n\n            if(verifyResult != 0 && m_verifyServerCertificate)\n            {\n                InvalidServerCertificate e{\"OpenSSL error: \" + std::to_string(verifyResult)};\n                LOG(WARNING) << \"Server certificate verification failed.\" <<\n                                \"OpenSSL error: \" << e.what();\n                throw e;\n            }\n\n            ConnectionError e{conn->get_ec().message()};\n            LOG(WARNING) << \"Connection failed: \" << e.what();\n            throw e;\n        }\n    }\n    catch(Exception&)\n    {\n        m_onFailCallback(std::current_exception());\n        return;\n    }\n\n    m_onFailCallback({});\n}\n\nbool WebsocketConnection::onPing(std::string)\n{\n    return true;\n}\n\nvoid WebsocketConnection::onPong(std::string)\n{\n}\n\nvoid WebsocketConnection::onPongTimeout(std::string)\n{\n}\n\nvoid WebsocketConnection::onInterrupt()\n{\n    websocketpp::lib::error_code ec;\n    const auto conn = m_endpoint.get_con_from_hdl(m_connection, ec);\n\n    if(ec)\n        LOG(WARNING) << \"Error retrieving connection pointer: \" << ec.message();\n    else if(!conn)\n        LOG(WARNING) << \"Connection has no associated ASIO connection.\";\n    else\n        LOG(WARNING) << \"Connection interrupted: \" << conn->get_ec().message();\n\n    m_onErrorCallback();\n}\n\n} \/\/ namespace communication\n} \/\/ namespace veil\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: XMLTextListBlockContext.cxx,v $\n * $Revision: 1.13 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org.  If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_xmloff.hxx\"\n#include <tools\/debug.hxx>\n#include <com\/sun\/star\/container\/XNameContainer.hpp>\n#include <com\/sun\/star\/container\/XIndexReplace.hpp>\n#include <com\/sun\/star\/style\/XStyle.hpp>\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#include <xmloff\/xmlimp.hxx>\n#include <xmloff\/xmlnumi.hxx>\n#include <xmloff\/nmspmap.hxx>\n#include \"xmlnmspe.hxx\"\n#include <xmloff\/xmltoken.hxx>\n#include \"XMLTextListItemContext.hxx\"\n#include \"XMLTextListBlockContext.hxx\"\n\nusing ::rtl::OUString;\nusing ::rtl::OUStringBuffer;\n\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::container;\nusing namespace ::com::sun::star::style;\nusing namespace ::com::sun::star::beans;\nusing namespace ::xmloff::token;\n\nTYPEINIT1( XMLTextListBlockContext, SvXMLImportContext );\n\n\/\/ OD 2008-05-07 #refactorlists#\n\/\/ add optional parameter <bRestartNumberingAtSubList> and its handling\nXMLTextListBlockContext::XMLTextListBlockContext(\n        SvXMLImport& rImport,\n        XMLTextImportHelper& rTxtImp,\n        sal_uInt16 nPrfx,\n        const OUString& rLName,\n        const Reference< xml::sax::XAttributeList > & xAttrList,\n        const sal_Bool bRestartNumberingAtSubList )\n:   SvXMLImportContext( rImport, nPrfx, rLName )\n,   mrTxtImport( rTxtImp )\n\/\/ --> OD 2008-04-22 #refactorlists#\n,   msListStyleName()\n\/\/ <--\n,   mxParentListBlock( rTxtImp.GetListBlock() )\n,   mnLevel( 0 )\n\/\/ --> OD 2008-05-07 #refactorlists#\n\/\/,   mbRestartNumbering( sal_True )\n,   mbRestartNumbering( sal_False )\n\/\/ <--\n,   mbSetDefaults( sal_False )\n\/\/ --> OD 2008-04-22 #refactorlists#\n,   msListId()\n,   msContinueListId()\n\/\/ <--\n{\n    \/\/ Inherit style name from parent list, as well as the flags whether\n    \/\/ numbering must be restarted and formats have to be created.\n    OUString sParentListStyleName;\n    if( mxParentListBlock.Is() )\n    {\n        XMLTextListBlockContext *pParent =\n                                (XMLTextListBlockContext *)&mxParentListBlock;\n        msListStyleName = pParent->GetListStyleName();\n        sParentListStyleName = msListStyleName;\n        mxNumRules = pParent->GetNumRules();\n        mnLevel = pParent->GetLevel() + 1;\n        \/\/ --> OD 2008-05-07 #refactorlists#\n\/\/        mbRestartNumbering = pParent->IsRestartNumbering();\n        mbRestartNumbering = pParent->IsRestartNumbering() ||\n                             bRestartNumberingAtSubList;\n        \/\/ <--\n        mbSetDefaults = pParent->mbSetDefaults;\n        \/\/ --> OD 2008-04-22 #refactorlists#\n        msListId = pParent->GetListId();\n        msContinueListId = pParent->GetContinueListId();\n        \/\/ <--\n    }\n\n    const SvXMLTokenMap& rTokenMap = mrTxtImport.GetTextListBlockAttrTokenMap();\n\n    \/\/ --> OD 2008-05-07 #refactorlists#\n    bool bIsContinueNumberingAttributePresent( false );\n    \/\/ <--\n    sal_Int16 nAttrCount = xAttrList.is() ? xAttrList->getLength() : 0;\n    for( sal_Int16 i=0; i < nAttrCount; i++ )\n    {\n        const OUString& rAttrName = xAttrList->getNameByIndex( i );\n        const OUString& rValue = xAttrList->getValueByIndex( i );\n\n        OUString aLocalName;\n        sal_uInt16 nPrefix =\n            GetImport().GetNamespaceMap().GetKeyByAttrName( rAttrName,\n                                                            &aLocalName );\n        switch( rTokenMap.Get( nPrefix, aLocalName ) )\n        {\n        case XML_TOK_TEXT_LIST_BLOCK_XMLID:\n            sXmlId = rValue;\n\/\/FIXME: there is no UNO API for lists\n            break;\n        case XML_TOK_TEXT_LIST_BLOCK_CONTINUE_NUMBERING:\n            mbRestartNumbering = !IsXMLToken(rValue, XML_TRUE);\n            \/\/ --> OD 2008-05-07 #refactorlists#\n            bIsContinueNumberingAttributePresent = true;\n            \/\/ <--\n            break;\n        case XML_TOK_TEXT_LIST_BLOCK_STYLE_NAME:\n            msListStyleName = rValue;\n            break;\n        \/\/ --> OD 2008-04-22 #refactorlists#\n        case XML_TOK_TEXT_LIST_BLOCK_ID:\n            if ( mnLevel == 0 ) \/\/ root <list> element\n            {\n                msListId = rValue;\n            }\n            break;\n        case XML_TOK_TEXT_LIST_BLOCK_CONTINUE_LIST:\n            if ( mnLevel == 0 ) \/\/ root <list> element\n            {\n                msContinueListId = rValue;\n            }\n            break;\n        }\n    }\n\n    if ( msListStyleName.getLength() &&\n         msListStyleName != sParentListStyleName )\n    {\n        OUString sDisplayStyleName(\n                GetImport().GetStyleDisplayName( XML_STYLE_FAMILY_TEXT_LIST,\n                                                 msListStyleName ) );\n        const Reference < XNameContainer >& rNumStyles =\n                                            mrTxtImport.GetNumberingStyles();\n        if( rNumStyles.is() && rNumStyles->hasByName( sDisplayStyleName ) )\n        {\n            Reference < XStyle > xStyle;\n            Any aAny = rNumStyles->getByName( sDisplayStyleName );\n            aAny >>= xStyle;\n\n            \/\/ --> OD 2008-05-07 #refactorlists# - no longer needed\n\/\/            \/\/ If the style has not been used, the restart numbering has\n\/\/            \/\/ to be set never.\n\/\/            if ( mbRestartNumbering && !xStyle->isInUse() )\n\/\/            {\n\/\/                mbRestartNumbering = sal_False;\n\/\/            }\n            \/\/ <--\n\n            Reference< XPropertySet > xPropSet( xStyle, UNO_QUERY );\n            aAny = xPropSet->getPropertyValue( mrTxtImport.sNumberingRules );\n            aAny >>= mxNumRules;\n        }\n        else\n        {\n            const SvxXMLListStyleContext *pListStyle =\n                                mrTxtImport.FindAutoListStyle( msListStyleName );\n            if( pListStyle )\n            {\n                mxNumRules = pListStyle->GetNumRules();\n                \/\/ --> OD 2008-05-07 #refactorlists# - no longer needed\n\/\/                sal_Bool bUsed = mxNumRules.is();\n                \/\/ <--\n                if( !mxNumRules.is() )\n                {\n                    pListStyle->CreateAndInsertAuto();\n                    mxNumRules = pListStyle->GetNumRules();\n                }\n                \/\/ --> OD 2008-05-07 #refactorlists# - no longer needed\n\/\/                if( mbRestartNumbering && !bUsed )\n\/\/                    mbRestartNumbering = sal_False;\n                \/\/ <--\n            }\n        }\n    }\n\n    if( !mxNumRules.is() )\n    {\n        \/\/ If no style name has been specified for this style and for any\n        \/\/ parent or if no num rule this the specified name is existing,\n        \/\/ create a new one.\n\n        mxNumRules =\n            SvxXMLListStyleContext::CreateNumRule( GetImport().GetModel() );\n        DBG_ASSERT( mxNumRules.is(), \"go no numbering rule\" );\n        if( !mxNumRules.is() )\n            return;\n\n        \/\/ Because it is a new num rule, numbering must be restarted never.\n        mbRestartNumbering = sal_False;\n        mbSetDefaults = sal_True;\n    }\n\n    const sal_Int32 nLevelCount = mxNumRules->getCount();\n    if( mnLevel >= nLevelCount )\n        mnLevel = sal::static_int_cast< sal_Int16 >(nLevelCount-1);\n\n    if( mbSetDefaults )\n    {\n        \/\/ Because there is no list style sheet for this style, a default\n        \/\/ format must be set for any level of this num rule.\n        SvxXMLListStyleContext::SetDefaultStyle( mxNumRules, mnLevel,\n                                                   sal_False );\n    }\n\n    \/\/ --> OD 2008-04-23 #refactorlists#\n    if ( mnLevel == 0 ) \/\/ root <list> element\n    {\n        if ( msListId.getLength() == 0 )  \/\/ no text:id property found\n        {\n            sal_Int32 nUPD( 0 );\n            sal_Int32 nBuild( 0 );\n            const bool bBuildIdFound = GetImport().getBuildIds( nUPD, nBuild );\n            if ( rImport.IsTextDocInOOoFileFormat() ||\n                 ( bBuildIdFound && nUPD == 680 ) )\n            {\n                \/\/ handling former documents written by OpenOffice.org:\n                \/\/ use default list id of numbering rules instance, if existing\n                uno::Reference< beans::XPropertySet > xNumRuleProps( mxNumRules, UNO_QUERY );\n                if ( xNumRuleProps.is() )\n                {\n                    uno::Reference< beans::XPropertySetInfo > xNumRulePropSetInfo(\n                                                xNumRuleProps->getPropertySetInfo());\n                    if ( xNumRulePropSetInfo.is() &&\n                         xNumRulePropSetInfo->hasPropertyByName( mrTxtImport.sPropNameDefaultListId) )\n                    {\n                        xNumRuleProps->getPropertyValue( mrTxtImport.sPropNameDefaultListId ) >>= msListId;\n                        DBG_ASSERT( msListId.getLength() != 0,\n                                    \"no default list id found at numbering rules instance. Serious defect -> please inform OD.\" );\n                        if ( !bIsContinueNumberingAttributePresent &&\n                             !mbRestartNumbering &&\n                             mrTxtImport.IsListProcessed( msListId ) )\n                        {\n                            mbRestartNumbering = sal_True;\n                        }\n                    }\n                }\n            }\n            if ( msListId.getLength() == 0 )\n            {\n                \/\/ generate a new list id for the list\n                msListId = mrTxtImport.GenerateNewListId();\n            }\n        }\n\n        if ( bIsContinueNumberingAttributePresent && !mbRestartNumbering &&\n             msContinueListId.getLength() == 0 )\n        {\n            if ( mrTxtImport.GetListStyleOfLastProcessedList() == msListStyleName &&\n                 mrTxtImport.GetLastProcessedListId() != msListId )\n            {\n                msContinueListId = mrTxtImport.GetLastProcessedListId();\n            }\n        }\n\n        if ( msContinueListId.getLength() > 0 )\n        {\n            if ( !mrTxtImport.IsListProcessed( msContinueListId ) )\n            {\n                msContinueListId = ::rtl::OUString();\n            }\n            else\n            {\n                \/\/ search continue list chain for master list and\n                \/\/ continue the master list.\n                ::rtl::OUString sTmpStr =\n                    mrTxtImport.GetContinueListIdOfProcessedList( msContinueListId );\n                while ( sTmpStr.getLength() > 0 )\n                {\n                    msContinueListId = sTmpStr;\n\n                    sTmpStr =\n                        mrTxtImport.GetContinueListIdOfProcessedList( msContinueListId );\n                }\n            }\n        }\n\n        if ( !mrTxtImport.IsListProcessed( msListId ) )\n        {\n            mrTxtImport.KeepListAsProcessed( msListId, msListStyleName, msContinueListId );\n        }\n    }\n    \/\/ <--\n\n    \/\/ Remember this list block.\n    mrTxtImport.SetListBlock( this );\n\n    \/\/ There is no list item by now.\n    mrTxtImport.SetListItem( 0 );\n}\n\nXMLTextListBlockContext::~XMLTextListBlockContext()\n{\n}\n\nvoid XMLTextListBlockContext::EndElement()\n{\n    \/\/ Numbering has not to be restarted if it has been restarted within\n    \/\/ a child list.\n    XMLTextListBlockContext *pParent =\n                                (XMLTextListBlockContext *)&mxParentListBlock;\n    if( pParent )\n    {\n        pParent->mbRestartNumbering = mbRestartNumbering;\n    }\n\n    \/\/ Restore current list block.\n    mrTxtImport.SetListBlock( pParent );\n\n    \/\/ Any paragraph following the list within the same list item must not\n    \/\/ be numbered.\n    mrTxtImport.SetListItem( 0 );\n}\n\nSvXMLImportContext *XMLTextListBlockContext::CreateChildContext(\n        sal_uInt16 nPrefix,\n        const OUString& rLocalName,\n        const Reference< xml::sax::XAttributeList > & xAttrList )\n{\n    SvXMLImportContext *pContext = 0;\n\n    const SvXMLTokenMap& rTokenMap =\n                        mrTxtImport.GetTextListBlockElemTokenMap();\n    sal_Bool bHeader = sal_False;\n    switch( rTokenMap.Get( nPrefix, rLocalName ) )\n    {\n    case XML_TOK_TEXT_LIST_HEADER:\n        bHeader = sal_True;\n    case XML_TOK_TEXT_LIST_ITEM:\n        pContext = new XMLTextListItemContext( GetImport(), mrTxtImport,\n                                                nPrefix, rLocalName,\n                                              xAttrList, bHeader );\n        break;\n    }\n\n    if( !pContext )\n        pContext = new SvXMLImportContext( GetImport(), nPrefix, rLocalName );\n\n    return pContext;\n}\n\n\/\/ --> OD 2008-04-22 #refactorlists#\nconst ::rtl::OUString& XMLTextListBlockContext::GetListId() const\n{\n    return msListId;\n}\n\nconst ::rtl::OUString& XMLTextListBlockContext::GetContinueListId() const\n{\n    return msContinueListId;\n}\n\/\/ <--\n<commit_msg>INTEGRATION: CWS sw30bf11 (1.13.26); FILE MERGED 2008\/07\/31 08:15:16 od 1.13.26.1: #i92221# text:id in element <text:list> replaced by xml:id<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: XMLTextListBlockContext.cxx,v $\n * $Revision: 1.14 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org.  If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_xmloff.hxx\"\n#include <tools\/debug.hxx>\n#include <com\/sun\/star\/container\/XNameContainer.hpp>\n#include <com\/sun\/star\/container\/XIndexReplace.hpp>\n#include <com\/sun\/star\/style\/XStyle.hpp>\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#include <xmloff\/xmlimp.hxx>\n#include <xmloff\/xmlnumi.hxx>\n#include <xmloff\/nmspmap.hxx>\n#include \"xmlnmspe.hxx\"\n#include <xmloff\/xmltoken.hxx>\n#include \"XMLTextListItemContext.hxx\"\n#include \"XMLTextListBlockContext.hxx\"\n\nusing ::rtl::OUString;\nusing ::rtl::OUStringBuffer;\n\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::container;\nusing namespace ::com::sun::star::style;\nusing namespace ::com::sun::star::beans;\nusing namespace ::xmloff::token;\n\nTYPEINIT1( XMLTextListBlockContext, SvXMLImportContext );\n\n\/\/ OD 2008-05-07 #refactorlists#\n\/\/ add optional parameter <bRestartNumberingAtSubList> and its handling\nXMLTextListBlockContext::XMLTextListBlockContext(\n        SvXMLImport& rImport,\n        XMLTextImportHelper& rTxtImp,\n        sal_uInt16 nPrfx,\n        const OUString& rLName,\n        const Reference< xml::sax::XAttributeList > & xAttrList,\n        const sal_Bool bRestartNumberingAtSubList )\n:   SvXMLImportContext( rImport, nPrfx, rLName )\n,   mrTxtImport( rTxtImp )\n\/\/ --> OD 2008-04-22 #refactorlists#\n,   msListStyleName()\n\/\/ <--\n,   mxParentListBlock( rTxtImp.GetListBlock() )\n,   mnLevel( 0 )\n\/\/ --> OD 2008-05-07 #refactorlists#\n\/\/,   mbRestartNumbering( sal_True )\n,   mbRestartNumbering( sal_False )\n\/\/ <--\n,   mbSetDefaults( sal_False )\n\/\/ --> OD 2008-04-22 #refactorlists#\n,   msListId()\n,   msContinueListId()\n\/\/ <--\n{\n    \/\/ Inherit style name from parent list, as well as the flags whether\n    \/\/ numbering must be restarted and formats have to be created.\n    OUString sParentListStyleName;\n    if( mxParentListBlock.Is() )\n    {\n        XMLTextListBlockContext *pParent =\n                                (XMLTextListBlockContext *)&mxParentListBlock;\n        msListStyleName = pParent->GetListStyleName();\n        sParentListStyleName = msListStyleName;\n        mxNumRules = pParent->GetNumRules();\n        mnLevel = pParent->GetLevel() + 1;\n        \/\/ --> OD 2008-05-07 #refactorlists#\n\/\/        mbRestartNumbering = pParent->IsRestartNumbering();\n        mbRestartNumbering = pParent->IsRestartNumbering() ||\n                             bRestartNumberingAtSubList;\n        \/\/ <--\n        mbSetDefaults = pParent->mbSetDefaults;\n        \/\/ --> OD 2008-04-22 #refactorlists#\n        msListId = pParent->GetListId();\n        msContinueListId = pParent->GetContinueListId();\n        \/\/ <--\n    }\n\n    const SvXMLTokenMap& rTokenMap = mrTxtImport.GetTextListBlockAttrTokenMap();\n\n    \/\/ --> OD 2008-05-07 #refactorlists#\n    bool bIsContinueNumberingAttributePresent( false );\n    \/\/ <--\n    sal_Int16 nAttrCount = xAttrList.is() ? xAttrList->getLength() : 0;\n    for( sal_Int16 i=0; i < nAttrCount; i++ )\n    {\n        const OUString& rAttrName = xAttrList->getNameByIndex( i );\n        const OUString& rValue = xAttrList->getValueByIndex( i );\n\n        OUString aLocalName;\n        sal_uInt16 nPrefix =\n            GetImport().GetNamespaceMap().GetKeyByAttrName( rAttrName,\n                                                            &aLocalName );\n        switch( rTokenMap.Get( nPrefix, aLocalName ) )\n        {\n        case XML_TOK_TEXT_LIST_BLOCK_XMLID:\n            sXmlId = rValue;\n\/\/FIXME: there is no UNO API for lists\n            \/\/ --> OD 2008-07-31 #i92221# - xml:id is also the list ID\n            if ( mnLevel == 0 ) \/\/ root <list> element\n            {\n                msListId = rValue;\n            }\n            \/\/ <--\n            break;\n        case XML_TOK_TEXT_LIST_BLOCK_CONTINUE_NUMBERING:\n            mbRestartNumbering = !IsXMLToken(rValue, XML_TRUE);\n            \/\/ --> OD 2008-05-07 #refactorlists#\n            bIsContinueNumberingAttributePresent = true;\n            \/\/ <--\n            break;\n        case XML_TOK_TEXT_LIST_BLOCK_STYLE_NAME:\n            msListStyleName = rValue;\n            break;\n        \/\/ --> OD 2008-04-22 #refactorlists#\n        case XML_TOK_TEXT_LIST_BLOCK_CONTINUE_LIST:\n            if ( mnLevel == 0 ) \/\/ root <list> element\n            {\n                msContinueListId = rValue;\n            }\n            break;\n        }\n    }\n\n    if ( msListStyleName.getLength() &&\n         msListStyleName != sParentListStyleName )\n    {\n        OUString sDisplayStyleName(\n                GetImport().GetStyleDisplayName( XML_STYLE_FAMILY_TEXT_LIST,\n                                                 msListStyleName ) );\n        const Reference < XNameContainer >& rNumStyles =\n                                            mrTxtImport.GetNumberingStyles();\n        if( rNumStyles.is() && rNumStyles->hasByName( sDisplayStyleName ) )\n        {\n            Reference < XStyle > xStyle;\n            Any aAny = rNumStyles->getByName( sDisplayStyleName );\n            aAny >>= xStyle;\n\n            \/\/ --> OD 2008-05-07 #refactorlists# - no longer needed\n\/\/            \/\/ If the style has not been used, the restart numbering has\n\/\/            \/\/ to be set never.\n\/\/            if ( mbRestartNumbering && !xStyle->isInUse() )\n\/\/            {\n\/\/                mbRestartNumbering = sal_False;\n\/\/            }\n            \/\/ <--\n\n            Reference< XPropertySet > xPropSet( xStyle, UNO_QUERY );\n            aAny = xPropSet->getPropertyValue( mrTxtImport.sNumberingRules );\n            aAny >>= mxNumRules;\n        }\n        else\n        {\n            const SvxXMLListStyleContext *pListStyle =\n                                mrTxtImport.FindAutoListStyle( msListStyleName );\n            if( pListStyle )\n            {\n                mxNumRules = pListStyle->GetNumRules();\n                \/\/ --> OD 2008-05-07 #refactorlists# - no longer needed\n\/\/                sal_Bool bUsed = mxNumRules.is();\n                \/\/ <--\n                if( !mxNumRules.is() )\n                {\n                    pListStyle->CreateAndInsertAuto();\n                    mxNumRules = pListStyle->GetNumRules();\n                }\n                \/\/ --> OD 2008-05-07 #refactorlists# - no longer needed\n\/\/                if( mbRestartNumbering && !bUsed )\n\/\/                    mbRestartNumbering = sal_False;\n                \/\/ <--\n            }\n        }\n    }\n\n    if( !mxNumRules.is() )\n    {\n        \/\/ If no style name has been specified for this style and for any\n        \/\/ parent or if no num rule this the specified name is existing,\n        \/\/ create a new one.\n\n        mxNumRules =\n            SvxXMLListStyleContext::CreateNumRule( GetImport().GetModel() );\n        DBG_ASSERT( mxNumRules.is(), \"go no numbering rule\" );\n        if( !mxNumRules.is() )\n            return;\n\n        \/\/ Because it is a new num rule, numbering must be restarted never.\n        mbRestartNumbering = sal_False;\n        mbSetDefaults = sal_True;\n    }\n\n    const sal_Int32 nLevelCount = mxNumRules->getCount();\n    if( mnLevel >= nLevelCount )\n        mnLevel = sal::static_int_cast< sal_Int16 >(nLevelCount-1);\n\n    if( mbSetDefaults )\n    {\n        \/\/ Because there is no list style sheet for this style, a default\n        \/\/ format must be set for any level of this num rule.\n        SvxXMLListStyleContext::SetDefaultStyle( mxNumRules, mnLevel,\n                                                   sal_False );\n    }\n\n    \/\/ --> OD 2008-04-23 #refactorlists#\n    if ( mnLevel == 0 ) \/\/ root <list> element\n    {\n        if ( msListId.getLength() == 0 )  \/\/ no text:id property found\n        {\n            sal_Int32 nUPD( 0 );\n            sal_Int32 nBuild( 0 );\n            const bool bBuildIdFound = GetImport().getBuildIds( nUPD, nBuild );\n            if ( rImport.IsTextDocInOOoFileFormat() ||\n                 ( bBuildIdFound && nUPD == 680 ) )\n            {\n                \/\/ handling former documents written by OpenOffice.org:\n                \/\/ use default list id of numbering rules instance, if existing\n                uno::Reference< beans::XPropertySet > xNumRuleProps( mxNumRules, UNO_QUERY );\n                if ( xNumRuleProps.is() )\n                {\n                    uno::Reference< beans::XPropertySetInfo > xNumRulePropSetInfo(\n                                                xNumRuleProps->getPropertySetInfo());\n                    if ( xNumRulePropSetInfo.is() &&\n                         xNumRulePropSetInfo->hasPropertyByName( mrTxtImport.sPropNameDefaultListId) )\n                    {\n                        xNumRuleProps->getPropertyValue( mrTxtImport.sPropNameDefaultListId ) >>= msListId;\n                        DBG_ASSERT( msListId.getLength() != 0,\n                                    \"no default list id found at numbering rules instance. Serious defect -> please inform OD.\" );\n                        if ( !bIsContinueNumberingAttributePresent &&\n                             !mbRestartNumbering &&\n                             mrTxtImport.IsListProcessed( msListId ) )\n                        {\n                            mbRestartNumbering = sal_True;\n                        }\n                    }\n                }\n            }\n            if ( msListId.getLength() == 0 )\n            {\n                \/\/ generate a new list id for the list\n                msListId = mrTxtImport.GenerateNewListId();\n            }\n        }\n\n        if ( bIsContinueNumberingAttributePresent && !mbRestartNumbering &&\n             msContinueListId.getLength() == 0 )\n        {\n            if ( mrTxtImport.GetListStyleOfLastProcessedList() == msListStyleName &&\n                 mrTxtImport.GetLastProcessedListId() != msListId )\n            {\n                msContinueListId = mrTxtImport.GetLastProcessedListId();\n            }\n        }\n\n        if ( msContinueListId.getLength() > 0 )\n        {\n            if ( !mrTxtImport.IsListProcessed( msContinueListId ) )\n            {\n                msContinueListId = ::rtl::OUString();\n            }\n            else\n            {\n                \/\/ search continue list chain for master list and\n                \/\/ continue the master list.\n                ::rtl::OUString sTmpStr =\n                    mrTxtImport.GetContinueListIdOfProcessedList( msContinueListId );\n                while ( sTmpStr.getLength() > 0 )\n                {\n                    msContinueListId = sTmpStr;\n\n                    sTmpStr =\n                        mrTxtImport.GetContinueListIdOfProcessedList( msContinueListId );\n                }\n            }\n        }\n\n        if ( !mrTxtImport.IsListProcessed( msListId ) )\n        {\n            mrTxtImport.KeepListAsProcessed( msListId, msListStyleName, msContinueListId );\n        }\n    }\n    \/\/ <--\n\n    \/\/ Remember this list block.\n    mrTxtImport.SetListBlock( this );\n\n    \/\/ There is no list item by now.\n    mrTxtImport.SetListItem( 0 );\n}\n\nXMLTextListBlockContext::~XMLTextListBlockContext()\n{\n}\n\nvoid XMLTextListBlockContext::EndElement()\n{\n    \/\/ Numbering has not to be restarted if it has been restarted within\n    \/\/ a child list.\n    XMLTextListBlockContext *pParent =\n                                (XMLTextListBlockContext *)&mxParentListBlock;\n    if( pParent )\n    {\n        pParent->mbRestartNumbering = mbRestartNumbering;\n    }\n\n    \/\/ Restore current list block.\n    mrTxtImport.SetListBlock( pParent );\n\n    \/\/ Any paragraph following the list within the same list item must not\n    \/\/ be numbered.\n    mrTxtImport.SetListItem( 0 );\n}\n\nSvXMLImportContext *XMLTextListBlockContext::CreateChildContext(\n        sal_uInt16 nPrefix,\n        const OUString& rLocalName,\n        const Reference< xml::sax::XAttributeList > & xAttrList )\n{\n    SvXMLImportContext *pContext = 0;\n\n    const SvXMLTokenMap& rTokenMap =\n                        mrTxtImport.GetTextListBlockElemTokenMap();\n    sal_Bool bHeader = sal_False;\n    switch( rTokenMap.Get( nPrefix, rLocalName ) )\n    {\n    case XML_TOK_TEXT_LIST_HEADER:\n        bHeader = sal_True;\n    case XML_TOK_TEXT_LIST_ITEM:\n        pContext = new XMLTextListItemContext( GetImport(), mrTxtImport,\n                                                nPrefix, rLocalName,\n                                              xAttrList, bHeader );\n        break;\n    }\n\n    if( !pContext )\n        pContext = new SvXMLImportContext( GetImport(), nPrefix, rLocalName );\n\n    return pContext;\n}\n\n\/\/ --> OD 2008-04-22 #refactorlists#\nconst ::rtl::OUString& XMLTextListBlockContext::GetListId() const\n{\n    return msListId;\n}\n\nconst ::rtl::OUString& XMLTextListBlockContext::GetContinueListId() const\n{\n    return msContinueListId;\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 LICENSE\n * file in the root directory of this source tree.\n *\/\n#include \"FlipperConnectionManagerImpl.h\"\n#include <folly\/String.h>\n#include <folly\/futures\/Future.h>\n#include <folly\/io\/async\/AsyncSocketException.h>\n#include <folly\/io\/async\/SSLContext.h>\n#include <folly\/json.h>\n#include <rsocket\/Payload.h>\n#include <rsocket\/RSocket.h>\n#include <rsocket\/transports\/tcp\/TcpConnectionFactory.h>\n#include <stdexcept>\n#include <thread>\n#include \"ConnectionContextStore.h\"\n#include \"FireAndForgetBasedFlipperResponder.h\"\n#include \"FlipperRSocketResponder.h\"\n#include \"FlipperResponderImpl.h\"\n#include \"FlipperStep.h\"\n#include \"Log.h\"\n#include \"yarpl\/Single.h\"\n\n#define WRONG_THREAD_EXIT_MSG \\\n  \"ERROR: Aborting flipper initialization because it's not running in the flipper thread.\"\n\nstatic constexpr int reconnectIntervalSeconds = 2;\nstatic constexpr int connectionKeepaliveSeconds = 10;\n\nstatic constexpr int maxPayloadSize = 0xFFFFFF;\n\n\/\/ Not a public-facing version number.\n\/\/ Used for compatibility checking with desktop flipper.\n\/\/ To be bumped for every core platform interface change.\nstatic constexpr int sdkVersion = 1;\n\nnamespace facebook {\nnamespace flipper {\n\n\nclass ConnectionEvents : public rsocket::RSocketConnectionEvents {\n private:\n  FlipperConnectionManagerImpl* websocket_;\n\n public:\n  ConnectionEvents(FlipperConnectionManagerImpl* websocket)\n      : websocket_(websocket) {}\n\n  void onConnected() {\n    websocket_->isOpen_ = true;\n    if (websocket_->connectionIsTrusted_) {\n      websocket_->callbacks_->onConnected();\n    }\n  }\n\n  void onDisconnected(const folly::exception_wrapper&) {\n    if (!websocket_->isOpen_)\n      return;\n    websocket_->isOpen_ = false;\n    if (websocket_->connectionIsTrusted_) {\n      websocket_->connectionIsTrusted_ = false;\n      websocket_->callbacks_->onDisconnected();\n    }\n    websocket_->reconnect();\n  }\n\n  void onClosed(const folly::exception_wrapper& e) {\n    onDisconnected(e);\n  }\n};\n\nFlipperConnectionManagerImpl::FlipperConnectionManagerImpl(\n    FlipperInitConfig config,\n    std::shared_ptr<FlipperState> state,\n    std::shared_ptr<ConnectionContextStore> contextStore)\n    : deviceData_(config.deviceData),\n      flipperState_(state),\n      insecurePort(config.insecurePort),\n      securePort(config.securePort),\n      flipperEventBase_(config.callbackWorker),\n      connectionEventBase_(config.connectionWorker),\n      contextStore_(contextStore) {\n  CHECK_THROW(config.callbackWorker, std::invalid_argument);\n  CHECK_THROW(config.connectionWorker, std::invalid_argument);\n}\n\nFlipperConnectionManagerImpl::~FlipperConnectionManagerImpl() {\n  stop();\n}\n\nvoid FlipperConnectionManagerImpl::start() {\n  auto step = flipperState_->start(\"Start connection thread\");\n\n  folly::makeFuture()\n      .via(flipperEventBase_->getEventBase())\n      .delayed(std::chrono::milliseconds(0))\n      .thenValue([this, step](auto&&) {\n        step->complete();\n        startSync();\n      });\n}\n\nvoid FlipperConnectionManagerImpl::startSync() {\n  if (!isRunningInOwnThread()) {\n    log(WRONG_THREAD_EXIT_MSG);\n    return;\n  }\n  if (isOpen()) {\n    log(\"Already connected\");\n    return;\n  }\n  bool isClientSetupStep = isCertificateExchangeNeeded();\n  auto step = flipperState_->start(\n      isClientSetupStep ? \"Establish pre-setup connection\"\n                        : \"Establish main connection\");\n  try {\n    if (isClientSetupStep) {\n      doCertificateExchange();\n    } else {\n      connectSecurely();\n    }\n    step->complete();\n  } catch (const folly::AsyncSocketException& e) {\n    if (e.getType() == folly::AsyncSocketException::NOT_OPEN ||\n        e.getType() == folly::AsyncSocketException::NETWORK_ERROR) {\n      \/\/ The expected code path when flipper desktop is not running.\n      \/\/ Don't count as a failed attempt, or it would invalidate the connection\n      \/\/ files for no reason. On iOS devices, we can always connect to the local\n      \/\/ port forwarding server even when it can't connect to flipper. In that\n      \/\/ case we get a Network error instead of a Port not open error, so we\n      \/\/ treat them the same.\n      step->fail(\n          \"No route to flipper found. Is flipper desktop running? Retrying...\");\n    } else {\n      if (e.getType() == folly::AsyncSocketException::SSL_ERROR) {\n        auto message = std::string(e.what()) +\n            \"\\nMake sure the date and time of your device is up to date.\";\n        log(message);\n        step->fail(message);\n      } else {\n        log(e.what());\n        step->fail(e.what());\n      }\n      failedConnectionAttempts_++;\n    }\n    reconnect();\n  } catch (const std::exception& e) {\n    log(e.what());\n    step->fail(e.what());\n    failedConnectionAttempts_++;\n    reconnect();\n  }\n}\n\nvoid FlipperConnectionManagerImpl::doCertificateExchange() {\n  rsocket::SetupParameters parameters;\n  folly::SocketAddress address;\n\n  parameters.payload = rsocket::Payload(folly::toJson(folly::dynamic::object(\n      \"os\", deviceData_.os)(\"device\", deviceData_.device)(\n      \"app\", deviceData_.app)(\"sdk_version\", sdkVersion)));\n  address.setFromHostPort(deviceData_.host, insecurePort);\n\n  auto connectingInsecurely = flipperState_->start(\"Connect insecurely\");\n  connectionIsTrusted_ = false;\n  client_ =\n      rsocket::RSocket::createConnectedClient(\n          std::make_unique<rsocket::TcpConnectionFactory>(\n              *connectionEventBase_->getEventBase(), std::move(address)),\n          std::move(parameters),\n          nullptr,\n          std::chrono::seconds(connectionKeepaliveSeconds), \/\/ keepaliveInterval\n          nullptr, \/\/ stats\n          std::make_shared<ConnectionEvents>(this))\n          .get();\n  connectingInsecurely->complete();\n\n  requestSignedCertFromFlipper();\n}\n\nvoid FlipperConnectionManagerImpl::connectSecurely() {\n  rsocket::SetupParameters parameters;\n  folly::SocketAddress address;\n\n  auto loadingDeviceId = flipperState_->start(\"Load Device Id\");\n  auto deviceId = contextStore_->getDeviceId();\n  if (deviceId.compare(\"unknown\")) {\n    loadingDeviceId->complete();\n  }\n  parameters.payload = rsocket::Payload(\n      folly::toJson(folly::dynamic::object(\"os\", deviceData_.os)(\n          \"device\", deviceData_.device)(\"device_id\", deviceId)(\n          \"app\", deviceData_.app)(\"sdk_version\", sdkVersion)));\n  address.setFromHostPort(deviceData_.host, securePort);\n\n  std::shared_ptr<folly::SSLContext> sslContext =\n      contextStore_->getSSLContext();\n  auto connectingSecurely = flipperState_->start(\"Connect securely\");\n  connectionIsTrusted_ = true;\n  client_ =\n      rsocket::RSocket::createConnectedClient(\n          std::make_unique<rsocket::TcpConnectionFactory>(\n              *connectionEventBase_->getEventBase(),\n              std::move(address),\n              std::move(sslContext)),\n          std::move(parameters),\n          std::make_shared<FlipperRSocketResponder>(this, connectionEventBase_),\n          std::chrono::seconds(connectionKeepaliveSeconds), \/\/ keepaliveInterval\n          nullptr, \/\/ stats\n          std::make_shared<ConnectionEvents>(this))\n          .get();\n  connectingSecurely->complete();\n  failedConnectionAttempts_ = 0;\n}\n\nvoid FlipperConnectionManagerImpl::reconnect() {\n  folly::makeFuture()\n      .via(flipperEventBase_->getEventBase())\n      .delayed(std::chrono::seconds(reconnectIntervalSeconds))\n      .thenValue([this](auto&&) { startSync(); });\n}\n\nvoid FlipperConnectionManagerImpl::stop() {\n  if (client_) {\n    client_->disconnect();\n  }\n  client_ = nullptr;\n}\n\nbool FlipperConnectionManagerImpl::isOpen() const {\n  return isOpen_ && connectionIsTrusted_;\n}\n\nvoid FlipperConnectionManagerImpl::setCallbacks(Callbacks* callbacks) {\n  callbacks_ = callbacks;\n}\n\nvoid FlipperConnectionManagerImpl::sendMessage(const folly::dynamic& message) {\n  flipperEventBase_->add([this, message]() {\n    try {\n      rsocket::Payload payload = toRSocketPayload(message);\n      if (client_) {\n        client_->getRequester()\n            ->fireAndForget(std::move(payload))\n            ->subscribe([]() {});\n      }\n    } catch (std::length_error& e) {\n      \/\/ Skip sending messages that are too large.\n      log(e.what());\n      return;\n    }\n  });\n}\n\nvoid FlipperConnectionManagerImpl::onMessageReceived(\n    const folly::dynamic& message,\n    std::unique_ptr<FlipperResponder> responder) {\n  callbacks_->onMessageReceived(message, std::move(responder));\n}\n\nbool FlipperConnectionManagerImpl::isCertificateExchangeNeeded() {\n  if (failedConnectionAttempts_ >= 2) {\n    return true;\n  }\n\n  auto step = flipperState_->start(\"Check required certificates are present\");\n  bool hasRequiredFiles = contextStore_->hasRequiredFiles();\n  if (hasRequiredFiles) {\n    step->complete();\n  }\n  return !hasRequiredFiles;\n}\n\nvoid FlipperConnectionManagerImpl::requestSignedCertFromFlipper() {\n  auto generatingCSR = flipperState_->start(\"Generate CSR\");\n  std::string csr = contextStore_->getCertificateSigningRequest();\n  generatingCSR->complete();\n\n  folly::dynamic message =\n      folly::dynamic::object(\"method\", \"signCertificate\")(\"csr\", csr.c_str())(\n          \"destination\", contextStore_->getCertificateDirectoryPath().c_str());\n  auto gettingCert = flipperState_->start(\"Getting cert from desktop\");\n\n  flipperEventBase_->add([this, message, gettingCert]() {\n    client_->getRequester()\n        ->requestResponse(rsocket::Payload(folly::toJson(message)))\n        ->subscribe(\n            [this, gettingCert](rsocket::Payload p) {\n              auto response = p.moveDataToString();\n              if (!response.empty()) {\n                folly::dynamic config = folly::parseJson(response);\n                contextStore_->storeConnectionConfig(config);\n              }\n              gettingCert->complete();\n              log(\"Certificate exchange complete.\");\n              \/\/ Disconnect after message sending is complete.\n              \/\/ This will trigger a reconnect which should use the secure\n              \/\/ channel.\n              \/\/ TODO: Connect immediately, without waiting for reconnect\n              client_ = nullptr;\n            },\n            [this, message](folly::exception_wrapper e) {\n              e.handle(\n                  [&](rsocket::ErrorWithPayload& errorWithPayload) {\n                    std::string errorMessage =\n                        errorWithPayload.payload.moveDataToString();\n\n                    if (errorMessage.compare(\"not implemented\")) {\n                      log(\"Desktop failed to provide certificates. Error from flipper desktop:\\n\" +\n                          errorMessage);\n                      client_ = nullptr;\n                    } else {\n                      sendLegacyCertificateRequest(message);\n                    }\n                  },\n                  [e](...) {\n                    log((\"Error during certificate exchange:\" + e.what())\n                            .c_str());\n                  });\n            });\n  });\n  failedConnectionAttempts_ = 0;\n}\n\nvoid FlipperConnectionManagerImpl::sendLegacyCertificateRequest(\n    folly::dynamic message) {\n  \/\/ Desktop is using an old version of Flipper.\n  \/\/ Fall back to fireAndForget, instead of requestResponse.\n  auto sendingRequest =\n      flipperState_->start(\"Sending fallback certificate request\");\n  client_->getRequester()\n      ->fireAndForget(rsocket::Payload(folly::toJson(message)))\n      ->subscribe([this, sendingRequest]() {\n        sendingRequest->complete();\n        folly::dynamic config = folly::dynamic::object();\n        contextStore_->storeConnectionConfig(config);\n        client_ = nullptr;\n      });\n}\n\nbool FlipperConnectionManagerImpl::isRunningInOwnThread() {\n  return flipperEventBase_->isInEventBaseThread();\n}\n\nrsocket::Payload toRSocketPayload(dynamic data) {\n  std::string json = folly::toJson(data);\n  rsocket::Payload payload = rsocket::Payload(json);\n  auto payloadLength = payload.data->computeChainDataLength();\n  if (payloadLength > maxPayloadSize) {\n    auto logMessage =\n        std::string(\n            \"Error: Skipping sending message larger than max rsocket payload: \") +\n        json.substr(0, 100) + \"...\";\n    log(logMessage);\n    DCHECK_LE(payloadLength, maxPayloadSize);\n    throw new std::length_error(logMessage);\n  }\n\n  return payload;\n}\n\n} \/\/ namespace flipper\n} \/\/ namespace facebook\n<commit_msg>Don't log cert exchange connection failures<commit_after>\/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the LICENSE\n * file in the root directory of this source tree.\n *\/\n#include \"FlipperConnectionManagerImpl.h\"\n#include <folly\/String.h>\n#include <folly\/futures\/Future.h>\n#include <folly\/io\/async\/AsyncSocketException.h>\n#include <folly\/io\/async\/SSLContext.h>\n#include <folly\/json.h>\n#include <rsocket\/Payload.h>\n#include <rsocket\/RSocket.h>\n#include <rsocket\/transports\/tcp\/TcpConnectionFactory.h>\n#include <stdexcept>\n#include <thread>\n#include \"ConnectionContextStore.h\"\n#include \"FireAndForgetBasedFlipperResponder.h\"\n#include \"FlipperRSocketResponder.h\"\n#include \"FlipperResponderImpl.h\"\n#include \"FlipperStep.h\"\n#include \"Log.h\"\n#include \"yarpl\/Single.h\"\n\n#define WRONG_THREAD_EXIT_MSG \\\n  \"ERROR: Aborting flipper initialization because it's not running in the flipper thread.\"\n\nstatic constexpr int reconnectIntervalSeconds = 2;\nstatic constexpr int connectionKeepaliveSeconds = 10;\n\nstatic constexpr int maxPayloadSize = 0xFFFFFF;\n\n\/\/ Not a public-facing version number.\n\/\/ Used for compatibility checking with desktop flipper.\n\/\/ To be bumped for every core platform interface change.\nstatic constexpr int sdkVersion = 1;\n\nnamespace facebook {\nnamespace flipper {\n\n\nclass ConnectionEvents : public rsocket::RSocketConnectionEvents {\n private:\n  FlipperConnectionManagerImpl* websocket_;\n\n public:\n  ConnectionEvents(FlipperConnectionManagerImpl* websocket)\n      : websocket_(websocket) {}\n\n  void onConnected() {\n    websocket_->isOpen_ = true;\n    if (websocket_->connectionIsTrusted_) {\n      websocket_->callbacks_->onConnected();\n    }\n  }\n\n  void onDisconnected(const folly::exception_wrapper&) {\n    if (!websocket_->isOpen_)\n      return;\n    websocket_->isOpen_ = false;\n    if (websocket_->connectionIsTrusted_) {\n      websocket_->connectionIsTrusted_ = false;\n      websocket_->callbacks_->onDisconnected();\n    }\n    websocket_->reconnect();\n  }\n\n  void onClosed(const folly::exception_wrapper& e) {\n    onDisconnected(e);\n  }\n};\n\nFlipperConnectionManagerImpl::FlipperConnectionManagerImpl(\n    FlipperInitConfig config,\n    std::shared_ptr<FlipperState> state,\n    std::shared_ptr<ConnectionContextStore> contextStore)\n    : deviceData_(config.deviceData),\n      flipperState_(state),\n      insecurePort(config.insecurePort),\n      securePort(config.securePort),\n      flipperEventBase_(config.callbackWorker),\n      connectionEventBase_(config.connectionWorker),\n      contextStore_(contextStore) {\n  CHECK_THROW(config.callbackWorker, std::invalid_argument);\n  CHECK_THROW(config.connectionWorker, std::invalid_argument);\n}\n\nFlipperConnectionManagerImpl::~FlipperConnectionManagerImpl() {\n  stop();\n}\n\nvoid FlipperConnectionManagerImpl::start() {\n  auto step = flipperState_->start(\"Start connection thread\");\n\n  folly::makeFuture()\n      .via(flipperEventBase_->getEventBase())\n      .delayed(std::chrono::milliseconds(0))\n      .thenValue([this, step](auto&&) {\n        step->complete();\n        startSync();\n      });\n}\n\nvoid FlipperConnectionManagerImpl::startSync() {\n  if (!isRunningInOwnThread()) {\n    log(WRONG_THREAD_EXIT_MSG);\n    return;\n  }\n  if (isOpen()) {\n    log(\"Already connected\");\n    return;\n  }\n  bool isClientSetupStep = isCertificateExchangeNeeded();\n  auto step = flipperState_->start(\n      isClientSetupStep ? \"Establish pre-setup connection\"\n                        : \"Establish main connection\");\n  try {\n    if (isClientSetupStep) {\n      doCertificateExchange();\n    } else {\n      connectSecurely();\n    }\n    step->complete();\n  } catch (const folly::AsyncSocketException& e) {\n    if (e.getType() == folly::AsyncSocketException::NOT_OPEN ||\n        e.getType() == folly::AsyncSocketException::NETWORK_ERROR) {\n      \/\/ The expected code path when flipper desktop is not running.\n      \/\/ Don't count as a failed attempt, or it would invalidate the connection\n      \/\/ files for no reason. On iOS devices, we can always connect to the local\n      \/\/ port forwarding server even when it can't connect to flipper. In that\n      \/\/ case we get a Network error instead of a Port not open error, so we\n      \/\/ treat them the same.\n      step->fail(\n          \"No route to flipper found. Is flipper desktop running? Retrying...\");\n    } else {\n      if (e.getType() == folly::AsyncSocketException::SSL_ERROR) {\n        auto message = std::string(e.what()) +\n            \"\\nMake sure the date and time of your device is up to date.\";\n        log(message);\n        step->fail(message);\n      } else {\n        log(e.what());\n        step->fail(e.what());\n      }\n      failedConnectionAttempts_++;\n    }\n    reconnect();\n  } catch (const std::exception& e) {\n    log(e.what());\n    step->fail(e.what());\n    failedConnectionAttempts_++;\n    reconnect();\n  }\n}\n\nvoid FlipperConnectionManagerImpl::doCertificateExchange() {\n  rsocket::SetupParameters parameters;\n  folly::SocketAddress address;\n\n  parameters.payload = rsocket::Payload(folly::toJson(folly::dynamic::object(\n      \"os\", deviceData_.os)(\"device\", deviceData_.device)(\n      \"app\", deviceData_.app)(\"sdk_version\", sdkVersion)));\n  address.setFromHostPort(deviceData_.host, insecurePort);\n\n  auto connectingInsecurely = flipperState_->start(\"Connect insecurely\");\n  connectionIsTrusted_ = false;\n  client_ =\n      rsocket::RSocket::createConnectedClient(\n          std::make_unique<rsocket::TcpConnectionFactory>(\n              *connectionEventBase_->getEventBase(), std::move(address)),\n          std::move(parameters),\n          nullptr,\n          std::chrono::seconds(connectionKeepaliveSeconds), \/\/ keepaliveInterval\n          nullptr, \/\/ stats\n          std::make_shared<ConnectionEvents>(this))\n          .get();\n  connectingInsecurely->complete();\n\n  requestSignedCertFromFlipper();\n}\n\nvoid FlipperConnectionManagerImpl::connectSecurely() {\n  rsocket::SetupParameters parameters;\n  folly::SocketAddress address;\n\n  auto loadingDeviceId = flipperState_->start(\"Load Device Id\");\n  auto deviceId = contextStore_->getDeviceId();\n  if (deviceId.compare(\"unknown\")) {\n    loadingDeviceId->complete();\n  }\n  parameters.payload = rsocket::Payload(\n      folly::toJson(folly::dynamic::object(\"os\", deviceData_.os)(\n          \"device\", deviceData_.device)(\"device_id\", deviceId)(\n          \"app\", deviceData_.app)(\"sdk_version\", sdkVersion)));\n  address.setFromHostPort(deviceData_.host, securePort);\n\n  std::shared_ptr<folly::SSLContext> sslContext =\n      contextStore_->getSSLContext();\n  auto connectingSecurely = flipperState_->start(\"Connect securely\");\n  connectionIsTrusted_ = true;\n  client_ =\n      rsocket::RSocket::createConnectedClient(\n          std::make_unique<rsocket::TcpConnectionFactory>(\n              *connectionEventBase_->getEventBase(),\n              std::move(address),\n              std::move(sslContext)),\n          std::move(parameters),\n          std::make_shared<FlipperRSocketResponder>(this, connectionEventBase_),\n          std::chrono::seconds(connectionKeepaliveSeconds), \/\/ keepaliveInterval\n          nullptr, \/\/ stats\n          std::make_shared<ConnectionEvents>(this))\n          .get();\n  connectingSecurely->complete();\n  failedConnectionAttempts_ = 0;\n}\n\nvoid FlipperConnectionManagerImpl::reconnect() {\n  folly::makeFuture()\n      .via(flipperEventBase_->getEventBase())\n      .delayed(std::chrono::seconds(reconnectIntervalSeconds))\n      .thenValue([this](auto&&) { startSync(); });\n}\n\nvoid FlipperConnectionManagerImpl::stop() {\n  if (client_) {\n    client_->disconnect();\n  }\n  client_ = nullptr;\n}\n\nbool FlipperConnectionManagerImpl::isOpen() const {\n  return isOpen_ && connectionIsTrusted_;\n}\n\nvoid FlipperConnectionManagerImpl::setCallbacks(Callbacks* callbacks) {\n  callbacks_ = callbacks;\n}\n\nvoid FlipperConnectionManagerImpl::sendMessage(const folly::dynamic& message) {\n  flipperEventBase_->add([this, message]() {\n    try {\n      rsocket::Payload payload = toRSocketPayload(message);\n      if (client_) {\n        client_->getRequester()\n            ->fireAndForget(std::move(payload))\n            ->subscribe([]() {});\n      }\n    } catch (std::length_error& e) {\n      \/\/ Skip sending messages that are too large.\n      log(e.what());\n      return;\n    }\n  });\n}\n\nvoid FlipperConnectionManagerImpl::onMessageReceived(\n    const folly::dynamic& message,\n    std::unique_ptr<FlipperResponder> responder) {\n  callbacks_->onMessageReceived(message, std::move(responder));\n}\n\nbool FlipperConnectionManagerImpl::isCertificateExchangeNeeded() {\n  if (failedConnectionAttempts_ >= 2) {\n    return true;\n  }\n\n  auto step = flipperState_->start(\"Check required certificates are present\");\n  bool hasRequiredFiles = contextStore_->hasRequiredFiles();\n  if (hasRequiredFiles) {\n    step->complete();\n  }\n  return !hasRequiredFiles;\n}\n\nvoid FlipperConnectionManagerImpl::requestSignedCertFromFlipper() {\n  auto generatingCSR = flipperState_->start(\"Generate CSR\");\n  std::string csr = contextStore_->getCertificateSigningRequest();\n  generatingCSR->complete();\n\n  folly::dynamic message =\n      folly::dynamic::object(\"method\", \"signCertificate\")(\"csr\", csr.c_str())(\n          \"destination\", contextStore_->getCertificateDirectoryPath().c_str());\n  auto gettingCert = flipperState_->start(\"Getting cert from desktop\");\n\n  flipperEventBase_->add([this, message, gettingCert]() {\n    client_->getRequester()\n        ->requestResponse(rsocket::Payload(folly::toJson(message)))\n        ->subscribe(\n            [this, gettingCert](rsocket::Payload p) {\n              auto response = p.moveDataToString();\n              if (!response.empty()) {\n                folly::dynamic config = folly::parseJson(response);\n                contextStore_->storeConnectionConfig(config);\n              }\n              gettingCert->complete();\n              log(\"Certificate exchange complete.\");\n              \/\/ Disconnect after message sending is complete.\n              \/\/ This will trigger a reconnect which should use the secure\n              \/\/ channel.\n              \/\/ TODO: Connect immediately, without waiting for reconnect\n              client_ = nullptr;\n            },\n            [this, message, gettingCert](folly::exception_wrapper e) {\n              e.handle(\n                  [&](rsocket::ErrorWithPayload& errorWithPayload) {\n                    std::string errorMessage =\n                        errorWithPayload.payload.moveDataToString();\n\n                    if (errorMessage.compare(\"not implemented\")) {\n                      auto error =\n                          \"Desktop failed to provide certificates. Error from flipper desktop:\\n\" +\n                          errorMessage;\n                      log(error);\n                      gettingCert->fail(error);\n                      client_ = nullptr;\n                    } else {\n                      sendLegacyCertificateRequest(message);\n                    }\n                  },\n                  [e, gettingCert](...) {\n                    gettingCert->fail(e.what().c_str());\n                  });\n            });\n  });\n  failedConnectionAttempts_ = 0;\n}\n\nvoid FlipperConnectionManagerImpl::sendLegacyCertificateRequest(\n    folly::dynamic message) {\n  \/\/ Desktop is using an old version of Flipper.\n  \/\/ Fall back to fireAndForget, instead of requestResponse.\n  auto sendingRequest =\n      flipperState_->start(\"Sending fallback certificate request\");\n  client_->getRequester()\n      ->fireAndForget(rsocket::Payload(folly::toJson(message)))\n      ->subscribe([this, sendingRequest]() {\n        sendingRequest->complete();\n        folly::dynamic config = folly::dynamic::object();\n        contextStore_->storeConnectionConfig(config);\n        client_ = nullptr;\n      });\n}\n\nbool FlipperConnectionManagerImpl::isRunningInOwnThread() {\n  return flipperEventBase_->isInEventBaseThread();\n}\n\nrsocket::Payload toRSocketPayload(dynamic data) {\n  std::string json = folly::toJson(data);\n  rsocket::Payload payload = rsocket::Payload(json);\n  auto payloadLength = payload.data->computeChainDataLength();\n  if (payloadLength > maxPayloadSize) {\n    auto logMessage =\n        std::string(\n            \"Error: Skipping sending message larger than max rsocket payload: \") +\n        json.substr(0, 100) + \"...\";\n    log(logMessage);\n    DCHECK_LE(payloadLength, maxPayloadSize);\n    throw new std::length_error(logMessage);\n  }\n\n  return payload;\n}\n\n} \/\/ namespace flipper\n} \/\/ namespace facebook\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 \"google\/cloud\/internal\/strerror.h\"\n#include <gmock\/gmock.h>\n#include <cerrno>\n#include <cstring>\n\nnamespace google {\nnamespace cloud {\ninline namespace GOOGLE_CLOUD_CPP_NS {\nnamespace internal {\nnamespace {\n\nusing ::testing::HasSubstr;\n\n#include \"google\/cloud\/internal\/disable_msvc_crt_secure_warnings.inc\"\nTEST(StrErrorTest, Simple) {\n  auto const actual = ::google::cloud::internal::strerror(EDOM);\n  \/\/ In the test we can call `std::strerror()` because the test is single\n  \/\/ threaded.\n  std::string expected = std::strerror(EDOM);\n  EXPECT_EQ(actual, expected);\n}\n#include \"google\/cloud\/internal\/diagnostics_pop.inc\"\n\nTEST(StrErrorTest, InvalidErrno) {\n  auto const actual = ::google::cloud::internal::strerror(-123456789);\n  EXPECT_FALSE(actual.empty());\n  EXPECT_THAT(actual, HasSubstr(\"-123456789\"));\n}\n\n}  \/\/ namespace\n}  \/\/ namespace internal\n}  \/\/ namespace GOOGLE_CLOUD_CPP_NS\n}  \/\/ namespace cloud\n}  \/\/ namespace google\n<commit_msg>fix: strerror test on Windows (#4104)<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 \"google\/cloud\/internal\/strerror.h\"\n#include <gmock\/gmock.h>\n#include <cerrno>\n#include <cstring>\n\nnamespace google {\nnamespace cloud {\ninline namespace GOOGLE_CLOUD_CPP_NS {\nnamespace internal {\nnamespace {\n\nusing ::testing::AnyOf;\nusing ::testing::HasSubstr;\n\n#include \"google\/cloud\/internal\/disable_msvc_crt_secure_warnings.inc\"\nTEST(StrErrorTest, Simple) {\n  auto const actual = ::google::cloud::internal::strerror(EDOM);\n  \/\/ In the test we can call `std::strerror()` because the test is single\n  \/\/ threaded.\n  std::string const expected = std::strerror(EDOM);\n  EXPECT_EQ(actual, expected);\n}\n#include \"google\/cloud\/internal\/diagnostics_pop.inc\"\n\nTEST(StrErrorTest, InvalidErrno) {\n  auto constexpr kInvalidErrno = -1234;\n  auto const actual = ::google::cloud::internal::strerror(kInvalidErrno);\n  EXPECT_FALSE(actual.empty());\n  \/\/ In the test we can call `std::strerror()` because the test is single\n  \/\/ threaded.\n  std::string const expected = std::strerror(kInvalidErrno);\n  \/\/ On Windows the library returns `Unknown Error` instead of an error\n  \/\/ condition, so we cannot print why this failed.\n  EXPECT_THAT(actual, AnyOf(HasSubstr(\"-1234\"), HasSubstr(expected)));\n}\n\n}  \/\/ namespace\n}  \/\/ namespace internal\n}  \/\/ namespace GOOGLE_CLOUD_CPP_NS\n}  \/\/ namespace cloud\n}  \/\/ namespace google\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2007, 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\/\/ Author: wan@google.com (Zhanyong Wan)\n\n\/\/ Google Mock - a framework for writing C++ mock classes.\n\/\/\n\/\/ This file defines some utilities useful for implementing Google\n\/\/ Mock.  They are subject to change without notice, so please DO NOT\n\/\/ USE THEM IN USER CODE.\n\n#include \"gmock\/internal\/gmock-internal-utils.h\"\n\n#include <ctype.h>\n#include <ostream>  \/\/ NOLINT\n#include <string>\n#include \"gmock\/gmock.h\"\n#include \"gmock\/internal\/gmock-port.h\"\n#include \"gtest\/gtest.h\"\n\nnamespace testing {\nnamespace internal {\n\n\/\/ Joins a vector of strings as if they are fields of a tuple; returns\n\/\/ the joined string.\nGTEST_API_ std::string JoinAsTuple(const Strings& fields) {\n  switch (fields.size()) {\n    case 0:\n      return \"\";\n    case 1:\n      return fields[0];\n    default:\n      std::string result = \"(\" + fields[0];\n      for (size_t i = 1; i < fields.size(); i++) {\n        result += \", \";\n        result += fields[i];\n      }\n      result += \")\";\n      return result;\n  }\n}\n\n\/\/ Converts an identifier name to a space-separated list of lower-case\n\/\/ words.  Each maximum substring of the form [A-Za-z][a-z]*|\\d+ is\n\/\/ treated as one word.  For example, both \"FooBar123\" and\n\/\/ \"foo_bar_123\" are converted to \"foo bar 123\".\nGTEST_API_ std::string ConvertIdentifierNameToWords(const char* id_name) {\n  std::string result;\n  char prev_char = '\\0';\n  for (const char* p = id_name; *p != '\\0'; prev_char = *(p++)) {\n    \/\/ We don't care about the current locale as the input is\n    \/\/ guaranteed to be a valid C++ identifier name.\n    const bool starts_new_word = IsUpper(*p) ||\n        (!IsAlpha(prev_char) && IsLower(*p)) ||\n        (!IsDigit(prev_char) && IsDigit(*p));\n\n    if (IsAlNum(*p)) {\n      if (starts_new_word && result != \"\")\n        result += ' ';\n      result += ToLower(*p);\n    }\n  }\n  return result;\n}\n\n\/\/ This class reports Google Mock failures as Google Test failures.  A\n\/\/ user can define another class in a similar fashion if they intend to\n\/\/ use Google Mock with a testing framework other than Google Test.\nclass GoogleTestFailureReporter : public FailureReporterInterface {\n public:\n  virtual void ReportFailure(FailureType type, const char* file, int line,\n                             const std::string& message) {\n    AssertHelper(type == kFatal ?\n                 TestPartResult::kFatalFailure :\n                 TestPartResult::kNonFatalFailure,\n                 file,\n                 line,\n                 message.c_str()) = Message();\n    if (type == kFatal) {\n      posix::Abort();\n    }\n  }\n};\n\n\/\/ Returns the global failure reporter.  Will create a\n\/\/ GoogleTestFailureReporter and return it the first time called.\nGTEST_API_ FailureReporterInterface* GetFailureReporter() {\n  \/\/ Points to the global failure reporter used by Google Mock.  gcc\n  \/\/ guarantees that the following use of failure_reporter is\n  \/\/ thread-safe.  We may need to add additional synchronization to\n  \/\/ protect failure_reporter if we port Google Mock to other\n  \/\/ compilers.\n  static FailureReporterInterface* const failure_reporter =\n      new GoogleTestFailureReporter();\n  return failure_reporter;\n}\n\n\/\/ Protects global resources (stdout in particular) used by Log().\nstatic GTEST_DEFINE_STATIC_MUTEX_(g_log_mutex);\n\n\/\/ Returns true iff a log with the given severity is visible according\n\/\/ to the --gmock_verbose flag.\nGTEST_API_ bool LogIsVisible(LogSeverity severity) {\n  if (GMOCK_FLAG(verbose) == kInfoVerbosity) {\n    \/\/ Always show the log if --gmock_verbose=info.\n    return true;\n  } else if (GMOCK_FLAG(verbose) == kErrorVerbosity) {\n    \/\/ Always hide it if --gmock_verbose=error.\n    return false;\n  } else {\n    \/\/ If --gmock_verbose is neither \"info\" nor \"error\", we treat it\n    \/\/ as \"warning\" (its default value).\n    return severity == kWarning;\n  }\n}\n\n\/\/ Prints the given message to stdout iff 'severity' >= the level\n\/\/ specified by the --gmock_verbose flag.  If stack_frames_to_skip >=\n\/\/ 0, also prints the stack trace excluding the top\n\/\/ stack_frames_to_skip frames.  In opt mode, any positive\n\/\/ stack_frames_to_skip is treated as 0, since we don't know which\n\/\/ function calls will be inlined by the compiler and need to be\n\/\/ conservative.\nGTEST_API_ void Log(LogSeverity severity, const std::string& message,\n                    int stack_frames_to_skip) {\n  if (!LogIsVisible(severity))\n    return;\n\n  \/\/ Ensures that logs from different threads don't interleave.\n  MutexLock l(&g_log_mutex);\n\n  \/\/ \"using ::std::cout;\" doesn't work with Symbian's STLport, where cout is a\n  \/\/ macro.\n\n  if (severity == kWarning) {\n    \/\/ Prints a GMOCK WARNING marker to make the warnings easily searchable.\n    std::cout << \"\\nGMOCK WARNING:\";\n  }\n  \/\/ Pre-pends a new-line to message if it doesn't start with one.\n  if (message.empty() || message[0] != '\\n') {\n    std::cout << \"\\n\";\n  }\n  std::cout << message;\n  if (stack_frames_to_skip >= 0) {\n#ifdef NDEBUG\n    \/\/ In opt mode, we have to be conservative and skip no stack frame.\n    const int actual_to_skip = 0;\n#else\n    \/\/ In dbg mode, we can do what the caller tell us to do (plus one\n    \/\/ for skipping this function's stack frame).\n    const int actual_to_skip = stack_frames_to_skip + 1;\n#endif  \/\/ NDEBUG\n\n    \/\/ Appends a new-line to message if it doesn't end with one.\n    if (!message.empty() && *message.rbegin() != '\\n') {\n      std::cout << \"\\n\";\n    }\n    std::cout << \"Stack trace:\\n\"\n         << ::testing::internal::GetCurrentOsStackTraceExceptTop(\n             ::testing::UnitTest::GetInstance(), actual_to_skip);\n  }\n  std::cout << ::std::flush;\n}\n\nvoid IllegalDoDefault(const char* file, int line) {\n  internal::Assert(\n      false, file, line,\n      \"You are using DoDefault() inside a composite action like \"\n      \"DoAll() or WithArgs().  This is not supported for technical \"\n      \"reasons.  Please instead spell out the default action, or \"\n      \"assign the default action to an Action variable and use \"\n      \"the variable in various places.\");\n}\n\n}  \/\/ namespace internal\n}  \/\/ namespace testing\n<commit_msg><commit_after>\/\/ Copyright 2007, 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\/\/ Author: wan@google.com (Zhanyong Wan)\n\n\/\/ Google Mock - a framework for writing C++ mock classes.\n\/\/\n\/\/ This file defines some utilities useful for implementing Google\n\/\/ Mock.  They are subject to change without notice, so please DO NOT\n\/\/ USE THEM IN USER CODE.\n\n#include \"gmock\/internal\/gmock-internal-utils.h\"\n\n#include <ctype.h>\n#include <ostream>  \/\/ NOLINT\n#include <string>\n#include \"gmock\/gmock.h\"\n#include \"gmock\/internal\/gmock-port.h\"\n#include \"gtest\/gtest.h\"\n\nnamespace testing {\nnamespace internal {\n\n\/\/ Joins a vector of strings as if they are fields of a tuple; returns\n\/\/ the joined string.\nGTEST_API_ std::string JoinAsTuple(const Strings& fields) {\n  switch (fields.size()) {\n    case 0:\n      return \"\";\n    case 1:\n      return fields[0];\n    default:\n      std::string result = \"(\" + fields[0];\n      for (size_t i = 1; i < fields.size(); i++) {\n        result += \", \";\n        result += fields[i];\n      }\n      result += \")\";\n      return result;\n  }\n}\n\n\/\/ Converts an identifier name to a space-separated list of lower-case\n\/\/ words.  Each maximum substring of the form [A-Za-z][a-z]*|\\d+ is\n\/\/ treated as one word.  For example, both \"FooBar123\" and\n\/\/ \"foo_bar_123\" are converted to \"foo bar 123\".\nGTEST_API_ std::string ConvertIdentifierNameToWords(const char* id_name) {\n  std::string result;\n  char prev_char = '\\0';\n  for (const char* p = id_name; *p != '\\0'; prev_char = *(p++)) {\n    \/\/ We don't care about the current locale as the input is\n    \/\/ guaranteed to be a valid C++ identifier name.\n    const bool starts_new_word = IsUpper(*p) ||\n        (!IsAlpha(prev_char) && IsLower(*p)) ||\n        (!IsDigit(prev_char) && IsDigit(*p));\n\n    if (IsAlNum(*p)) {\n      if (starts_new_word && result != \"\")\n        result += ' ';\n      result += ToLower(*p);\n    }\n  }\n  return result;\n}\n\n\/\/ This class reports Google Mock failures as Google Test failures.  A\n\/\/ user can define another class in a similar fashion if they intend to\n\/\/ use Google Mock with a testing framework other than Google Test.\nclass GoogleTestFailureReporter : public FailureReporterInterface {\n public:\n  virtual void ReportFailure(FailureType type, const char* file, int line,\n                             const std::string& message) {\n    AssertHelper(type == kFatal ?\n                 TestPartResult::kFatalFailure :\n                 TestPartResult::kNonFatalFailure,\n                 file,\n                 line,\n                 message.c_str()) = Message();\n    if (type == kFatal) {\n      posix::Abort();\n    }\n  }\n};\n\n\/\/ Returns the global failure reporter.  Will create a\n\/\/ GoogleTestFailureReporter and return it the first time called.\nGTEST_API_ FailureReporterInterface* GetFailureReporter() {\n  \/\/ Points to the global failure reporter used by Google Mock.  gcc\n  \/\/ guarantees that the following use of failure_reporter is\n  \/\/ thread-safe.  We may need to add additional synchronization to\n  \/\/ protect failure_reporter if we port Google Mock to other\n  \/\/ compilers.\n  static FailureReporterInterface* const failure_reporter =\n      new GoogleTestFailureReporter();\n  return failure_reporter;\n}\n\n\/\/ Protects global resources (stdout in particular) used by Log().\nstatic GTEST_DEFINE_STATIC_MUTEX_(g_log_mutex);\n\n\/\/ Returns true iff a log with the given severity is visible according\n\/\/ to the --gmock_verbose flag.\nGTEST_API_ bool LogIsVisible(LogSeverity severity) {\n  if (GMOCK_FLAG(verbose) == kInfoVerbosity) {\n    \/\/ Always show the log if --gmock_verbose=info.\n    return true;\n  } else if (GMOCK_FLAG(verbose) == kErrorVerbosity) {\n    \/\/ Always hide it if --gmock_verbose=error.\n    return false;\n  } else {\n    \/\/ If --gmock_verbose is neither \"info\" nor \"error\", we treat it\n    \/\/ as \"warning\" (its default value).\n    return severity == kWarning;\n  }\n}\n\n\/\/ Prints the given message to stdout iff 'severity' >= the level\n\/\/ specified by the --gmock_verbose flag.  If stack_frames_to_skip >=\n\/\/ 0, also prints the stack trace excluding the top\n\/\/ stack_frames_to_skip frames.  In opt mode, any positive\n\/\/ stack_frames_to_skip is treated as 0, since we don't know which\n\/\/ function calls will be inlined by the compiler and need to be\n\/\/ conservative.\nGTEST_API_ void Log(LogSeverity severity, const std::string& message,\n                    int stack_frames_to_skip) {\n  if (!LogIsVisible(severity))\n    return;\n\n  \/\/ Ensures that logs from different threads don't interleave.\n  MutexLock l(&g_log_mutex);\n\n  \/\/ \"using ::std::cout;\" doesn't work with Symbian's STLport, where cout is a\n  \/\/ macro.\n\n  if (severity == kWarning) {\n    \/\/ Prints a GMOCK WARNING marker to make the warnings easily searchable.\n    std::cout << \"\\nGMOCK WARNING:\";\n  }\n  \/\/ Pre-pends a new-line to message if it doesn't start with one.\n  if (message.empty() || message[0] != '\\n') {\n    std::cout << \"\\n\";\n  }\n  std::cout << message;\n  if (stack_frames_to_skip >= 0) {\n#ifdef NDEBUG\n    \/\/ In opt mode, we have to be conservative and skip no stack frame.\n    const int actual_to_skip = 0;\n#else\n    \/\/ In dbg mode, we can do what the caller tell us to do (plus one\n    \/\/ for skipping this function's stack frame).\n    const int actual_to_skip = stack_frames_to_skip + 1;\n#endif  \/\/ NDEBUG\n\n    \/\/ Appends a new-line to message if it doesn't end with one.\n    if (!message.empty() && *message.rbegin() != '\\n') {\n      std::cout << \"\\n\";\n    }\n    std::cout << \"Stack trace:\\n\"\n         << ::testing::internal::GetCurrentOsStackTraceExceptTop(\n             ::testing::UnitTest::GetInstance(), actual_to_skip);\n  }\n  std::cout << ::std::flush;\n}\n\nGTEST_API_ void IllegalDoDefault(const char* file, int line) {\n  internal::Assert(\n      false, file, line,\n      \"You are using DoDefault() inside a composite action like \"\n      \"DoAll() or WithArgs().  This is not supported for technical \"\n      \"reasons.  Please instead spell out the default action, or \"\n      \"assign the default action to an Action variable and use \"\n      \"the variable in various places.\");\n}\n\n}  \/\/ namespace internal\n}  \/\/ namespace testing\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: new.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: obo $ $Date: 2008-02-26 14:58: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#ifndef _SFXNEW_HXX\n#define _SFXNEW_HXX\n\n#ifndef _SAL_CONFIG_H_\n#include \"sal\/config.h\"\n#endif\n\n#ifndef INCLUDED_SFX2_DLLAPI_H\n#include \"sfx2\/dllapi.h\"\n#endif\n\n#ifndef _BUTTON_HXX \/\/autogen\n#include <vcl\/button.hxx>\n#endif\n#ifndef _LSTBOX_HXX \/\/autogen\n#include <vcl\/lstbox.hxx>\n#endif\n#ifndef _EDIT_HXX \/\/autogen\n#include <vcl\/edit.hxx>\n#endif\n#ifndef _FIXED_HXX \/\/autogen\n#include <vcl\/fixed.hxx>\n#endif\n#include <sfx2\/basedlgs.hxx>\n\n\/\/=========================================================================\n\nclass SfxObjectShellLock;\nclass SfxObjectShell;\nclass MoreButton;\n\n\/\/=========================================================================\n\n#define SFXWB_PREVIEW 0x0003\n#define SFXWB_LOAD_TEMPLATE 0x0004\n\n#define SFX_LOAD_TEXT_STYLES    0x0001\n#define SFX_LOAD_FRAME_STYLES   0x0002\n#define SFX_LOAD_PAGE_STYLES    0x0004\n#define SFX_LOAD_NUM_STYLES     0x0008\n#define SFX_MERGE_STYLES        0x0010\n\n#define RET_TEMPLATE_LOAD       100\n\nclass SFX2_DLLPUBLIC SfxPreviewWin: public Window\n{\n    SfxObjectShellLock &rDocShell;\nprotected:\n    virtual void    Paint( const Rectangle& rRect );\n    virtual void    DataChanged( const DataChangedEvent& rDCEvt );\n\n    \/** state whether a system setting for high contrast should be evaluated\n        and taken into account for this window.\n\n        The default implementation uses the accessibility option IsForDrawings\n      *\/\n    virtual bool    UseHighContrastSetting() const;\n\npublic:\n    SfxPreviewWin( Window* pParent,\n                   const ResId& rResId,\n                   SfxObjectShellLock &rDocSh );\n};\n\nclass SfxNewFileDialog_Impl;\nclass SFX2_DLLPUBLIC SfxNewFileDialog : public SfxModalDialog\n{\n    friend class SfxNewFileDialog_Impl;\n\nprivate:\n    SfxNewFileDialog_Impl* pImpl;\n\npublic:\n\n    SfxNewFileDialog(Window *pParent, USHORT nFlags = 0);\n    ~SfxNewFileDialog();\n\n        \/\/ Liefert FALSE, wenn '- Keine -' als Vorlage eingestellt ist\n        \/\/ Nur wenn IsTemplate() TRUE liefert, koennen Vorlagennamen\n        \/\/ erfragt werden\n    BOOL IsTemplate() const;\n    String GetTemplateRegion() const;\n    String GetTemplateName() const;\n    String GetTemplateFileName() const;\n\n    \/\/ load template methods\n    USHORT  GetTemplateFlags()const;\n    void    SetTemplateFlags(USHORT nSet);\n};\n\n#endif\n<commit_msg>INTEGRATION: CWS changefileheader (1.3.44); FILE MERGED 2008\/04\/01 15:38:28 thb 1.3.44.3: #i85898# Stripping all external header guards 2008\/04\/01 12:40:36 thb 1.3.44.2: #i85898# Stripping all external header guards 2008\/03\/31 13:37:56 rt 1.3.44.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: new.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#ifndef _SFXNEW_HXX\n#define _SFXNEW_HXX\n\n#include \"sal\/config.h\"\n#include \"sfx2\/dllapi.h\"\n\n#ifndef _BUTTON_HXX \/\/autogen\n#include <vcl\/button.hxx>\n#endif\n#ifndef _LSTBOX_HXX \/\/autogen\n#include <vcl\/lstbox.hxx>\n#endif\n#ifndef _EDIT_HXX \/\/autogen\n#include <vcl\/edit.hxx>\n#endif\n#ifndef _FIXED_HXX \/\/autogen\n#include <vcl\/fixed.hxx>\n#endif\n#include <sfx2\/basedlgs.hxx>\n\n\/\/=========================================================================\n\nclass SfxObjectShellLock;\nclass SfxObjectShell;\nclass MoreButton;\n\n\/\/=========================================================================\n\n#define SFXWB_PREVIEW 0x0003\n#define SFXWB_LOAD_TEMPLATE 0x0004\n\n#define SFX_LOAD_TEXT_STYLES    0x0001\n#define SFX_LOAD_FRAME_STYLES   0x0002\n#define SFX_LOAD_PAGE_STYLES    0x0004\n#define SFX_LOAD_NUM_STYLES     0x0008\n#define SFX_MERGE_STYLES        0x0010\n\n#define RET_TEMPLATE_LOAD       100\n\nclass SFX2_DLLPUBLIC SfxPreviewWin: public Window\n{\n    SfxObjectShellLock &rDocShell;\nprotected:\n    virtual void    Paint( const Rectangle& rRect );\n    virtual void    DataChanged( const DataChangedEvent& rDCEvt );\n\n    \/** state whether a system setting for high contrast should be evaluated\n        and taken into account for this window.\n\n        The default implementation uses the accessibility option IsForDrawings\n      *\/\n    virtual bool    UseHighContrastSetting() const;\n\npublic:\n    SfxPreviewWin( Window* pParent,\n                   const ResId& rResId,\n                   SfxObjectShellLock &rDocSh );\n};\n\nclass SfxNewFileDialog_Impl;\nclass SFX2_DLLPUBLIC SfxNewFileDialog : public SfxModalDialog\n{\n    friend class SfxNewFileDialog_Impl;\n\nprivate:\n    SfxNewFileDialog_Impl* pImpl;\n\npublic:\n\n    SfxNewFileDialog(Window *pParent, USHORT nFlags = 0);\n    ~SfxNewFileDialog();\n\n        \/\/ Liefert FALSE, wenn '- Keine -' als Vorlage eingestellt ist\n        \/\/ Nur wenn IsTemplate() TRUE liefert, koennen Vorlagennamen\n        \/\/ erfragt werden\n    BOOL IsTemplate() const;\n    String GetTemplateRegion() const;\n    String GetTemplateName() const;\n    String GetTemplateFileName() const;\n\n    \/\/ load template methods\n    USHORT  GetTemplateFlags()const;\n    void    SetTemplateFlags(USHORT nSet);\n};\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ DISCLAIMER\n\/\/\/\n\/\/\/ Copyright 2014-2017 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 \"RocksDBIndex.h\"\n#include \"Basics\/VelocyPackHelper.h\"\n#include \"Cache\/CacheManagerFeature.h\"\n#include \"Cache\/TransactionalCache.h\"\n#include \"Cache\/Common.h\"\n#include \"Cache\/Manager.h\"\n#include \"RocksDBEngine\/RocksDBCommon.h\"\n#include \"RocksDBEngine\/RocksDBComparator.h\"\n#include \"RocksDBEngine\/RocksDBEngine.h\"\n#include \"RocksDBEngine\/RocksDBTransactionState.h\"\n#include \"StorageEngine\/EngineSelectorFeature.h\"\n#include \"VocBase\/LogicalCollection.h\"\n#include \"VocBase\/ticks.h\"\n\nusing namespace arangodb;\nusing namespace arangodb::rocksutils;\n\nRocksDBIndex::RocksDBIndex(\n    TRI_idx_iid_t id, LogicalCollection* collection,\n    std::vector<std::vector<arangodb::basics::AttributeName>> const& attributes,\n    bool unique, bool sparse, uint64_t objectId, bool useCache)\n    : Index(id, collection, attributes, unique, sparse),\n      _objectId((objectId != 0) ? objectId : TRI_NewTickServer()),\n      _cmp(static_cast<RocksDBEngine*>(EngineSelectorFeature::ENGINE)->cmp()),\n      _cache(nullptr),\n      _cachePresent(false),\n      _useCache(useCache) {\n  if (_useCache) {\n    \/\/LOG_TOPIC(ERR, Logger::FIXME) << \"creating cache\";\n    createCache();\n  } else {\n    \/\/LOG_TOPIC(ERR, Logger::FIXME) << \"not creating cache\";\n  }\n\n}\n\nRocksDBIndex::RocksDBIndex(TRI_idx_iid_t id, LogicalCollection* collection,\n                           VPackSlice const& info, bool useCache)\n    : Index(id, collection, info),\n      _objectId(basics::VelocyPackHelper::stringUInt64(info.get(\"objectId\"))),\n      _cmp(static_cast<RocksDBEngine*>(EngineSelectorFeature::ENGINE)->cmp()),\n      _cache(nullptr),\n      _cachePresent(false),\n      _useCache(useCache) {\n  if (_objectId == 0) {\n    _objectId = TRI_NewTickServer();\n  }\n  if (_useCache) {\n    createCache();\n  }\n}\n\nRocksDBIndex::~RocksDBIndex() {\n  if (useCache()) {\n    try {\n      TRI_ASSERT(_cache != nullptr);\n      TRI_ASSERT(CacheManagerFeature::MANAGER != nullptr);\n      CacheManagerFeature::MANAGER->destroyCache(_cache);\n    } catch (...) {\n    }\n  }\n}\n\nvoid RocksDBIndex::toVelocyPackFigures(VPackBuilder& builder) const {\n  TRI_ASSERT(builder.isOpenObject());\n  builder.add(\"cacheSize\", VPackValue(useCache() ? _cache->size() : 0));\n}\n\nint RocksDBIndex::unload() {\n  if (useCache()) {\n    \/\/LOG_TOPIC(ERR, Logger::FIXME) << \"unload cache\";\n    disableCache();\n    TRI_ASSERT(!_cachePresent);\n  }\n  return TRI_ERROR_NO_ERROR;\n}\n\n\/\/\/ @brief return a VelocyPack representation of the index\nvoid RocksDBIndex::toVelocyPack(VPackBuilder& builder, bool withFigures,\n                                bool forPersistence) const {\n  Index::toVelocyPack(builder, withFigures, forPersistence);\n  if (forPersistence) {\n    \/\/ If we store it, it cannot be 0\n    TRI_ASSERT(_objectId != 0);\n    builder.add(\"objectId\", VPackValue(std::to_string(_objectId)));\n  }\n}\n\nvoid RocksDBIndex::createCache() {\n  if (!_useCache || _cachePresent) {\n    \/\/ we leave this if we do not need the cache\n    \/\/ or if cache already created\n    return;\n  }\n\n  TRI_ASSERT(_useCache);\n  TRI_ASSERT(_cache.get() == nullptr);\n  TRI_ASSERT(CacheManagerFeature::MANAGER != nullptr);\n  _cache = CacheManagerFeature::MANAGER->createCache(\n      cache::CacheType::Transactional);\n  _cachePresent = (_cache.get() != nullptr);\n  TRI_ASSERT(_useCache);\n}\n\nvoid RocksDBIndex::disableCache() {\n  if (!_cachePresent) {\n    return;\n  }\n  TRI_ASSERT(CacheManagerFeature::MANAGER != nullptr);\n  \/\/ must have a cache...\n  TRI_ASSERT(_useCache);\n  TRI_ASSERT(_cachePresent);\n  TRI_ASSERT(_cache.get() != nullptr);\n  CacheManagerFeature::MANAGER->destroyCache(_cache);\n  _cache.reset();\n  _cachePresent = false;\n  TRI_ASSERT(_useCache);\n}\n\nint RocksDBIndex::drop() {\n  \/\/ Try to drop the cache as well.\n  if (_cachePresent) {\n    try {\n      TRI_ASSERT(_cachePresent);\n      TRI_ASSERT(CacheManagerFeature::MANAGER != nullptr);\n      CacheManagerFeature::MANAGER->destroyCache(_cache);\n      \/\/ Reset flag\n      _cache.reset();\n      _cachePresent = false;\n    } catch (...) {\n    }\n  }\n  return TRI_ERROR_NO_ERROR;\n}\n\nvoid RocksDBIndex::truncate(transaction::Methods* trx) {\n  RocksDBTransactionState* state = rocksutils::toRocksTransactionState(trx);\n  rocksdb::Transaction* rtrx = state->rocksTransaction();\n  RocksDBKeyBounds indexBounds = getBounds();\n\n  rocksdb::ReadOptions options = state->readOptions();\n  options.iterate_upper_bound = &(indexBounds.end());\n\n  std::unique_ptr<rocksdb::Iterator> iter(rtrx->GetIterator(options));\n  iter->Seek(indexBounds.start());\n\n  while (iter->Valid()) {\n    rocksdb::Status s = rtrx->Delete(iter->key());\n    if (!s.ok()) {\n      auto converted = convertStatus(s);\n      THROW_ARANGO_EXCEPTION(converted);\n    }\n\n    Result r = postprocessRemove(trx, iter->key(), iter->value());\n    if (!r.ok()) {\n      THROW_ARANGO_EXCEPTION(r);\n    }\n\n    iter->Next();\n  }\n}\n\nResult RocksDBIndex::postprocessRemove(transaction::Methods* trx,\n                                       rocksdb::Slice const& key,\n                                      rocksdb::Slice const& value) {\n  return {TRI_ERROR_NO_ERROR};\n}\n\n\n\/\/ blacklist given key from transactional cache\nvoid RocksDBIndex::blackListKey(char const* data, std::size_t len){\n  if (useCache()) {\n    TRI_ASSERT(_cache != nullptr);\n    bool blacklisted = false;\n    uint64_t attempts = 0;\n    while (!blacklisted) {\n      blacklisted = _cache->blacklist(data, (uint32_t)len);\n      if (attempts++ % 10 == 0) {\n        if (_cache->isShutdown()) {\n          disableCache();\n          break;\n        }\n      }\n    }\n  }\n}\n\nRocksDBKeyBounds RocksDBIndex::getBounds() const {\n  switch (type()) {\n    case RocksDBIndex::TRI_IDX_TYPE_PRIMARY_INDEX:\n      return RocksDBKeyBounds::PrimaryIndex(objectId());\n    case RocksDBIndex::TRI_IDX_TYPE_EDGE_INDEX:\n      return RocksDBKeyBounds::EdgeIndex(objectId());\n    case RocksDBIndex::TRI_IDX_TYPE_HASH_INDEX:\n    case RocksDBIndex::TRI_IDX_TYPE_SKIPLIST_INDEX:\n    case RocksDBIndex::TRI_IDX_TYPE_PERSISTENT_INDEX:\n      if (unique()) {\n        return RocksDBKeyBounds::UniqueIndex(objectId());\n      }\n      return RocksDBKeyBounds::IndexEntries(objectId());\n    case RocksDBIndex::TRI_IDX_TYPE_FULLTEXT_INDEX:\n      return RocksDBKeyBounds::FulltextIndex(objectId());\n    case RocksDBIndex::TRI_IDX_TYPE_GEO1_INDEX:\n    case RocksDBIndex::TRI_IDX_TYPE_GEO2_INDEX:\n      return RocksDBKeyBounds::GeoIndex(objectId());\n    case RocksDBIndex::TRI_IDX_TYPE_UNKNOWN:\n    default:\n      THROW_ARANGO_EXCEPTION(TRI_ERROR_NOT_IMPLEMENTED);\n  }\n}\n<commit_msg>exose cache hit rate for rocksdb caches<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ DISCLAIMER\n\/\/\/\n\/\/\/ Copyright 2014-2017 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 \"RocksDBIndex.h\"\n#include \"Basics\/VelocyPackHelper.h\"\n#include \"Cache\/CacheManagerFeature.h\"\n#include \"Cache\/TransactionalCache.h\"\n#include \"Cache\/Common.h\"\n#include \"Cache\/Manager.h\"\n#include \"RocksDBEngine\/RocksDBCommon.h\"\n#include \"RocksDBEngine\/RocksDBComparator.h\"\n#include \"RocksDBEngine\/RocksDBEngine.h\"\n#include \"RocksDBEngine\/RocksDBTransactionState.h\"\n#include \"StorageEngine\/EngineSelectorFeature.h\"\n#include \"VocBase\/LogicalCollection.h\"\n#include \"VocBase\/ticks.h\"\n\nusing namespace arangodb;\nusing namespace arangodb::rocksutils;\n\nRocksDBIndex::RocksDBIndex(\n    TRI_idx_iid_t id, LogicalCollection* collection,\n    std::vector<std::vector<arangodb::basics::AttributeName>> const& attributes,\n    bool unique, bool sparse, uint64_t objectId, bool useCache)\n    : Index(id, collection, attributes, unique, sparse),\n      _objectId((objectId != 0) ? objectId : TRI_NewTickServer()),\n      _cmp(static_cast<RocksDBEngine*>(EngineSelectorFeature::ENGINE)->cmp()),\n      _cache(nullptr),\n      _cachePresent(false),\n      _useCache(useCache) {\n  if (_useCache) {\n    \/\/LOG_TOPIC(ERR, Logger::FIXME) << \"creating cache\";\n    createCache();\n  } else {\n    \/\/LOG_TOPIC(ERR, Logger::FIXME) << \"not creating cache\";\n  }\n\n}\n\nRocksDBIndex::RocksDBIndex(TRI_idx_iid_t id, LogicalCollection* collection,\n                           VPackSlice const& info, bool useCache)\n    : Index(id, collection, info),\n      _objectId(basics::VelocyPackHelper::stringUInt64(info.get(\"objectId\"))),\n      _cmp(static_cast<RocksDBEngine*>(EngineSelectorFeature::ENGINE)->cmp()),\n      _cache(nullptr),\n      _cachePresent(false),\n      _useCache(useCache) {\n  if (_objectId == 0) {\n    _objectId = TRI_NewTickServer();\n  }\n  if (_useCache) {\n    createCache();\n  }\n}\n\nRocksDBIndex::~RocksDBIndex() {\n  if (useCache()) {\n    try {\n      TRI_ASSERT(_cache != nullptr);\n      TRI_ASSERT(CacheManagerFeature::MANAGER != nullptr);\n      CacheManagerFeature::MANAGER->destroyCache(_cache);\n    } catch (...) {\n    }\n  }\n}\n\nvoid RocksDBIndex::toVelocyPackFigures(VPackBuilder& builder) const {\n  TRI_ASSERT(builder.isOpenObject());\n  if(useCache()){\n    builder.add(\"cacheSize\", VPackValue(_cache->size()));\n    builder.add(\"liftimeHitRate\", VPackValue(_cache->hitRates().first));\n    builder.add(\"windowHitRate\", VPackValue(_cache->hitRates().second));\n  } else {\n    builder.add(\"cacheSize\", VPackValue(0));\n  }\n}\n\nint RocksDBIndex::unload() {\n  if (useCache()) {\n    \/\/LOG_TOPIC(ERR, Logger::FIXME) << \"unload cache\";\n    disableCache();\n    TRI_ASSERT(!_cachePresent);\n  }\n  return TRI_ERROR_NO_ERROR;\n}\n\n\/\/\/ @brief return a VelocyPack representation of the index\nvoid RocksDBIndex::toVelocyPack(VPackBuilder& builder, bool withFigures,\n                                bool forPersistence) const {\n  Index::toVelocyPack(builder, withFigures, forPersistence);\n  if (forPersistence) {\n    \/\/ If we store it, it cannot be 0\n    TRI_ASSERT(_objectId != 0);\n    builder.add(\"objectId\", VPackValue(std::to_string(_objectId)));\n  }\n}\n\nvoid RocksDBIndex::createCache() {\n  if (!_useCache || _cachePresent) {\n    \/\/ we leave this if we do not need the cache\n    \/\/ or if cache already created\n    return;\n  }\n\n  TRI_ASSERT(_useCache);\n  TRI_ASSERT(_cache.get() == nullptr);\n  TRI_ASSERT(CacheManagerFeature::MANAGER != nullptr);\n  _cache = CacheManagerFeature::MANAGER->createCache(\n      cache::CacheType::Transactional);\n  _cachePresent = (_cache.get() != nullptr);\n  TRI_ASSERT(_useCache);\n}\n\nvoid RocksDBIndex::disableCache() {\n  if (!_cachePresent) {\n    return;\n  }\n  TRI_ASSERT(CacheManagerFeature::MANAGER != nullptr);\n  \/\/ must have a cache...\n  TRI_ASSERT(_useCache);\n  TRI_ASSERT(_cachePresent);\n  TRI_ASSERT(_cache.get() != nullptr);\n  CacheManagerFeature::MANAGER->destroyCache(_cache);\n  _cache.reset();\n  _cachePresent = false;\n  TRI_ASSERT(_useCache);\n}\n\nint RocksDBIndex::drop() {\n  \/\/ Try to drop the cache as well.\n  if (_cachePresent) {\n    try {\n      TRI_ASSERT(_cachePresent);\n      TRI_ASSERT(CacheManagerFeature::MANAGER != nullptr);\n      CacheManagerFeature::MANAGER->destroyCache(_cache);\n      \/\/ Reset flag\n      _cache.reset();\n      _cachePresent = false;\n    } catch (...) {\n    }\n  }\n  return TRI_ERROR_NO_ERROR;\n}\n\nvoid RocksDBIndex::truncate(transaction::Methods* trx) {\n  RocksDBTransactionState* state = rocksutils::toRocksTransactionState(trx);\n  rocksdb::Transaction* rtrx = state->rocksTransaction();\n  RocksDBKeyBounds indexBounds = getBounds();\n\n  rocksdb::ReadOptions options = state->readOptions();\n  options.iterate_upper_bound = &(indexBounds.end());\n\n  std::unique_ptr<rocksdb::Iterator> iter(rtrx->GetIterator(options));\n  iter->Seek(indexBounds.start());\n\n  while (iter->Valid()) {\n    rocksdb::Status s = rtrx->Delete(iter->key());\n    if (!s.ok()) {\n      auto converted = convertStatus(s);\n      THROW_ARANGO_EXCEPTION(converted);\n    }\n\n    Result r = postprocessRemove(trx, iter->key(), iter->value());\n    if (!r.ok()) {\n      THROW_ARANGO_EXCEPTION(r);\n    }\n\n    iter->Next();\n  }\n}\n\nResult RocksDBIndex::postprocessRemove(transaction::Methods* trx,\n                                       rocksdb::Slice const& key,\n                                      rocksdb::Slice const& value) {\n  return {TRI_ERROR_NO_ERROR};\n}\n\n\n\/\/ blacklist given key from transactional cache\nvoid RocksDBIndex::blackListKey(char const* data, std::size_t len){\n  if (useCache()) {\n    TRI_ASSERT(_cache != nullptr);\n    bool blacklisted = false;\n    uint64_t attempts = 0;\n    while (!blacklisted) {\n      blacklisted = _cache->blacklist(data, (uint32_t)len);\n      if (attempts++ % 10 == 0) {\n        if (_cache->isShutdown()) {\n          disableCache();\n          break;\n        }\n      }\n    }\n  }\n}\n\nRocksDBKeyBounds RocksDBIndex::getBounds() const {\n  switch (type()) {\n    case RocksDBIndex::TRI_IDX_TYPE_PRIMARY_INDEX:\n      return RocksDBKeyBounds::PrimaryIndex(objectId());\n    case RocksDBIndex::TRI_IDX_TYPE_EDGE_INDEX:\n      return RocksDBKeyBounds::EdgeIndex(objectId());\n    case RocksDBIndex::TRI_IDX_TYPE_HASH_INDEX:\n    case RocksDBIndex::TRI_IDX_TYPE_SKIPLIST_INDEX:\n    case RocksDBIndex::TRI_IDX_TYPE_PERSISTENT_INDEX:\n      if (unique()) {\n        return RocksDBKeyBounds::UniqueIndex(objectId());\n      }\n      return RocksDBKeyBounds::IndexEntries(objectId());\n    case RocksDBIndex::TRI_IDX_TYPE_FULLTEXT_INDEX:\n      return RocksDBKeyBounds::FulltextIndex(objectId());\n    case RocksDBIndex::TRI_IDX_TYPE_GEO1_INDEX:\n    case RocksDBIndex::TRI_IDX_TYPE_GEO2_INDEX:\n      return RocksDBKeyBounds::GeoIndex(objectId());\n    case RocksDBIndex::TRI_IDX_TYPE_UNKNOWN:\n    default:\n      THROW_ARANGO_EXCEPTION(TRI_ERROR_NOT_IMPLEMENTED);\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n* Copyright(c) 2014, Phil Sampson (http:\/\/www.zamma.co.uk)\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 \"tilemap.h\"\n#include \"game.h\"\n#include \"light.h\"\n#include \"logger.h\"\n#include \"shader.h\"\n#include \"tinyxml2.h\"\n#include \"util.h\"\n#include \"window.h\"\n#include <fstream>\n#include <iostream>\n\nusing namespace tinyxml2;\nusing namespace ZEGL;\n\nTile::Tile(const Texture& texture, const Texture& normalMap, const TextureAtlas& textureAtlas,\n\tconst glm::vec3& pos, float rot, float scale) :\n\tm_tileSize(scale),\n\tRenderEntity(texture, normalMap, textureAtlas, pos, rot, scale)\n{\n}\n\nTile::Tile(const Texture& texture, const Texture& normalMap, const glm::vec2 textureCoords[4],\n\tconst glm::vec3& pos, float rot, float scale) :\n\tm_tileSize(scale),\n\tRenderEntity(texture, normalMap, textureCoords, pos, rot, scale)\n{\n}\n\nTile::Tile(const Tile& tile) :\n\tm_tileSize(tile.m_tileSize),\n\tRenderEntity(tile) {}\n\nTileMap::TileMap(const std::string& fileName) :\n\tm_VAO(0),\n\tm_VAB(0),\n\tm_bytesAllocated(0)\n{\n\tLoad(fileName);\n\n\tglGenVertexArrays(1, &m_VAO);\n\tglBindVertexArray(m_VAO);\n\n\tglGenBuffers(1, &m_VAB);\n\tglBindBuffer(GL_ARRAY_BUFFER, m_VAB);\n\n\tglEnableVertexAttribArray(0); \/\/ pos\n\tglEnableVertexAttribArray(1); \/\/ size\n\tglEnableVertexAttribArray(2); \/\/ texCoords0\n\tglEnableVertexAttribArray(3); \/\/ texCoords1\n\tglEnableVertexAttribArray(4); \/\/ texCoords2\n\tglEnableVertexAttribArray(5); \/\/ texCoords3\n\n\tglVertexAttribPointer(0, 3, GL_FLOAT, GL_FALSE, sizeof(EntityData), (GLvoid*)0);\n\tglVertexAttribPointer(1, 1, GL_FLOAT, GL_FALSE, sizeof(EntityData), (GLvoid*)16);\n\tglVertexAttribPointer(2, 2, GL_FLOAT, GL_FALSE, sizeof(EntityData), (GLvoid*)20);\n\tglVertexAttribPointer(3, 2, GL_FLOAT, GL_FALSE, sizeof(EntityData), (GLvoid*)28);\n\tglVertexAttribPointer(4, 2, GL_FLOAT, GL_FALSE, sizeof(EntityData), (GLvoid*)36);\n\tglVertexAttribPointer(5, 2, GL_FLOAT, GL_FALSE, sizeof(EntityData), (GLvoid*)44);\n\n\tglVertexAttribDivisor(0, 1);\n\tglVertexAttribDivisor(1, 1);\n\tglVertexAttribDivisor(2, 1);\n\tglVertexAttribDivisor(3, 1);\n\tglVertexAttribDivisor(4, 1);\n\tglVertexAttribDivisor(5, 1);\n\n\tglBindBuffer(GL_ARRAY_BUFFER, 0);\n\tglBindVertexArray(0);\n}\n\nTileMap::~TileMap()\n{\n\tglDeleteBuffers(1, &m_VAB);\n\tglDeleteVertexArrays(1, &m_VAO);\n}\n\nvoid TileMap::Load(const std::string& fileName)\n{\n\tbool success = true;\n\tstd::string error;\n\n\tXMLDocument doc;\n\tif (doc.LoadFile((fileName + \".tdef\").c_str()) != XML_NO_ERROR)\n\t{\n\t\tsuccess = false;\n\t\terror = \"Failed loading tile definitions: \" + fileName + \".tdef\";\n\t}\n\telse\n\t{\n\t\tXMLElement* tileElement = doc.FirstChildElement(\"Tile\");\n\t\tif (tileElement == nullptr)\n\t\t{\n\t\t\tsuccess = false;\n\t\t\terror = \"No Tiles defined.\";\n\t\t}\n\t\telse\n\t\t{\n\t\t\tstd::unordered_map<std::string, TileDefinition> m_tileDefs;\n\n\t\t\twhile (tileElement != nullptr)\n\t\t\t{\n\t\t\t\tstd::string tileId;\n\t\t\t\tTileDefinition tileDef;\n\n\t\t\t\ttileId = tileElement->Attribute(\"id\");\n\t\t\t\ttileDef.tilename = tileElement->Attribute(\"name\");\n\t\t\t\ttileDef.textureName = tileElement->Attribute(\"texture\");\n\t\t\t\ttileDef.normalMapName = tileElement->Attribute(\"normalMap\");\n\t\t\t\ttileDef.textureAtlasName = tileElement->Attribute(\"textureAtlas\");\n\n\t\t\t\tm_tileDefs.insert(std::pair<std::string, TileDefinition>(tileId, tileDef));\n\n\t\t\t\ttileElement = tileElement->NextSiblingElement();\n\t\t\t}\n\n\t\t\tstd::ifstream file;\n\t\t\tfile.open((fileName).c_str());\n\n\t\t\tstd::string line;\n\n\t\t\tif (file.is_open())\n\t\t\t{\n\t\t\t\tfloat x = DEFAULT_TILE_SIZE \/ 2;\n\t\t\t\tfloat y = x;\n\n\t\t\t\twhile (file.good())\n\t\t\t\t{\n\t\t\t\t\tgetline(file, line);\n\t\t\t\t\n\t\t\t\t\tstd::vector<std::string> tiles = Util::SplitString(line, ',');\n\t\t\t\t\tfor (unsigned int i = 0; i < tiles.size(); i++)\n\t\t\t\t\t{\n\t\t\t\t\t\tstd::unordered_map<std::string, TileDefinition>::const_iterator it = m_tileDefs.find(tiles[i]);\n\t\t\t\t\t\tif (it != m_tileDefs.end())\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tTexture texture(it->second.textureName);\n\t\t\t\t\t\t\tTexture textureNormal(it->second.normalMapName);\n\t\t\t\t\t\t\tTextureAtlas textureAtlas(it->second.textureAtlasName);\n\n\t\t\t\t\t\t\tm_map.push_back(Tile(texture, textureNormal, textureAtlas, glm::vec3(x, y, 0.0f), 0.0f, DEFAULT_TILE_SIZE));\n\t\t\t\t\t\t\tm_map[m_map.size() - 1].CalcTextureCoords(tiles[i]);\n\n\t\t\t\t\t\t\tx += DEFAULT_TILE_SIZE;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\/\/TODO: Handle error\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tx = DEFAULT_TILE_SIZE \/ 2;\n\t\t\t\t\ty += DEFAULT_TILE_SIZE;\n\t\t\t\t}\n\n\t\t\t\tfor (unsigned int i = 0; i < m_map.size(); i++)\n\t\t\t\t{\n\t\t\t\t\tm_map[i].CalcTextureCoords(\"rock\");\n\t\t\t\t\tm_activeTiles.push_back(m_map[i]);\n\t\t\t\t\tm_activeTilesData.push_back(m_map[i].GetData());\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tstd::cerr << \"Unable to load tile map: \" << fileName << std::endl;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (!success)\n\t{\n\t\tLOG_ERROR(error.c_str())\n\t\tLOG_CLOSE();\n\t\texit(1);\n\t}\n}\n\nvoid TileMap::Update(const Window* window, const glm::vec3& cameraPos)\n{\n\tm_activeTiles.clear();\n\tm_activeTilesData.clear();\n\t\n\tfor (unsigned int i = 0; i < m_map.size(); i++)\n\t{\n\t\tglm::vec3 pos = m_map[i].GetPos();\n\n\t\tif (pos.x > cameraPos.x - DEFAULT_TILE_SIZE && pos.x < cameraPos.x + (float)window->GetWidth() + DEFAULT_TILE_SIZE &&\n\t\t\tpos.y > cameraPos.y - DEFAULT_TILE_SIZE && pos.y < cameraPos.y + (float)window->GetHeight() + DEFAULT_TILE_SIZE)\n\t\t{\n\t\t\tm_activeTiles.push_back(m_map[i]);\n\t\t\tm_activeTilesData.push_back(m_map[i].GetData());\n\t\t}\n\t}\n\n\tglBindBuffer(GL_ARRAY_BUFFER, m_VAB);\n\tsize_t bytesNeeded = sizeof(EntityData) * m_activeTilesData.size();\n\tif (bytesNeeded > m_bytesAllocated) {\n\t\tglBufferData(GL_ARRAY_BUFFER, bytesNeeded, &m_activeTilesData[0], GL_STREAM_DRAW);\n\t\tm_bytesAllocated = bytesNeeded;\n\t}\n\telse {\n\t\tglBufferSubData(GL_ARRAY_BUFFER, 0, bytesNeeded, &m_activeTilesData[0]);\n\t}\n\tglBindBuffer(GL_ARRAY_BUFFER, 0);\n}\n\nvoid TileMap::Render(Game* game)\n{\n\tTexture texture = m_activeTiles[0].GetTexture();\n\tTexture normalMap = m_activeTiles[0].GetNormalMap();\n\n\tShader shader = game->GetActiveLight()->GetShader();\n\n\tshader.Bind();\n\tshader.UpdateUniforms(game);\n\n\ttexture.Bind(0);\n\tnormalMap.Bind(1);\n\n\tglBindVertexArray(m_VAO);\n\tglDrawArraysInstanced(GL_TRIANGLE_STRIP, 0, 4, 16);\n\tglBindVertexArray(0);\n\n\tshader.UnBind();\n}<commit_msg>Cleanup VAO and VBO in TileMap<commit_after>\/**\n* Copyright(c) 2014, Phil Sampson (http:\/\/www.zamma.co.uk)\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 \"tilemap.h\"\n#include \"game.h\"\n#include \"light.h\"\n#include \"logger.h\"\n#include \"shader.h\"\n#include \"tinyxml2.h\"\n#include \"util.h\"\n#include \"window.h\"\n#include <fstream>\n#include <iostream>\n\nusing namespace tinyxml2;\nusing namespace ZEGL;\n\nTile::Tile(const Texture& texture, const Texture& normalMap, const TextureAtlas& textureAtlas,\n\tconst glm::vec3& pos, float rot, float scale) :\n\tm_tileSize(scale),\n\tRenderEntity(texture, normalMap, textureAtlas, pos, rot, scale)\n{\n}\n\nTile::Tile(const Texture& texture, const Texture& normalMap, const glm::vec2 textureCoords[4],\n\tconst glm::vec3& pos, float rot, float scale) :\n\tm_tileSize(scale),\n\tRenderEntity(texture, normalMap, textureCoords, pos, rot, scale)\n{\n}\n\nTile::Tile(const Tile& tile) :\n\tm_tileSize(tile.m_tileSize),\n\tRenderEntity(tile) {}\n\nTileMap::TileMap(const std::string& fileName) :\n\tm_VAO(0),\n\tm_VAB(0),\n\tm_bytesAllocated(0)\n{\n\tLoad(fileName);\n\n\tglGenVertexArrays(1, &m_VAO);\n\tglBindVertexArray(m_VAO);\n\n\tglGenBuffers(1, &m_VAB);\n\tglBindBuffer(GL_ARRAY_BUFFER, m_VAB);\n\n\tglEnableVertexAttribArray(0); \/\/ pos\n\tglEnableVertexAttribArray(1); \/\/ size\n\tglEnableVertexAttribArray(2); \/\/ texCoords0\n\tglEnableVertexAttribArray(3); \/\/ texCoords1\n\tglEnableVertexAttribArray(4); \/\/ texCoords2\n\tglEnableVertexAttribArray(5); \/\/ texCoords3\n\n\tglVertexAttribPointer(0, 3, GL_FLOAT, GL_FALSE, sizeof(EntityData), (GLvoid*)0);\n\tglVertexAttribPointer(1, 1, GL_FLOAT, GL_FALSE, sizeof(EntityData), (GLvoid*)16);\n\tglVertexAttribPointer(2, 2, GL_FLOAT, GL_FALSE, sizeof(EntityData), (GLvoid*)20);\n\tglVertexAttribPointer(3, 2, GL_FLOAT, GL_FALSE, sizeof(EntityData), (GLvoid*)28);\n\tglVertexAttribPointer(4, 2, GL_FLOAT, GL_FALSE, sizeof(EntityData), (GLvoid*)36);\n\tglVertexAttribPointer(5, 2, GL_FLOAT, GL_FALSE, sizeof(EntityData), (GLvoid*)44);\n\n\tglVertexAttribDivisor(0, 1);\n\tglVertexAttribDivisor(1, 1);\n\tglVertexAttribDivisor(2, 1);\n\tglVertexAttribDivisor(3, 1);\n\tglVertexAttribDivisor(4, 1);\n\tglVertexAttribDivisor(5, 1);\n\n\tglBindBuffer(GL_ARRAY_BUFFER, 0);\n\tglBindVertexArray(0);\n}\n\nTileMap::~TileMap()\n{\n\tif (m_VAB)\n\t{\n\t\tglDeleteBuffers(1, &m_VAB);\n\t}\n\tif (m_VAO)\n\t{\n\t\tglBindVertexArray(0);\n\t\tglDeleteVertexArrays(1, &m_VAO);\n\t}\n}\n\nvoid TileMap::Load(const std::string& fileName)\n{\n\tbool success = true;\n\tstd::string error;\n\n\tXMLDocument doc;\n\tif (doc.LoadFile((fileName + \".tdef\").c_str()) != XML_NO_ERROR)\n\t{\n\t\tsuccess = false;\n\t\terror = \"Failed loading tile definitions: \" + fileName + \".tdef\";\n\t}\n\telse\n\t{\n\t\tXMLElement* tileElement = doc.FirstChildElement(\"Tile\");\n\t\tif (tileElement == nullptr)\n\t\t{\n\t\t\tsuccess = false;\n\t\t\terror = \"No Tiles defined.\";\n\t\t}\n\t\telse\n\t\t{\n\t\t\tstd::unordered_map<std::string, TileDefinition> m_tileDefs;\n\n\t\t\twhile (tileElement != nullptr)\n\t\t\t{\n\t\t\t\tstd::string tileId;\n\t\t\t\tTileDefinition tileDef;\n\n\t\t\t\ttileId = tileElement->Attribute(\"id\");\n\t\t\t\ttileDef.tilename = tileElement->Attribute(\"name\");\n\t\t\t\ttileDef.textureName = tileElement->Attribute(\"texture\");\n\t\t\t\ttileDef.normalMapName = tileElement->Attribute(\"normalMap\");\n\t\t\t\ttileDef.textureAtlasName = tileElement->Attribute(\"textureAtlas\");\n\n\t\t\t\tm_tileDefs.insert(std::pair<std::string, TileDefinition>(tileId, tileDef));\n\n\t\t\t\ttileElement = tileElement->NextSiblingElement();\n\t\t\t}\n\n\t\t\tstd::ifstream file;\n\t\t\tfile.open((fileName).c_str());\n\n\t\t\tstd::string line;\n\n\t\t\tif (file.is_open())\n\t\t\t{\n\t\t\t\tfloat x = DEFAULT_TILE_SIZE \/ 2;\n\t\t\t\tfloat y = x;\n\n\t\t\t\twhile (file.good())\n\t\t\t\t{\n\t\t\t\t\tgetline(file, line);\n\t\t\t\t\n\t\t\t\t\tstd::vector<std::string> tiles = Util::SplitString(line, ',');\n\t\t\t\t\tfor (unsigned int i = 0; i < tiles.size(); i++)\n\t\t\t\t\t{\n\t\t\t\t\t\tstd::unordered_map<std::string, TileDefinition>::const_iterator it = m_tileDefs.find(tiles[i]);\n\t\t\t\t\t\tif (it != m_tileDefs.end())\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tTexture texture(it->second.textureName);\n\t\t\t\t\t\t\tTexture textureNormal(it->second.normalMapName);\n\t\t\t\t\t\t\tTextureAtlas textureAtlas(it->second.textureAtlasName);\n\n\t\t\t\t\t\t\tm_map.push_back(Tile(texture, textureNormal, textureAtlas, glm::vec3(x, y, 0.0f), 0.0f, DEFAULT_TILE_SIZE));\n\t\t\t\t\t\t\tm_map[m_map.size() - 1].CalcTextureCoords(tiles[i]);\n\n\t\t\t\t\t\t\tx += DEFAULT_TILE_SIZE;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\/\/TODO: Handle error\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tx = DEFAULT_TILE_SIZE \/ 2;\n\t\t\t\t\ty += DEFAULT_TILE_SIZE;\n\t\t\t\t}\n\n\t\t\t\tfor (unsigned int i = 0; i < m_map.size(); i++)\n\t\t\t\t{\n\t\t\t\t\tm_map[i].CalcTextureCoords(\"rock\");\n\t\t\t\t\tm_activeTiles.push_back(m_map[i]);\n\t\t\t\t\tm_activeTilesData.push_back(m_map[i].GetData());\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tstd::cerr << \"Unable to load tile map: \" << fileName << std::endl;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (!success)\n\t{\n\t\tLOG_ERROR(error.c_str())\n\t\tLOG_CLOSE();\n\t\texit(1);\n\t}\n}\n\nvoid TileMap::Update(const Window* window, const glm::vec3& cameraPos)\n{\n\tm_activeTiles.clear();\n\tm_activeTilesData.clear();\n\t\n\tfor (unsigned int i = 0; i < m_map.size(); i++)\n\t{\n\t\tglm::vec3 pos = m_map[i].GetPos();\n\n\t\tif (pos.x > cameraPos.x - DEFAULT_TILE_SIZE && pos.x < cameraPos.x + (float)window->GetWidth() + DEFAULT_TILE_SIZE &&\n\t\t\tpos.y > cameraPos.y - DEFAULT_TILE_SIZE && pos.y < cameraPos.y + (float)window->GetHeight() + DEFAULT_TILE_SIZE)\n\t\t{\n\t\t\tm_activeTiles.push_back(m_map[i]);\n\t\t\tm_activeTilesData.push_back(m_map[i].GetData());\n\t\t}\n\t}\n\n\tglBindBuffer(GL_ARRAY_BUFFER, m_VAB);\n\tsize_t bytesNeeded = sizeof(EntityData) * m_activeTilesData.size();\n\tif (bytesNeeded > m_bytesAllocated) {\n\t\tglBufferData(GL_ARRAY_BUFFER, bytesNeeded, &m_activeTilesData[0], GL_STREAM_DRAW);\n\t\tm_bytesAllocated = bytesNeeded;\n\t}\n\telse {\n\t\tglBufferSubData(GL_ARRAY_BUFFER, 0, bytesNeeded, &m_activeTilesData[0]);\n\t}\n\tglBindBuffer(GL_ARRAY_BUFFER, 0);\n}\n\nvoid TileMap::Render(Game* game)\n{\n\tTexture texture = m_activeTiles[0].GetTexture();\n\tTexture normalMap = m_activeTiles[0].GetNormalMap();\n\n\tShader shader = game->GetActiveLight()->GetShader();\n\n\tshader.Bind();\n\tshader.UpdateUniforms(game);\n\n\ttexture.Bind(0);\n\tnormalMap.Bind(1);\n\n\tglBindVertexArray(m_VAO);\n\tglDrawArraysInstanced(GL_TRIANGLE_STRIP, 0, 4, 16);\n\tglBindVertexArray(0);\n\n\tshader.UnBind();\n}<|endoftext|>"}
{"text":"<commit_before>\/\/ REQUIRES: shell\n\/\/\n\/\/ RUN: rm -rf %t\n\/\/ RUN: mkdir %t\n\/\/ RUN: cd %t\n\n\/\/ ----------------------\n\/\/ Build modules A and B.\n\/\/ RUN: %clang_cc1 -x c++ -std=c++11 -fmodules -fmodules-cache-path=%t -Rmodule-build -fno-modules-error-recovery \\\n\/\/ RUN:            -fmodule-name=a -emit-module %S\/Inputs\/explicit-build\/module.modulemap -o a.pcm\n\/\/\n\/\/ RUN: %clang_cc1 -x c++ -std=c++11 -fmodules -fmodules-cache-path=%t -Rmodule-build -fno-modules-error-recovery \\\n\/\/ RUN:            -fmodule-file=a.pcm \\\n\/\/ RUN:            -fmodule-name=b -emit-module %S\/Inputs\/explicit-build\/module.modulemap -o b-rel.pcm\n\/\/\n\/\/ RUN: %clang_cc1 -x c++ -std=c++11 -fmodules -fmodules-cache-path=%t -Rmodule-build -fno-modules-error-recovery \\\n\/\/ RUN:            -fmodule-file=%t\/a.pcm \\\n\/\/ RUN:            -fmodule-name=b -emit-module %S\/Inputs\/explicit-build\/module.modulemap -o b-abs.pcm\n\n\/\/ ------------------------------------------\n\/\/ Mix and match relative and absolute paths.\n\/\/ RUN: %clang_cc1 -x c++ -std=c++11 -fmodules -fmodules-cache-path=%t -Rmodule-build -fno-modules-error-recovery \\\n\/\/ RUN:            -I%S\/Inputs\/explicit-build \\\n\/\/ RUN:            -fmodule-file=%t\/a.pcm \\\n\/\/ RUN:            -fmodule-file=a.pcm \\\n\/\/ RUN:            -verify %s\n\/\/\n\/\/ RUN: %clang_cc1 -x c++ -std=c++11 -fmodules -fmodules-cache-path=%t -Rmodule-build -fno-modules-error-recovery \\\n\/\/ RUN:            -I%S\/Inputs\/explicit-build \\\n\/\/ RUN:            -fmodule-file=%t\/a.pcm \\\n\/\/ RUN:            -fmodule-file=b-rel.pcm \\\n\/\/ RUN:            -verify %s\n\/\/\n\/\/ RUN: %clang_cc1 -x c++ -std=c++11 -fmodules -fmodules-cache-path=%t -Rmodule-build -fno-modules-error-recovery \\\n\/\/ RUN:            -I%S\/Inputs\/explicit-build \\\n\/\/ RUN:            -fmodule-file=a.pcm \\\n\/\/ RUN:            -fmodule-file=b-abs.pcm \\\n\/\/ RUN:            -verify %s\n\/\/\n\/\/ RUN: not %clang_cc1 -x c++ -std=c++11 -fmodules -fmodules-cache-path=%t -Rmodule-build -fno-modules-error-recovery \\\n\/\/ RUN:            -I%S\/Inputs\/explicit-build \\\n\/\/ RUN:            -fmodule-file=b-rel.pcm \\\n\/\/ RUN:            -fmodule-file=b-abs.pcm \\\n\/\/ RUN:            -verify %s 2>&1 | FileCheck %s\n\/\/ CHECK: module 'b' is defined in both '{{.*}}b-rel.pcm' and '{{.*}}b-abs.pcm'\n\n#include \"a.h\"\nstatic_assert(a == 1, \"\");\n\/\/ expected-no-diagnostics\n<commit_msg>Remove shell requirement from test\/Modules\/explicit-build-relpath.cpp<commit_after>\/\/ RUN: rm -rf %t\n\/\/ RUN: mkdir %t\n\/\/ RUN: cd %t\n\n\/\/ ----------------------\n\/\/ Build modules A and B.\n\/\/ RUN: %clang_cc1 -x c++ -std=c++11 -fmodules -fmodules-cache-path=%t -Rmodule-build -fno-modules-error-recovery \\\n\/\/ RUN:            -fmodule-name=a -emit-module %S\/Inputs\/explicit-build\/module.modulemap -o a.pcm\n\/\/\n\/\/ RUN: %clang_cc1 -x c++ -std=c++11 -fmodules -fmodules-cache-path=%t -Rmodule-build -fno-modules-error-recovery \\\n\/\/ RUN:            -fmodule-file=a.pcm \\\n\/\/ RUN:            -fmodule-name=b -emit-module %S\/Inputs\/explicit-build\/module.modulemap -o b-rel.pcm\n\/\/\n\/\/ RUN: %clang_cc1 -x c++ -std=c++11 -fmodules -fmodules-cache-path=%t -Rmodule-build -fno-modules-error-recovery \\\n\/\/ RUN:            -fmodule-file=%t\/a.pcm \\\n\/\/ RUN:            -fmodule-name=b -emit-module %S\/Inputs\/explicit-build\/module.modulemap -o b-abs.pcm\n\n\/\/ ------------------------------------------\n\/\/ Mix and match relative and absolute paths.\n\/\/ RUN: %clang_cc1 -x c++ -std=c++11 -fmodules -fmodules-cache-path=%t -Rmodule-build -fno-modules-error-recovery \\\n\/\/ RUN:            -I%S\/Inputs\/explicit-build \\\n\/\/ RUN:            -fmodule-file=%t\/a.pcm \\\n\/\/ RUN:            -fmodule-file=a.pcm \\\n\/\/ RUN:            -verify %s\n\/\/\n\/\/ RUN: %clang_cc1 -x c++ -std=c++11 -fmodules -fmodules-cache-path=%t -Rmodule-build -fno-modules-error-recovery \\\n\/\/ RUN:            -I%S\/Inputs\/explicit-build \\\n\/\/ RUN:            -fmodule-file=%t\/a.pcm \\\n\/\/ RUN:            -fmodule-file=b-rel.pcm \\\n\/\/ RUN:            -verify %s\n\/\/\n\/\/ RUN: %clang_cc1 -x c++ -std=c++11 -fmodules -fmodules-cache-path=%t -Rmodule-build -fno-modules-error-recovery \\\n\/\/ RUN:            -I%S\/Inputs\/explicit-build \\\n\/\/ RUN:            -fmodule-file=a.pcm \\\n\/\/ RUN:            -fmodule-file=b-abs.pcm \\\n\/\/ RUN:            -verify %s\n\/\/\n\/\/ RUN: not %clang_cc1 -x c++ -std=c++11 -fmodules -fmodules-cache-path=%t -Rmodule-build -fno-modules-error-recovery \\\n\/\/ RUN:            -I%S\/Inputs\/explicit-build \\\n\/\/ RUN:            -fmodule-file=b-rel.pcm \\\n\/\/ RUN:            -fmodule-file=b-abs.pcm \\\n\/\/ RUN:            -verify %s 2>&1 | FileCheck %s\n\/\/ CHECK: module 'b' is defined in both '{{.*}}b-rel.pcm' and '{{.*}}b-abs.pcm'\n\n#include \"a.h\"\nstatic_assert(a == 1, \"\");\n\/\/ expected-no-diagnostics\n<|endoftext|>"}
{"text":"<commit_before>#ifndef INC_AL_CONTROL_GLV_HPP\n#define INC_AL_CONTROL_GLV_HPP\n\n#include \"allocore\/io\/al_Window.hpp\"\n#include \"glv_core.h\"\n\nnamespace al {\n\nstruct GLVControl {\n\n\tGLVControl(glv::GLV * v): mGLV(v){}\n\n\tvoid glv(glv::GLV * v){ mGLV=v; }\n\tglv::GLV& glv(){ return *mGLV; }\n\nprotected:\n\tglv::GLV * mGLV;\n};\n\n\/\/\/ Mapping from keyboard and mouse controls to a GLV object\nstruct GLVInputControl : public GLVControl, public InputEventHandler {\n\n\tGLVInputControl(glv::GLV * v): GLVControl(v){}\n\tvirtual ~GLVInputControl(){}\n\t\n\tvirtual bool onMouseDown(const Mouse& m){\n\t\tglv::space_t xrel=m.x(), yrel=m.y();\n\t\tglv().setMouseDown(xrel,yrel, m.button(), 0);\n\t\tglv().setMousePos(m.x(), m.y(), xrel, yrel);\n\t\treturn !glv().propagateEvent();\n\t}\n\t\n\tvirtual bool onMouseDrag(const Mouse& m){\n\t\treturn !motionToGLV(m, glv::Event::MouseDrag);\n\t}\n\n\tvirtual bool onMouseMove(const al::Mouse& m){\n\t\treturn !motionToGLV(m, glv::Event::MouseMove);\n\t}\n\n\tvirtual bool onMouseUp(const al::Mouse& m){\n\t\tglv::space_t xrel, yrel;\n\t\tglv().setMouseUp(xrel,yrel, m.button(), 0);\n\t\tglv().setMousePos(m.x(), m.y(), xrel, yrel);\n\t\treturn !glv().propagateEvent();\n\t}\n\t\n\tvirtual bool onKeyDown(const Keyboard& k){\n\t\treturn !keyToGLV(k, true);\n\t}\n\t\n\tvirtual bool onKeyUp(const al::Keyboard& k){\n\t\treturn !keyToGLV(k, false);\n\t}\n\nprotected:\n\tbool keyToGLV(const al::Keyboard& k, bool down){\n\t\tdown ? glv().setKeyDown(k.key()) : glv().setKeyUp(k.key());\n\t\tconst_cast<glv::Keyboard*>(&glv().keyboard())->alt(k.alt());\n\t\tconst_cast<glv::Keyboard*>(&glv().keyboard())->caps(k.caps());\n\t\tconst_cast<glv::Keyboard*>(&glv().keyboard())->ctrl(k.ctrl());\n\t\tconst_cast<glv::Keyboard*>(&glv().keyboard())->meta(k.meta());\n\t\tconst_cast<glv::Keyboard*>(&glv().keyboard())->shift(k.shift());\n\t\treturn glv().propagateEvent();\n\t}\n\t\n\tbool motionToGLV(const al::Mouse& m, glv::Event::t e){\n\t\tglv::space_t x = m.x(), y = m.y(), relx = x, rely = y;\n\t\tglv().setMouseMotion(relx, rely, e);\n\t\tglv().setMousePos((int)x, (int)y, relx, rely);\n\t\treturn glv().propagateEvent();\n\t}\n};\n\n\n\/\/\/ Mapping from window events to a GLV object\nstruct GLVWindowControl : public GLVControl, public WindowEventHandler {\n\n\tGLVWindowControl(glv::GLV * v): GLVControl(v){}\n\tvirtual ~GLVWindowControl(){}\n\n\tvirtual bool onCreate(){\n\t\tglv().broadcastEvent(glv::Event::WindowCreate);\n\t\treturn true;\n\t}\n\t\n\tvirtual bool onDestroy(){\n\t\tglv().broadcastEvent(glv::Event::WindowDestroy);\n\t\treturn true;\n\t}\n\n\tvirtual bool onFrame(){\n\t\tglv().drawGLV(glv().w, glv().h, window().spf());\n\t\t\/\/glv().preamble(glv().w, glv().h);\n\t\t\/\/glv().drawWidgets(glv().w, glv().h, window().spf());\n\t\treturn true;\n\t}\n\n\tvirtual bool onResize(int dw, int dh){\n\t\tglv().extent(glv().width() + dw, glv().height() + dh);\n\t\t\/\/printf(\"%d %d %f %f\\n\", dw, dh, glv().width(), glv().height());\n\t\tglv().broadcastEvent(glv::Event::WindowResize);\n\t\treturn true;\n\t}\n\t\n\t\/\/virtual bool onVisibility(bool v){ return true; }\n};\n\n\n\/\/\/ Pose GLV model\nstruct PoseModel : public glv::Model{\n\tPoseModel(Pose& p): pose(p){}\n\n\tvirtual ~PoseModel(){}\n\n\tvirtual const glv::Data& getData(glv::Data& d) const {\n\t\td.resize(glv::Data::FLOAT, 7);\n\t\td.assignFromArray(pose.pos().elems, 3);\n\t\td.assignFromArray(&pose.quat()[0], 4, 1, 3);\n\/\/\t\tdouble a[4];\n\/\/\t\tpose.quat().toAxisAngle(a[0], a[1],a[2],a[3]);\n\/\/\t\td.assignFromArray(a, 4, 1, 3);\n\t\treturn d;\n\t}\n\n\tvirtual void setData(const glv::Data& d){\n\t\tpose.pos(d.at<float>(0), d.at<float>(1), d.at<float>(2));\n\t\tpose.quat().set(d.at<float>(3), d.at<float>(4), d.at<float>(5), d.at<float>(6));\n\/\/\t\tpose.quat().fromAxisAngle(d.at<float>(3), d.at<float>(4), d.at<float>(5), d.at<float>(6));\n\t}\n\n\tPose& pose;\n};\n\n\n} \/\/ al::\n\n#endif\n<commit_msg>fix GLV\/ include<commit_after>#ifndef INC_AL_CONTROL_GLV_HPP\n#define INC_AL_CONTROL_GLV_HPP\n\n#include \"allocore\/io\/al_Window.hpp\"\n#include \"GLV\/glv_core.h\"\n\nnamespace al {\n\nstruct GLVControl {\n\n\tGLVControl(glv::GLV * v): mGLV(v){}\n\n\tvoid glv(glv::GLV * v){ mGLV=v; }\n\tglv::GLV& glv(){ return *mGLV; }\n\nprotected:\n\tglv::GLV * mGLV;\n};\n\n\/\/\/ Mapping from keyboard and mouse controls to a GLV object\nstruct GLVInputControl : public GLVControl, public InputEventHandler {\n\n\tGLVInputControl(glv::GLV * v): GLVControl(v){}\n\tvirtual ~GLVInputControl(){}\n\t\n\tvirtual bool onMouseDown(const Mouse& m){\n\t\tglv::space_t xrel=m.x(), yrel=m.y();\n\t\tglv().setMouseDown(xrel,yrel, m.button(), 0);\n\t\tglv().setMousePos(m.x(), m.y(), xrel, yrel);\n\t\treturn !glv().propagateEvent();\n\t}\n\t\n\tvirtual bool onMouseDrag(const Mouse& m){\n\t\treturn !motionToGLV(m, glv::Event::MouseDrag);\n\t}\n\n\tvirtual bool onMouseMove(const al::Mouse& m){\n\t\treturn !motionToGLV(m, glv::Event::MouseMove);\n\t}\n\n\tvirtual bool onMouseUp(const al::Mouse& m){\n\t\tglv::space_t xrel, yrel;\n\t\tglv().setMouseUp(xrel,yrel, m.button(), 0);\n\t\tglv().setMousePos(m.x(), m.y(), xrel, yrel);\n\t\treturn !glv().propagateEvent();\n\t}\n\t\n\tvirtual bool onKeyDown(const Keyboard& k){\n\t\treturn !keyToGLV(k, true);\n\t}\n\t\n\tvirtual bool onKeyUp(const al::Keyboard& k){\n\t\treturn !keyToGLV(k, false);\n\t}\n\nprotected:\n\tbool keyToGLV(const al::Keyboard& k, bool down){\n\t\tdown ? glv().setKeyDown(k.key()) : glv().setKeyUp(k.key());\n\t\tconst_cast<glv::Keyboard*>(&glv().keyboard())->alt(k.alt());\n\t\tconst_cast<glv::Keyboard*>(&glv().keyboard())->caps(k.caps());\n\t\tconst_cast<glv::Keyboard*>(&glv().keyboard())->ctrl(k.ctrl());\n\t\tconst_cast<glv::Keyboard*>(&glv().keyboard())->meta(k.meta());\n\t\tconst_cast<glv::Keyboard*>(&glv().keyboard())->shift(k.shift());\n\t\treturn glv().propagateEvent();\n\t}\n\t\n\tbool motionToGLV(const al::Mouse& m, glv::Event::t e){\n\t\tglv::space_t x = m.x(), y = m.y(), relx = x, rely = y;\n\t\tglv().setMouseMotion(relx, rely, e);\n\t\tglv().setMousePos((int)x, (int)y, relx, rely);\n\t\treturn glv().propagateEvent();\n\t}\n};\n\n\n\/\/\/ Mapping from window events to a GLV object\nstruct GLVWindowControl : public GLVControl, public WindowEventHandler {\n\n\tGLVWindowControl(glv::GLV * v): GLVControl(v){}\n\tvirtual ~GLVWindowControl(){}\n\n\tvirtual bool onCreate(){\n\t\tglv().broadcastEvent(glv::Event::WindowCreate);\n\t\treturn true;\n\t}\n\t\n\tvirtual bool onDestroy(){\n\t\tglv().broadcastEvent(glv::Event::WindowDestroy);\n\t\treturn true;\n\t}\n\n\tvirtual bool onFrame(){\n\t\tglv().drawGLV(glv().w, glv().h, window().spf());\n\t\t\/\/glv().preamble(glv().w, glv().h);\n\t\t\/\/glv().drawWidgets(glv().w, glv().h, window().spf());\n\t\treturn true;\n\t}\n\n\tvirtual bool onResize(int dw, int dh){\n\t\tglv().extent(glv().width() + dw, glv().height() + dh);\n\t\t\/\/printf(\"%d %d %f %f\\n\", dw, dh, glv().width(), glv().height());\n\t\tglv().broadcastEvent(glv::Event::WindowResize);\n\t\treturn true;\n\t}\n\t\n\t\/\/virtual bool onVisibility(bool v){ return true; }\n};\n\n\n\/\/\/ Pose GLV model\nstruct PoseModel : public glv::Model{\n\tPoseModel(Pose& p): pose(p){}\n\n\tvirtual ~PoseModel(){}\n\n\tvirtual const glv::Data& getData(glv::Data& d) const {\n\t\td.resize(glv::Data::FLOAT, 7);\n\t\td.assignFromArray(pose.pos().elems, 3);\n\t\td.assignFromArray(&pose.quat()[0], 4, 1, 3);\n\/\/\t\tdouble a[4];\n\/\/\t\tpose.quat().toAxisAngle(a[0], a[1],a[2],a[3]);\n\/\/\t\td.assignFromArray(a, 4, 1, 3);\n\t\treturn d;\n\t}\n\n\tvirtual void setData(const glv::Data& d){\n\t\tpose.pos(d.at<float>(0), d.at<float>(1), d.at<float>(2));\n\t\tpose.quat().set(d.at<float>(3), d.at<float>(4), d.at<float>(5), d.at<float>(6));\n\/\/\t\tpose.quat().fromAxisAngle(d.at<float>(3), d.at<float>(4), d.at<float>(5), d.at<float>(6));\n\t}\n\n\tPose& pose;\n};\n\n\n} \/\/ al::\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*\n * This file is part of the LibreOffice project.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\n * 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_BASEGFX_NUMERIC_FTOOLS_HXX\n#define INCLUDED_BASEGFX_NUMERIC_FTOOLS_HXX\n\n#include <rtl\/math.hxx>\n#include <basegfx\/basegfxdllapi.h>\n\n\n\/\/ standard PI defines from solar.h, but we do not want to link against tools\n\n#ifndef F_PI\n#define F_PI        M_PI\n#endif\n#ifndef F_PI2\n#define F_PI2       M_PI_2\n#endif\n#ifndef F_PI4\n#define F_PI4       M_PI_4\n#endif\n#ifndef F_PI180\n#define F_PI180     (M_PI\/180.0)\n#endif\n#ifndef F_PI1800\n#define F_PI1800    (M_PI\/1800.0)\n#endif\n#ifndef F_PI18000\n#define F_PI18000   (M_PI\/18000.0)\n#endif\n#ifndef F_2PI\n#define F_2PI       (2.0*M_PI)\n#endif\n\n\n\/\/ fTools defines\n\nnamespace basegfx\n{\n    \/** Round double to nearest integer\n\n        @return the nearest integer\n    *\/\n    inline sal_Int32 fround( double fVal )\n    {\n        return fVal > 0.0 ? static_cast<sal_Int32>( fVal + .5 ) : -static_cast<sal_Int32>( -fVal + .5 );\n    }\n\n    \/** Round double to nearest integer\n\n        @return the nearest 64 bit integer\n    *\/\n    inline sal_Int64 fround64( double fVal )\n    {\n        return fVal > 0.0 ? static_cast<sal_Int64>( fVal + .5 ) : -static_cast<sal_Int64>( -fVal + .5 );\n    }\n\n    \/** Prune a small epsilon range around zero.\n\n        Use this method e.g. for calculating scale values. There, it\n        is usually advisable not to set a scaling to 0.0, because that\n        yields singular transformation matrices.\n\n        @param fVal\n        An arbitrary, but finite and valid number\n\n        @return either fVal, or a small value slightly above (when\n        fVal>0) or below (when fVal<0) zero.\n     *\/\n    inline double pruneScaleValue( double fVal )\n    {\n        \/\/ old version used ::std::min\/max, but this collides if min is defined as preprocessor\n        \/\/ macro which is the case e.g with windows.h headers. The simplest way to avoid this is to\n        \/\/ just use the full comparison. I keep the original here, maybe there will be a better\n        \/\/ solution some day.\n\n        \/\/return fVal < 0.0 ?\n        \/\/    (::std::min(fVal,-0.00001)) :\n        \/\/    (::std::max(fVal,0.00001));\n\n        if(fVal < 0.0)\n            return (fVal < -0.00001 ? fVal : -0.00001);\n        else\n            return (fVal > 0.00001 ? fVal : 0.00001);\n    }\n\n    \/** clamp given value against given minimum and maximum values\n    *\/\n    template <class T> inline const T& clamp(const T& value, const T& minimum, const T& maximum)\n    {\n        if(value < minimum)\n        {\n            return minimum;\n        }\n        else if(value > maximum)\n        {\n            return maximum;\n        }\n        else\n        {\n            return value;\n        }\n    }\n\n    \/** Convert value from degrees to radians\n     *\/\n    inline double deg2rad( double v )\n    {\n        \/\/ divide first, to get exact values for v being a multiple of\n        \/\/ 90 degrees\n        return v \/ 90.0 * M_PI_2;\n    }\n\n    \/** Convert value radians to degrees\n     *\/\n    inline double rad2deg( double v )\n    {\n        \/\/ divide first, to get exact values for v being a multiple of\n        \/\/ pi\/2\n        return v \/ M_PI_2 * 90.0;\n    }\n\n    \/** Snap v to nearest multiple of fStep, from negative and\n        positive side.\n\n        Examples:\n\n        snapToNearestMultiple(-0.1, 0.5) = 0.0\n        snapToNearestMultiple(0.1, 0.5) = 0.0\n        snapToNearestMultiple(0.25, 0.5) = 0.0\n        snapToNearestMultiple(0.26, 0.5) = 0.5\n     *\/\n    BASEGFX_DLLPUBLIC double snapToNearestMultiple(double v, const double fStep);\n\n    class BASEGFX_DLLPUBLIC fTools\n    {\n    public:\n        \/\/\/ Compare against small value\n        static bool equalZero(const double& rfVal)\n        {\n            return (fabs(rfVal) <= 0.000000001f);\n        }\n\n        \/\/\/ Compare against given small value\n        static bool equalZero(const double& rfVal, const double& rfSmallValue)\n        {\n            return (fabs(rfVal) <= rfSmallValue);\n        }\n\n        static bool equal(const double& rfValA, const double& rfValB)\n        {\n            \/\/ changed to approxEqual usage for better numerical correctness\n            return rtl::math::approxEqual(rfValA, rfValB);\n        }\n\n        static bool equal(const double& rfValA, const double& rfValB, const double& rfSmallValue)\n        {\n            return (fabs(rfValA - rfValB) <= rfSmallValue);\n        }\n\n        static bool less(const double& rfValA, const double& rfValB)\n        {\n            return (rfValA < rfValB && !equal(rfValA, rfValB));\n        }\n\n        static bool lessOrEqual(const double& rfValA, const double& rfValB)\n        {\n            return (rfValA < rfValB || equal(rfValA, rfValB));\n        }\n\n        static bool more(const double& rfValA, const double& rfValB)\n        {\n            return (rfValA > rfValB && !equal(rfValA, rfValB));\n        }\n\n        static bool moreOrEqual(const double& rfValA, const double& rfValB)\n        {\n            return (rfValA > rfValB || equal(rfValA, rfValB));\n        }\n    };\n} \/\/ end of namespace basegfx\n\n#endif \/\/ INCLUDED_BASEGFX_NUMERIC_FTOOLS_HXX\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>Revert \"fTools::getSmallValue() is not used anymore\"<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_BASEGFX_NUMERIC_FTOOLS_HXX\n#define INCLUDED_BASEGFX_NUMERIC_FTOOLS_HXX\n\n#include <rtl\/math.hxx>\n#include <basegfx\/basegfxdllapi.h>\n\n\n\/\/ standard PI defines from solar.h, but we do not want to link against tools\n\n#ifndef F_PI\n#define F_PI        M_PI\n#endif\n#ifndef F_PI2\n#define F_PI2       M_PI_2\n#endif\n#ifndef F_PI4\n#define F_PI4       M_PI_4\n#endif\n#ifndef F_PI180\n#define F_PI180     (M_PI\/180.0)\n#endif\n#ifndef F_PI1800\n#define F_PI1800    (M_PI\/1800.0)\n#endif\n#ifndef F_PI18000\n#define F_PI18000   (M_PI\/18000.0)\n#endif\n#ifndef F_2PI\n#define F_2PI       (2.0*M_PI)\n#endif\n\n\n\/\/ fTools defines\n\nnamespace basegfx\n{\n    \/** Round double to nearest integer\n\n        @return the nearest integer\n    *\/\n    inline sal_Int32 fround( double fVal )\n    {\n        return fVal > 0.0 ? static_cast<sal_Int32>( fVal + .5 ) : -static_cast<sal_Int32>( -fVal + .5 );\n    }\n\n    \/** Round double to nearest integer\n\n        @return the nearest 64 bit integer\n    *\/\n    inline sal_Int64 fround64( double fVal )\n    {\n        return fVal > 0.0 ? static_cast<sal_Int64>( fVal + .5 ) : -static_cast<sal_Int64>( -fVal + .5 );\n    }\n\n    \/** Prune a small epsilon range around zero.\n\n        Use this method e.g. for calculating scale values. There, it\n        is usually advisable not to set a scaling to 0.0, because that\n        yields singular transformation matrices.\n\n        @param fVal\n        An arbitrary, but finite and valid number\n\n        @return either fVal, or a small value slightly above (when\n        fVal>0) or below (when fVal<0) zero.\n     *\/\n    inline double pruneScaleValue( double fVal )\n    {\n        \/\/ old version used ::std::min\/max, but this collides if min is defined as preprocessor\n        \/\/ macro which is the case e.g with windows.h headers. The simplest way to avoid this is to\n        \/\/ just use the full comparison. I keep the original here, maybe there will be a better\n        \/\/ solution some day.\n\n        \/\/return fVal < 0.0 ?\n        \/\/    (::std::min(fVal,-0.00001)) :\n        \/\/    (::std::max(fVal,0.00001));\n\n        if(fVal < 0.0)\n            return (fVal < -0.00001 ? fVal : -0.00001);\n        else\n            return (fVal > 0.00001 ? fVal : 0.00001);\n    }\n\n    \/** clamp given value against given minimum and maximum values\n    *\/\n    template <class T> inline const T& clamp(const T& value, const T& minimum, const T& maximum)\n    {\n        if(value < minimum)\n        {\n            return minimum;\n        }\n        else if(value > maximum)\n        {\n            return maximum;\n        }\n        else\n        {\n            return value;\n        }\n    }\n\n    \/** Convert value from degrees to radians\n     *\/\n    inline double deg2rad( double v )\n    {\n        \/\/ divide first, to get exact values for v being a multiple of\n        \/\/ 90 degrees\n        return v \/ 90.0 * M_PI_2;\n    }\n\n    \/** Convert value radians to degrees\n     *\/\n    inline double rad2deg( double v )\n    {\n        \/\/ divide first, to get exact values for v being a multiple of\n        \/\/ pi\/2\n        return v \/ M_PI_2 * 90.0;\n    }\n\n    \/** Snap v to nearest multiple of fStep, from negative and\n        positive side.\n\n        Examples:\n\n        snapToNearestMultiple(-0.1, 0.5) = 0.0\n        snapToNearestMultiple(0.1, 0.5) = 0.0\n        snapToNearestMultiple(0.25, 0.5) = 0.0\n        snapToNearestMultiple(0.26, 0.5) = 0.5\n     *\/\n    BASEGFX_DLLPUBLIC double snapToNearestMultiple(double v, const double fStep);\n\n    class BASEGFX_DLLPUBLIC fTools\n    {\n    public:\n        \/\/\/ Get threshold value for equalZero and friends\n        static double getSmallValue() { return 0.000000001f; }\n\n        \/\/\/ Compare against small value\n        static bool equalZero(const double& rfVal)\n        {\n            return (fabs(rfVal) <= getSmallValue());\n        }\n\n        \/\/\/ Compare against given small value\n        static bool equalZero(const double& rfVal, const double& rfSmallValue)\n        {\n            return (fabs(rfVal) <= rfSmallValue);\n        }\n\n        static bool equal(const double& rfValA, const double& rfValB)\n        {\n            \/\/ changed to approxEqual usage for better numerical correctness\n            return rtl::math::approxEqual(rfValA, rfValB);\n        }\n\n        static bool equal(const double& rfValA, const double& rfValB, const double& rfSmallValue)\n        {\n            return (fabs(rfValA - rfValB) <= rfSmallValue);\n        }\n\n        static bool less(const double& rfValA, const double& rfValB)\n        {\n            return (rfValA < rfValB && !equal(rfValA, rfValB));\n        }\n\n        static bool lessOrEqual(const double& rfValA, const double& rfValB)\n        {\n            return (rfValA < rfValB || equal(rfValA, rfValB));\n        }\n\n        static bool more(const double& rfValA, const double& rfValB)\n        {\n            return (rfValA > rfValB && !equal(rfValA, rfValB));\n        }\n\n        static bool moreOrEqual(const double& rfValA, const double& rfValB)\n        {\n            return (rfValA > rfValB || equal(rfValA, rfValB));\n        }\n    };\n} \/\/ end of namespace basegfx\n\n#endif \/\/ INCLUDED_BASEGFX_NUMERIC_FTOOLS_HXX\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before>#include <memory>\n#include <string>\n\nnamespace brynet { namespace net {\n\nclass SendableMsg\n{\npublic:\n    using Ptr = std::shared_ptr<SendableMsg>;\n\n    virtual ~SendableMsg() = default;\n\n    virtual const void* data() = 0;\n    virtual size_t size() = 0;\n};\n\nclass StringSendMsg : public SendableMsg\n{\npublic:\n    explicit StringSendMsg(const char* buffer, size_t len)\n        : mMsg(buffer, len)\n    {}\n\n    explicit StringSendMsg(const std::string& buffer)\n        : mMsg(buffer)\n    {}\n\n    explicit StringSendMsg(std::string&& buffer)\n        : mMsg(std::move(buffer))\n    {}\n\n    const void* data() override\n    {\n        return static_cast<const void*>(mMsg.data());\n    }\n    size_t size() override\n    {\n        return mMsg.size();\n    }\n\nprivate:\n    std::string mMsg;\n};\n\nstatic SendableMsg::Ptr MakeStringMsg(const char* buffer, size_t len)\n{\n    return std::make_shared<StringSendMsg>(buffer, len);\n}\n\nstatic SendableMsg::Ptr MakeStringMsg(const std::string& buffer)\n{\n    return std::make_shared<StringSendMsg>(buffer);\n}\n\nstatic SendableMsg::Ptr MakeStringMsg(std::string&& buffer)\n{\n    return std::make_shared<StringSendMsg>(std::move(buffer));\n}\n\n}}\/\/ namespace brynet::net<commit_msg>add `#pragma once` for SendableMsg.hpp<commit_after>#pragma once\n\n#include <memory>\n#include <string>\n\nnamespace brynet { namespace net {\n\nclass SendableMsg\n{\npublic:\n    using Ptr = std::shared_ptr<SendableMsg>;\n\n    virtual ~SendableMsg() = default;\n\n    virtual const void* data() = 0;\n    virtual size_t size() = 0;\n};\n\nclass StringSendMsg : public SendableMsg\n{\npublic:\n    explicit StringSendMsg(const char* buffer, size_t len)\n        : mMsg(buffer, len)\n    {}\n\n    explicit StringSendMsg(const std::string& buffer)\n        : mMsg(buffer)\n    {}\n\n    explicit StringSendMsg(std::string&& buffer)\n        : mMsg(std::move(buffer))\n    {}\n\n    const void* data() override\n    {\n        return static_cast<const void*>(mMsg.data());\n    }\n    size_t size() override\n    {\n        return mMsg.size();\n    }\n\nprivate:\n    std::string mMsg;\n};\n\nstatic SendableMsg::Ptr MakeStringMsg(const char* buffer, size_t len)\n{\n    return std::make_shared<StringSendMsg>(buffer, len);\n}\n\nstatic SendableMsg::Ptr MakeStringMsg(const std::string& buffer)\n{\n    return std::make_shared<StringSendMsg>(buffer);\n}\n\nstatic SendableMsg::Ptr MakeStringMsg(std::string&& buffer)\n{\n    return std::make_shared<StringSendMsg>(std::move(buffer));\n}\n\n}}\/\/ namespace brynet::net<|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_WKT_GRAMMAR_HPP\n#define MAPNIK_WKT_GRAMMAR_HPP\n\n#include <boost\/assert.hpp>\n#include <boost\/ptr_container\/ptr_vector.hpp>\n\/\/ spirit::qi\n#include <boost\/spirit\/include\/qi.hpp>\n\/\/ spirit::phoenix\n#include <boost\/spirit\/include\/phoenix_function.hpp>\n#include <boost\/spirit\/include\/phoenix_core.hpp>\n#include <boost\/spirit\/include\/phoenix_operator.hpp>\n#include <boost\/spirit\/include\/phoenix_fusion.hpp>\n#include <boost\/spirit\/home\/phoenix\/object\/new.hpp>\n#include <boost\/spirit\/include\/phoenix_stl.hpp>\n\/\/ mapnik\n#include <mapnik\/geometry.hpp>\n\nnamespace mapnik { namespace wkt {\n\nusing namespace boost::spirit;\nusing namespace boost::fusion;\nusing namespace boost::phoenix;\n\nstruct push_vertex\n{\n    template <typename T0,typename T1, typename T2, typename T3>\n    struct result\n    {\n        typedef void type;\n    };\n    \n    template <typename T0,typename T1, typename T2, typename T3>\n    void operator() (T0 c, T1 path, T2 x, T3 y) const\n    {\n        BOOST_ASSERT( path!=0 );\n        path->push_vertex(x,y,c);        \n    }\n};\n\nstruct cleanup\n{\n    template <typename T0>\n    struct result\n    {\n        typedef void type;\n    };\n    \n    template <typename T0>\n    void operator() (T0 & path) const\n    {        \n        if (path) delete path,path=0;\n    }\n};\n\ntemplate <typename Iterator>\nstruct wkt_grammar : qi::grammar<Iterator, geometry_type*(), ascii::space_type>\n{\n    wkt_grammar()\n        : wkt_grammar::base_type(start)\n    {       \n        using qi::no_case;   \n        start %= point | linestring | polygon | multipoint | multilinestring | multipolygon | eps[cleanup_(_val)][_pass = false];\n        \n        \/\/ <point tagged text> ::= point <point text>\n        point = no_case[lit(\"POINT\")] [ _val = new_<geometry_type>(Point) ]\n            >> (empty_set | lit('(') >> coord(SEG_MOVETO,_val) >> lit(')'));\n        \n        \/\/ <linestring tagged text> ::= linestring <linestring text>\n        linestring = no_case[lit(\"LINESTRING\")]  [ _val = new_<geometry_type>(LineString) ] >> (empty_set | points(_val));\n        \n        \/\/ <polygon tagged text> ::= polygon <polygon text>\n        polygon = no_case[lit(\"POLYGON\")] [ _val = new_<geometry_type>(Polygon) ] >> \n            (empty_set | lit('(') >> points(_val) % lit(',') >> lit(')'));\n        \n        \/\/ multi point\n        multipoint = no_case[lit(\"MULTIPOINT\")]  [ _val = new_<geometry_type>(MultiPoint) ]\n            >> (empty_set | lit('(') >> coord(SEG_MOVETO,_val) % lit(',') >> ')');\n        \n        \/\/ multi linestring\n        multilinestring = no_case[lit(\"MULTILINESTRING\")] [ _val = new_<geometry_type>(MultiLineString) ]>> \n            (empty_set | lit('(') >> points(_val) % lit(',') >> ')');\n        \n        \/\/ multi polygon\n        multipolygon = no_case[lit(\"MULTIPOLYGON\")] [ _val = new_<geometry_type>(MultiPolygon)] >> \n            (empty_set | lit('(') >> (lit('(') >> \n                                      points(_val) % ',' >> ')') % ',' >> ')');\n        \n        \/\/ points\n        points = lit('(')[_a = SEG_MOVETO] >> coord (_a,_r1) % lit(',') [_a = SEG_LINETO]  >> ')';\n        coord = (double_ >> double_) [push_vertex_(_r1,_r2,_1,_2)];\n        \n        \/\/ <empty set>\n        empty_set = no_case[lit(\"EMPTY\")];\n\n    }\n    \n    qi::rule<Iterator,geometry_type*(),ascii::space_type> start;\n    qi::rule<Iterator,geometry_type*(),ascii::space_type> point;\n    qi::rule<Iterator,geometry_type*(),ascii::space_type> multipoint;\n    qi::rule<Iterator,geometry_type*(),ascii::space_type> linestring;\n    qi::rule<Iterator,geometry_type*(),ascii::space_type> multilinestring;\n    qi::rule<Iterator,geometry_type*(),ascii::space_type> polygon;\n    qi::rule<Iterator,geometry_type*(),ascii::space_type> multipolygon;\n    qi::rule<Iterator,void(CommandType,geometry_type*),ascii::space_type> coord;\n    qi::rule<Iterator,qi::locals<CommandType>,void(geometry_type*),ascii::space_type> points;\n    qi::rule<Iterator,ascii::space_type> empty_set;\n    boost::phoenix::function<push_vertex> push_vertex_;\n    boost::phoenix::function<cleanup> cleanup_;\n};\n\ntemplate <typename Iterator>\nstruct wkt_collection_grammar : qi::grammar<Iterator, boost::ptr_vector<mapnik::geometry_type>(), ascii::space_type>\n{\n    wkt_collection_grammar()\n        :  wkt_collection_grammar::base_type(start)\n    {\n        using qi::no_case; \n        using boost::phoenix::push_back;\n        start = wkt [push_back(_val,_1)] | no_case[lit(\"GEOMETRYCOLLECTION\")] \n            >> (lit(\"(\") >> *wkt[push_back(_val,_1)] % lit(\",\") >> lit(\")\"));\n    }\n    \n    qi::rule<Iterator,boost::ptr_vector<mapnik::geometry_type>(),ascii::space_type> start;\n    wkt_grammar<Iterator> wkt;\n};\n\n}}\n\n#endif \/\/ MAPNIK_WKT_GRAMMAR_HPP\n<commit_msg>+ qualify boost::spirit::qi placeholders to avoid ambiguity<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_WKT_GRAMMAR_HPP\n#define MAPNIK_WKT_GRAMMAR_HPP\n\n#include <boost\/assert.hpp>\n#include <boost\/ptr_container\/ptr_vector.hpp>\n\/\/ spirit::qi\n#include <boost\/spirit\/include\/qi.hpp>\n\/\/ spirit::phoenix\n#include <boost\/spirit\/include\/phoenix_function.hpp>\n#include <boost\/spirit\/include\/phoenix_core.hpp>\n#include <boost\/spirit\/include\/phoenix_operator.hpp>\n#include <boost\/spirit\/include\/phoenix_fusion.hpp>\n#include <boost\/spirit\/home\/phoenix\/object\/new.hpp>\n#include <boost\/spirit\/include\/phoenix_stl.hpp>\n\/\/ mapnik\n#include <mapnik\/geometry.hpp>\n\nnamespace mapnik { namespace wkt {\n\nusing namespace boost::spirit;\nusing namespace boost::fusion;\nusing namespace boost::phoenix;\n\nstruct push_vertex\n{\n    template <typename T0,typename T1, typename T2, typename T3>\n    struct result\n    {\n        typedef void type;\n    };\n    \n    template <typename T0,typename T1, typename T2, typename T3>\n    void operator() (T0 c, T1 path, T2 x, T3 y) const\n    {\n        BOOST_ASSERT( path!=0 );\n        path->push_vertex(x,y,c);        \n    }\n};\n\nstruct cleanup\n{\n    template <typename T0>\n    struct result\n    {\n        typedef void type;\n    };\n    \n    template <typename T0>\n    void operator() (T0 & path) const\n    {        \n        if (path) delete path,path=0;\n    }\n};\n\ntemplate <typename Iterator>\nstruct wkt_grammar : qi::grammar<Iterator, geometry_type*(), ascii::space_type>\n{\n    wkt_grammar()\n        : wkt_grammar::base_type(start)\n    {       \n        using qi::_1;   \n        using qi::_2;\n        using qi::_val;\n        using qi::no_case;   \n        \n        start %= point | linestring | polygon | multipoint | multilinestring | multipolygon | eps[cleanup_(_val)][_pass = false];\n        \n        \/\/ <point tagged text> ::= point <point text>\n        point = no_case[lit(\"POINT\")] [ _val = new_<geometry_type>(Point) ]\n            >> (empty_set | lit('(') >> coord(SEG_MOVETO,_val) >> lit(')'));\n        \n        \/\/ <linestring tagged text> ::= linestring <linestring text>\n        linestring = no_case[lit(\"LINESTRING\")]  [ _val = new_<geometry_type>(LineString) ] >> (empty_set | points(_val));\n        \n        \/\/ <polygon tagged text> ::= polygon <polygon text>\n        polygon = no_case[lit(\"POLYGON\")] [ _val = new_<geometry_type>(Polygon) ] >> \n            (empty_set | lit('(') >> points(_val) % lit(',') >> lit(')'));\n        \n        \/\/ multi point\n        multipoint = no_case[lit(\"MULTIPOINT\")]  [ _val = new_<geometry_type>(MultiPoint) ]\n            >> (empty_set | lit('(') >> coord(SEG_MOVETO,_val) % lit(',') >> ')');\n        \n        \/\/ multi linestring\n        multilinestring = no_case[lit(\"MULTILINESTRING\")] [ _val = new_<geometry_type>(MultiLineString) ]>> \n            (empty_set | lit('(') >> points(_val) % lit(',') >> ')');\n        \n        \/\/ multi polygon\n        multipolygon = no_case[lit(\"MULTIPOLYGON\")] [ _val = new_<geometry_type>(MultiPolygon)] >> \n            (empty_set | lit('(') >> (lit('(') >> \n                                      points(_val) % ',' >> ')') % ',' >> ')');\n        \n        \/\/ points\n        points = lit('(')[_a = SEG_MOVETO] >> coord (_a,_r1) % lit(',') [_a = SEG_LINETO]  >> ')';\n        coord = (double_ >> double_) [push_vertex_(_r1,_r2,_1,_2)];\n        \n        \/\/ <empty set>\n        empty_set = no_case[lit(\"EMPTY\")];\n\n    }\n    \n    qi::rule<Iterator,geometry_type*(),ascii::space_type> start;\n    qi::rule<Iterator,geometry_type*(),ascii::space_type> point;\n    qi::rule<Iterator,geometry_type*(),ascii::space_type> multipoint;\n    qi::rule<Iterator,geometry_type*(),ascii::space_type> linestring;\n    qi::rule<Iterator,geometry_type*(),ascii::space_type> multilinestring;\n    qi::rule<Iterator,geometry_type*(),ascii::space_type> polygon;\n    qi::rule<Iterator,geometry_type*(),ascii::space_type> multipolygon;\n    qi::rule<Iterator,void(CommandType,geometry_type*),ascii::space_type> coord;\n    qi::rule<Iterator,qi::locals<CommandType>,void(geometry_type*),ascii::space_type> points;\n    qi::rule<Iterator,ascii::space_type> empty_set;\n    boost::phoenix::function<push_vertex> push_vertex_;\n    boost::phoenix::function<cleanup> cleanup_;\n};\n\ntemplate <typename Iterator>\nstruct wkt_collection_grammar : qi::grammar<Iterator, boost::ptr_vector<mapnik::geometry_type>(), ascii::space_type>\n{\n    wkt_collection_grammar()\n        :  wkt_collection_grammar::base_type(start)\n    {\n        using qi::_1;   \n        using qi::_val;\n        using qi::no_case; \n        using boost::phoenix::push_back;\n        start = wkt [push_back(_val,_1)] | no_case[lit(\"GEOMETRYCOLLECTION\")] \n            >> (lit(\"(\") >> *wkt[push_back(_val,_1)] % lit(\",\") >> lit(\")\"));\n    }\n    \n    qi::rule<Iterator,boost::ptr_vector<mapnik::geometry_type>(),ascii::space_type> start;\n    wkt_grammar<Iterator> wkt;\n};\n\n}}\n\n#endif \/\/ MAPNIK_WKT_GRAMMAR_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/***************************************************************************\n *  @file       main.cpp\n *  @author     Alan.W\n *  @date       03  Feb 2014\n *  @remark     This code is for the exercises from C++ Primer 5th Edition\n *  @note\n ***************************************************************************\/\n\/\/!\n\/\/! Exercise 16.19:\n\/\/! Write a function that takes a reference to a container and prints the\n\/\/! elements in that container. Use the container’s size_type and size members\n\/\/! to control the loop that prints the elements.\n\/\/!\n\/\/! Exercise 16.20:\n\/\/! Rewrite the function from the previous exercise to use iterators returned\n\/\/! from begin and end to control the loop.\n\/\/!\n\n#include <iostream>\n#include <vector>\n#include <list>\n\n\/\/! ex16.19\ntemplate<typename Container>\nstd::ostream& print(Container& c);\n\n\/\/! ex16.20\ntemplate<typename Container>\nstd::ostream& print2(Container& c);\n\nint main()\n{\n    std::vector<int> v = {1,23,6,4,5,7,4};\n    std::list<std::string> l = {\"ss\",\"sszz\",\"saaas\",\"s333s\",\"ss2\",\"sss\"};\n    print2(v);\n    print2(l);\n\n\n\n\n    return 0;\n}\n\n\/\/! ex16.19 using size() to control the loop\ntemplate<typename Container>\nstd::ostream & print(Container &c)\n{\n    typedef typename Container::size_type size_type;\n\n    auto it = c.begin();\n    for(size_type i = 0; i!= c.size(); ++i)\n        std::cout << *it++ << \"\\n\";\n\n    return std::cout;\n}\n\n\/\/! ex16.20 using iterator to control the loop\ntemplate<typename Container>\nstd::ostream& print2(Container& c)\n{\n    for (auto it = c.begin(); it != c.end(); ++it)\n        std::cout << *it << \"\\n\";\n\n    return std::cout;\n}\n<commit_msg>Add an ostream parameter<commit_after>\/***************************************************************************\n *  @file       main.cpp\n *  @author     Alan.W\n *  @date       03  Feb 2014\n *  @remark     This code is for the exercises from C++ Primer 5th Edition\n *  @note\n ***************************************************************************\/\n\/\/!\n\/\/! Exercise 16.19:\n\/\/! Write a function that takes a reference to a container and prints the\n\/\/! elements in that container. Use the container’s size_type and size members\n\/\/! to control the loop that prints the elements.\n\/\/!\n\/\/! Exercise 16.20:\n\/\/! Rewrite the function from the previous exercise to use iterators returned\n\/\/! from begin and end to control the loop.\n\/\/!\n\n#include <iostream>\n#include <vector>\n#include <list>\n\n\/\/! ex16.19\ntemplate<typename Container>\nstd::ostream& print(Container& c, std::ostream &os);\n\n\/\/! ex16.20\ntemplate<typename Container>\nstd::ostream& print2(Container& c, std::ostream &os);\n\nint main()\n{\n    std::vector<int> v = {1,23,6,4,5,7,4};\n    std::list<std::string> l = {\"ss\",\"sszz\",\"saaas\",\"s333s\",\"ss2\",\"sss\"};\n    print2(v, std::cout);\n    print2(l, std::cout);\n\n    return 0;\n}\n\n\/\/! ex16.19 using size() to control the loop\ntemplate<typename Container>\nstd::ostream & print(Container &c, std::ostream &os)\n{\n    typedef typename Container::size_type size_type;\n\n    auto it = c.begin();\n    for(size_type i = 0; i!= c.size(); ++i)\n        os << *it++ << \"\\n\";\n\n    return os;\n}\n\n\/\/! ex16.20 using iterator to control the loop\ntemplate<typename Container>\nstd::ostream& print2(Container& c, std::ostream &os)\n{\n    for (auto it = c.begin(); it != c.end(); ++it)\n        os << *it << \"\\n\";\n\n    return os;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"openCLGLUtilities.hpp\"\n\n\ncl::Context createCLGLContext(cl_device_type type, cl_vendor vendor) {\n\n    cl::Platform platform = getPlatform(type, vendor);\n\n#if defined(__APPLE__) || defined(__MACOSX)\n    \/\/ Apple (untested)\n    cl_context_properties cps[] = {\n        CL_CGL_SHAREGROUP_KHR,\n        (cl_context_properties)CGLGetShareGroup(CGLGetCurrentContext()),\n        CL_CONTEXT_PLATFORM,\n        (cl_context_properties)(platform)(),\n        0\n    };\n#else\n#ifdef _WIN32\n    \/\/ Windows\n    cl_context_properties cps[] = {\n        CL_GL_CONTEXT_KHR,\n        (cl_context_properties)wglGetCurrentContext(),\n        CL_WGL_HDC_KHR,\n        (cl_context_properties)wglGetCurrentDC(),\n        CL_CONTEXT_PLATFORM,\n        (cl_context_properties)(platform)(),\n        0\n    };\n#else\n    \/\/ Linux\n    cl_context_properties cps[] = {\n        CL_GL_CONTEXT_KHR,\n        (cl_context_properties)glXGetCurrentContext(),\n        CL_GLX_DISPLAY_KHR,\n        (cl_context_properties)glXGetCurrentDisplay(),\n        CL_CONTEXT_PLATFORM,\n        (cl_context_properties)(platform)(),\n        0\n    };\n#endif\n#endif\n\n    try {\n        cl::Context context = cl::Context(type, cps);\n\n        return context;\n    } catch(cl::Error error) {\n        throw cl::Error(1, \"Failed to create an OpenCL context!\");\n    }\n}\n<commit_msg>added contribution by Jim Vaughn for selecting a SINGLE valid device for a CL-GL context<commit_after>#include \"openCLGLUtilities.hpp\"\n\n\ncl::Context createCLGLContext(cl_device_type type, cl_vendor vendor) {\n\n    cl::Platform platform = getPlatform(type, vendor);\n\n#if defined(__APPLE__) || defined(__MACOSX)\n    \/\/ Apple (untested)\n    cl_context_properties cps[] = {\n        CL_CGL_SHAREGROUP_KHR,\n        (cl_context_properties)CGLGetShareGroup(CGLGetCurrentContext()),\n        CL_CONTEXT_PLATFORM,\n        (cl_context_properties)(platform)(),\n        0\n    };\n#else\n#ifdef _WIN32\n    \/\/ Windows\n    cl_context_properties cps[] = {\n        CL_GL_CONTEXT_KHR,\n        (cl_context_properties)wglGetCurrentContext(),\n        CL_WGL_HDC_KHR,\n        (cl_context_properties)wglGetCurrentDC(),\n        CL_CONTEXT_PLATFORM,\n        (cl_context_properties)(platform)(),\n        0\n    };\n#else\n    \/\/ Linux\n    cl_context_properties cps[] = {\n        CL_GL_CONTEXT_KHR,\n        (cl_context_properties)glXGetCurrentContext(),\n        CL_GLX_DISPLAY_KHR,\n        (cl_context_properties)glXGetCurrentDisplay(),\n        CL_CONTEXT_PLATFORM,\n        (cl_context_properties)(platform)(),\n        0\n    };\n#endif\n#endif\n\n    try {\n\n\t\t\/\/ We need to check if there is more than one device first\n\t\tcl::vector<cl::Device> devices;\n\t\tcl::vector<cl::Device> singleDevice;\n\t\tplatform.getDevices(type, &devices);\n\t\tcl::Context context;\n\n\t\t\/\/ If more than one CL device find out which one is associated with GL context\n\t\tif(devices.size() > 1) {\n\t\t\tcl::Device interopDevice = getValidGLCLInteropDevice(platform, cps);\n\t\t\tsingleDevice.push_back(interopDevice);\n\t\t\tcontext = cl::Context(singleDevice, cps);\n\t\t} else {\n\t\t\tcontext = cl::Context(type, cps);\n\t\t}\n\n        return context;\n    } catch(cl::Error error) {\n        throw error;\n    }\n}\n\n\ncl::Device getValidGLCLInteropDevice(cl::Platform platform, cl_context_properties* properties) {\n    \/\/ Function for finding a valid device for CL-GL context. \n    \/\/ Thanks to Jim Vaughn for this contribution\n\tcl::Device displayDevice;\n\t\n\tcl_device_id interopDeviceId;\n\n\tint status;\n\tsize_t deviceSize = 0;\n\n\t\/\/ Load extension function call\n\tclGetGLContextInfoKHR_fn glGetGLContextInfo_func = (clGetGLContextInfoKHR_fn)clGetExtensionFunctionAddress(\"clGetGLContextInfoKHR\");\n\n\t\/\/ Ask for the CL device associated with the GL context\n\tstatus = glGetGLContextInfo_func( properties, \n\t\t\t\t\t\t\t\t\t  CL_CURRENT_DEVICE_FOR_GL_CONTEXT_KHR,\n\t\t\t\t\t\t\t\t\t  sizeof(cl_device_id), \n\t\t\t\t\t\t\t\t\t  &interopDeviceId, \n\t\t\t\t\t\t\t\t\t  &deviceSize);\n\t\n\tif(deviceSize == 0) {\n        throw cl::Error(1,\"No GLGL devices found for current platform\");\n\t}\n\n\tif(status != CL_SUCCESS)\n\t{\n\t\tthrow cl::Error(1, \"Could not get CLGL interop device for the current platform. Failure occured during call to clGetGLContextInfoKHR.\");\n\t}\n\n\treturn cl::Device(interopDeviceId);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <docopt.h>\n#include <functional>\n#include <iostream>\n#include <sstream>\n#include <utility>\n\n#include <nsearch\/FASTA\/Reader.h>\n#include <nsearch\/Sequence.h>\n#include <nsearch\/Alphabet\/DNA.h>\n#include <nsearch\/Alphabet\/Protein.h>\n\n#include \"Common.h\"\n#include \"Filter.h\"\n#include \"Merge.h\"\n#include \"Search.h\"\n#include \"Stats.h\"\n\nStats gStats;\n\nstatic const char USAGE[] = R\"(\n  Metagenomics tool for the rest of us.\n\n  Usage:\n    nsearch search --query=<queryfile> --db=<databasefile>\n      --out=<outputfile> --min-identity=<minidentity> [--max-accepts=<maxaccepts>] [--max-rejects=<maxrejects>] [--protein] [--strand=<strand>]\n    nsearch merge --forward=<forwardfile> --reverse=<reversefile> --out=<outputfile>\n    nsearch filter --in=<inputfile> --out=<outputfile> [--max-expected-errors=<maxee>]\n\n  Options:\n    --min-identity=<minidentity>    Minimum identity threshold (e.g. 0.8).\n    --max-accepts=<maxaccepts>      Maximum number of successful hits reported for one query [default: 1].\n    --max-rejects=<maxrejects>      Abort after this many candidates were rejected [default: 8].\n    --max-expected-errors=<maxee>   Maximum number of expected errors [default: 1.0].\n    --strand=<strand>               Strand to search on (plus, minus or both). If minus (or both), queries are reverse complemented [default: plus]).\n)\";\n\nvoid PrintSummaryHeader() {\n  std::cout << std::endl << std::endl;\n  std::cout << \"Summary:\" << std::endl;\n}\n\nvoid PrintSummaryLine( const float value, const std::string& line,\n                       const float    total = 0.0,\n                       const UnitType unit  = UnitType::COUNTS ) {\n  std::ios::fmtflags f( std::cout.flags() );\n  std::cout << std::setw( 10 ) << ValueWithUnit( value, unit );\n  std::cout << ' ' << line;\n  if( total > 0.0 ) {\n    std::cout << \" (\" << value \/ total * 100.0 << \"%)\";\n  }\n  std::cout << std::endl;\n  std::cout.flags( f );\n}\n\nusing Args = std::map< std::string, docopt::value > ;\n\ntemplate < typename A >\nSearchParams< A > ParseSearchParams( const Args& args ) {\n  SearchParams< A > sp;\n\n  sp.minIdentity = std::stof( args.at( \"--min-identity\" ).asString() );\n  sp.maxAccepts  = args.at( \"--max-accepts\" ).asLong();\n  sp.maxRejects  = args.at( \"--max-rejects\" ).asLong();\n\n  return sp;\n}\n\nint main( int argc, const char** argv ) {\n  Args args = docopt::docopt( USAGE, { argv + 1, argv + argc },\n                              true, \/\/ help\n                              APP_NAME );\n\n  \/\/ Print header\n  std::cout << APP_NAME << \" \" << APP_VERSION << \" (built on \"\n            << BUILD_TIMESTAMP << \")\" << std::endl;\n\n  \/\/ Search\n  if( args[ \"search\" ].asBool() ) {\n    gStats.StartTimer();\n\n    auto query      = args[ \"--query\" ].asString();\n    auto db         = args[ \"--db\" ].asString();\n    auto out        = args[ \"--out\" ].asString();\n\n\n    if( args[ \"--protein\" ].asBool() ) {\n      DoSearch< Protein >( query, db, out, ParseSearchParams< Protein >( args ) );\n    } else {\n      auto sp = ParseSearchParams< DNA >( args );\n\n      auto str = args[ \"--strand\" ].asString();\n      auto strand = DNA::Strand::Plus;\n      if( str == \"minus\" ) {\n        sp.strand = DNA::Strand::Minus;\n      } else if( str == \"both\" ) {\n        sp.strand = DNA::Strand::Both;\n      }\n\n      DoSearch< DNA >( query, db, out, sp );\n    }\n\n    gStats.StopTimer();\n\n    PrintSummaryHeader();\n    PrintSummaryLine( gStats.ElapsedMillis() \/ 1000.0, \"Seconds\" );\n  }\n\n  \/\/ Merge\n  if( args[ \"merge\" ].asBool() ) {\n    gStats.StartTimer();\n\n    DoMerge( args[ \"--forward\" ].asString(), args[ \"--reverse\" ].asString(),\n           args[ \"--out\" ].asString() );\n\n    gStats.StopTimer();\n\n    PrintSummaryHeader();\n    PrintSummaryLine( gStats.ElapsedMillis() \/ 1000.0, \"Seconds\" );\n    PrintSummaryLine( gStats.numProcessed \/ gStats.ElapsedMillis(),\n                      \"Processed\/ms\" );\n    PrintSummaryLine( gStats.numProcessed, \"Pairs\" );\n    PrintSummaryLine( gStats.numMerged, \"Merged\", gStats.numProcessed );\n    PrintSummaryLine( gStats.MeanMergedLength(), \"Mean merged length\" );\n  }\n\n  \/\/ Filter\n  if( args[ \"filter\" ].asBool() ) {\n    gStats.StartTimer();\n\n    auto in    = args[ \"--in\" ].asString();\n    auto out   = args[ \"--out\" ].asString();\n    auto maxee = std::stof( args[ \"--max-expected-errors\" ].asString() );\n\n    DoFilter( in, out, maxee );\n\n    gStats.StopTimer();\n\n    PrintSummaryHeader();\n    PrintSummaryLine( gStats.ElapsedMillis() \/ 1000.0, \"Seconds\" );\n  }\n\n  return 0;\n}\n<commit_msg>Cleanup<commit_after>#include <docopt.h>\n#include <functional>\n#include <iostream>\n#include <sstream>\n#include <utility>\n\n#include <nsearch\/FASTA\/Reader.h>\n#include <nsearch\/Sequence.h>\n#include <nsearch\/Alphabet\/DNA.h>\n#include <nsearch\/Alphabet\/Protein.h>\n\n#include \"Common.h\"\n#include \"Filter.h\"\n#include \"Merge.h\"\n#include \"Search.h\"\n#include \"Stats.h\"\n\nStats gStats;\n\nstatic const char USAGE[] = R\"(\n  Metagenomics tool for the rest of us.\n\n  Usage:\n    nsearch search --query=<queryfile> --db=<databasefile>\n      --out=<outputfile> --min-identity=<minidentity> [--max-accepts=<maxaccepts>] [--max-rejects=<maxrejects>] [--protein] [--strand=<strand>]\n    nsearch merge --forward=<forwardfile> --reverse=<reversefile> --out=<outputfile>\n    nsearch filter --in=<inputfile> --out=<outputfile> [--max-expected-errors=<maxee>]\n\n  Options:\n    --min-identity=<minidentity>    Minimum identity threshold (e.g. 0.8).\n    --max-accepts=<maxaccepts>      Maximum number of successful hits reported for one query [default: 1].\n    --max-rejects=<maxrejects>      Abort after this many candidates were rejected [default: 8].\n    --max-expected-errors=<maxee>   Maximum number of expected errors [default: 1.0].\n    --strand=<strand>               Strand to search on (plus, minus or both). If minus (or both), queries are reverse complemented [default: plus]).\n)\";\n\nvoid PrintSummaryHeader() {\n  std::cout << std::endl << std::endl;\n  std::cout << \"Summary:\" << std::endl;\n}\n\nvoid PrintSummaryLine( const float value, const std::string& line,\n                       const float    total = 0.0,\n                       const UnitType unit  = UnitType::COUNTS ) {\n  std::ios::fmtflags f( std::cout.flags() );\n  std::cout << std::setw( 10 ) << ValueWithUnit( value, unit );\n  std::cout << ' ' << line;\n  if( total > 0.0 ) {\n    std::cout << \" (\" << value \/ total * 100.0 << \"%)\";\n  }\n  std::cout << std::endl;\n  std::cout.flags( f );\n}\n\nusing Args = std::map< std::string, docopt::value > ;\n\ntemplate < typename A >\nvoid AddSpecialSearchParams( const Args& args, SearchParams< A >* sp ) {}\n\nvoid AddSpecialSearchParams( const Args& args, SearchParams< DNA >* sp ) {\n  auto str = args.at( \"--strand\" ).asString();\n  sp->strand = DNA::Strand::Plus;\n  if( str == \"minus\" ) {\n    sp->strand = DNA::Strand::Minus;\n  } else if( str == \"both\" ) {\n    sp->strand = DNA::Strand::Both;\n  }\n}\n\ntemplate < typename A >\nSearchParams< A > ParseSearchParams( const Args& args ) {\n  SearchParams< A > sp;\n\n  sp.minIdentity = std::stof( args.at( \"--min-identity\" ).asString() );\n  sp.maxAccepts  = args.at( \"--max-accepts\" ).asLong();\n  sp.maxRejects  = args.at( \"--max-rejects\" ).asLong();\n\n  AddSpecialSearchParams( args, &sp );\n\n  return sp;\n}\n\nint main( int argc, const char** argv ) {\n  Args args = docopt::docopt( USAGE, { argv + 1, argv + argc },\n                              true, \/\/ help\n                              APP_NAME );\n\n  \/\/ Print header\n  std::cout << APP_NAME << \" \" << APP_VERSION << \" (built on \"\n            << BUILD_TIMESTAMP << \")\" << std::endl;\n\n  \/\/ Search\n  if( args[ \"search\" ].asBool() ) {\n    gStats.StartTimer();\n\n    auto query      = args[ \"--query\" ].asString();\n    auto db         = args[ \"--db\" ].asString();\n    auto out        = args[ \"--out\" ].asString();\n\n\n    if( args[ \"--protein\" ].asBool() ) {\n      DoSearch< Protein >( query, db, out, ParseSearchParams< Protein >( args ) );\n    } else {\n      DoSearch< DNA >( query, db, out, ParseSearchParams< DNA >( args ) );\n    }\n\n    gStats.StopTimer();\n\n    PrintSummaryHeader();\n    PrintSummaryLine( gStats.ElapsedMillis() \/ 1000.0, \"Seconds\" );\n  }\n\n  \/\/ Merge\n  if( args[ \"merge\" ].asBool() ) {\n    gStats.StartTimer();\n\n    DoMerge( args[ \"--forward\" ].asString(), args[ \"--reverse\" ].asString(),\n           args[ \"--out\" ].asString() );\n\n    gStats.StopTimer();\n\n    PrintSummaryHeader();\n    PrintSummaryLine( gStats.ElapsedMillis() \/ 1000.0, \"Seconds\" );\n    PrintSummaryLine( gStats.numProcessed \/ gStats.ElapsedMillis(),\n                      \"Processed\/ms\" );\n    PrintSummaryLine( gStats.numProcessed, \"Pairs\" );\n    PrintSummaryLine( gStats.numMerged, \"Merged\", gStats.numProcessed );\n    PrintSummaryLine( gStats.MeanMergedLength(), \"Mean merged length\" );\n  }\n\n  \/\/ Filter\n  if( args[ \"filter\" ].asBool() ) {\n    gStats.StartTimer();\n\n    auto in    = args[ \"--in\" ].asString();\n    auto out   = args[ \"--out\" ].asString();\n    auto maxee = std::stof( args[ \"--max-expected-errors\" ].asString() );\n\n    DoFilter( in, out, maxee );\n\n    gStats.StopTimer();\n\n    PrintSummaryHeader();\n    PrintSummaryLine( gStats.ElapsedMillis() \/ 1000.0, \"Seconds\" );\n  }\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *                                                                       *\n * Open Dynamics Engine, Copyright (C) 2001,2002 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#include <ode\/config.h>\n#include <ode\/mass.h>\n#include <ode\/odemath.h>\n#include <ode\/matrix.h>\n\n\n#define _I(i,j) I[(i)*4+(j)]\n\n\n\/\/ return 1 if ok, 0 if bad\n\nstatic int checkMass (dMass *m)\n{\n  int i;\n\n  if (m->mass <= 0) {\n    dDEBUGMSG (\"mass must be > 0\");\n    return 0;\n  }\n  if (!dIsPositiveDefinite (m->I,3)) {\n    dDEBUGMSG (\"inertia must be positive definite\");\n    return 0;\n  }\n\n  \/\/ verify that the center of mass position is consistent with the mass\n  \/\/ and inertia matrix. this is done by checking that the inertia around\n  \/\/ the center of mass is also positive definite. from the comment in\n  \/\/ dMassTranslate(), if the body is translated so that its center of mass\n  \/\/ is at the point of reference, then the new inertia is:\n  \/\/   I + mass*crossmat(c)^2\n  \/\/ note that requiring this to be positive definite is exactly equivalent\n  \/\/ to requiring that the spatial inertia matrix\n  \/\/   [ mass*eye(3,3)   M*crossmat(c)^T ]\n  \/\/   [ M*crossmat(c)   I               ]\n  \/\/ is positive definite, given that I is PD and mass>0. see the theorem\n  \/\/ about partitioned PD matrices for proof.\n\n  dMatrix3 I2,chat;\n  dSetZero (chat,12);\n  dCROSSMAT (chat,m->c,4,+,-);\n  dMULTIPLY0_333 (I2,chat,chat);\n  for (i=0; i<3; i++) I2[i] = m->I[i] + m->mass*I2[i];\n  for (i=4; i<7; i++) I2[i] = m->I[i] + m->mass*I2[i];\n  for (i=8; i<11; i++) I2[i] = m->I[i] + m->mass*I2[i];\n  if (!dIsPositiveDefinite (I2,3)) {\n    dDEBUGMSG (\"center of mass inconsistent with mass parameters\");\n    return 0;\n  }\n  return 1;\n}\n\n\nvoid dMassSetZero (dMass *m)\n{\n  dAASSERT (m);\n  m->mass = REAL(0.0);\n  dSetZero (m->c,sizeof(m->c) \/ sizeof(dReal));\n  dSetZero (m->I,sizeof(m->I) \/ sizeof(dReal));\n}\n\n\nvoid dMassSetParameters (dMass *m, dReal themass,\n\t\t\t dReal cgx, dReal cgy, dReal cgz,\n\t\t\t dReal I11, dReal I22, dReal I33,\n\t\t\t dReal I12, dReal I13, dReal I23)\n{\n  dAASSERT (m);\n  dMassSetZero (m);\n  m->mass = themass;\n  m->c[0] = cgx;\n  m->c[1] = cgy;\n  m->c[2] = cgz;\n  m->_I(0,0) = I11;\n  m->_I(1,1) = I22;\n  m->_I(2,2) = I33;\n  m->_I(0,1) = I12;\n  m->_I(0,2) = I13;\n  m->_I(1,2) = I23;\n  m->_I(1,0) = I12;\n  m->_I(2,0) = I13;\n  m->_I(2,1) = I23;\n  checkMass (m);\n}\n\n\nvoid dMassSetSphere (dMass *m, dReal density, dReal radius)\n{\n  dAASSERT (m);\n  dMassSetZero (m);\n  m->mass = (REAL(4.0)\/REAL(3.0)) * M_PI * radius*radius*radius * density;\n  dReal II = REAL(0.4) * m->mass * radius*radius;\n  m->_I(0,0) = II;\n  m->_I(1,1) = II;\n  m->_I(2,2) = II;\n\n# ifndef dNODEBUG\n  checkMass (m);\n# endif\n}\n\n\nvoid dMassSetCappedCylinder (dMass *m, dReal density, int direction,\n\t\t\t     dReal a, dReal b)\n{\n  dReal M1,M2,Ia,Ib;\n  dAASSERT (m);\n  dUASSERT (direction >= 1 && direction <= 3,\"bad direction number\");\n  dMassSetZero (m);\n  M1 = M_PI*a*a*b*density;\t\t\/\/ cylinder mass\n  M2 = (REAL(4.0)\/REAL(3.0))*M_PI*a*a*a*density;\t\/\/ total cap mass\n  m->mass = M1+M2;\n  Ia = M1*(REAL(0.25)*a*a + (REAL(1.0)\/REAL(12.0))*b*b) +\n    M2*(REAL(0.4)*a*a + REAL(0.5)*b*b);\n  Ib = (M1*REAL(0.5) + M2*REAL(0.4))*a*a;\n  m->_I(0,0) = Ia;\n  m->_I(1,1) = Ia;\n  m->_I(2,2) = Ia;\n  m->_I(direction-1,direction-1) = Ib;\n\n# ifndef dNODEBUG\n  checkMass (m);\n# endif\n}\n\n\nvoid dMassSetCylinder (dMass *m, dReal density, int direction,\n\t\t       dReal radius, dReal length)\n{\n  dReal M,r2,I;\n  dAASSERT (m);\n  dMassSetZero (m);\n  r2 = radius*radius;\n  M = M_PI*r2*length*density;\t\t\/\/ cylinder mass\n  m->mass = M;\n  I = M*(REAL(0.25)*r2 + (REAL(1.0)\/REAL(12.0))*length*length);\n  m->_I(0,0) = I;\n  m->_I(1,1) = I;\n  m->_I(2,2) = I;\n  m->_I(direction-1,direction-1) = M*REAL(0.5)*r2;\n\n# ifndef dNODEBUG\n  checkMass (m);\n# endif\n}\n\n\nvoid dMassSetBox (dMass *m, dReal density,\n\t\t  dReal lx, dReal ly, dReal lz)\n{\n  dMassSetBoxTotal(m, lx*ly*lz*density, lx, ly, lz);\n}\n\nvoid dMassSetBoxTotal (dMass *m, dReal total_mass,\n\t\t  dReal lx, dReal ly, dReal lz)\n{\n  dAASSERT (m);\n  dMassSetZero (m);\n  m->mass = total_mass;\n  m->_I(0,0) = total_mass\/REAL(12.0) * (ly*ly + lz*lz);\n  m->_I(1,1) = total_mass\/REAL(12.0) * (lx*lx + lz*lz);\n  m->_I(2,2) = total_mass\/REAL(12.0) * (lx*lx + ly*ly);\n\n# ifndef dNODEBUG\n  checkMass (m);\n# endif\n}\n\n\nvoid dMassAdjust (dMass *m, dReal newmass)\n{\n  dAASSERT (m);\n  dReal scale = newmass \/ m->mass;\n  m->mass = newmass;\n  for (int i=0; i<3; i++) for (int j=0; j<3; j++) m->_I(i,j) *= scale;\n\n# ifndef dNODEBUG\n  checkMass (m);\n# endif\n}\n\n\nvoid dMassTranslate (dMass *m, dReal x, dReal y, dReal z)\n{\n  \/\/ if the body is translated by `a' relative to its point of reference,\n  \/\/ the new inertia about the point of reference is:\n  \/\/\n  \/\/   I + mass*(crossmat(c)^2 - crossmat(c+a)^2)\n  \/\/\n  \/\/ where c is the existing center of mass and I is the old inertia.\n\n  int i,j;\n  dMatrix3 ahat,chat,t1,t2;\n  dReal a[3];\n\n  dAASSERT (m);\n\n  \/\/ adjust inertia matrix\n  dSetZero (chat,12);\n  dCROSSMAT (chat,m->c,4,+,-);\n  a[0] = x + m->c[0];\n  a[1] = y + m->c[1];\n  a[2] = z + m->c[2];\n  dSetZero (ahat,12);\n  dCROSSMAT (ahat,a,4,+,-);\n  dMULTIPLY0_333 (t1,ahat,ahat);\n  dMULTIPLY0_333 (t2,chat,chat);\n  for (i=0; i<3; i++) for (j=0; j<3; j++)\n    m->_I(i,j) += m->mass * (t2[i*4+j]-t1[i*4+j]);\n\n  \/\/ ensure perfect symmetry\n  m->_I(1,0) = m->_I(0,1);\n  m->_I(2,0) = m->_I(0,2);\n  m->_I(2,1) = m->_I(1,2);\n\n  \/\/ adjust center of mass\n  m->c[0] += x;\n  m->c[1] += y;\n  m->c[2] += z;\n\n# ifndef dNODEBUG\n  checkMass (m);\n# endif\n}\n\n\nvoid dMassRotate (dMass *m, const dMatrix3 R)\n{\n  \/\/ if the body is rotated by `R' relative to its point of reference,\n  \/\/ the new inertia about the point of reference is:\n  \/\/\n  \/\/   R * I * R'\n  \/\/\n  \/\/ where I is the old inertia.\n\n  dMatrix3 t1;\n  dReal t2[3];\n\n  dAASSERT (m);\n\n  \/\/ rotate inertia matrix\n  dMULTIPLY2_333 (t1,m->I,R);\n  dMULTIPLY0_333 (m->I,R,t1);\n\n  \/\/ ensure perfect symmetry\n  m->_I(1,0) = m->_I(0,1);\n  m->_I(2,0) = m->_I(0,2);\n  m->_I(2,1) = m->_I(1,2);\n\n  \/\/ rotate center of mass\n  dMULTIPLY0_331 (t2,R,m->c);\n  m->c[0] = t2[0];\n  m->c[1] = t2[1];\n  m->c[2] = t2[2];\n\n# ifndef dNODEBUG\n  checkMass (m);\n# endif\n}\n\n\nvoid dMassAdd (dMass *a, const dMass *b)\n{\n  int i;\n  dAASSERT (a && b);\n  dReal denom = dRecip (a->mass + b->mass);\n  for (i=0; i<3; i++) a->c[i] = (a->c[i]*a->mass + b->c[i]*b->mass)*denom;\n  a->mass += b->mass;\n  for (i=0; i<12; i++) a->I[i] += b->I[i];\n}\n<commit_msg>minor formatting changes<commit_after>\/*************************************************************************\n *                                                                       *\n * Open Dynamics Engine, Copyright (C) 2001,2002 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#include <ode\/config.h>\n#include <ode\/mass.h>\n#include <ode\/odemath.h>\n#include <ode\/matrix.h>\n\n\n#define _I(i,j) I[(i)*4+(j)]\n\n\n\/\/ return 1 if ok, 0 if bad\n\nstatic int checkMass (dMass *m)\n{\n  int i;\n\n  if (m->mass <= 0) {\n    dDEBUGMSG (\"mass must be > 0\");\n    return 0;\n  }\n  if (!dIsPositiveDefinite (m->I,3)) {\n    dDEBUGMSG (\"inertia must be positive definite\");\n    return 0;\n  }\n\n  \/\/ verify that the center of mass position is consistent with the mass\n  \/\/ and inertia matrix. this is done by checking that the inertia around\n  \/\/ the center of mass is also positive definite. from the comment in\n  \/\/ dMassTranslate(), if the body is translated so that its center of mass\n  \/\/ is at the point of reference, then the new inertia is:\n  \/\/   I + mass*crossmat(c)^2\n  \/\/ note that requiring this to be positive definite is exactly equivalent\n  \/\/ to requiring that the spatial inertia matrix\n  \/\/   [ mass*eye(3,3)   M*crossmat(c)^T ]\n  \/\/   [ M*crossmat(c)   I               ]\n  \/\/ is positive definite, given that I is PD and mass>0. see the theorem\n  \/\/ about partitioned PD matrices for proof.\n\n  dMatrix3 I2,chat;\n  dSetZero (chat,12);\n  dCROSSMAT (chat,m->c,4,+,-);\n  dMULTIPLY0_333 (I2,chat,chat);\n  for (i=0; i<3; i++) I2[i] = m->I[i] + m->mass*I2[i];\n  for (i=4; i<7; i++) I2[i] = m->I[i] + m->mass*I2[i];\n  for (i=8; i<11; i++) I2[i] = m->I[i] + m->mass*I2[i];\n  if (!dIsPositiveDefinite (I2,3)) {\n    dDEBUGMSG (\"center of mass inconsistent with mass parameters\");\n    return 0;\n  }\n  return 1;\n}\n\n\nvoid dMassSetZero (dMass *m)\n{\n  dAASSERT (m);\n  m->mass = REAL(0.0);\n  dSetZero (m->c,sizeof(m->c) \/ sizeof(dReal));\n  dSetZero (m->I,sizeof(m->I) \/ sizeof(dReal));\n}\n\n\nvoid dMassSetParameters (dMass *m, dReal themass,\n\t\t\t dReal cgx, dReal cgy, dReal cgz,\n\t\t\t dReal I11, dReal I22, dReal I33,\n\t\t\t dReal I12, dReal I13, dReal I23)\n{\n  dAASSERT (m);\n  dMassSetZero (m);\n  m->mass = themass;\n  m->c[0] = cgx;\n  m->c[1] = cgy;\n  m->c[2] = cgz;\n  m->_I(0,0) = I11;\n  m->_I(1,1) = I22;\n  m->_I(2,2) = I33;\n  m->_I(0,1) = I12;\n  m->_I(0,2) = I13;\n  m->_I(1,2) = I23;\n  m->_I(1,0) = I12;\n  m->_I(2,0) = I13;\n  m->_I(2,1) = I23;\n  checkMass (m);\n}\n\n\nvoid dMassSetSphere (dMass *m, dReal density, dReal radius)\n{\n  dAASSERT (m);\n  dMassSetZero (m);\n  m->mass = (REAL(4.0)\/REAL(3.0)) * M_PI * radius*radius*radius * density;\n  dReal II = REAL(0.4) * m->mass * radius*radius;\n  m->_I(0,0) = II;\n  m->_I(1,1) = II;\n  m->_I(2,2) = II;\n\n# ifndef dNODEBUG\n  checkMass (m);\n# endif\n}\n\n\nvoid dMassSetCappedCylinder (dMass *m, dReal density, int direction,\n\t\t\t     dReal a, dReal b)\n{\n  dReal M1,M2,Ia,Ib;\n  dAASSERT (m);\n  dUASSERT (direction >= 1 && direction <= 3,\"bad direction number\");\n  dMassSetZero (m);\n  M1 = M_PI*a*a*b*density;\t\t\/\/ cylinder mass\n  M2 = (REAL(4.0)\/REAL(3.0))*M_PI*a*a*a*density;\t\/\/ total cap mass\n  m->mass = M1+M2;\n  Ia = M1*(REAL(0.25)*a*a + (REAL(1.0)\/REAL(12.0))*b*b) +\n    M2*(REAL(0.4)*a*a + REAL(0.5)*b*b);\n  Ib = (M1*REAL(0.5) + M2*REAL(0.4))*a*a;\n  m->_I(0,0) = Ia;\n  m->_I(1,1) = Ia;\n  m->_I(2,2) = Ia;\n  m->_I(direction-1,direction-1) = Ib;\n\n# ifndef dNODEBUG\n  checkMass (m);\n# endif\n}\n\n\nvoid dMassSetCylinder (dMass *m, dReal density, int direction,\n\t\t       dReal radius, dReal length)\n{\n  dReal M,r2,I;\n  dAASSERT (m);\n  dMassSetZero (m);\n  r2 = radius*radius;\n  M = M_PI*r2*length*density;\t\t\/\/ cylinder mass\n  m->mass = M;\n  I = M*(REAL(0.25)*r2 + (REAL(1.0)\/REAL(12.0))*length*length);\n  m->_I(0,0) = I;\n  m->_I(1,1) = I;\n  m->_I(2,2) = I;\n  m->_I(direction-1,direction-1) = M*REAL(0.5)*r2;\n\n# ifndef dNODEBUG\n  checkMass (m);\n# endif\n}\n\n\nvoid dMassSetBox (dMass *m, dReal density,\n\t\t  dReal lx, dReal ly, dReal lz)\n{\n  dMassSetBoxTotal (m, lx*ly*lz*density, lx, ly, lz);\n}\n\n\nvoid dMassSetBoxTotal (dMass *m, dReal total_mass,\n\t\t       dReal lx, dReal ly, dReal lz)\n{\n  dAASSERT (m);\n  dMassSetZero (m);\n  m->mass = total_mass;\n  m->_I(0,0) = total_mass\/REAL(12.0) * (ly*ly + lz*lz);\n  m->_I(1,1) = total_mass\/REAL(12.0) * (lx*lx + lz*lz);\n  m->_I(2,2) = total_mass\/REAL(12.0) * (lx*lx + ly*ly);\n\n# ifndef dNODEBUG\n  checkMass (m);\n# endif\n}\n\n\nvoid dMassAdjust (dMass *m, dReal newmass)\n{\n  dAASSERT (m);\n  dReal scale = newmass \/ m->mass;\n  m->mass = newmass;\n  for (int i=0; i<3; i++) for (int j=0; j<3; j++) m->_I(i,j) *= scale;\n\n# ifndef dNODEBUG\n  checkMass (m);\n# endif\n}\n\n\nvoid dMassTranslate (dMass *m, dReal x, dReal y, dReal z)\n{\n  \/\/ if the body is translated by `a' relative to its point of reference,\n  \/\/ the new inertia about the point of reference is:\n  \/\/\n  \/\/   I + mass*(crossmat(c)^2 - crossmat(c+a)^2)\n  \/\/\n  \/\/ where c is the existing center of mass and I is the old inertia.\n\n  int i,j;\n  dMatrix3 ahat,chat,t1,t2;\n  dReal a[3];\n\n  dAASSERT (m);\n\n  \/\/ adjust inertia matrix\n  dSetZero (chat,12);\n  dCROSSMAT (chat,m->c,4,+,-);\n  a[0] = x + m->c[0];\n  a[1] = y + m->c[1];\n  a[2] = z + m->c[2];\n  dSetZero (ahat,12);\n  dCROSSMAT (ahat,a,4,+,-);\n  dMULTIPLY0_333 (t1,ahat,ahat);\n  dMULTIPLY0_333 (t2,chat,chat);\n  for (i=0; i<3; i++) for (j=0; j<3; j++)\n    m->_I(i,j) += m->mass * (t2[i*4+j]-t1[i*4+j]);\n\n  \/\/ ensure perfect symmetry\n  m->_I(1,0) = m->_I(0,1);\n  m->_I(2,0) = m->_I(0,2);\n  m->_I(2,1) = m->_I(1,2);\n\n  \/\/ adjust center of mass\n  m->c[0] += x;\n  m->c[1] += y;\n  m->c[2] += z;\n\n# ifndef dNODEBUG\n  checkMass (m);\n# endif\n}\n\n\nvoid dMassRotate (dMass *m, const dMatrix3 R)\n{\n  \/\/ if the body is rotated by `R' relative to its point of reference,\n  \/\/ the new inertia about the point of reference is:\n  \/\/\n  \/\/   R * I * R'\n  \/\/\n  \/\/ where I is the old inertia.\n\n  dMatrix3 t1;\n  dReal t2[3];\n\n  dAASSERT (m);\n\n  \/\/ rotate inertia matrix\n  dMULTIPLY2_333 (t1,m->I,R);\n  dMULTIPLY0_333 (m->I,R,t1);\n\n  \/\/ ensure perfect symmetry\n  m->_I(1,0) = m->_I(0,1);\n  m->_I(2,0) = m->_I(0,2);\n  m->_I(2,1) = m->_I(1,2);\n\n  \/\/ rotate center of mass\n  dMULTIPLY0_331 (t2,R,m->c);\n  m->c[0] = t2[0];\n  m->c[1] = t2[1];\n  m->c[2] = t2[2];\n\n# ifndef dNODEBUG\n  checkMass (m);\n# endif\n}\n\n\nvoid dMassAdd (dMass *a, const dMass *b)\n{\n  int i;\n  dAASSERT (a && b);\n  dReal denom = dRecip (a->mass + b->mass);\n  for (i=0; i<3; i++) a->c[i] = (a->c[i]*a->mass + b->c[i]*b->mass)*denom;\n  a->mass += b->mass;\n  for (i=0; i<12; i++) a->I[i] += b->I[i];\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Tarjan for Node Biconnected Componentes - O(n + m)\n#include <bits\/stdc++.h>\nusing namespace std;\n\nconst int N = 1e5+5;\n\nint num[N], low[N], cnt, ch[N], art[N];\nint lb[N], bh[N], bn;\nint n;\n\nvector<int> adj[N], blc[N], st;\n\nvoid dfs(int u, int p) {\n  num[u] = low[u] = ++cnt;\n  ch[u] = adj[u].size();\n  st.push_back(u);\n\n  if (adj[u].size() == 1) blc[++bn].push_back(u);\n\n  for(int v : adj[u]) {\n    if (!num[v]) {\n      dfs(v, u), low[u] = min(low[u], low[v]);\n      if (low[v] == num[u]) {\n        if (p != -1 or ch[u] > 1) art[u] = 1;\n        blc[++bn].push_back(u), bh[bn] = u;\n        while(blc[bn].back() != v)\n          blc[bn].push_back(st.back()), st.pop_back();\n      }\n    }\n    else if (v != p) low[u] = min(low[u], num[v]), ch[v]--;\n  }\n\n  if (low[u] == num[u]) st.pop_back();\n}\n\nvoid tarjan() {\n  for(int u=1; u<=n; ++u) if (!num[u]) dfs(u, -1);\n  for(int b=1; b<=bn; ++b) for(int u : blc[b]) lb[u] = b;\n}\n\nvector<int> bct[N];\n\nvoid build_tree() {\n  for(int u=1; u<=n; ++u) for(int v : adj[u]) if (num[u] > num[v]) {\n    if (lb[u] == lb[v] or bh[lb[u]] == v) \/* edge u-v belongs to block lb[u] *\/;\n    else { \/* edge u-v connects  articulation *\/;\n      int x = (art[u] ? u + n : lb[u]), y = (art[v] ? v + n : lb[v]);\n      bct[x].push_back(y), bct[y].push_back(x);\n    }\n  }\n}\n<commit_msg>Minor changes in code + commenting on Block Cut Tree.<commit_after>\/\/ Tarjan for Block Cut Tree (Node Biconnected Componentes) - O(n + m)\n#define pb push_back\n#include <bits\/stdc++.h>\nusing namespace std;\n\nconst int N = 1e5+5;\n\n\/\/ Regular Tarjan stuff\nint n, num[N], low[N], cnt, ch[N], art[N];\nvector<int> adj[N], st;\n\nint lb[N]; \/\/ Last block that node is contained\nint bn; \/\/ Number of blocks\nvector<int> blc[N]; \/\/ List of nodes from block\n\nvoid dfs(int u, int p) {\n  num[u] = low[u] = ++cnt;\n  ch[u] = adj[u].size();\n  st.pb(u);\n\n  if (adj[u].size() == 1) blc[++bn].pb(u);\n\n  for(int v : adj[u]) {\n    if (!num[v]) {\n      dfs(v, u), low[u] = min(low[u], low[v]);\n      if (low[v] == num[u]) {\n        if (p != -1 or ch[u] > 1) art[u] = 1;\n        blc[++bn].pb(u);\n        while(blc[bn].back() != v)\n          blc[bn].pb(st.back()), st.pop_back();\n      }\n    }\n    else if (v != p) low[u] = min(low[u], num[v]), ch[v]--;\n  }\n\n  if (low[u] == num[u]) st.pop_back();\n}\n\n\/\/ Nodes from 1 .. n are blocks\n\/\/ Nodes from n+1 .. 2*n are articulations\nvector<int> bct[2*N]; \/\/ Adj list for Block Cut Tree\n\nvoid build_tree() {\n  for(int u=1; u<=n; ++u) for(int v : adj[u]) if (num[u] > num[v]) {\n    if (lb[u] == lb[v] or blc[lb[u]][0] == v) \/* edge u-v belongs to block lb[u] *\/;\n    else { \/* edge u-v belongs to block cut tree *\/;\n      int x = (art[u] ? u + n : lb[u]), y = (art[v] ? v + n : lb[v]);\n      bct[x].pb(y), bct[y].pb(x);\n    }\n  }\n}\n\nvoid tarjan() {\n  for(int u=1; u<=n; ++u) if (!num[u]) dfs(u, -1);\n  for(int b=1; b<=bn; ++b) for(int u : blc[b]) lb[u] = b;\n  build_tree();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- include\/seec\/Trace\/MemoryState.hpp --------------------------- C++ -===\/\/\n\/\/\n\/\/\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#ifndef SEEC_TRACE_MEMORYSTATE_HPP\n#define SEEC_TRACE_MEMORYSTATE_HPP\n\n#include \"seec\/DSA\/MappedMemoryBlock.hpp\"\n#include \"seec\/Trace\/TraceReader.hpp\"\n#include \"seec\/Util\/Maybe.hpp\"\n\n#include <thread>\n#include <map>\n\nnamespace seec {\n\nnamespace trace {\n\n\n\/\/\/ \\brief \nclass MemoryStateFragment {\n  \/\/\/ The block of memory for this fragment.\n  MappedMemoryBlock Block;\n  \n  \/\/\/ The event that created this block of memory.\n  EventLocation StateRecord;\n  \npublic:\n  \/\/\/ Constructor.\n  MemoryStateFragment(MappedMemoryBlock TheBlock, EventLocation TheEvent)\n  : Block(std::move(TheBlock)),\n    StateRecord(std::move(TheEvent))\n  {}\n\n  \/\/\/ Copy constructor.\n  MemoryStateFragment(MemoryStateFragment const &Other) = default;\n\n  \/\/\/ Move constructor.\n  MemoryStateFragment(MemoryStateFragment &&Other)\n  : Block(std::move(Other.Block)),\n    StateRecord(std::move(Other.StateRecord))\n  {}\n  \n  \/\/\/ Copy assignment.\n  MemoryStateFragment &operator=(MemoryStateFragment const &RHS) = default;\n  \n  \/\/\/ Move assignment.\n  MemoryStateFragment &operator=(MemoryStateFragment &&RHS) {\n    Block = std::move(RHS.Block);\n    StateRecord = std::move(RHS.StateRecord);\n    return *this;\n  }\n  \n  \/\/\/ \\name Accessors\n  \/\/\/ @{\n  \n  MappedMemoryBlock &getBlock() { return Block; }\n  \n  MappedMemoryBlock const &getBlock() const { return Block; }\n  \n  EventLocation const &getStateRecordLocation() const { return StateRecord; }\n  \n  \/\/\/ @}\n};\n\n\n\/\/\/ \\brief Represents the complete state of memory.\nclass MemoryState {\n  std::map<uint64_t, MemoryStateFragment> FragmentMap;\n  \n  \/\/ Don't allow copying\n  MemoryState(MemoryState const &) = delete;\n  MemoryState &operator=(MemoryState const &) = delete;\n  \npublic:\n  \/\/\/ Constructor.\n  MemoryState()\n  : FragmentMap()\n  {}\n  \n  \n  \/\/\/ \\name Accessors\n  \/\/\/ @{\n  \n  decltype(FragmentMap) const &getFragmentMap() const { return FragmentMap; }\n  \n  std::size_t getNumberOfFragments() const { return FragmentMap.size(); }\n  \n  \/\/\/ @} (Accessors)\n  \n  \n  \/\/\/ \\name Mutators\n  \/\/\/ @{\n  \n  void add(MappedMemoryBlock Block, EventLocation Event);\n  \n  void clear(MemoryArea Area);\n  \n  \/\/\/ @} (Mutators)\n};\n\n\/\/\/ Print a textual description of a MemoryState.\nllvm::raw_ostream &operator<<(llvm::raw_ostream &Out,\n                              MemoryState const &State);\n\n\n} \/\/ namespace trace (in seec)\n\n} \/\/ namespace seec\n\n#endif \/\/ SEEC_TRACE_MEMORYSTATE_HPP\n<commit_msg>Add doxygen documentation for much of MemoryState, and add the MemoryState::Region class, which represents an interval in a MemoryState. This class doesn't do much currently, but we will use it when accessing information about a region of memory (e.g. querying the contents of alloca'd memory).<commit_after>\/\/===- include\/seec\/Trace\/MemoryState.hpp --------------------------- C++ -===\/\/\n\/\/\n\/\/\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#ifndef SEEC_TRACE_MEMORYSTATE_HPP\n#define SEEC_TRACE_MEMORYSTATE_HPP\n\n#include \"seec\/DSA\/MappedMemoryBlock.hpp\"\n#include \"seec\/Trace\/TraceReader.hpp\"\n#include \"seec\/Util\/Maybe.hpp\"\n\n#include <thread>\n#include <map>\n\nnamespace seec {\n\nnamespace trace {\n\n\n\/\/\/ \\brief A fragment of a reconstructed memory state.\n\/\/\/\nclass MemoryStateFragment {\n  \/\/\/ The block of memory for this fragment.\n  MappedMemoryBlock Block;\n  \n  \/\/\/ The event that created this block of memory.\n  EventLocation StateRecord;\n  \npublic:\n  \/\/\/ \\name Constructors\n  \/\/\/ @{\n  \n  \/\/\/ \\brief Constructor.\n  MemoryStateFragment(MappedMemoryBlock TheBlock, EventLocation TheEvent)\n  : Block(std::move(TheBlock)),\n    StateRecord(std::move(TheEvent))\n  {}\n\n  \/\/\/ \\brief Copy constructor.\n  MemoryStateFragment(MemoryStateFragment const &Other) = default;\n\n  \/\/\/ \\brief Move constructor.\n  MemoryStateFragment(MemoryStateFragment &&Other)\n  : Block(std::move(Other.Block)),\n    StateRecord(std::move(Other.StateRecord))\n  {}\n  \n  \/\/\/ @} (Constructors)\n  \n  \n  \/\/\/ \\name Assignment\n  \/\/\/ @{\n  \n  \/\/\/ \\brief Copy assignment.\n  MemoryStateFragment &operator=(MemoryStateFragment const &RHS) = default;\n  \n  \/\/\/ \\brief Move assignment.\n  MemoryStateFragment &operator=(MemoryStateFragment &&RHS) {\n    Block = std::move(RHS.Block);\n    StateRecord = std::move(RHS.StateRecord);\n    return *this;\n  }\n  \n  \/\/\/ @} (Assignment)\n  \n  \n  \/\/\/ \\name Accessors\n  \/\/\/ @{\n  \n  \/\/\/ \\brief Get a reference to the block of memory for this fragment.\n  MappedMemoryBlock &getBlock() { return Block; }\n  \n  \/\/\/ \\brief Get a const reference to the block of memory for this fragment.\n  MappedMemoryBlock const &getBlock() const { return Block; }\n  \n  \/\/\/ \\brief Get the EventLocation for the event that caused this state.\n  EventLocation const &getStateRecordLocation() const { return StateRecord; }\n  \n  \/\/\/ @} (Accessors)\n};\n\n\n\/\/\/ \\brief The complete reconstructed state of memory.\n\/\/\/ \n\/\/\/ The memory state is stored as a collection of fragments. Each fragment\n\/\/\/ represents the state caused by a single event, such as a store or memcpy().\n\/\/\/ The fragments are kept in an ordered map, that maps the start address of\n\/\/\/ the fragment to a MemoryStateFragment object.\n\/\/\/\nclass MemoryState {\n  \/\/\/ Map fragments' start addresses to the fragments themselves.\n  std::map<uint64_t, MemoryStateFragment> FragmentMap;\n  \n  \/\/ Don't allow copying\n  MemoryState(MemoryState const &) = delete;\n  MemoryState &operator=(MemoryState const &) = delete;\n  \npublic:\n  \/\/\/ \\brief Construct an empty MemoryState.\n  MemoryState()\n  : FragmentMap()\n  {}\n  \n  \n  \/\/\/ \\name Accessors\n  \/\/\/ @{\n  \n  \/\/\/ \\brief Get the map from start addresses to fragments.\n  \/\/\/\n  decltype(FragmentMap) const &getFragmentMap() const { return FragmentMap; }\n  \n  \/\/\/ \\brief Get the total number of fragments.\n  \/\/\/\n  std::size_t getNumberOfFragments() const { return FragmentMap.size(); }\n  \n  \/\/\/ @} (Accessors)\n  \n  \n  \/\/\/ \\name Mutators\n  \/\/\/ @{\n  \n  \/\/\/ \\brief Add a memory block caused by an event.\n  \/\/\/\n  void add(MappedMemoryBlock Block, EventLocation Event);\n  \n  \/\/\/ \\brief Clear a region of memory.\n  \/\/\/\n  void clear(MemoryArea Area);\n  \n  \/\/\/ @} (Mutators)\n  \n  \n  \/\/\/ \\name Regions\n  \/\/\/ @{\n  \n  \/\/\/ \\brief Represents a single region of MemoryState.\n  \/\/\/\n  class Region {\n    MemoryState const &State; \/\/\/< The state that this region belongs to.\n    \n    MemoryArea const Area; \/\/\/< The area that this region covers.\n  \n  public:\n    \/\/\/ \\name Constructors\n    \/\/\/ @{\n    \n    \/\/\/ \\brief Construct a new Region covering an area in the given state.\n    \/\/\/\n    Region(MemoryState const &InState, MemoryArea RegionArea)\n    : State(InState),\n      Area(RegionArea)\n    {}\n    \n    \/\/\/ \\brief Copy constructor.\n    Region(Region const &) = default;\n    \n    \/\/\/ \\brief Move constructor.\n    Region(Region &&) = default;\n    \n    \/\/\/ @} (Constructors)\n    \n    \/\/\/ \\name Accessors\n    \/\/\/ @{\n    \n    \/\/\/ \\brief Get the state that this region belongs to.\n    MemoryState const &getState() const { return State; }\n    \n    \/\/\/ \\brief Get the area that this region covers.\n    MemoryArea const &getArea() const { return Area; }\n    \n    \/\/\/ @}\n  };\n  \n  \/\/\/ \\brief Get a Region covering the given area.\n  \/\/\/\n  Region getRegion(MemoryArea Area) const {\n    return Region(*this, Area);\n  }\n  \n  \/\/\/ @} (Regions)\n};\n\n\/\/\/ Print a textual description of a MemoryState.\nllvm::raw_ostream &operator<<(llvm::raw_ostream &Out,\n                              MemoryState const &State);\n\n\n} \/\/ namespace trace (in seec)\n\n} \/\/ namespace seec\n\n#endif \/\/ SEEC_TRACE_MEMORYSTATE_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/* augmentor_base.cc\n\n   Jeremy Barnes, 4 March 2012\n   Copyright (c) 2012 Datacratic.  All rights reserved.\n\n   Object that handles doing augmented bid requests.\n*\/\n\n#include \"augmentor_base.h\"\n#include \"soa\/service\/zmq_utils.h\"\n#include \"jml\/arch\/timers.h\"\n#include \"jml\/utils\/vector_utils.h\"\n#include \"jml\/arch\/futex.h\"\n\n\nusing namespace std;\nusing namespace ML;\n\n\nnamespace RTBKIT {\n\n\n\/*****************************************************************************\/\n\/* AUGMENTOR                                                                 *\/\n\/*****************************************************************************\/\n\n\/\/ Determined via a very scientific method: 2^16 should be enough... right?\nenum { QueueSize = 65536 };\n\nAugmentor::\nAugmentor(const std::string & augmentorName,\n          const std::string & serviceName,\n          std::shared_ptr<ServiceProxies> proxies)\n    : ServiceBase(serviceName, proxies),\n      augmentorName(augmentorName),\n      toRouters(getZmqContext()),\n      responseQueue(QueueSize),\n      loopMonitor(*this),\n      loadStabilizer(loopMonitor)\n{\n}\n\nAugmentor::\nAugmentor(const std::string & augmentorName,\n          const std::string & serviceName,\n          ServiceBase& parent)\n    : ServiceBase(serviceName, parent),\n      augmentorName(augmentorName),\n      toRouters(getZmqContext()),\n      responseQueue(QueueSize),\n      loopMonitor(*this),\n      loadStabilizer(loopMonitor)\n{\n}\n\nAugmentor::\n~Augmentor()\n{\n    shutdown();\n}\n\nvoid\nAugmentor::\ninit()\n{\n    responseQueue.onEvent = [=] (const Response& resp)\n        {\n            const AugmentationRequest& request = resp.first;\n            const AugmentationList& response = resp.second;\n\n            toRouters.sendMessage(\n                    request.router,\n                    \"RESPONSE\",\n                    \"1.0\",\n                    request.startTime,\n                    request.id.toString(),\n                    request.augmentor,\n                    chomp(response.toJson().toString()));\n\n            recordHit(\"messages.RESPONSE\");\n        };\n\n    addSource(\"Augmentor::responseQueue\", responseQueue);\n\n    toRouters.init(getServices()->config, serviceName());\n\n    toRouters.connectHandler = [=] (const std::string & newRouter)\n        {\n            toRouters.sendMessage(newRouter,\n                                  \"CONFIG\",\n                                  \"1.0\",\n                                  augmentorName);\n\n            recordHit(\"messages.CONFIG\");\n        };\n\n    toRouters.disconnectHandler = [=] (const std::string & oldRouter)\n        {\n            cerr << \"disconnected from router \" << oldRouter << endl;\n        };\n\n    toRouters.messageHandler = [=] (const std::string & router,\n                                    const std::vector<std::string> & message)\n        {\n            handleRouterMessage(router, message);\n        };\n\n\n    toRouters.connectAllServiceProviders(\"rtbRouterAugmentation\", \"augmentors\");\n\n    addSource(\"Augmentor::toRouters\", toRouters);\n\n    loopMonitor.init();\n    loopMonitor.addMessageLoop(\"augmentor\", this);\n    loopMonitor.onLoadChange = [=, &loadStabilizer] (double) {\n        recordLevel(loadStabilizer.shedProbability(), \"shedProbability\");\n    };\n    addSource(\"Augmentor::loopMonitor\", loopMonitor);\n}\n\nvoid\nAugmentor::\nstart()\n{\n    MessageLoop::start();\n}\n\nvoid\nAugmentor::\nshutdown()\n{\n    MessageLoop::shutdown();\n    toRouters.shutdown();\n}\n\nvoid\nAugmentor::\nconfigureAndWait()\n{\n#if 0\n    sendMessage(toRouter,\n                \"CONFIG\",\n                \"1.0\",\n                this->serviceName());\n#endif\n\n    throw ML::Exception(\"configureAndWait not re-implemented\");\n}\n\nvoid\nAugmentor::\nrespond(const AugmentationRequest & request, const AugmentationList & response)\n{\n    if (responseQueue.tryPush(make_pair(request, response)))\n        return;\n\n    cerr << \"Dropping augmentation response: response queue is full\" << endl;\n}\n\nvoid\nAugmentor::\nhandleRouterMessage(const std::string & router,\n                    const std::vector<std::string> & message)\n{\n   try {\n        const std::string & type = message.at(0);\n        recordHit(\"messages.\" + type);\n\n        \/\/cerr << \"got augmentor message of type \" << type << endl;\n        if (type == \"CONFIGOK\") {}\n\n        else if (type == \"AUGMENT\") {\n\n            if (loadStabilizer.shedMessage()) {\n                toRouters.sendMessage(\n                        router,\n                        \"RESPONSE\",\n                        message.at(1), \/\/ version\n                        message.at(7), \/\/ startTime\n                        message.at(3), \/\/ auctionId\n                        message.at(2), \/\/ augmentor\n                        \"null\");       \/\/ response\n\n                recordHit(\"shedMessages\");\n            }\n\n            const string & version = message.at(1);\n\n            if (version != \"1.0\")\n                throw ML::Exception(\"unexpected version in augment\");\n\n            AugmentationRequest request;\n            request.router = router;\n            request.timeAvailableMs = 0.05;\n            request.augmentor = message.at(2);\n            request.id = Id(message.at(3));\n\n            const string & bidRequestSource = message.at(4);\n            const string & bidRequestStr = message.at(5);\n\n            istringstream agentsStr(message.at(6));\n            ML::DB::Store_Reader reader(agentsStr);\n            reader.load(request.agents);\n\n            const string & startTimeStr = message.at(7);\n            request.startTime\n                = Date::fromSecondsSinceEpoch(strtod(startTimeStr.c_str(), 0));\n\n            if (onRequest) {\n                request.bidRequest.reset(\n                        BidRequest::parse(bidRequestSource, bidRequestStr));\n\n                onRequest(request);\n            }\n            else respond(request, AugmentationList());\n        }\n        else throw ML::Exception(\"unknown router message\");\n\n    } catch (const std::exception & exc) {\n        cerr << \"error handling augmentor message \" << message\n             << \": \" << exc.what() << endl;\n    }\n}\n\n\n\/*****************************************************************************\/\n\/* MULTI THREADED AUGMENTOR                                                   *\/\n\/*****************************************************************************\/\n\nMultiThreadedAugmentor::\nMultiThreadedAugmentor(const std::string & augmentorName,\n                       const std::string & serviceName,\n                       std::shared_ptr<ServiceProxies> proxies)\n    : Augmentor(augmentorName, serviceName, proxies),\n      numWithInfo(0),\n      ringBuffer(102400)\n{\n    Augmentor::onRequest\n        = boost::bind(&MultiThreadedAugmentor::pushRequest, this, _1);\n    numThreadsCreated = 0;\n}\n\nMultiThreadedAugmentor::\nMultiThreadedAugmentor(const std::string & augmentorName,\n                       const std::string & serviceName,\n                       ServiceBase& parent)\n    : Augmentor(augmentorName, serviceName, parent),\n      numWithInfo(0),\n      ringBuffer(102400)\n{\n    Augmentor::onRequest\n        = boost::bind(&MultiThreadedAugmentor::pushRequest, this, _1);\n    numThreadsCreated = 0;\n}\n\nMultiThreadedAugmentor::\n~MultiThreadedAugmentor()\n{\n    shutdown();\n}\n\nvoid\nMultiThreadedAugmentor::\ninit(int numThreads)\n{\n    if (numThreadsCreated)\n        throw ML::Exception(\"double init of augmentor\");\n\n    Augmentor::init();\n\n    shutdown_ = false;\n\n    for (unsigned i = 0;  i < numThreads;  ++i)\n        workers.create_thread([=] () { this->runWorker(); });\n\n    numThreadsCreated = numThreads;\n}\n\nvoid\nMultiThreadedAugmentor::\nshutdown()\n{\n    shutdown_ = true;\n\n    ML::memory_barrier();\n\n    for (unsigned i = 0;  i < numThreadsCreated;  ++i)\n        pushRequest(AugmentationRequest());\n\n    workers.join_all();\n\n    numThreadsCreated = 0;\n\n    Augmentor::shutdown();\n}\n\nvoid\nMultiThreadedAugmentor::\nrunWorker()\n{\n    while (!shutdown_) {\n        try {\n            auto req = ringBuffer.pop();\n            if (shutdown_)\n                return;\n            doRequestImpl(req);\n        } catch (const std::exception & exc) {\n            std::cerr << \"exception handling aug request: \"\n                      << exc.what() << std::endl;\n        }\n    }\n}\n\nvoid\nMultiThreadedAugmentor::\npushRequest(const AugmentationRequest & request)\n{\n    ringBuffer.push(request);\n}\n\n} \/\/ namespace RTBKIT\n\n<commit_msg>gcc-4.7: do not capture non-var loadStabilizer<commit_after>\/* augmentor_base.cc\n\n   Jeremy Barnes, 4 March 2012\n   Copyright (c) 2012 Datacratic.  All rights reserved.\n\n   Object that handles doing augmented bid requests.\n*\/\n\n#include \"augmentor_base.h\"\n#include \"soa\/service\/zmq_utils.h\"\n#include \"jml\/arch\/timers.h\"\n#include \"jml\/utils\/vector_utils.h\"\n#include \"jml\/arch\/futex.h\"\n\n\nusing namespace std;\nusing namespace ML;\n\n\nnamespace RTBKIT {\n\n\n\/*****************************************************************************\/\n\/* AUGMENTOR                                                                 *\/\n\/*****************************************************************************\/\n\n\/\/ Determined via a very scientific method: 2^16 should be enough... right?\nenum { QueueSize = 65536 };\n\nAugmentor::\nAugmentor(const std::string & augmentorName,\n          const std::string & serviceName,\n          std::shared_ptr<ServiceProxies> proxies)\n    : ServiceBase(serviceName, proxies),\n      augmentorName(augmentorName),\n      toRouters(getZmqContext()),\n      responseQueue(QueueSize),\n      loopMonitor(*this),\n      loadStabilizer(loopMonitor)\n{\n}\n\nAugmentor::\nAugmentor(const std::string & augmentorName,\n          const std::string & serviceName,\n          ServiceBase& parent)\n    : ServiceBase(serviceName, parent),\n      augmentorName(augmentorName),\n      toRouters(getZmqContext()),\n      responseQueue(QueueSize),\n      loopMonitor(*this),\n      loadStabilizer(loopMonitor)\n{\n}\n\nAugmentor::\n~Augmentor()\n{\n    shutdown();\n}\n\nvoid\nAugmentor::\ninit()\n{\n    responseQueue.onEvent = [=] (const Response& resp)\n        {\n            const AugmentationRequest& request = resp.first;\n            const AugmentationList& response = resp.second;\n\n            toRouters.sendMessage(\n                    request.router,\n                    \"RESPONSE\",\n                    \"1.0\",\n                    request.startTime,\n                    request.id.toString(),\n                    request.augmentor,\n                    chomp(response.toJson().toString()));\n\n            recordHit(\"messages.RESPONSE\");\n        };\n\n    addSource(\"Augmentor::responseQueue\", responseQueue);\n\n    toRouters.init(getServices()->config, serviceName());\n\n    toRouters.connectHandler = [=] (const std::string & newRouter)\n        {\n            toRouters.sendMessage(newRouter,\n                                  \"CONFIG\",\n                                  \"1.0\",\n                                  augmentorName);\n\n            recordHit(\"messages.CONFIG\");\n        };\n\n    toRouters.disconnectHandler = [=] (const std::string & oldRouter)\n        {\n            cerr << \"disconnected from router \" << oldRouter << endl;\n        };\n\n    toRouters.messageHandler = [=] (const std::string & router,\n                                    const std::vector<std::string> & message)\n        {\n            handleRouterMessage(router, message);\n        };\n\n\n    toRouters.connectAllServiceProviders(\"rtbRouterAugmentation\", \"augmentors\");\n\n    addSource(\"Augmentor::toRouters\", toRouters);\n\n    loopMonitor.init();\n    loopMonitor.addMessageLoop(\"augmentor\", this);\n    loopMonitor.onLoadChange = [=] (double) {\n        recordLevel(this->loadStabilizer.shedProbability(), \"shedProbability\");\n    };\n    addSource(\"Augmentor::loopMonitor\", loopMonitor);\n}\n\nvoid\nAugmentor::\nstart()\n{\n    MessageLoop::start();\n}\n\nvoid\nAugmentor::\nshutdown()\n{\n    MessageLoop::shutdown();\n    toRouters.shutdown();\n}\n\nvoid\nAugmentor::\nconfigureAndWait()\n{\n#if 0\n    sendMessage(toRouter,\n                \"CONFIG\",\n                \"1.0\",\n                this->serviceName());\n#endif\n\n    throw ML::Exception(\"configureAndWait not re-implemented\");\n}\n\nvoid\nAugmentor::\nrespond(const AugmentationRequest & request, const AugmentationList & response)\n{\n    if (responseQueue.tryPush(make_pair(request, response)))\n        return;\n\n    cerr << \"Dropping augmentation response: response queue is full\" << endl;\n}\n\nvoid\nAugmentor::\nhandleRouterMessage(const std::string & router,\n                    const std::vector<std::string> & message)\n{\n   try {\n        const std::string & type = message.at(0);\n        recordHit(\"messages.\" + type);\n\n        \/\/cerr << \"got augmentor message of type \" << type << endl;\n        if (type == \"CONFIGOK\") {}\n\n        else if (type == \"AUGMENT\") {\n\n            if (loadStabilizer.shedMessage()) {\n                toRouters.sendMessage(\n                        router,\n                        \"RESPONSE\",\n                        message.at(1), \/\/ version\n                        message.at(7), \/\/ startTime\n                        message.at(3), \/\/ auctionId\n                        message.at(2), \/\/ augmentor\n                        \"null\");       \/\/ response\n\n                recordHit(\"shedMessages\");\n            }\n\n            const string & version = message.at(1);\n\n            if (version != \"1.0\")\n                throw ML::Exception(\"unexpected version in augment\");\n\n            AugmentationRequest request;\n            request.router = router;\n            request.timeAvailableMs = 0.05;\n            request.augmentor = message.at(2);\n            request.id = Id(message.at(3));\n\n            const string & bidRequestSource = message.at(4);\n            const string & bidRequestStr = message.at(5);\n\n            istringstream agentsStr(message.at(6));\n            ML::DB::Store_Reader reader(agentsStr);\n            reader.load(request.agents);\n\n            const string & startTimeStr = message.at(7);\n            request.startTime\n                = Date::fromSecondsSinceEpoch(strtod(startTimeStr.c_str(), 0));\n\n            if (onRequest) {\n                request.bidRequest.reset(\n                        BidRequest::parse(bidRequestSource, bidRequestStr));\n\n                onRequest(request);\n            }\n            else respond(request, AugmentationList());\n        }\n        else throw ML::Exception(\"unknown router message\");\n\n    } catch (const std::exception & exc) {\n        cerr << \"error handling augmentor message \" << message\n             << \": \" << exc.what() << endl;\n    }\n}\n\n\n\/*****************************************************************************\/\n\/* MULTI THREADED AUGMENTOR                                                   *\/\n\/*****************************************************************************\/\n\nMultiThreadedAugmentor::\nMultiThreadedAugmentor(const std::string & augmentorName,\n                       const std::string & serviceName,\n                       std::shared_ptr<ServiceProxies> proxies)\n    : Augmentor(augmentorName, serviceName, proxies),\n      numWithInfo(0),\n      ringBuffer(102400)\n{\n    Augmentor::onRequest\n        = boost::bind(&MultiThreadedAugmentor::pushRequest, this, _1);\n    numThreadsCreated = 0;\n}\n\nMultiThreadedAugmentor::\nMultiThreadedAugmentor(const std::string & augmentorName,\n                       const std::string & serviceName,\n                       ServiceBase& parent)\n    : Augmentor(augmentorName, serviceName, parent),\n      numWithInfo(0),\n      ringBuffer(102400)\n{\n    Augmentor::onRequest\n        = boost::bind(&MultiThreadedAugmentor::pushRequest, this, _1);\n    numThreadsCreated = 0;\n}\n\nMultiThreadedAugmentor::\n~MultiThreadedAugmentor()\n{\n    shutdown();\n}\n\nvoid\nMultiThreadedAugmentor::\ninit(int numThreads)\n{\n    if (numThreadsCreated)\n        throw ML::Exception(\"double init of augmentor\");\n\n    Augmentor::init();\n\n    shutdown_ = false;\n\n    for (unsigned i = 0;  i < numThreads;  ++i)\n        workers.create_thread([=] () { this->runWorker(); });\n\n    numThreadsCreated = numThreads;\n}\n\nvoid\nMultiThreadedAugmentor::\nshutdown()\n{\n    shutdown_ = true;\n\n    ML::memory_barrier();\n\n    for (unsigned i = 0;  i < numThreadsCreated;  ++i)\n        pushRequest(AugmentationRequest());\n\n    workers.join_all();\n\n    numThreadsCreated = 0;\n\n    Augmentor::shutdown();\n}\n\nvoid\nMultiThreadedAugmentor::\nrunWorker()\n{\n    while (!shutdown_) {\n        try {\n            auto req = ringBuffer.pop();\n            if (shutdown_)\n                return;\n            doRequestImpl(req);\n        } catch (const std::exception & exc) {\n            std::cerr << \"exception handling aug request: \"\n                      << exc.what() << std::endl;\n        }\n    }\n}\n\nvoid\nMultiThreadedAugmentor::\npushRequest(const AugmentationRequest & request)\n{\n    ringBuffer.push(request);\n}\n\n} \/\/ namespace RTBKIT\n\n<|endoftext|>"}
{"text":"<commit_before>#include <bgfx.h>\n#include <bx\/bx.h>\n#include <bx\/timer.h>\n#include \"..\/common\/entry.h\"\n#include \"..\/common\/dbg.h\"\n#include \"..\/common\/math.h\"\n#include \"..\/common\/processevents.h\"\n\n#include \"..\/common\/font\/font_manager.h\"\n#include \"..\/common\/font\/text_buffer_manager.h\"\n\n#include <stdio.h>\n#include <string.h>\n\nstatic const char* s_shaderPath = NULL;\nlong int fsize(FILE* _file)\n{\n\tlong int pos = ftell(_file);\n\tfseek(_file, 0L, SEEK_END);\n\tlong int size = ftell(_file);\n\tfseek(_file, pos, SEEK_SET);\n\treturn size;\n}\n\nstatic const bgfx::Memory* loadShader(const char* _shaderPath, const char* _shaderName)\n{\n\tchar out[512];\n\tstrcpy(out, _shaderPath);\n\tstrcat(out, _shaderName);\n\tstrcat(out, \".bin\");\n\n\tFILE* file = fopen(out, \"rb\");\n\tif (NULL != file)\n\t{\n\t\tuint32_t size = (uint32_t)fsize(file);\n\t\tconst bgfx::Memory* mem = bgfx::alloc(size+1);\n\t\t\/*size_t ignore =*\/ fread(mem->data, 1, size, file);\n\t\t\/*BX_UNUSED(ignore);*\/\n\t\tfclose(file);\n\t\tmem->data[mem->size-1] = '\\0';\n\t\treturn mem;\n\t}\n\n\treturn NULL;\n}\n\n\nint _main_(int \/*_argc*\/, char** \/*_argv*\/)\n{\n    uint32_t width = 1280;\n\tuint32_t height = 720;\n\tuint32_t debug = BGFX_DEBUG_TEXT;\n\tuint32_t reset = 0;\n\n\tbgfx::init();\t\n\n\tbgfx::reset(width, height);\n\n\t\/\/ Enable debug text.\n\tbgfx::setDebug(debug);\n\n\t\/\/ Set view 0 clear state.\n\tbgfx::setViewClear(0\n\t\t, BGFX_CLEAR_COLOR_BIT|BGFX_CLEAR_DEPTH_BIT\n\t\t, 0x303030ff\t\t\n\t\t, 1.0f\n\t\t, 0\n\t\t);\n\n    \/\/ Setup root path for binary shaders. Shader binaries are different \n\t\/\/ for each renderer.\n\tswitch (bgfx::getRendererType() )\n\t{\n\tdefault:\n\tcase bgfx::RendererType::Direct3D9:\n\t\ts_shaderPath = \"shaders\/dx9\/\";\n\t\tbreak;\n\n\tcase bgfx::RendererType::Direct3D11:\n\t\ts_shaderPath = \"shaders\/dx11\/\";\n\t\tbreak;\n\n\tcase bgfx::RendererType::OpenGL:\n\t\ts_shaderPath = \"shaders\/glsl\/\";\n\t\tbreak;\n\n\tcase bgfx::RendererType::OpenGLES2:\n\tcase bgfx::RendererType::OpenGLES3:\n\t\ts_shaderPath = \"shaders\/gles\/\";\n\t\tbreak;\n\t}\n\n\tconst bgfx::Memory* mem;\n\tmem = loadShader(s_shaderPath, \"vs_font_basic\");\n\tbgfx::VertexShaderHandle vsh = bgfx::createVertexShader(mem);\n\tmem = loadShader(s_shaderPath, \"fs_font_basic\");\n\tbgfx::FragmentShaderHandle fsh = bgfx::createFragmentShader(mem);\n\tbgfx::ProgramHandle _basicProgram = bgfx::createProgram(vsh, fsh);\n\tbgfx::destroyVertexShader(vsh);\n\tbgfx::destroyFragmentShader(fsh);\t\n\n\tmem = loadShader(s_shaderPath, \"vs_font_distance_field\");\n\tvsh = bgfx::createVertexShader(mem);\t\n\tmem = loadShader(s_shaderPath, \"fs_font_distance_field\");\n\tfsh = bgfx::createFragmentShader(mem);\n\tbgfx::ProgramHandle _distanceProgram = bgfx::createProgram(vsh, fsh);\n\tbgfx::destroyVertexShader(vsh);\n\tbgfx::destroyFragmentShader(fsh);\n\t\n\tmem = loadShader(s_shaderPath, \"vs_font_distance_field_subpixel\");\n\tvsh = bgfx::createVertexShader(mem);\t\t\n\tmem = loadShader(s_shaderPath, \"fs_font_distance_field_subpixel\");\n\tfsh = bgfx::createFragmentShader(mem);\n\tbgfx::ProgramHandle _distanceSubpixelProgram = bgfx::createProgram(vsh, fsh);\n\tbgfx::destroyVertexShader(vsh);\n\tbgfx::destroyFragmentShader(fsh);\t\n\n\n\t\/\/init the text rendering system\n\tFontManager* fontManager = new FontManager(512);\n\tTextBufferManager* textBufferManager = new TextBufferManager(fontManager);\n\ttextBufferManager->init(_basicProgram, _distanceProgram, _distanceSubpixelProgram);\n\n\t\/\/load some truetype files\n\tTrueTypeHandle times_tt = fontManager->loadTrueTypeFromFile(\"c:\/windows\/fonts\/times.ttf\");\n\tTrueTypeHandle consola_tt = fontManager->loadTrueTypeFromFile(\"c:\/windows\/fonts\/consola.ttf\");\n\n\t\/\/create some usable font with of a specific size\n\tFontHandle times_24 = fontManager->createFontByPixelSize(times_tt, 0, 24);\n\t\t\n\t\/\/preload glyphs and blit them to atlas\n\tfontManager->preloadGlyph(times_24, L\"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ. \\n\");\n\t\t\n\t\/\/You can unload the truetype files at this stage, but in that case, the set of glyph's will be limited to the set of preloaded glyph\n\tfontManager->unloadTrueType(times_tt);\n\n\t\/\/this font doesn't have any preloaded glyph's but the truetype file is loaded\n\t\/\/so glyph will be generated as needed\n\tFontHandle consola_16 = fontManager->createFontByPixelSize(consola_tt, 0, 16);\n\t\n\t\/\/create a static text buffer compatible with alpha font\n\t\/\/a static text buffer content cannot be modified after its first submit.\n\tTextBufferHandle staticText = textBufferManager->createTextBuffer(FONT_TYPE_ALPHA, STATIC);\n\t\n\t\/\/the pen position represent the top left of the box of the first line of text\n\ttextBufferManager->setPenPosition(staticText, 20.0f, 100.0f);\n\t\n\t\/\/add some text to the buffer\n\ttextBufferManager->appendText(staticText, times_24, L\"The quick brown fox jumps over the lazy dog\\n\");\n\t\/\/the position of the pen is adjusted when there is an endline\n\t\n\t\/\/setup style colors \n\ttextBufferManager->setBackgroundColor(staticText, 0x551111FF);\n\ttextBufferManager->setUnderlineColor(staticText, 0xFF2222FF);\n\ttextBufferManager->setOverlineColor(staticText, 0x2222FFFF);\n\ttextBufferManager->setStrikeThroughColor(staticText, 0x22FF22FF);\n\t\n\n\t\/\/text + bkg\n\ttextBufferManager->setStyle(staticText, STYLE_BACKGROUND);\n\ttextBufferManager->appendText(staticText, times_24, L\"The quick brown fox jumps over the lazy dog\\n\");\n\n\t\/\/text + strike-through\n\ttextBufferManager->setStyle(staticText, STYLE_STRIKE_THROUGH);\n\ttextBufferManager->appendText(staticText, times_24, L\"The quick brown fox jumps over the lazy dog\\n\");\n\n\t\/\/text + overline\n\ttextBufferManager->setStyle(staticText, STYLE_OVERLINE);\n\ttextBufferManager->appendText(staticText, times_24, L\"The quick brown fox jumps over the lazy dog\\n\");\n\t\n\t\/\/text + underline\n\ttextBufferManager->setStyle(staticText, STYLE_UNDERLINE);\n\ttextBufferManager->appendText(staticText, times_24, L\"The quick brown fox jumps over the lazy dog\\n\");\n\n\t\n\t\/\/text + bkg + strike-through\n\ttextBufferManager->setStyle(staticText, STYLE_BACKGROUND|STYLE_STRIKE_THROUGH);\n\ttextBufferManager->appendText(staticText, times_24, L\"The quick brown fox jumps over the lazy dog\\n\");\n\n\t\/\/create a transient buffer for realtime data\t\n\tTextBufferHandle transientText = textBufferManager->createTextBuffer(FONT_TYPE_ALPHA, TRANSIENT);\t\n\t\t\t\n\t\n\tuint32_t w = 0,h = 0;\n    while (!processEvents(width, height, debug, reset) )\n\t{\n\t\t\n\t\tif(w!=width|| h!=height)\n\t\t{\n\t\t\tw=width;\n\t\t\th= height;\n\t\t\tprintf(\"ri: %d,%d\\n\",width,height);\n\t\t}\n\t\t\/\/ Set view 0 default viewport.\n\t\tbgfx::setViewRect(0, 0, 0, width, height);\n\n\t\t\/\/ This dummy draw call is here to make sure that view 0 is cleared\n\t\t\/\/ if no other draw calls are submitted to view 0.\n\t\tbgfx::submit(0);\n\n\t\tint64_t now = bx::getHPCounter();\n\t\tstatic int64_t last = now;\n\t\tconst int64_t frameTime = now - last;\n\t\tlast = now;\n\t\tconst double freq = double(bx::getHPFrequency() );\n\t\tconst double toMs = 1000.0\/freq;\n\n\t\t\/\/ Use debug font to print information about this example.\n\t\t\/\/bgfx::dbgTextClear();\n\t\t\/\/bgfx::dbgTextPrintf(0, 1, 0x4f, \"bgfx\/examples\/10-font\");\n\t\t\/\/bgfx::dbgTextPrintf(0, 2, 0x6f, \"Description: Use the font system to display text and styled text.\");\n\t\t\/\/bgfx::dbgTextPrintf(0, 3, 0x0f, \"Frame: % 7.3f[ms]\", double(frameTime)*toMs);\n\t\t\n\t\t\/\/Use transient text to display debug information\n\t\t\/\/Code below is similar to commented code above\n\t\twchar_t fpsText[64];\n\t\tswprintf(fpsText,L\"Frame: % 7.3f[ms]\", double(frameTime)*toMs);\n\t\t\n\t\ttextBufferManager->clearTextBuffer(transientText);\n\t\ttextBufferManager->setPenPosition(transientText, 20.0, 4.0f);\t\t\n\t\ttextBufferManager->appendText(transientText, consola_16, L\"bgfx\/examples\/10-font\\n\");\t\t\n\t\ttextBufferManager->appendText(transientText, consola_16, L\"Description: Use the font system to display text and styled text.\\n\");\n\t\ttextBufferManager->appendText(transientText, consola_16, fpsText);\n\n\t\tfloat at[3] = { 0, 0, 0.0f };\n\t\tfloat eye[3] = {0, 0, -1.0f };\n\t\t\n\t\tfloat view[16];\n\t\tfloat proj[16];\n\t\tmtxLookAt(view, eye, at);\t\t\n\t\t\/\/setup a top-left ortho matrix for screen space drawing\t\t\n\t\tfloat centering = 0.5f;\n\t\tmtxOrtho(proj, centering, width+centering,height+centering, centering,-1.0f, 1.0f);\n\n\t\t\/\/ Set view and projection matrix for view 0.\n\t\tbgfx::setViewTransform(0, view, proj);\n\n\t\t\/\/submit the debug text\n\t\ttextBufferManager->submitTextBuffer(transientText, 0);\n\n\t\t\/\/submit the static text\n\t\ttextBufferManager->submitTextBuffer(staticText, 0);\t\n\t\t\t\t\n        \/\/ Advance to next frame. Rendering thread will be kicked to \n\t\t\/\/ process submitted rendering primitives.\n\t\tbgfx::frame();\n\t}\n\t\n\t\n\tfontManager->unloadTrueType(consola_tt);\n\tfontManager->destroyFont(consola_16);\n\tfontManager->destroyFont(times_24);\n\n\ttextBufferManager->destroyTextBuffer(staticText);\n\ttextBufferManager->destroyTextBuffer(transientText);\t\n\n\tbgfx::destroyProgram(_basicProgram);\n\tbgfx::destroyProgram(_distanceProgram);\n\tbgfx::destroyProgram(_distanceSubpixelProgram);\t\n\n\tdelete textBufferManager;\n\tdelete fontManager;\t\n\t\n\t\/\/ Shutdown bgfx.\n    bgfx::shutdown();\n\n\treturn 0;\n}\n<commit_msg>better font sample<commit_after>#include <bgfx.h>\n#include <bx\/bx.h>\n#include <bx\/timer.h>\n#include \"..\/common\/entry.h\"\n#include \"..\/common\/dbg.h\"\n#include \"..\/common\/math.h\"\n#include \"..\/common\/processevents.h\"\n\n#include \"..\/common\/font\/font_manager.h\"\n#include \"..\/common\/font\/text_buffer_manager.h\"\n\n#include <stdio.h>\n#include <string.h>\n\nint _main_(int \/*_argc*\/, char** \/*_argv*\/)\n{\n    uint32_t width = 1280;\n\tuint32_t height = 720;\n\tuint32_t debug = BGFX_DEBUG_TEXT;\n\tuint32_t reset = 0;\n\n\tbgfx::init();\t\n\n\tbgfx::reset(width, height);\n\n\t\/\/ Enable debug text.\n\tbgfx::setDebug(debug);\n\n\t\/\/ Set view 0 clear state.\n\tbgfx::setViewClear(0\n\t\t, BGFX_CLEAR_COLOR_BIT|BGFX_CLEAR_DEPTH_BIT\n\t\t, 0x303030ff\t\t\n\t\t, 1.0f\n\t\t, 0\n\t\t);\n\t\t\t\n\t\/\/init the text rendering system\n\tFontManager* fontManager = new FontManager(512);\n\tTextBufferManager* textBufferManager = new TextBufferManager(fontManager);\n\n\t\/\/load some truetype files\n\tconst char* fontNames[7] = {\n\t\t\"font\/droidsans.ttf\",\n\t\t\"font\/chp-fire.ttf\", \n\t\t\"font\/bleeding_cowboys.ttf\",\n\t\t\"font\/mias_scribblings.ttf\",\n\t\t\"font\/ruritania.ttf\",\n\t\t\"font\/signika-regular.ttf\",\n\t\t\"font\/five_minutes.otf\"\n\t};\n\n\tconst uint32_t fontCount = sizeof(fontNames)\/sizeof(const char*);\n\t\t\n\tTrueTypeHandle fontFiles[fontCount];\n\tFontHandle fonts[fontCount];\n\tfor(int32_t  ii = 0; ii<fontCount ; ++ii)\n\t{\n\t\t\/\/instantiate a usable font\n\t\tfontFiles[ii] = fontManager->loadTrueTypeFromFile(fontNames[ii]);\n\t\tfonts[ii] = fontManager->createFontByPixelSize(fontFiles[ii], 0, 32);\n\t\t\/\/preload glyphs and blit them to atlas\n\t\tfontManager->preloadGlyph(fonts[ii], L\"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ. \\n\");\n\t\t\/\/You can unload the truetype files at this stage, but in that case, the set of glyph's will be limited to the set of preloaded glyph\n\t\tfontManager->unloadTrueType(fontFiles[ii]);\n\t}\n\t\n\tTrueTypeHandle console_tt = fontManager->loadTrueTypeFromFile(\"font\/visitor1.ttf\");\n\n\t\/\/this font doesn't have any preloaded glyph's but the truetype file is loaded\n\t\/\/so glyph will be generated as needed\n\tFontHandle consola_16 = fontManager->createFontByPixelSize(console_tt, 0, 10);\n\t\n\t\/\/create a static text buffer compatible with alpha font\n\t\/\/a static text buffer content cannot be modified after its first submit.\n\tTextBufferHandle staticText = textBufferManager->createTextBuffer(FONT_TYPE_ALPHA, STATIC);\n\t\n\t\/\/the pen position represent the top left of the box of the first line of text\n\ttextBufferManager->setPenPosition(staticText, 24.0f, 100.0f);\n\n\tfor(int32_t  ii = 0; ii<fontCount ; ++ii)\n\t{\n\t\t\/\/add some text to the buffer\n\t\ttextBufferManager->appendText(staticText, fonts[ii], L\"The quick brown fox jumps over the lazy dog\\n\");\n\t\t\/\/the position of the pen is adjusted when there is an endline\n\t}\n\n\t\/\/ Now write some styled text\t\t\n\t\t\n\t\/\/setup style colors \n\ttextBufferManager->setBackgroundColor(staticText, 0x551111FF);\n\ttextBufferManager->setUnderlineColor(staticText, 0xFF2222FF);\n\ttextBufferManager->setOverlineColor(staticText, 0x2222FFFF);\n\ttextBufferManager->setStrikeThroughColor(staticText, 0x22FF22FF);\t\n\n\t\/\/text + bkg\n\ttextBufferManager->setStyle(staticText, STYLE_BACKGROUND);\n\ttextBufferManager->appendText(staticText, fonts[0], L\"The quick \");\n\t\n\t\/\/text + strike-through\n\ttextBufferManager->setStyle(staticText, STYLE_STRIKE_THROUGH);\n\ttextBufferManager->appendText(staticText, fonts[0], L\"brown fox \");\n\t\n\t\/\/text + overline\n\ttextBufferManager->setStyle(staticText, STYLE_OVERLINE);\n\ttextBufferManager->appendText(staticText, fonts[0], L\"jumps over \");\n\n\t\/\/text + underline\n\ttextBufferManager->setStyle(staticText, STYLE_UNDERLINE);\n\ttextBufferManager->appendText(staticText, fonts[0], L\"the lazy \");\n\t\n\t\/\/text + bkg + strike-through\n\ttextBufferManager->setStyle(staticText, STYLE_BACKGROUND|STYLE_STRIKE_THROUGH);\n\ttextBufferManager->appendText(staticText, fonts[0], L\"dog\\n\");\n\t\n\t\n\t\/\/create a transient buffer for realtime data\t\n\tTextBufferHandle transientText = textBufferManager->createTextBuffer(FONT_TYPE_ALPHA, TRANSIENT);\t\n\t\t\t\n\tuint32_t w = 0,h = 0;\n    while (!processEvents(width, height, debug, reset) )\n\t{\n\t\t\n\t\tif(w!=width|| h!=height)\n\t\t{\n\t\t\tw=width;\n\t\t\th= height;\n\t\t\tprintf(\"ri: %d,%d\\n\",width,height);\n\t\t}\n\t\t\/\/ Set view 0 default viewport.\n\t\tbgfx::setViewRect(0, 0, 0, width, height);\n\n\t\t\/\/ This dummy draw call is here to make sure that view 0 is cleared\n\t\t\/\/ if no other draw calls are submitted to view 0.\n\t\tbgfx::submit(0);\n\n\t\tint64_t now = bx::getHPCounter();\n\t\tstatic int64_t last = now;\n\t\tconst int64_t frameTime = now - last;\n\t\tlast = now;\n\t\tconst double freq = double(bx::getHPFrequency() );\n\t\tconst double toMs = 1000.0\/freq;\n\n\t\t\/\/ Use debug font to print information about this example.\n\t\t\/\/bgfx::dbgTextClear();\n\t\t\/\/bgfx::dbgTextPrintf(0, 1, 0x4f, \"bgfx\/examples\/10-font\");\n\t\t\/\/bgfx::dbgTextPrintf(0, 2, 0x6f, \"Description: Use the font system to display text and styled text.\");\n\t\t\/\/bgfx::dbgTextPrintf(0, 3, 0x0f, \"Frame: % 7.3f[ms]\", double(frameTime)*toMs);\n\t\t\n\t\t\/\/Use transient text to display debug information\n\t\t\/\/Code below is similar to commented code above\n\t\twchar_t fpsText[64];\n\t\tswprintf(fpsText,L\"Frame: % 7.3f[ms]\", double(frameTime)*toMs);\n\t\t\n\t\ttextBufferManager->clearTextBuffer(transientText);\n\t\ttextBufferManager->setPenPosition(transientText, 20.0, 4.0f);\t\t\n\t\ttextBufferManager->appendText(transientText, consola_16, L\"bgfx\/examples\/10-font\\n\");\t\t\n\t\ttextBufferManager->appendText(transientText, consola_16, L\"Description: Use the font system to display text and styled text.\\n\");\n\t\ttextBufferManager->appendText(transientText, consola_16, fpsText);\n\n\t\tfloat at[3] = { 0, 0, 0.0f };\n\t\tfloat eye[3] = {0, 0, -1.0f };\n\t\t\n\t\tfloat view[16];\n\t\tfloat proj[16];\n\t\tmtxLookAt(view, eye, at);\t\t\n\t\t\/\/setup a top-left ortho matrix for screen space drawing\t\t\n\t\tfloat centering = 0.5f;\n\t\tmtxOrtho(proj, centering, width+centering,height+centering, centering,-1.0f, 1.0f);\n\n\t\t\/\/ Set view and projection matrix for view 0.\n\t\tbgfx::setViewTransform(0, view, proj);\n\n\t\t\/\/submit the debug text\n\t\ttextBufferManager->submitTextBuffer(transientText, 0);\n\n\t\t\/\/submit the static text\n\t\ttextBufferManager->submitTextBuffer(staticText, 0);\t\n\t\t\t\t\n        \/\/ Advance to next frame. Rendering thread will be kicked to \n\t\t\/\/ process submitted rendering primitives.\n\t\tbgfx::frame();\n\t}\n\t\n\t\n\tfontManager->unloadTrueType(console_tt);\n\t\/\/destroy the fonts\n\tfontManager->destroyFont(consola_16);\t\n\tfor(int32_t  ii = 0; ii<fontCount ; ++ii)\n\t{\n\t\tfontManager->destroyFont(fonts[ii]);\n\t}\n\n\ttextBufferManager->destroyTextBuffer(staticText);\n\ttextBufferManager->destroyTextBuffer(transientText);\t\n\n\tdelete textBufferManager;\n\tdelete fontManager;\t\n\t\n\t\/\/ Shutdown bgfx.\n    bgfx::shutdown();\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ bdlb_stringrefutil.cpp                                             -*-C++-*-\n#include <bdlb_stringrefutil.h>\n\n#include <bsls_ident.h>\n\n#include <bsl_cstring.h>  \/\/ 'bsl::memcmp'\n\nnamespace BloombergLP {\nnamespace bdlb {\n\nstatic inline int u_upperToLower(int ch)\n    \/\/ Return the lower case analog of the specified 'ch' if 'ch' is an upper\n    \/\/ case character, and return 'ch' otherwise; the sequence of characters\n    \/\/ '[A .. Z]' is mapped to '[a .. z]'.  The behavior is undefined unless\n    \/\/ characters are ASCII encoded.\n{\n    return 'A' <= ch && ch <= 'Z'\n           ? ch |=  0x20  \/\/ upper -> lower\n           : ch;\n}\n\nstatic inline int u_lowerToUpper(int ch)\n    \/\/ Return the upper case analog of the specified 'ch' if 'ch' is a lower\n    \/\/ case character, and return 'ch' otherwise; the sequence of characters\n    \/\/ '[a .. z]' is mapped to '[A .. Z]'.  The behavior is undefined unless\n    \/\/ characters are ASCII encoded.\n{\n    return 'a' <= ch && ch <= 'z'\n           ? ch &= ~0x20  \/\/ lower -> upper\n           : ch;\n}\n\nstatic inline bool u_isWhitespace(unsigned char ch)\n    \/\/ Return 'true' is the specified 'ch' is one of the ASCII whitespace\n    \/\/ characters in the \"C\" and \"POSIX\" locales, and 'false' otherwise.\n{\n    if (' ' == ch) {\n        return true;                                                  \/\/ RETURN\n    }\n\n    if (ch < '\\t' || '\\r' < ch ) {\n        return false;                                                 \/\/ RETURN\n    }\n\n    return true;\n}\n\n\nstatic const bslstl::StringRef u_NOT_FOUND;\n\n                        \/\/ --------------------\n                        \/\/ struct StringRefUtil\n                        \/\/ --------------------\n\n\/\/ CLASS METHODS\n                        \/\/ Comparison\n\nint StringRefUtil::lowerCaseCmp(const bslstl::StringRef& lhs,\n                                const bslstl::StringRef& rhs)\n{\n    const bsl::size_t lhsLength = lhs.length();\n    const bsl::size_t rhsLength = rhs.length();\n    const int         min       = lhsLength < rhsLength\n                                ? lhsLength : rhsLength;\n\n    for (int i = 0; i < min; ++i) {\n        int lhsChar = u_upperToLower((static_cast<unsigned char>(lhs[i])));\n        int rhsChar = u_upperToLower((static_cast<unsigned char>(rhs[i])));\n\n        if (lhsChar != rhsChar) {\n            return lhsChar < rhsChar ? -1 : 1;                        \/\/ RETURN\n        }\n    }\n    return lhsLength <  rhsLength ? -1:\n           lhsLength == rhsLength ?  0:\n           \/* else *\/                1;\n}\n\nint StringRefUtil::upperCaseCmp(const bslstl::StringRef& lhs,\n                                const bslstl::StringRef& rhs)\n{\n    const bsl::size_t lhsLength = lhs.length();\n    const bsl::size_t rhsLength = rhs.length();\n    const bsl::size_t min       = lhsLength < rhsLength\n                                ? lhsLength : rhsLength;\n\n    for (bsl::size_t i = 0;  i < min; ++i) {\n        int lhsChar = u_lowerToUpper((static_cast<unsigned char>(lhs[i])));\n        int rhsChar = u_lowerToUpper((static_cast<unsigned char>(rhs[i])));\n\n        if (lhsChar != rhsChar) {\n            return lhsChar < rhsChar ? -1 : 1;                        \/\/ RETURN\n        }\n    }\n\n    return lhsLength <  rhsLength ? -1:\n           lhsLength == rhsLength ?  0:\n           \/* else *\/                1;\n}\n\n                        \/\/ Trim\n\nbslstl::StringRef StringRefUtil::ltrim(const bslstl::StringRef& stringRef)\n{\n    bslstl::StringRef::const_iterator       itr = stringRef.begin();\n    bslstl::StringRef::const_iterator const end = stringRef.end();\n\n    while (end != itr && u_isWhitespace(static_cast<unsigned char>(*itr))) {\n        ++itr;\n    }\n\n    return bslstl::StringRef(itr, end);\n}\n\nbslstl::StringRef StringRefUtil::rtrim(const bslstl::StringRef& stringRef)\n{\n\n    int index = static_cast<int>(stringRef.length()) - 1;\n    while(   0 <= index\n          && u_isWhitespace(static_cast<unsigned char>(stringRef[index])))\n    {\n        --index;\n    }\n\n    return bslstl::StringRef(stringRef.data(), index + 1);\n}\n\n                        \/\/ Find 'subString'\n\nbslstl::StringRef StringRefUtil::strstr(const bslstl::StringRef& string,\n                                        const bslstl::StringRef& subStr)\n{\n    const bsl::size_t subStrLength = subStr.length();\n\n    if (0 == subStrLength) {\n        return bslstl::StringRef(string.data(), 0);                   \/\/ RETURN\n    }\n\n    if (string.length() < subStrLength) {\n        return u_NOT_FOUND;                                           \/\/ RETURN\n    }\n\n    const char * const end = string.end() - subStrLength + 1;\n\n    for (const char *cur = string.data(); cur < end; ++cur) {\n        if (0 == bsl::memcmp(cur, subStr.data(), subStrLength)) {\n            return bslstl::StringRef(cur, subStrLength);              \/\/ RETURN\n        }\n    }\n\n    return u_NOT_FOUND;\n}\n\nbslstl::StringRef StringRefUtil::strstrCaseless(\n                                               const bslstl::StringRef& string,\n                                               const bslstl::StringRef& subStr)\n{\n    const bsl::size_t subStrLength = subStr.length();\n\n    if (0 == subStrLength) {\n        return bslstl::StringRef(string.data(), 0);                   \/\/ RETURN\n    }\n\n    if (string.length() < subStrLength) {\n        return u_NOT_FOUND;                                           \/\/ RETURN\n    }\n\n    const char * const end = string.end() - subStrLength + 1;\n\n    for (const char *cur = string.data(); cur < end; ++cur) {\n         if (0 == lowerCaseCmp(\n                             bslstl::StringRef(cur,           subStrLength),\n                             bslstl::StringRef(subStr.data(), subStrLength))) {\n            return bslstl::StringRef(cur, subStrLength);              \/\/ RETURN\n        }\n    }\n\n    return u_NOT_FOUND;\n}\n\nbslstl::StringRef StringRefUtil::strrstr(const bslstl::StringRef& string,\n                                         const bslstl::StringRef& subStr)\n{\n    const bsl::size_t subStrLength = subStr.length();\n\n    if (0 == subStrLength) {\n        return bslstl::StringRef(string.end(), 0);                    \/\/ RETURN\n    }\n\n    if (string.length() < subStrLength) {\n        return u_NOT_FOUND;                                           \/\/ RETURN\n    }\n\n    const bsl::size_t  count = string.length() - subStrLength + 1;\n    const char        *cur   = string.end()    - subStrLength;\n\n    for (bsl::size_t i = 0; i < count; ++i, --cur) {\n        if (0 == bsl::memcmp(cur, subStr.data(), subStrLength)) {\n            return bslstl::StringRef(cur, subStrLength);              \/\/ RETURN\n        }\n    }\n\n    return u_NOT_FOUND;\n}\n\nbslstl::StringRef StringRefUtil::strrstrCaseless(\n                                               const bslstl::StringRef& string,\n                                               const bslstl::StringRef& subStr)\n{\n    const bsl::size_t subStrLength = subStr.length();\n\n    if (0 == subStrLength) {\n        return bslstl::StringRef(string.end(), 0);                    \/\/ RETURN\n    }\n\n    if (string.length() < subStrLength) {\n        return u_NOT_FOUND;                                           \/\/ RETURN\n    }\n\n    const bsl::size_t  count = string.length() - subStrLength + 1;\n    const char        *cur   = string.end()    - subStrLength;\n\n    for (bsl::size_t i = 0; i < count; ++i, --cur) {\n        if (0 == lowerCaseCmp(\n                             bslstl::StringRef(cur,           subStrLength),\n                             bslstl::StringRef(subStr.data(), subStrLength))) {\n            return bslstl::StringRef(cur, subStrLength);              \/\/ RETURN\n        }\n    }\n\n    return u_NOT_FOUND;\n}\n\n}  \/\/ close package namespace\n}  \/\/ close enterprise namespace\n\n\/\/ ----------------------------------------------------------------------------\n\/\/ Copyright 2016 Bloomberg Finance L.P.\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\n\/\/ of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\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\n\/\/ under the License.\n\/\/ ----------------------------- END-OF-FILE ----------------------------------\n<commit_msg>drqs-69340099: 'bdlb_stringrefutil': Fix matrix build '-W' errors.<commit_after>\/\/ bdlb_stringrefutil.cpp                                             -*-C++-*-\n#include <bdlb_stringrefutil.h>\n\n#include <bsls_ident.h>\n\n#include <bsl_cstring.h>  \/\/ 'bsl::memcmp'\n\nnamespace BloombergLP {\nnamespace bdlb {\n\nstatic inline int u_upperToLower(int ch)\n    \/\/ Return the lower case analog of the specified 'ch' if 'ch' is an upper\n    \/\/ case character, and return 'ch' otherwise; the sequence of characters\n    \/\/ '[A .. Z]' is mapped to '[a .. z]'.  The behavior is undefined unless\n    \/\/ characters are ASCII encoded.\n{\n    return 'A' <= ch && ch <= 'Z'\n           ? ch |=  0x20  \/\/ upper -> lower\n           : ch;\n}\n\nstatic inline int u_lowerToUpper(int ch)\n    \/\/ Return the upper case analog of the specified 'ch' if 'ch' is a lower\n    \/\/ case character, and return 'ch' otherwise; the sequence of characters\n    \/\/ '[a .. z]' is mapped to '[A .. Z]'.  The behavior is undefined unless\n    \/\/ characters are ASCII encoded.\n{\n    return 'a' <= ch && ch <= 'z'\n           ? ch &= ~0x20  \/\/ lower -> upper\n           : ch;\n}\n\nstatic inline bool u_isWhitespace(unsigned char ch)\n    \/\/ Return 'true' is the specified 'ch' is one of the ASCII whitespace\n    \/\/ characters in the \"C\" and \"POSIX\" locales, and 'false' otherwise.\n{\n    if (' ' == ch) {\n        return true;                                                  \/\/ RETURN\n    }\n\n    if (ch < '\\t' || '\\r' < ch ) {\n        return false;                                                 \/\/ RETURN\n    }\n\n    return true;\n}\n\n\nstatic const bslstl::StringRef u_NOT_FOUND;\n\n                        \/\/ --------------------\n                        \/\/ struct StringRefUtil\n                        \/\/ --------------------\n\n\/\/ CLASS METHODS\n                        \/\/ Comparison\n\nint StringRefUtil::lowerCaseCmp(const bslstl::StringRef& lhs,\n                                const bslstl::StringRef& rhs)\n{\n    const bsl::size_t lhsLength = lhs.length();\n    const bsl::size_t rhsLength = rhs.length();\n    const bsl::size_t min       = lhsLength < rhsLength\n                                ? lhsLength : rhsLength;\n\n    for (int i = 0; i < min; ++i) {\n        int lhsChar = u_upperToLower((static_cast<unsigned char>(lhs[i])));\n        int rhsChar = u_upperToLower((static_cast<unsigned char>(rhs[i])));\n\n        if (lhsChar != rhsChar) {\n            return lhsChar < rhsChar ? -1 : 1;                        \/\/ RETURN\n        }\n    }\n    return lhsLength <  rhsLength ? -1:\n           lhsLength == rhsLength ?  0:\n           \/* else *\/                1;\n}\n\nint StringRefUtil::upperCaseCmp(const bslstl::StringRef& lhs,\n                                const bslstl::StringRef& rhs)\n{\n    const bsl::size_t lhsLength = lhs.length();\n    const bsl::size_t rhsLength = rhs.length();\n    const bsl::size_t min       = lhsLength < rhsLength\n                                ? lhsLength : rhsLength;\n\n    for (bsl::size_t i = 0;  i < min; ++i) {\n        int lhsChar = u_lowerToUpper((static_cast<unsigned char>(lhs[i])));\n        int rhsChar = u_lowerToUpper((static_cast<unsigned char>(rhs[i])));\n\n        if (lhsChar != rhsChar) {\n            return lhsChar < rhsChar ? -1 : 1;                        \/\/ RETURN\n        }\n    }\n\n    return lhsLength <  rhsLength ? -1:\n           lhsLength == rhsLength ?  0:\n           \/* else *\/                1;\n}\n\n                        \/\/ Trim\n\nbslstl::StringRef StringRefUtil::ltrim(const bslstl::StringRef& stringRef)\n{\n    bslstl::StringRef::const_iterator       itr = stringRef.begin();\n    bslstl::StringRef::const_iterator const end = stringRef.end();\n\n    while (end != itr && u_isWhitespace(static_cast<unsigned char>(*itr))) {\n        ++itr;\n    }\n\n    return bslstl::StringRef(itr, end);\n}\n\nbslstl::StringRef StringRefUtil::rtrim(const bslstl::StringRef& stringRef)\n{\n\n    int index = static_cast<int>(stringRef.length()) - 1;\n    while(   0 <= index\n          && u_isWhitespace(static_cast<unsigned char>(stringRef[index])))\n    {\n        --index;\n    }\n\n    return bslstl::StringRef(stringRef.data(), index + 1);\n}\n\n                        \/\/ Find 'subString'\n\nbslstl::StringRef StringRefUtil::strstr(const bslstl::StringRef& string,\n                                        const bslstl::StringRef& subStr)\n{\n    const bsl::size_t subStrLength = subStr.length();\n\n    if (0 == subStrLength) {\n        return bslstl::StringRef(string.data(), 0);                   \/\/ RETURN\n    }\n\n    if (string.length() < subStrLength) {\n        return u_NOT_FOUND;                                           \/\/ RETURN\n    }\n\n    const char * const end = string.end() - subStrLength + 1;\n\n    for (const char *cur = string.data(); cur < end; ++cur) {\n        if (0 == bsl::memcmp(cur, subStr.data(), subStrLength)) {\n            return bslstl::StringRef(cur, cur + subStrLength);        \/\/ RETURN\n        }\n    }\n\n    return u_NOT_FOUND;\n}\n\nbslstl::StringRef StringRefUtil::strstrCaseless(\n                                               const bslstl::StringRef& string,\n                                               const bslstl::StringRef& subStr)\n{\n    const bsl::size_t subStrLength = subStr.length();\n\n    if (0 == subStrLength) {\n        return bslstl::StringRef(string.data(), 0);                   \/\/ RETURN\n    }\n\n    if (string.length() < subStrLength) {\n        return u_NOT_FOUND;                                           \/\/ RETURN\n    }\n\n    const char * const end = string.end() - subStrLength + 1;\n\n    for (const char *cur = string.data(); cur < end; ++cur) {\n         if (0 == lowerCaseCmp(\n             bslstl::StringRef(cur,           cur           + subStrLength),\n             bslstl::StringRef(subStr.data(), subStr.data() + subStrLength))) {\n            return bslstl::StringRef(cur, cur + subStrLength);        \/\/ RETURN\n        }\n    }\n\n    return u_NOT_FOUND;\n}\n\nbslstl::StringRef StringRefUtil::strrstr(const bslstl::StringRef& string,\n                                         const bslstl::StringRef& subStr)\n{\n    const bsl::size_t subStrLength = subStr.length();\n\n    if (0 == subStrLength) {\n        return bslstl::StringRef(string.end(), 0);                    \/\/ RETURN\n    }\n\n    if (string.length() < subStrLength) {\n        return u_NOT_FOUND;                                           \/\/ RETURN\n    }\n\n    const bsl::size_t  count = string.length() - subStrLength + 1;\n    const char        *cur   = string.end()    - subStrLength;\n\n    for (bsl::size_t i = 0; i < count; ++i, --cur) {\n        if (0 == bsl::memcmp(cur, subStr.data(), subStrLength)) {\n            return bslstl::StringRef(cur, cur + subStrLength);        \/\/ RETURN\n        }\n    }\n\n    return u_NOT_FOUND;\n}\n\nbslstl::StringRef StringRefUtil::strrstrCaseless(\n                                               const bslstl::StringRef& string,\n                                               const bslstl::StringRef& subStr)\n{\n    const bsl::size_t subStrLength = subStr.length();\n\n    if (0 == subStrLength) {\n        return bslstl::StringRef(string.end(), 0);                    \/\/ RETURN\n    }\n\n    if (string.length() < subStrLength) {\n        return u_NOT_FOUND;                                           \/\/ RETURN\n    }\n\n    const bsl::size_t  count = string.length() - subStrLength + 1;\n    const char        *cur   = string.end()    - subStrLength;\n\n    for (bsl::size_t i = 0; i < count; ++i, --cur) {\n        if (0 == lowerCaseCmp(\n             bslstl::StringRef(cur,           cur           + subStrLength),\n             bslstl::StringRef(subStr.data(), subStr.data() + subStrLength))) {\n            return bslstl::StringRef(cur, subStrLength);              \/\/ RETURN\n        }\n    }\n\n    return u_NOT_FOUND;\n}\n\n}  \/\/ close package namespace\n}  \/\/ close enterprise namespace\n\n\/\/ ----------------------------------------------------------------------------\n\/\/ Copyright 2016 Bloomberg Finance L.P.\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\n\/\/ of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\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\n\/\/ under the License.\n\/\/ ----------------------------- END-OF-FILE ----------------------------------\n<|endoftext|>"}
{"text":"<commit_before>\/\/ bdlb_stringrefutil.cpp                                             -*-C++-*-\n#include <bdlb_stringrefutil.h>\n\n#include <bsls_ident.h>\n\n#include <bsl_cstring.h>  \/\/ 'bsl::memcmp'\n\nnamespace BloombergLP {\nnamespace bdlb {\n\nstatic inline int u_upperToLower(int ch)\n    \/\/ Return the lower case analog of the specified 'ch' if 'ch' is an upper\n    \/\/ case character, and return 'ch' otherwise; the sequence of characters\n    \/\/ '[A .. Z]' is mapped to '[a .. z]'.  The behavior is undefined unless\n    \/\/ characters are ASCII encoded.\n{\n    return 'A' <= ch && ch <= 'Z'\n           ? ch |=  0x20  \/\/ upper -> lower\n           : ch;\n}\n\nstatic inline int u_lowerToUpper(int ch)\n    \/\/ Return the upper case analog of the specified 'ch' if 'ch' is a lower\n    \/\/ case character, and return 'ch' otherwise; the sequence of characters\n    \/\/ '[a .. z]' is mapped to '[A .. Z]'.  The behavior is undefined unless\n    \/\/ characters are ASCII encoded.\n{\n    return 'a' <= ch && ch <= 'z'\n           ? ch &= ~0x20  \/\/ lower -> upper\n           : ch;\n}\n\nstatic inline bool u_isWhitespace(unsigned char ch)\n    \/\/ Return 'true' is the specified 'ch' is one of the ASCII whitespace\n    \/\/ characters in the \"C\" and \"POSIX\" locales, and 'false' otherwise.\n{\n    if (' ' == ch) {\n        return true;                                                  \/\/ RETURN\n    }\n\n    if (ch < '\\t' || '\\r' < ch ) {\n        return false;                                                 \/\/ RETURN\n    }\n\n    return true;\n}\n\n\nstatic const bslstl::StringRef u_NOT_FOUND;\n\n                        \/\/ --------------------\n                        \/\/ struct StringRefUtil\n                        \/\/ --------------------\n\n\/\/ CLASS METHODS\n                        \/\/ Comparison\n\nint StringRefUtil::lowerCaseCmp(const bslstl::StringRef& lhs,\n                                const bslstl::StringRef& rhs)\n{\n    const bsl::size_t lhsLength = lhs.length();\n    const bsl::size_t rhsLength = rhs.length();\n    const bsl::size_t min       = lhsLength < rhsLength\n                                ? lhsLength : rhsLength;\n\n    for (int i = 0; i < min; ++i) {\n        int lhsChar = u_upperToLower((static_cast<unsigned char>(lhs[i])));\n        int rhsChar = u_upperToLower((static_cast<unsigned char>(rhs[i])));\n\n        if (lhsChar != rhsChar) {\n            return lhsChar < rhsChar ? -1 : 1;                        \/\/ RETURN\n        }\n    }\n    return lhsLength <  rhsLength ? -1:\n           lhsLength == rhsLength ?  0:\n           \/* else *\/                1;\n}\n\nint StringRefUtil::upperCaseCmp(const bslstl::StringRef& lhs,\n                                const bslstl::StringRef& rhs)\n{\n    const bsl::size_t lhsLength = lhs.length();\n    const bsl::size_t rhsLength = rhs.length();\n    const bsl::size_t min       = lhsLength < rhsLength\n                                ? lhsLength : rhsLength;\n\n    for (bsl::size_t i = 0;  i < min; ++i) {\n        int lhsChar = u_lowerToUpper((static_cast<unsigned char>(lhs[i])));\n        int rhsChar = u_lowerToUpper((static_cast<unsigned char>(rhs[i])));\n\n        if (lhsChar != rhsChar) {\n            return lhsChar < rhsChar ? -1 : 1;                        \/\/ RETURN\n        }\n    }\n\n    return lhsLength <  rhsLength ? -1:\n           lhsLength == rhsLength ?  0:\n           \/* else *\/                1;\n}\n\n                        \/\/ Trim\n\nbslstl::StringRef StringRefUtil::ltrim(const bslstl::StringRef& stringRef)\n{\n    bslstl::StringRef::const_iterator       itr = stringRef.begin();\n    bslstl::StringRef::const_iterator const end = stringRef.end();\n\n    while (end != itr && u_isWhitespace(static_cast<unsigned char>(*itr))) {\n        ++itr;\n    }\n\n    return bslstl::StringRef(itr, end);\n}\n\nbslstl::StringRef StringRefUtil::rtrim(const bslstl::StringRef& stringRef)\n{\n\n    int index = static_cast<int>(stringRef.length()) - 1;\n    while(   0 <= index\n          && u_isWhitespace(static_cast<unsigned char>(stringRef[index])))\n    {\n        --index;\n    }\n\n    return bslstl::StringRef(stringRef.data(), index + 1);\n}\n\n                        \/\/ Find 'subString'\n\nbslstl::StringRef StringRefUtil::strstr(const bslstl::StringRef& string,\n                                        const bslstl::StringRef& subStr)\n{\n    const bsl::size_t subStrLength = subStr.length();\n\n    if (0 == subStrLength) {\n        return bslstl::StringRef(string.data(), 0);                   \/\/ RETURN\n    }\n\n    if (string.length() < subStrLength) {\n        return u_NOT_FOUND;                                           \/\/ RETURN\n    }\n\n    const char * const end = string.end() - subStrLength + 1;\n\n    for (const char *cur = string.data(); cur < end; ++cur) {\n        if (0 == bsl::memcmp(cur, subStr.data(), subStrLength)) {\n            return bslstl::StringRef(cur, cur + subStrLength);        \/\/ RETURN\n        }\n    }\n\n    return u_NOT_FOUND;\n}\n\nbslstl::StringRef StringRefUtil::strstrCaseless(\n                                               const bslstl::StringRef& string,\n                                               const bslstl::StringRef& subStr)\n{\n    const bsl::size_t subStrLength = subStr.length();\n\n    if (0 == subStrLength) {\n        return bslstl::StringRef(string.data(), 0);                   \/\/ RETURN\n    }\n\n    if (string.length() < subStrLength) {\n        return u_NOT_FOUND;                                           \/\/ RETURN\n    }\n\n    const char * const end = string.end() - subStrLength + 1;\n\n    for (const char *cur = string.data(); cur < end; ++cur) {\n         if (0 == lowerCaseCmp(\n             bslstl::StringRef(cur,           cur           + subStrLength),\n             bslstl::StringRef(subStr.data(), subStr.data() + subStrLength))) {\n            return bslstl::StringRef(cur, cur + subStrLength);        \/\/ RETURN\n        }\n    }\n\n    return u_NOT_FOUND;\n}\n\nbslstl::StringRef StringRefUtil::strrstr(const bslstl::StringRef& string,\n                                         const bslstl::StringRef& subStr)\n{\n    const bsl::size_t subStrLength = subStr.length();\n\n    if (0 == subStrLength) {\n        return bslstl::StringRef(string.end(), 0);                    \/\/ RETURN\n    }\n\n    if (string.length() < subStrLength) {\n        return u_NOT_FOUND;                                           \/\/ RETURN\n    }\n\n    const bsl::size_t  count = string.length() - subStrLength + 1;\n    const char        *cur   = string.end()    - subStrLength;\n\n    for (bsl::size_t i = 0; i < count; ++i, --cur) {\n        if (0 == bsl::memcmp(cur, subStr.data(), subStrLength)) {\n            return bslstl::StringRef(cur, cur + subStrLength);        \/\/ RETURN\n        }\n    }\n\n    return u_NOT_FOUND;\n}\n\nbslstl::StringRef StringRefUtil::strrstrCaseless(\n                                               const bslstl::StringRef& string,\n                                               const bslstl::StringRef& subStr)\n{\n    const bsl::size_t subStrLength = subStr.length();\n\n    if (0 == subStrLength) {\n        return bslstl::StringRef(string.end(), 0);                    \/\/ RETURN\n    }\n\n    if (string.length() < subStrLength) {\n        return u_NOT_FOUND;                                           \/\/ RETURN\n    }\n\n    const bsl::size_t  count = string.length() - subStrLength + 1;\n    const char        *cur   = string.end()    - subStrLength;\n\n    for (bsl::size_t i = 0; i < count; ++i, --cur) {\n        if (0 == lowerCaseCmp(\n             bslstl::StringRef(cur,           cur           + subStrLength),\n             bslstl::StringRef(subStr.data(), subStr.data() + subStrLength))) {\n            return bslstl::StringRef(cur, subStrLength);              \/\/ RETURN\n        }\n    }\n\n    return u_NOT_FOUND;\n}\n\n}  \/\/ close package namespace\n}  \/\/ close enterprise namespace\n\n\/\/ ----------------------------------------------------------------------------\n\/\/ Copyright 2016 Bloomberg Finance L.P.\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\n\/\/ of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\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\n\/\/ under the License.\n\/\/ ----------------------------- END-OF-FILE ----------------------------------\n<commit_msg>drqs-69340099: 'bdlb_stringrefutil': Fix matrix build '-W' errors.<commit_after>\/\/ bdlb_stringrefutil.cpp                                             -*-C++-*-\n#include <bdlb_stringrefutil.h>\n\n#include <bsls_ident.h>\n\n#include <bsl_cstring.h>  \/\/ 'bsl::memcmp'\n\nnamespace BloombergLP {\nnamespace bdlb {\n\nstatic inline int u_upperToLower(int ch)\n    \/\/ Return the lower case analog of the specified 'ch' if 'ch' is an upper\n    \/\/ case character, and return 'ch' otherwise; the sequence of characters\n    \/\/ '[A .. Z]' is mapped to '[a .. z]'.  The behavior is undefined unless\n    \/\/ characters are ASCII encoded.\n{\n    return 'A' <= ch && ch <= 'Z'\n           ? ch |=  0x20  \/\/ upper -> lower\n           : ch;\n}\n\nstatic inline int u_lowerToUpper(int ch)\n    \/\/ Return the upper case analog of the specified 'ch' if 'ch' is a lower\n    \/\/ case character, and return 'ch' otherwise; the sequence of characters\n    \/\/ '[a .. z]' is mapped to '[A .. Z]'.  The behavior is undefined unless\n    \/\/ characters are ASCII encoded.\n{\n    return 'a' <= ch && ch <= 'z'\n           ? ch &= ~0x20  \/\/ lower -> upper\n           : ch;\n}\n\nstatic inline bool u_isWhitespace(unsigned char ch)\n    \/\/ Return 'true' is the specified 'ch' is one of the ASCII whitespace\n    \/\/ characters in the \"C\" and \"POSIX\" locales, and 'false' otherwise.\n{\n    if (' ' == ch) {\n        return true;                                                  \/\/ RETURN\n    }\n\n    if (ch < '\\t' || '\\r' < ch ) {\n        return false;                                                 \/\/ RETURN\n    }\n\n    return true;\n}\n\n\nstatic const bslstl::StringRef u_NOT_FOUND;\n\n                        \/\/ --------------------\n                        \/\/ struct StringRefUtil\n                        \/\/ --------------------\n\n\/\/ CLASS METHODS\n                        \/\/ Comparison\n\nint StringRefUtil::lowerCaseCmp(const bslstl::StringRef& lhs,\n                                const bslstl::StringRef& rhs)\n{\n    const bsl::size_t lhsLength = lhs.length();\n    const bsl::size_t rhsLength = rhs.length();\n    const bsl::size_t min       = lhsLength < rhsLength\n                                ? lhsLength : rhsLength;\n\n    for (bsl::size_t i = 0; i < min; ++i) {\n        int lhsChar = u_upperToLower((static_cast<unsigned char>(lhs[i])));\n        int rhsChar = u_upperToLower((static_cast<unsigned char>(rhs[i])));\n\n        if (lhsChar != rhsChar) {\n            return lhsChar < rhsChar ? -1 : 1;                        \/\/ RETURN\n        }\n    }\n    return lhsLength <  rhsLength ? -1:\n           lhsLength == rhsLength ?  0:\n           \/* else *\/                1;\n}\n\nint StringRefUtil::upperCaseCmp(const bslstl::StringRef& lhs,\n                                const bslstl::StringRef& rhs)\n{\n    const bsl::size_t lhsLength = lhs.length();\n    const bsl::size_t rhsLength = rhs.length();\n    const bsl::size_t min       = lhsLength < rhsLength\n                                ? lhsLength : rhsLength;\n\n    for (bsl::size_t i = 0;  i < min; ++i) {\n        int lhsChar = u_lowerToUpper((static_cast<unsigned char>(lhs[i])));\n        int rhsChar = u_lowerToUpper((static_cast<unsigned char>(rhs[i])));\n\n        if (lhsChar != rhsChar) {\n            return lhsChar < rhsChar ? -1 : 1;                        \/\/ RETURN\n        }\n    }\n\n    return lhsLength <  rhsLength ? -1:\n           lhsLength == rhsLength ?  0:\n           \/* else *\/                1;\n}\n\n                        \/\/ Trim\n\nbslstl::StringRef StringRefUtil::ltrim(const bslstl::StringRef& stringRef)\n{\n    bslstl::StringRef::const_iterator       itr = stringRef.begin();\n    bslstl::StringRef::const_iterator const end = stringRef.end();\n\n    while (end != itr && u_isWhitespace(static_cast<unsigned char>(*itr))) {\n        ++itr;\n    }\n\n    return bslstl::StringRef(itr, end);\n}\n\nbslstl::StringRef StringRefUtil::rtrim(const bslstl::StringRef& stringRef)\n{\n\n    int index = static_cast<int>(stringRef.length()) - 1;\n    while(   0 <= index\n          && u_isWhitespace(static_cast<unsigned char>(stringRef[index])))\n    {\n        --index;\n    }\n\n    return bslstl::StringRef(stringRef.data(), index + 1);\n}\n\n                        \/\/ Find 'subString'\n\nbslstl::StringRef StringRefUtil::strstr(const bslstl::StringRef& string,\n                                        const bslstl::StringRef& subStr)\n{\n    const bsl::size_t subStrLength = subStr.length();\n\n    if (0 == subStrLength) {\n        return bslstl::StringRef(string.data(), 0);                   \/\/ RETURN\n    }\n\n    if (string.length() < subStrLength) {\n        return u_NOT_FOUND;                                           \/\/ RETURN\n    }\n\n    const char * const end = string.end() - subStrLength + 1;\n\n    for (const char *cur = string.data(); cur < end; ++cur) {\n        if (0 == bsl::memcmp(cur, subStr.data(), subStrLength)) {\n            return bslstl::StringRef(cur, cur + subStrLength);        \/\/ RETURN\n        }\n    }\n\n    return u_NOT_FOUND;\n}\n\nbslstl::StringRef StringRefUtil::strstrCaseless(\n                                               const bslstl::StringRef& string,\n                                               const bslstl::StringRef& subStr)\n{\n    const bsl::size_t subStrLength = subStr.length();\n\n    if (0 == subStrLength) {\n        return bslstl::StringRef(string.data(), 0);                   \/\/ RETURN\n    }\n\n    if (string.length() < subStrLength) {\n        return u_NOT_FOUND;                                           \/\/ RETURN\n    }\n\n    const char * const end = string.end() - subStrLength + 1;\n\n    for (const char *cur = string.data(); cur < end; ++cur) {\n         if (0 == lowerCaseCmp(\n             bslstl::StringRef(cur,           cur           + subStrLength),\n             bslstl::StringRef(subStr.data(), subStr.data() + subStrLength))) {\n            return bslstl::StringRef(cur, cur + subStrLength);        \/\/ RETURN\n        }\n    }\n\n    return u_NOT_FOUND;\n}\n\nbslstl::StringRef StringRefUtil::strrstr(const bslstl::StringRef& string,\n                                         const bslstl::StringRef& subStr)\n{\n    const bsl::size_t subStrLength = subStr.length();\n\n    if (0 == subStrLength) {\n        return bslstl::StringRef(string.end(), 0);                    \/\/ RETURN\n    }\n\n    if (string.length() < subStrLength) {\n        return u_NOT_FOUND;                                           \/\/ RETURN\n    }\n\n    const bsl::size_t  count = string.length() - subStrLength + 1;\n    const char        *cur   = string.end()    - subStrLength;\n\n    for (bsl::size_t i = 0; i < count; ++i, --cur) {\n        if (0 == bsl::memcmp(cur, subStr.data(), subStrLength)) {\n            return bslstl::StringRef(cur, cur + subStrLength);        \/\/ RETURN\n        }\n    }\n\n    return u_NOT_FOUND;\n}\n\nbslstl::StringRef StringRefUtil::strrstrCaseless(\n                                               const bslstl::StringRef& string,\n                                               const bslstl::StringRef& subStr)\n{\n    const bsl::size_t subStrLength = subStr.length();\n\n    if (0 == subStrLength) {\n        return bslstl::StringRef(string.end(), 0);                    \/\/ RETURN\n    }\n\n    if (string.length() < subStrLength) {\n        return u_NOT_FOUND;                                           \/\/ RETURN\n    }\n\n    const bsl::size_t  count = string.length() - subStrLength + 1;\n    const char        *cur   = string.end()    - subStrLength;\n\n    for (bsl::size_t i = 0; i < count; ++i, --cur) {\n        if (0 == lowerCaseCmp(\n             bslstl::StringRef(cur,           cur           + subStrLength),\n             bslstl::StringRef(subStr.data(), subStr.data() + subStrLength))) {\n            return bslstl::StringRef(cur, cur + subStrLength);        \/\/ RETURN\n        }\n    }\n\n    return u_NOT_FOUND;\n}\n\n}  \/\/ close package namespace\n}  \/\/ close enterprise namespace\n\n\/\/ ----------------------------------------------------------------------------\n\/\/ Copyright 2016 Bloomberg Finance L.P.\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\n\/\/ of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\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\n\/\/ under the License.\n\/\/ ----------------------------- END-OF-FILE ----------------------------------\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\/\/ To exclude the pragmas in itkCompensatedSummation.hxx since we use compiler\n\/\/ flags to prevent the undesirable optimization on this file.\n#define itkCompensatedSummation_cxx\n\n#include \"itkNumericTraits.h\"\n#include \"itkCompensatedSummation.hxx\"\n\nnamespace itk\n{\n\nvoid ITKCommon_EXPORT\n     CompensatedSummationAddElement(float & compensation, float & sum, const float & element)\n{\n  CompensatedSummationAddElement(compensation, sum, element, 1);\n}\nvoid ITKCommon_EXPORT\n     CompensatedSummationAddElement(double & compensation, double & sum, const double & element)\n{\n  CompensatedSummationAddElement(compensation, sum, element, 1);\n}\n\n} \/\/ end namespace itk\n<commit_msg>COMP: Include .h instead of .hxx file<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\/\/ To exclude the pragmas in itkCompensatedSummation.hxx since we use compiler\n\/\/ flags to prevent the undesirable optimization on this file.\n#define itkCompensatedSummation_cxx\n\n#include \"itkNumericTraits.h\"\n#include \"itkCompensatedSummation.h\"\n\nnamespace itk\n{\n\nvoid ITKCommon_EXPORT\n     CompensatedSummationAddElement(float & compensation, float & sum, const float & element)\n{\n  CompensatedSummationAddElement(compensation, sum, element, 1);\n}\nvoid ITKCommon_EXPORT\n     CompensatedSummationAddElement(double & compensation, double & sum, const double & element)\n{\n  CompensatedSummationAddElement(compensation, sum, element, 1);\n}\n\n} \/\/ end namespace itk\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Ajokki: split long lines into multiple lines.<commit_after><|endoftext|>"}
{"text":"<commit_before>#ifndef AMGCL_SOLVER_GMRES_HPP\n#define AMGCL_SOLVER_GMRES_HPP\n\n\/*\nThe MIT License\n\nCopyright (c) 2012-2016 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   gmres.hpp\n * \\author Denis Demidov <dennis.demidov@gmail.com>\n * \\brief  GMRES method.\n *\/\n\n#include <vector>\n#include <cmath>\n\n#include <boost\/multi_array.hpp>\n#include <boost\/tuple\/tuple.hpp>\n#include <boost\/range\/algorithm.hpp>\n\n#include <amgcl\/backend\/interface.hpp>\n#include <amgcl\/solver\/detail\/default_inner_product.hpp>\n#include <amgcl\/util.hpp>\n\nnamespace amgcl {\nnamespace solver {\n\n\/** Generalized Minimal Residual (GMRES) method.\n * \\rst\n * The Generalized Minimal Residual method is an extension of MINRES (which is\n * only applicable to symmetric systems) to unsymmetric systems [Barr94]_.\n * \\endrst\n *\/\ntemplate <\n    class Backend,\n    class InnerProduct = detail::default_inner_product\n    >\nclass gmres {\n    public:\n        typedef Backend backend_type;\n\n        typedef typename Backend::vector     vector;\n        typedef typename Backend::value_type value_type;\n        typedef typename Backend::params     backend_params;\n\n        typedef typename math::scalar_of<value_type>::type scalar_type;\n        typedef typename math::rhs_of<value_type>::type rhs_type;\n        typedef typename math::inner_product_impl<rhs_type>::return_type coef_type;\n\n        \/\/\/ Solver parameters.\n        struct params {\n            \/\/\/ Number of iterations before restart.\n            unsigned M;\n\n            \/\/\/ Maximum number of iterations.\n            unsigned maxiter;\n\n            \/\/\/ Target residual error.\n            scalar_type tol;\n\n            params(unsigned M = 30, unsigned maxiter = 100, scalar_type tol = 1e-8)\n                : M(M), maxiter(maxiter), tol(tol)\n            { }\n\n            params(const boost::property_tree::ptree &p)\n                : AMGCL_PARAMS_IMPORT_VALUE(p, M),\n                  AMGCL_PARAMS_IMPORT_VALUE(p, maxiter),\n                  AMGCL_PARAMS_IMPORT_VALUE(p, tol)\n            {\n                AMGCL_PARAMS_CHECK(p, (M)(maxiter)(tol));\n            }\n\n            void get(boost::property_tree::ptree &p, const std::string &path) const {\n                AMGCL_PARAMS_EXPORT_VALUE(p, path, M);\n                AMGCL_PARAMS_EXPORT_VALUE(p, path, maxiter);\n                AMGCL_PARAMS_EXPORT_VALUE(p, path, tol);\n            }\n        };\n\n        \/\/\/ Preallocates necessary data structures for the system of size \\p n.\n        gmres(\n                size_t n,\n                const params &prm = params(),\n                const backend_params &backend_prm = backend_params(),\n                const InnerProduct &inner_product = InnerProduct()\n             )\n            : prm(prm), n(n),\n              H(boost::extents[prm.M + 1][prm.M]),\n              s(prm.M + 1), cs(prm.M + 1), sn(prm.M + 1),\n              r( Backend::create_vector(n, backend_prm) ),\n              inner_product(inner_product)\n        {\n            v.reserve(prm.M + 1);\n            for(unsigned i = 0; i <= prm.M; ++i)\n                v.push_back( Backend::create_vector(n, backend_prm) );\n        }\n\n        \/* Computes the solution for the given system matrix \\p A and the\n         * right-hand side \\p rhs.  Returns the number of iterations made and\n         * the achieved residual as a ``boost::tuple``. The solution vector\n         * \\p x provides initial approximation in input and holds the computed\n         * solution on output.\n         *\n         * The system matrix may differ from the matrix used during\n         * initialization. This may be used for the solution of non-stationary\n         * problems with slowly changing coefficients. There is a strong chance\n         * that a preconditioner built for a time step will act as a reasonably\n         * good preconditioner for several subsequent time steps [DeSh12]_.\n         *\/\n        template <class Matrix, class Precond, class Vec1, class Vec2>\n        boost::tuple<size_t, scalar_type> operator()(\n                Matrix  const &A,\n                Precond const &P,\n                Vec1    const &rhs,\n                Vec2          &x\n                ) const\n        {\n            size_t iter = 0;\n\n            scalar_type norm_rhs = norm(rhs);\n            if (norm_rhs < amgcl::detail::eps<scalar_type>(n)) {\n                backend::clear(x);\n                return boost::make_tuple(0, norm_rhs);\n            }\n\n            scalar_type eps = prm.tol * norm_rhs, norm_r = math::zero<scalar_type>();\n\n            while(true) {\n                backend::residual(rhs, A, x, *r);\n\n                \/\/ -- Check stopping condition\n                if ((norm_r = norm(*r)) < prm.tol * norm_rhs || iter >= prm.maxiter)\n                    break;\n\n                \/\/ -- Inner GMRES iteration\n                P.apply(*r, *v[0]);\n\n                boost::fill(s, 0);\n                s[0] = norm(*v[0]);\n\n                precondition(!math::is_zero(s[0]),\n                        \"Preconditioner returned a zero vector\");\n\n                backend::axpby(math::inverse(s[0]), *v[0], math::zero<scalar_type>(), *v[0]);\n\n\n                unsigned j = 0;\n                while(true) {\n                    \/\/ -- Arnoldi process\n                    \/\/\n                    \/\/ Build an orthonormal basis V and matrix H such that\n                    \/\/     A V_{i-1} = V_{i} H\n                    vector &v_new = *v[j+1];\n                    backend::spmv(math::identity<scalar_type>(), A, *v[j], math::zero<scalar_type>(), *r);\n                    P.apply(*r, v_new);\n\n                    for(unsigned k = 0; k <= j; ++k) {\n                        H[k][j] = inner_product(v_new, *v[k]);\n                        backend::axpby(-H[k][j], *v[k], math::identity<scalar_type>(), v_new);\n                    }\n                    H[j+1][j] = norm(v_new);\n\n                    backend::axpby(math::inverse(H[j+1][j]), v_new, math::zero<scalar_type>(), v_new);\n\n                    for(unsigned k = 0; k < j; ++k)\n                        apply_plane_rotation(H[k][j], H[k+1][j], cs[k], sn[k]);\n\n                    generate_plane_rotation(H[j][j], H[j+1][j], cs[j], sn[j]);\n                    apply_plane_rotation(H[j][j], H[j+1][j], cs[j], sn[j]);\n                    apply_plane_rotation(s[j], s[j+1], cs[j], sn[j]);\n\n                    scalar_type inner_res = std::abs(s[j+1]);\n\n                    \/\/ Check for termination\n                    ++j, ++iter;\n                    if (iter >= prm.maxiter || j >= prm.M || inner_res <= eps)\n                        break;\n                }\n\n                \/\/ -- GMRES terminated: eval solution\n                for (unsigned i = j; i --> 0; ) {\n                    s[i] \/= H[i][i];\n                    for (unsigned k = 0; k < i; ++k)\n                        s[k] -= H[k][i] * s[i];\n                }\n\n                unsigned k = 0;\n                for (; k + 1 < j; k += 2)\n                    backend::axpbypcz(s[k], *v[k], s[k+1], *v[k+1], math::identity<scalar_type>(), x);\n                for (; k < j; ++k)\n                    backend::axpby(s[k], *v[k], math::identity<scalar_type>(), x);\n            }\n\n            return boost::make_tuple(iter, norm_r \/ norm_rhs);\n        }\n\n        \/* Computes the solution for the given right-hand side \\p rhs. The\n         * system matrix is the same that was used for the setup of the\n         * preconditioner \\p P.  Returns the number of iterations made and the\n         * achieved residual as a ``boost::tuple``. The solution vector \\p x\n         * provides initial approximation in input and holds the computed\n         * solution on output.\n         *\/\n        template <class Precond, class Vec1, class Vec2>\n        boost::tuple<size_t, scalar_type> operator()(\n                Precond const &P,\n                Vec1    const &rhs,\n                Vec2          &x\n                ) const\n        {\n            return (*this)(P.system_matrix(), P, rhs, x);\n        }\n\n\n        friend std::ostream& operator<<(std::ostream &os, const gmres &s) {\n            return os << \"gmres(\" << s.prm.M << \"): \" << s.n << \" unknowns\";\n        }\n    public:\n        params prm;\n\n    private:\n        size_t n;\n\n        mutable boost::multi_array<coef_type, 2> H;\n        mutable std::vector<coef_type> s, cs, sn;\n        boost::shared_ptr<vector> r;\n        std::vector< boost::shared_ptr<vector> > v;\n\n        InnerProduct inner_product;\n\n        template <class Vec>\n        scalar_type norm(const Vec &x) const {\n            return std::abs(sqrt(inner_product(x, x)));\n        }\n\n        static void apply_plane_rotation(\n                coef_type &dx, coef_type &dy, coef_type cs, coef_type sn\n                )\n        {\n            coef_type tmp = cs * dx + sn * dy;\n            dy = -sn * dx + cs * dy;\n            dx = tmp;\n        }\n\n        static void generate_plane_rotation(\n                coef_type dx, coef_type dy, coef_type &cs, coef_type &sn\n                )\n        {\n            if (math::is_zero(dy)) {\n                cs = 1;\n                sn = 0;\n            } else if (std::abs(dy) > std::abs(dx)) {\n                coef_type tmp = dx \/ dy;\n                sn = math::inverse(sqrt(math::identity<coef_type>() + tmp * tmp));\n                cs = tmp * sn;\n            } else {\n                coef_type tmp = dy \/ dx;\n                cs = math::inverse(sqrt(math::identity<coef_type>() + tmp * tmp));\n                sn = tmp * cs;\n            }\n        }\n};\n\n} \/\/ namespace solver\n} \/\/ namespace amgcl\n\n#endif\n<commit_msg>Fix GMRES for complex valued problems (#35)<commit_after>#ifndef AMGCL_SOLVER_GMRES_HPP\n#define AMGCL_SOLVER_GMRES_HPP\n\n\/*\nThe MIT License\n\nCopyright (c) 2012-2016 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   gmres.hpp\n * \\author Denis Demidov <dennis.demidov@gmail.com>\n * \\brief  GMRES method.\n *\/\n\n#include <vector>\n#include <cmath>\n\n#include <boost\/multi_array.hpp>\n#include <boost\/tuple\/tuple.hpp>\n#include <boost\/range\/algorithm.hpp>\n\n#include <amgcl\/backend\/interface.hpp>\n#include <amgcl\/solver\/detail\/default_inner_product.hpp>\n#include <amgcl\/util.hpp>\n\nnamespace amgcl {\nnamespace solver {\n\n\/** Generalized Minimal Residual (GMRES) method.\n * \\rst\n * The Generalized Minimal Residual method is an extension of MINRES (which is\n * only applicable to symmetric systems) to unsymmetric systems [Barr94]_.\n * \\endrst\n *\/\ntemplate <\n    class Backend,\n    class InnerProduct = detail::default_inner_product\n    >\nclass gmres {\n    public:\n        typedef Backend backend_type;\n\n        typedef typename Backend::vector     vector;\n        typedef typename Backend::value_type value_type;\n        typedef typename Backend::params     backend_params;\n\n        typedef typename math::scalar_of<value_type>::type scalar_type;\n        typedef typename math::rhs_of<value_type>::type rhs_type;\n        typedef typename math::inner_product_impl<rhs_type>::return_type coef_type;\n\n        \/\/\/ Solver parameters.\n        struct params {\n            \/\/\/ Number of iterations before restart.\n            unsigned M;\n\n            \/\/\/ Maximum number of iterations.\n            unsigned maxiter;\n\n            \/\/\/ Target residual error.\n            scalar_type tol;\n\n            params(unsigned M = 30, unsigned maxiter = 100, scalar_type tol = 1e-8)\n                : M(M), maxiter(maxiter), tol(tol)\n            { }\n\n            params(const boost::property_tree::ptree &p)\n                : AMGCL_PARAMS_IMPORT_VALUE(p, M),\n                  AMGCL_PARAMS_IMPORT_VALUE(p, maxiter),\n                  AMGCL_PARAMS_IMPORT_VALUE(p, tol)\n            {\n                AMGCL_PARAMS_CHECK(p, (M)(maxiter)(tol));\n            }\n\n            void get(boost::property_tree::ptree &p, const std::string &path) const {\n                AMGCL_PARAMS_EXPORT_VALUE(p, path, M);\n                AMGCL_PARAMS_EXPORT_VALUE(p, path, maxiter);\n                AMGCL_PARAMS_EXPORT_VALUE(p, path, tol);\n            }\n        };\n\n        \/\/\/ Preallocates necessary data structures for the system of size \\p n.\n        gmres(\n                size_t n,\n                const params &prm = params(),\n                const backend_params &backend_prm = backend_params(),\n                const InnerProduct &inner_product = InnerProduct()\n             )\n            : prm(prm), n(n),\n              H(boost::extents[prm.M + 1][prm.M]),\n              s(prm.M + 1), cs(prm.M + 1), sn(prm.M + 1),\n              r( Backend::create_vector(n, backend_prm) ),\n              inner_product(inner_product)\n        {\n            v.reserve(prm.M + 1);\n            for(unsigned i = 0; i <= prm.M; ++i)\n                v.push_back( Backend::create_vector(n, backend_prm) );\n        }\n\n        \/* Computes the solution for the given system matrix \\p A and the\n         * right-hand side \\p rhs.  Returns the number of iterations made and\n         * the achieved residual as a ``boost::tuple``. The solution vector\n         * \\p x provides initial approximation in input and holds the computed\n         * solution on output.\n         *\n         * The system matrix may differ from the matrix used during\n         * initialization. This may be used for the solution of non-stationary\n         * problems with slowly changing coefficients. There is a strong chance\n         * that a preconditioner built for a time step will act as a reasonably\n         * good preconditioner for several subsequent time steps [DeSh12]_.\n         *\/\n        template <class Matrix, class Precond, class Vec1, class Vec2>\n        boost::tuple<size_t, scalar_type> operator()(\n                Matrix  const &A,\n                Precond const &P,\n                Vec1    const &rhs,\n                Vec2          &x\n                ) const\n        {\n            size_t iter = 0;\n\n            scalar_type norm_rhs = norm(rhs);\n            if (norm_rhs < amgcl::detail::eps<scalar_type>(n)) {\n                backend::clear(x);\n                return boost::make_tuple(0, norm_rhs);\n            }\n\n            scalar_type eps = prm.tol * norm_rhs, norm_r = math::zero<scalar_type>();\n\n            while(true) {\n                backend::residual(rhs, A, x, *r);\n\n                \/\/ -- Check stopping condition\n                if ((norm_r = norm(*r)) < prm.tol * norm_rhs || iter >= prm.maxiter)\n                    break;\n\n                \/\/ -- Inner GMRES iteration\n                P.apply(*r, *v[0]);\n\n                boost::fill(s, 0);\n                s[0] = norm(*v[0]);\n\n                precondition(!math::is_zero(s[0]),\n                        \"Preconditioner returned a zero vector\");\n\n                backend::axpby(math::inverse(s[0]), *v[0], math::zero<scalar_type>(), *v[0]);\n\n\n                unsigned j = 0;\n                while(true) {\n                    \/\/ -- Arnoldi process\n                    \/\/\n                    \/\/ Build an orthonormal basis V and matrix H such that\n                    \/\/     A V_{i-1} = V_{i} H\n                    vector &v_new = *v[j+1];\n                    backend::spmv(math::identity<scalar_type>(), A, *v[j], math::zero<scalar_type>(), *r);\n                    P.apply(*r, v_new);\n\n                    for(unsigned k = 0; k <= j; ++k) {\n                        H[k][j] = inner_product(v_new, *v[k]);\n                        backend::axpby(-H[k][j], *v[k], math::identity<scalar_type>(), v_new);\n                    }\n                    H[j+1][j] = norm(v_new);\n\n                    backend::axpby(math::inverse(H[j+1][j]), v_new, math::zero<scalar_type>(), v_new);\n\n                    for(unsigned k = 0; k < j; ++k)\n                        apply_plane_rotation(H[k][j], H[k+1][j], cs[k], sn[k]);\n\n                    generate_plane_rotation(H[j][j], H[j+1][j], cs[j], sn[j]);\n                    apply_plane_rotation(H[j][j], H[j+1][j], cs[j], sn[j]);\n                    apply_plane_rotation(s[j], s[j+1], cs[j], sn[j]);\n\n                    scalar_type inner_res = std::abs(s[j+1]);\n\n                    \/\/ Check for termination\n                    ++j, ++iter;\n                    if (iter >= prm.maxiter || j >= prm.M || inner_res <= eps)\n                        break;\n                }\n\n                \/\/ -- GMRES terminated: eval solution\n                for (unsigned i = j; i --> 0; ) {\n                    s[i] \/= H[i][i];\n                    for (unsigned k = 0; k < i; ++k)\n                        s[k] -= H[k][i] * s[i];\n                }\n\n                unsigned k = 0;\n                for (; k + 1 < j; k += 2)\n                    backend::axpbypcz(s[k], *v[k], s[k+1], *v[k+1], math::identity<scalar_type>(), x);\n                for (; k < j; ++k)\n                    backend::axpby(s[k], *v[k], math::identity<scalar_type>(), x);\n            }\n\n            return boost::make_tuple(iter, norm_r \/ norm_rhs);\n        }\n\n        \/* Computes the solution for the given right-hand side \\p rhs. The\n         * system matrix is the same that was used for the setup of the\n         * preconditioner \\p P.  Returns the number of iterations made and the\n         * achieved residual as a ``boost::tuple``. The solution vector \\p x\n         * provides initial approximation in input and holds the computed\n         * solution on output.\n         *\/\n        template <class Precond, class Vec1, class Vec2>\n        boost::tuple<size_t, scalar_type> operator()(\n                Precond const &P,\n                Vec1    const &rhs,\n                Vec2          &x\n                ) const\n        {\n            return (*this)(P.system_matrix(), P, rhs, x);\n        }\n\n\n        friend std::ostream& operator<<(std::ostream &os, const gmres &s) {\n            return os << \"gmres(\" << s.prm.M << \"): \" << s.n << \" unknowns\";\n        }\n    public:\n        params prm;\n\n    private:\n        size_t n;\n\n        mutable boost::multi_array<coef_type, 2> H;\n        mutable std::vector<coef_type> s, cs, sn;\n        boost::shared_ptr<vector> r;\n        std::vector< boost::shared_ptr<vector> > v;\n\n        InnerProduct inner_product;\n\n        template <class Vec>\n        scalar_type norm(const Vec &x) const {\n            return std::abs(sqrt(inner_product(x, x)));\n        }\n\n        static void apply_plane_rotation(\n                coef_type &dx, coef_type &dy, coef_type cs, coef_type sn\n                )\n        {\n            coef_type tmp = math::adjoint(cs) * dx + math::adjoint(sn) * dy;\n            dy = -sn * dx + cs * dy;\n            dx = tmp;\n        }\n\n        static void generate_plane_rotation(\n                coef_type dx, coef_type dy, coef_type &cs, coef_type &sn\n                )\n        {\n            if (math::is_zero(dy)) {\n                cs = 1;\n                sn = 0;\n            } else if (std::abs(dy) > std::abs(dx)) {\n                coef_type tmp = dx \/ dy;\n                sn = math::inverse(sqrt(math::identity<coef_type>() + tmp * tmp));\n                cs = tmp * sn;\n            } else {\n                coef_type tmp = dy \/ dx;\n                cs = math::inverse(sqrt(math::identity<coef_type>() + tmp * tmp));\n                sn = tmp * cs;\n            }\n        }\n};\n\n} \/\/ namespace solver\n} \/\/ namespace amgcl\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>`config::SettingMaster` & `ontology::Universe` moved up.<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"stdsneezy.h\"\n#include \"obj_base_corpse.h\"\n#include \"obj_tool.h\"\n\nint task_sacrifice(TBeing *ch, cmdTypeT cmd, const char *, int pulse, TRoom *, TObj *obj)\n{\n  TThing *t, *t2;\n  TMonster *guard;\n  TTool *totem=NULL;\n  int found=0;\n  int learning = ch->getSkillValue(SKILL_SACRIFICE);\n  TBaseCorpse *corpse = dynamic_cast<TBaseCorpse *>(obj);\n  int clev = ch->GetMaxLevel();\n  int percent = ::number(1, 100);\n  int factor = ::number(5, (((clev + learning) + percent) \/ 2));\n  int factor2 = ::number(5, (((clev + learning) + percent) \/ 5));\n\n  if (ch->utilityTaskCommand(cmd) || ch->nobrainerTaskCommand(cmd))\n    return FALSE;\n\n  if (!corpse) {\n    act(\"You cease your ritual sacrifice.\", false, ch, 0, 0, TO_CHAR);\n    act(\"$n ceases $s sacrifice.\", false, ch, 0, 0, TO_ROOM);\n    ch->stopTask();\n    vlogf(LOG_BUG, \"task_sacrifice.cc: Corpse sacrifice task entered without a corpse!\");\n    return FALSE;\n  }\n\n  if (ch->isLinkdead() || (ch->in_room != ch->task->wasInRoom) || (ch->getPosition() < POSITION_RESTING)) {\n    act(\"You cease the ritual sacrifice of $p.\", FALSE, ch, corpse, 0, TO_CHAR);\n    act(\"$n stops trying to sacrifice $p.\", TRUE, ch, corpse, 0, TO_ROOM);\n    ch->stopTask();\n    if (corpse->isCorpseFlag(CORPSE_SACRIFICE))\n      corpse->remCorpseFlag(CORPSE_SACRIFICE);\n    return FALSE;\n  }\n\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 the object of the ritual! Wasn't there a corpse here?\", FALSE, ch, 0, 0, TO_CHAR);\n      act(\"$n stops singing and looks confused.\", TRUE, ch, 0, 0, TO_ROOM);\n      ch->stopTask();\n      return FALSE;\n    }\n  }\n\n  if (!(t = get_thing_char_using(ch, \"totem\", 0, FALSE, FALSE)) || !(totem=dynamic_cast<TTool *>(t))) {\n    ch->sendTo(\"You need to own a totem to perform the ritual.\\n\\r\");\n    ch->stopTask();\n    if (corpse->isCorpseFlag(CORPSE_SACRIFICE))\n      corpse->remCorpseFlag(CORPSE_SACRIFICE);\n    return FALSE;\n  }\n\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) || !guard->awake())\n      continue;\n    int saything = (::number(0,3));\n    switch (saything) {\n      case 0:\n\tguard->doSay(\"Hey! Get the hell out of here! Damn Voodoo Witch!\");\n\tbreak;\n      case 1:\n\tguard->doSay(\"Hey! Don't you have any respect for the dead?!? Get the hell out of here!\");\n\tbreak;\n      case 2:\n\tguard->doSay(\"Damn Shaman! Take your voodoo crap and PISS OFF!!!\");\n\tbreak;\n      case 3:\n\tguard->doSay(\"Hey witch!! Are you some sort of whacked out necrophiliac? Bugger off!!\");\n\tbreak;\n    }\n    act(\"You cease the ritual sacrifice of $p.\", FALSE, ch, corpse, 0, TO_CHAR);\n    act(\"$n stops chanting over the corpse of $p.\", TRUE, ch, corpse, 0, TO_ROOM);\n    ch->stopTask();\n    if (corpse->isCorpseFlag(CORPSE_SACRIFICE))\n      corpse->remCorpseFlag(CORPSE_SACRIFICE);\n    return FALSE;\n  }\n\n  if (ch->task->timeLeft < 0){\n    act(\"You have completed the sacrifice of $p.\", FALSE, ch, corpse, 0, TO_CHAR);\n    act(\"$n has completed $s ritual sacrifice of $p.\", FALSE, ch, corpse, 0, TO_ROOM);\n    act(\"Some <r>blood<z> from $p has been left behind.\", FALSE, ch, corpse, 0, TO_ROOM);\n    act(\"Some <r>blood<z> from $p has been left behind for the dogs!\", FALSE, ch, corpse, 0, TO_CHAR);\n    ch->dropPool(1, LIQ_BLOOD);\n    ch->stopTask();\n    return DELETE_ITEM;\n  }\n\n  if (percent < ch->getSkillValue(SKILL_SACRIFICE)) {\n    act(\"Your sacrifice is being accepted by the loa.\", FALSE, ch, 0, 0, TO_CHAR);\n    ch->addToLifeforce(factor);\n    ch->updatePos();\n  } else {\n    ch->addToLifeforce(-factor2);\n    if (0 >= ch->getLifeforce()) {\n      ch->setLifeforce(0);\n      act(\"The loa demands that you cease this vain sacrifice, and you comply.\", FALSE, ch, 0, 0, TO_CHAR);\n      ch->addToHit(-2);\n      ch->updatePos();\n      ch->task->timeLeft = -1;\n    }\n  }\n\n  switch (cmd) {\n  case CMD_TASK_CONTINUE:\n    ch->task->calcNextUpdate(pulse, 2);\n    totem->addToToolUses(-1);\n    if (totem->getToolUses() <= 0) {\n      act(\"Your $o has been confiscated by the loa! It must have been too weak.\", FALSE, ch, totem, 0, TO_CHAR);\n      act(\"$n looks pale as $s $o shatters.\", FALSE, ch, totem, 0, TO_ROOM);\n      ch->stopTask();\n      delete totem;\n      if (corpse->isCorpseFlag(CORPSE_SACRIFICE))\n\tcorpse->remCorpseFlag(CORPSE_SACRIFICE);\n      return FALSE;\n    }\n    switch (ch->task->timeLeft) {\n      case 2:\n\tif (!corpse) {\n\t  act(\"You can't find the object of the ritual! Wasn't there $p's corpse here?\", FALSE, ch, corpse, 0, TO_CHAR);\n\t  act(\"$n stops singing and looks confused.\", TRUE, ch, 0, 0, TO_ROOM);\n\t  return FALSE;\n\t} else {\n  \t  if (10 >= corpse->obj_flags.decay_time) {\n\t    corpse->obj_flags.decay_time = 10;\n\t  }\n          act(\"You continue the rada song to the loa in hopes they will accept your sacrifice.\", FALSE, ch, 0, 0, TO_CHAR);\n          act(\"$n sings in an unfamiliar tongue over $p.\", TRUE, ch, corpse, 0, TO_ROOM);\n\t  if (bSuccess(ch, learning, SKILL_SACRIFICE)) {\n\t    ch->task->timeLeft--;\n\t  } else {\n\t    ch->task->timeLeft = 2;\n\t  }\n\t}\n\tbreak;\n      case 1:\n\tif (!corpse) {\n\t  act(\"You can't find the object of the ritual! Wasn't there a corpse here?\", FALSE, ch, 0, 0, TO_CHAR);\n\t  act(\"$n stops singing and looks confused.\", TRUE, ch, 0, 0, TO_ROOM);\n\t  return FALSE;\n\t} else {\n  \t  if (10 >= corpse->obj_flags.decay_time) {\n\t    corpse->obj_flags.decay_time = 10;\n\t  }\n          act(\"Your $o's eyes glow <r>blood red<1>.\", FALSE, ch, totem, 0, TO_CHAR);\n          act(\"The eyes on $n's $o begin to glow a <r>blood red<1>.\", TRUE, ch, totem, 0, TO_ROOM);\n\t  if (bSuccess(ch, learning, SKILL_SACRIFICE)) {\n\t    ch->task->timeLeft--;\n \t  } else {\n\t    ch->task->timeLeft = 1;\n\t  }\n\t}\n\tbreak;\n      case 0:\n\tif (!corpse) {\n\t  act(\"You can't find the object of the ritual! Wasn't there a corpse here?\", FALSE, ch, 0, 0, TO_CHAR);\n\t  act(\"$n stops singing and looks confused.\", TRUE, ch, 0, 0, TO_ROOM);\n\t  return FALSE;\n\t} else {\n  \t  if (10 >= corpse->obj_flags.decay_time) {\n\t    corpse->obj_flags.decay_time = 10;\n\t  }\n\t  act(\"You continue to sing the rada song over $p.\", FALSE, ch, corpse, 0, TO_CHAR);\n\t  act(\"$n's ritual sacrifice causes $p's face to glow <G>pale green<1>.\", FALSE, ch, corpse, 0, TO_ROOM);\n\t  if (bSuccess(ch, learning, SKILL_SACRIFICE)) {\n\t    ch->task->timeLeft--;\n\t  } else {\n\t    ch->task->timeLeft = 0;\n\t  }\n\t}\n\tbreak;\n    }\n    break;\n  case CMD_ABORT:\n  case CMD_STOP:\n      act(\"You stop performing the ritual.\", FALSE, ch, 0, 0, TO_CHAR);\n      act(\"$n stops singing.\", TRUE, ch, 0, 0, TO_ROOM);\n      ch->stopTask();\n      delete corpse;\n      break;\n  case CMD_TASK_FIGHTING:\n      ch->sendTo(\"You can't sacrifice a corpse while under attack.\\n\\r\");\n      ch->stopTask();\n      delete corpse;\n      break;\n  default:\n      if (cmd < MAX_CMD_LIST)\n\tch->addToLifeforce(-factor * 2);\n        warn_busy(ch);\n      break;\n  }\n  return TRUE;\n}\n<commit_msg>- fixed a bug in sacrifice and cleaned it up a lot<commit_after>#include \"stdsneezy.h\"\n#include \"obj_base_corpse.h\"\n#include \"obj_tool.h\"\n\nint task_sacrifice(TBeing *ch, cmdTypeT cmd, const char *, int pulse, TRoom *, TObj *obj)\n{\n  TThing *t, *t2;\n  TMonster *guard;\n  TTool *totem=NULL;\n  int learning = ch->getSkillValue(SKILL_SACRIFICE);\n  TBaseCorpse *corpse = dynamic_cast<TBaseCorpse *>(obj);\n  int clev = ch->GetMaxLevel();\n  int percent = ::number(1, 100);\n  int factor = ::number(5, (((clev + learning) + percent) \/ 2));\n  int factor2 = ::number(5, (((clev + learning) + percent) \/ 5));\n\n  if (ch->utilityTaskCommand(cmd) || ch->nobrainerTaskCommand(cmd)) {\n    return FALSE;\n  }\n\n  if (!corpse) {\n\t  act(\"You can't find the object of the ritual! Wasn't there a corpse here?\", \n      FALSE, ch, 0, 0, TO_CHAR);\n\t  act(\"$n stops singing and looks confused.\", TRUE, ch, 0, 0, TO_ROOM);\n    ch->stopTask();\n    vlogf(LOG_BUG,\n        fmt(\"task_sacrifice.cc: sacrifice task entered by %s without a corpse!\") \n        % ch->getName());\n    return FALSE;\n  }\n\n  if (ch->isLinkdead() || (ch->in_room != ch->task->wasInRoom) || \n      (ch->getPosition() < POSITION_RESTING)) {\n    act(\"You cease the ritual sacrifice of $p.\", FALSE, ch, corpse, 0, TO_CHAR);\n    act(\"$n stops trying to sacrifice $p.\", TRUE, ch, corpse, 0, TO_ROOM);\n    ch->stopTask();\n    if (corpse->isCorpseFlag(CORPSE_SACRIFICE))\n      corpse->remCorpseFlag(CORPSE_SACRIFICE);\n    return FALSE;\n  }\n\n  if (!(t = get_thing_char_using(ch, \"totem\", 0, FALSE, FALSE)) || \n      !(totem=dynamic_cast<TTool *>(t))) {\n    ch->sendTo(\"You need to own a totem to perform the ritual.\\n\\r\");\n    ch->stopTask();\n    if (corpse->isCorpseFlag(CORPSE_SACRIFICE))\n      corpse->remCorpseFlag(CORPSE_SACRIFICE);\n    return FALSE;\n  }\n\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) || !guard->awake())\n      continue;\n    int saything = (::number(0,3));\n    switch (saything) {\n      case 0:\n\t      guard->doSay(\"Hey! Get the hell out of here! Damn Voodoo Witch!\");\n\t      break;\n      case 1:\n\t      guard->doSay(\"Hey! Don't you have any respect for the dead?!? Get the hell out of here!\");\n\t      break;\n      case 2:\n\t      guard->doSay(\"Damn Shaman! Take your voodoo crap and PISS OFF!!!\");\n\t      break;\n      case 3:\n\t    guard->doSay(\"Hey witch!! Are you some sort of whacked out necrophiliac? Bugger off!!\");\n\t    break;\n    }\n    act(\"You cease the ritual sacrifice of $p.\", \n        FALSE, ch, corpse, 0, TO_CHAR);\n    act(\"$n stops chanting over the corpse of $p.\", \n        TRUE, ch, corpse, 0, TO_ROOM);\n    ch->stopTask();\n    if (corpse->isCorpseFlag(CORPSE_SACRIFICE))\n      corpse->remCorpseFlag(CORPSE_SACRIFICE);\n    return FALSE;\n  }\n\n  if (ch->task->timeLeft < 0){\n    act(\"You have completed the sacrifice of $p.\", \n        FALSE, ch, corpse, 0, TO_CHAR);\n    act(\"$n has completed $s ritual sacrifice of $p.\", \n        FALSE, ch, corpse, 0, TO_ROOM);\n    act(\"Some <r>blood<z> from $p has been left behind.\", \n        FALSE, ch, corpse, 0, TO_ROOM);\n    act(\"Some <r>blood<z> from $p has been left behind for the dogs!\", \n        FALSE, ch, corpse, 0, TO_CHAR);\n    ch->dropPool(1, LIQ_BLOOD);\n    ch->stopTask();\n    delete corpse;\n    return FALSE;\n  }\n\n  switch (cmd) {\n    case CMD_TASK_CONTINUE:\n      if (percent < ch->getSkillValue(SKILL_SACRIFICE)) {\n        act(\"Your sacrifice is being accepted by the loa.\", \n            FALSE, ch, 0, 0, TO_CHAR);\n        ch->addToLifeforce(factor);\n        ch->updatePos();\n      } else {\n        ch->addToLifeforce(-factor2);\n        if (0 >= ch->getLifeforce()) {\n          ch->setLifeforce(0);\n          act(\"The loa demands that you cease this vain sacrifice, and you comply.\", \n              FALSE, ch, 0, 0, TO_CHAR);\n          ch->addToHit(-2);\n          ch->updatePos();\n          ch->task->timeLeft = -1;\n        }\n      }\n\n      ch->task->calcNextUpdate(pulse, 2);\n      totem->addToToolUses(-1);\n      if (totem->getToolUses() <= 0) {\n        act(\"Your $o has been confiscated by the loa! It must have been too weak.\", \n            FALSE, ch, totem, 0, TO_CHAR);\n        act(\"$n looks pale as $s $o shatters.\", FALSE, ch, totem, 0, TO_ROOM);\n        ch->stopTask();\n        delete totem;\n        if (corpse->isCorpseFlag(CORPSE_SACRIFICE))\n          corpse->remCorpseFlag(CORPSE_SACRIFICE);\n        return FALSE;\n      }\n      if (10 >= corpse->obj_flags.decay_time)\n        corpse->obj_flags.decay_time = 10;\n\n      switch (ch->task->timeLeft) {\n        case 2:\n          act(\"You continue the rada song to the loa in hopes they will accept your sacrifice.\", \n              FALSE, ch, 0, 0, TO_CHAR);\n          act(\"$n sings in an unfamiliar tongue over $p.\", \n              TRUE, ch, corpse, 0, TO_ROOM);\n\t        if (bSuccess(ch, learning, SKILL_SACRIFICE))\n\t          ch->task->timeLeft--;\n\t        break;\n        case 1:\n          act(\"Your $o's eyes glow <r>blood red<1>.\", \n              FALSE, ch, totem, 0, TO_CHAR);\n          act(\"The eyes on $n's $o begin to glow a <r>blood red<1>.\", \n              TRUE, ch, totem, 0, TO_ROOM);\n\t        if (bSuccess(ch, learning, SKILL_SACRIFICE))\n\t          ch->task->timeLeft--;\n\t        break;\n        case 0:\n\t        act(\"You continue to sing the rada song over $p.\", \n              FALSE, ch, corpse, 0, TO_CHAR);\n\t        act(\"$n's ritual sacrifice causes $p's face to glow <G>pale green<1>.\", \n              FALSE, ch, corpse, 0, TO_ROOM);\n          if (bSuccess(ch, learning, SKILL_SACRIFICE))\n            ch->task->timeLeft--;\n          break;\n        default:\n          act(\"Bug Maror if you get this message.\", false, ch, 0, 0, TO_CHAR);\n          vlogf(LOG_BUG, \"no appropriate option in switch in sacrifice.cc\");\n          ch->stopTask();\n          if (corpse->isCorpseFlag(CORPSE_SACRIFICE))\n            corpse->remCorpseFlag(CORPSE_SACRIFICE);\n          break;\n      }\n      break;\n    case CMD_TASK_FIGHTING:\n      ch->sendTo(\"You can't sacrifice a corpse while under attack.\\n\\r\");\n      \/\/ don't put a break in here\n    case CMD_ABORT:\n    case CMD_STOP:\n      act(\"Some <r>blood<z> from $p has been left behind.\", \n          FALSE, ch, corpse, 0, TO_ROOM);\n      act(\"Some <r>blood<z> from $p has been left behind for the dogs!\", \n          FALSE, ch, corpse, 0, TO_CHAR);\n      ch->dropPool(1, LIQ_BLOOD);\n      ch->stopTask();\n      delete corpse;\n      return FALSE;\n      break;\n    default:\n      if (cmd < MAX_CMD_LIST)\n      ch->addToLifeforce(-factor * 2);\n        warn_busy(ch);\n      break;\n  }\n  return TRUE;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>incorporated CW feedback<commit_after><|endoftext|>"}
{"text":"<commit_before>#ifndef SOLAIRE_CORE_ALLOCATOR_HPP\n#define SOLAIRE_CORE_ALLOCATOR_HPP\n\n\/\/Copyright 2016 Adam G. 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 <cstdint>\n\nnamespace solaire {\n\tstruct allocator {\n\t\tvirtual ~allocator() {}\n\t\tvirtual void* allocate(size_t) = 0;\n\t\tvirtual void deallocate(void*) = 0;\n\t};\n\n\ttemplate<size_t SIZE>\n\tclass static_allocator : public allocator {\n\tprivate:\n\t\tuint8_t mData[SIZE];\n\t\tbool mAllocated;\n\n\t\tstatic_allocator(static_allocator&&) = delete;\n\t\tstatic_allocator<SIZE>& operator=(static_allocator&&) = delete;\n\tpublic:\n\t\tconstexpr static_allocator() : mData(), mAllocated(false) {}\n\t\tinline void deallocate(void* aData) override { if (aData == mData) mAllocated = false; }\n\n\t\tvoid* allocate(size_t aSize) override {\n\t\t\tif(mAllocated) throw std::runtime_error(\"solaire::static_allocator::allocate : Memory must be deallocated before it can be allocated again\");\n\t\t\tif(aSize > SIZE) throw std::runtime_error(\"solaire::static_allocator::allocate : Allocation size is too large\");\n\t\t\tmAllocated = true;\n\t\t\treturn mData;\n\t\t}\n\t};\n\n\tclass heap_allocator : public allocator {\n\tpublic:\n\t\tconstexpr heap_allocator() {}\n\t\tinline void deallocate(void* aData) override { operator delete(aData); }\n\n\t\tinline void* allocate(size_t aSize) override {\n\t\t\tvoid* const tmp = operator new(aSize);\n\t\t\tif (tmp == nullptr) throw std::runtime_error(\"solaire::heap_allocator::allocate : Failed to allocate memory\");\n\t\t\treturn tmp;\n\t\t}\n\t};\n}\n\n#endif<commit_msg>Redesign of allocator concept<commit_after>#ifndef SOLAIRE_CORE_ALLOCATOR_HPP\n#define SOLAIRE_CORE_ALLOCATOR_HPP\n\n\/\/Copyright 2016 Adam G. 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 <cstdint>\n\nnamespace solaire {\n\tstruct allocator {\n\t\tstatic allocator allocate(size_t);\n\t\tstatic void deallocate(allocator&);\n\n\t\tvoid* get() const;\n\t\tsize_t size() const;\n\t};\n\n\ttemplate<size_t SIZE>\n\tclass static_allocator {\n\tprivate:\n\t\tuint8_t mData[SIZE];\n\n\t\tstatic_allocator(const static_allocator&) = delete;\n\t\tstatic_allocator<SIZE>& operator=(const static_allocator&) = delete;\n\t\tstatic_allocator(static_allocator&&) = delete;\n\t\tstatic_allocator<SIZE>& operator=(static_allocator&&) = delete;\n\tpublic:\n\t\tinline void* get() const { return mData; }\n\t\tinline size_t size() const { return SIZE; }\n\n\t\tconstexpr static_allocator() : \n\t\t\tmData() \n\t\t{}\n\n\t\tinline static void deallocate(allocator& aData) {\n\n\t\t}\n\n\t\tinline static void* allocate(size_t aSize) {\n\t\t\tif(aSize > SIZE) throw std::runtime_error(\"solaire::static_allocator::allocate : Allocation size is too large\");\n\t\t\treturn static_allocator();\n\t\t}\n\t};\n\n\tclass heap_allocator {\n\tprivate:\n\t\tvoid* mData;\n\t\tsize_t mSize;\n\n\t\theap_allocator(const heap_allocator&) = delete;\n\t\theap_allocator& operator=(const heap_allocator&) = delete;\n\tpublic:\n\t\tinline void* get() const { return mData; }\n\t\tinline size_t size() const { return mSize; }\n\n\t\tconstexpr heap_allocator() : \n\t\t\tmData(nullptr), \n\t\t\tmSize(0) \n\t\t{}\n\t\t\n\t\theap_allocator(heap_allocator&& aOther) : \n\t\t\tmData(aOther.mData), \n\t\t\tmSize(aOther.mSize) \n\t\t{ \n\t\t\taOther.mData = nullptr; \n\t\t\taOther.mSize = 0; \n\t\t}\n\n\t\t~heap_allocator() {\n\t\t\tif (mData) deallocate(*this);\n\t\t}\n\n\t\theap_allocator& operator=(heap_allocator&& aOther) {\n\t\t\tstd::swap(mData, aOther.mData);\n\t\t\tstd::swap(mSize, aOther.mSize);\n\t\t\treturn *this;\n\t\t}\n\n\t\tinline static void deallocate(heap_allocator& aData) { \n\t\t\toperator delete(aData.mData); \n\t\t}\n\n\t\tinline static heap_allocator allocate(size_t aSize) {\n\t\t\theap_allocator tmp;\n\t\t\ttmp.mData = operator new(aSize);\n\t\t\ttmp.mSize = aSize;\n\t\t\tif(tmp.mData == nullptr) throw std::runtime_error(\"solaire::heap_allocator::allocate : Failed to allocate memory\");\n\t\t\treturn tmp;\n\t\t}\n\t};\n}\n\n#endif<|endoftext|>"}
{"text":"<commit_before>\/*\n\nCopyright (c) 2003, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n    * Redistributions of source code must retain the above copyright\n      notice, this list of conditions and the following disclaimer.\n    * Redistributions in binary form must reproduce the above copyright\n      notice, this list of conditions and the following disclaimer in\n      the documentation and\/or other materials provided with the distribution.\n    * Neither the name of the author nor the names of its\n      contributors may be used to endorse or promote products derived\n      from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/entry.hpp\"\n#include \"libtorrent\/bencode.hpp\"\n#include \"libtorrent\/torrent_info.hpp\"\n#include \"libtorrent\/lazy_entry.hpp\"\n#include \"libtorrent\/magnet_uri.hpp\"\n\nint load_file(std::string const& filename, std::vector<char>& v, libtorrent::error_code& ec, int limit = 8000000)\n{\n\tec.clear();\n\tFILE* f = fopen(filename.c_str(), \"rb\");\n\tif (f == NULL)\n\t{\n\t\tec.assign(errno, boost::system::get_generic_category());\n\t\treturn -1;\n\t}\n\n\tint r = fseek(f, 0, SEEK_END);\n\tif (r != 0)\n\t{\n\t\tec.assign(errno, boost::system::get_generic_category());\n\t\tfclose(f);\n\t\treturn -1;\n\t}\n\tlong s = ftell(f);\n\tif (s < 0)\n\t{\n\t\tec.assign(errno, boost::system::get_generic_category());\n\t\tfclose(f);\n\t\treturn -1;\n\t}\n\n\tif (s > limit)\n\t{\n\t\tfclose(f);\n\t\treturn -2;\n\t}\n\n\tr = fseek(f, 0, SEEK_SET);\n\tif (r != 0)\n\t{\n\t\tec.assign(errno, boost::system::get_generic_category());\n\t\tfclose(f);\n\t\treturn -1;\n\t}\n\n\tv.resize(s);\n\tif (s == 0)\n\t{\n\t\tfclose(f);\n\t\treturn 0;\n\t}\n\n\tr = fread(&v[0], 1, v.size(), f);\n\tif (r < 0)\n\t{\n\t\tec.assign(errno, boost::system::get_generic_category());\n\t\tfclose(f);\n\t\treturn -1;\n\t}\n\n\tfclose(f);\n\n\tif (r != s) return -3;\n\n\treturn 0;\n}\n\nint line_longer_than(libtorrent::lazy_entry const& e, int limit)\n{\n\tusing namespace libtorrent;\n\n\tint line_len = 0;\n\tswitch (e.type())\n\t{\n\tcase lazy_entry::list_t:\n\t\tline_len += 4;\n\t\tif (line_len > limit) return -1;\n\t\tfor (int i = 0; i < e.list_size(); ++i)\n\t\t{\n\t\t\tint ret = line_longer_than(*e.list_at(i), limit - line_len);\n\t\t\tif (ret == -1) return -1;\n\t\t\tline_len += ret + 2;\n\t\t}\n\t\tbreak;\n\tcase lazy_entry::dict_t:\n\t\tline_len += 4;\n\t\tif (line_len > limit) return -1;\n\t\tfor (int i = 0; i < e.dict_size(); ++i)\n\t\t{\n\t\t\tline_len += 4 + e.dict_at(i).first.size();\n\t\t\tif (line_len > limit) return -1;\n\t\t\tint ret = line_longer_than(*e.dict_at(i).second, limit - line_len);\n\t\t\tif (ret == -1) return -1;\n\t\t\tline_len += ret + 1;\n\t\t}\n\t\tbreak;\n\tcase lazy_entry::string_t:\n\t\tline_len += 3 + e.string_length();\n\t\tbreak;\n\tcase lazy_entry::int_t:\n\t{\n\t\tsize_type val = e.int_value();\n\t\twhile (val > 0)\n\t\t{\n\t\t\t++line_len;\n\t\t\tval \/= 10;\n\t\t}\n\t\tline_len += 2;\n\t}\n\tbreak;\n\tcase lazy_entry::none_t:\n\t\tline_len += 4;\n\t\tbreak;\n\t}\n\n\tif (line_len > limit) return -1;\n\treturn line_len;\n}\n\nstd::string print_entry(libtorrent::lazy_entry const& e, bool single_line = false, int indent = 0)\n{\n\tusing namespace libtorrent;\n\n\tchar indent_str[200];\n\tmemset(indent_str, ' ', 200);\n\tindent_str[0] = ',';\n\tindent_str[1] = '\\n';\n\tindent_str[199] = 0;\n\tif (indent < 197 && indent >= 0) indent_str[indent+2] = 0;\n\tstd::string ret;\n\tswitch (e.type())\n\t{\n\t\tcase lazy_entry::none_t: return \"none\";\n\t\tcase lazy_entry::int_t:\n\t\t{\n\t\t\tchar str[100];\n\t\t\tsnprintf(str, sizeof(str), \"%\"PRId64, e.int_value());\n\t\t\treturn str;\n\t\t}\n\t\tcase lazy_entry::string_t:\n\t\t{\n\t\t\tbool printable = true;\n\t\t\tchar const* str = e.string_ptr();\n\t\t\tfor (int i = 0; i < e.string_length(); ++i)\n\t\t\t{\n\t\t\t\tusing namespace std;\n\t\t\t\tif (is_print((unsigned char)str[i])) continue;\n\t\t\t\tprintable = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tret += \"'\";\n\t\t\tif (printable)\n\t\t\t{\n\t\t\t\tret += e.string_value();\n\t\t\t\tret += \"'\";\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t\tfor (int i = 0; i < e.string_length(); ++i)\n\t\t\t{\n\t\t\t\tchar tmp[5];\n\t\t\t\tsnprintf(tmp, sizeof(tmp), \"%02x\", (unsigned char)str[i]);\n\t\t\t\tret += tmp;\n\t\t\t}\n\t\t\tret += \"'\";\n\t\t\treturn ret;\n\t\t}\n\t\tcase lazy_entry::list_t:\n\t\t{\n\t\t\tret += '[';\n\t\t\tbool one_liner = line_longer_than(e, 200) != -1 || single_line;\n\n\t\t\tif (!one_liner) ret += indent_str + 1;\n\t\t\tfor (int i = 0; i < e.list_size(); ++i)\n\t\t\t{\n\t\t\t\tif (i == 0 && one_liner) ret += \" \";\n\t\t\t\tret += ::print_entry(*e.list_at(i), single_line, indent + 2);\n\t\t\t\tif (i < e.list_size() - 1) ret += (one_liner?\", \":indent_str);\n\t\t\t\telse ret += (one_liner?\" \":indent_str+1);\n\t\t\t}\n\t\t\tret += \"]\";\n\t\t\treturn ret;\n\t\t}\n\t\tcase lazy_entry::dict_t:\n\t\t{\n\t\t\tret += \"{\";\n\t\t\tbool one_liner = line_longer_than(e, 200) != -1 || single_line;\n\n\t\t\tif (!one_liner) ret += indent_str+1;\n\t\t\tfor (int i = 0; i < e.dict_size(); ++i)\n\t\t\t{\n\t\t\t\tif (i == 0 && one_liner) ret += \" \";\n\t\t\t\tstd::pair<std::string, lazy_entry const*> ent = e.dict_at(i);\n\t\t\t\tret += \"'\";\n\t\t\t\tret += ent.first;\n\t\t\t\tret += \"': \";\n\t\t\t\tret += ::print_entry(*ent.second, single_line, indent + 2);\n\t\t\t\tif (i < e.dict_size() - 1) ret += (one_liner?\", \":indent_str);\n\t\t\t\telse ret += (one_liner?\" \":indent_str+1);\n\t\t\t}\n\t\t\tret += \"}\";\n\t\t\treturn ret;\n\t\t}\n\t}\n\treturn ret;\n}\n\nint main(int argc, char* argv[])\n{\n\tusing namespace libtorrent;\n\n\tif (argc < 2 || argc > 4)\n\t{\n\t\tfputs(\"usage: dump_torrent torrent-file [total-items-limit] [recursion-limit]\\n\", stderr);\n\t\treturn 1;\n\t}\n\n\tint item_limit = 1000000;\n\tint depth_limit = 1000;\n\n\tif (argc > 2) item_limit = atoi(argv[2]);\n\tif (argc > 3) depth_limit = atoi(argv[3]);\n\n\tint size = file_size(argv[1]);\n\tif (size > 40 * 1000000)\n\t{\n\t\tfprintf(stderr, \"file too big (%d), aborting\\n\", size);\n\t\treturn 1;\n\t}\n\tstd::vector<char> buf(size);\n\terror_code ec;\n\tint ret = load_file(argv[1], buf, ec, 40 * 1000000);\n\tif (ret != 0)\n\t{\n\t\tfprintf(stderr, \"failed to load file: %s\\n\", ec.message().c_str());\n\t\treturn 1;\n\t}\n\tlazy_entry e;\n\tint pos;\n\tprintf(\"decoding. recursion limit: %d total item count limit: %d\\n\"\n\t\t, depth_limit, item_limit);\n\tret = lazy_bdecode(&buf[0], &buf[0] + buf.size(), e, ec, &pos\n\t\t, depth_limit, item_limit);\n\n\tprintf(\"\\n\\n----- raw info -----\\n\\n%s\\n\", ::print_entry(e).c_str());\n\n\tif (ret != 0)\n\t{\n\t\tfprintf(stderr, \"failed to decode: '%s' at character: %d\\n\", ec.message().c_str(), pos);\n\t\treturn 1;\n\t}\n\n\ttorrent_info t(e, ec);\n\tif (ec)\n\t{\n\t\tfprintf(stderr, \"%s\\n\", ec.message().c_str());\n\t\treturn 1;\n\t}\n\te.clear();\n\tstd::vector<char>().swap(buf);\n\n\t\/\/ print info about torrent\n\tprintf(\"\\n\\n----- torrent file info -----\\n\\n\"\n\t\t\"nodes:\\n\");\n\n\ttypedef std::vector<std::pair<std::string, int> > node_vec;\n\tnode_vec const& nodes = t.nodes();\n\tfor (node_vec::const_iterator i = nodes.begin(), end(nodes.end());\n\t\ti != end; ++i)\n\t{\n\t\tprintf(\"%s: %d\\n\", i->first.c_str(), i->second);\n\t}\n\tputs(\"trackers:\\n\");\n\tfor (std::vector<announce_entry>::const_iterator i = t.trackers().begin();\n\t\ti != t.trackers().end(); ++i)\n\t{\n\t\tprintf(\"%2d: %s\\n\", i->tier, i->url.c_str());\n\t}\n\n\tchar ih[41];\n\tto_hex((char const*)&t.info_hash()[0], 20, ih);\n\tprintf(\"number of pieces: %d\\n\"\n\t\t\"piece length: %d\\n\"\n\t\t\"info hash: %s\\n\"\n\t\t\"comment: %s\\n\"\n\t\t\"created by: %s\\n\"\n\t\t\"magnet link: %s\\n\"\n\t\t\"name: %s\\n\"\n\t\t\"number of files: %d\\n\"\n\t\t\"files:\\n\"\n\t\t, t.num_pieces()\n\t\t, t.piece_length()\n\t\t, ih\n\t\t, t.comment().c_str()\n\t\t, t.creator().c_str()\n\t\t, make_magnet_uri(t).c_str()\n\t\t, t.name().c_str()\n\t\t, t.num_files());\n\tint index = 0;\n\tfor (torrent_info::file_iterator i = t.begin_files();\n\t\ti != t.end_files(); ++i, ++index)\n\t{\n\t\tint first = t.map_file(index, 0, 0).piece;\n\t\tint last = t.map_file(index, (std::max)(size_type(i->size)-1, size_type(0)), 0).piece;\n\t\tprintf(\" %8\"PRIx64\" %11\"PRId64\" %c%c%c%c [ %5d, %5d ] %7u %s %s %s%s\\n\"\n\t\t\t, i->offset\n\t\t\t, i->size\n\t\t\t, (i->pad_file?'p':'-')\n\t\t\t, (i->executable_attribute?'x':'-')\n\t\t\t, (i->hidden_attribute?'h':'-')\n\t\t\t, (i->symlink_attribute?'l':'-')\n\t\t\t, first, last\n\t\t\t, boost::uint32_t(t.files().mtime(*i))\n\t\t\t, t.files().hash(*i) != sha1_hash(0) ? to_hex(t.files().hash(*i).to_string()).c_str() : \"\"\n\t\t\t, t.files().file_path(*i).c_str()\n\t\t\t, i->symlink_attribute ? \"-> \": \"\"\n\t\t\t, i->symlink_attribute && i->symlink_index != -1 ? t.files().symlink(*i).c_str() : \"\");\n\t}\n\n\treturn 0;\n}\n\n<commit_msg>make dump_torrent build without deprecated functions<commit_after>\/*\n\nCopyright (c) 2003, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n    * Redistributions of source code must retain the above copyright\n      notice, this list of conditions and the following disclaimer.\n    * Redistributions in binary form must reproduce the above copyright\n      notice, this list of conditions and the following disclaimer in\n      the documentation and\/or other materials provided with the distribution.\n    * Neither the name of the author nor the names of its\n      contributors may be used to endorse or promote products derived\n      from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/entry.hpp\"\n#include \"libtorrent\/bencode.hpp\"\n#include \"libtorrent\/torrent_info.hpp\"\n#include \"libtorrent\/lazy_entry.hpp\"\n#include \"libtorrent\/magnet_uri.hpp\"\n\nint load_file(std::string const& filename, std::vector<char>& v, libtorrent::error_code& ec, int limit = 8000000)\n{\n\tec.clear();\n\tFILE* f = fopen(filename.c_str(), \"rb\");\n\tif (f == NULL)\n\t{\n\t\tec.assign(errno, boost::system::get_generic_category());\n\t\treturn -1;\n\t}\n\n\tint r = fseek(f, 0, SEEK_END);\n\tif (r != 0)\n\t{\n\t\tec.assign(errno, boost::system::get_generic_category());\n\t\tfclose(f);\n\t\treturn -1;\n\t}\n\tlong s = ftell(f);\n\tif (s < 0)\n\t{\n\t\tec.assign(errno, boost::system::get_generic_category());\n\t\tfclose(f);\n\t\treturn -1;\n\t}\n\n\tif (s > limit)\n\t{\n\t\tfclose(f);\n\t\treturn -2;\n\t}\n\n\tr = fseek(f, 0, SEEK_SET);\n\tif (r != 0)\n\t{\n\t\tec.assign(errno, boost::system::get_generic_category());\n\t\tfclose(f);\n\t\treturn -1;\n\t}\n\n\tv.resize(s);\n\tif (s == 0)\n\t{\n\t\tfclose(f);\n\t\treturn 0;\n\t}\n\n\tr = fread(&v[0], 1, v.size(), f);\n\tif (r < 0)\n\t{\n\t\tec.assign(errno, boost::system::get_generic_category());\n\t\tfclose(f);\n\t\treturn -1;\n\t}\n\n\tfclose(f);\n\n\tif (r != s) return -3;\n\n\treturn 0;\n}\n\nint line_longer_than(libtorrent::lazy_entry const& e, int limit)\n{\n\tusing namespace libtorrent;\n\n\tint line_len = 0;\n\tswitch (e.type())\n\t{\n\tcase lazy_entry::list_t:\n\t\tline_len += 4;\n\t\tif (line_len > limit) return -1;\n\t\tfor (int i = 0; i < e.list_size(); ++i)\n\t\t{\n\t\t\tint ret = line_longer_than(*e.list_at(i), limit - line_len);\n\t\t\tif (ret == -1) return -1;\n\t\t\tline_len += ret + 2;\n\t\t}\n\t\tbreak;\n\tcase lazy_entry::dict_t:\n\t\tline_len += 4;\n\t\tif (line_len > limit) return -1;\n\t\tfor (int i = 0; i < e.dict_size(); ++i)\n\t\t{\n\t\t\tline_len += 4 + e.dict_at(i).first.size();\n\t\t\tif (line_len > limit) return -1;\n\t\t\tint ret = line_longer_than(*e.dict_at(i).second, limit - line_len);\n\t\t\tif (ret == -1) return -1;\n\t\t\tline_len += ret + 1;\n\t\t}\n\t\tbreak;\n\tcase lazy_entry::string_t:\n\t\tline_len += 3 + e.string_length();\n\t\tbreak;\n\tcase lazy_entry::int_t:\n\t{\n\t\tsize_type val = e.int_value();\n\t\twhile (val > 0)\n\t\t{\n\t\t\t++line_len;\n\t\t\tval \/= 10;\n\t\t}\n\t\tline_len += 2;\n\t}\n\tbreak;\n\tcase lazy_entry::none_t:\n\t\tline_len += 4;\n\t\tbreak;\n\t}\n\n\tif (line_len > limit) return -1;\n\treturn line_len;\n}\n\nstd::string print_entry(libtorrent::lazy_entry const& e, bool single_line = false, int indent = 0)\n{\n\tusing namespace libtorrent;\n\n\tchar indent_str[200];\n\tmemset(indent_str, ' ', 200);\n\tindent_str[0] = ',';\n\tindent_str[1] = '\\n';\n\tindent_str[199] = 0;\n\tif (indent < 197 && indent >= 0) indent_str[indent+2] = 0;\n\tstd::string ret;\n\tswitch (e.type())\n\t{\n\t\tcase lazy_entry::none_t: return \"none\";\n\t\tcase lazy_entry::int_t:\n\t\t{\n\t\t\tchar str[100];\n\t\t\tsnprintf(str, sizeof(str), \"%\"PRId64, e.int_value());\n\t\t\treturn str;\n\t\t}\n\t\tcase lazy_entry::string_t:\n\t\t{\n\t\t\tbool printable = true;\n\t\t\tchar const* str = e.string_ptr();\n\t\t\tfor (int i = 0; i < e.string_length(); ++i)\n\t\t\t{\n\t\t\t\tusing namespace std;\n\t\t\t\tif (is_print((unsigned char)str[i])) continue;\n\t\t\t\tprintable = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tret += \"'\";\n\t\t\tif (printable)\n\t\t\t{\n\t\t\t\tret += e.string_value();\n\t\t\t\tret += \"'\";\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t\tfor (int i = 0; i < e.string_length(); ++i)\n\t\t\t{\n\t\t\t\tchar tmp[5];\n\t\t\t\tsnprintf(tmp, sizeof(tmp), \"%02x\", (unsigned char)str[i]);\n\t\t\t\tret += tmp;\n\t\t\t}\n\t\t\tret += \"'\";\n\t\t\treturn ret;\n\t\t}\n\t\tcase lazy_entry::list_t:\n\t\t{\n\t\t\tret += '[';\n\t\t\tbool one_liner = line_longer_than(e, 200) != -1 || single_line;\n\n\t\t\tif (!one_liner) ret += indent_str + 1;\n\t\t\tfor (int i = 0; i < e.list_size(); ++i)\n\t\t\t{\n\t\t\t\tif (i == 0 && one_liner) ret += \" \";\n\t\t\t\tret += ::print_entry(*e.list_at(i), single_line, indent + 2);\n\t\t\t\tif (i < e.list_size() - 1) ret += (one_liner?\", \":indent_str);\n\t\t\t\telse ret += (one_liner?\" \":indent_str+1);\n\t\t\t}\n\t\t\tret += \"]\";\n\t\t\treturn ret;\n\t\t}\n\t\tcase lazy_entry::dict_t:\n\t\t{\n\t\t\tret += \"{\";\n\t\t\tbool one_liner = line_longer_than(e, 200) != -1 || single_line;\n\n\t\t\tif (!one_liner) ret += indent_str+1;\n\t\t\tfor (int i = 0; i < e.dict_size(); ++i)\n\t\t\t{\n\t\t\t\tif (i == 0 && one_liner) ret += \" \";\n\t\t\t\tstd::pair<std::string, lazy_entry const*> ent = e.dict_at(i);\n\t\t\t\tret += \"'\";\n\t\t\t\tret += ent.first;\n\t\t\t\tret += \"': \";\n\t\t\t\tret += ::print_entry(*ent.second, single_line, indent + 2);\n\t\t\t\tif (i < e.dict_size() - 1) ret += (one_liner?\", \":indent_str);\n\t\t\t\telse ret += (one_liner?\" \":indent_str+1);\n\t\t\t}\n\t\t\tret += \"}\";\n\t\t\treturn ret;\n\t\t}\n\t}\n\treturn ret;\n}\n\nint main(int argc, char* argv[])\n{\n\tusing namespace libtorrent;\n\n\tif (argc < 2 || argc > 4)\n\t{\n\t\tfputs(\"usage: dump_torrent torrent-file [total-items-limit] [recursion-limit]\\n\", stderr);\n\t\treturn 1;\n\t}\n\n\tint item_limit = 1000000;\n\tint depth_limit = 1000;\n\n\tif (argc > 2) item_limit = atoi(argv[2]);\n\tif (argc > 3) depth_limit = atoi(argv[3]);\n\n\tint size = file_size(argv[1]);\n\tif (size > 40 * 1000000)\n\t{\n\t\tfprintf(stderr, \"file too big (%d), aborting\\n\", size);\n\t\treturn 1;\n\t}\n\tstd::vector<char> buf(size);\n\terror_code ec;\n\tint ret = load_file(argv[1], buf, ec, 40 * 1000000);\n\tif (ret != 0)\n\t{\n\t\tfprintf(stderr, \"failed to load file: %s\\n\", ec.message().c_str());\n\t\treturn 1;\n\t}\n\tlazy_entry e;\n\tint pos;\n\tprintf(\"decoding. recursion limit: %d total item count limit: %d\\n\"\n\t\t, depth_limit, item_limit);\n\tret = lazy_bdecode(&buf[0], &buf[0] + buf.size(), e, ec, &pos\n\t\t, depth_limit, item_limit);\n\n\tprintf(\"\\n\\n----- raw info -----\\n\\n%s\\n\", ::print_entry(e).c_str());\n\n\tif (ret != 0)\n\t{\n\t\tfprintf(stderr, \"failed to decode: '%s' at character: %d\\n\", ec.message().c_str(), pos);\n\t\treturn 1;\n\t}\n\n\ttorrent_info t(e, ec);\n\tif (ec)\n\t{\n\t\tfprintf(stderr, \"%s\\n\", ec.message().c_str());\n\t\treturn 1;\n\t}\n\te.clear();\n\tstd::vector<char>().swap(buf);\n\n\t\/\/ print info about torrent\n\tprintf(\"\\n\\n----- torrent file info -----\\n\\n\"\n\t\t\"nodes:\\n\");\n\n\ttypedef std::vector<std::pair<std::string, int> > node_vec;\n\tnode_vec const& nodes = t.nodes();\n\tfor (node_vec::const_iterator i = nodes.begin(), end(nodes.end());\n\t\ti != end; ++i)\n\t{\n\t\tprintf(\"%s: %d\\n\", i->first.c_str(), i->second);\n\t}\n\tputs(\"trackers:\\n\");\n\tfor (std::vector<announce_entry>::const_iterator i = t.trackers().begin();\n\t\ti != t.trackers().end(); ++i)\n\t{\n\t\tprintf(\"%2d: %s\\n\", i->tier, i->url.c_str());\n\t}\n\n\tchar ih[41];\n\tto_hex((char const*)&t.info_hash()[0], 20, ih);\n\tprintf(\"number of pieces: %d\\n\"\n\t\t\"piece length: %d\\n\"\n\t\t\"info hash: %s\\n\"\n\t\t\"comment: %s\\n\"\n\t\t\"created by: %s\\n\"\n\t\t\"magnet link: %s\\n\"\n\t\t\"name: %s\\n\"\n\t\t\"number of files: %d\\n\"\n\t\t\"files:\\n\"\n\t\t, t.num_pieces()\n\t\t, t.piece_length()\n\t\t, ih\n\t\t, t.comment().c_str()\n\t\t, t.creator().c_str()\n\t\t, make_magnet_uri(t).c_str()\n\t\t, t.name().c_str()\n\t\t, t.num_files());\n\tfile_storage const& st = t.files();\n\tfor (int i = 0; i < st.num_files(); ++i)\n\t{\n\t\tint first = st.map_file(i, 0, 0).piece;\n\t\tint last = st.map_file(i, (std::max)(size_type(st.file_size(i))-1, size_type(0)), 0).piece;\n\t\tint flags = st.file_flags(i);\n\t\tprintf(\" %8\" PRIx64 \" %11\" PRId64 \" %c%c%c%c [ %5d, %5d ] %7u %s %s %s%s\\n\"\n\t\t\t, st.file_offset(i)\n\t\t\t, st.file_size(i)\n\t\t\t, ((flags & file_storage::flag_pad_file)?'p':'-')\n\t\t\t, ((flags & file_storage::flag_executable)?'x':'-')\n\t\t\t, ((flags & file_storage::flag_hidden)?'h':'-')\n\t\t\t, ((flags & file_storage::flag_symlink)?'l':'-')\n\t\t\t, first, last\n\t\t\t, boost::uint32_t(st.mtime(i))\n\t\t\t, st.hash(i) != sha1_hash(0) ? to_hex(st.hash(i).to_string()).c_str() : \"\"\n\t\t\t, st.file_path(i).c_str()\n\t\t\t, (flags & file_storage::flag_symlink) ? \"-> \" : \"\"\n\t\t\t, (flags & file_storage::flag_symlink) ? st.symlink(i).c_str() : \"\");\n\t}\n\n\treturn 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"gtest\/gtest.h\"\n\n#include \"DiceRoll\/Operations\/RollResult.h\"\n#include \"DiceRoll\/Operations\/RepeatOperation.h\"\n\nclass MockOperation : public IOperation\n{\n    std::unique_ptr<RollResult> execute()\n\t{ return std::make_unique<RollResult>(); }\n\npublic:\n    static int count;\n\n    MockOperation(): IOperation(nullptr){};\n\n    \/\/ For each evaluate() static int count is incrementing.\n    std::unique_ptr<RollResult> evaluate()\n\t{\n\t    auto result = std::make_unique<RollResult>();\n\t    result->setOperationLog(std::to_string(++count));\n\t    result->setLastResult(count);\n\t    return result;\n\t}\n};\nint MockOperation::count = 0;\n\nTEST(RepeatOperationTest, EvaluateWithPositiveCount)\n{\n    MockOperation baseOp;\n    RepeatOperation repeatOp(&baseOp , 3);\n    repeatOp.evaluate();\n\n    FAIL() << \"Not implemented\";\n}\n<commit_msg>Implemented test for evaluating with positive number of operations.<commit_after>#include \"gtest\/gtest.h\"\n\n#include \"DiceRoll\/Operations\/RollResult.h\"\n#include \"DiceRoll\/Operations\/RepeatOperation.h\"\n\nclass MockOperation : public IOperation\n{\n    std::unique_ptr<RollResult> execute()\n\t{ return std::make_unique<RollResult>(); }\n\npublic:\n    static int count;\n\n    MockOperation(): IOperation(nullptr){};\n\n    \/\/ For each evaluate() static int count is incrementing.\n    std::unique_ptr<RollResult> evaluate()\n\t{\n\t    auto result = std::make_unique<RollResult>();\n\t    result->setOperationLog(std::to_string(++count));\n\t    result->setLastResult(count);\n\t    return result;\n\t}\n};\nint MockOperation::count = 0;\n\nTEST(RepeatOperationTest, EvaluateWithPositiveCount)\n{\n    MockOperation::count = 0;\n    MockOperation baseOp;\n    RepeatOperation repeatOp(&baseOp , 3);\n    \n    auto result = repeatOp.evaluate();\n    EXPECT_EQ(\"(1 2 3)\", result->getOperationLog());\n    \n    std::vector<int> expectedLastResult{1, 2, 3};\n    EXPECT_EQ(expectedLastResult, result->getLastResult());\n    EXPECT_FALSE(result->hasErrors());\n}\n\n\/\/TODO: Add test that makes sure that RepeatOperation won't work on\n\/\/      multiple value operation, just singular value.\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  AKSoundpipeKernel.hpp\n\/\/  AudioKit\n\/\/\n\/\/  Created by Aurelius Prochazka, revision history on GitHub.\n\/\/  Copyright © 2018 AudioKit. All rights reserved.\n\/\/\n\n#ifdef __cplusplus\n#pragma once\n\nextern \"C\" {\n#include \"soundpipe.h\"\n}\n\n#import \"AKDSPKernel.hpp\"\n\nclass AKSoundpipeKernel: public AKDSPKernel {\nprotected:\n    sp_data *sp = nullptr;\npublic:\n    \/\/    AKSoundpipeKernel(int channelCount, float sampleRate):\n    \/\/        AKDSPKernel(channelCount, sampleRate) {\n    \/\/\n    \/\/      sp_create(&sp);\n    \/\/      sp->sr = sampleRate;\n    \/\/      sp->nchan = channelCount;\n    \/\/    }\n\n    sp_data *getSpData() { return sp; }\n    \n    void init(int channelCount, double sampleRate) override {\n        AKDSPKernel::init(channelCount, sampleRate);\n        sp_create(&sp);\n        sp->sr = sampleRate;\n        sp->nchan = channelCount;\n    }\n\n    ~AKSoundpipeKernel() {\n        \/\/printf(\"~AKSoundpipeKernel(), &sp is %p\\n\", (void *)sp);\n        \/\/ releasing the memory in the destructor only\n        sp_destroy(&sp);\n    }\n\n    void destroy() {\n        \/\/printf(\"AKSoundpipeKernel.destroy(), &sp is %p\\n\", (void *)sp);\n    }\n};\n\n#endif\n\n<commit_msg>Add RAII to DSP Kernel<commit_after>\/\/\n\/\/  AKSoundpipeKernel.hpp\n\/\/  AudioKit\n\/\/\n\/\/  Created by Aurelius Prochazka, revision history on GitHub.\n\/\/  Copyright © 2018 AudioKit. All rights reserved.\n\/\/\n\n#ifdef __cplusplus\n#pragma once\n\nextern \"C\" {\n#include \"soundpipe.h\"\n}\n\n#import \"AKDSPKernel.hpp\"\n\nclass AKSoundpipeKernel: public AKDSPKernel {\nprotected:\n    sp_data *sp = nullptr;\npublic:\n    \/\/    AKSoundpipeKernel(int channelCount, float sampleRate):\n    \/\/        AKDSPKernel(channelCount, sampleRate) {\n    \/\/\n    \/\/      sp_create(&sp);\n    \/\/      sp->sr = sampleRate;\n    \/\/      sp->nchan = channelCount;\n    \/\/    }\n\n    sp_data *getSpData() { return sp; }\n\n    \/\/ The default constructor should be deleted,\n    \/\/ but we're keeping it to not break the API\n    AKSoundpipeKernel() = default;\n\n    AKSoundpipeKernel(int channelCount, double sampleRate) :\n        AKDSPKernel(channelCount, sampleRate) {\n        sp_create(&sp);\n        sp->sr = sampleRate;\n        sp->nchan = channelCount;\n    }\n    \n    void init(int channelCount, double sampleRate) override {\n        AKDSPKernel::init(channelCount, sampleRate);\n        if (sp == nullptr) {\n            sp_create(&sp);\n        }\n        sp->sr = sampleRate;\n        sp->nchan = channelCount;\n    }\n\n    ~AKSoundpipeKernel() {\n        \/\/printf(\"~AKSoundpipeKernel(), &sp is %p\\n\", (void *)sp);\n        \/\/ releasing the memory in the destructor only\n        sp_destroy(&sp);\n    }\n\n    void destroy() {\n        \/\/printf(\"AKSoundpipeKernel.destroy(), &sp is %p\\n\", (void *)sp);\n    }\n};\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/============================================================================\n\/\/ vSMC\/include\/vsmc\/core\/state_matrix.hpp\n\/\/----------------------------------------------------------------------------\n\/\/                         vSMC: Scalable Monte Carlo\n\/\/----------------------------------------------------------------------------\n\/\/ Copyright (c) 2013,2014, Yan Zhou\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/\n\/\/   Redistributions of source code must retain the above copyright notice,\n\/\/   this list of conditions and the following disclaimer.\n\/\/\n\/\/   Redistributions in binary form must reproduce the above copyright notice,\n\/\/   this list of conditions and the following disclaimer in the documentation\n\/\/   and\/or other materials provided with the distribution.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS AS IS\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n\/\/============================================================================\n\n#ifndef VSMC_CORE_STATE_MATRIX_HPP\n#define VSMC_CORE_STATE_MATRIX_HPP\n\n#include <vsmc\/internal\/common.hpp>\n#include <vsmc\/core\/single_particle.hpp>\n#include <vsmc\/utility\/aligned_memory.hpp>\n\n#define VSMC_STATIC_ASSERT_CORE_STATE_MATRIX_DYNAMIC_DIM_RESIZE(Dim) \\\n    VSMC_STATIC_ASSERT((Dim == Dynamic),                                     \\\n            USE_METHOD_resize_dim_WITH_A_FIXED_SIZE_StateMatrix_OBJECT)\n\n#define VSMC_RUNTIME_ASSERT_CORE_STATE_MATRIX_COPY_SIZE_MISMATCH \\\n    VSMC_RUNTIME_ASSERT((N == static_cast<size_type>(this->size())),         \\\n            (\"**StateMatrix::copy** SIZE MISMATCH\"))\n\n#define VSMC_RUNTIME_ASSERT_CORE_STATE_MATRIX_DIM_SIZE(dim) \\\n    VSMC_RUNTIME_ASSERT((dim >= 1),                                          \\\n            (\"**StateMatrix** DIMENSION IS LESS THAN 1\"))\n\n#define VSMC_RUNTIME_ASSERT_CORE_STATE_MATRIX_UNPACK_SIZE(psize, dim, name) \\\n    VSMC_RUNTIME_ASSERT((psize >= dim),                                      \\\n            (\"**State\"#name\"::state_unpack** INPUT PACK SIZE TOO SMALL\"))\n\nnamespace vsmc {\n\n\/\/\/ \\brief Base type of StateTuple\n\/\/\/ \\ingroup Core\ntemplate <MatrixOrder Order, std::size_t Dim, typename T>\nclass StateMatrixBase : public traits::DimTrait<Dim>\n{\n    public :\n\n    typedef std::size_t size_type;\n    typedef std::vector<T> state_pack_type;\n    typedef T state_type;\n\n    template <typename S>\n    struct single_particle_type : public SingleParticleBase<S>\n    {\n        single_particle_type (typename Particle<S>::size_type id,\n                Particle<S> *particle_ptr) :\n            SingleParticleBase<S>(id, particle_ptr) {}\n\n        std::size_t dim () const {return this->particle_ptr()->value().dim();}\n\n        state_type &state (std::size_t pos) const\n        {return this->mutable_particle_ptr()->value().state(this->id(), pos);}\n\n        template <std::size_t Pos>\n        state_type &state (Position<Pos>) const\n        {return this->state(Pos);}\n\n        template <std::size_t Pos>\n        state_type &state () const\n        {return this->state(Pos);}\n    }; \/\/ struct single_particle_type\n\n    template <typename S>\n    struct const_single_particle_type : public ConstSingleParticleBase<S>\n    {\n        const_single_particle_type (typename Particle<S>::size_type id,\n                const Particle<S> *particle_ptr) :\n            ConstSingleParticleBase<S>(id, particle_ptr) {}\n\n        std::size_t dim () const {return this->particle_ptr()->value().dim();}\n\n        const state_type &state (std::size_t pos) const\n        {return this->particle_ptr()->value().state(this->id(), pos);}\n\n        template <std::size_t Pos>\n        const state_type &state (Position<Pos>) const\n        {return this->state(Pos);}\n\n        template <std::size_t Pos>\n        const state_type &state () const\n        {return this->state(Pos);}\n    }; \/\/ struct const_single_particle_type\n\n    void resize_dim (std::size_t dim)\n    {\n        VSMC_STATIC_ASSERT_CORE_STATE_MATRIX_DYNAMIC_DIM_RESIZE(Dim);\n        VSMC_RUNTIME_ASSERT_CORE_STATE_MATRIX_DIM_SIZE(dim);\n\n        traits::DimTrait<Dim>::resize_dim(dim);\n        data_.resize(size_ * dim);\n    }\n\n    size_type size () const {return size_;}\n\n    state_type &operator() (std::size_t i, std::size_t pos)\n    {\n        return static_cast<StateMatrix<Order, Dim, T> *>(this)->\n            state(i, pos);\n    }\n\n    const state_type &operator() (std::size_t i, std::size_t pos) const\n    {\n        return static_cast<const StateMatrix<Order, Dim, T> *>(this)->\n            state(i, pos);\n    }\n\n    T *data () {return &data_[0];}\n\n    const T *data () const {return &data_[0];}\n\n    state_pack_type state_pack (size_type id) const\n    {\n        const StateMatrix<Order, Dim, T> *sptr =\n            static_cast<const StateMatrix<Order, Dim, T> *>(this);\n        state_pack_type pack(this->dim());\n        for (std::size_t d = 0; d != this->dim(); ++d)\n            pack[d] = sptr->state(id, d);\n\n        return pack;\n    }\n\n    void state_unpack (size_type id, const state_pack_type &pack)\n    {\n        VSMC_RUNTIME_ASSERT_CORE_STATE_MATRIX_UNPACK_SIZE(\n                pack.size(), this->dim(), Matrix);\n\n        StateMatrix<Order, Dim, T> *sptr =\n            static_cast<StateMatrix<Order, Dim, T> *>(this);\n        for (std::size_t d = 0; d != this->dim(); ++d)\n            sptr->state(id, d) = pack[d];\n    }\n\n#if VSMC_HAS_CXX11_RVALUE_REFERENCES\n    void state_unpack (size_type id, state_pack_type &&pack)\n    {\n        VSMC_RUNTIME_ASSERT_CORE_STATE_MATRIX_UNPACK_SIZE(\n                pack.size(), this->dim(), Matrix);\n\n        StateMatrix<Order, Dim, T> *sptr =\n            static_cast<StateMatrix<Order, Dim, T> *>(this);\n        for (std::size_t d = 0; d != this->dim(); ++d)\n            sptr->state(id, d) = cxx11::move(pack[d]);\n    }\n#endif\n\n    template <typename IntType>\n    void copy (size_type N, const IntType *copy_from)\n    {\n        VSMC_RUNTIME_ASSERT_CORE_STATE_MATRIX_COPY_SIZE_MISMATCH;\n\n        for (size_type to = 0; to != N; ++to)\n            copy_particle(copy_from[to], to);\n    }\n\n    template <typename OutputIter>\n    OutputIter read_state (std::size_t pos, OutputIter first) const\n    {\n        const StateMatrix<Order, Dim, T> *sptr =\n            static_cast<const StateMatrix<Order, Dim, T> *>(this);\n        for (size_type i = 0; i != size_; ++i, ++first)\n                *first = sptr->state(i, pos);\n\n        return first;\n    }\n\n    template <std::size_t Pos, typename OutputIter>\n    OutputIter read_state (Position<Pos>, OutputIter first) const\n    {return read_state(Pos, first);}\n\n    template <std::size_t Pos, typename OutputIter>\n    OutputIter read_state (OutputIter first) const\n    {return read_state(Pos, first);}\n\n    template <typename OutputIterIter>\n    void read_state_matrix (OutputIterIter first) const\n    {\n        for (std::size_t d = 0; d != this->dim(); ++d, ++first)\n            read_state(d, *first);\n    }\n\n    template <MatrixOrder ROrder, typename OutputIter>\n    OutputIter read_state_matrix (OutputIter first) const\n    {\n        if (ROrder == Order) {\n            first = std::copy(data_.begin(), data_.end(), first);\n        } else {\n            const StateMatrix<Order, Dim, T> *sptr =\n                static_cast<const StateMatrix<Order, Dim, T> *>(this);\n            if (ROrder == RowMajor) {\n                for (size_type i = 0; i != size_; ++i) {\n                    for (std::size_t d = 0; d != this->dim(); ++d) {\n                        *first = sptr->state(i, d);\n                        ++first;\n                    }\n                }\n            } else if (ROrder == ColMajor) {\n                for (std::size_t d = 0; d != this->dim(); ++d) {\n                    for (size_type i = 0; i != size_; ++i) {\n                        *first = sptr->state(i, d);\n                        ++first;\n                    }\n                }\n            }\n        }\n\n        return first;\n    }\n\n    template <typename CharT, typename Traits>\n    std::basic_ostream<CharT, Traits> &print (\n            std::basic_ostream<CharT, Traits> &os, std::size_t iter = 0,\n            char sepchar = ' ', char eolchar = '\\n') const\n    {\n        const StateMatrix<Order, Dim, T> *sptr =\n            static_cast<const StateMatrix<Order, Dim, T> *>(this);\n        for (size_type i = 0; i != size_; ++i) {\n            os << iter << sepchar;\n            for (std::size_t d = 0; d != this->dim() - 1; ++d)\n                os << sptr->state(i, d) << sepchar;\n            os << sptr->state(i, this->dim() - 1) << eolchar;\n        }\n\n        return os;\n    }\n\n    template <typename CharT, typename Traits>\n    friend inline std::basic_ostream<CharT, Traits> &operator<< (\n            std::basic_ostream<CharT, Traits> &os,\n            const StateMatrixBase<Order, Dim, T> &smatrix)\n    {\n        if (os.good())\n            smatrix.print(os);\n\n        return os;\n    }\n\n    protected :\n\n    explicit StateMatrixBase (size_type N) : size_(N), data_(N * Dim) {}\n\n    void copy_particle (size_type from, size_type to)\n    {\n        copy_particle_dispatch(from, to, cxx11::integral_constant<bool,\n                (Dim * sizeof(T) >= 64 || Dim == Dynamic) &&\n                Order == RowMajor>());\n    }\n\n    private :\n\n    size_type size_;\n    typename cxx11::conditional<cxx11::is_arithmetic<T>::value,\n             std::vector<T, AlignedAllocator<T> >,\n             std::vector<T> >::type data_;\n\n\n    void copy_particle_dispatch (size_type from, size_type to,\n            cxx11::true_type)\n    {\n        if (from == to)\n            return;\n\n        StateMatrix<Order, Dim, T> *sptr =\n            static_cast<StateMatrix<Order, Dim, T> *>(this);\n        T *to_ptr = &sptr->state(to, 0);\n        T *from_ptr = &sptr->state(from, 0);\n        std::copy(to_ptr, to_ptr + this->dim(), from_ptr);\n    }\n\n    void copy_particle_dispatch (size_type from, size_type to,\n            cxx11::false_type)\n    {\n        if (from == to)\n            return;\n\n        StateMatrix<Order, Dim, T> *sptr =\n            static_cast<StateMatrix<Order, Dim, T> *>(this);\n        for (std::size_t d = 0; d != this->dim(); ++d)\n            sptr->state(to, d) = sptr->state(from, d);\n    }\n}; \/\/ class StateMatrixBase\n\n\/\/\/ \\brief Particle::value_type subtype\n\/\/\/ \\ingroup Core\ntemplate <std::size_t Dim, typename T>\nclass StateMatrix<RowMajor, Dim, T> : public StateMatrixBase<RowMajor, Dim, T>\n{\n    public :\n\n    typedef StateMatrixBase<RowMajor, Dim, T> state_matrix_base_type;\n    typedef typename state_matrix_base_type::size_type size_type;\n\n    explicit StateMatrix (size_type N) : state_matrix_base_type(N) {}\n\n    T &state (size_type id, std::size_t pos)\n    {return this->data()[id * this->dim() + pos];}\n\n    const T &state (size_type id, std::size_t pos) const\n    {return this->data()[id * this->dim() + pos];}\n\n    template <std::size_t Pos>\n    T &state (size_type id, Position<Pos>)\n    {return state(id, Pos);}\n\n    template <std::size_t Pos>\n    const T &state (size_type id, Position<Pos>) const\n    {return state(id, Pos);}\n\n    template <std::size_t Pos>\n    T &state (size_type id)\n    {return state(id, Pos);}\n\n    template <std::size_t Pos>\n    const T &state (size_type id) const\n    {return state(id, Pos);}\n\n    T *row_data (size_type id)\n    {return this->data() + id * this->dim();}\n\n    const T *row_data (size_type id) const\n    {return this->data() + id * this->dim();}\n}; \/\/ class StateMatrix\n\n\/\/\/ \\brief Particle::value_type subtype\n\/\/\/ \\ingroup Core\ntemplate <std::size_t Dim, typename T>\nclass StateMatrix<ColMajor, Dim, T> : public StateMatrixBase<ColMajor, Dim, T>\n{\n    public :\n\n    typedef StateMatrixBase<ColMajor, Dim, T> state_matrix_base_type;\n    typedef typename state_matrix_base_type::size_type size_type;\n\n    explicit StateMatrix (size_type N) : state_matrix_base_type(N) {}\n\n    T &state (size_type id, std::size_t pos)\n    {return this->data()[pos * this->size() + id];}\n\n    const T &state (size_type id, std::size_t pos) const\n    {return this->data()[pos * this->size() + id];}\n\n    template <std::size_t Pos>\n    T &state (size_type id, Position<Pos>)\n    {return state(id, Pos);}\n\n    template <std::size_t Pos>\n    const T &state (size_type id, Position<Pos>) const\n    {return state(id, Pos);}\n\n    template <std::size_t Pos>\n    T &state (size_type id)\n    {return state(id, Pos);}\n\n    template <std::size_t Pos>\n    const T &state (size_type id) const\n    {return state(id, Pos);}\n\n    T *col_data (std::size_t pos)\n    {return this->data() + pos * this->size();}\n\n    const T *col_data (std::size_t pos) const\n    {return this->data() + pos * this->size();}\n}; \/\/ class StateMatrix\n\n} \/\/ namespace vsmc\n\n#endif \/\/ VSMC_CORE_STATE_MATRIX_HPP\n<commit_msg>fix copy in StateMatrix<commit_after>\/\/============================================================================\n\/\/ vSMC\/include\/vsmc\/core\/state_matrix.hpp\n\/\/----------------------------------------------------------------------------\n\/\/                         vSMC: Scalable Monte Carlo\n\/\/----------------------------------------------------------------------------\n\/\/ Copyright (c) 2013,2014, Yan Zhou\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/\n\/\/   Redistributions of source code must retain the above copyright notice,\n\/\/   this list of conditions and the following disclaimer.\n\/\/\n\/\/   Redistributions in binary form must reproduce the above copyright notice,\n\/\/   this list of conditions and the following disclaimer in the documentation\n\/\/   and\/or other materials provided with the distribution.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS AS IS\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n\/\/============================================================================\n\n#ifndef VSMC_CORE_STATE_MATRIX_HPP\n#define VSMC_CORE_STATE_MATRIX_HPP\n\n#include <vsmc\/internal\/common.hpp>\n#include <vsmc\/core\/single_particle.hpp>\n#include <vsmc\/utility\/aligned_memory.hpp>\n\n#define VSMC_STATIC_ASSERT_CORE_STATE_MATRIX_DYNAMIC_DIM_RESIZE(Dim) \\\n    VSMC_STATIC_ASSERT((Dim == Dynamic),                                     \\\n            USE_METHOD_resize_dim_WITH_A_FIXED_SIZE_StateMatrix_OBJECT)\n\n#define VSMC_RUNTIME_ASSERT_CORE_STATE_MATRIX_COPY_SIZE_MISMATCH \\\n    VSMC_RUNTIME_ASSERT((N == static_cast<size_type>(this->size())),         \\\n            (\"**StateMatrix::copy** SIZE MISMATCH\"))\n\n#define VSMC_RUNTIME_ASSERT_CORE_STATE_MATRIX_DIM_SIZE(dim) \\\n    VSMC_RUNTIME_ASSERT((dim >= 1),                                          \\\n            (\"**StateMatrix** DIMENSION IS LESS THAN 1\"))\n\n#define VSMC_RUNTIME_ASSERT_CORE_STATE_MATRIX_UNPACK_SIZE(psize, dim, name) \\\n    VSMC_RUNTIME_ASSERT((psize >= dim),                                      \\\n            (\"**State\"#name\"::state_unpack** INPUT PACK SIZE TOO SMALL\"))\n\nnamespace vsmc {\n\n\/\/\/ \\brief Base type of StateTuple\n\/\/\/ \\ingroup Core\ntemplate <MatrixOrder Order, std::size_t Dim, typename T>\nclass StateMatrixBase : public traits::DimTrait<Dim>\n{\n    public :\n\n    typedef std::size_t size_type;\n    typedef std::vector<T> state_pack_type;\n    typedef T state_type;\n\n    template <typename S>\n    struct single_particle_type : public SingleParticleBase<S>\n    {\n        single_particle_type (typename Particle<S>::size_type id,\n                Particle<S> *particle_ptr) :\n            SingleParticleBase<S>(id, particle_ptr) {}\n\n        std::size_t dim () const {return this->particle_ptr()->value().dim();}\n\n        state_type &state (std::size_t pos) const\n        {return this->mutable_particle_ptr()->value().state(this->id(), pos);}\n\n        template <std::size_t Pos>\n        state_type &state (Position<Pos>) const\n        {return this->state(Pos);}\n\n        template <std::size_t Pos>\n        state_type &state () const\n        {return this->state(Pos);}\n    }; \/\/ struct single_particle_type\n\n    template <typename S>\n    struct const_single_particle_type : public ConstSingleParticleBase<S>\n    {\n        const_single_particle_type (typename Particle<S>::size_type id,\n                const Particle<S> *particle_ptr) :\n            ConstSingleParticleBase<S>(id, particle_ptr) {}\n\n        std::size_t dim () const {return this->particle_ptr()->value().dim();}\n\n        const state_type &state (std::size_t pos) const\n        {return this->particle_ptr()->value().state(this->id(), pos);}\n\n        template <std::size_t Pos>\n        const state_type &state (Position<Pos>) const\n        {return this->state(Pos);}\n\n        template <std::size_t Pos>\n        const state_type &state () const\n        {return this->state(Pos);}\n    }; \/\/ struct const_single_particle_type\n\n    void resize_dim (std::size_t dim)\n    {\n        VSMC_STATIC_ASSERT_CORE_STATE_MATRIX_DYNAMIC_DIM_RESIZE(Dim);\n        VSMC_RUNTIME_ASSERT_CORE_STATE_MATRIX_DIM_SIZE(dim);\n\n        traits::DimTrait<Dim>::resize_dim(dim);\n        data_.resize(size_ * dim);\n    }\n\n    size_type size () const {return size_;}\n\n    state_type &operator() (std::size_t i, std::size_t pos)\n    {\n        return static_cast<StateMatrix<Order, Dim, T> *>(this)->\n            state(i, pos);\n    }\n\n    const state_type &operator() (std::size_t i, std::size_t pos) const\n    {\n        return static_cast<const StateMatrix<Order, Dim, T> *>(this)->\n            state(i, pos);\n    }\n\n    T *data () {return &data_[0];}\n\n    const T *data () const {return &data_[0];}\n\n    state_pack_type state_pack (size_type id) const\n    {\n        const StateMatrix<Order, Dim, T> *sptr =\n            static_cast<const StateMatrix<Order, Dim, T> *>(this);\n        state_pack_type pack(this->dim());\n        for (std::size_t d = 0; d != this->dim(); ++d)\n            pack[d] = sptr->state(id, d);\n\n        return pack;\n    }\n\n    void state_unpack (size_type id, const state_pack_type &pack)\n    {\n        VSMC_RUNTIME_ASSERT_CORE_STATE_MATRIX_UNPACK_SIZE(\n                pack.size(), this->dim(), Matrix);\n\n        StateMatrix<Order, Dim, T> *sptr =\n            static_cast<StateMatrix<Order, Dim, T> *>(this);\n        for (std::size_t d = 0; d != this->dim(); ++d)\n            sptr->state(id, d) = pack[d];\n    }\n\n#if VSMC_HAS_CXX11_RVALUE_REFERENCES\n    void state_unpack (size_type id, state_pack_type &&pack)\n    {\n        VSMC_RUNTIME_ASSERT_CORE_STATE_MATRIX_UNPACK_SIZE(\n                pack.size(), this->dim(), Matrix);\n\n        StateMatrix<Order, Dim, T> *sptr =\n            static_cast<StateMatrix<Order, Dim, T> *>(this);\n        for (std::size_t d = 0; d != this->dim(); ++d)\n            sptr->state(id, d) = cxx11::move(pack[d]);\n    }\n#endif\n\n    template <typename IntType>\n    void copy (size_type N, const IntType *copy_from)\n    {\n        VSMC_RUNTIME_ASSERT_CORE_STATE_MATRIX_COPY_SIZE_MISMATCH;\n\n        for (size_type to = 0; to != N; ++to)\n            copy_particle(copy_from[to], to);\n    }\n\n    template <typename OutputIter>\n    OutputIter read_state (std::size_t pos, OutputIter first) const\n    {\n        const StateMatrix<Order, Dim, T> *sptr =\n            static_cast<const StateMatrix<Order, Dim, T> *>(this);\n        for (size_type i = 0; i != size_; ++i, ++first)\n                *first = sptr->state(i, pos);\n\n        return first;\n    }\n\n    template <std::size_t Pos, typename OutputIter>\n    OutputIter read_state (Position<Pos>, OutputIter first) const\n    {return read_state(Pos, first);}\n\n    template <std::size_t Pos, typename OutputIter>\n    OutputIter read_state (OutputIter first) const\n    {return read_state(Pos, first);}\n\n    template <typename OutputIterIter>\n    void read_state_matrix (OutputIterIter first) const\n    {\n        for (std::size_t d = 0; d != this->dim(); ++d, ++first)\n            read_state(d, *first);\n    }\n\n    template <MatrixOrder ROrder, typename OutputIter>\n    OutputIter read_state_matrix (OutputIter first) const\n    {\n        if (ROrder == Order) {\n            first = std::copy(data_.begin(), data_.end(), first);\n        } else {\n            const StateMatrix<Order, Dim, T> *sptr =\n                static_cast<const StateMatrix<Order, Dim, T> *>(this);\n            if (ROrder == RowMajor) {\n                for (size_type i = 0; i != size_; ++i) {\n                    for (std::size_t d = 0; d != this->dim(); ++d) {\n                        *first = sptr->state(i, d);\n                        ++first;\n                    }\n                }\n            } else if (ROrder == ColMajor) {\n                for (std::size_t d = 0; d != this->dim(); ++d) {\n                    for (size_type i = 0; i != size_; ++i) {\n                        *first = sptr->state(i, d);\n                        ++first;\n                    }\n                }\n            }\n        }\n\n        return first;\n    }\n\n    template <typename CharT, typename Traits>\n    std::basic_ostream<CharT, Traits> &print (\n            std::basic_ostream<CharT, Traits> &os, std::size_t iter = 0,\n            char sepchar = ' ', char eolchar = '\\n') const\n    {\n        const StateMatrix<Order, Dim, T> *sptr =\n            static_cast<const StateMatrix<Order, Dim, T> *>(this);\n        for (size_type i = 0; i != size_; ++i) {\n            os << iter << sepchar;\n            for (std::size_t d = 0; d != this->dim() - 1; ++d)\n                os << sptr->state(i, d) << sepchar;\n            os << sptr->state(i, this->dim() - 1) << eolchar;\n        }\n\n        return os;\n    }\n\n    template <typename CharT, typename Traits>\n    friend inline std::basic_ostream<CharT, Traits> &operator<< (\n            std::basic_ostream<CharT, Traits> &os,\n            const StateMatrixBase<Order, Dim, T> &smatrix)\n    {\n        if (os.good())\n            smatrix.print(os);\n\n        return os;\n    }\n\n    protected :\n\n    explicit StateMatrixBase (size_type N) : size_(N), data_(N * Dim) {}\n\n    void copy_particle (size_type from, size_type to)\n    {\n        copy_particle_dispatch(from, to, cxx11::integral_constant<bool,\n                (Dim * sizeof(T) >= 64 || Dim == Dynamic) &&\n                Order == RowMajor>());\n    }\n\n    private :\n\n    size_type size_;\n    typename cxx11::conditional<cxx11::is_arithmetic<T>::value,\n             std::vector<T, AlignedAllocator<T> >,\n             std::vector<T> >::type data_;\n\n\n    void copy_particle_dispatch (size_type from, size_type to,\n            cxx11::true_type)\n    {\n        if (from == to)\n            return;\n\n        StateMatrix<Order, Dim, T> *sptr =\n            static_cast<StateMatrix<Order, Dim, T> *>(this);\n        T *from_ptr = &sptr->state(from, 0);\n        T *to_ptr = &sptr->state(to, 0);\n        std::copy(from_ptr, from_ptr + this->dim(), to_ptr);\n    }\n\n    void copy_particle_dispatch (size_type from, size_type to,\n            cxx11::false_type)\n    {\n        if (from == to)\n            return;\n\n        StateMatrix<Order, Dim, T> *sptr =\n            static_cast<StateMatrix<Order, Dim, T> *>(this);\n        for (std::size_t d = 0; d != this->dim(); ++d)\n            sptr->state(to, d) = sptr->state(from, d);\n    }\n}; \/\/ class StateMatrixBase\n\n\/\/\/ \\brief Particle::value_type subtype\n\/\/\/ \\ingroup Core\ntemplate <std::size_t Dim, typename T>\nclass StateMatrix<RowMajor, Dim, T> : public StateMatrixBase<RowMajor, Dim, T>\n{\n    public :\n\n    typedef StateMatrixBase<RowMajor, Dim, T> state_matrix_base_type;\n    typedef typename state_matrix_base_type::size_type size_type;\n\n    explicit StateMatrix (size_type N) : state_matrix_base_type(N) {}\n\n    T &state (size_type id, std::size_t pos)\n    {return this->data()[id * this->dim() + pos];}\n\n    const T &state (size_type id, std::size_t pos) const\n    {return this->data()[id * this->dim() + pos];}\n\n    template <std::size_t Pos>\n    T &state (size_type id, Position<Pos>)\n    {return state(id, Pos);}\n\n    template <std::size_t Pos>\n    const T &state (size_type id, Position<Pos>) const\n    {return state(id, Pos);}\n\n    template <std::size_t Pos>\n    T &state (size_type id)\n    {return state(id, Pos);}\n\n    template <std::size_t Pos>\n    const T &state (size_type id) const\n    {return state(id, Pos);}\n\n    T *row_data (size_type id)\n    {return this->data() + id * this->dim();}\n\n    const T *row_data (size_type id) const\n    {return this->data() + id * this->dim();}\n}; \/\/ class StateMatrix\n\n\/\/\/ \\brief Particle::value_type subtype\n\/\/\/ \\ingroup Core\ntemplate <std::size_t Dim, typename T>\nclass StateMatrix<ColMajor, Dim, T> : public StateMatrixBase<ColMajor, Dim, T>\n{\n    public :\n\n    typedef StateMatrixBase<ColMajor, Dim, T> state_matrix_base_type;\n    typedef typename state_matrix_base_type::size_type size_type;\n\n    explicit StateMatrix (size_type N) : state_matrix_base_type(N) {}\n\n    T &state (size_type id, std::size_t pos)\n    {return this->data()[pos * this->size() + id];}\n\n    const T &state (size_type id, std::size_t pos) const\n    {return this->data()[pos * this->size() + id];}\n\n    template <std::size_t Pos>\n    T &state (size_type id, Position<Pos>)\n    {return state(id, Pos);}\n\n    template <std::size_t Pos>\n    const T &state (size_type id, Position<Pos>) const\n    {return state(id, Pos);}\n\n    template <std::size_t Pos>\n    T &state (size_type id)\n    {return state(id, Pos);}\n\n    template <std::size_t Pos>\n    const T &state (size_type id) const\n    {return state(id, Pos);}\n\n    T *col_data (std::size_t pos)\n    {return this->data() + pos * this->size();}\n\n    const T *col_data (std::size_t pos) const\n    {return this->data() + pos * this->size();}\n}; \/\/ class StateMatrix\n\n} \/\/ namespace vsmc\n\n#endif \/\/ VSMC_CORE_STATE_MATRIX_HPP\n<|endoftext|>"}
{"text":"<commit_before>\r\n#include \"NNApplication.h\"\r\n#include \"NNInputSystem.h\"\r\n#include \"NNAudioSystem.h\"\r\n#include \"NNResourceManager.h\"\r\n#include \"NNNetworkSystem.h\"\r\n\r\nNNApplication* NNApplication::m_pInstance = nullptr;\r\n\r\nNNApplication::NNApplication()\r\n\t: m_Hwnd(nullptr), m_hInstance(nullptr),\r\n\t  m_ScreenHeight(0), m_ScreenWidth(0),\r\n\t  m_Fps(0.f), m_ElapsedTime(0.f), m_DeltaTime(0.f),m_FpsTimer(0.f),\r\n\t  m_PrevTime(0), m_NowTime(0),\r\n\t  m_Renderer(nullptr), m_pSceneDirector(nullptr),\r\n\t  m_RendererStatus(UNKNOWN),m_DestroyWindow(false)\r\n{\r\n\r\n}\r\nNNApplication::~NNApplication()\r\n{\r\n\r\n}\r\n\r\nNNApplication* NNApplication::GetInstance()\r\n{\r\n\tif ( m_pInstance == nullptr )\r\n\t{\r\n\t\tm_pInstance = new NNApplication();\r\n\t}\r\n\r\n\treturn m_pInstance;\r\n}\r\nvoid NNApplication::ReleaseInstance()\r\n{\r\n\tif ( m_pInstance != nullptr )\r\n\t{\r\n\t\tdelete m_pInstance;\r\n\t\tm_pInstance = nullptr;\r\n\t}\r\n}\r\n\r\nbool NNApplication::Init( wchar_t* title, int width, int height, RendererStatus renderStatus )\r\n{\r\n\tm_hInstance = GetModuleHandle(0);\r\n\r\n\tm_Title = title;\r\n\tm_ScreenWidth = width;\r\n\tm_ScreenHeight = height;\r\n\tm_RendererStatus = renderStatus;\r\n\r\n\t_CreateWindow( m_Title, m_ScreenWidth, m_ScreenHeight );\r\n\t_CreateRenderer( renderStatus );\r\n\t\r\n\tm_pSceneDirector = NNSceneDirector::GetInstance();\r\n\r\n\tm_Renderer->Init();\r\n\tm_pSceneDirector->Init();\r\n\r\n\treturn true;\r\n}\r\n\r\nbool NNApplication::Release()\r\n{\r\n\tif ( m_DestroyWindow == true ) {\r\n\t\tReleaseInstance();\r\n\t\treturn true;\r\n\t}\r\n\tm_pSceneDirector->Release();\r\n\r\n\tNNSceneDirector::ReleaseInstance();\r\n\tNNResourceManager::ReleaseInstance();\r\n\tNNInputSystem::ReleaseInstance();\r\n\tNNAudioSystem::ReleaseInstance();\r\n\tNNNetworkSystem::ReleaseInstance();\r\n\tSafeDelete( m_Renderer );\r\n\tReleaseInstance();\r\n\r\n\treturn true;\r\n}\r\n\r\nbool NNApplication::Run()\r\n{\r\n\tMSG msg;\r\n\tZeroMemory( &msg, sizeof(msg) );\r\n\r\n\twhile (true)\r\n\t{\r\n\t\tif ( PeekMessage( &msg, NULL, 0, 0, PM_REMOVE ) )\r\n\t\t{\r\n\t\t\tif ( msg.message == WM_QUIT )\r\n\t\t\t{\r\n\t\t\t\treturn true;\r\n\t\t\t}\r\n\t\t\tTranslateMessage( &msg );\r\n\t\t\tDispatchMessage( &msg );\r\n\t\t}\r\n\t\telse{\r\n\t\t\tm_FrameCount++;\r\n\t\t\tm_NowTime = timeGetTime();\r\n\t\t\tif ( m_PrevTime == 0.f )\r\n\t\t\t{\r\n\t\t\t\tm_PrevTime = m_NowTime;\r\n\t\t\t}\r\n\t\t\tm_DeltaTime = (static_cast<float>(m_NowTime - m_PrevTime)) \/ 1000.f;\r\n\t\t\tm_ElapsedTime += m_DeltaTime;\r\n\t\t\tm_FpsTimer += m_DeltaTime;\r\n\t\t\tif(m_FpsTimer > 0.1f)\r\n\t\t\t{\r\n\t\t\t\tm_Fps = ((float)m_FrameCount) \/ m_FpsTimer;\r\n\t\t\t\tm_FrameCount = 0;\r\n\t\t\t\tm_FpsTimer = 0.f;\r\n\t\t\t}\r\n\t\t\tm_PrevTime = m_NowTime;\r\n\r\n\t\t\tNNInputSystem::GetInstance()->UpdateKeyState();\r\n\r\n\t\t\tm_pSceneDirector->UpdateScene( m_DeltaTime );\r\n\r\n\t\t\tm_Renderer->Begin();\r\n\t\t\tm_Renderer->Clear();\r\n\t\t\tm_pSceneDirector->RenderScene();\r\n\t\t\tm_Renderer->End();\r\n\r\n\t\t\tif ( NNInputSystem::GetInstance()->GetKeyState( VK_ESCAPE ) == KEY_DOWN )\r\n\t\t\t{\r\n\t\t\t\tPostQuitMessage(0);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\nbool NNApplication::_CreateWindow( wchar_t* title, int width, int height )\r\n{\r\n\tWNDCLASSEX wcex;\r\n\twcex.cbSize = sizeof(WNDCLASSEX);\r\n\twcex.style = CS_HREDRAW | CS_VREDRAW;\r\n\twcex.lpfnWndProc = WndProc;\r\n\twcex.cbClsExtra = NULL;\r\n\twcex.cbWndExtra = NULL;\r\n\twcex.hInstance = m_hInstance;\r\n\twcex.hIcon = NULL;\r\n\twcex.hCursor = LoadCursor(NULL, IDC_ARROW);\r\n\twcex.hbrBackground = (HBRUSH)(COLOR_WINDOW+1);\r\n\twcex.lpszMenuName = NULL;\r\n\twcex.lpszClassName = L\"NNApplication\";\r\n\twcex.hIconSm = NULL;\r\n\twcex.hIcon = NULL;\r\n\r\n\tRegisterClassEx( &wcex );\r\n\r\n\tDWORD style = WS_OVERLAPPEDWINDOW;\r\n\r\n\tRECT wr = {0, 0, width, height};\r\n\tAdjustWindowRect( &wr, WS_OVERLAPPEDWINDOW, FALSE );\r\n\r\n\tm_Hwnd = CreateWindow( L\"NNApplication\", title, style, CW_USEDEFAULT, CW_USEDEFAULT,\r\n\t\twr.right-wr.left, wr.bottom-wr.top, NULL, NULL, m_hInstance, NULL);\r\n\r\n\tShowWindow( m_Hwnd, SW_SHOWNORMAL );\r\n\r\n\treturn true;\r\n}\r\nbool NNApplication::_CreateRenderer( RendererStatus renderStatus )\r\n{\r\n\tswitch( renderStatus )\r\n\t{\r\n\tcase D2D:\r\n\t\tm_Renderer = new NND2DRenderer();\r\n\t\tbreak;\r\n\tdefault:\r\n\t\treturn false;\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\n\r\nLRESULT CALLBACK NNApplication::WndProc( HWND hWnd, UINT message, WPARAM wParam, LPARAM lParam )\r\n{\r\n\tswitch( message )\r\n\t{\r\n\tcase WM_DESTROY:\r\n\t\tNNApplication::GetInstance()->Release();\r\n\t\tNNApplication::GetInstance()->m_DestroyWindow = true;\r\n\t\tPostQuitMessage(0);\r\n\t\treturn 0;\r\n\tcase WM_PAINT:\r\n\t\tPAINTSTRUCT ps;\r\n\t\tHDC hdc = BeginPaint( hWnd, &ps );\r\n\t\tEndPaint( hWnd, &ps );\r\n\t}\r\n\r\n\treturn(DefWindowProc(hWnd,message,wParam,lParam));\r\n}<commit_msg>SleepEx(0, TRUE); 추가<commit_after>\r\n#include \"NNApplication.h\"\r\n#include \"NNInputSystem.h\"\r\n#include \"NNAudioSystem.h\"\r\n#include \"NNResourceManager.h\"\r\n#include \"NNNetworkSystem.h\"\r\n\r\nNNApplication* NNApplication::m_pInstance = nullptr;\r\n\r\nNNApplication::NNApplication()\r\n\t: m_Hwnd(nullptr), m_hInstance(nullptr),\r\n\t  m_ScreenHeight(0), m_ScreenWidth(0),\r\n\t  m_Fps(0.f), m_ElapsedTime(0.f), m_DeltaTime(0.f),m_FpsTimer(0.f),\r\n\t  m_PrevTime(0), m_NowTime(0),\r\n\t  m_Renderer(nullptr), m_pSceneDirector(nullptr),\r\n\t  m_RendererStatus(UNKNOWN),m_DestroyWindow(false)\r\n{\r\n\r\n}\r\nNNApplication::~NNApplication()\r\n{\r\n\r\n}\r\n\r\nNNApplication* NNApplication::GetInstance()\r\n{\r\n\tif ( m_pInstance == nullptr )\r\n\t{\r\n\t\tm_pInstance = new NNApplication();\r\n\t}\r\n\r\n\treturn m_pInstance;\r\n}\r\nvoid NNApplication::ReleaseInstance()\r\n{\r\n\tif ( m_pInstance != nullptr )\r\n\t{\r\n\t\tdelete m_pInstance;\r\n\t\tm_pInstance = nullptr;\r\n\t}\r\n}\r\n\r\nbool NNApplication::Init( wchar_t* title, int width, int height, RendererStatus renderStatus )\r\n{\r\n\tm_hInstance = GetModuleHandle(0);\r\n\r\n\tm_Title = title;\r\n\tm_ScreenWidth = width;\r\n\tm_ScreenHeight = height;\r\n\tm_RendererStatus = renderStatus;\r\n\r\n\t_CreateWindow( m_Title, m_ScreenWidth, m_ScreenHeight );\r\n\t_CreateRenderer( renderStatus );\r\n\t\r\n\tm_pSceneDirector = NNSceneDirector::GetInstance();\r\n\r\n\tm_Renderer->Init();\r\n\tm_pSceneDirector->Init();\r\n\r\n\treturn true;\r\n}\r\n\r\nbool NNApplication::Release()\r\n{\r\n\tif ( m_DestroyWindow == true ) {\r\n\t\tReleaseInstance();\r\n\t\treturn true;\r\n\t}\r\n\tm_pSceneDirector->Release();\r\n\r\n\tNNSceneDirector::ReleaseInstance();\r\n\tNNResourceManager::ReleaseInstance();\r\n\tNNInputSystem::ReleaseInstance();\r\n\tNNAudioSystem::ReleaseInstance();\r\n\tNNNetworkSystem::ReleaseInstance();\r\n\tSafeDelete( m_Renderer );\r\n\tReleaseInstance();\r\n\r\n\treturn true;\r\n}\r\n\r\nbool NNApplication::Run()\r\n{\r\n\tMSG msg;\r\n\tZeroMemory( &msg, sizeof(msg) );\r\n\r\n\twhile (true)\r\n\t{\r\n\t\tif ( PeekMessage( &msg, NULL, 0, 0, PM_REMOVE ) )\r\n\t\t{\r\n\t\t\tif ( msg.message == WM_QUIT )\r\n\t\t\t{\r\n\t\t\t\treturn true;\r\n\t\t\t}\r\n\t\t\tTranslateMessage( &msg );\r\n\t\t\tDispatchMessage( &msg );\r\n\t\t}\r\n\t\telse{\r\n\t\t\t\n\t\t\tSleepEx(0, TRUE);\r\n\t\t\tm_FrameCount++;\r\n\t\t\tm_NowTime = timeGetTime();\r\n\t\t\tif ( m_PrevTime == 0.f )\r\n\t\t\t{\r\n\t\t\t\tm_PrevTime = m_NowTime;\r\n\t\t\t}\r\n\t\t\tm_DeltaTime = (static_cast<float>(m_NowTime - m_PrevTime)) \/ 1000.f;\r\n\t\t\tm_ElapsedTime += m_DeltaTime;\r\n\t\t\tm_FpsTimer += m_DeltaTime;\r\n\t\t\tif(m_FpsTimer > 0.1f)\r\n\t\t\t{\r\n\t\t\t\tm_Fps = ((float)m_FrameCount) \/ m_FpsTimer;\r\n\t\t\t\tm_FrameCount = 0;\r\n\t\t\t\tm_FpsTimer = 0.f;\r\n\t\t\t}\r\n\t\t\tm_PrevTime = m_NowTime;\r\n\r\n\t\t\tNNInputSystem::GetInstance()->UpdateKeyState();\r\n\r\n\t\t\tm_pSceneDirector->UpdateScene( m_DeltaTime );\r\n\r\n\t\t\tm_Renderer->Begin();\r\n\t\t\tm_Renderer->Clear();\r\n\t\t\tm_pSceneDirector->RenderScene();\r\n\t\t\tm_Renderer->End();\r\n\r\n\t\t\tif ( NNInputSystem::GetInstance()->GetKeyState( VK_ESCAPE ) == KEY_DOWN )\r\n\t\t\t{\r\n\t\t\t\tPostQuitMessage(0);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\nbool NNApplication::_CreateWindow( wchar_t* title, int width, int height )\r\n{\r\n\tWNDCLASSEX wcex;\r\n\twcex.cbSize = sizeof(WNDCLASSEX);\r\n\twcex.style = CS_HREDRAW | CS_VREDRAW;\r\n\twcex.lpfnWndProc = WndProc;\r\n\twcex.cbClsExtra = NULL;\r\n\twcex.cbWndExtra = NULL;\r\n\twcex.hInstance = m_hInstance;\r\n\twcex.hIcon = NULL;\r\n\twcex.hCursor = LoadCursor(NULL, IDC_ARROW);\r\n\twcex.hbrBackground = (HBRUSH)(COLOR_WINDOW+1);\r\n\twcex.lpszMenuName = NULL;\r\n\twcex.lpszClassName = L\"NNApplication\";\r\n\twcex.hIconSm = NULL;\r\n\twcex.hIcon = NULL;\r\n\r\n\tRegisterClassEx( &wcex );\r\n\r\n\tDWORD style = WS_OVERLAPPEDWINDOW;\r\n\r\n\tRECT wr = {0, 0, width, height};\r\n\tAdjustWindowRect( &wr, WS_OVERLAPPEDWINDOW, FALSE );\r\n\r\n\tm_Hwnd = CreateWindow( L\"NNApplication\", title, style, CW_USEDEFAULT, CW_USEDEFAULT,\r\n\t\twr.right-wr.left, wr.bottom-wr.top, NULL, NULL, m_hInstance, NULL);\r\n\r\n\tShowWindow( m_Hwnd, SW_SHOWNORMAL );\r\n\r\n\treturn true;\r\n}\r\nbool NNApplication::_CreateRenderer( RendererStatus renderStatus )\r\n{\r\n\tswitch( renderStatus )\r\n\t{\r\n\tcase D2D:\r\n\t\tm_Renderer = new NND2DRenderer();\r\n\t\tbreak;\r\n\tdefault:\r\n\t\treturn false;\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\n\r\nLRESULT CALLBACK NNApplication::WndProc( HWND hWnd, UINT message, WPARAM wParam, LPARAM lParam )\r\n{\r\n\tswitch( message )\r\n\t{\r\n\tcase WM_DESTROY:\r\n\t\tNNApplication::GetInstance()->Release();\r\n\t\tNNApplication::GetInstance()->m_DestroyWindow = true;\r\n\t\tPostQuitMessage(0);\r\n\t\treturn 0;\r\n\tcase WM_PAINT:\r\n\t\tPAINTSTRUCT ps;\r\n\t\tHDC hdc = BeginPaint( hWnd, &ps );\r\n\t\tEndPaint( hWnd, &ps );\r\n\t}\r\n\r\n\treturn(DefWindowProc(hWnd,message,wParam,lParam));\r\n}<|endoftext|>"}
{"text":"<commit_before>#ifndef BUW_BOX_HPP\n#define BUW_BOX_HPP\n\n#include \"shape.hpp\"\n#include <glm\/vec3.hpp>\n\nclass Box : public Shape {\npublic:\n\tBox();\n\tBox(glm::vec3 const& min, glm::vec3 const& max);\n\tBox(glm::vec3 const& min, glm::vec3 const& max, Color const& color, std::string const& name);\n\tglm::vec3 min() const;\n\tglm::vec3 max() const;\n\tdouble area() const override;\n\tdouble volume() const override;\n\tstd::ostream& print(std::ostream& os) const override;\nprivate:\n\tglm::vec3 min_;\n\tglm::vec3 max_;\n};\n\nstd::ostream& operator<<(std::ostream& os, Box const& s);\n\n#endif\n<commit_msg>Finalize<commit_after>#ifndef BUW_BOX_HPP\n#define BUW_BOX_HPP\n\n#include \"shape.hpp\"\n#include <glm\/vec3.hpp>\n#include \"ray.hpp\"\n\nclass Box : public Shape {\npublic:\n\tBox();\n\tBox(glm::vec3 const& min, glm::vec3 const& max);\n\tBox(glm::vec3 const& min, glm::vec3 const& max, Color const& color, std::string const& name);\n\t~Box();\n\tglm::vec3 min() const;\n\tglm::vec3 max() const;\n\tdouble area() const override;\n\tdouble volume() const override;\n\tstd::ostream& print(std::ostream& os) const override;\n\tbool intersect(Ray const& ray, float& distance);\nprivate:\n\tglm::vec3 min_;\n\tglm::vec3 max_;\n};\n\nstd::ostream& operator<<(std::ostream& os, Box const& s);\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2017 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 <map>\n#include <string>\n#include <tuple>\n#include <vector>\n\n#include <llvm\/DebugInfo\/DWARF\/DWARFContext.h>\n#include <llvm\/DebugInfo\/DWARF\/DWARFDebugLine.h>\n#include <llvm\/IR\/Module.h>\n#include <llvm\/MC\/MCAsmInfo.h>\n#include <llvm\/MC\/MCContext.h>\n#include <llvm\/MC\/MCDisassembler\/MCDisassembler.h>\n#include <llvm\/MC\/MCInstPrinter.h>\n#include <llvm\/MC\/MCInstrInfo.h>\n#include <llvm\/MC\/MCObjectFileInfo.h>\n#include <llvm\/MC\/MCRegisterInfo.h>\n#include <llvm\/Support\/TargetRegistry.h>\n\n#include \"bcc_debug.h\"\n\nnamespace ebpf {\n\n\/\/ ld_pseudo can only be disassembled properly\n\/\/ in llvm 6.0, so having this workaround now\n\/\/ until disto llvm versions catch up\n#define WORKAROUND_FOR_LD_PSEUDO\n\nusing std::get;\nusing std::map;\nusing std::string;\nusing std::tuple;\nusing std::vector;\nusing namespace llvm;\nusing DWARFLineTable = DWARFDebugLine::LineTable;\n\nvoid SourceDebugger::adjustInstSize(uint64_t &Size, uint8_t byte0,\n                                    uint8_t byte1) {\n#ifdef WORKAROUND_FOR_LD_PSEUDO\n  bool isLittleEndian = mod_->getDataLayout().isLittleEndian();\n  if (byte0 == 0x18 && ((isLittleEndian && (byte1 & 0xf) == 0x1) ||\n                        (!isLittleEndian && (byte1 & 0xf0) == 0x10)))\n    Size = 16;\n#endif\n}\n\nvector<string> SourceDebugger::buildLineCache() {\n  vector<string> LineCache;\n  size_t FileBufSize = mod_src_.size();\n\n  for (uint32_t start = 0, end = start; end < FileBufSize; end++)\n    if (mod_src_[end] == '\\n' || end == FileBufSize - 1 ||\n        (mod_src_[end] == '\\r' && mod_src_[end + 1] == '\\n')) {\n      \/\/ Not including the endline\n      LineCache.push_back(string(mod_src_.substr(start, end - start)));\n      if (mod_src_[end] == '\\r')\n        end++;\n      start = end + 1;\n    }\n\n  return LineCache;\n}\n\nvoid SourceDebugger::dumpSrcLine(const vector<string> &LineCache,\n                                 const string &FileName, uint32_t Line,\n                                 uint32_t &CurrentSrcLine,\n                                 llvm::raw_ostream &os) {\n  if (Line != 0 && Line != CurrentSrcLine && Line < LineCache.size() &&\n      FileName == mod_->getSourceFileName()) {\n    os << \"; \" << StringRef(LineCache[Line - 1]).ltrim()\n       << format(\n              \" \/\/ Line\"\n              \"%4\" PRIu64 \"\\n\",\n              Line);\n    CurrentSrcLine = Line;\n  }\n}\n\nvoid SourceDebugger::getDebugSections(\n    StringMap<std::unique_ptr<MemoryBuffer>> &DebugSections) {\n  for (auto section : sections_) {\n    if (strncmp(section.first.c_str(), \".debug\", 6) == 0) {\n      StringRef SecData(reinterpret_cast<const char *>(get<0>(section.second)),\n                        get<1>(section.second));\n      DebugSections[section.first.substr(1)] =\n          MemoryBuffer::getMemBufferCopy(SecData);\n    }\n  }\n}\n\nvoid SourceDebugger::dump() {\n  string Error;\n  string TripleStr(mod_->getTargetTriple());\n  Triple TheTriple(TripleStr);\n  const Target *T = TargetRegistry::lookupTarget(TripleStr, Error);\n  if (!T) {\n    errs() << \"Debug Error: cannot get target\\n\";\n    return;\n  }\n\n  std::unique_ptr<MCRegisterInfo> MRI(T->createMCRegInfo(TripleStr));\n  if (!MRI) {\n    errs() << \"Debug Error: cannot get register info\\n\";\n    return;\n  }\n#if LLVM_MAJOR_VERSION >= 10\n  MCTargetOptions MCOptions;\n  std::unique_ptr<MCAsmInfo> MAI(T->createMCAsmInfo(*MRI, TripleStr, MCOptions));\n#else\n  std::unique_ptr<MCAsmInfo> MAI(T->createMCAsmInfo(*MRI, TripleStr));\n#endif\n  if (!MAI) {\n    errs() << \"Debug Error: cannot get assembly info\\n\";\n    return;\n  }\n\n  std::unique_ptr<MCSubtargetInfo> STI(\n      T->createMCSubtargetInfo(TripleStr, \"\", \"\"));\n  MCObjectFileInfo MOFI;\n#if LLVM_MAJOR_VERSION >= 13\n  MCContext Ctx(TheTriple, MAI.get(), MRI.get(), STI.get(), nullptr);\n  Ctx.setObjectFileInfo(&MOFI);\n  MOFI.initMCObjectFileInfo(Ctx, false, false);\n#else\n  MCContext Ctx(MAI.get(), MRI.get(), &MOFI, nullptr);\n  MOFI.InitMCObjectFileInfo(TheTriple, false, Ctx, false);\n#endif\n\n  std::unique_ptr<MCInstrInfo> MCII(T->createMCInstrInfo());\n  MCInstPrinter *IP = T->createMCInstPrinter(TheTriple, 0, *MAI, *MCII, *MRI);\n  if (!IP) {\n    errs() << \"Debug Error: unable to create instruction printer\\n\";\n    return;\n  }\n\n  std::unique_ptr<const MCDisassembler> DisAsm(\n      T->createMCDisassembler(*STI, Ctx));\n  if (!DisAsm) {\n    errs() << \"Debug Error: no disassembler\\n\";\n    return;\n  }\n\n  \/\/ Set up the dwarf debug context\n  StringMap<std::unique_ptr<MemoryBuffer>> DebugSections;\n  getDebugSections(DebugSections);\n  std::unique_ptr<DWARFContext> DwarfCtx =\n      DWARFContext::create(DebugSections, 8);\n  if (!DwarfCtx) {\n    errs() << \"Debug Error: dwarf context creation failed\\n\";\n    return;\n  }\n\n  \/\/ bcc has only one compilation unit\n  \/\/ getCompileUnitAtIndex() was gone in llvm 8.0 (https:\/\/reviews.llvm.org\/D49741)\n#if LLVM_MAJOR_VERSION >= 8\n  DWARFCompileUnit *CU = cast<DWARFCompileUnit>(DwarfCtx->getUnitAtIndex(0));\n#else\n  DWARFCompileUnit *CU = DwarfCtx->getCompileUnitAtIndex(0);\n#endif\n  if (!CU) {\n    errs() << \"Debug Error: dwarf context failed to get compile unit\\n\";\n    return;\n  }\n\n  const DWARFLineTable *LineTable = DwarfCtx->getLineTableForUnit(CU);\n  if (!LineTable) {\n    errs() << \"Debug Error: dwarf context failed to get line table\\n\";\n    return;\n  }\n\n  \/\/ Build LineCache for later source code printing\n  vector<string> LineCache = buildLineCache();\n\n  \/\/ Start to disassemble with source code annotation section by section\n  for (auto section : sections_)\n    if (!strncmp(fn_prefix_.c_str(), section.first.c_str(),\n                 fn_prefix_.size())) {\n      MCDisassembler::DecodeStatus S;\n      MCInst Inst;\n      uint64_t Size;\n      uint8_t *FuncStart = get<0>(section.second);\n      uint64_t FuncSize = get<1>(section.second);\n#if LLVM_MAJOR_VERSION >= 9\n      unsigned SectionID = get<2>(section.second);\n#endif\n      ArrayRef<uint8_t> Data(FuncStart, FuncSize);\n      uint32_t CurrentSrcLine = 0;\n      string func_name = section.first.substr(fn_prefix_.size());\n\n      errs() << \"Disassembly of section \" << section.first << \":\\n\"\n             << func_name << \":\\n\";\n\n      string src_dbg_str;\n      llvm::raw_string_ostream os(src_dbg_str);\n      for (uint64_t Index = 0; Index < FuncSize; Index += Size) {\n#if LLVM_MAJOR_VERSION >= 10\n        S = DisAsm->getInstruction(Inst, Size, Data.slice(Index), Index,\n                                   nulls());\n#else\n        S = DisAsm->getInstruction(Inst, Size, Data.slice(Index), Index,\n                                   nulls(), nulls());\n#endif\n        if (S != MCDisassembler::Success) {\n          os << \"Debug Error: disassembler failed: \" << std::to_string(S)\n             << '\\n';\n          break;\n        } else {\n          DILineInfo LineInfo;\n\n          LineTable->getFileLineInfoForAddress(\n#if LLVM_MAJOR_VERSION >= 9\n              {(uint64_t)FuncStart + Index, SectionID},\n#else\n              (uint64_t)FuncStart + Index,\n#endif\n              CU->getCompilationDir(),\n              DILineInfoSpecifier::FileLineInfoKind::AbsoluteFilePath,\n              LineInfo);\n\n          adjustInstSize(Size, Data[Index], Data[Index + 1]);\n          dumpSrcLine(LineCache, LineInfo.FileName, LineInfo.Line,\n                      CurrentSrcLine, os);\n          os << format(\"%4\" PRIu64 \":\", Index >> 3) << '\\t';\n          dumpBytes(Data.slice(Index, Size), os);\n#if LLVM_MAJOR_VERSION >= 10\n          IP->printInst(&Inst, 0, \"\", *STI, os);\n#else\n          IP->printInst(&Inst, os, \"\", *STI);\n#endif\n          os << '\\n';\n        }\n      }\n      os.flush();\n      errs() << src_dbg_str << '\\n';\n      src_dbg_fmap_[func_name] = src_dbg_str;\n    }\n}\n\n}  \/\/ namespace ebpf\n<commit_msg>fix a llvm14 compilation error<commit_after>\/*\n * Copyright (c) 2017 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 <map>\n#include <string>\n#include <tuple>\n#include <vector>\n\n#include <llvm\/DebugInfo\/DWARF\/DWARFContext.h>\n#include <llvm\/DebugInfo\/DWARF\/DWARFDebugLine.h>\n#include <llvm\/IR\/Module.h>\n#include <llvm\/MC\/MCAsmInfo.h>\n#include <llvm\/MC\/MCContext.h>\n#include <llvm\/MC\/MCDisassembler\/MCDisassembler.h>\n#include <llvm\/MC\/MCInstPrinter.h>\n#include <llvm\/MC\/MCInstrInfo.h>\n#include <llvm\/MC\/MCObjectFileInfo.h>\n#include <llvm\/MC\/MCRegisterInfo.h>\n#if LLVM_MAJOR_VERSION >= 14\n#include <llvm\/MC\/TargetRegistry.h>\n#else\n#include <llvm\/Support\/TargetRegistry.h>\n#endif\n\n#include \"bcc_debug.h\"\n\nnamespace ebpf {\n\n\/\/ ld_pseudo can only be disassembled properly\n\/\/ in llvm 6.0, so having this workaround now\n\/\/ until disto llvm versions catch up\n#define WORKAROUND_FOR_LD_PSEUDO\n\nusing std::get;\nusing std::map;\nusing std::string;\nusing std::tuple;\nusing std::vector;\nusing namespace llvm;\nusing DWARFLineTable = DWARFDebugLine::LineTable;\n\nvoid SourceDebugger::adjustInstSize(uint64_t &Size, uint8_t byte0,\n                                    uint8_t byte1) {\n#ifdef WORKAROUND_FOR_LD_PSEUDO\n  bool isLittleEndian = mod_->getDataLayout().isLittleEndian();\n  if (byte0 == 0x18 && ((isLittleEndian && (byte1 & 0xf) == 0x1) ||\n                        (!isLittleEndian && (byte1 & 0xf0) == 0x10)))\n    Size = 16;\n#endif\n}\n\nvector<string> SourceDebugger::buildLineCache() {\n  vector<string> LineCache;\n  size_t FileBufSize = mod_src_.size();\n\n  for (uint32_t start = 0, end = start; end < FileBufSize; end++)\n    if (mod_src_[end] == '\\n' || end == FileBufSize - 1 ||\n        (mod_src_[end] == '\\r' && mod_src_[end + 1] == '\\n')) {\n      \/\/ Not including the endline\n      LineCache.push_back(string(mod_src_.substr(start, end - start)));\n      if (mod_src_[end] == '\\r')\n        end++;\n      start = end + 1;\n    }\n\n  return LineCache;\n}\n\nvoid SourceDebugger::dumpSrcLine(const vector<string> &LineCache,\n                                 const string &FileName, uint32_t Line,\n                                 uint32_t &CurrentSrcLine,\n                                 llvm::raw_ostream &os) {\n  if (Line != 0 && Line != CurrentSrcLine && Line < LineCache.size() &&\n      FileName == mod_->getSourceFileName()) {\n    os << \"; \" << StringRef(LineCache[Line - 1]).ltrim()\n       << format(\n              \" \/\/ Line\"\n              \"%4\" PRIu64 \"\\n\",\n              Line);\n    CurrentSrcLine = Line;\n  }\n}\n\nvoid SourceDebugger::getDebugSections(\n    StringMap<std::unique_ptr<MemoryBuffer>> &DebugSections) {\n  for (auto section : sections_) {\n    if (strncmp(section.first.c_str(), \".debug\", 6) == 0) {\n      StringRef SecData(reinterpret_cast<const char *>(get<0>(section.second)),\n                        get<1>(section.second));\n      DebugSections[section.first.substr(1)] =\n          MemoryBuffer::getMemBufferCopy(SecData);\n    }\n  }\n}\n\nvoid SourceDebugger::dump() {\n  string Error;\n  string TripleStr(mod_->getTargetTriple());\n  Triple TheTriple(TripleStr);\n  const Target *T = TargetRegistry::lookupTarget(TripleStr, Error);\n  if (!T) {\n    errs() << \"Debug Error: cannot get target\\n\";\n    return;\n  }\n\n  std::unique_ptr<MCRegisterInfo> MRI(T->createMCRegInfo(TripleStr));\n  if (!MRI) {\n    errs() << \"Debug Error: cannot get register info\\n\";\n    return;\n  }\n#if LLVM_MAJOR_VERSION >= 10\n  MCTargetOptions MCOptions;\n  std::unique_ptr<MCAsmInfo> MAI(T->createMCAsmInfo(*MRI, TripleStr, MCOptions));\n#else\n  std::unique_ptr<MCAsmInfo> MAI(T->createMCAsmInfo(*MRI, TripleStr));\n#endif\n  if (!MAI) {\n    errs() << \"Debug Error: cannot get assembly info\\n\";\n    return;\n  }\n\n  std::unique_ptr<MCSubtargetInfo> STI(\n      T->createMCSubtargetInfo(TripleStr, \"\", \"\"));\n  MCObjectFileInfo MOFI;\n#if LLVM_MAJOR_VERSION >= 13\n  MCContext Ctx(TheTriple, MAI.get(), MRI.get(), STI.get(), nullptr);\n  Ctx.setObjectFileInfo(&MOFI);\n  MOFI.initMCObjectFileInfo(Ctx, false, false);\n#else\n  MCContext Ctx(MAI.get(), MRI.get(), &MOFI, nullptr);\n  MOFI.InitMCObjectFileInfo(TheTriple, false, Ctx, false);\n#endif\n\n  std::unique_ptr<MCInstrInfo> MCII(T->createMCInstrInfo());\n  MCInstPrinter *IP = T->createMCInstPrinter(TheTriple, 0, *MAI, *MCII, *MRI);\n  if (!IP) {\n    errs() << \"Debug Error: unable to create instruction printer\\n\";\n    return;\n  }\n\n  std::unique_ptr<const MCDisassembler> DisAsm(\n      T->createMCDisassembler(*STI, Ctx));\n  if (!DisAsm) {\n    errs() << \"Debug Error: no disassembler\\n\";\n    return;\n  }\n\n  \/\/ Set up the dwarf debug context\n  StringMap<std::unique_ptr<MemoryBuffer>> DebugSections;\n  getDebugSections(DebugSections);\n  std::unique_ptr<DWARFContext> DwarfCtx =\n      DWARFContext::create(DebugSections, 8);\n  if (!DwarfCtx) {\n    errs() << \"Debug Error: dwarf context creation failed\\n\";\n    return;\n  }\n\n  \/\/ bcc has only one compilation unit\n  \/\/ getCompileUnitAtIndex() was gone in llvm 8.0 (https:\/\/reviews.llvm.org\/D49741)\n#if LLVM_MAJOR_VERSION >= 8\n  DWARFCompileUnit *CU = cast<DWARFCompileUnit>(DwarfCtx->getUnitAtIndex(0));\n#else\n  DWARFCompileUnit *CU = DwarfCtx->getCompileUnitAtIndex(0);\n#endif\n  if (!CU) {\n    errs() << \"Debug Error: dwarf context failed to get compile unit\\n\";\n    return;\n  }\n\n  const DWARFLineTable *LineTable = DwarfCtx->getLineTableForUnit(CU);\n  if (!LineTable) {\n    errs() << \"Debug Error: dwarf context failed to get line table\\n\";\n    return;\n  }\n\n  \/\/ Build LineCache for later source code printing\n  vector<string> LineCache = buildLineCache();\n\n  \/\/ Start to disassemble with source code annotation section by section\n  for (auto section : sections_)\n    if (!strncmp(fn_prefix_.c_str(), section.first.c_str(),\n                 fn_prefix_.size())) {\n      MCDisassembler::DecodeStatus S;\n      MCInst Inst;\n      uint64_t Size;\n      uint8_t *FuncStart = get<0>(section.second);\n      uint64_t FuncSize = get<1>(section.second);\n#if LLVM_MAJOR_VERSION >= 9\n      unsigned SectionID = get<2>(section.second);\n#endif\n      ArrayRef<uint8_t> Data(FuncStart, FuncSize);\n      uint32_t CurrentSrcLine = 0;\n      string func_name = section.first.substr(fn_prefix_.size());\n\n      errs() << \"Disassembly of section \" << section.first << \":\\n\"\n             << func_name << \":\\n\";\n\n      string src_dbg_str;\n      llvm::raw_string_ostream os(src_dbg_str);\n      for (uint64_t Index = 0; Index < FuncSize; Index += Size) {\n#if LLVM_MAJOR_VERSION >= 10\n        S = DisAsm->getInstruction(Inst, Size, Data.slice(Index), Index,\n                                   nulls());\n#else\n        S = DisAsm->getInstruction(Inst, Size, Data.slice(Index), Index,\n                                   nulls(), nulls());\n#endif\n        if (S != MCDisassembler::Success) {\n          os << \"Debug Error: disassembler failed: \" << std::to_string(S)\n             << '\\n';\n          break;\n        } else {\n          DILineInfo LineInfo;\n\n          LineTable->getFileLineInfoForAddress(\n#if LLVM_MAJOR_VERSION >= 9\n              {(uint64_t)FuncStart + Index, SectionID},\n#else\n              (uint64_t)FuncStart + Index,\n#endif\n              CU->getCompilationDir(),\n              DILineInfoSpecifier::FileLineInfoKind::AbsoluteFilePath,\n              LineInfo);\n\n          adjustInstSize(Size, Data[Index], Data[Index + 1]);\n          dumpSrcLine(LineCache, LineInfo.FileName, LineInfo.Line,\n                      CurrentSrcLine, os);\n          os << format(\"%4\" PRIu64 \":\", Index >> 3) << '\\t';\n          dumpBytes(Data.slice(Index, Size), os);\n#if LLVM_MAJOR_VERSION >= 10\n          IP->printInst(&Inst, 0, \"\", *STI, os);\n#else\n          IP->printInst(&Inst, os, \"\", *STI);\n#endif\n          os << '\\n';\n        }\n      }\n      os.flush();\n      errs() << src_dbg_str << '\\n';\n      src_dbg_fmap_[func_name] = src_dbg_str;\n    }\n}\n\n}  \/\/ namespace ebpf\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: hfi_doc.cxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: vg $ $Date: 2007-09-18 13:56: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#include <precomp.h>\n#include \"hfi_doc.hxx\"\n\n\n\/\/ NOT FULLY DEFINED SERVICES\n#include <ary\/idl\/i_ce.hxx>\n#include <ary_i\/codeinf2.hxx>\n#include <ary_i\/d_token.hxx>\n#include <toolkit\/hf_docentry.hxx>\n#include \"hfi_tag.hxx\"\n\n\n\n\nHF_IdlDocu::HF_IdlDocu( Environment &       io_rEnv,\n                        HF_DocEntryList &   o_rOut )\n    :   HtmlFactory_Idl( io_rEnv, &o_rOut.CurOut() ),\n        rOut(o_rOut)\n{\n}\n\nHF_IdlDocu::~HF_IdlDocu()\n{\n}\n\n\/\/ KORR\n\/\/   Should not be used any longer.\n\/\/   Use Produce_byCesOwnDocu() or Produce_byDocu4Reference()\n\/\/   instead.\nvoid\nHF_IdlDocu::Produce_byData( const client &  i_ce,\n                            const ce_info * i_doc ) const\n{\n    const ce_info * i_pDocu = i_doc != 0\n                                ?   i_doc\n                                :   i_ce.Docu();\n    if (i_pDocu == 0)\n        return;\n\n    bool bShort = NOT i_pDocu->Short().IsEmpty();\n    bool bDescr = NOT i_pDocu->Description().IsEmpty();\n\n\n    if ( i_pDocu->IsDeprecated() AND i_ce.SightLevel() != ary::idl::sl_File\n         OR\n         i_pDocu->IsOptional() )\n    {\n        rOut.Produce_Term(\"Usage Restrictions\");\n\n        if ( i_pDocu->IsDeprecated() )\n            rOut.Produce_Definition() >> *new Html::Italic << \"deprecated\";\n        if ( i_pDocu->IsOptional() )\n            rOut.Produce_Definition() >> *new Html::Italic << \"optional\";\n    }\n\n    if ( i_pDocu->IsDeprecated()\n         AND\n         \/\/ KORR\n         \/\/ Workaround, because DocuTex2::IsEmpty() does not\n         \/\/   calculate whitespace tokens only as empty.\n         i_pDocu->DeprecatedText().Tokens().size() > 1 )\n    {\n        rOut.Produce_Term(\"Deprecation Info\");\n\n        HF_IdlDocuTextDisplay\n            aDescription( Env(), 0, i_ce);\n        aDescription.Out().Enter( rOut.Produce_Definition() );\n        i_pDocu->DeprecatedText().DisplayAt( aDescription );\n        aDescription.Out().Leave();\n    }\n\n    if ( bShort OR bDescr )\n    {\n        rOut.Produce_Term(\"Description\");\n        HF_IdlDocuTextDisplay\n                aDescription( Env(), 0, i_ce);\n        if (bShort)\n        {\n            aDescription.Out().Enter( rOut.Produce_Definition() );\n            i_pDocu->Short().DisplayAt( aDescription );\n            aDescription.Out().Leave();\n        }\n        if (bDescr)\n        {\n            aDescription.Out().Enter( rOut.Produce_Definition() );\n            i_pDocu->Description().DisplayAt( aDescription );\n            aDescription.Out().Leave();\n        }\n    }\n\n    std::vector< csi::dsapi::DT_SeeAlsoAtTag* >\n        aSeeAlsosWithoutText;\n    std::vector< csi::dsapi::DT_SeeAlsoAtTag* >\n        aSeeAlsosWithText;\n\n    for ( std::vector< ary::info::AtTag2* >::const_iterator\n                iter = i_pDocu->Tags().begin();\n          iter != i_pDocu->Tags().end();\n          ++iter )\n    {\n        if ( strlen( (*iter)->Title() ) > 0 )\n        {\n            csi::dsapi::DT_SeeAlsoAtTag*\n                pSeeAlso = dynamic_cast< csi::dsapi::DT_SeeAlsoAtTag * >(*iter);\n            if (pSeeAlso != 0 )\n            {\n                if ( pSeeAlso->Text().IsEmpty() )\n                {\n                    aSeeAlsosWithoutText.push_back(pSeeAlso);\n                }\n                else\n                {\n                    aSeeAlsosWithText.push_back(pSeeAlso);\n                }\n                continue;\n            }\n\n            HF_IdlTag\n                    aTag(Env(),  i_ce);\n            Xml::Element &\n                rTerm = rOut.Produce_Term();\n            aTag.Produce_byData( rTerm,\n                                 rOut.Produce_Definition(),\n                                 *(*iter) );\n        }\n    }   \/\/ end for\n\n    if (aSeeAlsosWithoutText.size() > 0)\n    {\n        HF_IdlTag\n            aSeeAlsoTag(Env(),  i_ce);\n        Xml::Element &\n            rTerm = rOut.Produce_Term();\n        aSeeAlsoTag.Produce_byData( rTerm,\n                                    rOut.Produce_Definition(),\n                                    aSeeAlsosWithoutText );\n    }\n\n    for ( std::vector< csi::dsapi::DT_SeeAlsoAtTag* >::const_iterator\n                itSee2 = aSeeAlsosWithText.begin();\n          itSee2 != aSeeAlsosWithText.end();\n          ++itSee2 )\n    {\n        HF_IdlTag\n            aTag(Env(),  i_ce);\n        Xml::Element &\n            rTerm = rOut.Produce_Term();\n            aTag.Produce_byData( rTerm,\n                                 rOut.Produce_Definition(),\n                                 *(*itSee2) );\n    }   \/\/ end for\n}\n\nvoid\nHF_IdlDocu::Produce_byCesOwnDocu( const client & i_ce ) const\n{\n    const ce_info * i_pDocu = i_ce.Docu();\n    if (i_pDocu != 0)\n        Produce_byDocuAndScope(*i_pDocu, &i_ce, i_ce);\n}\n\nvoid\nHF_IdlDocu::Produce_byDocu4Reference( const ce_info &     i_rDocuForReference,\n                                      const client &      i_rScopeGivingCe ) const\n{\n    Produce_byDocuAndScope(i_rDocuForReference, 0, i_rScopeGivingCe);\n}\n\nvoid\nHF_IdlDocu::Produce_byDocuAndScope( const ce_info &     i_rDocu,\n                                    const client *      i_pClient,\n                                    const client &      i_rScopeGivingCe ) const\n{\n    bool bShort = NOT i_rDocu.Short().IsEmpty();\n    bool bDescr = NOT i_rDocu.Description().IsEmpty();\n\n    if ( i_rDocu.IsDeprecated()\n         OR (i_pClient != 0 ? i_pClient->SightLevel() == ary::idl::sl_File : false)\n            AND NOT i_rDocu.IsPublished()\n         OR i_rDocu.IsOptional() )\n    {   \/\/ any usage restriction\n        rOut.Produce_Term(\"Usage Restrictions\");\n\n        if ( i_rDocu.IsDeprecated() )\n            rOut.Produce_Definition() >> *new Html::Italic << \"deprecated\";\n        if ( (i_pClient != 0 ? i_pClient->SightLevel() == ary::idl::sl_File : false)\n             AND NOT i_rDocu.IsPublished() )\n            rOut.Produce_Definition() >> *new Html::Italic << \"not published\";\n        if ( i_rDocu.IsOptional() )\n            rOut.Produce_Definition() >> *new Html::Italic << \"optional\";\n\n        if ( i_rDocu.IsDeprecated() AND\n             \/\/ KORR\n             \/\/ Workaround, because DocuTex2::IsEmpty() does not\n             \/\/   calculate whitespace tokens only as empty.\n             i_rDocu.DeprecatedText().Tokens().size() > 1 )\n        {\n            rOut.Produce_Term(\"Deprecation Info\");\n\n            HF_IdlDocuTextDisplay\n                aDescription( Env(), 0, i_rScopeGivingCe);\n            aDescription.Out().Enter( rOut.Produce_Definition() );\n            i_rDocu.DeprecatedText().DisplayAt( aDescription );\n            aDescription.Out().Leave();\n        }\n    }   \/\/ end if (<any usage restriction>)\n\n    if ( bShort OR bDescr )\n    {\n        rOut.Produce_Term(\"Description\");\n        HF_IdlDocuTextDisplay\n                aDescription( Env(), 0, i_rScopeGivingCe);\n        if (bShort)\n        {\n            aDescription.Out().Enter( rOut.Produce_Definition() );\n            i_rDocu.Short().DisplayAt( aDescription );\n            aDescription.Out().Leave();\n        }\n        if (bDescr)\n        {\n            aDescription.Out().Enter( rOut.Produce_Definition() );\n            i_rDocu.Description().DisplayAt( aDescription );\n            aDescription.Out().Leave();\n        }\n    }\n\n    for ( std::vector< ary::info::AtTag2* >::const_iterator\n                iter = i_rDocu.Tags().begin();\n          iter != i_rDocu.Tags().end();\n          ++iter )\n    {\n        if ( strlen( (*iter)->Title() ) > 0 )\n        {\n            HF_IdlTag\n                    aTag(Env(), i_rScopeGivingCe);\n            Xml::Element &\n                rTerm = rOut.Produce_Term();\n            aTag.Produce_byData( rTerm,\n                                 rOut.Produce_Definition(),\n                                 *(*iter) );\n        }\n    }   \/\/ end for\n}\n<commit_msg>INTEGRATION: CWS adc18 (1.8.2); FILE MERGED 2007\/10\/19 10:37:28 np 1.8.2.2: #i81775# 2007\/10\/18 15:23:13 np 1.8.2.1: #i81775#<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: hfi_doc.cxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: hr $ $Date: 2007-11-02 16:34: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#include <precomp.h>\n#include \"hfi_doc.hxx\"\n\n\n\/\/ NOT FULLY DEFINED SERVICES\n#include <ary\/idl\/i_ce.hxx>\n#include <ary\/doc\/d_oldidldocu.hxx>\n#include <ary_i\/d_token.hxx>\n#include <toolkit\/hf_docentry.hxx>\n#include \"hfi_tag.hxx\"\n#include \"hi_ary.hxx\"\n\n\n\n\nHF_IdlDocu::HF_IdlDocu( Environment &       io_rEnv,\n                        HF_DocEntryList &   o_rOut )\n    :   HtmlFactory_Idl( io_rEnv, &o_rOut.CurOut() ),\n        rOut(o_rOut)\n{\n}\n\nHF_IdlDocu::~HF_IdlDocu()\n{\n}\n\n\/\/ KORR_FUTURE\n\/\/   Should not be used any longer.\n\/\/   Use Produce_byCesOwnDocu() or Produce_byDocu4Reference()\n\/\/   instead.\nvoid\nHF_IdlDocu::Produce_byData( const client &  i_ce,\n                            const ce_info * i_doc ) const\n{\n    const ce_info * i_pDocu = i_doc != 0\n                                ?   i_doc\n                                :   Get_IdlDocu(i_ce.Docu());\n    if (i_pDocu == 0)\n        return;\n\n    bool bShort = NOT i_pDocu->Short().IsEmpty();\n    bool bDescr = NOT i_pDocu->Description().IsEmpty();\n\n\n    if ( i_pDocu->IsDeprecated() AND i_ce.SightLevel() != ary::idl::sl_File\n         OR\n         i_pDocu->IsOptional() )\n    {\n        rOut.Produce_Term(\"Usage Restrictions\");\n\n        if ( i_pDocu->IsDeprecated() )\n            rOut.Produce_Definition() >> *new Html::Italic << \"deprecated\";\n        if ( i_pDocu->IsOptional() )\n            rOut.Produce_Definition() >> *new Html::Italic << \"optional\";\n    }\n\n    if ( i_pDocu->IsDeprecated()\n         AND\n         \/\/ KORR_FUTURE\n         \/\/ Workaround, because DocuTex2::IsEmpty() does not\n         \/\/   calculate whitespace tokens only as empty.\n         i_pDocu->DeprecatedText().Tokens().size() > 1 )\n    {\n        rOut.Produce_Term(\"Deprecation Info\");\n\n        HF_IdlDocuTextDisplay\n            aDescription( Env(), 0, i_ce);\n        aDescription.Out().Enter( rOut.Produce_Definition() );\n        i_pDocu->DeprecatedText().DisplayAt( aDescription );\n        aDescription.Out().Leave();\n    }\n\n    if ( bShort OR bDescr )\n    {\n        rOut.Produce_Term(\"Description\");\n        HF_IdlDocuTextDisplay\n                aDescription( Env(), 0, i_ce);\n        if (bShort)\n        {\n            aDescription.Out().Enter( rOut.Produce_Definition() );\n            i_pDocu->Short().DisplayAt( aDescription );\n            aDescription.Out().Leave();\n        }\n        if (bDescr)\n        {\n            aDescription.Out().Enter( rOut.Produce_Definition() );\n            i_pDocu->Description().DisplayAt( aDescription );\n            aDescription.Out().Leave();\n        }\n    }\n\n    std::vector< csi::dsapi::DT_SeeAlsoAtTag* >\n        aSeeAlsosWithoutText;\n    std::vector< csi::dsapi::DT_SeeAlsoAtTag* >\n        aSeeAlsosWithText;\n\n    for ( std::vector< ary::inf::AtTag2* >::const_iterator\n                iter = i_pDocu->Tags().begin();\n          iter != i_pDocu->Tags().end();\n          ++iter )\n    {\n        if ( strlen( (*iter)->Title() ) > 0 )\n        {\n            csi::dsapi::DT_SeeAlsoAtTag*\n                pSeeAlso = dynamic_cast< csi::dsapi::DT_SeeAlsoAtTag * >(*iter);\n            if (pSeeAlso != 0 )\n            {\n                if ( pSeeAlso->Text().IsEmpty() )\n                {\n                    aSeeAlsosWithoutText.push_back(pSeeAlso);\n                }\n                else\n                {\n                    aSeeAlsosWithText.push_back(pSeeAlso);\n                }\n                continue;\n            }\n\n            HF_IdlTag\n                    aTag(Env(),  i_ce);\n            Xml::Element &\n                rTerm = rOut.Produce_Term();\n            aTag.Produce_byData( rTerm,\n                                 rOut.Produce_Definition(),\n                                 *(*iter) );\n        }\n    }   \/\/ end for\n\n    if (aSeeAlsosWithoutText.size() > 0)\n    {\n        HF_IdlTag\n            aSeeAlsoTag(Env(),  i_ce);\n        Xml::Element &\n            rTerm = rOut.Produce_Term();\n        aSeeAlsoTag.Produce_byData( rTerm,\n                                    rOut.Produce_Definition(),\n                                    aSeeAlsosWithoutText );\n    }\n\n    for ( std::vector< csi::dsapi::DT_SeeAlsoAtTag* >::const_iterator\n                itSee2 = aSeeAlsosWithText.begin();\n          itSee2 != aSeeAlsosWithText.end();\n          ++itSee2 )\n    {\n        HF_IdlTag\n            aTag(Env(),  i_ce);\n        Xml::Element &\n            rTerm = rOut.Produce_Term();\n            aTag.Produce_byData( rTerm,\n                                 rOut.Produce_Definition(),\n                                 *(*itSee2) );\n    }   \/\/ end for\n}\n\nvoid\nHF_IdlDocu::Produce_byCesOwnDocu( const client & i_ce ) const\n{\n    const ce_info *\n        i_pDocu = Get_IdlDocu(i_ce.Docu());\n    if (i_pDocu != 0)\n        Produce_byDocuAndScope(*i_pDocu, &i_ce, i_ce);\n}\n\nvoid\nHF_IdlDocu::Produce_byDocu4Reference( const ce_info &     i_rDocuForReference,\n                                      const client &      i_rScopeGivingCe ) const\n{\n    Produce_byDocuAndScope(i_rDocuForReference, 0, i_rScopeGivingCe);\n}\n\nvoid\nHF_IdlDocu::Produce_byDocuAndScope( const ce_info &     i_rDocu,\n                                    const client *      i_pClient,\n                                    const client &      i_rScopeGivingCe ) const\n{\n    bool bShort = NOT i_rDocu.Short().IsEmpty();\n    bool bDescr = NOT i_rDocu.Description().IsEmpty();\n\n    if ( i_rDocu.IsDeprecated()\n         OR (i_pClient != 0 ? i_pClient->SightLevel() == ary::idl::sl_File : false)\n            AND NOT i_rDocu.IsPublished()\n         OR i_rDocu.IsOptional() )\n    {   \/\/ any usage restriction\n        rOut.Produce_Term(\"Usage Restrictions\");\n\n        if ( i_rDocu.IsDeprecated() )\n            rOut.Produce_Definition() >> *new Html::Italic << \"deprecated\";\n        if ( (i_pClient != 0 ? i_pClient->SightLevel() == ary::idl::sl_File : false)\n             AND NOT i_rDocu.IsPublished() )\n            rOut.Produce_Definition() >> *new Html::Italic << \"not published\";\n        if ( i_rDocu.IsOptional() )\n            rOut.Produce_Definition() >> *new Html::Italic << \"optional\";\n\n        if ( i_rDocu.IsDeprecated() AND\n             \/\/ KORR_FUTURE\n             \/\/ Workaround, because DocuTex2::IsEmpty() does not\n             \/\/   calculate whitespace tokens only as empty.\n             i_rDocu.DeprecatedText().Tokens().size() > 1 )\n        {\n            rOut.Produce_Term(\"Deprecation Info\");\n\n            HF_IdlDocuTextDisplay\n                aDescription( Env(), 0, i_rScopeGivingCe);\n            aDescription.Out().Enter( rOut.Produce_Definition() );\n            i_rDocu.DeprecatedText().DisplayAt( aDescription );\n            aDescription.Out().Leave();\n        }\n    }   \/\/ end if (<any usage restriction>)\n\n    if ( bShort OR bDescr )\n    {\n        rOut.Produce_Term(\"Description\");\n        HF_IdlDocuTextDisplay\n                aDescription( Env(), 0, i_rScopeGivingCe);\n        if (bShort)\n        {\n            aDescription.Out().Enter( rOut.Produce_Definition() );\n            i_rDocu.Short().DisplayAt( aDescription );\n            aDescription.Out().Leave();\n        }\n        if (bDescr)\n        {\n            aDescription.Out().Enter( rOut.Produce_Definition() );\n            i_rDocu.Description().DisplayAt( aDescription );\n            aDescription.Out().Leave();\n        }\n    }\n\n    for ( std::vector< ary::inf::AtTag2* >::const_iterator\n                iter = i_rDocu.Tags().begin();\n          iter != i_rDocu.Tags().end();\n          ++iter )\n    {\n        if ( strlen( (*iter)->Title() ) > 0 )\n        {\n            HF_IdlTag\n                    aTag(Env(), i_rScopeGivingCe);\n            Xml::Element &\n                rTerm = rOut.Produce_Term();\n            aTag.Produce_byData( rTerm,\n                                 rOut.Produce_Definition(),\n                                 *(*iter) );\n        }\n    }   \/\/ end for\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-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 \"chainparams.h\"\n\n#include \"assert.h\"\n#include \"core.h\"\n#include \"protocol.h\"\n#include \"util.h\"\n\n#include <boost\/assign\/list_of.hpp>\n\nusing namespace boost::assign;\n\n\/\/\n\/\/ Main network\n\/\/\n\nunsigned int pnSeed[] =\n{\n    0x00000000\n};\n\nclass CMainParams : public CChainParams {\npublic:\n    CMainParams() {\n        \/\/ The message start string is designed to be unlikely to occur in normal data.\n        \/\/ The characters are rarely used upper ASCII, not valid as UTF-8, and produce\n        \/\/ a large 4-byte int at any alignment.\n        pchMessageStart[0] = 0xb9;\n        pchMessageStart[1] = 0xee;\n        pchMessageStart[2] = 0xb7;\n        pchMessageStart[3] = 0xda;\n        vAlertPubKey = ParseHex(\"04fc9702847840aaf195de8442ebecedf5b095cdbb9bc716bda9110971b28a49e0ead8564ff0db22209e0374782c093bb899692d524e9d6a6956e7c5ecbcd68284\");\n        nDefaultPort = 9340;\n        nRPCPort = 9341;\n        bnProofOfWorkLimit = CBigNum(~uint256(0) >> 32);\n        nSubsidyHalvingInterval = 2100000;\n\n        \/\/ Build the genesis block. Note that the output of the genesis coinbase cannot\n        \/\/ be spent as it did not originally exist in the database.\n        \/\/\n        \/\/ CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1408638282, nBits=1d00ffff, nNonce=1408638282, vtx=1)\n        \/\/   CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)\n        \/\/     CTxIn(COutPoint(000000, -1), coinbase 04ffff001d01042654686520696e63657074696f6e206f662043726f776e636f696e2032302f4175672f32303134)\n        \/\/     CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)\n        \/\/   vMerkleTree: 4a5e1e\n        const char* pszTimestamp = \"Crowncoin - Tradition merged with technology 10\/Oct\/2014\";\n        CTransaction txNew;\n        txNew.vin.resize(1);\n        txNew.vout.resize(1);\n        txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));\n        txNew.vout[0].nValue = 10 * COIN;\n        txNew.vout[0].scriptPubKey = CScript() << ParseHex(\"04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f\") << OP_CHECKSIG;\n        genesis.vtx.push_back(txNew);\n        genesis.hashPrevBlock = 0;\n        genesis.hashMerkleRoot = genesis.BuildMerkleTree();\n        genesis.nVersion = 1;\n        genesis.nTime    = 1412669753;\n        genesis.nBits    = 0x1d00ffff;\n        genesis.nNonce   = 22475117015;\n\n        hashGenesisBlock = genesis.GetHash();\n\n        assert(hashGenesisBlock == uint256(\"0x000000003663525298101408cb1dd793647c29d70a75f6fd4515868088118750\"));\n        assert(genesis.hashMerkleRoot == uint256(\"0x4f70ef9a8dd8685d9d083482e6cff17bb543eb24c39caf637a0274988847cef2\"));\n\n        vSeeds.push_back(CDNSSeedData(\"crowncoin.org\", \"nodelist.crowncoin.org\"));\n\n        base58Prefixes[PUBKEY_ADDRESS] = list_of(0);\n        base58Prefixes[SCRIPT_ADDRESS] = list_of(5);\n        base58Prefixes[SECRET_KEY] =     list_of(128);\n        base58Prefixes[EXT_PUBLIC_KEY] = list_of(0x04)(0x88)(0xB2)(0x1E);\n        base58Prefixes[EXT_SECRET_KEY] = list_of(0x04)(0x88)(0xAD)(0xE4);\n\n        \/\/ Convert the pnSeeds array into usable address objects.\n        for (unsigned int i = 0; i < ARRAYLEN(pnSeed); i++)\n        {\n            \/\/ It'll only connect to one or two seed nodes because once it connects,\n            \/\/ it'll get a pile of addresses with newer timestamps.\n            \/\/ Seed nodes are given a random 'last seen time' of between one and two\n            \/\/ weeks ago.\n            const int64_t nOneWeek = 7*24*60*60;\n            struct in_addr ip;\n            memcpy(&ip, &pnSeed[i], sizeof(ip));\n            CAddress addr(CService(ip, GetDefaultPort()));\n            addr.nTime = GetTime() - GetRand(nOneWeek) - nOneWeek;\n            vFixedSeeds.push_back(addr);\n        }\n    }\n\n    virtual const CBlock& GenesisBlock() const { return genesis; }\n    virtual Network NetworkID() const { return CChainParams::MAIN; }\n\n    virtual const vector<CAddress>& FixedSeeds() const {\n        return vFixedSeeds;\n    }\nprotected:\n    CBlock genesis;\n    vector<CAddress> vFixedSeeds;\n};\nstatic CMainParams mainParams;\n\n\n\/\/\n\/\/ Testnet (v3)\n\/\/\nclass CTestNetParams : public CMainParams {\npublic:\n    CTestNetParams() {\n        \/\/ The message start string is designed to be unlikely to occur in normal data.\n        \/\/ The characters are rarely used upper ASCII, not valid as UTF-8, and produce\n        \/\/ a large 4-byte int at any alignment.\n        pchMessageStart[0] = 0x0c;\n        pchMessageStart[1] = 0x17;\n        pchMessageStart[2] = 0x0f;\n        pchMessageStart[3] = 0x05;\n        vAlertPubKey = ParseHex(\"04302390343f91cc401d56d68b123028bf52e5fca1939df127f63c6467cdf9c8e2c14b61104cf817d0b780da337893ecc4aaff1309e536162dabbdb45200ca2b0a\");\n        nDefaultPort = 19340;\n        nRPCPort = 19341;\n        strDataDir = \"testnet3\";\n\n        \/\/ Modify the testnet genesis block so the timestamp is valid for a later start.\n        genesis.nTime = 1405338325;\n        genesis.nNonce = 1678912305;\n        hashGenesisBlock = genesis.GetHash();\n        \/\/assert(hashGenesisBlock == uint256(\"0x000000005f94b67f20bf3cad62cf7cf74fd7f2878574d3e81015d38ffacd7b6e\"));\n\n        vFixedSeeds.clear();\n        vSeeds.clear();\n        \/\/ vSeeds.push_back(CDNSSeedData(\"bitcoin.petertodd.org\", \"testnet-seed.bitcoin.petertodd.org\"));\n        \/\/ vSeeds.push_back(CDNSSeedData(\"bluematt.me\", \"testnet-seed.bluematt.me\"));\n\n        base58Prefixes[PUBKEY_ADDRESS] = list_of(111);\n        base58Prefixes[SCRIPT_ADDRESS] = list_of(196);\n        base58Prefixes[SECRET_KEY]     = list_of(239);\n        base58Prefixes[EXT_PUBLIC_KEY] = list_of(0x04)(0x35)(0x87)(0xCF);\n        base58Prefixes[EXT_SECRET_KEY] = list_of(0x04)(0x35)(0x83)(0x94);\n    }\n    virtual Network NetworkID() const { return CChainParams::TESTNET; }\n};\nstatic CTestNetParams testNetParams;\n\n\n\/\/\n\/\/ Regression test\n\/\/\nclass CRegTestParams : public CTestNetParams {\npublic:\n    CRegTestParams() {\n        pchMessageStart[0] = 0xfb;\n        pchMessageStart[1] = 0xae;\n        pchMessageStart[2] = 0xc6;\n        pchMessageStart[3] = 0xdf;\n        nSubsidyHalvingInterval = 150;\n        bnProofOfWorkLimit = CBigNum(~uint256(0) >> 1);\n        genesis.nTime = 1296688602;\n        genesis.nBits = 0x207fffff;\n        genesis.nNonce = 2;\n        hashGenesisBlock = genesis.GetHash();\n        nDefaultPort = 19444;\n        strDataDir = \"regtest\";\n        assert(hashGenesisBlock == uint256(\"0xda44d82ead2a55f68c3725599112c3c9aaa27ed69ea4e8016dedfdcf34d4f4c4\"));\n\n        vSeeds.clear();  \/\/ Regtest mode doesn't have any DNS seeds.\n    }\n\n    virtual bool RequireRPCPassword() const { return false; }\n    virtual Network NetworkID() const { return CChainParams::REGTEST; }\n};\nstatic CRegTestParams regTestParams;\n\nstatic CChainParams *pCurrentParams = &mainParams;\n\nconst CChainParams &Params() {\n    return *pCurrentParams;\n}\n\nvoid SelectParams(CChainParams::Network network) {\n    switch (network) {\n        case CChainParams::MAIN:\n            pCurrentParams = &mainParams;\n            break;\n        case CChainParams::TESTNET:\n            pCurrentParams = &testNetParams;\n            break;\n        case CChainParams::REGTEST:\n            pCurrentParams = &regTestParams;\n            break;\n        default:\n            assert(false && \"Unimplemented network\");\n            return;\n    }\n}\n\nbool SelectParamsFromCommandLine() {\n    bool fRegTest = GetBoolArg(\"-regtest\", false);\n    bool fTestNet = GetBoolArg(\"-testnet\", false);\n\n    if (fTestNet && fRegTest) {\n        return false;\n    }\n\n    if (fRegTest) {\n        SelectParams(CChainParams::REGTEST);\n    } else if (fTestNet) {\n        SelectParams(CChainParams::TESTNET);\n    } else {\n        SelectParams(CChainParams::MAIN);\n    }\n    return true;\n}\n<commit_msg>commenting out regression checks<commit_after>\/\/ Copyright (c) 2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-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 \"chainparams.h\"\n\n#include \"assert.h\"\n#include \"core.h\"\n#include \"protocol.h\"\n#include \"util.h\"\n\n#include <boost\/assign\/list_of.hpp>\n\nusing namespace boost::assign;\n\n\/\/\n\/\/ Main network\n\/\/\n\nunsigned int pnSeed[] =\n{\n    0x00000000\n};\n\nclass CMainParams : public CChainParams {\npublic:\n    CMainParams() {\n        \/\/ The message start string is designed to be unlikely to occur in normal data.\n        \/\/ The characters are rarely used upper ASCII, not valid as UTF-8, and produce\n        \/\/ a large 4-byte int at any alignment.\n        pchMessageStart[0] = 0xb9;\n        pchMessageStart[1] = 0xee;\n        pchMessageStart[2] = 0xb7;\n        pchMessageStart[3] = 0xda;\n        vAlertPubKey = ParseHex(\"04fc9702847840aaf195de8442ebecedf5b095cdbb9bc716bda9110971b28a49e0ead8564ff0db22209e0374782c093bb899692d524e9d6a6956e7c5ecbcd68284\");\n        nDefaultPort = 9340;\n        nRPCPort = 9341;\n        bnProofOfWorkLimit = CBigNum(~uint256(0) >> 32);\n        nSubsidyHalvingInterval = 2100000;\n\n        \/\/ Build the genesis block. Note that the output of the genesis coinbase cannot\n        \/\/ be spent as it did not originally exist in the database.\n        \/\/\n        \/\/ CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1408638282, nBits=1d00ffff, nNonce=1408638282, vtx=1)\n        \/\/   CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)\n        \/\/     CTxIn(COutPoint(000000, -1), coinbase 04ffff001d01042654686520696e63657074696f6e206f662043726f776e636f696e2032302f4175672f32303134)\n        \/\/     CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)\n        \/\/   vMerkleTree: 4a5e1e\n        const char* pszTimestamp = \"Crowncoin - Tradition merged with technology 10\/Oct\/2014\";\n        CTransaction txNew;\n        txNew.vin.resize(1);\n        txNew.vout.resize(1);\n        txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));\n        txNew.vout[0].nValue = 10 * COIN;\n        txNew.vout[0].scriptPubKey = CScript() << ParseHex(\"04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f\") << OP_CHECKSIG;\n        genesis.vtx.push_back(txNew);\n        genesis.hashPrevBlock = 0;\n        genesis.hashMerkleRoot = genesis.BuildMerkleTree();\n        genesis.nVersion = 1;\n        genesis.nTime    = 1412669753;\n        genesis.nBits    = 0x1d00ffff;\n        genesis.nNonce   = 22475117015;\n\n        hashGenesisBlock = genesis.GetHash();\n\n        \/\/ assert(hashGenesisBlock == uint256(\"0x000000003663525298101408cb1dd793647c29d70a75f6fd4515868088118750\"));\n        \/\/ assert(genesis.hashMerkleRoot == uint256(\"0x4f70ef9a8dd8685d9d083482e6cff17bb543eb24c39caf637a0274988847cef2\"));\n\n        vSeeds.push_back(CDNSSeedData(\"crowncoin.org\", \"nodelist.crowncoin.org\"));\n\n        base58Prefixes[PUBKEY_ADDRESS] = list_of(0);\n        base58Prefixes[SCRIPT_ADDRESS] = list_of(5);\n        base58Prefixes[SECRET_KEY] =     list_of(128);\n        base58Prefixes[EXT_PUBLIC_KEY] = list_of(0x04)(0x88)(0xB2)(0x1E);\n        base58Prefixes[EXT_SECRET_KEY] = list_of(0x04)(0x88)(0xAD)(0xE4);\n\n        \/\/ Convert the pnSeeds array into usable address objects.\n        for (unsigned int i = 0; i < ARRAYLEN(pnSeed); i++)\n        {\n            \/\/ It'll only connect to one or two seed nodes because once it connects,\n            \/\/ it'll get a pile of addresses with newer timestamps.\n            \/\/ Seed nodes are given a random 'last seen time' of between one and two\n            \/\/ weeks ago.\n            const int64_t nOneWeek = 7*24*60*60;\n            struct in_addr ip;\n            memcpy(&ip, &pnSeed[i], sizeof(ip));\n            CAddress addr(CService(ip, GetDefaultPort()));\n            addr.nTime = GetTime() - GetRand(nOneWeek) - nOneWeek;\n            vFixedSeeds.push_back(addr);\n        }\n    }\n\n    virtual const CBlock& GenesisBlock() const { return genesis; }\n    virtual Network NetworkID() const { return CChainParams::MAIN; }\n\n    virtual const vector<CAddress>& FixedSeeds() const {\n        return vFixedSeeds;\n    }\nprotected:\n    CBlock genesis;\n    vector<CAddress> vFixedSeeds;\n};\nstatic CMainParams mainParams;\n\n\n\/\/\n\/\/ Testnet (v3)\n\/\/\nclass CTestNetParams : public CMainParams {\npublic:\n    CTestNetParams() {\n        \/\/ The message start string is designed to be unlikely to occur in normal data.\n        \/\/ The characters are rarely used upper ASCII, not valid as UTF-8, and produce\n        \/\/ a large 4-byte int at any alignment.\n        pchMessageStart[0] = 0x0c;\n        pchMessageStart[1] = 0x17;\n        pchMessageStart[2] = 0x0f;\n        pchMessageStart[3] = 0x05;\n        vAlertPubKey = ParseHex(\"04302390343f91cc401d56d68b123028bf52e5fca1939df127f63c6467cdf9c8e2c14b61104cf817d0b780da337893ecc4aaff1309e536162dabbdb45200ca2b0a\");\n        nDefaultPort = 19340;\n        nRPCPort = 19341;\n        strDataDir = \"testnet3\";\n\n        \/\/ Modify the testnet genesis block so the timestamp is valid for a later start.\n        genesis.nTime = 1405338325;\n        genesis.nNonce = 1678912305;\n        hashGenesisBlock = genesis.GetHash();\n        \/\/assert(hashGenesisBlock == uint256(\"0x000000005f94b67f20bf3cad62cf7cf74fd7f2878574d3e81015d38ffacd7b6e\"));\n\n        vFixedSeeds.clear();\n        vSeeds.clear();\n        \/\/ vSeeds.push_back(CDNSSeedData(\"bitcoin.petertodd.org\", \"testnet-seed.bitcoin.petertodd.org\"));\n        \/\/ vSeeds.push_back(CDNSSeedData(\"bluematt.me\", \"testnet-seed.bluematt.me\"));\n\n        base58Prefixes[PUBKEY_ADDRESS] = list_of(111);\n        base58Prefixes[SCRIPT_ADDRESS] = list_of(196);\n        base58Prefixes[SECRET_KEY]     = list_of(239);\n        base58Prefixes[EXT_PUBLIC_KEY] = list_of(0x04)(0x35)(0x87)(0xCF);\n        base58Prefixes[EXT_SECRET_KEY] = list_of(0x04)(0x35)(0x83)(0x94);\n    }\n    virtual Network NetworkID() const { return CChainParams::TESTNET; }\n};\nstatic CTestNetParams testNetParams;\n\n\n\/\/\n\/\/ Regression test\n\/\/\nclass CRegTestParams : public CTestNetParams {\npublic:\n    CRegTestParams() {\n        pchMessageStart[0] = 0xfb;\n        pchMessageStart[1] = 0xae;\n        pchMessageStart[2] = 0xc6;\n        pchMessageStart[3] = 0xdf;\n        nSubsidyHalvingInterval = 150;\n        bnProofOfWorkLimit = CBigNum(~uint256(0) >> 1);\n        genesis.nTime = 1296688602;\n        genesis.nBits = 0x207fffff;\n        genesis.nNonce = 2;\n        hashGenesisBlock = genesis.GetHash();\n        nDefaultPort = 19444;\n        strDataDir = \"regtest\";\n        assert(hashGenesisBlock == uint256(\"0xda44d82ead2a55f68c3725599112c3c9aaa27ed69ea4e8016dedfdcf34d4f4c4\"));\n\n        vSeeds.clear();  \/\/ Regtest mode doesn't have any DNS seeds.\n    }\n\n    virtual bool RequireRPCPassword() const { return false; }\n    virtual Network NetworkID() const { return CChainParams::REGTEST; }\n};\nstatic CRegTestParams regTestParams;\n\nstatic CChainParams *pCurrentParams = &mainParams;\n\nconst CChainParams &Params() {\n    return *pCurrentParams;\n}\n\nvoid SelectParams(CChainParams::Network network) {\n    switch (network) {\n        case CChainParams::MAIN:\n            pCurrentParams = &mainParams;\n            break;\n        case CChainParams::TESTNET:\n            pCurrentParams = &testNetParams;\n            break;\n        case CChainParams::REGTEST:\n            pCurrentParams = &regTestParams;\n            break;\n        default:\n            assert(false && \"Unimplemented network\");\n            return;\n    }\n}\n\nbool SelectParamsFromCommandLine() {\n    bool fRegTest = GetBoolArg(\"-regtest\", false);\n    bool fTestNet = GetBoolArg(\"-testnet\", false);\n\n    if (fTestNet && fRegTest) {\n        return false;\n    }\n\n    if (fRegTest) {\n        SelectParams(CChainParams::REGTEST);\n    } else if (fTestNet) {\n        SelectParams(CChainParams::TESTNET);\n    } else {\n        SelectParams(CChainParams::MAIN);\n    }\n    return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2008-2011, 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\n\/\/ Needed to get rand_s. Don't take any chance, define it right away.\n#if defined _MSC_VER && !defined _CRT_RAND_S\n# define _CRT_RAND_S\n#endif\n\n#include <stdexcept>\n#include <iostream>\n\n#include <libport\/backtrace.hh>\n#include <libport\/cassert>\n#include <libport\/cstdlib>\n#include <libport\/detect-win32.h>\n#include <libport\/exception.hh>\n#include <libport\/foreach.hh>\n#include <libport\/format.hh>\n#include <libport\/sys\/wait.h>\n#include <string>\n\n# ifdef _MSC_VER\n#  include <crtdbg.h> \/\/ _CrtDbgBreak\n#  include <libport\/windows.hh>\n# endif\n\n# if defined __APPLE__\n#  include <crt_externs.h>\n# endif\n\n#ifdef _MSC_VER\n\nextern \"C\"\n{\n  long long\n  strtoll(const char* nptr, char** endptr, int base)\n  {\n    return _strtoi64(nptr, endptr, base);\n  }\n}\n#endif\n\n#if defined _MSC_VER || defined __MINGW32__\n\nnamespace libport\n{\n  const char*\n  getenv(const char* name)\n  {\n    return ::getenv(name);\n  }\n}\n\n#endif\n\nnamespace libport\n{\n  int rand()\n  {\n#if defined _MSC_VER\n    unsigned int res;\n    errno_t err = rand_s(&res);\n    \/\/ FIXME: Actual error handling?\n    assert_eq(err, 0);\n    return res;\n#else\n    return ::rand();\n#endif\n  }\n}\n\n#if defined _MSC_VER || defined __MINGW32__\n\nextern \"C\"\n{\n  int\n  unsetenv(const char* key)\n  {\n    \/\/ Windows refuses 0 as a value.  But passing \"\" actually unsets\n    \/\/ the envvar.\n    return setenv(key, \"\", 1);\n  }\n}\n\n#endif\n\n\/*-------------.\n| getenviron.  |\n`-------------*\/\n\nnamespace libport\n{\n  inline environ_type\n  build_env(char ** envArray)\n  {\n    environ_type res;\n    for (size_t i = 0; envArray[i]; ++i)\n    {\n      std::string str = std::string(envArray[i]);\n      size_t pos = str.find(\"=\");\n      std::string k = str.substr(0, pos);\n      std::string v = str.substr(pos + 1);\n      res[k] = v;\n    }\n    return res;\n  }\n\n  environ_type getenviron()\n  {\n    environ_type res;\n# if defined __APPLE__\n    res = build_env(*_NSGetEnviron());\n# elif defined _MSC_VER || defined __MINGW32__\n    char* environ = GetEnvironmentStrings();\n    char* head = environ;\n    while (size_t s = strlen(environ))\n    {\n      std::string env = std::string(environ, s);\n      size_t pos = env.find(\"=\");\n      std::string k = env.substr(0, pos);\n      std::string v = env.substr(pos + 1);\n      res[k] = v;\n      environ += s + 1;\n    }\n    FreeEnvironmentStrings(head);\n# else\n     res = build_env(environ);\n# endif\n    return res;\n  }\n}\n\n\n\/*--------.\n| abort.  |\n`--------*\/\n\nnamespace libport\n{\n  bool abort_throw_ = false;\n  void abort_throw(bool v)\n  {\n    abort_throw_ = v;\n  }\n  void\n  abort()\n  {\n    if (abort_throw_)\n      throw std::runtime_error(\"abortion\");\n    else\n      foreach(const std::string& str, libport::backtrace())\n        std::cerr << str << std::endl;\n# ifdef _MSC_VER\n    if (getenv(\"_DEBUG_VCXX\"))\n      _CrtDbgBreak();\n    else\n# endif\n      std::abort();\n  }\n\n}\n\n\/*----------.\n| xsystem.  |\n`----------*\/\n\nnamespace libport\n{\n  int\n  system(const std::string& cmd)\n  {\n    int res = ::system(cmd.c_str());\n    if (res == -1)\n      errnoabort(\"system\");\n    return res;\n  }\n\n  void\n  xsystem(const std::string& cmd)\n  {\n    int res = system(cmd);\n    if (!WIFEXITED(res))\n      throw libport::Exception(\"command was signaled\");\n    if (int rv = WEXITSTATUS(res))\n      throw Exception(format(\"command failed: %s\", rv));\n  }\n}\n<commit_msg>getenviron: minor factoring.<commit_after>\/*\n * Copyright (C) 2008-2011, 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\n\/\/ Needed to get rand_s. Don't take any chance, define it right away.\n#if defined _MSC_VER && !defined _CRT_RAND_S\n# define _CRT_RAND_S\n#endif\n\n#include <stdexcept>\n#include <iostream>\n\n#include <libport\/backtrace.hh>\n#include <libport\/cassert>\n#include <libport\/cstdlib>\n#include <libport\/detect-win32.h>\n#include <libport\/exception.hh>\n#include <libport\/foreach.hh>\n#include <libport\/format.hh>\n#include <libport\/sys\/wait.h>\n#include <string>\n\n# ifdef _MSC_VER\n#  include <crtdbg.h> \/\/ _CrtDbgBreak\n#  include <libport\/windows.hh>\n# endif\n\n# if defined __APPLE__\n#  include <crt_externs.h>\n# endif\n\n#ifdef _MSC_VER\n\nextern \"C\"\n{\n  long long\n  strtoll(const char* nptr, char** endptr, int base)\n  {\n    return _strtoi64(nptr, endptr, base);\n  }\n}\n#endif\n\n#if defined _MSC_VER || defined __MINGW32__\n\nnamespace libport\n{\n  const char*\n  getenv(const char* name)\n  {\n    return ::getenv(name);\n  }\n}\n\n#endif\n\nnamespace libport\n{\n  int rand()\n  {\n#if defined _MSC_VER\n    unsigned int res;\n    errno_t err = rand_s(&res);\n    \/\/ FIXME: Actual error handling?\n    assert_eq(err, 0);\n    return res;\n#else\n    return ::rand();\n#endif\n  }\n}\n\n#if defined _MSC_VER || defined __MINGW32__\n\nextern \"C\"\n{\n  int\n  unsetenv(const char* key)\n  {\n    \/\/ Windows refuses 0 as a value.  But passing \"\" actually unsets\n    \/\/ the envvar.\n    return setenv(key, \"\", 1);\n  }\n}\n\n#endif\n\n\/*-------------.\n| getenviron.  |\n`-------------*\/\n\nnamespace libport\n{\n\n  inline\n  void\n  env_add(environ_type& env, const char *var)\n  {\n    const char* eq = strchr(var, '=');\n    env[std::string(var, eq - var)] = std::string(eq + 1);\n  }\n\n  inline\n  environ_type\n  env_build(char **env)\n  {\n    environ_type res;\n    for (size_t i = 0; env[i]; ++i)\n      env_add(res, env[i]);\n    return res;\n  }\n\n  environ_type\n  getenviron()\n  {\n    environ_type res;\n# if defined __APPLE__\n    res = env_build(*_NSGetEnviron());\n# elif defined _MSC_VER || defined __MINGW32__\n    char* environ = GetEnvironmentStrings();\n    for (char* cp = environ; *cp; cp += strlen(cp) + 1)\n      env_add(res, cp);\n    FreeEnvironmentStrings(environ);\n# else\n     res = env_build(environ);\n# endif\n    return res;\n  }\n}\n\n\n\/*--------.\n| abort.  |\n`--------*\/\n\nnamespace libport\n{\n  bool abort_throw_ = false;\n  void abort_throw(bool v)\n  {\n    abort_throw_ = v;\n  }\n  void\n  abort()\n  {\n    if (abort_throw_)\n      throw std::runtime_error(\"abortion\");\n    else\n      foreach(const std::string& str, libport::backtrace())\n        std::cerr << str << std::endl;\n# ifdef _MSC_VER\n    if (getenv(\"_DEBUG_VCXX\"))\n      _CrtDbgBreak();\n    else\n# endif\n      std::abort();\n  }\n\n}\n\n\/*----------.\n| xsystem.  |\n`----------*\/\n\nnamespace libport\n{\n  int\n  system(const std::string& cmd)\n  {\n    int res = ::system(cmd.c_str());\n    if (res == -1)\n      errnoabort(\"system\");\n    return res;\n  }\n\n  void\n  xsystem(const std::string& cmd)\n  {\n    int res = system(cmd);\n    if (!WIFEXITED(res))\n      throw libport::Exception(\"command was signaled\");\n    if (int rv = WEXITSTATUS(res))\n      throw Exception(format(\"command failed: %s\", rv));\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-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 \"chainparams.h\"\n\n#include \"assert.h\"\n#include \"core.h\"\n#include \"protocol.h\"\n#include \"util.h\"\n\n#include <boost\/assign\/list_of.hpp>\n\nusing namespace boost::assign;\n\n\/\/\n\/\/ Main network\n\/\/\n\nunsigned int pnSeed[] =\n{\n  \t0xd45e1c45, 0xd84ed0d1, 0xc7153b25, 0xfa18e760, 0x5a0a3d6c, 0x1bc248ce, 0x6ce7fb53, 0x68daaa6b,\n    0xd2fdd25b, 0xb26ed0d1, 0x5a4abf47, 0xce6c2f32, 0x84b0095b, 0x11942118, 0x4b909d5d, 0x7de6c448,\n    0xbba5b5be, 0x161b32d4, 0xd1cf49b2, 0xd1cf49b2, 0x161b32d4, 0xff2b2d18, 0x08b2f1c0, 0xce844c45,\n    0xd2fdd25b, 0x0d98854f, 0xd54886bc, 0x5998b549, 0x93d1ef18, 0xe8b1e2bc, 0xc10bc532, 0x26aa4a4c, \n    0xa5ec6d59, 0xcb3a0cb0, 0x400f84de, 0xe29c7b46, 0x82da5c17, 0xd48b4c90, 0x5a4824b9, 0x5a0a3d6c, \n    0xc7131c73, 0x88d0a52e, 0x56853742, 0xb0940b48, 0x623c966b\n};\n\nclass CMainParams : public CChainParams {\npublic:\n    CMainParams() {\n        \/\/ The message start string is designed to be unlikely to occur in normal data.\n        \/\/ The characters are rarely used upper ASCII, not valid as UTF-8, and produce\n        \/\/ a large 4-byte int at any alignment.\n        pchMessageStart[0] = 0xa1;\n        pchMessageStart[1] = 0xa2;\n        pchMessageStart[2] = 0xe2;\n        pchMessageStart[3] = 0xf2;\n        vAlertPubKey = ParseHex(\"04f7b028664bb03ce4a1bc4e0e97f8748c9fffc8058b3ff6b586722a52519e4990021467c4e187149f3b75c98696848052d7e4369bbcff9eb0ed198b5c4e666d06\");\n        nDefaultPort = 8224;\n        nRPCPort = 8223;\n        bnProofOfWorkLimit = CBigNum(~uint256(0) >> 20);\n        nSubsidyHalvingInterval = 770000;\n\n        \/\/ Build the genesis block. Note that the output of the genesis coinbase cannot\n        \/\/ be spent as it did not originally exist in the database.\n        \/\/\n        \/\/ CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)\n        \/\/   CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)\n        \/\/     CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)\n        \/\/     CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)\n        \/\/   vMerkleTree: 4a5e1e\n        const char* pszTimestamp = \"The Times 03\/Jan\/2009 Chancellor on brink of second bailout for banks\";\n        CTransaction txNew;\n        txNew.vin.resize(1);\n        txNew.vout.resize(1);\n        txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));\n        txNew.vout[0].nValue = 50 * COIN;\n        txNew.vout[0].scriptPubKey = CScript() << ParseHex(\"04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f\") << OP_CHECKSIG;\n        genesis.vtx.push_back(txNew);\n        genesis.hashPrevBlock = 0;\n        genesis.hashMerkleRoot = genesis.BuildMerkleTree();\n        genesis.nVersion = 1;\n        genesis.nTime    = 1231006505;\n        genesis.nBits    = 0x1d00ffff;\n        genesis.nNonce   = 2083236893;\n\n        hashGenesisBlock = genesis.GetHash();\n        assert(hashGenesisBlock == uint256(\"0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f\"));\n        assert(genesis.hashMerkleRoot == uint256(\"0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b\"));\n\n        vSeeds.push_back(CDNSSeedData(\"globalboost.info\", \"seed.globalboost.info\"));\n\t\tvSeeds.push_back(CDNSSeedData(\"globalboost.info\", \"dnsseed4.globalboost.info\"));\n\n        base58Prefixes[PUBKEY_ADDRESS] = list_of(35);\n        base58Prefixes[SCRIPT_ADDRESS] = list_of(5);\n        base58Prefixes[SECRET_KEY] =     list_of(128);\n        base58Prefixes[EXT_PUBLIC_KEY] = list_of(0x04)(0x88)(0xB2)(0x1E);\n        base58Prefixes[EXT_SECRET_KEY] = list_of(0x04)(0x88)(0xAD)(0xE4);\n\n        \/\/ Convert the pnSeeds array into usable address objects.\n        for (unsigned int i = 0; i < ARRAYLEN(pnSeed); i++)\n        {\n            \/\/ It'll only connect to one or two seed nodes because once it connects,\n            \/\/ it'll get a pile of addresses with newer timestamps.\n            \/\/ Seed nodes are given a random 'last seen time' of between one and two\n            \/\/ weeks ago.\n            const int64_t nOneWeek = 7*24*60*60;\n            struct in_addr ip;\n            memcpy(&ip, &pnSeed[i], sizeof(ip));\n            CAddress addr(CService(ip, GetDefaultPort()));\n            addr.nTime = GetTime() - GetRand(nOneWeek) - nOneWeek;\n            vFixedSeeds.push_back(addr);\n        }\n    }\n\n    virtual const CBlock& GenesisBlock() const { return genesis; }\n    virtual Network NetworkID() const { return CChainParams::MAIN; }\n\n    virtual const vector<CAddress>& FixedSeeds() const {\n        return vFixedSeeds;\n    }\nprotected:\n    CBlock genesis;\n    vector<CAddress> vFixedSeeds;\n};\nstatic CMainParams mainParams;\n\n\n\/\/\n\/\/ Testnet (v3)\n\/\/\nclass CTestNetParams : public CMainParams {\npublic:\n    CTestNetParams() {\n        \/\/ The message start string is designed to be unlikely to occur in normal data.\n        \/\/ The characters are rarely used upper ASCII, not valid as UTF-8, and produce\n        \/\/ a large 4-byte int at any alignment.\n        pchMessageStart[0] = 'g';\n        pchMessageStart[1] = 'b';\n        pchMessageStart[2] = 's';\n        pchMessageStart[3] = 't';\n        vAlertPubKey = ParseHex(\"04dc4ef818cea1cc5cc438257283ef077676b320dd63d7f43ecc4e5563f13440ade77b02d27a9b3c803c1151ce35721b8567a665667d220472b7e5a8b73dde16f4\");\n        nDefaultPort = 18224;\n        nRPCPort = 18223;\n        strDataDir = \"testnet3\";\n\n        \/\/ Modify the testnet genesis block so the timestamp is valid for a later start.\n        genesis.nTime = 1296688602;\n        genesis.nNonce = 414098458;\n        hashGenesisBlock = genesis.GetHash();\n        assert(hashGenesisBlock == uint256(\"0x000000000933ea01ad0ee984209779baaec3ced90fa3f408719526f8d77f4943\"));\n\n        vFixedSeeds.clear();\n        vSeeds.clear();\n        vSeeds.push_back(CDNSSeedData(\"globalboost.info\", \"testnet-seed.globalboost.info\"));\n\n        base58Prefixes[PUBKEY_ADDRESS] = list_of(111);\n        base58Prefixes[SCRIPT_ADDRESS] = list_of(196);\n        base58Prefixes[SECRET_KEY]     = list_of(239);\n        base58Prefixes[EXT_PUBLIC_KEY] = list_of(0x04)(0x35)(0x87)(0xCF);\n        base58Prefixes[EXT_SECRET_KEY] = list_of(0x04)(0x35)(0x83)(0x94);\n    }\n    virtual Network NetworkID() const { return CChainParams::TESTNET; }\n};\nstatic CTestNetParams testNetParams;\n\n\n\/\/\n\/\/ Regression test\n\/\/\nclass CRegTestParams : public CTestNetParams {\npublic:\n    CRegTestParams() {\n        pchMessageStart[0] = 0xfa;\n        pchMessageStart[1] = 0xbf;\n        pchMessageStart[2] = 0xb5;\n        pchMessageStart[3] = 0xda;\n        nSubsidyHalvingInterval = 150;\n        bnProofOfWorkLimit = CBigNum(~uint256(0) >> 1);\n        genesis.nTime = 1296688602;\n        genesis.nBits = 0x207fffff;\n        genesis.nNonce = 2;\n        hashGenesisBlock = genesis.GetHash();\n        nDefaultPort = 18444;\n        strDataDir = \"regtest\";\n        assert(hashGenesisBlock == uint256(\"0x0f9188f13cb7b2c71f2a335e3a4fc328bf5beb436012afca590b1a11466e2206\"));\n\n        vSeeds.clear();  \/\/ Regtest mode doesn't have any DNS seeds.\n    }\n\n    virtual bool RequireRPCPassword() const { return false; }\n    virtual Network NetworkID() const { return CChainParams::REGTEST; }\n};\nstatic CRegTestParams regTestParams;\n\nstatic CChainParams *pCurrentParams = &mainParams;\n\nconst CChainParams &Params() {\n    return *pCurrentParams;\n}\n\nvoid SelectParams(CChainParams::Network network) {\n    switch (network) {\n        case CChainParams::MAIN:\n            pCurrentParams = &mainParams;\n            break;\n        case CChainParams::TESTNET:\n            pCurrentParams = &testNetParams;\n            break;\n        case CChainParams::REGTEST:\n            pCurrentParams = &regTestParams;\n            break;\n        default:\n            assert(false && \"Unimplemented network\");\n            return;\n    }\n}\n\nbool SelectParamsFromCommandLine() {\n    bool fRegTest = GetBoolArg(\"-regtest\", false);\n    bool fTestNet = GetBoolArg(\"-testnet\", false);\n\n    if (fTestNet && fRegTest) {\n        return false;\n    }\n\n    if (fRegTest) {\n        SelectParams(CChainParams::REGTEST);\n    } else if (fTestNet) {\n        SelectParams(CChainParams::TESTNET);\n    } else {\n        SelectParams(CChainParams::MAIN);\n    }\n    return true;\n}\n<commit_msg>Revert \"pow limit changed\"<commit_after>\/\/ Copyright (c) 2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-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 \"chainparams.h\"\n\n#include \"assert.h\"\n#include \"core.h\"\n#include \"protocol.h\"\n#include \"util.h\"\n\n#include <boost\/assign\/list_of.hpp>\n\nusing namespace boost::assign;\n\n\/\/\n\/\/ Main network\n\/\/\n\nunsigned int pnSeed[] =\n{\n  \t0xd45e1c45, 0xd84ed0d1, 0xc7153b25, 0xfa18e760, 0x5a0a3d6c, 0x1bc248ce, 0x6ce7fb53, 0x68daaa6b,\n    0xd2fdd25b, 0xb26ed0d1, 0x5a4abf47, 0xce6c2f32, 0x84b0095b, 0x11942118, 0x4b909d5d, 0x7de6c448,\n    0xbba5b5be, 0x161b32d4, 0xd1cf49b2, 0xd1cf49b2, 0x161b32d4, 0xff2b2d18, 0x08b2f1c0, 0xce844c45,\n    0xd2fdd25b, 0x0d98854f, 0xd54886bc, 0x5998b549, 0x93d1ef18, 0xe8b1e2bc, 0xc10bc532, 0x26aa4a4c, \n    0xa5ec6d59, 0xcb3a0cb0, 0x400f84de, 0xe29c7b46, 0x82da5c17, 0xd48b4c90, 0x5a4824b9, 0x5a0a3d6c, \n    0xc7131c73, 0x88d0a52e, 0x56853742, 0xb0940b48, 0x623c966b\n};\n\nclass CMainParams : public CChainParams {\npublic:\n    CMainParams() {\n        \/\/ The message start string is designed to be unlikely to occur in normal data.\n        \/\/ The characters are rarely used upper ASCII, not valid as UTF-8, and produce\n        \/\/ a large 4-byte int at any alignment.\n        pchMessageStart[0] = 0xa1;\n        pchMessageStart[1] = 0xa2;\n        pchMessageStart[2] = 0xe2;\n        pchMessageStart[3] = 0xf2;\n        vAlertPubKey = ParseHex(\"04f7b028664bb03ce4a1bc4e0e97f8748c9fffc8058b3ff6b586722a52519e4990021467c4e187149f3b75c98696848052d7e4369bbcff9eb0ed198b5c4e666d06\");\n        nDefaultPort = 8224;\n        nRPCPort = 8223;\n        bnProofOfWorkLimit = CBigNum(~uint256(0) >> 32);\n        nSubsidyHalvingInterval = 770000;\n\n        \/\/ Build the genesis block. Note that the output of the genesis coinbase cannot\n        \/\/ be spent as it did not originally exist in the database.\n        \/\/\n        \/\/ CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)\n        \/\/   CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)\n        \/\/     CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)\n        \/\/     CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)\n        \/\/   vMerkleTree: 4a5e1e\n        const char* pszTimestamp = \"The Times 03\/Jan\/2009 Chancellor on brink of second bailout for banks\";\n        CTransaction txNew;\n        txNew.vin.resize(1);\n        txNew.vout.resize(1);\n        txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));\n        txNew.vout[0].nValue = 50 * COIN;\n        txNew.vout[0].scriptPubKey = CScript() << ParseHex(\"04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f\") << OP_CHECKSIG;\n        genesis.vtx.push_back(txNew);\n        genesis.hashPrevBlock = 0;\n        genesis.hashMerkleRoot = genesis.BuildMerkleTree();\n        genesis.nVersion = 1;\n        genesis.nTime    = 1231006505;\n        genesis.nBits    = 0x1d00ffff;\n        genesis.nNonce   = 2083236893;\n\n        hashGenesisBlock = genesis.GetHash();\n        assert(hashGenesisBlock == uint256(\"0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f\"));\n        assert(genesis.hashMerkleRoot == uint256(\"0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b\"));\n\n        vSeeds.push_back(CDNSSeedData(\"globalboost.info\", \"seed.globalboost.info\"));\n\t\tvSeeds.push_back(CDNSSeedData(\"globalboost.info\", \"dnsseed4.globalboost.info\"));\n\n        base58Prefixes[PUBKEY_ADDRESS] = list_of(35);\n        base58Prefixes[SCRIPT_ADDRESS] = list_of(5);\n        base58Prefixes[SECRET_KEY] =     list_of(128);\n        base58Prefixes[EXT_PUBLIC_KEY] = list_of(0x04)(0x88)(0xB2)(0x1E);\n        base58Prefixes[EXT_SECRET_KEY] = list_of(0x04)(0x88)(0xAD)(0xE4);\n\n        \/\/ Convert the pnSeeds array into usable address objects.\n        for (unsigned int i = 0; i < ARRAYLEN(pnSeed); i++)\n        {\n            \/\/ It'll only connect to one or two seed nodes because once it connects,\n            \/\/ it'll get a pile of addresses with newer timestamps.\n            \/\/ Seed nodes are given a random 'last seen time' of between one and two\n            \/\/ weeks ago.\n            const int64_t nOneWeek = 7*24*60*60;\n            struct in_addr ip;\n            memcpy(&ip, &pnSeed[i], sizeof(ip));\n            CAddress addr(CService(ip, GetDefaultPort()));\n            addr.nTime = GetTime() - GetRand(nOneWeek) - nOneWeek;\n            vFixedSeeds.push_back(addr);\n        }\n    }\n\n    virtual const CBlock& GenesisBlock() const { return genesis; }\n    virtual Network NetworkID() const { return CChainParams::MAIN; }\n\n    virtual const vector<CAddress>& FixedSeeds() const {\n        return vFixedSeeds;\n    }\nprotected:\n    CBlock genesis;\n    vector<CAddress> vFixedSeeds;\n};\nstatic CMainParams mainParams;\n\n\n\/\/\n\/\/ Testnet (v3)\n\/\/\nclass CTestNetParams : public CMainParams {\npublic:\n    CTestNetParams() {\n        \/\/ The message start string is designed to be unlikely to occur in normal data.\n        \/\/ The characters are rarely used upper ASCII, not valid as UTF-8, and produce\n        \/\/ a large 4-byte int at any alignment.\n        pchMessageStart[0] = 'g';\n        pchMessageStart[1] = 'b';\n        pchMessageStart[2] = 's';\n        pchMessageStart[3] = 't';\n        vAlertPubKey = ParseHex(\"04dc4ef818cea1cc5cc438257283ef077676b320dd63d7f43ecc4e5563f13440ade77b02d27a9b3c803c1151ce35721b8567a665667d220472b7e5a8b73dde16f4\");\n        nDefaultPort = 18224;\n        nRPCPort = 18223;\n        strDataDir = \"testnet3\";\n\n        \/\/ Modify the testnet genesis block so the timestamp is valid for a later start.\n        genesis.nTime = 1296688602;\n        genesis.nNonce = 414098458;\n        hashGenesisBlock = genesis.GetHash();\n        assert(hashGenesisBlock == uint256(\"0x000000000933ea01ad0ee984209779baaec3ced90fa3f408719526f8d77f4943\"));\n\n        vFixedSeeds.clear();\n        vSeeds.clear();\n        vSeeds.push_back(CDNSSeedData(\"globalboost.info\", \"testnet-seed.globalboost.info\"));\n\n        base58Prefixes[PUBKEY_ADDRESS] = list_of(111);\n        base58Prefixes[SCRIPT_ADDRESS] = list_of(196);\n        base58Prefixes[SECRET_KEY]     = list_of(239);\n        base58Prefixes[EXT_PUBLIC_KEY] = list_of(0x04)(0x35)(0x87)(0xCF);\n        base58Prefixes[EXT_SECRET_KEY] = list_of(0x04)(0x35)(0x83)(0x94);\n    }\n    virtual Network NetworkID() const { return CChainParams::TESTNET; }\n};\nstatic CTestNetParams testNetParams;\n\n\n\/\/\n\/\/ Regression test\n\/\/\nclass CRegTestParams : public CTestNetParams {\npublic:\n    CRegTestParams() {\n        pchMessageStart[0] = 0xfa;\n        pchMessageStart[1] = 0xbf;\n        pchMessageStart[2] = 0xb5;\n        pchMessageStart[3] = 0xda;\n        nSubsidyHalvingInterval = 150;\n        bnProofOfWorkLimit = CBigNum(~uint256(0) >> 1);\n        genesis.nTime = 1296688602;\n        genesis.nBits = 0x207fffff;\n        genesis.nNonce = 2;\n        hashGenesisBlock = genesis.GetHash();\n        nDefaultPort = 18444;\n        strDataDir = \"regtest\";\n        assert(hashGenesisBlock == uint256(\"0x0f9188f13cb7b2c71f2a335e3a4fc328bf5beb436012afca590b1a11466e2206\"));\n\n        vSeeds.clear();  \/\/ Regtest mode doesn't have any DNS seeds.\n    }\n\n    virtual bool RequireRPCPassword() const { return false; }\n    virtual Network NetworkID() const { return CChainParams::REGTEST; }\n};\nstatic CRegTestParams regTestParams;\n\nstatic CChainParams *pCurrentParams = &mainParams;\n\nconst CChainParams &Params() {\n    return *pCurrentParams;\n}\n\nvoid SelectParams(CChainParams::Network network) {\n    switch (network) {\n        case CChainParams::MAIN:\n            pCurrentParams = &mainParams;\n            break;\n        case CChainParams::TESTNET:\n            pCurrentParams = &testNetParams;\n            break;\n        case CChainParams::REGTEST:\n            pCurrentParams = &regTestParams;\n            break;\n        default:\n            assert(false && \"Unimplemented network\");\n            return;\n    }\n}\n\nbool SelectParamsFromCommandLine() {\n    bool fRegTest = GetBoolArg(\"-regtest\", false);\n    bool fTestNet = GetBoolArg(\"-testnet\", false);\n\n    if (fTestNet && fRegTest) {\n        return false;\n    }\n\n    if (fRegTest) {\n        SelectParams(CChainParams::REGTEST);\n    } else if (fTestNet) {\n        SelectParams(CChainParams::TESTNET);\n    } else {\n        SelectParams(CChainParams::MAIN);\n    }\n    return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <opencv2\/core.hpp>\n#include <opencv2\/videoio.hpp>\n#include <opencv2\/highgui.hpp>\n#include <opencv2\/imgproc.hpp>  \/\/ cv::Canny()\n#include <iostream>\n\nusing namespace cv;\nusing std::cout; using std::cerr; using std::endl;\n\nint main(int, char**)\n{\n    Mat frame;\n    cout << \"Opening camera...\" << endl;\n    VideoCapture capture(0); \/\/ open the first camera\n    if (!capture.isOpened())\n    {\n        cerr << \"ERROR: Can't initialize camera capture\" << endl;\n        return 1;\n    }\n\n    cout << \"Frame width: \" << capture.get(CAP_PROP_FRAME_WIDTH) << endl;\n    cout << \"     height: \" << capture.get(CAP_PROP_FRAME_HEIGHT) << endl;\n    cout << \"Capturing FPS: \" << capture.get(CAP_PROP_FPS) << endl;\n\n    cout << endl << \"Press 'ESC' to quit, 'space' to toggle frame processing\" << endl;\n    cout << endl << \"Start grabbing...\" << endl;\n\n    size_t nFrames = 0;\n    short enableProcessing = 0;\n    int64 t0 = cv::getTickCount();\n    int64 processingTime = 0;\n    for (;;)\n    {\n        capture >> frame; \/\/ read the next frame from camera\n        if (frame.empty())\n        {\n            cerr << \"ERROR: Can't grab camera frame.\" << endl;\n            break;\n        }\n        nFrames++;\n        if (nFrames % 10 == 0)\n        {\n            const int N = 10;\n            int64 t1 = cv::getTickCount();\n            cout << \"Frames captured: \" << cv::format(\"%5lld\", (long long int)nFrames)\n                 << \"    Average FPS: \" << cv::format(\"%9.1f\", (double)getTickFrequency() * N \/ (t1 - t0))\n                 << \"    Average time per frame: \" << cv::format(\"%9.2f ms\", (double)(t1 - t0) * 1000.0f \/ (N * getTickFrequency()))\n                 << \"    Average processing time: \" << cv::format(\"%9.2f ms\", (double)(processingTime) * 1000.0f \/ (N * getTickFrequency()))\n                 << std::endl;\n            t0 = t1;\n            processingTime = 0;\n        }\n        switch (enableProcessing) {\n\tcase 0:\n            imshow(\"Frame\", frame);\n\t    break;\n\tcase 1:\n            int64 tp0 = cv::getTickCount();\n            Mat processed;\n            cv::Canny(frame, processed, 400, 1000, 5);\n            processingTime += cv::getTickCount() - tp0;\n            imshow(\"Frame\", processed);\n\t    break;\n        }\n        int key = waitKey(1);\n        if (key == 27\/*ESC*\/)\n            break;\n        if (key == 32\/*SPACE*\/)\n        {\n            if (enableProcessing)\n\t\tenableProcessing = 0;\n\t    else\n\t\tenableProcessing = 1;\n            cout << \"Enable frame processing ('space' key): \" << enableProcessing << endl;\n        }\n        if (key == 49\/* 1 *\/)\n        {\n        }\n        if (key == 50\/* 2 *\/)\n        {\n        }\n    }\n    std::cout << \"Number of captured frames: \" << nFrames << endl;\n    return nFrames > 0 ? 0 : 1;\n}\n<commit_msg>add code to remove bg<commit_after>#include <opencv2\/core.hpp>\n#include <opencv2\/videoio.hpp>\n#include <opencv2\/highgui.hpp>\n#include <opencv2\/imgproc.hpp>  \/\/ cv::Canny()\n#include <opencv2\/imgcodecs.hpp>\n#include <opencv2\/video.hpp>\n#include <iostream>\n\nusing namespace cv;\nusing std::cout; using std::cerr; using std::endl;\n\nint main(int, char**)\n{\n    Mat frame, fgMask;\n    Mat processed;\n    int64 tp0;\n\n    \/\/create Background Subtractor objects\n    Ptr<BackgroundSubtractor> pBackSub;\n\n    pBackSub = createBackgroundSubtractorMOG2();\n    \/\/pBackSub = createBackgroundSubtractorKNN();\n\n    cout << \"Opening camera...\" << endl;\n    VideoCapture capture(0); \/\/ open the first camera\n\n    if (!capture.isOpened())\n    {\n        cerr << \"ERROR: Can't initialize camera capture\" << endl;\n        return 1;\n    }\n\n    cout << \"Frame width: \" << capture.get(CAP_PROP_FRAME_WIDTH) << endl;\n    cout << \"     height: \" << capture.get(CAP_PROP_FRAME_HEIGHT) << endl;\n    cout << \"Capturing FPS: \" << capture.get(CAP_PROP_FPS) << endl;\n\n    cout << endl << \"Press 'ESC' to quit, 'space' to toggle frame processing\" << endl;\n    cout << endl << \"Start grabbing...\" << endl;\n\n    size_t nFrames = 0;\n    short enableProcessing = 0;\n    int64 t0 = cv::getTickCount();\n    int64 processingTime = 0;\n    for (;;)\n    {\n        capture >> frame; \/\/ read the next frame from camera\n        if (frame.empty())\n        {\n            cerr << \"ERROR: Can't grab camera frame.\" << endl;\n            break;\n        }\n        nFrames++;\n        if (nFrames % 10 == 0)\n        {\n            const int N = 10;\n            int64 t1 = cv::getTickCount();\n            cout << \"Frames captured: \" << cv::format(\"%5lld\", (long long int)nFrames)\n                 << \"    Average FPS: \" << cv::format(\"%9.1f\", (double)getTickFrequency() * N \/ (t1 - t0))\n                 << \"    Average time per frame: \" << cv::format(\"%9.2f ms\", (double)(t1 - t0) * 1000.0f \/ (N * getTickFrequency()))\n                 << \"    Average processing time: \" << cv::format(\"%9.2f ms\", (double)(processingTime) * 1000.0f \/ (N * getTickFrequency()))\n                 << std::endl;\n            t0 = t1;\n            processingTime = 0;\n        }\n        switch (enableProcessing) {\n\tcase 0:\n            imshow(\"Frame\", frame);\n\t    break;\n\tcase 1:\n            tp0 = cv::getTickCount();\n            cv::Canny(frame, processed, 400, 1000, 5);\n            processingTime += cv::getTickCount() - tp0;\n            imshow(\"Frame\", processed);\n\t    break;\n\tcase 2:\n\t    \/\/update the background model\n            tp0 = cv::getTickCount();\n            pBackSub->apply(frame, fgMask);\n            processingTime += cv::getTickCount() - tp0;\n            imshow(\"Frame\", fgMask);\n\t    break;\n        }\n        int key = waitKey(1);\n        if (key == 27\/*ESC*\/ || key == 'q')\n            break;\n        if (key == 32\/*SPACE*\/)\n        {\n            if (enableProcessing)\n\t\tenableProcessing = 0;\n\t    else\n\t\tenableProcessing = 1;\n            cout << \"Enable frame processing ('space' key): \" << enableProcessing << endl;\n        }\n        if (key == 49\/* 1 *\/)\n        {\n\t\tenableProcessing = 2;\n        }\n        if (key == 50\/* 2 *\/)\n        {\n\t\tcout << \"dos\" << endl;\n        }\n        if (key == '0')\n        {\n\t\tenableProcessing = 0;\n        }\n    }\n    std::cout << \"Number of captured frames: \" << nFrames << endl;\n    return nFrames > 0 ? 0 : 1;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2013 - 2015, German Neuroinformatics Node (G-Node)\n\/\/\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted under the terms of the BSD License. See\n\/\/ LICENSE file in the root of the Project.\n\n#include <iostream>\n#include \"DirectoryWithAttributes.hpp\"\n\nnamespace bfs = boost::filesystem;\n\nnamespace nix {\nnamespace file {\n\nDirectoryWithAttributes::DirectoryWithAttributes(const bfs::path &location, FileMode mode, bool checkHeader)\n    : Directory(location, mode) {\n    if (checkHeader && mode < FileMode::ReadWrite) {\n        std::cerr << \"checkHeader\" << std::endl;\n        if (!bfs::exists(location \/ bfs::path(\"attributes\"))) {\n           throw nix::InvalidFile(\"DirectoryWithAttributes\");\n        } else {\n            AttributesFS a(location, mode);\n            bool check = true;\n            std::vector<int> version;\n            std::string str;\n            if (a.has(\"format\"))  {\n                getAttr(\"format\", str);\n                if (str != FILE_FORMAT) {\n                    check = false;\n                }\n            } else {\n                check = false;\n            }\n            if (a.has(\"version\")) {\n                getAttr(\"version\", version);\n                if (version != FILE_VERSION) {\n                    check = false;\n                }\n            } else {\n                check = false;\n            }\n            throw nix::InvalidFile(\"DirectoryWithAttributes\");\n        }\n    }\n    attributes = AttributesFS(location, mode);\n}\n\nDirectoryWithAttributes::DirectoryWithAttributes(const std::string &location, FileMode mode, bool checkHeader)\n    : DirectoryWithAttributes(bfs::path(location.c_str()), mode, checkHeader)\n{\n}\n\nbool DirectoryWithAttributes::hasAttr(const std::string &name) const  {\n    return attributes.has(name);\n}\n\nvoid DirectoryWithAttributes::removeAttr(const std::string &name) {\n    attributes.remove(name);\n}\n\nvoid DirectoryWithAttributes::removeAll() {\n    Directory::removeAll();\n    attributes = AttributesFS(location(), fileMode());\n}\n\nvoid DirectoryWithAttributes::createLink(const bfs::path &linker) {\n    std::vector<std::string> links;\n    if (hasAttr(\"links\")) {\n        getAttr(\"links\", links);\n    }\n    bfs::create_directory_symlink(bfs::path(location()), linker);\n    links.push_back(linker.string());\n    setAttr(\"links\", links);\n}\n\nvoid DirectoryWithAttributes::unlink(const bfs::path &linker) {\n    std::vector<std::string> links, active_links;\n    if (hasAttr(\"links\")) {\n        getAttr(\"links\", links);\n    }\n\n    for (auto &l : links) {\n        if (l != linker.string()) {\n            active_links.push_back(l);\n        }\n    }\n    setAttr(\"links\", active_links);\n}\n\n\nbool DirectoryWithAttributes::isValid() const {\n    bfs::path attr_path = \"attributes\";\n    return  bfs::exists(location()) && \n            bfs::exists(location() \/ attr_path);\n}\n\n\n} \/\/ nix::file\n} \/\/ nix\n<commit_msg>removes cerr output, actually use check variable in header checking<commit_after>\/\/ Copyright (c) 2013 - 2015, German Neuroinformatics Node (G-Node)\n\/\/\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted under the terms of the BSD License. See\n\/\/ LICENSE file in the root of the Project.\n\n#include <iostream>\n#include \"DirectoryWithAttributes.hpp\"\n\nnamespace bfs = boost::filesystem;\n\nnamespace nix {\nnamespace file {\n\nDirectoryWithAttributes::DirectoryWithAttributes(const bfs::path &location, FileMode mode, bool checkHeader)\n    : Directory(location, mode) {\n    if (checkHeader && mode < FileMode::ReadWrite) {\n        if (!bfs::exists(location \/ bfs::path(\"attributes\"))) {\n           throw nix::InvalidFile(\"DirectoryWithAttributes\");\n        } else {\n            AttributesFS a(location, mode);\n            bool check = true;\n            std::vector<int> version;\n            std::string str;\n            if (a.has(\"format\"))  {\n                getAttr(\"format\", str);\n                if (str != FILE_FORMAT) {\n                    check = false;\n                }\n            } else {\n                check = false;\n            }\n            if (a.has(\"version\")) {\n                getAttr(\"version\", version);\n                if (version != FILE_VERSION) {\n                    check = false;\n                }\n            } else {\n                check = false;\n            }\n            if (!check)\n                throw nix::InvalidFile(\"DirectoryWithAttributes\");\n        }\n    }\n    attributes = AttributesFS(location, mode);\n}\n\nDirectoryWithAttributes::DirectoryWithAttributes(const std::string &location, FileMode mode, bool checkHeader)\n    : DirectoryWithAttributes(bfs::path(location.c_str()), mode, checkHeader)\n{\n}\n\nbool DirectoryWithAttributes::hasAttr(const std::string &name) const  {\n    return attributes.has(name);\n}\n\nvoid DirectoryWithAttributes::removeAttr(const std::string &name) {\n    attributes.remove(name);\n}\n\nvoid DirectoryWithAttributes::removeAll() {\n    Directory::removeAll();\n    attributes = AttributesFS(location(), fileMode());\n}\n\nvoid DirectoryWithAttributes::createLink(const bfs::path &linker) {\n    std::vector<std::string> links;\n    if (hasAttr(\"links\")) {\n        getAttr(\"links\", links);\n    }\n    bfs::create_directory_symlink(bfs::path(location()), linker);\n    links.push_back(linker.string());\n    setAttr(\"links\", links);\n}\n\nvoid DirectoryWithAttributes::unlink(const bfs::path &linker) {\n    std::vector<std::string> links, active_links;\n    if (hasAttr(\"links\")) {\n        getAttr(\"links\", links);\n    }\n\n    for (auto &l : links) {\n        if (l != linker.string()) {\n            active_links.push_back(l);\n        }\n    }\n    setAttr(\"links\", active_links);\n}\n\n\nbool DirectoryWithAttributes::isValid() const {\n    bfs::path attr_path = \"attributes\";\n    return  bfs::exists(location()) && \n            bfs::exists(location() \/ attr_path);\n}\n\n\n} \/\/ nix::file\n} \/\/ nix\n<|endoftext|>"}
{"text":"<commit_before>#include <Halide.h>\n\n#include <stdio.h>\n\n#ifdef _WIN32\nextern \"C\" bool QueryPerformanceCounter(uint64_t *);\nextern \"C\" bool QueryPerformanceFrequency(uint64_t *);\ndouble currentTime() {\n    uint64_t t, freq;\n    QueryPerformanceCounter(&t);\n    QueryPerformanceFrequency(&freq);\n    return (t * 1000.0) \/ freq;\n}\n#else\n#include <sys\/time.h>\ndouble currentTime() {\n    timeval t;\n    gettimeofday(&t, NULL);\n    return t.tv_sec * 1000.0 + t.tv_usec \/ 1000.0f;\n}\n#endif\n\nusing namespace Halide;\n\nImage<uint16_t> input;\nImage<uint16_t> output;\n\n#define MIN 1\n#define MAX 1020\n\ndouble test(Func f, bool test_correctness = true) {\n    f.compile_to_assembly(f.name() + \".s\", Internal::vec<Argument>(input), f.name());\n    f.compile_jit();\n    f.realize(output);\n\n    if (test_correctness) {\n        for (int y = 0; y < output.height(); y++) {\n            for (int x = 0; x < output.width(); x++) {\n                int ix1 = std::max(std::min(x, MAX), MIN);\n                int ix2 = std::max(std::min(x+1, MAX), MIN);\n                uint16_t correct = input(ix1, y) * 3 + input(ix2, y);\n                if (output(x, y) != correct) {\n                    printf(\"output(%d, %d) = %d instead of %d\\n\", \n                           x, y, output(x, y), correct); \n                    exit(-1);\n                }\n            }\n        }\n    }\n\n    double t1 = currentTime();\n    for (int i = 0; i < 100; i++) {\n        f.realize(output);\n    }\n    return currentTime() - t1;\n}\n\nint main(int argc, char **argv) {\n    \/\/ Try doing vector loads with a boundary condition in various\n    \/\/ ways and compare the performance.\n    \n    input = Image<uint16_t>(1024+8, 32);\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    output = Image<uint16_t>(1024, 32);\n        \n    Var x, y;    \n\n    double t_ref, t_clamped, t_scalar, t_pad;\n\n    {\n        \/\/ Do an unclamped load to get a reference number\n        Func f;\n        f(x, y) = input(x, y) * 3 + input(x+1, y);\n\n        f.vectorize(x, 8);\n\n        t_ref = test(f, false);        \n    }\n\n    {\n        \/\/ Variant 1 - do the clamped vector load\n        Func g;\n        g(x, y) = input(clamp(x, MIN, MAX), y);\n        \n        Func f;\n        f(x, y) = g(x, y) * 3 + g(x+1, y);\n\n        f.vectorize(x, 8);\n\n        t_clamped = test(f);\n    }\n\n    {\n        \/\/ Variant 2 - do the load as a scalar op just before the vectorized stuff\n        Func g;\n        g(x, y) = input(clamp(x, MIN, MAX), y);\n        \n        Func f;\n        f(x, y) = g(x, y) * 3 + g(x+1, y);\n\n        f.vectorize(x, 8);\n        g.compute_at(f, x);\n\n        t_scalar = test(f);\n    }\n\n    {\n        \/\/ Variant 3 - pad each scanline using scalar code\n        Func g;\n        g(x, y) = input(clamp(x, MIN, MAX), y);\n        \n        Func f;\n        f(x, y) = g(x, y) * 3 + g(x+1, y);\n\n        f.vectorize(x, 8);\n        g.compute_at(f, y);\n\n        t_pad = test(f);\n    }\n\n    if (t_clamped > 2.0f * t_ref || t_clamped > t_scalar || t_clamped > t_pad) {\n        printf(\"Clamped load timings suspicious:\\n\"\n               \"Unclamped: %f\\n\"\n               \"Clamped: %f\\n\"\n               \"Scalarize the load: %f\\n\"\n               \"Pad the input: %f\\n\", \n               t_ref, t_clamped, t_scalar, t_pad);\n        return -1;\n    }\n\n    printf(\"Success!\\n\");\n\n    return 0;\n}\n<commit_msg>Made the clamped vector load test less strict<commit_after>#include <Halide.h>\n\n#include <stdio.h>\n\n#ifdef _WIN32\nextern \"C\" bool QueryPerformanceCounter(uint64_t *);\nextern \"C\" bool QueryPerformanceFrequency(uint64_t *);\ndouble currentTime() {\n    uint64_t t, freq;\n    QueryPerformanceCounter(&t);\n    QueryPerformanceFrequency(&freq);\n    return (t * 1000.0) \/ freq;\n}\n#else\n#include <sys\/time.h>\ndouble currentTime() {\n    timeval t;\n    gettimeofday(&t, NULL);\n    return t.tv_sec * 1000.0 + t.tv_usec \/ 1000.0f;\n}\n#endif\n\nusing namespace Halide;\n\nImage<uint16_t> input;\nImage<uint16_t> output;\n\n#define MIN 1\n#define MAX 1020\n\ndouble test(Func f, bool test_correctness = true) {\n    f.compile_to_assembly(f.name() + \".s\", Internal::vec<Argument>(input), f.name());\n    f.compile_jit();\n    f.realize(output);\n\n    if (test_correctness) {\n        for (int y = 0; y < output.height(); y++) {\n            for (int x = 0; x < output.width(); x++) {\n                int ix1 = std::max(std::min(x, MAX), MIN);\n                int ix2 = std::max(std::min(x+1, MAX), MIN);\n                uint16_t correct = input(ix1, y) * 3 + input(ix2, y);\n                if (output(x, y) != correct) {\n                    printf(\"output(%d, %d) = %d instead of %d\\n\", \n                           x, y, output(x, y), correct); \n                    exit(-1);\n                }\n            }\n        }\n    }\n\n    double t1 = currentTime();\n    for (int i = 0; i < 100; i++) {\n        f.realize(output);\n    }\n    return currentTime() - t1;\n}\n\nint main(int argc, char **argv) {\n    \/\/ Try doing vector loads with a boundary condition in various\n    \/\/ ways and compare the performance.\n    \n    input = Image<uint16_t>(1024+8, 32);\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    output = Image<uint16_t>(1024, 32);\n        \n    Var x, y;    \n\n    double t_ref, t_clamped, t_scalar, t_pad;\n\n    {\n        \/\/ Do an unclamped load to get a reference number\n        Func f;\n        f(x, y) = input(x, y) * 3 + input(x+1, y);\n\n        f.vectorize(x, 8);\n\n        t_ref = test(f, false);        \n    }\n\n    {\n        \/\/ Variant 1 - do the clamped vector load\n        Func g;\n        g(x, y) = input(clamp(x, MIN, MAX), y);\n        \n        Func f;\n        f(x, y) = g(x, y) * 3 + g(x+1, y);\n\n        f.vectorize(x, 8);\n\n        t_clamped = test(f);\n    }\n\n    {\n        \/\/ Variant 2 - do the load as a scalar op just before the vectorized stuff\n        Func g;\n        g(x, y) = input(clamp(x, MIN, MAX), y);\n        \n        Func f;\n        f(x, y) = g(x, y) * 3 + g(x+1, y);\n\n        f.vectorize(x, 8);\n        g.compute_at(f, x);\n\n        t_scalar = test(f);\n    }\n\n    {\n        \/\/ Variant 3 - pad each scanline using scalar code\n        Func g;\n        g(x, y) = input(clamp(x, MIN, MAX), y);\n        \n        Func f;\n        f(x, y) = g(x, y) * 3 + g(x+1, y);\n\n        f.vectorize(x, 8);\n        g.compute_at(f, y);\n\n        t_pad = test(f);\n    }\n\n    if (t_clamped > 2.5f * t_ref || t_clamped > t_scalar || t_clamped > t_pad) {\n        printf(\"Clamped load timings suspicious:\\n\"\n               \"Unclamped: %f\\n\"\n               \"Clamped: %f\\n\"\n               \"Scalarize the load: %f\\n\"\n               \"Pad the input: %f\\n\", \n               t_ref, t_clamped, t_scalar, t_pad);\n        return -1;\n    }\n\n    printf(\"Success!\\n\");\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2009-2012 The Bitcoin developers\n\/\/ Distributed under the MIT\/X11 software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <boost\/assign\/list_of.hpp> \/\/ for 'map_list_of()'\n#include <boost\/foreach.hpp>\n\n#include \"checkpoints.h\"\n\n#include \"main.h\"\n#include \"uint256.h\"\n#include \"clone.h\"\n\nnamespace Checkpoints\n{\n    typedef std::map<int, uint256> MapCheckpoints;\n\n    \/\/ How many times we expect transactions after the last checkpoint to\n    \/\/ be slower. This number is a compromise, as it can't be accurate for\n    \/\/ every system. When reindexing from a fast disk with a slow CPU, it\n    \/\/ can be up to 20, while when downloading from a slow network with a\n    \/\/ fast multicore CPU, it won't be much higher than 1.\n    static const double fSigcheckVerificationFactor = 5.0;\n\n    struct CCheckpointData {\n        const MapCheckpoints *mapCheckpoints;\n        int64 nTimeLastCheckpoint;\n        int64 nTransactionsLastCheckpoint;\n        double fTransactionsPerDay;\n    };\n\n    \/\/ What makes a good checkpoint block?\n    \/\/ + Is surrounded by blocks with reasonable timestamps\n    \/\/   (no blocks before with a timestamp after, none after with\n    \/\/    timestamp before)\n    \/\/ + Contains no strange transactions\n    static MapCheckpoints mapCheckpoints =\n        boost::assign::map_list_of\n        ( 0, hashGenesisBlockMainNet)\n        ;\n    static const CCheckpointData data = {\n        &mapCheckpoints,\n        timeGenesisBlockMainNet, \/\/ * UNIX timestamp of last checkpoint block\n        0,     \/\/ * total number of transactions between genesis and last checkpoint\n                    \/\/   (the tx=... number in the SetBestChain debug.log lines)\n        60000.0     \/\/ * estimated number of transactions per day after checkpoint\n    };\n\n    static MapCheckpoints mapCheckpointsTestnet = \n        boost::assign::map_list_of\n        ( 0, hashGenesisBlockTestNet)\n        ;\n    static const CCheckpointData dataTestnet = {\n        &mapCheckpointsTestnet,\n        timeGenesisBlockTestNet,\n        0,\n        60000.0\n    };\n\n    const CCheckpointData &Checkpoints() {\n        if (fTestNet)\n            return dataTestnet;\n        else\n            return data;\n    }\n\n    bool CheckBlock(int nHeight, const uint256& hash)\n    {\n        if (!GetBoolArg(\"-checkpoints\", true))\n            return true;\n\n        const MapCheckpoints& checkpoints = *Checkpoints().mapCheckpoints;\n\n        MapCheckpoints::const_iterator i = checkpoints.find(nHeight);\n        if (i == checkpoints.end()) return true;\n        return hash == i->second;\n    }\n\n    \/\/ Guess how far we are in the verification process at the given block index\n    double GuessVerificationProgress(CBlockIndex *pindex) {\n        if (pindex==NULL)\n            return 0.0;\n\n        int64 nNow = time(NULL);\n\n        double fWorkBefore = 0.0; \/\/ Amount of work done before pindex\n        double fWorkAfter = 0.0;  \/\/ Amount of work left after pindex (estimated)\n        \/\/ Work is defined as: 1.0 per transaction before the last checkoint, and\n        \/\/ fSigcheckVerificationFactor per transaction after.\n\n        const CCheckpointData &data = Checkpoints();\n\n        if (pindex->nChainTx <= data.nTransactionsLastCheckpoint) {\n            double nCheapBefore = pindex->nChainTx;\n            double nCheapAfter = data.nTransactionsLastCheckpoint - pindex->nChainTx;\n            double nExpensiveAfter = (nNow - data.nTimeLastCheckpoint)\/86400.0*data.fTransactionsPerDay;\n            fWorkBefore = nCheapBefore;\n            fWorkAfter = nCheapAfter + nExpensiveAfter*fSigcheckVerificationFactor;\n        } else {\n            double nCheapBefore = data.nTransactionsLastCheckpoint;\n            double nExpensiveBefore = pindex->nChainTx - data.nTransactionsLastCheckpoint;\n            double nExpensiveAfter = (nNow - pindex->nTime)\/86400.0*data.fTransactionsPerDay;\n            fWorkBefore = nCheapBefore + nExpensiveBefore*fSigcheckVerificationFactor;\n            fWorkAfter = nExpensiveAfter*fSigcheckVerificationFactor;\n        }\n\n        return fWorkBefore \/ (fWorkBefore + fWorkAfter);\n    }\n\n    int GetTotalBlocksEstimate()\n    {\n        if (!GetBoolArg(\"-checkpoints\", true))\n            return 0;\n\n        const MapCheckpoints& checkpoints = *Checkpoints().mapCheckpoints;\n\n        return checkpoints.rbegin()->first;\n    }\n\n    CBlockIndex* GetLastCheckpoint(const std::map<uint256, CBlockIndex*>& mapBlockIndex)\n    {\n        if (!GetBoolArg(\"-checkpoints\", true))\n            return NULL;\n\n        const MapCheckpoints& checkpoints = *Checkpoints().mapCheckpoints;\n\n        BOOST_REVERSE_FOREACH(const MapCheckpoints::value_type& i, checkpoints)\n        {\n            const uint256& hash = i.second;\n            std::map<uint256, CBlockIndex*>::const_iterator t = mapBlockIndex.find(hash);\n            if (t != mapBlockIndex.end())\n                return t->second;\n        }\n        return NULL;\n    }\n}\n<commit_msg>even more dumb shit<commit_after>\/\/ 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 <boost\/assign\/list_of.hpp> \/\/ for 'map_list_of()'\n#include <boost\/foreach.hpp>\n\n#include \"checkpoints.h\"\n\n#include \"main.h\"\n#include \"uint256.h\"\n\nnamespace Checkpoints\n{\n    typedef std::map<int, uint256> MapCheckpoints;\n\n    \/\/ How many times we expect transactions after the last checkpoint to\n    \/\/ be slower. This number is a compromise, as it can't be accurate for\n    \/\/ every system. When reindexing from a fast disk with a slow CPU, it\n    \/\/ can be up to 20, while when downloading from a slow network with a\n    \/\/ fast multicore CPU, it won't be much higher than 1.\n    static const double fSigcheckVerificationFactor = 5.0;\n\n    struct CCheckpointData {\n        const MapCheckpoints *mapCheckpoints;\n        int64 nTimeLastCheckpoint;\n        int64 nTransactionsLastCheckpoint;\n        double fTransactionsPerDay;\n    };\n\n    \/\/ What makes a good checkpoint block?\n    \/\/ + Is surrounded by blocks with reasonable timestamps\n    \/\/   (no blocks before with a timestamp after, none after with\n    \/\/    timestamp before)\n    \/\/ + Contains no strange transactions\n    static MapCheckpoints mapCheckpoints =\n        boost::assign::map_list_of\n        ( 0, hashGenesisBlockMainNet)\n        ;\n    static const CCheckpointData data = {\n        &mapCheckpoints,\n        timeGenesisBlockMainNet, \/\/ * UNIX timestamp of last checkpoint block\n        0,     \/\/ * total number of transactions between genesis and last checkpoint\n                    \/\/   (the tx=... number in the SetBestChain debug.log lines)\n        60000.0     \/\/ * estimated number of transactions per day after checkpoint\n    };\n\n    static MapCheckpoints mapCheckpointsTestnet = \n        boost::assign::map_list_of\n        ( 0, hashGenesisBlockTestNet)\n        ;\n    static const CCheckpointData dataTestnet = {\n        &mapCheckpointsTestnet,\n        timeGenesisBlockTestNet,\n        0,\n        60000.0\n    };\n\n    const CCheckpointData &Checkpoints() {\n        if (fTestNet)\n            return dataTestnet;\n        else\n            return data;\n    }\n\n    bool CheckBlock(int nHeight, const uint256& hash)\n    {\n        if (!GetBoolArg(\"-checkpoints\", true))\n            return true;\n\n        const MapCheckpoints& checkpoints = *Checkpoints().mapCheckpoints;\n\n        MapCheckpoints::const_iterator i = checkpoints.find(nHeight);\n        if (i == checkpoints.end()) return true;\n        return hash == i->second;\n    }\n\n    \/\/ Guess how far we are in the verification process at the given block index\n    double GuessVerificationProgress(CBlockIndex *pindex) {\n        if (pindex==NULL)\n            return 0.0;\n\n        int64 nNow = time(NULL);\n\n        double fWorkBefore = 0.0; \/\/ Amount of work done before pindex\n        double fWorkAfter = 0.0;  \/\/ Amount of work left after pindex (estimated)\n        \/\/ Work is defined as: 1.0 per transaction before the last checkoint, and\n        \/\/ fSigcheckVerificationFactor per transaction after.\n\n        const CCheckpointData &data = Checkpoints();\n\n        if (pindex->nChainTx <= data.nTransactionsLastCheckpoint) {\n            double nCheapBefore = pindex->nChainTx;\n            double nCheapAfter = data.nTransactionsLastCheckpoint - pindex->nChainTx;\n            double nExpensiveAfter = (nNow - data.nTimeLastCheckpoint)\/86400.0*data.fTransactionsPerDay;\n            fWorkBefore = nCheapBefore;\n            fWorkAfter = nCheapAfter + nExpensiveAfter*fSigcheckVerificationFactor;\n        } else {\n            double nCheapBefore = data.nTransactionsLastCheckpoint;\n            double nExpensiveBefore = pindex->nChainTx - data.nTransactionsLastCheckpoint;\n            double nExpensiveAfter = (nNow - pindex->nTime)\/86400.0*data.fTransactionsPerDay;\n            fWorkBefore = nCheapBefore + nExpensiveBefore*fSigcheckVerificationFactor;\n            fWorkAfter = nExpensiveAfter*fSigcheckVerificationFactor;\n        }\n\n        return fWorkBefore \/ (fWorkBefore + fWorkAfter);\n    }\n\n    int GetTotalBlocksEstimate()\n    {\n        if (!GetBoolArg(\"-checkpoints\", true))\n            return 0;\n\n        const MapCheckpoints& checkpoints = *Checkpoints().mapCheckpoints;\n\n        return checkpoints.rbegin()->first;\n    }\n\n    CBlockIndex* GetLastCheckpoint(const std::map<uint256, CBlockIndex*>& mapBlockIndex)\n    {\n        if (!GetBoolArg(\"-checkpoints\", true))\n            return NULL;\n\n        const MapCheckpoints& checkpoints = *Checkpoints().mapCheckpoints;\n\n        BOOST_REVERSE_FOREACH(const MapCheckpoints::value_type& i, checkpoints)\n        {\n            const uint256& hash = i.second;\n            std::map<uint256, CBlockIndex*>::const_iterator t = mapBlockIndex.find(hash);\n            if (t != mapBlockIndex.end())\n                return t->second;\n        }\n        return NULL;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2009-2012 The Bitcoin developers\n\/\/ Distributed under the MIT\/X11 software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <boost\/assign\/list_of.hpp> \/\/ for 'map_list_of()'\n#include <boost\/foreach.hpp>\n\n#include \"checkpoints.h\"\n\n#include \"main.h\"\n#include \"uint256.h\"\n\nnamespace Checkpoints\n{\n    typedef std::map<int, uint256> MapCheckpoints;\n\n    \/\/ How many times we expect transactions after the last checkpoint to\n    \/\/ be slower. This number is a compromise, as it can't be accurate for\n    \/\/ every system. When reindexing from a fast disk with a slow CPU, it\n    \/\/ can be up to 20, while when downloading from a slow network with a\n    \/\/ fast multicore CPU, it won't be much higher than 1.\n    static const double fSigcheckVerificationFactor = 5.0;\n\n    struct CCheckpointData {\n        const MapCheckpoints *mapCheckpoints;\n        int64 nTimeLastCheckpoint;\n        int64 nTransactionsLastCheckpoint;\n        double fTransactionsPerDay;\n    };\n\n    \/\/ What makes a good checkpoint block?\n    \/\/ + Is surrounded by blocks with reasonable timestamps\n    \/\/   (no blocks before with a timestamp after, none after with\n    \/\/    timestamp before)\n    \/\/ + Contains no strange transactions\n    static MapCheckpoints mapCheckpoints =\n        boost::assign::map_list_of\n        ( 0, uint256(\"0x000000dcb4434e2148558a0a5c71e5c06d864accef97d75ac1c031405deb3371\"))\n        ;\n    static const CCheckpointData data = {\n        &mapCheckpoints,\n        1399109785, \/\/ * UNIX timestamp of last checkpoint block\n        0,     \/\/ * total number of transactions between genesis and last checkpoint\n                    \/\/   (the tx=... number in the SetBestChain debug.log lines)\n        60000.0     \/\/ * estimated number of transactions per day after checkpoint\n    };\n\n    static MapCheckpoints mapCheckpointsTestnet = \n        boost::assign::map_list_of\n        ( 0, uint256(\"0x00000052d978f26d698e0c4dbce9f8139a69f2fbda37715149146776aeb70d5b\"))\n        ;\n    static const CCheckpointData dataTestnet = {\n        &mapCheckpointsTestnet,\n        1392351202,\n        0,\n        60000.0\n    };\n\n    const CCheckpointData &Checkpoints() {\n        if (fTestNet)\n            return dataTestnet;\n        else\n            return data;\n    }\n\n    bool CheckBlock(int nHeight, const uint256& hash)\n    {\n        if (!GetBoolArg(\"-checkpoints\", true))\n            return true;\n\n        const MapCheckpoints& checkpoints = *Checkpoints().mapCheckpoints;\n\n        MapCheckpoints::const_iterator i = checkpoints.find(nHeight);\n        if (i == checkpoints.end()) return true;\n        return hash == i->second;\n    }\n\n    \/\/ Guess how far we are in the verification process at the given block index\n    double GuessVerificationProgress(CBlockIndex *pindex) {\n        if (pindex==NULL)\n            return 0.0;\n\n        int64 nNow = time(NULL);\n\n        double fWorkBefore = 0.0; \/\/ Amount of work done before pindex\n        double fWorkAfter = 0.0;  \/\/ Amount of work left after pindex (estimated)\n        \/\/ Work is defined as: 1.0 per transaction before the last checkoint, and\n        \/\/ fSigcheckVerificationFactor per transaction after.\n\n        const CCheckpointData &data = Checkpoints();\n\n        if (pindex->nChainTx <= data.nTransactionsLastCheckpoint) {\n            double nCheapBefore = pindex->nChainTx;\n            double nCheapAfter = data.nTransactionsLastCheckpoint - pindex->nChainTx;\n            double nExpensiveAfter = (nNow - data.nTimeLastCheckpoint)\/86400.0*data.fTransactionsPerDay;\n            fWorkBefore = nCheapBefore;\n            fWorkAfter = nCheapAfter + nExpensiveAfter*fSigcheckVerificationFactor;\n        } else {\n            double nCheapBefore = data.nTransactionsLastCheckpoint;\n            double nExpensiveBefore = pindex->nChainTx - data.nTransactionsLastCheckpoint;\n            double nExpensiveAfter = (nNow - pindex->nTime)\/86400.0*data.fTransactionsPerDay;\n            fWorkBefore = nCheapBefore + nExpensiveBefore*fSigcheckVerificationFactor;\n            fWorkAfter = nExpensiveAfter*fSigcheckVerificationFactor;\n        }\n\n        return fWorkBefore \/ (fWorkBefore + fWorkAfter);\n    }\n\n    int GetTotalBlocksEstimate()\n    {\n        if (!GetBoolArg(\"-checkpoints\", true))\n            return 0;\n\n        const MapCheckpoints& checkpoints = *Checkpoints().mapCheckpoints;\n\n        return checkpoints.rbegin()->first;\n    }\n\n    CBlockIndex* GetLastCheckpoint(const std::map<uint256, CBlockIndex*>& mapBlockIndex)\n    {\n        if (!GetBoolArg(\"-checkpoints\", true))\n            return NULL;\n\n        const MapCheckpoints& checkpoints = *Checkpoints().mapCheckpoints;\n\n        BOOST_REVERSE_FOREACH(const MapCheckpoints::value_type& i, checkpoints)\n        {\n            const uint256& hash = i.second;\n            std::map<uint256, CBlockIndex*>::const_iterator t = mapBlockIndex.find(hash);\n            if (t != mapBlockIndex.end())\n                return t->second;\n        }\n        return NULL;\n    }\n}\n<commit_msg>Update checkpoints.cpp<commit_after>\/\/ 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 <boost\/assign\/list_of.hpp> \/\/ for 'map_list_of()'\n#include <boost\/foreach.hpp>\n\n#include \"checkpoints.h\"\n\n#include \"main.h\"\n#include \"uint256.h\"\n\nnamespace Checkpoints\n{\n    typedef std::map<int, uint256> MapCheckpoints;\n\n    \/\/ How many times we expect transactions after the last checkpoint to\n    \/\/ be slower. This number is a compromise, as it can't be accurate for\n    \/\/ every system. When reindexing from a fast disk with a slow CPU, it\n    \/\/ can be up to 20, while when downloading from a slow network with a\n    \/\/ fast multicore CPU, it won't be much higher than 1.\n    static const double fSigcheckVerificationFactor = 5.0;\n\n    struct CCheckpointData {\n        const MapCheckpoints *mapCheckpoints;\n        int64 nTimeLastCheckpoint;\n        int64 nTransactionsLastCheckpoint;\n        double fTransactionsPerDay;\n    };\n\n    \/\/ What makes a good checkpoint block?\n    \/\/ + Is surrounded by blocks with reasonable timestamps\n    \/\/   (no blocks before with a timestamp after, none after with\n    \/\/    timestamp before)\n    \/\/ + Contains no strange transactions\n    static MapCheckpoints mapCheckpoints =\n        boost::assign::map_list_of\n        ( 0, uint256(\"0x000000e02afef4712c99d5fa44cb5f76af046953cc31433bc97f7090ce6a50d8\"))\n        ;\n    static const CCheckpointData data = {\n        &mapCheckpoints,\n        1399109785, \/\/ * UNIX timestamp of last checkpoint block\n        0,     \/\/ * total number of transactions between genesis and last checkpoint\n                    \/\/   (the tx=... number in the SetBestChain debug.log lines)\n        60000.0     \/\/ * estimated number of transactions per day after checkpoint\n    };\n\n    static MapCheckpoints mapCheckpointsTestnet = \n        boost::assign::map_list_of\n        ( 0, uint256(\"0x00000052d978f26d698e0c4dbce9f8139a69f2fbda37715149146776aeb70d5b\"))\n        ;\n    static const CCheckpointData dataTestnet = {\n        &mapCheckpointsTestnet,\n        1392351202,\n        0,\n        60000.0\n    };\n\n    const CCheckpointData &Checkpoints() {\n        if (fTestNet)\n            return dataTestnet;\n        else\n            return data;\n    }\n\n    bool CheckBlock(int nHeight, const uint256& hash)\n    {\n        if (!GetBoolArg(\"-checkpoints\", true))\n            return true;\n\n        const MapCheckpoints& checkpoints = *Checkpoints().mapCheckpoints;\n\n        MapCheckpoints::const_iterator i = checkpoints.find(nHeight);\n        if (i == checkpoints.end()) return true;\n        return hash == i->second;\n    }\n\n    \/\/ Guess how far we are in the verification process at the given block index\n    double GuessVerificationProgress(CBlockIndex *pindex) {\n        if (pindex==NULL)\n            return 0.0;\n\n        int64 nNow = time(NULL);\n\n        double fWorkBefore = 0.0; \/\/ Amount of work done before pindex\n        double fWorkAfter = 0.0;  \/\/ Amount of work left after pindex (estimated)\n        \/\/ Work is defined as: 1.0 per transaction before the last checkoint, and\n        \/\/ fSigcheckVerificationFactor per transaction after.\n\n        const CCheckpointData &data = Checkpoints();\n\n        if (pindex->nChainTx <= data.nTransactionsLastCheckpoint) {\n            double nCheapBefore = pindex->nChainTx;\n            double nCheapAfter = data.nTransactionsLastCheckpoint - pindex->nChainTx;\n            double nExpensiveAfter = (nNow - data.nTimeLastCheckpoint)\/86400.0*data.fTransactionsPerDay;\n            fWorkBefore = nCheapBefore;\n            fWorkAfter = nCheapAfter + nExpensiveAfter*fSigcheckVerificationFactor;\n        } else {\n            double nCheapBefore = data.nTransactionsLastCheckpoint;\n            double nExpensiveBefore = pindex->nChainTx - data.nTransactionsLastCheckpoint;\n            double nExpensiveAfter = (nNow - pindex->nTime)\/86400.0*data.fTransactionsPerDay;\n            fWorkBefore = nCheapBefore + nExpensiveBefore*fSigcheckVerificationFactor;\n            fWorkAfter = nExpensiveAfter*fSigcheckVerificationFactor;\n        }\n\n        return fWorkBefore \/ (fWorkBefore + fWorkAfter);\n    }\n\n    int GetTotalBlocksEstimate()\n    {\n        if (!GetBoolArg(\"-checkpoints\", true))\n            return 0;\n\n        const MapCheckpoints& checkpoints = *Checkpoints().mapCheckpoints;\n\n        return checkpoints.rbegin()->first;\n    }\n\n    CBlockIndex* GetLastCheckpoint(const std::map<uint256, CBlockIndex*>& mapBlockIndex)\n    {\n        if (!GetBoolArg(\"-checkpoints\", true))\n            return NULL;\n\n        const MapCheckpoints& checkpoints = *Checkpoints().mapCheckpoints;\n\n        BOOST_REVERSE_FOREACH(const MapCheckpoints::value_type& i, checkpoints)\n        {\n            const uint256& hash = i.second;\n            std::map<uint256, CBlockIndex*>::const_iterator t = mapBlockIndex.find(hash);\n            if (t != mapBlockIndex.end())\n                return t->second;\n        }\n        return NULL;\n    }\n}\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\/\/ Included first as it collides with the X11 headers.\n#include \"gtest\/gtest.h\"\n\n#include \"flutter\/shell\/platform\/embedder\/test_utils\/proc_table_replacement.h\"\n#include \"flutter\/shell\/platform\/linux\/fl_engine_private.h\"\n#include \"flutter\/shell\/platform\/linux\/public\/flutter_linux\/fl_engine.h\"\n#include \"flutter\/shell\/platform\/linux\/public\/flutter_linux\/fl_json_message_codec.h\"\n#include \"flutter\/shell\/platform\/linux\/testing\/fl_test.h\"\n\n\/\/ Checks sending window metrics events works.\nTEST(FlEngineTest, WindowMetrics) {\n  g_autoptr(FlEngine) engine = make_mock_engine();\n  FlutterEngineProcTable* embedder_api = fl_engine_get_embedder_api(engine);\n\n  bool called = false;\n  embedder_api->SendWindowMetricsEvent = MOCK_ENGINE_PROC(\n      SendWindowMetricsEvent,\n      ([&called](auto engine, const FlutterWindowMetricsEvent* event) {\n        called = true;\n        EXPECT_EQ(event->width, static_cast<size_t>(3840));\n        EXPECT_EQ(event->height, static_cast<size_t>(2160));\n        EXPECT_EQ(event->pixel_ratio, 2.0);\n\n        return kSuccess;\n      }));\n\n  g_autoptr(GError) error = nullptr;\n  EXPECT_TRUE(fl_engine_start(engine, &error));\n  EXPECT_EQ(error, nullptr);\n  fl_engine_send_window_metrics_event(engine, 3840, 2160, 2.0);\n\n  EXPECT_TRUE(called);\n}\n\n\/\/ Checks sending mouse pointer events works.\nTEST(FlEngineTest, MousePointer) {\n  g_autoptr(FlEngine) engine = make_mock_engine();\n  FlutterEngineProcTable* embedder_api = fl_engine_get_embedder_api(engine);\n\n  bool called = false;\n  embedder_api->SendPointerEvent = MOCK_ENGINE_PROC(\n      SendPointerEvent,\n      ([&called](auto engine, const FlutterPointerEvent* events,\n                 size_t events_count) {\n        called = true;\n        EXPECT_EQ(events_count, static_cast<size_t>(1));\n        EXPECT_EQ(events[0].phase, kDown);\n        EXPECT_EQ(events[0].timestamp, static_cast<size_t>(1234567890));\n        EXPECT_EQ(events[0].x, 800);\n        EXPECT_EQ(events[0].y, 600);\n        EXPECT_EQ(events[0].device, static_cast<int32_t>(0));\n        EXPECT_EQ(events[0].signal_kind, kFlutterPointerSignalKindScroll);\n        EXPECT_EQ(events[0].scroll_delta_x, 1.2);\n        EXPECT_EQ(events[0].scroll_delta_y, -3.4);\n        EXPECT_EQ(events[0].device_kind, kFlutterPointerDeviceKindMouse);\n        EXPECT_EQ(events[0].buttons, kFlutterPointerButtonMouseSecondary);\n\n        return kSuccess;\n      }));\n\n  g_autoptr(GError) error = nullptr;\n  EXPECT_TRUE(fl_engine_start(engine, &error));\n  EXPECT_EQ(error, nullptr);\n  fl_engine_send_mouse_pointer_event(engine, kDown, 1234567890, 800, 600, 1.2,\n                                     -3.4, kFlutterPointerButtonMouseSecondary);\n\n  EXPECT_TRUE(called);\n}\n\n\/\/ Checks sending platform messages works.\nTEST(FlEngineTest, PlatformMessage) {\n  g_autoptr(FlEngine) engine = make_mock_engine();\n  FlutterEngineProcTable* embedder_api = fl_engine_get_embedder_api(engine);\n\n  bool called = false;\n  FlutterEngineSendPlatformMessageFnPtr old_handler =\n      embedder_api->SendPlatformMessage;\n  embedder_api->SendPlatformMessage = MOCK_ENGINE_PROC(\n      SendPlatformMessage,\n      ([&called, old_handler](auto engine,\n                              const FlutterPlatformMessage* message) {\n        if (strcmp(message->channel, \"test\") != 0) {\n          return old_handler(engine, message);\n        }\n\n        called = true;\n\n        EXPECT_EQ(message->message_size, static_cast<size_t>(4));\n        EXPECT_EQ(message->message[0], 't');\n        EXPECT_EQ(message->message[1], 'e');\n        EXPECT_EQ(message->message[2], 's');\n        EXPECT_EQ(message->message[3], 't');\n\n        return kSuccess;\n      }));\n\n  g_autoptr(GError) error = nullptr;\n  EXPECT_TRUE(fl_engine_start(engine, &error));\n  EXPECT_EQ(error, nullptr);\n  g_autoptr(GBytes) message = g_bytes_new_static(\"test\", 4);\n  fl_engine_send_platform_message(engine, \"test\", message, nullptr, nullptr,\n                                  nullptr);\n\n  EXPECT_TRUE(called);\n}\n\n\/\/ Checks sending platform message responses works.\nTEST(FlEngineTest, PlatformMessageResponse) {\n  g_autoptr(FlEngine) engine = make_mock_engine();\n  FlutterEngineProcTable* embedder_api = fl_engine_get_embedder_api(engine);\n\n  bool called = false;\n  embedder_api->SendPlatformMessageResponse = MOCK_ENGINE_PROC(\n      SendPlatformMessageResponse,\n      ([&called](auto engine,\n                 const FlutterPlatformMessageResponseHandle* handle,\n                 const uint8_t* data, size_t data_length) {\n        called = true;\n\n        EXPECT_EQ(\n            handle,\n            reinterpret_cast<const FlutterPlatformMessageResponseHandle*>(42));\n        EXPECT_EQ(data_length, static_cast<size_t>(4));\n        EXPECT_EQ(data[0], 't');\n        EXPECT_EQ(data[1], 'e');\n        EXPECT_EQ(data[2], 's');\n        EXPECT_EQ(data[3], 't');\n\n        return kSuccess;\n      }));\n\n  g_autoptr(GError) error = nullptr;\n  EXPECT_TRUE(fl_engine_start(engine, &error));\n  EXPECT_EQ(error, nullptr);\n  g_autoptr(GBytes) response = g_bytes_new_static(\"test\", 4);\n  EXPECT_TRUE(fl_engine_send_platform_message_response(\n      engine, reinterpret_cast<const FlutterPlatformMessageResponseHandle*>(42),\n      response, &error));\n  EXPECT_EQ(error, nullptr);\n\n  EXPECT_TRUE(called);\n}\n\n\/\/ Checks settings plugin sends settings on startup.\nTEST(FlEngineTest, SettingsPlugin) {\n  GTEST_SKIP()\n      << \"disabled: see https:\/\/github.com\/flutter\/flutter\/issues\/73517\";\n\n  g_autoptr(FlEngine) engine = make_mock_engine();\n  FlutterEngineProcTable* embedder_api = fl_engine_get_embedder_api(engine);\n\n  bool called = false;\n  embedder_api->SendPlatformMessage = MOCK_ENGINE_PROC(\n      SendPlatformMessage,\n      ([&called](auto engine, const FlutterPlatformMessage* message) {\n        called = true;\n\n        EXPECT_STREQ(message->channel, \"flutter\/settings\");\n\n        g_autoptr(FlJsonMessageCodec) codec = fl_json_message_codec_new();\n        g_autoptr(GBytes) data =\n            g_bytes_new(message->message, message->message_size);\n        g_autoptr(GError) error = nullptr;\n        g_autoptr(FlValue) settings = fl_message_codec_decode_message(\n            FL_MESSAGE_CODEC(codec), data, &error);\n        EXPECT_NE(settings, nullptr);\n        EXPECT_EQ(error, nullptr);\n        g_printerr(\"%s\\n\", fl_value_to_string(settings));\n\n        g_autoptr(FlValue) text_scale_factor =\n            fl_value_lookup_string(settings, \"textScaleFactor\");\n        EXPECT_NE(text_scale_factor, nullptr);\n        EXPECT_EQ(fl_value_get_type(text_scale_factor), FL_VALUE_TYPE_FLOAT);\n\n        g_autoptr(FlValue) always_use_24hr_format =\n            fl_value_lookup_string(settings, \"alwaysUse24HourFormat\");\n        EXPECT_NE(always_use_24hr_format, nullptr);\n        EXPECT_EQ(fl_value_get_type(always_use_24hr_format),\n                  FL_VALUE_TYPE_BOOL);\n\n        g_autoptr(FlValue) platform_brightness =\n            fl_value_lookup_string(settings, \"platformBrightness\");\n        EXPECT_NE(platform_brightness, nullptr);\n        EXPECT_EQ(fl_value_get_type(platform_brightness), FL_VALUE_TYPE_STRING);\n\n        return kSuccess;\n      }));\n\n  g_autoptr(GError) error = nullptr;\n  EXPECT_TRUE(fl_engine_start(engine, &error));\n  EXPECT_EQ(error, nullptr);\n\n  EXPECT_TRUE(called);\n}\n<commit_msg>Remove debugging code<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\/\/ Included first as it collides with the X11 headers.\n#include \"gtest\/gtest.h\"\n\n#include \"flutter\/shell\/platform\/embedder\/test_utils\/proc_table_replacement.h\"\n#include \"flutter\/shell\/platform\/linux\/fl_engine_private.h\"\n#include \"flutter\/shell\/platform\/linux\/public\/flutter_linux\/fl_engine.h\"\n#include \"flutter\/shell\/platform\/linux\/public\/flutter_linux\/fl_json_message_codec.h\"\n#include \"flutter\/shell\/platform\/linux\/testing\/fl_test.h\"\n\n\/\/ Checks sending window metrics events works.\nTEST(FlEngineTest, WindowMetrics) {\n  g_autoptr(FlEngine) engine = make_mock_engine();\n  FlutterEngineProcTable* embedder_api = fl_engine_get_embedder_api(engine);\n\n  bool called = false;\n  embedder_api->SendWindowMetricsEvent = MOCK_ENGINE_PROC(\n      SendWindowMetricsEvent,\n      ([&called](auto engine, const FlutterWindowMetricsEvent* event) {\n        called = true;\n        EXPECT_EQ(event->width, static_cast<size_t>(3840));\n        EXPECT_EQ(event->height, static_cast<size_t>(2160));\n        EXPECT_EQ(event->pixel_ratio, 2.0);\n\n        return kSuccess;\n      }));\n\n  g_autoptr(GError) error = nullptr;\n  EXPECT_TRUE(fl_engine_start(engine, &error));\n  EXPECT_EQ(error, nullptr);\n  fl_engine_send_window_metrics_event(engine, 3840, 2160, 2.0);\n\n  EXPECT_TRUE(called);\n}\n\n\/\/ Checks sending mouse pointer events works.\nTEST(FlEngineTest, MousePointer) {\n  g_autoptr(FlEngine) engine = make_mock_engine();\n  FlutterEngineProcTable* embedder_api = fl_engine_get_embedder_api(engine);\n\n  bool called = false;\n  embedder_api->SendPointerEvent = MOCK_ENGINE_PROC(\n      SendPointerEvent,\n      ([&called](auto engine, const FlutterPointerEvent* events,\n                 size_t events_count) {\n        called = true;\n        EXPECT_EQ(events_count, static_cast<size_t>(1));\n        EXPECT_EQ(events[0].phase, kDown);\n        EXPECT_EQ(events[0].timestamp, static_cast<size_t>(1234567890));\n        EXPECT_EQ(events[0].x, 800);\n        EXPECT_EQ(events[0].y, 600);\n        EXPECT_EQ(events[0].device, static_cast<int32_t>(0));\n        EXPECT_EQ(events[0].signal_kind, kFlutterPointerSignalKindScroll);\n        EXPECT_EQ(events[0].scroll_delta_x, 1.2);\n        EXPECT_EQ(events[0].scroll_delta_y, -3.4);\n        EXPECT_EQ(events[0].device_kind, kFlutterPointerDeviceKindMouse);\n        EXPECT_EQ(events[0].buttons, kFlutterPointerButtonMouseSecondary);\n\n        return kSuccess;\n      }));\n\n  g_autoptr(GError) error = nullptr;\n  EXPECT_TRUE(fl_engine_start(engine, &error));\n  EXPECT_EQ(error, nullptr);\n  fl_engine_send_mouse_pointer_event(engine, kDown, 1234567890, 800, 600, 1.2,\n                                     -3.4, kFlutterPointerButtonMouseSecondary);\n\n  EXPECT_TRUE(called);\n}\n\n\/\/ Checks sending platform messages works.\nTEST(FlEngineTest, PlatformMessage) {\n  g_autoptr(FlEngine) engine = make_mock_engine();\n  FlutterEngineProcTable* embedder_api = fl_engine_get_embedder_api(engine);\n\n  bool called = false;\n  FlutterEngineSendPlatformMessageFnPtr old_handler =\n      embedder_api->SendPlatformMessage;\n  embedder_api->SendPlatformMessage = MOCK_ENGINE_PROC(\n      SendPlatformMessage,\n      ([&called, old_handler](auto engine,\n                              const FlutterPlatformMessage* message) {\n        if (strcmp(message->channel, \"test\") != 0) {\n          return old_handler(engine, message);\n        }\n\n        called = true;\n\n        EXPECT_EQ(message->message_size, static_cast<size_t>(4));\n        EXPECT_EQ(message->message[0], 't');\n        EXPECT_EQ(message->message[1], 'e');\n        EXPECT_EQ(message->message[2], 's');\n        EXPECT_EQ(message->message[3], 't');\n\n        return kSuccess;\n      }));\n\n  g_autoptr(GError) error = nullptr;\n  EXPECT_TRUE(fl_engine_start(engine, &error));\n  EXPECT_EQ(error, nullptr);\n  g_autoptr(GBytes) message = g_bytes_new_static(\"test\", 4);\n  fl_engine_send_platform_message(engine, \"test\", message, nullptr, nullptr,\n                                  nullptr);\n\n  EXPECT_TRUE(called);\n}\n\n\/\/ Checks sending platform message responses works.\nTEST(FlEngineTest, PlatformMessageResponse) {\n  g_autoptr(FlEngine) engine = make_mock_engine();\n  FlutterEngineProcTable* embedder_api = fl_engine_get_embedder_api(engine);\n\n  bool called = false;\n  embedder_api->SendPlatformMessageResponse = MOCK_ENGINE_PROC(\n      SendPlatformMessageResponse,\n      ([&called](auto engine,\n                 const FlutterPlatformMessageResponseHandle* handle,\n                 const uint8_t* data, size_t data_length) {\n        called = true;\n\n        EXPECT_EQ(\n            handle,\n            reinterpret_cast<const FlutterPlatformMessageResponseHandle*>(42));\n        EXPECT_EQ(data_length, static_cast<size_t>(4));\n        EXPECT_EQ(data[0], 't');\n        EXPECT_EQ(data[1], 'e');\n        EXPECT_EQ(data[2], 's');\n        EXPECT_EQ(data[3], 't');\n\n        return kSuccess;\n      }));\n\n  g_autoptr(GError) error = nullptr;\n  EXPECT_TRUE(fl_engine_start(engine, &error));\n  EXPECT_EQ(error, nullptr);\n  g_autoptr(GBytes) response = g_bytes_new_static(\"test\", 4);\n  EXPECT_TRUE(fl_engine_send_platform_message_response(\n      engine, reinterpret_cast<const FlutterPlatformMessageResponseHandle*>(42),\n      response, &error));\n  EXPECT_EQ(error, nullptr);\n\n  EXPECT_TRUE(called);\n}\n\n\/\/ Checks settings plugin sends settings on startup.\nTEST(FlEngineTest, SettingsPlugin) {\n  GTEST_SKIP()\n      << \"disabled: see https:\/\/github.com\/flutter\/flutter\/issues\/73517\";\n\n  g_autoptr(FlEngine) engine = make_mock_engine();\n  FlutterEngineProcTable* embedder_api = fl_engine_get_embedder_api(engine);\n\n  bool called = false;\n  embedder_api->SendPlatformMessage = MOCK_ENGINE_PROC(\n      SendPlatformMessage,\n      ([&called](auto engine, const FlutterPlatformMessage* message) {\n        called = true;\n\n        EXPECT_STREQ(message->channel, \"flutter\/settings\");\n\n        g_autoptr(FlJsonMessageCodec) codec = fl_json_message_codec_new();\n        g_autoptr(GBytes) data =\n            g_bytes_new(message->message, message->message_size);\n        g_autoptr(GError) error = nullptr;\n        g_autoptr(FlValue) settings = fl_message_codec_decode_message(\n            FL_MESSAGE_CODEC(codec), data, &error);\n        EXPECT_NE(settings, nullptr);\n        EXPECT_EQ(error, nullptr);\n\n        g_autoptr(FlValue) text_scale_factor =\n            fl_value_lookup_string(settings, \"textScaleFactor\");\n        EXPECT_NE(text_scale_factor, nullptr);\n        EXPECT_EQ(fl_value_get_type(text_scale_factor), FL_VALUE_TYPE_FLOAT);\n\n        g_autoptr(FlValue) always_use_24hr_format =\n            fl_value_lookup_string(settings, \"alwaysUse24HourFormat\");\n        EXPECT_NE(always_use_24hr_format, nullptr);\n        EXPECT_EQ(fl_value_get_type(always_use_24hr_format),\n                  FL_VALUE_TYPE_BOOL);\n\n        g_autoptr(FlValue) platform_brightness =\n            fl_value_lookup_string(settings, \"platformBrightness\");\n        EXPECT_NE(platform_brightness, nullptr);\n        EXPECT_EQ(fl_value_get_type(platform_brightness), FL_VALUE_TYPE_STRING);\n\n        return kSuccess;\n      }));\n\n  g_autoptr(GError) error = nullptr;\n  EXPECT_TRUE(fl_engine_start(engine, &error));\n  EXPECT_EQ(error, nullptr);\n\n  EXPECT_TRUE(called);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <deai\/c++\/deai.hh>\n\n#include <libudev.h>\n\n#include \"common.h\"\n\nusing namespace ::deai::c_api;\nusing namespace ::deai;\n\nnamespace {\nstruct Context {\npublic:\n\tstatic constexpr const char *type [[maybe_unused]] = \"deai.plugin.udev:\"\n\t                                                     \"Context\";\n\tudev *context;\n\tContext() {\n\t\tcontext = udev_new();\n\t}\n\t~Context() {\n\t\tcontext = udev_unref(context);\n\t}\n};\nstruct Device {};\n\nstruct Module {\n\tstatic constexpr const char *type [[maybe_unused]] = \"deai.plugin.udev:\"\n\t                                                     \"Module\";\n\tauto device_from_dev_node(std::string_view dev_node) -> Ref<Object> {\n\t\tauto object_ref = util::unsafe_to_object_ref(*this);\n\t\tauto context_ref = object_ref[\"__udev_context\"];\n\t\tauto context = ([&]() {\n\t\t\tif (!context_ref.has_value()) {\n\t\t\t\tauto context = util::new_object<Context>();\n\t\t\t\tauto weak_context = context.downgrade();\n\t\t\t\tcontext_ref = Variant::from(std::move(weak_context));\n\t\t\t\treturn context;\n\t\t\t}\n\t\t\treturn context_ref.value().to<WeakRef<Object>>().value().upgrade().value();\n\t\t})();\n\n\t\tauto &context_inner = util::unsafe_to_inner<Context>(context);\n\t\tauto e = udev_enumerate_new(context_inner.context);\n\t\tstd::string dev_node_copy{dev_node.data(), dev_node.size()};\n\t\tudev_enumerate_add_match_property(e, \"DEVNAME\", dev_node_copy.c_str());\n\t\tudev_enumerate_scan_devices(e);\n\n\t\tauto entry = udev_enumerate_get_list_entry(e);\n\t\tfprintf(stderr, \"%s = %s\\n\", udev_list_entry_get_name(entry), udev_list_entry_get_value(entry));\n\n\t\tudev_enumerate_unref(e);\n\n\t\treturn Object::create();\n\t}\n};\n\nDEAI_CPP_PLUGIN_ENTRY_POINT(di) {\n\tauto obj = util::new_object<Module>();\n\tModule &module = util::unsafe_to_inner<Module>(obj);\n\tutil::add_method<Module, &Module::device_from_dev_node>(module, \"device_from_dev_\"\n\t                                                                \"node\");\n\n\t\/\/ auto context = util::new_object<Context>();\n\n\tstatic_cast<void>(di->register_module(\"udev\", obj));\n\treturn 0;\n}\n}        \/\/ namespace\n<commit_msg>plugins: udev: device object creation<commit_after>#include <deai\/c++\/deai.hh>\n\n#include <libudev.h>\n\n#include \"common.h\"\n\nusing namespace ::deai::c_api;\nusing namespace ::deai;\n\nnamespace {\nstruct Context {\npublic:\n\tstatic constexpr const char *type [[maybe_unused]] = \"deai.plugin.udev:Context\";\n\tudev *context;\n\tContext() {\n\t\tcontext = udev_new();\n\t}\n\t~Context() {\n\t\tudev_unref(context);\n\t}\n};\nstruct Device {\n\tstatic constexpr const char *type [[maybe_unused]] = \"deai.plugin.udev:Device\";\n\tudev_device *device;\n\tDevice(Ref<Object> &&ctx_, const char *syspath) {\n\t\tauto ctx = std::move(ctx_); \/\/ Move the context object\n\t\tauto object_ref = util::unsafe_to_object_ref(*this);\n\t\tauto &ctx_inner = util::unsafe_to_inner<Context>(ctx);\n\t\tdevice = udev_device_new_from_syspath(ctx_inner.context, syspath);\n\n\t\t\/\/ libudev keeps a ref to `udev` inside udev_device, so we do the same to\n\t\t\/\/ keep track of the udev context\n\t\tobject_ref.raw_members()[\"__udev_context\"] = Variant::from(std::move(ctx));\n\t}\n\t~Device() {\n\t\tudev_device_unref(device);\n\t}\n};\n\nstruct Module {\nprivate:\n\tauto get_or_create_context() -> Ref<Object> {\n\t\tauto object_ref = util::unsafe_to_object_ref(*this);\n\t\tauto context_ref = object_ref.raw_members()[\"__udev_context\"];\n\t\tstd::optional<Variant> maybe_context_ref = context_ref;\n\t\tif (maybe_context_ref.has_value()) {\n\t\t\tauto maybe_context =\n\t\t\t    maybe_context_ref->to<WeakRef<Object>>().value().upgrade();\n\t\t\tif (maybe_context.has_value()) {\n\t\t\t\treturn *maybe_context;\n\t\t\t}\n\t\t}\n\t\tauto context = util::new_object<Context>();\n\t\tauto weak_context = context.downgrade();\n\t\tcontext_ref = Variant::from(std::move(weak_context));\n\t\treturn context;\n\t}\n\npublic:\n\tstatic constexpr const char *type [[maybe_unused]] = \"deai.plugin.udev:Module\";\n\tauto device_from_dev_node(std::string_view dev_node) -> Ref<Object> {\n\t\tauto context = get_or_create_context();\n\t\tauto &context_inner = util::unsafe_to_inner<Context>(context);\n\t\tauto *e = udev_enumerate_new(context_inner.context);\n\t\tstd::string dev_node_copy{dev_node.data(), dev_node.size()};\n\t\tudev_enumerate_add_match_property(e, \"DEVNAME\", dev_node_copy.c_str());\n\t\tudev_enumerate_scan_devices(e);\n\n\t\tauto *entry = udev_enumerate_get_list_entry(e);\n\t\tauto ret = util::new_object<Device>(std::move(context),\n\t\t                                    udev_list_entry_get_name(entry));\n\n\t\tudev_enumerate_unref(e);\n\t\treturn ret;\n\t}\n};\n\nDEAI_CPP_PLUGIN_ENTRY_POINT(di) {\n\tauto obj = util::new_object<Module>();\n\tauto &module = util::unsafe_to_inner<Module>(obj);\n\tutil::add_method<&Module::device_from_dev_node>(module, \"device_from_dev_node\");\n\tstatic_cast<void>(di->register_module(\"udev\", obj));\n\treturn 0;\n}\n}        \/\/ namespace\n<|endoftext|>"}
{"text":"<commit_before>#include <Halide.h>\n#include <stdio.h>\n\nusing namespace Halide;\n\nstruct event {\n    char func;\n    int event_type;\n    int type_code, bits, width, value_index;\n    int num_int_args;\n    int int_args[4];\n    float value[4];\n};\n\nevent trace[1024];\nint n_trace = 0;\n\n\/\/ Print an event in a human-readable way\nvoid print_event(event e) {\n    assert(e.num_int_args <= 4 && e.width <= 4);\n\n    const char *event_types[] = {\"Load\",\n                                 \"Store\",\n                                 \"Begin realization\",\n                                 \"End realization\",\n                                 \"Produce\",\n                                 \"Update\",\n                                 \"Consume\",\n                                 \"End consume\"};\n    assert(e.event_type >= 0 && e.event_type <= 8);\n    printf(\"%s \", event_types[e.event_type]);\n\n    printf(\"%c.%d[\", e.func, e.value_index);\n    for (int i = 0; i < e.num_int_args; i++) {\n        if (i > 0) printf(\", \");\n        printf(\"%d\", e.int_args[i]);\n    }\n    printf(\"] [\");\n    for (int i = 0; i < e.width; i++) {\n        if (i > 0) printf(\", \");\n        printf(\"%f\", e.value[i]);\n    }\n    printf(\"]\\n\");\n}\n\n\/\/ Print an event in a way suitable for inclusion in source code\nvoid print_event_source(event e) {\n    printf(\"{%d, %d, %d, %d, %d, %d, %d, {%d, %d, %d, %d}, {%f, %f, %f, %f}},\\n\",\n           e.func, e.event_type, e.type_code, e.bits, e.width, e.value_index,\n           e.num_int_args, e.int_args[0], e.int_args[1], e.int_args[2], e.int_args[3],\n           e.value[0], e.value[1], e.value[2], e.value[3]);\n}\n\n\/\/ Are two floats nearly equal?\nbool float_match(float a, float b) {\n    return ((a - 0.001f) < b) && ((a + 0.001f) > b);\n}\n\n\/\/ Are two events equal?\nbool events_match(event a, event b) {\n    return (a.func == b.func &&\n            a.event_type == b.event_type &&\n            a.type_code == b.type_code &&\n            a.bits == b.bits &&\n            a.width == b.width &&\n            a.value_index == b.value_index &&\n            a.num_int_args == b.num_int_args &&\n            a.int_args[0] == b.int_args[0] &&\n            a.int_args[1] == b.int_args[1] &&\n            a.int_args[2] == b.int_args[2] &&\n            a.int_args[3] == b.int_args[3] &&\n            float_match(a.value[0], b.value[0]) &&\n            float_match(a.value[1], b.value[1]) &&\n            float_match(a.value[2], b.value[2]) &&\n            float_match(a.value[3], b.value[3]));\n}\n\nvoid my_trace(const char *function, int event_type,\n              int type_code, int bits, int width,\n              int value_index, const void *value,\n              int num_int_args, const int *int_args) {\n\n    assert(num_int_args <= 4 && width <= 4);\n\n    \/\/ Record this event in the trace array\n    event e = {0};\n    e.func = function[0];\n    e.event_type = event_type;\n    e.type_code = type_code;\n    e.bits = bits;\n    e.width = width;\n    e.value_index = value_index;\n    e.num_int_args = num_int_args;\n    for (int i = 0; i < num_int_args; i++) {\n        e.int_args[i] = int_args[i];\n    }\n    for (int i = 0; i < width; i++) {\n        e.value[i] = ((const float *)value)[i];\n    }\n    trace[n_trace++] = e;\n}\n\nint main(int argc, char **argv) {\n\n    Func f(\"f\"), g(\"g\");\n    Var x;\n    g(x) = Tuple(sin(x*0.1f), cos(x*0.1f));\n    f(x) = g(x)[0] + g(x+1)[1];\n\n    f.vectorize(x, 4);\n    f.trace_stores();\n    f.trace_realizations();\n\n    g.vectorize(x, 4);\n    g.store_root().compute_at(f, x);\n    g.trace_stores().trace_loads().trace_realizations();\n\n    f.set_custom_trace(&my_trace);\n    f.realize(10);\n\n    \/\/ The golden trace, recorded when this test was written\n    event correct_trace[] = {\n        {103, 2, 0, 32, 1, 0, 2, {0, 14, 0, 0}, {0.000000, 0.000000, 0.000000, 0.000000}},\n        {103, 4, 0, 32, 1, 0, 2, {0, 5, 0, 0}, {0.000000, 0.000000, 0.000000, 0.000000}},\n        {103, 1, 2, 32, 4, 0, 4, {0, 1, 2, 3}, {0.000000, 0.099833, 0.198669, 0.295520}},\n        {103, 1, 2, 32, 4, 1, 4, {0, 1, 2, 3}, {1.000000, 0.995004, 0.980067, 0.955337}},\n        {103, 1, 2, 32, 4, 0, 4, {1, 2, 3, 4}, {0.099833, 0.198669, 0.295520, 0.389418}},\n        {103, 1, 2, 32, 4, 1, 4, {1, 2, 3, 4}, {0.995004, 0.980067, 0.955337, 0.921061}},\n        {103, 6, 0, 32, 1, 0, 2, {0, 5, 0, 0}, {0.000000, 0.000000, 0.000000, 0.000000}},\n        {103, 0, 2, 32, 4, 1, 4, {1, 2, 3, 4}, {0.995004, 0.980067, 0.955337, 0.921061}},\n        {103, 0, 2, 32, 4, 0, 4, {0, 1, 2, 3}, {0.000000, 0.099833, 0.198669, 0.295520}},\n        {102, 1, 2, 32, 4, 0, 4, {0, 1, 2, 3}, {0.995004, 1.079900, 1.154006, 1.216581}},\n        {103, 7, 0, 32, 1, 0, 2, {0, 5, 0, 0}, {0.000000, 0.000000, 0.000000, 0.000000}},\n        {103, 4, 0, 32, 1, 0, 2, {5, 4, 0, 0}, {0.000000, 0.000000, 0.000000, 0.000000}},\n        {103, 1, 2, 32, 4, 0, 4, {5, 6, 7, 8}, {0.479426, 0.564642, 0.644218, 0.717356}},\n        {103, 1, 2, 32, 4, 1, 4, {5, 6, 7, 8}, {0.877583, 0.825336, 0.764842, 0.696707}},\n        {103, 6, 0, 32, 1, 0, 2, {5, 4, 0, 0}, {0.000000, 0.000000, 0.000000, 0.000000}},\n        {103, 0, 2, 32, 4, 1, 4, {5, 6, 7, 8}, {0.877583, 0.825336, 0.764842, 0.696707}},\n        {103, 0, 2, 32, 4, 0, 4, {4, 5, 6, 7}, {0.389418, 0.479426, 0.564642, 0.644218}},\n        {102, 1, 2, 32, 4, 0, 4, {4, 5, 6, 7}, {1.267001, 1.304761, 1.329485, 1.340924}},\n        {103, 7, 0, 32, 1, 0, 2, {5, 4, 0, 0}, {0.000000, 0.000000, 0.000000, 0.000000}},\n        {103, 4, 0, 32, 1, 0, 2, {9, 2, 0, 0}, {0.000000, 0.000000, 0.000000, 0.000000}},\n        {103, 1, 2, 32, 4, 0, 4, {9, 10, 11, 12}, {0.783327, 0.841471, 0.891207, 0.932039}},\n        {103, 1, 2, 32, 4, 1, 4, {9, 10, 11, 12}, {0.621610, 0.540302, 0.453596, 0.362358}},\n        {103, 6, 0, 32, 1, 0, 2, {9, 2, 0, 0}, {0.000000, 0.000000, 0.000000, 0.000000}},\n        {103, 0, 2, 32, 4, 1, 4, {7, 8, 9, 10}, {0.764842, 0.696707, 0.621610, 0.540302}},\n        {103, 0, 2, 32, 4, 0, 4, {6, 7, 8, 9}, {0.564642, 0.644218, 0.717356, 0.783327}},\n        {102, 1, 2, 32, 4, 0, 4, {6, 7, 8, 9}, {1.329485, 1.340924, 1.338966, 1.323629}},\n        {103, 7, 0, 32, 1, 0, 2, {9, 2, 0, 0}, {0.000000, 0.000000, 0.000000, 0.000000}},\n        {103, 3, 0, 32, 1, 0, 2, {0, 14, 0, 0}, {0.000000, 0.000000, 0.000000, 0.000000}}};\n\n    int correct_trace_length = sizeof(correct_trace)\/sizeof(correct_trace[0]);\n\n    int n = n_trace > correct_trace_length ? n_trace : correct_trace_length;\n    for (int i = 0; i < n; i++) {\n        event recorded;\n        if (i < n_trace) recorded = trace[i];\n        event correct;\n        if (i < correct_trace_length) correct = correct_trace[i];\n\n        if (!events_match(recorded, correct)) {\n            printf(\"Traces differs at event %d:\\n\"\n                   \"-------------------------------\\n\"\n                   \"Correct trace:\\n\", i);\n            for (int j = 0; j < correct_trace_length; j++) {\n                if (j == i) printf(\" ===> \");\n                print_event(correct_trace[j]);\n            }\n            printf(\"-------------------------------\\n\"\n                   \"Trace encountered:\\n\");\n            for (int j = 0; j < n_trace; j++) {\n                if (j == i) printf(\" ===> \");\n                print_event(trace[j]);\n            }\n            printf(\"-------------------------------\\n\");\n            return -1;\n        }\n    }\n\n    printf(\"Success!\\n\");\n    return 0;\n}\n\n<commit_msg>Made tracing test tolerant of reordered loads<commit_after>#include <Halide.h>\n#include <stdio.h>\n\nusing namespace Halide;\n\nstruct event {\n    char func;\n    int event_type;\n    int type_code, bits, width, value_index;\n    int num_int_args;\n    int int_args[4];\n    float value[4];\n};\n\nevent trace[1024];\nint n_trace = 0;\n\n\/\/ Print an event in a human-readable way\nvoid print_event(event e) {\n    assert(e.num_int_args <= 4 && e.width <= 4);\n\n    const char *event_types[] = {\"Load\",\n                                 \"Store\",\n                                 \"Begin realization\",\n                                 \"End realization\",\n                                 \"Produce\",\n                                 \"Update\",\n                                 \"Consume\",\n                                 \"End consume\"};\n    assert(e.event_type >= 0 && e.event_type <= 8);\n    printf(\"%s \", event_types[e.event_type]);\n\n    printf(\"%c.%d[\", e.func, e.value_index);\n    for (int i = 0; i < e.num_int_args; i++) {\n        if (i > 0) printf(\", \");\n        printf(\"%d\", e.int_args[i]);\n    }\n    printf(\"] [\");\n    for (int i = 0; i < e.width; i++) {\n        if (i > 0) printf(\", \");\n        printf(\"%f\", e.value[i]);\n    }\n    printf(\"]\\n\");\n}\n\n\/\/ Print an event in a way suitable for inclusion in source code\nvoid print_event_source(event e) {\n    printf(\"{%d, %d, %d, %d, %d, %d, %d, {%d, %d, %d, %d}, {%f, %f, %f, %f}},\\n\",\n           e.func, e.event_type, e.type_code, e.bits, e.width, e.value_index,\n           e.num_int_args, e.int_args[0], e.int_args[1], e.int_args[2], e.int_args[3],\n           e.value[0], e.value[1], e.value[2], e.value[3]);\n}\n\n\/\/ Are two floats nearly equal?\nbool float_match(float a, float b) {\n    return ((a - 0.001f) < b) && ((a + 0.001f) > b);\n}\n\n\/\/ Are two events equal?\nbool events_match(event a, event b) {\n    return (a.func == b.func &&\n            a.event_type == b.event_type &&\n            a.type_code == b.type_code &&\n            a.bits == b.bits &&\n            a.width == b.width &&\n            a.value_index == b.value_index &&\n            a.num_int_args == b.num_int_args &&\n            a.int_args[0] == b.int_args[0] &&\n            a.int_args[1] == b.int_args[1] &&\n            a.int_args[2] == b.int_args[2] &&\n            a.int_args[3] == b.int_args[3] &&\n            float_match(a.value[0], b.value[0]) &&\n            float_match(a.value[1], b.value[1]) &&\n            float_match(a.value[2], b.value[2]) &&\n            float_match(a.value[3], b.value[3]));\n}\n\nvoid my_trace(const char *function, int event_type,\n              int type_code, int bits, int width,\n              int value_index, const void *value,\n              int num_int_args, const int *int_args) {\n\n    assert(num_int_args <= 4 && width <= 4);\n\n    \/\/ Record this event in the trace array\n    event e = {0};\n    e.func = function[0];\n    e.event_type = event_type;\n    e.type_code = type_code;\n    e.bits = bits;\n    e.width = width;\n    e.value_index = value_index;\n    e.num_int_args = num_int_args;\n    for (int i = 0; i < num_int_args; i++) {\n        e.int_args[i] = int_args[i];\n    }\n    for (int i = 0; i < width; i++) {\n        e.value[i] = ((const float *)value)[i];\n    }\n    trace[n_trace++] = e;\n}\n\nint main(int argc, char **argv) {\n\n    Func f(\"f\"), g(\"g\");\n    Var x;\n    g(x) = Tuple(sin(x*0.1f), cos(x*0.1f));\n    f(x) = g(x)[0] + g(x+1)[1];\n\n    f.vectorize(x, 4);\n    f.trace_stores();\n    f.trace_realizations();\n\n    g.vectorize(x, 4);\n    g.store_root().compute_at(f, x);\n    g.trace_stores().trace_loads().trace_realizations();\n\n    f.set_custom_trace(&my_trace);\n    f.realize(10);\n\n    \/\/ The golden trace, recorded when this test was written\n    event correct_trace[] = {\n        {103, 2, 0, 32, 1, 0, 2, {0, 14, 0, 0}, {0.000000, 0.000000, 0.000000, 0.000000}},\n        {103, 4, 0, 32, 1, 0, 2, {0, 5, 0, 0}, {0.000000, 0.000000, 0.000000, 0.000000}},\n        {103, 1, 2, 32, 4, 0, 4, {0, 1, 2, 3}, {0.000000, 0.099833, 0.198669, 0.295520}},\n        {103, 1, 2, 32, 4, 1, 4, {0, 1, 2, 3}, {1.000000, 0.995004, 0.980067, 0.955337}},\n        {103, 1, 2, 32, 4, 0, 4, {1, 2, 3, 4}, {0.099833, 0.198669, 0.295520, 0.389418}},\n        {103, 1, 2, 32, 4, 1, 4, {1, 2, 3, 4}, {0.995004, 0.980067, 0.955337, 0.921061}},\n        {103, 6, 0, 32, 1, 0, 2, {0, 5, 0, 0}, {0.000000, 0.000000, 0.000000, 0.000000}},\n        {103, 0, 2, 32, 4, 1, 4, {1, 2, 3, 4}, {0.995004, 0.980067, 0.955337, 0.921061}},\n        {103, 0, 2, 32, 4, 0, 4, {0, 1, 2, 3}, {0.000000, 0.099833, 0.198669, 0.295520}},\n        {102, 1, 2, 32, 4, 0, 4, {0, 1, 2, 3}, {0.995004, 1.079900, 1.154006, 1.216581}},\n        {103, 7, 0, 32, 1, 0, 2, {0, 5, 0, 0}, {0.000000, 0.000000, 0.000000, 0.000000}},\n        {103, 4, 0, 32, 1, 0, 2, {5, 4, 0, 0}, {0.000000, 0.000000, 0.000000, 0.000000}},\n        {103, 1, 2, 32, 4, 0, 4, {5, 6, 7, 8}, {0.479426, 0.564642, 0.644218, 0.717356}},\n        {103, 1, 2, 32, 4, 1, 4, {5, 6, 7, 8}, {0.877583, 0.825336, 0.764842, 0.696707}},\n        {103, 6, 0, 32, 1, 0, 2, {5, 4, 0, 0}, {0.000000, 0.000000, 0.000000, 0.000000}},\n        {103, 0, 2, 32, 4, 1, 4, {5, 6, 7, 8}, {0.877583, 0.825336, 0.764842, 0.696707}},\n        {103, 0, 2, 32, 4, 0, 4, {4, 5, 6, 7}, {0.389418, 0.479426, 0.564642, 0.644218}},\n        {102, 1, 2, 32, 4, 0, 4, {4, 5, 6, 7}, {1.267001, 1.304761, 1.329485, 1.340924}},\n        {103, 7, 0, 32, 1, 0, 2, {5, 4, 0, 0}, {0.000000, 0.000000, 0.000000, 0.000000}},\n        {103, 4, 0, 32, 1, 0, 2, {9, 2, 0, 0}, {0.000000, 0.000000, 0.000000, 0.000000}},\n        {103, 1, 2, 32, 4, 0, 4, {9, 10, 11, 12}, {0.783327, 0.841471, 0.891207, 0.932039}},\n        {103, 1, 2, 32, 4, 1, 4, {9, 10, 11, 12}, {0.621610, 0.540302, 0.453596, 0.362358}},\n        {103, 6, 0, 32, 1, 0, 2, {9, 2, 0, 0}, {0.000000, 0.000000, 0.000000, 0.000000}},\n        {103, 0, 2, 32, 4, 1, 4, {7, 8, 9, 10}, {0.764842, 0.696707, 0.621610, 0.540302}},\n        {103, 0, 2, 32, 4, 0, 4, {6, 7, 8, 9}, {0.564642, 0.644218, 0.717356, 0.783327}},\n        {102, 1, 2, 32, 4, 0, 4, {6, 7, 8, 9}, {1.329485, 1.340924, 1.338966, 1.323629}},\n        {103, 7, 0, 32, 1, 0, 2, {9, 2, 0, 0}, {0.000000, 0.000000, 0.000000, 0.000000}},\n        {103, 3, 0, 32, 1, 0, 2, {0, 14, 0, 0}, {0.000000, 0.000000, 0.000000, 0.000000}}};\n\n    int correct_trace_length = sizeof(correct_trace)\/sizeof(correct_trace[0]);\n\n    int n = n_trace > correct_trace_length ? n_trace : correct_trace_length;\n    for (int i = 0; i < n; i++) {\n        event recorded;\n        if (i < n_trace) recorded = trace[i];\n        event correct;\n        if (i < correct_trace_length) correct = correct_trace[i];\n\n        if (!events_match(recorded, correct)) {\n            \/\/ Uh oh. Maybe it's just a reordered load.\n            if (i > 0 && events_match(recorded, correct_trace[i-1]) &&\n                recorded.event_type == 0 && correct.event_type == 0) {\n                \/\/ Phew.\n                continue;\n            }\n\n            if (i < correct_trace_length-1 && \n                events_match(recorded, correct_trace[i+1]) &&\n                recorded.event_type == 0 && correct.event_type == 0) {\n                \/\/ Phew.\n                continue;\n            }\n\n            printf(\"Traces differs at event %d:\\n\"\n                   \"-------------------------------\\n\"\n                   \"Correct trace:\\n\", i);\n            for (int j = 0; j < correct_trace_length; j++) {\n                if (j == i) printf(\" ===> \");\n                print_event(correct_trace[j]);\n            }\n            printf(\"-------------------------------\\n\"\n                   \"Trace encountered:\\n\");\n            for (int j = 0; j < n_trace; j++) {\n                if (j == i) printf(\" ===> \");\n                print_event(trace[j]);\n            }\n            printf(\"-------------------------------\\n\");\n            return -1;\n        }\n    }\n\n    printf(\"Success!\\n\");\n    return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2009-2012 The Bitcoin developers\n\/\/ Distributed under the MIT\/X11 software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <boost\/assign\/list_of.hpp> \/\/ for 'map_list_of()'\n#include <boost\/foreach.hpp>\n\n#include \"checkpoints.h\"\n\n#include \"txdb.h\"\n#include \"main.h\"\n#include \"uint256.h\"\n\n\nstatic const int nCheckpointSpan = 500;\n\nnamespace Checkpoints\n{\n    typedef std::map<int, uint256> MapCheckpoints;\n\n    \/\/\n    \/\/ What makes a good checkpoint block?\n    \/\/ + Is surrounded by blocks with reasonable timestamps\n    \/\/   (no blocks before with a timestamp after, none after with\n    \/\/    timestamp before)\n    \/\/ + Contains no strange transactions\n    \/\/\n    static MapCheckpoints mapCheckpoints =\n        boost::assign::map_list_of\n        ( 0,   uint256(\"0x000007d69ba0f79b4823effb06b08663e2e4c51ed03aaeb547e2e0b83fd37b73\") ) \/\/ genesis\n    ;\n\n    \/\/ TestNet has no checkpoints\n    static MapCheckpoints mapCheckpointsTestnet =\n            boost::assign::map_list_of\n            ( 0,   uint256(\"0000a17e5bfeea11754901c7acf929cf157856b386b851c5a3f7920b9e5dab49\") ) \/\/ genesis\n        ;\n\n    bool CheckHardened(int nHeight, const uint256& hash)\n    {\n        MapCheckpoints& checkpoints = (TestNet() ? mapCheckpointsTestnet : mapCheckpoints);\n\n        MapCheckpoints::const_iterator i = checkpoints.find(nHeight);\n        if (i == checkpoints.end()) return true;\n        return hash == i->second;\n    }\n\n    int GetTotalBlocksEstimate()\n    {\n        MapCheckpoints& checkpoints = (TestNet() ? mapCheckpointsTestnet : mapCheckpoints);\n\n        if (checkpoints.empty())\n            return 0;\n        return checkpoints.rbegin()->first;\n    }\n\n    CBlockIndex* GetLastCheckpoint(const std::map<uint256, CBlockIndex*>& mapBlockIndex)\n    {\n        MapCheckpoints& checkpoints = (TestNet() ? mapCheckpointsTestnet : mapCheckpoints);\n\n        BOOST_REVERSE_FOREACH(const MapCheckpoints::value_type& i, checkpoints)\n        {\n            const uint256& hash = i.second;\n            std::map<uint256, CBlockIndex*>::const_iterator t = mapBlockIndex.find(hash);\n            if (t != mapBlockIndex.end())\n                return t->second;\n        }\n        return NULL;\n    }\n\n    \/\/ Automatically select a suitable sync-checkpoint \n    const CBlockIndex* AutoSelectSyncCheckpoint()\n    {\n        const CBlockIndex *pindex = pindexBest;\n        \/\/ Search backward for a block within max span and maturity window\n        while (pindex->pprev && pindex->nHeight + nCheckpointSpan > pindexBest->nHeight)\n            pindex = pindex->pprev;\n        return pindex;\n    }\n\n    \/\/ Check against synchronized checkpoint\n    bool CheckSync(int nHeight)\n    {\n        const CBlockIndex* pindexSync = AutoSelectSyncCheckpoint();\n\n        if (nHeight <= pindexSync->nHeight)\n            return false;\n        return true;\n    }\n}\n<commit_msg>Add additional checkpoints<commit_after>\/\/ 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 <boost\/assign\/list_of.hpp> \/\/ for 'map_list_of()'\n#include <boost\/foreach.hpp>\n\n#include \"checkpoints.h\"\n\n#include \"txdb.h\"\n#include \"main.h\"\n#include \"uint256.h\"\n\n\nstatic const int nCheckpointSpan = 500;\n\nnamespace Checkpoints\n{\n    typedef std::map<int, uint256> MapCheckpoints;\n\n    \/\/\n    \/\/ What makes a good checkpoint block?\n    \/\/ + Is surrounded by blocks with reasonable timestamps\n    \/\/   (no blocks before with a timestamp after, none after with\n    \/\/    timestamp before)\n    \/\/ + Contains no strange transactions\n    \/\/\n    static MapCheckpoints mapCheckpoints =\n        boost::assign::map_list_of\n        (  0,         uint256(\"0x000007d69ba0f79b4823effb06b08663e2e4c51ed03aaeb547e2e0b83fd37b73\") ) \/\/ genesis\n        (  2,         uint256(\"0x750129f3369574f0c397e28273cc5e795f5a78d3c43eba4b58583bac96e62e18\") ) \/\/ Premine for swap\n        (  2500,      uint256(\"0x4a7f2569e40a991bda8fc8510b31e0b79344719c03fe96a5c3d2069c15aee89a\") ) \n        (  5000,      uint256(\"0xc207e945e7b09b79b6601be24d891a96a1a632933887fc8f07ee4f7a1af2e612\") ) \n        (  10000,     uint256(\"0xb191f69a673fe281d091003c41729204aa1b9b86b839c03f49f8665bffd87e53\") ) \n\t\t(  25000,     uint256(\"0x2fea86d43efd05fe0b4c9a78d71a5a3238e2133476aeddc56d7128c510405bd9\") ) \n\t\t(  50000,     uint256(\"0xc0e4332839da0d1f8f41702da22efa2c438c1a108ce6a8ec7a567798ff7e7869\") ) \n\t\t(  100000,    uint256(\"0xfa254c1010b93ed6944d9d3489792a034ae1ab5d795e0cfb538fccaac672f7c5\") ) \n\t\t(  200000,    uint256(\"0x381945f7b9b8ab95b6b9de199a2027fd9ae1f57ad4b766369e8a1a9b27448b49\") ) \n\t\t(  300000,    uint256(\"0x60aca7679ad42be9b1359a18c9823544b471ed113077efee5a7097d80905103e\") ) \n\t\t(  400000,    uint256(\"0xbd3ff208033a486ae4dc1d94020bad478433a7933c2109cd8cf4675ee0477fe2\") ) \n\t\t(  609332,    uint256(\"0xc2683173c64c3cd223ac2cc2a8d8f841b7e2c15142e89d1bed3b6dcf2580f22c\") ) \/\/ Hardfork PoS increase\n\t\t(  650000,    uint256(\"0x2443cb1d00a0a2b1679fb9b203946cbf9fdd662b8b36322505c96c9f20157451\") ) \n\t\t(  700000,    uint256(\"0xc3b608dfaf97dfef9e74a4095a69981692186c1f86f9e94de4a63b6ad2a6f733\") ) \n\t\t(  750000,    uint256(\"0xc2ac6306b609f6912aa7a8e617050dc0330d7a8a10c3943d27d14b4b9b6f88cd\") ) \n\t\t(  800000,    uint256(\"0x0710b931960777f43ef5ed27beaa615a86b6992cfcb8174d16221cacc6860f15\") ) \n\t\t(  850000,    uint256(\"0x95ce0d9ac188f2463360f856a71141c5e393a8625941d50bda0f5a2c09cf416b\") ) \n\t\t(  900000,    uint256(\"0x5885eb82e0afb10f2bf5f07d6362920ab45257b42f8867e16f04586b9b2c93c8\") ) \n    ;\n\n    \/\/ TestNet has no checkpoints\n    static MapCheckpoints mapCheckpointsTestnet =\n            boost::assign::map_list_of\n            ( 0,   uint256(\"0000a17e5bfeea11754901c7acf929cf157856b386b851c5a3f7920b9e5dab49\") ) \/\/ genesis\n        ;\n\n    bool CheckHardened(int nHeight, const uint256& hash)\n    {\n        MapCheckpoints& checkpoints = (TestNet() ? mapCheckpointsTestnet : mapCheckpoints);\n\n        MapCheckpoints::const_iterator i = checkpoints.find(nHeight);\n        if (i == checkpoints.end()) return true;\n        return hash == i->second;\n    }\n\n    int GetTotalBlocksEstimate()\n    {\n        MapCheckpoints& checkpoints = (TestNet() ? mapCheckpointsTestnet : mapCheckpoints);\n\n        if (checkpoints.empty())\n            return 0;\n        return checkpoints.rbegin()->first;\n    }\n\n    CBlockIndex* GetLastCheckpoint(const std::map<uint256, CBlockIndex*>& mapBlockIndex)\n    {\n        MapCheckpoints& checkpoints = (TestNet() ? mapCheckpointsTestnet : mapCheckpoints);\n\n        BOOST_REVERSE_FOREACH(const MapCheckpoints::value_type& i, checkpoints)\n        {\n            const uint256& hash = i.second;\n            std::map<uint256, CBlockIndex*>::const_iterator t = mapBlockIndex.find(hash);\n            if (t != mapBlockIndex.end())\n                return t->second;\n        }\n        return NULL;\n    }\n\n    \/\/ Automatically select a suitable sync-checkpoint \n    const CBlockIndex* AutoSelectSyncCheckpoint()\n    {\n        const CBlockIndex *pindex = pindexBest;\n        \/\/ Search backward for a block within max span and maturity window\n        while (pindex->pprev && pindex->nHeight + nCheckpointSpan > pindexBest->nHeight)\n            pindex = pindex->pprev;\n        return pindex;\n    }\n\n    \/\/ Check against synchronized checkpoint\n    bool CheckSync(int nHeight)\n    {\n        const CBlockIndex* pindexSync = AutoSelectSyncCheckpoint();\n\n        if (nHeight <= pindexSync->nHeight)\n            return false;\n        return true;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include <unordered_map>\n#include <mutex>\n\n#include \"catch.hpp\"\n#include \"..\/os.h\"\n#include \"..\/generated\/test_lib.h\"\n#include \"..\/..\/runpath\/init.h\"\n#include \"..\/..\/..\/intercom-cpp\/src\/cominterop.h\"\n#include \"..\/..\/..\/intercom-cpp\/src\/activator.h\"\n\nusing intercom::Activator;\n\n#pragma comment(linker, \"\\\"\/manifestdependency:name='test_lib' type='win32' version='1.0.0.0'\\\"\" )\n\n\nvoid InitializeRuntime()\n{\n    CoInitializeEx( nullptr, COINIT_APARTMENTTHREADED );\n\n    \/\/ Ensure the library \"runpath\" won't get optimized away.\n    init_runpath();\n\n    REQUIRE( test_lib::Descriptor::is_available() );\n}\n\nvoid UninitializeRuntime()\n{\n    CoUninitialize();\n}\n\n<commit_msg>Fixes after headers were renamed<commit_after>\n#include <unordered_map>\n#include <mutex>\n#include <Objbase.h>\n\n#include \"..\/catch.hpp\"\n#include \"..\/os.hpp\"\n#include \"..\/generated\/test_lib.hpp\"\n#include \"..\/..\/runpath\/init.h\"\n#include \"..\/..\/..\/intercom-cpp\/src\/cominterop.hpp\"\n#include \"..\/..\/..\/intercom-cpp\/src\/activator.hpp\"\n\nusing intercom::Activator;\n\n#pragma comment(linker, \"\\\"\/manifestdependency:name='test_lib' type='win32' version='1.0.0.0'\\\"\" )\n\n\nvoid InitializeRuntime()\n{\n    CoInitializeEx( nullptr, COINIT_APARTMENTTHREADED );\n\n    \/\/ Ensure the library \"runpath\" won't get optimized away.\n    init_runpath();\n\n    REQUIRE( test_lib::Descriptor::is_available() );\n}\n\nvoid UninitializeRuntime()\n{\n    CoUninitialize();\n}\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 <forward_list>\n#include <functional>\n#include <sys\/time.h>\n#include <sys\/resource.h>\n#include <sys\/signal.h>\n#include <thread>\n\n#include <gflags\/gflags.h>\n#include <grpc\/support\/alloc.h>\n#include <grpc\/support\/host_port.h>\n#include <grpc++\/async_unary_call.h>\n#include <grpc++\/config.h>\n#include <grpc++\/server.h>\n#include <grpc++\/server_builder.h>\n#include <grpc++\/server_context.h>\n#include <grpc++\/server_credentials.h>\n#include <grpc++\/status.h>\n#include <grpc++\/stream.h>\n#include <gtest\/gtest.h>\n#include \"src\/cpp\/server\/thread_pool.h\"\n#include \"test\/core\/util\/grpc_profiler.h\"\n#include \"test\/cpp\/qps\/qpstest.pb.h\"\n#include \"test\/cpp\/qps\/server.h\"\n\n#include <grpc\/grpc.h>\n#include <grpc\/support\/log.h>\n\nnamespace grpc {\nnamespace testing {\n\nclass AsyncQpsServerTest : public Server {\n public:\n  AsyncQpsServerTest(const ServerConfig &config, int port)\n      : srv_cq_(), async_service_(&srv_cq_), server_(nullptr) {\n    char *server_address = NULL;\n    gpr_join_host_port(&server_address, \"::\", port);\n\n    ServerBuilder builder;\n    builder.AddPort(server_address, InsecureServerCredentials());\n    gpr_free(server_address);\n\n    builder.RegisterAsyncService(&async_service_);\n\n    server_ = builder.BuildAndStart();\n\n    using namespace std::placeholders;\n    request_unary_ = std::bind(&TestService::AsyncService::RequestUnaryCall,\n                               &async_service_, _1, _2, _3, &srv_cq_, _4);\n    request_streaming_ =\n      std::bind(&TestService::AsyncService::RequestStreamingCall,\n\t\t&async_service_, _1, _2, &srv_cq_, _3);\n    for (int i = 0; i < 100; i++) {\n      contexts_.push_front(\n          new ServerRpcContextUnaryImpl<SimpleRequest, SimpleResponse>(\n              request_unary_, ProcessRPC));\n      contexts_.push_front(\n          new ServerRpcContextStreamingImpl<SimpleRequest, SimpleResponse>(\n              request_streaming_, ProcessRPC));\n    }\n    for (int i = 0; i < config.threads(); i++) {\n      threads_.push_back(std::thread([=]() {\n        \/\/ Wait until work is available or we are shutting down\n        bool ok;\n        void *got_tag;\n        while (srv_cq_.Next(&got_tag, &ok)) {\n\t  ServerRpcContext *ctx = detag(got_tag);\n\t  \/\/ The tag is a pointer to an RPC context to invoke\n\t  if (ctx->RunNextState(ok) == false) {\n\t    \/\/ this RPC context is done, so refresh it\n\t    ctx->Reset();\n\t  }\n        }\n        return;\n      }));\n    }\n  }\n  ~AsyncQpsServerTest() {\n    server_->Shutdown();\n    srv_cq_.Shutdown();\n    for (auto &thr : threads_) {\n      thr.join();\n    }\n    while (!contexts_.empty()) {\n      delete contexts_.front();\n      contexts_.pop_front();\n    }\n  }\n\n private:\n  class ServerRpcContext {\n   public:\n    ServerRpcContext() {}\n    virtual ~ServerRpcContext(){};\n    virtual bool RunNextState(bool) = 0;  \/\/ next state, return false if done\n    virtual void Reset() = 0;         \/\/ start this back at a clean state\n  };\n  static void *tag(ServerRpcContext *func) {\n    return reinterpret_cast<void *>(func);\n  }\n  static ServerRpcContext *detag(void *tag) {\n    return reinterpret_cast<ServerRpcContext *>(tag);\n  }\n\n  template <class RequestType, class ResponseType>\n  class ServerRpcContextUnaryImpl GRPC_FINAL : public ServerRpcContext {\n   public:\n    ServerRpcContextUnaryImpl(\n        std::function<void(ServerContext *, RequestType *,\n                           grpc::ServerAsyncResponseWriter<ResponseType> *,\n                           void *)> request_method,\n        std::function<grpc::Status(const RequestType *, ResponseType *)>\n            invoke_method)\n        : next_state_(&ServerRpcContextUnaryImpl::invoker),\n          request_method_(request_method),\n          invoke_method_(invoke_method),\n          response_writer_(&srv_ctx_) {\n      request_method_(&srv_ctx_, &req_, &response_writer_,\n                      AsyncQpsServerTest::tag(this));\n    }\n    ~ServerRpcContextUnaryImpl() GRPC_OVERRIDE {}\n    bool RunNextState(bool ok) GRPC_OVERRIDE {return (this->*next_state_)(ok);}\n    void Reset() GRPC_OVERRIDE {\n      srv_ctx_ = ServerContext();\n      req_ = RequestType();\n      response_writer_ =\n          grpc::ServerAsyncResponseWriter<ResponseType>(&srv_ctx_);\n\n      \/\/ Then request the method\n      next_state_ = &ServerRpcContextUnaryImpl::invoker;\n      request_method_(&srv_ctx_, &req_, &response_writer_,\n                      AsyncQpsServerTest::tag(this));\n    }\n\n   private:\n    bool finisher(bool) { return false; }\n    bool invoker(bool ok) {\n      if (!ok)\n\treturn false;\n\n      ResponseType response;\n\n      \/\/ Call the RPC processing function\n      grpc::Status status = invoke_method_(&req_, &response);\n\n      \/\/ Have the response writer work and invoke on_finish when done\n      next_state_ = &ServerRpcContextUnaryImpl::finisher;\n      response_writer_.Finish(response, status, AsyncQpsServerTest::tag(this));\n      return true;\n    }\n    ServerContext srv_ctx_;\n    RequestType req_;\n    bool (ServerRpcContextUnaryImpl::*next_state_)(bool);\n    std::function<void(ServerContext *, RequestType *,\n                       grpc::ServerAsyncResponseWriter<ResponseType> *, void *)>\n        request_method_;\n    std::function<grpc::Status(const RequestType *, ResponseType *)>\n        invoke_method_;\n    grpc::ServerAsyncResponseWriter<ResponseType> response_writer_;\n  };\n\n  template <class RequestType, class ResponseType>\n  class ServerRpcContextStreamingImpl GRPC_FINAL : public ServerRpcContext {\n   public:\n    ServerRpcContextStreamingImpl(\n        std::function<void(ServerContext *, \n                           grpc::ServerAsyncReaderWriter<ResponseType,\n\t\t\t   RequestType> *, void *)> request_method,\n        std::function<grpc::Status(const RequestType *, ResponseType *)>\n            invoke_method)\n        : next_state_(&ServerRpcContextStreamingImpl::request_done),\n          request_method_(request_method),\n          invoke_method_(invoke_method),\n          stream_(&srv_ctx_) {\n      request_method_(&srv_ctx_, &stream_, AsyncQpsServerTest::tag(this));\n    }\n    ~ServerRpcContextStreamingImpl() GRPC_OVERRIDE {\n    }\n    bool RunNextState(bool ok) GRPC_OVERRIDE {return (this->*next_state_)(ok);}\n    void Reset() GRPC_OVERRIDE {\n      srv_ctx_ = ServerContext();\n      req_ = RequestType();\n      stream_ = grpc::ServerAsyncReaderWriter<ResponseType,\n\t\t\t\t\t      RequestType>(&srv_ctx_);\n\n      \/\/ Then request the method\n      next_state_ = &ServerRpcContextStreamingImpl::request_done;\n      request_method_(&srv_ctx_, &stream_, AsyncQpsServerTest::tag(this));\n    }\n\n   private:\n    bool request_done(bool ok) {\n      if (!ok)\n\treturn false;\n      stream_.Read(&req_, AsyncQpsServerTest::tag(this));\n      next_state_ = &ServerRpcContextStreamingImpl::read_done;\n      return true;\n    }\n      \n    bool read_done(bool ok) {\n      if (ok) {\n\t\/\/ invoke the method\n\tResponseType response;\n\t\/\/ Call the RPC processing function\n\tgrpc::Status status = invoke_method_(&req_, &response);\n\t\/\/ initiate the write\n\tstream_.Write(response, AsyncQpsServerTest::tag(this));\n\tnext_state_ = &ServerRpcContextStreamingImpl::write_done;\n      } else {\t\/\/ client has sent writes done\n\t\/\/ finish the stream\n\tstream_.Finish(Status::OK, AsyncQpsServerTest::tag(this));\n\tnext_state_ = &ServerRpcContextStreamingImpl::finish_done;\n      }\n      return true;\n    }\n    bool write_done(bool ok) {\n      \/\/ now go back and get another streaming read!\n      if (ok) {\n\tstream_.Read(&req_, AsyncQpsServerTest::tag(this));\n\tnext_state_ = &ServerRpcContextStreamingImpl::read_done;\n      }\n      else {\n\tstream_.Finish(Status::OK, AsyncQpsServerTest::tag(this));\n\tnext_state_ = &ServerRpcContextStreamingImpl::finish_done;\n      }\n      return true;\n    }\n    bool finish_done(bool ok) {return false; \/* reset the context *\/ }\n\n    ServerContext srv_ctx_;\n    RequestType req_;\n    bool (ServerRpcContextStreamingImpl::*next_state_)(bool);\n    std::function<void(ServerContext *,\n\t\t       grpc::ServerAsyncReaderWriter<ResponseType,\n\t\t       RequestType> *, void *)> request_method_;\n    std::function<grpc::Status(const RequestType *, ResponseType *)>\n        invoke_method_;\n    grpc::ServerAsyncReaderWriter<ResponseType,RequestType> stream_;\n  };\n\n  static Status ProcessRPC(const SimpleRequest *request,\n\t\t\t   SimpleResponse *response) {\n    if (request->response_size() > 0) {\n      if (!SetPayload(request->response_type(), request->response_size(),\n                      response->mutable_payload())) {\n        return Status(grpc::StatusCode::INTERNAL, \"Error creating payload.\");\n      }\n    }\n    return Status::OK;\n  }\n  CompletionQueue srv_cq_;\n  TestService::AsyncService async_service_;\n  std::vector<std::thread> threads_;\n  std::unique_ptr<grpc::Server> server_;\n  std::function<void(ServerContext *, SimpleRequest *,\n                     grpc::ServerAsyncResponseWriter<SimpleResponse> *, void *)>\n      request_unary_;\n  std::function<void(ServerContext *, grpc::ServerAsyncReaderWriter<\n\t\t     SimpleResponse,SimpleRequest> *, void *)>\n      request_streaming_;\n  std::forward_list<ServerRpcContext *> contexts_;\n};\n\nstd::unique_ptr<Server> CreateAsyncServer(const ServerConfig &config,\n                                          int port) {\n  return std::unique_ptr<Server>(new AsyncQpsServerTest(config, port));\n}\n\n}  \/\/ namespace testing\n}  \/\/ namespace grpc\n<commit_msg>Make sure that nothing gets added to cq after shutdown<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 <forward_list>\n#include <functional>\n#include <mutex>\n#include <sys\/time.h>\n#include <sys\/resource.h>\n#include <sys\/signal.h>\n#include <thread>\n\n#include <gflags\/gflags.h>\n#include <grpc\/support\/alloc.h>\n#include <grpc\/support\/host_port.h>\n#include <grpc++\/async_unary_call.h>\n#include <grpc++\/config.h>\n#include <grpc++\/server.h>\n#include <grpc++\/server_builder.h>\n#include <grpc++\/server_context.h>\n#include <grpc++\/server_credentials.h>\n#include <grpc++\/status.h>\n#include <grpc++\/stream.h>\n#include <gtest\/gtest.h>\n#include \"src\/cpp\/server\/thread_pool.h\"\n#include \"test\/core\/util\/grpc_profiler.h\"\n#include \"test\/cpp\/qps\/qpstest.pb.h\"\n#include \"test\/cpp\/qps\/server.h\"\n\n#include <grpc\/grpc.h>\n#include <grpc\/support\/log.h>\n\nnamespace grpc {\nnamespace testing {\n\nclass AsyncQpsServerTest : public Server {\n public:\n  AsyncQpsServerTest(const ServerConfig &config, int port)\n      : srv_cq_(), async_service_(&srv_cq_), server_(nullptr),\n        shutdown_(false) {\n    char *server_address = NULL;\n    gpr_join_host_port(&server_address, \"::\", port);\n\n    ServerBuilder builder;\n    builder.AddPort(server_address, InsecureServerCredentials());\n    gpr_free(server_address);\n\n    builder.RegisterAsyncService(&async_service_);\n\n    server_ = builder.BuildAndStart();\n\n    using namespace std::placeholders;\n    request_unary_ = std::bind(&TestService::AsyncService::RequestUnaryCall,\n                               &async_service_, _1, _2, _3, &srv_cq_, _4);\n    request_streaming_ =\n      std::bind(&TestService::AsyncService::RequestStreamingCall,\n\t\t&async_service_, _1, _2, &srv_cq_, _3);\n    for (int i = 0; i < 100; i++) {\n      contexts_.push_front(\n          new ServerRpcContextUnaryImpl<SimpleRequest, SimpleResponse>(\n              request_unary_, ProcessRPC));\n      contexts_.push_front(\n          new ServerRpcContextStreamingImpl<SimpleRequest, SimpleResponse>(\n              request_streaming_, ProcessRPC));\n    }\n    for (int i = 0; i < config.threads(); i++) {\n      threads_.push_back(std::thread([=]() {\n        \/\/ Wait until work is available or we are shutting down\n        bool ok;\n        void *got_tag;\n        while (srv_cq_.Next(&got_tag, &ok)) {\n\t  ServerRpcContext *ctx = detag(got_tag);\n\t  \/\/ The tag is a pointer to an RPC context to invoke\n\t  if (ctx->RunNextState(ok) == false) {\n\t    \/\/ this RPC context is done, so refresh it\n            std::lock_guard<std::mutex> g(shutdown_mutex_);\n            if (!shutdown_)\n              ctx->Reset();\n\t  }\n        }\n        return;\n      }));\n    }\n  }\n  ~AsyncQpsServerTest() {\n    server_->Shutdown();\n    {\n      std::lock_guard<std::mutex> g(shutdown_mutex_);\n      shutdown_ = true;\n      srv_cq_.Shutdown();\n    }\n    for (auto &thr : threads_) {\n      thr.join();\n    }\n    while (!contexts_.empty()) {\n      delete contexts_.front();\n      contexts_.pop_front();\n    }\n  }\n\n private:\n  class ServerRpcContext {\n   public:\n    ServerRpcContext() {}\n    virtual ~ServerRpcContext(){};\n    virtual bool RunNextState(bool) = 0;  \/\/ next state, return false if done\n    virtual void Reset() = 0;         \/\/ start this back at a clean state\n  };\n  static void *tag(ServerRpcContext *func) {\n    return reinterpret_cast<void *>(func);\n  }\n  static ServerRpcContext *detag(void *tag) {\n    return reinterpret_cast<ServerRpcContext *>(tag);\n  }\n\n  template <class RequestType, class ResponseType>\n  class ServerRpcContextUnaryImpl GRPC_FINAL : public ServerRpcContext {\n   public:\n    ServerRpcContextUnaryImpl(\n        std::function<void(ServerContext *, RequestType *,\n                           grpc::ServerAsyncResponseWriter<ResponseType> *,\n                           void *)> request_method,\n        std::function<grpc::Status(const RequestType *, ResponseType *)>\n            invoke_method)\n        : next_state_(&ServerRpcContextUnaryImpl::invoker),\n          request_method_(request_method),\n          invoke_method_(invoke_method),\n          response_writer_(&srv_ctx_) {\n      request_method_(&srv_ctx_, &req_, &response_writer_,\n                      AsyncQpsServerTest::tag(this));\n    }\n    ~ServerRpcContextUnaryImpl() GRPC_OVERRIDE {}\n    bool RunNextState(bool ok) GRPC_OVERRIDE {return (this->*next_state_)(ok);}\n    void Reset() GRPC_OVERRIDE {\n      srv_ctx_ = ServerContext();\n      req_ = RequestType();\n      response_writer_ =\n          grpc::ServerAsyncResponseWriter<ResponseType>(&srv_ctx_);\n\n      \/\/ Then request the method\n      next_state_ = &ServerRpcContextUnaryImpl::invoker;\n      request_method_(&srv_ctx_, &req_, &response_writer_,\n                      AsyncQpsServerTest::tag(this));\n    }\n\n   private:\n    bool finisher(bool) { return false; }\n    bool invoker(bool ok) {\n      if (!ok)\n\treturn false;\n\n      ResponseType response;\n\n      \/\/ Call the RPC processing function\n      grpc::Status status = invoke_method_(&req_, &response);\n\n      \/\/ Have the response writer work and invoke on_finish when done\n      next_state_ = &ServerRpcContextUnaryImpl::finisher;\n      response_writer_.Finish(response, status, AsyncQpsServerTest::tag(this));\n      return true;\n    }\n    ServerContext srv_ctx_;\n    RequestType req_;\n    bool (ServerRpcContextUnaryImpl::*next_state_)(bool);\n    std::function<void(ServerContext *, RequestType *,\n                       grpc::ServerAsyncResponseWriter<ResponseType> *, void *)>\n        request_method_;\n    std::function<grpc::Status(const RequestType *, ResponseType *)>\n        invoke_method_;\n    grpc::ServerAsyncResponseWriter<ResponseType> response_writer_;\n  };\n\n  template <class RequestType, class ResponseType>\n  class ServerRpcContextStreamingImpl GRPC_FINAL : public ServerRpcContext {\n   public:\n    ServerRpcContextStreamingImpl(\n        std::function<void(ServerContext *,\n                           grpc::ServerAsyncReaderWriter<ResponseType,\n\t\t\t   RequestType> *, void *)> request_method,\n        std::function<grpc::Status(const RequestType *, ResponseType *)>\n            invoke_method)\n        : next_state_(&ServerRpcContextStreamingImpl::request_done),\n          request_method_(request_method),\n          invoke_method_(invoke_method),\n          stream_(&srv_ctx_) {\n      request_method_(&srv_ctx_, &stream_, AsyncQpsServerTest::tag(this));\n    }\n    ~ServerRpcContextStreamingImpl() GRPC_OVERRIDE {\n    }\n    bool RunNextState(bool ok) GRPC_OVERRIDE {return (this->*next_state_)(ok);}\n    void Reset() GRPC_OVERRIDE {\n      srv_ctx_ = ServerContext();\n      req_ = RequestType();\n      stream_ = grpc::ServerAsyncReaderWriter<ResponseType,\n\t\t\t\t\t      RequestType>(&srv_ctx_);\n\n      \/\/ Then request the method\n      next_state_ = &ServerRpcContextStreamingImpl::request_done;\n      request_method_(&srv_ctx_, &stream_, AsyncQpsServerTest::tag(this));\n    }\n\n   private:\n    bool request_done(bool ok) {\n      if (!ok)\n\treturn false;\n      stream_.Read(&req_, AsyncQpsServerTest::tag(this));\n      next_state_ = &ServerRpcContextStreamingImpl::read_done;\n      return true;\n    }\n\n    bool read_done(bool ok) {\n      if (ok) {\n\t\/\/ invoke the method\n\tResponseType response;\n\t\/\/ Call the RPC processing function\n\tgrpc::Status status = invoke_method_(&req_, &response);\n\t\/\/ initiate the write\n\tstream_.Write(response, AsyncQpsServerTest::tag(this));\n\tnext_state_ = &ServerRpcContextStreamingImpl::write_done;\n      } else {\t\/\/ client has sent writes done\n\t\/\/ finish the stream\n\tstream_.Finish(Status::OK, AsyncQpsServerTest::tag(this));\n\tnext_state_ = &ServerRpcContextStreamingImpl::finish_done;\n      }\n      return true;\n    }\n    bool write_done(bool ok) {\n      \/\/ now go back and get another streaming read!\n      if (ok) {\n\tstream_.Read(&req_, AsyncQpsServerTest::tag(this));\n\tnext_state_ = &ServerRpcContextStreamingImpl::read_done;\n      }\n      else {\n\tstream_.Finish(Status::OK, AsyncQpsServerTest::tag(this));\n\tnext_state_ = &ServerRpcContextStreamingImpl::finish_done;\n      }\n      return true;\n    }\n    bool finish_done(bool ok) {return false; \/* reset the context *\/ }\n\n    ServerContext srv_ctx_;\n    RequestType req_;\n    bool (ServerRpcContextStreamingImpl::*next_state_)(bool);\n    std::function<void(ServerContext *,\n\t\t       grpc::ServerAsyncReaderWriter<ResponseType,\n\t\t       RequestType> *, void *)> request_method_;\n    std::function<grpc::Status(const RequestType *, ResponseType *)>\n        invoke_method_;\n    grpc::ServerAsyncReaderWriter<ResponseType,RequestType> stream_;\n  };\n\n  static Status ProcessRPC(const SimpleRequest *request,\n\t\t\t   SimpleResponse *response) {\n    if (request->response_size() > 0) {\n      if (!SetPayload(request->response_type(), request->response_size(),\n                      response->mutable_payload())) {\n        return Status(grpc::StatusCode::INTERNAL, \"Error creating payload.\");\n      }\n    }\n    return Status::OK;\n  }\n  CompletionQueue srv_cq_;\n  TestService::AsyncService async_service_;\n  std::vector<std::thread> threads_;\n  std::unique_ptr<grpc::Server> server_;\n  std::function<void(ServerContext *, SimpleRequest *,\n                     grpc::ServerAsyncResponseWriter<SimpleResponse> *, void *)>\n      request_unary_;\n  std::function<void(ServerContext *, grpc::ServerAsyncReaderWriter<\n\t\t     SimpleResponse,SimpleRequest> *, void *)>\n      request_streaming_;\n  std::forward_list<ServerRpcContext *> contexts_;\n\n  std::mutex shutdown_mutex_;\n  bool shutdown_;\n};\n\nstd::unique_ptr<Server> CreateAsyncServer(const ServerConfig &config,\n                                          int port) {\n  return std::unique_ptr<Server>(new AsyncQpsServerTest(config, port));\n}\n\n}  \/\/ namespace testing\n}  \/\/ namespace grpc\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * GLShaderLib.cpp\n *\n *  Created on: 2016年6月18日\n *      Author: lijing\n *\/\n\n#include \"graphic\/gl\/GLShaderLib.h\"\n\nnamespace pola {\nnamespace graphic {\n\nconst char* GLShaderLib::VS_MainUnifroms() {\n\treturn \"uniform mat4 u_projection;\\n\"\n\t\t\t\"uniform mat4 u_view;\\n\";\n}\n\nconst char* GLShaderLib::VS_MainAttributes() {\n\treturn \"attribute vec4 a_position;\\n\"\n\t\t\t\"attribute vec2 a_uv;\\n\"\n\t\t\t\"attribute vec3 a_normal;\\n\";\n}\n\nconst char* GLShaderLib::VS_MainPosition() {\n\treturn \"  gl_Position = u_projection * u_view * a_position;\\n\";\n}\n\nconst char* GLShaderLib::FS_MainHeader() {\n\treturn \"#ifdef GL_ES\\n\"\n\t\t\t\"#define LOWP lowp\\n\"\n\t\t\t\"precision highp float;\\n\"\n\t\t\t\"#else\\n\"\n\t\t\t\"#define LOWP \\n\"\n\t\t\t\"#endif\\n\";\n}\n\nconst char* GLShaderLib::FS_Para_Lighs() {\n\treturn\n\t\t\t\"uniform vec3 u_ambientLight;\\n\"\n\t\t\t\"#if defined(NUM_DIR_LIGHTS) && NUM_DIR_LIGHTS > 0\\n\"\n\t\t\t\"struct DirectionalLight {\\n\"\n\t\t\t\"vec3 direction;\\n\"\n\t\t\t\"vec3 color;\\n\"\n\t\t\t\"};\\n\"\n\t\t\t\"uniform DirectionalLight u_dirLights[NUM_DIR_LIGHTS];\\n\"\n\t\t\t\"#endif\\n\"\n\t\t\t\"#if defined(NUM_POINT_LIGHTS) && NUM_POINT_LIGHTS > 0\\n\"\n\t\t\t\"struct PointLight {\\n\"\n\t\t\t\"vec3 position;\\n\"\n\t\t\t\"vec3 color;\\n\"\n\t\t\t\"};\\n\"\n\t\t\t\"uniform PointLight u_pointLights[NUM_POINT_LIGHTS];\\n\"\n\t\t\t\"#endif\\n\";\n}\n\n} \/* namespace graphic *\/\n} \/* namespace pola *\/\n<commit_msg>Master<commit_after>\/*\n * GLShaderLib.cpp\n *\n *  Created on: 2016年6月18日\n *      Author: lijing\n *\/\n\n#include \"graphic\/gl\/GLShaderLib.h\"\n\nnamespace pola {\nnamespace graphic {\n\nconst char* GLShaderLib::VS_MainUnifroms() {\n\treturn \"uniform mat4 u_projection;\\n\"\n\t\t\t\"uniform mat4 u_view;\\n\";\n}\n\nconst char* GLShaderLib::VS_MainAttributes() {\n\treturn \"attribute vec4 a_position;\\n\"\n\t\t\t\"attribute vec2 a_uv;\\n\"\n\t\t\t\"attribute vec3 a_normal;\\n\";\n}\n\nconst char* GLShaderLib::VS_MainPosition() {\n\treturn \"  gl_Position = u_projection * u_view * a_position;\\n\";\n}\n\nconst char* GLShaderLib::FS_MainHeader() {\n\treturn \"#ifdef GL_ES\\n\"\n\t\t\t\"#define LOWP lowp\\n\"\n\t\t\t\"precision highp float;\\n\"\n\t\t\t\"#else\\n\"\n\t\t\t\"#define LOWP \\n\"\n\t\t\t\"#endif\\n\";\n}\n\nconst char* GLShaderLib::FS_Para_Lighs() {\n\treturn\n\t\t\t\"struct BlinnPhongMaterial {\\n\"\n\t\t\t\"vec3\tdiffuseColor;\\n\"\n\t\t\t\"vec3\tspecularColor;\\n\"\n\t\t\t\"float\tspecularShininess;\\n\"\n\t\t\t\"float\tspecularStrength;\\n\"\n\t\t\t\"};\\n\"\n\n\t\t\t\"uniform vec3 u_ambientLight;\\n\"\n\t\t\t\"#if defined(NUM_DIR_LIGHTS) && NUM_DIR_LIGHTS > 0\\n\"\n\t\t\t\"struct DirectionalLight {\\n\"\n\t\t\t\"vec3 direction;\\n\"\n\t\t\t\"vec3 color;\\n\"\n\t\t\t\"};\\n\"\n\t\t\t\"uniform DirectionalLight u_dirLights[NUM_DIR_LIGHTS];\\n\"\n\t\t\t\"#endif\\n\"\n\t\t\t\"#if defined(NUM_POINT_LIGHTS) && NUM_POINT_LIGHTS > 0\\n\"\n\t\t\t\"struct PointLight {\\n\"\n\t\t\t\"vec3 position;\\n\"\n\t\t\t\"vec3 color;\\n\"\n\t\t\t\"};\\n\"\n\t\t\t\"uniform PointLight u_pointLights[NUM_POINT_LIGHTS];\\n\"\n\t\t\t\"#endif\\n\";\n}\n\n} \/* namespace graphic *\/\n} \/* namespace pola *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2009-2012 The Bitcoin developers\n\/\/ Distributed under the MIT\/X11 software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <boost\/assign\/list_of.hpp> \/\/ for 'map_list_of()'\n#include <boost\/foreach.hpp>\n\n#include \"checkpoints.h\"\n\n#include \"main.h\"\n#include \"uint256.h\"\n\nnamespace Checkpoints\n{\n    typedef std::map<int, uint256> MapCheckpoints;\n\n    \/\/ How many times we expect transactions after the last checkpoint to\n    \/\/ be slower. This number is a compromise, as it can't be accurate for\n    \/\/ every system. When reindexing from a fast disk with a slow CPU, it\n    \/\/ can be up to 20, while when downloading from a slow network with a\n    \/\/ fast multicore CPU, it won't be much higher than 1.\n    static const double fSigcheckVerificationFactor = 5.0;\n\n    struct CCheckpointData {\n        const MapCheckpoints *mapCheckpoints;\n        int64 nTimeLastCheckpoint;\n        int64 nTransactionsLastCheckpoint;\n        double fTransactionsPerDay;\n    };\n\n    \/\/ What makes a good checkpoint block?\n    \/\/ + Is surrounded by blocks with reasonable timestamps\n    \/\/   (no blocks before with a timestamp after, none after with\n    \/\/    timestamp before)\n    \/\/ + Contains no strange transactions\n    static MapCheckpoints mapCheckpoints =\n        boost::assign::map_list_of\n        (  0, uint256(\"0xe2f2be7bd62c28ab35d988b593eff8ed011298f67c31773a1103f46f098f0f55\"))\n        ;\n    static const CCheckpointData data = {\n        &mapCheckpoints,\n        1383887110, \/\/ * UNIX timestamp of last checkpoint block\n        2179203,    \/\/ * total number of transactions between genesis and last checkpoint\n                    \/\/   (the tx=... number in the SetBestChain debug.log lines)\n        8000.0     \/\/ * estimated number of transactions per day after checkpoint\n    };\n\n    static MapCheckpoints mapCheckpointsTestnet = \n        boost::assign::map_list_of\n        (   546, uint256(\"000000002a936ca763904c3c35fce2f3556c559c0214345d31b1bcebf76acb70\"))\n        ( 35000, uint256(\"2af959ab4f12111ce947479bfcef16702485f04afd95210aa90fde7d1e4a64ad\"))\n        ;\n    static const CCheckpointData dataTestnet = {\n        &mapCheckpointsTestnet,\n        1369685559,\n        37581,\n        300\n    };\n\n    const CCheckpointData &Checkpoints() {\n        if (fTestNet)\n            return dataTestnet;\n        else\n            return data;\n    }\n\n    bool CheckBlock(int nHeight, const uint256& hash)\n    {\n        if (fTestNet) return true; \/\/ Testnet has no checkpoints\n        if (!GetBoolArg(\"-checkpoints\", true))\n            return true;\n\n        const MapCheckpoints& checkpoints = *Checkpoints().mapCheckpoints;\n\n        MapCheckpoints::const_iterator i = checkpoints.find(nHeight);\n        if (i == checkpoints.end()) return true;\n        return hash == i->second;\n    }\n\n    \/\/ Guess how far we are in the verification process at the given block index\n    double GuessVerificationProgress(CBlockIndex *pindex) {\n        if (pindex==NULL)\n            return 0.0;\n\n        int64 nNow = time(NULL);\n\n        double fWorkBefore = 0.0; \/\/ Amount of work done before pindex\n        double fWorkAfter = 0.0;  \/\/ Amount of work left after pindex (estimated)\n        \/\/ Work is defined as: 1.0 per transaction before the last checkoint, and\n        \/\/ fSigcheckVerificationFactor per transaction after.\n\n        const CCheckpointData &data = Checkpoints();\n\n        if (pindex->nChainTx <= data.nTransactionsLastCheckpoint) {\n            double nCheapBefore = pindex->nChainTx;\n            double nCheapAfter = data.nTransactionsLastCheckpoint - pindex->nChainTx;\n            double nExpensiveAfter = (nNow - data.nTimeLastCheckpoint)\/86400.0*data.fTransactionsPerDay;\n            fWorkBefore = nCheapBefore;\n            fWorkAfter = nCheapAfter + nExpensiveAfter*fSigcheckVerificationFactor;\n        } else {\n            double nCheapBefore = data.nTransactionsLastCheckpoint;\n            double nExpensiveBefore = pindex->nChainTx - data.nTransactionsLastCheckpoint;\n            double nExpensiveAfter = (nNow - pindex->nTime)\/86400.0*data.fTransactionsPerDay;\n            fWorkBefore = nCheapBefore + nExpensiveBefore*fSigcheckVerificationFactor;\n            fWorkAfter = nExpensiveAfter*fSigcheckVerificationFactor;\n        }\n\n        return fWorkBefore \/ (fWorkBefore + fWorkAfter);\n    }\n\n    int GetTotalBlocksEstimate()\n    {\n        if (fTestNet) return 0; \/\/ Testnet has no checkpoints\n        if (!GetBoolArg(\"-checkpoints\", true))\n            return 0;\n\n        const MapCheckpoints& checkpoints = *Checkpoints().mapCheckpoints;\n\n        return checkpoints.rbegin()->first;\n    }\n\n    CBlockIndex* GetLastCheckpoint(const std::map<uint256, CBlockIndex*>& mapBlockIndex)\n    {\n        if (fTestNet) return NULL; \/\/ Testnet has no checkpoints\n        if (!GetBoolArg(\"-checkpoints\", true))\n            return NULL;\n\n        const MapCheckpoints& checkpoints = *Checkpoints().mapCheckpoints;\n\n        BOOST_REVERSE_FOREACH(const MapCheckpoints::value_type& i, checkpoints)\n        {\n            const uint256& hash = i.second;\n            std::map<uint256, CBlockIndex*>::const_iterator t = mapBlockIndex.find(hash);\n            if (t != mapBlockIndex.end())\n                return t->second;\n        }\n        return NULL;\n    }\n}\n<commit_msg>checkpoint checking runs sha256d on the block hash<commit_after>\/\/ 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 <boost\/assign\/list_of.hpp> \/\/ for 'map_list_of()'\n#include <boost\/foreach.hpp>\n\n#include \"checkpoints.h\"\n\n#include \"main.h\"\n#include \"uint256.h\"\n\nnamespace Checkpoints\n{\n    typedef std::map<int, uint256> MapCheckpoints;\n\n    \/\/ How many times we expect transactions after the last checkpoint to\n    \/\/ be slower. This number is a compromise, as it can't be accurate for\n    \/\/ every system. When reindexing from a fast disk with a slow CPU, it\n    \/\/ can be up to 20, while when downloading from a slow network with a\n    \/\/ fast multicore CPU, it won't be much higher than 1.\n    static const double fSigcheckVerificationFactor = 5.0;\n\n    struct CCheckpointData {\n        const MapCheckpoints *mapCheckpoints;\n        int64 nTimeLastCheckpoint;\n        int64 nTransactionsLastCheckpoint;\n        double fTransactionsPerDay;\n    };\n\n    \/\/ Checkpointing block 1\n\tstatic MapCheckpoints mapCheckpoints =\n\t\tboost::assign::map_list_of\n\t\t( 1, uint256(\"0x4d1ae1535f94f26b342c4f7e8e1976d9755fb2fcf598390e15992b2b339af652\") );\n\tstatic const CCheckpointData data = {\n\t\t&mapCheckpoints,\n\t\t1383887110, \/\/ * UNIX timestamp of last checkpoint block\n\t\t1,          \/\/ * total number of transactions between genesis and last checkpoint\n\t\t            \/\/   (the tx=... number in the SetBestChain debug.log lines)\n\t\t8000.0      \/\/ * estimated number of transactions per day after checkpoint\n\t};\n\n    static MapCheckpoints mapCheckpointsTestnet = \n        boost::assign::map_list_of\n        ( 546, uint256(\"000000002a936ca763904c3c35fce2f3556c559c0214345d31b1bcebf76acb70\") );\n    static const CCheckpointData dataTestnet = {\n        &mapCheckpointsTestnet,\n        1369685559,\n        37581,\n        300\n    };\n\n    const CCheckpointData &Checkpoints() {\n        if (fTestNet)\n            return dataTestnet;\n        else\n            return data;\n    }\n\n    bool CheckBlock(int nHeight, const uint256& hash) {\n        if (fTestNet) return true; \/\/ Testnet has no checkpoints\n        if (!GetBoolArg(\"-checkpoints\", true))\n            return true;\n\n        const MapCheckpoints& checkpoints = *Checkpoints().mapCheckpoints;\n\n        MapCheckpoints::const_iterator i = checkpoints.find(nHeight);\n        if (i == checkpoints.end()) return true;\n\t\tuint256 hash2 = Hash(BEGIN(hash), END(hash));\n\t\t\n\t\tstd::cout << \"Comparing \" << hash2.GetHex() << \" to \" << i->second.GetHex() << std::endl;\n\t\t\n        return hash2 == i->second;\n    }\n\n    \/\/ Guess how far we are in the verification process at the given block index\n    double GuessVerificationProgress(CBlockIndex *pindex) {\n        if (pindex==NULL)\n            return 0.0;\n\n        int64 nNow = time(NULL);\n\n        double fWorkBefore = 0.0; \/\/ Amount of work done before pindex\n        double fWorkAfter = 0.0;  \/\/ Amount of work left after pindex (estimated)\n        \/\/ Work is defined as: 1.0 per transaction before the last checkoint, and\n        \/\/ fSigcheckVerificationFactor per transaction after.\n\n        const CCheckpointData &data = Checkpoints();\n\n        if (pindex->nChainTx <= data.nTransactionsLastCheckpoint) {\n            double nCheapBefore = pindex->nChainTx;\n            double nCheapAfter = data.nTransactionsLastCheckpoint - pindex->nChainTx;\n            double nExpensiveAfter = (nNow - data.nTimeLastCheckpoint)\/86400.0*data.fTransactionsPerDay;\n            fWorkBefore = nCheapBefore;\n            fWorkAfter = nCheapAfter + nExpensiveAfter*fSigcheckVerificationFactor;\n        } else {\n            double nCheapBefore = data.nTransactionsLastCheckpoint;\n            double nExpensiveBefore = pindex->nChainTx - data.nTransactionsLastCheckpoint;\n            double nExpensiveAfter = (nNow - pindex->nTime)\/86400.0*data.fTransactionsPerDay;\n            fWorkBefore = nCheapBefore + nExpensiveBefore*fSigcheckVerificationFactor;\n            fWorkAfter = nExpensiveAfter*fSigcheckVerificationFactor;\n        }\n\n        return fWorkBefore \/ (fWorkBefore + fWorkAfter);\n    }\n\n    int GetTotalBlocksEstimate() {\n        if (fTestNet) return 0; \/\/ Testnet has no checkpoints\n        if (!GetBoolArg(\"-checkpoints\", true))\n            return 0;\n\n        const MapCheckpoints& checkpoints = *Checkpoints().mapCheckpoints;\n\n        return checkpoints.rbegin()->first;\n    }\n\n    CBlockIndex* GetLastCheckpoint(const std::map<uint256, CBlockIndex*>& mapBlockIndex) {\n        if (fTestNet) return NULL; \/\/ Testnet has no checkpoints\n        if (!GetBoolArg(\"-checkpoints\", true))\n            return NULL;\n\n        const MapCheckpoints& checkpoints = *Checkpoints().mapCheckpoints;\n\n        BOOST_REVERSE_FOREACH(const MapCheckpoints::value_type& i, checkpoints)\n        {\n            const uint256& hash = i.second;\n            std::map<uint256, CBlockIndex*>::const_iterator t = mapBlockIndex.find(hash);\n            if (t != mapBlockIndex.end())\n                return t->second;\n        }\n        return NULL;\n    }\n\t\n\t\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2009-2012 The Bitcoin developers\n\/\/ Distributed under the MIT\/X11 software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <boost\/assign\/list_of.hpp> \/\/ for 'map_list_of()'\n#include <boost\/foreach.hpp>\n\n#include \"checkpoints.h\"\n\n#include \"main.h\"\n#include \"uint256.h\"\n\nnamespace Checkpoints\n{\n    typedef std::map<int, uint256> MapCheckpoints;\n\n    \/\/ How many times we expect transactions after the last checkpoint to\n    \/\/ be slower. This number is a compromise, as it can't be accurate for\n    \/\/ every system. When reindexing from a fast disk with a slow CPU, it\n    \/\/ can be up to 20, while when downloading from a slow network with a\n    \/\/ fast multicore CPU, it won't be much higher than 1.\n    static const double fSigcheckVerificationFactor = 5.0;\n\n    struct CCheckpointData {\n        const MapCheckpoints *mapCheckpoints;\n        int64 nTimeLastCheckpoint;\n        int64 nTransactionsLastCheckpoint;\n        double fTransactionsPerDay;\n    };\n\n    \/\/ What makes a good checkpoint block?\n    \/\/ + Is surrounded by blocks with reasonable timestamps\n    \/\/   (no blocks before with a timestamp after, none after with\n    \/\/    timestamp before)\n    \/\/ + Contains no strange transactions\n    static MapCheckpoints mapCheckpoints =\n        boost::assign::map_list_of\n        (     1, uint256(\"0xe613b5a195556386f422875d8df68e3e154f37b4981dec641fe041211672870f\"))\n        (  2016, uint256(\"0x94a9ab39b9e1e7dafdda1a5823c11556750157aa16e93ae2a59de426e185de58\"))\n        (  4032, uint256(\"0xa29010ca0ec82b0d2d937f5d82d2e30918467b1f4b3bb51026d13782b7aac73a\"))\n        (  8064, uint256(\"0x76ef2061b587842f424aae28fcab25fb8434612b58125258292799aaaed0f833\"))\n        ( 12096, uint256(\"0x5abe39584788a018296d97a6f00ca80c81603ebbe8ad84af5778e7d6fcdbed70\"))\n        ;\n    static const CCheckpointData data = {\n        &mapCheckpoints,\n        1389963410, \/\/ * UNIX timestamp of last checkpoint block\n        12243,   \/\/ * total number of transactions between genesis and last checkpoint\n                    \/\/   (the tx=... number in the SetBestChain debug.log lines)\n        600.0     \/\/ * estimated number of transactions per day after checkpoint\n    };\n\n    static MapCheckpoints mapCheckpointsTestnet = \n        boost::assign::map_list_of\n        ( 0, uint256(\"0x0d44ae9be7f13a64253c9b61dbbddc37304e1c359fd593565caf356e4fd597c7\"))\n        ;\n    static const CCheckpointData dataTestnet = {\n        &mapCheckpointsTestnet,\n        1393990003,\n        0,\n        300\n    };\n\n    const CCheckpointData &Checkpoints() {\n        if (fTestNet)\n            return dataTestnet;\n        else\n            return data;\n    }\n\n    bool CheckBlock(int nHeight, const uint256& hash)\n    {\n        if (!GetBoolArg(\"-checkpoints\", true))\n            return true;\n\n        const MapCheckpoints& checkpoints = *Checkpoints().mapCheckpoints;\n\n        MapCheckpoints::const_iterator i = checkpoints.find(nHeight);\n        if (i == checkpoints.end()) return true;\n        return hash == i->second;\n    }\n\n    \/\/ Guess how far we are in the verification process at the given block index\n    double GuessVerificationProgress(CBlockIndex *pindex) {\n        if (pindex==NULL)\n            return 0.0;\n\n        int64 nNow = time(NULL);\n\n        double fWorkBefore = 0.0; \/\/ Amount of work done before pindex\n        double fWorkAfter = 0.0;  \/\/ Amount of work left after pindex (estimated)\n        \/\/ Work is defined as: 1.0 per transaction before the last checkoint, and\n        \/\/ fSigcheckVerificationFactor per transaction after.\n\n        const CCheckpointData &data = Checkpoints();\n\n        if (pindex->nChainTx <= data.nTransactionsLastCheckpoint) {\n            double nCheapBefore = pindex->nChainTx;\n            double nCheapAfter = data.nTransactionsLastCheckpoint - pindex->nChainTx;\n            double nExpensiveAfter = (nNow - data.nTimeLastCheckpoint)\/86400.0*data.fTransactionsPerDay;\n            fWorkBefore = nCheapBefore;\n            fWorkAfter = nCheapAfter + nExpensiveAfter*fSigcheckVerificationFactor;\n        } else {\n            double nCheapBefore = data.nTransactionsLastCheckpoint;\n            double nExpensiveBefore = pindex->nChainTx - data.nTransactionsLastCheckpoint;\n            double nExpensiveAfter = (nNow - pindex->nTime)\/86400.0*data.fTransactionsPerDay;\n            fWorkBefore = nCheapBefore + nExpensiveBefore*fSigcheckVerificationFactor;\n            fWorkAfter = nExpensiveAfter*fSigcheckVerificationFactor;\n        }\n\n        return fWorkBefore \/ (fWorkBefore + fWorkAfter);\n    }\n\n    int GetTotalBlocksEstimate()\n    {\n        if (!GetBoolArg(\"-checkpoints\", true))\n            return 0;\n\n        const MapCheckpoints& checkpoints = *Checkpoints().mapCheckpoints;\n\n        return checkpoints.rbegin()->first;\n    }\n\n    CBlockIndex* GetLastCheckpoint(const std::map<uint256, CBlockIndex*>& mapBlockIndex)\n    {\n        if (!GetBoolArg(\"-checkpoints\", true))\n            return NULL;\n\n        const MapCheckpoints& checkpoints = *Checkpoints().mapCheckpoints;\n\n        BOOST_REVERSE_FOREACH(const MapCheckpoints::value_type& i, checkpoints)\n        {\n            const uint256& hash = i.second;\n            std::map<uint256, CBlockIndex*>::const_iterator t = mapBlockIndex.find(hash);\n            if (t != mapBlockIndex.end())\n                return t->second;\n        }\n        return NULL;\n    }\n}\n<commit_msg>Update Mainnet Checkpoint @ Block 13422<commit_after>\/\/ 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 <boost\/assign\/list_of.hpp> \/\/ for 'map_list_of()'\n#include <boost\/foreach.hpp>\n\n#include \"checkpoints.h\"\n\n#include \"main.h\"\n#include \"uint256.h\"\n\nnamespace Checkpoints\n{\n    typedef std::map<int, uint256> MapCheckpoints;\n\n    \/\/ How many times we expect transactions after the last checkpoint to\n    \/\/ be slower. This number is a compromise, as it can't be accurate for\n    \/\/ every system. When reindexing from a fast disk with a slow CPU, it\n    \/\/ can be up to 20, while when downloading from a slow network with a\n    \/\/ fast multicore CPU, it won't be much higher than 1.\n    static const double fSigcheckVerificationFactor = 5.0;\n\n    struct CCheckpointData {\n        const MapCheckpoints *mapCheckpoints;\n        int64 nTimeLastCheckpoint;\n        int64 nTransactionsLastCheckpoint;\n        double fTransactionsPerDay;\n    };\n\n    \/\/ What makes a good checkpoint block?\n    \/\/ + Is surrounded by blocks with reasonable timestamps\n    \/\/   (no blocks before with a timestamp after, none after with\n    \/\/    timestamp before)\n    \/\/ + Contains no strange transactions\n    static MapCheckpoints mapCheckpoints =\n        boost::assign::map_list_of\n        (     1, uint256(\"0xe613b5a195556386f422875d8df68e3e154f37b4981dec641fe041211672870f\"))\n        (  2016, uint256(\"0x94a9ab39b9e1e7dafdda1a5823c11556750157aa16e93ae2a59de426e185de58\"))\n        (  4032, uint256(\"0xa29010ca0ec82b0d2d937f5d82d2e30918467b1f4b3bb51026d13782b7aac73a\"))\n        (  8064, uint256(\"0x76ef2061b587842f424aae28fcab25fb8434612b58125258292799aaaed0f833\"))\n        ( 12096, uint256(\"0x5abe39584788a018296d97a6f00ca80c81603ebbe8ad84af5778e7d6fcdbed70\"))\n        ( 13422, uint256(\"0xc70a40fe1c53e5525636644e625d4c38c8493b180a0ca81c9d7c9801748e6b52\"))\n        ;\n    static const CCheckpointData data = {\n        &mapCheckpoints,\n        1398198862, \/\/ * UNIX timestamp of last checkpoint block\n        14580,   \/\/ * total number of transactions between genesis and last checkpoint\n                    \/\/   (the tx=... number in the SetBestChain debug.log lines)\n        600.0     \/\/ * estimated number of transactions per day after checkpoint\n    };\n\n    static MapCheckpoints mapCheckpointsTestnet = \n        boost::assign::map_list_of\n        ( 0, uint256(\"0x0d44ae9be7f13a64253c9b61dbbddc37304e1c359fd593565caf356e4fd597c7\"))\n        ;\n    static const CCheckpointData dataTestnet = {\n        &mapCheckpointsTestnet,\n        1393990003,\n        0,\n        300\n    };\n\n    const CCheckpointData &Checkpoints() {\n        if (fTestNet)\n            return dataTestnet;\n        else\n            return data;\n    }\n\n    bool CheckBlock(int nHeight, const uint256& hash)\n    {\n        if (!GetBoolArg(\"-checkpoints\", true))\n            return true;\n\n        const MapCheckpoints& checkpoints = *Checkpoints().mapCheckpoints;\n\n        MapCheckpoints::const_iterator i = checkpoints.find(nHeight);\n        if (i == checkpoints.end()) return true;\n        return hash == i->second;\n    }\n\n    \/\/ Guess how far we are in the verification process at the given block index\n    double GuessVerificationProgress(CBlockIndex *pindex) {\n        if (pindex==NULL)\n            return 0.0;\n\n        int64 nNow = time(NULL);\n\n        double fWorkBefore = 0.0; \/\/ Amount of work done before pindex\n        double fWorkAfter = 0.0;  \/\/ Amount of work left after pindex (estimated)\n        \/\/ Work is defined as: 1.0 per transaction before the last checkoint, and\n        \/\/ fSigcheckVerificationFactor per transaction after.\n\n        const CCheckpointData &data = Checkpoints();\n\n        if (pindex->nChainTx <= data.nTransactionsLastCheckpoint) {\n            double nCheapBefore = pindex->nChainTx;\n            double nCheapAfter = data.nTransactionsLastCheckpoint - pindex->nChainTx;\n            double nExpensiveAfter = (nNow - data.nTimeLastCheckpoint)\/86400.0*data.fTransactionsPerDay;\n            fWorkBefore = nCheapBefore;\n            fWorkAfter = nCheapAfter + nExpensiveAfter*fSigcheckVerificationFactor;\n        } else {\n            double nCheapBefore = data.nTransactionsLastCheckpoint;\n            double nExpensiveBefore = pindex->nChainTx - data.nTransactionsLastCheckpoint;\n            double nExpensiveAfter = (nNow - pindex->nTime)\/86400.0*data.fTransactionsPerDay;\n            fWorkBefore = nCheapBefore + nExpensiveBefore*fSigcheckVerificationFactor;\n            fWorkAfter = nExpensiveAfter*fSigcheckVerificationFactor;\n        }\n\n        return fWorkBefore \/ (fWorkBefore + fWorkAfter);\n    }\n\n    int GetTotalBlocksEstimate()\n    {\n        if (!GetBoolArg(\"-checkpoints\", true))\n            return 0;\n\n        const MapCheckpoints& checkpoints = *Checkpoints().mapCheckpoints;\n\n        return checkpoints.rbegin()->first;\n    }\n\n    CBlockIndex* GetLastCheckpoint(const std::map<uint256, CBlockIndex*>& mapBlockIndex)\n    {\n        if (!GetBoolArg(\"-checkpoints\", true))\n            return NULL;\n\n        const MapCheckpoints& checkpoints = *Checkpoints().mapCheckpoints;\n\n        BOOST_REVERSE_FOREACH(const MapCheckpoints::value_type& i, checkpoints)\n        {\n            const uint256& hash = i.second;\n            std::map<uint256, CBlockIndex*>::const_iterator t = mapBlockIndex.find(hash);\n            if (t != mapBlockIndex.end())\n                return t->second;\n        }\n        return NULL;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Author: Junfeng Yang (junfeng@cs.columbia.edu) *\/\n\n#include <stdint.h>\n#include <assert.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n#include <errno.h>\n\n#include \"tern\/config.h\"\n#include \"tern\/hooks.h\"\n#include \"tern\/runtime\/runtime.h\"\n#include \"tern\/space.h\"\n#include \"helper.h\"\n#include \"tern\/options.h\"\n\nusing namespace tern;\n\nextern \"C\" {\n\ntypedef void * (*thread_func_t)(void*);\nstatic void *__tern_thread_func(void *arg) {\n\n  void **args;\n  void *ret_val;\n  thread_func_t user_thread_func;\n  void *user_thread_arg;\n\n  args = (void**)arg;\n  user_thread_func = (thread_func_t)((intptr_t)args[0]);\n  user_thread_arg = args[1];\n  \/\/ free arg before calling user_thread_func as it may not return (i.e.,\n  \/\/ it may call pthread_exit())\n  delete[] (void**)arg;\n\n  tern_thread_begin();\n  ret_val = user_thread_func(user_thread_arg);\n  tern_pthread_exit(-1, ret_val); \/\/ calls tern_thread_end() and pthread_exit()\n  assert(0 && \"unreachable!\");\n}\n\nint __tern_pthread_create(pthread_t *thread,  const pthread_attr_t *attr,\n                          thread_func_t user_thread_func,\n                          void *user_thread_arg) {\n  void **args;\n\n  \/\/ use heap because stack of this func may be deallocated before the\n  \/\/ created thread reads the @args\n  args = new void*[2];\n  args[0] = (void*)(intptr_t)user_thread_func;\n  args[1] = user_thread_arg;\n\n  int ret;\n  ret = pthread_create(thread, const_cast<pthread_attr_t*>(attr), __tern_thread_func, (void*)args);\n  if(ret < 0)\n    delete[] (void**)args; \/\/ clean up memory for @args\n  return ret;\n}\n\n\/*\n    This idle thread is created to avoid empty runq.\n    In the implementation with semaphore, there's a global token that must be \n    held by some threads. In the case that all threads are executing blocking\n    function calls, the global token can be held by nothing. So we create this\n    idle thread to ensure there's at least one thread in the runq to hold the \n    global token.\n\n    Another solution is to add a flag in schedule showing if it happens that \n    runq is empty and the global token is held by no one. And recover the global\n    token when some thread comes back to runq from blocking function call. \n *\/\nvolatile int idle_done = 0;\npthread_t idle_th;\nvoid *idle_thread(void *)\n{\n  while (!idle_done) {\n    tern_usleep(0xdeadbeef, options::idle_sleep_length);\n  }\n  return NULL;\n}\n\nstatic pthread_t main_thread_th;\n\/\/  SYS -> SYS\n\/\/  must be called by the main thread\nvoid __tern_prog_begin(void) {\n  \/\/fprintf(stderr, \"%08d calls __tern_prog_begin\\n\", (int) pthread_self());\n  assert(Space::isSys() && \"__tern_prog_begin must start in sys space\");\n\n  main_thread_th = pthread_self();\n\n  options::read_options(\"local.options\");\n  options::read_env_options();\n  options::print_options(\"dump.options\");\n\n  tern::InstallRuntime();\n\n  \/\/ FIXME: the version of uclibc in klee doesn't seem to pick up the\n  \/\/ functions registered with atexit()\n  \/\/atexit(__tern_prog_end);\n\n  tern_prog_begin();\n  assert(Space::isSys());\n  tern_thread_begin(); \/\/ main thread begins\n  assert(Space::isApp());\n\n  \/\/  use tern_pthread_create because we want to fake the eip\n  if (options::launch_idle_thread)\n    tern_pthread_create(0xdead0000, &idle_th, NULL, idle_thread, NULL);\n  assert(Space::isApp() && \"__tern_prog_begin must end in app space\");\n}\n\n\/\/  SYS -> SYS\nvoid __tern_prog_end (void) {\n  \/\/fprintf(stderr, \"%08d calls __tern_prog_end\\n\", (int) pthread_self());\n  assert(Space::isApp() && \"__tern_prog_end must start in app space\");\n\n  \/\/ terminate the idle thread because it references the runtime which we\n  \/\/ are about to free\n  idle_done = 1;\n\n  \/\/  use tern_pthread_join because we want to fake the eip\n  if (options::launch_idle_thread)\n  {\n    assert(pthread_self() != idle_th && \"idle_th should never reach __tern_prog_end\");\n    tern_pthread_join(0xdeadffff, idle_th, NULL);\n  }\n\n  tern_thread_end(-1); \/\/ main thread ends\n  assert(Space::isSys());\n  tern_prog_end();\n\n  delete tern::Runtime::the;\n  tern::Runtime::the = NULL;\n  assert(Space::isSys() && \"__tern_prog_end must end in system space\");\n}\n\nvoid __tern_symbolic(unsigned insid, void *addr,\n                     int nbytes, const char *symname) {\n  if(nbytes <= 0 || !addr)\n    return;\n  tern_symbolic_real(insid, addr, nbytes, symname);\n}\n\nvoid __tern_symbolic_argv(unsigned insid, int argc, char **argv) {\n  char arg[32];\n  for(int i=0; i<argc; ++i) {\n    sprintf(arg, \"arg%d\\n\", i);\n    tern_symbolic_real(insid, argv[i], strlen(argv[i])+1, arg);\n  }\n}\n\n}\n<commit_msg>minor bug fix<commit_after>\/* Author: Junfeng Yang (junfeng@cs.columbia.edu) *\/\n\n#include <stdint.h>\n#include <assert.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n#include <errno.h>\n\n#include \"tern\/config.h\"\n#include \"tern\/hooks.h\"\n#include \"tern\/runtime\/runtime.h\"\n#include \"tern\/space.h\"\n#include \"helper.h\"\n#include \"tern\/options.h\"\n\nusing namespace tern;\n\nextern \"C\" {\n\ntypedef void * (*thread_func_t)(void*);\nstatic void *__tern_thread_func(void *arg) {\n\n  void **args;\n  void *ret_val;\n  thread_func_t user_thread_func;\n  void *user_thread_arg;\n\n  args = (void**)arg;\n  user_thread_func = (thread_func_t)((intptr_t)args[0]);\n  user_thread_arg = args[1];\n  \/\/ free arg before calling user_thread_func as it may not return (i.e.,\n  \/\/ it may call pthread_exit())\n  delete[] (void**)arg;\n\n  tern_thread_begin();\n  ret_val = user_thread_func(user_thread_arg);\n  tern_pthread_exit(-1, ret_val); \/\/ calls tern_thread_end() and pthread_exit()\n  assert(0 && \"unreachable!\");\n}\n\nint __tern_pthread_create(pthread_t *thread,  const pthread_attr_t *attr,\n                          thread_func_t user_thread_func,\n                          void *user_thread_arg) {\n  void **args;\n\n  \/\/ use heap because stack of this func may be deallocated before the\n  \/\/ created thread reads the @args\n  args = new void*[2];\n  args[0] = (void*)(intptr_t)user_thread_func;\n  args[1] = user_thread_arg;\n\n  int ret;\n  ret = pthread_create(thread, const_cast<pthread_attr_t*>(attr), __tern_thread_func, (void*)args);\n  if(ret < 0)\n    delete[] (void**)args; \/\/ clean up memory for @args\n  return ret;\n}\n\n\/*\n    This idle thread is created to avoid empty runq.\n    In the implementation with semaphore, there's a global token that must be \n    held by some threads. In the case that all threads are executing blocking\n    function calls, the global token can be held by nothing. So we create this\n    idle thread to ensure there's at least one thread in the runq to hold the \n    global token.\n\n    Another solution is to add a flag in schedule showing if it happens that \n    runq is empty and the global token is held by no one. And recover the global\n    token when some thread comes back to runq from blocking function call. \n *\/\nvolatile int idle_done = 0;\npthread_t idle_th;\nvoid *idle_thread(void *)\n{\n  while (!idle_done) {\n    tern_usleep(0xdeadbeef, options::idle_sleep_length);\n  }\n  return NULL;\n}\n\nstatic pthread_t main_thread_th;\n\/\/  SYS -> SYS\n\/\/  must be called by the main thread\nvoid __tern_prog_begin(void) {\n  \/\/fprintf(stderr, \"%08d calls __tern_prog_begin\\n\", (int) pthread_self());\n  assert(Space::isSys() && \"__tern_prog_begin must start in sys space\");\n\n  main_thread_th = pthread_self();\n\n  options::read_options(\"local.options\");\n  options::read_env_options();\n  options::print_options(\"dump.options\");\n\n  tern::InstallRuntime();\n\n  \/\/ FIXME: the version of uclibc in klee doesn't seem to pick up the\n  \/\/ functions registered with atexit()\n  atexit(__tern_prog_end);\n\n  tern_prog_begin();\n  assert(Space::isSys());\n  tern_thread_begin(); \/\/ main thread begins\n  assert(Space::isApp());\n\n  \/\/  use tern_pthread_create because we want to fake the eip\n  if (options::launch_idle_thread)\n    tern_pthread_create(0xdead0000, &idle_th, NULL, idle_thread, NULL);\n  assert(Space::isApp() && \"__tern_prog_begin must end in app space\");\n}\n\n\/\/  SYS -> SYS\nvoid __tern_prog_end (void) {\n  \/\/fprintf(stderr, \"%08d calls __tern_prog_end\\n\", (int) pthread_self());\n  assert(Space::isApp() && \"__tern_prog_end must start in app space\");\n\n  \/\/ terminate the idle thread because it references the runtime which we\n  \/\/ are about to free\n  idle_done = 1;\n\n  \/\/  use tern_pthread_join because we want to fake the eip\n  if (options::launch_idle_thread)\n  {\n    assert(pthread_self() != idle_th && \"idle_th should never reach __tern_prog_end\");\n    tern_pthread_join(0xdeadffff, idle_th, NULL);\n  }\n\n  tern_thread_end(-1); \/\/ main thread ends\n  assert(Space::isSys());\n  tern_prog_end();\n\n  delete tern::Runtime::the;\n  tern::Runtime::the = NULL;\n  assert(Space::isSys() && \"__tern_prog_end must end in system space\");\n}\n\nvoid __tern_symbolic(unsigned insid, void *addr,\n                     int nbytes, const char *symname) {\n  if(nbytes <= 0 || !addr)\n    return;\n  tern_symbolic_real(insid, addr, nbytes, symname);\n}\n\nvoid __tern_symbolic_argv(unsigned insid, int argc, char **argv) {\n  char arg[32];\n  for(int i=0; i<argc; ++i) {\n    sprintf(arg, \"arg%d\\n\", i);\n    tern_symbolic_real(insid, argv[i], strlen(argv[i])+1, arg);\n  }\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ NoLifeClient - Part of the NoLifeStory project                           \/\/\n\/\/ Copyright © 2013 Peter Atashian                                          \/\/\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 \"view.hpp\"\n#include \"config.hpp\"\n#include \"map.hpp\"\n#include \"time.hpp\"\n#include \"foothold.hpp\"\n#include \"sprite.hpp\"\n#include \"player.hpp\"\n#include <GL\/glew.h>\n#include <algorithm>\n#include <random>\n#include <chrono>\n#include <cmath>\n#include <iostream>\n\nnamespace nl {\n    double const tau{6.28318530717958647692528676655900576839433879875021};\n    namespace view {\n        int x = 0, y = 0;\n        int width = 0, height = 0;\n        double fx = 0, fy = 0;\n        double rx = 0, ry = 0;\n        int left = 0, right = 0, top = 0, bottom = 0;\n        int leftin{0}, rightin{0}, topin{0}, bottomin{0};\n        int cleft = 0, cright = 0, ctop = 0, cbottom = 0;\n        bool doside = false, dotop = false, dobottom = false;\n        int xmin = 0, xmax = 0, ymin = 0, ymax = 0;\n        double tx = 0, ty = 0;\n        float r = 1, g = 1, b = 1;\n        int bottomoffset = 250;\n        template <typename T>\n        void restrict(T & x, T & y){\n            if (right - left <= width) {\n                x = (right + left) \/ 2;\n            } else {\n                x = std::max<T>(std::min<T>(x, rightin), leftin);\n            }\n            if (bottom - top <= height) {\n                y = (bottom + top) \/ 2;\n            } else {\n                y = std::max<T>(std::min<T>(y, bottomin), topin);\n            }\n        }\n            \/\/wat\n            void update_inner() {\n            leftin = left + width \/ 2;\n            rightin = right - width \/ 2;\n            topin = top + (height - bottomoffset);\n            bottomin = bottom - bottomoffset;\n        }\n        void resize(int w, int h) {\n            width = w;\n            height = h;\n            glViewport(0, 0, width, height);\n            if (config::fullscreen) {\n                config::fullscreen_width = width;\n                config::fullscreen_height = height;\n            } else {\n                config::window_width = width;\n                config::window_height = height;\n            }\n            if (config::stretch) {\n                width = 800;\n                height = 600;\n            }\n            update_inner();\n        }\n        void reset() {\n            auto info = map::current[\"info\"];\n            if (info[\"VRTop\"]) {\n                top = info[\"VRTop\"];\n                bottom = info[\"VRBottom\"];\n                left = info[\"VRLeft\"];\n                right = info[\"VRRight\"];\n            } else {\n                left = std::numeric_limits<int>::max();\n                right = std::numeric_limits<int>::min();\n                top = std::numeric_limits<int>::max();\n                bottom = std::numeric_limits<int>::min();\n                for (foothold & f : footholds) {\n                    if (!f.initialized)\n                        continue;\n                    left = std::min(left, f.x1);\n                    left = std::min(left, f.x2);\n                    right = std::max(right, f.x1);\n                    right = std::max(right, f.x2);\n                    top = std::min(top, f.y1);\n                    top = std::min(top, f.y2);\n                    bottom = std::max(bottom, f.y1);\n                    bottom = std::max(bottom, f.y2);\n                }\n                top -= 256;\n                bottom += 64;\n            }\n            ctop = info[\"LBTop\"];\n            cbottom = info[\"LBBottom\"];\n            cleft = info[\"LBSide\"];\n            cright = info[\"LBSide\"];\n            doside = !!info[\"LBSide\"];\n            dobottom = !!info[\"LBBottom\"];\n            dotop = !!info[\"LBTop\"];\n            tx = player::ch.pos.x;\n            ty = player::ch.pos.y;\n            fx = tx;\n            fy = ty;\n            update_inner();\n            update();\n        }\n        void update() {\n            tx = player::ch.pos.x;\n            ty = player::ch.pos.y;\n            auto dx = tx - fx;\n            auto dy = ty - fy;\n            auto adx = std::max(std::abs(dx) - 28, 0.);\n            auto ady = std::max(std::abs(dy) - 28, 0.);\n            auto sx = adx == 0 ? 0 :\n                std::copysign(std::pow(adx, 1.5) + 28, dx) * time::delta * 0.2;\n            auto sy = ady == 0 ? 0 :\n                std::copysign(std::pow(ady, 1.5) + 28, dy) * time::delta * 0.2;\n            if (std::abs(sx) > std::abs(tx - fx))\n                sx = tx - fx;\n            if (std::abs(sy) > std::abs(ty - fy))\n                sy = ty - fy;\n            fx += sx;\n            fy += sy;\n            restrict(fx, fy);\n            if (config::rave) {\n                std::random_device engine;\n                auto num = std::pow(std::sin(time::delta_total * 2.088 * tau) * 0.5 + 0.5, 4) * 8;\n                std::uniform_real_distribution<double> dist(-num, num);\n                rx += dist(engine);\n                ry += dist(engine);\n                auto d = std::floor(time::delta_total * 2.088) * 1.95;\n                r = static_cast<float>(std::sin(d));\n                g = static_cast<float>(std::sin(d + 1 \/ 3. * tau));\n                b = static_cast<float>(std::sin(d + 2 \/ 3. * tau));\n                ::glTexEnvi(GL_TEXTURE_ENV, GL_TEXTURE_ENV_MODE, GL_BLEND);\n                ::GLfloat c[4] = {1 - r, 1 - g, 1 - b, 1};\n                ::glTexEnvfv(GL_TEXTURE_ENV, GL_TEXTURE_ENV_COLOR, c);\n            } else {\n                ::glTexEnvi(GL_TEXTURE_ENV, GL_TEXTURE_ENV_MODE, GL_MODULATE);\n                r = 1, g = 1, b = 1;\n            }\n            rx *= 0.90;\n            ry *= 0.90;\n            x = static_cast<int>(std::round(fx + rx));\n            y = static_cast<int>(std::round(fy + ry));\n            xmin = x - width \/ 2;\n            xmax = x + width \/ 2;\n            ymin = y - (height - bottomoffset);\n            ymax = y + bottomoffset;\n            ::glMatrixMode(GL_PROJECTION);\n            ::glLoadIdentity();\n            ::glOrtho(0, width, height, 0, -1, 1);\n            ::glMatrixMode(GL_MODELVIEW);\n            ::glLoadIdentity();\n        }\n        void draw_edges() {\n            \/*sprite::unbind();\n            auto doclip = doside || dotop || dobottom;\n            auto xmid = (right + left) \/ 2 - xmin;\n            auto ymid = (top + bottom) \/ 2 - ymin;\n            auto xb = std::max(0, (right - left - 1366) \/ 2);\n            auto yb = std::max(0, (bottom - top - 768) \/ 2);\n            auto nleft = doside ? xmid - 512 + cleft - xb : !doclip ? left - xmin : 0;\n            auto nright = doside ? xmid + 512 - cright + xb : !doclip ? right - xmin : width;\n            auto ntop = dotop ? ymid - 384 + ctop - yb: !doclip ? top - ymin : 0;\n            auto nbottom = dobottom ? ymid + 319 - cbottom + yb: !doclip ? bottom - ymin : height;\n            glColor4d(0, 0, 0, 1);\n            glBegin(GL_QUADS);\n            glVertex2i(0, 0);\n            glVertex2i(width, 0);\n            glVertex2i(width, ntop);\n            glVertex2i(0, ntop);\n            glVertex2i(0, height);\n            glVertex2i(width, height);\n            glVertex2i(width, nbottom);\n            glVertex2i(0, nbottom);\n            glVertex2i(0, 0);\n            glVertex2i(0, height);\n            glVertex2i(nleft, height);\n            glVertex2i(nleft, 0);\n            glVertex2i(width, 0);\n            glVertex2i(width, height);\n            glVertex2i(nright, height);\n            glVertex2i(nright, 0);\n            glEnd();*\/\n        }\n    }\n}\n<commit_msg>Fix view centering when window is larger than map<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ NoLifeClient - Part of the NoLifeStory project                           \/\/\n\/\/ Copyright © 2013 Peter Atashian                                          \/\/\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 \"view.hpp\"\n#include \"config.hpp\"\n#include \"map.hpp\"\n#include \"time.hpp\"\n#include \"foothold.hpp\"\n#include \"sprite.hpp\"\n#include \"player.hpp\"\n#include <GL\/glew.h>\n#include <algorithm>\n#include <random>\n#include <chrono>\n#include <cmath>\n#include <iostream>\n\nnamespace nl {\n    double const tau{6.28318530717958647692528676655900576839433879875021};\n    namespace view {\n        int x = 0, y = 0;\n        int width = 0, height = 0;\n        double fx = 0, fy = 0;\n        double rx = 0, ry = 0;\n        int left = 0, right = 0, top = 0, bottom = 0;\n        int leftin{0}, rightin{0}, topin{0}, bottomin{0};\n        int cleft = 0, cright = 0, ctop = 0, cbottom = 0;\n        bool doside = false, dotop = false, dobottom = false;\n        int xmin = 0, xmax = 0, ymin = 0, ymax = 0;\n        double tx = 0, ty = 0;\n        float r = 1, g = 1, b = 1;\n        int bottomoffset = 250;\n        template <typename T>\n        void restrict(T & x, T & y){\n            x = std::max<T>(std::min<T>(x, rightin), leftin);\n            y = std::max<T>(std::min<T>(y, bottomin), topin);\n        }\n        int fixing_vs_formatting; \/\/ don't ask\n        void update_inner() {\n            leftin = left + width \/ 2;\n            rightin = right - width \/ 2;\n            if (leftin > rightin) {\n                leftin = rightin = (leftin + rightin) \/ 2;\n            }\n            topin = top + (height - bottomoffset);\n            bottomin = bottom - bottomoffset;\n            if (topin > bottomin) {\n                topin = bottomin = (topin + bottomin) \/ 2;\n            }\n        }\n        void resize(int w, int h) {\n            width = w;\n            height = h;\n            glViewport(0, 0, width, height);\n            if (config::fullscreen) {\n                config::fullscreen_width = width;\n                config::fullscreen_height = height;\n            } else {\n                config::window_width = width;\n                config::window_height = height;\n            }\n            if (config::stretch) {\n                width = 800;\n                height = 600;\n            }\n            update_inner();\n        }\n        void reset() {\n            auto info = map::current[\"info\"];\n            if (info[\"VRTop\"]) {\n                top = info[\"VRTop\"];\n                bottom = info[\"VRBottom\"];\n                left = info[\"VRLeft\"];\n                right = info[\"VRRight\"];\n            } else {\n                left = std::numeric_limits<int>::max();\n                right = std::numeric_limits<int>::min();\n                top = std::numeric_limits<int>::max();\n                bottom = std::numeric_limits<int>::min();\n                for (foothold & f : footholds) {\n                    if (!f.initialized)\n                        continue;\n                    left = std::min(left, f.x1);\n                    left = std::min(left, f.x2);\n                    right = std::max(right, f.x1);\n                    right = std::max(right, f.x2);\n                    top = std::min(top, f.y1);\n                    top = std::min(top, f.y2);\n                    bottom = std::max(bottom, f.y1);\n                    bottom = std::max(bottom, f.y2);\n                }\n                top -= 256;\n                bottom += 64;\n            }\n            ctop = info[\"LBTop\"];\n            cbottom = info[\"LBBottom\"];\n            cleft = info[\"LBSide\"];\n            cright = info[\"LBSide\"];\n            doside = !!info[\"LBSide\"];\n            dobottom = !!info[\"LBBottom\"];\n            dotop = !!info[\"LBTop\"];\n            tx = player::ch.pos.x;\n            ty = player::ch.pos.y;\n            fx = tx;\n            fy = ty;\n            update_inner();\n            update();\n        }\n        void update() {\n            tx = player::ch.pos.x;\n            ty = player::ch.pos.y;\n            auto dx = tx - fx;\n            auto dy = ty - fy;\n            auto adx = std::max(std::abs(dx) - 28, 0.);\n            auto ady = std::max(std::abs(dy) - 28, 0.);\n            auto sx = adx == 0 ? 0 :\n                std::copysign(std::pow(adx, 1.5) + 28, dx) * time::delta * 0.2;\n            auto sy = ady == 0 ? 0 :\n                std::copysign(std::pow(ady, 1.5) + 28, dy) * time::delta * 0.2;\n            if (std::abs(sx) > std::abs(tx - fx))\n                sx = tx - fx;\n            if (std::abs(sy) > std::abs(ty - fy))\n                sy = ty - fy;\n            fx += sx;\n            fy += sy;\n            restrict(fx, fy);\n            if (config::rave) {\n                std::random_device engine;\n                auto num = std::pow(std::sin(time::delta_total * 2.088 * tau) * 0.5 + 0.5, 4) * 8;\n                std::uniform_real_distribution<double> dist(-num, num);\n                rx += dist(engine);\n                ry += dist(engine);\n                auto d = std::floor(time::delta_total * 2.088) * 1.95;\n                r = static_cast<float>(std::sin(d));\n                g = static_cast<float>(std::sin(d + 1 \/ 3. * tau));\n                b = static_cast<float>(std::sin(d + 2 \/ 3. * tau));\n                ::glTexEnvi(GL_TEXTURE_ENV, GL_TEXTURE_ENV_MODE, GL_BLEND);\n                ::GLfloat c[4] = {1 - r, 1 - g, 1 - b, 1};\n                ::glTexEnvfv(GL_TEXTURE_ENV, GL_TEXTURE_ENV_COLOR, c);\n            } else {\n                ::glTexEnvi(GL_TEXTURE_ENV, GL_TEXTURE_ENV_MODE, GL_MODULATE);\n                r = 1, g = 1, b = 1;\n            }\n            rx *= 0.90;\n            ry *= 0.90;\n            x = static_cast<int>(std::round(fx + rx));\n            y = static_cast<int>(std::round(fy + ry));\n            xmin = x - width \/ 2;\n            xmax = x + width \/ 2;\n            ymin = y - (height - bottomoffset);\n            ymax = y + bottomoffset;\n            ::glMatrixMode(GL_PROJECTION);\n            ::glLoadIdentity();\n            ::glOrtho(0, width, height, 0, -1, 1);\n            ::glMatrixMode(GL_MODELVIEW);\n            ::glLoadIdentity();\n        }\n        void draw_edges() {\n            \/*sprite::unbind();\n            auto doclip = doside || dotop || dobottom;\n            auto xmid = (right + left) \/ 2 - xmin;\n            auto ymid = (top + bottom) \/ 2 - ymin;\n            auto xb = std::max(0, (right - left - 1366) \/ 2);\n            auto yb = std::max(0, (bottom - top - 768) \/ 2);\n            auto nleft = doside ? xmid - 512 + cleft - xb : !doclip ? left - xmin : 0;\n            auto nright = doside ? xmid + 512 - cright + xb : !doclip ? right - xmin : width;\n            auto ntop = dotop ? ymid - 384 + ctop - yb: !doclip ? top - ymin : 0;\n            auto nbottom = dobottom ? ymid + 319 - cbottom + yb: !doclip ? bottom - ymin : height;\n            glColor4d(0, 0, 0, 1);\n            glBegin(GL_QUADS);\n            glVertex2i(0, 0);\n            glVertex2i(width, 0);\n            glVertex2i(width, ntop);\n            glVertex2i(0, ntop);\n            glVertex2i(0, height);\n            glVertex2i(width, height);\n            glVertex2i(width, nbottom);\n            glVertex2i(0, nbottom);\n            glVertex2i(0, 0);\n            glVertex2i(0, height);\n            glVertex2i(nleft, height);\n            glVertex2i(nleft, 0);\n            glVertex2i(width, 0);\n            glVertex2i(width, height);\n            glVertex2i(nright, height);\n            glVertex2i(nright, 0);\n            glEnd();*\/\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ ------------------ \/\/\n\/\/  Standard Solver   \/\/\n\/\/ ------------------ \/\/\n\n    template<typename VectorType, typename MatrixType>\nauto Standard::solve(const MatrixType &A,const VectorType &v)\n    -> VectorType\n{\n    VectorType x = A.solve(v);\n    return x;\n}\n\n\/\/ -------------------------  \/\/\n\/\/  Conjugate Gradient Solver \/\/\n\/\/ -------------------------  \/\/\n\n    ConjugateGradient::ConjugateGradient(double tol, int verbosity_)\n: verbosity(verbosity_), tolerance(tol)\n{\n    \/\/ Nothing to do here.\n}\n\ntemplate\n<\ntypename VectorType,\n         typename MatrixType,\n         template <LogType> class Log\n    >\nauto ConjugateGradient::solve(const MatrixType &A,\n        const VectorType &v)\n    -> VectorType\n{\n    using RealType = typename VectorType::RealType;\n\n    Log<LogType::SOL_CG> log(verbosity);\n\n    RealType tol, alpha, beta, rnorm, vnorm;\n    VectorType x, r, p, xnew, rnew, pnew;\n\n    x = 0.0 * v;\n    r = A * x - v;\n    p = -1.0 * r;\n    vnorm = v.norm();\n    rnorm = r.norm();\n\n    log.init(tolerance, rnorm, vnorm);\n\n    int i = 0;\n    while (rnorm \/ vnorm > tolerance)\n    {\n        alpha = dot(r, r) \/ dot(p, A * p);\n        xnew  = x + alpha *     p;\n        rnew  = A * xnew - v;\n        beta  = dot(rnew, rnew) \/ dot(r, r);\n        pnew  = beta * p - rnew;\n\n        x = xnew;\n        r = rnew; rnorm = r.norm();\n        p = pnew;\n\n        i++;\n        if (i % 10 == 0)\n            log.step(i, rnorm);\n    }\n    log.finalize(i);\n    std::cout << \"Residual norm: \" << static_cast<VectorType>((A * x) - v).norm();\n    std::cout << std::endl;\n\n    return x;\n}\n\n\/\/ -----------------------  \/\/\n\/\/  Preconditioned Solver   \/\/\n\/\/ -----------------------  \/\/\n\ntemplate<typename Solver, typename Transformation>\nPreconditionedSolver<Solver, Transformation>::\nPreconditionedSolver(Solver s, Transformation t)\n    : solver(s), transformation(t)\n{\n    \/\/ Nothin to do here.\n}\n\ntemplate<typename Solver, typename Transformation>\n    template<typename VectorType, typename MatrixType>\nauto PreconditionedSolver<Solver, Transformation>::solve(const MatrixType &A,\n                                                         const VectorType &v)\n    -> VectorType\n{\n    VectorType vt = transformation.apply(v);\n    auto At       = transformation.apply(A);\n    VectorType x  = transformation.apply(solver.solve(At, vt));\n    return x;\n}\n<commit_msg>Removed unnecessary output.<commit_after>\/\/ ------------------ \/\/\n\/\/  Standard Solver   \/\/\n\/\/ ------------------ \/\/\n\n    template<typename VectorType, typename MatrixType>\nauto Standard::solve(const MatrixType &A,const VectorType &v)\n    -> VectorType\n{\n    VectorType x = A.solve(v);\n    return x;\n}\n\n\/\/ -------------------------  \/\/\n\/\/  Conjugate Gradient Solver \/\/\n\/\/ -------------------------  \/\/\n\n    ConjugateGradient::ConjugateGradient(double tol, int verbosity_)\n: verbosity(verbosity_), tolerance(tol)\n{\n    \/\/ Nothing to do here.\n}\n\ntemplate\n<\ntypename VectorType,\n         typename MatrixType,\n         template <LogType> class Log\n    >\nauto ConjugateGradient::solve(const MatrixType &A,\n        const VectorType &v)\n    -> VectorType\n{\n    using RealType = typename VectorType::RealType;\n\n    Log<LogType::SOL_CG> log(verbosity);\n\n    RealType tol, alpha, beta, rnorm, vnorm;\n    VectorType x, r, p, xnew, rnew, pnew;\n\n    x = 0.0 * v;\n    r = A * x - v;\n    p = -1.0 * r;\n    vnorm = v.norm();\n    rnorm = r.norm();\n\n    log.init(tolerance, rnorm, vnorm);\n\n    int i = 0;\n    while (rnorm \/ vnorm > tolerance)\n    {\n        alpha = dot(r, r) \/ dot(p, A * p);\n        xnew  = x + alpha *     p;\n        rnew  = A * xnew - v;\n        beta  = dot(rnew, rnew) \/ dot(r, r);\n        pnew  = beta * p - rnew;\n\n        x = xnew;\n        r = rnew; rnorm = r.norm();\n        p = pnew;\n\n        i++;\n        if (i % 10 == 0)\n            log.step(i, rnorm);\n    }\n    log.finalize(i);\n\n    return x;\n}\n\n\/\/ -----------------------  \/\/\n\/\/  Preconditioned Solver   \/\/\n\/\/ -----------------------  \/\/\n\ntemplate<typename Solver, typename Transformation>\nPreconditionedSolver<Solver, Transformation>::\nPreconditionedSolver(Solver s, Transformation t)\n    : solver(s), transformation(t)\n{\n    \/\/ Nothin to do here.\n}\n\ntemplate<typename Solver, typename Transformation>\n    template<typename VectorType, typename MatrixType>\nauto PreconditionedSolver<Solver, Transformation>::solve(const MatrixType &A,\n                                                         const VectorType &v)\n    -> VectorType\n{\n    VectorType vt = transformation.apply(v);\n    auto At       = transformation.apply(A);\n    VectorType x  = transformation.apply(solver.solve(At, vt));\n    return x;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright Hugh Perkins 2016\n\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 \"cocl\/cocl_memory.h\"\n\n#include \"cocl\/hostside_opencl_funcs.h\"\n\n#include <iostream>\n#include <memory>\n#include <vector>\n#include <map>\n#include <set>\n\n#include \"EasyCL.h\"\n\n#include \"CL\/cl.h\"\n\n#include \"pthread.h\"\n\nusing namespace std;\nusing namespace cocl;\nusing namespace easycl;\n\nnamespace cocl {\n    pthread_mutex_t print_mutex = PTHREAD_MUTEX_INITIALIZER;\n}\n\n\/\/ #undef COCL_PRINT\n\/\/ #define COCL_PRINT(stuff) \\\n\/\/     pthread_mutex_lock(&cocl::print_mutex); \\\n\/\/     stuff ; \\\n\/\/     pthread_mutex_unlock(&cocl::print_mutex);\n\nnamespace cocl {\n    pthread_mutex_t mem_mutex = PTHREAD_MUTEX_INITIALIZER;\n\n    class MemoryMutex {\n    public:\n        MemoryMutex() {\n            \/\/ COCL_PRINT(cout << \"locking mem mutex\" << endl);\n            pthread_mutex_lock(&mem_mutex);\n        }\n        ~MemoryMutex() {\n            \/\/ COCL_PRINT(cout << \"releasing mem mutex\" << endl);\n            pthread_mutex_unlock(&mem_mutex);\n        }\n    };\n\n    \/\/ we should index these, but a set is ok-ish for now. maybe\n    set<Memory *>memories;\n    long long nextAllocPos = 1;\n    map< long long, Memory *>memoryByAllocPos;\n\n    Memory::Memory(cl_mem clmem, size_t bytes) :\n            clmem(clmem), bytes(bytes) {\n        MemoryMutex memoryMutex;\n        fakePos = nextAllocPos;\n        \/\/ we should align it actually.  on 128-bytes?\n        fakePos = ((fakePos + 127) \/ 128) * 128;\n        nextAllocPos = fakePos + bytes;\n        memoryByAllocPos[fakePos] = this;\n        memories.insert(this);\n    }\n\n    Memory *Memory::newDeviceAlloc(size_t bytes) {\n        cl_int err;\n        cl_mem clmem = clCreateBuffer(*ctx, CL_MEM_READ_WRITE, bytes,\n                                               NULL, &err);\n        cl->checkError(err);\n        Memory *memory = new Memory(clmem, bytes);\n        COCL_PRINT(cout << \"Memory::newDeviceAlloc bytes=\" << bytes << \" memory=\" << (void *)memory << \" clmem=\" << (void*)memory->clmem << endl);\n        return memory;\n    }\n\n    Memory::~Memory() {\n        COCL_PRINT(cout << \"~Memory releasing mem object memory=\" << (void *)this << endl);\n        cl_int err = clReleaseMemObject(clmem);\n        cl->checkError(err);\n        \/\/ TODO: should remove from map and set too\n    }\n\n    Memory *findMemory(char *passedInAsCharStar) {\n        MemoryMutex memoryMutex;\n        \/\/ char *passedInAsCharStar = (char *)passedInPointer;\n        long long pos = (long long )passedInAsCharStar;\n        for(auto it=memories.begin(), e=memories.end(); it != e; it++) {\n            Memory *memory = *it;\n            if(pos >= memory->fakePos && pos < memory->fakePos + memory->bytes) {\n                COCL_PRINT(cout << \"found memory: \" << (void *)memory << endl);\n                return memory;\n            }\n        }\n        cout << \"could not find memory for \" << (void *)passedInAsCharStar << endl;\n        throw runtime_error(\"could not find memory\");\n    }\n    size_t Memory::getOffset(char *passedInAsCharStar) {\n        return (long long)passedInAsCharStar - fakePos;\n    }\n}\n\nsize_t cuMemHostAlloc(void **pHostPointer, unsigned int bytes, int CU_MEMHOSTALLOC_PORTABLE) {\n    COCL_PRINT(cout << \"cuMemHostAlloc redirected bytes=\" << bytes << endl);\n    *pHostPointer = malloc(bytes);\n    return 0;\n}\n\nsize_t cuMemFreeHost(void *hostPointer) {\n    COCL_PRINT(cout << \"cuMemFreeHost redirected\" << endl);\n    free(hostPointer);\n    return 0;\n}\n\nsize_t cuMemGetInfo(size_t *free, size_t *total) {\n    COCL_PRINT(cout << \"cuMemGetInfo redirected\" << endl);\n    *free = 1024 * 1024;\n    *total = 1024 * 1024;\n    return 0;\n}\n\nsize_t cudaMemcpyAsync (void *dst, const void *src, size_t count, size_t cudaMemcpyKind, char *_queue) {\n    CLQueue *queue = (CLQueue *)_queue;\n    COCL_PRINT(cout << \"cudaMemcpyAsync count=\" << count << \" cudaMemcpyKind=\" << cudaMemcpyKind << \" queue=\" << queue << endl);\n\n    if(queue == 0) {\n        queue = cl->default_queue;\n        COCL_PRINT(cout << \"using default queue\" << endl);\n    }\n    cl_int err;\n    if(cudaMemcpyKind == cudaMemcpyDeviceToHost) {\n        \/\/ device => host\n        \/\/ Memory *srcMemory = (Memory *)src;\n        Memory *srcMemory = findMemory((char *)src);\n        size_t src_offset = srcMemory->getOffset((char *)src);\n        err = clEnqueueReadBuffer(queue->queue, srcMemory->clmem, CL_FALSE, src_offset,\n                                         count, dst, 0, NULL, NULL);\n        cl->checkError(err);\n        \/\/ cl->finish();\n    } else if(cudaMemcpyKind == cudaMemcpyHostToDevice) {\n        \/\/ host => device\n        \/\/ Memory *dstMemory = (Memory*)dst;\n        Memory *dstMemory = findMemory((char *)dst);\n        size_t dst_offset = dstMemory->getOffset((char *)dst);\n        err = clEnqueueWriteBuffer(queue->queue, dstMemory->clmem, CL_FALSE, dst_offset,\n                                          count, src, 0, NULL, NULL);\n        cl->checkError(err);\n    } else {\n        cout << \"cudaMemcpyKind using opencl \" << cudaMemcpyKind << endl;\n        throw runtime_error(\"unhandled cudaMemcpyKind\");\n    }\n\n    return 0;\n}\n\nsize_t cudaMemsetAsync(void *devPtr, int value, size_t count, char *_queue) {\n    CLQueue *queue = (CLQueue *)_queue;\n    COCL_PRINT(cout << \"cudaMemsetAsync stub value=\" << value << \" count=\" << count << \" queue=\" << queue << endl);\n    \/\/ assert(stream == 0);\n    throw runtime_error(\"cudaMemsetAsync not implemented\");\n\n    return 0;\n}\n\nsize_t cuMemsetD8(CUdeviceptr location, unsigned char value, uint32_t count) {\n    COCL_PRINT(cout << \"cuMemsetD8 redirected value \" << value << \" count=\" << count << endl);\n    \/\/ Memory *memory = (Memory *)location;\n    \/\/ use default queue??\n    Memory *memory = findMemory((char *)location);\n    size_t offset = memory->getOffset((char *)location);\n    cl_int err = clEnqueueFillBuffer(cl->default_queue->queue, memory->clmem, &value, sizeof(unsigned char), offset, count * sizeof(unsigned char), 0, 0, 0);\n    cl->checkError(err);\n    return 0;\n}\n\nsize_t cuMemsetD32(CUdeviceptr location, unsigned int value, uint32_t count) {\n    \/\/ Memory *memory = (Memory *)location;\n    Memory *memory = findMemory((char *)location);\n    size_t offset = memory->getOffset((char *)location);\n    COCL_PRINT(cout << \"cuMemsetD32 redirected value \" << value << \" count=\" << count << \" location=\" << location << \" memory=\" << (void *)memory << endl);\n    cl_int err = clEnqueueFillBuffer(cl->default_queue->queue, memory->clmem, &value, sizeof(int), offset, count * sizeof(int), 0, 0, 0);\n    cl->checkError(err);\n    return 0;\n}\n\nsize_t cuDeviceTotalMem(uint64_t *value, CUdeviceptr device) {\n    COCL_PRINT(cout << \"cuDeviceTotalMem redirected\" << endl);\n    *value = 1024 * 1024;\n    return 0;\n}\n\nsize_t cudaMemcpy(void *dst, const void *src, size_t bytes, size_t cudaMemcpyKind) {\n    COCL_PRINT(cout << \"cudamempcy using opencl cudaMemcpyKind \" << cudaMemcpyKind << \" count=\" << bytes << endl);\n    cl_int err;\n    if(cudaMemcpyKind == cudaMemcpyDeviceToHost) {\n        \/\/ device => host\n        \/\/ cout << \"cudamemcpy device to host\" << endl;\n        Memory *srcMemory = findMemory((char *)src);\n        size_t offset = srcMemory->getOffset((char *)src);\n        err = clEnqueueReadBuffer(cl->default_queue->queue, srcMemory->clmem, CL_TRUE, offset,\n                                         bytes, dst, 0, NULL, NULL);\n        cl->checkError(err);\n        \/\/ cl->finish();\n    } else if(cudaMemcpyKind == cudaMemcpyHostToDevice) {\n        \/\/ host => device\n        \/\/ cout << \"cudamemcpy host to device\" << endl;\n        Memory *dstMemory = findMemory((char *)dst);\n        size_t offset = dstMemory->getOffset((char *)dst);\n        err = clEnqueueWriteBuffer(cl->default_queue->queue, dstMemory->clmem, CL_TRUE, offset,\n                                          bytes, src, 0, NULL, NULL);\n        cl->checkError(err);\n    } else if(cudaMemcpyKind == cudaMemcpyDeviceToDevice) {\n        \/\/ device => device\n        Memory *srcMemory = findMemory((char *)src);\n        size_t src_offset = srcMemory->getOffset((char *)src);\n        Memory *dstMemory = findMemory((char *)dst);\n        size_t dst_offset = dstMemory->getOffset((char *)dst);\n        err = clEnqueueCopyBuffer(\n            cl->default_queue->queue,\n            srcMemory->clmem,\n            dstMemory->clmem,\n            src_offset,\n            dst_offset,\n            bytes,\n            0,\n            0,\n            0);\n        cl->checkError(err);\n    } else {\n        cout << \"cudaMemcpyKind using opencl \" << cudaMemcpyKind << endl;\n        throw runtime_error(\"unhandled cudaMemcpyKind\");\n    }\n    return 0;\n}\n\nsize_t cuMemcpyHtoDAsync(CUdeviceptr dst, const void *src, size_t bytes, char *_queue) {\n    CLQueue *queue = (CLQueue*)_queue;\n    \/\/ host => device\n    COCL_PRINT(cout << \"cuMemcpyHtoDAsync dst=\" << dst << \" src=\" << src << \" bytes=\" << bytes << endl);\n    Memory *dstMemory = findMemory((char *)dst);\n    size_t offset = dstMemory->getOffset((char *)dst);\n    COCL_PRINT(cout << \"memory \" << (void *)dstMemory << \" offset=\" << offset << endl);\n    cl_int err = clEnqueueWriteBuffer(queue->queue, dstMemory->clmem, CL_FALSE, offset,\n                                      bytes, src, 0, NULL, NULL);\n    cl->checkError(err);\n    return 0;\n}\n\nsize_t  cuMemcpyDtoHAsync(void *dst, CUdeviceptr src, size_t bytes, char *_queue) {\n    CLQueue *queue = (CLQueue*)_queue;\n    COCL_PRINT(cout << \"cuMemcpyDtoHAsync dst=\" << dst << \" src=\" << src << \" bytes=\" << bytes << endl);\n    Memory *srcMemory = findMemory((char *)src);\n    size_t offset = srcMemory->getOffset((char *)src);\n    COCL_PRINT(cout << \"memory \" << (void *)srcMemory << \" offset=\" << offset << endl);\n    cl_int err = clEnqueueReadBuffer(queue->queue, srcMemory->clmem, CL_FALSE, offset,\n                                     bytes, dst, 0, NULL, NULL);\n    cl->checkError(err);\n    return 0;\n}\n\n\/\/ => synchronous <=\nsize_t cuMemcpyHtoD(CUdeviceptr gpu_dst, const void *host_src, size_t size) {\n    cudaMemcpy((void *)gpu_dst, host_src, size, cudaMemcpyHostToDevice);\n    cl->finish();\n    return 0;\n}\n\n\/\/ => synchronous <=\nsize_t  cuMemcpyDtoH(void *host_dst, CUdeviceptr gpu_src, size_t size) {\n    COCL_PRINT(cout << \"cumemcpyDtoH\" << endl);\n    cudaMemcpy(host_dst, (void *)gpu_src, size, cudaMemcpyDeviceToHost);\n    cl->finish();\n    return 0;\n}\n\nsize_t cudaMalloc(void **_pMemory, size_t N) {\n    hostside_opencl_funcs_assure_initialized();\n    Memory *memory = Memory::newDeviceAlloc(N);\n    COCL_PRINT(cout << \"cudaMalloc using cl, size \" << N << \" memory=\" << (void *)memory << \" fakePos=\" << memory->fakePos << endl);\n    *_pMemory = (void *)memory->fakePos;\n    return 0;\n}\n\nsize_t cuMemAlloc(CUdeviceptr*_pMemory, size_t bytes) {\n    return cudaMalloc((void **)_pMemory, bytes);\n}\n\nsize_t cudaFree(void *_memory) {\n    Memory *memory = findMemory((char *)_memory);\n    COCL_PRINT(cout << \"cudafree using opencl memory=\" << memory << endl);\n    delete memory;\n    return 0;\n}\n\nsize_t cuMemFree(CUdeviceptr memory) {\n    return cudaFree((void *)memory);\n}\n<commit_msg>enable async device-to-device memcpy<commit_after>\/\/ Copyright Hugh Perkins 2016\n\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 \"cocl\/cocl_memory.h\"\n\n#include \"cocl\/hostside_opencl_funcs.h\"\n\n#include <iostream>\n#include <memory>\n#include <vector>\n#include <map>\n#include <set>\n\n#include \"EasyCL.h\"\n\n#include \"CL\/cl.h\"\n\n#include \"pthread.h\"\n\nusing namespace std;\nusing namespace cocl;\nusing namespace easycl;\n\nnamespace cocl {\n    pthread_mutex_t print_mutex = PTHREAD_MUTEX_INITIALIZER;\n}\n\n\/\/ #undef COCL_PRINT\n\/\/ #define COCL_PRINT(stuff) \\\n\/\/     pthread_mutex_lock(&cocl::print_mutex); \\\n\/\/     stuff ; \\\n\/\/     pthread_mutex_unlock(&cocl::print_mutex);\n\nnamespace cocl {\n    pthread_mutex_t mem_mutex = PTHREAD_MUTEX_INITIALIZER;\n\n    class MemoryMutex {\n    public:\n        MemoryMutex() {\n            \/\/ COCL_PRINT(cout << \"locking mem mutex\" << endl);\n            pthread_mutex_lock(&mem_mutex);\n        }\n        ~MemoryMutex() {\n            \/\/ COCL_PRINT(cout << \"releasing mem mutex\" << endl);\n            pthread_mutex_unlock(&mem_mutex);\n        }\n    };\n\n    \/\/ we should index these, but a set is ok-ish for now. maybe\n    set<Memory *>memories;\n    long long nextAllocPos = 1;\n    map< long long, Memory *>memoryByAllocPos;\n\n    Memory::Memory(cl_mem clmem, size_t bytes) :\n            clmem(clmem), bytes(bytes) {\n        MemoryMutex memoryMutex;\n        fakePos = nextAllocPos;\n        \/\/ we should align it actually.  on 128-bytes?\n        fakePos = ((fakePos + 127) \/ 128) * 128;\n        nextAllocPos = fakePos + bytes;\n        memoryByAllocPos[fakePos] = this;\n        memories.insert(this);\n    }\n\n    Memory *Memory::newDeviceAlloc(size_t bytes) {\n        cl_int err;\n        cl_mem clmem = clCreateBuffer(*ctx, CL_MEM_READ_WRITE, bytes,\n                                               NULL, &err);\n        cl->checkError(err);\n        Memory *memory = new Memory(clmem, bytes);\n        COCL_PRINT(cout << \"Memory::newDeviceAlloc bytes=\" << bytes << \" memory=\" << (void *)memory << \" clmem=\" << (void*)memory->clmem << endl);\n        return memory;\n    }\n\n    Memory::~Memory() {\n        COCL_PRINT(cout << \"~Memory releasing mem object memory=\" << (void *)this << endl);\n        cl_int err = clReleaseMemObject(clmem);\n        cl->checkError(err);\n        \/\/ TODO: should remove from map and set too\n    }\n\n    Memory *findMemory(char *passedInAsCharStar) {\n        MemoryMutex memoryMutex;\n        \/\/ char *passedInAsCharStar = (char *)passedInPointer;\n        long long pos = (long long )passedInAsCharStar;\n        for(auto it=memories.begin(), e=memories.end(); it != e; it++) {\n            Memory *memory = *it;\n            if(pos >= memory->fakePos && pos < memory->fakePos + memory->bytes) {\n                COCL_PRINT(cout << \"found memory: \" << (void *)memory << endl);\n                return memory;\n            }\n        }\n        cout << \"could not find memory for \" << (void *)passedInAsCharStar << endl;\n        throw runtime_error(\"could not find memory\");\n    }\n    size_t Memory::getOffset(char *passedInAsCharStar) {\n        return (long long)passedInAsCharStar - fakePos;\n    }\n}\n\nsize_t cuMemHostAlloc(void **pHostPointer, unsigned int bytes, int CU_MEMHOSTALLOC_PORTABLE) {\n    COCL_PRINT(cout << \"cuMemHostAlloc redirected bytes=\" << bytes << endl);\n    *pHostPointer = malloc(bytes);\n    return 0;\n}\n\nsize_t cuMemFreeHost(void *hostPointer) {\n    COCL_PRINT(cout << \"cuMemFreeHost redirected\" << endl);\n    free(hostPointer);\n    return 0;\n}\n\nsize_t cuMemGetInfo(size_t *free, size_t *total) {\n    COCL_PRINT(cout << \"cuMemGetInfo redirected\" << endl);\n    *free = 1024 * 1024;\n    *total = 1024 * 1024;\n    return 0;\n}\n\nsize_t cudaMemcpyAsync (void *dst, const void *src, size_t count, size_t cudaMemcpyKind, char *_queue) {\n    CLQueue *queue = (CLQueue *)_queue;\n    COCL_PRINT(cout << \"cudaMemcpyAsync count=\" << count << \" cudaMemcpyKind=\" << cudaMemcpyKind << \" queue=\" << queue << endl);\n\n    if(queue == 0) {\n        queue = cl->default_queue;\n        COCL_PRINT(cout << \"using default queue\" << endl);\n    }\n    cl_int err;\n    if(cudaMemcpyKind == cudaMemcpyDeviceToHost) {\n        \/\/ device => host\n        \/\/ Memory *srcMemory = (Memory *)src;\n        Memory *srcMemory = findMemory((char *)src);\n        size_t src_offset = srcMemory->getOffset((char *)src);\n        err = clEnqueueReadBuffer(queue->queue, srcMemory->clmem, CL_FALSE, src_offset,\n                                         count, dst, 0, NULL, NULL);\n        cl->checkError(err);\n        \/\/ cl->finish();\n    } else if(cudaMemcpyKind == cudaMemcpyHostToDevice) {\n        \/\/ host => device\n        \/\/ Memory *dstMemory = (Memory*)dst;\n        Memory *dstMemory = findMemory((char *)dst);\n        size_t dst_offset = dstMemory->getOffset((char *)dst);\n        err = clEnqueueWriteBuffer(queue->queue, dstMemory->clmem, CL_FALSE, dst_offset,\n                                          count, src, 0, NULL, NULL);\n        cl->checkError(err);\n    } else if(cudaMemcpyKind == cudaMemcpyDeviceToDevice) {\n        Memory *dstMemory = findMemory((char *)dst);\n        size_t dst_offset = dstMemory->getOffset((char *)dst);\n\n        Memory *srcMemory = findMemory((char *)src);\n        size_t src_offset = srcMemory->getOffset((char *)src);\n\n        err = clEnqueueCopyBuffer(\n            queue->queue,\n            srcMemory->clmem,\n            dstMemory->clmem,\n            src_offset,\n            dst_offset,\n            count,\n            0,\n            0,\n            0);\n        cl->checkError(err);\n    } else {\n        cout << \"cudaMemcpyAsync cudaMemcpyKind using opencl \" << cudaMemcpyKind << endl;\n        throw runtime_error(\"unhandled cudaMemcpyKind\");\n    }\n\n    return 0;\n}\n\nsize_t cudaMemsetAsync(void *devPtr, int value, size_t count, char *_queue) {\n    CLQueue *queue = (CLQueue *)_queue;\n    COCL_PRINT(cout << \"cudaMemsetAsync stub value=\" << value << \" count=\" << count << \" queue=\" << queue << endl);\n    \/\/ assert(stream == 0);\n    throw runtime_error(\"cudaMemsetAsync not implemented\");\n\n    return 0;\n}\n\nsize_t cuMemsetD8(CUdeviceptr location, unsigned char value, uint32_t count) {\n    COCL_PRINT(cout << \"cuMemsetD8 redirected value \" << value << \" count=\" << count << endl);\n    \/\/ Memory *memory = (Memory *)location;\n    \/\/ use default queue??\n    Memory *memory = findMemory((char *)location);\n    size_t offset = memory->getOffset((char *)location);\n    cl_int err = clEnqueueFillBuffer(cl->default_queue->queue, memory->clmem, &value, sizeof(unsigned char), offset, count * sizeof(unsigned char), 0, 0, 0);\n    cl->checkError(err);\n    return 0;\n}\n\nsize_t cuMemsetD32(CUdeviceptr location, unsigned int value, uint32_t count) {\n    \/\/ Memory *memory = (Memory *)location;\n    Memory *memory = findMemory((char *)location);\n    size_t offset = memory->getOffset((char *)location);\n    COCL_PRINT(cout << \"cuMemsetD32 redirected value \" << value << \" count=\" << count << \" location=\" << location << \" memory=\" << (void *)memory << endl);\n    cl_int err = clEnqueueFillBuffer(cl->default_queue->queue, memory->clmem, &value, sizeof(int), offset, count * sizeof(int), 0, 0, 0);\n    cl->checkError(err);\n    return 0;\n}\n\nsize_t cuDeviceTotalMem(uint64_t *value, CUdeviceptr device) {\n    COCL_PRINT(cout << \"cuDeviceTotalMem redirected\" << endl);\n    *value = 1024 * 1024;\n    return 0;\n}\n\nsize_t cudaMemcpy(void *dst, const void *src, size_t bytes, size_t cudaMemcpyKind) {\n    COCL_PRINT(cout << \"cudamempcy using opencl cudaMemcpyKind \" << cudaMemcpyKind << \" count=\" << bytes << endl);\n    cl_int err;\n    if(cudaMemcpyKind == cudaMemcpyDeviceToHost) {\n        \/\/ device => host\n        \/\/ cout << \"cudamemcpy device to host\" << endl;\n        Memory *srcMemory = findMemory((char *)src);\n        size_t offset = srcMemory->getOffset((char *)src);\n        err = clEnqueueReadBuffer(cl->default_queue->queue, srcMemory->clmem, CL_TRUE, offset,\n                                         bytes, dst, 0, NULL, NULL);\n        cl->checkError(err);\n        \/\/ cl->finish();\n    } else if(cudaMemcpyKind == cudaMemcpyHostToDevice) {\n        \/\/ host => device\n        \/\/ cout << \"cudamemcpy host to device\" << endl;\n        Memory *dstMemory = findMemory((char *)dst);\n        size_t offset = dstMemory->getOffset((char *)dst);\n        err = clEnqueueWriteBuffer(cl->default_queue->queue, dstMemory->clmem, CL_TRUE, offset,\n                                          bytes, src, 0, NULL, NULL);\n        cl->checkError(err);\n    } else if(cudaMemcpyKind == cudaMemcpyDeviceToDevice) {\n        \/\/ device => device\n        Memory *srcMemory = findMemory((char *)src);\n        size_t src_offset = srcMemory->getOffset((char *)src);\n        Memory *dstMemory = findMemory((char *)dst);\n        size_t dst_offset = dstMemory->getOffset((char *)dst);\n        err = clEnqueueCopyBuffer(\n            cl->default_queue->queue,\n            srcMemory->clmem,\n            dstMemory->clmem,\n            src_offset,\n            dst_offset,\n            bytes,\n            0,\n            0,\n            0);\n        cl->checkError(err);\n    } else {\n        cout << \"cudaMemcpy cudaMemcpyKind using opencl \" << cudaMemcpyKind << endl;\n        throw runtime_error(\"unhandled cudaMemcpyKind\");\n    }\n    return 0;\n}\n\nsize_t cuMemcpyHtoDAsync(CUdeviceptr dst, const void *src, size_t bytes, char *_queue) {\n    CLQueue *queue = (CLQueue*)_queue;\n    \/\/ host => device\n    COCL_PRINT(cout << \"cuMemcpyHtoDAsync dst=\" << dst << \" src=\" << src << \" bytes=\" << bytes << endl);\n    Memory *dstMemory = findMemory((char *)dst);\n    size_t offset = dstMemory->getOffset((char *)dst);\n    COCL_PRINT(cout << \"memory \" << (void *)dstMemory << \" offset=\" << offset << endl);\n    cl_int err = clEnqueueWriteBuffer(queue->queue, dstMemory->clmem, CL_FALSE, offset,\n                                      bytes, src, 0, NULL, NULL);\n    cl->checkError(err);\n    return 0;\n}\n\nsize_t  cuMemcpyDtoHAsync(void *dst, CUdeviceptr src, size_t bytes, char *_queue) {\n    CLQueue *queue = (CLQueue*)_queue;\n    COCL_PRINT(cout << \"cuMemcpyDtoHAsync dst=\" << dst << \" src=\" << src << \" bytes=\" << bytes << endl);\n    Memory *srcMemory = findMemory((char *)src);\n    size_t offset = srcMemory->getOffset((char *)src);\n    COCL_PRINT(cout << \"memory \" << (void *)srcMemory << \" offset=\" << offset << endl);\n    cl_int err = clEnqueueReadBuffer(queue->queue, srcMemory->clmem, CL_FALSE, offset,\n                                     bytes, dst, 0, NULL, NULL);\n    cl->checkError(err);\n    return 0;\n}\n\n\/\/ => synchronous <=\nsize_t cuMemcpyHtoD(CUdeviceptr gpu_dst, const void *host_src, size_t size) {\n    cudaMemcpy((void *)gpu_dst, host_src, size, cudaMemcpyHostToDevice);\n    cl->finish();\n    return 0;\n}\n\n\/\/ => synchronous <=\nsize_t  cuMemcpyDtoH(void *host_dst, CUdeviceptr gpu_src, size_t size) {\n    COCL_PRINT(cout << \"cumemcpyDtoH\" << endl);\n    cudaMemcpy(host_dst, (void *)gpu_src, size, cudaMemcpyDeviceToHost);\n    cl->finish();\n    return 0;\n}\n\nsize_t cudaMalloc(void **_pMemory, size_t N) {\n    hostside_opencl_funcs_assure_initialized();\n    Memory *memory = Memory::newDeviceAlloc(N);\n    COCL_PRINT(cout << \"cudaMalloc using cl, size \" << N << \" memory=\" << (void *)memory << \" fakePos=\" << memory->fakePos << endl);\n    *_pMemory = (void *)memory->fakePos;\n    return 0;\n}\n\nsize_t cuMemAlloc(CUdeviceptr*_pMemory, size_t bytes) {\n    return cudaMalloc((void **)_pMemory, bytes);\n}\n\nsize_t cudaFree(void *_memory) {\n    Memory *memory = findMemory((char *)_memory);\n    COCL_PRINT(cout << \"cudafree using opencl memory=\" << memory << endl);\n    delete memory;\n    return 0;\n}\n\nsize_t cuMemFree(CUdeviceptr memory) {\n    return cudaFree((void *)memory);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/***********************************************************************\n tcp_connection.cpp - Implements the TCPConnection class.\n\n Copyright (c) 2007-2008 by Educational Technology Resources, Inc.\n Others may also hold copyrights on code in this file.  See the\n CREDITS file 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#define MYSQLPP_NOT_HEADER\n#include \"common.h\"\n#include \"tcp_connection.h\"\n\n#include \"exceptions.h\"\n\n#if !defined(MYSQLPP_PLATFORM_WINDOWS)\n#\tinclude <netdb.h>\n#endif\n\n#include <ctype.h>\n#include <stdlib.h>\n#include <climits>\n\nusing namespace std;\n\nnamespace mysqlpp {\n\n\nbool\nTCPConnection::connect(const char* addr, const char* db,\n\t\tconst char* user, const char* pass)\n{\n\terror_message_.clear();\n\n\tunsigned int port = 0;\n\tstring address;\n\tif (addr) {\n\t\taddress = addr;\n\t\tif (!parse_address(address, port, error_message_)) {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tif (error_message_.empty()) {\n\t\treturn Connection::connect(db, address.c_str(), user, pass, port);\n\t}\n\telse {\n\t\tif (throw_exceptions()) {\n\t\t\tthrow ConnectionFailed(error_message_.c_str());\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n}\n\n\nbool\nTCPConnection::parse_address(std::string& addr, unsigned int& port,\n\t\tstd::string& error)\n{\n\terror.clear();\n\t\n\t\/\/ Pull off service name or port number, if any\n\tstring service;\n\tif (addr[0] == '[') {\n\t\t\/\/ Might be IPv6 address plus port\/service in RFC 2732 form.\n\t\tstring::size_type pos = addr.find(']');\n\t\tif ((pos == string::npos) ||\n\t\t\t\t(addr.find(':', pos + 1) != (pos + 1)) ||\n\t\t\t\t(addr.find_first_of(\"[]\", pos + 2) != string::npos)) {\n\t\t\terror = \"Malformed IPv6 [address]:service combination\";\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/ We can separate address from port\/service now\n\t\tservice = addr.substr(pos + 2);\n\t\taddr = addr.substr(1, pos - 1);\n\n\t\t\/\/ Ensure that address part is empty or has at least two colons\n\t\tif (addr.size() &&\n\t\t\t\t(((pos = addr.find(':')) == string::npos) ||\n\t\t\t\t(addr.find(':', pos + 1) == string::npos))) {\n\t\t\terror = \"IPv6 literal needs at least two colons\";\n\t\t\treturn false;\n\t\t}\n\t}\n\telse {\n\t\t\/\/ Can only be IPv4 address, so check for 0-1 colons\n\t\tstring::size_type pos = addr.find(':');\n\t\tif (pos != string::npos) {\n\t\t\tif (addr.find(':', pos + 1) != string::npos) {\n\t\t\t\terror = \"IPv4 address:service combo can have only one colon\";\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\t\n\t\t\tservice = addr.substr(pos + 1);\n\t\t\taddr = addr.substr(0, pos);\n\t\t}\n\t}\n\n\t\/\/ Turn service into a port number, if it was given.  If not, don't\n\t\/\/ overwrite port because it could have a legal value passed in from\n\t\/\/ Connection.\n\tif (!service.empty()) {\n\t\tif (isdigit(service[0])) {\n\t\t\tport = atoi(service.c_str());\n\t\t\tif ((port < 1) || (port > USHRT_MAX)) {\n\t\t\t\terror = \"Invalid TCP port number \" + service;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tservent* pse = getservbyname(service.c_str(), \"tcp\");\n\t\t\tif (pse) {\n\t\t\t\tport = ntohs(pse->s_port);\n\t\t\t}\n\t\t\telse {\n\t\t\t\terror = \"Failed to look up TCP service \" + service;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ Ensure that there are only alphanumeric characters, dots,\n\t\/\/ dashes and colons in address.  Anything else must be an error.\n\tfor (string::const_iterator it = addr.begin(); it != addr.end(); ++it) {\n\t\tstring::value_type c = *it;\n\t\tif (!(isalnum(c) || (c == '.') || (c == '-') || (c == ':'))) {\n\t\t\terror = \"Bad character '\";\n\t\t\terror += c;\n\t\t\terror += \"' in TCP\/IP address\";\n\t\t\treturn false;\n\t\t}\n\t}\n\n\treturn true;\n}\n\n\n} \/\/ end namespace mysqlpp\n\n<commit_msg>#include fix for Cygwin<commit_after>\/***********************************************************************\n tcp_connection.cpp - Implements the TCPConnection class.\n\n Copyright (c) 2007-2008 by Educational Technology Resources, Inc.\n Others may also hold copyrights on code in this file.  See the\n CREDITS file 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#define MYSQLPP_NOT_HEADER\n#include \"common.h\"\n#include \"tcp_connection.h\"\n\n#include \"exceptions.h\"\n\n#if !defined(MYSQLPP_PLATFORM_WINDOWS)\n#\tinclude <netdb.h>\n#\tinclude <arpa\/inet.h>\n#endif\n\n#include <ctype.h>\n#include <stdlib.h>\n#include <climits>\n\nusing namespace std;\n\nnamespace mysqlpp {\n\n\nbool\nTCPConnection::connect(const char* addr, const char* db,\n\t\tconst char* user, const char* pass)\n{\n\terror_message_.clear();\n\n\tunsigned int port = 0;\n\tstring address;\n\tif (addr) {\n\t\taddress = addr;\n\t\tif (!parse_address(address, port, error_message_)) {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tif (error_message_.empty()) {\n\t\treturn Connection::connect(db, address.c_str(), user, pass, port);\n\t}\n\telse {\n\t\tif (throw_exceptions()) {\n\t\t\tthrow ConnectionFailed(error_message_.c_str());\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n}\n\n\nbool\nTCPConnection::parse_address(std::string& addr, unsigned int& port,\n\t\tstd::string& error)\n{\n\terror.clear();\n\t\n\t\/\/ Pull off service name or port number, if any\n\tstring service;\n\tif (addr[0] == '[') {\n\t\t\/\/ Might be IPv6 address plus port\/service in RFC 2732 form.\n\t\tstring::size_type pos = addr.find(']');\n\t\tif ((pos == string::npos) ||\n\t\t\t\t(addr.find(':', pos + 1) != (pos + 1)) ||\n\t\t\t\t(addr.find_first_of(\"[]\", pos + 2) != string::npos)) {\n\t\t\terror = \"Malformed IPv6 [address]:service combination\";\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/ We can separate address from port\/service now\n\t\tservice = addr.substr(pos + 2);\n\t\taddr = addr.substr(1, pos - 1);\n\n\t\t\/\/ Ensure that address part is empty or has at least two colons\n\t\tif (addr.size() &&\n\t\t\t\t(((pos = addr.find(':')) == string::npos) ||\n\t\t\t\t(addr.find(':', pos + 1) == string::npos))) {\n\t\t\terror = \"IPv6 literal needs at least two colons\";\n\t\t\treturn false;\n\t\t}\n\t}\n\telse {\n\t\t\/\/ Can only be IPv4 address, so check for 0-1 colons\n\t\tstring::size_type pos = addr.find(':');\n\t\tif (pos != string::npos) {\n\t\t\tif (addr.find(':', pos + 1) != string::npos) {\n\t\t\t\terror = \"IPv4 address:service combo can have only one colon\";\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\t\n\t\t\tservice = addr.substr(pos + 1);\n\t\t\taddr = addr.substr(0, pos);\n\t\t}\n\t}\n\n\t\/\/ Turn service into a port number, if it was given.  If not, don't\n\t\/\/ overwrite port because it could have a legal value passed in from\n\t\/\/ Connection.\n\tif (!service.empty()) {\n\t\tif (isdigit(service[0])) {\n\t\t\tport = atoi(service.c_str());\n\t\t\tif ((port < 1) || (port > USHRT_MAX)) {\n\t\t\t\terror = \"Invalid TCP port number \" + service;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tservent* pse = getservbyname(service.c_str(), \"tcp\");\n\t\t\tif (pse) {\n\t\t\t\tport = ntohs(pse->s_port);\n\t\t\t}\n\t\t\telse {\n\t\t\t\terror = \"Failed to look up TCP service \" + service;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ Ensure that there are only alphanumeric characters, dots,\n\t\/\/ dashes and colons in address.  Anything else must be an error.\n\tfor (string::const_iterator it = addr.begin(); it != addr.end(); ++it) {\n\t\tstring::value_type c = *it;\n\t\tif (!(isalnum(c) || (c == '.') || (c == '-') || (c == ':'))) {\n\t\t\terror = \"Bad character '\";\n\t\t\terror += c;\n\t\t\terror += \"' in TCP\/IP address\";\n\t\t\treturn false;\n\t\t}\n\t}\n\n\treturn true;\n}\n\n\n} \/\/ end namespace mysqlpp\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Licensed to the Apache Software Foundation (ASF) under one\n\/\/ or more contributor license agreements.  See the NOTICE file\n\/\/ distributed with this work for additional information\n\/\/ regarding copyright ownership.  The ASF licenses this file\n\/\/ to you under the Apache License, Version 2.0 (the\n\/\/ \"License\"); you may not use this file except in compliance\n\/\/ with the License.  You may obtain a copy of the License at\n\/\/\n\/\/   http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing,\n\/\/ software distributed under the License is distributed on an\n\/\/ \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n\/\/ KIND, either express or implied.  See the License for the\n\/\/ specific language governing permissions and limitations\n\/\/ under the License.\n\n#include <sys\/statvfs.h>\n#include <sys\/time.h>\n#include <unistd.h>\n\n#include <memory>\n#include <unordered_set>\n\n#include <gflags\/gflags.h>\n#include <glog\/stl_logging.h>\n\n#include \"kudu\/gutil\/map-util.h\"\n#include \"kudu\/gutil\/strings\/substitute.h\"\n#include \"kudu\/gutil\/walltime.h\"\n#include \"kudu\/util\/env_util.h\"\n#include \"kudu\/util\/path_util.h\"\n#include \"kudu\/util\/test_macros.h\"\n#include \"kudu\/util\/test_util.h\"\n\nDECLARE_int64(disk_reserved_bytes_free_for_testing);\n\nusing std::string;\nusing std::unique_ptr;\nusing std::unordered_set;\nusing strings::Substitute;\n\nnamespace kudu {\nnamespace env_util {\n\nclass EnvUtilTest: public KuduTest {\n};\n\n\/\/ Assert that Status 's' indicates there is not enough space left on the\n\/\/ device for the request.\nstatic void AssertNoSpace(const Status& s) {\n  ASSERT_TRUE(s.IsIOError());\n  ASSERT_EQ(ENOSPC, s.posix_code());\n  ASSERT_STR_CONTAINS(s.ToString(), \"Insufficient disk space\");\n}\n\nTEST_F(EnvUtilTest, TestDiskSpaceCheck) {\n  const int64_t kZeroRequestedBytes = 0;\n  const int64_t kRequestOnePercentReservation = -1;\n  int64_t reserved_bytes = 0;\n  ASSERT_OK(VerifySufficientDiskSpace(env_, test_dir_, kZeroRequestedBytes, reserved_bytes));\n\n  \/\/ Check 1% reservation logic. We loop this in case there are other FS\n  \/\/ operations happening concurrent with this test.\n  NO_FATALS(AssertEventually([&] {\n    SpaceInfo space_info;\n    ASSERT_OK(env_->GetSpaceInfo(test_dir_, &space_info));\n    \/\/ Try for 1 less byte than 1% free. This request should be rejected.\n    int64_t target_free_bytes = (space_info.capacity_bytes \/ 100) - 1;\n    int64_t bytes_to_request = std::max(0L, space_info.free_bytes - target_free_bytes);\n    NO_FATALS(AssertNoSpace(VerifySufficientDiskSpace(env_, test_dir_, bytes_to_request,\n                                                      kRequestOnePercentReservation)));\n  }));\n\n  \/\/ Make it seem as if the disk is full and specify that we should have\n  \/\/ reserved 200 bytes. Even asking for 0 bytes should return an error\n  \/\/ indicating we are out of space.\n  FLAGS_disk_reserved_bytes_free_for_testing = 0;\n  reserved_bytes = 200;\n  NO_FATALS(AssertNoSpace(VerifySufficientDiskSpace(env_, test_dir_, kZeroRequestedBytes,\n                                                    reserved_bytes)));\n}\n\n\/\/ Ensure that we can recursively create directories using both absolute and\n\/\/ relative paths.\nTEST_F(EnvUtilTest, TestCreateDirsRecursively) {\n  \/\/ Absolute path.\n  string path = JoinPathSegments(test_dir_, \"a\/b\/c\");\n  ASSERT_OK(CreateDirsRecursively(env_, path));\n  bool is_dir;\n  ASSERT_OK(env_->IsDirectory(path, &is_dir));\n  ASSERT_TRUE(is_dir);\n\n  \/\/ Repeating the previous command should also succeed (it should be a no-op).\n  ASSERT_OK(CreateDirsRecursively(env_, path));\n  ASSERT_OK(env_->IsDirectory(path, &is_dir));\n  ASSERT_TRUE(is_dir);\n\n  \/\/ Relative path.\n  ASSERT_OK(env_->ChangeDir(test_dir_)); \/\/ Change to test dir to keep CWD clean.\n  string rel_base = Substitute(\"$0-$1\", CURRENT_TEST_CASE_NAME(), CURRENT_TEST_NAME());\n  ASSERT_FALSE(env_->FileExists(rel_base));\n  path = JoinPathSegments(rel_base, \"x\/y\/z\");\n  ASSERT_OK(CreateDirsRecursively(env_, path));\n  ASSERT_OK(env_->IsDirectory(path, &is_dir));\n  ASSERT_TRUE(is_dir);\n\n  \/\/ Directory creation should fail if a file is a part of the path.\n  path = JoinPathSegments(test_dir_, \"x\/y\/z\");\n  string file_path = JoinPathSegments(test_dir_, \"x\"); \/\/ Conflicts with 'path'.\n  ASSERT_FALSE(env_->FileExists(path));\n  ASSERT_FALSE(env_->FileExists(file_path));\n  \/\/ Create an empty file in the path.\n  unique_ptr<WritableFile> out;\n  ASSERT_OK(env_->NewWritableFile(file_path, &out));\n  ASSERT_OK(out->Close());\n  ASSERT_TRUE(env_->FileExists(file_path));\n  \/\/ Fail.\n  Status s = CreateDirsRecursively(env_, path);\n  ASSERT_TRUE(s.IsAlreadyPresent()) << s.ToString();\n  ASSERT_STR_CONTAINS(s.ToString(), \"File exists\");\n\n  \/\/ We should be able to create a directory tree even when a symlink exists as\n  \/\/ part of the path.\n  path = JoinPathSegments(test_dir_, \"link\/a\/b\");\n  string link_path = JoinPathSegments(test_dir_, \"link\");\n  string real_dir = JoinPathSegments(test_dir_, \"real_dir\");\n  ASSERT_OK(env_->CreateDir(real_dir));\n  PCHECK(symlink(real_dir.c_str(), link_path.c_str()) == 0);\n  ASSERT_OK(CreateDirsRecursively(env_, path));\n  ASSERT_OK(env_->IsDirectory(path, &is_dir));\n  ASSERT_TRUE(is_dir);\n}\n\n\/\/ Ensure that DeleteExcessFilesByPattern() works.\n\/\/ We ensure that the number of files remaining after running it is the number\n\/\/ expected, and we manually set the modification times on the relevant files\n\/\/ to allow us to test that files are deleted oldest-first.\nTEST_F(EnvUtilTest, TestDeleteExcessFilesByPattern) {\n  string dir = JoinPathSegments(test_dir_, \"excess\");\n  ASSERT_OK(env_->CreateDir(dir));\n  vector<string> filenames = {\"a\", \"b\", \"c\", \"d\"};\n  int now_sec = GetCurrentTimeMicros() \/ 1000;\n  for (int i = 0; i < filenames.size(); i++) {\n    const string& filename = filenames[i];\n    string path = JoinPathSegments(dir, filename);\n    unique_ptr<WritableFile> file;\n    ASSERT_OK(env_->NewWritableFile(path, &file));\n    ASSERT_OK(file->Close());\n\n    \/\/ Set the last-modified time of the file.\n    struct timeval target_time { .tv_sec = now_sec + (i * 2), .tv_usec = 0 };\n    struct timeval times[2] = { target_time, target_time };\n    ASSERT_EQ(0, utimes(path.c_str(), times)) << errno;\n  }\n  vector<string> children;\n  ASSERT_OK(env_->GetChildren(dir, &children));\n  ASSERT_EQ(6, children.size()); \/\/ 4 files plus \".\" and \"..\".\n  ASSERT_OK(DeleteExcessFilesByPattern(env_, dir + \"\/*\", 2));\n  ASSERT_OK(env_->GetChildren(dir, &children));\n  ASSERT_EQ(4, children.size()); \/\/ 2 files plus \".\" and \"..\".\n  unordered_set<string> children_set(children.begin(), children.end());\n  unordered_set<string> expected_set({\".\", \"..\", \"c\", \"d\"});\n  ASSERT_EQ(expected_set, children_set) << children;\n}\n\n} \/\/ namespace env_util\n} \/\/ namespace kudu\n<commit_msg>[util] fixed env_util-test.cc compilation on OS X<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 <sys\/statvfs.h>\n#include <sys\/time.h>\n#include <unistd.h>\n\n#include <algorithm>\n#include <memory>\n#include <unordered_set>\n\n#include <gflags\/gflags.h>\n#include <glog\/stl_logging.h>\n\n#include \"kudu\/gutil\/map-util.h\"\n#include \"kudu\/gutil\/strings\/substitute.h\"\n#include \"kudu\/gutil\/walltime.h\"\n#include \"kudu\/util\/env_util.h\"\n#include \"kudu\/util\/path_util.h\"\n#include \"kudu\/util\/test_macros.h\"\n#include \"kudu\/util\/test_util.h\"\n\nDECLARE_int64(disk_reserved_bytes_free_for_testing);\n\nusing std::string;\nusing std::unique_ptr;\nusing std::unordered_set;\nusing strings::Substitute;\n\nnamespace kudu {\nnamespace env_util {\n\nclass EnvUtilTest: public KuduTest {\n};\n\n\/\/ Assert that Status 's' indicates there is not enough space left on the\n\/\/ device for the request.\nstatic void AssertNoSpace(const Status& s) {\n  ASSERT_TRUE(s.IsIOError());\n  ASSERT_EQ(ENOSPC, s.posix_code());\n  ASSERT_STR_CONTAINS(s.ToString(), \"Insufficient disk space\");\n}\n\nTEST_F(EnvUtilTest, TestDiskSpaceCheck) {\n  const int64_t kZeroRequestedBytes = 0;\n  const int64_t kRequestOnePercentReservation = -1;\n  int64_t reserved_bytes = 0;\n  ASSERT_OK(VerifySufficientDiskSpace(env_, test_dir_, kZeroRequestedBytes, reserved_bytes));\n\n  \/\/ Check 1% reservation logic. We loop this in case there are other FS\n  \/\/ operations happening concurrent with this test.\n  NO_FATALS(AssertEventually([&] {\n    SpaceInfo space_info;\n    ASSERT_OK(env_->GetSpaceInfo(test_dir_, &space_info));\n    \/\/ Try for 1 less byte than 1% free. This request should be rejected.\n    int64_t target_free_bytes = (space_info.capacity_bytes \/ 100) - 1;\n    int64_t bytes_to_request = std::max<int64_t>(0, space_info.free_bytes - target_free_bytes);\n    NO_FATALS(AssertNoSpace(VerifySufficientDiskSpace(env_, test_dir_, bytes_to_request,\n                                                      kRequestOnePercentReservation)));\n  }));\n\n  \/\/ Make it seem as if the disk is full and specify that we should have\n  \/\/ reserved 200 bytes. Even asking for 0 bytes should return an error\n  \/\/ indicating we are out of space.\n  FLAGS_disk_reserved_bytes_free_for_testing = 0;\n  reserved_bytes = 200;\n  NO_FATALS(AssertNoSpace(VerifySufficientDiskSpace(env_, test_dir_, kZeroRequestedBytes,\n                                                    reserved_bytes)));\n}\n\n\/\/ Ensure that we can recursively create directories using both absolute and\n\/\/ relative paths.\nTEST_F(EnvUtilTest, TestCreateDirsRecursively) {\n  \/\/ Absolute path.\n  string path = JoinPathSegments(test_dir_, \"a\/b\/c\");\n  ASSERT_OK(CreateDirsRecursively(env_, path));\n  bool is_dir;\n  ASSERT_OK(env_->IsDirectory(path, &is_dir));\n  ASSERT_TRUE(is_dir);\n\n  \/\/ Repeating the previous command should also succeed (it should be a no-op).\n  ASSERT_OK(CreateDirsRecursively(env_, path));\n  ASSERT_OK(env_->IsDirectory(path, &is_dir));\n  ASSERT_TRUE(is_dir);\n\n  \/\/ Relative path.\n  ASSERT_OK(env_->ChangeDir(test_dir_)); \/\/ Change to test dir to keep CWD clean.\n  string rel_base = Substitute(\"$0-$1\", CURRENT_TEST_CASE_NAME(), CURRENT_TEST_NAME());\n  ASSERT_FALSE(env_->FileExists(rel_base));\n  path = JoinPathSegments(rel_base, \"x\/y\/z\");\n  ASSERT_OK(CreateDirsRecursively(env_, path));\n  ASSERT_OK(env_->IsDirectory(path, &is_dir));\n  ASSERT_TRUE(is_dir);\n\n  \/\/ Directory creation should fail if a file is a part of the path.\n  path = JoinPathSegments(test_dir_, \"x\/y\/z\");\n  string file_path = JoinPathSegments(test_dir_, \"x\"); \/\/ Conflicts with 'path'.\n  ASSERT_FALSE(env_->FileExists(path));\n  ASSERT_FALSE(env_->FileExists(file_path));\n  \/\/ Create an empty file in the path.\n  unique_ptr<WritableFile> out;\n  ASSERT_OK(env_->NewWritableFile(file_path, &out));\n  ASSERT_OK(out->Close());\n  ASSERT_TRUE(env_->FileExists(file_path));\n  \/\/ Fail.\n  Status s = CreateDirsRecursively(env_, path);\n  ASSERT_TRUE(s.IsAlreadyPresent()) << s.ToString();\n  ASSERT_STR_CONTAINS(s.ToString(), \"File exists\");\n\n  \/\/ We should be able to create a directory tree even when a symlink exists as\n  \/\/ part of the path.\n  path = JoinPathSegments(test_dir_, \"link\/a\/b\");\n  string link_path = JoinPathSegments(test_dir_, \"link\");\n  string real_dir = JoinPathSegments(test_dir_, \"real_dir\");\n  ASSERT_OK(env_->CreateDir(real_dir));\n  PCHECK(symlink(real_dir.c_str(), link_path.c_str()) == 0);\n  ASSERT_OK(CreateDirsRecursively(env_, path));\n  ASSERT_OK(env_->IsDirectory(path, &is_dir));\n  ASSERT_TRUE(is_dir);\n}\n\n\/\/ Ensure that DeleteExcessFilesByPattern() works.\n\/\/ We ensure that the number of files remaining after running it is the number\n\/\/ expected, and we manually set the modification times on the relevant files\n\/\/ to allow us to test that files are deleted oldest-first.\nTEST_F(EnvUtilTest, TestDeleteExcessFilesByPattern) {\n  string dir = JoinPathSegments(test_dir_, \"excess\");\n  ASSERT_OK(env_->CreateDir(dir));\n  vector<string> filenames = {\"a\", \"b\", \"c\", \"d\"};\n  int now_sec = GetCurrentTimeMicros() \/ 1000;\n  for (int i = 0; i < filenames.size(); i++) {\n    const string& filename = filenames[i];\n    string path = JoinPathSegments(dir, filename);\n    unique_ptr<WritableFile> file;\n    ASSERT_OK(env_->NewWritableFile(path, &file));\n    ASSERT_OK(file->Close());\n\n    \/\/ Set the last-modified time of the file.\n    struct timeval target_time { .tv_sec = now_sec + (i * 2), .tv_usec = 0 };\n    struct timeval times[2] = { target_time, target_time };\n    ASSERT_EQ(0, utimes(path.c_str(), times)) << errno;\n  }\n  vector<string> children;\n  ASSERT_OK(env_->GetChildren(dir, &children));\n  ASSERT_EQ(6, children.size()); \/\/ 4 files plus \".\" and \"..\".\n  ASSERT_OK(DeleteExcessFilesByPattern(env_, dir + \"\/*\", 2));\n  ASSERT_OK(env_->GetChildren(dir, &children));\n  ASSERT_EQ(4, children.size()); \/\/ 2 files plus \".\" and \"..\".\n  unordered_set<string> children_set(children.begin(), children.end());\n  unordered_set<string> expected_set({\".\", \"..\", \"c\", \"d\"});\n  ASSERT_EQ(expected_set, children_set) << children;\n}\n\n} \/\/ namespace env_util\n} \/\/ namespace kudu\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\tFlexisip, a flexible SIP proxy server with media capabilities.\n\tCopyright (C) 2010-2015  Belledonne Communications SARL, All rights reserved.\n\n\tThis program is free software: you can redistribute it and\/or modify\n\tit under the terms of the GNU Affero General Public License as\n\tpublished by the Free Software Foundation, either version 3 of the\n\tLicense, or (at your option) any later version.\n\n\tThis program is distributed in the hope that it will be useful,\n\tbut WITHOUT ANY WARRANTY; without even the implied warranty of\n\tMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n\tGNU Affero General Public License for more details.\n\n\tYou should have received a copy of the GNU Affero General Public License\n\talong with this program.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include \"configdumper.hh\"\n#include \"module.hh\"\n\nusing namespace std;\n\nostream &ConfigDumper::dump(ostream &ostr) const {\n\treturn dump_recursive(ostr, mRoot, 0);\n}\n\nostream &ConfigDumper::dump_recursive(std::ostream &ostr, const GenericEntry *entry, unsigned int level) const {\n\tconst GenericStruct *cs = dynamic_cast<const GenericStruct *>(entry);\n\tconst ConfigValue *value = dynamic_cast<const ConfigValue *>(entry);\n\tif (cs && shouldDumpModule(cs->getName()) && cs->isExportable()) {\n\n\t\tdumpModuleHead(ostr, cs, level);\n\n\t\tfor (auto it = cs->getChildren().begin(); it != cs->getChildren().end(); ++it) {\n\t\t\tGenericEntry *child = *it;\n\t\t\tdump_recursive(ostr, child, level + 1);\n\t\t}\n\n\t\tdumpModuleEnd(ostr, cs, level);\n\n\t} else if (value) {\n\n\t\tdumpModuleValue(ostr, value, level);\n\t}\n\treturn ostr;\n}\n\nstruct matchModuleName {\n\tconst std::string &mName;\n\tmatchModuleName(const std::string &name) : mName(name) {\n\t}\n\tbool operator()(const ModuleInfoBase *mi) {\n\t\treturn (mi->getModuleName() == mName);\n\t}\n};\n\n#define MODULE_PREFIX_LEN 8 \/* strlen(\"module::\") *\/\nbool ConfigDumper::shouldDumpModule(const string &moduleName) const {\n\t\/\/ When the dumpExperimental is activated, we should dump everything\n\tif (mDumpExperimental)\n\t\treturn true;\n\n\tstring name = moduleName;\n\tif (name.find(\"module::\") != name.npos) {\n\t\tname = moduleName.substr(MODULE_PREFIX_LEN);\n\t}\n\tauto registeredModuleInfo = ModuleInfoManager::get()->getRegisteredModuleInfo();\n\tauto it = std::find_if(registeredModuleInfo.begin(), registeredModuleInfo.end(), matchModuleName(name));\n\n\tModuleInfoBase *moduleInfo = (it != registeredModuleInfo.end()) ? *it : NULL;\n\tif (moduleInfo != NULL) {\n\t\treturn moduleInfo->getClass() == ModuleClass::Production;\n\t} else {\n\t\treturn true;\n\t}\n}\n\n\/* FILE CONFIG DUMPER *\/\n\nostream &FileConfigDumper::printHelp(ostream &os, const string &help, const string &comment_prefix) const {\n    auto it = help.cbegin();\n    auto begin = it;\n\n    for (; it != help.cend(); it++) {\n        if (((it - begin) > 60 && *it == ' ') || *it == '\\n') {\n            os << comment_prefix << \" \" << string(begin, it) << endl;\n            begin = it + 1;\n        }\n    }\n    os << comment_prefix << \" \" << string(begin, it) << endl;\n    return os;\n}\n\nostream &FileConfigDumper::dumpModuleValue(std::ostream &ostr, const ConfigValue *val, int level) const {\n\tif (!val || !val->isExportable())\n\t\treturn ostr;\n\tif (!val->isDeprecated()) {\n\n\t\tprintHelp(ostr, val->getHelp(), \"#\");\n\t\tostr << \"#  Default value: \" << val->getDefault() << endl;\n\n\t\tif (mDumpDefault) {\n\t\t\tostr << val->getName() << \"=\" << val->getDefault() << endl;\n\t\t} else {\n\t\t\tostr << val->getName() << \"=\" << val->get() << endl;\n\t\t}\n\t\tostr << endl;\n\t}\n\treturn ostr;\n}\n\nostream &FileConfigDumper::dumpModuleHead(std::ostream &ostr, const GenericStruct *moduleHead, int level) const {\n\tif (!moduleHead || !moduleHead->isExportable())\n\t\treturn ostr;\n\n\tostr << \"##\" << endl;\n\n\tprintHelp(ostr, moduleHead->getHelp(), \"##\");\n\n\tostr << \"##\" << endl;\n\n\tif (level > 0) {\n\t\tostr << \"[\" << moduleHead->getName() << \"]\" << endl;\n\t} else\n\t\tostr << endl;\n\n\tostr << endl << endl << endl;\n\n\treturn ostr;\n}\n\n\/* TexFileComfigDumper *\/\n\nstatic void escaper(string &str, char c, const string &replaced) {\n\tsize_t i = 0;\n\twhile (string::npos != (i = str.find_first_of(c, i))) {\n\t\tstr.erase(i, 1);\n\t\tstr.insert(i, replaced);\n\t\ti += replaced.length();\n\t}\n}\n\nstatic void string_escaper(string &str, const string &s, const string &replace) {\n\tsize_t i = 0;\n\twhile (string::npos != (i = str.find(s, i))) {\n\t\tstr.erase(i, s.length());\n\t\tstr.insert(i, replace);\n\t\ti += replace.length();\n\t}\n}\n\nstring TexFileConfigDumper::escape(const string &strc) const {\n\tstd::string str(strc);\n\tescaper(str, '_', \"\\\\_\");\n\tescaper(str, '<', \"\\\\textless{}\");\n\tescaper(str, '>', \"\\\\textgreater{}\");\n\n\treturn str;\n}\n\nostream &TexFileConfigDumper::dumpModuleHead(std::ostream &ostr, const GenericStruct *cs, int level) const {\n\tif (cs->getParent()) {\n\t\tstring pn = escape(cs->getPrettyName());\n\t\tostr << \"\\\\section{\" << pn << \"}\" << endl << endl;\n\t\tostr << \"\\\\label{\" << cs->getName() << \"}\" << endl;\n\t\tostr << \"\\\\subsection{Description}\" << endl << endl;\n\t\tostr << escape(cs->getHelp()) << endl << endl;\n\t\tostr << \"\\\\subsection{Parameters}\" << endl << endl;\n\t}\n\treturn ostr;\n}\n\nostream &TexFileConfigDumper::dumpModuleValue(std::ostream &ostr, const ConfigValue *val, int level) const {\n\n\tif (!val->isDeprecated()) {\n\t\tostr << \"\\\\subsubsection{\" << escape(val->getName()) << \"}\" << endl;\n\t\tostr << escape(val->getHelp()) << endl;\n\t\tostr << \"The default value is ``\" << escape(val->getDefault()) << \"''.\" << endl;\n\t\tostr << endl;\n\t}\n\treturn ostr;\n}\n\n\/* Dokuwiki *\/\n\nostream &DokuwikiConfigDumper::dumpModuleValue(std::ostream &ostr, const ConfigValue *val, int level) const {\n\tif (!val->isDeprecated()) {\n\n\t\t\/\/ dokuwiki handles line breaks with double backspaces\n\t\tstring help = val->getHelp();\n\t\tescaper(help, '\\n', \"\\\\\\\\ \");\n\t\tescaper(help, '`', \"'' \");\n\t\tstring_escaper(help, \". \", \".\\\\\\\\ \");\n\n\t\tostr << \"|\"\n\t\t\t << \"'''\" << val->getName() << \"'''\"\n\t\t\t << \" | \" << help << \" | \"\n\t\t\t << \"<code>\" << val->getDefault() << \"<\/code>\"\n\t\t\t << \" | \" << val->getTypeName() << \" | \" << endl;\n\t}\n\treturn ostr;\n}\n\nostream &DokuwikiConfigDumper::dumpModuleHead(std::ostream &ostr, const GenericStruct *cs, int level) const {\n\t\/\/ we have a generic struc: we're on top level: get module name and description\n\tostr << \"====\" << cs->getPrettyName() << \"====\" << endl;\n\tostr << endl << cs->getHelp() << endl;\n\tostr << endl << \"Configuration options:\" << endl;\n\n\tostr << \"^ Name ^ Description ^ Default value ^ Type ^\" << endl;\n\treturn ostr;\n}\n\n\/* MediaWiki *\/\n\nostream &MediaWikiConfigDumper::dumpModuleHead(std::ostream &ostr, const GenericStruct *cs, int level) const {\n\t\/\/ we have a generic struc: we're on top level: get module name and description\n\tostr << \"====\" << cs->getPrettyName() << \"====\" << endl;\n\tostr << endl << cs->getHelp() << endl;\n\tostr << \"----\" << endl;\n\tostr << endl << \"Configuration options:\" << endl;\n\n\tostr << \"{| border=\\\"1\\\" cellpadding=\\\"6\\\" style=\\\"border-collapse:collapse;\\\"\" << endl;\n\tostr << \"!Name\" << endl;\n\tostr << \"!Description\" << endl;\n\tostr << \"!Default Value\" << endl;\n\tostr << \"!Type\" << endl;\n\n\treturn ostr;\n}\n\nostream &MediaWikiConfigDumper::dumpModuleValue(std::ostream &ostr, const ConfigValue *val, int level) const {\n\tif (!val->isDeprecated()) {\n\n\t\t\/\/ MediaWiki handles line breaks with double backspaces\n\t\tstring help = val->getHelp();\n\t\tescaper(help, '\\n', \"<br\/> \");\n\t\tescaper(help, '`', \"'' \");\n\t\tstring_escaper(help, \". \", \".<br\/> \");\n\n\t\tostr << \"|-\" << endl \/\/ entry marker\n\t\t\t << \"|'''\" << val->getName() << \"'''\" << endl\n\t\t\t << \"|\" << help << endl\n\t\t\t << \"|\"\n\t\t\t << \"<code>\" << val->getDefault() << \"<\/code>\" << endl\n\t\t\t << \"|\" << val->getTypeName() << endl;\n\t}\n\treturn ostr;\n}\n\nostream &MediaWikiConfigDumper::dumpModuleEnd(std::ostream &ostr, const GenericStruct *cs, int level) const {\n\n\tostr << \"|}\" << endl;\n\n\treturn ostr;\n}\n\n\nostream &XWikiConfigDumper::dumpModuleHead(std::ostream &ostr, const GenericStruct *cs, int level) const {\n\t\/\/ we have a generic struc: we're on top level: get module name and description\n\tostr << \"=\" << cs->getPrettyName() << \"=\" << endl;\n\tostr << endl << cs->getHelp() << endl;\n\tostr << \"----\" << endl;\n\tostr << endl << \"Configuration options:\" << endl;\n\n\tostr << \"|=(% style=\\\"text-align: center; border: 1px solid #999\\\" %)Name\";\n\tostr << \"|=(% style=\\\"text-align: center; border: 1px solid #999\\\" %)Description\" ;\n\tostr << \"|=(% style=\\\"text-align: center; border: 1px solid #999\\\" %)Default Value\" ;\n\tostr << \"|=(% style=\\\"text-align: center; border: 1px solid #999\\\" %)Type\" << endl;\n\n\treturn ostr;\n}\n\nostream &XWikiConfigDumper::dumpModuleValue(std::ostream &ostr, const ConfigValue *val, int level) const {\n\tif (!val->isDeprecated()) {\n\n\t\t\/\/ XWiki handles line breaks with double backspaces\n\t\tstring help = val->getHelp();\n\t\tescaper(help, '\\n', \"\\n \");\n\t\tescaper(help, '`', \"'' \");\n\n\t\tostr << \"|=(% style=\\\"text-align: center;  vertical-align: middle; border: 1px solid #999\\\" %)\" << val->getName()\n\t\t\t << \"|(% style=\\\"text-align: left; border: 1px solid #999\\\" %)\" << help\n\t\t\t << \"|(% style=\\\"text-align: center; vertical-align: middle; border: 1px solid #999\\\" %) ##\" << val->getDefault() << \"##\"\n\t\t\t << \"|(% style=\\\"text-align: center; vertical-align: middle; border: 1px solid #999\\\" %)\" << val->getTypeName() << endl;\n\t}\n\treturn ostr;\n}\n\n\n\n\n\/* MIB *\/\n\nostream &MibDumper::dump(ostream &ostr) const {\n\tconst time_t t = getCurrentTime();\n\tchar mbstr[100];\n\tstrftime(mbstr, sizeof(mbstr), \"%Y%m%d0000Z\", localtime(&t));\n\n\tostr << \"FLEXISIP-MIB DEFINITIONS ::= BEGIN\" << endl\n\t\t << \"IMPORTS\" << endl\n\t\t << \"\tOBJECT-TYPE, Integer32, MODULE-IDENTITY, enterprises,\" << endl\n\t\t << \"\tCounter64,NOTIFICATION-TYPE\t\t\t\t\t\t\t  \tFROM SNMPv2-SMI\" << endl\n\t\t << \"\tMODULE-COMPLIANCE, OBJECT-GROUP       \t\t\t\t\tFROM SNMPv2-CONF;\" << endl\n\t\t << endl\n\n\t\t << \"flexisipMIB MODULE-IDENTITY\" << endl\n\t\t << \"\tLAST-UPDATED \\\"\" << mbstr << \"\\\"\" << endl\n\t\t << \"\tORGANIZATION \\\"belledonne-communications\\\"\" << endl\n\t\t << \"\tCONTACT-INFO \\\"postal:   34 Avenue de L'europe 38 100 Grenoble France\" << endl\n\t\t << \"\t\temail:    contact@belledonne-communications.com\\\"\" << endl\n\t\t << \"\tDESCRIPTION  \\\"A Flexisip management tree.\\\"\" << endl\n\t\t << \"\tREVISION     \\\"\" << mbstr << \"\\\"\" << endl\n\t\t << \"    DESCRIPTION  \\\"\" PACKAGE_VERSION << \"\\\"\" << endl\n\t\t << \"::={ enterprises \" << company_id << \" }\" << endl\n\t\t << endl;\n\n\tdump2(ostr, mRoot, 0);\n\tostr << \"END\" << endl;\n\treturn ostr;\n}\n\nostream &MibDumper::dump2(ostream &ostr, GenericEntry *entry, int level) const {\n\tGenericStruct *cs = dynamic_cast<GenericStruct *>(entry);\n\tConfigValue *cVal;\n\tStatCounter64 *sVal;\n\tNotificationEntry *ne;\n\tstring spacing = \"\";\n\twhile (level > 0) {\n\t\tspacing += \"\t\";\n\t\t--level;\n\t}\n\tif (cs && shouldDumpModule(cs->getName())) {\n\t\tcs->mibFragment(ostr, spacing);\n\t\tfor (auto it = cs->getChildren().begin(); it != cs->getChildren().end(); ++it) {\n\t\t\tif (!cs->isDeprecated()) {\n\t\t\t\tdump2(ostr, *it, level + 1);\n\t\t\t\tostr << endl;\n\t\t\t}\n\t\t}\n\t} else if ((cVal = dynamic_cast<ConfigValue *>(entry)) != NULL) {\n\t\tcVal->mibFragment(ostr, spacing);\n\t} else if ((sVal = dynamic_cast<StatCounter64 *>(entry)) != NULL) {\n\t\tsVal->mibFragment(ostr, spacing);\n\t} else if ((ne = dynamic_cast<NotificationEntry *>(entry)) != NULL) {\n\t\tne->mibFragment(ostr, spacing);\n\t}\n\treturn ostr;\n}\n<commit_msg>Reformat source<commit_after>\/*\n\tFlexisip, a flexible SIP proxy server with media capabilities.\n\tCopyright (C) 2010-2015  Belledonne Communications SARL, All rights reserved.\n\n\tThis program is free software: you can redistribute it and\/or modify\n\tit under the terms of the GNU Affero General Public License as\n\tpublished by the Free Software Foundation, either version 3 of the\n\tLicense, or (at your option) any later version.\n\n\tThis program is distributed in the hope that it will be useful,\n\tbut WITHOUT ANY WARRANTY; without even the implied warranty of\n\tMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n\tGNU Affero General Public License for more details.\n\n\tYou should have received a copy of the GNU Affero General Public License\n\talong with this program.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include \"configdumper.hh\"\n#include \"module.hh\"\n\nusing namespace std;\n\nostream &ConfigDumper::dump(ostream &ostr) const {\n\treturn dump_recursive(ostr, mRoot, 0);\n}\n\nostream &ConfigDumper::dump_recursive(std::ostream &ostr, const GenericEntry *entry, unsigned int level) const {\n\tconst GenericStruct *cs = dynamic_cast<const GenericStruct *>(entry);\n\tconst ConfigValue *value = dynamic_cast<const ConfigValue *>(entry);\n\tif (cs && shouldDumpModule(cs->getName()) && cs->isExportable()) {\n\n\t\tdumpModuleHead(ostr, cs, level);\n\n\t\tfor (auto it = cs->getChildren().begin(); it != cs->getChildren().end(); ++it) {\n\t\t\tGenericEntry *child = *it;\n\t\t\tdump_recursive(ostr, child, level + 1);\n\t\t}\n\n\t\tdumpModuleEnd(ostr, cs, level);\n\n\t} else if (value) {\n\n\t\tdumpModuleValue(ostr, value, level);\n\t}\n\treturn ostr;\n}\n\nstruct matchModuleName {\n\tconst std::string &mName;\n\tmatchModuleName(const std::string &name) : mName(name) {\n\t}\n\tbool operator()(const ModuleInfoBase *mi) {\n\t\treturn (mi->getModuleName() == mName);\n\t}\n};\n\n#define MODULE_PREFIX_LEN 8 \/* strlen(\"module::\") *\/\nbool ConfigDumper::shouldDumpModule(const string &moduleName) const {\n\t\/\/ When the dumpExperimental is activated, we should dump everything\n\tif (mDumpExperimental)\n\t\treturn true;\n\n\tstring name = moduleName;\n\tif (name.find(\"module::\") != name.npos) {\n\t\tname = moduleName.substr(MODULE_PREFIX_LEN);\n\t}\n\tauto registeredModuleInfo = ModuleInfoManager::get()->getRegisteredModuleInfo();\n\tauto it = std::find_if(registeredModuleInfo.begin(), registeredModuleInfo.end(), matchModuleName(name));\n\n\tModuleInfoBase *moduleInfo = (it != registeredModuleInfo.end()) ? *it : NULL;\n\tif (moduleInfo != NULL) {\n\t\treturn moduleInfo->getClass() == ModuleClass::Production;\n\t} else {\n\t\treturn true;\n\t}\n}\n\n\/* FILE CONFIG DUMPER *\/\n\nostream &FileConfigDumper::printHelp(ostream &os, const string &help, const string &comment_prefix) const {\n\tauto it = help.cbegin();\n\tauto begin = it;\n\n\tfor (; it != help.cend(); it++) {\n\t\tif (((it - begin) > 60 && *it == ' ') || *it == '\\n') {\n\t\t\tos << comment_prefix << \" \" << string(begin, it) << endl;\n\t\t\tbegin = it + 1;\n\t\t}\n\t}\n\tos << comment_prefix << \" \" << string(begin, it) << endl;\n\treturn os;\n}\n\nostream &FileConfigDumper::dumpModuleValue(std::ostream &ostr, const ConfigValue *val, int level) const {\n\tif (!val || !val->isExportable())\n\t\treturn ostr;\n\tif (!val->isDeprecated()) {\n\n\t\tprintHelp(ostr, val->getHelp(), \"#\");\n\t\tostr << \"#  Default value: \" << val->getDefault() << endl;\n\n\t\tif (mDumpDefault) {\n\t\t\tostr << val->getName() << \"=\" << val->getDefault() << endl;\n\t\t} else {\n\t\t\tostr << val->getName() << \"=\" << val->get() << endl;\n\t\t}\n\t\tostr << endl;\n\t}\n\treturn ostr;\n}\n\nostream &FileConfigDumper::dumpModuleHead(std::ostream &ostr, const GenericStruct *moduleHead, int level) const {\n\tif (!moduleHead || !moduleHead->isExportable())\n\t\treturn ostr;\n\n\tostr << \"##\" << endl;\n\n\tprintHelp(ostr, moduleHead->getHelp(), \"##\");\n\n\tostr << \"##\" << endl;\n\n\tif (level > 0) {\n\t\tostr << \"[\" << moduleHead->getName() << \"]\" << endl;\n\t} else\n\t\tostr << endl;\n\n\tostr << endl << endl << endl;\n\n\treturn ostr;\n}\n\n\/* TexFileComfigDumper *\/\n\nstatic void escaper(string &str, char c, const string &replaced) {\n\tsize_t i = 0;\n\twhile (string::npos != (i = str.find_first_of(c, i))) {\n\t\tstr.erase(i, 1);\n\t\tstr.insert(i, replaced);\n\t\ti += replaced.length();\n\t}\n}\n\nstatic void string_escaper(string &str, const string &s, const string &replace) {\n\tsize_t i = 0;\n\twhile (string::npos != (i = str.find(s, i))) {\n\t\tstr.erase(i, s.length());\n\t\tstr.insert(i, replace);\n\t\ti += replace.length();\n\t}\n}\n\nstring TexFileConfigDumper::escape(const string &strc) const {\n\tstd::string str(strc);\n\tescaper(str, '_', \"\\\\_\");\n\tescaper(str, '<', \"\\\\textless{}\");\n\tescaper(str, '>', \"\\\\textgreater{}\");\n\n\treturn str;\n}\n\nostream &TexFileConfigDumper::dumpModuleHead(std::ostream &ostr, const GenericStruct *cs, int level) const {\n\tif (cs->getParent()) {\n\t\tstring pn = escape(cs->getPrettyName());\n\t\tostr << \"\\\\section{\" << pn << \"}\" << endl << endl;\n\t\tostr << \"\\\\label{\" << cs->getName() << \"}\" << endl;\n\t\tostr << \"\\\\subsection{Description}\" << endl << endl;\n\t\tostr << escape(cs->getHelp()) << endl << endl;\n\t\tostr << \"\\\\subsection{Parameters}\" << endl << endl;\n\t}\n\treturn ostr;\n}\n\nostream &TexFileConfigDumper::dumpModuleValue(std::ostream &ostr, const ConfigValue *val, int level) const {\n\n\tif (!val->isDeprecated()) {\n\t\tostr << \"\\\\subsubsection{\" << escape(val->getName()) << \"}\" << endl;\n\t\tostr << escape(val->getHelp()) << endl;\n\t\tostr << \"The default value is ``\" << escape(val->getDefault()) << \"''.\" << endl;\n\t\tostr << endl;\n\t}\n\treturn ostr;\n}\n\n\/* Dokuwiki *\/\n\nostream &DokuwikiConfigDumper::dumpModuleValue(std::ostream &ostr, const ConfigValue *val, int level) const {\n\tif (!val->isDeprecated()) {\n\n\t\t\/\/ dokuwiki handles line breaks with double backspaces\n\t\tstring help = val->getHelp();\n\t\tescaper(help, '\\n', \"\\\\\\\\ \");\n\t\tescaper(help, '`', \"'' \");\n\t\tstring_escaper(help, \". \", \".\\\\\\\\ \");\n\n\t\tostr << \"|\"\n\t\t\t << \"'''\" << val->getName() << \"'''\"\n\t\t\t << \" | \" << help << \" | \"\n\t\t\t << \"<code>\" << val->getDefault() << \"<\/code>\"\n\t\t\t << \" | \" << val->getTypeName() << \" | \" << endl;\n\t}\n\treturn ostr;\n}\n\nostream &DokuwikiConfigDumper::dumpModuleHead(std::ostream &ostr, const GenericStruct *cs, int level) const {\n\t\/\/ we have a generic struc: we're on top level: get module name and description\n\tostr << \"====\" << cs->getPrettyName() << \"====\" << endl;\n\tostr << endl << cs->getHelp() << endl;\n\tostr << endl << \"Configuration options:\" << endl;\n\n\tostr << \"^ Name ^ Description ^ Default value ^ Type ^\" << endl;\n\treturn ostr;\n}\n\n\/* MediaWiki *\/\n\nostream &MediaWikiConfigDumper::dumpModuleHead(std::ostream &ostr, const GenericStruct *cs, int level) const {\n\t\/\/ we have a generic struc: we're on top level: get module name and description\n\tostr << \"====\" << cs->getPrettyName() << \"====\" << endl;\n\tostr << endl << cs->getHelp() << endl;\n\tostr << \"----\" << endl;\n\tostr << endl << \"Configuration options:\" << endl;\n\n\tostr << \"{| border=\\\"1\\\" cellpadding=\\\"6\\\" style=\\\"border-collapse:collapse;\\\"\" << endl;\n\tostr << \"!Name\" << endl;\n\tostr << \"!Description\" << endl;\n\tostr << \"!Default Value\" << endl;\n\tostr << \"!Type\" << endl;\n\n\treturn ostr;\n}\n\nostream &MediaWikiConfigDumper::dumpModuleValue(std::ostream &ostr, const ConfigValue *val, int level) const {\n\tif (!val->isDeprecated()) {\n\n\t\t\/\/ MediaWiki handles line breaks with double backspaces\n\t\tstring help = val->getHelp();\n\t\tescaper(help, '\\n', \"<br\/> \");\n\t\tescaper(help, '`', \"'' \");\n\t\tstring_escaper(help, \". \", \".<br\/> \");\n\n\t\tostr << \"|-\" << endl \/\/ entry marker\n\t\t\t << \"|'''\" << val->getName() << \"'''\" << endl\n\t\t\t << \"|\" << help << endl\n\t\t\t << \"|\"\n\t\t\t << \"<code>\" << val->getDefault() << \"<\/code>\" << endl\n\t\t\t << \"|\" << val->getTypeName() << endl;\n\t}\n\treturn ostr;\n}\n\nostream &MediaWikiConfigDumper::dumpModuleEnd(std::ostream &ostr, const GenericStruct *cs, int level) const {\n\n\tostr << \"|}\" << endl;\n\n\treturn ostr;\n}\n\n\nostream &XWikiConfigDumper::dumpModuleHead(std::ostream &ostr, const GenericStruct *cs, int level) const {\n\t\/\/ we have a generic struc: we're on top level: get module name and description\n\tostr << \"=\" << cs->getPrettyName() << \"=\" << endl;\n\tostr << endl << cs->getHelp() << endl;\n\tostr << \"----\" << endl;\n\tostr << endl << \"Configuration options:\" << endl;\n\n\tostr << \"|=(% style=\\\"text-align: center; border: 1px solid #999\\\" %)Name\";\n\tostr << \"|=(% style=\\\"text-align: center; border: 1px solid #999\\\" %)Description\" ;\n\tostr << \"|=(% style=\\\"text-align: center; border: 1px solid #999\\\" %)Default Value\" ;\n\tostr << \"|=(% style=\\\"text-align: center; border: 1px solid #999\\\" %)Type\" << endl;\n\n\treturn ostr;\n}\n\nostream &XWikiConfigDumper::dumpModuleValue(std::ostream &ostr, const ConfigValue *val, int level) const {\n\tif (!val->isDeprecated()) {\n\n\t\t\/\/ XWiki handles line breaks with double backspaces\n\t\tstring help = val->getHelp();\n\t\tescaper(help, '\\n', \"\\n \");\n\t\tescaper(help, '`', \"'' \");\n\n\t\tostr << \"|=(% style=\\\"text-align: center;  vertical-align: middle; border: 1px solid #999\\\" %)\" << val->getName()\n\t\t\t << \"|(% style=\\\"text-align: left; border: 1px solid #999\\\" %)\" << help\n\t\t\t << \"|(% style=\\\"text-align: center; vertical-align: middle; border: 1px solid #999\\\" %) ##\" << val->getDefault() << \"##\"\n\t\t\t << \"|(% style=\\\"text-align: center; vertical-align: middle; border: 1px solid #999\\\" %)\" << val->getTypeName() << endl;\n\t}\n\treturn ostr;\n}\n\n\n\n\n\/* MIB *\/\n\nostream &MibDumper::dump(ostream &ostr) const {\n\tconst time_t t = getCurrentTime();\n\tchar mbstr[100];\n\tstrftime(mbstr, sizeof(mbstr), \"%Y%m%d0000Z\", localtime(&t));\n\n\tostr << \"FLEXISIP-MIB DEFINITIONS ::= BEGIN\" << endl\n\t\t << \"IMPORTS\" << endl\n\t\t << \"\tOBJECT-TYPE, Integer32, MODULE-IDENTITY, enterprises,\" << endl\n\t\t << \"\tCounter64,NOTIFICATION-TYPE\t\t\t\t\t\t\t  \tFROM SNMPv2-SMI\" << endl\n\t\t << \"\tMODULE-COMPLIANCE, OBJECT-GROUP       \t\t\t\t\tFROM SNMPv2-CONF;\" << endl\n\t\t << endl\n\n\t\t << \"flexisipMIB MODULE-IDENTITY\" << endl\n\t\t << \"\tLAST-UPDATED \\\"\" << mbstr << \"\\\"\" << endl\n\t\t << \"\tORGANIZATION \\\"belledonne-communications\\\"\" << endl\n\t\t << \"\tCONTACT-INFO \\\"postal:   34 Avenue de L'europe 38 100 Grenoble France\" << endl\n\t\t << \"\t\temail:    contact@belledonne-communications.com\\\"\" << endl\n\t\t << \"\tDESCRIPTION  \\\"A Flexisip management tree.\\\"\" << endl\n\t\t << \"\tREVISION     \\\"\" << mbstr << \"\\\"\" << endl\n\t\t << \"    DESCRIPTION  \\\"\" PACKAGE_VERSION << \"\\\"\" << endl\n\t\t << \"::={ enterprises \" << company_id << \" }\" << endl\n\t\t << endl;\n\n\tdump2(ostr, mRoot, 0);\n\tostr << \"END\" << endl;\n\treturn ostr;\n}\n\nostream &MibDumper::dump2(ostream &ostr, GenericEntry *entry, int level) const {\n\tGenericStruct *cs = dynamic_cast<GenericStruct *>(entry);\n\tConfigValue *cVal;\n\tStatCounter64 *sVal;\n\tNotificationEntry *ne;\n\tstring spacing = \"\";\n\twhile (level > 0) {\n\t\tspacing += \"\t\";\n\t\t--level;\n\t}\n\tif (cs && shouldDumpModule(cs->getName())) {\n\t\tcs->mibFragment(ostr, spacing);\n\t\tfor (auto it = cs->getChildren().begin(); it != cs->getChildren().end(); ++it) {\n\t\t\tif (!cs->isDeprecated()) {\n\t\t\t\tdump2(ostr, *it, level + 1);\n\t\t\t\tostr << endl;\n\t\t\t}\n\t\t}\n\t} else if ((cVal = dynamic_cast<ConfigValue *>(entry)) != NULL) {\n\t\tcVal->mibFragment(ostr, spacing);\n\t} else if ((sVal = dynamic_cast<StatCounter64 *>(entry)) != NULL) {\n\t\tsVal->mibFragment(ostr, spacing);\n\t} else if ((ne = dynamic_cast<NotificationEntry *>(entry)) != NULL) {\n\t\tne->mibFragment(ostr, spacing);\n\t}\n\treturn ostr;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2016 K. Isom <coder@kyleisom.net>\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\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 DEALINGS\n * IN THE SOFTWARE.\n *\/\n\n\n#include <cstdlib>\n#include <map>\n#include <string>\n\n#include <klogger\/console.hh>\n\n\nint\nmain(int argc, char *argv[])\n{\n\tstd::string\t\tname = std::string(argv[0]);\n\tklog::ConsoleLogger\tconsole(name);\n\tstd::map<std::string, std::string>\targs;\n\n\tif (!console.good()) {\n\t\t::abort();\n\t}\n\n\tfor (int i = 1; i < argc; i++) {\n\t\tauto\tk = \"argv[\" + std::to_string(i) + \"]\";\n\t\targs[k] = std::string(argv[i]);\n\t}\n\n\tconsole.info(\"main\", \"starts\", args);\n\tconsole.warn(\"main\", \"depleted\");\n\tconsole.fatal(\"main\", \"ends\");\n}\n<commit_msg>Add debug log to console_test.<commit_after>\/*\n * Copyright (c) 2016 K. Isom <coder@kyleisom.net>\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\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 DEALINGS\n * IN THE SOFTWARE.\n *\/\n\n\n#include <cstdlib>\n#include <map>\n#include <string>\n\n#include <klogger\/console.hh>\n\n\nint\nmain(int argc, char *argv[])\n{\n\tstd::string\t\tname = std::string(argv[0]);\n\tklog::ConsoleLogger\tconsole(name);\n\tstd::map<std::string, std::string>\targs;\n\n\tif (!console.good()) {\n\t\t::abort();\n\t}\n\n\tconsole.debug(\"main\", \"starts\");\n\n\tfor (int i = 1; i < argc; i++) {\n\t\tauto\tk = \"argv[\" + std::to_string(i) + \"]\";\n\t\targs[k] = std::string(argv[i]);\n\t}\n\n\tconsole.info(\"main\", \"starts\", args);\n\tconsole.warn(\"main\", \"depleted\");\n\tconsole.fatal(\"main\", \"ends\");\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Copyleft 2012 RIME Developers\n\/\/ License: GPLv3\n\/\/\n\/\/ 2012-03-23 GONG Chen <chen.sst@gmail.com>\n\/\/\n#include <fstream>\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/filesystem.hpp>\n#include <boost\/foreach.hpp>\n#include <boost\/format.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/scope_exit.hpp>\n#include <rime\/common.h>\n#include <rime\/deployer.h>\n#include <rime\/algo\/dynamics.h>\n#include <rime\/dict\/user_db.h>\n#include <rime\/dict\/user_dictionary.h>\n#include <rime\/lever\/user_dict_manager.h>\n\nnamespace fs = boost::filesystem;\n\nnamespace rime {\n\nstatic bool IsUserDb(UserDb& db) {\n  std::string db_type;\n  return db.Fetch(\"\\x01\/db_type\", &db_type) && db_type == \"userdb\";\n}\n\nstatic const std::string GetDbName(UserDb& db) {\n  std::string name;\n  if (!db.Fetch(\"\\x01\/db_name\", &name))\n    return name;\n  boost::erase_last(name, \".kct\");\n  boost::erase_last(name, \".userdb\");\n  return name;\n}\n\nstatic const std::string GetUserId(UserDb& db) {\n  std::string user_id(\"unknown\");\n  db.Fetch(\"\\x01\/user_id\", &user_id);\n  return user_id;\n}\n\nstatic TickCount GetTickCount(UserDb& db) {\n  std::string tick;\n  if (db.Fetch(\"\\x01\/tick\", &tick)) {\n    try {\n      return boost::lexical_cast<TickCount>(tick);\n    }\n    catch (...) {\n    }\n  }\n  return 1;\n}\n\nUserDictManager::UserDictManager(Deployer* deployer)\n    : deployer_(deployer) {\n  if (deployer) {\n    path_ = deployer->user_data_dir;\n  }\n}\n\nvoid UserDictManager::GetUserDictList(UserDictList* user_dict_list) {\n  if (!user_dict_list) return;\n  user_dict_list->clear();\n  if (!fs::exists(path_) || !fs::is_directory(path_)) {\n    LOG(INFO) << \"directory '\" << path_.string() << \"' does not exist.\";\n    return;\n  }\n  fs::directory_iterator it(path_);\n  fs::directory_iterator end;\n  for (; it != end; ++it) {\n    std::string name(it->path().filename().string());\n    if (boost::ends_with(name, \".userdb.kct\")) {\n      boost::erase_last(name, \".userdb.kct\");\n      user_dict_list->push_back(name);\n    }\n  }\n}\n\nbool UserDictManager::Backup(const std::string& dict_name) {\n  UserDb db(dict_name);\n  if (!db.OpenReadOnly())\n    return false;\n  if (GetUserId(db) != deployer_->user_id) {\n    LOG(INFO) << \"user id not match; recreating metadata in \" << dict_name;\n    if (!db.Close() || !db.Open() || !db.CreateMetadata()) {\n      LOG(ERROR) << \"failed to recreate metadata in \" << dict_name;\n      return false;\n    }\n  }\n  return db.Backup();\n}\n\nbool UserDictManager::Restore(const std::string& snapshot_file) {\n  UserDb temp(\".temp\");\n  if (temp.Exists())\n    temp.Remove();\n  if (!temp.Open())\n    return false;\n  BOOST_SCOPE_EXIT( (&temp) )\n  {\n    temp.Close();\n    temp.Remove();\n  } BOOST_SCOPE_EXIT_END\n  if (!temp.Restore(snapshot_file))\n    return false;\n  if (!IsUserDb(temp))\n    return false;\n  std::string db_name(GetDbName(temp));\n  if (db_name.empty())\n    return false;\n  UserDb dest(db_name);\n  if (!dest.Open())\n    return false;\n  BOOST_SCOPE_EXIT( (&dest) )\n  {\n    dest.Close();\n  } BOOST_SCOPE_EXIT_END\n  LOG(INFO) << \"merging '\" << snapshot_file\n            << \"' from \" << GetUserId(temp)\n            << \" into userdb '\" << db_name << \"'...\";\n  TickCount tick_left = GetTickCount(dest);\n  TickCount tick_right = GetTickCount(temp);\n  tick_left = (std::max)(tick_left, tick_right);\n  shared_ptr<TreeDbAccessor> a = temp.Query(\"\");\n  std::string key, left, right;\n  int num_entries = 0;\n  while (a->GetNextRecord(&key, &right)) {\n    if (boost::starts_with(key, \"\\x01\/\"))  \/\/ skip metadata\n      continue;\n    size_t tab_pos = key.find('\\t');\n    if (tab_pos == 0 || tab_pos == std::string::npos)\n      continue;\n    \/\/ fix invalid keys created by a buggy version of Import()\n    if (key[tab_pos - 1] != ' ')\n      key.insert(tab_pos, 1, ' ');\n    int c = 0;\n    double d = 0.0;\n    TickCount t = 0;\n    UserDictionary::UnpackValues(right, &c, &d, &t);\n    if (t < tick_right)\n      d = algo::formula_d(0, (double)tick_right, d, (double)t);\n    if (dest.Fetch(key, &left)) {\n      int c0 = 0;\n      double d0 = 0.0;\n      TickCount t0 = 0;\n      UserDictionary::UnpackValues(left, &c0, &d0, &t0);\n      if (t0 < tick_left)\n        d0 = algo::formula_d(0, (double)tick_left, d0, (double)t0);\n      c = (std::max)(c, c0);\n      d = (std::max)(d, d0);\n    }\n    right = boost::str(boost::format(\"c=%1% d=%2% t=%3%\") %\n                       c % d % tick_left);\n    if (dest.Update(key, right))\n      ++num_entries;\n  }\n  if (num_entries > 0) {\n    try {\n      dest.Update(\"\\x01\/tick\", boost::lexical_cast<std::string>(tick_left));\n      dest.Update(\"\\x01\/user_id\", deployer_->user_id);\n    }\n    catch (...) {\n      LOG(WARNING) << \"failed to update tick count.\";\n    }\n  }\n  LOG(INFO) << \"total \" << num_entries << \" entries imported, tick = \"\n            << tick_left;\n  return true;\n}\n\nint UserDictManager::Export(const std::string& dict_name,\n                            const std::string& text_file) {\n  UserDb db(dict_name);\n  if (!db.OpenReadOnly())\n    return -1;\n  BOOST_SCOPE_EXIT( (&db) )\n  {\n    db.Close();\n  } BOOST_SCOPE_EXIT_END\n  if (!IsUserDb(db))\n    return -1;\n  std::ofstream fout(text_file.c_str());\n  fout << \"# Rime user dictionary export\" << std::endl\n       << \"# db_name: \" << GetDbName(db) << std::endl\n       << \"# user_id: \" << GetUserId(db) << std::endl\n       << \"# commits: \" << GetTickCount(db) << std::endl\n       << std::endl;\n  std::string key, value;\n  std::vector<std::string> row;\n  int num_entries = 0;\n  shared_ptr<UserDbAccessor> a = db.Query(\"\");\n  while (a->GetNextRecord(&key, &value)) {\n    if (boost::starts_with(key, \"\\x01\/\"))  \/\/ skip metadata\n      continue;\n    boost::algorithm::split(row, key,\n                            boost::algorithm::is_any_of(\"\\t\"));\n    if (row.size() != 2 ||\n        row[0].empty() || row[1].empty())\n      continue;\n    boost::algorithm::trim(row[0]);\n    int c = 0;\n    double d = 0.0;\n    TickCount t = 0;\n    UserDictionary::UnpackValues(value, &c, &d, &t);\n    if (c < 0)  \/\/ deleted entry\n      continue;\n    fout << row[1] << \"\\t\" << row[0] << \"\\t\" << c << std::endl;\n    ++num_entries;\n  }\n  fout.close();\n  return num_entries;\n}\n\nint UserDictManager::Import(const std::string& dict_name,\n                            const std::string& text_file) {\n  UserDb db(dict_name);\n  if (!db.Open())\n    return -1;\n  BOOST_SCOPE_EXIT( (&db) )\n  {\n    db.Close();\n  } BOOST_SCOPE_EXIT_END\n  if (!IsUserDb(db))\n    return -1;\n  std::ifstream fin(text_file.c_str());\n  std::string line, key, value;\n  int num_entries = 0;\n  while (getline(fin, line)) {\n    \/\/ skip empty lines and comments\n    if (line.empty() || line[0] == '#') continue;\n    \/\/ read a dict entry\n    std::vector<std::string> row;\n    boost::algorithm::split(row, line,\n                            boost::algorithm::is_any_of(\"\\t\"));\n    if (row.size() < 2 ||\n        row[0].empty() || row[1].empty()) {\n      LOG(WARNING) << \"invalid entry at #\" << num_entries << \".\";\n      continue;\n    }\n    boost::algorithm::trim(row[1]);\n    if (!row[1].empty()) {\n      std::vector<std::string> syllables;\n      boost::algorithm::split(syllables, row[1],\n                              boost::algorithm::is_any_of(\" \"),\n                              boost::algorithm::token_compress_on);\n      row[1] = boost::algorithm::join(syllables, \" \");\n    }\n    key = row[1] + \" \\t\" + row[0];\n    int commits = 0;\n    if (row.size() >= 3 && !row[2].empty()) {\n      try {\n        commits = boost::lexical_cast<int>(row[2]);\n      }\n      catch (...) {\n      }\n    }\n    int c = 0;\n    double d = 0.0;\n    TickCount t = 0;\n    if (db.Fetch(key, &value))\n      UserDictionary::UnpackValues(value, &c, &d, &t);\n    if (commits > 0)\n      c = (std::max)(commits, c);\n    else if (commits < 0)  \/\/ mark as deleted\n      c = commits;\n    value = boost::str(boost::format(\"c=%1% d=%2% t=%3%\") %\n                       c % d % t);\n    if (db.Update(key, value))\n      ++num_entries;\n  }\n  fin.close();\n  return num_entries;\n}\n\nbool UserDictManager::UpgradeUserDict(const std::string& dict_name) {\n  UserDb db(dict_name);\n  if (!db.OpenRepaired())\n    return false;\n  if (!IsUserDb(db))\n    return false;\n  std::string db_creator_version;\n  db.Fetch(\"\\x01\/rime_version\", &db_creator_version);\n  if (CompareVersionString(db_creator_version, \"0.9.5\") <= 0) {\n    \/\/ fix invalid keys created by a buggy version of Import()\n    LOG(INFO) << \"upgrading user dict '\" << dict_name << \"'.\";\n    fs::path snapshot_file(deployer_->user_data_sync_dir());\n    snapshot_file \/= (db.name() + \".snapshot\");\n    return db.Backup() &&\n        db.Close() &&\n        db.Remove() &&\n        Restore(snapshot_file.string());\n  }\n  return true;\n}\n\nbool UserDictManager::Synchronize(const std::string& dict_name) {\n  LOG(INFO) << \"synchronize user dict '\" << dict_name << \"'.\";\n  bool success = true;\n  fs::path sync_dir(deployer_->sync_dir);\n  if (!fs::exists(sync_dir)) {\n    boost::system::error_code ec;\n    if (!fs::create_directories(sync_dir, ec)) {\n      LOG(ERROR) << \"error creating directory '\" << sync_dir.string() << \"'.\";\n      return false;\n    }\n  }\n  fs::directory_iterator it(sync_dir);\n  fs::directory_iterator end;\n  const std::string snapshot_file(dict_name + \".userdb.kct.snapshot\");\n  for (; it != end; ++it) {\n    if (!fs::is_directory(it->path()))\n      continue;\n    fs::path file_path = it->path() \/ snapshot_file;\n    if (fs::exists(file_path)) {\n      LOG(INFO) << \"merging snapshot file: \" << file_path.string();\n      if (!Restore(file_path.string())) {\n        LOG(ERROR) << \"failed to merge snapshot file: \" << file_path.string();\n        success = false;\n      }\n    }\n  }\n  if (!Backup(dict_name)) {\n    LOG(ERROR) << \"error backing up user dict '\" << dict_name << \"'.\";\n    success = false;\n  }\n  return success;\n}\n\nbool UserDictManager::SynchronizeAll() {\n  UserDictList user_dicts;\n  GetUserDictList(&user_dicts);\n  LOG(INFO) << \"synchronizing \" << user_dicts.size() << \" user dicts.\";\n  BOOST_FOREACH(const std::string& dict_name, user_dicts) {\n    if (!Synchronize(dict_name))\n      return false;\n  }\n  return true;\n}\n\n}  \/\/ namespace rime\n<commit_msg>user_dict_manager(UserDictManager::Restore): fix miscalculation.<commit_after>\/\/\n\/\/ Copyleft 2012 RIME Developers\n\/\/ License: GPLv3\n\/\/\n\/\/ 2012-03-23 GONG Chen <chen.sst@gmail.com>\n\/\/\n#include <fstream>\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/filesystem.hpp>\n#include <boost\/foreach.hpp>\n#include <boost\/format.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/scope_exit.hpp>\n#include <rime\/common.h>\n#include <rime\/deployer.h>\n#include <rime\/algo\/dynamics.h>\n#include <rime\/dict\/user_db.h>\n#include <rime\/dict\/user_dictionary.h>\n#include <rime\/lever\/user_dict_manager.h>\n\nnamespace fs = boost::filesystem;\n\nnamespace rime {\n\nstatic bool IsUserDb(UserDb& db) {\n  std::string db_type;\n  return db.Fetch(\"\\x01\/db_type\", &db_type) && db_type == \"userdb\";\n}\n\nstatic const std::string GetDbName(UserDb& db) {\n  std::string name;\n  if (!db.Fetch(\"\\x01\/db_name\", &name))\n    return name;\n  boost::erase_last(name, \".kct\");\n  boost::erase_last(name, \".userdb\");\n  return name;\n}\n\nstatic const std::string GetUserId(UserDb& db) {\n  std::string user_id(\"unknown\");\n  db.Fetch(\"\\x01\/user_id\", &user_id);\n  return user_id;\n}\n\nstatic TickCount GetTickCount(UserDb& db) {\n  std::string tick;\n  if (db.Fetch(\"\\x01\/tick\", &tick)) {\n    try {\n      return boost::lexical_cast<TickCount>(tick);\n    }\n    catch (...) {\n    }\n  }\n  return 1;\n}\n\nUserDictManager::UserDictManager(Deployer* deployer)\n    : deployer_(deployer) {\n  if (deployer) {\n    path_ = deployer->user_data_dir;\n  }\n}\n\nvoid UserDictManager::GetUserDictList(UserDictList* user_dict_list) {\n  if (!user_dict_list) return;\n  user_dict_list->clear();\n  if (!fs::exists(path_) || !fs::is_directory(path_)) {\n    LOG(INFO) << \"directory '\" << path_.string() << \"' does not exist.\";\n    return;\n  }\n  fs::directory_iterator it(path_);\n  fs::directory_iterator end;\n  for (; it != end; ++it) {\n    std::string name(it->path().filename().string());\n    if (boost::ends_with(name, \".userdb.kct\")) {\n      boost::erase_last(name, \".userdb.kct\");\n      user_dict_list->push_back(name);\n    }\n  }\n}\n\nbool UserDictManager::Backup(const std::string& dict_name) {\n  UserDb db(dict_name);\n  if (!db.OpenReadOnly())\n    return false;\n  if (GetUserId(db) != deployer_->user_id) {\n    LOG(INFO) << \"user id not match; recreating metadata in \" << dict_name;\n    if (!db.Close() || !db.Open() || !db.CreateMetadata()) {\n      LOG(ERROR) << \"failed to recreate metadata in \" << dict_name;\n      return false;\n    }\n  }\n  return db.Backup();\n}\n\nbool UserDictManager::Restore(const std::string& snapshot_file) {\n  UserDb temp(\".temp\");\n  if (temp.Exists())\n    temp.Remove();\n  if (!temp.Open())\n    return false;\n  BOOST_SCOPE_EXIT( (&temp) )\n  {\n    temp.Close();\n    temp.Remove();\n  } BOOST_SCOPE_EXIT_END\n  if (!temp.Restore(snapshot_file))\n    return false;\n  if (!IsUserDb(temp))\n    return false;\n  std::string db_name(GetDbName(temp));\n  if (db_name.empty())\n    return false;\n  UserDb dest(db_name);\n  if (!dest.Open())\n    return false;\n  BOOST_SCOPE_EXIT( (&dest) )\n  {\n    dest.Close();\n  } BOOST_SCOPE_EXIT_END\n  LOG(INFO) << \"merging '\" << snapshot_file\n            << \"' from \" << GetUserId(temp)\n            << \" into userdb '\" << db_name << \"'...\";\n  TickCount tick_left = GetTickCount(dest);\n  TickCount tick_right = GetTickCount(temp);\n  TickCount tick_max = (std::max)(tick_left, tick_right);\n  shared_ptr<TreeDbAccessor> a = temp.Query(\"\");\n  std::string key, left, right;\n  int num_entries = 0;\n  while (a->GetNextRecord(&key, &right)) {\n    if (boost::starts_with(key, \"\\x01\/\"))  \/\/ skip metadata\n      continue;\n    size_t tab_pos = key.find('\\t');\n    if (tab_pos == 0 || tab_pos == std::string::npos)\n      continue;\n    \/\/ fix invalid keys created by a buggy version of Import()\n    if (key[tab_pos - 1] != ' ')\n      key.insert(tab_pos, 1, ' ');\n    int c = 0;\n    double d = 0.0;\n    TickCount t = 0;\n    UserDictionary::UnpackValues(right, &c, &d, &t);\n    if (t < tick_right)\n      d = algo::formula_d(0, (double)tick_right, d, (double)t);\n    if (dest.Fetch(key, &left)) {\n      int c0 = 0;\n      double d0 = 0.0;\n      TickCount t0 = 0;\n      UserDictionary::UnpackValues(left, &c0, &d0, &t0);\n      if (t0 < tick_left)\n        d0 = algo::formula_d(0, (double)tick_left, d0, (double)t0);\n      c = (std::max)(c, c0);\n      d = (std::max)(d, d0);\n    }\n    right = boost::str(boost::format(\"c=%1% d=%2% t=%3%\") %\n                       c % d % tick_max);\n    if (dest.Update(key, right))\n      ++num_entries;\n  }\n  if (num_entries > 0) {\n    try {\n      dest.Update(\"\\x01\/tick\", boost::lexical_cast<std::string>(tick_max));\n      dest.Update(\"\\x01\/user_id\", deployer_->user_id);\n    }\n    catch (...) {\n      LOG(WARNING) << \"failed to update tick count.\";\n    }\n  }\n  LOG(INFO) << \"total \" << num_entries << \" entries imported, tick = \"\n            << tick_max;\n  return true;\n}\n\nint UserDictManager::Export(const std::string& dict_name,\n                            const std::string& text_file) {\n  UserDb db(dict_name);\n  if (!db.OpenReadOnly())\n    return -1;\n  BOOST_SCOPE_EXIT( (&db) )\n  {\n    db.Close();\n  } BOOST_SCOPE_EXIT_END\n  if (!IsUserDb(db))\n    return -1;\n  std::ofstream fout(text_file.c_str());\n  fout << \"# Rime user dictionary export\" << std::endl\n       << \"# db_name: \" << GetDbName(db) << std::endl\n       << \"# user_id: \" << GetUserId(db) << std::endl\n       << \"# commits: \" << GetTickCount(db) << std::endl\n       << std::endl;\n  std::string key, value;\n  std::vector<std::string> row;\n  int num_entries = 0;\n  shared_ptr<UserDbAccessor> a = db.Query(\"\");\n  while (a->GetNextRecord(&key, &value)) {\n    if (boost::starts_with(key, \"\\x01\/\"))  \/\/ skip metadata\n      continue;\n    boost::algorithm::split(row, key,\n                            boost::algorithm::is_any_of(\"\\t\"));\n    if (row.size() != 2 ||\n        row[0].empty() || row[1].empty())\n      continue;\n    boost::algorithm::trim(row[0]);\n    int c = 0;\n    double d = 0.0;\n    TickCount t = 0;\n    UserDictionary::UnpackValues(value, &c, &d, &t);\n    if (c < 0)  \/\/ deleted entry\n      continue;\n    fout << row[1] << \"\\t\" << row[0] << \"\\t\" << c << std::endl;\n    ++num_entries;\n  }\n  fout.close();\n  return num_entries;\n}\n\nint UserDictManager::Import(const std::string& dict_name,\n                            const std::string& text_file) {\n  UserDb db(dict_name);\n  if (!db.Open())\n    return -1;\n  BOOST_SCOPE_EXIT( (&db) )\n  {\n    db.Close();\n  } BOOST_SCOPE_EXIT_END\n  if (!IsUserDb(db))\n    return -1;\n  std::ifstream fin(text_file.c_str());\n  std::string line, key, value;\n  int num_entries = 0;\n  while (getline(fin, line)) {\n    \/\/ skip empty lines and comments\n    if (line.empty() || line[0] == '#') continue;\n    \/\/ read a dict entry\n    std::vector<std::string> row;\n    boost::algorithm::split(row, line,\n                            boost::algorithm::is_any_of(\"\\t\"));\n    if (row.size() < 2 ||\n        row[0].empty() || row[1].empty()) {\n      LOG(WARNING) << \"invalid entry at #\" << num_entries << \".\";\n      continue;\n    }\n    boost::algorithm::trim(row[1]);\n    if (!row[1].empty()) {\n      std::vector<std::string> syllables;\n      boost::algorithm::split(syllables, row[1],\n                              boost::algorithm::is_any_of(\" \"),\n                              boost::algorithm::token_compress_on);\n      row[1] = boost::algorithm::join(syllables, \" \");\n    }\n    key = row[1] + \" \\t\" + row[0];\n    int commits = 0;\n    if (row.size() >= 3 && !row[2].empty()) {\n      try {\n        commits = boost::lexical_cast<int>(row[2]);\n      }\n      catch (...) {\n      }\n    }\n    int c = 0;\n    double d = 0.0;\n    TickCount t = 0;\n    if (db.Fetch(key, &value))\n      UserDictionary::UnpackValues(value, &c, &d, &t);\n    if (commits > 0)\n      c = (std::max)(commits, c);\n    else if (commits < 0)  \/\/ mark as deleted\n      c = commits;\n    value = boost::str(boost::format(\"c=%1% d=%2% t=%3%\") %\n                       c % d % t);\n    if (db.Update(key, value))\n      ++num_entries;\n  }\n  fin.close();\n  return num_entries;\n}\n\nbool UserDictManager::UpgradeUserDict(const std::string& dict_name) {\n  UserDb db(dict_name);\n  if (!db.OpenRepaired())\n    return false;\n  if (!IsUserDb(db))\n    return false;\n  std::string db_creator_version;\n  db.Fetch(\"\\x01\/rime_version\", &db_creator_version);\n  if (CompareVersionString(db_creator_version, \"0.9.5\") <= 0) {\n    \/\/ fix invalid keys created by a buggy version of Import()\n    LOG(INFO) << \"upgrading user dict '\" << dict_name << \"'.\";\n    fs::path snapshot_file(deployer_->user_data_sync_dir());\n    snapshot_file \/= (db.name() + \".snapshot\");\n    return db.Backup() &&\n        db.Close() &&\n        db.Remove() &&\n        Restore(snapshot_file.string());\n  }\n  return true;\n}\n\nbool UserDictManager::Synchronize(const std::string& dict_name) {\n  LOG(INFO) << \"synchronize user dict '\" << dict_name << \"'.\";\n  bool success = true;\n  fs::path sync_dir(deployer_->sync_dir);\n  if (!fs::exists(sync_dir)) {\n    boost::system::error_code ec;\n    if (!fs::create_directories(sync_dir, ec)) {\n      LOG(ERROR) << \"error creating directory '\" << sync_dir.string() << \"'.\";\n      return false;\n    }\n  }\n  fs::directory_iterator it(sync_dir);\n  fs::directory_iterator end;\n  const std::string snapshot_file(dict_name + \".userdb.kct.snapshot\");\n  for (; it != end; ++it) {\n    if (!fs::is_directory(it->path()))\n      continue;\n    fs::path file_path = it->path() \/ snapshot_file;\n    if (fs::exists(file_path)) {\n      LOG(INFO) << \"merging snapshot file: \" << file_path.string();\n      if (!Restore(file_path.string())) {\n        LOG(ERROR) << \"failed to merge snapshot file: \" << file_path.string();\n        success = false;\n      }\n    }\n  }\n  if (!Backup(dict_name)) {\n    LOG(ERROR) << \"error backing up user dict '\" << dict_name << \"'.\";\n    success = false;\n  }\n  return success;\n}\n\nbool UserDictManager::SynchronizeAll() {\n  UserDictList user_dicts;\n  GetUserDictList(&user_dicts);\n  LOG(INFO) << \"synchronizing \" << user_dicts.size() << \" user dicts.\";\n  BOOST_FOREACH(const std::string& dict_name, user_dicts) {\n    if (!Synchronize(dict_name))\n      return false;\n  }\n  return true;\n}\n\n}  \/\/ namespace rime\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n#include <functional>\n#include <vector>\n#include <type_traits>\n\n#include <SDL.h>\n#undef main\n\n#include \"keycode.hpp\"\n\nnamespace ORCore\n{\n\n    enum EventType\n    {\n        EventNone    = 0,\n        Quit         = 1 << 0,\n        MouseMove    = 1 << 1,\n        WindowClose  = 1 << 2,\n        WindowSized  = 1 << 3,\n        KeyUp        = 1 << 4,\n        KeyDown      = 1 << 5,\n        EventAll = Quit | MouseMove | WindowClose | WindowSized | KeyUp | KeyDown\n    };\n\n\n    \/\/ enable the use of bitwise operators on flags\n\n    struct MouseMoveEvent\n    {\n        int x;\n        int y;\n    };\n\n    struct WindowSizeEvent\n    {\n\n        Uint32 id;\n        int width;\n        int height;\n    };\n\n\n    struct WindowCloseEvent\n    {\n        Uint32 id;\n    };\n\n    struct KeyUpEvent\n    {\n        KeyCode key;\n        ModFlag mod;\n\n    };\n\n    struct KeyDownEvent\n    {\n        KeyCode key;\n        ModFlag mod;\n\n    };\n\n    struct QuitEvent\n    {\n        bool quit;\n\n    };\n\n    \/\/ This is functionally works similar to boost::any but customized to the event system.\n    \/\/ Basically the idea is to use polymorphism and templates to store any type of data\n    \/\/ in the same object. We use this idea to deliver many different types of event structs\n    \/\/ within a single object.\n    \/\/ Also since this has a lot of template stuff in it, I decided to put the entire implementation\n    \/\/ in the header.\n    struct Event\n    {\n        EventType type;\n        float time;\n        template<class Type> friend\n        Type event_cast(const Event&);\n\n        Event(Event&& other)\n        : ptr(std::move(other.ptr))\n        {\n            time = other.time;\n            type = other.type;\n            other.time = 0.0;\n            other.type = EventNone;\n        }\n\n        Event(const Event& other) {\n            if (other.ptr) {\n                ptr = other.ptr->clone();\n            }\n            time = other.time;\n            type = other.type;\n        }\n\n        Event& operator=(Event&& other) {\n            ptr = std::move(other.ptr);\n            time = other.time;\n            type = other.type;\n            other.time = 0.0;\n            other.type = EventNone;\n            return *this;\n        }\n\n        Event& operator=(const Event& other) {\n            ptr =  std::move(Event(other).ptr);\n            return *this;\n        }\n\n        Event()\n        : type(EventNone), time(0.0), ptr(nullptr)\n        {}\n\n        template<typename T>\n        Event(EventType eType, float eTime, const T& event)\n        : type(eType), time(eTime), ptr(new Concrete<T>(event))\n        {\n        }\n    private:\n        struct Placeholder\n        {\n            virtual ~Placeholder() {};\n            virtual std::unique_ptr<Placeholder> clone() = 0;\n        };\n\n        template<typename T>\n        struct Concrete : public Placeholder\n        {\n            Concrete(T&& x)\n            : value(std::move(x))\n            {}\n\n            Concrete(const T& x)\n            : value(x)\n            {}\n\n\n            virtual std::unique_ptr<Placeholder> clone()\n            {\n                return std::make_unique<Concrete>(value);\n            }\n\n            T value;\n        };\n        std::unique_ptr<Placeholder> ptr;\n    };\n\n    \/\/ Used to get the event data out of the event.\n    template<class Type>\n    Type event_cast(const Event& val) {\n        return static_cast<Event::Concrete<Type>*>(val.ptr.get())->value;\n    }\n\n    struct Listener\n    {\n        int id;\n        EventType mask;\n        std::function<bool (const Event&)> handler;\n        \/\/ more to come\n    };\n\n    class EventManager\n    {\n    public:\n        void add_listener(Listener &listener);\n        void remove_listener(Listener &listener);\n        void broadcast_event(const Event &event);\n    private:\n        std::vector<Listener*> m_listeners;\n    };\n\n    class EventPumpSDL2\n    {\n    public:\n        EventPumpSDL2(EventManager *events);\n        void process();\n    private:\n        EventManager *m_events;\n    };\n}<commit_msg>Change name so all EventType's are consistant with their struct.<commit_after>#pragma once\n#include <functional>\n#include <vector>\n#include <type_traits>\n\n#include <SDL.h>\n#undef main\n\n#include \"keycode.hpp\"\n\nnamespace ORCore\n{\n\n    enum EventType\n    {\n        EventNone    = 0,\n        Quit         = 1 << 0,\n        MouseMove    = 1 << 1,\n        WindowClose  = 1 << 2,\n        WindowSize  = 1 << 3,\n        KeyUp        = 1 << 4,\n        KeyDown      = 1 << 5,\n        EventAll = Quit | MouseMove | WindowClose | WindowSize | KeyUp | KeyDown\n    };\n\n\n    \/\/ enable the use of bitwise operators on flags\n\n    struct MouseMoveEvent\n    {\n        int x;\n        int y;\n    };\n\n    struct WindowSizeEvent\n    {\n\n        Uint32 id;\n        int width;\n        int height;\n    };\n\n\n    struct WindowCloseEvent\n    {\n        Uint32 id;\n    };\n\n    struct KeyUpEvent\n    {\n        KeyCode key;\n        ModFlag mod;\n\n    };\n\n    struct KeyDownEvent\n    {\n        KeyCode key;\n        ModFlag mod;\n\n    };\n\n    struct QuitEvent\n    {\n        bool quit;\n\n    };\n\n    \/\/ This is functionally works similar to boost::any but customized to the event system.\n    \/\/ Basically the idea is to use polymorphism and templates to store any type of data\n    \/\/ in the same object. We use this idea to deliver many different types of event structs\n    \/\/ within a single object.\n    \/\/ Also since this has a lot of template stuff in it, I decided to put the entire implementation\n    \/\/ in the header.\n    struct Event\n    {\n        EventType type;\n        float time;\n        template<class Type> friend\n        Type event_cast(const Event&);\n\n        Event(Event&& other)\n        : ptr(std::move(other.ptr))\n        {\n            time = other.time;\n            type = other.type;\n            other.time = 0.0;\n            other.type = EventNone;\n        }\n\n        Event(const Event& other) {\n            if (other.ptr) {\n                ptr = other.ptr->clone();\n            }\n            time = other.time;\n            type = other.type;\n        }\n\n        Event& operator=(Event&& other) {\n            ptr = std::move(other.ptr);\n            time = other.time;\n            type = other.type;\n            other.time = 0.0;\n            other.type = EventNone;\n            return *this;\n        }\n\n        Event& operator=(const Event& other) {\n            ptr =  std::move(Event(other).ptr);\n            return *this;\n        }\n\n        Event()\n        : type(EventNone), time(0.0), ptr(nullptr)\n        {}\n\n        template<typename T>\n        Event(EventType eType, float eTime, const T& event)\n        : type(eType), time(eTime), ptr(new Concrete<T>(event))\n        {\n        }\n    private:\n        struct Placeholder\n        {\n            virtual ~Placeholder() {};\n            virtual std::unique_ptr<Placeholder> clone() = 0;\n        };\n\n        template<typename T>\n        struct Concrete : public Placeholder\n        {\n            Concrete(T&& x)\n            : value(std::move(x))\n            {}\n\n            Concrete(const T& x)\n            : value(x)\n            {}\n\n\n            virtual std::unique_ptr<Placeholder> clone()\n            {\n                return std::make_unique<Concrete>(value);\n            }\n\n            T value;\n        };\n        std::unique_ptr<Placeholder> ptr;\n    };\n\n    \/\/ Used to get the event data out of the event.\n    template<class Type>\n    Type event_cast(const Event& val) {\n        return static_cast<Event::Concrete<Type>*>(val.ptr.get())->value;\n    }\n\n    struct Listener\n    {\n        int id;\n        EventType mask;\n        std::function<bool (const Event&)> handler;\n        \/\/ more to come\n    };\n\n    class EventManager\n    {\n    public:\n        void add_listener(Listener &listener);\n        void remove_listener(Listener &listener);\n        void broadcast_event(const Event &event);\n    private:\n        std::vector<Listener*> m_listeners;\n    };\n\n    class EventPumpSDL2\n    {\n    public:\n        EventPumpSDL2(EventManager *events);\n        void process();\n    private:\n        EventManager *m_events;\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) 2009 Mark Borgerding mark a borgerding net\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 <unsupported\/Eigen\/FFT>\n\ntemplate <typename T> \nstd::complex<T> RandomCpx() { return std::complex<T>( (T)(rand()\/(T)RAND_MAX - .5), (T)(rand()\/(T)RAND_MAX - .5) ); }\n\nusing namespace std;\nusing namespace Eigen;\n\nfloat norm(float x) {return x*x;}\ndouble norm(double x) {return x*x;}\nlong double norm(long double x) {return x*x;}\n\ntemplate < typename T>\ncomplex<long double>  promote(complex<T> x) { return complex<long double>(x.real(),x.imag()); }\n\ncomplex<long double>  promote(float x) { return complex<long double>( x); }\ncomplex<long double>  promote(double x) { return complex<long double>( x); }\ncomplex<long double>  promote(long double x) { return complex<long double>( x); }\n    \n\n    template <typename VT1,typename VT2>\n    long double fft_rmse( const VT1 & fftbuf,const VT2 & timebuf)\n    {\n        long double totalpower=0;\n        long double difpower=0;\n        long double pi = acos((long double)-1 );\n        for (size_t k0=0;k0<(size_t)fftbuf.size();++k0) {\n            complex<long double> acc = 0;\n            long double phinc = -2.*k0* pi \/ timebuf.size();\n            for (size_t k1=0;k1<(size_t)timebuf.size();++k1) {\n                acc +=  promote( timebuf[k1] ) * exp( complex<long double>(0,k1*phinc) );\n            }\n            totalpower += norm(acc);\n            complex<long double> x = promote(fftbuf[k0]); \n            complex<long double> dif = acc - x;\n            difpower += norm(dif);\n            \/\/cerr << k0 << \"\\t\" << acc << \"\\t\" <<  x << \"\\t\" << sqrt(norm(dif)) << endl;\n        }\n        cerr << \"rmse:\" << sqrt(difpower\/totalpower) << endl;\n        return sqrt(difpower\/totalpower);\n    }\n\n    template <typename VT1,typename VT2>\n    long double dif_rmse( const VT1 buf1,const VT2 buf2)\n    {\n        long double totalpower=0;\n        long double difpower=0;\n        size_t n = (min)( buf1.size(),buf2.size() );\n        for (size_t k=0;k<n;++k) {\n            totalpower += (norm( buf1[k] ) + norm(buf2[k]) )\/2.;\n            difpower += norm(buf1[k] - buf2[k]);\n        }\n        return sqrt(difpower\/totalpower);\n    }\n\nenum { StdVectorContainer, EigenVectorContainer };\n\ntemplate<int Container, typename Scalar> struct VectorType;\n\ntemplate<typename Scalar> struct VectorType<StdVectorContainer,Scalar>\n{\n  typedef vector<Scalar> type;\n};\n\ntemplate<typename Scalar> struct VectorType<EigenVectorContainer,Scalar>\n{\n  typedef Matrix<Scalar,Dynamic,1> type;\n};\n\ntemplate <int Container, typename T>\nvoid test_scalar_generic(int nfft)\n{\n    typedef typename FFT<T>::Complex Complex;\n    typedef typename FFT<T>::Scalar Scalar;\n    typedef typename VectorType<Container,Scalar>::type ScalarVector;\n    typedef typename VectorType<Container,Complex>::type ComplexVector;\n\n    FFT<T> fft;\n    ScalarVector tbuf(nfft);\n    ComplexVector freqBuf;\n    for (int k=0;k<nfft;++k)\n        tbuf[k]= (T)( rand()\/(double)RAND_MAX - .5);\n\n    \/\/ make sure it DOESN'T give the right full spectrum answer\n    \/\/ if we've asked for half-spectrum\n    fft.SetFlag(fft.HalfSpectrum );\n    fft.fwd( freqBuf,tbuf);\n    VERIFY((size_t)freqBuf.size() == (size_t)( (nfft>>1)+1) );\n    VERIFY( fft_rmse(freqBuf,tbuf) < test_precision<T>()  );\/\/ gross check\n\n    fft.ClearFlag(fft.HalfSpectrum );\n    fft.fwd( freqBuf,tbuf);\n    VERIFY( (size_t)freqBuf.size() == (size_t)nfft);\n    VERIFY( fft_rmse(freqBuf,tbuf) < test_precision<T>()  );\/\/ gross check\n\n    if (nfft&1)\n        return; \/\/ odd FFTs get the wrong size inverse FFT\n\n    ScalarVector tbuf2;\n    fft.inv( tbuf2 , freqBuf);\n    VERIFY( dif_rmse(tbuf,tbuf2) < test_precision<T>()  );\/\/ gross check\n\n\n    \/\/ verify that the Unscaled flag takes effect\n    ScalarVector tbuf3;\n    fft.SetFlag(fft.Unscaled);\n\n    fft.inv( tbuf3 , freqBuf);\n\n    for (int k=0;k<nfft;++k)\n        tbuf3[k] *= T(1.\/nfft);\n\n\n    \/\/for (size_t i=0;i<(size_t) tbuf.size();++i)\n    \/\/    cout << \"freqBuf=\" << freqBuf[i] << \" in2=\" << tbuf3[i] << \" -  in=\" << tbuf[i] << \" => \" << (tbuf3[i] - tbuf[i] ) <<  endl;\n\n    VERIFY( dif_rmse(tbuf,tbuf3) < test_precision<T>()  );\/\/ gross check\n\n    \/\/ verify that ClearFlag works\n    fft.ClearFlag(fft.Unscaled);\n    fft.inv( tbuf2 , freqBuf);\n    VERIFY( dif_rmse(tbuf,tbuf2) < test_precision<T>()  );\/\/ gross check\n}\n\ntemplate <typename T>\nvoid test_scalar(int nfft)\n{\n  test_scalar_generic<StdVectorContainer,T>(nfft);\n  \/\/test_scalar_generic<EigenVectorContainer,T>(nfft);\n}\n\n\ntemplate <int Container, typename T>\nvoid test_complex_generic(int nfft)\n{\n    typedef typename FFT<T>::Complex Complex;\n    typedef typename VectorType<Container,Complex>::type ComplexVector;\n\n    FFT<T> fft;\n\n    ComplexVector inbuf(nfft);\n    ComplexVector outbuf;\n    ComplexVector buf3;\n    for (int k=0;k<nfft;++k)\n        inbuf[k]= Complex( (T)(rand()\/(double)RAND_MAX - .5), (T)(rand()\/(double)RAND_MAX - .5) );\n    fft.fwd( outbuf , inbuf);\n\n    VERIFY( fft_rmse(outbuf,inbuf) < test_precision<T>()  );\/\/ gross check\n    fft.inv( buf3 , outbuf);\n\n    VERIFY( dif_rmse(inbuf,buf3) < test_precision<T>()  );\/\/ gross check\n\n    \/\/ verify that the Unscaled flag takes effect\n    ComplexVector buf4;\n    fft.SetFlag(fft.Unscaled);\n    fft.inv( buf4 , outbuf);\n    for (int k=0;k<nfft;++k)\n        buf4[k] *= T(1.\/nfft);\n    VERIFY( dif_rmse(inbuf,buf4) < test_precision<T>()  );\/\/ gross check\n\n    \/\/ verify that ClearFlag works\n    fft.ClearFlag(fft.Unscaled);\n    fft.inv( buf3 , outbuf);\n    VERIFY( dif_rmse(inbuf,buf3) < test_precision<T>()  );\/\/ gross check\n}\n\ntemplate <typename T>\nvoid test_complex(int nfft)\n{\n  test_complex_generic<StdVectorContainer,T>(nfft);\n  test_complex_generic<EigenVectorContainer,T>(nfft);\n}\n\/*\ntemplate <typename T,int nrows,int ncols>\nvoid test_complex2d()\n{\n    typedef typename Eigen::FFT<T>::Complex Complex;\n    FFT<T> fft;\n    Eigen::Matrix<Complex,nrows,ncols> src,src2,dst,dst2;\n\n    src = Eigen::Matrix<Complex,nrows,ncols>::Random();\n    \/\/src =  Eigen::Matrix<Complex,nrows,ncols>::Identity();\n\n    for (int k=0;k<ncols;k++) {\n        Eigen::Matrix<Complex,nrows,1> tmpOut;\n        fft.fwd( tmpOut,src.col(k) );\n        dst2.col(k) = tmpOut;\n    }\n\n    for (int k=0;k<nrows;k++) {\n        Eigen::Matrix<Complex,1,ncols> tmpOut;\n        fft.fwd( tmpOut,  dst2.row(k) );\n        dst2.row(k) = tmpOut;\n    }\n\n    fft.fwd2(dst.data(),src.data(),ncols,nrows);\n    fft.inv2(src2.data(),dst.data(),ncols,nrows);\n    VERIFY( (src-src2).norm() < test_precision<T>() );\n    VERIFY( (dst-dst2).norm() < test_precision<T>() );\n}\n*\/\n\n\nvoid test_return_by_value(int len)\n{\n    VectorXf in;\n    VectorXf in1;\n    in.setRandom( len );\n    VectorXcf out1,out2;\n    FFT<float> fft;\n\n    fft.SetFlag(fft.HalfSpectrum );\n\n    fft.fwd(out1,in);\n    out2 = fft.fwd(in);\n    VERIFY( (out1-out2).norm() < test_precision<float>() );\n    in1 = fft.inv(out1);\n    VERIFY( (in1-in).norm() < test_precision<float>() );\n}\n\nvoid test_FFTW()\n{\n  CALL_SUBTEST( test_return_by_value(32) );\n  \/\/CALL_SUBTEST( ( test_complex2d<float,4,8> () ) ); CALL_SUBTEST( ( test_complex2d<double,4,8> () ) );\n  \/\/CALL_SUBTEST( ( test_complex2d<long double,4,8> () ) );\n  CALL_SUBTEST( test_complex<float>(32) ); CALL_SUBTEST( test_complex<double>(32) ); \n  CALL_SUBTEST( test_complex<float>(256) ); CALL_SUBTEST( test_complex<double>(256) ); \n  CALL_SUBTEST( test_complex<float>(3*8) ); CALL_SUBTEST( test_complex<double>(3*8) ); \n  CALL_SUBTEST( test_complex<float>(5*32) ); CALL_SUBTEST( test_complex<double>(5*32) ); \n  CALL_SUBTEST( test_complex<float>(2*3*4) ); CALL_SUBTEST( test_complex<double>(2*3*4) ); \n  CALL_SUBTEST( test_complex<float>(2*3*4*5) ); CALL_SUBTEST( test_complex<double>(2*3*4*5) ); \n  CALL_SUBTEST( test_complex<float>(2*3*4*5*7) ); CALL_SUBTEST( test_complex<double>(2*3*4*5*7) ); \n\n  CALL_SUBTEST( test_scalar<float>(32) ); CALL_SUBTEST( test_scalar<double>(32) ); \n  CALL_SUBTEST( test_scalar<float>(45) ); CALL_SUBTEST( test_scalar<double>(45) ); \n  CALL_SUBTEST( test_scalar<float>(50) ); CALL_SUBTEST( test_scalar<double>(50) ); \n  CALL_SUBTEST( test_scalar<float>(256) ); CALL_SUBTEST( test_scalar<double>(256) ); \n  CALL_SUBTEST( test_scalar<float>(2*3*4*5*7) ); CALL_SUBTEST( test_scalar<double>(2*3*4*5*7) ); \n  \n  #ifdef EIGEN_HAS_FFTWL\n  CALL_SUBTEST( test_complex<long double>(32) );\n  CALL_SUBTEST( test_complex<long double>(256) );\n  CALL_SUBTEST( test_complex<long double>(3*8) );\n  CALL_SUBTEST( test_complex<long double>(5*32) );\n  CALL_SUBTEST( test_complex<long double>(2*3*4) );\n  CALL_SUBTEST( test_complex<long double>(2*3*4*5) );\n  CALL_SUBTEST( test_complex<long double>(2*3*4*5*7) );\n  \n  CALL_SUBTEST( test_scalar<long double>(32) );\n  CALL_SUBTEST( test_scalar<long double>(45) );\n  CALL_SUBTEST( test_scalar<long double>(50) );\n  CALL_SUBTEST( test_scalar<long double>(256) );\n  CALL_SUBTEST( test_scalar<long double>(2*3*4*5*7) );\n  #endif\n}\n<commit_msg>Fix FFTW unit test with clang<commit_after>\/\/ This file is part of Eigen, a lightweight C++ template library\n\/\/ for linear algebra.\n\/\/\n\/\/ Copyright (C) 2009 Mark Borgerding mark a borgerding net\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 <unsupported\/Eigen\/FFT>\n\ntemplate <typename T> \nstd::complex<T> RandomCpx() { return std::complex<T>( (T)(rand()\/(T)RAND_MAX - .5), (T)(rand()\/(T)RAND_MAX - .5) ); }\n\nusing namespace std;\nusing namespace Eigen;\n\n\ntemplate < typename T>\ncomplex<long double>  promote(complex<T> x) { return complex<long double>(x.real(),x.imag()); }\n\ncomplex<long double>  promote(float x) { return complex<long double>( x); }\ncomplex<long double>  promote(double x) { return complex<long double>( x); }\ncomplex<long double>  promote(long double x) { return complex<long double>( x); }\n    \n\n    template <typename VT1,typename VT2>\n    long double fft_rmse( const VT1 & fftbuf,const VT2 & timebuf)\n    {\n        long double totalpower=0;\n        long double difpower=0;\n        long double pi = acos((long double)-1 );\n        for (size_t k0=0;k0<(size_t)fftbuf.size();++k0) {\n            complex<long double> acc = 0;\n            long double phinc = -2.*k0* pi \/ timebuf.size();\n            for (size_t k1=0;k1<(size_t)timebuf.size();++k1) {\n                acc +=  promote( timebuf[k1] ) * exp( complex<long double>(0,k1*phinc) );\n            }\n            totalpower += numext::abs2(acc);\n            complex<long double> x = promote(fftbuf[k0]); \n            complex<long double> dif = acc - x;\n            difpower += numext::abs2(dif);\n            \/\/cerr << k0 << \"\\t\" << acc << \"\\t\" <<  x << \"\\t\" << sqrt(numext::abs2(dif)) << endl;\n        }\n        cerr << \"rmse:\" << sqrt(difpower\/totalpower) << endl;\n        return sqrt(difpower\/totalpower);\n    }\n\n    template <typename VT1,typename VT2>\n    long double dif_rmse( const VT1 buf1,const VT2 buf2)\n    {\n        long double totalpower=0;\n        long double difpower=0;\n        size_t n = (min)( buf1.size(),buf2.size() );\n        for (size_t k=0;k<n;++k) {\n            totalpower += (numext::abs2( buf1[k] ) + numext::abs2(buf2[k]) )\/2.;\n            difpower += numext::abs2(buf1[k] - buf2[k]);\n        }\n        return sqrt(difpower\/totalpower);\n    }\n\nenum { StdVectorContainer, EigenVectorContainer };\n\ntemplate<int Container, typename Scalar> struct VectorType;\n\ntemplate<typename Scalar> struct VectorType<StdVectorContainer,Scalar>\n{\n  typedef vector<Scalar> type;\n};\n\ntemplate<typename Scalar> struct VectorType<EigenVectorContainer,Scalar>\n{\n  typedef Matrix<Scalar,Dynamic,1> type;\n};\n\ntemplate <int Container, typename T>\nvoid test_scalar_generic(int nfft)\n{\n    typedef typename FFT<T>::Complex Complex;\n    typedef typename FFT<T>::Scalar Scalar;\n    typedef typename VectorType<Container,Scalar>::type ScalarVector;\n    typedef typename VectorType<Container,Complex>::type ComplexVector;\n\n    FFT<T> fft;\n    ScalarVector tbuf(nfft);\n    ComplexVector freqBuf;\n    for (int k=0;k<nfft;++k)\n        tbuf[k]= (T)( rand()\/(double)RAND_MAX - .5);\n\n    \/\/ make sure it DOESN'T give the right full spectrum answer\n    \/\/ if we've asked for half-spectrum\n    fft.SetFlag(fft.HalfSpectrum );\n    fft.fwd( freqBuf,tbuf);\n    VERIFY((size_t)freqBuf.size() == (size_t)( (nfft>>1)+1) );\n    VERIFY( fft_rmse(freqBuf,tbuf) < test_precision<T>()  );\/\/ gross check\n\n    fft.ClearFlag(fft.HalfSpectrum );\n    fft.fwd( freqBuf,tbuf);\n    VERIFY( (size_t)freqBuf.size() == (size_t)nfft);\n    VERIFY( fft_rmse(freqBuf,tbuf) < test_precision<T>()  );\/\/ gross check\n\n    if (nfft&1)\n        return; \/\/ odd FFTs get the wrong size inverse FFT\n\n    ScalarVector tbuf2;\n    fft.inv( tbuf2 , freqBuf);\n    VERIFY( dif_rmse(tbuf,tbuf2) < test_precision<T>()  );\/\/ gross check\n\n\n    \/\/ verify that the Unscaled flag takes effect\n    ScalarVector tbuf3;\n    fft.SetFlag(fft.Unscaled);\n\n    fft.inv( tbuf3 , freqBuf);\n\n    for (int k=0;k<nfft;++k)\n        tbuf3[k] *= T(1.\/nfft);\n\n\n    \/\/for (size_t i=0;i<(size_t) tbuf.size();++i)\n    \/\/    cout << \"freqBuf=\" << freqBuf[i] << \" in2=\" << tbuf3[i] << \" -  in=\" << tbuf[i] << \" => \" << (tbuf3[i] - tbuf[i] ) <<  endl;\n\n    VERIFY( dif_rmse(tbuf,tbuf3) < test_precision<T>()  );\/\/ gross check\n\n    \/\/ verify that ClearFlag works\n    fft.ClearFlag(fft.Unscaled);\n    fft.inv( tbuf2 , freqBuf);\n    VERIFY( dif_rmse(tbuf,tbuf2) < test_precision<T>()  );\/\/ gross check\n}\n\ntemplate <typename T>\nvoid test_scalar(int nfft)\n{\n  test_scalar_generic<StdVectorContainer,T>(nfft);\n  \/\/test_scalar_generic<EigenVectorContainer,T>(nfft);\n}\n\n\ntemplate <int Container, typename T>\nvoid test_complex_generic(int nfft)\n{\n    typedef typename FFT<T>::Complex Complex;\n    typedef typename VectorType<Container,Complex>::type ComplexVector;\n\n    FFT<T> fft;\n\n    ComplexVector inbuf(nfft);\n    ComplexVector outbuf;\n    ComplexVector buf3;\n    for (int k=0;k<nfft;++k)\n        inbuf[k]= Complex( (T)(rand()\/(double)RAND_MAX - .5), (T)(rand()\/(double)RAND_MAX - .5) );\n    fft.fwd( outbuf , inbuf);\n\n    VERIFY( fft_rmse(outbuf,inbuf) < test_precision<T>()  );\/\/ gross check\n    fft.inv( buf3 , outbuf);\n\n    VERIFY( dif_rmse(inbuf,buf3) < test_precision<T>()  );\/\/ gross check\n\n    \/\/ verify that the Unscaled flag takes effect\n    ComplexVector buf4;\n    fft.SetFlag(fft.Unscaled);\n    fft.inv( buf4 , outbuf);\n    for (int k=0;k<nfft;++k)\n        buf4[k] *= T(1.\/nfft);\n    VERIFY( dif_rmse(inbuf,buf4) < test_precision<T>()  );\/\/ gross check\n\n    \/\/ verify that ClearFlag works\n    fft.ClearFlag(fft.Unscaled);\n    fft.inv( buf3 , outbuf);\n    VERIFY( dif_rmse(inbuf,buf3) < test_precision<T>()  );\/\/ gross check\n}\n\ntemplate <typename T>\nvoid test_complex(int nfft)\n{\n  test_complex_generic<StdVectorContainer,T>(nfft);\n  test_complex_generic<EigenVectorContainer,T>(nfft);\n}\n\/*\ntemplate <typename T,int nrows,int ncols>\nvoid test_complex2d()\n{\n    typedef typename Eigen::FFT<T>::Complex Complex;\n    FFT<T> fft;\n    Eigen::Matrix<Complex,nrows,ncols> src,src2,dst,dst2;\n\n    src = Eigen::Matrix<Complex,nrows,ncols>::Random();\n    \/\/src =  Eigen::Matrix<Complex,nrows,ncols>::Identity();\n\n    for (int k=0;k<ncols;k++) {\n        Eigen::Matrix<Complex,nrows,1> tmpOut;\n        fft.fwd( tmpOut,src.col(k) );\n        dst2.col(k) = tmpOut;\n    }\n\n    for (int k=0;k<nrows;k++) {\n        Eigen::Matrix<Complex,1,ncols> tmpOut;\n        fft.fwd( tmpOut,  dst2.row(k) );\n        dst2.row(k) = tmpOut;\n    }\n\n    fft.fwd2(dst.data(),src.data(),ncols,nrows);\n    fft.inv2(src2.data(),dst.data(),ncols,nrows);\n    VERIFY( (src-src2).norm() < test_precision<T>() );\n    VERIFY( (dst-dst2).norm() < test_precision<T>() );\n}\n*\/\n\n\nvoid test_return_by_value(int len)\n{\n    VectorXf in;\n    VectorXf in1;\n    in.setRandom( len );\n    VectorXcf out1,out2;\n    FFT<float> fft;\n\n    fft.SetFlag(fft.HalfSpectrum );\n\n    fft.fwd(out1,in);\n    out2 = fft.fwd(in);\n    VERIFY( (out1-out2).norm() < test_precision<float>() );\n    in1 = fft.inv(out1);\n    VERIFY( (in1-in).norm() < test_precision<float>() );\n}\n\nvoid test_FFTW()\n{\n  CALL_SUBTEST( test_return_by_value(32) );\n  \/\/CALL_SUBTEST( ( test_complex2d<float,4,8> () ) ); CALL_SUBTEST( ( test_complex2d<double,4,8> () ) );\n  \/\/CALL_SUBTEST( ( test_complex2d<long double,4,8> () ) );\n  CALL_SUBTEST( test_complex<float>(32) ); CALL_SUBTEST( test_complex<double>(32) ); \n  CALL_SUBTEST( test_complex<float>(256) ); CALL_SUBTEST( test_complex<double>(256) ); \n  CALL_SUBTEST( test_complex<float>(3*8) ); CALL_SUBTEST( test_complex<double>(3*8) ); \n  CALL_SUBTEST( test_complex<float>(5*32) ); CALL_SUBTEST( test_complex<double>(5*32) ); \n  CALL_SUBTEST( test_complex<float>(2*3*4) ); CALL_SUBTEST( test_complex<double>(2*3*4) ); \n  CALL_SUBTEST( test_complex<float>(2*3*4*5) ); CALL_SUBTEST( test_complex<double>(2*3*4*5) ); \n  CALL_SUBTEST( test_complex<float>(2*3*4*5*7) ); CALL_SUBTEST( test_complex<double>(2*3*4*5*7) ); \n\n  CALL_SUBTEST( test_scalar<float>(32) ); CALL_SUBTEST( test_scalar<double>(32) ); \n  CALL_SUBTEST( test_scalar<float>(45) ); CALL_SUBTEST( test_scalar<double>(45) ); \n  CALL_SUBTEST( test_scalar<float>(50) ); CALL_SUBTEST( test_scalar<double>(50) ); \n  CALL_SUBTEST( test_scalar<float>(256) ); CALL_SUBTEST( test_scalar<double>(256) ); \n  CALL_SUBTEST( test_scalar<float>(2*3*4*5*7) ); CALL_SUBTEST( test_scalar<double>(2*3*4*5*7) ); \n  \n  #ifdef EIGEN_HAS_FFTWL\n  CALL_SUBTEST( test_complex<long double>(32) );\n  CALL_SUBTEST( test_complex<long double>(256) );\n  CALL_SUBTEST( test_complex<long double>(3*8) );\n  CALL_SUBTEST( test_complex<long double>(5*32) );\n  CALL_SUBTEST( test_complex<long double>(2*3*4) );\n  CALL_SUBTEST( test_complex<long double>(2*3*4*5) );\n  CALL_SUBTEST( test_complex<long double>(2*3*4*5*7) );\n  \n  CALL_SUBTEST( test_scalar<long double>(32) );\n  CALL_SUBTEST( test_scalar<long double>(45) );\n  CALL_SUBTEST( test_scalar<long double>(50) );\n  CALL_SUBTEST( test_scalar<long double>(256) );\n  CALL_SUBTEST( test_scalar<long double>(2*3*4*5*7) );\n  #endif\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <mapnik\/map.hpp>\n#include <mapnik\/load_map.hpp>\n#include <mapnik\/agg_renderer.hpp>\n#include <mapnik\/version.hpp>\n#include <mapnik\/debug.hpp>\n#include <mapnik\/image_util.hpp>\n#include <mapnik\/graphics.hpp>\n#include <mapnik\/unicode.hpp>\n#include <mapnik\/datasource_cache.hpp>\n#include <mapnik\/font_engine_freetype.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\/tokenizer.hpp>\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/program_options.hpp>\n#pragma GCC diagnostic pop\n\n#include <string>\n\nint main (int argc,char** argv)\n{\n    namespace po = boost::program_options;\n\n    bool verbose = false;\n    bool auto_open = true;\n    int return_value = 0;\n    std::string xml_file;\n    std::string img_file;\n    double scale_factor = 1;\n    bool params_as_variables = false;\n    mapnik::logger logger;\n    logger.set_severity(mapnik::logger::error);\n\n    try\n    {\n        po::options_description desc(\"nik2img utility\");\n        desc.add_options()\n            (\"help,h\", \"produce usage message\")\n            (\"version,V\",\"print version string\")\n            (\"verbose,v\",\"verbose output\")\n            (\"open\",\"automatically open the file after rendering (os x only)\")\n            (\"xml\",po::value<std::string>(),\"xml map to read\")\n            (\"img\",po::value<std::string>(),\"image to render\")\n            (\"scale-factor\",po::value<double>(),\"scale factor for rendering\")\n            (\"variables\",\"make map parameters available as render-time variables\")\n            ;\n\n        po::positional_options_description p;\n        p.add(\"xml\",1);\n        p.add(\"img\",1);\n        po::variables_map vm;\n        po::store(po::command_line_parser(argc, argv).options(desc).positional(p).run(), vm);\n        po::notify(vm);\n\n        if (vm.count(\"version\"))\n        {\n            std::clog <<\"version \" << MAPNIK_VERSION_STRING << std::endl;\n            return 1;\n        }\n\n        if (vm.count(\"help\"))\n        {\n            std::clog << desc << std::endl;\n            return 1;\n        }\n\n        if (vm.count(\"verbose\"))\n        {\n            verbose = true;\n        }\n\n        if (vm.count(\"open\"))\n        {\n            auto_open = true;\n        }\n\n        if (vm.count(\"xml\"))\n        {\n            xml_file=vm[\"xml\"].as<std::string>();\n        }\n        else\n        {\n            std::clog << \"please provide an xml map as first argument!\" << std::endl;\n            return -1;\n        }\n\n        if (vm.count(\"img\"))\n        {\n            img_file=vm[\"img\"].as<std::string>();\n        }\n        else\n        {\n            std::clog << \"please provide an img as second argument!\" << std::endl;\n            return -1;\n        }\n\n        if (vm.count(\"scale-factor\"))\n        {\n            scale_factor=vm[\"scale-factor\"].as<double>();\n        }\n\n        if (vm.count(\"variables\"))\n        {\n            params_as_variables = true;\n        }\n\n        mapnik::datasource_cache::instance().register_datasources(\".\/plugins\/input\/\");\n        mapnik::freetype_engine::register_fonts(\".\/fonts\",true);\n        mapnik::Map map(600,400);\n        mapnik::load_map(map,xml_file,true);\n        map.zoom_all();\n        mapnik::image_32 im(map.width(),map.height());\n        mapnik::request req(map.width(),map.height(),map.get_current_extent());\n        req.set_buffer_size(map.buffer_size());\n        mapnik::attributes vars;\n        mapnik::transcoder tr(\"utf-8\");\n        for (auto const& param : map.get_extra_parameters())\n        {\n            std::string const& name = param.first.substr(1);\n            if (!name.empty())\n            {\n                if (param.second.is<mapnik::value_integer>())\n                {\n                    vars[name] = param.second.get<mapnik::value_integer>();\n                }\n                else if (param.second.is<mapnik::value_double>())\n                {\n                    vars[name] = param.second.get<mapnik::value_double>();\n                }\n                else if (param.second.is<std::string>())\n                {\n                    vars[name] = tr.transcode(param.second.get<std::string>().c_str());\n                    std::clog << name << \" \" << param.second.get<std::string>() << \"\\n\";\n                }\n            }\n        }\n        mapnik::agg_renderer<mapnik::image_32> ren(map,req,vars,im,scale_factor,0,0);\n        ren.apply();\n        mapnik::save_to_file(im,img_file);\n        if (auto_open)\n        {\n            std::ostringstream s;\n#ifdef __APPLE__\n            s << \"open \";\n#elif _WIN32\n            s << \"start \";\n#else\n            s << \"xdg-open \";\n#endif\n            s << img_file;\n            int ret = system(s.str().c_str());\n            if (ret != 0)\n                return_value = ret;\n        }\n        else\n        {\n            std::clog << \"rendered to: \" << img_file << \"\\n\";\n        }\n    }\n    catch (std::exception const& ex)\n    {\n        std::clog << \"Error \" << ex.what() << std::endl;\n        return -1;\n    }\n    return return_value;\n}\n<commit_msg>nik2img: make params as variables opt-in<commit_after>#include <mapnik\/map.hpp>\n#include <mapnik\/load_map.hpp>\n#include <mapnik\/agg_renderer.hpp>\n#include <mapnik\/version.hpp>\n#include <mapnik\/debug.hpp>\n#include <mapnik\/image_util.hpp>\n#include <mapnik\/graphics.hpp>\n#include <mapnik\/unicode.hpp>\n#include <mapnik\/datasource_cache.hpp>\n#include <mapnik\/font_engine_freetype.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\/tokenizer.hpp>\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/program_options.hpp>\n#pragma GCC diagnostic pop\n\n#include <string>\n\nint main (int argc,char** argv)\n{\n    namespace po = boost::program_options;\n\n    bool verbose = false;\n    bool auto_open = true;\n    int return_value = 0;\n    std::string xml_file;\n    std::string img_file;\n    double scale_factor = 1;\n    bool params_as_variables = false;\n    mapnik::logger logger;\n    logger.set_severity(mapnik::logger::error);\n\n    try\n    {\n        po::options_description desc(\"nik2img utility\");\n        desc.add_options()\n            (\"help,h\", \"produce usage message\")\n            (\"version,V\",\"print version string\")\n            (\"verbose,v\",\"verbose output\")\n            (\"open\",\"automatically open the file after rendering (os x only)\")\n            (\"xml\",po::value<std::string>(),\"xml map to read\")\n            (\"img\",po::value<std::string>(),\"image to render\")\n            (\"scale-factor\",po::value<double>(),\"scale factor for rendering\")\n            (\"variables\",\"make map parameters available as render-time variables\")\n            ;\n\n        po::positional_options_description p;\n        p.add(\"xml\",1);\n        p.add(\"img\",1);\n        po::variables_map vm;\n        po::store(po::command_line_parser(argc, argv).options(desc).positional(p).run(), vm);\n        po::notify(vm);\n\n        if (vm.count(\"version\"))\n        {\n            std::clog <<\"version \" << MAPNIK_VERSION_STRING << std::endl;\n            return 1;\n        }\n\n        if (vm.count(\"help\"))\n        {\n            std::clog << desc << std::endl;\n            return 1;\n        }\n\n        if (vm.count(\"verbose\"))\n        {\n            verbose = true;\n        }\n\n        if (vm.count(\"open\"))\n        {\n            auto_open = true;\n        }\n\n        if (vm.count(\"xml\"))\n        {\n            xml_file=vm[\"xml\"].as<std::string>();\n        }\n        else\n        {\n            std::clog << \"please provide an xml map as first argument!\" << std::endl;\n            return -1;\n        }\n\n        if (vm.count(\"img\"))\n        {\n            img_file=vm[\"img\"].as<std::string>();\n        }\n        else\n        {\n            std::clog << \"please provide an img as second argument!\" << std::endl;\n            return -1;\n        }\n\n        if (vm.count(\"scale-factor\"))\n        {\n            scale_factor=vm[\"scale-factor\"].as<double>();\n        }\n\n        if (vm.count(\"variables\"))\n        {\n            params_as_variables = true;\n        }\n\n        mapnik::datasource_cache::instance().register_datasources(\".\/plugins\/input\/\");\n        mapnik::freetype_engine::register_fonts(\".\/fonts\",true);\n        mapnik::Map map(600,400);\n        mapnik::load_map(map,xml_file,true);\n        map.zoom_all();\n        mapnik::image_32 im(map.width(),map.height());\n        mapnik::request req(map.width(),map.height(),map.get_current_extent());\n        req.set_buffer_size(map.buffer_size());\n        mapnik::attributes vars;\n        if (params_as_variables)\n        {\n            mapnik::transcoder tr(\"utf-8\");\n            for (auto const& param : map.get_extra_parameters())\n            {\n                std::string const& name = param.first.substr(1);\n                if (!name.empty())\n                {\n                    if (param.second.is<mapnik::value_integer>())\n                    {\n                        vars[name] = param.second.get<mapnik::value_integer>();\n                    }\n                    else if (param.second.is<mapnik::value_double>())\n                    {\n                        vars[name] = param.second.get<mapnik::value_double>();\n                    }\n                    else if (param.second.is<std::string>())\n                    {\n                        vars[name] = tr.transcode(param.second.get<std::string>().c_str());\n                        std::clog << name << \" \" << param.second.get<std::string>() << \"\\n\";\n                    }\n                }\n            }            \n        }\n        mapnik::agg_renderer<mapnik::image_32> ren(map,req,vars,im,scale_factor,0,0);\n        ren.apply();\n        mapnik::save_to_file(im,img_file);\n        if (auto_open)\n        {\n            std::ostringstream s;\n#ifdef __APPLE__\n            s << \"open \";\n#elif _WIN32\n            s << \"start \";\n#else\n            s << \"xdg-open \";\n#endif\n            s << img_file;\n            int ret = system(s.str().c_str());\n            if (ret != 0)\n                return_value = ret;\n        }\n        else\n        {\n            std::clog << \"rendered to: \" << img_file << \"\\n\";\n        }\n    }\n    catch (std::exception const& ex)\n    {\n        std::clog << \"Error \" << ex.what() << std::endl;\n        return -1;\n    }\n    return return_value;\n}\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 \"debug.h\"\n#include \"console.h\"\n#include \"..\/halleystring.h\"\n#include <iostream>\n#include <sstream>\n#include <boost\/noncopyable.hpp>\n\nusing namespace Halley;\n\nbool Halley::Debug::debugging = false;\n\nvoid Halley::Debug::setDebugMode(bool enabled)\n{\n\tdebugging = enabled;\n}\n\nvoid Halley::Debug::toggleDebugMode()\n{\n\tdebugging = !debugging;\n}\n\nbool Halley::Debug::isDebugMode()\n{\n\treturn debugging;\n}\n\nHalley::Debug::Debug()\n{\n}\n\n\n\/\/\/\/\/\/\/\/\n\n\n#ifdef _MSC_VER\n#include \"StackWalker\/StackWalker.h\"\n#include <dbghelp.h> \n#include <tchar.h>\n\n#pragma comment(lib, \"dbghelp.lib\")\n#pragma warning(disable: 4996)\n\nclass CoutStackWalker : public StackWalker\n{\npublic:\n\tCoutStackWalker()\n\t\t: StackWalker()\n\t{\n\t}\n\nprotected:\n\tvoid OnOutput(LPCSTR text)\n\t{\n\t\tstd::cout << text;\n\t\tStackWalker::OnOutput(text);\n\t}\n};\n\nclass StringStackWalker : public StackWalker, public boost::noncopyable\n{\npublic:\n\tStringStackWalker(std::stringstream& s, size_t skipFrames=0)\n\t\t: StackWalker(StackWalker::RetrieveSymbol | StackWalker::RetrieveLine | StackWalker::SymAll)\n\t\t, str(s)\n\t\t, skip(skipFrames)\n\t{\n\t}\n\nprotected:\n\tvoid OnLoadModule(LPCSTR, LPCSTR, DWORD64, DWORD, DWORD, LPCSTR, LPCSTR, ULONGLONG)\n\t{\n\t}\n\n\tvoid OnSymInit(LPCSTR, DWORD, LPCSTR)\n\t{\n\t}\n\n\tvoid OnOutput(LPCSTR text)\n\t{\n\t\tif (skip > 0) {\n\t\t\tskip--;\n\t\t} else {\n\t\t\tstr << \"\\t\" << text;\n\t\t\tStackWalker::OnOutput(text);\n\t\t}\n\t}\n\n\tstd::stringstream& str;\n\tsize_t skip;\n};\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ This function determines whether we need data sections of the given module \nbool IsDataSectionNeeded(const WCHAR* pModuleName) \n{\n\t\/\/ Check parameters \n\tif( pModuleName == 0 ) {\n\t\t_ASSERTE( _T(\"Parameter is null.\") ); \n\t\treturn false; \n\t}\n\n\t\/\/ Extract the module name \n\tWCHAR szFileName[_MAX_FNAME] = L\"\"; \n\t_wsplitpath( pModuleName, NULL, NULL, szFileName, NULL ); \n\n\t\/\/ Compare the name with the list of known names and decide \n\t\/\/ Note: For this to work, the executable name must be \"mididump.exe\"\n\tif(wcsicmp( szFileName, L\"ggj11\" ) == 0) {\n\t\treturn true; \n\t}\n\telse if(wcsicmp( szFileName, L\"ntdll\" ) == 0) {\n\t\treturn true; \n\t}\n\n\treturn false; \n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Custom minidump callback \n\/\/\n\nBOOL CALLBACK MyMiniDumpCallback(PVOID \/*pParam*\/, const PMINIDUMP_CALLBACK_INPUT pInput, PMINIDUMP_CALLBACK_OUTPUT pOutput) \n{\n\tBOOL bRet = FALSE; \n\n\t\/\/ Check parameters \n\tif( pInput == 0 ) return FALSE; \n\tif( pOutput == 0 ) return FALSE; \n\t\n\t\/\/ Process the callbacks \n\tswitch( pInput->CallbackType ) {\n\tcase IncludeModuleCallback: \n\t\t{\n\t\t\t\/\/ Include the module into the dump \n\t\t\tbRet = TRUE; \n\t\t}\n\t\tbreak; \n\n\tcase IncludeThreadCallback: \n\t\t{\n\t\t\t\/\/ Include the thread into the dump \n\t\t\tbRet = TRUE; \n\t\t}\n\t\tbreak; \n\n\tcase ModuleCallback: \n\t\t{\n\t\t\t\/\/ Are data sections available for this module ? \n\n\t\t\tif( pOutput->ModuleWriteFlags & ModuleWriteDataSeg ) \n\t\t\t{\n\t\t\t\t\/\/ Yes, they are, but do we need them? \n\n\t\t\t\tif( !IsDataSectionNeeded( pInput->Module.FullPath ) ) \n\t\t\t\t{\n\t\t\t\t\twprintf( L\"Excluding module data sections: %s \\n\", pInput->Module.FullPath ); \n\n\t\t\t\t\tpOutput->ModuleWriteFlags &= (~ModuleWriteDataSeg); \n\t\t\t\t}\n\t\t\t}\n\n\t\t\tbRet = TRUE; \n\t\t}\n\t\tbreak; \n\n\tcase ThreadCallback: \n\t\t{\n\t\t\t\/\/ Include all thread information into the minidump \n\t\t\tbRet = TRUE;  \n\t\t}\n\t\tbreak; \n\n\tcase ThreadExCallback: \n\t\t{\n\t\t\t\/\/ Include this information \n\t\t\tbRet = TRUE;  \n\t\t}\n\t\tbreak; \n\n\tcase MemoryCallback: \n\t\t{\n\t\t\t\/\/ We do not include any information here -> return FALSE \n\t\t\tbRet = FALSE; \n\t\t}\n\t\tbreak; \n\n\tcase CancelCallback: \n\t\tbreak; \n\t}\n\n\treturn bRet; \n\n}\n\n\nvoid CreateMiniDump( EXCEPTION_POINTERS* pep, LPCWSTR path) \n{\n\t\/\/ Open the file \n\n\tHANDLE hFile = CreateFileW(path, GENERIC_READ | GENERIC_WRITE, 0, NULL, CREATE_ALWAYS, FILE_ATTRIBUTE_NORMAL, NULL); \n\n\tif((hFile != NULL) && (hFile != INVALID_HANDLE_VALUE)) {\n\t\t\/\/ Create the minidump \n\t\tMINIDUMP_EXCEPTION_INFORMATION mdei; \n\t\tmdei.ThreadId           = GetCurrentThreadId(); \n\t\tmdei.ExceptionPointers  = pep; \n\t\tmdei.ClientPointers     = FALSE; \n\n\t\tMINIDUMP_CALLBACK_INFORMATION mci; \n\t\tmci.CallbackRoutine     = (MINIDUMP_CALLBACK_ROUTINE)MyMiniDumpCallback; \n\t\tmci.CallbackParam       = 0; \n\n\t\t\/\/MINIDUMP_TYPE mdt       = (MINIDUMP_TYPE)(MiniDumpWithPrivateReadWriteMemory | MiniDumpWithDataSegs | MiniDumpWithHandleData | MiniDumpWithFullMemoryInfo | MiniDumpWithThreadInfo | MiniDumpWithUnloadedModules ); \n\t\tMINIDUMP_TYPE mdt       = (MINIDUMP_TYPE)(MiniDumpWithIndirectlyReferencedMemory | MiniDumpScanMemory); \n\n\t\tBOOL rv = MiniDumpWriteDump(GetCurrentProcess(), GetCurrentProcessId(), hFile, mdt, (pep != 0) ? &mdei : 0, 0, &mci); \n\n\t\tif(!rv) std::cout << \"Failed creating minidump, last error = \" << GetLastError() << std::endl; \n\t\telse std::cout << \"Minidump created successfully.\" << std::endl;\n\n\t\tCloseHandle(hFile); \n\t}\n\telse {\n\t\tstd::cout << \"Failed creating file for minidump, last error = \" << GetLastError() << std::endl;\n\t}\n\n}\n\n\n#ifndef _DEBUG\nvoid printException(PEXCEPTION_RECORD record)\n{\n\tString code = \"unknown\";\n\tint c = record->ExceptionCode;\n\n\tswitch (c) {\n\tcase EXCEPTION_ACCESS_VIOLATION: code = \"Access violation\"; break;\n\tcase EXCEPTION_ARRAY_BOUNDS_EXCEEDED: code = \"Array bounds exceeded\"; break;\n\tcase EXCEPTION_BREAKPOINT: code = \"Breakpoint\"; break;\n\tcase EXCEPTION_DATATYPE_MISALIGNMENT: code = \"Datatype misalignment\"; break;\n\tcase EXCEPTION_FLT_DENORMAL_OPERAND: code = \"Float denormal operand\"; break;\n\tcase EXCEPTION_FLT_DIVIDE_BY_ZERO: code = \"Float divide by zero\"; break;\n\tcase EXCEPTION_FLT_INEXACT_RESULT: code = \"Float inexact result\"; break;\n\tcase EXCEPTION_FLT_INVALID_OPERATION: code = \"Flt invalid operation\"; break;\n\tcase EXCEPTION_FLT_OVERFLOW: code = \"Float overflow\"; break;\n\tcase EXCEPTION_FLT_STACK_CHECK: code = \"Float stack check\"; break;\n\tcase EXCEPTION_FLT_UNDERFLOW: code = \"Float underflow\"; break;\n\tcase EXCEPTION_ILLEGAL_INSTRUCTION: code = \"Illegal instruction\"; break;\n\tcase EXCEPTION_IN_PAGE_ERROR: code = \"In page error\"; break;\n\tcase EXCEPTION_INT_DIVIDE_BY_ZERO: code = \"Integer divide by zero\"; break;\n\tcase EXCEPTION_INT_OVERFLOW: code = \"Integer overflow\"; break;\n\tcase EXCEPTION_INVALID_DISPOSITION: code = \"Invalid disposition\"; break;\n\tcase EXCEPTION_NONCONTINUABLE_EXCEPTION: code = \"Noncontinuable exception\"; break;\n\tcase EXCEPTION_PRIV_INSTRUCTION: code = \"Privileged instruction\"; break;\n\tcase EXCEPTION_SINGLE_STEP: code = \"Single step\"; break;\n\tcase EXCEPTION_STACK_OVERFLOW: code = \"Stack overflow\";\n\t}\n\n\tstd::cout << \"Unhandled exception: \" << code;\n\tstd::cout << \" at 0x\" << record->ExceptionAddress;\n\n\tif (c == EXCEPTION_ACCESS_VIOLATION || c == EXCEPTION_IN_PAGE_ERROR) {\n\t\tswitch (record->ExceptionInformation[0]) {\n\t\tcase 0: std::cout << \", reading\"; break;\n\t\tcase 1: std::cout << \", writing\"; break;\n\t\tcase 8: std::cout << \", DEP on\"; break;\n\t\tdefault: std::cout << \", unknown on\";\n\t\t}\n\t\tstd::cout << \" address: 0x\";\n\t\tstd::cout << (void*) record->ExceptionInformation[1];\n\n\t\tif (c == EXCEPTION_IN_PAGE_ERROR) std::cout << \", NTSTATUS: \" << record->ExceptionInformation[2];\n\t}\n\n\tstd::cout << std::endl;\n}\n\n\nLONG onUnhandledException(LPEXCEPTION_POINTERS e)\n{\n#ifdef _M_IX86 \n\tif (e->ExceptionRecord->ExceptionCode == EXCEPTION_STACK_OVERFLOW)   \n\t{ \n\t\t\/\/ be sure that we have enough space... \n\t\tstatic char MyStack[1024*128];   \n\t\t\/\/ it assumes that DS and SS are the same!!! (this is the case for Win32) \n\t\t\/\/ change the stack only if the selectors are the same (this is the case for Win32) \n\t\t\/\/__asm push offset MyStack[1024*128]; \n\t\t\/\/__asm pop esp; \n\t\t__asm mov eax,offset MyStack[1024*128]; \n\t\t__asm mov esp,eax; \n\t} \n#endif\n\n\ttime_t rawtime;\n\ttime(&rawtime);\n\tchar buffer[128];\n\tstrftime (buffer, 100, \"%Y-%m-%d-%H-%M-%S\", localtime(&rawtime));\n\tString path = Game::getDataPath() + \"minidump-\" + buffer + \".dmp\";\n\tstd::cout << \"Writing minidump to \\\"\" << path << \"\\\"...\" << std::endl;\n\tCreateMiniDump(e, path.getUTF16().c_str());\n\n\tprintException(e->ExceptionRecord);\n\tstd::cout << \"===== CALL STACK =====\" << std::endl;\n\tCoutStackWalker walker;\n\twalker.ShowCallstack(GetCurrentThread(), e->ContextRecord);\n\tstd::cout << \"======================\" << std::endl;\n\tstd::cout << \"Last trace: \" << Debug::getLastTraces() << std::endl;\n\treturn EXCEPTION_EXECUTE_HANDLER;\n}\n\n\/\/#ifndef _M_IX86\n\/\/#error \"The following code only works for x86!\"\n\/\/#endif\nLPTOP_LEVEL_EXCEPTION_FILTER WINAPI MyDummySetUnhandledExceptionFilter(LPTOP_LEVEL_EXCEPTION_FILTER \/*lpTopLevelExceptionFilter*\/)\n{\n\treturn NULL;\n}\n\nBOOL PreventSetUnhandledExceptionFilter()\n{\n\tHMODULE hKernel32 = LoadLibrary(L\"kernel32.dll\");\n\tif (hKernel32 == NULL) return FALSE;\n\tvoid *pOrgEntry = GetProcAddress(hKernel32, \"SetUnhandledExceptionFilter\");\n\tif(pOrgEntry == NULL) return FALSE;\n\tunsigned char newJump[ 100 ];\n\tDWORD dwOrgEntryAddr = (DWORD) pOrgEntry;\n\tdwOrgEntryAddr += 5; \/\/ add 5 for 5 op-codes for jmp far\n\tvoid *pNewFunc = &MyDummySetUnhandledExceptionFilter;\n\tDWORD dwNewEntryAddr = (DWORD) pNewFunc;\n\tDWORD dwRelativeAddr = dwNewEntryAddr - dwOrgEntryAddr;\n\n\tnewJump[ 0 ] = 0xE9;  \/\/ JMP absolute\n\tmemcpy(&newJump[ 1 ], &dwRelativeAddr, sizeof(pNewFunc));\n\tSIZE_T bytesWritten;\n\tBOOL bRet = WriteProcessMemory(GetCurrentProcess(),\n\t\tpOrgEntry, newJump, sizeof(pNewFunc) + 1, &bytesWritten);\n\treturn bRet;\n}\n#endif\n\n#endif\n\nvoid Halley::Debug::setErrorHandling()\n{\n#ifdef _WIN32\n#ifndef _DEBUG\n\t\/\/SetUnhandledExceptionFilter((LPTOP_LEVEL_EXCEPTION_FILTER) onUnhandledException);\n\t\/\/PreventSetUnhandledExceptionFilter();\n#endif\n#endif\n}\n\nvoid Halley::Debug::printCallStack()\n{\n#ifdef _WIN32\n\tstd::cout << ConsoleColor(Console::RED) << \"===== CALL STACK =====\" << ConsoleColor(Console::DARK_RED) << std::endl;\n\tCoutStackWalker walker;\n\twalker.ShowCallstack();\n\tstd::cout << ConsoleColor(Console::RED) << \"======================\" << ConsoleColor() << std::endl;\n#endif\n}\n\nHalley::String Halley::Debug::getCallStack()\n{\n#ifdef _WIN32\n\tstd::stringstream str;\n\tStringStackWalker walker(str, 3);\n\twalker.ShowCallstack();\n\treturn str.str();\n#else\n\treturn \"\";\n#endif\n}\n\nvoid Halley::Debug::trace(String str)\n{\n\tif (lastTraces.size() >= 5) lastTraces.pop_back();\n\tlastTraces.push_front(str);\n}\n\nHalley::String Halley::Debug::getLastTraces()\n{\n\tString result;\n\tfor (auto i=lastTraces.begin(); i != lastTraces.end(); i++) {\n\t\tresult += \" - \" + (*i) + \"\\n\";\n\t}\n\treturn result;\n}\n\nstd::list<Halley::String> Halley::Debug::lastTraces;\n<commit_msg>Fix compilation errors.<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 \"debug.h\"\n#include \"console.h\"\n#include \"..\/halleystring.h\"\n#include <iostream>\n#include <sstream>\n#include <boost\/noncopyable.hpp>\n#include <ctime>\n#include \"..\/os\/os.h\"\n\nusing namespace Halley;\n\nbool Halley::Debug::debugging = false;\n\nvoid Halley::Debug::setDebugMode(bool enabled)\n{\n\tdebugging = enabled;\n}\n\nvoid Halley::Debug::toggleDebugMode()\n{\n\tdebugging = !debugging;\n}\n\nbool Halley::Debug::isDebugMode()\n{\n\treturn debugging;\n}\n\nHalley::Debug::Debug()\n{\n}\n\n\n\/\/\/\/\/\/\/\/\n\n\n#ifdef _MSC_VER\n#include \"StackWalker\/StackWalker.h\"\n#include <dbghelp.h> \n#include <tchar.h>\n\n#pragma comment(lib, \"dbghelp.lib\")\n#pragma warning(disable: 4996)\n\nclass CoutStackWalker : public StackWalker\n{\npublic:\n\tCoutStackWalker()\n\t\t: StackWalker()\n\t{\n\t}\n\nprotected:\n\tvoid OnOutput(LPCSTR text)\n\t{\n\t\tstd::cout << text;\n\t\tStackWalker::OnOutput(text);\n\t}\n};\n\nclass StringStackWalker : public StackWalker, public boost::noncopyable\n{\npublic:\n\tStringStackWalker(std::stringstream& s, size_t skipFrames=0)\n\t\t: StackWalker(StackWalker::RetrieveSymbol | StackWalker::RetrieveLine | StackWalker::SymAll)\n\t\t, str(s)\n\t\t, skip(skipFrames)\n\t{\n\t}\n\nprotected:\n\tvoid OnLoadModule(LPCSTR, LPCSTR, DWORD64, DWORD, DWORD, LPCSTR, LPCSTR, ULONGLONG)\n\t{\n\t}\n\n\tvoid OnSymInit(LPCSTR, DWORD, LPCSTR)\n\t{\n\t}\n\n\tvoid OnOutput(LPCSTR text)\n\t{\n\t\tif (skip > 0) {\n\t\t\tskip--;\n\t\t} else {\n\t\t\tstr << \"\\t\" << text;\n\t\t\tStackWalker::OnOutput(text);\n\t\t}\n\t}\n\n\tstd::stringstream& str;\n\tsize_t skip;\n};\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ This function determines whether we need data sections of the given module \nbool IsDataSectionNeeded(const WCHAR* pModuleName) \n{\n\t\/\/ Check parameters \n\tif( pModuleName == 0 ) {\n\t\t_ASSERTE( _T(\"Parameter is null.\") ); \n\t\treturn false; \n\t}\n\n\t\/\/ Extract the module name \n\tWCHAR szFileName[_MAX_FNAME] = L\"\"; \n\t_wsplitpath( pModuleName, NULL, NULL, szFileName, NULL ); \n\n\t\/\/ Compare the name with the list of known names and decide \n\t\/\/ Note: For this to work, the executable name must be \"mididump.exe\"\n\tif(wcsicmp( szFileName, L\"ggj11\" ) == 0) {\n\t\treturn true; \n\t}\n\telse if(wcsicmp( szFileName, L\"ntdll\" ) == 0) {\n\t\treturn true; \n\t}\n\n\treturn false; \n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Custom minidump callback \n\/\/\n\nBOOL CALLBACK MyMiniDumpCallback(PVOID \/*pParam*\/, const PMINIDUMP_CALLBACK_INPUT pInput, PMINIDUMP_CALLBACK_OUTPUT pOutput) \n{\n\tBOOL bRet = FALSE; \n\n\t\/\/ Check parameters \n\tif( pInput == 0 ) return FALSE; \n\tif( pOutput == 0 ) return FALSE; \n\t\n\t\/\/ Process the callbacks \n\tswitch( pInput->CallbackType ) {\n\tcase IncludeModuleCallback: \n\t\t{\n\t\t\t\/\/ Include the module into the dump \n\t\t\tbRet = TRUE; \n\t\t}\n\t\tbreak; \n\n\tcase IncludeThreadCallback: \n\t\t{\n\t\t\t\/\/ Include the thread into the dump \n\t\t\tbRet = TRUE; \n\t\t}\n\t\tbreak; \n\n\tcase ModuleCallback: \n\t\t{\n\t\t\t\/\/ Are data sections available for this module ? \n\n\t\t\tif( pOutput->ModuleWriteFlags & ModuleWriteDataSeg ) \n\t\t\t{\n\t\t\t\t\/\/ Yes, they are, but do we need them? \n\n\t\t\t\tif( !IsDataSectionNeeded( pInput->Module.FullPath ) ) \n\t\t\t\t{\n\t\t\t\t\twprintf( L\"Excluding module data sections: %s \\n\", pInput->Module.FullPath ); \n\n\t\t\t\t\tpOutput->ModuleWriteFlags &= (~ModuleWriteDataSeg); \n\t\t\t\t}\n\t\t\t}\n\n\t\t\tbRet = TRUE; \n\t\t}\n\t\tbreak; \n\n\tcase ThreadCallback: \n\t\t{\n\t\t\t\/\/ Include all thread information into the minidump \n\t\t\tbRet = TRUE;  \n\t\t}\n\t\tbreak; \n\n\tcase ThreadExCallback: \n\t\t{\n\t\t\t\/\/ Include this information \n\t\t\tbRet = TRUE;  \n\t\t}\n\t\tbreak; \n\n\tcase MemoryCallback: \n\t\t{\n\t\t\t\/\/ We do not include any information here -> return FALSE \n\t\t\tbRet = FALSE; \n\t\t}\n\t\tbreak; \n\n\tcase CancelCallback: \n\t\tbreak; \n\t}\n\n\treturn bRet; \n\n}\n\n\nvoid CreateMiniDump( EXCEPTION_POINTERS* pep, LPCWSTR path) \n{\n\t\/\/ Open the file \n\n\tHANDLE hFile = CreateFileW(path, GENERIC_READ | GENERIC_WRITE, 0, NULL, CREATE_ALWAYS, FILE_ATTRIBUTE_NORMAL, NULL); \n\n\tif((hFile != NULL) && (hFile != INVALID_HANDLE_VALUE)) {\n\t\t\/\/ Create the minidump \n\t\tMINIDUMP_EXCEPTION_INFORMATION mdei; \n\t\tmdei.ThreadId           = GetCurrentThreadId(); \n\t\tmdei.ExceptionPointers  = pep; \n\t\tmdei.ClientPointers     = FALSE; \n\n\t\tMINIDUMP_CALLBACK_INFORMATION mci; \n\t\tmci.CallbackRoutine     = (MINIDUMP_CALLBACK_ROUTINE)MyMiniDumpCallback; \n\t\tmci.CallbackParam       = 0; \n\n\t\t\/\/MINIDUMP_TYPE mdt       = (MINIDUMP_TYPE)(MiniDumpWithPrivateReadWriteMemory | MiniDumpWithDataSegs | MiniDumpWithHandleData | MiniDumpWithFullMemoryInfo | MiniDumpWithThreadInfo | MiniDumpWithUnloadedModules ); \n\t\tMINIDUMP_TYPE mdt       = (MINIDUMP_TYPE)(MiniDumpWithIndirectlyReferencedMemory | MiniDumpScanMemory); \n\n\t\tBOOL rv = MiniDumpWriteDump(GetCurrentProcess(), GetCurrentProcessId(), hFile, mdt, (pep != 0) ? &mdei : 0, 0, &mci); \n\n\t\tif(!rv) std::cout << \"Failed creating minidump, last error = \" << GetLastError() << std::endl; \n\t\telse std::cout << \"Minidump created successfully.\" << std::endl;\n\n\t\tCloseHandle(hFile); \n\t}\n\telse {\n\t\tstd::cout << \"Failed creating file for minidump, last error = \" << GetLastError() << std::endl;\n\t}\n\n}\n\n\n#ifndef _DEBUG\nvoid printException(PEXCEPTION_RECORD record)\n{\n\tString code = \"unknown\";\n\tint c = record->ExceptionCode;\n\n\tswitch (c) {\n\tcase EXCEPTION_ACCESS_VIOLATION: code = \"Access violation\"; break;\n\tcase EXCEPTION_ARRAY_BOUNDS_EXCEEDED: code = \"Array bounds exceeded\"; break;\n\tcase EXCEPTION_BREAKPOINT: code = \"Breakpoint\"; break;\n\tcase EXCEPTION_DATATYPE_MISALIGNMENT: code = \"Datatype misalignment\"; break;\n\tcase EXCEPTION_FLT_DENORMAL_OPERAND: code = \"Float denormal operand\"; break;\n\tcase EXCEPTION_FLT_DIVIDE_BY_ZERO: code = \"Float divide by zero\"; break;\n\tcase EXCEPTION_FLT_INEXACT_RESULT: code = \"Float inexact result\"; break;\n\tcase EXCEPTION_FLT_INVALID_OPERATION: code = \"Flt invalid operation\"; break;\n\tcase EXCEPTION_FLT_OVERFLOW: code = \"Float overflow\"; break;\n\tcase EXCEPTION_FLT_STACK_CHECK: code = \"Float stack check\"; break;\n\tcase EXCEPTION_FLT_UNDERFLOW: code = \"Float underflow\"; break;\n\tcase EXCEPTION_ILLEGAL_INSTRUCTION: code = \"Illegal instruction\"; break;\n\tcase EXCEPTION_IN_PAGE_ERROR: code = \"In page error\"; break;\n\tcase EXCEPTION_INT_DIVIDE_BY_ZERO: code = \"Integer divide by zero\"; break;\n\tcase EXCEPTION_INT_OVERFLOW: code = \"Integer overflow\"; break;\n\tcase EXCEPTION_INVALID_DISPOSITION: code = \"Invalid disposition\"; break;\n\tcase EXCEPTION_NONCONTINUABLE_EXCEPTION: code = \"Noncontinuable exception\"; break;\n\tcase EXCEPTION_PRIV_INSTRUCTION: code = \"Privileged instruction\"; break;\n\tcase EXCEPTION_SINGLE_STEP: code = \"Single step\"; break;\n\tcase EXCEPTION_STACK_OVERFLOW: code = \"Stack overflow\";\n\t}\n\n\tstd::cout << \"Unhandled exception: \" << code;\n\tstd::cout << \" at 0x\" << record->ExceptionAddress;\n\n\tif (c == EXCEPTION_ACCESS_VIOLATION || c == EXCEPTION_IN_PAGE_ERROR) {\n\t\tswitch (record->ExceptionInformation[0]) {\n\t\tcase 0: std::cout << \", reading\"; break;\n\t\tcase 1: std::cout << \", writing\"; break;\n\t\tcase 8: std::cout << \", DEP on\"; break;\n\t\tdefault: std::cout << \", unknown on\";\n\t\t}\n\t\tstd::cout << \" address: 0x\";\n\t\tstd::cout << (void*) record->ExceptionInformation[1];\n\n\t\tif (c == EXCEPTION_IN_PAGE_ERROR) std::cout << \", NTSTATUS: \" << record->ExceptionInformation[2];\n\t}\n\n\tstd::cout << std::endl;\n}\n\n\nLONG onUnhandledException(LPEXCEPTION_POINTERS e)\n{\n#ifdef _M_IX86 \n\tif (e->ExceptionRecord->ExceptionCode == EXCEPTION_STACK_OVERFLOW)   \n\t{ \n\t\t\/\/ be sure that we have enough space... \n\t\tstatic char MyStack[1024*128];   \n\t\t\/\/ it assumes that DS and SS are the same!!! (this is the case for Win32) \n\t\t\/\/ change the stack only if the selectors are the same (this is the case for Win32) \n\t\t\/\/__asm push offset MyStack[1024*128]; \n\t\t\/\/__asm pop esp; \n\t\t__asm mov eax,offset MyStack[1024*128]; \n\t\t__asm mov esp,eax; \n\t} \n#endif\n\n\ttime_t rawtime;\n\ttime(&rawtime);\n\tchar buffer[128];\n\tstrftime (buffer, 100, \"%Y-%m-%d-%H-%M-%S\", localtime(&rawtime));\n\tString path = OS::get().getUserDataDir() + \"minidump-\" + buffer + \".dmp\";\n\tstd::cout << \"Writing minidump to \\\"\" << path << \"\\\"...\" << std::endl;\n\tCreateMiniDump(e, path.getUTF16().c_str());\n\n\tprintException(e->ExceptionRecord);\n\tstd::cout << \"===== CALL STACK =====\" << std::endl;\n\tCoutStackWalker walker;\n\twalker.ShowCallstack(GetCurrentThread(), e->ContextRecord);\n\tstd::cout << \"======================\" << std::endl;\n\tstd::cout << \"Last trace: \" << Debug::getLastTraces() << std::endl;\n\treturn EXCEPTION_EXECUTE_HANDLER;\n}\n\n\/\/#ifndef _M_IX86\n\/\/#error \"The following code only works for x86!\"\n\/\/#endif\nLPTOP_LEVEL_EXCEPTION_FILTER WINAPI MyDummySetUnhandledExceptionFilter(LPTOP_LEVEL_EXCEPTION_FILTER \/*lpTopLevelExceptionFilter*\/)\n{\n\treturn NULL;\n}\n\nBOOL PreventSetUnhandledExceptionFilter()\n{\n\tHMODULE hKernel32 = LoadLibrary(L\"kernel32.dll\");\n\tif (hKernel32 == NULL) return FALSE;\n\tvoid *pOrgEntry = GetProcAddress(hKernel32, \"SetUnhandledExceptionFilter\");\n\tif(pOrgEntry == NULL) return FALSE;\n\tunsigned char newJump[ 100 ];\n\tsize_t dwOrgEntryAddr = (size_t) pOrgEntry;\n\tdwOrgEntryAddr += 5; \/\/ add 5 for 5 op-codes for jmp far\n\tvoid *pNewFunc = &MyDummySetUnhandledExceptionFilter;\n\tsize_t dwNewEntryAddr = (size_t) pNewFunc;\n\tsize_t dwRelativeAddr = dwNewEntryAddr - dwOrgEntryAddr;\n\n\tnewJump[ 0 ] = 0xE9;  \/\/ JMP absolute\n\tmemcpy(&newJump[ 1 ], &dwRelativeAddr, sizeof(pNewFunc));\n\tSIZE_T bytesWritten;\n\tBOOL bRet = WriteProcessMemory(GetCurrentProcess(),\n\t\tpOrgEntry, newJump, sizeof(pNewFunc) + 1, &bytesWritten);\n\treturn bRet;\n}\n#endif\n\n#endif\n\nvoid Halley::Debug::setErrorHandling()\n{\n#ifdef _WIN32\n#ifndef _DEBUG\n\t\/\/SetUnhandledExceptionFilter((LPTOP_LEVEL_EXCEPTION_FILTER) onUnhandledException);\n\t\/\/PreventSetUnhandledExceptionFilter();\n#endif\n#endif\n}\n\nvoid Halley::Debug::printCallStack()\n{\n#ifdef _WIN32\n\tstd::cout << ConsoleColor(Console::RED) << \"===== CALL STACK =====\" << ConsoleColor(Console::DARK_RED) << std::endl;\n\tCoutStackWalker walker;\n\twalker.ShowCallstack();\n\tstd::cout << ConsoleColor(Console::RED) << \"======================\" << ConsoleColor() << std::endl;\n#endif\n}\n\nHalley::String Halley::Debug::getCallStack()\n{\n#ifdef _WIN32\n\tstd::stringstream str;\n\tStringStackWalker walker(str, 3);\n\twalker.ShowCallstack();\n\treturn str.str();\n#else\n\treturn \"\";\n#endif\n}\n\nvoid Halley::Debug::trace(String str)\n{\n\tif (lastTraces.size() >= 5) lastTraces.pop_back();\n\tlastTraces.push_front(str);\n}\n\nHalley::String Halley::Debug::getLastTraces()\n{\n\tString result;\n\tfor (auto i=lastTraces.begin(); i != lastTraces.end(); i++) {\n\t\tresult += \" - \" + (*i) + \"\\n\";\n\t}\n\treturn result;\n}\n\nstd::list<Halley::String> Halley::Debug::lastTraces;\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 speed_optimizer.cc\n **\/\n\n#include \"modules\/planning\/common\/planning_gflags.h\"\n#include \"modules\/planning\/common\/speed_limit.h\"\n#include \"modules\/planning\/tasks\/speed_optimizer.h\"\n\nnamespace apollo {\nnamespace planning {\n\nusing apollo::planning_internal::StGraphBoundaryDebug;\nusing apollo::planning_internal::STGraphDebug;\n\nSpeedOptimizer::SpeedOptimizer(const std::string& name) : Task(name) {}\n\napollo::common::Status SpeedOptimizer::Execute(\n    Frame* frame, ReferenceLineInfo* reference_line_info) {\n  Task::Execute(frame, reference_line_info);\n\n  auto ret = Process(\n      reference_line_info->AdcSlBoundary(), reference_line_info->path_data(),\n      frame->PlanningStartPoint(), reference_line_info->reference_line(),\n      reference_line_info->path_decision(),\n      reference_line_info->mutable_speed_data());\n\n  if (!ret.ok() && FLAGS_enable_slowdown_profile_generator &&\n      frame->PlanningStartPoint().v() < FLAGS_slowdown_speed_threshold) {\n    *reference_line_info->mutable_speed_data() =\n        GenerateStopProfile(frame->PlanningStartPoint().v());\n  }\n  RecordDebugInfo(reference_line_info->speed_data());\n  return ret;\n}\n\nSpeedData SpeedOptimizer::GenerateStopProfile(const double init_speed) const {\n  AERROR << \"Slowing down the car.\";\n  SpeedData speed_data;\n\n  const double min_acc = FLAGS_slowdown_profile_deceleration;\n  const size_t max_t = 3.0;\n  const double unit_t = 0.02;\n\n  double pre_s = 0.0;\n  for (double t = 0.0; t < max_t; t += unit_t) {\n    const double s = std::fmax(pre_s, init_speed * t + 0.5 * min_acc * t * t);\n    const double v = std::fmax(0.0, init_speed + min_acc * t);\n    speed_data.AppendSpeedPoint(s, t, v, min_acc, 0.0);\n    pre_s = s;\n  }\n  return speed_data;\n}\n\nvoid SpeedOptimizer::RecordDebugInfo(const SpeedData& speed_data) {\n  auto debug = frame_->MutableADCTrajectory()->mutable_debug();\n  auto ptr_speed_plan = debug->mutable_planning_data()->add_speed_plan();\n  ptr_speed_plan->set_name(Name());\n  ptr_speed_plan->mutable_speed_point()->CopyFrom(\n      {speed_data.speed_vector().begin(), speed_data.speed_vector().end()});\n}\n\nvoid SpeedOptimizer::RecordSTGraphDebug(\n    const std::vector<StBoundary>& boundaries, const SpeedLimit& speed_limits,\n    const SpeedData& speed_data, STGraphDebug* st_graph_debug) {\n  if (!FLAGS_enable_record_debug) {\n    ADEBUG << \"Skip record debug info\";\n    return;\n  }\n\n  \/\/ auto debug = frame_->MutableADCTrajectory()->mutable_debug();\n  \/\/ auto st_graph_debug = debug->mutable_planning_data()->add_st_graph();\n  st_graph_debug->set_name(Name());\n  for (const auto boundary : boundaries) {\n    auto boundary_debug = st_graph_debug->add_boundary();\n    boundary_debug->set_name(boundary.id());\n    switch (boundary.boundary_type()) {\n      case StBoundary::BoundaryType::FOLLOW:\n        boundary_debug->set_type(StGraphBoundaryDebug::ST_BOUNDARY_TYPE_FOLLOW);\n        break;\n      case StBoundary::BoundaryType::OVERTAKE:\n        boundary_debug->set_type(\n            StGraphBoundaryDebug::ST_BOUNDARY_TYPE_OVERTAKE);\n        break;\n      case StBoundary::BoundaryType::STOP:\n        boundary_debug->set_type(StGraphBoundaryDebug::ST_BOUNDARY_TYPE_STOP);\n        break;\n      case StBoundary::BoundaryType::UNKNOWN:\n        boundary_debug->set_type(\n            StGraphBoundaryDebug::ST_BOUNDARY_TYPE_UNKNOWN);\n        break;\n      case StBoundary::BoundaryType::YIELD:\n        boundary_debug->set_type(StGraphBoundaryDebug::ST_BOUNDARY_TYPE_YIELD);\n        break;\n    }\n\n    for (const auto point : boundary.points()) {\n      auto point_debug = boundary_debug->add_point();\n      point_debug->set_t(point.x());\n      point_debug->set_s(point.y());\n    }\n  }\n\n  for (const auto point : speed_limits.speed_limit_points()) {\n    common::SpeedPoint speed_point;\n    speed_point.set_s(point.first);\n    speed_point.set_v(point.second);\n    st_graph_debug->add_speed_limit()->CopyFrom(speed_point);\n  }\n\n  st_graph_debug->mutable_speed_profile()->CopyFrom(\n      {speed_data.speed_vector().begin(), speed_data.speed_vector().end()});\n}\n\n}  \/\/ namespace planning\n}  \/\/ namespace apollo\n<commit_msg>Planning: slowdown for all failed speed optimization cases.<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 speed_optimizer.cc\n **\/\n\n#include \"modules\/planning\/common\/planning_gflags.h\"\n#include \"modules\/planning\/common\/speed_limit.h\"\n#include \"modules\/planning\/tasks\/speed_optimizer.h\"\n\nnamespace apollo {\nnamespace planning {\n\nusing apollo::planning_internal::StGraphBoundaryDebug;\nusing apollo::planning_internal::STGraphDebug;\n\nSpeedOptimizer::SpeedOptimizer(const std::string& name) : Task(name) {}\n\napollo::common::Status SpeedOptimizer::Execute(\n    Frame* frame, ReferenceLineInfo* reference_line_info) {\n  Task::Execute(frame, reference_line_info);\n\n  auto ret = Process(\n      reference_line_info->AdcSlBoundary(), reference_line_info->path_data(),\n      frame->PlanningStartPoint(), reference_line_info->reference_line(),\n      reference_line_info->path_decision(),\n      reference_line_info->mutable_speed_data());\n\n  if (!ret.ok() && FLAGS_enable_slowdown_profile_generator) {\n    *reference_line_info->mutable_speed_data() =\n        GenerateStopProfile(frame->PlanningStartPoint().v());\n  }\n  RecordDebugInfo(reference_line_info->speed_data());\n  return ret;\n}\n\nSpeedData SpeedOptimizer::GenerateStopProfile(const double init_speed) const {\n  AERROR << \"Slowing down the car.\";\n  SpeedData speed_data;\n\n  double slowdown_decel = FLAGS_slowdown_profile_deceleration;\n  if (frame_->PlanningStartPoint().v() > FLAGS_slowdown_speed_threshold) {\n    \/\/ TODO(all): select the best deceleration for slow down.\n    slowdown_decel = FLAGS_slowdown_speed_threshold \/ 2.0;\n  }\n\n  const size_t max_t = 3.0;\n  const double unit_t = 0.02;\n\n  double pre_s = 0.0;\n  for (double t = 0.0; t < max_t; t += unit_t) {\n    const double s =\n        std::fmax(pre_s, init_speed * t + 0.5 * slowdown_decel * t * t);\n    const double v = std::fmax(0.0, init_speed + slowdown_decel * t);\n    speed_data.AppendSpeedPoint(s, t, v, slowdown_decel, 0.0);\n    pre_s = s;\n  }\n  return speed_data;\n}\n\nvoid SpeedOptimizer::RecordDebugInfo(const SpeedData& speed_data) {\n  auto debug = frame_->MutableADCTrajectory()->mutable_debug();\n  auto ptr_speed_plan = debug->mutable_planning_data()->add_speed_plan();\n  ptr_speed_plan->set_name(Name());\n  ptr_speed_plan->mutable_speed_point()->CopyFrom(\n      {speed_data.speed_vector().begin(), speed_data.speed_vector().end()});\n}\n\nvoid SpeedOptimizer::RecordSTGraphDebug(\n    const std::vector<StBoundary>& boundaries, const SpeedLimit& speed_limits,\n    const SpeedData& speed_data, STGraphDebug* st_graph_debug) {\n  if (!FLAGS_enable_record_debug) {\n    ADEBUG << \"Skip record debug info\";\n    return;\n  }\n\n  \/\/ auto debug = frame_->MutableADCTrajectory()->mutable_debug();\n  \/\/ auto st_graph_debug = debug->mutable_planning_data()->add_st_graph();\n  st_graph_debug->set_name(Name());\n  for (const auto boundary : boundaries) {\n    auto boundary_debug = st_graph_debug->add_boundary();\n    boundary_debug->set_name(boundary.id());\n    switch (boundary.boundary_type()) {\n      case StBoundary::BoundaryType::FOLLOW:\n        boundary_debug->set_type(StGraphBoundaryDebug::ST_BOUNDARY_TYPE_FOLLOW);\n        break;\n      case StBoundary::BoundaryType::OVERTAKE:\n        boundary_debug->set_type(\n            StGraphBoundaryDebug::ST_BOUNDARY_TYPE_OVERTAKE);\n        break;\n      case StBoundary::BoundaryType::STOP:\n        boundary_debug->set_type(StGraphBoundaryDebug::ST_BOUNDARY_TYPE_STOP);\n        break;\n      case StBoundary::BoundaryType::UNKNOWN:\n        boundary_debug->set_type(\n            StGraphBoundaryDebug::ST_BOUNDARY_TYPE_UNKNOWN);\n        break;\n      case StBoundary::BoundaryType::YIELD:\n        boundary_debug->set_type(StGraphBoundaryDebug::ST_BOUNDARY_TYPE_YIELD);\n        break;\n    }\n\n    for (const auto point : boundary.points()) {\n      auto point_debug = boundary_debug->add_point();\n      point_debug->set_t(point.x());\n      point_debug->set_s(point.y());\n    }\n  }\n\n  for (const auto point : speed_limits.speed_limit_points()) {\n    common::SpeedPoint speed_point;\n    speed_point.set_s(point.first);\n    speed_point.set_v(point.second);\n    st_graph_debug->add_speed_limit()->CopyFrom(speed_point);\n  }\n\n  st_graph_debug->mutable_speed_profile()->CopyFrom(\n      {speed_data.speed_vector().begin(), speed_data.speed_vector().end()});\n}\n\n}  \/\/ namespace planning\n}  \/\/ namespace apollo\n<|endoftext|>"}
{"text":"<commit_before>\n#ifndef __MYSQL_PROTOCOL_HPP__\n#define __MYSQL_PROTOCOL_HPP__\n\n#include <stdlib.h>\n#include <mysql\/mysql.h>\n#include <mysql\/mysqld_error.h>\n#include <vector>\n#include \"protocol.hpp\"\n\nusing namespace std;\n\nstruct mysql_protocol_t : public protocol_t {\n    mysql_protocol_t(config_t *config) : _dbname(NULL), protocol_t(config) {\n        mysql_init(&mysql);\n    }\n\n    virtual ~mysql_protocol_t() {\n        for(int i = 0; i < read_stmts.size(); i++) {\n            mysql_stmt_close(read_stmts[i]);\n        }\n        mysql_stmt_close(insert_stmt);\n        mysql_stmt_close(update_stmt);\n        mysql_stmt_close(remove_stmt);\n        mysql_close(&mysql);\n    }\n\n    virtual void connect(server_t *server) {\n        \/\/ Parse the host string\n        char __host[512];\n        strcpy(__host, server->host);\n        char *_host = NULL;\n        char *_port;\n        char *_username = NULL;\n        char *_password = NULL;\n        _dbname = strstr((char*)__host, \"+\");\n        if(_dbname) {\n            *_dbname = '\\0';\n            _dbname++;\n        }\n        _port = strstr((char*)__host, \":\");\n        if(_port) {\n            *_port = '\\0';\n            _port++;\n        }\n        _host = strstr((char*)__host, \"@\");\n        if(_host) {\n            *_host = '\\0';\n            _host++;\n        }\n        _password = strstr((char*)__host, \"\/\");\n        if(_password) {\n            *_password = '\\0';\n            _password++;\n        }\n        _username = (char*)__host;\n\n        if(!_dbname || !_host || !_port || !_username || !_password) {\n            fprintf(stderr, \"Please use host string of the form username\/password@host:port+database.\\n\");\n            exit(-1);\n        }\n\n        int port = atoi(_port);\n\n        \/\/ Connect to the db\n        MYSQL *_mysql = mysql_real_connect(\n            &mysql, _host, _username, _password, NULL,\n            port, NULL, 0);\n        if(_mysql != &mysql) {\n            fprintf(stderr, \"Could not connect to mysql: %s\\n\", mysql_error(&mysql));\n            exit(-1);\n        }\n\n        \/\/ Make sure autocommit is on\n        mysql_autocommit(&mysql, 1);\n\n        \/\/ Use the db we want (it should have been created via shared_init)\n        if(use_db(false)) {\n            \/\/ Prepare remove statement\n            remove_stmt = mysql_stmt_init(&mysql);\n            const char remove_stmt_str[] = \"DELETE FROM bench WHERE __key=?\";\n            int res = mysql_stmt_prepare(remove_stmt, remove_stmt_str, strlen(remove_stmt_str));\n            if(res != 0) {\n                fprintf(stderr, \"Could not prepare remove statement: %s\\n\",\n                        mysql_stmt_error(remove_stmt));\n                exit(-1);\n            }\n\n            \/\/ Prepare update statement\n            update_stmt = mysql_stmt_init(&mysql);\n            const char update_stmt_str[] = \"UPDATE bench SET __value=? WHERE __key=?\";\n            res = mysql_stmt_prepare(update_stmt, update_stmt_str, strlen(update_stmt_str));\n            if(res != 0) {\n                fprintf(stderr, \"Could not prepare update statement: %s\\n\",\n                        mysql_stmt_error(update_stmt));\n                exit(-1);\n            }\n\n            \/\/ Prepare insert statement\n            insert_stmt = mysql_stmt_init(&mysql);\n            const char insert_stmt_str[] = \"INSERT INTO bench VALUES (?, ?)\";\n            res = mysql_stmt_prepare(insert_stmt, insert_stmt_str, strlen(insert_stmt_str));\n            if(res != 0) {\n                fprintf(stderr, \"Could not prepare insert statement: %s\\n\",\n                        mysql_stmt_error(insert_stmt));\n                exit(-1);\n            }\n\n            \/\/ Prepare read statements for each batch factor\n            for(int bf = config->batch_factor.min; bf <= config->batch_factor.max; bf++) {\n                MYSQL_STMT *read_stmt;\n                read_stmt = mysql_stmt_init(&mysql);\n\n                \/\/ Set up the string for the current read factor\n                char read_stmt_str[8192];\n                int count = snprintf(read_stmt_str, sizeof(read_stmt_str), \"SELECT __value FROM bench WHERE __key=?\");\n                for(int i = 0; i < bf - 1; i++) {\n                    count += snprintf(read_stmt_str + count, sizeof(read_stmt_str) - count,\n                                      \" OR __key=?\");\n                }\n\n                \/\/ Prepare the actual statement\n                res = mysql_stmt_prepare(read_stmt, read_stmt_str, count);\n                if(res != 0) {\n                    fprintf(stderr, \"Could not prepare read statement: %s\\n\",\n                            mysql_stmt_error(read_stmt));\n                    exit(-1);\n                }\n                read_stmts.push_back(read_stmt);\n            }\n        }\n    }\n\n    virtual void remove(const char *key, size_t key_size) {\n        \/\/ Bind the data\n        MYSQL_BIND bind[1];\n        memset(bind, 0, sizeof(bind));\n        bind[0].buffer_type = MYSQL_TYPE_STRING;\n        bind[0].buffer = (char*)key;\n        bind[0].buffer_length = key_size;\n        bind[0].is_null = 0;\n        bind[0].length = &key_size;\n\n        int res = mysql_stmt_bind_param(remove_stmt, bind);\n        if(res != 0) {\n            fprintf(stderr, \"Could not bind remove statement\\n\");\n            exit(-1);\n        }\n\n        \/\/ Execute the statement\n        res = mysql_stmt_execute(remove_stmt);\n        if(res != 0) {\n            fprintf(stderr, \"Could not execute remove statement: %s\\n\", mysql_stmt_error(remove_stmt));\n            exit(-1);\n        }\n    }\n\n    virtual void update(const char *key, size_t key_size,\n                        const char *value, size_t value_size)\n    {\n        \/\/ Bind the data\n        MYSQL_BIND bind[2];\n        memset(bind, 0, sizeof(bind));\n        bind[0].buffer_type = MYSQL_TYPE_STRING;\n        bind[0].buffer = (char*)value;\n        bind[0].buffer_length = value_size;\n        bind[0].is_null = 0;\n        bind[0].length = &value_size;\n        bind[1].buffer_type = MYSQL_TYPE_STRING;\n        bind[1].buffer = (char*)key;\n        bind[1].buffer_length = key_size;\n        bind[1].is_null = 0;\n        bind[1].length = &key_size;\n\n        int res = mysql_stmt_bind_param(update_stmt, bind);\n        if(res != 0) {\n            fprintf(stderr, \"Could not bind update statement\\n\");\n            exit(-1);\n        }\n\n        \/\/ Execute the statement\n        res = mysql_stmt_execute(update_stmt);\n        if(res != 0) {\n            fprintf(stderr, \"Could not execute update statement: %s\\n\", mysql_stmt_error(update_stmt));\n            exit(-1);\n        }\n    }\n\n    virtual void insert(const char *key, size_t key_size,\n                        const char *value, size_t value_size)\n    {\n        \/\/ Bind the data\n        MYSQL_BIND bind[2];\n        memset(bind, 0, sizeof(bind));\n        bind[0].buffer_type = MYSQL_TYPE_STRING;\n        bind[0].buffer = (char*)key;\n        bind[0].buffer_length = key_size;\n        bind[0].is_null = 0;\n        bind[0].length = &key_size;\n        bind[1].buffer_type = MYSQL_TYPE_STRING;\n        bind[1].buffer = (char*)value;\n        bind[1].buffer_length = value_size;\n        bind[1].is_null = 0;\n        bind[1].length = &value_size;\n\n        int res = mysql_stmt_bind_param(insert_stmt, bind);\n        if(res != 0) {\n            fprintf(stderr, \"Could not bind insert statement\\n\");\n            exit(-1);\n        }\n\n        \/\/ Execute the statement\n        res = mysql_stmt_execute(insert_stmt);\n        if(res != 0) {\n            if(mysql_stmt_errno(insert_stmt) != ER_DUP_ENTRY) {\n                fprintf(stderr, \"Could not execute insert statement: %s\\n\", mysql_stmt_error(insert_stmt));\n                exit(-1);\n            }\n        }\n    }\n\n    virtual void read(payload_t *keys, int count, payload_t *values = NULL) {\n        \/\/ Bind the data\n        MYSQL_BIND bind[count];\n        memset(bind, 0, sizeof(bind));\n        for(int i = 0; i < count; i++) {\n            bind[i].buffer_type = MYSQL_TYPE_STRING;\n            bind[i].buffer = (char*)keys[i].first;\n            bind[i].buffer_length = keys[i].second;\n            bind[i].is_null = 0;\n            bind[i].length = &keys[i].second;\n        }\n\n        MYSQL_STMT *read_stmt = read_stmts[count - config->batch_factor.min];\n        int res = mysql_stmt_bind_param(read_stmt, bind);\n        if(res != 0) {\n            fprintf(stderr, \"Could not bind read statement\\n\");\n            exit(-1);\n        }\n\n        \/\/ Execute the statement\n        res = mysql_stmt_execute(read_stmt);\n        if(res != 0) {\n            fprintf(stderr, \"Could not execute read statement: %s\\n\", mysql_stmt_error(read_stmt));\n            exit(-1);\n        }\n\n        \/\/ Go through the results so we don't get out of sync errors\n        MYSQL_BIND resbind[1];\n        char buf[8192];\n        long unsigned int val_length;\n        memset(resbind, 0, sizeof(resbind));\n        resbind[0].buffer_type = MYSQL_TYPE_STRING;\n        resbind[0].buffer = buf;\n        resbind[0].buffer_length = sizeof(buf);\n        resbind[0].length = &val_length;\n\n        if(mysql_stmt_bind_result(read_stmt, resbind) != 0) {\n            fprintf(stderr, \"Could not bind read result: %s\\n\", mysql_stmt_error(read_stmt));\n            exit(-1);\n        }\n\n        \/\/ Buffer everything on the client so we don't fetch it one at a time\n        if(mysql_stmt_store_result(read_stmt)) {\n            fprintf(stderr, \"Could not buffer resultset: %s\\n\", mysql_stmt_error(read_stmt));\n            exit(-1);\n        }\n\n        while (!mysql_stmt_fetch(read_stmt)) {\n            \/\/ Ain't nothing to do, we're just fetching for kicks and\n            \/\/ giggles and avoiding out of sync issues and benchmark\n            \/\/ validity\n        }\n    }\n    virtual void append(const char *key, size_t key_size,\n                        const char *value, size_t value_size) {\n        \/\/TODO fill this in for MYSQL\n    }\n\n    virtual void prepend(const char *key, size_t key_size,\n                          const char *value, size_t value_size) {\n        \/\/TODO fill this in foir MYSQL\n    }\n\n    virtual void shared_init() {\n        if (config->in_file[0] == 0) {\n            create_schema();\n        }\n    }\n\nprivate:\n    bool use_db(bool fail_on_failure) {\n        \/\/ Use the database\n        char buf[2048];\n        snprintf(buf, sizeof(buf), \"USE %s\", _dbname);\n        int status = mysql_query(&mysql, buf);\n        if(status != 0 && !fail_on_failure) {\n            return false;\n        }\n        if(status != 0 && fail_on_failure) {\n            fprintf(stderr, \"Could not use the database.\\n\");\n            exit(-1);\n            return false;\n        }\n        else return true;\n    }\n\n    void create_schema() {\n        char buf[2048];\n\n        \/\/ Drop database if exists\n        snprintf(buf, sizeof(buf), \"DROP DATABASE IF EXISTS %s\", _dbname);\n        int status = mysql_query(&mysql, buf);\n        if(status != 0) {\n            fprintf(stderr, \"Could not drop the database.\\n\");\n            exit(-1);\n        }\n\n        \/\/ Create the database\n        snprintf(buf, sizeof(buf), \"CREATE DATABASE %s\", _dbname);\n        status = mysql_query(&mysql, buf);\n        if(status != 0) {\n            fprintf(stderr, \"Could not create the database.\\n\");\n            exit(-1);\n        }\n\n        \/\/ Use the database\n        use_db(true);\n\n        \/\/ Create the table\n        \/\/ \"INDEX __main_index (__key)) \"        \\\n\n        snprintf(buf, sizeof(buf),\n                 \"CREATE TABLE bench (__key varchar(%d), __value varchar(%d),\" \\\n                 \"PRIMARY KEY (__key)) \"                             \\\n                 \"ENGINE=InnoDB\",\n                 config->keys.calculate_max_length(config->clients - 1), config->values.max);\n        status = mysql_query(&mysql, buf);\n        if(status != 0) {\n            fprintf(stderr, \"Could not create the table.\\n\");\n            exit(-1);\n        }\n    }\n\nprivate:\n    MYSQL mysql;\n    MYSQL_STMT *remove_stmt, *update_stmt, *insert_stmt;\n    vector<MYSQL_STMT*> read_stmts;\n    char *_dbname;\n};\n\n\n#endif \/\/ __MYSQL_PROTOCOL_HPP__\n\n<commit_msg>Fix problem with MySQL protocol in stress client (crashes after initializing a new database)<commit_after>\n#ifndef __MYSQL_PROTOCOL_HPP__\n#define __MYSQL_PROTOCOL_HPP__\n\n#include <stdlib.h>\n#include <mysql\/mysql.h>\n#include <mysql\/mysqld_error.h>\n#include <vector>\n#include \"protocol.hpp\"\n\nusing namespace std;\n\nstruct mysql_protocol_t : public protocol_t {\n    mysql_protocol_t(config_t *config) : _dbname(NULL), protocol_t(config) {\n        mysql_init(&mysql);\n        initialized = false;\n    }\n\n    virtual ~mysql_protocol_t() {\n        if (initialized) {\n            for(int i = 0; i < read_stmts.size(); i++) {\n                mysql_stmt_close(read_stmts[i]);\n            }\n            mysql_stmt_close(insert_stmt);\n            mysql_stmt_close(update_stmt);\n            mysql_stmt_close(remove_stmt);\n        }\n        mysql_close(&mysql);\n    }\n\n    virtual void connect(server_t *server) {\n        \/\/ Parse the host string\n        char __host[512];\n        strcpy(__host, server->host);\n        char *_host = NULL;\n        char *_port;\n        char *_username = NULL;\n        char *_password = NULL;\n        _dbname = strstr((char*)__host, \"+\");\n        if(_dbname) {\n            *_dbname = '\\0';\n            _dbname++;\n        }\n        _port = strstr((char*)__host, \":\");\n        if(_port) {\n            *_port = '\\0';\n            _port++;\n        }\n        _host = strstr((char*)__host, \"@\");\n        if(_host) {\n            *_host = '\\0';\n            _host++;\n        }\n        _password = strstr((char*)__host, \"\/\");\n        if(_password) {\n            *_password = '\\0';\n            _password++;\n        }\n        _username = (char*)__host;\n\n        if(!_dbname || !_host || !_port || !_username || !_password) {\n            fprintf(stderr, \"Please use host string of the form username\/password@host:port+database.\\n\");\n            exit(-1);\n        }\n\n        int port = atoi(_port);\n\n        \/\/ Connect to the db\n        MYSQL *_mysql = mysql_real_connect(\n            &mysql, _host, _username, _password, NULL,\n            port, NULL, 0);\n        if(_mysql != &mysql) {\n            fprintf(stderr, \"Could not connect to mysql: %s\\n\", mysql_error(&mysql));\n            exit(-1);\n        }\n\n        \/\/ Make sure autocommit is on\n        mysql_autocommit(&mysql, 1);\n\n        \/\/ Use the db we want (it should have been created via shared_init)\n        if(use_db(false)) {\n            initialized = true;\n            \/\/ Prepare remove statement\n            remove_stmt = mysql_stmt_init(&mysql);\n            const char remove_stmt_str[] = \"DELETE FROM bench WHERE __key=?\";\n            int res = mysql_stmt_prepare(remove_stmt, remove_stmt_str, strlen(remove_stmt_str));\n            if(res != 0) {\n                fprintf(stderr, \"Could not prepare remove statement: %s\\n\",\n                        mysql_stmt_error(remove_stmt));\n                exit(-1);\n            }\n\n            \/\/ Prepare update statement\n            update_stmt = mysql_stmt_init(&mysql);\n            const char update_stmt_str[] = \"UPDATE bench SET __value=? WHERE __key=?\";\n            res = mysql_stmt_prepare(update_stmt, update_stmt_str, strlen(update_stmt_str));\n            if(res != 0) {\n                fprintf(stderr, \"Could not prepare update statement: %s\\n\",\n                        mysql_stmt_error(update_stmt));\n                exit(-1);\n            }\n\n            \/\/ Prepare insert statement\n            insert_stmt = mysql_stmt_init(&mysql);\n            const char insert_stmt_str[] = \"INSERT INTO bench VALUES (?, ?)\";\n            res = mysql_stmt_prepare(insert_stmt, insert_stmt_str, strlen(insert_stmt_str));\n            if(res != 0) {\n                fprintf(stderr, \"Could not prepare insert statement: %s\\n\",\n                        mysql_stmt_error(insert_stmt));\n                exit(-1);\n            }\n\n            \/\/ Prepare read statements for each batch factor\n            for(int bf = config->batch_factor.min; bf <= config->batch_factor.max; bf++) {\n                MYSQL_STMT *read_stmt;\n                read_stmt = mysql_stmt_init(&mysql);\n\n                \/\/ Set up the string for the current read factor\n                char read_stmt_str[8192];\n                int count = snprintf(read_stmt_str, sizeof(read_stmt_str), \"SELECT __value FROM bench WHERE __key=?\");\n                for(int i = 0; i < bf - 1; i++) {\n                    count += snprintf(read_stmt_str + count, sizeof(read_stmt_str) - count,\n                                      \" OR __key=?\");\n                }\n\n                \/\/ Prepare the actual statement\n                res = mysql_stmt_prepare(read_stmt, read_stmt_str, count);\n                if(res != 0) {\n                    fprintf(stderr, \"Could not prepare read statement: %s\\n\",\n                            mysql_stmt_error(read_stmt));\n                    exit(-1);\n                }\n                read_stmts.push_back(read_stmt);\n            }\n        }\n    }\n\n    virtual void remove(const char *key, size_t key_size) {\n        \/\/ Bind the data\n        MYSQL_BIND bind[1];\n        memset(bind, 0, sizeof(bind));\n        bind[0].buffer_type = MYSQL_TYPE_STRING;\n        bind[0].buffer = (char*)key;\n        bind[0].buffer_length = key_size;\n        bind[0].is_null = 0;\n        bind[0].length = &key_size;\n\n        int res = mysql_stmt_bind_param(remove_stmt, bind);\n        if(res != 0) {\n            fprintf(stderr, \"Could not bind remove statement\\n\");\n            exit(-1);\n        }\n\n        \/\/ Execute the statement\n        res = mysql_stmt_execute(remove_stmt);\n        if(res != 0) {\n            fprintf(stderr, \"Could not execute remove statement: %s\\n\", mysql_stmt_error(remove_stmt));\n            exit(-1);\n        }\n    }\n\n    virtual void update(const char *key, size_t key_size,\n                        const char *value, size_t value_size)\n    {\n        \/\/ Bind the data\n        MYSQL_BIND bind[2];\n        memset(bind, 0, sizeof(bind));\n        bind[0].buffer_type = MYSQL_TYPE_STRING;\n        bind[0].buffer = (char*)value;\n        bind[0].buffer_length = value_size;\n        bind[0].is_null = 0;\n        bind[0].length = &value_size;\n        bind[1].buffer_type = MYSQL_TYPE_STRING;\n        bind[1].buffer = (char*)key;\n        bind[1].buffer_length = key_size;\n        bind[1].is_null = 0;\n        bind[1].length = &key_size;\n\n        int res = mysql_stmt_bind_param(update_stmt, bind);\n        if(res != 0) {\n            fprintf(stderr, \"Could not bind update statement\\n\");\n            exit(-1);\n        }\n\n        \/\/ Execute the statement\n        res = mysql_stmt_execute(update_stmt);\n        if(res != 0) {\n            fprintf(stderr, \"Could not execute update statement: %s\\n\", mysql_stmt_error(update_stmt));\n            exit(-1);\n        }\n    }\n\n    virtual void insert(const char *key, size_t key_size,\n                        const char *value, size_t value_size)\n    {\n        \/\/ Bind the data\n        MYSQL_BIND bind[2];\n        memset(bind, 0, sizeof(bind));\n        bind[0].buffer_type = MYSQL_TYPE_STRING;\n        bind[0].buffer = (char*)key;\n        bind[0].buffer_length = key_size;\n        bind[0].is_null = 0;\n        bind[0].length = &key_size;\n        bind[1].buffer_type = MYSQL_TYPE_STRING;\n        bind[1].buffer = (char*)value;\n        bind[1].buffer_length = value_size;\n        bind[1].is_null = 0;\n        bind[1].length = &value_size;\n\n        int res = mysql_stmt_bind_param(insert_stmt, bind);\n        if(res != 0) {\n            fprintf(stderr, \"Could not bind insert statement\\n\");\n            exit(-1);\n        }\n\n        \/\/ Execute the statement\n        res = mysql_stmt_execute(insert_stmt);\n        if(res != 0) {\n            if(mysql_stmt_errno(insert_stmt) != ER_DUP_ENTRY) {\n                fprintf(stderr, \"Could not execute insert statement: %s\\n\", mysql_stmt_error(insert_stmt));\n                exit(-1);\n            }\n        }\n    }\n\n    virtual void read(payload_t *keys, int count, payload_t *values = NULL) {\n        \/\/ Bind the data\n        MYSQL_BIND bind[count];\n        memset(bind, 0, sizeof(bind));\n        for(int i = 0; i < count; i++) {\n            bind[i].buffer_type = MYSQL_TYPE_STRING;\n            bind[i].buffer = (char*)keys[i].first;\n            bind[i].buffer_length = keys[i].second;\n            bind[i].is_null = 0;\n            bind[i].length = &keys[i].second;\n        }\n\n        MYSQL_STMT *read_stmt = read_stmts[count - config->batch_factor.min];\n        int res = mysql_stmt_bind_param(read_stmt, bind);\n        if(res != 0) {\n            fprintf(stderr, \"Could not bind read statement\\n\");\n            exit(-1);\n        }\n\n        \/\/ Execute the statement\n        res = mysql_stmt_execute(read_stmt);\n        if(res != 0) {\n            fprintf(stderr, \"Could not execute read statement: %s\\n\", mysql_stmt_error(read_stmt));\n            exit(-1);\n        }\n\n        \/\/ Go through the results so we don't get out of sync errors\n        MYSQL_BIND resbind[1];\n        char buf[8192];\n        long unsigned int val_length;\n        memset(resbind, 0, sizeof(resbind));\n        resbind[0].buffer_type = MYSQL_TYPE_STRING;\n        resbind[0].buffer = buf;\n        resbind[0].buffer_length = sizeof(buf);\n        resbind[0].length = &val_length;\n\n        if(mysql_stmt_bind_result(read_stmt, resbind) != 0) {\n            fprintf(stderr, \"Could not bind read result: %s\\n\", mysql_stmt_error(read_stmt));\n            exit(-1);\n        }\n\n        \/\/ Buffer everything on the client so we don't fetch it one at a time\n        if(mysql_stmt_store_result(read_stmt)) {\n            fprintf(stderr, \"Could not buffer resultset: %s\\n\", mysql_stmt_error(read_stmt));\n            exit(-1);\n        }\n\n        while (!mysql_stmt_fetch(read_stmt)) {\n            \/\/ Ain't nothing to do, we're just fetching for kicks and\n            \/\/ giggles and avoiding out of sync issues and benchmark\n            \/\/ validity\n        }\n    }\n    virtual void append(const char *key, size_t key_size,\n                        const char *value, size_t value_size) {\n        \/\/TODO fill this in for MYSQL\n    }\n\n    virtual void prepend(const char *key, size_t key_size,\n                          const char *value, size_t value_size) {\n        \/\/TODO fill this in foir MYSQL\n    }\n\n    virtual void shared_init() {\n        if (config->in_file[0] == 0) {\n            create_schema();\n        }\n    }\n\nprivate:\n    bool use_db(bool fail_on_failure) {\n        \/\/ Use the database\n        char buf[2048];\n        snprintf(buf, sizeof(buf), \"USE %s\", _dbname);\n        int status = mysql_query(&mysql, buf);\n        if(status != 0 && !fail_on_failure) {\n            return false;\n        }\n        if(status != 0 && fail_on_failure) {\n            fprintf(stderr, \"Could not use the database.\\n\");\n            exit(-1);\n            return false;\n        }\n        else return true;\n    }\n\n    void create_schema() {\n        char buf[2048];\n\n        \/\/ Drop database if exists\n        snprintf(buf, sizeof(buf), \"DROP DATABASE IF EXISTS %s\", _dbname);\n        int status = mysql_query(&mysql, buf);\n        if(status != 0) {\n            fprintf(stderr, \"Could not drop the database.\\n\");\n            exit(-1);\n        }\n\n        \/\/ Create the database\n        snprintf(buf, sizeof(buf), \"CREATE DATABASE %s\", _dbname);\n        status = mysql_query(&mysql, buf);\n        if(status != 0) {\n            fprintf(stderr, \"Could not create the database.\\n\");\n            exit(-1);\n        }\n\n        \/\/ Use the database\n        use_db(true);\n\n        \/\/ Create the table\n        \/\/ \"INDEX __main_index (__key)) \"        \\\n\n        snprintf(buf, sizeof(buf),\n                 \"CREATE TABLE bench (__key varchar(%d), __value varchar(%d),\" \\\n                 \"PRIMARY KEY (__key)) \"                             \\\n                 \"ENGINE=InnoDB\",\n                 config->keys.calculate_max_length(config->clients - 1), config->values.max);\n        status = mysql_query(&mysql, buf);\n        if(status != 0) {\n            fprintf(stderr, \"Could not create the table.\\n\");\n            exit(-1);\n        }\n    }\n\nprivate:\n    MYSQL mysql;\n    MYSQL_STMT *remove_stmt, *update_stmt, *insert_stmt;\n    vector<MYSQL_STMT*> read_stmts;\n    char *_dbname;\n    bool initialized;\n};\n\n\n#endif \/\/ __MYSQL_PROTOCOL_HPP__\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2019 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\/\/     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#include \"sandboxed_api\/sandbox2\/notify.h\"\n\n#include <syscall.h>\n\n#include <memory>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include <glog\/logging.h>\n#include \"gmock\/gmock.h\"\n#include \"gtest\/gtest.h\"\n#include \"absl\/memory\/memory.h\"\n#include \"absl\/strings\/str_join.h\"\n#include \"sandboxed_api\/sandbox2\/comms.h\"\n#include \"sandboxed_api\/sandbox2\/executor.h\"\n#include \"sandboxed_api\/sandbox2\/policy.h\"\n#include \"sandboxed_api\/sandbox2\/policybuilder.h\"\n#include \"sandboxed_api\/sandbox2\/sandbox2.h\"\n#include \"sandboxed_api\/sandbox2\/syscall.h\"\n#include \"sandboxed_api\/sandbox2\/util\/bpf_helper.h\"\n#include \"sandboxed_api\/testing.h\"\n\nnamespace sandbox2 {\nnamespace {\n\nusing ::sapi::GetTestSourcePath;\nusing ::testing::Eq;\n\n\/\/ Allow typical syscalls and call SECCOMP_RET_TRACE for personality syscall,\n\/\/ chosen because unlikely to be called by a regular program.\nstd::unique_ptr<Policy> NotifyTestcasePolicy() {\n  return PolicyBuilder()\n      .DisableNamespaces()\n      .AllowStaticStartup()\n      .AllowDynamicStartup()  \/\/ For PrintPidAndComms\n      .AllowExit()\n      .AllowRead()\n      .AllowWrite()\n      .AllowSyscall(__NR_close)\n      .AddPolicyOnSyscall(__NR_personality, {SANDBOX2_TRACE})\n      .BlockSyscallsWithErrno(\n          {\n#ifdef __NR_open\n              __NR_open,\n#endif\n              __NR_openat,\n#ifdef __NR_access\n              __NR_access,\n#endif\n          },\n          ENOENT)\n      .BlockSyscallWithErrno(__NR_prlimit64, EPERM)\n      .BuildOrDie();\n}\n\n\/\/ If syscall and its arguments don't match the expected ones, return the\n\/\/ opposite of the requested values (allow\/disallow) to indicate an error.\nclass PersonalityNotify : public Notify {\n public:\n  explicit PersonalityNotify(bool allow) : allow_(allow) {}\n\n  bool EventSyscallTrap(const Syscall& syscall) override {\n    if (syscall.nr() != __NR_personality) {\n      LOG(ERROR) << \"kSyscall==\" << syscall.nr();\n      return (!allow_);\n    }\n    Syscall::Args expected_args = {0x1, 0x2, 0x3, 0x4, 0x5, 0x6};\n    if (syscall.args() != expected_args) {\n      LOG(ERROR) << \"args=={\" << absl::StrJoin(syscall.args(), \", \") << \"}\";\n      return (!allow_);\n    }\n    return allow_;\n  }\n\n private:\n  \/\/ The intended return value from EventSyscallTrap in case all registers\n  \/\/ match.\n  bool allow_;\n};\n\n\/\/ Print the newly created PID, and exchange data over Comms before sandboxing.\nclass PidCommsNotify : public Notify {\n public:\n  bool EventStarted(pid_t pid, Comms* comms) final {\n    LOG(INFO) << \"The newly created PID: \" << pid;\n    bool v;\n    return comms->RecvBool(&v);\n  }\n};\n\n\/\/ Test EventSyscallTrap on personality syscall and allow it.\nTEST(NotifyTest, AllowPersonality) {\n  SKIP_SANITIZERS_AND_COVERAGE;\n  const std::string path = GetTestSourcePath(\"sandbox2\/testcases\/personality\");\n  std::vector<std::string> args = {path};\n  Sandbox2 s2(absl::make_unique<Executor>(path, args), NotifyTestcasePolicy(),\n              absl::make_unique<PersonalityNotify>(\/*allow=*\/true));\n  auto result = s2.Run();\n\n  ASSERT_THAT(result.final_status(), Eq(Result::OK));\n  EXPECT_THAT(result.reason_code(), Eq(22));\n}\n\n\/\/ Test EventSyscallTrap on personality syscall and disallow it.\nTEST(NotifyTest, DisallowPersonality) {\n  SKIP_SANITIZERS_AND_COVERAGE;\n  const std::string path = GetTestSourcePath(\"sandbox2\/testcases\/personality\");\n  std::vector<std::string> args = {path};\n  Sandbox2 s2(absl::make_unique<Executor>(path, args), NotifyTestcasePolicy(),\n              absl::make_unique<PersonalityNotify>(\/*allow=*\/false));\n  auto result = s2.Run();\n\n  ASSERT_THAT(result.final_status(), Eq(Result::VIOLATION));\n  EXPECT_THAT(result.reason_code(), Eq(__NR_personality));\n}\n\n\/\/ Test EventStarted by exchanging data after started but before sandboxed.\nTEST(NotifyTest, PrintPidAndComms) {\n  SKIP_SANITIZERS_AND_COVERAGE;\n  const std::string path = GetTestSourcePath(\"sandbox2\/testcases\/pidcomms\");\n  std::vector<std::string> args = {path};\n  auto executor = absl::make_unique<Executor>(path, args);\n  executor->set_enable_sandbox_before_exec(false);\n\n  Sandbox2 s2(std::move(executor), NotifyTestcasePolicy(),\n              absl::make_unique<PidCommsNotify>());\n  auto result = s2.Run();\n\n  ASSERT_THAT(result.final_status(), Eq(Result::OK));\n  EXPECT_THAT(result.reason_code(), Eq(33));\n}\n\n}  \/\/ namespace\n}  \/\/ namespace sandbox2\n<commit_msg>Remove `AllowStaticStartup` because `AllowDynamicStartup` calls this as well<commit_after>\/\/ Copyright 2019 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\/\/     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#include \"sandboxed_api\/sandbox2\/notify.h\"\n\n#include <syscall.h>\n\n#include <memory>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include <glog\/logging.h>\n#include \"gmock\/gmock.h\"\n#include \"gtest\/gtest.h\"\n#include \"absl\/memory\/memory.h\"\n#include \"absl\/strings\/str_join.h\"\n#include \"sandboxed_api\/sandbox2\/comms.h\"\n#include \"sandboxed_api\/sandbox2\/executor.h\"\n#include \"sandboxed_api\/sandbox2\/policy.h\"\n#include \"sandboxed_api\/sandbox2\/policybuilder.h\"\n#include \"sandboxed_api\/sandbox2\/sandbox2.h\"\n#include \"sandboxed_api\/sandbox2\/syscall.h\"\n#include \"sandboxed_api\/sandbox2\/util\/bpf_helper.h\"\n#include \"sandboxed_api\/testing.h\"\n\nnamespace sandbox2 {\nnamespace {\n\nusing ::sapi::GetTestSourcePath;\nusing ::testing::Eq;\n\n\/\/ Allow typical syscalls and call SECCOMP_RET_TRACE for personality syscall,\n\/\/ chosen because unlikely to be called by a regular program.\nstd::unique_ptr<Policy> NotifyTestcasePolicy() {\n  return PolicyBuilder()\n      .DisableNamespaces()\n      .AllowDynamicStartup()  \/\/ For PrintPidAndComms and includes\n                              \/\/ AllowStaticStartup\n      .AllowExit()\n      .AllowRead()\n      .AllowWrite()\n      .AllowSyscall(__NR_close)\n      .AddPolicyOnSyscall(__NR_personality, {SANDBOX2_TRACE})\n      .BlockSyscallsWithErrno(\n          {\n#ifdef __NR_open\n              __NR_open,\n#endif\n              __NR_openat,\n#ifdef __NR_access\n              __NR_access,\n#endif\n          },\n          ENOENT)\n      .BlockSyscallWithErrno(__NR_prlimit64, EPERM)\n      .BuildOrDie();\n}\n\n\/\/ If syscall and its arguments don't match the expected ones, return the\n\/\/ opposite of the requested values (allow\/disallow) to indicate an error.\nclass PersonalityNotify : public Notify {\n public:\n  explicit PersonalityNotify(bool allow) : allow_(allow) {}\n\n  bool EventSyscallTrap(const Syscall& syscall) override {\n    if (syscall.nr() != __NR_personality) {\n      LOG(ERROR) << \"kSyscall==\" << syscall.nr();\n      return (!allow_);\n    }\n    Syscall::Args expected_args = {0x1, 0x2, 0x3, 0x4, 0x5, 0x6};\n    if (syscall.args() != expected_args) {\n      LOG(ERROR) << \"args=={\" << absl::StrJoin(syscall.args(), \", \") << \"}\";\n      return (!allow_);\n    }\n    return allow_;\n  }\n\n private:\n  \/\/ The intended return value from EventSyscallTrap in case all registers\n  \/\/ match.\n  bool allow_;\n};\n\n\/\/ Print the newly created PID, and exchange data over Comms before sandboxing.\nclass PidCommsNotify : public Notify {\n public:\n  bool EventStarted(pid_t pid, Comms* comms) final {\n    LOG(INFO) << \"The newly created PID: \" << pid;\n    bool v;\n    return comms->RecvBool(&v);\n  }\n};\n\n\/\/ Test EventSyscallTrap on personality syscall and allow it.\nTEST(NotifyTest, AllowPersonality) {\n  SKIP_SANITIZERS_AND_COVERAGE;\n  const std::string path = GetTestSourcePath(\"sandbox2\/testcases\/personality\");\n  std::vector<std::string> args = {path};\n  Sandbox2 s2(absl::make_unique<Executor>(path, args), NotifyTestcasePolicy(),\n              absl::make_unique<PersonalityNotify>(\/*allow=*\/true));\n  auto result = s2.Run();\n\n  ASSERT_THAT(result.final_status(), Eq(Result::OK));\n  EXPECT_THAT(result.reason_code(), Eq(22));\n}\n\n\/\/ Test EventSyscallTrap on personality syscall and disallow it.\nTEST(NotifyTest, DisallowPersonality) {\n  SKIP_SANITIZERS_AND_COVERAGE;\n  const std::string path = GetTestSourcePath(\"sandbox2\/testcases\/personality\");\n  std::vector<std::string> args = {path};\n  Sandbox2 s2(absl::make_unique<Executor>(path, args), NotifyTestcasePolicy(),\n              absl::make_unique<PersonalityNotify>(\/*allow=*\/false));\n  auto result = s2.Run();\n\n  ASSERT_THAT(result.final_status(), Eq(Result::VIOLATION));\n  EXPECT_THAT(result.reason_code(), Eq(__NR_personality));\n}\n\n\/\/ Test EventStarted by exchanging data after started but before sandboxed.\nTEST(NotifyTest, PrintPidAndComms) {\n  SKIP_SANITIZERS_AND_COVERAGE;\n  const std::string path = GetTestSourcePath(\"sandbox2\/testcases\/pidcomms\");\n  std::vector<std::string> args = {path};\n  auto executor = absl::make_unique<Executor>(path, args);\n  executor->set_enable_sandbox_before_exec(false);\n\n  Sandbox2 s2(std::move(executor), NotifyTestcasePolicy(),\n              absl::make_unique<PidCommsNotify>());\n  auto result = s2.Run();\n\n  ASSERT_THAT(result.final_status(), Eq(Result::OK));\n  EXPECT_THAT(result.reason_code(), Eq(33));\n}\n\n}  \/\/ namespace\n}  \/\/ namespace sandbox2\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\/\/ ospray\n#include \"Device.h\"\n#include \"common\/OSPCommon.h\"\n#include \"common\/Util.h\"\n\/\/ ospcommon\n#include \"ospcommon\/utility\/getEnvVar.h\"\n#include \"ospcommon\/sysinfo.h\"\n#include \"ospcommon\/tasking\/tasking_system_handle.h\"\n\/\/ embree\n#include \"embree2\/rtcore.h\"\n\n#include <map>\n\nnamespace ospray {\n  namespace api {\n\n    \/\/ Helper functions \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n    template <typename OSTREAM_T>\n    static inline void installStatusMsgFunc(OSTREAM_T &stream)\n    {\n      auto &device = currentDevice();\n      device.msg_fcn = [&](const char *msg){ stream << msg; };\n    }\n\n    template <typename OSTREAM_T>\n    static inline void installErrorMsgFunc(OSTREAM_T &stream)\n    {\n      auto &device = currentDevice();\n      device.error_fcn = [&](OSPError e, const char *msg) {\n        stream << \"OSPRAY ERROR [\" << e << \"]: \" << msg << std::endl;\n      };\n    }\n\n    \/\/ Device definitions \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n    Ref<Device> Device::current = nullptr;\n\n    RTCDevice Device::embreeDevice = nullptr;\n    uint32_t Device::logLevel = 0;\n\n    Device::~Device()\n    {\n      if (embreeDevice) rtcDeleteDevice(embreeDevice);\n    }\n\n    Device *Device::createDevice(const char *type)\n    {\n      return createInstanceHelper<Device, OSP_DEVICE>(type);\n    }\n\n    void Device::commit()\n    {\n      int cpuFeatures = ospcommon::getCPUFeatures();\n\n      if ((cpuFeatures & ospcommon::CPU_FEATURE_SSE41) == 0) {\n        handleError(OSP_UNSUPPORTED_CPU,\n                    \"OSPRay only runs on CPUs that support at least SSE4.1\");\n        return;\n      }\n\n      auto OSPRAY_DEBUG = utility::getEnvVar<int>(\"OSPRAY_DEBUG\");\n      debugMode = OSPRAY_DEBUG.value_or(getParam1i(\"debug\", 0));\n\n      auto OSPRAY_TRACE_API = utility::getEnvVar<int>(\"OSPRAY_TRACE_API\");\n      bool traceAPI = OSPRAY_TRACE_API.value_or(getParam1i(\"traceApi\", 0));\n\n      if (traceAPI) {\n        auto streamPtr =\n          std::make_shared<std::ofstream>(\"ospray_api_trace.txt\");\n\n        trace_fcn = [=](const char *message) {\n          auto &stream = *streamPtr;\n          stream << message << std::endl;\n        };\n      }\n\n      auto OSPRAY_LOG_LEVEL = utility::getEnvVar<int>(\"OSPRAY_LOG_LEVEL\");\n      logLevel = OSPRAY_LOG_LEVEL.value_or(getParam1i(\"logLevel\", 0));\n\n      auto OSPRAY_THREADS = utility::getEnvVar<int>(\"OSPRAY_THREADS\");\n      numThreads = OSPRAY_THREADS.value_or(getParam1i(\"numThreads\", -1));\n\n      auto OSPRAY_LOG_OUTPUT =\n          utility::getEnvVar<std::string>(\"OSPRAY_LOG_OUTPUT\");\n\n      auto dst = OSPRAY_LOG_OUTPUT.value_or(getParamString(\"logOutput\"));\n      if (dst == \"cout\")\n        installStatusMsgFunc(std::cout);\n      else if (dst == \"cerr\")\n        installStatusMsgFunc(std::cerr);\n      else if (dst == \"none\")\n        msg_fcn = [](const char*){};\n\n      auto OSPRAY_ERROR_OUTPUT =\n          utility::getEnvVar<std::string>(\"OSPRAY_ERROR_OUTPUT\");\n\n      dst = OSPRAY_ERROR_OUTPUT.value_or(getParamString(\"errorOutput\"));\n      if (dst == \"cout\")\n        installErrorMsgFunc(std::cout);\n      else if (dst == \"cerr\")\n        installErrorMsgFunc(std::cerr);\n      else if (dst == \"none\")\n        error_fcn = [](OSPError, const char*){};\n\n      if (debugMode) {\n        logLevel   = 2;\n        numThreads = 1;\n      }\n\n      auto OSPRAY_SET_AFFINITY = utility::getEnvVar<int>(\"OSPRAY_SET_AFFINITY\");\n      if (OSPRAY_SET_AFFINITY) {\n        threadAffinity = OSPRAY_SET_AFFINITY.value() == 0 ? DEAFFINITIZE :\n                                                            AFFINITIZE;\n      }\n\n      threadAffinity = getParam1i(\"setAffinity\", threadAffinity);\n\n      tasking::initTaskingSystem(numThreads);\n\n      committed = true;\n    }\n\n    bool Device::isCommitted()\n    {\n      return committed;\n    }\n\n    bool deviceIsSet()\n    {\n      return Device::current.ptr != nullptr;\n    }\n\n    Device &currentDevice()\n    {\n      return *Device::current;\n    }\n\n    std::string generateEmbreeDeviceCfg(const Device &device)\n    {\n      std::stringstream embreeConfig;\n\n      if (device.debugMode)\n        embreeConfig << \" threads=1,verbose=2\";\n      else if(device.numThreads > 0)\n        embreeConfig << \" threads=\" << device.numThreads;\n\n      if (device.threadAffinity == api::Device::AFFINITIZE)\n        embreeConfig << \",set_affinity=1\";\n      else if (device.threadAffinity == api::Device::DEAFFINITIZE)\n        embreeConfig << \",set_affinity=0\";\n\n      return embreeConfig.str();\n    }\n\n  } \/\/ ::ospray::api\n} \/\/ ::ospray\n<commit_msg>Fix segfault when logging enabled. Functions tried to use unset currentDevice.<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\/\/ ospray\n#include \"Device.h\"\n#include \"common\/OSPCommon.h\"\n#include \"common\/Util.h\"\n\/\/ ospcommon\n#include \"ospcommon\/utility\/getEnvVar.h\"\n#include \"ospcommon\/sysinfo.h\"\n#include \"ospcommon\/tasking\/tasking_system_handle.h\"\n\/\/ embree\n#include \"embree2\/rtcore.h\"\n\n#include <map>\n\nnamespace ospray {\n  namespace api {\n\n    \/\/ Helper functions \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n    template <typename OSTREAM_T>\n    static inline void installStatusMsgFunc(Device& device, OSTREAM_T &stream)\n    {\n      device.msg_fcn = [&](const char *msg){ stream << msg; };\n    }\n\n    template <typename OSTREAM_T>\n    static inline void installErrorMsgFunc(Device& device, OSTREAM_T &stream)\n    {\n      device.error_fcn = [&](OSPError e, const char *msg) {\n        stream << \"OSPRAY ERROR [\" << e << \"]: \" << msg << std::endl;\n      };\n    }\n\n    \/\/ Device definitions \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n    Ref<Device> Device::current = nullptr;\n\n    RTCDevice Device::embreeDevice = nullptr;\n    uint32_t Device::logLevel = 0;\n\n    Device::~Device()\n    {\n      if (embreeDevice) rtcDeleteDevice(embreeDevice);\n    }\n\n    Device *Device::createDevice(const char *type)\n    {\n      return createInstanceHelper<Device, OSP_DEVICE>(type);\n    }\n\n    void Device::commit()\n    {\n      int cpuFeatures = ospcommon::getCPUFeatures();\n\n      if ((cpuFeatures & ospcommon::CPU_FEATURE_SSE41) == 0) {\n        handleError(OSP_UNSUPPORTED_CPU,\n                    \"OSPRay only runs on CPUs that support at least SSE4.1\");\n        return;\n      }\n\n      auto OSPRAY_DEBUG = utility::getEnvVar<int>(\"OSPRAY_DEBUG\");\n      debugMode = OSPRAY_DEBUG.value_or(getParam1i(\"debug\", 0));\n\n      auto OSPRAY_TRACE_API = utility::getEnvVar<int>(\"OSPRAY_TRACE_API\");\n      bool traceAPI = OSPRAY_TRACE_API.value_or(getParam1i(\"traceApi\", 0));\n\n      if (traceAPI) {\n        auto streamPtr =\n          std::make_shared<std::ofstream>(\"ospray_api_trace.txt\");\n\n        trace_fcn = [=](const char *message) {\n          auto &stream = *streamPtr;\n          stream << message << std::endl;\n        };\n      }\n\n      auto OSPRAY_LOG_LEVEL = utility::getEnvVar<int>(\"OSPRAY_LOG_LEVEL\");\n      logLevel = OSPRAY_LOG_LEVEL.value_or(getParam1i(\"logLevel\", 0));\n\n      auto OSPRAY_THREADS = utility::getEnvVar<int>(\"OSPRAY_THREADS\");\n      numThreads = OSPRAY_THREADS.value_or(getParam1i(\"numThreads\", -1));\n\n      auto OSPRAY_LOG_OUTPUT =\n          utility::getEnvVar<std::string>(\"OSPRAY_LOG_OUTPUT\");\n\n      auto dst = OSPRAY_LOG_OUTPUT.value_or(getParamString(\"logOutput\"));\n      if (dst == \"cout\")\n        installStatusMsgFunc(*this, std::cout);\n      else if (dst == \"cerr\")\n        installStatusMsgFunc(*this, std::cerr);\n      else if (dst == \"none\")\n        msg_fcn = [](const char*){};\n\n      auto OSPRAY_ERROR_OUTPUT =\n          utility::getEnvVar<std::string>(\"OSPRAY_ERROR_OUTPUT\");\n\n      dst = OSPRAY_ERROR_OUTPUT.value_or(getParamString(\"errorOutput\"));\n      if (dst == \"cout\")\n        installErrorMsgFunc(*this, std::cout);\n      else if (dst == \"cerr\")\n        installErrorMsgFunc(*this, std::cerr);\n      else if (dst == \"none\")\n        error_fcn = [](OSPError, const char*){};\n\n      if (debugMode) {\n        logLevel   = 2;\n        numThreads = 1;\n      }\n\n      auto OSPRAY_SET_AFFINITY = utility::getEnvVar<int>(\"OSPRAY_SET_AFFINITY\");\n      if (OSPRAY_SET_AFFINITY) {\n        threadAffinity = OSPRAY_SET_AFFINITY.value() == 0 ? DEAFFINITIZE :\n                                                            AFFINITIZE;\n      }\n\n      threadAffinity = getParam1i(\"setAffinity\", threadAffinity);\n\n      tasking::initTaskingSystem(numThreads);\n\n      committed = true;\n    }\n\n    bool Device::isCommitted()\n    {\n      return committed;\n    }\n\n    bool deviceIsSet()\n    {\n      return Device::current.ptr != nullptr;\n    }\n\n    Device &currentDevice()\n    {\n      return *Device::current;\n    }\n\n    std::string generateEmbreeDeviceCfg(const Device &device)\n    {\n      std::stringstream embreeConfig;\n\n      if (device.debugMode)\n        embreeConfig << \" threads=1,verbose=2\";\n      else if(device.numThreads > 0)\n        embreeConfig << \" threads=\" << device.numThreads;\n\n      if (device.threadAffinity == api::Device::AFFINITIZE)\n        embreeConfig << \",set_affinity=1\";\n      else if (device.threadAffinity == api::Device::DEAFFINITIZE)\n        embreeConfig << \",set_affinity=0\";\n\n      return embreeConfig.str();\n    }\n\n  } \/\/ ::ospray::api\n} \/\/ ::ospray\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2011-2012, Zeex\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\/\/ 1. Redistributions of source code must retain the above copyright notice, this\r\n\/\/    list of conditions and the following disclaimer. \r\n\/\/ 2. 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\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\r\n\/\/ ANY 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 THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\r\n\/\/ ANY 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#include <cassert>\r\n#include <cstdarg>\r\n#include <cstdio>\r\n#include <cstdlib>\r\n#include <cstring>\r\n#include <fstream>\r\n#include <map>\r\n#include <stack>\r\n#include <string>\r\n#include <vector>\r\n\r\n#include \"amxdebuginfo.h\"\r\n#include \"amxpathfinder.h\"\r\n#include \"amxstacktrace.h\"\r\n#include \"amxutils.h\"\r\n#include \"compiler.h\"\r\n#include \"configreader.h\"\r\n#include \"crashdetect.h\"\r\n#include \"fileutils.h\"\r\n#include \"logprintf.h\"\r\n#include \"os.h\"\r\n#include \"stacktrace.h\"\r\n\r\n#include \"amx\/amx.h\"\r\n#include \"amx\/amxaux.h\" \/\/ for amx_StrError()\r\n\r\n#define AMX_EXEC_GDK (-10)\r\n\r\nstatic const char *kLogMessagePrefix = \"[debug] \";\r\nstatic const char *kServerConfig = \"server.cfg\";\r\n\r\nbool crashdetect::errorCaught_ = false;\r\nstd::stack<crashdetect::NPCall> crashdetect::npCalls_;\r\nConfigReader crashdetect::serverCfg(kServerConfig);\r\ncrashdetect::InstanceMap crashdetect::instances_;\r\n\r\n\/\/ static\r\ncrashdetect *crashdetect::GetInstance(AMX *amx) {\r\n\tInstanceMap::const_iterator iterator = instances_.find(amx);\r\n\tif (iterator == instances_.end()) {\r\n\t\tcrashdetect *c = new crashdetect(amx);\r\n\t\tinstances_.insert(std::make_pair(amx, c));\r\n\t\treturn c;\r\n\t} \r\n\treturn iterator->second;\r\n}\r\n\r\n\/\/ static\r\nvoid crashdetect::DestroyInstance(AMX *amx) {\r\n\tinstances_.erase(amx);\r\n}\r\n\r\n\/\/ static\r\nvoid crashdetect::SystemException(void *context) {\r\n\tif (!npCalls_.empty()) {\r\n\t\tAMX *amx = npCalls_.top().amx();\r\n\t\tGetInstance(amx)->HandleCrash();\r\n\t} else {\r\n\t\tlogprintf(\"Server crashed due to an unknown error\");\r\n\t}\r\n\tPrintNativeBacktrace(context);\r\n}\r\n\r\n\/\/ static\r\nvoid crashdetect::SystemInterrupt() {\t\r\n\tif (!npCalls_.empty()) {\r\n\t\tAMX *amx = npCalls_.top().amx();\r\n\t\tGetInstance(amx)->HandleInterrupt();\r\n\t} else {\r\n\t\tlogprintf(\"Server recieved an interrupt signal\");\r\n\t}\t\r\n\tPrintNativeBacktrace();\r\n}\r\n\r\n\/\/ static\r\nvoid crashdetect::DieOrContinue() {\r\n\tif (serverCfg.GetOption(\"die_on_error\", false)) {\r\n\t\tlogprintf(\"Aborting...\");\r\n\t\tstd::exit(EXIT_FAILURE);\r\n\t}\r\n}\r\n\r\ncrashdetect::crashdetect(AMX *amx) \r\n\t: amx_(amx)\r\n\t, amxhdr_(reinterpret_cast<AMX_HEADER*>(amx->base))\r\n{\r\n\tAMXPathFinder pathFinder;\r\n\tpathFinder.AddSearchPath(\"gamemodes\/\");\r\n\tpathFinder.AddSearchPath(\"filterscripts\/\");\r\n\r\n\tamxPath_ = pathFinder.FindAMX(amx);\r\n\tamxName_ = fileutils::GetFileName(amxPath_);\r\n\r\n\tif (!amxPath_.empty()) {\r\n\t\tuint16_t flags;\r\n\t\tamx_Flags(amx_, &flags);\r\n\t\tif ((flags & AMX_FLAG_DEBUG) != 0) {\r\n\t\t\tdebugInfo_.Load(amxPath_);\r\n\t\t}\r\n\t}\r\n\r\n\tamx_->sysreq_d = 0;\r\n\tprevCallback_ = amx_->callback;\t\r\n}\r\n\r\nint crashdetect::HandleAmxCallback(cell index, cell *result, cell *params) {\r\n\tnpCalls_.push(NPCall(NPCall::NATIVE, amx_, index, amx_->frm, amx_->cip));\r\n\tint retcode = prevCallback_(amx_, index, result, params);\t\r\n\tnpCalls_.pop();\r\n\treturn retcode;\r\n}\r\n\r\nint crashdetect::HandleAmxExec(cell *retval, int index) {\r\n\tnpCalls_.push(NPCall(NPCall::PUBLIC, amx_, index, amx_->frm, amx_->cip));\r\n\r\n\tint retcode = ::amx_Exec(amx_, retval, index);\r\n\tif (retcode != AMX_ERR_NONE && !errorCaught_) {\r\n\t\tamx_Error(amx_, index, retcode);\t\t\r\n\t} else {\r\n\t\terrorCaught_ = false;\r\n\t}\r\n\r\n\tnpCalls_.pop();\t\r\n\treturn retcode;\r\n}\r\n\r\nint crashdetect::HandleAmxRelease(cell amx_addr, void *releaser) {\r\n\tif (amx_addr < amx_->hlw || amx_addr >= amx_->stk) {\r\n\t\tHandleReleaseError(amx_addr, releaser);\r\n\t}\r\n\treturn amx_Release(amx_, amx_addr);\r\n}\r\n\r\nvoid crashdetect::HandleRuntimeError(int index, int error) {\r\n\tcrashdetect::errorCaught_ = true;\r\n\r\n\tif (error == AMX_ERR_INDEX && index == AMX_EXEC_GDK) {\r\n\t\terror = AMX_ERR_NONE;\r\n\t\treturn;\r\n\t}\r\n\r\n\tlogprintf(\"Run time error %d: \\\"%s\\\"\", error, aux_StrError(error));\r\n\r\n\tswitch (error) {\r\n\t\tcase AMX_ERR_BOUNDS: {\r\n\t\t\tcell bound = *(reinterpret_cast<cell*>(amx_->cip + amx_->base + amxhdr_->cod + sizeof(cell)));\r\n\t\t\tcell index = amx_->pri;\r\n\t\t\tif (index < 0) {\r\n\t\t\t\tlogprintf(\"  Accessing element at negative index %d\", index);\r\n\t\t\t} else {\r\n\t\t\t\tlogprintf(\"  Accessing element at index %d past array upper bound %d\", index, bound);\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tcase AMX_ERR_NOTFOUND: {\r\n\t\t\tAMX_FUNCSTUBNT *natives = reinterpret_cast<AMX_FUNCSTUBNT*>(amx_->base + amxhdr_->natives);\r\n\t\t\tint numNatives = 0;\r\n\t\t\tamx_NumNatives(amx_, &numNatives);\r\n\t\t\tfor (int i = 0; i < numNatives; ++i) {\r\n\t\t\t\tif (natives[i].address == 0) {\r\n\t\t\t\t\tchar *name = reinterpret_cast<char*>(natives[i].nameofs + amx_->base);\r\n\t\t\t\t\tlogprintf(\"  %s\", name);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tcase AMX_ERR_STACKERR:\r\n\t\t\tlogprintf(\"  Stack index (STK) is 0x%X, heap index (HEA) is 0x%X\", amx_->stk, amx_->hea); \r\n\t\t\tbreak;\r\n\t\tcase AMX_ERR_STACKLOW:\r\n\t\t\tlogprintf(\"  Stack index (STK) is 0x%X, stack top (STP) is 0x%X\", amx_->stk, amx_->stp);\r\n\t\t\tbreak;\r\n\t\tcase AMX_ERR_HEAPLOW:\r\n\t\t\tlogprintf(\"  Heap index (HEA) is 0x%X, heap bottom (HLW) is 0x%X\", amx_->hea, amx_->hlw);\r\n\t\t\tbreak;\r\n\t\tcase AMX_ERR_INVINSTR: {\r\n\t\t\tcell opcode = *(reinterpret_cast<cell*>(amx_->cip + amx_->base + amxhdr_->cod));\r\n\t\t\tlogprintf(\"  Unknown opcode 0x%x at address 0x%08X\", opcode , amx_->cip);\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\r\n\tif (error != AMX_ERR_NOTFOUND &&\r\n\t\terror != AMX_ERR_INDEX &&\r\n\t\terror != AMX_ERR_CALLBACK &&\r\n\t\terror != AMX_ERR_INIT) \r\n\t{\r\n\t\tPrintAmxBacktrace();\t\t\t\r\n\t}\r\n\r\n\tstd::string command = serverCfg.GetOption(\"run_on_error\", std::string());\r\n\tif (!command.empty()) {\r\n\t\tstd::system(command.c_str());\r\n\t}\r\n\r\n\tDieOrContinue();\r\n}\r\n\r\nvoid crashdetect::HandleCrash() {\r\n\tlogprintf(\"Server crashed while executing %s\", amxName_.c_str());\r\n\tPrintAmxBacktrace();\r\n}\r\n\r\nvoid crashdetect::HandleInterrupt() {\r\n\tlogprintf(\"Server recieved interrupt signal while executing %s\", amxName_.c_str());\r\n\tPrintAmxBacktrace();\r\n}\r\n\r\nvoid crashdetect::HandleReleaseError(cell address, void *releaser) {\r\n\tstd::string plugin = fileutils::GetFileName(os::GetModulePath(releaser));\r\n\tif (plugin.empty()) {\r\n\t\tplugin.assign(\"<unknown>\");\r\n\t}\r\n\tlogprintf(\"Heap corruption detected:\");\r\n\tlogprintf(\"  %s [%08x] is trying to release memory at %08x\", plugin.c_str(), releaser, address);\r\n}\r\n\r\n\/\/ static\r\nvoid crashdetect::PrintAmxBacktrace() {\r\n\tif (npCalls_.empty()) {\r\n\t\treturn;\r\n\t}\r\n\r\n\tlogprintf(\"AMX backtrace:\");\r\n\r\n\tstd::stack<NPCall> npCallStack = npCalls_;\r\n\tcell frm = npCallStack.top().amx()->frm;\r\n\tcell cip = npCallStack.top().amx()->cip;\r\n\tint level = 0;\r\n\r\n\twhile (!npCallStack.empty()) {\r\n\t\tNPCall call = npCallStack.top();\r\n\r\n\t\tif (call.amx() != npCallStack.top().amx()) {\r\n\t\t\tassert(level != 0);\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tif (call.type() == NPCall::NATIVE) {\t\t\t\r\n\t\t\tAMX_NATIVE address = amxutils::GetNativeAddress(call.amx(), call.index());\r\n\t\t\tif (address != 0) {\t\t\t\t\r\n\t\t\t\tstd::string module = fileutils::GetFileName(os::GetModulePath((void*)address));\r\n\t\t\t\tstd::string from = \" from \" + module;\r\n\t\t\t\tif (module.empty()) {\r\n\t\t\t\t\tfrom.clear();\r\n\t\t\t\t}\t\t\t\t\r\n\t\t\t\tconst char *name = amxutils::GetNativeName(call.amx(), call.index());\r\n\t\t\t\tif (name != 0) {\r\n\t\t\t\t\tlogprintf(\"#%-2d native %s () [%08x]%s\", level++, name, address, from.c_str());\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t} else if (call.type() == NPCall::PUBLIC) {\r\n\t\t\tAMXDebugInfo &debugInfo = instances_[call.amx()]->debugInfo_;\r\n\r\n\t\t\tamxutils::PushStack(call.amx(), cip); \/\/ push return address\r\n\t\t\tamxutils::PushStack(call.amx(), frm); \/\/ push frame pointer\r\n\t\t\tfrm = call.amx()->stk;\r\n\r\n\t\t\tAMXStackTrace trace(call.amx(), debugInfo, frm);\r\n\t\t\tstd::deque<AMXStackFrame> frames = trace.GetFrames();\r\n\r\n\t\t\tfrm = amxutils::PopStack(call.amx()); \/\/ pop frame pointer\r\n\t\t\tcip = amxutils::PopStack(call.amx()); \/\/ pop return address\r\n\r\n\t\t\tif (frames.empty()) {\r\n\t\t\t\tucell epAddr = amxutils::GetPublicAddress(call.amx(), call.index());\r\n\t\t\t\tframes.push_front(AMXStackFrame(call.amx(), frm, cip, epAddr, debugInfo));\r\n\t\t\t} else {\r\n\t\t\t\tif (!debugInfo.IsLoaded()) {\r\n\t\t\t\t\tAMXStackFrame &bottom = frames.back();\r\n\t\t\t\t\tbottom = AMXStackFrame(call.amx(), \r\n\t\t\t\t\t\tbottom.GetFrameAddress(), \r\n\t\t\t\t\t\tbottom.GetReturnAddress(),\r\n\t\t\t\t\t\tamxutils::GetPublicAddress(call.amx(), call.index()),\r\n\t\t\t\t\t\tdebugInfo);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tstd::string &amxName = instances_[call.amx()]->amxName_;\r\n\t\t\tfor (size_t i = 0; i < frames.size(); i++) {\r\n\t\t\t\tstd::string from = \" from \" + amxName;\r\n\t\t\t\tif (amxName.empty() || debugInfo.IsLoaded()) {\r\n\t\t\t\t\tfrom.clear();\r\n\t\t\t\t}\r\n\t\t\t\tlogprintf(\"#%-2d %s%s\", level++, frames[i].GetString().c_str(), from.c_str());\r\n\t\t\t}\r\n\r\n\t\t\tfrm = call.frm();\r\n\t\t\tcip = call.cip();\r\n\t\t}\r\n\t\tnpCallStack.pop();\t\t\r\n\t}\r\n}\r\n\r\n\/\/ static\r\nvoid crashdetect::PrintNativeBacktrace(void *context) {\r\n\tlogprintf(\"Native backtrace:\");\r\n\r\n\tint level = 0;\r\n\r\n\tStackTrace trace(0, 0, context);\r\n\tstd::deque<StackFrame> frames = trace.GetFrames();\t\r\n\r\n\tfor (std::deque<StackFrame>::const_iterator iterator = frames.begin();\r\n\t\t\titerator != frames.end(); ++iterator) {\r\n\t\tconst StackFrame &frame = *iterator;\r\n\r\n\t\tstd::string module = os::GetModulePath(frame.GetReturnAddress());\r\n\t\tstd::string from = \" from \" + module;\r\n\t\tif (module.empty()) {\r\n\t\t\tfrom.clear();\r\n\t\t}\r\n\r\n\t\tlogprintf(\"#%-2d %s%s\", level++, frame.GetString().c_str(), from.c_str());\r\n\t}\r\n}\r\n\r\n\/\/ static\r\nvoid crashdetect::logprintf(const char *format, ...) {\r\n\tstd::va_list args;\r\n\tva_start(args, format);\r\n\r\n\tstd::string prefixed_format;\r\n\tprefixed_format.append(kLogMessagePrefix);\r\n\tprefixed_format.append(format);\r\n\r\n\t::vlogprintf(prefixed_format.c_str(), args);\r\n\r\n\tva_end(args);\r\n}\r\n<commit_msg>Print native backtrace on amx_Release() errors<commit_after>\/\/ Copyright (c) 2011-2012, Zeex\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\/\/ 1. Redistributions of source code must retain the above copyright notice, this\r\n\/\/    list of conditions and the following disclaimer. \r\n\/\/ 2. 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\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\r\n\/\/ ANY 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 THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\r\n\/\/ ANY 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#include <cassert>\r\n#include <cstdarg>\r\n#include <cstdio>\r\n#include <cstdlib>\r\n#include <cstring>\r\n#include <fstream>\r\n#include <map>\r\n#include <stack>\r\n#include <string>\r\n#include <vector>\r\n\r\n#include \"amxdebuginfo.h\"\r\n#include \"amxpathfinder.h\"\r\n#include \"amxstacktrace.h\"\r\n#include \"amxutils.h\"\r\n#include \"compiler.h\"\r\n#include \"configreader.h\"\r\n#include \"crashdetect.h\"\r\n#include \"fileutils.h\"\r\n#include \"logprintf.h\"\r\n#include \"os.h\"\r\n#include \"stacktrace.h\"\r\n\r\n#include \"amx\/amx.h\"\r\n#include \"amx\/amxaux.h\" \/\/ for amx_StrError()\r\n\r\n#define AMX_EXEC_GDK (-10)\r\n\r\nstatic const char *kLogMessagePrefix = \"[debug] \";\r\nstatic const char *kServerConfig = \"server.cfg\";\r\n\r\nbool crashdetect::errorCaught_ = false;\r\nstd::stack<crashdetect::NPCall> crashdetect::npCalls_;\r\nConfigReader crashdetect::serverCfg(kServerConfig);\r\ncrashdetect::InstanceMap crashdetect::instances_;\r\n\r\n\/\/ static\r\ncrashdetect *crashdetect::GetInstance(AMX *amx) {\r\n\tInstanceMap::const_iterator iterator = instances_.find(amx);\r\n\tif (iterator == instances_.end()) {\r\n\t\tcrashdetect *c = new crashdetect(amx);\r\n\t\tinstances_.insert(std::make_pair(amx, c));\r\n\t\treturn c;\r\n\t} \r\n\treturn iterator->second;\r\n}\r\n\r\n\/\/ static\r\nvoid crashdetect::DestroyInstance(AMX *amx) {\r\n\tinstances_.erase(amx);\r\n}\r\n\r\n\/\/ static\r\nvoid crashdetect::SystemException(void *context) {\r\n\tif (!npCalls_.empty()) {\r\n\t\tAMX *amx = npCalls_.top().amx();\r\n\t\tGetInstance(amx)->HandleCrash();\r\n\t} else {\r\n\t\tlogprintf(\"Server crashed due to an unknown error\");\r\n\t}\r\n\tPrintNativeBacktrace(context);\r\n}\r\n\r\n\/\/ static\r\nvoid crashdetect::SystemInterrupt() {\t\r\n\tif (!npCalls_.empty()) {\r\n\t\tAMX *amx = npCalls_.top().amx();\r\n\t\tGetInstance(amx)->HandleInterrupt();\r\n\t} else {\r\n\t\tlogprintf(\"Server recieved an interrupt signal\");\r\n\t}\t\r\n\tPrintNativeBacktrace();\r\n}\r\n\r\n\/\/ static\r\nvoid crashdetect::DieOrContinue() {\r\n\tif (serverCfg.GetOption(\"die_on_error\", false)) {\r\n\t\tlogprintf(\"Aborting...\");\r\n\t\tstd::exit(EXIT_FAILURE);\r\n\t}\r\n}\r\n\r\ncrashdetect::crashdetect(AMX *amx) \r\n\t: amx_(amx)\r\n\t, amxhdr_(reinterpret_cast<AMX_HEADER*>(amx->base))\r\n{\r\n\tAMXPathFinder pathFinder;\r\n\tpathFinder.AddSearchPath(\"gamemodes\/\");\r\n\tpathFinder.AddSearchPath(\"filterscripts\/\");\r\n\r\n\tamxPath_ = pathFinder.FindAMX(amx);\r\n\tamxName_ = fileutils::GetFileName(amxPath_);\r\n\r\n\tif (!amxPath_.empty()) {\r\n\t\tuint16_t flags;\r\n\t\tamx_Flags(amx_, &flags);\r\n\t\tif ((flags & AMX_FLAG_DEBUG) != 0) {\r\n\t\t\tdebugInfo_.Load(amxPath_);\r\n\t\t}\r\n\t}\r\n\r\n\tamx_->sysreq_d = 0;\r\n\tprevCallback_ = amx_->callback;\t\r\n}\r\n\r\nint crashdetect::HandleAmxCallback(cell index, cell *result, cell *params) {\r\n\tnpCalls_.push(NPCall(NPCall::NATIVE, amx_, index, amx_->frm, amx_->cip));\r\n\tint retcode = prevCallback_(amx_, index, result, params);\t\r\n\tnpCalls_.pop();\r\n\treturn retcode;\r\n}\r\n\r\nint crashdetect::HandleAmxExec(cell *retval, int index) {\r\n\tnpCalls_.push(NPCall(NPCall::PUBLIC, amx_, index, amx_->frm, amx_->cip));\r\n\r\n\tint retcode = ::amx_Exec(amx_, retval, index);\r\n\tif (retcode != AMX_ERR_NONE && !errorCaught_) {\r\n\t\tamx_Error(amx_, index, retcode);\t\t\r\n\t} else {\r\n\t\terrorCaught_ = false;\r\n\t}\r\n\r\n\tnpCalls_.pop();\t\r\n\treturn retcode;\r\n}\r\n\r\nint crashdetect::HandleAmxRelease(cell amx_addr, void *releaser) {\r\n\tif (amx_addr < amx_->hlw || amx_addr >= amx_->stk) {\r\n\t\tHandleReleaseError(amx_addr, releaser);\r\n\t}\r\n\treturn amx_Release(amx_, amx_addr);\r\n}\r\n\r\nvoid crashdetect::HandleRuntimeError(int index, int error) {\r\n\tcrashdetect::errorCaught_ = true;\r\n\r\n\tif (error == AMX_ERR_INDEX && index == AMX_EXEC_GDK) {\r\n\t\terror = AMX_ERR_NONE;\r\n\t\treturn;\r\n\t}\r\n\r\n\tlogprintf(\"Run time error %d: \\\"%s\\\"\", error, aux_StrError(error));\r\n\r\n\tswitch (error) {\r\n\t\tcase AMX_ERR_BOUNDS: {\r\n\t\t\tcell bound = *(reinterpret_cast<cell*>(amx_->cip + amx_->base + amxhdr_->cod + sizeof(cell)));\r\n\t\t\tcell index = amx_->pri;\r\n\t\t\tif (index < 0) {\r\n\t\t\t\tlogprintf(\"  Accessing element at negative index %d\", index);\r\n\t\t\t} else {\r\n\t\t\t\tlogprintf(\"  Accessing element at index %d past array upper bound %d\", index, bound);\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tcase AMX_ERR_NOTFOUND: {\r\n\t\t\tAMX_FUNCSTUBNT *natives = reinterpret_cast<AMX_FUNCSTUBNT*>(amx_->base + amxhdr_->natives);\r\n\t\t\tint numNatives = 0;\r\n\t\t\tamx_NumNatives(amx_, &numNatives);\r\n\t\t\tfor (int i = 0; i < numNatives; ++i) {\r\n\t\t\t\tif (natives[i].address == 0) {\r\n\t\t\t\t\tchar *name = reinterpret_cast<char*>(natives[i].nameofs + amx_->base);\r\n\t\t\t\t\tlogprintf(\"  %s\", name);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tcase AMX_ERR_STACKERR:\r\n\t\t\tlogprintf(\"  Stack index (STK) is 0x%X, heap index (HEA) is 0x%X\", amx_->stk, amx_->hea); \r\n\t\t\tbreak;\r\n\t\tcase AMX_ERR_STACKLOW:\r\n\t\t\tlogprintf(\"  Stack index (STK) is 0x%X, stack top (STP) is 0x%X\", amx_->stk, amx_->stp);\r\n\t\t\tbreak;\r\n\t\tcase AMX_ERR_HEAPLOW:\r\n\t\t\tlogprintf(\"  Heap index (HEA) is 0x%X, heap bottom (HLW) is 0x%X\", amx_->hea, amx_->hlw);\r\n\t\t\tbreak;\r\n\t\tcase AMX_ERR_INVINSTR: {\r\n\t\t\tcell opcode = *(reinterpret_cast<cell*>(amx_->cip + amx_->base + amxhdr_->cod));\r\n\t\t\tlogprintf(\"  Unknown opcode 0x%x at address 0x%08X\", opcode , amx_->cip);\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\r\n\tif (error != AMX_ERR_NOTFOUND &&\r\n\t\terror != AMX_ERR_INDEX &&\r\n\t\terror != AMX_ERR_CALLBACK &&\r\n\t\terror != AMX_ERR_INIT) \r\n\t{\r\n\t\tPrintAmxBacktrace();\t\t\t\r\n\t}\r\n\r\n\tstd::string command = serverCfg.GetOption(\"run_on_error\", std::string());\r\n\tif (!command.empty()) {\r\n\t\tstd::system(command.c_str());\r\n\t}\r\n\r\n\tDieOrContinue();\r\n}\r\n\r\nvoid crashdetect::HandleCrash() {\r\n\tlogprintf(\"Server crashed while executing %s\", amxName_.c_str());\r\n\tPrintAmxBacktrace();\r\n}\r\n\r\nvoid crashdetect::HandleInterrupt() {\r\n\tlogprintf(\"Server recieved interrupt signal while executing %s\", amxName_.c_str());\r\n\tPrintAmxBacktrace();\r\n}\r\n\r\nvoid crashdetect::HandleReleaseError(cell address, void *releaser) {\r\n\tstd::string plugin = fileutils::GetFileName(os::GetModulePath(releaser));\r\n\tif (plugin.empty()) {\r\n\t\tplugin.assign(\"<unknown>\");\r\n\t}\r\n\tlogprintf(\"Heap corruption detected:\");\r\n\tlogprintf(\"  %s [%08x] is trying to release memory at %08x\", plugin.c_str(), releaser, address);\r\n\tPrintNativeBacktrace();\r\n}\r\n\r\n\/\/ static\r\nvoid crashdetect::PrintAmxBacktrace() {\r\n\tif (npCalls_.empty()) {\r\n\t\treturn;\r\n\t}\r\n\r\n\tlogprintf(\"AMX backtrace:\");\r\n\r\n\tstd::stack<NPCall> npCallStack = npCalls_;\r\n\tcell frm = npCallStack.top().amx()->frm;\r\n\tcell cip = npCallStack.top().amx()->cip;\r\n\tint level = 0;\r\n\r\n\twhile (!npCallStack.empty()) {\r\n\t\tNPCall call = npCallStack.top();\r\n\r\n\t\tif (call.amx() != npCallStack.top().amx()) {\r\n\t\t\tassert(level != 0);\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tif (call.type() == NPCall::NATIVE) {\t\t\t\r\n\t\t\tAMX_NATIVE address = amxutils::GetNativeAddress(call.amx(), call.index());\r\n\t\t\tif (address != 0) {\t\t\t\t\r\n\t\t\t\tstd::string module = fileutils::GetFileName(os::GetModulePath((void*)address));\r\n\t\t\t\tstd::string from = \" from \" + module;\r\n\t\t\t\tif (module.empty()) {\r\n\t\t\t\t\tfrom.clear();\r\n\t\t\t\t}\t\t\t\t\r\n\t\t\t\tconst char *name = amxutils::GetNativeName(call.amx(), call.index());\r\n\t\t\t\tif (name != 0) {\r\n\t\t\t\t\tlogprintf(\"#%-2d native %s () [%08x]%s\", level++, name, address, from.c_str());\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t} else if (call.type() == NPCall::PUBLIC) {\r\n\t\t\tAMXDebugInfo &debugInfo = instances_[call.amx()]->debugInfo_;\r\n\r\n\t\t\tamxutils::PushStack(call.amx(), cip); \/\/ push return address\r\n\t\t\tamxutils::PushStack(call.amx(), frm); \/\/ push frame pointer\r\n\t\t\tfrm = call.amx()->stk;\r\n\r\n\t\t\tAMXStackTrace trace(call.amx(), debugInfo, frm);\r\n\t\t\tstd::deque<AMXStackFrame> frames = trace.GetFrames();\r\n\r\n\t\t\tfrm = amxutils::PopStack(call.amx()); \/\/ pop frame pointer\r\n\t\t\tcip = amxutils::PopStack(call.amx()); \/\/ pop return address\r\n\r\n\t\t\tif (frames.empty()) {\r\n\t\t\t\tucell epAddr = amxutils::GetPublicAddress(call.amx(), call.index());\r\n\t\t\t\tframes.push_front(AMXStackFrame(call.amx(), frm, cip, epAddr, debugInfo));\r\n\t\t\t} else {\r\n\t\t\t\tif (!debugInfo.IsLoaded()) {\r\n\t\t\t\t\tAMXStackFrame &bottom = frames.back();\r\n\t\t\t\t\tbottom = AMXStackFrame(call.amx(), \r\n\t\t\t\t\t\tbottom.GetFrameAddress(), \r\n\t\t\t\t\t\tbottom.GetReturnAddress(),\r\n\t\t\t\t\t\tamxutils::GetPublicAddress(call.amx(), call.index()),\r\n\t\t\t\t\t\tdebugInfo);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tstd::string &amxName = instances_[call.amx()]->amxName_;\r\n\t\t\tfor (size_t i = 0; i < frames.size(); i++) {\r\n\t\t\t\tstd::string from = \" from \" + amxName;\r\n\t\t\t\tif (amxName.empty() || debugInfo.IsLoaded()) {\r\n\t\t\t\t\tfrom.clear();\r\n\t\t\t\t}\r\n\t\t\t\tlogprintf(\"#%-2d %s%s\", level++, frames[i].GetString().c_str(), from.c_str());\r\n\t\t\t}\r\n\r\n\t\t\tfrm = call.frm();\r\n\t\t\tcip = call.cip();\r\n\t\t}\r\n\t\tnpCallStack.pop();\t\t\r\n\t}\r\n}\r\n\r\n\/\/ static\r\nvoid crashdetect::PrintNativeBacktrace(void *context) {\r\n\tlogprintf(\"Native backtrace:\");\r\n\r\n\tint level = 0;\r\n\r\n\tStackTrace trace(0, 0, context);\r\n\tstd::deque<StackFrame> frames = trace.GetFrames();\t\r\n\r\n\tfor (std::deque<StackFrame>::const_iterator iterator = frames.begin();\r\n\t\t\titerator != frames.end(); ++iterator) {\r\n\t\tconst StackFrame &frame = *iterator;\r\n\r\n\t\tstd::string module = os::GetModulePath(frame.GetReturnAddress());\r\n\t\tstd::string from = \" from \" + module;\r\n\t\tif (module.empty()) {\r\n\t\t\tfrom.clear();\r\n\t\t}\r\n\r\n\t\tlogprintf(\"#%-2d %s%s\", level++, frame.GetString().c_str(), from.c_str());\r\n\t}\r\n}\r\n\r\n\/\/ static\r\nvoid crashdetect::logprintf(const char *format, ...) {\r\n\tstd::va_list args;\r\n\tva_start(args, format);\r\n\r\n\tstd::string prefixed_format;\r\n\tprefixed_format.append(kLogMessagePrefix);\r\n\tprefixed_format.append(format);\r\n\r\n\t::vlogprintf(prefixed_format.c_str(), args);\r\n\r\n\tva_end(args);\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (C) 2015 Elviss Strazdins\n\/\/ This file is part of the Ouzel engine.\n\n#include \"RendererOGL.h\"\n#include \"TextureOGL.h\"\n#include \"RenderTargetOGL.h\"\n#include \"ShaderOGL.h\"\n#include \"MeshBufferOGL.h\"\n#include \"Engine.h\"\n#include \"Scene.h\"\n#include \"Camera.h\"\n#include \"Utils.h\"\n\n#if defined(SUPPORTS_OPENGL)\n#include \"ColorPSOGL.h\"\n#include \"ColorVSOGL.h\"\n#include \"TexturePSOGL.h\"\n#include \"TextureVSOGL.h\"\n#endif\n\n#if defined(SUPPORTS_OPENGLES)\n#include \"ColorPSOGLES.h\"\n#include \"ColorVSOGLES.h\"\n#include \"TexturePSOGLES.h\"\n#include \"TextureVSOGLES.h\"\n#endif\n\nnamespace ouzel\n{\n    RendererOGL::RendererOGL(const Size2& size, bool resiazble, bool fullscreen):\n        Renderer(size, resiazble, fullscreen, Driver::OPENGL)\n    {\n        recalculateProjection();\n    }\n    \n    RendererOGL::~RendererOGL()\n    {\n        \n    }\n    \n    bool RendererOGL::initOpenGL(uint32_t width, uint32_t height)\n    {\n        _size.width = static_cast<float>(width);\n        _size.height = static_cast<float>(height);\n        \n        \/\/glEnable(GL_DEPTH_TEST);\n        glClearColor(_clearColor.getR(), _clearColor.getG(), _clearColor.getB(), _clearColor.getA());\n        \n        glEnable(GL_BLEND);\n        glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\n        \n        \/\/glBlendEquationSeparate(GL_FUNC_ADD, GL_FUNC_ADD);\n        \/\/glBlendFuncSeparate(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA, GL_ONE, GL_ZERO);\n        \n        \/\/ precomputed alpha\n        \/\/glBlendEquationSeparate(GL_FUNC_ADD, GL_FUNC_ADD);\n        \/\/glBlendFuncSeparate(GL_ONE, GL_ONE_MINUS_SRC_ALPHA, GL_ONE, GL_ZERO);\n        \n        if (checkOpenGLErrors())\n        {\n            return false;\n        }\n        \n        Shader* textureShader = loadShaderFromBuffers(TEXTURE_PIXEL_SHADER_OGL, sizeof(TEXTURE_PIXEL_SHADER_OGL), TEXTURE_VERTEX_SHADER_OGL, sizeof(TEXTURE_VERTEX_SHADER_OGL), VertexPCT::ATTRIBUTES);\n        if (textureShader)\n        {\n            _shaders[SHADER_TEXTURE] = textureShader;\n        }\n        \n        Shader* colorShader = loadShaderFromBuffers(COLOR_PIXEL_SHADER_OGL, sizeof(COLOR_PIXEL_SHADER_OGL), COLOR_VERTEX_SHADER_OGL, sizeof(COLOR_VERTEX_SHADER_OGL), VertexPC::ATTRIBUTES);\n        if (colorShader)\n        {\n            _shaders[SHADER_COLOR] = colorShader;\n        }\n        \n        _ready = true;\n        \n        recalculateProjection();\n        \n        Engine::getInstance()->begin();\n        \n        return true;\n    }\n    \n    bool RendererOGL::checkOpenGLErrors()\n    {\n        bool error = false;\n        \n        while (GLenum error = glGetError() != GL_NO_ERROR)\n        {\n            const char* errorStr = \"Unknown error\";\n            \n            switch (error)\n            {\n                case GL_INVALID_ENUM: errorStr = \"GL_INVALID_ENUM\"; break;\n                case GL_INVALID_VALUE: errorStr = \"GL_INVALID_VALUE\"; break;\n                case GL_INVALID_OPERATION: errorStr = \"GL_INVALID_OPERATION\"; break;\n                case GL_OUT_OF_MEMORY: errorStr = \"GL_OUT_OF_MEMORY\"; break;\n                case GL_INVALID_FRAMEBUFFER_OPERATION: errorStr = \"GL_INVALID_FRAMEBUFFER_OPERATION\"; break;\n            }\n            \n            log(\"OpenGL error: %s (%x)\", errorStr, error);\n            \n            error = true;\n        }\n        \n        return error;\n    }\n    \n    void RendererOGL::setClearColor(Color color)\n    {\n        Renderer::setClearColor(color);\n        \n        glClearColor(_clearColor.getR(), _clearColor.getG(), _clearColor.getB(), _clearColor.getA());\n    }\n\n    void RendererOGL::recalculateProjection()\n    {\n        Renderer::recalculateProjection();\n        \n        if (_ready)\n        {\n            glViewport(0, 0, _size.width, _size.height);\n        }\n    }\n    \n    void RendererOGL::clear()\n    {\n        glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n        checkOpenGLErrors();\n    }\n    \n    void RendererOGL::flush()\n    {\n        glFlush();\n        checkOpenGLErrors();\n    }\n    \n    Texture* RendererOGL::loadTextureFromFile(const std::string& filename)\n    {\n        TextureOGL* texture = new TextureOGL();\n        \n        if (!texture->initFromFile(filename))\n        {\n            delete texture;\n            texture = nullptr;\n        }\n        \n        return texture;\n    }\n    \n    bool RendererOGL::activateTexture(Texture* texture, uint32_t layer)\n    {\n        if (!Renderer::activateTexture(texture, layer))\n        {\n            return false;\n        }\n        \n        glActiveTexture(GL_TEXTURE0 + layer);\n        \n        if (texture)\n        {\n            TextureOGL* textureOGL = static_cast<TextureOGL*>(texture);\n            \n            glBindTexture(GL_TEXTURE_2D, textureOGL->getTextureId());\n        }\n        else\n        {\n            glBindTexture(GL_TEXTURE_2D, 0);\n        }\n        \n        if (checkOpenGLErrors())\n        {\n            return false;\n        }\n        \n        return true;\n    }\n    \n    Shader* RendererOGL::loadShaderFromFiles(const std::string& fragmentShader, const std::string& vertexShader, uint32_t vertexAttributes)\n    {\n        ShaderOGL* shader = new ShaderOGL();\n        \n        if (!shader->initFromFiles(fragmentShader, vertexShader, vertexAttributes))\n        {\n            delete shader;\n            shader = nullptr;\n        }\n        \n        return shader;\n    }\n    \n    Shader* RendererOGL::loadShaderFromBuffers(const uint8_t* fragmentShader, uint32_t fragmentShaderSize, const uint8_t* vertexShader, uint32_t vertexShaderSize, uint32_t vertexAttributes)\n    {\n        ShaderOGL* shader = new ShaderOGL();\n        \n        if (!shader->initFromBuffers(fragmentShader, fragmentShaderSize, vertexShader, vertexShaderSize, vertexAttributes))\n        {\n            delete shader;\n            shader = nullptr;\n        }\n        \n        return shader;\n    }\n    \n    bool RendererOGL::activateShader(Shader* shader)\n    {\n        if (!Renderer::activateShader(shader))\n        {\n            return false;\n        }\n        \n        if (shader)\n        {\n            ShaderOGL* shaderOGL = static_cast<ShaderOGL*>(shader);\n            \n            glUseProgram(shaderOGL->getProgramId());\n            \n            if (checkOpenGLErrors())\n            {\n                return false;\n            }\n        }\n        else\n        {\n            glUseProgram(0);\n        }\n        \n        return true;\n    }\n    \n    MeshBuffer* RendererOGL::createMeshBuffer(const void* indices, uint32_t indexSize, uint32_t indexCount, bool dynamicIndexBuffer, const void* vertices, uint32_t vertexSize, uint32_t vertexCount, bool dynamicVertexBuffer, uint32_t vertexAttributes)\n    {\n        MeshBufferOGL* meshBuffer = new MeshBufferOGL();\n        \n        if (!meshBuffer->initFromData(indices, indexSize, indexCount, dynamicIndexBuffer, vertices, vertexSize, vertexCount, dynamicVertexBuffer, vertexAttributes))\n        {\n            delete meshBuffer;\n            meshBuffer = nullptr;\n        }\n        \n        return meshBuffer;\n    }\n    \n    bool RendererOGL::drawMeshBuffer(MeshBuffer* meshBuffer)\n    {\n        if (!Renderer::drawMeshBuffer(meshBuffer))\n        {\n            return false;\n        }\n        \n        MeshBufferOGL* meshBufferOGL = static_cast<MeshBufferOGL*>(meshBuffer);\n        \n        glBindVertexArray(meshBufferOGL->getVertexArrayId());\n        glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, meshBufferOGL->getIndexBufferId());\n        glDrawElements(GL_TRIANGLES, meshBufferOGL->getIndexCount(), meshBufferOGL->getIndexFormat(), nullptr);\n        \n        if (checkOpenGLErrors())\n        {\n            return false;\n        }\n        \n        return true;\n    }\n    \n    bool RendererOGL::drawLine(const Vector2& start, const Vector2& finish, const Color& color, const Matrix4& transform)\n    {\n        GLuint vertexArray = 0;\n        GLuint vertexBuffer = 0;\n        GLuint indexBuffer = 0;\n        \n        glGenVertexArrays(1, &vertexArray);\n        glBindVertexArray(vertexArray);\n        \n        GLfloat vertices[] = {\n            start.x, start.y, 0.0f, color.getR(), color.getG(), color.getB(), color.getA(),\n            finish.x, finish.y, 0.0f, color.getR(), color.getG(), color.getB(), color.getA()\n        };\n        \n        glGenBuffers(1, &vertexBuffer);\n        glBindBuffer(GL_ARRAY_BUFFER, vertexBuffer);\n        glBufferData(GL_ARRAY_BUFFER, sizeof(vertices), vertices, GL_STATIC_DRAW);\n        \n        glEnableVertexAttribArray(0);\n        glVertexAttribPointer(0, 3, GL_FLOAT, GL_FALSE, 7 * sizeof(GLfloat), reinterpret_cast<const GLvoid*>(0));\n        \n        glEnableVertexAttribArray(1);\n        glVertexAttribPointer(1, 4, GL_FLOAT, GL_FALSE, 7 * sizeof(GLfloat), reinterpret_cast<const GLvoid*>(12));\n        \n        GLubyte indices[] = {0, 1};\n        \n        glGenBuffers(1, &indexBuffer);\n        glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, indexBuffer);\n        glBufferData(GL_ELEMENT_ARRAY_BUFFER, sizeof(indices), indices, GL_STATIC_DRAW);\n        \n        ShaderOGL* colorShader = static_cast<ShaderOGL*>(getShader(SHADER_COLOR));\n        activateShader(colorShader);\n        \n        Matrix4 modelViewProj = _projection * Scene::getInstance()->getCamera()->getTransform() * transform;\n        \n        uint32_t uniModelViewProj = colorShader->getVertexShaderConstantId(\"modelViewProj\");\n        colorShader->setVertexShaderConstant(uniModelViewProj, { modelViewProj });\n        \n        glBindVertexArray(vertexArray);\n        glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, indexBuffer);\n        glDrawElements(GL_LINE_STRIP, 2, GL_UNSIGNED_BYTE, nullptr);\n        \n        \/\/ delete buffers\n        glDeleteVertexArrays(1, &vertexArray);\n        glDeleteBuffers(1, &vertexBuffer);\n        glDeleteBuffers(1, &indexBuffer);\n        \n        if (checkOpenGLErrors())\n        {\n            return false;\n        }\n        \n        return true;\n    }\n    \n    bool RendererOGL::drawRectangle(const Rectangle& rectangle, const Color& color, const Matrix4& transform)\n    {\n        GLubyte indices[] = {0, 1, 3, 2, 0};\n        \n        VertexPC vertices[] = {\n            VertexPC(Vector3(rectangle.x, rectangle.y, 0.0f), color),\n            VertexPC(Vector3(rectangle.x + rectangle.width, rectangle.y, 0.0f), color),\n            VertexPC(Vector3(rectangle.x, rectangle.y + rectangle.height, 0.0f), color),\n            VertexPC(Vector3(rectangle.x + rectangle.width, rectangle.y + rectangle.height, 0.0f), color)\n        };\n        \n        AutoPtr<MeshBufferOGL> meshBufferOGL = static_cast<MeshBufferOGL*>(createMeshBuffer(indices, sizeof(uint8_t), 5, false, vertices, sizeof(VertexPC), 4, false, VertexPC::ATTRIBUTES));\n        \n        if (!meshBufferOGL)\n        {\n            return false;\n        }\n        \n        ShaderOGL* colorShader = static_cast<ShaderOGL*>(getShader(SHADER_COLOR));\n        activateShader(colorShader);\n        \n        Matrix4 modelViewProj = _projection * Scene::getInstance()->getCamera()->getTransform() * transform;\n        \n        uint32_t uniModelViewProj = colorShader->getVertexShaderConstantId(\"modelViewProj\");\n        colorShader->setVertexShaderConstant(uniModelViewProj, { modelViewProj });\n        \n        glBindVertexArray(meshBufferOGL->getVertexArrayId());\n        glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, meshBufferOGL->getIndexBufferId());\n        glDrawElements(GL_LINE_STRIP, meshBufferOGL->getIndexCount(), meshBufferOGL->getIndexFormat(), nullptr);\n        \n        if (checkOpenGLErrors())\n        {\n            return false;\n        }\n        \n        return true;\n    }\n    \n    bool RendererOGL::drawQuad(const Rectangle& rectangle, const Color& color, const Matrix4& transform)\n    {\n        GLuint vertexArray = 0;\n        GLuint vertexBuffer = 0;\n        GLuint indexBuffer = 0;\n        \n        glGenVertexArrays(1, &vertexArray);\n        glBindVertexArray(vertexArray);\n        \n        GLfloat vertices[] = {\n            rectangle.x, rectangle.y, 0.0f, color.getR(), color.getG(), color.getB(), color.getA(), 0.0f, 1.0f,\n            rectangle.x + rectangle.width, rectangle.y, 0.0f, color.getR(), color.getG(), color.getB(), color.getA(), 1.0f, 1.0f,\n            rectangle.x, rectangle.y + rectangle.height, 0.0f, color.getR(), color.getG(), color.getB(), color.getA(), 0.0f, 0.0f,\n            rectangle.x + rectangle.width, rectangle.y + rectangle.height, 0.0f, color.getR(), color.getG(), color.getB(), color.getA(), 1.0f, 0.0f\n        };\n        \n        glGenBuffers(1, &vertexBuffer);\n        glBindBuffer(GL_ARRAY_BUFFER, vertexBuffer);\n        glBufferData(GL_ARRAY_BUFFER, sizeof(vertices), vertices, GL_STATIC_DRAW);\n        \n        glEnableVertexAttribArray(0);\n        glVertexAttribPointer(0, 3, GL_FLOAT, GL_FALSE, 10 * sizeof(GLfloat), reinterpret_cast<const GLvoid*>(0));\n        \n        glEnableVertexAttribArray(1);\n        glVertexAttribPointer(1, 4, GL_FLOAT, GL_FALSE, 10 * sizeof(GLfloat), reinterpret_cast<const GLvoid*>(12));\n        \n        glEnableVertexAttribArray(2);\n        glVertexAttribPointer(2, 2, GL_FLOAT, GL_FALSE, 10 * sizeof(GLfloat), reinterpret_cast<const GLvoid*>(16));\n        \n        GLubyte indices[] = {0, 1, 2, 1, 3, 2};\n        \n        glGenBuffers(1, &indexBuffer);\n        glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, indexBuffer);\n        glBufferData(GL_ELEMENT_ARRAY_BUFFER, sizeof(indices), indices, GL_STATIC_DRAW);\n        \n        ShaderOGL* colorShader = static_cast<ShaderOGL*>(getShader(SHADER_TEXTURE));\n        activateShader(colorShader);\n        \n        Matrix4 modelViewProj = _projection * Scene::getInstance()->getCamera()->getTransform() * transform;\n        \n        uint32_t uniModelViewProj = colorShader->getVertexShaderConstantId(\"modelViewProj\");\n        colorShader->setVertexShaderConstant(uniModelViewProj, { modelViewProj });\n        \n        glBindVertexArray(vertexArray);\n        glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, indexBuffer);\n        glDrawElements(GL_TRIANGLES, 6, GL_UNSIGNED_BYTE, nullptr);\n        \n        \/\/ delete buffers\n        glDeleteVertexArrays(1, &vertexArray);\n        glDeleteBuffers(1, &vertexBuffer);\n        glDeleteBuffers(1, &indexBuffer);\n        \n        if (checkOpenGLErrors())\n        {\n            return false;\n        }\n        \n        return true;\n    }\n}\n<commit_msg>Implement line and quad drawing with MeshBuffer on OpenGL<commit_after>\/\/ Copyright (C) 2015 Elviss Strazdins\n\/\/ This file is part of the Ouzel engine.\n\n#include \"RendererOGL.h\"\n#include \"TextureOGL.h\"\n#include \"RenderTargetOGL.h\"\n#include \"ShaderOGL.h\"\n#include \"MeshBufferOGL.h\"\n#include \"Engine.h\"\n#include \"Scene.h\"\n#include \"Camera.h\"\n#include \"Utils.h\"\n\n#if defined(SUPPORTS_OPENGL)\n#include \"ColorPSOGL.h\"\n#include \"ColorVSOGL.h\"\n#include \"TexturePSOGL.h\"\n#include \"TextureVSOGL.h\"\n#endif\n\n#if defined(SUPPORTS_OPENGLES)\n#include \"ColorPSOGLES.h\"\n#include \"ColorVSOGLES.h\"\n#include \"TexturePSOGLES.h\"\n#include \"TextureVSOGLES.h\"\n#endif\n\nnamespace ouzel\n{\n    RendererOGL::RendererOGL(const Size2& size, bool resiazble, bool fullscreen):\n        Renderer(size, resiazble, fullscreen, Driver::OPENGL)\n    {\n        recalculateProjection();\n    }\n    \n    RendererOGL::~RendererOGL()\n    {\n        \n    }\n    \n    bool RendererOGL::initOpenGL(uint32_t width, uint32_t height)\n    {\n        _size.width = static_cast<float>(width);\n        _size.height = static_cast<float>(height);\n        \n        \/\/glEnable(GL_DEPTH_TEST);\n        glClearColor(_clearColor.getR(), _clearColor.getG(), _clearColor.getB(), _clearColor.getA());\n        \n        glEnable(GL_BLEND);\n        glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\n        \n        \/\/glBlendEquationSeparate(GL_FUNC_ADD, GL_FUNC_ADD);\n        \/\/glBlendFuncSeparate(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA, GL_ONE, GL_ZERO);\n        \n        \/\/ precomputed alpha\n        \/\/glBlendEquationSeparate(GL_FUNC_ADD, GL_FUNC_ADD);\n        \/\/glBlendFuncSeparate(GL_ONE, GL_ONE_MINUS_SRC_ALPHA, GL_ONE, GL_ZERO);\n        \n        if (checkOpenGLErrors())\n        {\n            return false;\n        }\n        \n        Shader* textureShader = loadShaderFromBuffers(TEXTURE_PIXEL_SHADER_OGL, sizeof(TEXTURE_PIXEL_SHADER_OGL), TEXTURE_VERTEX_SHADER_OGL, sizeof(TEXTURE_VERTEX_SHADER_OGL), VertexPCT::ATTRIBUTES);\n        if (textureShader)\n        {\n            _shaders[SHADER_TEXTURE] = textureShader;\n        }\n        \n        Shader* colorShader = loadShaderFromBuffers(COLOR_PIXEL_SHADER_OGL, sizeof(COLOR_PIXEL_SHADER_OGL), COLOR_VERTEX_SHADER_OGL, sizeof(COLOR_VERTEX_SHADER_OGL), VertexPC::ATTRIBUTES);\n        if (colorShader)\n        {\n            _shaders[SHADER_COLOR] = colorShader;\n        }\n        \n        _ready = true;\n        \n        recalculateProjection();\n        \n        Engine::getInstance()->begin();\n        \n        return true;\n    }\n    \n    bool RendererOGL::checkOpenGLErrors()\n    {\n        bool error = false;\n        \n        while (GLenum error = glGetError() != GL_NO_ERROR)\n        {\n            const char* errorStr = \"Unknown error\";\n            \n            switch (error)\n            {\n                case GL_INVALID_ENUM: errorStr = \"GL_INVALID_ENUM\"; break;\n                case GL_INVALID_VALUE: errorStr = \"GL_INVALID_VALUE\"; break;\n                case GL_INVALID_OPERATION: errorStr = \"GL_INVALID_OPERATION\"; break;\n                case GL_OUT_OF_MEMORY: errorStr = \"GL_OUT_OF_MEMORY\"; break;\n                case GL_INVALID_FRAMEBUFFER_OPERATION: errorStr = \"GL_INVALID_FRAMEBUFFER_OPERATION\"; break;\n            }\n            \n            log(\"OpenGL error: %s (%x)\", errorStr, error);\n            \n            error = true;\n        }\n        \n        return error;\n    }\n    \n    void RendererOGL::setClearColor(Color color)\n    {\n        Renderer::setClearColor(color);\n        \n        glClearColor(_clearColor.getR(), _clearColor.getG(), _clearColor.getB(), _clearColor.getA());\n    }\n\n    void RendererOGL::recalculateProjection()\n    {\n        Renderer::recalculateProjection();\n        \n        if (_ready)\n        {\n            glViewport(0, 0, _size.width, _size.height);\n        }\n    }\n    \n    void RendererOGL::clear()\n    {\n        glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n        checkOpenGLErrors();\n    }\n    \n    void RendererOGL::flush()\n    {\n        glFlush();\n        checkOpenGLErrors();\n    }\n    \n    Texture* RendererOGL::loadTextureFromFile(const std::string& filename)\n    {\n        TextureOGL* texture = new TextureOGL();\n        \n        if (!texture->initFromFile(filename))\n        {\n            delete texture;\n            texture = nullptr;\n        }\n        \n        return texture;\n    }\n    \n    bool RendererOGL::activateTexture(Texture* texture, uint32_t layer)\n    {\n        if (!Renderer::activateTexture(texture, layer))\n        {\n            return false;\n        }\n        \n        glActiveTexture(GL_TEXTURE0 + layer);\n        \n        if (texture)\n        {\n            TextureOGL* textureOGL = static_cast<TextureOGL*>(texture);\n            \n            glBindTexture(GL_TEXTURE_2D, textureOGL->getTextureId());\n        }\n        else\n        {\n            glBindTexture(GL_TEXTURE_2D, 0);\n        }\n        \n        if (checkOpenGLErrors())\n        {\n            return false;\n        }\n        \n        return true;\n    }\n    \n    Shader* RendererOGL::loadShaderFromFiles(const std::string& fragmentShader, const std::string& vertexShader, uint32_t vertexAttributes)\n    {\n        ShaderOGL* shader = new ShaderOGL();\n        \n        if (!shader->initFromFiles(fragmentShader, vertexShader, vertexAttributes))\n        {\n            delete shader;\n            shader = nullptr;\n        }\n        \n        return shader;\n    }\n    \n    Shader* RendererOGL::loadShaderFromBuffers(const uint8_t* fragmentShader, uint32_t fragmentShaderSize, const uint8_t* vertexShader, uint32_t vertexShaderSize, uint32_t vertexAttributes)\n    {\n        ShaderOGL* shader = new ShaderOGL();\n        \n        if (!shader->initFromBuffers(fragmentShader, fragmentShaderSize, vertexShader, vertexShaderSize, vertexAttributes))\n        {\n            delete shader;\n            shader = nullptr;\n        }\n        \n        return shader;\n    }\n    \n    bool RendererOGL::activateShader(Shader* shader)\n    {\n        if (!Renderer::activateShader(shader))\n        {\n            return false;\n        }\n        \n        if (shader)\n        {\n            ShaderOGL* shaderOGL = static_cast<ShaderOGL*>(shader);\n            \n            glUseProgram(shaderOGL->getProgramId());\n            \n            if (checkOpenGLErrors())\n            {\n                return false;\n            }\n        }\n        else\n        {\n            glUseProgram(0);\n        }\n        \n        return true;\n    }\n    \n    MeshBuffer* RendererOGL::createMeshBuffer(const void* indices, uint32_t indexSize, uint32_t indexCount, bool dynamicIndexBuffer, const void* vertices, uint32_t vertexSize, uint32_t vertexCount, bool dynamicVertexBuffer, uint32_t vertexAttributes)\n    {\n        MeshBufferOGL* meshBuffer = new MeshBufferOGL();\n        \n        if (!meshBuffer->initFromData(indices, indexSize, indexCount, dynamicIndexBuffer, vertices, vertexSize, vertexCount, dynamicVertexBuffer, vertexAttributes))\n        {\n            delete meshBuffer;\n            meshBuffer = nullptr;\n        }\n        \n        return meshBuffer;\n    }\n    \n    bool RendererOGL::drawMeshBuffer(MeshBuffer* meshBuffer)\n    {\n        if (!Renderer::drawMeshBuffer(meshBuffer))\n        {\n            return false;\n        }\n        \n        MeshBufferOGL* meshBufferOGL = static_cast<MeshBufferOGL*>(meshBuffer);\n        \n        glBindVertexArray(meshBufferOGL->getVertexArrayId());\n        glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, meshBufferOGL->getIndexBufferId());\n        glDrawElements(GL_TRIANGLES, meshBufferOGL->getIndexCount(), meshBufferOGL->getIndexFormat(), nullptr);\n        \n        if (checkOpenGLErrors())\n        {\n            return false;\n        }\n        \n        return true;\n    }\n    \n    bool RendererOGL::drawLine(const Vector2& start, const Vector2& finish, const Color& color, const Matrix4& transform)\n    {\n        GLubyte indices[] = {0, 1};\n        \n        VertexPC vertices[] = {\n            VertexPC(Vector3(start.x, start.y, 0.0f), color),\n            VertexPC(Vector3(finish.x, finish.y, 0.0f), color)\n        };\n        \n        AutoPtr<MeshBufferOGL> meshBufferOGL = static_cast<MeshBufferOGL*>(createMeshBuffer(indices, sizeof(uint8_t), 2, false, vertices, sizeof(VertexPC), 4, false, VertexPC::ATTRIBUTES));\n        \n        if (!meshBufferOGL)\n        {\n            return false;\n        }\n        \n        ShaderOGL* colorShader = static_cast<ShaderOGL*>(getShader(SHADER_COLOR));\n        activateShader(colorShader);\n        \n        Matrix4 modelViewProj = _projection * Scene::getInstance()->getCamera()->getTransform() * transform;\n        \n        uint32_t uniModelViewProj = colorShader->getVertexShaderConstantId(\"modelViewProj\");\n        colorShader->setVertexShaderConstant(uniModelViewProj, { modelViewProj });\n        \n        glBindVertexArray(meshBufferOGL->getVertexArrayId());\n        glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, meshBufferOGL->getIndexBufferId());\n        glDrawElements(GL_LINE_STRIP, meshBufferOGL->getIndexCount(), meshBufferOGL->getIndexFormat(), nullptr);\n        \n        if (checkOpenGLErrors())\n        {\n            return false;\n        }\n        \n        return true;\n    }\n    \n    bool RendererOGL::drawRectangle(const Rectangle& rectangle, const Color& color, const Matrix4& transform)\n    {\n        GLubyte indices[] = {0, 1, 3, 2, 0};\n        \n        VertexPC vertices[] = {\n            VertexPC(Vector3(rectangle.x, rectangle.y, 0.0f), color),\n            VertexPC(Vector3(rectangle.x + rectangle.width, rectangle.y, 0.0f), color),\n            VertexPC(Vector3(rectangle.x, rectangle.y + rectangle.height, 0.0f), color),\n            VertexPC(Vector3(rectangle.x + rectangle.width, rectangle.y + rectangle.height, 0.0f), color)\n        };\n        \n        AutoPtr<MeshBufferOGL> meshBufferOGL = static_cast<MeshBufferOGL*>(createMeshBuffer(indices, sizeof(uint8_t), 5, false, vertices, sizeof(VertexPC), 4, false, VertexPC::ATTRIBUTES));\n        \n        if (!meshBufferOGL)\n        {\n            return false;\n        }\n        \n        ShaderOGL* colorShader = static_cast<ShaderOGL*>(getShader(SHADER_COLOR));\n        activateShader(colorShader);\n        \n        Matrix4 modelViewProj = _projection * Scene::getInstance()->getCamera()->getTransform() * transform;\n        \n        uint32_t uniModelViewProj = colorShader->getVertexShaderConstantId(\"modelViewProj\");\n        colorShader->setVertexShaderConstant(uniModelViewProj, { modelViewProj });\n        \n        glBindVertexArray(meshBufferOGL->getVertexArrayId());\n        glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, meshBufferOGL->getIndexBufferId());\n        glDrawElements(GL_LINE_STRIP, meshBufferOGL->getIndexCount(), meshBufferOGL->getIndexFormat(), nullptr);\n        \n        if (checkOpenGLErrors())\n        {\n            return false;\n        }\n        \n        return true;\n    }\n    \n    bool RendererOGL::drawQuad(const Rectangle& rectangle, const Color& color, const Matrix4& transform)\n    {\n        GLubyte indices[] = {0, 1, 2, 1, 3, 2};\n        \n        VertexPCT vertices[] = {\n            VertexPCT(Vector3(rectangle.x, rectangle.y, 0.0f), color, Vector2(0.0f, 1.0f)),\n            VertexPCT(Vector3(rectangle.x + rectangle.width, rectangle.y, 0.0f), color, Vector2(1.0f, 1.0f)),\n            VertexPCT(Vector3(rectangle.x, rectangle.y + rectangle.height, 0.0f), color, Vector2(0.0f, 0.0f)),\n            VertexPCT(Vector3(rectangle.x + rectangle.width, rectangle.y + rectangle.height, 0.0f), color, Vector2(1.0f, 0.0f))\n        };\n        \n        AutoPtr<MeshBufferOGL> meshBufferOGL = static_cast<MeshBufferOGL*>(createMeshBuffer(indices, sizeof(uint8_t), 6, false, vertices, sizeof(VertexPCT), 4, false, VertexPCT::ATTRIBUTES));\n        \n        if (!meshBufferOGL)\n        {\n            return false;\n        }\n        \n        ShaderOGL* colorShader = static_cast<ShaderOGL*>(getShader(SHADER_COLOR));\n        activateShader(colorShader);\n        \n        Matrix4 modelViewProj = _projection * Scene::getInstance()->getCamera()->getTransform() * transform;\n        \n        uint32_t uniModelViewProj = colorShader->getVertexShaderConstantId(\"modelViewProj\");\n        colorShader->setVertexShaderConstant(uniModelViewProj, { modelViewProj });\n        \n        glBindVertexArray(meshBufferOGL->getVertexArrayId());\n        glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, meshBufferOGL->getIndexBufferId());\n        glDrawElements(GL_TRIANGLES, meshBufferOGL->getIndexCount(), meshBufferOGL->getIndexFormat(), nullptr);\n        \n        if (checkOpenGLErrors())\n        {\n            return false;\n        }\n        \n        return true;\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;\n  TRoom *rp=NULL;\n  TPool *pool;\n  vector<TRoom *>rooms;\n  vector<dirTypeT>roomdirs;\n  bool valid;\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\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    }\n\t  }\n\t}\n\tif(valid){\n\t  rooms.push_back(rp);\n\t  roomdirs.push_back(dir);\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, 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>fixed bug with pool 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>=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<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Module:    DicomImageReadChangeHeaderWrite.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 illustrates how to read a single DICOM slice and write it back\n\/\/  with some changed header information as another DICOM\n\/\/  slice. Header Key\/Value pairs can be specified on the command\n\/\/  line. The keys are defined in Insight\/Utilities\/gdcm\/Dicts\/dicomV3.dic.\n\/\/\n\/\/  Software Guide : EndLatex \n\n\n\/\/ Software Guide : BeginCodeSnippet\n#include \"itkImageFileReader.h\"\n#include \"itkImageFileWriter.h\"\n#include \"itkImage.h\"\n#include \"itkMetaDataDictionary.h\"\n#include \"itkMetaDataObject.h\"\n#include \"itkGDCMImageIO.h\"\n\/\/ Software Guide : EndCodeSnippet\n\n#include <list>\n#include <fstream>\n\nint main(int argc, char* argv[])\n{\n\n  if( argc < 5 )\n    {\n    std::cerr << \"Usage: \" << argv[0] << \" DicomImage OutputDicomImage Entry Value\\n\";\n    return EXIT_FAILURE;\n    }\n\n\n  \/\/ Software Guide : BeginCodeSnippet\n  typedef short InputPixelType;\n\n  typedef itk::Image< InputPixelType, 2 > InputImageType;\n\n  typedef itk::ImageFileReader< InputImageType > ReaderType;\n  \/\/ Software Guide : EndCodeSnippet\n\n  ReaderType::Pointer reader = ReaderType::New();\n\n  reader->SetFileName( argv[1] );\n  \n  \/\/ Software Guide : BeginCodeSnippet\n  typedef itk::GDCMImageIO        ImageIOType;\n\n  ImageIOType::Pointer gdcmImageIO = ImageIOType::New();\n\n  reader->SetImageIO( gdcmImageIO );\n  \/\/ Software Guide : EndCodeSnippet\n\n  try\n    {\n    reader->Update();\n    }\n  catch (itk::ExceptionObject & e)\n    {\n    std::cerr << \"exception in file reader \" << std::endl;\n    std::cerr << e.GetDescription() << std::endl;\n    std::cerr << e.GetLocation() << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  \/\/ Change some header information\n  typedef itk::MetaDataDictionary   DictionaryType;\n  DictionaryType & dictionary = reader->GetOutput()->GetMetaDataDictionary();\n\n  for (int i = 3; i < argc; i+=2)\n    {\n    std::string entryId( argv[i] );\n    std::string value( argv[i+1] );\n    itk::EncapsulateMetaData<std::string>( dictionary, entryId, value );\n    }\n\n  \/\/ Rewrite the image in DICOM format\n  \/\/\n  typedef itk::ImageFileWriter< InputImageType >  Writer1Type;\n\n  Writer1Type::Pointer writer1 = Writer1Type::New();\n\n  writer1->SetFileName( argv[2] );\n \n  writer1->SetInput( reader->GetOutput() );\n  \n  writer1->SetImageIO( gdcmImageIO );\n\n  try\n    {\n    writer1->Update();\n    }\n  catch (itk::ExceptionObject & e)\n    {\n    std::cerr << \"exception in file writer \" << std::endl;\n    std::cerr << e.GetDescription() << std::endl;\n    std::cerr << e.GetLocation() << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  return EXIT_SUCCESS;\n\n}\n\n<commit_msg>STYLE: Adding comments for the Software Guide.<commit_after>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Module:    DicomImageReadChangeHeaderWrite.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 illustrates how to read a single DICOM slice and write it back\n\/\/  with some changed header information as another DICOM slice. Header\n\/\/  Key\/Value pairs can be specified on the command line. The keys are defined\n\/\/  in the file\n\/\/\n\/\/  \\code{Insight\/Utilities\/gdcm\/Dicts\/dicomV3.dic}\n\/\/  \n\/\/  Please note that modifying the content of a DICOM header is a very risky\n\/\/  operation. The Header contains fundamental information about the patient\n\/\/  and therefore its consistency must be protected from any data corruption.\n\/\/  Before attempting to modify the DICOM headers of your files, you must make\n\/\/  sure that you have a very good reason for doing so, and that you can ensure\n\/\/  that this information change will not result in a lower quality of health\n\/\/  care to be delivered to the patient.\n\/\/\n\/\/  \\index{DICOM!Changing Headers}\n\/\/\n\/\/  Software Guide : EndLatex \n\n\n\n\/\/ Software Guide : BeginLatex\n\/\/ \n\/\/ We must start by including the relevant header files. Here we include the\n\/\/ image reader, image writer, the image, the Meta data dictionary and its\n\/\/ entries the Meta data objects and the GDCMImageIO. The Meta data dictionary\n\/\/ is the data container that stores all the entries from the DICOM header once\n\/\/ the DICOM image file is read into an ITK image.\n\/\/\n\/\/ Software Guide : EndLatex\n\n\/\/ Software Guide : BeginCodeSnippet\n#include \"itkImageFileReader.h\"\n#include \"itkImageFileWriter.h\"\n#include \"itkImage.h\"\n#include \"itkMetaDataDictionary.h\"\n#include \"itkMetaDataObject.h\"\n#include \"itkGDCMImageIO.h\"\n\/\/ Software Guide : EndCodeSnippet\n\n\n\n#include <list>\n#include <fstream>\n\nint main(int argc, char* argv[])\n{\n\n  if( argc < 5 )\n    {\n    std::cerr << \"Usage: \" << argv[0] << \" DicomImage OutputDicomImage Entry Value\\n\";\n    return EXIT_FAILURE;\n    }\n\n\n\n\n\/\/ Software Guide : BeginLatex\n\/\/ \n\/\/ We declare the image type by selecting a particular pixel type and image\n\/\/ dimension.\n\/\/\n\/\/ Software Guide : EndLatex\n\n\/\/ Software Guide : BeginCodeSnippet\n  typedef signed short InputPixelType;\n  const unsigned int   Dimension = 2;\n\n  typedef itk::Image< InputPixelType, Dimension > InputImageType;\n\/\/ Software Guide : EndCodeSnippet\n\n\n\n\/\/ Software Guide : BeginLatex\n\/\/ \n\/\/ We instantiate the reader type by using the image type as template\n\/\/ parameter. An instance of the reader is created and the file name to be read\n\/\/ is taken from the command line arguments.\n\/\/\n\/\/ Software Guide : EndLatex\n\n\/\/ Software Guide : BeginCodeSnippet\n  typedef itk::ImageFileReader< InputImageType > ReaderType;\n  ReaderType::Pointer reader = ReaderType::New();\n  reader->SetFileName( argv[1] );\n\/\/ Software Guide : EndCodeSnippet\n\n\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ The GDCMImageIO object is created in order to provide the services for\n\/\/ reading and writing DICOM files. The newly created image IO class is\n\/\/ connected to the reader.\n\/\/\n\/\/ Software Guide : EndLatex\n \n\/\/ Software Guide : BeginCodeSnippet\n  typedef itk::GDCMImageIO           ImageIOType;\n  ImageIOType::Pointer gdcmImageIO = ImageIOType::New();\n\n  reader->SetImageIO( gdcmImageIO );\n\/\/ Software Guide : EndCodeSnippet\n\n\n\n\n\/\/ Software Guide : BeginLatex\n\/\/ \n\/\/ The reading of the image is triggered by invoking \\code{Update()} in the\n\/\/ reader.\n\/\/\n\/\/ Software Guide : EndLatex\n\n\n  try\n    {\n\/\/ Software Guide : BeginCodeSnippet\n    reader->Update();\n\/\/ Software Guide : EndCodeSnippet\n    }\n  catch (itk::ExceptionObject & e)\n    {\n    std::cerr << \"exception in file reader \" << std::endl;\n    std::cerr << e.GetDescription() << std::endl;\n    std::cerr << e.GetLocation() << std::endl;\n    return EXIT_FAILURE;\n    }\n\n\/\/ Software Guide : BeginLatex\n\/\/ \n\/\/ We take the Meta data dictionary from the image that the reader had loaded\n\/\/ in memory.\n\/\/\n\/\/ Software Guide : EndLatex\n\n\n\/\/ Software Guide : BeginCodeSnippet\n  InputImageType::Pointer inputImage = reader->GetOutput();\n\n  typedef itk::MetaDataDictionary   DictionaryType;\n  DictionaryType & dictionary = inputImage->GetMetaDataDictionary();\n\/\/ Software Guide : EndCodeSnippet\n\n\n\n\/\/ Software Guide : BeginLatex\n\/\/ \n\/\/ Now we access the entries in the Meta data dictionary, and for particular\n\/\/ key values we assign a new content to the entry. This is done here by taking\n\/\/ \\{key,value\\} pairs from the command line arguments. The relavant method is\n\/\/ the EncapsulateMetaData that takes the dictionary and for a given key\n\/\/ provided by \\code{entryId}, replaces the current value with the content of\n\/\/ the \\code{value} variable. This is repeated for every potential pair present\n\/\/ in the command line arguments.\n\/\/\n\/\/ Software Guide : EndLatex\n\n\/\/ Software Guide : BeginCodeSnippet\n  for (int i = 3; i < argc; i+=2)\n    {\n    std::string entryId( argv[i] );\n    std::string value( argv[i+1] );\n    itk::EncapsulateMetaData<std::string>( dictionary, entryId, value );\n    }\n\/\/ Software Guide : EndCodeSnippet\n\n\n\n\n\/\/ Software Guide : BeginLatex\n\/\/ \n\/\/ Now that the Dictionary has been updated, we proceed to save the image. This\n\/\/ output image will have the modified data associated to its DICOM header.\n\/\/\n\/\/ Using the image type, we instantiate a writer type and construct a writer.\n\/\/ A short pipeline between the reader and the writer is connected. The\n\/\/ filename to write is taken from the command line arguments. The image IO\n\/\/ object is connected to the writer.\n\/\/\n\/\/ Software Guide : EndLatex\n\n\/\/ Software Guide : BeginCodeSnippet\n  typedef itk::ImageFileWriter< InputImageType >  Writer1Type;\n\n  Writer1Type::Pointer writer1 = Writer1Type::New();\n\n  writer1->SetInput( reader->GetOutput() );\n  writer1->SetFileName( argv[2] );\n  writer1->SetImageIO( gdcmImageIO );\n\/\/ Software Guide : EndCodeSnippet\n\n\n\/\/ Software Guide : BeginLatex\n\/\/ \n\/\/ Execution of the writer is triggered by invoking the \\code{Update()} method.\n\/\/\n\/\/ Software Guide : EndLatex\n\n  try\n    {\n\/\/ Software Guide : BeginCodeSnippet\n    writer1->Update();\n\/\/ Software Guide : EndCodeSnippet\n    }\n  catch (itk::ExceptionObject & e)\n    {\n    std::cerr << \"exception in file writer \" << std::endl;\n    std::cerr << e.GetDescription() << std::endl;\n    std::cerr << e.GetLocation() << std::endl;\n    return EXIT_FAILURE;\n    }\n\n\n\n\/\/ Software Guide : BeginLatex\n\/\/ \n\/\/ Remember again, that modifying the header entries of a DICOM file involves\n\/\/ very serious risks for patients and therefore must be done with extreme\n\/\/ caution.\n\/\/\n\/\/ Software Guide : EndLatex\n\n\n  return EXIT_SUCCESS;\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: xiroot.hxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: obo $ $Date: 2004-06-04 14:06:31 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n\/\/ ============================================================================\n\n#ifndef SC_XIROOT_HXX\n#define SC_XIROOT_HXX\n\n#ifndef SC_XLROOT_HXX\n#include \"xlroot.hxx\"\n#endif\n\n\n\/\/ Global data ================================================================\n\nclass XclImpSst;\nclass XclImpPalette;\nclass XclImpFontBuffer;\nclass XclImpNumFmtBuffer;\nclass XclImpXFBuffer;\nclass XclImpXFIndexBuffer;\nclass XclImpPageSettings;\nclass _ScRangeListTabs;\nclass XclImpTabInfo;\nclass XclImpNameBuffer;\nclass XclImpLinkManager;\nclass XclImpObjectManager;\nclass XclImpCondFormatManager;\nclass XclImpAutoFilterBuffer;\nclass XclImpWebQueryBuffer;\nclass XclImpPivotTableManager;\n\n\/** Stores global buffers and data needed for Excel import filter. *\/\nstruct XclImpRootData : public XclRootData\n{\n    typedef ::std::auto_ptr< XclImpSst >                XclImpSstPtr;\n    typedef ::std::auto_ptr< XclImpPalette >            XclImpPalettePtr;\n    typedef ::std::auto_ptr< XclImpFontBuffer >         XclImpFontBufferPtr;\n    typedef ::std::auto_ptr< XclImpNumFmtBuffer >       XclImpNumFmtBufferPtr;\n    typedef ::std::auto_ptr< XclImpXFBuffer >           XclImpXFBufferPtr;\n    typedef ::std::auto_ptr< XclImpXFIndexBuffer >      XclImpXFIndexBufferPtr;\n    typedef ::std::auto_ptr< XclImpPageSettings >       XclImpPageSettingsPtr;\n    typedef ::std::auto_ptr< XclImpTabInfo >            XclImpTabInfoPtr;\n    typedef ::std::auto_ptr< XclImpNameBuffer >         XclImpNameBufferPtr;\n    typedef ::std::auto_ptr< XclImpLinkManager >        XclImpLinkManagerPtr;\n    typedef ::std::auto_ptr< XclImpObjectManager >      XclImpObjectManagerPtr;\n    typedef ::std::auto_ptr< XclImpCondFormatManager >  XclImpCondFormatManagerPtr;\n    typedef ::std::auto_ptr< XclImpWebQueryBuffer >     XclImpWebQueryBufferPtr;\n    typedef ::std::auto_ptr< XclImpPivotTableManager >  XclImpPivotTableManagerPtr;\n\n    XclImpSstPtr                mpSst;              \/\/\/ The shared string table.\n\n    XclImpPalettePtr            mpPalette;          \/\/\/ The color buffer.\n    XclImpFontBufferPtr         mpFontBuffer;       \/\/\/ All fonts in the file.\n    XclImpNumFmtBufferPtr       mpNumFmtBuffer;     \/\/\/ All number formats in the file.\n    XclImpXFBufferPtr           mpXFBuffer;         \/\/\/ All XF record data in the file.\n    XclImpXFIndexBufferPtr      mpXFIndexBuffer;    \/\/\/ Buffer of XF indexes in a sheet.\n\n    XclImpPageSettingsPtr       mpPageSettings;     \/\/\/ Page settings for current sheet.\n\n    XclImpTabInfoPtr            mpTabInfo;          \/\/\/ Sheet creation order list.\n    XclImpNameBufferPtr         mpNameBuffer;       \/\/\/ Internal defined names.\n    XclImpLinkManagerPtr        mpLinkManager;      \/\/\/ Manager for internal\/external links.\n\n    XclImpObjectManagerPtr      mpObjManager;       \/\/\/ All drawing objects.\n    XclImpCondFormatManagerPtr  mpCondFmtManager;   \/\/\/ Conditional formattings.\n    XclImpWebQueryBufferPtr     mpWebQBuffer;       \/\/\/ All web queries.\n    XclImpPivotTableManagerPtr  mpPTManager;        \/\/\/ All pivot tables and pivot caches.\n\n    explicit                    XclImpRootData(\n                                    XclBiff eBiff,\n                                    ScDocument& rDocument,\n                                    const String& rDocUrl,\n                                    CharSet eCharSet );\n    virtual                     ~XclImpRootData();\n};\n\n\n\/\/ ----------------------------------------------------------------------------\n\nclass ExcelToSc;\n\n\/** Access to global data from other classes. *\/\nclass XclImpRoot : public XclRoot\n{\nprivate:\n    mutable XclImpRootData&     mrImpData;      \/\/\/ Reference to the global import data struct.\n\npublic:\n    \/** Returns this root instance - for code readability in derived classes. *\/\n    inline const XclImpRoot&    GetRoot() const { return *this; }\n\n    \/** Returns the shared string table. *\/\n    XclImpSst&                  GetSst() const;\n\n    \/** Returns the color buffer. *\/\n    XclImpPalette&              GetPalette() const;\n    \/** Returns the font buffer. *\/\n    XclImpFontBuffer&           GetFontBuffer() const;\n    \/** Returns the number format buffer. *\/\n    XclImpNumFmtBuffer&         GetNumFmtBuffer() const;\n    \/** Returns the cell formatting attributes buffer. *\/\n    XclImpXFBuffer&             GetXFBuffer() const;\n    \/** Returns the buffer of XF indexes for a sheet. *\/\n    XclImpXFIndexBuffer&        GetXFIndexBuffer() const;\n\n    \/** Returns the page settings of the current sheet. *\/\n    XclImpPageSettings&         GetPageSettings() const;\n    \/** Returns the buffer that contains all print areas in the document. *\/\n    _ScRangeListTabs&           GetPrintAreaBuffer() const;\n    \/** Returns the buffer that contains all print areas in the document. *\/\n    _ScRangeListTabs&           GetTitleAreaBuffer() const;\n\n    \/** Returns the buffer that contains the sheet creation order. *\/\n    XclImpTabInfo&              GetTabInfo() const;\n    \/** Returns the buffer that contains internal defined names. *\/\n    XclImpNameBuffer&           GetNameBuffer() const;\n    \/** Returns the link manager. *\/\n    XclImpLinkManager&          GetLinkManager() const;\n\n    \/** Returns the drawing object manager. *\/\n    XclImpObjectManager&        GetObjectManager() const;\n    \/** Returns the conditional formattings manager. *\/\n    XclImpCondFormatManager&    GetCondFormatManager() const;\n    \/** Returns the filter manager. *\/\n    XclImpAutoFilterBuffer&     GetFilterManager() const;\n    \/** Returns the web query buffer. *\/\n    XclImpWebQueryBuffer&       GetWebQueryBuffer() const;\n    \/** Returns the pivot table manager. *\/\n    XclImpPivotTableManager&    GetPivotTableManager() const;\n\n    \/** Returns the formula converter. *\/\n    ExcelToSc&                  GetFmlaConverter() const;\n\n    \/** Returns the Calc add-in function name for an Excel function name. *\/\n    String                      GetScAddInName( const String& rXclName ) const;\n\n    \/** Checks if the passed cell address is a valid Calc cell position.\n        @descr  See XclRoot::CheckCellAddress for details. *\/\n    bool                        CheckCellAddress( const ScAddress& rPos ) const;\n    \/** Checks and eventually crops the cell range to valid Calc dimensions.\n        @descr  See XclRoot::CheckCellRange for details. *\/\n    bool                        CheckCellRange( ScRange& rRange ) const;\n    \/** Checks and eventually crops the cell ranges to valid Calc dimensions.\n        @descr  See XclRoot::CheckCellRangeList for details. *\/\n    void                        CheckCellRangeList( ScRangeList& rRanges ) const;\n\nprotected:\n    explicit                    XclImpRoot( XclImpRootData& rImpRootData );\n\n    \/** Sets the BIFF version and BOF\/EOF block type. *\/\n    void                        SetBiff( XclBiff eBiff );\n};\n\n\n\/\/ ============================================================================\n\n#endif\n\n<commit_msg>INTEGRATION: CWS dr19 (1.8.106); FILE MERGED 2004\/06\/11 11:23:13 dr 1.8.106.2: RESYNC: (1.8-1.9); FILE MERGED 2004\/06\/07 18:41:27 dr 1.8.106.1: #i25468# detect BIFF version before starting filter, needed for new number format import<commit_after>\/*************************************************************************\n *\n *  $RCSfile: xiroot.hxx,v $\n *\n *  $Revision: 1.10 $\n *\n *  last change: $Author: kz $ $Date: 2004-07-30 16:23: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\/\/ ============================================================================\n\n#ifndef SC_XIROOT_HXX\n#define SC_XIROOT_HXX\n\n#ifndef SC_XLROOT_HXX\n#include \"xlroot.hxx\"\n#endif\n\n\n\/\/ Global data ================================================================\n\nclass XclImpSst;\nclass XclImpPalette;\nclass XclImpFontBuffer;\nclass XclImpNumFmtBuffer;\nclass XclImpXFBuffer;\nclass XclImpXFIndexBuffer;\nclass XclImpPageSettings;\nclass _ScRangeListTabs;\nclass XclImpTabInfo;\nclass XclImpNameBuffer;\nclass XclImpLinkManager;\nclass XclImpObjectManager;\nclass XclImpCondFormatManager;\nclass XclImpAutoFilterBuffer;\nclass XclImpWebQueryBuffer;\nclass XclImpPivotTableManager;\n\n\/** Stores global buffers and data needed for Excel import filter. *\/\nstruct XclImpRootData : public XclRootData\n{\n    typedef ::std::auto_ptr< XclImpSst >                XclImpSstPtr;\n    typedef ::std::auto_ptr< XclImpPalette >            XclImpPalettePtr;\n    typedef ::std::auto_ptr< XclImpFontBuffer >         XclImpFontBufferPtr;\n    typedef ::std::auto_ptr< XclImpNumFmtBuffer >       XclImpNumFmtBufferPtr;\n    typedef ::std::auto_ptr< XclImpXFBuffer >           XclImpXFBufferPtr;\n    typedef ::std::auto_ptr< XclImpXFIndexBuffer >      XclImpXFIndexBufferPtr;\n    typedef ::std::auto_ptr< XclImpPageSettings >       XclImpPageSettingsPtr;\n    typedef ::std::auto_ptr< XclImpTabInfo >            XclImpTabInfoPtr;\n    typedef ::std::auto_ptr< XclImpNameBuffer >         XclImpNameBufferPtr;\n    typedef ::std::auto_ptr< XclImpLinkManager >        XclImpLinkManagerPtr;\n    typedef ::std::auto_ptr< XclImpObjectManager >      XclImpObjectManagerPtr;\n    typedef ::std::auto_ptr< XclImpCondFormatManager >  XclImpCondFormatManagerPtr;\n    typedef ::std::auto_ptr< XclImpWebQueryBuffer >     XclImpWebQueryBufferPtr;\n    typedef ::std::auto_ptr< XclImpPivotTableManager >  XclImpPivotTableManagerPtr;\n\n    XclImpSstPtr                mpSst;              \/\/\/ The shared string table.\n\n    XclImpPalettePtr            mpPalette;          \/\/\/ The color buffer.\n    XclImpFontBufferPtr         mpFontBuffer;       \/\/\/ All fonts in the file.\n    XclImpNumFmtBufferPtr       mpNumFmtBuffer;     \/\/\/ All number formats in the file.\n    XclImpXFBufferPtr           mpXFBuffer;         \/\/\/ All XF record data in the file.\n    XclImpXFIndexBufferPtr      mpXFIndexBuffer;    \/\/\/ Buffer of XF indexes in a sheet.\n\n    XclImpPageSettingsPtr       mpPageSettings;     \/\/\/ Page settings for current sheet.\n\n    XclImpTabInfoPtr            mpTabInfo;          \/\/\/ Sheet creation order list.\n    XclImpNameBufferPtr         mpNameBuffer;       \/\/\/ Internal defined names.\n    XclImpLinkManagerPtr        mpLinkManager;      \/\/\/ Manager for internal\/external links.\n\n    XclImpObjectManagerPtr      mpObjManager;       \/\/\/ All drawing objects.\n    XclImpCondFormatManagerPtr  mpCondFmtManager;   \/\/\/ Conditional formattings.\n    XclImpWebQueryBufferPtr     mpWebQBuffer;       \/\/\/ All web queries.\n    XclImpPivotTableManagerPtr  mpPTManager;        \/\/\/ All pivot tables and pivot caches.\n\n    explicit                    XclImpRootData(\n                                    XclBiff eBiff,\n                                    ScDocument& rDocument,\n                                    const String& rDocUrl,\n                                    CharSet eCharSet );\n    virtual                     ~XclImpRootData();\n};\n\n\n\/\/ ----------------------------------------------------------------------------\n\nclass ExcelToSc;\n\n\/** Access to global data from other classes. *\/\nclass XclImpRoot : public XclRoot\n{\nprivate:\n    mutable XclImpRootData&     mrImpData;      \/\/\/ Reference to the global import data struct.\n\npublic:\n    \/** Returns this root instance - for code readability in derived classes. *\/\n    inline const XclImpRoot&    GetRoot() const { return *this; }\n\n    \/** Returns the shared string table. *\/\n    XclImpSst&                  GetSst() const;\n\n    \/** Returns the color buffer. *\/\n    XclImpPalette&              GetPalette() const;\n    \/** Returns the font buffer. *\/\n    XclImpFontBuffer&           GetFontBuffer() const;\n    \/** Returns the number format buffer. *\/\n    XclImpNumFmtBuffer&         GetNumFmtBuffer() const;\n    \/** Returns the cell formatting attributes buffer. *\/\n    XclImpXFBuffer&             GetXFBuffer() const;\n    \/** Returns the buffer of XF indexes for a sheet. *\/\n    XclImpXFIndexBuffer&        GetXFIndexBuffer() const;\n\n    \/** Returns the page settings of the current sheet. *\/\n    XclImpPageSettings&         GetPageSettings() const;\n    \/** Returns the buffer that contains all print areas in the document. *\/\n    _ScRangeListTabs&           GetPrintAreaBuffer() const;\n    \/** Returns the buffer that contains all print areas in the document. *\/\n    _ScRangeListTabs&           GetTitleAreaBuffer() const;\n\n    \/** Returns the buffer that contains the sheet creation order. *\/\n    XclImpTabInfo&              GetTabInfo() const;\n    \/** Returns the buffer that contains internal defined names. *\/\n    XclImpNameBuffer&           GetNameBuffer() const;\n    \/** Returns the link manager. *\/\n    XclImpLinkManager&          GetLinkManager() const;\n\n    \/** Returns the drawing object manager. *\/\n    XclImpObjectManager&        GetObjectManager() const;\n    \/** Returns the conditional formattings manager. *\/\n    XclImpCondFormatManager&    GetCondFormatManager() const;\n    \/** Returns the filter manager. *\/\n    XclImpAutoFilterBuffer&     GetFilterManager() const;\n    \/** Returns the web query buffer. *\/\n    XclImpWebQueryBuffer&       GetWebQueryBuffer() const;\n    \/** Returns the pivot table manager. *\/\n    XclImpPivotTableManager&    GetPivotTableManager() const;\n\n    \/** Returns the formula converter. *\/\n    ExcelToSc&                  GetFmlaConverter() const;\n\n    \/** Returns the Calc add-in function name for an Excel function name. *\/\n    String                      GetScAddInName( const String& rXclName ) const;\n\n    \/** Checks if the passed cell address is a valid Calc cell position.\n        @descr  See XclRoot::CheckCellAddress for details. *\/\n    bool                        CheckCellAddress( const ScAddress& rPos ) const;\n    \/** Checks and eventually crops the cell range to valid Calc dimensions.\n        @descr  See XclRoot::CheckCellRange for details. *\/\n    bool                        CheckCellRange( ScRange& rRange ) const;\n    \/** Checks and eventually crops the cell ranges to valid Calc dimensions.\n        @descr  See XclRoot::CheckCellRangeList for details. *\/\n    void                        CheckCellRangeList( ScRangeList& rRanges ) const;\n\nprotected:\n    explicit                    XclImpRoot( XclImpRootData& rImpRootData );\n};\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: asciiopt.cxx,v $\n *\n *  $Revision: 1.24 $\n *\n *  last change: $Author: kz $ $Date: 2006-07-21 13:17:04 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sc.hxx\"\n\n\n\n#include \"global.hxx\"\n#include \"scresid.hxx\"\n#include \"impex.hxx\"\n#include \"asciiopt.hxx\"\n#include \"asciiopt.hrc\"\n\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n#ifndef _RTL_TENCINFO_H\n#include <rtl\/tencinfo.h>\n#endif\n#ifndef _UNOTOOLS_TRANSLITERATIONWRAPPER_HXX\n#include <unotools\/transliterationwrapper.hxx>\n#endif\n\/\/ ause\n#include \"editutil.hxx\"\n\n\/\/ ============================================================================\n\nstatic const sal_Char __FAR_DATA pStrFix[] = \"FIX\";\nstatic const sal_Char __FAR_DATA pStrMrg[] = \"MRG\";\n\n\n\/\/ ============================================================================\n\nScAsciiOptions::ScAsciiOptions() :\n    bFixedLen       ( FALSE ),\n    aFieldSeps      ( ';' ),\n    bMergeFieldSeps ( FALSE ),\n    cTextSep        ( cDefaultTextSep ),\n    eCharSet        ( gsl_getSystemTextEncoding() ),\n    bCharSetSystem  ( FALSE ),\n    nStartRow       ( 1 ),\n    nInfoCount      ( 0 ),\n    pColStart       ( NULL ),\n    pColFormat      ( NULL )\n{\n}\n\n\nScAsciiOptions::ScAsciiOptions(const ScAsciiOptions& rOpt) :\n    bFixedLen       ( rOpt.bFixedLen ),\n    aFieldSeps      ( rOpt.aFieldSeps ),\n    bMergeFieldSeps ( rOpt.bMergeFieldSeps ),\n    cTextSep        ( rOpt.cTextSep ),\n    eCharSet        ( rOpt.eCharSet ),\n    bCharSetSystem  ( rOpt.bCharSetSystem ),\n    nStartRow       ( rOpt.nStartRow ),\n    nInfoCount      ( rOpt.nInfoCount )\n{\n    if (nInfoCount)\n    {\n        pColStart = new xub_StrLen[nInfoCount];\n        pColFormat = new BYTE[nInfoCount];\n        for (USHORT i=0; i<nInfoCount; i++)\n        {\n            pColStart[i] = rOpt.pColStart[i];\n            pColFormat[i] = rOpt.pColFormat[i];\n        }\n    }\n    else\n    {\n        pColStart = NULL;\n        pColFormat = NULL;\n    }\n}\n\n\nScAsciiOptions::~ScAsciiOptions()\n{\n    delete[] pColStart;\n    delete[] pColFormat;\n}\n\n\nvoid ScAsciiOptions::SetColInfo( USHORT nCount, const xub_StrLen* pStart, const BYTE* pFormat )\n{\n    delete[] pColStart;\n    delete[] pColFormat;\n\n    nInfoCount = nCount;\n\n    if (nInfoCount)\n    {\n        pColStart = new xub_StrLen[nInfoCount];\n        pColFormat = new BYTE[nInfoCount];\n        for (USHORT i=0; i<nInfoCount; i++)\n        {\n            pColStart[i] = pStart[i];\n            pColFormat[i] = pFormat[i];\n        }\n    }\n    else\n    {\n        pColStart = NULL;\n        pColFormat = NULL;\n    }\n}\n\n\nvoid ScAsciiOptions::SetColumnInfo( const ScCsvExpDataVec& rDataVec )\n{\n    delete[] pColStart;\n    pColStart = NULL;\n    delete[] pColFormat;\n    pColFormat = NULL;\n\n    nInfoCount = static_cast< sal_uInt16 >( rDataVec.size() );\n    if( nInfoCount )\n    {\n        pColStart = new xub_StrLen[ nInfoCount ];\n        pColFormat = new sal_uInt8[ nInfoCount ];\n        for( sal_uInt16 nIx = 0; nIx < nInfoCount; ++nIx )\n        {\n            pColStart[ nIx ] = rDataVec[ nIx ].mnIndex;\n            pColFormat[ nIx ] = rDataVec[ nIx ].mnType;\n        }\n    }\n}\n\n\nScAsciiOptions& ScAsciiOptions::operator=( const ScAsciiOptions& rCpy )\n{\n    SetColInfo( rCpy.nInfoCount, rCpy.pColStart, rCpy.pColFormat );\n\n    bFixedLen       = rCpy.bFixedLen;\n    aFieldSeps      = rCpy.aFieldSeps;\n    bMergeFieldSeps = rCpy.bMergeFieldSeps;\n    cTextSep        = rCpy.cTextSep;\n    eCharSet        = rCpy.eCharSet;\n    bCharSetSystem  = rCpy.bCharSetSystem;\n    nStartRow       = rCpy.nStartRow;\n\n    return *this;\n}\n\n\nBOOL ScAsciiOptions::operator==( const ScAsciiOptions& rCmp ) const\n{\n    if ( bFixedLen       == rCmp.bFixedLen &&\n         aFieldSeps      == rCmp.aFieldSeps &&\n         bMergeFieldSeps == rCmp.bMergeFieldSeps &&\n         cTextSep        == rCmp.cTextSep &&\n         eCharSet        == rCmp.eCharSet &&\n         bCharSetSystem  == rCmp.bCharSetSystem &&\n         nStartRow       == rCmp.nStartRow &&\n         nInfoCount      == rCmp.nInfoCount )\n    {\n        DBG_ASSERT( !nInfoCount || (pColStart && pColFormat && rCmp.pColStart && rCmp.pColFormat),\n                     \"0-Zeiger in ScAsciiOptions\" );\n        for (USHORT i=0; i<nInfoCount; i++)\n            if ( pColStart[i] != rCmp.pColStart[i] ||\n                 pColFormat[i] != rCmp.pColFormat[i] )\n                return FALSE;\n\n        return TRUE;\n    }\n    return FALSE;\n}\n\n\/\/\n\/\/  Der Options-String darf kein Semikolon mehr enthalten (wegen Pickliste)\n\/\/  darum ab Version 336 Komma stattdessen\n\/\/\n\n\nvoid ScAsciiOptions::ReadFromString( const String& rString )\n{\n    xub_StrLen nCount = rString.GetTokenCount(',');\n    String aToken;\n    xub_StrLen nSub;\n    xub_StrLen i;\n\n        \/\/\n        \/\/  Feld-Trenner\n        \/\/\n\n    if ( nCount >= 1 )\n    {\n        bFixedLen = bMergeFieldSeps = FALSE;\n        aFieldSeps.Erase();\n\n        aToken = rString.GetToken(0,',');\n        if ( aToken.EqualsAscii(pStrFix) )\n            bFixedLen = TRUE;\n        nSub = aToken.GetTokenCount('\/');\n        for ( i=0; i<nSub; i++ )\n        {\n            String aCode = aToken.GetToken( i, '\/' );\n            if ( aCode.EqualsAscii(pStrMrg) )\n                bMergeFieldSeps = TRUE;\n            else\n            {\n                sal_Int32 nVal = aCode.ToInt32();\n                if ( nVal )\n                    aFieldSeps += (sal_Unicode) nVal;\n            }\n        }\n    }\n\n        \/\/\n        \/\/  Text-Trenner\n        \/\/\n\n    if ( nCount >= 2 )\n    {\n        aToken = rString.GetToken(1,',');\n        sal_Int32 nVal = aToken.ToInt32();\n        cTextSep = (sal_Unicode) nVal;\n    }\n\n        \/\/\n        \/\/  Zeichensatz\n        \/\/\n\n    if ( nCount >= 3 )\n    {\n        aToken = rString.GetToken(2,',');\n        eCharSet = ScGlobal::GetCharsetValue( aToken );\n    }\n\n        \/\/\n        \/\/  Startzeile\n        \/\/\n\n    if ( nCount >= 4 )\n    {\n        aToken = rString.GetToken(3,',');\n        nStartRow = aToken.ToInt32();\n    }\n\n        \/\/\n        \/\/  Spalten-Infos\n        \/\/\n\n    if ( nCount >= 5 )\n    {\n        delete[] pColStart;\n        delete[] pColFormat;\n\n        aToken = rString.GetToken(4,',');\n        nSub = aToken.GetTokenCount('\/');\n        nInfoCount = nSub \/ 2;\n        if (nInfoCount)\n        {\n            pColStart = new xub_StrLen[nInfoCount];\n            pColFormat = new BYTE[nInfoCount];\n            for (USHORT nInfo=0; nInfo<nInfoCount; nInfo++)\n            {\n                pColStart[nInfo]  = (xub_StrLen) aToken.GetToken( 2*nInfo, '\/' ).ToInt32();\n                pColFormat[nInfo] = (BYTE) aToken.GetToken( 2*nInfo+1, '\/' ).ToInt32();\n            }\n        }\n        else\n        {\n            pColStart = NULL;\n            pColFormat = NULL;\n        }\n    }\n}\n\n\nString ScAsciiOptions::WriteToString() const\n{\n    String aOutStr;\n\n        \/\/\n        \/\/  Feld-Trenner\n        \/\/\n\n    if ( bFixedLen )\n        aOutStr.AppendAscii(pStrFix);\n    else if ( !aFieldSeps.Len() )\n        aOutStr += '0';\n    else\n    {\n        xub_StrLen nLen = aFieldSeps.Len();\n        for (xub_StrLen i=0; i<nLen; i++)\n        {\n            if (i)\n                aOutStr += '\/';\n            aOutStr += String::CreateFromInt32(aFieldSeps.GetChar(i));\n        }\n        if ( bMergeFieldSeps )\n        {\n            aOutStr += '\/';\n            aOutStr.AppendAscii(pStrMrg);\n        }\n    }\n\n    aOutStr += ',';                 \/\/ Token-Ende\n\n        \/\/\n        \/\/  Text-Trenner\n        \/\/\n\n    aOutStr += String::CreateFromInt32(cTextSep);\n    aOutStr += ',';                 \/\/ Token-Ende\n\n        \/\/\n        \/\/  Zeichensatz\n        \/\/\n\n    if ( bCharSetSystem )           \/\/ force \"SYSTEM\"\n        aOutStr += ScGlobal::GetCharsetString( RTL_TEXTENCODING_DONTKNOW );\n    else\n        aOutStr += ScGlobal::GetCharsetString( eCharSet );\n    aOutStr += ',';                 \/\/ Token-Ende\n\n        \/\/\n        \/\/  Startzeile\n        \/\/\n\n    aOutStr += String::CreateFromInt32(nStartRow);\n    aOutStr += ',';                 \/\/ Token-Ende\n\n        \/\/\n        \/\/  Spalten-Infos\n        \/\/\n\n    DBG_ASSERT( !nInfoCount || (pColStart && pColFormat), \"0-Zeiger in ScAsciiOptions\" );\n    for (USHORT nInfo=0; nInfo<nInfoCount; nInfo++)\n    {\n        if (nInfo)\n            aOutStr += '\/';\n        aOutStr += String::CreateFromInt32(pColStart[nInfo]);\n        aOutStr += '\/';\n        aOutStr += String::CreateFromInt32(pColFormat[nInfo]);\n    }\n\n    return aOutStr;\n}\n\n#if 0\n\/\/  Code, um die Spalten-Liste aus einem Excel-kompatiblen String zu erzeugen:\n\/\/  (im Moment nicht benutzt)\n\nvoid ScAsciiOptions::InterpretColumnList( const String& rString )\n{\n    \/\/  Eingabe ist 1-basiert, pColStart fuer FixedLen ist 0-basiert\n\n    \/\/  Kommas durch Semikolon ersetzen\n\n    String aSemiStr = rString;\n    USHORT nPos = 0;\n    do\n        nPos = aSemiStr.SearchAndReplace( ',', ';', nPos );\n    while ( nPos != STRING_NOTFOUND );\n\n    \/\/  Eintraege sortieren\n\n    USHORT nCount = aSemiStr.GetTokenCount();\n    USHORT* pTemp = new USHORT[nCount+1];\n    pTemp[0] = 1;                                   \/\/ erste Spalte faengt immer bei 1 an\n    USHORT nFound = 1;\n    USHORT i,j;\n    for (i=0; i<nCount; i++)\n    {\n        USHORT nVal = (USHORT) aSemiStr.GetToken(i);\n        if (nVal)\n        {\n            BOOL bThere = FALSE;\n            nPos = 0;\n            for (j=0; j<nFound; j++)\n            {\n                if ( pTemp[j] == nVal )\n                    bThere = TRUE;\n                else if ( pTemp[j] < nVal )\n                    nPos = j+1;\n            }\n            if ( !bThere )\n            {\n                if ( nPos < nFound )\n                    memmove( &pTemp[nPos+1], &pTemp[nPos], (nFound-nPos)*sizeof(USHORT) );\n                pTemp[nPos] = nVal;\n                ++nFound;\n            }\n        }\n    }\n\n    \/\/  Eintraege uebernehmen\n\n    delete[] pColStart;\n    delete[] pColFormat;\n    nInfoCount = nFound;\n    if (nInfoCount)\n    {\n        pColStart = new USHORT[nInfoCount];\n        pColFormat = new BYTE[nInfoCount];\n        for (i=0; i<nInfoCount; i++)\n        {\n            pColStart[i] = pTemp[i] - 1;\n            pColFormat[i] = SC_COL_STANDARD;\n        }\n    }\n    else\n    {\n        pColStart = NULL;\n        pColFormat = NULL;\n    }\n\n    bFixedLen = TRUE;           \/\/ sonst macht's keinen Sinn\n\n    \/\/  aufraeumen\n\n    delete[] pTemp;\n}\n#endif\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.24.492); FILE MERGED 2008\/04\/01 15:30:39 thb 1.24.492.2: #i85898# Stripping all external header guards 2008\/03\/31 17:15:13 rt 1.24.492.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: asciiopt.cxx,v $\n * $Revision: 1.25 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org.  If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sc.hxx\"\n\n\n\n#include \"global.hxx\"\n#include \"scresid.hxx\"\n#include \"impex.hxx\"\n#include \"asciiopt.hxx\"\n#include \"asciiopt.hrc\"\n#include <tools\/debug.hxx>\n#include <rtl\/tencinfo.h>\n#include <unotools\/transliterationwrapper.hxx>\n\/\/ ause\n#include \"editutil.hxx\"\n\n\/\/ ============================================================================\n\nstatic const sal_Char __FAR_DATA pStrFix[] = \"FIX\";\nstatic const sal_Char __FAR_DATA pStrMrg[] = \"MRG\";\n\n\n\/\/ ============================================================================\n\nScAsciiOptions::ScAsciiOptions() :\n    bFixedLen       ( FALSE ),\n    aFieldSeps      ( ';' ),\n    bMergeFieldSeps ( FALSE ),\n    cTextSep        ( cDefaultTextSep ),\n    eCharSet        ( gsl_getSystemTextEncoding() ),\n    bCharSetSystem  ( FALSE ),\n    nStartRow       ( 1 ),\n    nInfoCount      ( 0 ),\n    pColStart       ( NULL ),\n    pColFormat      ( NULL )\n{\n}\n\n\nScAsciiOptions::ScAsciiOptions(const ScAsciiOptions& rOpt) :\n    bFixedLen       ( rOpt.bFixedLen ),\n    aFieldSeps      ( rOpt.aFieldSeps ),\n    bMergeFieldSeps ( rOpt.bMergeFieldSeps ),\n    cTextSep        ( rOpt.cTextSep ),\n    eCharSet        ( rOpt.eCharSet ),\n    bCharSetSystem  ( rOpt.bCharSetSystem ),\n    nStartRow       ( rOpt.nStartRow ),\n    nInfoCount      ( rOpt.nInfoCount )\n{\n    if (nInfoCount)\n    {\n        pColStart = new xub_StrLen[nInfoCount];\n        pColFormat = new BYTE[nInfoCount];\n        for (USHORT i=0; i<nInfoCount; i++)\n        {\n            pColStart[i] = rOpt.pColStart[i];\n            pColFormat[i] = rOpt.pColFormat[i];\n        }\n    }\n    else\n    {\n        pColStart = NULL;\n        pColFormat = NULL;\n    }\n}\n\n\nScAsciiOptions::~ScAsciiOptions()\n{\n    delete[] pColStart;\n    delete[] pColFormat;\n}\n\n\nvoid ScAsciiOptions::SetColInfo( USHORT nCount, const xub_StrLen* pStart, const BYTE* pFormat )\n{\n    delete[] pColStart;\n    delete[] pColFormat;\n\n    nInfoCount = nCount;\n\n    if (nInfoCount)\n    {\n        pColStart = new xub_StrLen[nInfoCount];\n        pColFormat = new BYTE[nInfoCount];\n        for (USHORT i=0; i<nInfoCount; i++)\n        {\n            pColStart[i] = pStart[i];\n            pColFormat[i] = pFormat[i];\n        }\n    }\n    else\n    {\n        pColStart = NULL;\n        pColFormat = NULL;\n    }\n}\n\n\nvoid ScAsciiOptions::SetColumnInfo( const ScCsvExpDataVec& rDataVec )\n{\n    delete[] pColStart;\n    pColStart = NULL;\n    delete[] pColFormat;\n    pColFormat = NULL;\n\n    nInfoCount = static_cast< sal_uInt16 >( rDataVec.size() );\n    if( nInfoCount )\n    {\n        pColStart = new xub_StrLen[ nInfoCount ];\n        pColFormat = new sal_uInt8[ nInfoCount ];\n        for( sal_uInt16 nIx = 0; nIx < nInfoCount; ++nIx )\n        {\n            pColStart[ nIx ] = rDataVec[ nIx ].mnIndex;\n            pColFormat[ nIx ] = rDataVec[ nIx ].mnType;\n        }\n    }\n}\n\n\nScAsciiOptions& ScAsciiOptions::operator=( const ScAsciiOptions& rCpy )\n{\n    SetColInfo( rCpy.nInfoCount, rCpy.pColStart, rCpy.pColFormat );\n\n    bFixedLen       = rCpy.bFixedLen;\n    aFieldSeps      = rCpy.aFieldSeps;\n    bMergeFieldSeps = rCpy.bMergeFieldSeps;\n    cTextSep        = rCpy.cTextSep;\n    eCharSet        = rCpy.eCharSet;\n    bCharSetSystem  = rCpy.bCharSetSystem;\n    nStartRow       = rCpy.nStartRow;\n\n    return *this;\n}\n\n\nBOOL ScAsciiOptions::operator==( const ScAsciiOptions& rCmp ) const\n{\n    if ( bFixedLen       == rCmp.bFixedLen &&\n         aFieldSeps      == rCmp.aFieldSeps &&\n         bMergeFieldSeps == rCmp.bMergeFieldSeps &&\n         cTextSep        == rCmp.cTextSep &&\n         eCharSet        == rCmp.eCharSet &&\n         bCharSetSystem  == rCmp.bCharSetSystem &&\n         nStartRow       == rCmp.nStartRow &&\n         nInfoCount      == rCmp.nInfoCount )\n    {\n        DBG_ASSERT( !nInfoCount || (pColStart && pColFormat && rCmp.pColStart && rCmp.pColFormat),\n                     \"0-Zeiger in ScAsciiOptions\" );\n        for (USHORT i=0; i<nInfoCount; i++)\n            if ( pColStart[i] != rCmp.pColStart[i] ||\n                 pColFormat[i] != rCmp.pColFormat[i] )\n                return FALSE;\n\n        return TRUE;\n    }\n    return FALSE;\n}\n\n\/\/\n\/\/  Der Options-String darf kein Semikolon mehr enthalten (wegen Pickliste)\n\/\/  darum ab Version 336 Komma stattdessen\n\/\/\n\n\nvoid ScAsciiOptions::ReadFromString( const String& rString )\n{\n    xub_StrLen nCount = rString.GetTokenCount(',');\n    String aToken;\n    xub_StrLen nSub;\n    xub_StrLen i;\n\n        \/\/\n        \/\/  Feld-Trenner\n        \/\/\n\n    if ( nCount >= 1 )\n    {\n        bFixedLen = bMergeFieldSeps = FALSE;\n        aFieldSeps.Erase();\n\n        aToken = rString.GetToken(0,',');\n        if ( aToken.EqualsAscii(pStrFix) )\n            bFixedLen = TRUE;\n        nSub = aToken.GetTokenCount('\/');\n        for ( i=0; i<nSub; i++ )\n        {\n            String aCode = aToken.GetToken( i, '\/' );\n            if ( aCode.EqualsAscii(pStrMrg) )\n                bMergeFieldSeps = TRUE;\n            else\n            {\n                sal_Int32 nVal = aCode.ToInt32();\n                if ( nVal )\n                    aFieldSeps += (sal_Unicode) nVal;\n            }\n        }\n    }\n\n        \/\/\n        \/\/  Text-Trenner\n        \/\/\n\n    if ( nCount >= 2 )\n    {\n        aToken = rString.GetToken(1,',');\n        sal_Int32 nVal = aToken.ToInt32();\n        cTextSep = (sal_Unicode) nVal;\n    }\n\n        \/\/\n        \/\/  Zeichensatz\n        \/\/\n\n    if ( nCount >= 3 )\n    {\n        aToken = rString.GetToken(2,',');\n        eCharSet = ScGlobal::GetCharsetValue( aToken );\n    }\n\n        \/\/\n        \/\/  Startzeile\n        \/\/\n\n    if ( nCount >= 4 )\n    {\n        aToken = rString.GetToken(3,',');\n        nStartRow = aToken.ToInt32();\n    }\n\n        \/\/\n        \/\/  Spalten-Infos\n        \/\/\n\n    if ( nCount >= 5 )\n    {\n        delete[] pColStart;\n        delete[] pColFormat;\n\n        aToken = rString.GetToken(4,',');\n        nSub = aToken.GetTokenCount('\/');\n        nInfoCount = nSub \/ 2;\n        if (nInfoCount)\n        {\n            pColStart = new xub_StrLen[nInfoCount];\n            pColFormat = new BYTE[nInfoCount];\n            for (USHORT nInfo=0; nInfo<nInfoCount; nInfo++)\n            {\n                pColStart[nInfo]  = (xub_StrLen) aToken.GetToken( 2*nInfo, '\/' ).ToInt32();\n                pColFormat[nInfo] = (BYTE) aToken.GetToken( 2*nInfo+1, '\/' ).ToInt32();\n            }\n        }\n        else\n        {\n            pColStart = NULL;\n            pColFormat = NULL;\n        }\n    }\n}\n\n\nString ScAsciiOptions::WriteToString() const\n{\n    String aOutStr;\n\n        \/\/\n        \/\/  Feld-Trenner\n        \/\/\n\n    if ( bFixedLen )\n        aOutStr.AppendAscii(pStrFix);\n    else if ( !aFieldSeps.Len() )\n        aOutStr += '0';\n    else\n    {\n        xub_StrLen nLen = aFieldSeps.Len();\n        for (xub_StrLen i=0; i<nLen; i++)\n        {\n            if (i)\n                aOutStr += '\/';\n            aOutStr += String::CreateFromInt32(aFieldSeps.GetChar(i));\n        }\n        if ( bMergeFieldSeps )\n        {\n            aOutStr += '\/';\n            aOutStr.AppendAscii(pStrMrg);\n        }\n    }\n\n    aOutStr += ',';                 \/\/ Token-Ende\n\n        \/\/\n        \/\/  Text-Trenner\n        \/\/\n\n    aOutStr += String::CreateFromInt32(cTextSep);\n    aOutStr += ',';                 \/\/ Token-Ende\n\n        \/\/\n        \/\/  Zeichensatz\n        \/\/\n\n    if ( bCharSetSystem )           \/\/ force \"SYSTEM\"\n        aOutStr += ScGlobal::GetCharsetString( RTL_TEXTENCODING_DONTKNOW );\n    else\n        aOutStr += ScGlobal::GetCharsetString( eCharSet );\n    aOutStr += ',';                 \/\/ Token-Ende\n\n        \/\/\n        \/\/  Startzeile\n        \/\/\n\n    aOutStr += String::CreateFromInt32(nStartRow);\n    aOutStr += ',';                 \/\/ Token-Ende\n\n        \/\/\n        \/\/  Spalten-Infos\n        \/\/\n\n    DBG_ASSERT( !nInfoCount || (pColStart && pColFormat), \"0-Zeiger in ScAsciiOptions\" );\n    for (USHORT nInfo=0; nInfo<nInfoCount; nInfo++)\n    {\n        if (nInfo)\n            aOutStr += '\/';\n        aOutStr += String::CreateFromInt32(pColStart[nInfo]);\n        aOutStr += '\/';\n        aOutStr += String::CreateFromInt32(pColFormat[nInfo]);\n    }\n\n    return aOutStr;\n}\n\n#if 0\n\/\/  Code, um die Spalten-Liste aus einem Excel-kompatiblen String zu erzeugen:\n\/\/  (im Moment nicht benutzt)\n\nvoid ScAsciiOptions::InterpretColumnList( const String& rString )\n{\n    \/\/  Eingabe ist 1-basiert, pColStart fuer FixedLen ist 0-basiert\n\n    \/\/  Kommas durch Semikolon ersetzen\n\n    String aSemiStr = rString;\n    USHORT nPos = 0;\n    do\n        nPos = aSemiStr.SearchAndReplace( ',', ';', nPos );\n    while ( nPos != STRING_NOTFOUND );\n\n    \/\/  Eintraege sortieren\n\n    USHORT nCount = aSemiStr.GetTokenCount();\n    USHORT* pTemp = new USHORT[nCount+1];\n    pTemp[0] = 1;                                   \/\/ erste Spalte faengt immer bei 1 an\n    USHORT nFound = 1;\n    USHORT i,j;\n    for (i=0; i<nCount; i++)\n    {\n        USHORT nVal = (USHORT) aSemiStr.GetToken(i);\n        if (nVal)\n        {\n            BOOL bThere = FALSE;\n            nPos = 0;\n            for (j=0; j<nFound; j++)\n            {\n                if ( pTemp[j] == nVal )\n                    bThere = TRUE;\n                else if ( pTemp[j] < nVal )\n                    nPos = j+1;\n            }\n            if ( !bThere )\n            {\n                if ( nPos < nFound )\n                    memmove( &pTemp[nPos+1], &pTemp[nPos], (nFound-nPos)*sizeof(USHORT) );\n                pTemp[nPos] = nVal;\n                ++nFound;\n            }\n        }\n    }\n\n    \/\/  Eintraege uebernehmen\n\n    delete[] pColStart;\n    delete[] pColFormat;\n    nInfoCount = nFound;\n    if (nInfoCount)\n    {\n        pColStart = new USHORT[nInfoCount];\n        pColFormat = new BYTE[nInfoCount];\n        for (i=0; i<nInfoCount; i++)\n        {\n            pColStart[i] = pTemp[i] - 1;\n            pColFormat[i] = SC_COL_STANDARD;\n        }\n    }\n    else\n    {\n        pColStart = NULL;\n        pColFormat = NULL;\n    }\n\n    bFixedLen = TRUE;           \/\/ sonst macht's keinen Sinn\n\n    \/\/  aufraeumen\n\n    delete[] pTemp;\n}\n#endif\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_sc.hxx\"\n\n\n\n#include <com\/sun\/star\/table\/CellAddress.hpp>\n#include <com\/sun\/star\/table\/CellRangeAddress.hpp>\n\n#include <svl\/itemprop.hxx>\n\n#include \"docsh.hxx\"\n#include \"unonames.hxx\"\n#include \"unoguard.hxx\"\n#include \"miscuno.hxx\"\n#include \"convuno.hxx\"\n#include \"addruno.hxx\"\n\nusing namespace com::sun::star;\n\n\/\/------------------------------------------------------------------------\n\nScAddressConversionObj::ScAddressConversionObj(ScDocShell* pDocSh, sal_Bool bForRange) :\n    pDocShell( pDocSh ),\n    nRefSheet( 0 ),\n    bIsRange( bForRange )\n{\n    pDocShell->GetDocument()->AddUnoObject(*this);\n}\n\nScAddressConversionObj::~ScAddressConversionObj()\n{\n    if (pDocShell)\n        pDocShell->GetDocument()->RemoveUnoObject(*this);\n}\n\nvoid ScAddressConversionObj::Notify( SfxBroadcaster&, const SfxHint& rHint )\n{\n    if ( rHint.ISA( SfxSimpleHint ) &&\n            ((const SfxSimpleHint&)rHint).GetId() == SFX_HINT_DYING )\n    {\n        pDocShell = NULL;       \/\/ invalid\n    }\n}\n\nsal_Bool ScAddressConversionObj::ParseUIString( const String& rUIString, ::formula::FormulaGrammar::AddressConvention eConv )\n{\n    if (!pDocShell)\n        return sal_False;\n\n    ScDocument* pDoc = pDocShell->GetDocument();\n    sal_Bool bSuccess = sal_False;\n    if ( bIsRange )\n    {\n        sal_uInt16 nResult = aRange.ParseAny( rUIString, pDoc, eConv );\n        if ( nResult & SCA_VALID )\n        {\n            if ( ( nResult & SCA_TAB_3D ) == 0 )\n                aRange.aStart.SetTab( static_cast<SCTAB>(nRefSheet) );\n            if ( ( nResult & SCA_TAB2_3D ) == 0 )\n                aRange.aEnd.SetTab( aRange.aStart.Tab() );\n            \/\/ different sheets are not supported in CellRangeAddress\n            if ( aRange.aStart.Tab() == aRange.aEnd.Tab() )\n                bSuccess = sal_True;\n        }\n    }\n    else\n    {\n        sal_uInt16 nResult = aRange.aStart.Parse( rUIString, pDoc, eConv );\n        if ( nResult & SCA_VALID )\n        {\n            if ( ( nResult & SCA_TAB_3D ) == 0 )\n                aRange.aStart.SetTab( static_cast<SCTAB>(nRefSheet) );\n            bSuccess = sal_True;\n        }\n    }\n    return bSuccess;\n}\n\n\/\/ XPropertySet\n\nuno::Reference<beans::XPropertySetInfo> SAL_CALL ScAddressConversionObj::getPropertySetInfo()\n                                                        throw(uno::RuntimeException)\n{\n    ScUnoGuard aGuard;\n\n    if ( bIsRange )\n    {\n        static SfxItemPropertyMapEntry aPropertyMap[] =\n        {\n            {MAP_CHAR_LEN(SC_UNONAME_ADDRESS),  0,  &getCppuType((table::CellRangeAddress*)0), 0, 0 },\n            {MAP_CHAR_LEN(SC_UNONAME_PERSREPR), 0,  &getCppuType((rtl::OUString*)0),    0, 0 },\n            {MAP_CHAR_LEN(SC_UNONAME_REFSHEET), 0,  &getCppuType((sal_Int32*)0),        0, 0 },\n            {MAP_CHAR_LEN(SC_UNONAME_UIREPR),   0,  &getCppuType((rtl::OUString*)0),    0, 0 },\n            {MAP_CHAR_LEN(SC_UNONAME_XLA1REPR), 0,  &getCppuType((rtl::OUString*)0),    0, 0 },\n            {0,0,0,0,0,0}\n        };\n        static uno::Reference<beans::XPropertySetInfo> aRef(new SfxItemPropertySetInfo( aPropertyMap ));\n        return aRef;\n    }\n    else\n    {\n        static SfxItemPropertyMapEntry aPropertyMap[] =\n        {\n            {MAP_CHAR_LEN(SC_UNONAME_ADDRESS),  0,  &getCppuType((table::CellAddress*)0), 0, 0 },\n            {MAP_CHAR_LEN(SC_UNONAME_PERSREPR), 0,  &getCppuType((rtl::OUString*)0),    0, 0 },\n            {MAP_CHAR_LEN(SC_UNONAME_REFSHEET), 0,  &getCppuType((sal_Int32*)0),        0, 0 },\n            {MAP_CHAR_LEN(SC_UNONAME_UIREPR),   0,  &getCppuType((rtl::OUString*)0),    0, 0 },\n            {MAP_CHAR_LEN(SC_UNONAME_XLA1REPR), 0,  &getCppuType((rtl::OUString*)0),    0, 0 },\n            {0,0,0,0,0,0}\n        };\n        static uno::Reference<beans::XPropertySetInfo> aRef(new SfxItemPropertySetInfo( aPropertyMap ));\n        return aRef;\n    }\n}\n\nvoid SAL_CALL ScAddressConversionObj::setPropertyValue( const rtl::OUString& aPropertyName, const uno::Any& aValue )\n                throw(beans::UnknownPropertyException, beans::PropertyVetoException,\n                        lang::IllegalArgumentException, lang::WrappedTargetException,\n                        uno::RuntimeException)\n{\n    if ( !pDocShell )\n        throw uno::RuntimeException();\n\n    sal_Bool bSuccess = sal_False;\n    String aNameStr(aPropertyName);\n    if ( aNameStr.EqualsAscii( SC_UNONAME_ADDRESS ) )\n    {\n        \/\/  read the cell\/range address from API struct\n        if ( bIsRange )\n        {\n            table::CellRangeAddress aRangeAddress;\n            if ( aValue >>= aRangeAddress )\n            {\n                ScUnoConversion::FillScRange( aRange, aRangeAddress );\n                bSuccess = sal_True;\n            }\n        }\n        else\n        {\n            table::CellAddress aCellAddress;\n            if ( aValue >>= aCellAddress )\n            {\n                ScUnoConversion::FillScAddress( aRange.aStart, aCellAddress );\n                bSuccess = sal_True;\n            }\n        }\n    }\n    else if ( aNameStr.EqualsAscii( SC_UNONAME_REFSHEET ) )\n    {\n        \/\/  set the reference sheet\n        sal_Int32 nIntVal = 0;\n        if ( aValue >>= nIntVal )\n        {\n            nRefSheet = nIntVal;\n            bSuccess = sal_True;\n        }\n    }\n    else if ( aNameStr.EqualsAscii( SC_UNONAME_UIREPR ) )\n    {\n        \/\/  parse the UI representation string\n        rtl::OUString sRepresentation;\n        if (aValue >>= sRepresentation)\n        {\n            String aUIString = sRepresentation;\n            bSuccess = ParseUIString( aUIString );\n        }\n    }\n    else if ( aNameStr.EqualsAscii( SC_UNONAME_PERSREPR ) || aNameStr.EqualsAscii( SC_UNONAME_XLA1REPR ) )\n    {\n        ::formula::FormulaGrammar::AddressConvention eConv = aNameStr.EqualsAscii( SC_UNONAME_XLA1REPR ) ?\n            ::formula::FormulaGrammar::CONV_OOO : ::formula::FormulaGrammar::CONV_XL_A1;\n\n        \/\/  parse the file format string\n        rtl::OUString sRepresentation;\n        if (aValue >>= sRepresentation)\n        {\n            String aUIString(sRepresentation);\n\n            \/\/  cell or range: strip a single \".\" at the start\n            if ( aUIString.GetChar(0) == (sal_Unicode) '.' )\n                aUIString.Erase( 0, 1 );\n\n            if ( bIsRange )\n            {\n                \/\/  range: also strip a \".\" after the last colon\n                sal_Int32 nColon = rtl::OUString(aUIString).lastIndexOf( (sal_Unicode) ':' );\n                if ( nColon >= 0 && nColon < aUIString.Len() - 1 &&\n                     aUIString.GetChar((xub_StrLen)nColon+1) == (sal_Unicode) '.' )\n                    aUIString.Erase( (xub_StrLen)nColon+1, 1 );\n            }\n\n            \/\/  parse the rest like a UI string\n            bSuccess = ParseUIString( aUIString, eConv );\n        }\n    }\n    else\n        throw beans::UnknownPropertyException();\n\n    if ( !bSuccess )\n        throw lang::IllegalArgumentException();\n}\n\nuno::Any SAL_CALL ScAddressConversionObj::getPropertyValue( const rtl::OUString& aPropertyName )\n                throw(beans::UnknownPropertyException, lang::WrappedTargetException,\n                        uno::RuntimeException)\n{\n    if ( !pDocShell )\n        throw uno::RuntimeException();\n\n    ScDocument* pDoc = pDocShell->GetDocument();\n    uno::Any aRet;\n\n    String aNameStr(aPropertyName);\n    if ( aNameStr.EqualsAscii( SC_UNONAME_ADDRESS ) )\n    {\n        if ( bIsRange )\n        {\n            table::CellRangeAddress aRangeAddress;\n            ScUnoConversion::FillApiRange( aRangeAddress, aRange );\n            aRet <<= aRangeAddress;\n        }\n        else\n        {\n            table::CellAddress aCellAddress;\n            ScUnoConversion::FillApiAddress( aCellAddress, aRange.aStart );\n            aRet <<= aCellAddress;\n        }\n    }\n    else if ( aNameStr.EqualsAscii( SC_UNONAME_REFSHEET ) )\n    {\n        aRet <<= nRefSheet;\n    }\n    else if ( aNameStr.EqualsAscii( SC_UNONAME_UIREPR ) )\n    {\n        \/\/  generate UI representation string - include sheet only if different from ref sheet\n        String aFormatStr;\n        sal_uInt16 nFlags = SCA_VALID;\n        if ( aRange.aStart.Tab() != nRefSheet )\n            nFlags |= SCA_TAB_3D;\n        if ( bIsRange )\n            aRange.Format( aFormatStr, nFlags, pDoc );\n        else\n            aRange.aStart.Format( aFormatStr, nFlags, pDoc );\n        aRet <<= rtl::OUString( aFormatStr );\n    }\n    else if ( aNameStr.EqualsAscii( SC_UNONAME_PERSREPR ) || aNameStr.EqualsAscii( SC_UNONAME_XLA1REPR ) )\n    {\n        ::formula::FormulaGrammar::AddressConvention eConv = aNameStr.EqualsAscii( SC_UNONAME_XLA1REPR ) ?\n            ::formula::FormulaGrammar::CONV_OOO : ::formula::FormulaGrammar::CONV_XL_A1;\n\n        \/\/  generate file format string - always include sheet\n        String aFormatStr;\n        aRange.aStart.Format( aFormatStr, SCA_VALID | SCA_TAB_3D, pDoc, eConv );\n        if ( bIsRange )\n        {\n            \/\/  manually concatenate range so both parts always have the sheet name\n            aFormatStr.Append( (sal_Unicode) ':' );\n            String aSecond;\n            sal_uInt16 nFlags = SCA_VALID;\n            if( eConv != ::formula::FormulaGrammar::CONV_XL_A1 )\n                nFlags |= SCA_TAB_3D;\n            aRange.aEnd.Format( aSecond, nFlags, pDoc, eConv );\n            aFormatStr.Append( aSecond );\n        }\n        aRet <<= rtl::OUString( aFormatStr );\n    }\n    else\n        throw beans::UnknownPropertyException();\n\n    return aRet;\n}\n\nSC_IMPL_DUMMY_PROPERTY_LISTENER( ScAddressConversionObj )\n\n\/\/ lang::XServiceInfo\n\nrtl::OUString SAL_CALL ScAddressConversionObj::getImplementationName() throw(uno::RuntimeException)\n{\n    return rtl::OUString::createFromAscii( \"ScAddressConversionObj\" );\n}\n\nsal_Bool SAL_CALL ScAddressConversionObj::supportsService( const rtl::OUString& rServiceName )\n                                                    throw(uno::RuntimeException)\n{\n    String aServiceStr( rServiceName );\n    return aServiceStr.EqualsAscii( bIsRange ? SC_SERVICENAME_RANGEADDRESS\n                                             : SC_SERVICENAME_CELLADDRESS );\n}\n\nuno::Sequence<rtl::OUString> SAL_CALL ScAddressConversionObj::getSupportedServiceNames()\n                                                    throw(uno::RuntimeException)\n{\n    uno::Sequence<rtl::OUString> aRet(1);\n    rtl::OUString* pArray = aRet.getArray();\n    pArray[0] = rtl::OUString::createFromAscii( bIsRange ? SC_SERVICENAME_RANGEADDRESS\n                                                         : SC_SERVICENAME_CELLADDRESS );\n    return aRet;\n}\n\n<commit_msg>CWS-TOOLING: integrate CWS dba34d<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_sc.hxx\"\n\n\n\n#include <com\/sun\/star\/table\/CellAddress.hpp>\n#include <com\/sun\/star\/table\/CellRangeAddress.hpp>\n\n#include <svl\/itemprop.hxx>\n\n#include \"docsh.hxx\"\n#include \"unonames.hxx\"\n#include \"unoguard.hxx\"\n#include \"miscuno.hxx\"\n#include \"convuno.hxx\"\n#include \"addruno.hxx\"\n\nusing namespace com::sun::star;\n\n\/\/------------------------------------------------------------------------\n\nScAddressConversionObj::ScAddressConversionObj(ScDocShell* pDocSh, sal_Bool bForRange) :\n    pDocShell( pDocSh ),\n    nRefSheet( 0 ),\n    bIsRange( bForRange )\n{\n    pDocShell->GetDocument()->AddUnoObject(*this);\n}\n\nScAddressConversionObj::~ScAddressConversionObj()\n{\n    if (pDocShell)\n        pDocShell->GetDocument()->RemoveUnoObject(*this);\n}\n\nvoid ScAddressConversionObj::Notify( SfxBroadcaster&, const SfxHint& rHint )\n{\n    if ( rHint.ISA( SfxSimpleHint ) &&\n            ((const SfxSimpleHint&)rHint).GetId() == SFX_HINT_DYING )\n    {\n        pDocShell = NULL;       \/\/ invalid\n    }\n}\n\nsal_Bool ScAddressConversionObj::ParseUIString( const String& rUIString, ::formula::FormulaGrammar::AddressConvention eConv )\n{\n    if (!pDocShell)\n        return sal_False;\n\n    ScDocument* pDoc = pDocShell->GetDocument();\n    sal_Bool bSuccess = sal_False;\n    if ( bIsRange )\n    {\n        sal_uInt16 nResult = aRange.ParseAny( rUIString, pDoc, eConv );\n        if ( nResult & SCA_VALID )\n        {\n            if ( ( nResult & SCA_TAB_3D ) == 0 )\n                aRange.aStart.SetTab( static_cast<SCTAB>(nRefSheet) );\n            if ( ( nResult & SCA_TAB2_3D ) == 0 )\n                aRange.aEnd.SetTab( aRange.aStart.Tab() );\n            \/\/ different sheets are not supported in CellRangeAddress\n            if ( aRange.aStart.Tab() == aRange.aEnd.Tab() )\n                bSuccess = sal_True;\n        }\n    }\n    else\n    {\n        sal_uInt16 nResult = aRange.aStart.Parse( rUIString, pDoc, eConv );\n        if ( nResult & SCA_VALID )\n        {\n            if ( ( nResult & SCA_TAB_3D ) == 0 )\n                aRange.aStart.SetTab( static_cast<SCTAB>(nRefSheet) );\n            bSuccess = sal_True;\n        }\n    }\n    return bSuccess;\n}\n\n\/\/ XPropertySet\n\nuno::Reference<beans::XPropertySetInfo> SAL_CALL ScAddressConversionObj::getPropertySetInfo()\n                                                        throw(uno::RuntimeException)\n{\n    ScUnoGuard aGuard;\n\n    if ( bIsRange )\n    {\n        static SfxItemPropertyMapEntry aPropertyMap[] =\n        {\n            {MAP_CHAR_LEN(SC_UNONAME_ADDRESS),  0,  &getCppuType((table::CellRangeAddress*)0), 0, 0 },\n            {MAP_CHAR_LEN(SC_UNONAME_PERSREPR), 0,  &getCppuType((rtl::OUString*)0),    0, 0 },\n            {MAP_CHAR_LEN(SC_UNONAME_REFSHEET), 0,  &getCppuType((sal_Int32*)0),        0, 0 },\n            {MAP_CHAR_LEN(SC_UNONAME_UIREPR),   0,  &getCppuType((rtl::OUString*)0),    0, 0 },\n            {MAP_CHAR_LEN(SC_UNONAME_XLA1REPR), 0,  &getCppuType((rtl::OUString*)0),    0, 0 },\n            {0,0,0,0,0,0}\n        };\n        static uno::Reference<beans::XPropertySetInfo> aRef(new SfxItemPropertySetInfo( aPropertyMap ));\n        return aRef;\n    }\n    else\n    {\n        static SfxItemPropertyMapEntry aPropertyMap[] =\n        {\n            {MAP_CHAR_LEN(SC_UNONAME_ADDRESS),  0,  &getCppuType((table::CellAddress*)0), 0, 0 },\n            {MAP_CHAR_LEN(SC_UNONAME_PERSREPR), 0,  &getCppuType((rtl::OUString*)0),    0, 0 },\n            {MAP_CHAR_LEN(SC_UNONAME_REFSHEET), 0,  &getCppuType((sal_Int32*)0),        0, 0 },\n            {MAP_CHAR_LEN(SC_UNONAME_UIREPR),   0,  &getCppuType((rtl::OUString*)0),    0, 0 },\n            {MAP_CHAR_LEN(SC_UNONAME_XLA1REPR), 0,  &getCppuType((rtl::OUString*)0),    0, 0 },\n            {0,0,0,0,0,0}\n        };\n        static uno::Reference<beans::XPropertySetInfo> aRef(new SfxItemPropertySetInfo( aPropertyMap ));\n        return aRef;\n    }\n}\n\nvoid SAL_CALL ScAddressConversionObj::setPropertyValue( const rtl::OUString& aPropertyName, const uno::Any& aValue )\n                throw(beans::UnknownPropertyException, beans::PropertyVetoException,\n                        lang::IllegalArgumentException, lang::WrappedTargetException,\n                        uno::RuntimeException)\n{\n    if ( !pDocShell )\n        throw uno::RuntimeException();\n\n    sal_Bool bSuccess = sal_False;\n    String aNameStr(aPropertyName);\n    if ( aNameStr.EqualsAscii( SC_UNONAME_ADDRESS ) )\n    {\n        \/\/  read the cell\/range address from API struct\n        if ( bIsRange )\n        {\n            table::CellRangeAddress aRangeAddress;\n            if ( aValue >>= aRangeAddress )\n            {\n                ScUnoConversion::FillScRange( aRange, aRangeAddress );\n                bSuccess = sal_True;\n            }\n        }\n        else\n        {\n            table::CellAddress aCellAddress;\n            if ( aValue >>= aCellAddress )\n            {\n                ScUnoConversion::FillScAddress( aRange.aStart, aCellAddress );\n                bSuccess = sal_True;\n            }\n        }\n    }\n    else if ( aNameStr.EqualsAscii( SC_UNONAME_REFSHEET ) )\n    {\n        \/\/  set the reference sheet\n        sal_Int32 nIntVal = 0;\n        if ( aValue >>= nIntVal )\n        {\n            nRefSheet = nIntVal;\n            bSuccess = sal_True;\n        }\n    }\n    else if ( aNameStr.EqualsAscii( SC_UNONAME_UIREPR ) )\n    {\n        \/\/  parse the UI representation string\n        rtl::OUString sRepresentation;\n        if (aValue >>= sRepresentation)\n        {\n            String aUIString = sRepresentation;\n            bSuccess = ParseUIString( aUIString );\n        }\n    }\n    else if ( aNameStr.EqualsAscii( SC_UNONAME_PERSREPR ) || aNameStr.EqualsAscii( SC_UNONAME_XLA1REPR ) )\n    {\n        ::formula::FormulaGrammar::AddressConvention eConv = aNameStr.EqualsAscii( SC_UNONAME_XLA1REPR ) ?\n            ::formula::FormulaGrammar::CONV_XL_A1 : ::formula::FormulaGrammar::CONV_OOO;\n\n        \/\/  parse the file format string\n        rtl::OUString sRepresentation;\n        if (aValue >>= sRepresentation)\n        {\n            String aUIString(sRepresentation);\n\n            \/\/  cell or range: strip a single \".\" at the start\n            if ( aUIString.GetChar(0) == (sal_Unicode) '.' )\n                aUIString.Erase( 0, 1 );\n\n            if ( bIsRange )\n            {\n                \/\/  range: also strip a \".\" after the last colon\n                sal_Int32 nColon = rtl::OUString(aUIString).lastIndexOf( (sal_Unicode) ':' );\n                if ( nColon >= 0 && nColon < aUIString.Len() - 1 &&\n                     aUIString.GetChar((xub_StrLen)nColon+1) == (sal_Unicode) '.' )\n                    aUIString.Erase( (xub_StrLen)nColon+1, 1 );\n            }\n\n            \/\/  parse the rest like a UI string\n            bSuccess = ParseUIString( aUIString, eConv );\n        }\n    }\n    else\n        throw beans::UnknownPropertyException();\n\n    if ( !bSuccess )\n        throw lang::IllegalArgumentException();\n}\n\nuno::Any SAL_CALL ScAddressConversionObj::getPropertyValue( const rtl::OUString& aPropertyName )\n                throw(beans::UnknownPropertyException, lang::WrappedTargetException,\n                        uno::RuntimeException)\n{\n    if ( !pDocShell )\n        throw uno::RuntimeException();\n\n    ScDocument* pDoc = pDocShell->GetDocument();\n    uno::Any aRet;\n\n    String aNameStr(aPropertyName);\n    if ( aNameStr.EqualsAscii( SC_UNONAME_ADDRESS ) )\n    {\n        if ( bIsRange )\n        {\n            table::CellRangeAddress aRangeAddress;\n            ScUnoConversion::FillApiRange( aRangeAddress, aRange );\n            aRet <<= aRangeAddress;\n        }\n        else\n        {\n            table::CellAddress aCellAddress;\n            ScUnoConversion::FillApiAddress( aCellAddress, aRange.aStart );\n            aRet <<= aCellAddress;\n        }\n    }\n    else if ( aNameStr.EqualsAscii( SC_UNONAME_REFSHEET ) )\n    {\n        aRet <<= nRefSheet;\n    }\n    else if ( aNameStr.EqualsAscii( SC_UNONAME_UIREPR ) )\n    {\n        \/\/  generate UI representation string - include sheet only if different from ref sheet\n        String aFormatStr;\n        sal_uInt16 nFlags = SCA_VALID;\n        if ( aRange.aStart.Tab() != nRefSheet )\n            nFlags |= SCA_TAB_3D;\n        if ( bIsRange )\n            aRange.Format( aFormatStr, nFlags, pDoc );\n        else\n            aRange.aStart.Format( aFormatStr, nFlags, pDoc );\n        aRet <<= rtl::OUString( aFormatStr );\n    }\n    else if ( aNameStr.EqualsAscii( SC_UNONAME_PERSREPR ) || aNameStr.EqualsAscii( SC_UNONAME_XLA1REPR ) )\n    {\n        ::formula::FormulaGrammar::AddressConvention eConv = aNameStr.EqualsAscii( SC_UNONAME_XLA1REPR ) ?\n            ::formula::FormulaGrammar::CONV_XL_A1 : ::formula::FormulaGrammar::CONV_OOO;\n\n        \/\/  generate file format string - always include sheet\n        String aFormatStr;\n        aRange.aStart.Format( aFormatStr, SCA_VALID | SCA_TAB_3D, pDoc, eConv );\n        if ( bIsRange )\n        {\n            \/\/  manually concatenate range so both parts always have the sheet name\n            aFormatStr.Append( (sal_Unicode) ':' );\n            String aSecond;\n            sal_uInt16 nFlags = SCA_VALID;\n            if( eConv != ::formula::FormulaGrammar::CONV_XL_A1 )\n                nFlags |= SCA_TAB_3D;\n            aRange.aEnd.Format( aSecond, nFlags, pDoc, eConv );\n            aFormatStr.Append( aSecond );\n        }\n        aRet <<= rtl::OUString( aFormatStr );\n    }\n    else\n        throw beans::UnknownPropertyException();\n\n    return aRet;\n}\n\nSC_IMPL_DUMMY_PROPERTY_LISTENER( ScAddressConversionObj )\n\n\/\/ lang::XServiceInfo\n\nrtl::OUString SAL_CALL ScAddressConversionObj::getImplementationName() throw(uno::RuntimeException)\n{\n    return rtl::OUString::createFromAscii( \"ScAddressConversionObj\" );\n}\n\nsal_Bool SAL_CALL ScAddressConversionObj::supportsService( const rtl::OUString& rServiceName )\n                                                    throw(uno::RuntimeException)\n{\n    String aServiceStr( rServiceName );\n    return aServiceStr.EqualsAscii( bIsRange ? SC_SERVICENAME_RANGEADDRESS\n                                             : SC_SERVICENAME_CELLADDRESS );\n}\n\nuno::Sequence<rtl::OUString> SAL_CALL ScAddressConversionObj::getSupportedServiceNames()\n                                                    throw(uno::RuntimeException)\n{\n    uno::Sequence<rtl::OUString> aRet(1);\n    rtl::OUString* pArray = aRet.getArray();\n    pArray[0] = rtl::OUString::createFromAscii( bIsRange ? SC_SERVICENAME_RANGEADDRESS\n                                                         : SC_SERVICENAME_CELLADDRESS );\n    return aRet;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    This file is part of libkcal.\n    Copyright (c) 2001 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 <qdatetime.h>\n#include <qstring.h>\n#include <qptrlist.h>\n#include <qregexp.h>\n#include <qclipboard.h>\n#include <qfile.h>\n#include <qtextstream.h>\n\n#include <kdebug.h>\n#include <klocale.h>\n\nextern \"C\" {\n  #include <ical.h>\n  #include <icalss.h>\n  #include <icalparser.h>\n  #include <icalrestriction.h>\n}\n\n#include \"calendar.h\"\n#include \"calendarlocal.h\"\n#include \"journal.h\"\n\n#include \"icalformat.h\"\n#include \"icalformatimpl.h\"\n\n#define _ICAL_VERSION \"2.0\"\n\nusing namespace KCal;\n\nICalFormat::ICalFormat()\n{\n  mImpl = new ICalFormatImpl( this );\n\n  mTimeZoneId = \"UTC\";\n  mUtc = true;\n}\n\nICalFormat::~ICalFormat()\n{\n  delete mImpl;\n}\n\nbool ICalFormat::load( Calendar *calendar, const QString &fileName)\n{\n  kdDebug(5800) << \"ICalFormat::load() \" << fileName << endl;\n\n  clearException();\n\n  QFile file( fileName );\n  if (!file.open( IO_ReadOnly ) ) {\n    kdDebug(5800) << \"ICalFormat::load() load error\" << endl;\n    setException(new ErrorFormat(ErrorFormat::LoadError));\n    return false;\n  }\n  QTextStream ts( &file );\n  QString text = ts.read();\n  file.close();\n\n  return fromString( calendar, text );\n}\n\n\nbool ICalFormat::save( Calendar *calendar, const QString &fileName )\n{\n  kdDebug(5800) << \"ICalFormat::save(): \" << fileName << endl;\n\n  clearException();\n\n  QString text = toString( calendar );\n\n  if ( text.isNull() ) return false;\n\n  \/\/ TODO: write backup file\n\n  QFile file( fileName );\n  if (!file.open( IO_WriteOnly ) ) {\n    setException(new ErrorFormat(ErrorFormat::SaveError,\n                 i18n(\"Could not open file '%1'\").arg(fileName)));\n    return false;\n  }\n  QTextStream ts( &file );\n  ts << text;\n  file.close();\n\n  return true;\n}\n\nbool ICalFormat::fromString( Calendar *cal, const QString &text )\n{\n  setTimeZone( cal->timeZoneId(), !cal->isLocalTime() );\n\n  \/\/ Get first VCALENDAR component.\n  \/\/ TODO: Handle more than one VCALENDAR or non-VCALENDAR top components\n  icalcomponent *calendar;\n\n  calendar = icalcomponent_new_from_string( text.local8Bit().data());\n  \/\/  kdDebug(5800) << \"Error: \" << icalerror_perror() << endl;\n  if (!calendar) {\n    kdDebug(5800) << \"ICalFormat::load() parse error\" << endl;\n    setException(new ErrorFormat(ErrorFormat::ParseErrorIcal));\n    return false;\n  }\n\n  bool success = true;\n\n  if (icalcomponent_isa(calendar) != ICAL_VCALENDAR_COMPONENT) {\n    kdDebug(5800) << \"ICalFormat::load(): No VCALENDAR component found\" << endl;\n    setException(new ErrorFormat(ErrorFormat::NoCalendar));\n    success = false;\n  } else {\n    \/\/ put all objects into their proper places\n    if ( !mImpl->populate( cal, calendar ) ) {\n      kdDebug(5800) << \"ICalFormat::load(): Could not populate calendar\" << endl;\n      if ( !exception() ) {\n        setException(new ErrorFormat(ErrorFormat::ParseErrorKcal));\n      }\n      success = false;\n    } else\n      mLoadedProductId = mImpl->loadedProductId();\n  }\n\n  icalcomponent_free( calendar );\n\n  return success;\n}\n\nIncidence *ICalFormat::fromString( const QString &text )\n{\n  CalendarLocal cal( mTimeZoneId );\n  fromString(&cal, text);\n  \n  Incidence *ical = 0;\n  QPtrList<Event> elist = cal.events();\n  if ( elist.count() > 0 ) {\n    ical = elist.first();\n  } else {\n    QPtrList<Todo> tlist = cal.todos();\n    if ( tlist.count() > 0 ) {\n      ical = tlist.first();\n    } else {\n      QPtrList<Journal> jlist = cal.journals();\n      if ( jlist.count() > 0 ) {\n        ical = jlist.first();\n      }\n    }\n  }\n  return ical;\n}\n\nQString ICalFormat::toString( Calendar *cal )\n{\n  setTimeZone( cal->timeZoneId(), !cal->isLocalTime() );\n\n  icalcomponent *calendar = mImpl->createCalendarComponent(cal);\n\n  icalcomponent *component;\n\n  \/\/ todos\n  QPtrList<Todo> todoList = cal->rawTodos();\n  QPtrListIterator<Todo> qlt(todoList);\n  for (; qlt.current(); ++qlt) {\n    component = mImpl->writeTodo(qlt.current());\n    icalcomponent_add_component(calendar,component);\n  }\n\n  \/\/ events\n  QPtrList<Event> events = cal->rawEvents();\n  Event *ev;\n  for(ev=events.first();ev;ev=events.next()) {\n    component = mImpl->writeEvent(ev);\n    icalcomponent_add_component(calendar,component);\n  }\n\n  \/\/ journals\n  QPtrList<Journal> journals = cal->journals();\n  Journal *j;\n  for(j=journals.first();j;j=journals.next()) {\n    component = mImpl->writeJournal(j);\n    icalcomponent_add_component(calendar,component);\n  }\n\n  const char *text = icalcomponent_as_ical_string( calendar );\n\n  icalcomponent_free( calendar );\n\n  if (!text) {\n    setException(new ErrorFormat(ErrorFormat::SaveError,\n                 i18n(\"libical error\")));\n    return QString::null;\n  }\n\n  return QString::fromLocal8Bit( text );\n}\n\nQString ICalFormat::toICalString( Incidence *incidence )\n{\n  CalendarLocal cal( mTimeZoneId );\n  cal.addIncidence( incidence->clone() );\n  return toString( &cal );\n}\n\nQString ICalFormat::toString( Incidence *incidence )\n{\n  icalcomponent *component;\n\n  component = mImpl->writeIncidence( incidence );\n\n  const char *text = icalcomponent_as_ical_string( component );\n\n  icalcomponent_free( component );\n\n  return QString::fromLocal8Bit( text );\n}\n\nQString ICalFormat::toString( Recurrence *recurrence )\n{\n  icalproperty *property;\n  property = mImpl->writeRecurrenceRule( recurrence );\n  const char *text = icalproperty_as_ical_string( property );\n  icalproperty_free( property );\n  return QString::fromLocal8Bit( text );\n}\n\nbool ICalFormat::fromString( Recurrence * recurrence, const QString& rrule )\n{\n  bool success = true;\n  icalerror_clear_errno();\n  struct icalrecurrencetype recur = icalrecurrencetype_from_string( rrule );\n  if ( icalerrno != ICAL_NO_ERROR ) {\n    kdDebug() << \"Recurrence parsing error: \" << icalerror_strerror( icalerrno ) << endl;\n    success = false;\n  }\n\n  if ( success ) {\n    mImpl->readRecurrence( recur, recurrence );\n  }\n\n  return success;\n}\n\n\nQString ICalFormat::createScheduleMessage(IncidenceBase *incidence,\n                                          Scheduler::Method method)\n{\n  icalcomponent *message = mImpl->createScheduleComponent(incidence,method);\n\n  QString messageText = icalcomponent_as_ical_string(message);\n\n#if 0\n  kdDebug(5800) << \"ICalFormat::createScheduleMessage: message START\\n\"\n            << messageText\n            << \"ICalFormat::createScheduleMessage: message END\" << endl;\n#endif\n\n  return messageText;\n}\n\nScheduleMessage *ICalFormat::parseScheduleMessage( Calendar *cal,\n                                                   const QString &messageText )\n{\n  setTimeZone( cal->timeZoneId(), !cal->isLocalTime() );\n  clearException();\n\n  if (messageText.isEmpty()) return 0;\n\n  icalcomponent *message;\n  message = icalparser_parse_string(messageText.local8Bit());\n\n  if (!message) return 0;\n\n  icalproperty *m = icalcomponent_get_first_property(message,\n                                                     ICAL_METHOD_PROPERTY);\n\n  if (!m) return 0;\n\n  icalcomponent *c;\n\n  IncidenceBase *incidence = 0;\n  c = icalcomponent_get_first_component(message,ICAL_VEVENT_COMPONENT);\n  if (c) {\n    incidence = mImpl->readEvent(c);\n  }\n\n  if (!incidence) {\n    c = icalcomponent_get_first_component(message,ICAL_VTODO_COMPONENT);\n    if (c) {\n      incidence = mImpl->readTodo(c);\n    }\n  }\n\n  if (!incidence) {\n    c = icalcomponent_get_first_component(message,ICAL_VFREEBUSY_COMPONENT);\n    if (c) {\n      incidence = mImpl->readFreeBusy(c);\n    }\n  }\n\n  if (!incidence) {\n    kdDebug() << \"ICalFormat:parseScheduleMessage: object is not a freebusy, event or todo\" << endl;\n    return 0;\n  }\n\n  kdDebug(5800) << \"ICalFormat::parseScheduleMessage() getting method...\" << endl;\n\n  icalproperty_method icalmethod = icalproperty_get_method(m);\n  Scheduler::Method method;\n\n  switch (icalmethod) {\n    case ICAL_METHOD_PUBLISH:\n      method = Scheduler::Publish;\n      break;\n    case ICAL_METHOD_REQUEST:\n      method = Scheduler::Request;\n      break;\n    case ICAL_METHOD_REFRESH:\n      method = Scheduler::Refresh;\n      break;\n    case ICAL_METHOD_CANCEL:\n      method = Scheduler::Cancel;\n      break;\n    case ICAL_METHOD_ADD:\n      method = Scheduler::Add;\n      break;\n    case ICAL_METHOD_REPLY:\n      method = Scheduler::Reply;\n      break;\n    case ICAL_METHOD_COUNTER:\n      method = Scheduler::Counter;\n      break;\n    case ICAL_METHOD_DECLINECOUNTER:\n      method = Scheduler::Declinecounter;\n      break;\n    default:\n      method = Scheduler::NoMethod;\n      kdDebug(5800) << \"ICalFormat::parseScheduleMessage(): Unknow method\" << endl;\n      break;\n  }\n\n  kdDebug(5800) << \"ICalFormat::parseScheduleMessage() restriction...\" << endl;\n\n  if (!icalrestriction_check(message)) {\n    setException(new ErrorFormat(ErrorFormat::Restriction,\n                                   Scheduler::translatedMethodName(method) + \": \" +\n                                   mImpl->extractErrorProperty(c)));\n    return 0;\n  }\n\n  icalcomponent *calendarComponent = mImpl->createCalendarComponent(cal);\n\n  Incidence *existingIncidence = cal->event(incidence->uid());\n  if (existingIncidence) {\n    \/\/ TODO: check, if cast is required, or if it can be done by virtual funcs.\n    if (existingIncidence->type() == \"Todo\") {\n      Todo *todo = static_cast<Todo *>(existingIncidence);\n      icalcomponent_add_component(calendarComponent,\n                                  mImpl->writeTodo(todo));\n    }\n    if (existingIncidence->type() == \"Event\") {\n      Event *event = static_cast<Event *>(existingIncidence);\n      icalcomponent_add_component(calendarComponent,\n                                  mImpl->writeEvent(event));\n    }\n  } else {\n    calendarComponent = 0;\n  }\n\n  kdDebug(5800) << \"ICalFormat::parseScheduleMessage() classify...\" << endl;\n\n  icalclass result = icalclassify(message,calendarComponent,(char *)\"\");\n\n  kdDebug(5800) << \"ICalFormat::parseScheduleMessage() returning...\" << endl;\n\n  ScheduleMessage::Status status;\n\n  switch (result) {\n    case ICAL_PUBLISH_NEW_CLASS:\n      status = ScheduleMessage::PublishNew;\n      break;\n    case ICAL_OBSOLETE_CLASS:\n      status = ScheduleMessage::Obsolete;\n      break;\n    case ICAL_REQUEST_NEW_CLASS:\n      status = ScheduleMessage::RequestNew;\n      break;\n    case ICAL_REQUEST_UPDATE_CLASS:\n      status = ScheduleMessage::RequestUpdate;\n      break;\n    case ICAL_UNKNOWN_CLASS:\n    default:\n      status = ScheduleMessage::Unknown;\n      break;\n  }\n\n  return new ScheduleMessage(incidence,method,status);\n}\n\nvoid ICalFormat::setTimeZone( const QString &id, bool utc )\n{\n  mTimeZoneId = id;\n  mUtc = utc;\n}\n\nQString ICalFormat::timeZoneId() const\n{\n  return mTimeZoneId;\n}\n\nbool ICalFormat::utc() const\n{\n  return mUtc;\n}\n<commit_msg>Urgh - returning a pointer to an object on death row is a bad idea.<commit_after>\/*\n    This file is part of libkcal.\n    Copyright (c) 2001 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 <qdatetime.h>\n#include <qstring.h>\n#include <qptrlist.h>\n#include <qregexp.h>\n#include <qclipboard.h>\n#include <qfile.h>\n#include <qtextstream.h>\n\n#include <kdebug.h>\n#include <klocale.h>\n\nextern \"C\" {\n  #include <ical.h>\n  #include <icalss.h>\n  #include <icalparser.h>\n  #include <icalrestriction.h>\n}\n\n#include \"calendar.h\"\n#include \"calendarlocal.h\"\n#include \"journal.h\"\n\n#include \"icalformat.h\"\n#include \"icalformatimpl.h\"\n\n#define _ICAL_VERSION \"2.0\"\n\nusing namespace KCal;\n\nICalFormat::ICalFormat()\n{\n  mImpl = new ICalFormatImpl( this );\n\n  mTimeZoneId = \"UTC\";\n  mUtc = true;\n}\n\nICalFormat::~ICalFormat()\n{\n  delete mImpl;\n}\n\nbool ICalFormat::load( Calendar *calendar, const QString &fileName)\n{\n  kdDebug(5800) << \"ICalFormat::load() \" << fileName << endl;\n\n  clearException();\n\n  QFile file( fileName );\n  if (!file.open( IO_ReadOnly ) ) {\n    kdDebug(5800) << \"ICalFormat::load() load error\" << endl;\n    setException(new ErrorFormat(ErrorFormat::LoadError));\n    return false;\n  }\n  QTextStream ts( &file );\n  QString text = ts.read();\n  file.close();\n\n  return fromString( calendar, text );\n}\n\n\nbool ICalFormat::save( Calendar *calendar, const QString &fileName )\n{\n  kdDebug(5800) << \"ICalFormat::save(): \" << fileName << endl;\n\n  clearException();\n\n  QString text = toString( calendar );\n\n  if ( text.isNull() ) return false;\n\n  \/\/ TODO: write backup file\n\n  QFile file( fileName );\n  if (!file.open( IO_WriteOnly ) ) {\n    setException(new ErrorFormat(ErrorFormat::SaveError,\n                 i18n(\"Could not open file '%1'\").arg(fileName)));\n    return false;\n  }\n  QTextStream ts( &file );\n  ts << text;\n  file.close();\n\n  return true;\n}\n\nbool ICalFormat::fromString( Calendar *cal, const QString &text )\n{\n  setTimeZone( cal->timeZoneId(), !cal->isLocalTime() );\n\n  \/\/ Get first VCALENDAR component.\n  \/\/ TODO: Handle more than one VCALENDAR or non-VCALENDAR top components\n  icalcomponent *calendar;\n\n  calendar = icalcomponent_new_from_string( text.local8Bit().data());\n  \/\/  kdDebug(5800) << \"Error: \" << icalerror_perror() << endl;\n  if (!calendar) {\n    kdDebug(5800) << \"ICalFormat::load() parse error\" << endl;\n    setException(new ErrorFormat(ErrorFormat::ParseErrorIcal));\n    return false;\n  }\n\n  bool success = true;\n\n  if (icalcomponent_isa(calendar) != ICAL_VCALENDAR_COMPONENT) {\n    kdDebug(5800) << \"ICalFormat::load(): No VCALENDAR component found\" << endl;\n    setException(new ErrorFormat(ErrorFormat::NoCalendar));\n    success = false;\n  } else {\n    \/\/ put all objects into their proper places\n    if ( !mImpl->populate( cal, calendar ) ) {\n      kdDebug(5800) << \"ICalFormat::load(): Could not populate calendar\" << endl;\n      if ( !exception() ) {\n        setException(new ErrorFormat(ErrorFormat::ParseErrorKcal));\n      }\n      success = false;\n    } else\n      mLoadedProductId = mImpl->loadedProductId();\n  }\n\n  icalcomponent_free( calendar );\n\n  return success;\n}\n\nIncidence *ICalFormat::fromString( const QString &text )\n{\n  CalendarLocal cal( mTimeZoneId );\n  fromString(&cal, text);\n  \n  Incidence *ical = 0;\n  QPtrList<Event> elist = cal.events();\n  if ( elist.count() > 0 ) {\n    ical = elist.first();\n  } else {\n    QPtrList<Todo> tlist = cal.todos();\n    if ( tlist.count() > 0 ) {\n      ical = tlist.first();\n    } else {\n      QPtrList<Journal> jlist = cal.journals();\n      if ( jlist.count() > 0 ) {\n        ical = jlist.first();\n      }\n    }\n  }\n  return ical->clone();\n}\n\nQString ICalFormat::toString( Calendar *cal )\n{\n  setTimeZone( cal->timeZoneId(), !cal->isLocalTime() );\n\n  icalcomponent *calendar = mImpl->createCalendarComponent(cal);\n\n  icalcomponent *component;\n\n  \/\/ todos\n  QPtrList<Todo> todoList = cal->rawTodos();\n  QPtrListIterator<Todo> qlt(todoList);\n  for (; qlt.current(); ++qlt) {\n    component = mImpl->writeTodo(qlt.current());\n    icalcomponent_add_component(calendar,component);\n  }\n\n  \/\/ events\n  QPtrList<Event> events = cal->rawEvents();\n  Event *ev;\n  for(ev=events.first();ev;ev=events.next()) {\n    component = mImpl->writeEvent(ev);\n    icalcomponent_add_component(calendar,component);\n  }\n\n  \/\/ journals\n  QPtrList<Journal> journals = cal->journals();\n  Journal *j;\n  for(j=journals.first();j;j=journals.next()) {\n    component = mImpl->writeJournal(j);\n    icalcomponent_add_component(calendar,component);\n  }\n\n  const char *text = icalcomponent_as_ical_string( calendar );\n\n  icalcomponent_free( calendar );\n\n  if (!text) {\n    setException(new ErrorFormat(ErrorFormat::SaveError,\n                 i18n(\"libical error\")));\n    return QString::null;\n  }\n\n  return QString::fromLocal8Bit( text );\n}\n\nQString ICalFormat::toICalString( Incidence *incidence )\n{\n  CalendarLocal cal( mTimeZoneId );\n  cal.addIncidence( incidence->clone() );\n  return toString( &cal );\n}\n\nQString ICalFormat::toString( Incidence *incidence )\n{\n  icalcomponent *component;\n\n  component = mImpl->writeIncidence( incidence );\n\n  const char *text = icalcomponent_as_ical_string( component );\n\n  icalcomponent_free( component );\n\n  return QString::fromLocal8Bit( text );\n}\n\nQString ICalFormat::toString( Recurrence *recurrence )\n{\n  icalproperty *property;\n  property = mImpl->writeRecurrenceRule( recurrence );\n  const char *text = icalproperty_as_ical_string( property );\n  icalproperty_free( property );\n  return QString::fromLocal8Bit( text );\n}\n\nbool ICalFormat::fromString( Recurrence * recurrence, const QString& rrule )\n{\n  bool success = true;\n  icalerror_clear_errno();\n  struct icalrecurrencetype recur = icalrecurrencetype_from_string( rrule );\n  if ( icalerrno != ICAL_NO_ERROR ) {\n    kdDebug() << \"Recurrence parsing error: \" << icalerror_strerror( icalerrno ) << endl;\n    success = false;\n  }\n\n  if ( success ) {\n    mImpl->readRecurrence( recur, recurrence );\n  }\n\n  return success;\n}\n\n\nQString ICalFormat::createScheduleMessage(IncidenceBase *incidence,\n                                          Scheduler::Method method)\n{\n  icalcomponent *message = mImpl->createScheduleComponent(incidence,method);\n\n  QString messageText = icalcomponent_as_ical_string(message);\n\n#if 0\n  kdDebug(5800) << \"ICalFormat::createScheduleMessage: message START\\n\"\n            << messageText\n            << \"ICalFormat::createScheduleMessage: message END\" << endl;\n#endif\n\n  return messageText;\n}\n\nScheduleMessage *ICalFormat::parseScheduleMessage( Calendar *cal,\n                                                   const QString &messageText )\n{\n  setTimeZone( cal->timeZoneId(), !cal->isLocalTime() );\n  clearException();\n\n  if (messageText.isEmpty()) return 0;\n\n  icalcomponent *message;\n  message = icalparser_parse_string(messageText.local8Bit());\n\n  if (!message) return 0;\n\n  icalproperty *m = icalcomponent_get_first_property(message,\n                                                     ICAL_METHOD_PROPERTY);\n\n  if (!m) return 0;\n\n  icalcomponent *c;\n\n  IncidenceBase *incidence = 0;\n  c = icalcomponent_get_first_component(message,ICAL_VEVENT_COMPONENT);\n  if (c) {\n    incidence = mImpl->readEvent(c);\n  }\n\n  if (!incidence) {\n    c = icalcomponent_get_first_component(message,ICAL_VTODO_COMPONENT);\n    if (c) {\n      incidence = mImpl->readTodo(c);\n    }\n  }\n\n  if (!incidence) {\n    c = icalcomponent_get_first_component(message,ICAL_VFREEBUSY_COMPONENT);\n    if (c) {\n      incidence = mImpl->readFreeBusy(c);\n    }\n  }\n\n  if (!incidence) {\n    kdDebug() << \"ICalFormat:parseScheduleMessage: object is not a freebusy, event or todo\" << endl;\n    return 0;\n  }\n\n  kdDebug(5800) << \"ICalFormat::parseScheduleMessage() getting method...\" << endl;\n\n  icalproperty_method icalmethod = icalproperty_get_method(m);\n  Scheduler::Method method;\n\n  switch (icalmethod) {\n    case ICAL_METHOD_PUBLISH:\n      method = Scheduler::Publish;\n      break;\n    case ICAL_METHOD_REQUEST:\n      method = Scheduler::Request;\n      break;\n    case ICAL_METHOD_REFRESH:\n      method = Scheduler::Refresh;\n      break;\n    case ICAL_METHOD_CANCEL:\n      method = Scheduler::Cancel;\n      break;\n    case ICAL_METHOD_ADD:\n      method = Scheduler::Add;\n      break;\n    case ICAL_METHOD_REPLY:\n      method = Scheduler::Reply;\n      break;\n    case ICAL_METHOD_COUNTER:\n      method = Scheduler::Counter;\n      break;\n    case ICAL_METHOD_DECLINECOUNTER:\n      method = Scheduler::Declinecounter;\n      break;\n    default:\n      method = Scheduler::NoMethod;\n      kdDebug(5800) << \"ICalFormat::parseScheduleMessage(): Unknow method\" << endl;\n      break;\n  }\n\n  kdDebug(5800) << \"ICalFormat::parseScheduleMessage() restriction...\" << endl;\n\n  if (!icalrestriction_check(message)) {\n    setException(new ErrorFormat(ErrorFormat::Restriction,\n                                   Scheduler::translatedMethodName(method) + \": \" +\n                                   mImpl->extractErrorProperty(c)));\n    return 0;\n  }\n\n  icalcomponent *calendarComponent = mImpl->createCalendarComponent(cal);\n\n  Incidence *existingIncidence = cal->event(incidence->uid());\n  if (existingIncidence) {\n    \/\/ TODO: check, if cast is required, or if it can be done by virtual funcs.\n    if (existingIncidence->type() == \"Todo\") {\n      Todo *todo = static_cast<Todo *>(existingIncidence);\n      icalcomponent_add_component(calendarComponent,\n                                  mImpl->writeTodo(todo));\n    }\n    if (existingIncidence->type() == \"Event\") {\n      Event *event = static_cast<Event *>(existingIncidence);\n      icalcomponent_add_component(calendarComponent,\n                                  mImpl->writeEvent(event));\n    }\n  } else {\n    calendarComponent = 0;\n  }\n\n  kdDebug(5800) << \"ICalFormat::parseScheduleMessage() classify...\" << endl;\n\n  icalclass result = icalclassify(message,calendarComponent,(char *)\"\");\n\n  kdDebug(5800) << \"ICalFormat::parseScheduleMessage() returning...\" << endl;\n\n  ScheduleMessage::Status status;\n\n  switch (result) {\n    case ICAL_PUBLISH_NEW_CLASS:\n      status = ScheduleMessage::PublishNew;\n      break;\n    case ICAL_OBSOLETE_CLASS:\n      status = ScheduleMessage::Obsolete;\n      break;\n    case ICAL_REQUEST_NEW_CLASS:\n      status = ScheduleMessage::RequestNew;\n      break;\n    case ICAL_REQUEST_UPDATE_CLASS:\n      status = ScheduleMessage::RequestUpdate;\n      break;\n    case ICAL_UNKNOWN_CLASS:\n    default:\n      status = ScheduleMessage::Unknown;\n      break;\n  }\n\n  return new ScheduleMessage(incidence,method,status);\n}\n\nvoid ICalFormat::setTimeZone( const QString &id, bool utc )\n{\n  mTimeZoneId = id;\n  mUtc = utc;\n}\n\nQString ICalFormat::timeZoneId() const\n{\n  return mTimeZoneId;\n}\n\nbool ICalFormat::utc() const\n{\n  return mUtc;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: resultsethelper.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: kso $ $Date: 2001-03-01 07:51:48 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n\/**************************************************************************\n                                TODO\n **************************************************************************\n\n - This implementation is far away from completion. It has no interface\n   for changes notifications etc.\n\n *************************************************************************\/\n\n#ifndef _COM_SUN_STAR_UCB_LISTACTIONTYPE_HPP_\n#include <com\/sun\/star\/ucb\/ListActionType.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UCB_WELCOMEDYNAMICRESULTSETSTRUCT_HPP_\n#include <com\/sun\/star\/ucb\/WelcomeDynamicResultSetStruct.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UCB_XCACHEDDYNAMICRESULTSETSTUBFACTORY_HPP_\n#include <com\/sun\/star\/ucb\/XCachedDynamicResultSetStubFactory.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UCB_XSOURCEINITIALIZATION_HPP_\n#include <com\/sun\/star\/ucb\/XSourceInitialization.hpp>\n#endif\n#ifndef _CPPUHELPER_INTERFACECONTAINER_HXX_\n#include <cppuhelper\/interfacecontainer.hxx>\n#endif\n#ifndef _UCBHELPER_RESULTSETHELPER_HXX\n#include <ucbhelper\/resultsethelper.hxx>\n#endif\n\nusing namespace com::sun::star::beans;\nusing namespace com::sun::star::lang;\nusing namespace com::sun::star::sdbc;\nusing namespace com::sun::star::ucb;\nusing namespace com::sun::star::uno;\nusing namespace cppu;\nusing namespace rtl;\nusing namespace ucb;\n\n\/\/=========================================================================\n\/\/=========================================================================\n\/\/\n\/\/ ResultSetImplHelper Implementation.\n\/\/\n\/\/=========================================================================\n\/\/=========================================================================\n\n#define RESULTSETHELPER_INIT()      \\\n     m_xSMgr( rxSMgr ),             \\\n      m_pDisposeEventListeners( 0 ),  \\\n      m_bInitDone( sal_False ),       \\\n      m_bStatic( sal_False )\n\n\/\/=========================================================================\nResultSetImplHelper::ResultSetImplHelper(\n                      const Reference< XMultiServiceFactory >& rxSMgr )\n: RESULTSETHELPER_INIT()\n{\n}\n\n\/\/=========================================================================\nResultSetImplHelper::ResultSetImplHelper(\n                      const Reference< XMultiServiceFactory >& rxSMgr,\n                      const OpenCommandArgument2& rCommand )\n: RESULTSETHELPER_INIT(),\n  m_aCommand( rCommand )\n{\n}\n\n\/\/=========================================================================\n\/\/ virtual\nResultSetImplHelper::~ResultSetImplHelper()\n{\n    delete m_pDisposeEventListeners;\n}\n\n\/\/=========================================================================\n\/\/\n\/\/ XInterface methods.\n\/\/\n\/\/=========================================================================\n\nXINTERFACE_IMPL_4( ResultSetImplHelper,\n                   XTypeProvider,\n                   XServiceInfo,\n                   XComponent, \/* base of XDynamicResultSet *\/\n                   XDynamicResultSet );\n\n\/\/=========================================================================\n\/\/\n\/\/ XTypeProvider methods.\n\/\/\n\/\/=========================================================================\n\nXTYPEPROVIDER_IMPL_3( ResultSetImplHelper,\n                      XTypeProvider,\n                         XServiceInfo,\n                      XDynamicResultSet );\n\n\/\/=========================================================================\n\/\/\n\/\/ XServiceInfo methods.\n\/\/\n\/\/=========================================================================\n\nXSERVICEINFO_NOFACTORY_IMPL_1( ResultSetImplHelper,\n                    OUString::createFromAscii( \"ResultSetImplHelper\" ),\n                    OUString::createFromAscii( DYNAMICRESULTSET_SERVICE_NAME ) );\n\n\/\/=========================================================================\n\/\/\n\/\/ XComponent methods.\n\/\/\n\/\/=========================================================================\n\n\/\/ virtual\nvoid SAL_CALL ResultSetImplHelper::dispose()\n    throw( RuntimeException )\n{\n    osl::Guard< osl::Mutex > aGuard( m_aMutex );\n\n    if ( m_pDisposeEventListeners && m_pDisposeEventListeners->getLength() )\n    {\n        EventObject aEvt;\n        aEvt.Source = static_cast< XComponent * >( this );\n        m_pDisposeEventListeners->disposeAndClear( aEvt );\n    }\n}\n\n\/\/=========================================================================\n\/\/ virtual\nvoid SAL_CALL ResultSetImplHelper::addEventListener(\n                            const Reference< XEventListener >& Listener )\n    throw( RuntimeException )\n{\n    osl::Guard< osl::Mutex > aGuard( m_aMutex );\n\n    if ( !m_pDisposeEventListeners )\n        m_pDisposeEventListeners = new OInterfaceContainerHelper( m_aMutex );\n\n    m_pDisposeEventListeners->addInterface( Listener );\n}\n\n\/\/=========================================================================\n\/\/ virtual\nvoid SAL_CALL ResultSetImplHelper::removeEventListener(\n                            const Reference< XEventListener >& Listener )\n    throw( RuntimeException )\n{\n    osl::Guard< osl::Mutex > aGuard( m_aMutex );\n\n    if ( m_pDisposeEventListeners )\n        m_pDisposeEventListeners->removeInterface( Listener );\n}\n\n\/\/=========================================================================\n\/\/\n\/\/ XDynamicResultSet methods.\n\/\/\n\/\/=========================================================================\n\n\/\/ virtual\nReference< XResultSet > SAL_CALL ResultSetImplHelper::getStaticResultSet()\n    throw( ListenerAlreadySetException, RuntimeException )\n{\n    osl::Guard< osl::Mutex > aGuard( m_aMutex );\n\n    if ( m_xListener.is() )\n        throw ListenerAlreadySetException();\n\n    init( sal_True );\n    return m_xResultSet1;\n}\n\n\/\/=========================================================================\n\/\/ virtual\nvoid SAL_CALL ResultSetImplHelper::setListener(\n                    const Reference< XDynamicResultSetListener >& Listener )\n    throw( ListenerAlreadySetException, RuntimeException )\n{\n    osl::ClearableGuard< osl::Mutex > aGuard( m_aMutex );\n\n    if ( m_bStatic || m_xListener.is() )\n        throw ListenerAlreadySetException();\n\n    m_xListener = Listener;\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ Create \"welcome event\" and send it to listener.\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n    \/\/ Note: We only have the implementation for a static result set at the\n    \/\/       moment (src590). The dynamic result sets passed to the listener\n    \/\/       are a fake. This implementation will never call \"notify\" at the\n    \/\/       listener to propagate any changes!!!\n\n    init( sal_False );\n\n    Any aInfo;\n    aInfo <<= WelcomeDynamicResultSetStruct( m_xResultSet1 \/* \"old\" *\/,\n                                             m_xResultSet2 \/* \"new\" *\/ );\n\n    Sequence< ListAction > aActions( 1 );\n    aActions.getArray()[ 0 ] = ListAction( 0, \/\/ Position; not used\n                                           0, \/\/ Count; not used\n                                           ListActionType::WELCOME,\n                                              aInfo );\n    aGuard.clear();\n\n    Listener->notify(\n                ListEvent( static_cast< OWeakObject * >( this ), aActions ) );\n}\n\n\/\/=========================================================================\n\/\/ virtual\nsal_Int16 SAL_CALL ResultSetImplHelper::getCapabilities()\n    throw( RuntimeException )\n{\n    \/\/ ! ContentResultSetCapability::SORTED\n    return 0;\n}\n\n\/\/=========================================================================\n\/\/ virtual\nvoid SAL_CALL ResultSetImplHelper::connectToCache(\n                        const Reference< XDynamicResultSet > & xCache )\n    throw( ListenerAlreadySetException,\n           AlreadyInitializedException,\n           ServiceNotFoundException,\n           RuntimeException )\n{\n    if ( m_xListener.is() )\n        throw ListenerAlreadySetException();\n\n    if ( m_bStatic )\n        throw ListenerAlreadySetException();\n\n    Reference< XSourceInitialization > xTarget( xCache, UNO_QUERY );\n    if ( xTarget.is() )\n    {\n        Reference< XCachedDynamicResultSetStubFactory > xStubFactory;\n        try\n        {\n            xStubFactory = Reference< XCachedDynamicResultSetStubFactory >(\n                m_xSMgr->createInstance(\n                    OUString::createFromAscii(\n                        \"com.sun.star.ucb.CachedDynamicResultSetStubFactory\" ) ),\n                UNO_QUERY );\n        }\n        catch ( Exception const & )\n        {\n        }\n\n        if ( xStubFactory.is() )\n        {\n            xStubFactory->connectToCache(\n                                  this, xCache, m_aCommand.SortingInfo, 0 );\n            return;\n        }\n    }\n    throw ServiceNotFoundException();\n}\n\n\/\/=========================================================================\n\/\/\n\/\/ Non-interface methods.\n\/\/\n\/\/=========================================================================\n\nvoid ResultSetImplHelper::init( sal_Bool bStatic )\n{\n    osl::Guard< osl::Mutex > aGuard( m_aMutex );\n\n    if ( !m_bInitDone )\n    {\n        if ( bStatic )\n        {\n            \/\/ virtual... derived class fills m_xResultSet1\n            initStatic();\n\n            VOS_ENSURE( m_xResultSet1.is(),\n                        \"ResultSetImplHelper::init - No 1st result set!\" );\n            m_bStatic = sal_True;\n        }\n        else\n        {\n            \/\/ virtual... derived class fills m_xResultSet1 and m_xResultSet2\n            initDynamic();\n\n            VOS_ENSURE( m_xResultSet1.is(),\n                        \"ResultSetImplHelper::init - No 1st result set!\" );\n            VOS_ENSURE( m_xResultSet2.is(),\n                        \"ResultSetImplHelper::init - No 2nd result set!\" );\n            m_bStatic = sal_False;\n        }\n        m_bInitDone = sal_True;\n    }\n\n}\n\n\/*\n\npure virtual\n\n\/\/=========================================================================\n\/\/ virtual\nvoid ResultSetImplHelper::initStatic()\n{\n}\n\n\/\/=========================================================================\n\/\/ virtual\nvoid ResultSetImplHelper::initDynamic()\n{\n}\n\n*\/\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.2.178); FILE MERGED 2005\/09\/05 13:14:01 rt 1.2.178.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: resultsethelper.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 16:40:58 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n\/**************************************************************************\n                                TODO\n **************************************************************************\n\n - This implementation is far away from completion. It has no interface\n   for changes notifications etc.\n\n *************************************************************************\/\n\n#ifndef _COM_SUN_STAR_UCB_LISTACTIONTYPE_HPP_\n#include <com\/sun\/star\/ucb\/ListActionType.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UCB_WELCOMEDYNAMICRESULTSETSTRUCT_HPP_\n#include <com\/sun\/star\/ucb\/WelcomeDynamicResultSetStruct.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UCB_XCACHEDDYNAMICRESULTSETSTUBFACTORY_HPP_\n#include <com\/sun\/star\/ucb\/XCachedDynamicResultSetStubFactory.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UCB_XSOURCEINITIALIZATION_HPP_\n#include <com\/sun\/star\/ucb\/XSourceInitialization.hpp>\n#endif\n#ifndef _CPPUHELPER_INTERFACECONTAINER_HXX_\n#include <cppuhelper\/interfacecontainer.hxx>\n#endif\n#ifndef _UCBHELPER_RESULTSETHELPER_HXX\n#include <ucbhelper\/resultsethelper.hxx>\n#endif\n\nusing namespace com::sun::star::beans;\nusing namespace com::sun::star::lang;\nusing namespace com::sun::star::sdbc;\nusing namespace com::sun::star::ucb;\nusing namespace com::sun::star::uno;\nusing namespace cppu;\nusing namespace rtl;\nusing namespace ucb;\n\n\/\/=========================================================================\n\/\/=========================================================================\n\/\/\n\/\/ ResultSetImplHelper Implementation.\n\/\/\n\/\/=========================================================================\n\/\/=========================================================================\n\n#define RESULTSETHELPER_INIT()      \\\n     m_xSMgr( rxSMgr ),             \\\n      m_pDisposeEventListeners( 0 ),  \\\n      m_bInitDone( sal_False ),       \\\n      m_bStatic( sal_False )\n\n\/\/=========================================================================\nResultSetImplHelper::ResultSetImplHelper(\n                      const Reference< XMultiServiceFactory >& rxSMgr )\n: RESULTSETHELPER_INIT()\n{\n}\n\n\/\/=========================================================================\nResultSetImplHelper::ResultSetImplHelper(\n                      const Reference< XMultiServiceFactory >& rxSMgr,\n                      const OpenCommandArgument2& rCommand )\n: RESULTSETHELPER_INIT(),\n  m_aCommand( rCommand )\n{\n}\n\n\/\/=========================================================================\n\/\/ virtual\nResultSetImplHelper::~ResultSetImplHelper()\n{\n    delete m_pDisposeEventListeners;\n}\n\n\/\/=========================================================================\n\/\/\n\/\/ XInterface methods.\n\/\/\n\/\/=========================================================================\n\nXINTERFACE_IMPL_4( ResultSetImplHelper,\n                   XTypeProvider,\n                   XServiceInfo,\n                   XComponent, \/* base of XDynamicResultSet *\/\n                   XDynamicResultSet );\n\n\/\/=========================================================================\n\/\/\n\/\/ XTypeProvider methods.\n\/\/\n\/\/=========================================================================\n\nXTYPEPROVIDER_IMPL_3( ResultSetImplHelper,\n                      XTypeProvider,\n                         XServiceInfo,\n                      XDynamicResultSet );\n\n\/\/=========================================================================\n\/\/\n\/\/ XServiceInfo methods.\n\/\/\n\/\/=========================================================================\n\nXSERVICEINFO_NOFACTORY_IMPL_1( ResultSetImplHelper,\n                    OUString::createFromAscii( \"ResultSetImplHelper\" ),\n                    OUString::createFromAscii( DYNAMICRESULTSET_SERVICE_NAME ) );\n\n\/\/=========================================================================\n\/\/\n\/\/ XComponent methods.\n\/\/\n\/\/=========================================================================\n\n\/\/ virtual\nvoid SAL_CALL ResultSetImplHelper::dispose()\n    throw( RuntimeException )\n{\n    osl::Guard< osl::Mutex > aGuard( m_aMutex );\n\n    if ( m_pDisposeEventListeners && m_pDisposeEventListeners->getLength() )\n    {\n        EventObject aEvt;\n        aEvt.Source = static_cast< XComponent * >( this );\n        m_pDisposeEventListeners->disposeAndClear( aEvt );\n    }\n}\n\n\/\/=========================================================================\n\/\/ virtual\nvoid SAL_CALL ResultSetImplHelper::addEventListener(\n                            const Reference< XEventListener >& Listener )\n    throw( RuntimeException )\n{\n    osl::Guard< osl::Mutex > aGuard( m_aMutex );\n\n    if ( !m_pDisposeEventListeners )\n        m_pDisposeEventListeners = new OInterfaceContainerHelper( m_aMutex );\n\n    m_pDisposeEventListeners->addInterface( Listener );\n}\n\n\/\/=========================================================================\n\/\/ virtual\nvoid SAL_CALL ResultSetImplHelper::removeEventListener(\n                            const Reference< XEventListener >& Listener )\n    throw( RuntimeException )\n{\n    osl::Guard< osl::Mutex > aGuard( m_aMutex );\n\n    if ( m_pDisposeEventListeners )\n        m_pDisposeEventListeners->removeInterface( Listener );\n}\n\n\/\/=========================================================================\n\/\/\n\/\/ XDynamicResultSet methods.\n\/\/\n\/\/=========================================================================\n\n\/\/ virtual\nReference< XResultSet > SAL_CALL ResultSetImplHelper::getStaticResultSet()\n    throw( ListenerAlreadySetException, RuntimeException )\n{\n    osl::Guard< osl::Mutex > aGuard( m_aMutex );\n\n    if ( m_xListener.is() )\n        throw ListenerAlreadySetException();\n\n    init( sal_True );\n    return m_xResultSet1;\n}\n\n\/\/=========================================================================\n\/\/ virtual\nvoid SAL_CALL ResultSetImplHelper::setListener(\n                    const Reference< XDynamicResultSetListener >& Listener )\n    throw( ListenerAlreadySetException, RuntimeException )\n{\n    osl::ClearableGuard< osl::Mutex > aGuard( m_aMutex );\n\n    if ( m_bStatic || m_xListener.is() )\n        throw ListenerAlreadySetException();\n\n    m_xListener = Listener;\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ Create \"welcome event\" and send it to listener.\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n    \/\/ Note: We only have the implementation for a static result set at the\n    \/\/       moment (src590). The dynamic result sets passed to the listener\n    \/\/       are a fake. This implementation will never call \"notify\" at the\n    \/\/       listener to propagate any changes!!!\n\n    init( sal_False );\n\n    Any aInfo;\n    aInfo <<= WelcomeDynamicResultSetStruct( m_xResultSet1 \/* \"old\" *\/,\n                                             m_xResultSet2 \/* \"new\" *\/ );\n\n    Sequence< ListAction > aActions( 1 );\n    aActions.getArray()[ 0 ] = ListAction( 0, \/\/ Position; not used\n                                           0, \/\/ Count; not used\n                                           ListActionType::WELCOME,\n                                              aInfo );\n    aGuard.clear();\n\n    Listener->notify(\n                ListEvent( static_cast< OWeakObject * >( this ), aActions ) );\n}\n\n\/\/=========================================================================\n\/\/ virtual\nsal_Int16 SAL_CALL ResultSetImplHelper::getCapabilities()\n    throw( RuntimeException )\n{\n    \/\/ ! ContentResultSetCapability::SORTED\n    return 0;\n}\n\n\/\/=========================================================================\n\/\/ virtual\nvoid SAL_CALL ResultSetImplHelper::connectToCache(\n                        const Reference< XDynamicResultSet > & xCache )\n    throw( ListenerAlreadySetException,\n           AlreadyInitializedException,\n           ServiceNotFoundException,\n           RuntimeException )\n{\n    if ( m_xListener.is() )\n        throw ListenerAlreadySetException();\n\n    if ( m_bStatic )\n        throw ListenerAlreadySetException();\n\n    Reference< XSourceInitialization > xTarget( xCache, UNO_QUERY );\n    if ( xTarget.is() )\n    {\n        Reference< XCachedDynamicResultSetStubFactory > xStubFactory;\n        try\n        {\n            xStubFactory = Reference< XCachedDynamicResultSetStubFactory >(\n                m_xSMgr->createInstance(\n                    OUString::createFromAscii(\n                        \"com.sun.star.ucb.CachedDynamicResultSetStubFactory\" ) ),\n                UNO_QUERY );\n        }\n        catch ( Exception const & )\n        {\n        }\n\n        if ( xStubFactory.is() )\n        {\n            xStubFactory->connectToCache(\n                                  this, xCache, m_aCommand.SortingInfo, 0 );\n            return;\n        }\n    }\n    throw ServiceNotFoundException();\n}\n\n\/\/=========================================================================\n\/\/\n\/\/ Non-interface methods.\n\/\/\n\/\/=========================================================================\n\nvoid ResultSetImplHelper::init( sal_Bool bStatic )\n{\n    osl::Guard< osl::Mutex > aGuard( m_aMutex );\n\n    if ( !m_bInitDone )\n    {\n        if ( bStatic )\n        {\n            \/\/ virtual... derived class fills m_xResultSet1\n            initStatic();\n\n            VOS_ENSURE( m_xResultSet1.is(),\n                        \"ResultSetImplHelper::init - No 1st result set!\" );\n            m_bStatic = sal_True;\n        }\n        else\n        {\n            \/\/ virtual... derived class fills m_xResultSet1 and m_xResultSet2\n            initDynamic();\n\n            VOS_ENSURE( m_xResultSet1.is(),\n                        \"ResultSetImplHelper::init - No 1st result set!\" );\n            VOS_ENSURE( m_xResultSet2.is(),\n                        \"ResultSetImplHelper::init - No 2nd result set!\" );\n            m_bStatic = sal_False;\n        }\n        m_bInitDone = sal_True;\n    }\n\n}\n\n\/*\n\npure virtual\n\n\/\/=========================================================================\n\/\/ virtual\nvoid ResultSetImplHelper::initStatic()\n{\n}\n\n\/\/=========================================================================\n\/\/ virtual\nvoid ResultSetImplHelper::initDynamic()\n{\n}\n\n*\/\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: editsrc.cxx,v $\n *\n *  $Revision: 1.25 $\n *\n *  last change: $Author: kz $ $Date: 2007-05-10 16:59:09 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sc.hxx\"\n\n\n\n#include \"scitems.hxx\"\n#include <svx\/eeitem.hxx>\n\n#include <svx\/unofored.hxx>\n\n#include \"editsrc.hxx\"\n#include \"textuno.hxx\"\n#include \"editutil.hxx\"\n#include \"docsh.hxx\"\n#include \"docfunc.hxx\"\n#include \"hints.hxx\"\n#include \"patattr.hxx\"\n#include \"unoguard.hxx\"\n#include \"drwlayer.hxx\"\n#include \"userdat.hxx\"\n#ifndef _SC_ACCESSIBLETEXT_HXX\n#include \"AccessibleText.hxx\"\n#endif\n#include <svx\/svditer.hxx>\n#include <svx\/outlobj.hxx>\n\n\/\/------------------------------------------------------------------------\n\nTYPEINIT1( ScHeaderFooterChangedHint, SfxHint );\n\nScHeaderFooterChangedHint::ScHeaderFooterChangedHint(USHORT nP) :\n    nPart( nP )\n{\n}\n\nScHeaderFooterChangedHint::~ScHeaderFooterChangedHint()\n{\n}\n\n\/\/------------------------------------------------------------------------\n\nScSharedHeaderFooterEditSource::ScSharedHeaderFooterEditSource( ScHeaderFooterTextData* pData ) :\n    pTextData( pData )\n{\n    \/\/  pTextData is held by the ScHeaderFooterTextObj.\n    \/\/  Text range and cursor keep a reference to their parent text, so the text object is\n    \/\/  always alive and the TextData is valid as long as there are children.\n}\n\nScSharedHeaderFooterEditSource::~ScSharedHeaderFooterEditSource()\n{\n}\n\nSvxEditSource* ScSharedHeaderFooterEditSource::Clone() const\n{\n    return new ScSharedHeaderFooterEditSource( pTextData );\n}\n\nSvxTextForwarder* ScSharedHeaderFooterEditSource::GetTextForwarder()\n{\n    return pTextData->GetTextForwarder();\n}\n\nvoid ScSharedHeaderFooterEditSource::UpdateData()\n{\n    pTextData->UpdateData();\n}\n\nScEditEngineDefaulter* ScSharedHeaderFooterEditSource::GetEditEngine()\n{\n    return pTextData->GetEditEngine();\n}\n\n\/\/------------------------------------------------------------------------\n\n\/\/  each ScHeaderFooterEditSource object has its own ScHeaderFooterTextData\n\nScHeaderFooterEditSource::ScHeaderFooterEditSource( ScHeaderFooterContentObj* pContent,\n                                                    USHORT nP ) :\n    ScSharedHeaderFooterEditSource( new ScHeaderFooterTextData( *pContent, nP ) )\n{\n}\n\nScHeaderFooterEditSource::ScHeaderFooterEditSource( ScHeaderFooterContentObj& rContent,\n                                                    USHORT nP ) :\n    ScSharedHeaderFooterEditSource( new ScHeaderFooterTextData( rContent, nP ) )\n{\n}\n\nScHeaderFooterEditSource::~ScHeaderFooterEditSource()\n{\n    delete GetTextData();   \/\/ not accessed in ScSharedHeaderFooterEditSource dtor\n}\n\nSvxEditSource* ScHeaderFooterEditSource::Clone() const\n{\n    const ScHeaderFooterTextData* pData = GetTextData();\n    return new ScHeaderFooterEditSource( pData->GetContentObj(), pData->GetPart() );\n}\n\n\/\/------------------------------------------------------------------------\n\nScSharedCellEditSource::ScSharedCellEditSource( ScCellTextData* pData ) :\n    pCellTextData( pData )\n{\n    \/\/  pCellTextData is part of the ScCellTextObj.\n    \/\/  Text range and cursor keep a reference to their parent text, so the text object is\n    \/\/  always alive and the CellTextData is valid as long as there are children.\n}\n\nScSharedCellEditSource::~ScSharedCellEditSource()\n{\n}\n\nSvxEditSource* ScSharedCellEditSource::Clone() const\n{\n    return new ScSharedCellEditSource( pCellTextData );\n}\n\nSvxTextForwarder* ScSharedCellEditSource::GetTextForwarder()\n{\n    return pCellTextData->GetTextForwarder();\n}\n\nvoid ScSharedCellEditSource::UpdateData()\n{\n    pCellTextData->UpdateData();\n}\n\nvoid ScSharedCellEditSource::SetDoUpdateData(sal_Bool bValue)\n{\n    pCellTextData->SetDoUpdate(bValue);\n}\n\nsal_Bool ScSharedCellEditSource::IsDirty() const\n{\n    return pCellTextData->IsDirty();\n}\n\nScEditEngineDefaulter* ScSharedCellEditSource::GetEditEngine()\n{\n    return pCellTextData->GetEditEngine();\n}\n\n\/\/------------------------------------------------------------------------\n\n\/\/  each ScCellEditSource object has its own ScCellTextData\n\nScCellEditSource::ScCellEditSource( ScDocShell* pDocSh, const ScAddress& rP ) :\n    ScSharedCellEditSource( new ScCellTextData( pDocSh, rP ) )\n{\n}\n\nScCellEditSource::~ScCellEditSource()\n{\n    delete GetCellTextData();   \/\/ not accessed in ScSharedCellEditSource dtor\n}\n\nSvxEditSource* ScCellEditSource::Clone() const\n{\n    const ScCellTextData* pData = GetCellTextData();\n    return new ScCellEditSource( pData->GetDocShell(), pData->GetCellPos() );\n}\n\n\/\/------------------------------------------------------------------------\n\nScAnnotationEditSource::ScAnnotationEditSource(ScDocShell* pDocSh, const ScAddress& rP) :\n    pDocShell( pDocSh ),\n    aCellPos( rP ),\n    pEditEngine( NULL ),\n    pForwarder( NULL ),\n    bDataValid( FALSE )\n{\n    if (pDocShell)\n        pDocShell->GetDocument()->AddUnoObject(*this);\n}\n\nScAnnotationEditSource::~ScAnnotationEditSource()\n{\n    ScUnoGuard aGuard;      \/\/  needed for EditEngine dtor\n\n    if (pDocShell)\n        pDocShell->GetDocument()->RemoveUnoObject(*this);\n\n    delete pForwarder;\n    delete pEditEngine;\n}\n\nSvxEditSource* ScAnnotationEditSource::Clone() const\n{\n    return new ScAnnotationEditSource( pDocShell, aCellPos );\n}\n\nSdrObject* ScAnnotationEditSource::GetCaptionObj()\n{\n    SdrObject* pRet = NULL;\n\n    ScDrawLayer* pModel = pDocShell->GetDocument()->GetDrawLayer();\n    if (!pModel)\n        return FALSE;\n    SdrPage* pPage = pModel->GetPage(static_cast<sal_uInt16>(aCellPos.Tab()));\n    DBG_ASSERT(pPage,\"Page ?\");\n\n    pPage->RecalcObjOrdNums();\n\n    SdrObjListIter aIter( *pPage, IM_FLAT );\n    SdrObject* pObject = aIter.Next();\n    while (pObject && !pRet)\n    {\n        if ( pObject->GetLayer() == SC_LAYER_INTERN && pObject->ISA( SdrCaptionObj ) )\n        {\n            ScDrawObjData* pData = ScDrawLayer::GetObjData( pObject );\n            if ( pData && aCellPos.Col() == pData->aStt.Col() && aCellPos.Row() == pData->aStt.Row() )\n            {\n                pRet = pObject;\n            }\n        }\n\n        pObject = aIter.Next();\n    }\n\n    return pRet;\n}\n\nSvxTextForwarder* ScAnnotationEditSource::GetTextForwarder()\n{\n    if (!pEditEngine)\n    {\n        \/\/ Notizen haben keine Felder\n        if ( pDocShell )\n        {\n            pEditEngine = new ScNoteEditEngine( pDocShell->GetDocument()->GetNoteEngine() );\n        }\n        else\n        {\n            SfxItemPool* pEnginePool = EditEngine::CreatePool();\n            pEnginePool->FreezeIdRanges();\n            pEditEngine = new ScEditEngineDefaulter( pEnginePool, TRUE );\n        }\n        pForwarder = new SvxEditEngineForwarder(*pEditEngine);\n    }\n\n    if (bDataValid)\n        return pForwarder;\n\n    if ( pDocShell )\n    {\n        ScDocument* pDoc = pDocShell->GetDocument();\n        ScPostIt aNote(pDoc);\n        pDoc->GetNote( aCellPos.Col(), aCellPos.Row(), aCellPos.Tab(), aNote );\n\n        if (aNote.GetEditTextObject())\n            pEditEngine->SetText( *aNote.GetEditTextObject() );     \/\/ incl. Umbrueche\n        else\n            pEditEngine->SetText( aNote.GetText() );\n    }\n\n    bDataValid = TRUE;\n    return pForwarder;\n}\n\nvoid ScAnnotationEditSource::UpdateData()\n{\n    if ( pDocShell && pEditEngine )\n    {\n        ScDocShellModificator aModificator( *pDocShell );\n\n        ScDocument* pDoc = pDocShell->GetDocument();\n        ScPostIt aNote(pDoc);\n        pDoc->GetNote( aCellPos.Col(), aCellPos.Row(), aCellPos.Tab(), aNote );\n\n        aNote.SetEditTextObject(pEditEngine->CreateTextObject());\n\n        pDoc->SetNote(aCellPos.Col(), aCellPos.Row(), aCellPos.Tab(), aNote);\n\n        if (aNote.IsShown())\n        {\n            SdrObject* pObj = GetCaptionObj();\n            if (pObj)\n            {\n                OutlinerParaObject* pOPO = new OutlinerParaObject( *aNote.GetEditTextObject() );\n                pOPO->SetOutlinerMode( OUTLINERMODE_TEXTOBJECT );\n                pObj->NbcSetOutlinerParaObject( pOPO );\n                pOPO->SetVertical( FALSE );  \/\/ notes are always horizontal\n\n                pObj->ActionChanged();\n            }\n        }\n\n        \/\/! Undo !!!\n\n        aModificator.SetDocumentModified();\n\n        \/\/ bDataValid wird bei SetDocumentModified zurueckgesetzt\n    }\n}\n\nvoid ScAnnotationEditSource::Notify( SfxBroadcaster&, const SfxHint& rHint )\n{\n    if ( rHint.ISA( ScUpdateRefHint ) )\n    {\n\/\/        const ScUpdateRefHint& rRef = (const ScUpdateRefHint&)rHint;\n\n        \/\/! Ref-Update\n    }\n    else if ( rHint.ISA( SfxSimpleHint ) )\n    {\n        ULONG nId = ((const SfxSimpleHint&)rHint).GetId();\n        if ( nId == SFX_HINT_DYING )\n        {\n            pDocShell = NULL;                       \/\/ ungueltig geworden\n\n            DELETEZ( pForwarder );\n            DELETEZ( pEditEngine );     \/\/ EditEngine uses document's pool\n        }\n        else if ( nId == SFX_HINT_DATACHANGED )\n            bDataValid = FALSE;                     \/\/ Text muss neu geholt werden\n    }\n}\n\n\/\/------------------------------------------------------------------------\n\nScSimpleEditSource::ScSimpleEditSource( SvxTextForwarder* pForw ) :\n    pForwarder( pForw )\n{\n    \/\/  The same forwarder (and EditEngine) is shared by all children of the same Text object.\n    \/\/  Text range and cursor keep a reference to their parent text, so the text object is\n    \/\/  always alive and the forwarder is valid as long as there are children.\n}\n\nScSimpleEditSource::~ScSimpleEditSource()\n{\n}\n\nSvxEditSource* ScSimpleEditSource::Clone() const\n{\n    return new ScSimpleEditSource( pForwarder );\n}\n\nSvxTextForwarder* ScSimpleEditSource::GetTextForwarder()\n{\n    return pForwarder;\n}\n\nvoid ScSimpleEditSource::UpdateData()\n{\n    \/\/  nothing\n}\n\n\/\/------------------------------------------------------------------------\n\nScAccessibilityEditSource::ScAccessibilityEditSource( ::std::auto_ptr < ScAccessibleTextData > pAccessibleCellTextData )\n    : mpAccessibleTextData(pAccessibleCellTextData)\n{\n}\n\nScAccessibilityEditSource::~ScAccessibilityEditSource()\n{\n}\n\nSvxEditSource* ScAccessibilityEditSource::Clone() const\n{\n    return new ScAccessibilityEditSource(::std::auto_ptr < ScAccessibleTextData > (mpAccessibleTextData->Clone()));\n}\n\nSvxTextForwarder* ScAccessibilityEditSource::GetTextForwarder()\n{\n    return mpAccessibleTextData->GetTextForwarder();\n}\n\nSvxViewForwarder* ScAccessibilityEditSource::GetViewForwarder()\n{\n    return mpAccessibleTextData->GetViewForwarder();\n}\n\nSvxEditViewForwarder* ScAccessibilityEditSource::GetEditViewForwarder( sal_Bool bCreate )\n{\n    return mpAccessibleTextData->GetEditViewForwarder(bCreate);\n}\n\nvoid ScAccessibilityEditSource::UpdateData()\n{\n    mpAccessibleTextData->UpdateData();\n}\n\nSfxBroadcaster& ScAccessibilityEditSource::GetBroadcaster() const\n{\n    return mpAccessibleTextData->GetBroadcaster();\n}\n\nvoid ScAccessibilityEditSource::SetDoUpdateData(sal_Bool bValue)\n{\n    mpAccessibleTextData->SetDoUpdate(bValue);\n}\n\nsal_Bool ScAccessibilityEditSource::IsDirty() const\n{\n    return mpAccessibleTextData->IsDirty();\n}\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.25.300); FILE MERGED 2008\/04\/01 12:36:57 thb 1.25.300.2: #i85898# Stripping all external header guards 2008\/03\/31 17:19:34 rt 1.25.300.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: editsrc.cxx,v $\n * $Revision: 1.26 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org.  If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sc.hxx\"\n\n\n\n#include \"scitems.hxx\"\n#include <svx\/eeitem.hxx>\n\n#include <svx\/unofored.hxx>\n\n#include \"editsrc.hxx\"\n#include \"textuno.hxx\"\n#include \"editutil.hxx\"\n#include \"docsh.hxx\"\n#include \"docfunc.hxx\"\n#include \"hints.hxx\"\n#include \"patattr.hxx\"\n#include \"unoguard.hxx\"\n#include \"drwlayer.hxx\"\n#include \"userdat.hxx\"\n#include \"AccessibleText.hxx\"\n#include <svx\/svditer.hxx>\n#include <svx\/outlobj.hxx>\n\n\/\/------------------------------------------------------------------------\n\nTYPEINIT1( ScHeaderFooterChangedHint, SfxHint );\n\nScHeaderFooterChangedHint::ScHeaderFooterChangedHint(USHORT nP) :\n    nPart( nP )\n{\n}\n\nScHeaderFooterChangedHint::~ScHeaderFooterChangedHint()\n{\n}\n\n\/\/------------------------------------------------------------------------\n\nScSharedHeaderFooterEditSource::ScSharedHeaderFooterEditSource( ScHeaderFooterTextData* pData ) :\n    pTextData( pData )\n{\n    \/\/  pTextData is held by the ScHeaderFooterTextObj.\n    \/\/  Text range and cursor keep a reference to their parent text, so the text object is\n    \/\/  always alive and the TextData is valid as long as there are children.\n}\n\nScSharedHeaderFooterEditSource::~ScSharedHeaderFooterEditSource()\n{\n}\n\nSvxEditSource* ScSharedHeaderFooterEditSource::Clone() const\n{\n    return new ScSharedHeaderFooterEditSource( pTextData );\n}\n\nSvxTextForwarder* ScSharedHeaderFooterEditSource::GetTextForwarder()\n{\n    return pTextData->GetTextForwarder();\n}\n\nvoid ScSharedHeaderFooterEditSource::UpdateData()\n{\n    pTextData->UpdateData();\n}\n\nScEditEngineDefaulter* ScSharedHeaderFooterEditSource::GetEditEngine()\n{\n    return pTextData->GetEditEngine();\n}\n\n\/\/------------------------------------------------------------------------\n\n\/\/  each ScHeaderFooterEditSource object has its own ScHeaderFooterTextData\n\nScHeaderFooterEditSource::ScHeaderFooterEditSource( ScHeaderFooterContentObj* pContent,\n                                                    USHORT nP ) :\n    ScSharedHeaderFooterEditSource( new ScHeaderFooterTextData( *pContent, nP ) )\n{\n}\n\nScHeaderFooterEditSource::ScHeaderFooterEditSource( ScHeaderFooterContentObj& rContent,\n                                                    USHORT nP ) :\n    ScSharedHeaderFooterEditSource( new ScHeaderFooterTextData( rContent, nP ) )\n{\n}\n\nScHeaderFooterEditSource::~ScHeaderFooterEditSource()\n{\n    delete GetTextData();   \/\/ not accessed in ScSharedHeaderFooterEditSource dtor\n}\n\nSvxEditSource* ScHeaderFooterEditSource::Clone() const\n{\n    const ScHeaderFooterTextData* pData = GetTextData();\n    return new ScHeaderFooterEditSource( pData->GetContentObj(), pData->GetPart() );\n}\n\n\/\/------------------------------------------------------------------------\n\nScSharedCellEditSource::ScSharedCellEditSource( ScCellTextData* pData ) :\n    pCellTextData( pData )\n{\n    \/\/  pCellTextData is part of the ScCellTextObj.\n    \/\/  Text range and cursor keep a reference to their parent text, so the text object is\n    \/\/  always alive and the CellTextData is valid as long as there are children.\n}\n\nScSharedCellEditSource::~ScSharedCellEditSource()\n{\n}\n\nSvxEditSource* ScSharedCellEditSource::Clone() const\n{\n    return new ScSharedCellEditSource( pCellTextData );\n}\n\nSvxTextForwarder* ScSharedCellEditSource::GetTextForwarder()\n{\n    return pCellTextData->GetTextForwarder();\n}\n\nvoid ScSharedCellEditSource::UpdateData()\n{\n    pCellTextData->UpdateData();\n}\n\nvoid ScSharedCellEditSource::SetDoUpdateData(sal_Bool bValue)\n{\n    pCellTextData->SetDoUpdate(bValue);\n}\n\nsal_Bool ScSharedCellEditSource::IsDirty() const\n{\n    return pCellTextData->IsDirty();\n}\n\nScEditEngineDefaulter* ScSharedCellEditSource::GetEditEngine()\n{\n    return pCellTextData->GetEditEngine();\n}\n\n\/\/------------------------------------------------------------------------\n\n\/\/  each ScCellEditSource object has its own ScCellTextData\n\nScCellEditSource::ScCellEditSource( ScDocShell* pDocSh, const ScAddress& rP ) :\n    ScSharedCellEditSource( new ScCellTextData( pDocSh, rP ) )\n{\n}\n\nScCellEditSource::~ScCellEditSource()\n{\n    delete GetCellTextData();   \/\/ not accessed in ScSharedCellEditSource dtor\n}\n\nSvxEditSource* ScCellEditSource::Clone() const\n{\n    const ScCellTextData* pData = GetCellTextData();\n    return new ScCellEditSource( pData->GetDocShell(), pData->GetCellPos() );\n}\n\n\/\/------------------------------------------------------------------------\n\nScAnnotationEditSource::ScAnnotationEditSource(ScDocShell* pDocSh, const ScAddress& rP) :\n    pDocShell( pDocSh ),\n    aCellPos( rP ),\n    pEditEngine( NULL ),\n    pForwarder( NULL ),\n    bDataValid( FALSE )\n{\n    if (pDocShell)\n        pDocShell->GetDocument()->AddUnoObject(*this);\n}\n\nScAnnotationEditSource::~ScAnnotationEditSource()\n{\n    ScUnoGuard aGuard;      \/\/  needed for EditEngine dtor\n\n    if (pDocShell)\n        pDocShell->GetDocument()->RemoveUnoObject(*this);\n\n    delete pForwarder;\n    delete pEditEngine;\n}\n\nSvxEditSource* ScAnnotationEditSource::Clone() const\n{\n    return new ScAnnotationEditSource( pDocShell, aCellPos );\n}\n\nSdrObject* ScAnnotationEditSource::GetCaptionObj()\n{\n    SdrObject* pRet = NULL;\n\n    ScDrawLayer* pModel = pDocShell->GetDocument()->GetDrawLayer();\n    if (!pModel)\n        return FALSE;\n    SdrPage* pPage = pModel->GetPage(static_cast<sal_uInt16>(aCellPos.Tab()));\n    DBG_ASSERT(pPage,\"Page ?\");\n\n    pPage->RecalcObjOrdNums();\n\n    SdrObjListIter aIter( *pPage, IM_FLAT );\n    SdrObject* pObject = aIter.Next();\n    while (pObject && !pRet)\n    {\n        if ( pObject->GetLayer() == SC_LAYER_INTERN && pObject->ISA( SdrCaptionObj ) )\n        {\n            ScDrawObjData* pData = ScDrawLayer::GetObjData( pObject );\n            if ( pData && aCellPos.Col() == pData->aStt.Col() && aCellPos.Row() == pData->aStt.Row() )\n            {\n                pRet = pObject;\n            }\n        }\n\n        pObject = aIter.Next();\n    }\n\n    return pRet;\n}\n\nSvxTextForwarder* ScAnnotationEditSource::GetTextForwarder()\n{\n    if (!pEditEngine)\n    {\n        \/\/ Notizen haben keine Felder\n        if ( pDocShell )\n        {\n            pEditEngine = new ScNoteEditEngine( pDocShell->GetDocument()->GetNoteEngine() );\n        }\n        else\n        {\n            SfxItemPool* pEnginePool = EditEngine::CreatePool();\n            pEnginePool->FreezeIdRanges();\n            pEditEngine = new ScEditEngineDefaulter( pEnginePool, TRUE );\n        }\n        pForwarder = new SvxEditEngineForwarder(*pEditEngine);\n    }\n\n    if (bDataValid)\n        return pForwarder;\n\n    if ( pDocShell )\n    {\n        ScDocument* pDoc = pDocShell->GetDocument();\n        ScPostIt aNote(pDoc);\n        pDoc->GetNote( aCellPos.Col(), aCellPos.Row(), aCellPos.Tab(), aNote );\n\n        if (aNote.GetEditTextObject())\n            pEditEngine->SetText( *aNote.GetEditTextObject() );     \/\/ incl. Umbrueche\n        else\n            pEditEngine->SetText( aNote.GetText() );\n    }\n\n    bDataValid = TRUE;\n    return pForwarder;\n}\n\nvoid ScAnnotationEditSource::UpdateData()\n{\n    if ( pDocShell && pEditEngine )\n    {\n        ScDocShellModificator aModificator( *pDocShell );\n\n        ScDocument* pDoc = pDocShell->GetDocument();\n        ScPostIt aNote(pDoc);\n        pDoc->GetNote( aCellPos.Col(), aCellPos.Row(), aCellPos.Tab(), aNote );\n\n        aNote.SetEditTextObject(pEditEngine->CreateTextObject());\n\n        pDoc->SetNote(aCellPos.Col(), aCellPos.Row(), aCellPos.Tab(), aNote);\n\n        if (aNote.IsShown())\n        {\n            SdrObject* pObj = GetCaptionObj();\n            if (pObj)\n            {\n                OutlinerParaObject* pOPO = new OutlinerParaObject( *aNote.GetEditTextObject() );\n                pOPO->SetOutlinerMode( OUTLINERMODE_TEXTOBJECT );\n                pObj->NbcSetOutlinerParaObject( pOPO );\n                pOPO->SetVertical( FALSE );  \/\/ notes are always horizontal\n\n                pObj->ActionChanged();\n            }\n        }\n\n        \/\/! Undo !!!\n\n        aModificator.SetDocumentModified();\n\n        \/\/ bDataValid wird bei SetDocumentModified zurueckgesetzt\n    }\n}\n\nvoid ScAnnotationEditSource::Notify( SfxBroadcaster&, const SfxHint& rHint )\n{\n    if ( rHint.ISA( ScUpdateRefHint ) )\n    {\n\/\/        const ScUpdateRefHint& rRef = (const ScUpdateRefHint&)rHint;\n\n        \/\/! Ref-Update\n    }\n    else if ( rHint.ISA( SfxSimpleHint ) )\n    {\n        ULONG nId = ((const SfxSimpleHint&)rHint).GetId();\n        if ( nId == SFX_HINT_DYING )\n        {\n            pDocShell = NULL;                       \/\/ ungueltig geworden\n\n            DELETEZ( pForwarder );\n            DELETEZ( pEditEngine );     \/\/ EditEngine uses document's pool\n        }\n        else if ( nId == SFX_HINT_DATACHANGED )\n            bDataValid = FALSE;                     \/\/ Text muss neu geholt werden\n    }\n}\n\n\/\/------------------------------------------------------------------------\n\nScSimpleEditSource::ScSimpleEditSource( SvxTextForwarder* pForw ) :\n    pForwarder( pForw )\n{\n    \/\/  The same forwarder (and EditEngine) is shared by all children of the same Text object.\n    \/\/  Text range and cursor keep a reference to their parent text, so the text object is\n    \/\/  always alive and the forwarder is valid as long as there are children.\n}\n\nScSimpleEditSource::~ScSimpleEditSource()\n{\n}\n\nSvxEditSource* ScSimpleEditSource::Clone() const\n{\n    return new ScSimpleEditSource( pForwarder );\n}\n\nSvxTextForwarder* ScSimpleEditSource::GetTextForwarder()\n{\n    return pForwarder;\n}\n\nvoid ScSimpleEditSource::UpdateData()\n{\n    \/\/  nothing\n}\n\n\/\/------------------------------------------------------------------------\n\nScAccessibilityEditSource::ScAccessibilityEditSource( ::std::auto_ptr < ScAccessibleTextData > pAccessibleCellTextData )\n    : mpAccessibleTextData(pAccessibleCellTextData)\n{\n}\n\nScAccessibilityEditSource::~ScAccessibilityEditSource()\n{\n}\n\nSvxEditSource* ScAccessibilityEditSource::Clone() const\n{\n    return new ScAccessibilityEditSource(::std::auto_ptr < ScAccessibleTextData > (mpAccessibleTextData->Clone()));\n}\n\nSvxTextForwarder* ScAccessibilityEditSource::GetTextForwarder()\n{\n    return mpAccessibleTextData->GetTextForwarder();\n}\n\nSvxViewForwarder* ScAccessibilityEditSource::GetViewForwarder()\n{\n    return mpAccessibleTextData->GetViewForwarder();\n}\n\nSvxEditViewForwarder* ScAccessibilityEditSource::GetEditViewForwarder( sal_Bool bCreate )\n{\n    return mpAccessibleTextData->GetEditViewForwarder(bCreate);\n}\n\nvoid ScAccessibilityEditSource::UpdateData()\n{\n    mpAccessibleTextData->UpdateData();\n}\n\nSfxBroadcaster& ScAccessibilityEditSource::GetBroadcaster() const\n{\n    return mpAccessibleTextData->GetBroadcaster();\n}\n\nvoid ScAccessibilityEditSource::SetDoUpdateData(sal_Bool bValue)\n{\n    mpAccessibleTextData->SetDoUpdate(bValue);\n}\n\nsal_Bool ScAccessibilityEditSource::IsDirty() const\n{\n    return mpAccessibleTextData->IsDirty();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\n\/\/ Copyright 2005-2009 Daniel James.\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#if !defined(BOOST_FUNCTIONAL_HASH_DETAIL_HASH_FLOAT_HEADER)\n#define BOOST_FUNCTIONAL_HASH_DETAIL_HASH_FLOAT_HEADER\n\n#if defined(_MSC_VER) && (_MSC_VER >= 1020)\n# pragma once\n#endif\n\n#include <boost\/config.hpp>\n#include <boost\/functional\/hash\/detail\/float_functions.hpp>\n#include <boost\/functional\/hash\/detail\/limits.hpp>\n#include <boost\/integer\/static_log2.hpp>\n#include <boost\/cstdint.hpp>\n#include <boost\/assert.hpp>\n\n\/\/ Include hash implementation for the current platform.\n\n\/\/ Cygwn\n#if defined(__CYGWIN__)\n#  if defined(__i386__) || defined(_M_IX86)\n#    include <boost\/functional\/hash\/detail\/hash_float_x86.hpp>\n#  else\n#    include <boost\/functional\/hash\/detail\/hash_float_generic.hpp>\n#  endif\n#else\n#  include <boost\/functional\/hash\/detail\/hash_float_generic.hpp>\n#endif\n\n\/\/ Can we use fpclassify?\n\n\/\/ STLport\n#if defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION)\n#define BOOST_HASH_USE_FPCLASSIFY 0\n\n\/\/ GNU libstdc++ 3\n#elif defined(__GLIBCPP__) || defined(__GLIBCXX__)\n#  if (defined(__USE_ISOC99) || defined(_GLIBCXX_USE_C99_MATH)) && \\\n      !(defined(macintosh) || defined(__APPLE__) || defined(__APPLE_CC__))\n#    define BOOST_HASH_USE_FPCLASSIFY 1\n#  else\n#    define BOOST_HASH_USE_FPCLASSIFY 0\n#  endif\n\n\/\/ Everything else\n#else\n#  define BOOST_HASH_USE_FPCLASSIFY 0\n#endif\n\n#if BOOST_HASH_USE_FPCLASSIFY\n\n#include <boost\/config\/no_tr1\/cmath.hpp>\n\nnamespace pdalboost{} namespace boost = pdalboost; namespace pdalboost{\n    namespace hash_detail\n    {\n        template <class T>\n        inline std::size_t float_hash_value(T v)\n        {\n            using namespace std;\n            switch (fpclassify(v)) {\n            case FP_ZERO:\n                return 0;\n            case FP_INFINITE:\n                return (std::size_t)(v > 0 ? -1 : -2);\n            case FP_NAN:\n                return (std::size_t)(-3);\n            case FP_NORMAL:\n            case FP_SUBNORMAL:\n                return float_hash_impl(v);\n            default:\n                BOOST_ASSERT(0);\n                return 0;\n            }\n        }\n    }\n}\n\n#else \/\/ !BOOST_HASH_USE_FPCLASSIFY\n\nnamespace pdalboost{} namespace boost = pdalboost; namespace pdalboost{\n    namespace hash_detail\n    {\n        template <class T>\n        inline std::size_t float_hash_value(T v)\n        {\n            return v == 0 ? 0 : float_hash_impl(v);\n        }\n    }\n}\n\n#endif \/\/ BOOST_HASH_USE_FPCLASSIFY\n\n#undef BOOST_HASH_USE_FPCLASSIFY\n\n#endif\n<commit_msg>add back #pragma<commit_after>\n\/\/ Copyright 2005-2009 Daniel James.\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#if !defined(BOOST_FUNCTIONAL_HASH_DETAIL_HASH_FLOAT_HEADER)\n#define BOOST_FUNCTIONAL_HASH_DETAIL_HASH_FLOAT_HEADER\n\n#pragma GCC diagnostic ignored \"-Wfloat-equal\"\n\n#if defined(_MSC_VER) && (_MSC_VER >= 1020)\n# pragma once\n#endif\n\n#include <boost\/config.hpp>\n#include <boost\/functional\/hash\/detail\/float_functions.hpp>\n#include <boost\/functional\/hash\/detail\/limits.hpp>\n#include <boost\/integer\/static_log2.hpp>\n#include <boost\/cstdint.hpp>\n#include <boost\/assert.hpp>\n\n\/\/ Include hash implementation for the current platform.\n\n\/\/ Cygwn\n#if defined(__CYGWIN__)\n#  if defined(__i386__) || defined(_M_IX86)\n#    include <boost\/functional\/hash\/detail\/hash_float_x86.hpp>\n#  else\n#    include <boost\/functional\/hash\/detail\/hash_float_generic.hpp>\n#  endif\n#else\n#  include <boost\/functional\/hash\/detail\/hash_float_generic.hpp>\n#endif\n\n\/\/ Can we use fpclassify?\n\n\/\/ STLport\n#if defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION)\n#define BOOST_HASH_USE_FPCLASSIFY 0\n\n\/\/ GNU libstdc++ 3\n#elif defined(__GLIBCPP__) || defined(__GLIBCXX__)\n#  if (defined(__USE_ISOC99) || defined(_GLIBCXX_USE_C99_MATH)) && \\\n      !(defined(macintosh) || defined(__APPLE__) || defined(__APPLE_CC__))\n#    define BOOST_HASH_USE_FPCLASSIFY 1\n#  else\n#    define BOOST_HASH_USE_FPCLASSIFY 0\n#  endif\n\n\/\/ Everything else\n#else\n#  define BOOST_HASH_USE_FPCLASSIFY 0\n#endif\n\n#if BOOST_HASH_USE_FPCLASSIFY\n\n#include <boost\/config\/no_tr1\/cmath.hpp>\n\nnamespace pdalboost{} namespace boost = pdalboost; namespace pdalboost{\n    namespace hash_detail\n    {\n        template <class T>\n        inline std::size_t float_hash_value(T v)\n        {\n            using namespace std;\n            switch (fpclassify(v)) {\n            case FP_ZERO:\n                return 0;\n            case FP_INFINITE:\n                return (std::size_t)(v > 0 ? -1 : -2);\n            case FP_NAN:\n                return (std::size_t)(-3);\n            case FP_NORMAL:\n            case FP_SUBNORMAL:\n                return float_hash_impl(v);\n            default:\n                BOOST_ASSERT(0);\n                return 0;\n            }\n        }\n    }\n}\n\n#else \/\/ !BOOST_HASH_USE_FPCLASSIFY\n\nnamespace pdalboost{} namespace boost = pdalboost; namespace pdalboost{\n    namespace hash_detail\n    {\n        template <class T>\n        inline std::size_t float_hash_value(T v)\n        {\n            return v == 0 ? 0 : float_hash_impl(v);\n        }\n    }\n}\n\n#endif \/\/ BOOST_HASH_USE_FPCLASSIFY\n\n#undef BOOST_HASH_USE_FPCLASSIFY\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"scanner\/util\/cuda.h\"\n\nnamespace Halide {\nnamespace Runtime {\nnamespace Internal {\nnamespace Cuda {\nCUcontext context = 0;\n}\n}\n}\n}\n<commit_msg>Fix CPU build<commit_after>#include \"scanner\/util\/cuda.h\"\n\n#ifdef HAVE_CUDA\nnamespace Halide {\nnamespace Runtime {\nnamespace Internal {\nnamespace Cuda {\nCUcontext context = 0;\n}\n}\n}\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"gtest\/gtest.h\"\r\n#include \"gmock\/gmock-matchers.h\"\r\n\r\n#include \"MissionTestHelpers.h\"\r\n\r\nusing testing::Test;\r\nusing testing::Eq;\r\n\r\nclass ActionDispatchTest : public Test\r\n{\r\n  protected:\r\n    SystemState state;\r\n\r\n  public:\r\n    ActionDispatchTest()\r\n    {\r\n        SystemStateEmpty(&state);\r\n    }\r\n};\r\n\r\nTEST_F(ActionDispatchTest, ShouldExecuteRunnableAction)\r\n{\r\n    SystemAction& action = SystemAction(\"Action\").Always().DoNothing();\r\n\r\n    SystemActionDescriptor actions[] = {action};\r\n    SystemActionDescriptor* runnable[COUNT_OF(actions)] = {0};\r\n\r\n    auto runnableCount = SystemDetermineActions(&state, actions, COUNT_OF(actions), runnable);\r\n\r\n    SystemDispatchActions(&state, runnable, runnableCount);\r\n\r\n    ASSERT_THAT(action.WasExecuted(), Eq(true)) << \"action should be executed\";\r\n}\r\n\r\nTEST_F(ActionDispatchTest, OnlyOneActionOfRunnableActionsShouldBeExecutedInSingleDispatch)\r\n{\r\n    SystemAction& action1 = SystemAction(\"Action1\").Always().DoNothing();\r\n\r\n    SystemAction& action2 = SystemAction(\"Action2\").Always().DoNothing();\r\n\r\n    SystemActionDescriptor actions[] = {action1, action2};\r\n    SystemActionDescriptor* runnable[COUNT_OF(actions)];\r\n\r\n    auto runnableCount = SystemDetermineActions(&state, actions, COUNT_OF(actions), runnable);\r\n\r\n    SystemDispatchActions(&state, runnable, runnableCount);\r\n\r\n    ASSERT_THAT(action1.WasExecuted(), Eq(true)) << \"action1 should not be executed\";\r\n    ASSERT_THAT(action2.WasExecuted(), Eq(false)) << \"action2 should be executed\";\r\n}\r\n\r\nTEST_F(ActionDispatchTest, ShouldExecuteDifferentActionInEachDispatch)\r\n{\r\n    SystemAction& action1 = SystemAction(\"Action1\").Always().DoNothing();\r\n    SystemAction& action2 = SystemAction(\"Action2\").Always().DoNothing();\r\n    SystemAction& action3 = SystemAction(\"Action3\").Always().DoNothing();\r\n\r\n    SystemActionDescriptor actions[] = {action1, action2, action3};\r\n    SystemActionDescriptor* runnable[COUNT_OF(actions)];\r\n\r\n    auto runnableCount = SystemDetermineActions(&state, actions, COUNT_OF(actions), runnable);\r\n\r\n    SystemDispatchActions(&state, runnable, runnableCount);\r\n\r\n    ASSERT_THAT(action1.WasExecuted(), Eq(true)) << \"action1 should be executed\";\r\n    ASSERT_THAT(action2.WasExecuted(), Eq(false)) << \"action2 should not be executed\";\r\n    ASSERT_THAT(action3.WasExecuted(), Eq(false)) << \"action2 should not be executed\";\r\n\r\n    action1.ClearExecuted();\r\n    action2.ClearExecuted();\r\n    action3.ClearExecuted();\r\n\r\n    SystemDispatchActions(&state, runnable, runnableCount);\r\n\r\n    ASSERT_THAT(action1.WasExecuted(), Eq(false)) << \"action1 should not be executed in second dispatch\";\r\n    ASSERT_THAT(action2.WasExecuted(), Eq(true)) << \"action2 should be executed in second dispatch\";\r\n    ASSERT_THAT(action3.WasExecuted(), Eq(false)) << \"action2 should not be in second executed\";\r\n\r\n    action1.ClearExecuted();\r\n    action2.ClearExecuted();\r\n    action3.ClearExecuted();\r\n\r\n    SystemDispatchActions(&state, runnable, runnableCount);\r\n\r\n    ASSERT_THAT(action1.WasExecuted(), Eq(false)) << \"action1 should not be executed in third dispatch\";\r\n    ASSERT_THAT(action2.WasExecuted(), Eq(false)) << \"action2 should not be executed in third dispatch\";\r\n    ASSERT_THAT(action3.WasExecuted(), Eq(true)) << \"action2 should be in third executed\";\r\n}\r\n\r\ntemplate <int ActionCount, int RunCount>\r\nvoid LoopingDispatch(SystemState* state, bool runnable[RunCount][ActionCount], size_t executionOrder[RunCount])\r\n{\r\n    SystemAction actions[ActionCount];\r\n    SystemActionDescriptor descriptors[ActionCount];\r\n\r\n    for (size_t i = 0; i < ActionCount; i++)\r\n    {\r\n        actions[i].DoNothing();\r\n\r\n        descriptors[i] = actions[i];\r\n    }\r\n\r\n    for (size_t run = 0; run < RunCount; run++)\r\n    {\r\n        for (size_t i = 0; i < ActionCount; i++)\r\n        {\r\n            if (runnable[run][i])\r\n            {\r\n                actions[i].Always();\r\n            }\r\n            else\r\n            {\r\n                actions[i].Never();\r\n            }\r\n\r\n            actions[i].ClearExecuted();\r\n        }\r\n\r\n        SystemActionDescriptor* toDispatch[ActionCount];\r\n\r\n        auto runnableCount = SystemDetermineActions(state, descriptors, ActionCount, toDispatch);\r\n\r\n        SystemDispatchActions(state, toDispatch, runnableCount);\r\n\r\n        for (size_t i = 0; i < ActionCount; i++)\r\n        {\r\n            if (executionOrder[run] == i)\r\n            {\r\n                ASSERT_THAT(actions[i].WasExecuted(), Eq(true)) << \"action \" << i << \" should be executed in dispatch \" << run;\r\n            }\r\n            else\r\n            {\r\n                ASSERT_THAT(actions[i].WasExecuted(), Eq(false)) << \"action \" << i << \" should not be executed in dispatch \" << run;\r\n            }\r\n        }\r\n    }\r\n}\r\n\r\nTEST_F(ActionDispatchTest, DispatchActionPatternTest)\r\n{\r\n    bool runnable[3][3] = {\r\n        {true, true, true}, \/\/ dispatch 0\r\n        {true, true, true}, \/\/ dispatch 1\r\n        {true, true, true}, \/\/ dispatch 1\r\n    };\r\n\r\n    size_t executionOrder[] = {0, 1, 2};\r\n\r\n    LoopingDispatch<3, 3>(&state, runnable, executionOrder);\r\n}\r\n\r\nTEST_F(ActionDispatchTest, OneActionShouldBeDispatchedAlways)\r\n{\r\n    bool runnable[4][1] = {\r\n        {true},  \/\/ dispatch 0\r\n        {false}, \/\/ dispatch 1\r\n        {true},  \/\/ dispatch 2\r\n        {true}   \/\/ dispatch 3\r\n    };\r\n\r\n    size_t executionOrder[] = {0, 2, 0, 0};\r\n\r\n    LoopingDispatch<1, 4>(&state, runnable, executionOrder);\r\n}\r\n\r\nTEST_F(ActionDispatchTest, SingleActionInEachDispatch)\r\n{\r\n    bool runnable[4][3] = {\r\n        {true, false, false}, \/\/ dispatch 0\r\n        {false, true, false}, \/\/ dispatch 1\r\n        {false, false, true}, \/\/ dispatch 2\r\n        {false, true, false}  \/\/ dispatch 3\r\n    };\r\n\r\n    size_t executionOrder[] = {0, 1, 2, 1};\r\n\r\n    LoopingDispatch<3, 4>(&state, runnable, executionOrder);\r\n}\r\n\r\nTEST_F(ActionDispatchTest, ComplexScenario)\r\n{\r\n    bool runnable[10][4] = {\r\n        {true, true, false, false}, \/\/\r\n        {true, false, true, false}, \/\/\r\n        {false, true, true, true},  \/\/\r\n        {true, true, false, true},  \/\/\r\n        {true, true, true, true},   \/\/\r\n        {true, true, false, false}, \/\/\r\n        {false, false, true, true}, \/\/\r\n        {true, false, false, true}, \/\/\r\n        {false, true, true, false}  \/\/\r\n    };\r\n\r\n    size_t executionOrder[] = {0, 2, 1, 3, 0, 1, 2, 3, 1};\r\n\r\n    LoopingDispatch<4, 10>(&state, runnable, executionOrder);\r\n}\r\n\r\nTEST_F(ActionDispatchTest, ComplexScenario2)\r\n{\r\n    bool runnable[5][3] = {\r\n        {false, true, false}, \/\/\r\n        {true, false, true},  \/\/\r\n        {true, false, true},  \/\/\r\n        {true, false, true},  \/\/\r\n        {false, true, true}   \/\/\r\n    };\r\n\r\n    size_t executionOrder[] = {1, 0, 2, 0, 1};\r\n\r\n    LoopingDispatch<3, 5>(&state, runnable, executionOrder);\r\n}\r\n<commit_msg>Removed test for failed attempt of intelligent action-dispatch<commit_after>#include \"gtest\/gtest.h\"\r\n#include \"gmock\/gmock-matchers.h\"\r\n\r\n#include \"MissionTestHelpers.h\"\r\n\r\nusing testing::Test;\r\nusing testing::Eq;\r\n\r\nclass ActionDispatchTest : public Test\r\n{\r\n  protected:\r\n    SystemState state;\r\n\r\n  public:\r\n    ActionDispatchTest()\r\n    {\r\n        SystemStateEmpty(&state);\r\n    }\r\n};\r\n\r\nTEST_F(ActionDispatchTest, ShouldExecuteRunnableAction)\r\n{\r\n    SystemAction& action1 = SystemAction(\"Action1\").Always().DoNothing();\r\n    SystemAction& action2 = SystemAction(\"Action2\").Always().DoNothing();\r\n\r\n    SystemActionDescriptor actions[] = {action1, action2};\r\n    SystemActionDescriptor* runnable[COUNT_OF(actions)] = {0};\r\n\r\n    auto runnableCount = SystemDetermineActions(&state, actions, COUNT_OF(actions), runnable);\r\n\r\n    SystemDispatchActions(&state, runnable, runnableCount);\r\n\r\n    ASSERT_THAT(action1.WasExecuted(), Eq(true)) << \"action1 should be executed\";\r\n    ASSERT_THAT(action2.WasExecuted(), Eq(true)) << \"action2 should be executed\";\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/***************************************************************************\n    Modified by himani.bhatt@cern.ch  - last modified on 30\/04\/2018 \n\n   priyanka.sett@cern.ch - last modified on 27\/10\/2016\n  \n \n\n  for L* in pp 13 TeV analysis\n\n\n\/\/ General macro to configure the RSN analysis task.\n\/\/ It calls all configs desired by the user, by means\n\/\/ of the boolean switches defined in the first lines.\n\/\/ ---\n\/\/ Inputs:\n\/\/  1) flag to know if running on MC or data\n\/\/  2) path where all configs are stored\n\/\/ ---\n\/\/ Returns:\n\/\/  kTRUE  --> initialization successful\n\/\/  kFALSE --> initialization failed (some config gave errors)\n\/\/\n****************************************************************************\/\nenum pairYCutSet { kPairDefault=0,\n\t\t   kCentral \/\/=1\n                 };\nenum eventCutSet { kDefaultVtx = 0,\n\t\t   kDefaultVtx9, \/\/=1\n\t\t   kDefaultVtx8, \/\/=2\n\t\t   kDefaultVtx12, \/\/=3\n\t\t   kDefaultVtx11,  \/\/=4\n\t\t   kNoPileUpCut, \/\/=5                 \n\t\t   kNoEvtSel, \/\/=6   \/\/No event selection, only INEL events  \n\t\t   kSpecial2,\/\/=7   \/\/ No Vz cut on vtx, f_vtx = kSpecial2\/default_data\n\t\t   kSpecial3, \/\/= 8  \/\/ No event selection, INEL events with Vz cut on vtx  kSpecial3\/default_MC = f_SL\n\t\t   kTriggered, \/\/=6\n};\n\n\n\nenum eventMixConfig { kDisabled = -1,\n\t\t      k5Evts5Cent, \/\/=0 \/\/5 events, Dvz = 1cm, DC = 5\n\t\t      kMixDefault, \/\/=1 \/\/10 events, Dvz = 1cm, DC = 10\n\t\t      k5Evts, \/\/=2 \/\/5 events, Dvz = 1cm, DC = 10\n\t\t      k5Cent  \/\/=3 \/\/10 events, Dvz = 1cm, DC = 5\n\t\t     \n};\n\nAliRsnMiniAnalysisTask * AddTaskLstar13TeVpp_II\n(\n Bool_t      isMC = kFALSE,\n Bool_t      isPP = kTRUE,\n Int_t       aodFilterBit = 5,\n Int_t       pairCutSetID=0,\n Int_t       evtCutSetID = 0,\n Int_t       mixingConfigID = 0,\n Int_t       MultBins = 0,\/\/ default for V0_M and MultBins = 2 for RefMult0_8 \n Int_t       customQualityCutsID=1, \/\/ for default\n Float_t     nsigmaPr = 2.0,\n Float_t     nsigmaKa = 2.0,\n Bool_t      enableMonitor = kTRUE,\n Bool_t      IsMcTrueOnly = kFALSE,\n TString     outNameSuffix = \"Default\"\n )\n\n{\n\n  AliRsnCutSetDaughterParticle::ERsnDaughterCutSet cutPrCandidate = AliRsnCutSetDaughterParticle::kTPCTOFpidLstar13ppTeV;\n  AliRsnCutSetDaughterParticle::ERsnDaughterCutSet cutKaCandidate = AliRsnCutSetDaughterParticle::kTPCTOFpidLstar13ppTeV;\n  \n  \n  \/\/-------------------------------------------\n  \/\/ event cuts\n  \/\/-------------------------------------------\n  \n  UInt_t      triggerMask = AliVEvent::kINT7;\n  if(evtCutSetID>=100){\n    triggerMask=AliVEvent::kHighMultV0;\n    evtCutSetID=evtCutSetID%100;\n  }\n\n  Bool_t      rejectPileUp=kTRUE;\n  Double_t    vtxZcut = 10.0;\/\/default cut on vtx z\n  \/\/Int_t       MultBins = aodFilterBit\/100;\n  \n  if(evtCutSetID==eventCutSet::kDefaultVtx12) vtxZcut=12.0; \/\/cm\n  if(evtCutSetID==eventCutSet::kDefaultVtx11) vtxZcut=11.0; \/\/cm\n  if(evtCutSetID==eventCutSet::kDefaultVtx9) vtxZcut=9.0; \/\/cm\n  if(evtCutSetID==eventCutSet::kDefaultVtx8) vtxZcut=8.0; \/\/cm\n  if(evtCutSetID==eventCutSet::kNoPileUpCut) rejectPileUp=kFALSE;\n  if(evtCutSetID==eventCutSet::kSpecial2) vtxZcut=1.e6;\/\/off\n\n   if(!isPP || isMC || MultBins) rejectPileUp=kFALSE;\n\n\n  \/\/-------------------------------------------\n  \/\/mixing settings\n  \/\/-------------------------------------------\n  Int_t       nmix=0;\n  Float_t     maxDiffVzMix=1.;\n  Float_t     maxDiffMultMix=10.;\n  \n  if(mixingConfigID==eventMixConfig::kMixDefault) nmix=10;\n  if(mixingConfigID==eventMixConfig::k5Evts) nmix=5;\n  if(mixingConfigID==eventMixConfig::k5Cent) maxDiffMultMix=5;\n  if(mixingConfigID==eventMixConfig::k5Evts5Cent) { maxDiffMultMix=5; nmix = 5;}\n \n\/\/-------------------------------------------\n  \/\/pair cuts\n  \/\/-------------------------------------------\n  Double_t    minYlab=-0.5;\n  Double_t    maxYlab= 0.5;\n\n  if(pairCutSetID==pairYCutSet::kCentral){\/\/|y_cm|<0.3\n    minYlab=-0.3; maxYlab=0.3;\n  } \n  Bool_t CheckDecay=true;\n  if(customQualityCutsID==99){customQualityCutsID=1; CheckDecay=false;}\n  \/\/\n  \/\/ -- INITIALIZATION ----------------------------------------------------------------------------\n  \/\/ retrieve analysis manager\n  \/\/\n  \n  \n  TString outputFileName = Form(\"%s\", AliAnalysisManager::GetCommonFileName());\n  \/\/ Objects name\n  \n  \n  AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n  if (!mgr) {\n    ::Error(\"AddTaskLstar13TeVpp_II\", \"No analysis manager to connect to.\");\n    return NULL;\n  } \n  \n  \n  \/\/ create the task and configure \n  TString taskName = outNameSuffix.Data();\n  AliRsnMiniAnalysisTask *task = new AliRsnMiniAnalysisTask(taskName.Data(), isMC);\n  \n  if(evtCutSetID!=eventCutSet::kNoEvtSel && evtCutSetID!=eventCutSet::kSpecial3){\n    task->UseESDTriggerMask(triggerMask);  \/\/ for ESD \n    \/\/task->SelectCollisionCandidates(triggerMask); \/\/AOD\n  }\n  if(isPP){\n    if(MultBins==1) task->UseMultiplicity(\"AliMultSelection_V0M\");\n    else if(MultBins==2) task->UseMultiplicity(\"AliMultSelection_RefMult08\");\n    else task->UseMultiplicity(\"QUALITY\");\n  }else task->UseCentrality(\"V0M\");\n  \n  \n  \/\/ set event mixing options\n  task->UseContinuousMix();\n  \/\/task->UseBinnedMix();\n  task->SetNMix(nmix);\n  task->SetMaxDiffVz(maxDiffVzMix);\n  task->SetMaxDiffMult(maxDiffMultMix);\n  \/\/if (!isPP) task->SetMaxDiffAngle(maxDiffAngleMixDeg*TMath::DegToRad()); \/\/set angle diff in rad\n  ::Info(\"AddTaskLstar13TeVpp_II\", Form(\"Event mixing configuration: \\n events to mix = %i \\n max diff. vtxZ = cm %5.3f \\n max diff multi = %5.3f \\n \", nmix, maxDiffVzMix, maxDiffMultMix));\n  \n  mgr->AddTask(task);\n  \n  \/\/\n  \/\/ -- EVENT CUTS (same for all configs) ---------------------------------------------------------\n  \/\/  \n  \/\/ cut on primary vertex:\n  \/\/ - 2nd argument --> |Vz| range\n  \/\/ - 3rd argument --> minimum required number of contributors\n  \/\/ - 4th argument --> tells if TPC stand-alone vertexes must be accepted\n  \n  \n  \/\/ vertex cuts\n  \n  \/\/Bool_t rejectPileUp=kTRUE;\n  \/\/if (!isPP && !isMC) rejectPileUp=kFALSE;\n  \n  AliRsnCutPrimaryVertex* cutVertex=0;\n  \n  if(evtCutSetID!=eventCutSet::kNoEvtSel &&  evtCutSetID!=eventCutSet::kTriggered)\n    { \/\/ passes the vertex quality cut\n      cutVertex=new AliRsnCutPrimaryVertex(\"cutVertex\",vtxZcut,0,kFALSE);\n      cutVertex->SetCheckGeneratedVertexZ();\n      if(MultBins == 0 && evtCutSetID!=eventCutSet::kSpecial3){\n\tcutVertex->SetCheckZResolutionSPD();\n\tcutVertex->SetCheckDispersionSPD();\n\tcutVertex->SetCheckZDifferenceSPDTrack();\n      }\n      if(evtCutSetID==eventCutSet::kSpecial3) cutVertex->SetCheckGeneratedVertexZ();  \/\/ only Vz cut on vtx for INEL events\n    }\n  \n  \n  \n  \/\/ other event selection cuts\n  AliRsnCutEventUtils* cutEventUtils=0;\n  if(evtCutSetID!=eventCutSet::kNoEvtSel && evtCutSetID!=eventCutSet::kSpecial3)\n    {\n      cutEventUtils=new AliRsnCutEventUtils(\"cutEventUtils\",kTRUE,rejectPileUp);\n      if(MultBins == 0){\n\tcutEventUtils->SetCheckIncompleteDAQ();\n\tcutEventUtils->SetCheckSPDClusterVsTrackletBG();\n      }else{\n\tcutEventUtils->SetRemovePileUppA2013(kFALSE);\n\tif(evtCutSetID!=eventCutSet::kTriggered) cutEventUtils->SetCheckAcceptedMultSelection();\n\t\/\/cutEventUtils->SetCheckAcceptedMultSelection();\n      }\n    }\n  \n  \n  \/\/ set the check for pileup \n  if(isPP && (!isMC) && cutVertex){ \n    cutVertex->SetCheckPileUp(rejectPileUp); \n    ::Info(\"AddTaskLstar13TeVpp_II\", Form(\":::::::::::::::::: Pile-up rejection mode: %s\", (rejectPileUp)?\"ON\":\"OFF\"));\n  }\n  \n  \/\/ define and fill cut set for event cuts\n  AliRsnCutSet* eventCuts=0;\n  if(cutEventUtils || cutVertex){\n    eventCuts=new AliRsnCutSet(\"eventCuts\",AliRsnTarget::kEvent);\n    \n    if(cutEventUtils && cutVertex){\n      eventCuts->AddCut(cutEventUtils);\n      eventCuts->AddCut(cutVertex);\n      eventCuts->SetCutScheme(Form(\"%s&%s\",cutEventUtils->GetName(),cutVertex->GetName()));\n    }else if(cutEventUtils && !cutVertex){\n      eventCuts->AddCut(cutEventUtils);\n      eventCuts->SetCutScheme(Form(\"%s\",cutEventUtils->GetName()));\n    }else if(!cutEventUtils && cutVertex){\n      eventCuts->AddCut(cutVertex);\n      eventCuts->SetCutScheme(Form(\"%s\",cutVertex->GetName()));\n    }\n    \n    task->SetEventCuts(eventCuts);\n  }\n  \n  \n  \n  \/\/\n  \/\/ -- EVENT-ONLY COMPUTATIONS -------------------------------------------------------------------\n  \/\/   \n  \/\/vertex\n  Int_t vtxID = task->CreateValue(AliRsnMiniValue::kVz, kFALSE);\n  AliRsnMiniOutput *outVtx = task->CreateOutput(\"eventVtx\", \"HIST\", \"EVENT\");\n  outVtx->AddAxis(vtxID, 400, -20.0, 20.0);\n  \n  \/\/multiplicity or centrality\n  Int_t multID = task->CreateValue(AliRsnMiniValue::kMult, kFALSE);\n  AliRsnMiniOutput *outMult = task->CreateOutput(\"eventMult\", \"HIST\", \"EVENT\");\n  if (isPP && !MultBins)   outMult->AddAxis(multID, 400, 0.5, 400.5);\n  else  outMult->AddAxis(multID, 110, 0.0, 110.0);\n  \n  Double_t multbins[200];\n  int j,nmult=0;\n  for(j=0;j<10;j++){multbins[nmult]=0.0001*j; nmult++;}\n  for(j=1;j<10;j++){multbins[nmult]=0.001*j; nmult++;}\n  for(j=1;j<50;j++){multbins[nmult]=0.01*j; nmult++;}\n  for(j=5;j<10;j++){multbins[nmult]=0.1*j; nmult++;}\n  for(j=1;j<=100;j++){multbins[nmult]=j; nmult++;}\n  nmult--;\n  \n  TH1F* hEventsVsMulti=new TH1F(\"hAEventsVsMulti\",\"\",nmult,multbins);\n  task->SetEventQAHist(\"EventsVsMulti\",hEventsVsMulti);\/\/custom binning for fHAEventsVsMulti\n\n  TH2F* hvz=new TH2F(\"hVzVsCent\",\"\",110,0.,110., 240,-12.0,12.0);\n  task->SetEventQAHist(\"vz\",hvz);\/\/plugs this histogram into the fHAEventVz data member\n\n  double ybins[500];\n  for(j=0;j<=401;j++) ybins[j]=j-0.5;\n\n  TH2F* hmc=new TH2F(\"MultiVsCent\",\"\", nmult,multbins, 401,ybins);\n  hmc->GetYaxis()->SetTitle(\"QUALITY\");\n  task->SetEventQAHist(\"multicent\",hmc);\/\/plugs this histogram into the fHAEventMultiCent data member\n\n  \/\/  <<==============\n  \n  \n  \/\/\n  \/\/ -- PAIR CUTS  -------------------------------------------------------------------------------\n  \/\/\n  AliRsnCutMiniPair* cutY=new AliRsnCutMiniPair(\"cutRapidity\",AliRsnCutMiniPair::kRapidityRange);\n  cutY->SetRangeD(minYlab,maxYlab);\n\n  AliRsnCutSet* cutsPair=new AliRsnCutSet(\"pairCuts\",AliRsnTarget::kMother);\n  cutsPair->AddCut(cutY);\n  cutsPair->SetCutScheme(cutY->GetName());\n\n  task->SetCheckDecay(CheckDecay);\n\n  \/\/\n  \/\/ -- CONFIG ANALYSIS --------------------------------------------------------------------------\n  \n  \n  \/\/for systematic checks\n  \n    \n     gROOT->LoadMacro(\"$ALICE_PHYSICS\/PWGLF\/RESONANCES\/macros\/mini\/ConfigureLstar13TeVpp_II.C\");\n    \/\/gROOT->LoadMacro(\"ConfigureLstar13TeVpp_II.C\");\n    if (!ConfigureLstar13TeVpp_II(task, isMC, isPP, \"\", cutsPair, aodFilterBit, customQualityCutsID, cutPrCandidate, cutKaCandidate, nsigmaPr, nsigmaKa,  enableMonitor, isMC&IsMcTrueOnly)) \n      return 0x0;  \n  \n  \n  \n  \/\/\n  \/\/ -- CONTAINERS --------------------------------------------------------------------------------\n  \/\/\n  TString outputFileName = AliAnalysisManager::GetCommonFileName();\n  Printf(\"AddAnalysisTaskLstar13TeVpp - Set OutputFileName : \\n %s\\n\", outputFileName.Data() );\n  \n  AliAnalysisDataContainer *output = mgr->CreateContainer(Form(\"RsnOut_%s\",outNameSuffix.Data()),TList::Class(),AliAnalysisManager::kOutputContainer, outputFileName);\n  mgr->ConnectInput(task, 0, mgr->GetCommonInputContainer());\n  mgr->ConnectOutput(task, 1, output);\n  \/\/cout<<\" taskname  =  \"<<taskName.Data()<<endl;\n  return task;\n}\n<commit_msg>Modify event selection criteria for calculation of normalization factor for LStar analysis in pp at 13 TeV<commit_after>\/***************************************************************************\nModified on: 04\/08\/2019\nBy: Pragati Sahoo\n\nModified by himani.bhatt@cern.ch  - last modified on 30\/04\/2018 \npriyanka.sett@cern.ch - last modified on 27\/10\/2016\n\n\/\/Launches LStar analysis with rsn mini package\n\/\/Allows basic configuration of pile-up check and event cuts\n****************************************************************************\/\n\nenum pairYCutSet { kPairDefault=0,\n\t\t   kCentral \/\/=1\n                 };\n\nenum eventCutSet { kEvtDefault=0,\n\t\t   kNoPileUpCut, \/\/=1\n\t\t   kDefaultVtx12,\/\/=2\n\t\t   kDefaultVtx8, \/\/=3\n\t\t   kDefaultVtx5, \/\/=4                    \n\t\t   kMCEvtDefault, \/\/=5                   \n\t\t   kTriggered, \/\/=6\n\t\t   kNoVzCut, \/\/=7\n\t\t   kNoEvtSel, \/\/=8\n\t\t   kINEL10, \/\/=9\n\t\t   kIGZ10, \/\/=10\n           kIGZ \/\/=11\n                 };\n\nenum eventMixConfig { kDisabled = -1,\n\t\t      kMixDefault,\/\/=0 \/\/10 events, Dvz = 1cm, DC = 10\n\t\t      k5Evts, \/\/=1 \/\/5 events, Dvz = 1cm, DC = 10\n\t\t      k5Cent,  \/\/=2 \/\/10 events, Dvz = 1cm, DC = 5\n\t\t      k5Evts5Cent\n                    };\n\nAliRsnMiniAnalysisTask * AddTaskLstar13TeVpp_II\n(\n Bool_t      isMC=kFALSE,\n Bool_t      isPP=kTRUE,\n TString     outNameSuffix=\"tpc2stof3veto\",\n Int_t       evtCutSetID=0,\n Int_t       pairCutSetID=0,\n Int_t       mixingConfigID=0,\n Int_t       aodFilterBit=5,\n Int_t       customQualityCutsID=1,\n Float_t     nsigmaPr = 2.0,\n Float_t     nsigmaKa=2.,\n Bool_t      enableMonitor=kTRUE,\n Bool_t      IsMcTrueOnly=kFALSE\n )\n{  \n\nAliRsnCutSetDaughterParticle::ERsnDaughterCutSet cutPrCandidate = AliRsnCutSetDaughterParticle::kTPCTOFpidLstar13ppTeV;\n  AliRsnCutSetDaughterParticle::ERsnDaughterCutSet cutKaCandidate = AliRsnCutSetDaughterParticle::kTPCTOFpidLstar13ppTeV;\n  \n  \/\/-------------------------------------------\n  \/\/ event cuts\n  \/\/-------------------------------------------\n  UInt_t      triggerMask=AliVEvent::kINT7;\n  if(evtCutSetID>=100){\n    triggerMask=AliVEvent::kHighMultV0;\n    evtCutSetID=evtCutSetID%100;\n  }\n\n  Bool_t      rejectPileUp=kTRUE;\n  Double_t    vtxZcut=10.0;\/\/cm, default cut on vtx z\n  Int_t       MultBins=aodFilterBit\/100;\n\n  if(evtCutSetID==eventCutSet::kDefaultVtx12) vtxZcut=12.0; \/\/cm\n  if(evtCutSetID==eventCutSet::kDefaultVtx8) vtxZcut=8.0; \/\/cm\n  if(evtCutSetID==eventCutSet::kDefaultVtx5) vtxZcut=5.0; \/\/cm\n  if(evtCutSetID==eventCutSet::kNoPileUpCut) rejectPileUp=kFALSE;\n  if(evtCutSetID==eventCutSet::kNoVzCut) vtxZcut=1.e6;\/\/off\n\n  if(!isPP || isMC || MultBins) rejectPileUp=kFALSE;\n\n  \/\/-------------------------------------------\n  \/\/pair cuts\n  \/\/-------------------------------------------\n  Double_t    minYlab=-0.5;\n  Double_t    maxYlab= 0.5;\n\n  if(pairCutSetID==pairYCutSet::kCentral){\/\/|y_cm|<0.3\n    minYlab=-0.3; maxYlab=0.3;\n  }\n\n  Bool_t CheckDecay=true;\n  if(customQualityCutsID==99){customQualityCutsID=1; CheckDecay=false;}\n\n  \/\/-------------------------------------------\n  \/\/mixing settings\n  \/\/-------------------------------------------\n  Int_t       nmix=0;\n  Float_t     maxDiffVzMix=1.;\n  Float_t     maxDiffMultMix=10.;\n\n  if(mixingConfigID==eventMixConfig::kMixDefault) nmix=10;\n  if(mixingConfigID==eventMixConfig::k5Evts) nmix=5;\n  if(mixingConfigID==eventMixConfig::k5Cent) maxDiffMultMix=5;\n  if(mixingConfigID==eventMixConfig::k5Evts5Cent){nmix=5; maxDiffMultMix=5;}\n\n  \/\/ -- INITIALIZATION ----------------------------------------------------------------------------\n  \/\/ retrieve analysis manager\n\n  AliAnalysisManager* mgr=AliAnalysisManager::GetAnalysisManager();\n  if(!mgr){\n    ::Error(\"AddTaskLstar13TeVpp_II\", \"No analysis manager to connect to.\");\n    return NULL;\n  }\n\n  \/\/ create the task and configure\n  TString taskName = Form(\"LStar%s%s_%i\",(isPP? \"pp\" : \"PbPb\"),(isMC ? \"MC\" : \"Data\"));\n    \/\/Form(\"%s\", AliAnalysisManager::GetCommonFileName());\n    \/\/Form(\"LStar%s%s_%i\",(isPP? \"pp\" : \"PbPb\"),(isMC ? \"MC\" : \"Data\"),(Int_t)cutKaCandidate);\n \n  \/\/ Objects name\n  AliRsnMiniAnalysisTask* task=new AliRsnMiniAnalysisTask(taskName.Data(),isMC);\n  \n  if(evtCutSetID!=eventCutSet::kNoEvtSel && evtCutSetID!=eventCutSet::kINEL10 && evtCutSetID!=eventCutSet::kIGZ10 && evtCutSetID!=eventCutSet::kIGZ){\n    task->UseESDTriggerMask(triggerMask); \/\/ESD\n    \/\/task->SelectCollisionCandidates(triggerMask); \/\/AOD\n  }\n\n  if(isPP){\n    if(MultBins==1) task->UseMultiplicity(\"AliMultSelection_V0M\");\n    else if(MultBins==2) task->UseMultiplicity(\"AliMultSelection_RefMult08\");\n    else if(MultBins==3) task->UseMultiplicity(\"AliMultSelection_SPDTracklets08to15\");\n    else task->UseMultiplicity(\"QUALITY\");\n  }else task->UseCentrality(\"V0M\");\n\n  \/\/ set event mixing options\n  task->UseContinuousMix();\n  \/\/task->UseBinnedMix();\n  task->SetNMix(nmix);\n  task->SetMaxDiffVz(maxDiffVzMix);\n  task->SetMaxDiffMult(maxDiffMultMix);\n  ::Info(\"AddTaskLstar13TeVpp_II\", Form(\"Event mixing configuration: \\n events to mix = %i \\n max diff. vtxZ = cm %5.3f \\n max diff multi = %5.3f\", nmix, maxDiffVzMix, maxDiffMultMix));\n  \/\/task->SaveRsnTreeInFile(kTRUE);\n\n  mgr->AddTask(task);\n\n  \/\/ cut on primary vertex:\n  \/\/ - 2nd argument --> |Vz| range\n  \/\/ - 3rd argument --> minimum required number of contributors to vtx\n  \/\/ - 4th argument --> tells if TPC stand-alone vertexes must be accepted\n\n  AliRsnCutPrimaryVertex* cutVertex=0;\n  if(evtCutSetID!=eventCutSet::kTriggered && evtCutSetID!=eventCutSet::kNoEvtSel && evtCutSetID!=eventCutSet::kIGZ){\n    if(evtCutSetID==eventCutSet::kINEL10 || evtCutSetID==eventCutSet::kIGZ10){\n      cutVertex=new AliRsnCutPrimaryVertex(\"cutVertex\",vtxZcut,0,kFALSE);\n      cutVertex->SetCheckGeneratedVertexZ();\n\n    }else if(!MultBins || fabs(vtxZcut-10.)>1.e-10){\n      cutVertex=new AliRsnCutPrimaryVertex(\"cutVertex\",vtxZcut,0,kFALSE);\n      if(!MultBins){\n        cutVertex->SetCheckZResolutionSPD();\n        cutVertex->SetCheckDispersionSPD();\n        cutVertex->SetCheckZDifferenceSPDTrack();\n      }\n    }\n  }\n\n  AliRsnCutEventUtils* cutEventUtils=0;\n  if(evtCutSetID!=eventCutSet::kNoEvtSel && evtCutSetID!=eventCutSet::kINEL10){\n    cutEventUtils=new AliRsnCutEventUtils(\"cutEventUtils\",kTRUE,rejectPileUp);\n    if(evtCutSetID==eventCutSet::kIGZ10 || evtCutSetID==eventCutSet::kIGZ) cutEventUtils->SetCheckInelGt0MC();\n    else if(!MultBins){\n      cutEventUtils->SetCheckIncompleteDAQ();\n      cutEventUtils->SetCheckSPDClusterVsTrackletBG();\n    }else{\n      \/\/cutEventUtils->SetCheckInelGt0SPDtracklets();\n      cutEventUtils->SetRemovePileUppA2013(kFALSE);\n      if(evtCutSetID!=eventCutSet::kTriggered) cutEventUtils->SetCheckAcceptedMultSelection();\n    }\n  }\n\n  if(isPP && (!isMC) && cutVertex){\n    cutVertex->SetCheckPileUp(rejectPileUp);\/\/ set the check for pileup\n    ::Info(\"AddTaskLstar13TeVpp_II\", Form(\":::::::::::::::::: Pile-up rejection mode: %s\", (rejectPileUp)?\"ON\":\"OFF\"));\n  }\n\n  \/\/ define and fill cut set for event cut\n  AliRsnCutSet* eventCuts=0;\n  if(cutEventUtils || cutVertex){\n    eventCuts=new AliRsnCutSet(\"eventCuts\",AliRsnTarget::kEvent);\n\n    if(cutEventUtils && cutVertex){\n      eventCuts->AddCut(cutEventUtils);\n      eventCuts->AddCut(cutVertex);\n      eventCuts->SetCutScheme(Form(\"%s&%s\",cutEventUtils->GetName(),cutVertex->GetName()));\n    }else if(cutEventUtils && !cutVertex){\n      eventCuts->AddCut(cutEventUtils);\n      eventCuts->SetCutScheme(Form(\"%s\",cutEventUtils->GetName()));\n    }else if(!cutEventUtils && cutVertex){\n      eventCuts->AddCut(cutVertex);\n      eventCuts->SetCutScheme(Form(\"%s\",cutVertex->GetName()));\n    }\n\n    task->SetEventCuts(eventCuts);\n  }\n\n  \/\/ -- EVENT-ONLY COMPUTATIONS -------------------------------------------------------------------\n\n  \/\/vertex\n  Int_t vtxID=task->CreateValue(AliRsnMiniValue::kVz,kFALSE);\n  AliRsnMiniOutput* outVtx=task->CreateOutput(\"eventVtx\",\"HIST\",\"EVENT\");\n  outVtx->AddAxis(vtxID,240,-12.0,12.0);\n\n  \/\/multiplicity or centrality\n  Int_t multID=task->CreateValue(AliRsnMiniValue::kMult,kFALSE);\n  AliRsnMiniOutput* outMult=task->CreateOutput(\"eventMult\",\"HIST\",\"EVENT\");\n  if(isPP && !MultBins) outMult->AddAxis(multID,400,0.5,400.5);\n  else outMult->AddAxis(multID,110,0.,110.);\n\n  Double_t multbins[200];\n  int j,nmult=0;\n  for(j=0;j<10;j++){multbins[nmult]=0.0001*j; nmult++;}\n  for(j=1;j<10;j++){multbins[nmult]=0.001*j; nmult++;}\n  for(j=1;j<50;j++){multbins[nmult]=0.01*j; nmult++;}\n  for(j=5;j<10;j++){multbins[nmult]=0.1*j; nmult++;}\n  for(j=1;j<=100;j++){multbins[nmult]=j; nmult++;}\n  nmult--;\n  TH1F* hEventsVsMulti=new TH1F(\"hAEventsVsMulti\",\"\",nmult,multbins);\n  task->SetEventQAHist(\"EventsVsMulti\",hEventsVsMulti);\/\/custom binning for fHAEventsVsMulti\n\n  TH2F* hvz=new TH2F(\"hVzVsCent\",\"\",110,0.,110., 240,-12.0,12.0);\n  task->SetEventQAHist(\"vz\",hvz);\/\/plugs this histogram into the fHAEventVz data member\n\n  double ybins[500];\n  for(j=0;j<=401;j++) ybins[j]=j-0.5;\n\n  TH2F* hmc=new TH2F(\"MultiVsCent\",\"\", nmult,multbins, 401,ybins);\n  hmc->GetYaxis()->SetTitle(\"QUALITY\");\n  task->SetEventQAHist(\"multicent\",hmc);\/\/plugs this histogram into the fHAEventMultiCent data member\n\n  \/\/ -- PAIR CUTS (common to all resonances) ------------------------------------------------------\n\n  AliRsnCutMiniPair* cutY=new AliRsnCutMiniPair(\"cutRapidity\",AliRsnCutMiniPair::kRapidityRange);\n  cutY->SetRangeD(minYlab,maxYlab);\n\n  AliRsnCutSet* cutsPair=new AliRsnCutSet(\"pairCuts\",AliRsnTarget::kMother);\n  cutsPair->AddCut(cutY);\n  cutsPair->SetCutScheme(cutY->GetName());\n\n  task->SetCheckDecay(CheckDecay);\n\n  \/\/ -- CONFIG ANALYSIS --------------------------------------------------------------------------\n\n  gROOT->LoadMacro(\"$ALICE_PHYSICS\/PWGLF\/RESONANCES\/macros\/mini\/ConfigureLstar13TeVpp_II.C\");\n  if (!ConfigureLstar13TeVpp_II(task, isMC, isPP, \"\", cutsPair, aodFilterBit, customQualityCutsID, cutPrCandidate, cutKaCandidate, nsigmaPr, nsigmaKa,  enableMonitor, isMC&IsMcTrueOnly)) return 0x0;\n \n\n  \/\/ -- CONTAINERS --------------------------------------------------------------------------------\n\n  TString outputFileName = AliAnalysisManager::GetCommonFileName();\n  \/\/  outputFileName += \":Rsn\";\n   Printf(\"AddAnalysisTaskLstar13TeVpp - Set OutputFileName : \\n %s\\n\", outputFileName.Data() );\n \n  AliAnalysisDataContainer* output=mgr->CreateContainer(Form(\"RsnOut_%s\",outNameSuffix.Data()),TList::Class(),AliAnalysisManager::kOutputContainer, outputFileName);\n  mgr->ConnectInput(task, 0, mgr->GetCommonInputContainer());\n  mgr->ConnectOutput(task, 1, output);\n\n  return task;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"DDImage\/PixelIop.h\"\n#include \"DDImage\/Row.h\"\n#include \"DDImage\/Knobs.h\"\n#include \"DDImage\/NukeWrapper.h\"\n\nusing namespace DD::Image;\n\nstatic const char* const CLASS = \"WhiteBalanceIop\"\nstatic const char* const HELP =\n\"This node set's the whitebalance of the image, \"\n\"based on the users input.\";\n\nclass WhiteBalanceIop : public PixelIop\n{\n\t\n\tfloat value[3];\n\t\npublic:\n\t\n\tWhiteBalanceIop(Node* node) : PixelIop(node)\n\t{\n\t\tvalue[0] = value[1] = value[2] = 1.0f;\n\t}\n\t\n\tvoid _validate(bool);\n\tvoid in_channels(int, ChannelSet&) const;\n\tvoid pixel_engine(const Row&, int, int, int, ChannelMask, Row&);\n\tbool pass_transform() const { return true; }\n\tvirtual void knobs(Knob_Callback)\n\t\n\tstatic const Iop::Description d;\n\t\n\tconst char* Class() const { return CLASS; }\n\tconst char* node_help() const { return HELP; }\n\t\n};\n\nvoid WhiteBalanceIop::_validate(bool for_real)\n{\n\tcopy_info();\n\tfor (unsigned i = 0; i < 3; i++) {\n\t\tif (value[i] != 1.0f) {\n\t\t\tset_out_channels(Mask_ALL);\n\t\t\treturn;\n\t\t}\n\t}\n\tset_out_channels(Mask_None);\n}\n\nvoid WhiteBalanceIop::in_channels(int input, ChannelSet& mask) const\n{\n\tif ( !(mask.contains(Mask_RGB)))\n\t\tmask += (Mask_RGB);\n}\n\nvoid WhiteBalanceIop::pixel_engine(Row& in, int y, int x, int r, ChannelMask channels, Row& out)\n{\n\tforeach(z, channels) {\n\t\t\n\t\tif(colourIndex(z) >= 3) {\n\t\t\tout.copy(in, z, x, r)\n\t\t\tcontinue;\n\t\t}\n\t\telse {\n\t\t\n\t\t\tconst float c = value[z]\n\t\t\tfloat avgC = 0.299f * value[0] + 0.587f * value[1] + 0.114f * value[2];\n\t\t\n\t\t\tconst float inptr* = in[z] + x;\n\t\t\tconst float END* = inptr + (r - x);\n\t\t\tfloat* outptr = out.writable(z) + x;\n\t\t\n\t\t\twhile (inptr < END)\n\t\t\t\tc != 0.0f ? *outptr++ = *inptr++ * avgC \/ c : *outptr++ = *inptr++;\n\t\t}\n\t}\n}\n\nvoid WhiteBalanceIop::knobs(Knob_Callback f)\n{\n\tAColor_knob(f, value, \"white\")\n}\n\nstatic Iop* build(Node* node)\n{\n\treturn (new NukeWrapper(new WhiteBalanceIop(node)))->channels(Mask_RGB);\n}\n\nconst Iop::Description WhiteBalanceIop::d(\"Whitebalance\", \"Color\/Whitebalance\", build);\n<commit_msg>Compile ready<commit_after>#include \"DDImage\/PixelIop.h\"\n#include \"DDImage\/Row.h\"\n#include \"DDImage\/Knobs.h\"\n#include \"DDImage\/NukeWrapper.h\"\n\nusing namespace DD::Image;\n\n\/\/static const char* const CLASS = \"WhiteBalanceIop\";\nstatic const char* const HELP =\n\"This node set's the whitebalance of the image, \"\n\"based on the users input.\";\n\nclass WhiteBalanceIop : public PixelIop\n{\n\t\n\tfloat value[3];\n\t\npublic:\n\t\n\tWhiteBalanceIop(Node* node) : PixelIop(node)\n\t{\n\t\tvalue[0] = value[1] = value[2] = 1.0f;\n\t}\n\t\n\tvoid _validate(bool);\n\tvoid in_channels(int, ChannelSet&) const;\n\tvoid pixel_engine(const Row&, int, int, int, ChannelMask, Row&);\n\tbool pass_transform() const { return true; }\n\tvirtual void knobs(Knob_Callback);\n\t\n\tstatic const Iop::Description d;\n\t\n\tconst char* Class() const { return d.name; }\n\tconst char* node_help() const { return HELP; }\n\t\n};\n\nvoid WhiteBalanceIop::_validate(bool for_real)\n{\n\tcopy_info();\n\tfor (unsigned i = 0; i < 3; i++) {\n\t\tif (value[i] != 1.0f) {\n\t\t\tset_out_channels(Mask_All);\n\t\t\treturn;\n\t\t}\n\t}\n\tset_out_channels(Mask_None);\n\tPixelIop::_validate(for_real);\n}\n\nvoid WhiteBalanceIop::in_channels(int input, ChannelSet& mask) const\n{\n\tif ( !(mask.contains(Mask_RGB)))\n\t\tmask += (Mask_RGB);\n}\n\nvoid WhiteBalanceIop::pixel_engine(const Row& in, int y, int x, int r, ChannelMask channels, Row& out)\n{\n\tforeach(z, channels) {\n\t\t\n\t\tif(colourIndex(z) >= 3 || colourIndex(z) < 1) {\n\t\t\tout.copy(in, z, x, r);\n\t\t\tcontinue;\n\t\t}\n\t\telse {\n\t\t\n\t\t\tconst float c = value[z];\n\t\t\tfloat avgC = 0.299f * value[0] + 0.587f * value[1] + 0.114f * value[2];\n\t\t\n\t\t\tconst float* inptr = in[z] + x;\n\t\t\tconst float* END = inptr + (r - x);\n\t\t\tfloat* outptr = out.writable(z) + x;\n\t\t\n\t\t\twhile (inptr < END)\n\t\t\t\tc != 0.0f ? *outptr++ = *inptr++ * avgC \/ c : *outptr++ = *inptr++;\n\t\t}\n\t}\n}\n\nvoid WhiteBalanceIop::knobs(Knob_Callback f)\n{\n\tAColor_knob(f, value, \"white\");\n}\n\nstatic Iop* build(Node* node)\n{\n\treturn (new NukeWrapper(new WhiteBalanceIop(node)))->channels(Mask_RGB);\n}\n\nconst Iop::Description WhiteBalanceIop::d(\"Whitebalance\", \"Color\/Whitebalance\", build);\n<|endoftext|>"}
{"text":"<commit_before>\/*  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\nstatic inline void _server_init(memcached_server_st *self, 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->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->error_messages= NULL;\n  self->read_ptr= self->read_buffer;\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  self->state= MEMCACHED_SERVER_STATE_NEW;\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)\n  {\n    strncpy(self->hostname, hostname, NI_MAXHOST - 1);\n  }\n  else\n  {\n    self->hostname[0]= 0;\n  }\n}\n\nstatic memcached_server_st *_server_create(memcached_server_st *self, const memcached_st *memc)\n{\n  if (not self)\n  {\n   self= (memcached_server_st *)libmemcached_malloc(memc, sizeof(memcached_server_st));\n\n    if (not 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 *__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 (not self)\n    return NULL;\n\n  _server_init(self, const_cast<memcached_st *>(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 __server_free(memcached_server_st *self)\n{\n  memcached_quit_server(self, false);\n\n  if (self->address_info)\n  {\n    freeaddrinfo(self->address_info);\n  }\n\n  memcached_error_free(*self);\n\n  if (memcached_is_allocated(self))\n  {\n    libmemcached_free(self->root, self);\n  }\n  else\n  {\n    self->options.is_initialized= false;\n  }\n}\n\nvoid memcached_server_free(memcached_server_st *self)\n{\n  if (not self)\n    return;\n\n  if (memcached_server_list_count(self))\n  {\n    memcached_server_list_free(self);\n    return;\n  }\n\n  __server_free(self);\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= __server_create_with(source->root, destination,\n                                    source->hostname, source->port, source->weight,\n                                    source->type);\n  if (not destination)\n  {\n    if (source->error_messages)\n    {\n      destination->error_messages= memcached_error_copy(*source);\n    }\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  size_t errors= 0;\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      memcached_return_t ret= (*callback[y])(ptr, instance, context);\n\n      if (memcached_failed(ret))\n      {\n        errors++;\n        continue;\n      }\n    }\n  }\n\n  return errors ? MEMCACHED_SOME_ERRORS : 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 (memcached_failed((memcached_key_test(*ptr, (const char **)&key, &key_length, 1))))\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  memcached_error_free(*self);\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\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(const 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(const 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(const 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_type(const memcached_server_instance_st ptr)\n{\n  if (ptr)\n  {\n    switch (ptr->type)\n    {\n    case MEMCACHED_CONNECTION_TCP:\n      return \"TCP\";\n\n    case MEMCACHED_CONNECTION_UDP:\n      return \"UDP\";\n\n    case MEMCACHED_CONNECTION_UNIX_SOCKET:\n      return \"SOCKET\";\n\n    case MEMCACHED_CONNECTION_MAX:\n    case MEMCACHED_CONNECTION_UNKNOWN:\n      break;\n    }\n  }\n\n  return \"UNKNOWN\";\n}\n<commit_msg>Fix for 809390<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\nstatic inline void _server_init(memcached_server_st *self, 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->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->error_messages= NULL;\n  self->read_ptr= self->read_buffer;\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  self->state= MEMCACHED_SERVER_STATE_NEW;\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)\n  {\n    strncpy(self->hostname, hostname, NI_MAXHOST - 1);\n  }\n  else\n  {\n    self->hostname[0]= 0;\n  }\n}\n\nstatic memcached_server_st *_server_create(memcached_server_st *self, const memcached_st *memc)\n{\n  if (not self)\n  {\n   self= (memcached_server_st *)libmemcached_malloc(memc, sizeof(memcached_server_st));\n\n    if (not 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 *__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 (not self)\n    return NULL;\n\n  _server_init(self, const_cast<memcached_st *>(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 __server_free(memcached_server_st *self)\n{\n  memcached_quit_server(self, false);\n\n  if (self->address_info)\n  {\n    freeaddrinfo(self->address_info);\n    self->address_info= NULL;\n  }\n\n  memcached_error_free(*self);\n\n  if (memcached_is_allocated(self))\n  {\n    libmemcached_free(self->root, self);\n  }\n  else\n  {\n    self->options.is_initialized= false;\n  }\n}\n\nvoid memcached_server_free(memcached_server_st *self)\n{\n  if (not self)\n    return;\n\n  if (memcached_server_list_count(self))\n  {\n    memcached_server_list_free(self);\n    return;\n  }\n\n  __server_free(self);\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= __server_create_with(source->root, destination,\n                                    source->hostname, source->port, source->weight,\n                                    source->type);\n  if (not destination)\n  {\n    if (source->error_messages)\n    {\n      destination->error_messages= memcached_error_copy(*source);\n    }\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  size_t errors= 0;\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      memcached_return_t ret= (*callback[y])(ptr, instance, context);\n\n      if (memcached_failed(ret))\n      {\n        errors++;\n        continue;\n      }\n    }\n  }\n\n  return errors ? MEMCACHED_SOME_ERRORS : 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 (memcached_failed((memcached_key_test(*ptr, (const char **)&key, &key_length, 1))))\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  memcached_error_free(*self);\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\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(const 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(const 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(const 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_type(const memcached_server_instance_st ptr)\n{\n  if (ptr)\n  {\n    switch (ptr->type)\n    {\n    case MEMCACHED_CONNECTION_TCP:\n      return \"TCP\";\n\n    case MEMCACHED_CONNECTION_UDP:\n      return \"UDP\";\n\n    case MEMCACHED_CONNECTION_UNIX_SOCKET:\n      return \"SOCKET\";\n\n    case MEMCACHED_CONNECTION_MAX:\n    case MEMCACHED_CONNECTION_UNKNOWN:\n      break;\n    }\n  }\n\n  return \"UNKNOWN\";\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2015-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 \"MockDb.h\"\n#include \"Sample.h\"\n#include <sqlpp11\/sqlpp11.h>\n\nnamespace\n{\n  constexpr auto t = test::TabBar{};\n  constexpr auto f = test::TabFoo{};\n\n  template <typename T>\n  void print_type_on_error(std::true_type)\n  {\n  }\n\n  template <typename T>\n  void print_type_on_error(std::false_type)\n  {\n    T::_print_me_;\n  }\n\n  template <typename Assert, typename Expression>\n  void from_static_check(const Expression& expression)\n  {\n    using CheckResult = sqlpp::check_from_static_t<Expression>;\n    using ExpectedCheckResult = std::is_same<CheckResult, Assert>;\n    print_type_on_error<CheckResult>(ExpectedCheckResult{});\n    static_assert(ExpectedCheckResult::value, \"Unexpected check result\");\n\n    using ReturnType = decltype(select(t.alpha).from(expression));\n    using ExpectedReturnType =\n        sqlpp::logic::all_t<Assert::value xor std::is_same<ReturnType, sqlpp::bad_statement>::value>;\n    print_type_on_error<ReturnType>(ExpectedReturnType{});\n    static_assert(ExpectedReturnType::value, \"Unexpected return type\");\n  }\n\n  template <typename Assert, typename Expression>\n  void from_dynamic_check(const Expression& expression)\n  {\n    static auto db = MockDb{};\n    using CheckResult = sqlpp::check_from_dynamic_t<decltype(db), Expression>;\n    using ExpectedCheckResult = std::is_same<CheckResult, Assert>;\n    print_type_on_error<CheckResult>(ExpectedCheckResult{});\n    static_assert(ExpectedCheckResult::value, \"Unexpected check result\");\n\n    using ReturnType = decltype(dynamic_select(db, t.alpha).dynamic_from(expression));\n    using ExpectedReturnType =\n        sqlpp::logic::all_t<Assert::value xor std::is_same<ReturnType, sqlpp::bad_statement>::value>;\n    print_type_on_error<ReturnType>(ExpectedReturnType{});\n    static_assert(ExpectedReturnType::value, \"Unexpected return type\");\n  }\n\n  void static_from()\n  {\n    \/\/ OK\n    from_static_check<sqlpp::consistent_t>(t);\n    from_static_check<sqlpp::consistent_t>(t.cross_join(f));\n    from_static_check<sqlpp::consistent_t>(t.join(f).on(t.alpha > f.omega));\n\n    \/\/ Try a bunch of non-tables\n    from_static_check<sqlpp::assert_from_table_t>(7);\n    from_static_check<sqlpp::assert_from_table_t>(t.alpha);\n    from_static_check<sqlpp::assert_from_table_t>(t.beta);\n    from_static_check<sqlpp::assert_from_table_t>(t.gamma);\n    from_static_check<sqlpp::assert_from_table_t>(t.delta);\n\n    \/\/ Try cross joins (missing condition)\n    from_static_check<sqlpp::assert_from_not_pre_join_t>(t.join(f));\n  }\n\n  void dynamic_from()\n  {\n    \/\/ OK\n    from_dynamic_check<sqlpp::consistent_t>(t);\n    from_dynamic_check<sqlpp::consistent_t>(t.cross_join(f));\n    from_dynamic_check<sqlpp::consistent_t>(t.join(f).on(t.alpha > f.omega));\n\n    \/\/ Try a bunch of non-tables\n    from_dynamic_check<sqlpp::assert_from_table_t>(7);\n    from_dynamic_check<sqlpp::assert_from_table_t>(t.alpha);\n    from_dynamic_check<sqlpp::assert_from_table_t>(t.beta);\n    from_dynamic_check<sqlpp::assert_from_table_t>(t.gamma);\n    from_dynamic_check<sqlpp::assert_from_table_t>(t.delta);\n\n    \/\/ Try cross joins (missing condition)\n    from_dynamic_check<sqlpp::assert_from_not_pre_join_t>(t.join(f));\n  }\n\n  void dynamic_from()\n  {\n#warning : need to add tests for dynamic_from(xxx).add(yyy)\n  }\n}\n\nint main(int, char* [])\n{\n  static_from();\n  dynamic_from();\n}\n<commit_msg>Fixed function name<commit_after>\/*\n * Copyright (c) 2015-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 \"MockDb.h\"\n#include \"Sample.h\"\n#include <sqlpp11\/sqlpp11.h>\n\nnamespace\n{\n  constexpr auto t = test::TabBar{};\n  constexpr auto f = test::TabFoo{};\n\n  template <typename T>\n  void print_type_on_error(std::true_type)\n  {\n  }\n\n  template <typename T>\n  void print_type_on_error(std::false_type)\n  {\n    T::_print_me_;\n  }\n\n  template <typename Assert, typename Expression>\n  void from_static_check(const Expression& expression)\n  {\n    using CheckResult = sqlpp::check_from_static_t<Expression>;\n    using ExpectedCheckResult = std::is_same<CheckResult, Assert>;\n    print_type_on_error<CheckResult>(ExpectedCheckResult{});\n    static_assert(ExpectedCheckResult::value, \"Unexpected check result\");\n\n    using ReturnType = decltype(select(t.alpha).from(expression));\n    using ExpectedReturnType =\n        sqlpp::logic::all_t<Assert::value xor std::is_same<ReturnType, sqlpp::bad_statement>::value>;\n    print_type_on_error<ReturnType>(ExpectedReturnType{});\n    static_assert(ExpectedReturnType::value, \"Unexpected return type\");\n  }\n\n  template <typename Assert, typename Expression>\n  void from_dynamic_check(const Expression& expression)\n  {\n    static auto db = MockDb{};\n    using CheckResult = sqlpp::check_from_dynamic_t<decltype(db), Expression>;\n    using ExpectedCheckResult = std::is_same<CheckResult, Assert>;\n    print_type_on_error<CheckResult>(ExpectedCheckResult{});\n    static_assert(ExpectedCheckResult::value, \"Unexpected check result\");\n\n    using ReturnType = decltype(dynamic_select(db, t.alpha).dynamic_from(expression));\n    using ExpectedReturnType =\n        sqlpp::logic::all_t<Assert::value xor std::is_same<ReturnType, sqlpp::bad_statement>::value>;\n    print_type_on_error<ReturnType>(ExpectedReturnType{});\n    static_assert(ExpectedReturnType::value, \"Unexpected return type\");\n  }\n\n  void static_from()\n  {\n    \/\/ OK\n    from_static_check<sqlpp::consistent_t>(t);\n    from_static_check<sqlpp::consistent_t>(t.cross_join(f));\n    from_static_check<sqlpp::consistent_t>(t.join(f).on(t.alpha > f.omega));\n\n    \/\/ Try a bunch of non-tables\n    from_static_check<sqlpp::assert_from_table_t>(7);\n    from_static_check<sqlpp::assert_from_table_t>(t.alpha);\n    from_static_check<sqlpp::assert_from_table_t>(t.beta);\n    from_static_check<sqlpp::assert_from_table_t>(t.gamma);\n    from_static_check<sqlpp::assert_from_table_t>(t.delta);\n\n    \/\/ Try cross joins (missing condition)\n    from_static_check<sqlpp::assert_from_not_pre_join_t>(t.join(f));\n  }\n\n  void dynamic_from()\n  {\n    \/\/ OK\n    from_dynamic_check<sqlpp::consistent_t>(t);\n    from_dynamic_check<sqlpp::consistent_t>(t.cross_join(f));\n    from_dynamic_check<sqlpp::consistent_t>(t.join(f).on(t.alpha > f.omega));\n\n    \/\/ Try a bunch of non-tables\n    from_dynamic_check<sqlpp::assert_from_table_t>(7);\n    from_dynamic_check<sqlpp::assert_from_table_t>(t.alpha);\n    from_dynamic_check<sqlpp::assert_from_table_t>(t.beta);\n    from_dynamic_check<sqlpp::assert_from_table_t>(t.gamma);\n    from_dynamic_check<sqlpp::assert_from_table_t>(t.delta);\n\n    \/\/ Try cross joins (missing condition)\n    from_dynamic_check<sqlpp::assert_from_not_pre_join_t>(t.join(f));\n  }\n\n  void dynamic_from_add()\n  {\n#warning : need to add tests for dynamic_from(xxx).add(yyy)\n  }\n}\n\nint main(int, char* [])\n{\n  static_from();\n  dynamic_from();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\nCopyright (c) 2018 - 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\n#include \"hip_internal.hpp\"\n\nhipError_t hipDeviceGet(hipDevice_t *device, int deviceId) {\n  HIP_INIT_API(device, deviceId);\n\n  if (device != nullptr) {\n    *device = deviceId;\n  } else {\n    return hipErrorInvalidValue;\n  }\n\n  return hipSuccess;\n};\n\nhipError_t hipFuncSetCacheConfig (const void* func, hipFuncCache_t cacheConfig) {\n\n  HIP_INIT_API(cacheConfig);\n\n  \/\/ No way to set cache config yet.\n\n  return hipSuccess;\n}\n\nhipError_t hipDeviceTotalMem (size_t *bytes, hipDevice_t device) {\n\n  HIP_INIT_API(bytes, device);\n\n  if (device < 0 || static_cast<size_t>(device) >= g_devices.size()) {\n    return hipErrorInvalidDevice;\n  }\n\n  if (bytes == nullptr) {\n    return hipErrorInvalidValue;\n  }\n\n  auto* deviceHandle = g_devices[device]->devices()[0];\n  const auto& info = deviceHandle->info();\n\n  *bytes = info.globalMemSize_;\n\n  return hipSuccess;\n}\n\nhipError_t hipDeviceComputeCapability(int *major, int *minor, hipDevice_t device) {\n\n  HIP_INIT_API(major, minor, device);\n\n  if (device < 0 || static_cast<size_t>(device) >= g_devices.size()) {\n    return hipErrorInvalidDevice;\n  }\n\n  if (major == nullptr || minor == nullptr) {\n    return hipErrorInvalidValue;\n  }\n\n  auto* deviceHandle = g_devices[device]->devices()[0];\n  const auto& info = deviceHandle->info();\n  *major = info.gfxipVersion_ \/ 100;\n  *minor = info.gfxipVersion_ % 100;\n\n  return hipSuccess;\n}\n\nhipError_t hipDeviceGetCount(int* count) {\n  HIP_INIT_API(count);\n\n  return ihipDeviceGetCount(count);\n}\n\nhipError_t ihipDeviceGetCount(int* count) {\n  if (count == nullptr) {\n    return hipErrorInvalidValue;\n  }\n\n  \/\/ Get all available devices\n  *count = g_devices.size();\n\n  return hipSuccess;\n}\n\nhipError_t hipDeviceGetName(char *name, int len, hipDevice_t device) {\n\n  HIP_INIT_API((void*)name, len, device);\n\n  if (device < 0 || static_cast<size_t>(device) >= g_devices.size()) {\n    return hipErrorInvalidDevice;\n  }\n\n  if (name == nullptr) {\n    return hipErrorInvalidValue;\n  }\n\n  auto* deviceHandle = g_devices[device]->devices()[0];\n  const auto& info = deviceHandle->info();\n\n  len = ((cl_uint)len < ::strlen(info.boardName_)) ? len : 128;\n  ::strncpy(name, info.boardName_, len);\n\n  return hipSuccess;\n}\n\nhipError_t hipGetDeviceProperties ( hipDeviceProp_t* props, hipDevice_t device ) {\n  HIP_INIT_API(props, device);\n\n  if (props == nullptr) {\n    return hipErrorInvalidValue;\n  }\n\n  if (unsigned(device) >= g_devices.size()) {\n    return hipErrorInvalidDevice;\n  }\n  auto* deviceHandle = g_devices[device]->devices()[0];\n\n  hipDeviceProp_t deviceProps = {0};\n\n  const auto& info = deviceHandle->info();\n  ::strncpy(deviceProps.name, info.boardName_, 128);\n  deviceProps.totalGlobalMem = info.globalMemSize_;\n  deviceProps.sharedMemPerBlock = info.localMemSizePerCU_;\n  deviceProps.regsPerBlock = info.availableSGPRs_;\n  deviceProps.warpSize = info.wavefrontWidth_;\n  deviceProps.maxThreadsPerBlock = info.maxWorkGroupSize_;\n  deviceProps.maxThreadsDim[0] = info.maxWorkItemSizes_[0];\n  deviceProps.maxThreadsDim[1] = info.maxWorkItemSizes_[1];\n  deviceProps.maxThreadsDim[2] = info.maxWorkItemSizes_[2];\n  deviceProps.maxGridSize[0] = UINT32_MAX;\n  deviceProps.maxGridSize[1] = UINT32_MAX;\n  deviceProps.maxGridSize[2] = UINT32_MAX;\n  deviceProps.clockRate = info.maxEngineClockFrequency_;\n  deviceProps.memoryClockRate = info.maxMemoryClockFrequency_;\n  deviceProps.memoryBusWidth = info.globalMemChannels_ * 32;\n  deviceProps.totalConstMem = info.maxConstantBufferSize_;\n  deviceProps.major = info.gfxipVersion_ \/ 100;\n  deviceProps.minor = info.gfxipVersion_ % 100;\n  deviceProps.multiProcessorCount = info.maxComputeUnits_;\n  deviceProps.l2CacheSize = info.l2CacheSize_;\n  deviceProps.maxThreadsPerMultiProcessor = info.simdPerCU_;\n  deviceProps.computeMode = 0;\n  deviceProps.clockInstructionRate = info.timeStampFrequency_;\n  deviceProps.arch.hasGlobalInt32Atomics       = 1;\n  deviceProps.arch.hasGlobalFloatAtomicExch    = 1;\n  deviceProps.arch.hasSharedInt32Atomics       = 1;\n  deviceProps.arch.hasSharedFloatAtomicExch    = 1;\n  deviceProps.arch.hasFloatAtomicAdd           = 0;\n  deviceProps.arch.hasGlobalInt64Atomics       = 1;\n  deviceProps.arch.hasSharedInt64Atomics       = 1;\n  deviceProps.arch.hasDoubles                  = 1;\n  deviceProps.arch.hasWarpVote                 = 0;\n  deviceProps.arch.hasWarpBallot               = 0;\n  deviceProps.arch.hasWarpShuffle              = 0;\n  deviceProps.arch.hasFunnelShift              = 0;\n  deviceProps.arch.hasThreadFenceSystem        = 1;\n  deviceProps.arch.hasSyncThreadsExt           = 0;\n  deviceProps.arch.hasSurfaceFuncs             = 0;\n  deviceProps.arch.has3dGrid                   = 1;\n  deviceProps.arch.hasDynamicParallelism       = 0;\n  deviceProps.concurrentKernels = 1;\n  deviceProps.pciDomainID = info.deviceTopology_.pcie.function;\n  deviceProps.pciBusID = info.deviceTopology_.pcie.bus;\n  deviceProps.pciDeviceID = info.deviceTopology_.pcie.device;\n  deviceProps.maxSharedMemoryPerMultiProcessor = info.localMemSizePerCU_;\n  \/\/deviceProps.isMultiGpuBoard = info.;\n  deviceProps.canMapHostMemory = 1;\n  deviceProps.gcnArch = info.gfxipVersion_;\n\n  *props = deviceProps;\n  return hipSuccess;\n}\n\nhipError_t hipHccGetAccelerator(int deviceId, hc::accelerator* acc) {\n  HIP_INIT_API(deviceId, acc);\n\n  assert(0 && \"Unimplemented\");\n\n  return hipErrorUnknown;\n}\n\nhipError_t hipHccGetAcceleratorView(hipStream_t stream, hc::accelerator_view** av) {\n  HIP_INIT_API(stream, av);\n\n  assert(0 && \"Unimplemented\");\n\n  return hipErrorUnknown;\n}\n<commit_msg>P4 to Git Change 1592223 by cpaquot@cpaquot-ocl-lc-lnx on 2018\/08\/10 13:50:47<commit_after>\/*\nCopyright (c) 2018 - 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\n#include \"hip_internal.hpp\"\n\nhipError_t hipDeviceGet(hipDevice_t *device, int deviceId) {\n  HIP_INIT_API(device, deviceId);\n\n  if (device != nullptr) {\n    *device = deviceId;\n  } else {\n    return hipErrorInvalidValue;\n  }\n\n  return hipSuccess;\n};\n\nhipError_t hipFuncSetCacheConfig (const void* func, hipFuncCache_t cacheConfig) {\n\n  HIP_INIT_API(cacheConfig);\n\n  \/\/ No way to set cache config yet.\n\n  return hipSuccess;\n}\n\nhipError_t hipDeviceTotalMem (size_t *bytes, hipDevice_t device) {\n\n  HIP_INIT_API(bytes, device);\n\n  if (device < 0 || static_cast<size_t>(device) >= g_devices.size()) {\n    return hipErrorInvalidDevice;\n  }\n\n  if (bytes == nullptr) {\n    return hipErrorInvalidValue;\n  }\n\n  auto* deviceHandle = g_devices[device]->devices()[0];\n  const auto& info = deviceHandle->info();\n\n  *bytes = info.globalMemSize_;\n\n  return hipSuccess;\n}\n\nhipError_t hipDeviceComputeCapability(int *major, int *minor, hipDevice_t device) {\n\n  HIP_INIT_API(major, minor, device);\n\n  if (device < 0 || static_cast<size_t>(device) >= g_devices.size()) {\n    return hipErrorInvalidDevice;\n  }\n\n  if (major == nullptr || minor == nullptr) {\n    return hipErrorInvalidValue;\n  }\n\n  auto* deviceHandle = g_devices[device]->devices()[0];\n  const auto& info = deviceHandle->info();\n  *major = info.gfxipVersion_ \/ 100;\n  *minor = info.gfxipVersion_ % 100;\n\n  return hipSuccess;\n}\n\nhipError_t hipDeviceGetCount(int* count) {\n  HIP_INIT_API(count);\n\n  return ihipDeviceGetCount(count);\n}\n\nhipError_t ihipDeviceGetCount(int* count) {\n  if (count == nullptr) {\n    return hipErrorInvalidValue;\n  }\n\n  \/\/ Get all available devices\n  *count = g_devices.size();\n\n  return hipSuccess;\n}\n\nhipError_t hipDeviceGetName(char *name, int len, hipDevice_t device) {\n\n  HIP_INIT_API((void*)name, len, device);\n\n  if (device < 0 || static_cast<size_t>(device) >= g_devices.size()) {\n    return hipErrorInvalidDevice;\n  }\n\n  if (name == nullptr) {\n    return hipErrorInvalidValue;\n  }\n\n  auto* deviceHandle = g_devices[device]->devices()[0];\n  const auto& info = deviceHandle->info();\n\n  len = ((cl_uint)len < ::strlen(info.boardName_)) ? len : 128;\n  ::strncpy(name, info.boardName_, len);\n\n  return hipSuccess;\n}\n\nhipError_t hipGetDeviceProperties ( hipDeviceProp_t* props, hipDevice_t device ) {\n  HIP_INIT_API(props, device);\n\n  if (props == nullptr) {\n    return hipErrorInvalidValue;\n  }\n\n  if (unsigned(device) >= g_devices.size()) {\n    return hipErrorInvalidDevice;\n  }\n  auto* deviceHandle = g_devices[device]->devices()[0];\n\n  hipDeviceProp_t deviceProps = {0};\n\n  const auto& info = deviceHandle->info();\n  ::strncpy(deviceProps.name, info.boardName_, 128);\n  deviceProps.totalGlobalMem = info.globalMemSize_;\n  deviceProps.sharedMemPerBlock = info.localMemSizePerCU_;\n  deviceProps.regsPerBlock = info.availableSGPRs_;\n  deviceProps.warpSize = info.wavefrontWidth_;\n  deviceProps.maxThreadsPerBlock = info.maxWorkGroupSize_;\n  deviceProps.maxThreadsDim[0] = info.maxWorkItemSizes_[0];\n  deviceProps.maxThreadsDim[1] = info.maxWorkItemSizes_[1];\n  deviceProps.maxThreadsDim[2] = info.maxWorkItemSizes_[2];\n  deviceProps.maxGridSize[0] = UINT32_MAX;\n  deviceProps.maxGridSize[1] = UINT32_MAX;\n  deviceProps.maxGridSize[2] = UINT32_MAX;\n  deviceProps.clockRate = info.maxEngineClockFrequency_ * 1000;\n  deviceProps.memoryClockRate = info.maxMemoryClockFrequency_;\n  deviceProps.memoryBusWidth = info.globalMemChannels_ * 32;\n  deviceProps.totalConstMem = info.maxConstantBufferSize_;\n  deviceProps.major = info.gfxipVersion_ \/ 100;\n  deviceProps.minor = info.gfxipVersion_ % 100;\n  deviceProps.multiProcessorCount = info.maxComputeUnits_;\n  deviceProps.l2CacheSize = info.l2CacheSize_;\n  deviceProps.maxThreadsPerMultiProcessor = info.simdPerCU_;\n  deviceProps.computeMode = 0;\n  deviceProps.clockInstructionRate = info.timeStampFrequency_;\n  deviceProps.arch.hasGlobalInt32Atomics       = 1;\n  deviceProps.arch.hasGlobalFloatAtomicExch    = 1;\n  deviceProps.arch.hasSharedInt32Atomics       = 1;\n  deviceProps.arch.hasSharedFloatAtomicExch    = 1;\n  deviceProps.arch.hasFloatAtomicAdd           = 0;\n  deviceProps.arch.hasGlobalInt64Atomics       = 1;\n  deviceProps.arch.hasSharedInt64Atomics       = 1;\n  deviceProps.arch.hasDoubles                  = 1;\n  deviceProps.arch.hasWarpVote                 = 0;\n  deviceProps.arch.hasWarpBallot               = 0;\n  deviceProps.arch.hasWarpShuffle              = 0;\n  deviceProps.arch.hasFunnelShift              = 0;\n  deviceProps.arch.hasThreadFenceSystem        = 1;\n  deviceProps.arch.hasSyncThreadsExt           = 0;\n  deviceProps.arch.hasSurfaceFuncs             = 0;\n  deviceProps.arch.has3dGrid                   = 1;\n  deviceProps.arch.hasDynamicParallelism       = 0;\n  deviceProps.concurrentKernels = 1;\n  deviceProps.pciDomainID = info.deviceTopology_.pcie.function;\n  deviceProps.pciBusID = info.deviceTopology_.pcie.bus;\n  deviceProps.pciDeviceID = info.deviceTopology_.pcie.device;\n  deviceProps.maxSharedMemoryPerMultiProcessor = info.localMemSizePerCU_;\n  \/\/deviceProps.isMultiGpuBoard = info.;\n  deviceProps.canMapHostMemory = 1;\n  deviceProps.gcnArch = info.gfxipVersion_;\n\n  *props = deviceProps;\n  return hipSuccess;\n}\n\nhipError_t hipHccGetAccelerator(int deviceId, hc::accelerator* acc) {\n  HIP_INIT_API(deviceId, acc);\n\n  assert(0 && \"Unimplemented\");\n\n  return hipErrorUnknown;\n}\n\nhipError_t hipHccGetAcceleratorView(hipStream_t stream, hc::accelerator_view** av) {\n  HIP_INIT_API(stream, av);\n\n  assert(0 && \"Unimplemented\");\n\n  return hipErrorUnknown;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"HeatPrecursorSource.h\"\n\nregisterMooseObject(\"MoltresApp\", HeatPrecursorSource);\n\ntemplate <>\nInputParameters\nvalidParams<HeatPrecursorSource>()\n{\n  InputParameters params = validParams<Kernel>();\n  params += validParams<ScalarTransportBase>;\n  params.addRequiredParam<unsigned int>(\"num_groups\", \"The total number of energy groups\");\n  params.addRequiredParam<unsigned int>(\"decay_heat_group_number\",\n                                        \"What decay heat group this kernel is acting on.\");\n  params.addRequiredCoupledVar(\"group_fluxes\", \"All the variables that hold the group fluxes. \"\n                                               \"These MUST be listed by decreasing \"\n                                               \"energy\/increasing group number.\");\n  params.addCoupledVar(\n      \"temperature\", 800, \"The temperature used to interpolate material properties.\");\n  params.addRequiredParam<RealVectorValue>(\"decay_heat_fractions\", \"Decay Heat Fractions\");\n  params.addRequiredParam<RealVectorValue>(\"decay_heat_constants\", \"Decay Heat Constants\");\n  return params;\n}\n\nHeatPrecursorSource::HeatPrecursorSource(const InputParameters & parameters)\n  : Kernel(parameters),\n    ScalarTransportBase(parameters),\n    _fisse(getMaterialProperty<std::vector<Real>>(\"fisse\")),\n    _d_fisse_d_temp(getMaterialProperty<std::vector<Real>>(\"d_fisse_d_temp\")),\n    _fissxs(getMaterialProperty<std::vector<Real>>(\"fissxs\")),\n    _d_fissxs_d_temp(getMaterialProperty<std::vector<Real>>(\"d_fissxs_d_temp\")),\n    _num_groups(getParam<unsigned int>(\"num_groups\")),\n    _heat_group(getParam<unsigned int>(\"decay_heat_group_number\") - 1),\n    _decay_heat_frac(getParam<RealVectorValue>(\"decay_heat_fractions\")),\n    _decay_heat_const(getParam<RealVectorValue>(\"decay_heat_constants\")),\n    _temp(coupledValue(\"temperature\")),\n    _temp_id(coupled(\"temperature\"))\n{\n  _group_fluxes.resize(_num_groups);\n  _flux_ids.resize(_num_groups);\n  for (unsigned int i = 0; i < _group_fluxes.size(); ++i)\n  {\n    _group_fluxes[i] = &coupledValue(\"group_fluxes\", i);\n    _flux_ids[i] = coupled(\"group_fluxes\", i);\n  }\n}\n\nReal\nHeatPrecursorSource::computeQpResidual()\n{\n  Real r = 0;\n  for (unsigned int i = 0; i < _num_groups; ++i)\n  {\n    r += -_test[_i][_qp] * _decay_heat_frac(_heat_group) * _decay_heat_const(_heat_group) *\n         _fisse[_qp][i] * _fissxs[_qp][i] * \n         computeConcentration((*_group_fluxes[i]), _qp);\n  }\n\n  return r;\n}\n\nReal\nHeatPrecursorSource::computeQpJacobian()\n{\n  return 0;\n}\n\nReal\nHeatPrecursorSource::computeQpOffDiagJacobian(unsigned int jvar)\n{\n  Real jac = 0;\n  for (unsigned int i = 0; i < _num_groups; ++i)\n    if (jvar == _flux_ids[i])\n    {\n      jac = -_test[_i][_qp] * _decay_heat_frac(_heat_group) * _decay_heat_const(_heat_group) *\n            _fisse[_qp][i] * _fissxs[_qp][i] * \n            computeConcentrationDerivative((*_group_fluxes[i]), _phi, _j, _qp);\n      return jac;\n    }\n\n  if (jvar == _temp_id)\n  {\n    for (unsigned int i = 0; i < _num_groups; ++i)\n      jac += -_test[_i][_qp] * _decay_heat_frac(_heat_group) * _decay_heat_const(_heat_group) *\n             (_fisse[_qp][i] * _d_fissxs_d_temp[_qp][i] * _phi[_j][_qp] *\n                    computeConcentration((*_group_fluxes[i]), _qp) +\n              _d_fisse_d_temp[_qp][i] * _fissxs[_qp][i] * _phi[_j][_qp] *\n                    computeConcentration((*_group_fluxes[i]), _qp));\n    return jac;\n  }\n\n  return 0;\n}<commit_msg>Fix even more typos<commit_after>#include \"HeatPrecursorSource.h\"\n\nregisterMooseObject(\"MoltresApp\", HeatPrecursorSource);\n\ntemplate <>\nInputParameters\nvalidParams<HeatPrecursorSource>()\n{\n  InputParameters params = validParams<Kernel>();\n  params += validParams<ScalarTransportBase>();\n  params.addRequiredParam<unsigned int>(\"num_groups\", \"The total number of energy groups\");\n  params.addRequiredParam<unsigned int>(\"decay_heat_group_number\",\n                                        \"What decay heat group this kernel is acting on.\");\n  params.addRequiredCoupledVar(\"group_fluxes\", \"All the variables that hold the group fluxes. \"\n                                               \"These MUST be listed by decreasing \"\n                                               \"energy\/increasing group number.\");\n  params.addCoupledVar(\n      \"temperature\", 800, \"The temperature used to interpolate material properties.\");\n  params.addRequiredParam<RealVectorValue>(\"decay_heat_fractions\", \"Decay Heat Fractions\");\n  params.addRequiredParam<RealVectorValue>(\"decay_heat_constants\", \"Decay Heat Constants\");\n  return params;\n}\n\nHeatPrecursorSource::HeatPrecursorSource(const InputParameters & parameters)\n  : Kernel(parameters),\n    ScalarTransportBase(parameters),\n    _fisse(getMaterialProperty<std::vector<Real>>(\"fisse\")),\n    _d_fisse_d_temp(getMaterialProperty<std::vector<Real>>(\"d_fisse_d_temp\")),\n    _fissxs(getMaterialProperty<std::vector<Real>>(\"fissxs\")),\n    _d_fissxs_d_temp(getMaterialProperty<std::vector<Real>>(\"d_fissxs_d_temp\")),\n    _num_groups(getParam<unsigned int>(\"num_groups\")),\n    _heat_group(getParam<unsigned int>(\"decay_heat_group_number\") - 1),\n    _decay_heat_frac(getParam<RealVectorValue>(\"decay_heat_fractions\")),\n    _decay_heat_const(getParam<RealVectorValue>(\"decay_heat_constants\")),\n    _temp(coupledValue(\"temperature\")),\n    _temp_id(coupled(\"temperature\"))\n{\n  _group_fluxes.resize(_num_groups);\n  _flux_ids.resize(_num_groups);\n  for (unsigned int i = 0; i < _group_fluxes.size(); ++i)\n  {\n    _group_fluxes[i] = &coupledValue(\"group_fluxes\", i);\n    _flux_ids[i] = coupled(\"group_fluxes\", i);\n  }\n}\n\nReal\nHeatPrecursorSource::computeQpResidual()\n{\n  Real r = 0;\n  for (unsigned int i = 0; i < _num_groups; ++i)\n  {\n    r += -_test[_i][_qp] * _decay_heat_frac(_heat_group) * _decay_heat_const(_heat_group) *\n         _fisse[_qp][i] * _fissxs[_qp][i] * \n         computeConcentration((*_group_fluxes[i]), _qp);\n  }\n\n  return r;\n}\n\nReal\nHeatPrecursorSource::computeQpJacobian()\n{\n  return 0;\n}\n\nReal\nHeatPrecursorSource::computeQpOffDiagJacobian(unsigned int jvar)\n{\n  Real jac = 0;\n  for (unsigned int i = 0; i < _num_groups; ++i)\n    if (jvar == _flux_ids[i])\n    {\n      jac = -_test[_i][_qp] * _decay_heat_frac(_heat_group) * _decay_heat_const(_heat_group) *\n            _fisse[_qp][i] * _fissxs[_qp][i] * \n            computeConcentrationDerivative((*_group_fluxes[i]), _phi, _j, _qp);\n      return jac;\n    }\n\n  if (jvar == _temp_id)\n  {\n    for (unsigned int i = 0; i < _num_groups; ++i)\n      jac += -_test[_i][_qp] * _decay_heat_frac(_heat_group) * _decay_heat_const(_heat_group) *\n             (_fisse[_qp][i] * _d_fissxs_d_temp[_qp][i] * _phi[_j][_qp] *\n                    computeConcentration((*_group_fluxes[i]), _qp) +\n              _d_fisse_d_temp[_qp][i] * _fissxs[_qp][i] * _phi[_j][_qp] *\n                    computeConcentration((*_group_fluxes[i]), _qp));\n    return jac;\n  }\n\n  return 0;\n}<|endoftext|>"}
{"text":"<commit_before><commit_msg>Move SystemInfo tests from cppassist<commit_after><|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 * BP5Engine.cpp\n *\n *\/\n\n#include \"BP5Engine.h\"\n\n#include \"adios2\/common\/ADIOSMacros.h\"\n#include \"adios2\/common\/ADIOSTypes.h\" \/\/PathSeparator\n#include \"adios2\/core\/IO.h\"\n#include \"adios2\/helper\/adiosFunctions.h\" \/\/CreateDirectory, StringToTimeUnit,\n\n#include <ctime>\n#include <iostream>\n\nnamespace adios2\n{\nnamespace core\n{\nnamespace engine\n{\n\nstd::vector<std::string>\nBP5Engine::GetBPMetadataFileNames(const std::vector<std::string> &names) const\n    noexcept\n{\n    std::vector<std::string> metadataFileNames;\n    metadataFileNames.reserve(names.size());\n    for (const auto &name : names)\n    {\n        metadataFileNames.push_back(GetBPMetadataFileName(name));\n    }\n    return metadataFileNames;\n}\n\nstd::vector<std::string> BP5Engine::GetBPMetaMetadataFileNames(\n    const std::vector<std::string> &names) const noexcept\n{\n    std::vector<std::string> metaMetadataFileNames;\n    metaMetadataFileNames.reserve(names.size());\n    for (const auto &name : names)\n    {\n        metaMetadataFileNames.push_back(GetBPMetaMetadataFileName(name));\n    }\n    return metaMetadataFileNames;\n}\n\nstd::string BP5Engine::GetBPMetadataFileName(const std::string &name) const\n    noexcept\n{\n    const std::string bpName = helper::RemoveTrailingSlash(name);\n    const size_t index = 0; \/\/ global metadata file is generated by rank 0\n    \/* the name of the metadata file is \"md.0\" *\/\n    const std::string bpMetaDataRankName(bpName + PathSeparator + \"md.\" +\n                                         std::to_string(index));\n    return bpMetaDataRankName;\n}\n\nstd::string BP5Engine::GetBPMetaMetadataFileName(const std::string &name) const\n    noexcept\n{\n    const std::string bpName = helper::RemoveTrailingSlash(name);\n    const size_t index = 0; \/\/ global metadata file is generated by rank 0\n    \/* the name of the metadata file is \"md.0\" *\/\n    const std::string bpMetaMetaDataRankName(bpName + PathSeparator + \"mmd.\" +\n                                             std::to_string(index));\n    return bpMetaMetaDataRankName;\n}\n\nstd::vector<std::string> BP5Engine::GetBPMetadataIndexFileNames(\n    const std::vector<std::string> &names) const noexcept\n{\n    std::vector<std::string> metadataIndexFileNames;\n    metadataIndexFileNames.reserve(names.size());\n    for (const auto &name : names)\n    {\n        metadataIndexFileNames.push_back(GetBPMetadataIndexFileName(name));\n    }\n    return metadataIndexFileNames;\n}\n\nstd::string BP5Engine::GetBPMetadataIndexFileName(const std::string &name) const\n    noexcept\n{\n    const std::string bpName = helper::RemoveTrailingSlash(name);\n    \/* the name of the metadata index file is \"md.idx\" *\/\n    const std::string bpMetaDataIndexRankName(bpName + PathSeparator +\n                                              \"md.idx\");\n    return bpMetaDataIndexRankName;\n}\n\nstd::vector<std::string>\nBP5Engine::GetBPVersionFileNames(const std::vector<std::string> &names) const\n    noexcept\n{\n    std::vector<std::string> versionFileNames;\n    versionFileNames.reserve(names.size());\n    for (const auto &name : names)\n    {\n        versionFileNames.push_back(GetBPVersionFileName(name));\n    }\n    return versionFileNames;\n}\n\nstd::string BP5Engine::GetBPVersionFileName(const std::string &name) const\n    noexcept\n{\n    const std::string bpName = helper::RemoveTrailingSlash(name);\n    \/* the name of the version file is \".bpversion\" *\/\n    const std::string bpVersionFileName(bpName + PathSeparator + \".bpversion\");\n    return bpVersionFileName;\n}\n\nstd::string BP5Engine::GetBPSubStreamName(const std::string &name,\n                                          const size_t id,\n                                          const bool hasSubFiles,\n                                          const bool isReader) const noexcept\n{\n    if (!hasSubFiles)\n    {\n        return name;\n    }\n\n    const std::string bpName = helper::RemoveTrailingSlash(name);\n    \/* the name of a data file starts with \"data.\" *\/\n    const std::string bpRankName(bpName + PathSeparator + \"data.\" +\n                                 std::to_string(id));\n    return bpRankName;\n}\n\nstd::vector<std::string>\nBP5Engine::GetBPSubStreamNames(const std::vector<std::string> &names,\n                               size_t subFileIndex) const noexcept\n{\n    std::vector<std::string> bpNames;\n    bpNames.reserve(names.size());\n    for (const auto &name : names)\n    {\n        bpNames.push_back(GetBPSubStreamName(name, subFileIndex));\n    }\n    return bpNames;\n}\n\nvoid BP5Engine::ParseParams(IO &io, struct BP5Params &Params)\n{\n    auto lf_SetBoolParameter = [&](const std::string key, bool &parameter,\n                                   bool def) {\n        auto itKey = io.m_Parameters.find(key);\n        parameter = def;\n        if (itKey != io.m_Parameters.end())\n        {\n            std::string value = itKey->second;\n            std::transform(value.begin(), value.end(), value.begin(),\n                           ::tolower);\n            if (value == \"yes\" || value == \"true\" || value == \"on\")\n            {\n                parameter = true;\n            }\n            else if (value == \"no\" || value == \"false\" || value == \"off\")\n            {\n                parameter = false;\n            }\n            else\n            {\n                throw std::invalid_argument(\n                    \"ERROR: Unknown BP5 Boolean parameter \\\"\" + value + \"\\\"\");\n            }\n        }\n    };\n\n    auto lf_SetFloatParameter = [&](const std::string key, float &parameter,\n                                    float def) {\n        auto itKey = io.m_Parameters.find(key);\n        parameter = def;\n        if (itKey != io.m_Parameters.end())\n        {\n            std::string value = itKey->second;\n            parameter =\n                helper::StringTo<float>(value, \" in Parameter key=\" + key);\n        }\n    };\n\n    auto lf_SetSizeBytesParameter = [&](const std::string key,\n                                        size_t &parameter, size_t def) {\n        auto itKey = io.m_Parameters.find(key);\n        parameter = def;\n        if (itKey != io.m_Parameters.end())\n        {\n            std::string value = itKey->second;\n            parameter = helper::StringToByteUnits(\n                value, \"for Parameter key=\" + key + \"in call to Open\");\n            parameter =\n                helper::StringTo<size_t>(value, \" in Parameter key=\" + key);\n        }\n    };\n\n    auto lf_SetIntParameter = [&](const std::string key, int &parameter,\n                                  int def) {\n        auto itKey = io.m_Parameters.find(key);\n        parameter = def;\n        if (itKey != io.m_Parameters.end())\n        {\n            parameter = std::stoi(itKey->second);\n            return true;\n        }\n        return false;\n    };\n\n    auto lf_SetUIntParameter = [&](const std::string key,\n                                   unsigned int &parameter, unsigned int def) {\n        auto itKey = io.m_Parameters.find(key);\n        parameter = def;\n        if (itKey != io.m_Parameters.end())\n        {\n            unsigned long result = std::stoul(itKey->second);\n            if (result > std::numeric_limits<unsigned>::max())\n            {\n                result = std::numeric_limits<unsigned>::max();\n            }\n            parameter = static_cast<unsigned int>(result);\n            return true;\n        }\n        return false;\n    };\n\n    auto lf_SetStringParameter = [&](const std::string key,\n                                     std::string &parameter, const char *def) {\n        auto itKey = io.m_Parameters.find(key);\n        if (itKey != io.m_Parameters.end())\n        {\n            parameter = itKey->second;\n            return true;\n        }\n        return false;\n    };\n\n    auto lf_SetBufferVTypeParameter = [&](const std::string key, int &parameter,\n                                          int def) {\n        auto itKey = io.m_Parameters.find(key);\n        parameter = def;\n        if (itKey != io.m_Parameters.end())\n        {\n            std::string value = itKey->second;\n            std::transform(value.begin(), value.end(), value.begin(),\n                           ::tolower);\n            if (value == \"malloc\")\n            {\n                parameter = (int)BufferVType::MallocVType;\n            }\n            else if (value == \"chunk\")\n            {\n                parameter = (int)BufferVType::ChunkVType;\n            }\n            else\n            {\n                throw std::invalid_argument(\n                    \"ERROR: Unknown BP5 BufferVType parameter \\\"\" + value +\n                    \"\\\" (must be \\\"malloc\\\" or \\\"chunk\\\"\");\n            }\n        }\n    };\n\n    auto lf_SetAggregationTypeParameter = [&](const std::string key,\n                                              int &parameter, int def) {\n        auto itKey = io.m_Parameters.find(key);\n        parameter = def;\n        if (itKey != io.m_Parameters.end())\n        {\n            std::string value = itKey->second;\n            std::transform(value.begin(), value.end(), value.begin(),\n                           ::tolower);\n            if (value == \"everyonewrites\" || value == \"auto\")\n            {\n                parameter = (int)AggregationType::EveryoneWrites;\n            }\n            else if (value == \"everyonewritesserial\")\n            {\n                parameter = (int)AggregationType::EveryoneWritesSerial;\n            }\n            else if (value == \"twolevelshm\")\n            {\n                parameter = (int)AggregationType::TwoLevelShm;\n            }\n            else\n            {\n                throw std::invalid_argument(\n                    \"ERROR: Unknown BP5 AggregationType parameter \\\"\" + value +\n                    \"\\\" (must be \\\"auto\\\", \\\"everyonewrites\\\" or \"\n                    \"\\\"twolevelshm\\\"\");\n            }\n        }\n    };\n\n#define get_params(Param, Type, Typedecl, Default)                             \\\n    lf_Set##Type##Parameter(#Param, Params.Param, Default);\n    BP5_FOREACH_PARAMETER_TYPE_4ARGS(get_params);\n#undef get_params\n};\n\n} \/\/ namespace engine\n} \/\/ namespace core\n} \/\/ namespace adios2\n<commit_msg>remove superflous and wrong line in BP5Engine::ParseParameters<commit_after>\/*\n * Distributed under the OSI-approved Apache License, Version 2.0.  See\n * accompanying file Copyright.txt for details.\n *\n * BP5Engine.cpp\n *\n *\/\n\n#include \"BP5Engine.h\"\n\n#include \"adios2\/common\/ADIOSMacros.h\"\n#include \"adios2\/common\/ADIOSTypes.h\" \/\/PathSeparator\n#include \"adios2\/core\/IO.h\"\n#include \"adios2\/helper\/adiosFunctions.h\" \/\/CreateDirectory, StringToTimeUnit,\n\n#include <ctime>\n#include <iostream>\n\nnamespace adios2\n{\nnamespace core\n{\nnamespace engine\n{\n\nstd::vector<std::string>\nBP5Engine::GetBPMetadataFileNames(const std::vector<std::string> &names) const\n    noexcept\n{\n    std::vector<std::string> metadataFileNames;\n    metadataFileNames.reserve(names.size());\n    for (const auto &name : names)\n    {\n        metadataFileNames.push_back(GetBPMetadataFileName(name));\n    }\n    return metadataFileNames;\n}\n\nstd::vector<std::string> BP5Engine::GetBPMetaMetadataFileNames(\n    const std::vector<std::string> &names) const noexcept\n{\n    std::vector<std::string> metaMetadataFileNames;\n    metaMetadataFileNames.reserve(names.size());\n    for (const auto &name : names)\n    {\n        metaMetadataFileNames.push_back(GetBPMetaMetadataFileName(name));\n    }\n    return metaMetadataFileNames;\n}\n\nstd::string BP5Engine::GetBPMetadataFileName(const std::string &name) const\n    noexcept\n{\n    const std::string bpName = helper::RemoveTrailingSlash(name);\n    const size_t index = 0; \/\/ global metadata file is generated by rank 0\n    \/* the name of the metadata file is \"md.0\" *\/\n    const std::string bpMetaDataRankName(bpName + PathSeparator + \"md.\" +\n                                         std::to_string(index));\n    return bpMetaDataRankName;\n}\n\nstd::string BP5Engine::GetBPMetaMetadataFileName(const std::string &name) const\n    noexcept\n{\n    const std::string bpName = helper::RemoveTrailingSlash(name);\n    const size_t index = 0; \/\/ global metadata file is generated by rank 0\n    \/* the name of the metadata file is \"md.0\" *\/\n    const std::string bpMetaMetaDataRankName(bpName + PathSeparator + \"mmd.\" +\n                                             std::to_string(index));\n    return bpMetaMetaDataRankName;\n}\n\nstd::vector<std::string> BP5Engine::GetBPMetadataIndexFileNames(\n    const std::vector<std::string> &names) const noexcept\n{\n    std::vector<std::string> metadataIndexFileNames;\n    metadataIndexFileNames.reserve(names.size());\n    for (const auto &name : names)\n    {\n        metadataIndexFileNames.push_back(GetBPMetadataIndexFileName(name));\n    }\n    return metadataIndexFileNames;\n}\n\nstd::string BP5Engine::GetBPMetadataIndexFileName(const std::string &name) const\n    noexcept\n{\n    const std::string bpName = helper::RemoveTrailingSlash(name);\n    \/* the name of the metadata index file is \"md.idx\" *\/\n    const std::string bpMetaDataIndexRankName(bpName + PathSeparator +\n                                              \"md.idx\");\n    return bpMetaDataIndexRankName;\n}\n\nstd::vector<std::string>\nBP5Engine::GetBPVersionFileNames(const std::vector<std::string> &names) const\n    noexcept\n{\n    std::vector<std::string> versionFileNames;\n    versionFileNames.reserve(names.size());\n    for (const auto &name : names)\n    {\n        versionFileNames.push_back(GetBPVersionFileName(name));\n    }\n    return versionFileNames;\n}\n\nstd::string BP5Engine::GetBPVersionFileName(const std::string &name) const\n    noexcept\n{\n    const std::string bpName = helper::RemoveTrailingSlash(name);\n    \/* the name of the version file is \".bpversion\" *\/\n    const std::string bpVersionFileName(bpName + PathSeparator + \".bpversion\");\n    return bpVersionFileName;\n}\n\nstd::string BP5Engine::GetBPSubStreamName(const std::string &name,\n                                          const size_t id,\n                                          const bool hasSubFiles,\n                                          const bool isReader) const noexcept\n{\n    if (!hasSubFiles)\n    {\n        return name;\n    }\n\n    const std::string bpName = helper::RemoveTrailingSlash(name);\n    \/* the name of a data file starts with \"data.\" *\/\n    const std::string bpRankName(bpName + PathSeparator + \"data.\" +\n                                 std::to_string(id));\n    return bpRankName;\n}\n\nstd::vector<std::string>\nBP5Engine::GetBPSubStreamNames(const std::vector<std::string> &names,\n                               size_t subFileIndex) const noexcept\n{\n    std::vector<std::string> bpNames;\n    bpNames.reserve(names.size());\n    for (const auto &name : names)\n    {\n        bpNames.push_back(GetBPSubStreamName(name, subFileIndex));\n    }\n    return bpNames;\n}\n\nvoid BP5Engine::ParseParams(IO &io, struct BP5Params &Params)\n{\n    auto lf_SetBoolParameter = [&](const std::string key, bool &parameter,\n                                   bool def) {\n        auto itKey = io.m_Parameters.find(key);\n        parameter = def;\n        if (itKey != io.m_Parameters.end())\n        {\n            std::string value = itKey->second;\n            std::transform(value.begin(), value.end(), value.begin(),\n                           ::tolower);\n            if (value == \"yes\" || value == \"true\" || value == \"on\")\n            {\n                parameter = true;\n            }\n            else if (value == \"no\" || value == \"false\" || value == \"off\")\n            {\n                parameter = false;\n            }\n            else\n            {\n                throw std::invalid_argument(\n                    \"ERROR: Unknown BP5 Boolean parameter \\\"\" + value + \"\\\"\");\n            }\n        }\n    };\n\n    auto lf_SetFloatParameter = [&](const std::string key, float &parameter,\n                                    float def) {\n        auto itKey = io.m_Parameters.find(key);\n        parameter = def;\n        if (itKey != io.m_Parameters.end())\n        {\n            std::string value = itKey->second;\n            parameter =\n                helper::StringTo<float>(value, \" in Parameter key=\" + key);\n        }\n    };\n\n    auto lf_SetSizeBytesParameter = [&](const std::string key,\n                                        size_t &parameter, size_t def) {\n        auto itKey = io.m_Parameters.find(key);\n        parameter = def;\n        if (itKey != io.m_Parameters.end())\n        {\n            std::string value = itKey->second;\n            parameter = helper::StringToByteUnits(\n                value, \"for Parameter key=\" + key + \"in call to Open\");\n        }\n    };\n\n    auto lf_SetIntParameter = [&](const std::string key, int &parameter,\n                                  int def) {\n        auto itKey = io.m_Parameters.find(key);\n        parameter = def;\n        if (itKey != io.m_Parameters.end())\n        {\n            parameter = std::stoi(itKey->second);\n            return true;\n        }\n        return false;\n    };\n\n    auto lf_SetUIntParameter = [&](const std::string key,\n                                   unsigned int &parameter, unsigned int def) {\n        auto itKey = io.m_Parameters.find(key);\n        parameter = def;\n        if (itKey != io.m_Parameters.end())\n        {\n            unsigned long result = std::stoul(itKey->second);\n            if (result > std::numeric_limits<unsigned>::max())\n            {\n                result = std::numeric_limits<unsigned>::max();\n            }\n            parameter = static_cast<unsigned int>(result);\n            return true;\n        }\n        return false;\n    };\n\n    auto lf_SetStringParameter = [&](const std::string key,\n                                     std::string &parameter, const char *def) {\n        auto itKey = io.m_Parameters.find(key);\n        if (itKey != io.m_Parameters.end())\n        {\n            parameter = itKey->second;\n            return true;\n        }\n        return false;\n    };\n\n    auto lf_SetBufferVTypeParameter = [&](const std::string key, int &parameter,\n                                          int def) {\n        auto itKey = io.m_Parameters.find(key);\n        parameter = def;\n        if (itKey != io.m_Parameters.end())\n        {\n            std::string value = itKey->second;\n            std::transform(value.begin(), value.end(), value.begin(),\n                           ::tolower);\n            if (value == \"malloc\")\n            {\n                parameter = (int)BufferVType::MallocVType;\n            }\n            else if (value == \"chunk\")\n            {\n                parameter = (int)BufferVType::ChunkVType;\n            }\n            else\n            {\n                throw std::invalid_argument(\n                    \"ERROR: Unknown BP5 BufferVType parameter \\\"\" + value +\n                    \"\\\" (must be \\\"malloc\\\" or \\\"chunk\\\"\");\n            }\n        }\n    };\n\n    auto lf_SetAggregationTypeParameter = [&](const std::string key,\n                                              int &parameter, int def) {\n        auto itKey = io.m_Parameters.find(key);\n        parameter = def;\n        if (itKey != io.m_Parameters.end())\n        {\n            std::string value = itKey->second;\n            std::transform(value.begin(), value.end(), value.begin(),\n                           ::tolower);\n            if (value == \"everyonewrites\" || value == \"auto\")\n            {\n                parameter = (int)AggregationType::EveryoneWrites;\n            }\n            else if (value == \"everyonewritesserial\")\n            {\n                parameter = (int)AggregationType::EveryoneWritesSerial;\n            }\n            else if (value == \"twolevelshm\")\n            {\n                parameter = (int)AggregationType::TwoLevelShm;\n            }\n            else\n            {\n                throw std::invalid_argument(\n                    \"ERROR: Unknown BP5 AggregationType parameter \\\"\" + value +\n                    \"\\\" (must be \\\"auto\\\", \\\"everyonewrites\\\" or \"\n                    \"\\\"twolevelshm\\\"\");\n            }\n        }\n    };\n\n#define get_params(Param, Type, Typedecl, Default)                             \\\n    lf_Set##Type##Parameter(#Param, Params.Param, Default);\n    BP5_FOREACH_PARAMETER_TYPE_4ARGS(get_params);\n#undef get_params\n};\n\n} \/\/ namespace engine\n} \/\/ namespace core\n} \/\/ namespace adios2\n<|endoftext|>"}
{"text":"<commit_before>AliAnalysisTaskSEVertexingHF *AddTaskVertexingHFFilter(Int_t collisionSystem, TString configPWGHFd2h=\"$ALICE_PHYSICS\/PWGHF\/vertexingHF\/ConfigVertexingHF_pPbRHF.C\", TString localdir=\"\", Int_t runnumber=-1, TString strPeriod=\"\", const char* fname=\"AliAOD.VertexingHF.root\", Bool_t registerFile=kTRUE)\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(\"AddTaskVertexingHFFilter\", \"No analysis manager to connect to.\");\n    return NULL;\n  }   \n\n\n  gROOT->LoadMacro(\"$ALICE_PHYSICS\/PWGHF\/vertexingHF\/macros\/AddTaskVertexingHF.C\");\n  \/\/  TFile::Cp(gSystem->ExpandPathName(configPWGHFd2h.Data()), Form(\"%s\/ConfigVertexingHF.C\", train_name.Data()));\n  \/\/  TFile::Cp(gSystem->ExpandPathName(configPWGHFd2h.Data()), Form(\"ConfigVertexingHF.C\"));\n  \/\/  TFile::Cp(gSystem->ExpandPathName(configPWGHFd2h.Data()), Form(\"%s\/ConfigVertexingHF.C\", localdir.Data()));\n\n  AliAnalysisTaskSEVertexingHF *taskvertexingHF = AddTaskVertexingHF(collisionSystem,localdir,configPWGHFd2h,runnumber,strPeriod,fname);\n  \/\/ Now we need to keep in sync with the ESD filter\n  if (!taskvertexingHF) ::Warning(\"AddTaskVertexingHFFilter\", \"AliAnalysisTaskSEVertexingHF cannot run for this train conditions - EXCLUDED\");\n  \n  if(registerFile) mgr->RegisterExtraFile(\"AliAOD.VertexingHF.root\");\n  taskvertexingHF->SelectCollisionCandidates(0);\n\n  mgr->AddTask(taskvertexingHF);\n\n  return taskvertexingHF;\n}\n<commit_msg>Add option to includebasic QA to filtering macro<commit_after>AliAnalysisTaskSEVertexingHF *AddTaskVertexingHFFilter(Int_t collisionSystem, TString configPWGHFd2h=\"$ALICE_PHYSICS\/PWGHF\/vertexingHF\/ConfigVertexingHF_pPbRHF.C\", TString localdir=\"\", Int_t runnumber=-1, TString strPeriod=\"\", const char* fname=\"AliAOD.VertexingHF.root\", Bool_t registerFile=kTRUE, Int_t addD2Htrain=0)\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(\"AddTaskVertexingHFFilter\", \"No analysis manager to connect to.\");\n    return NULL;\n  }   \n\n\n  gROOT->LoadMacro(\"$ALICE_PHYSICS\/PWGHF\/vertexingHF\/macros\/AddTaskVertexingHF.C\");\n  \/\/  TFile::Cp(gSystem->ExpandPathName(configPWGHFd2h.Data()), Form(\"%s\/ConfigVertexingHF.C\", train_name.Data()));\n  \/\/  TFile::Cp(gSystem->ExpandPathName(configPWGHFd2h.Data()), Form(\"ConfigVertexingHF.C\"));\n  \/\/  TFile::Cp(gSystem->ExpandPathName(configPWGHFd2h.Data()), Form(\"%s\/ConfigVertexingHF.C\", localdir.Data()));\n\n  AliAnalysisTaskSEVertexingHF *taskvertexingHF = AddTaskVertexingHF(collisionSystem,localdir,configPWGHFd2h,runnumber,strPeriod,fname);\n  \/\/ Now we need to keep in sync with the ESD filter\n  if (!taskvertexingHF) ::Warning(\"AddTaskVertexingHFFilter\", \"AliAnalysisTaskSEVertexingHF cannot run for this train conditions - EXCLUDED\");\n  \n  if(registerFile) mgr->RegisterExtraFile(\"AliAOD.VertexingHF.root\");\n  taskvertexingHF->SelectCollisionCandidates(0);\n\n  mgr->AddTask(taskvertexingHF);\n\n\n    if(addD2Htrain>0){\n        gROOT->LoadMacro(\"$ALICE_PHYSICS\/PWGHF\/vertexingHF\/AddD2HTrain.C\");\n        Int_t nwagons=0;\n\n        if(addD2Htrain==1){\n            ::Warning(\"AddD2HTrain.C\",\"Runing without MC flag\");\n            nwagons = AddD2HTrain(kFALSE,1,1,0,1,0,0,0,0,1,0,0);\n        }\n        else if(addD2Htrain==2){\n            ::Warning(\"AddD2HTrain.C\",\"Runing with MC flag\");\n            nwagons = AddD2HTrain(kTRUE,1,1,0,1,0,0,0,0,1,0,0);\n        }\n    }\n\n  return taskvertexingHF;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/***************************************************************************\n            adash@cern.ch - last modified on 05\/09\/2016\n\/\/\n\/\/ General macro to configure the RSN analysis task.\n\/\/ It calls all configs desired by the user, by means\n\/\/ of the boolean switches defined in the first lines.\n\/\/ ---\n\/\/ Inputs:\n\/\/  1) flag to know if running on MC or data\n\/\/  2) path where all configs are stored\n\/\/ ---\n\/\/ Returns:\n\/\/  kTRUE  --> initialization successful\n\/\/  kFALSE --> initialization failed (some config gave errors)\n\/\/\n****************************************************************************\/\n\nAliRsnMiniAnalysisTask * AddTaskKStarpPbRunII(\n\t\t\t\t\t\tBool_t      isMC                = kFALSE,\n\t\t\t\t\t\tBool_t      isPP                = kFALSE,\n\t\t\t\t\t\tInt_t       Strcut              = 2011,\n\t\t\t\t\t\tInt_t       customQualityCutsID = AliRsnCutSetDaughterParticle::kDisableCustom,\n\t\t\t\t\t\tAliRsnCutSetDaughterParticle::ERsnDaughterCutSet cutKaCandidate=AliRsnCutSetDaughterParticle::kTPCTOFpidphikstarpPb2016,\n\t\t\t\t\t\tFloat_t     nsigmaPi            = 2.0,\n\t\t\t\t\t\tFloat_t     nsigmaK             = 2.0,\n\t\t\t\t\t\tFloat_t     nsigmaTOF             = 3.0,\n\t\t\t\t\t\tBool_t      enableMonitor       = kTRUE,\n\t\t\t\t\t\tInt_t       nmix                = 5,\n\t\t\t\t\t\tFloat_t     maxDiffVzMix        = 1.0,\n\t\t\t\t\t\tFloat_t     maxDiffMultMix      = 5.0,\n\t\t\t\t\t\tTString     outNameSuffix       = \"PbPb\"\n\t\t\t\t\t\t)\n{  \n  Bool_t      rejectPileUp = kTRUE;\n  \/\/if(!isPP || isMC) rejectPileUp = kFALSE;\n\n  \/\/\n  \/\/ -- INITIALIZATION ----------------------------------------------------------------------------\n  \/\/ retrieve analysis manager\n  \/\/\n  AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n   if (!mgr) {\n      ::Error(\"AddTaskKStarPbPbRunTwo\", \"No analysis manager to connect to.\");\n      return NULL;\n   } \n\n   \/\/ create the task and configure \n   TString taskName = Form(\"KStar%s%s\", (isPP? \"pp\" : \"PPb\"), (isMC ? \"MC\" : \"Data\"));\n   \n   AliRsnMiniAnalysisTask *task = new AliRsnMiniAnalysisTask(taskName.Data(), isMC);\n   task->UseESDTriggerMask(AliVEvent::kINT7);\n   \/\/if (isPP) \n   \/\/task->UseMultiplicity(\"QUALITY\");\n   \/\/else\n   \/\/  task->UseMultiplicity(\"AliMultSelection_V0M\");\/\/Only for RunII\n    task->UseMultiplicity(\"AliMultSelection_V0A\");\/\/Only for RunII\n   \/\/ set event mixing options\n   task->UseContinuousMix();\n   \/\/task->UseBinnedMix();\n   task->SetNMix(nmix);\n   task->SetMaxDiffVz(maxDiffVzMix);\n   task->SetMaxDiffMult(maxDiffMultMix);\n   task->UseMC(isMC);\n   ::Info(\"AddTaskKStarPbPbRunTwo\", Form(\"Event mixing configuration: \\n events to mix = %i \\n max diff. vtxZ = cm %5.3f \\n max diff multi = %5.3f \\n\", nmix, maxDiffVzMix, maxDiffMultMix));\n   \n   mgr->AddTask(task);\n      \n   AliRsnCutEventUtils* cutEventUtils=new AliRsnCutEventUtils(\"cutEventUtils\",kTRUE,rejectPileUp);\n   cutEventUtils->SetCheckAcceptedMultSelection();\n   AliRsnCutSet *eventCuts = new AliRsnCutSet(\"eventCuts\", AliRsnTarget::kEvent);\n   eventCuts->AddCut(cutEventUtils);\n   eventCuts->SetCutScheme(Form(\"%s\",cutEventUtils->GetName()));\n   task->SetEventCuts(eventCuts);\n   \n   \/\/\n   \/\/ -- EVENT-ONLY COMPUTATIONS -------------------------------------------------------------------\n   \/\/   \n   \/\/vertex\n   Int_t vtxID = task->CreateValue(AliRsnMiniValue::kVz, kFALSE);\n   AliRsnMiniOutput *outVtx = task->CreateOutput(\"eventVtx\", \"HIST\", \"EVENT\");\n   outVtx->AddAxis(vtxID, 400, -20.0, 20.0);\n   \n   \/\/multiplicity or centrality\n   Int_t multID = task->CreateValue(AliRsnMiniValue::kMult, kFALSE);\n   AliRsnMiniOutput *outMult = task->CreateOutput(\"eventMult\", \"HIST\", \"EVENT\");\n   if (isPP) \n     outMult->AddAxis(multID, 400, 0.0, 400.0);\n   else\n     outMult->AddAxis(multID, 100, 0.0, 100.0);\n   \n   \/\/\n   \/\/ -- PAIR CUTS (common to all resonances) ------------------------------------------------------\n   \/\/\n   AliRsnCutMiniPair *cutY = new AliRsnCutMiniPair(\"cutRapidity\", AliRsnCutMiniPair::kRapidityRange);\n   \/\/cutY->SetRangeD(-0.5, 0.5);\n   cutY->SetRangeD(-0.465, 0.035);\/\/ 0 < y_cm < 0.5; y_cm = y_lab + 0.465\n   AliRsnCutSet *cutsPair = new AliRsnCutSet(\"pairCuts\", AliRsnTarget::kMother);\n   cutsPair->AddCut(cutY);\n   cutsPair->SetCutScheme(cutY->GetName());\n   \n   \/\/\n   \/\/ -- CONFIG ANALYSIS --------------------------------------------------------------------------\n   \/\/\n   gROOT->LoadMacro(\"$ALICE_PHYSICS\/PWGLF\/RESONANCES\/macros\/mini\/ConfigKStarpPbRunII.C\");\n   \/\/ gROOT->LoadMacro(\"ConfigKStarPbPbRunII.C\");\n   if (!ConfigKStarPbPbRunII(task, isMC, isPP, cutsPair,Strcut, customQualityCutsID,cutKaCandidate,nsigmaPi,nsigmaK, nsigmaTOF, enableMonitor)) return 0x0;\n\n   \/\/\n   \/\/ -- CONTAINERS --------------------------------------------------------------------------------\n   \/\/\n   TString outputFileName = AliAnalysisManager::GetCommonFileName();\n   \/\/outputFileName += \":Rsn\";\n   Printf(\"AddTaskKStarPbPbRunTwo - Set OutputFileName : \\n %s\\n\", outputFileName.Data() );\n   \n   AliAnalysisDataContainer *output = mgr->CreateContainer(Form(\"RsnOut_%s\",outNameSuffix.Data()), \n\t\t\t\t\t\t\t   TList::Class(), \n\t\t\t\t\t\t\t   AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t   outputFileName);\n   mgr->ConnectInput(task, 0, mgr->GetCommonInputContainer());\n   mgr->ConnectOutput(task, 1, output);\n   \n   return task;\n}\n<commit_msg>Fix a mistake in argument for KStar analysis in p-Pb with RunII data<commit_after>\/***************************************************************************\n            adash@cern.ch - last modified on 05\/09\/2016\n\/\/\n\/\/ General macro to configure the RSN analysis task.\n\/\/ It calls all configs desired by the user, by means\n\/\/ of the boolean switches defined in the first lines.\n\/\/ ---\n\/\/ Inputs:\n\/\/  1) flag to know if running on MC or data\n\/\/  2) path where all configs are stored\n\/\/ ---\n\/\/ Returns:\n\/\/  kTRUE  --> initialization successful\n\/\/  kFALSE --> initialization failed (some config gave errors)\n\/\/\n****************************************************************************\/\n\nAliRsnMiniAnalysisTask * AddTaskKStarpPbRunII(\n\t\t\t\t\t\tBool_t      isMC                = kFALSE,\n\t\t\t\t\t\tBool_t      isPP                = kFALSE,\n\t\t\t\t\t\tInt_t       Strcut              = 2011,\n\t\t\t\t\t\tInt_t       customQualityCutsID = AliRsnCutSetDaughterParticle::kDisableCustom,\n\t\t\t\t\t  AliRsnCutSetDaughterParticle::ERsnDaughterCutSet cutKaCandidate=AliRsnCutSetDaughterParticle::kTPCTOFpidphikstarpPb2016,\n\n\t\t\t\t\t\tFloat_t     nsigmaPi            = 2.0,\n\t\t\t\t\t\tFloat_t     nsigmaK             = 2.0,\n\t\t\t\t\t\tFloat_t     nsigmaTOF           = 3.0,\n\t\t\t\t\t\tBool_t      enableMonitor       = kTRUE,\n\t\t\t\t\t\tInt_t       nmix                = 5,\n\t\t\t\t\t\tFloat_t     maxDiffVzMix        = 1.0,\n\t\t\t\t\t\tFloat_t     maxDiffMultMix      = 5.0,\n\t\t\t\t\t\tTString     outNameSuffix       = \"pPb\"\n\t\t\t\t\t\t)\n{  \n  Bool_t      rejectPileUp = kTRUE;\n  \/\/if(!isPP || isMC) rejectPileUp = kFALSE;\n\n  \/\/\n  \/\/ -- INITIALIZATION ----------------------------------------------------------------------------\n  \/\/ retrieve analysis manager\n  \/\/\n  AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n   if (!mgr) {\n      ::Error(\"AddTaskKStarPbPbRunTwo\", \"No analysis manager to connect to.\");\n      return NULL;\n   } \n\n   \/\/ create the task and configure \n   TString taskName = Form(\"KStar%s%s\", (isPP? \"pp\" : \"PPb\"), (isMC ? \"MC\" : \"Data\"));\n   \n   AliRsnMiniAnalysisTask *task = new AliRsnMiniAnalysisTask(taskName.Data(), isMC);\n   task->UseESDTriggerMask(AliVEvent::kINT7);\n   \/\/if (isPP) \n   \/\/task->UseMultiplicity(\"QUALITY\");\n   \/\/else\n   \/\/  task->UseMultiplicity(\"AliMultSelection_V0M\");\/\/Only for RunII\n    task->UseMultiplicity(\"AliMultSelection_V0A\");\/\/Only for RunII\n   \/\/ set event mixing options\n   task->UseContinuousMix();\n   \/\/task->UseBinnedMix();\n   task->SetNMix(nmix);\n   task->SetMaxDiffVz(maxDiffVzMix);\n   task->SetMaxDiffMult(maxDiffMultMix);\n   task->UseMC(isMC);\n   ::Info(\"AddTaskKStarPbPbRunTwo\", Form(\"Event mixing configuration: \\n events to mix = %i \\n max diff. vtxZ = cm %5.3f \\n max diff multi = %5.3f \\n\", nmix, maxDiffVzMix, maxDiffMultMix));\n   \n   mgr->AddTask(task);\n      \n   AliRsnCutEventUtils* cutEventUtils=new AliRsnCutEventUtils(\"cutEventUtils\",kTRUE,rejectPileUp);\n   cutEventUtils->SetCheckAcceptedMultSelection();\n   AliRsnCutSet *eventCuts = new AliRsnCutSet(\"eventCuts\", AliRsnTarget::kEvent);\n   eventCuts->AddCut(cutEventUtils);\n   eventCuts->SetCutScheme(Form(\"%s\",cutEventUtils->GetName()));\n   task->SetEventCuts(eventCuts);\n   \n   \/\/\n   \/\/ -- EVENT-ONLY COMPUTATIONS -------------------------------------------------------------------\n   \/\/   \n   \/\/vertex\n   Int_t vtxID = task->CreateValue(AliRsnMiniValue::kVz, kFALSE);\n   AliRsnMiniOutput *outVtx = task->CreateOutput(\"eventVtx\", \"HIST\", \"EVENT\");\n   outVtx->AddAxis(vtxID, 400, -20.0, 20.0);\n   \n   \/\/multiplicity or centrality\n   Int_t multID = task->CreateValue(AliRsnMiniValue::kMult, kFALSE);\n   AliRsnMiniOutput *outMult = task->CreateOutput(\"eventMult\", \"HIST\", \"EVENT\");\n   if (isPP) \n     outMult->AddAxis(multID, 400, 0.0, 400.0);\n   else\n     outMult->AddAxis(multID, 100, 0.0, 100.0);\n   \n   \/\/\n   \/\/ -- PAIR CUTS (common to all resonances) ------------------------------------------------------\n   \/\/\n   AliRsnCutMiniPair *cutY = new AliRsnCutMiniPair(\"cutRapidity\", AliRsnCutMiniPair::kRapidityRange);\n   \/\/cutY->SetRangeD(-0.5, 0.5);\n   cutY->SetRangeD(-0.465, 0.035);\/\/ 0 < y_cm < 0.5; y_cm = y_lab + 0.465\n   AliRsnCutSet *cutsPair = new AliRsnCutSet(\"pairCuts\", AliRsnTarget::kMother);\n   cutsPair->AddCut(cutY);\n   cutsPair->SetCutScheme(cutY->GetName());\n   \n   \/\/\n   \/\/ -- CONFIG ANALYSIS --------------------------------------------------------------------------\n   \/\/\n   gROOT->LoadMacro(\"$ALICE_PHYSICS\/PWGLF\/RESONANCES\/macros\/mini\/ConfigKStarpPbRunII.C\");\n   \/\/ gROOT->LoadMacro(\"ConfigKStarPbPbRunII.C\");\n   if (!ConfigKStarpPbRunII(task, isMC, isPP, cutsPair,Strcut,customQualityCutsID,cutKaCandidate,nsigmaPi,nsigmaK,nsigmaTOF,enableMonitor)) return 0x0;\n\n   \/\/\n   \/\/ -- CONTAINERS --------------------------------------------------------------------------------\n   \/\/\n   TString outputFileName = AliAnalysisManager::GetCommonFileName();\n   \/\/outputFileName += \":Rsn\";\n   Printf(\"AddTaskKStarPbPbRunTwo - Set OutputFileName : \\n %s\\n\", outputFileName.Data() );\n   \n   AliAnalysisDataContainer *output = mgr->CreateContainer(Form(\"RsnOut_%s\",outNameSuffix.Data()), \n\t\t\t\t\t\t\t   TList::Class(), \n\t\t\t\t\t\t\t   AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t   outputFileName);\n   mgr->ConnectInput(task, 0, mgr->GetCommonInputContainer());\n   mgr->ConnectOutput(task, 1, output);\n   \n   return task;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=====================================================================\n\nQGroundControl Open Source Ground Control Station\n\n(c) 2013 Michael Carpenter (malcom2073@gmail.com)\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 Radio Calibration Configuration source.\n *\n *   @author Michael Carpenter <malcom2073@gmail.com>\n *\n *\/\n\n#include \"RadioCalibrationConfig.h\"\n#include <QMessageBox>\n\nRadioCalibrationConfig::RadioCalibrationConfig(QWidget *parent) : AP2ConfigWidget(parent)\n{\n    ui.setupUi(this);\n\n    connect(ui.calibrateButton,SIGNAL(clicked()),this,SLOT(calibrateButtonClicked()));\n    m_calibrationEnabled = false;\n    ui.rollWidget->setMin(800);\n    ui.rollWidget->setMax(2200);\n    ui.pitchWidget->setMin(800);\n    ui.pitchWidget->setMax(2200);\n    ui.throttleWidget->setMin(800);\n    ui.throttleWidget->setMax(2200);\n    ui.yawWidget->setMin(800);\n    ui.yawWidget->setMax(2200);\n    ui.radio5Widget->setMin(800);\n    ui.radio5Widget->setMax(2200);\n    ui.radio6Widget->setMin(800);\n    ui.radio6Widget->setMax(2200);\n    ui.radio7Widget->setMin(800);\n    ui.radio7Widget->setMax(2200);\n    ui.radio8Widget->setMin(800);\n    ui.radio8Widget->setMax(2200);\n    ui.rollWidget->setOrientation(Qt::Horizontal);\n    ui.rollWidget->setName(\"Roll\");\n    ui.yawWidget->setOrientation(Qt::Horizontal);\n    ui.yawWidget->setName(\"Yaw\");\n    ui.pitchWidget->setName(\"Pitch\");\n    ui.throttleWidget->setName(\"Throttle\");\n    ui.radio5Widget->setOrientation(Qt::Horizontal);\n    ui.radio5Widget->setName(\"Radio 5\");\n    ui.radio6Widget->setOrientation(Qt::Horizontal);\n    ui.radio6Widget->setName(\"Radio 6\");\n    ui.radio7Widget->setOrientation(Qt::Horizontal);\n    ui.radio7Widget->setName(\"Radio 7\");\n    ui.radio8Widget->setOrientation(Qt::Horizontal);\n    ui.radio8Widget->setName(\"Radio 8\");\n\n    guiUpdateTimer = new QTimer(this);\n    connect(guiUpdateTimer,SIGNAL(timeout()),this,SLOT(guiUpdateTimerTick()));\n}\n\nRadioCalibrationConfig::~RadioCalibrationConfig()\n{\n}\nvoid RadioCalibrationConfig::activeUASSet(UASInterface *uas)\n{\n    if (m_uas)\n    {\n        disconnect(m_uas, SIGNAL(remoteControlChannelRawChanged(int,float)), this,SLOT(remoteControlChannelRawChanged(int,float)));\n    }\n    AP2ConfigWidget::activeUASSet(uas);\n    if (!uas)\n    {\n        return;\n    }\n    connect(m_uas,SIGNAL(remoteControlChannelRawChanged(int,float)),this,SLOT(remoteControlChannelRawChanged(int,float)));\n}\nvoid RadioCalibrationConfig::remoteControlChannelRawChanged(int chan,float val)\n{\n\n    \/\/Channel is 0-7 typically?\n    \/\/Val will be 0-3000, PWM value.\n    if (m_calibrationEnabled) {\n        if (val < rcMin[chan])\n        {\n            rcMin[chan] = val;\n        }\n\n        if (val > rcMax[chan])\n        {\n            rcMax[chan] = val;\n        }\n    }\n\n    \/\/ Raw value\n    rcValue[chan] = val;\n}\n\nvoid RadioCalibrationConfig::parameterChanged(int uas, int component, QString parameterName, QVariant value)\n{\n\n}\nvoid RadioCalibrationConfig::guiUpdateTimerTick()\n{\n    ui.rollWidget->setValue(rcValue[0]);\n    ui.pitchWidget->setValue(rcValue[1]);\n    ui.throttleWidget->setValue(rcValue[2]);\n    ui.yawWidget->setValue(rcValue[3]);\n    ui.radio5Widget->setValue(rcValue[4]);\n    ui.radio6Widget->setValue(rcValue[5]);\n    ui.radio7Widget->setValue(rcValue[6]);\n    ui.radio8Widget->setValue(rcValue[7]);\n    if (m_calibrationEnabled)\n    {\n        ui.rollWidget->setMin(rcMin[0]);\n        ui.rollWidget->setMax(rcMax[0]);\n        ui.pitchWidget->setMin(rcMin[1]);\n        ui.pitchWidget->setMax(rcMax[1]);\n        ui.throttleWidget->setMin(rcMin[2]);\n        ui.throttleWidget->setMax(rcMax[2]);\n        ui.yawWidget->setMin(rcMin[3]);\n        ui.yawWidget->setMax(rcMax[3]);\n        ui.radio5Widget->setMin(rcMin[4]);\n        ui.radio5Widget->setMax(rcMax[4]);\n        ui.radio6Widget->setMin(rcMin[5]);\n        ui.radio6Widget->setMax(rcMax[5]);\n        ui.radio7Widget->setMin(rcMin[6]);\n        ui.radio7Widget->setMax(rcMax[6]);\n        ui.radio8Widget->setMin(rcMin[7]);\n        ui.radio8Widget->setMax(rcMax[7]);\n    }\n}\nvoid RadioCalibrationConfig::showEvent(QShowEvent *event)\n{\n    guiUpdateTimer->start(100);\n}\nvoid RadioCalibrationConfig::hideEvent(QHideEvent *event)\n{\n    guiUpdateTimer->stop();\n}\nvoid RadioCalibrationConfig::calibrateButtonClicked()\n{\n    if (!m_calibrationEnabled)\n    {\n        ui.calibrateButton->setText(\"End Calibration\");\n        QMessageBox::information(0,\"Warning!\",\"You are about to start radio calibration.\\nPlease ensure all motor power is disconnected AND all props are removed from the vehicle.\\nAlso ensure transmitter and reciever are powered and connected\\n\\nClick OK to confirm\");\n        m_calibrationEnabled = true;\n        for (int i=0;i<8;i++)\n        {\n            rcMin[i] = 1500;\n            rcMax[i] = 1500;\n        }\n        ui.rollWidget->showMinMax();\n        ui.pitchWidget->showMinMax();\n        ui.yawWidget->showMinMax();\n        ui.radio5Widget->showMinMax();\n        ui.radio6Widget->showMinMax();\n        ui.radio7Widget->showMinMax();\n        ui.radio8Widget->showMinMax();\n        QMessageBox::information(0,\"Information\",\"Click OK, then move all sticks to their extreme positions, watching the min\/max values to ensure you get the most range from your controller. This includes all switches\");\n    }\n    else\n    {\n        ui.calibrateButton->setText(\"Calibrate\");\n        QMessageBox::information(0,\"Trims\",\"Ensure all sticks are centered and throttle is in the downmost position, click OK to continue\");\n        \/\/\/TODO: Set trims!\n        m_calibrationEnabled = false;\n        ui.rollWidget->hideMinMax();\n        ui.pitchWidget->hideMinMax();\n        ui.yawWidget->hideMinMax();\n        ui.radio5Widget->hideMinMax();\n        ui.radio6Widget->hideMinMax();\n        ui.radio7Widget->hideMinMax();\n        ui.radio8Widget->hideMinMax();\n        QString statusstr;\n        statusstr = \"Below you will find the detected radio calibration information that will be sent to the autopilot\\n\";\n        statusstr += \"Normal values are around 1100 to 1900, with disconnected channels reading very close to 1500\\n\\n\";\n        statusstr += \"Channel\\tMin\\tCenter\\tMax\\n\";\n        statusstr += \"--------------------\\n\";\n        for (int i=0;i<8;i++)\n        {\n            statusstr += QString::number(i) + \"\\t\" + QString::number(rcMin[i]) + \"\\t\" + QString::number(rcValue[i]) + \"\\t\" + QString::number(rcMax[i]) + \"\\n\";\n        }\n        QMessageBox::information(0,\"Status\",statusstr);\n        \/\/Send calibrations.\n        QString minTpl(\"RC%1_MIN\");\n        QString maxTpl(\"RC%1_MAX\");\n        \/\/QString trimTpl(\"RC%1_TRIM\");\n\n        \/\/ Do not write the RC type, as these values depend on this\n        \/\/ active onboard parameter\n\n        for (unsigned int i = 0; i < 8; ++i)\n        {\n            qDebug() << \"SENDING MIN\" << minTpl.arg(i+1) << rcMin[i];\n            qDebug() << \"SENDING MAX\" << maxTpl.arg(i+1) << rcMax[i];\n            m_uas->getParamManager()->setParameter(1, minTpl.arg(i+1), (float)rcMin[i]);\n            QGC::SLEEP::usleep(50000);\n            \/\/m_uas->setParameter(0, trimTpl.arg(i+1), rcTrim[i]);\n            \/\/QGC::SLEEP::usleep(50000);\n            m_uas->getParamManager()->setParameter(1, maxTpl.arg(i+1), (float)rcMax[i]);\n            QGC::SLEEP::usleep(50000);\n        }\n        ui.rollWidget->setMin(800);\n        ui.rollWidget->setMax(2200);\n        ui.pitchWidget->setMin(800);\n        ui.pitchWidget->setMax(2200);\n        ui.throttleWidget->setMin(800);\n        ui.throttleWidget->setMax(2200);\n        ui.yawWidget->setMin(800);\n        ui.yawWidget->setMax(2200);\n        ui.radio5Widget->setMin(800);\n        ui.radio5Widget->setMax(2200);\n        ui.radio6Widget->setMin(800);\n        ui.radio6Widget->setMax(2200);\n        ui.radio7Widget->setMin(800);\n        ui.radio7Widget->setMax(2200);\n        ui.radio8Widget->setMin(800);\n        ui.radio8Widget->setMax(2200);\n\n    }\n}\n<commit_msg>Fixes #22 add init to lists to fix out-of-bounds issue<commit_after>\/*=====================================================================\n\nQGroundControl Open Source Ground Control Station\n\n(c) 2013 Michael Carpenter (malcom2073@gmail.com)\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 Radio Calibration Configuration source.\n *\n *   @author Michael Carpenter <malcom2073@gmail.com>\n *\n *\/\n\n#include \"RadioCalibrationConfig.h\"\n#include <QMessageBox>\n\nRadioCalibrationConfig::RadioCalibrationConfig(QWidget *parent) : AP2ConfigWidget(parent)\n{\n    ui.setupUi(this);\n\n    connect(ui.calibrateButton,SIGNAL(clicked()),this,SLOT(calibrateButtonClicked()));\n    m_calibrationEnabled = false;\n    ui.rollWidget->setMin(800);\n    ui.rollWidget->setMax(2200);\n    ui.pitchWidget->setMin(800);\n    ui.pitchWidget->setMax(2200);\n    ui.throttleWidget->setMin(800);\n    ui.throttleWidget->setMax(2200);\n    ui.yawWidget->setMin(800);\n    ui.yawWidget->setMax(2200);\n    ui.radio5Widget->setMin(800);\n    ui.radio5Widget->setMax(2200);\n    ui.radio6Widget->setMin(800);\n    ui.radio6Widget->setMax(2200);\n    ui.radio7Widget->setMin(800);\n    ui.radio7Widget->setMax(2200);\n    ui.radio8Widget->setMin(800);\n    ui.radio8Widget->setMax(2200);\n    ui.rollWidget->setOrientation(Qt::Horizontal);\n    ui.rollWidget->setName(\"Roll\");\n    ui.yawWidget->setOrientation(Qt::Horizontal);\n    ui.yawWidget->setName(\"Yaw\");\n    ui.pitchWidget->setName(\"Pitch\");\n    ui.throttleWidget->setName(\"Throttle\");\n    ui.radio5Widget->setOrientation(Qt::Horizontal);\n    ui.radio5Widget->setName(\"Radio 5\");\n    ui.radio6Widget->setOrientation(Qt::Horizontal);\n    ui.radio6Widget->setName(\"Radio 6\");\n    ui.radio7Widget->setOrientation(Qt::Horizontal);\n    ui.radio7Widget->setName(\"Radio 7\");\n    ui.radio8Widget->setOrientation(Qt::Horizontal);\n    ui.radio8Widget->setName(\"Radio 8\");\n\n    guiUpdateTimer = new QTimer(this);\n    connect(guiUpdateTimer,SIGNAL(timeout()),this,SLOT(guiUpdateTimerTick()));\n\n    rcMin << 1100.0 << 1100.0 << 1100.0 << 1100.0 << 1100.0 << 1100.0 << 1100.0 << 1100.0;\n    rcMax << 1900.0 << 1900.0 << 1900.0 << 1900.0 << 1900.0 << 1900.0 << 1900.0 << 1900.0;\n    rcTrim << 1500.0 << 1500.0 << 1500.0 << 1500.0 << 1500.0 << 1500.0 << 1500.0 << 1500.0;\n    rcValue << 0.0 << 0.0 << 0.0 << 0.0 << 0.0 << 0.0 << 0.0 << 0.0;\n}\n\nRadioCalibrationConfig::~RadioCalibrationConfig()\n{\n}\nvoid RadioCalibrationConfig::activeUASSet(UASInterface *uas)\n{\n    if (m_uas)\n    {\n        disconnect(m_uas, SIGNAL(remoteControlChannelRawChanged(int,float)), this,SLOT(remoteControlChannelRawChanged(int,float)));\n    }\n    AP2ConfigWidget::activeUASSet(uas);\n    if (!uas)\n    {\n        return;\n    }\n    connect(m_uas,SIGNAL(remoteControlChannelRawChanged(int,float)),this,SLOT(remoteControlChannelRawChanged(int,float)));\n}\nvoid RadioCalibrationConfig::remoteControlChannelRawChanged(int chan,float val)\n{\n\n    \/\/Channel is 0-7 typically?\n    \/\/Val will be 0-3000, PWM value.\n    if (m_calibrationEnabled) {\n        if (val < rcMin[chan])\n        {\n            rcMin[chan] = val;\n        }\n\n        if (val > rcMax[chan])\n        {\n            rcMax[chan] = val;\n        }\n    }\n\n    \/\/ Raw value\n    rcValue[chan] = val;\n}\n\nvoid RadioCalibrationConfig::parameterChanged(int uas, int component, QString parameterName, QVariant value)\n{\n\n}\nvoid RadioCalibrationConfig::guiUpdateTimerTick()\n{\n    ui.rollWidget->setValue(rcValue[0]);\n    ui.pitchWidget->setValue(rcValue[1]);\n    ui.throttleWidget->setValue(rcValue[2]);\n    ui.yawWidget->setValue(rcValue[3]);\n    ui.radio5Widget->setValue(rcValue[4]);\n    ui.radio6Widget->setValue(rcValue[5]);\n    ui.radio7Widget->setValue(rcValue[6]);\n    ui.radio8Widget->setValue(rcValue[7]);\n    if (m_calibrationEnabled)\n    {\n        ui.rollWidget->setMin(rcMin[0]);\n        ui.rollWidget->setMax(rcMax[0]);\n        ui.pitchWidget->setMin(rcMin[1]);\n        ui.pitchWidget->setMax(rcMax[1]);\n        ui.throttleWidget->setMin(rcMin[2]);\n        ui.throttleWidget->setMax(rcMax[2]);\n        ui.yawWidget->setMin(rcMin[3]);\n        ui.yawWidget->setMax(rcMax[3]);\n        ui.radio5Widget->setMin(rcMin[4]);\n        ui.radio5Widget->setMax(rcMax[4]);\n        ui.radio6Widget->setMin(rcMin[5]);\n        ui.radio6Widget->setMax(rcMax[5]);\n        ui.radio7Widget->setMin(rcMin[6]);\n        ui.radio7Widget->setMax(rcMax[6]);\n        ui.radio8Widget->setMin(rcMin[7]);\n        ui.radio8Widget->setMax(rcMax[7]);\n    }\n}\nvoid RadioCalibrationConfig::showEvent(QShowEvent *event)\n{\n    guiUpdateTimer->start(100);\n}\nvoid RadioCalibrationConfig::hideEvent(QHideEvent *event)\n{\n    guiUpdateTimer->stop();\n}\nvoid RadioCalibrationConfig::calibrateButtonClicked()\n{\n    if (!m_calibrationEnabled)\n    {\n        ui.calibrateButton->setText(\"End Calibration\");\n        QMessageBox::information(0,\"Warning!\",\"You are about to start radio calibration.\\nPlease ensure all motor power is disconnected AND all props are removed from the vehicle.\\nAlso ensure transmitter and reciever are powered and connected\\n\\nClick OK to confirm\");\n        m_calibrationEnabled = true;\n        for (int i=0;i<8;i++)\n        {\n            rcMin[i] = 1500;\n            rcMax[i] = 1500;\n        }\n        ui.rollWidget->showMinMax();\n        ui.pitchWidget->showMinMax();\n        ui.yawWidget->showMinMax();\n        ui.radio5Widget->showMinMax();\n        ui.radio6Widget->showMinMax();\n        ui.radio7Widget->showMinMax();\n        ui.radio8Widget->showMinMax();\n        QMessageBox::information(0,\"Information\",\"Click OK, then move all sticks to their extreme positions, watching the min\/max values to ensure you get the most range from your controller. This includes all switches\");\n    }\n    else\n    {\n        ui.calibrateButton->setText(\"Calibrate\");\n        QMessageBox::information(0,\"Trims\",\"Ensure all sticks are centered and throttle is in the downmost position, click OK to continue\");\n        \/\/\/TODO: Set trims!\n        m_calibrationEnabled = false;\n        ui.rollWidget->hideMinMax();\n        ui.pitchWidget->hideMinMax();\n        ui.yawWidget->hideMinMax();\n        ui.radio5Widget->hideMinMax();\n        ui.radio6Widget->hideMinMax();\n        ui.radio7Widget->hideMinMax();\n        ui.radio8Widget->hideMinMax();\n        QString statusstr;\n        statusstr = \"Below you will find the detected radio calibration information that will be sent to the autopilot\\n\";\n        statusstr += \"Normal values are around 1100 to 1900, with disconnected channels reading very close to 1500\\n\\n\";\n        statusstr += \"Channel\\tMin\\tCenter\\tMax\\n\";\n        statusstr += \"--------------------\\n\";\n        for (int i=0;i<8;i++)\n        {\n            statusstr += QString::number(i) + \"\\t\" + QString::number(rcMin[i]) + \"\\t\" + QString::number(rcValue[i]) + \"\\t\" + QString::number(rcMax[i]) + \"\\n\";\n        }\n        QMessageBox::information(0,\"Status\",statusstr);\n        \/\/Send calibrations.\n        QString minTpl(\"RC%1_MIN\");\n        QString maxTpl(\"RC%1_MAX\");\n        \/\/QString trimTpl(\"RC%1_TRIM\");\n\n        \/\/ Do not write the RC type, as these values depend on this\n        \/\/ active onboard parameter\n\n        for (unsigned int i = 0; i < 8; ++i)\n        {\n            qDebug() << \"SENDING MIN\" << minTpl.arg(i+1) << rcMin[i];\n            qDebug() << \"SENDING MAX\" << maxTpl.arg(i+1) << rcMax[i];\n            m_uas->getParamManager()->setParameter(1, minTpl.arg(i+1), (float)rcMin[i]);\n            QGC::SLEEP::usleep(50000);\n            \/\/m_uas->setParameter(0, trimTpl.arg(i+1), rcTrim[i]);\n            \/\/QGC::SLEEP::usleep(50000);\n            m_uas->getParamManager()->setParameter(1, maxTpl.arg(i+1), (float)rcMax[i]);\n            QGC::SLEEP::usleep(50000);\n        }\n        ui.rollWidget->setMin(800);\n        ui.rollWidget->setMax(2200);\n        ui.pitchWidget->setMin(800);\n        ui.pitchWidget->setMax(2200);\n        ui.throttleWidget->setMin(800);\n        ui.throttleWidget->setMax(2200);\n        ui.yawWidget->setMin(800);\n        ui.yawWidget->setMax(2200);\n        ui.radio5Widget->setMin(800);\n        ui.radio5Widget->setMax(2200);\n        ui.radio6Widget->setMin(800);\n        ui.radio6Widget->setMax(2200);\n        ui.radio7Widget->setMin(800);\n        ui.radio7Widget->setMax(2200);\n        ui.radio8Widget->setMin(800);\n        ui.radio8Widget->setMax(2200);\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) 2016\n\/\/ Mehdi Goli    Codeplay Software Ltd.\n\/\/ Ralph Potter  Codeplay Software Ltd.\n\/\/ Luke Iwanski  Codeplay Software Ltd.\n\/\/ Contact: <eigen@codeplay.com>\n\/\/\n\/\/ This Source Code Form is subject to the terms of the Mozilla\n\/\/ Public License v. 2.0. If a copy of the MPL was not distributed\n\/\/ with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#define EIGEN_TEST_NO_LONGDOUBLE\n#define EIGEN_TEST_NO_COMPLEX\n#define EIGEN_TEST_FUNC cxx11_tensor_sycl_device\n#define EIGEN_DEFAULT_DENSE_INDEX_TYPE int\n#define EIGEN_USE_SYCL\n\n#include \"main.h\"\n#include <unsupported\/Eigen\/CXX11\/Tensor>\n\nvoid test_sycl_device() {\n  cl::sycl::gpu_selector s;\n  cl::sycl::queue q(s, [=](cl::sycl::exception_list l) {\n    for (const auto& e : l) {\n      try {\n        std::rethrow_exception(e);\n      } catch (cl::sycl::exception e) {\n        std::cout << e.what() << std::endl;\n      }\n    }\n  });\n  SyclDevice sycl_device(q);\n\tprintf(\"Helo from ComputeCpp: Device Exists\\n\");\n}\nvoid test_cxx11_tensor_sycl_device() {\n  CALL_SUBTEST(test_sycl_device());\n}\n<commit_msg>Fixed compilation warnings<commit_after>\/\/ This file is part of Eigen, a lightweight C++ template library\n\/\/ for linear algebra.\n\/\/\n\/\/ Copyright (C) 2016\n\/\/ Mehdi Goli    Codeplay Software Ltd.\n\/\/ Ralph Potter  Codeplay Software Ltd.\n\/\/ Luke Iwanski  Codeplay Software Ltd.\n\/\/ Contact: <eigen@codeplay.com>\n\/\/\n\/\/ This Source Code Form is subject to the terms of the Mozilla\n\/\/ Public License v. 2.0. If a copy of the MPL was not distributed\n\/\/ with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#define EIGEN_TEST_NO_LONGDOUBLE\n#define EIGEN_TEST_NO_COMPLEX\n#define EIGEN_TEST_FUNC cxx11_tensor_device_sycl\n#define EIGEN_DEFAULT_DENSE_INDEX_TYPE int\n#define EIGEN_USE_SYCL\n\n#include \"main.h\"\n#include <unsupported\/Eigen\/CXX11\/Tensor>\n\nvoid test_sycl_device() {\n  cl::sycl::gpu_selector s;\n  cl::sycl::queue q(s, [=](cl::sycl::exception_list l) {\n    for (const auto& e : l) {\n      try {\n        std::rethrow_exception(e);\n      } catch (cl::sycl::exception e) {\n        std::cout << e.what() << std::endl;\n      }\n    }\n  });\n  SyclDevice sycl_device(q);\n\tprintf(\"Helo from ComputeCpp: Device Exists\\n\");\n}\nvoid test_cxx11_tensor_device_sycl() {\n  CALL_SUBTEST(test_sycl_device());\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright Daniel Wallin 2006. Use, modification and distribution is\n\/\/ subject to the Boost Software License, Version 1.0. (See accompanying\n\/\/ file LICENSE_1_0.txt or copy at http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\n#include <boost\/python.hpp>\n#include <boost\/python\/tuple.hpp>\n#include <libtorrent\/torrent_handle.hpp>\n#include <libtorrent\/peer_info.hpp>\n#include <boost\/lexical_cast.hpp>\n#include \"gil.hpp\"\n\nusing namespace boost::python;\nusing namespace libtorrent;\n\nnamespace\n{\n\n  list url_seeds(torrent_handle& handle)\n  {\n      list ret;\n      std::set<std::string> urls;\n      {\n          allow_threading_guard guard;\n          urls = handle.url_seeds();\n      }\n\n      for (std::set<std::string>::iterator i(urls.begin())\n          , end(urls.end()); i != end; ++i)\n          ret.append(*i);\n      return ret;\n  }\n\n  list piece_availability(torrent_handle& handle)\n  {\n      list ret;\n      std::vector<int> avail;\n      {\n          allow_threading_guard guard;\n          handle.piece_availability(avail);\n      }\n\n      for (std::vector<int>::iterator i(avail.begin())\n          , end(avail.end()); i != end; ++i)\n          ret.append(*i);\n      return ret;\n  }\n\n  list piece_priorities(torrent_handle& handle)\n  {\n      list ret;\n      std::vector<int> prio;\n      {\n          allow_threading_guard guard;\n          prio = handle.piece_priorities();\n      }\n\n      for (std::vector<int>::iterator i(prio.begin())\n          , end(prio.end()); i != end; ++i)\n          ret.append(*i);\n      return ret;\n  }\n\n} \/\/ namespace unnamed\n\nlist file_progress(torrent_handle& handle)\n{\n    std::vector<size_type> p;\n\n    {\n        allow_threading_guard guard;\n        p.reserve(handle.get_torrent_info().num_files());\n        handle.file_progress(p);\n    }\n\n    list result;\n\n    for (std::vector<size_type>::iterator i(p.begin()), e(p.end()); i != e; ++i)\n        result.append(*i);\n\n    return result;\n}\n\nlist get_peer_info(torrent_handle const& handle)\n{\n    std::vector<peer_info> pi;\n\n    {\n        allow_threading_guard guard;\n        handle.get_peer_info(pi);\n    }\n\n    list result;\n\n    for (std::vector<peer_info>::iterator i = pi.begin(); i != pi.end(); ++i)\n        result.append(*i);\n\n    return result;\n}\n\nvoid prioritize_pieces(torrent_handle& info, object o)\n{\n   std::vector<int> result;\n   try\n   {\n      object iter_obj = object( handle<>( PyObject_GetIter( o.ptr() ) ));\n      while( 1 )\n      {\n         object obj = extract<object>( iter_obj.attr( \"next\" )() );\n         result.push_back(extract<int const>( obj ));\n      }\n   }\n   catch( error_already_set )\n   {\n      PyErr_Clear();\n      info.prioritize_pieces(result);\n      return;\n   }\n}\n\nvoid prioritize_files(torrent_handle& info, object o)\n{\n   std::vector<int> result;\n   try\n   {\n      object iter_obj = object( handle<>( PyObject_GetIter( o.ptr() ) ));\n      while( 1 )\n      {\n         object obj = extract<object>( iter_obj.attr( \"next\" )() );\n         result.push_back(extract<int const>( obj ));\n      }\n   }\n   catch( error_already_set )\n   {\n      PyErr_Clear();\n      info.prioritize_files(result);\n      return;\n   }\n}\n\nlist file_priorities(torrent_handle& handle)\n{\n    list ret;\n    std::vector<int> priorities = handle.file_priorities();\n\n    for (std::vector<int>::iterator i = priorities.begin(); i != priorities.end(); ++i)\n        ret.append(*i);\n\n    return ret;\n}\n\nvoid replace_trackers(torrent_handle& h, object trackers)\n{\n    object iter(trackers.attr(\"__iter__\")());\n\n    std::vector<announce_entry> result;\n\n    for (;;)\n    {\n        handle<> entry(allow_null(PyIter_Next(iter.ptr())));\n\n        if (entry == handle<>())\n            break;\n\n        result.push_back(extract<announce_entry const&>(object(entry)));\n    }\n\n    allow_threading_guard guard;\n    h.replace_trackers(result);\n}\n\nlist trackers(torrent_handle &h)\n{\n    list ret;\n    std::vector<announce_entry> const trackers = h.trackers();\n    for (std::vector<announce_entry>::const_iterator i = trackers.begin(), end(trackers.end()); i != end; ++i)\n    {\n        dict d;\n        d[\"url\"] = i->url;\n        d[\"tier\"] = i->tier;\n        d[\"fail_limit\"] = i->fail_limit;\n        d[\"fails\"] = i->fails;\n        d[\"source\"] = i->source;\n        d[\"verified\"] = i->verified;\n        d[\"updating\"] = i->updating;\n        d[\"start_sent\"] = i->start_sent;\n        d[\"complete_sent\"] = i->complete_sent;\n        ret.append(d);\n    }\n    return ret;\n}\n\nlist get_download_queue(torrent_handle& handle)\n{\n    using boost::python::make_tuple;\n\n    list ret;\n\n    std::vector<partial_piece_info> downloading;\n\n    {\n        allow_threading_guard guard;\n        handle.get_download_queue(downloading);\n    }\n\n    for (std::vector<partial_piece_info>::iterator i = downloading.begin()\n        , end(downloading.end()); i != end; ++i)\n    {\n        dict partial_piece;\n        partial_piece[\"piece_index\"] = i->piece_index;\n        partial_piece[\"blocks_in_piece\"] = i->blocks_in_piece;\n        list block_list;\n        for (int k = 0; k < i->blocks_in_piece; ++k)\n        {\n            dict block_info;\n            block_info[\"state\"] = i->blocks[k].state;\n            block_info[\"num_peers\"] = i->blocks[k].num_peers;\n            block_info[\"bytes_progress\"] = i->blocks[k].bytes_progress;\n            block_info[\"block_size\"] = i->blocks[k].block_size;\n            block_info[\"peer\"] = make_tuple(\n                boost::lexical_cast<std::string>(i->blocks[k].peer().address()), i->blocks[k].peer().port());\n            block_list.append(block_info);\n        }\n        partial_piece[\"blocks\"] = block_list;\n\n        ret.append(partial_piece);\n    }\n\n    return ret;\n}\n\nnamespace\n{\n    tcp::endpoint tuple_to_endpoint(tuple const& t)\n    {\n        return tcp::endpoint(address::from_string(extract<std::string>(t[0])), extract<int>(t[1]));\n    }\n}\n\nvoid force_reannounce(torrent_handle& th, int s)\n{\n    th.force_reannounce(boost::posix_time::seconds(s));\n}\n\nvoid connect_peer(torrent_handle& th, tuple ip, int source)\n{\n    th.connect_peer(tuple_to_endpoint(ip), source);\n}\n\nvoid set_peer_upload_limit(torrent_handle& th, tuple const& ip, int limit)\n{\n    th.set_peer_upload_limit(tuple_to_endpoint(ip), limit);\n}\n\nvoid set_peer_download_limit(torrent_handle& th, tuple const& ip, int limit)\n{\n    th.set_peer_download_limit(tuple_to_endpoint(ip), limit);\n}\n\nvoid add_piece(torrent_handle& th, int piece, char const *data, int flags)\n{\n   th.add_piece(piece, data, flags);\n}\n\nvoid bind_torrent_handle()\n{\n    void (torrent_handle::*force_reannounce0)() const = &torrent_handle::force_reannounce;\n\n    int (torrent_handle::*piece_priority0)(int) const = &torrent_handle::piece_priority;\n    void (torrent_handle::*piece_priority1)(int, int) const = &torrent_handle::piece_priority;\n\n    void (torrent_handle::*move_storage0)(std::string const&) const = &torrent_handle::move_storage;\n    void (torrent_handle::*rename_file0)(int, std::string const&) const = &torrent_handle::rename_file;\n\n#if TORRENT_USE_WSTRING\n    void (torrent_handle::*move_storage1)(std::wstring const&) const = &torrent_handle::move_storage;\n    void (torrent_handle::*rename_file1)(int, std::wstring const&) const = &torrent_handle::rename_file;\n#endif\n\n#ifndef TORRENT_DISABLE_RESOLVE_COUNTRIES\n    bool (torrent_handle::*resolve_countries0)() const = &torrent_handle::resolve_countries;\n    void (torrent_handle::*resolve_countries1)(bool) = &torrent_handle::resolve_countries;\n#endif\n\n#define _ allow_threads\n\n    class_<torrent_handle>(\"torrent_handle\")\n        .def(\"get_peer_info\", get_peer_info)\n        .def(\"status\", _(&torrent_handle::status))\n        .def(\"get_download_queue\", get_download_queue)\n        .def(\"file_progress\", file_progress)\n        .def(\"trackers\", trackers)\n        .def(\"replace_trackers\", replace_trackers)\n        .def(\"add_url_seed\", _(&torrent_handle::add_url_seed))\n        .def(\"remove_url_seed\", _(&torrent_handle::remove_url_seed))\n        .def(\"url_seeds\", url_seeds)\n        .def(\"has_metadata\", _(&torrent_handle::has_metadata))\n        .def(\"get_torrent_info\", _(&torrent_handle::get_torrent_info), return_internal_reference<>())\n        .def(\"is_valid\", _(&torrent_handle::is_valid))\n        .def(\"is_seed\", _(&torrent_handle::is_seed))\n        .def(\"is_finished\", _(&torrent_handle::is_finished))\n        .def(\"is_paused\", _(&torrent_handle::is_paused))\n        .def(\"pause\", _(&torrent_handle::pause), arg(\"flags\") = 0)\n        .def(\"resume\", _(&torrent_handle::resume))\n        .def(\"clear_error\", _(&torrent_handle::clear_error))\n        .def(\"set_priority\", _(&torrent_handle::set_priority))\n\n        .def(\"is_auto_managed\", _(&torrent_handle::is_auto_managed))\n        .def(\"auto_managed\", _(&torrent_handle::auto_managed))\n        .def(\"queue_position\", _(&torrent_handle::queue_position))\n        .def(\"queue_position_up\", _(&torrent_handle::queue_position_up))\n        .def(\"queue_position_down\", _(&torrent_handle::queue_position_down))\n        .def(\"queue_position_top\", _(&torrent_handle::queue_position_top))\n        .def(\"queue_position_bottom\", _(&torrent_handle::queue_position_bottom))\n\n#ifndef TORRENT_DISABLE_RESOLVE_COUNTRIES\n        .def(\"resolve_countries\", _(resolve_countries0))\n        .def(\"resolve_countries\", _(resolve_countries1))\n#endif\n        \/\/ deprecated\n#ifndef TORRENT_NO_DEPRECATE\n        .def(\"filter_piece\", _(&torrent_handle::filter_piece))\n        .def(\"is_piece_filtered\", _(&torrent_handle::is_piece_filtered))\n        .def(\"write_resume_data\", _(&torrent_handle::write_resume_data))\n#endif\n        .def(\"add_piece\", add_piece)\n        .def(\"read_piece\", _(&torrent_handle::read_piece))\n        .def(\"set_piece_deadline\", _(&torrent_handle::set_piece_deadline)\n            , (arg(\"index\"), arg(\"deadline\"), arg(\"flags\") = 0))\n        .def(\"piece_availability\", &piece_availability)\n        .def(\"piece_priority\", _(piece_priority0))\n        .def(\"piece_priority\", _(piece_priority1))\n        .def(\"prioritize_pieces\", &prioritize_pieces)\n        .def(\"piece_priorities\", &piece_priorities)\n        .def(\"prioritize_files\", &prioritize_files)\n        .def(\"file_priorities\", &file_priorities)\n        .def(\"use_interface\", &torrent_handle::use_interface)\n        .def(\"save_resume_data\", _(&torrent_handle::save_resume_data), arg(\"flags\" = 0))\n        .def(\"need_save_resume_data\", _(&torrent_handle::need_save_resume_data))\n        .def(\"force_reannounce\", _(force_reannounce0))\n        .def(\"force_reannounce\", &force_reannounce)\n        .def(\"force_dht_announce\", _(&torrent_handle::force_dht_announce))\n        .def(\"scrape_tracker\", _(&torrent_handle::scrape_tracker))\n        .def(\"name\", _(&torrent_handle::name))\n        .def(\"set_upload_mode\", _(&torrent_handle::set_upload_mode))\n        .def(\"set_share_mode\", _(&torrent_handle::set_share_mode))\n        .def(\"set_upload_limit\", _(&torrent_handle::set_upload_limit))\n        .def(\"upload_limit\", _(&torrent_handle::upload_limit))\n        .def(\"set_download_limit\", _(&torrent_handle::set_download_limit))\n        .def(\"download_limit\", _(&torrent_handle::download_limit))\n        .def(\"set_sequential_download\", _(&torrent_handle::set_sequential_download))\n        .def(\"set_peer_upload_limit\", &set_peer_upload_limit)\n        .def(\"set_peer_download_limit\", &set_peer_download_limit)\n        .def(\"connect_peer\", &connect_peer)\n        .def(\"set_ratio\", _(&torrent_handle::set_ratio))\n        .def(\"save_path\", _(&torrent_handle::save_path))\n        .def(\"set_max_uploads\", _(&torrent_handle::set_max_uploads))\n        .def(\"set_max_connections\", _(&torrent_handle::set_max_connections))\n        .def(\"set_tracker_login\", _(&torrent_handle::set_tracker_login))\n        .def(\"move_storage\", _(move_storage0))\n        .def(\"info_hash\", _(&torrent_handle::info_hash))\n        .def(\"force_recheck\", _(&torrent_handle::force_recheck))\n        .def(\"rename_file\", _(rename_file0))\n#if TORRENT_USE_WSTRING\n        .def(\"move_storage\", _(move_storage1))\n        .def(\"rename_file\", _(rename_file1))\n#endif\n        ;\n\n    enum_<torrent_handle::save_resume_flags_t>(\"pause_flags_t\")\n        .value(\"graceful_pause\", torrent_handle::graceful_pause)\n    ;\n\n    enum_<torrent_handle::save_resume_flags_t>(\"save_resume_flags_t\")\n        .value(\"flush_disk_cache\", torrent_handle::flush_disk_cache)\n    ;\n\n    enum_<torrent_handle::deadline_flags>(\"deadline_flags\")\n        .value(\"alert_when_available\", torrent_handle::alert_when_available)\n    ;\n\n}\n<commit_msg>fixed typos in python binding<commit_after>\/\/ Copyright Daniel Wallin 2006. Use, modification and distribution is\n\/\/ subject to the Boost Software License, Version 1.0. (See accompanying\n\/\/ file LICENSE_1_0.txt or copy at http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\n#include <boost\/python.hpp>\n#include <boost\/python\/tuple.hpp>\n#include <libtorrent\/torrent_handle.hpp>\n#include <libtorrent\/peer_info.hpp>\n#include <boost\/lexical_cast.hpp>\n#include \"gil.hpp\"\n\nusing namespace boost::python;\nusing namespace libtorrent;\n\nnamespace\n{\n\n  list url_seeds(torrent_handle& handle)\n  {\n      list ret;\n      std::set<std::string> urls;\n      {\n          allow_threading_guard guard;\n          urls = handle.url_seeds();\n      }\n\n      for (std::set<std::string>::iterator i(urls.begin())\n          , end(urls.end()); i != end; ++i)\n          ret.append(*i);\n      return ret;\n  }\n\n  list piece_availability(torrent_handle& handle)\n  {\n      list ret;\n      std::vector<int> avail;\n      {\n          allow_threading_guard guard;\n          handle.piece_availability(avail);\n      }\n\n      for (std::vector<int>::iterator i(avail.begin())\n          , end(avail.end()); i != end; ++i)\n          ret.append(*i);\n      return ret;\n  }\n\n  list piece_priorities(torrent_handle& handle)\n  {\n      list ret;\n      std::vector<int> prio;\n      {\n          allow_threading_guard guard;\n          prio = handle.piece_priorities();\n      }\n\n      for (std::vector<int>::iterator i(prio.begin())\n          , end(prio.end()); i != end; ++i)\n          ret.append(*i);\n      return ret;\n  }\n\n} \/\/ namespace unnamed\n\nlist file_progress(torrent_handle& handle)\n{\n    std::vector<size_type> p;\n\n    {\n        allow_threading_guard guard;\n        p.reserve(handle.get_torrent_info().num_files());\n        handle.file_progress(p);\n    }\n\n    list result;\n\n    for (std::vector<size_type>::iterator i(p.begin()), e(p.end()); i != e; ++i)\n        result.append(*i);\n\n    return result;\n}\n\nlist get_peer_info(torrent_handle const& handle)\n{\n    std::vector<peer_info> pi;\n\n    {\n        allow_threading_guard guard;\n        handle.get_peer_info(pi);\n    }\n\n    list result;\n\n    for (std::vector<peer_info>::iterator i = pi.begin(); i != pi.end(); ++i)\n        result.append(*i);\n\n    return result;\n}\n\nvoid prioritize_pieces(torrent_handle& info, object o)\n{\n   std::vector<int> result;\n   try\n   {\n      object iter_obj = object( handle<>( PyObject_GetIter( o.ptr() ) ));\n      while( 1 )\n      {\n         object obj = extract<object>( iter_obj.attr( \"next\" )() );\n         result.push_back(extract<int const>( obj ));\n      }\n   }\n   catch( error_already_set )\n   {\n      PyErr_Clear();\n      info.prioritize_pieces(result);\n      return;\n   }\n}\n\nvoid prioritize_files(torrent_handle& info, object o)\n{\n   std::vector<int> result;\n   try\n   {\n      object iter_obj = object( handle<>( PyObject_GetIter( o.ptr() ) ));\n      while( 1 )\n      {\n         object obj = extract<object>( iter_obj.attr( \"next\" )() );\n         result.push_back(extract<int const>( obj ));\n      }\n   }\n   catch( error_already_set )\n   {\n      PyErr_Clear();\n      info.prioritize_files(result);\n      return;\n   }\n}\n\nlist file_priorities(torrent_handle& handle)\n{\n    list ret;\n    std::vector<int> priorities = handle.file_priorities();\n\n    for (std::vector<int>::iterator i = priorities.begin(); i != priorities.end(); ++i)\n        ret.append(*i);\n\n    return ret;\n}\n\nvoid replace_trackers(torrent_handle& h, object trackers)\n{\n    object iter(trackers.attr(\"__iter__\")());\n\n    std::vector<announce_entry> result;\n\n    for (;;)\n    {\n        handle<> entry(allow_null(PyIter_Next(iter.ptr())));\n\n        if (entry == handle<>())\n            break;\n\n        result.push_back(extract<announce_entry const&>(object(entry)));\n    }\n\n    allow_threading_guard guard;\n    h.replace_trackers(result);\n}\n\nlist trackers(torrent_handle &h)\n{\n    list ret;\n    std::vector<announce_entry> const trackers = h.trackers();\n    for (std::vector<announce_entry>::const_iterator i = trackers.begin(), end(trackers.end()); i != end; ++i)\n    {\n        dict d;\n        d[\"url\"] = i->url;\n        d[\"tier\"] = i->tier;\n        d[\"fail_limit\"] = i->fail_limit;\n        d[\"fails\"] = i->fails;\n        d[\"source\"] = i->source;\n        d[\"verified\"] = i->verified;\n        d[\"updating\"] = i->updating;\n        d[\"start_sent\"] = i->start_sent;\n        d[\"complete_sent\"] = i->complete_sent;\n        ret.append(d);\n    }\n    return ret;\n}\n\nlist get_download_queue(torrent_handle& handle)\n{\n    using boost::python::make_tuple;\n\n    list ret;\n\n    std::vector<partial_piece_info> downloading;\n\n    {\n        allow_threading_guard guard;\n        handle.get_download_queue(downloading);\n    }\n\n    for (std::vector<partial_piece_info>::iterator i = downloading.begin()\n        , end(downloading.end()); i != end; ++i)\n    {\n        dict partial_piece;\n        partial_piece[\"piece_index\"] = i->piece_index;\n        partial_piece[\"blocks_in_piece\"] = i->blocks_in_piece;\n        list block_list;\n        for (int k = 0; k < i->blocks_in_piece; ++k)\n        {\n            dict block_info;\n            block_info[\"state\"] = i->blocks[k].state;\n            block_info[\"num_peers\"] = i->blocks[k].num_peers;\n            block_info[\"bytes_progress\"] = i->blocks[k].bytes_progress;\n            block_info[\"block_size\"] = i->blocks[k].block_size;\n            block_info[\"peer\"] = make_tuple(\n                boost::lexical_cast<std::string>(i->blocks[k].peer().address()), i->blocks[k].peer().port());\n            block_list.append(block_info);\n        }\n        partial_piece[\"blocks\"] = block_list;\n\n        ret.append(partial_piece);\n    }\n\n    return ret;\n}\n\nnamespace\n{\n    tcp::endpoint tuple_to_endpoint(tuple const& t)\n    {\n        return tcp::endpoint(address::from_string(extract<std::string>(t[0])), extract<int>(t[1]));\n    }\n}\n\nvoid force_reannounce(torrent_handle& th, int s)\n{\n    th.force_reannounce(boost::posix_time::seconds(s));\n}\n\nvoid connect_peer(torrent_handle& th, tuple ip, int source)\n{\n    th.connect_peer(tuple_to_endpoint(ip), source);\n}\n\nvoid set_peer_upload_limit(torrent_handle& th, tuple const& ip, int limit)\n{\n    th.set_peer_upload_limit(tuple_to_endpoint(ip), limit);\n}\n\nvoid set_peer_download_limit(torrent_handle& th, tuple const& ip, int limit)\n{\n    th.set_peer_download_limit(tuple_to_endpoint(ip), limit);\n}\n\nvoid add_piece(torrent_handle& th, int piece, char const *data, int flags)\n{\n   th.add_piece(piece, data, flags);\n}\n\nvoid bind_torrent_handle()\n{\n    void (torrent_handle::*force_reannounce0)() const = &torrent_handle::force_reannounce;\n\n    int (torrent_handle::*piece_priority0)(int) const = &torrent_handle::piece_priority;\n    void (torrent_handle::*piece_priority1)(int, int) const = &torrent_handle::piece_priority;\n\n    void (torrent_handle::*move_storage0)(std::string const&) const = &torrent_handle::move_storage;\n    void (torrent_handle::*rename_file0)(int, std::string const&) const = &torrent_handle::rename_file;\n\n#if TORRENT_USE_WSTRING\n    void (torrent_handle::*move_storage1)(std::wstring const&) const = &torrent_handle::move_storage;\n    void (torrent_handle::*rename_file1)(int, std::wstring const&) const = &torrent_handle::rename_file;\n#endif\n\n#ifndef TORRENT_DISABLE_RESOLVE_COUNTRIES\n    bool (torrent_handle::*resolve_countries0)() const = &torrent_handle::resolve_countries;\n    void (torrent_handle::*resolve_countries1)(bool) = &torrent_handle::resolve_countries;\n#endif\n\n#define _ allow_threads\n\n    class_<torrent_handle>(\"torrent_handle\")\n        .def(\"get_peer_info\", get_peer_info)\n        .def(\"status\", _(&torrent_handle::status))\n        .def(\"get_download_queue\", get_download_queue)\n        .def(\"file_progress\", file_progress)\n        .def(\"trackers\", trackers)\n        .def(\"replace_trackers\", replace_trackers)\n        .def(\"add_url_seed\", _(&torrent_handle::add_url_seed))\n        .def(\"remove_url_seed\", _(&torrent_handle::remove_url_seed))\n        .def(\"url_seeds\", url_seeds)\n        .def(\"has_metadata\", _(&torrent_handle::has_metadata))\n        .def(\"get_torrent_info\", _(&torrent_handle::get_torrent_info), return_internal_reference<>())\n        .def(\"is_valid\", _(&torrent_handle::is_valid))\n        .def(\"is_seed\", _(&torrent_handle::is_seed))\n        .def(\"is_finished\", _(&torrent_handle::is_finished))\n        .def(\"is_paused\", _(&torrent_handle::is_paused))\n        .def(\"pause\", _(&torrent_handle::pause), arg(\"flags\") = 0)\n        .def(\"resume\", _(&torrent_handle::resume))\n        .def(\"clear_error\", _(&torrent_handle::clear_error))\n        .def(\"set_priority\", _(&torrent_handle::set_priority))\n\n        .def(\"is_auto_managed\", _(&torrent_handle::is_auto_managed))\n        .def(\"auto_managed\", _(&torrent_handle::auto_managed))\n        .def(\"queue_position\", _(&torrent_handle::queue_position))\n        .def(\"queue_position_up\", _(&torrent_handle::queue_position_up))\n        .def(\"queue_position_down\", _(&torrent_handle::queue_position_down))\n        .def(\"queue_position_top\", _(&torrent_handle::queue_position_top))\n        .def(\"queue_position_bottom\", _(&torrent_handle::queue_position_bottom))\n\n#ifndef TORRENT_DISABLE_RESOLVE_COUNTRIES\n        .def(\"resolve_countries\", _(resolve_countries0))\n        .def(\"resolve_countries\", _(resolve_countries1))\n#endif\n        \/\/ deprecated\n#ifndef TORRENT_NO_DEPRECATE\n        .def(\"filter_piece\", _(&torrent_handle::filter_piece))\n        .def(\"is_piece_filtered\", _(&torrent_handle::is_piece_filtered))\n        .def(\"write_resume_data\", _(&torrent_handle::write_resume_data))\n#endif\n        .def(\"add_piece\", add_piece)\n        .def(\"read_piece\", _(&torrent_handle::read_piece))\n        .def(\"set_piece_deadline\", _(&torrent_handle::set_piece_deadline)\n            , (arg(\"index\"), arg(\"deadline\"), arg(\"flags\") = 0))\n        .def(\"piece_availability\", &piece_availability)\n        .def(\"piece_priority\", _(piece_priority0))\n        .def(\"piece_priority\", _(piece_priority1))\n        .def(\"prioritize_pieces\", &prioritize_pieces)\n        .def(\"piece_priorities\", &piece_priorities)\n        .def(\"prioritize_files\", &prioritize_files)\n        .def(\"file_priorities\", &file_priorities)\n        .def(\"use_interface\", &torrent_handle::use_interface)\n        .def(\"save_resume_data\", _(&torrent_handle::save_resume_data), arg(\"flags\") = 0)\n        .def(\"need_save_resume_data\", _(&torrent_handle::need_save_resume_data))\n        .def(\"force_reannounce\", _(force_reannounce0))\n        .def(\"force_reannounce\", &force_reannounce)\n        .def(\"force_dht_announce\", _(&torrent_handle::force_dht_announce))\n        .def(\"scrape_tracker\", _(&torrent_handle::scrape_tracker))\n        .def(\"name\", _(&torrent_handle::name))\n        .def(\"set_upload_mode\", _(&torrent_handle::set_upload_mode))\n        .def(\"set_share_mode\", _(&torrent_handle::set_share_mode))\n        .def(\"set_upload_limit\", _(&torrent_handle::set_upload_limit))\n        .def(\"upload_limit\", _(&torrent_handle::upload_limit))\n        .def(\"set_download_limit\", _(&torrent_handle::set_download_limit))\n        .def(\"download_limit\", _(&torrent_handle::download_limit))\n        .def(\"set_sequential_download\", _(&torrent_handle::set_sequential_download))\n        .def(\"set_peer_upload_limit\", &set_peer_upload_limit)\n        .def(\"set_peer_download_limit\", &set_peer_download_limit)\n        .def(\"connect_peer\", &connect_peer)\n        .def(\"set_ratio\", _(&torrent_handle::set_ratio))\n        .def(\"save_path\", _(&torrent_handle::save_path))\n        .def(\"set_max_uploads\", _(&torrent_handle::set_max_uploads))\n        .def(\"set_max_connections\", _(&torrent_handle::set_max_connections))\n        .def(\"set_tracker_login\", _(&torrent_handle::set_tracker_login))\n        .def(\"move_storage\", _(move_storage0))\n        .def(\"info_hash\", _(&torrent_handle::info_hash))\n        .def(\"force_recheck\", _(&torrent_handle::force_recheck))\n        .def(\"rename_file\", _(rename_file0))\n#if TORRENT_USE_WSTRING\n        .def(\"move_storage\", _(move_storage1))\n        .def(\"rename_file\", _(rename_file1))\n#endif\n        ;\n\n    enum_<torrent_handle::pause_flags_t>(\"pause_flags_t\")\n        .value(\"graceful_pause\", torrent_handle::graceful_pause)\n    ;\n\n    enum_<torrent_handle::save_resume_flags_t>(\"save_resume_flags_t\")\n        .value(\"flush_disk_cache\", torrent_handle::flush_disk_cache)\n    ;\n\n    enum_<torrent_handle::deadline_flags>(\"deadline_flags\")\n        .value(\"alert_when_available\", torrent_handle::alert_when_available)\n    ;\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: cvtgrf.cxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: vg $ $Date: 2004-01-06 13:35: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 _SV_SVSYS_HXX\n#include <svsys.h>\n#endif\n#ifndef _SV_METAACT_HXX\n#include <metaact.hxx>\n#endif\n#ifndef _SV_SALINST_HXX\n#include <salinst.hxx>\n#endif\n#ifndef _SV_SVDATA_HXX\n#include <svdata.hxx>\n#endif\n#ifndef _SV_CVTGRF_HXX\n#include <cvtgrf.hxx>\n#endif\n\n\/\/ --------------\n\/\/ - Callback   -\n\/\/ --------------\n\n\/\/ --------------------\n\/\/ - GraphicConverter -\n\/\/ --------------------\n\nGraphicConverter::GraphicConverter() :\n    mpConvertData( NULL )\n{\n}\n\n\/\/ ------------------------------------------------------------------------\n\nGraphicConverter::~GraphicConverter()\n{\n}\n\n\/\/ ------------------------------------------------------------------------\n\nULONG GraphicConverter::ImplConvert( ULONG nInFormat, void* pInBuffer, ULONG nInBufSize,\n                                     void** ppOutBuffer, ULONG nOutFormat )\n{\n    ULONG nRetBufSize = 0UL;\n\n    if( ( nInFormat != nOutFormat ) && pInBuffer )\n    {\n        if( ( nInFormat == CVT_SVM ) || ( nInFormat == CVT_BMP ) )\n        {\n            SvMemoryStream  aIStm;\n            Graphic         aGraphic;\n\n            aIStm.SetBuffer( (char*) pInBuffer, nInBufSize, FALSE, nInBufSize );\n            aIStm >> aGraphic;\n\n            if( !aIStm.GetError() )\n            {\n                SvMemoryStream aOStm( 64535, 64535 );\n\n                mpConvertData = new ConvertData( aGraphic, aOStm, nOutFormat );\n\n                if( maFilterHdl.IsSet() && maFilterHdl.Call( mpConvertData ) )\n                {\n                    nRetBufSize = aOStm.Seek( STREAM_SEEK_TO_END );\n                    *ppOutBuffer = (void*) aOStm.GetData();\n                    aOStm.ObjectOwnsMemory( FALSE );\n                }\n\n                delete mpConvertData;\n                mpConvertData = NULL;\n            }\n        }\n        else if( ( nOutFormat == CVT_SVM ) || ( nOutFormat == CVT_BMP ) )\n        {\n            SvMemoryStream  aIStm;\n\n            aIStm.SetBuffer( (char*) pInBuffer, nInBufSize, FALSE, nInBufSize );\n            mpConvertData = new ConvertData( Graphic(), aIStm, nInFormat );\n\n            if( maFilterHdl.IsSet() && maFilterHdl.Call( mpConvertData ) )\n            {\n                SvMemoryStream  aOStm( 645535, 64535 );\n                Graphic&        rGraphic = mpConvertData->maGraphic;\n\n                if( ( rGraphic.GetType() == GRAPHIC_BITMAP ) && ( CVT_SVM == nOutFormat ) )\n                {\n                    GDIMetaFile aMtf;\n\n                    aMtf.SetPrefSize( rGraphic.GetPrefSize() );\n                    aMtf.SetPrefMapMode( rGraphic.GetPrefMapMode() );\n                    aMtf.AddAction( new MetaBmpExScaleAction( Point(), aMtf.GetPrefSize(), rGraphic.GetBitmapEx() ) );\n                    rGraphic = aMtf;\n                }\n                else if( ( rGraphic.GetType() == GRAPHIC_GDIMETAFILE ) && ( CVT_BMP == nOutFormat ) )\n                    rGraphic = rGraphic.GetBitmapEx();\n\n                aOStm << rGraphic;\n\n                if( !aOStm.GetError() )\n                {\n                    nRetBufSize = aOStm.Seek( STREAM_SEEK_TO_END );\n                    *ppOutBuffer = (void*) aOStm.GetData();\n                    aOStm.ObjectOwnsMemory( FALSE );\n                }\n            }\n\n            delete mpConvertData;\n            mpConvertData = NULL;\n        }\n    }\n\n    return nRetBufSize;\n}\n\n\/\/ ------------------------------------------------------------------------\n\nULONG GraphicConverter::Import( SvStream& rIStm, Graphic& rGraphic, ULONG nFormat )\n{\n    GraphicConverter*   pCvt = ImplGetSVData()->maGDIData.mpGrfConverter;\n    ULONG               nRet = ERRCODE_IO_GENERAL;\n\n    if( pCvt && pCvt->GetFilterHdl().IsSet() )\n    {\n        ConvertData aData( rGraphic, rIStm, nFormat );\n\n        if( pCvt->GetFilterHdl().Call( &aData ) )\n        {\n            rGraphic = aData.maGraphic;\n            nRet = ERRCODE_NONE;\n        }\n        else if( rIStm.GetError() )\n            nRet = rIStm.GetError();\n    }\n\n    return nRet;\n}\n\n\/\/ ------------------------------------------------------------------------\n\nULONG GraphicConverter::Export( SvStream& rOStm, const Graphic& rGraphic, ULONG nFormat )\n{\n    GraphicConverter*   pCvt = ImplGetSVData()->maGDIData.mpGrfConverter;\n    ULONG               nRet = ERRCODE_IO_GENERAL;\n\n    if( pCvt && pCvt->GetFilterHdl().IsSet() )\n    {\n        ConvertData aData( rGraphic, rOStm, nFormat );\n\n        if( pCvt->GetFilterHdl().Call( &aData ) )\n            nRet = ERRCODE_NONE;\n        else if( rOStm.GetError() )\n            nRet = rOStm.GetError();\n    }\n\n    return nRet;\n}\n<commit_msg>INTEGRATION: CWS ooo19126 (1.4.546); FILE MERGED 2005\/09\/05 14:44:48 rt 1.4.546.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: cvtgrf.cxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 11:56:14 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n#ifndef _SV_SVSYS_HXX\n#include <svsys.h>\n#endif\n#ifndef _SV_METAACT_HXX\n#include <metaact.hxx>\n#endif\n#ifndef _SV_SALINST_HXX\n#include <salinst.hxx>\n#endif\n#ifndef _SV_SVDATA_HXX\n#include <svdata.hxx>\n#endif\n#ifndef _SV_CVTGRF_HXX\n#include <cvtgrf.hxx>\n#endif\n\n\/\/ --------------\n\/\/ - Callback   -\n\/\/ --------------\n\n\/\/ --------------------\n\/\/ - GraphicConverter -\n\/\/ --------------------\n\nGraphicConverter::GraphicConverter() :\n    mpConvertData( NULL )\n{\n}\n\n\/\/ ------------------------------------------------------------------------\n\nGraphicConverter::~GraphicConverter()\n{\n}\n\n\/\/ ------------------------------------------------------------------------\n\nULONG GraphicConverter::ImplConvert( ULONG nInFormat, void* pInBuffer, ULONG nInBufSize,\n                                     void** ppOutBuffer, ULONG nOutFormat )\n{\n    ULONG nRetBufSize = 0UL;\n\n    if( ( nInFormat != nOutFormat ) && pInBuffer )\n    {\n        if( ( nInFormat == CVT_SVM ) || ( nInFormat == CVT_BMP ) )\n        {\n            SvMemoryStream  aIStm;\n            Graphic         aGraphic;\n\n            aIStm.SetBuffer( (char*) pInBuffer, nInBufSize, FALSE, nInBufSize );\n            aIStm >> aGraphic;\n\n            if( !aIStm.GetError() )\n            {\n                SvMemoryStream aOStm( 64535, 64535 );\n\n                mpConvertData = new ConvertData( aGraphic, aOStm, nOutFormat );\n\n                if( maFilterHdl.IsSet() && maFilterHdl.Call( mpConvertData ) )\n                {\n                    nRetBufSize = aOStm.Seek( STREAM_SEEK_TO_END );\n                    *ppOutBuffer = (void*) aOStm.GetData();\n                    aOStm.ObjectOwnsMemory( FALSE );\n                }\n\n                delete mpConvertData;\n                mpConvertData = NULL;\n            }\n        }\n        else if( ( nOutFormat == CVT_SVM ) || ( nOutFormat == CVT_BMP ) )\n        {\n            SvMemoryStream  aIStm;\n\n            aIStm.SetBuffer( (char*) pInBuffer, nInBufSize, FALSE, nInBufSize );\n            mpConvertData = new ConvertData( Graphic(), aIStm, nInFormat );\n\n            if( maFilterHdl.IsSet() && maFilterHdl.Call( mpConvertData ) )\n            {\n                SvMemoryStream  aOStm( 645535, 64535 );\n                Graphic&        rGraphic = mpConvertData->maGraphic;\n\n                if( ( rGraphic.GetType() == GRAPHIC_BITMAP ) && ( CVT_SVM == nOutFormat ) )\n                {\n                    GDIMetaFile aMtf;\n\n                    aMtf.SetPrefSize( rGraphic.GetPrefSize() );\n                    aMtf.SetPrefMapMode( rGraphic.GetPrefMapMode() );\n                    aMtf.AddAction( new MetaBmpExScaleAction( Point(), aMtf.GetPrefSize(), rGraphic.GetBitmapEx() ) );\n                    rGraphic = aMtf;\n                }\n                else if( ( rGraphic.GetType() == GRAPHIC_GDIMETAFILE ) && ( CVT_BMP == nOutFormat ) )\n                    rGraphic = rGraphic.GetBitmapEx();\n\n                aOStm << rGraphic;\n\n                if( !aOStm.GetError() )\n                {\n                    nRetBufSize = aOStm.Seek( STREAM_SEEK_TO_END );\n                    *ppOutBuffer = (void*) aOStm.GetData();\n                    aOStm.ObjectOwnsMemory( FALSE );\n                }\n            }\n\n            delete mpConvertData;\n            mpConvertData = NULL;\n        }\n    }\n\n    return nRetBufSize;\n}\n\n\/\/ ------------------------------------------------------------------------\n\nULONG GraphicConverter::Import( SvStream& rIStm, Graphic& rGraphic, ULONG nFormat )\n{\n    GraphicConverter*   pCvt = ImplGetSVData()->maGDIData.mpGrfConverter;\n    ULONG               nRet = ERRCODE_IO_GENERAL;\n\n    if( pCvt && pCvt->GetFilterHdl().IsSet() )\n    {\n        ConvertData aData( rGraphic, rIStm, nFormat );\n\n        if( pCvt->GetFilterHdl().Call( &aData ) )\n        {\n            rGraphic = aData.maGraphic;\n            nRet = ERRCODE_NONE;\n        }\n        else if( rIStm.GetError() )\n            nRet = rIStm.GetError();\n    }\n\n    return nRet;\n}\n\n\/\/ ------------------------------------------------------------------------\n\nULONG GraphicConverter::Export( SvStream& rOStm, const Graphic& rGraphic, ULONG nFormat )\n{\n    GraphicConverter*   pCvt = ImplGetSVData()->maGDIData.mpGrfConverter;\n    ULONG               nRet = ERRCODE_IO_GENERAL;\n\n    if( pCvt && pCvt->GetFilterHdl().IsSet() )\n    {\n        ConvertData aData( rGraphic, rOStm, nFormat );\n\n        if( pCvt->GetFilterHdl().Call( &aData ) )\n            nRet = ERRCODE_NONE;\n        else if( rOStm.GetError() )\n            nRet = rOStm.GetError();\n    }\n\n    return nRet;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*******************************************************************************\nFILE : text_FE_choose_class.hpp\n\nLAST MODIFIED : 18 April 2007\n\nDESCRIPTION :\nMacros for implementing an text dialog control for choosing an object\nfrom FE. \n==============================================================================*\/\n\/* ***** BEGIN LICENSE BLOCK *****\n * Version: MPL 1.1\/GPL 2.0\/LGPL 2.1\n *\n * The contents of this file are subject to the Mozilla Public License Version\n * 1.1 (the \"License\"); you may not use this file except in compliance with\n * the License. You may obtain a copy of the License at\n * http:\/\/www.mozilla.org\/MPL\/\n *\n * Software distributed under the License is distributed on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License\n * for the specific language governing rights and limitations under the\n * License.\n *\n * The Original Code is cmgui.\n *\n * The Initial Developer of the Original Code is\n * Auckland Uniservices Ltd, Auckland, New Zealand.\n * Portions created by the Initial Developer are Copyright (C) 2005\n * the Initial Developer. All Rights Reserved.\n *\n * Contributor(s):\n *\n * Alternatively, the contents of this file may be used under the terms of\n * either the GNU General Public License Version 2 or later (the \"GPL\"), or\n * the GNU Lesser General Public License Version 2.1 or later (the \"LGPL\"),\n * in which case the provisions of the GPL or the LGPL are applicable instead\n * of those above. If you wish to allow use of your version of this file only\n * under the terms of either the GPL or the LGPL, and not to allow others to\n * use your version of this file under the terms of the MPL, indicate your\n * decision by deleting the provisions above and replace them with the notice\n * and other provisions required by the GPL or the LGPL. If you do not delete\n * the provisions above, a recipient may use your version of this file under\n * the terms of any one of the MPL, the GPL or the LGPL.\n *\n * ***** END LICENSE BLOCK ***** *\/\n#if !defined ( TEXT_FE_CHOOSE_CLASS_HPP)\n#define TEXT_FE_CHOOSE_CLASS_HPP\nextern \"C\" {\n#include <stdio.h>\n}\n#include \"wx\/wx.h\"\n#include \"general\/callback_class.hpp\"\n\/\/ #include \"choose\/text_choose_class.hpp\"\nextern \"C\" {\n#include \"general\/debug.h\"\n#include \"finite_element\/finite_element_region.h\"\n#include \"user_interface\/message.h\"\n#include \"user_interface\/user_interface.h\"\n}\n\ntemplate < class FE_object, class FE_region_method_class > class FE_object_text_chooser : public wxTextCtrl\n\/*****************************************************************************\nLAST MODIFIED : 18 April 2007\n\nDESCRIPTION :\n============================================================================*\/\n{\nprivate:\n\t FE_object *current_object, *last_updated_object;\n\t FE_region *fe_region; \n\t LIST_CONDITIONAL_FUNCTION(FE_node) *conditional_function;\n\t void *conditional_function_user_data;\n\t Callback_base<FE_object*> *update_callback;\n\t void *manager_callback_id;\n\npublic:\n\t FE_object_text_chooser(wxWindow *parent, \n\t\t\tFE_object *initial_object,\tFE_region *fe_region,\n\t\t\tLIST_CONDITIONAL_FUNCTION(FE_node) *conditional_function,\n\t\t\tvoid *conditional_function_user_data) :\n\t\t\twxTextCtrl(parent, \/*id*\/-1, \"\" ,wxPoint(0,0), wxSize(-1,-1),wxTE_PROCESS_ENTER),\n\t\t\tfe_region(fe_region), conditional_function(conditional_function),\n\t\t\tconditional_function_user_data(conditional_function_user_data)\n\/*******************************************************************************\nLAST MODIFIED : 28 March 2007\n\nDESCRIPTION :\n=============================================================================*\/\n\t {\n\t\t\tmanager_callback_id = (void *)NULL;\n\t\t\tcurrent_object = (FE_object *)NULL;\n\t\t\tlast_updated_object = (FE_object *)NULL;\n\t\t\tupdate_callback = (Callback_base<FE_object*> *)NULL;\n\t\t\tConnect(wxEVT_COMMAND_TEXT_ENTER,\n\t\t\t\t\twxCommandEventHandler(FE_object_text_chooser::OnTextEnter));\n\t\t\tConnect(wxEVT_KILL_FOCUS,\n\t\t\t\t\twxCommandEventHandler(FE_object_text_chooser::OnTextEnter));\n\t\t\tFE_region_add_callback(fe_region,\n\t\t\t\t\tFE_object_text_chooser::object_change,\n\t\t\t\t\t(void *)this);\n\t\t\tselect_object(initial_object);\n\t\t\twxBoxSizer *sizer = new wxBoxSizer( wxHORIZONTAL );\n\t\t\tsizer->Add(this,\n\t\t\t\t\twxSizerFlags(1).Align(wxALIGN_CENTER).Expand());\n\t\t\tparent->SetSizer(sizer);\n\t\t\ttypedef int (FE_object_text_chooser::*Member_function)(FE_object *);\n\t\t\tCallback_base<FE_object*> *callback = \n\t\t\t\t\tnew Callback_member_callback<FE_object*, \n\t\t\t\t FE_object_text_chooser, Member_function>(\n\t\t\t\t\t\tthis, &FE_object_text_chooser::text_chooser_callback);\n\t\t\tset_callback(callback);\n\t\t\tShow();\n\t }\n\n\t~FE_object_text_chooser()\n\/*******************************************************************************\nLAST MODIFIED : 18 April 2007\n\nDESCRIPTION :\n==============================================================================*\/\n\t{\n\t\t FE_region_remove_callback(fe_region,\n\t\t\t\tFE_object_text_chooser::object_change,\n\t\t\t\tthis);\n\t}\/* FE_object_text_chooser::~FE_object_text_chooser() *\/\n\n\tint set_region(FE_region *fe_region_in)\n\t{\n\t\tint return_code = 1;\n\t\tFE_region_remove_callback(fe_region,\n\t\t\tFE_object_text_chooser::object_change, this);\n\t\tfe_region = fe_region_in;\n\t\tFE_region_add_callback(fe_region,\n\t\t\tFE_object_text_chooser::object_change,this);\n\t\treturn return_code;\n\t}\n\t \n\t int text_chooser_callback(FE_object *object)\n\/*****************************************************************************\nLAST MODIFIED : 18 April 2007\n\nDESCRIPTION :\nCalled by the \n============================================================================*\/\n\t{\n\t\tint return_code;\n\t\t\n\t\tif (update_callback)\n\t\t{\n\t\t\t\/* now call the procedure with the user data *\/\n\t\t\tupdate_callback->callback_function(object);\n\t\t}\n\t\treturn_code=1;\n\t\t\n\t\treturn (return_code);\n\t} \/* FE_object_chooser::get_callback *\/\n\n\tCallback_base<FE_object*> *get_callback()\n\/*****************************************************************************\nLAST MODIFIED : 18 April 2007\n\nDESCRIPTION :\nReturns a pointer to the callback item.\n============================================================================*\/\n\t{\n\t\treturn update_callback;\n\t} \/* FE_object_chooser::get_callback *\/\n\t \n\t int set_callback(Callback_base<FE_object*> *new_callback)\n\/*****************************************************************************\nLAST MODIFIED : 18 April 2007\n\nDESCRIPTION :\nChanges the callback item.\n============================================================================*\/\n\t {\n\t\t\tupdate_callback = new_callback;\n\t\t\treturn (1);\n\t } \/* FE_object_chooser::set_callback *\/\n\n\tFE_object *get_object()\n\/*****************************************************************************\nLAST MODIFIED : 18 April 2007\n\nDESCRIPTION :\nReturns the currently chosen object.\n============================================================================*\/\n\t{\n\t\t FE_object *new_object, *return_address; \n\t\t new_object = FE_region_method_class::string_to_object(fe_region,\n\t\t\t\tconst_cast<char *>(GetValue().c_str()));\n\t\t select_object(new_object);\n\t\t return_address = current_object;\n\t\t \n\t\t return (return_address); \n\t} \/* FE_object_chooser::get_object *\/\n\n\tint set_object(FE_object *new_object)\n\/*****************************************************************************\nLAST MODIFIED : 18 April 2007\n\nDESCRIPTION :\nChanges the chosen object in the choose_object_widget.\n============================================================================*\/\n\t{\n\tint return_code; \n\n\tlast_updated_object=new_object;\n\treturn_code = select_object(new_object);\n\t\n\treturn (return_code);\n\t} \/* FE_object_chooser::set_object *\/\n\t \n\tint update()\n\/***************************************************************************** \nLAST MODIFIED : 28 January 2003 \n\nDESCRIPTION : \nTells CMGUI about the current values. Sends a pointer to the current object. \nAvoids sending repeated updates if the object address has not changed. \n============================================================================*\/ \n{ \n\tint return_code; \n\n\t\tif (current_object != last_updated_object)\n\t\t{ \n#if defined (NEW_CODE)\n\t\t\tif (update_callback.procedure) \n\t\t\t{ \n\t\t\t\t\/* now call the procedure with the user data and the position data *\/ \n\t\t\t\t(update_callback.procedure)( \n\t\t\t\t\twidget, update_callback.data, \n\t\t\t\t\tcurrent_object); \n\t\t\t} \n#endif \/\/ defined (NEW_CODE)\n\t\t\tlast_updated_object = current_object; \n\t\t} \n\t\treturn_code=1; \n\n\treturn (return_code); \n} \/* FE_object_chooser::update *\/\n\n\tint select_object(FE_object *new_object)\n\/***************************************************************************** \nLAST MODIFIED : 30 April 2003 \n\nDESCRIPTION : \nMakes sure the <new_object> is valid for this text chooser, then calls an \nupdate in case it has changed, and writes the new object string in the widget. \n============================================================================*\/\n\t{ \n\t\t const char *current_string; \n\t\t static const char *null_object_name=\"<NONE>\"; \n\t\t char *object_name; \n\t\t int return_code; \n\n\tENTER(TEXT_CHOOSE_FROM_FE_REGION_SELECT_OBJECT(object_type));\n\n\tcurrent_string = const_cast<char *>(GetValue().c_str());\n\tif (current_string != NULL) \n\t{ \n\t\t if (new_object && ((!(FE_region_method_class::FE_region_contains_object(\n\t\t\tfe_region, new_object)) || \n\t\t\t\t(conditional_function && \n\t\t\t\t!(conditional_function(new_object, conditional_function_user_data))))))\n\t\t{ \n\t\t\t\tdisplay_message(ERROR_MESSAGE, \n\t\t\t\t\t \"TEXT_CHOOSE_FROM_FE_REGION_SELECT_OBJECT(object_type).  Invalid object\"); \n\t\t\t\tnew_object=(FE_object *)NULL; \n\t\t} \n\t\tif (new_object) \n\t\t{ \n \t\t\t\tcurrent_object=new_object;\n\t\t} \n\t\telse if (!current_object) \n\t\t{ \n\t\t\t\tcurrent_object = \n\t\t\t\t\tFE_region_method_class::get_first_object_that(\n\t\t\t\t\t\t\tfe_region, \n\t\t\t\t\t\t\tconditional_function, \n\t\t\t\t\t\t\tconditional_function_user_data); \n\t\t}\n\n\t\t\/* write out the current_object *\/ \n\t\tif (current_object) \n\t\t{ \n\t\t\t\tif (FE_region_method_class::FE_object_to_string\n\t\t\t\t\t\t\t(current_object,&object_name)) \n\t\t\t\t{\n\t\t\t\t\tset_item(object_name);\n\t\t\t\t\tDEALLOCATE(object_name);\n\t\t\t\t} \n\t\t} \n\t\telse \n\t\t{ \n\t\t\t\tif (strcmp(null_object_name,current_string)) \n\t\t\t\t{ \n\t\t\t\t\tset_item(null_object_name); \n\t\t\t\t}\n\t\t} \n\t\t\/* inform the client of any change *\/\n\t\tupdate();\n\t\treturn_code=1;\n\t}\n\telse\n\t{\n\t\treturn_code = 0;\n\t}\n\t\n\tLEAVE; \n\t\n\treturn (return_code); \n} \/* TEXT_CHOOSE_FROM_FE_REGION_SELECT_OBJECT(object_type) *\/\n\n\nstatic void object_change(struct FE_region *fe_region, struct FE_region_changes *changes, \n\tvoid *text_choose_object_void)\n\/***************************************************************************** \nLAST MODIFIED : 28 March 2003 \n\nDESCRIPTION : \nUpdates the chosen object and text field in response to messages. \n============================================================================*\/\n{ \n\ttypename FE_region_method_class::change_log_change_object_type change; \n\tFE_object_text_chooser *chooser;\n\n\tUSE_PARAMETER(fe_region);\n\tchooser = static_cast<FE_object_text_chooser *>(text_choose_object_void);\n\tif (chooser != NULL)\n\t{\n\t\tif (chooser->current_object)\n\t\t{\n\t\t\tif (FE_region_method_class::change_log_query( \n\t\t\t\tFE_region_method_class::get_object_changes(changes), \n\t\t\t\tchooser->current_object, &change)) \n\t\t\t{ \n\t\t\t\tif (change & (FE_region_method_class::change_log_object_changed | \n\t\t\t\t\tFE_region_method_class::change_log_object_removed)) \n\t\t\t\t{ \n\t\t\t\t\tchooser->select_object((FE_object *)NULL); \n\t\t\t\t} \n\t\t\t} \n\t\t}\n\t}\n\t \n} \/* FE_object_chooser::object_change *\/\n\n\tint set_callback(Callback_base< FE_object > *callback_object)\n\t{\n\t\tupdate_callback = callback_object;\n\t\treturn (1);\n\t}\n\/\/ \t char *get_item()\n\/\/ \t{\n\/\/ \t\t return (const_cast<char *>(GetValue().c_str()));\n\/\/ \t}\n\n\tint set_item(const char *new_item)\n\t{\n\t\tunsigned int return_code;\n\t\treturn_code = 0;\n\t\tif (new_item !=NULL)\n\t\t{\n\t\t\t SetValue(new_item);\n\t\t\t return_code = 1;\n\t\t}\n\t\treturn (return_code);\n\t}\n\n\tvoid OnTextEnter(wxCommandEvent& event)\n\t{\n\t\tUSE_PARAMETER(event);\n\t\tif (update_callback)\n\t\t{\n\t\t\t update_callback->callback_function(get_object());\n\t\t}\n\t}\n};\n\n#endif \/*defined(TEXT_CHOOSE_FROM_FE_ELEMENT_H)*\/\n<commit_msg>Fixed a memoryleak found in node_viewer_wx.cpp as FE_text_chooser may not delete a callback function. Tracker item 2610, https:\/\/tracker.physiomeproject.org\/show_bug.cgi?id=2610<commit_after>\/*******************************************************************************\nFILE : text_FE_choose_class.hpp\n\nLAST MODIFIED : 18 April 2007\n\nDESCRIPTION :\nMacros for implementing an text dialog control for choosing an object\nfrom FE. \n==============================================================================*\/\n\/* ***** BEGIN LICENSE BLOCK *****\n * Version: MPL 1.1\/GPL 2.0\/LGPL 2.1\n *\n * The contents of this file are subject to the Mozilla Public License Version\n * 1.1 (the \"License\"); you may not use this file except in compliance with\n * the License. You may obtain a copy of the License at\n * http:\/\/www.mozilla.org\/MPL\/\n *\n * Software distributed under the License is distributed on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License\n * for the specific language governing rights and limitations under the\n * License.\n *\n * The Original Code is cmgui.\n *\n * The Initial Developer of the Original Code is\n * Auckland Uniservices Ltd, Auckland, New Zealand.\n * Portions created by the Initial Developer are Copyright (C) 2005\n * the Initial Developer. All Rights Reserved.\n *\n * Contributor(s):\n *\n * Alternatively, the contents of this file may be used under the terms of\n * either the GNU General Public License Version 2 or later (the \"GPL\"), or\n * the GNU Lesser General Public License Version 2.1 or later (the \"LGPL\"),\n * in which case the provisions of the GPL or the LGPL are applicable instead\n * of those above. If you wish to allow use of your version of this file only\n * under the terms of either the GPL or the LGPL, and not to allow others to\n * use your version of this file under the terms of the MPL, indicate your\n * decision by deleting the provisions above and replace them with the notice\n * and other provisions required by the GPL or the LGPL. If you do not delete\n * the provisions above, a recipient may use your version of this file under\n * the terms of any one of the MPL, the GPL or the LGPL.\n *\n * ***** END LICENSE BLOCK ***** *\/\n#if !defined ( TEXT_FE_CHOOSE_CLASS_HPP)\n#define TEXT_FE_CHOOSE_CLASS_HPP\nextern \"C\" {\n#include <stdio.h>\n}\n#include \"wx\/wx.h\"\n#include \"general\/callback_class.hpp\"\n\/\/ #include \"choose\/text_choose_class.hpp\"\nextern \"C\" {\n#include \"general\/debug.h\"\n#include \"finite_element\/finite_element_region.h\"\n#include \"user_interface\/message.h\"\n#include \"user_interface\/user_interface.h\"\n}\n\ntemplate < class FE_object, class FE_region_method_class > class FE_object_text_chooser : public wxTextCtrl\n\/*****************************************************************************\nLAST MODIFIED : 18 April 2007\n\nDESCRIPTION :\n============================================================================*\/\n{\nprivate:\n\t FE_object *current_object, *last_updated_object;\n\t FE_region *fe_region; \n\t LIST_CONDITIONAL_FUNCTION(FE_node) *conditional_function;\n\t void *conditional_function_user_data;\n\t Callback_base<FE_object*> *update_callback;\n\t void *manager_callback_id;\n\npublic:\n\t FE_object_text_chooser(wxWindow *parent, \n\t\t\tFE_object *initial_object,\tFE_region *fe_region,\n\t\t\tLIST_CONDITIONAL_FUNCTION(FE_node) *conditional_function,\n\t\t\tvoid *conditional_function_user_data) :\n\t\t\twxTextCtrl(parent, \/*id*\/-1, \"\" ,wxPoint(0,0), wxSize(-1,-1),wxTE_PROCESS_ENTER),\n\t\t\tfe_region(fe_region), conditional_function(conditional_function),\n\t\t\tconditional_function_user_data(conditional_function_user_data)\n\/*******************************************************************************\nLAST MODIFIED : 28 March 2007\n\nDESCRIPTION :\n=============================================================================*\/\n\t {\n\t\t\tmanager_callback_id = (void *)NULL;\n\t\t\tcurrent_object = (FE_object *)NULL;\n\t\t\tlast_updated_object = (FE_object *)NULL;\n\t\t\tupdate_callback = (Callback_base<FE_object*> *)NULL;\n\t\t\tConnect(wxEVT_COMMAND_TEXT_ENTER,\n\t\t\t\t\twxCommandEventHandler(FE_object_text_chooser::OnTextEnter));\n\t\t\tConnect(wxEVT_KILL_FOCUS,\n\t\t\t\t\twxCommandEventHandler(FE_object_text_chooser::OnTextEnter));\n\t\t\tFE_region_add_callback(fe_region,\n\t\t\t\t\tFE_object_text_chooser::object_change,\n\t\t\t\t\t(void *)this);\n\t\t\tselect_object(initial_object);\n\t\t\twxBoxSizer *sizer = new wxBoxSizer( wxHORIZONTAL );\n\t\t\tsizer->Add(this,\n\t\t\t\t\twxSizerFlags(1).Align(wxALIGN_CENTER).Expand());\n\t\t\tparent->SetSizer(sizer);\n\t\t\ttypedef int (FE_object_text_chooser::*Member_function)(FE_object *);\n\t\t\tupdate_callback = new Callback_member_callback<FE_object*,\n\t\t\t\t FE_object_text_chooser, Member_function>(\n\t\t\t\t\t\tthis, &FE_object_text_chooser::text_chooser_callback);\n\t\t\tShow();\n\t }\n\n\t~FE_object_text_chooser()\n\/*******************************************************************************\nLAST MODIFIED : 18 April 2007\n\nDESCRIPTION :\n==============================================================================*\/\n\t{\n\t\t FE_region_remove_callback(fe_region,\n\t\t\t\tFE_object_text_chooser::object_change,\n\t\t\t\tthis);\n\t\t if (update_callback)\n\t\t\t delete update_callback;\n\t}\/* FE_object_text_chooser::~FE_object_text_chooser() *\/\n\n\tint set_region(FE_region *fe_region_in)\n\t{\n\t\tint return_code = 1;\n\t\tFE_region_remove_callback(fe_region,\n\t\t\tFE_object_text_chooser::object_change, this);\n\t\tfe_region = fe_region_in;\n\t\tFE_region_add_callback(fe_region,\n\t\t\tFE_object_text_chooser::object_change,this);\n\t\treturn return_code;\n\t}\n\t \n\t int text_chooser_callback(FE_object *object)\n\/*****************************************************************************\nLAST MODIFIED : 18 April 2007\n\nDESCRIPTION :\nCalled by the \n============================================================================*\/\n\t{\n\t\tint return_code;\n\t\t\n\t\tif (update_callback)\n\t\t{\n\t\t\t\/* now call the procedure with the user data *\/\n\t\t\tupdate_callback->callback_function(object);\n\t\t}\n\t\treturn_code=1;\n\t\t\n\t\treturn (return_code);\n\t} \/* FE_object_chooser::get_callback *\/\n\n\tCallback_base<FE_object*> *get_callback()\n\/*****************************************************************************\nLAST MODIFIED : 18 April 2007\n\nDESCRIPTION :\nReturns a pointer to the callback item.\n============================================================================*\/\n\t{\n\t\treturn update_callback;\n\t} \/* FE_object_chooser::get_callback *\/\n\t \n\t int set_callback(Callback_base<FE_object*> *new_callback)\n\/*****************************************************************************\nLAST MODIFIED : 18 April 2007\n\nDESCRIPTION :\nChanges the callback item.\n============================================================================*\/\n\t {\n\t\t if (update_callback)\n\t\t\t delete update_callback;\n\t\tupdate_callback = new_callback;\n\t\treturn (1);\n\t } \/* FE_object_chooser::set_callback *\/\n\n\tFE_object *get_object()\n\/*****************************************************************************\nLAST MODIFIED : 18 April 2007\n\nDESCRIPTION :\nReturns the currently chosen object.\n============================================================================*\/\n\t{\n\t\t FE_object *new_object, *return_address; \n\t\t new_object = FE_region_method_class::string_to_object(fe_region,\n\t\t\t\tconst_cast<char *>(GetValue().c_str()));\n\t\t select_object(new_object);\n\t\t return_address = current_object;\n\t\t \n\t\t return (return_address); \n\t} \/* FE_object_chooser::get_object *\/\n\n\tint set_object(FE_object *new_object)\n\/*****************************************************************************\nLAST MODIFIED : 18 April 2007\n\nDESCRIPTION :\nChanges the chosen object in the choose_object_widget.\n============================================================================*\/\n\t{\n\tint return_code; \n\n\tlast_updated_object=new_object;\n\treturn_code = select_object(new_object);\n\t\n\treturn (return_code);\n\t} \/* FE_object_chooser::set_object *\/\n\t \n\tint update()\n\/***************************************************************************** \nLAST MODIFIED : 28 January 2003 \n\nDESCRIPTION : \nTells CMGUI about the current values. Sends a pointer to the current object. \nAvoids sending repeated updates if the object address has not changed. \n============================================================================*\/ \n{ \n\tint return_code; \n\n\t\tif (current_object != last_updated_object)\n\t\t{ \n#if defined (NEW_CODE)\n\t\t\tif (update_callback.procedure) \n\t\t\t{ \n\t\t\t\t\/* now call the procedure with the user data and the position data *\/ \n\t\t\t\t(update_callback.procedure)( \n\t\t\t\t\twidget, update_callback.data, \n\t\t\t\t\tcurrent_object); \n\t\t\t} \n#endif \/\/ defined (NEW_CODE)\n\t\t\tlast_updated_object = current_object; \n\t\t} \n\t\treturn_code=1; \n\n\treturn (return_code); \n} \/* FE_object_chooser::update *\/\n\n\tint select_object(FE_object *new_object)\n\/***************************************************************************** \nLAST MODIFIED : 30 April 2003 \n\nDESCRIPTION : \nMakes sure the <new_object> is valid for this text chooser, then calls an \nupdate in case it has changed, and writes the new object string in the widget. \n============================================================================*\/\n\t{ \n\t\t const char *current_string; \n\t\t static const char *null_object_name=\"<NONE>\"; \n\t\t char *object_name; \n\t\t int return_code; \n\n\tENTER(TEXT_CHOOSE_FROM_FE_REGION_SELECT_OBJECT(object_type));\n\n\tcurrent_string = const_cast<char *>(GetValue().c_str());\n\tif (current_string != NULL) \n\t{ \n\t\t if (new_object && ((!(FE_region_method_class::FE_region_contains_object(\n\t\t\tfe_region, new_object)) || \n\t\t\t\t(conditional_function && \n\t\t\t\t!(conditional_function(new_object, conditional_function_user_data))))))\n\t\t{ \n\t\t\t\tdisplay_message(ERROR_MESSAGE, \n\t\t\t\t\t \"TEXT_CHOOSE_FROM_FE_REGION_SELECT_OBJECT(object_type).  Invalid object\"); \n\t\t\t\tnew_object=(FE_object *)NULL; \n\t\t} \n\t\tif (new_object) \n\t\t{ \n \t\t\t\tcurrent_object=new_object;\n\t\t} \n\t\telse if (!current_object) \n\t\t{ \n\t\t\t\tcurrent_object = \n\t\t\t\t\tFE_region_method_class::get_first_object_that(\n\t\t\t\t\t\t\tfe_region, \n\t\t\t\t\t\t\tconditional_function, \n\t\t\t\t\t\t\tconditional_function_user_data); \n\t\t}\n\n\t\t\/* write out the current_object *\/ \n\t\tif (current_object) \n\t\t{ \n\t\t\t\tif (FE_region_method_class::FE_object_to_string\n\t\t\t\t\t\t\t(current_object,&object_name)) \n\t\t\t\t{\n\t\t\t\t\tset_item(object_name);\n\t\t\t\t\tDEALLOCATE(object_name);\n\t\t\t\t} \n\t\t} \n\t\telse \n\t\t{ \n\t\t\t\tif (strcmp(null_object_name,current_string)) \n\t\t\t\t{ \n\t\t\t\t\tset_item(null_object_name); \n\t\t\t\t}\n\t\t} \n\t\t\/* inform the client of any change *\/\n\t\tupdate();\n\t\treturn_code=1;\n\t}\n\telse\n\t{\n\t\treturn_code = 0;\n\t}\n\t\n\tLEAVE; \n\t\n\treturn (return_code); \n} \/* TEXT_CHOOSE_FROM_FE_REGION_SELECT_OBJECT(object_type) *\/\n\n\nstatic void object_change(struct FE_region *fe_region, struct FE_region_changes *changes, \n\tvoid *text_choose_object_void)\n\/***************************************************************************** \nLAST MODIFIED : 28 March 2003 \n\nDESCRIPTION : \nUpdates the chosen object and text field in response to messages. \n============================================================================*\/\n{ \n\ttypename FE_region_method_class::change_log_change_object_type change; \n\tFE_object_text_chooser *chooser;\n\n\tUSE_PARAMETER(fe_region);\n\tchooser = static_cast<FE_object_text_chooser *>(text_choose_object_void);\n\tif (chooser != NULL)\n\t{\n\t\tif (chooser->current_object)\n\t\t{\n\t\t\tif (FE_region_method_class::change_log_query( \n\t\t\t\tFE_region_method_class::get_object_changes(changes), \n\t\t\t\tchooser->current_object, &change)) \n\t\t\t{ \n\t\t\t\tif (change & (FE_region_method_class::change_log_object_changed | \n\t\t\t\t\tFE_region_method_class::change_log_object_removed)) \n\t\t\t\t{ \n\t\t\t\t\tchooser->select_object((FE_object *)NULL); \n\t\t\t\t} \n\t\t\t} \n\t\t}\n\t}\n\t \n} \/* FE_object_chooser::object_change *\/\n\n\/\/ \t char *get_item()\n\/\/ \t{\n\/\/ \t\t return (const_cast<char *>(GetValue().c_str()));\n\/\/ \t}\n\n\tint set_item(const char *new_item)\n\t{\n\t\tunsigned int return_code;\n\t\treturn_code = 0;\n\t\tif (new_item !=NULL)\n\t\t{\n\t\t\t SetValue(new_item);\n\t\t\t return_code = 1;\n\t\t}\n\t\treturn (return_code);\n\t}\n\n\tvoid OnTextEnter(wxCommandEvent& event)\n\t{\n\t\tUSE_PARAMETER(event);\n\t\tif (update_callback)\n\t\t{\n\t\t\t update_callback->callback_function(get_object());\n\t\t}\n\t}\n};\n\n#endif \/*defined(TEXT_CHOOSE_FROM_FE_ELEMENT_H)*\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"common\/upstream\/cds_api_impl.h\"\n\n#include <string>\n\n#include \"envoy\/api\/v2\/cds.pb.validate.h\"\n#include \"envoy\/api\/v2\/cluster\/outlier_detection.pb.validate.h\"\n#include \"envoy\/stats\/scope.h\"\n\n#include \"common\/common\/cleanup.h\"\n#include \"common\/common\/utility.h\"\n#include \"common\/config\/resources.h\"\n#include \"common\/config\/subscription_factory.h\"\n#include \"common\/config\/utility.h\"\n#include \"common\/protobuf\/utility.h\"\n\nnamespace Envoy {\nnamespace Upstream {\n\nCdsApiPtr CdsApiImpl::create(const envoy::api::v2::core::ConfigSource& cds_config,\n                             ClusterManager& cm, Event::Dispatcher& dispatcher,\n                             Runtime::RandomGenerator& random,\n                             const LocalInfo::LocalInfo& local_info, Stats::Scope& scope,\n                             Api::Api& api) {\n  return CdsApiPtr{new CdsApiImpl(cds_config, cm, dispatcher, random, local_info, scope, api)};\n}\n\nCdsApiImpl::CdsApiImpl(const envoy::api::v2::core::ConfigSource& cds_config, ClusterManager& cm,\n                       Event::Dispatcher& dispatcher, Runtime::RandomGenerator& random,\n                       const LocalInfo::LocalInfo& local_info, Stats::Scope& scope, Api::Api& api)\n    : cm_(cm), scope_(scope.createScope(\"cluster_manager.cds.\")) {\n  Config::Utility::checkLocalInfo(\"cds\", local_info);\n\n  subscription_ =\n      Config::SubscriptionFactory::subscriptionFromConfigSource<envoy::api::v2::Cluster>(\n          cds_config, local_info, dispatcher, cm, random, *scope_,\n          \"envoy.api.v2.ClusterDiscoveryService.FetchClusters\",\n          \"envoy.api.v2.ClusterDiscoveryService.DeltaClusters\", api);\n}\n\nvoid CdsApiImpl::onConfigUpdate(const ResourceVector& resources, const std::string& version_info) {\n  ClusterManager::ClusterInfoMap clusters_to_remove = cm_.clusters();\n  for (const auto& cluster : resources) {\n    clusters_to_remove.erase(cluster.name());\n  }\n  Protobuf::RepeatedPtrField<std::string> to_remove_repeated;\n  for (const auto& cluster : clusters_to_remove) {\n    *to_remove_repeated.Add() = cluster.first;\n  }\n  Protobuf::RepeatedPtrField<envoy::api::v2::Resource> to_add_repeated;\n  for (const auto& cluster : resources) {\n    envoy::api::v2::Resource* to_add = to_add_repeated.Add();\n    to_add->set_name(cluster.name());\n    to_add->set_version(version_info);\n    to_add->mutable_resource()->PackFrom(cluster);\n  }\n  onConfigUpdate(to_add_repeated, to_remove_repeated, version_info);\n}\n\nvoid CdsApiImpl::onConfigUpdate(\n    const Protobuf::RepeatedPtrField<envoy::api::v2::Resource>& added_resources,\n    const Protobuf::RepeatedPtrField<std::string>& removed_resources,\n    const std::string& system_version_info) {\n  cm_.adsMux().pause(Config::TypeUrl::get().ClusterLoadAssignment);\n  Cleanup eds_resume([this] { cm_.adsMux().resume(Config::TypeUrl::get().ClusterLoadAssignment); });\n\n  std::vector<std::string> exception_msgs;\n  std::unordered_set<std::string> cluster_names;\n  for (const auto& resource : added_resources) {\n    envoy::api::v2::Cluster cluster;\n    try {\n      cluster = MessageUtil::anyConvert<envoy::api::v2::Cluster>(resource.resource());\n      MessageUtil::validate(cluster);\n      if (!cluster_names.insert(cluster.name()).second) {\n        throw EnvoyException(fmt::format(\"duplicate cluster {} found\", cluster.name()));\n      }\n      if (cm_.addOrUpdateCluster(\n              cluster, resource.version(),\n              [this](const std::string&, ClusterManager::ClusterWarmingState state) {\n                \/\/ Following if\/else block implements a control flow mechanism that can be used\n                \/\/ by an ADS implementation to properly sequence CDS and RDS update. It is not\n                \/\/ enforcing on ADS. ADS can use it to detect when a previously sent cluster becomes\n                \/\/ warm before sending routes that depend on it. This can improve incidence of HTTP\n                \/\/ 503 responses from Envoy when a route is used before it's supporting cluster is\n                \/\/ ready.\n                \/\/\n                \/\/ We achieve that by leaving CDS in the paused state as long as there is at least\n                \/\/ one cluster in the warming state. This prevents CDS ACK from being sent to ADS.\n                \/\/ Once cluster is warmed up, CDS is resumed, and ACK is sent to ADS, providing a\n                \/\/ signal to ADS to proceed with RDS updates.\n                \/\/\n                \/\/ Major concern with this approach is CDS being left in the paused state forever.\n                \/\/ As long as ClusterManager::removeCluster() is not called on a warming cluster\n                \/\/ this is not an issue. CdsApiImpl takes care of doing this properly, and there\n                \/\/ is no other component removing clusters from the ClusterManagerImpl. If this\n                \/\/ ever changes, we would need to correct the following logic.\n                if (state == ClusterManager::ClusterWarmingState::Starting &&\n                    cm_.warmingClusterCount() == 1) {\n                  cm_.adsMux().pause(Config::TypeUrl::get().Cluster);\n                } else if (state == ClusterManager::ClusterWarmingState::Finished &&\n                           cm_.warmingClusterCount() == 0) {\n                  cm_.adsMux().resume(Config::TypeUrl::get().Cluster);\n                }\n              })) {\n        ENVOY_LOG(debug, \"cds: add\/update cluster '{}'\", cluster.name());\n      }\n    } catch (const EnvoyException& e) {\n      exception_msgs.push_back(fmt::format(\"{}: {}\", cluster.name(), e.what()));\n    }\n  }\n  for (auto resource_name : removed_resources) {\n    if (cm_.removeCluster(resource_name)) {\n      ENVOY_LOG(debug, \"cds: remove cluster '{}'\", resource_name);\n    }\n  }\n\n  runInitializeCallbackIfAny();\n  if (!exception_msgs.empty()) {\n    throw EnvoyException(\n        fmt::format(\"Error adding\/updating cluster(s) {}\", StringUtil::join(exception_msgs, \", \")));\n  }\n  system_version_info_ = system_version_info;\n}\n\nvoid CdsApiImpl::onConfigUpdateFailed(const EnvoyException*) {\n  \/\/ We need to allow server startup to continue, even if we have a bad\n  \/\/ config.\n  runInitializeCallbackIfAny();\n}\n\nvoid CdsApiImpl::runInitializeCallbackIfAny() {\n  if (initialize_callback_) {\n    initialize_callback_();\n    initialize_callback_ = nullptr;\n  }\n}\n\n} \/\/ namespace Upstream\n} \/\/ namespace Envoy\n<commit_msg>config: fix CDS gRPC not specifying StreamClusters gRPC method (#6253)<commit_after>#include \"common\/upstream\/cds_api_impl.h\"\n\n#include <string>\n\n#include \"envoy\/api\/v2\/cds.pb.validate.h\"\n#include \"envoy\/api\/v2\/cluster\/outlier_detection.pb.validate.h\"\n#include \"envoy\/stats\/scope.h\"\n\n#include \"common\/common\/cleanup.h\"\n#include \"common\/common\/utility.h\"\n#include \"common\/config\/resources.h\"\n#include \"common\/config\/subscription_factory.h\"\n#include \"common\/config\/utility.h\"\n#include \"common\/protobuf\/utility.h\"\n\nnamespace Envoy {\nnamespace Upstream {\n\nCdsApiPtr CdsApiImpl::create(const envoy::api::v2::core::ConfigSource& cds_config,\n                             ClusterManager& cm, Event::Dispatcher& dispatcher,\n                             Runtime::RandomGenerator& random,\n                             const LocalInfo::LocalInfo& local_info, Stats::Scope& scope,\n                             Api::Api& api) {\n  return CdsApiPtr{new CdsApiImpl(cds_config, cm, dispatcher, random, local_info, scope, api)};\n}\n\nCdsApiImpl::CdsApiImpl(const envoy::api::v2::core::ConfigSource& cds_config, ClusterManager& cm,\n                       Event::Dispatcher& dispatcher, Runtime::RandomGenerator& random,\n                       const LocalInfo::LocalInfo& local_info, Stats::Scope& scope, Api::Api& api)\n    : cm_(cm), scope_(scope.createScope(\"cluster_manager.cds.\")) {\n  Config::Utility::checkLocalInfo(\"cds\", local_info);\n\n  const bool is_delta = (cds_config.api_config_source().api_type() ==\n                         envoy::api::v2::core::ApiConfigSource::DELTA_GRPC);\n  const std::string grpc_method = is_delta ? \"envoy.api.v2.ClusterDiscoveryService.DeltaClusters\"\n                                           : \"envoy.api.v2.ClusterDiscoveryService.StreamClusters\";\n  subscription_ =\n      Config::SubscriptionFactory::subscriptionFromConfigSource<envoy::api::v2::Cluster>(\n          cds_config, local_info, dispatcher, cm, random, *scope_,\n          \"envoy.api.v2.ClusterDiscoveryService.FetchClusters\", grpc_method, api);\n}\n\nvoid CdsApiImpl::onConfigUpdate(const ResourceVector& resources, const std::string& version_info) {\n  ClusterManager::ClusterInfoMap clusters_to_remove = cm_.clusters();\n  for (const auto& cluster : resources) {\n    clusters_to_remove.erase(cluster.name());\n  }\n  Protobuf::RepeatedPtrField<std::string> to_remove_repeated;\n  for (const auto& cluster : clusters_to_remove) {\n    *to_remove_repeated.Add() = cluster.first;\n  }\n  Protobuf::RepeatedPtrField<envoy::api::v2::Resource> to_add_repeated;\n  for (const auto& cluster : resources) {\n    envoy::api::v2::Resource* to_add = to_add_repeated.Add();\n    to_add->set_name(cluster.name());\n    to_add->set_version(version_info);\n    to_add->mutable_resource()->PackFrom(cluster);\n  }\n  onConfigUpdate(to_add_repeated, to_remove_repeated, version_info);\n}\n\nvoid CdsApiImpl::onConfigUpdate(\n    const Protobuf::RepeatedPtrField<envoy::api::v2::Resource>& added_resources,\n    const Protobuf::RepeatedPtrField<std::string>& removed_resources,\n    const std::string& system_version_info) {\n  cm_.adsMux().pause(Config::TypeUrl::get().ClusterLoadAssignment);\n  Cleanup eds_resume([this] { cm_.adsMux().resume(Config::TypeUrl::get().ClusterLoadAssignment); });\n\n  std::vector<std::string> exception_msgs;\n  std::unordered_set<std::string> cluster_names;\n  for (const auto& resource : added_resources) {\n    envoy::api::v2::Cluster cluster;\n    try {\n      cluster = MessageUtil::anyConvert<envoy::api::v2::Cluster>(resource.resource());\n      MessageUtil::validate(cluster);\n      if (!cluster_names.insert(cluster.name()).second) {\n        throw EnvoyException(fmt::format(\"duplicate cluster {} found\", cluster.name()));\n      }\n      if (cm_.addOrUpdateCluster(\n              cluster, resource.version(),\n              [this](const std::string&, ClusterManager::ClusterWarmingState state) {\n                \/\/ Following if\/else block implements a control flow mechanism that can be used\n                \/\/ by an ADS implementation to properly sequence CDS and RDS update. It is not\n                \/\/ enforcing on ADS. ADS can use it to detect when a previously sent cluster becomes\n                \/\/ warm before sending routes that depend on it. This can improve incidence of HTTP\n                \/\/ 503 responses from Envoy when a route is used before it's supporting cluster is\n                \/\/ ready.\n                \/\/\n                \/\/ We achieve that by leaving CDS in the paused state as long as there is at least\n                \/\/ one cluster in the warming state. This prevents CDS ACK from being sent to ADS.\n                \/\/ Once cluster is warmed up, CDS is resumed, and ACK is sent to ADS, providing a\n                \/\/ signal to ADS to proceed with RDS updates.\n                \/\/\n                \/\/ Major concern with this approach is CDS being left in the paused state forever.\n                \/\/ As long as ClusterManager::removeCluster() is not called on a warming cluster\n                \/\/ this is not an issue. CdsApiImpl takes care of doing this properly, and there\n                \/\/ is no other component removing clusters from the ClusterManagerImpl. If this\n                \/\/ ever changes, we would need to correct the following logic.\n                if (state == ClusterManager::ClusterWarmingState::Starting &&\n                    cm_.warmingClusterCount() == 1) {\n                  cm_.adsMux().pause(Config::TypeUrl::get().Cluster);\n                } else if (state == ClusterManager::ClusterWarmingState::Finished &&\n                           cm_.warmingClusterCount() == 0) {\n                  cm_.adsMux().resume(Config::TypeUrl::get().Cluster);\n                }\n              })) {\n        ENVOY_LOG(debug, \"cds: add\/update cluster '{}'\", cluster.name());\n      }\n    } catch (const EnvoyException& e) {\n      exception_msgs.push_back(fmt::format(\"{}: {}\", cluster.name(), e.what()));\n    }\n  }\n  for (auto resource_name : removed_resources) {\n    if (cm_.removeCluster(resource_name)) {\n      ENVOY_LOG(debug, \"cds: remove cluster '{}'\", resource_name);\n    }\n  }\n\n  runInitializeCallbackIfAny();\n  if (!exception_msgs.empty()) {\n    throw EnvoyException(\n        fmt::format(\"Error adding\/updating cluster(s) {}\", StringUtil::join(exception_msgs, \", \")));\n  }\n  system_version_info_ = system_version_info;\n}\n\nvoid CdsApiImpl::onConfigUpdateFailed(const EnvoyException*) {\n  \/\/ We need to allow server startup to continue, even if we have a bad\n  \/\/ config.\n  runInitializeCallbackIfAny();\n}\n\nvoid CdsApiImpl::runInitializeCallbackIfAny() {\n  if (initialize_callback_) {\n    initialize_callback_();\n    initialize_callback_ = nullptr;\n  }\n}\n\n} \/\/ namespace Upstream\n} \/\/ namespace Envoy\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <ql\/quantlib.hpp>\n\nusing namespace std;\nusing namespace QuantLib;\n\nboost::shared_ptr<YieldTermStructure>\nflatRate(const Date& today,\n    const boost::shared_ptr<Quote>& forward,\n    const DayCounter& dc) {\n    return boost::shared_ptr<YieldTermStructure>(\n        new FlatForward(today, Handle<Quote>(forward), dc));\n}\n\nint main() {\n\n    const Size maturity = 2;\n    DayCounter dc = Actual365Fixed();\n    const Date today = Date::todaysDate();\n    const Real upperBarrier = 1.02;\n    const Real lowerBarrier = 0.86;\n\n    Settings::instance().evaluationDate() = today;\n\n    Handle<Quote> spot(boost::shared_ptr<Quote>(new SimpleQuote(1.)));\n    boost::shared_ptr<SimpleQuote> qRate(new SimpleQuote(0.0));\n    Handle<YieldTermStructure> qTS(flatRate(today, qRate, dc));\n    boost::shared_ptr<SimpleQuote> rRate(new SimpleQuote(0.05));\n    Handle<YieldTermStructure> rTS(flatRate(today, rRate, dc));\n    boost::shared_ptr<SimpleQuote> sRate(new SimpleQuote(0.0));\n    Handle<YieldTermStructure> sTS(flatRate(today, sRate, dc));\n    Handle<BlackVolTermStructure> vTS(boost::shared_ptr<BlackVolTermStructure>(new BlackConstantVol(today, NullCalendar(), 0.15, dc)));\n\n    const boost::shared_ptr<GeneralizedBlackScholesProcess> underlyingProcess(\n            new GeneralizedBlackScholesProcess(spot, qTS, sTS, vTS));\n\n    const Period monitorPeriod = Period(1, Weeks);\n\n    Schedule schedule(today, today + Period(maturity, Years),\n                      monitorPeriod, TARGET(),\n                      Following, Following,\n                      DateGeneration::Forward, false);\n\n    std::vector<Time> times(schedule.size());\n    std::transform(schedule.begin(), schedule.end(), times.begin(),\n                   boost::bind(&Actual365Fixed::yearFraction,\n                               dc, today, placeholders::_1, Date(), Date()));\n\n    TimeGrid grid(times.begin(), times.end());\n\n    std::vector<Real> redemption(times.size());\n\n    for (Size i=0; i < redemption.size(); ++i) {\n        redemption[i] = 1. + 0.16 * times[i];\n    }\n\n    typedef PseudoRandom::rsg_type rsg_type;\n    typedef MultiPathGenerator<rsg_type>::sample_type sample_type;\n\n    BigNatural seed = 42;\n    rsg_type rsg = PseudoRandom::make_sequence_generator(grid.size()-1, seed);\n\n    MultiPathGenerator<rsg_type> generator(underlyingProcess, grid, rsg, false);\n    GeneralStatistics stat;\n\n    Real antitheticPayoff=0;\n    const Size nrTrails = 3000;\n    for (Size i=0; i < nrTrails; ++i) {\n        const bool antithetic = (i%2)==0 ? false : true;\n\n        sample_type path = antithetic ? generator.antithetic()\n                                      : generator.next();\n\n        Real payoff=0;\n        for (Size j=1; j < times.size(); ++j) {\n            if (path.value[0][j] > upperBarrier * spot->value()) {\n                payoff = redemption[j] * rTS->discount(times[j]);\n                break;\n            }\n            else if (path.value[0][j] < lowerBarrier * spot->value())\n            {\n                payoff = path.value[0][j] * rTS->discount(times[j]);\n                break;\n            }\n            else if (j == times.size() - 1) {\n                payoff = redemption[j] * rTS->discount(times[j]);\n            }\n        }\n\n        if (antithetic){\n            stat.add(0.5*(antitheticPayoff + payoff));\n        }\n        else {\n            antitheticPayoff = payoff;\n        }\n    }\n\n    const Real calculated = stat.mean();\n    const Real error = stat.errorEstimate();\n\n    cout << \"Calculated: \" << calculated << \"\\nError esi.: \" << error << endl;\n\n    return 0;\n}<commit_msg>fixed place holder<commit_after>#include <iostream>\n#include <ql\/quantlib.hpp>\n\nusing namespace std;\nusing namespace QuantLib;\n\nboost::shared_ptr<YieldTermStructure>\nflatRate(const Date& today,\n    const boost::shared_ptr<Quote>& forward,\n    const DayCounter& dc) {\n    return boost::shared_ptr<YieldTermStructure>(\n        new FlatForward(today, Handle<Quote>(forward), dc));\n}\n\nint main() {\n\n    const Size maturity = 2;\n    DayCounter dc = Actual365Fixed();\n    const Date today = Date::todaysDate();\n    const Real upperBarrier = 1.02;\n    const Real lowerBarrier = 0.86;\n\n    Settings::instance().evaluationDate() = today;\n\n    Handle<Quote> spot(boost::shared_ptr<Quote>(new SimpleQuote(1.)));\n    boost::shared_ptr<SimpleQuote> qRate(new SimpleQuote(0.0));\n    Handle<YieldTermStructure> qTS(flatRate(today, qRate, dc));\n    boost::shared_ptr<SimpleQuote> rRate(new SimpleQuote(0.05));\n    Handle<YieldTermStructure> rTS(flatRate(today, rRate, dc));\n    boost::shared_ptr<SimpleQuote> sRate(new SimpleQuote(0.0));\n    Handle<YieldTermStructure> sTS(flatRate(today, sRate, dc));\n    Handle<BlackVolTermStructure> vTS(boost::shared_ptr<BlackVolTermStructure>(new BlackConstantVol(today, NullCalendar(), 0.15, dc)));\n\n    const boost::shared_ptr<GeneralizedBlackScholesProcess> underlyingProcess(\n            new GeneralizedBlackScholesProcess(spot, qTS, sTS, vTS));\n\n    const Period monitorPeriod = Period(1, Weeks);\n\n    Schedule schedule(today, today + Period(maturity, Years),\n                      monitorPeriod, TARGET(),\n                      Following, Following,\n                      DateGeneration::Forward, false);\n\n    std::vector<Time> times(schedule.size());\n    std::transform(schedule.begin(), schedule.end(), times.begin(),\n                   boost::bind(&Actual365Fixed::yearFraction,\n                               dc, today, boost::placeholders::_1, Date(), Date()));\n\n    TimeGrid grid(times.begin(), times.end());\n\n    std::vector<Real> redemption(times.size());\n\n    for (Size i=0; i < redemption.size(); ++i) {\n        redemption[i] = 1. + 0.16 * times[i];\n    }\n\n    typedef PseudoRandom::rsg_type rsg_type;\n    typedef MultiPathGenerator<rsg_type>::sample_type sample_type;\n\n    BigNatural seed = 42;\n    rsg_type rsg = PseudoRandom::make_sequence_generator(grid.size()-1, seed);\n\n    MultiPathGenerator<rsg_type> generator(underlyingProcess, grid, rsg, false);\n    GeneralStatistics stat;\n\n    Real antitheticPayoff=0;\n    const Size nrTrails = 3000;\n    for (Size i=0; i < nrTrails; ++i) {\n        const bool antithetic = (i%2)==0 ? false : true;\n\n        sample_type path = antithetic ? generator.antithetic()\n                                      : generator.next();\n\n        Real payoff=0;\n        for (Size j=1; j < times.size(); ++j) {\n            if (path.value[0][j] > upperBarrier * spot->value()) {\n                payoff = redemption[j] * rTS->discount(times[j]);\n                break;\n            }\n            else if (path.value[0][j] < lowerBarrier * spot->value())\n            {\n                payoff = path.value[0][j] * rTS->discount(times[j]);\n                break;\n            }\n            else if (j == times.size() - 1) {\n                payoff = redemption[j] * rTS->discount(times[j]);\n            }\n        }\n\n        if (antithetic){\n            stat.add(0.5*(antitheticPayoff + payoff));\n        }\n        else {\n            antitheticPayoff = payoff;\n        }\n    }\n\n    const Real calculated = stat.mean();\n    const Real error = stat.errorEstimate();\n\n    cout << \"Calculated: \" << calculated << \"\\nError esi.: \" << error << endl;\n\n    return 0;\n}<|endoftext|>"}
{"text":"<commit_before><commit_msg>coverity#738933 Uninitialized scalar field<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>All mesh\/shape assignment done on their own lines<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>update emap<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"ffmpegdecoder.h\"\n\nvoid FFmpegDecoder::displayRunnable()\n{\n    CHANNEL_LOG(ffmpeg_threads) << \"Displaying thread started\";\n\n    for (;;)\n    {\n        {\n            boost::unique_lock<boost::mutex> locker(m_videoFramesMutex);\n            m_videoFramesCV.wait(locker, [this]()\n                                     {\n                                         return !m_frameDisplayingRequested &&\n                                                m_videoFramesQueue.canPop();\n                                     });\n        }\n\n        VideoFrame& current_frame = m_videoFramesQueue.front();\n\n        \/\/ Frame skip\n        if (!m_videoFramesQueue.canPush() \n            && m_videoStartClock + current_frame.m_pts < GetHiResTime())\n        {\n            CHANNEL_LOG(ffmpeg_threads) << __FUNCTION__ << \" Framedrop\";\n            finishedDisplayingFrame();\n            continue;\n        }\n\n        m_frameDisplayingRequested = true;\n\n        \/\/ Possibly give it time to render frame\n        if (m_frameListener)\n        {\n            m_frameListener->updateFrame();\n        }\n\n        for (;;)\n        {\n            const double delay = m_videoStartClock + current_frame.m_pts - GetHiResTime();\n            if (delay < 0.005)\n                break;\n            if (delay > 0.1)\n            {\n                boost::this_thread::sleep_for(boost::chrono::milliseconds(100));\n                continue;\n            }\n\n            boost::this_thread::sleep_for(boost::chrono::milliseconds(int(delay * 1000.)));\n            break;\n        }\n\n        \/\/ It's time to display converted frame\n        if (current_frame.m_duration != AV_NOPTS_VALUE)\n        {\n            m_currentTime = current_frame.m_duration = current_frame.m_duration;\n            if (m_decoderListener && m_seekDuration == AV_NOPTS_VALUE)\n            {\n                m_decoderListener->changedFramePosition(\n                    m_startTime,\n                    current_frame.m_duration,\n                    m_duration + m_startTime);\n            }\n        }\n        if (m_frameListener)\n        {\n            m_frameListener->drawFrame();\n        }\n        else\n        {\n            finishedDisplayingFrame();\n        }\n    }\n}\n<commit_msg>Small correction<commit_after>#include \"ffmpegdecoder.h\"\n\nvoid FFmpegDecoder::displayRunnable()\n{\n    CHANNEL_LOG(ffmpeg_threads) << \"Displaying thread started\";\n\n    for (;;)\n    {\n        {\n            boost::unique_lock<boost::mutex> locker(m_videoFramesMutex);\n            m_videoFramesCV.wait(locker, [this]()\n                                     {\n                                         return !m_frameDisplayingRequested &&\n                                                m_videoFramesQueue.canPop();\n                                     });\n        }\n\n        const VideoFrame& current_frame = m_videoFramesQueue.front();\n\n        \/\/ Frame skip\n        if (!m_videoFramesQueue.canPush() \n            && m_videoStartClock + current_frame.m_pts < GetHiResTime())\n        {\n            CHANNEL_LOG(ffmpeg_threads) << __FUNCTION__ << \" Framedrop\";\n            finishedDisplayingFrame();\n            continue;\n        }\n\n        m_frameDisplayingRequested = true;\n\n        \/\/ Possibly give it time to render frame\n        if (m_frameListener)\n        {\n            m_frameListener->updateFrame();\n        }\n\n        for (;;)\n        {\n            const double delay = m_videoStartClock + current_frame.m_pts - GetHiResTime();\n            if (delay < 0.005)\n                break;\n            if (delay > 0.1)\n            {\n                boost::this_thread::sleep_for(boost::chrono::milliseconds(100));\n                continue;\n            }\n\n            boost::this_thread::sleep_for(boost::chrono::milliseconds(int(delay * 1000.)));\n            break;\n        }\n\n        \/\/ It's time to display converted frame\n        if (current_frame.m_duration != AV_NOPTS_VALUE)\n        {\n            m_currentTime = current_frame.m_duration;\n            if (m_decoderListener && m_seekDuration == AV_NOPTS_VALUE)\n            {\n                m_decoderListener->changedFramePosition(\n                    m_startTime,\n                    current_frame.m_duration,\n                    m_duration + m_startTime);\n            }\n        }\n        if (m_frameListener)\n        {\n            m_frameListener->drawFrame();\n        }\n        else\n        {\n            finishedDisplayingFrame();\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n-----------------------------------------------------------------------------\nThis source file is part of OGRE\n    (Object-oriented Graphics Rendering Engine)\nFor the latest info, see http:\/\/www.ogre3d.org\/\n\nCopyright (c) 2000-2009 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 \"OgreGLES2TextureManager.h\"\n#include \"OgreGLES2RenderTexture.h\"\n#include \"OgreRoot.h\"\n#include \"OgreRenderSystem.h\"\n\nnamespace Ogre {\n    GLES2TextureManager::GLES2TextureManager(GLES2Support& support)\n        : TextureManager(), mGLSupport(support), mWarningTextureID(0)\n    {\n        GL_CHECK_ERROR;\n        \/\/ Register with group manager\n        ResourceGroupManager::getSingleton()._registerResourceManager(mResourceType, this);\n\n        createWarningTexture();\n    }\n\n    GLES2TextureManager::~GLES2TextureManager()\n    {\n        \/\/ Unregister with group manager\n        ResourceGroupManager::getSingleton()._unregisterResourceManager(mResourceType);\n        \/\/ Delete warning texture\n        glDeleteTextures(1, &mWarningTextureID);\n        GL_CHECK_ERROR;\n    }\n\n    Resource* GLES2TextureManager::createImpl(const String& name, ResourceHandle handle, \n                                           const String& group, bool isManual,\n                                           ManualResourceLoader* loader,\n                                           const NameValuePairList* createParams)\n    {\n        return OGRE_NEW GLES2Texture(this, name, handle, group, isManual, loader, mGLSupport);\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    void GLES2TextureManager::createWarningTexture()\n    {\n        \/\/ Generate warning texture\n        size_t width = 8;\n        size_t height = 8;\n\n        \/\/ TODO convert to 5_6_5\n        uint32* data = OGRE_NEW_FIX_FOR_WIN32 uint32[width * height]; \/\/ 0xXXRRGGBB\n\n        \/\/ Yellow\/black stripes\n        for(size_t y = 0; y < height; ++y)\n        {\n            for(size_t x = 0; x < width; ++x)\n            {\n                data[y * width + x] = (((x + y) % 8) < 4) ? 0x000000 : 0xFFFF00;\n            }\n        }\n\n        \/\/ Create GL resource\n        glGenTextures(1, &mWarningTextureID);\n        GL_CHECK_ERROR;\n        glBindTexture(GL_TEXTURE_2D, mWarningTextureID);\n        GL_CHECK_ERROR;\n#if GL_APPLE_texture_max_level\n        glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAX_LEVEL_APPLE, 0);\n#endif\n        glTexImage2D(GL_TEXTURE_2D, 0, GL_RGB, width, height, 0, GL_RGB,\n                     GL_UNSIGNED_SHORT_5_6_5, (void*)data);\n        GL_CHECK_ERROR;\n        \/\/ Free memory\n        OGRE_DELETE [] data;\n    }\n\n    PixelFormat GLES2TextureManager::getNativeFormat(TextureType ttype, PixelFormat format, int usage)\n    {\n        \/\/ Adjust requested parameters to capabilities\n        const RenderSystemCapabilities *caps = Root::getSingleton().getRenderSystem()->getCapabilities();\n\n        \/\/ Check compressed texture support\n        \/\/ if a compressed format not supported, revert to PF_A8R8G8B8\n        if (PixelUtil::isCompressed(format) &&\n            !caps->hasCapability(RSC_TEXTURE_COMPRESSION_DXT) && !caps->hasCapability(RSC_TEXTURE_COMPRESSION_PVRTC))\n        {\n            return PF_A8R8G8B8;\n        }\n        \/\/ if floating point textures not supported, revert to PF_A8R8G8B8\n        if (PixelUtil::isFloatingPoint(format) &&\n            !caps->hasCapability(RSC_TEXTURE_FLOAT))\n        {\n            return PF_A8R8G8B8;\n        }\n\n        \/\/ Check if this is a valid rendertarget format\n        if (usage & TU_RENDERTARGET)\n        {\n            \/\/\/ Get closest supported alternative\n            \/\/\/ If mFormat is supported it's returned\n            return GLES2RTTManager::getSingleton().getSupportedAlternative(format);\n        }\n\n        \/\/ Supported\n        return format;\n    }\n\n    bool GLES2TextureManager::isHardwareFilteringSupported(TextureType ttype, PixelFormat format, int usage,\n            bool preciseFormatOnly)\n    {\n        if (format == PF_UNKNOWN)\n        {\n            return false;\n        }\n\n        \/\/ Check native format\n        PixelFormat nativeFormat = getNativeFormat(ttype, format, usage);\n        if (preciseFormatOnly && format != nativeFormat)\n        {\n            return false;\n        }\n\n        \/\/ Assume non-floating point is supported always\n        if (!PixelUtil::isFloatingPoint(nativeFormat))\n        {\n            return true;\n        }\n\n        return false;\n    }\n}\n<commit_msg>GLES2 render system: On windows the emulation has a bug that makes it crash on exit when releasing the warning texture. Solved by adding a #if to check for win32 then don’t execute that problematic line.<commit_after>\/*\n-----------------------------------------------------------------------------\nThis source file is part of OGRE\n    (Object-oriented Graphics Rendering Engine)\nFor the latest info, see http:\/\/www.ogre3d.org\/\n\nCopyright (c) 2000-2009 Torus Knot Software Ltd\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 \"OgreGLES2TextureManager.h\"\n#include \"OgreGLES2RenderTexture.h\"\n#include \"OgreRoot.h\"\n#include \"OgreRenderSystem.h\"\n\nnamespace Ogre {\n    GLES2TextureManager::GLES2TextureManager(GLES2Support& support)\n        : TextureManager(), mGLSupport(support), mWarningTextureID(0)\n    {\n        GL_CHECK_ERROR;\n        \/\/ Register with group manager\n        ResourceGroupManager::getSingleton()._registerResourceManager(mResourceType, this);\n\n        createWarningTexture();\n    }\n\n    GLES2TextureManager::~GLES2TextureManager()\n    {\n        \/\/ Unregister with group manager\n        ResourceGroupManager::getSingleton()._unregisterResourceManager(mResourceType);\n\n\/\/ on windows the emulation has a bug that makes this line crash\n#if (OGRE_PLATFORM != OGRE_PLATFORM_WIN32)\n        \/\/ Delete warning texture\n        glDeleteTextures(1, &mWarningTextureID);\n        GL_CHECK_ERROR;\n#endif\n    }\n\n    Resource* GLES2TextureManager::createImpl(const String& name, ResourceHandle handle, \n                                           const String& group, bool isManual,\n                                           ManualResourceLoader* loader,\n                                           const NameValuePairList* createParams)\n    {\n        return OGRE_NEW GLES2Texture(this, name, handle, group, isManual, loader, mGLSupport);\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    void GLES2TextureManager::createWarningTexture()\n    {\n        \/\/ Generate warning texture\n        size_t width = 8;\n        size_t height = 8;\n\n        \/\/ TODO convert to 5_6_5\n        uint32* data = OGRE_NEW_FIX_FOR_WIN32 uint32[width * height]; \/\/ 0xXXRRGGBB\n\n        \/\/ Yellow\/black stripes\n        for(size_t y = 0; y < height; ++y)\n        {\n            for(size_t x = 0; x < width; ++x)\n            {\n                data[y * width + x] = (((x + y) % 8) < 4) ? 0x000000 : 0xFFFF00;\n            }\n        }\n\n        \/\/ Create GL resource\n        glGenTextures(1, &mWarningTextureID);\n        GL_CHECK_ERROR;\n        glBindTexture(GL_TEXTURE_2D, mWarningTextureID);\n        GL_CHECK_ERROR;\n#if GL_APPLE_texture_max_level\n        glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAX_LEVEL_APPLE, 0);\n#endif\n        glTexImage2D(GL_TEXTURE_2D, 0, GL_RGB, width, height, 0, GL_RGB,\n                     GL_UNSIGNED_SHORT_5_6_5, (void*)data);\n        GL_CHECK_ERROR;\n        \/\/ Free memory\n        OGRE_DELETE [] data;\n    }\n\n    PixelFormat GLES2TextureManager::getNativeFormat(TextureType ttype, PixelFormat format, int usage)\n    {\n        \/\/ Adjust requested parameters to capabilities\n        const RenderSystemCapabilities *caps = Root::getSingleton().getRenderSystem()->getCapabilities();\n\n        \/\/ Check compressed texture support\n        \/\/ if a compressed format not supported, revert to PF_A8R8G8B8\n        if (PixelUtil::isCompressed(format) &&\n            !caps->hasCapability(RSC_TEXTURE_COMPRESSION_DXT) && !caps->hasCapability(RSC_TEXTURE_COMPRESSION_PVRTC))\n        {\n            return PF_A8R8G8B8;\n        }\n        \/\/ if floating point textures not supported, revert to PF_A8R8G8B8\n        if (PixelUtil::isFloatingPoint(format) &&\n            !caps->hasCapability(RSC_TEXTURE_FLOAT))\n        {\n            return PF_A8R8G8B8;\n        }\n\n        \/\/ Check if this is a valid rendertarget format\n        if (usage & TU_RENDERTARGET)\n        {\n            \/\/\/ Get closest supported alternative\n            \/\/\/ If mFormat is supported it's returned\n            return GLES2RTTManager::getSingleton().getSupportedAlternative(format);\n        }\n\n        \/\/ Supported\n        return format;\n    }\n\n    bool GLES2TextureManager::isHardwareFilteringSupported(TextureType ttype, PixelFormat format, int usage,\n            bool preciseFormatOnly)\n    {\n        if (format == PF_UNKNOWN)\n        {\n            return false;\n        }\n\n        \/\/ Check native format\n        PixelFormat nativeFormat = getNativeFormat(ttype, format, usage);\n        if (preciseFormatOnly && format != nativeFormat)\n        {\n            return false;\n        }\n\n        \/\/ Assume non-floating point is supported always\n        if (!PixelUtil::isFloatingPoint(nativeFormat))\n        {\n            return true;\n        }\n\n        return false;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <memory>\n#include \"VectorIndexer.hpp\"\n\nnamespace Rendering\n{\n\tnamespace Manager\n\t{\n\t\ttemplate <typename BufferType>\n\t\tclass BufferPool final\n\t\t{\n\t\tpublic:\n\t\t\tBufferPool() = default;\n\t\t\tDISALLOW_ASSIGN_COPY(BufferPool<BufferType>);\n\n\t\t\tvoid Add(const std::string& file, const std::string& key, const BufferType& bufferData)\n\t\t\t{\n\t\t\t\t_buffers.Add(file + \":\" + key, bufferData);\n\t\t\t}\n\n\t\t\tauto Find(const std::string& file, const std::string& key)\n\t\t\t{\n\t\t\t\tstd::string findKey = file + \":\" + key;\n\t\t\t\treturn _buffers.Find(findKey);\n\t\t\t}\n\n\t\t\tbool Has(const std::string& file, const std::string& key) const\n\t\t\t{\n\t\t\t\treturn _buffers.Has(file + \":\" + key);\n\t\t\t}\n\n\t\t\tvoid DeleteBuffer(const std::string& file, const std::string& key)\n\t\t\t{\n\t\t\t\tuint findIndex = _buffers.GetIndexer().Find(file + \":\" + key);\n\n\t\t\t\tauto failIDx = Core::VectorMap<std::string, BufferType>::IndexyerType::FailIndex();\n\t\t\t\tif (findIndex != failIDx)\n\t\t\t\t\t_buffers.Delete(findIndex);\n\t\t\t}\n\n\t\t\tvoid Destroy()\n\t\t\t{\n\t\t\t\t_buffers.DeleteAll();\n\t\t\t}\n\n\t\tprivate:\n\t\t\tCore::VectorMap<std::string, BufferType>\t\t_buffers;\n\t\t};\n\t}\n}<commit_msg>BufferPool - VertexBuffer 특수화<commit_after>#pragma once\n\n#include <memory>\n#include \"VectorIndexer.hpp\"\n\nnamespace Rendering\n{\n\tnamespace Buffer\n\t{\n\t\tclass VertexBuffer;\n\t};\n\n\tnamespace Manager\n\t{\n\t\ttemplate <typename BufferType>\n\t\tclass BufferPool final\n\t\t{\n\t\tpublic:\n\t\t\tBufferPool() = default;\n\t\t\tDISALLOW_ASSIGN_COPY(BufferPool<BufferType>);\n\n\t\t\tvoid Add(const std::string& file, const std::string& key, const BufferType& bufferData)\n\t\t\t{\n\t\t\t\t_buffers.Add(file + \":\" + key, bufferData);\n\t\t\t}\n\n\t\t\tauto Find(const std::string& file, const std::string& key)\n\t\t\t{\n\t\t\t\tstd::string findKey = file + \":\" + key;\n\t\t\t\treturn _buffers.Find(findKey);\n\t\t\t}\n\n\t\t\tbool Has(const std::string& file, const std::string& key) const\n\t\t\t{\n\t\t\t\treturn _buffers.Has(file + \":\" + key);\n\t\t\t}\n\n\t\t\tvoid DeleteBuffer(const std::string& file, const std::string& key)\n\t\t\t{\n\t\t\t\tuint findIndex = _buffers.GetIndexer().Find(file + \":\" + key);\n\n\t\t\t\tauto failIDx = Core::VectorMap<std::string, BufferType>::IndexyerType::FailIndex();\n\t\t\t\tif (findIndex != failIDx)\n\t\t\t\t\t_buffers.Delete(findIndex);\n\t\t\t}\n\n\t\t\tvoid Destroy()\n\t\t\t{\n\t\t\t\t_buffers.DeleteAll();\n\t\t\t}\n\n\t\tprivate:\n\t\t\tCore::VectorMap<std::string, BufferType>\t\t_buffers;\n\t\t};\n\n\t\ttemplate <>\n\t\tclass BufferPool<Buffer::VertexBuffer> final\n\t\t{\n\t\tpublic:\n\t\t\tBufferPool() = default;\n\t\t\tDISALLOW_ASSIGN_COPY(BufferPool);\n\n\t\t\tstatic uint MakeKey(const std::string& fileName, uint vbChunkKey)\n\t\t\t{\n\t\t\t\treturn std::hash<std::string>()(fileName + std::to_string(vbChunkKey));\n\t\t\t}\n\t\t\tstatic std::string MakeStrKey(const std::string& fileName, uint vbChunkKey)\n\t\t\t{\n\t\t\t\treturn fileName + \":\" + std::to_string(vbChunkKey);\n\t\t\t}\n\n\t\t\tvoid Add(const std::string& file, uint vbChunkKey, const Buffer::VertexBuffer& bufferData)\n\t\t\t{\n\t\t\t\tstd::string strKey = MakeStrKey(file, vbChunkKey);\n\n\t\t\t\t_indexer.Add(strKey, bufferData.GetKey());\n\t\t\t\t_buffers.Add(bufferData.GetKey(), bufferData);\n\t\t\t}\n\n\t\t\tauto Find(const std::string& file, uint vbChunkKey)\n\t\t\t{\n\t\t\t\tstd::string strKey = MakeStrKey(file, vbChunkKey);\n\n\t\t\t\tuint hashKey = _indexer.Find(strKey);\n\t\t\t\treturn _buffers.Find(hashKey);\n\t\t\t}\n\t\t\tbool Has(const std::string& file, uint vbChunkKey) const\n\t\t\t{\n\t\t\t\treturn _indexer.Has(MakeStrKey(file, vbChunkKey));\n\t\t\t}\n\t\t\tvoid DeleteBuffer(const std::string& file, uint vbChunkKey)\n\t\t\t{\n\t\t\t\tstd::string strKey = MakeStrKey(file, vbChunkKey);\n\t\t\t\tuint findKey = _indexer.Find(strKey);\n\n\t\t\t\tif (findKey != -1)\n\t\t\t\t{\n\t\t\t\t\t_buffers.Delete(findKey);\n\t\t\t\t\t_indexer.Delete(strKey);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tauto Find(uint vbKey)\n\t\t\t{\n\t\t\t\treturn _buffers.Find(vbKey);\n\t\t\t}\n\t\t\tbool Has(uint vbKey) const\n\t\t\t{\n\t\t\t\treturn _buffers.Has(vbKey);\n\t\t\t}\n\t\t\tvoid DeleteBuffer(uint vbKey)\n\t\t\t{\n\t\t\t\tauto vb = _buffers.Find(vbKey);\n\t\t\t\tif (vb == nullptr) return;\n\n\t\t\t\t_buffers.Delete(vbKey);\n\t\t\t\t_indexer.Delete(vb->GetStrKey());\n\t\t\t}\n\n\n\t\t\tvoid Destroy()\n\t\t\t{\n\t\t\t\t_buffers.DeleteAll();\n\t\t\t\t_indexer.DeleteAll();\n\t\t\t}\n\n\t\tprivate:\n\t\t\tCore::IndexHashMap<std::string>\t\t\t\t_indexer;\n\t\t\tCore::VectorMap<uint, Buffer::VertexBuffer> _buffers;\n\t\t};\n\n\t\tusing VBPool = BufferPool<Buffer::VertexBuffer>;\n\t}\n}<|endoftext|>"}
{"text":"<commit_before>#include \"neko_function.h\"\n\n#include <algorithm>\n#include <iostream>\n\nextern \"C\" {\n\t#include \"..\/opcodes.h\"\n\t#include \"..\/neko.h\"\n}\n\nnamespace {\n\tstd::vector<ptr_val> get_block_addresses(NekoCodeChunk const & code_chunk) {\n\t\tstd::vector<ptr_val> block_addresses;\n\n\t\tfor (NekoCodeChunk::const_iterator it = code_chunk.begin(); it != code_chunk.end(); ++it) {\n\t\t\tswitch (it->second.first) {\n\t\t\t\tcase Jump:\n\t\t\t\t\tblock_addresses.push_back(it->second.second);\n\t\t\t\t\tbreak;\n\t\t\t\tcase JumpIf:\n\t\t\t\tcase JumpIfNot:\n\t\t\t\t\t{\n\t\t\t\t\t\tblock_addresses.push_back(it->second.second);\n\t\t\t\t\t\t\/\/in llvm jump always have 'then' and 'else' parts\n\t\t\t\t\t\tNekoCodeChunk::const_iterator next = it; ++next;\n\t\t\t\t\t\tif (next != code_chunk.end()) {\n\t\t\t\t\t\t\tblock_addresses.push_back(next->first);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\t\/\/do nothing\n\t\t\t\t\t;\n\t\t\t}\n\t\t}\n\n\t\treturn block_addresses;\n\t}\n\n\tneko::BasicBlock make_block(NekoCodeChunk const & chunk) {\n\t\treturn neko::BasicBlock(chunk);\n\t}\n\n\tneko::Function::blocks_container get_blocks(NekoCodeChunk const & chunk) {\n\t\tstd::vector<ptr_val> block_addresses = get_block_addresses(chunk);\n\t\tstd::vector<NekoCodeChunk> chunks = chunk.splitByAddresses(block_addresses);\n\n\t\tneko::Function::blocks_container result;\n\t\tresult.reserve(chunks.size());\n\n\t\tstd::transform(chunks.begin(), chunks.end(),\n\t\t\t\t\t   std::back_inserter(result),\n\t\t\t\t\t   std::ptr_fun(make_block));\n\n\t\treturn result;\n\t}\n}\n\nneko::Function::Function(NekoCodeChunk const & code_chunk, std::string const & name_, vfunction const * f)\n\t: blocks(get_blocks(code_chunk))\n\t, name(name_)\n\t, nargs(f->nargs)\n{}\n\nneko::Function::Function(NekoCodeChunk const & code_chunk, std::string const & name_)\n\t: blocks(get_blocks(code_chunk))\n\t, name(name_)\n\t, nargs(0)\n{}\n\nvoid neko::Function::neko_dump(std::string const & indent) const {\n\tstd::cout << indent << \"def \" << name << \" {\" << std::endl;\n\tstd::cout << indent << \"\\t\/\/Number of blocks: \" << blocks.size() << std::endl;\n\tfor (const_iterator it = begin();\n\t\t it != end();\n\t\t ++it) {\n\t\tit->neko_dump(indent + '\\t');\n\t}\n\tstd::cout << indent << \"}\" << std::endl;\n}\n<commit_msg>Show number of arguments when dumping neko code<commit_after>#include \"neko_function.h\"\n\n#include <algorithm>\n#include <iostream>\n\nextern \"C\" {\n\t#include \"..\/opcodes.h\"\n\t#include \"..\/neko.h\"\n}\n\nnamespace {\n\tstd::vector<ptr_val> get_block_addresses(NekoCodeChunk const & code_chunk) {\n\t\tstd::vector<ptr_val> block_addresses;\n\n\t\tfor (NekoCodeChunk::const_iterator it = code_chunk.begin(); it != code_chunk.end(); ++it) {\n\t\t\tswitch (it->second.first) {\n\t\t\t\tcase Jump:\n\t\t\t\t\tblock_addresses.push_back(it->second.second);\n\t\t\t\t\tbreak;\n\t\t\t\tcase JumpIf:\n\t\t\t\tcase JumpIfNot:\n\t\t\t\t\t{\n\t\t\t\t\t\tblock_addresses.push_back(it->second.second);\n\t\t\t\t\t\t\/\/in llvm jump always have 'then' and 'else' parts\n\t\t\t\t\t\tNekoCodeChunk::const_iterator next = it; ++next;\n\t\t\t\t\t\tif (next != code_chunk.end()) {\n\t\t\t\t\t\t\tblock_addresses.push_back(next->first);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\t\/\/do nothing\n\t\t\t\t\t;\n\t\t\t}\n\t\t}\n\n\t\treturn block_addresses;\n\t}\n\n\tneko::BasicBlock make_block(NekoCodeChunk const & chunk) {\n\t\treturn neko::BasicBlock(chunk);\n\t}\n\n\tneko::Function::blocks_container get_blocks(NekoCodeChunk const & chunk) {\n\t\tstd::vector<ptr_val> block_addresses = get_block_addresses(chunk);\n\t\tstd::vector<NekoCodeChunk> chunks = chunk.splitByAddresses(block_addresses);\n\n\t\tneko::Function::blocks_container result;\n\t\tresult.reserve(chunks.size());\n\n\t\tstd::transform(chunks.begin(), chunks.end(),\n\t\t\t\t\t   std::back_inserter(result),\n\t\t\t\t\t   std::ptr_fun(make_block));\n\n\t\treturn result;\n\t}\n}\n\nneko::Function::Function(NekoCodeChunk const & code_chunk, std::string const & name_, vfunction const * f)\n\t: blocks(get_blocks(code_chunk))\n\t, name(name_)\n\t, nargs(f->nargs)\n{}\n\nneko::Function::Function(NekoCodeChunk const & code_chunk, std::string const & name_)\n\t: blocks(get_blocks(code_chunk))\n\t, name(name_)\n\t, nargs(0)\n{}\n\nvoid neko::Function::neko_dump(std::string const & indent) const {\n\tstd::cout << indent << \"def \" << name << \"(\";\n\tfor (int i = 0; i < nargs; i++) {\n\t\tif (i != 0) {\n\t\t\tstd::cout << \", \";\n\t\t}\n\t\tstd::cout << \"int\";\n\t}\n\tstd::cout << \") {\" << std::endl;\n\tstd::cout << indent << \"\\t\/\/Number of blocks: \" << blocks.size() << std::endl;\n\tfor (const_iterator it = begin();\n\t\t it != end();\n\t\t ++it) {\n\t\tit->neko_dump(indent + '\\t');\n\t}\n\tstd::cout << indent << \"}\" << std::endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef BLOCK_MASKS_HPP__\n#define BLOCK_MASKS_HPP__\n\n#include <cassert>\n\nnamespace clotho {\nnamespace utility {\n\n\ntemplate < class Block >\nclass block_masks {\npublic:\n    static const unsigned int bits_per_block = sizeof( Block ) * 8;\n\n    typedef Block block_type;\n    typedef Block mask_type;\n\n    static const mask_type (&lookupLowBitMask())[bits_per_block] {\n        init();\n        return low_order_bit_masks;\n    }\n\n    static const mask_type (&lookupPositionMask())[bits_per_block] {\n        init();\n        return bit_position_masks;\n    }\n\n    static mask_type low_order_mask( unsigned int idx ) {\n        assert( idx < bits_per_block );\n        return ((idx == bits_per_block - 1) ? (mask_type)-1 : (( (mask_type)1 << (idx + 1) ) - 1));\n    }\n\n    static mask_type position_mask( unsigned int idx ) {\n        assert( idx < bits_per_block );\n        return ((mask_type)1 << idx);\n    }\n\nprivate:\n\n    \/\/\/  LOW_BIT_MASK => bits_{[0, n]} = 1\n    static mask_type low_order_bit_masks[ bits_per_block ];\n\n    \/\/\/ OFFSET_BIT_MASK => bit_[n] = 1\n    static mask_type bit_position_masks[ bits_per_block ];\n\n    static void init() {\n        static bool _init_low_order = init_low_order(low_order_bit_masks) \n                                        && init_positions(bit_position_masks);\n    }\n\n    static bool init_low_order( mask_type * masks ) {\n        for( unsigned int i = 0; i < bits_per_block; ++i ) {\n            (*masks++) = low_order_mask( i );\n        }\n        return true;\n    }\n\n    static bool init_positions( mask_type * masks ) {\n        for( unsigned int i = 0; i < bits_per_block; ++i ) {\n            (*masks++) = position_mask( i );\n        }\n        return true;\n    }\n};\n\ntemplate < class Block >\ntypename block_masks< Block >::mask_type block_masks< Block >::low_order_bit_masks[ block_masks< Block >::bits_per_block ];\n\ntemplate < class Block >\ntypename block_masks< Block >::mask_type block_masks< Block >::bit_position_masks[ block_masks< Block >::bits_per_block ];\n}   \/\/ namespace utility {\n}   \/\/ namespace clotho {\n#endif  \/\/ BLOCK_MASKS_HPP__\n<commit_msg>Added return statement to clean up warning message<commit_after>#ifndef BLOCK_MASKS_HPP__\n#define BLOCK_MASKS_HPP__\n\n#include <cassert>\n\nnamespace clotho {\nnamespace utility {\n\n\ntemplate < class Block >\nclass block_masks {\npublic:\n    static const unsigned int bits_per_block = sizeof( Block ) * 8;\n\n    typedef Block block_type;\n    typedef Block mask_type;\n\n    static const mask_type (&lookupLowBitMask())[bits_per_block] {\n        init();\n        return low_order_bit_masks;\n    }\n\n    static const mask_type (&lookupPositionMask())[bits_per_block] {\n        init();\n        return bit_position_masks;\n    }\n\n    static mask_type low_order_mask( unsigned int idx ) {\n        assert( idx < bits_per_block );\n        return ((idx == bits_per_block - 1) ? (mask_type)-1 : (( (mask_type)1 << (idx + 1) ) - 1));\n    }\n\n    static mask_type position_mask( unsigned int idx ) {\n        assert( idx < bits_per_block );\n        return ((mask_type)1 << idx);\n    }\n\nprivate:\n\n    \/\/\/  LOW_BIT_MASK => bits_{[0, n]} = 1\n    static mask_type low_order_bit_masks[ bits_per_block ];\n\n    \/\/\/ OFFSET_BIT_MASK => bit_[n] = 1\n    static mask_type bit_position_masks[ bits_per_block ];\n\n    static bool init() {\n        static bool _init_low_order = init_low_order(low_order_bit_masks) \n                                        && init_positions(bit_position_masks);\n        return _init_low_order;\n    }\n\n    static bool init_low_order( mask_type * masks ) {\n        for( unsigned int i = 0; i < bits_per_block; ++i ) {\n            (*masks++) = low_order_mask( i );\n        }\n        return true;\n    }\n\n    static bool init_positions( mask_type * masks ) {\n        for( unsigned int i = 0; i < bits_per_block; ++i ) {\n            (*masks++) = position_mask( i );\n        }\n        return true;\n    }\n};\n\ntemplate < class Block >\ntypename block_masks< Block >::mask_type block_masks< Block >::low_order_bit_masks[ block_masks< Block >::bits_per_block ];\n\ntemplate < class Block >\ntypename block_masks< Block >::mask_type block_masks< Block >::bit_position_masks[ block_masks< Block >::bits_per_block ];\n}   \/\/ namespace utility {\n}   \/\/ namespace clotho {\n#endif  \/\/ BLOCK_MASKS_HPP__\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <iostream>\n#include <iomanip>\n#include <stdexcept>\n\n#include \"acmacs-base\/date2.hh\"\n#include \"acmacs-base\/week2.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace acmacs\n{\n    class date_parse_error : public std::runtime_error { public: using std::runtime_error::runtime_error; };\n}\n\nclass Date\n{\n public:\n    enum Today { Today };\n\n    Date() : date_(date::year(9999), date::month(99), date::day(99)) {}         \/\/ invalid date by default\n    Date(const Date&) = default;\n    Date(enum Today) : date_{date::floor<date::days>(std::chrono::system_clock::now())} {}\n    Date(const char* aText) { from_string(std::string(aText)); }\n    Date(std::string aText) { from_string(aText); }\n    Date(std::string_view aText) { from_string(aText); }\n    Date(const date::year_month_day& src) : date_(src) {}\n    Date(const date::sys_days& src) : date_(src) {}\n    Date(int year, unsigned month, unsigned day) : date_(date::year(year), date::month(month), date::day(day)) {}\n    static inline Date today() { return Today; }\n\n    Date& operator=(const Date&) = default;\n    Date& operator=(std::string aText) { if (!aText.empty()) from_string(aText); return *this; }\n    Date& operator=(std::string_view aText) { if (!aText.empty()) from_string(aText); return *this; }\n    Date& operator=(const char* aText) { if (aText && *aText) from_string(std::string_view(aText)); return *this; }\n\n    Date months_ago(int number_of_months) const { return date_ - date::months(number_of_months); }\n    Date years_ago(int number_of_years) const { return date_ - date::years(number_of_years); }\n    Date weeks_ago(int number_of_weeks) const { return static_cast<date::sys_days>(date_) - date::weeks(number_of_weeks); }\n\n    bool operator < (const Date& d) const { return date_ < d.date_; }\n    bool operator > (const Date& d) const { return date_ > d.date_; }\n    bool operator == (const Date& d) const { return date_ == d.date_; }\n    bool operator != (const Date& d) const { return date_ != d.date_; }\n    bool operator <= (const Date& d) const { return date_ <= d.date_; }\n    bool operator >= (const Date& d) const { return date_ >= d.date_; }\n\n    bool empty() const { return !date_.ok(); }\n    operator bool() const { return date_.ok(); }\n    auto year() const { return static_cast<int>(date_.year()); }\n    auto month() const { return static_cast<unsigned>(date_.month()); }\n    auto day() const { return static_cast<unsigned>(date_.day()); }\n\n    std::string display(const char* format = \"%Y-%m-%d\") const { return date_.ok() ? date::format(format, date_) : std::string{\"*invalid-date*\"}; }\n    operator std::string() const { return display(); }\n\n      \/\/ returns date for the 1st day of the year-month stored in this\n    Date beginning_of_month() const { return date::year_month_day(date_.year(), date_.month(), date::day{1}); }\n    Date beginning_of_year() const { return date::year_month_day(date_.year(), date::month{1}, date::day{1}); }\n    Date beginning_of_week() const\n        {\n            iso_week::year_weeknum_weekday yw(date_);\n            return {iso_week::year_weeknum_weekday(yw.year(), yw.weeknum(), iso_week::weekday{date::Monday})};\n        }\n\n    Date& increment_month(int number_of_months = 1) { date_ += date::months(number_of_months); return *this; }\n    Date& decrement_month(int number_of_months = 1) { date_ -= date::months(number_of_months); return *this; }\n    Date& increment_year(int number_of_years = 1) { date_ += date::years(number_of_years); return *this; }\n    Date& decrement_year(int number_of_years = 1) { date_ -= date::years(number_of_years); return *this; }\n    Date& increment_week(int number_of_weeks = 1) { date_ = static_cast<date::sys_days>(date_) + date::weeks(number_of_weeks); return *this; }\n    Date& decrement_week(int number_of_weeks = 1) { date_ = static_cast<date::sys_days>(date_) - date::weeks(number_of_weeks); return *this; }\n\n    Date next_month() const { return date_ + date::months(1); }\n    Date next_year() const { return date_ + date::years(1); }\n    Date next_week() const { return {static_cast<date::sys_days>(date_) + date::weeks(1)}; }\n\n    std::string month_3() const { return date::format(\"%b\", date_); }\n    std::string year_2() const { return date::format(\"%y\", date_); }\n    std::string year_4() const { return date::format(\"%Y\", date_); }\n    std::string month3_year2() const { return date::format(\"%b %y\", date_); }\n    std::string monthtext_year() const { return date::format(\"%B %Y\", date_); }\n    std::string year4_month2() const { return date::format(\"%Y-%m\", date_); }\n    std::string year4_month2_day2() const { return date::format(\"%Y-%m-%d\", date_); }\n\n      \/\/? const auto& gregorian() const { return date_; }\n\n private:\n    date::year_month_day date_;\n\n    void from_string(std::string_view source)\n        {\n            from_string(std::string(source));\n        }\n\n    void from_string(std::string source)\n        {\n            using namespace date::literals;\n            date_ = 1999_y\/99\/99;\n            for (const char* format : {\"%Y-%m-%d\", \"%Y%m%d\", \"%m\/%d\/%Y\", \"%d\/%m\/%Y\", \"%B%n %d%n %Y\", \"%B %d,%n %Y\", \"%b%n %d%n %Y\", \"%b %d,%n %Y\"}) {\n                std::istringstream in(source);\n                in >> date::parse(format, date_);\n                if (in) {\n                    if (date_.year() < date::year{30})\n                        date_ += date::years(2000);\n                    else if (date_.year() < date::year{100})\n                        date_ += date::years(1900);\n                    return;\n                }\n            }\n            throw acmacs::date_parse_error(\"cannot parse date from \\\"\" + source + '\"');\n        }\n\n public:\n    friend inline int days_between_dates(const Date& a, const Date& b)\n        {\n            return std::chrono::duration_cast<date::days>(static_cast<date::sys_days>(b.date_) - static_cast<date::sys_days>(a.date_)).count();\n        }\n\n    friend inline int weeks_between_dates(const Date& a, const Date& b)\n        {\n            return std::chrono::duration_cast<date::weeks>(static_cast<date::sys_days>(b.date_) - static_cast<date::sys_days>(a.date_)).count();\n        }\n\n    friend inline int months_between_dates(const Date& a, const Date& b)\n        {\n            return std::chrono::duration_cast<date::months>(static_cast<date::sys_days>(b.date_) - static_cast<date::sys_days>(a.date_)).count();\n        }\n\n    friend inline int years_between_dates(const Date& a, const Date& b)\n        {\n            return std::chrono::duration_cast<date::years>(static_cast<date::sys_days>(b.date_) - static_cast<date::sys_days>(a.date_)).count();\n        }\n\n}; \/\/ class Date\n\n\/\/ ----------------------------------------------------------------------\n\ninline std::ostream& operator << (std::ostream& out, const Date& aDate)\n{\n    return out << aDate.display();\n}\n\n\/\/ ----------------------------------------------------------------------\n\n\/\/ https:\/\/stackoverflow.com\/questions\/17223096\/outputting-date-and-time-in-c-using-stdchrono\ninline std::string current_date_time()\n{\n    const auto now = std::chrono::system_clock::now();\n    const auto in_time_t = std::chrono::system_clock::to_time_t(now);\n    std::stringstream ss;\n    ss << std::put_time(std::localtime(&in_time_t), \"%Y-%m-%d %H:%M:%S %Z\");\n    return ss.str();\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<commit_msg>end_of_month()<commit_after>#pragma once\n\n#include <iostream>\n#include <iomanip>\n#include <stdexcept>\n\n#include \"acmacs-base\/date2.hh\"\n#include \"acmacs-base\/week2.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace acmacs\n{\n    class date_parse_error : public std::runtime_error { public: using std::runtime_error::runtime_error; };\n}\n\nclass Date\n{\n public:\n    enum Today { Today };\n\n    Date() : date_(date::year(9999), date::month(99), date::day(99)) {}         \/\/ invalid date by default\n    Date(const Date&) = default;\n    Date(enum Today) : date_{date::floor<date::days>(std::chrono::system_clock::now())} {}\n    Date(const char* aText) { from_string(std::string(aText)); }\n    Date(std::string aText) { from_string(aText); }\n    Date(std::string_view aText) { from_string(aText); }\n    Date(const date::year_month_day& src) : date_(src) {}\n    Date(const date::sys_days& src) : date_(src) {}\n    Date(int year, unsigned month, unsigned day) : date_(date::year(year), date::month(month), date::day(day)) {}\n    static inline Date today() { return Today; }\n\n    Date& operator=(const Date&) = default;\n    Date& operator=(std::string aText) { if (!aText.empty()) from_string(aText); return *this; }\n    Date& operator=(std::string_view aText) { if (!aText.empty()) from_string(aText); return *this; }\n    Date& operator=(const char* aText) { if (aText && *aText) from_string(std::string_view(aText)); return *this; }\n\n    Date months_ago(int number_of_months) const { return date_ - date::months(number_of_months); }\n    Date years_ago(int number_of_years) const { return date_ - date::years(number_of_years); }\n    Date weeks_ago(int number_of_weeks) const { return static_cast<date::sys_days>(date_) - date::weeks(number_of_weeks); }\n\n    bool operator < (const Date& d) const { return date_ < d.date_; }\n    bool operator > (const Date& d) const { return date_ > d.date_; }\n    bool operator == (const Date& d) const { return date_ == d.date_; }\n    bool operator != (const Date& d) const { return date_ != d.date_; }\n    bool operator <= (const Date& d) const { return date_ <= d.date_; }\n    bool operator >= (const Date& d) const { return date_ >= d.date_; }\n\n    bool empty() const { return !date_.ok(); }\n    operator bool() const { return date_.ok(); }\n    auto year() const { return static_cast<int>(date_.year()); }\n    auto month() const { return static_cast<unsigned>(date_.month()); }\n    auto day() const { return static_cast<unsigned>(date_.day()); }\n\n    std::string display(const char* format = \"%Y-%m-%d\") const { return date_.ok() ? date::format(format, date_) : std::string{\"*invalid-date*\"}; }\n    operator std::string() const { return display(); }\n\n      \/\/ returns date for the 1st day of the year-month stored in this\n    Date beginning_of_month() const { return date::year_month_day(date_.year(), date_.month(), date::day{1}); }\n    Date beginning_of_year() const { return date::year_month_day(date_.year(), date::month{1}, date::day{1}); }\n    Date beginning_of_week() const\n        {\n            iso_week::year_weeknum_weekday yw(date_);\n            return {iso_week::year_weeknum_weekday(yw.year(), yw.weeknum(), iso_week::weekday{date::Monday})};\n        }\n\n      \/\/ returns date for the last day of the year-month stored in this\n    Date end_of_month() const { return date::year_month_day(date::year_month_day_last(date_.year(), date::month_day_last(date_.month()))); }\n\n    Date& increment_month(int number_of_months = 1) { date_ += date::months(number_of_months); return *this; }\n    Date& decrement_month(int number_of_months = 1) { date_ -= date::months(number_of_months); return *this; }\n    Date& increment_year(int number_of_years = 1) { date_ += date::years(number_of_years); return *this; }\n    Date& decrement_year(int number_of_years = 1) { date_ -= date::years(number_of_years); return *this; }\n    Date& increment_week(int number_of_weeks = 1) { date_ = static_cast<date::sys_days>(date_) + date::weeks(number_of_weeks); return *this; }\n    Date& decrement_week(int number_of_weeks = 1) { date_ = static_cast<date::sys_days>(date_) - date::weeks(number_of_weeks); return *this; }\n\n    Date next_month() const { return date_ + date::months(1); }\n    Date next_year() const { return date_ + date::years(1); }\n    Date next_week() const { return {static_cast<date::sys_days>(date_) + date::weeks(1)}; }\n\n    std::string month_3() const { return date::format(\"%b\", date_); }\n    std::string year_2() const { return date::format(\"%y\", date_); }\n    std::string year_4() const { return date::format(\"%Y\", date_); }\n    std::string month3_year2() const { return date::format(\"%b %y\", date_); }\n    std::string monthtext_year() const { return date::format(\"%B %Y\", date_); }\n    std::string year4_month2() const { return date::format(\"%Y-%m\", date_); }\n    std::string year4_month2_day2() const { return date::format(\"%Y-%m-%d\", date_); }\n\n      \/\/? const auto& gregorian() const { return date_; }\n\n    constexpr const date::year_month_day& raw() const { return date_; }\n\n private:\n    date::year_month_day date_;\n\n    void from_string(std::string_view source)\n        {\n            from_string(std::string(source));\n        }\n\n    void from_string(std::string source)\n        {\n            using namespace date::literals;\n            date_ = 1999_y\/99\/99;\n            for (const char* format : {\"%Y-%m-%d\", \"%Y%m%d\", \"%m\/%d\/%Y\", \"%d\/%m\/%Y\", \"%B%n %d%n %Y\", \"%B %d,%n %Y\", \"%b%n %d%n %Y\", \"%b %d,%n %Y\"}) {\n                std::istringstream in(source);\n                in >> date::parse(format, date_);\n                if (in) {\n                    if (date_.year() < date::year{30})\n                        date_ += date::years(2000);\n                    else if (date_.year() < date::year{100})\n                        date_ += date::years(1900);\n                    return;\n                }\n            }\n            throw acmacs::date_parse_error(\"cannot parse date from \\\"\" + source + '\"');\n        }\n\n}; \/\/ class Date\n\n\/\/ ----------------------------------------------------------------------\n\ninline int days_between_dates(const Date& a, const Date& b)\n{\n    return std::chrono::duration_cast<date::days>(static_cast<date::sys_days>(b.raw()) - static_cast<date::sys_days>(a.raw())).count();\n}\n\ninline int weeks_between_dates(const Date& a, const Date& b)\n{\n    return std::chrono::duration_cast<date::weeks>(static_cast<date::sys_days>(b.raw()) - static_cast<date::sys_days>(a.raw())).count();\n}\n\ninline int months_between_dates(const Date& a, const Date& b)\n{\n    return std::chrono::duration_cast<date::months>(static_cast<date::sys_days>(b.raw()) - static_cast<date::sys_days>(a.raw())).count();\n}\n\ninline int calendar_months_between_dates(const Date& a, const Date& b)\n{\n    const auto first = a.beginning_of_month(), last = b.beginning_of_month();\n    return (last.year() - first.year()) * 12 + ((static_cast<int>(last.month()) - static_cast<int>(first.month())));\n}\n\ninline int calendar_months_between_dates_inclusive(const Date& a, const Date& b)\n{\n    return calendar_months_between_dates(a, b) + 1;\n}\n\ninline int years_between_dates(const Date& a, const Date& b)\n{\n    return std::chrono::duration_cast<date::years>(static_cast<date::sys_days>(b.raw()) - static_cast<date::sys_days>(a.raw())).count();\n}\n\n\/\/ ----------------------------------------------------------------------\n\ninline std::ostream& operator << (std::ostream& out, const Date& aDate)\n{\n    return out << aDate.display();\n}\n\n\/\/ ----------------------------------------------------------------------\n\n\/\/ https:\/\/stackoverflow.com\/questions\/17223096\/outputting-date-and-time-in-c-using-stdchrono\ninline std::string current_date_time()\n{\n    const auto now = std::chrono::system_clock::now();\n    const auto in_time_t = std::chrono::system_clock::to_time_t(now);\n    std::stringstream ss;\n    ss << std::put_time(std::localtime(&in_time_t), \"%Y-%m-%d %H:%M:%S %Z\");\n    return ss.str();\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2007 Sebastian Sauer <mail@dipe.org>\n *\n * This file is part of SuperKaramba.\n *\n * SuperKaramba 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 * SuperKaramba is distributed in the hope that it will be 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 SuperKaramba; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA\n *\/\n\n#include \"skapplet.h\"\n#include \"skappletadaptor.h\"\n\n#include <QGraphicsScene>\n#include <QPainter>\n#include <QTimer>\n#include <QPointer>\n#include <QStyleOptionGraphicsItem>\n#include <QGraphicsItemGroup>\n#include <QGraphicsView>\n\/\/#include <QPaintEvent>\n\/\/#include <QImage>\n\/\/#include <QLabel>\n\/\/#include <QPixmap>\n\/\/#include <QX11Info>\n\/\/#include <QColor>\n\/\/#include <QPixmap>\n\/\/#include <QFile>\n#include <KDebug>\n#include <KLocale>\n#include <KDialog>\n#include <KFileDialog>\n#include <KToggleAction>\n\n\/\/#include <plasma\/svg.h>\n\n#include \"..\/src\/karamba.h\"\n#include \"..\/src\/karambamanager.h\"\n\nK_EXPORT_PLASMA_APPLET(skapplet, SuperKarambaApplet)\n\n\/\/\/ \\internal d-pointer class.\nclass SuperKarambaApplet::Private : public QObject\n{\n    public:\n        SuperKarambaApplet* applet;\n        Skip::AppletAdaptor* appletadaptor;\n        QPointer<Karamba> themeItem;\n        KUrl themePath;\n\n        explicit Private(SuperKarambaApplet* a) : applet(a), appletadaptor(0), themeItem(0) {}\n        ~Private() { delete appletadaptor; delete themeItem; }\n\n        void initTheme()\n        {\n            Q_ASSERT(applet);\n            Q_ASSERT(themeItem);\n            QPointF origPos = themeItem->pos();\n            themeItem->setParentItem(applet);\n            themeItem->moveToPos( origPos.toPoint() );\n\n            \/\/testcases\n            applet->scene()->installEventFilter(this);\n            QGraphicsView* view = applet->scene()->views()[0];\n            view->installEventFilter(this);\n            view->viewport()->installEventFilter(this);\n\n            \/*\n            KToggleAction* moveAction = themeItem->findChild<KToggleAction*>(\"moveAction\");\n            if( moveAction ) {\n                connect(moveAction, SIGNAL(toggled(bool)), applet, SLOT(moveActionToggled(bool)));\n                applet->setLockApplet( moveAction->isChecked() );\n            }\n            *\/\n\n            delete appletadaptor;\n            appletadaptor = new Skip::AppletAdaptor(themeItem, applet);\n        }\n\n        \/*\n        void setLockApplet(bool locked)\n        {\n            Q_ASSERT(themeItem);\n            KToggleAction* moveAction = themeItem->findChild<KToggleAction*>(\"moveAction\");\n            if( moveAction )\n                moveAction->setChecked(locked);\n        }\n        *\/\n\n    private:\n        bool eventFilter(QObject* watched, QEvent* event)\n        {\n            switch( event->type() ) {\n                case QEvent::ContextMenu:\n                    kDebug() << \"eventFilter type=ContextMenu watched=\" << (watched ? QString(\"%1 [%2]\").arg(watched->objectName()).arg(watched->metaObject()->className()) : \"NULL\") << endl;\n                    \/\/static_cast<QContextMenuEvent*>(event);\n                    \/\/return true;\n                    break;\n                case QEvent::GraphicsSceneContextMenu:\n                    kDebug() << \"eventFilter type=GraphicsSceneContextMenu watched=\" << (watched ? QString(\"%1 [%2]\").arg(watched->objectName()).arg(watched->metaObject()->className()) : \"NULL\") << endl;\n                    break;\n                case QEvent::KeyPress:\n                    kDebug() << \"eventFilter type=KeyPress watched=\" << (watched ? QString(\"%1 [%2]\").arg(watched->objectName()).arg(watched->metaObject()->className()) : \"NULL\") << endl;\n                    \/\/QKeyEvent *keyEvent = static_cast<QKeyEvent*>(event);\n                    \/\/qDebug() << \"Ate key press\" << keyEvent->key();\n                    break;\n                default:\n                    break;\n            }\n            return false;\n        }\n};\n\nSuperKarambaApplet::SuperKarambaApplet(QObject *parent, const QStringList &args)\n    : Plasma::Applet(parent, args)\n    , d(new Private(this))\n{\n    \/\/watchForFocus(d,true);\n\n    kDebug() << \"========================> SuperKarambaApplet Ctor\" << endl;\n    setHasConfigurationInterface(true);\n\n    KConfigGroup cg = config(\"SuperKaramba\");\n    d->themePath = cg.readEntry(\"theme\", KUrl());\n\n    if( ! d->themePath.isValid() ) {\n        \/\/d->themePath = KUrl(\"file:\/\/\/home\/kde4\/svn\/_src\/KDE\/kdeutils\/superkaramba\/examples\/rubyclock\/clock.theme\");\n        \/\/d->themePath = KUrl(\"\/home\/kde4\/svn\/_src\/KDE\/kdeutils\/superkaramba\/examples\/richtext\/richtext.theme\");\n        \/\/d->themePath = KUrl(\"\/home\/kde4\/svn\/_src\/KDE\/kdeutils\/superkaramba\/examples\/pythonclock\/pythonclock.theme\");\n        \/\/d->themePath = KUrl(\"\/home\/kde4\/svn\/_src\/KDE\/kdeutils\/superkaramba\/examples\/aeroai\/aero_aio.skz\");\n\n        KFileDialog* filedialog = new KFileDialog(\n            KUrl(\"kfiledialog:\/\/\/SuperKarambaPlasmaApplet\"), \/\/ startdir\n            i18n(\"*.skz *.theme|Theme Files\\n*|All Files\"), \/\/ filter\n            0, \/\/ custom widget\n            0 \/\/ parent\n        );\n        filedialog->setCaption( i18n(\"SuperKaramba Theme\") );\n        filedialog->setOperationMode( KFileDialog::Opening );\n        filedialog->setMode( KFile::File | KFile::ExistingOnly | KFile::LocalOnly );\n        if( filedialog->exec() )\n            d->themePath = filedialog->selectedUrl();\n    }\n\n    if( d->themePath.isValid() )\n        QTimer::singleShot(100, this, SLOT(loadKaramba()));\n}\n\nSuperKarambaApplet::~SuperKarambaApplet()\n{\n    kDebug() << \"========================> SuperKarambaApplet Dtor\" << endl;\n    \/\/watchForFocus(d, false);\n    delete d;\n}\n\nKaramba* SuperKarambaApplet::karamba() const\n{\n    return d->themeItem;\n}\n\nvoid SuperKarambaApplet::loadKaramba()\n{\n    kDebug() << \"SuperKarambaApplet::loadKaramba() Theme: \" << d->themePath << endl;\n\n    QGraphicsScene *gfxScene = scene();\n    Q_ASSERT( gfxScene );\n    Q_ASSERT( gfxScene->views().count() > 0 );\n\n    d->themeItem = new Karamba(d->themePath, gfxScene->views()[0]);\n    d->initTheme();\n\n    connect(KarambaManager::self(), SIGNAL(karambaStarted(QGraphicsItemGroup*)), this, SLOT(karambaStarted(QGraphicsItemGroup*)));\n    connect(KarambaManager::self(), SIGNAL(karambaClosed(QGraphicsItemGroup*)), this, SLOT(karambaClosed(QGraphicsItemGroup*)));\n}\n\nvoid SuperKarambaApplet::paintInterface(QPainter *painter, const QStyleOptionGraphicsItem *option, const QRect &rect)\n{\n    if( d->appletadaptor )\n        d->appletadaptor->paintInterface(painter, option, rect);\n}\n\nvoid SuperKarambaApplet::showConfigurationInterface()\n{\n    if( d->themeItem )\n        d->themeItem->popupGlobalMenu();\n}\n\nvoid SuperKarambaApplet::configAccepted()\n{\n    kDebug() << \"SuperKarambaApplet::configAccepted\" << endl;\n\n    KConfigGroup cg = config(\"SuperKaramba\");\n    cg.writeEntry(\"theme\", d->themePath);\n    \/*\n    m_showTimeString = ui.showTimeStringCheckBox->checkState() == Qt::Checked;\n    m_showSecondHand = ui.showSecondHandCheckBox->checkState() == Qt::Checked;\n    cg.writeEntry(\"showTimeString\", m_showTimeString);\n    cg.writeEntry(\"showSecondHand\", m_showSecondHand);\n    dataEngine(\"time\")->setProperty(\"reportSeconds\", m_showSecondHand);\n    *\/\n    QGraphicsItem::update();\n    \/*\n    cg.writeEntry(\"size\", ui.spinSize->value());\n    m_theme->resize(ui.spinSize->value(), ui.spinSize->value());\n    QStringList tzs = ui.timeZones->selection();\n    dataEngine(\"time\")->connectSource(m_timezone, this);\n    *\/\n    constraintsUpdated();\n    cg.config()->sync();\n}\n\nvoid SuperKarambaApplet::constraintsUpdated()\n{\n    kDebug() << \"SuperKarambaApplet::constraintsUpdated\" << endl;\n    Plasma::Applet::constraintsUpdated();\n}\n\nQRectF SuperKarambaApplet::boundingRect() const\n{\n    return d->themeItem ? d->themeItem->boundingRect() : Applet::boundingRect();\n}\n\nvoid SuperKarambaApplet::karambaStarted(QGraphicsItemGroup* group)\n{\n    if( ! d->themeItem ) {\n        kDebug()<<\">>>>>>>>>>>> SuperKarambaApplet::karambaStarted\"<<endl;\n        d->themeItem = dynamic_cast< Karamba* >( group );\n        Q_ASSERT(d->themeItem);\n        d->initTheme();\n        QGraphicsItem::update();\n        constraintsUpdated();\n    }\n}\n\nvoid SuperKarambaApplet::karambaClosed(QGraphicsItemGroup* group)\n{\n    if( d->themeItem == group ) {\n        kDebug()<<\">>>>>>>>>>>> SuperKarambaApplet::karambaClosed\"<<endl;\n        d->themeItem = 0;\n    }\n}\n\n\/*\nvoid SuperKarambaApplet::moveActionToggled(bool toggled)\n{\n    if( lockApplet() != toggled )\n        setLockApplet(toggled);\n}\n\nvoid SuperKarambaApplet::slotLockApplet(bool locked)\n{\n    Plasma::Applet::slotLockApplet(locked);\n    d->setLockApplet(locked);\n}\n*\/\n\n#include \"skapplet.moc\"\n<commit_msg>don't crash<commit_after>\/*\n * Copyright (C) 2007 Sebastian Sauer <mail@dipe.org>\n *\n * This file is part of SuperKaramba.\n *\n * SuperKaramba 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 * SuperKaramba is distributed in the hope that it will be 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 SuperKaramba; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA\n *\/\n\n#include \"skapplet.h\"\n#include \"skappletadaptor.h\"\n\n#include <QGraphicsScene>\n#include <QPainter>\n#include <QTimer>\n#include <QPointer>\n#include <QStyleOptionGraphicsItem>\n#include <QGraphicsItemGroup>\n#include <QGraphicsView>\n\/\/#include <QPaintEvent>\n\/\/#include <QImage>\n\/\/#include <QLabel>\n\/\/#include <QPixmap>\n\/\/#include <QX11Info>\n\/\/#include <QColor>\n\/\/#include <QPixmap>\n\/\/#include <QFile>\n#include <KDebug>\n#include <KLocale>\n#include <KDialog>\n#include <KFileDialog>\n#include <KToggleAction>\n\n\/\/#include <plasma\/svg.h>\n\n#include \"..\/src\/karamba.h\"\n#include \"..\/src\/karambamanager.h\"\n\nK_EXPORT_PLASMA_APPLET(skapplet, SuperKarambaApplet)\n\n\/\/\/ \\internal d-pointer class.\nclass SuperKarambaApplet::Private : public QObject\n{\n    public:\n        SuperKarambaApplet* applet;\n        Skip::AppletAdaptor* appletadaptor;\n        QPointer<Karamba> themeItem;\n        KUrl themePath;\n\n        explicit Private(SuperKarambaApplet* a) : applet(a), appletadaptor(0), themeItem(0) {}\n        ~Private() { delete appletadaptor; delete themeItem; }\n\n        void initTheme()\n        {\n            Q_ASSERT(applet);\n            Q_ASSERT(themeItem);\n            QPointF origPos = themeItem->pos();\n            themeItem->setParentItem(applet);\n            themeItem->moveToPos( origPos.toPoint() );\n\n            \/\/testcases\n            applet->scene()->installEventFilter(this);\n            QGraphicsView* view = applet->scene()->views()[0];\n            view->installEventFilter(this);\n            view->viewport()->installEventFilter(this);\n\n            \/*\n            KToggleAction* moveAction = themeItem->findChild<KToggleAction*>(\"moveAction\");\n            if( moveAction ) {\n                connect(moveAction, SIGNAL(toggled(bool)), applet, SLOT(moveActionToggled(bool)));\n                applet->setLockApplet( moveAction->isChecked() );\n            }\n            *\/\n\n            delete appletadaptor;\n            appletadaptor = new Skip::AppletAdaptor(themeItem, applet);\n        }\n\n        \/*\n        void setLockApplet(bool locked)\n        {\n            Q_ASSERT(themeItem);\n            KToggleAction* moveAction = themeItem->findChild<KToggleAction*>(\"moveAction\");\n            if( moveAction )\n                moveAction->setChecked(locked);\n        }\n        *\/\n\n    private:\n        bool eventFilter(QObject* watched, QEvent* event)\n        {\n            switch( event->type() ) {\n                case QEvent::ContextMenu:\n                    kDebug() << \"eventFilter type=ContextMenu watched=\" << (watched ? QString(\"%1 [%2]\").arg(watched->objectName()).arg(watched->metaObject()->className()) : \"NULL\") << endl;\n                    \/\/static_cast<QContextMenuEvent*>(event);\n                    \/\/return true;\n                    break;\n                case QEvent::GraphicsSceneContextMenu:\n                    kDebug() << \"eventFilter type=GraphicsSceneContextMenu watched=\" << (watched ? QString(\"%1 [%2]\").arg(watched->objectName()).arg(watched->metaObject()->className()) : \"NULL\") << endl;\n                    break;\n                case QEvent::KeyPress:\n                    kDebug() << \"eventFilter type=KeyPress watched=\" << (watched ? QString(\"%1 [%2]\").arg(watched->objectName()).arg(watched->metaObject()->className()) : \"NULL\") << endl;\n                    \/\/QKeyEvent *keyEvent = static_cast<QKeyEvent*>(event);\n                    \/\/qDebug() << \"Ate key press\" << keyEvent->key();\n                    break;\n                default:\n                    break;\n            }\n            return false;\n        }\n};\n\nSuperKarambaApplet::SuperKarambaApplet(QObject *parent, const QStringList &args)\n    : Plasma::Applet(parent, args)\n    , d(new Private(this))\n{\n    \/\/watchForFocus(d,true);\n\n    kDebug() << \"========================> SuperKarambaApplet Ctor\" << endl;\n    setHasConfigurationInterface(true);\n\n    KConfigGroup cg = config();\n    d->themePath = cg.readEntry(\"theme\", KUrl());\n\n    if( ! d->themePath.isValid() ) {\n        \/\/d->themePath = KUrl(\"file:\/\/\/home\/kde4\/svn\/_src\/KDE\/kdeutils\/superkaramba\/examples\/rubyclock\/clock.theme\");\n        \/\/d->themePath = KUrl(\"\/home\/kde4\/svn\/_src\/KDE\/kdeutils\/superkaramba\/examples\/richtext\/richtext.theme\");\n        \/\/d->themePath = KUrl(\"\/home\/kde4\/svn\/_src\/KDE\/kdeutils\/superkaramba\/examples\/pythonclock\/pythonclock.theme\");\n        \/\/d->themePath = KUrl(\"\/home\/kde4\/svn\/_src\/KDE\/kdeutils\/superkaramba\/examples\/aeroai\/aero_aio.skz\");\n\n        KFileDialog* filedialog = new KFileDialog(\n            KUrl(\"kfiledialog:\/\/\/SuperKarambaPlasmaApplet\"), \/\/ startdir\n            i18n(\"*.skz *.theme|Theme Files\\n*|All Files\"), \/\/ filter\n            0, \/\/ custom widget\n            0 \/\/ parent\n        );\n        filedialog->setCaption( i18n(\"SuperKaramba Theme\") );\n        filedialog->setOperationMode( KFileDialog::Opening );\n        filedialog->setMode( KFile::File | KFile::ExistingOnly | KFile::LocalOnly );\n        if( filedialog->exec() )\n            d->themePath = filedialog->selectedUrl();\n    }\n\n    if( d->themePath.isValid() )\n        QTimer::singleShot(100, this, SLOT(loadKaramba()));\n}\n\nSuperKarambaApplet::~SuperKarambaApplet()\n{\n    kDebug() << \"========================> SuperKarambaApplet Dtor\" << endl;\n    \/\/watchForFocus(d, false);\n    delete d;\n}\n\nKaramba* SuperKarambaApplet::karamba() const\n{\n    return d->themeItem;\n}\n\nvoid SuperKarambaApplet::loadKaramba()\n{\n    kDebug() << \"SuperKarambaApplet::loadKaramba() Theme: \" << d->themePath << endl;\n\n    QGraphicsScene *gfxScene = scene();\n    Q_ASSERT( gfxScene );\n    Q_ASSERT( gfxScene->views().count() > 0 );\n\n    d->themeItem = new Karamba(d->themePath, gfxScene->views()[0]);\n    d->initTheme();\n\n    connect(KarambaManager::self(), SIGNAL(karambaStarted(QGraphicsItemGroup*)), this, SLOT(karambaStarted(QGraphicsItemGroup*)));\n    connect(KarambaManager::self(), SIGNAL(karambaClosed(QGraphicsItemGroup*)), this, SLOT(karambaClosed(QGraphicsItemGroup*)));\n}\n\nvoid SuperKarambaApplet::paintInterface(QPainter *painter, const QStyleOptionGraphicsItem *option, const QRect &rect)\n{\n    if( d->appletadaptor )\n        d->appletadaptor->paintInterface(painter, option, rect);\n}\n\nvoid SuperKarambaApplet::showConfigurationInterface()\n{\n    if( d->themeItem )\n        d->themeItem->popupGlobalMenu();\n}\n\nvoid SuperKarambaApplet::configAccepted()\n{\n    kDebug() << \"SuperKarambaApplet::configAccepted\" << endl;\n\n    KConfigGroup cg = config(\"SuperKaramba\");\n    cg.writeEntry(\"theme\", d->themePath);\n    \/*\n    m_showTimeString = ui.showTimeStringCheckBox->checkState() == Qt::Checked;\n    m_showSecondHand = ui.showSecondHandCheckBox->checkState() == Qt::Checked;\n    cg.writeEntry(\"showTimeString\", m_showTimeString);\n    cg.writeEntry(\"showSecondHand\", m_showSecondHand);\n    dataEngine(\"time\")->setProperty(\"reportSeconds\", m_showSecondHand);\n    *\/\n    QGraphicsItem::update();\n    \/*\n    cg.writeEntry(\"size\", ui.spinSize->value());\n    m_theme->resize(ui.spinSize->value(), ui.spinSize->value());\n    QStringList tzs = ui.timeZones->selection();\n    dataEngine(\"time\")->connectSource(m_timezone, this);\n    *\/\n    constraintsUpdated();\n    cg.config()->sync();\n}\n\nvoid SuperKarambaApplet::constraintsUpdated()\n{\n    kDebug() << \"SuperKarambaApplet::constraintsUpdated\" << endl;\n    Plasma::Applet::constraintsUpdated();\n}\n\nQRectF SuperKarambaApplet::boundingRect() const\n{\n    return d->themeItem ? d->themeItem->boundingRect() : Applet::boundingRect();\n}\n\nvoid SuperKarambaApplet::karambaStarted(QGraphicsItemGroup* group)\n{\n    if( ! d->themeItem ) {\n        kDebug()<<\">>>>>>>>>>>> SuperKarambaApplet::karambaStarted\"<<endl;\n        d->themeItem = dynamic_cast< Karamba* >( group );\n        Q_ASSERT(d->themeItem);\n        d->initTheme();\n        QGraphicsItem::update();\n        constraintsUpdated();\n    }\n}\n\nvoid SuperKarambaApplet::karambaClosed(QGraphicsItemGroup* group)\n{\n    if( d->themeItem == group ) {\n        kDebug()<<\">>>>>>>>>>>> SuperKarambaApplet::karambaClosed\"<<endl;\n        d->themeItem = 0;\n    }\n}\n\n\/*\nvoid SuperKarambaApplet::moveActionToggled(bool toggled)\n{\n    if( lockApplet() != toggled )\n        setLockApplet(toggled);\n}\n\nvoid SuperKarambaApplet::slotLockApplet(bool locked)\n{\n    Plasma::Applet::slotLockApplet(locked);\n    d->setLockApplet(locked);\n}\n*\/\n\n#include \"skapplet.moc\"\n<|endoftext|>"}
{"text":"<commit_before>\/\/ This file is part of Poseidon.\n\/\/ Copyleft 2020, LH_Mouse. All wrongs reserved.\n\n#ifndef POSEIDON_UTIL_HPP_\n#define POSEIDON_UTIL_HPP_\n\n#include \"fwd.hpp\"\n#include \"static\/async_logger.hpp\"\n#include \"core\/abstract_timer.hpp\"\n#include \"static\/timer_driver.hpp\"\n#include \"core\/abstract_async_job.hpp\"\n#include \"core\/promise.hpp\"\n#include \"core\/future.hpp\"\n#include \"static\/worker_pool.hpp\"\n#include <asteria\/util.hpp>\n#include <cstdio>\n#include \"details\/util.ipp\"\n\nnamespace poseidon {\n\nusing ::asteria::utf8_encode;\nusing ::asteria::utf8_decode;\nusing ::asteria::utf16_encode;\nusing ::asteria::utf16_decode;\n\nusing ::asteria::format_string;\nusing ::asteria::weaken_enum;\nusing ::asteria::generate_random_seed;\nusing ::asteria::format_errno;\n\n\/\/ Converts all ASCII letters in a string into uppercase.\ncow_string\nascii_uppercase(cow_string str);\n\n\/\/ Converts all ASCII letters in a string into lowercase.\ncow_string\nascii_lowercase(cow_string str);\n\n\/\/ Removes all leading and trailing blank characters.\ncow_string\nascii_trim(cow_string str);\n\n\/\/ Composes a string and submits it to the logger.\n#define POSEIDON_LOG_X_(level, ...)  \\\n    (::poseidon::Async_Logger::enabled(level) &&  \\\n         (::poseidon::details_util::format_log(level, __FILE__, __LINE__, __func__,  \\\n                                                    \"\" __VA_ARGS__), 1))\n\n#define POSEIDON_LOG_FATAL(...)   POSEIDON_LOG_X_(::poseidon::log_level_fatal,  __VA_ARGS__)\n#define POSEIDON_LOG_ERROR(...)   POSEIDON_LOG_X_(::poseidon::log_level_error,  __VA_ARGS__)\n#define POSEIDON_LOG_WARN(...)    POSEIDON_LOG_X_(::poseidon::log_level_warn,   __VA_ARGS__)\n#define POSEIDON_LOG_INFO(...)    POSEIDON_LOG_X_(::poseidon::log_level_info,   __VA_ARGS__)\n#define POSEIDON_LOG_DEBUG(...)   POSEIDON_LOG_X_(::poseidon::log_level_debug,  __VA_ARGS__)\n#define POSEIDON_LOG_TRACE(...)   POSEIDON_LOG_X_(::poseidon::log_level_trace,  __VA_ARGS__)\n\n\/\/ Composes a string and throws an exception.\n#define POSEIDON_THROW(...)  \\\n    (::poseidon::details_util::format_throw(__FILE__, __LINE__, __func__, \"\" __VA_ARGS__))\n\n\/\/ Creates a thread that invokes `loopfnT` repeatedly and never exits.\n\/\/ Exceptions thrown from the thread procedure are ignored.\ntemplate<void loopfnT(void*)>\n::pthread_t\ncreate_daemon_thread(const char* name, void* param = nullptr)\n  {\n    ROCKET_ASSERT_MSG(name, \"No thread name specified\");\n    ROCKET_ASSERT_MSG(::std::strlen(name) <= 15, \"Thread name too long\");\n\n    \/\/ Create the thread.\n    ::pthread_t thr;\n    int err = ::pthread_create(&thr, nullptr,\n                       details_util::daemon_thread_proc<loopfnT>, param);\n    if(err != 0)\n      POSEIDON_THROW(\"Could not create thread '$2'\\n\"\n                    \"[`pthread_create()` failed: $1]\",\n                    format_errno(err), name);\n\n    \/\/ Set the thread name. Failure to set the name is ignored.\n    err = ::pthread_setname_np(thr, name);\n    if(err != 0)\n      POSEIDON_LOG_ERROR(\"Could set thread name '$2'\\n\"\n                         \"[`pthread_setname_np()` failed: $1]\",\n                         format_errno(err), name);\n\n    \/\/ Detach the thread.\n    \/\/ The thread can't actually exit, but let's be nitpicky.\n    ::pthread_detach(thr);\n    return thr;\n  }\n\n\/\/ Creates an asynchronous timer. The timer function will be called by\n\/\/ the timer thread, so thread safety must be taken into account.\ntemplate<typename FuncT>\nrcptr<Abstract_Timer>\ncreate_async_timer(int64_t next, int64_t period, FuncT&& func)\n  { return Timer_Driver::insert(\n                 ::rocket::make_unique<details_util::Timer<\n                       typename ::std::decay<FuncT>::type>>(\n                           next, period, ::std::forward<FuncT>(func)));  }\n\n\/\/ Creates a one-shot timer.\ntemplate<typename FuncT>\nrcptr<Abstract_Timer>\ncreate_async_timer_oneshot(int64_t next, FuncT&& func)\n  { return Timer_Driver::insert(\n                 ::rocket::make_unique<details_util::Timer<\n                       typename ::std::decay<FuncT>::type>>(\n                           next, 0, ::std::forward<FuncT>(func)));  }\n\n\/\/ Creates a periodic timer.\ntemplate<typename FuncT>\nrcptr<Abstract_Timer>\ncreate_async_timer_periodic(int64_t period, FuncT&& func)\n  { return Timer_Driver::insert(\n                 ::rocket::make_unique<details_util::Timer<\n                       typename ::std::decay<FuncT>::type>>(\n                           period, period, ::std::forward<FuncT>(func)));  }\n\n\/\/ Enqueues an asynchronous job and returns a future to its result.\n\/\/ Functions with the same key will always be delivered to the same worker.\ntemplate<typename FuncT>\nfutp<typename ::std::result_of<typename ::std::decay<FuncT>::type& ()>::type>\nenqueue_async_job(uintptr_t key, FuncT&& func)\n  { return details_util::promise(\n                 ::rocket::make_unique<details_util::Async<\n                       typename ::std::decay<FuncT>::type>>(\n                           key, ::std::forward<FuncT>(func)));  }\n\n\/\/ Enqueues an asynchronous job and returns a future to its result.\n\/\/ The function is delivered to a random worker.\ntemplate<typename FuncT>\nfutp<typename ::std::result_of<typename ::std::decay<FuncT>::type& ()>::type>\nenqueue_async_job(FuncT&& func)\n  { return details_util::promise(\n                 ::rocket::make_unique<details_util::Async<\n                       typename ::std::decay<FuncT>::type>>(\n                           details_util::random_key, ::std::forward<FuncT>(func)));  }\n\n}  \/\/ namespace poseidon\n\n#endif\n<commit_msg>util: Add `ascii_ci_equal()`<commit_after>\/\/ This file is part of Poseidon.\n\/\/ Copyleft 2020, LH_Mouse. All wrongs reserved.\n\n#ifndef POSEIDON_UTIL_HPP_\n#define POSEIDON_UTIL_HPP_\n\n#include \"fwd.hpp\"\n#include \"static\/async_logger.hpp\"\n#include \"core\/abstract_timer.hpp\"\n#include \"static\/timer_driver.hpp\"\n#include \"core\/abstract_async_job.hpp\"\n#include \"core\/promise.hpp\"\n#include \"core\/future.hpp\"\n#include \"static\/worker_pool.hpp\"\n#include <asteria\/util.hpp>\n#include <cstdio>\n#include \"details\/util.ipp\"\n\nnamespace poseidon {\n\nusing ::asteria::utf8_encode;\nusing ::asteria::utf8_decode;\nusing ::asteria::utf16_encode;\nusing ::asteria::utf16_decode;\n\nusing ::asteria::format_string;\nusing ::asteria::weaken_enum;\nusing ::asteria::generate_random_seed;\nusing ::asteria::format_errno;\n\n\/\/ Converts all ASCII letters in a string into uppercase.\ncow_string\nascii_uppercase(cow_string str);\n\n\/\/ Converts all ASCII letters in a string into lowercase.\ncow_string\nascii_lowercase(cow_string str);\n\n\/\/ Removes all leading and trailing blank characters.\ncow_string\nascii_trim(cow_string str);\n\n\/\/ Checks whether two strings equal.\ntemplate<typename StringT, typename OtherT>\nconstexpr\nbool\nascii_ci_equal(const StringT& str, const OtherT& oth)\n  {\n    return ::rocket::ascii_ci_equal(str.c_str(), str.length(), oth.c_str(), oth.length());\n  }\n\n\/\/ Composes a string and submits it to the logger.\n#define POSEIDON_LOG_X_(level, ...)  \\\n    (::poseidon::Async_Logger::enabled(level) &&  \\\n         (::poseidon::details_util::format_log(level, __FILE__, __LINE__, __func__,  \\\n                                                    \"\" __VA_ARGS__), 1))\n\n#define POSEIDON_LOG_FATAL(...)   POSEIDON_LOG_X_(::poseidon::log_level_fatal,  __VA_ARGS__)\n#define POSEIDON_LOG_ERROR(...)   POSEIDON_LOG_X_(::poseidon::log_level_error,  __VA_ARGS__)\n#define POSEIDON_LOG_WARN(...)    POSEIDON_LOG_X_(::poseidon::log_level_warn,   __VA_ARGS__)\n#define POSEIDON_LOG_INFO(...)    POSEIDON_LOG_X_(::poseidon::log_level_info,   __VA_ARGS__)\n#define POSEIDON_LOG_DEBUG(...)   POSEIDON_LOG_X_(::poseidon::log_level_debug,  __VA_ARGS__)\n#define POSEIDON_LOG_TRACE(...)   POSEIDON_LOG_X_(::poseidon::log_level_trace,  __VA_ARGS__)\n\n\/\/ Composes a string and throws an exception.\n#define POSEIDON_THROW(...)  \\\n    (::poseidon::details_util::format_throw(__FILE__, __LINE__, __func__, \"\" __VA_ARGS__))\n\n\/\/ Creates a thread that invokes `loopfnT` repeatedly and never exits.\n\/\/ Exceptions thrown from the thread procedure are ignored.\ntemplate<void loopfnT(void*)>\n::pthread_t\ncreate_daemon_thread(const char* name, void* param = nullptr)\n  {\n    ROCKET_ASSERT_MSG(name, \"No thread name specified\");\n    ROCKET_ASSERT_MSG(::std::strlen(name) <= 15, \"Thread name too long\");\n\n    \/\/ Create the thread.\n    ::pthread_t thr;\n    int err = ::pthread_create(&thr, nullptr,\n                       details_util::daemon_thread_proc<loopfnT>, param);\n    if(err != 0)\n      POSEIDON_THROW(\"Could not create thread '$2'\\n\"\n                    \"[`pthread_create()` failed: $1]\",\n                    format_errno(err), name);\n\n    \/\/ Set the thread name. Failure to set the name is ignored.\n    err = ::pthread_setname_np(thr, name);\n    if(err != 0)\n      POSEIDON_LOG_ERROR(\"Could set thread name '$2'\\n\"\n                         \"[`pthread_setname_np()` failed: $1]\",\n                         format_errno(err), name);\n\n    \/\/ Detach the thread.\n    \/\/ The thread can't actually exit, but let's be nitpicky.\n    ::pthread_detach(thr);\n    return thr;\n  }\n\n\/\/ Creates an asynchronous timer. The timer function will be called by\n\/\/ the timer thread, so thread safety must be taken into account.\ntemplate<typename FuncT>\nrcptr<Abstract_Timer>\ncreate_async_timer(int64_t next, int64_t period, FuncT&& func)\n  {\n    return Timer_Driver::insert(\n                 ::rocket::make_unique<details_util::Timer<\n                       typename ::std::decay<FuncT>::type>>(\n                           next, period, ::std::forward<FuncT>(func)));\n  }\n\n\/\/ Creates a one-shot timer.\ntemplate<typename FuncT>\nrcptr<Abstract_Timer>\ncreate_async_timer_oneshot(int64_t next, FuncT&& func)\n  {\n    return Timer_Driver::insert(\n                 ::rocket::make_unique<details_util::Timer<\n                       typename ::std::decay<FuncT>::type>>(\n                           next, 0, ::std::forward<FuncT>(func)));\n  }\n\n\/\/ Creates a periodic timer.\ntemplate<typename FuncT>\nrcptr<Abstract_Timer>\ncreate_async_timer_periodic(int64_t period, FuncT&& func)\n  {\n    return Timer_Driver::insert(\n                 ::rocket::make_unique<details_util::Timer<\n                       typename ::std::decay<FuncT>::type>>(\n                           period, period, ::std::forward<FuncT>(func)));\n  }\n\n\/\/ Enqueues an asynchronous job and returns a future to its result.\n\/\/ Functions with the same key will always be delivered to the same worker.\ntemplate<typename FuncT>\nfutp<typename ::std::result_of<typename ::std::decay<FuncT>::type& ()>::type>\nenqueue_async_job(uintptr_t key, FuncT&& func)\n  {\n    return details_util::promise(\n                 ::rocket::make_unique<details_util::Async<\n                       typename ::std::decay<FuncT>::type>>(\n                           key, ::std::forward<FuncT>(func)));\n  }\n\n\/\/ Enqueues an asynchronous job and returns a future to its result.\n\/\/ The function is delivered to a random worker.\ntemplate<typename FuncT>\nfutp<typename ::std::result_of<typename ::std::decay<FuncT>::type& ()>::type>\nenqueue_async_job(FuncT&& func)\n  {\n    return details_util::promise(\n                 ::rocket::make_unique<details_util::Async<\n                       typename ::std::decay<FuncT>::type>>(\n                           details_util::random_key, ::std::forward<FuncT>(func)));\n  }\n\n}  \/\/ namespace poseidon\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/ @author Andrew Hundt <athundt@gmail.com>\n#ifndef _VREP_VF_CONTROLLER_\n#define _VREP_VF_CONTROLLER_\n\n\/\/\/ @todo remove IGNORE_ROTATION or make it a runtime configurable parameter\n\/\/ #define IGNORE_ROTATION\n\n\n\n#include <string>\n#include <tuple>\n#include <boost\/format.hpp>\n#include <Eigen\/Core>\n#include <Eigen\/Geometry>\n\n#include <sawConstraintController\/mtsVFController.h>\n\n#include \"grl\/cisst\/GrlVFController.hpp\"\n#include \"grl\/vrep\/Vrep.hpp\"\n#include \"grl\/vrep\/VrepRobotArmDriver.hpp\"\n#include \"grl\/vrep\/VrepRobotArmJacobian.hpp\"\n#include \"grl\/vrep\/Eigen.hpp\"\n\n#include <boost\/lexical_cast.hpp>\n#include <boost\/range\/algorithm\/copy.hpp>\n\nnamespace grl {\n\n\/\/\/ @todo verify Robotiiwa is the correct base, and RobotMillTipTarget is the right target, because if the transform doesn't match the one in the jacobian the algorithm will break\n\/\/template<typename DesiredKinematics = DesiredKinematicsObject>\nclass VrepInverseKinematicsController : public grl::InverseKinematicsController\n{\npublic:\n    typedef grl::InverseKinematicsController parent_type;\n    \n    \/\/using parent_type::currentKinematicsStateP_;\n    \/\/using parent_type::parent_type::InitializeKinematicsState;\n  \n    enum  VrepVFControllerParamsIndex {\n        DesiredKinematicsObjectName,\n        IKGroupName\n    };\n    \n    typedef std::tuple<\n             std::string \/\/ DesiredKinematicsObjectName\n            ,std::string \/\/ IKGroupName\n        > Params;\n    \n    static Params defaultParams()\n    {\n       return std::make_tuple(\"RobotMillTipTarget\",\"IK_Group1_iiwa\");\n    }\n    \n    \/\/\/ @todo need to call parent constructor:\n        \/*! Constructor\n    *\/\n    VrepInverseKinematicsController(size_t num_joints = 7, mtsVFBase::CONTROLLERMODE cm = mtsVFBase::CONTROLLERMODE::JPOS):\n     InverseKinematicsController(num_joints,cm)\n    {\n    }\n    \n    void construct(Params params = defaultParams()){\n        \/\/ get kinematics group name\n        \/\/ get number of joints\n        VrepRobotArmDriverP_ = std::make_shared<vrep::VrepRobotArmDriver>();\n        VrepRobotArmDriverP_->construct();\n        \n        ikGroupHandle_ = simGetIkGroupHandle(std::get<IKGroupName>(params).c_str());\n        simSetExplicitHandling(ikGroupHandle_,1); \/\/ enable explicit handling for the ik\n\n        this->currentKinematicsStateP_->Name = std::get<IKGroupName>(params);\n        \n        this->desiredKinematicsStateP_->Name = std::get<DesiredKinematicsObjectName>(params);\n        \n        \/\/\/ @todo set desiredKinematicsStateP name, INITIALIZE ALL MEMBER OBJECTS, & SET NAMES\n        \/\/\n        positionLimitsName = std::get<IKGroupName>(params)+\"_PositionLimits\";\n        this->jointPositionLimitsVFP_->Name = positionLimitsName;\n        \n        velocityLimitsName = std::get<IKGroupName>(params)+\"_VelocityLimits\";\n        this->jointVelocityLimitsVFP_->Name = velocityLimitsName;\n        \n\/\/            \/\/\/ This will hold the Jacobian\n\/\/    std::unique_ptr<prmKinematicsState> currentKinematicsStateP_;\n\/\/    \n\/\/    \/\/\/ This will hold the xyz position and the rotation of where I want to go\n\/\/    std::unique_ptr<prmKinematicsState> desiredKinematicsStateP_;\n\/\/    \n\/\/    \/\/ want to follow a goal position\n\/\/    \/\/\/ @todo will want to use an addVFFollow member function once it is added in\n\/\/    std::unique_ptr<mtsVFDataBase> followVFP_;\n\/\/    \n\/\/    \/\/\/ need velocity limits for the joints\n\/\/    std::unique_ptr<mtsVFDataJointLimits> jointVelocityLimitsVFP_;\n\/\/    \/\/\/ joints cannot go to certain position\n\/\/    std::unique_ptr<mtsVFDataJointLimits> jointPositionLimitsVFP_;\n        \n        \/\/\/ @todo verify object lifetimes\n        \/\/parent_type::parent_type::InitializeKinematicsState(this->currentKinematicsStateP_)\n        \n            \/\/ for each virtual fixture need names and number of rows\n        \n        \n        \/\/\/ @todo read objective rows from vrep\n        \n        \/\/ Initialize Variables for update\n        \/\/jointHandles_ = VrepRobotArmDriverP_->getJointHandles();\n        \/\/int numJoints =jointHandles_.size();\n        \n#ifndef IGNORE_ROTATION\n        \/\/\/ @todo objectiveRows seems to currently be a 3 vector, may eventually want a rotation and translation, perhaps with quaternion rotation\n        followVFP_->ObjectiveRows = 6;\n#else\n        followVFP_->ObjectiveRows = 3;\n#endif\n        \/\/ set the names once for each object, only once\n        followVFP_->KinNames.push_back(currentKinematicsStateP_->Name);\n        followVFP_->KinNames.push_back(desiredKinematicsStateP_->Name);\n        \n        AddVFFollowPath(*followVFP_);\n        \n        \/\/\/ @todo set vrep explicit handling of IK here, plus unset in destructor of this object\n    }\n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \/\/\/ check out sawConstraintController\n    void updateKinematics(){\n    \n        jointHandles_ = VrepRobotArmDriverP_->getJointHandles();\n        auto eigentestJacobian=::grl::vrep::getJacobian(*VrepRobotArmDriverP_);\n\n        \/\/\/ The row\/column major order is swapped between cisst and VREP!\n        this->currentKinematicsStateP_->Jacobian.SetSize(eigentestJacobian.cols(),eigentestJacobian.rows());\n        Eigen::Map<Eigen::Matrix<double,Eigen::Dynamic,Eigen::Dynamic,Eigen::ColMajor> > mckp2(this->currentKinematicsStateP_->Jacobian.Pointer(),this->currentKinematicsStateP_->Jacobian.cols(),this->currentKinematicsStateP_->Jacobian.rows());\n        mckp2 = eigentestJacobian.cast<double>();\n        \n        \n        \/\/Eigen::Map<Eigen::Matrix<float,Eigen::Dynamic,Eigen::Dynamic,Eigen::ColMajor> > mf(eigentestJacobian,eigentestJacobian.cols(),eigentestJacobian.rows());\n        \/\/Eigen::MatrixXf eigenJacobian = mf;\n        Eigen::MatrixXf eigenJacobian = eigentestJacobian;\n        \n        \n        \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n        \/\/ Copy Joint Interval, the range of motion for each joint\n        \n        \n        \/\/ lower limits\n        auto & llim = std::get<vrep::VrepRobotArmDriver::JointLowerPositionLimit>(currentArmState_);\n        std::vector<double> llimits(llim.begin(),llim.end());\n        jointPositionLimitsVFP_->LowerLimits = vctDoubleVec(llimits.size(),&llimits[0]);\n        \n        \/\/ upper limits\n        auto & ulim = std::get<vrep::VrepRobotArmDriver::JointUpperPositionLimit>(currentArmState_);\n        std::vector<double> ulimits(ulim.begin(),ulim.end());\n        jointPositionLimitsVFP_->UpperLimits = vctDoubleVec(ulimits.size(),&ulimits[0]);\n        \n        \/\/ current position\n        auto & currentJointPos = std::get<vrep::VrepRobotArmDriver::JointPosition>(currentArmState_);\n        std::vector<double> currentJointPosVec(currentJointPos.begin(),currentJointPos.end());\n        vctDoubleVec vctDoubleVecCurrentJoints(currentJointPosVec.size(),&currentJointPosVec[0]);\n        \n        \/\/ update limits\n        \/\/\/ @todo does this leak memory when called every time around?\n        UpdateJointPosLimitsVF(positionLimitsName,jointPositionLimitsVFP_->UpperLimits,jointPositionLimitsVFP_->LowerLimits,vctDoubleVecCurrentJoints);\n        \n        \n        const auto& handleParams = VrepRobotArmDriverP_->getVrepHandleParams();\n        Eigen::Affine3d currentEndEffectorPose =\n        getObjectTransform(\n                             std::get<vrep::VrepRobotArmDriver::RobotTipName>(handleParams)\n                            ,std::get<vrep::VrepRobotArmDriver::RobotTargetBaseName>(handleParams)\n                          );\n        auto  currentEigenT = currentEndEffectorPose.translation();\n        auto& currentCisstT = currentKinematicsStateP_->Frame.Translation();\n        currentCisstT[0] = currentEigenT(0);\n        currentCisstT[1] = currentEigenT(1);\n        currentCisstT[2] = currentEigenT(2);\n#ifndef IGNORE_ROTATION\n        Eigen::Map<Eigen::Matrix<double,3,3,Eigen::ColMajor>> ccr(currentKinematicsStateP_->Frame.Rotation().Pointer());\n        ccr = currentEndEffectorPose.rotation();\n#endif \/\/ IGNORE_ROTATION\n        \/\/\/ @todo set rotation component of current position\n        \n        \n        Eigen::Affine3d desiredEndEffectorPose =\n        getObjectTransform(\n                             std::get<vrep::VrepRobotArmDriver::RobotTargetName>(handleParams)\n                            ,std::get<vrep::VrepRobotArmDriver::RobotTargetBaseName>(handleParams)\n                          );\n        auto  desiredEigenT = desiredEndEffectorPose.translation();\n        auto& desiredCisstT = desiredKinematicsStateP_->Frame.Translation();\n        desiredCisstT[0] = desiredEigenT(0);\n        desiredCisstT[1] = desiredEigenT(1);\n        desiredCisstT[2] = desiredEigenT(2);\n#ifndef IGNORE_ROTATION\n        Eigen::Map<Eigen::Matrix<double,3,3,Eigen::ColMajor>> dcr(desiredKinematicsStateP_->Frame.Rotation().Pointer());\n        dcr = desiredEndEffectorPose.rotation();\n#endif \/\/ IGNORE_ROTATION\n        \/\/\/ @todo set rotation component of desired position\n        \n        \/\/ for debugging, the translation between the current and desired position in cartesian coordinates\n        auto inputDesired_dx = desiredCisstT - currentCisstT;\n        \n        vct3 dx_translation, dx_rotation;\n        \n        \/\/ Rotation part\n        vctAxAnRot3 dxRot;\n        vct3 dxRotVec;\n        dxRot.FromNormalized((currentKinematicsStateP_->Frame.Inverse() * desiredKinematicsStateP_->Frame).Rotation());\n        dxRotVec = dxRot.Axis() * dxRot.Angle();\n        dx_rotation[0] = dxRotVec[0];\n        dx_rotation[1] = dxRotVec[1];\n        dx_rotation[2] = dxRotVec[2];\n        \/\/dx_rotation.SetAll(0.0);\n        dx_rotation = currentKinematicsStateP_->Frame.Rotation() * dx_rotation;\n        \n        Eigen::AngleAxis<float> tipToTarget_cisstToEigen;\n        \n        Eigen::Matrix3f rotmat;\n        double theta = std::sqrt(dx_rotation[0]*dx_rotation[0]+dx_rotation[1]*dx_rotation[1]+dx_rotation[2]*dx_rotation[2]);\n        rotmat= Eigen::AngleAxisf(theta,Eigen::Vector3f(dx_rotation[0]\/theta,dx_rotation[1]\/theta,dx_rotation[2]\/theta));\n        \n\/\/        std::cout << \"\\ntiptotarget     \\n\" << tipToTarget.matrix() << \"\\n\";\n\/\/        std::cout << \"\\ntiptotargetcisst\\n\" << rotmat.matrix() << \"\\n\";\n        \n        \n        \/\/BOOST_LOG_TRIVIAL(trace) << \"\\n   test         desired dx: \" << inputDesired_dx << \" \" << dx_rotation << \"\\noptimizer Calculated dx: \" << optimizerCalculated_dx;\n        SetKinematics(*currentKinematicsStateP_);  \/\/ replaced by name of object\n        \/\/ fill these out in the desiredKinematicsStateP_\n        \/\/RotationType RotationMember; \/\/ vcRot3\n        \/\/TranslationType TranslationMember; \/\/ vct3\n    \n        SetKinematics(*desiredKinematicsStateP_); \/\/ replaced by name of object\n        \/\/ call setKinematics with the new kinematics\n        \/\/ sawconstraintcontroller has kinematicsState\n        \/\/ set the jacobian here\n        \n        \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n        \/\/\/ @todo move code below here back under run_one updateKinematics() call\n        \n       \/\/\/ @todo need to provide tick time in double seconds and get from vrep API call\n       float simulationTimeStep = simGetSimulationTimeStep();\n       UpdateOptimizer(simulationTimeStep);\n       \n       vctDoubleVec jointAngles_dt;\n       auto returncode = Solve(jointAngles_dt);\n       \n       \n       \/\/\/ @todo check the return code, if it doesn't have a result, use the VREP version as a fallback and report an error.\n       if(returncode != nmrConstraintOptimizer::NMR_OK) BOOST_THROW_EXCEPTION(std::runtime_error(\"VrepInverseKinematicsController: constrained optimization error, please investigate\"));\n       \n       \n       \/\/\/ @todo: rethink where\/when\/how to send command for the joint angles. Return to LUA? Set Directly? Distribute via vrep send message command?\n        std::string str;\n       \/\/ str = \"\";\n       for (std::size_t i=0 ; i < jointHandles_.size() ; i++)\n       {\n          float currentAngle;\n          auto ret = simGetJointPosition(jointHandles_[i],&currentAngle);\n          BOOST_VERIFY(ret!=-1);\n          float futureAngle = currentAngle + jointAngles_dt[i];\n          \/\/simSetJointTargetPosition(jointHandles_[i],jointAngles_dt[i]);\n          \/\/simSetJointTargetPosition(jointHandles_[i],futureAngle);\n          simSetJointPosition(jointHandles_[i],futureAngle);\n                str+=boost::lexical_cast<std::string>(jointAngles_dt[i]);\n                if (i<jointHandles_.size()-1)\n                    str+=\", \";\n       }\n        BOOST_LOG_TRIVIAL(trace) << \"jointAngles_dt: \"<< str;\n        \n        auto optimizerCalculated_dx = this->currentKinematicsStateP_->Jacobian * jointAngles_dt;\n       \n        BOOST_LOG_TRIVIAL(trace) << \"\\n            desired dx: \" << inputDesired_dx << \" \" << dx_rotation << \"\\noptimizer Calculated dx: \" << optimizerCalculated_dx;\n    }\n    \n    \/\/\/ may not need this it is in the base class\n    \/\/\/ blocking call, call in separate thread, just allocates memory\n    void run_one(){\n       updateKinematics();\n       \n    }\n    \n    \n    \/\/\/ may not need this it is in the base class\n    \/\/\/ this will have output\n    \/\/\/ blocking call, call in separate thread, just allocates memory\n    \/\/\/ this runs the actual optimization algorithm\n    void solve(){\n        \n    }\n    \n    std::vector<int> jointHandles_; \/\/\/< @todo move this item back into VrepRobotArmDriver\n    int ikGroupHandle_;\n    std::shared_ptr<vrep::VrepRobotArmDriver> VrepRobotArmDriverP_;\n    vrep::VrepRobotArmDriver::State currentArmState_;\n    std::string positionLimitsName;\n    std::string velocityLimitsName;\n};\n\n} \/\/ namespace grl\n\n#endif<commit_msg>added commented call for velocity possible future use<commit_after>\/\/\/ @author Andrew Hundt <athundt@gmail.com>\n#ifndef _VREP_VF_CONTROLLER_\n#define _VREP_VF_CONTROLLER_\n\n\/\/\/ @todo remove IGNORE_ROTATION or make it a runtime configurable parameter\n\/\/ #define IGNORE_ROTATION\n\n\n\n#include <string>\n#include <tuple>\n#include <boost\/format.hpp>\n#include <Eigen\/Core>\n#include <Eigen\/Geometry>\n\n#include <sawConstraintController\/mtsVFController.h>\n\n#include \"grl\/cisst\/GrlVFController.hpp\"\n#include \"grl\/vrep\/Vrep.hpp\"\n#include \"grl\/vrep\/VrepRobotArmDriver.hpp\"\n#include \"grl\/vrep\/VrepRobotArmJacobian.hpp\"\n#include \"grl\/vrep\/Eigen.hpp\"\n\n#include <boost\/lexical_cast.hpp>\n#include <boost\/range\/algorithm\/copy.hpp>\n\nnamespace grl {\n\n\/\/\/ @todo verify Robotiiwa is the correct base, and RobotMillTipTarget is the right target, because if the transform doesn't match the one in the jacobian the algorithm will break\n\/\/template<typename DesiredKinematics = DesiredKinematicsObject>\nclass VrepInverseKinematicsController : public grl::InverseKinematicsController\n{\npublic:\n    typedef grl::InverseKinematicsController parent_type;\n    \n    \/\/using parent_type::currentKinematicsStateP_;\n    \/\/using parent_type::parent_type::InitializeKinematicsState;\n  \n    enum  VrepVFControllerParamsIndex {\n        DesiredKinematicsObjectName,\n        IKGroupName\n    };\n    \n    typedef std::tuple<\n             std::string \/\/ DesiredKinematicsObjectName\n            ,std::string \/\/ IKGroupName\n        > Params;\n    \n    static Params defaultParams()\n    {\n       return std::make_tuple(\"RobotMillTipTarget\",\"IK_Group1_iiwa\");\n    }\n    \n    \/\/\/ @todo need to call parent constructor:\n        \/*! Constructor\n    *\/\n    VrepInverseKinematicsController(size_t num_joints = 7, mtsVFBase::CONTROLLERMODE cm = mtsVFBase::CONTROLLERMODE::JPOS):\n     InverseKinematicsController(num_joints,cm)\n    {\n    }\n    \n    void construct(Params params = defaultParams()){\n        \/\/ get kinematics group name\n        \/\/ get number of joints\n        VrepRobotArmDriverP_ = std::make_shared<vrep::VrepRobotArmDriver>();\n        VrepRobotArmDriverP_->construct();\n        \n        ikGroupHandle_ = simGetIkGroupHandle(std::get<IKGroupName>(params).c_str());\n        simSetExplicitHandling(ikGroupHandle_,1); \/\/ enable explicit handling for the ik\n\n        this->currentKinematicsStateP_->Name = std::get<IKGroupName>(params);\n        \n        this->desiredKinematicsStateP_->Name = std::get<DesiredKinematicsObjectName>(params);\n        \n        \/\/\/ @todo set desiredKinematicsStateP name, INITIALIZE ALL MEMBER OBJECTS, & SET NAMES\n        \/\/\n        positionLimitsName = std::get<IKGroupName>(params)+\"_PositionLimits\";\n        this->jointPositionLimitsVFP_->Name = positionLimitsName;\n        \n        velocityLimitsName = std::get<IKGroupName>(params)+\"_VelocityLimits\";\n        this->jointVelocityLimitsVFP_->Name = velocityLimitsName;\n        \n\/\/            \/\/\/ This will hold the Jacobian\n\/\/    std::unique_ptr<prmKinematicsState> currentKinematicsStateP_;\n\/\/    \n\/\/    \/\/\/ This will hold the xyz position and the rotation of where I want to go\n\/\/    std::unique_ptr<prmKinematicsState> desiredKinematicsStateP_;\n\/\/    \n\/\/    \/\/ want to follow a goal position\n\/\/    \/\/\/ @todo will want to use an addVFFollow member function once it is added in\n\/\/    std::unique_ptr<mtsVFDataBase> followVFP_;\n\/\/    \n\/\/    \/\/\/ need velocity limits for the joints\n\/\/    std::unique_ptr<mtsVFDataJointLimits> jointVelocityLimitsVFP_;\n\/\/    \/\/\/ joints cannot go to certain position\n\/\/    std::unique_ptr<mtsVFDataJointLimits> jointPositionLimitsVFP_;\n        \n        \/\/\/ @todo verify object lifetimes\n        \/\/parent_type::parent_type::InitializeKinematicsState(this->currentKinematicsStateP_)\n        \n            \/\/ for each virtual fixture need names and number of rows\n        \n        \n        \/\/\/ @todo read objective rows from vrep\n        \n        \/\/ Initialize Variables for update\n        \/\/jointHandles_ = VrepRobotArmDriverP_->getJointHandles();\n        \/\/int numJoints =jointHandles_.size();\n        \n#ifndef IGNORE_ROTATION\n        \/\/\/ @todo objectiveRows seems to currently be a 3 vector, may eventually want a rotation and translation, perhaps with quaternion rotation\n        followVFP_->ObjectiveRows = 6;\n#else\n        followVFP_->ObjectiveRows = 3;\n#endif\n        \/\/ set the names once for each object, only once\n        followVFP_->KinNames.push_back(currentKinematicsStateP_->Name);\n        followVFP_->KinNames.push_back(desiredKinematicsStateP_->Name);\n        \n        AddVFFollowPath(*followVFP_);\n        \n        \/\/\/ @todo set vrep explicit handling of IK here, plus unset in destructor of this object\n    }\n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \/\/\/ check out sawConstraintController\n    void updateKinematics(){\n    \n        jointHandles_ = VrepRobotArmDriverP_->getJointHandles();\n        auto eigentestJacobian=::grl::vrep::getJacobian(*VrepRobotArmDriverP_);\n\n        \/\/\/ The row\/column major order is swapped between cisst and VREP!\n        this->currentKinematicsStateP_->Jacobian.SetSize(eigentestJacobian.cols(),eigentestJacobian.rows());\n        Eigen::Map<Eigen::Matrix<double,Eigen::Dynamic,Eigen::Dynamic,Eigen::ColMajor> > mckp2(this->currentKinematicsStateP_->Jacobian.Pointer(),this->currentKinematicsStateP_->Jacobian.cols(),this->currentKinematicsStateP_->Jacobian.rows());\n        mckp2 = eigentestJacobian.cast<double>();\n        \n        \n        \/\/Eigen::Map<Eigen::Matrix<float,Eigen::Dynamic,Eigen::Dynamic,Eigen::ColMajor> > mf(eigentestJacobian,eigentestJacobian.cols(),eigentestJacobian.rows());\n        \/\/Eigen::MatrixXf eigenJacobian = mf;\n        Eigen::MatrixXf eigenJacobian = eigentestJacobian;\n        \n        \n        \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n        \/\/ Copy Joint Interval, the range of motion for each joint\n        \n        \n        \/\/ lower limits\n        auto & llim = std::get<vrep::VrepRobotArmDriver::JointLowerPositionLimit>(currentArmState_);\n        std::vector<double> llimits(llim.begin(),llim.end());\n        jointPositionLimitsVFP_->LowerLimits = vctDoubleVec(llimits.size(),&llimits[0]);\n        \n        \/\/ upper limits\n        auto & ulim = std::get<vrep::VrepRobotArmDriver::JointUpperPositionLimit>(currentArmState_);\n        std::vector<double> ulimits(ulim.begin(),ulim.end());\n        jointPositionLimitsVFP_->UpperLimits = vctDoubleVec(ulimits.size(),&ulimits[0]);\n        \n        \/\/ current position\n        auto & currentJointPos = std::get<vrep::VrepRobotArmDriver::JointPosition>(currentArmState_);\n        std::vector<double> currentJointPosVec(currentJointPos.begin(),currentJointPos.end());\n        vctDoubleVec vctDoubleVecCurrentJoints(currentJointPosVec.size(),&currentJointPosVec[0]);\n        \n        \/\/ update limits\n        \/\/\/ @todo does this leak memory when called every time around?\n        UpdateJointPosLimitsVF(positionLimitsName,jointPositionLimitsVFP_->UpperLimits,jointPositionLimitsVFP_->LowerLimits,vctDoubleVecCurrentJoints);\n        \n        \n        const auto& handleParams = VrepRobotArmDriverP_->getVrepHandleParams();\n        Eigen::Affine3d currentEndEffectorPose =\n        getObjectTransform(\n                             std::get<vrep::VrepRobotArmDriver::RobotTipName>(handleParams)\n                            ,std::get<vrep::VrepRobotArmDriver::RobotTargetBaseName>(handleParams)\n                          );\n        auto  currentEigenT = currentEndEffectorPose.translation();\n        auto& currentCisstT = currentKinematicsStateP_->Frame.Translation();\n        currentCisstT[0] = currentEigenT(0);\n        currentCisstT[1] = currentEigenT(1);\n        currentCisstT[2] = currentEigenT(2);\n#ifndef IGNORE_ROTATION\n        Eigen::Map<Eigen::Matrix<double,3,3,Eigen::ColMajor>> ccr(currentKinematicsStateP_->Frame.Rotation().Pointer());\n        ccr = currentEndEffectorPose.rotation();\n#endif \/\/ IGNORE_ROTATION\n        \/\/\/ @todo set rotation component of current position\n        \n        \n        Eigen::Affine3d desiredEndEffectorPose =\n        getObjectTransform(\n                             std::get<vrep::VrepRobotArmDriver::RobotTargetName>(handleParams)\n                            ,std::get<vrep::VrepRobotArmDriver::RobotTargetBaseName>(handleParams)\n                          );\n        auto  desiredEigenT = desiredEndEffectorPose.translation();\n        auto& desiredCisstT = desiredKinematicsStateP_->Frame.Translation();\n        desiredCisstT[0] = desiredEigenT(0);\n        desiredCisstT[1] = desiredEigenT(1);\n        desiredCisstT[2] = desiredEigenT(2);\n#ifndef IGNORE_ROTATION\n        Eigen::Map<Eigen::Matrix<double,3,3,Eigen::ColMajor>> dcr(desiredKinematicsStateP_->Frame.Rotation().Pointer());\n        dcr = desiredEndEffectorPose.rotation();\n#endif \/\/ IGNORE_ROTATION\n        \/\/\/ @todo set rotation component of desired position\n        \n        \/\/ for debugging, the translation between the current and desired position in cartesian coordinates\n        auto inputDesired_dx = desiredCisstT - currentCisstT;\n        \n        vct3 dx_translation, dx_rotation;\n        \n        \/\/ Rotation part\n        vctAxAnRot3 dxRot;\n        vct3 dxRotVec;\n        dxRot.FromNormalized((currentKinematicsStateP_->Frame.Inverse() * desiredKinematicsStateP_->Frame).Rotation());\n        dxRotVec = dxRot.Axis() * dxRot.Angle();\n        dx_rotation[0] = dxRotVec[0];\n        dx_rotation[1] = dxRotVec[1];\n        dx_rotation[2] = dxRotVec[2];\n        \/\/dx_rotation.SetAll(0.0);\n        dx_rotation = currentKinematicsStateP_->Frame.Rotation() * dx_rotation;\n        \n        Eigen::AngleAxis<float> tipToTarget_cisstToEigen;\n        \n        Eigen::Matrix3f rotmat;\n        double theta = std::sqrt(dx_rotation[0]*dx_rotation[0]+dx_rotation[1]*dx_rotation[1]+dx_rotation[2]*dx_rotation[2]);\n        rotmat= Eigen::AngleAxisf(theta,Eigen::Vector3f(dx_rotation[0]\/theta,dx_rotation[1]\/theta,dx_rotation[2]\/theta));\n        \n\/\/        std::cout << \"\\ntiptotarget     \\n\" << tipToTarget.matrix() << \"\\n\";\n\/\/        std::cout << \"\\ntiptotargetcisst\\n\" << rotmat.matrix() << \"\\n\";\n        \n        \n        \/\/BOOST_LOG_TRIVIAL(trace) << \"\\n   test         desired dx: \" << inputDesired_dx << \" \" << dx_rotation << \"\\noptimizer Calculated dx: \" << optimizerCalculated_dx;\n        SetKinematics(*currentKinematicsStateP_);  \/\/ replaced by name of object\n        \/\/ fill these out in the desiredKinematicsStateP_\n        \/\/RotationType RotationMember; \/\/ vcRot3\n        \/\/TranslationType TranslationMember; \/\/ vct3\n    \n        SetKinematics(*desiredKinematicsStateP_); \/\/ replaced by name of object\n        \/\/ call setKinematics with the new kinematics\n        \/\/ sawconstraintcontroller has kinematicsState\n        \/\/ set the jacobian here\n        \n        \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n        \/\/\/ @todo move code below here back under run_one updateKinematics() call\n        \n       \/\/\/ @todo need to provide tick time in double seconds and get from vrep API call\n       float simulationTimeStep = simGetSimulationTimeStep();\n       UpdateOptimizer(simulationTimeStep);\n       \n       vctDoubleVec jointAngles_dt;\n       auto returncode = Solve(jointAngles_dt);\n       \n       \n       \/\/\/ @todo check the return code, if it doesn't have a result, use the VREP version as a fallback and report an error.\n       if(returncode != nmrConstraintOptimizer::NMR_OK) BOOST_THROW_EXCEPTION(std::runtime_error(\"VrepInverseKinematicsController: constrained optimization error, please investigate\"));\n       \n       \n       \/\/\/ @todo: rethink where\/when\/how to send command for the joint angles. Return to LUA? Set Directly? Distribute via vrep send message command?\n        std::string str;\n       \/\/ str = \"\";\n       for (std::size_t i=0 ; i < jointHandles_.size() ; i++)\n       {\n          float currentAngle;\n          auto ret = simGetJointPosition(jointHandles_[i],&currentAngle);\n          BOOST_VERIFY(ret!=-1);\n          float futureAngle = currentAngle + jointAngles_dt[i];\n          \/\/simSetJointTargetVelocity(jointHandles_[i],jointAngles_dt[i]\/simulationTimeStep);\n          \/\/simSetJointTargetPosition(jointHandles_[i],jointAngles_dt[i]);\n          \/\/simSetJointTargetPosition(jointHandles_[i],futureAngle);\n          simSetJointPosition(jointHandles_[i],futureAngle);\n                str+=boost::lexical_cast<std::string>(jointAngles_dt[i]);\n                if (i<jointHandles_.size()-1)\n                    str+=\", \";\n       }\n        BOOST_LOG_TRIVIAL(trace) << \"jointAngles_dt: \"<< str;\n        \n        auto optimizerCalculated_dx = this->currentKinematicsStateP_->Jacobian * jointAngles_dt;\n       \n        BOOST_LOG_TRIVIAL(trace) << \"\\n            desired dx: \" << inputDesired_dx << \" \" << dx_rotation << \"\\noptimizer Calculated dx: \" << optimizerCalculated_dx;\n    }\n    \n    \/\/\/ may not need this it is in the base class\n    \/\/\/ blocking call, call in separate thread, just allocates memory\n    void run_one(){\n       updateKinematics();\n       \n    }\n    \n    \n    \/\/\/ may not need this it is in the base class\n    \/\/\/ this will have output\n    \/\/\/ blocking call, call in separate thread, just allocates memory\n    \/\/\/ this runs the actual optimization algorithm\n    void solve(){\n        \n    }\n    \n    std::vector<int> jointHandles_; \/\/\/< @todo move this item back into VrepRobotArmDriver\n    int ikGroupHandle_;\n    std::shared_ptr<vrep::VrepRobotArmDriver> VrepRobotArmDriverP_;\n    vrep::VrepRobotArmDriver::State currentArmState_;\n    std::string positionLimitsName;\n    std::string velocityLimitsName;\n};\n\n} \/\/ namespace grl\n\n#endif<|endoftext|>"}
{"text":"<commit_before>#include \"acsetup.hpp\"\n#include \"uatraits\/details\/pcre_utils.hpp\"\n\n#include \"uatraits\/error.hpp\"\n#include \"uatraits\/details\/resource.hpp\"\n\n#if (PCRE_MAJOR == 8) && (PCRE_MINOR >= 13)\n#define UATRAITS_PCRE_FREE_STUDY pcre_free_study\n#define UATRAITS_PCRE_STUDY_JIT_COMPILE PCRE_STUDY_JIT_COMPILE\n#else\n#define UATRAITS_PCRE_FREE_STUDY pcre_free\n#define UATRAITS_PCRE_STUDY_JIT_COMPILE 0\n#endif\n\nnamespace uatraits { namespace details {\n\nstruct pcre_traits {\n\tvoid destroy(pcre *value);\n\tstatic pcre* default_value();\n};\n\nstruct pcre_extra_traits {\n\tvoid destroy(pcre_extra *extra);\n\tstatic pcre_extra* default_value();\n};\n\ninline void\npcre_traits::destroy(pcre *value) {\n\tpcre_free(value);\n}\n\ninline pcre*\npcre_traits::default_value() {\n\treturn static_cast<pcre*>(0);\n}\n\ninline void\npcre_extra_traits::destroy(pcre_extra *extra) {\n\tUATRAITS_PCRE_FREE_STUDY(extra);\n}\n\ninline pcre_extra*\npcre_extra_traits::default_value() {\n\treturn static_cast<pcre_extra*>(0);\n}\n\nstd::pair<pcre*, pcre_extra*>\npcre_compile_regex(char const *pattern) {\n\tint error_offset = 0;\n\tchar const *error_ptr = 0;\n\tresource<pcre*, pcre_traits> regex(pcre_compile(pattern, PCRE_CASELESS, &error_ptr, &error_offset, 0));\n\tif (!regex) {\n\t\tthrow error(\"%s at %d of %s\", error_ptr, error_offset, pattern);\n\t}\n\tresource<pcre_extra*, pcre_extra_traits> extra(pcre_study(regex.get(), UATRAITS_PCRE_STUDY_JIT_COMPILE, &error_ptr));\n\tif (!extra && error_ptr) {\n\t\tthrow error(\"%s in %s\", error_ptr, pattern);\n\t}\n\treturn std::make_pair(regex.release(), extra.release());\n}\n\nvoid\npcre_free_regex(std::pair<pcre*, pcre_extra*> const &regex) {\n\tUATRAITS_PCRE_FREE_STUDY(regex.second);\n\tpcre_free(regex.first);\n}\n\n}} \/\/ namespaces\n<commit_msg>Actually the first version of PCRE that has pcre_free_study() & PCRE_STUDY_JIT_COMPILE is 8.20<commit_after>#include \"acsetup.hpp\"\n#include \"uatraits\/details\/pcre_utils.hpp\"\n\n#include \"uatraits\/error.hpp\"\n#include \"uatraits\/details\/resource.hpp\"\n\n#if (PCRE_MAJOR == 8) && (PCRE_MINOR >= 20)\n#define UATRAITS_PCRE_FREE_STUDY pcre_free_study\n#define UATRAITS_PCRE_STUDY_JIT_COMPILE PCRE_STUDY_JIT_COMPILE\n#else\n#define UATRAITS_PCRE_FREE_STUDY pcre_free\n#define UATRAITS_PCRE_STUDY_JIT_COMPILE 0\n#endif\n\nnamespace uatraits { namespace details {\n\nstruct pcre_traits {\n\tvoid destroy(pcre *value);\n\tstatic pcre* default_value();\n};\n\nstruct pcre_extra_traits {\n\tvoid destroy(pcre_extra *extra);\n\tstatic pcre_extra* default_value();\n};\n\ninline void\npcre_traits::destroy(pcre *value) {\n\tpcre_free(value);\n}\n\ninline pcre*\npcre_traits::default_value() {\n\treturn static_cast<pcre*>(0);\n}\n\ninline void\npcre_extra_traits::destroy(pcre_extra *extra) {\n\tUATRAITS_PCRE_FREE_STUDY(extra);\n}\n\ninline pcre_extra*\npcre_extra_traits::default_value() {\n\treturn static_cast<pcre_extra*>(0);\n}\n\nstd::pair<pcre*, pcre_extra*>\npcre_compile_regex(char const *pattern) {\n\tint error_offset = 0;\n\tchar const *error_ptr = 0;\n\tresource<pcre*, pcre_traits> regex(pcre_compile(pattern, PCRE_CASELESS, &error_ptr, &error_offset, 0));\n\tif (!regex) {\n\t\tthrow error(\"%s at %d of %s\", error_ptr, error_offset, pattern);\n\t}\n\tresource<pcre_extra*, pcre_extra_traits> extra(pcre_study(regex.get(), UATRAITS_PCRE_STUDY_JIT_COMPILE, &error_ptr));\n\tif (!extra && error_ptr) {\n\t\tthrow error(\"%s in %s\", error_ptr, pattern);\n\t}\n\treturn std::make_pair(regex.release(), extra.release());\n}\n\nvoid\npcre_free_regex(std::pair<pcre*, pcre_extra*> const &regex) {\n\tUATRAITS_PCRE_FREE_STUDY(regex.second);\n\tpcre_free(regex.first);\n}\n\n}} \/\/ namespaces\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2020-present ScyllaDB\n *\n *\/\n\n\/*\n * SPDX-License-Identifier: AGPL-3.0-or-later\n *\/\n\n#include \"sstables-format-selector.hh\"\n#include \"log.hh\"\n#include \"replica\/database.hh\"\n#include \"gms\/gossiper.hh\"\n#include \"gms\/feature_service.hh\"\n#include \"gms\/versioned_value.hh\"\n#include \"db\/system_keyspace.hh\"\n\nnamespace db {\n\nstatic logging::logger logger(\"format_selector\");\nstatic const sstring SSTABLE_FORMAT_PARAM_NAME = \"sstable_format\";\n\nvoid feature_enabled_listener::on_enabled() {\n    if (!_started) {\n        _started = true;\n        \/\/ FIXME -- discarded future\n        (void)_selector.maybe_select_format(_format);\n    }\n}\n\nsstables_format_selector::sstables_format_selector(gms::gossiper& g, sharded<gms::feature_service>& f, sharded<replica::database>& db)\n    : _gossiper(g)\n    , _features(f)\n    , _db(db)\n    , _md_feature_listener(*this, sstables::sstable_version_types::md)\n    , _me_feature_listener(*this, sstables::sstable_version_types::me)\n{ }\n\nfuture<> sstables_format_selector::maybe_select_format(sstables::sstable_version_types new_format) {\n    return with_gate(_sel, [this, new_format] {\n        return do_maybe_select_format(new_format);\n    });\n}\n\nfuture<> sstables_format_selector::do_maybe_select_format(sstables::sstable_version_types new_format) {\n    return with_semaphore(_sem, 1, [this, new_format] {\n        if (new_format <= _selected_format) {\n            return make_ready_future<bool>(false);\n        }\n        return db::system_keyspace::set_scylla_local_param(SSTABLE_FORMAT_PARAM_NAME, to_string(new_format)).then([this, new_format] {\n            return select_format(new_format);\n        }).then([] { return true; });\n    }).then([this] (bool update_features) {\n        if (!update_features) {\n            return make_ready_future<>();\n        }\n        return _gossiper.add_local_application_state(gms::application_state::SUPPORTED_FEATURES,\n                 gms::versioned_value::supported_features(_features.local().supported_feature_set()));\n    });\n}\n\nfuture<> sstables_format_selector::start() {\n    assert(this_shard_id() == 0);\n    return read_sstables_format().then([this] {\n        _features.local().me_sstable.when_enabled(_me_feature_listener);\n        _features.local().md_sstable.when_enabled(_md_feature_listener);\n        return make_ready_future<>();\n    });\n}\n\nfuture<> sstables_format_selector::stop() {\n    return _sel.close();\n}\n\nfuture<> sstables_format_selector::read_sstables_format() {\n    return db::system_keyspace::get_scylla_local_param(SSTABLE_FORMAT_PARAM_NAME).then([this] (std::optional<sstring> format_opt) {\n        if (format_opt) {\n            sstables::sstable_version_types format = sstables::from_string(*format_opt);\n            return select_format(format);\n        }\n        return make_ready_future<>();\n    });\n}\n\nfuture<> sstables_format_selector::select_format(sstables::sstable_version_types format) {\n    logger.info(\"Selected {} sstables format\", to_string(format));\n    _selected_format = format;\n    return _db.invoke_on_all([this] (replica::database& db) {\n        db.set_format(_selected_format);\n    });\n}\n\n} \/\/ namespace sstables\n<commit_msg>format-selector: Coroutinize simple methods<commit_after>\/*\n * Copyright (C) 2020-present ScyllaDB\n *\n *\/\n\n\/*\n * SPDX-License-Identifier: AGPL-3.0-or-later\n *\/\n\n#include <seastar\/core\/coroutine.hh>\n#include \"sstables-format-selector.hh\"\n#include \"log.hh\"\n#include \"replica\/database.hh\"\n#include \"gms\/gossiper.hh\"\n#include \"gms\/feature_service.hh\"\n#include \"gms\/versioned_value.hh\"\n#include \"db\/system_keyspace.hh\"\n\nnamespace db {\n\nstatic logging::logger logger(\"format_selector\");\nstatic const sstring SSTABLE_FORMAT_PARAM_NAME = \"sstable_format\";\n\nvoid feature_enabled_listener::on_enabled() {\n    if (!_started) {\n        _started = true;\n        \/\/ FIXME -- discarded future\n        (void)_selector.maybe_select_format(_format);\n    }\n}\n\nsstables_format_selector::sstables_format_selector(gms::gossiper& g, sharded<gms::feature_service>& f, sharded<replica::database>& db)\n    : _gossiper(g)\n    , _features(f)\n    , _db(db)\n    , _md_feature_listener(*this, sstables::sstable_version_types::md)\n    , _me_feature_listener(*this, sstables::sstable_version_types::me)\n{ }\n\nfuture<> sstables_format_selector::maybe_select_format(sstables::sstable_version_types new_format) {\n    return with_gate(_sel, [this, new_format] {\n        return do_maybe_select_format(new_format);\n    });\n}\n\nfuture<> sstables_format_selector::do_maybe_select_format(sstables::sstable_version_types new_format) {\n    return with_semaphore(_sem, 1, [this, new_format] {\n        if (new_format <= _selected_format) {\n            return make_ready_future<bool>(false);\n        }\n        return db::system_keyspace::set_scylla_local_param(SSTABLE_FORMAT_PARAM_NAME, to_string(new_format)).then([this, new_format] {\n            return select_format(new_format);\n        }).then([] { return true; });\n    }).then([this] (bool update_features) {\n        if (!update_features) {\n            return make_ready_future<>();\n        }\n        return _gossiper.add_local_application_state(gms::application_state::SUPPORTED_FEATURES,\n                 gms::versioned_value::supported_features(_features.local().supported_feature_set()));\n    });\n}\n\nfuture<> sstables_format_selector::start() {\n    assert(this_shard_id() == 0);\n    co_await read_sstables_format();\n    _features.local().me_sstable.when_enabled(_me_feature_listener);\n    _features.local().md_sstable.when_enabled(_md_feature_listener);\n}\n\nfuture<> sstables_format_selector::stop() {\n    co_await _sel.close();\n}\n\nfuture<> sstables_format_selector::read_sstables_format() {\n    std::optional<sstring> format_opt = co_await db::system_keyspace::get_scylla_local_param(SSTABLE_FORMAT_PARAM_NAME);\n    if (format_opt) {\n        sstables::sstable_version_types format = sstables::from_string(*format_opt);\n        co_await select_format(format);\n    }\n}\n\nfuture<> sstables_format_selector::select_format(sstables::sstable_version_types format) {\n    logger.info(\"Selected {} sstables format\", to_string(format));\n    _selected_format = format;\n    co_await _db.invoke_on_all([this] (replica::database& db) {\n        db.set_format(_selected_format);\n    });\n}\n\n} \/\/ namespace sstables\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Allow master (and other daemons) to run as pid 1 #7472<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>Fix overflow<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>Skip a test in StackTraceTest under TSAN because it calls signal unsafe functions.<commit_after><|endoftext|>"}
{"text":"<commit_before>#ifndef KGR_KANGARU_INCLUDE_KANGARU_DETAIL_SERVICE_MAP_HPP\n#define KGR_KANGARU_INCLUDE_KANGARU_DETAIL_SERVICE_MAP_HPP\n\n#include \"traits.hpp\"\n#include \"detection.hpp\"\n\nnamespace kgr {\n\n\/*\n * This class is the type when referring to a group of maps.\n * This can be used with kgr::autocall and mapped operator services.\n *\/\ntemplate<typename...>\nstruct map {};\n\n\/*\n * This is the type you receive in a service_map function.\n * This was previously kgr::Map in kangaru 3.x.y\n *\/\ntemplate<typename = void>\nstruct map_t {};\n\nnamespace detail {\n\n\/*\n * Alias to the expression of a normal named service map\n *\/\ntemplate<typename S, typename M>\nusing normal_map_result_mapped = decltype(service_map(std::declval<S>(), std::declval<M>()));\n\n\/*\n * Alias to the expression of a normal non named service map\n *\/\ntemplate<typename S>\nusing normal_map_result_void = decltype(service_map(std::declval<S>()));\n\n#if (defined(__clang__) && __clang_major__ < 7) || (defined(_MSC_VER) && not defined(__clang__))\ntemplate<typename S>\nstruct probe {\n\ttemplate<typename T, enable_if_t<\n\t\tstd::is_same<T&, S>::value &&\n\t\t!std::is_const<T>::value, int> = 0>\n\toperator T& ();\n\t\n\ttemplate<typename T, enable_if_t<\n\t\tstd::is_same<T&&, S&&>::value &&\n\t\t!std::is_const<T>::value, int> = 0>\n\toperator T&& ();\n\t\n\ttemplate<typename T, enable_if_t<\n\t\tstd::is_same<T const&, S>::value, int> = 0>\n\toperator T const& () const;\n\t\n\ttemplate<typename T, enable_if_t<\n\t\tstd::is_same<T const&&, S&&>::value, int> = 0>\n\toperator T const&& () const;\n};\n\n\/*\n * Alias to the expression of a normal mapped service map\n *\/\ntemplate<typename S, typename M>\nusing probed_map_result_mapped = normal_map_result_mapped<probe<S>, M>;\n\n\/*\n * Alias to the expression of a normal mapped service map\n *\/\ntemplate<typename S>\nusing probed_map_result_void = normal_map_result_void<probe<S>>;\n#else\ntemplate<typename S>\nstruct probe {\n\ttemplate<typename T, enable_if_t<std::is_same<T&, S>::value, int> = 0>\n\toperator T& ();\n\t\n\ttemplate<typename T, enable_if_t<std::is_same<T&&, S&&>::value, int> = 0>\n\toperator T&& ();\n};\n\n\/*\n * Alias to the expression of a normal mapped service map\n *\/\ntemplate<typename S, typename M, typename Result = detected_or<detected_t<normal_map_result_mapped, probe<constify_t<S>>, M>, normal_map_result_mapped, probe<S>, M>>\nusing probed_map_result_mapped = enable_if_t<such<Result>::value, Result>;\n\n\/*\n * Alias to the expression of a normal mapped service map\n *\/\ntemplate<typename S, typename Result = detected_or<detected_t<normal_map_result_void, probe<constify_t<S>>>, normal_map_result_void, probe<S>>>\nusing probed_map_result_void = enable_if_t<such<Result>::value, Result>;\n#endif\n\n\/*\n * Trait that determines if a type is a map type.\n *\/\ntemplate<typename T>\nstruct is_map : std::false_type {};\n\n\/*\n * This is the specialization when T is a kgr::map.\n *\/\ntemplate<typename... Ts>\nstruct is_map<map<Ts...>> : std::true_type {};\n\n\/*\n * Type trait that check if a particular type is an indirect map.\n *\/\ntemplate<typename R>\nstruct is_indirect_map_helper {\nprivate:\n\ttemplate<template<typename> class>\n\tstatic auto test_helper() -> std::true_type;\n\t\n\ttemplate<typename T>\n\tstatic auto test(int) -> decltype(test_helper<T::template mapped_service>());\n\t\n\ttemplate<typename>\n\tstatic auto test(void*) -> std::false_type;\n\t\npublic:\n\tusing type = decltype(test<R>(0));\n};\n\n\/*\n * Alias to the is_indirect_map_helper trait.\n *\/\ntemplate<typename R>\nusing is_indirect_map = typename is_indirect_map_helper<R>::type;\n\n\/*\n * helper implementation for the indirect map.\n *\/\ntemplate<typename Indirect, typename Service>\nstruct indirect_map {\n\tusing type = typename Indirect::template mapped_service<Service>;\n};\n\n\/*\n * Trait that returns the return type of the service_map function\n *\/\ntemplate<typename, typename, typename = void>\nstruct map_result {};\n\n\/\/TODO: In kangaru 5, disable implicit conversion in service maps.\n\/*\n * Specialization of map_result when service_map() exist for S with the map M.\n *\/\ntemplate<typename S, typename M>\nstruct map_result<S, M, enable_if_t<!is_indirect_map<normal_map_result_mapped<S, M>>::value>> {\n\tusing type = normal_map_result_mapped<S, M>;\n};\n\n\/*\n * Specialization of map_result when service_map() exist for S with no map.\n *\/\ntemplate<typename S>\nstruct map_result<S, void, enable_if_t<!is_indirect_map<normal_map_result_void<S>>::value>> {\n\tusing type = normal_map_result_void<S>;\n};\n\n\/*\n * Specialization of map_result when service_map() exist for S with the map M.\n *\/\ntemplate<typename S, typename M>\nstruct map_result<S, M, enable_if_t<is_detected<probed_map_result_mapped, S, M>::value && is_indirect_map<normal_map_result_mapped<S, M>>::value>> :\n\tindirect_map<normal_map_result_mapped<S, M>, S> {};\n\n\/*\n * Specialization of map_result when service_map() exist for S with no map.\n *\/\ntemplate<typename S>\nstruct map_result<S, void, enable_if_t<is_detected<probed_map_result_void, S>::value && is_indirect_map<normal_map_result_void<S>>::value>> :\n\tindirect_map<normal_map_result_void<S>, S> {};\n\n\/*\n * Alias for map_result::type\n *\/\ntemplate<typename S, typename M>\nusing map_result_t = typename map_result<S, M>::type;\n\n\/*\n * This is a trait that tell if the service S is mapped in M\n *\/\ntemplate<typename, typename, typename = void>\nstruct is_mapped : std::false_type {};\n\n\/*\n * Trait that check if the result of the map is a valid service that forwards something convertible to S.\n *\/\ntemplate<typename M, typename S>\nusing is_valid_entry = std::integral_constant<bool,\n\tstd::is_convertible<typename std::remove_cv<service_type<map_result_t<S, M>>>::type&&, S&>::value ||\n\tstd::is_convertible<typename std::remove_cv<service_type<map_result_t<S, M>>>::type&&, S&&>::value\n>;\n\n\/*\n * Specialization when map M maps the service S\n *\/\ntemplate<typename M, typename S>\nstruct is_mapped<map<M>, S, enable_if_t<is_valid_entry<map_t<M>, S>::value>> : std::true_type {};\n\n\/*\n * Specialization for an empty map, equivalent for a void map\n *\/\ntemplate<typename S>\nstruct is_mapped<map<>, S, enable_if_t<is_valid_entry<map_t<>, S>::value>> : std::true_type {};\n\n\/*\n * Specialization when no map is specified.\n *\/\ntemplate<typename S>\nstruct is_mapped<void, S, enable_if_t<is_valid_entry<void, S>::value>> : std::true_type {};\n\n\/*\n * Trait that extranct the mapped service type given the parameter and a group of maps.\n *\/\ntemplate<typename, typename, typename = void>\nstruct map_entry {};\n\n\/*\n * When no service map entry has been found for First, continue with the next map\n *\/\ntemplate<typename First, typename... Maps, typename P>\nstruct map_entry<map<First, Maps...>, P, enable_if_t<!is_mapped<map<First>, P>::value>> : map_entry<map<Maps...>, P> {};\n\n\/*\n * Case when a map has been found.\n * We proceed to create an alias for the mapped definition.\n *\/\ntemplate<typename First, typename... Maps, typename P>\nstruct map_entry<map<First, Maps...>, P, enable_if_t<is_mapped<map<First>, P>::value>> {\n\tusing mapped_service = map_result_t<P, map_t<First>>;\n};\n\n\/*\n * Case when a map has been found for an empty map.\n * We proceed to create an alias for the mapped definition.\n *\/\ntemplate<typename P>\nstruct map_entry<map<>, P, enable_if_t<is_mapped<map<>, P>::value>> {\n\tusing mapped_service = map_result_t<P, map_t<>>;\n};\n\n\/*\n * Case when the empty map does not yeild any mapped service.\n * We proceed to extend an try the void map.\n *\/\ntemplate<typename P>\nstruct map_entry<map<>, P, enable_if_t<!is_mapped<map<>, P>::value>> : map_entry<void, P> {};\n\n\/*\n * Case when the only service map found has no map specified at all.\n *\/\ntemplate<typename P>\nstruct map_entry<void, P, enable_if_t<is_mapped<void, P>::value>> {\n\tusing mapped_service = map_result_t<P, void>;\n};\n\n\/*\n * Trait to tell if a parameter is mapped using the map group Map.\n *\/\ntemplate<typename Map, typename T, typename = void>\nstruct is_complete_map : std::false_type {};\n\n\/*\n * Specialization of is_complete_map when the service T is mapped in Map\n *\/\ntemplate<typename... Maps, typename T>\nstruct is_complete_map<map<Maps...>, T, void_t<typename map_entry<map<Maps...>, T>::mapped_service>> : std::true_type {};\n\n} \/\/ namespace detail\n\n\/*\n * This is an alias for the mapped definition in a service map.\n *\/\ntemplate<typename T, typename Map = map<>>\nusing mapped_service_t = typename detail::map_entry<Map, T>::mapped_service;\n\n} \/\/ namespace kgr\n\n#endif \/\/ KGR_KANGARU_INCLUDE_KANGARU_DETAIL_SERVICE_MAP_HPP\n<commit_msg>Fixed visual studio build<commit_after>#ifndef KGR_KANGARU_INCLUDE_KANGARU_DETAIL_SERVICE_MAP_HPP\n#define KGR_KANGARU_INCLUDE_KANGARU_DETAIL_SERVICE_MAP_HPP\n\n#include \"traits.hpp\"\n#include \"detection.hpp\"\n\nnamespace kgr {\n\n\/*\n * This class is the type when referring to a group of maps.\n * This can be used with kgr::autocall and mapped operator services.\n *\/\ntemplate<typename...>\nstruct map {};\n\n\/*\n * This is the type you receive in a service_map function.\n * This was previously kgr::Map in kangaru 3.x.y\n *\/\ntemplate<typename = void>\nstruct map_t {};\n\nnamespace detail {\n\n\/*\n * Alias to the expression of a normal named service map\n *\/\ntemplate<typename S, typename M>\nusing normal_map_result_mapped = decltype(service_map(std::declval<S>(), std::declval<M>()));\n\n\/*\n * Alias to the expression of a normal non named service map\n *\/\ntemplate<typename S>\nusing normal_map_result_void = decltype(service_map(std::declval<S>()));\n\n#if (defined(__clang__) && __clang_major__ < 7) || (defined(_MSC_VER) && !defined(__clang__))\ntemplate<typename S>\nstruct probe {\n\ttemplate<typename T, enable_if_t<\n\t\tstd::is_same<T&, S>::value &&\n\t\t!std::is_const<T>::value, int> = 0>\n\toperator T& ();\n\t\n\ttemplate<typename T, enable_if_t<\n\t\tstd::is_same<T&&, S&&>::value &&\n\t\t!std::is_const<T>::value, int> = 0>\n\toperator T&& ();\n\t\n\ttemplate<typename T, enable_if_t<\n\t\tstd::is_same<T const&, S>::value, int> = 0>\n\toperator T const& () const;\n\t\n\ttemplate<typename T, enable_if_t<\n\t\tstd::is_same<T const&&, S&&>::value, int> = 0>\n\toperator T const&& () const;\n};\n\n\/*\n * Alias to the expression of a normal mapped service map\n *\/\ntemplate<typename S, typename M>\nusing probed_map_result_mapped = normal_map_result_mapped<probe<S>, M>;\n\n\/*\n * Alias to the expression of a normal mapped service map\n *\/\ntemplate<typename S>\nusing probed_map_result_void = normal_map_result_void<probe<S>>;\n#else\ntemplate<typename S>\nstruct probe {\n\ttemplate<typename T, enable_if_t<std::is_same<T&, S>::value, int> = 0>\n\toperator T& ();\n\t\n\ttemplate<typename T, enable_if_t<std::is_same<T&&, S&&>::value, int> = 0>\n\toperator T&& ();\n};\n\n\/*\n * Alias to the expression of a normal mapped service map\n *\/\ntemplate<typename S, typename M, typename Result = detected_or<detected_t<normal_map_result_mapped, probe<constify_t<S>>, M>, normal_map_result_mapped, probe<S>, M>>\nusing probed_map_result_mapped = enable_if_t<such<Result>::value, Result>;\n\n\/*\n * Alias to the expression of a normal mapped service map\n *\/\ntemplate<typename S, typename Result = detected_or<detected_t<normal_map_result_void, probe<constify_t<S>>>, normal_map_result_void, probe<S>>>\nusing probed_map_result_void = enable_if_t<such<Result>::value, Result>;\n#endif\n\n\/*\n * Trait that determines if a type is a map type.\n *\/\ntemplate<typename T>\nstruct is_map : std::false_type {};\n\n\/*\n * This is the specialization when T is a kgr::map.\n *\/\ntemplate<typename... Ts>\nstruct is_map<map<Ts...>> : std::true_type {};\n\n\/*\n * Type trait that check if a particular type is an indirect map.\n *\/\ntemplate<typename R>\nstruct is_indirect_map_helper {\nprivate:\n\ttemplate<template<typename> class>\n\tstatic auto test_helper() -> std::true_type;\n\t\n\ttemplate<typename T>\n\tstatic auto test(int) -> decltype(test_helper<T::template mapped_service>());\n\t\n\ttemplate<typename>\n\tstatic auto test(void*) -> std::false_type;\n\t\npublic:\n\tusing type = decltype(test<R>(0));\n};\n\n\/*\n * Alias to the is_indirect_map_helper trait.\n *\/\ntemplate<typename R>\nusing is_indirect_map = typename is_indirect_map_helper<R>::type;\n\n\/*\n * helper implementation for the indirect map.\n *\/\ntemplate<typename Indirect, typename Service>\nstruct indirect_map {\n\tusing type = typename Indirect::template mapped_service<Service>;\n};\n\n\/*\n * Trait that returns the return type of the service_map function\n *\/\ntemplate<typename, typename, typename = void>\nstruct map_result {};\n\n\/\/TODO: In kangaru 5, disable implicit conversion in service maps.\n\/*\n * Specialization of map_result when service_map() exist for S with the map M.\n *\/\ntemplate<typename S, typename M>\nstruct map_result<S, M, enable_if_t<!is_indirect_map<normal_map_result_mapped<S, M>>::value>> {\n\tusing type = normal_map_result_mapped<S, M>;\n};\n\n\/*\n * Specialization of map_result when service_map() exist for S with no map.\n *\/\ntemplate<typename S>\nstruct map_result<S, void, enable_if_t<!is_indirect_map<normal_map_result_void<S>>::value>> {\n\tusing type = normal_map_result_void<S>;\n};\n\n\/*\n * Specialization of map_result when service_map() exist for S with the map M.\n *\/\ntemplate<typename S, typename M>\nstruct map_result<S, M, enable_if_t<is_detected<probed_map_result_mapped, S, M>::value && is_indirect_map<normal_map_result_mapped<S, M>>::value>> :\n\tindirect_map<normal_map_result_mapped<S, M>, S> {};\n\n\/*\n * Specialization of map_result when service_map() exist for S with no map.\n *\/\ntemplate<typename S>\nstruct map_result<S, void, enable_if_t<is_detected<probed_map_result_void, S>::value && is_indirect_map<normal_map_result_void<S>>::value>> :\n\tindirect_map<normal_map_result_void<S>, S> {};\n\n\/*\n * Alias for map_result::type\n *\/\ntemplate<typename S, typename M>\nusing map_result_t = typename map_result<S, M>::type;\n\n\/*\n * This is a trait that tell if the service S is mapped in M\n *\/\ntemplate<typename, typename, typename = void>\nstruct is_mapped : std::false_type {};\n\n\/*\n * Trait that check if the result of the map is a valid service that forwards something convertible to S.\n *\/\ntemplate<typename M, typename S>\nusing is_valid_entry = std::integral_constant<bool,\n\tstd::is_convertible<typename std::remove_cv<service_type<map_result_t<S, M>>>::type&&, S&>::value ||\n\tstd::is_convertible<typename std::remove_cv<service_type<map_result_t<S, M>>>::type&&, S&&>::value\n>;\n\n\/*\n * Specialization when map M maps the service S\n *\/\ntemplate<typename M, typename S>\nstruct is_mapped<map<M>, S, enable_if_t<is_valid_entry<map_t<M>, S>::value>> : std::true_type {};\n\n\/*\n * Specialization for an empty map, equivalent for a void map\n *\/\ntemplate<typename S>\nstruct is_mapped<map<>, S, enable_if_t<is_valid_entry<map_t<>, S>::value>> : std::true_type {};\n\n\/*\n * Specialization when no map is specified.\n *\/\ntemplate<typename S>\nstruct is_mapped<void, S, enable_if_t<is_valid_entry<void, S>::value>> : std::true_type {};\n\n\/*\n * Trait that extranct the mapped service type given the parameter and a group of maps.\n *\/\ntemplate<typename, typename, typename = void>\nstruct map_entry {};\n\n\/*\n * When no service map entry has been found for First, continue with the next map\n *\/\ntemplate<typename First, typename... Maps, typename P>\nstruct map_entry<map<First, Maps...>, P, enable_if_t<!is_mapped<map<First>, P>::value>> : map_entry<map<Maps...>, P> {};\n\n\/*\n * Case when a map has been found.\n * We proceed to create an alias for the mapped definition.\n *\/\ntemplate<typename First, typename... Maps, typename P>\nstruct map_entry<map<First, Maps...>, P, enable_if_t<is_mapped<map<First>, P>::value>> {\n\tusing mapped_service = map_result_t<P, map_t<First>>;\n};\n\n\/*\n * Case when a map has been found for an empty map.\n * We proceed to create an alias for the mapped definition.\n *\/\ntemplate<typename P>\nstruct map_entry<map<>, P, enable_if_t<is_mapped<map<>, P>::value>> {\n\tusing mapped_service = map_result_t<P, map_t<>>;\n};\n\n\/*\n * Case when the empty map does not yeild any mapped service.\n * We proceed to extend an try the void map.\n *\/\ntemplate<typename P>\nstruct map_entry<map<>, P, enable_if_t<!is_mapped<map<>, P>::value>> : map_entry<void, P> {};\n\n\/*\n * Case when the only service map found has no map specified at all.\n *\/\ntemplate<typename P>\nstruct map_entry<void, P, enable_if_t<is_mapped<void, P>::value>> {\n\tusing mapped_service = map_result_t<P, void>;\n};\n\n\/*\n * Trait to tell if a parameter is mapped using the map group Map.\n *\/\ntemplate<typename Map, typename T, typename = void>\nstruct is_complete_map : std::false_type {};\n\n\/*\n * Specialization of is_complete_map when the service T is mapped in Map\n *\/\ntemplate<typename... Maps, typename T>\nstruct is_complete_map<map<Maps...>, T, void_t<typename map_entry<map<Maps...>, T>::mapped_service>> : std::true_type {};\n\n} \/\/ namespace detail\n\n\/*\n * This is an alias for the mapped definition in a service map.\n *\/\ntemplate<typename T, typename Map = map<>>\nusing mapped_service_t = typename detail::map_entry<Map, T>::mapped_service;\n\n} \/\/ namespace kgr\n\n#endif \/\/ KGR_KANGARU_INCLUDE_KANGARU_DETAIL_SERVICE_MAP_HPP\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <boost\/asio.hpp>\n#include <boost\/atomic.hpp>\n#include <boost\/thread.hpp>\n\n#include <stdlib.h>\n\n#include \"vtrc-server\/vtrc-application-iface.h\"\n#include \"vtrc-common\/vtrc-thread-poll.h\"\n\nnamespace ba = boost::asio;\n\nclass main_app: public vtrc::server::application_iface\n{\n    ba::io_service ios_;\npublic:\n    main_app( )\n    {}\n    ba::io_service &get_io_service( )\n    {\n        return ios_;\n    }\n};\n\nvoid print( )\n{\n\n    std::cout << \"hello\\n\";\n}\n\nint main( )\n{\n\n    vtrc::common::thread_poll poll( 10 );\n\n    size_t count = poll.size( );\n\n    sleep( 5 );\n    poll.stop( );\n    std::cout << \"Stop!\\n\";\n\treturn 0;\n}\n<commit_msg>threads<commit_after>#include <iostream>\n#include <boost\/asio.hpp>\n#include <boost\/atomic.hpp>\n#include <boost\/thread.hpp>\n\n#include <stdlib.h>\n\n#include \"vtrc-server\/vtrc-application-iface.h\"\n#include \"vtrc-common\/vtrc-thread-poll.h\"\n\nnamespace ba = boost::asio;\n\nclass main_app: public vtrc::server::application_iface\n{\n    ba::io_service ios_;\npublic:\n    main_app( )\n    {}\n    ba::io_service &get_io_service( )\n    {\n        return ios_;\n    }\n};\n\nvoid print( )\n{\n\n    std::cout << \"hello\\n\";\n}\n\nint main( )\n{\n\n    boost::asio::ip::address addr =\n            boost::asio::ip::address::from_string( \"ff::1\" );\n\n    std::cout << addr.to_string() << \"\\n\";\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: ViewShellManager.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: obo $ $Date: 2004-11-16 16:13: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 SD_VIEW_SHELL_MANAGER_HXX\n#define SD_VIEW_SHELL_MANAGER_HXX\n\n#include \"ShellFactory.hxx\"\n\n#ifndef _LINK_HXX\n#include <tools\/link.hxx>\n#endif\n#include <memory>\n#include <vector>\n\nclass SfxShell;\nclass VclWindowEvent;\n\nnamespace sd {\n\nclass ViewShell;\nclass ViewShellBase;\nclass ViewShellCache;\n\n\/** The sub-shell manager has the responsibility to maintain the sub shells\n    stacked on a ViewShellBase object.  They form a two level hierarchy.  On\n    the first level there are the view shells which are managed directly by\n    this class.  On the second level there are the object bars wrapped into\n    an SfxShell.  They are managed by ObjectBarManager objects, one for each\n    view shell.\n\n    <p>View shell management consists of maintaining the correct order of\n    all stacked shells.  Those that belong to the view shell that currently\n    has the focus have to be top-most to be considered first by the slot call\n    dispatcher.  Object bars have to be on top of their view shells so that\n    the associated functions are called first.<\/p>\n\n    <p>This class uses pointers to the ::sd::ViewShell class instead of its\n    ::SfxShell base class because it needs access to the object bar manager\n    of the ViewShell class so that that manager can be instructed to\n    activate or deactivate its object bars.<\/p>\n*\/\nclass ViewShellManager\n{\npublic:\n    typedef ShellFactory<ViewShell> ViewShellFactory;\n\n    ViewShellManager (ViewShellBase& rBase);\n\n    \/** Before the destructor is called the method Shutdown() has to have\n        been called.\n    *\/\n    ~ViewShellManager (void);\n\n    \/** Tell a ViewShellManager object to prepare to be deleted, i.e. to\n        destroy all of its resources.\n    *\/\n    void Shutdown (void);\n\n    \/** Register the default factory that is called to create a new instance\n        of a shell for a given id when there is no factory that has been\n        registered specially for that id.\n        @param pFactory\n            The factory object that is called to create a new shell instance.\n    *\/\n    void RegisterDefaultFactory (::std::auto_ptr<ViewShellFactory> pFactory);\n\n    \/** Register a factory that is called to create a shell for the\n        specified id.  This takes precedence over the default factory.\n    *\/\n    void RegisterFactory (\n        ShellId nId,\n        ::std::auto_ptr<ViewShellFactory> pFactory);\n\n    \/** Create a new (or possibly recycle an existing) instance of a view\n        shell that is specified by the given id.  When called multiple times\n        with the same id then multiple instances of the associated view\n        shell are created.  Use the returned pointer to distinguish between\n        these.\n        @param nId\n            The id of the shell to activate.\n        @return\n            A pointer to the activated shell is returned.  Use this pointer\n            to identify the shell in other method calls.  When an activation\n            is not possible then NULL is returned.\n    *\/\n    ViewShell* ActivateViewShell (\n        ShellId nId,\n        ::Window* pParentWindow,\n        FrameView* pFrameView);\n\n    \/** Deactivate the specified shell, i.e. take it and all of its\n        object bars from the shell stack.\n        @param pShell\n            The shell to deactivate.\n    *\/\n    void DeactivateViewShell (const ViewShell* pShell);\n\n    \/** Call this method when a 'secondary' shell is moved to or from the\n        stack, e.g. an object bar.  As a result a pending\n        TakeShellsFromStack() is executed and at the next UnlockUpdate() to\n        lock level 0 the shells are asked about their secondary shells to\n        push on the shell stack.\n    *\/\n    void InvalidateShellStack (void);\n\n    \/** Move the specified view shell to the top most position on the stack\n        of view shells in relation to the other view shells.  After this the\n        only shells that are higher on the stack are its object bars.\n\n        Call this method after a focus change to bring a view mode view\n        shell and ist associated tool bar shells to the top of the\n        stack.\n\n        The mbKeepMainViewShellOnTop flag is not obeyed.\n\n        @param nId\n            The id of the shell to move to the top.\n    *\/\n    void MoveToTop (const ViewShell* pShell);\n\n    \/** Return the first, i.e. top most, view shell that has been activated\n        under the given id.\n        @param nId\n            The id of the shell for which to return a pointer.\n        @return\n            When the specified shell is currently not active then NULL is\n            returned.\n    *\/\n    ViewShell* GetShell (ShellId nId);\n\n    \/** Return the id of the given shell.\n    *\/\n    ShellId GetShellId (const ViewShell* pShell);\n\n    \/** Prevent updates of the shell stack.  While the sub shell manager is\n        locked it will update its internal data structures but not alter the\n        shell stack.  Use this method when there are several modifications\n        to the shell stack to prevent multiple rebuilds of the shell stack\n        and resulting broadcasts.\n    *\/\n    void LockUpdate (void);\n\n    \/** Allow updates of the shell stack.  This method has to be called the\n        same number of times as LockUpdate() to really allow a rebuild of\n        the shell stack.\n        *\/\n    void UnlockUpdate (void);\n\n    \/** Return the ViewShellBase for which objects of this class manage the\n        stacked view shells.\n    *\/\n    ViewShellBase& GetViewShellBase (void) const;\n\n    \/** Deactivate the view shell manager so that it pretty much ignores all\n        subsequent calls.  Use this when the owner of the view shell manager\n        is about being destroyed but the view shell manager itself can not\n        yet be deleted.\n    *\/\n    void ShutDown (void);\n\n    \/** Use one of the registered factories to create the requested view\n        shell.\n        @return\n            When a view shell of the requested type can not be created,\n            e.g. because no factory for it has been registered, NULL is\n            returned.\n            The returned view shell can be destroyed by the caller.\n    *\/\n    ViewShell* CreateViewShell (\n        ShellId nShellId,\n        ::Window* pParentWindow,\n        FrameView* pFrameView);\n\n    \/** Use this class to safely lock updates of the view shell stack.\n    *\/\n    class UpdateLocker\n    {\n    public:\n        explicit UpdateLocker (ViewShellManager& rManager);\n        ~UpdateLocker (void);\n    private:\n        ViewShellManager&mrManager;\n    };\n\nprivate:\n    ViewShellBase& mrBase;\n\n    ::std::auto_ptr<ViewShellFactory> mpDefaultFactory;\n    class SpecializedFactoryList;\n    ::std::auto_ptr<SpecializedFactoryList> mpSpecializedFactories;\n    class ActiveShellList;\n    ::std::auto_ptr<ActiveShellList> mpActiveViewShells;\n    ::std::auto_ptr<ViewShellCache> mpCache;\n\n    int mnUpdateLockCount;\n\n    \/** When this flag is set then the main view shell is always kept at the\n        top of the shell stack.\n    *\/\n    bool mbKeepMainViewShellOnTop;\n\n    \/** This flag is <TRUE\/> until ShutDown() is called.  When it its value\n        is <FALSE\/> then the internal structures may be updated by\n        subsequent method calls but no outside calls take place anymore.\n    *\/\n    bool mbIsValid;\n\n    \/** When this flag is set to <TRUE\/> then before the next activation or\n        deactivation of a shell the shell stack is cleared.  It is set to\n        <TRUE\/> in LockUpdate().  This avoids unnecessary modifications of\n        the shell stack when no (de-)activation takes place in Lock\/Unlock\n        blocks.\n    *\/\n    bool mbTakeShellsFromStackPending;\n\n    void GatherActiveShells (::std::vector<SfxShell*>& aShellsList);\n\n    void TakeShellsFromStack (void);\n\n    \/** This method rebuilds the stack of shells that are stacked upon the\n        view shell base.\n    *\/\n    void PushShellsOnStack (void);\n\n    \/** Called from ActivateViewShell() and DeactivateViewShell() this\n        method calls TakeShellsFromStack() if necessary.  It is necessary\n        when mbTakeShellsFromStackPending is <TRUE\/>.\n    *\/\n    void PrepareStackModification (void);\n\n    DECL_LINK(WindowEventHandler, VclWindowEvent*);\n};\n\n\n\n\n\n} \/\/ end of namespace sd\n\n#endif\n\n<commit_msg>INTEGRATION: CWS impress24 (1.4.20); FILE MERGED 2004\/12\/10 10:07:43 af 1.4.20.1: #i38760# Added mbShellStackIsUpToDate to guard PushShellsOnStack() against recusive calls.<commit_after>\/*************************************************************************\n *\n *  $RCSfile: ViewShellManager.hxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: rt $ $Date: 2004-12-16 10:12:52 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef SD_VIEW_SHELL_MANAGER_HXX\n#define SD_VIEW_SHELL_MANAGER_HXX\n\n#include \"ShellFactory.hxx\"\n\n#ifndef _LINK_HXX\n#include <tools\/link.hxx>\n#endif\n#include <memory>\n#include <vector>\n\nclass SfxShell;\nclass VclWindowEvent;\n\nnamespace sd {\n\nclass ViewShell;\nclass ViewShellBase;\nclass ViewShellCache;\n\n\/** The sub-shell manager has the responsibility to maintain the sub shells\n    stacked on a ViewShellBase object.  They form a two level hierarchy.  On\n    the first level there are the view shells which are managed directly by\n    this class.  On the second level there are the object bars wrapped into\n    an SfxShell.  They are managed by ObjectBarManager objects, one for each\n    view shell.\n\n    <p>View shell management consists of maintaining the correct order of\n    all stacked shells.  Those that belong to the view shell that currently\n    has the focus have to be top-most to be considered first by the slot call\n    dispatcher.  Object bars have to be on top of their view shells so that\n    the associated functions are called first.<\/p>\n\n    <p>This class uses pointers to the ::sd::ViewShell class instead of its\n    ::SfxShell base class because it needs access to the object bar manager\n    of the ViewShell class so that that manager can be instructed to\n    activate or deactivate its object bars.<\/p>\n*\/\nclass ViewShellManager\n{\npublic:\n    typedef ShellFactory<ViewShell> ViewShellFactory;\n\n    ViewShellManager (ViewShellBase& rBase);\n\n    \/** Before the destructor is called the method Shutdown() has to have\n        been called.\n    *\/\n    ~ViewShellManager (void);\n\n    \/** Tell a ViewShellManager object to prepare to be deleted, i.e. to\n        destroy all of its resources.\n    *\/\n    void Shutdown (void);\n\n    \/** Register the default factory that is called to create a new instance\n        of a shell for a given id when there is no factory that has been\n        registered specially for that id.\n        @param pFactory\n            The factory object that is called to create a new shell instance.\n    *\/\n    void RegisterDefaultFactory (::std::auto_ptr<ViewShellFactory> pFactory);\n\n    \/** Register a factory that is called to create a shell for the\n        specified id.  This takes precedence over the default factory.\n    *\/\n    void RegisterFactory (\n        ShellId nId,\n        ::std::auto_ptr<ViewShellFactory> pFactory);\n\n    \/** Create a new (or possibly recycle an existing) instance of a view\n        shell that is specified by the given id.  When called multiple times\n        with the same id then multiple instances of the associated view\n        shell are created.  Use the returned pointer to distinguish between\n        these.\n        @param nId\n            The id of the shell to activate.\n        @return\n            A pointer to the activated shell is returned.  Use this pointer\n            to identify the shell in other method calls.  When an activation\n            is not possible then NULL is returned.\n    *\/\n    ViewShell* ActivateViewShell (\n        ShellId nId,\n        ::Window* pParentWindow,\n        FrameView* pFrameView);\n\n    \/** Deactivate the specified shell, i.e. take it and all of its\n        object bars from the shell stack.\n        @param pShell\n            The shell to deactivate.\n    *\/\n    void DeactivateViewShell (const ViewShell* pShell);\n\n    \/** Call this method when a 'secondary' shell is moved to or from the\n        stack, e.g. an object bar.  As a result a pending\n        TakeShellsFromStack() is executed and at the next UnlockUpdate() to\n        lock level 0 the shells are asked about their secondary shells to\n        push on the shell stack.\n    *\/\n    void InvalidateShellStack (void);\n\n    \/** Move the specified view shell to the top most position on the stack\n        of view shells in relation to the other view shells.  After this the\n        only shells that are higher on the stack are its object bars.\n\n        Call this method after a focus change to bring a view mode view\n        shell and ist associated tool bar shells to the top of the\n        stack.\n\n        The mbKeepMainViewShellOnTop flag is not obeyed.\n\n        @param nId\n            The id of the shell to move to the top.\n    *\/\n    void MoveToTop (const ViewShell* pShell);\n\n    \/** Return the first, i.e. top most, view shell that has been activated\n        under the given id.\n        @param nId\n            The id of the shell for which to return a pointer.\n        @return\n            When the specified shell is currently not active then NULL is\n            returned.\n    *\/\n    ViewShell* GetShell (ShellId nId);\n\n    \/** Return the id of the given shell.\n    *\/\n    ShellId GetShellId (const ViewShell* pShell);\n\n    \/** Prevent updates of the shell stack.  While the sub shell manager is\n        locked it will update its internal data structures but not alter the\n        shell stack.  Use this method when there are several modifications\n        to the shell stack to prevent multiple rebuilds of the shell stack\n        and resulting broadcasts.\n    *\/\n    void LockUpdate (void);\n\n    \/** Allow updates of the shell stack.  This method has to be called the\n        same number of times as LockUpdate() to really allow a rebuild of\n        the shell stack.\n        *\/\n    void UnlockUpdate (void);\n\n    \/** Return the ViewShellBase for which objects of this class manage the\n        stacked view shells.\n    *\/\n    ViewShellBase& GetViewShellBase (void) const;\n\n    \/** Deactivate the view shell manager so that it pretty much ignores all\n        subsequent calls.  Use this when the owner of the view shell manager\n        is about being destroyed but the view shell manager itself can not\n        yet be deleted.\n    *\/\n    void ShutDown (void);\n\n    \/** Use one of the registered factories to create the requested view\n        shell.\n        @return\n            When a view shell of the requested type can not be created,\n            e.g. because no factory for it has been registered, NULL is\n            returned.\n            The returned view shell can be destroyed by the caller.\n    *\/\n    ViewShell* CreateViewShell (\n        ShellId nShellId,\n        ::Window* pParentWindow,\n        FrameView* pFrameView);\n\n    \/** Use this class to safely lock updates of the view shell stack.\n    *\/\n    class UpdateLocker\n    {\n    public:\n        explicit UpdateLocker (ViewShellManager& rManager);\n        ~UpdateLocker (void);\n    private:\n        ViewShellManager&mrManager;\n    };\n\nprivate:\n    ViewShellBase& mrBase;\n\n    ::std::auto_ptr<ViewShellFactory> mpDefaultFactory;\n    class SpecializedFactoryList;\n    ::std::auto_ptr<SpecializedFactoryList> mpSpecializedFactories;\n    class ActiveShellList;\n    ::std::auto_ptr<ActiveShellList> mpActiveViewShells;\n    ::std::auto_ptr<ViewShellCache> mpCache;\n\n    int mnUpdateLockCount;\n\n    \/** When this flag is set then the main view shell is always kept at the\n        top of the shell stack.\n    *\/\n    bool mbKeepMainViewShellOnTop;\n\n    \/** This flag is <TRUE\/> until ShutDown() is called.  When it its value\n        is <FALSE\/> then the internal structures may be updated by\n        subsequent method calls but no outside calls take place anymore.\n    *\/\n    bool mbIsValid;\n\n    \/** When this flag is set to <TRUE\/> then before the next activation or\n        deactivation of a shell the shell stack is cleared.  It is set to\n        <TRUE\/> in LockUpdate().  This avoids unnecessary modifications of\n        the shell stack when no (de-)activation takes place in Lock\/Unlock\n        blocks.\n    *\/\n    bool mbTakeShellsFromStackPending;\n\n    \/** The PushShellsOnStack() method can be called recursively.  This flag\n        is used to communicate between different levels of invocation: if\n        the stack has been updated in an inner call the outer call can (has\n        to) stop and return immediately.\n    *\/\n    bool mbShellStackIsUpToDate;\n\n    void GatherActiveShells (::std::vector<SfxShell*>& aShellsList);\n\n    void TakeShellsFromStack (void);\n\n    \/** This method rebuilds the stack of shells that are stacked upon the\n        view shell base.\n    *\/\n    void PushShellsOnStack (void);\n\n    \/** Called from ActivateViewShell() and DeactivateViewShell() this\n        method calls TakeShellsFromStack() if necessary.  It is necessary\n        when mbTakeShellsFromStackPending is <TRUE\/>.\n    *\/\n    void PrepareStackModification (void);\n\n    DECL_LINK(WindowEventHandler, VclWindowEvent*);\n};\n\n\n\n\n\n} \/\/ end of namespace sd\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>class Solution {\n    pub\n<commit_msg>added solution to search insert position<commit_after>class Solution {\r\npublic:\r\n    int searchInsert(int A[], int n, int target) {\r\n      int l = 0;\r\n      int r = n - 1;\r\n      int m;\r\n      while (l <= r) {\r\n        m = (l + r) >> 1;\r\n        if (target < A[m]) {\r\n          r = m - 1;\r\n        } else if (target > A[m]) {\r\n          l = m + 1;\r\n        } else {\r\n          return m;\r\n        }\r\n      }\r\n      return A[m] > target ? m : m + 1; \r\n    }\r\n};\r\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <vector>\n\n\/**\n* Exercise 17.1\n*\/\n\n\nvoid print2DVector(const std::vector<std::vector<int>> & map){\n  std::cout << \"size: \" << map.size() << \" \" << map.at(0).size() << std::endl;\n  for(int r = 0; r < map.size(); r++){\n    for(int c = 0; c < map.begin()->size(); c++){\n      std::cout << r << \"|\" << map.at(r).at(c) << \"\\t\";\n    }\n    std::cout << std::endl;\n  }\n}\n\n\n\n\nint compute_score(const int score, std::vector<std::vector<int>> & map, int index){\n  if(score < 0){\n    return 0;\n  } else if (map.at(score).at(index) != -1){\n    return map.at(score).at(index);\n  } else {\n    map.at(score).at(0) = compute_score(score-2, map, 0);\n    map.at(score).at(1) = compute_score(score-3, map, 1) + map.at(score).at(0);\n    map.at(score).at(2) = compute_score(score-7, map, 2) + map.at(score).at(1);\n  }\n  return map.at(score).at(index);\n}\n\n\n\nint numCombinationFinalScore(const int score){\n  std::vector<std::vector<int>> map(score+1, std::vector<int>(3, -1));\n  map.at(0).at(0) = 1;\n  map.at(0).at(1) = 1;\n  map.at(0).at(2) = 1;\n  compute_score(score, map, 2);\n  print2DVector(map);\n\n  return map.at(score).at(2);\n}\n\n\nint main(){\n  std::cout << \"Computed: [n, \" << numCombinationFinalScore(50) << \"]\" <<std::endl;\n\n\n  return 0;\n}\n\n<commit_msg>count combinations using dp<commit_after>#include <iostream>\n#include <vector>\n\n\/**\n* Exercise 17.1\n*\/\n\n\nvoid print2DVector(const std::vector<std::vector<int>> & map){\n  std::cout << \"size: \" << map.size() << \" \" << map.at(0).size() << std::endl;\n  for(int r = 0; r < map.size(); r++){\n    for(int c = 0; c < map.begin()->size(); c++){\n      std::cout << r << \"|\" << map.at(r).at(c) << \"\\t\";\n    }\n    std::cout << std::endl;\n  }\n}\n\n\n\n\nint compute_score(const int score, std::vector<std::vector<int>> & map, \n    int index, const std::vector<int> & values){\n  if(score < 0){\n    return 0;\n  } else if (map.at(score).at(index) != -1){\n    return map.at(score).at(index);\n  } else {\n    for(int i = 0; i < values.size(); i++){\n      if (i == 0){\n        map.at(score).at(i) = compute_score(score-values.at(i), map, i, values);\n      } else {\n        map.at(score).at(i) = compute_score(score-values.at(i), map, i, values) + map.at(score).at(i-1);\n      }\n    }\n  }\n  return map.at(score).at(index);\n}\n\n\n\nint numCombinationFinalScore(const int score, const std::vector<int> & values){\n  std::vector<std::vector<int>> map(score+1, std::vector<int>(values.size(), -1));\n  for(int i = 0; i < values.size(); i++){\n    map.at(0).at(i) = 1;\n  }\n  compute_score(score, map, values.size()-1, values);\n  print2DVector(map);\n\n  return map.at(score).at(values.size()-1);\n}\n\n\nint main(){\n  std::cout << \"Computed: [n, \" << numCombinationFinalScore(100, std::vector<int>{1, 2, 3}) << \"]\" <<std::endl;\n\n\n  return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n  * Copyright 2010-2017 JetBrains s.r.o.\n  *\n  * Licensed under the Apache License, Version 2.0 (the \"License\");\n  * you may not use this file except in compliance with the License.\n  * You may obtain a copy of the License at\n  *\n  * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n  *\n  * Unless required by applicable law or agreed to in writing, software\n  * distributed under the License is distributed on an \"AS IS\" BASIS,\n  * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 \"Memory.h\"\n#include \"Natives.h\"\n#include \"Runtime.h\"\n#include \"KString.h\"\n#include \"Types.h\"\n\n#ifdef KONAN_ANDROID\n\n#include <unistd.h>\n#include <pthread.h>\n#include <sys\/types.h>\n#include <sys\/socket.h>\n\n#include \"androidLauncher.h\"\n\n#include <android\/log.h>\n\n#define LOGI(...) ((void)__android_log_print(ANDROID_LOG_INFO, \"Konan_main\", __VA_ARGS__))\n#define LOGE(...) ((void)__android_log_print(ANDROID_LOG_ERROR, \"Konan_main\", __VA_ARGS__))\n\n\/* For debug builds, always enable the debug traces in this library *\/\n#ifndef NDEBUG\n#  define LOGV(...)  ((void)__android_log_print(ANDROID_LOG_VERBOSE, \"Konan_main\", __VA_ARGS__))\n#else\n#  define LOGV(...)  ((void)0)\n#endif\n\n\/\/--- main --------------------------------------------------------------------\/\/\nextern \"C\" KInt Konan_start(const ObjHeader*);\n\nnamespace {\nint pipeC, pipeKonan;\n\nNativeActivityState nativeActivityState;\n}\n\nextern \"C\" void getNativeActivityState(NativeActivityState* state) {\n  state->activity = nativeActivityState.activity;\n  state->savedState = nativeActivityState.savedState;\n  state->savedStateSize = nativeActivityState.savedStateSize;\n  state->looper = nativeActivityState.looper;\n}\n\nextern \"C\" void notifySysEventProcessed() {\n  int8_t message;\n  write(pipeKonan, &message, sizeof(message));\n}\n\nnamespace {\nvoid* entry(void* param) {\n  ALooper* looper = ALooper_prepare(ALOOPER_PREPARE_ALLOW_NON_CALLBACKS);\n  ALooper_addFd(looper, pipeKonan, LOOPER_ID_SYS, ALOOPER_EVENT_INPUT, NULL, NULL);\n  nativeActivityState.looper = looper;\n\n  RuntimeState* state = InitRuntime();\n\n  if (state == nullptr) {\n    LOGE(\"Unable to init runtime\\n\");\n    return nullptr;\n  }\n\n  KInt exitStatus;\n  {\n    ObjHolder args;\n    AllocArrayInstance(theArrayTypeInfo, 0, args.slot());\n    exitStatus = Konan_start(args.obj());\n  }\n\n  DeinitRuntime(state);\n  return nullptr;\n}\n\nvoid runKonan_start() {\n  int pipes[2];\n  if (socketpair(AF_UNIX, SOCK_STREAM, 0, pipes)) {\n    LOGE(\"Could not create pipe: %s\", strerror(errno));\n    return;\n  }\n  pipeC = pipes[0];\n  pipeKonan = pipes[1];\n\n  pthread_attr_t attr;\n  pthread_attr_init(&attr);\n  pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_DETACHED);\n  pthread_t thread;\n  pthread_create(&thread, &attr, entry, nullptr);\n}\n\nvoid putEventSynchronously(void* event) {\n  auto value = reinterpret_cast<uintptr_t>(event);\n  if (write(pipeC, &value, sizeof(value)) != sizeof(value)) {\n    LOGE(\"Failure writing event: %s\\n\", strerror(errno));\n  }\n  int8_t response;\n  if (read(pipeC, &response, sizeof(response)) != sizeof(response)) {\n    LOGE(\"Failure reading response: %s\\n\", strerror(errno));\n  }\n}\n\nvoid onDestroy(ANativeActivity* activity) {\n  LOGV(\"onDestroy called\");\n  NativeActivityEvent event = { DESTROY };\n  putEventSynchronously(&event);\n}\n\nvoid onStart(ANativeActivity* activity) {\n  LOGV(\"onStart called\");\n  NativeActivityEvent event = { START };\n  putEventSynchronously(&event);\n}\n\nvoid onResume(ANativeActivity* activity) {\n  LOGV(\"onResume called\");\n  NativeActivitySaveStateEvent event = { RESUME };\n  putEventSynchronously(&event);\n}\n\nvoid* onSaveInstanceState(ANativeActivity* activity, size_t* outLen) {\n  LOGV(\"onSaveInstanceState called\");\n  NativeActivitySaveStateEvent event = { SAVE_INSTANCE_STATE };\n  putEventSynchronously(&event);\n  *outLen = event.savedStateSize;\n  return event.savedState;\n}\n\nvoid onPause(ANativeActivity* activity) {\n  LOGV(\"onPause called\");\n  NativeActivityEvent event = { PAUSE };\n  putEventSynchronously(&event);\n}\n\nvoid onStop(ANativeActivity* activity) {\n  LOGV(\"onStop called\");\n  NativeActivityEvent event = { STOP };\n  putEventSynchronously(&event);\n}\n\nvoid onConfigurationChanged(ANativeActivity* activity) {\n  LOGV(\"onConfigurationChanged called\");\n  NativeActivityEvent event = { CONFIGURATION_CHANGED };\n  putEventSynchronously(&event);\n}\n\nvoid onLowMemory(ANativeActivity* activity) {\n  LOGV(\"onLowMemory called\");\n  NativeActivityEvent event = { LOW_MEMORY };\n  putEventSynchronously(&event);\n}\n\nvoid onWindowFocusChanged(ANativeActivity* activity, int focused) {\n  LOGV(\"onWindowFocusChanged called\");\n  NativeActivityEvent event = { focused ? WINDOW_GAINED_FOCUS : WINDOW_LOST_FOCUS };\n  putEventSynchronously(&event);\n}\n\nvoid onNativeWindowCreated(ANativeActivity* activity, ANativeWindow* window) {\n  LOGV(\"onNativeWindowCreated called\");\n  NativeActivityWindowEvent event = { NATIVE_WINDOW_CREATED, window };\n  putEventSynchronously(&event);\n}\n\nvoid onNativeWindowDestroyed(ANativeActivity* activity, ANativeWindow* window) {\n  LOGV(\"onNativeWindowDestroyed called\");\n  NativeActivityWindowEvent event = { NATIVE_WINDOW_DESTROYED, window };\n  putEventSynchronously(&event);\n}\n\nvoid onInputQueueCreated(ANativeActivity* activity, AInputQueue* queue) {\n  LOGV(\"onInputQueueCreated called\");\n  NativeActivityQueueEvent event = { INPUT_QUEUE_CREATED, queue };\n  putEventSynchronously(&event);\n}\n\nvoid onInputQueueDestroyed(ANativeActivity* activity, AInputQueue* queue) {\n  LOGV(\"onInputQueueDestroyed called\");\n  NativeActivityQueueEvent event = { INPUT_QUEUE_DESTROYED, queue };\n  putEventSynchronously(&event);\n}\n}\n\nextern \"C\" void Konan_main(ANativeActivity* activity, void* savedState, size_t savedStateSize) {\n  nativeActivityState = {activity, savedState, savedStateSize};\n\n  activity->callbacks->onDestroy = onDestroy;\n  activity->callbacks->onStart = onStart;\n  activity->callbacks->onResume = onResume;\n  activity->callbacks->onSaveInstanceState = onSaveInstanceState;\n  activity->callbacks->onPause = onPause;\n  activity->callbacks->onStop = onStop;\n  activity->callbacks->onConfigurationChanged = onConfigurationChanged;\n  activity->callbacks->onLowMemory = onLowMemory;\n  activity->callbacks->onWindowFocusChanged = onWindowFocusChanged;\n  activity->callbacks->onNativeWindowCreated = onNativeWindowCreated;\n  activity->callbacks->onNativeWindowDestroyed = onNativeWindowDestroyed;\n  activity->callbacks->onInputQueueCreated = onInputQueueCreated;\n  activity->callbacks->onInputQueueDestroyed = onInputQueueDestroyed;\n\n  runKonan_start();\n}\n\n#endif \/\/ KONAN_ANDROID<commit_msg>Exclude entry point from DCE on Android<commit_after>\/*\n  * Copyright 2010-2017 JetBrains s.r.o.\n  *\n  * Licensed under the Apache License, Version 2.0 (the \"License\");\n  * you may not use this file except in compliance with the License.\n  * You may obtain a copy of the License at\n  *\n  * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n  *\n  * Unless required by applicable law or agreed to in writing, software\n  * distributed under the License is distributed on an \"AS IS\" BASIS,\n  * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 \"Memory.h\"\n#include \"Natives.h\"\n#include \"Runtime.h\"\n#include \"KString.h\"\n#include \"Types.h\"\n\n#ifdef KONAN_ANDROID\n\n#include <unistd.h>\n#include <pthread.h>\n#include <sys\/types.h>\n#include <sys\/socket.h>\n\n#include \"androidLauncher.h\"\n\n#include <android\/log.h>\n\n#define LOGI(...) ((void)__android_log_print(ANDROID_LOG_INFO, \"Konan_main\", __VA_ARGS__))\n#define LOGE(...) ((void)__android_log_print(ANDROID_LOG_ERROR, \"Konan_main\", __VA_ARGS__))\n\n\/* For debug builds, always enable the debug traces in this library *\/\n#ifndef NDEBUG\n#  define LOGV(...)  ((void)__android_log_print(ANDROID_LOG_VERBOSE, \"Konan_main\", __VA_ARGS__))\n#else\n#  define LOGV(...)  ((void)0)\n#endif\n\n\/\/--- main --------------------------------------------------------------------\/\/\nextern \"C\" KInt Konan_start(const ObjHeader*);\n\nnamespace {\nint pipeC, pipeKonan;\n\nNativeActivityState nativeActivityState;\n}\n\nextern \"C\" void getNativeActivityState(NativeActivityState* state) {\n  state->activity = nativeActivityState.activity;\n  state->savedState = nativeActivityState.savedState;\n  state->savedStateSize = nativeActivityState.savedStateSize;\n  state->looper = nativeActivityState.looper;\n}\n\nextern \"C\" void notifySysEventProcessed() {\n  int8_t message;\n  write(pipeKonan, &message, sizeof(message));\n}\n\nnamespace {\nvoid* entry(void* param) {\n  ALooper* looper = ALooper_prepare(ALOOPER_PREPARE_ALLOW_NON_CALLBACKS);\n  ALooper_addFd(looper, pipeKonan, LOOPER_ID_SYS, ALOOPER_EVENT_INPUT, NULL, NULL);\n  nativeActivityState.looper = looper;\n\n  RuntimeState* state = InitRuntime();\n\n  if (state == nullptr) {\n    LOGE(\"Unable to init runtime\\n\");\n    return nullptr;\n  }\n\n  KInt exitStatus;\n  {\n    ObjHolder args;\n    AllocArrayInstance(theArrayTypeInfo, 0, args.slot());\n    exitStatus = Konan_start(args.obj());\n  }\n\n  DeinitRuntime(state);\n  return nullptr;\n}\n\nvoid runKonan_start() {\n  int pipes[2];\n  if (socketpair(AF_UNIX, SOCK_STREAM, 0, pipes)) {\n    LOGE(\"Could not create pipe: %s\", strerror(errno));\n    return;\n  }\n  pipeC = pipes[0];\n  pipeKonan = pipes[1];\n\n  pthread_attr_t attr;\n  pthread_attr_init(&attr);\n  pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_DETACHED);\n  pthread_t thread;\n  pthread_create(&thread, &attr, entry, nullptr);\n}\n\nvoid putEventSynchronously(void* event) {\n  auto value = reinterpret_cast<uintptr_t>(event);\n  if (write(pipeC, &value, sizeof(value)) != sizeof(value)) {\n    LOGE(\"Failure writing event: %s\\n\", strerror(errno));\n  }\n  int8_t response;\n  if (read(pipeC, &response, sizeof(response)) != sizeof(response)) {\n    LOGE(\"Failure reading response: %s\\n\", strerror(errno));\n  }\n}\n\nvoid onDestroy(ANativeActivity* activity) {\n  LOGV(\"onDestroy called\");\n  NativeActivityEvent event = { DESTROY };\n  putEventSynchronously(&event);\n}\n\nvoid onStart(ANativeActivity* activity) {\n  LOGV(\"onStart called\");\n  NativeActivityEvent event = { START };\n  putEventSynchronously(&event);\n}\n\nvoid onResume(ANativeActivity* activity) {\n  LOGV(\"onResume called\");\n  NativeActivitySaveStateEvent event = { RESUME };\n  putEventSynchronously(&event);\n}\n\nvoid* onSaveInstanceState(ANativeActivity* activity, size_t* outLen) {\n  LOGV(\"onSaveInstanceState called\");\n  NativeActivitySaveStateEvent event = { SAVE_INSTANCE_STATE };\n  putEventSynchronously(&event);\n  *outLen = event.savedStateSize;\n  return event.savedState;\n}\n\nvoid onPause(ANativeActivity* activity) {\n  LOGV(\"onPause called\");\n  NativeActivityEvent event = { PAUSE };\n  putEventSynchronously(&event);\n}\n\nvoid onStop(ANativeActivity* activity) {\n  LOGV(\"onStop called\");\n  NativeActivityEvent event = { STOP };\n  putEventSynchronously(&event);\n}\n\nvoid onConfigurationChanged(ANativeActivity* activity) {\n  LOGV(\"onConfigurationChanged called\");\n  NativeActivityEvent event = { CONFIGURATION_CHANGED };\n  putEventSynchronously(&event);\n}\n\nvoid onLowMemory(ANativeActivity* activity) {\n  LOGV(\"onLowMemory called\");\n  NativeActivityEvent event = { LOW_MEMORY };\n  putEventSynchronously(&event);\n}\n\nvoid onWindowFocusChanged(ANativeActivity* activity, int focused) {\n  LOGV(\"onWindowFocusChanged called\");\n  NativeActivityEvent event = { focused ? WINDOW_GAINED_FOCUS : WINDOW_LOST_FOCUS };\n  putEventSynchronously(&event);\n}\n\nvoid onNativeWindowCreated(ANativeActivity* activity, ANativeWindow* window) {\n  LOGV(\"onNativeWindowCreated called\");\n  NativeActivityWindowEvent event = { NATIVE_WINDOW_CREATED, window };\n  putEventSynchronously(&event);\n}\n\nvoid onNativeWindowDestroyed(ANativeActivity* activity, ANativeWindow* window) {\n  LOGV(\"onNativeWindowDestroyed called\");\n  NativeActivityWindowEvent event = { NATIVE_WINDOW_DESTROYED, window };\n  putEventSynchronously(&event);\n}\n\nvoid onInputQueueCreated(ANativeActivity* activity, AInputQueue* queue) {\n  LOGV(\"onInputQueueCreated called\");\n  NativeActivityQueueEvent event = { INPUT_QUEUE_CREATED, queue };\n  putEventSynchronously(&event);\n}\n\nvoid onInputQueueDestroyed(ANativeActivity* activity, AInputQueue* queue) {\n  LOGV(\"onInputQueueDestroyed called\");\n  NativeActivityQueueEvent event = { INPUT_QUEUE_DESTROYED, queue };\n  putEventSynchronously(&event);\n}\n}\n\nextern \"C\" void RUNTIME_USED Konan_main(\n    ANativeActivity* activity, void* savedState, size_t savedStateSize) {\n  nativeActivityState = {activity, savedState, savedStateSize};\n\n  activity->callbacks->onDestroy = onDestroy;\n  activity->callbacks->onStart = onStart;\n  activity->callbacks->onResume = onResume;\n  activity->callbacks->onSaveInstanceState = onSaveInstanceState;\n  activity->callbacks->onPause = onPause;\n  activity->callbacks->onStop = onStop;\n  activity->callbacks->onConfigurationChanged = onConfigurationChanged;\n  activity->callbacks->onLowMemory = onLowMemory;\n  activity->callbacks->onWindowFocusChanged = onWindowFocusChanged;\n  activity->callbacks->onNativeWindowCreated = onNativeWindowCreated;\n  activity->callbacks->onNativeWindowDestroyed = onNativeWindowDestroyed;\n  activity->callbacks->onInputQueueCreated = onInputQueueCreated;\n  activity->callbacks->onInputQueueDestroyed = onInputQueueDestroyed;\n\n  runKonan_start();\n}\n\n#endif \/\/ KONAN_ANDROID\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_path.h\"\n#include \"base\/file_util.h\"\n#include \"base\/path_service.h\"\n#include \"base\/string_util.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n#include \"v8\/include\/v8.h\"\n#include \"webkit\/glue\/webkit_glue.h\"\n#include \"webkit\/tools\/test_shell\/test_shell.h\"\n#include \"webkit\/tools\/test_shell\/test_shell_test.h\"\n\nstatic const char kHeapSampleBegin[] = \"heap-sample-begin,\";\nstatic const char kHeapObjectLogEntryPrefix[] = \"\\nheap-js-cons-item,\";\nstatic const char kHeapObjectLogEntrySuffix[] = \",\";\n\nclass ListenerLeakTest : public TestShellTest {\n};\n\nstatic std::string GetV8Log(int skip) {\n  std::string v8_log;\n  char buf[1024];\n  int read_size;\n  do {\n    read_size = v8::V8::GetLogLines(skip + static_cast<int>(v8_log.size()),\n                                    buf, sizeof(buf));\n    v8_log.append(buf, read_size);\n  } while (read_size > 0);\n  return v8_log;\n}\n\nstatic int GetNumObjects(int log_skip, const std::string& constructor) {\n  std::string v8_log = GetV8Log(log_skip);\n  size_t sample_begin = v8_log.rfind(kHeapSampleBegin);\n  CHECK(sample_begin != std::string::npos);\n  std::string log_entry =\n      kHeapObjectLogEntryPrefix + constructor + kHeapObjectLogEntrySuffix;\n  size_t i = v8_log.find(log_entry, sample_begin);\n  if (i == std::string::npos) return 0;\n  i += log_entry.size();\n  size_t j = v8_log.find(\",\", i);\n  CHECK(j != std::string::npos);\n  int num_objects;\n  CHECK(StringToInt(v8_log.substr(i, j - i), &num_objects));\n  return num_objects;\n}\n\n\/\/ This test tries to create a reference cycle between node and its listener.\n\/\/ See http:\/\/crbug\/17400.\nTEST_F(ListenerLeakTest, ReferenceCycle) {\n  const int log_skip = static_cast<int>(GetV8Log(0).size());\n  FilePath listener_file;\n  ASSERT_TRUE(PathService::Get(base::DIR_SOURCE_ROOT, &listener_file));\n  listener_file = listener_file.Append(FILE_PATH_LITERAL(\"webkit\"))\n      .Append(FILE_PATH_LITERAL(\"data\"))\n      .Append(FILE_PATH_LITERAL(\"listener\"))\n      .Append(FILE_PATH_LITERAL(\"listener_leak1.html\"));\n  test_shell_->LoadURL(listener_file.ToWStringHack().c_str());\n  test_shell_->WaitTestFinished();\n  ASSERT_EQ(0, GetNumObjects(log_skip, \"EventListenerLeakTestObject1\"));\n}\n\n\/\/ This test sets node onclick many times to expose a possible memory\n\/\/ leak where all listeners get referenced by the node.\nTEST_F(ListenerLeakTest, HiddenReferences) {\n  const int log_skip = static_cast<int>(GetV8Log(0).size());\n  FilePath listener_file;\n  ASSERT_TRUE(PathService::Get(base::DIR_SOURCE_ROOT, &listener_file));\n  listener_file = listener_file.Append(FILE_PATH_LITERAL(\"webkit\"))\n      .Append(FILE_PATH_LITERAL(\"data\"))\n      .Append(FILE_PATH_LITERAL(\"listener\"))\n      .Append(FILE_PATH_LITERAL(\"listener_leak2.html\"));\n  test_shell_->LoadURL(listener_file.ToWStringHack().c_str());\n  test_shell_->WaitTestFinished();\n  ASSERT_EQ(1, GetNumObjects(log_skip, \"EventListenerLeakTestObject2\"));\n}\n<commit_msg>Added regression test for event listeners memory leak.<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_path.h\"\n#include \"base\/file_util.h\"\n#include \"base\/path_service.h\"\n#include \"base\/string_util.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n#include \"v8\/include\/v8.h\"\n#include \"webkit\/glue\/webkit_glue.h\"\n#include \"webkit\/tools\/test_shell\/test_shell.h\"\n#include \"webkit\/tools\/test_shell\/test_shell_test.h\"\n\nstatic const char kHeapSampleBegin[] = \"heap-sample-begin,\";\nstatic const char kHeapObjectLogEntryPrefix[] = \"\\nheap-js-cons-item,\";\nstatic const char kHeapObjectLogEntrySuffix[] = \",\";\n\nclass ListenerLeakTest : public TestShellTest {\n};\n\nstatic std::string GetV8Log(int skip) {\n  std::string v8_log;\n  char buf[1024];\n  int read_size;\n  do {\n    read_size = v8::V8::GetLogLines(skip + static_cast<int>(v8_log.size()),\n                                    buf, sizeof(buf));\n    v8_log.append(buf, read_size);\n  } while (read_size > 0);\n  return v8_log;\n}\n\nstatic int GetNumObjects(int log_skip, const std::string& constructor) {\n  std::string v8_log = GetV8Log(log_skip);\n  size_t sample_begin = v8_log.rfind(kHeapSampleBegin);\n  CHECK(sample_begin != std::string::npos);\n  std::string log_entry =\n      kHeapObjectLogEntryPrefix + constructor + kHeapObjectLogEntrySuffix;\n  size_t i = v8_log.find(log_entry, sample_begin);\n  if (i == std::string::npos) return 0;\n  i += log_entry.size();\n  size_t j = v8_log.find(\",\", i);\n  CHECK(j != std::string::npos);\n  int num_objects;\n  CHECK(StringToInt(v8_log.substr(i, j - i), &num_objects));\n  return num_objects;\n}\n\n\/\/ This test tries to create a reference cycle between node and its listener.\n\/\/ See http:\/\/crbug\/17400.\nTEST_F(ListenerLeakTest, ReferenceCycle) {\n  const int log_skip = static_cast<int>(GetV8Log(0).size());\n  FilePath listener_file;\n  ASSERT_TRUE(PathService::Get(base::DIR_SOURCE_ROOT, &listener_file));\n  listener_file = listener_file.Append(FILE_PATH_LITERAL(\"webkit\"))\n      .Append(FILE_PATH_LITERAL(\"data\"))\n      .Append(FILE_PATH_LITERAL(\"listener\"))\n      .Append(FILE_PATH_LITERAL(\"listener_leak1.html\"));\n  test_shell_->LoadURL(listener_file.ToWStringHack().c_str());\n  test_shell_->WaitTestFinished();\n  ASSERT_EQ(0, GetNumObjects(log_skip, \"EventListenerLeakTestObject1\"));\n}\n\n\/\/ This test sets node onclick many times to expose a possible memory\n\/\/ leak where all listeners get referenced by the node.\nTEST_F(ListenerLeakTest, HiddenReferences) {\n  const int log_skip = static_cast<int>(GetV8Log(0).size());\n  FilePath listener_file;\n  ASSERT_TRUE(PathService::Get(base::DIR_SOURCE_ROOT, &listener_file));\n  listener_file = listener_file.Append(FILE_PATH_LITERAL(\"webkit\"))\n      .Append(FILE_PATH_LITERAL(\"data\"))\n      .Append(FILE_PATH_LITERAL(\"listener\"))\n      .Append(FILE_PATH_LITERAL(\"listener_leak2.html\"));\n  test_shell_->LoadURL(listener_file.ToWStringHack().c_str());\n  test_shell_->WaitTestFinished();\n  ASSERT_EQ(1, GetNumObjects(log_skip, \"EventListenerLeakTestObject2\"));\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\/extensions\/extension_install_ui.h\"\n\n#include <map>\n\n#include \"app\/l10n_util.h\"\n#include \"app\/resource_bundle.h\"\n#include \"base\/command_line.h\"\n#include \"base\/file_util.h\"\n#include \"base\/i18n\/rtl.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\/browser_list.h\"\n#include \"chrome\/browser\/browser_window.h\"\n#include \"chrome\/browser\/extensions\/theme_installed_infobar_delegate.h\"\n#include \"chrome\/browser\/platform_util.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/browser\/tabs\/tab_strip_model.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/extensions\/extension.h\"\n#include \"chrome\/common\/extensions\/extension_action.h\"\n#include \"chrome\/common\/extensions\/extension_icon_set.h\"\n#include \"chrome\/common\/extensions\/extension_resource.h\"\n#include \"chrome\/common\/extensions\/url_pattern.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"grit\/chromium_strings.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/theme_resources.h\"\n\n#if defined(OS_MACOSX)\n#include \"chrome\/browser\/ui\/cocoa\/extension_installed_bubble_bridge.h\"\n#endif\n\n#if defined(TOOLKIT_VIEWS)\n#include \"chrome\/browser\/views\/extensions\/extension_installed_bubble.h\"\n#endif\n\n#if defined(TOOLKIT_GTK)\n#include \"chrome\/browser\/extensions\/gtk_theme_installed_infobar_delegate.h\"\n#include \"chrome\/browser\/gtk\/extension_installed_bubble_gtk.h\"\n#include \"chrome\/browser\/gtk\/gtk_theme_provider.h\"\n#endif\n\n\/\/ static\nconst int ExtensionInstallUI::kTitleIds[NUM_PROMPT_TYPES] = {\n  IDS_EXTENSION_INSTALL_PROMPT_TITLE,\n  IDS_EXTENSION_UNINSTALL_PROMPT_TITLE\n};\n\/\/ static\nconst int ExtensionInstallUI::kHeadingIds[NUM_PROMPT_TYPES] = {\n  IDS_EXTENSION_INSTALL_PROMPT_HEADING,\n  IDS_EXTENSION_UNINSTALL_PROMPT_HEADING\n};\n\/\/ static\nconst int ExtensionInstallUI::kButtonIds[NUM_PROMPT_TYPES] = {\n  IDS_EXTENSION_PROMPT_INSTALL_BUTTON,\n  IDS_EXTENSION_PROMPT_UNINSTALL_BUTTON\n};\n\nnamespace {\n\n\/\/ Size of extension icon in top left of dialog.\nconst int kIconSize = 69;\n\n}  \/\/ namespace\n\nExtensionInstallUI::ExtensionInstallUI(Profile* profile)\n    : profile_(profile),\n      ui_loop_(MessageLoop::current()),\n      previous_use_system_theme_(false),\n      extension_(NULL),\n      delegate_(NULL),\n      prompt_type_(NUM_PROMPT_TYPES),\n      ALLOW_THIS_IN_INITIALIZER_LIST(tracker_(this)) {}\n\nExtensionInstallUI::~ExtensionInstallUI() {\n}\n\nvoid ExtensionInstallUI::ConfirmInstall(Delegate* delegate,\n                                        const Extension* extension) {\n  DCHECK(ui_loop_ == MessageLoop::current());\n  extension_ = extension;\n  delegate_ = delegate;\n\n  \/\/ We special-case themes to not show any confirm UI. Instead they are\n  \/\/ immediately installed, and then we show an infobar (see OnInstallSuccess)\n  \/\/ to allow the user to revert if they don't like it.\n  if (extension->is_theme()) {\n    \/\/ Remember the current theme in case the user pressed undo.\n    const Extension* previous_theme = profile_->GetTheme();\n    if (previous_theme)\n      previous_theme_id_ = previous_theme->id();\n\n#if defined(TOOLKIT_GTK)\n    \/\/ On Linux, we also need to take the user's system settings into account\n    \/\/ to undo theme installation.\n    previous_use_system_theme_ =\n        GtkThemeProvider::GetFrom(profile_)->UseGtkTheme();\n#else\n    DCHECK(!previous_use_system_theme_);\n#endif\n\n    delegate->InstallUIProceed();\n    return;\n  }\n\n  ShowConfirmation(INSTALL_PROMPT);\n}\n\nvoid ExtensionInstallUI::ConfirmUninstall(Delegate* delegate,\n                                          const Extension* extension) {\n  DCHECK(ui_loop_ == MessageLoop::current());\n  extension_ = extension;\n  delegate_ = delegate;\n\n  ShowConfirmation(UNINSTALL_PROMPT);\n}\n\nvoid ExtensionInstallUI::OnInstallSuccess(const Extension* extension,\n                                          SkBitmap* icon) {\n  extension_ = extension;\n  SetIcon(icon);\n\n  if (extension->is_theme()) {\n    ShowThemeInfoBar(previous_theme_id_, previous_use_system_theme_,\n                     extension, profile_);\n    return;\n  }\n\n  \/\/ Note that browser actions don't appear in incognito mode initially,\n  \/\/ so be sure to use a normal browser window.\n  Profile* profile = profile_;\n  if (extension->browser_action())\n    profile = profile->GetOriginalProfile();\n  Browser* browser = Browser::GetOrCreateTabbedBrowser(profile);\n  if (browser->tab_count() == 0)\n    browser->AddBlankTab(true);\n  browser->window()->Show();\n\n  if (extension->GetFullLaunchURL().is_valid()) {\n    std::string hash_params = \"app-id=\";\n    hash_params += extension->id();\n\n    std::string url(chrome::kChromeUINewTabURL);\n    url += \"\/#\";\n    url += hash_params;\n    browser->AddSelectedTabWithURL(GURL(url), PageTransition::TYPED);\n\n    return;\n  }\n\n#if defined(TOOLKIT_VIEWS)\n  ExtensionInstalledBubble::Show(extension, browser, icon_);\n#elif defined(OS_MACOSX)\n  if ((extension->browser_action()) || !extension->omnibox_keyword().empty() ||\n      (extension->page_action() &&\n      !extension->page_action()->default_icon_path().empty())) {\n    ExtensionInstalledBubbleCocoa::ShowExtensionInstalledBubble(\n        browser->window()->GetNativeHandle(),\n        extension, browser, icon_);\n  } else {\n    \/\/ If the extension is of type GENERIC, meaning it doesn't have a UI\n    \/\/ surface to display for this window, launch infobar instead of popup\n    \/\/ bubble, because we have no guaranteed wrench menu button to point to.\n    ShowGenericExtensionInstalledInfoBar(extension);\n  }\n#elif defined(TOOLKIT_GTK)\n  ExtensionInstalledBubbleGtk::Show(extension, browser, icon_);\n#endif  \/\/ TOOLKIT_VIEWS\n}\n\nvoid ExtensionInstallUI::OnInstallFailure(const std::string& error) {\n  DCHECK(ui_loop_ == MessageLoop::current());\n\n  Browser* browser = BrowserList::GetLastActiveWithProfile(profile_);\n  platform_util::SimpleErrorBox(\n      browser ? browser->window()->GetNativeHandle() : NULL,\n      l10n_util::GetStringUTF16(IDS_EXTENSION_INSTALL_FAILURE_TITLE),\n      UTF8ToUTF16(error));\n}\n\nvoid ExtensionInstallUI::SetIcon(SkBitmap* image) {\n  if (image)\n    icon_ = *image;\n  else\n    icon_ = SkBitmap();\n  if (icon_.empty()) {\n    if (extension_->is_app()) {\n      icon_ = *ResourceBundle::GetSharedInstance().GetBitmapNamed(\n          IDR_APP_DEFAULT_ICON);\n    } else {\n      icon_ = *ResourceBundle::GetSharedInstance().GetBitmapNamed(\n          IDR_EXTENSION_DEFAULT_ICON);\n    }\n  }\n}\n\nvoid ExtensionInstallUI::OnImageLoaded(\n    SkBitmap* image, ExtensionResource resource, int index) {\n  SetIcon(image);\n\n  switch (prompt_type_) {\n    case INSTALL_PROMPT: {\n      \/\/ TODO(jcivelli): http:\/\/crbug.com\/44771 We should not show an install\n      \/\/                 dialog when installing an app from the gallery.\n      NotificationService* service = NotificationService::current();\n      service->Notify(NotificationType::EXTENSION_WILL_SHOW_CONFIRM_DIALOG,\n          Source<ExtensionInstallUI>(this),\n          NotificationService::NoDetails());\n\n      std::vector<string16> warnings = extension_->GetPermissionMessages();\n      ShowExtensionInstallUIPrompt2Impl(profile_, delegate_, extension_, &icon_,\n                                        warnings);\n      break;\n    }\n    case UNINSTALL_PROMPT: {\n      ShowExtensionInstallUIPromptImpl(profile_, delegate_, extension_, &icon_,\n                                       UNINSTALL_PROMPT);\n      break;\n    }\n    default:\n      NOTREACHED() << \"Unknown message\";\n      break;\n  }\n}\n\nvoid ExtensionInstallUI::ShowThemeInfoBar(\n    const std::string& previous_theme_id, bool previous_use_system_theme,\n    const Extension* new_theme, Profile* profile) {\n  if (!new_theme->is_theme())\n    return;\n\n  \/\/ Get last active normal browser of profile.\n  Browser* browser = BrowserList::FindBrowserWithType(profile,\n                                                      Browser::TYPE_NORMAL,\n                                                      true);\n  if (!browser)\n    return;\n\n  TabContents* tab_contents = browser->GetSelectedTabContents();\n  if (!tab_contents)\n    return;\n\n  \/\/ First find any previous theme preview infobars.\n  InfoBarDelegate* old_delegate = NULL;\n  for (int i = 0; i < tab_contents->infobar_delegate_count(); ++i) {\n    InfoBarDelegate* delegate = tab_contents->GetInfoBarDelegateAt(i);\n    ThemeInstalledInfoBarDelegate* theme_infobar =\n        delegate->AsThemePreviewInfobarDelegate();\n    if (theme_infobar) {\n      \/\/ If the user installed the same theme twice, ignore the second install\n      \/\/ and keep the first install info bar, so that they can easily undo to\n      \/\/ get back the previous theme.\n      if (theme_infobar->MatchesTheme(new_theme))\n        return;\n      old_delegate = delegate;\n      break;\n    }\n  }\n\n  \/\/ Then either replace that old one or add a new one.\n  InfoBarDelegate* new_delegate =\n      GetNewThemeInstalledInfoBarDelegate(\n          tab_contents, new_theme,\n          previous_theme_id, previous_use_system_theme);\n\n  if (old_delegate)\n    tab_contents->ReplaceInfoBar(old_delegate, new_delegate);\n  else\n    tab_contents->AddInfoBar(new_delegate);\n}\n\nvoid ExtensionInstallUI::ShowConfirmation(PromptType prompt_type) {\n  \/\/ Load the image asynchronously. For the response, check OnImageLoaded.\n  prompt_type_ = prompt_type;\n  ExtensionResource image =\n      extension_->GetIconResource(Extension::EXTENSION_ICON_LARGE,\n                                  ExtensionIconSet::MATCH_EXACTLY);\n  tracker_.LoadImage(extension_, image,\n                     gfx::Size(kIconSize, kIconSize),\n                     ImageLoadingTracker::DONT_CACHE);\n}\n\n#if defined(OS_MACOSX)\nvoid ExtensionInstallUI::ShowGenericExtensionInstalledInfoBar(\n    const Extension* new_extension) {\n  Browser* browser = BrowserList::GetLastActiveWithProfile(profile_);\n  if (!browser)\n    return;\n\n  TabContents* tab_contents = browser->GetSelectedTabContents();\n  if (!tab_contents)\n    return;\n\n  string16 extension_name = UTF8ToUTF16(new_extension->name());\n  base::i18n::AdjustStringForLocaleDirection(&extension_name);\n  string16 msg =\n      l10n_util::GetStringFUTF16(IDS_EXTENSION_INSTALLED_HEADING,\n                                 extension_name) +\n      UTF8ToUTF16(\" \") +\n      l10n_util::GetStringUTF16(IDS_EXTENSION_INSTALLED_MANAGE_INFO_MAC);\n  InfoBarDelegate* delegate = new SimpleAlertInfoBarDelegate(\n      tab_contents, msg, new SkBitmap(icon_), true);\n  tab_contents->AddInfoBar(delegate);\n}\n#endif\n\nInfoBarDelegate* ExtensionInstallUI::GetNewThemeInstalledInfoBarDelegate(\n    TabContents* tab_contents, const Extension* new_theme,\n    const std::string& previous_theme_id, bool previous_use_system_theme) {\n#if defined(TOOLKIT_GTK)\n  return new GtkThemeInstalledInfoBarDelegate(tab_contents, new_theme,\n      previous_theme_id, previous_use_system_theme);\n#else\n  return new ThemeInstalledInfoBarDelegate(tab_contents, new_theme,\n      previous_theme_id);\n#endif\n}\n<commit_msg>Confirm all extension and app installs in a normal window, even if they were installed in an incognito 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\/extensions\/extension_install_ui.h\"\n\n#include <map>\n\n#include \"app\/l10n_util.h\"\n#include \"app\/resource_bundle.h\"\n#include \"base\/command_line.h\"\n#include \"base\/file_util.h\"\n#include \"base\/i18n\/rtl.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\/browser_list.h\"\n#include \"chrome\/browser\/browser_window.h\"\n#include \"chrome\/browser\/extensions\/theme_installed_infobar_delegate.h\"\n#include \"chrome\/browser\/platform_util.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/browser\/tabs\/tab_strip_model.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/extensions\/extension.h\"\n#include \"chrome\/common\/extensions\/extension_action.h\"\n#include \"chrome\/common\/extensions\/extension_icon_set.h\"\n#include \"chrome\/common\/extensions\/extension_resource.h\"\n#include \"chrome\/common\/extensions\/url_pattern.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"grit\/chromium_strings.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/theme_resources.h\"\n\n#if defined(OS_MACOSX)\n#include \"chrome\/browser\/ui\/cocoa\/extension_installed_bubble_bridge.h\"\n#endif\n\n#if defined(TOOLKIT_VIEWS)\n#include \"chrome\/browser\/views\/extensions\/extension_installed_bubble.h\"\n#endif\n\n#if defined(TOOLKIT_GTK)\n#include \"chrome\/browser\/extensions\/gtk_theme_installed_infobar_delegate.h\"\n#include \"chrome\/browser\/gtk\/extension_installed_bubble_gtk.h\"\n#include \"chrome\/browser\/gtk\/gtk_theme_provider.h\"\n#endif\n\n\/\/ static\nconst int ExtensionInstallUI::kTitleIds[NUM_PROMPT_TYPES] = {\n  IDS_EXTENSION_INSTALL_PROMPT_TITLE,\n  IDS_EXTENSION_UNINSTALL_PROMPT_TITLE\n};\n\/\/ static\nconst int ExtensionInstallUI::kHeadingIds[NUM_PROMPT_TYPES] = {\n  IDS_EXTENSION_INSTALL_PROMPT_HEADING,\n  IDS_EXTENSION_UNINSTALL_PROMPT_HEADING\n};\n\/\/ static\nconst int ExtensionInstallUI::kButtonIds[NUM_PROMPT_TYPES] = {\n  IDS_EXTENSION_PROMPT_INSTALL_BUTTON,\n  IDS_EXTENSION_PROMPT_UNINSTALL_BUTTON\n};\n\nnamespace {\n\n\/\/ Size of extension icon in top left of dialog.\nconst int kIconSize = 69;\n\n}  \/\/ namespace\n\nExtensionInstallUI::ExtensionInstallUI(Profile* profile)\n    : profile_(profile),\n      ui_loop_(MessageLoop::current()),\n      previous_use_system_theme_(false),\n      extension_(NULL),\n      delegate_(NULL),\n      prompt_type_(NUM_PROMPT_TYPES),\n      ALLOW_THIS_IN_INITIALIZER_LIST(tracker_(this)) {}\n\nExtensionInstallUI::~ExtensionInstallUI() {\n}\n\nvoid ExtensionInstallUI::ConfirmInstall(Delegate* delegate,\n                                        const Extension* extension) {\n  DCHECK(ui_loop_ == MessageLoop::current());\n  extension_ = extension;\n  delegate_ = delegate;\n\n  \/\/ We special-case themes to not show any confirm UI. Instead they are\n  \/\/ immediately installed, and then we show an infobar (see OnInstallSuccess)\n  \/\/ to allow the user to revert if they don't like it.\n  if (extension->is_theme()) {\n    \/\/ Remember the current theme in case the user pressed undo.\n    const Extension* previous_theme = profile_->GetTheme();\n    if (previous_theme)\n      previous_theme_id_ = previous_theme->id();\n\n#if defined(TOOLKIT_GTK)\n    \/\/ On Linux, we also need to take the user's system settings into account\n    \/\/ to undo theme installation.\n    previous_use_system_theme_ =\n        GtkThemeProvider::GetFrom(profile_)->UseGtkTheme();\n#else\n    DCHECK(!previous_use_system_theme_);\n#endif\n\n    delegate->InstallUIProceed();\n    return;\n  }\n\n  ShowConfirmation(INSTALL_PROMPT);\n}\n\nvoid ExtensionInstallUI::ConfirmUninstall(Delegate* delegate,\n                                          const Extension* extension) {\n  DCHECK(ui_loop_ == MessageLoop::current());\n  extension_ = extension;\n  delegate_ = delegate;\n\n  ShowConfirmation(UNINSTALL_PROMPT);\n}\n\nvoid ExtensionInstallUI::OnInstallSuccess(const Extension* extension,\n                                          SkBitmap* icon) {\n  extension_ = extension;\n  SetIcon(icon);\n\n  if (extension->is_theme()) {\n    ShowThemeInfoBar(previous_theme_id_, previous_use_system_theme_,\n                     extension, profile_);\n    return;\n  }\n\n  \/\/ Extensions aren't enabled by default in incognito so we confirm\n  \/\/ the install in a normal window.\n  Profile* profile = profile_->GetOriginalProfile();\n  Browser* browser = Browser::GetOrCreateTabbedBrowser(profile);\n  if (browser->tab_count() == 0)\n    browser->AddBlankTab(true);\n  browser->window()->Show();\n\n  if (extension->GetFullLaunchURL().is_valid()) {\n    std::string hash_params = \"app-id=\";\n    hash_params += extension->id();\n\n    std::string url(chrome::kChromeUINewTabURL);\n    url += \"\/#\";\n    url += hash_params;\n    browser->AddSelectedTabWithURL(GURL(url), PageTransition::TYPED);\n\n    return;\n  }\n\n#if defined(TOOLKIT_VIEWS)\n  ExtensionInstalledBubble::Show(extension, browser, icon_);\n#elif defined(OS_MACOSX)\n  if ((extension->browser_action()) || !extension->omnibox_keyword().empty() ||\n      (extension->page_action() &&\n      !extension->page_action()->default_icon_path().empty())) {\n    ExtensionInstalledBubbleCocoa::ShowExtensionInstalledBubble(\n        browser->window()->GetNativeHandle(),\n        extension, browser, icon_);\n  } else {\n    \/\/ If the extension is of type GENERIC, meaning it doesn't have a UI\n    \/\/ surface to display for this window, launch infobar instead of popup\n    \/\/ bubble, because we have no guaranteed wrench menu button to point to.\n    ShowGenericExtensionInstalledInfoBar(extension);\n  }\n#elif defined(TOOLKIT_GTK)\n  ExtensionInstalledBubbleGtk::Show(extension, browser, icon_);\n#endif  \/\/ TOOLKIT_VIEWS\n}\n\nvoid ExtensionInstallUI::OnInstallFailure(const std::string& error) {\n  DCHECK(ui_loop_ == MessageLoop::current());\n\n  Browser* browser = BrowserList::GetLastActiveWithProfile(profile_);\n  platform_util::SimpleErrorBox(\n      browser ? browser->window()->GetNativeHandle() : NULL,\n      l10n_util::GetStringUTF16(IDS_EXTENSION_INSTALL_FAILURE_TITLE),\n      UTF8ToUTF16(error));\n}\n\nvoid ExtensionInstallUI::SetIcon(SkBitmap* image) {\n  if (image)\n    icon_ = *image;\n  else\n    icon_ = SkBitmap();\n  if (icon_.empty()) {\n    if (extension_->is_app()) {\n      icon_ = *ResourceBundle::GetSharedInstance().GetBitmapNamed(\n          IDR_APP_DEFAULT_ICON);\n    } else {\n      icon_ = *ResourceBundle::GetSharedInstance().GetBitmapNamed(\n          IDR_EXTENSION_DEFAULT_ICON);\n    }\n  }\n}\n\nvoid ExtensionInstallUI::OnImageLoaded(\n    SkBitmap* image, ExtensionResource resource, int index) {\n  SetIcon(image);\n\n  switch (prompt_type_) {\n    case INSTALL_PROMPT: {\n      \/\/ TODO(jcivelli): http:\/\/crbug.com\/44771 We should not show an install\n      \/\/                 dialog when installing an app from the gallery.\n      NotificationService* service = NotificationService::current();\n      service->Notify(NotificationType::EXTENSION_WILL_SHOW_CONFIRM_DIALOG,\n          Source<ExtensionInstallUI>(this),\n          NotificationService::NoDetails());\n\n      std::vector<string16> warnings = extension_->GetPermissionMessages();\n      ShowExtensionInstallUIPrompt2Impl(profile_, delegate_, extension_, &icon_,\n                                        warnings);\n      break;\n    }\n    case UNINSTALL_PROMPT: {\n      ShowExtensionInstallUIPromptImpl(profile_, delegate_, extension_, &icon_,\n                                       UNINSTALL_PROMPT);\n      break;\n    }\n    default:\n      NOTREACHED() << \"Unknown message\";\n      break;\n  }\n}\n\nvoid ExtensionInstallUI::ShowThemeInfoBar(\n    const std::string& previous_theme_id, bool previous_use_system_theme,\n    const Extension* new_theme, Profile* profile) {\n  if (!new_theme->is_theme())\n    return;\n\n  \/\/ Get last active normal browser of profile.\n  Browser* browser = BrowserList::FindBrowserWithType(profile,\n                                                      Browser::TYPE_NORMAL,\n                                                      true);\n  if (!browser)\n    return;\n\n  TabContents* tab_contents = browser->GetSelectedTabContents();\n  if (!tab_contents)\n    return;\n\n  \/\/ First find any previous theme preview infobars.\n  InfoBarDelegate* old_delegate = NULL;\n  for (int i = 0; i < tab_contents->infobar_delegate_count(); ++i) {\n    InfoBarDelegate* delegate = tab_contents->GetInfoBarDelegateAt(i);\n    ThemeInstalledInfoBarDelegate* theme_infobar =\n        delegate->AsThemePreviewInfobarDelegate();\n    if (theme_infobar) {\n      \/\/ If the user installed the same theme twice, ignore the second install\n      \/\/ and keep the first install info bar, so that they can easily undo to\n      \/\/ get back the previous theme.\n      if (theme_infobar->MatchesTheme(new_theme))\n        return;\n      old_delegate = delegate;\n      break;\n    }\n  }\n\n  \/\/ Then either replace that old one or add a new one.\n  InfoBarDelegate* new_delegate =\n      GetNewThemeInstalledInfoBarDelegate(\n          tab_contents, new_theme,\n          previous_theme_id, previous_use_system_theme);\n\n  if (old_delegate)\n    tab_contents->ReplaceInfoBar(old_delegate, new_delegate);\n  else\n    tab_contents->AddInfoBar(new_delegate);\n}\n\nvoid ExtensionInstallUI::ShowConfirmation(PromptType prompt_type) {\n  \/\/ Load the image asynchronously. For the response, check OnImageLoaded.\n  prompt_type_ = prompt_type;\n  ExtensionResource image =\n      extension_->GetIconResource(Extension::EXTENSION_ICON_LARGE,\n                                  ExtensionIconSet::MATCH_EXACTLY);\n  tracker_.LoadImage(extension_, image,\n                     gfx::Size(kIconSize, kIconSize),\n                     ImageLoadingTracker::DONT_CACHE);\n}\n\n#if defined(OS_MACOSX)\nvoid ExtensionInstallUI::ShowGenericExtensionInstalledInfoBar(\n    const Extension* new_extension) {\n  Browser* browser = BrowserList::GetLastActiveWithProfile(profile_);\n  if (!browser)\n    return;\n\n  TabContents* tab_contents = browser->GetSelectedTabContents();\n  if (!tab_contents)\n    return;\n\n  string16 extension_name = UTF8ToUTF16(new_extension->name());\n  base::i18n::AdjustStringForLocaleDirection(&extension_name);\n  string16 msg =\n      l10n_util::GetStringFUTF16(IDS_EXTENSION_INSTALLED_HEADING,\n                                 extension_name) +\n      UTF8ToUTF16(\" \") +\n      l10n_util::GetStringUTF16(IDS_EXTENSION_INSTALLED_MANAGE_INFO_MAC);\n  InfoBarDelegate* delegate = new SimpleAlertInfoBarDelegate(\n      tab_contents, msg, new SkBitmap(icon_), true);\n  tab_contents->AddInfoBar(delegate);\n}\n#endif\n\nInfoBarDelegate* ExtensionInstallUI::GetNewThemeInstalledInfoBarDelegate(\n    TabContents* tab_contents, const Extension* new_theme,\n    const std::string& previous_theme_id, bool previous_use_system_theme) {\n#if defined(TOOLKIT_GTK)\n  return new GtkThemeInstalledInfoBarDelegate(tab_contents, new_theme,\n      previous_theme_id, previous_use_system_theme);\n#else\n  return new ThemeInstalledInfoBarDelegate(tab_contents, new_theme,\n      previous_theme_id);\n#endif\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n\nusing namespace std;\n\nconst int MAX = 100;\n\nstruct Person {\n  string firstName;\n  string lastName;\n\n  void input() {\n    cout << \"Enter person's first and last names separated by a space: \";\n    cin >> firstName >> lastName;\n  }\n\n  void print() {\n    cout << firstName << ' ' << lastName << '\\n';\n  }\n};\n\nstruct Client {\n  Person person;\n  double account;\n\n  void input() {\n    person.input();\n\n    cout << \"Enter account: \";\n    cin >> account;\n  }\n\n  void print() {\n    person.print();\n    cout << \"Account: \" << account << '\\n';\n  };\n};\n\nvoid inputClients(Client clients[], int n) {\n  for (int i = 0; i < n; ++i) {\n    clients[i].input();\n  }\n}\n\nvoid printClients(Client clients[], int n) {\n  for (int i = 0; i < n; ++i) {\n    clients[i].print();\n  }\n}\n\ndouble sumAccounts(Client clients[], int n) {\n  double sum = 0;\n\n  for (int i = 0; i < n; ++i) {\n    sum += clients[i].account;\n  }\n\n  return sum;\n}\n\nint main() {\n  Client clients[MAX];\n  int clientsCount = 3;\n\n  inputClients(clients, clientsCount);\n  printClients(clients, clientsCount);\n  cout << sumAccounts(clients, clientsCount) << '\\n';\n\n  return 0;\n}\n<commit_msg>Use char[] instead of std::string<commit_after>#include <iostream>\n\nusing namespace std;\n\nstruct Person {\n  char firstName[32];\n  char lastName[32];\n\n  void input() {\n    cout << \"Enter person's first and last names separated by a space: \";\n    cin >> firstName >> lastName;\n  }\n\n  void print() {\n    cout << firstName << ' ' << lastName << '\\n';\n  }\n};\n\nstruct Client {\n  Person person;\n  double account;\n\n  void input() {\n    person.input();\n\n    cout << \"Enter account: \";\n    cin >> account;\n  }\n\n  void print() {\n    person.print();\n    cout << \"Account: \" << account << '\\n';\n  };\n};\n\nvoid inputClients(Client clients[], int n) {\n  for (int i = 0; i < n; ++i) {\n    clients[i].input();\n  }\n}\n\nvoid printClients(Client clients[], int n) {\n  for (int i = 0; i < n; ++i) {\n    clients[i].print();\n  }\n}\n\ndouble sumAccounts(Client clients[], int n) {\n  double sum = 0;\n\n  for (int i = 0; i < n; ++i) {\n    sum += clients[i].account;\n  }\n\n  return sum;\n}\n\nint main() {\n  Client clients[100];\n  int clientsCount = 3;\n\n  inputClients(clients, clientsCount);\n  printClients(clients, clientsCount);\n  cout << sumAccounts(clients, clientsCount) << '\\n';\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkJavaUtil.cxx\n  Language:  C++\n  Date:      $Date$\n  Version:   $Revision$\n\n\nCopyright (c) 1993-1998 Ken Martin, Will Schroeder, Bill Lorensen.\n\nThis software is copyrighted by Ken Martin, Will Schroeder and Bill Lorensen.\nThe following terms apply to all files associated with the software unless\nexplicitly disclaimed in individual files. This copyright specifically does\nnot apply to the related textbook \"The Visualization Toolkit\" ISBN\n013199837-4 published by Prentice Hall which is covered by its own copyright.\n\nThe authors hereby grant permission to use, copy, and distribute this\nsoftware and its documentation for any purpose, provided that existing\ncopyright notices are retained in all copies and that this notice is included\nverbatim in any distributions. Additionally, the authors grant permission to\nmodify this software and its documentation for any purpose, provided that\nsuch modifications are not distributed without the explicit consent of the\nauthors and that existing copyright notices are retained in all copies. Some\nof the algorithms implemented by this software are patented, observe all\napplicable patent law.\n\nIN NO EVENT SHALL THE AUTHORS OR DISTRIBUTORS BE LIABLE TO ANY PARTY FOR\nDIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT\nOF THE USE OF THIS SOFTWARE, ITS DOCUMENTATION, OR ANY DERIVATIVES THEREOF,\nEVEN IF THE AUTHORS HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\nTHE AUTHORS AND DISTRIBUTORS SPECIFICALLY DISCLAIM ANY WARRANTIES, INCLUDING,\nBUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\nPARTICULAR PURPOSE, AND NON-INFRINGEMENT.  THIS SOFTWARE IS PROVIDED ON AN\n\"AS IS\" BASIS, AND THE AUTHORS AND DISTRIBUTORS HAVE NO OBLIGATION TO PROVIDE\nMAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.\n\n\n=========================================================================*\/\n\n\/\/ include stdmutex for borland\n#ifdef __BORLANDC__\n#include <stdmutex.h>\n#endif\n\n#include <iostream.h>\n#include <stdlib.h>\n#include <stdio.h>\n#ifdef _INTEGRAL_MAX_BITS\n#undef _INTEGRAL_MAX_BITS\n#endif\n#define _INTEGRAL_MAX_BITS 64\n\n#include \"vtkObject.h\"\n\n#ifdef _WIN32\nHANDLE vtkGlobalMutex = NULL;\n#define VTK_GET_MUTEX() WaitForSingleObject(vtkGlobalMutex,INFINITE)\n#define VTK_RELEASE_MUTEX() ReleaseMutex(vtkGlobalMutex)\n#include <mapiform.h>\n#else\n\n#ifdef VTK_USE_SPROC\n\/\/ for SGI's possibly others\n#include <pthread.h>\npthread_mutex_t vtkGlobalMutex;\n#define VTK_GET_MUTEX()  pthread_mutex_lock(&vtkGlobalMutex)\n#define VTK_RELEASE_MUTEX() pthread_mutex_unlock(&vtkGlobalMutex)\n#else\n\/\/ for solaris\n#include <thread.h>\n#include <synch.h>\nmutex_t vtkGlobalMutex;\n#define VTK_GET_MUTEX()  mutex_lock(&vtkGlobalMutex)\n#define VTK_RELEASE_MUTEX() mutex_unlock(&vtkGlobalMutex)\n#endif\n\n#endif\n\n#include \"vtkJavaUtil.h\"\n\nint vtkJavaIdCount = 1;\n\n\/\/#define VTKJAVADEBUG\n\nclass vtkHashNode \n{\npublic:\n  vtkHashNode *next;\n  void *key;\n  void *value;\n};\n\n\nclass vtkHashTable\n{\npublic:\n  vtkHashTable();\n  vtkHashNode *(nodes[64]);\n  void AddHashEntry(void *key,void *value);\n  void *GetHashTableValue(void *key);\n  void DeleteHashEntry(void *key);\n};\n\nvtkHashTable::vtkHashTable()\n{\n  int i;\n  for (i = 0; i < 64; i++)\n    {\n    this->nodes[i] = NULL;\n    }\n}\n\nvtkHashTable *vtkInstanceLookup = NULL;\nvtkHashTable *vtkPointerLookup = NULL;\nvtkHashTable *vtkTypecastLookup = NULL;\nvtkHashTable *vtkDeleteLookup = NULL;\n\nvoid vtkHashTable::AddHashEntry(void *key,void *value)\n{\n  vtkHashNode *pos;\n  vtkHashNode *newpos;\n  int loc;\n  \n  newpos = new vtkHashNode;\n  newpos->key = key;\n  newpos->value = value;\n  newpos->next = NULL;\n  \n  loc = (((unsigned long)key) & 0x03f0) \/ 16;\n  \n  pos = this->nodes[loc];\n  if (!pos)\n    {\n    this->nodes[loc] = newpos;\n    return;\n    }\n  while (pos->next)\n    {\n    pos = pos->next;\n    }\n  pos->next = newpos;\n}\n\nvoid *vtkHashTable::GetHashTableValue(void *key)\n{\n  vtkHashNode *pos;\n  int loc = (((unsigned long)key) & 0x03f0) \/ 16;\n  \n  pos = this->nodes[loc];\n\n  if (!pos)\n    {\n    return NULL;\n    }\n  while ((pos)&&(pos->key != key))\n    {\n    pos = pos->next;\n    }\n  if (pos)\n    {\n    return pos->value;\n    }\n  return NULL;\n}\n\nvoid vtkHashTable::DeleteHashEntry(void *key)\n{\n  vtkHashNode *pos;\n  vtkHashNode *prev = NULL;\n  int loc = (((unsigned long)key) & 0x03f0) \/ 16;\n  \n  pos = this->nodes[loc];\n\n  while ((pos)&&(pos->key != key))\n    {\n    prev = pos;\n    pos = pos->next;\n    }\n  if (pos)\n    {\n    \/\/ we found this object\n    if (prev)\n      {\n      prev->next = pos->next;\n      }\n    else\n      {\n      this->nodes[loc] = pos->next;\n      }\n    delete pos;\n    }\n}\n\nint vtkJavaGetId(JNIEnv *env,jobject obj)\n{\n  jfieldID id;\n  int result;\n    \n  id = env->GetFieldID(env->GetObjectClass(obj),\"vtkId\",\"I\");\n  \n  result = (int)env->GetIntField(obj,id);\n  return result;\n}\n\nvoid vtkJavaSetId(JNIEnv *env,jobject obj, int newVal)\n{\n  jfieldID id;\n  jint jNewVal = (jint)newVal;\n    \n  id = env->GetFieldID(env->GetObjectClass(obj),\"vtkId\",\"I\");\n  \n  env->SetIntField(obj,id,jNewVal);\n}\n\n\/\/ add an object to the hash table\nvoid vtkJavaAddObjectToHash(JNIEnv *env, jobject obj, void *ptr,\n\t\t\t    void *tcFunc,int deleteMe)\n{ \n  if (!vtkInstanceLookup)\n    {\n    vtkInstanceLookup = new vtkHashTable;\n    vtkTypecastLookup = new vtkHashTable;\n    vtkPointerLookup = new vtkHashTable;\n    vtkDeleteLookup = new vtkHashTable;\n#ifdef _WIN32\n    vtkGlobalMutex = CreateMutex(NULL, FALSE, NULL);\n#endif\n    }\n\nVTK_GET_MUTEX();\n\n#ifdef VTKJAVADEBUG\n  vtkGenericWarningMacro(\"Adding an object to hash ptr = \" << ptr);\n#endif  \n  \/\/ lets make sure it isn't already there\n  if (vtkJavaGetId(env,obj))\n    {\n#ifdef VTKJAVADEBUG\n    vtkGenericWarningMacro(\"Attempt to add an object to the hash when one already exists!!!\");\n#endif\n    VTK_RELEASE_MUTEX();\n    return;\n    }\n\n  \/\/ get a unique id for this object\n  \/\/ just use vtkJavaIdCount and then increment\n  \/\/ to handle loop around make sure the id isn't currently in use\n  while (vtkInstanceLookup->GetHashTableValue((void *)vtkJavaIdCount))\n    {\n    vtkJavaIdCount++;\n    if (vtkJavaIdCount > 268435456) vtkJavaIdCount = 1;\n    }\n\n  vtkInstanceLookup->AddHashEntry((void *)vtkJavaIdCount,ptr);\n  vtkTypecastLookup->AddHashEntry((void *)vtkJavaIdCount,tcFunc);\n  vtkPointerLookup->AddHashEntry(ptr,(void *)env->NewGlobalRef(obj));\n  vtkDeleteLookup->AddHashEntry((void *)vtkJavaIdCount,(void *)deleteMe);\n\n  vtkJavaSetId(env,obj,vtkJavaIdCount);\n  \n#ifdef VTKJAVADEBUG\n  vtkGenericWarningMacro(\"Added object to hash id= \" << vtkJavaIdCount << \" \" << ptr);\n#endif  \n  vtkJavaIdCount++;\n  VTK_RELEASE_MUTEX();\n}\n\n\/\/ should we delete this object\nint vtkJavaShouldIDeleteObject(JNIEnv *env,jobject obj)\n{\n  int id = vtkJavaGetId(env,obj);\n  \n  VTK_GET_MUTEX();\n  if ((int)(vtkDeleteLookup->GetHashTableValue((void *)id)))\n    {\n#ifdef VTKJAVADEBUG\n    vtkGenericWarningMacro(\"Decided to delete id = \" << id);\n#endif\n    vtkJavaDeleteObjectFromHash(env, id);\n    VTK_RELEASE_MUTEX();\n    return 1;\n    }\n\n#ifdef VTKJAVADEBUG\n  vtkGenericWarningMacro(\"Decided to NOT delete id = \" << id);\n#endif\n  vtkJavaDeleteObjectFromHash(env, id);\n  VTK_RELEASE_MUTEX();\n  return 0;\n}\n\n\n\/\/ delete an object from the hash\n\/\/ doesn't need a mutex because it is only called from within\n\/\/ the above func which does have a mutex\nvoid vtkJavaDeleteObjectFromHash(JNIEnv *env, int id)\n{\n  void *ptr;\n  void *vptr;\n  \n  ptr = vtkInstanceLookup->GetHashTableValue((void *)id);\n  if (!ptr) \n    {\n#ifdef VTKJAVADEBUG\n    vtkGenericWarningMacro(\"Attempt to delete an object that doesnt exist!!!\");\n#endif  \n    return;\n    }\n  vtkInstanceLookup->DeleteHashEntry((void *)id);\n  vtkTypecastLookup->DeleteHashEntry((void *)id);\n  vptr = vtkPointerLookup->GetHashTableValue(ptr);\n  env->DeleteGlobalRef((jobject)vptr);\n  vtkPointerLookup->DeleteHashEntry(ptr);\n  vtkDeleteLookup->DeleteHashEntry((void *)id);\n}\n\njobject vtkJavaGetObjectFromPointer(void *ptr)\n{\n  jobject obj;\n\n#ifdef VTKJAVADEBUG\n  vtkGenericWarningMacro(\"Checking into pointer \" << ptr);\n#endif  \n  obj = (jobject)vtkPointerLookup->GetHashTableValue((jobject *)ptr);\n#ifdef VTKJAVADEBUG\n  vtkGenericWarningMacro(\"Checking into pointer \" << ptr << \" obj = \" << obj);\n#endif  \n  return obj;\n}\n\nvoid *vtkJavaGetPointerFromObject(JNIEnv *env, jobject obj, char *result_type)\n{\n  void *ptr;\n  void *(*command)(void *,char *);\n  int id;\n  \n  id = vtkJavaGetId(env,obj);\n  VTK_GET_MUTEX();\n  ptr = vtkInstanceLookup->GetHashTableValue((void *)id);\n  command = (void *(*)(void *,char *))vtkTypecastLookup->GetHashTableValue((void *)id);\n  VTK_RELEASE_MUTEX();\n\n#ifdef VTKJAVADEBUG\n  vtkGenericWarningMacro(\"Checking into id \" << id << \" ptr = \" << ptr);\n#endif  \n\n  if (!ptr)\n    {\n    return NULL;\n    }\n  \n  if (command(ptr,result_type))\n    {\n#ifdef VTKJAVADEBUG\n    vtkGenericWarningMacro(\"Got id= \" << id << \" ptr= \" << ptr << \" \" << result_type);\n#endif  \n    return command(ptr,result_type);\n    }\n  else\n    {\n    vtkGenericWarningMacro(\"vtk bad argument, type conversion failed.\");\n    return NULL;\n    }\n}\n\njarray vtkJavaMakeJArrayOfDoubleFromDouble(JNIEnv *env, double *ptr, int size)\n{\n  jdoubleArray ret;\n  int i;\n  jdouble *array;\n\n  ret = env->NewDoubleArray(size);\n  if (ret == 0)\n    {\n    \/\/ should throw an exception here\n    return 0;\n    }\n\n  array = env->GetDoubleArrayElements(ret,NULL);\n\n  \/\/ copy the data\n  for (i = 0; i < size; i++)\n    {\n    array[i] = ptr[i];\n    }\n  \n  env->ReleaseDoubleArrayElements(ret,array,0);\n  return ret;\n}\n\njarray vtkJavaMakeJArrayOfDoubleFromFloat(JNIEnv *env, float *ptr, int size)\n{\n  jdoubleArray ret;\n  int i;\n  jdouble *array;\n\n  ret = env->NewDoubleArray(size);\n  if (ret == 0)\n    {\n    \/\/ should throw an exception here\n    return 0;\n    }\n\n  array = env->GetDoubleArrayElements(ret,NULL);\n\n  \/\/ copy the data\n  for (i = 0; i < size; i++)\n    {\n    array[i] = ptr[i];\n    }\n  \n  env->ReleaseDoubleArrayElements(ret,array,0);\n  return ret;\n}\n\njarray vtkJavaMakeJArrayOfIntFromInt(JNIEnv *env, int *ptr, int size)\n{\n  jintArray ret;\n  int i;\n  jint *array;\n\n  ret = env->NewIntArray(size);\n  if (ret == 0)\n    {\n    \/\/ should throw an exception here\n    return 0;\n    }\n\n  array = env->GetIntArrayElements(ret,NULL);\n\n  \/\/ copy the data\n  for (i = 0; i < size; i++)\n    {\n    array[i] = ptr[i];\n    }\n  \n  env->ReleaseIntArrayElements(ret,array,0);\n  return ret;\n}\n\nchar *vtkJavaUTFToChar(JNIEnv *env,jstring in)\n{\n  char *result;\n  const char *inBytes;\n  int length, i;\n  int resultLength = 1;\n  \n  length = env->GetStringUTFLength(in);\n  inBytes = env->GetStringUTFChars(in,NULL);\n  \n  for (i = 0; i < length; i++)\n    {\n    if ((inBytes[i] >= 0)&&(inBytes[i] < 128 )) resultLength++;\n    }\n  result = new char [resultLength];\n\n  resultLength = 0; \/\/ the 0 versus 1 up above is on purpose\n  for (i = 0; i < length; i++)\n    {\n    if ((inBytes[i] >= 0)&&(inBytes[i] < 128 ))\n      {\n      result[resultLength] = inBytes[i];\n      resultLength++;\n      }\n    }\n  result[resultLength] = '\\0';\n  env->ReleaseStringUTFChars(in,inBytes);\n  return result;\n}\n\njstring vtkJavaMakeJavaString(JNIEnv *env, const char *in)\n{\n  jstring result;\n  char *utf;\n  int inLength, utfLength, i;\n  \n  if (!in)\n    {\n    utf = new char [2];\n    utf[0] = 0xC0;\n    utf[1] = 0x80;\n    result = env->NewStringUTF(utf);\n    return result;\n    }\n  \n  inLength = strlen(in);\n  utfLength = inLength + 2;\n  utf = new char [utfLength];\n  \n  for (i = 0; i < inLength; i++)\n    {\n    utf[i] = in[i];\n    }\n  utf[inLength] = 0xC0;\n  utf[inLength+1] = 0x80;\n  result = env->NewStringUTF(utf);\n\n  \/\/ do we need to free utf here ? Does JNI make a copy ?\n  \n  return result;\n}\n\n\/\/**jcp this is the callback inteface stub for Java. no user parms are passed\n\/\/since the callback must be a method of a class. We make the rash assumption\n\/\/that the <this> pointer will anchor any required other elements for the\n\/\/called functions. - edited by km\nvoid vtkJavaVoidFunc(void* f) \n{  \n  vtkJavaVoidFuncArg *iprm = (vtkJavaVoidFuncArg *)f;\n  \/\/ make sure we have a valid method ID\n  if (iprm->mid)\n    {\n    iprm->uenv->CallVoidMethod(iprm->uobj,iprm->mid); \n    }\n}\n\nvoid vtkJavaVoidFuncArgDelete(void* arg) \n{\n  vtkJavaVoidFuncArg *arg2;\n  \n  arg2 = (vtkJavaVoidFuncArg *)arg;\n  \n  \/\/ free the structure\n  arg2->uenv->DeleteGlobalRef(arg2->uobj);\n  \n  delete arg2;\n}\n\n<commit_msg>ENH: better support for SGI<commit_after>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkJavaUtil.cxx\n  Language:  C++\n  Date:      $Date$\n  Version:   $Revision$\n\n\nCopyright (c) 1993-1998 Ken Martin, Will Schroeder, Bill Lorensen.\n\nThis software is copyrighted by Ken Martin, Will Schroeder and Bill Lorensen.\nThe following terms apply to all files associated with the software unless\nexplicitly disclaimed in individual files. This copyright specifically does\nnot apply to the related textbook \"The Visualization Toolkit\" ISBN\n013199837-4 published by Prentice Hall which is covered by its own copyright.\n\nThe authors hereby grant permission to use, copy, and distribute this\nsoftware and its documentation for any purpose, provided that existing\ncopyright notices are retained in all copies and that this notice is included\nverbatim in any distributions. Additionally, the authors grant permission to\nmodify this software and its documentation for any purpose, provided that\nsuch modifications are not distributed without the explicit consent of the\nauthors and that existing copyright notices are retained in all copies. Some\nof the algorithms implemented by this software are patented, observe all\napplicable patent law.\n\nIN NO EVENT SHALL THE AUTHORS OR DISTRIBUTORS BE LIABLE TO ANY PARTY FOR\nDIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT\nOF THE USE OF THIS SOFTWARE, ITS DOCUMENTATION, OR ANY DERIVATIVES THEREOF,\nEVEN IF THE AUTHORS HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\nTHE AUTHORS AND DISTRIBUTORS SPECIFICALLY DISCLAIM ANY WARRANTIES, INCLUDING,\nBUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\nPARTICULAR PURPOSE, AND NON-INFRINGEMENT.  THIS SOFTWARE IS PROVIDED ON AN\n\"AS IS\" BASIS, AND THE AUTHORS AND DISTRIBUTORS HAVE NO OBLIGATION TO PROVIDE\nMAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.\n\n\n=========================================================================*\/\n\n\/\/ include stdmutex for borland\n#ifdef __BORLANDC__\n#include <stdmutex.h>\n#endif\n\n#include <iostream.h>\n#include <stdlib.h>\n#include <stdio.h>\n#ifdef _INTEGRAL_MAX_BITS\n#undef _INTEGRAL_MAX_BITS\n#endif\n#define _INTEGRAL_MAX_BITS 64\n\n#include \"vtkObject.h\"\n\n#ifdef _WIN32\nHANDLE vtkGlobalMutex = NULL;\n#define VTK_GET_MUTEX() WaitForSingleObject(vtkGlobalMutex,INFINITE)\n#define VTK_RELEASE_MUTEX() ReleaseMutex(vtkGlobalMutex)\n#include <mapiform.h>\n#else\n\n#ifdef VTK_USE_SPROC\n\/\/ for SGI's\n#include <abi_mutex.h>\nabilock_t vtkGlobalMutex;\nstatic void vtk_get_mutex() {\n    static int inited = 0;\n    if (!inited) {\n        if (init_lock(&vtkGlobalMutex) < 0)\n            perror(\"initializing mutex\");\n        inited = 1;\n    }\n    spin_lock(&vtkGlobalMutex);\n}\nstatic void vtk_release_mutex() {\n    if (release_lock(&vtkGlobalMutex) < 0)\n        perror(\"releasing mutex\");\n}\n#define VTK_GET_MUTEX()  vtk_get_mutex()\n#define VTK_RELEASE_MUTEX() vtk_release_mutex()\n#else\n\/\/ for solaris\n#include <thread.h>\n#include <synch.h>\nmutex_t vtkGlobalMutex;\n#define VTK_GET_MUTEX()  mutex_lock(&vtkGlobalMutex)\n#define VTK_RELEASE_MUTEX() mutex_unlock(&vtkGlobalMutex)\n#endif\n\n#endif\n\n#include \"vtkJavaUtil.h\"\n\nint vtkJavaIdCount = 1;\n\n\/\/#define VTKJAVADEBUG\n\nclass vtkHashNode \n{\npublic:\n  vtkHashNode *next;\n  void *key;\n  void *value;\n};\n\n\nclass vtkHashTable\n{\npublic:\n  vtkHashTable();\n  vtkHashNode *(nodes[64]);\n  void AddHashEntry(void *key,void *value);\n  void *GetHashTableValue(void *key);\n  void DeleteHashEntry(void *key);\n};\n\nvtkHashTable::vtkHashTable()\n{\n  int i;\n  for (i = 0; i < 64; i++)\n    {\n    this->nodes[i] = NULL;\n    }\n}\n\nvtkHashTable *vtkInstanceLookup = NULL;\nvtkHashTable *vtkPointerLookup = NULL;\nvtkHashTable *vtkTypecastLookup = NULL;\nvtkHashTable *vtkDeleteLookup = NULL;\n\nvoid vtkHashTable::AddHashEntry(void *key,void *value)\n{\n  vtkHashNode *pos;\n  vtkHashNode *newpos;\n  int loc;\n  \n  newpos = new vtkHashNode;\n  newpos->key = key;\n  newpos->value = value;\n  newpos->next = NULL;\n  \n  loc = (((unsigned long)key) & 0x03f0) \/ 16;\n  \n  pos = this->nodes[loc];\n  if (!pos)\n    {\n    this->nodes[loc] = newpos;\n    return;\n    }\n  while (pos->next)\n    {\n    pos = pos->next;\n    }\n  pos->next = newpos;\n}\n\nvoid *vtkHashTable::GetHashTableValue(void *key)\n{\n  vtkHashNode *pos;\n  int loc = (((unsigned long)key) & 0x03f0) \/ 16;\n  \n  pos = this->nodes[loc];\n\n  if (!pos)\n    {\n    return NULL;\n    }\n  while ((pos)&&(pos->key != key))\n    {\n    pos = pos->next;\n    }\n  if (pos)\n    {\n    return pos->value;\n    }\n  return NULL;\n}\n\nvoid vtkHashTable::DeleteHashEntry(void *key)\n{\n  vtkHashNode *pos;\n  vtkHashNode *prev = NULL;\n  int loc = (((unsigned long)key) & 0x03f0) \/ 16;\n  \n  pos = this->nodes[loc];\n\n  while ((pos)&&(pos->key != key))\n    {\n    prev = pos;\n    pos = pos->next;\n    }\n  if (pos)\n    {\n    \/\/ we found this object\n    if (prev)\n      {\n      prev->next = pos->next;\n      }\n    else\n      {\n      this->nodes[loc] = pos->next;\n      }\n    delete pos;\n    }\n}\n\nint vtkJavaGetId(JNIEnv *env,jobject obj)\n{\n  jfieldID id;\n  int result;\n    \n  id = env->GetFieldID(env->GetObjectClass(obj),\"vtkId\",\"I\");\n  \n  result = (int)env->GetIntField(obj,id);\n  return result;\n}\n\nvoid vtkJavaSetId(JNIEnv *env,jobject obj, int newVal)\n{\n  jfieldID id;\n  jint jNewVal = (jint)newVal;\n    \n  id = env->GetFieldID(env->GetObjectClass(obj),\"vtkId\",\"I\");\n  \n  env->SetIntField(obj,id,jNewVal);\n}\n\n\/\/ add an object to the hash table\nvoid vtkJavaAddObjectToHash(JNIEnv *env, jobject obj, void *ptr,\n\t\t\t    void *tcFunc,int deleteMe)\n{ \n  if (!vtkInstanceLookup)\n    {\n    vtkInstanceLookup = new vtkHashTable;\n    vtkTypecastLookup = new vtkHashTable;\n    vtkPointerLookup = new vtkHashTable;\n    vtkDeleteLookup = new vtkHashTable;\n#ifdef _WIN32\n    vtkGlobalMutex = CreateMutex(NULL, FALSE, NULL);\n#endif\n    }\n\nVTK_GET_MUTEX();\n\n#ifdef VTKJAVADEBUG\n  vtkGenericWarningMacro(\"Adding an object to hash ptr = \" << ptr);\n#endif  \n  \/\/ lets make sure it isn't already there\n  if (vtkJavaGetId(env,obj))\n    {\n#ifdef VTKJAVADEBUG\n    vtkGenericWarningMacro(\"Attempt to add an object to the hash when one already exists!!!\");\n#endif\n    VTK_RELEASE_MUTEX();\n    return;\n    }\n\n  \/\/ get a unique id for this object\n  \/\/ just use vtkJavaIdCount and then increment\n  \/\/ to handle loop around make sure the id isn't currently in use\n  while (vtkInstanceLookup->GetHashTableValue((void *)vtkJavaIdCount))\n    {\n    vtkJavaIdCount++;\n    if (vtkJavaIdCount > 268435456) vtkJavaIdCount = 1;\n    }\n\n  vtkInstanceLookup->AddHashEntry((void *)vtkJavaIdCount,ptr);\n  vtkTypecastLookup->AddHashEntry((void *)vtkJavaIdCount,tcFunc);\n  vtkPointerLookup->AddHashEntry(ptr,(void *)env->NewGlobalRef(obj));\n  vtkDeleteLookup->AddHashEntry((void *)vtkJavaIdCount,(void *)deleteMe);\n\n  vtkJavaSetId(env,obj,vtkJavaIdCount);\n  \n#ifdef VTKJAVADEBUG\n  vtkGenericWarningMacro(\"Added object to hash id= \" << vtkJavaIdCount << \" \" << ptr);\n#endif  \n  vtkJavaIdCount++;\n  VTK_RELEASE_MUTEX();\n}\n\n\/\/ should we delete this object\nint vtkJavaShouldIDeleteObject(JNIEnv *env,jobject obj)\n{\n  int id = vtkJavaGetId(env,obj);\n  \n  VTK_GET_MUTEX();\n  if ((int)(vtkDeleteLookup->GetHashTableValue((void *)id)))\n    {\n#ifdef VTKJAVADEBUG\n    vtkGenericWarningMacro(\"Decided to delete id = \" << id);\n#endif\n    vtkJavaDeleteObjectFromHash(env, id);\n    VTK_RELEASE_MUTEX();\n    return 1;\n    }\n\n#ifdef VTKJAVADEBUG\n  vtkGenericWarningMacro(\"Decided to NOT delete id = \" << id);\n#endif\n  vtkJavaDeleteObjectFromHash(env, id);\n  VTK_RELEASE_MUTEX();\n  return 0;\n}\n\n\n\/\/ delete an object from the hash\n\/\/ doesn't need a mutex because it is only called from within\n\/\/ the above func which does have a mutex\nvoid vtkJavaDeleteObjectFromHash(JNIEnv *env, int id)\n{\n  void *ptr;\n  void *vptr;\n  \n  ptr = vtkInstanceLookup->GetHashTableValue((void *)id);\n  if (!ptr) \n    {\n#ifdef VTKJAVADEBUG\n    vtkGenericWarningMacro(\"Attempt to delete an object that doesnt exist!!!\");\n#endif  \n    return;\n    }\n  vtkInstanceLookup->DeleteHashEntry((void *)id);\n  vtkTypecastLookup->DeleteHashEntry((void *)id);\n  vptr = vtkPointerLookup->GetHashTableValue(ptr);\n  env->DeleteGlobalRef((jobject)vptr);\n  vtkPointerLookup->DeleteHashEntry(ptr);\n  vtkDeleteLookup->DeleteHashEntry((void *)id);\n}\n\njobject vtkJavaGetObjectFromPointer(void *ptr)\n{\n  jobject obj;\n\n#ifdef VTKJAVADEBUG\n  vtkGenericWarningMacro(\"Checking into pointer \" << ptr);\n#endif  \n  obj = (jobject)vtkPointerLookup->GetHashTableValue((jobject *)ptr);\n#ifdef VTKJAVADEBUG\n  vtkGenericWarningMacro(\"Checking into pointer \" << ptr << \" obj = \" << obj);\n#endif  \n  return obj;\n}\n\nvoid *vtkJavaGetPointerFromObject(JNIEnv *env, jobject obj, char *result_type)\n{\n  void *ptr;\n  void *(*command)(void *,char *);\n  int id;\n  \n  id = vtkJavaGetId(env,obj);\n  VTK_GET_MUTEX();\n  ptr = vtkInstanceLookup->GetHashTableValue((void *)id);\n  command = (void *(*)(void *,char *))vtkTypecastLookup->GetHashTableValue((void *)id);\n  VTK_RELEASE_MUTEX();\n\n#ifdef VTKJAVADEBUG\n  vtkGenericWarningMacro(\"Checking into id \" << id << \" ptr = \" << ptr);\n#endif  \n\n  if (!ptr)\n    {\n    return NULL;\n    }\n  \n  if (command(ptr,result_type))\n    {\n#ifdef VTKJAVADEBUG\n    vtkGenericWarningMacro(\"Got id= \" << id << \" ptr= \" << ptr << \" \" << result_type);\n#endif  \n    return command(ptr,result_type);\n    }\n  else\n    {\n    vtkGenericWarningMacro(\"vtk bad argument, type conversion failed.\");\n    return NULL;\n    }\n}\n\njarray vtkJavaMakeJArrayOfDoubleFromDouble(JNIEnv *env, double *ptr, int size)\n{\n  jdoubleArray ret;\n  int i;\n  jdouble *array;\n\n  ret = env->NewDoubleArray(size);\n  if (ret == 0)\n    {\n    \/\/ should throw an exception here\n    return 0;\n    }\n\n  array = env->GetDoubleArrayElements(ret,NULL);\n\n  \/\/ copy the data\n  for (i = 0; i < size; i++)\n    {\n    array[i] = ptr[i];\n    }\n  \n  env->ReleaseDoubleArrayElements(ret,array,0);\n  return ret;\n}\n\njarray vtkJavaMakeJArrayOfDoubleFromFloat(JNIEnv *env, float *ptr, int size)\n{\n  jdoubleArray ret;\n  int i;\n  jdouble *array;\n\n  ret = env->NewDoubleArray(size);\n  if (ret == 0)\n    {\n    \/\/ should throw an exception here\n    return 0;\n    }\n\n  array = env->GetDoubleArrayElements(ret,NULL);\n\n  \/\/ copy the data\n  for (i = 0; i < size; i++)\n    {\n    array[i] = ptr[i];\n    }\n  \n  env->ReleaseDoubleArrayElements(ret,array,0);\n  return ret;\n}\n\njarray vtkJavaMakeJArrayOfIntFromInt(JNIEnv *env, int *ptr, int size)\n{\n  jintArray ret;\n  int i;\n  jint *array;\n\n  ret = env->NewIntArray(size);\n  if (ret == 0)\n    {\n    \/\/ should throw an exception here\n    return 0;\n    }\n\n  array = env->GetIntArrayElements(ret,NULL);\n\n  \/\/ copy the data\n  for (i = 0; i < size; i++)\n    {\n    array[i] = ptr[i];\n    }\n  \n  env->ReleaseIntArrayElements(ret,array,0);\n  return ret;\n}\n\nchar *vtkJavaUTFToChar(JNIEnv *env,jstring in)\n{\n  char *result;\n  const char *inBytes;\n  int length, i;\n  int resultLength = 1;\n  \n  length = env->GetStringUTFLength(in);\n  inBytes = env->GetStringUTFChars(in,NULL);\n  \n  for (i = 0; i < length; i++)\n    {\n    if ((inBytes[i] >= 0)&&(inBytes[i] < 128 )) resultLength++;\n    }\n  result = new char [resultLength];\n\n  resultLength = 0; \/\/ the 0 versus 1 up above is on purpose\n  for (i = 0; i < length; i++)\n    {\n    if ((inBytes[i] >= 0)&&(inBytes[i] < 128 ))\n      {\n      result[resultLength] = inBytes[i];\n      resultLength++;\n      }\n    }\n  result[resultLength] = '\\0';\n  env->ReleaseStringUTFChars(in,inBytes);\n  return result;\n}\n\njstring vtkJavaMakeJavaString(JNIEnv *env, const char *in)\n{\n  jstring result;\n  char *utf;\n  int inLength, utfLength, i;\n  \n  if (!in)\n    {\n    utf = new char [2];\n    utf[0] = 0xC0;\n    utf[1] = 0x80;\n    result = env->NewStringUTF(utf);\n    return result;\n    }\n  \n  inLength = strlen(in);\n  utfLength = inLength + 2;\n  utf = new char [utfLength];\n  \n  for (i = 0; i < inLength; i++)\n    {\n    utf[i] = in[i];\n    }\n  utf[inLength] = 0xC0;\n  utf[inLength+1] = 0x80;\n  result = env->NewStringUTF(utf);\n\n  \/\/ do we need to free utf here ? Does JNI make a copy ?\n  \n  return result;\n}\n\n\/\/**jcp this is the callback inteface stub for Java. no user parms are passed\n\/\/since the callback must be a method of a class. We make the rash assumption\n\/\/that the <this> pointer will anchor any required other elements for the\n\/\/called functions. - edited by km\nvoid vtkJavaVoidFunc(void* f) \n{  \n  vtkJavaVoidFuncArg *iprm = (vtkJavaVoidFuncArg *)f;\n  \/\/ make sure we have a valid method ID\n  if (iprm->mid)\n    {\n    iprm->uenv->CallVoidMethod(iprm->uobj,iprm->mid); \n    }\n}\n\nvoid vtkJavaVoidFuncArgDelete(void* arg) \n{\n  vtkJavaVoidFuncArg *arg2;\n  \n  arg2 = (vtkJavaVoidFuncArg *)arg;\n  \n  \/\/ free the structure\n  arg2->uenv->DeleteGlobalRef(arg2->uobj);\n  \n  delete arg2;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"compton-conf.h\"\n#include <QApplication>\n#include <QLocale>\n#include <QLibraryInfo>\n#include <QTranslator>\n#include \"maindialog.h\"\n\nint main(int argc, char** argv) {\n    QApplication app(argc, argv);\n\n    \/\/ load translations\n    QTranslator qtTranslator, translator;\n    \/\/ install the translations built-into Qt itself\n    qtTranslator.load(\"qt_\" + QLocale::system().name(), QLibraryInfo::location(QLibraryInfo::TranslationsPath));\n    app.installTranslator(&qtTranslator);\n    \/\/ install our own tranlations\n    translator.load(\"compton-conf_\" + QLocale::system().name(), COMPTON_CONF_DATA_DIR \"\/translations\");\n    app.installTranslator(&translator);\n\n    MainDialog dlg;\n    dlg.exec();\n    return 0;\n}\n<commit_msg>Added basic cli interface to compton-conf<commit_after>#include \"compton-conf.h\"\n#include <QApplication>\n#include <QLocale>\n#include <QLibraryInfo>\n#include <QTranslator>\n#include <QCommandLineParser>\n#include \"maindialog.h\"\n\nint main(int argc, char** argv) {\n    QApplication app(argc, argv);\n\n    QCommandLineParser parser;\n    parser.setApplicationDescription(QStringLiteral(\"Compton Conf\"));\n    const QString VERINFO = QStringLiteral(COMPTONCONF_VERSION\n                                           \"\\nQt        \" QT_VERSION_STR);\n    app.setApplicationVersion(VERINFO);\n    parser.addVersionOption();\n    parser.addHelpOption();\n    parser.process(app);\n\n    \/\/ load translations\n    QTranslator qtTranslator, translator;\n    \/\/ install the translations built-into Qt itself\n    qtTranslator.load(\"qt_\" + QLocale::system().name(), QLibraryInfo::location(QLibraryInfo::TranslationsPath));\n    app.installTranslator(&qtTranslator);\n    \/\/ install our own tranlations\n    translator.load(\"compton-conf_\" + QLocale::system().name(), COMPTON_CONF_DATA_DIR \"\/translations\");\n    app.installTranslator(&translator);\n\n    MainDialog dlg;\n    dlg.exec();\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\/prerender\/prerender_field_trial.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/logging.h\"\n#include \"base\/metrics\/field_trial.h\"\n#include \"base\/metrics\/histogram.h\"\n#include \"content\/browser\/renderer_host\/resource_dispatcher_host.h\"\n#include \"chrome\/browser\/prerender\/prerender_manager.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n\n\nnamespace prerender {\n\nvoid ConfigurePrefetchAndPrerender(const CommandLine& command_line) {\n  enum PrerenderOption {\n    PRERENDER_OPTION_AUTO,\n    PRERENDER_OPTION_DISABLED,\n    PRERENDER_OPTION_ENABLED,\n    PRERENDER_OPTION_PREFETCH_ONLY,\n  };\n\n  PrerenderOption prerender_option = PRERENDER_OPTION_AUTO;\n  if (command_line.HasSwitch(switches::kPrerender)) {\n    const std::string switch_value =\n        command_line.GetSwitchValueASCII(switches::kPrerender);\n\n    if (switch_value == switches::kPrerenderSwitchValueAuto) {\n      prerender_option = PRERENDER_OPTION_AUTO;\n    } else if (switch_value == switches::kPrerenderSwitchValueDisabled) {\n      prerender_option = PRERENDER_OPTION_DISABLED;\n    } else if (switch_value.empty() ||\n               switch_value == switches::kPrerenderSwitchValueEnabled) {\n      \/\/ The empty string means the option was provided with no value, and that\n      \/\/ means enable.\n      prerender_option = PRERENDER_OPTION_ENABLED;\n    } else if (switch_value == switches::kPrerenderSwitchValuePrefetchOnly) {\n      prerender_option = PRERENDER_OPTION_PREFETCH_ONLY;\n    } else {\n      prerender_option = PRERENDER_OPTION_DISABLED;\n      LOG(ERROR) << \"Invalid --prerender option received on command line: \"\n                 << switch_value;\n      LOG(ERROR) << \"Disabling prerendering!\";\n    }\n  }\n\n  switch (prerender_option) {\n    case PRERENDER_OPTION_AUTO: {\n      const base::FieldTrial::Probability kPrefetchDivisor = 1000;\n      const base::FieldTrial::Probability kYesPrefetchProbability = 500;\n      const base::FieldTrial::Probability kPrerenderProbability = 0;\n\n      scoped_refptr<base::FieldTrial> trial(\n          new base::FieldTrial(\"Prefetch\", kPrefetchDivisor,\n                               \"ContentPrefetchDisabled\", 2011, 6, 30));\n\n      const int kNoPrefetchGroup = trial->kDefaultGroupNumber;\n      const int kYesPrefetchGroup =\n          trial->AppendGroup(\"ContentPrefetchEnabled\", kYesPrefetchProbability);\n      const int kPrerenderGroup =\n          trial->AppendGroup(\"ContentPrefetchPrerender\", kPrerenderProbability);\n      const int trial_group = trial->group();\n      if (trial_group == kYesPrefetchGroup) {\n        ResourceDispatcherHost::set_is_prefetch_enabled(true);\n        PrerenderManager::SetMode(\n            PrerenderManager::PRERENDER_MODE_EXPERIMENT_CONTROL_GROUP);\n      } else if (trial_group == kNoPrefetchGroup) {\n        ResourceDispatcherHost::set_is_prefetch_enabled(false);\n        PrerenderManager::SetMode(PrerenderManager::PRERENDER_MODE_DISABLED);\n      } else if (trial_group == kPrerenderGroup) {\n        ResourceDispatcherHost::set_is_prefetch_enabled(true);\n        PrerenderManager::SetMode(\n            PrerenderManager::PRERENDER_MODE_EXPERIMENT_PRERENDER_GROUP);\n      } else {\n        NOTREACHED();\n      }\n      break;\n    }\n    case PRERENDER_OPTION_DISABLED:\n      ResourceDispatcherHost::set_is_prefetch_enabled(false);\n      PrerenderManager::SetMode(PrerenderManager::PRERENDER_MODE_DISABLED);\n      break;\n    case PRERENDER_OPTION_ENABLED:\n      ResourceDispatcherHost::set_is_prefetch_enabled(true);\n      PrerenderManager::SetMode(PrerenderManager::PRERENDER_MODE_ENABLED);\n      break;\n    case PRERENDER_OPTION_PREFETCH_ONLY:\n      ResourceDispatcherHost::set_is_prefetch_enabled(true);\n      PrerenderManager::SetMode(PrerenderManager::PRERENDER_MODE_DISABLED);\n      break;\n    default:\n      NOTREACHED();\n  }\n\n  UMA_HISTOGRAM_ENUMERATION(\"Prerender.Sessions\",\n                            PrerenderManager::GetMode(),\n                            PrerenderManager::PRERENDER_MODE_MAX);\n}\n\n}  \/\/ namespace prerender\n<commit_msg>Disable prerender on CrOS.<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 = 500;\n      const base::FieldTrial::Probability kPrerenderProbability = 0;\n\n      scoped_refptr<base::FieldTrial> trial(\n          new base::FieldTrial(\"Prefetch\", kPrefetchDivisor,\n                               \"ContentPrefetchDisabled\", 2011, 6, 30));\n\n      const int kNoPrefetchGroup = trial->kDefaultGroupNumber;\n      const int kYesPrefetchGroup =\n          trial->AppendGroup(\"ContentPrefetchEnabled\", kYesPrefetchProbability);\n      const int kPrerenderGroup =\n          trial->AppendGroup(\"ContentPrefetchPrerender\", kPrerenderProbability);\n      const int trial_group = trial->group();\n      if (trial_group == kYesPrefetchGroup) {\n        ResourceDispatcherHost::set_is_prefetch_enabled(true);\n        PrerenderManager::SetMode(\n            PrerenderManager::PRERENDER_MODE_EXPERIMENT_CONTROL_GROUP);\n      } else if (trial_group == kNoPrefetchGroup) {\n        ResourceDispatcherHost::set_is_prefetch_enabled(false);\n        PrerenderManager::SetMode(PrerenderManager::PRERENDER_MODE_DISABLED);\n      } else if (trial_group == kPrerenderGroup) {\n        ResourceDispatcherHost::set_is_prefetch_enabled(true);\n        PrerenderManager::SetMode(\n            PrerenderManager::PRERENDER_MODE_EXPERIMENT_PRERENDER_GROUP);\n      } else {\n        NOTREACHED();\n      }\n      break;\n    }\n    case PRERENDER_OPTION_DISABLED:\n      ResourceDispatcherHost::set_is_prefetch_enabled(false);\n      PrerenderManager::SetMode(PrerenderManager::PRERENDER_MODE_DISABLED);\n      break;\n    case PRERENDER_OPTION_ENABLED:\n      ResourceDispatcherHost::set_is_prefetch_enabled(true);\n      PrerenderManager::SetMode(PrerenderManager::PRERENDER_MODE_ENABLED);\n      break;\n    case PRERENDER_OPTION_PREFETCH_ONLY:\n      ResourceDispatcherHost::set_is_prefetch_enabled(true);\n      PrerenderManager::SetMode(PrerenderManager::PRERENDER_MODE_DISABLED);\n      break;\n    default:\n      NOTREACHED();\n  }\n\n  UMA_HISTOGRAM_ENUMERATION(\"Prerender.Sessions\",\n                            PrerenderManager::GetMode(),\n                            PrerenderManager::PRERENDER_MODE_MAX);\n}\n\n}  \/\/ namespace prerender\n<|endoftext|>"}
{"text":"<commit_before>\/**************************************************************************\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 \"progressview.h\"\n#include \"futureprogress.h\"\n\n#include <utils\/qtcassert.h>\n\n#include <QtGui\/QHBoxLayout>\n#include <QtGui\/QVBoxLayout>\n\nusing namespace Core;\nusing namespace Core::Internal;\n\nProgressView::ProgressView(QWidget *parent)\n    : QWidget(parent)\n{\n    m_layout = new QVBoxLayout;\n    setLayout(m_layout);\n    m_layout->setMargin(0);\n    m_layout->setSpacing(0);\n    setWindowTitle(tr(\"Processes\"));\n}\n\nProgressView::~ProgressView()\n{\n    qDeleteAll(m_taskList);\n    m_taskList.clear();\n}\n\nFutureProgress *ProgressView::addTask(const QFuture<void> &future,\n                                      const QString &title,\n                                      const QString &type,\n                                      ProgressManager::ProgressFlags flags)\n{\n    removeOldTasks(type);\n    if (m_taskList.size() == 3)\n        removeOneOldTask();\n    FutureProgress *progress = new FutureProgress(this);\n    progress->setTitle(title);\n    progress->setFuture(future);\n\n    m_layout->insertWidget(0, progress);\n    m_taskList.append(progress);\n    progress->setType(type);\n    if (flags.testFlag(ProgressManager::KeepOnFinish)) {\n        progress->setKeepOnFinish(FutureProgress::KeepOnFinishTillUserInteraction);\n    } else {\n        progress->setKeepOnFinish(FutureProgress::DontKeepOnFinish);\n    }\n    connect(progress, SIGNAL(removeMe()), this, SLOT(slotRemoveTask()));\n    return progress;\n}\n\nvoid ProgressView::removeOldTasks(const QString &type, bool keepOne)\n{\n    bool firstFound = !keepOne; \/\/ start with false if we want to keep one\n    QList<FutureProgress *>::iterator i = m_taskList.end();\n    while (i != m_taskList.begin()) {\n        --i;\n        if ((*i)->type() == type) {\n            if (firstFound && (*i)->future().isFinished()) {\n                deleteTask(*i);\n                i = m_taskList.erase(i);\n            }\n            firstFound = true;\n        }\n    }\n}\n\nvoid ProgressView::deleteTask(FutureProgress *progress)\n{\n    layout()->removeWidget(progress);\n    progress->hide();\n    progress->deleteLater();\n}\n\nvoid ProgressView::removeOneOldTask()\n{\n    if (m_taskList.isEmpty())\n        return;\n    \/\/ look for oldest ended process\n    for (QList<FutureProgress *>::iterator i = m_taskList.begin(); i != m_taskList.end(); ++i) {\n        if ((*i)->future().isFinished()) {\n            deleteTask(*i);\n            i = m_taskList.erase(i);\n            return;\n        }\n    }\n    \/\/ no ended process, look for a task type with multiple running tasks and remove the oldest one\n    for (QList<FutureProgress *>::iterator i = m_taskList.begin(); i != m_taskList.end(); ++i) {\n        QString type = (*i)->type();\n\n        int taskCount = 0;\n        foreach (FutureProgress *p, m_taskList)\n            if (p->type() == type)\n                ++taskCount;\n\n        if (taskCount > 1) { \/\/ don't care for optimizations it's only a handful of entries\n            deleteTask(*i);\n            i = m_taskList.erase(i);\n            return;\n        }\n    }\n\n    \/\/ no ended process, no type with multiple processes, just remove the oldest task\n    FutureProgress *task = m_taskList.takeFirst();\n    deleteTask(task);\n}\n\nvoid ProgressView::removeTask(FutureProgress *task)\n{\n    m_taskList.removeAll(task);\n    deleteTask(task);\n}\n\nvoid ProgressView::slotRemoveTask()\n{\n    FutureProgress *progress = qobject_cast<FutureProgress *>(sender());\n    QTC_ASSERT(progress, return);\n    QString type = progress->type();\n    removeTask(progress);\n    removeOldTasks(type, true);\n}\n<commit_msg>ProgressView: Also replace old tasks that are canceling<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 \"progressview.h\"\n#include \"futureprogress.h\"\n\n#include <utils\/qtcassert.h>\n\n#include <QtGui\/QHBoxLayout>\n#include <QtGui\/QVBoxLayout>\n\nusing namespace Core;\nusing namespace Core::Internal;\n\nProgressView::ProgressView(QWidget *parent)\n    : QWidget(parent)\n{\n    m_layout = new QVBoxLayout;\n    setLayout(m_layout);\n    m_layout->setMargin(0);\n    m_layout->setSpacing(0);\n    setWindowTitle(tr(\"Processes\"));\n}\n\nProgressView::~ProgressView()\n{\n    qDeleteAll(m_taskList);\n    m_taskList.clear();\n}\n\nFutureProgress *ProgressView::addTask(const QFuture<void> &future,\n                                      const QString &title,\n                                      const QString &type,\n                                      ProgressManager::ProgressFlags flags)\n{\n    removeOldTasks(type);\n    if (m_taskList.size() == 3)\n        removeOneOldTask();\n    FutureProgress *progress = new FutureProgress(this);\n    progress->setTitle(title);\n    progress->setFuture(future);\n\n    m_layout->insertWidget(0, progress);\n    m_taskList.append(progress);\n    progress->setType(type);\n    if (flags.testFlag(ProgressManager::KeepOnFinish)) {\n        progress->setKeepOnFinish(FutureProgress::KeepOnFinishTillUserInteraction);\n    } else {\n        progress->setKeepOnFinish(FutureProgress::DontKeepOnFinish);\n    }\n    connect(progress, SIGNAL(removeMe()), this, SLOT(slotRemoveTask()));\n    return progress;\n}\n\nvoid ProgressView::removeOldTasks(const QString &type, bool keepOne)\n{\n    bool firstFound = !keepOne; \/\/ start with false if we want to keep one\n    QList<FutureProgress *>::iterator i = m_taskList.end();\n    while (i != m_taskList.begin()) {\n        --i;\n        if ((*i)->type() == type) {\n            if (firstFound && ((*i)->future().isFinished() || (*i)->future().isCanceled())) {\n                deleteTask(*i);\n                i = m_taskList.erase(i);\n            }\n            firstFound = true;\n        }\n    }\n}\n\nvoid ProgressView::deleteTask(FutureProgress *progress)\n{\n    layout()->removeWidget(progress);\n    progress->hide();\n    progress->deleteLater();\n}\n\nvoid ProgressView::removeOneOldTask()\n{\n    if (m_taskList.isEmpty())\n        return;\n    \/\/ look for oldest ended process\n    for (QList<FutureProgress *>::iterator i = m_taskList.begin(); i != m_taskList.end(); ++i) {\n        if ((*i)->future().isFinished()) {\n            deleteTask(*i);\n            i = m_taskList.erase(i);\n            return;\n        }\n    }\n    \/\/ no ended process, look for a task type with multiple running tasks and remove the oldest one\n    for (QList<FutureProgress *>::iterator i = m_taskList.begin(); i != m_taskList.end(); ++i) {\n        QString type = (*i)->type();\n\n        int taskCount = 0;\n        foreach (FutureProgress *p, m_taskList)\n            if (p->type() == type)\n                ++taskCount;\n\n        if (taskCount > 1) { \/\/ don't care for optimizations it's only a handful of entries\n            deleteTask(*i);\n            i = m_taskList.erase(i);\n            return;\n        }\n    }\n\n    \/\/ no ended process, no type with multiple processes, just remove the oldest task\n    FutureProgress *task = m_taskList.takeFirst();\n    deleteTask(task);\n}\n\nvoid ProgressView::removeTask(FutureProgress *task)\n{\n    m_taskList.removeAll(task);\n    deleteTask(task);\n}\n\nvoid ProgressView::slotRemoveTask()\n{\n    FutureProgress *progress = qobject_cast<FutureProgress *>(sender());\n    QTC_ASSERT(progress, return);\n    QString type = progress->type();\n    removeTask(progress);\n    removeOldTasks(type, true);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: interactionhandler.cxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 08:28: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#include <jni.h>\n\n\/\/#include <iostream>\n#include <stdio.h>\n#include <sal\/main.h>\n#include <rtl\/process.h>\n\n#include <cppuhelper\/servicefactory.hxx>\n#include <cppuhelper\/weak.hxx>\n#include <cppuhelper\/bootstrap.hxx>\n#include <osl\/thread.h>\n\n#include <com\/sun\/star\/registry\/XSimpleRegistry.hpp>\n#include <com\/sun\/star\/lang\/XComponent.hpp>\n#include <com\/sun\/star\/lang\/XMultiComponentFactory.hpp>\n#include <com\/sun\/star\/java\/XJavaVM.hpp>\n#include <com\/sun\/star\/registry\/XImplementationRegistration.hpp>\n#include <com\/sun\/star\/java\/XJavaThreadRegister_11.hpp>\n\n#include <com\/sun\/star\/uno\/XCurrentContext.hpp>\n#include <com\/sun\/star\/task\/XInteractionHandler.hpp>\n#include <com\/sun\/star\/task\/XInteractionRequest.hpp>\n#include <com\/sun\/star\/task\/XInteractionContinuation.hpp>\n#include <com\/sun\/star\/task\/XInteractionAbort.hpp>\n#include <com\/sun\/star\/task\/XInteractionRetry.hpp>\n#include <com\/sun\/star\/java\/JavaNotConfiguredException.hpp>\n#include <com\/sun\/star\/java\/MissingJavaRuntimeException.hpp>\n#include <com\/sun\/star\/java\/JavaDisabledException.hpp>\n#include <com\/sun\/star\/java\/JavaVMCreationFailureException.hpp>\n#include <cppuhelper\/implbase1.hxx>\n#include <uno\/current_context.hxx>\nusing namespace std;\nusing namespace rtl;\nusing namespace cppu;\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::lang;\n\/\/using namespace com::sun::star::reflection;\nusing namespace com::sun::star::lang;\nusing namespace com::sun::star::registry;\nusing namespace com::sun::star::java;\nusing namespace com::sun::star::task;\n\n#define OUSTR( x ) OUString(RTL_CONSTASCII_USTRINGPARAM( x ))\n#define INTERACTION_HANDLER_NAME \"java-vm.interaction-handler\"\n\nclass Context: public WeakImplHelper1<XCurrentContext>\n{\n    virtual Any SAL_CALL getValueByName( const OUString& Name ) throw (RuntimeException);\n};\n\nclass InteractionHandler: public WeakImplHelper1<XInteractionHandler>\n{\n    virtual void SAL_CALL handle( const Reference< XInteractionRequest >& Request )\n        throw (RuntimeException);\n};\n\nAny SAL_CALL Context::getValueByName( const OUString& Name) throw (RuntimeException)\n{\n    Any retVal;\n    if( Name.equals( OUSTR(INTERACTION_HANDLER_NAME)))\n    {\n        Reference<XInteractionHandler> handler( static_cast<XWeak*>(new InteractionHandler()),\n                                                UNO_QUERY);\n        retVal <<= handler;\n    }\n    return retVal;\n}\n\nvoid SAL_CALL InteractionHandler::handle( const Reference< XInteractionRequest >& Request )\n        throw (RuntimeException)\n{\n    Any anyExc= Request->getRequest();\n    Sequence<Reference< XInteractionContinuation> >seqCont= Request->getContinuations();\n\n    Reference<XInteractionAbort> abort;\n    Reference<XInteractionRetry> retry;\n\n    for (sal_Int32 i= 0; i < seqCont.getLength(); i++)\n    {\n        abort= Reference<XInteractionAbort>::query( seqCont[i]);\n        if(abort.is())\n            break;\n    }\n    for (sal_Int32 i= 0; i < seqCont.getLength(); i++)\n    {\n        retry= Reference<XInteractionRetry>::query( seqCont[i]);\n        if(retry.is())\n            break;\n    }\n\n\/\/     if( abort.is())\n\/\/         abort->select();\n\n    static int cRetry= 0;\n\n    if( cRetry++ == 5)\n    {\n        if( abort.is())\n            abort->select();\n        return;\n    }\n    if( retry.is())\n         retry->select();\n}\n\nsal_Bool test1(const Reference< XMultiServiceFactory > & xMgr )\n{\n    sal_Bool retVal= sal_True;\n    setCurrentContext( Reference<XCurrentContext>( static_cast<XWeak*>(new Context()), UNO_QUERY));\n\n      OUString sVMService( RTL_CONSTASCII_USTRINGPARAM(\"com.sun.star.java.JavaVirtualMachine\"));\n    Reference<XInterface> xXInt= xMgr->createInstance(sVMService);\n    if( ! xXInt.is())\n        return sal_False;\n    Reference<XJavaVM> xVM( xXInt, UNO_QUERY);\n    if( ! xVM.is())\n        return sal_False;\n\n\n    sal_Int8 arId[16];\n    rtl_getGlobalProcessId((sal_uInt8*) arId);\n\n    Any anyVM;\n    try\n    {\n        anyVM = xVM->getJavaVM( Sequence<sal_Int8>(arId, 16));\n    }\n    catch (JavaNotConfiguredException& e)\n    {\n        OString msg= OUStringToOString(e.Message, osl_getThreadTextEncoding());\n        printf(\"JavaNotConfiguredException: %s\\n\", msg.getStr());\n    }\n    catch (JavaVMCreationFailureException& e)\n    {\n        OString msg= OUStringToOString(e.Message, osl_getThreadTextEncoding());\n        printf(\"JavaVMCreationFailureException: %s\\n\", msg.getStr());\n    }\n    catch (MissingJavaRuntimeException& e)\n    {\n        OString msg= OUStringToOString(e.Message, osl_getThreadTextEncoding());\n        printf(\"MissingJavaRuntimeException: %s\\n\", msg.getStr());\n    }\n    catch (JavaDisabledException& e)\n    {\n        OString msg= OUStringToOString(e.Message, osl_getThreadTextEncoding());\n        printf(\"JavaDisabledException: %s\\n\", msg.getStr());\n    }\n    catch (RuntimeException & e)\n    {\n        OString msg= OUStringToOString(e.Message, osl_getThreadTextEncoding());\n        printf(\"###RuntimeException: %s\\n\", msg.getStr());\n        retVal= sal_False;\n    }\n    return retVal;\n}\n\nSAL_IMPLEMENT_MAIN()\n{\n    Reference<XSimpleRegistry> xreg= createSimpleRegistry();\n    xreg->open( OUString( RTL_CONSTASCII_USTRINGPARAM(\"applicat.rdb\")),\n                               sal_False, sal_False );\n\n    Reference< XComponentContext > context= bootstrap_InitialComponentContext(xreg);\n    Reference<XMultiComponentFactory> fac= context->getServiceManager();\n    Reference<XMultiServiceFactory> xMgr( fac, UNO_QUERY);\n\n    sal_Bool bSucc = sal_False;\n    bSucc= test1(xMgr);\n    Reference< XComponent > xCompContext( context, UNO_QUERY );\n    xCompContext->dispose();\n    return (bSucc ? 0 : -1);\n}\n\n\n<commit_msg>INTEGRATION: CWS pchfix02 (1.5.36); FILE MERGED 2006\/09\/01 17:41:23 kaib 1.5.36.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: interactionhandler.cxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-16 17:43: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_stoc.hxx\"\n\n\n#include <jni.h>\n\n\/\/#include <iostream>\n#include <stdio.h>\n#include <sal\/main.h>\n#include <rtl\/process.h>\n\n#include <cppuhelper\/servicefactory.hxx>\n#include <cppuhelper\/weak.hxx>\n#include <cppuhelper\/bootstrap.hxx>\n#include <osl\/thread.h>\n\n#include <com\/sun\/star\/registry\/XSimpleRegistry.hpp>\n#include <com\/sun\/star\/lang\/XComponent.hpp>\n#include <com\/sun\/star\/lang\/XMultiComponentFactory.hpp>\n#include <com\/sun\/star\/java\/XJavaVM.hpp>\n#include <com\/sun\/star\/registry\/XImplementationRegistration.hpp>\n#include <com\/sun\/star\/java\/XJavaThreadRegister_11.hpp>\n\n#include <com\/sun\/star\/uno\/XCurrentContext.hpp>\n#include <com\/sun\/star\/task\/XInteractionHandler.hpp>\n#include <com\/sun\/star\/task\/XInteractionRequest.hpp>\n#include <com\/sun\/star\/task\/XInteractionContinuation.hpp>\n#include <com\/sun\/star\/task\/XInteractionAbort.hpp>\n#include <com\/sun\/star\/task\/XInteractionRetry.hpp>\n#include <com\/sun\/star\/java\/JavaNotConfiguredException.hpp>\n#include <com\/sun\/star\/java\/MissingJavaRuntimeException.hpp>\n#include <com\/sun\/star\/java\/JavaDisabledException.hpp>\n#include <com\/sun\/star\/java\/JavaVMCreationFailureException.hpp>\n#include <cppuhelper\/implbase1.hxx>\n#include <uno\/current_context.hxx>\nusing namespace std;\nusing namespace rtl;\nusing namespace cppu;\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::lang;\n\/\/using namespace com::sun::star::reflection;\nusing namespace com::sun::star::lang;\nusing namespace com::sun::star::registry;\nusing namespace com::sun::star::java;\nusing namespace com::sun::star::task;\n\n#define OUSTR( x ) OUString(RTL_CONSTASCII_USTRINGPARAM( x ))\n#define INTERACTION_HANDLER_NAME \"java-vm.interaction-handler\"\n\nclass Context: public WeakImplHelper1<XCurrentContext>\n{\n    virtual Any SAL_CALL getValueByName( const OUString& Name ) throw (RuntimeException);\n};\n\nclass InteractionHandler: public WeakImplHelper1<XInteractionHandler>\n{\n    virtual void SAL_CALL handle( const Reference< XInteractionRequest >& Request )\n        throw (RuntimeException);\n};\n\nAny SAL_CALL Context::getValueByName( const OUString& Name) throw (RuntimeException)\n{\n    Any retVal;\n    if( Name.equals( OUSTR(INTERACTION_HANDLER_NAME)))\n    {\n        Reference<XInteractionHandler> handler( static_cast<XWeak*>(new InteractionHandler()),\n                                                UNO_QUERY);\n        retVal <<= handler;\n    }\n    return retVal;\n}\n\nvoid SAL_CALL InteractionHandler::handle( const Reference< XInteractionRequest >& Request )\n        throw (RuntimeException)\n{\n    Any anyExc= Request->getRequest();\n    Sequence<Reference< XInteractionContinuation> >seqCont= Request->getContinuations();\n\n    Reference<XInteractionAbort> abort;\n    Reference<XInteractionRetry> retry;\n\n    for (sal_Int32 i= 0; i < seqCont.getLength(); i++)\n    {\n        abort= Reference<XInteractionAbort>::query( seqCont[i]);\n        if(abort.is())\n            break;\n    }\n    for (sal_Int32 i= 0; i < seqCont.getLength(); i++)\n    {\n        retry= Reference<XInteractionRetry>::query( seqCont[i]);\n        if(retry.is())\n            break;\n    }\n\n\/\/     if( abort.is())\n\/\/         abort->select();\n\n    static int cRetry= 0;\n\n    if( cRetry++ == 5)\n    {\n        if( abort.is())\n            abort->select();\n        return;\n    }\n    if( retry.is())\n         retry->select();\n}\n\nsal_Bool test1(const Reference< XMultiServiceFactory > & xMgr )\n{\n    sal_Bool retVal= sal_True;\n    setCurrentContext( Reference<XCurrentContext>( static_cast<XWeak*>(new Context()), UNO_QUERY));\n\n      OUString sVMService( RTL_CONSTASCII_USTRINGPARAM(\"com.sun.star.java.JavaVirtualMachine\"));\n    Reference<XInterface> xXInt= xMgr->createInstance(sVMService);\n    if( ! xXInt.is())\n        return sal_False;\n    Reference<XJavaVM> xVM( xXInt, UNO_QUERY);\n    if( ! xVM.is())\n        return sal_False;\n\n\n    sal_Int8 arId[16];\n    rtl_getGlobalProcessId((sal_uInt8*) arId);\n\n    Any anyVM;\n    try\n    {\n        anyVM = xVM->getJavaVM( Sequence<sal_Int8>(arId, 16));\n    }\n    catch (JavaNotConfiguredException& e)\n    {\n        OString msg= OUStringToOString(e.Message, osl_getThreadTextEncoding());\n        printf(\"JavaNotConfiguredException: %s\\n\", msg.getStr());\n    }\n    catch (JavaVMCreationFailureException& e)\n    {\n        OString msg= OUStringToOString(e.Message, osl_getThreadTextEncoding());\n        printf(\"JavaVMCreationFailureException: %s\\n\", msg.getStr());\n    }\n    catch (MissingJavaRuntimeException& e)\n    {\n        OString msg= OUStringToOString(e.Message, osl_getThreadTextEncoding());\n        printf(\"MissingJavaRuntimeException: %s\\n\", msg.getStr());\n    }\n    catch (JavaDisabledException& e)\n    {\n        OString msg= OUStringToOString(e.Message, osl_getThreadTextEncoding());\n        printf(\"JavaDisabledException: %s\\n\", msg.getStr());\n    }\n    catch (RuntimeException & e)\n    {\n        OString msg= OUStringToOString(e.Message, osl_getThreadTextEncoding());\n        printf(\"###RuntimeException: %s\\n\", msg.getStr());\n        retVal= sal_False;\n    }\n    return retVal;\n}\n\nSAL_IMPLEMENT_MAIN()\n{\n    Reference<XSimpleRegistry> xreg= createSimpleRegistry();\n    xreg->open( OUString( RTL_CONSTASCII_USTRINGPARAM(\"applicat.rdb\")),\n                               sal_False, sal_False );\n\n    Reference< XComponentContext > context= bootstrap_InitialComponentContext(xreg);\n    Reference<XMultiComponentFactory> fac= context->getServiceManager();\n    Reference<XMultiServiceFactory> xMgr( fac, UNO_QUERY);\n\n    sal_Bool bSucc = sal_False;\n    bSucc= test1(xMgr);\n    Reference< XComponent > xCompContext( context, UNO_QUERY );\n    xCompContext->dispose();\n    return (bSucc ? 0 : -1);\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Corrects sample spacing, and removes a lot of detritus.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/* -*- mode: c++; c-basic-offset:4 -*-\n    uiserver\/echocommand.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 <config-kleopatra.h>\n\n#include \"echocommand.h\"\n\n#include <utils\/input.h>\n#include <utils\/output.h>\n#include <utils\/exception.h>\n\n#include <gpg-error.h>\n\n#include <KLocale>\n\n#include <QVariant>\n#include <QByteArray>\n#include <QIODevice>\n#include <QList>\n\n#include <string>\n#include <algorithm>\n\nusing namespace Kleo;\nusing namespace boost;\n\nstatic const char option_prefix[] = \"prefix\";\n\nclass EchoCommand::Private {\npublic:\n    Private() : operationsInFlight( 0 ), buffer() {}\n\n    int operationsInFlight;\n    QByteArray buffer;\n};\n\nEchoCommand::EchoCommand()\n    : QObject(), AssuanCommandMixin<EchoCommand>(), d( new Private ) {}\n\nEchoCommand::~EchoCommand() {}\n\nint EchoCommand::doStart() {\n\n    const std::vector< shared_ptr<Input> > in = inputs(), msg = messages();\n    const std::vector< shared_ptr<Output> > out = outputs();\n\n    if ( !in.empty() && out.empty() )\n        return makeError( GPG_ERR_NOT_SUPPORTED );\n\n    if ( !msg.empty() )\n        return makeError( GPG_ERR_NOT_SUPPORTED );\n\n    if ( hasOption( option_prefix ) && !option( option_prefix ).toByteArray().isEmpty() )\n        return makeError( GPG_ERR_NOT_IMPLEMENTED );\n\n    std::string keyword;\n    if ( hasOption( \"inquire\" ) ) {\n        keyword = option(\"inquire\").toString().toStdString();\n        if ( keyword.empty() )\n            return makeError( GPG_ERR_INV_ARG );\n    }\n\n    const std::string output = option(\"text\").toString().toStdString();\n\n    \/\/ aaand ACTION:\n\n    \/\/ 1. echo the command line though the status channel\n    sendStatus( \"ECHO\", output.empty() ? \"\" : output.c_str() );\n\n    \/\/ 2. if --inquire was given, inquire more data from the client:\n    if ( !keyword.empty() )\n        if ( const int err = inquire( keyword.c_str(), this,\n                                      SLOT(slotInquireData(int,QByteArray)) ) )\n            return err;\n        else\n            ++d->operationsInFlight;\n\n    \/\/ 3. if INPUT was given, start the data pump for input->output\n    if ( const shared_ptr<QIODevice> i = in.at(0)->ioDevice() ) {\n        const shared_ptr<QIODevice> o = out.at(0)->ioDevice();\n\n        ++d->operationsInFlight;\n\n        connect( i.get(), SIGNAL(readyRead()), this, SLOT(slotInputReadyRead()) );\n        connect( o.get(), SIGNAL(bytesWritten(qint64)), this, SLOT(slotOutputBytesWritten()) );\n\n        if ( i->bytesAvailable() )\n            slotInputReadyRead();\n    }\n\n    if ( !d->operationsInFlight )\n        done();\n    return 0;\n}\n\nvoid EchoCommand::doCanceled() {\n\n}\n\nvoid EchoCommand::slotInquireData( int rc, const QByteArray & data ) {\n\n    --d->operationsInFlight;\n\n    if ( rc ) {\n        done( rc );\n        return;\n    }\n\n    try {\n        sendStatus( \"ECHOINQ\", data );\n        if ( !d->operationsInFlight )\n            done();\n    } catch ( const Exception & e ) {\n        done( e.error(), e.message() );\n    } catch ( const std::exception & e ) {\n        done( makeError( GPG_ERR_UNEXPECTED ),\n              i18n(\"Caught unexpected exception in SignCommand::Private::slotMicAlgDetermined: %1\",\n                   QString::fromLocal8Bit( e.what() ) ) );\n    } catch ( ... ) {\n        done( makeError( GPG_ERR_UNEXPECTED ),\n              i18n(\"Caught unknown exception in SignCommand::Private::slotMicAlgDetermined\") );\n    }\n\n}\n\nvoid EchoCommand::slotInputReadyRead() {\n    const shared_ptr<QIODevice> in = inputs().at(0)->ioDevice();\n    assert( in );\n\n    QByteArray buffer;\n    buffer.resize( in->bytesAvailable() );\n    const qint64 read = in->read( buffer.data(), buffer.size() );\n    if ( read == - 1 ) {\n        done( makeError( GPG_ERR_EIO ) );\n        return;\n    }\n    if ( read == 0 || !in->isSequential() && read == in->size() )\n        in->close();\n\n    buffer.resize( read );\n    d->buffer += buffer;\n\n    slotOutputBytesWritten();\n}\n\n\nvoid EchoCommand::slotOutputBytesWritten() {\n    const shared_ptr<QIODevice> out = outputs().at(0)->ioDevice();\n    assert( out );\n\n    if ( !d->buffer.isEmpty() ) {\n\n        if ( out->bytesToWrite() )\n            return;\n\n        const qint64 written = out->write( d->buffer );\n        if ( written == -1 ) {\n            done( makeError( GPG_ERR_EIO ) );\n            return;\n        }\n        d->buffer.remove( 0, written );\n\n    }\n\n    if ( out->isOpen() && d->buffer.isEmpty() && !inputs().at(0)->ioDevice()->isOpen() ) {\n        out->close();\n        if ( !--d->operationsInFlight )\n            done();\n    }\n}\n\n#include \"moc_echocommand.cpp\"\n<commit_msg>complete with some more parentheses<commit_after>\/* -*- mode: c++; c-basic-offset:4 -*-\n    uiserver\/echocommand.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 <config-kleopatra.h>\n\n#include \"echocommand.h\"\n\n#include <utils\/input.h>\n#include <utils\/output.h>\n#include <utils\/exception.h>\n\n#include <gpg-error.h>\n\n#include <KLocale>\n\n#include <QVariant>\n#include <QByteArray>\n#include <QIODevice>\n#include <QList>\n\n#include <string>\n#include <algorithm>\n\nusing namespace Kleo;\nusing namespace boost;\n\nstatic const char option_prefix[] = \"prefix\";\n\nclass EchoCommand::Private {\npublic:\n    Private() : operationsInFlight( 0 ), buffer() {}\n\n    int operationsInFlight;\n    QByteArray buffer;\n};\n\nEchoCommand::EchoCommand()\n    : QObject(), AssuanCommandMixin<EchoCommand>(), d( new Private ) {}\n\nEchoCommand::~EchoCommand() {}\n\nint EchoCommand::doStart() {\n\n    const std::vector< shared_ptr<Input> > in = inputs(), msg = messages();\n    const std::vector< shared_ptr<Output> > out = outputs();\n\n    if ( !in.empty() && out.empty() )\n        return makeError( GPG_ERR_NOT_SUPPORTED );\n\n    if ( !msg.empty() )\n        return makeError( GPG_ERR_NOT_SUPPORTED );\n\n    if ( hasOption( option_prefix ) && !option( option_prefix ).toByteArray().isEmpty() )\n        return makeError( GPG_ERR_NOT_IMPLEMENTED );\n\n    std::string keyword;\n    if ( hasOption( \"inquire\" ) ) {\n        keyword = option(\"inquire\").toString().toStdString();\n        if ( keyword.empty() )\n            return makeError( GPG_ERR_INV_ARG );\n    }\n\n    const std::string output = option(\"text\").toString().toStdString();\n\n    \/\/ aaand ACTION:\n\n    \/\/ 1. echo the command line though the status channel\n    sendStatus( \"ECHO\", output.empty() ? \"\" : output.c_str() );\n\n    \/\/ 2. if --inquire was given, inquire more data from the client:\n    if ( !keyword.empty() ) {\n        if ( const int err = inquire( keyword.c_str(), this,\n                                      SLOT(slotInquireData(int,QByteArray)) ) )\n            return err;\n        else\n            ++d->operationsInFlight;\n    }\n\n    \/\/ 3. if INPUT was given, start the data pump for input->output\n    if ( const shared_ptr<QIODevice> i = in.at(0)->ioDevice() ) {\n        const shared_ptr<QIODevice> o = out.at(0)->ioDevice();\n\n        ++d->operationsInFlight;\n\n        connect( i.get(), SIGNAL(readyRead()), this, SLOT(slotInputReadyRead()) );\n        connect( o.get(), SIGNAL(bytesWritten(qint64)), this, SLOT(slotOutputBytesWritten()) );\n\n        if ( i->bytesAvailable() )\n            slotInputReadyRead();\n    }\n\n    if ( !d->operationsInFlight )\n        done();\n    return 0;\n}\n\nvoid EchoCommand::doCanceled() {\n\n}\n\nvoid EchoCommand::slotInquireData( int rc, const QByteArray & data ) {\n\n    --d->operationsInFlight;\n\n    if ( rc ) {\n        done( rc );\n        return;\n    }\n\n    try {\n        sendStatus( \"ECHOINQ\", data );\n        if ( !d->operationsInFlight )\n            done();\n    } catch ( const Exception & e ) {\n        done( e.error(), e.message() );\n    } catch ( const std::exception & e ) {\n        done( makeError( GPG_ERR_UNEXPECTED ),\n              i18n(\"Caught unexpected exception in SignCommand::Private::slotMicAlgDetermined: %1\",\n                   QString::fromLocal8Bit( e.what() ) ) );\n    } catch ( ... ) {\n        done( makeError( GPG_ERR_UNEXPECTED ),\n              i18n(\"Caught unknown exception in SignCommand::Private::slotMicAlgDetermined\") );\n    }\n\n}\n\nvoid EchoCommand::slotInputReadyRead() {\n    const shared_ptr<QIODevice> in = inputs().at(0)->ioDevice();\n    assert( in );\n\n    QByteArray buffer;\n    buffer.resize( in->bytesAvailable() );\n    const qint64 read = in->read( buffer.data(), buffer.size() );\n    if ( read == - 1 ) {\n        done( makeError( GPG_ERR_EIO ) );\n        return;\n    }\n    if ( read == 0 || (!in->isSequential() && read == in->size()) )\n        in->close();\n\n    buffer.resize( read );\n    d->buffer += buffer;\n\n    slotOutputBytesWritten();\n}\n\n\nvoid EchoCommand::slotOutputBytesWritten() {\n    const shared_ptr<QIODevice> out = outputs().at(0)->ioDevice();\n    assert( out );\n\n    if ( !d->buffer.isEmpty() ) {\n\n        if ( out->bytesToWrite() )\n            return;\n\n        const qint64 written = out->write( d->buffer );\n        if ( written == -1 ) {\n            done( makeError( GPG_ERR_EIO ) );\n            return;\n        }\n        d->buffer.remove( 0, written );\n\n    }\n\n    if ( out->isOpen() && d->buffer.isEmpty() && !inputs().at(0)->ioDevice()->isOpen() ) {\n        out->close();\n        if ( !--d->operationsInFlight )\n            done();\n    }\n}\n\n#include \"moc_echocommand.cpp\"\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: XMLDetectiveContext.hxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: hr $ $Date: 2002-02-08 15:50: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 _SC_XMLDETECTIVECONTEXT_HXX\n#define _SC_XMLDETECTIVECONTEXT_HXX\n\n#ifndef _XMLOFF_XMLIMP_HXX\n#include <xmloff\/xmlimp.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_TABLE_CELLRANGEADDRESS_HPP_\n#include <com\/sun\/star\/table\/CellRangeAddress.hpp>\n#endif\n\n#ifndef SC_DETFUNC_HXX\n#include \"detfunc.hxx\"\n#endif\n#ifndef SC_DETDATA_HXX\n#include \"detdata.hxx\"\n#endif\n\n#ifndef __SGI_STL_LIST\n#include <list>\n#endif\n\nclass ScXMLImport;\n\n\n\/\/___________________________________________________________________\n\nstruct ScMyImpDetectiveObj\n{\n    ScRange                     aSourceRange;\n    ScDetectiveObjType          eObjType;\n    sal_Bool                    bHasError : 1;\n\n                                ScMyImpDetectiveObj();\n};\n\ntypedef ::std::vector< ScMyImpDetectiveObj > ScMyImpDetectiveObjVec;\n\n\n\/\/___________________________________________________________________\n\nstruct ScMyImpDetectiveOp\n{\n    ScAddress                   aPosition;\n    ScDetOpType                 eOpType;\n    sal_Int32                   nIndex;\n\n    inline                      ScMyImpDetectiveOp() : nIndex( -1 ) {}\n    sal_Bool                    operator<(const ScMyImpDetectiveOp& rDetOp) const;\n};\n\ntypedef ::std::list< ScMyImpDetectiveOp > ScMyImpDetectiveOpList;\n\nclass ScMyImpDetectiveOpArray\n{\nprivate:\n    ScMyImpDetectiveOpList      aDetectiveOpList;\n\npublic:\n    inline                      ScMyImpDetectiveOpArray() :\n                                    aDetectiveOpList()  {}\n\n    inline void                 AddDetectiveOp( const ScMyImpDetectiveOp& rDetOp )\n                                    { aDetectiveOpList.push_back( rDetOp ); }\n\n    void                        Sort();\n    sal_Bool                    GetFirstOp( ScMyImpDetectiveOp& rDetOp );\n};\n\n\n\/\/___________________________________________________________________\n\nclass ScXMLDetectiveContext : public SvXMLImportContext\n{\nprivate:\n    ScMyImpDetectiveObjVec*     pDetectiveObjVec;\n\n    const ScXMLImport&          GetScImport() const { return (const ScXMLImport&)GetImport(); }\n    ScXMLImport&                GetScImport()       { return (ScXMLImport&)GetImport(); }\n\npublic:\n                                ScXMLDetectiveContext(\n                                    ScXMLImport& rImport,\n                                    USHORT nPrfx,\n                                    const ::rtl::OUString& rLName,\n                                    ScMyImpDetectiveObjVec* pNewDetectiveObjVec\n                                    );\n    virtual                     ~ScXMLDetectiveContext();\n\n    virtual SvXMLImportContext* CreateChildContext(\n                                    USHORT nPrefix,\n                                    const ::rtl::OUString& rLocalName,\n                                    const ::com::sun::star::uno::Reference< ::com::sun::star::xml::sax::XAttributeList >& xAttrList\n                                    );\n    virtual void                EndElement();\n};\n\n\n\/\/___________________________________________________________________\n\nclass ScXMLDetectiveHighlightedContext : public SvXMLImportContext\n{\nprivate:\n    ScMyImpDetectiveObjVec*     pDetectiveObjVec;\n    ScMyImpDetectiveObj         aDetectiveObj;\n    sal_Bool                    bValid : 1;\n\n    const ScXMLImport&          GetScImport() const { return (const ScXMLImport&)GetImport(); }\n    ScXMLImport&                GetScImport()       { return (ScXMLImport&)GetImport(); }\n\npublic:\n                                ScXMLDetectiveHighlightedContext(\n                                    ScXMLImport& rImport,\n                                    USHORT nPrfx,\n                                    const ::rtl::OUString& rLName,\n                                    const ::com::sun::star::uno::Reference< ::com::sun::star::xml::sax::XAttributeList >& xAttrList,\n                                    ScMyImpDetectiveObjVec* pNewDetectiveObjVec\n                                    );\n    virtual                     ~ScXMLDetectiveHighlightedContext();\n\n    virtual SvXMLImportContext* CreateChildContext(\n                                    USHORT nPrefix,\n                                    const ::rtl::OUString& rLocalName,\n                                    const ::com::sun::star::uno::Reference< ::com::sun::star::xml::sax::XAttributeList >& xAttrList\n                                    );\n    virtual void                EndElement();\n};\n\n\n\/\/___________________________________________________________________\n\nclass ScXMLDetectiveOperationContext : public SvXMLImportContext\n{\nprivate:\n    ScMyImpDetectiveOp          aDetectiveOp;\n    sal_Bool                    bHasType : 1;\n\n    const ScXMLImport&          GetScImport() const { return (const ScXMLImport&)GetImport(); }\n    ScXMLImport&                GetScImport()       { return (ScXMLImport&)GetImport(); }\n\npublic:\n                                ScXMLDetectiveOperationContext(\n                                    ScXMLImport& rImport,\n                                    USHORT nPrfx,\n                                    const ::rtl::OUString& rLName,\n                                    const ::com::sun::star::uno::Reference< ::com::sun::star::xml::sax::XAttributeList >& xAttrList\n                                    );\n    virtual                     ~ScXMLDetectiveOperationContext();\n\n    virtual SvXMLImportContext* CreateChildContext(\n                                    USHORT nPrefix,\n                                    const ::rtl::OUString& rLocalName,\n                                    const ::com::sun::star::uno::Reference< ::com::sun::star::xml::sax::XAttributeList >& xAttrList\n                                    );\n    virtual void                EndElement();\n};\n\n\n#endif\n\n<commit_msg>INTEGRATION: CWS calcuno01 (1.8.318); FILE MERGED 2004\/01\/05 11:55:20 sab 1.8.318.1: #i22706#; improve API using<commit_after>\/*************************************************************************\n *\n *  $RCSfile: XMLDetectiveContext.hxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: vg $ $Date: 2005-03-23 12:48: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 _SC_XMLDETECTIVECONTEXT_HXX\n#define _SC_XMLDETECTIVECONTEXT_HXX\n\n#ifndef _XMLOFF_XMLIMP_HXX\n#include <xmloff\/xmlimp.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_TABLE_CELLRANGEADDRESS_HPP_\n#include <com\/sun\/star\/table\/CellRangeAddress.hpp>\n#endif\n\n#ifndef SC_DETFUNC_HXX\n#include \"detfunc.hxx\"\n#endif\n#ifndef SC_DETDATA_HXX\n#include \"detdata.hxx\"\n#endif\n\n#ifndef __SGI_STL_LIST\n#include <list>\n#endif\n\nclass ScXMLImport;\n\n\n\/\/___________________________________________________________________\n\nstruct ScMyImpDetectiveObj\n{\n    ScRange                     aSourceRange;\n    ScDetectiveObjType          eObjType;\n    sal_Bool                    bHasError;\n\n                                ScMyImpDetectiveObj();\n};\n\ntypedef ::std::vector< ScMyImpDetectiveObj > ScMyImpDetectiveObjVec;\n\n\n\/\/___________________________________________________________________\n\nstruct ScMyImpDetectiveOp\n{\n    ScAddress                   aPosition;\n    ScDetOpType                 eOpType;\n    sal_Int32                   nIndex;\n\n    inline                      ScMyImpDetectiveOp() : nIndex( -1 ) {}\n    sal_Bool                    operator<(const ScMyImpDetectiveOp& rDetOp) const;\n};\n\ntypedef ::std::list< ScMyImpDetectiveOp > ScMyImpDetectiveOpList;\n\nclass ScMyImpDetectiveOpArray\n{\nprivate:\n    ScMyImpDetectiveOpList      aDetectiveOpList;\n\npublic:\n    inline                      ScMyImpDetectiveOpArray() :\n                                    aDetectiveOpList()  {}\n\n    inline void                 AddDetectiveOp( const ScMyImpDetectiveOp& rDetOp )\n                                    { aDetectiveOpList.push_back( rDetOp ); }\n\n    void                        Sort();\n    sal_Bool                    GetFirstOp( ScMyImpDetectiveOp& rDetOp );\n};\n\n\n\/\/___________________________________________________________________\n\nclass ScXMLDetectiveContext : public SvXMLImportContext\n{\nprivate:\n    ScMyImpDetectiveObjVec*     pDetectiveObjVec;\n\n    const ScXMLImport&          GetScImport() const { return (const ScXMLImport&)GetImport(); }\n    ScXMLImport&                GetScImport()       { return (ScXMLImport&)GetImport(); }\n\npublic:\n                                ScXMLDetectiveContext(\n                                    ScXMLImport& rImport,\n                                    USHORT nPrfx,\n                                    const ::rtl::OUString& rLName,\n                                    ScMyImpDetectiveObjVec* pNewDetectiveObjVec\n                                    );\n    virtual                     ~ScXMLDetectiveContext();\n\n    virtual SvXMLImportContext* CreateChildContext(\n                                    USHORT nPrefix,\n                                    const ::rtl::OUString& rLocalName,\n                                    const ::com::sun::star::uno::Reference< ::com::sun::star::xml::sax::XAttributeList >& xAttrList\n                                    );\n    virtual void                EndElement();\n};\n\n\n\/\/___________________________________________________________________\n\nclass ScXMLDetectiveHighlightedContext : public SvXMLImportContext\n{\nprivate:\n    ScMyImpDetectiveObjVec*     pDetectiveObjVec;\n    ScMyImpDetectiveObj         aDetectiveObj;\n    sal_Bool                    bValid;\n\n    const ScXMLImport&          GetScImport() const { return (const ScXMLImport&)GetImport(); }\n    ScXMLImport&                GetScImport()       { return (ScXMLImport&)GetImport(); }\n\npublic:\n                                ScXMLDetectiveHighlightedContext(\n                                    ScXMLImport& rImport,\n                                    USHORT nPrfx,\n                                    const ::rtl::OUString& rLName,\n                                    const ::com::sun::star::uno::Reference< ::com::sun::star::xml::sax::XAttributeList >& xAttrList,\n                                    ScMyImpDetectiveObjVec* pNewDetectiveObjVec\n                                    );\n    virtual                     ~ScXMLDetectiveHighlightedContext();\n\n    virtual SvXMLImportContext* CreateChildContext(\n                                    USHORT nPrefix,\n                                    const ::rtl::OUString& rLocalName,\n                                    const ::com::sun::star::uno::Reference< ::com::sun::star::xml::sax::XAttributeList >& xAttrList\n                                    );\n    virtual void                EndElement();\n};\n\n\n\/\/___________________________________________________________________\n\nclass ScXMLDetectiveOperationContext : public SvXMLImportContext\n{\nprivate:\n    ScMyImpDetectiveOp          aDetectiveOp;\n    sal_Bool                    bHasType;\n\n    const ScXMLImport&          GetScImport() const { return (const ScXMLImport&)GetImport(); }\n    ScXMLImport&                GetScImport()       { return (ScXMLImport&)GetImport(); }\n\npublic:\n                                ScXMLDetectiveOperationContext(\n                                    ScXMLImport& rImport,\n                                    USHORT nPrfx,\n                                    const ::rtl::OUString& rLName,\n                                    const ::com::sun::star::uno::Reference< ::com::sun::star::xml::sax::XAttributeList >& xAttrList\n                                    );\n    virtual                     ~ScXMLDetectiveOperationContext();\n\n    virtual SvXMLImportContext* CreateChildContext(\n                                    USHORT nPrefix,\n                                    const ::rtl::OUString& rLocalName,\n                                    const ::com::sun::star::uno::Reference< ::com::sun::star::xml::sax::XAttributeList >& xAttrList\n                                    );\n    virtual void                EndElement();\n};\n\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- mode: c++; c-basic-offset:4 -*-\n    uiserver\/signcommand.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 \"signcommand.h\"\n#include \"kleo-assuan.h\"\n#include \"keyselectionjob.h\"\n\n#include \"utils\/stl_util.h\"\n\n#include <kleo\/keylistjob.h>\n#include <kleo\/signjob.h>\n#include <kleo\/cryptobackendfactory.h>\n\n#include <gpgme++\/data.h>\n#include <gpgme++\/error.h>\n#include <gpgme++\/key.h>\n#include <gpgme++\/keylistresult.h>\n#include <gpgme++\/signingresult.h>\n\n#include <KLocale>\n\n#include <QIODevice>\n#include <QString>\n#include <QStringList>\n#include <QObject>\n#include <QDebug>\n\n#include <boost\/bind.hpp>\n\nusing namespace Kleo;\n\nnamespace {\n    template <template <typename T> class Op>\n    struct ByProtocol {\n        typedef bool result_type;\n\n        bool operator()( const GpgME::Key & lhs, const GpgME::Key & rhs ) const {\n            return Op<int>()( qstricmp( lhs.protocolAsString(), rhs.protocolAsString() ), 0 );\n        }\n        bool operator()( const GpgME::Key & lhs, const char * rhs ) const {\n            return Op<int>()( qstricmp( lhs.protocolAsString(), rhs ), 0 );\n        }\n        bool operator()( const char * lhs, const GpgME::Key & rhs ) const {\n            return Op<int>()( qstricmp( lhs, rhs.protocolAsString() ), 0 );\n        }\n        bool operator()( const char * lhs, const char * rhs ) const {\n            return Op<int>()( qstricmp( lhs, rhs ), 0 );\n        }\n    };\n\n}\n\nclass SignCommand::Private\n  : public AssuanCommandPrivateBaseMixin<SignCommand::Private, SignCommand>\n{\n    Q_OBJECT\npublic:\n    Private( SignCommand * qq )\n        :AssuanCommandPrivateBaseMixin<SignCommand::Private, SignCommand>()\n        , q( qq ), m_signJobs( 0 ), m_statusSent( 0 )\n    {}\n    virtual ~Private() {}\n    \n    void checkInputs();\n    void startKeySelection();\n    void startSignJobs( const std::vector<GpgME::Key>& keys );\n    void showKeySelectionDialog();\n    \n    struct Input {\n        QIODevice* data;\n        QString dataFileName;\n        unsigned int id;\n    };\n    \n    struct Result {\n        GpgME::SigningResult result;\n        QByteArray data;\n        unsigned int id;\n        unsigned int error;\n        QString errorString;\n    };\n\n    SignCommand *q;\n\nprivate Q_SLOTS:\n    void slotKeySelectionResult( const std::vector<GpgME::Key>& );\n    void slotKeySelectionError( const GpgME::Error& error, const GpgME::KeyListResult& );\n    void slotSigningResult( const GpgME::SigningResult & result, const QByteArray & signature );\nprivate:\n    bool trySendingStatus( const QString & str );\n    \n    std::vector<Input> m_inputs;\n    QMap<int, Result> m_results;\n    QMap<const SignJob*, unsigned int> m_jobs;\n    int m_signJobs;\n    int m_statusSent;\n};\n\nvoid SignCommand::Private::checkInputs()\n{\n    const int numInputs = q->numBulkInputDevices( \"INPUT\" );\n    const int numOutputs = q->numBulkOutputDevices( \"OUTPUT\" );\n    const int numMessages = q->numBulkInputDevices( \"MESSAGE\" );\n\n    \/\/TODO use better error code if possible\n    if ( numMessages != 0 )\n        throw assuan_exception(makeError( GPG_ERR_ASS_NO_INPUT ), i18n( \"Only INPUT and OUTPUT can be provided to the sign command, MESSAGE\") ); \n       \n    \/\/ either the output is discarded, or there ar as many as inputs\n    \/\/TODO use better error code if possible\n    if ( numOutputs > 0 && numInputs != numOutputs )\n        throw assuan_exception( makeError( GPG_ERR_ASS_NO_INPUT ),  i18n( \"For each INPUT there needs to be an OUTPUT\") );\n\n    for ( int i = 0; i < numInputs; ++i ) {\n        Input input;\n        input.id = i;\n        input.data = q->bulkInputDevice( \"INPUT\", i );\n        input.dataFileName = q->bulkInputDeviceFileName( \"INPUT\", i );\n\n        m_inputs.push_back( input );\n    }\n}\n\nvoid SignCommand::Private::startKeySelection()\n{\n    KeySelectionJob* job = new KeySelectionJob( this );\n    job->setSecretKeysOnly( true );\n    job->setPatterns( q->senders() ); \/\/ FIXME\n    job->setSilent( q->hasOption( \"silent\" ) );\n    connect( job, SIGNAL( error( GpgME::Error, GpgME::KeyListResult ) ),\n             this, SLOT( slotKeySelectionError( GpgME::Error, GpgME::KeyListResult ) ) );\n    connect( job, SIGNAL( result( std::vector<GpgME::Key> ) ),\n             this, SLOT( slotKeySelectionResult( std::vector<GpgME::Key> ) ) );\n    job->start();\n}\n\nvoid SignCommand::Private::startSignJobs( const std::vector<GpgME::Key>& keys )\n{\n    \/\/ make sure the keys are all of the same type\n    \/\/ FIXME reasonable assumption?\n    if ( keys.empty() || !kdtools::all( keys.begin(), keys.end(), boost::bind( ByProtocol<std::equal_to>(), _1, keys.front() )  ) ) {\n        q->done();\n        return;\n    }\n    const CryptoBackend::Protocol* backend = CryptoBackendFactory::instance()->protocol( keys.front().protocolAsString() );\n    \n    assert( backend );\n    \n    Q_FOREACH( const Input input, m_inputs ) {\n        SignJob *job = backend->signJob( true, true );\n        connect( job, SIGNAL( result( GpgME::SigningResult, QByteArray ) ),\n                 this, SLOT( slotSigningResult( GpgME::SigningResult, QByteArray ) ) );\n        \/\/ FIXME port to iodevice\n        if ( const GpgME::Error err = job->start( keys, input.data->readAll(), q->hasOption( \"detached\" ) ? GpgME::Detached : GpgME::NormalSignatureMode ) ) {\n            q->done( err );\n            return;\n        }\n        m_jobs.insert( job, input.id );\n        m_signJobs++;\n    }\n}\n\nvoid SignCommand::Private::slotKeySelectionResult( const std::vector<GpgME::Key>& keys )\n{\n    \/\/ fire off the sign jobs\n    startSignJobs( keys );\n}\n\nvoid SignCommand::Private::slotKeySelectionError( const GpgME::Error& error, const GpgME::KeyListResult& )\n{\n    assert( error || error.isCanceled() );\n    if ( error.isCanceled() )\n        q->done( error, i18n( \"User canceled key selection\" ) );\n    else\n        q->done( error, i18n( \"Error while listing and selecting private keys\" ) );\n\n}\n\nbool SignCommand::Private::trySendingStatus( const QString & str )\n{\n    if ( const int err = q->sendStatus( \"SIGN\", str ) ) {\n        QString errorString = i18n(\"Problem writing out the signature.\");\n        q->done( err, errorString );\n        return false;\n    }\n    return true;\n}\n\nvoid SignCommand::Private::slotSigningResult( const GpgME::SigningResult & result, const QByteArray & signature )\n{\n    const SignJob * const job = qobject_cast<SignJob*>( sender() );\n    assert( job );\n    assert( m_jobs.contains( job ) );\n    const unsigned int id = m_jobs[job];\n    \n    {\n        Result res;\n        res.result = result;\n        res.data = signature;\n        res.id = id;\n        m_results.insert( id, res );\n    }\n    \/\/ send status for all results received so far, but in order of id\n    while ( m_results.contains( m_statusSent ) ) {\n       SignCommand::Private::Result result = m_results[m_statusSent];\n       QString resultString;\n       try {\n           const GpgME::SigningResult & signres = result.result; \n           assert( !signres.isNull() );\n               \n           const GpgME::Error signError = signres.error();\n           if ( signError )\n               throw assuan_exception( signError, i18n( \"Signing failed: \" ) );\n           \/\/ FIXME adjust for smime?\n           const QString filename = q->bulkInputDeviceFileName( \"INPUT\", m_statusSent ) + \".sig\";\n           writeToOutputDeviceOrAskForFileName( result.id, result.data, filename );\n           resultString = \"OK - Signature written\";\n       } catch ( const assuan_exception& e ) {\n           result.error = e.error_code();\n           result.errorString = e.what();\n           m_results[result.id] = result;\n           resultString = \"ERR \" + result.errorString;\n           \/\/ FIXME ask to continue or cancel\n       }\n       if ( !trySendingStatus( resultString ) ) \/\/ emit done on error\n           return;\n       \n       m_statusSent++;\n    }\n    \n    if ( --m_signJobs == 0 )\n        q->done();\n}\n\nSignCommand::SignCommand()\n:d( new Private( this ) )\n{\n}\n\nSignCommand::~SignCommand()\n{\n}\n\nint SignCommand::doStart()\n{\n    try {\n        d->checkInputs();\n        d->startKeySelection();\n    } catch ( const assuan_exception& e ) {\n        done( e.error_code(), e.what());\n        return e.error_code();\n    }\n    \n    return 0;\n}\n\nvoid SignCommand::doCanceled()\n{\n}\n\n#include \"signcommand.moc\"\n<commit_msg>Report back the MICALG tot he client<commit_after>\/* -*- mode: c++; c-basic-offset:4 -*-\n    uiserver\/signcommand.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 \"signcommand.h\"\n#include \"kleo-assuan.h\"\n#include \"keyselectionjob.h\"\n\n#include \"utils\/stl_util.h\"\n\n#include <kleo\/keylistjob.h>\n#include <kleo\/signjob.h>\n#include <kleo\/cryptobackendfactory.h>\n\n#include <gpgme++\/data.h>\n#include <gpgme++\/error.h>\n#include <gpgme++\/key.h>\n#include <gpgme++\/keylistresult.h>\n#include <gpgme++\/signingresult.h>\n\n#include <KLocale>\n\n#include <QIODevice>\n#include <QString>\n#include <QStringList>\n#include <QObject>\n#include <QDebug>\n\n#include <boost\/bind.hpp>\n\nusing namespace Kleo;\n\nnamespace {\n    template <template <typename T> class Op>\n    struct ByProtocol {\n        typedef bool result_type;\n\n        bool operator()( const GpgME::Key & lhs, const GpgME::Key & rhs ) const {\n            return Op<int>()( qstricmp( lhs.protocolAsString(), rhs.protocolAsString() ), 0 );\n        }\n        bool operator()( const GpgME::Key & lhs, const char * rhs ) const {\n            return Op<int>()( qstricmp( lhs.protocolAsString(), rhs ), 0 );\n        }\n        bool operator()( const char * lhs, const GpgME::Key & rhs ) const {\n            return Op<int>()( qstricmp( lhs, rhs.protocolAsString() ), 0 );\n        }\n        bool operator()( const char * lhs, const char * rhs ) const {\n            return Op<int>()( qstricmp( lhs, rhs ), 0 );\n        }\n    };\n\n}\n\nclass SignCommand::Private\n  : public AssuanCommandPrivateBaseMixin<SignCommand::Private, SignCommand>\n{\n    Q_OBJECT\npublic:\n    Private( SignCommand * qq )\n        :AssuanCommandPrivateBaseMixin<SignCommand::Private, SignCommand>()\n        , q( qq ), m_signJobs( 0 ), m_statusSent( 0 )\n    {}\n    virtual ~Private() {}\n    \n    void checkInputs();\n    void startKeySelection();\n    void startSignJobs( const std::vector<GpgME::Key>& keys );\n    void showKeySelectionDialog();\n    \n    struct Input {\n        QIODevice* data;\n        QString dataFileName;\n        unsigned int id;\n    };\n    \n    struct Result {\n        GpgME::SigningResult result;\n        QByteArray data;\n        unsigned int id;\n        unsigned int error;\n        QString errorString;\n    };\n\n    SignCommand *q;\n\nprivate Q_SLOTS:\n    void slotKeySelectionResult( const std::vector<GpgME::Key>& );\n    void slotKeySelectionError( const GpgME::Error& error, const GpgME::KeyListResult& );\n    void slotSigningResult( const GpgME::SigningResult & result, const QByteArray & signature );\nprivate:\n    bool trySendingStatus( const QString & str );\n    \n    std::vector<Input> m_inputs;\n    QMap<int, Result> m_results;\n    QMap<const SignJob*, unsigned int> m_jobs;\n    int m_signJobs;\n    int m_statusSent;\n};\n\nvoid SignCommand::Private::checkInputs()\n{\n    const int numInputs = q->numBulkInputDevices( \"INPUT\" );\n    const int numOutputs = q->numBulkOutputDevices( \"OUTPUT\" );\n    const int numMessages = q->numBulkInputDevices( \"MESSAGE\" );\n\n    \/\/TODO use better error code if possible\n    if ( numMessages != 0 )\n        throw assuan_exception(makeError( GPG_ERR_ASS_NO_INPUT ), i18n( \"Only INPUT and OUTPUT can be provided to the sign command, MESSAGE\") ); \n       \n    \/\/ either the output is discarded, or there ar as many as inputs\n    \/\/TODO use better error code if possible\n    if ( numOutputs > 0 && numInputs != numOutputs )\n        throw assuan_exception( makeError( GPG_ERR_ASS_NO_INPUT ),  i18n( \"For each INPUT there needs to be an OUTPUT\") );\n\n    for ( int i = 0; i < numInputs; ++i ) {\n        Input input;\n        input.id = i;\n        input.data = q->bulkInputDevice( \"INPUT\", i );\n        input.dataFileName = q->bulkInputDeviceFileName( \"INPUT\", i );\n\n        m_inputs.push_back( input );\n    }\n}\n\nvoid SignCommand::Private::startKeySelection()\n{\n    KeySelectionJob* job = new KeySelectionJob( this );\n    job->setSecretKeysOnly( true );\n    job->setPatterns( q->senders() ); \/\/ FIXME\n    job->setSilent( q->hasOption( \"silent\" ) );\n    connect( job, SIGNAL( error( GpgME::Error, GpgME::KeyListResult ) ),\n             this, SLOT( slotKeySelectionError( GpgME::Error, GpgME::KeyListResult ) ) );\n    connect( job, SIGNAL( result( std::vector<GpgME::Key> ) ),\n             this, SLOT( slotKeySelectionResult( std::vector<GpgME::Key> ) ) );\n    job->start();\n}\n\nvoid SignCommand::Private::startSignJobs( const std::vector<GpgME::Key>& keys )\n{\n    \/\/ make sure the keys are all of the same type\n    \/\/ FIXME reasonable assumption?\n    if ( keys.empty() || !kdtools::all( keys.begin(), keys.end(), boost::bind( ByProtocol<std::equal_to>(), _1, keys.front() )  ) ) {\n        q->done();\n        return;\n    }\n    const CryptoBackend::Protocol* backend = CryptoBackendFactory::instance()->protocol( keys.front().protocolAsString() );\n    \n    assert( backend );\n    \n    Q_FOREACH( const Input input, m_inputs ) {\n        SignJob *job = backend->signJob( true, true );\n        connect( job, SIGNAL( result( GpgME::SigningResult, QByteArray ) ),\n                 this, SLOT( slotSigningResult( GpgME::SigningResult, QByteArray ) ) );\n        \/\/ FIXME port to iodevice\n        if ( const GpgME::Error err = job->start( keys, input.data->readAll(), q->hasOption( \"detached\" ) ? GpgME::Detached : GpgME::NormalSignatureMode ) ) {\n            q->done( err );\n            return;\n        }\n        m_jobs.insert( job, input.id );\n        m_signJobs++;\n    }\n}\n\nvoid SignCommand::Private::slotKeySelectionResult( const std::vector<GpgME::Key>& keys )\n{\n    \/\/ fire off the sign jobs\n    startSignJobs( keys );\n}\n\nvoid SignCommand::Private::slotKeySelectionError( const GpgME::Error& error, const GpgME::KeyListResult& )\n{\n    assert( error || error.isCanceled() );\n    if ( error.isCanceled() )\n        q->done( error, i18n( \"User canceled key selection\" ) );\n    else\n        q->done( error, i18n( \"Error while listing and selecting private keys\" ) );\n\n}\n\nbool SignCommand::Private::trySendingStatus( const QString & str )\n{\n    if ( const int err = q->sendStatus( \"SIGN\", str ) ) {\n        QString errorString = i18n(\"Problem writing out the signature.\");\n        q->done( err, errorString );\n        return false;\n    }\n    return true;\n}\n\nvoid SignCommand::Private::slotSigningResult( const GpgME::SigningResult & result, const QByteArray & signature )\n{\n    const SignJob * const job = qobject_cast<SignJob*>( sender() );\n    assert( job );\n    assert( m_jobs.contains( job ) );\n    const unsigned int id = m_jobs[job];\n    \n    {\n        Result res;\n        res.result = result;\n        res.data = signature;\n        res.id = id;\n        m_results.insert( id, res );\n    }\n    \/\/ send status for all results received so far, but in order of id\n    while ( m_results.contains( m_statusSent ) ) {\n       SignCommand::Private::Result result = m_results[m_statusSent];\n       QString resultString;\n       try {\n           const GpgME::SigningResult & signres = result.result; \n           assert( !signres.isNull() );\n               \n           const GpgME::Error signError = signres.error();\n           if ( signError )\n               throw assuan_exception( signError, i18n( \"Signing failed: \" ) );\n\n           \/\/ send MICALG status message:\n           if ( const int err = q->sendStatus( \"MICALG\", signres.createdSignature(0).hashAlgorithmAsString() ) )\n               throw assuan_exception( err, i18n( \"Couldn't send status string: \" ) );\n\n           \/\/ FIXME adjust for smime?\n           const QString filename = q->bulkInputDeviceFileName( \"INPUT\", m_statusSent ) + \".sig\";\n           writeToOutputDeviceOrAskForFileName( result.id, result.data, filename );\n           resultString = \"OK - Signature written\";\n       } catch ( const assuan_exception& e ) {\n           result.error = e.error_code();\n           result.errorString = e.what();\n           m_results[result.id] = result;\n           resultString = \"ERR \" + result.errorString;\n           \/\/ FIXME ask to continue or cancel\n       }\n       if ( !trySendingStatus( resultString ) ) \/\/ emit done on error\n           return;\n       \n       m_statusSent++;\n    }\n    \n    if ( --m_signJobs == 0 )\n        q->done();\n}\n\nSignCommand::SignCommand()\n:d( new Private( this ) )\n{\n}\n\nSignCommand::~SignCommand()\n{\n}\n\nint SignCommand::doStart()\n{\n    try {\n        d->checkInputs();\n        d->startKeySelection();\n    } catch ( const assuan_exception& e ) {\n        done( e.error_code(), e.what());\n        return e.error_code();\n    }\n    \n    return 0;\n}\n\nvoid SignCommand::doCanceled()\n{\n}\n\n#include \"signcommand.moc\"\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Host based encapsulated base sweeper.\n *\/\n\n#ifndef _PFASST_ENCAP_ENCAP_SWEEPER_HPP_\n#define _PFASST_ENCAP_ENCAP_SWEEPER_HPP_\n\n#include <algorithm>\n#include <cstdlib>\n#include <vector>\n#include <memory>\n\n#include \"..\/globals.hpp\"\n#include \"..\/interfaces.hpp\"\n#include \"..\/quadrature.hpp\"\n#include \"encapsulation.hpp\"\n\nnamespace pfasst\n{\n  namespace encap\n  {\n    template<typename time = time_precision>\n    class EncapSweeper\n      : public ISweeper<time>\n    {\n      protected:\n        \/\/! @{\n        quadrature::IQuadrature<time>* quad;\n        shared_ptr<EncapFactory<time>> factory;\n        shared_ptr<Encapsulation<time>> start_state;\n        shared_ptr<Encapsulation<time>> end_state;\n        vector<shared_ptr<Encapsulation<time>>> residuals;\n        \/\/! @}\n\n        int residual_norm_order;\n        time abs_residual_tol, rel_residual_tol;\n\n      public:\n        \/\/! @{\n        EncapSweeper()\n          : quad(nullptr), abs_residual_tol(0.0), rel_residual_tol(0.0)\n        {}\n\n        virtual ~EncapSweeper()\n        {\n          if (this->quad) delete this->quad;\n        }\n        \/\/! @}\n\n        \/\/! @{\n        virtual void spread() override\n        {\n          for (size_t m = 1; m < this->quad->get_num_nodes(); m++) {\n            \/\/            this->get_state(m)->copy(this->start_state);\n            this->get_state(m)->copy(this->get_state(0));\n          }\n        }\n        \/\/! @}\n\n        \/\/! @{\n        void set_quadrature(quadrature::IQuadrature<time>* quad)\n        {\n          this->quad = quad;\n        }\n\n        const quadrature::IQuadrature<time>* get_quadrature() const\n        {\n          return this->quad;\n        }\n\n        shared_ptr<Encapsulation<time>> get_start_state() const\n        {\n          return this->start_state;\n        }\n\n        const vector<time> get_nodes() const\n        {\n          return this->quad->get_nodes();\n        }\n\n        void set_factory(shared_ptr<EncapFactory<time>> factory)\n        {\n          this->factory = factory;\n        }\n\n        virtual shared_ptr<EncapFactory<time>> get_factory() const\n        {\n          return factory;\n        }\n\n        \/**\n         * retrieve solution values of current iteration at time node index `m`\n         *\n         * @param[in] m 0-based index of time node\n         *\n         * @note This method must be implemented in derived sweepers.\n         *\/\n        virtual shared_ptr<Encapsulation<time>> get_state(size_t m) const\n        {\n          UNUSED(m);\n          throw NotImplementedYet(\"sweeper\");\n          return NULL;\n        }\n\n        \/**\n         * retrieves FAS correction of current iteration at time node index `m`\n         *\n         * @param[in] m 0-based index of time node\n         *\n         * @note This method must be implemented in derived sweepers.\n         *\/\n        virtual shared_ptr<Encapsulation<time>> get_tau(size_t m) const\n        {\n          UNUSED(m);\n          throw NotImplementedYet(\"sweeper\");\n          return NULL;\n        }\n\n        \/**\n         * retrieves solution values of previous iteration at time node index `m`\n         *\n         * @param[in] m 0-based index of time node\n         *\n         * @note This method must be implemented in derived sweepers.\n         *\/\n        virtual shared_ptr<Encapsulation<time>> get_saved_state(size_t m) const\n        {\n          UNUSED(m);\n          throw NotImplementedYet(\"sweeper\");\n          return NULL;\n        }\n\n        virtual shared_ptr<Encapsulation<time>> get_end_state()\n        {\n          return this->end_state;\n        }\n        \/\/! @}\n\n        \/\/! @{\n        \/**\n         * @copydoc ISweeper::advance()\n         *\n         * @note This method must be implemented in derived sweepers.\n         *\/\n        virtual void advance() override\n        {\n          throw NotImplementedYet(\"sweeper\");\n        }\n\n        \/**\n         * evaluates the right hand side at given time node\n         *\n         * This evaluates the right hand side at the given time node with index `m` as returned by\n         * pfasst::encap::EncapSweeper::get_nodes:\n         *\n         * @param[in] m index of the time node to evaluate at\n         *\n         * @note This method must be implemented in derived sweepers.\n         *\/\n        virtual void evaluate(size_t m)\n        {\n          UNUSED(m);\n          throw NotImplementedYet(\"sweeper\");\n        }\n\n        \/**\n         * integrates values of right hand side at all time nodes \\\\( t \\\\in [0,M-1] \\\\)\n         * simultaneously\n         *\n         * @param[in] dt width of the time interval to integrate\n         * @param[in,out] dst integrated values\n         *\n         * @note This method must be implemented in derived sweepers.\n         *\/\n        virtual void integrate(time dt, vector<shared_ptr<Encapsulation<time>>> dst) const\n        {\n          UNUSED(dt); UNUSED(dst);\n          throw NotImplementedYet(\"sweeper\");\n        }\n        \/\/! @}\n\n        \/\/! @{\n        \/**\n         * Compute residual at each SDC node (including FAS corrections).\n         *\/\n        void set_residual_tolerances(time abs_residual_tol, time rel_residual_tol, int order=0)\n        {\n          this->abs_residual_tol = abs_residual_tol;\n          this->rel_residual_tol = rel_residual_tol;\n          this->residual_norm_order = order;\n        }\n\n        \/**\n         * Compute residual at each SDC node (including FAS corrections).\n         *\/\n        virtual void residual(time dt, vector<shared_ptr<Encapsulation<time>>> dst) const\n        {\n          throw NotImplementedYet(\"residual\");\n        }\n\n        \/**\n         * Return convergence status.\n         *\n         * This is used by controllers to shortcircuit iterations.\n         *\/\n        virtual bool converged() override\n        {\n          if (this->abs_residual_tol > 0.0 || this->rel_residual_tol > 0.0) {\n            if (this->residuals.size() == 0) {\n              for (auto x: this->get_nodes()) {\n                this->residuals.push_back(this->get_factory()->create(pfasst::encap::solution));\n              }\n            }\n            this->residual(this->get_controller()->get_time_step(), this->residuals);\n            vector<time> rnorms;\n            for (auto r: this->residuals) {\n              rnorms.push_back(r->norm0());\n            }\n            auto rmax = *std::max_element(rnorms.begin(), rnorms.end());\n            if (rmax < this->abs_residual_tol) {\n              return true;\n            }\n            \/\/ XXX: check rel norms too\n          }\n          return false;\n        }\n        \/\/! @}\n\n        \/\/! @{\n        virtual void post(ICommunicator* comm, int tag) override\n        {\n          this->get_state(0)->post(comm, tag);\n        }\n\n        virtual void send(ICommunicator* comm, int tag, bool blocking) override\n        {\n          this->get_state(this->get_nodes().size() - 1)->send(comm, tag, blocking);\n        }\n\n        virtual void recv(ICommunicator* comm, int tag, bool blocking) override\n        {\n          this->get_state(0)->recv(comm, tag, blocking);\n        }\n\n        virtual void broadcast(ICommunicator* comm) override\n        {\n          if (comm->rank() == comm->size() - 1) {\n            this->get_state(0)->copy(this->get_state(this->get_nodes().size() - 1));\n          }\n          this->get_state(0)->broadcast(comm);\n        }\n        \/\/! @}\n    };\n\n\n    template<typename time>\n    EncapSweeper<time>& as_encap_sweeper(shared_ptr<ISweeper<time>> x)\n    {\n      shared_ptr<EncapSweeper<time>> y = dynamic_pointer_cast<EncapSweeper<time>>(x);\n      assert(y);\n      return *y.get();\n    }\n\n\n    template<typename time>\n    const EncapSweeper<time>& as_encap_sweeper(shared_ptr<const ISweeper<time>> x)\n    {\n      shared_ptr<const EncapSweeper<time>> y = dynamic_pointer_cast<const EncapSweeper<time>>(x);\n      assert(y);\n      return *y.get();\n    }\n\n  }  \/\/ ::pfasst::encap\n}  \/\/ ::pfasst\n\n#endif\n<commit_msg>encap: Fix doc.<commit_after>\/*\n * Host based encapsulated base sweeper.\n *\/\n\n#ifndef _PFASST_ENCAP_ENCAP_SWEEPER_HPP_\n#define _PFASST_ENCAP_ENCAP_SWEEPER_HPP_\n\n#include <algorithm>\n#include <cstdlib>\n#include <vector>\n#include <memory>\n\n#include \"..\/globals.hpp\"\n#include \"..\/interfaces.hpp\"\n#include \"..\/quadrature.hpp\"\n#include \"encapsulation.hpp\"\n\nnamespace pfasst\n{\n  namespace encap\n  {\n    template<typename time = time_precision>\n    class EncapSweeper\n      : public ISweeper<time>\n    {\n      protected:\n        \/\/! @{\n        quadrature::IQuadrature<time>* quad;\n        shared_ptr<EncapFactory<time>> factory;\n        shared_ptr<Encapsulation<time>> start_state;\n        shared_ptr<Encapsulation<time>> end_state;\n        vector<shared_ptr<Encapsulation<time>>> residuals;\n        \/\/! @}\n\n        int residual_norm_order;\n        time abs_residual_tol, rel_residual_tol;\n\n      public:\n        \/\/! @{\n        EncapSweeper()\n          : quad(nullptr), abs_residual_tol(0.0), rel_residual_tol(0.0)\n        {}\n\n        virtual ~EncapSweeper()\n        {\n          if (this->quad) delete this->quad;\n        }\n        \/\/! @}\n\n        \/\/! @{\n        virtual void spread() override\n        {\n          for (size_t m = 1; m < this->quad->get_num_nodes(); m++) {\n            \/\/            this->get_state(m)->copy(this->start_state);\n            this->get_state(m)->copy(this->get_state(0));\n          }\n        }\n        \/\/! @}\n\n        \/\/! @{\n        void set_quadrature(quadrature::IQuadrature<time>* quad)\n        {\n          this->quad = quad;\n        }\n\n        const quadrature::IQuadrature<time>* get_quadrature() const\n        {\n          return this->quad;\n        }\n\n        shared_ptr<Encapsulation<time>> get_start_state() const\n        {\n          return this->start_state;\n        }\n\n        const vector<time> get_nodes() const\n        {\n          return this->quad->get_nodes();\n        }\n\n        void set_factory(shared_ptr<EncapFactory<time>> factory)\n        {\n          this->factory = factory;\n        }\n\n        virtual shared_ptr<EncapFactory<time>> get_factory() const\n        {\n          return factory;\n        }\n\n        \/**\n         * retrieve solution values of current iteration at time node index `m`\n         *\n         * @param[in] m 0-based index of time node\n         *\n         * @note This method must be implemented in derived sweepers.\n         *\/\n        virtual shared_ptr<Encapsulation<time>> get_state(size_t m) const\n        {\n          UNUSED(m);\n          throw NotImplementedYet(\"sweeper\");\n          return NULL;\n        }\n\n        \/**\n         * retrieves FAS correction of current iteration at time node index `m`\n         *\n         * @param[in] m 0-based index of time node\n         *\n         * @note This method must be implemented in derived sweepers.\n         *\/\n        virtual shared_ptr<Encapsulation<time>> get_tau(size_t m) const\n        {\n          UNUSED(m);\n          throw NotImplementedYet(\"sweeper\");\n          return NULL;\n        }\n\n        \/**\n         * retrieves solution values of previous iteration at time node index `m`\n         *\n         * @param[in] m 0-based index of time node\n         *\n         * @note This method must be implemented in derived sweepers.\n         *\/\n        virtual shared_ptr<Encapsulation<time>> get_saved_state(size_t m) const\n        {\n          UNUSED(m);\n          throw NotImplementedYet(\"sweeper\");\n          return NULL;\n        }\n\n        virtual shared_ptr<Encapsulation<time>> get_end_state()\n        {\n          return this->end_state;\n        }\n        \/\/! @}\n\n        \/\/! @{\n        \/**\n         * @copydoc ISweeper::advance()\n         *\n         * @note This method must be implemented in derived sweepers.\n         *\/\n        virtual void advance() override\n        {\n          throw NotImplementedYet(\"sweeper\");\n        }\n\n        \/**\n         * evaluates the right hand side at given time node\n         *\n         * This evaluates the right hand side at the given time node with index `m` as returned by\n         * pfasst::encap::EncapSweeper::get_nodes:\n         *\n         * @param[in] m index of the time node to evaluate at\n         *\n         * @note This method must be implemented in derived sweepers.\n         *\/\n        virtual void evaluate(size_t m)\n        {\n          UNUSED(m);\n          throw NotImplementedYet(\"sweeper\");\n        }\n\n        \/**\n         * integrates values of right hand side at all time nodes \\\\( t \\\\in [0,M-1] \\\\)\n         * simultaneously\n         *\n         * @param[in] dt width of the time interval to integrate\n         * @param[in,out] dst integrated values\n         *\n         * @note This method must be implemented in derived sweepers.\n         *\/\n        virtual void integrate(time dt, vector<shared_ptr<Encapsulation<time>>> dst) const\n        {\n          UNUSED(dt); UNUSED(dst);\n          throw NotImplementedYet(\"sweeper\");\n        }\n        \/\/! @}\n\n        \/\/! @{\n        \/**\n         * Set residual tolerances for convergence checking.\n         *\/\n        void set_residual_tolerances(time abs_residual_tol, time rel_residual_tol, int order=0)\n        {\n          this->abs_residual_tol = abs_residual_tol;\n          this->rel_residual_tol = rel_residual_tol;\n          this->residual_norm_order = order;\n        }\n\n        \/**\n         * Compute residual at each SDC node (including FAS corrections).\n         *\/\n        virtual void residual(time dt, vector<shared_ptr<Encapsulation<time>>> dst) const\n        {\n          throw NotImplementedYet(\"residual\");\n        }\n\n        \/**\n         * Return convergence status.\n         *\n         * This is used by controllers to shortcircuit iterations.\n         *\/\n        virtual bool converged() override\n        {\n          if (this->abs_residual_tol > 0.0 || this->rel_residual_tol > 0.0) {\n            if (this->residuals.size() == 0) {\n              for (auto x: this->get_nodes()) {\n                this->residuals.push_back(this->get_factory()->create(pfasst::encap::solution));\n              }\n            }\n            this->residual(this->get_controller()->get_time_step(), this->residuals);\n            vector<time> rnorms;\n            for (auto r: this->residuals) {\n              rnorms.push_back(r->norm0());\n            }\n            auto rmax = *std::max_element(rnorms.begin(), rnorms.end());\n            if (rmax < this->abs_residual_tol) {\n              return true;\n            }\n            \/\/ XXX: check rel norms too\n          }\n          return false;\n        }\n        \/\/! @}\n\n        \/\/! @{\n        virtual void post(ICommunicator* comm, int tag) override\n        {\n          this->get_state(0)->post(comm, tag);\n        }\n\n        virtual void send(ICommunicator* comm, int tag, bool blocking) override\n        {\n          this->get_state(this->get_nodes().size() - 1)->send(comm, tag, blocking);\n        }\n\n        virtual void recv(ICommunicator* comm, int tag, bool blocking) override\n        {\n          this->get_state(0)->recv(comm, tag, blocking);\n        }\n\n        virtual void broadcast(ICommunicator* comm) override\n        {\n          if (comm->rank() == comm->size() - 1) {\n            this->get_state(0)->copy(this->get_state(this->get_nodes().size() - 1));\n          }\n          this->get_state(0)->broadcast(comm);\n        }\n        \/\/! @}\n    };\n\n\n    template<typename time>\n    EncapSweeper<time>& as_encap_sweeper(shared_ptr<ISweeper<time>> x)\n    {\n      shared_ptr<EncapSweeper<time>> y = dynamic_pointer_cast<EncapSweeper<time>>(x);\n      assert(y);\n      return *y.get();\n    }\n\n\n    template<typename time>\n    const EncapSweeper<time>& as_encap_sweeper(shared_ptr<const ISweeper<time>> x)\n    {\n      shared_ptr<const EncapSweeper<time>> y = dynamic_pointer_cast<const EncapSweeper<time>>(x);\n      assert(y);\n      return *y.get();\n    }\n\n  }  \/\/ ::pfasst::encap\n}  \/\/ ::pfasst\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/**\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 <map>\n#include <string>\n\n#include <stout\/duration.hpp>\n#include <stout\/gtest.hpp>\n\n#include <process\/clock.hpp>\n#include <process\/future.hpp>\n#include <process\/gtest.hpp>\n#include <process\/http.hpp>\n#include <process\/process.hpp>\n#include <process\/statistics.hpp>\n#include <process\/time.hpp>\n\n#include <process\/metrics\/counter.hpp>\n#include <process\/metrics\/gauge.hpp>\n#include <process\/metrics\/metrics.hpp>\n#include <process\/metrics\/timer.hpp>\n\nusing namespace process;\n\nusing process::http::BadRequest;\nusing process::http::OK;\nusing process::http::Response;\n\nusing process::metrics::Counter;\nusing process::metrics::Gauge;\nusing process::metrics::Timer;\n\nusing std::map;\nusing std::string;\n\nclass GaugeProcess : public Process<GaugeProcess>\n{\npublic:\n  double get()\n  {\n    return 42.0;\n  }\n\n  Future<double> fail()\n  {\n    return Failure(\"failure\");\n  }\n\n  Future<double> pending()\n  {\n    return Future<double>();\n  }\n};\n\n\nTEST(MetricsTest, Counter)\n{\n  Counter counter(\"test\/counter\");\n\n  AWAIT_READY(metrics::add(counter));\n\n  AWAIT_EXPECT_EQ(0.0, counter.value());\n\n  ++counter;\n  AWAIT_EXPECT_EQ(1.0, counter.value());\n\n  counter++;\n  AWAIT_EXPECT_EQ(2.0, counter.value());\n\n  counter.reset();\n  AWAIT_EXPECT_EQ(0.0, counter.value());\n\n  counter += 42;\n  AWAIT_EXPECT_EQ(42.0, counter.value());\n\n  EXPECT_NONE(counter.statistics());\n\n  AWAIT_READY(metrics::remove(counter));\n}\n\n\nTEST(MetricsTest, Gauge)\n{\n  ASSERT_TRUE(GTEST_IS_THREADSAFE);\n\n  GaugeProcess process;\n  PID<GaugeProcess> pid = spawn(&process);\n  ASSERT_TRUE(pid);\n\n  \/\/ Gauge with a value.\n  Gauge gauge(\"test\/gauge\", defer(pid, &GaugeProcess::get));\n\n  AWAIT_READY(metrics::add(gauge));\n\n  AWAIT_EXPECT_EQ(42.0, gauge.value());\n\n  AWAIT_READY(metrics::remove(gauge));\n\n  \/\/ Failing gauge.\n  gauge = Gauge(\"test\/failedgauge\", defer(pid, &GaugeProcess::fail));\n\n  AWAIT_READY(metrics::add(gauge));\n\n  AWAIT_EXPECT_FAILED(gauge.value());\n\n  AWAIT_READY(metrics::remove(gauge));\n\n  terminate(process);\n  wait(process);\n}\n\n\nTEST(MetricsTest, Statistics)\n{\n  Counter counter(\"test\/counter\", process::TIME_SERIES_WINDOW);\n\n  \/\/ We have to pause the clock to ensure the time series\n  \/\/ entries are unique.\n  Clock::pause();\n\n  AWAIT_READY(metrics::add(counter));\n\n  for (size_t i = 0; i < 10; ++i) {\n    Clock::advance(Seconds(1));\n    ++counter;\n  }\n\n  Option<Statistics<double> > statistics = counter.statistics();\n  EXPECT_SOME(statistics);\n\n  EXPECT_EQ(11u, statistics.get().count);\n\n  EXPECT_FLOAT_EQ(0.0, statistics.get().min);\n  EXPECT_FLOAT_EQ(10.0, statistics.get().max);\n\n  EXPECT_FLOAT_EQ(5.0, statistics.get().p50);\n  EXPECT_FLOAT_EQ(9.0, statistics.get().p90);\n  EXPECT_FLOAT_EQ(9.5, statistics.get().p95);\n  EXPECT_FLOAT_EQ(9.9, statistics.get().p99);\n  EXPECT_FLOAT_EQ(9.99, statistics.get().p999);\n  EXPECT_FLOAT_EQ(9.999, statistics.get().p9999);\n\n  AWAIT_READY(metrics::remove(counter));\n}\n\n\nTEST(MetricsTest, Snapshot)\n{\n  ASSERT_TRUE(GTEST_IS_THREADSAFE);\n\n  UPID upid(\"metrics\", process::address());\n\n  Clock::pause();\n\n  \/\/ Add a gauge and a counter.\n  GaugeProcess process;\n  PID<GaugeProcess> pid = spawn(&process);\n  ASSERT_TRUE(pid);\n\n  Gauge gauge(\"test\/gauge\", defer(pid, &GaugeProcess::get));\n  Gauge gaugeFail(\"test\/gauge_fail\", defer(pid, &GaugeProcess::fail));\n  Counter counter(\"test\/counter\");\n\n  AWAIT_READY(metrics::add(gauge));\n  AWAIT_READY(metrics::add(gaugeFail));\n  AWAIT_READY(metrics::add(counter));\n\n  \/\/ Advance the clock to avoid rate limit.\n  Clock::advance(Seconds(1));\n\n  \/\/ Get the snapshot.\n  Future<Response> response = http::get(upid, \"snapshot\");\n  AWAIT_EXPECT_RESPONSE_STATUS_EQ(OK().status, response);\n\n  \/\/ Parse the response.\n  Try<JSON::Object> responseJSON =\n      JSON::parse<JSON::Object>(response.get().body);\n  ASSERT_SOME(responseJSON);\n\n  map<string, JSON::Value> values = responseJSON.get().values;\n\n  EXPECT_EQ(1u, values.count(\"test\/counter\"));\n  EXPECT_FLOAT_EQ(0.0, values[\"test\/counter\"].as<JSON::Number>().value);\n\n  EXPECT_EQ(1u, values.count(\"test\/gauge\"));\n  EXPECT_FLOAT_EQ(42.0, values[\"test\/gauge\"].as<JSON::Number>().value);\n\n  EXPECT_EQ(0u, values.count(\"test\/gauge_fail\"));\n\n  \/\/ Remove the metrics and ensure they are no longer in the snapshot.\n  AWAIT_READY(metrics::remove(gauge));\n  AWAIT_READY(metrics::remove(gaugeFail));\n  AWAIT_READY(metrics::remove(counter));\n\n  \/\/ Advance the clock to avoid rate limit.\n  Clock::advance(Seconds(1));\n\n  \/\/ Ensure MetricsProcess has removed the metrics.\n  Clock::settle();\n\n  response = http::get(upid, \"snapshot\");\n\n  AWAIT_EXPECT_RESPONSE_STATUS_EQ(OK().status, response);\n\n  \/\/ Parse the response.\n  responseJSON = JSON::parse<JSON::Object>(response.get().body);\n  ASSERT_SOME(responseJSON);\n\n  values = responseJSON.get().values;\n  EXPECT_EQ(0u, values.count(\"test\/counter\"));\n  EXPECT_EQ(0u, values.count(\"test\/gauge\"));\n  EXPECT_EQ(0u, values.count(\"test\/gauge_fail\"));\n\n  terminate(process);\n  wait(process);\n}\n\n\nTEST(MetricsTest, SnapshotTimeout)\n{\n  ASSERT_TRUE(GTEST_IS_THREADSAFE);\n\n  UPID upid(\"metrics\", process::address());\n\n  Clock::pause();\n\n  \/\/ Advance the clock to avoid rate limit.\n  Clock::advance(Seconds(1));\n\n  \/\/ Ensure the timeout parameter is validated.\n  AWAIT_EXPECT_RESPONSE_STATUS_EQ(\n      BadRequest().status,\n      http::get(upid, \"snapshot\", \"timeout=foobar\"));\n\n  \/\/ Advance the clock to avoid rate limit.\n  Clock::advance(Seconds(1));\n\n  \/\/ Add gauges and a counter.\n  GaugeProcess process;\n  PID<GaugeProcess> pid = spawn(&process);\n  ASSERT_TRUE(pid);\n\n  Gauge gauge(\"test\/gauge\", defer(pid, &GaugeProcess::get));\n  Gauge gaugeFail(\"test\/gauge_fail\", defer(pid, &GaugeProcess::fail));\n  Gauge gaugeTimeout(\"test\/gauge_timeout\", defer(pid, &GaugeProcess::pending));\n  Counter counter(\"test\/counter\");\n\n  AWAIT_READY(metrics::add(gauge));\n  AWAIT_READY(metrics::add(gaugeFail));\n  AWAIT_READY(metrics::add(gaugeTimeout));\n  AWAIT_READY(metrics::add(counter));\n\n  \/\/ Advance the clock to avoid rate limit.\n  Clock::advance(Seconds(1));\n\n  \/\/ Get the snapshot.\n  Future<Response> response = http::get(upid, \"snapshot\", \"timeout=2secs\");\n\n  \/\/ Make sure the request is pending before the timeout is exceeded.\n  Clock::settle();\n\n  ASSERT_TRUE(response.isPending());\n\n  \/\/ Advance the clock to trigger the timeout.\n  Clock::advance(Seconds(2));\n\n  AWAIT_EXPECT_RESPONSE_STATUS_EQ(OK().status, response);\n\n  \/\/ Parse the response.\n  Try<JSON::Object> responseJSON =\n      JSON::parse<JSON::Object>(response.get().body);\n  ASSERT_SOME(responseJSON);\n\n  \/\/ We can't use simple JSON equality testing here as initializing\n  \/\/ libprocess adds metrics to the system. We want to only check if\n  \/\/ the metrics from this test are correctly handled.\n  map<string, JSON::Value> values = responseJSON.get().values;\n\n  EXPECT_EQ(1u, values.count(\"test\/counter\"));\n  EXPECT_FLOAT_EQ(0.0, values[\"test\/counter\"].as<JSON::Number>().value);\n\n  EXPECT_EQ(1u, values.count(\"test\/gauge\"));\n  EXPECT_FLOAT_EQ(42.0, values[\"test\/gauge\"].as<JSON::Number>().value);\n\n  EXPECT_EQ(0u, values.count(\"test\/gauge_fail\"));\n  EXPECT_EQ(0u, values.count(\"test\/gauge_timeout\"));\n\n  \/\/ Remove the metrics and ensure they are no longer in the snapshot.\n  AWAIT_READY(metrics::remove(gauge));\n  AWAIT_READY(metrics::remove(gaugeFail));\n  AWAIT_READY(metrics::remove(gaugeTimeout));\n  AWAIT_READY(metrics::remove(counter));\n\n  \/\/ Advance the clock to avoid rate limit.\n  Clock::advance(Seconds(1));\n\n  \/\/ Ensure MetricsProcess has removed the metrics.\n  Clock::settle();\n\n  response = http::get(upid, \"snapshot\", \"timeout=2secs\");\n\n  AWAIT_EXPECT_RESPONSE_STATUS_EQ(OK().status, response);\n\n  \/\/ Parse the response.\n  responseJSON = JSON::parse<JSON::Object>(response.get().body);\n  ASSERT_SOME(responseJSON);\n\n  values = responseJSON.get().values;\n\n  ASSERT_SOME(responseJSON);\n  EXPECT_EQ(0u, values.count(\"test\/counter\"));\n  EXPECT_EQ(0u, values.count(\"test\/gauge\"));\n  EXPECT_EQ(0u, values.count(\"test\/gauge_fail\"));\n  EXPECT_EQ(0u, values.count(\"test\/gauge_timeout\"));\n\n  terminate(process);\n  wait(process);\n}\n\n\n\/\/ Ensures that the aggregate statistics are correct in the snapshot.\nTEST(MetricsTest, SnapshotStatistics)\n{\n  UPID upid(\"metrics\", process::address());\n\n  Clock::pause();\n\n  Counter counter(\"test\/counter\", process::TIME_SERIES_WINDOW);\n\n  AWAIT_READY(metrics::add(counter));\n\n  for (size_t i = 0; i < 10; ++i) {\n    Clock::advance(Seconds(1));\n    ++counter;\n  }\n\n  \/\/ We can't use simple JSON equality testing here as initializing\n  \/\/ libprocess adds metrics to the system. We want to only check if\n  \/\/ the metrics from this test are correctly handled.\n  hashmap<string, double> expected;\n\n  expected[\"test\/counter\"] = 10.0;\n\n  expected[\"test\/counter\/count\"] = 11;\n\n  expected[\"test\/counter\/min\"] = 0.0;\n  expected[\"test\/counter\/max\"] = 10.0;\n\n  expected[\"test\/counter\/p50\"] = 5.0;\n  expected[\"test\/counter\/p90\"] = 9.0;\n  expected[\"test\/counter\/p95\"] = 9.5;\n  expected[\"test\/counter\/p99\"] = 9.9;\n  expected[\"test\/counter\/p999\"] = 9.99;\n  expected[\"test\/counter\/p9999\"] = 9.999;\n\n  Future<Response> response = http::get(upid, \"snapshot\");\n\n  AWAIT_EXPECT_RESPONSE_STATUS_EQ(OK().status, response);\n\n  Try<JSON::Object> responseJSON =\n      JSON::parse<JSON::Object>(response.get().body);\n\n  ASSERT_SOME(responseJSON);\n\n  \/\/ Pull the response values into a map.\n  hashmap<string, double> responseValues;\n  foreachpair (const string& key,\n               const JSON::Value& value,\n               responseJSON.get().values) {\n    if (value.is<JSON::Number>()) {\n      responseValues[key] = value.as<JSON::Number>().value;\n    }\n  }\n\n  \/\/ Ensure the expected keys are in the response and that the values match\n  \/\/ expectations.\n  foreachkey (const string& key, expected) {\n    EXPECT_FLOAT_EQ(expected[key], responseValues[key]);\n  }\n\n  AWAIT_READY(metrics::remove(counter));\n}\n\n\nTEST(MetricsTest, Timer)\n{\n  metrics::Timer<Nanoseconds> timer(\"test\/timer\");\n  EXPECT_EQ(\"test\/timer_ns\", timer.name());\n\n  AWAIT_READY(metrics::add(timer));\n\n  \/\/ It is not an error to stop a timer that hasn't been started.\n  timer.stop();\n\n  \/\/ Time a no-op.\n  Clock::pause();\n  timer.start();\n  Clock::advance(Microseconds(1));\n  timer.stop();\n\n  Future<double> value = timer.value();\n  AWAIT_READY(value);\n  EXPECT_FLOAT_EQ(value.get(), Microseconds(1).ns());\n\n  \/\/ It is not an error to stop a timer that has already been stopped.\n  timer.stop();\n\n  AWAIT_READY(metrics::remove(timer));\n}\n\n\nstatic Future<int> advanceAndReturn()\n{\n  Clock::advance(Seconds(1));\n  return 42;\n}\n\n\nTEST(MetricsTest, AsyncTimer)\n{\n  metrics::Timer<Microseconds> t(\"test\/timer\");\n  EXPECT_EQ(\"test\/timer_us\", t.name());\n\n  AWAIT_READY(metrics::add(t));\n\n  \/\/ Time a Future that returns immediately. Even though the method\n  \/\/ advances the clock and we advance the clock here, the Future\n  \/\/ should be timed as if it takes 0 time. Ie, we're not timing the\n  \/\/ method call but the Future.\n  Clock::pause();\n  Future<int> result = t.time(advanceAndReturn());\n  Clock::advance(Seconds(1));\n  AWAIT_READY(result);\n\n  EXPECT_EQ(42, result.get());\n\n  \/\/ The future should have taken zero time.\n  AWAIT_READY(t.value());\n  EXPECT_FLOAT_EQ(t.value().get(), 0.0);\n\n  AWAIT_READY(metrics::remove(t));\n}\n<commit_msg>Integer Precision for JSON <-> Protobuf conversions.<commit_after>\/**\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 <map>\n#include <string>\n\n#include <stout\/duration.hpp>\n#include <stout\/gtest.hpp>\n\n#include <process\/clock.hpp>\n#include <process\/future.hpp>\n#include <process\/gtest.hpp>\n#include <process\/http.hpp>\n#include <process\/process.hpp>\n#include <process\/statistics.hpp>\n#include <process\/time.hpp>\n\n#include <process\/metrics\/counter.hpp>\n#include <process\/metrics\/gauge.hpp>\n#include <process\/metrics\/metrics.hpp>\n#include <process\/metrics\/timer.hpp>\n\nusing namespace process;\n\nusing process::http::BadRequest;\nusing process::http::OK;\nusing process::http::Response;\n\nusing process::metrics::Counter;\nusing process::metrics::Gauge;\nusing process::metrics::Timer;\n\nusing std::map;\nusing std::string;\n\nclass GaugeProcess : public Process<GaugeProcess>\n{\npublic:\n  double get()\n  {\n    return 42.0;\n  }\n\n  Future<double> fail()\n  {\n    return Failure(\"failure\");\n  }\n\n  Future<double> pending()\n  {\n    return Future<double>();\n  }\n};\n\n\nTEST(MetricsTest, Counter)\n{\n  Counter counter(\"test\/counter\");\n\n  AWAIT_READY(metrics::add(counter));\n\n  AWAIT_EXPECT_EQ(0.0, counter.value());\n\n  ++counter;\n  AWAIT_EXPECT_EQ(1.0, counter.value());\n\n  counter++;\n  AWAIT_EXPECT_EQ(2.0, counter.value());\n\n  counter.reset();\n  AWAIT_EXPECT_EQ(0.0, counter.value());\n\n  counter += 42;\n  AWAIT_EXPECT_EQ(42.0, counter.value());\n\n  EXPECT_NONE(counter.statistics());\n\n  AWAIT_READY(metrics::remove(counter));\n}\n\n\nTEST(MetricsTest, Gauge)\n{\n  ASSERT_TRUE(GTEST_IS_THREADSAFE);\n\n  GaugeProcess process;\n  PID<GaugeProcess> pid = spawn(&process);\n  ASSERT_TRUE(pid);\n\n  \/\/ Gauge with a value.\n  Gauge gauge(\"test\/gauge\", defer(pid, &GaugeProcess::get));\n\n  AWAIT_READY(metrics::add(gauge));\n\n  AWAIT_EXPECT_EQ(42.0, gauge.value());\n\n  AWAIT_READY(metrics::remove(gauge));\n\n  \/\/ Failing gauge.\n  gauge = Gauge(\"test\/failedgauge\", defer(pid, &GaugeProcess::fail));\n\n  AWAIT_READY(metrics::add(gauge));\n\n  AWAIT_EXPECT_FAILED(gauge.value());\n\n  AWAIT_READY(metrics::remove(gauge));\n\n  terminate(process);\n  wait(process);\n}\n\n\nTEST(MetricsTest, Statistics)\n{\n  Counter counter(\"test\/counter\", process::TIME_SERIES_WINDOW);\n\n  \/\/ We have to pause the clock to ensure the time series\n  \/\/ entries are unique.\n  Clock::pause();\n\n  AWAIT_READY(metrics::add(counter));\n\n  for (size_t i = 0; i < 10; ++i) {\n    Clock::advance(Seconds(1));\n    ++counter;\n  }\n\n  Option<Statistics<double> > statistics = counter.statistics();\n  EXPECT_SOME(statistics);\n\n  EXPECT_EQ(11u, statistics.get().count);\n\n  EXPECT_FLOAT_EQ(0.0, statistics.get().min);\n  EXPECT_FLOAT_EQ(10.0, statistics.get().max);\n\n  EXPECT_FLOAT_EQ(5.0, statistics.get().p50);\n  EXPECT_FLOAT_EQ(9.0, statistics.get().p90);\n  EXPECT_FLOAT_EQ(9.5, statistics.get().p95);\n  EXPECT_FLOAT_EQ(9.9, statistics.get().p99);\n  EXPECT_FLOAT_EQ(9.99, statistics.get().p999);\n  EXPECT_FLOAT_EQ(9.999, statistics.get().p9999);\n\n  AWAIT_READY(metrics::remove(counter));\n}\n\n\nTEST(MetricsTest, Snapshot)\n{\n  ASSERT_TRUE(GTEST_IS_THREADSAFE);\n\n  UPID upid(\"metrics\", process::address());\n\n  Clock::pause();\n\n  \/\/ Add a gauge and a counter.\n  GaugeProcess process;\n  PID<GaugeProcess> pid = spawn(&process);\n  ASSERT_TRUE(pid);\n\n  Gauge gauge(\"test\/gauge\", defer(pid, &GaugeProcess::get));\n  Gauge gaugeFail(\"test\/gauge_fail\", defer(pid, &GaugeProcess::fail));\n  Counter counter(\"test\/counter\");\n\n  AWAIT_READY(metrics::add(gauge));\n  AWAIT_READY(metrics::add(gaugeFail));\n  AWAIT_READY(metrics::add(counter));\n\n  \/\/ Advance the clock to avoid rate limit.\n  Clock::advance(Seconds(1));\n\n  \/\/ Get the snapshot.\n  Future<Response> response = http::get(upid, \"snapshot\");\n  AWAIT_EXPECT_RESPONSE_STATUS_EQ(OK().status, response);\n\n  \/\/ Parse the response.\n  Try<JSON::Object> responseJSON =\n      JSON::parse<JSON::Object>(response.get().body);\n  ASSERT_SOME(responseJSON);\n\n  map<string, JSON::Value> values = responseJSON.get().values;\n\n  EXPECT_EQ(1u, values.count(\"test\/counter\"));\n  EXPECT_FLOAT_EQ(0.0, values[\"test\/counter\"].as<JSON::Number>().as<double>());\n\n  EXPECT_EQ(1u, values.count(\"test\/gauge\"));\n  EXPECT_FLOAT_EQ(42.0, values[\"test\/gauge\"].as<JSON::Number>().as<double>());\n\n  EXPECT_EQ(0u, values.count(\"test\/gauge_fail\"));\n\n  \/\/ Remove the metrics and ensure they are no longer in the snapshot.\n  AWAIT_READY(metrics::remove(gauge));\n  AWAIT_READY(metrics::remove(gaugeFail));\n  AWAIT_READY(metrics::remove(counter));\n\n  \/\/ Advance the clock to avoid rate limit.\n  Clock::advance(Seconds(1));\n\n  \/\/ Ensure MetricsProcess has removed the metrics.\n  Clock::settle();\n\n  response = http::get(upid, \"snapshot\");\n\n  AWAIT_EXPECT_RESPONSE_STATUS_EQ(OK().status, response);\n\n  \/\/ Parse the response.\n  responseJSON = JSON::parse<JSON::Object>(response.get().body);\n  ASSERT_SOME(responseJSON);\n\n  values = responseJSON.get().values;\n  EXPECT_EQ(0u, values.count(\"test\/counter\"));\n  EXPECT_EQ(0u, values.count(\"test\/gauge\"));\n  EXPECT_EQ(0u, values.count(\"test\/gauge_fail\"));\n\n  terminate(process);\n  wait(process);\n}\n\n\nTEST(MetricsTest, SnapshotTimeout)\n{\n  ASSERT_TRUE(GTEST_IS_THREADSAFE);\n\n  UPID upid(\"metrics\", process::address());\n\n  Clock::pause();\n\n  \/\/ Advance the clock to avoid rate limit.\n  Clock::advance(Seconds(1));\n\n  \/\/ Ensure the timeout parameter is validated.\n  AWAIT_EXPECT_RESPONSE_STATUS_EQ(\n      BadRequest().status,\n      http::get(upid, \"snapshot\", \"timeout=foobar\"));\n\n  \/\/ Advance the clock to avoid rate limit.\n  Clock::advance(Seconds(1));\n\n  \/\/ Add gauges and a counter.\n  GaugeProcess process;\n  PID<GaugeProcess> pid = spawn(&process);\n  ASSERT_TRUE(pid);\n\n  Gauge gauge(\"test\/gauge\", defer(pid, &GaugeProcess::get));\n  Gauge gaugeFail(\"test\/gauge_fail\", defer(pid, &GaugeProcess::fail));\n  Gauge gaugeTimeout(\"test\/gauge_timeout\", defer(pid, &GaugeProcess::pending));\n  Counter counter(\"test\/counter\");\n\n  AWAIT_READY(metrics::add(gauge));\n  AWAIT_READY(metrics::add(gaugeFail));\n  AWAIT_READY(metrics::add(gaugeTimeout));\n  AWAIT_READY(metrics::add(counter));\n\n  \/\/ Advance the clock to avoid rate limit.\n  Clock::advance(Seconds(1));\n\n  \/\/ Get the snapshot.\n  Future<Response> response = http::get(upid, \"snapshot\", \"timeout=2secs\");\n\n  \/\/ Make sure the request is pending before the timeout is exceeded.\n  Clock::settle();\n\n  ASSERT_TRUE(response.isPending());\n\n  \/\/ Advance the clock to trigger the timeout.\n  Clock::advance(Seconds(2));\n\n  AWAIT_EXPECT_RESPONSE_STATUS_EQ(OK().status, response);\n\n  \/\/ Parse the response.\n  Try<JSON::Object> responseJSON =\n      JSON::parse<JSON::Object>(response.get().body);\n  ASSERT_SOME(responseJSON);\n\n  \/\/ We can't use simple JSON equality testing here as initializing\n  \/\/ libprocess adds metrics to the system. We want to only check if\n  \/\/ the metrics from this test are correctly handled.\n  map<string, JSON::Value> values = responseJSON.get().values;\n\n  EXPECT_EQ(1u, values.count(\"test\/counter\"));\n  EXPECT_FLOAT_EQ(0.0, values[\"test\/counter\"].as<JSON::Number>().as<double>());\n\n  EXPECT_EQ(1u, values.count(\"test\/gauge\"));\n  EXPECT_FLOAT_EQ(42.0, values[\"test\/gauge\"].as<JSON::Number>().as<double>());\n\n  EXPECT_EQ(0u, values.count(\"test\/gauge_fail\"));\n  EXPECT_EQ(0u, values.count(\"test\/gauge_timeout\"));\n\n  \/\/ Remove the metrics and ensure they are no longer in the snapshot.\n  AWAIT_READY(metrics::remove(gauge));\n  AWAIT_READY(metrics::remove(gaugeFail));\n  AWAIT_READY(metrics::remove(gaugeTimeout));\n  AWAIT_READY(metrics::remove(counter));\n\n  \/\/ Advance the clock to avoid rate limit.\n  Clock::advance(Seconds(1));\n\n  \/\/ Ensure MetricsProcess has removed the metrics.\n  Clock::settle();\n\n  response = http::get(upid, \"snapshot\", \"timeout=2secs\");\n\n  AWAIT_EXPECT_RESPONSE_STATUS_EQ(OK().status, response);\n\n  \/\/ Parse the response.\n  responseJSON = JSON::parse<JSON::Object>(response.get().body);\n  ASSERT_SOME(responseJSON);\n\n  values = responseJSON.get().values;\n\n  ASSERT_SOME(responseJSON);\n  EXPECT_EQ(0u, values.count(\"test\/counter\"));\n  EXPECT_EQ(0u, values.count(\"test\/gauge\"));\n  EXPECT_EQ(0u, values.count(\"test\/gauge_fail\"));\n  EXPECT_EQ(0u, values.count(\"test\/gauge_timeout\"));\n\n  terminate(process);\n  wait(process);\n}\n\n\n\/\/ Ensures that the aggregate statistics are correct in the snapshot.\nTEST(MetricsTest, SnapshotStatistics)\n{\n  UPID upid(\"metrics\", process::address());\n\n  Clock::pause();\n\n  Counter counter(\"test\/counter\", process::TIME_SERIES_WINDOW);\n\n  AWAIT_READY(metrics::add(counter));\n\n  for (size_t i = 0; i < 10; ++i) {\n    Clock::advance(Seconds(1));\n    ++counter;\n  }\n\n  \/\/ We can't use simple JSON equality testing here as initializing\n  \/\/ libprocess adds metrics to the system. We want to only check if\n  \/\/ the metrics from this test are correctly handled.\n  hashmap<string, double> expected;\n\n  expected[\"test\/counter\"] = 10.0;\n\n  expected[\"test\/counter\/count\"] = 11;\n\n  expected[\"test\/counter\/min\"] = 0.0;\n  expected[\"test\/counter\/max\"] = 10.0;\n\n  expected[\"test\/counter\/p50\"] = 5.0;\n  expected[\"test\/counter\/p90\"] = 9.0;\n  expected[\"test\/counter\/p95\"] = 9.5;\n  expected[\"test\/counter\/p99\"] = 9.9;\n  expected[\"test\/counter\/p999\"] = 9.99;\n  expected[\"test\/counter\/p9999\"] = 9.999;\n\n  Future<Response> response = http::get(upid, \"snapshot\");\n\n  AWAIT_EXPECT_RESPONSE_STATUS_EQ(OK().status, response);\n\n  Try<JSON::Object> responseJSON =\n      JSON::parse<JSON::Object>(response.get().body);\n\n  ASSERT_SOME(responseJSON);\n\n  \/\/ Pull the response values into a map.\n  hashmap<string, double> responseValues;\n  foreachpair (const string& key,\n               const JSON::Value& value,\n               responseJSON.get().values) {\n    if (value.is<JSON::Number>()) {\n      \/\/ \"test\/counter\/count\" is an integer, everything else is a double.\n      JSON::Number number = value.as<JSON::Number>();\n      responseValues[key] = number.as<double>();\n    }\n  }\n\n  \/\/ Ensure the expected keys are in the response and that the values match\n  \/\/ expectations.\n  foreachkey (const string& key, expected) {\n    EXPECT_FLOAT_EQ(expected[key], responseValues[key]);\n  }\n\n  AWAIT_READY(metrics::remove(counter));\n}\n\n\nTEST(MetricsTest, Timer)\n{\n  metrics::Timer<Nanoseconds> timer(\"test\/timer\");\n  EXPECT_EQ(\"test\/timer_ns\", timer.name());\n\n  AWAIT_READY(metrics::add(timer));\n\n  \/\/ It is not an error to stop a timer that hasn't been started.\n  timer.stop();\n\n  \/\/ Time a no-op.\n  Clock::pause();\n  timer.start();\n  Clock::advance(Microseconds(1));\n  timer.stop();\n\n  Future<double> value = timer.value();\n  AWAIT_READY(value);\n  EXPECT_FLOAT_EQ(value.get(), Microseconds(1).ns());\n\n  \/\/ It is not an error to stop a timer that has already been stopped.\n  timer.stop();\n\n  AWAIT_READY(metrics::remove(timer));\n}\n\n\nstatic Future<int> advanceAndReturn()\n{\n  Clock::advance(Seconds(1));\n  return 42;\n}\n\n\nTEST(MetricsTest, AsyncTimer)\n{\n  metrics::Timer<Microseconds> t(\"test\/timer\");\n  EXPECT_EQ(\"test\/timer_us\", t.name());\n\n  AWAIT_READY(metrics::add(t));\n\n  \/\/ Time a Future that returns immediately. Even though the method\n  \/\/ advances the clock and we advance the clock here, the Future\n  \/\/ should be timed as if it takes 0 time. Ie, we're not timing the\n  \/\/ method call but the Future.\n  Clock::pause();\n  Future<int> result = t.time(advanceAndReturn());\n  Clock::advance(Seconds(1));\n  AWAIT_READY(result);\n\n  EXPECT_EQ(42, result.get());\n\n  \/\/ The future should have taken zero time.\n  AWAIT_READY(t.value());\n  EXPECT_FLOAT_EQ(t.value().get(), 0.0);\n\n  AWAIT_READY(metrics::remove(t));\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"selfdrive\/ui\/qt\/widgets\/cameraview.h\"\n\n#ifdef __APPLE__\n#include <OpenGL\/gl3.h>\n#else\n#include <GLES3\/gl3.h>\n#endif\n\n#include <QOpenGLBuffer>\n#include <QOffscreenSurface>\n\nnamespace {\n\nconst char frame_vertex_shader[] =\n#ifdef __APPLE__\n  \"#version 150 core\\n\"\n#else\n  \"#version 300 es\\n\"\n#endif\n  \"in vec4 aPosition;\\n\"\n  \"in vec4 aTexCoord;\\n\"\n  \"uniform mat4 uTransform;\\n\"\n  \"out vec4 vTexCoord;\\n\"\n  \"void main() {\\n\"\n  \"  gl_Position = uTransform * aPosition;\\n\"\n  \"  vTexCoord = aTexCoord;\\n\"\n  \"}\\n\";\n\nconst char frame_fragment_shader[] =\n#ifdef __APPLE__\n  \"#version 150 core\\n\"\n#else\n  \"#version 300 es\\n\"\n  \"precision mediump float;\\n\"\n#endif\n  \"uniform sampler2D uTexture;\\n\"\n  \"in vec4 vTexCoord;\\n\"\n  \"out vec4 colorOut;\\n\"\n  \"void main() {\\n\"\n  \"  colorOut = texture(uTexture, vTexCoord.xy);\\n\"\n#ifdef QCOM\n  \"  vec3 dz = vec3(0.0627f, 0.0627f, 0.0627f);\\n\"\n  \"  colorOut.rgb = ((vec3(1.0f, 1.0f, 1.0f) - dz) * colorOut.rgb \/ vec3(1.0f, 1.0f, 1.0f)) + dz;\\n\"\n#endif\n  \"}\\n\";\n\nconst mat4 device_transform = {{\n  1.0,  0.0, 0.0, 0.0,\n  0.0,  1.0, 0.0, 0.0,\n  0.0,  0.0, 1.0, 0.0,\n  0.0,  0.0, 0.0, 1.0,\n}};\n\nmat4 get_driver_view_transform(int screen_width, int screen_height, int stream_width, int stream_height) {\n  const float driver_view_ratio = 1.333;\n  mat4 transform;\n  if (stream_width == TICI_CAM_WIDTH) {\n    const float yscale = stream_height * driver_view_ratio \/ tici_dm_crop::width;\n    const float xscale = yscale*screen_height\/screen_width*stream_width\/stream_height;\n    transform = (mat4){{\n      xscale,  0.0, 0.0, xscale*tici_dm_crop::x_offset\/stream_width*2,\n      0.0,  yscale, 0.0, yscale*tici_dm_crop::y_offset\/stream_height*2,\n      0.0,  0.0, 1.0, 0.0,\n      0.0,  0.0, 0.0, 1.0,\n    }};\n  } else {\n    \/\/ frame from 4\/3 to 16\/9 display\n    transform = (mat4){{\n      driver_view_ratio * screen_height \/ screen_width,  0.0, 0.0, 0.0,\n      0.0,  1.0, 0.0, 0.0,\n      0.0,  0.0, 1.0, 0.0,\n      0.0,  0.0, 0.0, 1.0,\n    }};\n  }\n  return transform;\n}\n\nmat4 get_fit_view_transform(float widget_aspect_ratio, float frame_aspect_ratio) {\n  float zx = 1, zy = 1;\n  if (frame_aspect_ratio > widget_aspect_ratio) {\n    zy = widget_aspect_ratio \/ frame_aspect_ratio;\n  } else {\n    zx = frame_aspect_ratio \/ widget_aspect_ratio;\n  }\n\n  const mat4 frame_transform = {{\n    zx, 0.0, 0.0, 0.0,\n    0.0, zy, 0.0, 0.0,\n    0.0, 0.0, 1.0, 0.0,\n    0.0, 0.0, 0.0, 1.0,\n  }};\n  return frame_transform;\n}\n\n} \/\/ namespace\n\nCameraViewWidget::CameraViewWidget(std::string stream_name, VisionStreamType type, bool zoom, QWidget* parent) :\n                                   stream_name(stream_name), stream_type(type), zoomed_view(zoom), QOpenGLWidget(parent) {\n  setAttribute(Qt::WA_OpaquePaintEvent);\n  connect(this, &CameraViewWidget::vipcThreadConnected, this, &CameraViewWidget::vipcConnected, Qt::BlockingQueuedConnection);\n}\n\nCameraViewWidget::~CameraViewWidget() {\n  makeCurrent();\n  if (isValid()) {\n    glDeleteVertexArrays(1, &frame_vao);\n    glDeleteBuffers(1, &frame_vbo);\n    glDeleteBuffers(1, &frame_ibo);\n  }\n  doneCurrent();\n}\n\nvoid CameraViewWidget::initializeGL() {\n  initializeOpenGLFunctions();\n\n  program = std::make_unique<QOpenGLShaderProgram>(context());\n  bool ret = program->addShaderFromSourceCode(QOpenGLShader::Vertex, frame_vertex_shader);\n  assert(ret);\n  ret = program->addShaderFromSourceCode(QOpenGLShader::Fragment, frame_fragment_shader);\n  assert(ret);\n\n  program->link();\n  GLint frame_pos_loc = program->attributeLocation(\"aPosition\");\n  GLint frame_texcoord_loc = program->attributeLocation(\"aTexCoord\");\n\n  auto [x1, x2, y1, y2] = stream_type == VISION_STREAM_RGB_FRONT ? std::tuple(0.f, 1.f, 1.f, 0.f) : std::tuple(1.f, 0.f, 1.f, 0.f);\n  const uint8_t frame_indicies[] = {0, 1, 2, 0, 2, 3};\n  const float frame_coords[4][4] = {\n    {-1.0, -1.0, x2, y1}, \/\/ bl\n    {-1.0,  1.0, x2, y2}, \/\/ tl\n    { 1.0,  1.0, x1, y2}, \/\/ tr\n    { 1.0, -1.0, x1, y1}, \/\/ br\n  };\n\n  glGenVertexArrays(1, &frame_vao);\n  glBindVertexArray(frame_vao);\n  glGenBuffers(1, &frame_vbo);\n  glBindBuffer(GL_ARRAY_BUFFER, frame_vbo);\n  glBufferData(GL_ARRAY_BUFFER, sizeof(frame_coords), frame_coords, GL_STATIC_DRAW);\n  glEnableVertexAttribArray(frame_pos_loc);\n  glVertexAttribPointer(frame_pos_loc, 2, GL_FLOAT, GL_FALSE,\n                        sizeof(frame_coords[0]), (const void *)0);\n  glEnableVertexAttribArray(frame_texcoord_loc);\n  glVertexAttribPointer(frame_texcoord_loc, 2, GL_FLOAT, GL_FALSE,\n                        sizeof(frame_coords[0]), (const void *)(sizeof(float) * 2));\n  glGenBuffers(1, &frame_ibo);\n  glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, frame_ibo);\n  glBufferData(GL_ELEMENT_ARRAY_BUFFER, sizeof(frame_indicies), frame_indicies, GL_STATIC_DRAW);\n  glBindBuffer(GL_ARRAY_BUFFER, 0);\n  glBindVertexArray(0);\n}\n\nvoid CameraViewWidget::showEvent(QShowEvent *event) {\n  latest_texture_id = -1;\n  if (!vipc_thread) {\n    vipc_thread = new QThread();\n    connect(vipc_thread, &QThread::started, [=]() { vipcThread(); });\n    connect(vipc_thread, &QThread::finished, vipc_thread, &QObject::deleteLater);\n    vipc_thread->start();\n  }\n}\n\nvoid CameraViewWidget::hideEvent(QHideEvent *event) {\n  if (vipc_thread) {\n    vipc_thread->requestInterruption();\n    vipc_thread->quit();\n    vipc_thread->wait();\n    vipc_thread = nullptr;\n  }\n}\n\nvoid CameraViewWidget::updateFrameMat(int w, int h) {\n  if (zoomed_view) {\n    if (stream_type == VISION_STREAM_RGB_FRONT) {\n      frame_mat = matmul(device_transform, get_driver_view_transform(w, h, stream_width, stream_height));\n    } else {\n      auto intrinsic_matrix = stream_type == VISION_STREAM_RGB_WIDE ? ecam_intrinsic_matrix : fcam_intrinsic_matrix;\n      float zoom = ZOOM \/ intrinsic_matrix.v[0];\n      if (stream_type == VISION_STREAM_RGB_WIDE) {\n        zoom *= 0.5;\n      }\n      float zx = zoom * 2 * intrinsic_matrix.v[2] \/ width();\n      float zy = zoom * 2 * intrinsic_matrix.v[5] \/ height();\n\n      const mat4 frame_transform = {{\n        zx, 0.0, 0.0, 0.0,\n        0.0, zy, 0.0, -y_offset \/ height() * 2,\n        0.0, 0.0, 1.0, 0.0,\n        0.0, 0.0, 0.0, 1.0,\n      }};\n      frame_mat = matmul(device_transform, frame_transform);\n    }\n  } else if (stream_width > 0 && stream_height > 0) {\n    \/\/ fit frame to widget size\n    float widget_aspect_ratio = (float)width() \/ height();\n    float frame_aspect_ratio = (float)stream_width  \/ stream_height;\n    frame_mat = matmul(device_transform, get_fit_view_transform(widget_aspect_ratio, frame_aspect_ratio));\n  }\n}\n\nvoid CameraViewWidget::paintGL() {\n  glClearColor(bg.redF(), bg.greenF(), bg.blueF(), bg.alphaF());\n  glClear(GL_STENCIL_BUFFER_BIT | GL_COLOR_BUFFER_BIT);\n\n  std::lock_guard lk(lock);\n\n  if (latest_texture_id == -1) return;\n\n  glViewport(0, 0, width(), height());\n  \/\/ sync with the PBO\n  if (wait_fence) {\n    wait_fence->wait();\n  }\n\n  glBindVertexArray(frame_vao);\n  glActiveTexture(GL_TEXTURE0);\n  glBindTexture(GL_TEXTURE_2D, texture[latest_texture_id]->frame_tex);\n\n  glUseProgram(program->programId());\n  glUniform1i(program->uniformLocation(\"uTexture\"), 0);\n  glUniformMatrix4fv(program->uniformLocation(\"uTransform\"), 1, GL_TRUE, frame_mat.v);\n\n  assert(glGetError() == GL_NO_ERROR);\n  glEnableVertexAttribArray(0);\n  glDrawElements(GL_TRIANGLES, 6, GL_UNSIGNED_BYTE, (const void *)0);\n  glDisableVertexAttribArray(0);\n  glBindVertexArray(0);\n}\n\nvoid CameraViewWidget::vipcConnected(VisionIpcClient *vipc_client) {\n  makeCurrent();\n  for (int i = 0; i < vipc_client->num_buffers; i++) {\n    texture[i].reset(new EGLImageTexture(&vipc_client->buffers[i]));\n\n    glBindTexture(GL_TEXTURE_2D, texture[i]->frame_tex);\n    glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);\n    glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);\n\n    \/\/ BGR\n    glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_SWIZZLE_R, GL_BLUE);\n    glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_SWIZZLE_G, GL_GREEN);\n    glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_SWIZZLE_B, GL_RED);\n    assert(glGetError() == GL_NO_ERROR);\n  }\n  latest_texture_id = -1;\n  stream_width = vipc_client->buffers[0].width;\n  stream_height = vipc_client->buffers[0].height;\n  updateFrameMat(width(), height());\n}\n\nvoid CameraViewWidget::vipcThread() {\n  VisionStreamType cur_stream_type = stream_type;\n  std::unique_ptr<VisionIpcClient> vipc_client;\n\n  std::unique_ptr<QOpenGLContext> ctx;\n  std::unique_ptr<QOffscreenSurface> surface;\n  std::unique_ptr<QOpenGLBuffer> gl_buffer;\n\n  if (!Hardware::EON()) {\n    ctx = std::make_unique<QOpenGLContext>();\n    ctx->setFormat(context()->format());\n    ctx->setShareContext(context());\n    ctx->create();\n    assert(ctx->isValid());\n\n    surface = std::make_unique<QOffscreenSurface>();\n    surface->setFormat(ctx->format());\n    surface->create();\n    ctx->makeCurrent(surface.get());\n    assert(QOpenGLContext::currentContext() == ctx.get());\n    initializeOpenGLFunctions();\n  }\n\n  while (!QThread::currentThread()->isInterruptionRequested()) {\n    if (!vipc_client || cur_stream_type != stream_type) {\n      cur_stream_type = stream_type;\n      vipc_client.reset(new VisionIpcClient(stream_name, cur_stream_type, true));\n    }\n\n    if (!vipc_client->connected) {\n      if (!vipc_client->connect(false)) {\n        QThread::msleep(100);\n        continue;\n      }\n\n      if (!Hardware::EON()) {\n        gl_buffer.reset(new QOpenGLBuffer(QOpenGLBuffer::PixelUnpackBuffer));\n        gl_buffer->create();\n        gl_buffer->bind();\n        gl_buffer->setUsagePattern(QOpenGLBuffer::StreamDraw);\n        gl_buffer->allocate(vipc_client->buffers[0].len);\n      }\n\n      emit vipcThreadConnected(vipc_client.get());\n    }\n\n    if (VisionBuf *buf = vipc_client->recv(nullptr, 1000)) {\n      {\n        std::lock_guard lk(lock);\n        if (!Hardware::EON()) {\n          void *texture_buffer = gl_buffer->map(QOpenGLBuffer::WriteOnly);\n          memcpy(texture_buffer, buf->addr, buf->len);\n          gl_buffer->unmap();\n\n          \/\/ copy pixels from PBO to texture object\n          glBindTexture(GL_TEXTURE_2D, texture[buf->idx]->frame_tex);\n          glTexSubImage2D(GL_TEXTURE_2D, 0, 0, 0, buf->width, buf->height, GL_RGB, GL_UNSIGNED_BYTE, 0);\n          glBindTexture(GL_TEXTURE_2D, 0);\n          assert(glGetError() == GL_NO_ERROR);\n\n          wait_fence.reset(new WaitFence());\n        }\n        latest_texture_id = buf->idx;\n      }\n      \/\/ Schedule update. update() will be invoked on the gui thread.\n      QMetaObject::invokeMethod(this, \"update\");\n\n      \/\/ TODO: remove later, it's only connected by DriverView.\n      emit vipcThreadFrameReceived(buf);\n    }\n  }\n}\n<commit_msg>cameraview.cc: call glFlush after creating fence<commit_after>#include \"selfdrive\/ui\/qt\/widgets\/cameraview.h\"\n\n#ifdef __APPLE__\n#include <OpenGL\/gl3.h>\n#else\n#include <GLES3\/gl3.h>\n#endif\n\n#include <QOpenGLBuffer>\n#include <QOffscreenSurface>\n\nnamespace {\n\nconst char frame_vertex_shader[] =\n#ifdef __APPLE__\n  \"#version 150 core\\n\"\n#else\n  \"#version 300 es\\n\"\n#endif\n  \"in vec4 aPosition;\\n\"\n  \"in vec4 aTexCoord;\\n\"\n  \"uniform mat4 uTransform;\\n\"\n  \"out vec4 vTexCoord;\\n\"\n  \"void main() {\\n\"\n  \"  gl_Position = uTransform * aPosition;\\n\"\n  \"  vTexCoord = aTexCoord;\\n\"\n  \"}\\n\";\n\nconst char frame_fragment_shader[] =\n#ifdef __APPLE__\n  \"#version 150 core\\n\"\n#else\n  \"#version 300 es\\n\"\n  \"precision mediump float;\\n\"\n#endif\n  \"uniform sampler2D uTexture;\\n\"\n  \"in vec4 vTexCoord;\\n\"\n  \"out vec4 colorOut;\\n\"\n  \"void main() {\\n\"\n  \"  colorOut = texture(uTexture, vTexCoord.xy);\\n\"\n#ifdef QCOM\n  \"  vec3 dz = vec3(0.0627f, 0.0627f, 0.0627f);\\n\"\n  \"  colorOut.rgb = ((vec3(1.0f, 1.0f, 1.0f) - dz) * colorOut.rgb \/ vec3(1.0f, 1.0f, 1.0f)) + dz;\\n\"\n#endif\n  \"}\\n\";\n\nconst mat4 device_transform = {{\n  1.0,  0.0, 0.0, 0.0,\n  0.0,  1.0, 0.0, 0.0,\n  0.0,  0.0, 1.0, 0.0,\n  0.0,  0.0, 0.0, 1.0,\n}};\n\nmat4 get_driver_view_transform(int screen_width, int screen_height, int stream_width, int stream_height) {\n  const float driver_view_ratio = 1.333;\n  mat4 transform;\n  if (stream_width == TICI_CAM_WIDTH) {\n    const float yscale = stream_height * driver_view_ratio \/ tici_dm_crop::width;\n    const float xscale = yscale*screen_height\/screen_width*stream_width\/stream_height;\n    transform = (mat4){{\n      xscale,  0.0, 0.0, xscale*tici_dm_crop::x_offset\/stream_width*2,\n      0.0,  yscale, 0.0, yscale*tici_dm_crop::y_offset\/stream_height*2,\n      0.0,  0.0, 1.0, 0.0,\n      0.0,  0.0, 0.0, 1.0,\n    }};\n  } else {\n    \/\/ frame from 4\/3 to 16\/9 display\n    transform = (mat4){{\n      driver_view_ratio * screen_height \/ screen_width,  0.0, 0.0, 0.0,\n      0.0,  1.0, 0.0, 0.0,\n      0.0,  0.0, 1.0, 0.0,\n      0.0,  0.0, 0.0, 1.0,\n    }};\n  }\n  return transform;\n}\n\nmat4 get_fit_view_transform(float widget_aspect_ratio, float frame_aspect_ratio) {\n  float zx = 1, zy = 1;\n  if (frame_aspect_ratio > widget_aspect_ratio) {\n    zy = widget_aspect_ratio \/ frame_aspect_ratio;\n  } else {\n    zx = frame_aspect_ratio \/ widget_aspect_ratio;\n  }\n\n  const mat4 frame_transform = {{\n    zx, 0.0, 0.0, 0.0,\n    0.0, zy, 0.0, 0.0,\n    0.0, 0.0, 1.0, 0.0,\n    0.0, 0.0, 0.0, 1.0,\n  }};\n  return frame_transform;\n}\n\n} \/\/ namespace\n\nCameraViewWidget::CameraViewWidget(std::string stream_name, VisionStreamType type, bool zoom, QWidget* parent) :\n                                   stream_name(stream_name), stream_type(type), zoomed_view(zoom), QOpenGLWidget(parent) {\n  setAttribute(Qt::WA_OpaquePaintEvent);\n  connect(this, &CameraViewWidget::vipcThreadConnected, this, &CameraViewWidget::vipcConnected, Qt::BlockingQueuedConnection);\n}\n\nCameraViewWidget::~CameraViewWidget() {\n  makeCurrent();\n  if (isValid()) {\n    glDeleteVertexArrays(1, &frame_vao);\n    glDeleteBuffers(1, &frame_vbo);\n    glDeleteBuffers(1, &frame_ibo);\n  }\n  doneCurrent();\n}\n\nvoid CameraViewWidget::initializeGL() {\n  initializeOpenGLFunctions();\n\n  program = std::make_unique<QOpenGLShaderProgram>(context());\n  bool ret = program->addShaderFromSourceCode(QOpenGLShader::Vertex, frame_vertex_shader);\n  assert(ret);\n  ret = program->addShaderFromSourceCode(QOpenGLShader::Fragment, frame_fragment_shader);\n  assert(ret);\n\n  program->link();\n  GLint frame_pos_loc = program->attributeLocation(\"aPosition\");\n  GLint frame_texcoord_loc = program->attributeLocation(\"aTexCoord\");\n\n  auto [x1, x2, y1, y2] = stream_type == VISION_STREAM_RGB_FRONT ? std::tuple(0.f, 1.f, 1.f, 0.f) : std::tuple(1.f, 0.f, 1.f, 0.f);\n  const uint8_t frame_indicies[] = {0, 1, 2, 0, 2, 3};\n  const float frame_coords[4][4] = {\n    {-1.0, -1.0, x2, y1}, \/\/ bl\n    {-1.0,  1.0, x2, y2}, \/\/ tl\n    { 1.0,  1.0, x1, y2}, \/\/ tr\n    { 1.0, -1.0, x1, y1}, \/\/ br\n  };\n\n  glGenVertexArrays(1, &frame_vao);\n  glBindVertexArray(frame_vao);\n  glGenBuffers(1, &frame_vbo);\n  glBindBuffer(GL_ARRAY_BUFFER, frame_vbo);\n  glBufferData(GL_ARRAY_BUFFER, sizeof(frame_coords), frame_coords, GL_STATIC_DRAW);\n  glEnableVertexAttribArray(frame_pos_loc);\n  glVertexAttribPointer(frame_pos_loc, 2, GL_FLOAT, GL_FALSE,\n                        sizeof(frame_coords[0]), (const void *)0);\n  glEnableVertexAttribArray(frame_texcoord_loc);\n  glVertexAttribPointer(frame_texcoord_loc, 2, GL_FLOAT, GL_FALSE,\n                        sizeof(frame_coords[0]), (const void *)(sizeof(float) * 2));\n  glGenBuffers(1, &frame_ibo);\n  glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, frame_ibo);\n  glBufferData(GL_ELEMENT_ARRAY_BUFFER, sizeof(frame_indicies), frame_indicies, GL_STATIC_DRAW);\n  glBindBuffer(GL_ARRAY_BUFFER, 0);\n  glBindVertexArray(0);\n}\n\nvoid CameraViewWidget::showEvent(QShowEvent *event) {\n  latest_texture_id = -1;\n  if (!vipc_thread) {\n    vipc_thread = new QThread();\n    connect(vipc_thread, &QThread::started, [=]() { vipcThread(); });\n    connect(vipc_thread, &QThread::finished, vipc_thread, &QObject::deleteLater);\n    vipc_thread->start();\n  }\n}\n\nvoid CameraViewWidget::hideEvent(QHideEvent *event) {\n  if (vipc_thread) {\n    vipc_thread->requestInterruption();\n    vipc_thread->quit();\n    vipc_thread->wait();\n    vipc_thread = nullptr;\n  }\n}\n\nvoid CameraViewWidget::updateFrameMat(int w, int h) {\n  if (zoomed_view) {\n    if (stream_type == VISION_STREAM_RGB_FRONT) {\n      frame_mat = matmul(device_transform, get_driver_view_transform(w, h, stream_width, stream_height));\n    } else {\n      auto intrinsic_matrix = stream_type == VISION_STREAM_RGB_WIDE ? ecam_intrinsic_matrix : fcam_intrinsic_matrix;\n      float zoom = ZOOM \/ intrinsic_matrix.v[0];\n      if (stream_type == VISION_STREAM_RGB_WIDE) {\n        zoom *= 0.5;\n      }\n      float zx = zoom * 2 * intrinsic_matrix.v[2] \/ width();\n      float zy = zoom * 2 * intrinsic_matrix.v[5] \/ height();\n\n      const mat4 frame_transform = {{\n        zx, 0.0, 0.0, 0.0,\n        0.0, zy, 0.0, -y_offset \/ height() * 2,\n        0.0, 0.0, 1.0, 0.0,\n        0.0, 0.0, 0.0, 1.0,\n      }};\n      frame_mat = matmul(device_transform, frame_transform);\n    }\n  } else if (stream_width > 0 && stream_height > 0) {\n    \/\/ fit frame to widget size\n    float widget_aspect_ratio = (float)width() \/ height();\n    float frame_aspect_ratio = (float)stream_width  \/ stream_height;\n    frame_mat = matmul(device_transform, get_fit_view_transform(widget_aspect_ratio, frame_aspect_ratio));\n  }\n}\n\nvoid CameraViewWidget::paintGL() {\n  glClearColor(bg.redF(), bg.greenF(), bg.blueF(), bg.alphaF());\n  glClear(GL_STENCIL_BUFFER_BIT | GL_COLOR_BUFFER_BIT);\n\n  std::lock_guard lk(lock);\n\n  if (latest_texture_id == -1) return;\n\n  glViewport(0, 0, width(), height());\n  \/\/ sync with the PBO\n  if (wait_fence) {\n    wait_fence->wait();\n  }\n\n  glBindVertexArray(frame_vao);\n  glActiveTexture(GL_TEXTURE0);\n  glBindTexture(GL_TEXTURE_2D, texture[latest_texture_id]->frame_tex);\n\n  glUseProgram(program->programId());\n  glUniform1i(program->uniformLocation(\"uTexture\"), 0);\n  glUniformMatrix4fv(program->uniformLocation(\"uTransform\"), 1, GL_TRUE, frame_mat.v);\n\n  assert(glGetError() == GL_NO_ERROR);\n  glEnableVertexAttribArray(0);\n  glDrawElements(GL_TRIANGLES, 6, GL_UNSIGNED_BYTE, (const void *)0);\n  glDisableVertexAttribArray(0);\n  glBindVertexArray(0);\n}\n\nvoid CameraViewWidget::vipcConnected(VisionIpcClient *vipc_client) {\n  makeCurrent();\n  for (int i = 0; i < vipc_client->num_buffers; i++) {\n    texture[i].reset(new EGLImageTexture(&vipc_client->buffers[i]));\n\n    glBindTexture(GL_TEXTURE_2D, texture[i]->frame_tex);\n    glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);\n    glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);\n\n    \/\/ BGR\n    glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_SWIZZLE_R, GL_BLUE);\n    glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_SWIZZLE_G, GL_GREEN);\n    glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_SWIZZLE_B, GL_RED);\n    assert(glGetError() == GL_NO_ERROR);\n  }\n  latest_texture_id = -1;\n  stream_width = vipc_client->buffers[0].width;\n  stream_height = vipc_client->buffers[0].height;\n  updateFrameMat(width(), height());\n}\n\nvoid CameraViewWidget::vipcThread() {\n  VisionStreamType cur_stream_type = stream_type;\n  std::unique_ptr<VisionIpcClient> vipc_client;\n\n  std::unique_ptr<QOpenGLContext> ctx;\n  std::unique_ptr<QOffscreenSurface> surface;\n  std::unique_ptr<QOpenGLBuffer> gl_buffer;\n\n  if (!Hardware::EON()) {\n    ctx = std::make_unique<QOpenGLContext>();\n    ctx->setFormat(context()->format());\n    ctx->setShareContext(context());\n    ctx->create();\n    assert(ctx->isValid());\n\n    surface = std::make_unique<QOffscreenSurface>();\n    surface->setFormat(ctx->format());\n    surface->create();\n    ctx->makeCurrent(surface.get());\n    assert(QOpenGLContext::currentContext() == ctx.get());\n    initializeOpenGLFunctions();\n  }\n\n  while (!QThread::currentThread()->isInterruptionRequested()) {\n    if (!vipc_client || cur_stream_type != stream_type) {\n      cur_stream_type = stream_type;\n      vipc_client.reset(new VisionIpcClient(stream_name, cur_stream_type, true));\n    }\n\n    if (!vipc_client->connected) {\n      if (!vipc_client->connect(false)) {\n        QThread::msleep(100);\n        continue;\n      }\n\n      if (!Hardware::EON()) {\n        gl_buffer.reset(new QOpenGLBuffer(QOpenGLBuffer::PixelUnpackBuffer));\n        gl_buffer->create();\n        gl_buffer->bind();\n        gl_buffer->setUsagePattern(QOpenGLBuffer::StreamDraw);\n        gl_buffer->allocate(vipc_client->buffers[0].len);\n      }\n\n      emit vipcThreadConnected(vipc_client.get());\n    }\n\n    if (VisionBuf *buf = vipc_client->recv(nullptr, 1000)) {\n      {\n        std::lock_guard lk(lock);\n        if (!Hardware::EON()) {\n          void *texture_buffer = gl_buffer->map(QOpenGLBuffer::WriteOnly);\n          memcpy(texture_buffer, buf->addr, buf->len);\n          gl_buffer->unmap();\n\n          \/\/ copy pixels from PBO to texture object\n          glBindTexture(GL_TEXTURE_2D, texture[buf->idx]->frame_tex);\n          glTexSubImage2D(GL_TEXTURE_2D, 0, 0, 0, buf->width, buf->height, GL_RGB, GL_UNSIGNED_BYTE, 0);\n          glBindTexture(GL_TEXTURE_2D, 0);\n          assert(glGetError() == GL_NO_ERROR);\n\n          wait_fence.reset(new WaitFence());\n\n          \/\/ Ensure the fence is in the GPU command queue, or waiting on it might block\n          \/\/ https:\/\/www.khronos.org\/opengl\/wiki\/Sync_Object#Flushing_and_contexts\n          glFlush();\n        }\n        latest_texture_id = buf->idx;\n      }\n      \/\/ Schedule update. update() will be invoked on the gui thread.\n      QMetaObject::invokeMethod(this, \"update\");\n\n      \/\/ TODO: remove later, it's only connected by DriverView.\n      emit vipcThreadFrameReceived(buf);\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <sys\/ioctl.h>\n\n#include <unistd.h>\n\n#include <cstring>\n\n#include <chrono>\n#include <iostream>\n#include <string>\n#include <thread>\n\n#include \"Signals.h\"\n\nstatic Signals s_signals;\n\nstatic std::string box(size_t const rows, size_t const columns)\n{\n    std::string line;\n    if (2 < columns)\n    {\n        for (size_t i=0; i<columns-2; ++i)\n        {\n            line.append(u8\"\\u2550\");\n        }\n    }\n\n    std::string box;\n\n    box.append(u8\"\\u2554\").append(line).append(u8\"\\u2557\");\n    {\n        std::string middle;\n        middle.append(u8\"\\u2551\").append(std::string(columns-2, ' ')).append(u8\"\\u2551\");\n        if (2 < rows)\n        {\n            for (size_t i=0; i<rows-2; ++i)\n            {\n                box.append(middle);\n            }\n        }\n    }\n    box.append(u8\"\\u255A\").append(line); \/\/.append(u8\"\\u255D\");\n\n    return box;\n}\n\nstatic void print_window_size()\n{\n    if (s_signals.window_size_was_changed())\n    {\n        winsize w {};\n\n        if (ioctl(STDOUT_FILENO, TIOCGWINSZ, &w) == -1)\n        {\n            char error_buffer[64] {};\n            std::cout << \"Call to ioctl failed: \" << strerror_r(errno, error_buffer, sizeof(error_buffer)) << std::endl;\n        }\n\n        \/\/std::cout << \"\\x1B[2K\\x1B[0G\";\n        \/\/std::cout << \"Lines=\" << w.ws_row << \", Columns=\" << w.ws_col << std::flush;\n\n        \/\/std::string const s { u8\"\\u2560\" };\n        \/\/std::cout << \" \" << s << std::flush;\n\n        std::cout << \"\\x1B[36;40m\" << \"\\x1B[2J\\x1B[0;0H\" << box(w.ws_row, w.ws_col) << \"\\x1B[97;40m\" << std::flush;\n        \/\/std::cout << \"Lines=\" << w.ws_row << \", Columns=\" << w.ws_col << std::flush;\n    }\n}\n\nint main()\n{\n    while (!s_signals.received_interrupt_from_keyboard())\n    {\n        print_window_size();\n        std::this_thread::sleep_for(std::chrono::milliseconds(100));\n    }\n\n    std::cout << \"\\n\" << \"Done.\" << std::endl;\n\n    return 0;\n}\n\n<commit_msg>Overload strerror_r<commit_after>#include <sys\/ioctl.h>\n\n#include <unistd.h>\n\n#include <chrono>\n#include <cstring>\n#include <iostream>\n#include <string>\n#include <thread>\n\n#include \"Signals.h\"\n\nstatic std::string strerror_r(int const errnum)\n{\n    char error_buffer[BUFSIZ] {};\n    return strerror_r(errnum, error_buffer, sizeof(error_buffer));\n}\n\nstatic Signals s_signals;\n\nstatic std::string box(size_t const rows, size_t const columns)\n{\n    std::string line;\n    if (2 < columns)\n    {\n        for (size_t i=0; i<columns-2; ++i)\n        {\n            line.append(u8\"\\u2550\");\n        }\n    }\n\n    std::string box;\n\n    box.append(u8\"\\u2554\").append(line).append(u8\"\\u2557\");\n    {\n        std::string middle;\n        middle.append(u8\"\\u2551\").append(std::string(columns-2, ' ')).append(u8\"\\u2551\");\n        if (2 < rows)\n        {\n            for (size_t i=0; i<rows-2; ++i)\n            {\n                box.append(middle);\n            }\n        }\n    }\n    box.append(u8\"\\u255A\").append(line); \/\/.append(u8\"\\u255D\");\n\n    return box;\n}\n\nstatic void print_window_size()\n{\n    if (s_signals.window_size_was_changed())\n    {\n        winsize w {};\n\n        if (ioctl(STDOUT_FILENO, TIOCGWINSZ, &w) == -1)\n        {\n            std::cout << \"Call to ioctl failed: \" << strerror_r(errno) << std::endl;\n        }\n\n        \/\/std::cout << \"\\x1B[2K\\x1B[0G\";\n        \/\/std::cout << \"Lines=\" << w.ws_row << \", Columns=\" << w.ws_col << std::flush;\n\n        \/\/std::string const s { u8\"\\u2560\" };\n        \/\/std::cout << \" \" << s << std::flush;\n\n        std::cout << \"\\x1B[36;40m\" << \"\\x1B[2J\\x1B[0;0H\" << box(w.ws_row, w.ws_col) << \"\\x1B[97;40m\" << std::flush;\n        \/\/std::cout << \"Lines=\" << w.ws_row << \", Columns=\" << w.ws_col << std::flush;\n    }\n}\n\nint main()\n{\n    while (!s_signals.received_interrupt_from_keyboard())\n    {\n        print_window_size();\n        std::this_thread::sleep_for(std::chrono::milliseconds(100));\n    }\n\n    std::cout << \"\\n\" << \"Done.\" << std::endl;\n\n    return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef GP_UTILITY_EVALUATION_CONTEXT\n#define GP_UTILITY_EVALUATION_CONTEXT\n\n#include <vector>\n#include <any>\n#include <cassert>\n#include <exception>\n\nnamespace gp::utility {\n    enum class EvaluationStatus {\n        Evaluating,\n        EvaluationCountExceeded,\n        StackCountExceeded,\n        ValueReturned,\n        BreakCalled,\n        ContinueCalled\n    };\n\n    class EvaluationContext {\n    public:\n        using VariableTable = std::vector<std::any>;\n    private:\n        using EvaluationCount = long long;\n        using StackCount = long long;\n        static constexpr EvaluationCount defaultMaxEvaluationCount = 10000;\n        static constexpr StackCount defaultMaxStackCount = 10000;\n    private:\n        EvaluationStatus evaluationStatus;\n        VariableTable arguments;\n        VariableTable localVariables;\n        EvaluationCount evaluationCount;\n        StackCount stackCount;\n        const EvaluationCount maxEvaluationCount;\n        const StackCount maxStackCount;\n        std::any returnValue;\n    public:\n        void incrementEvaluationCount()noexcept {\n            if(evaluationCount < maxEvaluationCount) {\n                ++evaluationCount;\n            } else {\n               if(evaluationStatus == EvaluationStatus::Evaluating){\n                   evaluationStatus = EvaluationStatus::EvaluationCountExceeded;\n               }\n            }\n        }\n        void incrementStackCount()noexcept {\n            if(stackCount < maxStackCount) {\n                ++stackCount;\n            }else {\n                if(evaluationStatus == EvaluationStatus::Evaluating) {\n                    evaluationStatus = EvaluationStatus::StackCountExceeded;\n                }\n            }\n        }\n        auto getEvaluationCount()const noexcept {return evaluationCount;}\n        auto getStackCount()const noexcept {return stackCount;}\n        auto getArgumentNum()const noexcept {return std::size(arguments);}\n        auto getLocalVariableNum()const noexcept {return std::size(localVariables);}\n        std::any& getArgument(std::size_t n){\n            assert(n < std::size(arguments));\n            return arguments[n];\n        }\n        const std::any& getArgument(std::size_t n)const {\n            assert(n < std::size(arguments));\n            return arguments[n];\n        }\n        std::any& getLocalVariable(std::size_t n) {\n            assert(n < std::size(localVariables));\n            return localVariables[n];\n        }\n        const std::any& getLocalVariable(std::size_t n)const {\n            assert(n < std::size(localVariables));\n            return localVariables[n];\n        }\n        template <typename T>\n        void setArgument(std::size_t n, T&& val) {\n            assert(n < std::size(arguments));\n            arguments[n] = std::forward<T>(val);\n        }\n        template <typename T>\n        void setLocalVariable(std::size_t n, T&& val){\n            assert(n < std::size(localVariables));\n            localVariables[n] = std::forward<T>(val);\n        }\n        template <typename T>\n        void setReturnValue(T&& val){\n            if(evaluationStatus == EvaluationStatus::Evaluating){\n                evaluationStatus = EvaluationStatus::ValueReturned;\n                returnValue = std::forward<T>(val);\n            }\n        }\n        std::any getReturnValue()const {return returnValue;}\n    public:\n        template <typename Arguments, typename LocalVariables>\n        EvaluationContext(Arguments&& arguments_,\n                          LocalVariables&& localVariables_,\n                          EvaluationCount maxEvaluationCount_ = defaultMaxEvaluationCount,\n                          StackCount maxStackCount_ = defaultMaxStackCount)\n                : arguments(std::forward<Arguments>(arguments_))\n                , localVariables(std::forward<LocalVariables>(localVariables_))\n                , maxEvaluationCount(maxEvaluationCount_)\n                , maxStackCount(maxStackCount_)\n                , evaluationStatus(EvaluationStatus::Evaluating){}\n        EvaluationContext() = delete;\n        ~EvaluationContext() = default;\n        EvaluationContext(const EvaluationContext&) = default;\n        EvaluationContext(EvaluationContext&&) = default;\n        EvaluationContext& operator=(const EvaluationContext&) = default;\n        EvaluationContext& operator=(EvaluationContext&&) = default;\n    };\n}\n\n#endif<commit_msg>add some methods for evaluationStatus to the EvaluationContext class<commit_after>#ifndef GP_UTILITY_EVALUATION_CONTEXT\n#define GP_UTILITY_EVALUATION_CONTEXT\n\n#include <vector>\n#include <any>\n#include <cassert>\n#include <exception>\n\nnamespace gp::utility {\n    enum class EvaluationStatus {\n        Evaluating,\n        EvaluationCountExceeded,\n        StackCountExceeded,\n        ValueReturned,\n        BreakCalled,\n        ContinueCalled\n    };\n\n    class EvaluationContext {\n    public:\n        using VariableTable = std::vector<std::any>;\n    private:\n        using EvaluationCount = long long;\n        using StackCount = long long;\n        static constexpr EvaluationCount defaultMaxEvaluationCount = 10000;\n        static constexpr StackCount defaultMaxStackCount = 10000;\n    private:\n        EvaluationStatus evaluationStatus;\n        VariableTable arguments;\n        VariableTable localVariables;\n        EvaluationCount evaluationCount;\n        StackCount stackCount;\n        const EvaluationCount maxEvaluationCount;\n        const StackCount maxStackCount;\n        std::any returnValue;\n    public:\n        void incrementEvaluationCount()noexcept {\n            if(evaluationCount < maxEvaluationCount) {\n                ++evaluationCount;\n            } else {\n               if(evaluationStatus == EvaluationStatus::Evaluating){\n                   evaluationStatus = EvaluationStatus::EvaluationCountExceeded;\n               }\n            }\n        }\n        void incrementStackCount()noexcept {\n            if(stackCount < maxStackCount) {\n                ++stackCount;\n            }else {\n                if(evaluationStatus == EvaluationStatus::Evaluating) {\n                    evaluationStatus = EvaluationStatus::StackCountExceeded;\n                }\n            }\n        }\n        auto getEvaluationStatus()const noexcept {return evaluationStatus;}\n        void setEvaluationStatusWithoutUpdate(EvaluationStatus status){\n            if(evaluationStatus == EvaluationStatus::Evaluating) {\n                evaluationStatus = status;\n            }\n        }\n        void clearEvaluationStatus(){evaluationStatus = EvaluationStatus::Evaluating;}\n        auto getEvaluationCount()const noexcept {return evaluationCount;}\n        auto getStackCount()const noexcept {return stackCount;}\n        auto getArgumentNum()const noexcept {return std::size(arguments);}\n        auto getLocalVariableNum()const noexcept {return std::size(localVariables);}\n        std::any& getArgument(std::size_t n){\n            assert(n < std::size(arguments));\n            return arguments[n];\n        }\n        const std::any& getArgument(std::size_t n)const {\n            assert(n < std::size(arguments));\n            return arguments[n];\n        }\n        std::any& getLocalVariable(std::size_t n) {\n            assert(n < std::size(localVariables));\n            return localVariables[n];\n        }\n        const std::any& getLocalVariable(std::size_t n)const {\n            assert(n < std::size(localVariables));\n            return localVariables[n];\n        }\n        template <typename T>\n        void setArgument(std::size_t n, T&& val) {\n            assert(n < std::size(arguments));\n            arguments[n] = std::forward<T>(val);\n        }\n        template <typename T>\n        void setLocalVariable(std::size_t n, T&& val){\n            assert(n < std::size(localVariables));\n            localVariables[n] = std::forward<T>(val);\n        }\n        template <typename T>\n        void setReturnValue(T&& val){\n            if(evaluationStatus == EvaluationStatus::Evaluating){\n                evaluationStatus = EvaluationStatus::ValueReturned;\n                returnValue = std::forward<T>(val);\n            }\n        }\n        std::any getReturnValue()const {return returnValue;}\n    public:\n        template <typename Arguments, typename LocalVariables>\n        EvaluationContext(Arguments&& arguments_,\n                          LocalVariables&& localVariables_,\n                          EvaluationCount maxEvaluationCount_ = defaultMaxEvaluationCount,\n                          StackCount maxStackCount_ = defaultMaxStackCount)\n                : arguments(std::forward<Arguments>(arguments_))\n                , localVariables(std::forward<LocalVariables>(localVariables_))\n                , evaluationCount(0)\n                , stackCount(0)\n                , maxEvaluationCount(maxEvaluationCount_)\n                , maxStackCount(maxStackCount_)\n                , evaluationStatus(EvaluationStatus::Evaluating){}\n        EvaluationContext() = delete;\n        ~EvaluationContext() = default;\n        EvaluationContext(const EvaluationContext&) = default;\n        EvaluationContext(EvaluationContext&&) = default;\n        EvaluationContext& operator=(const EvaluationContext&) = default;\n        EvaluationContext& operator=(EvaluationContext&&) = default;\n    };\n}\n\n#endif<|endoftext|>"}
{"text":"<commit_before>#include \"material\/specular.h\"\n#include \"material\/sample_texture.h\"\n\nnamespace AT_NAME\n{\n    AT_DEVICE_MTRL_API real specular::pdf(\n        const aten::MaterialParameter* param,\n        const aten::vec3& normal,\n        const aten::vec3& wi,\n        const aten::vec3& wo,\n        real u, real v)\n    {\n        return real(1);\n    }\n\n    AT_DEVICE_MTRL_API real specular::pdf(\n        const aten::vec3& normal,\n        const aten::vec3& wi,\n        const aten::vec3& wo,\n        real u, real v) const\n    {\n        return pdf(&m_param, normal, wi, wo, u, v);\n    }\n\n    AT_DEVICE_MTRL_API aten::vec3 specular::sampleDirection(\n        const aten::MaterialParameter* param,\n        const aten::vec3& normal,\n        const aten::vec3& wi,\n        real u, real v,\n        aten::sampler* sampler)\n    {\n        auto reflect = wi - 2 * dot(normal, wi) * normal;\n        reflect = normalize(reflect);\n\n        return std::move(reflect);\n    }\n\n    AT_DEVICE_MTRL_API aten::vec3 specular::sampleDirection(\n        const aten::ray& ray,\n        const aten::vec3& normal,\n        real u, real v,\n        aten::sampler* sampler) const\n    {\n        const aten::vec3& in = ray.dir;\n\n        return std::move(sampleDirection(&m_param, normal, in, u, v, sampler));\n    }\n\n    AT_DEVICE_MTRL_API aten::vec3 specular::bsdf(\n        const aten::MaterialParameter* param,\n        const aten::vec3& normal,\n        const aten::vec3& wi,\n        const aten::vec3& wo,\n        real u, real v)\n    {\n        auto c = dot(normal, wo);\n\n#if 1\n        aten::vec3 bsdf = param->baseColor;\n#else\n        aten::vec3 bsdf;\n\n        \/\/ For canceling cosine factor.\n        if (c > 0) {\n            bsdf = m_color \/ c;\n        }\n#endif\n\n        bsdf *= sampleTexture(param->albedoMap, u, v, aten::vec3(real(1)));\n\n        if (param->ior > real(0)) {\n            real nc = real(1);        \/\/ 真空の屈折率.\n            real nt = param->ior;    \/\/ 物体内部の屈折率.\n\n                                    \/\/ SchlickによるFresnelの反射係数の近似を使う.\n            const real a = nt - nc;\n            const real b = nt + nc;\n            const real r0 = (a * a) \/ (b * b);\n\n            const real c = dot(normal, wo);\n\n            \/\/ 反射方向の光が反射してray.dirの方向に運ぶ割合。同時に屈折方向の光が反射する方向に運ぶ割合.\n            const real fresnel = r0 + (1 - r0) * aten::pow(c, 5);\n\n            bsdf *= fresnel;\n        }\n\n        return std::move(bsdf);\n    }\n\n    AT_DEVICE_MTRL_API aten::vec3 specular::bsdf(\n        const aten::MaterialParameter* param,\n        const aten::vec3& normal,\n        const aten::vec3& wi,\n        const aten::vec3& wo,\n        real u, real v,\n        const aten::vec3& externalAlbedo)\n    {\n        auto c = dot(normal, wo);\n\n        aten::vec3 bsdf = param->baseColor;\n        bsdf *= externalAlbedo;\n\n        return std::move(bsdf);\n    }\n\n    AT_DEVICE_MTRL_API aten::vec3 specular::bsdf(\n        const aten::vec3& normal,\n        const aten::vec3& wi,\n        const aten::vec3& wo,\n        real u, real v) const\n    {\n        return std::move(bsdf(&m_param, normal, wi, wo, u, v));\n    }\n\n    AT_DEVICE_MTRL_API MaterialSampling specular::sample(\n        const aten::ray& ray,\n        const aten::vec3& normal,\n        const aten::vec3& orgnormal,\n        aten::sampler* sampler,\n        real u, real v,\n        bool isLightPath\/*= false*\/) const\n    {\n        MaterialSampling ret;\n\n        sample(\n            &ret,\n            &m_param,\n            normal,\n            ray.dir,\n            orgnormal,\n            sampler,\n            u, v,\n            isLightPath);\n\n        return std::move(ret);\n    }\n\n    AT_DEVICE_MTRL_API void specular::sample(\n        MaterialSampling* result,\n        const aten::MaterialParameter* param,\n        const aten::vec3& normal,\n        const aten::vec3& wi,\n        const aten::vec3& orgnormal,\n        aten::sampler* sampler,\n        real u, real v,\n        bool isLightPath\/*= false*\/)\n    {\n        result->dir = sampleDirection(param, normal, wi, u, v, sampler);\n        result->pdf = pdf(param, normal, wi, result->dir, u, v);\n        result->bsdf = bsdf(param, normal, wi, result->dir, u, v);\n    }\n\n    AT_DEVICE_MTRL_API void specular::sample(\n        MaterialSampling* result,\n        const aten::MaterialParameter* param,\n        const aten::vec3& normal,\n        const aten::vec3& wi,\n        const aten::vec3& orgnormal,\n        aten::sampler* sampler,\n        real u, real v,\n        const aten::vec3& externalAlbedo,\n        bool isLightPath\/*= false*\/)\n    {\n        result->dir = sampleDirection(param, normal, wi, u, v, sampler);\n        result->pdf = pdf(param, normal, wi, result->dir, u, v);\n        result->bsdf = bsdf(param, normal, wi, result->dir, u, v, externalAlbedo);\n    }\n\n    bool specular::edit(aten::IMaterialParamEditor* editor)\n    {\n        auto b0 = AT_EDIT_MATERIAL_PARAM_RANGE(editor, m_param, ior, real(0.01), real(10));\n        auto b1 = AT_EDIT_MATERIAL_PARAM(editor, m_param, baseColor);\n\n        AT_EDIT_MATERIAL_PARAM_TEXTURE(editor, m_param, albedoMap);\n        AT_EDIT_MATERIAL_PARAM_TEXTURE(editor, m_param, normalMap);\n\n        return b0 || b1;\n    }\n}\n<commit_msg>Disabling unnecessary computing<commit_after>#include \"material\/specular.h\"\n#include \"material\/sample_texture.h\"\n\nnamespace AT_NAME\n{\n    AT_DEVICE_MTRL_API real specular::pdf(\n        const aten::MaterialParameter* param,\n        const aten::vec3& normal,\n        const aten::vec3& wi,\n        const aten::vec3& wo,\n        real u, real v)\n    {\n        return real(1);\n    }\n\n    AT_DEVICE_MTRL_API real specular::pdf(\n        const aten::vec3& normal,\n        const aten::vec3& wi,\n        const aten::vec3& wo,\n        real u, real v) const\n    {\n        return pdf(&m_param, normal, wi, wo, u, v);\n    }\n\n    AT_DEVICE_MTRL_API aten::vec3 specular::sampleDirection(\n        const aten::MaterialParameter* param,\n        const aten::vec3& normal,\n        const aten::vec3& wi,\n        real u, real v,\n        aten::sampler* sampler)\n    {\n        auto reflect = wi - 2 * dot(normal, wi) * normal;\n        reflect = normalize(reflect);\n\n        return std::move(reflect);\n    }\n\n    AT_DEVICE_MTRL_API aten::vec3 specular::sampleDirection(\n        const aten::ray& ray,\n        const aten::vec3& normal,\n        real u, real v,\n        aten::sampler* sampler) const\n    {\n        const aten::vec3& in = ray.dir;\n\n        return std::move(sampleDirection(&m_param, normal, in, u, v, sampler));\n    }\n\n    AT_DEVICE_MTRL_API aten::vec3 specular::bsdf(\n        const aten::MaterialParameter* param,\n        const aten::vec3& normal,\n        const aten::vec3& wi,\n        const aten::vec3& wo,\n        real u, real v)\n    {\n        auto c = dot(normal, wo);\n\n#if 1\n        aten::vec3 bsdf = param->baseColor;\n#else\n        aten::vec3 bsdf;\n\n        \/\/ For canceling cosine factor.\n        if (c > 0) {\n            bsdf = m_color \/ c;\n        }\n#endif\n\n        bsdf *= sampleTexture(param->albedoMap, u, v, aten::vec3(real(1)));\n\n#if 0\n        if (param->ior > real(0)) {\n            real nc = real(1);      \/\/ 真空の屈折率.\n            real nt = param->ior;   \/\/ 物体内部の屈折率.\n\n            \/\/ SchlickによるFresnelの反射係数の近似を使う.\n            const real a = nt - nc;\n            const real b = nt + nc;\n            const real r0 = (a * a) \/ (b * b);\n\n            const real c = dot(normal, wo);\n\n            \/\/ 反射方向の光が反射してray.dirの方向に運ぶ割合。同時に屈折方向の光が反射する方向に運ぶ割合.\n            const real fresnel = r0 + (1 - r0) * aten::pow(c, 5);\n\n            bsdf *= fresnel;\n        }\n#endif\n\n        return std::move(bsdf);\n    }\n\n    AT_DEVICE_MTRL_API aten::vec3 specular::bsdf(\n        const aten::MaterialParameter* param,\n        const aten::vec3& normal,\n        const aten::vec3& wi,\n        const aten::vec3& wo,\n        real u, real v,\n        const aten::vec3& externalAlbedo)\n    {\n        auto c = dot(normal, wo);\n\n        aten::vec3 bsdf = param->baseColor;\n        bsdf *= externalAlbedo;\n\n        return std::move(bsdf);\n    }\n\n    AT_DEVICE_MTRL_API aten::vec3 specular::bsdf(\n        const aten::vec3& normal,\n        const aten::vec3& wi,\n        const aten::vec3& wo,\n        real u, real v) const\n    {\n        return std::move(bsdf(&m_param, normal, wi, wo, u, v));\n    }\n\n    AT_DEVICE_MTRL_API MaterialSampling specular::sample(\n        const aten::ray& ray,\n        const aten::vec3& normal,\n        const aten::vec3& orgnormal,\n        aten::sampler* sampler,\n        real u, real v,\n        bool isLightPath\/*= false*\/) const\n    {\n        MaterialSampling ret;\n\n        sample(\n            &ret,\n            &m_param,\n            normal,\n            ray.dir,\n            orgnormal,\n            sampler,\n            u, v,\n            isLightPath);\n\n        return std::move(ret);\n    }\n\n    AT_DEVICE_MTRL_API void specular::sample(\n        MaterialSampling* result,\n        const aten::MaterialParameter* param,\n        const aten::vec3& normal,\n        const aten::vec3& wi,\n        const aten::vec3& orgnormal,\n        aten::sampler* sampler,\n        real u, real v,\n        bool isLightPath\/*= false*\/)\n    {\n        result->dir = sampleDirection(param, normal, wi, u, v, sampler);\n        result->pdf = pdf(param, normal, wi, result->dir, u, v);\n        result->bsdf = bsdf(param, normal, wi, result->dir, u, v);\n    }\n\n    AT_DEVICE_MTRL_API void specular::sample(\n        MaterialSampling* result,\n        const aten::MaterialParameter* param,\n        const aten::vec3& normal,\n        const aten::vec3& wi,\n        const aten::vec3& orgnormal,\n        aten::sampler* sampler,\n        real u, real v,\n        const aten::vec3& externalAlbedo,\n        bool isLightPath\/*= false*\/)\n    {\n        result->dir = sampleDirection(param, normal, wi, u, v, sampler);\n        result->pdf = pdf(param, normal, wi, result->dir, u, v);\n        result->bsdf = bsdf(param, normal, wi, result->dir, u, v, externalAlbedo);\n    }\n\n    bool specular::edit(aten::IMaterialParamEditor* editor)\n    {\n        auto b0 = AT_EDIT_MATERIAL_PARAM_RANGE(editor, m_param, ior, real(0.01), real(10));\n        auto b1 = AT_EDIT_MATERIAL_PARAM(editor, m_param, baseColor);\n\n        AT_EDIT_MATERIAL_PARAM_TEXTURE(editor, m_param, albedoMap);\n        AT_EDIT_MATERIAL_PARAM_TEXTURE(editor, m_param, normalMap);\n\n        return b0 || b1;\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 \"kernel\/type_checker.h\"\n#include \"kernel\/inductive\/inductive.h\"\n#include \"library\/standard_kernel.h\"\n#include \"library\/module.h\"\n#include \"library\/util.h\"\n#include \"library\/relation_manager.h\"\n#include \"library\/vm\/vm_nat.h\"\n#include \"library\/vm\/vm_name.h\"\n#include \"library\/vm\/vm_option.h\"\n#include \"library\/vm\/vm_level.h\"\n#include \"library\/vm\/vm_expr.h\"\n#include \"library\/vm\/vm_declaration.h\"\n#include \"library\/vm\/vm_exceptional.h\"\n#include \"library\/vm\/vm_list.h\"\n\nnamespace lean {\nstruct vm_environment : public vm_external {\n    environment m_val;\n    vm_environment(environment const & v):m_val(v) {}\n    virtual ~vm_environment() {}\n    virtual void dealloc() override { this->~vm_environment(); get_vm_allocator().deallocate(sizeof(vm_environment), this); }\n};\n\nenvironment const & to_env(vm_obj const & o) {\n    lean_assert(is_external(o));\n    lean_assert(dynamic_cast<vm_environment*>(to_external(o)));\n    return static_cast<vm_environment*>(to_external(o))->m_val;\n}\n\nvm_obj to_obj(environment const & n) {\n    return mk_vm_external(new (get_vm_allocator().allocate(sizeof(vm_environment))) vm_environment(n));\n}\n\nvm_obj environment_mk_std(vm_obj const & l) {\n    return to_obj(mk_environment(force_to_unsigned(l, 0)));\n}\n\nvm_obj environment_trust_lvl(vm_obj const & env) {\n    return mk_vm_nat(to_env(env).trust_lvl());\n}\n\nvm_obj environment_add(vm_obj const & env, vm_obj const & decl) {\n    try {\n        return mk_vm_exceptional_success(to_obj(module::add(to_env(env), check(to_env(env), to_declaration(decl)))));\n    } catch (throwable & ex) {\n        return mk_vm_exceptional_exception(ex);\n    }\n}\n\nvm_obj environment_get(vm_obj const & env, vm_obj const & n) {\n    try {\n        return mk_vm_exceptional_success(to_obj(to_env(env).get(to_name(n))));\n    } catch (throwable & ex) {\n        return mk_vm_exceptional_exception(ex);\n    }\n}\n\nstatic list<inductive::intro_rule> to_list_intro_rule(vm_obj const & cnstrs) {\n    if (is_simple(cnstrs))\n        return list<inductive::intro_rule>();\n    else\n        return list<inductive::intro_rule>(mk_local(to_name(cfield(cfield(cnstrs, 0), 0)),\n                                                    to_expr(cfield(cfield(cnstrs, 0), 1))),\n                                           to_list_intro_rule(cfield(cnstrs, 1)));\n}\n\nvm_obj environment_add_inductive(vm_obj const & env, vm_obj const & n, vm_obj const & ls, vm_obj const & num,\n                                 vm_obj const & type, vm_obj const & cnstrs, vm_obj const & is_meta) {\n    try {\n        environment new_env = module::add_inductive(to_env(env),\n                                                    inductive::inductive_decl(to_name(n),\n                                                                              to_list_name(ls),\n                                                                              force_to_unsigned(num, 0),\n                                                                              to_expr(type),\n                                                                              to_list_intro_rule(cnstrs)),\n                                                    !to_bool(is_meta));\n        return mk_vm_exceptional_success(to_obj(new_env));\n    } catch (throwable & ex) {\n        return mk_vm_exceptional_exception(ex);\n    }\n}\n\nvm_obj environment_is_inductive(vm_obj const & env, vm_obj const & n) {\n    return mk_vm_bool(static_cast<bool>(inductive::is_inductive_decl(to_env(env), to_name(n))));\n}\n\nvm_obj environment_is_constructor(vm_obj const & env, vm_obj const & n) {\n    return mk_vm_bool(static_cast<bool>(inductive::is_intro_rule(to_env(env), to_name(n))));\n}\n\nvm_obj environment_inductive_type_of(vm_obj const & env, vm_obj const & n) {\n    if (auto I = inductive::is_intro_rule(to_env(env), to_name(n)))\n        return mk_vm_some(to_obj(*I));\n    else\n        return mk_vm_none();\n}\n\nvm_obj environment_is_recursor(vm_obj const & env, vm_obj const & n) {\n    return mk_vm_bool(static_cast<bool>(inductive::is_elim_rule(to_env(env), to_name(n))));\n}\n\nvm_obj environment_is_recursive(vm_obj const & env, vm_obj const & n) {\n    return mk_vm_bool(static_cast<bool>(is_recursive_datatype(to_env(env), to_name(n))));\n}\n\nvm_obj environment_constructors_of(vm_obj const & env, vm_obj const & n) {\n    buffer<name> ns;\n    get_intro_rule_names(to_env(env), to_name(n), ns);\n    return to_obj(to_list(ns));\n}\n\nvm_obj environment_recursor_of(vm_obj const & env, vm_obj const & n) {\n    if (auto I = inductive::is_elim_rule(to_env(env), to_name(n)))\n        return mk_vm_some(to_obj(*I));\n    else\n        return mk_vm_none();\n}\n\nvm_obj environment_inductive_num_params(vm_obj const & env, vm_obj const & n) {\n    if (auto r = inductive::get_num_params(to_env(env), to_name(n)))\n        return mk_vm_nat(*r);\n    else\n        return mk_vm_nat(0);\n}\n\nvm_obj environment_inductive_num_indices(vm_obj const & env, vm_obj const & n) {\n    if (auto r = inductive::get_num_indices(to_env(env), to_name(n)))\n        return mk_vm_nat(*r);\n    else\n        return mk_vm_nat(0);\n}\n\nvm_obj environment_inductive_dep_elim(vm_obj const & env, vm_obj const & n) {\n    return mk_vm_bool(inductive::has_dep_elim(to_env(env), to_name(n)));\n}\n\nvm_obj environment_fold(vm_obj const &, vm_obj const & env, vm_obj const & a, vm_obj const & fn) {\n    vm_obj r = a;\n    to_env(env).for_each_declaration([&](declaration const & d) {\n            r = invoke(fn, to_obj(d), r);\n        });\n    return r;\n}\n\nvm_obj environment_relation_info(vm_obj const & env, vm_obj const & n) {\n    if (relation_info const * info = get_relation_info(to_env(env), to_name(n))) {\n        vm_obj r = mk_vm_pair(mk_vm_pair(mk_vm_nat(info->get_arity()), mk_vm_nat(info->get_lhs_pos())), mk_vm_nat(info->get_rhs_pos()));\n        return mk_vm_some(r);\n    } else {\n        return mk_vm_none();\n    }\n}\n\nvm_obj environment_refl_for(vm_obj const & env, vm_obj const & n) {\n    if (optional<name> const & r = get_refl_info(to_env(env), to_name(n))) {\n        return mk_vm_some(to_obj(*r));\n    } else {\n        return mk_vm_none();\n    }\n}\n\nvm_obj environment_trans_for(vm_obj const & env, vm_obj const & n) {\n    if (optional<name> const & r = get_trans_info(to_env(env), to_name(n))) {\n        return mk_vm_some(to_obj(*r));\n    } else {\n        return mk_vm_none();\n    }\n}\n\nvm_obj environment_symm_for(vm_obj const & env, vm_obj const & n) {\n    if (optional<name> const & r = get_symm_info(to_env(env), to_name(n))) {\n        return mk_vm_some(to_obj(*r));\n    } else {\n        return mk_vm_none();\n    }\n}\n\nvoid initialize_vm_environment() {\n    DECLARE_VM_BUILTIN(name({\"environment\", \"mk_std\"}),                environment_mk_std);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"trust_lvl\"}),             environment_trust_lvl);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"add\"}),                   environment_add);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"get\"}),                   environment_get);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"fold\"}),                  environment_fold);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"add_inductive\"}),         environment_add_inductive);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"is_inductive\"}),          environment_is_inductive);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"is_constructor\"}),        environment_is_constructor);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"is_recursor\"}),           environment_is_recursor);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"is_recursive\"}),          environment_is_recursive);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"inductive_type_of\"}),     environment_inductive_type_of);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"constructors_of\"}),       environment_constructors_of);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"recursor_of\"}),           environment_recursor_of);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"inductive_num_params\"}),  environment_inductive_num_params);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"inductive_num_indices\"}), environment_inductive_num_indices);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"inductive_dep_elim\"}),    environment_inductive_dep_elim);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"relation_info\"}),         environment_relation_info);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"refl_for\"}),              environment_refl_for);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"symm_for\"}),              environment_symm_for);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"trans_for\"}),             environment_trans_for);\n}\n\nvoid finalize_vm_environment() {\n}\n}\n<commit_msg>fix(library\/vm\/vm_environment): invalid vm_obj being returned<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 \"kernel\/type_checker.h\"\n#include \"kernel\/inductive\/inductive.h\"\n#include \"library\/standard_kernel.h\"\n#include \"library\/module.h\"\n#include \"library\/util.h\"\n#include \"library\/relation_manager.h\"\n#include \"library\/vm\/vm_nat.h\"\n#include \"library\/vm\/vm_name.h\"\n#include \"library\/vm\/vm_option.h\"\n#include \"library\/vm\/vm_level.h\"\n#include \"library\/vm\/vm_expr.h\"\n#include \"library\/vm\/vm_declaration.h\"\n#include \"library\/vm\/vm_exceptional.h\"\n#include \"library\/vm\/vm_list.h\"\n\nnamespace lean {\nstruct vm_environment : public vm_external {\n    environment m_val;\n    vm_environment(environment const & v):m_val(v) {}\n    virtual ~vm_environment() {}\n    virtual void dealloc() override { this->~vm_environment(); get_vm_allocator().deallocate(sizeof(vm_environment), this); }\n};\n\nenvironment const & to_env(vm_obj const & o) {\n    lean_assert(is_external(o));\n    lean_assert(dynamic_cast<vm_environment*>(to_external(o)));\n    return static_cast<vm_environment*>(to_external(o))->m_val;\n}\n\nvm_obj to_obj(environment const & n) {\n    return mk_vm_external(new (get_vm_allocator().allocate(sizeof(vm_environment))) vm_environment(n));\n}\n\nvm_obj environment_mk_std(vm_obj const & l) {\n    return to_obj(mk_environment(force_to_unsigned(l, 0)));\n}\n\nvm_obj environment_trust_lvl(vm_obj const & env) {\n    return mk_vm_nat(to_env(env).trust_lvl());\n}\n\nvm_obj environment_add(vm_obj const & env, vm_obj const & decl) {\n    try {\n        return mk_vm_exceptional_success(to_obj(module::add(to_env(env), check(to_env(env), to_declaration(decl)))));\n    } catch (throwable & ex) {\n        return mk_vm_exceptional_exception(ex);\n    }\n}\n\nvm_obj environment_get(vm_obj const & env, vm_obj const & n) {\n    try {\n        return mk_vm_exceptional_success(to_obj(to_env(env).get(to_name(n))));\n    } catch (throwable & ex) {\n        return mk_vm_exceptional_exception(ex);\n    }\n}\n\nstatic list<inductive::intro_rule> to_list_intro_rule(vm_obj const & cnstrs) {\n    if (is_simple(cnstrs))\n        return list<inductive::intro_rule>();\n    else\n        return list<inductive::intro_rule>(mk_local(to_name(cfield(cfield(cnstrs, 0), 0)),\n                                                    to_expr(cfield(cfield(cnstrs, 0), 1))),\n                                           to_list_intro_rule(cfield(cnstrs, 1)));\n}\n\nvm_obj environment_add_inductive(vm_obj const & env, vm_obj const & n, vm_obj const & ls, vm_obj const & num,\n                                 vm_obj const & type, vm_obj const & cnstrs, vm_obj const & is_meta) {\n    try {\n        environment new_env = module::add_inductive(to_env(env),\n                                                    inductive::inductive_decl(to_name(n),\n                                                                              to_list_name(ls),\n                                                                              force_to_unsigned(num, 0),\n                                                                              to_expr(type),\n                                                                              to_list_intro_rule(cnstrs)),\n                                                    !to_bool(is_meta));\n        return mk_vm_exceptional_success(to_obj(new_env));\n    } catch (throwable & ex) {\n        return mk_vm_exceptional_exception(ex);\n    }\n}\n\nvm_obj environment_is_inductive(vm_obj const & env, vm_obj const & n) {\n    return mk_vm_bool(static_cast<bool>(inductive::is_inductive_decl(to_env(env), to_name(n))));\n}\n\nvm_obj environment_is_constructor(vm_obj const & env, vm_obj const & n) {\n    return mk_vm_bool(static_cast<bool>(inductive::is_intro_rule(to_env(env), to_name(n))));\n}\n\nvm_obj environment_inductive_type_of(vm_obj const & env, vm_obj const & n) {\n    if (auto I = inductive::is_intro_rule(to_env(env), to_name(n)))\n        return mk_vm_some(to_obj(*I));\n    else\n        return mk_vm_none();\n}\n\nvm_obj environment_is_recursor(vm_obj const & env, vm_obj const & n) {\n    return mk_vm_bool(static_cast<bool>(inductive::is_elim_rule(to_env(env), to_name(n))));\n}\n\nvm_obj environment_is_recursive(vm_obj const & env, vm_obj const & n) {\n    return mk_vm_bool(static_cast<bool>(is_recursive_datatype(to_env(env), to_name(n))));\n}\n\nvm_obj environment_constructors_of(vm_obj const & env, vm_obj const & n) {\n    buffer<name> ns;\n    get_intro_rule_names(to_env(env), to_name(n), ns);\n    return to_obj(to_list(ns));\n}\n\nvm_obj environment_recursor_of(vm_obj const & env, vm_obj const & n) {\n    if (auto I = inductive::is_elim_rule(to_env(env), to_name(n)))\n        return mk_vm_some(to_obj(*I));\n    else\n        return mk_vm_none();\n}\n\nvm_obj environment_inductive_num_params(vm_obj const & env, vm_obj const & n) {\n    if (auto r = inductive::get_num_params(to_env(env), to_name(n)))\n        return mk_vm_nat(*r);\n    else\n        return mk_vm_nat(0);\n}\n\nvm_obj environment_inductive_num_indices(vm_obj const & env, vm_obj const & n) {\n    if (auto r = inductive::get_num_indices(to_env(env), to_name(n)))\n        return mk_vm_nat(*r);\n    else\n        return mk_vm_nat(0);\n}\n\nvm_obj environment_inductive_dep_elim(vm_obj const & env, vm_obj const & n) {\n    return mk_vm_bool(inductive::has_dep_elim(to_env(env), to_name(n)));\n}\n\nvm_obj environment_fold(vm_obj const &, vm_obj const & env, vm_obj const & a, vm_obj const & fn) {\n    vm_obj r = a;\n    to_env(env).for_each_declaration([&](declaration const & d) {\n            r = invoke(fn, to_obj(d), r);\n        });\n    return r;\n}\n\nvm_obj environment_relation_info(vm_obj const & env, vm_obj const & n) {\n    if (relation_info const * info = get_relation_info(to_env(env), to_name(n))) {\n        vm_obj r = mk_vm_pair(mk_vm_nat(info->get_arity()), mk_vm_pair(mk_vm_nat(info->get_lhs_pos()), mk_vm_nat(info->get_rhs_pos())));\n        return mk_vm_some(r);\n    } else {\n        return mk_vm_none();\n    }\n}\n\nvm_obj environment_refl_for(vm_obj const & env, vm_obj const & n) {\n    if (optional<name> const & r = get_refl_info(to_env(env), to_name(n))) {\n        return mk_vm_some(to_obj(*r));\n    } else {\n        return mk_vm_none();\n    }\n}\n\nvm_obj environment_trans_for(vm_obj const & env, vm_obj const & n) {\n    if (optional<name> const & r = get_trans_info(to_env(env), to_name(n))) {\n        return mk_vm_some(to_obj(*r));\n    } else {\n        return mk_vm_none();\n    }\n}\n\nvm_obj environment_symm_for(vm_obj const & env, vm_obj const & n) {\n    if (optional<name> const & r = get_symm_info(to_env(env), to_name(n))) {\n        return mk_vm_some(to_obj(*r));\n    } else {\n        return mk_vm_none();\n    }\n}\n\nvoid initialize_vm_environment() {\n    DECLARE_VM_BUILTIN(name({\"environment\", \"mk_std\"}),                environment_mk_std);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"trust_lvl\"}),             environment_trust_lvl);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"add\"}),                   environment_add);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"get\"}),                   environment_get);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"fold\"}),                  environment_fold);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"add_inductive\"}),         environment_add_inductive);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"is_inductive\"}),          environment_is_inductive);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"is_constructor\"}),        environment_is_constructor);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"is_recursor\"}),           environment_is_recursor);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"is_recursive\"}),          environment_is_recursive);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"inductive_type_of\"}),     environment_inductive_type_of);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"constructors_of\"}),       environment_constructors_of);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"recursor_of\"}),           environment_recursor_of);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"inductive_num_params\"}),  environment_inductive_num_params);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"inductive_num_indices\"}), environment_inductive_num_indices);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"inductive_dep_elim\"}),    environment_inductive_dep_elim);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"relation_info\"}),         environment_relation_info);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"refl_for\"}),              environment_refl_for);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"symm_for\"}),              environment_symm_for);\n    DECLARE_VM_BUILTIN(name({\"environment\", \"trans_for\"}),             environment_trans_for);\n}\n\nvoid finalize_vm_environment() {\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: DataSeriesHelper.hxx,v $\n * $Revision: 1.7.24.1 $\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 CHART2_DATASERIESHELPER_HXX\n#define CHART2_DATASERIESHELPER_HXX\n\n#include <com\/sun\/star\/chart2\/data\/XDataSequence.hpp>\n#include <com\/sun\/star\/chart2\/data\/XDataSource.hpp>\n#include <com\/sun\/star\/chart2\/XDataSeries.hpp>\n#include <com\/sun\/star\/chart2\/XDiagram.hpp>\n#include <com\/sun\/star\/chart2\/XCoordinateSystem.hpp>\n#include <com\/sun\/star\/chart2\/XChartType.hpp>\n\n#include \"StackMode.hxx\"\n#include \"charttoolsdllapi.hxx\"\n\n#include <vector>\n#include <functional>\n\nnamespace chart\n{\n\nnamespace DataSeriesHelper\n{\n\nOOO_DLLPUBLIC_CHARTTOOLS ::rtl::OUString GetRole(\n        const ::com::sun::star::uno::Reference<\n            ::com::sun::star::chart2::data::XLabeledDataSequence >& xLabeledDataSequence );\n\n\/** Retrieves the data sequence in the given data source that matches the\n    given role.  If more than one sequences match the role, the first match\n    is returned.  If no sequence matches, an empty reference is returned.\n\n    @param aSource\n        The data source containing all data sequences to be searched through.\n\n    @param aRole\n        The role that is to be filtered out.\n*\/\nOOO_DLLPUBLIC_CHARTTOOLS ::com::sun::star::uno::Reference< ::com::sun::star::chart2::data::XLabeledDataSequence >\n    getDataSequenceByRole( const ::com::sun::star::uno::Reference<\n                               ::com::sun::star::chart2::data::XDataSource > & xSource,\n                           ::rtl::OUString aRole,\n                           bool bMatchPrefix = false );\n\n\/** Retrieves all data sequences in the given data source that match the given\n    role.\n\n    @param aSource\n        The data source containing all data sequences to be searched through.\n\n    @param aRole\n        The role that is to be filtered out.\n*\/\nOOO_DLLPUBLIC_CHARTTOOLS ::std::vector<\n  ::com::sun::star::uno::Reference< ::com::sun::star::chart2::data::XLabeledDataSequence > >\n    getAllDataSequencesByRole( const ::com::sun::star::uno::Sequence<\n                                   ::com::sun::star::uno::Reference<\n                                       ::com::sun::star::chart2::data::XLabeledDataSequence > > & aDataSequences,\n                               ::rtl::OUString aRole,\n                               bool bMatchPrefix = false );\n\n\/** Retrieves all data sequences found in the given data series and puts them\n    into a data source.  The order of sequences will match the order of the data\n    series.\n *\/\nOOO_DLLPUBLIC_CHARTTOOLS ::com::sun::star::uno::Reference<\n        ::com::sun::star::chart2::data::XDataSource >\n    getDataSource( const ::com::sun::star::uno::Sequence<\n                          ::com::sun::star::uno::Reference<\n                              ::com::sun::star::chart2::XDataSeries > > & aSeries );\n\n\n\/** Get the label of a series (e.g. for the legend)\n\n    @param rLabelSequenceRole\n        The data sequence contained in xSeries that has this role will be used\n        to take its label.\n *\/\nOOO_DLLPUBLIC_CHARTTOOLS ::rtl::OUString getDataSeriesLabel(\n    const ::com::sun::star::uno::Reference<\n        ::com::sun::star::chart2::XDataSeries > & xSeries,\n    const ::rtl::OUString & rLabelSequenceRole );\n\n\/** Get the label of a labeled sequence including neccessary automatic generation\n *\/\nOOO_DLLPUBLIC_CHARTTOOLS ::rtl::OUString getLabelForLabeledDataSequence(\n    const ::com::sun::star::uno::Reference<\n        ::com::sun::star::chart2::data::XLabeledDataSequence > & xLabeledSeq );\n\nOOO_DLLPUBLIC_CHARTTOOLS void setStackModeAtSeries(\n    const ::com::sun::star::uno::Sequence<\n        ::com::sun::star::uno::Reference< ::com::sun::star::chart2::XDataSeries > > & aSeries,\n    const ::com::sun::star::uno::Reference<\n        ::com::sun::star::chart2::XCoordinateSystem > & xCorrespondingCoordinateSystem,\n    StackMode eStackMode );\n\nOOO_DLLPUBLIC_CHARTTOOLS sal_Int32 getAttachedAxisIndex(\n    const ::com::sun::star::uno::Reference< ::com::sun::star::chart2::XDataSeries > & xSeries );\n\n\/\/\/ @param nAxisIndex, if -1 it is determined by the given data series via getAttachedAxisIndex\nOOO_DLLPUBLIC_CHARTTOOLS sal_Int32 getNumberFormatKeyFromAxis(\n    const ::com::sun::star::uno::Reference< ::com::sun::star::chart2::XDataSeries > & xSeries,\n    const ::com::sun::star::uno::Reference<\n        ::com::sun::star::chart2::XCoordinateSystem > & xCorrespondingCoordinateSystem,\n    sal_Int32 nDimensionIndex,\n    sal_Int32 nAxisIndex = -1 );\n\nOOO_DLLPUBLIC_CHARTTOOLS\n::com::sun::star::uno::Reference< ::com::sun::star::chart2::XCoordinateSystem >\n    getCoordinateSystemOfSeries(\n        const ::com::sun::star::uno::Reference< ::com::sun::star::chart2::XDataSeries > & xSeries,\n        const ::com::sun::star::uno::Reference< ::com::sun::star::chart2::XDiagram > & xDiagram );\n\nOOO_DLLPUBLIC_CHARTTOOLS\n::com::sun::star::uno::Reference< ::com::sun::star::chart2::XChartType >\n    getChartTypeOfSeries(\n        const ::com::sun::star::uno::Reference< ::com::sun::star::chart2::XDataSeries > & xSeries,\n        const ::com::sun::star::uno::Reference< ::com::sun::star::chart2::XDiagram > & xDiagram );\n\nOOO_DLLPUBLIC_CHARTTOOLS void deleteSeries(\n    const ::com::sun::star::uno::Reference<\n        ::com::sun::star::chart2::XDataSeries > & xSeries,\n    const ::com::sun::star::uno::Reference<\n        ::com::sun::star::chart2::XChartType > & xChartType );\n\nOOO_DLLPUBLIC_CHARTTOOLS void switchSymbolsOnOrOff(\n    const ::com::sun::star::uno::Reference<\n        ::com::sun::star::beans::XPropertySet > & xSeriesProperties,\n    bool bSymbolsOn, sal_Int32 nSeriesIndex );\n\nOOO_DLLPUBLIC_CHARTTOOLS void switchLinesOnOrOff(\n    const ::com::sun::star::uno::Reference<\n        ::com::sun::star::beans::XPropertySet > & xSeriesProperties,\n    bool bLinesOn );\n\nOOO_DLLPUBLIC_CHARTTOOLS\nvoid makeLinesThickOrThin( const ::com::sun::star::uno::Reference<\n        ::com::sun::star::beans::XPropertySet > & xSeriesProperties, bool bThick );\n\nOOO_DLLPUBLIC_CHARTTOOLS void setPropertyAlsoToAllAttributedDataPoints(\n    const ::com::sun::star::uno::Reference<\n        ::com::sun::star::chart2::XDataSeries >& xSeries,\n        const ::rtl::OUString& rPropertyName,\n        const ::com::sun::star::uno::Any& rPropertyValue );\n\nOOO_DLLPUBLIC_CHARTTOOLS bool hasAttributedDataPointDifferentValue(\n    const ::com::sun::star::uno::Reference<\n        ::com::sun::star::chart2::XDataSeries >& xSeries,\n    const ::rtl::OUString& rPropertyName,\n    const ::com::sun::star::uno::Any& rPropertyValue );\n\nbool areAllSeriesAttachedToSameAxis(\n        const ::com::sun::star::uno::Reference< ::com::sun::star::chart2::XChartType >& xChartType,\n        sal_Int32 & rOutAxisIndex );\n\n} \/\/  namespace DataSeriesHelper\n} \/\/  namespace chart\n\n\/\/ CHART2_DATASERIESHELPER_HXX\n#endif\n<commit_msg>#i10000#: export method areAllSeriesAttachedToSameAxis()<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: DataSeriesHelper.hxx,v $\n * $Revision: 1.7.24.1 $\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 CHART2_DATASERIESHELPER_HXX\n#define CHART2_DATASERIESHELPER_HXX\n\n#include <com\/sun\/star\/chart2\/data\/XDataSequence.hpp>\n#include <com\/sun\/star\/chart2\/data\/XDataSource.hpp>\n#include <com\/sun\/star\/chart2\/XDataSeries.hpp>\n#include <com\/sun\/star\/chart2\/XDiagram.hpp>\n#include <com\/sun\/star\/chart2\/XCoordinateSystem.hpp>\n#include <com\/sun\/star\/chart2\/XChartType.hpp>\n\n#include \"StackMode.hxx\"\n#include \"charttoolsdllapi.hxx\"\n\n#include <vector>\n#include <functional>\n\nnamespace chart\n{\n\nnamespace DataSeriesHelper\n{\n\nOOO_DLLPUBLIC_CHARTTOOLS ::rtl::OUString GetRole(\n        const ::com::sun::star::uno::Reference<\n            ::com::sun::star::chart2::data::XLabeledDataSequence >& xLabeledDataSequence );\n\n\/** Retrieves the data sequence in the given data source that matches the\n    given role.  If more than one sequences match the role, the first match\n    is returned.  If no sequence matches, an empty reference is returned.\n\n    @param aSource\n        The data source containing all data sequences to be searched through.\n\n    @param aRole\n        The role that is to be filtered out.\n*\/\nOOO_DLLPUBLIC_CHARTTOOLS ::com::sun::star::uno::Reference< ::com::sun::star::chart2::data::XLabeledDataSequence >\n    getDataSequenceByRole( const ::com::sun::star::uno::Reference<\n                               ::com::sun::star::chart2::data::XDataSource > & xSource,\n                           ::rtl::OUString aRole,\n                           bool bMatchPrefix = false );\n\n\/** Retrieves all data sequences in the given data source that match the given\n    role.\n\n    @param aSource\n        The data source containing all data sequences to be searched through.\n\n    @param aRole\n        The role that is to be filtered out.\n*\/\nOOO_DLLPUBLIC_CHARTTOOLS ::std::vector<\n  ::com::sun::star::uno::Reference< ::com::sun::star::chart2::data::XLabeledDataSequence > >\n    getAllDataSequencesByRole( const ::com::sun::star::uno::Sequence<\n                                   ::com::sun::star::uno::Reference<\n                                       ::com::sun::star::chart2::data::XLabeledDataSequence > > & aDataSequences,\n                               ::rtl::OUString aRole,\n                               bool bMatchPrefix = false );\n\n\/** Retrieves all data sequences found in the given data series and puts them\n    into a data source.  The order of sequences will match the order of the data\n    series.\n *\/\nOOO_DLLPUBLIC_CHARTTOOLS ::com::sun::star::uno::Reference<\n        ::com::sun::star::chart2::data::XDataSource >\n    getDataSource( const ::com::sun::star::uno::Sequence<\n                          ::com::sun::star::uno::Reference<\n                              ::com::sun::star::chart2::XDataSeries > > & aSeries );\n\n\n\/** Get the label of a series (e.g. for the legend)\n\n    @param rLabelSequenceRole\n        The data sequence contained in xSeries that has this role will be used\n        to take its label.\n *\/\nOOO_DLLPUBLIC_CHARTTOOLS ::rtl::OUString getDataSeriesLabel(\n    const ::com::sun::star::uno::Reference<\n        ::com::sun::star::chart2::XDataSeries > & xSeries,\n    const ::rtl::OUString & rLabelSequenceRole );\n\n\/** Get the label of a labeled sequence including neccessary automatic generation\n *\/\nOOO_DLLPUBLIC_CHARTTOOLS ::rtl::OUString getLabelForLabeledDataSequence(\n    const ::com::sun::star::uno::Reference<\n        ::com::sun::star::chart2::data::XLabeledDataSequence > & xLabeledSeq );\n\nOOO_DLLPUBLIC_CHARTTOOLS void setStackModeAtSeries(\n    const ::com::sun::star::uno::Sequence<\n        ::com::sun::star::uno::Reference< ::com::sun::star::chart2::XDataSeries > > & aSeries,\n    const ::com::sun::star::uno::Reference<\n        ::com::sun::star::chart2::XCoordinateSystem > & xCorrespondingCoordinateSystem,\n    StackMode eStackMode );\n\nOOO_DLLPUBLIC_CHARTTOOLS sal_Int32 getAttachedAxisIndex(\n    const ::com::sun::star::uno::Reference< ::com::sun::star::chart2::XDataSeries > & xSeries );\n\n\/\/\/ @param nAxisIndex, if -1 it is determined by the given data series via getAttachedAxisIndex\nOOO_DLLPUBLIC_CHARTTOOLS sal_Int32 getNumberFormatKeyFromAxis(\n    const ::com::sun::star::uno::Reference< ::com::sun::star::chart2::XDataSeries > & xSeries,\n    const ::com::sun::star::uno::Reference<\n        ::com::sun::star::chart2::XCoordinateSystem > & xCorrespondingCoordinateSystem,\n    sal_Int32 nDimensionIndex,\n    sal_Int32 nAxisIndex = -1 );\n\nOOO_DLLPUBLIC_CHARTTOOLS\n::com::sun::star::uno::Reference< ::com::sun::star::chart2::XCoordinateSystem >\n    getCoordinateSystemOfSeries(\n        const ::com::sun::star::uno::Reference< ::com::sun::star::chart2::XDataSeries > & xSeries,\n        const ::com::sun::star::uno::Reference< ::com::sun::star::chart2::XDiagram > & xDiagram );\n\nOOO_DLLPUBLIC_CHARTTOOLS\n::com::sun::star::uno::Reference< ::com::sun::star::chart2::XChartType >\n    getChartTypeOfSeries(\n        const ::com::sun::star::uno::Reference< ::com::sun::star::chart2::XDataSeries > & xSeries,\n        const ::com::sun::star::uno::Reference< ::com::sun::star::chart2::XDiagram > & xDiagram );\n\nOOO_DLLPUBLIC_CHARTTOOLS void deleteSeries(\n    const ::com::sun::star::uno::Reference<\n        ::com::sun::star::chart2::XDataSeries > & xSeries,\n    const ::com::sun::star::uno::Reference<\n        ::com::sun::star::chart2::XChartType > & xChartType );\n\nOOO_DLLPUBLIC_CHARTTOOLS void switchSymbolsOnOrOff(\n    const ::com::sun::star::uno::Reference<\n        ::com::sun::star::beans::XPropertySet > & xSeriesProperties,\n    bool bSymbolsOn, sal_Int32 nSeriesIndex );\n\nOOO_DLLPUBLIC_CHARTTOOLS void switchLinesOnOrOff(\n    const ::com::sun::star::uno::Reference<\n        ::com::sun::star::beans::XPropertySet > & xSeriesProperties,\n    bool bLinesOn );\n\nOOO_DLLPUBLIC_CHARTTOOLS\nvoid makeLinesThickOrThin( const ::com::sun::star::uno::Reference<\n        ::com::sun::star::beans::XPropertySet > & xSeriesProperties, bool bThick );\n\nOOO_DLLPUBLIC_CHARTTOOLS void setPropertyAlsoToAllAttributedDataPoints(\n    const ::com::sun::star::uno::Reference<\n        ::com::sun::star::chart2::XDataSeries >& xSeries,\n        const ::rtl::OUString& rPropertyName,\n        const ::com::sun::star::uno::Any& rPropertyValue );\n\nOOO_DLLPUBLIC_CHARTTOOLS bool hasAttributedDataPointDifferentValue(\n    const ::com::sun::star::uno::Reference<\n        ::com::sun::star::chart2::XDataSeries >& xSeries,\n    const ::rtl::OUString& rPropertyName,\n    const ::com::sun::star::uno::Any& rPropertyValue );\n\nOOO_DLLPUBLIC_CHARTTOOLS bool areAllSeriesAttachedToSameAxis(\n        const ::com::sun::star::uno::Reference< ::com::sun::star::chart2::XChartType >& xChartType,\n        sal_Int32 & rOutAxisIndex );\n\n} \/\/  namespace DataSeriesHelper\n} \/\/  namespace chart\n\n\/\/ CHART2_DATASERIESHELPER_HXX\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include <QtCore\/QUuid>\n#include <QtGui\/QLabel>\n#include <QtGui\/QMouseEvent>\n#include <QtGui\/QVBoxLayout>\n#include <QtGui\/QComboBox>\n#include <QtGui\/QScrollArea>\n\n#include \"paletteToolbox.h\"\n#include \"..\/..\/qrkernel\/definitions.h\"\n#include <algorithm>\nusing namespace qReal;\nusing namespace qReal::gui;\n\nPaletteToolbox::DraggableElement::DraggableElement(Id const &id, QString const &name, QString const &description,\n\tQIcon const &icon, QWidget *parent)\n: QWidget(parent), mId(id), mIcon(icon), mText(name)\n{\n\tQHBoxLayout *layout = new QHBoxLayout(this);\n\tlayout->setContentsMargins(4, 4, 4, 4);\n\n\tQLabel *pic = new QLabel(this);\n\tpic->setFixedSize(24, 24); \/\/ the frame\n\tpic->setPixmap(mIcon.pixmap(22, 22));\n\tlayout->addWidget(pic);\n\n\tQLabel *text = new QLabel(this);\n\ttext->setText(mText);\n\tlayout->addWidget(text);\n\n\tsetLayout(layout);\n\n\tQString modifiedDescription = description;\n\tif (!modifiedDescription.isEmpty()){\n\t\tmodifiedDescription.insert(0, \"<body>\");\/\/turns alignment on\n\t\tsetToolTip(modifiedDescription);\n\t}\n}\n\nPaletteToolbox::PaletteToolbox(QWidget *parent)\n: QWidget(parent), mCurrentTab(0)\n{\n\tcreatePalette();\n}\n\nvoid PaletteToolbox::createPalette()\n{\n\tmLayout = new QVBoxLayout;\n\tmLayout->setSpacing(6);\n\tmLayout->setMargin(0);\n\n\tmComboBox = new QComboBox;\n\tmLayout->addWidget(mComboBox);\n\n\tmScrollArea = new QScrollArea;\n\tmLayout->addWidget(mScrollArea);\n\n\tsetLayout(mLayout);\n}\n\nPaletteToolbox::~PaletteToolbox()\n{\n\tdeletePalette();\n}\n\nvoid PaletteToolbox::deletePalette()\n{\n\tmScrollArea->takeWidget();\n\tdelete mScrollArea;\n\tdelete mComboBox;\n\tdelete mLayout;\n\n\tfor (int i = 0; i < mTabs.count(); i++)\n\t\tdelete mTabs[i];\n\tmTabs.clear();\n\tmTabNames.clear();\n\tmCategories.clear();\n}\n\nvoid PaletteToolbox::setActiveEditor(Id id)\n{\n\tsetActiveEditor(mCategories.value(id, 0));\n}\n\nvoid PaletteToolbox::setActiveEditor(int const comboIndex)\n{\n\tmCurrentTab = comboIndex;\n\tif (mTabs.size() > 0) {\n\t\tmScrollArea->takeWidget(); \/\/ Save current editor from extermination.\n\t\tmScrollArea->setWidget(mTabs[comboIndex]);\n\t}\n}\n\nvoid PaletteToolbox::addDiagramType(Id const &id, QString const &name)\n{\n\tQWidget *tab = new QWidget;\n\tQVBoxLayout *layout = new QVBoxLayout(tab);\n\n\tlayout->setSpacing(0);\n\tlayout->setContentsMargins(0, 0, 0, 0);\n\n\ttab->setLayout(layout);\n\n\tmTabs.append(tab);\n\tmTabNames.append(name);\n\n\tQ_ASSERT(id.idSize() == 2); \/\/ it should be diagram\n\tmCategories[id] = mTabs.size() - 1;\n\n\tmComboBox->addItem(name);\n\n\tQ_ASSERT(mTabNames.size() == mTabs.size());\n}\n\nvoid PaletteToolbox::addItemType(Id const &id, QString const &name, QString const &description,  QIcon const &icon)\n{\n\tId category(id.editor(), id.diagram());\n\tQWidget *tab = mTabs[mCategories[category]];\n\tQ_ASSERT(tab);\n\n\tDraggableElement *element = new DraggableElement(id, name, description, icon, this);\n\ttab->layout()->addWidget(element);\n}\nvoid PaletteToolbox::qsort(QVector<const Id *> &m, const int p, const int r, EditorManager * editorManager){\n\tif (r > p + 1){\n\t\tconst Id* x = m[p];\n\t\tint i = p;\n\t\tint j = r - 1;\n\t\tconst Id* t;\n\t\twhile (i <= j){\n\t\t\twhile (editorManager->friendlyName(*m[i]).compare(editorManager->friendlyName(*x),\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t  Qt::CaseSensitivity(false)) < 0)\n\t\t\t\ti++;\n\t\t\twhile (editorManager->friendlyName(*m[j]).compare(editorManager->friendlyName(*x),\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t  Qt::CaseSensitivity(false)) > 0)\n\t\t\t\tj--;\n\t\t\tif (i <= j){\n\t\t\t\tt = m[i];\n\t\t\t\tm[i] = m[j];\n\t\t\t\tm[j] = t;\n\t\t\t\ti++;\n\t\t\t\tj--;\n\t\t\t}\n\t\t}\n\tif (p + 1 < i)\n\t\tqsort(m, p, i, editorManager);\n\tif (i + 1 < r)\n\t\tqsort(m, i, r, editorManager);\n\t}\n}\nvoid  PaletteToolbox::addSortedItemTypes(EditorManager * editorManager, const Id * diagram){\n\tQVector <const Id * > sortedIds;\n\tsortedIds.resize(editorManager->elements(*diagram).size());\n\tint i = 0;\n\tQListIterator < Id > Iter(editorManager->elements(*diagram));\n\twhile (Iter.hasNext())\n\t\tsortedIds[i++] = &Iter.next();\n\tqsort(sortedIds, 0, i, editorManager);\n\tforeach (const Id *element, sortedIds){\n\t\taddItemType(*element, editorManager->friendlyName(*element),\n\t\t\t\t\t\t\t\t\t\t editorManager->description(*element), editorManager->icon(*element));\n\t}\n}\n\nvoid PaletteToolbox::deleteDiagramType(const Id &id)\n{\n\tif (mCategories.contains(id)) {\n\t\tmComboBox->removeItem(mCategories[id]);\n\t\tmTabNames.remove(mCategories[id]);\n\t\tmTabs.remove(mCategories[id]);\n\t\tmCategories.remove(id);\n\t}\n}\n\nvoid PaletteToolbox::initDone()\n{\n\tconnect(mComboBox, SIGNAL(currentIndexChanged(int)), this, SLOT(setActiveEditor(int)));\n\tsetActiveEditor(0);\n}\n\nQComboBox* PaletteToolbox::getComboBox()\n{\n\treturn mComboBox;\n}\n\nQVector<QString> PaletteToolbox::getTabNames()\n{\n\treturn mTabNames;\n}\n\nvoid PaletteToolbox::dragEnterEvent(QDragEnterEvent * \/*event*\/)\n{\n}\n\nvoid PaletteToolbox::dropEvent(QDropEvent * \/*event*\/)\n{\n}\n\nvoid PaletteToolbox::mousePressEvent(QMouseEvent *event)\n{\n\tQWidget *atMouse = childAt(event->pos());\n\tif (!atMouse || atMouse == this)\n\t\treturn;\n\n\tDraggableElement *child = dynamic_cast<DraggableElement *>(atMouse->parent());\n\tif (!child)\n\t\tchild = dynamic_cast<DraggableElement *>(atMouse);\n\tif (!child)\n\t\treturn;\n\n\tQ_ASSERT(child->id().idSize() == 3); \/\/ it should be element type\n\n\t\/\/ new element's ID is being generated here\n\t\/\/ may this epic event should take place in some more appropriate place\n\n\tId elementId(child->id(), QUuid::createUuid().toString());\n\n\tQByteArray itemData;\n\tbool isFromLogicalModel = false;\n\n\tQDataStream stream(&itemData, QIODevice::WriteOnly);\n\tstream << elementId.toString();  \/\/ uuid\n\tstream << Id::rootId().toString();  \/\/ pathToItem\n\tstream << QString(\"(\" + child->text() + \")\");\n\tstream << QPointF(0, 0);\n\tstream << isFromLogicalModel;\n\n\tQMimeData *mimeData = new QMimeData;\n\tmimeData->setData(\"application\/x-real-uml-data\", itemData);\n\n\tQDrag *drag = new QDrag(this);\n\tdrag->setMimeData(mimeData);\n\n\tQPixmap p = child->icon().pixmap(96, 96);\n\n\tif (!p.isNull())\n\t\tdrag->setPixmap(child->icon().pixmap(96, 96));\n\n\tif (drag->start(Qt::CopyAction | Qt::MoveAction) == Qt::MoveAction)\n\t\tchild->close();\n\telse\n\t\tchild->show();\n}\n\nId PaletteToolbox::currentTab()\n{\n\treturn mCategories.key(mCurrentTab);\n}\n\nvoid PaletteToolbox::setComboBox(Id id)\n{\n\tmComboBox->setCurrentIndex(mCategories.value(id, -1));\n}\n\nvoid PaletteToolbox::recreateTabs()\n{\n\tdeletePalette();\n\tcreatePalette();\n}\n<commit_msg>Added diagram item types sorting<commit_after>#include <QtCore\/QUuid>\n#include <QtGui\/QLabel>\n#include <QtGui\/QMouseEvent>\n#include <QtGui\/QVBoxLayout>\n#include <QtGui\/QComboBox>\n#include <QtGui\/QScrollArea>\n\n#include \"paletteToolbox.h\"\n#include \"..\/..\/qrkernel\/definitions.h\"\n#include <algorithm>\nusing namespace qReal;\nusing namespace qReal::gui;\n\nPaletteToolbox::DraggableElement::DraggableElement(Id const &id, QString const &name, QString const &description,\n\tQIcon const &icon, QWidget *parent)\n: QWidget(parent), mId(id), mIcon(icon), mText(name)\n{\n\tQHBoxLayout *layout = new QHBoxLayout(this);\n\tlayout->setContentsMargins(4, 4, 4, 4);\n\n\tQLabel *pic = new QLabel(this);\n\tpic->setFixedSize(24, 24); \/\/ the frame\n\tpic->setPixmap(mIcon.pixmap(22, 22));\n\tlayout->addWidget(pic);\n\n\tQLabel *text = new QLabel(this);\n\ttext->setText(mText);\n\tlayout->addWidget(text);\n\n\tsetLayout(layout);\n\n\tQString modifiedDescription = description;\n\tif (!modifiedDescription.isEmpty()){\n\t\tmodifiedDescription.insert(0, \"<body>\");\/\/turns alignment on\n\t\tsetToolTip(modifiedDescription);\n\t}\n}\n\nPaletteToolbox::PaletteToolbox(QWidget *parent)\n: QWidget(parent), mCurrentTab(0)\n{\n\tcreatePalette();\n}\n\nvoid PaletteToolbox::createPalette()\n{\n\tmLayout = new QVBoxLayout;\n\tmLayout->setSpacing(6);\n\tmLayout->setMargin(0);\n\n\tmComboBox = new QComboBox;\n\tmLayout->addWidget(mComboBox);\n\n\tmScrollArea = new QScrollArea;\n\tmLayout->addWidget(mScrollArea);\n\n\tsetLayout(mLayout);\n}\n\nPaletteToolbox::~PaletteToolbox()\n{\n\tdeletePalette();\n}\n\nvoid PaletteToolbox::deletePalette()\n{\n\tmScrollArea->takeWidget();\n\tdelete mScrollArea;\n\tdelete mComboBox;\n\tdelete mLayout;\n\n\tfor (int i = 0; i < mTabs.count(); i++)\n\t\tdelete mTabs[i];\n\tmTabs.clear();\n\tmTabNames.clear();\n\tmCategories.clear();\n}\n\nvoid PaletteToolbox::setActiveEditor(Id id)\n{\n\tsetActiveEditor(mCategories.value(id, 0));\n}\n\nvoid PaletteToolbox::setActiveEditor(int const comboIndex)\n{\n\tmCurrentTab = comboIndex;\n\tif (mTabs.size() > 0) {\n\t\tmScrollArea->takeWidget(); \/\/ Save current editor from extermination.\n\t\tmScrollArea->setWidget(mTabs[comboIndex]);\n\t}\n}\n\nvoid PaletteToolbox::addDiagramType(Id const &id, QString const &name)\n{\n\tQWidget *tab = new QWidget;\n\tQVBoxLayout *layout = new QVBoxLayout(tab);\n\n\tlayout->setSpacing(0);\n\tlayout->setContentsMargins(0, 0, 0, 0);\n\n\ttab->setLayout(layout);\n\n\tmTabs.append(tab);\n\tmTabNames.append(name);\n\n\tQ_ASSERT(id.idSize() == 2); \/\/ it should be diagram\n\tmCategories[id] = mTabs.size() - 1;\n\n\tmComboBox->addItem(name);\n\n\tQ_ASSERT(mTabNames.size() == mTabs.size());\n}\n\nvoid PaletteToolbox::addItemType(Id const &id, QString const &name, QString const &description,  QIcon const &icon)\n{\n\tId category(id.editor(), id.diagram());\n\tQWidget *tab = mTabs[mCategories[category]];\n\tQ_ASSERT(tab);\n\n\tDraggableElement *element = new DraggableElement(id, name, description, icon, this);\n\ttab->layout()->addWidget(element);\n}\nvoid PaletteToolbox::qsort(QVector<const Id *> &m, const int p, const int r, EditorManager * editorManager){\n\tif (r > p + 1){\n\t\tconst Id* x = m[p];\n\t\tint i = p;\n\t\tint j = r - 1;\n\t\tconst Id* t;\n\t\twhile (i <= j){\n\t\t\twhile (editorManager->friendlyName(*m[i]).compare(editorManager->friendlyName(*x),\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t  Qt::CaseSensitivity(false)) < 0)\n\t\t\t\ti++;\n\t\t\twhile (editorManager->friendlyName(*m[j]).compare(editorManager->friendlyName(*x),\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t  Qt::CaseSensitivity(false)) > 0)\n\t\t\t\tj--;\n\t\t\tif (i <= j){\n\t\t\t\tt = m[i];\n\t\t\t\tm[i] = m[j];\n\t\t\t\tm[j] = t;\n\t\t\t\ti++;\n\t\t\t\tj--;\n\t\t\t}\n\t\t}\n\tif (p + 1 < i)\n\t\tqsort(m, p, i, editorManager);\n\n\tif (i + 1 < r)\n\t\tqsort(m, i, r, editorManager);\n\t}\n}\nvoid  PaletteToolbox::addSortedItemTypes(EditorManager * editorManager, const Id * diagram){\n\tQVector <const Id * > sortedIds;\n\tsortedIds.resize(editorManager->elements(*diagram).size());\n\tint i = 0;\n\tQListIterator < Id > Iter(editorManager->elements(*diagram));\n\twhile (Iter.hasNext())\n\t\tsortedIds[i++] = &Iter.next();\n\tqsort(sortedIds, 0, i, editorManager);\n\tforeach (const Id *element, sortedIds){\n\t\taddItemType(*element, editorManager->friendlyName(*element),\n\t\t\t\t\t\t\t\t\t\t editorManager->description(*element), editorManager->icon(*element));\n\t}\n}\n\nvoid PaletteToolbox::deleteDiagramType(const Id &id)\n{\n\tif (mCategories.contains(id)) {\n\t\tmComboBox->removeItem(mCategories[id]);\n\t\tmTabNames.remove(mCategories[id]);\n\t\tmTabs.remove(mCategories[id]);\n\t\tmCategories.remove(id);\n\t}\n}\n\nvoid PaletteToolbox::initDone()\n{\n\tconnect(mComboBox, SIGNAL(currentIndexChanged(int)), this, SLOT(setActiveEditor(int)));\n\tsetActiveEditor(0);\n}\n\nQComboBox* PaletteToolbox::getComboBox()\n{\n\treturn mComboBox;\n}\n\nQVector<QString> PaletteToolbox::getTabNames()\n{\n\treturn mTabNames;\n}\n\nvoid PaletteToolbox::dragEnterEvent(QDragEnterEvent * \/*event*\/)\n{\n}\n\nvoid PaletteToolbox::dropEvent(QDropEvent * \/*event*\/)\n{\n}\n\nvoid PaletteToolbox::mousePressEvent(QMouseEvent *event)\n{\n\tQWidget *atMouse = childAt(event->pos());\n\tif (!atMouse || atMouse == this)\n\t\treturn;\n\n\tDraggableElement *child = dynamic_cast<DraggableElement *>(atMouse->parent());\n\tif (!child)\n\t\tchild = dynamic_cast<DraggableElement *>(atMouse);\n\tif (!child)\n\t\treturn;\n\n\tQ_ASSERT(child->id().idSize() == 3); \/\/ it should be element type\n\n\t\/\/ new element's ID is being generated here\n\t\/\/ may this epic event should take place in some more appropriate place\n\n\tId elementId(child->id(), QUuid::createUuid().toString());\n\n\tQByteArray itemData;\n\tbool isFromLogicalModel = false;\n\n\tQDataStream stream(&itemData, QIODevice::WriteOnly);\n\tstream << elementId.toString();  \/\/ uuid\n\tstream << Id::rootId().toString();  \/\/ pathToItem\n\tstream << QString(\"(\" + child->text() + \")\");\n\tstream << QPointF(0, 0);\n\tstream << isFromLogicalModel;\n\n\tQMimeData *mimeData = new QMimeData;\n\tmimeData->setData(\"application\/x-real-uml-data\", itemData);\n\n\tQDrag *drag = new QDrag(this);\n\tdrag->setMimeData(mimeData);\n\n\tQPixmap p = child->icon().pixmap(96, 96);\n\n\tif (!p.isNull())\n\t\tdrag->setPixmap(child->icon().pixmap(96, 96));\n\n\tif (drag->start(Qt::CopyAction | Qt::MoveAction) == Qt::MoveAction)\n\t\tchild->close();\n\telse\n\t\tchild->show();\n}\n\nId PaletteToolbox::currentTab()\n{\n\treturn mCategories.key(mCurrentTab);\n}\n\nvoid PaletteToolbox::setComboBox(Id id)\n{\n\tmComboBox->setCurrentIndex(mCategories.value(id, -1));\n}\n\nvoid PaletteToolbox::recreateTabs()\n{\n\tdeletePalette();\n\tcreatePalette();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <QtCore\/QList>\n#include <vector>\n\nusing namespace std;\n\nQList<int> getQtList()\n{\n    return {}; \/\/ dummy, not important\n}\n\nconst QList<int> getConstQtList()\n{\n    return {}; \/\/ dummy, not important\n}\n\nconst QList<int> & getConstRefQtList()\n{\n    static QList<int> foo;\n    return foo;\n}\n\nvoid testQtContainer()\n{\n    QList<int> qt_container;\n    for (int i : qt_container) { \/\/ Warning\n    }\n\n    const QList<int> const_qt_container;\n    for (int i : const_qt_container) { \/\/ OK\n    }\n\n    for (int i : getQtList()) { \/\/ Warning\n    }\n\n    for (int i : getConstQtList()) { \/\/ OK\n    }\n\n    for (int i : getConstRefQtList()) { \/\/ OK\n    }\n\n    vector<int> stl_container;\n    for (int i : stl_container) { \/\/ OK\n    }\n}\n<commit_msg>foreach: Add another unit-test<commit_after>#include <QtCore\/QList>\n#include <vector>\n\nusing namespace std;\n\nQList<int> getQtList()\n{\n    return {}; \/\/ dummy, not important\n}\n\nconst QList<int> getConstQtList()\n{\n    return {}; \/\/ dummy, not important\n}\n\nconst QList<int> & getConstRefQtList()\n{\n    static QList<int> foo;\n    return foo;\n}\n\nvoid testQtContainer()\n{\n    QList<int> qt_container;\n    for (int i : qt_container) { \/\/ Warning\n    }\n\n    const QList<int> const_qt_container;\n    for (int i : const_qt_container) { \/\/ OK\n    }\n\n    for (int i : getQtList()) { \/\/ Warning\n    }\n\n    for (int i : getConstQtList()) { \/\/ OK\n    }\n\n    for (int i : getConstRefQtList()) { \/\/ OK\n    }\n\n    vector<int> stl_container;\n    for (int i : stl_container) { \/\/ OK\n    }\n}\n\nclass A {\npublic:\n    void foo()\n    {\n        for (int a : m_stlVec) {} \/\/ OK\n    }\n\n    std::vector<int> m_stlVec;\n};\n<|endoftext|>"}
{"text":"<commit_before>\/** \n * @file llfloaterhelpbrowser.cpp\n * @brief HTML Help floater - uses embedded web browser control\n *\n * $LicenseInfo:firstyear=2006&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 \"llfloaterhelpbrowser.h\"\n\n#include \"llfloaterreg.h\"\n#include \"llpluginclassmedia.h\"\n#include \"llmediactrl.h\"\n#include \"llviewerwindow.h\"\n#include \"llviewercontrol.h\"\n#include \"llweb.h\"\n#include \"llui.h\"\n\n#include \"llurlhistory.h\"\n#include \"llmediactrl.h\"\n#include \"llviewermedia.h\"\n\n\nLLFloaterHelpBrowser::LLFloaterHelpBrowser(const LLSD& key)\n\t: LLFloater(key)\n{\n}\n\nBOOL LLFloaterHelpBrowser::postBuild()\n{\n\tmBrowser = getChild<LLMediaCtrl>(\"browser\");\n\tmBrowser->addObserver(this);\n\tmBrowser->setErrorPageURL(gSavedSettings.getString(\"GenericErrorPageURL\"));\n\n\tchildSetAction(\"open_browser\", onClickOpenWebBrowser, this);\n\n\tbuildURLHistory();\n\treturn TRUE;\n}\n\nvoid LLFloaterHelpBrowser::buildURLHistory()\n{\n\t\/\/ Get all of the entries in the \"browser\" collection\n\tLLSD browser_history = LLURLHistory::getURLHistory(\"browser\");\n\n\t\/\/ initialize URL history in the plugin\n\tLLPluginClassMedia *plugin = mBrowser->getMediaPlugin();\n\tif (plugin)\n\t{\n\t\tplugin->initializeUrlHistory(browser_history);\n\t}\n}\n\n\/\/virtual\nvoid LLFloaterHelpBrowser::onClose(bool app_quitting)\n{\n\t\/\/ really really destroy the help browser when it's closed, it'll be recreated.\n\tdestroy(); \/\/ really destroy this dialog on closure, it's relatively heavyweight.\n}\n\nvoid LLFloaterHelpBrowser::handleMediaEvent(LLPluginClassMedia* self, EMediaEvent event)\n{\n\tswitch (event) \n\t{\n\tcase MEDIA_EVENT_LOCATION_CHANGED:\n\t\tsetCurrentURL(self->getLocation());\n\t\tbreak;\n\n\tcase MEDIA_EVENT_NAVIGATE_BEGIN:\n\t\tgetChild<LLUICtrl>(\"status_text\")->setValue(getString(\"loading_text\"));\n\t\tbreak;\n\t\t\n\tcase MEDIA_EVENT_NAVIGATE_COMPLETE:\n\t\tgetChild<LLUICtrl>(\"status_text\")->setValue(getString(\"done_text\"));\n\t\tbreak;\n\n\tdefault:\n\t\tbreak;\n\t}\n}\n\nvoid LLFloaterHelpBrowser::setCurrentURL(const std::string& url)\n{\n\tmCurrentURL = url;\n\n\t\/\/ redirects will navigate momentarily to about:blank, don't add to history\n\tif (mCurrentURL != \"about:blank\")\n\t{\n\t\t\/\/ Serialize url history\n\t\tLLURLHistory::removeURL(\"browser\", mCurrentURL);\n\t\tLLURLHistory::addURL(\"browser\", mCurrentURL);\n\t}\n}\n\n\/\/static \nvoid LLFloaterHelpBrowser::onClickClose(void* user_data)\n{\n\tLLFloaterHelpBrowser* self = (LLFloaterHelpBrowser*)user_data;\n\n\tself->closeFloater();\n}\n\n\/\/static \nvoid LLFloaterHelpBrowser::onClickOpenWebBrowser(void* user_data)\n{\n\tLLFloaterHelpBrowser* self = (LLFloaterHelpBrowser*)user_data;\n\n\tstd::string url = self->mCurrentURL.empty() ? \n\t\tself->mBrowser->getHomePageUrl() :\n\t\tself->mCurrentURL;\n\tLLWeb::loadURLExternal(url);\n}\n\nvoid LLFloaterHelpBrowser::openMedia(const std::string& media_url)\n{\n\t\/\/ explicitly make the media mime type for this floater since it will\n\t\/\/ only ever display one type of content (Web).\n\tmBrowser->setHomePageUrl(media_url, \"text\/html\");\n\tmBrowser->navigateTo(media_url, \"text\/html\");\n\tsetCurrentURL(media_url);\n}\n\nvoid LLFloaterHelpBrowser::navigateToLocalPage( const std::string& subdir, const std::string& filename_in )\n{\n\tmBrowser->navigateToLocalPage(subdir, filename_in);\n}\n<commit_msg>EXP-847 FIX As a user, I would like to see the How To floater appear the first time I log in to basic mode<commit_after>\/** \n * @file llfloaterhelpbrowser.cpp\n * @brief HTML Help floater - uses embedded web browser control\n *\n * $LicenseInfo:firstyear=2006&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 \"llfloaterhelpbrowser.h\"\n\n#include \"llfloaterreg.h\"\n#include \"llpluginclassmedia.h\"\n#include \"llmediactrl.h\"\n#include \"llviewerwindow.h\"\n#include \"llviewercontrol.h\"\n#include \"llweb.h\"\n#include \"llui.h\"\n\n#include \"llurlhistory.h\"\n#include \"llmediactrl.h\"\n#include \"llviewermedia.h\"\n\n\nLLFloaterHelpBrowser::LLFloaterHelpBrowser(const LLSD& key)\n\t: LLFloater(key)\n{\n}\n\nBOOL LLFloaterHelpBrowser::postBuild()\n{\n\tmBrowser = getChild<LLMediaCtrl>(\"browser\");\n\tmBrowser->addObserver(this);\n\tmBrowser->setErrorPageURL(gSavedSettings.getString(\"GenericErrorPageURL\"));\n\n\tchildSetAction(\"open_browser\", onClickOpenWebBrowser, this);\n\n\tbuildURLHistory();\n\treturn TRUE;\n}\n\nvoid LLFloaterHelpBrowser::buildURLHistory()\n{\n\t\/\/ Get all of the entries in the \"browser\" collection\n\tLLSD browser_history = LLURLHistory::getURLHistory(\"browser\");\n\n\t\/\/ initialize URL history in the plugin\n\tLLPluginClassMedia *plugin = mBrowser->getMediaPlugin();\n\tif (plugin)\n\t{\n\t\tplugin->initializeUrlHistory(browser_history);\n\t}\n}\n\nvoid LLFloaterHelpBrowser::onOpen(const LLSD& key)\n{\n\tgSavedSettings.setBOOL(\"HelpFloaterOpen\", TRUE);\n}\n\n\/\/virtual\nvoid LLFloaterHelpBrowser::onClose(bool app_quitting)\n{\n\tif (!app_quitting)\n\t{\n\t\tgSavedSettings.setBOOL(\"HelpFloaterOpen\", FALSE);\n\t}\n\t\/\/ really really destroy the help browser when it's closed, it'll be recreated.\n\tdestroy(); \/\/ really destroy this dialog on closure, it's relatively heavyweight.\n}\n\nvoid LLFloaterHelpBrowser::handleMediaEvent(LLPluginClassMedia* self, EMediaEvent event)\n{\n\tswitch (event) \n\t{\n\tcase MEDIA_EVENT_LOCATION_CHANGED:\n\t\tsetCurrentURL(self->getLocation());\n\t\tbreak;\n\n\tcase MEDIA_EVENT_NAVIGATE_BEGIN:\n\t\tgetChild<LLUICtrl>(\"status_text\")->setValue(getString(\"loading_text\"));\n\t\tbreak;\n\t\t\n\tcase MEDIA_EVENT_NAVIGATE_COMPLETE:\n\t\tgetChild<LLUICtrl>(\"status_text\")->setValue(getString(\"done_text\"));\n\t\tbreak;\n\n\tdefault:\n\t\tbreak;\n\t}\n}\n\nvoid LLFloaterHelpBrowser::setCurrentURL(const std::string& url)\n{\n\tmCurrentURL = url;\n\n\t\/\/ redirects will navigate momentarily to about:blank, don't add to history\n\tif (mCurrentURL != \"about:blank\")\n\t{\n\t\t\/\/ Serialize url history\n\t\tLLURLHistory::removeURL(\"browser\", mCurrentURL);\n\t\tLLURLHistory::addURL(\"browser\", mCurrentURL);\n\t}\n}\n\n\/\/static \nvoid LLFloaterHelpBrowser::onClickClose(void* user_data)\n{\n\tLLFloaterHelpBrowser* self = (LLFloaterHelpBrowser*)user_data;\n\n\tself->closeFloater();\n}\n\n\/\/static \nvoid LLFloaterHelpBrowser::onClickOpenWebBrowser(void* user_data)\n{\n\tLLFloaterHelpBrowser* self = (LLFloaterHelpBrowser*)user_data;\n\n\tstd::string url = self->mCurrentURL.empty() ? \n\t\tself->mBrowser->getHomePageUrl() :\n\t\tself->mCurrentURL;\n\tLLWeb::loadURLExternal(url);\n}\n\nvoid LLFloaterHelpBrowser::openMedia(const std::string& media_url)\n{\n\t\/\/ explicitly make the media mime type for this floater since it will\n\t\/\/ only ever display one type of content (Web).\n\tmBrowser->setHomePageUrl(media_url, \"text\/html\");\n\tmBrowser->navigateTo(media_url, \"text\/html\");\n\tsetCurrentURL(media_url);\n}\n\nvoid LLFloaterHelpBrowser::navigateToLocalPage( const std::string& subdir, const std::string& filename_in )\n{\n\tmBrowser->navigateToLocalPage(subdir, filename_in);\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Mandoline: Fix View Manager tests<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright © 2010 Intel Corporation\n *\n * Permission is hereby granted, free of charge, to any person obtaining a\n * copy of this software and associated documentation files (the \"Software\"),\n * to deal in the Software without restriction, including without limitation\n * the rights to use, copy, modify, merge, publish, distribute, sublicense,\n * and\/or sell copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice (including the next\n * paragraph) shall be included in all copies or substantial portions of the\n * Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL\n * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n * DEALINGS IN THE SOFTWARE.\n *\/\n\n\/**\n * \\file ir_vec_index_to_cond_assign.cpp\n *\n * Turns indexing into vector types to a series of conditional moves\n * of each channel's swizzle into a temporary.\n *\n * Most GPUs don't have a native way to do this operation, and this\n * works around that.  For drivers using both this pass and\n * ir_vec_index_to_swizzle, there's a risk that this pass will happen\n * before sufficient constant folding to find that the array index is\n * constant.  However, we hope that other optimization passes,\n * particularly constant folding of assignment conditions and copy\n * propagation, will result in the same code in the end.\n *\/\n\n#include \"ir.h\"\n#include \"ir_visitor.h\"\n#include \"ir_optimization.h\"\n#include \"glsl_types.h\"\n\n\/**\n * Visitor class for replacing expressions with ir_constant values.\n *\/\n\nclass ir_vec_index_to_cond_assign_visitor : public ir_hierarchical_visitor {\npublic:\n   ir_vec_index_to_cond_assign_visitor()\n   {\n      progress = false;\n   }\n\n   ir_rvalue *convert_vec_index_to_cond_assign(ir_rvalue *val);\n\n   virtual ir_visitor_status visit_enter(ir_expression *);\n   virtual ir_visitor_status visit_enter(ir_swizzle *);\n   virtual ir_visitor_status visit_enter(ir_assignment *);\n   virtual ir_visitor_status visit_enter(ir_return *);\n   virtual ir_visitor_status visit_enter(ir_call *);\n   virtual ir_visitor_status visit_enter(ir_if *);\n\n   bool progress;\n};\n\nir_rvalue *\nir_vec_index_to_cond_assign_visitor::convert_vec_index_to_cond_assign(ir_rvalue *ir)\n{\n   ir_dereference_array *orig_deref = ir->as_dereference_array();\n   ir_assignment *assign;\n   ir_variable *index, *var;\n   ir_dereference *deref;\n   ir_expression *condition;\n   ir_swizzle *swizzle;\n   int i;\n\n   if (!orig_deref)\n      return ir;\n\n   if (orig_deref->array->type->is_matrix() ||\n       orig_deref->array->type->is_array())\n      return ir;\n\n   assert(orig_deref->array_index->type->base_type == GLSL_TYPE_INT);\n\n   \/* Store the index to a temporary to avoid reusing its tree. *\/\n   index = new(base_ir) ir_variable(glsl_type::int_type,\n\t\t\t\t    \"vec_index_tmp_i\");\n   base_ir->insert_before(index);\n   deref = new(base_ir) ir_dereference_variable(index);\n   assign = new(base_ir) ir_assignment(deref, orig_deref->array_index, NULL);\n   base_ir->insert_before(assign);\n\n   \/* Temporary where we store whichever value we swizzle out. *\/\n   var = new(base_ir) ir_variable(ir->type, \"vec_index_tmp_v\");\n   base_ir->insert_before(var);\n\n   \/* Generate a conditional move of each vector element to the temp. *\/\n   for (i = 0; i < orig_deref->array->type->vector_elements; i++) {\n      deref = new(base_ir) ir_dereference_variable(index);\n      condition = new(base_ir) ir_expression(ir_binop_equal,\n\t\t\t\t\t     glsl_type::bool_type,\n\t\t\t\t\t     deref,\n\t\t\t\t\t     new(base_ir) ir_constant(i));\n\n      \/* Just clone the rest of the deref chain when trying to get at the\n       * underlying variable.\n       *\/\n      swizzle = new(base_ir) ir_swizzle(orig_deref->array->clone(NULL),\n\t\t\t\t\ti, 0, 0, 0, 1);\n\n      deref = new(base_ir) ir_dereference_variable(var);\n      assign = new(base_ir) ir_assignment(deref, swizzle, condition);\n      base_ir->insert_before(assign);\n   }\n\n   this->progress = true;\n   return new(base_ir) ir_dereference_variable(var);\n}\n\nir_visitor_status\nir_vec_index_to_cond_assign_visitor::visit_enter(ir_expression *ir)\n{\n   unsigned int i;\n\n   for (i = 0; i < ir->get_num_operands(); i++) {\n      ir->operands[i] = convert_vec_index_to_cond_assign(ir->operands[i]);\n   }\n\n   return visit_continue;\n}\n\nir_visitor_status\nir_vec_index_to_cond_assign_visitor::visit_enter(ir_swizzle *ir)\n{\n   \/* Can't be hit from normal GLSL, since you can't swizzle a scalar (which\n    * the result of indexing a vector is.  But maybe at some point we'll end up\n    * using swizzling of scalars for vector construction.\n    *\/\n   ir->val = convert_vec_index_to_cond_assign(ir->val);\n\n   return visit_continue;\n}\n\nir_visitor_status\nir_vec_index_to_cond_assign_visitor::visit_enter(ir_assignment *ir)\n{\n   \/* FINISHME: Handle it on the LHS. *\/\n   ir->rhs = convert_vec_index_to_cond_assign(ir->rhs);\n\n   return visit_continue;\n}\n\nir_visitor_status\nir_vec_index_to_cond_assign_visitor::visit_enter(ir_call *ir)\n{\n   foreach_iter(exec_list_iterator, iter, *ir) {\n      ir_rvalue *param = (ir_rvalue *)iter.get();\n      ir_rvalue *new_param = convert_vec_index_to_cond_assign(param);\n\n      if (new_param != param) {\n\t param->insert_before(new_param);\n\t param->remove();\n      }\n   }\n\n   return visit_continue;\n}\n\nir_visitor_status\nir_vec_index_to_cond_assign_visitor::visit_enter(ir_return *ir)\n{\n   if (ir->value) {\n      ir->value = convert_vec_index_to_cond_assign(ir->value);\n   }\n\n   return visit_continue;\n}\n\nir_visitor_status\nir_vec_index_to_cond_assign_visitor::visit_enter(ir_if *ir)\n{\n   ir->condition = convert_vec_index_to_cond_assign(ir->condition);\n\n   return visit_continue;\n}\n\nbool\ndo_vec_index_to_cond_assign(exec_list *instructions)\n{\n   ir_vec_index_to_cond_assign_visitor v;\n\n   visit_list_elements(&v, instructions);\n\n   return v.progress;\n}\n<commit_msg>glsl2: Add support for variable vector indexing on the LHS of assignments.<commit_after>\/*\n * Copyright © 2010 Intel Corporation\n *\n * Permission is hereby granted, free of charge, to any person obtaining a\n * copy of this software and associated documentation files (the \"Software\"),\n * to deal in the Software without restriction, including without limitation\n * the rights to use, copy, modify, merge, publish, distribute, sublicense,\n * and\/or sell copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice (including the next\n * paragraph) shall be included in all copies or substantial portions of the\n * Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL\n * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n * DEALINGS IN THE SOFTWARE.\n *\/\n\n\/**\n * \\file ir_vec_index_to_cond_assign.cpp\n *\n * Turns indexing into vector types to a series of conditional moves\n * of each channel's swizzle into a temporary.\n *\n * Most GPUs don't have a native way to do this operation, and this\n * works around that.  For drivers using both this pass and\n * ir_vec_index_to_swizzle, there's a risk that this pass will happen\n * before sufficient constant folding to find that the array index is\n * constant.  However, we hope that other optimization passes,\n * particularly constant folding of assignment conditions and copy\n * propagation, will result in the same code in the end.\n *\/\n\n#include \"ir.h\"\n#include \"ir_visitor.h\"\n#include \"ir_optimization.h\"\n#include \"glsl_types.h\"\n\n\/**\n * Visitor class for replacing expressions with ir_constant values.\n *\/\n\nclass ir_vec_index_to_cond_assign_visitor : public ir_hierarchical_visitor {\npublic:\n   ir_vec_index_to_cond_assign_visitor()\n   {\n      progress = false;\n   }\n\n   ir_rvalue *convert_vec_index_to_cond_assign(ir_rvalue *val);\n\n   virtual ir_visitor_status visit_enter(ir_expression *);\n   virtual ir_visitor_status visit_enter(ir_swizzle *);\n   virtual ir_visitor_status visit_leave(ir_assignment *);\n   virtual ir_visitor_status visit_enter(ir_return *);\n   virtual ir_visitor_status visit_enter(ir_call *);\n   virtual ir_visitor_status visit_enter(ir_if *);\n\n   bool progress;\n};\n\nir_rvalue *\nir_vec_index_to_cond_assign_visitor::convert_vec_index_to_cond_assign(ir_rvalue *ir)\n{\n   ir_dereference_array *orig_deref = ir->as_dereference_array();\n   ir_assignment *assign;\n   ir_variable *index, *var;\n   ir_dereference *deref;\n   ir_expression *condition;\n   ir_swizzle *swizzle;\n   int i;\n\n   if (!orig_deref)\n      return ir;\n\n   if (orig_deref->array->type->is_matrix() ||\n       orig_deref->array->type->is_array())\n      return ir;\n\n   assert(orig_deref->array_index->type->base_type == GLSL_TYPE_INT);\n\n   \/* Store the index to a temporary to avoid reusing its tree. *\/\n   index = new(base_ir) ir_variable(glsl_type::int_type,\n\t\t\t\t    \"vec_index_tmp_i\");\n   base_ir->insert_before(index);\n   deref = new(base_ir) ir_dereference_variable(index);\n   assign = new(base_ir) ir_assignment(deref, orig_deref->array_index, NULL);\n   base_ir->insert_before(assign);\n\n   \/* Temporary where we store whichever value we swizzle out. *\/\n   var = new(base_ir) ir_variable(ir->type, \"vec_index_tmp_v\");\n   base_ir->insert_before(var);\n\n   \/* Generate a conditional move of each vector element to the temp. *\/\n   for (i = 0; i < orig_deref->array->type->vector_elements; i++) {\n      deref = new(base_ir) ir_dereference_variable(index);\n      condition = new(base_ir) ir_expression(ir_binop_equal,\n\t\t\t\t\t     glsl_type::bool_type,\n\t\t\t\t\t     deref,\n\t\t\t\t\t     new(base_ir) ir_constant(i));\n\n      \/* Just clone the rest of the deref chain when trying to get at the\n       * underlying variable.\n       *\/\n      swizzle = new(base_ir) ir_swizzle(orig_deref->array->clone(NULL),\n\t\t\t\t\ti, 0, 0, 0, 1);\n\n      deref = new(base_ir) ir_dereference_variable(var);\n      assign = new(base_ir) ir_assignment(deref, swizzle, condition);\n      base_ir->insert_before(assign);\n   }\n\n   this->progress = true;\n   return new(base_ir) ir_dereference_variable(var);\n}\n\nir_visitor_status\nir_vec_index_to_cond_assign_visitor::visit_enter(ir_expression *ir)\n{\n   unsigned int i;\n\n   for (i = 0; i < ir->get_num_operands(); i++) {\n      ir->operands[i] = convert_vec_index_to_cond_assign(ir->operands[i]);\n   }\n\n   return visit_continue;\n}\n\nir_visitor_status\nir_vec_index_to_cond_assign_visitor::visit_enter(ir_swizzle *ir)\n{\n   \/* Can't be hit from normal GLSL, since you can't swizzle a scalar (which\n    * the result of indexing a vector is.  But maybe at some point we'll end up\n    * using swizzling of scalars for vector construction.\n    *\/\n   ir->val = convert_vec_index_to_cond_assign(ir->val);\n\n   return visit_continue;\n}\n\nir_visitor_status\nir_vec_index_to_cond_assign_visitor::visit_leave(ir_assignment *ir)\n{\n   ir_variable *index, *var;\n   ir_dereference_variable *deref;\n   ir_assignment *assign;\n   int i;\n\n   ir->rhs = convert_vec_index_to_cond_assign(ir->rhs);\n   if (ir->condition)\n      ir->condition = convert_vec_index_to_cond_assign(ir->condition);\n\n   \/* Last, handle the LHS *\/\n   ir_dereference_array *orig_deref = ir->lhs->as_dereference_array();\n\n   if (!orig_deref ||\n       orig_deref->array->type->is_matrix() ||\n       orig_deref->array->type->is_array())\n      return visit_continue;\n\n   assert(orig_deref->array_index->type->base_type == GLSL_TYPE_INT);\n\n   \/* Store the index to a temporary to avoid reusing its tree. *\/\n   index = new(ir) ir_variable(glsl_type::int_type, \"vec_index_tmp_i\");\n   ir->insert_before(index);\n   deref = new(ir) ir_dereference_variable(index);\n   assign = new(ir) ir_assignment(deref, orig_deref->array_index, NULL);\n   ir->insert_before(assign);\n\n   \/* Store the RHS to a temporary to avoid reusing its tree. *\/\n   var = new(ir) ir_variable(ir->rhs->type, \"vec_index_tmp_v\");\n   ir->insert_before(var);\n   deref = new(ir) ir_dereference_variable(var);\n   assign = new(ir) ir_assignment(deref, ir->rhs, NULL);\n   ir->insert_before(assign);\n\n   \/* Generate a conditional move of each vector element to the temp. *\/\n   for (i = 0; i < orig_deref->array->type->vector_elements; i++) {\n      ir_rvalue *condition, *swizzle;\n\n      deref = new(ir) ir_dereference_variable(index);\n      condition = new(ir) ir_expression(ir_binop_equal,\n\t\t\t\t\tglsl_type::bool_type,\n\t\t\t\t\tderef,\n\t\t\t\t\tnew(ir) ir_constant(i));\n\n      \/* Just clone the rest of the deref chain when trying to get at the\n       * underlying variable.\n       *\/\n      swizzle = new(ir) ir_swizzle(orig_deref->array->clone(NULL),\n\t\t\t\t   i, 0, 0, 0, 1);\n\n      deref = new(ir) ir_dereference_variable(var);\n      assign = new(ir) ir_assignment(swizzle, deref, condition);\n      ir->insert_before(assign);\n   }\n   ir->remove();\n\n   this->progress = true;\n\n   return visit_continue;\n}\n\nir_visitor_status\nir_vec_index_to_cond_assign_visitor::visit_enter(ir_call *ir)\n{\n   foreach_iter(exec_list_iterator, iter, *ir) {\n      ir_rvalue *param = (ir_rvalue *)iter.get();\n      ir_rvalue *new_param = convert_vec_index_to_cond_assign(param);\n\n      if (new_param != param) {\n\t param->insert_before(new_param);\n\t param->remove();\n      }\n   }\n\n   return visit_continue;\n}\n\nir_visitor_status\nir_vec_index_to_cond_assign_visitor::visit_enter(ir_return *ir)\n{\n   if (ir->value) {\n      ir->value = convert_vec_index_to_cond_assign(ir->value);\n   }\n\n   return visit_continue;\n}\n\nir_visitor_status\nir_vec_index_to_cond_assign_visitor::visit_enter(ir_if *ir)\n{\n   ir->condition = convert_vec_index_to_cond_assign(ir->condition);\n\n   return visit_continue;\n}\n\nbool\ndo_vec_index_to_cond_assign(exec_list *instructions)\n{\n   ir_vec_index_to_cond_assign_visitor v;\n\n   visit_list_elements(&v, instructions);\n\n   return v.progress;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <QDebug>\n#include <QHBoxLayout>\n#include <QLabel>\n#include <QPixmap>\n#include <QPushButton>\n#include <QLineEdit>\n\n#include \"wifi.hpp\"\n#include \"widgets\/toggle.hpp\"\n\nvoid clearLayout(QLayout* layout) {\n  while (QLayoutItem* item = layout->takeAt(0)) {\n    if (QWidget* widget = item->widget()) {\n      widget->deleteLater();\n    }\n    if (QLayout* childLayout = item->layout()) {\n      clearLayout(childLayout);\n    }\n    delete item;\n  }\n}\n\nWifiUI::WifiUI(QWidget *parent, int page_length) : QWidget(parent), networks_per_page(page_length) {\n  try {\n    wifi = new WifiManager;\n  } catch (std::exception &e) {\n    QLabel* warning = new QLabel(\"Network manager is inactive!\");\n    warning->setStyleSheet(R\"(font-size: 65px;)\");\n\n    QVBoxLayout* warning_layout = new QVBoxLayout;\n    warning_layout->addWidget(warning, 0, Qt::AlignCenter);\n    setLayout(warning_layout);\n    return;\n  }\n\n  QObject::connect(wifi, SIGNAL(wrongPassword(QString)), this, SLOT(wrongPassword(QString)));\n\n  QVBoxLayout * top_layout = new QVBoxLayout;\n  top_layout->setSpacing(0);\n  swidget = new QStackedWidget;\n\n  \/\/ Networks page\n  wifi_widget = new QWidget;\n  QVBoxLayout* networkLayout = new QVBoxLayout;\n  QHBoxLayout *tethering_field = new QHBoxLayout;\n  tethering_field->addSpacing(50);\n\n  ipv4 = new QLabel(\"\");\n  tethering_field->addWidget(ipv4);\n  tethering_field->addWidget(new QLabel(\"Enable Tethering\"));\n\n  Toggle* toggle_switch = new Toggle(this);\n  toggle_switch->setFixedSize(150, 100);\n  tethering_field->addWidget(toggle_switch);\n  if (wifi->tetheringEnabled()) {\n    toggle_switch->togglePosition();\n  }\n  QObject::connect(toggle_switch, SIGNAL(stateChanged(int)), this, SLOT(toggleTethering(int)));\n\n  QWidget* tetheringWidget = new QWidget;\n  tetheringWidget->setLayout(tethering_field);\n  tetheringWidget->setFixedHeight(150);\n  networkLayout->addWidget(tetheringWidget);\n\n  vlayout = new QVBoxLayout;\n  wifi_widget->setLayout(vlayout);\n  networkLayout->addWidget(wifi_widget);\n\n  QWidget* networkWidget = new QWidget;\n  networkWidget->setLayout(networkLayout);\n  swidget->addWidget(networkWidget);\n\n  \/\/ Keyboard page\n  input_field = new InputField();\n  QObject::connect(input_field, SIGNAL(emitText(QString)), this, SLOT(receiveText(QString)));\n  swidget->addWidget(input_field);\n  swidget->setCurrentIndex(0);\n\n  top_layout->addWidget(swidget);\n  setLayout(top_layout);\n\n  \/\/ Update network list\n  timer = new QTimer(this);\n  QObject::connect(timer, SIGNAL(timeout()), this, SLOT(refresh()));\n  timer->start(2000);\n\n  \/\/ Scan on startup\n  QLabel *scanning = new QLabel(\"Scanning for networks\");\n  scanning->setStyleSheet(R\"(font-size: 65px;)\");\n  vlayout->addWidget(scanning, 0, Qt::AlignCenter);\n  vlayout->setSpacing(25);\n\n  wifi->request_scan();\n  refresh();\n  page = 0;\n}\n\nvoid WifiUI::refresh() {\n  if (!this->isVisible()) {\n    return;\n  }\n\n  wifi->request_scan();\n  wifi->refreshNetworks();\n  ipv4->setText(wifi->ipv4_address);\n  clearLayout(vlayout);\n\n  connectButtons = new QButtonGroup(this);\n  QObject::connect(connectButtons, SIGNAL(buttonClicked(QAbstractButton*)), this, SLOT(handleButton(QAbstractButton*)));\n\n  int i = 0;\n  int countWidgets = 0;\n  int button_height = static_cast<int>(this->height() \/ (networks_per_page + 1) * 0.6);\n  for (Network &network : wifi->seen_networks) {\n    QHBoxLayout *hlayout = new QHBoxLayout;\n    if (page * networks_per_page <= i && i < (page + 1) * networks_per_page) {\n      \/\/ SSID\n      hlayout->addSpacing(50);\n      hlayout->addWidget(new QLabel(QString::fromUtf8(network.ssid)));\n\n      \/\/ strength indicator\n      unsigned int strength_scale = network.strength \/ 17;\n      QPixmap pix(\"..\/assets\/images\/network_\" + QString::number(strength_scale) + \".png\");\n      QLabel *icon = new QLabel();\n      icon->setPixmap(pix.scaledToWidth(100, Qt::SmoothTransformation));\n      icon->setSizePolicy(QSizePolicy(QSizePolicy::Fixed, QSizePolicy::Fixed));\n      hlayout->addWidget(icon);\n      hlayout->addSpacing(20);\n\n      \/\/ connect button\n      QPushButton* btn = new QPushButton(network.connected == ConnectedType::CONNECTED ? \"Connected\" : (network.connected == ConnectedType::CONNECTING ? \"Connecting\" : \"Connect\"));\n      btn->setFixedWidth(300);\n      btn->setFixedHeight(button_height);\n      btn->setDisabled(network.connected == ConnectedType::CONNECTED || network.connected == ConnectedType::CONNECTING || network.security_type == SecurityType::UNSUPPORTED);\n      hlayout->addWidget(btn);\n      hlayout->addSpacing(20);\n\n      connectButtons->addButton(btn, i);\n\n      QWidget * w = new QWidget;\n      w->setLayout(hlayout);\n      vlayout->addWidget(w);\n      w->setStyleSheet(R\"(\n        QLabel {\n          font-size: 50px;\n        }\n        QPushButton {\n          padding: 0;\n          font-size: 50px;\n          background-color: #114265;\n        }\n        QPushButton:disabled {\n          background-color: #323C43;\n        }\n        * {\n          background-color: #114265;\n        }\n      )\");\n      countWidgets++;\n    }\n    i++;\n  }\n\n  \/\/ Pad vlayout to prevert oversized network widgets in case of low visible network count\n  for (int i = countWidgets; i < networks_per_page; i++) {\n    QWidget *w = new QWidget;\n    vlayout->addWidget(w);\n  }\n\n  QHBoxLayout *prev_next_buttons = new QHBoxLayout;\n  QPushButton* prev = new QPushButton(\"Previous\");\n  prev->setEnabled(page);\n  prev->setFixedHeight(button_height);\n  QPushButton* next = new QPushButton(\"Next\");\n  next->setFixedHeight(button_height);\n\n  \/\/ If there are more visible networks then we can show, enable going to next page\n  next->setEnabled(wifi->seen_networks.size() > (page + 1) * networks_per_page);\n\n  QObject::connect(prev, SIGNAL(released()), this, SLOT(prevPage()));\n  QObject::connect(next, SIGNAL(released()), this, SLOT(nextPage()));\n  prev_next_buttons->addWidget(prev);\n  prev_next_buttons->addWidget(next);\n\n  QWidget *w = new QWidget;\n  w->setLayout(prev_next_buttons);\n  w->setStyleSheet(R\"(\n    QPushButton {\n      padding: 0;\n      background-color: #114265;\n    }\n    QPushButton:disabled {\n      background-color: #323C43;\n    }\n    * {\n      background-color: #114265;\n    }\n  )\");\n  vlayout->addWidget(w);\n}\n\n\n\nvoid WifiUI::toggleTethering(int enable) {\n  if (enable) {\n    wifi->enableTethering();\n  } else {\n    wifi->disableTethering();\n  }\n}\n\nvoid WifiUI::handleButton(QAbstractButton* button) {\n  QPushButton* btn = static_cast<QPushButton*>(button);\n  Network n = wifi->seen_networks[connectButtons->id(btn)];\n  connectToNetwork(n);\n}\n\nvoid WifiUI::connectToNetwork(Network n) {\n  timer->stop();\n  if (n.security_type == SecurityType::OPEN) {\n    wifi->connect(n);\n  } else if (n.security_type == SecurityType::WPA) {\n    input_field->setPromptText(\"Enter password for \\\"\" + n.ssid + \"\\\"\");\n    QString password = getStringFromUser();\n    if (password.size()) {\n      wifi->connect(n, password);\n    }\n  }\n  refresh();\n  timer->start();\n}\n\nQString WifiUI::getStringFromUser() {\n  emit openKeyboard();\n  swidget->setCurrentIndex(1);\n  loop.exec();\n  emit closeKeyboard();\n  swidget->setCurrentIndex(0);\n  return text;\n}\n\nvoid WifiUI::receiveText(QString t) {\n  loop.quit();\n  text = t;\n}\n\n\nvoid WifiUI::wrongPassword(QString ssid) {\n  if (loop.isRunning()) {\n    return;\n  }\n  for (Network n : wifi->seen_networks) {\n    if (n.ssid == ssid) {\n      input_field->setPromptText(\"Wrong password for \\\"\" + n.ssid +\"\\\"\");\n      connectToNetwork(n);\n    }\n  }\n}\n\nvoid WifiUI::prevPage() {\n  page--;\n  refresh();\n}\nvoid WifiUI::nextPage() {\n  page++;\n  refresh();\n}\n<commit_msg>make wifi settings a bit nicer<commit_after>#include <QDebug>\n#include <QHBoxLayout>\n#include <QLabel>\n#include <QPixmap>\n#include <QPushButton>\n#include <QLineEdit>\n\n#include \"wifi.hpp\"\n#include \"widgets\/toggle.hpp\"\n\nvoid clearLayout(QLayout* layout) {\n  while (QLayoutItem* item = layout->takeAt(0)) {\n    if (QWidget* widget = item->widget()) {\n      widget->deleteLater();\n    }\n    if (QLayout* childLayout = item->layout()) {\n      clearLayout(childLayout);\n    }\n    delete item;\n  }\n}\n\nWifiUI::WifiUI(QWidget *parent, int page_length) : QWidget(parent), networks_per_page(page_length) {\n  try {\n    wifi = new WifiManager;\n  } catch (std::exception &e) {\n    QLabel* warning = new QLabel(\"Network manager is inactive!\");\n    warning->setStyleSheet(R\"(font-size: 65px;)\");\n\n    QVBoxLayout* warning_layout = new QVBoxLayout;\n    warning_layout->addWidget(warning, 0, Qt::AlignCenter);\n    setLayout(warning_layout);\n    return;\n  }\n\n  QObject::connect(wifi, SIGNAL(wrongPassword(QString)), this, SLOT(wrongPassword(QString)));\n\n  QVBoxLayout * top_layout = new QVBoxLayout;\n  top_layout->setSpacing(0);\n  swidget = new QStackedWidget;\n\n  \/\/ Networks page\n  wifi_widget = new QWidget;\n  QVBoxLayout* networkLayout = new QVBoxLayout;\n  QHBoxLayout *tethering_field = new QHBoxLayout;\n  tethering_field->addSpacing(50);\n\n  ipv4 = new QLabel(\"\");\n  tethering_field->addWidget(ipv4);\n  tethering_field->addWidget(new QLabel(\"Enable Tethering\"));\n\n  Toggle* toggle_switch = new Toggle(this);\n  toggle_switch->setFixedSize(150, 100);\n  tethering_field->addWidget(toggle_switch);\n  if (wifi->tetheringEnabled()) {\n    toggle_switch->togglePosition();\n  }\n  QObject::connect(toggle_switch, SIGNAL(stateChanged(int)), this, SLOT(toggleTethering(int)));\n\n  QWidget* tetheringWidget = new QWidget;\n  tetheringWidget->setLayout(tethering_field);\n  tetheringWidget->setFixedHeight(150);\n  networkLayout->addWidget(tetheringWidget);\n\n  vlayout = new QVBoxLayout;\n  wifi_widget->setLayout(vlayout);\n  networkLayout->addWidget(wifi_widget);\n\n  QWidget* networkWidget = new QWidget;\n  networkWidget->setLayout(networkLayout);\n  swidget->addWidget(networkWidget);\n\n  \/\/ Keyboard page\n  input_field = new InputField();\n  QObject::connect(input_field, SIGNAL(emitText(QString)), this, SLOT(receiveText(QString)));\n  swidget->addWidget(input_field);\n  swidget->setCurrentIndex(0);\n\n  top_layout->addWidget(swidget);\n  setLayout(top_layout);\n\n  \/\/ Update network list\n  timer = new QTimer(this);\n  QObject::connect(timer, SIGNAL(timeout()), this, SLOT(refresh()));\n  timer->start(2000);\n\n  \/\/ Scan on startup\n  QLabel *scanning = new QLabel(\"Scanning for networks\");\n  scanning->setStyleSheet(R\"(font-size: 65px;)\");\n  vlayout->addWidget(scanning, 0, Qt::AlignCenter);\n  vlayout->setSpacing(25);\n\n  wifi->request_scan();\n  refresh();\n  page = 0;\n}\n\nvoid WifiUI::refresh() {\n  if (!this->isVisible()) {\n    return;\n  }\n\n  wifi->request_scan();\n  wifi->refreshNetworks();\n  ipv4->setText(wifi->ipv4_address);\n  clearLayout(vlayout);\n\n  connectButtons = new QButtonGroup(this);\n  QObject::connect(connectButtons, SIGNAL(buttonClicked(QAbstractButton*)), this, SLOT(handleButton(QAbstractButton*)));\n\n  int i = 0;\n  int countWidgets = 0;\n  int button_height = static_cast<int>(this->height() \/ (networks_per_page + 1) * 0.6);\n  for (Network &network : wifi->seen_networks) {\n    QHBoxLayout *hlayout = new QHBoxLayout;\n    if (page * networks_per_page <= i && i < (page + 1) * networks_per_page) {\n      \/\/ SSID\n      hlayout->addSpacing(50);\n      hlayout->addWidget(new QLabel(QString::fromUtf8(network.ssid)));\n\n      \/\/ strength indicator\n      unsigned int strength_scale = network.strength \/ 17;\n      QPixmap pix(\"..\/assets\/images\/network_\" + QString::number(strength_scale) + \".png\");\n      QLabel *icon = new QLabel();\n      icon->setPixmap(pix.scaledToWidth(100, Qt::SmoothTransformation));\n      icon->setSizePolicy(QSizePolicy(QSizePolicy::Fixed, QSizePolicy::Fixed));\n      hlayout->addWidget(icon);\n      hlayout->addSpacing(20);\n\n      \/\/ connect button\n      QPushButton* btn = new QPushButton(network.connected == ConnectedType::CONNECTED ? \"Connected\" : (network.connected == ConnectedType::CONNECTING ? \"Connecting\" : \"Connect\"));\n      btn->setFixedWidth(300);\n      btn->setFixedHeight(button_height);\n      btn->setDisabled(network.connected == ConnectedType::CONNECTED || network.connected == ConnectedType::CONNECTING || network.security_type == SecurityType::UNSUPPORTED);\n      hlayout->addWidget(btn);\n      hlayout->addSpacing(20);\n\n      connectButtons->addButton(btn, i);\n\n      QWidget * w = new QWidget;\n      w->setLayout(hlayout);\n      vlayout->addWidget(w);\n      w->setStyleSheet(R\"(\n        QLabel {\n          font-size: 50px;\n        }\n        QPushButton {\n          padding: 0;\n          font-size: 50px;\n          border-radius: 10px;\n          background-color: #114265;\n        }\n        QPushButton:disabled {\n          background-color: #323C43;\n        }\n      )\");\n      countWidgets++;\n    }\n    i++;\n  }\n\n  \/\/ Pad vlayout to prevert oversized network widgets in case of low visible network count\n  for (int i = countWidgets; i < networks_per_page; i++) {\n    QWidget *w = new QWidget;\n    vlayout->addWidget(w);\n  }\n\n  QHBoxLayout *prev_next_buttons = new QHBoxLayout;\n  QPushButton* prev = new QPushButton(\"Previous\");\n  prev->setEnabled(page);\n  prev->setFixedHeight(button_height);\n  QPushButton* next = new QPushButton(\"Next\");\n  next->setFixedHeight(button_height);\n\n  \/\/ If there are more visible networks then we can show, enable going to next page\n  next->setEnabled(wifi->seen_networks.size() > (page + 1) * networks_per_page);\n\n  QObject::connect(prev, SIGNAL(released()), this, SLOT(prevPage()));\n  QObject::connect(next, SIGNAL(released()), this, SLOT(nextPage()));\n  prev_next_buttons->addWidget(prev);\n  prev_next_buttons->addWidget(next);\n\n  QWidget *w = new QWidget;\n  w->setLayout(prev_next_buttons);\n  w->setStyleSheet(R\"(\n    QPushButton {\n      padding: 0;\n      background-color: #114265;\n    }\n    QPushButton:disabled {\n      background-color: #323C43;\n    }\n  )\");\n  vlayout->addWidget(w);\n}\n\n\n\nvoid WifiUI::toggleTethering(int enable) {\n  if (enable) {\n    wifi->enableTethering();\n  } else {\n    wifi->disableTethering();\n  }\n}\n\nvoid WifiUI::handleButton(QAbstractButton* button) {\n  QPushButton* btn = static_cast<QPushButton*>(button);\n  Network n = wifi->seen_networks[connectButtons->id(btn)];\n  connectToNetwork(n);\n}\n\nvoid WifiUI::connectToNetwork(Network n) {\n  timer->stop();\n  if (n.security_type == SecurityType::OPEN) {\n    wifi->connect(n);\n  } else if (n.security_type == SecurityType::WPA) {\n    input_field->setPromptText(\"Enter password for \\\"\" + n.ssid + \"\\\"\");\n    QString password = getStringFromUser();\n    if (password.size()) {\n      wifi->connect(n, password);\n    }\n  }\n  refresh();\n  timer->start();\n}\n\nQString WifiUI::getStringFromUser() {\n  emit openKeyboard();\n  swidget->setCurrentIndex(1);\n  loop.exec();\n  emit closeKeyboard();\n  swidget->setCurrentIndex(0);\n  return text;\n}\n\nvoid WifiUI::receiveText(QString t) {\n  loop.quit();\n  text = t;\n}\n\n\nvoid WifiUI::wrongPassword(QString ssid) {\n  if (loop.isRunning()) {\n    return;\n  }\n  for (Network n : wifi->seen_networks) {\n    if (n.ssid == ssid) {\n      input_field->setPromptText(\"Wrong password for \\\"\" + n.ssid +\"\\\"\");\n      connectToNetwork(n);\n    }\n  }\n}\n\nvoid WifiUI::prevPage() {\n  page--;\n  refresh();\n}\nvoid WifiUI::nextPage() {\n  page++;\n  refresh();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** Contact: Qt Software Information (qt-info@nokia.com)\n**\n** This file is part of the QtNetwork module of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the either Technology Preview License Agreement or the\n** Beta Release License Agreement.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain\n** additional rights. These rights are described in the Nokia Qt LGPL\n** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this\n** package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at qt-sales@nokia.com.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"qlocalserver.h\"\n#include \"qlocalserver_p.h\"\n#include \"qlocalsocket.h\"\n#include \"qlocalsocket_p.h\"\n\n#ifndef QT_NO_LOCALSERVER\n\n#include <sys\/socket.h>\n#include <sys\/un.h>\n\n#include <qdebug.h>\n#include <qdir.h>\n#include <qdatetime.h>\n\nQT_BEGIN_NAMESPACE\n\nvoid QLocalServerPrivate::init()\n{\n}\n\nbool QLocalServerPrivate::removeServer(const QString &name)\n{\n    QString fileName;\n    if (name.startsWith(QLatin1Char('\/'))) {\n        fileName = name;\n    } else {\n        fileName = QDir::cleanPath(QDir::tempPath());\n        fileName += QLatin1Char('\/') + name;\n    }\n    if (QFile::exists(fileName))\n        return QFile::remove(fileName);\n    else\n        return true;\n}\n\nbool QLocalServerPrivate::listen(const QString &requestedServerName)\n{\n    Q_Q(QLocalServer);\n\n    \/\/ determine the full server path\n    if (requestedServerName.startsWith(QLatin1Char('\/'))) {\n        fullServerName = requestedServerName;\n    } else {\n        fullServerName = QDir::cleanPath(QDir::tempPath());\n        fullServerName += QLatin1Char('\/') + requestedServerName;\n    }\n    serverName = requestedServerName;\n\n    \/\/ create the unix socket\n    listenSocket = qSocket(PF_UNIX, SOCK_STREAM, 0);\n    if (-1 == listenSocket) {\n        setError(QLatin1String(\"QLocalServer::listen\"));\n        closeServer();\n        return false;\n    }\n\n    \/\/ Construct the unix address\n    struct ::sockaddr_un addr;\n    addr.sun_family = PF_UNIX;\n    if (sizeof(addr.sun_path) < (uint)fullServerName.toLatin1().size() + 1) {\n        setError(QLatin1String(\"QLocalServer::listen\"));\n        closeServer();\n        return false;\n    }\n    ::memcpy(addr.sun_path, fullServerName.toLatin1().data(),\n             fullServerName.toLatin1().size() + 1);\n\n    \/\/ bind\n    if(-1 == qBind(listenSocket, (sockaddr *)&addr, sizeof(sockaddr_un))) {\n        setError(QLatin1String(\"QLocalServer::listen\"));\n        \/\/ if address is in use already, just close the socket, but do not delete the file\n        if(errno == EADDRINUSE)\n            QT_CLOSE(listenSocket);\n        \/\/ otherwise, close the socket and delete the file\n        else\n            closeServer();\n        listenSocket = -1;\n        return false;\n    }\n\n    \/\/ listen for connections\n    if (-1 == qListen(listenSocket, 50)) {\n        setError(QLatin1String(\"QLocalServer::listen\"));\n        closeServer();\n        listenSocket = -1;\n        if (error != QAbstractSocket::AddressInUseError)\n            QFile::remove(fullServerName);\n        return false;\n    }\n    Q_ASSERT(!socketNotifier);\n    socketNotifier = new QSocketNotifier(listenSocket,\n                                         QSocketNotifier::Read, q);\n    q->connect(socketNotifier, SIGNAL(activated(int)),\n               q, SLOT(_q_socketActivated()));\n    socketNotifier->setEnabled(maxPendingConnections > 0);\n    return true;\n}\n\n\/*!\n    \\internal\n\n    \\sa QLocalServer::closeServer()\n *\/\nvoid QLocalServerPrivate::closeServer()\n{\n    if (-1 != listenSocket)\n        QT_CLOSE(listenSocket);\n    listenSocket = -1;\n\n    if (socketNotifier)\n        socketNotifier->deleteLater();\n    socketNotifier = 0;\n\n    if (!fullServerName.isEmpty())\n        QFile::remove(fullServerName);\n}\n\n\/*!\n    \\internal\n\n    We have received a notification that we can read on the listen socket.\n    Accept the new socket.\n *\/\nvoid QLocalServerPrivate::_q_socketActivated()\n{\n    Q_Q(QLocalServer);\n    if (-1 == listenSocket)\n        return;\n\n    ::sockaddr_un addr;\n    QT_SOCKLEN_T length = sizeof(sockaddr_un);\n    int connectedSocket = qAccept(listenSocket, (sockaddr *)&addr, &length);\n    if(-1 == connectedSocket) {\n        setError(QLatin1String(\"QLocalSocket::activated\"));\n        closeServer();\n    } else {\n        socketNotifier->setEnabled(pendingConnections.size()\n                                   <= maxPendingConnections);\n        q->incomingConnection(connectedSocket);\n    }\n}\n\nvoid QLocalServerPrivate::waitForNewConnection(int msec, bool *timedOut)\n{\n    fd_set readfds;\n    FD_ZERO(&readfds);\n    FD_SET(listenSocket, &readfds);\n\n    timeval timeout;\n    timeout.tv_sec = msec \/ 1000;\n    timeout.tv_usec = (msec % 1000) * 1000;\n\n    \/\/ timeout can not be 0 or else select will return an error.\n    if (0 == msec)\n        timeout.tv_usec = 1000;\n\n    int result = -1;\n    \/\/ on Linux timeout will be updated by select, but _not_ on other systems.\n    QTime timer;\n    timer.start();\n    while (pendingConnections.isEmpty() && (-1 == msec || timer.elapsed() < msec)) {\n        result = ::select(listenSocket + 1, &readfds, 0, 0, &timeout);\n        if (-1 == result && errno != EINTR) {\n            setError(QLatin1String(\"QLocalServer::waitForNewConnection\"));\n            closeServer();\n            break;\n        }\n        if (result > 0)\n            _q_socketActivated();\n    }\n    if (timedOut)\n        *timedOut = (result == 0);\n}\n\nvoid QLocalServerPrivate::setError(const QString &function)\n{\n    if (EAGAIN == errno)\n        return;\n\n    switch (errno) {\n    case EACCES:\n        errorString = QLocalServer::tr(\"%1: Permission denied\").arg(function);\n        error = QAbstractSocket::SocketAccessError;\n        break;\n    case ELOOP:\n    case ENOENT:\n    case ENAMETOOLONG:\n    case EROFS:\n    case ENOTDIR:\n        errorString = QLocalServer::tr(\"%1: Name error\").arg(function);\n        error = QAbstractSocket::HostNotFoundError;\n        break;\n    case EADDRINUSE:\n        errorString = QLocalServer::tr(\"%1: Address in use\").arg(function);\n        error = QAbstractSocket::AddressInUseError;\n        break;\n\n    default:\n        errorString = QLocalServer::tr(\"%1: Unknown error %2\")\n                      .arg(function).arg(errno);\n        error = QAbstractSocket::UnknownSocketError;\n#if defined QLOCALSERVER_DEBUG\n        qWarning() << errorString << \"fullServerName:\" << fullServerName;\n#endif\n    }\n}\n\nQT_END_NAMESPACE\n\n#endif \/\/ QT_NO_LOCALSERVER\n<commit_msg>don't complain about invalid socket on server shutdown<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** Contact: Qt Software Information (qt-info@nokia.com)\n**\n** This file is part of the QtNetwork module of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the either Technology Preview License Agreement or the\n** Beta Release License Agreement.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain\n** additional rights. These rights are described in the Nokia Qt LGPL\n** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this\n** package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at qt-sales@nokia.com.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"qlocalserver.h\"\n#include \"qlocalserver_p.h\"\n#include \"qlocalsocket.h\"\n#include \"qlocalsocket_p.h\"\n\n#ifndef QT_NO_LOCALSERVER\n\n#include <sys\/socket.h>\n#include <sys\/un.h>\n\n#include <qdebug.h>\n#include <qdir.h>\n#include <qdatetime.h>\n\nQT_BEGIN_NAMESPACE\n\nvoid QLocalServerPrivate::init()\n{\n}\n\nbool QLocalServerPrivate::removeServer(const QString &name)\n{\n    QString fileName;\n    if (name.startsWith(QLatin1Char('\/'))) {\n        fileName = name;\n    } else {\n        fileName = QDir::cleanPath(QDir::tempPath());\n        fileName += QLatin1Char('\/') + name;\n    }\n    if (QFile::exists(fileName))\n        return QFile::remove(fileName);\n    else\n        return true;\n}\n\nbool QLocalServerPrivate::listen(const QString &requestedServerName)\n{\n    Q_Q(QLocalServer);\n\n    \/\/ determine the full server path\n    if (requestedServerName.startsWith(QLatin1Char('\/'))) {\n        fullServerName = requestedServerName;\n    } else {\n        fullServerName = QDir::cleanPath(QDir::tempPath());\n        fullServerName += QLatin1Char('\/') + requestedServerName;\n    }\n    serverName = requestedServerName;\n\n    \/\/ create the unix socket\n    listenSocket = qSocket(PF_UNIX, SOCK_STREAM, 0);\n    if (-1 == listenSocket) {\n        setError(QLatin1String(\"QLocalServer::listen\"));\n        closeServer();\n        return false;\n    }\n\n    \/\/ Construct the unix address\n    struct ::sockaddr_un addr;\n    addr.sun_family = PF_UNIX;\n    if (sizeof(addr.sun_path) < (uint)fullServerName.toLatin1().size() + 1) {\n        setError(QLatin1String(\"QLocalServer::listen\"));\n        closeServer();\n        return false;\n    }\n    ::memcpy(addr.sun_path, fullServerName.toLatin1().data(),\n             fullServerName.toLatin1().size() + 1);\n\n    \/\/ bind\n    if(-1 == qBind(listenSocket, (sockaddr *)&addr, sizeof(sockaddr_un))) {\n        setError(QLatin1String(\"QLocalServer::listen\"));\n        \/\/ if address is in use already, just close the socket, but do not delete the file\n        if(errno == EADDRINUSE)\n            QT_CLOSE(listenSocket);\n        \/\/ otherwise, close the socket and delete the file\n        else\n            closeServer();\n        listenSocket = -1;\n        return false;\n    }\n\n    \/\/ listen for connections\n    if (-1 == qListen(listenSocket, 50)) {\n        setError(QLatin1String(\"QLocalServer::listen\"));\n        closeServer();\n        listenSocket = -1;\n        if (error != QAbstractSocket::AddressInUseError)\n            QFile::remove(fullServerName);\n        return false;\n    }\n    Q_ASSERT(!socketNotifier);\n    socketNotifier = new QSocketNotifier(listenSocket,\n                                         QSocketNotifier::Read, q);\n    q->connect(socketNotifier, SIGNAL(activated(int)),\n               q, SLOT(_q_socketActivated()));\n    socketNotifier->setEnabled(maxPendingConnections > 0);\n    return true;\n}\n\n\/*!\n    \\internal\n\n    \\sa QLocalServer::closeServer()\n *\/\nvoid QLocalServerPrivate::closeServer()\n{\n    if (-1 != listenSocket)\n        QT_CLOSE(listenSocket);\n    listenSocket = -1;\n\n    if (socketNotifier) {\n        socketNotifier->setEnabled(false); \/\/ Otherwise, closed socket is checked before deleter runs\n        socketNotifier->deleteLater();\n        socketNotifier = 0;\n    }\n\n    if (!fullServerName.isEmpty())\n        QFile::remove(fullServerName);\n}\n\n\/*!\n    \\internal\n\n    We have received a notification that we can read on the listen socket.\n    Accept the new socket.\n *\/\nvoid QLocalServerPrivate::_q_socketActivated()\n{\n    Q_Q(QLocalServer);\n    if (-1 == listenSocket)\n        return;\n\n    ::sockaddr_un addr;\n    QT_SOCKLEN_T length = sizeof(sockaddr_un);\n    int connectedSocket = qAccept(listenSocket, (sockaddr *)&addr, &length);\n    if(-1 == connectedSocket) {\n        setError(QLatin1String(\"QLocalSocket::activated\"));\n        closeServer();\n    } else {\n        socketNotifier->setEnabled(pendingConnections.size()\n                                   <= maxPendingConnections);\n        q->incomingConnection(connectedSocket);\n    }\n}\n\nvoid QLocalServerPrivate::waitForNewConnection(int msec, bool *timedOut)\n{\n    fd_set readfds;\n    FD_ZERO(&readfds);\n    FD_SET(listenSocket, &readfds);\n\n    timeval timeout;\n    timeout.tv_sec = msec \/ 1000;\n    timeout.tv_usec = (msec % 1000) * 1000;\n\n    \/\/ timeout can not be 0 or else select will return an error.\n    if (0 == msec)\n        timeout.tv_usec = 1000;\n\n    int result = -1;\n    \/\/ on Linux timeout will be updated by select, but _not_ on other systems.\n    QTime timer;\n    timer.start();\n    while (pendingConnections.isEmpty() && (-1 == msec || timer.elapsed() < msec)) {\n        result = ::select(listenSocket + 1, &readfds, 0, 0, &timeout);\n        if (-1 == result && errno != EINTR) {\n            setError(QLatin1String(\"QLocalServer::waitForNewConnection\"));\n            closeServer();\n            break;\n        }\n        if (result > 0)\n            _q_socketActivated();\n    }\n    if (timedOut)\n        *timedOut = (result == 0);\n}\n\nvoid QLocalServerPrivate::setError(const QString &function)\n{\n    if (EAGAIN == errno)\n        return;\n\n    switch (errno) {\n    case EACCES:\n        errorString = QLocalServer::tr(\"%1: Permission denied\").arg(function);\n        error = QAbstractSocket::SocketAccessError;\n        break;\n    case ELOOP:\n    case ENOENT:\n    case ENAMETOOLONG:\n    case EROFS:\n    case ENOTDIR:\n        errorString = QLocalServer::tr(\"%1: Name error\").arg(function);\n        error = QAbstractSocket::HostNotFoundError;\n        break;\n    case EADDRINUSE:\n        errorString = QLocalServer::tr(\"%1: Address in use\").arg(function);\n        error = QAbstractSocket::AddressInUseError;\n        break;\n\n    default:\n        errorString = QLocalServer::tr(\"%1: Unknown error %2\")\n                      .arg(function).arg(errno);\n        error = QAbstractSocket::UnknownSocketError;\n#if defined QLOCALSERVER_DEBUG\n        qWarning() << errorString << \"fullServerName:\" << fullServerName;\n#endif\n    }\n}\n\nQT_END_NAMESPACE\n\n#endif \/\/ QT_NO_LOCALSERVER\n<|endoftext|>"}
{"text":"<commit_before>\/\/Author   : Sam Forrest\n\/\/Problem  : Week 3, Common Permutation\n\/\/Status   : Accepted\n\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nint main()\n{\n    string s1, s2;\n    while (!cin.eof())\n    {\n\t\t\/\/2 vectors to count chars in both s1 and s2\n\t\tvector <int> count1 (26, 0);\n\t\tvector <int> count2 (26, 0);\n\t\tgetline(cin,s1);\n\t\tgetline(cin,s2);\n\t\t\n\t\t\/\/count chars in s1 and s2\n\t\tfor(int i = 0; i < s1.length(); i++)    \n\t\t\tif ((s1[i] >= 97) && (s1[i] <= 122))\n\t\t\t\tcount1[s1[i]-97]++;\n\n\t\tfor(int i = 0; i < s2.length(); i++)\n\t\t\tif ((s2[i] >= 97) && (s2[i] <= 122))\n\t\t\t\tcount2[s2[i]-97]++;\n\t    \n\t\t\/\/iterate through characters in alphabetical order and output them min number of times\n\t\tfor(int i =0; i < 26; i++)  \n\t\t\tfor (int j =0; j < ((count1[i] < count2[i]) ? count1[i] : count2[i]); j++)\n\t\t\t\tcout << char(i+97);\n\t\n\t\tif(!cin.eof())\n\t\t\tcout << endl;\n    }\n    return 0;\n}\n<commit_msg>Delete sam_solution.cpp<commit_after><|endoftext|>"}
{"text":"<commit_before>\/** Copyright 2008, 2009, 2010, 2011, 2012 Roland Olbricht\n*\n* This file is part of Overpass_API.\n*\n* Overpass_API 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* Overpass_API is distributed in the hope that it will be 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 Overpass_API.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <algorithm>\n#include <cctype>\n#include <fstream>\n#include <map>\n#include <set>\n#include <sstream>\n#include <string>\n#include <math.h>\n#include <stdlib.h>\n#include <vector>\n\n#include \"..\/..\/template_db\/block_backend.h\"\n#include \"..\/..\/template_db\/random_file.h\"\n#include \"..\/data\/collect_members.h\"\n#include \"..\/osm-backend\/area_updater.h\"\n#include \"make_area.h\"\n#include \"print.h\"\n\nusing namespace std;\n\nbool Make_Area_Statement::is_used_ = false;\n\nGeneric_Statement_Maker< Make_Area_Statement > Make_Area_Statement::statement_maker(\"make-area\");\n\nMake_Area_Statement::Make_Area_Statement\n    (int line_number_, const map< string, string >& input_attributes, Query_Constraint* bbox_limitation)\n    : Output_Statement(line_number_)\n{ \n  is_used_ = true;\n  \n  map< string, string > attributes;\n  \n  attributes[\"from\"] = \"_\";\n  attributes[\"into\"] = \"_\";\n  attributes[\"pivot\"] = \"\";\n  \n  eval_attributes_array(get_name(), attributes, input_attributes);\n  \n  input = attributes[\"from\"];\n  set_output(attributes[\"into\"]);\n  pivot = attributes[\"pivot\"];\n}\n\n\npair< uint32, Uint64 > Make_Area_Statement::detect_pivot(const Set& pivot)\n{\n  uint32 pivot_type(0);\n  Node::Id_Type pivot_id(0ull);\n  map< Uint32_Index, vector< Node_Skeleton > >::const_iterator\n      nit(pivot.nodes.begin());\n  while ((pivot_id.val() == 0) && (nit != pivot.nodes.end()))\n  {\n    if (nit->second.size() > 0)\n    {\n      pivot_id = nit->second.front().id;\n      pivot_type = NODE;\n    }\n    ++nit;\n  }\n  map< Uint31_Index, vector< Way_Skeleton > >::const_iterator\n      wit(pivot.ways.begin());\n  while ((pivot_id.val() == 0) && (wit != pivot.ways.end()))\n  {\n    if (wit->second.size() > 0)\n    {\n      pivot_id = Uint64(wit->second.front().id.val());\n      pivot_type = WAY;\n    }\n    ++wit;\n  }\n  map< Uint31_Index, vector< Relation_Skeleton > >::const_iterator\n      rit(pivot.relations.begin());\n  while ((pivot_id.val() == 0) && (rit != pivot.relations.end()))\n  {\n    if (rit->second.size() > 0)\n    {\n      pivot_id = Uint64(rit->second.front().id.val());\n      pivot_type = RELATION;\n    }\n    ++rit;\n  }\n  \n  return make_pair(pivot_type, pivot_id);\n}\n\nNode::Id_Type Make_Area_Statement::check_node_parity(const Set& pivot)\n{\n  set< Node::Id_Type > node_parity_control;\n  for (map< Uint31_Index, vector< Way_Skeleton > >::const_iterator\n    it(pivot.ways.begin()); it != pivot.ways.end(); ++it)\n  {\n    for (vector< Way_Skeleton >::const_iterator it2(it->second.begin());\n    it2 != it->second.end(); ++it2)\n    {\n      if (it2->nds.size() < 2)\n\tcontinue;\n      pair< set< Node::Id_Type >::iterator, bool > npp(node_parity_control.insert\n          (it2->nds.front()));\n      if (!npp.second)\n\tnode_parity_control.erase(npp.first);\n      npp = node_parity_control.insert\n          (it2->nds.back());\n      if (!npp.second)\n\tnode_parity_control.erase(npp.first);\n    }\n  }\n  if (node_parity_control.size() > 0)\n    return *(node_parity_control.begin());\n  return Node::Id_Type(0ull);\n}\n\n\npair< Node::Id_Type, Uint32_Index > Make_Area_Statement::create_area_blocks\n    (map< Uint31_Index, vector< Area_Block > >& areas,\n     uint32 id, const Set& pivot)\n{\n  vector< Node > nodes;\n  for (map< Uint32_Index, vector< Node_Skeleton > >::const_iterator\n      it(pivot.nodes.begin()); it != pivot.nodes.end(); ++it)\n  {\n    for (vector< Node_Skeleton >::const_iterator it2(it->second.begin());\n        it2 != it->second.end(); ++it2)\n      nodes.push_back(Node(it2->id.val(), it->first.val(), it2->ll_lower));\n  }\n  sort(nodes.begin(), nodes.end(), Node_Comparator_By_Id());\n  \n  for (map< Uint31_Index, vector< Way_Skeleton > >::const_iterator\n      it(pivot.ways.begin()); it != pivot.ways.end(); ++it)\n  {\n    for (vector< Way_Skeleton >::const_iterator it2(it->second.begin());\n        it2 != it->second.end(); ++it2)\n      add_way_to_area_blocks(make_geometry(*it2, nodes), id, areas);\n  }\n  return make_pair< uint32, uint32 >(0, 0);\n}\n\n\nuint32 Make_Area_Statement::shifted_lat(uint32 ll_index, uint64 coord)\n{\n  return ::ilat(ll_index | (coord>>32), coord & 0xffffffff);\n}\n\n\nint32 Make_Area_Statement::lon_(uint32 ll_index, uint64 coord)\n{\n  return ::ilon(ll_index | (coord>>32), coord & 0xffffffff);\n}\n\nvoid Make_Area_Statement::add_segment_blocks\n    (map< Uint31_Index, vector< Area_Block > >& area_blocks, uint32 id)\n{\n  \/* We use that more northern segments always have bigger indices.\n    Thus we can collect each block's end points and add them, if they do not\n    cancel out, to the next block further northern.*\/\n  for (map< Uint31_Index, vector< Area_Block > >::const_iterator\n    it(area_blocks.begin()); it != area_blocks.end(); ++it)\n  {\n    if (area_blocks.size() > 384*1024)\n    {\n      area_blocks.clear();\n      break;\n    }\n    \n    set< int32 > lons;\n    \n    for (vector< Area_Block >::const_iterator it2(it->second.begin());\n        it2 != it->second.end(); ++it2)\n    {\n      if (it2->coors.empty())\n\tcontinue;\n      \n      const uint64& ll_front(it2->coors.front());\n      int32 lon_front(lon_(ll_front>>32, ll_front & 0xffffffffull));\n      const uint64& ll_back(it2->coors.back());\n      int32 lon_back(lon_(ll_back>>32, ll_back & 0xffffffffull));\n      if (lons.find(lon_front) == lons.end())\n\tlons.insert(lon_front);\n      else\n\tlons.erase(lon_front);\n      if (lons.find(lon_back) == lons.end())\n\tlons.insert(lon_back);\n      else\n\tlons.erase(lon_back);\n    }\n    \n    if (lons.empty())\n      continue;\n    \n    uint32 current_idx(it->first.val());\n    \n    \/\/ calc lat\n    uint32 lat(shifted_lat(it->first.val(), 0) + 16*65536);\n    int32 lon(lon_(it->first.val(), 0));\n    uint32 northern_ll_upper(::ll_upper(lat, lon) ^ 0x40000000);\n    \/\/ insert lons\n    vector< Area_Block >& northern_block(area_blocks[northern_ll_upper]);\n    for (set< int32 >::const_iterator it2(lons.begin()); it2 != lons.end(); ++it2)\n    {\n      int32 from(*it2);\n      ++it2;\n      int32 to(*it2);\n      vector< uint64 > coors;\n      coors.push_back\n          ((((uint64)(::ll_upper(lat, from) ^ 0x40000000))<<32) | ::ll_lower(lat, from));\n      coors.push_back\n          ((((uint64)(::ll_upper(lat, to) ^ 0x40000000))<<32) | ::ll_lower(lat, to));\n      Area_Block new_block(id, coors);\n      northern_block.push_back(new_block);\n    }\n    \n    it = area_blocks.find(Uint31_Index(current_idx));\n  }\n}\n\nvoid Make_Area_Statement::execute(Resource_Manager& rman)\n{\n  Set into;\n  \n  \/\/ detect pivot element\n  map< string, Set >::const_iterator mit(rman.sets().find(pivot));\n  if (mit == rman.sets().end())\n  {\n    transfer_output(rman, into);\n    return;\n  }\n  pair< uint32, Uint64 > pivot_pair(detect_pivot(mit->second));\n  int pivot_type(pivot_pair.first);\n  uint32 pivot_id(pivot_pair.second.val());\n\n  if (pivot_type == 0)\n  {\n    transfer_output(rman, into);\n    return;\n  }\n  \n  \/\/formulate range query to query tags of the pivot\n  set< Uint31_Index > coarse_indices;\n  set< pair< Tag_Index_Local, Tag_Index_Local > > range_set;\n  if (pivot_type == NODE)\n    coarse_indices.insert(mit->second.nodes.begin()->first.val() & 0xffffff00);\n  else if (pivot_type == WAY)\n    coarse_indices.insert(mit->second.ways.begin()->first.val() & 0xffffff00);\n  else if (pivot_type == RELATION)\n    coarse_indices.insert(mit->second.relations.begin()->first.val() & 0xffffff00);\n  \n  formulate_range_query(range_set, coarse_indices);\n  \n  \/\/ iterate over the result\n  vector< pair< string, string > > new_tags;\n  File_Properties* file_prop = 0;\n  if (pivot_type == NODE)\n    file_prop = osm_base_settings().NODE_TAGS_LOCAL;\n  else if (pivot_type == WAY)\n    file_prop = osm_base_settings().WAY_TAGS_LOCAL;\n  else if (pivot_type == RELATION)\n    file_prop = osm_base_settings().RELATION_TAGS_LOCAL;\n  Block_Backend< Tag_Index_Local, Uint32_Index > items_db\n      (rman.get_transaction()->data_index(file_prop));\n  Block_Backend< Tag_Index_Local, Uint32_Index >::Range_Iterator\n      tag_it(items_db.range_begin\n        (Default_Range_Iterator< Tag_Index_Local >(range_set.begin()),\n         Default_Range_Iterator< Tag_Index_Local >(range_set.end())));\n  for (; !(tag_it == items_db.range_end()); ++tag_it)\n  {\n    if (tag_it.object().val() == pivot_id)\n      new_tags.push_back(make_pair(tag_it.index().key, tag_it.index().value));\n  }\n  \n  if (pivot_type == WAY)\n    pivot_id += 2400000000u;\n  else if (pivot_type == RELATION)\n    pivot_id += 3600000000u;\n  \n  mit = rman.sets().find(input);\n  if (mit == rman.sets().end())\n  {\n    transfer_output(rman, into);\n    return;\n  }\n  \n  \/\/ check node parity\n  Node::Id_Type odd_id(check_node_parity(mit->second));\n  if (!(odd_id == Node::Id_Type(0ull)))\n  {\n    ostringstream temp;\n    temp<<\"make-area: Node \"<<odd_id.val()\n        <<\" is contained in an odd number of ways.\\n\";\n    runtime_remark(temp.str());\n  }\n  \n  \/\/ create area blocks\n  map< Uint31_Index, vector< Area_Block > > area_blocks;\n  pair< Node::Id_Type, Way::Id_Type > odd_pair\n    (create_area_blocks(area_blocks, pivot_id, mit->second));\n  if (!(odd_pair.first == Node::Id_Type(0ull)))\n  {\n    ostringstream temp;\n    temp<<\"make-area: Node \"<<odd_pair.first.val()\n        <<\" referred by way \"<<odd_pair.second.val()\n        <<\" is not contained in set \\\"\"<<input<<\"\\\".\\n\";\n    runtime_remark(temp.str());\n  }\n  \n  if (!(odd_id == Node::Id_Type(0ull)) || !(odd_pair.first == Node::Id_Type(0ull)))\n  {\n    transfer_output(rman, into);\n    return;\n  }\n\n  add_segment_blocks(area_blocks, pivot_id);\n  \n  vector< uint32 > used_indices;\n  for (map< Uint31_Index, vector< Area_Block > >::const_iterator\n      it(area_blocks.begin()); it != area_blocks.end(); ++it)\n    used_indices.push_back(it->first.val());\n  sort(used_indices.begin(), used_indices.end());\n  \n  Area_Location new_location(pivot_id, used_indices);\n  new_location.tags = new_tags;\n  Uint31_Index new_index(new_location.calc_index());\n  \n  if (new_index.val() == 0)\n  {\n    transfer_output(rman, into);\n    return;\n  }\n  \n  if (rman.area_updater())\n  {\n    Area_Updater* area_updater = dynamic_cast< Area_Updater* >(rman.area_updater());\n    area_updater->set_area(new_index, new_location);\n    area_updater->add_blocks(area_blocks);\n    area_updater->commit();\n  }\n  \n  into.areas[new_index].push_back(Area_Skeleton(new_location));\n  \n  transfer_output(rman, into);\n  rman.health_check(*this);\n}\n<commit_msg>make_area: fixed a bug.<commit_after>\/** Copyright 2008, 2009, 2010, 2011, 2012 Roland Olbricht\n*\n* This file is part of Overpass_API.\n*\n* Overpass_API 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* Overpass_API is distributed in the hope that it will be 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 Overpass_API.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <algorithm>\n#include <cctype>\n#include <fstream>\n#include <map>\n#include <set>\n#include <sstream>\n#include <string>\n#include <math.h>\n#include <stdlib.h>\n#include <vector>\n\n#include \"..\/..\/template_db\/block_backend.h\"\n#include \"..\/..\/template_db\/random_file.h\"\n#include \"..\/data\/collect_members.h\"\n#include \"..\/osm-backend\/area_updater.h\"\n#include \"make_area.h\"\n#include \"print.h\"\n\nusing namespace std;\n\nbool Make_Area_Statement::is_used_ = false;\n\nGeneric_Statement_Maker< Make_Area_Statement > Make_Area_Statement::statement_maker(\"make-area\");\n\nMake_Area_Statement::Make_Area_Statement\n    (int line_number_, const map< string, string >& input_attributes, Query_Constraint* bbox_limitation)\n    : Output_Statement(line_number_)\n{ \n  is_used_ = true;\n  \n  map< string, string > attributes;\n  \n  attributes[\"from\"] = \"_\";\n  attributes[\"into\"] = \"_\";\n  attributes[\"pivot\"] = \"\";\n  \n  eval_attributes_array(get_name(), attributes, input_attributes);\n  \n  input = attributes[\"from\"];\n  set_output(attributes[\"into\"]);\n  pivot = attributes[\"pivot\"];\n}\n\n\npair< uint32, Uint64 > Make_Area_Statement::detect_pivot(const Set& pivot)\n{\n  uint32 pivot_type(0);\n  Node::Id_Type pivot_id(0ull);\n  map< Uint32_Index, vector< Node_Skeleton > >::const_iterator\n      nit(pivot.nodes.begin());\n  while ((pivot_id.val() == 0) && (nit != pivot.nodes.end()))\n  {\n    if (nit->second.size() > 0)\n    {\n      pivot_id = nit->second.front().id;\n      pivot_type = NODE;\n    }\n    ++nit;\n  }\n  map< Uint31_Index, vector< Way_Skeleton > >::const_iterator\n      wit(pivot.ways.begin());\n  while ((pivot_id.val() == 0) && (wit != pivot.ways.end()))\n  {\n    if (wit->second.size() > 0)\n    {\n      pivot_id = Uint64(wit->second.front().id.val());\n      pivot_type = WAY;\n    }\n    ++wit;\n  }\n  map< Uint31_Index, vector< Relation_Skeleton > >::const_iterator\n      rit(pivot.relations.begin());\n  while ((pivot_id.val() == 0) && (rit != pivot.relations.end()))\n  {\n    if (rit->second.size() > 0)\n    {\n      pivot_id = Uint64(rit->second.front().id.val());\n      pivot_type = RELATION;\n    }\n    ++rit;\n  }\n  \n  return make_pair(pivot_type, pivot_id);\n}\n\nNode::Id_Type Make_Area_Statement::check_node_parity(const Set& pivot)\n{\n  set< Node::Id_Type > node_parity_control;\n  for (map< Uint31_Index, vector< Way_Skeleton > >::const_iterator\n    it(pivot.ways.begin()); it != pivot.ways.end(); ++it)\n  {\n    for (vector< Way_Skeleton >::const_iterator it2(it->second.begin());\n    it2 != it->second.end(); ++it2)\n    {\n      if (it2->nds.size() < 2)\n\tcontinue;\n      pair< set< Node::Id_Type >::iterator, bool > npp(node_parity_control.insert\n          (it2->nds.front()));\n      if (!npp.second)\n\tnode_parity_control.erase(npp.first);\n      npp = node_parity_control.insert\n          (it2->nds.back());\n      if (!npp.second)\n\tnode_parity_control.erase(npp.first);\n    }\n  }\n  if (node_parity_control.size() > 0)\n    return *(node_parity_control.begin());\n  return Node::Id_Type(0ull);\n}\n\n\npair< Node::Id_Type, Uint32_Index > Make_Area_Statement::create_area_blocks\n    (map< Uint31_Index, vector< Area_Block > >& areas,\n     uint32 id, const Set& pivot)\n{\n  vector< Node > nodes;\n  for (map< Uint32_Index, vector< Node_Skeleton > >::const_iterator\n      it(pivot.nodes.begin()); it != pivot.nodes.end(); ++it)\n  {\n    for (vector< Node_Skeleton >::const_iterator it2(it->second.begin());\n        it2 != it->second.end(); ++it2)\n      nodes.push_back(Node(it2->id.val(), it->first.val(), it2->ll_lower));\n  }\n  sort(nodes.begin(), nodes.end(), Node_Comparator_By_Id());\n  \n  for (map< Uint31_Index, vector< Way_Skeleton > >::const_iterator\n      it(pivot.ways.begin()); it != pivot.ways.end(); ++it)\n  {\n    for (vector< Way_Skeleton >::const_iterator it2(it->second.begin());\n        it2 != it->second.end(); ++it2)\n      add_way_to_area_blocks(make_geometry(*it2, nodes), id, areas);\n  }\n  return make_pair< uint32, uint32 >(0, 0);\n}\n\n\nuint32 Make_Area_Statement::shifted_lat(uint32 ll_index, uint64 coord)\n{\n  return ::ilat(ll_index | (coord>>32), coord & 0xffffffff);\n}\n\n\nint32 Make_Area_Statement::lon_(uint32 ll_index, uint64 coord)\n{\n  return ::ilon(ll_index | (coord>>32), coord & 0xffffffff);\n}\n\nvoid Make_Area_Statement::add_segment_blocks\n    (map< Uint31_Index, vector< Area_Block > >& area_blocks, uint32 id)\n{\n  \/* We use that more northern segments always have bigger indices.\n    Thus we can collect each block's end points and add them, if they do not\n    cancel out, to the next block further northern.*\/\n  for (map< Uint31_Index, vector< Area_Block > >::const_iterator\n    it(area_blocks.begin()); it != area_blocks.end(); ++it)\n  {\n    if (area_blocks.size() > 384*1024)\n    {\n      area_blocks.clear();\n      break;\n    }\n    \n    set< int32 > lons;\n    \n    for (vector< Area_Block >::const_iterator it2(it->second.begin());\n        it2 != it->second.end(); ++it2)\n    {\n      if (it2->coors.empty())\n\tcontinue;\n      \n      const uint64& ll_front(it2->coors.front());\n      int32 lon_front(lon_(ll_front>>32, ll_front & 0xffffffffull));\n      const uint64& ll_back(it2->coors.back());\n      int32 lon_back(lon_(ll_back>>32, ll_back & 0xffffffffull));\n      if (lons.find(lon_front) == lons.end())\n\tlons.insert(lon_front);\n      else\n\tlons.erase(lon_front);\n      if (lons.find(lon_back) == lons.end())\n\tlons.insert(lon_back);\n      else\n\tlons.erase(lon_back);\n    }\n    \n    if (lons.empty())\n      continue;\n    \n    uint32 current_idx(it->first.val());\n    \n    \/\/ calc lat\n    uint32 lat(shifted_lat(it->first.val(), 0) + 16*65536);\n    int32 lon(lon_(it->first.val(), 0));\n    uint32 northern_ll_upper(::ll_upper(lat, lon) ^ 0x40000000);\n    \/\/ insert lons\n    vector< Area_Block >& northern_block(area_blocks[northern_ll_upper]);\n    for (set< int32 >::const_iterator it2(lons.begin()); it2 != lons.end(); ++it2)\n    {\n      int32 from(*it2);\n      ++it2;\n      int32 to(*it2);\n      vector< uint64 > coors;\n      coors.push_back\n          ((((uint64)(::ll_upper(lat, from) ^ 0x40000000))<<32) | ::ll_lower(lat, from));\n      coors.push_back\n          ((((uint64)(::ll_upper(lat, to) ^ 0x40000000))<<32) | ::ll_lower(lat, to));\n      Area_Block new_block(id, coors);\n      northern_block.push_back(new_block);\n    }\n    \n    it = area_blocks.find(Uint31_Index(current_idx));\n  }\n}\n\nvoid Make_Area_Statement::execute(Resource_Manager& rman)\n{\n  Set into;\n  \n  \/\/ detect pivot element\n  map< string, Set >::const_iterator mit(rman.sets().find(pivot));\n  if (mit == rman.sets().end())\n  {\n    transfer_output(rman, into);\n    return;\n  }\n  pair< uint32, Uint64 > pivot_pair(detect_pivot(mit->second));\n  int pivot_type(pivot_pair.first);\n  uint32 pivot_id(pivot_pair.second.val());\n\n  if (pivot_type == 0)\n  {\n    transfer_output(rman, into);\n    return;\n  }\n  \n  \/\/formulate range query to query tags of the pivot\n  set< Uint31_Index > coarse_indices;\n  set< pair< Tag_Index_Local, Tag_Index_Local > > range_set;\n  if (pivot_type == NODE)\n    coarse_indices.insert(mit->second.nodes.begin()->first.val() & 0x7fffff00);\n  else if (pivot_type == WAY)\n    coarse_indices.insert(mit->second.ways.begin()->first.val() & 0x7fffff00);\n  else if (pivot_type == RELATION)\n    coarse_indices.insert(mit->second.relations.begin()->first.val() & 0x7fffff00);\n  \n  formulate_range_query(range_set, coarse_indices);\n  \n  \/\/ iterate over the result\n  vector< pair< string, string > > new_tags;\n  File_Properties* file_prop = 0;\n  if (pivot_type == NODE)\n    file_prop = osm_base_settings().NODE_TAGS_LOCAL;\n  else if (pivot_type == WAY)\n    file_prop = osm_base_settings().WAY_TAGS_LOCAL;\n  else if (pivot_type == RELATION)\n    file_prop = osm_base_settings().RELATION_TAGS_LOCAL;\n  Block_Backend< Tag_Index_Local, Uint32_Index > items_db\n      (rman.get_transaction()->data_index(file_prop));\n  Block_Backend< Tag_Index_Local, Uint32_Index >::Range_Iterator\n      tag_it(items_db.range_begin\n        (Default_Range_Iterator< Tag_Index_Local >(range_set.begin()),\n         Default_Range_Iterator< Tag_Index_Local >(range_set.end())));\n  for (; !(tag_it == items_db.range_end()); ++tag_it)\n  {\n    if (tag_it.object().val() == pivot_id)\n      new_tags.push_back(make_pair(tag_it.index().key, tag_it.index().value));\n  }\n  \n  if (pivot_type == WAY)\n    pivot_id += 2400000000u;\n  else if (pivot_type == RELATION)\n    pivot_id += 3600000000u;\n  \n  mit = rman.sets().find(input);\n  if (mit == rman.sets().end())\n  {\n    transfer_output(rman, into);\n    return;\n  }\n  \n  \/\/ check node parity\n  Node::Id_Type odd_id(check_node_parity(mit->second));\n  if (!(odd_id == Node::Id_Type(0ull)))\n  {\n    ostringstream temp;\n    temp<<\"make-area: Node \"<<odd_id.val()\n        <<\" is contained in an odd number of ways.\\n\";\n    runtime_remark(temp.str());\n  }\n  \n  \/\/ create area blocks\n  map< Uint31_Index, vector< Area_Block > > area_blocks;\n  pair< Node::Id_Type, Way::Id_Type > odd_pair\n    (create_area_blocks(area_blocks, pivot_id, mit->second));\n  if (!(odd_pair.first == Node::Id_Type(0ull)))\n  {\n    ostringstream temp;\n    temp<<\"make-area: Node \"<<odd_pair.first.val()\n        <<\" referred by way \"<<odd_pair.second.val()\n        <<\" is not contained in set \\\"\"<<input<<\"\\\".\\n\";\n    runtime_remark(temp.str());\n  }\n  \n  if (!(odd_id == Node::Id_Type(0ull)) || !(odd_pair.first == Node::Id_Type(0ull)))\n  {\n    transfer_output(rman, into);\n    return;\n  }\n\n  add_segment_blocks(area_blocks, pivot_id);\n  \n  vector< uint32 > used_indices;\n  for (map< Uint31_Index, vector< Area_Block > >::const_iterator\n      it(area_blocks.begin()); it != area_blocks.end(); ++it)\n    used_indices.push_back(it->first.val());\n  sort(used_indices.begin(), used_indices.end());\n  \n  Area_Location new_location(pivot_id, used_indices);\n  new_location.tags = new_tags;\n  Uint31_Index new_index(new_location.calc_index());\n  \n  if (new_index.val() == 0)\n  {\n    transfer_output(rman, into);\n    return;\n  }\n  \n  if (rman.area_updater())\n  {\n    Area_Updater* area_updater = dynamic_cast< Area_Updater* >(rman.area_updater());\n    area_updater->set_area(new_index, new_location);\n    area_updater->add_blocks(area_blocks);\n    area_updater->commit();\n  }\n  \n  into.areas[new_index].push_back(Area_Skeleton(new_location));\n  \n  transfer_output(rman, into);\n  rman.health_check(*this);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"pattern\/PolynomialFootstepPlaner.h\"\n\n#include <VirtualRobot\/Robot.h>\n#include <VirtualRobot\/CollisionDetection\/CollisionChecker.h>\n#include <VirtualRobot\/Visualization\/CoinVisualization\/CoinVisualizationFactory.h>\n\nPolynomialFootstepPlaner::PolynomialFootstepPlaner()\n    : FootstepPlaner()\n{\n}\n\nvoid PolynomialFootstepPlaner::setParameters(double stepLength, double stepPeriod, double doubleSupportPhase, double stepHeight, int sampleSize)\n{\n    if (_bParametersInitialized)\n    {\n        \/\/TODO: first delete all array, vectors and matrices\n    }\n\n    _dStepLength = stepLength;\n    _dStepPeriod = stepPeriod;\n    _dDoubleSupportPhase = doubleSupportPhase;\n    _dSingleSupportPhase = _dStepPeriod - _dDoubleSupportPhase;\n    _dStepHeight = stepHeight;\n    _iSampleSize = sampleSize;\n    _bParametersInitialized = true;\n}\n\n\/\/ start walking with left foot first\nvoid PolynomialFootstepPlaner::setLeftFootFirst()\n{\n    _bLeftFootFirst = true;\n}\n\n\/\/ start walking with right foot first\nvoid PolynomialFootstepPlaner::setRightFootFirst()\n{\n    _bLeftFootFirst = false;\n}\n\nvoid PolynomialFootstepPlaner::calculateStep(double ssTime, int ssSamples, double sampleDelta, double stepLength, double stepHeight, Eigen::Matrix3Xf& trajectory)\n{\n    \/\/ temporary variables\n    double T1 = ssTime;                 \/\/ T^1\n    double T2 = T1 * T1;                \/\/ T^2\n    double T3 = T2 * T1;                \/\/ T^3\n    double T4 = T3 * T1;                \/\/ T^4\n    double S = stepLength;              \/\/ StepLength\n    double H = stepHeight;              \/\/ Height\n    double cx, dx, bz, cz, dz, xtemp, ztemp, x1, x2, x3, x4;\n\n    \/\/ calculating foot trajectory for swinging leg including resting phase\n    for (int i = 0; i < trajectory.cols(); i++)\n    {\n        \/\/ precalculate {c*x, d*x, b*z, c*z, d*z, x^1, x^2, x^3, x^4} for optimization purposes\n        cx = -2 * S \/ T3;\n        dx = 3 * S \/ T2;\n        bz = 16 * H \/ T4;\n        cz = -32 * H \/ T3;\n        dz = 16 * H \/ T2;\n        x1 = sampleDelta * i;\n        x2 = x1 * x1;\n        x3 = x2 * x1;\n        x4 = x3 * x1;\n\n        if (i < ssSamples)\n        {\n            \/\/ swinging phase\n            xtemp =       cx * x3 + dx * x2;\n            ztemp = bz * x4 + cz * x3 + dz * x2;\n        }\n        else\n        {\n            \/\/ resting phase continues with last values\n            xtemp = S;\n            ztemp = 0;\n        }\n\n        trajectory(0, i) = 0;\n        trajectory(1, i) = xtemp;\n        trajectory(2, i) = ztemp;\n    }\n}\n\nvoid PolynomialFootstepPlaner::computeFeetTrajectories(int numberOfSteps)\n{\n    if (numberOfSteps < 2)\n    {\n        numberOfSteps = 2;\n    }\n\n    _iNumberOfSteps = numberOfSteps;\n    _mLFootPositions = Eigen::Matrix3Xf::Zero(3, _iNumberOfSteps + 2);\n    _mRFootPositions = Eigen::Matrix3Xf::Zero(3, _iNumberOfSteps + 2);\n    int stepCounter = 0;\n    \/\/ ***************************************************\n    \/\/ ** calculate generalized swinging leg trajectory **\n    \/\/ ***************************************************\n    int iSamplesPerStep = (int)(_iSampleSize * _dStepPeriod);\n    double sampleDelta = 1.0f \/ _iSampleSize;\n    \/\/ initialise generalized trajectory\n    Eigen::Matrix3Xf _footTrajectory = Eigen::Matrix3Xf::Zero(3, iSamplesPerStep);\n    \/\/ generalized trajectory for the first and last swinging leg\n    Eigen::Matrix3Xf _footTrajectoryFirst = Eigen::Matrix3Xf::Zero(3, iSamplesPerStep);\n    Eigen::Matrix3Xf _footTrajectoryLast = Eigen::Matrix3Xf::Zero(3, iSamplesPerStep);\n    \/\/ percentage of different Phases\n    double _dSS = (double)(_dSingleSupportPhase \/ _dStepPeriod);\n    double _dDS = (double)(_dDoubleSupportPhase \/ _dStepPeriod);\n    \/\/ total number of samples for each phase\n    int iSS = (int)(iSamplesPerStep * _dSS);\n    int iDS = (int)(iSamplesPerStep * _dDS);\n    \/\/ first dual support phase needs to be *long* to warm up the preview control\n    int iFDS = iSS;\n\n    calculateStep(_dSingleSupportPhase, iSS, sampleDelta, _dStepLength, _dStepHeight, _footTrajectory);\n\n    \/\/ half the hight\/step length\n    _footTrajectoryLast = _footTrajectory \/ 2.0;\n\n    \/\/ first step has only 3\/4 of the lift-off time\n    double firstStepFactor = 3 \/ 4.0;\n    double firstStepSSPhase = _dSingleSupportPhase * firstStepFactor;\n    int iFSS = iSS * firstStepFactor;\n    int iWait = iSS - iFSS;\n    int iFirstStepSampels = iSamplesPerStep - iWait;\n    Eigen::Matrix3Xf _tempTraj = Eigen::Matrix3Xf::Zero(3, iFirstStepSampels);\n    calculateStep(firstStepSSPhase, iFSS, sampleDelta, _dStepLength \/ 2.0, _dStepHeight \/ 2.0, _tempTraj);\n    _footTrajectoryFirst.block(0, iSamplesPerStep - iFirstStepSampels, 3, _tempTraj.cols()) = _tempTraj;\n\n    for (int i = 0; i < iWait; i++)\n    {\n        _footTrajectoryFirst(0, i) = _tempTraj(0, 0);\n        _footTrajectoryFirst(2, i) = _tempTraj(2, 0);\n    }\n\n    \/\/ ******************************************\n    \/\/ ** calculate Foot Positions for n-Steps **\n    \/\/ ******************************************\n    \/\/ initialise Matrices\n    std::cout << \"calculate Foot Positions for \" << _iNumberOfSteps << \" Steps: (iDS\/iSS: [\" << iDS << \"|\" << iSS << \"])\" << std::endl;\n    int iSamples = iSamplesPerStep * _iNumberOfSteps + 2*iFDS;\n    std::cout << \"generating a total of \" << iSamples << \" samples. Using \" << iSamplesPerStep << \" samples per step and [\" << iSS << \"|\" << iDS << \"] samples for [SS|DS]-phase!\" << std::endl;\n    _mLFootTrajectory =  Eigen::Matrix3Xf::Zero(3, iSamples);\n    _mRFootTrajectory =  Eigen::Matrix3Xf::Zero(3, iSamples);\n    bool bLeft = (_bLeftFootFirst ? true : false);\n    bool halfStep = true;\n    int index = 0;\n    \/\/ determine starting positions of left and right foot\n    Eigen::Vector3f vLeftFoot;\n    Eigen::Vector3f vRightFoot;\n    Eigen::Vector3f vTempL, vTempR;\n    vLeftFoot.setZero();\n    vRightFoot.setZero();\n    vLeftFoot(0) = -_dStepWidth \/ 2;\n    vRightFoot(0) = _dStepWidth \/ 2;\n    _vDeltaLeftFoot = vLeftFoot;\n    _vDeltaRightFoot = vRightFoot;\n\n    _mLFootPositions.col(stepCounter) = vLeftFoot;\n    _mRFootPositions.col(stepCounter) = vRightFoot;\n\n    \/\/ starting with full DS-Phase\n    for (int j = 0; j < iFDS; j++)\n    {\n        _mLFootTrajectory.col(index) = vLeftFoot;\n        _mRFootTrajectory.col(index) = vRightFoot;\n        index++;\n    }\n\n    Eigen::Matrix3Xf _currentFootTrajectory = _footTrajectoryFirst;\n    for (int i = 0; i < _iNumberOfSteps; i++)\n    {\n        if (i == 1)\n        {\n            _currentFootTrajectory = _footTrajectory;\n        }\n        else if (i == _iNumberOfSteps - 1)\n        {\n            _currentFootTrajectory = _footTrajectoryLast;\n        }\n\n        \/\/ TODO: find a more elegant solution\n        vTempL.setZero();\n        vTempR.setZero();\n\n        for (int j = 0; j < iSamplesPerStep; j++)\n        {\n            \/\/ which foot do we move?\n            if (bLeft)\n            {\n                vTempL = _currentFootTrajectory.col(j);\n            }\n            else\n            {\n                vTempR = _currentFootTrajectory.col(j);\n            }\n\n            Eigen::Vector3f currentLFoot = vLeftFoot + vTempL;\n            Eigen::Vector3f currentRFoot = vRightFoot + vTempR;\n            _mLFootTrajectory.col(index) = currentLFoot;\n            _mRFootTrajectory.col(index) = currentRFoot;\n            index++;\n        }\n\n        \/\/ switch feet\n        bLeft = (bLeft ? false : true);\n        \/\/ save new foot positions to temporary vectors\n        vLeftFoot = _mLFootTrajectory.col(index - 1);\n        vRightFoot = _mRFootTrajectory.col(index - 1);\n    }\n\n    double angle = M_PI\/2;\n    \/\/double angle = 0;\n    double anglePerLeftY = -angle \/ (vLeftFoot.y());\n    double anglePerRightY = -angle \/ (vRightFoot.y());\n    Eigen::Vector3f center(0.35, 0, 0);\n    for (int i = 0; i < _iNumberOfSteps; i++)\n    {\n        for (int j = 0; j < iSamplesPerStep; j++)\n        {\n            int k = iFDS + i*iSamplesPerStep + j;\n            Eigen::Matrix4f R = Eigen::Matrix4f::Identity();\n\n            Eigen::Vector3f currentLFoot = _mLFootTrajectory.col(k);\n            Eigen::Vector3f currentRFoot = _mRFootTrajectory.col(k);\n            double alphaLeft = currentLFoot.y() * anglePerLeftY;\n            VirtualRobot::MathTools::rpy2eigen4f(0, 0, alphaLeft, R);\n            currentLFoot = VirtualRobot::MathTools::transformPosition((Eigen::Vector3f) (currentLFoot-center), R) + center;\n            double alphaRight = currentRFoot.y() * anglePerRightY;\n            VirtualRobot::MathTools::rpy2eigen4f(0, 0, alphaRight, R);\n            currentRFoot = VirtualRobot::MathTools::transformPosition((Eigen::Vector3f) (currentRFoot-center), R) + center;\n            _mLFootTrajectory.col(k) = currentLFoot;\n            _mRFootTrajectory.col(k) = currentRFoot;\n        }\n\n        \/\/ switch feet\n        bLeft = (bLeft ? false : true);\n        \/\/ save new foot positions to temporary vectors\n        stepCounter++;\n        _mLFootPositions.col(stepCounter) = _mLFootTrajectory.col(iFDS + (i+1)*iSamplesPerStep - 1);\n        _mRFootPositions.col(stepCounter) = _mRFootTrajectory.col(iFDS + (i+1)*iSamplesPerStep - 1);\n    }\n\n    Eigen::Vector3f lastLeftPos = _mLFootTrajectory.col(iFDS + _iNumberOfSteps*iSamplesPerStep - 1);\n    Eigen::Vector3f lastRighPos = _mRFootTrajectory.col(iFDS + _iNumberOfSteps*iSamplesPerStep - 1);\n\n    \/\/ insert ending DS-phase\n    for (int j=0; j<iFDS; j++) {\n        _mLFootTrajectory.col(index) = lastLeftPos;\n        _mRFootTrajectory.col(index) = lastRighPos;\n        index++;\n    }\n    \/\/ save last step positions\n    stepCounter++;\n    _mLFootPositions.col(stepCounter) = lastLeftPos;\n    _mRFootPositions.col(stepCounter) = lastRighPos;\n\n    _bGenerated = true;\n}\n\n\n<commit_msg>Disable pattern generation in circle per default<commit_after>#include \"pattern\/PolynomialFootstepPlaner.h\"\n\n#include <VirtualRobot\/Robot.h>\n#include <VirtualRobot\/CollisionDetection\/CollisionChecker.h>\n#include <VirtualRobot\/Visualization\/CoinVisualization\/CoinVisualizationFactory.h>\n\nPolynomialFootstepPlaner::PolynomialFootstepPlaner()\n    : FootstepPlaner()\n{\n}\n\nvoid PolynomialFootstepPlaner::setParameters(double stepLength, double stepPeriod, double doubleSupportPhase, double stepHeight, int sampleSize)\n{\n    if (_bParametersInitialized)\n    {\n        \/\/TODO: first delete all array, vectors and matrices\n    }\n\n    _dStepLength = stepLength;\n    _dStepPeriod = stepPeriod;\n    _dDoubleSupportPhase = doubleSupportPhase;\n    _dSingleSupportPhase = _dStepPeriod - _dDoubleSupportPhase;\n    _dStepHeight = stepHeight;\n    _iSampleSize = sampleSize;\n    _bParametersInitialized = true;\n}\n\n\/\/ start walking with left foot first\nvoid PolynomialFootstepPlaner::setLeftFootFirst()\n{\n    _bLeftFootFirst = true;\n}\n\n\/\/ start walking with right foot first\nvoid PolynomialFootstepPlaner::setRightFootFirst()\n{\n    _bLeftFootFirst = false;\n}\n\nvoid PolynomialFootstepPlaner::calculateStep(double ssTime, int ssSamples, double sampleDelta, double stepLength, double stepHeight, Eigen::Matrix3Xf& trajectory)\n{\n    \/\/ temporary variables\n    double T1 = ssTime;                 \/\/ T^1\n    double T2 = T1 * T1;                \/\/ T^2\n    double T3 = T2 * T1;                \/\/ T^3\n    double T4 = T3 * T1;                \/\/ T^4\n    double S = stepLength;              \/\/ StepLength\n    double H = stepHeight;              \/\/ Height\n    double cx, dx, bz, cz, dz, xtemp, ztemp, x1, x2, x3, x4;\n\n    \/\/ calculating foot trajectory for swinging leg including resting phase\n    for (int i = 0; i < trajectory.cols(); i++)\n    {\n        \/\/ precalculate {c*x, d*x, b*z, c*z, d*z, x^1, x^2, x^3, x^4} for optimization purposes\n        cx = -2 * S \/ T3;\n        dx = 3 * S \/ T2;\n        bz = 16 * H \/ T4;\n        cz = -32 * H \/ T3;\n        dz = 16 * H \/ T2;\n        x1 = sampleDelta * i;\n        x2 = x1 * x1;\n        x3 = x2 * x1;\n        x4 = x3 * x1;\n\n        if (i < ssSamples)\n        {\n            \/\/ swinging phase\n            xtemp =       cx * x3 + dx * x2;\n            ztemp = bz * x4 + cz * x3 + dz * x2;\n        }\n        else\n        {\n            \/\/ resting phase continues with last values\n            xtemp = S;\n            ztemp = 0;\n        }\n\n        trajectory(0, i) = 0;\n        trajectory(1, i) = xtemp;\n        trajectory(2, i) = ztemp;\n    }\n}\n\nvoid PolynomialFootstepPlaner::computeFeetTrajectories(int numberOfSteps)\n{\n    if (numberOfSteps < 2)\n    {\n        numberOfSteps = 2;\n    }\n\n    _iNumberOfSteps = numberOfSteps;\n    _mLFootPositions = Eigen::Matrix3Xf::Zero(3, _iNumberOfSteps + 2);\n    _mRFootPositions = Eigen::Matrix3Xf::Zero(3, _iNumberOfSteps + 2);\n    int stepCounter = 0;\n    \/\/ ***************************************************\n    \/\/ ** calculate generalized swinging leg trajectory **\n    \/\/ ***************************************************\n    int iSamplesPerStep = (int)(_iSampleSize * _dStepPeriod);\n    double sampleDelta = 1.0f \/ _iSampleSize;\n    \/\/ initialise generalized trajectory\n    Eigen::Matrix3Xf _footTrajectory = Eigen::Matrix3Xf::Zero(3, iSamplesPerStep);\n    \/\/ generalized trajectory for the first and last swinging leg\n    Eigen::Matrix3Xf _footTrajectoryFirst = Eigen::Matrix3Xf::Zero(3, iSamplesPerStep);\n    Eigen::Matrix3Xf _footTrajectoryLast = Eigen::Matrix3Xf::Zero(3, iSamplesPerStep);\n    \/\/ percentage of different Phases\n    double _dSS = (double)(_dSingleSupportPhase \/ _dStepPeriod);\n    double _dDS = (double)(_dDoubleSupportPhase \/ _dStepPeriod);\n    \/\/ total number of samples for each phase\n    int iSS = (int)(iSamplesPerStep * _dSS);\n    int iDS = (int)(iSamplesPerStep * _dDS);\n    \/\/ first dual support phase needs to be *long* to warm up the preview control\n    int iFDS = iSS;\n\n    calculateStep(_dSingleSupportPhase, iSS, sampleDelta, _dStepLength, _dStepHeight, _footTrajectory);\n\n    \/\/ half the hight\/step length\n    _footTrajectoryLast = _footTrajectory \/ 2.0;\n\n    \/\/ first step has only 3\/4 of the lift-off time\n    double firstStepFactor = 3 \/ 4.0;\n    double firstStepSSPhase = _dSingleSupportPhase * firstStepFactor;\n    int iFSS = iSS * firstStepFactor;\n    int iWait = iSS - iFSS;\n    int iFirstStepSampels = iSamplesPerStep - iWait;\n    Eigen::Matrix3Xf _tempTraj = Eigen::Matrix3Xf::Zero(3, iFirstStepSampels);\n    calculateStep(firstStepSSPhase, iFSS, sampleDelta, _dStepLength \/ 2.0, _dStepHeight \/ 2.0, _tempTraj);\n    _footTrajectoryFirst.block(0, iSamplesPerStep - iFirstStepSampels, 3, _tempTraj.cols()) = _tempTraj;\n\n    for (int i = 0; i < iWait; i++)\n    {\n        _footTrajectoryFirst(0, i) = _tempTraj(0, 0);\n        _footTrajectoryFirst(2, i) = _tempTraj(2, 0);\n    }\n\n    \/\/ ******************************************\n    \/\/ ** calculate Foot Positions for n-Steps **\n    \/\/ ******************************************\n    \/\/ initialise Matrices\n    std::cout << \"calculate Foot Positions for \" << _iNumberOfSteps << \" Steps: (iDS\/iSS: [\" << iDS << \"|\" << iSS << \"])\" << std::endl;\n    int iSamples = iSamplesPerStep * _iNumberOfSteps + 2*iFDS;\n    std::cout << \"generating a total of \" << iSamples << \" samples. Using \" << iSamplesPerStep << \" samples per step and [\" << iSS << \"|\" << iDS << \"] samples for [SS|DS]-phase!\" << std::endl;\n    _mLFootTrajectory =  Eigen::Matrix3Xf::Zero(3, iSamples);\n    _mRFootTrajectory =  Eigen::Matrix3Xf::Zero(3, iSamples);\n    bool bLeft = (_bLeftFootFirst ? true : false);\n    bool halfStep = true;\n    int index = 0;\n    \/\/ determine starting positions of left and right foot\n    Eigen::Vector3f vLeftFoot;\n    Eigen::Vector3f vRightFoot;\n    Eigen::Vector3f vTempL, vTempR;\n    vLeftFoot.setZero();\n    vRightFoot.setZero();\n    vLeftFoot(0) = -_dStepWidth \/ 2;\n    vRightFoot(0) = _dStepWidth \/ 2;\n    _vDeltaLeftFoot = vLeftFoot;\n    _vDeltaRightFoot = vRightFoot;\n\n    _mLFootPositions.col(stepCounter) = vLeftFoot;\n    _mRFootPositions.col(stepCounter) = vRightFoot;\n\n    \/\/ starting with full DS-Phase\n    for (int j = 0; j < iFDS; j++)\n    {\n        _mLFootTrajectory.col(index) = vLeftFoot;\n        _mRFootTrajectory.col(index) = vRightFoot;\n        index++;\n    }\n\n    Eigen::Matrix3Xf _currentFootTrajectory = _footTrajectoryFirst;\n    for (int i = 0; i < _iNumberOfSteps; i++)\n    {\n        if (i == 1)\n        {\n            _currentFootTrajectory = _footTrajectory;\n        }\n        else if (i == _iNumberOfSteps - 1)\n        {\n            _currentFootTrajectory = _footTrajectoryLast;\n        }\n\n        \/\/ TODO: find a more elegant solution\n        vTempL.setZero();\n        vTempR.setZero();\n\n        for (int j = 0; j < iSamplesPerStep; j++)\n        {\n            \/\/ which foot do we move?\n            if (bLeft)\n            {\n                vTempL = _currentFootTrajectory.col(j);\n            }\n            else\n            {\n                vTempR = _currentFootTrajectory.col(j);\n            }\n\n            Eigen::Vector3f currentLFoot = vLeftFoot + vTempL;\n            Eigen::Vector3f currentRFoot = vRightFoot + vTempR;\n            _mLFootTrajectory.col(index) = currentLFoot;\n            _mRFootTrajectory.col(index) = currentRFoot;\n            index++;\n        }\n\n        \/\/ switch feet\n        bLeft = (bLeft ? false : true);\n        \/\/ save new foot positions to temporary vectors\n        vLeftFoot = _mLFootTrajectory.col(index - 1);\n        vRightFoot = _mRFootTrajectory.col(index - 1);\n    }\n\n    \/\/double angle = M_PI\/2;\n    double angle = 0;\n    double anglePerLeftY = -angle \/ (vLeftFoot.y());\n    double anglePerRightY = -angle \/ (vRightFoot.y());\n    Eigen::Vector3f center(0.35, 0, 0);\n    for (int i = 0; i < _iNumberOfSteps; i++)\n    {\n        for (int j = 0; j < iSamplesPerStep; j++)\n        {\n            int k = iFDS + i*iSamplesPerStep + j;\n            Eigen::Matrix4f R = Eigen::Matrix4f::Identity();\n\n            Eigen::Vector3f currentLFoot = _mLFootTrajectory.col(k);\n            Eigen::Vector3f currentRFoot = _mRFootTrajectory.col(k);\n            double alphaLeft = currentLFoot.y() * anglePerLeftY;\n            VirtualRobot::MathTools::rpy2eigen4f(0, 0, alphaLeft, R);\n            currentLFoot = VirtualRobot::MathTools::transformPosition((Eigen::Vector3f) (currentLFoot-center), R) + center;\n            double alphaRight = currentRFoot.y() * anglePerRightY;\n            VirtualRobot::MathTools::rpy2eigen4f(0, 0, alphaRight, R);\n            currentRFoot = VirtualRobot::MathTools::transformPosition((Eigen::Vector3f) (currentRFoot-center), R) + center;\n            _mLFootTrajectory.col(k) = currentLFoot;\n            _mRFootTrajectory.col(k) = currentRFoot;\n        }\n\n        \/\/ switch feet\n        bLeft = (bLeft ? false : true);\n        \/\/ save new foot positions to temporary vectors\n        stepCounter++;\n        _mLFootPositions.col(stepCounter) = _mLFootTrajectory.col(iFDS + (i+1)*iSamplesPerStep - 1);\n        _mRFootPositions.col(stepCounter) = _mRFootTrajectory.col(iFDS + (i+1)*iSamplesPerStep - 1);\n    }\n\n    Eigen::Vector3f lastLeftPos = _mLFootTrajectory.col(iFDS + _iNumberOfSteps*iSamplesPerStep - 1);\n    Eigen::Vector3f lastRighPos = _mRFootTrajectory.col(iFDS + _iNumberOfSteps*iSamplesPerStep - 1);\n\n    \/\/ insert ending DS-phase\n    for (int j=0; j<iFDS; j++) {\n        _mLFootTrajectory.col(index) = lastLeftPos;\n        _mRFootTrajectory.col(index) = lastRighPos;\n        index++;\n    }\n    \/\/ save last step positions\n    stepCounter++;\n    _mLFootPositions.col(stepCounter) = lastLeftPos;\n    _mRFootPositions.col(stepCounter) = lastRighPos;\n\n    _bGenerated = true;\n}\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 * @file battery.cpp\n *\n * Library calls for battery functionality.\n *\n * @author Julian Oes <julian@oes.ch>\n *\/\n\n#include \"battery.h\"\n#include <mathlib\/mathlib.h>\n\nBattery::Battery() :\n\tSuperBlock(nullptr, \"BAT\"),\n\t_v_empty(this, \"V_EMPTY\"),\n\t_v_charged(this, \"V_CHARGED\"),\n\t_n_cells(this, \"N_CELLS\"),\n\t_capacity(this, \"CAPACITY\"),\n\t_v_load_drop(this, \"V_LOAD_DROP\"),\n\t_r_internal(this, \"R_INTERNAL\"),\n\t_low_thr(this, \"LOW_THR\"),\n\t_crit_thr(this, \"CRIT_THR\"),\n\t_emergency_thr(this, \"EMERGEN_THR\"),\n\t_voltage_filtered_v(-1.f),\n\t_current_filtered_a(-1.f),\n\t_discharged_mah(0.f),\n\t_discharged_mah_loop(0.f),\n\t_remaining_voltage(1.f),\n\t_remaining(2.f),\n\t_scale(1.f),\n\t_warning(battery_status_s::BATTERY_WARNING_NONE),\n\t_last_timestamp(0)\n{\n\t\/* load initial params *\/\n\tupdateParams();\n}\n\nBattery::~Battery()\n{\n}\n\nvoid\nBattery::reset(battery_status_s *battery_status)\n{\n\tmemset(battery_status, 0, sizeof(*battery_status));\n\tbattery_status->current_a = -1.f;\n\tbattery_status->remaining = 1.f;\n\tbattery_status->scale = 1.f;\n\tbattery_status->cell_count = _n_cells.get();\n\t\/\/ TODO: check if it is sane to reset warning to NONE\n\tbattery_status->warning = battery_status_s::BATTERY_WARNING_NONE;\n\tbattery_status->connected = false;\n}\n\nvoid\nBattery::updateBatteryStatus(hrt_abstime timestamp, float voltage_v, float current_a,\n\t\t\t     bool connected, bool selected_source, int priority,\n\t\t\t     float throttle_normalized,\n\t\t\t     bool armed, battery_status_s *battery_status)\n{\n\treset(battery_status);\n\tbattery_status->timestamp = timestamp;\n\tfilterVoltage(voltage_v);\n\tfilterCurrent(current_a);\n\tsumDischarged(timestamp, current_a);\n\testimateRemaining(_voltage_filtered_v, _current_filtered_a, throttle_normalized, armed);\n\tdetermineWarning(connected);\n\tcomputeScale();\n\n\tif (_voltage_filtered_v > 2.1f) {\n\t\tbattery_status->voltage_v = voltage_v;\n\t\tbattery_status->voltage_filtered_v = _voltage_filtered_v;\n\t\tbattery_status->scale = _scale;\n\t\tbattery_status->current_a = current_a;\n\t\tbattery_status->current_filtered_a = _current_filtered_a;\n\t\tbattery_status->discharged_mah = _discharged_mah;\n\t\tbattery_status->warning = _warning;\n\t\tbattery_status->remaining = _remaining;\n\t\tbattery_status->connected = connected;\n\t\tbattery_status->system_source = selected_source;\n\t\tbattery_status->priority = priority;\n\t}\n}\n\nvoid\nBattery::filterVoltage(float voltage_v)\n{\n\tif (_voltage_filtered_v < 0.f) {\n\t\t_voltage_filtered_v = voltage_v;\n\t}\n\n\t\/\/ TODO: inspect that filter performance\n\tconst float filtered_next = _voltage_filtered_v * 0.99f + voltage_v * 0.01f;\n\n\tif (PX4_ISFINITE(filtered_next)) {\n\t\t_voltage_filtered_v = filtered_next;\n\t}\n}\n\nvoid\nBattery::filterCurrent(float current_a)\n{\n\tif (_current_filtered_a < 0.f) {\n\t\t_current_filtered_a = current_a;\n\t}\n\n\t\/\/ ADC poll is at 100Hz, this will perform a low pass over approx 500ms\n\tconst float filtered_next = _current_filtered_a * 0.98f + current_a * 0.02f;\n\n\tif (PX4_ISFINITE(filtered_next)) {\n\t\t_current_filtered_a = filtered_next;\n\t}\n}\n\n\nvoid\nBattery::sumDischarged(hrt_abstime timestamp, float current_a)\n{\n\t\/\/ Not a valid measurement\n\tif (current_a < 0.f) {\n\t\t\/\/ Because the measurement was invalid we need to stop integration\n\t\t\/\/ and re-initialize with the next valid measurement\n\t\t_last_timestamp = 0;\n\t\treturn;\n\t}\n\n\t\/\/ Ignore first update because we don't know dt.\n\tif (_last_timestamp != 0) {\n\t\tconst float dt = (timestamp - _last_timestamp) \/ 1e6;\n\t\t\/\/ mAh since last loop: (current[A] * 1000 = [mA]) * (dt[s] \/ 3600 = [h])\n\t\t_discharged_mah_loop = (current_a * 1e3f) * (dt \/ 3600.f);\n\t\t_discharged_mah += _discharged_mah_loop;\n\t}\n\n\t_last_timestamp = timestamp;\n}\n\nvoid\nBattery::estimateRemaining(float voltage_v, float current_a, float throttle_normalized, bool armed)\n{\n\t\/\/ correct battery voltage locally for load drop to avoid estimation fluctuations\n\tif (_r_internal.get() >= 0.f) {\n\t\tvoltage_v += _r_internal.get() * current_a;\n\n\t} else {\n\t\t\/\/ assume quadratic relation between throttle and current\n\t\t\/\/ good assumption if throttle represents RPM\n\t\tvoltage_v += throttle_normalized * throttle_normalized * _v_load_drop.get();\n\t}\n\n\t\/\/ remaining battery capacity based on voltage\n\tconst float cell_voltage = voltage_v \/ _n_cells.get();\n\t_remaining_voltage = math::gradual(cell_voltage, _v_empty.get(), _v_charged.get(), 0.f, 1.f);\n\n\t\/\/ choose which quantity we're using for final reporting\n\tif (_capacity.get() > 0.f) {\n\t\t\/\/ if battery capacity is known, fuse voltage measurement with used capacity\n\t\tif (_remaining > 1.f) {\n\t\t\t\/\/ initialization of the estimation state\n\t\t\t_remaining = _remaining_voltage;\n\n\t\t} else {\n\t\t\t\/\/ The lower the voltage the more adjust the estimate with it to avoid deep discharge\n\t\t\tconst float weight_v = 3e-4f * (1 - _remaining_voltage);\n\t\t\t_remaining = (1 - weight_v) * _remaining + weight_v * _remaining_voltage;\n\t\t\t\/\/ directly apply current capacity slope calculated using current\n\t\t\t_remaining -= _discharged_mah_loop \/ _capacity.get();\n\t\t\t_remaining = math::max(_remaining, 0.f);\n\t\t}\n\n\t} else {\n\t\t\/\/ else use voltage\n\t\t_remaining = _remaining_voltage;\n\t}\n}\n\nvoid\nBattery::determineWarning(bool connected)\n{\n\tif (connected) {\n\t\t\/\/ propagate warning state only if the state is higher, otherwise remain in current warning state\n\t\tif (_remaining < _emergency_thr.get() || (_warning == battery_status_s::BATTERY_WARNING_EMERGENCY)) {\n\t\t\t_warning = battery_status_s::BATTERY_WARNING_EMERGENCY;\n\n\t\t} else if (_remaining < _crit_thr.get() || (_warning == battery_status_s::BATTERY_WARNING_CRITICAL)) {\n\t\t\t_warning = battery_status_s::BATTERY_WARNING_CRITICAL;\n\n\t\t} else if (_remaining < _low_thr.get() || (_warning == battery_status_s::BATTERY_WARNING_LOW)) {\n\t\t\t_warning = battery_status_s::BATTERY_WARNING_LOW;\n\t\t}\n\t}\n}\n\nvoid\nBattery::computeScale()\n{\n\tconst float voltage_range = (_v_charged.get() - _v_empty.get());\n\n\t\/\/ reusing capacity calculation to get single cell voltage before drop\n\tconst float bat_v = _v_empty.get() + (voltage_range * _remaining_voltage);\n\n\t_scale = _v_charged.get() \/ bat_v;\n\n\tif (_scale > 1.3f) { \/\/ Allow at most 30% compensation\n\t\t_scale = 1.3f;\n\n\t} else if (!PX4_ISFINITE(_scale) || _scale < 1.f) { \/\/ Shouldn't ever be more than the power at full battery\n\t\t_scale = 1.f;\n\t}\n}\n<commit_msg>battery compensation is now performed on the cell voltage rather than the total voltage<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 * @file battery.cpp\n *\n * Library calls for battery functionality.\n *\n * @author Julian Oes <julian@oes.ch>\n *\/\n\n#include \"battery.h\"\n#include <mathlib\/mathlib.h>\n\nBattery::Battery() :\n\tSuperBlock(nullptr, \"BAT\"),\n\t_v_empty(this, \"V_EMPTY\"),\n\t_v_charged(this, \"V_CHARGED\"),\n\t_n_cells(this, \"N_CELLS\"),\n\t_capacity(this, \"CAPACITY\"),\n\t_v_load_drop(this, \"V_LOAD_DROP\"),\n\t_r_internal(this, \"R_INTERNAL\"),\n\t_low_thr(this, \"LOW_THR\"),\n\t_crit_thr(this, \"CRIT_THR\"),\n\t_emergency_thr(this, \"EMERGEN_THR\"),\n\t_voltage_filtered_v(-1.f),\n\t_current_filtered_a(-1.f),\n\t_discharged_mah(0.f),\n\t_discharged_mah_loop(0.f),\n\t_remaining_voltage(1.f),\n\t_remaining(2.f),\n\t_scale(1.f),\n\t_warning(battery_status_s::BATTERY_WARNING_NONE),\n\t_last_timestamp(0)\n{\n\t\/* load initial params *\/\n\tupdateParams();\n}\n\nBattery::~Battery()\n{\n}\n\nvoid\nBattery::reset(battery_status_s *battery_status)\n{\n\tmemset(battery_status, 0, sizeof(*battery_status));\n\tbattery_status->current_a = -1.f;\n\tbattery_status->remaining = 1.f;\n\tbattery_status->scale = 1.f;\n\tbattery_status->cell_count = _n_cells.get();\n\t\/\/ TODO: check if it is sane to reset warning to NONE\n\tbattery_status->warning = battery_status_s::BATTERY_WARNING_NONE;\n\tbattery_status->connected = false;\n}\n\nvoid\nBattery::updateBatteryStatus(hrt_abstime timestamp, float voltage_v, float current_a,\n\t\t\t     bool connected, bool selected_source, int priority,\n\t\t\t     float throttle_normalized,\n\t\t\t     bool armed, battery_status_s *battery_status)\n{\n\treset(battery_status);\n\tbattery_status->timestamp = timestamp;\n\tfilterVoltage(voltage_v);\n\tfilterCurrent(current_a);\n\tsumDischarged(timestamp, current_a);\n\testimateRemaining(_voltage_filtered_v, _current_filtered_a, throttle_normalized, armed);\n\tdetermineWarning(connected);\n\tcomputeScale();\n\n\tif (_voltage_filtered_v > 2.1f) {\n\t\tbattery_status->voltage_v = voltage_v;\n\t\tbattery_status->voltage_filtered_v = _voltage_filtered_v;\n\t\tbattery_status->scale = _scale;\n\t\tbattery_status->current_a = current_a;\n\t\tbattery_status->current_filtered_a = _current_filtered_a;\n\t\tbattery_status->discharged_mah = _discharged_mah;\n\t\tbattery_status->warning = _warning;\n\t\tbattery_status->remaining = _remaining;\n\t\tbattery_status->connected = connected;\n\t\tbattery_status->system_source = selected_source;\n\t\tbattery_status->priority = priority;\n\t}\n}\n\nvoid\nBattery::filterVoltage(float voltage_v)\n{\n\tif (_voltage_filtered_v < 0.f) {\n\t\t_voltage_filtered_v = voltage_v;\n\t}\n\n\t\/\/ TODO: inspect that filter performance\n\tconst float filtered_next = _voltage_filtered_v * 0.99f + voltage_v * 0.01f;\n\n\tif (PX4_ISFINITE(filtered_next)) {\n\t\t_voltage_filtered_v = filtered_next;\n\t}\n}\n\nvoid\nBattery::filterCurrent(float current_a)\n{\n\tif (_current_filtered_a < 0.f) {\n\t\t_current_filtered_a = current_a;\n\t}\n\n\t\/\/ ADC poll is at 100Hz, this will perform a low pass over approx 500ms\n\tconst float filtered_next = _current_filtered_a * 0.98f + current_a * 0.02f;\n\n\tif (PX4_ISFINITE(filtered_next)) {\n\t\t_current_filtered_a = filtered_next;\n\t}\n}\n\n\nvoid\nBattery::sumDischarged(hrt_abstime timestamp, float current_a)\n{\n\t\/\/ Not a valid measurement\n\tif (current_a < 0.f) {\n\t\t\/\/ Because the measurement was invalid we need to stop integration\n\t\t\/\/ and re-initialize with the next valid measurement\n\t\t_last_timestamp = 0;\n\t\treturn;\n\t}\n\n\t\/\/ Ignore first update because we don't know dt.\n\tif (_last_timestamp != 0) {\n\t\tconst float dt = (timestamp - _last_timestamp) \/ 1e6;\n\t\t\/\/ mAh since last loop: (current[A] * 1000 = [mA]) * (dt[s] \/ 3600 = [h])\n\t\t_discharged_mah_loop = (current_a * 1e3f) * (dt \/ 3600.f);\n\t\t_discharged_mah += _discharged_mah_loop;\n\t}\n\n\t_last_timestamp = timestamp;\n}\n\nvoid\nBattery::estimateRemaining(float voltage_v, float current_a, float throttle_normalized, bool armed)\n{\n\n\n\t\/\/ remaining battery capacity based on voltage\n\tconst float cell_voltage = voltage_v \/ _n_cells.get();\n\t\n\t\/\/ correct battery voltage locally for load drop to avoid estimation fluctuations\n\tif (_r_internal.get() >= 0.f) {\n\t\tcell_voltage += _r_internal.get() * current_a;\n\n\t} else {\n\t\t\/\/ assume quadratic relation between throttle and current\n\t\t\/\/ good assumption if throttle represents RPM\n\t\tcell_voltage += throttle_normalized * throttle_normalized * _v_load_drop.get();\n\t}\n\t_remaining_voltage = math::gradual(cell_voltage, _v_empty.get(), _v_charged.get(), 0.f, 1.f);\n\n\t\/\/ choose which quantity we're using for final reporting\n\tif (_capacity.get() > 0.f) {\n\t\t\/\/ if battery capacity is known, fuse voltage measurement with used capacity\n\t\tif (_remaining > 1.f) {\n\t\t\t\/\/ initialization of the estimation state\n\t\t\t_remaining = _remaining_voltage;\n\n\t\t} else {\n\t\t\t\/\/ The lower the voltage the more adjust the estimate with it to avoid deep discharge\n\t\t\tconst float weight_v = 3e-4f * (1 - _remaining_voltage);\n\t\t\t_remaining = (1 - weight_v) * _remaining + weight_v * _remaining_voltage;\n\t\t\t\/\/ directly apply current capacity slope calculated using current\n\t\t\t_remaining -= _discharged_mah_loop \/ _capacity.get();\n\t\t\t_remaining = math::max(_remaining, 0.f);\n\t\t}\n\n\t} else {\n\t\t\/\/ else use voltage\n\t\t_remaining = _remaining_voltage;\n\t}\n}\n\nvoid\nBattery::determineWarning(bool connected)\n{\n\tif (connected) {\n\t\t\/\/ propagate warning state only if the state is higher, otherwise remain in current warning state\n\t\tif (_remaining < _emergency_thr.get() || (_warning == battery_status_s::BATTERY_WARNING_EMERGENCY)) {\n\t\t\t_warning = battery_status_s::BATTERY_WARNING_EMERGENCY;\n\n\t\t} else if (_remaining < _crit_thr.get() || (_warning == battery_status_s::BATTERY_WARNING_CRITICAL)) {\n\t\t\t_warning = battery_status_s::BATTERY_WARNING_CRITICAL;\n\n\t\t} else if (_remaining < _low_thr.get() || (_warning == battery_status_s::BATTERY_WARNING_LOW)) {\n\t\t\t_warning = battery_status_s::BATTERY_WARNING_LOW;\n\t\t}\n\t}\n}\n\nvoid\nBattery::computeScale()\n{\n\tconst float voltage_range = (_v_charged.get() - _v_empty.get());\n\n\t\/\/ reusing capacity calculation to get single cell voltage before drop\n\tconst float bat_v = _v_empty.get() + (voltage_range * _remaining_voltage);\n\n\t_scale = _v_charged.get() \/ bat_v;\n\n\tif (_scale > 1.3f) { \/\/ Allow at most 30% compensation\n\t\t_scale = 1.3f;\n\n\t} else if (!PX4_ISFINITE(_scale) || _scale < 1.f) { \/\/ Shouldn't ever be more than the power at full battery\n\t\t_scale = 1.f;\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <osgProducer\/DatabasePager>\n#include <osgDB\/ReadFile>\n\nusing namespace osgProducer;\n\nDatabasePager::DatabasePager()\n{\n    std::cout<<\"Constructing DatabasePager()\"<<std::endl;\n    _expiryDelay = 1.0;\n}\n\nvoid DatabasePager::requestNodeFile(const std::string& fileName,osg::Group* group)\n{\n   \n    \/\/ search to see if filename already exist in the file loaded list.\n    bool foundEntry = false;\n\n    _fileLoadedListMutex.lock();\n    \n        for(DatabaseRequestList::iterator litr = _fileLoadedList.begin();\n            litr != _fileLoadedList.end() && !foundEntry;\n            ++litr)\n        {\n            if ((*litr)->_fileName==fileName)\n            {\n                foundEntry = true;\n                ++((*litr)->_numOfRequests);\n            }\n        }        \n\n    _fileLoadedListMutex.unlock();\n\n    if (!foundEntry)\n    {\n    \n        _fileRequestListMutex.lock();\n\n            \/\/ search to see if entry already  in file request list.\n            bool foundEntry = false;\n            for(DatabaseRequestList::iterator ritr = _fileRequestList.begin();\n                ritr != _fileRequestList.end() && !foundEntry;\n                ++ritr)\n            {\n                if ((*ritr)->_fileName==fileName)\n                {\n                    foundEntry = true;\n                    ++((*ritr)->_numOfRequests);\n                }\n            }        \n\n            if (!foundEntry)\n            {\n                osg::ref_ptr<DatabaseRequest> databaseRequest = new DatabaseRequest;\n\n                databaseRequest->_fileName = fileName;\n                databaseRequest->_groupForAddingLoadedSubgraph = group;\n\n                _fileRequestList.push_back(databaseRequest);\n            }\n\n        _fileRequestListMutex.unlock();\n    }\n    \n    if (!threadIsRunning())\n    {\n        std::cout<<\"DatabasePager::startThread()\"<<std::endl;\n        startThread();\n    }\n}\n\nvoid DatabasePager::run()\n{\n    std::cout<<\"DatabasePager::run()\"<<std::endl;\n    \n    while(true)\n    {\n        osg::ref_ptr<DatabaseRequest> databaseRequest;\n    \n        \/\/ get the front of the file request list.\n        _fileRequestListMutex.lock();\n            if (!_fileRequestList.empty()) databaseRequest = _fileRequestList.front();\n        _fileRequestListMutex.unlock();\n        \n        if (databaseRequest.valid())\n        {\n            \/\/ load the data, note safe to write to the databaseRequest since once \n            \/\/ it is created this thread is the only one to write to the _loadedModel pointer.\n            databaseRequest->_loadedModel = osgDB::readNodeFile(databaseRequest->_fileName);\n\n            _fileRequestListMutex.lock();\n                _fileRequestList.erase(_fileRequestList.begin());\n            _fileRequestListMutex.unlock();\n\n            if (databaseRequest->_loadedModel.valid())\n            {\n                _fileLoadedListMutex.lock();\n\n                    _fileLoadedList.push_back(databaseRequest);\n\n                _fileLoadedListMutex.unlock();\n            }        \n        }\n        \n        \/\/ hack hack hack... sleep for 1ms so we give other threads a chance..\n        #ifdef WIN32\n            Sleep(1);\n        #else\n            usleep(1000);\n        #endif\n    }\n    \n    cancel();\n    join();   \n}\n\nvoid DatabasePager::addLoadedDataToSceneGraph()\n{\n    DatabaseRequestList localFileLoadedList;\n\n    \/\/ get the dat for the _fileLoadedList, leaving it empty via a std::vector<>.swap.\n    _fileLoadedListMutex.lock();\n        localFileLoadedList.swap(_fileLoadedList);\n    _fileLoadedListMutex.unlock();\n    \n    \/\/ add the loaded data into the scene graph.\n    for(DatabaseRequestList::iterator itr=localFileLoadedList.begin();\n        itr!=localFileLoadedList.end();\n        ++itr)\n    {\n        DatabaseRequest* databaseRequest = itr->get();\n        registerPagedLODs(databaseRequest->_loadedModel.get());\n        databaseRequest->_groupForAddingLoadedSubgraph->addChild(databaseRequest->_loadedModel.get());\n        \/\/std::cout<<\"merged subgraph\"<<databaseRequest->_fileName<<\" after \"<<databaseRequest->_numOfRequests<<\" requests.\"<<std::endl;\n\n    }\n    \n}\n\nvoid DatabasePager::removeExpiredSubgraphs(double currentFrameTime)\n{\n    double expiryTime = currentFrameTime - _expiryDelay;\n\n    \/\/std::cout<<\"DatabasePager::removeExpiredSubgraphs(\"<<expiryTime<<\") \"<<std::endl;\n    for(PagedLODList::iterator itr=_pagedLODList.begin();\n        itr!=_pagedLODList.end();\n        ++itr)\n    {\n        osg::PagedLOD* plod = itr->get();\n        plod->removeExpiredChildren(expiryTime);\n    }\n    \n    for(unsigned int i=_pagedLODList.size();\n        i>0;\n        )\n    {\n        --i;\n        \n        osg::PagedLOD* plod = _pagedLODList[i].get();\n        if (plod->referenceCount()==1)\n        {\n            \/\/std::cout<<\"    PagedLOD \"<<plod<<\" orphaned\"<<std::endl;\n            _pagedLODList.erase(_pagedLODList.begin()+i);\n        }\n        else\n        {\n            \/\/std::cout<<\"    PagedLOD \"<<plod<<\" refcount \"<<plod->referenceCount()<<std::endl;\n        }\n    }\n        \n    \n}\n\n\nclass FindPagedLODsVisitor : public osg::NodeVisitor\n{\npublic:\n    FindPagedLODsVisitor(DatabasePager::PagedLODList& pagedLODList):\n        osg::NodeVisitor(osg::NodeVisitor::TRAVERSE_ALL_CHILDREN),\n        _pagedLODList(pagedLODList)\n    {\n    }\n    \n    virtual void apply(osg::PagedLOD& plod)\n    {\n        _pagedLODList.push_back(&plod);\n    \n        traverse(plod);\n    }\n    \n    DatabasePager::PagedLODList& _pagedLODList;\n};\n\nvoid DatabasePager::registerPagedLODs(osg::Node* subgraph)\n{\n    FindPagedLODsVisitor fplv(_pagedLODList);\n    if (subgraph) subgraph->accept(fplv);\n}\n\n<commit_msg>Added #include <unistd.h> to DatabasePager.cpp.<commit_after>#include <osgProducer\/DatabasePager>\n#include <osgDB\/ReadFile>\n\n#ifndef WIN32\n#include <unistd.h>\n#endif\n\nusing namespace osgProducer;\n\nDatabasePager::DatabasePager()\n{\n    std::cout<<\"Constructing DatabasePager()\"<<std::endl;\n    _expiryDelay = 1.0;\n}\n\nvoid DatabasePager::requestNodeFile(const std::string& fileName,osg::Group* group)\n{\n   \n    \/\/ search to see if filename already exist in the file loaded list.\n    bool foundEntry = false;\n\n    _fileLoadedListMutex.lock();\n    \n        for(DatabaseRequestList::iterator litr = _fileLoadedList.begin();\n            litr != _fileLoadedList.end() && !foundEntry;\n            ++litr)\n        {\n            if ((*litr)->_fileName==fileName)\n            {\n                foundEntry = true;\n                ++((*litr)->_numOfRequests);\n            }\n        }        \n\n    _fileLoadedListMutex.unlock();\n\n    if (!foundEntry)\n    {\n    \n        _fileRequestListMutex.lock();\n\n            \/\/ search to see if entry already  in file request list.\n            bool foundEntry = false;\n            for(DatabaseRequestList::iterator ritr = _fileRequestList.begin();\n                ritr != _fileRequestList.end() && !foundEntry;\n                ++ritr)\n            {\n                if ((*ritr)->_fileName==fileName)\n                {\n                    foundEntry = true;\n                    ++((*ritr)->_numOfRequests);\n                }\n            }        \n\n            if (!foundEntry)\n            {\n                osg::ref_ptr<DatabaseRequest> databaseRequest = new DatabaseRequest;\n\n                databaseRequest->_fileName = fileName;\n                databaseRequest->_groupForAddingLoadedSubgraph = group;\n\n                _fileRequestList.push_back(databaseRequest);\n            }\n\n        _fileRequestListMutex.unlock();\n    }\n    \n    if (!threadIsRunning())\n    {\n        std::cout<<\"DatabasePager::startThread()\"<<std::endl;\n        startThread();\n    }\n}\n\nvoid DatabasePager::run()\n{\n    std::cout<<\"DatabasePager::run()\"<<std::endl;\n    \n    while(true)\n    {\n        osg::ref_ptr<DatabaseRequest> databaseRequest;\n    \n        \/\/ get the front of the file request list.\n        _fileRequestListMutex.lock();\n            if (!_fileRequestList.empty()) databaseRequest = _fileRequestList.front();\n        _fileRequestListMutex.unlock();\n        \n        if (databaseRequest.valid())\n        {\n            \/\/ load the data, note safe to write to the databaseRequest since once \n            \/\/ it is created this thread is the only one to write to the _loadedModel pointer.\n            databaseRequest->_loadedModel = osgDB::readNodeFile(databaseRequest->_fileName);\n\n            _fileRequestListMutex.lock();\n                _fileRequestList.erase(_fileRequestList.begin());\n            _fileRequestListMutex.unlock();\n\n            if (databaseRequest->_loadedModel.valid())\n            {\n                _fileLoadedListMutex.lock();\n\n                    _fileLoadedList.push_back(databaseRequest);\n\n                _fileLoadedListMutex.unlock();\n            }        \n        }\n        \n        \/\/ hack hack hack... sleep for 1ms so we give other threads a chance..\n        #ifdef WIN32\n            Sleep(1);\n        #else\n            usleep(1000);\n        #endif\n    }\n    \n    cancel();\n    join();   \n}\n\nvoid DatabasePager::addLoadedDataToSceneGraph()\n{\n    DatabaseRequestList localFileLoadedList;\n\n    \/\/ get the dat for the _fileLoadedList, leaving it empty via a std::vector<>.swap.\n    _fileLoadedListMutex.lock();\n        localFileLoadedList.swap(_fileLoadedList);\n    _fileLoadedListMutex.unlock();\n    \n    \/\/ add the loaded data into the scene graph.\n    for(DatabaseRequestList::iterator itr=localFileLoadedList.begin();\n        itr!=localFileLoadedList.end();\n        ++itr)\n    {\n        DatabaseRequest* databaseRequest = itr->get();\n        registerPagedLODs(databaseRequest->_loadedModel.get());\n        databaseRequest->_groupForAddingLoadedSubgraph->addChild(databaseRequest->_loadedModel.get());\n        \/\/std::cout<<\"merged subgraph\"<<databaseRequest->_fileName<<\" after \"<<databaseRequest->_numOfRequests<<\" requests.\"<<std::endl;\n\n    }\n    \n}\n\nvoid DatabasePager::removeExpiredSubgraphs(double currentFrameTime)\n{\n    double expiryTime = currentFrameTime - _expiryDelay;\n\n    \/\/std::cout<<\"DatabasePager::removeExpiredSubgraphs(\"<<expiryTime<<\") \"<<std::endl;\n    for(PagedLODList::iterator itr=_pagedLODList.begin();\n        itr!=_pagedLODList.end();\n        ++itr)\n    {\n        osg::PagedLOD* plod = itr->get();\n        plod->removeExpiredChildren(expiryTime);\n    }\n    \n    for(unsigned int i=_pagedLODList.size();\n        i>0;\n        )\n    {\n        --i;\n        \n        osg::PagedLOD* plod = _pagedLODList[i].get();\n        if (plod->referenceCount()==1)\n        {\n            \/\/std::cout<<\"    PagedLOD \"<<plod<<\" orphaned\"<<std::endl;\n            _pagedLODList.erase(_pagedLODList.begin()+i);\n        }\n        else\n        {\n            \/\/std::cout<<\"    PagedLOD \"<<plod<<\" refcount \"<<plod->referenceCount()<<std::endl;\n        }\n    }\n        \n    \n}\n\n\nclass FindPagedLODsVisitor : public osg::NodeVisitor\n{\npublic:\n    FindPagedLODsVisitor(DatabasePager::PagedLODList& pagedLODList):\n        osg::NodeVisitor(osg::NodeVisitor::TRAVERSE_ALL_CHILDREN),\n        _pagedLODList(pagedLODList)\n    {\n    }\n    \n    virtual void apply(osg::PagedLOD& plod)\n    {\n        _pagedLODList.push_back(&plod);\n    \n        traverse(plod);\n    }\n    \n    DatabasePager::PagedLODList& _pagedLODList;\n};\n\nvoid DatabasePager::registerPagedLODs(osg::Node* subgraph)\n{\n    FindPagedLODsVisitor fplv(_pagedLODList);\n    if (subgraph) subgraph->accept(fplv);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/** Copyright 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016 Roland Olbricht et al.\n * \n * This file is part of Overpass_API.\n *\n * Overpass_API 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 * Overpass_API is distributed in the hope that it will be 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 Overpass_API.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"datatypes.h\"\n#include \"settings.h\"\n\n#include \"..\/..\/template_db\/file_blocks.h\"\n#include \"..\/..\/template_db\/file_blocks_index.h\"\n#include \"..\/..\/template_db\/random_file_index.h\"\n\n#include <cstdio>\n#include <fstream>\n#include <map>\n#include <sstream>\n#include <string>\n#include <vector>\n#include <sys\/types.h>\n#include <unistd.h>\n\n\n#include <iostream>\ntemplate < typename TVal >\nstruct OSM_File_Properties : public File_Properties\n{\n  OSM_File_Properties(const std::string& file_base_name_, uint32 block_size_,\n\t\t      uint32 map_block_size_)\n    : file_base_name(file_base_name_), block_size(block_size_), map_block_size(map_block_size_) {}\n  \n  const std::string& get_file_name_trunk() const { return file_base_name; }\n  \n  const std::string& get_index_suffix() const { return basic_settings().INDEX_SUFFIX; }\n  const std::string& get_data_suffix() const { return basic_settings().DATA_SUFFIX; }\n  const std::string& get_id_suffix() const { return basic_settings().ID_SUFFIX; }  \n  const std::string& get_shadow_suffix() const { return basic_settings().SHADOW_SUFFIX; }\n  \n  uint32 get_block_size() const { return block_size\/8; }\n  uint32 get_compression_factor() const { return 8; }\n  uint32 get_compression_method() const { return basic_settings().compression_method; }\n  uint32 get_map_block_size() const { return map_block_size\/8; }\n  uint32 get_map_compression_factor() const { return 8; }\n  uint32 get_map_compression_method() const { return basic_settings().map_compression_method; }\n\n  std::vector< bool > get_data_footprint(const std::string& db_dir) const\n  {\n    std::vector< bool > temp = get_data_index_footprint< TVal >(*this, db_dir);\n    return temp;\n  }\n\n  std::vector< bool > get_map_footprint(const std::string& db_dir) const\n  {\n    return get_map_index_footprint(*this, db_dir);\n  }\n\n  uint32 id_max_size_of() const\n  {\n    return TVal::max_size_of();\n  }\n\n  File_Blocks_Index_Base* new_data_index\n      (bool writeable, bool use_shadow, const std::string& db_dir, const std::string& file_name_extension)\n      const\n  {\n    return new File_Blocks_Index< TVal >\n        (*this, writeable, use_shadow, db_dir, file_name_extension);\n  }\n\n  std::string file_base_name;\n  uint32 block_size;\n  uint32 map_block_size;\n};\n\n\n\/\/-----------------------------------------------------------------------------\n\nBasic_Settings::Basic_Settings()\n:\n  DATA_SUFFIX(\".bin\"),\n  INDEX_SUFFIX(\".idx\"),\n  ID_SUFFIX(\".map\"),\n  SHADOW_SUFFIX(\".shadow\"),\n\n  base_directory(\".\/\"),\n  logfile_name(\"transactions.log\"),\n  shared_name_base(\"\/osm3s_v0.7.54\"),\n  version(\"0.7.54.7\"),\n  source_hash(\"a817baa1d789cbb21926f7af5e883bcac31dff2c\"),\n#ifdef HAVE_LZ4\n  compression_method(File_Blocks_Index< Uint31_Index >::LZ4_COMPRESSION),\n#else\n  compression_method(File_Blocks_Index< Uint31_Index >::ZLIB_COMPRESSION),\n#endif\n  map_compression_method(File_Blocks_Index< Uint31_Index >::NO_COMPRESSION)\n{}\n\nBasic_Settings& basic_settings()\n{\n  static Basic_Settings obj;\n  return obj;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nOsm_Base_Settings::Osm_Base_Settings()\n:\n  NODES(new OSM_File_Properties< Uint32_Index >(\"nodes\", 512*1024, 256*1024)),\n  NODE_TAGS_LOCAL(new OSM_File_Properties< Tag_Index_Local >\n      (\"node_tags_local\", 512*1024, 0)),\n  NODE_TAGS_GLOBAL(new OSM_File_Properties< Tag_Index_Global >\n      (\"node_tags_global\", 512*1024, 0)),\n  NODE_KEYS(new OSM_File_Properties< Uint32_Index >\n      (\"node_keys\", 512*1024, 0)),\n\n  WAYS(new OSM_File_Properties< Uint31_Index >(\"ways\", 512*1024, 256*1024)),\n  WAY_TAGS_LOCAL(new OSM_File_Properties< Tag_Index_Local >\n      (\"way_tags_local\", 512*1024, 0)),\n  WAY_TAGS_GLOBAL(new OSM_File_Properties< Tag_Index_Global >\n      (\"way_tags_global\", 512*1024, 0)),\n  WAY_KEYS(new OSM_File_Properties< Uint32_Index >\n      (\"way_keys\", 512*1024, 0)),\n\n  RELATIONS(new OSM_File_Properties< Uint31_Index >(\"relations\", 1024*1024, 256*1024)),\n  RELATION_ROLES(new OSM_File_Properties< Uint32_Index >\n      (\"relation_roles\", 512*1024, 0)),\n  RELATION_TAGS_LOCAL(new OSM_File_Properties< Tag_Index_Local >\n      (\"relation_tags_local\", 512*1024, 0)),\n  RELATION_TAGS_GLOBAL(new OSM_File_Properties< Tag_Index_Global >\n      (\"relation_tags_global\", 512*1024, 0)),\n  RELATION_KEYS(new OSM_File_Properties< Uint32_Index >\n      (\"relation_keys\", 512*1024, 0)),\n\n  shared_name(basic_settings().shared_name_base + \"_osm_base\"),\n  max_num_processes(20),\n  purge_timeout(900),\n  total_available_space(12ll*1024*1024*1024),\n  total_available_time_units(256*1024)\n{}\n\nconst Osm_Base_Settings& osm_base_settings()\n{\n  static Osm_Base_Settings obj;\n  return obj;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nArea_Settings::Area_Settings()\n:\n  AREA_BLOCKS(new OSM_File_Properties< Uint31_Index >\n      (\"area_blocks\", 512*1024, 64*1024)),\n  AREAS(new OSM_File_Properties< Uint31_Index >(\"areas\", 2*1024*1024, 256*1024)),\n  AREA_TAGS_LOCAL(new OSM_File_Properties< Tag_Index_Local >\n      (\"area_tags_local\", 256*1024, 0)),\n  AREA_TAGS_GLOBAL(new OSM_File_Properties< Tag_Index_Global >\n      (\"area_tags_global\", 512*1024, 0)),\n\n  shared_name(basic_settings().shared_name_base + \"_areas\"),\n  max_num_processes(5),\n  purge_timeout(900),\n  total_available_space(4ll*1024*1024*1024),\n  total_available_time_units(256*1024)\n{}\n\nconst Area_Settings& area_settings()\n{\n  static Area_Settings obj;\n  return obj;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nMeta_Settings::Meta_Settings()\n:\n  USER_DATA(new OSM_File_Properties< Uint32_Index >\n      (\"user_data\", 512*1024, 0)),\n  USER_INDICES(new OSM_File_Properties< Uint32_Index >\n      (\"user_indices\", 512*1024, 0)),\n  NODES_META(new OSM_File_Properties< Uint31_Index >\n      (\"nodes_meta\", 512*1024, 0)),\n  WAYS_META(new OSM_File_Properties< Uint31_Index >\n      (\"ways_meta\", 512*1024, 0)),\n  RELATIONS_META(new OSM_File_Properties< Uint31_Index >\n      (\"relations_meta\", 512*1024, 0))\n{}\n\nconst Meta_Settings& meta_settings()\n{\n  static Meta_Settings obj;\n  return obj;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nAttic_Settings::Attic_Settings()\n:\n  NODES(new OSM_File_Properties< Uint31_Index >(\"nodes_attic\", 512*1024, 256*1024)),\n  NODES_UNDELETED(new OSM_File_Properties< Uint31_Index >(\"nodes_attic_undeleted\", 512*1024, 64*1024)),\n  NODE_IDX_LIST(new OSM_File_Properties< Node::Id_Type >\n      (\"node_attic_indexes\", 512*1024, 0)),\n  NODE_TAGS_LOCAL(new OSM_File_Properties< Tag_Index_Local >\n      (\"node_tags_local_attic\", 512*1024, 0)),\n  NODE_TAGS_GLOBAL(new OSM_File_Properties< Tag_Index_Global >\n      (\"node_tags_global_attic\", 2*1024*1024, 0)),\n  NODES_META(new OSM_File_Properties< Uint31_Index >\n      (\"nodes_meta_attic\", 512*1024, 0)),\n  NODE_CHANGELOG(new OSM_File_Properties< Timestamp >\n      (\"node_changelog\", 512*1024, 0)),\n\n  WAYS(new OSM_File_Properties< Uint31_Index >(\"ways_attic\", 512*1024, 256*1024)),\n  WAYS_UNDELETED(new OSM_File_Properties< Uint31_Index >(\"ways_attic_undeleted\", 512*1024, 64*1024)),\n  WAY_IDX_LIST(new OSM_File_Properties< Way::Id_Type >\n      (\"way_attic_indexes\", 512*1024, 0)),\n  WAY_TAGS_LOCAL(new OSM_File_Properties< Tag_Index_Local >\n      (\"way_tags_local_attic\", 512*1024, 0)),\n  WAY_TAGS_GLOBAL(new OSM_File_Properties< Tag_Index_Global >\n      (\"way_tags_global_attic\", 2*1024*1024, 0)),\n  WAYS_META(new OSM_File_Properties< Uint31_Index >\n      (\"ways_meta_attic\", 512*1024, 0)),\n  WAY_CHANGELOG(new OSM_File_Properties< Timestamp >\n      (\"way_changelog\", 512*1024, 0)),\n\n  RELATIONS(new OSM_File_Properties< Uint31_Index >(\"relations_attic\", 1024*1024, 256*1024)),\n  RELATIONS_UNDELETED(new OSM_File_Properties< Uint31_Index >(\"relations_attic_undeleted\", 512*1024, 64*1024)),\n  RELATION_IDX_LIST(new OSM_File_Properties< Relation::Id_Type >\n      (\"relation_attic_indexes\", 512*1024, 0)),\n  RELATION_TAGS_LOCAL(new OSM_File_Properties< Tag_Index_Local >\n      (\"relation_tags_local_attic\", 512*1024, 0)),\n  RELATION_TAGS_GLOBAL(new OSM_File_Properties< Tag_Index_Global >\n      (\"relation_tags_global_attic\", 2*1024*1024, 0)),\n  RELATIONS_META(new OSM_File_Properties< Uint31_Index >\n      (\"relations_meta_attic\", 512*1024, 0)),\n  RELATION_CHANGELOG(new OSM_File_Properties< Timestamp >\n      (\"relation_changelog\", 512*1024, 0))\n{}\n\nconst Attic_Settings& attic_settings()\n{\n  static Attic_Settings obj;\n  return obj;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nvoid show_mem_status()\n{\n  std::ostringstream proc_file_name_(\"\");\n  proc_file_name_<<\"\/proc\/\"<<getpid()<<\"\/stat\";\n  std::ifstream stat(proc_file_name_.str().c_str());\n  while (stat.good())\n  {\n    std::string line;\n    getline(stat, line);\n    std::cerr<<line;\n  }\n  std::cerr<<'\\n';\n}\n\n\/\/-----------------------------------------------------------------------------\n\nLogger::Logger(const std::string& db_dir)\n  : logfile_full_name(db_dir + basic_settings().logfile_name) {}\n\nvoid Logger::annotated_log(const std::string& message)\n{\n  \/\/ Collect current time in a user-readable form.\n  time_t time_t_ = time(0);\n  struct tm* tm_ = gmtime(&time_t_);\n  char strftime_buf[21];\n  strftime_buf[0] = 0;\n  if (tm_)\n    strftime(strftime_buf, 21, \"%F %H:%M:%S \", tm_);\n\n  std::ofstream out(logfile_full_name.c_str(), std::ios_base::app);\n  out<<strftime_buf<<'['<<getpid()<<\"] \"<<message<<'\\n';\n}\n\nvoid Logger::raw_log(const std::string& message)\n{\n  std::ofstream out(logfile_full_name.c_str(), std::ios_base::app);\n  out<<message<<'\\n';\n}\n\nconst std::string& get_logfile_name()\n{\n  return basic_settings().logfile_name;\n}\n\n\nconst uint64 NOW = std::numeric_limits< unsigned long long >::max();\n<commit_msg>Automated commit for release 0.7.54.8<commit_after>\/** Copyright 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016 Roland Olbricht et al.\n * \n * This file is part of Overpass_API.\n *\n * Overpass_API 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 * Overpass_API is distributed in the hope that it will be 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 Overpass_API.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"datatypes.h\"\n#include \"settings.h\"\n\n#include \"..\/..\/template_db\/file_blocks.h\"\n#include \"..\/..\/template_db\/file_blocks_index.h\"\n#include \"..\/..\/template_db\/random_file_index.h\"\n\n#include <cstdio>\n#include <fstream>\n#include <map>\n#include <sstream>\n#include <string>\n#include <vector>\n#include <sys\/types.h>\n#include <unistd.h>\n\n\n#include <iostream>\ntemplate < typename TVal >\nstruct OSM_File_Properties : public File_Properties\n{\n  OSM_File_Properties(const std::string& file_base_name_, uint32 block_size_,\n\t\t      uint32 map_block_size_)\n    : file_base_name(file_base_name_), block_size(block_size_), map_block_size(map_block_size_) {}\n  \n  const std::string& get_file_name_trunk() const { return file_base_name; }\n  \n  const std::string& get_index_suffix() const { return basic_settings().INDEX_SUFFIX; }\n  const std::string& get_data_suffix() const { return basic_settings().DATA_SUFFIX; }\n  const std::string& get_id_suffix() const { return basic_settings().ID_SUFFIX; }  \n  const std::string& get_shadow_suffix() const { return basic_settings().SHADOW_SUFFIX; }\n  \n  uint32 get_block_size() const { return block_size\/8; }\n  uint32 get_compression_factor() const { return 8; }\n  uint32 get_compression_method() const { return basic_settings().compression_method; }\n  uint32 get_map_block_size() const { return map_block_size\/8; }\n  uint32 get_map_compression_factor() const { return 8; }\n  uint32 get_map_compression_method() const { return basic_settings().map_compression_method; }\n\n  std::vector< bool > get_data_footprint(const std::string& db_dir) const\n  {\n    std::vector< bool > temp = get_data_index_footprint< TVal >(*this, db_dir);\n    return temp;\n  }\n\n  std::vector< bool > get_map_footprint(const std::string& db_dir) const\n  {\n    return get_map_index_footprint(*this, db_dir);\n  }\n\n  uint32 id_max_size_of() const\n  {\n    return TVal::max_size_of();\n  }\n\n  File_Blocks_Index_Base* new_data_index\n      (bool writeable, bool use_shadow, const std::string& db_dir, const std::string& file_name_extension)\n      const\n  {\n    return new File_Blocks_Index< TVal >\n        (*this, writeable, use_shadow, db_dir, file_name_extension);\n  }\n\n  std::string file_base_name;\n  uint32 block_size;\n  uint32 map_block_size;\n};\n\n\n\/\/-----------------------------------------------------------------------------\n\nBasic_Settings::Basic_Settings()\n:\n  DATA_SUFFIX(\".bin\"),\n  INDEX_SUFFIX(\".idx\"),\n  ID_SUFFIX(\".map\"),\n  SHADOW_SUFFIX(\".shadow\"),\n\n  base_directory(\".\/\"),\n  logfile_name(\"transactions.log\"),\n  shared_name_base(\"\/osm3s_v0.7.54\"),\n  version(\"0.7.54.8\"),\n  source_hash(\"79d24edd4aa3ae4d298ef9d6238f4fd65e8da375\"),\n#ifdef HAVE_LZ4\n  compression_method(File_Blocks_Index< Uint31_Index >::LZ4_COMPRESSION),\n#else\n  compression_method(File_Blocks_Index< Uint31_Index >::ZLIB_COMPRESSION),\n#endif\n  map_compression_method(File_Blocks_Index< Uint31_Index >::NO_COMPRESSION)\n{}\n\nBasic_Settings& basic_settings()\n{\n  static Basic_Settings obj;\n  return obj;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nOsm_Base_Settings::Osm_Base_Settings()\n:\n  NODES(new OSM_File_Properties< Uint32_Index >(\"nodes\", 512*1024, 256*1024)),\n  NODE_TAGS_LOCAL(new OSM_File_Properties< Tag_Index_Local >\n      (\"node_tags_local\", 512*1024, 0)),\n  NODE_TAGS_GLOBAL(new OSM_File_Properties< Tag_Index_Global >\n      (\"node_tags_global\", 512*1024, 0)),\n  NODE_KEYS(new OSM_File_Properties< Uint32_Index >\n      (\"node_keys\", 512*1024, 0)),\n\n  WAYS(new OSM_File_Properties< Uint31_Index >(\"ways\", 512*1024, 256*1024)),\n  WAY_TAGS_LOCAL(new OSM_File_Properties< Tag_Index_Local >\n      (\"way_tags_local\", 512*1024, 0)),\n  WAY_TAGS_GLOBAL(new OSM_File_Properties< Tag_Index_Global >\n      (\"way_tags_global\", 512*1024, 0)),\n  WAY_KEYS(new OSM_File_Properties< Uint32_Index >\n      (\"way_keys\", 512*1024, 0)),\n\n  RELATIONS(new OSM_File_Properties< Uint31_Index >(\"relations\", 1024*1024, 256*1024)),\n  RELATION_ROLES(new OSM_File_Properties< Uint32_Index >\n      (\"relation_roles\", 512*1024, 0)),\n  RELATION_TAGS_LOCAL(new OSM_File_Properties< Tag_Index_Local >\n      (\"relation_tags_local\", 512*1024, 0)),\n  RELATION_TAGS_GLOBAL(new OSM_File_Properties< Tag_Index_Global >\n      (\"relation_tags_global\", 512*1024, 0)),\n  RELATION_KEYS(new OSM_File_Properties< Uint32_Index >\n      (\"relation_keys\", 512*1024, 0)),\n\n  shared_name(basic_settings().shared_name_base + \"_osm_base\"),\n  max_num_processes(20),\n  purge_timeout(900),\n  total_available_space(12ll*1024*1024*1024),\n  total_available_time_units(256*1024)\n{}\n\nconst Osm_Base_Settings& osm_base_settings()\n{\n  static Osm_Base_Settings obj;\n  return obj;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nArea_Settings::Area_Settings()\n:\n  AREA_BLOCKS(new OSM_File_Properties< Uint31_Index >\n      (\"area_blocks\", 512*1024, 64*1024)),\n  AREAS(new OSM_File_Properties< Uint31_Index >(\"areas\", 2*1024*1024, 256*1024)),\n  AREA_TAGS_LOCAL(new OSM_File_Properties< Tag_Index_Local >\n      (\"area_tags_local\", 256*1024, 0)),\n  AREA_TAGS_GLOBAL(new OSM_File_Properties< Tag_Index_Global >\n      (\"area_tags_global\", 512*1024, 0)),\n\n  shared_name(basic_settings().shared_name_base + \"_areas\"),\n  max_num_processes(5),\n  purge_timeout(900),\n  total_available_space(4ll*1024*1024*1024),\n  total_available_time_units(256*1024)\n{}\n\nconst Area_Settings& area_settings()\n{\n  static Area_Settings obj;\n  return obj;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nMeta_Settings::Meta_Settings()\n:\n  USER_DATA(new OSM_File_Properties< Uint32_Index >\n      (\"user_data\", 512*1024, 0)),\n  USER_INDICES(new OSM_File_Properties< Uint32_Index >\n      (\"user_indices\", 512*1024, 0)),\n  NODES_META(new OSM_File_Properties< Uint31_Index >\n      (\"nodes_meta\", 512*1024, 0)),\n  WAYS_META(new OSM_File_Properties< Uint31_Index >\n      (\"ways_meta\", 512*1024, 0)),\n  RELATIONS_META(new OSM_File_Properties< Uint31_Index >\n      (\"relations_meta\", 512*1024, 0))\n{}\n\nconst Meta_Settings& meta_settings()\n{\n  static Meta_Settings obj;\n  return obj;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nAttic_Settings::Attic_Settings()\n:\n  NODES(new OSM_File_Properties< Uint31_Index >(\"nodes_attic\", 512*1024, 256*1024)),\n  NODES_UNDELETED(new OSM_File_Properties< Uint31_Index >(\"nodes_attic_undeleted\", 512*1024, 64*1024)),\n  NODE_IDX_LIST(new OSM_File_Properties< Node::Id_Type >\n      (\"node_attic_indexes\", 512*1024, 0)),\n  NODE_TAGS_LOCAL(new OSM_File_Properties< Tag_Index_Local >\n      (\"node_tags_local_attic\", 512*1024, 0)),\n  NODE_TAGS_GLOBAL(new OSM_File_Properties< Tag_Index_Global >\n      (\"node_tags_global_attic\", 2*1024*1024, 0)),\n  NODES_META(new OSM_File_Properties< Uint31_Index >\n      (\"nodes_meta_attic\", 512*1024, 0)),\n  NODE_CHANGELOG(new OSM_File_Properties< Timestamp >\n      (\"node_changelog\", 512*1024, 0)),\n\n  WAYS(new OSM_File_Properties< Uint31_Index >(\"ways_attic\", 512*1024, 256*1024)),\n  WAYS_UNDELETED(new OSM_File_Properties< Uint31_Index >(\"ways_attic_undeleted\", 512*1024, 64*1024)),\n  WAY_IDX_LIST(new OSM_File_Properties< Way::Id_Type >\n      (\"way_attic_indexes\", 512*1024, 0)),\n  WAY_TAGS_LOCAL(new OSM_File_Properties< Tag_Index_Local >\n      (\"way_tags_local_attic\", 512*1024, 0)),\n  WAY_TAGS_GLOBAL(new OSM_File_Properties< Tag_Index_Global >\n      (\"way_tags_global_attic\", 2*1024*1024, 0)),\n  WAYS_META(new OSM_File_Properties< Uint31_Index >\n      (\"ways_meta_attic\", 512*1024, 0)),\n  WAY_CHANGELOG(new OSM_File_Properties< Timestamp >\n      (\"way_changelog\", 512*1024, 0)),\n\n  RELATIONS(new OSM_File_Properties< Uint31_Index >(\"relations_attic\", 1024*1024, 256*1024)),\n  RELATIONS_UNDELETED(new OSM_File_Properties< Uint31_Index >(\"relations_attic_undeleted\", 512*1024, 64*1024)),\n  RELATION_IDX_LIST(new OSM_File_Properties< Relation::Id_Type >\n      (\"relation_attic_indexes\", 512*1024, 0)),\n  RELATION_TAGS_LOCAL(new OSM_File_Properties< Tag_Index_Local >\n      (\"relation_tags_local_attic\", 512*1024, 0)),\n  RELATION_TAGS_GLOBAL(new OSM_File_Properties< Tag_Index_Global >\n      (\"relation_tags_global_attic\", 2*1024*1024, 0)),\n  RELATIONS_META(new OSM_File_Properties< Uint31_Index >\n      (\"relations_meta_attic\", 512*1024, 0)),\n  RELATION_CHANGELOG(new OSM_File_Properties< Timestamp >\n      (\"relation_changelog\", 512*1024, 0))\n{}\n\nconst Attic_Settings& attic_settings()\n{\n  static Attic_Settings obj;\n  return obj;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nvoid show_mem_status()\n{\n  std::ostringstream proc_file_name_(\"\");\n  proc_file_name_<<\"\/proc\/\"<<getpid()<<\"\/stat\";\n  std::ifstream stat(proc_file_name_.str().c_str());\n  while (stat.good())\n  {\n    std::string line;\n    getline(stat, line);\n    std::cerr<<line;\n  }\n  std::cerr<<'\\n';\n}\n\n\/\/-----------------------------------------------------------------------------\n\nLogger::Logger(const std::string& db_dir)\n  : logfile_full_name(db_dir + basic_settings().logfile_name) {}\n\nvoid Logger::annotated_log(const std::string& message)\n{\n  \/\/ Collect current time in a user-readable form.\n  time_t time_t_ = time(0);\n  struct tm* tm_ = gmtime(&time_t_);\n  char strftime_buf[21];\n  strftime_buf[0] = 0;\n  if (tm_)\n    strftime(strftime_buf, 21, \"%F %H:%M:%S \", tm_);\n\n  std::ofstream out(logfile_full_name.c_str(), std::ios_base::app);\n  out<<strftime_buf<<'['<<getpid()<<\"] \"<<message<<'\\n';\n}\n\nvoid Logger::raw_log(const std::string& message)\n{\n  std::ofstream out(logfile_full_name.c_str(), std::ios_base::app);\n  out<<message<<'\\n';\n}\n\nconst std::string& get_logfile_name()\n{\n  return basic_settings().logfile_name;\n}\n\n\nconst uint64 NOW = std::numeric_limits< unsigned long long >::max();\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 \"qgstreamerrecordercontrol.h\"\n#include \"qgstreameraudioencode.h\"\n#include \"qgstreamervideoencode.h\"\n#include \"qgstreamermediacontainercontrol.h\"\n#include <QtCore\/QDebug>\n\nQGstreamerRecorderControl::QGstreamerRecorderControl(QGstreamerCaptureSession *session)\n    :QMediaRecorderControl(session), m_session(session), m_state(QMediaRecorder::StoppedState)\n{\n    connect(m_session, SIGNAL(stateChanged(QGstreamerCaptureSession::State)), SLOT(updateState()));\n    connect(m_session, SIGNAL(error(int,QString)), SIGNAL(error(int,QString)));\n    connect(m_session, SIGNAL(durationChanged(qint64)), SIGNAL(durationChanged(qint64)));\n    m_hasPreviewState = m_session->captureMode() != QGstreamerCaptureSession::Audio;\n}\n\nQGstreamerRecorderControl::~QGstreamerRecorderControl()\n{\n}\n\nQUrl QGstreamerRecorderControl::outputLocation() const\n{\n    return m_session->outputLocation();\n}\n\nbool QGstreamerRecorderControl::setOutputLocation(const QUrl &sink)\n{\n    m_session->setOutputLocation(sink);\n    return true;\n}\n\n\nQMediaRecorder::State QGstreamerRecorderControl::state() const\n{\n    switch ( m_session->state() ) {\n        case QGstreamerCaptureSession::RecordingState:\n            return QMediaRecorder::RecordingState;\n        case QGstreamerCaptureSession::PausedState:\n            return QMediaRecorder::PausedState;\n        case QGstreamerCaptureSession::PreviewState:\n        case QGstreamerCaptureSession::StoppedState:\n            return QMediaRecorder::StoppedState;\n    }\n\n    return QMediaRecorder::StoppedState;\n\n}\n\nvoid QGstreamerRecorderControl::updateState()\n{\n    QMediaRecorder::State newState = state();\n    if (m_state != newState) {\n        m_state = newState;\n        emit stateChanged(m_state);\n    }\n}\n\nqint64 QGstreamerRecorderControl::duration() const\n{\n    return m_session->duration();\n}\n\nvoid QGstreamerRecorderControl::record()\n{\n    m_session->dumpGraph(\"before-record\");\n    if (!m_hasPreviewState || m_session->state() != QGstreamerCaptureSession::StoppedState) {\n        m_session->setState(QGstreamerCaptureSession::RecordingState);\n    } else\n        emit error(QMediaRecorder::ResourceError, tr(\"Service has not been started\"));\n\n    m_session->dumpGraph(\"after-record\");\n}\n\nvoid QGstreamerRecorderControl::pause()\n{\n    m_session->dumpGraph(\"before-pause\");\n    if (!m_hasPreviewState || m_session->state() != QGstreamerCaptureSession::StoppedState) {\n        m_session->setState(QGstreamerCaptureSession::PausedState);\n    } else\n        emit error(QMediaRecorder::ResourceError, tr(\"Service has not been started\"));\n}\n\nvoid QGstreamerRecorderControl::stop()\n{\n    if (!m_hasPreviewState) {\n        m_session->setState(QGstreamerCaptureSession::StoppedState);\n    } else {\n        if (m_session->state() != QGstreamerCaptureSession::StoppedState)\n            m_session->setState(QGstreamerCaptureSession::PreviewState);\n    }\n}\n\nvoid QGstreamerRecorderControl::applySettings()\n{\n    \/\/Check the codecs are compatible with container,\n    \/\/and choose the compatible codecs\/container if omitted\n    QGstreamerAudioEncode *audioEncodeControl = m_session->audioEncodeControl();\n    QGstreamerVideoEncode *videoEncodeControl = m_session->videoEncodeControl();\n    QGstreamerMediaContainerControl *mediaContainerControl = m_session->mediaContainerControl();\n\n    bool needAudio = m_session->captureMode() & QGstreamerCaptureSession::Audio;\n    bool needVideo = m_session->captureMode() & QGstreamerCaptureSession::Audio;\n\n    QStringList containerCandidates;\n    if (mediaContainerControl->containerMimeType().isEmpty())\n        containerCandidates = mediaContainerControl->supportedContainers();\n    else\n        containerCandidates << mediaContainerControl->containerMimeType();\n\n\n    QStringList audioCandidates;\n    if (needAudio) {\n        QAudioEncoderSettings audioSettings = audioEncodeControl->audioSettings();\n        if (audioSettings.codec().isEmpty())\n            audioCandidates = audioEncodeControl->supportedAudioCodecs();\n        else\n            audioCandidates << audioSettings.codec();\n    }\n\n    QStringList videoCandidates;\n    if (needVideo) {\n        QVideoEncoderSettings videoSettings = videoEncodeControl->videoSettings();\n        if (videoSettings.codec().isEmpty())\n            videoCandidates = videoEncodeControl->supportedVideoCodecs();\n        else\n            videoCandidates << videoSettings.codec();\n    }\n\n    QString container;\n    QString audioCodec;\n    QString videoCodec;\n\n    foreach (const QString &containerCandidate, containerCandidates) {\n        QSet<QString> supportedTypes = mediaContainerControl->supportedStreamTypes(containerCandidate);\n\n        audioCodec.clear();\n        videoCodec.clear();\n\n        if (needAudio) {\n            bool found = false;\n            foreach (const QString &audioCandidate, audioCandidates) {\n                QSet<QString> audioTypes = audioEncodeControl->supportedStreamTypes(audioCandidate);\n                if (!audioTypes.intersect(supportedTypes).isEmpty()) {\n                    found = true;\n                    audioCodec = audioCandidate;\n                    break;\n                }\n            }\n            if (!found)\n                continue;\n        }\n\n        if (needVideo) {\n            bool found = false;\n            foreach (const QString &videoCandidate, videoCandidates) {\n                QSet<QString> videoTypes = videoEncodeControl->supportedStreamTypes(videoCandidate);\n                if (!videoTypes.intersect(supportedTypes).isEmpty()) {\n                    found = true;\n                    videoCodec = videoCandidate;\n                    break;\n                }\n            }\n            if (!found)\n                continue;\n        }\n\n        container = containerCandidate;\n        break;\n    }\n\n    if (container.isEmpty()) {\n        emit error(QMediaRecorder::FormatError, tr(\"Not compatible codecs and container format.\"));\n    } else {\n        mediaContainerControl->setContainerMimeType(container);\n\n        if (needAudio) {\n            QAudioEncoderSettings audioSettings = audioEncodeControl->audioSettings();\n            audioSettings.setCodec(audioCodec);\n            audioEncodeControl->setAudioSettings(audioSettings);\n        }\n\n        if (needVideo) {\n            QVideoEncoderSettings videoSettings = videoEncodeControl->videoSettings();\n            videoSettings.setCodec(videoCodec);\n            videoEncodeControl->setVideoSettings(videoSettings);\n        }\n    }\n}\n<commit_msg>fixed typo<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 \"qgstreamerrecordercontrol.h\"\n#include \"qgstreameraudioencode.h\"\n#include \"qgstreamervideoencode.h\"\n#include \"qgstreamermediacontainercontrol.h\"\n#include <QtCore\/QDebug>\n\nQGstreamerRecorderControl::QGstreamerRecorderControl(QGstreamerCaptureSession *session)\n    :QMediaRecorderControl(session), m_session(session), m_state(QMediaRecorder::StoppedState)\n{\n    connect(m_session, SIGNAL(stateChanged(QGstreamerCaptureSession::State)), SLOT(updateState()));\n    connect(m_session, SIGNAL(error(int,QString)), SIGNAL(error(int,QString)));\n    connect(m_session, SIGNAL(durationChanged(qint64)), SIGNAL(durationChanged(qint64)));\n    m_hasPreviewState = m_session->captureMode() != QGstreamerCaptureSession::Audio;\n}\n\nQGstreamerRecorderControl::~QGstreamerRecorderControl()\n{\n}\n\nQUrl QGstreamerRecorderControl::outputLocation() const\n{\n    return m_session->outputLocation();\n}\n\nbool QGstreamerRecorderControl::setOutputLocation(const QUrl &sink)\n{\n    m_session->setOutputLocation(sink);\n    return true;\n}\n\n\nQMediaRecorder::State QGstreamerRecorderControl::state() const\n{\n    switch ( m_session->state() ) {\n        case QGstreamerCaptureSession::RecordingState:\n            return QMediaRecorder::RecordingState;\n        case QGstreamerCaptureSession::PausedState:\n            return QMediaRecorder::PausedState;\n        case QGstreamerCaptureSession::PreviewState:\n        case QGstreamerCaptureSession::StoppedState:\n            return QMediaRecorder::StoppedState;\n    }\n\n    return QMediaRecorder::StoppedState;\n\n}\n\nvoid QGstreamerRecorderControl::updateState()\n{\n    QMediaRecorder::State newState = state();\n    if (m_state != newState) {\n        m_state = newState;\n        emit stateChanged(m_state);\n    }\n}\n\nqint64 QGstreamerRecorderControl::duration() const\n{\n    return m_session->duration();\n}\n\nvoid QGstreamerRecorderControl::record()\n{\n    m_session->dumpGraph(\"before-record\");\n    if (!m_hasPreviewState || m_session->state() != QGstreamerCaptureSession::StoppedState) {\n        m_session->setState(QGstreamerCaptureSession::RecordingState);\n    } else\n        emit error(QMediaRecorder::ResourceError, tr(\"Service has not been started\"));\n\n    m_session->dumpGraph(\"after-record\");\n}\n\nvoid QGstreamerRecorderControl::pause()\n{\n    m_session->dumpGraph(\"before-pause\");\n    if (!m_hasPreviewState || m_session->state() != QGstreamerCaptureSession::StoppedState) {\n        m_session->setState(QGstreamerCaptureSession::PausedState);\n    } else\n        emit error(QMediaRecorder::ResourceError, tr(\"Service has not been started\"));\n}\n\nvoid QGstreamerRecorderControl::stop()\n{\n    if (!m_hasPreviewState) {\n        m_session->setState(QGstreamerCaptureSession::StoppedState);\n    } else {\n        if (m_session->state() != QGstreamerCaptureSession::StoppedState)\n            m_session->setState(QGstreamerCaptureSession::PreviewState);\n    }\n}\n\nvoid QGstreamerRecorderControl::applySettings()\n{\n    \/\/Check the codecs are compatible with container,\n    \/\/and choose the compatible codecs\/container if omitted\n    QGstreamerAudioEncode *audioEncodeControl = m_session->audioEncodeControl();\n    QGstreamerVideoEncode *videoEncodeControl = m_session->videoEncodeControl();\n    QGstreamerMediaContainerControl *mediaContainerControl = m_session->mediaContainerControl();\n\n    bool needAudio = m_session->captureMode() & QGstreamerCaptureSession::Audio;\n    bool needVideo = m_session->captureMode() & QGstreamerCaptureSession::Video;\n\n    QStringList containerCandidates;\n    if (mediaContainerControl->containerMimeType().isEmpty())\n        containerCandidates = mediaContainerControl->supportedContainers();\n    else\n        containerCandidates << mediaContainerControl->containerMimeType();\n\n\n    QStringList audioCandidates;\n    if (needAudio) {\n        QAudioEncoderSettings audioSettings = audioEncodeControl->audioSettings();\n        if (audioSettings.codec().isEmpty())\n            audioCandidates = audioEncodeControl->supportedAudioCodecs();\n        else\n            audioCandidates << audioSettings.codec();\n    }\n\n    QStringList videoCandidates;\n    if (needVideo) {\n        QVideoEncoderSettings videoSettings = videoEncodeControl->videoSettings();\n        if (videoSettings.codec().isEmpty())\n            videoCandidates = videoEncodeControl->supportedVideoCodecs();\n        else\n            videoCandidates << videoSettings.codec();\n    }\n\n    QString container;\n    QString audioCodec;\n    QString videoCodec;\n\n    foreach (const QString &containerCandidate, containerCandidates) {\n        QSet<QString> supportedTypes = mediaContainerControl->supportedStreamTypes(containerCandidate);\n\n        audioCodec.clear();\n        videoCodec.clear();\n\n        if (needAudio) {\n            bool found = false;\n            foreach (const QString &audioCandidate, audioCandidates) {\n                QSet<QString> audioTypes = audioEncodeControl->supportedStreamTypes(audioCandidate);\n                if (!audioTypes.intersect(supportedTypes).isEmpty()) {\n                    found = true;\n                    audioCodec = audioCandidate;\n                    break;\n                }\n            }\n            if (!found)\n                continue;\n        }\n\n        if (needVideo) {\n            bool found = false;\n            foreach (const QString &videoCandidate, videoCandidates) {\n                QSet<QString> videoTypes = videoEncodeControl->supportedStreamTypes(videoCandidate);\n                if (!videoTypes.intersect(supportedTypes).isEmpty()) {\n                    found = true;\n                    videoCodec = videoCandidate;\n                    break;\n                }\n            }\n            if (!found)\n                continue;\n        }\n\n        container = containerCandidate;\n        break;\n    }\n\n    if (container.isEmpty()) {\n        emit error(QMediaRecorder::FormatError, tr(\"Not compatible codecs and container format.\"));\n    } else {\n        mediaContainerControl->setContainerMimeType(container);\n\n        if (needAudio) {\n            QAudioEncoderSettings audioSettings = audioEncodeControl->audioSettings();\n            audioSettings.setCodec(audioCodec);\n            audioEncodeControl->setAudioSettings(audioSettings);\n        }\n\n        if (needVideo) {\n            QVideoEncoderSettings videoSettings = videoEncodeControl->videoSettings();\n            videoSettings.setCodec(videoCodec);\n            videoEncodeControl->setVideoSettings(videoSettings);\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"ppapi\/cpp\/instance.h\"\n\n#include \"ppapi\/c\/pp_errors.h\"\n#include \"ppapi\/c\/ppb_input_event.h\"\n#include \"ppapi\/c\/ppb_instance.h\"\n#include \"ppapi\/c\/ppb_messaging.h\"\n#include \"ppapi\/cpp\/graphics_2d.h\"\n#include \"ppapi\/cpp\/graphics_3d.h\"\n#include \"ppapi\/cpp\/image_data.h\"\n#include \"ppapi\/cpp\/instance_handle.h\"\n#include \"ppapi\/cpp\/logging.h\"\n#include \"ppapi\/cpp\/module.h\"\n#include \"ppapi\/cpp\/module_impl.h\"\n#include \"ppapi\/cpp\/point.h\"\n#include \"ppapi\/cpp\/resource.h\"\n#include \"ppapi\/cpp\/var.h\"\n#include \"ppapi\/cpp\/view.h\"\n\nnamespace pp {\n\nnamespace {\n\ntemplate <> const char* interface_name<PPB_InputEvent>() {\n  return PPB_INPUT_EVENT_INTERFACE;\n}\n\ntemplate <> const char* interface_name<PPB_Instance>() {\n  return PPB_INSTANCE_INTERFACE;\n}\n\ntemplate <> const char* interface_name<PPB_Messaging>() {\n  return PPB_MESSAGING_INTERFACE;\n}\n\n}  \/\/ namespace\n\nInstance::Instance(PP_Instance instance) : pp_instance_(instance) {\n}\n\nInstance::~Instance() {\n  \/\/ Ensure that all per-instance objects have been removed. Generally, these\n  \/\/ objects should have their lifetime scoped to the instance, such as being\n  \/\/ instance members or even implemented by your instance sub-class directly.\n  \/\/\n  \/\/ If they're not unregistered at this point, they will usually have a\n  \/\/ dangling reference to the instance, which can cause a crash later.\n  PP_DCHECK(interface_name_to_objects_.empty());\n}\n\nbool Instance::Init(uint32_t \/*argc*\/, const char* \/*argn*\/[],\n                    const char* \/*argv*\/[]) {\n  return true;\n}\n\nvoid Instance::DidChangeView(const View& view) {\n  \/\/ Call the deprecated version for source backwards-compat.\n  DidChangeView(view.GetRect(), view.GetClipRect());\n}\n\nvoid Instance::DidChangeView(const pp::Rect& \/*position*\/,\n                             const pp::Rect& \/*clip*\/) {\n}\n\nvoid Instance::DidChangeFocus(bool \/*has_focus*\/) {\n}\n\n\nbool Instance::HandleDocumentLoad(const URLLoader& \/*url_loader*\/) {\n  return false;\n}\n\nbool Instance::HandleInputEvent(const InputEvent& \/*event*\/) {\n  return false;\n}\n\nvoid Instance::HandleMessage(const Var& \/*message*\/) {\n  return;\n}\n\nbool Instance::BindGraphics(const Graphics2D& graphics) {\n  if (!has_interface<PPB_Instance>())\n    return false;\n  return PP_ToBool(get_interface<PPB_Instance>()->BindGraphics(\n      pp_instance(), graphics.pp_resource()));\n}\n\nbool Instance::BindGraphics(const Graphics3D& graphics) {\n  if (!has_interface<PPB_Instance>())\n    return false;\n  return PP_ToBool(get_interface<PPB_Instance>()->BindGraphics(\n      pp_instance(), graphics.pp_resource()));\n}\n\nbool Instance::IsFullFrame() {\n  if (!has_interface<PPB_Instance>())\n    return false;\n  return PP_ToBool(get_interface<PPB_Instance>()->IsFullFrame(pp_instance()));\n}\n\nint32_t Instance::RequestInputEvents(uint32_t event_classes) {\n  if (!has_interface<PPB_InputEvent>())\n    return PP_ERROR_NOINTERFACE;\n  return get_interface<PPB_InputEvent>()->RequestInputEvents(pp_instance(),\n                                                             event_classes);\n}\n\nint32_t Instance::RequestFilteringInputEvents(uint32_t event_classes) {\n  if (!has_interface<PPB_InputEvent>())\n    return PP_ERROR_NOINTERFACE;\n  return get_interface<PPB_InputEvent>()->RequestFilteringInputEvents(\n      pp_instance(), event_classes);\n}\n\nvoid Instance::ClearInputEventRequest(uint32_t event_classes) {\n  if (!has_interface<PPB_InputEvent>())\n    return;\n  get_interface<PPB_InputEvent>()->ClearInputEventRequest(pp_instance(),\n                                                          event_classes);\n}\n\nvoid Instance::PostMessage(const Var& message) {\n  if (!has_interface<PPB_Messaging>())\n    return;\n  get_interface<PPB_Messaging>()->PostMessage(pp_instance(),\n                                              message.pp_var());\n}\n\nvoid Instance::AddPerInstanceObject(const std::string& interface_name,\n                                    void* object) {\n  \/\/ Ensure we're not trying to register more than one object per interface\n  \/\/ type. Otherwise, we'll get confused in GetPerInstanceObject.\n  PP_DCHECK(interface_name_to_objects_.find(interface_name) ==\n            interface_name_to_objects_.end());\n  interface_name_to_objects_[interface_name] = object;\n}\n\nvoid Instance::RemovePerInstanceObject(const std::string& interface_name,\n                                       void* object) {\n  InterfaceNameToObjectMap::iterator found = interface_name_to_objects_.find(\n      interface_name);\n  if (found == interface_name_to_objects_.end()) {\n    \/\/ Attempting to unregister an object that doesn't exist or was already\n    \/\/ unregistered.\n    PP_DCHECK(false);\n    return;\n  }\n\n  \/\/ Validate that we're removing the object we thing we are.\n  PP_DCHECK(found->second == object);\n  (void)object;  \/\/ Prevent warning in release mode.\n\n  interface_name_to_objects_.erase(found);\n}\n\n\/\/ static\nvoid Instance::RemovePerInstanceObject(const InstanceHandle& instance,\n                                       const std::string& interface_name,\n                                       void* object) {\n  \/\/ TODO(brettw) assert we're on the main thread.\n  Instance* that = Module::Get()->InstanceForPPInstance(instance.pp_instance());\n  if (!that)\n    return;\n  that->RemovePerInstanceObject(interface_name, object);\n}\n\n\/\/ static\nvoid* Instance::GetPerInstanceObject(PP_Instance instance,\n                                     const std::string& interface_name) {\n  Instance* that = Module::Get()->InstanceForPPInstance(instance);\n  if (!that)\n    return NULL;\n  InterfaceNameToObjectMap::iterator found =\n      that->interface_name_to_objects_.find(interface_name);\n  if (found == that->interface_name_to_objects_.end())\n    return NULL;\n  return found->second;\n}\n\n}  \/\/ namespace pp\n<commit_msg>Remove assertion on instance destruction.<commit_after>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"ppapi\/cpp\/instance.h\"\n\n#include \"ppapi\/c\/pp_errors.h\"\n#include \"ppapi\/c\/ppb_input_event.h\"\n#include \"ppapi\/c\/ppb_instance.h\"\n#include \"ppapi\/c\/ppb_messaging.h\"\n#include \"ppapi\/cpp\/graphics_2d.h\"\n#include \"ppapi\/cpp\/graphics_3d.h\"\n#include \"ppapi\/cpp\/image_data.h\"\n#include \"ppapi\/cpp\/instance_handle.h\"\n#include \"ppapi\/cpp\/logging.h\"\n#include \"ppapi\/cpp\/module.h\"\n#include \"ppapi\/cpp\/module_impl.h\"\n#include \"ppapi\/cpp\/point.h\"\n#include \"ppapi\/cpp\/resource.h\"\n#include \"ppapi\/cpp\/var.h\"\n#include \"ppapi\/cpp\/view.h\"\n\nnamespace pp {\n\nnamespace {\n\ntemplate <> const char* interface_name<PPB_InputEvent>() {\n  return PPB_INPUT_EVENT_INTERFACE;\n}\n\ntemplate <> const char* interface_name<PPB_Instance>() {\n  return PPB_INSTANCE_INTERFACE;\n}\n\ntemplate <> const char* interface_name<PPB_Messaging>() {\n  return PPB_MESSAGING_INTERFACE;\n}\n\n}  \/\/ namespace\n\nInstance::Instance(PP_Instance instance) : pp_instance_(instance) {\n}\n\nInstance::~Instance() {\n}\n\nbool Instance::Init(uint32_t \/*argc*\/, const char* \/*argn*\/[],\n                    const char* \/*argv*\/[]) {\n  return true;\n}\n\nvoid Instance::DidChangeView(const View& view) {\n  \/\/ Call the deprecated version for source backwards-compat.\n  DidChangeView(view.GetRect(), view.GetClipRect());\n}\n\nvoid Instance::DidChangeView(const pp::Rect& \/*position*\/,\n                             const pp::Rect& \/*clip*\/) {\n}\n\nvoid Instance::DidChangeFocus(bool \/*has_focus*\/) {\n}\n\n\nbool Instance::HandleDocumentLoad(const URLLoader& \/*url_loader*\/) {\n  return false;\n}\n\nbool Instance::HandleInputEvent(const InputEvent& \/*event*\/) {\n  return false;\n}\n\nvoid Instance::HandleMessage(const Var& \/*message*\/) {\n  return;\n}\n\nbool Instance::BindGraphics(const Graphics2D& graphics) {\n  if (!has_interface<PPB_Instance>())\n    return false;\n  return PP_ToBool(get_interface<PPB_Instance>()->BindGraphics(\n      pp_instance(), graphics.pp_resource()));\n}\n\nbool Instance::BindGraphics(const Graphics3D& graphics) {\n  if (!has_interface<PPB_Instance>())\n    return false;\n  return PP_ToBool(get_interface<PPB_Instance>()->BindGraphics(\n      pp_instance(), graphics.pp_resource()));\n}\n\nbool Instance::IsFullFrame() {\n  if (!has_interface<PPB_Instance>())\n    return false;\n  return PP_ToBool(get_interface<PPB_Instance>()->IsFullFrame(pp_instance()));\n}\n\nint32_t Instance::RequestInputEvents(uint32_t event_classes) {\n  if (!has_interface<PPB_InputEvent>())\n    return PP_ERROR_NOINTERFACE;\n  return get_interface<PPB_InputEvent>()->RequestInputEvents(pp_instance(),\n                                                             event_classes);\n}\n\nint32_t Instance::RequestFilteringInputEvents(uint32_t event_classes) {\n  if (!has_interface<PPB_InputEvent>())\n    return PP_ERROR_NOINTERFACE;\n  return get_interface<PPB_InputEvent>()->RequestFilteringInputEvents(\n      pp_instance(), event_classes);\n}\n\nvoid Instance::ClearInputEventRequest(uint32_t event_classes) {\n  if (!has_interface<PPB_InputEvent>())\n    return;\n  get_interface<PPB_InputEvent>()->ClearInputEventRequest(pp_instance(),\n                                                          event_classes);\n}\n\nvoid Instance::PostMessage(const Var& message) {\n  if (!has_interface<PPB_Messaging>())\n    return;\n  get_interface<PPB_Messaging>()->PostMessage(pp_instance(),\n                                              message.pp_var());\n}\n\nvoid Instance::AddPerInstanceObject(const std::string& interface_name,\n                                    void* object) {\n  \/\/ Ensure we're not trying to register more than one object per interface\n  \/\/ type. Otherwise, we'll get confused in GetPerInstanceObject.\n  PP_DCHECK(interface_name_to_objects_.find(interface_name) ==\n            interface_name_to_objects_.end());\n  interface_name_to_objects_[interface_name] = object;\n}\n\nvoid Instance::RemovePerInstanceObject(const std::string& interface_name,\n                                       void* object) {\n  InterfaceNameToObjectMap::iterator found = interface_name_to_objects_.find(\n      interface_name);\n  if (found == interface_name_to_objects_.end()) {\n    \/\/ Attempting to unregister an object that doesn't exist or was already\n    \/\/ unregistered.\n    PP_DCHECK(false);\n    return;\n  }\n\n  \/\/ Validate that we're removing the object we thing we are.\n  PP_DCHECK(found->second == object);\n  (void)object;  \/\/ Prevent warning in release mode.\n\n  interface_name_to_objects_.erase(found);\n}\n\n\/\/ static\nvoid Instance::RemovePerInstanceObject(const InstanceHandle& instance,\n                                       const std::string& interface_name,\n                                       void* object) {\n  \/\/ TODO(brettw) assert we're on the main thread.\n  Instance* that = Module::Get()->InstanceForPPInstance(instance.pp_instance());\n  if (!that)\n    return;\n  that->RemovePerInstanceObject(interface_name, object);\n}\n\n\/\/ static\nvoid* Instance::GetPerInstanceObject(PP_Instance instance,\n                                     const std::string& interface_name) {\n  Instance* that = Module::Get()->InstanceForPPInstance(instance);\n  if (!that)\n    return NULL;\n  InterfaceNameToObjectMap::iterator found =\n      that->interface_name_to_objects_.find(interface_name);\n  if (found == that->interface_name_to_objects_.end())\n    return NULL;\n  return found->second;\n}\n\n}  \/\/ namespace pp\n<|endoftext|>"}
{"text":"<commit_before>#include \"map\/change_map.h\"\n\n#include \"logconsole.h\"\n#include \"entity_system.h\"\n#include \"cli_change_map_req.h\"\n#include \"srv_change_map_reply.h\"\n#include \"chat\/whisper_chat.h\"\n#include \"cmapclient.h\"\n\n#include \"components\/basic_info.h\"\n#include \"components\/client.h\"\n#include \"components\/destination.h\"\n#include \"components\/level.h\"\n#include \"components\/life.h\"\n#include \"components\/magic.h\"\n#include \"components\/position.h\"\n#include \"components\/warpgate.h\"\n#include \"isc_client_status.h\"\n\n#include <limits>\n\nusing namespace RoseCommon;\nusing namespace RoseCommon::Packet;\n\nvoid Map::change_map_request(EntitySystem& entitySystem, Entity entity, const CliChangeMapReq&) {\n    auto logger = Core::CLog::GetLogger(Core::log_type::GENERAL).lock();\n    logger->trace(\"Map::change_map_request\");\n    logger->trace(\"entity {}\", entity);\n    const auto& basicInfo = entitySystem.get_component<Component::BasicInfo>(entity);\n    const auto& life = entitySystem.get_component<Component::Life>(entity);\n    const auto& magic = entitySystem.get_component<Component::Magic>(entity);\n    const auto& level = entitySystem.get_component<Component::Level>(entity);\n    \/\/ force send the packet as the client isn't technically on the map yet\n    entitySystem.send_to(entity, SrvChangeMapReply::create(\n        basicInfo.id, life.hp, magic.mp, level.xp, level.penaltyXp,\n        entitySystem.get_world_time(), basicInfo.teamId), true); \/\/ FIXME: teamId is uint32_t but the packet expects a uint16_t\n    if (const auto client_ptr = entitySystem.try_get_component<Component::Client>(entity)) {\n        if (auto client = client_ptr->client.lock()) {\n            client->set_on_map();\n        }\n    }\n    Chat::send_whisper(entitySystem, entity, fmt::format(\"You are client {}\", basicInfo.id));\n    entitySystem.send_nearby_except_me(entity, CMapClient::create_srv_player_char(entitySystem, entity));\n    const auto& nearby_entities = entitySystem.get_nearby(entity);\n    for (auto other : nearby_entities) {\n        if (other != entity) {\n            entitySystem.send_to_entity(entity, other);\n        }\n    }\n    entitySystem.send_to_char_server(IscClientStatus::create(basicInfo.charId, basicInfo.id, IscClientStatus::CONNECTED));\n}\n\nvoid Map::teleport_request(EntitySystem& entitySystem, RoseCommon::Entity entity, const RoseCommon::Packet::CliTeleportReq& packet) {\n    auto logger = Core::CLog::GetLogger(Core::log_type::GENERAL).lock();\n    logger->trace(\"Map::teleport_request\");\n    logger->trace(\"entity {}\", entity);\n    const auto& pos = entitySystem.get_component<Component::Position>(entity);\n    logger->trace(\"packet position ({},{}), server position ({},{})\", packet.get_x(), packet.get_y(), pos.x, pos.y);\n    float closest = std::numeric_limits<float>::max();\n    Component::Warpgate warp;\n    Component::Destination dest;\n    for (const auto w : entitySystem.get_entities_with_components<Component::Warpgate>()) {\n        const auto [cx, cy, _] = entitySystem.get_component<Component::Warpgate>(w).get_center();\n        float dist = (cx - pos.x) * (cx - pos.x) + (cy - pos.y) * (cy - pos.y);\n        if (dist < closest) {\n            closest = dist;\n            warp = entitySystem.get_component<Component::Warpgate>(w);\n            dest = entitySystem.get_component<Component::Destination>(w);\n        }\n        \/*\/\/ TODO: check for hack, do something with the warpgate center and the current position?\n        const auto& warpgate = entitySystem.get_component<Component::Warpgate>(w);\n        if (warpgate.id == packet.get_id()) {\n            const auto& dest = entitySystem.get_component<Component::Destination>(w);\n            entitySystem.teleport_entity(entity, dest.x, dest.y, warpgate.dest_map);\n            break;\n        }*\/\n    }\n    logger->trace(\"closest warpgate ({},{}), ({},{})\", warp.min_x, warp.min_y, warp.max_x, warp.max_y);\n    entitySystem.teleport_entity(entity, dest.x, dest.y, warp.dest_map);\n}\n<commit_msg>Update change_map.cpp<commit_after>#include \"map\/change_map.h\"\n\n#include \"logconsole.h\"\n#include \"entity_system.h\"\n#include \"cli_change_map_req.h\"\n#include \"srv_change_map_reply.h\"\n#include \"chat\/whisper_chat.h\"\n#include \"cmapclient.h\"\n\n#include \"components\/basic_info.h\"\n#include \"components\/client.h\"\n#include \"components\/destination.h\"\n#include \"components\/level.h\"\n#include \"components\/life.h\"\n#include \"components\/magic.h\"\n#include \"components\/position.h\"\n#include \"components\/warpgate.h\"\n#include \"isc_client_status.h\"\n\n#include <limits>\n\nusing namespace RoseCommon;\nusing namespace RoseCommon::Packet;\n\nvoid Map::change_map_request(EntitySystem& entitySystem, Entity entity, const CliChangeMapReq&) {\n    auto logger = Core::CLog::GetLogger(Core::log_type::GENERAL).lock();\n    logger->trace(\"Map::change_map_request\");\n    logger->trace(\"entity {}\", entity);\n    const auto& basicInfo = entitySystem.get_component<Component::BasicInfo>(entity);\n    const auto& life = entitySystem.get_component<Component::Life>(entity);\n    const auto& magic = entitySystem.get_component<Component::Magic>(entity);\n    const auto& level = entitySystem.get_component<Component::Level>(entity);\n    \/\/ force send the packet as the client isn't technically on the map yet\n    entitySystem.send_to(entity, SrvChangeMapReply::create(\n        basicInfo.id, life.hp, magic.mp, level.xp, level.penaltyXp,\n        entitySystem.get_world_time(), basicInfo.teamId), true); \/\/ FIXME: teamId is uint32_t but the packet expects a uint16_t\n    if (const auto client_ptr = entitySystem.try_get_component<Component::Client>(entity)) {\n        if (auto client = client_ptr->client.lock()) {\n            client->set_on_map();\n        }\n    }\n    Chat::send_whisper(entitySystem, entity, fmt::format(\"You are client {}\", basicInfo.id));\n    entitySystem.send_nearby_except_me(entity, CMapClient::create_srv_player_char(entitySystem, entity));\n    const auto& nearby_entities = entitySystem.get_nearby(entity);\n    for (auto other : nearby_entities) {\n        if (other != entity) {\n            entitySystem.send_to_entity(entity, other);\n        }\n    }\n    entitySystem.send_to_char_server(IscClientStatus::create(basicInfo.charId, basicInfo.id, IscClientStatus::CONNECTED), basicInfo.charId);\n}\n\nvoid Map::teleport_request(EntitySystem& entitySystem, RoseCommon::Entity entity, const RoseCommon::Packet::CliTeleportReq& packet) {\n    auto logger = Core::CLog::GetLogger(Core::log_type::GENERAL).lock();\n    logger->trace(\"Map::teleport_request\");\n    logger->trace(\"entity {}\", entity);\n    const auto& pos = entitySystem.get_component<Component::Position>(entity);\n    logger->trace(\"packet position ({},{}), server position ({},{})\", packet.get_x(), packet.get_y(), pos.x, pos.y);\n    float closest = std::numeric_limits<float>::max();\n    Component::Warpgate warp;\n    Component::Destination dest;\n    for (const auto w : entitySystem.get_entities_with_components<Component::Warpgate>()) {\n        const auto [cx, cy, _] = entitySystem.get_component<Component::Warpgate>(w).get_center();\n        float dist = (cx - pos.x) * (cx - pos.x) + (cy - pos.y) * (cy - pos.y);\n        if (dist < closest) {\n            closest = dist;\n            warp = entitySystem.get_component<Component::Warpgate>(w);\n            dest = entitySystem.get_component<Component::Destination>(w);\n        }\n        \/*\/\/ TODO: check for hack, do something with the warpgate center and the current position?\n        const auto& warpgate = entitySystem.get_component<Component::Warpgate>(w);\n        if (warpgate.id == packet.get_id()) {\n            const auto& dest = entitySystem.get_component<Component::Destination>(w);\n            entitySystem.teleport_entity(entity, dest.x, dest.y, warpgate.dest_map);\n            break;\n        }*\/\n    }\n    logger->trace(\"closest warpgate ({},{}), ({},{})\", warp.min_x, warp.min_y, warp.max_x, warp.max_y);\n    entitySystem.teleport_entity(entity, dest.x, dest.y, warp.dest_map);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2005-2020 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 \"otbGDALRPCTransformer.h\"\n#include <assert.h>\n#include \"cpl_string.h\"\n#include \"otbDEMHandler.h\"\n\nnamespace otb\n{\nGDALRPCTransformer::GDALRPCTransformer(double LineOffset, double SampleOffset, double LatOffset, double LonOffset, double HeightOffset,\n\t\t\t\t       double LineScale, double SampleScale, double LatScale, double LonScale, double HeightScale,\n\t\t\t\t       const double (&LineNum)[20], const double (&LineDen)[20], const double (&SampleNum)[20], const double (&SampleDen)[20])\n{\n  \/\/ Offsets\n  this->m_GDALRPCInfo.dfLINE_OFF = LineOffset;\n  this->m_GDALRPCInfo.dfSAMP_OFF = SampleOffset;\n  this->m_GDALRPCInfo.dfLAT_OFF = LatOffset;\n  this->m_GDALRPCInfo.dfLONG_OFF = LonOffset;\n  this->m_GDALRPCInfo.dfHEIGHT_OFF = HeightOffset;\n  \/\/ Scales\n  this->m_GDALRPCInfo.dfLINE_SCALE = LineScale;\n  this->m_GDALRPCInfo.dfSAMP_SCALE = SampleScale;\n  this->m_GDALRPCInfo.dfLAT_SCALE = LatScale;\n  this->m_GDALRPCInfo.dfLONG_SCALE = LonScale;\n  this->m_GDALRPCInfo.dfHEIGHT_SCALE = HeightScale;\n  \/\/ Coefficients\n  std::copy_n(LineNum, 20, this->m_GDALRPCInfo.adfLINE_NUM_COEFF);\n  std::copy_n(LineDen, 20, this->m_GDALRPCInfo.adfLINE_DEN_COEFF);\n  std::copy_n(SampleNum, 20, this->m_GDALRPCInfo.adfSAMP_NUM_COEFF);\n  std::copy_n(SampleDen, 20, this->m_GDALRPCInfo.adfSAMP_DEN_COEFF);\n\n  auto & demHandler = otb::DEMHandler::GetInstance();\n  if (demHandler.GetDEMCount() > 0)\n  {\n    this->SetOption(\"RPC_DEM\", demHandler.DEM_DATASET_PATH);\n    this->SetOption(\"RPC_DEM_MISSING_VALUE\", std::to_string(demHandler.GetDefaultHeightAboveEllipsoid()));\n  }\n  else\n  {\n    this->SetOption(\"RPC_HEIGHT\", std::to_string(demHandler.GetDefaultHeightAboveEllipsoid()));\n  }\n}\n\nGDALRPCTransformer::~GDALRPCTransformer()\n{\n  if(m_TransformArg != nullptr)\n    GDALDestroyTransformer(m_TransformArg);\n  CSLDestroy(m_Options);\n}\n\nvoid GDALRPCTransformer::SetOption(const std::string& Name, const std::string& Value)\n{\n  this->m_Options = CSLSetNameValue(m_Options, Name.c_str(), Value.c_str());\n  this->m_Modified = true;\n}\n\nvoid GDALRPCTransformer::SetPixErrThreshold(double PixErrThreshold)\n{\n  this->m_PixErrThreshold = PixErrThreshold;\n  this->m_Modified = true;\n}\n\nvoid GDALRPCTransformer::Update()\n{\n  if(m_TransformArg != nullptr)\n    GDALDestroyTransformer(m_TransformArg);\n  this->m_TransformArg = GDALCreateRPCTransformer(&this->m_GDALRPCInfo, false, this->m_PixErrThreshold, this->m_Options);\n  this->m_Modified = false;\n}\n\nbool GDALRPCTransformer::ForwardTransform(double* x, double* y, double* z, int nPointCount)\n{\n  assert(x);\n  assert(y);\n  assert(z);\n  if (this->m_Modified)\n    this->Update();\n  std::vector<int> success(nPointCount);\n  GDALRPCTransform(this->m_TransformArg, false, nPointCount, x, y, z, success.data());\n  bool finalSuccess = std::all_of(success.begin(), success.end(), [](int i){return i;});\n  return finalSuccess;\n}\n\nGDALRPCTransformer::PointType GDALRPCTransformer::ForwardTransform(GDALRPCTransformer::PointType p)\n{\n  if (m_Modified)\n    this->Update();\n  int success;\n  GDALRPCTransform(this->m_TransformArg, false, 1, &p[0], &p[1], &p[2], &success);\n  if (!success)\n    throw std::runtime_error(\"GDALRPCTransform was not able to process the ForwardTransform.\");\n  return p;\n}\n\n\nbool GDALRPCTransformer::InverseTransform(double* x, double* y, double* z, int nPointCount)\n{\n  assert(x);\n  assert(y);\n  assert(z);\n  if (this->m_Modified)\n    this->Update();\n  std::vector<int> success(nPointCount);\n  GDALRPCTransform(this->m_TransformArg, true, nPointCount, x, y, z, success.data());\n  bool finalSuccess = std::all_of(success.begin(), success.end(), [](int i){return i;});\n  return finalSuccess;\n}\n\nGDALRPCTransformer::PointType GDALRPCTransformer::InverseTransform(GDALRPCTransformer::PointType p)\n{\n  if (m_Modified)\n    this->Update();\n  int success;\n  GDALRPCTransform(this->m_TransformArg, true, 1, &p[0], &p[1], &p[2], &success);\n  if (!success)\n    throw std::runtime_error(\"GDALRPCTransform was not able to process the InverseTransform.\");\n  return p;\n}\n}\n<commit_msg>BUG: set default values for uninitialized variables in GDALRPCInfo structure (min\/max for longitude and latitude)<commit_after>\/*\n * Copyright (C) 2005-2020 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 \"otbGDALRPCTransformer.h\"\n#include <assert.h>\n#include \"cpl_string.h\"\n#include \"otbDEMHandler.h\"\n\nnamespace otb\n{\nGDALRPCTransformer::GDALRPCTransformer(double LineOffset, double SampleOffset, double LatOffset, double LonOffset, double HeightOffset,\n\t\t\t\t       double LineScale, double SampleScale, double LatScale, double LonScale, double HeightScale,\n\t\t\t\t       const double (&LineNum)[20], const double (&LineDen)[20], const double (&SampleNum)[20], const double (&SampleDen)[20])\n{\n  \/\/ Offsets\n  this->m_GDALRPCInfo.dfLINE_OFF = LineOffset;\n  this->m_GDALRPCInfo.dfSAMP_OFF = SampleOffset;\n  this->m_GDALRPCInfo.dfLAT_OFF = LatOffset;\n  this->m_GDALRPCInfo.dfLONG_OFF = LonOffset;\n  this->m_GDALRPCInfo.dfHEIGHT_OFF = HeightOffset;\n  \/\/ Scales\n  this->m_GDALRPCInfo.dfLINE_SCALE = LineScale;\n  this->m_GDALRPCInfo.dfSAMP_SCALE = SampleScale;\n  this->m_GDALRPCInfo.dfLAT_SCALE = LatScale;\n  this->m_GDALRPCInfo.dfLONG_SCALE = LonScale;\n  this->m_GDALRPCInfo.dfHEIGHT_SCALE = HeightScale;\n  \/\/ Coefficients\n  std::copy_n(LineNum, 20, this->m_GDALRPCInfo.adfLINE_NUM_COEFF);\n  std::copy_n(LineDen, 20, this->m_GDALRPCInfo.adfLINE_DEN_COEFF);\n  std::copy_n(SampleNum, 20, this->m_GDALRPCInfo.adfSAMP_NUM_COEFF);\n  std::copy_n(SampleDen, 20, this->m_GDALRPCInfo.adfSAMP_DEN_COEFF);\n\n  \/\/ min\/max longitude and latitude (default values)\n  this->m_GDALRPCInfo.dfMIN_LONG = -180.0;\n  this->m_GDALRPCInfo.dfMIN_LAT = -90.0;\n  this->m_GDALRPCInfo.dfMAX_LONG = 180.0;\n  this->m_GDALRPCInfo.dfMAX_LAT = 90.0;\n\n  auto & demHandler = otb::DEMHandler::GetInstance();\n  if (demHandler.GetDEMCount() > 0)\n  {\n    this->SetOption(\"RPC_DEM\", demHandler.DEM_DATASET_PATH);\n    this->SetOption(\"RPC_DEM_MISSING_VALUE\", std::to_string(demHandler.GetDefaultHeightAboveEllipsoid()));\n  }\n  else\n  {\n    \/\/ RPC height is used as a constant height offset applied to all points in case no DEM is set.\n    this->SetOption(\"RPC_HEIGHT\", std::to_string(demHandler.GetDefaultHeightAboveEllipsoid()));\n  }\n}\n\nGDALRPCTransformer::~GDALRPCTransformer()\n{\n  if(m_TransformArg != nullptr)\n    GDALDestroyTransformer(m_TransformArg);\n  CSLDestroy(m_Options);\n}\n\nvoid GDALRPCTransformer::SetOption(const std::string& Name, const std::string& Value)\n{\n  this->m_Options = CSLSetNameValue(m_Options, Name.c_str(), Value.c_str());\n  this->m_Modified = true;\n}\n\nvoid GDALRPCTransformer::SetPixErrThreshold(double PixErrThreshold)\n{\n  this->m_PixErrThreshold = PixErrThreshold;\n  this->m_Modified = true;\n}\n\nvoid GDALRPCTransformer::Update()\n{\n  if(m_TransformArg != nullptr)\n    GDALDestroyTransformer(m_TransformArg);\n  this->m_TransformArg = GDALCreateRPCTransformer(&this->m_GDALRPCInfo, false, this->m_PixErrThreshold, this->m_Options);\n  this->m_Modified = false;\n}\n\nbool GDALRPCTransformer::ForwardTransform(double* x, double* y, double* z, int nPointCount)\n{\n  assert(x);\n  assert(y);\n  assert(z);\n  if (this->m_Modified)\n    this->Update();\n  std::vector<int> success(nPointCount);\n  GDALRPCTransform(this->m_TransformArg, false, nPointCount, x, y, z, success.data());\n  bool finalSuccess = std::all_of(success.begin(), success.end(), [](int i){return i;});\n  return finalSuccess;\n}\n\nGDALRPCTransformer::PointType GDALRPCTransformer::ForwardTransform(GDALRPCTransformer::PointType p)\n{\n  if (m_Modified)\n    this->Update();\n  int success;\n  GDALRPCTransform(this->m_TransformArg, false, 1, &p[0], &p[1], &p[2], &success);\n  if (!success)\n    throw std::runtime_error(\"GDALRPCTransform was not able to process the ForwardTransform.\");\n  return p;\n}\n\n\nbool GDALRPCTransformer::InverseTransform(double* x, double* y, double* z, int nPointCount)\n{\n  assert(x);\n  assert(y);\n  assert(z);\n  if (this->m_Modified)\n    this->Update();\n  std::vector<int> success(nPointCount);\n  GDALRPCTransform(this->m_TransformArg, true, nPointCount, x, y, z, success.data());\n  bool finalSuccess = std::all_of(success.begin(), success.end(), [](int i){return i;});\n  return finalSuccess;\n}\n\nGDALRPCTransformer::PointType GDALRPCTransformer::InverseTransform(GDALRPCTransformer::PointType p)\n{\n  if (m_Modified)\n    this->Update();\n  int success;\n  GDALRPCTransform(this->m_TransformArg, true, 1, &p[0], &p[1], &p[2], &success);\n  if (!success)\n    throw std::runtime_error(\"GDALRPCTransform was not able to process the InverseTransform.\");\n  return p;\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * RouteConn.cpp\n *\n *  Created on: 2013-7-4\n *      Author: ziteng@mogujie.com\n *\/\n\n#include \"netlib.h\"\n#include \"RouteConn.h\"\n#include \"UserInfo.h\"\n#include \"IM.Buddy.pb.h\"\n#include \"IM.Group.pb.h\"\n#include \"IM.Message.pb.h\"\n#include \"IM.Other.pb.h\"\n#include \"IM.Server.pb.h\"\n#include \"IM.SwitchService.pb.h\"\n#include \"public_define.h\"\nusing namespace IM::BaseDefine;\n\n\/\/typedef hash_map<uint32_t \/* user_id *\/, UserStat_t> UserStatMap_t;\nstatic ConnMap_t g_route_conn_map;\ntypedef hash_map<uint32_t, CUserInfo*> UserInfoMap_t;\nstatic UserInfoMap_t g_user_map;\n\nCUserInfo* GetUserInfo(uint32_t user_id)\n{\n    CUserInfo* pUser = NULL;\n    UserInfoMap_t::iterator it = g_user_map.find(user_id);\n    if (it != g_user_map.end()) {\n        pUser = it->second;\n    }\n    \n    return pUser;\n}\n \nvoid route_serv_timer_callback(void* callback_data, uint8_t msg, uint32_t handle, void* pParam)\n{\n\tuint64_t cur_time = get_tick_count();\n\tfor (ConnMap_t::iterator it = g_route_conn_map.begin(); it != g_route_conn_map.end(); ) {\n\t\tConnMap_t::iterator it_old = it;\n\t\tit++;\n\n\t\tCRouteConn* pConn = (CRouteConn*)it_old->second;\n\t\tpConn->OnTimer(cur_time);\n\t}\n}\n\nvoid init_routeconn_timer_callback()\n{\n\tnetlib_register_timer(route_serv_timer_callback, NULL, 1000);\n}\n\nCRouteConn::CRouteConn()\n{\n\tm_bMaster = false;\n}\n\nCRouteConn::~CRouteConn()\n{\n\n}\n\nvoid CRouteConn::Close()\n{\n\tif (m_handle != NETLIB_INVALID_HANDLE) {\n\t\tnetlib_close(m_handle);\n\t\tg_route_conn_map.erase(m_handle);\n\t}\n\n\t\/\/ remove all user info from this MessageServer\n    \n    UserInfoMap_t::iterator it_old;\n    for (UserInfoMap_t::iterator it = g_user_map.begin(); it != g_user_map.end(); )\n    {\n        it_old = it;\n        it++;\n        \n        CUserInfo* pUser = it_old->second;\n        pUser->RemoveRouteConn(this);\n        if (pUser->GetRouteConnCount() == 0)\n        {\n            delete pUser;\n            pUser = NULL;\n            g_user_map.erase(it_old);\n        }\n    }\n\n\tReleaseRef();\n}\n\nvoid CRouteConn::OnConnect(net_handle_t handle)\n{\n\tm_handle = handle;\n\n\tg_route_conn_map.insert(make_pair(handle, this));\n\n\tnetlib_option(handle, NETLIB_OPT_SET_CALLBACK, (void*)imconn_callback);\n\tnetlib_option(handle, NETLIB_OPT_SET_CALLBACK_DATA, (void*)&g_route_conn_map);\n}\n\nvoid CRouteConn::OnClose()\n{\n\tlog(\"MsgServer onclose: handle=%d \", m_handle);\n\tClose();\n}\n\nvoid CRouteConn::OnTimer(uint64_t curr_tick)\n{\n\tif (curr_tick > m_last_send_tick + SERVER_HEARTBEAT_INTERVAL)\n    {\n        IM::Other::IMHeartBeat msg;\n        CImPdu pdu;\n        pdu.SetPBMsg(&msg);\n        pdu.SetServiceId(SID_OTHER);\n        pdu.SetCommandId(CID_OTHER_HEARTBEAT);\n\t\tSendPdu(&pdu);\n\t}\n\n\tif (curr_tick > m_last_recv_tick + SERVER_TIMEOUT) {\n\t\tlog(\"message server timeout \");\n\t\tClose();\n\t}\n}\n\/\/--> called in imconn OnRead()\nvoid CRouteConn::HandlePdu(CImPdu* pPdu)\n{\n\tswitch (pPdu->GetCommandId()) {\n        case CID_OTHER_HEARTBEAT:\n            \/\/ do not take any action, heart beat only update m_last_recv_tick\n            break;\n        case CID_OTHER_ONLINE_USER_INFO:\n            _HandleOnlineUserInfo( pPdu );\n            break;\n        case CID_OTHER_USER_STATUS_UPDATE:\n            _HandleUserStatusUpdate( pPdu );\n            break;\n        case CID_OTHER_ROLE_SET:\n            _HandleRoleSet( pPdu );\n            break;\n        case CID_BUDDY_LIST_USERS_STATUS_REQUEST:\n            _HandleUsersStatusRequest( pPdu );\n            break;\n        case CID_MSG_DATA:\n        case CID_SWITCH_P2P_CMD:\n        case CID_MSG_READ_NOTIFY:\n        case CID_OTHER_SERVER_KICK_USER:\n        case CID_GROUP_CHANGE_MEMBER_NOTIFY:\n        case CID_FILE_NOTIFY:\n        case CID_BUDDY_LIST_REMOVE_SESSION_NOTIFY:\n            _BroadcastMsg(pPdu, this);\n            break;\n        case CID_BUDDY_LIST_SIGN_INFO_CHANGED_NOTIFY:\n            _BroadcastMsg(pPdu);\n            break;\n        \n\tdefault:\n\t\tlog(\"CRouteConn::HandlePdu, wrong cmd id: %d \", pPdu->GetCommandId());\n\t\tbreak;\n\t}\n}\n\nvoid CRouteConn::_HandleOnlineUserInfo(CImPdu* pPdu)\n{\n    IM::Server::IMOnlineUserInfo msg;\n    CHECK_PB_PARSE_MSG(msg.ParseFromArray(pPdu->GetBodyData(), pPdu->GetBodyLength()));\n\n\tuint32_t user_count = msg.user_stat_list_size();\n\n\tlog(\"HandleOnlineUserInfo, user_cnt=%u \", user_count);\n\n\tfor (uint32_t i = 0; i < user_count; i++) {\n        IM::BaseDefine::ServerUserStat server_user_stat = msg.user_stat_list(i);\n\t\t_UpdateUserStatus(server_user_stat.user_id(), server_user_stat.status(), server_user_stat.client_type());\n\t}\n}\n\nvoid CRouteConn::_HandleUserStatusUpdate(CImPdu* pPdu)\n{\n    IM::Server::IMUserStatusUpdate msg;\n    CHECK_PB_PARSE_MSG(msg.ParseFromArray(pPdu->GetBodyData(), pPdu->GetBodyLength()));\n\n\tuint32_t user_status = msg.user_status();\n\tuint32_t user_id = msg.user_id();\n    uint32_t client_type = msg.client_type();\n\tlog(\"HandleUserStatusUpdate, status=%u, uid=%u, client_type=%u \", user_status, user_id, client_type);\n\n\t_UpdateUserStatus(user_id, user_status, client_type);\n    \n    \/\/用于通知客户端,同一用户在pc端的登录情况\n    CUserInfo* pUser = GetUserInfo(user_id);\n    if (pUser)\n    {\n        IM::Server::IMServerPCLoginStatusNotify msg2;\n        msg2.set_user_id(user_id);\n        if (user_status == IM::BaseDefine::USER_STATUS_OFFLINE)\n        {\n            msg2.set_login_status(IM_PC_LOGIN_STATUS_OFF);\n        }\n        else\n        {\n            msg2.set_login_status(IM_PC_LOGIN_STATUS_ON);\n        }\n        CImPdu pdu;\n        pdu.SetPBMsg(&msg2);\n        pdu.SetServiceId(SID_OTHER);\n        pdu.SetCommandId(CID_OTHER_LOGIN_STATUS_NOTIFY);\n        \n        if (user_status == USER_STATUS_OFFLINE)\n        {\n            \/\/pc端下线且无pc端存在，则给msg_server发送一个通知\n            if (CHECK_CLIENT_TYPE_PC(client_type) && !pUser->IsPCClientLogin())\n            {\n                _BroadcastMsg(&pdu);\n            }\n        }\n        else\n        {\n            \/\/只要pc端在线，则不管上线的是pc还是移动端，都通知msg_server\n            if (pUser->IsPCClientLogin())\n            {\n                _BroadcastMsg(&pdu);\n            }\n        }\n    }\n    \n    \/\/状态更新的是pc client端，则通知给所有其他人\n    if (CHECK_CLIENT_TYPE_PC(client_type))\n    {\n        IM::Buddy::IMUserStatNotify msg3;\n        IM::BaseDefine::UserStat* user_stat = msg3.mutable_user_stat();\n        user_stat->set_user_id(user_id);\n        user_stat->set_status((IM::BaseDefine::UserStatType)user_status);\n        CImPdu pdu2;\n        pdu2.SetPBMsg(&msg3);\n        pdu2.SetServiceId(SID_BUDDY_LIST);\n        pdu2.SetCommandId(CID_BUDDY_LIST_STATUS_NOTIFY);\n        \n        \/\/用户存在\n        if (pUser)\n        {\n            \/\/如果是pc客户端离线，但是仍然存在pc客户端，则不发送离线通知\n            \/\/此种情况一般是pc客户端多点登录时引起\n            if (USER_STATUS_OFFLINE == user_status && pUser->IsPCClientLogin())\n            {\n                return;\n            }\n            else\n            {\n                _BroadcastMsg(&pdu2);\n            }\n        }\n        else\/\/该用户不存在了，则表示是离线状态\n        {\n            _BroadcastMsg(&pdu2);\n        }\n    }\n}\n\nvoid CRouteConn::_HandleRoleSet(CImPdu* pPdu)\n{\n    IM::Server::IMRoleSet msg;\n    CHECK_PB_PARSE_MSG(msg.ParseFromArray(pPdu->GetBodyData(), pPdu->GetBodyLength()));\n\n\tuint32_t master = msg.master();\n\n\tlog(\"HandleRoleSet, master=%u, handle=%u \", master, m_handle);\n\tif (master == 1) {\n\t\tm_bMaster = true;\n\t} else {\n\t\tm_bMaster = false;\n\t}\n}\n\nvoid CRouteConn::_HandleUsersStatusRequest(CImPdu* pPdu)\n{\n    IM::Buddy::IMUsersStatReq msg;\n    CHECK_PB_PARSE_MSG(msg.ParseFromArray(pPdu->GetBodyData(), pPdu->GetBodyLength()));\n\n\tuint32_t request_id = msg.user_id();\n\tuint32_t query_count = msg.user_id_list_size();\n\tlog(\"HandleUserStatusReq, req_id=%u, query_count=%u \", request_id, query_count);\n\n    IM::Buddy::IMUsersStatRsp msg2;\n    msg2.set_user_id(request_id);\n    msg2.set_attach_data(msg.attach_data());\n    list<user_stat_t> result_list;\n\tuser_stat_t status;\n    for(uint32_t i = 0; i < query_count; i++)\n\t{\n        IM::BaseDefine::UserStat* user_stat = msg2.add_user_stat_list();\n        uint32_t user_id = msg.user_id_list(i);\n        user_stat->set_user_id(user_id);\n        CUserInfo* pUser = GetUserInfo(user_id);\n        if (pUser) {\n            user_stat->set_status((::IM::BaseDefine::UserStatType) pUser->GetStatus()) ;\n        }\n\t\telse\n\t\t{\n            user_stat->set_status(USER_STATUS_OFFLINE) ;\n\t\t}\n\t}\n\n\t\/\/ send back query user status\n    CImPdu pdu;\n    pdu.SetPBMsg(&msg2);\n    pdu.SetServiceId(SID_BUDDY_LIST);\n    pdu.SetCommandId(CID_BUDDY_LIST_USERS_STATUS_RESPONSE);\n\tpdu.SetSeqNum(pPdu->GetSeqNum());\n\tSendPdu(&pdu);\n}\n\n\/*\n * update user status info, the logic seems complex\n *\/\nvoid CRouteConn::_UpdateUserStatus(uint32_t user_id, uint32_t status, uint32_t client_type)\n{\n    CUserInfo* pUser = GetUserInfo(user_id);\n    if (pUser) {\n        if (pUser->FindRouteConn(this))\n        {\n            if (status == USER_STATUS_OFFLINE)\n            {\n                pUser->RemoveClientType(client_type);\n                if (pUser->IsMsgConnNULL())\n                {\n                    pUser->RemoveRouteConn(this);\n                    if (pUser->GetRouteConnCount() == 0) {\n                        delete pUser;\n                        pUser = NULL;\n                        g_user_map.erase(user_id);\n                    }\n                }\n            }\n            else\n            {\n                pUser->AddClientType(client_type);\n            }\n        }\n        else\n        {\n            if (status != USER_STATUS_OFFLINE)\n            {\n                pUser->AddRouteConn(this);\n                pUser->AddClientType(client_type);\n            }\n        }\n    }\n    else\n    {\n        if (status != USER_STATUS_OFFLINE) {\n            CUserInfo* pUserInfo = new CUserInfo();\n            if (pUserInfo != NULL) {\n                pUserInfo->AddRouteConn(this);\n                pUserInfo->AddClientType(client_type);\n                g_user_map.insert(make_pair(user_id, pUserInfo));\n            }\n            else\n            {\n                log(\"new UserInfo failed. \");\n            }\n        }\n    }\n}\n\nvoid CRouteConn::_BroadcastMsg(CImPdu* pPdu, CRouteConn* pFromConn)\n{\n\tConnMap_t::iterator it;\n\tfor (it = g_route_conn_map.begin(); it != g_route_conn_map.end(); it++) {\n\t\tCRouteConn* pRouteConn = (CRouteConn*)it->second;\n\t\tif (pRouteConn != pFromConn) {\n\t\t\tpRouteConn->SendPdu(pPdu);\n\t\t}\n\t}\n}\n\n\nvoid CRouteConn::_SendPduToUser(uint32_t user_id, CImPdu* pPdu, bool bAll)\n{\n    CUserInfo* pUser = GetUserInfo(user_id);\n    if (pUser)\n    {\n        set<CRouteConn*>* pUserSet = pUser->GetRouteConn();\n        for (set<CRouteConn*>::iterator it = pUserSet->begin(); it != pUserSet->end(); it++)\n        {\n            CRouteConn* pToConn = *it;\n            if (bAll || pToConn != this)\n            {\n                pToConn->Send(pPdu->GetBuffer(), pPdu->GetLength());\n            }\n        }\n    }\n}\n\n<commit_msg>Update RouteConn.cpp<commit_after>\/*\n * RouteConn.cpp\n *\n *  Created on: 2013-7-4\n *      Author: ziteng@mogujie.com\n *\/\n\n#include \"netlib.h\"\n#include \"RouteConn.h\"\n#include \"UserInfo.h\"\n#include \"IM.Buddy.pb.h\"\n#include \"IM.Group.pb.h\"\n#include \"IM.Message.pb.h\"\n#include \"IM.Other.pb.h\"\n#include \"IM.Server.pb.h\"\n#include \"IM.SwitchService.pb.h\"\n#include \"public_define.h\"\nusing namespace IM::BaseDefine;\n\n\/\/typedef hash_map<uint32_t \/* user_id *\/, UserStat_t> UserStatMap_t;\nstatic ConnMap_t g_route_conn_map;\ntypedef hash_map<uint32_t, CUserInfo*> UserInfoMap_t;\nstatic UserInfoMap_t g_user_map;\n\nCUserInfo* GetUserInfo(uint32_t user_id)\n{\n    CUserInfo* pUser = NULL;\n    UserInfoMap_t::iterator it = g_user_map.find(user_id);\n    if (it != g_user_map.end()) {\n        pUser = it->second;\n    }\n    \n    return pUser;\n}\n \nvoid route_serv_timer_callback(void* callback_data, uint8_t msg, uint32_t handle, void* pParam)\n{\n\tuint64_t cur_time = get_tick_count();\n\tfor (ConnMap_t::iterator it = g_route_conn_map.begin(); it != g_route_conn_map.end(); ) {\n\t\tConnMap_t::iterator it_old = it;\n\t\tit++;\n\n\t\tCRouteConn* pConn = (CRouteConn*)it_old->second;\n\t\tpConn->OnTimer(cur_time);\n\t}\n}\n\nvoid init_routeconn_timer_callback()\n{\n\tnetlib_register_timer(route_serv_timer_callback, NULL, 1000);\n}\n\nCRouteConn::CRouteConn()\n{\n\tm_bMaster = false;\n}\n\nCRouteConn::~CRouteConn()\n{\n\n}\n\nvoid CRouteConn::Close()\n{\n\tif (m_handle != NETLIB_INVALID_HANDLE) {\n\t\tnetlib_close(m_handle);\n\t\tg_route_conn_map.erase(m_handle);\n\t}\n\n\t\/\/ remove all user info from this MessageServer\n    \n    UserInfoMap_t::iterator it_old;\n    for (UserInfoMap_t::iterator it = g_user_map.begin(); it != g_user_map.end(); )\n    {\n        it_old = it;\n        it++;\n        \n        CUserInfo* pUser = it_old->second;\n        pUser->RemoveRouteConn(this);\n        if (pUser->GetRouteConnCount() == 0)\n        {\n            delete pUser;\n            pUser = NULL;\n            g_user_map.erase(it_old);\n        }\n    }\n\n\tReleaseRef();\n}\n\nvoid CRouteConn::OnConnect(net_handle_t handle)\n{\n\tm_handle = handle;\n\n\tg_route_conn_map.insert(make_pair(handle, this));\n\n\tnetlib_option(handle, NETLIB_OPT_SET_CALLBACK, (void*)imconn_callback);\n\tnetlib_option(handle, NETLIB_OPT_SET_CALLBACK_DATA, (void*)&g_route_conn_map);\n}\n\nvoid CRouteConn::OnClose()\n{\n\tlog(\"MsgServer onclose: handle=%d \", m_handle);\n\tClose();\n}\n\nvoid CRouteConn::OnTimer(uint64_t curr_tick)\n{\n\tif (curr_tick > m_last_send_tick + SERVER_HEARTBEAT_INTERVAL)\n    {\n        IM::Other::IMHeartBeat msg;\n        CImPdu pdu;\n        pdu.SetPBMsg(&msg);\n        pdu.SetServiceId(SID_OTHER);\n        pdu.SetCommandId(CID_OTHER_HEARTBEAT);\n\t\tSendPdu(&pdu);\n\t}\n\n\tif (curr_tick > m_last_recv_tick + SERVER_TIMEOUT) {\n\t\tlog(\"message server timeout \");\n\t\tClose();\n\t}\n}\n\/\/--> called in imconn OnRead()\nvoid CRouteConn::HandlePdu(CImPdu* pPdu)\n{\n\tswitch (pPdu->GetCommandId()) {\n        case CID_OTHER_HEARTBEAT:\n            \/\/ do not take any action, heart beat only update m_last_recv_tick\n            break;\n        case CID_OTHER_ONLINE_USER_INFO:\n            _HandleOnlineUserInfo( pPdu );\n            break;\n        case CID_OTHER_USER_STATUS_UPDATE:\n            _HandleUserStatusUpdate( pPdu );\n            break;\n        case CID_OTHER_ROLE_SET:\n            _HandleRoleSet( pPdu );\n            break;\n        case CID_BUDDY_LIST_USERS_STATUS_REQUEST:\n            _HandleUsersStatusRequest( pPdu );\n            break;\n        case CID_MSG_DATA:\n        case CID_SWITCH_P2P_CMD:\n        case CID_MSG_READ_NOTIFY:\n        case CID_OTHER_SERVER_KICK_USER:\n        case CID_GROUP_CHANGE_MEMBER_NOTIFY:\n        case CID_FILE_NOTIFY:\n        case CID_BUDDY_LIST_REMOVE_SESSION_NOTIFY:\n            _BroadcastMsg(pPdu, this);\n            break;\n        case CID_BUDDY_LIST_SIGN_INFO_CHANGED_NOTIFY:\n            _BroadcastMsg(pPdu);\n            break;\n        \n\tdefault:\n\t\tlog(\"CRouteConn::HandlePdu, wrong cmd id: %d \", pPdu->GetCommandId());\n\t\tbreak;\n\t}\n}\n\nvoid CRouteConn::_HandleOnlineUserInfo(CImPdu* pPdu)\n{\n    IM::Server::IMOnlineUserInfo msg;\n    CHECK_PB_PARSE_MSG(msg.ParseFromArray(pPdu->GetBodyData(), pPdu->GetBodyLength()));\n\n\tuint32_t user_count = msg.user_stat_list_size();\n\n\tlog(\"HandleOnlineUserInfo, user_cnt=%u \", user_count);\n\n\tfor (uint32_t i = 0; i < user_count; i++) {\n        IM::BaseDefine::ServerUserStat server_user_stat = msg.user_stat_list(i);\n\t\t_UpdateUserStatus(server_user_stat.user_id(), server_user_stat.status(), server_user_stat.client_type());\n\t}\n}\n\nvoid CRouteConn::_HandleUserStatusUpdate(CImPdu* pPdu)\n{\n    IM::Server::IMUserStatusUpdate msg;\n    CHECK_PB_PARSE_MSG(msg.ParseFromArray(pPdu->GetBodyData(), pPdu->GetBodyLength()));\n\n\tuint32_t user_status = msg.user_status();\n\tuint32_t user_id = msg.user_id();\n    uint32_t client_type = msg.client_type();\n\tlog(\"HandleUserStatusUpdate, status=%u, uid=%u, client_type=%u \", user_status, user_id, client_type);\n\n\t_UpdateUserStatus(user_id, user_status, client_type);\n    \n    \/\/用于通知客户端,同一用户在pc端的登录情况\n    CUserInfo* pUser = GetUserInfo(user_id);\n    if (pUser)\n    {\n        IM::Server::IMServerPCLoginStatusNotify msg2;\n        msg2.set_user_id(user_id);\n        if (user_status == IM::BaseDefine::USER_STATUS_OFFLINE)\n        {\n            msg2.set_login_status(IM_PC_LOGIN_STATUS_OFF);\n        }\n        else\n        {\n            msg2.set_login_status(IM_PC_LOGIN_STATUS_ON);\n        }\n        CImPdu pdu;\n        pdu.SetPBMsg(&msg2);\n        pdu.SetServiceId(SID_OTHER);\n        pdu.SetCommandId(CID_OTHER_LOGIN_STATUS_NOTIFY);\n        \n        if (user_status == USER_STATUS_OFFLINE)\n        {\n            \/\/pc端下线且无pc端存在，则给msg_server发送一个通知\n            if (CHECK_CLIENT_TYPE_PC(client_type) && !pUser->IsPCClientLogin())\n            {\n                _BroadcastMsg(&pdu);\n            }\n        }\n        else\n        {\n            \/\/只要pc端在线，则不管上线的是pc还是移动端，都通知msg_server\n            if (pUser->IsPCClientLogin())\n            {\n                _BroadcastMsg(&pdu);\n            }\n        }\n    }\n    \n    \/\/状态更新的是pc client端，则通知给所有其他人\n    if (CHECK_CLIENT_TYPE_PC(client_type))\n    {\n        IM::Buddy::IMUserStatNotify msg3;\n        IM::BaseDefine::UserStat* user_stat = msg3.mutable_user_stat();\n        user_stat->set_user_id(user_id);\n        user_stat->set_status((IM::BaseDefine::UserStatType)user_status);\n        CImPdu pdu2;\n        pdu2.SetPBMsg(&msg3);\n        pdu2.SetServiceId(SID_BUDDY_LIST);\n        pdu2.SetCommandId(CID_BUDDY_LIST_STATUS_NOTIFY);\n        \n        \/\/用户存在\n        if (pUser)\n        {\n            \/\/如果是pc客户端离线，但是仍然存在pc客户端，则不发送离线通知\n            \/\/此种情况一般是pc客户端多点登录时引起\n            if (USER_STATUS_OFFLINE == user_status && pUser->IsPCClientLogin())\n            {\n                return;\n            }\n            else\n            {\n                _BroadcastMsg(&pdu2);\n            }\n        }\n        else\/\/该用户不存在了，则表示是离线状态\n        {\n            _BroadcastMsg(&pdu2);\n        }\n    }\n}\n\nvoid CRouteConn::_HandleRoleSet(CImPdu* pPdu)\n{\n    IM::Server::IMRoleSet msg;\n    CHECK_PB_PARSE_MSG(msg.ParseFromArray(pPdu->GetBodyData(), pPdu->GetBodyLength()));\n\n\tuint32_t master = msg.master();\n\n\tlog(\"HandleRoleSet, master=%u, handle=%u \", master, m_handle);\n\tif (master == 1) {\n\t\tm_bMaster = true;\n\t} else {\n\t\tm_bMaster = false;\n\t}\n}\n\nvoid CRouteConn::_HandleUsersStatusRequest(CImPdu* pPdu)\n{\n    IM::Buddy::IMUsersStatReq msg;\n    CHECK_PB_PARSE_MSG(msg.ParseFromArray(pPdu->GetBodyData(), pPdu->GetBodyLength()));\n\n\tuint32_t request_id = msg.user_id();\n\tuint32_t query_count = msg.user_id_list_size();\n\tlog(\"HandleUserStatusReq, req_id=%u, query_count=%u \", request_id, query_count);\n\n    IM::Buddy::IMUsersStatRsp msg2;\n    msg2.set_user_id(request_id);\n    msg2.set_attach_data(msg.attach_data());\n    list<user_stat_t> result_list;\n\tuser_stat_t status;\n    for(uint32_t i = 0; i < query_count; i++)\n\t{\n        IM::BaseDefine::UserStat* user_stat = msg2.add_user_stat_list();\n        uint32_t user_id = msg.user_id_list(i);\n        user_stat->set_user_id(user_id);\n        CUserInfo* pUser = GetUserInfo(user_id);\n        if (pUser) {\n            user_stat->set_status((::IM::BaseDefine::UserStatType) pUser->GetStatus()) ;\n        }\n\t\telse\n\t\t{\n            user_stat->set_status(USER_STATUS_OFFLINE) ;\n\t\t}\n\t}\n\n\t\/\/ send back query user status\n    CImPdu pdu;\n    pdu.SetPBMsg(&msg2);\n    pdu.SetServiceId(SID_BUDDY_LIST);\n    pdu.SetCommandId(CID_BUDDY_LIST_USERS_STATUS_RESPONSE);\n\tpdu.SetSeqNum(pPdu->GetSeqNum());\n\tSendPdu(&pdu);\n}\n\n\/*\n * update user status info, the logic seems complex\n *\/\n \/\/--> update client_type_list and routeConnSet of user_id's UserInfo in this routeServer according to status and client_type\nvoid CRouteConn::_UpdateUserStatus(uint32_t user_id, uint32_t status, uint32_t client_type)\n{\n    CUserInfo* pUser = GetUserInfo(user_id);\n    if (pUser) {\/\/--> the user is in current RouteServer \n        if (pUser->FindRouteConn(this))\/\/--> if User's info contains routeServer\n        {\n            if (status == USER_STATUS_OFFLINE)\n            {\n                pUser->RemoveClientType(client_type);\n                if (pUser->IsMsgConnNULL())\/\/--> if user has no client connect to this routeServer then delete it\n                {\n                    pUser->RemoveRouteConn(this);\n                    if (pUser->GetRouteConnCount() == 0) {\n                        delete pUser;\n                        pUser = NULL;\n                        g_user_map.erase(user_id);\n                    }\n                }\n            }\n            else\n            {\n                pUser->AddClientType(client_type);\n            }\n        }\n        else\/\/--> routeServer is not in User's info \n        {\n            if (status != USER_STATUS_OFFLINE)\n            {\n                pUser->AddRouteConn(this);\n                pUser->AddClientType(client_type);\n            }\n        }\n    }\n    else\/\/--> user not found in this routeServer\n    {\n        if (status != USER_STATUS_OFFLINE) {\/\/--> new a UserInfo in current routeServer if client is online \n            CUserInfo* pUserInfo = new CUserInfo();\n            if (pUserInfo != NULL) {\n                pUserInfo->AddRouteConn(this);\n                pUserInfo->AddClientType(client_type);\n                g_user_map.insert(make_pair(user_id, pUserInfo));\n            }\n            else\n            {\n                log(\"new UserInfo failed. \");\n            }\n        }\n    }\n}\n\nvoid CRouteConn::_BroadcastMsg(CImPdu* pPdu, CRouteConn* pFromConn)\n{\n\tConnMap_t::iterator it;\n\tfor (it = g_route_conn_map.begin(); it != g_route_conn_map.end(); it++) {\n\t\tCRouteConn* pRouteConn = (CRouteConn*)it->second;\n\t\tif (pRouteConn != pFromConn) {\n\t\t\tpRouteConn->SendPdu(pPdu);\n\t\t}\n\t}\n}\n\n\nvoid CRouteConn::_SendPduToUser(uint32_t user_id, CImPdu* pPdu, bool bAll)\n{\n    CUserInfo* pUser = GetUserInfo(user_id);\n    if (pUser)\n    {\n        set<CRouteConn*>* pUserSet = pUser->GetRouteConn();\n        for (set<CRouteConn*>::iterator it = pUserSet->begin(); it != pUserSet->end(); it++)\n        {\n            CRouteConn* pToConn = *it;\n            if (bAll || pToConn != this)\n            {\n                pToConn->Send(pPdu->GetBuffer(), pPdu->GetLength());\n            }\n        }\n    }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <Poco\/Exception.h>\n\n#include \"di\/Injectable.h\"\n#include \"policy\/PolicyContext.h\"\n#include \"work\/DefaultWorkFacade.h\"\n#include \"work\/WorkLockManager.h\"\n#include \"work\/WorkScheduler.h\"\n\nBEEEON_OBJECT_BEGIN(BeeeOn, DefaultWorkFacade)\nBEEEON_OBJECT_CASTABLE(WorkFacade)\nBEEEON_OBJECT_REF(\"scheduler\", &DefaultWorkFacade::setScheduler)\nBEEEON_OBJECT_REF(\"lockManager\", &DefaultWorkFacade::setLockManager)\nBEEEON_OBJECT_REF(\"accessPolicy\", &DefaultWorkFacade::setAccessPolicy)\nBEEEON_OBJECT_END(BeeeOn, DefaultWorkFacade)\n\nusing namespace Poco;\nusing namespace BeeeOn;\n\nDefaultWorkFacade::DefaultWorkFacade()\n{\n}\n\nvoid DefaultWorkFacade::setScheduler(WorkScheduler::Ptr scheduler)\n{\n\tm_scheduler = scheduler;\n}\n\nvoid DefaultWorkFacade::setLockManager(SharedPtr<WorkLockManager> manager)\n{\n\tm_lockManager = manager;\n}\n\nvoid DefaultWorkFacade::setAccessPolicy(WorkAccessPolicy::Ptr policy)\n{\n\tm_accessPolicy = policy;\n}\n\nconst UserPolicyContext &DefaultWorkFacade::asUserContext(const PolicyContext &context) const\n{\n\tif (context.is<UserPolicyContext>())\n\t\treturn context.cast<UserPolicyContext>();\n\n\tthrow IllegalStateException(\"given an incompatible policy context\");\n}\n\nvoid DefaultWorkFacade::apply(Work::Ptr &work, const Work &data) const\n{\n\tWorkWriteGuard guard(m_lockManager->readWrite(work->id()));\n\n\tif (data.priority() < work->priority())\n\t\twork->setPriority(data.priority());\n}\n\nvoid DefaultWorkFacade::schedule(Work &work, const PolicyContext &context)\n{\n\tWork::Ptr p;\n\n\t{\n\t\tRWLock::ScopedWriteLock guard(m_lock);\n\n\t\tauto it = m_storage.find(work.id());\n\t\tif (it != m_storage.end()) {\n\t\t\tp = it->second;\n\n\t\t\tm_accessPolicy->assure(\n\t\t\t\tWorkAccessPolicy::ACTION_USER_SCHEDULE,\n\t\t\t\tcontext,\n\t\t\t\t*p\n\t\t\t);\n\n\t\t\tapply(p, work);\n\t\t}\n\t\telse {\n\t\t\tp = new Work(work);\n\t\t\tp->setOwner(asUserContext(context).user());\n\n\t\t\tm_accessPolicy->assure(\n\t\t\t\tWorkAccessPolicy::ACTION_USER_SCHEDULE,\n\t\t\t\tcontext,\n\t\t\t\t*p\n\t\t\t);\n\n\t\t\tm_storage.emplace(work.id(), p);\n\t\t}\n\t}\n\n\tm_scheduler->schedule(p);\n\n\tWorkReadGuard guard(m_lockManager->readOnly(work.id()));\n\twork = *p;\n}\n\nvoid DefaultWorkFacade::wakeup(Work &work, const PolicyContext &context)\n{\n\tWork::Ptr p;\n\n\t{\n\t\tRWLock::ScopedReadLock guard(m_lock);\n\n\t\tauto it = m_storage.find(work.id());\n\t\tif (it != m_storage.end())\n\t\t\tp = it->second;\n\t\telse\n\t\t\tthrow NotFoundException(\"no such work to wakeup: \" + work);\n\t}\n\n\t{\n\t\tWorkReadGuard guard(m_lockManager->readOnly(work.id()));\n\t\tm_accessPolicy->assure(\n\t\t\tWorkAccessPolicy::ACTION_USER_WAKEUP,\n\t\t\tcontext,\n\t\t\t*p\n\t\t);\n\t}\n\n\tm_scheduler->wakeup(p);\n\n\tWorkReadGuard guard(m_lockManager->readOnly(work.id()));\n\twork = *p;\n}\n\nvoid DefaultWorkFacade::cancel(Work &work, const PolicyContext &context)\n{\n\tWork::Ptr p;\n\n\t{\n\t\tRWLock::ScopedReadLock guard(m_lock);\n\n\t\tauto it = m_storage.find(work.id());\n\t\tif (it != m_storage.end())\n\t\t\tp = it->second;\n\t\telse\n\t\t\tthrow NotFoundException(\"no such work to cancel: \" + work);\n\t}\n\n\t{\n\t\tWorkReadGuard guard(m_lockManager->readOnly(work.id()));\n\t\tm_accessPolicy->assure(\n\t\t\tWorkAccessPolicy::ACTION_USER_CANCEL,\n\t\t\tcontext,\n\t\t\t*p\n\t\t);\n\t}\n\n\tm_scheduler->cancel(p);\n\n\tWorkReadGuard guard(m_lockManager->readOnly(work.id()));\n\twork = *p;\n}\n\nbool DefaultWorkFacade::fetch(Work &work, const PolicyContext &context)\n{\n\tRWLock::ScopedReadLock guard(m_lock);\n\n\tauto it = m_storage.find(work.id());\n\tif (it != m_storage.end()) {\n\t\tWorkReadGuard guard(m_lockManager->readOnly(work.id()));\n\t\tWork::Ptr p = it->second;\n\n\t\tm_accessPolicy->assure(\n\t\t\tWorkAccessPolicy::ACTION_USER_CANCEL,\n\t\t\tcontext,\n\t\t\t*p\n\t\t);\n\n\t\twork = *p;\n\t\treturn true;\n\t}\n\n\treturn false;\n}\n\nbool DefaultWorkFacade::remove(const Work &work, const PolicyContext &context)\n{\n\tRWLock::ScopedWriteLock guard(m_lock);\n\n\tauto it = m_storage.find(work.id());\n\tif (it != m_storage.end()) {\n\t\tWorkReadGuard guard(m_lockManager->readOnly(work.id()));\n\t\tWork::Ptr p = it->second;\n\n\t\tm_accessPolicy->assure(\n\t\t\tWorkAccessPolicy::ACTION_USER_REMOVE,\n\t\t\tcontext,\n\t\t\t*p\n\t\t);\n\n\t\tm_storage.erase(it);\n\t\treturn true;\n\t}\n\n\treturn false;\n}\n<commit_msg>DefaultWorkFacade: fix access policy action on fetch<commit_after>#include <Poco\/Exception.h>\n\n#include \"di\/Injectable.h\"\n#include \"policy\/PolicyContext.h\"\n#include \"work\/DefaultWorkFacade.h\"\n#include \"work\/WorkLockManager.h\"\n#include \"work\/WorkScheduler.h\"\n\nBEEEON_OBJECT_BEGIN(BeeeOn, DefaultWorkFacade)\nBEEEON_OBJECT_CASTABLE(WorkFacade)\nBEEEON_OBJECT_REF(\"scheduler\", &DefaultWorkFacade::setScheduler)\nBEEEON_OBJECT_REF(\"lockManager\", &DefaultWorkFacade::setLockManager)\nBEEEON_OBJECT_REF(\"accessPolicy\", &DefaultWorkFacade::setAccessPolicy)\nBEEEON_OBJECT_END(BeeeOn, DefaultWorkFacade)\n\nusing namespace Poco;\nusing namespace BeeeOn;\n\nDefaultWorkFacade::DefaultWorkFacade()\n{\n}\n\nvoid DefaultWorkFacade::setScheduler(WorkScheduler::Ptr scheduler)\n{\n\tm_scheduler = scheduler;\n}\n\nvoid DefaultWorkFacade::setLockManager(SharedPtr<WorkLockManager> manager)\n{\n\tm_lockManager = manager;\n}\n\nvoid DefaultWorkFacade::setAccessPolicy(WorkAccessPolicy::Ptr policy)\n{\n\tm_accessPolicy = policy;\n}\n\nconst UserPolicyContext &DefaultWorkFacade::asUserContext(const PolicyContext &context) const\n{\n\tif (context.is<UserPolicyContext>())\n\t\treturn context.cast<UserPolicyContext>();\n\n\tthrow IllegalStateException(\"given an incompatible policy context\");\n}\n\nvoid DefaultWorkFacade::apply(Work::Ptr &work, const Work &data) const\n{\n\tWorkWriteGuard guard(m_lockManager->readWrite(work->id()));\n\n\tif (data.priority() < work->priority())\n\t\twork->setPriority(data.priority());\n}\n\nvoid DefaultWorkFacade::schedule(Work &work, const PolicyContext &context)\n{\n\tWork::Ptr p;\n\n\t{\n\t\tRWLock::ScopedWriteLock guard(m_lock);\n\n\t\tauto it = m_storage.find(work.id());\n\t\tif (it != m_storage.end()) {\n\t\t\tp = it->second;\n\n\t\t\tm_accessPolicy->assure(\n\t\t\t\tWorkAccessPolicy::ACTION_USER_SCHEDULE,\n\t\t\t\tcontext,\n\t\t\t\t*p\n\t\t\t);\n\n\t\t\tapply(p, work);\n\t\t}\n\t\telse {\n\t\t\tp = new Work(work);\n\t\t\tp->setOwner(asUserContext(context).user());\n\n\t\t\tm_accessPolicy->assure(\n\t\t\t\tWorkAccessPolicy::ACTION_USER_SCHEDULE,\n\t\t\t\tcontext,\n\t\t\t\t*p\n\t\t\t);\n\n\t\t\tm_storage.emplace(work.id(), p);\n\t\t}\n\t}\n\n\tm_scheduler->schedule(p);\n\n\tWorkReadGuard guard(m_lockManager->readOnly(work.id()));\n\twork = *p;\n}\n\nvoid DefaultWorkFacade::wakeup(Work &work, const PolicyContext &context)\n{\n\tWork::Ptr p;\n\n\t{\n\t\tRWLock::ScopedReadLock guard(m_lock);\n\n\t\tauto it = m_storage.find(work.id());\n\t\tif (it != m_storage.end())\n\t\t\tp = it->second;\n\t\telse\n\t\t\tthrow NotFoundException(\"no such work to wakeup: \" + work);\n\t}\n\n\t{\n\t\tWorkReadGuard guard(m_lockManager->readOnly(work.id()));\n\t\tm_accessPolicy->assure(\n\t\t\tWorkAccessPolicy::ACTION_USER_WAKEUP,\n\t\t\tcontext,\n\t\t\t*p\n\t\t);\n\t}\n\n\tm_scheduler->wakeup(p);\n\n\tWorkReadGuard guard(m_lockManager->readOnly(work.id()));\n\twork = *p;\n}\n\nvoid DefaultWorkFacade::cancel(Work &work, const PolicyContext &context)\n{\n\tWork::Ptr p;\n\n\t{\n\t\tRWLock::ScopedReadLock guard(m_lock);\n\n\t\tauto it = m_storage.find(work.id());\n\t\tif (it != m_storage.end())\n\t\t\tp = it->second;\n\t\telse\n\t\t\tthrow NotFoundException(\"no such work to cancel: \" + work);\n\t}\n\n\t{\n\t\tWorkReadGuard guard(m_lockManager->readOnly(work.id()));\n\t\tm_accessPolicy->assure(\n\t\t\tWorkAccessPolicy::ACTION_USER_CANCEL,\n\t\t\tcontext,\n\t\t\t*p\n\t\t);\n\t}\n\n\tm_scheduler->cancel(p);\n\n\tWorkReadGuard guard(m_lockManager->readOnly(work.id()));\n\twork = *p;\n}\n\nbool DefaultWorkFacade::fetch(Work &work, const PolicyContext &context)\n{\n\tRWLock::ScopedReadLock guard(m_lock);\n\n\tauto it = m_storage.find(work.id());\n\tif (it != m_storage.end()) {\n\t\tWorkReadGuard guard(m_lockManager->readOnly(work.id()));\n\t\tWork::Ptr p = it->second;\n\n\t\tm_accessPolicy->assure(\n\t\t\tWorkAccessPolicy::ACTION_USER_GET,\n\t\t\tcontext,\n\t\t\t*p\n\t\t);\n\n\t\twork = *p;\n\t\treturn true;\n\t}\n\n\treturn false;\n}\n\nbool DefaultWorkFacade::remove(const Work &work, const PolicyContext &context)\n{\n\tRWLock::ScopedWriteLock guard(m_lock);\n\n\tauto it = m_storage.find(work.id());\n\tif (it != m_storage.end()) {\n\t\tWorkReadGuard guard(m_lockManager->readOnly(work.id()));\n\t\tWork::Ptr p = it->second;\n\n\t\tm_accessPolicy->assure(\n\t\t\tWorkAccessPolicy::ACTION_USER_REMOVE,\n\t\t\tcontext,\n\t\t\t*p\n\t\t);\n\n\t\tm_storage.erase(it);\n\t\treturn true;\n\t}\n\n\treturn false;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"HGUNeuralNetwork.h\"\n#include \"HGULayer.h\"\n\nint main(int argc, char const *argv[]) {\n    float input[4][2] = { { 0, 0 },\n                          { 0, 1 },\n                          { 1, 0 },\n                          { 1, 1 } };\n\n    short DesiredOutput[4][2] = { { 0 },\n                                  { 1 },\n                                  { 1 },\n                                  { 0 } };\n\n\n    dlop::HGUNeuralNetwork my_Neuralnet(2);\n\n    my_Neuralnet.AllocEachLayer(0, 2, 4);\n\n    my_Neuralnet.AllocEachLayer(1, 4, 1);\n\n    for (int i = 0; i < 1000000; i++) {\n        std::cout << \"count: \" << i << '\\n';\n\n        my_Neuralnet.ComputeGradient(input[i % 4], DesiredOutput[i % 4]);\n\n        my_Neuralnet.UpdateWeight(0.3);\n    }\n\n    std::cout << \"Result: \" << '\\n';\n\n    my_Neuralnet.GetResult(input[0]);\n    my_Neuralnet.GetResult(input[1]);\n    my_Neuralnet.GetResult(input[2]);\n    my_Neuralnet.GetResult(input[3]);\n\n    std::cout << \"-----------FINISH-----------\" << '\\n';\n\n    return 0;\n}\n<commit_msg>modified : main cpp add annotation work<commit_after>#include \"HGUNeuralNetwork.h\"\n#include \"HGULayer.h\"\n\nint main(int argc, char const *argv[]) {\n    \/\/ 학습 데이터 준비\n    float input[4][2] = { { 0, 0 },\n                          { 0, 1 },\n                          { 1, 0 },\n                          { 1, 1 } };\n\n    short DesiredOutput[4][2] = { { 0 },\n                                  { 1 },\n                                  { 1 },\n                                  { 0 } };\n\n    \/\/ 모델 정의 (Layer 개수)\n    dlop::HGUNeuralNetwork my_Neuralnet(2);\n\n    \/\/ 각 Layer 정의 (node 개수)\n    my_Neuralnet.AllocEachLayer(0, 2, 4);\n\n    my_Neuralnet.AllocEachLayer(1, 4, 1);\n\n    \/\/ 학습 전 상태 확인\n    std::cout << \"Initial: \" << '\\n';\n\n    my_Neuralnet.GetResult(input[0]);\n    my_Neuralnet.GetResult(input[1]);\n    my_Neuralnet.GetResult(input[2]);\n    my_Neuralnet.GetResult(input[3]);\n\n    \/\/ 학습 정의\n    for (int i = 0; i < 1000000; i++) {\n        my_Neuralnet.ComputeGradient(input[i % 4], DesiredOutput[i % 4]);\n\n        if (i % 100 == 99) {\n            \/\/ std::cout << \"count: \" << i << '\\n';\n            my_Neuralnet.UpdateWeight(0.3);\n        }\n    }\n\n    \/\/ 학습 후 결과 확인\n    std::cout << \"Result: \" << '\\n';\n\n    my_Neuralnet.GetResult(input[0]);\n    my_Neuralnet.GetResult(input[1]);\n    my_Neuralnet.GetResult(input[2]);\n    my_Neuralnet.GetResult(input[3]);\n\n    std::cout << \"-----------FINISH-----------\" << '\\n';\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"protocol.h\"\n\nProtocol::Protocol() : floodThrottle(true), nextID(0) {}\n\nvoid Protocol::connectServer() {\n\tLogManager* logger = LogManager::getHandle();\n\tlogger->log(LOG_DEBUG, \"protocol-client-connect-\" + serverName, \"Connecting to \" + serverName + \" ...\");\n\tConfig* config = Config::getHandle();\n\tstd::unordered_map<std::string, std::string> configBlock = config->getSingleBlockOnConditions(\"server\", std::unordered_map<std::string, std::string> { { \"name\", serverName } });\n\tserverAddress = configBlock[\"address\"];\n\tserverPort = configBlock[\"port\"];\n\tserverBindAddr = configBlock[\"bind\"];\n\tfloodThrottle = Config::makeBool(configBlock[\"floodthrottle\"]);\n\tif (serverAddress.empty() || serverPort.empty()) {\n\t\tlogger->log(LOG_ERROR, \"protocol-client-connect-\" + serverName, \"Cannot connect to \" + serverName + \" because the configuration is incomplete or invalid.\");\n\t\tthrow ServerBadConfiguration ();\n\t}\n\tstd::list<std::unordered_map<std::string, std::string>> clientConfigs = config->getBlocksOnConditions(\"client\", std::unordered_map<std::string, std::string> { { \"server\", serverName } });\n\tfor (auto clientConf : clientConfigs) {\n\t\tstd::string nick (clientConf[\"nick\"]);\n\t\tstd::string ident (clientConf[\"ident\"]);\n\t\tstd::string gecos (clientConf[\"gecos\"]);\n\t\tstd::string password (clientConf[\"password\"]);\n\t\tstd::string socket (clientConf[\"socket\"]);\n\t\tif (nick.empty() || ident.empty() || gecos.empty() || socket.empty()) {\n\t\t\tlogger->log(LOG_ERROR, \"protocol-client-connect-\" + serverName, \"An improperly configured client was encountered.  Client not added.\");\n\t\t\tcontinue;\n\t\t}\n\t\tstd::string id (clientConf[\"id\"]);\n\t\tif (id.empty()) {\n\t\t\twhile (users.find(id) != users.end())\n\t\t\t\tid = getNextID();\n\t\t}\n\t\tstd::shared_ptr<Client> newClient (new Client (std::move(id), std::move(nick), std::move(ident), std::move(gecos), std::move(password), std::move(socket), this));\n\t\tclients.insert(std::pair<std::string, std::shared_ptr<Client>> (id, newClient));\n\t\tusers.insert(std::pair<std::string, std::shared_ptr<User>> (id, static_cast<std::shared_ptr<User>>(newClient)));\n\t}\n}\n\nbool Protocol::connected() {\n\tbool connectedClientsExist = false;\n\tstd::list<std::string> removeClients;\n\tfor (auto client : clients) {\n\t\tif (client.second->checkConnection())\n\t\t\tconnectedClientsExist = true;\n\t\telse if (client.second->wantsToReconnect())\n\t\t\tclient.second->doReconnect();\n\t\telse\n\t\t\tremoveClients.push_back(client.first);\n\t}\n\tfor (auto clientID : removeClients) {\n\t\tclients.erase(clientID);\n\t\tauto clientUser = users.find(clientID);\n\t\tif (clientUser != users.end())\n\t\t\tusers.erase(clientUser);\n\t}\n\treturn connectedClientsExist;\n}\n\nbool Protocol::shouldUnload() {\n\treturn clients.empty();\n}\n\nvoid Protocol::disconnect(const std::string& reason) {\n\tLogManager* logger = LogManager::getHandle();\n\tlogger->log(LOG_DEFAULT, \"protocol-client-connection-\" + serverName, \"Disconnecting all clients\");\n\tfor (auto client : clients)\n\t\tclient.second->disconnect(reason);\n}\n\nvoid Protocol::onRehash() {\n\tConfig* config = Config::getHandle();\n\tstd::unordered_map<std::string, std::string> configBlock = config->getSingleBlockOnConditions(\"server\", std::unordered_map<std::string, std::string> { { \"name\", serverName } });\n\tbool newFloodThrottle = Config::makeBool(configBlock[\"floodthrottle\"]);\n\tif (newFloodThrottle != floodThrottle) {\n\t\tfloodThrottle = newFloodThrottle;\n\t\tif (floodThrottle) {\n\t\t\tfor (auto client : clients)\n\t\t\t\tclient.second->startFloodThrottle();\n\t\t} else {\n\t\t\tfor (auto client : clients)\n\t\t\t\tclient.second->endFloodThrottle();\n\t\t}\n\t}\n}\n\nvoid Protocol::sendMsg(const std::string& client, const std::string& target, const std::string& message, const std::map<std::string, std::string>& tags) {\n\tauto clientIter = clients.find(client);\n\tif (clientIter == clients.end())\n\t\treturn;\n\tIRCMessage msg (\"PRIVMSG\");\n\tmsg.setParams(std::vector<std::string> (2));\n\tmsg.setParam(0, convertCommaSeparatedTargetList(target));\n\tauto tagIter = tags.find(\"intents\");\n\tif (tagIter == tags.end() || capabilities.find(\"intents\") != capabilities.end()) {\n\t\tmsg.setParam(1, message);\n\t\tmsg.setTags(tags);\n\t} else {\n\t\tstd::map<std::string, std::string> newTags (tags);\n\t\tnewTags.erase(\"intents\");\n\t\tmsg.setTags(newTags);\n\t\tmsg.setParam(1, \"\\x01\" + tagIter->second + \" \" + message + \"\\x01\");\n\t}\n\tclientIter->second->sendLine(&msg);\n}\n\nvoid Protocol::sendNotice(const std::string& client, const std::string& target, const std::string& message, const std::map<std::string, std::string>& tags) {\n\tauto clientIter = clients.find(client);\n\tif (clientIter == clients.end())\n\t\treturn;\n\tIRCMessage msg (\"NOTICE\");\n\tmsg.setParams(std::vector<std::string> (2));\n\tmsg.setParam(0, convertCommaSeparatedTargetList(target));\n\tauto tagIter = tags.find(\"intents\");\n\tif (tagIter == tags.end() || capabilities.find(\"intents\") != capabilities.end()) {\n\t\tmsg.setParam(1, message);\n\t\tmsg.setTags(tags);\n\t} else {\n\t\tstd::map<std::string, std::string> newTags (tags);\n\t\tnewTags.erase(\"intents\");\n\t\tmsg.setTags(newTags);\n\t\tmsg.setParam(1, \"\\x01\" + tagIter->second + \" \" + message + \"\\x01\");\n\t}\n\tclientIter->second->sendLine(&msg);\n}\n\nvoid Protocol::setMode(const std::string& client, const std::string& target, const std::list<std::tuple<bool, std::string, std::string>>& modes, const std::map<std::string, std::string>& tags) {\n\t\n}\n\nvoid Protocol::joinChan(const std::string& client, const std::string& channel, const std::map<std::string, std::string>& tags) {\n\t\n}\n\nvoid Protocol::joinChan(const std::string& client, const std::string& channel, const std::string& key, const std::map<std::string, std::string>& tags) {\n\t\n}\n\nvoid Protocol::partChan(const std::string& client, const std::string& channel, const std::string& reason, const std::map<std::string, std::string>& tags) {\n\t\n}\n\nvoid Protocol::kickUser(const std::string& client, const std::string& channel, const std::string& user, const std::string& reason, const std::map<std::string, std::string>& tags) {\n\t\n}\n\nvoid Protocol::setTopic(const std::string& client, const std::string& channel, const std::string& topic, const std::map<std::string, std::string>& tags) {\n\t\n}\n\nvoid Protocol::inviteUser(const std::string& client, const std::string& channel, const std::string& user, const std::map<std::string, std::string>& tags) {\n\t\n}\n\nvoid Protocol::knock(const std::string& client, const std::string& channel, const std::string& reason, const std::map<std::string, std::string>& tags) {\n\t\n}\n\nvoid Protocol::changeNick(const std::string& client, const std::string& newNick, const std::map<std::string, std::string>& tags) {\n\t\n}\n\nvoid Protocol::sendPing(const std::string& client, const std::string& data, const std::map<std::string, std::string>& tags) {\n\t\n}\n\nvoid Protocol::setAway(const std::string& client, const std::string& reason, const std::map<std::string, std::string>& tags) {\n\t\n}\n\nvoid Protocol::setUnaway(const std::string& client, const std::map<std::string, std::string>& tags) {\n\t\n}\n\nvoid Protocol::oper(const std::string& client, const std::string& username, const std::string& password, const std::map<std::string, std::string>& tags) {\n\t\n}\n\nvoid Protocol::sendWallops(const std::string& client, const std::string& message, const std::map<std::string, std::string>& tags) {\n\t\n}\n\nvoid Protocol::sendOtherData(const std::string& client, const IRCMessage* line) {\n\t\n}\n\nstd::string Protocol::addClient(const std::string& nick, const std::string& ident, const std::string& gecos) {\n\t\n}\n\nvoid Protocol::removeClient(const std::string& client) {\n\t\n}\n\nstd::set<std::string> Protocol::serverCapabilities() {\n\t\n}\n\nstd::set<char> Protocol::chanTypes() {\n\t\n}\n\nstd::list<std::pair<ModeType, std::string>> Protocol::allChanModes() {\n\t\n}\n\nModeType Protocol::chanModeType(const std::string& mode) {\n\t\n}\n\nchar Protocol::prefixSymbol(const std::string& mode) {\n\t\n}\n\nstd::pair<std::string, char> Protocol::compareStatus(const std::string& status0, const std::string& status1) {\n\t\n}\n\nstd::pair<std::string, char> Protocol::compareStatus(const std::string& status0, char status1) {\n\t\n}\n\nstd::pair<std::string, char> Protocol::compareStatus(char status0, char status1) {\n\t\n}\n\nstd::string Protocol::chanTopic(const std::string& channel) {\n\t\n}\n\nstd::string Protocol::chanTopicSetter(const std::string& channel) {\n\t\n}\n\ntime_t Protocol::chanTopicTimestamp(const std::string& channel) {\n\t\n}\n\ntime_t Protocol::chanTimestamp(const std::string& channel) {\n\t\n}\n\nstd::list<std::string> Protocol::chanUsers(const std::string& channel) {\n\t\n}\n\nbool Protocol::userInChan(const std::string& channel, const std::string& user) {\n\t\n}\n\nstd::pair<std::string, char> Protocol::userStatus(const std::string& channel, const std::string& user) {\n\t\n}\n\nbool Protocol::userHasStatus(const std::string& channel, const std::string& user, const std::string& status) {\n\t\n}\n\nbool Protocol::userHasStatus(const std::string& channel, const std::string& user, char status) {\n\t\n}\n\nbool Protocol::userHasStatusOrGreater(const std::string& channel, const std::string& user, const std::string& status) {\n\t\n}\n\nbool Protocol::userHasStatusOrGreater(const std::string& channel, const std::string& user, char status) {\n\t\n}\n\nstd::map<std::string, std::string> Protocol::chanModes(const std::string& channel) {\n\t\n}\n\nbool Protocol::chanHasMode(const std::string& channel, const std::string& mode) {\n\t\n}\n\nstd::string Protocol::chanModeParam(const std::string& channel, const std::string& mode) {\n\t\n}\n\nstd::list<std::string> Protocol::chanListModeList(const std::string& channel, const std::string& mode) {\n\t\n}\n\nstd::list<std::string> Protocol::clientList() {\n\t\n}\n\nstd::string Protocol::userNick(const std::string& user) {\n\t\n}\n\nstd::string Protocol::userIdent(const std::string& user) {\n\t\n}\n\nstd::string Protocol::userHost(const std::string& user) {\n\t\n}\n\nstd::string Protocol::userGecos(const std::string& user) {\n\t\n}\n\nstd::string Protocol::idFromNick(const std::string& nick) {\n\t\n}\n\nstd::list<std::pair<ModeType, std::string>> Protocol::allUserModes() {\n\t\n}\n\nModeType Protocol::userModeType(const std::string& mode) {\n\t\n}\n\nstd::map<std::string, std::string> Protocol::userModes(const std::string& user) {\n\t\n}\n\nbool Protocol::userHasMode(const std::string& user, const std::string& mode) {\n\t\n}\n\nstd::string Protocol::userModeParam(const std::string& user, const std::string& mode) {\n\t\n}\n\nstd::list<std::string> Protocol::userListModeList(const std::string& user, const std::string& listMode) {\n\t\n}\n\nstd::set<std::string> Protocol::userChans(const std::string& user) {\n\t\n}\n\nstd::string Protocol::servName() {\n\treturn serverName;\n}\n\nstd::shared_ptr<Socket> Protocol::obtainSocket(const std::string& sockType) {\n\treturn assignSocket(sockType);\n}\n\nvoid Protocol::connectSocket(const std::shared_ptr<Socket> sock) {\n\tsock->connectServer(serverAddress, serverPort, serverBindAddr);\n}\n\nbool Protocol::floodThrottleInEffect() {\n\treturn floodThrottle;\n}\n\nvoid Protocol::processIncoming(const std::string& client, const IRCMessage* message) {\n\tMutexLocker mutexLock (&processMutex);\n\t\/\/ TODO: the rest of this\n}\n\nstd::string Protocol::getNextID() {\n\tstd::ostringstream currID;\n\tcurrID << nextID;\n\tnextID++;\n\treturn currID.str();\n}\n\nstd::string Protocol::convertCommaSeparatedTargetList(std::string targets) {\n\tstd::list<std::string> targetList;\n\twhile (!targets.empty()) {\n\t\tsize_t commaPos = targets.find(',');\n\t\ttargetList.push_back(targets.substr(0, commaPos));\n\t\tif (commaPos == std::string::npos)\n\t\t\ttargets.clear();\n\t\telse\n\t\t\ttargets = targets.substr(commaPos + 1);\n\t}\n\tfor (std::string oneTarget : targetList) {\n\t\tauto userIter = users.find(oneTarget);\n\t\tif (userIter != users.end())\n\t\t\ttargets += \",\" + userIter->second.nick();\n\t\telse\n\t\t\ttargets += \",\" + oneTarget;\n\t}\n\treturn targets.substr(1);\n}<commit_msg>Implement mode changes<commit_after>#include \"protocol.h\"\n\nProtocol::Protocol() : floodThrottle(true), nextID(0) {}\n\nvoid Protocol::connectServer() {\n\tLogManager* logger = LogManager::getHandle();\n\tlogger->log(LOG_DEBUG, \"protocol-client-connect-\" + serverName, \"Connecting to \" + serverName + \" ...\");\n\tConfig* config = Config::getHandle();\n\tstd::unordered_map<std::string, std::string> configBlock = config->getSingleBlockOnConditions(\"server\", std::unordered_map<std::string, std::string> { { \"name\", serverName } });\n\tserverAddress = configBlock[\"address\"];\n\tserverPort = configBlock[\"port\"];\n\tserverBindAddr = configBlock[\"bind\"];\n\tfloodThrottle = Config::makeBool(configBlock[\"floodthrottle\"]);\n\tif (serverAddress.empty() || serverPort.empty()) {\n\t\tlogger->log(LOG_ERROR, \"protocol-client-connect-\" + serverName, \"Cannot connect to \" + serverName + \" because the configuration is incomplete or invalid.\");\n\t\tthrow ServerBadConfiguration ();\n\t}\n\tstd::list<std::unordered_map<std::string, std::string>> clientConfigs = config->getBlocksOnConditions(\"client\", std::unordered_map<std::string, std::string> { { \"server\", serverName } });\n\tfor (auto clientConf : clientConfigs) {\n\t\tstd::string nick (clientConf[\"nick\"]);\n\t\tstd::string ident (clientConf[\"ident\"]);\n\t\tstd::string gecos (clientConf[\"gecos\"]);\n\t\tstd::string password (clientConf[\"password\"]);\n\t\tstd::string socket (clientConf[\"socket\"]);\n\t\tif (nick.empty() || ident.empty() || gecos.empty() || socket.empty()) {\n\t\t\tlogger->log(LOG_ERROR, \"protocol-client-connect-\" + serverName, \"An improperly configured client was encountered.  Client not added.\");\n\t\t\tcontinue;\n\t\t}\n\t\tstd::string id (clientConf[\"id\"]);\n\t\tif (id.empty()) {\n\t\t\twhile (users.find(id) != users.end())\n\t\t\t\tid = getNextID();\n\t\t}\n\t\tstd::shared_ptr<Client> newClient (new Client (std::move(id), std::move(nick), std::move(ident), std::move(gecos), std::move(password), std::move(socket), this));\n\t\tclients.insert(std::pair<std::string, std::shared_ptr<Client>> (id, newClient));\n\t\tusers.insert(std::pair<std::string, std::shared_ptr<User>> (id, static_cast<std::shared_ptr<User>>(newClient)));\n\t}\n}\n\nbool Protocol::connected() {\n\tbool connectedClientsExist = false;\n\tstd::list<std::string> removeClients;\n\tfor (auto client : clients) {\n\t\tif (client.second->checkConnection())\n\t\t\tconnectedClientsExist = true;\n\t\telse if (client.second->wantsToReconnect())\n\t\t\tclient.second->doReconnect();\n\t\telse\n\t\t\tremoveClients.push_back(client.first);\n\t}\n\tfor (auto clientID : removeClients) {\n\t\tclients.erase(clientID);\n\t\tauto clientUser = users.find(clientID);\n\t\tif (clientUser != users.end())\n\t\t\tusers.erase(clientUser);\n\t}\n\treturn connectedClientsExist;\n}\n\nbool Protocol::shouldUnload() {\n\treturn clients.empty();\n}\n\nvoid Protocol::disconnect(const std::string& reason) {\n\tLogManager* logger = LogManager::getHandle();\n\tlogger->log(LOG_DEFAULT, \"protocol-client-connection-\" + serverName, \"Disconnecting all clients\");\n\tfor (auto client : clients)\n\t\tclient.second->disconnect(reason);\n}\n\nvoid Protocol::onRehash() {\n\tConfig* config = Config::getHandle();\n\tstd::unordered_map<std::string, std::string> configBlock = config->getSingleBlockOnConditions(\"server\", std::unordered_map<std::string, std::string> { { \"name\", serverName } });\n\tbool newFloodThrottle = Config::makeBool(configBlock[\"floodthrottle\"]);\n\tif (newFloodThrottle != floodThrottle) {\n\t\tfloodThrottle = newFloodThrottle;\n\t\tif (floodThrottle) {\n\t\t\tfor (auto client : clients)\n\t\t\t\tclient.second->startFloodThrottle();\n\t\t} else {\n\t\t\tfor (auto client : clients)\n\t\t\t\tclient.second->endFloodThrottle();\n\t\t}\n\t}\n}\n\nvoid Protocol::sendMsg(const std::string& client, const std::string& target, const std::string& message, const std::map<std::string, std::string>& tags) {\n\tauto clientIter = clients.find(client);\n\tif (clientIter == clients.end())\n\t\treturn;\n\tIRCMessage msg (\"PRIVMSG\");\n\tmsg.setParams(std::vector<std::string> (2));\n\tmsg.setParam(0, convertCommaSeparatedTargetList(target));\n\tauto tagIter = tags.find(\"intents\");\n\tif (tagIter == tags.end() || capabilities.find(\"intents\") != capabilities.end()) {\n\t\tmsg.setParam(1, message);\n\t\tmsg.setTags(tags);\n\t} else {\n\t\tstd::map<std::string, std::string> newTags (tags);\n\t\tnewTags.erase(\"intents\");\n\t\tmsg.setTags(newTags);\n\t\tmsg.setParam(1, \"\\x01\" + tagIter->second + \" \" + message + \"\\x01\");\n\t}\n\tclientIter->second->sendLine(&msg);\n}\n\nvoid Protocol::sendNotice(const std::string& client, const std::string& target, const std::string& message, const std::map<std::string, std::string>& tags) {\n\tauto clientIter = clients.find(client);\n\tif (clientIter == clients.end())\n\t\treturn;\n\tIRCMessage msg (\"NOTICE\");\n\tmsg.setParams(std::vector<std::string> (2));\n\tmsg.setParam(0, convertCommaSeparatedTargetList(target));\n\tauto tagIter = tags.find(\"intents\");\n\tif (tagIter == tags.end() || capabilities.find(\"intents\") != capabilities.end()) {\n\t\tmsg.setParam(1, message);\n\t\tmsg.setTags(tags);\n\t} else {\n\t\tstd::map<std::string, std::string> newTags (tags);\n\t\tnewTags.erase(\"intents\");\n\t\tmsg.setTags(newTags);\n\t\tmsg.setParam(1, \"\\x01\" + tagIter->second + \" \" + message + \"\\x01\");\n\t}\n\tclientIter->second->sendLine(&msg);\n}\n\nvoid Protocol::setMode(const std::string& client, const std::string& target, const std::list<std::tuple<bool, std::string, std::string>>& modes, const std::map<std::string, std::string>& tags) {\n\tauto clientIter = clients.find(client);\n\tif (clientIter == clients.end())\n\t\treturn;\n\tIRCMessage msg (\"MODE\");\n\tstd::vector<std::string> modeParams;\n\tbool adding = std::get<0>(modes.front());\n\tstd::string modeStr = (adding ? \"+\" : \"-\");\n\tfor (auto mode : modes) {\n\t\tif (std::get<0>(mode) != adding) {\n\t\t\tadding = std::get<0>(mode);\n\t\t\tmodeStr += (adding ? \"+\" : \"-\");\n\t\t}\n\t\tmodeStr += std::get<1>(mode);\n\t\tstd::string param (std::get<2>(mode));\n\t\tif (!param.empty())\n\t\t\tmodeParams.push_back(param);\n\t}\n\tstd::vector<std::string> cmdParams { target };\n\tcmdParams.reserve(2 + modeParams.size());\n\tcmdParams.push_back(modeStr);\n\tfor (auto param : modeParams)\n\t\tcmdParams.push_back(param);\n\tmsg.setParams(cmdParams);\n\tmsg.setTags(tags);\n\tclientIter->second->sendLine(&msg);\n}\n\nvoid Protocol::joinChan(const std::string& client, const std::string& channel, const std::map<std::string, std::string>& tags) {\n\t\n}\n\nvoid Protocol::joinChan(const std::string& client, const std::string& channel, const std::string& key, const std::map<std::string, std::string>& tags) {\n\t\n}\n\nvoid Protocol::partChan(const std::string& client, const std::string& channel, const std::string& reason, const std::map<std::string, std::string>& tags) {\n\t\n}\n\nvoid Protocol::kickUser(const std::string& client, const std::string& channel, const std::string& user, const std::string& reason, const std::map<std::string, std::string>& tags) {\n\t\n}\n\nvoid Protocol::setTopic(const std::string& client, const std::string& channel, const std::string& topic, const std::map<std::string, std::string>& tags) {\n\t\n}\n\nvoid Protocol::inviteUser(const std::string& client, const std::string& channel, const std::string& user, const std::map<std::string, std::string>& tags) {\n\t\n}\n\nvoid Protocol::knock(const std::string& client, const std::string& channel, const std::string& reason, const std::map<std::string, std::string>& tags) {\n\t\n}\n\nvoid Protocol::changeNick(const std::string& client, const std::string& newNick, const std::map<std::string, std::string>& tags) {\n\t\n}\n\nvoid Protocol::sendPing(const std::string& client, const std::string& data, const std::map<std::string, std::string>& tags) {\n\t\n}\n\nvoid Protocol::setAway(const std::string& client, const std::string& reason, const std::map<std::string, std::string>& tags) {\n\t\n}\n\nvoid Protocol::setUnaway(const std::string& client, const std::map<std::string, std::string>& tags) {\n\t\n}\n\nvoid Protocol::oper(const std::string& client, const std::string& username, const std::string& password, const std::map<std::string, std::string>& tags) {\n\t\n}\n\nvoid Protocol::sendWallops(const std::string& client, const std::string& message, const std::map<std::string, std::string>& tags) {\n\t\n}\n\nvoid Protocol::sendOtherData(const std::string& client, const IRCMessage* line) {\n\t\n}\n\nstd::string Protocol::addClient(const std::string& nick, const std::string& ident, const std::string& gecos) {\n\t\n}\n\nvoid Protocol::removeClient(const std::string& client) {\n\t\n}\n\nstd::set<std::string> Protocol::serverCapabilities() {\n\t\n}\n\nstd::set<char> Protocol::chanTypes() {\n\t\n}\n\nstd::list<std::pair<ModeType, std::string>> Protocol::allChanModes() {\n\t\n}\n\nModeType Protocol::chanModeType(const std::string& mode) {\n\t\n}\n\nchar Protocol::prefixSymbol(const std::string& mode) {\n\t\n}\n\nstd::pair<std::string, char> Protocol::compareStatus(const std::string& status0, const std::string& status1) {\n\t\n}\n\nstd::pair<std::string, char> Protocol::compareStatus(const std::string& status0, char status1) {\n\t\n}\n\nstd::pair<std::string, char> Protocol::compareStatus(char status0, char status1) {\n\t\n}\n\nstd::string Protocol::chanTopic(const std::string& channel) {\n\t\n}\n\nstd::string Protocol::chanTopicSetter(const std::string& channel) {\n\t\n}\n\ntime_t Protocol::chanTopicTimestamp(const std::string& channel) {\n\t\n}\n\ntime_t Protocol::chanTimestamp(const std::string& channel) {\n\t\n}\n\nstd::list<std::string> Protocol::chanUsers(const std::string& channel) {\n\t\n}\n\nbool Protocol::userInChan(const std::string& channel, const std::string& user) {\n\t\n}\n\nstd::pair<std::string, char> Protocol::userStatus(const std::string& channel, const std::string& user) {\n\t\n}\n\nbool Protocol::userHasStatus(const std::string& channel, const std::string& user, const std::string& status) {\n\t\n}\n\nbool Protocol::userHasStatus(const std::string& channel, const std::string& user, char status) {\n\t\n}\n\nbool Protocol::userHasStatusOrGreater(const std::string& channel, const std::string& user, const std::string& status) {\n\t\n}\n\nbool Protocol::userHasStatusOrGreater(const std::string& channel, const std::string& user, char status) {\n\t\n}\n\nstd::map<std::string, std::string> Protocol::chanModes(const std::string& channel) {\n\t\n}\n\nbool Protocol::chanHasMode(const std::string& channel, const std::string& mode) {\n\t\n}\n\nstd::string Protocol::chanModeParam(const std::string& channel, const std::string& mode) {\n\t\n}\n\nstd::list<std::string> Protocol::chanListModeList(const std::string& channel, const std::string& mode) {\n\t\n}\n\nstd::list<std::string> Protocol::clientList() {\n\t\n}\n\nstd::string Protocol::userNick(const std::string& user) {\n\t\n}\n\nstd::string Protocol::userIdent(const std::string& user) {\n\t\n}\n\nstd::string Protocol::userHost(const std::string& user) {\n\t\n}\n\nstd::string Protocol::userGecos(const std::string& user) {\n\t\n}\n\nstd::string Protocol::idFromNick(const std::string& nick) {\n\t\n}\n\nstd::list<std::pair<ModeType, std::string>> Protocol::allUserModes() {\n\t\n}\n\nModeType Protocol::userModeType(const std::string& mode) {\n\t\n}\n\nstd::map<std::string, std::string> Protocol::userModes(const std::string& user) {\n\t\n}\n\nbool Protocol::userHasMode(const std::string& user, const std::string& mode) {\n\t\n}\n\nstd::string Protocol::userModeParam(const std::string& user, const std::string& mode) {\n\t\n}\n\nstd::list<std::string> Protocol::userListModeList(const std::string& user, const std::string& listMode) {\n\t\n}\n\nstd::set<std::string> Protocol::userChans(const std::string& user) {\n\t\n}\n\nstd::string Protocol::servName() {\n\treturn serverName;\n}\n\nstd::shared_ptr<Socket> Protocol::obtainSocket(const std::string& sockType) {\n\treturn assignSocket(sockType);\n}\n\nvoid Protocol::connectSocket(const std::shared_ptr<Socket> sock) {\n\tsock->connectServer(serverAddress, serverPort, serverBindAddr);\n}\n\nbool Protocol::floodThrottleInEffect() {\n\treturn floodThrottle;\n}\n\nvoid Protocol::processIncoming(const std::string& client, const IRCMessage* message) {\n\tMutexLocker mutexLock (&processMutex);\n\t\/\/ TODO: the rest of this\n}\n\nstd::string Protocol::getNextID() {\n\tstd::ostringstream currID;\n\tcurrID << nextID;\n\tnextID++;\n\treturn currID.str();\n}\n\nstd::string Protocol::convertCommaSeparatedTargetList(std::string targets) {\n\tstd::list<std::string> targetList;\n\twhile (!targets.empty()) {\n\t\tsize_t commaPos = targets.find(',');\n\t\ttargetList.push_back(targets.substr(0, commaPos));\n\t\tif (commaPos == std::string::npos)\n\t\t\ttargets.clear();\n\t\telse\n\t\t\ttargets = targets.substr(commaPos + 1);\n\t}\n\tfor (std::string oneTarget : targetList) {\n\t\tauto userIter = users.find(oneTarget);\n\t\tif (userIter != users.end())\n\t\t\ttargets += \",\" + userIter->second.nick();\n\t\telse\n\t\t\ttargets += \",\" + oneTarget;\n\t}\n\treturn targets.substr(1);\n}<|endoftext|>"}
{"text":"<commit_before>\/\/ ======================================================================== \/\/\n\/\/ Copyright 2009-2018 Intel Corporation                                    \/\/\n\/\/                                                                          \/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");          \/\/\n\/\/ you may not use this file except in compliance with the License.         \/\/\n\/\/ You may obtain a copy of the License at                                  \/\/\n\/\/                                                                          \/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0                           \/\/\n\/\/                                                                          \/\/\n\/\/ Unless required by applicable law or agreed to in writing, software      \/\/\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,        \/\/\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. \/\/\n\/\/ See the License for the specific language governing permissions and      \/\/\n\/\/ limitations under the License.                                           \/\/\n\/\/ ======================================================================== \/\/\n\n#include \"..\/common\/Data.h\"\n#include \"Importer.h\"\n\n#include <random>\n\nnamespace ospray {\n  namespace sg {\n\n    void generateBasicVolume(const std::shared_ptr<Node> &world,\n                               const std::vector<string_pair> &params)\n    {\n      auto volume_node = createNode(\"basic_volume\", \"StructuredVolume\");\n\n      \/\/ get generator parameters\n\n      vec3i dims(100, 100, 100);\n\n#if 0\n      int numSpheres = 1e6;\n      float radius   = 0.002f;\n\n      for (auto &p : params) {\n        if (p.first == \"numSpheres\")\n          numSpheres = std::atoi(p.second.c_str());\n        else if (p.first == \"radius\")\n          radius = std::atof(p.second.c_str());\n        else {\n          std::cout << \"WARNING: unknown spheres generator parameter '\"\n                    << p.first << \"' with value '\" << p.second << \"'\"\n                    << std::endl;\n        }\n      }\n#else\n      (void)params;\n#endif\n\n      \/\/ generate volume data\n\n      auto numVoxels = dims.product();\n\n      float *voxels = new float[numVoxels];\n\n      for (int i = 0; i < numVoxels; ++i)\n        voxels[i] = float(i);\n\n      \/\/ create data nodes\n\n      auto voxel_data = std::make_shared<DataArray1f>(voxels, numVoxels);\n\n      voxel_data->setName(\"voxelData\");\n\n      volume_node->add(voxel_data);\n\n      \/\/ volume attributes\n\n      volume_node->child(\"voxelType\")  = std::string(\"float\");\n      volume_node->child(\"dimensions\") = dims;\n\n      \/\/ add volume to world\n\n      world->add(volume_node);\n    }\n\n    OSPSG_REGISTER_GENERATE_FUNCTION(generateBasicVolume, basic_volume);\n    OSPSG_REGISTER_GENERATE_FUNCTION(generateBasicVolume, volume);\n\n  }  \/\/ ::ospray::sg\n}  \/\/ ::ospray\n<commit_msg>make basic volume generator dimensions configurable<commit_after>\/\/ ======================================================================== \/\/\n\/\/ Copyright 2009-2018 Intel Corporation                                    \/\/\n\/\/                                                                          \/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");          \/\/\n\/\/ you may not use this file except in compliance with the License.         \/\/\n\/\/ You may obtain a copy of the License at                                  \/\/\n\/\/                                                                          \/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0                           \/\/\n\/\/                                                                          \/\/\n\/\/ Unless required by applicable law or agreed to in writing, software      \/\/\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,        \/\/\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. \/\/\n\/\/ See the License for the specific language governing permissions and      \/\/\n\/\/ limitations under the License.                                           \/\/\n\/\/ ======================================================================== \/\/\n\n\/\/ ospcommon\n#include \"ospcommon\/tasking\/parallel_for.h\"\n#include \"ospcommon\/utility\/StringManip.h\"\n\/\/ sg\n#include \"..\/common\/Data.h\"\n#include \"Importer.h\"\n\n#include <random>\n\nnamespace ospray {\n  namespace sg {\n\n    void generateBasicVolume(const std::shared_ptr<Node> &world,\n                               const std::vector<string_pair> &params)\n    {\n      auto volume_node = createNode(\"basic_volume\", \"StructuredVolume\");\n\n      \/\/ get generator parameters\n\n      vec3i dims(100, 100, 100);\n\n      for (auto &p : params) {\n        if (p.first == \"dimensions\") {\n          auto string_dims = ospcommon::utility::split(p.second, 'x');\n          if (string_dims.size() != 3) {\n            std::cout << \"WARNING: ignoring incorrect 'dimensions' parameter,\"\n                      << \" it must be of the form 'dimensions=XxYxZ'\"\n                      << std::endl;\n            continue;\n          }\n\n          dims = vec3i(std::atoi(string_dims[0].c_str()),\n                       std::atoi(string_dims[1].c_str()),\n                       std::atoi(string_dims[2].c_str()));\n        } else {\n          std::cout << \"WARNING: unknown spheres generator parameter '\"\n                    << p.first << \"' with value '\" << p.second << \"'\"\n                    << std::endl;\n        }\n      }\n\n      \/\/ generate volume data\n\n      auto numVoxels = dims.product();\n\n      float *voxels = new float[numVoxels];\n\n      for (int i = 0; i < numVoxels; ++i)\n        voxels[i] = float(i);\n\n      \/\/ create data nodes\n\n      auto voxel_data = std::make_shared<DataArray1f>(voxels, numVoxels);\n\n      voxel_data->setName(\"voxelData\");\n\n      volume_node->add(voxel_data);\n\n      \/\/ volume attributes\n\n      volume_node->child(\"voxelType\")  = std::string(\"float\");\n      volume_node->child(\"dimensions\") = dims;\n\n      \/\/ add volume to world\n\n      world->add(volume_node);\n    }\n\n    OSPSG_REGISTER_GENERATE_FUNCTION(generateBasicVolume, basic_volume);\n    OSPSG_REGISTER_GENERATE_FUNCTION(generateBasicVolume, volume);\n\n  }  \/\/ ::ospray::sg\n}  \/\/ ::ospray\n<|endoftext|>"}
{"text":"<commit_before>#include <stdio.h>\n#include <sys\/stat.h>\n#include <string.h>\n\n#include \"utils\/Log.h\"\n\n#include <vector>\n#include <minikin\/Hyphenator.h>\n\nusing android::Hyphenator;\n\nHyphenator* loadHybFile(const char* fn) {\n    struct stat statbuf;\n    int status = stat(fn, &statbuf);\n    if (status < 0) {\n        fprintf(stderr, \"error opening %s\\n\", fn);\n        return nullptr;\n    }\n    size_t size = statbuf.st_size;\n    FILE* f = fopen(fn, \"rb\");\n    if (f == NULL) {\n        fprintf(stderr, \"error opening %s\\n\", fn);\n        return nullptr;\n    }\n    uint8_t* buf = new uint8_t[size];\n    size_t read_size = fread(buf, 1, size, f);\n    if (read_size < size) {\n        fprintf(stderr, \"error reading %s\\n\", fn);\n        delete[] buf;\n        return nullptr;\n    }\n    return Hyphenator::loadBinary(buf);\n}\n\nint main(int argc, char** argv) {\n    Hyphenator* hyph = loadHybFile(\"\/tmp\/en.hyb\");  \/\/ should also be configurable\n    std::vector<uint8_t> result;\n    std::vector<uint16_t> word;\n    if (argc < 2) {\n        fprintf(stderr, \"usage: hyphtool word\\n\");\n        return 1;\n    }\n    char* asciiword = argv[1];\n    size_t len = strlen(asciiword);\n    for (size_t i = 0; i < len; i++) {\n        uint32_t c = asciiword[i];\n        if (c == '-') {\n            c = 0x00AD;\n        }\n        \/\/ ASCII (or possibly ISO Latin 1), but kinda painful to do utf conversion :(\n        word.push_back(c);\n    }\n    hyph->hyphenate(&result, word.data(), word.size());\n    for (size_t i = 0; i < len; i++) {\n        if (result[i] != 0) {\n            printf(\"-\");\n        }\n        printf(\"%c\", word[i]);\n    }\n    printf(\"\\n\");\n    return 0;\n}\n<commit_msg>Fix a leaked file in HyphTool.cpp.<commit_after>#include <stdio.h>\n#include <sys\/stat.h>\n#include <string.h>\n\n#include \"utils\/Log.h\"\n\n#include <vector>\n#include <minikin\/Hyphenator.h>\n\nusing android::Hyphenator;\n\nHyphenator* loadHybFile(const char* fn) {\n    struct stat statbuf;\n    int status = stat(fn, &statbuf);\n    if (status < 0) {\n        fprintf(stderr, \"error opening %s\\n\", fn);\n        return nullptr;\n    }\n    size_t size = statbuf.st_size;\n    FILE* f = fopen(fn, \"rb\");\n    if (f == NULL) {\n        fprintf(stderr, \"error opening %s\\n\", fn);\n        return nullptr;\n    }\n    uint8_t* buf = new uint8_t[size];\n    size_t read_size = fread(buf, 1, size, f);\n    fclose(f);\n    if (read_size < size) {\n        fprintf(stderr, \"error reading %s\\n\", fn);\n        delete[] buf;\n        return nullptr;\n    }\n    return Hyphenator::loadBinary(buf);\n}\n\nint main(int argc, char** argv) {\n    Hyphenator* hyph = loadHybFile(\"\/tmp\/en.hyb\");  \/\/ should also be configurable\n    std::vector<uint8_t> result;\n    std::vector<uint16_t> word;\n    if (argc < 2) {\n        fprintf(stderr, \"usage: hyphtool word\\n\");\n        return 1;\n    }\n    char* asciiword = argv[1];\n    size_t len = strlen(asciiword);\n    for (size_t i = 0; i < len; i++) {\n        uint32_t c = asciiword[i];\n        if (c == '-') {\n            c = 0x00AD;\n        }\n        \/\/ ASCII (or possibly ISO Latin 1), but kinda painful to do utf conversion :(\n        word.push_back(c);\n    }\n    hyph->hyphenate(&result, word.data(), word.size());\n    for (size_t i = 0; i < len; i++) {\n        if (result[i] != 0) {\n            printf(\"-\");\n        }\n        printf(\"%c\", word[i]);\n    }\n    printf(\"\\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 \"remoting\/host\/event_executor_mac.h\"\n\nnamespace remoting {\n\nEventExecutorMac::EventExecutorMac(Capturer* capturer)\n  : EventExecutor(capturer) {\n}\n\nEventExecutorMac::~EventExecutorMac() {\n}\n\nvoid EventExecutorMac::HandleInputEvent(ChromotingClientMessage* message) {\n  delete message;\n}\n\n}  \/\/ namespace remoting\n<commit_msg>Fix build break on mac. TBR=ajwong<commit_after>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"remoting\/host\/event_executor_mac.h\"\n\n#include \"remoting\/protocol\/messages_decoder.h\"\n\nnamespace remoting {\n\nEventExecutorMac::EventExecutorMac(Capturer* capturer)\n  : EventExecutor(capturer) {\n}\n\nEventExecutorMac::~EventExecutorMac() {\n}\n\nvoid EventExecutorMac::HandleInputEvent(ChromotingClientMessage* message) {\n  delete message;\n}\n\n}  \/\/ namespace remoting\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2008-2010 Manjeet Dahiya\n *\n * Author:\n *\tManjeet Dahiya\n *\n * Source:\n *\thttp:\/\/code.google.com\/p\/qxmpp\n *\n * This file is a part of QXmpp 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\n#include \"QXmppVCard.h\"\n#include \"QXmppUtils.h\"\n#include \"QXmppConstants.h\"\n\n#include <QXmlStreamWriter>\n#include <QImage>\n#include <QBuffer>\n\nQXmppVCard::QXmppVCard(const QString& jid) : QXmppIq(QXmppIq::Get)\n{\n    \/\/ for self jid should be empty\n    setTo(jid);\n}\n\nQString QXmppVCard::fullName() const\n{\n    return m_fullName;\n}\n\nvoid QXmppVCard::setFullName(const QString& str)\n{\n    m_fullName = str;\n}\n\nQString QXmppVCard::nickName() const\n{\n    return m_nickName;\n}\n\nvoid QXmppVCard::setNickName(const QString& str)\n{\n    m_nickName = str;\n}\n\nconst QByteArray& QXmppVCard::photo() const\n{\n    return m_photo;\n}\n\nvoid QXmppVCard::setPhoto(const QByteArray& photo)\n{\n    m_photo = photo;\n}\n\nvoid QXmppVCard::setPhoto(const QImage& image)\n{\n    QByteArray ba;\n    QBuffer buffer(&ba);\n    buffer.open(QIODevice::WriteOnly);\n    image.save(&buffer, \"PNG\");\n    m_photo = ba;\n}\n\nvoid QXmppVCard::parse(const QDomElement& nodeRecv)\n{\n    QXmppStanza::parse(nodeRecv);\n\n    setTypeFromStr(nodeRecv.attribute(\"type\"));\n\n    \/\/ vCard\n    setFullName(nodeRecv.firstChildElement(\"vCard\").\n                firstChildElement(\"FN\").text());\n    setNickName(nodeRecv.firstChildElement(\"vCard\").\n                firstChildElement(\"NICKNAME\").text());\n    QByteArray base64data = nodeRecv.firstChildElement(\"vCard\").\n                            firstChildElement(\"PHOTO\").\n                            firstChildElement(\"BINVAL\").text().toAscii();\n    setPhoto(QByteArray::fromBase64(base64data));\n}\n\nvoid QXmppVCard::toXmlElementFromChild(QXmlStreamWriter *writer) const\n{\n    writer->writeStartElement(\"vCard\");\n    helperToXmlAddAttribute(writer,\"xmlns\", ns_vcard);\n    helperToXmlAddTextElement(writer, \"FN\", getFullName());\n    if(!getNickName().isEmpty())\n        helperToXmlAddTextElement(writer, \"NICKNAME\", getNickName());\n\n    if(!getPhoto().isEmpty())\n    {\n        writer->writeStartElement(\"PHOTO\");\n        helperToXmlAddTextElement(writer, \"TYPE\", getImageType(getPhoto()));\n        helperToXmlAddTextElement(writer, \"BINVAL\", getPhoto().toBase64());\n        writer->writeEndElement();\n    }\n\n    writer->writeEndElement();\n}\n\nQImage QXmppVCard::photoAsImage() const\n{\n    return getImageFromByteArray(getPhoto());\n}\n\nQString QXmppVCard::getFullName() const\n{\n    return m_fullName;\n}\n\nQString QXmppVCard::getNickName() const\n{\n    return m_nickName;\n}\n\nconst QByteArray& QXmppVCard::getPhoto() const\n{\n    return m_photo;\n}\n\nQImage QXmppVCard::getPhotoAsImage() const\n{\n    return getImageFromByteArray(getPhoto());\n}\n\n<commit_msg>remove deprecated functions calls<commit_after>\/*\n * Copyright (C) 2008-2010 Manjeet Dahiya\n *\n * Author:\n *\tManjeet Dahiya\n *\n * Source:\n *\thttp:\/\/code.google.com\/p\/qxmpp\n *\n * This file is a part of QXmpp 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\n#include \"QXmppVCard.h\"\n#include \"QXmppUtils.h\"\n#include \"QXmppConstants.h\"\n\n#include <QXmlStreamWriter>\n#include <QImage>\n#include <QBuffer>\n\nQXmppVCard::QXmppVCard(const QString& jid) : QXmppIq(QXmppIq::Get)\n{\n    \/\/ for self jid should be empty\n    setTo(jid);\n}\n\nQString QXmppVCard::fullName() const\n{\n    return m_fullName;\n}\n\nvoid QXmppVCard::setFullName(const QString& str)\n{\n    m_fullName = str;\n}\n\nQString QXmppVCard::nickName() const\n{\n    return m_nickName;\n}\n\nvoid QXmppVCard::setNickName(const QString& str)\n{\n    m_nickName = str;\n}\n\nconst QByteArray& QXmppVCard::photo() const\n{\n    return m_photo;\n}\n\nvoid QXmppVCard::setPhoto(const QByteArray& photo)\n{\n    m_photo = photo;\n}\n\nvoid QXmppVCard::setPhoto(const QImage& image)\n{\n    QByteArray ba;\n    QBuffer buffer(&ba);\n    buffer.open(QIODevice::WriteOnly);\n    image.save(&buffer, \"PNG\");\n    m_photo = ba;\n}\n\nvoid QXmppVCard::parse(const QDomElement& nodeRecv)\n{\n    QXmppStanza::parse(nodeRecv);\n\n    setTypeFromStr(nodeRecv.attribute(\"type\"));\n\n    \/\/ vCard\n    setFullName(nodeRecv.firstChildElement(\"vCard\").\n                firstChildElement(\"FN\").text());\n    setNickName(nodeRecv.firstChildElement(\"vCard\").\n                firstChildElement(\"NICKNAME\").text());\n    QByteArray base64data = nodeRecv.firstChildElement(\"vCard\").\n                            firstChildElement(\"PHOTO\").\n                            firstChildElement(\"BINVAL\").text().toAscii();\n    setPhoto(QByteArray::fromBase64(base64data));\n}\n\nvoid QXmppVCard::toXmlElementFromChild(QXmlStreamWriter *writer) const\n{\n    writer->writeStartElement(\"vCard\");\n    helperToXmlAddAttribute(writer,\"xmlns\", ns_vcard);\n    helperToXmlAddTextElement(writer, \"FN\", fullName());\n    if(!nickName().isEmpty())\n        helperToXmlAddTextElement(writer, \"NICKNAME\", nickName());\n\n    if(!photo().isEmpty())\n    {\n        writer->writeStartElement(\"PHOTO\");\n        helperToXmlAddTextElement(writer, \"TYPE\", getImageType(photo()));\n        helperToXmlAddTextElement(writer, \"BINVAL\", photo().toBase64());\n        writer->writeEndElement();\n    }\n\n    writer->writeEndElement();\n}\n\nQImage QXmppVCard::photoAsImage() const\n{\n    return getImageFromByteArray(photo());\n}\n\nQString QXmppVCard::getFullName() const\n{\n    return m_fullName;\n}\n\nQString QXmppVCard::getNickName() const\n{\n    return m_nickName;\n}\n\nconst QByteArray& QXmppVCard::getPhoto() const\n{\n    return m_photo;\n}\n\nQImage QXmppVCard::getPhotoAsImage() const\n{\n    return getImageFromByteArray(photo());\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 \"remoting\/host\/event_executor.h\"\n\n#include <windows.h>\n\n#include \"base\/bind.h\"\n#include \"base\/compiler_specific.h\"\n#include \"base\/message_loop.h\"\n#include \"remoting\/host\/capturer.h\"\n#include \"remoting\/proto\/event.pb.h\"\n#include \"ui\/base\/keycodes\/keyboard_codes.h\"\n\nnamespace remoting {\n\nnamespace {\n\nusing protocol::ClipboardEvent;\nusing protocol::KeyEvent;\nusing protocol::MouseEvent;\n\n\/\/ USB to XKB keycode map table.\n#define USB_KEYMAP(usb, xkb, win, mac) {usb, win}\n#include \"remoting\/host\/usb_keycode_map.h\"\n#undef USB_KEYMAP\n\n\/\/ A class to generate events on Windows.\nclass EventExecutorWin : public EventExecutor {\n public:\n  EventExecutorWin(MessageLoop* message_loop, Capturer* capturer);\n  virtual ~EventExecutorWin() {}\n\n  \/\/ ClipboardStub interface.\n  virtual void InjectClipboardEvent(const ClipboardEvent& event) OVERRIDE;\n\n  \/\/ InputStub interface.\n  virtual void InjectKeyEvent(const KeyEvent& event) OVERRIDE;\n  virtual void InjectMouseEvent(const MouseEvent& event) OVERRIDE;\n\n private:\n  HKL GetForegroundKeyboardLayout();\n  void HandleKey(const KeyEvent& event);\n  void HandleMouse(const MouseEvent& event);\n\n  MessageLoop* message_loop_;\n  Capturer* capturer_;\n\n  DISALLOW_COPY_AND_ASSIGN(EventExecutorWin);\n};\n\nEventExecutorWin::EventExecutorWin(MessageLoop* message_loop,\n                                   Capturer* capturer)\n    : message_loop_(message_loop),\n      capturer_(capturer) {\n}\n\nvoid EventExecutorWin::InjectClipboardEvent(const ClipboardEvent& event) {\n  \/\/ TODO(simonmorris): Implement clipboard injection.\n}\n\nvoid EventExecutorWin::InjectKeyEvent(const KeyEvent& event) {\n  if (MessageLoop::current() != message_loop_) {\n    message_loop_->PostTask(\n        FROM_HERE,\n        base::Bind(&EventExecutorWin::InjectKeyEvent, base::Unretained(this),\n                   event));\n    return;\n  }\n\n  HandleKey(event);\n}\n\nvoid EventExecutorWin::InjectMouseEvent(const MouseEvent& event) {\n  if (MessageLoop::current() != message_loop_) {\n    message_loop_->PostTask(\n        FROM_HERE,\n        base::Bind(&EventExecutorWin::InjectMouseEvent, base::Unretained(this),\n                   event));\n    return;\n  }\n\n  HandleMouse(event);\n}\n\nHKL EventExecutorWin::GetForegroundKeyboardLayout() {\n  HKL layout = 0;\n\n  \/\/ Can return NULL if a window is losing focus.\n  HWND foreground = GetForegroundWindow();\n  if (foreground) {\n    \/\/ Can return 0 if the window no longer exists.\n    DWORD thread_id = GetWindowThreadProcessId(foreground, 0);\n    if (thread_id) {\n      \/\/ Can return 0 if the thread no longer exists, or if we're\n      \/\/ running on Windows Vista and the window is a command-prompt.\n      layout = GetKeyboardLayout(thread_id);\n    }\n  }\n\n  \/\/ If we couldn't determine a layout then use the system default.\n  if (!layout) {\n    SystemParametersInfo(SPI_GETDEFAULTINPUTLANG, 0, &layout, 0);\n  }\n\n  return layout;\n}\n\nvoid EventExecutorWin::HandleKey(const KeyEvent& event) {\n  \/\/ HostEventDispatcher should filter events missing the pressed field.\n  DCHECK(event.has_pressed());\n\n  \/\/ Reset the system idle suspend timeout.\n  SetThreadExecutionState(ES_SYSTEM_REQUIRED);\n\n  \/\/ The mapping between scancodes and VKEY values depends on the foreground\n  \/\/ window's current keyboard layout.\n  HKL layout = GetForegroundKeyboardLayout();\n\n  int key = event.keycode();\n  bool down = event.pressed();\n  int scancode = kInvalidKeycode;\n  if (event.has_usb_keycode()) {\n    \/\/ If the event contains a USB-style code, map to a Windows scancode, and\n    \/\/ look up the corresponding VKEY under the foreground layout.\n    scancode = UsbKeycodeToNativeKeycode(event.usb_keycode());\n    key = MapVirtualKeyEx(scancode, MAPVK_VSC_TO_VK_EX, layout);\n    VLOG(3) << \"Converting USB keycode: \" << std::hex << event.usb_keycode()\n            << \" to scancode: \" << scancode\n            << \" and VKEY: \" << key << std::dec;\n  } else {\n    \/\/ If the event provides only a VKEY, determine the corresponding scancode.\n    scancode = MapVirtualKeyEx(key, MAPVK_VK_TO_VSC_EX, layout);\n    VLOG(3) << \"Converting VKEY: \" << std::hex << event.keycode()\n            << \" to scancode: \" << scancode << std::dec;\n  }\n\n  \/\/ Ignore events with no VK- or USB-keycode, or which can't be mapped.\n  if (scancode == kInvalidKeycode)\n    return;\n\n  INPUT input;\n  memset(&input, 0, sizeof(input));\n\n  input.type = INPUT_KEYBOARD;\n  input.ki.time = 0;\n  input.ki.wVk = key;\n  input.ki.wScan = scancode;\n\n  \/\/ Flag to mark extended 'e0' key scancodes. Without this, the left and\n  \/\/ right windows keys will not be handled properly (on US keyboard).\n  if ((scancode & 0xFF00) == 0xE000) {\n    input.ki.dwFlags |= KEYEVENTF_EXTENDEDKEY;\n  }\n\n  \/\/ Flag to mark keyup events. Default is keydown.\n  if (!down) {\n    input.ki.dwFlags |= KEYEVENTF_KEYUP;\n  }\n\n  if (SendInput(1, &input, sizeof(INPUT)) == 0) {\n    LOG_GETLASTERROR(ERROR) << \"Failed to inject a key event\";\n  }\n}\n\nvoid EventExecutorWin::HandleMouse(const MouseEvent& event) {\n  \/\/ Reset the system idle suspend timeout.\n  SetThreadExecutionState(ES_SYSTEM_REQUIRED);\n\n  \/\/ TODO(garykac) Collapse mouse (x,y) and button events into a single\n  \/\/ input event when possible.\n  if (event.has_x() && event.has_y()) {\n    int x = event.x();\n    int y = event.y();\n\n    INPUT input;\n    input.type = INPUT_MOUSE;\n    input.mi.time = 0;\n    SkISize screen_size = capturer_->size_most_recent();\n    if ((screen_size.width() > 1) && (screen_size.height() > 1)) {\n      input.mi.dx = static_cast<int>((x * 65535) \/ (screen_size.width() - 1));\n      input.mi.dy = static_cast<int>((y * 65535) \/ (screen_size.height() - 1));\n      input.mi.dwFlags = MOUSEEVENTF_MOVE | MOUSEEVENTF_ABSOLUTE;\n      if (SendInput(1, &input, sizeof(INPUT)) == 0) {\n        LOG_GETLASTERROR(ERROR) << \"Failed to inject a mouse move event\";\n      }\n    }\n  }\n\n  if (event.has_wheel_offset_x() && event.has_wheel_offset_y()) {\n    INPUT wheel;\n    wheel.type = INPUT_MOUSE;\n    wheel.mi.time = 0;\n\n    int dx = event.wheel_offset_x();\n    int dy = event.wheel_offset_y();\n\n    if (dx != 0) {\n      wheel.mi.mouseData = dx * WHEEL_DELTA;\n      wheel.mi.dwFlags = MOUSEEVENTF_HWHEEL;\n      if (SendInput(1, &wheel, sizeof(INPUT)) == 0) {\n        LOG_GETLASTERROR(ERROR) << \"Failed to inject a mouse wheel(x) event\";\n      }\n    }\n    if (dy != 0) {\n      wheel.mi.mouseData = dy * WHEEL_DELTA;\n      wheel.mi.dwFlags = MOUSEEVENTF_WHEEL;\n      if (SendInput(1, &wheel, sizeof(INPUT)) == 0) {\n        LOG_GETLASTERROR(ERROR) << \"Failed to inject a mouse wheel(y) event\";\n      }\n    }\n  }\n\n  if (event.has_button() && event.has_button_down()) {\n    INPUT button_event;\n    button_event.type = INPUT_MOUSE;\n    button_event.mi.time = 0;\n    button_event.mi.dx = 0;\n    button_event.mi.dy = 0;\n\n    MouseEvent::MouseButton button = event.button();\n    bool down = event.button_down();\n    if (button == MouseEvent::BUTTON_LEFT) {\n      button_event.mi.dwFlags =\n          down ? MOUSEEVENTF_LEFTDOWN : MOUSEEVENTF_LEFTUP;\n    } else if (button == MouseEvent::BUTTON_MIDDLE) {\n      button_event.mi.dwFlags =\n          down ? MOUSEEVENTF_MIDDLEDOWN : MOUSEEVENTF_MIDDLEUP;\n    } else if (button == MouseEvent::BUTTON_RIGHT) {\n      button_event.mi.dwFlags =\n          down ? MOUSEEVENTF_RIGHTDOWN : MOUSEEVENTF_RIGHTUP;\n    } else {\n      button_event.mi.dwFlags =\n          down ? MOUSEEVENTF_LEFTDOWN : MOUSEEVENTF_LEFTUP;\n    }\n\n    if (SendInput(1, &button_event, sizeof(INPUT)) == 0) {\n      LOG_GETLASTERROR(ERROR) << \"Failed to inject a mouse button event\";\n    }\n  }\n}\n\n}  \/\/ namespace\n\nscoped_ptr<protocol::HostEventStub> EventExecutor::Create(\n    MessageLoop* message_loop, Capturer* capturer) {\n  return scoped_ptr<protocol::HostEventStub>(\n      new EventExecutorWin(message_loop, capturer));\n}\n\n}  \/\/ namespace remoting\n<commit_msg>Let Windows SendInput() calculate the VK for USB events.<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 \"remoting\/host\/event_executor.h\"\n\n#include <windows.h>\n\n#include \"base\/bind.h\"\n#include \"base\/compiler_specific.h\"\n#include \"base\/message_loop.h\"\n#include \"remoting\/host\/capturer.h\"\n#include \"remoting\/proto\/event.pb.h\"\n#include \"ui\/base\/keycodes\/keyboard_codes.h\"\n\nnamespace remoting {\n\nnamespace {\n\nusing protocol::ClipboardEvent;\nusing protocol::KeyEvent;\nusing protocol::MouseEvent;\n\n\/\/ USB to XKB keycode map table.\n#define USB_KEYMAP(usb, xkb, win, mac) {usb, win}\n#include \"remoting\/host\/usb_keycode_map.h\"\n#undef USB_KEYMAP\n\n\/\/ A class to generate events on Windows.\nclass EventExecutorWin : public EventExecutor {\n public:\n  EventExecutorWin(MessageLoop* message_loop, Capturer* capturer);\n  virtual ~EventExecutorWin() {}\n\n  \/\/ ClipboardStub interface.\n  virtual void InjectClipboardEvent(const ClipboardEvent& event) OVERRIDE;\n\n  \/\/ InputStub interface.\n  virtual void InjectKeyEvent(const KeyEvent& event) OVERRIDE;\n  virtual void InjectMouseEvent(const MouseEvent& event) OVERRIDE;\n\n private:\n  HKL GetForegroundKeyboardLayout();\n  void HandleKey(const KeyEvent& event);\n  void HandleMouse(const MouseEvent& event);\n\n  MessageLoop* message_loop_;\n  Capturer* capturer_;\n\n  DISALLOW_COPY_AND_ASSIGN(EventExecutorWin);\n};\n\nEventExecutorWin::EventExecutorWin(MessageLoop* message_loop,\n                                   Capturer* capturer)\n    : message_loop_(message_loop),\n      capturer_(capturer) {\n}\n\nvoid EventExecutorWin::InjectClipboardEvent(const ClipboardEvent& event) {\n  \/\/ TODO(simonmorris): Implement clipboard injection.\n}\n\nvoid EventExecutorWin::InjectKeyEvent(const KeyEvent& event) {\n  if (MessageLoop::current() != message_loop_) {\n    message_loop_->PostTask(\n        FROM_HERE,\n        base::Bind(&EventExecutorWin::InjectKeyEvent, base::Unretained(this),\n                   event));\n    return;\n  }\n\n  HandleKey(event);\n}\n\nvoid EventExecutorWin::InjectMouseEvent(const MouseEvent& event) {\n  if (MessageLoop::current() != message_loop_) {\n    message_loop_->PostTask(\n        FROM_HERE,\n        base::Bind(&EventExecutorWin::InjectMouseEvent, base::Unretained(this),\n                   event));\n    return;\n  }\n\n  HandleMouse(event);\n}\n\nHKL EventExecutorWin::GetForegroundKeyboardLayout() {\n  HKL layout = 0;\n\n  \/\/ Can return NULL if a window is losing focus.\n  HWND foreground = GetForegroundWindow();\n  if (foreground) {\n    \/\/ Can return 0 if the window no longer exists.\n    DWORD thread_id = GetWindowThreadProcessId(foreground, 0);\n    if (thread_id) {\n      \/\/ Can return 0 if the thread no longer exists, or if we're\n      \/\/ running on Windows Vista and the window is a command-prompt.\n      layout = GetKeyboardLayout(thread_id);\n    }\n  }\n\n  \/\/ If we couldn't determine a layout then use the system default.\n  if (!layout) {\n    SystemParametersInfo(SPI_GETDEFAULTINPUTLANG, 0, &layout, 0);\n  }\n\n  return layout;\n}\n\nvoid EventExecutorWin::HandleKey(const KeyEvent& event) {\n  \/\/ HostEventDispatcher should filter events missing the pressed field.\n  DCHECK(event.has_pressed());\n\n  \/\/ Reset the system idle suspend timeout.\n  SetThreadExecutionState(ES_SYSTEM_REQUIRED);\n\n  \/\/ The mapping between scancodes and VKEY values depends on the foreground\n  \/\/ window's current keyboard layout.\n  HKL layout = GetForegroundKeyboardLayout();\n\n  \/\/ Populate the a Windows INPUT structure for the event.\n  INPUT input;\n  memset(&input, 0, sizeof(input));\n  input.type = INPUT_KEYBOARD;\n  input.ki.time = 0;\n  input.ki.dwFlags = event.pressed() ? 0 : KEYEVENTF_KEYUP;\n\n  int scancode = kInvalidKeycode;\n  if (event.has_usb_keycode()) {\n    \/\/ If the event contains a USB-style code, map to a Windows scancode, and\n    \/\/ set a flag to have Windows look up the corresponding VK code.\n    input.ki.dwFlags |= KEYEVENTF_SCANCODE;\n    scancode = UsbKeycodeToNativeKeycode(event.usb_keycode());\n    VLOG(3) << \"Converting USB keycode: \" << std::hex << event.usb_keycode()\n            << \" to scancode: \" << scancode << std::dec;\n  } else {\n    \/\/ If the event provides only a VKEY then use it, and map to the scancode.\n    input.ki.wVk = event.keycode();\n    scancode = MapVirtualKeyEx(event.keycode(), MAPVK_VK_TO_VSC_EX, layout);\n    VLOG(3) << \"Converting VKEY: \" << std::hex << event.keycode()\n            << \" to scancode: \" << scancode << std::dec;\n  }\n\n  \/\/ Ignore events with no VK- or USB-keycode, or which can't be mapped.\n  if (scancode == kInvalidKeycode)\n    return;\n\n  \/\/ Windows scancodes are only 8-bit, so store the low-order byte into the\n  \/\/ event and set the extended flag if any high-order bits are set. The only\n  \/\/ high-order values we should see are 0xE0 or 0xE1. The extended bit usually\n  \/\/ distinguishes keys with the same meaning, e.g. left & right shift.\n  input.ki.wScan = scancode & 0xFF;\n  if ((scancode & 0xFF00) != 0x0000) {\n    input.ki.dwFlags |= KEYEVENTF_EXTENDEDKEY;\n  }\n\n  if (SendInput(1, &input, sizeof(INPUT)) == 0) {\n    LOG_GETLASTERROR(ERROR) << \"Failed to inject a key event\";\n  }\n}\n\nvoid EventExecutorWin::HandleMouse(const MouseEvent& event) {\n  \/\/ Reset the system idle suspend timeout.\n  SetThreadExecutionState(ES_SYSTEM_REQUIRED);\n\n  \/\/ TODO(garykac) Collapse mouse (x,y) and button events into a single\n  \/\/ input event when possible.\n  if (event.has_x() && event.has_y()) {\n    int x = event.x();\n    int y = event.y();\n\n    INPUT input;\n    input.type = INPUT_MOUSE;\n    input.mi.time = 0;\n    SkISize screen_size = capturer_->size_most_recent();\n    if ((screen_size.width() > 1) && (screen_size.height() > 1)) {\n      input.mi.dx = static_cast<int>((x * 65535) \/ (screen_size.width() - 1));\n      input.mi.dy = static_cast<int>((y * 65535) \/ (screen_size.height() - 1));\n      input.mi.dwFlags = MOUSEEVENTF_MOVE | MOUSEEVENTF_ABSOLUTE;\n      if (SendInput(1, &input, sizeof(INPUT)) == 0) {\n        LOG_GETLASTERROR(ERROR) << \"Failed to inject a mouse move event\";\n      }\n    }\n  }\n\n  if (event.has_wheel_offset_x() && event.has_wheel_offset_y()) {\n    INPUT wheel;\n    wheel.type = INPUT_MOUSE;\n    wheel.mi.time = 0;\n\n    int dx = event.wheel_offset_x();\n    int dy = event.wheel_offset_y();\n\n    if (dx != 0) {\n      wheel.mi.mouseData = dx * WHEEL_DELTA;\n      wheel.mi.dwFlags = MOUSEEVENTF_HWHEEL;\n      if (SendInput(1, &wheel, sizeof(INPUT)) == 0) {\n        LOG_GETLASTERROR(ERROR) << \"Failed to inject a mouse wheel(x) event\";\n      }\n    }\n    if (dy != 0) {\n      wheel.mi.mouseData = dy * WHEEL_DELTA;\n      wheel.mi.dwFlags = MOUSEEVENTF_WHEEL;\n      if (SendInput(1, &wheel, sizeof(INPUT)) == 0) {\n        LOG_GETLASTERROR(ERROR) << \"Failed to inject a mouse wheel(y) event\";\n      }\n    }\n  }\n\n  if (event.has_button() && event.has_button_down()) {\n    INPUT button_event;\n    button_event.type = INPUT_MOUSE;\n    button_event.mi.time = 0;\n    button_event.mi.dx = 0;\n    button_event.mi.dy = 0;\n\n    MouseEvent::MouseButton button = event.button();\n    bool down = event.button_down();\n    if (button == MouseEvent::BUTTON_LEFT) {\n      button_event.mi.dwFlags =\n          down ? MOUSEEVENTF_LEFTDOWN : MOUSEEVENTF_LEFTUP;\n    } else if (button == MouseEvent::BUTTON_MIDDLE) {\n      button_event.mi.dwFlags =\n          down ? MOUSEEVENTF_MIDDLEDOWN : MOUSEEVENTF_MIDDLEUP;\n    } else if (button == MouseEvent::BUTTON_RIGHT) {\n      button_event.mi.dwFlags =\n          down ? MOUSEEVENTF_RIGHTDOWN : MOUSEEVENTF_RIGHTUP;\n    } else {\n      button_event.mi.dwFlags =\n          down ? MOUSEEVENTF_LEFTDOWN : MOUSEEVENTF_LEFTUP;\n    }\n\n    if (SendInput(1, &button_event, sizeof(INPUT)) == 0) {\n      LOG_GETLASTERROR(ERROR) << \"Failed to inject a mouse button event\";\n    }\n  }\n}\n\n}  \/\/ namespace\n\nscoped_ptr<protocol::HostEventStub> EventExecutor::Create(\n    MessageLoop* message_loop, Capturer* capturer) {\n  return scoped_ptr<protocol::HostEventStub>(\n      new EventExecutorWin(message_loop, capturer));\n}\n\n}  \/\/ namespace remoting\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\/utility_process_host.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/file_util.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/path_service.h\"\n#include \"base\/process_util.h\"\n#include \"base\/string_util.h\"\n#include \"base\/task.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/render_messages.h\"\n\n#if defined(OS_WIN)\n#include \"chrome\/browser\/sandbox_policy.h\"\n#elif defined(OS_POSIX)\n#include \"base\/global_descriptors_posix.h\"\n#include \"chrome\/common\/chrome_descriptors.h\"\n#endif\n\nUtilityProcessHost::UtilityProcessHost(ResourceDispatcherHost* rdh,\n                                       Client* client,\n                                       MessageLoop* client_loop)\n    : ChildProcessHost(UTILITY_PROCESS, rdh),\n      client_(client),\n      client_loop_(client_loop) {\n}\n\nUtilityProcessHost::~UtilityProcessHost() {\n}\n\nbool UtilityProcessHost::StartExtensionUnpacker(const FilePath& extension) {\n  \/\/ Grant the subprocess access to the entire subdir the extension file is\n  \/\/ in, so that it can unpack to that dir.\n  if (!StartProcess(extension.DirName()))\n    return false;\n\n  Send(new UtilityMsg_UnpackExtension(extension));\n  return true;\n}\n\nbool UtilityProcessHost::StartWebResourceUnpacker(const std::string& data) {\n  if (!StartProcess(FilePath()))\n    return false;\n\n  Send(new UtilityMsg_UnpackWebResource(data));\n  return true;\n}\n\nstd::wstring UtilityProcessHost::GetUtilityProcessCmd() {\n  std::wstring exe_path = CommandLine::ForCurrentProcess()->GetSwitchValue(\n      switches::kBrowserSubprocessPath);\n  if (exe_path.empty()) {\n    PathService::Get(base::FILE_EXE, &exe_path);\n  }\n  return exe_path;\n}\n\nbool UtilityProcessHost::StartProcess(const FilePath& exposed_dir) {\n  \/\/ Name must be set or metrics_service will crash in any test which\n  \/\/ launches a UtilityProcessHost.\n  set_name(L\"utility_process_host_\" + ASCIIToWide(channel_id()));\n\n  if (!CreateChannel())\n    return false;\n\n  std::wstring exe_path = GetUtilityProcessCmd();\n  if (exe_path.empty()) {\n    NOTREACHED() << \"Unable to get utility process binary name.\";\n    return false;\n  }\n\n  CommandLine cmd_line(exe_path);\n  cmd_line.AppendSwitchWithValue(switches::kProcessType,\n                                 switches::kUtilityProcess);\n  cmd_line.AppendSwitchWithValue(switches::kProcessChannelID,\n                                 ASCIIToWide(channel_id()));\n\n  base::ProcessHandle process;\n#if defined(OS_WIN)\n  if (!UseSandbox()) {\n    \/\/ Don't use the sandbox during unit tests.\n    base::LaunchApp(cmd_line, false, false, &process);\n  } else if (exposed_dir.empty()) {\n    process = sandbox::StartProcess(&cmd_line);\n  } else {\n    process = sandbox::StartProcessWithAccess(&cmd_line, exposed_dir);\n  }\n#else\n  \/\/ TODO(port): Sandbox this on Linux\/Mac.  Also, zygote this to work with\n  \/\/ Linux updating.\n  const CommandLine& browser_command_line = *CommandLine::ForCurrentProcess();\n  bool has_cmd_prefix = browser_command_line.HasSwitch(\n      switches::kUtilityCmdPrefix);\n  if (has_cmd_prefix) {\n    \/\/ launch the utility child process with some prefix (usually \"xterm -e gdb\n    \/\/ --args\").\n    cmd_line.PrependWrapper(browser_command_line.GetSwitchValue(\n        switches::kUtilityCmdPrefix));\n  }\n\n  \/\/ This code is duplicated with browser_render_process_host.cc and\n  \/\/ plugin_process_host.cc, but there's not a good place to de-duplicate it.\n  \/\/ Maybe we can merge this into sandbox::StartProcess which will set up\n  \/\/ everything before calling LaunchApp?\n  base::file_handle_mapping_vector fds_to_map;\n  const int ipcfd = channel().GetClientFileDescriptor();\n  if (ipcfd > -1)\n    fds_to_map.push_back(std::pair<int, int>(\n        ipcfd, kPrimaryIPCChannel + base::GlobalDescriptors::kBaseDescriptor));\n  base::LaunchApp(cmd_line.argv(), fds_to_map, false, &process);\n#endif\n  if (!process)\n    return false;\n  SetHandle(process);\n\n  return true;\n}\n\nvoid UtilityProcessHost::OnMessageReceived(const IPC::Message& message) {\n  client_loop_->PostTask(FROM_HERE,\n      NewRunnableMethod(client_.get(), &Client::OnMessageReceived, message));\n}\n\nvoid UtilityProcessHost::OnChannelError() {\n  bool child_exited;\n  bool did_crash = base::DidProcessCrash(&child_exited, handle());\n  if (did_crash) {\n    client_loop_->PostTask(FROM_HERE,\n        NewRunnableMethod(client_.get(), &Client::OnProcessCrashed));\n  }\n}\n\nvoid UtilityProcessHost::Client::OnMessageReceived(\n    const IPC::Message& message) {\n  IPC_BEGIN_MESSAGE_MAP(UtilityProcessHost, message)\n    IPC_MESSAGE_HANDLER(UtilityHostMsg_UnpackExtension_Succeeded,\n                        Client::OnUnpackExtensionSucceeded)\n    IPC_MESSAGE_HANDLER(UtilityHostMsg_UnpackExtension_Failed,\n                        Client::OnUnpackExtensionFailed)\n    IPC_MESSAGE_HANDLER(UtilityHostMsg_UnpackWebResource_Succeeded,\n                        Client::OnUnpackWebResourceSucceeded)\n    IPC_MESSAGE_HANDLER(UtilityHostMsg_UnpackWebResource_Failed,\n                        Client::OnUnpackWebResourceFailed)\n  IPC_END_MESSAGE_MAP_EX()\n}\n<commit_msg>Fix minor naming issue (see http:\/\/codereview.chromium.org\/149255).<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\/utility_process_host.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/file_util.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/path_service.h\"\n#include \"base\/process_util.h\"\n#include \"base\/string_util.h\"\n#include \"base\/task.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/render_messages.h\"\n\n#if defined(OS_WIN)\n#include \"chrome\/browser\/sandbox_policy.h\"\n#elif defined(OS_POSIX)\n#include \"base\/global_descriptors_posix.h\"\n#include \"chrome\/common\/chrome_descriptors.h\"\n#endif\n\nUtilityProcessHost::UtilityProcessHost(ResourceDispatcherHost* rdh,\n                                       Client* client,\n                                       MessageLoop* client_loop)\n    : ChildProcessHost(UTILITY_PROCESS, rdh),\n      client_(client),\n      client_loop_(client_loop) {\n}\n\nUtilityProcessHost::~UtilityProcessHost() {\n}\n\nbool UtilityProcessHost::StartExtensionUnpacker(const FilePath& extension) {\n  \/\/ Grant the subprocess access to the entire subdir the extension file is\n  \/\/ in, so that it can unpack to that dir.\n  if (!StartProcess(extension.DirName()))\n    return false;\n\n  Send(new UtilityMsg_UnpackExtension(extension));\n  return true;\n}\n\nbool UtilityProcessHost::StartWebResourceUnpacker(const std::string& data) {\n  if (!StartProcess(FilePath()))\n    return false;\n\n  Send(new UtilityMsg_UnpackWebResource(data));\n  return true;\n}\n\nstd::wstring UtilityProcessHost::GetUtilityProcessCmd() {\n  std::wstring exe_path = CommandLine::ForCurrentProcess()->GetSwitchValue(\n      switches::kBrowserSubprocessPath);\n  if (exe_path.empty()) {\n    PathService::Get(base::FILE_EXE, &exe_path);\n  }\n  return exe_path;\n}\n\nbool UtilityProcessHost::StartProcess(const FilePath& exposed_dir) {\n  \/\/ Name must be set or metrics_service will crash in any test which\n  \/\/ launches a UtilityProcessHost.\n  set_name(L\"utility process\");\n\n  if (!CreateChannel())\n    return false;\n\n  std::wstring exe_path = GetUtilityProcessCmd();\n  if (exe_path.empty()) {\n    NOTREACHED() << \"Unable to get utility process binary name.\";\n    return false;\n  }\n\n  CommandLine cmd_line(exe_path);\n  cmd_line.AppendSwitchWithValue(switches::kProcessType,\n                                 switches::kUtilityProcess);\n  cmd_line.AppendSwitchWithValue(switches::kProcessChannelID,\n                                 ASCIIToWide(channel_id()));\n\n  base::ProcessHandle process;\n#if defined(OS_WIN)\n  if (!UseSandbox()) {\n    \/\/ Don't use the sandbox during unit tests.\n    base::LaunchApp(cmd_line, false, false, &process);\n  } else if (exposed_dir.empty()) {\n    process = sandbox::StartProcess(&cmd_line);\n  } else {\n    process = sandbox::StartProcessWithAccess(&cmd_line, exposed_dir);\n  }\n#else\n  \/\/ TODO(port): Sandbox this on Linux\/Mac.  Also, zygote this to work with\n  \/\/ Linux updating.\n  const CommandLine& browser_command_line = *CommandLine::ForCurrentProcess();\n  bool has_cmd_prefix = browser_command_line.HasSwitch(\n      switches::kUtilityCmdPrefix);\n  if (has_cmd_prefix) {\n    \/\/ launch the utility child process with some prefix (usually \"xterm -e gdb\n    \/\/ --args\").\n    cmd_line.PrependWrapper(browser_command_line.GetSwitchValue(\n        switches::kUtilityCmdPrefix));\n  }\n\n  \/\/ This code is duplicated with browser_render_process_host.cc and\n  \/\/ plugin_process_host.cc, but there's not a good place to de-duplicate it.\n  \/\/ Maybe we can merge this into sandbox::StartProcess which will set up\n  \/\/ everything before calling LaunchApp?\n  base::file_handle_mapping_vector fds_to_map;\n  const int ipcfd = channel().GetClientFileDescriptor();\n  if (ipcfd > -1)\n    fds_to_map.push_back(std::pair<int, int>(\n        ipcfd, kPrimaryIPCChannel + base::GlobalDescriptors::kBaseDescriptor));\n  base::LaunchApp(cmd_line.argv(), fds_to_map, false, &process);\n#endif\n  if (!process)\n    return false;\n  SetHandle(process);\n\n  return true;\n}\n\nvoid UtilityProcessHost::OnMessageReceived(const IPC::Message& message) {\n  client_loop_->PostTask(FROM_HERE,\n      NewRunnableMethod(client_.get(), &Client::OnMessageReceived, message));\n}\n\nvoid UtilityProcessHost::OnChannelError() {\n  bool child_exited;\n  bool did_crash = base::DidProcessCrash(&child_exited, handle());\n  if (did_crash) {\n    client_loop_->PostTask(FROM_HERE,\n        NewRunnableMethod(client_.get(), &Client::OnProcessCrashed));\n  }\n}\n\nvoid UtilityProcessHost::Client::OnMessageReceived(\n    const IPC::Message& message) {\n  IPC_BEGIN_MESSAGE_MAP(UtilityProcessHost, message)\n    IPC_MESSAGE_HANDLER(UtilityHostMsg_UnpackExtension_Succeeded,\n                        Client::OnUnpackExtensionSucceeded)\n    IPC_MESSAGE_HANDLER(UtilityHostMsg_UnpackExtension_Failed,\n                        Client::OnUnpackExtensionFailed)\n    IPC_MESSAGE_HANDLER(UtilityHostMsg_UnpackWebResource_Succeeded,\n                        Client::OnUnpackWebResourceSucceeded)\n    IPC_MESSAGE_HANDLER(UtilityHostMsg_UnpackWebResource_Failed,\n                        Client::OnUnpackWebResourceFailed)\n  IPC_END_MESSAGE_MAP_EX()\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* * This file is part of meego-im-framework *\n *\n * Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n * All rights reserved.\n * Contact: Nokia Corporation (directui@nokia.com)\n *\n * If you have questions regarding the use of this file, please contact\n * Nokia at directui@nokia.com.\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1 as published by the Free Software Foundation\n * and appearing in the file LICENSE.LGPL included in the packaging\n * of this file.\n *\/\n\n#include \"mimsettingswidget.h\"\n\n#include <MContainer>\n#include <MBasicListItem>\n#include <MLocale>\n#include <MPopupList>\n#include <MLabel>\n#include <QGraphicsLinearLayout>\n#include <QStandardItemModel>\n#include <QItemSelectionModel>\n#include <QDebug>\n\n#include <MAbstractCellCreator>\n#include <MBanner>\n#include <MContentItem>\n#include <MList>\n\n#include <mabstractinputmethodsettings.h>\n#include <minputmethodplugin.h>\n\n#include \"mimsubviewmodel.h\"\n\n#include \"mimsettingsconf.h\"\n\nnamespace {\n    \/\/!object name for settings' widgets\n    const QString ObjectNameActiveInputMethodWidget(\"ActiveInputMethodWidget\");\n    const QString ObjectNameSelectedKeyboardsItem(\"SelectedKeyboardsItem\");\n\n    const QString StyleHeader(\"CommonApplicationHeaderInverted\");\n    const QString StyleBasicListItem(\"CommonBasicListItemInverted\");\n    const QString StylePluginContainer(\"CommonLargePanel\");\n    const QString StylePluginHeader(\"CommonGroupHeaderInverted\");\n\n    const QString DefaultPlugin(\"libmeego-keyboard.so\");\n};\n\nclass MSubViewCellCreator: public MAbstractCellCreator<MContentItem>\n{\npublic:\n    \/*! \\reimp *\/\n    virtual MWidget *createCell(const QModelIndex &index,\n                                MWidgetRecycler &recycler) const;\n    virtual void updateCell(const QModelIndex &index, MWidget *cell) const;\n    \/*! \\reimp_end *\/\n};\n\nMWidget *MSubViewCellCreator::createCell(const QModelIndex &index,\n                                         MWidgetRecycler &recycler) const\n{\n    MContentItem *cell = qobject_cast<MContentItem *>(recycler.take(\"MContentItem\"));\n    if (!cell) {\n        cell = new MContentItem(MContentItem::SingleTextLabel);\n    }\n    updateCell(index, cell);\n    return cell;\n}\n\nvoid MSubViewCellCreator::updateCell(const QModelIndex &index, MWidget *cell) const\n{\n    MContentItem *contentItem = qobject_cast<MContentItem *>(cell);\n\n    contentItem->setTitle(index.data(Qt::DisplayRole).toString());\n}\n\nMImSettingsWidget::MImSettingsWidget()\n    : DcpWidget(),\n      mainLayout(0),\n      headerLabel(0),\n      activeSubViewItem(0),\n      availableSubViewItem(0),\n      availableSubViewList(),\n      keyboardDialog(),\n      keyboardList(),\n      onscreenPlugins(),\n      selectedSubViews(),\n      settingsLabelMap(),\n      settingsContainerMap()\n{\n    updateSelectedSubViews();\n    initWidget();\n}\n\n\n\/\/ pressing the back button means accept for us\nbool MImSettingsWidget::back()\n{\n    return true;\n}\n\nMImSettingsWidget::~MImSettingsWidget()\n{\n    delete availableSubViewList.data();\n    delete keyboardDialog.data();\n}\n\nvoid MImSettingsWidget::initWidget()\n{\n    mainLayout = new QGraphicsLinearLayout(Qt::Vertical, this);\n    mainLayout->setContentsMargins(0., 0., 0., 0.);\n\n    \/\/ Header\n    headerLabel = new MLabel(this);\n    headerLabel->setStyleName(StyleHeader);\n    mainLayout->addItem(headerLabel);\n    mainLayout->setStretchFactor(headerLabel, 0);\n\n    \/\/ Active input method selector\n    \/\/ We are using MBasicListItem instead of MContentItem because\n    \/\/ the latter is not supported by theme\n    activeSubViewItem = new MBasicListItem(MBasicListItem::TitleWithSubtitle, this);\n    activeSubViewItem->setObjectName(ObjectNameActiveInputMethodWidget);\n    activeSubViewItem->setStyleName(StyleBasicListItem);\n    mainLayout->addItem(activeSubViewItem);\n    mainLayout->setStretchFactor(activeSubViewItem, 0);\n    connect(activeSubViewItem, SIGNAL(clicked()), this, SLOT(showAvailableSubViewList()));\n\n    \/\/ All available subviews.\n    availableSubViewItem = new MBasicListItem(MBasicListItem::TitleWithSubtitle, this);\n    availableSubViewItem->setObjectName(ObjectNameSelectedKeyboardsItem);\n    availableSubViewItem->setStyleName(StyleBasicListItem);\n    mainLayout->addItem(availableSubViewItem);\n    mainLayout->setStretchFactor(availableSubViewItem, 0);\n    connect(availableSubViewItem, SIGNAL(clicked()), this, SLOT(showSelectedKeyboardsDialog()));\n\n    const QMap<QString, MAbstractInputMethodSettings *> &map = MImSettingsConf::instance().settings();\n\n    if (map.contains(DefaultPlugin))\n        addPluginSettings(DefaultPlugin, map[DefaultPlugin]);\n\n    QMap<QString, MAbstractInputMethodSettings *>::const_iterator end = map.constEnd();\n    for (QMap<QString, MAbstractInputMethodSettings *>::const_iterator iter(map.constBegin()); iter != end; ++iter) {\n        if (iter.key() == DefaultPlugin)\n            continue;\n\n        addPluginSettings(iter.key(), iter.value());\n    }\n\n    setLayout(mainLayout);\n    mainLayout->addStretch();\n    retranslateUi();\n    connect(&onscreenPlugins, SIGNAL(activeSubViewChanged()), this, SLOT(syncActiveSubView()));\n}\n\nvoid MImSettingsWidget::showAvailableSubViewList()\n{\n    if (!availableSubViewList) {\n        availableSubViewList = new MPopupList();\n        \/\/% \"Active input method\"\n        availableSubViewList.data()->setTitle(qtTrId(\"qtn_txts_active_input_method\"));\n        connect(availableSubViewList.data(), SIGNAL(clicked(const QModelIndex &)),\n                this, SLOT(setActiveSubView(const QModelIndex &)));\n    }\n    \/\/ always update available subview model avoid missing some updated subviews\n    updateAvailableSubViewModel();\n    availableSubViewList.data()->appear(MSceneWindow::DestroyWhenDone);\n}\n\nvoid MImSettingsWidget::updateAvailableSubViewModel()\n{\n    if (!availableSubViewList)\n        return;\n\n    availableSubViewList.data()->setItemModel(new MImSubviewModel(selectedSubViews, availableSubViewList.data()));\n\n    updateActiveSubViewIndex();\n}\n\nvoid MImSettingsWidget::updateActiveSubViewIndex()\n{\n    if (!availableSubViewList)\n        return;\n\n    const MImOnScreenPlugins::SubView &activeSubView = onscreenPlugins.activeSubView();\n\n    QAbstractItemModel *model = availableSubViewList.data()->itemModel();\n\n    for (int row = 0; row < model->rowCount(); ++row) {\n        const QModelIndex &index = model->index(row, 0);\n        const MImOnScreenPlugins::SubView &subview = index.data(MImSubviewModel::SubViewRole).value<MImOnScreenPlugins::SubView>();\n        if (activeSubView == subview) {\n            availableSubViewList.data()->setCurrentIndex(index);\n            availableSubViewList.data()->scrollTo(index);\n            break;\n        }\n    }\n}\n\nvoid MImSettingsWidget::setActiveSubView(const QModelIndex &index)\n{\n    if (!index.isValid() || !availableSubViewList\n        || !availableSubViewList.data()->selectionModel()->isSelected(index))\n        return;\n\n    availableSubViewList.data()->setCurrentIndex(index);\n\n    const QVariant &data = index.data(MImSubviewModel::SubViewRole);\n    const MImOnScreenPlugins::SubView &subview = data.value<MImOnScreenPlugins::SubView>();\n    onscreenPlugins.setActiveSubView(subview);\n}\n\nvoid MImSettingsWidget::showSelectedKeyboardsDialog()\n{\n    if (!keyboardDialog) {\n        keyboardDialog = new MDialog;\n\n        keyboardList = new MList(keyboardDialog.data());\n        keyboardList.data()->setCellCreator(new MSubViewCellCreator);\n        keyboardList.data()->setSelectionMode(MList::MultiSelection);\n\n        keyboardDialog.data()->setCentralWidget(keyboardList.data());\n        keyboardDialog.data()->addButton(M::DoneButton);\n\n        connect(keyboardList.data(), SIGNAL(itemClicked(const QModelIndex &)),\n                this, SLOT(updateSelectedKeyboards(const QModelIndex &)));\n        connect(keyboardDialog.data(), SIGNAL(accepted()),\n                this, SLOT(selectKeyboards()));\n    }\n\n    updateSelectedKeyboardsModel();\n    updateSelectedKeyboards();\n\n    keyboardDialog.data()->exec();\n    delete keyboardDialog.data();\n}\n\nvoid MImSettingsWidget::updateSelectedKeyboardsModel()\n{\n    if (!keyboardList)\n        return;\n\n    QList<MImSubview> subViews;\n    foreach (const MImSettingsConf::MImSubView &subview, MImSettingsConf::instance().subViews()) {\n        subViews.push_back(MImSubview(subview.subViewId, subview.subViewTitle, subview.pluginName));\n    }\n    keyboardList.data()->setItemModel(new MImSubviewModel(subViews, keyboardList.data()));\n\n    updateSelectedKeyboardsSelection();\n}\n\nvoid MImSettingsWidget::updateSelectedKeyboardsSelection()\n{\n    if (!keyboardList)\n        return;\n\n    QAbstractItemModel *model = keyboardList.data()->itemModel();\n    QItemSelectionModel *selection = keyboardList.data()->selectionModel();\n    selection->clear();\n\n    for (int i = 0; i < model->rowCount(); i++) {\n        const QModelIndex &index = model->index(i, 0);\n        const QVariant &data = model->data(index, MImSubviewModel::SubViewRole);\n        const MImOnScreenPlugins::SubView &subView = data.value<MImOnScreenPlugins::SubView>();\n\n        if (onscreenPlugins.isSubViewEnabled(subView)) {\n            selection->select(index, QItemSelectionModel::Select);\n        }\n    }\n}\n\nvoid MImSettingsWidget::updateSelectedKeyboards(const QModelIndex &)\n{\n    if (!keyboardList || !keyboardDialog)\n        return;\n\n    const QModelIndexList &indexList = keyboardList.data()->selectionModel()->selectedIndexes();\n\n    \/\/% “Installed keyboards (%1)”\n    QString title = qtTrId(\"qtn_txts_installed_keyboards\").arg(indexList.size());\n    keyboardDialog.data()->setTitle(title);\n}\n\nvoid MImSettingsWidget::selectKeyboards()\n{\n    if (!keyboardList)\n        return;\n\n    QModelIndexList indexList = keyboardList.data()->selectionModel()->selectedIndexes();\n\n    QList<MImOnScreenPlugins::SubView> selected;\n    foreach (const QModelIndex &i, indexList) {\n        selected.push_back(i.data(MImSubviewModel::SubViewRole).value<MImOnScreenPlugins::SubView>());\n    }\n    onscreenPlugins.setEnabledSubViews(selected);\n\n    updateSelectedSubViews();\n\n    \/\/ \"No keyboard is selected\" notification\n    if (indexList.isEmpty()) {\n        MBanner *noKeyboardsNotification = new MBanner;\n\n        \/\/ It is needed to set the proper style name to have properly wrapped, multiple lines\n        \/\/ with too much content. The MBanner documentation also emphasises to specify the\n        \/\/ style name for the banners explicitly in the code.\n        noKeyboardsNotification->setStyleName(\"InformationBanner\");\n        \/\/% \"Note: you have uninstalled all virtual keyboards\"\n        noKeyboardsNotification->setTitle(qtTrId(\"qtn_txts_no_keyboards_notification\"));\n        noKeyboardsNotification->appear(MSceneWindow::DestroyWhenDone);\n    }\n    \/\/update titles\n    retranslateUi();\n}\n\nvoid MImSettingsWidget::retranslateUi()\n{\n    if (!activeSubViewItem || !headerLabel || !availableSubViewItem)\n        return;\n\n    \/\/% \"Text input\"\n    headerLabel->setText(qtTrId(\"qtn_txts_text_input\"));\n    \/\/% \"Active input method\"\n    activeSubViewItem->setTitle(qtTrId(\"qtn_txts_active_input_method\"));\n    updateActiveSubViewTitle();\n\n    \/\/% “Installed keyboards (%1)”\n    QString title = qtTrId(\"qtn_txts_installed_keyboards\").arg(selectedSubViews.size());\n    availableSubViewItem->setTitle(title);\n    if (selectedSubViews.empty()) {\n        \/\/% \"No keyboards installed\"\n        availableSubViewItem->setSubtitle(qtTrId(\"qtn_txts_no_keyboards\"));\n    } else {\n        QStringList names;\n        foreach (const MImSubview &subView, selectedSubViews) {\n            names.push_back(subView.displayName);\n        }\n        availableSubViewItem->setSubtitle(names.join(\", \"));\n    }\n\n    foreach (MLabel *label, settingsLabelMap.values()) {\n        label->setText(settingsLabelMap.key(label)->title());\n    }\n    if (!availableSubViewList.isNull()) {\n        \/\/% \"Active input method\"\n        availableSubViewList.data()->setTitle(qtTrId(\"qtn_txts_active_input_method\"));\n    }\n}\n\nvoid MImSettingsWidget::syncActiveSubView()\n{\n    \/\/ update setting\n    updateActiveSubViewTitle();\n    updateActiveSubViewIndex();\n}\n\nvoid MImSettingsWidget::updateActiveSubViewTitle()\n{\n    if (!activeSubViewItem)\n        return;\n\n    const MImOnScreenPlugins::SubView &activeSubView = onscreenPlugins.activeSubView();\n\n    foreach (const MImSubview &subView, selectedSubViews) {\n        if (subView.pluginId == activeSubView.plugin\n                && subView.id == activeSubView.id) {\n            activeSubViewItem->setSubtitle(subView.displayName);\n            break;\n        }\n    }\n}\n\n\nvoid MImSettingsWidget::updateSelectedSubViews()\n{\n    selectedSubViews.clear();\n    foreach (const MImSettingsConf::MImSubView &subview, MImSettingsConf::instance().subViews()) {\n        if (onscreenPlugins.isSubViewEnabled(MImOnScreenPlugins::SubView(subview.pluginName, subview.subViewId))) {\n            selectedSubViews.push_back(MImSubview(subview.subViewId, subview.subViewTitle, subview.pluginName));\n        }\n    }\n}\n\nvoid MImSettingsWidget::addPluginSettings(const QString &plugin,\n                                          MAbstractInputMethodSettings *settings)\n{\n    QGraphicsWidget *contentWidget = settings->createContentWidget(this);\n    if (!contentWidget)\n        return;\n\n    QGraphicsLinearLayout *layout = new QGraphicsLinearLayout(Qt::Vertical);\n    MContainer *container = new MContainer(this);\n    container->setStyleName(StylePluginContainer);\n    container->setHeaderVisible(false);\n    container->centralWidget()->setLayout(layout);\n\n    MLabel *header = new MLabel(settings->title(), this);\n    header->setStyleName(StylePluginHeader);\n    \/\/TODO: icon for the settings.\n    layout->addItem(header);\n    layout->addItem(contentWidget);\n\n    mainLayout->addItem(container);\n    mainLayout->setStretchFactor(container, 0);\n\n    settingsLabelMap.insert(settings, header);\n    settingsContainerMap.insert(plugin, container);\n}\n\n<commit_msg>Changes: Insert default plugin at first position<commit_after>\/* * This file is part of meego-im-framework *\n *\n * Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n * All rights reserved.\n * Contact: Nokia Corporation (directui@nokia.com)\n *\n * If you have questions regarding the use of this file, please contact\n * Nokia at directui@nokia.com.\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1 as published by the Free Software Foundation\n * and appearing in the file LICENSE.LGPL included in the packaging\n * of this file.\n *\/\n\n#include \"mimsettingswidget.h\"\n\n#include <MContainer>\n#include <MBasicListItem>\n#include <MLocale>\n#include <MPopupList>\n#include <MLabel>\n#include <QGraphicsLinearLayout>\n#include <QStandardItemModel>\n#include <QItemSelectionModel>\n#include <QDebug>\n\n#include <MAbstractCellCreator>\n#include <MBanner>\n#include <MContentItem>\n#include <MList>\n\n#include <mabstractinputmethodsettings.h>\n#include <minputmethodplugin.h>\n\n#include \"mimsubviewmodel.h\"\n\n#include \"mimsettingsconf.h\"\n\nnamespace {\n    \/\/!object name for settings' widgets\n    const QString ObjectNameActiveInputMethodWidget(\"ActiveInputMethodWidget\");\n    const QString ObjectNameSelectedKeyboardsItem(\"SelectedKeyboardsItem\");\n\n    const QString StyleHeader(\"CommonApplicationHeaderInverted\");\n    const QString StyleBasicListItem(\"CommonBasicListItemInverted\");\n    const QString StylePluginContainer(\"CommonLargePanel\");\n    const QString StylePluginHeader(\"CommonGroupHeaderInverted\");\n\n    const QString DefaultPlugin(\"libmeego-keyboard.so\");\n    const int FirstPluginContainerIndex = 3;\n};\n\nclass MSubViewCellCreator: public MAbstractCellCreator<MContentItem>\n{\npublic:\n    \/*! \\reimp *\/\n    virtual MWidget *createCell(const QModelIndex &index,\n                                MWidgetRecycler &recycler) const;\n    virtual void updateCell(const QModelIndex &index, MWidget *cell) const;\n    \/*! \\reimp_end *\/\n};\n\nMWidget *MSubViewCellCreator::createCell(const QModelIndex &index,\n                                         MWidgetRecycler &recycler) const\n{\n    MContentItem *cell = qobject_cast<MContentItem *>(recycler.take(\"MContentItem\"));\n    if (!cell) {\n        cell = new MContentItem(MContentItem::SingleTextLabel);\n    }\n    updateCell(index, cell);\n    return cell;\n}\n\nvoid MSubViewCellCreator::updateCell(const QModelIndex &index, MWidget *cell) const\n{\n    MContentItem *contentItem = qobject_cast<MContentItem *>(cell);\n\n    contentItem->setTitle(index.data(Qt::DisplayRole).toString());\n}\n\nMImSettingsWidget::MImSettingsWidget()\n    : DcpWidget(),\n      mainLayout(0),\n      headerLabel(0),\n      activeSubViewItem(0),\n      availableSubViewItem(0),\n      availableSubViewList(),\n      keyboardDialog(),\n      keyboardList(),\n      onscreenPlugins(),\n      selectedSubViews(),\n      settingsLabelMap(),\n      settingsContainerMap()\n{\n    updateSelectedSubViews();\n    initWidget();\n}\n\n\n\/\/ pressing the back button means accept for us\nbool MImSettingsWidget::back()\n{\n    return true;\n}\n\nMImSettingsWidget::~MImSettingsWidget()\n{\n    delete availableSubViewList.data();\n    delete keyboardDialog.data();\n}\n\nvoid MImSettingsWidget::initWidget()\n{\n    mainLayout = new QGraphicsLinearLayout(Qt::Vertical, this);\n    mainLayout->setContentsMargins(0., 0., 0., 0.);\n\n    \/\/ Header\n    headerLabel = new MLabel(this);\n    headerLabel->setStyleName(StyleHeader);\n    mainLayout->addItem(headerLabel);\n    mainLayout->setStretchFactor(headerLabel, 0);\n\n    \/\/ Active input method selector\n    \/\/ We are using MBasicListItem instead of MContentItem because\n    \/\/ the latter is not supported by theme\n    activeSubViewItem = new MBasicListItem(MBasicListItem::TitleWithSubtitle, this);\n    activeSubViewItem->setObjectName(ObjectNameActiveInputMethodWidget);\n    activeSubViewItem->setStyleName(StyleBasicListItem);\n    mainLayout->addItem(activeSubViewItem);\n    mainLayout->setStretchFactor(activeSubViewItem, 0);\n    connect(activeSubViewItem, SIGNAL(clicked()), this, SLOT(showAvailableSubViewList()));\n\n    \/\/ All available subviews.\n    availableSubViewItem = new MBasicListItem(MBasicListItem::TitleWithSubtitle, this);\n    availableSubViewItem->setObjectName(ObjectNameSelectedKeyboardsItem);\n    availableSubViewItem->setStyleName(StyleBasicListItem);\n    mainLayout->addItem(availableSubViewItem);\n    mainLayout->setStretchFactor(availableSubViewItem, 0);\n    connect(availableSubViewItem, SIGNAL(clicked()), this, SLOT(showSelectedKeyboardsDialog()));\n\n    const QMap<QString, MAbstractInputMethodSettings *> &map = MImSettingsConf::instance().settings();\n\n    QMap<QString, MAbstractInputMethodSettings *>::const_iterator end = map.constEnd();\n    for (QMap<QString, MAbstractInputMethodSettings *>::const_iterator iter(map.constBegin()); iter != end; ++iter) {\n        addPluginSettings(iter.key(), iter.value());\n    }\n\n    setLayout(mainLayout);\n    mainLayout->addStretch();\n    retranslateUi();\n    connect(&onscreenPlugins, SIGNAL(activeSubViewChanged()), this, SLOT(syncActiveSubView()));\n}\n\nvoid MImSettingsWidget::showAvailableSubViewList()\n{\n    if (!availableSubViewList) {\n        availableSubViewList = new MPopupList();\n        \/\/% \"Active input method\"\n        availableSubViewList.data()->setTitle(qtTrId(\"qtn_txts_active_input_method\"));\n        connect(availableSubViewList.data(), SIGNAL(clicked(const QModelIndex &)),\n                this, SLOT(setActiveSubView(const QModelIndex &)));\n    }\n    \/\/ always update available subview model avoid missing some updated subviews\n    updateAvailableSubViewModel();\n    availableSubViewList.data()->appear(MSceneWindow::DestroyWhenDone);\n}\n\nvoid MImSettingsWidget::updateAvailableSubViewModel()\n{\n    if (!availableSubViewList)\n        return;\n\n    availableSubViewList.data()->setItemModel(new MImSubviewModel(selectedSubViews, availableSubViewList.data()));\n\n    updateActiveSubViewIndex();\n}\n\nvoid MImSettingsWidget::updateActiveSubViewIndex()\n{\n    if (!availableSubViewList)\n        return;\n\n    const MImOnScreenPlugins::SubView &activeSubView = onscreenPlugins.activeSubView();\n\n    QAbstractItemModel *model = availableSubViewList.data()->itemModel();\n\n    for (int row = 0; row < model->rowCount(); ++row) {\n        const QModelIndex &index = model->index(row, 0);\n        const MImOnScreenPlugins::SubView &subview = index.data(MImSubviewModel::SubViewRole).value<MImOnScreenPlugins::SubView>();\n        if (activeSubView == subview) {\n            availableSubViewList.data()->setCurrentIndex(index);\n            availableSubViewList.data()->scrollTo(index);\n            break;\n        }\n    }\n}\n\nvoid MImSettingsWidget::setActiveSubView(const QModelIndex &index)\n{\n    if (!index.isValid() || !availableSubViewList\n        || !availableSubViewList.data()->selectionModel()->isSelected(index))\n        return;\n\n    availableSubViewList.data()->setCurrentIndex(index);\n\n    const QVariant &data = index.data(MImSubviewModel::SubViewRole);\n    const MImOnScreenPlugins::SubView &subview = data.value<MImOnScreenPlugins::SubView>();\n    onscreenPlugins.setActiveSubView(subview);\n}\n\nvoid MImSettingsWidget::showSelectedKeyboardsDialog()\n{\n    if (!keyboardDialog) {\n        keyboardDialog = new MDialog;\n\n        keyboardList = new MList(keyboardDialog.data());\n        keyboardList.data()->setCellCreator(new MSubViewCellCreator);\n        keyboardList.data()->setSelectionMode(MList::MultiSelection);\n\n        keyboardDialog.data()->setCentralWidget(keyboardList.data());\n        keyboardDialog.data()->addButton(M::DoneButton);\n\n        connect(keyboardList.data(), SIGNAL(itemClicked(const QModelIndex &)),\n                this, SLOT(updateSelectedKeyboards(const QModelIndex &)));\n        connect(keyboardDialog.data(), SIGNAL(accepted()),\n                this, SLOT(selectKeyboards()));\n    }\n\n    updateSelectedKeyboardsModel();\n    updateSelectedKeyboards();\n\n    keyboardDialog.data()->exec();\n    delete keyboardDialog.data();\n}\n\nvoid MImSettingsWidget::updateSelectedKeyboardsModel()\n{\n    if (!keyboardList)\n        return;\n\n    QList<MImSubview> subViews;\n    foreach (const MImSettingsConf::MImSubView &subview, MImSettingsConf::instance().subViews()) {\n        subViews.push_back(MImSubview(subview.subViewId, subview.subViewTitle, subview.pluginName));\n    }\n    keyboardList.data()->setItemModel(new MImSubviewModel(subViews, keyboardList.data()));\n\n    updateSelectedKeyboardsSelection();\n}\n\nvoid MImSettingsWidget::updateSelectedKeyboardsSelection()\n{\n    if (!keyboardList)\n        return;\n\n    QAbstractItemModel *model = keyboardList.data()->itemModel();\n    QItemSelectionModel *selection = keyboardList.data()->selectionModel();\n    selection->clear();\n\n    for (int i = 0; i < model->rowCount(); i++) {\n        const QModelIndex &index = model->index(i, 0);\n        const QVariant &data = model->data(index, MImSubviewModel::SubViewRole);\n        const MImOnScreenPlugins::SubView &subView = data.value<MImOnScreenPlugins::SubView>();\n\n        if (onscreenPlugins.isSubViewEnabled(subView)) {\n            selection->select(index, QItemSelectionModel::Select);\n        }\n    }\n}\n\nvoid MImSettingsWidget::updateSelectedKeyboards(const QModelIndex &)\n{\n    if (!keyboardList || !keyboardDialog)\n        return;\n\n    const QModelIndexList &indexList = keyboardList.data()->selectionModel()->selectedIndexes();\n\n    \/\/% “Installed keyboards (%1)”\n    QString title = qtTrId(\"qtn_txts_installed_keyboards\").arg(indexList.size());\n    keyboardDialog.data()->setTitle(title);\n}\n\nvoid MImSettingsWidget::selectKeyboards()\n{\n    if (!keyboardList)\n        return;\n\n    QModelIndexList indexList = keyboardList.data()->selectionModel()->selectedIndexes();\n\n    QList<MImOnScreenPlugins::SubView> selected;\n    foreach (const QModelIndex &i, indexList) {\n        selected.push_back(i.data(MImSubviewModel::SubViewRole).value<MImOnScreenPlugins::SubView>());\n    }\n    onscreenPlugins.setEnabledSubViews(selected);\n\n    updateSelectedSubViews();\n\n    \/\/ \"No keyboard is selected\" notification\n    if (indexList.isEmpty()) {\n        MBanner *noKeyboardsNotification = new MBanner;\n\n        \/\/ It is needed to set the proper style name to have properly wrapped, multiple lines\n        \/\/ with too much content. The MBanner documentation also emphasises to specify the\n        \/\/ style name for the banners explicitly in the code.\n        noKeyboardsNotification->setStyleName(\"InformationBanner\");\n        \/\/% \"Note: you have uninstalled all virtual keyboards\"\n        noKeyboardsNotification->setTitle(qtTrId(\"qtn_txts_no_keyboards_notification\"));\n        noKeyboardsNotification->appear(MSceneWindow::DestroyWhenDone);\n    }\n    \/\/update titles\n    retranslateUi();\n}\n\nvoid MImSettingsWidget::retranslateUi()\n{\n    if (!activeSubViewItem || !headerLabel || !availableSubViewItem)\n        return;\n\n    \/\/% \"Text input\"\n    headerLabel->setText(qtTrId(\"qtn_txts_text_input\"));\n    \/\/% \"Active input method\"\n    activeSubViewItem->setTitle(qtTrId(\"qtn_txts_active_input_method\"));\n    updateActiveSubViewTitle();\n\n    \/\/% “Installed keyboards (%1)”\n    QString title = qtTrId(\"qtn_txts_installed_keyboards\").arg(selectedSubViews.size());\n    availableSubViewItem->setTitle(title);\n    if (selectedSubViews.empty()) {\n        \/\/% \"No keyboards installed\"\n        availableSubViewItem->setSubtitle(qtTrId(\"qtn_txts_no_keyboards\"));\n    } else {\n        QStringList names;\n        foreach (const MImSubview &subView, selectedSubViews) {\n            names.push_back(subView.displayName);\n        }\n        availableSubViewItem->setSubtitle(names.join(\", \"));\n    }\n\n    foreach (MLabel *label, settingsLabelMap.values()) {\n        label->setText(settingsLabelMap.key(label)->title());\n    }\n    if (!availableSubViewList.isNull()) {\n        \/\/% \"Active input method\"\n        availableSubViewList.data()->setTitle(qtTrId(\"qtn_txts_active_input_method\"));\n    }\n}\n\nvoid MImSettingsWidget::syncActiveSubView()\n{\n    \/\/ update setting\n    updateActiveSubViewTitle();\n    updateActiveSubViewIndex();\n}\n\nvoid MImSettingsWidget::updateActiveSubViewTitle()\n{\n    if (!activeSubViewItem)\n        return;\n\n    const MImOnScreenPlugins::SubView &activeSubView = onscreenPlugins.activeSubView();\n\n    foreach (const MImSubview &subView, selectedSubViews) {\n        if (subView.pluginId == activeSubView.plugin\n                && subView.id == activeSubView.id) {\n            activeSubViewItem->setSubtitle(subView.displayName);\n            break;\n        }\n    }\n}\n\n\nvoid MImSettingsWidget::updateSelectedSubViews()\n{\n    selectedSubViews.clear();\n    foreach (const MImSettingsConf::MImSubView &subview, MImSettingsConf::instance().subViews()) {\n        if (onscreenPlugins.isSubViewEnabled(MImOnScreenPlugins::SubView(subview.pluginName, subview.subViewId))) {\n            selectedSubViews.push_back(MImSubview(subview.subViewId, subview.subViewTitle, subview.pluginName));\n        }\n    }\n}\n\nvoid MImSettingsWidget::addPluginSettings(const QString &plugin,\n                                          MAbstractInputMethodSettings *settings)\n{\n    QGraphicsWidget *contentWidget = settings->createContentWidget(this);\n    if (!contentWidget)\n        return;\n\n    QGraphicsLinearLayout *layout = new QGraphicsLinearLayout(Qt::Vertical);\n    MContainer *container = new MContainer(this);\n    container->setStyleName(StylePluginContainer);\n    container->setHeaderVisible(false);\n    container->centralWidget()->setLayout(layout);\n\n    MLabel *header = new MLabel(settings->title(), this);\n    header->setStyleName(StylePluginHeader);\n    \/\/TODO: icon for the settings.\n    layout->addItem(header);\n    layout->addItem(contentWidget);\n\n    if (plugin == DefaultPlugin) {\n        mainLayout->insertItem(FirstPluginContainerIndex, container);\n    } else {\n        mainLayout->addItem(container);\n    }\n    mainLayout->setStretchFactor(container, 0);\n\n    settingsLabelMap.insert(settings, header);\n    settingsContainerMap.insert(plugin, container);\n}\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Fix tools->bibliography database, brown paper bag over head commit :-)<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/\/\n\/\/\/ \\file AliFemtoV0PairCut.cxx\n\/\/\/\n\n#include \"AliFemtoV0PairCut.h\"\n\n#include <string>\n#include <cstdio>\n\n#ifdef __ROOT__\n  \/\/\/ \\cond CLASSIMP\n  ClassImp(AliFemtoV0PairCut);\n  \/\/\/ \\endcond\n#endif\n\n\/\/__________________\nAliFemtoV0PairCut::AliFemtoV0PairCut():\n  fNPairsPassed(0),\n  fNPairsFailed(0),\n  fV0Max(1.0),\n  fShareFractionMax(1.0),\n  fRemoveSameLabel(0),\n  fDataType(kAOD),\n  fDTPCMin(0),\n  fDTPCExitMin(0),\n  fMinAvgSepPosPos(0),\n  fMinAvgSepPosNeg(0),\n  fMinAvgSepNegPos(0),\n  fMinAvgSepNegNeg(0)\n{\n  \/* no-op *\/\n}\n\/\/__________________\nAliFemtoV0PairCut::~AliFemtoV0PairCut()\n{\n  \/* no-op *\/\n}\n\nAliFemtoV0PairCut &AliFemtoV0PairCut::operator=(const AliFemtoV0PairCut &cut)\n{\n  if (this == &cut) {\n    return *this;\n  }\n\n  AliFemtoPairCut::operator=(cut);\n  fNPairsPassed = cut.fNPairsPassed;\n  fNPairsFailed = cut.fNPairsFailed;\n  fV0Max = cut.fV0Max;\n  fShareFractionMax = cut.fShareFractionMax;\n  fRemoveSameLabel = cut.fRemoveSameLabel;\n  fDataType = cut.fDataType;\n  fDTPCMin = cut.fDTPCMin;\n  fDTPCExitMin = cut.fDTPCExitMin;\n  fMinAvgSepPosPos = cut.fMinAvgSepPosPos;\n  fMinAvgSepPosNeg = cut.fMinAvgSepPosNeg;\n  fMinAvgSepNegPos = cut.fMinAvgSepNegPos;\n  fMinAvgSepNegNeg = cut.fMinAvgSepNegNeg;\n\n  return *this;\n}\n\ninline\nbool is_unset_vector(const AliFemtoThreeVector& v)\n{\n  return v.x() <= -9999.0 || v.y() <= -9999.0 ||  v.z() <= -9999.0;\n}\n\ninline\ndouble calculate_avg_separation_daughters(const AliFemtoV0* V1,\n                                          const bool use_pos_daughter_1,\n                                          const AliFemtoV0* V2,\n                                          const bool use_pos_daughter_2)\n{\n   int counter = 0;\n   double avgSep = 0.0;\n\n   for (int i = 0; i < 8; i++) {\n     const AliFemtoThreeVector p1 = use_pos_daughter_1\n                                  ? V1->NominalTpcPointPos(i)\n                                  : V1->NominalTpcPointNeg(i),\n\n                               p2 = use_pos_daughter_2\n                                  ? V2->NominalTpcPointPos(i)\n                                  : V2->NominalTpcPointNeg(i);\n    if (is_unset_vector(p1) || is_unset_vector(p2)) {\n      continue;\n    }\n    avgSep += (p1 - p2).Mag();\n    counter++;\n  }\n  return avgSep \/ counter;\n}\n\n\/\/__________________\nbool AliFemtoV0PairCut::Pass(const AliFemtoPair *pair)\n{\n  const AliFemtoV0 *V0_1 = pair->Track1()->V0(),\n                   *V0_2 = pair->Track2()->V0();\n\n  \/\/ Assert pair is of two V0 particles\n  if (V0_1 == NULL || V0_2 == NULL) {\n    return false;\n  }\n\n  \/\/ Assert that both particles do not share daughters\n  if (V0_1->IdNeg() == V0_2->IdNeg() || V0_1->IdPos() == V0_2->IdPos()) {\n    return false;\n  }\n\n  \/\/ Test separation between track daughters' entrance and exit points\n  if (fDataType == kESD || fDataType == kAOD) {\n    const AliFemtoThreeVector diffPosEntrance = V0_1->NominalTpcEntrancePointPos() - V0_2->NominalTpcEntrancePointPos(),\n                                  diffPosExit = V0_1->NominalTpcExitPointPos() - V0_2->NominalTpcExitPointPos(),\n\n                              diffNegEntrance = V0_1->NominalTpcEntrancePointNeg() - V0_2->NominalTpcEntrancePointNeg(),\n                                  diffNegExit = V0_1->NominalTpcExitPointNeg() - V0_2->NominalTpcExitPointNeg();\n\n    if (diffPosEntrance.Mag() < fDTPCMin\n        || diffNegEntrance.Mag() < fDTPCMin\n        || diffPosExit.Mag() < fDTPCExitMin\n        || diffNegExit.Mag() < fDTPCExitMin) {\n      return false;\n    }\n  }\n\n  \/\/ Find average separations between tracks\n  double avgSep = 0.0;\n\n  avgSep = calculate_avg_separation_daughters(V0_1, true, V0_2, true);\n\n  if (avgSep < fMinAvgSepPosPos) {\n    return false;\n  }\n\n  avgSep = calculate_avg_separation_daughters(V0_1, true, V0_2, false);\n  if (avgSep < fMinAvgSepPosNeg) {\n    return false;\n  }\n\n  avgSep = calculate_avg_separation_daughters(V0_1, false, V0_2, true);\n  if (avgSep < fMinAvgSepNegPos) {\n    return false;\n  }\n\n  avgSep = calculate_avg_separation_daughters(V0_1, false, V0_2, false);\n  if (avgSep < fMinAvgSepNegNeg) {\n    return false;\n  }\n\n  return true;\n}\n\/\/__________________\nAliFemtoString AliFemtoV0PairCut::Report()\n{\n  TString report = \"AliFemtoV0 Pair Cut - remove shared and split pairs\\n\";\n  report += TString::Format(\"Number of pairs which passed:\\t%ld  Number which failed:\\t%ld\\n\", fNPairsPassed, fNPairsFailed);\n\n  return AliFemtoString(report);\n}\n\/\/__________________\n\nvoid AliFemtoV0PairCut::SetV0Max(Double_t aV0Max)\n{\n  fV0Max = aV0Max;\n}\n\nDouble_t AliFemtoV0PairCut::GetAliFemtoV0Max() const\n{\n  return fV0Max;\n}\n\nTList *AliFemtoV0PairCut::ListSettings()\n{\n  \/\/ return a list of settings in a writable form\n  TList *tListSetttings = new TList();\n\n  \/\/ The TString format patterns (F is float, I is integer, L is long)\n  const char ptrnF[] = \"AliFemtoV0PairCut.%s=%f\",\n             ptrnI[] = \"AliFemtoV0PairCut.%s=%d\",\n             ptrnL[] = \"AliFemtoV0PairCut.%s=%ld\";\n\n  tListSetttings->Add(new TObjString(TString::Format(ptrnF, \"V0max\", fV0Max)));\n  tListSetttings->Add(new TObjString(TString::Format(ptrnF, \"sharefractionmax\", fShareFractionMax)));\n  tListSetttings->Add(new TObjString(TString::Format(ptrnF, \"TPCmin\", fDTPCMin)));\n  tListSetttings->Add(new TObjString(TString::Format(ptrnF, \"TPCexitmin\", fDTPCExitMin)));\n  tListSetttings->Add(new TObjString(TString::Format(ptrnI, \"datatype\", fDataType)));\n\n  tListSetttings->Add(new TObjString(TString::Format(ptrnF, \"minAvgSepPosPos\", fMinAvgSepPosPos)));\n  tListSetttings->Add(new TObjString(TString::Format(ptrnF, \"minAvgSepPosNeg\", fMinAvgSepPosNeg)));\n  tListSetttings->Add(new TObjString(TString::Format(ptrnF, \"minAvgSepNegPos\", fMinAvgSepNegPos)));\n  tListSetttings->Add(new TObjString(TString::Format(ptrnF, \"minAvgSepNegNeg\", fMinAvgSepNegNeg)));\n\n  tListSetttings->Add(new TObjString(TString::Format(ptrnL, \"pairs_passed\", fNPairsPassed)));\n  tListSetttings->Add(new TObjString(TString::Format(ptrnL, \"pairs_failed\", fNPairsFailed)));\n\n  return tListSetttings;\n}\n\nvoid AliFemtoV0PairCut::SetRemoveSameLabel(Bool_t aRemove)\n{\n  fRemoveSameLabel = aRemove;\n}\n\nvoid AliFemtoV0PairCut::SetDataType(AliFemtoDataType type)\n{\n  fDataType = type;\n}\n\nvoid AliFemtoV0PairCut::SetTPCEntranceSepMinimum(double dtpc)\n{\n  fDTPCMin = dtpc;\n}\n\nvoid AliFemtoV0PairCut::SetTPCExitSepMinimum(double dtpc)\n{\n  fDTPCExitMin = dtpc;\n}\n\nvoid AliFemtoV0PairCut::SetMinAvgSeparation(int type, double minSep)\n{\n  switch (type) {\n  case 0: \/\/ Pos-Pos\n    fMinAvgSepPosPos = minSep;\n    break;\n  case 1: \/\/ Pos-Neg\n    fMinAvgSepPosNeg = minSep;\n    break;\n  case 2: \/\/ Neg-Pos\n    fMinAvgSepNegPos = minSep;\n    break;\n  case 3: \/\/ Neg-Neg\n    fMinAvgSepNegNeg = minSep;\n    break;\n  }\n}\n<commit_msg>Correcting floating point exception in AliFemtoV0PairCut.cxx<commit_after>\/\/\/\n\/\/\/ \\file AliFemtoV0PairCut.cxx\n\/\/\/\n\n#include \"AliFemtoV0PairCut.h\"\n\n#include <string>\n#include <cstdio>\n\n#ifdef __ROOT__\n  \/\/\/ \\cond CLASSIMP\n  ClassImp(AliFemtoV0PairCut);\n  \/\/\/ \\endcond\n#endif\n\n\/\/__________________\nAliFemtoV0PairCut::AliFemtoV0PairCut():\n  fNPairsPassed(0),\n  fNPairsFailed(0),\n  fV0Max(1.0),\n  fShareFractionMax(1.0),\n  fRemoveSameLabel(0),\n  fDataType(kAOD),\n  fDTPCMin(0),\n  fDTPCExitMin(0),\n  fMinAvgSepPosPos(0),\n  fMinAvgSepPosNeg(0),\n  fMinAvgSepNegPos(0),\n  fMinAvgSepNegNeg(0)\n{\n  \/* no-op *\/\n}\n\/\/__________________\nAliFemtoV0PairCut::~AliFemtoV0PairCut()\n{\n  \/* no-op *\/\n}\n\nAliFemtoV0PairCut &AliFemtoV0PairCut::operator=(const AliFemtoV0PairCut &cut)\n{\n  if (this == &cut) {\n    return *this;\n  }\n\n  AliFemtoPairCut::operator=(cut);\n  fNPairsPassed = cut.fNPairsPassed;\n  fNPairsFailed = cut.fNPairsFailed;\n  fV0Max = cut.fV0Max;\n  fShareFractionMax = cut.fShareFractionMax;\n  fRemoveSameLabel = cut.fRemoveSameLabel;\n  fDataType = cut.fDataType;\n  fDTPCMin = cut.fDTPCMin;\n  fDTPCExitMin = cut.fDTPCExitMin;\n  fMinAvgSepPosPos = cut.fMinAvgSepPosPos;\n  fMinAvgSepPosNeg = cut.fMinAvgSepPosNeg;\n  fMinAvgSepNegPos = cut.fMinAvgSepNegPos;\n  fMinAvgSepNegNeg = cut.fMinAvgSepNegNeg;\n\n  return *this;\n}\n\ninline\nbool is_unset_vector(const AliFemtoThreeVector& v)\n{\n  return v.x() <= -9999.0 || v.y() <= -9999.0 ||  v.z() <= -9999.0;\n}\n\ninline\ndouble calculate_avg_separation_daughters(const AliFemtoV0* V1,\n                                          const bool use_pos_daughter_1,\n                                          const AliFemtoV0* V2,\n                                          const bool use_pos_daughter_2)\n{\n  int counter = 0;\n  double avgSep = 0.0;\n\n  for (int i = 0; i < 8; i++) {\n    const AliFemtoThreeVector p1 = use_pos_daughter_1\n      ? V1->NominalTpcPointPos(i)\n      : V1->NominalTpcPointNeg(i),\n\n      p2 = use_pos_daughter_2\n      ? V2->NominalTpcPointPos(i)\n      : V2->NominalTpcPointNeg(i);\n    if (is_unset_vector(p1) || is_unset_vector(p2)) {\n      continue;\n    }\n    avgSep += (p1 - p2).Mag();\n    counter++;\n  }\n  if(counter==0) return 0;\n  return avgSep \/ counter;\n}\n\n\/\/__________________\nbool AliFemtoV0PairCut::Pass(const AliFemtoPair *pair)\n{\n  const AliFemtoV0 *V0_1 = pair->Track1()->V0(),\n                   *V0_2 = pair->Track2()->V0();\n\n  \/\/ Assert pair is of two V0 particles\n  if (V0_1 == NULL || V0_2 == NULL) {\n    return false;\n  }\n\n  \/\/ Assert that both particles do not share daughters\n  if (V0_1->IdNeg() == V0_2->IdNeg() || V0_1->IdPos() == V0_2->IdPos()) {\n    return false;\n  }\n\n  \/\/ Test separation between track daughters' entrance and exit points\n  if (fDataType == kESD || fDataType == kAOD) {\n    const AliFemtoThreeVector diffPosEntrance = V0_1->NominalTpcEntrancePointPos() - V0_2->NominalTpcEntrancePointPos(),\n                                  diffPosExit = V0_1->NominalTpcExitPointPos() - V0_2->NominalTpcExitPointPos(),\n\n                              diffNegEntrance = V0_1->NominalTpcEntrancePointNeg() - V0_2->NominalTpcEntrancePointNeg(),\n                                  diffNegExit = V0_1->NominalTpcExitPointNeg() - V0_2->NominalTpcExitPointNeg();\n\n    if (diffPosEntrance.Mag() < fDTPCMin\n        || diffNegEntrance.Mag() < fDTPCMin\n        || diffPosExit.Mag() < fDTPCExitMin\n        || diffNegExit.Mag() < fDTPCExitMin) {\n      return false;\n    }\n  }\n\n  \/\/ Find average separations between tracks\n  double avgSep = 0.0;\n\n  avgSep = calculate_avg_separation_daughters(V0_1, true, V0_2, true);\n\n  if (avgSep < fMinAvgSepPosPos) {\n    return false;\n  }\n\n  avgSep = calculate_avg_separation_daughters(V0_1, true, V0_2, false);\n  if (avgSep < fMinAvgSepPosNeg) {\n    return false;\n  }\n\n  avgSep = calculate_avg_separation_daughters(V0_1, false, V0_2, true);\n  if (avgSep < fMinAvgSepNegPos) {\n    return false;\n  }\n\n  avgSep = calculate_avg_separation_daughters(V0_1, false, V0_2, false);\n  if (avgSep < fMinAvgSepNegNeg) {\n    return false;\n  }\n\n  return true;\n}\n\/\/__________________\nAliFemtoString AliFemtoV0PairCut::Report()\n{\n  TString report = \"AliFemtoV0 Pair Cut - remove shared and split pairs\\n\";\n  report += TString::Format(\"Number of pairs which passed:\\t%ld  Number which failed:\\t%ld\\n\", fNPairsPassed, fNPairsFailed);\n\n  return AliFemtoString(report);\n}\n\/\/__________________\n\nvoid AliFemtoV0PairCut::SetV0Max(Double_t aV0Max)\n{\n  fV0Max = aV0Max;\n}\n\nDouble_t AliFemtoV0PairCut::GetAliFemtoV0Max() const\n{\n  return fV0Max;\n}\n\nTList *AliFemtoV0PairCut::ListSettings()\n{\n  \/\/ return a list of settings in a writable form\n  TList *tListSetttings = new TList();\n\n  \/\/ The TString format patterns (F is float, I is integer, L is long)\n  const char ptrnF[] = \"AliFemtoV0PairCut.%s=%f\",\n             ptrnI[] = \"AliFemtoV0PairCut.%s=%d\",\n             ptrnL[] = \"AliFemtoV0PairCut.%s=%ld\";\n\n  tListSetttings->Add(new TObjString(TString::Format(ptrnF, \"V0max\", fV0Max)));\n  tListSetttings->Add(new TObjString(TString::Format(ptrnF, \"sharefractionmax\", fShareFractionMax)));\n  tListSetttings->Add(new TObjString(TString::Format(ptrnF, \"TPCmin\", fDTPCMin)));\n  tListSetttings->Add(new TObjString(TString::Format(ptrnF, \"TPCexitmin\", fDTPCExitMin)));\n  tListSetttings->Add(new TObjString(TString::Format(ptrnI, \"datatype\", fDataType)));\n\n  tListSetttings->Add(new TObjString(TString::Format(ptrnF, \"minAvgSepPosPos\", fMinAvgSepPosPos)));\n  tListSetttings->Add(new TObjString(TString::Format(ptrnF, \"minAvgSepPosNeg\", fMinAvgSepPosNeg)));\n  tListSetttings->Add(new TObjString(TString::Format(ptrnF, \"minAvgSepNegPos\", fMinAvgSepNegPos)));\n  tListSetttings->Add(new TObjString(TString::Format(ptrnF, \"minAvgSepNegNeg\", fMinAvgSepNegNeg)));\n\n  tListSetttings->Add(new TObjString(TString::Format(ptrnL, \"pairs_passed\", fNPairsPassed)));\n  tListSetttings->Add(new TObjString(TString::Format(ptrnL, \"pairs_failed\", fNPairsFailed)));\n\n  return tListSetttings;\n}\n\nvoid AliFemtoV0PairCut::SetRemoveSameLabel(Bool_t aRemove)\n{\n  fRemoveSameLabel = aRemove;\n}\n\nvoid AliFemtoV0PairCut::SetDataType(AliFemtoDataType type)\n{\n  fDataType = type;\n}\n\nvoid AliFemtoV0PairCut::SetTPCEntranceSepMinimum(double dtpc)\n{\n  fDTPCMin = dtpc;\n}\n\nvoid AliFemtoV0PairCut::SetTPCExitSepMinimum(double dtpc)\n{\n  fDTPCExitMin = dtpc;\n}\n\nvoid AliFemtoV0PairCut::SetMinAvgSeparation(int type, double minSep)\n{\n  switch (type) {\n  case 0: \/\/ Pos-Pos\n    fMinAvgSepPosPos = minSep;\n    break;\n  case 1: \/\/ Pos-Neg\n    fMinAvgSepPosNeg = minSep;\n    break;\n  case 2: \/\/ Neg-Pos\n    fMinAvgSepNegPos = minSep;\n    break;\n  case 3: \/\/ Neg-Neg\n    fMinAvgSepNegNeg = minSep;\n    break;\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"xchainer\/backprop.h\"\n\n#include <vector>\n\n#ifdef XCHAINER_ENABLE_CUDA\n#include <cuda_runtime.h>\n#endif  \/\/ XCHAINER_ENABLE_CUDA\n#include <gtest\/gtest.h>\n\n#include \"xchainer\/array.h\"\n#include \"xchainer\/backprop.h\"\n#ifdef XCHAINER_ENABLE_CUDA\n#include \"xchainer\/cuda\/cuda_runtime.h\"\n#endif  \/\/ XCHAINER_ENABLE_CUDA\n#include \"xchainer\/device.h\"\n#include \"xchainer\/dtype.h\"\n#include \"xchainer\/shape.h\"\n\nnamespace xchainer {\nnamespace {\n\nstd::vector<Array> MakeFullArrays(const Shape& shape, const std::vector<float>& values, bool requires_grad) {\n    std::vector<Array> ret;\n    for (float value : values) {\n        ret.push_back(Array::Full(shape, value));\n        ret.back().set_requires_grad(requires_grad);\n    }\n    return ret;\n}\n\nclass BackpropTest : public ::testing::TestWithParam<::testing::tuple<std::string>> {\nprotected:\n    virtual void SetUp() {\n        std::string device_name = ::testing::get<0>(GetParam());\n        device_scope_ = std::make_unique<DeviceScope>(device_name);\n    }\n\n    virtual void TearDown() { device_scope_.reset(); }\n\npublic:\n    template <typename T>\n    void AssertEqual(const Array& expected, const Array& actual) const {\n        ASSERT_EQ(expected.dtype(), actual.dtype());\n        ASSERT_EQ(expected.shape(), actual.shape());\n        AssertDataEqual<T>(expected, actual);\n    }\n\n    template <typename T>\n    void AssertDataEqual(const Array& expected, const Array& actual) const {\n#ifdef XCHAINER_ENABLE_CUDA\n        std::string device_name = ::testing::get<0>(GetParam());\n        if (device_name == \"cuda\") {\n            cuda::CheckError(cudaDeviceSynchronize());\n        }\n#endif  \/\/ XCHAINER_ENABLE_CUDA\n        auto total_size = expected.shape().total_size();\n        const T* expected_data = static_cast<const T*>(expected.data().get());\n        const T* actual_data = static_cast<const T*>(actual.data().get());\n        for (decltype(total_size) i = 0; i < total_size; i++) {\n            ASSERT_EQ(expected_data[i], actual_data[i]);\n        }\n    }\n\n    \/\/ Checks the correctness of Backward() applied to the output of a given function.\n    \/\/ Gradients are only computed w.r.t. target_inputs, and are compared to expected_grads.\n    template <typename Fprop>\n    void CheckBackprop(std::vector<Array>& target_inputs, std::vector<Array>& other_inputs, std::vector<Array>& expected_grads,\n                       Fprop&& fprop) const {\n        ASSERT_EQ(expected_grads.size(), target_inputs.size());\n        auto y = fprop(target_inputs, other_inputs);\n        Backward(y);\n        for (size_t i = 0; i < expected_grads.size(); ++i) {\n            AssertEqual<float>(expected_grads[i], *target_inputs[i].grad());\n        }\n    }\n\n    \/\/ Simple version. It makes and uses an array with one element for each input.\n    template <typename Fprop>\n    void CheckBackprop(std::vector<float> target_inputs, std::vector<float> other_inputs, std::vector<float> expected_grads,\n                       Fprop&& fprop) const {\n        auto xs = MakeFullArrays({1}, target_inputs, true);\n        auto other_xs = MakeFullArrays({1}, other_inputs, false);\n        auto expected_gxs = MakeFullArrays({1}, expected_grads, false);\n        CheckBackprop(xs, other_xs, expected_gxs, std::forward<Fprop>(fprop));\n    }\n\nprivate:\n    std::unique_ptr<DeviceScope> device_scope_;\n};\n\nTEST_P(BackpropTest, Backward) {\n    CheckBackprop({2.0f}, {3.0f}, {7.0f}, [](auto& xs, auto& ys) { return xs[0] * (xs[0] + ys[0]); });\n}\n\nTEST_P(BackpropTest, DoubleBackprop) {\n    auto fprop = [](auto& xs, auto& ys) {\n        auto z = xs[0] * (xs[0] + ys[0]);\n        Backward(z);\n        auto gx = *xs[0].grad();\n        xs[0].ClearGrad();\n        return gx;\n    };\n    CheckBackprop({2.0f}, {3.0f}, {2.0f}, fprop);\n}\n\nINSTANTIATE_TEST_CASE_P(ForEachDevice, BackpropTest, ::testing::Values(\n#ifdef XCHAINER_ENABLE_CUDA\n                                                         std::string{\"cuda\"},\n#endif  \/\/ XCHAINER_ENABLE_CUDA\n                                                         std::string{\"cpu\"}));\n\n}  \/\/ namespace\n}  \/\/ namespace xchainer\n<commit_msg>Fix ASSERT_* to EXPECT_*<commit_after>#include \"xchainer\/backprop.h\"\n\n#include <vector>\n\n#ifdef XCHAINER_ENABLE_CUDA\n#include <cuda_runtime.h>\n#endif  \/\/ XCHAINER_ENABLE_CUDA\n#include <gtest\/gtest.h>\n\n#include \"xchainer\/array.h\"\n#include \"xchainer\/backprop.h\"\n#ifdef XCHAINER_ENABLE_CUDA\n#include \"xchainer\/cuda\/cuda_runtime.h\"\n#endif  \/\/ XCHAINER_ENABLE_CUDA\n#include \"xchainer\/device.h\"\n#include \"xchainer\/dtype.h\"\n#include \"xchainer\/shape.h\"\n\nnamespace xchainer {\nnamespace {\n\nstd::vector<Array> MakeFullArrays(const Shape& shape, const std::vector<float>& values, bool requires_grad) {\n    std::vector<Array> ret;\n    for (float value : values) {\n        ret.push_back(Array::Full(shape, value));\n        ret.back().set_requires_grad(requires_grad);\n    }\n    return ret;\n}\n\nclass BackpropTest : public ::testing::TestWithParam<::testing::tuple<std::string>> {\nprotected:\n    virtual void SetUp() {\n        std::string device_name = ::testing::get<0>(GetParam());\n        device_scope_ = std::make_unique<DeviceScope>(device_name);\n    }\n\n    virtual void TearDown() { device_scope_.reset(); }\n\npublic:\n    template <typename T>\n    void ExpectEqual(const Array& expected, const Array& actual) const {\n        EXPECT_EQ(expected.dtype(), actual.dtype());\n        EXPECT_EQ(expected.shape(), actual.shape());\n        ExpectDataEqual<T>(expected, actual);\n    }\n\n    template <typename T>\n    void ExpectDataEqual(const Array& expected, const Array& actual) const {\n#ifdef XCHAINER_ENABLE_CUDA\n        std::string device_name = ::testing::get<0>(GetParam());\n        if (device_name == \"cuda\") {\n            cuda::CheckError(cudaDeviceSynchronize());\n        }\n#endif  \/\/ XCHAINER_ENABLE_CUDA\n        auto total_size = expected.shape().total_size();\n        const T* expected_data = static_cast<const T*>(expected.data().get());\n        const T* actual_data = static_cast<const T*>(actual.data().get());\n        for (decltype(total_size) i = 0; i < total_size; i++) {\n            EXPECT_EQ(expected_data[i], actual_data[i]);\n        }\n    }\n\n    \/\/ Checks the correctness of Backward() applied to the output of a given function.\n    \/\/ Gradients are only computed w.r.t. target_inputs, and are compared to expected_grads.\n    template <typename Fprop>\n    void CheckBackprop(std::vector<Array>& target_inputs, std::vector<Array>& other_inputs, std::vector<Array>& expected_grads,\n                       Fprop&& fprop) const {\n        EXPECT_EQ(expected_grads.size(), target_inputs.size());\n        auto y = fprop(target_inputs, other_inputs);\n        Backward(y);\n        for (size_t i = 0; i < expected_grads.size(); ++i) {\n            ExpectEqual<float>(expected_grads[i], *target_inputs[i].grad());\n        }\n    }\n\n    \/\/ Simple version. It makes and uses an array with one element for each input.\n    template <typename Fprop>\n    void CheckBackprop(std::vector<float> target_inputs, std::vector<float> other_inputs, std::vector<float> expected_grads,\n                       Fprop&& fprop) const {\n        auto xs = MakeFullArrays({1}, target_inputs, true);\n        auto other_xs = MakeFullArrays({1}, other_inputs, false);\n        auto expected_gxs = MakeFullArrays({1}, expected_grads, false);\n        CheckBackprop(xs, other_xs, expected_gxs, std::forward<Fprop>(fprop));\n    }\n\nprivate:\n    std::unique_ptr<DeviceScope> device_scope_;\n};\n\nTEST_P(BackpropTest, Backward) {\n    CheckBackprop({2.0f}, {3.0f}, {7.0f}, [](auto& xs, auto& ys) { return xs[0] * (xs[0] + ys[0]); });\n}\n\nTEST_P(BackpropTest, DoubleBackprop) {\n    auto fprop = [](auto& xs, auto& ys) {\n        auto z = xs[0] * (xs[0] + ys[0]);\n        Backward(z);\n        auto gx = *xs[0].grad();\n        xs[0].ClearGrad();\n        return gx;\n    };\n    CheckBackprop({2.0f}, {3.0f}, {2.0f}, fprop);\n}\n\nINSTANTIATE_TEST_CASE_P(ForEachDevice, BackpropTest, ::testing::Values(\n#ifdef XCHAINER_ENABLE_CUDA\n                                                         std::string{\"cuda\"},\n#endif  \/\/ XCHAINER_ENABLE_CUDA\n                                                         std::string{\"cpu\"}));\n\n}  \/\/ namespace\n}  \/\/ namespace xchainer\n<|endoftext|>"}
{"text":"<commit_before>#include \"xchainer\/python\/device.h\"\n\n#include <algorithm>\n#include <cstdint>\n#include <memory>\n#include <sstream>\n#include <string>\n\n#include \"xchainer\/backend.h\"\n#include \"xchainer\/context.h\"\n#include \"xchainer\/device.h\"\n#include \"xchainer\/error.h\"\n#include \"xchainer\/python\/dtype.h\"\n#include \"xchainer\/python\/shape.h\"\n#include \"xchainer\/python\/strides.h\"\n\n#include \"xchainer\/python\/common.h\"\n\nnamespace xchainer {\nnamespace python {\nnamespace internal {\n\nnamespace py = pybind11;  \/\/ standard convention\n\nDevice& GetDevice(py::handle handle) {\n    if (handle.is_none()) {\n        return GetDefaultDevice();\n    }\n\n    if (py::isinstance<Device&>(handle)) {\n        return py::cast<Device&>(handle);\n    }\n\n    if (py::isinstance<py::str>(handle)) {\n        \/\/ Device ID\n        std::string device_id = py::cast<std::string>(handle);\n        return GetDefaultContext().GetDevice(device_id);\n    }\n\n    throw py::type_error{\"Device not understood: \" + py::cast<std::string>(py::repr(handle))};\n}\n\nclass PyDeviceScope {\npublic:\n    explicit PyDeviceScope(Device& target) : target_(target) {}\n    void Enter() { scope_ = std::make_unique<DeviceScope>(target_); }\n    void Exit(py::args args) {\n        (void)args;  \/\/ unused\n        scope_.reset();\n    }\n\nprivate:\n    \/\/ TODO(beam2d): better to replace it by \"optional\"...\n    std::unique_ptr<DeviceScope> scope_;\n    Device& target_;\n};\n\n\/\/ A device buffer that upon construction allocates device memory and creates a py::buffer_info, sharing ownership of the managed data\n\/\/ (py::buffer_info only holds a raw pointer and does not manage the lifetime of the pointed data). Memoryviews created from this buffer\n\/\/ will also share ownership. Note that accessing the .obj attribute of a memoryview may increase the reference count and should thus be\n\/\/ avoided.\nclass PyDeviceBuffer {\npublic:\n    PyDeviceBuffer(const std::shared_ptr<void>& data, const std::shared_ptr<py::buffer_info>& info) : data_{data}, info_{info} {}\n\n    PyDeviceBuffer(\n            const std::shared_ptr<void>& data,\n            int64_t item_size,\n            std::string format,\n            int8_t ndim,\n            const Shape& shape,\n            const Strides& strides)\n        : PyDeviceBuffer{data, std::make_shared<py::buffer_info>(data.get(), item_size, std::move(format), ndim, shape, strides)} {}\n\n    std::shared_ptr<py::buffer_info> info() const { return info_; }\n\nprivate:\n    std::shared_ptr<void> data_;\n    std::shared_ptr<py::buffer_info> info_;\n};\n\nvoid InitXchainerDevice(pybind11::module& m) {\n    py::class_<Device> c{m, \"Device\"};\n    c.def(\"__repr__\", &Device::name);\n    c.def(\"synchronize\", &Device::Synchronize);\n    c.def_property_readonly(\"name\", &Device::name);\n    c.def_property_readonly(\"backend\", &Device::backend, py::return_value_policy::reference);\n    c.def_property_readonly(\"context\", &Device::context, py::return_value_policy::reference);\n    c.def_property_readonly(\"index\", &Device::index);\n\n    m.def(\"get_default_device\", []() -> Device& { return GetDefaultDevice(); }, py::return_value_policy::reference);\n    m.def(\"set_default_device\", [](Device& device) { SetDefaultDevice(&device); });\n    m.def(\"set_default_device\", [](const std::string& device_name) { SetDefaultDevice(&GetDefaultContext().GetDevice(device_name)); });\n}\n\nvoid InitXchainerDeviceScope(pybind11::module& m) {\n    py::class_<PyDeviceScope> c{m, \"DeviceScope\"};\n    c.def(\"__enter__\", &PyDeviceScope::Enter);\n    c.def(\"__exit__\", &PyDeviceScope::Exit);\n\n    m.def(\"device_scope\", [](Device& device) { return PyDeviceScope(device); });\n    m.def(\"device_scope\", [](const std::string& device_name) { return PyDeviceScope(GetDefaultContext().GetDevice(device_name)); });\n    m.def(\"device_scope\", [](const std::string& backend_name, int index) {\n        return PyDeviceScope(GetDefaultContext().GetDevice({backend_name, index}));\n    });\n}\n\nvoid InitXchainerDeviceBuffer(pybind11::module& m) {\n    py::class_<PyDeviceBuffer> c{m, \"DeviceBuffer\", py::buffer_protocol()};\n    c.def(py::init([](const py::list& list, const py::tuple& shape_tup, const py::handle& dtype_handle, const py::handle& device) {\n              Shape shape = ToShape(shape_tup);\n              int64_t total_size = shape.GetTotalSize();\n              if (static_cast<size_t>(total_size) != list.size()) {\n                  throw DimensionError{\"Invalid data length\"};\n              }\n\n              \/\/ Copy the Python list to a buffer on the host.\n              Dtype dtype = GetDtype(dtype_handle);\n              int64_t item_size = GetItemSize(dtype);\n              int64_t bytes = item_size * total_size;\n              std::shared_ptr<void> host_data = std::make_unique<uint8_t[]>(bytes);\n              std::string format = VisitDtype(dtype, [&host_data, &list](auto pt) {\n                  using T = typename decltype(pt)::type;\n                  std::transform(list.begin(), list.end(), static_cast<T*>(host_data.get()), [](auto& item) { return py::cast<T>(item); });\n                  return py::format_descriptor<T>::format();  \/\/ Return the dtype format, e.g. \"f\" for xchainer.float32.\n              });\n\n              \/\/ Copy the data on the host buffer to the target device.\n              std::shared_ptr<void> device_data = internal::GetDevice(device).FromHostMemory(host_data, bytes);\n              return PyDeviceBuffer{device_data, item_size, format, shape.ndim(), shape, Strides{shape, dtype}};\n          }),\n          py::arg(\"shape\"),\n          py::arg(\"dtype\"),\n          py::arg(\"data\"),\n          py::arg(\"device\") = nullptr);\n    c.def_buffer([](const PyDeviceBuffer& self) {\n        \/\/ py::buffer_info cannot be copied.\n        std::shared_ptr<py::buffer_info> info = self.info();\n        return py::buffer_info{info->ptr, info->itemsize, info->format, info->ndim, info->shape, info->strides};\n    });\n}\n\n}  \/\/ namespace internal\n}  \/\/ namespace python\n}  \/\/ namespace xchainer\n<commit_msg>Fix clang-tidy<commit_after>#include \"xchainer\/python\/device.h\"\n\n#include <algorithm>\n#include <cstdint>\n#include <memory>\n#include <sstream>\n#include <string>\n\n#include \"xchainer\/backend.h\"\n#include \"xchainer\/context.h\"\n#include \"xchainer\/device.h\"\n#include \"xchainer\/error.h\"\n#include \"xchainer\/python\/dtype.h\"\n#include \"xchainer\/python\/shape.h\"\n#include \"xchainer\/python\/strides.h\"\n\n#include \"xchainer\/python\/common.h\"\n\nnamespace xchainer {\nnamespace python {\nnamespace internal {\n\nnamespace py = pybind11;  \/\/ standard convention\n\nDevice& GetDevice(py::handle handle) {\n    if (handle.is_none()) {\n        return GetDefaultDevice();\n    }\n\n    if (py::isinstance<Device&>(handle)) {\n        return py::cast<Device&>(handle);\n    }\n\n    if (py::isinstance<py::str>(handle)) {\n        \/\/ Device ID\n        std::string device_id = py::cast<std::string>(handle);\n        return GetDefaultContext().GetDevice(device_id);\n    }\n\n    throw py::type_error{\"Device not understood: \" + py::cast<std::string>(py::repr(handle))};\n}\n\nclass PyDeviceScope {\npublic:\n    explicit PyDeviceScope(Device& target) : target_(target) {}\n    void Enter() { scope_ = std::make_unique<DeviceScope>(target_); }\n    void Exit(py::args args) {\n        (void)args;  \/\/ unused\n        scope_.reset();\n    }\n\nprivate:\n    \/\/ TODO(beam2d): better to replace it by \"optional\"...\n    std::unique_ptr<DeviceScope> scope_;\n    Device& target_;\n};\n\n\/\/ A device buffer that upon construction allocates device memory and creates a py::buffer_info, sharing ownership of the managed data\n\/\/ (py::buffer_info only holds a raw pointer and does not manage the lifetime of the pointed data). Memoryviews created from this buffer\n\/\/ will also share ownership. Note that accessing the .obj attribute of a memoryview may increase the reference count and should thus be\n\/\/ avoided.\nclass PyDeviceBuffer {\npublic:\n    PyDeviceBuffer(std::shared_ptr<void> data, std::shared_ptr<py::buffer_info> info) : data_{std::move(data)}, info_{std::move(info)} {}\n\n    PyDeviceBuffer(\n            const std::shared_ptr<void>& data,\n            int64_t item_size,\n            std::string format,\n            int8_t ndim,\n            const Shape& shape,\n            const Strides& strides)\n        : PyDeviceBuffer{data, std::make_shared<py::buffer_info>(data.get(), item_size, std::move(format), ndim, shape, strides)} {}\n\n    std::shared_ptr<py::buffer_info> info() const { return info_; }\n\nprivate:\n    std::shared_ptr<void> data_;\n    std::shared_ptr<py::buffer_info> info_;\n};\n\nvoid InitXchainerDevice(pybind11::module& m) {\n    py::class_<Device> c{m, \"Device\"};\n    c.def(\"__repr__\", &Device::name);\n    c.def(\"synchronize\", &Device::Synchronize);\n    c.def_property_readonly(\"name\", &Device::name);\n    c.def_property_readonly(\"backend\", &Device::backend, py::return_value_policy::reference);\n    c.def_property_readonly(\"context\", &Device::context, py::return_value_policy::reference);\n    c.def_property_readonly(\"index\", &Device::index);\n\n    m.def(\"get_default_device\", []() -> Device& { return GetDefaultDevice(); }, py::return_value_policy::reference);\n    m.def(\"set_default_device\", [](Device& device) { SetDefaultDevice(&device); });\n    m.def(\"set_default_device\", [](const std::string& device_name) { SetDefaultDevice(&GetDefaultContext().GetDevice(device_name)); });\n}\n\nvoid InitXchainerDeviceScope(pybind11::module& m) {\n    py::class_<PyDeviceScope> c{m, \"DeviceScope\"};\n    c.def(\"__enter__\", &PyDeviceScope::Enter);\n    c.def(\"__exit__\", &PyDeviceScope::Exit);\n\n    m.def(\"device_scope\", [](Device& device) { return PyDeviceScope(device); });\n    m.def(\"device_scope\", [](const std::string& device_name) { return PyDeviceScope(GetDefaultContext().GetDevice(device_name)); });\n    m.def(\"device_scope\", [](const std::string& backend_name, int index) {\n        return PyDeviceScope(GetDefaultContext().GetDevice({backend_name, index}));\n    });\n}\n\nvoid InitXchainerDeviceBuffer(pybind11::module& m) {\n    py::class_<PyDeviceBuffer> c{m, \"DeviceBuffer\", py::buffer_protocol()};\n    c.def(py::init([](const py::list& list, const py::tuple& shape_tup, const py::handle& dtype_handle, const py::handle& device) {\n              Shape shape = ToShape(shape_tup);\n              int64_t total_size = shape.GetTotalSize();\n              if (static_cast<size_t>(total_size) != list.size()) {\n                  throw DimensionError{\"Invalid data length\"};\n              }\n\n              \/\/ Copy the Python list to a buffer on the host.\n              Dtype dtype = GetDtype(dtype_handle);\n              int64_t item_size = GetItemSize(dtype);\n              int64_t bytes = item_size * total_size;\n              std::shared_ptr<void> host_data = std::make_unique<uint8_t[]>(bytes);\n              std::string format = VisitDtype(dtype, [&host_data, &list](auto pt) {\n                  using T = typename decltype(pt)::type;\n                  std::transform(list.begin(), list.end(), static_cast<T*>(host_data.get()), [](auto& item) { return py::cast<T>(item); });\n                  return py::format_descriptor<T>::format();  \/\/ Return the dtype format, e.g. \"f\" for xchainer.float32.\n              });\n\n              \/\/ Copy the data on the host buffer to the target device.\n              std::shared_ptr<void> device_data = internal::GetDevice(device).FromHostMemory(host_data, bytes);\n              return PyDeviceBuffer{device_data, item_size, format, shape.ndim(), shape, Strides{shape, dtype}};\n          }),\n          py::arg(\"shape\"),\n          py::arg(\"dtype\"),\n          py::arg(\"data\"),\n          py::arg(\"device\") = nullptr);\n    c.def_buffer([](const PyDeviceBuffer& self) {\n        \/\/ py::buffer_info cannot be copied.\n        std::shared_ptr<py::buffer_info> info = self.info();\n        return py::buffer_info{info->ptr, info->itemsize, info->format, info->ndim, info->shape, info->strides};\n    });\n}\n\n}  \/\/ namespace internal\n}  \/\/ namespace python\n}  \/\/ namespace xchainer\n<|endoftext|>"}
{"text":"<commit_before>#include \"dmrewrite.hpp\"\n\n#include <util\/Record.hpp>\n#include <util\/chunk_allocator.hpp>\n\n#include \"Page.hpp\"\n\n#include <unordered_set>\n#include <map>\n\nnamespace tell {\nnamespace store {\nnamespace dmrewrite {\n\nTable::Table(PageManager& pageManager, Schema const& schema)\n    : mPageManager(pageManager),\n      mSchema(schema),\n      mRecord(schema),\n      mLog(mPageManager),\n      mInsertLog(mPageManager),\n      mHashMap(new(allocator::malloc(sizeof(CuckooTable))) CuckooTable(mPageManager)),\n      mPages(nullptr)\n{\n}\n\nvoid GarbageCollector::run(const std::vector<Table*>& tables, uint64_t minVersion) {\n    for (Table* table : tables) {\n        if (table == nullptr) break;\n        table->runGC(minVersion);\n    }\n}\n\nvoid Table::insert(uint64_t key, const char* const data, const SnapshotDescriptor& snapshot,\n                   bool* succeeded \/*=nullptr*\/) {\n    LogEntry* previous = nullptr;\n    if (mHashMap.load()->get(key) != nullptr) {\n        \/\/ now we need to check whether the newest version is a deletion\n        \/\/ if it is and if it is in our read set, we can just do an update\n        if (succeeded != nullptr)\n            *succeeded = false;\n        return;\n    }\n    \/\/ insertion works like follows:\n    \/\/ - First we append the insertion to the log\n    \/\/ - Then we check, whether this tuple has another entry in the log\n    \/\/ - The insertion will still be in the log, but it will be ignored by the merger\n    \/\/ By doing so, we can guarantee, that the key will be unique\n    LoggedOperation op;\n    op.key = key;\n    op.operation = LogOperation::INSERT;\n    \/\/op.previous = previous;\n    op.tuple = data;\n    op.version = snapshot.version();\n    auto nEntry = mInsertLog.append(uint32_t(op.serializedSize()));\n    op.serialize(nEntry->data());\n    mInsertLog.seal(nEntry);\n    if (succeeded != nullptr) {\n        auto tail = mInsertLog.tail();\n        while (tail != nEntry) {\n            while (!tail->sealed()) {\n            }\n            if (key == *reinterpret_cast<const uint64_t*>(tail->data() + 4)) {\n                *succeeded = false;\n                return;\n            }\n            tail = tail->next();\n        }\n        *succeeded = true;\n    }\n    return;\n}\n\nvoid Table::insert(uint64_t key,\n                   const GenericTuple& tuple,\n                   const SnapshotDescriptor& descr,\n                   bool* succeeded \/*= nullptr*\/)\n{\n    std::unique_ptr<char[]> rec(mRecord.record.create(tuple));\n    insert(key,\n           rec.get(),\n           descr,\n           succeeded);\n}\n\nbool Table::get(uint64_t key, const char*& data, const SnapshotDescriptor& desc, bool& isNewest) {\n    auto& hMap = *mHashMap.load();\n    auto addr = hMap.get(key);\n    if (addr) {\n        \/\/ found the value\n        data = mRecord.getRecordData(desc, reinterpret_cast<const char*>(addr), isNewest);\n        return true;\n    }\n    \/\/ The record is not in the in the hash map - therefore we need to look for it\n    \/\/ in the insert log\n    auto iterator = mInsertLog.tail();\n    while (iterator->sealed() && iterator->size > 0) {\n        if (LoggedOperation::getKey(iterator->data()) == key) {\n            auto opData = iterator->data();\n            isNewest = true;\n            if (!desc.inReadSet(LoggedOperation::getVersion(opData))) {\n                return false;\n            }\n            data = LoggedOperation::getRecord(opData);\n            auto newest = LoggedOperation::getNewest(opData);\n            const DMLogEntry* next = mRecord.getNewest(newest);\n            while (next) {\n                if (desc.inReadSet(LoggedOperation::getVersion(next->data()))) {\n                    return true;\n                }\n                isNewest = false;\n                next = LoggedOperation::getPrevious(next->data());\n            }\n            return true;\n        }\n        iterator = iterator->next();\n    }\n    return false;\n}\n\nbool Table::update(uint64_t key, const char* const data, const SnapshotDescriptor& snapshot) {\n    LoggedOperation loggedOperation;\n    loggedOperation.operation = LogOperation::UPDATE;\n    loggedOperation.key = key;\n    loggedOperation.version = snapshot.version();\n    loggedOperation.tuple = data;\n    return generalUpdate(key, loggedOperation, snapshot);\n}\n\nbool Table::remove(uint64_t key, const SnapshotDescriptor& snapshot) {\n    LoggedOperation loggedOperation;\n    loggedOperation.operation = LogOperation::DELETE;\n    loggedOperation.key = key;\n    loggedOperation.version = snapshot.version();\n    return generalUpdate(key, loggedOperation, snapshot);\n}\n\nbool Table::generalUpdate(uint64_t key, LoggedOperation& loggedOperation, SnapshotDescriptor const& snapshot) {\n    auto& hMap = *mHashMap.load();\n    auto addr = reinterpret_cast<char*>(hMap.get(key));\n    if (addr) {\n        \/\/ found it in the hash table\n        DMLogEntry* newestPtr;\n        bool isNewest;\n        auto rec = mRecord.getRecordData(snapshot, addr, isNewest, &newestPtr);\n        if (!isNewest) {\n            \/\/ We got a conflict\n            return false;\n        }\n        if (newestPtr != nullptr && newestPtr != LoggedOperation::loggedOperationFromTuple(rec)) {\n            \/\/ Someone did an update in the mean time\n            return false;\n        }\n        loggedOperation.previous = newestPtr;\n        auto logEntry = mLog.append(uint32_t(loggedOperation.serializedSize()));\n        loggedOperation.serialize(logEntry->data());\n        logEntry->seal();\n        return mRecord.setNewest(newestPtr, logEntry, addr);\n    }\n    auto iterator = mInsertLog.tail();\n    while (iterator->sealed() && iterator->size > 0) {\n        if (LoggedOperation::getKey(iterator->data()) == key) {\n            const char* opData = iterator->data();\n            \/\/isNewest = true;\n            if (!snapshot.inReadSet(LoggedOperation::getVersion(opData))) {\n                return false;\n            }\n            auto newestPage = LoggedOperation::getNewest(opData);\n            auto newest = mRecord.getNewest(newestPage);\n            auto newestPtr = newest;\n            if (newestPtr) {\n                if (!snapshot.inReadSet(LoggedOperation::getVersion(newestPtr->data()))) {\n                    \/\/ The newest version is not in the read set\n                    return false;\n                }\n            }\n            \/\/ we found the newest record and it is writable\n            loggedOperation.previous = newestPtr;\n            auto logEntry = mLog.append(uint32_t(loggedOperation.serializedSize()));\n            loggedOperation.serialize(logEntry->data());\n            logEntry->seal();\n            return mRecord.setNewest(newest, logEntry, newestPage);\n        }\n        iterator = iterator->next();\n    }\n    return false;\n}\n\nvoid Table::runGC(uint64_t minVersion) {\n    crossbow::chunk_allocator<> allocator;\n    std::vector<PageHolder*>* currPages = mPages.load();\n    std::vector<PageHolder*>* newPages;\n    if (currPages) {\n        newPages = new(allocator::malloc(sizeof(std::vector<PageHolder*>))) std::vector<PageHolder*>(*currPages);\n    } else {\n        newPages = new(allocator::malloc(sizeof(std::vector<PageHolder*>))) std::vector<PageHolder*>();\n    }\n    using map_type = std::map<size_t, char*>;\n    using allocator_type = crossbow::copy_allocator<map_type::value_type>;\n    allocator_type alloc(allocator);\n    std::map<size_t, char*, std::less<size_t>, allocator_type> freeMap(alloc);\n    std::vector<PageHolder*, typename allocator_type::rebind<PageHolder*>> pagesToDelete(alloc);\n    \/\/ tuple of pointers to the newest tuple, format is from -> to\n    using charVecAllocator = allocator_type::rebind<std::pair<char*, char*>>;\n    std::vector<std::pair<char*, char*>, charVecAllocator> newestPointersToChange{charVecAllocator(allocator)};\n    auto& pageList = *newPages;\n    for (size_t i = 0; i < pageList.size(); ++i) {\n        Page page(pageList[i]->page);\n        Page nPage(pageList[i]->page);\n        \/\/ we need to iterate over both pages to make sure we change the newest pointer in the old records\n        auto old_iterator = page.begin();\n        for (auto iterator = page.begin(); iterator != page.end(); ++iterator) {\n            auto record = page.getRecord(iterator);\n            if (!mRecord.needGCWork(record, minVersion)) {\n                if ((*currPages)[i] != (*newPages)[i]) {\n                    newestPointersToChange.emplace_back(page.getRecord(old_iterator), nPage.getRecord(iterator));\n                }\n                continue;\n            }\n            if ((*currPages)[i] == (*newPages)[i]) {\n                \/\/ To clean a page, we need to copy it\n                auto newPage = reinterpret_cast<char*>(mPageManager.alloc());\n                memcpy(newPage, pageList[i]->page, TELL_PAGE_SIZE);\n                pagesToDelete.push_back(pageList[i]);\n                pageList[i] = new (tell::store::allocator::malloc(sizeof(PageHolder))) PageHolder(newPage);\n                nPage = Page(newPage);\n                \/\/ fill the pointers to change map up to the current position\n                for (auto k = page.begin(), j = nPage.begin(); k != iterator; ++k) {\n                    newestPointersToChange.emplace_back(page.getRecord(k), nPage.getRecord(j));\n                    ++j;\n                }\n                \/\/ at this moment, we need to set the new iterator\n                page = Page(pageList[i]->page);\n                iterator = page.fromPosition(iterator);\n                record = page.getRecord(iterator);\n            }\n            \/\/ we need to clean this page. This means, that there is either a newer version availabel,\n            \/\/ there are versions which can be deleted, or both.\n            \/\/ We do always shrink first. This has the advantage, that we need to move less often\n            \/\/ records to new pages.\n            auto p = mRecord.compactAndMerge(record, minVersion, alloc);\n            if (p.second != nullptr) {\n                freeMap.insert(p);\n            }\n            ++old_iterator;\n        }\n        \/\/ TODO: fill page up\n        \/\/ Change the newest pointers\n        for (auto& p : newestPointersToChange) {\n            auto from = reinterpret_cast<std::atomic<char*>*>(p.first);\n            auto to = reinterpret_cast<std::atomic<char*>*>(p.second);\n            while (true) {\n                auto fromPtr = from->load();\n                auto toPtr = to->load();\n                auto fromPtrVal = reinterpret_cast<unsigned long>(fromPtr);\n                if (fromPtrVal % 4 == 0 && fromPtr != toPtr) {\n                    to->store(fromPtr);\n                    continue;\n                }\n                if (from->compare_exchange_strong(fromPtr, reinterpret_cast<char*>(to) + 1)) break;\n            }\n        }\n        newestPointersToChange.clear();\n    }\n    for (auto p : pagesToDelete) {\n        tell::store::allocator::free(p, [this, p]{\n            mPageManager.free(p->page);\n        });\n    }\n};\n} \/\/ namespace tell\nStoreImpl<Implementation::DELTA_MAIN_REWRITE>::StoreImpl(const StorageConfig& config)\n    : pageManager(config.totalMemory), tableManager(pageManager, config, gc, commitManager) {\n}\n\nStoreImpl<Implementation::DELTA_MAIN_REWRITE>::StoreImpl(const StorageConfig& config, size_t totalMem)\n    : pageManager(totalMem), tableManager(pageManager, config, gc, commitManager) {\n}\n\n} \/\/ namespace store\n} \/\/ namespace dmrewrite\n<commit_msg>partly fixed insert<commit_after>#include \"dmrewrite.hpp\"\n\n#include <util\/Record.hpp>\n#include <util\/chunk_allocator.hpp>\n\n#include \"Page.hpp\"\n\n#include <unordered_set>\n#include <map>\n\nnamespace tell {\nnamespace store {\nnamespace dmrewrite {\n\nTable::Table(PageManager& pageManager, Schema const& schema)\n    : mPageManager(pageManager),\n      mSchema(schema),\n      mRecord(schema),\n      mLog(mPageManager),\n      mInsertLog(mPageManager),\n      mHashMap(new(allocator::malloc(sizeof(CuckooTable))) CuckooTable(mPageManager)),\n      mPages(nullptr)\n{\n}\n\nvoid GarbageCollector::run(const std::vector<Table*>& tables, uint64_t minVersion) {\n    for (Table* table : tables) {\n        if (table == nullptr) break;\n        table->runGC(minVersion);\n    }\n}\n\nvoid Table::insert(uint64_t key, const char* const data, const SnapshotDescriptor& snapshot,\n                   bool* succeeded \/*=nullptr*\/) {\n    \/\/ by default, it does not succeed - make sure to reset this if it does!\n    if (succeeded != nullptr)\n        *succeeded = false;\n    DMLogEntry* previous = nullptr;\n    char* ptr = nullptr;\n    if ((ptr = reinterpret_cast<char*>(mHashMap.load()->get(key))) != nullptr) {\n        \/\/ now we need to check whether the newest version is a deletion\n        \/\/ if it is and if it is in our read set, we can just do an update\n        bool isNewest = false;\n        auto data = mRecord.getRecordData(snapshot, ptr, isNewest);\n        if (data != nullptr) {\n        }\n        if (!isNewest) return;\n    }\n    \/\/ insertion works like follows:\n    \/\/ - First we append the insertion to the log\n    \/\/ - Then we check, whether this tuple has another entry in the log\n    \/\/ - The insertion will still be in the log, but it will be ignored by the merger\n    \/\/ By doing so, we can guarantee, that the key will be unique\n    LoggedOperation op;\n    op.key = key;\n    op.operation = LogOperation::INSERT;\n    op.previous = previous;\n    op.tuple = data;\n    op.version = snapshot.version();\n    auto nEntry = mInsertLog.append(uint32_t(op.serializedSize()));\n    op.serialize(nEntry->data());\n    mInsertLog.seal(nEntry);\n    if (succeeded != nullptr) {\n        auto tail = mInsertLog.tail();\n        while (tail != nEntry) {\n            while (!tail->sealed()) {\n            }\n            if (key == *reinterpret_cast<const uint64_t*>(tail->data() + 4)) {\n                *succeeded = false;\n                return;\n            }\n            tail = tail->next();\n        }\n        *succeeded = true;\n    }\n    return;\n}\n\nvoid Table::insert(uint64_t key,\n                   const GenericTuple& tuple,\n                   const SnapshotDescriptor& descr,\n                   bool* succeeded \/*= nullptr*\/)\n{\n    std::unique_ptr<char[]> rec(mRecord.record.create(tuple));\n    insert(key,\n           rec.get(),\n           descr,\n           succeeded);\n}\n\nbool Table::get(uint64_t key, const char*& data, const SnapshotDescriptor& desc, bool& isNewest) {\n    auto& hMap = *mHashMap.load();\n    auto addr = hMap.get(key);\n    if (addr) {\n        \/\/ found the value\n        data = mRecord.getRecordData(desc, reinterpret_cast<const char*>(addr), isNewest);\n        return true;\n    }\n    \/\/ The record is not in the in the hash map - therefore we need to look for it\n    \/\/ in the insert log\n    auto iterator = mInsertLog.tail();\n    while (iterator->sealed() && iterator->size > 0) {\n        if (LoggedOperation::getKey(iterator->data()) == key) {\n            auto opData = iterator->data();\n            isNewest = true;\n            if (!desc.inReadSet(LoggedOperation::getVersion(opData))) {\n                return false;\n            }\n            data = LoggedOperation::getRecord(opData);\n            auto newest = LoggedOperation::getNewest(opData);\n            const DMLogEntry* next = mRecord.getNewest(newest);\n            while (next) {\n                if (desc.inReadSet(LoggedOperation::getVersion(next->data()))) {\n                    return true;\n                }\n                isNewest = false;\n                next = LoggedOperation::getPrevious(next->data());\n            }\n            return true;\n        }\n        iterator = iterator->next();\n    }\n    return false;\n}\n\nbool Table::update(uint64_t key, const char* const data, const SnapshotDescriptor& snapshot) {\n    LoggedOperation loggedOperation;\n    loggedOperation.operation = LogOperation::UPDATE;\n    loggedOperation.key = key;\n    loggedOperation.version = snapshot.version();\n    loggedOperation.tuple = data;\n    return generalUpdate(key, loggedOperation, snapshot);\n}\n\nbool Table::remove(uint64_t key, const SnapshotDescriptor& snapshot) {\n    LoggedOperation loggedOperation;\n    loggedOperation.operation = LogOperation::DELETE;\n    loggedOperation.key = key;\n    loggedOperation.version = snapshot.version();\n    return generalUpdate(key, loggedOperation, snapshot);\n}\n\nbool Table::generalUpdate(uint64_t key, LoggedOperation& loggedOperation, SnapshotDescriptor const& snapshot) {\n    auto& hMap = *mHashMap.load();\n    auto addr = reinterpret_cast<char*>(hMap.get(key));\n    if (addr) {\n        \/\/ found it in the hash table\n        DMLogEntry* newestPtr;\n        bool isNewest;\n        auto rec = mRecord.getRecordData(snapshot, addr, isNewest, &newestPtr);\n        if (!isNewest) {\n            \/\/ We got a conflict\n            return false;\n        }\n        if (newestPtr != nullptr && newestPtr != LoggedOperation::loggedOperationFromTuple(rec)) {\n            \/\/ Someone did an update in the mean time\n            return false;\n        }\n        loggedOperation.previous = newestPtr;\n        auto logEntry = mLog.append(uint32_t(loggedOperation.serializedSize()));\n        loggedOperation.serialize(logEntry->data());\n        logEntry->seal();\n        return mRecord.setNewest(newestPtr, logEntry, addr);\n    }\n    auto iterator = mInsertLog.tail();\n    while (iterator->sealed() && iterator->size > 0) {\n        if (LoggedOperation::getKey(iterator->data()) == key) {\n            const char* opData = iterator->data();\n            \/\/isNewest = true;\n            if (!snapshot.inReadSet(LoggedOperation::getVersion(opData))) {\n                return false;\n            }\n            auto newestPage = LoggedOperation::getNewest(opData);\n            auto newest = mRecord.getNewest(newestPage);\n            auto newestPtr = newest;\n            if (newestPtr) {\n                if (!snapshot.inReadSet(LoggedOperation::getVersion(newestPtr->data()))) {\n                    \/\/ The newest version is not in the read set\n                    return false;\n                }\n            }\n            \/\/ we found the newest record and it is writable\n            loggedOperation.previous = newestPtr;\n            auto logEntry = mLog.append(uint32_t(loggedOperation.serializedSize()));\n            loggedOperation.serialize(logEntry->data());\n            logEntry->seal();\n            return mRecord.setNewest(newest, logEntry, newestPage);\n        }\n        iterator = iterator->next();\n    }\n    return false;\n}\n\nvoid Table::runGC(uint64_t minVersion) {\n    crossbow::chunk_allocator<> allocator;\n    std::vector<PageHolder*>* currPages = mPages.load();\n    std::vector<PageHolder*>* newPages;\n    if (currPages) {\n        newPages = new(allocator::malloc(sizeof(std::vector<PageHolder*>))) std::vector<PageHolder*>(*currPages);\n    } else {\n        newPages = new(allocator::malloc(sizeof(std::vector<PageHolder*>))) std::vector<PageHolder*>();\n    }\n    using map_type = std::map<size_t, char*>;\n    using allocator_type = crossbow::copy_allocator<map_type::value_type>;\n    allocator_type alloc(allocator);\n    std::map<size_t, char*, std::less<size_t>, allocator_type> freeMap(alloc);\n    std::vector<PageHolder*, typename allocator_type::rebind<PageHolder*>> pagesToDelete(alloc);\n    \/\/ tuple of pointers to the newest tuple, format is from -> to\n    using charVecAllocator = allocator_type::rebind<std::pair<char*, char*>>;\n    std::vector<std::pair<char*, char*>, charVecAllocator> newestPointersToChange{charVecAllocator(allocator)};\n    auto& pageList = *newPages;\n    for (size_t i = 0; i < pageList.size(); ++i) {\n        Page page(pageList[i]->page);\n        Page nPage(pageList[i]->page);\n        \/\/ we need to iterate over both pages to make sure we change the newest pointer in the old records\n        auto old_iterator = page.begin();\n        for (auto iterator = page.begin(); iterator != page.end(); ++iterator) {\n            auto record = page.getRecord(iterator);\n            if (!mRecord.needGCWork(record, minVersion)) {\n                if ((*currPages)[i] != (*newPages)[i]) {\n                    newestPointersToChange.emplace_back(page.getRecord(old_iterator), nPage.getRecord(iterator));\n                }\n                continue;\n            }\n            if ((*currPages)[i] == (*newPages)[i]) {\n                \/\/ To clean a page, we need to copy it\n                auto newPage = reinterpret_cast<char*>(mPageManager.alloc());\n                memcpy(newPage, pageList[i]->page, TELL_PAGE_SIZE);\n                pagesToDelete.push_back(pageList[i]);\n                pageList[i] = new (tell::store::allocator::malloc(sizeof(PageHolder))) PageHolder(newPage);\n                nPage = Page(newPage);\n                \/\/ fill the pointers to change map up to the current position\n                for (auto k = page.begin(), j = nPage.begin(); k != iterator; ++k) {\n                    newestPointersToChange.emplace_back(page.getRecord(k), nPage.getRecord(j));\n                    ++j;\n                }\n                \/\/ at this moment, we need to set the new iterator\n                page = Page(pageList[i]->page);\n                iterator = page.fromPosition(iterator);\n                record = page.getRecord(iterator);\n            }\n            \/\/ we need to clean this page. This means, that there is either a newer version availabel,\n            \/\/ there are versions which can be deleted, or both.\n            \/\/ We do always shrink first. This has the advantage, that we need to move less often\n            \/\/ records to new pages.\n            auto p = mRecord.compactAndMerge(record, minVersion, alloc);\n            if (p.second != nullptr) {\n                freeMap.insert(p);\n            }\n            ++old_iterator;\n        }\n        \/\/ TODO: fill page up\n        \/\/ Change the newest pointers\n        for (auto& p : newestPointersToChange) {\n            auto from = reinterpret_cast<std::atomic<char*>*>(p.first);\n            auto to = reinterpret_cast<std::atomic<char*>*>(p.second);\n            while (true) {\n                auto fromPtr = from->load();\n                auto toPtr = to->load();\n                auto fromPtrVal = reinterpret_cast<unsigned long>(fromPtr);\n                if (fromPtrVal % 4 == 0 && fromPtr != toPtr) {\n                    to->store(fromPtr);\n                    continue;\n                }\n                if (from->compare_exchange_strong(fromPtr, reinterpret_cast<char*>(to) + 1)) break;\n            }\n        }\n        newestPointersToChange.clear();\n    }\n    for (auto p : pagesToDelete) {\n        tell::store::allocator::free(p, [this, p]{\n            mPageManager.free(p->page);\n        });\n    }\n};\n} \/\/ namespace tell\nStoreImpl<Implementation::DELTA_MAIN_REWRITE>::StoreImpl(const StorageConfig& config)\n    : pageManager(config.totalMemory), tableManager(pageManager, config, gc, commitManager) {\n}\n\nStoreImpl<Implementation::DELTA_MAIN_REWRITE>::StoreImpl(const StorageConfig& config, size_t totalMem)\n    : pageManager(totalMem), tableManager(pageManager, config, gc, commitManager) {\n}\n\n} \/\/ namespace store\n} \/\/ namespace dmrewrite\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\/\n\/*  slider.cpp                                                           *\/\n\/*************************************************************************\/\n\/*                       This file is part of:                           *\/\n\/*                           GODOT ENGINE                                *\/\n\/*                    http:\/\/www.godotengine.org                         *\/\n\/*************************************************************************\/\n\/* Copyright (c) 2007-2016 Juan Linietsky, Ariel Manzur.                 *\/\n\/*                                                                       *\/\n\/* Permission is hereby granted, free of charge, to any person obtaining *\/\n\/* a copy of this software and associated documentation files (the       *\/\n\/* \"Software\"), to deal in the Software without restriction, including   *\/\n\/* without limitation the rights to use, copy, modify, merge, publish,   *\/\n\/* distribute, sublicense, and\/or sell copies of the Software, and to    *\/\n\/* permit persons to whom the Software is furnished to do so, subject to *\/\n\/* the following conditions:                                             *\/\n\/*                                                                       *\/\n\/* The above copyright notice and this permission notice shall be        *\/\n\/* included in all copies or substantial portions of the Software.       *\/\n\/*                                                                       *\/\n\/* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,       *\/\n\/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF    *\/\n\/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*\/\n\/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY  *\/\n\/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,  *\/\n\/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE     *\/\n\/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.                *\/\n\/*************************************************************************\/\n#include \"slider.h\"\n#include \"os\/keyboard.h\"\n\n\nSize2 Slider::get_minimum_size() const {\n\n\tRef<StyleBox> style = get_stylebox(\"slider\");\n\tSize2i ms = style->get_minimum_size()+style->get_center_size();\n\treturn ms;\n}\n\nvoid Slider::_input_event(InputEvent p_event) {\n\n\n\n\tif (p_event.type==InputEvent::MOUSE_BUTTON) {\n\n\t\tInputEventMouseButton &mb = p_event.mouse_button;\n\t\tif (mb.button_index==BUTTON_LEFT) {\n\n\t\t\tif (mb.pressed)\t{\n\t\t\t\tgrab.pos=orientation==VERTICAL?mb.y:mb.x;\n\t\t\t\tdouble max = orientation==VERTICAL ? get_size().height : get_size().width ;\n\t\t\t\tif (orientation==VERTICAL)\n\t\t\t\t\tset_unit_value( 1 - ((double)grab.pos \/ max) );\n\t\t\t\telse\n\t\t\t\t\tset_unit_value((double)grab.pos \/ max);\n\t\t\t\tgrab.active=true;\n\t\t\t\tgrab.uvalue=get_unit_value();\n\t\t\t} else {\n\t\t\t\tgrab.active=false;\n\t\t\t}\n\t\t} else if (mb.pressed && mb.button_index==BUTTON_WHEEL_UP) {\n\n\t\t\tset_val( get_val() + get_step());\n\t\t} else if (mb.pressed && mb.button_index==BUTTON_WHEEL_DOWN) {\n\t\t\tset_val( get_val() - get_step());\n\t\t}\n\n\t} else if (p_event.type==InputEvent::MOUSE_MOTION) {\n\n\t\tif (grab.active) {\n\n\t\t\tSize2i size = get_size();\n\t\t\tRef<Texture> grabber = get_icon(\"grabber\");\n\t\t\tfloat motion =  (orientation==VERTICAL?p_event.mouse_motion.y:p_event.mouse_motion.x) - grab.pos;\n\t\t\tif (orientation==VERTICAL)\n\t\t\t\tmotion=-motion;\n\t\t\tfloat areasize = orientation==VERTICAL?size.height - grabber->get_size().height:size.width - grabber->get_size().width;\n\t\t\tif (areasize<=0)\n\t\t\t\treturn;\n\t\t\tfloat umotion = motion \/ float(areasize);\n\t\t\tset_unit_value( grab.uvalue + umotion );\n\t\t}\n\t} else {\n\n\t\tif (p_event.is_action(\"ui_left\") && p_event.is_pressed()) {\n\n\t\t\tif (orientation!=HORIZONTAL)\n\t\t\t\treturn;\n\t\t\tset_val( get_val() - (custom_step>=0?custom_step:get_step()) );\n\t\t\taccept_event();\n\t\t} else if (p_event.is_action(\"ui_right\") && p_event.is_pressed()) {\n\n\t\t\tif (orientation!=HORIZONTAL)\n\t\t\t\treturn;\n\t\t\tset_val( get_val() + (custom_step>=0?custom_step:get_step()) );\n\t\t\taccept_event();\n\t\t} else if (p_event.is_action(\"ui_up\") && p_event.is_pressed()) {\n\n\t\t\tif (orientation!=VERTICAL)\n\t\t\t\treturn;\n\n\t\t\tset_val( get_val() + (custom_step>=0?custom_step:get_step()) );\n\t\t\taccept_event();\n\t\t} else if (p_event.is_action(\"ui_down\") && p_event.is_pressed()) {\n\n\t\t\tif (orientation!=VERTICAL)\n\t\t\t\treturn;\n\t\t\tset_val( get_val() - (custom_step>=0?custom_step:get_step()) );\n\t\t\taccept_event();\n\n\t\t} else if (p_event.type==InputEvent::KEY) {\n\n\t\t\tconst InputEventKey &k=p_event.key;\n\n\t\t\tif (!k.pressed)\n\t\t\t\treturn;\n\n\t\t\tswitch (k.scancode) {\n\n\t\t\t\tcase KEY_HOME: {\n\n\t\t\t\t\tset_val( get_min() );\n\t\t\t\t\taccept_event();\n\t\t\t\t} break;\n\t\t\t\tcase KEY_END: {\n\n\t\t\t\t\tset_val( get_max() );\n\t\t\t\t\taccept_event();\n\n\t\t\t\t} break;\n\n\t\t\t} ;\n\t\t}\n\t}\n\n}\n\nvoid Slider::_notification(int p_what) {\n\n\n\tswitch(p_what) {\n\n\t\tcase NOTIFICATION_MOUSE_ENTER: {\n\n\t\t\tmouse_inside=true;\n\t\t\tupdate();\n\t\t} break;\n\t\tcase NOTIFICATION_MOUSE_EXIT: {\n\n\t\t\tmouse_inside=false;\n\t\t\tupdate();\n\t\t} break;\n\t\tcase NOTIFICATION_DRAW: {\n\t\t\tRID ci = get_canvas_item();\n\t\t\tSize2i size = get_size();\n\t\t\tRef<StyleBox> style = get_stylebox(\"slider\");\n\t\t\tRef<StyleBox> focus = get_stylebox(\"focus\");\n\t\t\tRef<Texture> grabber = get_icon(mouse_inside||has_focus()?\"grabber_hilite\":\"grabber\");\n\t\t\tRef<Texture> tick = get_icon(\"tick\");\n\n\t\t\tif (orientation==VERTICAL) {\n\n\t\t\t\tstyle->draw(ci,Rect2i(Point2i(),Size2i(style->get_minimum_size().width+style->get_center_size().width,size.height)));\n\t\t\t\t\/\/if (mouse_inside||has_focus())\n\t\t\t\t\/\/\tfocus->draw(ci,Rect2i(Point2i(),Size2i(style->get_minimum_size().width+style->get_center_size().width,size.height)));\n\t\t\t\tfloat areasize = size.height - grabber->get_size().height;\n\t\t\t\tif (ticks>1) {\n\t\t\t\t\tint tickarea = size.height - tick->get_height();\n\t\t\t\t\tfor(int i=0;i<ticks;i++) {\n\t\t\t\t\t        if( ! ticks_on_borders && (i == 0 || i + 1 == ticks) ) continue;\n\t\t\t\t\t\tint ofs = i*tickarea\/(ticks-1);\n\t\t\t\t\t\ttick->draw(ci,Point2(0,ofs));\n\t\t\t\t\t}\n\n\t\t\t\t}\n\t\t\t\tgrabber->draw(ci,Point2i(size.width\/2-grabber->get_size().width\/2,size.height - get_unit_value()*areasize - grabber->get_size().height));\n\t\t\t} else {\n\t\t\t\tstyle->draw(ci,Rect2i(Point2i(),Size2i(size.width,style->get_minimum_size().height+style->get_center_size().height)));\n\t\t\t\t\/\/if (mouse_inside||has_focus())\n\t\t\t\t\/\/\tfocus->draw(ci,Rect2i(Point2i(),Size2i(size.width,style->get_minimum_size().height+style->get_center_size().height)));\n\n\t\t\t\tfloat areasize = size.width - grabber->get_size().width;\n\t\t\t\tif (ticks>1) {\n\t\t\t\t\tint tickarea = size.width - tick->get_width();\n\t\t\t\t\tfor(int i=0;i<ticks;i++) {\n\t\t\t\t\t        if( (! ticks_on_borders) && ( (i == 0) || ((i + 1) == ticks)) ) continue;\n\t\t\t\t\t\tint ofs = i*tickarea\/(ticks-1);\n\t\t\t\t\t\ttick->draw(ci,Point2(ofs,0));\n\t\t\t\t\t}\n\n\t\t\t\t}\n\t\t\t\tgrabber->draw(ci,Point2i(get_unit_value()*areasize,size.height\/2-grabber->get_size().height\/2));\n\t\t\t}\n\n\t\t} break;\n\t}\n}\n\nvoid Slider::set_custom_step(float p_custom_step) {\n\n\tcustom_step=p_custom_step;\n}\n\nfloat Slider::get_custom_step() const {\n\n\treturn custom_step;\n}\n\nvoid Slider::set_ticks(int p_count) {\n\n\tticks=p_count;\n\tupdate();\n}\n\nint Slider::get_ticks() const {\n\n\treturn ticks;\n}\n\nbool Slider::get_ticks_on_borders() const{\n\treturn ticks_on_borders;\n}\n\nvoid Slider::set_ticks_on_borders(bool _tob){\n\tticks_on_borders = _tob;\n\tupdate();\n}\n\nvoid Slider::_bind_methods() {\n\n\tObjectTypeDB::bind_method(_MD(\"_input_event\"),&Slider::_input_event);\n\tObjectTypeDB::bind_method(_MD(\"set_ticks\",\"count\"),&Slider::set_ticks);\n\tObjectTypeDB::bind_method(_MD(\"get_ticks\"),&Slider::get_ticks);\n\n\tObjectTypeDB::bind_method(_MD(\"get_ticks_on_borders\"),&Slider::get_ticks_on_borders);\n\tObjectTypeDB::bind_method(_MD(\"set_ticks_on_borders\",\"ticks_on_border\"),&Slider::set_ticks_on_borders);\n\n\tADD_PROPERTY( PropertyInfo( Variant::INT, \"tick_count\", PROPERTY_HINT_RANGE,\"0,4096,1\"), _SCS(\"set_ticks\"), _SCS(\"get_ticks\") );\n        ADD_PROPERTY( PropertyInfo( Variant::BOOL, \"ticks_on_borders\" ), _SCS(\"set_ticks_on_borders\"), _SCS(\"get_ticks_on_borders\") );\n\tADD_PROPERTY( PropertyInfo( Variant::INT,\"focus_mode\", PROPERTY_HINT_ENUM, \"None,Click,All\" ), _SCS(\"set_focus_mode\"), _SCS(\"get_focus_mode\") );\n\n}\n\nSlider::Slider(Orientation p_orientation) {\n\torientation=p_orientation;\n\tmouse_inside=false;\n\tgrab.active=false;\n\tticks=0;\n\tcustom_step=-1;\n\tset_focus_mode(FOCUS_ALL);\n}\n<commit_msg>Slider value accounts for grabber offset<commit_after>\/*************************************************************************\/\n\/*  slider.cpp                                                           *\/\n\/*************************************************************************\/\n\/*                       This file is part of:                           *\/\n\/*                           GODOT ENGINE                                *\/\n\/*                    http:\/\/www.godotengine.org                         *\/\n\/*************************************************************************\/\n\/* Copyright (c) 2007-2016 Juan Linietsky, Ariel Manzur.                 *\/\n\/*                                                                       *\/\n\/* Permission is hereby granted, free of charge, to any person obtaining *\/\n\/* a copy of this software and associated documentation files (the       *\/\n\/* \"Software\"), to deal in the Software without restriction, including   *\/\n\/* without limitation the rights to use, copy, modify, merge, publish,   *\/\n\/* distribute, sublicense, and\/or sell copies of the Software, and to    *\/\n\/* permit persons to whom the Software is furnished to do so, subject to *\/\n\/* the following conditions:                                             *\/\n\/*                                                                       *\/\n\/* The above copyright notice and this permission notice shall be        *\/\n\/* included in all copies or substantial portions of the Software.       *\/\n\/*                                                                       *\/\n\/* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,       *\/\n\/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF    *\/\n\/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*\/\n\/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY  *\/\n\/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,  *\/\n\/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE     *\/\n\/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.                *\/\n\/*************************************************************************\/\n#include \"slider.h\"\n#include \"os\/keyboard.h\"\n\n\nSize2 Slider::get_minimum_size() const {\n\n\tRef<StyleBox> style = get_stylebox(\"slider\");\n\tSize2i ms = style->get_minimum_size()+style->get_center_size();\n\treturn ms;\n}\n\nvoid Slider::_input_event(InputEvent p_event) {\n\n\n\n\tif (p_event.type==InputEvent::MOUSE_BUTTON) {\n\n\t\tInputEventMouseButton &mb = p_event.mouse_button;\n\t\tif (mb.button_index==BUTTON_LEFT) {\n\n\t\t\tif (mb.pressed)\t{\n\t\t\t\tRef<Texture> grabber = get_icon(mouse_inside||has_focus()?\"grabber_hilite\":\"grabber\");\t\t\t\t\n\t\t\t\tgrab.pos=orientation==VERTICAL?mb.y:mb.x;\n\t\t\t\tdouble grab_width = (double)grabber->get_size().width;\n\t\t\t\tdouble grab_height = (double)grabber->get_size().height;\n\t\t\t\tdouble max = orientation==VERTICAL ? get_size().height - grab_height : get_size().width - grab_width;\n\t\t\t\tif (orientation==VERTICAL)\n\t\t\t\t\tset_unit_value( 1 - (((double)grab.pos - (grab_height \/ 2.0)) \/ max) );\n\t\t\t\telse\n\t\t\t\t\tset_unit_value(((double)grab.pos - (grab_width\/2.0)) \/ max);\n\t\t\t\tgrab.active=true;\n\t\t\t\tgrab.uvalue=get_unit_value();\n\t\t\t} else {\n\t\t\t\tgrab.active=false;\n\t\t\t}\n\t\t} else if (mb.pressed && mb.button_index==BUTTON_WHEEL_UP) {\n\n\t\t\tset_val( get_val() + get_step());\n\t\t} else if (mb.pressed && mb.button_index==BUTTON_WHEEL_DOWN) {\n\t\t\tset_val( get_val() - get_step());\n\t\t}\n\n\t} else if (p_event.type==InputEvent::MOUSE_MOTION) {\n\n\t\tif (grab.active) {\n\n\t\t\tSize2i size = get_size();\n\t\t\tRef<Texture> grabber = get_icon(\"grabber\");\n\t\t\tfloat motion =  (orientation==VERTICAL?p_event.mouse_motion.y:p_event.mouse_motion.x) - grab.pos;\n\t\t\tif (orientation==VERTICAL)\n\t\t\t\tmotion=-motion;\n\t\t\tfloat areasize = orientation==VERTICAL?size.height - grabber->get_size().height:size.width - grabber->get_size().width;\n\t\t\tif (areasize<=0)\n\t\t\t\treturn;\n\t\t\tfloat umotion = motion \/ float(areasize);\n\t\t\tset_unit_value( grab.uvalue + umotion );\n\t\t}\n\t} else {\n\n\t\tif (p_event.is_action(\"ui_left\") && p_event.is_pressed()) {\n\n\t\t\tif (orientation!=HORIZONTAL)\n\t\t\t\treturn;\n\t\t\tset_val( get_val() - (custom_step>=0?custom_step:get_step()) );\n\t\t\taccept_event();\n\t\t} else if (p_event.is_action(\"ui_right\") && p_event.is_pressed()) {\n\n\t\t\tif (orientation!=HORIZONTAL)\n\t\t\t\treturn;\n\t\t\tset_val( get_val() + (custom_step>=0?custom_step:get_step()) );\n\t\t\taccept_event();\n\t\t} else if (p_event.is_action(\"ui_up\") && p_event.is_pressed()) {\n\n\t\t\tif (orientation!=VERTICAL)\n\t\t\t\treturn;\n\n\t\t\tset_val( get_val() + (custom_step>=0?custom_step:get_step()) );\n\t\t\taccept_event();\n\t\t} else if (p_event.is_action(\"ui_down\") && p_event.is_pressed()) {\n\n\t\t\tif (orientation!=VERTICAL)\n\t\t\t\treturn;\n\t\t\tset_val( get_val() - (custom_step>=0?custom_step:get_step()) );\n\t\t\taccept_event();\n\n\t\t} else if (p_event.type==InputEvent::KEY) {\n\n\t\t\tconst InputEventKey &k=p_event.key;\n\n\t\t\tif (!k.pressed)\n\t\t\t\treturn;\n\n\t\t\tswitch (k.scancode) {\n\n\t\t\t\tcase KEY_HOME: {\n\n\t\t\t\t\tset_val( get_min() );\n\t\t\t\t\taccept_event();\n\t\t\t\t} break;\n\t\t\t\tcase KEY_END: {\n\n\t\t\t\t\tset_val( get_max() );\n\t\t\t\t\taccept_event();\n\n\t\t\t\t} break;\n\n\t\t\t} ;\n\t\t}\n\t}\n\n}\n\nvoid Slider::_notification(int p_what) {\n\n\n\tswitch(p_what) {\n\n\t\tcase NOTIFICATION_MOUSE_ENTER: {\n\n\t\t\tmouse_inside=true;\n\t\t\tupdate();\n\t\t} break;\n\t\tcase NOTIFICATION_MOUSE_EXIT: {\n\n\t\t\tmouse_inside=false;\n\t\t\tupdate();\n\t\t} break;\n\t\tcase NOTIFICATION_DRAW: {\n\t\t\tRID ci = get_canvas_item();\n\t\t\tSize2i size = get_size();\n\t\t\tRef<StyleBox> style = get_stylebox(\"slider\");\n\t\t\tRef<StyleBox> focus = get_stylebox(\"focus\");\n\t\t\tRef<Texture> grabber = get_icon(mouse_inside||has_focus()?\"grabber_hilite\":\"grabber\");\n\t\t\tRef<Texture> tick = get_icon(\"tick\");\n\n\t\t\tif (orientation==VERTICAL) {\n\n\t\t\t\tstyle->draw(ci,Rect2i(Point2i(),Size2i(style->get_minimum_size().width+style->get_center_size().width,size.height)));\n\t\t\t\t\/\/if (mouse_inside||has_focus())\n\t\t\t\t\/\/\tfocus->draw(ci,Rect2i(Point2i(),Size2i(style->get_minimum_size().width+style->get_center_size().width,size.height)));\n\t\t\t\tfloat areasize = size.height - grabber->get_size().height;\n\t\t\t\tif (ticks>1) {\n\t\t\t\t\tint tickarea = size.height - tick->get_height();\n\t\t\t\t\tfor(int i=0;i<ticks;i++) {\n\t\t\t\t\t        if( ! ticks_on_borders && (i == 0 || i + 1 == ticks) ) continue;\n\t\t\t\t\t\tint ofs = i*tickarea\/(ticks-1);\n\t\t\t\t\t\ttick->draw(ci,Point2(0,ofs));\n\t\t\t\t\t}\n\n\t\t\t\t}\n\t\t\t\tgrabber->draw(ci,Point2i(size.width\/2-grabber->get_size().width\/2,size.height - get_unit_value()*areasize - grabber->get_size().height));\n\t\t\t} else {\n\t\t\t\tstyle->draw(ci,Rect2i(Point2i(),Size2i(size.width,style->get_minimum_size().height+style->get_center_size().height)));\n\t\t\t\t\/\/if (mouse_inside||has_focus())\n\t\t\t\t\/\/\tfocus->draw(ci,Rect2i(Point2i(),Size2i(size.width,style->get_minimum_size().height+style->get_center_size().height)));\n\n\t\t\t\tfloat areasize = size.width - grabber->get_size().width;\n\t\t\t\tif (ticks>1) {\n\t\t\t\t\tint tickarea = size.width - tick->get_width();\n\t\t\t\t\tfor(int i=0;i<ticks;i++) {\n\t\t\t\t\t        if( (! ticks_on_borders) && ( (i == 0) || ((i + 1) == ticks)) ) continue;\n\t\t\t\t\t\tint ofs = i*tickarea\/(ticks-1);\n\t\t\t\t\t\ttick->draw(ci,Point2(ofs,0));\n\t\t\t\t\t}\n\n\t\t\t\t}\n\t\t\t\tgrabber->draw(ci,Point2i(get_unit_value()*areasize,size.height\/2-grabber->get_size().height\/2));\n\t\t\t}\n\n\t\t} break;\n\t}\n}\n\nvoid Slider::set_custom_step(float p_custom_step) {\n\n\tcustom_step=p_custom_step;\n}\n\nfloat Slider::get_custom_step() const {\n\n\treturn custom_step;\n}\n\nvoid Slider::set_ticks(int p_count) {\n\n\tticks=p_count;\n\tupdate();\n}\n\nint Slider::get_ticks() const {\n\n\treturn ticks;\n}\n\nbool Slider::get_ticks_on_borders() const{\n\treturn ticks_on_borders;\n}\n\nvoid Slider::set_ticks_on_borders(bool _tob){\n\tticks_on_borders = _tob;\n\tupdate();\n}\n\nvoid Slider::_bind_methods() {\n\n\tObjectTypeDB::bind_method(_MD(\"_input_event\"),&Slider::_input_event);\n\tObjectTypeDB::bind_method(_MD(\"set_ticks\",\"count\"),&Slider::set_ticks);\n\tObjectTypeDB::bind_method(_MD(\"get_ticks\"),&Slider::get_ticks);\n\n\tObjectTypeDB::bind_method(_MD(\"get_ticks_on_borders\"),&Slider::get_ticks_on_borders);\n\tObjectTypeDB::bind_method(_MD(\"set_ticks_on_borders\",\"ticks_on_border\"),&Slider::set_ticks_on_borders);\n\n\tADD_PROPERTY( PropertyInfo( Variant::INT, \"tick_count\", PROPERTY_HINT_RANGE,\"0,4096,1\"), _SCS(\"set_ticks\"), _SCS(\"get_ticks\") );\n        ADD_PROPERTY( PropertyInfo( Variant::BOOL, \"ticks_on_borders\" ), _SCS(\"set_ticks_on_borders\"), _SCS(\"get_ticks_on_borders\") );\n\tADD_PROPERTY( PropertyInfo( Variant::INT,\"focus_mode\", PROPERTY_HINT_ENUM, \"None,Click,All\" ), _SCS(\"set_focus_mode\"), _SCS(\"get_focus_mode\") );\n\n}\n\nSlider::Slider(Orientation p_orientation) {\n\torientation=p_orientation;\n\tmouse_inside=false;\n\tgrab.active=false;\n\tticks=0;\n\tcustom_step=-1;\n\tset_focus_mode(FOCUS_ALL);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/** \\file    add_authority_beacon_information.cc\n *  \\brief   Adds BEACON information to authority files\n *  \\author  Dr. Johannes Ruscheinski\n *\n *  Copyright (C) 2018,2019 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 <iostream>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <cctype>\n#include <cstdlib>\n#include \"BeaconFile.h\"\n#include \"Compiler.h\"\n#include \"FileUtil.h\"\n#include \"MARC.h\"\n#include \"StringUtil.h\"\n#include \"Url.h\"\n#include \"util.h\"\n\n\nnamespace {\n\n\nstd::string NameFromURL(const std::string &url_string) {\n    const Url url(url_string);\n    std::string name(url.getAuthority());\n    if (StringUtil::StartsWith(name, \"www.\", \/* ignore_case = *\/true))\n        name = name.substr(__builtin_strlen(\"www.\"));\n    const auto last_dot_pos(name.rfind('.'));\n    if (last_dot_pos != std::string::npos)\n        name.resize(last_dot_pos);\n    StringUtil::Map(&name, '.', ' ');\n\n    \/\/ Convert the first letter of each \"word\" to uppercase:\n    bool first_char_of_word(true);\n    for (auto &ch : name) {\n        if (first_char_of_word)\n            ch = std::toupper(ch);\n        first_char_of_word = ch == ' ' or ch == '-';\n    }\n\n    return name;\n}\n\n\nvoid CollectBeaconLinks(const std::string &beacon_filename,\n                        std::unordered_map<std::string, std::set<std::pair<std::string, std::string>>> * const gnd_numbers_to_beacon_links_map)\n{\n    const BeaconFile beacon(beacon_filename);\n    const std::string institution_name(NameFromURL(beacon.getUrlTemplate()));\n\n    for (auto entry = beacon.begin(); entry != beacon.end(); ++entry) {\n        const std::string entry_url(beacon.getURL(*entry));\n        auto gnd_number_and_beacon_links(gnd_numbers_to_beacon_links_map->find(entry->gnd_number_));\n        if (gnd_number_and_beacon_links == gnd_numbers_to_beacon_links_map->end())\n            (*gnd_numbers_to_beacon_links_map)[entry->gnd_number_] =\n                std::set<std::pair<std::string, std::string>>({ std::make_pair(institution_name, entry_url) });\n        else\n            gnd_number_and_beacon_links->second.emplace(std::make_pair(institution_name, entry_url));\n    }\n}\n\n\nvoid ProcessAuthorityRecords(\n    MARC::Reader * const authority_reader, MARC::Writer * const authority_writer,\n    const std::unordered_map<std::string, std::set<std::pair<std::string, std::string>>> &gnd_numbers_to_beacon_links_map)\n{\n    unsigned gnd_tagged_count(0);\n    while (auto record = authority_reader->read()) {\n        std::string gnd_number;\n        if (MARC::GetGNDCode(record, &gnd_number)) {\n            const auto gnd_number_and_beacon_links(gnd_numbers_to_beacon_links_map.find(gnd_number));\n            if (gnd_number_and_beacon_links != gnd_numbers_to_beacon_links_map.cend()) {\n                ++gnd_tagged_count;\n                for (const auto &beacon_link : gnd_number_and_beacon_links->second)\n                    record.insertField(\"BEA\", { { 'a', beacon_link.first }, { 'u', beacon_link.second } });\n            }\n        }\n\n        authority_writer->write(record);\n    }\n\n    LOG_INFO(\"tagged \" + std::to_string(gnd_tagged_count) + \" author records with beacon links.\");\n}\n\n\n} \/\/ unnamed namespace\n\n\nint Main(int argc, char **argv) {\n    if (argc < 4)\n        ::Usage(\"authority_records augmented_authority_records [beacon_list1 beacon_list2 .. beacon_listN]\");\n\n    const std::string authority_records_filename(argv[1]);\n    const std::string augmented_authority_records_filename(argv[2]);\n\n    if (unlikely(authority_records_filename == augmented_authority_records_filename))\n        LOG_ERROR(\"Authority data input file name equals authority output file name!\");\n\n    auto authority_reader(MARC::Reader::Factory(authority_records_filename));\n    auto authority_writer(MARC::Writer::Factory(augmented_authority_records_filename));\n\n    std::unordered_map<std::string, std::set<std::pair<std::string, std::string>>> gnd_numbers_to_beacon_links_map;\n    for (int arg_no(3); arg_no < argc; ++arg_no)\n        CollectBeaconLinks(argv[arg_no], &gnd_numbers_to_beacon_links_map);\n\n    ProcessAuthorityRecords(authority_reader.get(), authority_writer.get(), gnd_numbers_to_beacon_links_map);\n\n    return EXIT_SUCCESS;\n}\n<commit_msg>minor change<commit_after>\/** \\file    add_authority_beacon_information.cc\n *  \\brief   Adds BEACON information to authority files\n *  \\author  Dr. Johannes Ruscheinski\n *\n *  Copyright (C) 2018,2019 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 <iostream>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <cctype>\n#include <cstdlib>\n#include \"BeaconFile.h\"\n#include \"Compiler.h\"\n#include \"FileUtil.h\"\n#include \"MARC.h\"\n#include \"StringUtil.h\"\n#include \"Url.h\"\n#include \"util.h\"\n\n\nnamespace {\n\n\nstd::string NameFromURL(const std::string &url_string) {\n    const Url url(url_string);\n    std::string name(url.getAuthority());\n    if (StringUtil::StartsWith(name, \"www.\", \/* ignore_case = *\/true))\n        name = name.substr(__builtin_strlen(\"www.\"));\n    const auto last_dot_pos(name.rfind('.'));\n    if (last_dot_pos != std::string::npos)\n        name.resize(last_dot_pos);\n    StringUtil::Map(&name, '.', ' ');\n\n    \/\/ Convert the first letter of each \"word\" to uppercase:\n    bool first_char_of_word(true);\n    for (auto &ch : name) {\n        if (first_char_of_word)\n            ch = std::toupper(ch);\n        first_char_of_word = ch == ' ' or ch == '-';\n    }\n\n    return name;\n}\n\n\nvoid CollectBeaconLinks(const std::string &beacon_filename,\n                        std::unordered_map<std::string, std::set<std::pair<std::string, std::string>>> * const gnd_numbers_to_beacon_links_map)\n{\n    const BeaconFile beacon(beacon_filename);\n    const std::string institution_name(NameFromURL(beacon.getUrlTemplate()));\n\n    for (auto entry = beacon.begin(); entry != beacon.end(); ++entry) {\n        const std::string entry_url(beacon.getURL(*entry));\n        auto gnd_number_and_beacon_links(gnd_numbers_to_beacon_links_map->find(entry->gnd_number_));\n        if (gnd_number_and_beacon_links == gnd_numbers_to_beacon_links_map->end())\n            (*gnd_numbers_to_beacon_links_map)[entry->gnd_number_] =\n                std::set<std::pair<std::string, std::string>>{ std::make_pair(institution_name, entry_url) };\n        else\n            gnd_number_and_beacon_links->second.emplace(std::make_pair(institution_name, entry_url));\n    }\n}\n\n\nvoid ProcessAuthorityRecords(\n    MARC::Reader * const authority_reader, MARC::Writer * const authority_writer,\n    const std::unordered_map<std::string, std::set<std::pair<std::string, std::string>>> &gnd_numbers_to_beacon_links_map)\n{\n    unsigned gnd_tagged_count(0);\n    while (auto record = authority_reader->read()) {\n        std::string gnd_number;\n        if (MARC::GetGNDCode(record, &gnd_number)) {\n            const auto gnd_number_and_beacon_links(gnd_numbers_to_beacon_links_map.find(gnd_number));\n            if (gnd_number_and_beacon_links != gnd_numbers_to_beacon_links_map.cend()) {\n                ++gnd_tagged_count;\n                for (const auto &beacon_link : gnd_number_and_beacon_links->second)\n                    record.insertField(\"BEA\", { { 'a', beacon_link.first }, { 'u', beacon_link.second } });\n            }\n        }\n\n        authority_writer->write(record);\n    }\n\n    LOG_INFO(\"tagged \" + std::to_string(gnd_tagged_count) + \" author records with beacon links.\");\n}\n\n\n} \/\/ unnamed namespace\n\n\nint Main(int argc, char **argv) {\n    if (argc < 4)\n        ::Usage(\"authority_records augmented_authority_records [beacon_list1 beacon_list2 .. beacon_listN]\");\n\n    const std::string authority_records_filename(argv[1]);\n    const std::string augmented_authority_records_filename(argv[2]);\n\n    if (unlikely(authority_records_filename == augmented_authority_records_filename))\n        LOG_ERROR(\"Authority data input file name equals authority output file name!\");\n\n    auto authority_reader(MARC::Reader::Factory(authority_records_filename));\n    auto authority_writer(MARC::Writer::Factory(augmented_authority_records_filename));\n\n    std::unordered_map<std::string, std::set<std::pair<std::string, std::string>>> gnd_numbers_to_beacon_links_map;\n    for (int arg_no(3); arg_no < argc; ++arg_no)\n        CollectBeaconLinks(argv[arg_no], &gnd_numbers_to_beacon_links_map);\n\n    ProcessAuthorityRecords(authority_reader.get(), authority_writer.get(), gnd_numbers_to_beacon_links_map);\n\n    return EXIT_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n * This file is part of the Gluon Development Platform\n * Copyright (c) 2010 Arjen Hiemstra <ahiemstra@heimr.nl>\n * Copyright (c) 2011 Laszlo Papp <djszapi@archlinux.us>\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA\n *\/\n\n#include \"projectdock.h\"\n\n#include \"filemanager.h\"\n#include \"historymanager.h\"\n#include \"newobjectcommand.h\"\n#include \"objectmanager.h\"\n#include \"selectionmanager.h\"\n#include \"models\/projectmodel.h\"\n#include \"models\/models.h\"\n#include \"models\/modeltest.h\"\n\n#include \"lib\/selectionmanager.h\"\n#include \"lib\/selectionmanager.h\"\n#include \"objectmanager.h\"\n#include \"filemanager.h\"\n#include \"historymanager.h\"\n#include \"newobjectcommand.h\"\n\n#include <core\/debughelper.h>\n#include <core\/gluon_global.h>\n#include <engine\/asset.h>\n#include <engine\/game.h>\n#include <engine\/gameobject.h>\n#include <engine\/gameproject.h>\n#include <engine\/scene.h>\n\n#include <KDE\/KIcon>\n#include <KDE\/KInputDialog>\n#include <KDE\/KLocalizedString>\n#include <KDE\/KMessageBox>\n#include <KDE\/KRun>\n#include <KDE\/KStandardDirs>\n#include <KDE\/KToolBar>\n#include <KDE\/KFileItemListProperties>\n#include <KDE\/KFileItemActions>\n#include <KDE\/KFileDialog>\n\n#include <QtGui\/QMenu>\n#include <QtGui\/QTreeView>\n#include <QtGui\/QVBoxLayout>\n#include <QtGui\/QToolButton>\n#include <QtCore\/QDir>\n#include <QtCore\/QFile>\n#include <QtCore\/QFileInfo>\n\nusing namespace GluonCreator;\n\nclass ProjectDock::ProjectDockPrivate\n{\n    public:\n        ProjectDockPrivate( ProjectDock* parent )\n        {\n            DEBUG_BLOCK\n            q = parent;\n            view = 0;\n            GluonEngine::Asset* theItem;\n            const QHash<QString, const QMetaObject*> types = GluonCore::GluonObjectFactory::instance()->objectTypes();\n            QHash<QString, const QMetaObject*>::const_iterator i;\n            for( i = types.constBegin(); i != types.constEnd(); ++i )\n            {\n                theItem = qobject_cast<GluonEngine::Asset*>( i.value()->newInstance() );\n                if( theItem )\n                {\n                    const QList<GluonEngine::AssetTemplate*> templates = theItem->templates();\n                    for( int j = 0; j < templates.length(); ++j )\n                    {\n                        assetTemplates.append( templates[j] );\n                    }\n                }\n                else\n                {\n                    QObject* obj = i.value()->newInstance();\n                    if( obj )\n                    {\n                        if( obj->inherits( \"GluonEngine::Asset\" ) )\n                        {\n                            DEBUG_TEXT2( \"The Asset class %1 is lacking the Q_INTERFACES(GluonEngine::Asset) macro\", i.value()->className() );\n                        }\n                    }\n                }\n            }\n        }\n        ProjectDock* q;\n        ProjectModel* model;\n        QTreeView* view;\n        KToolBar* toolBar;\n        QMenu* newMenu;\n\n        QModelIndex currentContextIndex;\n        void menuForObject( QModelIndex index, QMenu* menu );\n        QList<QAction*> currentContextMenu;\n        QList<GluonEngine::AssetTemplate*> assetTemplates;\n};\n\nvoid ProjectDock::ProjectDockPrivate::menuForObject( QModelIndex index, QMenu* menu )\n{\n    GluonCore::GluonObject* object = static_cast<GluonCore::GluonObject*>( index.internalPointer() );\n    if( object )\n    {\n        const QMetaObject* mobj = object->metaObject();\n        if( mobj )\n        {\n            currentContextIndex = index;\n            QAction* action;\n            if( object->inherits( \"GluonEngine::Asset\" ) )\n            {\n                GluonEngine::Asset* asset = qobject_cast< GluonEngine::Asset* >( object );\n                if( asset )\n                {\n                    if(!asset->inherits(\"GluonEngine::Scene\"))\n                    {\n                        KFileItem item(KFileItem::Unknown, KFileItem::Unknown, KUrl(asset->absolutePath()));\n                        KFileItemListProperties properties(KFileItemList() << item );\n                        KFileItemActions* openWithActions = new KFileItemActions(menu);\n                        openWithActions->setItemListProperties(properties);\n\n                        openWithActions->addOpenWithActionsTo(menu);\n                    }\n\n                    menu->addSeparator();\n\n                    QList<QAction*> actions = asset->actions();\n                    foreach( QAction * action, actions )\n                    {\n                        connect( action, SIGNAL( triggered( bool ) ), model, SIGNAL( layoutChanged() ) );\n                        menu->addAction(action);\n                    }\n                }\n            }\n            else\n            {\n                menu->addActions(newMenu->actions());\n            }\n\n            if( !object->inherits( \"GluonEngine::GameProject\" ) )\n            {\n                menu->addSeparator();\n\n                action = new QAction( KIcon( \"edit-delete\" ), i18n( \"Delete \\\"%1\\\"...\", object->name() ), this->q );\n                connect( action, SIGNAL( triggered() ), q, SLOT( deleteActionTriggered() ) );\n                menu->addAction( action );\n            }\n        }\n    }\n}\n\n\n\nProjectDock::ProjectDock( const QString& title, QWidget* parent, Qt::WindowFlags flags )\n    : QDockWidget( title, parent, flags ), d( new ProjectDockPrivate( this ) )\n{\n    setObjectName( \"ProjectDock\" );\n\n    d->model = Models::instance()->projectModel();\n    new ModelTest( d->model, this );\n\n    d->view = new QTreeView( this );\n    d->view->setModel( d->model );\n    d->view->setHeaderHidden( true );\n    d->view->setDragEnabled( true );\n    d->view->setAcceptDrops( true );\n    d->view->setContextMenuPolicy( Qt::CustomContextMenu );\n    d->view->setEditTriggers( QAbstractItemView::NoEditTriggers );\n    connect( d->view, SIGNAL( customContextMenuRequested( const QPoint& ) ), SLOT( showContextMenuRequested( const QPoint& ) ) );\n    connect( d->view->selectionModel(), SIGNAL( selectionChanged( QItemSelection, QItemSelection ) ), SLOT( selectionChanged( QItemSelection, QItemSelection ) ) );\n\n    d->model->setProject( GluonEngine::Game::instance()->gameProject() );\n    connect( GluonEngine::Game::instance(), SIGNAL( currentProjectChanged( GluonEngine::GameProject* ) ), SLOT( currentProjectChanged( GluonEngine::GameProject* ) ) );\n    connect( d->view, SIGNAL( doubleClicked( QModelIndex ) ), SLOT( activated( QModelIndex ) ) );\n\n    QWidget* widget = new QWidget( this );\n    QVBoxLayout* layout = new QVBoxLayout();\n    layout->setContentsMargins( 0, 0, 0, 0 );\n    layout->setSpacing( 0 );\n    widget->setLayout( layout );\n\n    d->toolBar = new KToolBar( widget );\n    d->toolBar->setIconDimensions( 16 );\n\n    d->newMenu = new QMenu(i18n(\"New\"), d->toolBar);\n\n    QToolButton* menuButton = new QToolButton(d->toolBar);\n    menuButton->setIcon(KIcon(\"document-new\"));\n    menuButton->setText(i18n(\"Add...\"));\n    menuButton->setPopupMode(QToolButton::InstantPopup);\n    menuButton->setToolButtonStyle(Qt::ToolButtonTextBesideIcon);\n    menuButton->setMenu(d->newMenu);\n\n    d->toolBar->insertWidget(0, menuButton);\n\n    d->newMenu->addAction( KIcon( \"folder\" ), i18n( \"New Folder\" ), this, SLOT( newSubMenuTriggered() ) );\n    d->newMenu->addAction( KIcon( \"document-new\" ), i18n( \"New Scene\" ), ObjectManager::instance(), SLOT( createNewScene() ) );\n    d->newMenu->addSeparator();\n\n    \/\/ Run through all the templates and add an action for each...\n    foreach( const GluonEngine::AssetTemplate * item, d->assetTemplates )\n    {\n        QAction* action = d->newMenu->addAction( i18n( \"New %1\" ).arg( item->name ), this, SLOT( newAssetTriggered() ));\n        action->setProperty( \"newAssetClassname\", QString( item->parent()->metaObject()->className() ) );\n        action->setProperty( \"newAssetName\", item->name );\n        action->setProperty( \"newAssetPluginname\", item->pluginname );\n        action->setProperty( \"newAssetFilename\", item->filename );\n    }\n\n    d->newMenu->addSeparator();\n    d->newMenu->addAction( KIcon(\"document-import\"), i18n(\"Import Assets...\"), this, SLOT(importAssetsTriggered()) );\n\n    d->toolBar->addAction( KIcon( \"edit-delete\" ), i18nc( \"Delete selected object from project\", \"Delete\" ), this, SLOT( deleteActionTriggered() ) );\n\n    layout->addWidget( d->toolBar );\n    layout->addWidget( d->view );\n\n    setWidget( widget );\n}\n\nProjectDock::~ProjectDock()\n{\n    delete d;\n}\n\nvoid ProjectDock::activated( QModelIndex index )\n{\n    DEBUG_FUNC_NAME\n    if( !index.isValid() )\n    {\n        return;\n    }\n\n    QObject* obj = static_cast<QObject*>( index.internalPointer() );\n    if( !obj )\n    {\n        return;\n    }\n\n    GluonEngine::Scene* scene = qobject_cast<GluonEngine::Scene*>( obj );\n    GluonEngine::Asset* asset = qobject_cast<GluonEngine::Asset*>( obj );\n    \/\/ Scene's a special asset, so we check for that first\n    if( scene )\n    {\n        if( GluonEngine::Game::instance()->currentScene() != scene )\n        {\n            GluonEngine::Game::instance()->setCurrentScene( scene );\n            GluonEngine::Game::instance()->initializeAll();\n            GluonEngine::Game::instance()->drawAll();\n        }\n    }\n    else if( asset )\n    {\n        FileManager::instance()->openAsset( asset );\n    }\n}\n\nvoid ProjectDock::selectionChanged( const QItemSelection& selected, const QItemSelection& deselected )\n{\n    Q_UNUSED( deselected )\n\n    SelectionManager::SelectionList selection;\n    foreach( const QItemSelectionRange & range, selected )\n    {\n        foreach( const QModelIndex & index, range.indexes() )\n        {\n            GluonCore::GluonObject* obj = static_cast<GluonCore::GluonObject*>( index.internalPointer() );\n            selection.append( obj );\n        }\n    }\n    SelectionManager::instance()->setSelection( selection );\n}\n\nvoid ProjectDock::currentProjectChanged( GluonEngine::GameProject* project )\n{\n    d->model->setProject( project );\n\n    if( !d->toolBar->isEnabled() )\n        d->toolBar->setEnabled( true );\n\n    d->view->expandAll();\n}\n\nvoid ProjectDock::showContextMenuRequested( const QPoint& pos )\n{\n    QModelIndex index = d->view->indexAt( pos );\n    if( !index.isValid() )\n        index = d->model->index( 0, 0 );\n\n    QMenu menu( static_cast<GluonCore::GluonObject*>( index.internalPointer() )->name(), this );\n    d->menuForObject(index, &menu);\n    menu.exec( d->view->mapToGlobal( pos ) );\n    connect( &menu, SIGNAL( aboutToHide() ), SLOT( contextMenuHiding() ) );\n}\n\nvoid ProjectDock::contextMenuHiding()\n{\n    d->currentContextIndex = QModelIndex();\n}\n\nvoid ProjectDock::deleteActionTriggered()\n{\n    DEBUG_BLOCK\n    if( !d->currentContextIndex.isValid() )\n        d->currentContextIndex = d->view->selectionModel()->currentIndex();\n\n    if( !d->currentContextIndex.isValid() )\n        return;\n\n\n    GluonCore::GluonObject* object = static_cast<GluonCore::GluonObject*>( d->currentContextIndex.internalPointer() );\n    DEBUG_TEXT( QString( \"Requested deletion of %1\" ).arg( object->fullyQualifiedName() ) );\n    if( KMessageBox::questionYesNo( this, i18n( \"Are you sure you wish to delete %1?\\nThis will delete the item and all its children!\" ).arg( object->name() ), i18n( \"Really Delete?\" ) ) == KMessageBox::Yes )\n    {\n        ObjectManager::instance()->assetDeleted( static_cast<GluonEngine::Asset*>( object ) );\n\n        d->view->selectionModel()->select( d->currentContextIndex.parent(), QItemSelectionModel::ClearAndSelect );\n        d->model->removeRows( d->currentContextIndex.row(), 1, d->currentContextIndex.parent() );\n\n        d->currentContextIndex = QModelIndex();\n    }\n}\n\nvoid ProjectDock::newSubMenuTriggered()\n{\n    if( !d->currentContextIndex.isValid() )\n        d->currentContextIndex = d->model->index(0, 0);\n\n    QModelIndex newFolder = d->model->addChild( new GluonCore::GluonObject( i18n(\"New Folder\") ), d->currentContextIndex );\n    d->view->edit(newFolder);\n}\n\nvoid GluonCreator::ProjectDock::newAssetTriggered()\n{\n    if( !d->currentContextIndex.isValid() )\n        d->currentContextIndex = d->model->index(0, 0);\n\n    QAction* menuItem = qobject_cast< QAction* >( QObject::sender() );\n    if( menuItem )\n    {\n        QString templateFilename = QString( \"gluon\/templates\/%1\/%2\" ).arg( menuItem->property( \"newAssetPluginname\" ).toString() ).arg( menuItem->property( \"newAssetFilename\" ).toString() );\n        QString fileName = GluonCore::Global::dataDirectory() + '\/' + templateFilename;\n        if( fileName.isEmpty() )\n        {\n            DEBUG_BLOCK\n            DEBUG_TEXT( \"Failed at finding the template file!\" );\n            return;\n        }\n\n        GluonEngine::Asset* newAsset = ObjectManager::instance()->createNewAsset(fileName,\n                                                                                 menuItem->property( \"newAssetClassname\" ).toString(),\n                                                                                 menuItem->property( \"newAssetName\" ).toString() );\n\n        if( newAsset )\n        {\n            d->model->addChild( newAsset, d->currentContextIndex );\n        }\n    }\n}\n\nvoid ProjectDock::importAssetsTriggered()\n{\n    ObjectManager::instance()->createAssets(KFileDialog::getOpenFileNames());\n}\n<commit_msg>Fix the compilation breakage in case of linux, debian, 4.4.5<commit_after>\/******************************************************************************\n * This file is part of the Gluon Development Platform\n * Copyright (c) 2010 Arjen Hiemstra <ahiemstra@heimr.nl>\n * Copyright (c) 2011 Laszlo Papp <djszapi@archlinux.us>\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA\n *\/\n\n#include \"projectdock.h\"\n\n#include \"filemanager.h\"\n#include \"historymanager.h\"\n#include \"newobjectcommand.h\"\n#include \"objectmanager.h\"\n#include \"selectionmanager.h\"\n#include \"models\/projectmodel.h\"\n#include \"models\/models.h\"\n#include \"models\/modeltest.h\"\n\n#include \"lib\/selectionmanager.h\"\n#include \"lib\/selectionmanager.h\"\n#include \"objectmanager.h\"\n#include \"filemanager.h\"\n#include \"historymanager.h\"\n#include \"newobjectcommand.h\"\n\n#include <core\/debughelper.h>\n#include <core\/gluon_global.h>\n#include <engine\/asset.h>\n#include <engine\/game.h>\n#include <engine\/gameobject.h>\n#include <engine\/gameproject.h>\n#include <engine\/scene.h>\n\n#include <KDE\/KIcon>\n#include <KDE\/KInputDialog>\n#include <KDE\/KLocalizedString>\n#include <KDE\/KMessageBox>\n#include <KDE\/KRun>\n#include <KDE\/KStandardDirs>\n#include <KDE\/KToolBar>\n#include <KDE\/KFileItemListProperties>\n#include <KDE\/KFileItemActions>\n#include <KDE\/KFileDialog>\n\n#include <QtGui\/QMenu>\n#include <QtGui\/QTreeView>\n#include <QtGui\/QVBoxLayout>\n#include <QtGui\/QToolButton>\n#include <QtCore\/QDir>\n#include <QtCore\/QFile>\n#include <QtCore\/QFileInfo>\n\nusing namespace GluonCreator;\n\nclass ProjectDock::ProjectDockPrivate\n{\n    public:\n        ProjectDockPrivate( ProjectDock* parent )\n        {\n            DEBUG_BLOCK\n            q = parent;\n            view = 0;\n            GluonEngine::Asset* theItem;\n            const QHash<QString, const QMetaObject*> types = GluonCore::GluonObjectFactory::instance()->objectTypes();\n            QHash<QString, const QMetaObject*>::const_iterator i;\n            for( i = types.constBegin(); i != types.constEnd(); ++i )\n            {\n                theItem = qobject_cast<GluonEngine::Asset*>( i.value()->newInstance() );\n                if( theItem )\n                {\n                    const QList<GluonEngine::AssetTemplate*> templates = theItem->templates();\n                    for( int j = 0; j < templates.length(); ++j )\n                    {\n                        assetTemplates.append( templates[j] );\n                    }\n                }\n                else\n                {\n                    QObject* obj = i.value()->newInstance();\n                    if( obj )\n                    {\n                        if( obj->inherits( \"GluonEngine::Asset\" ) )\n                        {\n                            DEBUG_TEXT2( \"The Asset class %1 is lacking the Q_INTERFACES(GluonEngine::Asset) macro\", i.value()->className() );\n                        }\n                    }\n                }\n            }\n        }\n        ProjectDock* q;\n        ProjectModel* model;\n        QTreeView* view;\n        KToolBar* toolBar;\n        QMenu* newMenu;\n\n        QModelIndex currentContextIndex;\n        void menuForObject( QModelIndex index, QMenu* menu );\n        QList<QAction*> currentContextMenu;\n        QList<GluonEngine::AssetTemplate*> assetTemplates;\n};\n\nvoid ProjectDock::ProjectDockPrivate::menuForObject( QModelIndex index, QMenu* menu )\n{\n    GluonCore::GluonObject* object = static_cast<GluonCore::GluonObject*>( index.internalPointer() );\n    if( object )\n    {\n        const QMetaObject* mobj = object->metaObject();\n        if( mobj )\n        {\n            currentContextIndex = index;\n            QAction* action;\n            if( object->inherits( \"GluonEngine::Asset\" ) )\n            {\n                GluonEngine::Asset* asset = qobject_cast< GluonEngine::Asset* >( object );\n                if( asset )\n                {\n                    if(!asset->inherits(\"GluonEngine::Scene\"))\n                    {\n                        KFileItem item(KFileItem::Unknown, KFileItem::Unknown, KUrl(asset->absolutePath()));\n                        KFileItemListProperties properties(KFileItemList() << item );\n                        KFileItemActions* openWithActions = new KFileItemActions(menu);\n                        openWithActions->setItemListProperties(properties);\n\n                        openWithActions->addOpenWithActionsTo(menu, QString());\n                    }\n\n                    menu->addSeparator();\n\n                    QList<QAction*> actions = asset->actions();\n                    foreach( QAction * action, actions )\n                    {\n                        connect( action, SIGNAL( triggered( bool ) ), model, SIGNAL( layoutChanged() ) );\n                        menu->addAction(action);\n                    }\n                }\n            }\n            else\n            {\n                menu->addActions(newMenu->actions());\n            }\n\n            if( !object->inherits( \"GluonEngine::GameProject\" ) )\n            {\n                menu->addSeparator();\n\n                action = new QAction( KIcon( \"edit-delete\" ), i18n( \"Delete \\\"%1\\\"...\", object->name() ), this->q );\n                connect( action, SIGNAL( triggered() ), q, SLOT( deleteActionTriggered() ) );\n                menu->addAction( action );\n            }\n        }\n    }\n}\n\n\n\nProjectDock::ProjectDock( const QString& title, QWidget* parent, Qt::WindowFlags flags )\n    : QDockWidget( title, parent, flags ), d( new ProjectDockPrivate( this ) )\n{\n    setObjectName( \"ProjectDock\" );\n\n    d->model = Models::instance()->projectModel();\n    new ModelTest( d->model, this );\n\n    d->view = new QTreeView( this );\n    d->view->setModel( d->model );\n    d->view->setHeaderHidden( true );\n    d->view->setDragEnabled( true );\n    d->view->setAcceptDrops( true );\n    d->view->setContextMenuPolicy( Qt::CustomContextMenu );\n    d->view->setEditTriggers( QAbstractItemView::NoEditTriggers );\n    connect( d->view, SIGNAL( customContextMenuRequested( const QPoint& ) ), SLOT( showContextMenuRequested( const QPoint& ) ) );\n    connect( d->view->selectionModel(), SIGNAL( selectionChanged( QItemSelection, QItemSelection ) ), SLOT( selectionChanged( QItemSelection, QItemSelection ) ) );\n\n    d->model->setProject( GluonEngine::Game::instance()->gameProject() );\n    connect( GluonEngine::Game::instance(), SIGNAL( currentProjectChanged( GluonEngine::GameProject* ) ), SLOT( currentProjectChanged( GluonEngine::GameProject* ) ) );\n    connect( d->view, SIGNAL( doubleClicked( QModelIndex ) ), SLOT( activated( QModelIndex ) ) );\n\n    QWidget* widget = new QWidget( this );\n    QVBoxLayout* layout = new QVBoxLayout();\n    layout->setContentsMargins( 0, 0, 0, 0 );\n    layout->setSpacing( 0 );\n    widget->setLayout( layout );\n\n    d->toolBar = new KToolBar( widget );\n    d->toolBar->setIconDimensions( 16 );\n\n    d->newMenu = new QMenu(i18n(\"New\"), d->toolBar);\n\n    QToolButton* menuButton = new QToolButton(d->toolBar);\n    menuButton->setIcon(KIcon(\"document-new\"));\n    menuButton->setText(i18n(\"Add...\"));\n    menuButton->setPopupMode(QToolButton::InstantPopup);\n    menuButton->setToolButtonStyle(Qt::ToolButtonTextBesideIcon);\n    menuButton->setMenu(d->newMenu);\n\n    d->toolBar->insertWidget(0, menuButton);\n\n    d->newMenu->addAction( KIcon( \"folder\" ), i18n( \"New Folder\" ), this, SLOT( newSubMenuTriggered() ) );\n    d->newMenu->addAction( KIcon( \"document-new\" ), i18n( \"New Scene\" ), ObjectManager::instance(), SLOT( createNewScene() ) );\n    d->newMenu->addSeparator();\n\n    \/\/ Run through all the templates and add an action for each...\n    foreach( const GluonEngine::AssetTemplate * item, d->assetTemplates )\n    {\n        QAction* action = d->newMenu->addAction( i18n( \"New %1\" ).arg( item->name ), this, SLOT( newAssetTriggered() ));\n        action->setProperty( \"newAssetClassname\", QString( item->parent()->metaObject()->className() ) );\n        action->setProperty( \"newAssetName\", item->name );\n        action->setProperty( \"newAssetPluginname\", item->pluginname );\n        action->setProperty( \"newAssetFilename\", item->filename );\n    }\n\n    d->newMenu->addSeparator();\n    d->newMenu->addAction( KIcon(\"document-import\"), i18n(\"Import Assets...\"), this, SLOT(importAssetsTriggered()) );\n\n    d->toolBar->addAction( KIcon( \"edit-delete\" ), i18nc( \"Delete selected object from project\", \"Delete\" ), this, SLOT( deleteActionTriggered() ) );\n\n    layout->addWidget( d->toolBar );\n    layout->addWidget( d->view );\n\n    setWidget( widget );\n}\n\nProjectDock::~ProjectDock()\n{\n    delete d;\n}\n\nvoid ProjectDock::activated( QModelIndex index )\n{\n    DEBUG_FUNC_NAME\n    if( !index.isValid() )\n    {\n        return;\n    }\n\n    QObject* obj = static_cast<QObject*>( index.internalPointer() );\n    if( !obj )\n    {\n        return;\n    }\n\n    GluonEngine::Scene* scene = qobject_cast<GluonEngine::Scene*>( obj );\n    GluonEngine::Asset* asset = qobject_cast<GluonEngine::Asset*>( obj );\n    \/\/ Scene's a special asset, so we check for that first\n    if( scene )\n    {\n        if( GluonEngine::Game::instance()->currentScene() != scene )\n        {\n            GluonEngine::Game::instance()->setCurrentScene( scene );\n            GluonEngine::Game::instance()->initializeAll();\n            GluonEngine::Game::instance()->drawAll();\n        }\n    }\n    else if( asset )\n    {\n        FileManager::instance()->openAsset( asset );\n    }\n}\n\nvoid ProjectDock::selectionChanged( const QItemSelection& selected, const QItemSelection& deselected )\n{\n    Q_UNUSED( deselected )\n\n    SelectionManager::SelectionList selection;\n    foreach( const QItemSelectionRange & range, selected )\n    {\n        foreach( const QModelIndex & index, range.indexes() )\n        {\n            GluonCore::GluonObject* obj = static_cast<GluonCore::GluonObject*>( index.internalPointer() );\n            selection.append( obj );\n        }\n    }\n    SelectionManager::instance()->setSelection( selection );\n}\n\nvoid ProjectDock::currentProjectChanged( GluonEngine::GameProject* project )\n{\n    d->model->setProject( project );\n\n    if( !d->toolBar->isEnabled() )\n        d->toolBar->setEnabled( true );\n\n    d->view->expandAll();\n}\n\nvoid ProjectDock::showContextMenuRequested( const QPoint& pos )\n{\n    QModelIndex index = d->view->indexAt( pos );\n    if( !index.isValid() )\n        index = d->model->index( 0, 0 );\n\n    QMenu menu( static_cast<GluonCore::GluonObject*>( index.internalPointer() )->name(), this );\n    d->menuForObject(index, &menu);\n    menu.exec( d->view->mapToGlobal( pos ) );\n    connect( &menu, SIGNAL( aboutToHide() ), SLOT( contextMenuHiding() ) );\n}\n\nvoid ProjectDock::contextMenuHiding()\n{\n    d->currentContextIndex = QModelIndex();\n}\n\nvoid ProjectDock::deleteActionTriggered()\n{\n    DEBUG_BLOCK\n    if( !d->currentContextIndex.isValid() )\n        d->currentContextIndex = d->view->selectionModel()->currentIndex();\n\n    if( !d->currentContextIndex.isValid() )\n        return;\n\n\n    GluonCore::GluonObject* object = static_cast<GluonCore::GluonObject*>( d->currentContextIndex.internalPointer() );\n    DEBUG_TEXT( QString( \"Requested deletion of %1\" ).arg( object->fullyQualifiedName() ) );\n    if( KMessageBox::questionYesNo( this, i18n( \"Are you sure you wish to delete %1?\\nThis will delete the item and all its children!\" ).arg( object->name() ), i18n( \"Really Delete?\" ) ) == KMessageBox::Yes )\n    {\n        ObjectManager::instance()->assetDeleted( static_cast<GluonEngine::Asset*>( object ) );\n\n        d->view->selectionModel()->select( d->currentContextIndex.parent(), QItemSelectionModel::ClearAndSelect );\n        d->model->removeRows( d->currentContextIndex.row(), 1, d->currentContextIndex.parent() );\n\n        d->currentContextIndex = QModelIndex();\n    }\n}\n\nvoid ProjectDock::newSubMenuTriggered()\n{\n    if( !d->currentContextIndex.isValid() )\n        d->currentContextIndex = d->model->index(0, 0);\n\n    QModelIndex newFolder = d->model->addChild( new GluonCore::GluonObject( i18n(\"New Folder\") ), d->currentContextIndex );\n    d->view->edit(newFolder);\n}\n\nvoid GluonCreator::ProjectDock::newAssetTriggered()\n{\n    if( !d->currentContextIndex.isValid() )\n        d->currentContextIndex = d->model->index(0, 0);\n\n    QAction* menuItem = qobject_cast< QAction* >( QObject::sender() );\n    if( menuItem )\n    {\n        QString templateFilename = QString( \"gluon\/templates\/%1\/%2\" ).arg( menuItem->property( \"newAssetPluginname\" ).toString() ).arg( menuItem->property( \"newAssetFilename\" ).toString() );\n        QString fileName = GluonCore::Global::dataDirectory() + '\/' + templateFilename;\n        if( fileName.isEmpty() )\n        {\n            DEBUG_BLOCK\n            DEBUG_TEXT( \"Failed at finding the template file!\" );\n            return;\n        }\n\n        GluonEngine::Asset* newAsset = ObjectManager::instance()->createNewAsset(fileName,\n                                                                                 menuItem->property( \"newAssetClassname\" ).toString(),\n                                                                                 menuItem->property( \"newAssetName\" ).toString() );\n\n        if( newAsset )\n        {\n            d->model->addChild( newAsset, d->currentContextIndex );\n        }\n    }\n}\n\nvoid ProjectDock::importAssetsTriggered()\n{\n    ObjectManager::instance()->createAssets(KFileDialog::getOpenFileNames());\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"lw\/net\/socket.h\"\n\n#include <chrono>\n#include <iterator>\n\n\n#include <iostream>\n\n\n#include \"gtest\/gtest.h\"\n#include \"lw\/co\/scheduler.h\"\n#include \"lw\/co\/testing\/destroy_scheduler.h\"\n#include \"lw\/co\/time.h\"\n#include \"lw\/err\/error.h\"\n#include \"lw\/memory\/buffer.h\"\n\nnamespace lw::net {\nnamespace {\n\nusing ::lw::co::testing::destroy_all_schedulers;\n\nclass SocketTest : public ::testing::Test {\nprotected:\n  ~SocketTest() {\n    destroy_all_schedulers();\n  }\n\n  co::Scheduler& scheduler() const {\n    return co::Scheduler::this_thread();\n  }\n\n  std::string to_string(const Buffer& buff) const {\n    return std::string{buff.begin(), buff.end()};\n  }\n};\n\nTEST_F(SocketTest, ConnectToHostAndPort) {\n  scheduler().schedule([]() -> co::Task<void> {\n    Socket sock;\n    EXPECT_FALSE(sock.is_open());\n    co_await sock.connect({.hostname = \"www.google.com\", .service = \"80\"});\n    EXPECT_TRUE(sock.is_open());\n    sock.close();\n    EXPECT_FALSE(sock.is_open());\n  });\n  scheduler().run();\n}\n\nTEST_F(SocketTest, ConnectToHostAndServiceName) {\n  scheduler().schedule([]() -> co::Task<void> {\n    Socket sock;\n    EXPECT_FALSE(sock.is_open());\n    co_await sock.connect({.hostname = \"www.google.com\", .service = \"http\"});\n    EXPECT_TRUE(sock.is_open());\n    sock.close();\n    EXPECT_FALSE(sock.is_open());\n  });\n  scheduler().run();\n}\n\nTEST_F(SocketTest, SendAndReceive) {\n  scheduler().schedule([]() -> co::Task<void> {\n    Socket sock;\n    co_await sock.connect({.hostname = \"www.google.com\", .service = \"80\"});\n\n    const char request[] =\n      \"GET \/ HTTP\/1.1\\r\\n\"\n      \"Host: www.google.com\\r\\n\"\n      \"Connection: close\\r\\n\"\n      \"\\r\\n\";\n    Buffer send_buff{std::begin(request), std::end(request)};\n    std::size_t sent = co_await sock.send(send_buff);\n    EXPECT_EQ(sent, send_buff.size());\n\n    Buffer receive_buff{1024};\n    std::size_t received = co_await sock.receive(receive_buff);\n    EXPECT_GT(received, 15);\n\n    std::string res{reinterpret_cast<const char*>(receive_buff.data()), 15};\n    EXPECT_EQ(res, \"HTTP\/1.1 200 OK\");\n  });\n  scheduler().run();\n}\n\nTEST_F(SocketTest, AcceptConnection) {\n  Buffer send_buff{14};\n  Buffer receive_buff{send_buff.size()};\n\n  \/\/ TODO(alaina): This pointer is needed due to what I believe to be an error\n  \/\/ in GCC around capturing coroutine variables. For some reason if I capture\n  \/\/ by reference in the lambda, then the changes to the buffer do not propagate\n  \/\/ outward. It seems as though a copy of the buffer is made for the coroutine\n  \/\/ instead of the reference propagating.\n  Buffer* receive_buff_ptr = &receive_buff;\n  send_buff.copy(\"Hello, World!\", 14);\n  ASSERT_NE(send_buff, receive_buff);\n  Address addr{.hostname = \"localhost\", .service = \"8080\"};\n\n  scheduler().schedule([=, this]() -> co::Task<void> {\n    Socket server;\n    server.listen(addr);\n\n    Socket client = co_await server.accept();\n    std::size_t received_bytes = co_await client.receive(*receive_buff_ptr);\n    EXPECT_EQ(received_bytes, receive_buff_ptr->size());\n  });\n  scheduler().schedule([&]() -> co::Task<void> {\n    Socket client;\n    co_await client.connect(addr);\n    EXPECT_EQ(co_await client.send(send_buff), send_buff.size());\n  });\n  scheduler().run();\n\n  EXPECT_EQ(to_string(send_buff), to_string(receive_buff));\n}\n\n}\n}\n<commit_msg>Refactored sockets using coroutines<commit_after>#include \"lw\/net\/socket.h\"\n\n#include <string>\n\n#include \"gtest\/gtest.h\"\n#include \"lw\/co\/scheduler.h\"\n#include \"lw\/co\/testing\/destroy_scheduler.h\"\n#include \"lw\/co\/time.h\"\n#include \"lw\/err\/error.h\"\n#include \"lw\/memory\/buffer.h\"\n\nnamespace lw::net {\nnamespace {\n\nusing ::lw::co::testing::destroy_all_schedulers;\n\nclass SocketTest : public ::testing::Test {\nprotected:\n  ~SocketTest() {\n    destroy_all_schedulers();\n  }\n\n  co::Scheduler& scheduler() const {\n    return co::Scheduler::this_thread();\n  }\n\n  std::string to_string(const Buffer& buff) const {\n    return std::string{buff.begin(), buff.end()};\n  }\n};\n\nTEST_F(SocketTest, ConnectToHostAndPort) {\n  scheduler().schedule([]() -> co::Task<void> {\n    Socket sock;\n    EXPECT_FALSE(sock.is_open());\n    co_await sock.connect({.hostname = \"www.google.com\", .service = \"80\"});\n    EXPECT_TRUE(sock.is_open());\n    sock.close();\n    EXPECT_FALSE(sock.is_open());\n  });\n  scheduler().run();\n}\n\nTEST_F(SocketTest, ConnectToHostAndServiceName) {\n  scheduler().schedule([]() -> co::Task<void> {\n    Socket sock;\n    EXPECT_FALSE(sock.is_open());\n    co_await sock.connect({.hostname = \"www.google.com\", .service = \"http\"});\n    EXPECT_TRUE(sock.is_open());\n    sock.close();\n    EXPECT_FALSE(sock.is_open());\n  });\n  scheduler().run();\n}\n\nTEST_F(SocketTest, SendAndReceive) {\n  scheduler().schedule([]() -> co::Task<void> {\n    Socket sock;\n    co_await sock.connect({.hostname = \"www.google.com\", .service = \"80\"});\n\n    const char request[] =\n      \"GET \/ HTTP\/1.1\\r\\n\"\n      \"Host: www.google.com\\r\\n\"\n      \"Connection: close\\r\\n\"\n      \"\\r\\n\";\n    Buffer send_buff{std::begin(request), std::end(request)};\n    std::size_t sent = co_await sock.send(send_buff);\n    EXPECT_EQ(sent, send_buff.size());\n\n    Buffer receive_buff{1024};\n    std::size_t received = co_await sock.receive(receive_buff);\n    EXPECT_GT(received, 15);\n\n    std::string res{reinterpret_cast<const char*>(receive_buff.data()), 15};\n    EXPECT_EQ(res, \"HTTP\/1.1 200 OK\");\n  });\n  scheduler().run();\n}\n\nTEST_F(SocketTest, AcceptConnection) {\n  Buffer send_buff{14};\n  Buffer receive_buff{send_buff.size()};\n\n  \/\/ TODO(alaina): This pointer is needed due to what I believe to be an error\n  \/\/ in GCC around capturing coroutine variables. For some reason if I capture\n  \/\/ by reference in the lambda, then the changes to the buffer do not propagate\n  \/\/ outward. It seems as though a copy of the buffer is made for the coroutine\n  \/\/ instead of the reference propagating.\n  Buffer* receive_buff_ptr = &receive_buff;\n  send_buff.copy(\"Hello, World!\", 14);\n  ASSERT_NE(send_buff, receive_buff);\n  Address addr{.hostname = \"localhost\", .service = \"8080\"};\n\n  scheduler().schedule([=, this]() -> co::Task<void> {\n    Socket server;\n    server.listen(addr);\n\n    Socket client = co_await server.accept();\n    std::size_t received_bytes = co_await client.receive(*receive_buff_ptr);\n    EXPECT_EQ(received_bytes, receive_buff_ptr->size());\n  });\n  scheduler().schedule([&]() -> co::Task<void> {\n    Socket client;\n    co_await client.connect(addr);\n    EXPECT_EQ(co_await client.send(send_buff), send_buff.size());\n  });\n  scheduler().run();\n\n  EXPECT_EQ(to_string(send_buff), to_string(receive_buff));\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 \"chrome\/browser\/lifetime\/application_lifetime.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 \"base\/prefs\/pref_service.h\"\n#include \"build\/build_config.h\"\n#include \"chrome\/browser\/browser_process.h\"\n#include \"chrome\/browser\/browser_shutdown.h\"\n#include \"chrome\/browser\/download\/download_service.h\"\n#include \"chrome\/browser\/metrics\/thread_watcher.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/profiles\/profile_manager.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/browser\/ui\/browser_finder.h\"\n#include \"chrome\/browser\/ui\/browser_iterator.h\"\n#include \"chrome\/browser\/ui\/browser_tabstrip.h\"\n#include \"chrome\/browser\/ui\/browser_window.h\"\n#include \"chrome\/browser\/ui\/tabs\/tab_strip_model.h\"\n#include \"chrome\/common\/chrome_notification_types.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"content\/public\/browser\/browser_shutdown.h\"\n#include \"content\/public\/browser\/browser_thread.h\"\n#include \"content\/public\/browser\/navigation_details.h\"\n#include \"content\/public\/browser\/notification_service.h\"\n\n#if defined(OS_ANDROID)\n#include \"chrome\/browser\/lifetime\/application_lifetime_android.h\"\n#endif\n\n#if defined(OS_MACOSX)\n#include \"chrome\/browser\/chrome_browser_application_mac.h\"\n#endif\n\n#if defined(OS_CHROMEOS)\n#include \"base\/chromeos\/chromeos_version.h\"\n#include \"chrome\/browser\/chromeos\/boot_times_loader.h\"\n#include \"chrome\/browser\/chromeos\/login\/user_manager.h\"\n#include \"chromeos\/dbus\/dbus_thread_manager.h\"\n#include \"chromeos\/dbus\/session_manager_client.h\"\n#include \"chromeos\/dbus\/update_engine_client.h\"\n#endif\n\nnamespace chrome {\nnamespace {\n\n\/\/ Returns true if all browsers can be closed without user interaction.\n\/\/ This currently checks if there is pending download, or if it needs to\n\/\/ handle unload handler.\nbool AreAllBrowsersCloseable() {\n  chrome::BrowserIterator browser_it;\n  if (browser_it.done())\n    return true;\n\n  \/\/ If there are any downloads active, all browsers are not closeable.\n  if (DownloadService::DownloadCountAllProfiles() > 0)\n    return false;\n\n  \/\/ Check TabsNeedBeforeUnloadFired().\n  for (; !browser_it.done(); browser_it.Next()) {\n    if (browser_it->TabsNeedBeforeUnloadFired())\n      return false;\n  }\n  return true;\n}\n\nint g_keep_alive_count = 0;\n\n#if defined(OS_CHROMEOS)\n\/\/ Whether a session manager requested to shutdown.\nbool g_session_manager_requested_shutdown = true;\n#endif\n\n}  \/\/ namespace\n\nvoid MarkAsCleanShutdown() {\n  \/\/ TODO(beng): Can this use ProfileManager::GetLoadedProfiles() instead?\n  for (chrome::BrowserIterator it; !it.done(); it.Next())\n    it->profile()->SetExitType(Profile::EXIT_NORMAL);\n}\n\nvoid AttemptExitInternal() {\n  content::NotificationService::current()->Notify(\n      chrome::NOTIFICATION_CLOSE_ALL_BROWSERS_REQUEST,\n      content::NotificationService::AllSources(),\n      content::NotificationService::NoDetails());\n\n#if defined(OS_ANDROID)\n  \/\/ Tell the Java code to finish() the Activity.\n  TerminateAndroid();\n#elif defined(OS_MACOSX)\n  \/\/ On the Mac, the application continues to run once all windows are closed.\n  \/\/ Terminate will result in a CloseAllBrowsers() call, and once (and if)\n  \/\/ that is done, will cause the application to exit cleanly.\n  chrome_browser_application_mac::Terminate();\n#else\n  \/\/ On most platforms, closing all windows causes the application to exit.\n  CloseAllBrowsers();\n#endif\n}\n\nvoid CloseAllBrowsers() {\n  bool session_ending =\n      browser_shutdown::GetShutdownType() == browser_shutdown::END_SESSION;\n  \/\/ Tell everyone that we are shutting down.\n  browser_shutdown::SetTryingToQuit(true);\n\n#if defined(ENABLE_SESSION_SERVICE)\n  \/\/ Before we close the browsers shutdown all session services. That way an\n  \/\/ exit can restore all browsers open before exiting.\n  ProfileManager::ShutdownSessionServices();\n#endif\n\n  \/\/ If there are no browsers, send the APP_TERMINATING action here. Otherwise,\n  \/\/ it will be sent by RemoveBrowser() when the last browser has closed.\n  if (browser_shutdown::ShuttingDownWithoutClosingBrowsers() ||\n      chrome::GetTotalBrowserCount() == 0) {\n    chrome::NotifyAndTerminate(true);\n    chrome::OnAppExiting();\n    return;\n  }\n\n#if defined(OS_CHROMEOS)\n  chromeos::BootTimesLoader::Get()->AddLogoutTimeMarker(\n      \"StartedClosingWindows\", false);\n#endif\n  for (scoped_ptr<chrome::BrowserIterator> it_ptr(\n           new chrome::BrowserIterator());\n       !it_ptr->done();) {\n    Browser* browser = **it_ptr;\n    browser->window()->Close();\n    if (!session_ending) {\n      it_ptr->Next();\n    } else {\n      \/\/ This path is hit during logoff\/power-down. In this case we won't get\n      \/\/ a final message and so we force the browser to be deleted.\n      \/\/ Close doesn't immediately destroy the browser\n      \/\/ (Browser::TabStripEmpty() uses invoke later) but when we're ending the\n      \/\/ session we need to make sure the browser is destroyed now. So, invoke\n      \/\/ DestroyBrowser to make sure the browser is deleted and cleanup can\n      \/\/ happen.\n      while (browser->tab_strip_model()->count())\n        delete browser->tab_strip_model()->GetWebContentsAt(0);\n      browser->window()->DestroyBrowser();\n      it_ptr.reset(new chrome::BrowserIterator());\n      if (!it_ptr->done() && browser == **it_ptr) {\n        \/\/ Destroying the browser should have removed it from the browser list.\n        \/\/ We should never get here.\n        NOTREACHED();\n        return;\n      }\n    }\n  }\n}\n\nvoid AttemptUserExit() {\n#if defined(OS_CHROMEOS)\n  chromeos::BootTimesLoader::Get()->AddLogoutTimeMarker(\"LogoutStarted\", false);\n  \/\/ Write \/tmp\/uptime-logout-started as well.\n  const char kLogoutStarted[] = \"logout-started\";\n  chromeos::BootTimesLoader::Get()->RecordCurrentStats(kLogoutStarted);\n\n  \/\/ Login screen should show up in owner's locale.\n  PrefService* state = g_browser_process->local_state();\n  if (state) {\n    std::string owner_locale = state->GetString(prefs::kOwnerLocale);\n    if (!owner_locale.empty() &&\n        state->GetString(prefs::kApplicationLocale) != owner_locale &&\n        !state->IsManagedPreference(prefs::kApplicationLocale)) {\n      state->SetString(prefs::kApplicationLocale, owner_locale);\n      state->CommitPendingWrite();\n    }\n  }\n  g_session_manager_requested_shutdown = false;\n  \/\/ On ChromeOS, always terminate the browser, regardless of the result of\n  \/\/ AreAllBrowsersCloseable(). See crbug.com\/123107.\n  chrome::NotifyAndTerminate(true);\n#else\n  \/\/ Reset the restart bit that might have been set in cancelled restart\n  \/\/ request.\n  PrefService* pref_service = g_browser_process->local_state();\n  pref_service->SetBoolean(prefs::kRestartLastSessionOnShutdown, false);\n  AttemptExitInternal();\n#endif\n}\n\n\/\/ The Android implementation is in application_lifetime_android.cc\n#if !defined(OS_ANDROID)\nvoid AttemptRestart() {\n  \/\/ TODO(beng): Can this use ProfileManager::GetLoadedProfiles instead?\n  for (chrome::BrowserIterator it; !it.done(); it.Next())\n    content::BrowserContext::SaveSessionState(it->profile());\n\n  PrefService* pref_service = g_browser_process->local_state();\n  pref_service->SetBoolean(prefs::kWasRestarted, true);\n\n#if defined(OS_CHROMEOS)\n  \/\/ For CrOS instead of browser restart (which is not supported) perform a full\n  \/\/ sign out. Session will be only restored if user has that setting set.\n  \/\/ Same session restore behavior happens in case of full restart after update.\n  AttemptUserExit();\n#else\n  \/\/ Set the flag to restore state after the restart.\n  pref_service->SetBoolean(prefs::kRestartLastSessionOnShutdown, true);\n  AttemptExit();\n#endif\n}\n#endif\n\n#if defined(OS_WIN)\nvoid AttemptRestartWithModeSwitch() {\n  \/\/ The kRestartSwitchMode preference does not exists for Windows 7 and older\n  \/\/ operating systems so there is no need for OS version check.\n  PrefService* prefs = g_browser_process->local_state();\n  prefs->SetBoolean(prefs::kRestartSwitchMode, true);\n  AttemptRestart();\n}\n#endif\n\nvoid AttemptExit() {\n  \/\/ If we know that all browsers can be closed without blocking,\n  \/\/ don't notify users of crashes beyond this point.\n  \/\/ Note that MarkAsCleanShutdown() does not set UMA's exit cleanly bit\n  \/\/ so crashes during shutdown are still reported in UMA.\n#if !defined(OS_ANDROID)\n  \/\/ Android doesn't use Browser.\n  if (AreAllBrowsersCloseable())\n    MarkAsCleanShutdown();\n#endif\n  AttemptExitInternal();\n}\n\n#if defined(OS_CHROMEOS)\n\/\/ A function called when SIGTERM is received.\nvoid ExitCleanly() {\n  \/\/ We always mark exit cleanly because SessionManager may kill\n  \/\/ chrome in 3 seconds after SIGTERM.\n  g_browser_process->EndSession();\n\n  \/\/ Don't block when SIGTERM is received. AreaAllBrowsersCloseable()\n  \/\/ can be false in following cases. a) power-off b) signout from\n  \/\/ screen locker.\n  if (!AreAllBrowsersCloseable())\n    browser_shutdown::OnShutdownStarting(browser_shutdown::END_SESSION);\n  AttemptExitInternal();\n}\n#endif\n\nvoid SessionEnding() {\n  \/\/ This is a time-limited shutdown where we need to write as much to\n  \/\/ disk as we can as soon as we can, and where we must kill the\n  \/\/ process within a hang timeout to avoid user prompts.\n\n  \/\/ Start watching for hang during shutdown, and crash it if takes too long.\n  \/\/ We disarm when |shutdown_watcher| object is destroyed, which is when we\n  \/\/ exit this function.\n  ShutdownWatcherHelper shutdown_watcher;\n  shutdown_watcher.Arm(base::TimeDelta::FromSeconds(90));\n\n  \/\/ EndSession is invoked once per frame. Only do something the first time.\n  static bool already_ended = false;\n  \/\/ We may get called in the middle of shutdown, e.g. http:\/\/crbug.com\/70852\n  \/\/ In this case, do nothing.\n  if (already_ended || !content::NotificationService::current())\n    return;\n  already_ended = true;\n\n  browser_shutdown::OnShutdownStarting(browser_shutdown::END_SESSION);\n\n  content::NotificationService::current()->Notify(\n      chrome::NOTIFICATION_CLOSE_ALL_BROWSERS_REQUEST,\n      content::NotificationService::AllSources(),\n      content::NotificationService::NoDetails());\n\n  \/\/ Write important data first.\n  g_browser_process->EndSession();\n\n  CloseAllBrowsers();\n\n  \/\/ Send out notification. This is used during testing so that the test harness\n  \/\/ can properly shutdown before we exit.\n  content::NotificationService::current()->Notify(\n      chrome::NOTIFICATION_SESSION_END,\n      content::NotificationService::AllSources(),\n      content::NotificationService::NoDetails());\n\n  \/\/ This will end by terminating the process.\n  content::ImmediateShutdownAndExitProcess();\n}\n\nvoid StartKeepAlive() {\n  \/\/ Increment the browser process refcount as long as we're keeping the\n  \/\/ application alive.\n  if (!WillKeepAlive())\n    g_browser_process->AddRefModule();\n  ++g_keep_alive_count;\n}\n\nvoid EndKeepAlive() {\n  DCHECK_GT(g_keep_alive_count, 0);\n  --g_keep_alive_count;\n\n  DCHECK(g_browser_process);\n  \/\/ Although we should have a browser process, if there is none,\n  \/\/ there is nothing to do.\n  if (!g_browser_process) return;\n\n  \/\/ Allow the app to shutdown again.\n  if (!WillKeepAlive()) {\n    g_browser_process->ReleaseModule();\n    \/\/ If there are no browsers open and we aren't already shutting down,\n    \/\/ initiate a shutdown. Also skips shutdown if this is a unit test\n    \/\/ (MessageLoop::current() == null).\n    if (chrome::GetTotalBrowserCount() == 0 &&\n        !browser_shutdown::IsTryingToQuit() &&\n        MessageLoop::current()) {\n      CloseAllBrowsers();\n    }\n  }\n}\n\nbool WillKeepAlive() {\n  return g_keep_alive_count > 0;\n}\n\nvoid NotifyAppTerminating() {\n  static bool notified = false;\n  if (notified)\n    return;\n  notified = true;\n  content::NotificationService::current()->Notify(\n      chrome::NOTIFICATION_APP_TERMINATING,\n      content::NotificationService::AllSources(),\n      content::NotificationService::NoDetails());\n}\n\nvoid NotifyAndTerminate(bool fast_path) {\n#if defined(OS_CHROMEOS)\n  static bool notified = false;\n  \/\/ Return if a shutdown request has already been sent.\n  if (notified)\n    return;\n  notified = true;\n#endif\n\n  if (fast_path)\n    NotifyAppTerminating();\n\n#if defined(OS_CHROMEOS)\n  if (base::chromeos::IsRunningOnChromeOS()) {\n    \/\/ If we're on a ChromeOS device, reboot if an update has been applied,\n    \/\/ or else signal the session manager to log out.\n    chromeos::UpdateEngineClient* update_engine_client\n        = chromeos::DBusThreadManager::Get()->GetUpdateEngineClient();\n    if (update_engine_client->GetLastStatus().status ==\n        chromeos::UpdateEngineClient::UPDATE_STATUS_UPDATED_NEED_REBOOT) {\n      update_engine_client->RebootAfterUpdate();\n    } else if (!g_session_manager_requested_shutdown) {\n      \/\/ Don't ask SessionManager to stop session if the shutdown request comes\n      \/\/ from session manager.\n      chromeos::DBusThreadManager::Get()->GetSessionManagerClient()\n          ->StopSession();\n    }\n  } else {\n    \/\/ If running the Chrome OS build, but we're not on the device, act\n    \/\/ as if we received signal from SessionManager.\n    content::BrowserThread::PostTask(content::BrowserThread::UI, FROM_HERE,\n                                     base::Bind(&ExitCleanly));\n  }\n#endif\n}\n\nvoid OnAppExiting() {\n  static bool notified = false;\n  if (notified)\n    return;\n  notified = true;\n  HandleAppExitingForPlatform();\n}\n\nbool ShouldStartShutdown(Browser* browser) {\n  if (BrowserList::GetInstance(browser->host_desktop_type())->size() > 1)\n    return false;\n#if defined(OS_WIN) && defined(USE_AURA)\n  \/\/ On Windows 8 browser windows could be open in ASH and in the desktop. We\n  \/\/ should not start the shutdown process if browser windows are open in the\n  \/\/ other environment.\n  chrome::HostDesktopType other_desktop =\n      (browser->host_desktop_type() == chrome::HOST_DESKTOP_TYPE_NATIVE ?\n          chrome::HOST_DESKTOP_TYPE_ASH : chrome::HOST_DESKTOP_TYPE_NATIVE);\n  if (!BrowserList::GetInstance(other_desktop)->empty())\n    return false;\n#endif\n  return true;\n}\n\n}  \/\/ namespace chrome\n<commit_msg>On Windows 8 don't assume that the browser is shutting down in desktop mode because the ASH environment could be still active.<commit_after>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/lifetime\/application_lifetime.h\"\n\n#include \"ash\/shell.h\"\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 \"base\/prefs\/pref_service.h\"\n#include \"build\/build_config.h\"\n#include \"chrome\/browser\/browser_process.h\"\n#include \"chrome\/browser\/browser_shutdown.h\"\n#include \"chrome\/browser\/download\/download_service.h\"\n#include \"chrome\/browser\/metrics\/thread_watcher.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/profiles\/profile_manager.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/browser\/ui\/browser_finder.h\"\n#include \"chrome\/browser\/ui\/browser_iterator.h\"\n#include \"chrome\/browser\/ui\/browser_tabstrip.h\"\n#include \"chrome\/browser\/ui\/browser_window.h\"\n#include \"chrome\/browser\/ui\/tabs\/tab_strip_model.h\"\n#include \"chrome\/common\/chrome_notification_types.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"content\/public\/browser\/browser_shutdown.h\"\n#include \"content\/public\/browser\/browser_thread.h\"\n#include \"content\/public\/browser\/navigation_details.h\"\n#include \"content\/public\/browser\/notification_service.h\"\n\n#if defined(OS_ANDROID)\n#include \"chrome\/browser\/lifetime\/application_lifetime_android.h\"\n#endif\n\n#if defined(OS_MACOSX)\n#include \"chrome\/browser\/chrome_browser_application_mac.h\"\n#endif\n\n#if defined(OS_CHROMEOS)\n#include \"base\/chromeos\/chromeos_version.h\"\n#include \"chrome\/browser\/chromeos\/boot_times_loader.h\"\n#include \"chrome\/browser\/chromeos\/login\/user_manager.h\"\n#include \"chromeos\/dbus\/dbus_thread_manager.h\"\n#include \"chromeos\/dbus\/session_manager_client.h\"\n#include \"chromeos\/dbus\/update_engine_client.h\"\n#endif\n\nnamespace chrome {\nnamespace {\n\n\/\/ Returns true if all browsers can be closed without user interaction.\n\/\/ This currently checks if there is pending download, or if it needs to\n\/\/ handle unload handler.\nbool AreAllBrowsersCloseable() {\n  chrome::BrowserIterator browser_it;\n  if (browser_it.done())\n    return true;\n\n  \/\/ If there are any downloads active, all browsers are not closeable.\n  if (DownloadService::DownloadCountAllProfiles() > 0)\n    return false;\n\n  \/\/ Check TabsNeedBeforeUnloadFired().\n  for (; !browser_it.done(); browser_it.Next()) {\n    if (browser_it->TabsNeedBeforeUnloadFired())\n      return false;\n  }\n  return true;\n}\n\nint g_keep_alive_count = 0;\n\n#if defined(OS_CHROMEOS)\n\/\/ Whether a session manager requested to shutdown.\nbool g_session_manager_requested_shutdown = true;\n#endif\n\n}  \/\/ namespace\n\nvoid MarkAsCleanShutdown() {\n  \/\/ TODO(beng): Can this use ProfileManager::GetLoadedProfiles() instead?\n  for (chrome::BrowserIterator it; !it.done(); it.Next())\n    it->profile()->SetExitType(Profile::EXIT_NORMAL);\n}\n\nvoid AttemptExitInternal() {\n  content::NotificationService::current()->Notify(\n      chrome::NOTIFICATION_CLOSE_ALL_BROWSERS_REQUEST,\n      content::NotificationService::AllSources(),\n      content::NotificationService::NoDetails());\n\n#if defined(OS_ANDROID)\n  \/\/ Tell the Java code to finish() the Activity.\n  TerminateAndroid();\n#elif defined(OS_MACOSX)\n  \/\/ On the Mac, the application continues to run once all windows are closed.\n  \/\/ Terminate will result in a CloseAllBrowsers() call, and once (and if)\n  \/\/ that is done, will cause the application to exit cleanly.\n  chrome_browser_application_mac::Terminate();\n#else\n  \/\/ On most platforms, closing all windows causes the application to exit.\n  CloseAllBrowsers();\n#endif\n}\n\nvoid CloseAllBrowsers() {\n  bool session_ending =\n      browser_shutdown::GetShutdownType() == browser_shutdown::END_SESSION;\n  \/\/ Tell everyone that we are shutting down.\n  browser_shutdown::SetTryingToQuit(true);\n\n#if defined(ENABLE_SESSION_SERVICE)\n  \/\/ Before we close the browsers shutdown all session services. That way an\n  \/\/ exit can restore all browsers open before exiting.\n  ProfileManager::ShutdownSessionServices();\n#endif\n\n  \/\/ If there are no browsers, send the APP_TERMINATING action here. Otherwise,\n  \/\/ it will be sent by RemoveBrowser() when the last browser has closed.\n  if (browser_shutdown::ShuttingDownWithoutClosingBrowsers() ||\n      chrome::GetTotalBrowserCount() == 0) {\n    chrome::NotifyAndTerminate(true);\n    chrome::OnAppExiting();\n    return;\n  }\n\n#if defined(OS_CHROMEOS)\n  chromeos::BootTimesLoader::Get()->AddLogoutTimeMarker(\n      \"StartedClosingWindows\", false);\n#endif\n  for (scoped_ptr<chrome::BrowserIterator> it_ptr(\n           new chrome::BrowserIterator());\n       !it_ptr->done();) {\n    Browser* browser = **it_ptr;\n    browser->window()->Close();\n    if (!session_ending) {\n      it_ptr->Next();\n    } else {\n      \/\/ This path is hit during logoff\/power-down. In this case we won't get\n      \/\/ a final message and so we force the browser to be deleted.\n      \/\/ Close doesn't immediately destroy the browser\n      \/\/ (Browser::TabStripEmpty() uses invoke later) but when we're ending the\n      \/\/ session we need to make sure the browser is destroyed now. So, invoke\n      \/\/ DestroyBrowser to make sure the browser is deleted and cleanup can\n      \/\/ happen.\n      while (browser->tab_strip_model()->count())\n        delete browser->tab_strip_model()->GetWebContentsAt(0);\n      browser->window()->DestroyBrowser();\n      it_ptr.reset(new chrome::BrowserIterator());\n      if (!it_ptr->done() && browser == **it_ptr) {\n        \/\/ Destroying the browser should have removed it from the browser list.\n        \/\/ We should never get here.\n        NOTREACHED();\n        return;\n      }\n    }\n  }\n}\n\nvoid AttemptUserExit() {\n#if defined(OS_CHROMEOS)\n  chromeos::BootTimesLoader::Get()->AddLogoutTimeMarker(\"LogoutStarted\", false);\n  \/\/ Write \/tmp\/uptime-logout-started as well.\n  const char kLogoutStarted[] = \"logout-started\";\n  chromeos::BootTimesLoader::Get()->RecordCurrentStats(kLogoutStarted);\n\n  \/\/ Login screen should show up in owner's locale.\n  PrefService* state = g_browser_process->local_state();\n  if (state) {\n    std::string owner_locale = state->GetString(prefs::kOwnerLocale);\n    if (!owner_locale.empty() &&\n        state->GetString(prefs::kApplicationLocale) != owner_locale &&\n        !state->IsManagedPreference(prefs::kApplicationLocale)) {\n      state->SetString(prefs::kApplicationLocale, owner_locale);\n      state->CommitPendingWrite();\n    }\n  }\n  g_session_manager_requested_shutdown = false;\n  \/\/ On ChromeOS, always terminate the browser, regardless of the result of\n  \/\/ AreAllBrowsersCloseable(). See crbug.com\/123107.\n  chrome::NotifyAndTerminate(true);\n#else\n  \/\/ Reset the restart bit that might have been set in cancelled restart\n  \/\/ request.\n  PrefService* pref_service = g_browser_process->local_state();\n  pref_service->SetBoolean(prefs::kRestartLastSessionOnShutdown, false);\n  AttemptExitInternal();\n#endif\n}\n\n\/\/ The Android implementation is in application_lifetime_android.cc\n#if !defined(OS_ANDROID)\nvoid AttemptRestart() {\n  \/\/ TODO(beng): Can this use ProfileManager::GetLoadedProfiles instead?\n  for (chrome::BrowserIterator it; !it.done(); it.Next())\n    content::BrowserContext::SaveSessionState(it->profile());\n\n  PrefService* pref_service = g_browser_process->local_state();\n  pref_service->SetBoolean(prefs::kWasRestarted, true);\n\n#if defined(OS_CHROMEOS)\n  \/\/ For CrOS instead of browser restart (which is not supported) perform a full\n  \/\/ sign out. Session will be only restored if user has that setting set.\n  \/\/ Same session restore behavior happens in case of full restart after update.\n  AttemptUserExit();\n#else\n  \/\/ Set the flag to restore state after the restart.\n  pref_service->SetBoolean(prefs::kRestartLastSessionOnShutdown, true);\n  AttemptExit();\n#endif\n}\n#endif\n\n#if defined(OS_WIN)\nvoid AttemptRestartWithModeSwitch() {\n  \/\/ The kRestartSwitchMode preference does not exists for Windows 7 and older\n  \/\/ operating systems so there is no need for OS version check.\n  PrefService* prefs = g_browser_process->local_state();\n  prefs->SetBoolean(prefs::kRestartSwitchMode, true);\n  AttemptRestart();\n}\n#endif\n\nvoid AttemptExit() {\n  \/\/ If we know that all browsers can be closed without blocking,\n  \/\/ don't notify users of crashes beyond this point.\n  \/\/ Note that MarkAsCleanShutdown() does not set UMA's exit cleanly bit\n  \/\/ so crashes during shutdown are still reported in UMA.\n#if !defined(OS_ANDROID)\n  \/\/ Android doesn't use Browser.\n  if (AreAllBrowsersCloseable())\n    MarkAsCleanShutdown();\n#endif\n  AttemptExitInternal();\n}\n\n#if defined(OS_CHROMEOS)\n\/\/ A function called when SIGTERM is received.\nvoid ExitCleanly() {\n  \/\/ We always mark exit cleanly because SessionManager may kill\n  \/\/ chrome in 3 seconds after SIGTERM.\n  g_browser_process->EndSession();\n\n  \/\/ Don't block when SIGTERM is received. AreaAllBrowsersCloseable()\n  \/\/ can be false in following cases. a) power-off b) signout from\n  \/\/ screen locker.\n  if (!AreAllBrowsersCloseable())\n    browser_shutdown::OnShutdownStarting(browser_shutdown::END_SESSION);\n  AttemptExitInternal();\n}\n#endif\n\nvoid SessionEnding() {\n  \/\/ This is a time-limited shutdown where we need to write as much to\n  \/\/ disk as we can as soon as we can, and where we must kill the\n  \/\/ process within a hang timeout to avoid user prompts.\n\n  \/\/ Start watching for hang during shutdown, and crash it if takes too long.\n  \/\/ We disarm when |shutdown_watcher| object is destroyed, which is when we\n  \/\/ exit this function.\n  ShutdownWatcherHelper shutdown_watcher;\n  shutdown_watcher.Arm(base::TimeDelta::FromSeconds(90));\n\n  \/\/ EndSession is invoked once per frame. Only do something the first time.\n  static bool already_ended = false;\n  \/\/ We may get called in the middle of shutdown, e.g. http:\/\/crbug.com\/70852\n  \/\/ In this case, do nothing.\n  if (already_ended || !content::NotificationService::current())\n    return;\n  already_ended = true;\n\n  browser_shutdown::OnShutdownStarting(browser_shutdown::END_SESSION);\n\n  content::NotificationService::current()->Notify(\n      chrome::NOTIFICATION_CLOSE_ALL_BROWSERS_REQUEST,\n      content::NotificationService::AllSources(),\n      content::NotificationService::NoDetails());\n\n  \/\/ Write important data first.\n  g_browser_process->EndSession();\n\n  CloseAllBrowsers();\n\n  \/\/ Send out notification. This is used during testing so that the test harness\n  \/\/ can properly shutdown before we exit.\n  content::NotificationService::current()->Notify(\n      chrome::NOTIFICATION_SESSION_END,\n      content::NotificationService::AllSources(),\n      content::NotificationService::NoDetails());\n\n  \/\/ This will end by terminating the process.\n  content::ImmediateShutdownAndExitProcess();\n}\n\nvoid StartKeepAlive() {\n  \/\/ Increment the browser process refcount as long as we're keeping the\n  \/\/ application alive.\n  if (!WillKeepAlive())\n    g_browser_process->AddRefModule();\n  ++g_keep_alive_count;\n}\n\nvoid EndKeepAlive() {\n  DCHECK_GT(g_keep_alive_count, 0);\n  --g_keep_alive_count;\n\n  DCHECK(g_browser_process);\n  \/\/ Although we should have a browser process, if there is none,\n  \/\/ there is nothing to do.\n  if (!g_browser_process) return;\n\n  \/\/ Allow the app to shutdown again.\n  if (!WillKeepAlive()) {\n    g_browser_process->ReleaseModule();\n    \/\/ If there are no browsers open and we aren't already shutting down,\n    \/\/ initiate a shutdown. Also skips shutdown if this is a unit test\n    \/\/ (MessageLoop::current() == null).\n    if (chrome::GetTotalBrowserCount() == 0 &&\n        !browser_shutdown::IsTryingToQuit() &&\n        MessageLoop::current()) {\n      CloseAllBrowsers();\n    }\n  }\n}\n\nbool WillKeepAlive() {\n  return g_keep_alive_count > 0;\n}\n\nvoid NotifyAppTerminating() {\n  static bool notified = false;\n  if (notified)\n    return;\n  notified = true;\n  content::NotificationService::current()->Notify(\n      chrome::NOTIFICATION_APP_TERMINATING,\n      content::NotificationService::AllSources(),\n      content::NotificationService::NoDetails());\n}\n\nvoid NotifyAndTerminate(bool fast_path) {\n#if defined(OS_CHROMEOS)\n  static bool notified = false;\n  \/\/ Return if a shutdown request has already been sent.\n  if (notified)\n    return;\n  notified = true;\n#endif\n\n  if (fast_path)\n    NotifyAppTerminating();\n\n#if defined(OS_CHROMEOS)\n  if (base::chromeos::IsRunningOnChromeOS()) {\n    \/\/ If we're on a ChromeOS device, reboot if an update has been applied,\n    \/\/ or else signal the session manager to log out.\n    chromeos::UpdateEngineClient* update_engine_client\n        = chromeos::DBusThreadManager::Get()->GetUpdateEngineClient();\n    if (update_engine_client->GetLastStatus().status ==\n        chromeos::UpdateEngineClient::UPDATE_STATUS_UPDATED_NEED_REBOOT) {\n      update_engine_client->RebootAfterUpdate();\n    } else if (!g_session_manager_requested_shutdown) {\n      \/\/ Don't ask SessionManager to stop session if the shutdown request comes\n      \/\/ from session manager.\n      chromeos::DBusThreadManager::Get()->GetSessionManagerClient()\n          ->StopSession();\n    }\n  } else {\n    \/\/ If running the Chrome OS build, but we're not on the device, act\n    \/\/ as if we received signal from SessionManager.\n    content::BrowserThread::PostTask(content::BrowserThread::UI, FROM_HERE,\n                                     base::Bind(&ExitCleanly));\n  }\n#endif\n}\n\nvoid OnAppExiting() {\n  static bool notified = false;\n  if (notified)\n    return;\n  notified = true;\n  HandleAppExitingForPlatform();\n}\n\nbool ShouldStartShutdown(Browser* browser) {\n  if (BrowserList::GetInstance(browser->host_desktop_type())->size() > 1)\n    return false;\n#if defined(OS_WIN) && defined(USE_AURA)\n  \/\/ On Windows 8 the desktop and ASH environments could be active\n  \/\/ at the same time.\n  \/\/ We should not start the shutdown process in the following cases:-\n  \/\/ 1. If the desktop type of the browser going away is ASH and there\n  \/\/    are browser windows open in the desktop.\n  \/\/ 2. If the desktop type of the browser going away is desktop and the ASH\n  \/\/    environment is still active.\n  if (browser->host_desktop_type() == chrome::HOST_DESKTOP_TYPE_NATIVE)\n    return !ash::Shell::HasInstance();\n  else if (browser->host_desktop_type() == chrome::HOST_DESKTOP_TYPE_ASH)\n    return BrowserList::GetInstance(chrome::HOST_DESKTOP_TYPE_NATIVE)->empty();\n#endif\n  return true;\n}\n\n}  \/\/ namespace chrome\n<|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\nunsigned int Factorial( unsigned int number ) {\n    return number <= 1 ? number : Factorial(number-1)*number;\n}\n\nTEST_CASE( \"Factorials are computed\", \"[factorial]\" ) {\n    REQUIRE( Factorial(1) == 1 );\n    REQUIRE( Factorial(2) == 2 );\n    REQUIRE( Factorial(3) == 6 );\n    REQUIRE( Factorial(10) == 3628800 );\n}\n\nSCENARIO( \"vectors can be sized and resized\", \"[vector]\" ) {\n\n    GIVEN( \"A vector with some items\" ) {\n        std::vector<int> v( 5 );\n\n        REQUIRE( v.size() == 5 );\n        REQUIRE( v.capacity() >= 5 );\n\n        WHEN( \"the size is increased\" ) {\n            v.resize( 10 );\n\n            THEN( \"the size and capacity change\" ) {\n                REQUIRE( v.size() == 10 );\n                REQUIRE( v.capacity() >= 10 );\n            }\n        }\n        WHEN( \"the size is reduced\" ) {\n            v.resize( 0 );\n\n            THEN( \"the size changes but not capacity\" ) {\n                REQUIRE( v.size() == 0 );\n                REQUIRE( v.capacity() >= 5 );\n            }\n        }\n        WHEN( \"more capacity is reserved\" ) {\n            v.reserve( 10 );\n\n            THEN( \"the capacity changes but not the size\" ) {\n                REQUIRE( v.size() == 5 );\n                REQUIRE( v.capacity() >= 10 );\n            }\n        }\n        WHEN( \"less capacity is reserved\" ) {\n            v.reserve( 0 );\n\n            THEN( \"neither size nor capacity are changed\" ) {\n                REQUIRE( v.size() == 5 );\n                REQUIRE( v.capacity() >= 5 );\n            }\n        }\n    }\n}\n<commit_msg>Add unit tests for symbol table<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 \"eople_symbol_table.h\"\n\nSCENARIO( \"symbol table allows constants to be pushed\", \"[symbol_table]\" ) {\n\n    GIVEN( \"An empty symbol table\" ) {\n        Eople::SymbolTable symbols;\n\n        REQUIRE( symbols.symbol_count() == 0 );\n        REQUIRE( symbols.constant_count() == 0 );\n\n        WHEN( \"a constant is pushed\" ) {\n            size_t idx = symbols.GetTableEntryIndex( \"const1\", true );\n\n            THEN( \"constant count changes, but not locals\" ) {\n                REQUIRE( symbols.constant_count() == 1 );\n                REQUIRE( symbols.symbol_count() - symbols.constant_count() == 0 );\n            }\n        }\n        WHEN( \"a non-constant symbol is pushed\" ) {\n            size_t idx = symbols.GetTableEntryIndex( \"non-const1\", false );\n\n            THEN( \"symbol count changes, but not constant count\" ) {\n                REQUIRE( symbols.symbol_count() == 1 );\n                REQUIRE( symbols.constant_count() == 0 );\n            }\n        }\n    }\n}\n\nSCENARIO( \"symbol table does not combine locals and string literals with same text\", \"[symbol_table]\" ) {\n\n    GIVEN( \"A symbol table with a local named 'x'\" ) {\n        Eople::SymbolTable symbols;\n\n        size_t idx = symbols.GetTableEntryIndex( \"x\", false );\n        REQUIRE( symbols.symbol_count() == 1 );\n        REQUIRE( symbols.constant_count() == 0 );\n\n        WHEN( \"a literal string with the same text is pushed\" ) {\n            size_t idx = symbols.GetTableEntryIndex( \"x\", true );\n\n            THEN( \"constant count increases, and total symbol count increases\" ) {\n                REQUIRE( symbols.constant_count() == 1 );\n                REQUIRE( symbols.symbol_count() == 2 );\n            }\n        }\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\/\/\/ This test is based on Truth Cube experimental dataset that is obtained from:\n\/\/\/ \"Establishing Physical Standards for Real Time Soft Tissue Simulation\" project.\n\/\/\/  URL: http:\/\/biorobotics.harvard.edu\/truthcube\/truthcube.html\n\n#include \"SurgSim\/Physics\/RenderTests\/RenderTest.h\"\n\n#include \"SurgSim\/Framework\/ApplicationData.h\"\n#include \"SurgSim\/Graphics\/PointCloudRepresentation.h\"\n#include \"SurgSim\/Graphics\/OsgPointCloudRepresentation.h\"\n#include \"SurgSim\/Math\/Quaternion.h\"\n#include \"SurgSim\/Math\/Vector.h\"\n#include \"SurgSim\/Math\/RigidTransform.h\"\n\nusing SurgSim::Math::Vector3d;\nusing SurgSim::Math::Quaterniond;\nusing SurgSim::Math::RigidTransform3d;\nusing SurgSim::Math::makeRigidTransform;\n\n\nnamespace SurgSim\n{\nnamespace Physics\n{\n\ntypedef SurgSim::DataStructures::Vertices<void> CloudMesh;\n\nstruct TruthCube\n{\n\t\/\/ Data positions of uncompressed data\n\tstd::vector<Vector3d> cubeData0;\n\n\t\/\/ Data positions of 5% strain\n\tstd::vector<Vector3d> cubeData1;\n\n\t\/\/ Data positions of  12.5% strain\n\tstd::vector<Vector3d> cubeData2;\n\n\t\/\/ Data positions of  18.25% strain\n\tstd::vector<Vector3d> cubeData3;\n};\n\nstruct TruthCubeRenderTests : public RenderTests\n{\n\t\/\/\/ Parsing Truth Cube data from an external file\n\t\/\/\/ \\param truthCube a container of cube data for all strains in meter unit. \n\t\/\/\/ \\return True if the Truth Cube Data is successful loaded, otherwise false\n\tbool parseTruthCubeData(std::shared_ptr<TruthCube> truthCube)\n\t{\n\t\t\/\/ Position of uncompressed data, 5% strain, 12.5% strain, 18.25% strain\n\t\tVector3d position0, position1, position2, position3;\n\n\t\t\/\/ Conversion constant to convert from centimeter to meter. \n\t\tconst unsigned int cm2m = 100;\n\n\t\tconst int numCommentLine = 7;\n\t\tstd::string lineId;\n\t\tchar comma;\n\t\tint i,j,k;\n\t\tint index = 0;\n\n\t\tconst SurgSim::Framework::ApplicationData data(\"config.txt\");\n\n\t\tstd::string filename = data.findFile(\"uniaxial_positions.csv\");\n\n\t\tstd::ifstream datafile(filename);\n\n\t\tif (! datafile.good())\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\twhile (std::getline(datafile, lineId))\n\t\t{\n\t\t\tif (++index > numCommentLine)\n\t\t\t{\n\t\t\t\tstd::stringstream strstream(lineId);\n\t\t\t\tstrstream >> i >> comma >> j >> comma >> k >> comma\n\t\t\t\t\t>> position0.x() >> comma >> position0.y() >> comma >> position0.z() >> comma\n\t\t\t\t\t>> position1.x() >> comma >> position1.y() >> comma >> position1.z() >> comma\n\t\t\t\t\t>> position2.x() >> comma >> position2.y() >> comma >> position2.z() >> comma\n\t\t\t\t\t>> position3.x() >> comma >> position3.y() >> comma >> position3.z();\n\n\t\t\t\t\/\/ Store proper strains for each cubeData\n\t\t\t\ttruthCube->cubeData0.push_back(position0 \/ cm2m);\n\t\t\t\ttruthCube->cubeData1.push_back(position1 \/ cm2m);\n\t\t\t\ttruthCube->cubeData2.push_back(position2 \/ cm2m);\n\t\t\t\ttruthCube->cubeData3.push_back(position3 \/ cm2m);\n\t\t\t}\n\t\t}\n\t\treturn true;\n\n\t};\n\n\tvoid doInitialize()\n\t{\n\t\t\/\/ Initialize truthCube variable\n\t\ttruthCube = std::make_shared<TruthCube>();\n\n\t\t\/\/ Parsing TruthCube data\n\t\tparseTruthCubeData(truthCube);\n\t};\n\n\tvoid runTest(std::shared_ptr<SurgSim::Graphics::OsgPointCloudRepresentation<void>> representation)\n\t{\n\t\trepresentation->setPointSize(4.0);\n\t\tRigidTransform3d pose = makeRigidTransform(Quaterniond::Identity(), Vector3d::Zero());\n\t\trepresentation->setInitialPose(pose);\n\n\t\tviewElement->addComponent(representation);\n\t\tviewElement->enableManipulator(true);\n\t\tviewElement->setManipulatorParameters(Vector3d(0.0, 0.0, 2.0), Vector3d::Zero());\n\n\t\t\/\/\/ Run the thread\n\t\truntime->start();\n\n\t\tboost::this_thread::sleep(boost::posix_time::milliseconds(3000));\n\t}\n\n\tstd::shared_ptr<TruthCube> truthCube;\n};\n\nTEST_F(TruthCubeRenderTests, LoadTruthCubeData_Uncompressed)\n{\n\tdoInitialize();\n\n\tauto representation = std::make_shared<SurgSim::Graphics::OsgPointCloudRepresentation<void>>\n\t\t(\"TruthCube uncompressed\");\n\tauto pointCloud = representation->getVertices();\n\n\t\/\/\/ Loading the Truth Cube uncompressed data into point cloud\n\tfor (size_t i = 0; i < truthCube->cubeData0.size(); ++i)\n\t{\n\t\tpointCloud->addVertex(CloudMesh::VertexType(truthCube->cubeData0[i]));\n\t}\n\n\trunTest(representation);\n}\n\nTEST_F(TruthCubeRenderTests, LoadTruthCubeData_Compressed_5)\n{\n\tdoInitialize();\n\n\tauto representation = std::make_shared<SurgSim::Graphics::OsgPointCloudRepresentation<void>>\n\t\t(\"TruthCube 5% strain\");\n\tauto pointCloud = representation->getVertices();\n\n\t\/\/\/ Loading the Truth Cube data into point cloud\n\tfor (size_t i = 0; i < truthCube->cubeData1.size(); ++i)\n\t{\n\t\tpointCloud->addVertex(CloudMesh::VertexType(truthCube->cubeData1[i]));\n\t}\n\n\trunTest(representation);\n}\n\nTEST_F(TruthCubeRenderTests, LoadTruthCubeData_Compressed_12_5)\n{\n\tdoInitialize();\n\n\tauto representation = std::make_shared<SurgSim::Graphics::OsgPointCloudRepresentation<void>>\n\t\t(\"TruthCube 12.5 strain\");\n\tauto pointCloud = representation->getVertices();\n\n\t\/\/\/ Loading the Truth Cube data into point cloud\n\tfor (size_t i = 0; i < truthCube->cubeData2.size(); ++i)\n\t{\n\t\tpointCloud->addVertex(CloudMesh::VertexType(truthCube->cubeData2[i]));\n\t}\n\n\trunTest(representation);\n}\n\nTEST_F(TruthCubeRenderTests, LoadTruthCubeData_Compressed_18_25)\n{\n\tdoInitialize();\n\n\tauto representation = std::make_shared<SurgSim::Graphics::OsgPointCloudRepresentation<void>>\n\t\t(\"TruthCube 18.25%\");\n\tauto pointCloud = representation->getVertices();\n\n\t\/\/\/ Loading the Truth Cube data into point cloud\n\tfor (size_t i = 0; i < truthCube->cubeData3.size(); ++i)\n\t{\n\t\tpointCloud->addVertex(CloudMesh::VertexType(truthCube->cubeData3[i]));\n\t}\n\n\trunTest(representation);\n}\n\n}; \/\/ namespace Physics\n}; \/\/ namespace SurgSim\n<commit_msg>Fix type of conversion variable to double.<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\/\/\/ This test is based on Truth Cube experimental dataset that is obtained from:\n\/\/\/ \"Establishing Physical Standards for Real Time Soft Tissue Simulation\" project.\n\/\/\/  URL: http:\/\/biorobotics.harvard.edu\/truthcube\/truthcube.html\n\n#include \"SurgSim\/Physics\/RenderTests\/RenderTest.h\"\n\n#include \"SurgSim\/Framework\/ApplicationData.h\"\n#include \"SurgSim\/Graphics\/PointCloudRepresentation.h\"\n#include \"SurgSim\/Graphics\/OsgPointCloudRepresentation.h\"\n#include \"SurgSim\/Math\/Quaternion.h\"\n#include \"SurgSim\/Math\/Vector.h\"\n#include \"SurgSim\/Math\/RigidTransform.h\"\n\nusing SurgSim::Math::Vector3d;\nusing SurgSim::Math::Quaterniond;\nusing SurgSim::Math::RigidTransform3d;\nusing SurgSim::Math::makeRigidTransform;\n\n\nnamespace SurgSim\n{\nnamespace Physics\n{\n\ntypedef SurgSim::DataStructures::Vertices<void> CloudMesh;\n\nstruct TruthCube\n{\n\t\/\/ Data positions of uncompressed data\n\tstd::vector<Vector3d> cubeData0;\n\n\t\/\/ Data positions of 5% strain\n\tstd::vector<Vector3d> cubeData1;\n\n\t\/\/ Data positions of  12.5% strain\n\tstd::vector<Vector3d> cubeData2;\n\n\t\/\/ Data positions of  18.25% strain\n\tstd::vector<Vector3d> cubeData3;\n};\n\nstruct TruthCubeRenderTests : public RenderTests\n{\n\t\/\/\/ Parsing Truth Cube data from an external file\n\t\/\/\/ \\param truthCube a container of cube data for all strains in meter unit. \n\t\/\/\/ \\return True if the Truth Cube Data is successful loaded, otherwise false\n\tbool parseTruthCubeData(std::shared_ptr<TruthCube> truthCube)\n\t{\n\t\t\/\/ Position of uncompressed data, 5% strain, 12.5% strain, 18.25% strain\n\t\tVector3d position0, position1, position2, position3;\n\n\t\t\/\/ Conversion constant to convert from centimeter to meter. \n\t\tconst double cm2m = 100;\n\n\t\tconst int numCommentLine = 7;\n\t\tstd::string lineId;\n\t\tchar comma;\n\t\tint i,j,k;\n\t\tint index = 0;\n\n\t\tconst SurgSim::Framework::ApplicationData data(\"config.txt\");\n\n\t\tstd::string filename = data.findFile(\"uniaxial_positions.csv\");\n\n\t\tstd::ifstream datafile(filename);\n\n\t\tif (! datafile.good())\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\twhile (std::getline(datafile, lineId))\n\t\t{\n\t\t\tif (++index > numCommentLine)\n\t\t\t{\n\t\t\t\tstd::stringstream strstream(lineId);\n\t\t\t\tstrstream >> i >> comma >> j >> comma >> k >> comma\n\t\t\t\t\t>> position0.x() >> comma >> position0.y() >> comma >> position0.z() >> comma\n\t\t\t\t\t>> position1.x() >> comma >> position1.y() >> comma >> position1.z() >> comma\n\t\t\t\t\t>> position2.x() >> comma >> position2.y() >> comma >> position2.z() >> comma\n\t\t\t\t\t>> position3.x() >> comma >> position3.y() >> comma >> position3.z();\n\n\t\t\t\t\/\/ Store proper strains for each cubeData\n\t\t\t\ttruthCube->cubeData0.push_back(position0 \/ cm2m);\n\t\t\t\ttruthCube->cubeData1.push_back(position1 \/ cm2m);\n\t\t\t\ttruthCube->cubeData2.push_back(position2 \/ cm2m);\n\t\t\t\ttruthCube->cubeData3.push_back(position3 \/ cm2m);\n\t\t\t}\n\t\t}\n\t\treturn true;\n\n\t};\n\n\tvoid doInitialize()\n\t{\n\t\t\/\/ Initialize truthCube variable\n\t\ttruthCube = std::make_shared<TruthCube>();\n\n\t\t\/\/ Parsing TruthCube data\n\t\tparseTruthCubeData(truthCube);\n\t};\n\n\tvoid runTest(std::shared_ptr<SurgSim::Graphics::OsgPointCloudRepresentation<void>> representation)\n\t{\n\t\trepresentation->setPointSize(4.0);\n\t\tRigidTransform3d pose = makeRigidTransform(Quaterniond::Identity(), Vector3d::Zero());\n\t\trepresentation->setInitialPose(pose);\n\n\t\tviewElement->addComponent(representation);\n\t\tviewElement->enableManipulator(true);\n\t\tviewElement->setManipulatorParameters(Vector3d(0.0, 0.0, 2.0), Vector3d::Zero());\n\n\t\t\/\/\/ Run the thread\n\t\truntime->start();\n\n\t\tboost::this_thread::sleep(boost::posix_time::milliseconds(3000));\n\t}\n\n\tstd::shared_ptr<TruthCube> truthCube;\n};\n\nTEST_F(TruthCubeRenderTests, LoadTruthCubeData_Uncompressed)\n{\n\tdoInitialize();\n\n\tauto representation = std::make_shared<SurgSim::Graphics::OsgPointCloudRepresentation<void>>\n\t\t(\"TruthCube uncompressed\");\n\tauto pointCloud = representation->getVertices();\n\n\t\/\/\/ Loading the Truth Cube uncompressed data into point cloud\n\tfor (size_t i = 0; i < truthCube->cubeData0.size(); ++i)\n\t{\n\t\tpointCloud->addVertex(CloudMesh::VertexType(truthCube->cubeData0[i]));\n\t}\n\n\trunTest(representation);\n}\n\nTEST_F(TruthCubeRenderTests, LoadTruthCubeData_Compressed_5)\n{\n\tdoInitialize();\n\n\tauto representation = std::make_shared<SurgSim::Graphics::OsgPointCloudRepresentation<void>>\n\t\t(\"TruthCube 5% strain\");\n\tauto pointCloud = representation->getVertices();\n\n\t\/\/\/ Loading the Truth Cube data into point cloud\n\tfor (size_t i = 0; i < truthCube->cubeData1.size(); ++i)\n\t{\n\t\tpointCloud->addVertex(CloudMesh::VertexType(truthCube->cubeData1[i]));\n\t}\n\n\trunTest(representation);\n}\n\nTEST_F(TruthCubeRenderTests, LoadTruthCubeData_Compressed_12_5)\n{\n\tdoInitialize();\n\n\tauto representation = std::make_shared<SurgSim::Graphics::OsgPointCloudRepresentation<void>>\n\t\t(\"TruthCube 12.5 strain\");\n\tauto pointCloud = representation->getVertices();\n\n\t\/\/\/ Loading the Truth Cube data into point cloud\n\tfor (size_t i = 0; i < truthCube->cubeData2.size(); ++i)\n\t{\n\t\tpointCloud->addVertex(CloudMesh::VertexType(truthCube->cubeData2[i]));\n\t}\n\n\trunTest(representation);\n}\n\nTEST_F(TruthCubeRenderTests, LoadTruthCubeData_Compressed_18_25)\n{\n\tdoInitialize();\n\n\tauto representation = std::make_shared<SurgSim::Graphics::OsgPointCloudRepresentation<void>>\n\t\t(\"TruthCube 18.25%\");\n\tauto pointCloud = representation->getVertices();\n\n\t\/\/\/ Loading the Truth Cube data into point cloud\n\tfor (size_t i = 0; i < truthCube->cubeData3.size(); ++i)\n\t{\n\t\tpointCloud->addVertex(CloudMesh::VertexType(truthCube->cubeData3[i]));\n\t}\n\n\trunTest(representation);\n}\n\n}; \/\/ namespace Physics\n}; \/\/ namespace SurgSim\n<|endoftext|>"}
{"text":"<commit_before>\/**********************************************************************\n * $Id$\n *\n * GEOS - Geometry Engine Open Source\n * http:\/\/geos.refractions.net\n *\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#include <geos\/geom.h>\n#include <geos\/util.h>\n\nnamespace geos {\n\n\n\/**\n * Creates a Point using the given CoordinateSequence (must have 1 element)\n *\n * @param  newCoords\n *\tcontains the single coordinate on which to base this\n *\t<code>Point<\/code> or <code>null<\/code> to create\n *\tthe empty geometry.\n *\n *\tIf not null the created Point will take ownership of newCoords.\n *\/  \nPoint::Point(CoordinateSequence *newCoords, const GeometryFactory *factory):\n\tGeometry(factory)\n{\n\tif (newCoords==NULL) {\n\t\tcoordinates=factory->getCoordinateSequenceFactory()->create(NULL);\n\t\treturn;\n\t}        \n\tif (newCoords->getSize() != 1)\n\t{\n\t\tthrow new IllegalArgumentException(\"Point coordinate list must contain a single element\");\n\t}\n\tcoordinates=newCoords;\n}\n\nPoint::Point(const Point &p): Geometry(p.getFactory())\n{\n\tcoordinates=p.coordinates->clone();\n}\n\nGeometry *\nPoint::clone() const\n{\n\treturn new Point(*this);\n}\n\nCoordinateSequence *\nPoint::getCoordinates() const\n{\n\treturn coordinates->clone();\n}\n\nint\nPoint::getNumPoints() const\n{\n\treturn isEmpty() ? 0 : 1;\n}\n\nbool\nPoint::isEmpty() const\n{\n\treturn coordinates->isEmpty();\n}\n\nbool\nPoint::isSimple() const\n{\n\treturn true;\n}\n\n\/\/bool Point::isValid() const {return true;}\n\nint\nPoint::getDimension() const\n{\n\treturn 0;\n}\n\nint\nPoint::getBoundaryDimension() const\n{\n\treturn Dimension::False;\n}\n\ndouble\nPoint::getX() const\n{\n\tif (isEmpty()) {\n\t\tthrow new UnsupportedOperationException(\"getX called on empty Point\\n\");\n\t}\n\treturn getCoordinate()->x;\n}\n\ndouble\nPoint::getY() const\n{\n\tif (isEmpty()) {\n\t\tthrow new UnsupportedOperationException(\"getY called on empty Point\\n\");\n\t}\n\treturn getCoordinate()->y;\n}\n\nconst Coordinate *\nPoint::getCoordinate() const\n{\n\treturn coordinates->getSize()!=0 ? &(coordinates->getAt(0)) : NULL;\n}\n\nstring\nPoint::getGeometryType() const\n{\n\treturn \"Point\";\n}\n\nGeometry *\nPoint::getBoundary() const\n{\n\treturn getFactory()->createGeometryCollection(NULL);\n}\n\nEnvelope *\nPoint::computeEnvelopeInternal() const\n{\n\tif (isEmpty()) {\n\t\treturn new Envelope();\n\t}\n\treturn new Envelope(getCoordinate()->x, getCoordinate()->x, getCoordinate()->y, getCoordinate()->y);\n}\n\nvoid\nPoint::apply_ro(CoordinateFilter *filter) const\n{\n\tif (isEmpty()) {return;}\n\tfilter->filter_ro(getCoordinate());\n}\n\nvoid\nPoint::apply_rw(CoordinateFilter *filter)\n{\n\tif (isEmpty()) {return;}\n\tCoordinate newcoord = coordinates->getAt(0);\n\tfilter->filter_rw(&newcoord);\n\tcoordinates->setAt(newcoord, 0);\n}\n\nvoid\nPoint::apply_rw(GeometryFilter *filter)\n{\n\tfilter->filter_rw(this);\n}\n\nvoid\nPoint::apply_ro(GeometryFilter *filter) const\n{\n\tfilter->filter_ro(this);\n}\n\nvoid\nPoint::apply_rw(GeometryComponentFilter *filter)\n{\n\tfilter->filter_rw(this);\n}\n\nvoid\nPoint::apply_ro(GeometryComponentFilter *filter) const\n{\n\tfilter->filter_ro(this);\n}\n\nbool\nPoint::equalsExact(const Geometry *other, double tolerance) const\n{\n\tif (!isEquivalentClass(other)) {\n\t\treturn false;\n\t}\n\tif (isEmpty() && other->isEmpty()) {\n\t\treturn true;\n\t}\n\tbool ret = equal(*((Point*) other)->getCoordinate(), *getCoordinate(),\n\t\ttolerance);\n\treturn ret;\n}\n\nint\nPoint::compareToSameClass(const Geometry *point) const\n{\n\treturn getCoordinate()->compareTo(*(((Point*)point)->getCoordinate()));\n}\n\nPoint::~Point()\n{\n\tdelete coordinates;\n}\n\nGeometryTypeId\nPoint::getGeometryTypeId() const\n{\n\treturn GEOS_POINT;\n}\n\n} \/\/ namesapce geos\n\n\/**********************************************************************\n *\n * $Log$\n * Revision 1.33  2005\/05\/13 17:15:34  strk\n * cleanups and indentations\n *\n * Revision 1.32  2005\/04\/19 11:49:26  strk\n * Fixed segfault in ::isEmpty\n *\n * Revision 1.31  2004\/11\/23 16:22:49  strk\n * Added ElevationMatrix class and components to do post-processing draping of overlayed geometries.\n *\n * Revision 1.30  2004\/09\/13 12:39:14  strk\n * Made Point and MultiPoint subject to Validity tests.\n *\n * Revision 1.29  2004\/07\/08 19:34:49  strk\n * Mirrored JTS interface of CoordinateSequence, factory and\n * default implementations.\n * Added DefaultCoordinateSequenceFactory::instance() function.\n *\n **********************************************************************\/\n\n<commit_msg>Added Refractions copyright<commit_after>\/**********************************************************************\n * $Id$\n *\n * GEOS - Geometry Engine Open Source\n * http:\/\/geos.refractions.net\n *\n * Copyright (C) 2001-2002 Vivid Solutions Inc.\n * Copyright (C) 2005 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#include <geos\/geom.h>\n#include <geos\/util.h>\n\nnamespace geos {\n\n\n\/**\n * Creates a Point using the given CoordinateSequence (must have 1 element)\n *\n * @param  newCoords\n *\tcontains the single coordinate on which to base this\n *\t<code>Point<\/code> or <code>null<\/code> to create\n *\tthe empty geometry.\n *\n *\tIf not null the created Point will take ownership of newCoords.\n *\/  \nPoint::Point(CoordinateSequence *newCoords, const GeometryFactory *factory):\n\tGeometry(factory)\n{\n\tif (newCoords==NULL) {\n\t\tcoordinates=factory->getCoordinateSequenceFactory()->create(NULL);\n\t\treturn;\n\t}        \n\tif (newCoords->getSize() != 1)\n\t{\n\t\tthrow new IllegalArgumentException(\"Point coordinate list must contain a single element\");\n\t}\n\tcoordinates=newCoords;\n}\n\nPoint::Point(const Point &p): Geometry(p.getFactory())\n{\n\tcoordinates=p.coordinates->clone();\n}\n\nGeometry *\nPoint::clone() const\n{\n\treturn new Point(*this);\n}\n\nCoordinateSequence *\nPoint::getCoordinates() const\n{\n\treturn coordinates->clone();\n}\n\nint\nPoint::getNumPoints() const\n{\n\treturn isEmpty() ? 0 : 1;\n}\n\nbool\nPoint::isEmpty() const\n{\n\treturn coordinates->isEmpty();\n}\n\nbool\nPoint::isSimple() const\n{\n\treturn true;\n}\n\n\/\/bool Point::isValid() const {return true;}\n\nint\nPoint::getDimension() const\n{\n\treturn 0;\n}\n\nint\nPoint::getBoundaryDimension() const\n{\n\treturn Dimension::False;\n}\n\ndouble\nPoint::getX() const\n{\n\tif (isEmpty()) {\n\t\tthrow new UnsupportedOperationException(\"getX called on empty Point\\n\");\n\t}\n\treturn getCoordinate()->x;\n}\n\ndouble\nPoint::getY() const\n{\n\tif (isEmpty()) {\n\t\tthrow new UnsupportedOperationException(\"getY called on empty Point\\n\");\n\t}\n\treturn getCoordinate()->y;\n}\n\nconst Coordinate *\nPoint::getCoordinate() const\n{\n\treturn coordinates->getSize()!=0 ? &(coordinates->getAt(0)) : NULL;\n}\n\nstring\nPoint::getGeometryType() const\n{\n\treturn \"Point\";\n}\n\nGeometry *\nPoint::getBoundary() const\n{\n\treturn getFactory()->createGeometryCollection(NULL);\n}\n\nEnvelope *\nPoint::computeEnvelopeInternal() const\n{\n\tif (isEmpty()) {\n\t\treturn new Envelope();\n\t}\n\treturn new Envelope(getCoordinate()->x, getCoordinate()->x, getCoordinate()->y, getCoordinate()->y);\n}\n\nvoid\nPoint::apply_ro(CoordinateFilter *filter) const\n{\n\tif (isEmpty()) {return;}\n\tfilter->filter_ro(getCoordinate());\n}\n\nvoid\nPoint::apply_rw(CoordinateFilter *filter)\n{\n\tif (isEmpty()) {return;}\n\tCoordinate newcoord = coordinates->getAt(0);\n\tfilter->filter_rw(&newcoord);\n\tcoordinates->setAt(newcoord, 0);\n}\n\nvoid\nPoint::apply_rw(GeometryFilter *filter)\n{\n\tfilter->filter_rw(this);\n}\n\nvoid\nPoint::apply_ro(GeometryFilter *filter) const\n{\n\tfilter->filter_ro(this);\n}\n\nvoid\nPoint::apply_rw(GeometryComponentFilter *filter)\n{\n\tfilter->filter_rw(this);\n}\n\nvoid\nPoint::apply_ro(GeometryComponentFilter *filter) const\n{\n\tfilter->filter_ro(this);\n}\n\nbool\nPoint::equalsExact(const Geometry *other, double tolerance) const\n{\n\tif (!isEquivalentClass(other)) {\n\t\treturn false;\n\t}\n\tif (isEmpty() && other->isEmpty()) {\n\t\treturn true;\n\t}\n\tbool ret = equal(*((Point*) other)->getCoordinate(), *getCoordinate(),\n\t\ttolerance);\n\treturn ret;\n}\n\nint\nPoint::compareToSameClass(const Geometry *point) const\n{\n\treturn getCoordinate()->compareTo(*(((Point*)point)->getCoordinate()));\n}\n\nPoint::~Point()\n{\n\tdelete coordinates;\n}\n\nGeometryTypeId\nPoint::getGeometryTypeId() const\n{\n\treturn GEOS_POINT;\n}\n\n} \/\/ namesapce geos\n\n\/**********************************************************************\n *\n * $Log$\n * Revision 1.34  2005\/05\/23 16:42:43  strk\n * Added Refractions copyright\n *\n * Revision 1.33  2005\/05\/13 17:15:34  strk\n * cleanups and indentations\n *\n * Revision 1.32  2005\/04\/19 11:49:26  strk\n * Fixed segfault in ::isEmpty\n *\n * Revision 1.31  2004\/11\/23 16:22:49  strk\n * Added ElevationMatrix class and components to do post-processing draping of overlayed geometries.\n *\n * Revision 1.30  2004\/09\/13 12:39:14  strk\n * Made Point and MultiPoint subject to Validity tests.\n *\n * Revision 1.29  2004\/07\/08 19:34:49  strk\n * Mirrored JTS interface of CoordinateSequence, factory and\n * default implementations.\n * Added DefaultCoordinateSequenceFactory::instance() function.\n *\n **********************************************************************\/\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"mainwindow.h\"\n\/\/ Qt\n#include <QDir>\n#include <QSettings>\n#include <QThread>\n#include <QBoxLayout>\n#include <QLabel>\n#include <QKeyEvent>\n#include <QCoreApplication>\n#include <QSignalMapper>\n#include <QLineEdit>\n\/\/ OSG\n#include <osg\/ref_ptr>\n\/\/ troen\n#include \"troengame.h\"\n\nusing namespace troen;\n\n#define MAX_BIKES 6\n\nMainWindow::MainWindow(QWidget * parent)\n{\n\tQMainWindow();\n    \/\/ configure window\n    this->setWindowTitle(\"Troen\");\n\n\t\/\/ create & order widgets\n\tQWidget* vBoxWidget = new QWidget;\n\tQVBoxLayout* vBoxLayout = new QVBoxLayout;\n\tvBoxWidget->setLayout(vBoxLayout);\n\tsetCentralWidget(vBoxWidget);\n\n\t\/\/ levelName\n\tm_levelComboBox = new QComboBox;\n\t\n\t\/\/ get files from levels folder\n\tQStringList nameFilter(\"*.ive\");\n\tQDir directory(\"data\/levels\/\");\n\tQStringList levelFiles = directory.entryList(nameFilter);\n\tforeach(QString currentFile, levelFiles) {\n\t\t\/\/ remove .ive from string\n\t\tcurrentFile.chop(4);\n\t\tm_levelComboBox->addItem(currentFile);\n\t}\n\n\tvBoxLayout->addWidget(m_levelComboBox);\n\n\t\/\/ bikeNumber\n\t{\n\t\tQWidget* bikeNumberWidget = new QWidget;\n\t\tQHBoxLayout* bikeNumberLayout = new QHBoxLayout;\n\t\tbikeNumberWidget->setLayout(bikeNumberLayout);\n\n\t\tQLabel* bikeNumberLabel = new QLabel(\"Number of Bikes: \");\n\t\tbikeNumberLayout->addWidget(bikeNumberLabel);\n\n\t\tm_bikeNumberSpinBox = new QSpinBox;\n\t\tm_bikeNumberSpinBox->setMinimum(1);\n\t\tm_bikeNumberSpinBox->setMaximum(6);\n\t\tm_bikeNumberSpinBox->setValue(1);\n\t\tbikeNumberLayout->addWidget(m_bikeNumberSpinBox);\n\n\t\tvBoxLayout->addWidget(bikeNumberWidget);\n\t}\n\n\t\/\/ timeLimit\n\t{\n\t\tQWidget* timeLimitWidget = new QWidget;\n\t\tQHBoxLayout* timeLimitLayout = new QHBoxLayout;\n\t\ttimeLimitWidget->setLayout(timeLimitLayout);\n\n\t\tQLabel* timeLimitLabel = new QLabel(\"TimeLimit: \");\n\t\ttimeLimitLayout->addWidget(timeLimitLabel);\n\n\t\tm_timeLimitSpinBox = new QSpinBox;\n\t\tm_timeLimitSpinBox->setMinimum(0);\n\t\tm_timeLimitSpinBox->setMaximum(10);\n\t\tm_timeLimitSpinBox->setValue(0);\n\t\ttimeLimitLayout->addWidget(m_timeLimitSpinBox);\n\n\t\tvBoxLayout->addWidget(timeLimitWidget);\n\t}\n\n\tQSignalMapper* signalMapper = new QSignalMapper(this);\n\n\t\/\/ bikeInputs\n\tfor (int i = 0; i < MAX_BIKES; i++)\n\t{\n\t\tQWidget* playerInputWidget = new QWidget;\n\t\tQHBoxLayout* playerInputLayout = new QHBoxLayout;\n\t\tplayerInputWidget->setLayout(playerInputLayout);\n\t\tplayerInputLayout->setMargin(1);\n\n\t\tQString playerString = QString(\"Player_\") + QString::number(i);\n\t\tQLabel* playerInputLabel = new QLabel(playerString);\n\t\tplayerInputLayout->addWidget(playerInputLabel);\n\n\t\tQLineEdit* playerNameLineEdit = new QLineEdit;\n\t\tplayerNameLineEdit->setText(playerString);\n\t\tplayerNameLineEdit->setMaximumWidth(75);\n\t\tplayerNameLineEdit->setMaxLength(10);\n\t\tm_playerNameLineEdits.push_back(playerNameLineEdit);\n\t\tplayerInputLayout->addWidget(playerNameLineEdit);\n\n\t\tQComboBox* playerComboBox = new QComboBox;\n\t\tplayerComboBox->addItem(\"Keyboard WASD\");\n\t\tplayerComboBox->addItem(\"Keyboard Arrows\");\n\t\tplayerComboBox->addItem(\"Gamepad XBox\");\n\t\tplayerComboBox->addItem(\"GAMEPAD PS4\");\n\t\tplayerComboBox->addItem(\"AI\");\n\t\tplayerInputLayout->addWidget(playerComboBox);\n\t\tm_playerComboBoxes.push_back(playerComboBox);\n\n\t\tQPushButton* colorButton = new QPushButton();\n\t\tcolorButton->setContentsMargins(0, 5, 0, 5);\n\t\tsignalMapper->setMapping(colorButton, i);\n\t\tconnect(colorButton, SIGNAL(clicked()), signalMapper, SLOT(map()));\n\t\tplayerInputLayout->addWidget(colorButton);\n\t\tm_playerColors.push_back(QColor());\n\t\tm_colorButtons.push_back(colorButton);\n\n\t\t\/\/ own view\n\t\tQCheckBox* ownViewCheckBox = new QCheckBox(\"&Own view\");\n\t\tbool isFirstPlayer = i == 0;\n\t\townViewCheckBox->setChecked(isFirstPlayer);\n\t\townViewCheckBox->setDisabled(isFirstPlayer);\n\t\tm_ownViewCheckboxes.push_back(ownViewCheckBox);\n\t\tplayerInputLayout->addWidget(ownViewCheckBox);\n\n\t\tplayerComboBox->setCurrentIndex(i < 2 ? i : 3);\t\n\t\tvBoxLayout->addWidget(playerInputWidget);\n\t}\n\n\tconnect(signalMapper, SIGNAL(mapped(int)), this, SLOT(chooseColor(int)));\n\tupdatePlayerInputBoxes();\n\n\t\/\/fullscreenCheckBox\n\tm_fullscreenCheckBox = new QCheckBox(\"&Fullscreen\");\n\tvBoxLayout->addWidget(m_fullscreenCheckBox, 0, Qt::AlignLeft);\n\n\t\/\/ postProcessingCheckBox\n\tm_postProcessingCheckBox = new QCheckBox(\"&PostProcessing\");\n\tvBoxLayout->addWidget(m_postProcessingCheckBox, 0, Qt::AlignLeft);\n\tm_postProcessingCheckBox->setChecked(false);\n\n\t\/\/ postProcessingCheckBox\n\tm_testPerformanceCheckBox = new QCheckBox(\"&TestPerformance - vSync OFF\");\n\tvBoxLayout->addWidget(m_testPerformanceCheckBox, 0, Qt::AlignLeft);\n\tm_testPerformanceCheckBox->setChecked(true);\n\n\t\/\/ debugViewCheckBox\n\tm_debugViewCheckBox = new QCheckBox(\"&DebugView\");\n\tvBoxLayout->addWidget(m_debugViewCheckBox, 0, Qt::AlignLeft);\n\tm_debugViewCheckBox->setChecked(false);\n\n\t\/\/reflectionCheckBox\n\tm_reflectionCheckBox = new QCheckBox(\"&Reflection\");\n\tvBoxLayout->addWidget(m_reflectionCheckBox, 0, Qt::AlignLeft);\n\tm_reflectionCheckBox->setChecked(true);\n\n\t\/\/ gameStartButton\n\tm_gameStartButton = new QPushButton(QString(\"start Game\"));\n\tm_gameStartButton->setContentsMargins(0, 5, 0, 5);\n\tvBoxLayout->addWidget(m_gameStartButton);\n\n\t\/\/ statusBar\n\tm_statusBar = new QStatusBar(this);\n\tm_statusBar->showMessage(\"...\");\n\tsetStatusBar(m_statusBar);\n\n\t\/\/ settings\n\tm_settingsFileName = QDir::currentPath() + \"\/settings.ini\";\n\tloadSettings();\n\n\t\/\/ create GameThread and Game\n\tm_gameThread = new QThread(this);\n\tm_troenGame = new TroenGame(m_gameThread);\n\n\tconnect(m_gameStartButton, SIGNAL(clicked()), this, SLOT(prepareGameStart()));\n\tconnect(m_bikeNumberSpinBox, SIGNAL(valueChanged(int)), this, SLOT(updatePlayerInputBoxes()));\n\tconnect(m_bikeNumberSpinBox, SIGNAL(valueChanged(int)), this, SLOT(bikeNumberChanged(int)));\n\n\tconnect(this, SIGNAL(startGame(GameConfig)), m_troenGame, SLOT(prepareAndStartGame(const GameConfig&)));\n}\n\nMainWindow::~MainWindow()\n{\n\tm_gameThread->terminate();\n}\n\nvoid MainWindow::chooseColor(int i)\n{\n\tm_playerColors[i] = QColorDialog::getColor(m_playerColors[i]);\n\tQString colorString = QString(\"background-color: %1\").arg(m_playerColors[i].name());\n\tm_colorButtons[i]->setStyleSheet(colorString);\n}\n\nvoid MainWindow::updatePlayerInputBoxes()\n{\n\tfor (int i = 0; i < MAX_BIKES; i++)\n\t{\n\t\tif (i < m_bikeNumberSpinBox->value())\n\t\t{\n\t\t\tm_playerComboBoxes.at(i)->setDisabled(false);\n\t\t\tm_colorButtons.at(i)->setDisabled(false);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_playerComboBoxes.at(i)->setDisabled(true);\n\t\t\tm_colorButtons.at(i)->setDisabled(true);\n\t\t}\n\t}\n}\n\nvoid MainWindow::prepareGameStart()\n{\n\tGameConfig config;\n\tconfig.numberOfPlayers = m_bikeNumberSpinBox->value();\n\tconfig.timeLimit = m_timeLimitSpinBox->value();\n\tconfig.playerInputTypes = new int[config.numberOfPlayers];\n\tconfig.playerColors = new QColor[config.numberOfPlayers];\n\tconfig.playerNames = new QString[config.numberOfPlayers];\n\tfor (int i = 0; i < config.numberOfPlayers; i++)\n\t{\n\t\tconfig.playerInputTypes[i] = m_playerComboBoxes.at(i)->currentIndex();\n\t\tconfig.playerNames[i] = m_playerNameLineEdits[i]->text();\n\t\tconfig.playerColors[i] = m_playerColors[i];\n\t}\n\tconfig.levelName = m_levelComboBox->currentText().toStdString();\n\tconfig.fullscreen = m_fullscreenCheckBox->isChecked();\n\tconfig.usePostProcessing = m_postProcessingCheckBox->isChecked();\n\tconfig.useDebugView = m_debugViewCheckBox->isChecked();\n\tconfig.testPerformance = m_testPerformanceCheckBox->isChecked();\n\tconfig.useReflection = m_reflectionCheckBox->isChecked();\n\n\t\/\/TODO: remove ownView checkboxes & replace with spinbox for number of views\n\tint i = 0;\n\tfor (auto ownViewCheckbox : m_ownViewCheckboxes) {\n\t\tconfig.ownView[i] = ownViewCheckbox->isChecked();\n\t\ti++;\n\t}\n\n\tsaveSettings();\n\temit startGame(config);\n}\n\nvoid MainWindow::bikeNumberChanged(int newBikeNumber)\n{\n\tfor (int i = 1; i < MAX_BIKES; i++)\n\t{\n\t\tif (i < newBikeNumber) {\n\t\t\tm_ownViewCheckboxes[i]->setDisabled(false);\n\t\t}\n\t\telse {\n\t\t\tm_ownViewCheckboxes[i]->setChecked(false);\n\t\t\tm_ownViewCheckboxes[i]->setDisabled(true);\n\t\t}\n\t}\n}\n\nbool MainWindow::eventFilter(QObject* object, QEvent* event)\n{\n\tif (event->type() == QEvent::KeyPress) {\n\t\tQKeyEvent* keyEvent = static_cast<QKeyEvent*>(event);\n\t\tif (keyEvent->key() == Qt::Key_Return) {\n\t\t\tthis->prepareGameStart();\n\t\t\tkeyEvent->accept();\n\t\t\treturn true;\n\t\t}\n\t\telse if (keyEvent->key() == Qt::Key_Escape)\n\t\t{\n\t\t\tthis->close();\n\t\t\tkeyEvent->accept();\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn QMainWindow::eventFilter(object, event);\n}\n\nvoid MainWindow::childEvent(QChildEvent* e)\n{\n\tif (e->child()->isWidgetType()) {\n\t\tif (e->type() == QEvent::ChildAdded) {\n\t\t\te->child()->installEventFilter(this);\n\t\t}\n\t\telse if (e->type() == QEvent::ChildRemoved) {\n\t\t\te->child()->removeEventFilter(this);\n\t\t}\n\t}\n\tQWidget::childEvent(e);\n}\n\nvoid MainWindow::loadSettings()\n{\n\tQSettings settings(m_settingsFileName, QSettings::IniFormat);\n\n\tstd::vector<QColor> initialColors{ QColor(255.0, 0.0, 0.0), QColor(0.0, 255.0, 0.0), QColor(0.0, 0.0, 255.0),\n\t\tQColor(255.0, 255.0, 0.0), QColor(0.0, 255.0, 255.0), QColor(255.0, 0.0, 255.0) };\n\n\tm_bikeNumberSpinBox->setValue(settings.value(\"bikeNumber\").toInt());\n\tm_timeLimitSpinBox->setValue(settings.value(\"timeLimit\").toInt());\n\tm_postProcessingCheckBox->setChecked(settings.value(\"postProcessing\").toBool());\n\tm_testPerformanceCheckBox->setChecked(settings.value(\"vSyncOff\").toBool());\n\tm_debugViewCheckBox->setChecked(settings.value(\"debugView\").toBool());\n\tm_reflectionCheckBox->setChecked(settings.value(\"reflection\").toBool());\n\tm_levelComboBox->setCurrentIndex(settings.value(\"level\").toInt());\n\n\tfor (int i = 0; i < MAX_BIKES; i++)\n\t{\n\t\t\/\/name\n\t\tQString playerName = settings.value(\"player\" + QString::number(i) + \"name\").toString();\n\t\tif (playerName.isEmpty()) playerName = QString(\"Player_\") + QString::number(i);\n\t\tm_playerNameLineEdits[i]->setText(playerName);\n\t\t\/\/input\n\t\tint playerInput =\n\t\t\tsettings.value(\"player\" + QString::number(i) + \"input\").toInt();\n\t\tm_playerComboBoxes[i]->setCurrentIndex(playerInput);\n\t\t\/\/color\n\t\tm_playerColors[i] =\n\t\t\tsettings.value(\"player\" + QString::number(i) + \"color\").value<QColor>();\n\t\tm_playerColors[i] = m_playerColors[i].value() == 0 ? initialColors[i] : m_playerColors[i];\n\t\tQString colorString = QString(\"background-color: %1\").arg(m_playerColors[i].name());\n\t\tm_colorButtons[i]->setStyleSheet(colorString);\n\t\t\/\/own view\n\t\tm_ownViewCheckboxes[i]->setChecked(settings.value(\"player\" + QString::number(i) + \"ownView\").toBool() || i == 0);\n\t}\n\n\tupdatePlayerInputBoxes();\n\tbikeNumberChanged(m_bikeNumberSpinBox->value());\n}\n\nvoid MainWindow::saveSettings()\n{\n\tQSettings settings(m_settingsFileName, QSettings::IniFormat);\n\n\tsettings.setValue(\"bikeNumber\", QString::number(m_bikeNumberSpinBox->value()));\n\tsettings.setValue(\"timeLimit\", QString::number(m_timeLimitSpinBox->value()));\n\tsettings.setValue(\"postProcessing\", QString::number(m_postProcessingCheckBox->isChecked()));\n\tsettings.setValue(\"vSyncOff\", QString::number(m_testPerformanceCheckBox->isChecked()));\n\tsettings.setValue(\"debugView\", QString::number(m_debugViewCheckBox->isChecked()));\n\tsettings.setValue(\"reflection\", QString::number(m_reflectionCheckBox->isChecked()));\n\tsettings.setValue(\"level\", QString::number(m_levelComboBox->currentIndex()));\n\n\tfor (int i = 0; i < MAX_BIKES; i++)\n\t{\n\t\tsettings.setValue(\"player\" + QString::number(i) + \"name\",\n\t\t\tm_playerNameLineEdits[i]->text());\n\t\tsettings.setValue(\"player\" + QString::number(i) + \"input\",\n\t\t\tm_playerComboBoxes[i]->currentIndex());\n\t\tsettings.setValue(\"player\" + QString::number(i) + \"color\",\n\t\t\tm_playerColors[i]);\n\t\tsettings.setValue(\"player\" + QString::number(i) + \"ownView\",\n\t\t\tm_ownViewCheckboxes[i]->isChecked());\n\t}\n\n\tsettings.sync();\n}<commit_msg>#86 warn user if no levels were found<commit_after>#include \"mainwindow.h\"\n\/\/ Qt\n#include <QDir>\n#include <QSettings>\n#include <QThread>\n#include <QBoxLayout>\n#include <QLabel>\n#include <QKeyEvent>\n#include <QCoreApplication>\n#include <QSignalMapper>\n#include <QLineEdit>\n#include <QMessageBox>\n\/\/ OSG\n#include <osg\/ref_ptr>\n\/\/ troen\n#include \"troengame.h\"\n\nusing namespace troen;\n\n#define MAX_BIKES 6\n\nMainWindow::MainWindow(QWidget * parent)\n{\n\tQMainWindow();\n    \/\/ configure window\n    this->setWindowTitle(\"Troen\");\n\n\t\/\/ create & order widgets\n\tQWidget* vBoxWidget = new QWidget;\n\tQVBoxLayout* vBoxLayout = new QVBoxLayout;\n\tvBoxWidget->setLayout(vBoxLayout);\n\tsetCentralWidget(vBoxWidget);\n\n\t\/\/ levelName\n\tm_levelComboBox = new QComboBox;\n\t\n\t\/\/ get files from levels folder\n\tQStringList nameFilter(\"*.ive\");\n\tQDir directory(\"data\/levels\/\");\n\tQStringList levelFiles = directory.entryList(nameFilter);\n\tforeach(QString currentFile, levelFiles) {\n\t\t\/\/ remove .ive from string\n\t\tcurrentFile.chop(4);\n\t\tm_levelComboBox->addItem(currentFile);\n\t}\n\n\tif (m_levelComboBox->count() == 0){\n\t\tQMessageBox::warning(NULL, \"Missing levels\", \"Make sure you have the data\/levels folder (see Dropbox).\");\n\t}\n\n\tvBoxLayout->addWidget(m_levelComboBox);\n\n\t\/\/ bikeNumber\n\t{\n\t\tQWidget* bikeNumberWidget = new QWidget;\n\t\tQHBoxLayout* bikeNumberLayout = new QHBoxLayout;\n\t\tbikeNumberWidget->setLayout(bikeNumberLayout);\n\n\t\tQLabel* bikeNumberLabel = new QLabel(\"Number of Bikes: \");\n\t\tbikeNumberLayout->addWidget(bikeNumberLabel);\n\n\t\tm_bikeNumberSpinBox = new QSpinBox;\n\t\tm_bikeNumberSpinBox->setMinimum(1);\n\t\tm_bikeNumberSpinBox->setMaximum(6);\n\t\tm_bikeNumberSpinBox->setValue(1);\n\t\tbikeNumberLayout->addWidget(m_bikeNumberSpinBox);\n\n\t\tvBoxLayout->addWidget(bikeNumberWidget);\n\t}\n\n\t\/\/ timeLimit\n\t{\n\t\tQWidget* timeLimitWidget = new QWidget;\n\t\tQHBoxLayout* timeLimitLayout = new QHBoxLayout;\n\t\ttimeLimitWidget->setLayout(timeLimitLayout);\n\n\t\tQLabel* timeLimitLabel = new QLabel(\"TimeLimit: \");\n\t\ttimeLimitLayout->addWidget(timeLimitLabel);\n\n\t\tm_timeLimitSpinBox = new QSpinBox;\n\t\tm_timeLimitSpinBox->setMinimum(0);\n\t\tm_timeLimitSpinBox->setMaximum(10);\n\t\tm_timeLimitSpinBox->setValue(0);\n\t\ttimeLimitLayout->addWidget(m_timeLimitSpinBox);\n\n\t\tvBoxLayout->addWidget(timeLimitWidget);\n\t}\n\n\tQSignalMapper* signalMapper = new QSignalMapper(this);\n\n\t\/\/ bikeInputs\n\tfor (int i = 0; i < MAX_BIKES; i++)\n\t{\n\t\tQWidget* playerInputWidget = new QWidget;\n\t\tQHBoxLayout* playerInputLayout = new QHBoxLayout;\n\t\tplayerInputWidget->setLayout(playerInputLayout);\n\t\tplayerInputLayout->setMargin(1);\n\n\t\tQString playerString = QString(\"Player_\") + QString::number(i);\n\t\tQLabel* playerInputLabel = new QLabel(playerString);\n\t\tplayerInputLayout->addWidget(playerInputLabel);\n\n\t\tQLineEdit* playerNameLineEdit = new QLineEdit;\n\t\tplayerNameLineEdit->setText(playerString);\n\t\tplayerNameLineEdit->setMaximumWidth(75);\n\t\tplayerNameLineEdit->setMaxLength(10);\n\t\tm_playerNameLineEdits.push_back(playerNameLineEdit);\n\t\tplayerInputLayout->addWidget(playerNameLineEdit);\n\n\t\tQComboBox* playerComboBox = new QComboBox;\n\t\tplayerComboBox->addItem(\"Keyboard WASD\");\n\t\tplayerComboBox->addItem(\"Keyboard Arrows\");\n\t\tplayerComboBox->addItem(\"Gamepad XBox\");\n\t\tplayerComboBox->addItem(\"GAMEPAD PS4\");\n\t\tplayerComboBox->addItem(\"AI\");\n\t\tplayerInputLayout->addWidget(playerComboBox);\n\t\tm_playerComboBoxes.push_back(playerComboBox);\n\n\t\tQPushButton* colorButton = new QPushButton();\n\t\tcolorButton->setContentsMargins(0, 5, 0, 5);\n\t\tsignalMapper->setMapping(colorButton, i);\n\t\tconnect(colorButton, SIGNAL(clicked()), signalMapper, SLOT(map()));\n\t\tplayerInputLayout->addWidget(colorButton);\n\t\tm_playerColors.push_back(QColor());\n\t\tm_colorButtons.push_back(colorButton);\n\n\t\t\/\/ own view\n\t\tQCheckBox* ownViewCheckBox = new QCheckBox(\"&Own view\");\n\t\tbool isFirstPlayer = i == 0;\n\t\townViewCheckBox->setChecked(isFirstPlayer);\n\t\townViewCheckBox->setDisabled(isFirstPlayer);\n\t\tm_ownViewCheckboxes.push_back(ownViewCheckBox);\n\t\tplayerInputLayout->addWidget(ownViewCheckBox);\n\n\t\tplayerComboBox->setCurrentIndex(i < 2 ? i : 3);\t\n\t\tvBoxLayout->addWidget(playerInputWidget);\n\t}\n\n\tconnect(signalMapper, SIGNAL(mapped(int)), this, SLOT(chooseColor(int)));\n\tupdatePlayerInputBoxes();\n\n\t\/\/fullscreenCheckBox\n\tm_fullscreenCheckBox = new QCheckBox(\"&Fullscreen\");\n\tvBoxLayout->addWidget(m_fullscreenCheckBox, 0, Qt::AlignLeft);\n\n\t\/\/ postProcessingCheckBox\n\tm_postProcessingCheckBox = new QCheckBox(\"&PostProcessing\");\n\tvBoxLayout->addWidget(m_postProcessingCheckBox, 0, Qt::AlignLeft);\n\tm_postProcessingCheckBox->setChecked(false);\n\n\t\/\/ postProcessingCheckBox\n\tm_testPerformanceCheckBox = new QCheckBox(\"&TestPerformance - vSync OFF\");\n\tvBoxLayout->addWidget(m_testPerformanceCheckBox, 0, Qt::AlignLeft);\n\tm_testPerformanceCheckBox->setChecked(true);\n\n\t\/\/ debugViewCheckBox\n\tm_debugViewCheckBox = new QCheckBox(\"&DebugView\");\n\tvBoxLayout->addWidget(m_debugViewCheckBox, 0, Qt::AlignLeft);\n\tm_debugViewCheckBox->setChecked(false);\n\n\t\/\/reflectionCheckBox\n\tm_reflectionCheckBox = new QCheckBox(\"&Reflection\");\n\tvBoxLayout->addWidget(m_reflectionCheckBox, 0, Qt::AlignLeft);\n\tm_reflectionCheckBox->setChecked(true);\n\n\t\/\/ gameStartButton\n\tm_gameStartButton = new QPushButton(QString(\"start Game\"));\n\tm_gameStartButton->setContentsMargins(0, 5, 0, 5);\n\tvBoxLayout->addWidget(m_gameStartButton);\n\n\t\/\/ statusBar\n\tm_statusBar = new QStatusBar(this);\n\tm_statusBar->showMessage(\"...\");\n\tsetStatusBar(m_statusBar);\n\n\t\/\/ settings\n\tm_settingsFileName = QDir::currentPath() + \"\/settings.ini\";\n\tloadSettings();\n\n\t\/\/ create GameThread and Game\n\tm_gameThread = new QThread(this);\n\tm_troenGame = new TroenGame(m_gameThread);\n\n\tconnect(m_gameStartButton, SIGNAL(clicked()), this, SLOT(prepareGameStart()));\n\tconnect(m_bikeNumberSpinBox, SIGNAL(valueChanged(int)), this, SLOT(updatePlayerInputBoxes()));\n\tconnect(m_bikeNumberSpinBox, SIGNAL(valueChanged(int)), this, SLOT(bikeNumberChanged(int)));\n\n\tconnect(this, SIGNAL(startGame(GameConfig)), m_troenGame, SLOT(prepareAndStartGame(const GameConfig&)));\n}\n\nMainWindow::~MainWindow()\n{\n\tm_gameThread->terminate();\n}\n\nvoid MainWindow::chooseColor(int i)\n{\n\tm_playerColors[i] = QColorDialog::getColor(m_playerColors[i]);\n\tQString colorString = QString(\"background-color: %1\").arg(m_playerColors[i].name());\n\tm_colorButtons[i]->setStyleSheet(colorString);\n}\n\nvoid MainWindow::updatePlayerInputBoxes()\n{\n\tfor (int i = 0; i < MAX_BIKES; i++)\n\t{\n\t\tif (i < m_bikeNumberSpinBox->value())\n\t\t{\n\t\t\tm_playerComboBoxes.at(i)->setDisabled(false);\n\t\t\tm_colorButtons.at(i)->setDisabled(false);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_playerComboBoxes.at(i)->setDisabled(true);\n\t\t\tm_colorButtons.at(i)->setDisabled(true);\n\t\t}\n\t}\n}\n\nvoid MainWindow::prepareGameStart()\n{\n\tGameConfig config;\n\tconfig.numberOfPlayers = m_bikeNumberSpinBox->value();\n\tconfig.timeLimit = m_timeLimitSpinBox->value();\n\tconfig.playerInputTypes = new int[config.numberOfPlayers];\n\tconfig.playerColors = new QColor[config.numberOfPlayers];\n\tconfig.playerNames = new QString[config.numberOfPlayers];\n\tfor (int i = 0; i < config.numberOfPlayers; i++)\n\t{\n\t\tconfig.playerInputTypes[i] = m_playerComboBoxes.at(i)->currentIndex();\n\t\tconfig.playerNames[i] = m_playerNameLineEdits[i]->text();\n\t\tconfig.playerColors[i] = m_playerColors[i];\n\t}\n\tconfig.levelName = m_levelComboBox->currentText().toStdString();\n\tconfig.fullscreen = m_fullscreenCheckBox->isChecked();\n\tconfig.usePostProcessing = m_postProcessingCheckBox->isChecked();\n\tconfig.useDebugView = m_debugViewCheckBox->isChecked();\n\tconfig.testPerformance = m_testPerformanceCheckBox->isChecked();\n\tconfig.useReflection = m_reflectionCheckBox->isChecked();\n\n\t\/\/TODO: remove ownView checkboxes & replace with spinbox for number of views\n\tint i = 0;\n\tfor (auto ownViewCheckbox : m_ownViewCheckboxes) {\n\t\tconfig.ownView[i] = ownViewCheckbox->isChecked();\n\t\ti++;\n\t}\n\n\tsaveSettings();\n\temit startGame(config);\n}\n\nvoid MainWindow::bikeNumberChanged(int newBikeNumber)\n{\n\tfor (int i = 1; i < MAX_BIKES; i++)\n\t{\n\t\tif (i < newBikeNumber) {\n\t\t\tm_ownViewCheckboxes[i]->setDisabled(false);\n\t\t}\n\t\telse {\n\t\t\tm_ownViewCheckboxes[i]->setChecked(false);\n\t\t\tm_ownViewCheckboxes[i]->setDisabled(true);\n\t\t}\n\t}\n}\n\nbool MainWindow::eventFilter(QObject* object, QEvent* event)\n{\n\tif (event->type() == QEvent::KeyPress) {\n\t\tQKeyEvent* keyEvent = static_cast<QKeyEvent*>(event);\n\t\tif (keyEvent->key() == Qt::Key_Return) {\n\t\t\tthis->prepareGameStart();\n\t\t\tkeyEvent->accept();\n\t\t\treturn true;\n\t\t}\n\t\telse if (keyEvent->key() == Qt::Key_Escape)\n\t\t{\n\t\t\tthis->close();\n\t\t\tkeyEvent->accept();\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn QMainWindow::eventFilter(object, event);\n}\n\nvoid MainWindow::childEvent(QChildEvent* e)\n{\n\tif (e->child()->isWidgetType()) {\n\t\tif (e->type() == QEvent::ChildAdded) {\n\t\t\te->child()->installEventFilter(this);\n\t\t}\n\t\telse if (e->type() == QEvent::ChildRemoved) {\n\t\t\te->child()->removeEventFilter(this);\n\t\t}\n\t}\n\tQWidget::childEvent(e);\n}\n\nvoid MainWindow::loadSettings()\n{\n\tQSettings settings(m_settingsFileName, QSettings::IniFormat);\n\n\tstd::vector<QColor> initialColors{ QColor(255.0, 0.0, 0.0), QColor(0.0, 255.0, 0.0), QColor(0.0, 0.0, 255.0),\n\t\tQColor(255.0, 255.0, 0.0), QColor(0.0, 255.0, 255.0), QColor(255.0, 0.0, 255.0) };\n\n\tm_bikeNumberSpinBox->setValue(settings.value(\"bikeNumber\").toInt());\n\tm_timeLimitSpinBox->setValue(settings.value(\"timeLimit\").toInt());\n\tm_postProcessingCheckBox->setChecked(settings.value(\"postProcessing\").toBool());\n\tm_testPerformanceCheckBox->setChecked(settings.value(\"vSyncOff\").toBool());\n\tm_debugViewCheckBox->setChecked(settings.value(\"debugView\").toBool());\n\tm_reflectionCheckBox->setChecked(settings.value(\"reflection\").toBool());\n\tm_levelComboBox->setCurrentIndex(settings.value(\"level\").toInt());\n\n\tfor (int i = 0; i < MAX_BIKES; i++)\n\t{\n\t\t\/\/name\n\t\tQString playerName = settings.value(\"player\" + QString::number(i) + \"name\").toString();\n\t\tif (playerName.isEmpty()) playerName = QString(\"Player_\") + QString::number(i);\n\t\tm_playerNameLineEdits[i]->setText(playerName);\n\t\t\/\/input\n\t\tint playerInput =\n\t\t\tsettings.value(\"player\" + QString::number(i) + \"input\").toInt();\n\t\tm_playerComboBoxes[i]->setCurrentIndex(playerInput);\n\t\t\/\/color\n\t\tm_playerColors[i] =\n\t\t\tsettings.value(\"player\" + QString::number(i) + \"color\").value<QColor>();\n\t\tm_playerColors[i] = m_playerColors[i].value() == 0 ? initialColors[i] : m_playerColors[i];\n\t\tQString colorString = QString(\"background-color: %1\").arg(m_playerColors[i].name());\n\t\tm_colorButtons[i]->setStyleSheet(colorString);\n\t\t\/\/own view\n\t\tm_ownViewCheckboxes[i]->setChecked(settings.value(\"player\" + QString::number(i) + \"ownView\").toBool() || i == 0);\n\t}\n\n\tupdatePlayerInputBoxes();\n\tbikeNumberChanged(m_bikeNumberSpinBox->value());\n}\n\nvoid MainWindow::saveSettings()\n{\n\tQSettings settings(m_settingsFileName, QSettings::IniFormat);\n\n\tsettings.setValue(\"bikeNumber\", QString::number(m_bikeNumberSpinBox->value()));\n\tsettings.setValue(\"timeLimit\", QString::number(m_timeLimitSpinBox->value()));\n\tsettings.setValue(\"postProcessing\", QString::number(m_postProcessingCheckBox->isChecked()));\n\tsettings.setValue(\"vSyncOff\", QString::number(m_testPerformanceCheckBox->isChecked()));\n\tsettings.setValue(\"debugView\", QString::number(m_debugViewCheckBox->isChecked()));\n\tsettings.setValue(\"reflection\", QString::number(m_reflectionCheckBox->isChecked()));\n\tsettings.setValue(\"level\", QString::number(m_levelComboBox->currentIndex()));\n\n\tfor (int i = 0; i < MAX_BIKES; i++)\n\t{\n\t\tsettings.setValue(\"player\" + QString::number(i) + \"name\",\n\t\t\tm_playerNameLineEdits[i]->text());\n\t\tsettings.setValue(\"player\" + QString::number(i) + \"input\",\n\t\t\tm_playerComboBoxes[i]->currentIndex());\n\t\tsettings.setValue(\"player\" + QString::number(i) + \"color\",\n\t\t\tm_playerColors[i]);\n\t\tsettings.setValue(\"player\" + QString::number(i) + \"ownView\",\n\t\t\tm_ownViewCheckboxes[i]->isChecked());\n\t}\n\n\tsettings.sync();\n}<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file restclient.cpp\n * @brief implementation of the restclient class\n * @author Daniel Schauenberg <d@unwiredcouch.com>\n *\/\n\n\/*========================\n         INCLUDES\n  ========================*\/\n#include \"include\/restclient.h\"\n\n#include <cstring>\n#include <string>\n#include <iostream>\n#include <map>\n\n\/** initialize user agent string *\/\nconst char* RestClient::user_agent = \"restclient-cpp\/\" VERSION;\n\/** initialize authentication variable *\/\nstd::string RestClient::user_pass =  std::string();\n\/** Authentication Methods implementation *\/\nvoid RestClient::clearAuth(){\n  RestClient::user_pass.clear();\n}\nvoid RestClient::setAuth(const std::string& user,const std::string& password){\n  RestClient::user_pass.clear();\n  RestClient::user_pass += user+\":\"+password;\n}\n\/**\n * @brief HTTP GET method\n *\n * @param url to query\n *\n * @return response struct\n *\/\nRestClient::response RestClient::get(const std::string& url)\n{\n  \/** create return struct *\/\n  RestClient::response ret;\n\n  \/\/ use libcurl\n  CURL *curl;\n  CURLcode res;\n\n  curl = curl_easy_init();\n  if (curl)\n  {\n    \/** set basic authentication if present*\/\n    if(RestClient::user_pass.length()>0){\n      curl_easy_setopt(curl, CURLOPT_HTTPAUTH, CURLAUTH_BASIC);\n      curl_easy_setopt(curl, CURLOPT_USERPWD, RestClient::user_pass.c_str());\n    }\n    \/** set user agent *\/\n    curl_easy_setopt(curl, CURLOPT_USERAGENT, RestClient::user_agent);\n    \/** set query URL *\/\n    curl_easy_setopt(curl, CURLOPT_URL, url.c_str());\n    \/** set callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, RestClient::write_callback);\n    \/** set data object to pass to callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEDATA, &ret);\n    \/** set the header callback function *\/\n    curl_easy_setopt(curl, CURLOPT_HEADERFUNCTION, RestClient::header_callback);\n    \/** callback object for headers *\/\n    curl_easy_setopt(curl, CURLOPT_HEADERDATA, &ret);\n    \/** perform the actual query *\/\n    res = curl_easy_perform(curl);\n    if (res != 0)\n    {\n      ret.body = \"Failed to query.\";\n      ret.code = -1;\n      return ret;\n    }\n    long http_code = 0;\n    curl_easy_getinfo(curl, CURLINFO_RESPONSE_CODE, &http_code);\n    ret.code = static_cast<int>(http_code);\n\n    curl_easy_cleanup(curl);\n  }\n\n  return ret;\n}\n\/**\n * @brief HTTP POST method\n *\n * @param url to query\n * @param ctype content type as string\n * @param data HTTP POST body\n *\n * @return response struct\n *\/\nRestClient::response RestClient::post(const std::string& url,\n                                      const std::string& ctype,\n                                      const std::string& data)\n{\n  \/** create return struct *\/\n  RestClient::response ret;\n  \/** build content-type header string *\/\n  std::string ctype_header = \"Content-Type: \" + ctype;\n\n  \/\/ use libcurl\n  CURL *curl;\n  CURLcode res;\n\n  curl = curl_easy_init();\n  if (curl)\n  {\n    \/** set basic authentication if present*\/\n    if(RestClient::user_pass.length()>0){\n      curl_easy_setopt(curl, CURLOPT_HTTPAUTH, CURLAUTH_BASIC);\n      curl_easy_setopt(curl, CURLOPT_USERPWD, RestClient::user_pass.c_str());\n    }\n    \/** set user agent *\/\n    curl_easy_setopt(curl, CURLOPT_USERAGENT, RestClient::user_agent);\n    \/** set query URL *\/\n    curl_easy_setopt(curl, CURLOPT_URL, url.c_str());\n    \/** Now specify we want to POST data *\/\n    curl_easy_setopt(curl, CURLOPT_POST, 1L);\n    \/** set post fields *\/\n    curl_easy_setopt(curl, CURLOPT_POSTFIELDS, data.c_str());\n    curl_easy_setopt(curl, CURLOPT_POSTFIELDSIZE, data.size());\n    \/** set callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, RestClient::write_callback);\n    \/** set data object to pass to callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEDATA, &ret);\n    \/** set the header callback function *\/\n    curl_easy_setopt(curl, CURLOPT_HEADERFUNCTION, RestClient::header_callback);\n    \/** callback object for headers *\/\n    curl_easy_setopt(curl, CURLOPT_HEADERDATA, &ret);\n    \/** set content-type header *\/\n    curl_slist* header = NULL;\n    header = curl_slist_append(header, ctype_header.c_str());\n    curl_easy_setopt(curl, CURLOPT_HTTPHEADER, header);\n    \/** perform the actual query *\/\n    res = curl_easy_perform(curl);\n    if (res != 0)\n    {\n      ret.body = \"Failed to query.\";\n      ret.code = -1;\n      return ret;\n    }\n    long http_code = 0;\n    curl_easy_getinfo(curl, CURLINFO_RESPONSE_CODE, &http_code);\n    ret.code = static_cast<int>(http_code);\n\n    curl_slist_free_all(header);\n    curl_easy_cleanup(curl);\n  }\n\n  return ret;\n}\n\/**\n * @brief HTTP PUT method\n *\n * @param url to query\n * @param ctype content type as string\n * @param data HTTP PUT body\n *\n * @return response struct\n *\/\nRestClient::response RestClient::put(const std::string& url,\n                                     const std::string& ctype,\n                                     const std::string& data)\n{\n  \/** create return struct *\/\n  RestClient::response ret;\n  \/** build content-type header string *\/\n  std::string ctype_header = \"Content-Type: \" + ctype;\n\n  \/** initialize upload object *\/\n  RestClient::upload_object up_obj;\n  up_obj.data = data.c_str();\n  up_obj.length = data.size();\n\n  \/\/ use libcurl\n  CURL *curl;\n  CURLcode res;\n\n  curl = curl_easy_init();\n  if (curl)\n  {\n    \/** set basic authentication if present*\/\n    if(RestClient::user_pass.length()>0){\n      curl_easy_setopt(curl, CURLOPT_HTTPAUTH, CURLAUTH_BASIC);\n      curl_easy_setopt(curl, CURLOPT_USERPWD, RestClient::user_pass.c_str());\n    }\n    \/** set user agent *\/\n    curl_easy_setopt(curl, CURLOPT_USERAGENT, RestClient::user_agent);\n    \/** set query URL *\/\n    curl_easy_setopt(curl, CURLOPT_URL, url.c_str());\n    \/** Now specify we want to PUT data *\/\n    curl_easy_setopt(curl, CURLOPT_PUT, 1L);\n    curl_easy_setopt(curl, CURLOPT_UPLOAD, 1L);\n    \/** set read callback function *\/\n    curl_easy_setopt(curl, CURLOPT_READFUNCTION, RestClient::read_callback);\n    \/** set data object to pass to callback function *\/\n    curl_easy_setopt(curl, CURLOPT_READDATA, &up_obj);\n    \/** set callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, RestClient::write_callback);\n    \/** set data object to pass to callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEDATA, &ret);\n    \/** set the header callback function *\/\n    curl_easy_setopt(curl, CURLOPT_HEADERFUNCTION, RestClient::header_callback);\n    \/** callback object for headers *\/\n    curl_easy_setopt(curl, CURLOPT_HEADERDATA, &ret);\n    \/** set data size *\/\n    curl_easy_setopt(curl, CURLOPT_INFILESIZE,\n                     static_cast<long>(up_obj.length));\n\n    \/** set content-type header *\/\n    curl_slist* header = NULL;\n    header = curl_slist_append(header, ctype_header.c_str());\n    curl_easy_setopt(curl, CURLOPT_HTTPHEADER, header);\n    \/** perform the actual query *\/\n    res = curl_easy_perform(curl);\n    if (res != 0)\n    {\n      ret.body = \"Failed to query.\";\n      ret.code = -1;\n      return ret;\n    }\n    long http_code = 0;\n    curl_easy_getinfo(curl, CURLINFO_RESPONSE_CODE, &http_code);\n    ret.code = static_cast<int>(http_code);\n\n    curl_slist_free_all(header);\n    curl_easy_cleanup(curl);\n  }\n\n  return ret;\n}\n\/**\n * @brief HTTP DELETE method\n *\n * @param url to query\n *\n * @return response struct\n *\/\nRestClient::response RestClient::del(const std::string& url)\n{\n  \/** create return struct *\/\n  RestClient::response ret;\n\n  \/** we want HTTP DELETE *\/\n  const char* http_delete = \"DELETE\";\n\n  \/\/ use libcurl\n  CURL *curl;\n  CURLcode res;\n\n  curl = curl_easy_init();\n  if (curl)\n  {\n    \/** set basic authentication if present*\/\n    if(RestClient::user_pass.length()>0){\n      curl_easy_setopt(curl, CURLOPT_HTTPAUTH, CURLAUTH_BASIC);\n      curl_easy_setopt(curl, CURLOPT_USERPWD, RestClient::user_pass.c_str());\n    }\n    \/** set user agent *\/\n    curl_easy_setopt(curl, CURLOPT_USERAGENT, RestClient::user_agent);\n    \/** set query URL *\/\n    curl_easy_setopt(curl, CURLOPT_URL, url.c_str());\n    \/** set HTTP DELETE METHOD *\/\n    curl_easy_setopt(curl, CURLOPT_CUSTOMREQUEST, http_delete);\n    \/** set callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, RestClient::write_callback);\n    \/** set data object to pass to callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEDATA, &ret);\n    \/** set the header callback function *\/\n    curl_easy_setopt(curl, CURLOPT_HEADERFUNCTION, RestClient::header_callback);\n    \/** callback object for headers *\/\n    curl_easy_setopt(curl, CURLOPT_HEADERDATA, &ret);\n    \/** perform the actual query *\/\n    res = curl_easy_perform(curl);\n    if (res != 0)\n    {\n      ret.body = \"Failed to query.\";\n      ret.code = -1;\n      return ret;\n    }\n    long http_code = 0;\n    curl_easy_getinfo(curl, CURLINFO_RESPONSE_CODE, &http_code);\n    ret.code = static_cast<int>(http_code);\n\n    curl_easy_cleanup(curl);\n  }\n\n  return ret;\n}\n\n\/**\n * @brief write callback function for libcurl\n *\n * @param data returned data of size (size*nmemb)\n * @param size size parameter\n * @param nmemb memblock parameter\n * @param userdata pointer to user data to save\/work with return data\n *\n * @return (size * nmemb)\n *\/\nsize_t RestClient::write_callback(void *data, size_t size, size_t nmemb,\n                            void *userdata)\n{\n  RestClient::response* r;\n  r = reinterpret_cast<RestClient::response*>(userdata);\n  r->body.append(reinterpret_cast<char*>(data), size*nmemb);\n\n  return (size * nmemb);\n}\n\n\/**\n * @brief header callback for libcurl\n * \n * @param data returned (header line) \n * @param size of data\n * @param nmemb memblock\n * @param userdata pointer to user data object to save headr data\n * @return size * nmemb;\n *\/\nsize_t RestClient::header_callback(void *data, size_t size, size_t nmemb,\n                            void *userdata)\n{\n  RestClient::response* r;\n  r = reinterpret_cast<RestClient::response*>(userdata);\n  std::string header(reinterpret_cast<char*>(data), size*nmemb);\n  size_t seperator = header.find_first_of(\":\");\n  if ( std::string::npos == seperator ) { \n    \/\/roll with non seperated headers... \n    trim(header); \n    if ( 0 == header.length() ){ \n\treturn (size * nmemb); \/\/blank line;\n    } \n    r->headers[header] = \"present\";\n  } else {\n    std::string key = header.substr(0, seperator);\n    trim(key);\n    std::string value = header.substr(seperator + 1);\n    trim (value);\n    r->headers[key] = value;\n  }\n\n  return (size * nmemb);\n}\n\n\/**\n * @brief read callback function for libcurl\n *\n * @param pointer of max size (size*nmemb) to write data to\n * @param size size parameter\n * @param nmemb memblock parameter\n * @param userdata pointer to user data to read data from\n *\n * @return (size * nmemb)\n *\/\nsize_t RestClient::read_callback(void *data, size_t size, size_t nmemb,\n                            void *userdata)\n{\n  \/** get upload struct *\/\n  RestClient::upload_object* u;\n  u = reinterpret_cast<RestClient::upload_object*>(userdata);\n  \/** set correct sizes *\/\n  size_t curl_size = size * nmemb;\n  size_t copy_size = (u->length < curl_size) ? u->length : curl_size;\n  \/** copy data to buffer *\/\n  memcpy(data, u->data, copy_size);\n  \/** decrement length and increment data pointer *\/\n  u->length -= copy_size;\n  u->data += copy_size;\n  \/** return copied size *\/\n  return copy_size;\n}\n<commit_msg>initialize values<commit_after>\/**\n * @file restclient.cpp\n * @brief implementation of the restclient class\n * @author Daniel Schauenberg <d@unwiredcouch.com>\n *\/\n\n\/*========================\n         INCLUDES\n  ========================*\/\n#include \"include\/restclient.h\"\n\n#include <cstring>\n#include <string>\n#include <iostream>\n#include <map>\n\n\/** initialize user agent string *\/\nconst char* RestClient::user_agent = \"restclient-cpp\/\" VERSION;\n\/** initialize authentication variable *\/\nstd::string RestClient::user_pass =  std::string();\n\/** Authentication Methods implementation *\/\nvoid RestClient::clearAuth(){\n  RestClient::user_pass.clear();\n}\nvoid RestClient::setAuth(const std::string& user,const std::string& password){\n  RestClient::user_pass.clear();\n  RestClient::user_pass += user+\":\"+password;\n}\n\/**\n * @brief HTTP GET method\n *\n * @param url to query\n *\n * @return response struct\n *\/\nRestClient::response RestClient::get(const std::string& url)\n{\n  \/** create return struct *\/\n  RestClient::response ret = {};\n\n  \/\/ use libcurl\n  CURL *curl = NULL;\n  CURLcode res = CURLE_OK;\n\n  curl = curl_easy_init();\n  if (curl)\n  {\n    \/** set basic authentication if present*\/\n    if(RestClient::user_pass.length()>0){\n      curl_easy_setopt(curl, CURLOPT_HTTPAUTH, CURLAUTH_BASIC);\n      curl_easy_setopt(curl, CURLOPT_USERPWD, RestClient::user_pass.c_str());\n    }\n    \/** set user agent *\/\n    curl_easy_setopt(curl, CURLOPT_USERAGENT, RestClient::user_agent);\n    \/** set query URL *\/\n    curl_easy_setopt(curl, CURLOPT_URL, url.c_str());\n    \/** set callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, RestClient::write_callback);\n    \/** set data object to pass to callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEDATA, &ret);\n    \/** set the header callback function *\/\n    curl_easy_setopt(curl, CURLOPT_HEADERFUNCTION, RestClient::header_callback);\n    \/** callback object for headers *\/\n    curl_easy_setopt(curl, CURLOPT_HEADERDATA, &ret);\n    \/** perform the actual query *\/\n    res = curl_easy_perform(curl);\n    if (res != CURLE_OK)\n    {\n      ret.body = \"Failed to query.\";\n      ret.code = -1;\n      return ret;\n    }\n    long http_code = 0;\n    curl_easy_getinfo(curl, CURLINFO_RESPONSE_CODE, &http_code);\n    ret.code = static_cast<int>(http_code);\n\n    curl_easy_cleanup(curl);\n  }\n\n  return ret;\n}\n\/**\n * @brief HTTP POST method\n *\n * @param url to query\n * @param ctype content type as string\n * @param data HTTP POST body\n *\n * @return response struct\n *\/\nRestClient::response RestClient::post(const std::string& url,\n                                      const std::string& ctype,\n                                      const std::string& data)\n{\n  \/** create return struct *\/\n  RestClient::response ret = {};\n  \/** build content-type header string *\/\n  std::string ctype_header = \"Content-Type: \" + ctype;\n\n  \/\/ use libcurl\n  CURL *curl = NULL;\n  CURLcode res = CURLE_OK;\n\n  curl = curl_easy_init();\n  if (curl)\n  {\n    \/** set basic authentication if present*\/\n    if(RestClient::user_pass.length()>0){\n      curl_easy_setopt(curl, CURLOPT_HTTPAUTH, CURLAUTH_BASIC);\n      curl_easy_setopt(curl, CURLOPT_USERPWD, RestClient::user_pass.c_str());\n    }\n    \/** set user agent *\/\n    curl_easy_setopt(curl, CURLOPT_USERAGENT, RestClient::user_agent);\n    \/** set query URL *\/\n    curl_easy_setopt(curl, CURLOPT_URL, url.c_str());\n    \/** Now specify we want to POST data *\/\n    curl_easy_setopt(curl, CURLOPT_POST, 1L);\n    \/** set post fields *\/\n    curl_easy_setopt(curl, CURLOPT_POSTFIELDS, data.c_str());\n    curl_easy_setopt(curl, CURLOPT_POSTFIELDSIZE, data.size());\n    \/** set callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, RestClient::write_callback);\n    \/** set data object to pass to callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEDATA, &ret);\n    \/** set the header callback function *\/\n    curl_easy_setopt(curl, CURLOPT_HEADERFUNCTION, RestClient::header_callback);\n    \/** callback object for headers *\/\n    curl_easy_setopt(curl, CURLOPT_HEADERDATA, &ret);\n    \/** set content-type header *\/\n    curl_slist* header = NULL;\n    header = curl_slist_append(header, ctype_header.c_str());\n    curl_easy_setopt(curl, CURLOPT_HTTPHEADER, header);\n    \/** perform the actual query *\/\n    res = curl_easy_perform(curl);\n    if (res != CURLE_OK)\n    {\n      ret.body = \"Failed to query.\";\n      ret.code = -1;\n      return ret;\n    }\n    long http_code = 0;\n    curl_easy_getinfo(curl, CURLINFO_RESPONSE_CODE, &http_code);\n    ret.code = static_cast<int>(http_code);\n\n    curl_slist_free_all(header);\n    curl_easy_cleanup(curl);\n  }\n\n  return ret;\n}\n\/**\n * @brief HTTP PUT method\n *\n * @param url to query\n * @param ctype content type as string\n * @param data HTTP PUT body\n *\n * @return response struct\n *\/\nRestClient::response RestClient::put(const std::string& url,\n                                     const std::string& ctype,\n                                     const std::string& data)\n{\n  \/** create return struct *\/\n  RestClient::response ret = {};\n  \/** build content-type header string *\/\n  std::string ctype_header = \"Content-Type: \" + ctype;\n\n  \/** initialize upload object *\/\n  RestClient::upload_object up_obj;\n  up_obj.data = data.c_str();\n  up_obj.length = data.size();\n\n  \/\/ use libcurl\n  CURL *curl = NULL;\n  CURLcode res = CURLE_OK;\n\n  curl = curl_easy_init();\n  if (curl)\n  {\n    \/** set basic authentication if present*\/\n    if(RestClient::user_pass.length()>0){\n      curl_easy_setopt(curl, CURLOPT_HTTPAUTH, CURLAUTH_BASIC);\n      curl_easy_setopt(curl, CURLOPT_USERPWD, RestClient::user_pass.c_str());\n    }\n    \/** set user agent *\/\n    curl_easy_setopt(curl, CURLOPT_USERAGENT, RestClient::user_agent);\n    \/** set query URL *\/\n    curl_easy_setopt(curl, CURLOPT_URL, url.c_str());\n    \/** Now specify we want to PUT data *\/\n    curl_easy_setopt(curl, CURLOPT_PUT, 1L);\n    curl_easy_setopt(curl, CURLOPT_UPLOAD, 1L);\n    \/** set read callback function *\/\n    curl_easy_setopt(curl, CURLOPT_READFUNCTION, RestClient::read_callback);\n    \/** set data object to pass to callback function *\/\n    curl_easy_setopt(curl, CURLOPT_READDATA, &up_obj);\n    \/** set callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, RestClient::write_callback);\n    \/** set data object to pass to callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEDATA, &ret);\n    \/** set the header callback function *\/\n    curl_easy_setopt(curl, CURLOPT_HEADERFUNCTION, RestClient::header_callback);\n    \/** callback object for headers *\/\n    curl_easy_setopt(curl, CURLOPT_HEADERDATA, &ret);\n    \/** set data size *\/\n    curl_easy_setopt(curl, CURLOPT_INFILESIZE,\n                     static_cast<long>(up_obj.length));\n\n    \/** set content-type header *\/\n    curl_slist* header = NULL;\n    header = curl_slist_append(header, ctype_header.c_str());\n    curl_easy_setopt(curl, CURLOPT_HTTPHEADER, header);\n    \/** perform the actual query *\/\n    res = curl_easy_perform(curl);\n    if (res != CURLE_OK)\n    {\n      ret.body = \"Failed to query.\";\n      ret.code = -1;\n      return ret;\n    }\n    long http_code = 0;\n    curl_easy_getinfo(curl, CURLINFO_RESPONSE_CODE, &http_code);\n    ret.code = static_cast<int>(http_code);\n\n    curl_slist_free_all(header);\n    curl_easy_cleanup(curl);\n  }\n\n  return ret;\n}\n\/**\n * @brief HTTP DELETE method\n *\n * @param url to query\n *\n * @return response struct\n *\/\nRestClient::response RestClient::del(const std::string& url)\n{\n  \/** create return struct *\/\n  RestClient::response ret = {};\n\n  \/** we want HTTP DELETE *\/\n  const char* http_delete = \"DELETE\";\n\n  \/\/ use libcurl\n  CURL *curl = NULL;\n  CURLcode res = CURLE_OK;\n\n  curl = curl_easy_init();\n  if (curl)\n  {\n    \/** set basic authentication if present*\/\n    if(RestClient::user_pass.length()>0){\n      curl_easy_setopt(curl, CURLOPT_HTTPAUTH, CURLAUTH_BASIC);\n      curl_easy_setopt(curl, CURLOPT_USERPWD, RestClient::user_pass.c_str());\n    }\n    \/** set user agent *\/\n    curl_easy_setopt(curl, CURLOPT_USERAGENT, RestClient::user_agent);\n    \/** set query URL *\/\n    curl_easy_setopt(curl, CURLOPT_URL, url.c_str());\n    \/** set HTTP DELETE METHOD *\/\n    curl_easy_setopt(curl, CURLOPT_CUSTOMREQUEST, http_delete);\n    \/** set callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, RestClient::write_callback);\n    \/** set data object to pass to callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEDATA, &ret);\n    \/** set the header callback function *\/\n    curl_easy_setopt(curl, CURLOPT_HEADERFUNCTION, RestClient::header_callback);\n    \/** callback object for headers *\/\n    curl_easy_setopt(curl, CURLOPT_HEADERDATA, &ret);\n    \/** perform the actual query *\/\n    res = curl_easy_perform(curl);\n    if (res != CURLE_OK)\n    {\n      ret.body = \"Failed to query.\";\n      ret.code = -1;\n      return ret;\n    }\n    long http_code = 0;\n    curl_easy_getinfo(curl, CURLINFO_RESPONSE_CODE, &http_code);\n    ret.code = static_cast<int>(http_code);\n\n    curl_easy_cleanup(curl);\n  }\n\n  return ret;\n}\n\n\/**\n * @brief write callback function for libcurl\n *\n * @param data returned data of size (size*nmemb)\n * @param size size parameter\n * @param nmemb memblock parameter\n * @param userdata pointer to user data to save\/work with return data\n *\n * @return (size * nmemb)\n *\/\nsize_t RestClient::write_callback(void *data, size_t size, size_t nmemb,\n                            void *userdata)\n{\n  RestClient::response* r;\n  r = reinterpret_cast<RestClient::response*>(userdata);\n  r->body.append(reinterpret_cast<char*>(data), size*nmemb);\n\n  return (size * nmemb);\n}\n\n\/**\n * @brief header callback for libcurl\n *\n * @param data returned (header line)\n * @param size of data\n * @param nmemb memblock\n * @param userdata pointer to user data object to save headr data\n * @return size * nmemb;\n *\/\nsize_t RestClient::header_callback(void *data, size_t size, size_t nmemb,\n                            void *userdata)\n{\n  RestClient::response* r;\n  r = reinterpret_cast<RestClient::response*>(userdata);\n  std::string header(reinterpret_cast<char*>(data), size*nmemb);\n  size_t seperator = header.find_first_of(\":\");\n  if ( std::string::npos == seperator ) {\n    \/\/roll with non seperated headers...\n    trim(header);\n    if ( 0 == header.length() ){\n\treturn (size * nmemb); \/\/blank line;\n    }\n    r->headers[header] = \"present\";\n  } else {\n    std::string key = header.substr(0, seperator);\n    trim(key);\n    std::string value = header.substr(seperator + 1);\n    trim (value);\n    r->headers[key] = value;\n  }\n\n  return (size * nmemb);\n}\n\n\/**\n * @brief read callback function for libcurl\n *\n * @param pointer of max size (size*nmemb) to write data to\n * @param size size parameter\n * @param nmemb memblock parameter\n * @param userdata pointer to user data to read data from\n *\n * @return (size * nmemb)\n *\/\nsize_t RestClient::read_callback(void *data, size_t size, size_t nmemb,\n                            void *userdata)\n{\n  \/** get upload struct *\/\n  RestClient::upload_object* u;\n  u = reinterpret_cast<RestClient::upload_object*>(userdata);\n  \/** set correct sizes *\/\n  size_t curl_size = size * nmemb;\n  size_t copy_size = (u->length < curl_size) ? u->length : curl_size;\n  \/** copy data to buffer *\/\n  memcpy(data, u->data, copy_size);\n  \/** decrement length and increment data pointer *\/\n  u->length -= copy_size;\n  u->data += copy_size;\n  \/** return copied size *\/\n  return copy_size;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * @file   watchpoint.cpp\n * @brief  Including the implemenation of watch point handler.\n *         Since we have to call functions in other header files, then it is\n *         impossible to put this function into the header file.\n * @author Tongping Liu <http:\/\/www.cs.umass.edu\/~tonyliu>\n *\/\n\n#include \"watchpoint.hh\"\n\n#include <assert.h>\n#include <errno.h>\n#include <fcntl.h>\n#include <linux\/hw_breakpoint.h>\n#include <linux\/perf_event.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <sys\/ioctl.h>\n#include <syscall.h>\n#include <ucontext.h>\n#include <unistd.h>\n\n#include \"log.hh\"\n#include \"memtrack.hh\"\n#include \"real.hh\"\n#include \"selfmap.hh\"\n#include \"xdefines.hh\"\n\nlong perf_event_open(struct perf_event_attr* hw_event, pid_t pid, int cpu, int group_fd,\n                     unsigned long flags) {\n  return syscall(__NR_perf_event_open, hw_event, pid, cpu, group_fd, flags);\n}\n#if 0\npid_t gettid() {\n  return syscall(__NR_gettid);\n}\n#endif\n\nbool watchpoint::addWatchpoint(void* addr, size_t value, faultyObjectType objtype,\n                               void* objectstart, size_t objectsize) {\n  bool hasWatchpoint = true;\n\n#ifndef EVALUATING_PERF\n  if(objtype == OBJECT_TYPE_OVERFLOW) {\n    PRINT(\"DoubleTake: Buffer overflow detected at address %p: value=0x%lx, size=%lx, start=%p\\n\",\n\t  addr, value, objectsize, objectstart);\n    \/\/ PRINT(\"DoubleTake: Buffer overflow at address %p with value 0x%lx. \\n\", addr, value);\n  } \n\telse if(objtype == OBJECT_TYPE_USEAFTERFREE) {\n   \/\/ assert(objtype == OBJECT_TYPE_USEAFTERFREE);\n    PRINT(\"DoubleTake: Use-after-free error detected at address %p.\", addr);\n  }\n#endif\n\n  if(_numWatchpoints < xdefines::MAX_WATCHPOINTS) {\n    \/\/ Record watch point information\n    _wp[_numWatchpoints].faultyaddr = addr;\n    _wp[_numWatchpoints].objectstart = objectstart;\n    _wp[_numWatchpoints].objtype = objtype;\n    \/\/  _wp[_numWatchpoints].objectsize = objectsize;\n    _wp[_numWatchpoints].faultyvalue = value;\n    _wp[_numWatchpoints].currentvalue = value;\n    _numWatchpoints++;\n  } else {\n    hasWatchpoint = false;\n  }\n\n  \/\/ Add it to memtrack too.\n\tif(objtype != OBJECT_TYPE_WATCHONLY)\n  \tmemtrack::getInstance().insert(objectstart, objectsize, objtype);\n\n  return !hasWatchpoint;\n}\n\nbool watchpoint::findFaultyObject(faultyObject** object) {\n  int trigPoints = 0;\n\n  PRINF(\"findFaultyObject: _numWatchpoints %d\\n\", _numWatchpoints);\n  for(int i = 0; i < _numWatchpoints; i++) {\n    unsigned long value = *((unsigned long*)_wp[i].faultyaddr);\n#ifndef EVALUATING_PERF\n    PRINT(\"DoubleTake: checking %d point: address %p currentvalue %lx value %lx\\n\", i, _wp[i].faultyaddr, _wp[i].currentvalue, value);\n#endif\n    \/\/ Check whether now overflow actually happens\n    if(value != _wp[i].currentvalue || _numWatchpoints == 1) {\n      \/\/\t\t\t\tPRINT(\"WARNING: we %d points, currentvalue %lx value %lx\\n\", trigPoints,\n      \/\/_wp[i].currentvalue, value);\n      _wp[i].currentvalue = value;\n      *object = &_wp[i];\n      trigPoints++;\n      continue;\n    }\n  }\n\n  if(trigPoints > 1) {\n    PRINT(\"WARNING: we have %d watchpoints triggered, only one watchpoint allowed.\\n\", trigPoints);\n  }\n\n  return (trigPoints != 0);\n}\n\nbool watchpoint::hasToRollback() { return _numWatchpoints > 0; }\n\nvoid watchpoint::installWatchpoints() {\n  struct sigaction trap_action;\n\n  \/\/  PRINT(\"installWatchpoints %d watchpoints %d!!!!!!!!!\\n\", __LINE__, _numWatchpoints);\n  \/\/ We don't need to setup watchpoints if it is 0.\n  if(_numWatchpoints == 0) {\n    return;\n  }\n\n  \/\/ Now we are setting a trap handler for myself.\n  trap_action.sa_sigaction = watchpoint::trapHandler;\n  trap_action.sa_flags = SA_SIGINFO | SA_RESTART | SA_NODEFER;\n  Real::sigaction(SIGTRAP, &trap_action, NULL);\n\n  \/\/ Setup the watchpoints information and notify the daemon (my parent)\n  struct watchpointsInfo wpinfo;\n  wpinfo.count = _numWatchpoints;\n  int perffd;\n\n  \/\/  PRINT(\"Install watchpoints: _numWatchpoints %d\\n\", _numWatchpoints);\n  \/\/ Get the initial value of different watchpoints.\n  for(int i = 0; i < _numWatchpoints; i++) {\n    \/\/ PRINT(\"Watchpoint %d: addr %p. _numWatchpoints %d\\n\", i, _wp[i].faultyaddr, _numWatchpoints);\n    wpinfo.wp[i] = (unsigned long)_wp[i].faultyaddr;\n    \/\/ PRINT(\"Watchpoint %d: addr %p\\n\", i, _wp[i].faultyaddr);\n    \/\/ Update the values of those faulty address so that\n    \/\/ we can compare those values to find out which watchpoint\n    \/\/ are accessed since we don't want to check the debug status register\n    _wp[i].currentvalue = *((unsigned long*)_wp[i].faultyaddr);\n\n    \/\/ install this watch point.\n    perffd = install_watchpoint((uintptr_t)_wp[i].faultyaddr, SIGTRAP, -1);\n    \/\/ PRINT(\"Watchpoint %d: addr %p done\\n\", i, _wp[i].faultyaddr);\n  }\n\n  \/\/ Now we can start those watchpoints.\n  enable_watchpoints(perffd);\n  \/\/ We actually don't care about what content.\n}\n\nint watchpoint::install_watchpoint(uintptr_t address, int sig, int group) {\n  \/\/ Perf event settings\n  struct perf_event_attr pe = {.type = PERF_TYPE_BREAKPOINT,\n                               .size = sizeof(struct perf_event_attr),\n                               .bp_type = HW_BREAKPOINT_W,\n                               .bp_len = HW_BREAKPOINT_LEN_4,\n                               .bp_addr = (uintptr_t)address,\n                               .disabled = 1,\n                               .sample_period = 1, };\n\n  \/\/ Create the perf_event for this thread on all CPUs with no event group\n  int perf_fd = perf_event_open(&pe, 0, -1, group, 0);\n  if(perf_fd == -1) {\n    PRINT(\"Failed to open perf event file: %s\\n\", strerror(errno));\n    abort();\n  }\n\n  \/\/ PRINT(\"Install watchpoint. perf_fd %d group %d\\n\", perf_fd, group);\n\n  \/\/ Set the perf_event file to async mode\n  if(Real::fcntl(perf_fd, F_SETFL, Real::fcntl(perf_fd, F_GETFL, 0) | O_ASYNC) == -1) {\n    PRINT(\"Failed to set perf event file to ASYNC mode: %s\\n\", strerror(errno));\n    abort();\n  }\n\n  \/\/ Tell the file to send a SIGUSR1 when an event occurs\n  if(Real::fcntl(perf_fd, F_SETSIG, sig) == -1) {\n    PRINT(\"Failed to set perf event file's async signal: %s\\n\", strerror(errno));\n    abort();\n  }\n\n  \/\/ Deliver the signal to this thread\n  \/\/   if(Real::fcntl(perf_fd, F_SETOWN, syscall(__NR_gettid)) == -1) {\n  if(Real::fcntl(perf_fd, F_SETOWN, getpid()) == -1) {\n    fprintf(stderr, \"Failed to set the owner of the perf event file: %s\\n\", strerror(errno));\n    abort();\n  }\n\n  return perf_fd;\n}\n\nvoid watchpoint::enable_watchpoints(int fd) {\n  \/\/ Start the event\n  if(ioctl(fd, PERF_EVENT_IOC_ENABLE, 0) == -1) {\n    fprintf(stderr, \"Failed to enable perf event: %s\\n\", strerror(errno));\n    abort();\n  }\n}\n\nvoid watchpoint::disable_watchpoint(int fd) {\n  \/\/ Start the event\n  if(ioctl(fd, PERF_EVENT_IOC_DISABLE, 0) == -1) {\n    fprintf(stderr, \"Failed to disable perf event: %s\\n\", strerror(errno));\n    abort();\n  }\n}\n\nbool watchpoint::checkAndSaveCallsite(faultyObject* object, int depth, void** callsite) {\n  return object->faultySite.saveAndCheck(depth, callsite);\n}\n\n\/\/ Handle those traps on watchpoints now.\nvoid watchpoint::trapHandler(int \/* sig *\/, siginfo_t* \/* siginfo *\/, void* context) {\n  ucontext_t* trapcontext = (ucontext_t*)context;\n  size_t* addr = (size_t*)trapcontext->uc_mcontext.gregs[REG_RIP]; \/\/ address of access\n\n  \/\/ Find faulty object.\n  faultyObject* object;\n\n \/\/ PRINT(\"inside the trap handler, address %p with value %lx\\n\", addr, *((unsigned long *)addr));\n  \/\/ If it is a read, we only care about this if it is use-after-free error\n  if(!watchpoint::getInstance().findFaultyObject(&object)) {\n    PRERR(\"Can't find faulty object!!!!\\n\");\n    return;\n  }\n\n  \/\/ Check whether this trap is caused by libdoubletake library.\n  \/\/ If yes, then we don't care it since libdoubletake can fill the canaries.\n  if(selfmap::getInstance().isDoubleTakeLibrary(addr)) {\n    return;\n  }\n\n  \/\/  PRINF(\"CAPTURING write at %p: ip %lx. signal pointer %p, code %d. \\n\", addr,\n  \/\/ trapcontext->uc_mcontext.gregs[REG_RIP], siginfo->si_ptr, siginfo->si_code);\n  faultyObjectType faultType;\n\tif(object->objtype != OBJECT_TYPE_WATCHONLY) {\n  \tfaultType = memtrack::getInstance().getFaultType(object->objectstart, object->faultyaddr);\n  \tif(faultType == OBJECT_TYPE_NO_ERROR) {\n    \treturn;\n  \t}\n\t}\n\telse {\n    PRINT(\"\\nWatch a memory access on %p (value %lx) with call stack:\\n\", object->faultyaddr, *((unsigned long *)object->faultyaddr));\n  \tselfmap::getInstance().printCallStack();\n\t\treturn;\n\t}\n\n  \/\/ Check whether this callsite is the same as the previous callsite.\n  void* callsites[xdefines::CALLSITE_MAXIMUM_LENGTH];\n  int depth = selfmap::getCallStack((void**)&callsites);\n\n  \/\/ If current callsite is the same as the previous one, we do not want to report again.\n  if(watchpoint::getInstance().checkAndSaveCallsite(object, depth, (void**)&callsites)) {\n    return;\n  }\n\n  \/\/ Now we should check whether objectstart is existing or not.\n  if(faultType == OBJECT_TYPE_OVERFLOW) {\n    PRINT(\"\\nCaught a heap overflow at %p. Current call stack:\\n\", object->faultyaddr);\n  } else if(faultType == OBJECT_TYPE_USEAFTERFREE) {\n    PRINT(\"\\nCaught a use-after-free error at %p. Current call stack:\\n\", object->faultyaddr);\n  }\n  selfmap::getInstance().printCallStack(depth, (void**)&callsites);\n\n  \/\/ Check its allocation or deallocation inf\n  if(object->objectstart != NULL) {\n    \/\/ Now we should check memtrack status.\n    memtrack::getInstance().print(object->objectstart, faultType);\n  }\n}\n<commit_msg>watchpoint: don't use GNU struct initializers<commit_after>\/*\n * @file   watchpoint.cpp\n * @brief  Including the implemenation of watch point handler.\n *         Since we have to call functions in other header files, then it is\n *         impossible to put this function into the header file.\n * @author Tongping Liu <http:\/\/www.cs.umass.edu\/~tonyliu>\n *\/\n\n#include \"watchpoint.hh\"\n\n#include <assert.h>\n#include <errno.h>\n#include <fcntl.h>\n#include <linux\/hw_breakpoint.h>\n#include <linux\/perf_event.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <sys\/ioctl.h>\n#include <syscall.h>\n#include <ucontext.h>\n#include <unistd.h>\n\n#include \"log.hh\"\n#include \"memtrack.hh\"\n#include \"real.hh\"\n#include \"selfmap.hh\"\n#include \"xdefines.hh\"\n\nlong perf_event_open(struct perf_event_attr* hw_event, pid_t pid, int cpu, int group_fd,\n                     unsigned long flags) {\n  return syscall(__NR_perf_event_open, hw_event, pid, cpu, group_fd, flags);\n}\n#if 0\npid_t gettid() {\n  return syscall(__NR_gettid);\n}\n#endif\n\nbool watchpoint::addWatchpoint(void* addr, size_t value, faultyObjectType objtype,\n                               void* objectstart, size_t objectsize) {\n  bool hasWatchpoint = true;\n\n#ifndef EVALUATING_PERF\n  if(objtype == OBJECT_TYPE_OVERFLOW) {\n    PRINT(\"DoubleTake: Buffer overflow detected at address %p: value=0x%lx, size=%lx, start=%p\\n\",\n\t  addr, value, objectsize, objectstart);\n    \/\/ PRINT(\"DoubleTake: Buffer overflow at address %p with value 0x%lx. \\n\", addr, value);\n  } \n\telse if(objtype == OBJECT_TYPE_USEAFTERFREE) {\n   \/\/ assert(objtype == OBJECT_TYPE_USEAFTERFREE);\n    PRINT(\"DoubleTake: Use-after-free error detected at address %p.\", addr);\n  }\n#endif\n\n  if(_numWatchpoints < xdefines::MAX_WATCHPOINTS) {\n    \/\/ Record watch point information\n    _wp[_numWatchpoints].faultyaddr = addr;\n    _wp[_numWatchpoints].objectstart = objectstart;\n    _wp[_numWatchpoints].objtype = objtype;\n    \/\/  _wp[_numWatchpoints].objectsize = objectsize;\n    _wp[_numWatchpoints].faultyvalue = value;\n    _wp[_numWatchpoints].currentvalue = value;\n    _numWatchpoints++;\n  } else {\n    hasWatchpoint = false;\n  }\n\n  \/\/ Add it to memtrack too.\n\tif(objtype != OBJECT_TYPE_WATCHONLY)\n  \tmemtrack::getInstance().insert(objectstart, objectsize, objtype);\n\n  return !hasWatchpoint;\n}\n\nbool watchpoint::findFaultyObject(faultyObject** object) {\n  int trigPoints = 0;\n\n  PRINF(\"findFaultyObject: _numWatchpoints %d\\n\", _numWatchpoints);\n  for(int i = 0; i < _numWatchpoints; i++) {\n    unsigned long value = *((unsigned long*)_wp[i].faultyaddr);\n#ifndef EVALUATING_PERF\n    PRINT(\"DoubleTake: checking %d point: address %p currentvalue %lx value %lx\\n\", i, _wp[i].faultyaddr, _wp[i].currentvalue, value);\n#endif\n    \/\/ Check whether now overflow actually happens\n    if(value != _wp[i].currentvalue || _numWatchpoints == 1) {\n      \/\/\t\t\t\tPRINT(\"WARNING: we %d points, currentvalue %lx value %lx\\n\", trigPoints,\n      \/\/_wp[i].currentvalue, value);\n      _wp[i].currentvalue = value;\n      *object = &_wp[i];\n      trigPoints++;\n      continue;\n    }\n  }\n\n  if(trigPoints > 1) {\n    PRINT(\"WARNING: we have %d watchpoints triggered, only one watchpoint allowed.\\n\", trigPoints);\n  }\n\n  return (trigPoints != 0);\n}\n\nbool watchpoint::hasToRollback() { return _numWatchpoints > 0; }\n\nvoid watchpoint::installWatchpoints() {\n  struct sigaction trap_action;\n\n  \/\/  PRINT(\"installWatchpoints %d watchpoints %d!!!!!!!!!\\n\", __LINE__, _numWatchpoints);\n  \/\/ We don't need to setup watchpoints if it is 0.\n  if(_numWatchpoints == 0) {\n    return;\n  }\n\n  \/\/ Now we are setting a trap handler for myself.\n  trap_action.sa_sigaction = watchpoint::trapHandler;\n  trap_action.sa_flags = SA_SIGINFO | SA_RESTART | SA_NODEFER;\n  Real::sigaction(SIGTRAP, &trap_action, NULL);\n\n  \/\/ Setup the watchpoints information and notify the daemon (my parent)\n  struct watchpointsInfo wpinfo;\n  wpinfo.count = _numWatchpoints;\n  int perffd;\n\n  \/\/  PRINT(\"Install watchpoints: _numWatchpoints %d\\n\", _numWatchpoints);\n  \/\/ Get the initial value of different watchpoints.\n  for(int i = 0; i < _numWatchpoints; i++) {\n    \/\/ PRINT(\"Watchpoint %d: addr %p. _numWatchpoints %d\\n\", i, _wp[i].faultyaddr, _numWatchpoints);\n    wpinfo.wp[i] = (unsigned long)_wp[i].faultyaddr;\n    \/\/ PRINT(\"Watchpoint %d: addr %p\\n\", i, _wp[i].faultyaddr);\n    \/\/ Update the values of those faulty address so that\n    \/\/ we can compare those values to find out which watchpoint\n    \/\/ are accessed since we don't want to check the debug status register\n    _wp[i].currentvalue = *((unsigned long*)_wp[i].faultyaddr);\n\n    \/\/ install this watch point.\n    perffd = install_watchpoint((uintptr_t)_wp[i].faultyaddr, SIGTRAP, -1);\n    \/\/ PRINT(\"Watchpoint %d: addr %p done\\n\", i, _wp[i].faultyaddr);\n  }\n\n  \/\/ Now we can start those watchpoints.\n  enable_watchpoints(perffd);\n  \/\/ We actually don't care about what content.\n}\n\nint watchpoint::install_watchpoint(uintptr_t address, int sig, int group) {\n  \/\/ Perf event settings\n  struct perf_event_attr pe;\n\n  memset(&pe, 0, sizeof(pe));\n  pe.type = PERF_TYPE_BREAKPOINT;\n  pe.size = sizeof(pe);\n  pe.bp_type = HW_BREAKPOINT_W;\n  pe.bp_len = HW_BREAKPOINT_LEN_4;\n  pe.bp_addr = (uintptr_t)address;\n  pe.disabled = 1;\n  pe.sample_period = 1;\n\n  \/\/ Create the perf_event for this thread on all CPUs with no event group\n  int perf_fd = perf_event_open(&pe, 0, -1, group, 0);\n  if(perf_fd == -1) {\n    PRINT(\"Failed to open perf event file: %s\\n\", strerror(errno));\n    abort();\n  }\n\n  \/\/ PRINT(\"Install watchpoint. perf_fd %d group %d\\n\", perf_fd, group);\n\n  \/\/ Set the perf_event file to async mode\n  if(Real::fcntl(perf_fd, F_SETFL, Real::fcntl(perf_fd, F_GETFL, 0) | O_ASYNC) == -1) {\n    PRINT(\"Failed to set perf event file to ASYNC mode: %s\\n\", strerror(errno));\n    abort();\n  }\n\n  \/\/ Tell the file to send a SIGUSR1 when an event occurs\n  if(Real::fcntl(perf_fd, F_SETSIG, sig) == -1) {\n    PRINT(\"Failed to set perf event file's async signal: %s\\n\", strerror(errno));\n    abort();\n  }\n\n  \/\/ Deliver the signal to this thread\n  \/\/   if(Real::fcntl(perf_fd, F_SETOWN, syscall(__NR_gettid)) == -1) {\n  if(Real::fcntl(perf_fd, F_SETOWN, getpid()) == -1) {\n    fprintf(stderr, \"Failed to set the owner of the perf event file: %s\\n\", strerror(errno));\n    abort();\n  }\n\n  return perf_fd;\n}\n\nvoid watchpoint::enable_watchpoints(int fd) {\n  \/\/ Start the event\n  if(ioctl(fd, PERF_EVENT_IOC_ENABLE, 0) == -1) {\n    fprintf(stderr, \"Failed to enable perf event: %s\\n\", strerror(errno));\n    abort();\n  }\n}\n\nvoid watchpoint::disable_watchpoint(int fd) {\n  \/\/ Start the event\n  if(ioctl(fd, PERF_EVENT_IOC_DISABLE, 0) == -1) {\n    fprintf(stderr, \"Failed to disable perf event: %s\\n\", strerror(errno));\n    abort();\n  }\n}\n\nbool watchpoint::checkAndSaveCallsite(faultyObject* object, int depth, void** callsite) {\n  return object->faultySite.saveAndCheck(depth, callsite);\n}\n\n\/\/ Handle those traps on watchpoints now.\nvoid watchpoint::trapHandler(int \/* sig *\/, siginfo_t* \/* siginfo *\/, void* context) {\n  ucontext_t* trapcontext = (ucontext_t*)context;\n  size_t* addr = (size_t*)trapcontext->uc_mcontext.gregs[REG_RIP]; \/\/ address of access\n\n  \/\/ Find faulty object.\n  faultyObject* object;\n\n \/\/ PRINT(\"inside the trap handler, address %p with value %lx\\n\", addr, *((unsigned long *)addr));\n  \/\/ If it is a read, we only care about this if it is use-after-free error\n  if(!watchpoint::getInstance().findFaultyObject(&object)) {\n    PRERR(\"Can't find faulty object!!!!\\n\");\n    return;\n  }\n\n  \/\/ Check whether this trap is caused by libdoubletake library.\n  \/\/ If yes, then we don't care it since libdoubletake can fill the canaries.\n  if(selfmap::getInstance().isDoubleTakeLibrary(addr)) {\n    return;\n  }\n\n  \/\/  PRINF(\"CAPTURING write at %p: ip %lx. signal pointer %p, code %d. \\n\", addr,\n  \/\/ trapcontext->uc_mcontext.gregs[REG_RIP], siginfo->si_ptr, siginfo->si_code);\n  faultyObjectType faultType;\n\tif(object->objtype != OBJECT_TYPE_WATCHONLY) {\n  \tfaultType = memtrack::getInstance().getFaultType(object->objectstart, object->faultyaddr);\n  \tif(faultType == OBJECT_TYPE_NO_ERROR) {\n    \treturn;\n  \t}\n\t}\n\telse {\n    PRINT(\"\\nWatch a memory access on %p (value %lx) with call stack:\\n\", object->faultyaddr, *((unsigned long *)object->faultyaddr));\n  \tselfmap::getInstance().printCallStack();\n\t\treturn;\n\t}\n\n  \/\/ Check whether this callsite is the same as the previous callsite.\n  void* callsites[xdefines::CALLSITE_MAXIMUM_LENGTH];\n  int depth = selfmap::getCallStack((void**)&callsites);\n\n  \/\/ If current callsite is the same as the previous one, we do not want to report again.\n  if(watchpoint::getInstance().checkAndSaveCallsite(object, depth, (void**)&callsites)) {\n    return;\n  }\n\n  \/\/ Now we should check whether objectstart is existing or not.\n  if(faultType == OBJECT_TYPE_OVERFLOW) {\n    PRINT(\"\\nCaught a heap overflow at %p. Current call stack:\\n\", object->faultyaddr);\n  } else if(faultType == OBJECT_TYPE_USEAFTERFREE) {\n    PRINT(\"\\nCaught a use-after-free error at %p. Current call stack:\\n\", object->faultyaddr);\n  }\n  selfmap::getInstance().printCallStack(depth, (void**)&callsites);\n\n  \/\/ Check its allocation or deallocation inf\n  if(object->objectstart != NULL) {\n    \/\/ Now we should check memtrack status.\n    memtrack::getInstance().print(object->objectstart, faultType);\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <cc1101.hpp>\n\ntemplate <typename cc1101>\nclass Radio : public cc1101 {\npublic:\n\tstatic void calibrate();\n\tstatic void setup_basic();\n\tstatic void setup_common();\n\tstatic void setup_for_rx();\n\tstatic void setup_for_tx();\n\n\tstatic void sidle();\n};\n\ntemplate <typename cc1101>\ninline void Radio<cc1101>::calibrate()\n{\n\t\/\/ calibrate\n\tcc1101::wcmd(CC1101::SCAL);\n\twhile ((cc1101::status(CC1101::MARCSTATE) & 0x1f) != 1)\n\t\t;\n}\n\ntemplate <typename cc1101>\ninline void Radio<cc1101>::setup_basic()\n{\n\t\/\/ reset\n\tcc1101::select();\n\tcc1101::wcmd(CC1101::SRES);\n\tcc1101::release();\n\n\tcc1101::select();\n\n\t\/\/ frequency configuration\n\tcc1101::set(CC1101::FREQ2, 0x10);\n\tcc1101::set(CC1101::FREQ1, 0xa7);\n\tcc1101::set(CC1101::FREQ0, 0xe1);\n\n\t\/\/ modem configuration\n\tcc1101::set(CC1101::MDMCFG4, 0xaa);\n\tcc1101::set(CC1101::MDMCFG3, 0xbc);\n\tcc1101::set(CC1101::MDMCFG2, 0x71);\n\tcc1101::set(CC1101::DEVIATN, 0x40);\n\n\t\/\/ PATABLE\n\tcc1101::set(CC1101::PATABLE, 0xc0);\n\n\t\/\/ enable WOR timer\n\tcc1101::set(CC1101::WORCTRL, 0x7a);\n\n\tcalibrate();\n\n\tcc1101::release();\n}\n\ntemplate <typename cc1101>\ninline void Radio<cc1101>::setup_common()\n{\n\t\/\/ disable GDO[0,2] pins\n\tcc1101::set(CC1101::IOCFG2, 0x2f);\n\tcc1101::set(CC1101::IOCFG0, 0x2f);\n\n\t\/\/ fix packet length\n\tcc1101::set(CC1101::PKTLEN, 16);\n\n\t\/\/ packet automation\n\tcc1101::set(CC1101::PKTCTRL0, 0x44);\n}\n\ntemplate <typename cc1101>\ninline void Radio<cc1101>::setup_for_rx()\n{\n\tsetup_common();\n\n\t\/\/ packet automation\n\tcc1101::set(CC1101::PKTCTRL1, 0x2c);\n\n\t\/\/ main radio control state machine configuration\n\tcc1101::set(CC1101::MCSM1, 0x3c);\n\tcc1101::set(CC1101::MCSM0, 0x34);\n\n\tcalibrate();\n}\n\ntemplate <typename cc1101>\ninline void Radio<cc1101>::setup_for_tx()\n{\n\tsetup_common();\n\n\t\/\/ main radio control state machine configuration\n\tcc1101::set(CC1101::MCSM1, 0x30);\n\tcc1101::set(CC1101::MCSM0, 0x38);\n\n\tcalibrate();\n}\n\ntemplate <typename cc1101>\ninline void Radio<cc1101>::sidle()\n{\n\tcc1101::wcmd(CC1101::SIDLE);\n\twhile ((cc1101::status(CC1101::MARCSTATE) & 0x1f) != 1)\n\t\t;\n}\n<commit_msg>radio: disabled pins set to high impedance<commit_after>#pragma once\n\n#include <cc1101.hpp>\n\ntemplate <typename cc1101>\nclass Radio : public cc1101 {\npublic:\n\tstatic void calibrate();\n\tstatic void setup_basic();\n\tstatic void setup_common();\n\tstatic void setup_for_rx();\n\tstatic void setup_for_tx();\n\n\tstatic void sidle();\n};\n\ntemplate <typename cc1101>\ninline void Radio<cc1101>::calibrate()\n{\n\t\/\/ calibrate\n\tcc1101::wcmd(CC1101::SCAL);\n\twhile ((cc1101::status(CC1101::MARCSTATE) & 0x1f) != 1)\n\t\t;\n}\n\ntemplate <typename cc1101>\ninline void Radio<cc1101>::setup_basic()\n{\n\t\/\/ reset\n\tcc1101::select();\n\tcc1101::wcmd(CC1101::SRES);\n\tcc1101::release();\n\n\tcc1101::select();\n\n\t\/\/ frequency configuration\n\tcc1101::set(CC1101::FREQ2, 0x10);\n\tcc1101::set(CC1101::FREQ1, 0xa7);\n\tcc1101::set(CC1101::FREQ0, 0xe1);\n\n\t\/\/ modem configuration\n\tcc1101::set(CC1101::MDMCFG4, 0xaa);\n\tcc1101::set(CC1101::MDMCFG3, 0xbc);\n\tcc1101::set(CC1101::MDMCFG2, 0x71);\n\tcc1101::set(CC1101::DEVIATN, 0x40);\n\n\t\/\/ PATABLE\n\tcc1101::set(CC1101::PATABLE, 0xc0);\n\n\t\/\/ enable WOR timer\n\tcc1101::set(CC1101::WORCTRL, 0x7a);\n\n\tcalibrate();\n\n\tcc1101::release();\n}\n\ntemplate <typename cc1101>\ninline void Radio<cc1101>::setup_common()\n{\n\t\/\/ disable GDO[0,2] pins\n\tcc1101::set(CC1101::IOCFG2, 0x2e);\n\tcc1101::set(CC1101::IOCFG0, 0x2e);\n\n\t\/\/ fix packet length\n\tcc1101::set(CC1101::PKTLEN, 16);\n\n\t\/\/ packet automation\n\tcc1101::set(CC1101::PKTCTRL0, 0x44);\n}\n\ntemplate <typename cc1101>\ninline void Radio<cc1101>::setup_for_rx()\n{\n\tsetup_common();\n\n\t\/\/ packet automation\n\tcc1101::set(CC1101::PKTCTRL1, 0x2c);\n\n\t\/\/ main radio control state machine configuration\n\tcc1101::set(CC1101::MCSM1, 0x3c);\n\tcc1101::set(CC1101::MCSM0, 0x34);\n\n\tcalibrate();\n}\n\ntemplate <typename cc1101>\ninline void Radio<cc1101>::setup_for_tx()\n{\n\tsetup_common();\n\n\t\/\/ main radio control state machine configuration\n\tcc1101::set(CC1101::MCSM1, 0x30);\n\tcc1101::set(CC1101::MCSM0, 0x38);\n\n\tcalibrate();\n}\n\ntemplate <typename cc1101>\ninline void Radio<cc1101>::sidle()\n{\n\tcc1101::wcmd(CC1101::SIDLE);\n\twhile ((cc1101::status(CC1101::MARCSTATE) & 0x1f) != 1)\n\t\t;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <atlbase.h>\n\n#include \"base\/at_exit.h\"\n#include \"base\/platform_thread.h\"\n#include \"base\/process_util.h\"\n#include \"base\/test_suite.h\"\n#include \"base\/command_line.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n\n#include \"chrome_frame\/test_utils.h\"\n\n\/\/ To enable ATL-based code to run in this module\nclass ChromeFrameUnittestsModule\n    : public CAtlExeModuleT<ChromeFrameUnittestsModule> {\n};\n\nChromeFrameUnittestsModule _AtlModule;\n\nconst wchar_t kNoRegistrationSwitch[] = L\"no-registration\";\n\nint main(int argc, char **argv) {\n  base::EnableTerminationOnHeapCorruption();\n  PlatformThread::SetName(\"ChromeFrame tests\");\n\n  TestSuite test_suite(argc, argv);\n\n  \/\/ If mini_installer is used to register CF, we use the switch\n  \/\/ --no-registration to avoid repetitive registration.\n  if (CommandLine::ForCurrentProcess()->HasSwitch(kNoRegistrationSwitch)) {\n    return test_suite.Run();\n  } else {\n    \/\/ Register paths needed by the ScopedChromeFrameRegistrar.\n    chrome::RegisterPathProvider();\n\n    \/\/ This will register the chrome frame in the build directory. It currently\n    \/\/ leaves that chrome frame registered once the tests are done. It must be\n    \/\/ constructed AFTER the TestSuite is created since TestSuites create THE\n    \/\/ AtExitManager.\n    \/\/ TODO(robertshield): Make these tests restore the original registration\n    \/\/ once done.\n    ScopedChromeFrameRegistrar registrar;\n    \n    return test_suite.Run();\n  }\n}\n<commit_msg>More build a-fixin for GCF related to base\/test move.<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 <atlbase.h>\n\n#include \"base\/at_exit.h\"\n#include \"base\/platform_thread.h\"\n#include \"base\/process_util.h\"\n#include \"base\/test\/test_suite.h\"\n#include \"base\/command_line.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n\n#include \"chrome_frame\/test_utils.h\"\n\n\/\/ To enable ATL-based code to run in this module\nclass ChromeFrameUnittestsModule\n    : public CAtlExeModuleT<ChromeFrameUnittestsModule> {\n};\n\nChromeFrameUnittestsModule _AtlModule;\n\nconst wchar_t kNoRegistrationSwitch[] = L\"no-registration\";\n\nint main(int argc, char **argv) {\n  base::EnableTerminationOnHeapCorruption();\n  PlatformThread::SetName(\"ChromeFrame tests\");\n\n  TestSuite test_suite(argc, argv);\n\n  \/\/ If mini_installer is used to register CF, we use the switch\n  \/\/ --no-registration to avoid repetitive registration.\n  if (CommandLine::ForCurrentProcess()->HasSwitch(kNoRegistrationSwitch)) {\n    return test_suite.Run();\n  } else {\n    \/\/ Register paths needed by the ScopedChromeFrameRegistrar.\n    chrome::RegisterPathProvider();\n\n    \/\/ This will register the chrome frame in the build directory. It currently\n    \/\/ leaves that chrome frame registered once the tests are done. It must be\n    \/\/ constructed AFTER the TestSuite is created since TestSuites create THE\n    \/\/ AtExitManager.\n    \/\/ TODO(robertshield): Make these tests restore the original registration\n    \/\/ once done.\n    ScopedChromeFrameRegistrar registrar;\n\n    return test_suite.Run();\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Added peak ram to mainmenubar<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit (ITK)\n  Module:    itkNeighborhoodOperatorTest.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 <iostream>\n#include \"itkImage.h\"\n#include \"itkScalar.h\"\n#include \"itkRandomImageSource.h\"\n#include \"itkFilterImageSingleOperator.h\"\n#include \"itkWriteVTKImage.h\"\n\nint main()\n{\n  \/\/ Create a source\n  itk::RandomImageSource< itk::Image<float,2> >::Pointer random;\n  random = itk::RandomImageSource< itk::Image<float,2> >::New();\n\n  \/\/ Create a neighborhood\n  itk::Neighborhood< float, 2> neighborhood;\n  neighborhood.SetRadius(1);\n\n  \/\/ Create a filter\n  itk::FilterImageSingleOperator< float, 2>::Pointer filter;\n  filter = itk::FilterImageSingleOperator< float, 2>::New();\n  filter->SetInput( random->GetOutput() );\n  filter->SetOperator( neighborhood );\n  \n  \/\/ Create a mapper\n  itk::WriteVTKImage< itk::Image<float,2> >::Pointer writer;\n  writer = itk::WriteVTKImage< itk::Image<float,2> >::New();\n  writer->SetInput(filter->GetOutput());\n  writer->SetFileName(\"junkImage.vtk\");\n  writer->SetFileTypeToASCII();\n  writer->Write();\n\n  return 1;\n}\n\n\n\n<commit_msg>ENH: Changed test for better coverage of subject. BUG: Fixed return value from 1 to 0<commit_after>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit (ITK)\n  Module:    itkNeighborhoodOperatorTest.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 \"itkDerivativeOperator.h\"\n#include \"itkDerivativeHalfForwardOperator.h\"\n#include \"itkDerivativeHalfBackwardOperator.h\"\n#include \"itkGaussianOperator.h\"\n#include \"itkSize.h\"\n\nint main()\n{\n  itk::DerivativeOperator<float, 3> d;\n  d.SetOrder(3);\n  d.SetDirection(1);\n  d.CreateDirectional();\n\n  itk::GaussianOperator<2> g;\n  g.SetVariance(2.3);\n  g.SetMaximumError(.01);\n  g.CreateDirectional();\n\n  itk::DerivativeHalfForwardOperator<float, 4> f;\n  itk::Size<4> sz;\n  sz[0] = sz[1] = sz[2] = sz[3] = 2;\n  f.SetDirection(2);\n  f.CreateToRadius(sz);\n\n  itk::DerivativeHalfBackwardOperator<float, 2> b;\n  b.SetDirection(0);\n  b.CreateDirectional();\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>BMC#20414 - google.com will scroll and back to original position when launch browser, with session restore enabled.<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>improved error message<commit_after><|endoftext|>"}
{"text":"<commit_before>\n\/**\n * @file   particleSystem.cpp\n *\n * @author y.akira\n * @date   2017.01.24\n *\/\n\n#include \"precompiled.h\"\n\n\n\/\/ =================================================\n\/\/ パーティクルシステム\nParticleSystem::ParticleSystem()\n : play_           ( false )\n , deltaTime_      ( 0 )\n , destroyTime_    ( 0 )\n , createDelta_    ( 0 )\n , createInterval_ ( 1 )\n , partDestroyTime_( 3 )\n , startCol_       ( 1 )\n , endCol_         ( 1 )\n , sizeRatio_      ( 1 )\n , gravity_        ( 0 )\n , useGravity_     ( false )\n{\n  name_ = \"ParticleSystem\";\n  tag_  = PARTICLE_SYSTEM;\n}\n\nParticleSystem::ParticleSystem(bool activate, float sizeRatio, float destroyTime, bool useGravity)\n : play_           ( activate    )\n , deltaTime_      ( 0 )\n , destroyTime_    ( destroyTime )\n , createDelta_    ( 0 )\n , createInterval_ ( 1 )\n , partDestroyTime_( 3 )\n , startCol_       ( 1 )\n , endCol_         ( 1 )\n , sizeRatio_      ( sizeRatio )\n , gravity_        ( 0.2f )\n , useGravity_     ( useGravity )\n{\n  name_ = \"ParticleSystem\";\n  tag_  = PARTICLE_SYSTEM;\n}\n\nParticleSystem::ParticleSystem(bool activate, ofColor startColor, ofColor endColor, float sizeRatio, float destroyTime, bool useGravity)\n  : play_           ( activate )\n  , deltaTime_      ( 0 )\n  , destroyTime_    ( destroyTime )\n  , createDelta_    ( 0 )\n  , createInterval_ ( 1 )\n  , partDestroyTime_( 3 )\n  , startCol_       ( startColor )\n  , endCol_         ( endColor )\n  , sizeRatio_      ( sizeRatio )\n  , gravity_        ( 0.2f )\n  , useGravity_     ( useGravity )\n{\n  name_ = \"ParticleSystem\";\n  tag_  = PARTICLE_SYSTEM;\n}\n\nvoid ParticleSystem::setup() {\n  enableUpdate();\n}\n\nvoid ParticleSystem::update(float deltaTime) {\n  \/\/ 実行中、時間を進める\n  if (play_) {\n    deltaTime_ += deltaTime;\n  }\n  \n  \/\/ 自滅する時間になったら\n  if (hasDestroyTime()) {\n    bool timeIsNow = deltaTime_ > destroyTime_;\n    if (timeIsNow) {\n      \/\/ 生成を止める\n      stop();\n      \n      \/\/ ぱーてくるが全部消えたら\n      if (!particles_.size()) {\n      \n        \/\/ ActorManagerから消える\n        destroy();\n      }\n    }\n  }\n  \n  updateParts(deltaTime);\n}\n\nvoid ParticleSystem::draw() {\n  for (auto& part : particles_) {\n    part->draw();\n  }\n}\n\nvoid ParticleSystem::gui() {\n  if (ImGui::BeginMenu(\"ParticleSystem\")) {\n    ImGui::Text(\"%s\", ofToString(particles_.size()).c_str());\n    if (ImGui::Checkbox(\"Play\", &play_)) {\n      play_? play() : stop();\n    }\n\n    if (ImGui::Checkbox(\"UseGravity\", &useGravity_)) {\n      useGravity_ ? useGravity_ = true : useGravity_ = false;\n    }\n\n    ImGui::InputFloat2(\"Posision\", pos_.getPtr());\n    ImGui::InputFloat2(\"Range\", size_.getPtr());\n    ImGui::InputFloat(\"SystemDestroyTime\", &destroyTime_);\n    ImGui::InputFloat(\"Interval\", &createInterval_);\n    ImGui::InputFloat(\"ParticleDestroyTime\", &partDestroyTime_);\n    ImGui::InputFloat2(\"SizeMin\", sizeMin_.getPtr());\n    ImGui::InputFloat2(\"SizeMax\", sizeMax_.getPtr());\n    ImGui::InputFloat2(\"VelMin\", velocityMin_.getPtr());\n    ImGui::InputFloat2(\"VelMax\", velocityMax_.getPtr());\n    ImGui::ColorEdit3(\"StartColor\", &startCol_.r);\n    ImGui::ColorEdit3(\"EndColor\", &endCol_.r);\n    ImGui::InputFloat(\"SizeRatio\", &sizeRatio_);\n    ImGui::InputFloat(\"Gravity\", &gravity_);\n    ImGui::EndMenu();\n  }\n}\n\n\nvoid ParticleSystem::updateParts(float delta) {\n  createDelta_ += delta;\n\n  \/\/ 各パーティクル更新\n  for (auto& part : particles_) {\n    part->update(delta);\n  }\n  \n  \/\/ パーティクルの追加処理\n  bool shouldCreate = createDelta_ > createInterval_;\n  if ( play_ && shouldCreate ) {\n    createDelta_ -= createInterval_;\n    create();\n  }\n  \n  \/\/ 削除対象を消す\n  particles_.remove_if(\n    [] (const pParticle_t& part)->bool {\n      return part->shouldDestroy();\n    }\n  );\n}\n\nvoid ParticleSystem::create() {\n  float x = 0, y = 0, z = 0;\n  \n  x = ofRandom(pos_.x, pos_.x + size_.x);\n  y = ofRandom(pos_.y, pos_.y + size_.y);\n  ofVec3f pos(x, y, z);\n  \n  x = ofRandom(velocityMin_.x, velocityMax_.x);\n  y = ofRandom(velocityMin_.y, velocityMax_.y);\n  ofVec3f velocity(x, y, z);\n  \n  x = ofRandom(sizeMin_.x, sizeMax_.x);\n  y = ofRandom(sizeMin_.y, sizeMax_.y);\n  ofVec3f size(x, y, z);\n\n  pParticle_t part = make_unique<Particle>();\n  part->setPos(move(pos));\n  part->setVel(move(velocity));\n  part->setSize(move(size));\n  part->setDestroyTime(partDestroyTime_);\n  part->setAnimColor(startCol_, endCol_);\n  part->setSizeRatio(sizeRatio_);\n  part->setGravity(gravity_);\n  part->useGravity(useGravity_);\n\n  particles_.emplace_back(move(part));\n}\n\nvoid ParticleSystem::play() {\n  play_        = true;\n  deltaTime_   = 0;\n  createDelta_ = 0;\n}\n\nvoid ParticleSystem::stop() {\n  play_ = false;\n}\n\nvoid ParticleSystem::killAll() {\n  play_ = false;\n  \n  \/\/ 全削除\n  for (auto& p : particles_) {\n    p->destroy();\n  }\n}\n\nbool ParticleSystem::hasDestroyTime()    const { return bool(destroyTime_); }\n\nfloat ParticleSystem::getInterval()      const { return createInterval_; }\nofVec2f ParticleSystem::getSizeMin()     const { return sizeMin_; }\nofVec2f ParticleSystem::getSizeMax()     const { return sizeMax_; }\nofVec2f ParticleSystem::getVelocityMin() const { return velocityMin_; }\nofVec2f ParticleSystem::getVelocityMax() const { return velocityMax_; }\n\nvoid ParticleSystem::setInterval(float interval)    { createInterval_ = interval; }\nvoid ParticleSystem::setSysDestroyTime(float time)  { destroyTime_ = time; }\nvoid ParticleSystem::setPartDestroyTime(float time) { partDestroyTime_ = time; }\n\nvoid ParticleSystem::setCreateSize(ofVec2f min, ofVec2f max) {\n  sizeMin_ = min;\n  sizeMax_ = max;\n}\n\nvoid ParticleSystem::setCreateVelocity(ofVec2f min, ofVec2f max) {\n  velocityMin_ = min;\n  velocityMax_ = max;\n}\n\nvoid ParticleSystem::setAnimColor(ofFloatColor start, ofFloatColor end) {\n  startCol_ = start;\n  endCol_   = end;\n}\n\n\/\/ =================================================\n\/\/ パーティクル\nParticle::Particle()\n : deltaTime_  ( 0     )\n , destroyTime_( 60    )\n , sizeRatio_  ( 1.0f  )\n , gravity_    ( 0.2f  )\n , useGravity_ ( false )\n{\n  name_ = \"Particle\";\n  tag_  = PARTICLE;\n}\n\n\nvoid Particle::setup() {}\n\nvoid Particle::update(float deltaTime) {\n  deltaTime_ += deltaTime;\n\n  updatePos(deltaTime);   \/\/ 位置\n  updateSize(deltaTime);  \/\/ サイズ\n  updateColor(deltaTime); \/\/ 色\n\n  \/\/ 自滅時間になったら死ぬ\n  if (deltaTime_ > destroyTime_ ||\n      size_.x <= 0 || size_.y <= 0) {\n    destroy();\n  }\n}\n\nvoid Particle::draw() {\n  ofSetColor(color_);\n  ofDrawCircle(pos_, size_.x);\n}\n\nvoid Particle::updatePos(float delta) {\n  \/\/ 重力を掛ける処理\n  if (useGravity_) { vel_.y -= gravity_; }\n  \n  \/\/ 設定された加速度で移動する\n  pos_ += vel_;\n}\n\nvoid Particle::updateSize(float delta) {\n  animSizeX_.update(delta);\n  animSizeY_.update(delta);\n  size_ = ofVec2f(animSizeX_, animSizeY_);\n}\n\nvoid Particle::updateColor(float delta) {\n  \/\/ 時間経過で色を変化させる(startとendの色が違えば)\n  r_.update(delta);\n  g_.update(delta);\n  b_.update(delta);\n  color_ = ofFloatColor(r_, g_, b_);\n}\n\nvoid Particle::setDestroyTime(float time) {\n  destroyTime_ = max(0.0f, time);\n}\n\nvoid Particle::setAnimColor(ofFloatColor start, ofFloatColor end) {\n  startCol_ = start;\n  endCol_   = end;\n\n  r_.setDuration(destroyTime_);\n  r_.setCurve(LINEAR);\n  r_.animateFromTo(startCol_.r, endCol_.r);\n\n  g_.setDuration(destroyTime_);\n  g_.setCurve(LINEAR);\n  g_.animateFromTo(startCol_.g, endCol_.g);\n\n  b_.setDuration(destroyTime_);\n  b_.setCurve(LINEAR);\n  b_.animateFromTo(startCol_.b, endCol_.b);\n}\n\nvoid Particle::setSizeRatio(float ratio) {\n  sizeRatio_ = ratio;\n\n  \/\/ 最終的な大きさを求めてanimateも設定\n  ofVec2f ls = size_ * sizeRatio_;\n  animSizeX_.setDuration(destroyTime_);\n  animSizeX_.setCurve(LINEAR);\n  animSizeX_.animateFromTo(size_.x, ls.x);\n\n  animSizeY_.setDuration(destroyTime_);\n  animSizeY_.setCurve(LINEAR);\n  animSizeY_.animateFromTo(size_.y, ls.y);\n}\n\nvoid Particle::setGravity(float gravity) {\n  gravity_ = gravity;\n}\n\nvoid Particle::useGravity(bool g) {\n  useGravity_ = g;\n}\n\n\n\/\/\/ ====================================================\n\/\/\/< @brief 追従ぱーてくる\n\/\/\/ ====================================================\nHomingParticle::HomingParticle(Actor* target)\n : target_  ( target )\n , curvePow_( 1.4    )\n{\n  name_  = \"HomingParticle\";\n  tag_   =  HOMING_PARTICLE;\n  delta_ = 0;\n}\n\nvoid HomingParticle::setup() {\n  enableUpdate();\n}\n\nvoid HomingParticle::update(float deltaTime) {\n  delta_ += deltaTime;\n  if (delta_ > 0.15f) { enableCollision(); }\n\n  if (target_) {\n  \n    \/\/ ターゲットへのベクトルを求める\n    ofVec2f targetPos = target_->getPos() + (target_->getSize() * 0.5);\n    ofVec2f forward = targetPos - pos_;\n    forward.normalize();\n    forward *= curvePow_;\n  \n    if (delta_ > 0.15f) {\n      \/\/ 加速度に加算\n      vel_ += forward;\n    }\n    \n    float limit = 8;\n    vel_.x = min(limit, vel_.x);\n    vel_.y = min(limit, vel_.y);\n    vel_.x = max(-limit, vel_.x);\n    vel_.y = max(-limit, vel_.y);\n    \n  } else {\n    destroy();\n  }\n  \n  updatePos(deltaTime);\n}\n\nvoid HomingParticle::draw() {\n  ofSetColor(color_);\n  ofDrawCircle(pos_, size_.x);\n}\n\nvoid HomingParticle::onCollision(Actor* p_actor) {\n  if (p_actor->getTag() == PLAYER) {\n    destroy();\n  }\n}\n\nvoid HomingParticle::updatePos(float delta) {\n  pos_ += vel_;\n}\n<commit_msg>ホーミング性能を少し落とした<commit_after>\n\/**\n * @file   particleSystem.cpp\n *\n * @author y.akira\n * @date   2017.01.24\n *\/\n\n#include \"precompiled.h\"\n\n\n\/\/ =================================================\n\/\/ パーティクルシステム\nParticleSystem::ParticleSystem()\n : play_           ( false )\n , deltaTime_      ( 0 )\n , destroyTime_    ( 0 )\n , createDelta_    ( 0 )\n , createInterval_ ( 1 )\n , partDestroyTime_( 3 )\n , startCol_       ( 1 )\n , endCol_         ( 1 )\n , sizeRatio_      ( 1 )\n , gravity_        ( 0 )\n , useGravity_     ( false )\n{\n  name_ = \"ParticleSystem\";\n  tag_  = PARTICLE_SYSTEM;\n}\n\nParticleSystem::ParticleSystem(bool activate, float sizeRatio, float destroyTime, bool useGravity)\n : play_           ( activate    )\n , deltaTime_      ( 0 )\n , destroyTime_    ( destroyTime )\n , createDelta_    ( 0 )\n , createInterval_ ( 1 )\n , partDestroyTime_( 3 )\n , startCol_       ( 1 )\n , endCol_         ( 1 )\n , sizeRatio_      ( sizeRatio )\n , gravity_        ( 0.2f )\n , useGravity_     ( useGravity )\n{\n  name_ = \"ParticleSystem\";\n  tag_  = PARTICLE_SYSTEM;\n}\n\nParticleSystem::ParticleSystem(bool activate, ofColor startColor, ofColor endColor, float sizeRatio, float destroyTime, bool useGravity)\n  : play_           ( activate )\n  , deltaTime_      ( 0 )\n  , destroyTime_    ( destroyTime )\n  , createDelta_    ( 0 )\n  , createInterval_ ( 1 )\n  , partDestroyTime_( 3 )\n  , startCol_       ( startColor )\n  , endCol_         ( endColor )\n  , sizeRatio_      ( sizeRatio )\n  , gravity_        ( 0.2f )\n  , useGravity_     ( useGravity )\n{\n  name_ = \"ParticleSystem\";\n  tag_  = PARTICLE_SYSTEM;\n}\n\nvoid ParticleSystem::setup() {\n  enableUpdate();\n}\n\nvoid ParticleSystem::update(float deltaTime) {\n  \/\/ 実行中、時間を進める\n  if (play_) {\n    deltaTime_ += deltaTime;\n  }\n  \n  \/\/ 自滅する時間になったら\n  if (hasDestroyTime()) {\n    bool timeIsNow = deltaTime_ > destroyTime_;\n    if (timeIsNow) {\n      \/\/ 生成を止める\n      stop();\n      \n      \/\/ ぱーてくるが全部消えたら\n      if (!particles_.size()) {\n      \n        \/\/ ActorManagerから消える\n        destroy();\n      }\n    }\n  }\n  \n  updateParts(deltaTime);\n}\n\nvoid ParticleSystem::draw() {\n  for (auto& part : particles_) {\n    part->draw();\n  }\n}\n\nvoid ParticleSystem::gui() {\n  if (ImGui::BeginMenu(\"ParticleSystem\")) {\n    ImGui::Text(\"%s\", ofToString(particles_.size()).c_str());\n    if (ImGui::Checkbox(\"Play\", &play_)) {\n      play_? play() : stop();\n    }\n\n    if (ImGui::Checkbox(\"UseGravity\", &useGravity_)) {\n      useGravity_ ? useGravity_ = true : useGravity_ = false;\n    }\n\n    ImGui::InputFloat2(\"Posision\", pos_.getPtr());\n    ImGui::InputFloat2(\"Range\", size_.getPtr());\n    ImGui::InputFloat(\"SystemDestroyTime\", &destroyTime_);\n    ImGui::InputFloat(\"Interval\", &createInterval_);\n    ImGui::InputFloat(\"ParticleDestroyTime\", &partDestroyTime_);\n    ImGui::InputFloat2(\"SizeMin\", sizeMin_.getPtr());\n    ImGui::InputFloat2(\"SizeMax\", sizeMax_.getPtr());\n    ImGui::InputFloat2(\"VelMin\", velocityMin_.getPtr());\n    ImGui::InputFloat2(\"VelMax\", velocityMax_.getPtr());\n    ImGui::ColorEdit3(\"StartColor\", &startCol_.r);\n    ImGui::ColorEdit3(\"EndColor\", &endCol_.r);\n    ImGui::InputFloat(\"SizeRatio\", &sizeRatio_);\n    ImGui::InputFloat(\"Gravity\", &gravity_);\n    ImGui::EndMenu();\n  }\n}\n\n\nvoid ParticleSystem::updateParts(float delta) {\n  createDelta_ += delta;\n\n  \/\/ 各パーティクル更新\n  for (auto& part : particles_) {\n    part->update(delta);\n  }\n  \n  \/\/ パーティクルの追加処理\n  bool shouldCreate = createDelta_ > createInterval_;\n  if ( play_ && shouldCreate ) {\n    createDelta_ -= createInterval_;\n    create();\n  }\n  \n  \/\/ 削除対象を消す\n  particles_.remove_if(\n    [] (const pParticle_t& part)->bool {\n      return part->shouldDestroy();\n    }\n  );\n}\n\nvoid ParticleSystem::create() {\n  float x = 0, y = 0, z = 0;\n  \n  x = ofRandom(pos_.x, pos_.x + size_.x);\n  y = ofRandom(pos_.y, pos_.y + size_.y);\n  ofVec3f pos(x, y, z);\n  \n  x = ofRandom(velocityMin_.x, velocityMax_.x);\n  y = ofRandom(velocityMin_.y, velocityMax_.y);\n  ofVec3f velocity(x, y, z);\n  \n  x = ofRandom(sizeMin_.x, sizeMax_.x);\n  y = ofRandom(sizeMin_.y, sizeMax_.y);\n  ofVec3f size(x, y, z);\n\n  pParticle_t part = make_unique<Particle>();\n  part->setPos(move(pos));\n  part->setVel(move(velocity));\n  part->setSize(move(size));\n  part->setDestroyTime(partDestroyTime_);\n  part->setAnimColor(startCol_, endCol_);\n  part->setSizeRatio(sizeRatio_);\n  part->setGravity(gravity_);\n  part->useGravity(useGravity_);\n\n  particles_.emplace_back(move(part));\n}\n\nvoid ParticleSystem::play() {\n  play_        = true;\n  deltaTime_   = 0;\n  createDelta_ = 0;\n}\n\nvoid ParticleSystem::stop() {\n  play_ = false;\n}\n\nvoid ParticleSystem::killAll() {\n  play_ = false;\n  \n  \/\/ 全削除\n  for (auto& p : particles_) {\n    p->destroy();\n  }\n}\n\nbool ParticleSystem::hasDestroyTime()    const { return bool(destroyTime_); }\n\nfloat ParticleSystem::getInterval()      const { return createInterval_; }\nofVec2f ParticleSystem::getSizeMin()     const { return sizeMin_; }\nofVec2f ParticleSystem::getSizeMax()     const { return sizeMax_; }\nofVec2f ParticleSystem::getVelocityMin() const { return velocityMin_; }\nofVec2f ParticleSystem::getVelocityMax() const { return velocityMax_; }\n\nvoid ParticleSystem::setInterval(float interval)    { createInterval_ = interval; }\nvoid ParticleSystem::setSysDestroyTime(float time)  { destroyTime_ = time; }\nvoid ParticleSystem::setPartDestroyTime(float time) { partDestroyTime_ = time; }\n\nvoid ParticleSystem::setCreateSize(ofVec2f min, ofVec2f max) {\n  sizeMin_ = min;\n  sizeMax_ = max;\n}\n\nvoid ParticleSystem::setCreateVelocity(ofVec2f min, ofVec2f max) {\n  velocityMin_ = min;\n  velocityMax_ = max;\n}\n\nvoid ParticleSystem::setAnimColor(ofFloatColor start, ofFloatColor end) {\n  startCol_ = start;\n  endCol_   = end;\n}\n\n\/\/ =================================================\n\/\/ パーティクル\nParticle::Particle()\n : deltaTime_  ( 0     )\n , destroyTime_( 60    )\n , sizeRatio_  ( 1.0f  )\n , gravity_    ( 0.2f  )\n , useGravity_ ( false )\n{\n  name_ = \"Particle\";\n  tag_  = PARTICLE;\n}\n\n\nvoid Particle::setup() {}\n\nvoid Particle::update(float deltaTime) {\n  deltaTime_ += deltaTime;\n\n  updatePos(deltaTime);   \/\/ 位置\n  updateSize(deltaTime);  \/\/ サイズ\n  updateColor(deltaTime); \/\/ 色\n\n  \/\/ 自滅時間になったら死ぬ\n  if (deltaTime_ > destroyTime_ ||\n      size_.x <= 0 || size_.y <= 0) {\n    destroy();\n  }\n}\n\nvoid Particle::draw() {\n  ofSetColor(color_);\n  ofDrawCircle(pos_, size_.x);\n}\n\nvoid Particle::updatePos(float delta) {\n  \/\/ 重力を掛ける処理\n  if (useGravity_) { vel_.y -= gravity_; }\n  \n  \/\/ 設定された加速度で移動する\n  pos_ += vel_;\n}\n\nvoid Particle::updateSize(float delta) {\n  animSizeX_.update(delta);\n  animSizeY_.update(delta);\n  size_ = ofVec2f(animSizeX_, animSizeY_);\n}\n\nvoid Particle::updateColor(float delta) {\n  \/\/ 時間経過で色を変化させる(startとendの色が違えば)\n  r_.update(delta);\n  g_.update(delta);\n  b_.update(delta);\n  color_ = ofFloatColor(r_, g_, b_);\n}\n\nvoid Particle::setDestroyTime(float time) {\n  destroyTime_ = max(0.0f, time);\n}\n\nvoid Particle::setAnimColor(ofFloatColor start, ofFloatColor end) {\n  startCol_ = start;\n  endCol_   = end;\n\n  r_.setDuration(destroyTime_);\n  r_.setCurve(LINEAR);\n  r_.animateFromTo(startCol_.r, endCol_.r);\n\n  g_.setDuration(destroyTime_);\n  g_.setCurve(LINEAR);\n  g_.animateFromTo(startCol_.g, endCol_.g);\n\n  b_.setDuration(destroyTime_);\n  b_.setCurve(LINEAR);\n  b_.animateFromTo(startCol_.b, endCol_.b);\n}\n\nvoid Particle::setSizeRatio(float ratio) {\n  sizeRatio_ = ratio;\n\n  \/\/ 最終的な大きさを求めてanimateも設定\n  ofVec2f ls = size_ * sizeRatio_;\n  animSizeX_.setDuration(destroyTime_);\n  animSizeX_.setCurve(LINEAR);\n  animSizeX_.animateFromTo(size_.x, ls.x);\n\n  animSizeY_.setDuration(destroyTime_);\n  animSizeY_.setCurve(LINEAR);\n  animSizeY_.animateFromTo(size_.y, ls.y);\n}\n\nvoid Particle::setGravity(float gravity) {\n  gravity_ = gravity;\n}\n\nvoid Particle::useGravity(bool g) {\n  useGravity_ = g;\n}\n\n\n\/\/\/ ====================================================\n\/\/\/< @brief 追従ぱーてくる\n\/\/\/ ====================================================\nHomingParticle::HomingParticle(Actor* target)\n : target_  ( target )\n , curvePow_( 1.2    )\n{\n  name_  = \"HomingParticle\";\n  tag_   =  HOMING_PARTICLE;\n  delta_ = 0;\n}\n\nvoid HomingParticle::setup() {\n  enableUpdate();\n}\n\nvoid HomingParticle::update(float deltaTime) {\n  delta_ += deltaTime;\n  if (delta_ > 0.15f) { enableCollision(); }\n\n  if (target_) {\n  \n    \/\/ ターゲットへのベクトルを求める\n    ofVec2f targetPos = target_->getPos() + (target_->getSize() * 0.5);\n    ofVec2f forward = targetPos - pos_;\n    forward.normalize();\n    forward *= curvePow_;\n  \n    if (delta_ > 0.15f) {\n      \/\/ 加速度に加算\n      vel_ += forward;\n    }\n    \n    float limit = 8;\n    vel_.x = min(limit, vel_.x);\n    vel_.y = min(limit, vel_.y);\n    vel_.x = max(-limit, vel_.x);\n    vel_.y = max(-limit, vel_.y);\n    \n  } else {\n    destroy();\n  }\n  \n  updatePos(deltaTime);\n}\n\nvoid HomingParticle::draw() {\n  ofSetColor(color_);\n  ofDrawCircle(pos_, size_.x);\n}\n\nvoid HomingParticle::onCollision(Actor* p_actor) {\n  if (p_actor->getTag() == PLAYER) {\n    destroy();\n  }\n}\n\nvoid HomingParticle::updatePos(float delta) {\n  pos_ += vel_;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* \n * The Biomechanical ToolKit\n * Copyright (c) 2009-2011, Arnaud Barré\n * All 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\n *       copyright notice, this list of conditions and the following\n *       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\n *       provided with the distribution.\n *     * Neither the name(s) of the copyright holders nor the names\n *       of its contributors may be used to endorse or promote products\n *       derived from this software without specific prior written\n *       permission.\n * \n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"btkVTKGRFsFramesSource.h\"\n#include \"btkVTKDataObjectAdapter.h\"\n\n#include <vtkstd\/vector>\n#include <vtkPolyData.h>\n#include <vtkLineSource.h>\n#include <vtkAppendPolyData.h>\n#include <vtkInformation.h>\n#include <vtkInformationVector.h>\n#include <vtkObjectFactory.h>\n#include <vtkStreamingDemandDrivenPipeline.h>\n\n\nnamespace btk\n{\n  \/**\n   * @class VTKGRFsComponents btkVTKGRFsFramesSource.h\n   * @brief Store ground reaction forces vector as vector of vtkPolyData\n   *\/\n  class VTKGRFsComponents : public vtkstd::vector<vtkPolyData*>\n  {};\n  \n  \/** \n   * @class VTKGRFsFramesSource\n   * @brief Display ground reaction forces (GRF).\n   *\n   * This filter compute all GRFs when a new input is set or modified (see VTKGRFsFramesSource::RequestInformation).\n   * The display of GRFs for each frame use the vtk TIME mechanism by setting the required frame\n   * to a vtkStreamingDemandDrivenPipeline object and call the vtkRenderer::Renderer() method.\n   * For example:\n   * @code\n   * \/\/ BTK\n   * btk::AcquisitionFileReader::Pointer reader = btk::AcquisitionFileReader::New();\n   * reader->SetDisableFilenameExceptionState(true);\n   * btk::ForcePlatformsExtractor::Pointer forcePlatformsExtractor = btk::ForcePlatformsExtractor::New();\n   * forcePlatformsExtractor->SetInput(reader->GetOutput());\n   * btk::GroundReactionWrenchFilter::Pointer GRWsFilter = btk::GroundReactionWrenchFilter::New();\n   * GRWsFilter->SetThresholdValue(5.0); \/\/ PWA are not computed from vertical forces lower than 5 newtons.\n   * GRWsFilter->SetThresholdState(true);\n   * GRWsFilter->SetInput(forcePlatformsExtractor->GetOutput());\n   * \/\/ VTK\n   * vtkRenderer* renderer = vtkRenderer::New()\n   * btk::VTKGRFsFramesSource* GRFs = btk::VTKGRFsFramesSource::New();\n   * GRFs->SetInput(GRWsFilter->GetOutput());\n   * vtkPolyDataMapper* mapper = vtkPolyDataMapper::New();\n   * mapper->SetInputConnection(GRFs->GetOutputPort());\n   * vtkActor* actor = vtkActor::New();\n   * actor->SetMapper(mapper);\n   * renderer->AddActor(actor);\n   * \/\/ ...\n   * int numberOfFrames = reader->GetAnalogFrameNumber();\n   * vtkStreamingDemandDrivenPipeline* exec = vtkStreamingDemandDrivenPipeline::SafeDownCast(GRFs->GetExecutive());\n   * for (int i = 1 ; i < numberOfFrames ; ++i)\n   * {\n   *   exec->SetUpdateTimeStep(0, i);\n   *   mapper->Modified();\n   *   renderer->Render();\n   * }\n   * \/\/ Code cleanup\n   * \/\/ ...\n   * @endcode\n   * \n   * @ingroup BTKVTK\n   *\/\n  \n  \/**\n   * @fn static VTKGRFsFramesSource* VTKGRFsFramesSource::New();\n   * Creates a VTKGRFsFramesSource object and return it as a pointer.\n   *\/\n  vtkStandardNewMacro(VTKGRFsFramesSource);\n  vtkCxxRevisionMacro(VTKGRFsFramesSource, \"$Revision: 0.1 $\");\n  \n  \/**\n   * Prints only the Superclass information.\n   *\/\n  void VTKGRFsFramesSource::PrintSelf(ostream& os, vtkIndent indent)\n  {\n    this->Superclass::PrintSelf(os,indent);\n  }\n\n  \/**\n   * Set filter's input.\n   *\/\n  void VTKGRFsFramesSource::SetInput(WrenchCollection::Pointer input)\n  {\n    VTKDataObjectAdapter* inObject = VTKDataObjectAdapter::New();\n    inObject->SetBTKDataObject(input);\n    this->vtkPolyDataAlgorithm::SetInput(inObject);\n    inObject->Delete();\n  };\n  \n  \/**\n   * @fn double VTKGRFsFramesSource::GetScaleUnit()\n   * Returns the scale factor used to set GRFs' positions (i.e. the point of wrench application (PWA)).\n   *\n   * Usefull when visualized acquistion date are set in meter, millimeter, inch, etc.\n   *\/\n  \n  \/**\n   * @fn void VTKGRFsFramesSource::SetScaleUnit(double s)\n   * Sets the scale factor used to set GRFs' positions.\n   *\n   * Usefull when visualized acquistion date are set in meter, millimeter, inch, etc.\n   *\/\n  \n  \/**\n   * Constructor.\n   *\n   * Filter with one input and output.\n   *\/\n  VTKGRFsFramesSource::VTKGRFsFramesSource()\n  : vtkPolyDataAlgorithm()\n  {\n    this->mp_GRFsComponents = new VTKGRFsComponents();\n    this->mp_Scale = 1.0;\n  };\n  \n  \/**\n   * Destructor.\n   *\/\n  VTKGRFsFramesSource::~VTKGRFsFramesSource()\n  {\n    for (size_t i = 0 ; i < this->mp_GRFsComponents->size() ; ++i)\n      this->mp_GRFsComponents->operator[](i)->Delete();\n    delete this->mp_GRFsComponents;\n  };\n\n  \/**\n   * Generate GRFs' vectors\n   *\/\n  int VTKGRFsFramesSource::RequestInformation(vtkInformation* request, vtkInformationVector** inputVector, vtkInformationVector* outputVector)\n  {\n    btkNotUsed(request)\n    \/\/ Convert a btk::PointCollection into a collection of polydata containing only vertices.\n    vtkInformation* inInfo = inputVector[0]->GetInformationObject(0);\n    VTKDataObjectAdapter* inObject = VTKDataObjectAdapter::SafeDownCast(inInfo->Get(vtkDataObject::DATA_OBJECT()));\n    if (!inObject)\n      return 0;\n    if (inObject->GetMTime() < this->GetMTime())\n      return 0;\n    WrenchCollection::Pointer input = static_pointer_cast<WrenchCollection>(inObject->GetBTKDataObject());\n    \/\/ Raz\n    for (size_t i = 0 ; i < this->mp_GRFsComponents->size() ; ++i)\n      this->mp_GRFsComponents->operator[](i)->Delete();\n    this->mp_GRFsComponents->clear();\n    int frameNumber = 0;\n    int wrenchNumber = input->GetItemNumber();\n    if (wrenchNumber != 0)\n    {\n      frameNumber = input->GetItem(0)->GetPosition()->GetFrameNumber();\n      this->mp_GRFsComponents->resize(frameNumber);\n      vtkAppendPolyData* append = vtkAppendPolyData::New();\n      append->UserManagedInputsOn();\n      append->SetNumberOfInputs(wrenchNumber);\n      vtkLineSource* lineGenerator = vtkLineSource::New();\n\n      for (int i = 0 ; i < frameNumber ; ++i)\n      {\n        int wrenchIdx = 0;\n        WrenchCollection::ConstIterator it = input->Begin();\n        while (it != input->End())\n        {\n          if ((*it)->GetPosition()->GetResiduals().coeff(i) != -1.0)\n          {\n            double* positions = (*it)->GetPosition()->GetValues().data();\n            double* forces = (*it)->GetForce()->GetValues().data();\n            lineGenerator->SetPoint1(positions[i] * this->mp_Scale,\n                                     positions[i + frameNumber] * this->mp_Scale,\n                                     positions[i + 2 * frameNumber] * this->mp_Scale);\n            lineGenerator->SetPoint2(positions[i] * this->mp_Scale + forces[i], \n                                     positions[i + frameNumber] * this->mp_Scale + forces[i + frameNumber], \n                                     positions[i + 2 * frameNumber] * this->mp_Scale + forces[i + 2 * frameNumber]);\n\n            lineGenerator->Update();\n            vtkPolyData* GRF = vtkPolyData::New();\n            GRF->DeepCopy(lineGenerator->GetOutput());\n            append->SetInputByNumber(wrenchIdx, GRF);\n            GRF->Delete();\n          }\n          else\n            append->SetInputByNumber(wrenchIdx, 0);\n\n          ++it; ++wrenchIdx;\n        }\n        append->Update();\n        vtkPolyData* GRFs = vtkPolyData::New();\n        GRFs->DeepCopy(append->GetOutput());\n        this->mp_GRFsComponents->operator[](i) = GRFs;\n      }\n      lineGenerator->Delete();\n      append->Delete();\n    }\n    \/\/ Update output informations\n    vtkInformation *outInfo = outputVector->GetInformationObject(0);\n    \/\/ TIME_STEPS\n    double *outTimes = new double [frameNumber];\n    int i;\n    for (i = 0; i < frameNumber; ++i)\n      outTimes[i] = i;\n    outInfo->Set(vtkStreamingDemandDrivenPipeline::TIME_STEPS(), outTimes, frameNumber);\n    delete [] outTimes;\n    \/\/ TIME_RANGE\n    double outRange[2];\n    outRange[0] = 0;\n    outRange[1] = frameNumber - 1;\n    outInfo->Set(vtkStreamingDemandDrivenPipeline::TIME_RANGE(), outRange, 2);\n\n    return 1;\n  };\n\n  \/**\n   * Extract GRFs frame required by a vtkStreamingDemandDrivenPipeline object.\n   *\/\n  int VTKGRFsFramesSource::RequestData(vtkInformation* request,\n                                       vtkInformationVector** inputVector,\n                                       vtkInformationVector* outputVector)\n  {\n    btkNotUsed(request);\n    btkNotUsed(inputVector);\n    vtkInformation* outInfo = outputVector->GetInformationObject(0);    \n    vtkPolyData* output = vtkPolyData::SafeDownCast(outInfo->Get(vtkDataObject::DATA_OBJECT()));\n\n    if (this->mp_GRFsComponents->size() != 0)\n    {\n      double t = 0;\n      if (outInfo->Has(vtkStreamingDemandDrivenPipeline::UPDATE_TIME_STEPS()))\n        t = outInfo->Get(vtkStreamingDemandDrivenPipeline::UPDATE_TIME_STEPS())[0];\n      outInfo->Set(vtkDataObject::DATA_TIME_STEPS(), &t, 1);\n      vtkPolyData* poly = vtkPolyData::SafeDownCast(this->mp_GRFsComponents->operator[](static_cast<int>(t)));\n      output->ShallowCopy(poly);\n    }\n    else\n      output->Initialize();\n\n    return 1;\n  };\n\n  \/*\n  int VTKGRFsFramesSource::RequestUpdateExtent(vtkInformation *request, vtkInformationVector **inputVector, vtkInformationVector *outputVector)\n  {\n    btkNotUsed(request);\n    vtkInformation *inInfo = inputVector[0]->GetInformationObject(0);\n    vtkInformation *outInfo = outputVector->GetInformationObject(0);\n\n    inInfo->Set(vtkStreamingDemandDrivenPipeline::UPDATE_PIECE_NUMBER(),\n                outInfo->Get(vtkStreamingDemandDrivenPipeline::UPDATE_PIECE_NUMBER()));\n    inInfo->Set(vtkStreamingDemandDrivenPipeline::UPDATE_NUMBER_OF_PIECES(),\n                outInfo->Get(vtkStreamingDemandDrivenPipeline::UPDATE_NUMBER_OF_PIECES()));\n    inInfo->Set(vtkStreamingDemandDrivenPipeline::UPDATE_NUMBER_OF_GHOST_LEVELS(),\n                outInfo->Get(vtkStreamingDemandDrivenPipeline::UPDATE_NUMBER_OF_GHOST_LEVELS()));\n    inInfo->Set(vtkStreamingDemandDrivenPipeline::EXACT_EXTENT(), 1);\n\n    return 1;\n  }\n  *\/\n  \n  \/**\n   * Sets the type of object required for the input.\n   *\/\n  int VTKGRFsFramesSource::FillInputPortInformation(int port, \n                                                    vtkInformation* info)\n  {\n    btkNotUsed(port);\n    info->Set(vtkAlgorithm::INPUT_REQUIRED_DATA_TYPE(), \"VTKDataObjectAdapter\");\n    return 1;\n  }\n};\n\n<commit_msg>[UPD] Huge time speed up to create ground reactions forces.<commit_after>\/* \n * The Biomechanical ToolKit\n * Copyright (c) 2009-2011, Arnaud Barré\n * All 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\n *       copyright notice, this list of conditions and the following\n *       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\n *       provided with the distribution.\n *     * Neither the name(s) of the copyright holders nor the names\n *       of its contributors may be used to endorse or promote products\n *       derived from this software without specific prior written\n *       permission.\n * \n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"btkVTKGRFsFramesSource.h\"\n#include \"btkVTKDataObjectAdapter.h\"\n\n#include <vtkstd\/vector>\n#include <vtkPolyData.h>\n#include <vtkInformation.h>\n#include <vtkInformationVector.h>\n#include <vtkObjectFactory.h>\n#include <vtkStreamingDemandDrivenPipeline.h>\n#include <vtkCellArray.h>\n\nnamespace btk\n{\n  \/**\n   * @class VTKGRFsComponents btkVTKGRFsFramesSource.h\n   * @brief Store ground reaction forces vector as vector of vtkPolyData\n   *\/\n  class VTKGRFsComponents : public vtkstd::vector<vtkPolyData*>\n  {};\n  \n  \/** \n   * @class VTKGRFsFramesSource\n   * @brief Display ground reaction forces (GRF).\n   *\n   * This filter compute all GRFs when a new input is set or modified (see VTKGRFsFramesSource::RequestInformation).\n   * The display of GRFs for each frame use the vtk TIME mechanism by setting the required frame\n   * to a vtkStreamingDemandDrivenPipeline object and call the vtkRenderer::Renderer() method.\n   * For example:\n   * @code\n   * \/\/ BTK\n   * btk::AcquisitionFileReader::Pointer reader = btk::AcquisitionFileReader::New();\n   * reader->SetDisableFilenameExceptionState(true);\n   * btk::ForcePlatformsExtractor::Pointer forcePlatformsExtractor = btk::ForcePlatformsExtractor::New();\n   * forcePlatformsExtractor->SetInput(reader->GetOutput());\n   * btk::GroundReactionWrenchFilter::Pointer GRWsFilter = btk::GroundReactionWrenchFilter::New();\n   * GRWsFilter->SetThresholdValue(5.0); \/\/ PWA are not computed from vertical forces lower than 5 newtons.\n   * GRWsFilter->SetThresholdState(true);\n   * GRWsFilter->SetInput(forcePlatformsExtractor->GetOutput());\n   * \/\/ VTK\n   * vtkRenderer* renderer = vtkRenderer::New()\n   * btk::VTKGRFsFramesSource* GRFs = btk::VTKGRFsFramesSource::New();\n   * GRFs->SetInput(GRWsFilter->GetOutput());\n   * vtkPolyDataMapper* mapper = vtkPolyDataMapper::New();\n   * mapper->SetInputConnection(GRFs->GetOutputPort());\n   * vtkActor* actor = vtkActor::New();\n   * actor->SetMapper(mapper);\n   * renderer->AddActor(actor);\n   * \/\/ ...\n   * int numberOfFrames = reader->GetAnalogFrameNumber();\n   * vtkStreamingDemandDrivenPipeline* exec = vtkStreamingDemandDrivenPipeline::SafeDownCast(GRFs->GetExecutive());\n   * for (int i = 1 ; i < numberOfFrames ; ++i)\n   * {\n   *   exec->SetUpdateTimeStep(0, i);\n   *   mapper->Modified();\n   *   renderer->Render();\n   * }\n   * \/\/ Code cleanup\n   * \/\/ ...\n   * @endcode\n   * \n   * @ingroup BTKVTK\n   *\/\n  \n  \/**\n   * @fn static VTKGRFsFramesSource* VTKGRFsFramesSource::New();\n   * Creates a VTKGRFsFramesSource object and return it as a pointer.\n   *\/\n  vtkStandardNewMacro(VTKGRFsFramesSource);\n  vtkCxxRevisionMacro(VTKGRFsFramesSource, \"$Revision: 0.1 $\");\n  \n  \/**\n   * Prints only the Superclass information.\n   *\/\n  void VTKGRFsFramesSource::PrintSelf(ostream& os, vtkIndent indent)\n  {\n    this->Superclass::PrintSelf(os,indent);\n  }\n\n  \/**\n   * Set filter's input.\n   *\/\n  void VTKGRFsFramesSource::SetInput(WrenchCollection::Pointer input)\n  {\n    VTKDataObjectAdapter* inObject = VTKDataObjectAdapter::New();\n    inObject->SetBTKDataObject(input);\n    this->vtkPolyDataAlgorithm::SetInput(inObject);\n    inObject->Delete();\n  };\n  \n  \/**\n   * @fn double VTKGRFsFramesSource::GetScaleUnit()\n   * Returns the scale factor used to set GRFs' positions (i.e. the point of wrench application (PWA)).\n   *\n   * Usefull when visualized acquistion date are set in meter, millimeter, inch, etc.\n   *\/\n  \n  \/**\n   * @fn void VTKGRFsFramesSource::SetScaleUnit(double s)\n   * Sets the scale factor used to set GRFs' positions.\n   *\n   * Usefull when visualized acquistion date are set in meter, millimeter, inch, etc.\n   *\/\n  \n  \/**\n   * Constructor.\n   *\n   * Filter with one input and output.\n   *\/\n  VTKGRFsFramesSource::VTKGRFsFramesSource()\n  : vtkPolyDataAlgorithm()\n  {\n    this->mp_GRFsComponents = new VTKGRFsComponents();\n    this->mp_Scale = 1.0;\n  };\n  \n  \/**\n   * Destructor.\n   *\/\n  VTKGRFsFramesSource::~VTKGRFsFramesSource()\n  {\n    for (size_t i = 0 ; i < this->mp_GRFsComponents->size() ; ++i)\n      this->mp_GRFsComponents->operator[](i)->Delete();\n    delete this->mp_GRFsComponents;\n  };\n\n  \/**\n   * Generate GRFs' vectors\n   *\/\n  int VTKGRFsFramesSource::RequestInformation(vtkInformation* request, vtkInformationVector** inputVector, vtkInformationVector* outputVector)\n  {\n    btkNotUsed(request)\n    \/\/ Convert a btk::PointCollection into a collection of polydata containing only vertices.\n    vtkInformation* inInfo = inputVector[0]->GetInformationObject(0);\n    VTKDataObjectAdapter* inObject = VTKDataObjectAdapter::SafeDownCast(inInfo->Get(vtkDataObject::DATA_OBJECT()));\n    if (!inObject)\n      return 0;\n    if (inObject->GetMTime() < this->GetMTime())\n      return 0;\n    WrenchCollection::Pointer input = static_pointer_cast<WrenchCollection>(inObject->GetBTKDataObject());\n    \/\/ Reset\n    for (size_t i = 0 ; i < this->mp_GRFsComponents->size() ; ++i)\n      this->mp_GRFsComponents->operator[](i)->Delete();\n    this->mp_GRFsComponents->clear();\n    int frameNumber = 0;\n    int wrenchNumber = input->GetItemNumber();\n    if (wrenchNumber != 0)\n    {\n      frameNumber = input->GetItem(0)->GetPosition()->GetFrameNumber();\n      this->mp_GRFsComponents->resize(frameNumber);\n      for (int i = 0 ; i < frameNumber ; ++i)\n      {\n        int wrenchIdx = 0;\n        \n        vtkPolyData* GRFs = vtkPolyData::New();\n        vtkPoints* points = vtkPoints::New(); points->SetNumberOfPoints(2*wrenchNumber); \/\/ 2 points by wrench\n        vtkCellArray* lines = vtkCellArray::New(); lines->Allocate(lines->EstimateSize(1*wrenchNumber,2)); \/\/ 1 line by wrench\n        \n        WrenchCollection::ConstIterator it = input->Begin();\n        while (it != input->End())\n        {\n          if ((*it)->GetPosition()->GetResiduals().coeff(i) != -1.0)\n          {\n            double* positions = (*it)->GetPosition()->GetValues().data();\n            double* forces = (*it)->GetForce()->GetValues().data();\n            \n            points->SetPoint(wrenchIdx * 2 + 0,\n                             positions[i] * this->mp_Scale,\n                             positions[i + frameNumber] * this->mp_Scale,\n                             positions[i + 2 * frameNumber] * this->mp_Scale);\n            points->SetPoint(wrenchIdx * 2 + 1,positions[i] * this->mp_Scale + forces[i], \n                             positions[i + frameNumber] * this->mp_Scale + forces[i + frameNumber], \n                             positions[i + 2 * frameNumber] * this->mp_Scale + forces[i + 2 * frameNumber]);\n\n            lines->InsertNextCell(2);\n            lines->InsertCellPoint(wrenchIdx * 2 + 0);\n            lines->InsertCellPoint(wrenchIdx * 2 + 1);\n            \n            ++wrenchIdx;\n          }\n          ++it;\n        }\n        \n        points->SetNumberOfPoints(2 * wrenchIdx); \/\/ Update the number of points and the memory allocated\n        GRFs->SetPoints(points);\n        points->Delete();\n        GRFs->SetLines(lines);\n        lines->Delete();\n        \n        this->mp_GRFsComponents->operator[](i) = GRFs;\n      }\n    }\n    \/\/ Update output informations\n    vtkInformation *outInfo = outputVector->GetInformationObject(0);\n    \/\/ TIME_STEPS\n    double *outTimes = new double [frameNumber];\n    int i;\n    for (i = 0; i < frameNumber; ++i)\n      outTimes[i] = i;\n    outInfo->Set(vtkStreamingDemandDrivenPipeline::TIME_STEPS(), outTimes, frameNumber);\n    delete [] outTimes;\n    \/\/ TIME_RANGE\n    double outRange[2];\n    outRange[0] = 0;\n    outRange[1] = frameNumber - 1;\n    outInfo->Set(vtkStreamingDemandDrivenPipeline::TIME_RANGE(), outRange, 2);\n\n    return 1;\n  };\n\n  \/**\n   * Extract GRFs frame required by a vtkStreamingDemandDrivenPipeline object.\n   *\/\n  int VTKGRFsFramesSource::RequestData(vtkInformation* request,\n                                       vtkInformationVector** inputVector,\n                                       vtkInformationVector* outputVector)\n  {\n    btkNotUsed(request);\n    btkNotUsed(inputVector);\n    vtkInformation* outInfo = outputVector->GetInformationObject(0);    \n    vtkPolyData* output = vtkPolyData::SafeDownCast(outInfo->Get(vtkDataObject::DATA_OBJECT()));\n\n    if (this->mp_GRFsComponents->size() != 0)\n    {\n      double t = 0;\n      if (outInfo->Has(vtkStreamingDemandDrivenPipeline::UPDATE_TIME_STEPS()))\n        t = outInfo->Get(vtkStreamingDemandDrivenPipeline::UPDATE_TIME_STEPS())[0];\n      outInfo->Set(vtkDataObject::DATA_TIME_STEPS(), &t, 1);\n      vtkPolyData* poly = vtkPolyData::SafeDownCast(this->mp_GRFsComponents->operator[](static_cast<int>(t)));\n      output->ShallowCopy(poly);\n    }\n    else\n      output->Initialize();\n\n    return 1;\n  };\n\n  \/*\n  int VTKGRFsFramesSource::RequestUpdateExtent(vtkInformation *request, vtkInformationVector **inputVector, vtkInformationVector *outputVector)\n  {\n    btkNotUsed(request);\n    vtkInformation *inInfo = inputVector[0]->GetInformationObject(0);\n    vtkInformation *outInfo = outputVector->GetInformationObject(0);\n\n    inInfo->Set(vtkStreamingDemandDrivenPipeline::UPDATE_PIECE_NUMBER(),\n                outInfo->Get(vtkStreamingDemandDrivenPipeline::UPDATE_PIECE_NUMBER()));\n    inInfo->Set(vtkStreamingDemandDrivenPipeline::UPDATE_NUMBER_OF_PIECES(),\n                outInfo->Get(vtkStreamingDemandDrivenPipeline::UPDATE_NUMBER_OF_PIECES()));\n    inInfo->Set(vtkStreamingDemandDrivenPipeline::UPDATE_NUMBER_OF_GHOST_LEVELS(),\n                outInfo->Get(vtkStreamingDemandDrivenPipeline::UPDATE_NUMBER_OF_GHOST_LEVELS()));\n    inInfo->Set(vtkStreamingDemandDrivenPipeline::EXACT_EXTENT(), 1);\n\n    return 1;\n  }\n  *\/\n  \n  \/**\n   * Sets the type of object required for the input.\n   *\/\n  int VTKGRFsFramesSource::FillInputPortInformation(int port, \n                                                    vtkInformation* info)\n  {\n    btkNotUsed(port);\n    info->Set(vtkAlgorithm::INPUT_REQUIRED_DATA_TYPE(), \"VTKDataObjectAdapter\");\n    return 1;\n  }\n};\n\n<|endoftext|>"}
{"text":"<commit_before>\/** @file nwrcde_main.cc\n *\n *  @author Dongryeol Lee (dongryel@cc.gatech.edu)\n *\/\n\n#include \"mlpack\/kde\/dataset_scaler.h\"\n#include \"mlpack\/series_expansion\/kernel_aux.h\"\n#include \"nwrcde.h\"\n\nint main(int argc, char *argv[]) {\n  \n  \/\/ Initialize FastExec...\n  fx_init(argc, argv, &nwrcde_main_doc);\n\n  \/\/\/\/\/\/\/\/\/\/ READING PARAMETERS AND LOADING DATA \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n  \/\/ FASTexec organizes parameters and results into submodules.  Think\n  \/\/ of this as creating a new folder named \"nwrcde_module\" under the\n  \/\/ root directory (NULL) for the NwrCde object to work inside.\n  \/\/ Here, we initialize it with all parameters defined\n  \/\/ \"--nwrcde\/...=...\".\n  struct datanode* nwrcde_module = fx_submodule(fx_root, \"nwrcde\");\n\n  \/\/ The reference data file is a required parameter.\n  const char* references_file_name = fx_param_str_req(fx_root, \"data\");\n  \n  \/\/ The file containing the reference target values is a required\n  \/\/ parameter.\n  const char* reference_targets_file_name = fx_param_str_req\n    (fx_root, \"dtarget\");\n\n  \/\/ The query data file defaults to the references.\n  const char* queries_file_name = fx_param_str(fx_root, \"query\",\n\t\t\t\t\t       references_file_name);\n\n  \/\/ Output file name for the fast algorithm.\n  const char *output_file_name = fx_param_str(nwrcde_module, \"output\",\n\t\t\t\t\t      \"nwrcde_results.txt\");\n\n  \/\/ query and reference datasets and target training values.\n  Matrix references;\n  Matrix reference_targets;\n  Matrix queries;\n\n  \/\/ data::Load inits a matrix with the contents of a .csv or .arff.\n  data::Load(references_file_name, &references);  \n  data::Load(queries_file_name, &queries);\n  data::Load(reference_targets_file_name, &reference_targets);\n\n  \/\/ Declare the computation object.\n  NWRCde<GaussianKernel> algorithm;\n  NWRCdeQueryResult query_results;\n  algorithm.Init(references, reference_targets, nwrcde_module);\n  algorithm.Compute(queries, &query_results);\n  query_results.PrintDebug(output_file_name);\n\n  \/\/ If the do_naive flag is specified, then run the naive algorithm\n  \/\/ as well.\n  if(fx_param_exists(nwrcde_module, \"do_naive\")) {\n    NWRCdeQueryResult naive_query_results;\n    const char *naive_output_file_name = \n      fx_param_str(nwrcde_module, \"naive_output\", \"naive_nwrcde_results.txt\");\n\n    algorithm.NaiveCompute(queries, &naive_query_results);\n    naive_query_results.PrintDebug(naive_output_file_name);\n\n    \/\/ Compute the difference between the naively computed estimates\n    \/\/ and the approximated estimates.\n    Vector difference;\n    la::SubInit(naive_query_results.final_nwr_estimates, \n\t\tquery_results.final_nwr_estimates, &difference);\n    \n    \/\/ The maximum relative error.\n    double max_relative_error = 0;\n    int within_limit = 0;\n    for(index_t i = 0; i < queries.n_cols(); i++) {\n      double relative_error = \n\t(naive_query_results.final_nwr_estimates[i] == \n\t query_results.final_nwr_estimates[i]) ?\n\t0:(fabs(difference[i]) \/ \n\t   fabs(naive_query_results.final_nwr_estimates[i]));\n      max_relative_error = std::max(max_relative_error, relative_error);\n\n      if(relative_error < fx_param_double(nwrcde_module, \"relative_error\",\n\t\t\t\t\t  0.1)) {\n\twithin_limit++;\n      }\n    }\n    fx_format_result(nwrcde_module, \"max_relative_error\", \"%g\",\n\t\t     max_relative_error);\n    fx_format_result(nwrcde_module, \"under_relative_error_limit\", \"%d\",\n\t\t     within_limit);\n  }\n\n  \/\/ Finalize FastExec and print output results.\n  fx_done(fx_root);\n  return 0;\n}\n<commit_msg>Now supports Epanechnikov kernel, but I need to optimize the pruning rule more.<commit_after>\/** @file nwrcde_main.cc\n *\n *  @author Dongryeol Lee (dongryel@cc.gatech.edu)\n *\/\n\n#include \"mlpack\/kde\/dataset_scaler.h\"\n#include \"mlpack\/series_expansion\/kernel_aux.h\"\n#include \"nwrcde.h\"\n\ntemplate<typename TKernel>\nvoid StartComputation(const Matrix &queries, const Matrix &references,\n\t\t      const Matrix &reference_targets,\n\t\t      struct datanode *nwrcde_module) {\n\n  \/\/ Output file name for the fast algorithm.\n  const char *output_file_name = fx_param_str(nwrcde_module, \"output\",\n                                              \"nwrcde_results.txt\");\n\n  \/\/ Declare the computation object.\n  NWRCde<TKernel> algorithm;\n  NWRCdeQueryResult query_results;\n  algorithm.Init(references, reference_targets, nwrcde_module);\n  algorithm.Compute(queries, &query_results);\n  query_results.PrintDebug(output_file_name);\n\n  \/\/ If the do_naive flag is specified, then run the naive algorithm\n  \/\/ as well.\n  if(fx_param_exists(nwrcde_module, \"do_naive\")) {\n    NWRCdeQueryResult naive_query_results;\n    const char *naive_output_file_name =\n      fx_param_str(nwrcde_module, \"naive_output\", \"naive_nwrcde_results.txt\");\n\n    algorithm.NaiveCompute(queries, &naive_query_results);\n    naive_query_results.PrintDebug(naive_output_file_name);\n\n    \/\/ Compute the difference between the naively computed estimates\n    \/\/ and the approximated estimates.\n    Vector difference;\n    la::SubInit(naive_query_results.final_nwr_estimates,\n                query_results.final_nwr_estimates, &difference);\n\n    \/\/ The maximum relative error.\n    double max_relative_error = 0;\n    int within_limit = 0;\n    for(index_t i = 0; i < queries.n_cols(); i++) {\n      double relative_error =\n        (naive_query_results.final_nwr_estimates[i] ==\n         query_results.final_nwr_estimates[i]) ?\n        0:(fabs(difference[i]) \/\n           fabs(naive_query_results.final_nwr_estimates[i]));\n      max_relative_error = std::max(max_relative_error, relative_error);\n\n      if(relative_error < fx_param_double(nwrcde_module, \"relative_error\",\n                                          0.1)) {\n        within_limit++;\n      }\n    }\n    fx_format_result(nwrcde_module, \"max_relative_error\", \"%g\",\n                     max_relative_error);\n    fx_format_result(nwrcde_module, \"under_relative_error_limit\", \"%d\",\n                     within_limit);\n  }\n}\n\nint main(int argc, char *argv[]) {\n  \n  \/\/ Initialize FastExec...\n  fx_init(argc, argv, &nwrcde_main_doc);\n\n  \/\/\/\/\/\/\/\/\/\/ READING PARAMETERS AND LOADING DATA \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n  \/\/ FASTexec organizes parameters and results into submodules.  Think\n  \/\/ of this as creating a new folder named \"nwrcde_module\" under the\n  \/\/ root directory (NULL) for the NwrCde object to work inside.\n  \/\/ Here, we initialize it with all parameters defined\n  \/\/ \"--nwrcde\/...=...\".\n  struct datanode* nwrcde_module = fx_submodule(fx_root, \"nwrcde\");\n\n  \/\/ The reference data file is a required parameter.\n  const char* references_file_name = fx_param_str_req(fx_root, \"data\");\n  \n  \/\/ The file containing the reference target values is a required\n  \/\/ parameter.\n  const char* reference_targets_file_name = fx_param_str_req\n    (fx_root, \"dtarget\");\n\n  \/\/ The query data file defaults to the references.\n  const char* queries_file_name = fx_param_str(fx_root, \"query\",\n\t\t\t\t\t       references_file_name);\n\n  \/\/ query and reference datasets and target training values.\n  Matrix references;\n  Matrix reference_targets;\n  Matrix queries;\n\n  \/\/ data::Load inits a matrix with the contents of a .csv or .arff.\n  data::Load(references_file_name, &references);  \n  data::Load(queries_file_name, &queries);\n  data::Load(reference_targets_file_name, &reference_targets);\n\n  \/\/ Run the appropriate algorithm based on the kernel type.\n  if(!strcmp(fx_param_str(nwrcde_module, \"kernel\", \"gaussian\"), \"gaussian\")) {\n    StartComputation<GaussianKernel>(queries, references, reference_targets,\n\t\t\t\t     nwrcde_module);\n  }\n  else if(!strcmp(fx_param_str(nwrcde_module, \"kernel\", \"epan\"), \"epan\")) {\n    StartComputation<EpanKernel>(queries, references, reference_targets,\n\t\t\t\t nwrcde_module);\n  }\n\n  \/\/ Finalize FastExec and print output results.\n  fx_done(fx_root);\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2014 the V8 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#include <limits.h>\n\n#include \"src\/atomic-utils.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nnamespace v8 {\nnamespace internal {\n\nTEST(AtomicNumber, Constructor) {\n  \/\/ Test some common types.\n  AtomicNumber<int> zero_int;\n  AtomicNumber<size_t> zero_size_t;\n  AtomicNumber<intptr_t> zero_intptr_t;\n  EXPECT_EQ(0, zero_int.Value());\n  EXPECT_EQ(0, zero_size_t.Value());\n  EXPECT_EQ(0, zero_intptr_t.Value());\n}\n\n\nTEST(AtomicNumber, Value) {\n  AtomicNumber<int> a(1);\n  EXPECT_EQ(1, a.Value());\n  AtomicNumber<int> b(-1);\n  EXPECT_EQ(-1, b.Value());\n  AtomicNumber<size_t> c(1);\n  EXPECT_EQ(1, c.Value());\n  AtomicNumber<size_t> d(static_cast<size_t>(-1));\n  EXPECT_EQ(std::numeric_limits<size_t>::max(), d.Value());\n}\n\n\nTEST(AtomicNumber, SetValue) {\n  AtomicNumber<int> a(1);\n  a.SetValue(-1);\n  EXPECT_EQ(-1, a.Value());\n}\n\n\nTEST(AtomicNumber, Increment) {\n  AtomicNumber<int> a(std::numeric_limits<int>::max());\n  a.Increment(1);\n  EXPECT_EQ(std::numeric_limits<int>::min(), a.Value());\n  \/\/ Check that potential signed-ness of the underlying storage has no impact\n  \/\/ on unsigned types.\n  AtomicNumber<size_t> b(std::numeric_limits<intptr_t>::max());\n  b.Increment(1);\n  EXPECT_EQ(static_cast<size_t>(std::numeric_limits<intptr_t>::max()) + 1,\n            b.Value());\n  \/\/ Should work as decrement as well.\n  AtomicNumber<size_t> c(1);\n  c.Increment(-1);\n  EXPECT_EQ(0, c.Value());\n  c.Increment(-1);\n  EXPECT_EQ(std::numeric_limits<size_t>::max(), c.Value());\n}\n\n\nnamespace {\n\nenum TestFlag {\n  kA,\n  kB,\n  kC,\n};\n\n}  \/\/ namespace\n\n\nTEST(AtomicValue, Initial) {\n  AtomicValue<TestFlag> a(kA);\n  EXPECT_EQ(TestFlag::kA, a.Value());\n}\n\n\nTEST(AtomicValue, TrySetValue) {\n  AtomicValue<TestFlag> a(kA);\n  EXPECT_FALSE(a.TrySetValue(kB, kC));\n  EXPECT_TRUE(a.TrySetValue(kA, kC));\n  EXPECT_EQ(TestFlag::kC, a.Value());\n}\n\n\nTEST(AtomicValue, SetValue) {\n  AtomicValue<TestFlag> a(kB);\n  EXPECT_EQ(kB, a.SetValue(kC));\n  EXPECT_EQ(TestFlag::kC, a.Value());\n}\n\n\nTEST(AtomicValue, WithVoidStar) {\n  AtomicValue<void*> a(nullptr);\n  AtomicValue<void*> dummy(nullptr);\n  EXPECT_EQ(nullptr, a.Value());\n  EXPECT_EQ(nullptr, a.SetValue(&a));\n  EXPECT_EQ(&a, a.Value());\n  EXPECT_FALSE(a.TrySetValue(nullptr, &dummy));\n  EXPECT_TRUE(a.TrySetValue(&a, &dummy));\n  EXPECT_EQ(&dummy, a.Value());\n}\n\n\nnamespace {\n\nenum TestSetValue { kAA, kBB, kCC, kLastValue = kCC };\n\n}  \/\/ namespace\n\n\nTEST(AtomicEnumSet, Constructor) {\n  AtomicEnumSet<TestSetValue> a;\n  EXPECT_TRUE(a.IsEmpty());\n  EXPECT_FALSE(a.Contains(kAA));\n}\n\n\nTEST(AtomicEnumSet, AddSingle) {\n  AtomicEnumSet<TestSetValue> a;\n  a.Add(kAA);\n  EXPECT_FALSE(a.IsEmpty());\n  EXPECT_TRUE(a.Contains(kAA));\n  EXPECT_FALSE(a.Contains(kBB));\n  EXPECT_FALSE(a.Contains(kCC));\n}\n\n\nTEST(AtomicEnumSet, AddOtherSet) {\n  AtomicEnumSet<TestSetValue> a;\n  AtomicEnumSet<TestSetValue> b;\n  a.Add(kAA);\n  EXPECT_FALSE(a.IsEmpty());\n  EXPECT_TRUE(b.IsEmpty());\n  b.Add(a);\n  EXPECT_FALSE(b.IsEmpty());\n  EXPECT_TRUE(a.Contains(kAA));\n  EXPECT_TRUE(b.Contains(kAA));\n}\n\n\nTEST(AtomicEnumSet, RemoveSingle) {\n  AtomicEnumSet<TestSetValue> a;\n  a.Add(kAA);\n  a.Add(kBB);\n  EXPECT_TRUE(a.Contains(kAA));\n  EXPECT_TRUE(a.Contains(kBB));\n  a.Remove(kAA);\n  EXPECT_FALSE(a.Contains(kAA));\n  EXPECT_TRUE(a.Contains(kBB));\n}\n\n\nTEST(AtomicEnumSet, RemoveOtherSet) {\n  AtomicEnumSet<TestSetValue> a;\n  AtomicEnumSet<TestSetValue> b;\n  a.Add(kAA);\n  a.Add(kBB);\n  b.Add(kBB);\n  a.Remove(b);\n  EXPECT_TRUE(a.Contains(kAA));\n  EXPECT_FALSE(a.Contains(kBB));\n  EXPECT_FALSE(a.Contains(kCC));\n}\n\n\nTEST(AtomicEnumSet, RemoveEmptySet) {\n  AtomicEnumSet<TestSetValue> a;\n  AtomicEnumSet<TestSetValue> b;\n  a.Add(kAA);\n  a.Add(kBB);\n  EXPECT_TRUE(a.Contains(kAA));\n  EXPECT_TRUE(a.Contains(kBB));\n  EXPECT_FALSE(a.Contains(kCC));\n  EXPECT_TRUE(b.IsEmpty());\n  a.Remove(b);\n  EXPECT_TRUE(a.Contains(kAA));\n  EXPECT_TRUE(a.Contains(kBB));\n  EXPECT_FALSE(a.Contains(kCC));\n}\n\n\nTEST(AtomicEnumSet, Intersect) {\n  AtomicEnumSet<TestSetValue> a;\n  AtomicEnumSet<TestSetValue> b;\n  a.Add(kAA);\n  b.Add(kCC);\n  a.Intersect(b);\n  EXPECT_TRUE(a.IsEmpty());\n}\n\n\nTEST(AtomicEnumSet, ContainsAnyOf) {\n  AtomicEnumSet<TestSetValue> a;\n  AtomicEnumSet<TestSetValue> b;\n  a.Add(kAA);\n  b.Add(kCC);\n  EXPECT_FALSE(a.ContainsAnyOf(b));\n  b.Add(kAA);\n  EXPECT_TRUE(a.ContainsAnyOf(b));\n}\n\n\nTEST(AtomicEnumSet, Equality) {\n  AtomicEnumSet<TestSetValue> a;\n  AtomicEnumSet<TestSetValue> b;\n  a.Add(kAA);\n  EXPECT_FALSE(a == b);\n  EXPECT_TRUE(a != b);\n  b.Add(kAA);\n  EXPECT_TRUE(a == b);\n  EXPECT_FALSE(a != b);\n}\n\n}  \/\/ namespace internal\n}  \/\/ namespace v8\n<commit_msg>Fix a -Wsign-compare error under GCC 4.9.2.<commit_after>\/\/ Copyright 2014 the V8 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#include <limits.h>\n\n#include \"src\/atomic-utils.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nnamespace v8 {\nnamespace internal {\n\nTEST(AtomicNumber, Constructor) {\n  \/\/ Test some common types.\n  AtomicNumber<int> zero_int;\n  AtomicNumber<size_t> zero_size_t;\n  AtomicNumber<intptr_t> zero_intptr_t;\n  EXPECT_EQ(0, zero_int.Value());\n  EXPECT_EQ(0U, zero_size_t.Value());\n  EXPECT_EQ(0, zero_intptr_t.Value());\n}\n\n\nTEST(AtomicNumber, Value) {\n  AtomicNumber<int> a(1);\n  EXPECT_EQ(1, a.Value());\n  AtomicNumber<int> b(-1);\n  EXPECT_EQ(-1, b.Value());\n  AtomicNumber<size_t> c(1);\n  EXPECT_EQ(1U, c.Value());\n  AtomicNumber<size_t> d(static_cast<size_t>(-1));\n  EXPECT_EQ(std::numeric_limits<size_t>::max(), d.Value());\n}\n\n\nTEST(AtomicNumber, SetValue) {\n  AtomicNumber<int> a(1);\n  a.SetValue(-1);\n  EXPECT_EQ(-1, a.Value());\n}\n\n\nTEST(AtomicNumber, Increment) {\n  AtomicNumber<int> a(std::numeric_limits<int>::max());\n  a.Increment(1);\n  EXPECT_EQ(std::numeric_limits<int>::min(), a.Value());\n  \/\/ Check that potential signed-ness of the underlying storage has no impact\n  \/\/ on unsigned types.\n  AtomicNumber<size_t> b(std::numeric_limits<intptr_t>::max());\n  b.Increment(1);\n  EXPECT_EQ(static_cast<size_t>(std::numeric_limits<intptr_t>::max()) + 1,\n            b.Value());\n  \/\/ Should work as decrement as well.\n  AtomicNumber<size_t> c(1);\n  c.Increment(-1);\n  EXPECT_EQ(0U, c.Value());\n  c.Increment(-1);\n  EXPECT_EQ(std::numeric_limits<size_t>::max(), c.Value());\n}\n\n\nnamespace {\n\nenum TestFlag {\n  kA,\n  kB,\n  kC,\n};\n\n}  \/\/ namespace\n\n\nTEST(AtomicValue, Initial) {\n  AtomicValue<TestFlag> a(kA);\n  EXPECT_EQ(TestFlag::kA, a.Value());\n}\n\n\nTEST(AtomicValue, TrySetValue) {\n  AtomicValue<TestFlag> a(kA);\n  EXPECT_FALSE(a.TrySetValue(kB, kC));\n  EXPECT_TRUE(a.TrySetValue(kA, kC));\n  EXPECT_EQ(TestFlag::kC, a.Value());\n}\n\n\nTEST(AtomicValue, SetValue) {\n  AtomicValue<TestFlag> a(kB);\n  EXPECT_EQ(kB, a.SetValue(kC));\n  EXPECT_EQ(TestFlag::kC, a.Value());\n}\n\n\nTEST(AtomicValue, WithVoidStar) {\n  AtomicValue<void*> a(nullptr);\n  AtomicValue<void*> dummy(nullptr);\n  EXPECT_EQ(nullptr, a.Value());\n  EXPECT_EQ(nullptr, a.SetValue(&a));\n  EXPECT_EQ(&a, a.Value());\n  EXPECT_FALSE(a.TrySetValue(nullptr, &dummy));\n  EXPECT_TRUE(a.TrySetValue(&a, &dummy));\n  EXPECT_EQ(&dummy, a.Value());\n}\n\n\nnamespace {\n\nenum TestSetValue { kAA, kBB, kCC, kLastValue = kCC };\n\n}  \/\/ namespace\n\n\nTEST(AtomicEnumSet, Constructor) {\n  AtomicEnumSet<TestSetValue> a;\n  EXPECT_TRUE(a.IsEmpty());\n  EXPECT_FALSE(a.Contains(kAA));\n}\n\n\nTEST(AtomicEnumSet, AddSingle) {\n  AtomicEnumSet<TestSetValue> a;\n  a.Add(kAA);\n  EXPECT_FALSE(a.IsEmpty());\n  EXPECT_TRUE(a.Contains(kAA));\n  EXPECT_FALSE(a.Contains(kBB));\n  EXPECT_FALSE(a.Contains(kCC));\n}\n\n\nTEST(AtomicEnumSet, AddOtherSet) {\n  AtomicEnumSet<TestSetValue> a;\n  AtomicEnumSet<TestSetValue> b;\n  a.Add(kAA);\n  EXPECT_FALSE(a.IsEmpty());\n  EXPECT_TRUE(b.IsEmpty());\n  b.Add(a);\n  EXPECT_FALSE(b.IsEmpty());\n  EXPECT_TRUE(a.Contains(kAA));\n  EXPECT_TRUE(b.Contains(kAA));\n}\n\n\nTEST(AtomicEnumSet, RemoveSingle) {\n  AtomicEnumSet<TestSetValue> a;\n  a.Add(kAA);\n  a.Add(kBB);\n  EXPECT_TRUE(a.Contains(kAA));\n  EXPECT_TRUE(a.Contains(kBB));\n  a.Remove(kAA);\n  EXPECT_FALSE(a.Contains(kAA));\n  EXPECT_TRUE(a.Contains(kBB));\n}\n\n\nTEST(AtomicEnumSet, RemoveOtherSet) {\n  AtomicEnumSet<TestSetValue> a;\n  AtomicEnumSet<TestSetValue> b;\n  a.Add(kAA);\n  a.Add(kBB);\n  b.Add(kBB);\n  a.Remove(b);\n  EXPECT_TRUE(a.Contains(kAA));\n  EXPECT_FALSE(a.Contains(kBB));\n  EXPECT_FALSE(a.Contains(kCC));\n}\n\n\nTEST(AtomicEnumSet, RemoveEmptySet) {\n  AtomicEnumSet<TestSetValue> a;\n  AtomicEnumSet<TestSetValue> b;\n  a.Add(kAA);\n  a.Add(kBB);\n  EXPECT_TRUE(a.Contains(kAA));\n  EXPECT_TRUE(a.Contains(kBB));\n  EXPECT_FALSE(a.Contains(kCC));\n  EXPECT_TRUE(b.IsEmpty());\n  a.Remove(b);\n  EXPECT_TRUE(a.Contains(kAA));\n  EXPECT_TRUE(a.Contains(kBB));\n  EXPECT_FALSE(a.Contains(kCC));\n}\n\n\nTEST(AtomicEnumSet, Intersect) {\n  AtomicEnumSet<TestSetValue> a;\n  AtomicEnumSet<TestSetValue> b;\n  a.Add(kAA);\n  b.Add(kCC);\n  a.Intersect(b);\n  EXPECT_TRUE(a.IsEmpty());\n}\n\n\nTEST(AtomicEnumSet, ContainsAnyOf) {\n  AtomicEnumSet<TestSetValue> a;\n  AtomicEnumSet<TestSetValue> b;\n  a.Add(kAA);\n  b.Add(kCC);\n  EXPECT_FALSE(a.ContainsAnyOf(b));\n  b.Add(kAA);\n  EXPECT_TRUE(a.ContainsAnyOf(b));\n}\n\n\nTEST(AtomicEnumSet, Equality) {\n  AtomicEnumSet<TestSetValue> a;\n  AtomicEnumSet<TestSetValue> b;\n  a.Add(kAA);\n  EXPECT_FALSE(a == b);\n  EXPECT_TRUE(a != b);\n  b.Add(kAA);\n  EXPECT_TRUE(a == b);\n  EXPECT_FALSE(a != b);\n}\n\n}  \/\/ namespace internal\n}  \/\/ namespace v8\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 \"volumefadereffect.h\"\n#include <QtCore\/QVector>\n\nnamespace Phonon\n{\nnamespace Fake\n{\nstatic const int SAMPLE_RATE = 44100;\nstatic const float SAMPLE_RATE_FLOAT = 44100.0f;\n\nVolumeFaderEffect::VolumeFaderEffect(QObject *parent)\n    : Effect(-1, parent), m_fadeTime(0)\n{\n}\n\nVolumeFaderEffect::~VolumeFaderEffect()\n{\n}\n\nfloat VolumeFaderEffect::volume() const\n{\n    if (m_fadeTime > 0)\n    {\n        float v = m_volume + (m_endvolume - m_volume) \/ m_fadeTime * m_fadeStart.elapsed();\n        if ((m_volume < m_endvolume && v > m_endvolume) || (m_volume > m_endvolume && v < m_endvolume))\n        {\n            VolumeFaderEffect *t = const_cast<VolumeFaderEffect *>(this);\n            t->m_volume = m_endvolume;\n            t->m_fadeTime = 0;\n        }\n        else\n            return v;\n    }\n    return m_volume;\n}\n\nvoid VolumeFaderEffect::setVolume(float volume)\n{\n    m_volume = volume;\n}\n\nPhonon::VolumeFaderEffect::FadeCurve VolumeFaderEffect::fadeCurve() const\n{\n    return m_fadeCurve;\n}\n\nvoid VolumeFaderEffect::setFadeCurve(Phonon::VolumeFaderEffect::FadeCurve curve)\n{\n    m_fadeCurve = curve;\n}\n\nvoid VolumeFaderEffect::fadeTo(float volume, int fadeTime)\n{\n    if (m_fadeTime > 0)\n        m_volume = this->volume();\n    m_fadeStart.start();\n    m_fadeTime = fadeTime;\n    m_endvolume = volume;\n    m_fadePosition = 0;\n    m_fadeLength = fadeTime * SAMPLE_RATE;\n}\n\nvoid VolumeFaderEffect::processBuffer(QVector<float> &buffer)\n{\n    \/\/ ignore the fade curve and do a linear fade\n\n    int bufferPos = 0;\n    while (m_fadePosition < m_fadeLength) {\n        if (bufferPos > buffer.size()) {\n            return;\n        }\n        buffer[bufferPos++] *= ++m_fadePosition * (m_endvolume - m_volume) \/ m_fadeLength + m_volume;\n    }\n}\n\n}} \/\/namespace Phonon::Fake\n\n#include \"moc_volumefadereffect.cpp\"\n\/\/ vim: sw=4 ts=4\n<commit_msg>enable-final fixes<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 \"volumefadereffect.h\"\n#include <QtCore\/QVector>\n\nnamespace Phonon\n{\nnamespace Fake\n{\nstatic const int VOLUMEFADEREFFECT_SAMPLE_RATE = 44100;\n\nVolumeFaderEffect::VolumeFaderEffect(QObject *parent)\n    : Effect(-1, parent), m_fadeTime(0)\n{\n}\n\nVolumeFaderEffect::~VolumeFaderEffect()\n{\n}\n\nfloat VolumeFaderEffect::volume() const\n{\n    if (m_fadeTime > 0)\n    {\n        float v = m_volume + (m_endvolume - m_volume) \/ m_fadeTime * m_fadeStart.elapsed();\n        if ((m_volume < m_endvolume && v > m_endvolume) || (m_volume > m_endvolume && v < m_endvolume))\n        {\n            VolumeFaderEffect *t = const_cast<VolumeFaderEffect *>(this);\n            t->m_volume = m_endvolume;\n            t->m_fadeTime = 0;\n        }\n        else\n            return v;\n    }\n    return m_volume;\n}\n\nvoid VolumeFaderEffect::setVolume(float volume)\n{\n    m_volume = volume;\n}\n\nPhonon::VolumeFaderEffect::FadeCurve VolumeFaderEffect::fadeCurve() const\n{\n    return m_fadeCurve;\n}\n\nvoid VolumeFaderEffect::setFadeCurve(Phonon::VolumeFaderEffect::FadeCurve curve)\n{\n    m_fadeCurve = curve;\n}\n\nvoid VolumeFaderEffect::fadeTo(float volume, int fadeTime)\n{\n    if (m_fadeTime > 0)\n        m_volume = this->volume();\n    m_fadeStart.start();\n    m_fadeTime = fadeTime;\n    m_endvolume = volume;\n    m_fadePosition = 0;\n    m_fadeLength = fadeTime * VOLUMEFADEREFFECT_SAMPLE_RATE;\n}\n\nvoid VolumeFaderEffect::processBuffer(QVector<float> &buffer)\n{\n    \/\/ ignore the fade curve and do a linear fade\n\n    int bufferPos = 0;\n    while (m_fadePosition < m_fadeLength) {\n        if (bufferPos > buffer.size()) {\n            return;\n        }\n        buffer[bufferPos++] *= ++m_fadePosition * (m_endvolume - m_volume) \/ m_fadeLength + m_volume;\n    }\n}\n\n}} \/\/namespace Phonon::Fake\n\n#include \"moc_volumefadereffect.cpp\"\n\/\/ vim: sw=4 ts=4\n<|endoftext|>"}
{"text":"<commit_before>#include \"mitkTimeSlicedGeometry.h\"\n#include <vtkTransform.h>\n\nmitk::Geometry3D* mitk::TimeSlicedGeometry::GetGeometry3D(int t) const\n{\n  mitk::Geometry3D::Pointer geometry3d = NULL;\n  if(IsValidTime(t))\n  {\n    geometry3d = m_Geometry3Ds[t];\n    \/\/if (a) we don't have a Geometry3D stored for the requested time, \n    \/\/(b) m_EvenlyTimed is activated and (c) the first geometry (t=0) \n    \/\/is set, then we clone the geometry and set the m_TimeBoundsInMS accordingly.\n    if((m_EvenlyTimed) && (geometry3d.IsNull()))\n    {\n      const Geometry3D* firstgeometry=m_Geometry3Ds[0].GetPointer();\n\n      assert(firstgeometry != NULL);\n\n      mitk::Geometry3D::Pointer requestedgeometry;\n      requestedgeometry = static_cast<Geometry3D*>(firstgeometry->Clone().GetPointer());\n\n      TimeBounds timebounds = requestedgeometry->GetTimeBoundsInMS();\n      if(timebounds[1]<ScalarTypeNumericTraits::max())\n      {\n        mitk::ScalarType later = (timebounds[1]-timebounds[0])*t;\n        timebounds[0]+=later; timebounds[1]+=later;\n        requestedgeometry->SetTimeBoundsInMS(timebounds);\n      }\n\n      geometry3d = requestedgeometry;\n      m_Geometry3Ds[t] = geometry3d;\n    }\n  }\n  else\n    return NULL;\n  return geometry3d;\n}\n\nconst mitk::TimeBounds& mitk::TimeSlicedGeometry::GetTimeBoundsInMS() const\n{\n  \/\/@todo calculation should be moved into a method and called when first or last time-slice is changed.\n  TimeBounds timebounds;\n\n  mitk::Geometry3D::Pointer geometry3d;\n\n  geometry3d = m_Geometry3Ds[0];\n  assert(geometry3d.IsNotNull());\n  timebounds[0] = geometry3d->GetTimeBoundsInMS()[0];\n\n  geometry3d = GetGeometry3D(m_TimeSteps-1);\n  assert(geometry3d.IsNotNull());\n  timebounds[1]=geometry3d->GetTimeBoundsInMS()[1];\n\n  m_TimeBoundsInMS = timebounds;\n\n  return m_TimeBoundsInMS;\n}\n\nbool mitk::TimeSlicedGeometry::SetGeometry3D(mitk::Geometry3D* geometry3D, int t)\n{\n  if(IsValidTime(t))\n  {\n    m_Geometry3Ds[t]=geometry3D;\n    return true;\n  }\n  return false;\n}\n\nint mitk::TimeSlicedGeometry::MSToTimeStep(mitk::ScalarType time_in_ms) const\n{\n  assert(m_EvenlyTimed);\n  {\n    if(time_in_ms < m_TimeBoundsInMS[0])\n      return -1;\n    if(time_in_ms >= m_TimeBoundsInMS[1])\n      return m_TimeSteps;\n    if(m_TimeBoundsInMS[0]==m_TimeBoundsInMS[1])\n      return 0;\n    if((m_TimeBoundsInMS[0]>-ScalarTypeNumericTraits::max()) && (m_TimeBoundsInMS[1]<ScalarTypeNumericTraits::max()))\n      return (int) ((time_in_ms - m_TimeBoundsInMS[0])\/(m_TimeBoundsInMS[1]-m_TimeBoundsInMS[0])*m_TimeSteps);\n    return 0;\n  }\n  return 0;\n}\n\nmitk::ScalarType mitk::TimeSlicedGeometry::TimeStepToMS(int timestep) const\n{\n  assert(m_EvenlyTimed);\n  if(IsValidTime(timestep)==false)\n    return ScalarTypeNumericTraits::max();\n  return ((mitk::ScalarType)timestep)\/m_TimeSteps*(m_TimeBoundsInMS[1]-m_TimeBoundsInMS[0])+m_TimeBoundsInMS[0];\n}\n\nvoid mitk::TimeSlicedGeometry::Initialize(unsigned int timeSteps)\n{\n  Superclass::Initialize();\n\n  m_TimeSteps = timeSteps;\n  \n  m_Geometry3Ds.clear();  \n\n  Geometry3D::Pointer gnull=NULL;\n \n  m_Geometry3Ds.reserve(m_TimeSteps);\n  m_Geometry3Ds.assign(m_TimeSteps, gnull);\n}\n\nvoid mitk::TimeSlicedGeometry::InitializeEvenlyTimed(mitk::Geometry3D* geometry3D, unsigned int timeSteps)\n{\n  assert(geometry3D!=NULL);\n\n  geometry3D->Register();\n\n  Initialize(timeSteps);\n\n  AffineTransform3D::Pointer transform = AffineTransform3D::New();\n  transform->SetMatrix(geometry3D->GetUnitsToMMAffineTransform()->GetMatrix());\n  transform->SetOffset(geometry3D->GetUnitsToMMAffineTransform()->GetOffset());\n  SetUnitsToMMAffineTransform(transform);\n\n  SetBounds(geometry3D->GetBounds());\n  SetGeometry3D(geometry3D, 0);\n  SetEvenlyTimed();\n  GetTimeBoundsInMS(); \/\/@todo see GetTimeBoundsInMS\n\n  geometry3D->UnRegister();\n}\n\nmitk::TimeSlicedGeometry::TimeSlicedGeometry() : m_TimeSteps(0), m_EvenlyTimed(false)\n{\n}\n\nmitk::TimeSlicedGeometry::~TimeSlicedGeometry()\n{\n\n}\n\nconst mitk::BoundingBox* mitk::TimeSlicedGeometry::GetBoundingBox() const\n{\n  mitk::BoundingBox::Pointer boundingBox=mitk::BoundingBox::New();\n \n  mitk::BoundingBox::PointsContainer::Pointer pointscontainer=mitk::BoundingBox::PointsContainer::New();\n  mitk::ScalarType nullpoint[]={0,0,0};\n  mitk::BoundingBox::PointType p(nullpoint);\n\n  unsigned int t;\n\n  mitk::Geometry3D* geometry3d;\n  mitk::BoundingBox::ConstPointer nextBoundingBox;\n  mitk::BoundingBox::PointIdentifier pointid=0;\n\n  for(t=0; t<m_TimeSteps; ++t)\n  {\n    geometry3d = GetGeometry3D(t);\n    assert(geometry3d!=NULL);\n    nextBoundingBox = geometry3d->GetBoundingBox();\n    assert(nextBoundingBox.IsNotNull());\n    const mitk::BoundingBox::PointsContainer * nextPoints = nextBoundingBox->GetPoints();\n    if(nextPoints!=NULL)\n    {\n      mitk::BoundingBox::PointsContainer::ConstIterator pointsIt = nextPoints->Begin();\n\n      while (pointsIt != nextPoints->End() )\n      {\n        pointscontainer->InsertElement( pointid++, pointsIt->Value());\n        ++pointsIt;\n      }\n    }\n  }\n\n  boundingBox->SetPoints(pointscontainer);\n\n  boundingBox->ComputeBoundingBox();\n\n  m_BoundingBox=boundingBox;\n\n  return boundingBox.GetPointer();\n}\n\nvoid mitk::TimeSlicedGeometry::SetEvenlyTimed(bool on)\n{\n  m_EvenlyTimed = on;\n  Modified();\n}\n\nbool mitk::TimeSlicedGeometry::IsValidTime(int t) const\n{\n  return (t>=0) && (t< (int)m_TimeSteps);\n}\n\nmitk::AffineGeometryFrame3D::Pointer mitk::TimeSlicedGeometry::Clone() const\n{\n  Self::Pointer newGeometry = Self::New();\n  newGeometry->Initialize(m_TimeSteps);\n  InitializeGeometry(newGeometry);\n  return newGeometry.GetPointer();\n}\n\nvoid mitk::TimeSlicedGeometry::InitializeGeometry(Self * newGeometry) const\n{\n  Superclass::InitializeGeometry(newGeometry);\n\n  newGeometry->SetEvenlyTimed(m_EvenlyTimed);\n\n  unsigned int t;\n  for(t=0; t<m_TimeSteps; ++t)\n  {\n    if(m_Geometry3Ds[t].IsNull())\n    {\n      assert(m_EvenlyTimed);\n    }\n    else\n    {\n      newGeometry->SetGeometry3D(dynamic_cast<Geometry3D*>(m_Geometry3Ds[t]->Clone().GetPointer()), t);\n    }\n  }\n}\n<commit_msg>commented out call to GetTimeBoundsInMS() in InitializeEvenlyTimed(...), since this produces a segmentation fault under linux...<commit_after>#include \"mitkTimeSlicedGeometry.h\"\n#include <vtkTransform.h>\n\nmitk::Geometry3D* mitk::TimeSlicedGeometry::GetGeometry3D(int t) const\n{\n  mitk::Geometry3D::Pointer geometry3d = NULL;\n  if(IsValidTime(t))\n  {\n    geometry3d = m_Geometry3Ds[t];\n    \/\/if (a) we don't have a Geometry3D stored for the requested time, \n    \/\/(b) m_EvenlyTimed is activated and (c) the first geometry (t=0) \n    \/\/is set, then we clone the geometry and set the m_TimeBoundsInMS accordingly.\n    if((m_EvenlyTimed) && (geometry3d.IsNull()))\n    {\n      const Geometry3D* firstgeometry=m_Geometry3Ds[0].GetPointer();\n\n      assert(firstgeometry != NULL);\n\n      mitk::Geometry3D::Pointer requestedgeometry;\n      requestedgeometry = static_cast<Geometry3D*>(firstgeometry->Clone().GetPointer());\n\n      TimeBounds timebounds = requestedgeometry->GetTimeBoundsInMS();\n      if(timebounds[1]<ScalarTypeNumericTraits::max())\n      {\n        mitk::ScalarType later = (timebounds[1]-timebounds[0])*t;\n        timebounds[0]+=later; timebounds[1]+=later;\n        requestedgeometry->SetTimeBoundsInMS(timebounds);\n      }\n\n      geometry3d = requestedgeometry;\n      m_Geometry3Ds[t] = geometry3d;\n    }\n  }\n  else\n    return NULL;\n  return geometry3d;\n}\n\nconst mitk::TimeBounds& mitk::TimeSlicedGeometry::GetTimeBoundsInMS() const\n{\n  \/\/@todo calculation should be moved into a method and called when first or last time-slice is changed.\n  TimeBounds timebounds;\n\n  mitk::Geometry3D::Pointer geometry3d;\n\n  geometry3d = m_Geometry3Ds[0];\n  assert(geometry3d.IsNotNull());\n  timebounds[0] = geometry3d->GetTimeBoundsInMS()[0];\n\n  geometry3d = GetGeometry3D(m_TimeSteps-1);\n  assert(geometry3d.IsNotNull());\n  timebounds[1]=geometry3d->GetTimeBoundsInMS()[1];\n\n  m_TimeBoundsInMS = timebounds;\n\n  return m_TimeBoundsInMS;\n}\n\nbool mitk::TimeSlicedGeometry::SetGeometry3D(mitk::Geometry3D* geometry3D, int t)\n{\n  if(IsValidTime(t))\n  {\n    m_Geometry3Ds[t]=geometry3D;\n    return true;\n  }\n  return false;\n}\n\nint mitk::TimeSlicedGeometry::MSToTimeStep(mitk::ScalarType time_in_ms) const\n{\n  assert(m_EvenlyTimed);\n  {\n    if(time_in_ms < m_TimeBoundsInMS[0])\n      return -1;\n    if(time_in_ms >= m_TimeBoundsInMS[1])\n      return m_TimeSteps;\n    if(m_TimeBoundsInMS[0]==m_TimeBoundsInMS[1])\n      return 0;\n    if((m_TimeBoundsInMS[0]>-ScalarTypeNumericTraits::max()) && (m_TimeBoundsInMS[1]<ScalarTypeNumericTraits::max()))\n      return (int) ((time_in_ms - m_TimeBoundsInMS[0])\/(m_TimeBoundsInMS[1]-m_TimeBoundsInMS[0])*m_TimeSteps);\n    return 0;\n  }\n  return 0;\n}\n\nmitk::ScalarType mitk::TimeSlicedGeometry::TimeStepToMS(int timestep) const\n{\n  assert(m_EvenlyTimed);\n  if(IsValidTime(timestep)==false)\n    return ScalarTypeNumericTraits::max();\n  return ((mitk::ScalarType)timestep)\/m_TimeSteps*(m_TimeBoundsInMS[1]-m_TimeBoundsInMS[0])+m_TimeBoundsInMS[0];\n}\n\nvoid mitk::TimeSlicedGeometry::Initialize(unsigned int timeSteps)\n{\n  Superclass::Initialize();\n\n  m_TimeSteps = timeSteps;\n  \n  m_Geometry3Ds.clear();  \n\n  Geometry3D::Pointer gnull=NULL;\n \n  m_Geometry3Ds.reserve(m_TimeSteps);\n  m_Geometry3Ds.assign(m_TimeSteps, gnull);\n}\n\nvoid mitk::TimeSlicedGeometry::InitializeEvenlyTimed(mitk::Geometry3D* geometry3D, unsigned int timeSteps)\n{\n  assert(geometry3D!=NULL);\n\n  geometry3D->Register();\n\n  Initialize(timeSteps);\n\n  AffineTransform3D::Pointer transform = AffineTransform3D::New();\n  transform->SetMatrix(geometry3D->GetUnitsToMMAffineTransform()->GetMatrix());\n  transform->SetOffset(geometry3D->GetUnitsToMMAffineTransform()->GetOffset());\n  SetUnitsToMMAffineTransform(transform);\n\n  SetBounds(geometry3D->GetBounds());\n  SetGeometry3D(geometry3D, 0);\n  SetEvenlyTimed();\n  \/\/\n  \/\/ commented out because this results in a\n  \/\/ segmentation fault under linux!\n  \/\/\n  \/\/GetTimeBoundsInMS(); \/\/@todo see GetTimeBoundsInMS\n\n  geometry3D->UnRegister();\n}\n\nmitk::TimeSlicedGeometry::TimeSlicedGeometry() : m_TimeSteps(0), m_EvenlyTimed(false)\n{\n}\n\nmitk::TimeSlicedGeometry::~TimeSlicedGeometry()\n{\n\n}\n\nconst mitk::BoundingBox* mitk::TimeSlicedGeometry::GetBoundingBox() const\n{\n  mitk::BoundingBox::Pointer boundingBox=mitk::BoundingBox::New();\n \n  mitk::BoundingBox::PointsContainer::Pointer pointscontainer=mitk::BoundingBox::PointsContainer::New();\n  mitk::ScalarType nullpoint[]={0,0,0};\n  mitk::BoundingBox::PointType p(nullpoint);\n\n  unsigned int t;\n\n  mitk::Geometry3D* geometry3d;\n  mitk::BoundingBox::ConstPointer nextBoundingBox;\n  mitk::BoundingBox::PointIdentifier pointid=0;\n\n  for(t=0; t<m_TimeSteps; ++t)\n  {\n    geometry3d = GetGeometry3D(t);\n    assert(geometry3d!=NULL);\n    nextBoundingBox = geometry3d->GetBoundingBox();\n    assert(nextBoundingBox.IsNotNull());\n    const mitk::BoundingBox::PointsContainer * nextPoints = nextBoundingBox->GetPoints();\n    if(nextPoints!=NULL)\n    {\n      mitk::BoundingBox::PointsContainer::ConstIterator pointsIt = nextPoints->Begin();\n\n      while (pointsIt != nextPoints->End() )\n      {\n        pointscontainer->InsertElement( pointid++, pointsIt->Value());\n        ++pointsIt;\n      }\n    }\n  }\n\n  boundingBox->SetPoints(pointscontainer);\n\n  boundingBox->ComputeBoundingBox();\n\n  m_BoundingBox=boundingBox;\n\n  return boundingBox.GetPointer();\n}\n\nvoid mitk::TimeSlicedGeometry::SetEvenlyTimed(bool on)\n{\n  m_EvenlyTimed = on;\n  Modified();\n}\n\nbool mitk::TimeSlicedGeometry::IsValidTime(int t) const\n{\n  return (t>=0) && (t< (int)m_TimeSteps);\n}\n\nmitk::AffineGeometryFrame3D::Pointer mitk::TimeSlicedGeometry::Clone() const\n{\n  Self::Pointer newGeometry = Self::New();\n  newGeometry->Initialize(m_TimeSteps);\n  InitializeGeometry(newGeometry);\n  return newGeometry.GetPointer();\n}\n\nvoid mitk::TimeSlicedGeometry::InitializeGeometry(Self * newGeometry) const\n{\n  Superclass::InitializeGeometry(newGeometry);\n\n  newGeometry->SetEvenlyTimed(m_EvenlyTimed);\n\n  unsigned int t;\n  for(t=0; t<m_TimeSteps; ++t)\n  {\n    if(m_Geometry3Ds[t].IsNull())\n    {\n      assert(m_EvenlyTimed);\n    }\n    else\n    {\n      newGeometry->SetGeometry3D(dynamic_cast<Geometry3D*>(m_Geometry3Ds[t]->Clone().GetPointer()), t);\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>revise the Initialize() function and constructor with the new ChShaft elements.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n* Mlock Allocator\n* (C) 2012,2014,2015 Jack Lloyd\n*\n* Botan is released under the Simplified BSD License (see license.txt)\n*\/\n\n#include <botan\/locking_allocator.h>\n#include <botan\/internal\/os_utils.h>\n#include <botan\/mem_ops.h>\n#include <algorithm>\n#include <cstdlib>\n#include <string>\n#include <botan\/mutex.h>\n\nnamespace Botan {\n\nnamespace {\n\nbool ptr_in_pool(const void* pool_ptr, size_t poolsize,\n                 const void* buf_ptr, size_t bufsize)\n   {\n   const uintptr_t pool = reinterpret_cast<uintptr_t>(pool_ptr);\n   const uintptr_t buf = reinterpret_cast<uintptr_t>(buf_ptr);\n   return (buf >= pool) && (buf + bufsize <= pool + poolsize);\n   }\n\nsize_t padding_for_alignment(size_t offset, size_t desired_alignment)\n   {\n   size_t mod = offset % desired_alignment;\n   if(mod == 0)\n      return 0; \/\/ already right on\n   return desired_alignment - mod;\n   }\n\n}\n\nvoid* mlock_allocator::allocate(size_t num_elems, size_t elem_size)\n   {\n   if(!m_pool)\n      return nullptr;\n\n   const size_t n = num_elems * elem_size;\n   const size_t alignment = 16;\n\n   if(n \/ elem_size != num_elems)\n      return nullptr; \/\/ overflow!\n\n   if(n > m_poolsize)\n      return nullptr;\n   if(n < BOTAN_MLOCK_ALLOCATOR_MIN_ALLOCATION || n > BOTAN_MLOCK_ALLOCATOR_MAX_ALLOCATION)\n      return nullptr;\n\n   lock_guard_type<mutex_type> lock(m_mutex);\n\n   auto best_fit = m_freelist.end();\n\n   for(auto i = m_freelist.begin(); i != m_freelist.end(); ++i)\n      {\n      \/\/ If we have a perfect fit, use it immediately\n      if(i->second == n && (i->first % alignment) == 0)\n         {\n         const size_t offset = i->first;\n         m_freelist.erase(i);\n         clear_mem(m_pool + offset, n);\n\n         BOTAN_ASSERT((reinterpret_cast<uintptr_t>(m_pool) + offset) % alignment == 0,\n                      \"Returning correctly aligned pointer\");\n\n         return m_pool + offset;\n         }\n\n      if((i->second >= (n + padding_for_alignment(i->first, alignment)) &&\n          ((best_fit == m_freelist.end()) || (best_fit->second > i->second))))\n         {\n         best_fit = i;\n         }\n      }\n\n   if(best_fit != m_freelist.end())\n      {\n      const size_t offset = best_fit->first;\n\n      const size_t alignment_padding = padding_for_alignment(offset, alignment);\n\n      best_fit->first += n + alignment_padding;\n      best_fit->second -= n + alignment_padding;\n\n      \/\/ Need to realign, split the block\n      if(alignment_padding)\n         {\n         \/*\n         If we used the entire block except for small piece used for\n         alignment at the beginning, so just update the entry already\n         in place (as it is in the correct location), rather than\n         deleting the empty range and inserting the new one in the\n         same location.\n         *\/\n         if(best_fit->second == 0)\n            {\n            best_fit->first = offset;\n            best_fit->second = alignment_padding;\n            }\n         else\n            m_freelist.insert(best_fit, std::make_pair(offset, alignment_padding));\n         }\n\n      clear_mem(m_pool + offset + alignment_padding, n);\n\n      BOTAN_ASSERT((reinterpret_cast<uintptr_t>(m_pool) + offset + alignment_padding) % alignment == 0,\n                   \"Returning correctly aligned pointer\");\n\n      return m_pool + offset + alignment_padding;\n      }\n\n   return nullptr;\n   }\n\nbool mlock_allocator::deallocate(void* p, size_t num_elems, size_t elem_size) BOTAN_NOEXCEPT\n   {\n   if(!m_pool)\n      return false;\n\n   size_t n = num_elems * elem_size;\n\n   \/*\n   We return nullptr in allocate if there was an overflow, so if an\n   overflow occurs here we know the pointer was not allocated by this pool.\n   *\/\n   if(n \/ elem_size != num_elems)\n      return false;\n\n   if(!ptr_in_pool(m_pool, m_poolsize, p, n))\n      return false;\n\n   std::memset(p, 0, n);\n\n   lock_guard_type<mutex_type> lock(m_mutex);\n\n   const size_t start = static_cast<uint8_t*>(p) - m_pool;\n\n   auto comp = [](std::pair<size_t, size_t> x, std::pair<size_t, size_t> y){ return x.first < y.first; };\n\n   auto i = std::lower_bound(m_freelist.begin(), m_freelist.end(),\n                             std::make_pair(start, 0), comp);\n\n   \/\/ try to merge with later block\n   if(i != m_freelist.end() && start + n == i->first)\n      {\n      i->first = start;\n      i->second += n;\n      n = 0;\n      }\n\n   \/\/ try to merge with previous block\n   if(i != m_freelist.begin())\n      {\n      auto prev = std::prev(i);\n\n      if(prev->first + prev->second == start)\n         {\n         if(n)\n            {\n            prev->second += n;\n            n = 0;\n            }\n         else\n            {\n            \/\/ merge adjoining\n            prev->second += i->second;\n            m_freelist.erase(i);\n            }\n         }\n      }\n\n   if(n != 0) \/\/ no merge possible?\n      m_freelist.insert(i, std::make_pair(start, n));\n\n   return true;\n   }\n\nmlock_allocator::mlock_allocator()\n   {\n   const size_t mem_to_lock = OS::get_memory_locking_limit();\n\n   \/*\n   TODO: split into multiple single page allocations to\n   help ASLR and guard pages to help reduce the damage of\n   a wild reads or write by the application.\n   *\/\n\n   if(mem_to_lock)\n      {\n      m_pool = static_cast<uint8_t*>(OS::allocate_locked_pages(mem_to_lock));\n\n      if(m_pool != nullptr)\n         {\n         m_poolsize = mem_to_lock;\n         m_freelist.push_back(std::make_pair(0, m_poolsize));\n         }\n      }\n   }\n\nmlock_allocator::~mlock_allocator()\n   {\n   if(m_pool)\n      {\n      secure_scrub_memory(m_pool, m_poolsize);\n      OS::free_locked_pages(m_pool, m_poolsize);\n      m_pool = nullptr;\n      }\n   }\n\nmlock_allocator& mlock_allocator::instance()\n   {\n   static mlock_allocator mlock;\n   return mlock;\n   }\n\n}\n<commit_msg>Small fiddly optimizations in locking_allocator<commit_after>\/*\n* Mlock Allocator\n* (C) 2012,2014,2015 Jack Lloyd\n*\n* Botan is released under the Simplified BSD License (see license.txt)\n*\/\n\n#include <botan\/locking_allocator.h>\n#include <botan\/internal\/os_utils.h>\n#include <botan\/mem_ops.h>\n#include <algorithm>\n#include <cstdlib>\n#include <string>\n#include <botan\/mutex.h>\n\nnamespace Botan {\n\nnamespace {\n\ninline bool ptr_in_pool(const void* pool_ptr, size_t poolsize,\n                        const void* buf_ptr, size_t bufsize)\n   {\n   const uintptr_t pool = reinterpret_cast<uintptr_t>(pool_ptr);\n   const uintptr_t buf = reinterpret_cast<uintptr_t>(buf_ptr);\n   return (buf >= pool) && (buf + bufsize <= pool + poolsize);\n   }\n\ninline size_t padding_for_alignment(size_t offset, size_t desired_alignment)\n   {\n   size_t mod = offset % desired_alignment;\n   if(mod == 0)\n      return 0; \/\/ already right on\n   return desired_alignment - mod;\n   }\n\n}\n\nvoid* mlock_allocator::allocate(size_t num_elems, size_t elem_size)\n   {\n   if(!m_pool)\n      return nullptr;\n\n   const size_t n = num_elems * elem_size;\n   const size_t alignment = 16;\n\n   if(n \/ elem_size != num_elems)\n      return nullptr; \/\/ overflow!\n\n   if(n > m_poolsize)\n      return nullptr;\n   if(n < BOTAN_MLOCK_ALLOCATOR_MIN_ALLOCATION || n > BOTAN_MLOCK_ALLOCATOR_MAX_ALLOCATION)\n      return nullptr;\n\n   lock_guard_type<mutex_type> lock(m_mutex);\n\n   auto best_fit = m_freelist.end();\n\n   for(auto i = m_freelist.begin(); i != m_freelist.end(); ++i)\n      {\n      \/\/ If we have a perfect fit, use it immediately\n      if(i->second == n && (i->first % alignment) == 0)\n         {\n         const size_t offset = i->first;\n         m_freelist.erase(i);\n         clear_mem(m_pool + offset, n);\n\n         BOTAN_ASSERT((reinterpret_cast<uintptr_t>(m_pool) + offset) % alignment == 0,\n                      \"Returning correctly aligned pointer\");\n\n         return m_pool + offset;\n         }\n\n\n      if(((best_fit == m_freelist.end()) || (best_fit->second > i->second)) &&\n         (i->second >= (n + padding_for_alignment(i->first, alignment))))\n         {\n         best_fit = i;\n         }\n      }\n\n   if(best_fit != m_freelist.end())\n      {\n      const size_t offset = best_fit->first;\n\n      const size_t alignment_padding = padding_for_alignment(offset, alignment);\n\n      best_fit->first += n + alignment_padding;\n      best_fit->second -= n + alignment_padding;\n\n      \/\/ Need to realign, split the block\n      if(alignment_padding)\n         {\n         \/*\n         If we used the entire block except for small piece used for\n         alignment at the beginning, so just update the entry already\n         in place (as it is in the correct location), rather than\n         deleting the empty range and inserting the new one in the\n         same location.\n         *\/\n         if(best_fit->second == 0)\n            {\n            best_fit->first = offset;\n            best_fit->second = alignment_padding;\n            }\n         else\n            m_freelist.insert(best_fit, std::make_pair(offset, alignment_padding));\n         }\n\n      clear_mem(m_pool + offset + alignment_padding, n);\n\n      BOTAN_ASSERT((reinterpret_cast<uintptr_t>(m_pool) + offset + alignment_padding) % alignment == 0,\n                   \"Returning correctly aligned pointer\");\n\n      return m_pool + offset + alignment_padding;\n      }\n\n   return nullptr;\n   }\n\nbool mlock_allocator::deallocate(void* p, size_t num_elems, size_t elem_size) BOTAN_NOEXCEPT\n   {\n   if(!m_pool)\n      return false;\n\n   size_t n = num_elems * elem_size;\n\n   \/*\n   We return nullptr in allocate if there was an overflow, so if an\n   overflow occurs here we know the pointer was not allocated by this pool.\n   *\/\n   if(n \/ elem_size != num_elems)\n      return false;\n\n   if(!ptr_in_pool(m_pool, m_poolsize, p, n))\n      return false;\n\n   std::memset(p, 0, n);\n\n   lock_guard_type<mutex_type> lock(m_mutex);\n\n   const size_t start = static_cast<uint8_t*>(p) - m_pool;\n\n   auto comp = [](std::pair<size_t, size_t> x, std::pair<size_t, size_t> y){ return x.first < y.first; };\n\n   auto i = std::lower_bound(m_freelist.begin(), m_freelist.end(),\n                             std::make_pair(start, 0), comp);\n\n   \/\/ try to merge with later block\n   if(i != m_freelist.end() && start + n == i->first)\n      {\n      i->first = start;\n      i->second += n;\n      n = 0;\n      }\n\n   \/\/ try to merge with previous block\n   if(i != m_freelist.begin())\n      {\n      auto prev = std::prev(i);\n\n      if(prev->first + prev->second == start)\n         {\n         if(n)\n            {\n            prev->second += n;\n            n = 0;\n            }\n         else\n            {\n            \/\/ merge adjoining\n            prev->second += i->second;\n            m_freelist.erase(i);\n            }\n         }\n      }\n\n   if(n != 0) \/\/ no merge possible?\n      m_freelist.insert(i, std::make_pair(start, n));\n\n   return true;\n   }\n\nmlock_allocator::mlock_allocator()\n   {\n   const size_t mem_to_lock = OS::get_memory_locking_limit();\n\n   \/*\n   TODO: split into multiple single page allocations to\n   help ASLR and guard pages to help reduce the damage of\n   a wild reads or write by the application.\n   *\/\n\n   if(mem_to_lock)\n      {\n      m_pool = static_cast<uint8_t*>(OS::allocate_locked_pages(mem_to_lock));\n\n      if(m_pool != nullptr)\n         {\n         m_poolsize = mem_to_lock;\n         m_freelist.push_back(std::make_pair(0, m_poolsize));\n         }\n      }\n   }\n\nmlock_allocator::~mlock_allocator()\n   {\n   if(m_pool)\n      {\n      secure_scrub_memory(m_pool, m_poolsize);\n      OS::free_locked_pages(m_pool, m_poolsize);\n      m_pool = nullptr;\n      }\n   }\n\nmlock_allocator& mlock_allocator::instance()\n   {\n   static mlock_allocator mlock;\n   return mlock;\n   }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * test_border_activity.cpp\n *\n *  Created on: Feb 11, 2010\n *      Author: Craig Rasmussen\n *\n * This file tests activity near extended borders.  With mirror boundary\n * conditions a uniform retinal input should produce uniform output across\n * the post-synaptic layer.\n *\/\n\n#include \"cMakeHeader.h\"\n#include \"columns\/HyPerCol.hpp\"\n#include \"connections\/HyPerConn.hpp\"\n#include \"layers\/ANNLayer.hpp\"\n#include \"layers\/PvpLayer.hpp\"\n#include \"layers\/Retina.hpp\"\n#include \"probes\/PointProbe.hpp\"\n#include \"utils\/PVLog.hpp\"\n#include \"weightinit\/InitUniformWeights.hpp\"\n\n#undef DEBUG_OUTPUT\n\n\/\/ The activity in L1 given a 7x7 weight patch,\n\/\/ with all weights initialized to 1.\n\/\/\n#define UNIFORM_ACTIVITY_VALUE 49\n\nusing namespace PV;\n\nint check_activity(HyPerLayer *l);\n\nint main(int argc, char *argv[]) {\n\n   int status = 0;\n\n   int rank         = 0;\n   PV_Init *initObj = new PV_Init(&argc, &argv, false \/*allowUnrecognizedArguments*\/);\n\n   if (initObj->getParams() != nullptr) {\n      if (rank == 0) {\n         ErrorLog().printf(\n               \"%s does not take -p as an option.  Instead the necessary params file is \"\n               \"hard-coded.\\n\",\n               argv[0]);\n      }\n      MPI_Barrier(MPI_COMM_WORLD);\n      exit(EXIT_FAILURE);\n   }\n\n   initObj->setParams(\"input\/test_border_activity.params\");\n\n   HyPerCol *hc = new PV::HyPerCol(initObj);\n\n   const char *imageLayerName  = \"test_border_activity_image\";\n   const char *retinaLayerName = \"test_border_activity_retina\";\n   const char *l1LayerName     = \"test_border_activity_layer\";\n\n   PvpLayer *image = dynamic_cast<PvpLayer *>(hc->getObjectFromName(imageLayerName));\n   assert(image);\n   Retina *retina = dynamic_cast<Retina *>(hc->getObjectFromName(retinaLayerName));\n   assert(retina);\n   ANNLayer *l1 = dynamic_cast<ANNLayer *>(hc->getObjectFromName(l1LayerName));\n   assert(l1);\n\n   HyPerConn *conn1 =\n         dynamic_cast<HyPerConn *>(hc->getObjectFromName(\"test_border_activity_connection1\"));\n   FatalIf(!(conn1), \"Test failed.\\n\");\n   HyPerConn *conn2 =\n         dynamic_cast<HyPerConn *>(hc->getObjectFromName(\"test_border_activity_connection2\"));\n   FatalIf(!(conn2), \"Test failed.\\n\");\n\n#ifdef DEBUG_OUTPUT\n   PointProbe *p1 = new PointProbe(0, 0, 0, \"L1 (0,0,0):\");\n   PointProbe *p2 = new PointProbe(32, 32, 32, \"L1 (32,32,0):\");\n   l1->insertProbe(p1);\n   l1->insertProbe(p2);\n#endif\n\n   \/\/ run the simulation\n   hc->run();\n\n   status = check_activity(l1);\n\n   delete hc;\n\n   delete initObj;\n\n   return status;\n}\n\nint check_activity(HyPerLayer *l) {\n   int status = 0;\n\n   const int nx = l->getLayerLoc()->nx;\n   const int ny = l->getLayerLoc()->ny;\n   const int nf = l->getLayerLoc()->nf;\n\n   const int nk = l->getNumNeurons();\n   FatalIf(!(nk == nx * ny * nf), \"Test failed.\\n\");\n\n   auto *activityComponent = l->getComponentByType<ActivityComponent>();\n   auto *activityBuffer    = activityComponent->getComponentByType<ActivityBuffer>();\n   float const *activity   = activityBuffer->getBufferData();\n   for (int k = 0; k < nk; k++) {\n      int a = (int)activity[k];\n      if (a != UNIFORM_ACTIVITY_VALUE) {\n         status = -1;\n         ErrorLog().printf(\"test_border_activity: activity==%d != %d\\n\", a, UNIFORM_ACTIVITY_VALUE);\n         return status;\n      }\n   }\n   return status;\n}\n<commit_msg>Improvements to test_border_activity<commit_after>\/**\n * test_border_activity.cpp\n *\n *  Created on: Feb 11, 2010\n *      Author: Craig Rasmussen\n *\n * This file tests activity near extended borders.  With mirror boundary\n * conditions a uniform retinal input should produce uniform output across\n * the post-synaptic layer.\n *\/\n\n#include \"cMakeHeader.h\"\n#include \"columns\/HyPerCol.hpp\"\n#include \"connections\/HyPerConn.hpp\"\n#include \"layers\/ANNLayer.hpp\"\n#include \"layers\/PvpLayer.hpp\"\n#include \"layers\/Retina.hpp\"\n#include \"probes\/PointProbe.hpp\"\n#include \"utils\/PVLog.hpp\"\n#include \"weightinit\/InitUniformWeights.hpp\"\n\n#undef DEBUG_OUTPUT\n\n\/\/ The activity in L1 given a 7x7 weight patch,\n\/\/ with all weights initialized to 1.\n\/\/\n#define UNIFORM_ACTIVITY_VALUE 49\n\nusing namespace PV;\n\nint check_activity(HyPerLayer *l);\n\nint main(int argc, char *argv[]) {\n\n   int status = 0;\n\n   int rank         = 0;\n   PV_Init *initObj = new PV_Init(&argc, &argv, false \/*allowUnrecognizedArguments*\/);\n\n   if (initObj->getParams() != nullptr) {\n      if (rank == 0) {\n         ErrorLog().printf(\n               \"%s does not take -p as an option.  Instead the necessary params file is \"\n               \"hard-coded.\\n\",\n               argv[0]);\n      }\n      MPI_Barrier(MPI_COMM_WORLD);\n      exit(EXIT_FAILURE);\n   }\n\n   initObj->setParams(\"input\/test_border_activity.params\");\n\n   HyPerCol *hc = new PV::HyPerCol(initObj);\n\n   const char *l1LayerName = \"test_border_activity_layer\";\n   ANNLayer *l1            = dynamic_cast<ANNLayer *>(hc->getObjectFromName(l1LayerName));\n   FatalIf(!l1, \"Unable to find layer \\\"%s\\\"\\n\", l1LayerName);\n\n   HyPerConn *conn1 =\n         dynamic_cast<HyPerConn *>(hc->getObjectFromName(\"test_border_activity_connection1\"));\n   FatalIf(!conn1, \"Test failed.\\n\");\n   HyPerConn *conn2 =\n         dynamic_cast<HyPerConn *>(hc->getObjectFromName(\"test_border_activity_connection2\"));\n   FatalIf(!conn2, \"Test failed.\\n\");\n\n#ifdef DEBUG_OUTPUT\n   PointProbe *p1 = new PointProbe(0, 0, 0, \"L1 (0,0,0):\");\n   PointProbe *p2 = new PointProbe(32, 32, 32, \"L1 (32,32,0):\");\n   l1->insertProbe(p1);\n   l1->insertProbe(p2);\n#endif\n\n   \/\/ run the simulation\n   hc->run();\n\n   status = check_activity(l1);\n\n   delete hc;\n\n   delete initObj;\n\n   return status;\n}\n\nint check_activity(HyPerLayer *l) {\n   int status = 0;\n\n   const int nx = l->getLayerLoc()->nx;\n   const int ny = l->getLayerLoc()->ny;\n   const int nf = l->getLayerLoc()->nf;\n\n   const int nk = l->getNumNeurons();\n   FatalIf(nk != nx * ny * nf, \"%s NumNeurons does not match nx*ny*nf.\\n\", l->getDescription_c());\n\n   auto *activityComponent = l->getComponentByType<ActivityComponent>();\n   auto *activityBuffer    = activityComponent->getComponentByType<ActivityBuffer>();\n   float const *activity   = activityBuffer->getBufferData();\n   for (int k = 0; k < nk; k++) {\n      int a = (int)activity[k];\n      if (a != UNIFORM_ACTIVITY_VALUE) {\n         status = -1;\n         ErrorLog().printf(\"test_border_activity: activity==%d != %d\\n\", a, UNIFORM_ACTIVITY_VALUE);\n         return status;\n      }\n   }\n   return status;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/-*- Mode: C++ -*-\n \/**************************************************************************\n * This file is property of and copyright by the ALICE HLT Project        *\n * All rights reserved.                                                   *\n *                                                                        *\n * Primary Authors: Svein Lindal, Oeystein Djuvsland                      * \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 * @file   AliHLTCaloHistoComponent.cxx\n * @author Svein Lindal\n * @date   \n * @brief  A physics histogram producer component for Calo HLT\n*\/\n\n#if __GNUC__>= 3\nusing namespace std;\n#endif\n\n\n#include \"AliHLTCaloHistoComponent.h\"\n#include \"AliHLTCaloHistoCellEnergy.h\"\n#include \"AliHLTCaloHistoClusterEnergy.h\"\n#include \"AliHLTCaloHistoInvMass.h\"\n#include \"AliHLTCaloHistoMatchedTracks.h\"\n#include \"AliESDEvent.h\"\n#include \"TRefArray.h\"\n#include \"AliHLTCaloClusterDataStruct.h\"\n#include \"AliHLTCaloClusterReader.h\"\n#include \"TObjArray.h\"\n\n\/\/ see below for class documentation\n\/\/ or\n\/\/ refer to README to build package\n\/\/ or\n\/\/ visit http:\/\/web.ift.uib.no\/~kjeks\/doc\/alice-hlt\n\n\nAliHLTCaloHistoComponent gAliHLTCaloHistoComponent;\n\nClassImp(AliHLTCaloHistoComponent);\n\nAliHLTCaloHistoComponent::AliHLTCaloHistoComponent() :\n  AliHLTProcessor(),\n  fClusterReader(NULL),\n  fEmcalClustersArray(NULL),\n  fPhosClustersArray(NULL),\n  fPhosProducerArray(NULL),\n  fEmcalProducerArray(NULL),\n  fPhosHistogramArray(NULL),\n  fEmcalHistogramArray(NULL),\n  fDoEmcal(kFALSE),\n  fDoPhos(kFALSE),\n  fCutOnCentrality(kFALSE),\n  fCentralityCut(0.9),\n  fCentralityCutEnergy(0.5)\n{\n  \/\/see header file for documentation\n}\n\nAliHLTCaloHistoComponent::~AliHLTCaloHistoComponent() \n{\n  \/\/see header file for documentation\n  \/\/Deinit();\n}\n\nInt_t AliHLTCaloHistoComponent::DoInit(int argc, const char** argv ) {\n  \/\/see header file for documentation\n  \n  TString allArgs = \"\";\n  \n  for ( int i = 0; i < argc; i++ ) {\n    if ( !allArgs.IsNull() ) allArgs += \" \";\n    allArgs += argv[i];\n  }\n\n  HLTImportant(\"Configuring with string \\\"%s\\\"\", allArgs.Data());\n\n  \n  fEmcalProducerArray = new TObjArray();\n  fEmcalProducerArray->SetOwner(kTRUE);\n  fPhosProducerArray = new TObjArray();\n  fPhosProducerArray->SetOwner(kTRUE);\n\n\n  fEmcalHistogramArray = new TObjArray();\n  fEmcalHistogramArray->SetOwner(kFALSE);\n  fPhosHistogramArray = new TObjArray();\n  fPhosHistogramArray->SetOwner(kFALSE);\n\n\n  \/\/Configure the component\n  bool doPhos = true;\n  bool doEmcal = true;\n\n  \n  for(int i = 0; i < argc; i++) {\n    \n    if(!strcmp(\"-phos\", argv[i])) {\n      fDoPhos = kTRUE;\n      doPhos = true;\n      doEmcal = false;\n    }\n\n    else if(!strcmp(\"-emcal\", argv[i])) {\n      fDoEmcal = kTRUE;\n      doEmcal = true;\n      doPhos = false;\n    }\n\n    else if(!strcmp(\"-both\", argv[i])) {\n      fDoEmcal = kTRUE;\n      fDoPhos = kTRUE;\n      doEmcal = true;\n      doPhos = true;\n    }\n    \n    else if(!strcmp(\"-clusterenergy\", argv[i])){\n      if(doEmcal){\n\tAliHLTCaloHistoClusterEnergy * histo = new AliHLTCaloHistoClusterEnergy(\"EMCAL\");\n\tfEmcalProducerArray->AddLast(dynamic_cast<TObject*>(histo));\n\tHLTImportant(\"Adding EMCAL cluster energy histogram\");\n      }\t\n      if(doPhos){\n\tAliHLTCaloHistoClusterEnergy * histo = new AliHLTCaloHistoClusterEnergy(\"PHOS\");\n\tfPhosProducerArray->AddLast(dynamic_cast<TObject*>(histo));\n\tHLTImportant(\"Adding PHOS cluster energy histogram\");\n      }\n    } \n\n    else if(!strcmp(\"-invariantmass\", argv[i])){\n      if(doEmcal){\n\tAliHLTCaloHistoInvMass * histo = new AliHLTCaloHistoInvMass(\"EMCAL\");\n\tfEmcalProducerArray->AddLast(dynamic_cast<TObject*>(histo));\n\tHLTImportant(\"Adding EMCAL invariant mass histogram\");\n      }\t\n      if(doPhos){\n\tAliHLTCaloHistoInvMass * histo = new AliHLTCaloHistoInvMass(\"PHOS\");\n\tfPhosProducerArray->AddLast(dynamic_cast<TObject*>(histo));\n\tHLTImportant(\"Adding PHOS invariant mass histogram\");\n      }\n    } \n   \n    else if(!strcmp(\"-matchedtracks\", argv[i])) {\n      if(doEmcal){\n\tAliHLTCaloHistoMatchedTracks * histo = new AliHLTCaloHistoMatchedTracks(\"EMCAL\");\n\tfEmcalProducerArray->AddLast(dynamic_cast<TObject*>(histo));\n\tHLTImportant(\"Adding EMCAL track-matching histograms\");\n      }\t\n      if(doPhos){\n\tAliHLTCaloHistoMatchedTracks * histo = new AliHLTCaloHistoMatchedTracks(\"PHOS\");\n\tfPhosProducerArray->AddLast(dynamic_cast<TObject*>(histo));\n\tHLTImportant(\"Adding PHOS track-matching histograms\");\n      }\n    } \n    \n      else if(!strcmp(\"-cutoncentrality\", argv[i])) {\n\t fCentralityCut = kTRUE;\n\t HLTImportant(\"Cutting on centrality\");\n\t  \n      }\n   \n     \n    else {\n      HLTError(\"Unknown argument \\\"%s\\\"\", argv[i]);\n    }\n\n\n  }\n    \n  if(fDoPhos)\n    fPhosClustersArray = new TRefArray();\n  if(fDoEmcal)\n    fEmcalClustersArray = new TRefArray();\n  \n  fClusterReader = new AliHLTCaloClusterReader();\n  \n  return 0;\n}\n\n\nInt_t AliHLTCaloHistoComponent::DoDeinit()\n{ \n  \/\/see header file for documentation\n\n  if(fEmcalClustersArray)\n    delete fEmcalClustersArray;\n  fEmcalClustersArray = NULL;\n\n  if(fPhosClustersArray)\n    delete fPhosClustersArray;\n  fPhosClustersArray = NULL;\n\n  \/\/Deleting these should also destroy histogram producers!!?\n  if(fEmcalProducerArray)\n    delete fEmcalProducerArray;\n  fEmcalProducerArray = NULL;\n \n if(fPhosProducerArray)\n    delete fPhosProducerArray;\n  fPhosProducerArray = NULL;\n \n\n  if(fEmcalHistogramArray)\n    delete fEmcalHistogramArray;\n  fEmcalHistogramArray = NULL;\n  \n  if(fPhosHistogramArray)\n    delete fPhosHistogramArray;\n  fPhosHistogramArray = NULL;\n \n  return 0;\n}\n\nconst char* AliHLTCaloHistoComponent::GetComponentID()\n{\n  \/\/see header file for documentation\n  return \"CaloPhysicsHistos\";\n}\n\n\nvoid\nAliHLTCaloHistoComponent::GetInputDataTypes(vector<AliHLTComponentDataType>& list)\n{ \n  \/\/see header file for documentation\n  list.clear();\n  list.push_back( kAliHLTDataTypeESDObject | kAliHLTDataOriginOut );\n  list.push_back( kAliHLTDataTypeCaloCluster | kAliHLTDataOriginEMCAL );\n  list.push_back( kAliHLTDataTypeCaloCluster | kAliHLTDataOriginPHOS );\n\n  \/\/   list.push_back(AliHLTPHOSDefinitions::fgkClusterDataType);\n  \/\/   list.push_back(AliHLTPHOSDefinitions::fgkESDCaloClusterDataType);\n  \/\/   list.push_back(AliHLTPHOSDefinitions::fgkESDCaloCellsDataType);\n\n}\n\nAliHLTComponentDataType AliHLTCaloHistoComponent::GetOutputDataType()\n{\n  \/\/see header file for documentation\n  return kAliHLTDataTypeHistogram  | kAliHLTDataOriginAny ;\n}\n\n\nvoid AliHLTCaloHistoComponent::GetOutputDataSize(unsigned long& constBase, double& inputMultiplier)\n{\n  \/\/see header file for documentation\n  constBase = 30;\n  inputMultiplier = 5;\n}\n\nAliHLTComponent* AliHLTCaloHistoComponent::Spawn() {\n  \/\/see header file for documentation\n  return new AliHLTCaloHistoComponent();\n}\n\nInt_t AliHLTCaloHistoComponent::DoEvent(const AliHLTComponentEventData& \/*evtData*\/, AliHLTComponentTriggerData& \/*trigData*\/) {\n\n  fPhosHistogramArray->Clear();\n  fEmcalHistogramArray->Clear();\n\n\n  \/\/see header file for documentation\n  Int_t iResult = 0;\n\n\n  if ( GetFirstInputBlock( kAliHLTDataTypeSOR ) || GetFirstInputBlock( kAliHLTDataTypeEOR ) )\n    return 0;\n\n  \n  if (fDoEmcal) {\n    for (const AliHLTComponentBlockData* pBlock=GetFirstInputBlock( kAliHLTDataTypeCaloCluster | kAliHLTDataOriginEMCAL ); pBlock!=NULL; pBlock=GetNextInputBlock()) {\n      ProcessBlocks(pBlock, fEmcalProducerArray);\n    }\n  }\n\n  if (fDoPhos) {\n    for (const AliHLTComponentBlockData* pBlock=GetFirstInputBlock( kAliHLTDataTypeCaloCluster | kAliHLTDataOriginPHOS ); pBlock!=NULL; pBlock=GetNextInputBlock()) {\n      ProcessBlocks(pBlock, fPhosProducerArray);\n    }\n  }\n\n  \/\/Get histograms from all producers and push back in one block\n  for(int ih = 0; ih < fPhosProducerArray->GetEntriesFast(); ih++) {\n    fPhosHistogramArray->AddAll(static_cast<AliHLTCaloHistoProducer*>(fPhosProducerArray->At(ih))->GetHistograms());\n    \/\/    PushBack(static_cast<AliHLTCaloHistoProducer*>(fPhosProducerArray->At(ih))->GetHistograms(), kAliHLTDataTypeHistogram | kAliHLTDataOriginPHOS );\n    \n  }\n  PushBack(fPhosHistogramArray, kAliHLTDataTypeHistogram | kAliHLTDataOriginPHOS );\n\n  for(int ih = 0; ih < fEmcalProducerArray->GetEntriesFast(); ih++) {\n    fEmcalHistogramArray->AddAll(static_cast<AliHLTCaloHistoProducer*>(fEmcalProducerArray->At(ih))->GetHistograms() );\n    \/\/    PushBack(static_cast<AliHLTCaloHistoProducer*>(fEmcalProducerArray->At(ih))->GetHistograms(), kAliHLTDataTypeHistogram | kAliHLTDataOriginEMCAL );\n  }\n  PushBack(fEmcalHistogramArray, kAliHLTDataTypeHistogram | kAliHLTDataOriginEMCAL );\n\n  return iResult;\n\n}\n\n\nInt_t AliHLTCaloHistoComponent::ProcessBlocks(const AliHLTComponentBlockData * pBlock, TObjArray * histoArray) {\n\n  Int_t iResult = 0;\n\n  AliHLTCaloClusterDataStruct * clusterStruct;\n  vector<AliHLTCaloClusterDataStruct*> clustersVector;\n  \n  AliHLTCaloClusterHeaderStruct *clusterHeader = reinterpret_cast<AliHLTCaloClusterHeaderStruct*>(pBlock->fPtr);\n  fClusterReader->SetMemory(clusterHeader);\n     \n  if ( (clusterHeader->fNClusters) < 0) {\n    HLTError(\"Event has negative number of clusters: %d! Very bad for vector resizing\", (Int_t) (clusterHeader->fNClusters));\n    return -1;\n  }\n  \n  clustersVector.reserve((int) (clusterHeader->fNClusters)); \n  Int_t nClusters = 0;\n  Double_t ampFrac;\n  UShort_t cellId;\n  Bool_t cutCluster = false;\n  while( (clusterStruct = fClusterReader->NextCluster()) != 0) {\n    cutCluster = false;\n      if(fCutOnCentrality){\n\t if(clusterStruct->fEnergy > fCentralityCutEnergy) {\n\t    for(UInt_t i = 0; i < clusterStruct->fNCells; i++) {\n\t       fClusterReader->GetCell(clusterStruct, cellId, ampFrac, i);\n\t       if(ampFrac > fCentralityCut) {\n\t\t  cutCluster = true;\n\t\t  break;\n\t       }\n\t    }\n\t }\n      }\n    \n    if(!cutCluster) {\n      clustersVector.push_back(clusterStruct);  \n    }\n  }\n  \n  nClusters = clustersVector.size();\n  \n  for(int ih = 0; ih < histoArray->GetEntriesFast(); ih++) {\n    iResult = static_cast<AliHLTCaloHistoProducer*>(histoArray->At(ih))->FillHistograms(nClusters, clustersVector);\n  }\n  \n  return iResult;\n}\n<commit_msg>- added possibility to set centrality cuts from the commandline<commit_after>\/\/-*- Mode: C++ -*-\n \/**************************************************************************\n * This file is property of and copyright by the ALICE HLT Project        *\n * All rights reserved.                                                   *\n *                                                                        *\n * Primary Authors: Svein Lindal, Oeystein Djuvsland                      * \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 * @file   AliHLTCaloHistoComponent.cxx\n * @author Svein Lindal\n * @date   \n * @brief  A physics histogram producer component for Calo HLT\n*\/\n\n#if __GNUC__>= 3\nusing namespace std;\n#endif\n\n\n#include \"AliHLTCaloHistoComponent.h\"\n#include \"AliHLTCaloHistoCellEnergy.h\"\n#include \"AliHLTCaloHistoClusterEnergy.h\"\n#include \"AliHLTCaloHistoInvMass.h\"\n#include \"AliHLTCaloHistoMatchedTracks.h\"\n#include \"AliESDEvent.h\"\n#include \"TRefArray.h\"\n#include \"AliHLTCaloClusterDataStruct.h\"\n#include \"AliHLTCaloClusterReader.h\"\n#include \"TObjArray.h\"\n\n\/\/ see below for class documentation\n\/\/ or\n\/\/ refer to README to build package\n\/\/ or\n\/\/ visit http:\/\/web.ift.uib.no\/~kjeks\/doc\/alice-hlt\n\n\nAliHLTCaloHistoComponent gAliHLTCaloHistoComponent;\n\nClassImp(AliHLTCaloHistoComponent);\n\nAliHLTCaloHistoComponent::AliHLTCaloHistoComponent() :\n  AliHLTProcessor(),\n  fClusterReader(NULL),\n  fEmcalClustersArray(NULL),\n  fPhosClustersArray(NULL),\n  fPhosProducerArray(NULL),\n  fEmcalProducerArray(NULL),\n  fPhosHistogramArray(NULL),\n  fEmcalHistogramArray(NULL),\n  fDoEmcal(kFALSE),\n  fDoPhos(kFALSE),\n  fCutOnCentrality(kFALSE),\n  fCentralityCut(0.9),\n  fCentralityCutEnergy(0.5)\n{\n  \/\/see header file for documentation\n}\n\nAliHLTCaloHistoComponent::~AliHLTCaloHistoComponent() \n{\n  \/\/see header file for documentation\n  \/\/Deinit();\n}\n\nInt_t AliHLTCaloHistoComponent::DoInit(int argc, const char** argv ) {\n  \/\/see header file for documentation\n  \n  TString allArgs = \"\";\n  \n  for ( int i = 0; i < argc; i++ ) {\n    if ( !allArgs.IsNull() ) allArgs += \" \";\n    allArgs += argv[i];\n  }\n\n  HLTImportant(\"Configuring with string \\\"%s\\\"\", allArgs.Data());\n\n  \n  fEmcalProducerArray = new TObjArray();\n  fEmcalProducerArray->SetOwner(kTRUE);\n  fPhosProducerArray = new TObjArray();\n  fPhosProducerArray->SetOwner(kTRUE);\n\n\n  fEmcalHistogramArray = new TObjArray();\n  fEmcalHistogramArray->SetOwner(kFALSE);\n  fPhosHistogramArray = new TObjArray();\n  fPhosHistogramArray->SetOwner(kFALSE);\n\n\n  \/\/Configure the component\n  bool doPhos = true;\n  bool doEmcal = true;\n\n  \n  for(int i = 0; i < argc; i++) {\n    \n    if(!strcmp(\"-phos\", argv[i])) {\n      fDoPhos = kTRUE;\n      doPhos = true;\n      doEmcal = false;\n    }\n\n    else if(!strcmp(\"-emcal\", argv[i])) {\n      fDoEmcal = kTRUE;\n      doEmcal = true;\n      doPhos = false;\n    }\n\n    else if(!strcmp(\"-both\", argv[i])) {\n      fDoEmcal = kTRUE;\n      fDoPhos = kTRUE;\n      doEmcal = true;\n      doPhos = true;\n    }\n    \n    else if(!strcmp(\"-clusterenergy\", argv[i])){\n      if(doEmcal){\n\tAliHLTCaloHistoClusterEnergy * histo = new AliHLTCaloHistoClusterEnergy(\"EMCAL\");\n\tfEmcalProducerArray->AddLast(dynamic_cast<TObject*>(histo));\n\tHLTImportant(\"Adding EMCAL cluster energy histogram\");\n      }\t\n      if(doPhos){\n\tAliHLTCaloHistoClusterEnergy * histo = new AliHLTCaloHistoClusterEnergy(\"PHOS\");\n\tfPhosProducerArray->AddLast(dynamic_cast<TObject*>(histo));\n\tHLTImportant(\"Adding PHOS cluster energy histogram\");\n      }\n    } \n\n    else if(!strcmp(\"-invariantmass\", argv[i])){\n      if(doEmcal){\n\tAliHLTCaloHistoInvMass * histo = new AliHLTCaloHistoInvMass(\"EMCAL\");\n\tfEmcalProducerArray->AddLast(dynamic_cast<TObject*>(histo));\n\tHLTImportant(\"Adding EMCAL invariant mass histogram\");\n      }\t\n      if(doPhos){\n\tAliHLTCaloHistoInvMass * histo = new AliHLTCaloHistoInvMass(\"PHOS\");\n\tfPhosProducerArray->AddLast(dynamic_cast<TObject*>(histo));\n\tHLTImportant(\"Adding PHOS invariant mass histogram\");\n      }\n    } \n   \n    else if(!strcmp(\"-matchedtracks\", argv[i])) {\n      if(doEmcal){\n\tAliHLTCaloHistoMatchedTracks * histo = new AliHLTCaloHistoMatchedTracks(\"EMCAL\");\n\tfEmcalProducerArray->AddLast(dynamic_cast<TObject*>(histo));\n\tHLTImportant(\"Adding EMCAL track-matching histograms\");\n      }\t\n      if(doPhos){\n\tAliHLTCaloHistoMatchedTracks * histo = new AliHLTCaloHistoMatchedTracks(\"PHOS\");\n\tfPhosProducerArray->AddLast(dynamic_cast<TObject*>(histo));\n\tHLTImportant(\"Adding PHOS track-matching histograms\");\n      }\n    } \n    \n      else if(!strcmp(\"-cutoncentrality\", argv[i])) {\n\t fCutOnCentrality = kTRUE;\n\t HLTImportant(\"Cutting on centrality\");\n      }\n      else if(!strcmp(\"-centralityenergycut\", argv[i])) {\n\t fCentralityCutEnergy = atof(argv[i+1]);\n\t HLTImportant(\"Cutting on centrality for clusters with energy > %f\", fCentralityCutEnergy);\n      }\n      else if(!strcmp(\"-centralitycut\", argv[i])) {\n\t fCentralityCut = atof(argv[i+1]);\n\t HLTImportant(\"Cutting on centrality > %f\");\n      }\n     \n    else {\n      HLTError(\"Unknown argument \\\"%s\\\"\", argv[i]);\n    }\n\n\n  }\n    \n  if(fDoPhos)\n    fPhosClustersArray = new TRefArray();\n  if(fDoEmcal)\n    fEmcalClustersArray = new TRefArray();\n  \n  fClusterReader = new AliHLTCaloClusterReader();\n  \n  return 0;\n}\n\n\nInt_t AliHLTCaloHistoComponent::DoDeinit()\n{ \n  \/\/see header file for documentation\n\n  if(fEmcalClustersArray)\n    delete fEmcalClustersArray;\n  fEmcalClustersArray = NULL;\n\n  if(fPhosClustersArray)\n    delete fPhosClustersArray;\n  fPhosClustersArray = NULL;\n\n  \/\/Deleting these should also destroy histogram producers!!?\n  if(fEmcalProducerArray)\n    delete fEmcalProducerArray;\n  fEmcalProducerArray = NULL;\n \n if(fPhosProducerArray)\n    delete fPhosProducerArray;\n  fPhosProducerArray = NULL;\n \n\n  if(fEmcalHistogramArray)\n    delete fEmcalHistogramArray;\n  fEmcalHistogramArray = NULL;\n  \n  if(fPhosHistogramArray)\n    delete fPhosHistogramArray;\n  fPhosHistogramArray = NULL;\n \n  return 0;\n}\n\nconst char* AliHLTCaloHistoComponent::GetComponentID()\n{\n  \/\/see header file for documentation\n  return \"CaloPhysicsHistos\";\n}\n\n\nvoid\nAliHLTCaloHistoComponent::GetInputDataTypes(vector<AliHLTComponentDataType>& list)\n{ \n  \/\/see header file for documentation\n  list.clear();\n  list.push_back( kAliHLTDataTypeESDObject | kAliHLTDataOriginOut );\n  list.push_back( kAliHLTDataTypeCaloCluster | kAliHLTDataOriginEMCAL );\n  list.push_back( kAliHLTDataTypeCaloCluster | kAliHLTDataOriginPHOS );\n\n  \/\/   list.push_back(AliHLTPHOSDefinitions::fgkClusterDataType);\n  \/\/   list.push_back(AliHLTPHOSDefinitions::fgkESDCaloClusterDataType);\n  \/\/   list.push_back(AliHLTPHOSDefinitions::fgkESDCaloCellsDataType);\n\n}\n\nAliHLTComponentDataType AliHLTCaloHistoComponent::GetOutputDataType()\n{\n  \/\/see header file for documentation\n  return kAliHLTDataTypeHistogram  | kAliHLTDataOriginAny ;\n}\n\n\nvoid AliHLTCaloHistoComponent::GetOutputDataSize(unsigned long& constBase, double& inputMultiplier)\n{\n  \/\/see header file for documentation\n  constBase = 30;\n  inputMultiplier = 5;\n}\n\nAliHLTComponent* AliHLTCaloHistoComponent::Spawn() {\n  \/\/see header file for documentation\n  return new AliHLTCaloHistoComponent();\n}\n\nInt_t AliHLTCaloHistoComponent::DoEvent(const AliHLTComponentEventData& \/*evtData*\/, AliHLTComponentTriggerData& \/*trigData*\/) {\n\n  fPhosHistogramArray->Clear();\n  fEmcalHistogramArray->Clear();\n\n\n  \/\/see header file for documentation\n  Int_t iResult = 0;\n\n\n  if ( GetFirstInputBlock( kAliHLTDataTypeSOR ) || GetFirstInputBlock( kAliHLTDataTypeEOR ) )\n    return 0;\n\n  \n  if (fDoEmcal) {\n    for (const AliHLTComponentBlockData* pBlock=GetFirstInputBlock( kAliHLTDataTypeCaloCluster | kAliHLTDataOriginEMCAL ); pBlock!=NULL; pBlock=GetNextInputBlock()) {\n      ProcessBlocks(pBlock, fEmcalProducerArray);\n    }\n  }\n\n  if (fDoPhos) {\n    for (const AliHLTComponentBlockData* pBlock=GetFirstInputBlock( kAliHLTDataTypeCaloCluster | kAliHLTDataOriginPHOS ); pBlock!=NULL; pBlock=GetNextInputBlock()) {\n      ProcessBlocks(pBlock, fPhosProducerArray);\n    }\n  }\n\n  \/\/Get histograms from all producers and push back in one block\n  for(int ih = 0; ih < fPhosProducerArray->GetEntriesFast(); ih++) {\n    fPhosHistogramArray->AddAll(static_cast<AliHLTCaloHistoProducer*>(fPhosProducerArray->At(ih))->GetHistograms());\n    \/\/    PushBack(static_cast<AliHLTCaloHistoProducer*>(fPhosProducerArray->At(ih))->GetHistograms(), kAliHLTDataTypeHistogram | kAliHLTDataOriginPHOS );\n    \n  }\n  PushBack(fPhosHistogramArray, kAliHLTDataTypeHistogram | kAliHLTDataOriginPHOS );\n\n  for(int ih = 0; ih < fEmcalProducerArray->GetEntriesFast(); ih++) {\n    fEmcalHistogramArray->AddAll(static_cast<AliHLTCaloHistoProducer*>(fEmcalProducerArray->At(ih))->GetHistograms() );\n    \/\/    PushBack(static_cast<AliHLTCaloHistoProducer*>(fEmcalProducerArray->At(ih))->GetHistograms(), kAliHLTDataTypeHistogram | kAliHLTDataOriginEMCAL );\n  }\n  PushBack(fEmcalHistogramArray, kAliHLTDataTypeHistogram | kAliHLTDataOriginEMCAL );\n\n  return iResult;\n\n}\n\n\nInt_t AliHLTCaloHistoComponent::ProcessBlocks(const AliHLTComponentBlockData * pBlock, TObjArray * histoArray) {\n\n  Int_t iResult = 0;\n\n  AliHLTCaloClusterDataStruct * clusterStruct;\n  vector<AliHLTCaloClusterDataStruct*> clustersVector;\n  \n  AliHLTCaloClusterHeaderStruct *clusterHeader = reinterpret_cast<AliHLTCaloClusterHeaderStruct*>(pBlock->fPtr);\n  fClusterReader->SetMemory(clusterHeader);\n     \n  if ( (clusterHeader->fNClusters) < 0) {\n    HLTError(\"Event has negative number of clusters: %d! Very bad for vector resizing\", (Int_t) (clusterHeader->fNClusters));\n    return -1;\n  }\n  \n  clustersVector.reserve((int) (clusterHeader->fNClusters)); \n  Int_t nClusters = 0;\n  Double_t ampFrac;\n  UShort_t cellId;\n  Bool_t cutCluster = false;\n  while( (clusterStruct = fClusterReader->NextCluster()) != 0) {\n    cutCluster = false;\n      if(fCutOnCentrality){\n\t if(clusterStruct->fEnergy > fCentralityCutEnergy) {\n\t    for(UInt_t i = 0; i < clusterStruct->fNCells; i++) {\n\t       fClusterReader->GetCell(clusterStruct, cellId, ampFrac, i);\n\t       if(ampFrac > fCentralityCut) {\n\t\t  cutCluster = true;\n\t\t  break;\n\t       }\n\t    }\n\t }\n      }\n    \n    if(!cutCluster) {\n      clustersVector.push_back(clusterStruct);  \n    }\n  }\n  \n  nClusters = clustersVector.size();\n  \n  for(int ih = 0; ih < histoArray->GetEntriesFast(); ih++) {\n    iResult = static_cast<AliHLTCaloHistoProducer*>(histoArray->At(ih))->FillHistograms(nClusters, clustersVector);\n  }\n  \n  return iResult;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkMPIMultiBlockPLOT3DReader.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 \"vtkMPIMultiBlockPLOT3DReader.h\"\n\n#include \"vtkByteSwap.h\"\n#include \"vtkDataArrayDispatcher.h\"\n#include \"vtkErrorCode.h\"\n#include \"vtkMPICommunicator.h\"\n#include \"vtkMPIController.h\"\n#include \"vtkMPI.h\"\n#include \"vtkMultiBlockPLOT3DReaderInternals.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkStructuredData.h\"\n\n#include <exception>\n#include <cassert>\n\n#define DEFINE_MPI_TYPE(ctype, mpitype) \\\n  template <> struct mpi_type<ctype> { static MPI_Datatype type() { return mpitype; }  };\n\nnamespace\n{\n  template <class T> struct mpi_type {};\n  DEFINE_MPI_TYPE(char, MPI_CHAR);\n  DEFINE_MPI_TYPE(signed char, MPI_SIGNED_CHAR);\n  DEFINE_MPI_TYPE(unsigned char, MPI_UNSIGNED_CHAR);\n  DEFINE_MPI_TYPE(short, MPI_SHORT);\n  DEFINE_MPI_TYPE(unsigned short, MPI_UNSIGNED_SHORT);\n  DEFINE_MPI_TYPE(int, MPI_INT);\n  DEFINE_MPI_TYPE(unsigned int, MPI_UNSIGNED);\n  DEFINE_MPI_TYPE(long, MPI_LONG);\n  DEFINE_MPI_TYPE(unsigned long, MPI_UNSIGNED_LONG);\n  DEFINE_MPI_TYPE(float, MPI_FLOAT);\n  DEFINE_MPI_TYPE(double, MPI_DOUBLE);\n#if defined(VTK_TYPE_USE_LONG_LONG)\n  DEFINE_MPI_TYPE(long long, MPI_LONG_LONG);\n  DEFINE_MPI_TYPE(unsigned long long, MPI_UNSIGNED_LONG_LONG);\n#endif\n#if defined(VTK_TYPE_USE___INT64)\n# if VTK_SIZEOF_LONG == 8\n  DEFINE_MPI_TYPE(__int64, MPI_LONG);\n  DEFINE_MPI_TYPE(unsigned __int64, MPI_UNSIGNED_LONG);\n# elif defined(MPI_LONG_LONG)\n  DEFINE_MPI_TYPE(__int64, MPI_LONG_LONG);\n  DEFINE_MPI_TYPE(__int64, MPI_UNSIGNED_LONG_LONG);\n# endif\n#endif\n\n  class MPIPlot3DException : public std::exception\n  {\n  };\n\n  class SetupFileViewFunctor\n  {\n    vtkMPICommunicatorOpaqueComm& Communicator;\n    vtkMPIOpaqueFileHandle& Handle;\n    int Extent[6];\n    int WExtent[6];\n    vtkTypeUInt64 Offset;\n    int ByteOrder;\n\n  public:\n    SetupFileViewFunctor(\n      vtkMPICommunicatorOpaqueComm& comm,\n      vtkMPIOpaqueFileHandle& handle,\n        const int extent[6], const int wextent[6], vtkTypeUInt64 offset, int byteOrder)\n      : Communicator(comm), Handle(handle), Offset(offset), ByteOrder(byteOrder)\n    {\n    std::copy(extent, extent+6, this->Extent);\n    std::copy(wextent, wextent+6, this->WExtent);\n    }\n\n    template <class T>\n    void operator()(vtkDataArrayDispatcherPointer<T> array) const\n    {\n    int array_of_sizes[3];\n    int array_of_subsizes[3];\n    int array_of_starts[3];\n    for (int cc=0; cc < 3; ++cc)\n      {\n      array_of_sizes[cc]    = this->WExtent[cc*2+1] - this->WExtent[cc*2] + 1;\n      array_of_subsizes[cc] = this->Extent[cc*2+1] - this->Extent[cc*2] + 1;\n      array_of_starts[cc]   = this->Extent[cc*2];\n      }\n\n    \/\/ Define the file type for this process.\n    MPI_Datatype filetype;\n    if (MPI_Type_create_subarray(3,\n        array_of_sizes,\n        array_of_subsizes,\n        array_of_starts,\n        MPI_ORDER_FORTRAN,\n        mpi_type<T>::type(),\n        &filetype) != MPI_SUCCESS)\n      {\n      throw MPIPlot3DException();\n      }\n    MPI_Type_commit(&filetype);\n\n    \/\/ For each component.\n    const vtkIdType valuesToRead = vtkStructuredData::GetNumberOfPoints(\n      const_cast<int*>(this->Extent));\n    const vtkIdType valuesTotal = vtkStructuredData::GetNumberOfPoints(\n      const_cast<int*>(this->WExtent));\n\n    const int _INT_MAX = 2e9 \/ sizeof(T); \/\/\/ XXX: arbitrary limit that seems\n                                          \/\/\/ to work when reading large files.\n\n    int numIterations = static_cast<int>(valuesToRead\/_INT_MAX) + 1;\n    int maxNumIterations;\n    MPI_Allreduce(&numIterations, &maxNumIterations, 1, mpi_type<int>::type(),\n      MPI_MAX, *this->Communicator.GetHandle());\n\n    vtkTypeUInt64 byteOffset = this->Offset;\n    \/\/ simply use the VTK array for scalars.\n    T *buffer = array.NumberOfComponents == 1? array.RawPointer : new T[valuesToRead];\n    try\n      {\n      for (int comp=0; comp < array.NumberOfComponents; ++comp)\n        {\n        \/\/ Define the view.\n        if (MPI_File_set_view(this->Handle.Handle, byteOffset, mpi_type<T>::type(),\n            filetype, const_cast<char*>(\"native\"), MPI_INFO_NULL) != MPI_SUCCESS)\n          {\n          throw MPIPlot3DException();\n          }\n\n        \/\/ Read contents from the file in 2GB chunks.\n        vtkIdType valuesRead = 0;\n        for (int iteration = 0; iteration < maxNumIterations; ++iteration)\n          {\n          vtkIdType valuesToReadInIteration =\n            std::min((valuesToRead - valuesRead), static_cast<vtkIdType>(_INT_MAX));\n          if (MPI_File_read_all(this->Handle.Handle, buffer + valuesRead,\n              static_cast<int>(valuesToReadInIteration),\n              mpi_type<T>::type(), MPI_STATUS_IGNORE) != MPI_SUCCESS)\n            {\n            throw MPIPlot3DException();\n            }\n          valuesRead += valuesToReadInIteration;\n          }\n        if (buffer != array.RawPointer)\n          {\n          for (vtkIdType i=0; i < valuesToRead; ++i)\n            {\n            array.RawPointer[array.NumberOfComponents*i + comp] = buffer[i];\n            }\n          }\n        byteOffset += valuesTotal * sizeof(T);\n        }\n      }\n    catch (MPIPlot3DException)\n      {\n      if (buffer != array.RawPointer)\n        {\n        delete [] buffer;\n        }\n      MPI_Type_free(&filetype);\n      throw MPIPlot3DException();\n      }\n    if (buffer != array.RawPointer)\n      {\n      delete [] buffer;\n      }\n    MPI_Type_free(&filetype);\n    \/\/ finally, handle byte order.\n    if (this->ByteOrder == vtkMultiBlockPLOT3DReader::FILE_LITTLE_ENDIAN)\n      {\n      vtkByteSwap::SwapLERange(array.RawPointer, array.NumberOfComponents*array.NumberOfTuples);\n      }\n    else\n      {\n      vtkByteSwap::SwapBERange(array.RawPointer, array.NumberOfComponents*array.NumberOfTuples);\n      }\n    }\n  };\n}\n\nvtkStandardNewMacro(vtkMPIMultiBlockPLOT3DReader);\n\/\/----------------------------------------------------------------------------\nvtkMPIMultiBlockPLOT3DReader::vtkMPIMultiBlockPLOT3DReader()\n{\n  this->UseMPIIO = true;\n}\n\n\/\/----------------------------------------------------------------------------\nvtkMPIMultiBlockPLOT3DReader::~vtkMPIMultiBlockPLOT3DReader()\n{\n}\n\n\/\/----------------------------------------------------------------------------\nbool vtkMPIMultiBlockPLOT3DReader::CanUseMPIIO()\n{\n  return (this->UseMPIIO && this->BinaryFile &&\n    this->Internal->Settings.NumberOfDimensions == 3 &&\n    vtkMPIController::SafeDownCast(this->Controller) != NULL);\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkMPIMultiBlockPLOT3DReader::OpenFileForDataRead(void*& vfp, const char* fname)\n{\n  if (!this->CanUseMPIIO())\n    {\n    return this->Superclass::OpenFileForDataRead(vfp, fname);\n    }\n\n  vtkMPICommunicator* mpiComm = vtkMPICommunicator::SafeDownCast(\n    this->Controller->GetCommunicator());\n  assert(mpiComm);\n\n  vtkMPIOpaqueFileHandle* handle = new vtkMPIOpaqueFileHandle();\n  try\n    {\n    if (MPI_File_open(*mpiComm->GetMPIComm()->GetHandle(),\n                      const_cast<char*>(fname), MPI_MODE_RDONLY,\n                      MPI_INFO_NULL, &handle->Handle) != MPI_SUCCESS)\n      {\n      this->SetErrorCode(vtkErrorCode::FileNotFoundError);\n      vtkErrorMacro(\"File: \" << fname << \" not found.\");\n      throw MPIPlot3DException();\n      }\n    }\n  catch (MPIPlot3DException)\n    {\n    delete handle;\n    vfp = NULL;\n    return VTK_ERROR;\n    }\n  vfp = handle;\n  return VTK_OK;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkMPIMultiBlockPLOT3DReader::CloseFile(void* vfp)\n{\n  if (!this->CanUseMPIIO())\n    {\n    this->Superclass::CloseFile(vfp);\n    return;\n    }\n\n  vtkMPIOpaqueFileHandle* handle = reinterpret_cast<vtkMPIOpaqueFileHandle*>(vfp);\n  assert(handle);\n  if (MPI_File_close(&handle->Handle) != MPI_SUCCESS)\n    {\n    vtkErrorMacro(\"Failed to close file!\");\n    }\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkMPIMultiBlockPLOT3DReader::ReadIntScalar(\n  void* vfp, int extent[6], int wextent[6],\n  vtkDataArray* scalar, vtkTypeUInt64 offset)\n{\n  if (!this->CanUseMPIIO())\n    {\n    return this->Superclass::ReadIntScalar(vfp, extent, wextent, scalar, offset);\n    }\n\n  return this->ReadScalar(vfp, extent, wextent, scalar, offset);\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkMPIMultiBlockPLOT3DReader::ReadScalar(\n    void* vfp,\n    int extent[6], int wextent[6],\n    vtkDataArray* scalar, vtkTypeUInt64 offset)\n{\n  if (!this->CanUseMPIIO())\n    {\n    return this->Superclass::ReadScalar(vfp, extent, wextent, scalar, offset);\n    }\n\n  vtkMPIOpaqueFileHandle* handle = reinterpret_cast<vtkMPIOpaqueFileHandle*>(vfp);\n  assert(handle);\n\n  vtkMPICommunicatorOpaqueComm* comm =\n    vtkMPICommunicator::SafeDownCast(this->Controller->GetCommunicator())->GetMPIComm();\n  assert(comm);\n\n  SetupFileViewFunctor work(*comm, *handle, extent, wextent, offset, this->Internal->Settings.ByteOrder);\n  vtkDataArrayDispatcher<SetupFileViewFunctor> dispatcher(work);\n  try\n    {\n    dispatcher.Go(scalar);\n    }\n  catch (MPIPlot3DException)\n    {\n    return 0;\n    }\n  return 1;\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkMPIMultiBlockPLOT3DReader::ReadVector(\n  void* vfp,\n  int extent[6], int wextent[6],\n  int numDims, vtkDataArray* vector, vtkTypeUInt64 offset)\n{\n  if (!this->CanUseMPIIO())\n    {\n    return this->Superclass::ReadVector(vfp, extent, wextent, numDims, vector, offset);\n    }\n\n  vtkMPIOpaqueFileHandle* handle = reinterpret_cast<vtkMPIOpaqueFileHandle*>(vfp);\n  assert(handle);\n\n  vtkMPICommunicatorOpaqueComm* comm =\n    vtkMPICommunicator::SafeDownCast(this->Controller->GetCommunicator())->GetMPIComm();\n  assert(comm);\n\n  SetupFileViewFunctor work(*comm, *handle, extent, wextent, offset, this->Internal->Settings.ByteOrder);\n  vtkDataArrayDispatcher<SetupFileViewFunctor> dispatcher(work);\n  try\n    {\n    dispatcher.Go(vector);\n    }\n  catch (MPIPlot3DException)\n    {\n    return 0;\n    }\n  return 1;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkMPIMultiBlockPLOT3DReader::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os, indent);\n  os << indent << \"UseMPIIO: \" << this->UseMPIIO << endl;\n}\n<commit_msg>Error checking: check status of collective call.<commit_after>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkMPIMultiBlockPLOT3DReader.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 \"vtkMPIMultiBlockPLOT3DReader.h\"\n\n#include \"vtkByteSwap.h\"\n#include \"vtkDataArrayDispatcher.h\"\n#include \"vtkErrorCode.h\"\n#include \"vtkMPICommunicator.h\"\n#include \"vtkMPIController.h\"\n#include \"vtkMPI.h\"\n#include \"vtkMultiBlockPLOT3DReaderInternals.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkStructuredData.h\"\n\n#include <exception>\n#include <cassert>\n\n#define DEFINE_MPI_TYPE(ctype, mpitype) \\\n  template <> struct mpi_type<ctype> { static MPI_Datatype type() { return mpitype; }  };\n\nnamespace\n{\n  template <class T> struct mpi_type {};\n  DEFINE_MPI_TYPE(char, MPI_CHAR);\n  DEFINE_MPI_TYPE(signed char, MPI_SIGNED_CHAR);\n  DEFINE_MPI_TYPE(unsigned char, MPI_UNSIGNED_CHAR);\n  DEFINE_MPI_TYPE(short, MPI_SHORT);\n  DEFINE_MPI_TYPE(unsigned short, MPI_UNSIGNED_SHORT);\n  DEFINE_MPI_TYPE(int, MPI_INT);\n  DEFINE_MPI_TYPE(unsigned int, MPI_UNSIGNED);\n  DEFINE_MPI_TYPE(long, MPI_LONG);\n  DEFINE_MPI_TYPE(unsigned long, MPI_UNSIGNED_LONG);\n  DEFINE_MPI_TYPE(float, MPI_FLOAT);\n  DEFINE_MPI_TYPE(double, MPI_DOUBLE);\n#if defined(VTK_TYPE_USE_LONG_LONG)\n  DEFINE_MPI_TYPE(long long, MPI_LONG_LONG);\n  DEFINE_MPI_TYPE(unsigned long long, MPI_UNSIGNED_LONG_LONG);\n#endif\n#if defined(VTK_TYPE_USE___INT64)\n# if VTK_SIZEOF_LONG == 8\n  DEFINE_MPI_TYPE(__int64, MPI_LONG);\n  DEFINE_MPI_TYPE(unsigned __int64, MPI_UNSIGNED_LONG);\n# elif defined(MPI_LONG_LONG)\n  DEFINE_MPI_TYPE(__int64, MPI_LONG_LONG);\n  DEFINE_MPI_TYPE(__int64, MPI_UNSIGNED_LONG_LONG);\n# endif\n#endif\n\n  class MPIPlot3DException : public std::exception\n  {\n  };\n\n  class SetupFileViewFunctor\n  {\n    vtkMPICommunicatorOpaqueComm& Communicator;\n    vtkMPIOpaqueFileHandle& Handle;\n    int Extent[6];\n    int WExtent[6];\n    vtkTypeUInt64 Offset;\n    int ByteOrder;\n\n  public:\n    SetupFileViewFunctor(\n      vtkMPICommunicatorOpaqueComm& comm,\n      vtkMPIOpaqueFileHandle& handle,\n        const int extent[6], const int wextent[6], vtkTypeUInt64 offset, int byteOrder)\n      : Communicator(comm), Handle(handle), Offset(offset), ByteOrder(byteOrder)\n    {\n    std::copy(extent, extent+6, this->Extent);\n    std::copy(wextent, wextent+6, this->WExtent);\n    }\n\n    template <class T>\n    void operator()(vtkDataArrayDispatcherPointer<T> array) const\n    {\n    int array_of_sizes[3];\n    int array_of_subsizes[3];\n    int array_of_starts[3];\n    for (int cc=0; cc < 3; ++cc)\n      {\n      array_of_sizes[cc]    = this->WExtent[cc*2+1] - this->WExtent[cc*2] + 1;\n      array_of_subsizes[cc] = this->Extent[cc*2+1] - this->Extent[cc*2] + 1;\n      array_of_starts[cc]   = this->Extent[cc*2];\n      }\n\n    \/\/ Define the file type for this process.\n    MPI_Datatype filetype;\n    if (MPI_Type_create_subarray(3,\n        array_of_sizes,\n        array_of_subsizes,\n        array_of_starts,\n        MPI_ORDER_FORTRAN,\n        mpi_type<T>::type(),\n        &filetype) != MPI_SUCCESS)\n      {\n      throw MPIPlot3DException();\n      }\n    MPI_Type_commit(&filetype);\n\n    \/\/ For each component.\n    const vtkIdType valuesToRead = vtkStructuredData::GetNumberOfPoints(\n      const_cast<int*>(this->Extent));\n    const vtkIdType valuesTotal = vtkStructuredData::GetNumberOfPoints(\n      const_cast<int*>(this->WExtent));\n\n    const int _INT_MAX = 2e9 \/ sizeof(T); \/\/\/ XXX: arbitrary limit that seems\n                                          \/\/\/ to work when reading large files.\n\n    int numIterations = static_cast<int>(valuesToRead\/_INT_MAX) + 1;\n    int maxNumIterations;\n    if (MPI_Allreduce(&numIterations, &maxNumIterations, 1, mpi_type<int>::type(),\n        MPI_MAX, *this->Communicator.GetHandle()) != MPI_SUCCESS)\n      {\n      throw MPIPlot3DException();\n      }\n\n    vtkTypeUInt64 byteOffset = this->Offset;\n    \/\/ simply use the VTK array for scalars.\n    T *buffer = array.NumberOfComponents == 1? array.RawPointer : new T[valuesToRead];\n    try\n      {\n      for (int comp=0; comp < array.NumberOfComponents; ++comp)\n        {\n        \/\/ Define the view.\n        if (MPI_File_set_view(this->Handle.Handle, byteOffset, mpi_type<T>::type(),\n            filetype, const_cast<char*>(\"native\"), MPI_INFO_NULL) != MPI_SUCCESS)\n          {\n          throw MPIPlot3DException();\n          }\n\n        \/\/ Read contents from the file in 2GB chunks.\n        vtkIdType valuesRead = 0;\n        for (int iteration = 0; iteration < maxNumIterations; ++iteration)\n          {\n          vtkIdType valuesToReadInIteration =\n            std::min((valuesToRead - valuesRead), static_cast<vtkIdType>(_INT_MAX));\n          if (MPI_File_read_all(this->Handle.Handle, buffer + valuesRead,\n              static_cast<int>(valuesToReadInIteration),\n              mpi_type<T>::type(), MPI_STATUS_IGNORE) != MPI_SUCCESS)\n            {\n            throw MPIPlot3DException();\n            }\n          valuesRead += valuesToReadInIteration;\n          }\n        if (buffer != array.RawPointer)\n          {\n          for (vtkIdType i=0; i < valuesToRead; ++i)\n            {\n            array.RawPointer[array.NumberOfComponents*i + comp] = buffer[i];\n            }\n          }\n        byteOffset += valuesTotal * sizeof(T);\n        }\n      }\n    catch (MPIPlot3DException)\n      {\n      if (buffer != array.RawPointer)\n        {\n        delete [] buffer;\n        }\n      MPI_Type_free(&filetype);\n      throw MPIPlot3DException();\n      }\n    if (buffer != array.RawPointer)\n      {\n      delete [] buffer;\n      }\n    MPI_Type_free(&filetype);\n    \/\/ finally, handle byte order.\n    if (this->ByteOrder == vtkMultiBlockPLOT3DReader::FILE_LITTLE_ENDIAN)\n      {\n      vtkByteSwap::SwapLERange(array.RawPointer, array.NumberOfComponents*array.NumberOfTuples);\n      }\n    else\n      {\n      vtkByteSwap::SwapBERange(array.RawPointer, array.NumberOfComponents*array.NumberOfTuples);\n      }\n    }\n  };\n}\n\nvtkStandardNewMacro(vtkMPIMultiBlockPLOT3DReader);\n\/\/----------------------------------------------------------------------------\nvtkMPIMultiBlockPLOT3DReader::vtkMPIMultiBlockPLOT3DReader()\n{\n  this->UseMPIIO = true;\n}\n\n\/\/----------------------------------------------------------------------------\nvtkMPIMultiBlockPLOT3DReader::~vtkMPIMultiBlockPLOT3DReader()\n{\n}\n\n\/\/----------------------------------------------------------------------------\nbool vtkMPIMultiBlockPLOT3DReader::CanUseMPIIO()\n{\n  return (this->UseMPIIO && this->BinaryFile &&\n    this->Internal->Settings.NumberOfDimensions == 3 &&\n    vtkMPIController::SafeDownCast(this->Controller) != NULL);\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkMPIMultiBlockPLOT3DReader::OpenFileForDataRead(void*& vfp, const char* fname)\n{\n  if (!this->CanUseMPIIO())\n    {\n    return this->Superclass::OpenFileForDataRead(vfp, fname);\n    }\n\n  vtkMPICommunicator* mpiComm = vtkMPICommunicator::SafeDownCast(\n    this->Controller->GetCommunicator());\n  assert(mpiComm);\n\n  vtkMPIOpaqueFileHandle* handle = new vtkMPIOpaqueFileHandle();\n  try\n    {\n    if (MPI_File_open(*mpiComm->GetMPIComm()->GetHandle(),\n                      const_cast<char*>(fname), MPI_MODE_RDONLY,\n                      MPI_INFO_NULL, &handle->Handle) != MPI_SUCCESS)\n      {\n      this->SetErrorCode(vtkErrorCode::FileNotFoundError);\n      vtkErrorMacro(\"File: \" << fname << \" not found.\");\n      throw MPIPlot3DException();\n      }\n    }\n  catch (MPIPlot3DException)\n    {\n    delete handle;\n    vfp = NULL;\n    return VTK_ERROR;\n    }\n  vfp = handle;\n  return VTK_OK;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkMPIMultiBlockPLOT3DReader::CloseFile(void* vfp)\n{\n  if (!this->CanUseMPIIO())\n    {\n    this->Superclass::CloseFile(vfp);\n    return;\n    }\n\n  vtkMPIOpaqueFileHandle* handle = reinterpret_cast<vtkMPIOpaqueFileHandle*>(vfp);\n  assert(handle);\n  if (MPI_File_close(&handle->Handle) != MPI_SUCCESS)\n    {\n    vtkErrorMacro(\"Failed to close file!\");\n    }\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkMPIMultiBlockPLOT3DReader::ReadIntScalar(\n  void* vfp, int extent[6], int wextent[6],\n  vtkDataArray* scalar, vtkTypeUInt64 offset)\n{\n  if (!this->CanUseMPIIO())\n    {\n    return this->Superclass::ReadIntScalar(vfp, extent, wextent, scalar, offset);\n    }\n\n  return this->ReadScalar(vfp, extent, wextent, scalar, offset);\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkMPIMultiBlockPLOT3DReader::ReadScalar(\n    void* vfp,\n    int extent[6], int wextent[6],\n    vtkDataArray* scalar, vtkTypeUInt64 offset)\n{\n  if (!this->CanUseMPIIO())\n    {\n    return this->Superclass::ReadScalar(vfp, extent, wextent, scalar, offset);\n    }\n\n  vtkMPIOpaqueFileHandle* handle = reinterpret_cast<vtkMPIOpaqueFileHandle*>(vfp);\n  assert(handle);\n\n  vtkMPICommunicatorOpaqueComm* comm =\n    vtkMPICommunicator::SafeDownCast(this->Controller->GetCommunicator())->GetMPIComm();\n  assert(comm);\n\n  SetupFileViewFunctor work(*comm, *handle, extent, wextent, offset, this->Internal->Settings.ByteOrder);\n  vtkDataArrayDispatcher<SetupFileViewFunctor> dispatcher(work);\n  try\n    {\n    dispatcher.Go(scalar);\n    }\n  catch (MPIPlot3DException)\n    {\n    return 0;\n    }\n  return 1;\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkMPIMultiBlockPLOT3DReader::ReadVector(\n  void* vfp,\n  int extent[6], int wextent[6],\n  int numDims, vtkDataArray* vector, vtkTypeUInt64 offset)\n{\n  if (!this->CanUseMPIIO())\n    {\n    return this->Superclass::ReadVector(vfp, extent, wextent, numDims, vector, offset);\n    }\n\n  vtkMPIOpaqueFileHandle* handle = reinterpret_cast<vtkMPIOpaqueFileHandle*>(vfp);\n  assert(handle);\n\n  vtkMPICommunicatorOpaqueComm* comm =\n    vtkMPICommunicator::SafeDownCast(this->Controller->GetCommunicator())->GetMPIComm();\n  assert(comm);\n\n  SetupFileViewFunctor work(*comm, *handle, extent, wextent, offset, this->Internal->Settings.ByteOrder);\n  vtkDataArrayDispatcher<SetupFileViewFunctor> dispatcher(work);\n  try\n    {\n    dispatcher.Go(vector);\n    }\n  catch (MPIPlot3DException)\n    {\n    return 0;\n    }\n  return 1;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkMPIMultiBlockPLOT3DReader::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os, indent);\n  os << indent << \"UseMPIIO: \" << this->UseMPIIO << endl;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>INTEGRATION: CWS vgbugs07 (1.15.86); FILE MERGED 2007\/06\/04 13:26:09 vg 1.15.86.1: #i76605# Remove -I ...\/inc\/module hack introduced by hedaburemove01<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>cosmetic improvements<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*********************************************************************\n *\n * Copyright (C) 2008,  Simon Kagstrom\n *\n * Filename:      controller.cc\n * Author:        Simon Kagstrom <simon.kagstrom@gmail.com>\n * Description:   Singleton class that controls everything\n *\n * $Id:$\n *\n ********************************************************************\/\n#include <assert.h>\n#include <stdio.h>\n\n#include <utils.h>\n#include <emit.hh>\n#include <controller.hh>\n#include <registerallocator.hh>\n#include <config.hh>\n\nController::Controller(const char *dstdir, const char *elf_filename,\n                       int n_dbs, const char **database_filenames) : CodeBlock()\n{\n  this->elf = new CibylElf(elf_filename);\n  elf = this->elf;\n\n  this->syscall_db_table = ght_create(1024);\n\n  this->dstdir = dstdir;\n  this->instructions = NULL;\n  this->functions = NULL;\n  this->methods = NULL;\n  this->classes = NULL;\n\n  for (int i = 0; i < n_dbs; i++)\n    this->readSyscallDatabase(database_filenames[i]);\n\n  this->builtins = new BuiltinFactory();\n}\n\nvoid Controller::readSyscallDatabase(const char *filename)\n{\n  cibyl_db_entry_t *syscall_entries;\n  file_chunk_t *file = read_file(filename);\n  uint32_t n;\n  char *strtab;\n\n  n = be32_to_host(((uint32_t*)file->data)[0]);\n  strtab = (char*)file->data + sizeof(uint32_t) + be32_to_host((((uint32_t*)file->data)[1]));\n\n  syscall_entries = (cibyl_db_entry_t*)(((uint32_t*)file->data) + 2);\n\n  \/* Fixup the entries *\/\n  for (uint32_t i = 0; i < n; i++)\n    {\n      cibyl_db_entry_t *cur = &syscall_entries[i];\n\n      cur->nr = be32_to_host(cur->nr);\n      cur->returns = be32_to_host(cur->returns);\n      cur->nrArgs = be32_to_host(cur->nrArgs);\n      cur->qualifier = be32_to_host(cur->qualifier);\n      cur->name = strtab + be32_to_host((uint32_t)cur->name);\n\n      \/* Add to the hash table *\/\n      ght_insert(this->syscall_db_table, (void*)cur,\n                 strlen(cur->name), (void*)cur->name);\n    }\n}\n\nbool Controller::pass0()\n{\n  ElfSymbol **fn_syms;\n  Instruction *last = NULL;\n  uint32_t *textSegment = (uint32_t*)this->elf->getText();\n  int n_insns = this->elf->getTextSize() \/ 4;\n  int n_functions = this->elf->getNumberOfFunctions();\n  uint32_t textBase = this->elf->getEntryPoint();\n  int i;\n\n  this->instructions = (Instruction**)xcalloc(n_insns + 1, sizeof(Instruction*));\n\n  for (int i = 0; i < n_insns; i++)\n    {\n      Instruction *insn = InstructionFactory::getInstance()->create(textBase + i*4,\n\t\t\t\t\t\t\t\t    textSegment[i]);\n\n      \/* Append to the delay slot of last instruction, if there is one *\/\n      if (i >= 1 && last->hasDelaySlot())\n\t{\n\t  last->setDelayed(insn);\n\t  insn = new Nop( insn->getAddress() );\n\t}\n      this->instructions[i] = insn;\n      last = insn;\n    }\n\n  this->functions = (Function**)xcalloc(n_functions + 1, sizeof(Function*));\n  this->methods = (JavaMethod**)xcalloc(n_functions + 1, sizeof(JavaMethod*));\n\n  this->callTableMethod = new CallTableMethod(n_functions + 1);\n\n  \/* Create all functions and methods *\/\n  fn_syms = this->elf->getFunctions();\n  assert(fn_syms);\n  for (i = 0; fn_syms[i]; i++)\n    {\n      ElfSymbol *sym = fn_syms[i];\n\n      \/* Create a new function with a set of instructions, this\n       * will in turn create basic blocks\n       *\/\n      if (sym->addr == this->elf->getEntryPoint())\n        this->functions[i] = new StartFunction(sym->name, this->instructions,\n                                               (sym->addr - textBase) \/ 4,\n                                               (sym->addr - textBase + sym->size) \/ 4 - 1);\n      else\n        this->functions[i] = new Function(sym->name, this->instructions,\n                                          (sym->addr - textBase) \/ 4,\n                                          (sym->addr - textBase + sym->size) \/ 4 - 1);\n      \/* 1-1 mapping *\/\n      this->methods[i] = new JavaMethod(functions, i, i);\n      \/* For now add all methods to the call table *\/\n      this->callTableMethod->addMethod(this->methods[i]);\n    }\n\n  \/* And the (single) class *\/\n  this->classes = (JavaClass**)xcalloc(1, sizeof(JavaClass*));\n  this->classes[0] = new JavaClass(this->methods, 0, i-1);\n\n  this->syscalls = (Syscall**)xcalloc(sizeof(Syscall*),\n                                      this->elf->getCibylStrtabSize());\n\n  this->n_classes = 1;\n\n  return true;\n}\n\nSyscall *Controller::getSyscall(uint32_t value)\n{\n  assert(value < this->elf->getCibylStrtabSize() * sizeof(Syscall*));\n\n  \/*\n   * this->syscalls is a sparse \"table\" of cached syscalls. It uses\n   * the string offset as an index into the table and stores a pointer\n   * there. Most of the entries will be empty, so memory is wasted,\n   * but this should speed things up a bit.\n   *\/\n  if (!this->syscalls[value])\n    {\n      char *name = this->elf->getCibylStrtabString(value);\n      cibyl_db_entry_t *p = (cibyl_db_entry_t*)ght_get(this->syscall_db_table,\n                                                       strlen(name), name);\n      if (!p)\n        {\n          fprintf(stderr, \"No syscall with offset 0x%x\\n\", value);\n          exit(1);\n        }\n\n      this->syscalls[value] = new Syscall(p->name, p->nrArgs,\n                                          p->returns ? 'I' : 'V' );\n    }\n  return this->syscalls[value];\n}\n\n\nJavaMethod *Controller::getMethodByAddress(uint32_t addr)\n{\n  \/* We only have a couple of classes anyway *\/\n  for (int i = 0;\n       i < this->n_classes;\n       i++)\n    {\n      JavaMethod *out = this->classes[i]->getMethodByAddress(addr);\n\n      if (out)\n\treturn out;\n    }\n\n  return NULL;\n}\n\nJavaMethod *Controller::getCallTableMethod()\n{\n  return this->callTableMethod;\n}\n\nInstruction *Controller::getInstructionByAddress(uint32_t address)\n{\n  if (address < this->elf->getEntryPoint() ||\n      address > this->elf->getEntryPoint() + this->elf->getTextSize())\n    return NULL;\n\n  return this->instructions[(address - this->elf->getEntryPoint()) \/ 4];\n}\n\n\nInstruction *Controller::getBranchTarget(uint32_t address)\n{\n  return this->getInstructionByAddress(address);\n}\n\nvoid Controller::lookupDataAddresses(JavaClass *cl, uint32_t *data, int n_entries)\n{\n  uint32_t text_start = this->elf->getEntryPoint();\n  uint32_t text_end = text_start + this->elf->getTextSize();\n\n  \/* Add labels for data pointing to the text segment *\/\n  for (int n = 0; n < n_entries; n++)\n    {\n      uint32_t v = be32_to_host(data[n]);\n\n      if (v >= text_start && v < text_end)\n        {\n          JavaMethod *mt = cl->getMethodByAddress(v);\n\n          \/* Something has an address in this method *\/\n          mt->addJumptabLabel(v);\n          this->addJumptabLabel(v);\n        }\n    }\n}\n\nbool Controller::pass1()\n{\n  bool out = true;\n\n  for (int i = 0; i < this->n_classes; i++)\n    {\n      JavaClass *cl = this->classes[i];\n\n      \/* Add addresses in the different ELF sections to the lookup tables *\/\n      this->lookupDataAddresses(cl, (uint32_t*)this->elf->getData(),\n                                this->elf->getDataSize() \/ sizeof(uint32_t));\n      this->lookupDataAddresses(cl, (uint32_t*)this->elf->getRodata(),\n                                this->elf->getRodataSize() \/ sizeof(uint32_t));\n      this->lookupDataAddresses(cl, (uint32_t*)this->elf->getCtors(),\n                                this->elf->getCtorsSize() \/ sizeof(uint32_t));\n      this->lookupDataAddresses(cl, (uint32_t*)this->elf->getDtors(),\n                                this->elf->getDtorsSize() \/ sizeof(uint32_t));\n\n      if (cl->pass1() != true)\n\tout = false;\n    }\n  this->callTableMethod->pass1();\n  this->sortJumptabLabels();\n\n  return out;\n}\n\n\nbool Controller::pass2()\n{\n  char buf[80];\n  bool out = true;\n\n  snprintf(buf, 80, \"%s\/%s\", this->dstdir, \"Cibyl.j\");\n  emit->setOutputFile(buf);\n  for (int i = 0; i < this->n_classes; i++)\n    {\n      if (this->classes[i]->pass2() != true)\n\tout = false;\n    }\n  snprintf(buf, 80, \"%s\/%s\", this->dstdir, \"CibylCallTable.java\");\n  emit->setOutputFile(buf);\n  this->callTableMethod->pass2();\n\n  return out;\n}\n\n\nController *controller;\nConfig *config;\n\nint main(int argc, const char *argv[])\n{\n  if (argc < 4)\n    {\n      fprintf(stderr, \"Too few arguments\\n\");\n      return 1;\n    }\n\n  emit = new Emit();\n  config = new Config();\n\n  regalloc = new RegisterAllocator();\n  controller = new Controller(argv[1], argv[2], argc-3, &argv[3]);\n\n  controller->pass0();\n  controller->pass1();\n  controller->pass2();\n\n  return 0;\n}\n<commit_msg>Better error message<commit_after>\/*********************************************************************\n *\n * Copyright (C) 2008,  Simon Kagstrom\n *\n * Filename:      controller.cc\n * Author:        Simon Kagstrom <simon.kagstrom@gmail.com>\n * Description:   Singleton class that controls everything\n *\n * $Id:$\n *\n ********************************************************************\/\n#include <assert.h>\n#include <stdio.h>\n\n#include <utils.h>\n#include <emit.hh>\n#include <controller.hh>\n#include <registerallocator.hh>\n#include <config.hh>\n\nController::Controller(const char *dstdir, const char *elf_filename,\n                       int n_dbs, const char **database_filenames) : CodeBlock()\n{\n  this->elf = new CibylElf(elf_filename);\n  elf = this->elf;\n\n  this->syscall_db_table = ght_create(1024);\n\n  this->dstdir = dstdir;\n  this->instructions = NULL;\n  this->functions = NULL;\n  this->methods = NULL;\n  this->classes = NULL;\n\n  for (int i = 0; i < n_dbs; i++)\n    this->readSyscallDatabase(database_filenames[i]);\n\n  this->builtins = new BuiltinFactory();\n}\n\nvoid Controller::readSyscallDatabase(const char *filename)\n{\n  cibyl_db_entry_t *syscall_entries;\n  file_chunk_t *file = read_file(filename);\n  uint32_t n;\n  char *strtab;\n\n  n = be32_to_host(((uint32_t*)file->data)[0]);\n  strtab = (char*)file->data + sizeof(uint32_t) + be32_to_host((((uint32_t*)file->data)[1]));\n\n  syscall_entries = (cibyl_db_entry_t*)(((uint32_t*)file->data) + 2);\n\n  \/* Fixup the entries *\/\n  for (uint32_t i = 0; i < n; i++)\n    {\n      cibyl_db_entry_t *cur = &syscall_entries[i];\n\n      cur->nr = be32_to_host(cur->nr);\n      cur->returns = be32_to_host(cur->returns);\n      cur->nrArgs = be32_to_host(cur->nrArgs);\n      cur->qualifier = be32_to_host(cur->qualifier);\n      cur->name = strtab + be32_to_host((uint32_t)cur->name);\n\n      \/* Add to the hash table *\/\n      ght_insert(this->syscall_db_table, (void*)cur,\n                 strlen(cur->name), (void*)cur->name);\n    }\n}\n\nbool Controller::pass0()\n{\n  ElfSymbol **fn_syms;\n  Instruction *last = NULL;\n  uint32_t *textSegment = (uint32_t*)this->elf->getText();\n  int n_insns = this->elf->getTextSize() \/ 4;\n  int n_functions = this->elf->getNumberOfFunctions();\n  uint32_t textBase = this->elf->getEntryPoint();\n  int i;\n\n  this->instructions = (Instruction**)xcalloc(n_insns + 1, sizeof(Instruction*));\n\n  for (int i = 0; i < n_insns; i++)\n    {\n      Instruction *insn = InstructionFactory::getInstance()->create(textBase + i*4,\n\t\t\t\t\t\t\t\t    textSegment[i]);\n\n      \/* Append to the delay slot of last instruction, if there is one *\/\n      if (i >= 1 && last->hasDelaySlot())\n\t{\n\t  last->setDelayed(insn);\n\t  insn = new Nop( insn->getAddress() );\n\t}\n      this->instructions[i] = insn;\n      last = insn;\n    }\n\n  this->functions = (Function**)xcalloc(n_functions + 1, sizeof(Function*));\n  this->methods = (JavaMethod**)xcalloc(n_functions + 1, sizeof(JavaMethod*));\n\n  this->callTableMethod = new CallTableMethod(n_functions + 1);\n\n  \/* Create all functions and methods *\/\n  fn_syms = this->elf->getFunctions();\n  assert(fn_syms);\n  for (i = 0; fn_syms[i]; i++)\n    {\n      ElfSymbol *sym = fn_syms[i];\n\n      \/* Create a new function with a set of instructions, this\n       * will in turn create basic blocks\n       *\/\n      if (sym->addr == this->elf->getEntryPoint())\n        this->functions[i] = new StartFunction(sym->name, this->instructions,\n                                               (sym->addr - textBase) \/ 4,\n                                               (sym->addr - textBase + sym->size) \/ 4 - 1);\n      else\n        this->functions[i] = new Function(sym->name, this->instructions,\n                                          (sym->addr - textBase) \/ 4,\n                                          (sym->addr - textBase + sym->size) \/ 4 - 1);\n      \/* 1-1 mapping *\/\n      this->methods[i] = new JavaMethod(functions, i, i);\n      \/* For now add all methods to the call table *\/\n      this->callTableMethod->addMethod(this->methods[i]);\n    }\n\n  \/* And the (single) class *\/\n  this->classes = (JavaClass**)xcalloc(1, sizeof(JavaClass*));\n  this->classes[0] = new JavaClass(this->methods, 0, i-1);\n\n  this->syscalls = (Syscall**)xcalloc(sizeof(Syscall*),\n                                      this->elf->getCibylStrtabSize());\n\n  this->n_classes = 1;\n\n  return true;\n}\n\nSyscall *Controller::getSyscall(uint32_t value)\n{\n  assert(value < this->elf->getCibylStrtabSize() * sizeof(Syscall*));\n\n  \/*\n   * this->syscalls is a sparse \"table\" of cached syscalls. It uses\n   * the string offset as an index into the table and stores a pointer\n   * there. Most of the entries will be empty, so memory is wasted,\n   * but this should speed things up a bit.\n   *\/\n  if (!this->syscalls[value])\n    {\n      char *name = this->elf->getCibylStrtabString(value);\n      cibyl_db_entry_t *p = (cibyl_db_entry_t*)ght_get(this->syscall_db_table,\n                                                       strlen(name), name);\n      if (!p)\n        {\n          fprintf(stderr, \"No syscall %s:\\n  Are all syscall databases added on the command line (cibyl-syscalls.db)?\\n\", name);\n          exit(1);\n        }\n\n      this->syscalls[value] = new Syscall(p->name, p->nrArgs,\n                                          p->returns ? 'I' : 'V' );\n    }\n  return this->syscalls[value];\n}\n\n\nJavaMethod *Controller::getMethodByAddress(uint32_t addr)\n{\n  \/* We only have a couple of classes anyway *\/\n  for (int i = 0;\n       i < this->n_classes;\n       i++)\n    {\n      JavaMethod *out = this->classes[i]->getMethodByAddress(addr);\n\n      if (out)\n\treturn out;\n    }\n\n  return NULL;\n}\n\nJavaMethod *Controller::getCallTableMethod()\n{\n  return this->callTableMethod;\n}\n\nInstruction *Controller::getInstructionByAddress(uint32_t address)\n{\n  if (address < this->elf->getEntryPoint() ||\n      address > this->elf->getEntryPoint() + this->elf->getTextSize())\n    return NULL;\n\n  return this->instructions[(address - this->elf->getEntryPoint()) \/ 4];\n}\n\n\nInstruction *Controller::getBranchTarget(uint32_t address)\n{\n  return this->getInstructionByAddress(address);\n}\n\nvoid Controller::lookupDataAddresses(JavaClass *cl, uint32_t *data, int n_entries)\n{\n  uint32_t text_start = this->elf->getEntryPoint();\n  uint32_t text_end = text_start + this->elf->getTextSize();\n\n  \/* Add labels for data pointing to the text segment *\/\n  for (int n = 0; n < n_entries; n++)\n    {\n      uint32_t v = be32_to_host(data[n]);\n\n      if (v >= text_start && v < text_end)\n        {\n          JavaMethod *mt = cl->getMethodByAddress(v);\n\n          \/* Something has an address in this method *\/\n          mt->addJumptabLabel(v);\n          this->addJumptabLabel(v);\n        }\n    }\n}\n\nbool Controller::pass1()\n{\n  bool out = true;\n\n  for (int i = 0; i < this->n_classes; i++)\n    {\n      JavaClass *cl = this->classes[i];\n\n      \/* Add addresses in the different ELF sections to the lookup tables *\/\n      this->lookupDataAddresses(cl, (uint32_t*)this->elf->getData(),\n                                this->elf->getDataSize() \/ sizeof(uint32_t));\n      this->lookupDataAddresses(cl, (uint32_t*)this->elf->getRodata(),\n                                this->elf->getRodataSize() \/ sizeof(uint32_t));\n      this->lookupDataAddresses(cl, (uint32_t*)this->elf->getCtors(),\n                                this->elf->getCtorsSize() \/ sizeof(uint32_t));\n      this->lookupDataAddresses(cl, (uint32_t*)this->elf->getDtors(),\n                                this->elf->getDtorsSize() \/ sizeof(uint32_t));\n\n      if (cl->pass1() != true)\n\tout = false;\n    }\n  this->callTableMethod->pass1();\n  this->sortJumptabLabels();\n\n  return out;\n}\n\n\nbool Controller::pass2()\n{\n  char buf[80];\n  bool out = true;\n\n  snprintf(buf, 80, \"%s\/%s\", this->dstdir, \"Cibyl.j\");\n  emit->setOutputFile(buf);\n  for (int i = 0; i < this->n_classes; i++)\n    {\n      if (this->classes[i]->pass2() != true)\n\tout = false;\n    }\n  snprintf(buf, 80, \"%s\/%s\", this->dstdir, \"CibylCallTable.java\");\n  emit->setOutputFile(buf);\n  this->callTableMethod->pass2();\n\n  return out;\n}\n\n\nController *controller;\nConfig *config;\n\nint main(int argc, const char *argv[])\n{\n  if (argc < 4)\n    {\n      fprintf(stderr, \"Too few arguments\\n\");\n      return 1;\n    }\n\n  emit = new Emit();\n  config = new Config();\n\n  regalloc = new RegisterAllocator();\n  controller = new Controller(argv[1], argv[2], argc-3, &argv[3]);\n\n  controller->pass0();\n  controller->pass1();\n  controller->pass2();\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\tThis file is part of solidity.\n\n\tsolidity is free software: you can redistribute it and\/or modify\n\tit under the terms of the GNU General Public License as published by\n\tthe Free Software Foundation, either version 3 of the License, or\n\t(at your option) any later version.\n\n\tsolidity is distributed in the hope that it will be useful,\n\tbut WITHOUT ANY WARRANTY; without even the implied warranty of\n\tMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n\tGNU General Public License for more details.\n\n\tYou should have received a copy of the GNU General Public License\n\talong with solidity.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\/**\n * @author Alex Beregszaszi\n * @date 2016\n * Standard JSON compiler interface.\n *\/\n\n#include <libsolidity\/interface\/StandardCompiler.h>\n#include <libsolidity\/interface\/SourceReferenceFormatter.h>\n#include <libevmasm\/Instruction.h>\n#include <libdevcore\/JSON.h>\n\nusing namespace std;\nusing namespace dev;\nusing namespace dev::solidity;\n\nJson::Value formatFatalError(string const& _type, string const& _description)\n{\n\tJson::Value error = Json::objectValue;\n\terror[\"type\"] = _type;\n\terror[\"component\"] = \"general\";\n\terror[\"severity\"] = \"error\";\n\terror[\"message\"] = _description;\n\n\tJson::Value output = Json::objectValue;\n\toutput[\"errors\"] = Json::arrayValue;\n\toutput[\"errors\"].append(error);\n\n\treturn output;\n}\n\nJson::Value StandardCompiler::compileInternal(Json::Value const& _input)\n{\n\tm_compilerStack.reset(false);\n\n\tJson::Value const& sources = _input[\"sources\"];\n\tif (!sources)\n\t{\n\t\t\/\/ @TODO report error\n\t\treturn Json::Value();\n\t}\n\n\tfor (auto const& sourceName: sources.getMemberNames())\n\t\tm_compilerStack.addSource(sourceName, sources[sourceName][\"content\"].asString());\n\n\tJson::Value const& settings = _input.get(\"settings\", Json::Value());\n\n\tvector<string> remappings;\n\tfor (auto const& remapping: settings.get(\"remappings\", Json::Value()))\n\t\tremappings.push_back(remapping.asString());\n\tm_compilerStack.setRemappings(remappings);\n\n\tJson::Value optimizerSettings = settings.get(\"optimizer\", Json::Value());\n\tbool optimize = optimizerSettings.get(\"enabled\", Json::Value(false)).asBool();\n\tunsigned optimizeRuns = optimizerSettings.get(\"runs\", Json::Value(200u)).asUInt();\n\n\tmap<string, h160> libraries;\n\tJson::Value jsonLibraries = settings.get(\"libraries\", Json::Value());\n\tfor (auto const& sourceName: jsonLibraries.getMemberNames())\n\t{\n\t\tauto const& jsonSourceName = jsonLibraries[sourceName];\n\t\tfor (auto const& library: jsonSourceName.getMemberNames())\n\t\t\t\/\/ @TODO use libraries only for the given source\n\t\t\tlibraries[library] = h160(jsonSourceName[library].asString());\n\t}\n\n\tauto scannerFromSourceName = [&](string const& _sourceName) -> solidity::Scanner const& { return m_compilerStack.scanner(_sourceName); };\n\n\ttry\n\t{\n\t\t\/\/ @TODO check return value and parse errors\n\t\tm_compilerStack.compile(optimize, optimizeRuns, libraries);\n\t}\n\tcatch (Error const& _error)\n\t{\n\t\tif (_error.type() == Error::Type::DocstringParsingError)\n\t\t\tcerr << \"Documentation parsing error: \" << *boost::get_error_info<errinfo_comment>(_error) << endl;\n\t\telse\n\t\t\tSourceReferenceFormatter::printExceptionInformation(cerr, _error, _error.typeName(), scannerFromSourceName);\n\n\t\treturn Json::Value();\n\t}\n\tcatch (CompilerError const& _exception)\n\t{\n\t\tSourceReferenceFormatter::printExceptionInformation(cerr, _exception, \"Compiler error\", scannerFromSourceName);\n\t\treturn Json::Value();\n\t}\n\tcatch (InternalCompilerError const& _exception)\n\t{\n\t\tcerr << \"Internal compiler error during compilation:\" << endl\n\t\t\t<< boost::diagnostic_information(_exception);\n\t\treturn Json::Value();\n\t}\n\tcatch (UnimplementedFeatureError const& _exception)\n\t{\n\t\tcerr << \"Unimplemented feature:\" << endl\n\t\t\t<< boost::diagnostic_information(_exception);\n\t\treturn Json::Value();\n\t}\n\tcatch (Exception const& _exception)\n\t{\n\t\tcerr << \"Exception during compilation: \" << boost::diagnostic_information(_exception) << endl;\n\t\treturn Json::Value();\n\t}\n\tcatch (...)\n\t{\n\t\tcerr << \"Unknown exception during compilation.\" << endl;\n\t\treturn Json::Value();\n\t}\n\n\tJson::Value output = Json::objectValue;\n\n\tJson::Value contractsOutput = Json::objectValue;\n\tfor (string const& contractName: m_compilerStack.contractNames())\n\t{\n\t\t\/\/ ABI, documentation and metadata\n\t\tJson::Value contractData(Json::objectValue);\n\t\tcontractData[\"abi\"] = dev::jsonCompactPrint(m_compilerStack.metadata(contractName, DocumentationType::ABIInterface));\n\t\tcontractData[\"metadata\"] = m_compilerStack.onChainMetadata(contractName);\n\t\tcontractData[\"userdoc\"] = dev::jsonCompactPrint(m_compilerStack.metadata(contractName, DocumentationType::NatspecUser));\n\t\tcontractData[\"devdoc\"] = dev::jsonCompactPrint(m_compilerStack.metadata(contractName, DocumentationType::NatspecDev));\n\n\t\t\/\/ EVM\n\t\tJson::Value evmData(Json::objectValue);\n\t\t\/\/ @TODO: add ir\n\t\t\/\/ @TODO: add assembly\n\t\t\/\/ @TODO: add legacyAssemblyJSON\n\t\tevmData[\"opcodes\"] = solidity::disassemble(m_compilerStack.object(contractName).bytecode);\n\t\t\/\/ @TODO: add methodIdentifiers\n\t\t\/\/ @TODO: add gasEstimates\n\n\t\t\/\/ EVM bytecode\n\t\tJson::Value bytecode(Json::objectValue);\n\t\tbytecode[\"object\"] = m_compilerStack.object(contractName).toHex();\n\t\tauto sourceMap = m_compilerStack.sourceMapping(contractName);\n\t\tbytecode[\"sourceMap\"] = sourceMap ? *sourceMap : \"\";\n\t\t\/\/ @TODO: add linkReferences\n\t\tevmData[\"bytecode\"] = bytecode;\n\n\t\t\/\/ EVM deployed bytecode\n\t\tJson::Value deployedBytecode(Json::objectValue);\n\t\tdeployedBytecode[\"object\"] = m_compilerStack.runtimeObject(contractName).toHex();\n\t\tauto runtimeSourceMap = m_compilerStack.runtimeSourceMapping(contractName);\n\t\tdeployedBytecode[\"sourceMap\"] = runtimeSourceMap ? *runtimeSourceMap : \"\";\n\t\t\/\/ @TODO: add linkReferences\n\t\tevmData[\"deployedBytecode\"] = deployedBytecode;\n\n\t\tcontractData[\"evm\"] = evmData;\n\n\t\tcontractsOutput[contractName] = contractData;\n\t}\n\toutput[\"contracts\"] = Json::objectValue;\n\toutput[\"contracts\"][\"\"] = contractsOutput;\n\n\treturn output;\n}\n\nJson::Value StandardCompiler::compile(Json::Value const& _input)\n{\n\ttry\n\t{\n\t\treturn compileInternal(_input);\n\t}\n\tcatch (...)\n\t{\n\t\treturn formatFatalError(\"InternalCompilerError\", \"Internal exception in StandardCompiler::compilerInternal\");\n\t}\n}\n\nstring StandardCompiler::compile(string const& _input)\n{\n\tJson::Value input;\n\tJson::Reader reader;\n\n\ttry\n\t{\n\t\tif (!reader.parse(_input, input, false))\n\t\t\treturn jsonCompactPrint(formatFatalError(\"JSONError\", reader.getFormattedErrorMessages()));\n\t}\n\tcatch(...)\n\t{\n\t\treturn \"{\\\"errors\\\":\\\"[{\\\"type\\\":\\\"JSONError\\\",\\\"component\\\":\\\"general\\\",\\\"severity\\\":\\\"error\\\",\\\"message\\\":\\\"Error parsing input JSON.\\\"}]}\";\n\t}\n\n\t\/\/ cout << \"Input: \" << input.toStyledString() << endl;\n\tJson::Value output = compile(input);\n\t\/\/ cout << \"Output: \" << output.toStyledString() << endl;\n\n\ttry\n\t{\n\t\treturn jsonCompactPrint(output);\n\t}\n\tcatch(...)\n\t{\n\t\treturn \"{\\\"errors\\\":\\\"[{\\\"type\\\":\\\"JSONError\\\",\\\"component\\\":\\\"general\\\",\\\"severity\\\":\\\"error\\\",\\\"message\\\":\\\"Error writing output JSON.\\\"}]}\";\n\t}\n}\n<commit_msg>Output legacyAssembly in StandardCompiler<commit_after>\/*\n\tThis file is part of solidity.\n\n\tsolidity is free software: you can redistribute it and\/or modify\n\tit under the terms of the GNU General Public License as published by\n\tthe Free Software Foundation, either version 3 of the License, or\n\t(at your option) any later version.\n\n\tsolidity is distributed in the hope that it will be useful,\n\tbut WITHOUT ANY WARRANTY; without even the implied warranty of\n\tMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n\tGNU General Public License for more details.\n\n\tYou should have received a copy of the GNU General Public License\n\talong with solidity.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\/**\n * @author Alex Beregszaszi\n * @date 2016\n * Standard JSON compiler interface.\n *\/\n\n#include <libsolidity\/interface\/StandardCompiler.h>\n#include <libsolidity\/interface\/SourceReferenceFormatter.h>\n#include <libevmasm\/Instruction.h>\n#include <libdevcore\/JSON.h>\n\nusing namespace std;\nusing namespace dev;\nusing namespace dev::solidity;\n\nJson::Value formatFatalError(string const& _type, string const& _description)\n{\n\tJson::Value error = Json::objectValue;\n\terror[\"type\"] = _type;\n\terror[\"component\"] = \"general\";\n\terror[\"severity\"] = \"error\";\n\terror[\"message\"] = _description;\n\n\tJson::Value output = Json::objectValue;\n\toutput[\"errors\"] = Json::arrayValue;\n\toutput[\"errors\"].append(error);\n\n\treturn output;\n}\n\nStringMap createSourceList(Json::Value const& _input)\n{\n\tStringMap sources;\n\tJson::Value const& jsonSources = _input[\"sources\"];\n\tif (jsonSources.isObject())\n\t\tfor (auto const& sourceName: jsonSources.getMemberNames())\n\t\t\tsources[sourceName] = jsonSources[sourceName][\"content\"].asString();\n\treturn sources;\n}\n\nJson::Value StandardCompiler::compileInternal(Json::Value const& _input)\n{\n\tm_compilerStack.reset(false);\n\n\tJson::Value const& sources = _input[\"sources\"];\n\tif (!sources)\n\t{\n\t\t\/\/ @TODO report error\n\t\treturn Json::Value();\n\t}\n\n\tfor (auto const& sourceName: sources.getMemberNames())\n\t\tm_compilerStack.addSource(sourceName, sources[sourceName][\"content\"].asString());\n\n\tJson::Value const& settings = _input.get(\"settings\", Json::Value());\n\n\tvector<string> remappings;\n\tfor (auto const& remapping: settings.get(\"remappings\", Json::Value()))\n\t\tremappings.push_back(remapping.asString());\n\tm_compilerStack.setRemappings(remappings);\n\n\tJson::Value optimizerSettings = settings.get(\"optimizer\", Json::Value());\n\tbool optimize = optimizerSettings.get(\"enabled\", Json::Value(false)).asBool();\n\tunsigned optimizeRuns = optimizerSettings.get(\"runs\", Json::Value(200u)).asUInt();\n\n\tmap<string, h160> libraries;\n\tJson::Value jsonLibraries = settings.get(\"libraries\", Json::Value());\n\tfor (auto const& sourceName: jsonLibraries.getMemberNames())\n\t{\n\t\tauto const& jsonSourceName = jsonLibraries[sourceName];\n\t\tfor (auto const& library: jsonSourceName.getMemberNames())\n\t\t\t\/\/ @TODO use libraries only for the given source\n\t\t\tlibraries[library] = h160(jsonSourceName[library].asString());\n\t}\n\n\tauto scannerFromSourceName = [&](string const& _sourceName) -> solidity::Scanner const& { return m_compilerStack.scanner(_sourceName); };\n\n\ttry\n\t{\n\t\t\/\/ @TODO check return value and parse errors\n\t\tm_compilerStack.compile(optimize, optimizeRuns, libraries);\n\t}\n\tcatch (Error const& _error)\n\t{\n\t\tif (_error.type() == Error::Type::DocstringParsingError)\n\t\t\tcerr << \"Documentation parsing error: \" << *boost::get_error_info<errinfo_comment>(_error) << endl;\n\t\telse\n\t\t\tSourceReferenceFormatter::printExceptionInformation(cerr, _error, _error.typeName(), scannerFromSourceName);\n\n\t\treturn Json::Value();\n\t}\n\tcatch (CompilerError const& _exception)\n\t{\n\t\tSourceReferenceFormatter::printExceptionInformation(cerr, _exception, \"Compiler error\", scannerFromSourceName);\n\t\treturn Json::Value();\n\t}\n\tcatch (InternalCompilerError const& _exception)\n\t{\n\t\tcerr << \"Internal compiler error during compilation:\" << endl\n\t\t\t<< boost::diagnostic_information(_exception);\n\t\treturn Json::Value();\n\t}\n\tcatch (UnimplementedFeatureError const& _exception)\n\t{\n\t\tcerr << \"Unimplemented feature:\" << endl\n\t\t\t<< boost::diagnostic_information(_exception);\n\t\treturn Json::Value();\n\t}\n\tcatch (Exception const& _exception)\n\t{\n\t\tcerr << \"Exception during compilation: \" << boost::diagnostic_information(_exception) << endl;\n\t\treturn Json::Value();\n\t}\n\tcatch (...)\n\t{\n\t\tcerr << \"Unknown exception during compilation.\" << endl;\n\t\treturn Json::Value();\n\t}\n\n\tJson::Value output = Json::objectValue;\n\n\tJson::Value contractsOutput = Json::objectValue;\n\tfor (string const& contractName: m_compilerStack.contractNames())\n\t{\n\t\t\/\/ ABI, documentation and metadata\n\t\tJson::Value contractData(Json::objectValue);\n\t\tcontractData[\"abi\"] = dev::jsonCompactPrint(m_compilerStack.metadata(contractName, DocumentationType::ABIInterface));\n\t\tcontractData[\"metadata\"] = m_compilerStack.onChainMetadata(contractName);\n\t\tcontractData[\"userdoc\"] = dev::jsonCompactPrint(m_compilerStack.metadata(contractName, DocumentationType::NatspecUser));\n\t\tcontractData[\"devdoc\"] = dev::jsonCompactPrint(m_compilerStack.metadata(contractName, DocumentationType::NatspecDev));\n\n\t\t\/\/ EVM\n\t\tJson::Value evmData(Json::objectValue);\n\t\t\/\/ @TODO: add ir\n\t\t\/\/ @TODO: add assembly\n\t\tostringstream unused;\n\t\tevmData[\"legacyAssembly\"] = m_compilerStack.streamAssembly(unused, contractName, createSourceList(_input), true);\n\t\tevmData[\"opcodes\"] = solidity::disassemble(m_compilerStack.object(contractName).bytecode);\n\t\t\/\/ @TODO: add methodIdentifiers\n\t\t\/\/ @TODO: add gasEstimates\n\n\t\t\/\/ EVM bytecode\n\t\tJson::Value bytecode(Json::objectValue);\n\t\tbytecode[\"object\"] = m_compilerStack.object(contractName).toHex();\n\t\tauto sourceMap = m_compilerStack.sourceMapping(contractName);\n\t\tbytecode[\"sourceMap\"] = sourceMap ? *sourceMap : \"\";\n\t\t\/\/ @TODO: add linkReferences\n\t\tevmData[\"bytecode\"] = bytecode;\n\n\t\t\/\/ EVM deployed bytecode\n\t\tJson::Value deployedBytecode(Json::objectValue);\n\t\tdeployedBytecode[\"object\"] = m_compilerStack.runtimeObject(contractName).toHex();\n\t\tauto runtimeSourceMap = m_compilerStack.runtimeSourceMapping(contractName);\n\t\tdeployedBytecode[\"sourceMap\"] = runtimeSourceMap ? *runtimeSourceMap : \"\";\n\t\t\/\/ @TODO: add linkReferences\n\t\tevmData[\"deployedBytecode\"] = deployedBytecode;\n\n\t\tcontractData[\"evm\"] = evmData;\n\n\t\tcontractsOutput[contractName] = contractData;\n\t}\n\toutput[\"contracts\"] = Json::objectValue;\n\toutput[\"contracts\"][\"\"] = contractsOutput;\n\n\treturn output;\n}\n\nJson::Value StandardCompiler::compile(Json::Value const& _input)\n{\n\ttry\n\t{\n\t\treturn compileInternal(_input);\n\t}\n\tcatch (...)\n\t{\n\t\treturn formatFatalError(\"InternalCompilerError\", \"Internal exception in StandardCompiler::compilerInternal\");\n\t}\n}\n\nstring StandardCompiler::compile(string const& _input)\n{\n\tJson::Value input;\n\tJson::Reader reader;\n\n\ttry\n\t{\n\t\tif (!reader.parse(_input, input, false))\n\t\t\treturn jsonCompactPrint(formatFatalError(\"JSONError\", reader.getFormattedErrorMessages()));\n\t}\n\tcatch(...)\n\t{\n\t\treturn \"{\\\"errors\\\":\\\"[{\\\"type\\\":\\\"JSONError\\\",\\\"component\\\":\\\"general\\\",\\\"severity\\\":\\\"error\\\",\\\"message\\\":\\\"Error parsing input JSON.\\\"}]}\";\n\t}\n\n\t\/\/ cout << \"Input: \" << input.toStyledString() << endl;\n\tJson::Value output = compile(input);\n\t\/\/ cout << \"Output: \" << output.toStyledString() << endl;\n\n\ttry\n\t{\n\t\treturn jsonCompactPrint(output);\n\t}\n\tcatch(...)\n\t{\n\t\treturn \"{\\\"errors\\\":\\\"[{\\\"type\\\":\\\"JSONError\\\",\\\"component\\\":\\\"general\\\",\\\"severity\\\":\\\"error\\\",\\\"message\\\":\\\"Error writing output JSON.\\\"}]}\";\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <AndroidClient.h>\n#include <jni.h>\n#include <android\/log.h>\n#include <vector>\n\n\n\nstatic jbyteArray convertToByteArray(JNIEnv * env, const std::string & s) {\n  const jbyte * pNativeMessage = reinterpret_cast<const jbyte*>(s.c_str());\n  jbyteArray bytes = env->NewByteArray(s.size());\n  env->SetByteArrayRegion(bytes, 0, s.size(), pNativeMessage);\n  return bytes;\n}\n\nAndroidClientCache::AndroidClientCache(JNIEnv * _env) : myEnv(_env) {\n  myEnv->GetJavaVM(&javaVM);\n  cookieManagerClass = (jclass) myEnv->NewGlobalRef(myEnv->FindClass(\"android\/webkit\/CookieManager\"));\n  httpClass = (jclass) myEnv->NewGlobalRef(myEnv->FindClass(\"java\/net\/HttpURLConnection\"));\n  urlClass = (jclass) myEnv->NewGlobalRef(myEnv->FindClass(\"java\/net\/URL\"));\n  urlConnectionClass = (jclass) myEnv->NewGlobalRef(myEnv->FindClass(\"java\/net\/URLConnection\"));\n  inputStreamClass = (jclass) myEnv->NewGlobalRef(myEnv->FindClass(\"java\/io\/InputStream\"));\n  frameworkClass = (jclass) myEnv->NewGlobalRef(myEnv->FindClass(\"com\/sometrik\/framework\/FrameWork\"));\n  outputStreamClass = (jclass) myEnv->NewGlobalRef(myEnv->FindClass(\"java\/io\/OutputStream\"));\n\n  setReadTimeoutMethod = myEnv->GetMethodID(urlConnectionClass, \"setReadTimeout\", \"(I)V\");\n  getHeaderMethod = myEnv->GetMethodID(httpClass, \"getHeaderField\", \"(Ljava\/lang\/String;)Ljava\/lang\/String;\");\n  getHeaderMethodInt = myEnv->GetMethodID(httpClass, \"getHeaderField\", \"(I)Ljava\/lang\/String;\");\n  getHeaderKeyMethod = myEnv->GetMethodID(httpClass, \"getHeaderFieldKey\", \"(I)Ljava\/lang\/String;\");\n  readMethod = myEnv->GetMethodID(inputStreamClass, \"read\", \"([B)I\");\n  urlConstructor = myEnv->GetMethodID(urlClass, \"<init>\", \"(Ljava\/lang\/String;)V\");\n  openConnectionMethod = myEnv->GetMethodID(urlClass, \"openConnection\", \"()Ljava\/net\/URLConnection;\");\n  setUseCachesMethod = myEnv->GetMethodID(urlConnectionClass, \"setUseCaches\", \"(Z)V\");\n  disconnectConnectionMethod = myEnv->GetMethodID(httpClass, \"disconnect\", \"()V\");\n  getOutputStreamMethod = myEnv->GetMethodID(urlConnectionClass, \"getOutputStream\", \"()Ljava\/io\/OutputStream;\");\n  outputStreamWriteMethod = myEnv->GetMethodID(outputStreamClass, \"write\", \"([B)V\");\n  setChunkedStreamingModeMethod = myEnv->GetMethodID(httpClass, \"setChunkedStreamingMode\", \"(I)V\");\n  setFixedLengthStreamingModeMethod = myEnv->GetMethodID(httpClass, \"setFixedLengthStreamingMode\", \"(I)V\");\n  setRequestProperty = myEnv->GetMethodID(httpClass, \"setRequestProperty\", \"(Ljava\/lang\/String;Ljava\/lang\/String;)V\");\n  setRequestMethod = myEnv->GetMethodID(httpClass, \"setRequestMethod\", \"(Ljava\/lang\/String;)V\");\n  setFollowMethod = myEnv->GetMethodID(httpClass, \"setInstanceFollowRedirects\", \"(Z)V\");\n  setDoInputMethod = myEnv->GetMethodID(httpClass, \"setDoInput\", \"(Z)V\");\n  setDoOutputMethod = myEnv->GetMethodID(httpClass, \"setDoOutput\", \"(Z)V\");\n  getResponseCodeMethod = myEnv->GetMethodID(httpClass, \"getResponseCode\", \"()I\");\n  getResponseMessageMethod = myEnv->GetMethodID(httpClass, \"getResponseMessage\", \"()Ljava\/lang\/String;\");\n  setRequestPropertyMethod = myEnv->GetMethodID(httpClass, \"setRequestProperty\", \"(Ljava\/lang\/String;Ljava\/lang\/String;)V\");\n  clearCookiesMethod = myEnv->GetMethodID(cookieManagerClass, \"removeAllCookie\", \"()V\");\n  getInputStreamMethod = myEnv->GetMethodID(httpClass, \"getInputStream\", \"()Ljava\/io\/InputStream;\");\n  getErrorStreamMethod = myEnv->GetMethodID(httpClass, \"getErrorStream\", \"()Ljava\/io\/InputStream;\");\n  handleThrowableMethod = myEnv->GetStaticMethodID(frameworkClass, \"handleNativeException\", \"(Ljava\/lang\/Throwable;)V\");\n}\n\nAndroidClientCache::~AndroidClientCache() {\n  __android_log_print(ANDROID_LOG_VERBOSE, \"AndroidClient\", \"destructor on clientCache\");\n  JNIEnv * env = getEnv();\n  env->DeleteGlobalRef(cookieManagerClass);\n  env->DeleteGlobalRef(httpClass);\n  env->DeleteGlobalRef(urlClass);\n  env->DeleteGlobalRef(inputStreamClass);\n  env->DeleteGlobalRef(frameworkClass);\n  env->DeleteGlobalRef(outputStreamClass);\n}\n\nclass AndroidClient : public HTTPClient {\npublic:\n  AndroidClient(const std::shared_ptr<AndroidClientCache> & _cache, const std::string & _user_agent, bool _enable_cookies, bool _enable_keepalive)\n    : HTTPClient(_user_agent, _enable_cookies, _enable_keepalive), cache(_cache) {\n\n    __android_log_print(ANDROID_LOG_INFO, \"Sometrik\", \"New AndroidClient\");\n  }\n\n\n\n  ~AndroidClient() {\n\n  }\n\n  void request(const HTTPRequest & req, const Authorization & auth, HTTPClientInterface & callback) {\n    JNIEnv * env = cache->getEnv();\n\n    __android_log_print(ANDROID_LOG_INFO, \"AndroidClient\", \"Host = %s, ua = %s\", req.getURI().c_str(), user_agent.c_str());\n    jstring juri = env->NewStringUTF(req.getURI().c_str());\n    jobject url = env->NewObject(cache->urlClass, cache->urlConstructor, juri);\n    env->DeleteLocalRef(juri);\n\n    jobject connection = env->CallObjectMethod(url, cache->openConnectionMethod);\n    env->CallVoidMethod(connection, cache->setUseCachesMethod, JNI_FALSE);\n    env->CallVoidMethod(connection, cache->setReadTimeoutMethod, req.getReadTimeout() * 1000);\n\/\/    env->CallVoidMethod(connection, cache->setConnectTimeoutMethod, req.getConnectTimeout() * 1000);\n    env->DeleteLocalRef(url);\n\n    \/\/Authorization example\n\/\/    env->CallVoidMethod(connection, setRequestPropertyMethod, env->NewStringUTF(\"Authorization\"), env->NewStringUTF(\"myUsername\"));\n    std::string auth_header = auth.createHeader();\n   env->CallVoidMethod(connection, cache->setFollowMethod, req.getFollowLocation() ? JNI_TRUE : JNI_FALSE);\n\n    \/\/ Setting headers for request\n    std::map<std::string, std::string> combined_headers;\n    for (auto & hd : default_headers) {\n      combined_headers[hd.first] = hd.second;\n    }\n    combined_headers[\"User-Agent\"] = user_agent;\n    if (req.getType() == HTTPRequest::POST && !req.getContentType().empty()) {\n      combined_headers[\"Content-Type\"] = req.getContentType();\n    }\n    for (auto & hd : req.getHeaders()) {\n      combined_headers[hd.first] = hd.second;\n    }\n    if (!auth_header.empty()) {\n      __android_log_print(ANDROID_LOG_INFO, \"AndroidClient\", \"Auth: %s = %s\", auth.getHeaderName(), auth_header.c_str());\n      combined_headers[auth.getHeaderName()] = auth_header;\n    }\n    for (auto & hd : combined_headers) {\n      jstring firstHeader = env->NewStringUTF(hd.first.c_str());\n      jstring secondHeader = env->NewStringUTF(hd.second.c_str());\n      env->CallVoidMethod(connection, cache->setRequestPropertyMethod, firstHeader, secondHeader);\n      env->DeleteLocalRef(firstHeader);\n      env->DeleteLocalRef(secondHeader);\n    }\n\n    env->CallVoidMethod(connection, cache->setDoOutputMethod, req.getType() == HTTPRequest::POST);\n    jstring jTypeString = env->NewStringUTF(req.getTypeString());\n    env->CallVoidMethod(connection, cache->setRequestMethod, jTypeString);\n    env->DeleteLocalRef(jTypeString);\n\n    bool connection_failed = false;\n    \n    if (req.getType() == HTTPRequest::POST) {\n      env->CallVoidMethod(connection, cache->setFixedLengthStreamingModeMethod, req.getContent().size());\n      jobject outputStream = env->CallObjectMethod(connection, cache->getOutputStreamMethod);\n      if (env->ExceptionCheck()) {\n\t__android_log_print(ANDROID_LOG_VERBOSE, \"AndroidClient\", \"Exception while posting content\");\n\tenv->ExceptionClear();\n\tconnection_failed = true;\n      }\n\n      for (int i = 0; i < req.getContent().size() && !connection_failed; i += 4096) {\n        auto a = convertToByteArray(env, req.getContent().substr(i, 4096));\n        env->CallVoidMethod(outputStream, cache->outputStreamWriteMethod, a);\n\t\n\tif (env->ExceptionCheck()) {\n          __android_log_print(ANDROID_LOG_VERBOSE, \"AndroidClient\", \"Exception while posting content\");\n\t  env->ExceptionClear();\n\t  connection_failed = true;\n        }\n\n\tenv->DeleteLocalRef(a);\n      }\n    }\n\n    int responseCode = 0;\n    if (!connection_failed) {\n      responseCode = env->CallIntMethod(connection, cache->getResponseCodeMethod);\n      if (env->ExceptionCheck()) {\n\tenv->ExceptionClear();\n\t__android_log_print(ANDROID_LOG_VERBOSE, \"AndroidClient\", \"EXCEPTION http request failed\");\n\tconnection_failed = true;\n      }\n    }\n\n    if (connection_failed) {\n      callback.handleResultCode(0);\n    } else {\n      __android_log_print(ANDROID_LOG_INFO, \"AndroidClient\", \"http request responsecode = %i\", responseCode);\n      callback.handleResultCode(responseCode);\n\n      jobject input = env->CallObjectMethod(connection, cache->getInputStreamMethod);\n      if (env->ExceptionCheck()) {\n        env->ExceptionClear();\n        __android_log_print(ANDROID_LOG_VERBOSE, \"AndroidClient\", \"Exception while getting input stream\");\n        input = env->CallObjectMethod(connection, cache->getErrorStreamMethod);\n\n        if (env->ExceptionCheck()) {\n          env->ExceptionClear();\n          __android_log_print(ANDROID_LOG_VERBOSE, \"AndroidClient\", \"Exception while getting error stream\");\n          input = 0;\n        }\n      }\n\n      if (input != 0) {\n\t\/\/ Gather headers and values\n\tfor (int i = 0;; i++) {\n\t  jstring jheaderKey = (jstring) env->CallObjectMethod(connection, cache->getHeaderKeyMethod, i);\n\t  if (jheaderKey == NULL) {\n\t    break;\n\t  }\n\t  const char * headerKey = env->GetStringUTFChars(jheaderKey, 0);\n\n\t  jstring jheader = (jstring) env->CallObjectMethod(connection, cache->getHeaderMethodInt, i);\n\t  const char * header = env->GetStringUTFChars(jheader, 0);\n\t  \/\/ __android_log_print(ANDROID_LOG_INFO, \"content\", \"header: %s = %s\", headerKey, header);\n\t  \n\t  callback.handleHeader(headerKey, header);\n\t  \n\t  if (strcasecmp(headerKey, \"Location\") == 0) {\n\t    callback.handleRedirectUrl(header);\n\t  }\n\t  \n\t  env->ReleaseStringUTFChars(jheaderKey, headerKey);\n          env->ReleaseStringUTFChars(jheader, header);\n\t  env->DeleteLocalRef(jheaderKey);\n\t  env->DeleteLocalRef(jheader);\n\t}\n\t\n\t\/\/ Gather content\n\tjbyteArray array = env->NewByteArray(4096);\n\tint g = 0;\n\twhile ((g = env->CallIntMethod(input, cache->readMethod, array)) != -1) {\n\n\t  if (env->ExceptionCheck()) {\n\t    __android_log_print(ANDROID_LOG_VERBOSE, \"AndroidClient\", \"Exception while reading content\");\n\t    env->ExceptionClear();\n\t    break;\n\t  }\n\t  jbyte* content_array = env->GetByteArrayElements(array, NULL);\n\t  bool r = callback.handleChunk(g, (char*) content_array);\n\t  env->ReleaseByteArrayElements(array, content_array, JNI_ABORT);\n\t  if (!r) {\n\t    break;\n\t  }\n\t  callback.onIdle();\n\t}\n\tenv->DeleteLocalRef(array);\n\tenv->DeleteLocalRef(input);\n      }\n      \n      env->CallVoidMethod(connection, cache->disconnectConnectionMethod);\n    }\n    callback.handleDisconnect();\n\n    env->DeleteLocalRef(connection);\n}\n\n\n  void clearCookies() {\n\/\/    JNIEnv * env = cache->getJNIEnv();\n\/\/    env->CallVoidMethod(cache->cookieManagerClass, cache->clearCookiesMethod);\n  }\n\nprivate:\n  std::shared_ptr<AndroidClientCache> cache;\n};\n\nstd::unique_ptr<HTTPClient>\nAndroidClientFactory::createClient2(const std::string & _user_agent, bool _enable_cookies, bool _enable_keepalive) {\n  return std::unique_ptr<AndroidClient>(new AndroidClient(cache, _user_agent, _enable_cookies, _enable_keepalive));\n}\n<commit_msg>remove unnecessary destructor, disable all prints<commit_after>#include <AndroidClient.h>\n#include <jni.h>\n#include <android\/log.h>\n#include <vector>\n\nstatic jbyteArray convertToByteArray(JNIEnv * env, const std::string & s) {\n  const jbyte * pNativeMessage = reinterpret_cast<const jbyte*>(s.c_str());\n  jbyteArray bytes = env->NewByteArray(s.size());\n  env->SetByteArrayRegion(bytes, 0, s.size(), pNativeMessage);\n  return bytes;\n}\n\nAndroidClientCache::AndroidClientCache(JNIEnv * _env) : myEnv(_env) {\n  myEnv->GetJavaVM(&javaVM);\n  cookieManagerClass = (jclass) myEnv->NewGlobalRef(myEnv->FindClass(\"android\/webkit\/CookieManager\"));\n  httpClass = (jclass) myEnv->NewGlobalRef(myEnv->FindClass(\"java\/net\/HttpURLConnection\"));\n  urlClass = (jclass) myEnv->NewGlobalRef(myEnv->FindClass(\"java\/net\/URL\"));\n  urlConnectionClass = (jclass) myEnv->NewGlobalRef(myEnv->FindClass(\"java\/net\/URLConnection\"));\n  inputStreamClass = (jclass) myEnv->NewGlobalRef(myEnv->FindClass(\"java\/io\/InputStream\"));\n  frameworkClass = (jclass) myEnv->NewGlobalRef(myEnv->FindClass(\"com\/sometrik\/framework\/FrameWork\"));\n  outputStreamClass = (jclass) myEnv->NewGlobalRef(myEnv->FindClass(\"java\/io\/OutputStream\"));\n\n  setReadTimeoutMethod = myEnv->GetMethodID(urlConnectionClass, \"setReadTimeout\", \"(I)V\");\n  getHeaderMethod = myEnv->GetMethodID(httpClass, \"getHeaderField\", \"(Ljava\/lang\/String;)Ljava\/lang\/String;\");\n  getHeaderMethodInt = myEnv->GetMethodID(httpClass, \"getHeaderField\", \"(I)Ljava\/lang\/String;\");\n  getHeaderKeyMethod = myEnv->GetMethodID(httpClass, \"getHeaderFieldKey\", \"(I)Ljava\/lang\/String;\");\n  readMethod = myEnv->GetMethodID(inputStreamClass, \"read\", \"([B)I\");\n  urlConstructor = myEnv->GetMethodID(urlClass, \"<init>\", \"(Ljava\/lang\/String;)V\");\n  openConnectionMethod = myEnv->GetMethodID(urlClass, \"openConnection\", \"()Ljava\/net\/URLConnection;\");\n  setUseCachesMethod = myEnv->GetMethodID(urlConnectionClass, \"setUseCaches\", \"(Z)V\");\n  disconnectConnectionMethod = myEnv->GetMethodID(httpClass, \"disconnect\", \"()V\");\n  getOutputStreamMethod = myEnv->GetMethodID(urlConnectionClass, \"getOutputStream\", \"()Ljava\/io\/OutputStream;\");\n  outputStreamWriteMethod = myEnv->GetMethodID(outputStreamClass, \"write\", \"([B)V\");\n  setChunkedStreamingModeMethod = myEnv->GetMethodID(httpClass, \"setChunkedStreamingMode\", \"(I)V\");\n  setFixedLengthStreamingModeMethod = myEnv->GetMethodID(httpClass, \"setFixedLengthStreamingMode\", \"(I)V\");\n  setRequestProperty = myEnv->GetMethodID(httpClass, \"setRequestProperty\", \"(Ljava\/lang\/String;Ljava\/lang\/String;)V\");\n  setRequestMethod = myEnv->GetMethodID(httpClass, \"setRequestMethod\", \"(Ljava\/lang\/String;)V\");\n  setFollowMethod = myEnv->GetMethodID(httpClass, \"setInstanceFollowRedirects\", \"(Z)V\");\n  setDoInputMethod = myEnv->GetMethodID(httpClass, \"setDoInput\", \"(Z)V\");\n  setDoOutputMethod = myEnv->GetMethodID(httpClass, \"setDoOutput\", \"(Z)V\");\n  getResponseCodeMethod = myEnv->GetMethodID(httpClass, \"getResponseCode\", \"()I\");\n  getResponseMessageMethod = myEnv->GetMethodID(httpClass, \"getResponseMessage\", \"()Ljava\/lang\/String;\");\n  setRequestPropertyMethod = myEnv->GetMethodID(httpClass, \"setRequestProperty\", \"(Ljava\/lang\/String;Ljava\/lang\/String;)V\");\n  clearCookiesMethod = myEnv->GetMethodID(cookieManagerClass, \"removeAllCookie\", \"()V\");\n  getInputStreamMethod = myEnv->GetMethodID(httpClass, \"getInputStream\", \"()Ljava\/io\/InputStream;\");\n  getErrorStreamMethod = myEnv->GetMethodID(httpClass, \"getErrorStream\", \"()Ljava\/io\/InputStream;\");\n  handleThrowableMethod = myEnv->GetStaticMethodID(frameworkClass, \"handleNativeException\", \"(Ljava\/lang\/Throwable;)V\");\n}\n\nAndroidClientCache::~AndroidClientCache() {\n  JNIEnv * env = getEnv();\n  env->DeleteGlobalRef(cookieManagerClass);\n  env->DeleteGlobalRef(httpClass);\n  env->DeleteGlobalRef(urlClass);\n  env->DeleteGlobalRef(inputStreamClass);\n  env->DeleteGlobalRef(frameworkClass);\n  env->DeleteGlobalRef(outputStreamClass);\n}\n\nclass AndroidClient : public HTTPClient {\npublic:\n  AndroidClient(const std::shared_ptr<AndroidClientCache> & _cache, const std::string & _user_agent, bool _enable_cookies, bool _enable_keepalive)\n    : HTTPClient(_user_agent, _enable_cookies, _enable_keepalive), cache(_cache) {\n  }\n\n  void request(const HTTPRequest & req, const Authorization & auth, HTTPClientInterface & callback) {\n    JNIEnv * env = cache->getEnv();\n\n    \/\/ __android_log_print(ANDROID_LOG_INFO, \"AndroidClient\", \"Host = %s, ua = %s\", req.getURI().c_str(), user_agent.c_str());\n    jstring juri = env->NewStringUTF(req.getURI().c_str());\n    jobject url = env->NewObject(cache->urlClass, cache->urlConstructor, juri);\n    env->DeleteLocalRef(juri);\n\n    jobject connection = env->CallObjectMethod(url, cache->openConnectionMethod);\n    env->CallVoidMethod(connection, cache->setUseCachesMethod, JNI_FALSE);\n    env->CallVoidMethod(connection, cache->setReadTimeoutMethod, req.getReadTimeout() * 1000);\n\/\/    env->CallVoidMethod(connection, cache->setConnectTimeoutMethod, req.getConnectTimeout() * 1000);\n    env->DeleteLocalRef(url);\n\n    \/\/Authorization example\n\/\/    env->CallVoidMethod(connection, setRequestPropertyMethod, env->NewStringUTF(\"Authorization\"), env->NewStringUTF(\"myUsername\"));\n    std::string auth_header = auth.createHeader();\n    env->CallVoidMethod(connection, cache->setFollowMethod, req.getFollowLocation() ? JNI_TRUE : JNI_FALSE);\n\n    \/\/ Setting headers for request\n    std::map<std::string, std::string> combined_headers;\n    for (auto & hd : default_headers) {\n      combined_headers[hd.first] = hd.second;\n    }\n    combined_headers[\"User-Agent\"] = user_agent;\n    if (req.getType() == HTTPRequest::POST && !req.getContentType().empty()) {\n      combined_headers[\"Content-Type\"] = req.getContentType();\n    }\n    for (auto & hd : req.getHeaders()) {\n      combined_headers[hd.first] = hd.second;\n    }\n    if (!auth_header.empty()) {\n      \/\/ __android_log_print(ANDROID_LOG_INFO, \"AndroidClient\", \"Auth: %s = %s\", auth.getHeaderName(), auth_header.c_str());\n      combined_headers[auth.getHeaderName()] = auth_header;\n    }\n    for (auto & hd : combined_headers) {\n      jstring firstHeader = env->NewStringUTF(hd.first.c_str());\n      jstring secondHeader = env->NewStringUTF(hd.second.c_str());\n      env->CallVoidMethod(connection, cache->setRequestPropertyMethod, firstHeader, secondHeader);\n      env->DeleteLocalRef(firstHeader);\n      env->DeleteLocalRef(secondHeader);\n    }\n\n    env->CallVoidMethod(connection, cache->setDoOutputMethod, req.getType() == HTTPRequest::POST);\n    jstring jTypeString = env->NewStringUTF(req.getTypeString());\n    env->CallVoidMethod(connection, cache->setRequestMethod, jTypeString);\n    env->DeleteLocalRef(jTypeString);\n\n    bool connection_failed = false;\n    \n    if (req.getType() == HTTPRequest::POST) {\n      env->CallVoidMethod(connection, cache->setFixedLengthStreamingModeMethod, req.getContent().size());\n      jobject outputStream = env->CallObjectMethod(connection, cache->getOutputStreamMethod);\n      if (env->ExceptionCheck()) {\n\t\/\/ __android_log_print(ANDROID_LOG_VERBOSE, \"AndroidClient\", \"Exception while posting content\");\n\tenv->ExceptionClear();\n\tconnection_failed = true;\n      }\n\n      for (int i = 0; i < req.getContent().size() && !connection_failed; i += 4096) {\n        auto a = convertToByteArray(env, req.getContent().substr(i, 4096));\n        env->CallVoidMethod(outputStream, cache->outputStreamWriteMethod, a);\n\t\n\tif (env->ExceptionCheck()) {\n          \/\/ __android_log_print(ANDROID_LOG_VERBOSE, \"AndroidClient\", \"Exception while posting content\");\n\t  env->ExceptionClear();\n\t  connection_failed = true;\n        }\n\n\tenv->DeleteLocalRef(a);\n      }\n    }\n\n    int responseCode = 0;\n    if (!connection_failed) {\n      responseCode = env->CallIntMethod(connection, cache->getResponseCodeMethod);\n      if (env->ExceptionCheck()) {\n\tenv->ExceptionClear();\n\t\/\/ __android_log_print(ANDROID_LOG_VERBOSE, \"AndroidClient\", \"EXCEPTION http request failed\");\n\tconnection_failed = true;\n      }\n    }\n\n    if (connection_failed) {\n      callback.handleResultCode(0);\n    } else {\n      \/\/ __android_log_print(ANDROID_LOG_INFO, \"AndroidClient\", \"http request responsecode = %i\", responseCode);\n      callback.handleResultCode(responseCode);\n\n      jobject input = env->CallObjectMethod(connection, cache->getInputStreamMethod);\n      if (env->ExceptionCheck()) {\n        env->ExceptionClear();\n        \/\/ __android_log_print(ANDROID_LOG_VERBOSE, \"AndroidClient\", \"Exception while getting input stream\");\n        input = env->CallObjectMethod(connection, cache->getErrorStreamMethod);\n\n        if (env->ExceptionCheck()) {\n          env->ExceptionClear();\n          \/\/ __android_log_print(ANDROID_LOG_VERBOSE, \"AndroidClient\", \"Exception while getting error stream\");\n          input = 0;\n        }\n      }\n\n      if (input != 0) {\n\t\/\/ Gather headers and values\n\tfor (int i = 0;; i++) {\n\t  jstring jheaderKey = (jstring) env->CallObjectMethod(connection, cache->getHeaderKeyMethod, i);\n\t  if (jheaderKey == NULL) {\n\t    break;\n\t  }\n\t  const char * headerKey = env->GetStringUTFChars(jheaderKey, 0);\n\n\t  jstring jheader = (jstring) env->CallObjectMethod(connection, cache->getHeaderMethodInt, i);\n\t  const char * header = env->GetStringUTFChars(jheader, 0);\n\t  \/\/ __android_log_print(ANDROID_LOG_INFO, \"content\", \"header: %s = %s\", headerKey, header);\n\t  \n\t  callback.handleHeader(headerKey, header);\n\t  \n\t  if (strcasecmp(headerKey, \"Location\") == 0) {\n\t    callback.handleRedirectUrl(header);\n\t  }\n\t  \n\t  env->ReleaseStringUTFChars(jheaderKey, headerKey);\n          env->ReleaseStringUTFChars(jheader, header);\n\t  env->DeleteLocalRef(jheaderKey);\n\t  env->DeleteLocalRef(jheader);\n\t}\n\t\n\t\/\/ Gather content\n\tjbyteArray array = env->NewByteArray(4096);\n\tint g = 0;\n\twhile ((g = env->CallIntMethod(input, cache->readMethod, array)) != -1) {\n\n\t  if (env->ExceptionCheck()) {\n\t    \/\/ __android_log_print(ANDROID_LOG_VERBOSE, \"AndroidClient\", \"Exception while reading content\");\n\t    env->ExceptionClear();\n\t    break;\n\t  }\n\t  jbyte* content_array = env->GetByteArrayElements(array, NULL);\n\t  bool r = callback.handleChunk(g, (char*) content_array);\n\t  env->ReleaseByteArrayElements(array, content_array, JNI_ABORT);\n\t  if (!r || !callback.onIdle()) {\n\t    break;\n\t  }\n\t}\n\tenv->DeleteLocalRef(array);\n\tenv->DeleteLocalRef(input);\n      }\n      \n      env->CallVoidMethod(connection, cache->disconnectConnectionMethod);\n    }\n    callback.handleDisconnect();\n\n    env->DeleteLocalRef(connection);\n  }\n\n  void clearCookies() {\n\/\/    JNIEnv * env = cache->getJNIEnv();\n\/\/    env->CallVoidMethod(cache->cookieManagerClass, cache->clearCookiesMethod);\n  }\n\nprivate:\n  std::shared_ptr<AndroidClientCache> cache;\n};\n\nstd::unique_ptr<HTTPClient>\nAndroidClientFactory::createClient2(const std::string & _user_agent, bool _enable_cookies, bool _enable_keepalive) {\n  return std::unique_ptr<AndroidClient>(new AndroidClient(cache, _user_agent, _enable_cookies, _enable_keepalive));\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <cmath>\n#include <vector>\n\n#include \"drake\/systems\/plants\/collision\/DrakeCollision.h\"\n#include \"drake\/systems\/plants\/collision\/Model.h\"\n#include \"gtest\/gtest.h\"\n\nusing Eigen::Isometry3d;\nusing Eigen::Vector3d;\n\nnamespace DrakeCollision {\nnamespace {\n\n\/*\n * Three bodies (cube (1 m edges) and two spheres (0.5 m radii) arranged like\n *this\n *\n *                             *****\n *                           **     **\n *                           *   3   * --+--\n *                           **     **   |\n *                             *****     |\n *                                       |\n *          ^                           2 m\n *        y |                            |\n *          |                            |\n *      +---+---+              *****     |\n *      |   |   |            **      *   |\n *      |   +---+---->       *   2   * --+--\n *      | 1     |   x        **     **\n *      +-------+              *****\n *          |                    |\n *          +------ 2 m ---------+\n *          |                    |\n *\n *\/\nTEST(ModelTest, ClosestPointsAllToAll) {\n  \/\/ Set up the geometry.\n  Isometry3d T_body1_to_world, T_body2_to_world, T_body3_to_world,\n      T_elem2_to_body;\n  T_body1_to_world.setIdentity();\n  T_body2_to_world.setIdentity();\n  T_body3_to_world.setIdentity();\n  T_body2_to_world.translation() << 1, 0, 0;\n  T_elem2_to_body.setIdentity();\n  T_elem2_to_body.translation() << 1, 0, 0;\n  T_body3_to_world.translation() << 2, 2, 0;\n  T_body3_to_world.matrix().block<2, 2>(0, 0) << 0, -1, 1,\n      0;  \/\/ rotate 90 degrees in z\n\n  DrakeShapes::Box geometry_1(Vector3d(1, 1, 1));\n  DrakeShapes::Sphere geometry_2(0.5);\n  DrakeShapes::Sphere geometry_3(0.5);\n  CollisionElement element_1(geometry_1);\n  CollisionElement element_2(geometry_2, T_elem2_to_body);\n  CollisionElement element_3(geometry_3);\n\n  \/\/ Populate the model.\n  std::shared_ptr<Model> model = newModel();\n  ElementId id1 = model->addElement(element_1);\n  ElementId id2 = model->addElement(element_2);\n  ElementId id3 = model->addElement(element_3);\n  model->updateElementWorldTransform(id1, T_body1_to_world);\n  model->updateElementWorldTransform(id2, T_body2_to_world);\n  model->updateElementWorldTransform(id3, T_body3_to_world);\n\n  \/\/ Compute the closest points.\n  const std::vector<ElementId> ids_to_check = {id1, id2, id3};\n  std::vector<PointPair> points;\n  model->closestPointsAllToAll(ids_to_check, true, points);\n  ASSERT_EQ(3, points.size());\n\n  \/\/ Check the closest point between object 1 and object 2.\n  \/\/ TODO(david-german-tri): Migrate this test to use Eigen matchers once\n  \/\/ they are available.\n  EXPECT_EQ(id1, points[0].getIdA());\n  EXPECT_EQ(id2, points[0].getIdB());\n  EXPECT_EQ(1.0, points[0].getDistance());\n  EXPECT_EQ(Vector3d(-1, 0, 0), points[0].getNormal());\n  EXPECT_TRUE((Vector3d(0.5, 0, 0) - points[0].getPtA()).isZero());\n  EXPECT_TRUE((Vector3d(0.5, 0, 0) - points[0].getPtB()).isZero());\n\n  \/\/ Check the closest point between object 1 and object 3.\n  EXPECT_EQ(id1, points[1].getIdA());\n  EXPECT_EQ(id3, points[1].getIdB());\n  EXPECT_EQ(1.6213203435596428, points[1].getDistance());\n  EXPECT_EQ(Vector3d(-sqrt(2) \/ 2, -sqrt(2) \/ 2, 0), points[1].getNormal());\n  EXPECT_TRUE((Vector3d(0.5, 0.5, 0) - points[1].getPtA()).isZero());\n  EXPECT_TRUE(\n      (Vector3d(-sqrt(2) \/ 4, sqrt(2) \/ 4, 0) - points[1].getPtB()).isZero());\n\n  \/\/ Check the closest point between object 2 and object 3.\n  EXPECT_EQ(id2, points[2].getIdA());\n  EXPECT_EQ(id3, points[2].getIdB());\n  EXPECT_EQ(1.0, points[2].getDistance());\n  EXPECT_EQ(Vector3d(0, -1, 0), points[2].getNormal());\n  EXPECT_TRUE((Vector3d(1, 0.5, 0) - points[2].getPtA()).isZero());\n  EXPECT_TRUE((Vector3d(-0.5, 0, 0) - points[2].getPtB()).isZero());\n}\n\nTEST(ModelTest, CollisionGroups) {\n  CollisionElement element_1, element_2, element_3;\n\n  \/\/ Add element 1 to its own set of groups.\n  element_1.add_to_collision_group(2);\n  element_1.add_to_collision_group(23);\n  element_1.add_to_collision_group(11);\n  element_1.add_to_collision_group(15);\n  element_1.add_to_collision_group(9);\n  std::vector<int> element_1_set = std::vector<int>({2, 9, 11, 15, 23});\n\n  \/\/ Tests the situation where the same collision groups are added to a\n  \/\/ collision element multiple times.\n  \/\/ If a collision element is added to a group it already belongs to, the\n  \/\/ addition has no effect. This is tested by asserting the total number of\n  \/\/ elements in the test below.\n  element_1.add_to_collision_group(11);\n  element_1.add_to_collision_group(23);\n\n  \/\/ Add element 2 to its own set of groups.\n  element_2.add_to_collision_group(11);\n  element_2.add_to_collision_group(9);\n  element_2.add_to_collision_group(13);\n  element_2.add_to_collision_group(13);\n  element_2.add_to_collision_group(11);\n\n  \/\/ Add element 3 to its own set of groups.\n  element_3.add_to_collision_group(1);\n  element_3.add_to_collision_group(13);\n  element_3.add_to_collision_group(13);\n  element_3.add_to_collision_group(8);\n  element_3.add_to_collision_group(1);\n\n  \/\/ Check the correctness of each element's collision groups set.\n  EXPECT_EQ(std::vector<int>({2, 9, 11, 15, 23}), element_1.collision_groups());\n  EXPECT_EQ(std::vector<int>({9, 11, 13}), element_2.collision_groups());\n  EXPECT_EQ(std::vector<int>({1, 8, 13}), element_3.collision_groups());\n\n  \/\/ Groups cannot be repeated. Therefore expect 5 groups instead of 7.\n  ASSERT_EQ(5, element_1.number_of_groups());\n\n  \/\/ Groups cannot be repeated for element_2 either.\n  ASSERT_EQ(3, element_2.number_of_groups());\n\n  \/\/ Groups cannot be repeated for element_3 either.\n  ASSERT_EQ(3, element_3.number_of_groups());\n\n  \/\/ element_2 does not collide with element_1 (groups 9 and 11 in common).\n  EXPECT_FALSE(element_2.CollidesWith(&element_1));\n\n  \/\/ element_2 does not collide with element_3 (group 13 in common).\n  EXPECT_FALSE(element_2.CollidesWith(&element_3));\n\n  \/\/ element_3 does collide with element_1 (no groups in common).\n  EXPECT_TRUE(element_3.CollidesWith(&element_1));\n\n  \/\/ element_3 does not collide with element_2 (group 13 in common).\n  EXPECT_FALSE(element_3.CollidesWith(&element_2));\n}\n\n}  \/\/ namespace\n}  \/\/ namespace DrakeCollision\n<commit_msg>Change comments from imperative to descriptive<commit_after>#include <cmath>\n#include <vector>\n\n#include \"drake\/systems\/plants\/collision\/DrakeCollision.h\"\n#include \"drake\/systems\/plants\/collision\/Model.h\"\n#include \"gtest\/gtest.h\"\n\nusing Eigen::Isometry3d;\nusing Eigen::Vector3d;\n\nnamespace DrakeCollision {\nnamespace {\n\n\/*\n * Three bodies (cube (1 m edges) and two spheres (0.5 m radii) arranged like\n *this\n *\n *                             *****\n *                           **     **\n *                           *   3   * --+--\n *                           **     **   |\n *                             *****     |\n *                                       |\n *          ^                           2 m\n *        y |                            |\n *          |                            |\n *      +---+---+              *****     |\n *      |   |   |            **      *   |\n *      |   +---+---->       *   2   * --+--\n *      | 1     |   x        **     **\n *      +-------+              *****\n *          |                    |\n *          +------ 2 m ---------+\n *          |                    |\n *\n *\/\nTEST(ModelTest, ClosestPointsAllToAll) {\n  \/\/ Set up the geometry.\n  Isometry3d T_body1_to_world, T_body2_to_world, T_body3_to_world,\n      T_elem2_to_body;\n  T_body1_to_world.setIdentity();\n  T_body2_to_world.setIdentity();\n  T_body3_to_world.setIdentity();\n  T_body2_to_world.translation() << 1, 0, 0;\n  T_elem2_to_body.setIdentity();\n  T_elem2_to_body.translation() << 1, 0, 0;\n  T_body3_to_world.translation() << 2, 2, 0;\n  T_body3_to_world.matrix().block<2, 2>(0, 0) << 0, -1, 1,\n      0;  \/\/ rotate 90 degrees in z\n\n  DrakeShapes::Box geometry_1(Vector3d(1, 1, 1));\n  DrakeShapes::Sphere geometry_2(0.5);\n  DrakeShapes::Sphere geometry_3(0.5);\n  CollisionElement element_1(geometry_1);\n  CollisionElement element_2(geometry_2, T_elem2_to_body);\n  CollisionElement element_3(geometry_3);\n\n  \/\/ Populate the model.\n  std::shared_ptr<Model> model = newModel();\n  ElementId id1 = model->addElement(element_1);\n  ElementId id2 = model->addElement(element_2);\n  ElementId id3 = model->addElement(element_3);\n  model->updateElementWorldTransform(id1, T_body1_to_world);\n  model->updateElementWorldTransform(id2, T_body2_to_world);\n  model->updateElementWorldTransform(id3, T_body3_to_world);\n\n  \/\/ Compute the closest points.\n  const std::vector<ElementId> ids_to_check = {id1, id2, id3};\n  std::vector<PointPair> points;\n  model->closestPointsAllToAll(ids_to_check, true, points);\n  ASSERT_EQ(3, points.size());\n\n  \/\/ Check the closest point between object 1 and object 2.\n  \/\/ TODO(david-german-tri): Migrate this test to use Eigen matchers once\n  \/\/ they are available.\n  EXPECT_EQ(id1, points[0].getIdA());\n  EXPECT_EQ(id2, points[0].getIdB());\n  EXPECT_EQ(1.0, points[0].getDistance());\n  EXPECT_EQ(Vector3d(-1, 0, 0), points[0].getNormal());\n  EXPECT_TRUE((Vector3d(0.5, 0, 0) - points[0].getPtA()).isZero());\n  EXPECT_TRUE((Vector3d(0.5, 0, 0) - points[0].getPtB()).isZero());\n\n  \/\/ Check the closest point between object 1 and object 3.\n  EXPECT_EQ(id1, points[1].getIdA());\n  EXPECT_EQ(id3, points[1].getIdB());\n  EXPECT_EQ(1.6213203435596428, points[1].getDistance());\n  EXPECT_EQ(Vector3d(-sqrt(2) \/ 2, -sqrt(2) \/ 2, 0), points[1].getNormal());\n  EXPECT_TRUE((Vector3d(0.5, 0.5, 0) - points[1].getPtA()).isZero());\n  EXPECT_TRUE(\n      (Vector3d(-sqrt(2) \/ 4, sqrt(2) \/ 4, 0) - points[1].getPtB()).isZero());\n\n  \/\/ Check the closest point between object 2 and object 3.\n  EXPECT_EQ(id2, points[2].getIdA());\n  EXPECT_EQ(id3, points[2].getIdB());\n  EXPECT_EQ(1.0, points[2].getDistance());\n  EXPECT_EQ(Vector3d(0, -1, 0), points[2].getNormal());\n  EXPECT_TRUE((Vector3d(1, 0.5, 0) - points[2].getPtA()).isZero());\n  EXPECT_TRUE((Vector3d(-0.5, 0, 0) - points[2].getPtB()).isZero());\n}\n\nTEST(ModelTest, CollisionGroups) {\n  CollisionElement element_1, element_2, element_3;\n\n  \/\/ Adds element 1 to its own set of groups.\n  element_1.add_to_collision_group(2);\n  element_1.add_to_collision_group(23);\n  element_1.add_to_collision_group(11);\n  element_1.add_to_collision_group(15);\n  element_1.add_to_collision_group(9);\n  std::vector<int> element_1_set = std::vector<int>({2, 9, 11, 15, 23});\n\n  \/\/ Tests the situation where the same collision groups are added to a\n  \/\/ collision element multiple times.\n  \/\/ If a collision element is added to a group it already belongs to, the\n  \/\/ addition has no effect. This is tested by asserting the total number of\n  \/\/ elements in the test below.\n  element_1.add_to_collision_group(11);\n  element_1.add_to_collision_group(23);\n\n  \/\/ Adds element 2 to its own set of groups.\n  element_2.add_to_collision_group(11);\n  element_2.add_to_collision_group(9);\n  element_2.add_to_collision_group(13);\n  element_2.add_to_collision_group(13);\n  element_2.add_to_collision_group(11);\n\n  \/\/ Adds element 3 to its own set of groups.\n  element_3.add_to_collision_group(1);\n  element_3.add_to_collision_group(13);\n  element_3.add_to_collision_group(13);\n  element_3.add_to_collision_group(8);\n  element_3.add_to_collision_group(1);\n\n  \/\/ Checks the correctness of each element's collision groups set.\n  EXPECT_EQ(std::vector<int>({2, 9, 11, 15, 23}), element_1.collision_groups());\n  EXPECT_EQ(std::vector<int>({9, 11, 13}), element_2.collision_groups());\n  EXPECT_EQ(std::vector<int>({1, 8, 13}), element_3.collision_groups());\n\n  \/\/ Groups cannot be repeated. Therefore expect 5 groups instead of 7.\n  ASSERT_EQ(5, element_1.number_of_groups());\n\n  \/\/ Groups cannot be repeated for element_2 either.\n  ASSERT_EQ(3, element_2.number_of_groups());\n\n  \/\/ Groups cannot be repeated for element_3 either.\n  ASSERT_EQ(3, element_3.number_of_groups());\n\n  \/\/ element_2 does not collide with element_1 (groups 9 and 11 in common).\n  EXPECT_FALSE(element_2.CollidesWith(&element_1));\n\n  \/\/ element_2 does not collide with element_3 (group 13 in common).\n  EXPECT_FALSE(element_2.CollidesWith(&element_3));\n\n  \/\/ element_3 does collide with element_1 (no groups in common).\n  EXPECT_TRUE(element_3.CollidesWith(&element_1));\n\n  \/\/ element_3 does not collide with element_2 (group 13 in common).\n  EXPECT_FALSE(element_3.CollidesWith(&element_2));\n}\n\n}  \/\/ namespace\n}  \/\/ namespace DrakeCollision\n<|endoftext|>"}
{"text":"<commit_before>#include \"inverseKinBackend.h\"\n\n#include <stdexcept>\n\nusing Eigen::Map;\nusing Eigen::MatrixBase;\nusing Eigen::MatrixXd;\nusing Eigen::VectorXd;\n\nnamespace Drake {\nnamespace systems {\nnamespace plants {\n\ntemplate <typename DerivedA, typename DerivedB, typename DerivedC,\n          typename DerivedD, typename DerivedE>\nvoid inverseKinSnoptBackend(\n    RigidBodyTree* model_input, const int mode, const int nT_input,\n    const double* t_input, const MatrixBase<DerivedA>& q_seed,\n    const MatrixBase<DerivedB>& q_nom_input, const int num_constraints,\n    RigidBodyConstraint** const constraint_array,\n    const IKoptions& ikoptions, MatrixBase<DerivedC>* q_sol,\n    MatrixBase<DerivedD>* qdot_sol, MatrixBase<DerivedE>* qddot_sol, int* INFO,\n    std::vector<std::string>* infeasible_constraint) {\n  throw std::runtime_error(\"SNOPT solver not available.\");\n}\n\ntemplate void inverseKinSnoptBackend(\n    RigidBodyTree* model, const int mode, const int nT,\n    const double* t,const MatrixBase<Map<MatrixXd>>& q_seed,\n    const MatrixBase<Map<MatrixXd>>& q_nom, const int num_constraints,\n    RigidBodyConstraint** const constraint_array,\n    const IKoptions& ikoptions, MatrixBase<Map<MatrixXd>>* q_sol,\n    MatrixBase<Map<MatrixXd>>* qdot_sol, MatrixBase<Map<MatrixXd>>* qddot_sol,\n    int* INFO, std::vector<std::string>* infeasible_constraint);\ntemplate void inverseKinSnoptBackend(\n    RigidBodyTree* model, const int mode, const int nT,\n    const double* t, const MatrixBase<MatrixXd>& q_seed,\n    const MatrixBase<MatrixXd>& q_nom, const int num_constraints,\n    RigidBodyConstraint** const constraint_array,\n    const IKoptions& ikoptions, MatrixBase<MatrixXd>* q_sol,\n    MatrixBase<MatrixXd>* qdot_sol, MatrixBase<MatrixXd>* qddot_sol,\n    int* INFO, std::vector<std::string>* infeasible_constraint);\ntemplate void inverseKinSnoptBackend(\n    RigidBodyTree* model, const int mode, const int nT,\n    const double* t, const MatrixBase<Map<MatrixXd>>& q_seed,\n    const MatrixBase<Map<MatrixXd>>& q_nom, const int num_constraints,\n    RigidBodyConstraint** const constraint_array,\n    const IKoptions& ikoptions, MatrixBase<Map<MatrixXd>>* q_sol,\n    MatrixBase<MatrixXd>* qdot_sol, MatrixBase<MatrixXd>* qddot_sol,\n    int* INFO, std::vector<std::string>* infeasible_constraint);\ntemplate void inverseKinSnoptBackend(\n    RigidBodyTree* model, const int mode, const int nT,\n    const double* t, const MatrixBase<Map<VectorXd>>& q_seed,\n    const MatrixBase<Map<VectorXd>>& q_nom, const int num_constraints,\n    RigidBodyConstraint** const constraint_array,\n    const IKoptions& ikoptions, MatrixBase<Map<VectorXd>>* q_sol,\n    MatrixBase<Map<VectorXd>>* qdot_sol, MatrixBase<Map<VectorXd>>* qddot_sol,\n    int* INFO, std::vector<std::string>* infeasible_constraint);\ntemplate void inverseKinSnoptBackend(\n    RigidBodyTree* model, const int mode, const int nT,\n    const double* t, const MatrixBase<VectorXd>& q_seed,\n    const MatrixBase<VectorXd>& q_nom, const int num_constraints,\n    RigidBodyConstraint** const constraint_array,\n    const IKoptions& ikoptions, MatrixBase<VectorXd>* q_sol,\n    MatrixBase<VectorXd>* qdot_sol, MatrixBase<VectorXd>* qddot_sol,\n    int* INFO, std::vector<std::string>* infeasible_constraint);\ntemplate void inverseKinSnoptBackend(\n    RigidBodyTree* model, const int mode, const int nT,\n    const double* t, const MatrixBase<Map<VectorXd>>& q_seed,\n    const MatrixBase<Map<VectorXd>>& q_nom, const int num_constraints,\n    RigidBodyConstraint** const constraint_array,\n    const IKoptions& ikoptions, MatrixBase<Map<VectorXd>>* q_sol,\n    MatrixBase<VectorXd>* qdot_sol, MatrixBase<VectorXd>* qddot_sol,\n    int* INFO, std::vector<std::string>* infeasible_constraint);\n\n}\n}\n}\n<commit_msg>Add another space.<commit_after>#include \"inverseKinBackend.h\"\n\n#include <stdexcept>\n\nusing Eigen::Map;\nusing Eigen::MatrixBase;\nusing Eigen::MatrixXd;\nusing Eigen::VectorXd;\n\nnamespace Drake {\nnamespace systems {\nnamespace plants {\n\ntemplate <typename DerivedA, typename DerivedB, typename DerivedC,\n          typename DerivedD, typename DerivedE>\nvoid inverseKinSnoptBackend(\n    RigidBodyTree* model_input, const int mode, const int nT_input,\n    const double* t_input, const MatrixBase<DerivedA>& q_seed,\n    const MatrixBase<DerivedB>& q_nom_input, const int num_constraints,\n    RigidBodyConstraint** const constraint_array,\n    const IKoptions& ikoptions, MatrixBase<DerivedC>* q_sol,\n    MatrixBase<DerivedD>* qdot_sol, MatrixBase<DerivedE>* qddot_sol, int* INFO,\n    std::vector<std::string>* infeasible_constraint) {\n  throw std::runtime_error(\"SNOPT solver not available.\");\n}\n\ntemplate void inverseKinSnoptBackend(\n    RigidBodyTree* model, const int mode, const int nT,\n    const double* t, const MatrixBase<Map<MatrixXd>>& q_seed,\n    const MatrixBase<Map<MatrixXd>>& q_nom, const int num_constraints,\n    RigidBodyConstraint** const constraint_array,\n    const IKoptions& ikoptions, MatrixBase<Map<MatrixXd>>* q_sol,\n    MatrixBase<Map<MatrixXd>>* qdot_sol, MatrixBase<Map<MatrixXd>>* qddot_sol,\n    int* INFO, std::vector<std::string>* infeasible_constraint);\ntemplate void inverseKinSnoptBackend(\n    RigidBodyTree* model, const int mode, const int nT,\n    const double* t, const MatrixBase<MatrixXd>& q_seed,\n    const MatrixBase<MatrixXd>& q_nom, const int num_constraints,\n    RigidBodyConstraint** const constraint_array,\n    const IKoptions& ikoptions, MatrixBase<MatrixXd>* q_sol,\n    MatrixBase<MatrixXd>* qdot_sol, MatrixBase<MatrixXd>* qddot_sol,\n    int* INFO, std::vector<std::string>* infeasible_constraint);\ntemplate void inverseKinSnoptBackend(\n    RigidBodyTree* model, const int mode, const int nT,\n    const double* t, const MatrixBase<Map<MatrixXd>>& q_seed,\n    const MatrixBase<Map<MatrixXd>>& q_nom, const int num_constraints,\n    RigidBodyConstraint** const constraint_array,\n    const IKoptions& ikoptions, MatrixBase<Map<MatrixXd>>* q_sol,\n    MatrixBase<MatrixXd>* qdot_sol, MatrixBase<MatrixXd>* qddot_sol,\n    int* INFO, std::vector<std::string>* infeasible_constraint);\ntemplate void inverseKinSnoptBackend(\n    RigidBodyTree* model, const int mode, const int nT,\n    const double* t, const MatrixBase<Map<VectorXd>>& q_seed,\n    const MatrixBase<Map<VectorXd>>& q_nom, const int num_constraints,\n    RigidBodyConstraint** const constraint_array,\n    const IKoptions& ikoptions, MatrixBase<Map<VectorXd>>* q_sol,\n    MatrixBase<Map<VectorXd>>* qdot_sol, MatrixBase<Map<VectorXd>>* qddot_sol,\n    int* INFO, std::vector<std::string>* infeasible_constraint);\ntemplate void inverseKinSnoptBackend(\n    RigidBodyTree* model, const int mode, const int nT,\n    const double* t, const MatrixBase<VectorXd>& q_seed,\n    const MatrixBase<VectorXd>& q_nom, const int num_constraints,\n    RigidBodyConstraint** const constraint_array,\n    const IKoptions& ikoptions, MatrixBase<VectorXd>* q_sol,\n    MatrixBase<VectorXd>* qdot_sol, MatrixBase<VectorXd>* qddot_sol,\n    int* INFO, std::vector<std::string>* infeasible_constraint);\ntemplate void inverseKinSnoptBackend(\n    RigidBodyTree* model, const int mode, const int nT,\n    const double* t, const MatrixBase<Map<VectorXd>>& q_seed,\n    const MatrixBase<Map<VectorXd>>& q_nom, const int num_constraints,\n    RigidBodyConstraint** const constraint_array,\n    const IKoptions& ikoptions, MatrixBase<Map<VectorXd>>* q_sol,\n    MatrixBase<VectorXd>* qdot_sol, MatrixBase<VectorXd>* qddot_sol,\n    int* INFO, std::vector<std::string>* infeasible_constraint);\n\n}\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Displays the list of services in a profile\n#include <StdAfx.h>\n#include <UI\/Dialogs\/ContentsTable\/MsgServiceTableDlg.h>\n#include <UI\/Controls\/ContentsTableListCtrl.h>\n#include <MAPI\/Cache\/MapiObjects.h>\n#include <MAPI\/ColumnTags.h>\n#include <UI\/Dialogs\/MFCUtilityFunctions.h>\n#include <UI\/Dialogs\/ContentsTable\/ProviderTableDlg.h>\n#include <MAPI\/MAPIProfileFunctions.h>\n#include <UI\/Dialogs\/Editors\/Editor.h>\n#include <UI\/Controls\/SortList\/ContentsData.h>\n#include <MAPI\/MAPIFunctions.h>\n\nnamespace dialog\n{\n\tstatic std::wstring CLASS = L\"CMsgServiceTableDlg\";\n\n\tCMsgServiceTableDlg::CMsgServiceTableDlg(\n\t\t_In_ ui::CParentWnd* pParentWnd,\n\t\t_In_ cache::CMapiObjects* lpMapiObjects,\n\t\t_In_ const std::string& szProfileName\n\t) :\n\t\tCContentsTableDlg(\n\t\t\tpParentWnd,\n\t\t\tlpMapiObjects,\n\t\t\tIDS_SERVICES,\n\t\t\tmfcmapiDO_NOT_CALL_CREATE_DIALOG,\n\t\t\tnullptr,\n\t\t\tLPSPropTagArray(&columns::sptSERVICECols),\n\t\t\tcolumns::SERVICEColumns,\n\t\t\tIDR_MENU_MSGSERVICE_POPUP,\n\t\t\tMENU_CONTEXT_PROFILE_SERVICES)\n\t{\n\t\tTRACE_CONSTRUCTOR(CLASS);\n\n\t\tm_lpServiceAdmin = nullptr;\n\n\t\tCContentsTableDlg::CreateDialogAndMenu(IDR_MENU_MSGSERVICE);\n\n\t\tm_szProfileName = szProfileName;\n\t\tCMsgServiceTableDlg::OnRefreshView();\n\t}\n\n\tCMsgServiceTableDlg::~CMsgServiceTableDlg()\n\t{\n\t\tTRACE_DESTRUCTOR(CLASS);\n\t\t\/\/ little hack to keep our releases in the right order - crash in o2k3 otherwise\n\t\tif (m_lpContentsTable) m_lpContentsTable->Release();\n\t\tm_lpContentsTable = nullptr;\n\t\tif (m_lpServiceAdmin) m_lpServiceAdmin->Release();\n\t}\n\n\tBEGIN_MESSAGE_MAP(CMsgServiceTableDlg, CContentsTableDlg)\n\t\tON_COMMAND(ID_CONFIGUREMSGSERVICE, OnConfigureMsgService)\n\t\tON_COMMAND(ID_DELETESELECTEDITEM, OnDeleteSelectedItem)\n\t\tON_COMMAND(ID_OPENPROFILESECTION, OnOpenProfileSection)\n\tEND_MESSAGE_MAP()\n\n\tvoid CMsgServiceTableDlg::OnInitMenu(_In_ CMenu* pMenu)\n\t{\n\t\tif (pMenu)\n\t\t{\n\t\t\tif (m_lpContentsTableListCtrl)\n\t\t\t{\n\t\t\t\tconst int iNumSel = m_lpContentsTableListCtrl->GetSelectedCount();\n\t\t\t\tpMenu->EnableMenuItem(ID_DELETESELECTEDITEM, DIMMSOK(iNumSel));\n\t\t\t\tpMenu->EnableMenuItem(ID_CONFIGUREMSGSERVICE, DIMMSOK(iNumSel));\n\t\t\t}\n\t\t}\n\n\t\tCContentsTableDlg::OnInitMenu(pMenu);\n\t}\n\n\t\/\/ Clear the current list and get a new one with whatever code we've got in LoadMAPIPropList\n\tvoid CMsgServiceTableDlg::OnRefreshView()\n\t{\n\t\toutput::DebugPrintEx(DBGGeneric, CLASS, L\"OnRefreshView\", L\"\\n\");\n\n\t\tauto hRes = S_OK;\n\n\t\t\/\/ Make sure we've got something to work with\n\t\tif (m_szProfileName.empty() || !m_lpContentsTableListCtrl || !m_lpMapiObjects) return;\n\n\t\t\/\/ cancel any loading which may be occuring\n\t\tif (m_lpContentsTableListCtrl->IsLoading()) m_lpContentsTableListCtrl->OnCancelTableLoad();\n\n\t\t\/\/ Clean up our table and admin in reverse order from which we obtained them\n\t\t\/\/ Failure to do this leads to crashes in Outlook's profile code\n\t\tEC_H(m_lpContentsTableListCtrl->SetContentsTable(\n\t\t\tnullptr,\n\t\t\tdfNormal,\n\t\t\tNULL));\n\n\t\tif (m_lpServiceAdmin) m_lpServiceAdmin->Release();\n\t\tm_lpServiceAdmin = nullptr;\n\n\t\tLPPROFADMIN lpProfAdmin = nullptr;\n\t\tEC_MAPI(MAPIAdminProfiles(0, &lpProfAdmin));\n\n\t\tif (lpProfAdmin)\n\t\t{\n\t\t\tEC_MAPI(lpProfAdmin->AdminServices(\n\t\t\t\treinterpret_cast<LPTSTR>(const_cast<LPSTR>(m_szProfileName.c_str())),\n\t\t\t\treinterpret_cast<LPTSTR>(\"\"),\n\t\t\t\tNULL,\n\t\t\t\tMAPI_DIALOG,\n\t\t\t\t&m_lpServiceAdmin));\n\t\t\tif (m_lpServiceAdmin)\n\t\t\t{\n\t\t\t\tLPMAPITABLE lpServiceTable = nullptr;\n\n\t\t\t\tEC_MAPI(m_lpServiceAdmin->GetMsgServiceTable(\n\t\t\t\t\t0, \/\/ fMapiUnicode is not supported\n\t\t\t\t\t&lpServiceTable));\n\n\t\t\t\tif (lpServiceTable)\n\t\t\t\t{\n\t\t\t\t\tEC_H(m_lpContentsTableListCtrl->SetContentsTable(\n\t\t\t\t\t\tlpServiceTable,\n\t\t\t\t\t\tdfNormal,\n\t\t\t\t\t\tNULL));\n\n\t\t\t\t\tlpServiceTable->Release();\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tlpProfAdmin->Release();\n\t\t}\n\t}\n\n\tvoid CMsgServiceTableDlg::OnDisplayItem()\n\t{\n\t\tauto hRes = S_OK;\n\t\tLPPROVIDERADMIN lpProviderAdmin = nullptr;\n\t\tLPMAPITABLE lpProviderTable = nullptr;\n\t\tCWaitCursor Wait; \/\/ Change the mouse to an hourglass while we work.\n\n\t\tif (!m_lpContentsTableListCtrl || !m_lpServiceAdmin) return;\n\n\t\tauto items = m_lpContentsTableListCtrl->GetSelectedItemData();\n\t\tfor (const auto& lpListData : items)\n\t\t{\n\t\t\tif (lpListData && lpListData->Contents())\n\t\t\t{\n\t\t\t\tconst auto lpServiceUID = lpListData->Contents()->m_lpServiceUID;\n\t\t\t\tif (lpServiceUID)\n\t\t\t\t{\n\t\t\t\t\tEC_MAPI(m_lpServiceAdmin->AdminProviders(\n\t\t\t\t\t\treinterpret_cast<LPMAPIUID>(lpServiceUID->lpb),\n\t\t\t\t\t\t0, \/\/ fMapiUnicode is not supported\n\t\t\t\t\t\t&lpProviderAdmin));\n\n\t\t\t\t\tif (lpProviderAdmin)\n\t\t\t\t\t{\n\t\t\t\t\t\tEC_MAPI(lpProviderAdmin->GetProviderTable(\n\t\t\t\t\t\t\t0, \/\/ fMapiUnicode is not supported\n\t\t\t\t\t\t\t&lpProviderTable));\n\n\t\t\t\t\t\tif (lpProviderTable)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tnew CProviderTableDlg(\n\t\t\t\t\t\t\t\tm_lpParent,\n\t\t\t\t\t\t\t\tm_lpMapiObjects,\n\t\t\t\t\t\t\t\tlpProviderTable,\n\t\t\t\t\t\t\t\tlpProviderAdmin);\n\t\t\t\t\t\t\tlpProviderTable->Release();\n\t\t\t\t\t\t\tlpProviderTable = nullptr;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tlpProviderAdmin->Release();\n\t\t\t\t\t\tlpProviderAdmin = nullptr;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid CMsgServiceTableDlg::OnConfigureMsgService()\n\t{\n\t\tauto hRes = S_OK;\n\t\tCWaitCursor Wait; \/\/ Change the mouse to an hourglass while we work.\n\n\t\tif (!m_lpContentsTableListCtrl || !m_lpServiceAdmin) return;\n\n\t\tauto items = m_lpContentsTableListCtrl->GetSelectedItemData();\n\t\tfor (const auto& lpListData : items)\n\t\t{\n\t\t\tif (lpListData && lpListData->Contents())\n\t\t\t{\n\t\t\t\tconst auto lpServiceUID = lpListData->Contents()->m_lpServiceUID;\n\t\t\t\tif (lpServiceUID)\n\t\t\t\t{\n\t\t\t\t\tEC_H_CANCEL(m_lpServiceAdmin->ConfigureMsgService(\n\t\t\t\t\t\treinterpret_cast<LPMAPIUID>(lpServiceUID->lpb),\n\t\t\t\t\t\treinterpret_cast<ULONG_PTR>(m_hWnd),\n\t\t\t\t\t\tSERVICE_UI_ALWAYS,\n\t\t\t\t\t\t0,\n\t\t\t\t\t\tnullptr));\n\t\t\t\t}\n\t\t\t}\n\n\t\t\thRes = S_OK;\n\t\t}\n\t}\n\n\t_Check_return_ HRESULT CMsgServiceTableDlg::OpenItemProp(int iSelectedItem, __mfcmapiModifyEnum \/*bModify*\/, _Deref_out_opt_ LPMAPIPROP* lppMAPIProp)\n\t{\n\t\tauto hRes = S_OK;\n\n\t\toutput::DebugPrintEx(DBGOpenItemProp, CLASS, L\"OpenItemProp\", L\"iSelectedItem = 0x%X\\n\", iSelectedItem);\n\n\t\t*lppMAPIProp = nullptr;\n\n\t\tif (!m_lpServiceAdmin || !m_lpContentsTableListCtrl || !lppMAPIProp) return MAPI_E_INVALID_PARAMETER;\n\n\t\tconst auto lpListData = m_lpContentsTableListCtrl->GetSortListData(iSelectedItem);\n\t\tif (lpListData && lpListData->Contents())\n\t\t{\n\t\t\tconst auto lpServiceUID = lpListData->Contents()->m_lpServiceUID;\n\t\t\tif (lpServiceUID)\n\t\t\t{\n\t\t\t\tEC_H(mapi::profile::OpenProfileSection(\n\t\t\t\t\tm_lpServiceAdmin,\n\t\t\t\t\tlpServiceUID,\n\t\t\t\t\treinterpret_cast<LPPROFSECT*>(lppMAPIProp)));\n\t\t\t}\n\t\t}\n\n\t\treturn hRes;\n\t}\n\n\tvoid CMsgServiceTableDlg::OnOpenProfileSection()\n\t{\n\t\tauto hRes = S_OK;\n\n\t\tif (!m_lpServiceAdmin) return;\n\n\t\teditor::CEditor MyUID(\n\t\t\tthis,\n\t\t\tIDS_OPENPROFSECT,\n\t\t\tIDS_OPENPROFSECTPROMPT,\n\t\t\tCEDITOR_BUTTON_OK | CEDITOR_BUTTON_CANCEL);\n\n\t\tMyUID.InitPane(0, viewpane::DropDownPane::CreateGuid(IDS_MAPIUID, false));\n\t\tMyUID.InitPane(1, viewpane::CheckPane::Create(IDS_MAPIUIDBYTESWAPPED, false, false));\n\n\t\tWC_H(MyUID.DisplayDialog());\n\t\tif (S_OK != hRes) return;\n\n\t\tauto guid = MyUID.GetSelectedGUID(0, MyUID.GetCheck(1));\n\t\tSBinary MapiUID = { sizeof(GUID), reinterpret_cast<LPBYTE>(&guid) };\n\n\t\tLPPROFSECT lpProfSect = nullptr;\n\t\tEC_H(mapi::profile::OpenProfileSection(\n\t\t\tm_lpServiceAdmin,\n\t\t\t&MapiUID,\n\t\t\t&lpProfSect));\n\t\tif (lpProfSect)\n\t\t{\n\t\t\tLPMAPIPROP lpTemp = nullptr;\n\t\t\tEC_MAPI(lpProfSect->QueryInterface(IID_IMAPIProp, reinterpret_cast<LPVOID*>(&lpTemp)));\n\t\t\tif (lpTemp)\n\t\t\t{\n\t\t\t\tEC_H(DisplayObject(\n\t\t\t\t\tlpTemp,\n\t\t\t\t\tMAPI_PROFSECT,\n\t\t\t\t\totContents,\n\t\t\t\t\tthis));\n\t\t\t\tlpTemp->Release();\n\t\t\t}\n\n\t\t\tlpProfSect->Release();\n\t\t}\n\n\t\tMAPIFreeBuffer(MapiUID.lpb);\n\t}\n\n\tvoid CMsgServiceTableDlg::OnDeleteSelectedItem()\n\t{\n\t\tauto hRes = S_OK;\n\t\tif (!m_lpServiceAdmin || !m_lpContentsTableListCtrl) return;\n\n\t\tauto items = m_lpContentsTableListCtrl->GetSelectedItemData();\n\t\tfor (const auto& lpListData : items)\n\t\t{\n\t\t\t\/\/ Find the highlighted item AttachNum\n\t\t\tif (!lpListData || !lpListData->Contents()) break;\n\n\t\t\toutput::DebugPrintEx(DBGDeleteSelectedItem, CLASS, L\"OnDeleteSelectedItem\", L\"Deleting service from \\\"%hs\\\"\\n\", lpListData->Contents()->m_szProfileDisplayName.c_str());\n\n\t\t\tconst auto lpServiceUID = lpListData->Contents()->m_lpServiceUID;\n\t\t\tif (lpServiceUID)\n\t\t\t{\n\t\t\t\tWC_MAPI(m_lpServiceAdmin->DeleteMsgService(\n\t\t\t\t\treinterpret_cast<LPMAPIUID>(lpServiceUID->lpb)));\n\t\t\t}\n\n\t\t}\n\n\t\tOnRefreshView(); \/\/ Update the view since we don't have notifications here.\n\t}\n\n\tvoid CMsgServiceTableDlg::HandleAddInMenuSingle(\n\t\t_In_ LPADDINMENUPARAMS lpParams,\n\t\t_In_ LPMAPIPROP lpMAPIProp,\n\t\t_In_ LPMAPICONTAINER \/*lpContainer*\/)\n\t{\n\t\tif (lpParams)\n\t\t{\n\t\t\tlpParams->lpProfSect = mapi::safe_cast<LPPROFSECT>(lpMAPIProp);\n\t\t}\n\n\t\taddin::InvokeAddInMenu(lpParams);\n\n\t\tif (lpParams && lpParams->lpProfSect)\n\t\t{\n\t\t\tlpParams->lpProfSect->Release();\n\t\t\tlpParams->lpProfSect = nullptr;\n\t\t}\n\t}\n}\n<commit_msg>revert whitespace<commit_after>\/\/ Displays the list of services in a profile\n#include <StdAfx.h>\n#include <UI\/Dialogs\/ContentsTable\/MsgServiceTableDlg.h>\n#include <UI\/Controls\/ContentsTableListCtrl.h>\n#include <MAPI\/Cache\/MapiObjects.h>\n#include <MAPI\/ColumnTags.h>\n#include <UI\/Dialogs\/MFCUtilityFunctions.h>\n#include <UI\/Dialogs\/ContentsTable\/ProviderTableDlg.h>\n#include <MAPI\/MAPIProfileFunctions.h>\n#include <UI\/Dialogs\/Editors\/Editor.h>\n#include <UI\/Controls\/SortList\/ContentsData.h>\n#include <MAPI\/MAPIFunctions.h>\n\nnamespace dialog\n{\n\tstatic std::wstring CLASS = L\"CMsgServiceTableDlg\";\n\n\tCMsgServiceTableDlg::CMsgServiceTableDlg(\n\t\t_In_ ui::CParentWnd* pParentWnd,\n\t\t_In_ cache::CMapiObjects* lpMapiObjects,\n\t\t_In_ const std::string& szProfileName\n\t) :\n\t\tCContentsTableDlg(\n\t\t\tpParentWnd,\n\t\t\tlpMapiObjects,\n\t\t\tIDS_SERVICES,\n\t\t\tmfcmapiDO_NOT_CALL_CREATE_DIALOG,\n\t\t\tnullptr,\n\t\t\tLPSPropTagArray(&columns::sptSERVICECols),\n\t\t\tcolumns::SERVICEColumns,\n\t\t\tIDR_MENU_MSGSERVICE_POPUP,\n\t\t\tMENU_CONTEXT_PROFILE_SERVICES)\n\t{\n\t\tTRACE_CONSTRUCTOR(CLASS);\n\n\t\tm_lpServiceAdmin = nullptr;\n\n\t\tCContentsTableDlg::CreateDialogAndMenu(IDR_MENU_MSGSERVICE);\n\n\t\tm_szProfileName = szProfileName;\n\t\tCMsgServiceTableDlg::OnRefreshView();\n\t}\n\n\tCMsgServiceTableDlg::~CMsgServiceTableDlg()\n\t{\n\t\tTRACE_DESTRUCTOR(CLASS);\n\t\t\/\/ little hack to keep our releases in the right order - crash in o2k3 otherwise\n\t\tif (m_lpContentsTable) m_lpContentsTable->Release();\n\t\tm_lpContentsTable = nullptr;\n\t\tif (m_lpServiceAdmin) m_lpServiceAdmin->Release();\n\t}\n\n\tBEGIN_MESSAGE_MAP(CMsgServiceTableDlg, CContentsTableDlg)\n\t\tON_COMMAND(ID_CONFIGUREMSGSERVICE, OnConfigureMsgService)\n\t\tON_COMMAND(ID_DELETESELECTEDITEM, OnDeleteSelectedItem)\n\t\tON_COMMAND(ID_OPENPROFILESECTION, OnOpenProfileSection)\n\tEND_MESSAGE_MAP()\n\n\tvoid CMsgServiceTableDlg::OnInitMenu(_In_ CMenu* pMenu)\n\t{\n\t\tif (pMenu)\n\t\t{\n\t\t\tif (m_lpContentsTableListCtrl)\n\t\t\t{\n\t\t\t\tconst int iNumSel = m_lpContentsTableListCtrl->GetSelectedCount();\n\t\t\t\tpMenu->EnableMenuItem(ID_DELETESELECTEDITEM, DIMMSOK(iNumSel));\n\t\t\t\tpMenu->EnableMenuItem(ID_CONFIGUREMSGSERVICE, DIMMSOK(iNumSel));\n\t\t\t}\n\t\t}\n\n\t\tCContentsTableDlg::OnInitMenu(pMenu);\n\t}\n\n\t\/\/ Clear the current list and get a new one with whatever code we've got in LoadMAPIPropList\n\tvoid CMsgServiceTableDlg::OnRefreshView()\n\t{\n\t\toutput::DebugPrintEx(DBGGeneric, CLASS, L\"OnRefreshView\", L\"\\n\");\n\n\t\tauto hRes = S_OK;\n\n\t\t\/\/ Make sure we've got something to work with\n\t\tif (m_szProfileName.empty() || !m_lpContentsTableListCtrl || !m_lpMapiObjects) return;\n\n\t\t\/\/ cancel any loading which may be occuring\n\t\tif (m_lpContentsTableListCtrl->IsLoading()) m_lpContentsTableListCtrl->OnCancelTableLoad();\n\n\t\t\/\/ Clean up our table and admin in reverse order from which we obtained them\n\t\t\/\/ Failure to do this leads to crashes in Outlook's profile code\n\t\tEC_H(m_lpContentsTableListCtrl->SetContentsTable(\n\t\t\tnullptr,\n\t\t\tdfNormal,\n\t\t\tNULL));\n\n\t\tif (m_lpServiceAdmin) m_lpServiceAdmin->Release();\n\t\tm_lpServiceAdmin = nullptr;\n\n\t\tLPPROFADMIN lpProfAdmin = nullptr;\n\t\tEC_MAPI(MAPIAdminProfiles(0, &lpProfAdmin));\n\n\t\tif (lpProfAdmin)\n\t\t{\n\t\t\tEC_MAPI(lpProfAdmin->AdminServices(\n\t\t\t\treinterpret_cast<LPTSTR>(const_cast<LPSTR>(m_szProfileName.c_str())),\n\t\t\t\treinterpret_cast<LPTSTR>(\"\"),\n\t\t\t\tNULL,\n\t\t\t\tMAPI_DIALOG,\n\t\t\t\t&m_lpServiceAdmin));\n\t\t\tif (m_lpServiceAdmin)\n\t\t\t{\n\t\t\t\tLPMAPITABLE lpServiceTable = nullptr;\n\n\t\t\t\tEC_MAPI(m_lpServiceAdmin->GetMsgServiceTable(\n\t\t\t\t\t0, \/\/ fMapiUnicode is not supported\n\t\t\t\t\t&lpServiceTable));\n\n\t\t\t\tif (lpServiceTable)\n\t\t\t\t{\n\t\t\t\t\tEC_H(m_lpContentsTableListCtrl->SetContentsTable(\n\t\t\t\t\t\tlpServiceTable,\n\t\t\t\t\t\tdfNormal,\n\t\t\t\t\t\tNULL));\n\n\t\t\t\t\tlpServiceTable->Release();\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tlpProfAdmin->Release();\n\t\t}\n\t}\n\n\tvoid CMsgServiceTableDlg::OnDisplayItem()\n\t{\n\t\tauto hRes = S_OK;\n\t\tLPPROVIDERADMIN lpProviderAdmin = nullptr;\n\t\tLPMAPITABLE lpProviderTable = nullptr;\n\t\tCWaitCursor Wait; \/\/ Change the mouse to an hourglass while we work.\n\n\t\tif (!m_lpContentsTableListCtrl || !m_lpServiceAdmin) return;\n\n\t\tauto items = m_lpContentsTableListCtrl->GetSelectedItemData();\n\t\tfor (const auto& lpListData : items)\n\t\t{\n\t\t\tif (lpListData && lpListData->Contents())\n\t\t\t{\n\t\t\t\tconst auto lpServiceUID = lpListData->Contents()->m_lpServiceUID;\n\t\t\t\tif (lpServiceUID)\n\t\t\t\t{\n\t\t\t\t\tEC_MAPI(m_lpServiceAdmin->AdminProviders(\n\t\t\t\t\t\treinterpret_cast<LPMAPIUID>(lpServiceUID->lpb),\n\t\t\t\t\t\t0, \/\/ fMapiUnicode is not supported\n\t\t\t\t\t\t&lpProviderAdmin));\n\n\t\t\t\t\tif (lpProviderAdmin)\n\t\t\t\t\t{\n\t\t\t\t\t\tEC_MAPI(lpProviderAdmin->GetProviderTable(\n\t\t\t\t\t\t\t0, \/\/ fMapiUnicode is not supported\n\t\t\t\t\t\t\t&lpProviderTable));\n\n\t\t\t\t\t\tif (lpProviderTable)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tnew CProviderTableDlg(\n\t\t\t\t\t\t\t\tm_lpParent,\n\t\t\t\t\t\t\t\tm_lpMapiObjects,\n\t\t\t\t\t\t\t\tlpProviderTable,\n\t\t\t\t\t\t\t\tlpProviderAdmin);\n\t\t\t\t\t\t\tlpProviderTable->Release();\n\t\t\t\t\t\t\tlpProviderTable = nullptr;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tlpProviderAdmin->Release();\n\t\t\t\t\t\tlpProviderAdmin = nullptr;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid CMsgServiceTableDlg::OnConfigureMsgService()\n\t{\n\t\tauto hRes = S_OK;\n\t\tCWaitCursor Wait; \/\/ Change the mouse to an hourglass while we work.\n\n\t\tif (!m_lpContentsTableListCtrl || !m_lpServiceAdmin) return;\n\n\t\tauto items = m_lpContentsTableListCtrl->GetSelectedItemData();\n\t\tfor (const auto& lpListData : items)\n\t\t{\n\t\t\tif (lpListData && lpListData->Contents())\n\t\t\t{\n\t\t\t\tconst auto lpServiceUID = lpListData->Contents()->m_lpServiceUID;\n\t\t\t\tif (lpServiceUID)\n\t\t\t\t{\n\t\t\t\t\tEC_H_CANCEL(m_lpServiceAdmin->ConfigureMsgService(\n\t\t\t\t\t\treinterpret_cast<LPMAPIUID>(lpServiceUID->lpb),\n\t\t\t\t\t\treinterpret_cast<ULONG_PTR>(m_hWnd),\n\t\t\t\t\t\tSERVICE_UI_ALWAYS,\n\t\t\t\t\t\t0,\n\t\t\t\t\t\tnullptr));\n\t\t\t\t}\n\t\t\t}\n\n\t\t\thRes = S_OK;\n\t\t}\n\t}\n\n\t_Check_return_ HRESULT CMsgServiceTableDlg::OpenItemProp(int iSelectedItem, __mfcmapiModifyEnum \/*bModify*\/, _Deref_out_opt_ LPMAPIPROP* lppMAPIProp)\n\t{\n\t\tauto hRes = S_OK;\n\n\t\toutput::DebugPrintEx(DBGOpenItemProp, CLASS, L\"OpenItemProp\", L\"iSelectedItem = 0x%X\\n\", iSelectedItem);\n\n\t\t*lppMAPIProp = nullptr;\n\n\t\tif (!m_lpServiceAdmin || !m_lpContentsTableListCtrl || !lppMAPIProp) return MAPI_E_INVALID_PARAMETER;\n\n\t\tconst auto lpListData = m_lpContentsTableListCtrl->GetSortListData(iSelectedItem);\n\t\tif (lpListData && lpListData->Contents())\n\t\t{\n\t\t\tconst auto lpServiceUID = lpListData->Contents()->m_lpServiceUID;\n\t\t\tif (lpServiceUID)\n\t\t\t{\n\t\t\t\tEC_H(mapi::profile::OpenProfileSection(\n\t\t\t\t\tm_lpServiceAdmin,\n\t\t\t\t\tlpServiceUID,\n\t\t\t\t\treinterpret_cast<LPPROFSECT*>(lppMAPIProp)));\n\t\t\t}\n\t\t}\n\n\t\treturn hRes;\n\t}\n\n\tvoid CMsgServiceTableDlg::OnOpenProfileSection()\n\t{\n\t\tauto hRes = S_OK;\n\n\t\tif (!m_lpServiceAdmin) return;\n\n\t\teditor::CEditor MyUID(\n\t\t\tthis,\n\t\t\tIDS_OPENPROFSECT,\n\t\t\tIDS_OPENPROFSECTPROMPT,\n\t\t\tCEDITOR_BUTTON_OK | CEDITOR_BUTTON_CANCEL);\n\n\t\tMyUID.InitPane(0, viewpane::DropDownPane::CreateGuid(IDS_MAPIUID, false));\n\t\tMyUID.InitPane(1, viewpane::CheckPane::Create(IDS_MAPIUIDBYTESWAPPED, false, false));\n\n\t\tWC_H(MyUID.DisplayDialog());\n\t\tif (S_OK != hRes) return;\n\n\t\tauto guid = MyUID.GetSelectedGUID(0, MyUID.GetCheck(1));\n\t\tSBinary MapiUID = { sizeof(GUID), reinterpret_cast<LPBYTE>(&guid) };\n\n\t\tLPPROFSECT lpProfSect = nullptr;\n\t\tEC_H(mapi::profile::OpenProfileSection(\n\t\t\tm_lpServiceAdmin,\n\t\t\t&MapiUID,\n\t\t\t&lpProfSect));\n\t\tif (lpProfSect)\n\t\t{\n\t\t\tLPMAPIPROP lpTemp = nullptr;\n\t\t\tEC_MAPI(lpProfSect->QueryInterface(IID_IMAPIProp, reinterpret_cast<LPVOID*>(&lpTemp)));\n\t\t\tif (lpTemp)\n\t\t\t{\n\t\t\t\tEC_H(DisplayObject(\n\t\t\t\t\tlpTemp,\n\t\t\t\t\tMAPI_PROFSECT,\n\t\t\t\t\totContents,\n\t\t\t\t\tthis));\n\t\t\t\tlpTemp->Release();\n\t\t\t}\n\n\t\t\tlpProfSect->Release();\n\t\t}\n\n\t\tMAPIFreeBuffer(MapiUID.lpb);\n\t}\n\n\tvoid CMsgServiceTableDlg::OnDeleteSelectedItem()\n\t{\n\t\tauto hRes = S_OK;\n\t\tif (!m_lpServiceAdmin || !m_lpContentsTableListCtrl) return;\n\n\t\tauto items = m_lpContentsTableListCtrl->GetSelectedItemData();\n\t\tfor (const auto& lpListData : items)\n\t\t{\n\t\t\t\/\/ Find the highlighted item AttachNum\n\t\t\tif (!lpListData || !lpListData->Contents()) break;\n\n\t\t\toutput::DebugPrintEx(DBGDeleteSelectedItem, CLASS, L\"OnDeleteSelectedItem\", L\"Deleting service from \\\"%hs\\\"\\n\", lpListData->Contents()->m_szProfileDisplayName.c_str());\n\n\t\t\tconst auto lpServiceUID = lpListData->Contents()->m_lpServiceUID;\n\t\t\tif (lpServiceUID)\n\t\t\t{\n\t\t\t\tWC_MAPI(m_lpServiceAdmin->DeleteMsgService(\n\t\t\t\t\treinterpret_cast<LPMAPIUID>(lpServiceUID->lpb)));\n\t\t\t}\n\n\t\t}\n\n\t\tOnRefreshView(); \/\/ Update the view since we don't have notifications here.\n\t}\n\n\tvoid CMsgServiceTableDlg::HandleAddInMenuSingle(\n\t\t_In_ LPADDINMENUPARAMS lpParams,\n\t\t_In_ LPMAPIPROP lpMAPIProp,\n\t\t_In_ LPMAPICONTAINER \/*lpContainer*\/)\n\t{\n\t\tif (lpParams)\n\t\t{\n\t\t\tlpParams->lpProfSect = mapi::safe_cast<LPPROFSECT>(lpMAPIProp);\n\t\t}\n\n\t\taddin::InvokeAddInMenu(lpParams);\n\n\t\tif (lpParams && lpParams->lpProfSect)\n\t\t{\n\t\t\tlpParams->lpProfSect->Release();\n\t\t\tlpParams->lpProfSect = nullptr;\n\t\t}\n\t}\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2008-2010 QXmpp Developers\n *\n * Authors:\n *\tIan Reinhart Geiser\n *  Jeremy Lainé\n *\n * Source:\n *\thttp:\/\/code.google.com\/p\/qxmpp\n *\n * This file is a part of QXmpp 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 <QBuffer>\n#include <QDebug>\n\n#include \"QXmppMessage.h\"\n#include \"QXmppUtils.h\"\n\n#include \"xmppClient.h\"\n\nxmppClient::xmppClient(QObject *parent)\n    : QXmppClient(parent)\n{\n    bool check = connect(this, SIGNAL(connected()),\n                         this, SLOT(slotConnected()) );\n    Q_ASSERT(check);\n\n    check = connect(&transferManager(), SIGNAL(fileReceived(QXmppTransferJob*)),\n                    this, SLOT(slotFileReceived(QXmppTransferJob*)));\n    Q_ASSERT(check);\n}\n\n\/\/\/ Request that the given file be sent to the recipient once he\/she is online.\n\/\/\/\n\/\/\/ \\param recipient\n\/\/\/ \\param file\n\nvoid xmppClient::sendOnceAvailable(const QString &recipient, const QString &file)\n{\n    m_sendRecipient = recipient;\n    m_sendFile = file;\n}\n\nvoid xmppClient::slotConnected()\n{\n    const QLatin1String recipient(\"client@geiseri.com\/QXmpp\");\n\n    \/\/ if we are the recipient, do nothing\n    if (getConfiguration().jid() == recipient)\n        return;\n\n    transferManager().setSupportedMethods(QXmppTransferJob::InBandMethod);\n    QXmppTransferJob *job = transferManager().sendFile(recipient, \"xmppClient.cpp\");\n\n    bool check = connect( job, SIGNAL(error(QXmppTransferJob::Error)),\n             this, SLOT(slotError(QXmppTransferJob::Error)) );\n    Q_ASSERT(check);\n\n    check = connect( job, SIGNAL(finished()),\n             this, SLOT(slotFinished()) );\n    Q_ASSERT(check);\n\n    check = connect( job, SIGNAL(progress(qint64,qint64)),\n             this, SLOT(slotProgress(qint64,qint64)) );\n    Q_ASSERT(check);\n}\n\n\/\/\/ A file transfer failed.\n\nvoid xmppClient::slotError(QXmppTransferJob::Error error)\n{\n    qDebug() << \"Transmission failed:\" << error;\n}\n\n\/\/\/ A file transfer request was received.\n\nvoid xmppClient::slotFileReceived(QXmppTransferJob *job)\n{\n    qDebug() << \"Got transfer request from:\" << job->jid();\n\n    bool check = connect(job, SIGNAL(error(QXmppTransferJob::Error)), this, SLOT(slotError(QXmppTransferJob::Error)));\n    Q_ASSERT(check);\n\n    check = connect(job, SIGNAL(finished()), this, SLOT(slotFinished()));\n    Q_ASSERT(check);\n\n    check = connect(job, SIGNAL(progress(qint64,qint64)), this, SLOT(slotProgress(qint64,qint64)));\n    Q_ASSERT(check);\n\n    \/\/ allocate a buffer to receive the file\n    QBuffer *buffer = new QBuffer(this);\n    buffer->open(QIODevice::WriteOnly);\n    job->accept(buffer);\n}\n\n\/\/\/ A file transfer finished.\n\nvoid xmppClient::slotFinished()\n{\n    qDebug() << \"Transmission finished\";\n}\n\n\/\/\/ A file transfer has made progress.\n\nvoid xmppClient::slotProgress(qint64 done, qint64 total)\n{\n    qDebug() << \"Transmission progress:\" << done << \"\/\" << total;\n}\n<commit_msg>document the fact you don't NEED to use IBB<commit_after>\/*\n * Copyright (C) 2008-2010 QXmpp Developers\n *\n * Authors:\n *\tIan Reinhart Geiser\n *  Jeremy Lainé\n *\n * Source:\n *\thttp:\/\/code.google.com\/p\/qxmpp\n *\n * This file is a part of QXmpp 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 <QBuffer>\n#include <QDebug>\n\n#include \"QXmppMessage.h\"\n#include \"QXmppUtils.h\"\n\n#include \"xmppClient.h\"\n\nxmppClient::xmppClient(QObject *parent)\n    : QXmppClient(parent)\n{\n    \/\/ comment the following to use all available methods (highly recommended)\n    transferManager().setSupportedMethods(QXmppTransferJob::InBandMethod);\n\n    bool check = connect(this, SIGNAL(connected()),\n                         this, SLOT(slotConnected()) );\n    Q_ASSERT(check);\n\n    check = connect(&transferManager(), SIGNAL(fileReceived(QXmppTransferJob*)),\n                    this, SLOT(slotFileReceived(QXmppTransferJob*)));\n    Q_ASSERT(check);\n}\n\n\/\/\/ Request that the given file be sent to the recipient once he\/she is online.\n\/\/\/\n\/\/\/ \\param recipient\n\/\/\/ \\param file\n\nvoid xmppClient::sendOnceAvailable(const QString &recipient, const QString &file)\n{\n    m_sendRecipient = recipient;\n    m_sendFile = file;\n}\n\nvoid xmppClient::slotConnected()\n{\n    const QLatin1String recipient(\"client@geiseri.com\/QXmpp\");\n\n    \/\/ if we are the recipient, do nothing\n    if (getConfiguration().jid() == recipient)\n        return;\n\n    QXmppTransferJob *job = transferManager().sendFile(recipient, \"xmppClient.cpp\");\n\n    bool check = connect( job, SIGNAL(error(QXmppTransferJob::Error)),\n             this, SLOT(slotError(QXmppTransferJob::Error)) );\n    Q_ASSERT(check);\n\n    check = connect( job, SIGNAL(finished()),\n             this, SLOT(slotFinished()) );\n    Q_ASSERT(check);\n\n    check = connect( job, SIGNAL(progress(qint64,qint64)),\n             this, SLOT(slotProgress(qint64,qint64)) );\n    Q_ASSERT(check);\n}\n\n\/\/\/ A file transfer failed.\n\nvoid xmppClient::slotError(QXmppTransferJob::Error error)\n{\n    qDebug() << \"Transmission failed:\" << error;\n}\n\n\/\/\/ A file transfer request was received.\n\nvoid xmppClient::slotFileReceived(QXmppTransferJob *job)\n{\n    qDebug() << \"Got transfer request from:\" << job->jid();\n\n    bool check = connect(job, SIGNAL(error(QXmppTransferJob::Error)), this, SLOT(slotError(QXmppTransferJob::Error)));\n    Q_ASSERT(check);\n\n    check = connect(job, SIGNAL(finished()), this, SLOT(slotFinished()));\n    Q_ASSERT(check);\n\n    check = connect(job, SIGNAL(progress(qint64,qint64)), this, SLOT(slotProgress(qint64,qint64)));\n    Q_ASSERT(check);\n\n    \/\/ allocate a buffer to receive the file\n    QBuffer *buffer = new QBuffer(this);\n    buffer->open(QIODevice::WriteOnly);\n    job->accept(buffer);\n}\n\n\/\/\/ A file transfer finished.\n\nvoid xmppClient::slotFinished()\n{\n    qDebug() << \"Transmission finished\";\n}\n\n\/\/\/ A file transfer has made progress.\n\nvoid xmppClient::slotProgress(qint64 done, qint64 total)\n{\n    qDebug() << \"Transmission progress:\" << done << \"\/\" << total;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"TestCase.h\"\n\n#include <sstream>\n\n#include \"ResultsMap.hh\"\n\nnamespace SyUnit\n{\n  \n\/**\n * This is a class-level comment.\n *\/\nclass ResultsMapTest : public SyUnit::TestCase\n{\npublic:\n\n  \/**\n   * This is a comment on set_and_get().\n   *\/\n  void\n  set_and_get()\n  {\n    ResultsMap rm;\n    rm[\"key1\"] = \"value1\";\n    assert_equals(rm[\"key1\"], \"value1\", \"Set\/get don't work.\");\n  }\n\n  \/**\n   * This is a comment on appending().\n   *\n   * @depends test_map_properties\n   *\/\n  void\n  appending()\n  {\n    ResultsMap rm;\n    rm[\"key1\"] = \"value1\";\n    rm[\"key1\"] += \"value2\";\n    assert_equals(rm[\"key1\"], \"value1value2\", \"Appending doesn't work\");\n  }\n\n  \/**\n   * This is a comment on basic_printing().\n   * @depends set_and_get\n   *\/\n  void\n  basic_printing()\n  {\n    ResultsMap rm;\n    rm[\"key1\"] = \"value1\";\n    rm[\"key2\"] = \"value2\";\n    std::stringstream s;\n    s << rm;\n    assert_equals(s.str(),\n                  \"key1: value1\\n\"\n                  \"key2: value2\\n\",\n                  \"Basic printing doesn't work.\");\n  }\n\n  \/**\n   * This is a comment on final_newline_handling().\n   *\n   * @depends basic_printing\n   *\/\n  void\n  final_newline_handling()\n  {\n    ResultsMap rm;\n    rm[\"key1\"] = \"foo\\n\";\n    rm[\"key2\"] = \"bar\";\n    rm[\"key3\"] = \"baz\\n\";\n    std::stringstream s;\n    s << rm;\n    assert_equals(s.str(),\n                  \"key1: foo\\n\"\n                  \"key2: bar\\n\"\n                  \"key3: baz\\n\",\n                  \"End of value newline handling doesn't work.\");\n  }\n\n  \/**\n   * This is a comment on multiline_indenting().\n   *\n   * @depends basic_printing\n   * @depends final_newline_handling\n   *\/\n  void\n  multiline_indenting()\n  {\n    ResultsMap rm;\n    rm[\"key\"] = \"value\\nmore value\";\n    rm[\"key2\"] = \"blah\";\n    std::stringstream actual, target;\n    actual << rm;\n    target << \"key: value\\n\"\n           << ResultsMap::continuation_indent << \"more value\\n\"\n           << \"key2: blah\\n\";\n    assert_equals(actual.str(), target.str(),\n                  \"Basic 2 line values don't work.\");\n  }\n\n  void\n  blank_line_quoting()\n  {\n    ResultsMap rm;\n    rm[\"key\"] = \"value\\nmore value\\n\\nanother line.\";\n    rm[\"key2\"] = \"blah\";\n    std::stringstream actual, target;\n    actual << rm;\n    target << \"key: value\\n\"\n           << ResultsMap::continuation_indent << \"more value\\n\"\n           << ResultsMap::continuation_indent\n           << ResultsMap::blank_line_quote << \"\\n\"\n           << ResultsMap::continuation_indent << \"another line.\\n\"\n           << \"key2: blah\\n\";\n    assert_equals(actual.str(), target.str(),\n                  \"Blank line quoting doesn't work.\");\n  }\n\n  \/**\n   * This is a comment on operator_equals().\n   *\n   * @depends set_and_get\n   *\/\n  void\n  operator_equals()\n  {\n    ResultsMap rm1, rm2;\n    rm1[\"key\"] = \"value\";\n    rm2[\"key\"] = \"value\";\n    assert_true(rm1 == rm2, \"== gives false negatives\");\n    assert_false(rm1 != rm2, \"!= gives false positives\");\n    rm2[\"key2\"] = \"value2\";\n    assert_false(rm1 == rm2, \"== gives false positives\");\n    assert_true(rm1 != rm2, \"!= gives false negatives\");\n  }\n\n  \/**\n   * This is a comment on operator_equals_order().\n   *\n   * @depends operator_equals\n   *\/\n  void\n  operator_equals_order()\n  {\n    ResultsMap rm1, rm2;\n    rm1[\"key1\"] = \"value1\";\n    rm1[\"key2\"] = \"value2\";\n    rm2[\"key2\"] = \"value2\";\n    rm2[\"key1\"] = \"value1\";\n    assert_equals(rm1, rm2, \"== is dependent on ordering.\");\n  }\n  \n  \/**\n   * This is a comment on ordering().\n   *\n   * @depends basic_printing\n   * @depends operator_equals_order\n   *\/\n  void\n  ordering()\n  {\n    ResultsMap rm1, rm2;\n    rm1[\"key1\"] = \"value1\";\n    rm1[\"key2\"] = \"value2\";\n    rm2[\"key2\"] = \"value2\";\n    rm2[\"key1\"] = \"value1\";\n    std::stringstream s1, s2;\n    s1 << rm1;\n    s2 << rm2;\n    assert_true(s1.str() != s2.str(),\n                \"Printing doesn't respect order of key creation.\");\n  }\n  \n  \/**\n   * This is a comment on copy_constructor().\n   *\n   * @depends operator_equals\n   *\/\n  void\n  copy_constructor()\n  {\n    ResultsMap rm1;\n    rm1[\"key\"] = \"value\";\n    ResultsMap rm2 = rm1;\n    assert_equals(rm1, rm2,\n                  \"Copy constructor creates non-equal objects.\");\n  }\n\n  \/**\n   * This is a comment on assignment_test().\n   *\n   * @depends operator_equals\n   *\/\n  void\n  assignment_test()\n  {\n    ResultsMap rm1, rm2;\n    rm1[\"key\"] = \"value\";\n    rm2[\"other-key\"] = \"other-value\";\n    rm2 = rm1;\n    assert_equals(rm2, rm1,\n                  \"Assignment leaves non-equal objects\");\n  }\n\n  \/**\n   * This is a comment on test_clear().\n   *\n   * @depends operator_equals\n   *\/\n  void\n  test_clear()\n  {\n    ResultsMap rm1, rm2;\n    rm1[\"key\"] = \"value\";\n    assert_true(rm1 != rm2, \"Can't happen!\");\n    rm1.clear();\n    assert_true(rm1 == rm2, \"clear() didn't clear the object\");\n  }\n};\n \n}\n\n\/\/ tag: njs@fresco.org 8c25f7e76cfac0c6dec27fbbb49e6eac\n<commit_msg>silly typo<commit_after>#include \"TestCase.hh\"\n\n#include <sstream>\n\n#include \"ResultsMap.hh\"\n\nnamespace SyUnit\n{\n  \n\/**\n * This is a class-level comment.\n *\/\nclass ResultsMapTest : public SyUnit::TestCase\n{\npublic:\n\n  \/**\n   * This is a comment on set_and_get().\n   *\/\n  void\n  set_and_get()\n  {\n    ResultsMap rm;\n    rm[\"key1\"] = \"value1\";\n    assert_equals(rm[\"key1\"], \"value1\", \"Set\/get don't work.\");\n  }\n\n  \/**\n   * This is a comment on appending().\n   *\n   * @depends test_map_properties\n   *\/\n  void\n  appending()\n  {\n    ResultsMap rm;\n    rm[\"key1\"] = \"value1\";\n    rm[\"key1\"] += \"value2\";\n    assert_equals(rm[\"key1\"], \"value1value2\", \"Appending doesn't work\");\n  }\n\n  \/**\n   * This is a comment on basic_printing().\n   * @depends set_and_get\n   *\/\n  void\n  basic_printing()\n  {\n    ResultsMap rm;\n    rm[\"key1\"] = \"value1\";\n    rm[\"key2\"] = \"value2\";\n    std::stringstream s;\n    s << rm;\n    assert_equals(s.str(),\n                  \"key1: value1\\n\"\n                  \"key2: value2\\n\",\n                  \"Basic printing doesn't work.\");\n  }\n\n  \/**\n   * This is a comment on final_newline_handling().\n   *\n   * @depends basic_printing\n   *\/\n  void\n  final_newline_handling()\n  {\n    ResultsMap rm;\n    rm[\"key1\"] = \"foo\\n\";\n    rm[\"key2\"] = \"bar\";\n    rm[\"key3\"] = \"baz\\n\";\n    std::stringstream s;\n    s << rm;\n    assert_equals(s.str(),\n                  \"key1: foo\\n\"\n                  \"key2: bar\\n\"\n                  \"key3: baz\\n\",\n                  \"End of value newline handling doesn't work.\");\n  }\n\n  \/**\n   * This is a comment on multiline_indenting().\n   *\n   * @depends basic_printing\n   * @depends final_newline_handling\n   *\/\n  void\n  multiline_indenting()\n  {\n    ResultsMap rm;\n    rm[\"key\"] = \"value\\nmore value\";\n    rm[\"key2\"] = \"blah\";\n    std::stringstream actual, target;\n    actual << rm;\n    target << \"key: value\\n\"\n           << ResultsMap::continuation_indent << \"more value\\n\"\n           << \"key2: blah\\n\";\n    assert_equals(actual.str(), target.str(),\n                  \"Basic 2 line values don't work.\");\n  }\n\n  void\n  blank_line_quoting()\n  {\n    ResultsMap rm;\n    rm[\"key\"] = \"value\\nmore value\\n\\nanother line.\";\n    rm[\"key2\"] = \"blah\";\n    std::stringstream actual, target;\n    actual << rm;\n    target << \"key: value\\n\"\n           << ResultsMap::continuation_indent << \"more value\\n\"\n           << ResultsMap::continuation_indent\n           << ResultsMap::blank_line_quote << \"\\n\"\n           << ResultsMap::continuation_indent << \"another line.\\n\"\n           << \"key2: blah\\n\";\n    assert_equals(actual.str(), target.str(),\n                  \"Blank line quoting doesn't work.\");\n  }\n\n  \/**\n   * This is a comment on operator_equals().\n   *\n   * @depends set_and_get\n   *\/\n  void\n  operator_equals()\n  {\n    ResultsMap rm1, rm2;\n    rm1[\"key\"] = \"value\";\n    rm2[\"key\"] = \"value\";\n    assert_true(rm1 == rm2, \"== gives false negatives\");\n    assert_false(rm1 != rm2, \"!= gives false positives\");\n    rm2[\"key2\"] = \"value2\";\n    assert_false(rm1 == rm2, \"== gives false positives\");\n    assert_true(rm1 != rm2, \"!= gives false negatives\");\n  }\n\n  \/**\n   * This is a comment on operator_equals_order().\n   *\n   * @depends operator_equals\n   *\/\n  void\n  operator_equals_order()\n  {\n    ResultsMap rm1, rm2;\n    rm1[\"key1\"] = \"value1\";\n    rm1[\"key2\"] = \"value2\";\n    rm2[\"key2\"] = \"value2\";\n    rm2[\"key1\"] = \"value1\";\n    assert_equals(rm1, rm2, \"== is dependent on ordering.\");\n  }\n  \n  \/**\n   * This is a comment on ordering().\n   *\n   * @depends basic_printing\n   * @depends operator_equals_order\n   *\/\n  void\n  ordering()\n  {\n    ResultsMap rm1, rm2;\n    rm1[\"key1\"] = \"value1\";\n    rm1[\"key2\"] = \"value2\";\n    rm2[\"key2\"] = \"value2\";\n    rm2[\"key1\"] = \"value1\";\n    std::stringstream s1, s2;\n    s1 << rm1;\n    s2 << rm2;\n    assert_true(s1.str() != s2.str(),\n                \"Printing doesn't respect order of key creation.\");\n  }\n  \n  \/**\n   * This is a comment on copy_constructor().\n   *\n   * @depends operator_equals\n   *\/\n  void\n  copy_constructor()\n  {\n    ResultsMap rm1;\n    rm1[\"key\"] = \"value\";\n    ResultsMap rm2 = rm1;\n    assert_equals(rm1, rm2,\n                  \"Copy constructor creates non-equal objects.\");\n  }\n\n  \/**\n   * This is a comment on assignment_test().\n   *\n   * @depends operator_equals\n   *\/\n  void\n  assignment_test()\n  {\n    ResultsMap rm1, rm2;\n    rm1[\"key\"] = \"value\";\n    rm2[\"other-key\"] = \"other-value\";\n    rm2 = rm1;\n    assert_equals(rm2, rm1,\n                  \"Assignment leaves non-equal objects\");\n  }\n\n  \/**\n   * This is a comment on test_clear().\n   *\n   * @depends operator_equals\n   *\/\n  void\n  test_clear()\n  {\n    ResultsMap rm1, rm2;\n    rm1[\"key\"] = \"value\";\n    assert_true(rm1 != rm2, \"Can't happen!\");\n    rm1.clear();\n    assert_true(rm1 == rm2, \"clear() didn't clear the object\");\n  }\n};\n \n}\n\n\/\/ tag: njs@fresco.org 8c25f7e76cfac0c6dec27fbbb49e6eac\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <string>\n\n#include \"Reindeer.hpp\"\n\nvoid run_part_one() {\n    unsigned int max_distance = 0;\n    std::string line;\n    while(std::getline(std::cin,line)) {\n        unsigned int travelled_distance = Reindeer::from_string(line).get_distance_after_seconds(2503);\n        if (travelled_distance > max_distance) {\n            max_distance = travelled_distance;\n        }\n    }\n    std::cout << max_distance << std::endl;\n}\nvoid run_part_two() {\n}\n\n\nint main(int argc, char* argv[]) {\n    if (argc > 1) {\n        if (std::string(argv[1]) == \"--part_two\") {\n            run_part_two();\n        } else {\n            std::cout << \"Usage: day14 [--part_two]\" << std::endl;\n            return -1;\n        }\n    } else {\n        run_part_one();\n    }\n}\n<commit_msg>added runtime code for day 14 part two<commit_after>#include <iostream>\n#include <string>\n#include <vector>\n#include <map>\n#include <algorithm>\n\n#include \"Reindeer.hpp\"\n\nvoid run_part_one() {\n    unsigned int max_distance = 0;\n    std::string line;\n    while(std::getline(std::cin,line)) {\n        unsigned int travelled_distance = Reindeer::from_string(line).get_distance_after_seconds(2503);\n        if (travelled_distance > max_distance) {\n            max_distance = travelled_distance;\n        }\n    }\n    std::cout << max_distance << std::endl;\n}\nvoid run_part_two() {\n    std::vector<Reindeer> reindeers;\n    std::vector<int> scores;\n    std::string line;\n    while(std::getline(std::cin,line)) {\n        auto reindeer = Reindeer::from_string(line);\n        reindeers.push_back(reindeer);\n        scores.push_back(0);\n    }\n    for (unsigned int seconds = 1; seconds <= 2503; seconds++) {\n        unsigned int max_travelled_distance = 0;\n        std::vector<int> max_indices;\n        for(size_t i=0; i<reindeers.size();i++) {\n            unsigned int travelled_distance = reindeers[i].get_distance_after_seconds(seconds);\n            if (travelled_distance > max_travelled_distance) {\n                max_travelled_distance = travelled_distance;\n                max_indices.empty();\n                max_indices.push_back(i);\n            } else if (travelled_distance == max_travelled_distance) {\n                max_indices.push_back(i);\n            }\n        }\n        for (auto i: max_indices) {\n            scores[i]++; \n        }\n    }\n    unsigned int max_score = *std::max_element(scores.begin(),scores.end());\n    std::cout << max_score << std::endl;\n}\n\n\nint main(int argc, char* argv[]) {\n    if (argc > 1) {\n        if (std::string(argv[1]) == \"--part_two\") {\n            run_part_two();\n        } else {\n            std::cout << \"Usage: day14 [--part_two]\" << std::endl;\n            return -1;\n        }\n    } else {\n        run_part_one();\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- Driver.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 \"Driver.h\"\n#include \"Config.h\"\n#include \"Error.h\"\n#include \"InputFiles.h\"\n#include \"SymbolTable.h\"\n#include \"Target.h\"\n#include \"Writer.h\"\n#include \"llvm\/ADT\/STLExtras.h\"\n#include \"llvm\/ADT\/StringExtras.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include <utility>\n\nusing namespace llvm;\nusing namespace llvm::ELF;\nusing namespace llvm::object;\n\nusing namespace lld;\nusing namespace lld::elf2;\n\nConfiguration *lld::elf2::Config;\nLinkerDriver *lld::elf2::Driver;\n\nvoid lld::elf2::link(ArrayRef<const char *> Args) {\n  Configuration C;\n  LinkerDriver D;\n  Config = &C;\n  Driver = &D;\n  Driver->main(Args.slice(1));\n}\n\nstatic std::pair<ELFKind, uint16_t> parseEmulation(StringRef S) {\n  Config->Emulation = S;\n  if (S == \"elf32btsmip\") return {ELF32BEKind, EM_MIPS};\n  if (S == \"elf32ltsmip\") return {ELF32LEKind, EM_MIPS};\n  if (S == \"elf32ppc\")    return {ELF32BEKind, EM_PPC};\n  if (S == \"elf64ppc\")    return {ELF64BEKind, EM_PPC64};\n  if (S == \"elf_i386\")    return {ELF32LEKind, EM_386};\n  if (S == \"elf_x86_64\")  return {ELF64LEKind, EM_X86_64};\n  error(\"Unknown emulation: \" + S);\n}\n\nstatic TargetInfo *createTarget() {\n  switch (Config->EMachine) {\n  case EM_386:\n    return new X86TargetInfo();\n  case EM_AARCH64:\n    return new AArch64TargetInfo();\n  case EM_ARM:\n    return new ARMTargetInfo();\n  case EM_MIPS:\n    return new MipsTargetInfo();\n  case EM_PPC:\n    return new PPCTargetInfo();\n  case EM_PPC64:\n    return new PPC64TargetInfo();\n  case EM_X86_64:\n    return new X86_64TargetInfo();\n  }\n  error(\"Unknown target machine\");\n}\n\n\/\/ Opens and parses a file. Path has to be resolved already.\n\/\/ Newly created memory buffers are owned by this driver.\nvoid LinkerDriver::addFile(StringRef Path) {\n  using namespace llvm::sys::fs;\n  if (Config->Verbose)\n    llvm::outs() << Path << \"\\n\";\n  auto MBOrErr = MemoryBuffer::getFile(Path);\n  error(MBOrErr, Twine(\"cannot open \") + Path);\n  std::unique_ptr<MemoryBuffer> &MB = *MBOrErr;\n  MemoryBufferRef MBRef = MB->getMemBufferRef();\n  OwningMBs.push_back(std::move(MB)); \/\/ take MB ownership\n\n  switch (identify_magic(MBRef.getBuffer())) {\n  case file_magic::unknown:\n    readLinkerScript(&Alloc, MBRef);\n    return;\n  case file_magic::archive:\n    if (WholeArchive) {\n      auto File = make_unique<ArchiveFile>(MBRef);\n      for (MemoryBufferRef &MB : File->getMembers())\n        Files.push_back(createELFFile<ObjectFile>(MB));\n      OwningArchives.emplace_back(std::move(File));\n      return;\n    }\n    Files.push_back(make_unique<ArchiveFile>(MBRef));\n    return;\n  case file_magic::elf_shared_object:\n    Files.push_back(createELFFile<SharedFile>(MBRef));\n    return;\n  default:\n    Files.push_back(createELFFile<ObjectFile>(MBRef));\n  }\n}\n\nstatic StringRef\ngetString(opt::InputArgList &Args, unsigned Key, StringRef Default = \"\") {\n  if (auto *Arg = Args.getLastArg(Key))\n    return Arg->getValue();\n  return Default;\n}\n\nvoid LinkerDriver::main(ArrayRef<const char *> ArgsArr) {\n  initSymbols();\n\n  opt::InputArgList Args = parseArgs(&Alloc, ArgsArr);\n  createFiles(Args);\n\n  switch (Config->ElfKind) {\n  case ELF32LEKind:\n    link<ELF32LE>(Args);\n    return;\n  case ELF32BEKind:\n    link<ELF32BE>(Args);\n    return;\n  case ELF64LEKind:\n    link<ELF64LE>(Args);\n    return;\n  case ELF64BEKind:\n    link<ELF64BE>(Args);\n    return;\n  default:\n    error(\"-m or at least a .o file required\");\n  }\n}\n\nvoid LinkerDriver::createFiles(opt::InputArgList &Args) {\n  for (auto *Arg : Args.filtered(OPT_L))\n    Config->SearchPaths.push_back(Arg->getValue());\n\n  std::vector<StringRef> RPaths;\n  for (auto *Arg : Args.filtered(OPT_rpath))\n    RPaths.push_back(Arg->getValue());\n  if (!RPaths.empty())\n    Config->RPath = llvm::join(RPaths.begin(), RPaths.end(), \":\");\n\n  if (auto *Arg = Args.getLastArg(OPT_m)) {\n    std::pair<ELFKind, uint16_t> P = parseEmulation(Arg->getValue());\n    Config->ElfKind = P.first;\n    Config->EMachine = P.second;\n  }\n\n  Config->AllowMultipleDefinition = Args.hasArg(OPT_allow_multiple_definition);\n  Config->DiscardAll = Args.hasArg(OPT_discard_all);\n  Config->DiscardLocals = Args.hasArg(OPT_discard_locals);\n  Config->DiscardNone = Args.hasArg(OPT_discard_none);\n  Config->EnableNewDtags = !Args.hasArg(OPT_disable_new_dtags);\n  Config->ExportDynamic = Args.hasArg(OPT_export_dynamic);\n  Config->NoInhibitExec = Args.hasArg(OPT_noinhibit_exec);\n  Config->NoUndefined = Args.hasArg(OPT_no_undefined);\n  Config->Shared = Args.hasArg(OPT_shared);\n  Config->Verbose = Args.hasArg(OPT_verbose);\n\n  Config->DynamicLinker = getString(Args, OPT_dynamic_linker);\n  Config->Entry = getString(Args, OPT_entry);\n  Config->Fini = getString(Args, OPT_fini, \"_fini\");\n  Config->Init = getString(Args, OPT_init, \"_init\");\n  Config->OutputFile = getString(Args, OPT_o);\n  Config->SoName = getString(Args, OPT_soname);\n  Config->Sysroot = getString(Args, OPT_sysroot);\n\n  for (auto *Arg : Args.filtered(OPT_z))\n    if (Arg->getValue() == StringRef(\"now\"))\n      Config->ZNow = true;\n\n  for (auto *Arg : Args) {\n    switch (Arg->getOption().getID()) {\n    case OPT_l:\n      addFile(searchLibrary(Arg->getValue()));\n      break;\n    case OPT_INPUT:\n    case OPT_script:\n      addFile(Arg->getValue());\n      break;\n    case OPT_Bstatic:\n      Config->Static = true;\n      break;\n    case OPT_Bdynamic:\n      Config->Static = false;\n      break;\n    case OPT_whole_archive:\n      WholeArchive = true;\n      break;\n    case OPT_no_whole_archive:\n      WholeArchive = false;\n      break;\n    }\n  }\n\n  if (Files.empty())\n    error(\"no input files.\");\n}\n\ntemplate <class ELFT> void LinkerDriver::link(opt::InputArgList &Args) {\n  SymbolTable<ELFT> Symtab;\n  Target.reset(createTarget());\n\n  if (!Config->Shared) {\n    \/\/ Add entry symbol.\n    Config->EntrySym = Symtab.addUndefined(\n        Config->Entry.empty() ? Target->getDefaultEntry() : Config->Entry);\n\n    \/\/ In the assembly for 32 bit x86 the _GLOBAL_OFFSET_TABLE_ symbol\n    \/\/ is magical and is used to produce a R_386_GOTPC relocation.\n    \/\/ The R_386_GOTPC relocation value doesn't actually depend on the\n    \/\/ symbol value, so it could use an index of STN_UNDEF which, according\n    \/\/ to the spec, means the symbol value is 0.\n    \/\/ Unfortunately both gas and MC keep the _GLOBAL_OFFSET_TABLE_ symbol in\n    \/\/ the object file.\n    \/\/ The situation is even stranger on x86_64 where the assembly doesn't\n    \/\/ need the magical symbol, but gas still puts _GLOBAL_OFFSET_TABLE_ as\n    \/\/ an undefined symbol in the .o files.\n    \/\/ Given that the symbol is effectively unused, we just create a dummy\n    \/\/ hidden one to avoid the undefined symbol error.\n    Symtab.addIgnoredSym(\"_GLOBAL_OFFSET_TABLE_\");\n  }\n\n  for (std::unique_ptr<InputFile> &F : Files)\n    Symtab.addFile(std::move(F));\n\n  for (auto *Arg : Args.filtered(OPT_undefined))\n    Symtab.addUndefinedOpt(Arg->getValue());\n\n  if (Config->OutputFile.empty())\n    Config->OutputFile = \"a.out\";\n\n  \/\/ Write the result to the file.\n  writeResult<ELFT>(&Symtab);\n}\n<commit_msg>Clang-format.<commit_after>\/\/===- Driver.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 \"Driver.h\"\n#include \"Config.h\"\n#include \"Error.h\"\n#include \"InputFiles.h\"\n#include \"SymbolTable.h\"\n#include \"Target.h\"\n#include \"Writer.h\"\n#include \"llvm\/ADT\/STLExtras.h\"\n#include \"llvm\/ADT\/StringExtras.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include <utility>\n\nusing namespace llvm;\nusing namespace llvm::ELF;\nusing namespace llvm::object;\n\nusing namespace lld;\nusing namespace lld::elf2;\n\nConfiguration *lld::elf2::Config;\nLinkerDriver *lld::elf2::Driver;\n\nvoid lld::elf2::link(ArrayRef<const char *> Args) {\n  Configuration C;\n  LinkerDriver D;\n  Config = &C;\n  Driver = &D;\n  Driver->main(Args.slice(1));\n}\n\nstatic std::pair<ELFKind, uint16_t> parseEmulation(StringRef S) {\n  Config->Emulation = S;\n  if (S == \"elf32btsmip\")\n    return {ELF32BEKind, EM_MIPS};\n  if (S == \"elf32ltsmip\")\n    return {ELF32LEKind, EM_MIPS};\n  if (S == \"elf32ppc\")\n    return {ELF32BEKind, EM_PPC};\n  if (S == \"elf64ppc\")\n    return {ELF64BEKind, EM_PPC64};\n  if (S == \"elf_i386\")\n    return {ELF32LEKind, EM_386};\n  if (S == \"elf_x86_64\")\n    return {ELF64LEKind, EM_X86_64};\n  error(\"Unknown emulation: \" + S);\n}\n\nstatic TargetInfo *createTarget() {\n  switch (Config->EMachine) {\n  case EM_386:\n    return new X86TargetInfo();\n  case EM_AARCH64:\n    return new AArch64TargetInfo();\n  case EM_ARM:\n    return new ARMTargetInfo();\n  case EM_MIPS:\n    return new MipsTargetInfo();\n  case EM_PPC:\n    return new PPCTargetInfo();\n  case EM_PPC64:\n    return new PPC64TargetInfo();\n  case EM_X86_64:\n    return new X86_64TargetInfo();\n  }\n  error(\"Unknown target machine\");\n}\n\n\/\/ Opens and parses a file. Path has to be resolved already.\n\/\/ Newly created memory buffers are owned by this driver.\nvoid LinkerDriver::addFile(StringRef Path) {\n  using namespace llvm::sys::fs;\n  if (Config->Verbose)\n    llvm::outs() << Path << \"\\n\";\n  auto MBOrErr = MemoryBuffer::getFile(Path);\n  error(MBOrErr, Twine(\"cannot open \") + Path);\n  std::unique_ptr<MemoryBuffer> &MB = *MBOrErr;\n  MemoryBufferRef MBRef = MB->getMemBufferRef();\n  OwningMBs.push_back(std::move(MB)); \/\/ take MB ownership\n\n  switch (identify_magic(MBRef.getBuffer())) {\n  case file_magic::unknown:\n    readLinkerScript(&Alloc, MBRef);\n    return;\n  case file_magic::archive:\n    if (WholeArchive) {\n      auto File = make_unique<ArchiveFile>(MBRef);\n      for (MemoryBufferRef &MB : File->getMembers())\n        Files.push_back(createELFFile<ObjectFile>(MB));\n      OwningArchives.emplace_back(std::move(File));\n      return;\n    }\n    Files.push_back(make_unique<ArchiveFile>(MBRef));\n    return;\n  case file_magic::elf_shared_object:\n    Files.push_back(createELFFile<SharedFile>(MBRef));\n    return;\n  default:\n    Files.push_back(createELFFile<ObjectFile>(MBRef));\n  }\n}\n\nstatic StringRef\ngetString(opt::InputArgList &Args, unsigned Key, StringRef Default = \"\") {\n  if (auto *Arg = Args.getLastArg(Key))\n    return Arg->getValue();\n  return Default;\n}\n\nvoid LinkerDriver::main(ArrayRef<const char *> ArgsArr) {\n  initSymbols();\n\n  opt::InputArgList Args = parseArgs(&Alloc, ArgsArr);\n  createFiles(Args);\n\n  switch (Config->ElfKind) {\n  case ELF32LEKind:\n    link<ELF32LE>(Args);\n    return;\n  case ELF32BEKind:\n    link<ELF32BE>(Args);\n    return;\n  case ELF64LEKind:\n    link<ELF64LE>(Args);\n    return;\n  case ELF64BEKind:\n    link<ELF64BE>(Args);\n    return;\n  default:\n    error(\"-m or at least a .o file required\");\n  }\n}\n\nvoid LinkerDriver::createFiles(opt::InputArgList &Args) {\n  for (auto *Arg : Args.filtered(OPT_L))\n    Config->SearchPaths.push_back(Arg->getValue());\n\n  std::vector<StringRef> RPaths;\n  for (auto *Arg : Args.filtered(OPT_rpath))\n    RPaths.push_back(Arg->getValue());\n  if (!RPaths.empty())\n    Config->RPath = llvm::join(RPaths.begin(), RPaths.end(), \":\");\n\n  if (auto *Arg = Args.getLastArg(OPT_m)) {\n    std::pair<ELFKind, uint16_t> P = parseEmulation(Arg->getValue());\n    Config->ElfKind = P.first;\n    Config->EMachine = P.second;\n  }\n\n  Config->AllowMultipleDefinition = Args.hasArg(OPT_allow_multiple_definition);\n  Config->DiscardAll = Args.hasArg(OPT_discard_all);\n  Config->DiscardLocals = Args.hasArg(OPT_discard_locals);\n  Config->DiscardNone = Args.hasArg(OPT_discard_none);\n  Config->EnableNewDtags = !Args.hasArg(OPT_disable_new_dtags);\n  Config->ExportDynamic = Args.hasArg(OPT_export_dynamic);\n  Config->NoInhibitExec = Args.hasArg(OPT_noinhibit_exec);\n  Config->NoUndefined = Args.hasArg(OPT_no_undefined);\n  Config->Shared = Args.hasArg(OPT_shared);\n  Config->Verbose = Args.hasArg(OPT_verbose);\n\n  Config->DynamicLinker = getString(Args, OPT_dynamic_linker);\n  Config->Entry = getString(Args, OPT_entry);\n  Config->Fini = getString(Args, OPT_fini, \"_fini\");\n  Config->Init = getString(Args, OPT_init, \"_init\");\n  Config->OutputFile = getString(Args, OPT_o);\n  Config->SoName = getString(Args, OPT_soname);\n  Config->Sysroot = getString(Args, OPT_sysroot);\n\n  for (auto *Arg : Args.filtered(OPT_z))\n    if (Arg->getValue() == StringRef(\"now\"))\n      Config->ZNow = true;\n\n  for (auto *Arg : Args) {\n    switch (Arg->getOption().getID()) {\n    case OPT_l:\n      addFile(searchLibrary(Arg->getValue()));\n      break;\n    case OPT_INPUT:\n    case OPT_script:\n      addFile(Arg->getValue());\n      break;\n    case OPT_Bstatic:\n      Config->Static = true;\n      break;\n    case OPT_Bdynamic:\n      Config->Static = false;\n      break;\n    case OPT_whole_archive:\n      WholeArchive = true;\n      break;\n    case OPT_no_whole_archive:\n      WholeArchive = false;\n      break;\n    }\n  }\n\n  if (Files.empty())\n    error(\"no input files.\");\n}\n\ntemplate <class ELFT> void LinkerDriver::link(opt::InputArgList &Args) {\n  SymbolTable<ELFT> Symtab;\n  Target.reset(createTarget());\n\n  if (!Config->Shared) {\n    \/\/ Add entry symbol.\n    Config->EntrySym = Symtab.addUndefined(\n        Config->Entry.empty() ? Target->getDefaultEntry() : Config->Entry);\n\n    \/\/ In the assembly for 32 bit x86 the _GLOBAL_OFFSET_TABLE_ symbol\n    \/\/ is magical and is used to produce a R_386_GOTPC relocation.\n    \/\/ The R_386_GOTPC relocation value doesn't actually depend on the\n    \/\/ symbol value, so it could use an index of STN_UNDEF which, according\n    \/\/ to the spec, means the symbol value is 0.\n    \/\/ Unfortunately both gas and MC keep the _GLOBAL_OFFSET_TABLE_ symbol in\n    \/\/ the object file.\n    \/\/ The situation is even stranger on x86_64 where the assembly doesn't\n    \/\/ need the magical symbol, but gas still puts _GLOBAL_OFFSET_TABLE_ as\n    \/\/ an undefined symbol in the .o files.\n    \/\/ Given that the symbol is effectively unused, we just create a dummy\n    \/\/ hidden one to avoid the undefined symbol error.\n    Symtab.addIgnoredSym(\"_GLOBAL_OFFSET_TABLE_\");\n  }\n\n  for (std::unique_ptr<InputFile> &F : Files)\n    Symtab.addFile(std::move(F));\n\n  for (auto *Arg : Args.filtered(OPT_undefined))\n    Symtab.addUndefinedOpt(Arg->getValue());\n\n  if (Config->OutputFile.empty())\n    Config->OutputFile = \"a.out\";\n\n  \/\/ Write the result to the file.\n  writeResult<ELFT>(&Symtab);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: XMLSectionSourceDDEImportContext.cxx,v $\n *\n *  $Revision: 1.10 $\n *\n *  last change: $Author: hr $ $Date: 2007-06-27 16:05: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_xmloff.hxx\"\n\n#ifndef _XMLOFF_XMLSECTIONSOURCEDDEIMPORTCONTEXT_HXX_\n#include \"XMLSectionSourceDDEImportContext.hxx\"\n#endif\n\n#ifndef _XMLOFF_XMLSECTIONIMPORTCONTEXT_HXX_\n#include \"XMLSectionImportContext.hxx\"\n#endif\n\n#ifndef _COM_SUN_STAR_TEXT_SECTIONFILELINK_HPP_\n#include <com\/sun\/star\/text\/SectionFileLink.hpp>\n#endif\n\n#ifndef _XMLOFF_XMLICTXT_HXX\n#include <xmloff\/xmlictxt.hxx>\n#endif\n\n#ifndef _XMLOFF_XMLIMP_HXX\n#include <xmloff\/xmlimp.hxx>\n#endif\n\n#ifndef _XMLOFF_TEXTIMP_HXX_\n#include <xmloff\/txtimp.hxx>\n#endif\n\n#ifndef _XMLOFF_NMSPMAP_HXX\n#include <xmloff\/nmspmap.hxx>\n#endif\n\n#ifndef _XMLOFF_XMLNMSPE_HXX\n#include \"xmlnmspe.hxx\"\n#endif\n\n#ifndef _XMLOFF_XMLTOKEN_HXX\n#include <xmloff\/xmltoken.hxx>\n#endif\n\n#ifndef _XMLOFF_XMLUCONV_HXX\n#include <xmloff\/xmluconv.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_BEANS_XPROPERTYSET_HPP_\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_XMULTIPROPERTYSET_HPP_\n#include <com\/sun\/star\/beans\/XMultiPropertySet.hpp>\n#endif\n\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n\nusing ::rtl::OUString;\nusing ::com::sun::star::beans::XPropertySet;\nusing ::com::sun::star::beans::XMultiPropertySet;\nusing ::com::sun::star::uno::Reference;\nusing ::com::sun::star::xml::sax::XAttributeList;\n\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::text;\nusing namespace ::xmloff::token;\n\nconst sal_Char sAPI_DDECommandFile[] = \"DDECommandFile\";\nconst sal_Char sAPI_DDECommandType[] = \"DDECommandType\";\nconst sal_Char sAPI_DDECommandElement[] = \"DDECommandElement\";\nconst sal_Char sAPI_IsAutomaticUpdate[] = \"IsAutomaticUpdate\";\n\n\nTYPEINIT1(XMLSectionSourceDDEImportContext, SvXMLImportContext);\n\nXMLSectionSourceDDEImportContext::XMLSectionSourceDDEImportContext(\n    SvXMLImport& rImport,\n    sal_uInt16 nPrfx,\n    const OUString& rLocalName,\n    Reference<XPropertySet> & rSectPropSet) :\n        SvXMLImportContext(rImport, nPrfx, rLocalName),\n        rSectionPropertySet(rSectPropSet),\n        sDdeCommandFile(RTL_CONSTASCII_USTRINGPARAM(sAPI_DDECommandFile)),\n        sDdeCommandType(RTL_CONSTASCII_USTRINGPARAM(sAPI_DDECommandType)),\n       sDdeCommandElement(RTL_CONSTASCII_USTRINGPARAM(sAPI_DDECommandElement)),\n        sIsAutomaticUpdate(RTL_CONSTASCII_USTRINGPARAM(sAPI_IsAutomaticUpdate))\n{\n}\n\nXMLSectionSourceDDEImportContext::~XMLSectionSourceDDEImportContext()\n{\n}\n\nenum XMLSectionSourceDDEToken\n{\n    XML_TOK_SECTION_DDE_APPLICATION,\n    XML_TOK_SECTION_DDE_TOPIC,\n    XML_TOK_SECTION_DDE_ITEM,\n    XML_TOK_SECTION_IS_AUTOMATIC_UPDATE\n};\n\nstatic __FAR_DATA SvXMLTokenMapEntry aSectionSourceDDETokenMap[] =\n{\n    { XML_NAMESPACE_OFFICE, XML_DDE_APPLICATION,\n          XML_TOK_SECTION_DDE_APPLICATION },\n    { XML_NAMESPACE_OFFICE, XML_DDE_TOPIC, XML_TOK_SECTION_DDE_TOPIC },\n    { XML_NAMESPACE_OFFICE, XML_DDE_ITEM, XML_TOK_SECTION_DDE_ITEM },\n    { XML_NAMESPACE_OFFICE, XML_AUTOMATIC_UPDATE,\n          XML_TOK_SECTION_IS_AUTOMATIC_UPDATE },\n    XML_TOKEN_MAP_END\n};\n\n\nvoid XMLSectionSourceDDEImportContext::StartElement(\n    const Reference<XAttributeList> & xAttrList)\n{\n    SvXMLTokenMap aTokenMap(aSectionSourceDDETokenMap);\n    OUString sApplication;\n    OUString sTopic;\n    OUString sItem;\n    sal_Bool bAutomaticUpdate = sal_False;\n\n    sal_Int16 nLength = xAttrList->getLength();\n    for(sal_Int16 nAttr = 0; nAttr < nLength; nAttr++)\n    {\n        OUString sLocalName;\n        sal_uInt16 nPrefix = GetImport().GetNamespaceMap().\n            GetKeyByAttrName( xAttrList->getNameByIndex(nAttr),\n                              &sLocalName );\n\n        switch (aTokenMap.Get(nPrefix, sLocalName))\n        {\n            case XML_TOK_SECTION_DDE_APPLICATION:\n                sApplication = xAttrList->getValueByIndex(nAttr);\n                break;\n            case XML_TOK_SECTION_DDE_TOPIC:\n                sTopic = xAttrList->getValueByIndex(nAttr);\n                break;\n            case XML_TOK_SECTION_DDE_ITEM:\n                sItem = xAttrList->getValueByIndex(nAttr);\n                break;\n            case XML_TOK_SECTION_IS_AUTOMATIC_UPDATE:\n            {\n                sal_Bool bTmp;\n                if (SvXMLUnitConverter::convertBool(\n                    bTmp, xAttrList->getValueByIndex(nAttr)))\n                {\n                    bAutomaticUpdate = bTmp;\n                }\n                break;\n            }\n            default:\n                ; \/\/ ignore\n                break;\n        }\n    }\n\n    \/\/ DDE not supported on all platforms; query property first\n    if (rSectionPropertySet->getPropertySetInfo()->\n        hasPropertyByName(sDdeCommandFile))\n    {\n        \/\/ use multi property set to force single update of connection #83654#\n        Sequence<OUString> aNames(4);\n        Sequence<Any> aValues(4);\n\n        aValues[0] <<= sApplication;\n        aNames[0] = sDdeCommandFile;\n\n        aValues[1] <<= sTopic;\n        aNames[1] = sDdeCommandType;\n\n        aValues[2] <<= sItem;\n        aNames[2] = sDdeCommandElement;\n\n        aValues[3].setValue(&bAutomaticUpdate, ::getBooleanCppuType());\n        aNames[3] = sIsAutomaticUpdate;\n\n        Reference<XMultiPropertySet> rMultiPropSet(rSectionPropertySet,\n                                                   UNO_QUERY);\n        DBG_ASSERT(rMultiPropSet.is(), \"we'd really like a XMultiPropertySet\");\n        if (rMultiPropSet.is())\n            rMultiPropSet->setPropertyValues(aNames, aValues);\n        \/\/ else: ignore\n    }\n}\n\nvoid XMLSectionSourceDDEImportContext::EndElement()\n{\n    \/\/ nothing to be done!\n}\n\nSvXMLImportContext* XMLSectionSourceDDEImportContext::CreateChildContext(\n    sal_uInt16 nPrefix,\n    const OUString& rLocalName,\n    const Reference<XAttributeList> & )\n{\n    \/\/ ignore -> default context\n    return new SvXMLImportContext(GetImport(), nPrefix, rLocalName);\n}\n<commit_msg>INTEGRATION: CWS changefileheader (1.10.162); FILE MERGED 2008\/04\/01 16:10:10 thb 1.10.162.3: #i85898# Stripping all external header guards 2008\/04\/01 13:05:29 thb 1.10.162.2: #i85898# Stripping all external header guards 2008\/03\/31 16:28:36 rt 1.10.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: XMLSectionSourceDDEImportContext.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_xmloff.hxx\"\n#include \"XMLSectionSourceDDEImportContext.hxx\"\n#include \"XMLSectionImportContext.hxx\"\n#include <com\/sun\/star\/text\/SectionFileLink.hpp>\n#include <xmloff\/xmlictxt.hxx>\n#include <xmloff\/xmlimp.hxx>\n#include <xmloff\/txtimp.hxx>\n#include <xmloff\/nmspmap.hxx>\n#include \"xmlnmspe.hxx\"\n#include <xmloff\/xmltoken.hxx>\n#include <xmloff\/xmluconv.hxx>\n#include <com\/sun\/star\/uno\/Reference.h>\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#include <com\/sun\/star\/beans\/XMultiPropertySet.hpp>\n#include <tools\/debug.hxx>\n\nusing ::rtl::OUString;\nusing ::com::sun::star::beans::XPropertySet;\nusing ::com::sun::star::beans::XMultiPropertySet;\nusing ::com::sun::star::uno::Reference;\nusing ::com::sun::star::xml::sax::XAttributeList;\n\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::text;\nusing namespace ::xmloff::token;\n\nconst sal_Char sAPI_DDECommandFile[] = \"DDECommandFile\";\nconst sal_Char sAPI_DDECommandType[] = \"DDECommandType\";\nconst sal_Char sAPI_DDECommandElement[] = \"DDECommandElement\";\nconst sal_Char sAPI_IsAutomaticUpdate[] = \"IsAutomaticUpdate\";\n\n\nTYPEINIT1(XMLSectionSourceDDEImportContext, SvXMLImportContext);\n\nXMLSectionSourceDDEImportContext::XMLSectionSourceDDEImportContext(\n    SvXMLImport& rImport,\n    sal_uInt16 nPrfx,\n    const OUString& rLocalName,\n    Reference<XPropertySet> & rSectPropSet) :\n        SvXMLImportContext(rImport, nPrfx, rLocalName),\n        rSectionPropertySet(rSectPropSet),\n        sDdeCommandFile(RTL_CONSTASCII_USTRINGPARAM(sAPI_DDECommandFile)),\n        sDdeCommandType(RTL_CONSTASCII_USTRINGPARAM(sAPI_DDECommandType)),\n       sDdeCommandElement(RTL_CONSTASCII_USTRINGPARAM(sAPI_DDECommandElement)),\n        sIsAutomaticUpdate(RTL_CONSTASCII_USTRINGPARAM(sAPI_IsAutomaticUpdate))\n{\n}\n\nXMLSectionSourceDDEImportContext::~XMLSectionSourceDDEImportContext()\n{\n}\n\nenum XMLSectionSourceDDEToken\n{\n    XML_TOK_SECTION_DDE_APPLICATION,\n    XML_TOK_SECTION_DDE_TOPIC,\n    XML_TOK_SECTION_DDE_ITEM,\n    XML_TOK_SECTION_IS_AUTOMATIC_UPDATE\n};\n\nstatic __FAR_DATA SvXMLTokenMapEntry aSectionSourceDDETokenMap[] =\n{\n    { XML_NAMESPACE_OFFICE, XML_DDE_APPLICATION,\n          XML_TOK_SECTION_DDE_APPLICATION },\n    { XML_NAMESPACE_OFFICE, XML_DDE_TOPIC, XML_TOK_SECTION_DDE_TOPIC },\n    { XML_NAMESPACE_OFFICE, XML_DDE_ITEM, XML_TOK_SECTION_DDE_ITEM },\n    { XML_NAMESPACE_OFFICE, XML_AUTOMATIC_UPDATE,\n          XML_TOK_SECTION_IS_AUTOMATIC_UPDATE },\n    XML_TOKEN_MAP_END\n};\n\n\nvoid XMLSectionSourceDDEImportContext::StartElement(\n    const Reference<XAttributeList> & xAttrList)\n{\n    SvXMLTokenMap aTokenMap(aSectionSourceDDETokenMap);\n    OUString sApplication;\n    OUString sTopic;\n    OUString sItem;\n    sal_Bool bAutomaticUpdate = sal_False;\n\n    sal_Int16 nLength = xAttrList->getLength();\n    for(sal_Int16 nAttr = 0; nAttr < nLength; nAttr++)\n    {\n        OUString sLocalName;\n        sal_uInt16 nPrefix = GetImport().GetNamespaceMap().\n            GetKeyByAttrName( xAttrList->getNameByIndex(nAttr),\n                              &sLocalName );\n\n        switch (aTokenMap.Get(nPrefix, sLocalName))\n        {\n            case XML_TOK_SECTION_DDE_APPLICATION:\n                sApplication = xAttrList->getValueByIndex(nAttr);\n                break;\n            case XML_TOK_SECTION_DDE_TOPIC:\n                sTopic = xAttrList->getValueByIndex(nAttr);\n                break;\n            case XML_TOK_SECTION_DDE_ITEM:\n                sItem = xAttrList->getValueByIndex(nAttr);\n                break;\n            case XML_TOK_SECTION_IS_AUTOMATIC_UPDATE:\n            {\n                sal_Bool bTmp;\n                if (SvXMLUnitConverter::convertBool(\n                    bTmp, xAttrList->getValueByIndex(nAttr)))\n                {\n                    bAutomaticUpdate = bTmp;\n                }\n                break;\n            }\n            default:\n                ; \/\/ ignore\n                break;\n        }\n    }\n\n    \/\/ DDE not supported on all platforms; query property first\n    if (rSectionPropertySet->getPropertySetInfo()->\n        hasPropertyByName(sDdeCommandFile))\n    {\n        \/\/ use multi property set to force single update of connection #83654#\n        Sequence<OUString> aNames(4);\n        Sequence<Any> aValues(4);\n\n        aValues[0] <<= sApplication;\n        aNames[0] = sDdeCommandFile;\n\n        aValues[1] <<= sTopic;\n        aNames[1] = sDdeCommandType;\n\n        aValues[2] <<= sItem;\n        aNames[2] = sDdeCommandElement;\n\n        aValues[3].setValue(&bAutomaticUpdate, ::getBooleanCppuType());\n        aNames[3] = sIsAutomaticUpdate;\n\n        Reference<XMultiPropertySet> rMultiPropSet(rSectionPropertySet,\n                                                   UNO_QUERY);\n        DBG_ASSERT(rMultiPropSet.is(), \"we'd really like a XMultiPropertySet\");\n        if (rMultiPropSet.is())\n            rMultiPropSet->setPropertyValues(aNames, aValues);\n        \/\/ else: ignore\n    }\n}\n\nvoid XMLSectionSourceDDEImportContext::EndElement()\n{\n    \/\/ nothing to be done!\n}\n\nSvXMLImportContext* XMLSectionSourceDDEImportContext::CreateChildContext(\n    sal_uInt16 nPrefix,\n    const OUString& rLocalName,\n    const Reference<XAttributeList> & )\n{\n    \/\/ ignore -> default context\n    return new SvXMLImportContext(GetImport(), nPrefix, rLocalName);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright (c) 2011 Facebook\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\/**\n * \\file\n * This file is used by the Makefile to determine whether Infiniband is\n * available on this system.\n *\/\n\n#include <infiniband\/verbs.h>\n\nint main() {\n    int r;\n    ibv_free_device_list(ibv_get_device_list(&r));\n    return r;\n}\n<commit_msg>Checked if libverbs is new enough to have `IBV_QPT_RAW_ETH` defined.<commit_after>\/* Copyright (c) 2011 Facebook\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\/**\n * \\file\n * This file is used by the Makefile to determine whether Infiniband is\n * available on this system.\n *\/\n\n#include <infiniband\/verbs.h>\n\nint main() {\n    int r;\n    static_assert(IBV_QPT_RAW_ETH >= 0,\n            \"Symbol `IBV_QPT_RAW_ETH` is undefined; consider upgrading \"\n            \"your libverbs.\");\n    ibv_free_device_list(ibv_get_device_list(&r));\n    return r;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include \"opencv2\/highgui\/highgui.hpp\"\n#include \"opencv2\/imgproc\/imgproc.hpp\"\n#include \"ros\/ros.h\"\n#include \"std_msgs\/Float64.h\"\n#include <fstream>\n\nusing namespace cv;\nusing namespace std;\n\nMat img,imgHSV,imgThresholded,imgSmooth,imgCanny,imgLines;\nint lineCount=0;\n\n\/\/parameters in param file should be nearly the same as the commented values\n\/\/params for an orange strip\nint LowH ; \/\/0\nint HighH ; \/\/88\n\nint LowS ; \/\/0 \nint HighS ; \/\/251\n\nint LowV ; \/\/0\nint HighV ; \/\/255\n\n\/\/params for smoothing image\nint ksize; \/\/21\nint stype; \/\/4  -> decides which type of filter has to be used \n\n\/\/params for bilateral filter in smoothcallback\nint sigmaColor; \/\/150\nint sigmaSpace; \/\/10\n\n\/\/params for hough line transform\nint lineThresh; \/\/60\nint minLineLength; \/\/70\nint maxLineGap; \/\/10\nint houghThresh; \/\/15\n\ndouble rho=0.1;\ndouble finalAngle;\ndouble minDeviation=0.02;\n\nbool vidCheck=false;\n\nvoid StretchContrast()\n{\n\tMat ch[3];\n\tsplit(img,ch);\n\tnormalize(ch[1],ch[1],255,0,NORM_MINMAX);\n\tnormalize(ch[2],ch[2],255,0,NORM_MINMAX);\n\tnormalize(ch[0],ch[0],255,0,NORM_MINMAX);\n\tmerge(ch,3,img);\n}\n\n\/\/called when large no of line detected\n\ndouble computeMean(vector<double>& newAngles){\n\tdouble sum=0;\n\tfor( size_t i = 0; i < newAngles.size(); i++ ){\n    \tsum=sum+newAngles[i];    \t\t\n    }\n    return sum\/newAngles.size();\n}\n\/\/called when few lines are detected \n\/\/to remove errors due to any stray results\ndouble computeMode(vector<double>& newAngles){\n\tdouble mode=newAngles[0];\n\tint freq=1;\n\tint tempFreq;\n\tdouble diff;\n\tfor(int i=0;i<newAngles.size();i++){\n\t\ttempFreq=1;\n\n\t\tfor(int j=i+1;j<newAngles.size();j++){\n\t\t\tdiff=newAngles[j]-newAngles[i]>0.0? newAngles[j]-newAngles[i]:newAngles[i]-newAngles[j];\n\t\t\tif(diff<=minDeviation){\n\t\t\t\ttempFreq++;\n\t\t\t\tnewAngles.erase(newAngles.begin()+j);\n\t\t\t\tj=j-1;\n\t\t\t}\n\t\t}\n\n\t\tif(tempFreq>=freq){\n\t\t\tmode=newAngles[i];\n\t\t\tfreq=tempFreq;\n\t\t}\n\t}\n\n\treturn mode;\n}\n\n\/\/callback for smoothing image\n\/\/contains different filters \"stype\" decides which filter to use\nvoid SmoothCallback(int ,void *){\n\tif(ksize%2==0) ksize=ksize+1;     \/\/kernel size can not be even\n\tswitch(stype){\n\t\tcase 1:\n\t\t\tblur( img, imgSmooth, Size( ksize, ksize ) ); \/\/ksize=17 \n\t\t\tbreak;\n\t\tcase 2:\n\t\t\tGaussianBlur( img, imgSmooth, Size( ksize, ksize ), 0, 0 );\n\t\t\tbreak;\n\t\tcase 3:\n\t\t\tmedianBlur( img, imgSmooth, ksize );\n\t\t\tbreak;\n\t\tcase 4:\n\t\t\tbilateralFilter( img, imgSmooth, ksize, sigmaColor, sigmaSpace);\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tcout<<\"Please enter a smoothing type \"<<endl;\n\t}\n\n}\n\n\/\/contains canny edge detection and houghline transform\n\nvoid callback(int ,void *){\n\tcvtColor(imgSmooth, imgHSV, COLOR_BGR2HSV); \/\/Convert the captured frame from BGR to HSV\n\tinRange(imgHSV, Scalar(LowH, LowS, LowV), Scalar(HighH, HighS, HighV), imgThresholded); \/\/Threshold the image\n      \n\t\/\/opening (removes small objects from the foreground)\n\t\terode(imgThresholded, imgThresholded, getStructuringElement(MORPH_ELLIPSE, Size(5, 5)) );\n\t\tdilate( imgThresholded, imgThresholded, getStructuringElement(MORPH_ELLIPSE, Size(5, 5)) ); \n\n\t\/\/closing (removes small holes from the foreground)\n\t\tdilate( imgThresholded, imgThresholded, getStructuringElement(MORPH_ELLIPSE, Size(5, 5)) ); \n\t\terode(imgThresholded, imgThresholded, getStructuringElement(MORPH_ELLIPSE, Size(5, 5)) );\n\n\tCanny(imgThresholded,imgCanny,50,150,3,true);\/\/canny edge detection\n\n\tvector<Vec4i> lines;\n\n\tHoughLinesP(imgCanny, lines, 1, CV_PI\/180, lineThresh, minLineLength, maxLineGap );\t\n\n\timg.copyTo(imgLines);\n\timgLines=Scalar(0,0,0);\n\tvector<double> angles(lines.size());\n\n\tcout<<\"No of lines : \"<<lines.size()<<endl<<\"Angles(radian): \";\n\n\tfor( size_t i = 0; i < lines.size(); i++ )\n\t{\n  \t\tVec4i l = lines[i];\n  \t\tline( imgLines, Point(l[0], l[1]), Point(l[2], l[3]), Scalar(0,255,0), 1, CV_AA);\n  \t\tangles[i] = atan(double(l[2]-l[0])\/(l[1]-l[3]));\n  \t\tcout<<angles[i]<<\" \";\n\t}\n\tcout<<endl;\n\timshow(\"LINES\",imgLines+img);\n\n    \/\/if num of lines are large than one or two stray lines won't affect the mean much\n    \/\/but if they are small in number than mode has to be taken to save the error due to those stray line\n    \n    if(lines.size()>0 && lines.size()<10) finalAngle=computeMode(angles);\n\telse if(lines.size()>0) finalAngle=computeMean(angles);\n\n    cout<<\"Final Angle: \"<<finalAngle<<endl<<endl;\n}\n\n\n\nint main( int argc, char** argv ) {\n\tif(argc<2){\n\t\tcout<<\"please specify whether you want the display or not : \"<<endl<<\"USAGE: \"<<endl<< \"add argument 1 if you want the display, otherwise 0\"<<endl;\n\t\treturn 0;\n\t}\n\n\tif(*argv[1]=='1') vidCheck=true;\n \n\t\/\/enter the path which contains params.txt\n\tFILE* fp=fopen(\"src\/linefollowing\/src\/params.txt\",\"r\"); \n\tfscanf(fp,\"%d %d %d %d %d %d\\n%d %d %d %d\\n%d %d %d\\n%d\",&LowH,&HighH,&LowS,&HighS,&LowV,&HighV,&ksize,&stype,&sigmaSpace,&sigmaColor,&lineThresh,&minLineLength,&maxLineGap,&houghThresh);\n\tfclose(fp);\n\n    \/\/VideoCapture cap(1); \/\/capture the video from webcam\n    \/\/VideoCapture cap(\"src\/linefollowing\/src\/outputnorm.avi\"); \/\/path of the video for checking the code \n    \/\/VideoCapture cap(\"src\/linefollowing\/src\/TestingLine.mp4\"); \n    VideoCapture cap(\"src\/linefollowing\/src\/test1.avi\"); \n    \n\n    if ( !cap.isOpened() )  \/\/ if not success, exit program\n    {\n         cout << \"Cannot get the stream\" << endl;\n         return -1;\n    }\n\n    if (vidCheck) namedWindow(\"LINES\",CV_WINDOW_AUTOSIZE);\n\n    ros::init(argc, argv, \"LineOdroidROS\");\n\tros::NodeHandle node;\n \tros::Publisher tracker_pub1 = node.advertise<std_msgs::Float64>(\"lineAngle\", 1000);\n    bool bSuccess;\n    while(ros::ok()){\n\n    \tstd_msgs::Float64 msg;\n    \tmsg.data = -finalAngle*(180\/3.14);\n\n    \t\/\/cout<<lineCount<<endl;\n\n\t\ttracker_pub1.publish(msg);\n\n\t\tROS_INFO(\"%lf\", msg.data);\n\t\t\n\t\tros::spinOnce();\n\n    \tbSuccess = cap.read(img); \/\/ read a new frame from video\n\n        if (!bSuccess) \/\/if not success, break loop\n        {\n             cout << \"Cannot read a frame from video stream\" << endl;\n             break;\n        }\n\n        StretchContrast();\n\n        SmoothCallback(0,0); \/\/for assigning imgSmooth initially\n\t\tcallback(0,0); \/\/for displaying the thresholded image initially\t\t\n\n    \tchar key=cvWaitKey(30);\n\t\tif(key==27){\n\t\t\tbreak;\n\t\t}\n    }\n\n    destroyAllWindows();\n}\n<commit_msg>minor bug in LineOdroidROS.cpp<commit_after>#include <iostream>\n#include \"opencv2\/highgui\/highgui.hpp\"\n#include \"opencv2\/imgproc\/imgproc.hpp\"\n#include \"ros\/ros.h\"\n#include \"std_msgs\/Float64.h\"\n#include <fstream>\n\nusing namespace cv;\nusing namespace std;\n\nMat img,imgHSV,imgThresholded,imgSmooth,imgCanny,imgLines;\nint lineCount=0;\n\n\/\/parameters in param file should be nearly the same as the commented values\n\/\/params for an orange strip\nint LowH ; \/\/0\nint HighH ; \/\/88\n\nint LowS ; \/\/0 \nint HighS ; \/\/251\n\nint LowV ; \/\/0\nint HighV ; \/\/255\n\n\/\/params for smoothing image\nint ksize; \/\/21\nint stype; \/\/4  -> decides which type of filter has to be used \n\n\/\/params for bilateral filter in smoothcallback\nint sigmaColor; \/\/150\nint sigmaSpace; \/\/10\n\n\/\/params for hough line transform\nint lineThresh; \/\/60\nint minLineLength; \/\/70\nint maxLineGap; \/\/10\nint houghThresh; \/\/15\n\ndouble rho=0.1;\ndouble finalAngle;\ndouble minDeviation=0.02;\n\nbool vidCheck=false;\n\nvoid StretchContrast()\n{\n\tMat ch[3];\n\tsplit(img,ch);\n\tnormalize(ch[1],ch[1],255,0,NORM_MINMAX);\n\tnormalize(ch[2],ch[2],255,0,NORM_MINMAX);\n\tnormalize(ch[0],ch[0],255,0,NORM_MINMAX);\n\tmerge(ch,3,img);\n}\n\n\/\/called when large no of line detected\n\ndouble computeMean(vector<double>& newAngles){\n\tdouble sum=0;\n\tfor( size_t i = 0; i < newAngles.size(); i++ ){\n    \tsum=sum+newAngles[i];    \t\t\n    }\n    return sum\/newAngles.size();\n}\n\/\/called when few lines are detected \n\/\/to remove errors due to any stray results\ndouble computeMode(vector<double>& newAngles){\n\tdouble mode=newAngles[0];\n\tint freq=1;\n\tint tempFreq;\n\tdouble diff;\n\tfor(int i=0;i<newAngles.size();i++){\n\t\ttempFreq=1;\n\n\t\tfor(int j=i+1;j<newAngles.size();j++){\n\t\t\tdiff=newAngles[j]-newAngles[i]>0.0? newAngles[j]-newAngles[i]:newAngles[i]-newAngles[j];\n\t\t\tif(diff<=minDeviation){\n\t\t\t\ttempFreq++;\n\t\t\t\tnewAngles.erase(newAngles.begin()+j);\n\t\t\t\tj=j-1;\n\t\t\t}\n\t\t}\n\n\t\tif(tempFreq>=freq){\n\t\t\tmode=newAngles[i];\n\t\t\tfreq=tempFreq;\n\t\t}\n\t}\n\n\treturn mode;\n}\n\n\/\/callback for smoothing image\n\/\/contains different filters \"stype\" decides which filter to use\nvoid SmoothCallback(int ,void *){\n\tif(ksize%2==0) ksize=ksize+1;     \/\/kernel size can not be even\n\tswitch(stype){\n\t\tcase 1:\n\t\t\tblur( img, imgSmooth, Size( ksize, ksize ) ); \/\/ksize=17 \n\t\t\tbreak;\n\t\tcase 2:\n\t\t\tGaussianBlur( img, imgSmooth, Size( ksize, ksize ), 0, 0 );\n\t\t\tbreak;\n\t\tcase 3:\n\t\t\tmedianBlur( img, imgSmooth, ksize );\n\t\t\tbreak;\n\t\tcase 4:\n\t\t\tbilateralFilter( img, imgSmooth, ksize, sigmaColor, sigmaSpace);\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tcout<<\"Please enter a smoothing type \"<<endl;\n\t}\n\n}\n\n\/\/contains canny edge detection and houghline transform\n\nvoid callback(int ,void *){\n\tcvtColor(imgSmooth, imgHSV, COLOR_BGR2HSV); \/\/Convert the captured frame from BGR to HSV\n\tinRange(imgHSV, Scalar(LowH, LowS, LowV), Scalar(HighH, HighS, HighV), imgThresholded); \/\/Threshold the image\n      \n\t\/\/opening (removes small objects from the foreground)\n\t\terode(imgThresholded, imgThresholded, getStructuringElement(MORPH_ELLIPSE, Size(5, 5)) );\n\t\tdilate( imgThresholded, imgThresholded, getStructuringElement(MORPH_ELLIPSE, Size(5, 5)) ); \n\n\t\/\/closing (removes small holes from the foreground)\n\t\tdilate( imgThresholded, imgThresholded, getStructuringElement(MORPH_ELLIPSE, Size(5, 5)) ); \n\t\terode(imgThresholded, imgThresholded, getStructuringElement(MORPH_ELLIPSE, Size(5, 5)) );\n\n\tCanny(imgThresholded,imgCanny,50,150,3,true);\/\/canny edge detection\n\n\tvector<Vec4i> lines;\n\n\tHoughLinesP(imgCanny, lines, 1, CV_PI\/180, lineThresh, minLineLength, maxLineGap );\t\n\n\timg.copyTo(imgLines);\n\timgLines=Scalar(0,0,0);\n\tvector<double> angles(lines.size());\n\n\tcout<<\"No of lines : \"<<lines.size()<<endl<<\"Angles(radian): \";\n\n\tfor( size_t i = 0; i < lines.size(); i++ )\n\t{\n  \t\tVec4i l = lines[i];\n  \t\tline( imgLines, Point(l[0], l[1]), Point(l[2], l[3]), Scalar(0,255,0), 1, CV_AA);\n  \t\tangles[i] = atan(double(l[2]-l[0])\/(l[1]-l[3]));\n  \t\tcout<<angles[i]<<\" \";\n\t}\n\tcout<<endl;\n\timshow(\"LINES\",imgLines+img);\n\n    \/\/if num of lines are large than one or two stray lines won't affect the mean much\n    \/\/but if they are small in number than mode has to be taken to save the error due to those stray line\n    \n    if(lines.size()>0 && lines.size()<10) finalAngle=computeMode(angles);\n\telse if(lines.size()>0) finalAngle=computeMean(angles);\n\n    cout<<\"Final Angle: \"<<finalAngle<<endl<<endl;\n}\n\n\n\nint main( int argc, char** argv ) {\n\tif(argc<2){\n\t\tcout<<\"please specify whether you want the display or not : \"<<endl<<\"USAGE: \"<<endl<< \"add argument 1 if you want the display, otherwise 0\"<<endl;\n\t\treturn 0;\n\t}\n\n\tif(*argv[1]=='1') vidCheck=true;\n \n\t\/\/enter the path which contains params.txt\n\tFILE* fp=fopen(\"src\/linefollowing\/src\/params.txt\",\"r\"); \n\tfscanf(fp,\"%d %d %d %d %d %d\\n%d %d %d %d\\n%d %d %d\\n%d\",&LowH,&HighH,&LowS,&HighS,&LowV,&HighV,&ksize,&stype,&sigmaSpace,&sigmaColor,&lineThresh,&minLineLength,&maxLineGap,&houghThresh);\n\tfclose(fp);\n\n    \/\/VideoCapture cap(1); \/\/capture the video from webcam\n    \/\/VideoCapture cap(\"src\/linefollowing\/src\/outputnorm.avi\"); \/\/path of the video for checking the code \n    \/\/VideoCapture cap(\"src\/linefollowing\/src\/TestingLine.mp4\"); \n    VideoCapture cap(\"src\/linefollowing\/src\/test1.avi\"); \n    \n\n    if ( !cap.isOpened() )  \/\/ if not success, exit program\n    {\n         cout << \"Cannot get the stream\" << endl;\n         return -1;\n    }\n\n    if (vidCheck) namedWindow(\"LINES\",CV_WINDOW_AUTOSIZE);\n\n    ros::init(argc, argv, \"LineOdroidROS\");\n\tros::NodeHandle node;\n \tros::Publisher tracker_pub1 = node.advertise<std_msgs::Float64>(\"lineAngle\", 1000);\n    bool bSuccess;\n    while(ros::ok()){\n\n    \tstd_msgs::Float64 msg;\n\n    \t\/*\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\n\t\tmsg.data never takes positive 90 \n\t\twhen the angle is 90 it will show -90\n\t\t-------------TO BE CORRECTED-------------\n\n\t\t*\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \tmsg.data = -finalAngle*(180\/3.14);\n\n    \t\/\/cout<<lineCount<<endl;\n\n\t\ttracker_pub1.publish(msg);\n\n\t\tROS_INFO(\"%lf\", msg.data);\n\t\t\n\t\tros::spinOnce();\n\n    \tbSuccess = cap.read(img); \/\/ read a new frame from video\n\n        if (!bSuccess) \/\/if not success, break loop\n        {\n             cout << \"Cannot read a frame from video stream\" << endl;\n             break;\n        }\n\n        StretchContrast();\n\n        SmoothCallback(0,0); \/\/for assigning imgSmooth initially\n\t\tcallback(0,0); \/\/for displaying the thresholded image initially\t\t\n\n    \tchar key=cvWaitKey(30);\n\t\tif(key==27){\n\t\t\tbreak;\n\t\t}\n    }\n\n    destroyAllWindows();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <AST\/visitors\/IrtBuilderVisitor.h>\n\nusing namespace AstTree;\n\nIRTree::TOperatorType CIrtBuilderVisitor::operatorFromAstToIr( TOperatorType type ) const {\n    IRTree::TOperatorType typeResult;\n    switch ( type ) {\n        case TOperatorType::OT_Plus: typeResult = IRTree::TOperatorType::OT_Plus;\n        case TOperatorType::OT_Minus: typeResult = IRTree::TOperatorType::OT_Minus;\n        case TOperatorType::OT_Times: typeResult = IRTree::TOperatorType::OT_Times;\n        case TOperatorType::OT_Div: typeResult = IRTree::TOperatorType::OT_Div;\n        case TOperatorType::OT_Mod: typeResult = IRTree::TOperatorType::OT_Mod;\n        case TOperatorType::OT_And: typeResult = IRTree::TOperatorType::OT_And;\n        case TOperatorType::OT_Or: typeResult = IRTree::TOperatorType::OT_Or;\n        default: {\n            \/\/ such cases should never happen\n            assert( false ) ;\n        }\n    }\n    return typeResult;\n}\n\nvoid CIrtBuilderVisitor::updateSubtreeWrapper( const IRTree::ISubtreeWrapper* wrapperNew ) {\n    subtreeWrapper = std::unique_ptr<const IRTree::ISubtreeWrapper>( wrapperNew );\n}\n\n\/*__________ Access Modifiers __________*\/\n\nvoid CIrtBuilderVisitor::Visit( const CPublicAccessModifier* modifier ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::ACCESS_MOD_PUBLIC );\n    onNodeEnter( nodeName );\n\n    \/\/ such calls should never happen\n    assert( false );\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CPrivateAccessModifier* modifier ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::ACCESS_MOD_PRIVATE );\n    onNodeEnter( nodeName );\n\n    \/\/ such calls should never happen\n    assert( false );\n\n    onNodeExit( nodeName );\n}\n\n\/*__________ Expressions __________*\/\n\nvoid CIrtBuilderVisitor::Visit( const CBinaryExpression* expression ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::EXP_BINARY );\n    onNodeEnter( nodeName );\n\n    expression->LeftOperand()->Accept( this );\n    const IRTree::CExpression* expressionLeft = subtreeWrapper->ToExpression();\n\n    expression->RightOperand()->Accept( this );\n    const IRTree::CExpression* expressionRight = subtreeWrapper->ToExpression();\n\n    if ( expression->Operation() == TOperatorType::OT_LT ) {\n        updateSubtreeWrapper( new IRTree::CRelativeConditionalWrapper(\n            IRTree::TLogicOperatorType::LOT_LT,\n            expressionLeft,\n            expressionRight\n        ) );\n    } else {\n        IRTree::TOperatorType operatorType = operatorFromAstToIr( expression->Operation() );\n\n        updateSubtreeWrapper( new IRTree::CExpressionWrapper(\n            new IRTree::CBinaryExpression( operatorType, expressionLeft, expressionRight )\n        ) );\n    }\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CBracketExpression* expression ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::EXP_BRACKET );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CNumberExpression* expression ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::EXP_NUMBER );\n    onNodeEnter( nodeName );\n\n    updateSubtreeWrapper( new IRTree::CExpressionWrapper(\n        new IRTree::CConstExpression( expression->Value() )\n    ) );\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CLogicExpression* expression ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::EXP_LOGIC );\n    onNodeEnter( nodeName );\n\n    updateSubtreeWrapper( new IRTree::CExpressionWrapper(\n        new IRTree::CConstExpression( expression->Value() ? 1 : 0 )\n    ) );\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CIdExpression* expression ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::EXP_ID );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CLengthExpression* expression ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::EXP_LENGTH );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CMethodExpression* expression ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::EXP_METHOD );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CThisExpression* expression ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::EXP_THIS );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CNewArrayExpression* expression ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::EXP_NEW_ARRAY );\n    onNodeEnter( nodeName );\n\n    expression->LengthExpression->Accept( this );\n\n    const IRTree::CExpression* expressionLength = subtreeWrapper->ToExpression();\n\n    updateSubtreeWrapper( new IRTree::CExpressionWrapper(\n        frame.ExternalCall(\"initArray\", new IRTree::CExpressionList( expressionLength ) );\n    ) );\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CNewIdExpression* expression ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::EXP_NEW_ID );\n    onNodeEnter( nodeName );\n\n    const IRTree::CExpression* tempExpression = new IRTree::CTempExpression( CTemp() );\n\n    updateSubtreeWrapper( new IRTree::CExpressionWrapper(\n        new IRTree::CEseqExpression(\n            new IRTree::CMoveStatement(\n                tempExpression,\n                frame.ExternalCall(\"malloc\", new IRTree::CExpressionList( IRTree::CConstExpression( \/*TODO*\/0 ) ))\n            )\n        )\n    ) );\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CNegateExpression* expression ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::EXP_NEGATE );\n    onNodeEnter( nodeName );\n\n    expression->TargetExpression()->Accept( this );\n\n    updateSubtreeWrapper( new IRTree::CNegateConditionalWrapper(\n        subtreeWrapper\n    ) );\n\n    onNodeExit( nodeName );\n}\n\n\/*__________ Statements __________*\/\n\nvoid CIrtBuilderVisitor::Visit( const CAssignIdStatement* statement ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::STAT_ASSIGN_ID );\n    onNodeEnter( nodeName );\n\n    statement->LeftPart()->Accept( this );\n    std::unique_ptr<const IRTree::ISubtreeWrapper> wrapperLeftPart = subtreeWrapper;\n    statement->RightPart()->Accept( this );\n    std::unique_ptr<const IRTree::ISubtreeWrapper> wrapperRightPart = subtreeWrapper;\n\n    updateSubtreeWrapper( new IRTree::CStatementWrapper(\n        new CMoveStatement(\n            wrapperLeftPart.ToExpression(),\n            wrapperRightPart.ToExpression()\n        )\n    ) );\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CAssignIdWithIndexStatement* statement ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::STAT_ASSIGN_ID_WITH_INDEX );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CPrintStatement* statement ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::STAT_PRINT );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CConditionalStatement* statement ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::STAT_CONDITIONAL );\n    onNodeEnter( nodeName );\n\n    statement->Condition()->Accept( this );\n    std::unique_ptr<const IRTree::ISubtreeWrapper> wrapperCondition = subtreeWrapper;\n    statement->PositiveTarget()->Accept( this );\n    std::unique_ptr<const IRTree::ISubtreeWrapper> wrapperTargetPositive = subtreeWrapper;\n    statement->NegativeTarget()->Accept( this );\n    std::unique_ptr<const IRTree::ISubtreeWrapper> wrapperTargetNegative = subtreeWrapper;\n\n    IRTree::CLabel labelTrue;\n    IRTree::CLabel labelFalse;\n\n    const IRTree::CLabelStatement* labelStatementJoin = new IRTree::CLabelStatement( IRTree::CLabel() );\n\n    updateSubtreeWrapper( new IRTree::CStatementWrapper(\n        new IRTree::CSeqStatement(\n            wrapperCondition->ToCondition( labelTrue, labelFalse ),\n            new IRTree::CSeqStatement(\n                new IRTree::CLabelStatement( labelTrue ),\n                new IRTree::CSeqStatement(\n                    wrapperTargetPositive->ToStatement(),\n                    new IRTree::CSeqStatement(\n                        new IRTree::CJumpStatement( labelStatementJoin ),\n                        new IRTree::CSeqStatement(\n                            new IRTree::CLabelStatement( labelFalse ),\n                            new IRTree::CSeqStatement(\n                                wrapperTargetNegative->ToStatement(),\n                                labelStatementJoin\n                            )\n                        )\n                    )\n                )\n            )\n        )\n    ) );\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CWhileLoopStatement* statement ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::STAT_WHILE_LOOP );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CBracesStatement* statement ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::STAT_BRACES );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\n\/*__________ Type Modifiers __________*\/\n\nvoid CIrtBuilderVisitor::Visit( const CIntTypeModifier* typeModifier ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::TYPE_MOD_INT );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CBooleanTypeModifier* typeModifier ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::TYPE_MOD_BOOL );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CIntArrayTypeModifier* typeModifier ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::TYPE_MOD_INT_ARRAY );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CIdTypeModifier* typeModifier ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::TYPE_MOD_ID );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\n\/*__________ Other (except lists) __________*\/\n\nvoid CIrtBuilderVisitor::Visit( const CVarDeclaration* declaration ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::VAR_DECL );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CMethodArgument* argument ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::METH_ARG );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CMethodDeclaration* declaration ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::METH_DECL );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CMainClass* mainClass ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::MAIN_CLASS );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CClassDeclaration* declaration ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::CLASS_DECL );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CProgram* program ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::PROGRAM );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\n\/*__________  Lists __________*\/\n\nvoid CIrtBuilderVisitor::Visit( const CExpressionList* list ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::EXP_LIST );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CStatementList* list ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::STAT_LIST );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CVarDeclarationList* list ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::VAR_DECL_LIST );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CMethodArgumentList* list ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::METH_ARG_LIST );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CMethodDeclarationList* list ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::METH_DECL_LIST );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CClassDeclarationList* list ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::CLASS_DECL_LIST );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n<commit_msg>While loop translated<commit_after>#include <AST\/visitors\/IrtBuilderVisitor.h>\n\nusing namespace AstTree;\n\nIRTree::TOperatorType CIrtBuilderVisitor::operatorFromAstToIr( TOperatorType type ) const {\n    IRTree::TOperatorType typeResult;\n    switch ( type ) {\n        case TOperatorType::OT_Plus: typeResult = IRTree::TOperatorType::OT_Plus;\n        case TOperatorType::OT_Minus: typeResult = IRTree::TOperatorType::OT_Minus;\n        case TOperatorType::OT_Times: typeResult = IRTree::TOperatorType::OT_Times;\n        case TOperatorType::OT_Div: typeResult = IRTree::TOperatorType::OT_Div;\n        case TOperatorType::OT_Mod: typeResult = IRTree::TOperatorType::OT_Mod;\n        case TOperatorType::OT_And: typeResult = IRTree::TOperatorType::OT_And;\n        case TOperatorType::OT_Or: typeResult = IRTree::TOperatorType::OT_Or;\n        default: {\n            \/\/ such cases should never happen\n            assert( false ) ;\n        }\n    }\n    return typeResult;\n}\n\nvoid CIrtBuilderVisitor::updateSubtreeWrapper( const IRTree::ISubtreeWrapper* wrapperNew ) {\n    subtreeWrapper = std::unique_ptr<const IRTree::ISubtreeWrapper>( wrapperNew );\n}\n\n\/*__________ Access Modifiers __________*\/\n\nvoid CIrtBuilderVisitor::Visit( const CPublicAccessModifier* modifier ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::ACCESS_MOD_PUBLIC );\n    onNodeEnter( nodeName );\n\n    \/\/ such calls should never happen\n    assert( false );\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CPrivateAccessModifier* modifier ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::ACCESS_MOD_PRIVATE );\n    onNodeEnter( nodeName );\n\n    \/\/ such calls should never happen\n    assert( false );\n\n    onNodeExit( nodeName );\n}\n\n\/*__________ Expressions __________*\/\n\nvoid CIrtBuilderVisitor::Visit( const CBinaryExpression* expression ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::EXP_BINARY );\n    onNodeEnter( nodeName );\n\n    expression->LeftOperand()->Accept( this );\n    const IRTree::CExpression* expressionLeft = subtreeWrapper->ToExpression();\n\n    expression->RightOperand()->Accept( this );\n    const IRTree::CExpression* expressionRight = subtreeWrapper->ToExpression();\n\n    if ( expression->Operation() == TOperatorType::OT_LT ) {\n        updateSubtreeWrapper( new IRTree::CRelativeConditionalWrapper(\n            IRTree::TLogicOperatorType::LOT_LT,\n            expressionLeft,\n            expressionRight\n        ) );\n    } else {\n        IRTree::TOperatorType operatorType = operatorFromAstToIr( expression->Operation() );\n\n        updateSubtreeWrapper( new IRTree::CExpressionWrapper(\n            new IRTree::CBinaryExpression( operatorType, expressionLeft, expressionRight )\n        ) );\n    }\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CBracketExpression* expression ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::EXP_BRACKET );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CNumberExpression* expression ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::EXP_NUMBER );\n    onNodeEnter( nodeName );\n\n    updateSubtreeWrapper( new IRTree::CExpressionWrapper(\n        new IRTree::CConstExpression( expression->Value() )\n    ) );\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CLogicExpression* expression ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::EXP_LOGIC );\n    onNodeEnter( nodeName );\n\n    updateSubtreeWrapper( new IRTree::CExpressionWrapper(\n        new IRTree::CConstExpression( expression->Value() ? 1 : 0 )\n    ) );\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CIdExpression* expression ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::EXP_ID );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CLengthExpression* expression ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::EXP_LENGTH );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CMethodExpression* expression ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::EXP_METHOD );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CThisExpression* expression ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::EXP_THIS );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CNewArrayExpression* expression ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::EXP_NEW_ARRAY );\n    onNodeEnter( nodeName );\n\n    expression->LengthExpression->Accept( this );\n\n    const IRTree::CExpression* expressionLength = subtreeWrapper->ToExpression();\n\n    updateSubtreeWrapper( new IRTree::CExpressionWrapper(\n        frame.ExternalCall(\"initArray\", new IRTree::CExpressionList( expressionLength ) );\n    ) );\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CNewIdExpression* expression ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::EXP_NEW_ID );\n    onNodeEnter( nodeName );\n\n    const IRTree::CExpression* tempExpression = new IRTree::CTempExpression( CTemp() );\n\n    updateSubtreeWrapper( new IRTree::CExpressionWrapper(\n        new IRTree::CEseqExpression(\n            new IRTree::CMoveStatement(\n                tempExpression,\n                frame.ExternalCall(\"malloc\", new IRTree::CExpressionList( IRTree::CConstExpression( \/*TODO*\/0 ) ))\n            )\n        )\n    ) );\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CNegateExpression* expression ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::EXP_NEGATE );\n    onNodeEnter( nodeName );\n\n    expression->TargetExpression()->Accept( this );\n\n    updateSubtreeWrapper( new IRTree::CNegateConditionalWrapper(\n        subtreeWrapper\n    ) );\n\n    onNodeExit( nodeName );\n}\n\n\/*__________ Statements __________*\/\n\nvoid CIrtBuilderVisitor::Visit( const CAssignIdStatement* statement ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::STAT_ASSIGN_ID );\n    onNodeEnter( nodeName );\n\n    statement->LeftPart()->Accept( this );\n    std::unique_ptr<const IRTree::ISubtreeWrapper> wrapperLeftPart = subtreeWrapper;\n    statement->RightPart()->Accept( this );\n    std::unique_ptr<const IRTree::ISubtreeWrapper> wrapperRightPart = subtreeWrapper;\n\n    updateSubtreeWrapper( new IRTree::CStatementWrapper(\n        new CMoveStatement(\n            wrapperLeftPart.ToExpression(),\n            wrapperRightPart.ToExpression()\n        )\n    ) );\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CAssignIdWithIndexStatement* statement ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::STAT_ASSIGN_ID_WITH_INDEX );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CPrintStatement* statement ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::STAT_PRINT );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CConditionalStatement* statement ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::STAT_CONDITIONAL );\n    onNodeEnter( nodeName );\n\n    statement->Condition()->Accept( this );\n    std::unique_ptr<const IRTree::ISubtreeWrapper> wrapperCondition = subtreeWrapper;\n    statement->PositiveTarget()->Accept( this );\n    std::unique_ptr<const IRTree::ISubtreeWrapper> wrapperTargetPositive = subtreeWrapper;\n    statement->NegativeTarget()->Accept( this );\n    std::unique_ptr<const IRTree::ISubtreeWrapper> wrapperTargetNegative = subtreeWrapper;\n\n    IRTree::CLabel labelTrue;\n    IRTree::CLabel labelFalse;\n    IRTree::CLabel labelJoin;\n\n    updateSubtreeWrapper( new IRTree::CStatementWrapper(\n        new IRTree::CSeqStatement(\n            wrapperCondition->ToCondition( labelTrue, labelFalse ),\n            new IRTree::CSeqStatement(\n                new IRTree::CLabelStatement( labelTrue ),\n                new IRTree::CSeqStatement(\n                    wrapperTargetPositive->ToStatement(),\n                    new IRTree::CSeqStatement(\n                        new IRTree::CJumpStatement( labelJoin ),\n                        new IRTree::CSeqStatement(\n                            new IRTree::CLabelStatement( labelFalse ),\n                            new IRTree::CSeqStatement(\n                                wrapperTargetNegative->ToStatement(),\n                                new IRTree::CLabelStatement( IRTree::CLabel() )\n                            )\n                        )\n                    )\n                )\n            )\n        )\n    ) );\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CWhileLoopStatement* statement ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::STAT_WHILE_LOOP );\n    onNodeEnter( nodeName );\n\n    statement->Condition()->Accept( this );\n    std::unique_ptr<const IRTree::ISubtreeWrapper> wrapperCondition = subtreeWrapper;\n    statement->Body()->Accept( this );\n    std::unique_ptr<const IRTree::ISubtreeWrapper> wrapperBody = subtreeWrapper;\n\n    IRTree::CLabel labelLoop;\n    IRTree::CLabel labelBody;\n    IRTree::CLabel labelDone;\n\n    updateSubtreeWrapper( new IRTree::CStatementWrapper(\n        new IRTree::CSeqStatement(\n            new IRTree::CLabelStatement( labelLoop ),\n            new IRTree::CSeqStatement(\n                wrapperCondition->ToCondition( labelBody, labelDone ),\n                new IRTree::CSeqStatement(\n                    new IRTree::CLabelStatement( labelBody ),\n                    new IRTree::CSeqStatement(\n                        wrapperBody->ToStatement(),\n                        new IRTree::CSeqStatement(\n                            new IRTree::CJumpStatement( labelLoop ),\n                            new IRTree::CLabelStatement( labelDone )\n                        )\n                    )\n                )\n            )\n        )\n    ) );\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CBracesStatement* statement ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::STAT_BRACES );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\n\/*__________ Type Modifiers __________*\/\n\nvoid CIrtBuilderVisitor::Visit( const CIntTypeModifier* typeModifier ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::TYPE_MOD_INT );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CBooleanTypeModifier* typeModifier ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::TYPE_MOD_BOOL );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CIntArrayTypeModifier* typeModifier ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::TYPE_MOD_INT_ARRAY );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CIdTypeModifier* typeModifier ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::TYPE_MOD_ID );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\n\/*__________ Other (except lists) __________*\/\n\nvoid CIrtBuilderVisitor::Visit( const CVarDeclaration* declaration ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::VAR_DECL );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CMethodArgument* argument ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::METH_ARG );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CMethodDeclaration* declaration ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::METH_DECL );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CMainClass* mainClass ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::MAIN_CLASS );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CClassDeclaration* declaration ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::CLASS_DECL );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CProgram* program ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::PROGRAM );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\n\/*__________  Lists __________*\/\n\nvoid CIrtBuilderVisitor::Visit( const CExpressionList* list ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::EXP_LIST );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CStatementList* list ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::STAT_LIST );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CVarDeclarationList* list ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::VAR_DECL_LIST );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CMethodArgumentList* list ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::METH_ARG_LIST );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CMethodDeclarationList* list ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::METH_DECL_LIST );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\n}\n\nvoid CIrtBuilderVisitor::Visit( const CClassDeclarationList* list ) {\n    std::string nodeName = generateNodeName( CAstNodeNames::CLASS_DECL_LIST );\n    onNodeEnter( nodeName );\n\n    \/\/ write your code here\n\n    onNodeExit( nodeName );\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 \"otbWrapperChoiceParameter.h\"\n#include \"otbWrapperListViewParameter.h\"\n#include \"otbWrapperBoolParameter.h\"\n#include \"otbWrapperApplicationRegistry.h\"\n\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);\n  \n  assert(!appli.IsNull());\n\n  const std::string group = appli->GetDocTags().size() > 0 ? appli->GetDocTags()[0] : \"\";\n  assert(!group.empty());\n\n  std::map<ParameterType, std::string> parameterTypeToString;\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  parameterTypeToString[ParameterType_ComplexInputImage] = \"QgsProcessingParameterRasterLayer\";\n  parameterTypeToString[ParameterType_ComplexOutputImage] = \"QgsProcessingParameterRasterDestination\";\n  \/\/ TODO\n  parameterTypeToString[ParameterType_StringList] = \"QgsProcessingParameterString\";\n  \/\/ ListView parameters are treated as plain string (QLineEdit) in qgis processing ui.\n  \/\/ This seems rather unpleasant when comparing Qgis processing with Monteverdi\/Mapla in OTB\n  \/\/ We tried to push something simple with checkboxes but its too risky for this version\n  \/\/ and clock is ticking...\n\n  parameterTypeToString[ParameterType_ListView] = \"QgsProcessingParameterString\";\n\n  \/\/ For next update of plugin code ListView should use a custom widget wrapper and behave\n  \/\/ exactly like OTB Mapla. And this #if 0 block is our TODO remainder.\n  #if 0\n  parameterTypeToString[ParameterType_ListView] = \"OTBParameterListView\";\n  #endif\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    {\n    output_file = std::string(argv[3]) + module + \".txt\";\n    algs_txt = std::string(argv[3])  +  \"algs.txt\";\n    }\n  std::ofstream dFile;\n  dFile.open (output_file, std::ios::out);\n\n  std::string output_parameter_name;\n  bool hasRasterOutput = false;\n  {\n  for (unsigned int i = 0; i < nbOfParam; i++)\n    {\n    Parameter::Pointer param = appli->GetParameterByKey(appKeyList[i]);\n    if (param->GetMandatory())\n      {\n\tif (appli->GetParameterType(appKeyList[i]) == ParameterType_OutputImage)\n\t  {\n\t    output_parameter_name = appKeyList[i];\n\t    hasRasterOutput = true;\n\t  }\n      }\n    }\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  dFile << group << std::endl;\n  \n  for (unsigned int i = 0; i < nbOfParam; i++)\n    {\n    const std::string name = appKeyList[i];\n    const Parameter::Pointer param = appli->GetParameterByKey(name);\n    const ParameterType type = appli->GetParameterType(name);\n    const std::string description = appli->GetParameterName(name);\n    if (  type == ParameterType_Group  ||\n          type == ParameterType_OutputProcessXML  ||\n          type == ParameterType_InputProcessXML  ||\n          type == ParameterType_RAM ||\n          param->GetRole() == Role_Output )\n      {\n      \/\/ group parameter cannot have any value.\n      \/\/ outxml and inxml parameters are not relevant for QGIS and is considered a bit noisy\n      \/\/ ram is added by qgis-otb processing provider plugin as an advanced parameter for all apps\n      \/\/ parameter role cannot be of type Role_Output\n      continue;\n      }\n    auto it = parameterTypeToString.find(type);\n    assert(  it != parameterTypeToString.end() );\n    if( it == parameterTypeToString.end() )\n      {\n      std::cerr << \"No mapping found for parameter '\" <<name <<\"' type=\" << type << std::endl;\n      return EXIT_FAILURE;\n      }\n    std::string qgis_type = it->second;\n#if 0\n      if (type == ParameterType_ListView)\n\t{\n\t  ListViewParameter *lv_param = dynamic_cast<ListViewParameter*>(param.GetPointer());\n\t  std::cerr << \"lv_param->GetSingleSelection()\" << lv_param->GetSingleSelection() << std::endl;\n\t  if (lv_param->GetSingleSelection())\n\t    {\n\n\t      qgis_type = \"QgsProcessingParameterEnum\";\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\tvalues += k + \";\";\n\t      values.pop_back();\n\t      dFile << \"|\" << values ;\n\t    }\n\t}\n#endif\n\n    bool isDestination = false;\n    bool isEpsgCode = false;\n\n    \/\/ use QgsProcessingParameterCrs if required.\n    \/\/ TODO: do a regex on name to match ==epsg || *\\.epsg.\\*\n    if ( name == \"epsg\"\n\t      || name == \"map.epsg.code\"\n\t      || name == \"mapproj.epsg.code\"\n\t      || name == \"mode.epsg.code\")\n        {\n        qgis_type = \"QgsProcessingParameterCrs\";\n        isEpsgCode = true;\n        }\n\n    dFile << qgis_type << \"|\" << name << \"|\" << description;\n\n      std::string default_value = \"None\";\n    if (type == ParameterType_Int)\n      {\n      if (isEpsgCode)\n        {\n          if (param->HasValue() && appli->GetParameterInt(name) < 1)\n    \tdefault_value =  \"EPSG: \" + appli->GetParameterAsString(name);\n          else\n    \tdefault_value =  \"ProjectCrs\";\n        }\n      else\n        {\n        dFile << \"|QgsProcessingParameterNumber.Integer\";\n        default_value = param->HasValue() ? appli->GetParameterAsString(name): \"0\";\n        }\n      }\n    else if (type == ParameterType_Float)\n      {\t\n      dFile << \"|QgsProcessingParameterNumber.Double\";\n      default_value = param->HasValue() ? appli->GetParameterAsString(name): \"0\";\n      }\n    else if (type == ParameterType_Radius)\n      {\t\n      dFile << \"|QgsProcessingParameterNumber.Integer\";\n      default_value = param->HasValue() ? appli->GetParameterAsString(name): \"0\";\n      }\n    else if(type == ParameterType_InputFilename)\n      {\n      \/\/ TODO: if parameter InputFilename can give supported extensions\n      \/\/ we can use it gitlab #1559\n      dFile << \"|QgsProcessingParameterFile.File|None\";\n      }\n    else if(type == ParameterType_Directory)\n      {\n      dFile << \"|QgsProcessingParameterFile.Folder|False\";\n      }      \n    else if (type == ParameterType_InputImageList)\n      {\n      dFile << \"|3\"; \/\/QgsProcessing.TypeRaster\n      }\n    else if (type == ParameterType_InputVectorDataList)\n      {\n      dFile << \"|-1\"; \/\/QgsProcessing.TypeVectorAnyGeometry\n      }\n    else if (type == ParameterType_InputVectorData)\n      {\n      dFile << \"|-1\"; \/\/QgsProcessing.TypeVectorAnyGeometry\n      }\n    else if(type == ParameterType_InputFilenameList)\n      {\n      dFile << \"|4\"; \/\/QgsProcessing.TypeFile\"\n      }\n    else if(type == ParameterType_String)\n      {\n      \/\/ Below line is interpreted in qgis processing as\n      \/\/ 1. default_value = None\n      \/\/ 2. multiLine = False\n      \/\/ For more details,\n      \/\/ please refer to documetation of QgsProcessingParameterString.\n      default_value = \"None|False\";\n      }\n    else if(type == ParameterType_StringList)\n      {\n      \/\/ Below line is interpreted in qgis processing as\n      \/\/ 1. default_value = None\n      \/\/ 2. multiLine = True\n      \/\/ For more details,\n      \/\/ please refer to documetation of QgsProcessingParameterString.\n      \/\/ setting default_value this way is an exception for ParameterType_StringList and ParameterType_String\n      default_value = \"None|True\";\n      }\n    else if (type == ParameterType_InputImage ||\n             type == ParameterType_ComplexInputImage)\n      {\n      \/\/ default is None and nothing to add to dFile\n      }\n    else if(type == ParameterType_ListView)\n      {\n      \/\/ default is None and nothing to add to dFile\n      }\n    else if(type == ParameterType_Bool)\n      {\n      default_value = appli->GetParameterAsString(name);\n      }\n    else if(type == ParameterType_Choice)\n      {\n      std::vector<std::string>  key_list  = appli->GetChoiceKeys(name);\n      std::string values = \"\";\n      for( auto k : key_list)\n        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      }\n    else if(type == ParameterType_OutputVectorData ||\n\t          type == ParameterType_OutputImage ||\n\t          type == ParameterType_OutputFilename ||\n\t          type == ParameterType_ComplexOutputImage)\n      {\n      \/\/ No need for default_value, optional and extra fields in dFile.\n      \/\/ If parameter is a destination type. qgis_type|name|description is enough.\n      \/\/ So we simply set isDestination to true and skip to end to append a new line.\n      isDestination =  true;\n      }\n    else\n      {\n      std::cout << \"ERROR: default_value is empty for '\" << name << \"' type='\" << qgis_type << \"'\" << std::endl;\n      return EXIT_FAILURE;\t  \n      }\n\n    if (!isDestination)\n      {\n      std::string optional;\n      if (param->GetMandatory())\n        {\n        \/\/ TODO: avoid workaround for stringlist types (fix appengine)\n        \/\/ type == ParameterType_StringList check is needed because:\n        \/\/ If parameter is mandatory it can have no value\n        \/\/ It is accepted in OTB that, string list could be generated dynamically\n        \/\/ qgis has no such option to handle dynamic values yet..\n        \/\/ So mandatory parameters whose type is StringList is considered optional\n        optional = param->HasValue() || type == ParameterType_StringList  ? \"True\" : \"False\";\n        }\n      else\n        {\n        optional = \"True\";\n        }\n              #if 0\n    \t  std::cerr << name;\n    \t  std::cerr << \" mandatory=\" << param->GetMandatory();\n    \t  std::cerr << \" HasValue=\" << param->HasValue();\n    \t  std::cerr << \" qgis_type=\" << qgis_type;\n    \t  std::cerr << \" optional=\" << optional << std::endl;\n              #endif\n    \tdFile << \"|\" << default_value << \"|\" << optional;\n      }\n    dFile << std::endl;\n    }\n\n  if(hasRasterOutput)\n    {\n    dFile << \"*QgsProcessingParameterEnum|outputpixeltype|Output pixel type|uint8;int;float;double|False|2|True\" << std::endl;\n    }\n\n  std::cerr << \"Writing \" << output_file << std::endl;\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  std::cerr << \"Updated \" << algs_txt << std::endl;\n\n  appli = nullptr;\n  ApplicationRegistry::CleanRegistry();\n\n  return EXIT_SUCCESS;\n  }\n\n\n<commit_msg>ENH: remove complex image parameter from qgis descriptor<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 \"otbWrapperChoiceParameter.h\"\n#include \"otbWrapperListViewParameter.h\"\n#include \"otbWrapperBoolParameter.h\"\n#include \"otbWrapperApplicationRegistry.h\"\n\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);\n  \n  assert(!appli.IsNull());\n\n  const std::string group = appli->GetDocTags().size() > 0 ? appli->GetDocTags()[0] : \"\";\n  assert(!group.empty());\n\n  std::map<ParameterType, std::string> parameterTypeToString;\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  \/\/ ListView parameters are treated as plain string (QLineEdit) in qgis processing ui.\n  \/\/ This seems rather unpleasant when comparing Qgis processing with Monteverdi\/Mapla in OTB\n  \/\/ We tried to push something simple with checkboxes but its too risky for this version\n  \/\/ and clock is ticking...\n\n  parameterTypeToString[ParameterType_ListView] = \"QgsProcessingParameterString\";\n\n  \/\/ For next update of plugin code ListView should use a custom widget wrapper and behave\n  \/\/ exactly like OTB Mapla. And this #if 0 block is our TODO remainder.\n  #if 0\n  parameterTypeToString[ParameterType_ListView] = \"OTBParameterListView\";\n  #endif\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    {\n    output_file = std::string(argv[3]) + module + \".txt\";\n    algs_txt = std::string(argv[3])  +  \"algs.txt\";\n    }\n  std::ofstream dFile;\n  dFile.open (output_file, std::ios::out);\n\n  std::string output_parameter_name;\n  bool hasRasterOutput = false;\n  {\n  for (unsigned int i = 0; i < nbOfParam; i++)\n    {\n    Parameter::Pointer param = appli->GetParameterByKey(appKeyList[i]);\n    if (param->GetMandatory())\n      {\n\tif (appli->GetParameterType(appKeyList[i]) == ParameterType_OutputImage)\n\t  {\n\t    output_parameter_name = appKeyList[i];\n\t    hasRasterOutput = true;\n\t  }\n      }\n    }\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  dFile << group << std::endl;\n  \n  for (unsigned int i = 0; i < nbOfParam; i++)\n    {\n    const std::string name = appKeyList[i];\n    const Parameter::Pointer param = appli->GetParameterByKey(name);\n    const ParameterType type = appli->GetParameterType(name);\n    const std::string description = appli->GetParameterName(name);\n    if (  type == ParameterType_Group  ||\n          type == ParameterType_OutputProcessXML  ||\n          type == ParameterType_InputProcessXML  ||\n          type == ParameterType_RAM ||\n          param->GetRole() == Role_Output )\n      {\n      \/\/ group parameter cannot have any value.\n      \/\/ outxml and inxml parameters are not relevant for QGIS and is considered a bit noisy\n      \/\/ ram is added by qgis-otb processing provider plugin as an advanced parameter for all apps\n      \/\/ parameter role cannot be of type Role_Output\n      continue;\n      }\n    auto it = parameterTypeToString.find(type);\n    assert(  it != parameterTypeToString.end() );\n    if( it == parameterTypeToString.end() )\n      {\n      std::cerr << \"No mapping found for parameter '\" <<name <<\"' type=\" << type << std::endl;\n      return EXIT_FAILURE;\n      }\n    std::string qgis_type = it->second;\n#if 0\n      if (type == ParameterType_ListView)\n\t{\n\t  ListViewParameter *lv_param = dynamic_cast<ListViewParameter*>(param.GetPointer());\n\t  std::cerr << \"lv_param->GetSingleSelection()\" << lv_param->GetSingleSelection() << std::endl;\n\t  if (lv_param->GetSingleSelection())\n\t    {\n\n\t      qgis_type = \"QgsProcessingParameterEnum\";\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\tvalues += k + \";\";\n\t      values.pop_back();\n\t      dFile << \"|\" << values ;\n\t    }\n\t}\n#endif\n\n    bool isDestination = false;\n    bool isEpsgCode = false;\n\n    \/\/ use QgsProcessingParameterCrs if required.\n    \/\/ TODO: do a regex on name to match ==epsg || *\\.epsg.\\*\n    if ( name == \"epsg\"\n\t      || name == \"map.epsg.code\"\n\t      || name == \"mapproj.epsg.code\"\n\t      || name == \"mode.epsg.code\")\n        {\n        qgis_type = \"QgsProcessingParameterCrs\";\n        isEpsgCode = true;\n        }\n\n    dFile << qgis_type << \"|\" << name << \"|\" << description;\n\n      std::string default_value = \"None\";\n    if (type == ParameterType_Int)\n      {\n      if (isEpsgCode)\n        {\n          if (param->HasValue() && appli->GetParameterInt(name) < 1)\n    \tdefault_value =  \"EPSG: \" + appli->GetParameterAsString(name);\n          else\n    \tdefault_value =  \"ProjectCrs\";\n        }\n      else\n        {\n        dFile << \"|QgsProcessingParameterNumber.Integer\";\n        default_value = param->HasValue() ? appli->GetParameterAsString(name): \"0\";\n        }\n      }\n    else if (type == ParameterType_Float)\n      {\t\n      dFile << \"|QgsProcessingParameterNumber.Double\";\n      default_value = param->HasValue() ? appli->GetParameterAsString(name): \"0\";\n      }\n    else if (type == ParameterType_Radius)\n      {\t\n      dFile << \"|QgsProcessingParameterNumber.Integer\";\n      default_value = param->HasValue() ? appli->GetParameterAsString(name): \"0\";\n      }\n    else if(type == ParameterType_InputFilename)\n      {\n      \/\/ TODO: if parameter InputFilename can give supported extensions\n      \/\/ we can use it gitlab #1559\n      dFile << \"|QgsProcessingParameterFile.File|None\";\n      }\n    else if(type == ParameterType_Directory)\n      {\n      dFile << \"|QgsProcessingParameterFile.Folder|False\";\n      }      \n    else if (type == ParameterType_InputImageList)\n      {\n      dFile << \"|3\"; \/\/QgsProcessing.TypeRaster\n      }\n    else if (type == ParameterType_InputVectorDataList)\n      {\n      dFile << \"|-1\"; \/\/QgsProcessing.TypeVectorAnyGeometry\n      }\n    else if (type == ParameterType_InputVectorData)\n      {\n      dFile << \"|-1\"; \/\/QgsProcessing.TypeVectorAnyGeometry\n      }\n    else if(type == ParameterType_InputFilenameList)\n      {\n      dFile << \"|4\"; \/\/QgsProcessing.TypeFile\"\n      }\n    else if(type == ParameterType_String)\n      {\n      \/\/ Below line is interpreted in qgis processing as\n      \/\/ 1. default_value = None\n      \/\/ 2. multiLine = False\n      \/\/ For more details,\n      \/\/ please refer to documetation of QgsProcessingParameterString.\n      default_value = \"None|False\";\n      }\n    else if(type == ParameterType_StringList)\n      {\n      \/\/ Below line is interpreted in qgis processing as\n      \/\/ 1. default_value = None\n      \/\/ 2. multiLine = True\n      \/\/ For more details,\n      \/\/ please refer to documetation of QgsProcessingParameterString.\n      \/\/ setting default_value this way is an exception for ParameterType_StringList and ParameterType_String\n      default_value = \"None|True\";\n      }\n    else if (type == ParameterType_InputImage)\n      {\n      \/\/ default is None and nothing to add to dFile\n      }\n    else if(type == ParameterType_ListView)\n      {\n      \/\/ default is None and nothing to add to dFile\n      }\n    else if(type == ParameterType_Bool)\n      {\n      default_value = appli->GetParameterAsString(name);\n      }\n    else if(type == ParameterType_Choice)\n      {\n      std::vector<std::string>  key_list  = appli->GetChoiceKeys(name);\n      std::string values = \"\";\n      for( auto k : key_list)\n        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      }\n    else if(type == ParameterType_OutputVectorData ||\n\t          type == ParameterType_OutputImage ||\n\t          type == ParameterType_OutputFilename)\n      {\n      \/\/ No need for default_value, optional and extra fields in dFile.\n      \/\/ If parameter is a destination type. qgis_type|name|description is enough.\n      \/\/ So we simply set isDestination to true and skip to end to append a new line.\n      isDestination =  true;\n      }\n    else\n      {\n      std::cout << \"ERROR: default_value is empty for '\" << name << \"' type='\" << qgis_type << \"'\" << std::endl;\n      return EXIT_FAILURE;\t  \n      }\n\n    if (!isDestination)\n      {\n      std::string optional;\n      if (param->GetMandatory())\n        {\n        \/\/ TODO: avoid workaround for stringlist types (fix appengine)\n        \/\/ type == ParameterType_StringList check is needed because:\n        \/\/ If parameter is mandatory it can have no value\n        \/\/ It is accepted in OTB that, string list could be generated dynamically\n        \/\/ qgis has no such option to handle dynamic values yet..\n        \/\/ So mandatory parameters whose type is StringList is considered optional\n        optional = param->HasValue() || type == ParameterType_StringList  ? \"True\" : \"False\";\n        }\n      else\n        {\n        optional = \"True\";\n        }\n              #if 0\n    \t  std::cerr << name;\n    \t  std::cerr << \" mandatory=\" << param->GetMandatory();\n    \t  std::cerr << \" HasValue=\" << param->HasValue();\n    \t  std::cerr << \" qgis_type=\" << qgis_type;\n    \t  std::cerr << \" optional=\" << optional << std::endl;\n              #endif\n    \tdFile << \"|\" << default_value << \"|\" << optional;\n      }\n    dFile << std::endl;\n    }\n\n  if(hasRasterOutput)\n    {\n    dFile << \"*QgsProcessingParameterEnum|outputpixeltype|Output pixel type|uint8;int;float;double|False|2|True\" << std::endl;\n    }\n\n  std::cerr << \"Writing \" << output_file << std::endl;\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  std::cerr << \"Updated \" << algs_txt << std::endl;\n\n  appli = nullptr;\n  ApplicationRegistry::CleanRegistry();\n\n  return EXIT_SUCCESS;\n  }\n\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>RooAbsCollection: silence compiler warning by limiting object lifetime<commit_after><|endoftext|>"}
{"text":"<commit_before>{\n  \/\/load libraries\n  gROOT->Macro(\"initGlauberMC.C\");\n\n  \/\/run the example code:\n  \/\/AliGlauberMC::runAndSaveNucleons(10000,\"Pb\",\"Pb\",72);\n  AliGlauberMC::runAndSaveNtuple(10000,\"Pb\",\"Pb\",72);\n}\n<commit_msg>document a few settings<commit_after>{\n  \/\/load libraries\n  gROOT->Macro(\"initGlauberMC.C\");\n\n  Int_t nevents = 10000; \/\/ number of events to simulate \n  \/\/ supported systems are e.g. \"p\", \"d\", \"Si\", \"Au\", \"Pb\", \"U\" \n  Option_t *sysA=\"Pb\"; \n  Option_t *sysB=\"Pb\";\n  Double_t signn=72; \/\/ inelastic nucleon nucleon cross section\n  const char *fname=\"GlauberMC_PbPb_ntuple.root\"; \/\/ name output file\n\n  \/\/ run the code to produce an ntuple:\n  \/\/  AliGlauberMC::runAndSaveNucleons(10000,\"Pb\",\"Pb\",72);\n  Double_t mind=0.4;\n  AliGlauberMC::runAndSaveNtuple(nevents,sysA,sysB,signn,mind,fname);\n\n}\n<|endoftext|>"}
{"text":"<commit_before>AliAnalysisVertexingHF* ConfigVertexingHF() {\n\n  printf(\"Call to AliAnalysisVertexingHF parameters setting :\\n\");\n  vHF = new AliAnalysisVertexingHF();\n \n  \/\/--- switch-off candidates finding (default: all on)\n  \/\/vHF->SetD0toKpiOff();\n  \/\/vHF->SetJPSItoEleOff();\n  \/\/vHF->Set3ProngOff();\n  vHF->SetLikeSignOff(); \/\/ like-sign pairs and triplets\n  \/\/vHF->Set4ProngOff();\n  \/\/vHF->SetDstarOff();\n  vHF->SetFindVertexForDstar(kFALSE);\n  \/\/--- secondary vertex with KF?\n  \/\/vHF->SetSecVtxWithKF();\n  \/\/  vHF->SetCascadesOff();\n  vHF->SetFindVertexForCascades(kFALSE);\n\n  \/\/--- set cuts for single-track selection  \n  \/\/     displaced tracks\n  AliESDtrackCuts *esdTrackCuts = new AliESDtrackCuts(\"AliESDtrackCuts\",\"default\");\n  esdTrackCuts->SetRequireTPCRefit(kTRUE);\n  esdTrackCuts->SetMinNClustersTPC(70);\n  esdTrackCuts->SetRequireITSRefit(kTRUE);\n  \/\/esdTrackCuts->SetMinNClustersITS(4);\n  esdTrackCuts->SetClusterRequirementITS(AliESDtrackCuts::kSPD,\n\t\t\t\t\t AliESDtrackCuts::kAny);\n  esdTrackCuts->SetMinDCAToVertexXY(0.);\n  esdTrackCuts->SetPtRange(0.3,1.e10);\n  esdTrackCuts->SetEtaRange(-0.8,+0.8);\n  AliAnalysisFilter *trkFilter = new AliAnalysisFilter(\"trackFilter\");\n  trkFilter->AddCuts(esdTrackCuts);\n  vHF->SetTrackFilter(trkFilter);\n  \/\/     D* soft pion tracks\n  AliESDtrackCuts *esdTrackCutsSoftPi = new AliESDtrackCuts(\"AliESDtrackCuts\",\"default\");\n  esdTrackCutsSoftPi->SetMinNClustersITS(2);\n  esdTrackCutsSoftPi->SetEtaRange(-0.8,+0.8);\n  AliAnalysisFilter *trkFilterSoftPi = new AliAnalysisFilter(\"trackFilterSoftPi\");\n  trkFilterSoftPi->AddCuts(esdTrackCutsSoftPi);\n  vHF->SetTrackFilterSoftPi(trkFilterSoftPi);\n  \/\/--- set cuts for candidates selection\n  AliRDHFCutsD0toKpi *cutsD0toKpi = new AliRDHFCutsD0toKpi(\"CutsD0toKpi\");\n  cutsD0toKpi->SetUsePhysicsSelection(kFALSE);\n  cutsD0toKpi->SetMaxVtxZ(1.e6);\n  cutsD0toKpi->SetTriggerClass(\"\");\n  Float_t cutsArrayD0toKpi[11]={0.3,999999.,1.1,0.,0.,999999.,999999.,999999.,0.,-1,0.};\n  cutsD0toKpi->SetCuts(11,cutsArrayD0toKpi);\n  cutsD0toKpi->AddTrackCuts(esdTrackCuts);\n  vHF->SetCutsD0toKpi(cutsD0toKpi);\n  AliRDHFCutsJpsitoee *cutsJpsitoee = new AliRDHFCutsJpsitoee(\"CutsJpsitoee\");\n  Float_t cutsArrayJpsitoee[9]={0.350,100000.,1.1,0.,0.,100000.,100000.,100000000.,-1.1};\n  cutsJpsitoee->SetCuts(9,cutsArrayJpsitoee);\n  cutsJpsitoee->AddTrackCuts(esdTrackCuts);\n  vHF->SetCutsJpsitoee(cutsJpsitoee);\n  AliRDHFCutsDplustoKpipi *cutsDplustoKpipi = new AliRDHFCutsDplustoKpipi(\"CutsDplustoKpipi\");\n  Float_t cutsArrayDplustoKpipi[14]={0.2,0.3,0.3,0.,0.,0.01,0.06,0.02,0.,0.7,0.,10000000000.,0.,-1.};\n  cutsDplustoKpipi->SetCuts(14,cutsArrayDplustoKpipi);\n  cutsDplustoKpipi->AddTrackCuts(esdTrackCuts);\n  vHF->SetCutsDplustoKpipi(cutsDplustoKpipi);\n  AliRDHFCutsDstoKKpi *cutsDstoKKpi = new AliRDHFCutsDstoKKpi(\"CutsDstoKKpi\");\n  Float_t cutsArrayDstoKKpi[16]={0.35,0.3,0.3,0.,0.,0.005,0.06,0.,0.,0.7,0.,1000.,0.1,0.1,-1.,1.};\n  cutsDstoKKpi->SetCuts(16,cutsArrayDstoKKpi);\n  cutsDstoKKpi->AddTrackCuts(esdTrackCuts);\n  vHF->SetCutsDstoKKpi(cutsDstoKKpi);\n  AliRDHFCutsLctopKpi *cutsLctopKpi = new AliRDHFCutsLctopKpi(\"CutsLctopKpi\");\n  \/\/Float_t cutsArrayLctopKpi[12]={0.2,0.4,0.4,0.,0.,0.01,0.06,0.02,0.,0.85,0.,10000000000.};\n  Float_t cutsArrayLctopKpi[13]={0.18,0.3,0.3,0.,0.,0.,0.06,0.,0.,-1.,0.,0.05,0.3};\n  cutsLctopKpi->SetCuts(13,cutsArrayLctopKpi);\n  cutsLctopKpi->AddTrackCuts(esdTrackCuts);\n  vHF->SetCutsLctopKpi(cutsLctopKpi);\n  AliRDHFCutsD0toKpipipi *cutsD0toKpipipi = new AliRDHFCutsD0toKpipipi(\"CutsD0toKpipipi\");\n  Float_t cutsArrayD0toKpipipi[9]={0.2,0.04,0.00,0.01,0.02,0.8,0.,0.1,0.};\n  cutsD0toKpipipi->SetCuts(9,cutsArrayD0toKpipipi);\n  cutsD0toKpipipi->AddTrackCuts(esdTrackCuts);\n  vHF->SetCutsD0toKpipipi(cutsD0toKpipipi);\n  AliRDHFCutsDStartoKpipi *cutsDStartoKpipi = new AliRDHFCutsDStartoKpipi(\"CutsDStartoKpipi\");\n  Float_t cutsArrayDStartoKpipi[16]={0.3,999999.,1.1,0.,0.,999999.,999999.,999999.,0.,0.3, 0.1, 0.05, 100000000000.0, 0.5,-1.,0.}; \/\/ first 9 for D0 from D*, next 5 for D*, last 2 for D0 again\n  cutsDStartoKpipi->SetCuts(16,cutsArrayDStartoKpipi);\n  cutsDStartoKpipi->AddTrackCuts(esdTrackCuts);\n  cutsDStartoKpipi->AddTrackCutsSoftPi(esdTrackCutsSoftPi);\n  vHF->SetCutsDStartoKpipi(cutsDStartoKpipi);\n  AliRDHFCutsLctoV0 *cutsLctoV0 = new AliRDHFCutsLctoV0(\"CutsLctoV0\");\n  Float_t cutsArrayLctoV0[9]={4.0,4.0,2.0,2.0,0.0,0.0,0.0,1000.,1000.};\n  cutsLctoV0->SetCuts(9,cutsArrayLctoV0);\n  cutsLctoV0->AddTrackCuts(esdTrackCuts);\n  vHF->SetCutsLctoV0(cutsLctoV0);\n  \/\/ \n  \/\/--- set this if you want to reconstruct primary vertex candidate by\n  \/\/    candidate using other tracks in the event (for pp, broad \n  \/\/    interaction region)\n  \/\/vHF->SetRecoPrimVtxSkippingTrks();\n  \/\/--- OR set this if you want to remove the candidate daughters from \n  \/\/    the primary vertex, without recostructing it from scratch\n  \/\/vHF->SetRmTrksFromPrimVtx();\n\n  \/\/--- check the settings\n  vHF->PrintStatus();\n  \/\/--- verbose\n  \/\/  AliLog::SetClassDebugLevel(\"AliAnalysisVertexingHF\",2);\n\n \n  return vHF;\n}\n\n\n<commit_msg>Updated cuts for Lc->V0+bachelor<commit_after>AliAnalysisVertexingHF* ConfigVertexingHF() {\n\n  printf(\"Call to AliAnalysisVertexingHF parameters setting :\\n\");\n  vHF = new AliAnalysisVertexingHF();\n \n  \/\/--- switch-off candidates finding (default: all on)\n  \/\/vHF->SetD0toKpiOff();\n  \/\/vHF->SetJPSItoEleOff();\n  \/\/vHF->Set3ProngOff();\n  vHF->SetLikeSignOff(); \/\/ like-sign pairs and triplets\n  \/\/vHF->Set4ProngOff();\n  \/\/vHF->SetDstarOff();\n  vHF->SetFindVertexForDstar(kFALSE);\n  \/\/--- secondary vertex with KF?\n  \/\/vHF->SetSecVtxWithKF();\n  \/\/vHF->SetCascadesOff();\n  vHF->SetFindVertexForCascades(kTRUE);\n\n  \/\/--- set cuts for single-track selection  \n  \/\/     displaced tracks\n  AliESDtrackCuts *esdTrackCuts = new AliESDtrackCuts(\"AliESDtrackCuts\",\"default\");\n  esdTrackCuts->SetRequireTPCRefit(kTRUE);\n  esdTrackCuts->SetMinNClustersTPC(70);\n  esdTrackCuts->SetRequireITSRefit(kTRUE);\n  \/\/esdTrackCuts->SetMinNClustersITS(4);\n  esdTrackCuts->SetClusterRequirementITS(AliESDtrackCuts::kSPD,\n\t\t\t\t\t AliESDtrackCuts::kAny);\n  esdTrackCuts->SetMinDCAToVertexXY(0.);\n  esdTrackCuts->SetPtRange(0.3,1.e10);\n  esdTrackCuts->SetEtaRange(-0.8,+0.8);\n  AliAnalysisFilter *trkFilter = new AliAnalysisFilter(\"trackFilter\");\n  trkFilter->AddCuts(esdTrackCuts);\n  vHF->SetTrackFilter(trkFilter);\n  \/\/     D* soft pion tracks\n  AliESDtrackCuts *esdTrackCutsSoftPi = new AliESDtrackCuts(\"AliESDtrackCuts\",\"default\");\n  esdTrackCutsSoftPi->SetMinNClustersITS(2);\n  esdTrackCutsSoftPi->SetEtaRange(-0.8,+0.8);\n  AliAnalysisFilter *trkFilterSoftPi = new AliAnalysisFilter(\"trackFilterSoftPi\");\n  trkFilterSoftPi->AddCuts(esdTrackCutsSoftPi);\n  vHF->SetTrackFilterSoftPi(trkFilterSoftPi);\n  \/\/--- set cuts for candidates selection\n  AliRDHFCutsD0toKpi *cutsD0toKpi = new AliRDHFCutsD0toKpi(\"CutsD0toKpi\");\n  cutsD0toKpi->SetUsePhysicsSelection(kFALSE);\n  cutsD0toKpi->SetMaxVtxZ(1.e6);\n  cutsD0toKpi->SetTriggerClass(\"\");\n  Float_t cutsArrayD0toKpi[11]={0.3,999999.,1.1,0.,0.,999999.,999999.,999999.,0.,-1,0.};\n  cutsD0toKpi->SetCuts(11,cutsArrayD0toKpi);\n  cutsD0toKpi->AddTrackCuts(esdTrackCuts);\n  vHF->SetCutsD0toKpi(cutsD0toKpi);\n  AliRDHFCutsJpsitoee *cutsJpsitoee = new AliRDHFCutsJpsitoee(\"CutsJpsitoee\");\n  Float_t cutsArrayJpsitoee[9]={0.350,100000.,1.1,0.,0.,100000.,100000.,100000000.,-1.1};\n  cutsJpsitoee->SetCuts(9,cutsArrayJpsitoee);\n  cutsJpsitoee->AddTrackCuts(esdTrackCuts);\n  vHF->SetCutsJpsitoee(cutsJpsitoee);\n  AliRDHFCutsDplustoKpipi *cutsDplustoKpipi = new AliRDHFCutsDplustoKpipi(\"CutsDplustoKpipi\");\n  Float_t cutsArrayDplustoKpipi[14]={0.2,0.3,0.3,0.,0.,0.01,0.06,0.02,0.,0.7,0.,10000000000.,0.,-1.};\n  cutsDplustoKpipi->SetCuts(14,cutsArrayDplustoKpipi);\n  cutsDplustoKpipi->AddTrackCuts(esdTrackCuts);\n  vHF->SetCutsDplustoKpipi(cutsDplustoKpipi);\n  AliRDHFCutsDstoKKpi *cutsDstoKKpi = new AliRDHFCutsDstoKKpi(\"CutsDstoKKpi\");\n  Float_t cutsArrayDstoKKpi[16]={0.35,0.3,0.3,0.,0.,0.005,0.06,0.,0.,0.7,0.,1000.,0.1,0.1,-1.,1.};\n  cutsDstoKKpi->SetCuts(16,cutsArrayDstoKKpi);\n  cutsDstoKKpi->AddTrackCuts(esdTrackCuts);\n  vHF->SetCutsDstoKKpi(cutsDstoKKpi);\n  AliRDHFCutsLctopKpi *cutsLctopKpi = new AliRDHFCutsLctopKpi(\"CutsLctopKpi\");\n  \/\/Float_t cutsArrayLctopKpi[12]={0.2,0.4,0.4,0.,0.,0.01,0.06,0.02,0.,0.85,0.,10000000000.};\n  Float_t cutsArrayLctopKpi[13]={0.18,0.3,0.3,0.,0.,0.,0.06,0.,0.,-1.,0.,0.05,0.3};\n  cutsLctopKpi->SetCuts(13,cutsArrayLctopKpi);\n  cutsLctopKpi->AddTrackCuts(esdTrackCuts);\n  vHF->SetCutsLctopKpi(cutsLctopKpi);\n  AliRDHFCutsD0toKpipipi *cutsD0toKpipipi = new AliRDHFCutsD0toKpipipi(\"CutsD0toKpipipi\");\n  Float_t cutsArrayD0toKpipipi[9]={0.2,0.04,0.00,0.01,0.02,0.8,0.,0.1,0.};\n  cutsD0toKpipipi->SetCuts(9,cutsArrayD0toKpipipi);\n  cutsD0toKpipipi->AddTrackCuts(esdTrackCuts);\n  vHF->SetCutsD0toKpipipi(cutsD0toKpipipi);\n  AliRDHFCutsDStartoKpipi *cutsDStartoKpipi = new AliRDHFCutsDStartoKpipi(\"CutsDStartoKpipi\");\n  Float_t cutsArrayDStartoKpipi[16]={0.3,999999.,1.1,0.,0.,999999.,999999.,999999.,0.,0.3, 0.1, 0.05, 100000000000.0, 0.5,-1.,0.}; \/\/ first 9 for D0 from D*, next 5 for D*, last 2 for D0 again\n  cutsDStartoKpipi->SetCuts(16,cutsArrayDStartoKpipi);\n  cutsDStartoKpipi->AddTrackCuts(esdTrackCuts);\n  cutsDStartoKpipi->AddTrackCutsSoftPi(esdTrackCutsSoftPi);\n  vHF->SetCutsDStartoKpipi(cutsDStartoKpipi);\n  AliRDHFCutsLctoV0 *cutsLctoV0 = new AliRDHFCutsLctoV0(\"CutsLctoV0\");\n  Float_t cutsArrayLctoV0[9]={1.0,1.0,0.05,0.05,0.0,0.0,0.0,1000.,1000.};\n  cutsLctoV0->SetCuts(9,cutsArrayLctoV0);\n  cutsLctoV0->AddTrackCuts(esdTrackCuts);\n  vHF->SetCutsLctoV0(cutsLctoV0);\n  \/\/ \n  \/\/--- set this if you want to reconstruct primary vertex candidate by\n  \/\/    candidate using other tracks in the event (for pp, broad \n  \/\/    interaction region)\n  \/\/vHF->SetRecoPrimVtxSkippingTrks();\n  \/\/--- OR set this if you want to remove the candidate daughters from \n  \/\/    the primary vertex, without recostructing it from scratch\n  \/\/vHF->SetRmTrksFromPrimVtx();\n\n  \/\/--- check the settings\n  vHF->PrintStatus();\n  \/\/--- verbose\n  \/\/  AliLog::SetClassDebugLevel(\"AliAnalysisVertexingHF\",2);\n\n \n  return vHF;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>AliAnalysisGrid* CreateAlienHandlerCaloEtSim(TString outputDir, TString outputName, const char * pluginRunMode)\n{\n  \/\/ Check if user has a valid token, otherwise make one. This has limitations.\n  \/\/ One can always follow the standard procedure of calling alien-token-init then\n  \/\/   source \/tmp\/gclient_env_$UID in the current shell.\n  if (!AliAnalysisGrid::CreateToken()) return NULL;\n  AliAnalysisAlien *plugin = new AliAnalysisAlien();\n\n  \/\/ Overwrite all generated files, datasets and output results from a previous session\n  plugin->SetOverwriteMode();\n  \/\/ Set the run mode (can be \"full\", \"test\", \"offline\", \"submit\" or \"terminate\")\n  \/\/ plugin->SetRunMode(\"full\");  \/\/ VERY IMPORTANT - DECRIBED BELOW\n  \/\/ plugin->SetRunMode(\"test\");  \/\/ VERY IMPORTANT - DECRIBED BELOW\n  plugin->SetRunMode(pluginRunMode);  \/\/ VERY IMPORTANT - DECRIBED BELOW\n  cout<<\"Running in \"<<pluginRunMode<<\" mode\"<<endl;\n\n  \/\/ Set versions of used packages\n   plugin->SetAPIVersion(\"V1.1x\");\n   plugin->SetROOTVersion(\"v5-28-00a\");\n   plugin->SetAliROOTVersion(\"v4-21-18a-AN\");\n  \/\/ Declare input data to be processed.\n\n  \/\/ Method 1: Create automatically XML collections using alien 'find' command.\n  \/\/ Define production directory LFN\n  \/\/   plugin->SetGridDataDir(\"\/alice\/sim\/LHC10a18\");\n  \/\/ Set data search pattern\n  \/\/   plugin->SetDataPattern(\"*ESDs.root\");  \/\/ simulated, tags not used\n  \/\/   plugin->SetDataPattern(\"*ESDs\/pass4\/*ESDs.root\"); \/\/ real data check reco pass and data base directory\n  \/\/   plugin->SetRunPrefix(\"000\");   \/\/ real data\n  \/\/   plugin->SetDataPattern(\"*tag.root\");  \/\/ Use ESD tags (same applies for AOD's)\n  \/\/ ...then add run numbers to be considered\n  \/\/   plugin->AddRunNumber(125020);    \/\/ simulated\n  \/\/   plugin->AddRunNumber(104065);  \/\/ real data\n\n   plugin->SetGridDataDir(\"\/alice\/sim\/LHC10d4\");\n   plugin->SetDataPattern(\"*ESDs.root\");\n   plugin->AddRunNumber(\"120741\");\/\/smallest of the above\n  \/\/ Method 2: Declare existing data files (raw collections, xml collections, root file)\n  \/\/ If no path mentioned data is supposed to be in the work directory (see SetGridWorkingDir())\n  \/\/ XML collections added via this method can be combined with the first method if\n  \/\/ the content is compatible (using or not tags)\n  \/\/plugin->AddDataFile(\"tag.xml\");\n  \/\/ plugin->AddDataFile(\"wn.xml\"); \/\/ test\n  \/\/ file generated with:  find -x tag \/alice\/sim\/LHC10d1\/117222\/* AliESDs.root > tag.xml\n\n  \/\/ Define alien work directory where all files will be copied. Relative to alien $HOME.\n  plugin->SetGridWorkingDir(outputDir.Data());\n  \/\/ Declare alien output directory. Relative to working directory.\n  plugin->SetGridOutputDir(\"output\"); \/\/ In this case will be $HOME\/work\/output\n  \/\/ Declare the analysis source files names separated by blancs. To be compiled runtime IN THE SAME ORDER THEY ARE LISTED\n  \/\/ using ACLiC on the worker nodes.\n  plugin->SetAnalysisSource(\"AliAnalysisEtCuts.cxx AliAnalysisHadEtCorrections.cxx AliAnalysisEtCommon.cxx AliAnalysisEt.cxx AliAnalysisEtMonteCarlo.cxx AliAnalysisEtMonteCarloPhos.cxx AliAnalysisEtMonteCarloEmcal.cxx AliAnalysisEtReconstructed.cxx AliAnalysisEtReconstructedPhos.cxx AliAnalysisEtReconstructedEmcal.cxx AliAnalysisEtSelectionContainer.cxx AliAnalysisEtSelectionHandler.cxx AliAnalysisTaskTransverseEnergy.cxx AliAnalysisTaskTotEt.cxx\");\n  \/\/ Declare all libraries (other than the default ones for the framework. These will be\n  \/\/ loaded by the generated analysis macro. Add all extra files (task .cxx\/.h) here.\n  plugin->SetAdditionalLibs(\"AliAnalysisEtCuts.h AliAnalysisEt.h AliAnalysisEtMonteCarlo.h AliAnalysisEtMonteCarloPhos.h AliAnalysisEtMonteCarloEmcal.h AliAnalysisEtReconstructed.h AliAnalysisEtReconstructedPhos.h AliAnalysisEtReconstructedEmcal.h AliAnalysisTaskTotEt.h AliAnalysisEtCuts.cxx AliAnalysisEt.cxx AliAnalysisEtMonteCarlo.cxx AliAnalysisEtMonteCarloPhos.cxx AliAnalysisEtMonteCarloEmcal.cxx AliAnalysisEtReconstructed.cxx AliAnalysisEtReconstructedPhos.cxx AliAnalysisEtReconstructedEmcal.cxx AliAnalysisTaskTotEt.cxx  AliAnalysisEtCommon.cxx  AliAnalysisEtCommon.h AliAnalysisHadEtCorrections.h AliAnalysisHadEtCorrections.cxx AliAnalysisEtSelectionContainer.h AliAnalysisEtSelectionHandler.h AliAnalysisTaskTransverseEnergy.h AliAnalysisEtSelectionContainer.cxx AliAnalysisEtSelectionHandler.cxx AliAnalysisTaskTransverseEnergy.cxx ConfigEtMonteCarlo.C ConfigEtReconstructed.C physicsSelections.root corrections.root\");\n  plugin->SetExecutableCommand(\"aliroot -b -q\");\n  \/\/ add extra include files\/path\n  plugin->AddIncludePath(\"-I. -I$ALICE_ROOT\/EMCAL -I$ALICE_ROOT\/ANALYSIS\");\n\n  \/\/ No need for output file names. Procedure is automatic. <-- not true\n  \/\/plugin->SetDefaultOutputs(kFALSE);\n  \/\/plugin->SetOutputFiles(outputName.Data());\n  \/\/plugin->SetOutputFiles(\"Et.ESD.sim.EMCAL.root event_stat.root\");\n  \/\/ No need define the files to be archived. Note that this is handled automatically by the plugin.\n  \/\/   plugin->SetOutputArchive(\"log_archive.zip:stdout,stderr\");\n  \/\/ Set a name for the generated analysis macro (default MyAnalysis.C) Make this unique !\n  plugin->SetAnalysisMacro(\"DavidEtAnalysis.C\");\n  \/\/ Optionally set maximum number of input files\/subjob (default 100, put 0 to ignore). The optimum for an analysis\n  \/\/ is correlated with the run time - count few hours TTL per job, not minutes !\n  plugin->SetSplitMaxInputFileNumber(100);\n  \/\/ Optionally set number of failed jobs that will trigger killing waiting sub-jobs.\n  plugin->SetMaxInitFailed(5);\n  \/\/ Optionally resubmit threshold.\n  \/\/plugin->SetMasterResubmitThreshold(10);\n  \/\/ Optionally set time to live (default 30000 sec)\n  plugin->SetTTL(20000);\n  \/\/ Optionally set input format (default xml-single)\n  plugin->SetInputFormat(\"xml-single\");\n  \/\/ Optionally modify the name of the generated JDL (default analysis.jdl)\n  plugin->SetJDLName(\"TaskEt.jdl\");\n  \/\/ Optionally modify job price (default 1)\n  plugin->SetPrice(1); \n  \/\/ Optionally modify split mode (default 'se')    \n  plugin->SetSplitMode(\"se\");\n\n  return plugin;\n} \n<commit_msg>Tweaking alien handler macro for em et corrections<commit_after>AliAnalysisGrid* CreateAlienHandlerCaloEtSim(TString outputDir, TString outputName, const char * pluginRunMode)\n{\n  \/\/ Check if user has a valid token, otherwise make one. This has limitations.\n  \/\/ One can always follow the standard procedure of calling alien-token-init then\n  \/\/   source \/tmp\/gclient_env_$UID in the current shell.\n  \/\/if (!AliAnalysisGrid::CreateToken()) return NULL;\n  AliAnalysisAlien *plugin = new AliAnalysisAlien();\n\n  \/\/ Overwrite all generated files, datasets and output results from a previous session\n  plugin->SetOverwriteMode();\n  \/\/ Set the run mode (can be \"full\", \"test\", \"offline\", \"submit\" or \"terminate\")\n  \/\/ plugin->SetRunMode(\"full\");  \/\/ VERY IMPORTANT - DECRIBED BELOW\n  \/\/ plugin->SetRunMode(\"test\");  \/\/ VERY IMPORTANT - DECRIBED BELOW\n  plugin->SetRunMode(pluginRunMode);  \/\/ VERY IMPORTANT - DECRIBED BELOW\n  cout<<\"Running in \"<<pluginRunMode<<\" mode\"<<endl;\n\n  \/\/ Set versions of used packages\n   plugin->SetAPIVersion(\"V1.1x\");\n   plugin->SetROOTVersion(\"v5-28-00a\");\n   plugin->SetAliROOTVersion(\"v4-21-17b-AN\");\n  \/\/ Declare input data to be processed.\n\n  \/\/ Method 1: Create automatically XML collections using alien 'find' command.\n  \/\/ Define production directory LFN\n  \/\/   plugin->SetGridDataDir(\"\/alice\/sim\/LHC10a18\");\n  \/\/ Set data search pattern\n  \/\/   plugin->SetDataPattern(\"*ESDs.root\");  \/\/ simulated, tags not used\n  \/\/   plugin->SetDataPattern(\"*ESDs\/pass4\/*ESDs.root\"); \/\/ real data check reco pass and data base directory\n  \/\/   plugin->SetRunPrefix(\"000\");   \/\/ real data\n  \/\/   plugin->SetDataPattern(\"*tag.root\");  \/\/ Use ESD tags (same applies for AOD's)\n  \/\/ ...then add run numbers to be considered\n  \/\/   plugin->AddRunNumber(125020);    \/\/ simulated\n  \/\/   plugin->AddRunNumber(104065);  \/\/ real data\n\n   plugin->SetGridDataDir(\"\/alice\/sim\/LHC10d4\");\n   plugin->SetDataPattern(\"*ESDs.root\");\n   plugin->AddRunNumber(\"120741\");\/\/smallest of the above\n  \/\/ Method 2: Declare existing data files (raw collections, xml collections, root file)\n  \/\/ If no path mentioned data is supposed to be in the work directory (see SetGridWorkingDir())\n  \/\/ XML collections added via this method can be combined with the first method if\n  \/\/ the content is compatible (using or not tags)\n  \/\/plugin->AddDataFile(\"tag.xml\");\n  \/\/ plugin->AddDataFile(\"wn.xml\"); \/\/ test\n  \/\/ file generated with:  find -x tag \/alice\/sim\/LHC10d1\/117222\/* AliESDs.root > tag.xml\n\n  \/\/ Define alien work directory where all files will be copied. Relative to alien $HOME.\n  plugin->SetGridWorkingDir(outputDir.Data());\n  \/\/ Declare alien output directory. Relative to working directory.\n  plugin->SetGridOutputDir(\"output\"); \/\/ In this case will be $HOME\/work\/output\n  \/\/ Declare the analysis source files names separated by blancs. To be compiled runtime IN THE SAME ORDER THEY ARE LISTED\n  \/\/plugin->SetAdditionalRootLibs(\"libPHOSUtils.so libEMCALUtils.so libPWG4CaloCalib.so libPWG4PartCorrBase.so libPWG4PartCorrDep.so\");\n  \/\/ using ACLiC on the worker nodes.\n  plugin->SetAnalysisSource(\"AliAnalysisEtCuts.cxx AliAnalysisHadEtCorrections.cxx AliAnalysisEtCommon.cxx AliAnalysisEt.cxx AliAnalysisEtMonteCarlo.cxx AliAnalysisEtMonteCarloPhos.cxx AliAnalysisEtMonteCarloEmcal.cxx AliAnalysisEtReconstructed.cxx AliAnalysisEtReconstructedPhos.cxx AliAnalysisEtReconstructedEmcal.cxx AliAnalysisEtSelectionContainer.cxx AliAnalysisEtSelectionHandler.cxx AliAnalysisTaskTransverseEnergy.cxx AliAnalysisEmEtMonteCarlo.cxx AliAnalysisEmEtReconstructed.cxx AliAnalysisTaskTotEt.cxx\");\n  \/\/ Declare all libraries (other than the default ones for the framework. These will be\n  \/\/ loaded by the generated analysis macro. Add all extra files (task .cxx\/.h) here.\n  plugin->SetAdditionalLibs(\"libPHOSUtils.so libEMCALUtils.so libPWG4CaloCalib.so libPWG4PartCorrBase.so libPWG4PartCorrDep.so AliAnalysisEtCuts.h AliAnalysisEt.h AliAnalysisEtMonteCarlo.h AliAnalysisEtMonteCarloPhos.h AliAnalysisEtMonteCarloEmcal.h AliAnalysisEtReconstructed.h AliAnalysisEtReconstructedPhos.h AliAnalysisEtReconstructedEmcal.h AliAnalysisTaskTotEt.h AliAnalysisEtCuts.cxx AliAnalysisEt.cxx AliAnalysisEtMonteCarlo.cxx AliAnalysisEtMonteCarloPhos.cxx AliAnalysisEtMonteCarloEmcal.cxx AliAnalysisEtReconstructed.cxx AliAnalysisEtReconstructedPhos.cxx AliAnalysisEtReconstructedEmcal.cxx AliAnalysisTaskTotEt.cxx  AliAnalysisEtCommon.cxx  AliAnalysisEtCommon.h AliAnalysisHadEtCorrections.h AliAnalysisHadEtCorrections.cxx AliAnalysisEtSelectionContainer.h AliAnalysisEtSelectionHandler.h AliAnalysisTaskTransverseEnergy.h AliAnalysisEtSelectionContainer.cxx AliAnalysisEtSelectionHandler.cxx AliAnalysisTaskTransverseEnergy.cxx AliAnalysisEmEtMonteCarlo.cxx AliAnalysisEmEtReconstructed.cxx AliAnalysisEmEtMonteCarlo.h AliAnalysisEmEtReconstructed.h ConfigEtMonteCarlo.C ConfigEtReconstructed.C physicsSelections.root corrections.root\");\n  plugin->SetExecutableCommand(\"aliroot -b -q\");\n  \/\/ add extra include files\/path\n  plugin->AddIncludePath(\"-I. -I$ALICE_ROOT\/EMCAL -I$ALICE_ROOT\/ANALYSIS\");\n\n  \/\/ No need for output file names. Procedure is automatic. <-- not true\n  \/\/plugin->SetDefaultOutputs(kFALSE);\n  \/\/plugin->SetOutputFiles(outputName.Data());\n  \/\/plugin->SetOutputFiles(\"Et.ESD.sim.EMCAL.root event_stat.root\");\n  \/\/ No need define the files to be archived. Note that this is handled automatically by the plugin.\n  \/\/   plugin->SetOutputArchive(\"log_archive.zip:stdout,stderr\");\n  \/\/ Set a name for the generated analysis macro (default MyAnalysis.C) Make this unique !\n  plugin->SetAnalysisMacro(\"DavidEtAnalysis.C\");\n  \/\/ Optionally set maximum number of input files\/subjob (default 100, put 0 to ignore). The optimum for an analysis\n  \/\/ is correlated with the run time - count few hours TTL per job, not minutes !\n  plugin->SetSplitMaxInputFileNumber(100);\n  \/\/ Optionally set number of failed jobs that will trigger killing waiting sub-jobs.\n  plugin->SetMaxInitFailed(5);\n  \/\/ Optionally resubmit threshold.\n  \/\/plugin->SetMasterResubmitThreshold(90);\n  \/\/ Optionally set time to live (default 30000 sec)\n  plugin->SetTTL(20000);\n  \/\/ Optionally set input format (default xml-single)\n  plugin->SetInputFormat(\"xml-single\");\n  \/\/ Optionally modify the name of the generated JDL (default analysis.jdl)\n  plugin->SetJDLName(\"TaskEt.jdl\");\n  \/\/ Optionally modify job price (default 1)\n  plugin->SetPrice(1); \n  \/\/ Optionally modify split mode (default 'se')    \n  plugin->SetSplitMode(\"se\");\n\n  return plugin;\n} \n<|endoftext|>"}
{"text":"<commit_before>\/*\n * AliFemtoDreamv0.cxx\n *\n *  Created on: Dec 12, 2017\n *      Author: gu74req\n *\/\n\n#include <vector>\n#include \"AliAODMCParticle.h\"\n#include \"AliFemtoDreamv0.h\"\n#include \"TClonesArray.h\"\n\nClassImp(AliFemtoDreamv0)\nAliFemtoDreamv0::AliFemtoDreamv0()\n:AliFemtoDreamBasePart()\n,fOnlinev0(false)\n,fHasDaughter(false)\n,fpDaug(new AliFemtoDreamTrack())\n,fnDaug(new AliFemtoDreamTrack())\n,fv0Mass(0)\n,fdcav0Daug(0)\n,fdcaPrim(0)\n,fdcaPrimPos(0)\n,fdcaPrimNeg(0)\n,flenDecay(0)\n,fTransRadius(0)\n{\n  for (int i=0;i<3;++i) {\n    fv0Vtx[i]=0;\n  }\n}\n\nAliFemtoDreamv0::~AliFemtoDreamv0() {\n  if (fpDaug) {\n    delete fpDaug;\n  }\n  if (fnDaug) {\n    delete fnDaug;\n  }\n}\n\nvoid AliFemtoDreamv0::Setv0(AliAODEvent *evt,AliAODv0* v0) {\n  if (!fGTI) {\n    AliFatal(\"no GTI Array set\");\n  }\n  if (!v0) {\n    AliFatal(\"SetProng No v0 to work with\");\n  }\n  Reset();\n  if (v0->GetNProngs()==2&&v0->GetNDaughters()==2) {\n    fIsReset=false;\n    if (v0->GetOnFlyStatus()) {\n      this->fOnlinev0=true;\n    } else {\n      this->fOnlinev0=false;\n    }\n    this->SetMotherInfo(evt,v0);\n    if (fIsMC) {\n      this->SetMCMotherInfo(evt,v0);\n    }\n    this->SetDaughter(v0);\n  } else {\n    this->SetUse(false);\n  }\n}\n\nvoid AliFemtoDreamv0::SetDaughter(AliAODv0 *v0) {\n  if (v0->GetPosID()>=fTrackBufferSize||v0->GetNegID()>=fTrackBufferSize) {\n    AliFatal(\"fGTI too small\");\n  } else {\n    fpDaug->SetGlobalTrackInfo(fGTI,fTrackBufferSize);\n    fnDaug->SetGlobalTrackInfo(fGTI,fTrackBufferSize);\n    if (fGTI[v0->GetPosID()]&&fGTI[v0->GetNegID()]) {\n      if (fGTI[v0->GetPosID()]->Charge() > 0 && fGTI[v0->GetNegID()]->Charge() < 0) {\n        fnDaug->SetTrack(fGTI[v0->GetNegID()]);\n        fpDaug->SetTrack(fGTI[v0->GetPosID()]);\n        this->SetDaughterInfo(v0);\n        this->fHasDaughter=true;\n      } else if(fGTI[v0->GetPosID()]->Charge() < 0 && fGTI[v0->GetNegID()]->Charge() > 0) {\n        fnDaug->SetTrack(fGTI[v0->GetPosID()]);\n        fpDaug->SetTrack(fGTI[v0->GetNegID()]);\n        this->SetDaughterInfo(v0);\n        this->fHasDaughter=true;\n      } else {\n        this->fHasDaughter=false;\n      }\n    } else {\n      this->fHasDaughter=false;\n    }\n  }\n}\n\nvoid AliFemtoDreamv0::SetDaughterInfo(AliAODv0 *v0) {\n  this->SetEta(fnDaug->GetEta().at(0));\n  this->SetEta(fpDaug->GetEta().at(0));\n\n  this->SetTheta(fnDaug->GetTheta().at(0));\n  this->SetTheta(fpDaug->GetTheta().at(0));\n\n  this->SetPhi(fnDaug->GetPhi().at(0));\n  this->SetPhi(fpDaug->GetPhi().at(0));\n\n  this->SetIDTracks(fnDaug->GetIDTracks().at(0));\n  this->SetIDTracks(fpDaug->GetIDTracks().at(0));\n\n  this->SetCharge(fnDaug->GetCharge().at(0));\n  this->SetCharge(fpDaug->GetCharge().at(0));\n  \/\/here we have to set the momentum from the v0. The Momentum of the Global\n  \/\/track is different to the one of the daughter track and is also\n  \/\/used in the official v0 class for the invarian mass\n  \/\/calculation.\n  fnDaug->SetMomentum(v0->PxProng(1), v0->PyProng(1), v0->PzProng(1));\n  fpDaug->SetMomentum(v0->PxProng(0), v0->PyProng(0), v0->PzProng(0));\n\n  if(fIsMC) {\n    if (fnDaug->IsSet()) {\n      this->SetMCTheta(fnDaug->GetMCTheta().at(0));\n      this->SetMCPhi(fnDaug->GetMCPhi().at(0));\n    }\n    if (fpDaug->IsSet()) {\n      this->SetMCTheta(fpDaug->GetMCTheta().at(0));\n      this->SetMCPhi(fpDaug->GetMCPhi().at(0));\n    }\n  }\n}\n\nvoid AliFemtoDreamv0::SetMotherInfo(AliAODEvent *evt,AliAODv0 *v0) {\n  this->SetCharge(v0->GetCharge());\n  this->SetPt(v0->Pt());\n  this->SetMomentum(v0->Px(),v0->Py(),v0->Pz());\n  this->SetEta(v0->Eta());\n  this->SetPhi(v0->Phi());\n  this->SetTheta(v0->Theta());\n  float xvP = evt->GetPrimaryVertex()->GetX();\n  float yvP = evt->GetPrimaryVertex()->GetY();\n  float zvP = evt->GetPrimaryVertex()->GetZ();\n  double vecTarget[3]={xvP,yvP,zvP};\n  v0->GetXYZ(fv0Vtx);\n  this->fdcav0Daug=v0->DcaV0Daughters();\n  this->fdcaPrim=v0->DcaV0ToPrimVertex();\n  this->fdcaPrimPos=v0->DcaPosToPrimVertex();\n  this->fdcaPrimNeg=v0->DcaNegToPrimVertex();\n  this->flenDecay=v0->DecayLengthV0(vecTarget);\n  this->fCPA=v0->CosPointingAngle(vecTarget);\n  this->fTransRadius=v0->DecayLengthXY(vecTarget);\n}\n\nvoid AliFemtoDreamv0::SetMCMotherInfo(AliAODEvent *evt,AliAODv0 *v0) {\n  TClonesArray *mcarray = dynamic_cast<TClonesArray*>(\n      evt->FindListObject(AliAODMCParticle::StdBranchName()));\n  if (!mcarray) {\n    AliFatal(\"No MC Array found\");\n  }\n  int PDGDaug[2];\n  PDGDaug[0]=TMath::Abs(fpDaug->GetPDGCode());\n  PDGDaug[1]=TMath::Abs(fnDaug->GetPDGCode());\n  int label=v0->MatchToMC(TMath::Abs(fPDGCode),mcarray,2,PDGDaug);\n  if (label<0) {\n    \/\/label will be -1 if there was not 'real' candidate for matching,\n    \/\/therefore we have the case of a contamination\/background v0\n    \/\/this should be kFake\n    this->SetParticleOrigin(AliFemtoDreamBasePart::kFake);\n  } else {\n    AliAODMCParticle* mcPart=(AliAODMCParticle*)mcarray->At(label);\n    if (!mcPart) {\n      \/\/this should be fIsSet!\n      this->SetUse(false);\n    } else {\n      this->SetMCPDGCode(mcPart->GetPdgCode());\n      double mcMom[3]={0.,0.,0.};\n      mcPart->PxPyPz(mcMom);\n      this->SetMCMomentum(mcMom[0],mcMom[1],mcMom[2]);\n      this->SetMCPt(mcPart->Pt());\n      this->SetMCPhi(mcPart->Phi());\n      this->SetMCTheta(mcPart->Theta());\n      if (mcPart->IsPhysicalPrimary()&&!(mcPart->IsSecondaryFromWeakDecay())) {\n        this->SetParticleOrigin(AliFemtoDreamBasePart::kPhysPrimary);\n      } else if (mcPart->IsSecondaryFromWeakDecay()&&\n          !(mcPart->IsSecondaryFromMaterial())) {\n        this->SetParticleOrigin(AliFemtoDreamBasePart::kWeak);\n        this->SetPDGMotherWeak(((AliAODMCParticle*)mcarray->At(\n            mcPart->GetMother()))->PdgCode());\n      } else if (mcPart->IsSecondaryFromMaterial()) {\n        this->SetParticleOrigin(AliFemtoDreamBasePart::kMaterial);\n      } else {\n        this->SetParticleOrigin(AliFemtoDreamBasePart::kUnknown);\n      }\n    }\n  }\n}\nvoid AliFemtoDreamv0::Reset() {\n  if (!fIsReset) {\n    fOnlinev0=false;\n    fHasDaughter=false;\n    \/\/daughters don't need to be reset, are reset while setting a new track\n    fv0Mass=0;\n    fv0Vtx[0]=99;\n    fv0Vtx[1]=99;\n    fv0Vtx[2]=99;\n    fdcav0Daug=99;\n    fdcaPrim=0;\n    fdcaPrimPos=0;\n    fdcaPrimNeg=0;\n    flenDecay=0;\n    fTransRadius=0;\n    fP.SetXYZ(0,0,0);\n    fMCP.SetXYZ(0,0,0);\n    fPt=0;\n    fMCPt=0;\n    fMCPt=0;\n    fP_TPC=0;\n    fEta.clear();\n    fTheta.clear();\n    fMCTheta.clear();\n    fPhi.clear();\n    fMCPhi.clear();\n    fIDTracks.clear();\n    fCharge.clear();\n    fCPA=0;\n    fOrigin=AliFemtoDreamBasePart::kUnknown;\n    \/\/we don't want to reset the fPDGCode\n    fMCPDGCode=0;\n    fPDGMotherWeak=0;\n    \/\/we don't want to reset isMC\n    fUse=false;\n    fIsSet=true;\n    fIsReset=true;\n  }\n}\n<commit_msg>Also here removal of the AliFatal, replaced by a negative bool fHasDaughter=false which will kill all these v0 candidates in the v0Cuts object<commit_after>\/*\n * AliFemtoDreamv0.cxx\n *\n *  Created on: Dec 12, 2017\n *      Author: gu74req\n *\/\n\n#include <vector>\n#include \"AliAODMCParticle.h\"\n#include \"AliFemtoDreamv0.h\"\n#include \"TClonesArray.h\"\n\nClassImp(AliFemtoDreamv0)\nAliFemtoDreamv0::AliFemtoDreamv0()\n:AliFemtoDreamBasePart()\n,fOnlinev0(false)\n,fHasDaughter(false)\n,fpDaug(new AliFemtoDreamTrack())\n,fnDaug(new AliFemtoDreamTrack())\n,fv0Mass(0)\n,fdcav0Daug(0)\n,fdcaPrim(0)\n,fdcaPrimPos(0)\n,fdcaPrimNeg(0)\n,flenDecay(0)\n,fTransRadius(0)\n{\n  for (int i=0;i<3;++i) {\n    fv0Vtx[i]=0;\n  }\n}\n\nAliFemtoDreamv0::~AliFemtoDreamv0() {\n  if (fpDaug) {\n    delete fpDaug;\n  }\n  if (fnDaug) {\n    delete fnDaug;\n  }\n}\n\nvoid AliFemtoDreamv0::Setv0(AliAODEvent *evt,AliAODv0* v0) {\n  if (!fGTI) {\n    AliFatal(\"no GTI Array set\");\n  }\n  if (!v0) {\n    AliFatal(\"SetProng No v0 to work with\");\n  }\n  Reset();\n  if (v0->GetNProngs()==2&&v0->GetNDaughters()==2) {\n    fIsReset=false;\n    if (v0->GetOnFlyStatus()) {\n      this->fOnlinev0=true;\n    } else {\n      this->fOnlinev0=false;\n    }\n    this->SetMotherInfo(evt,v0);\n    if (fIsMC) {\n      this->SetMCMotherInfo(evt,v0);\n    }\n    this->SetDaughter(v0);\n  } else {\n    this->SetUse(false);\n  }\n}\n\nvoid AliFemtoDreamv0::SetDaughter(AliAODv0 *v0) {\n  if (v0->GetPosID()>=fTrackBufferSize||v0->GetNegID()>=fTrackBufferSize) {\n    std::cout<<\"fGTI too small, no Global Tracks to work with, PosID:  \"\n        << v0->GetPosID() << \" and NegID: \" << v0->GetNegID() << std::endl;\n    this->fHasDaughter=false;\n  } else {\n    fpDaug->SetGlobalTrackInfo(fGTI,fTrackBufferSize);\n    fnDaug->SetGlobalTrackInfo(fGTI,fTrackBufferSize);\n    if (fGTI[v0->GetPosID()]&&fGTI[v0->GetNegID()]) {\n      if (fGTI[v0->GetPosID()]->Charge() > 0 && fGTI[v0->GetNegID()]->Charge() < 0) {\n        fnDaug->SetTrack(fGTI[v0->GetNegID()]);\n        fpDaug->SetTrack(fGTI[v0->GetPosID()]);\n        this->SetDaughterInfo(v0);\n        this->fHasDaughter=true;\n      } else if(fGTI[v0->GetPosID()]->Charge() < 0 && fGTI[v0->GetNegID()]->Charge() > 0) {\n        fnDaug->SetTrack(fGTI[v0->GetPosID()]);\n        fpDaug->SetTrack(fGTI[v0->GetNegID()]);\n        this->SetDaughterInfo(v0);\n        this->fHasDaughter=true;\n      } else {\n        this->fHasDaughter=false;\n      }\n    } else {\n      this->fHasDaughter=false;\n    }\n  }\n}\n\nvoid AliFemtoDreamv0::SetDaughterInfo(AliAODv0 *v0) {\n  this->SetEta(fnDaug->GetEta().at(0));\n  this->SetEta(fpDaug->GetEta().at(0));\n\n  this->SetTheta(fnDaug->GetTheta().at(0));\n  this->SetTheta(fpDaug->GetTheta().at(0));\n\n  this->SetPhi(fnDaug->GetPhi().at(0));\n  this->SetPhi(fpDaug->GetPhi().at(0));\n\n  this->SetIDTracks(fnDaug->GetIDTracks().at(0));\n  this->SetIDTracks(fpDaug->GetIDTracks().at(0));\n\n  this->SetCharge(fnDaug->GetCharge().at(0));\n  this->SetCharge(fpDaug->GetCharge().at(0));\n  \/\/here we have to set the momentum from the v0. The Momentum of the Global\n  \/\/track is different to the one of the daughter track and is also\n  \/\/used in the official v0 class for the invarian mass\n  \/\/calculation.\n  fnDaug->SetMomentum(v0->PxProng(1), v0->PyProng(1), v0->PzProng(1));\n  fpDaug->SetMomentum(v0->PxProng(0), v0->PyProng(0), v0->PzProng(0));\n\n  if(fIsMC) {\n    if (fnDaug->IsSet()) {\n      this->SetMCTheta(fnDaug->GetMCTheta().at(0));\n      this->SetMCPhi(fnDaug->GetMCPhi().at(0));\n    }\n    if (fpDaug->IsSet()) {\n      this->SetMCTheta(fpDaug->GetMCTheta().at(0));\n      this->SetMCPhi(fpDaug->GetMCPhi().at(0));\n    }\n  }\n}\n\nvoid AliFemtoDreamv0::SetMotherInfo(AliAODEvent *evt,AliAODv0 *v0) {\n  this->SetCharge(v0->GetCharge());\n  this->SetPt(v0->Pt());\n  this->SetMomentum(v0->Px(),v0->Py(),v0->Pz());\n  this->SetEta(v0->Eta());\n  this->SetPhi(v0->Phi());\n  this->SetTheta(v0->Theta());\n  float xvP = evt->GetPrimaryVertex()->GetX();\n  float yvP = evt->GetPrimaryVertex()->GetY();\n  float zvP = evt->GetPrimaryVertex()->GetZ();\n  double vecTarget[3]={xvP,yvP,zvP};\n  v0->GetXYZ(fv0Vtx);\n  this->fdcav0Daug=v0->DcaV0Daughters();\n  this->fdcaPrim=v0->DcaV0ToPrimVertex();\n  this->fdcaPrimPos=v0->DcaPosToPrimVertex();\n  this->fdcaPrimNeg=v0->DcaNegToPrimVertex();\n  this->flenDecay=v0->DecayLengthV0(vecTarget);\n  this->fCPA=v0->CosPointingAngle(vecTarget);\n  this->fTransRadius=v0->DecayLengthXY(vecTarget);\n}\n\nvoid AliFemtoDreamv0::SetMCMotherInfo(AliAODEvent *evt,AliAODv0 *v0) {\n  TClonesArray *mcarray = dynamic_cast<TClonesArray*>(\n      evt->FindListObject(AliAODMCParticle::StdBranchName()));\n  if (!mcarray) {\n    AliFatal(\"No MC Array found\");\n  }\n  int PDGDaug[2];\n  PDGDaug[0]=TMath::Abs(fpDaug->GetPDGCode());\n  PDGDaug[1]=TMath::Abs(fnDaug->GetPDGCode());\n  int label=v0->MatchToMC(TMath::Abs(fPDGCode),mcarray,2,PDGDaug);\n  if (label<0) {\n    \/\/label will be -1 if there was not 'real' candidate for matching,\n    \/\/therefore we have the case of a contamination\/background v0\n    \/\/this should be kFake\n    this->SetParticleOrigin(AliFemtoDreamBasePart::kFake);\n  } else {\n    AliAODMCParticle* mcPart=(AliAODMCParticle*)mcarray->At(label);\n    if (!mcPart) {\n      \/\/this should be fIsSet!\n      this->SetUse(false);\n    } else {\n      this->SetMCPDGCode(mcPart->GetPdgCode());\n      double mcMom[3]={0.,0.,0.};\n      mcPart->PxPyPz(mcMom);\n      this->SetMCMomentum(mcMom[0],mcMom[1],mcMom[2]);\n      this->SetMCPt(mcPart->Pt());\n      this->SetMCPhi(mcPart->Phi());\n      this->SetMCTheta(mcPart->Theta());\n      if (mcPart->IsPhysicalPrimary()&&!(mcPart->IsSecondaryFromWeakDecay())) {\n        this->SetParticleOrigin(AliFemtoDreamBasePart::kPhysPrimary);\n      } else if (mcPart->IsSecondaryFromWeakDecay()&&\n          !(mcPart->IsSecondaryFromMaterial())) {\n        this->SetParticleOrigin(AliFemtoDreamBasePart::kWeak);\n        this->SetPDGMotherWeak(((AliAODMCParticle*)mcarray->At(\n            mcPart->GetMother()))->PdgCode());\n      } else if (mcPart->IsSecondaryFromMaterial()) {\n        this->SetParticleOrigin(AliFemtoDreamBasePart::kMaterial);\n      } else {\n        this->SetParticleOrigin(AliFemtoDreamBasePart::kUnknown);\n      }\n    }\n  }\n}\nvoid AliFemtoDreamv0::Reset() {\n  if (!fIsReset) {\n    fOnlinev0=false;\n    fHasDaughter=false;\n    \/\/daughters don't need to be reset, are reset while setting a new track\n    fv0Mass=0;\n    fv0Vtx[0]=99;\n    fv0Vtx[1]=99;\n    fv0Vtx[2]=99;\n    fdcav0Daug=99;\n    fdcaPrim=0;\n    fdcaPrimPos=0;\n    fdcaPrimNeg=0;\n    flenDecay=0;\n    fTransRadius=0;\n    fP.SetXYZ(0,0,0);\n    fMCP.SetXYZ(0,0,0);\n    fPt=0;\n    fMCPt=0;\n    fMCPt=0;\n    fP_TPC=0;\n    fEta.clear();\n    fTheta.clear();\n    fMCTheta.clear();\n    fPhi.clear();\n    fMCPhi.clear();\n    fIDTracks.clear();\n    fCharge.clear();\n    fCPA=0;\n    fOrigin=AliFemtoDreamBasePart::kUnknown;\n    \/\/we don't want to reset the fPDGCode\n    fMCPDGCode=0;\n    fPDGMotherWeak=0;\n    \/\/we don't want to reset isMC\n    fUse=false;\n    fIsSet=true;\n    fIsReset=true;\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ $Id: AliAnalysisTaskEmcalJet.cxx 56756 2012-05-30 05:03:02Z loizides $\n\/\/\n\/\/ Emcal jet analysis base task.\n\/\/\n\/\/ Author: S.Aiola\n\n#include \"AliAnalysisTaskEmcalJet.h\"\n\n#include <TChain.h>\n#include <TClonesArray.h>\n#include <TList.h>\n#include <TObject.h>\n\n#include \"AliAnalysisManager.h\"\n#include \"AliCentrality.h\"\n#include \"AliEMCALGeometry.h\"\n#include \"AliESDEvent.h\"\n#include \"AliEmcalJet.h\"\n#include \"AliLog.h\"\n#include \"AliVCluster.h\"\n#include \"AliVEventHandler.h\"\n#include \"AliVParticle.h\"\n\nClassImp(AliAnalysisTaskEmcalJet)\n\n\/\/________________________________________________________________________\nAliAnalysisTaskEmcalJet::AliAnalysisTaskEmcalJet() : \n  AliAnalysisTaskEmcal(\"AliAnalysisTaskEmcalJet\"),\n  fJetRadius(0.4),\n  fJetsName(\"Jets\"),\n  fPtBiasJetTrack(10),\n  fPtBiasJetClus(10),\n  fJetPtCut(1),\n  fJetAreaCut(0.2),\n  fMinEta(-0.9),\n  fMaxEta(0.9),\n  fMinPhi(-10),\n  fMaxPhi(10),\n  fMaxClusterPt(100),\n  fMaxTrackPt(100),\n  fJets(0)\n{\n  \/\/ Default constructor.\n}\n\n\/\/________________________________________________________________________\nAliAnalysisTaskEmcalJet::AliAnalysisTaskEmcalJet(const char *name, Bool_t histo) : \n  AliAnalysisTaskEmcal(name, histo),\n  fJetRadius(0.4),\n  fJetsName(\"Jets\"),\n  fPtBiasJetTrack(10),\n  fPtBiasJetClus(10),\n  fJetPtCut(1),\n  fJetAreaCut(0.2),\n  fMinEta(-0.9),\n  fMaxEta(0.9),\n  fMinPhi(-10),\n  fMaxPhi(10),\n  fMaxClusterPt(100),\n  fMaxTrackPt(100),\n  fJets(0)\n{\n  \/\/ Standard constructor.\n}\n\n\/\/________________________________________________________________________\nAliAnalysisTaskEmcalJet::~AliAnalysisTaskEmcalJet()\n{\n  \/\/ Destructor\n}\n\n\/\/________________________________________________________________________\nBool_t AliAnalysisTaskEmcalJet::AcceptBiasJet(AliEmcalJet *jet) const\n{ \n  \/\/ Accept jet with a bias.\n\n  if (jet->MaxTrackPt() < fPtBiasJetTrack && (fAnaType == kTPC || jet->MaxClusterPt() < fPtBiasJetClus))\n    return kFALSE;\n  else\n    return kTRUE;\n}\n\n\/\/________________________________________________________________________\nBool_t AliAnalysisTaskEmcalJet::AcceptJet(AliEmcalJet *jet, Bool_t bias, Bool_t upCut) const\n{   \n  \/\/ Return true if jet is accepted.\n\n  if (jet->Pt() <= fJetPtCut)\n    return kFALSE;\n  if (jet->Area() <= fJetAreaCut)\n    return kFALSE;\n  if (bias && !AcceptBiasJet(jet))\n    return kFALSE;\n  if (upCut && (jet->MaxTrackPt() > fMaxTrackPt || jet->MaxClusterPt() > fMaxClusterPt))\n    return kFALSE;\n\n  return (Bool_t)(jet->Eta() > fMinEta && jet->Eta() < fMaxEta && jet->Phi() > fMinPhi && jet->Phi() < fMaxPhi);\n}\n\n\/\/________________________________________________________________________\nvoid AliAnalysisTaskEmcalJet::Init()\n{\n  \/\/ Init the analysis.\n\n  AliAnalysisTaskEmcal::Init();\n\n  if (fAnaType == kTPC) {\n    SetEtaLimits(-0.9 + fJetRadius, 0.9 - fJetRadius);\n    SetPhiLimits(-10, 10);\n  } else if (fAnaType == kEMCAL) {\n    AliEMCALGeometry *geom = AliEMCALGeometry::GetInstance();\n    if (!geom) {\n      AliFatal(Form(\"%s: Can not create geometry\", GetName()));\n      return;\n    }\n    SetEtaLimits(geom->GetArm1EtaMin() + fJetRadius, geom->GetArm1EtaMax() - fJetRadius);\n    SetPhiLimits(geom->GetArm1PhiMin() * TMath::DegToRad() + fJetRadius, geom->GetArm1PhiMax() * TMath::DegToRad() - fJetRadius);\n  } else {\n    AliWarning(Form(\"%s: Analysis type not recognized! Assuming kTPC!\", GetName()));\n    SetAnaType(kTPC);\n  }\n\n  SetInitialized();\n}\n\n\/\/________________________________________________________________________\nBool_t AliAnalysisTaskEmcalJet::IsJetCluster(AliEmcalJet* jet, Int_t iclus, Bool_t sorted) const\n{\n  \/\/ Return true if cluster is in jet.\n\n  for (Int_t i = 0; i < jet->GetNumberOfClusters(); ++i) {\n    Int_t ijetclus = jet->ClusterAt(i);\n    if (sorted && ijetclus > iclus)\n      return kFALSE;\n    if (ijetclus == iclus)\n      return kTRUE;\n  }\n  return kFALSE;\n}\n\n\/\/________________________________________________________________________\nBool_t AliAnalysisTaskEmcalJet::IsJetTrack(AliEmcalJet* jet, Int_t itrack, Bool_t sorted) const\n{\n  \/\/ Return true if track is in jet.\n\n  for (Int_t i = 0; i < jet->GetNumberOfTracks(); ++i) {\n    Int_t ijettrack = jet->TrackAt(i);\n    if (sorted && ijettrack > itrack)\n      return kFALSE;\n    if (ijettrack == itrack)\n      return kTRUE;\n  }\n  return kFALSE;\n}\n\n\/\/________________________________________________________________________\nBool_t AliAnalysisTaskEmcalJet::RetrieveEventObjects()\n{\n  \/\/ Retrieve objects from event.\n\n  if (!AliAnalysisTaskEmcal::RetrieveEventObjects())\n    return kFALSE;\n\n  if (!fJetsName.IsNull() && !fJets) {\n    fJets = dynamic_cast<TClonesArray*>(InputEvent()->FindListObject(fJetsName));\n    if (!fJets) {\n      AliWarning(Form(\"%s: Could not retrieve jets %s!\", GetName(), fJetsName.Data())); \n    }\n  }\n\n  return kTRUE;\n}\n<commit_msg>Commenting out non-implemented method<commit_after>\/\/ $Id: AliAnalysisTaskEmcalJet.cxx 56756 2012-05-30 05:03:02Z loizides $\n\/\/\n\/\/ Emcal jet analysis base task.\n\/\/\n\/\/ Author: S.Aiola\n\n#include \"AliAnalysisTaskEmcalJet.h\"\n\n#include <TChain.h>\n#include <TClonesArray.h>\n#include <TList.h>\n#include <TObject.h>\n\n#include \"AliAnalysisManager.h\"\n#include \"AliCentrality.h\"\n#include \"AliEMCALGeometry.h\"\n#include \"AliESDEvent.h\"\n#include \"AliEmcalJet.h\"\n#include \"AliLog.h\"\n#include \"AliVCluster.h\"\n#include \"AliVEventHandler.h\"\n#include \"AliVParticle.h\"\n\nClassImp(AliAnalysisTaskEmcalJet)\n\n\/\/________________________________________________________________________\nAliAnalysisTaskEmcalJet::AliAnalysisTaskEmcalJet() : \n  AliAnalysisTaskEmcal(\"AliAnalysisTaskEmcalJet\"),\n  fJetRadius(0.4),\n  fJetsName(\"Jets\"),\n  fPtBiasJetTrack(10),\n  fPtBiasJetClus(10),\n  fJetPtCut(1),\n  fJetAreaCut(0.2),\n  fMinEta(-0.9),\n  fMaxEta(0.9),\n  fMinPhi(-10),\n  fMaxPhi(10),\n  fMaxClusterPt(100),\n  fMaxTrackPt(100),\n  fJets(0)\n{\n  \/\/ Default constructor.\n}\n\n\/\/________________________________________________________________________\nAliAnalysisTaskEmcalJet::AliAnalysisTaskEmcalJet(const char *name, Bool_t histo) : \n  AliAnalysisTaskEmcal(name, histo),\n  fJetRadius(0.4),\n  fJetsName(\"Jets\"),\n  fPtBiasJetTrack(10),\n  fPtBiasJetClus(10),\n  fJetPtCut(1),\n  fJetAreaCut(0.2),\n  fMinEta(-0.9),\n  fMaxEta(0.9),\n  fMinPhi(-10),\n  fMaxPhi(10),\n  fMaxClusterPt(100),\n  fMaxTrackPt(100),\n  fJets(0)\n{\n  \/\/ Standard constructor.\n}\n\n\/\/________________________________________________________________________\nAliAnalysisTaskEmcalJet::~AliAnalysisTaskEmcalJet()\n{\n  \/\/ Destructor\n}\n\n\/\/________________________________________________________________________\nBool_t AliAnalysisTaskEmcalJet::AcceptBiasJet(AliEmcalJet *jet) const\n{ \n  \/\/ Accept jet with a bias.\n\n  if (jet->MaxTrackPt() < fPtBiasJetTrack && (fAnaType == kTPC || jet->MaxClusterPt() < fPtBiasJetClus))\n    return kFALSE;\n  else\n    return kTRUE;\n}\n\n\/\/________________________________________________________________________\nBool_t AliAnalysisTaskEmcalJet::AcceptJet(AliEmcalJet *jet, Bool_t bias, Bool_t upCut) const\n{   \n  \/\/ Return true if jet is accepted.\n\n  if (jet->Pt() <= fJetPtCut)\n    return kFALSE;\n  if (jet->Area() <= fJetAreaCut)\n    return kFALSE;\n  if (bias && !AcceptBiasJet(jet))\n    return kFALSE;\n  if (upCut && (jet->MaxTrackPt() > fMaxTrackPt || jet->MaxClusterPt() > fMaxClusterPt))\n    return kFALSE;\n\n  return (Bool_t)(jet->Eta() > fMinEta && jet->Eta() < fMaxEta && jet->Phi() > fMinPhi && jet->Phi() < fMaxPhi);\n}\n\n\/\/________________________________________________________________________\nvoid AliAnalysisTaskEmcalJet::Init()\n{\n  \/\/ Init the analysis.\n\n  AliAnalysisTaskEmcal::Init();\n\n  if (fAnaType == kTPC) {\n    SetEtaLimits(-0.9 + fJetRadius, 0.9 - fJetRadius);\n    SetPhiLimits(-10, 10);\n  } else if (fAnaType == kEMCAL) {\n    AliEMCALGeometry *geom = AliEMCALGeometry::GetInstance();\n    if (!geom) {\n      AliFatal(Form(\"%s: Can not create geometry\", GetName()));\n      return;\n    }\n    SetEtaLimits(geom->GetArm1EtaMin() + fJetRadius, geom->GetArm1EtaMax() - fJetRadius);\n    SetPhiLimits(geom->GetArm1PhiMin() * TMath::DegToRad() + fJetRadius, geom->GetArm1PhiMax() * TMath::DegToRad() - fJetRadius);\n  } else {\n    AliWarning(Form(\"%s: Analysis type not recognized! Assuming kTPC!\", GetName()));\n    SetAnaType(kTPC);\n  }\n\n  \/\/  SetInitialized();\n}\n\n\/\/________________________________________________________________________\nBool_t AliAnalysisTaskEmcalJet::IsJetCluster(AliEmcalJet* jet, Int_t iclus, Bool_t sorted) const\n{\n  \/\/ Return true if cluster is in jet.\n\n  for (Int_t i = 0; i < jet->GetNumberOfClusters(); ++i) {\n    Int_t ijetclus = jet->ClusterAt(i);\n    if (sorted && ijetclus > iclus)\n      return kFALSE;\n    if (ijetclus == iclus)\n      return kTRUE;\n  }\n  return kFALSE;\n}\n\n\/\/________________________________________________________________________\nBool_t AliAnalysisTaskEmcalJet::IsJetTrack(AliEmcalJet* jet, Int_t itrack, Bool_t sorted) const\n{\n  \/\/ Return true if track is in jet.\n\n  for (Int_t i = 0; i < jet->GetNumberOfTracks(); ++i) {\n    Int_t ijettrack = jet->TrackAt(i);\n    if (sorted && ijettrack > itrack)\n      return kFALSE;\n    if (ijettrack == itrack)\n      return kTRUE;\n  }\n  return kFALSE;\n}\n\n\/\/________________________________________________________________________\nBool_t AliAnalysisTaskEmcalJet::RetrieveEventObjects()\n{\n  \/\/ Retrieve objects from event.\n\n  if (!AliAnalysisTaskEmcal::RetrieveEventObjects())\n    return kFALSE;\n\n  if (!fJetsName.IsNull() && !fJets) {\n    fJets = dynamic_cast<TClonesArray*>(InputEvent()->FindListObject(fJetsName));\n    if (!fJets) {\n      AliWarning(Form(\"%s: Could not retrieve jets %s!\", GetName(), fJetsName.Data())); \n    }\n  }\n\n  return kTRUE;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  Copyright (c) 2014, 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\n\/\/        copyright notice, this list of conditions and the following\n\/\/        disclaimer.\n\/\/\n\/\/      * Redistributions in binary form must reproduce the above\n\/\/        copyright notice, this list of conditions and the following\n\/\/        disclaimer in the documentation and\/or other materials provided with\n\/\/        the distribution.\n\/\/\n\/\/      * Neither the name of John Haddon nor the names of\n\/\/        any other contributors to this software may be used to endorse or\n\/\/        promote products derived from this software without specific prior\n\/\/        written permission.\n\/\/\n\/\/  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n\/\/  IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\n\/\/  THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n\/\/  PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n\/\/  CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\/\/  EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/  PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\/\/  PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\/\/  LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/  NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"boost\/python.hpp\"\n\n#include \"IECorePython\/StringAlgoBinding.h\"\n\n#include \"IECore\/StringAlgo.h\"\n\n#include \"boost\/python\/suite\/indexing\/container_utils.hpp\"\n\nusing namespace boost::python;\nusing namespace IECore;\n\nnamespace\n{\n\nbool matchPath( object path, object patternPath )\n{\n\tstd::vector<InternedString> p, pp;\n\tboost::python::container_utils::extend_container( p, path );\n\tboost::python::container_utils::extend_container( pp, patternPath );\n\treturn StringAlgo::match( p, pp );\n}\n\nlist matchPatternPath( const std::string &path, char separator )\n{\n\tStringAlgo::MatchPatternPath p = StringAlgo::matchPatternPath( path, separator );\n\tlist result;\n\tfor( const auto &x : p )\n\t{\n\t\tresult.append( x.c_str() );\n\t}\n\treturn result;\n}\n\n} \/\/ namespace\n\nvoid IECorePython::bindStringAlgo()\n{\n\tobject module( borrowed( PyImport_AddModule( \"IECore.StringAlgo\" ) ) );\n\tscope().attr( \"StringAlgo\" ) = module;\n\tscope moduleScope( module );\n\n\tdef( \"match\", &matchPath );\n\tdef( \"match\", (bool (*)( const char *, const char * ))&IECore::StringAlgo::match );\n\tdef( \"matchMultiple\", (bool (*)( const char *, const char * ))&IECore::StringAlgo::matchMultiple );\n\tdef( \"hasWildcards\", (bool (*)( const char * ))&IECore::StringAlgo::hasWildcards );\n\tdef( \"matchPatternPath\", &matchPatternPath, ( arg( \"patternPath\" ), arg( \"separator\" ) = '\/' ) );\n}\n<commit_msg>IECorePython : Bind StringAlgo substitution functions<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  Copyright (c) 2014, 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\n\/\/        copyright notice, this list of conditions and the following\n\/\/        disclaimer.\n\/\/\n\/\/      * Redistributions in binary form must reproduce the above\n\/\/        copyright notice, this list of conditions and the following\n\/\/        disclaimer in the documentation and\/or other materials provided with\n\/\/        the distribution.\n\/\/\n\/\/      * Neither the name of John Haddon nor the names of\n\/\/        any other contributors to this software may be used to endorse or\n\/\/        promote products derived from this software without specific prior\n\/\/        written permission.\n\/\/\n\/\/  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n\/\/  IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\n\/\/  THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n\/\/  PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n\/\/  CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\/\/  EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/  PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\/\/  PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\/\/  LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/  NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"boost\/python.hpp\"\n\n#include \"IECorePython\/StringAlgoBinding.h\"\n\n#include \"IECore\/CompoundData.h\"\n#include \"IECore\/StringAlgo.h\"\n\n#include \"boost\/python\/suite\/indexing\/container_utils.hpp\"\n\nusing namespace boost::python;\nusing namespace IECore;\n\nnamespace\n{\n\nbool matchPath( object path, object patternPath )\n{\n\tstd::vector<InternedString> p, pp;\n\tboost::python::container_utils::extend_container( p, path );\n\tboost::python::container_utils::extend_container( pp, patternPath );\n\treturn StringAlgo::match( p, pp );\n}\n\nlist matchPatternPath( const std::string &path, char separator )\n{\n\tStringAlgo::MatchPatternPath p = StringAlgo::matchPatternPath( path, separator );\n\tlist result;\n\tfor( const auto &x : p )\n\t{\n\t\tresult.append( x.c_str() );\n\t}\n\treturn result;\n}\n\nstruct VariableProviderWrapper : StringAlgo::VariableProvider, wrapper<StringAlgo::VariableProvider>\n{\n\n\tvirtual int frame() const\n\t{\n\t\treturn this->get_override( \"frame\" )();\n\t}\n\n\tvirtual const std::string &variable( const boost::string_view &name, bool &recurse ) const\n\t{\n\t\tobject result = this->get_override( \"variable\" )( std::string( name ) );\n\t\textract<tuple> tupleExtractor( result );\n\t\tif( tupleExtractor.check() )\n\t\t{\n\t\t\ttuple t = tupleExtractor();\n\t\t\tm_convertedString = extract<std::string>( t[0] );\n\t\t\trecurse = extract<bool>( t[1] );\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_convertedString = extract<std::string>( result );\n\t\t}\n\t\treturn m_convertedString;\n\t}\n\n\tprivate :\n\n\t\tmutable std::string m_convertedString;\n\n};\n\nstd::string substituteWrapper1( const std::string &input, ConstCompoundDataPtr variables, unsigned substitutions )\n{\n\treturn StringAlgo::substitute( input, variables.get(), substitutions );\n}\n\nstd::string substituteWrapper2( const std::string &input, const StringAlgo::VariableProvider &variables, unsigned substitutions )\n{\n\treturn StringAlgo::substitute( input, variables, substitutions );\n}\n\n} \/\/ namespace\n\nvoid IECorePython::bindStringAlgo()\n{\n\tobject module( borrowed( PyImport_AddModule( \"IECore.StringAlgo\" ) ) );\n\tscope().attr( \"StringAlgo\" ) = module;\n\tscope moduleScope( module );\n\n\tdef( \"match\", &matchPath );\n\tdef( \"match\", (bool (*)( const char *, const char * ))&IECore::StringAlgo::match );\n\tdef( \"matchMultiple\", (bool (*)( const char *, const char * ))&IECore::StringAlgo::matchMultiple );\n\tdef( \"hasWildcards\", (bool (*)( const char * ))&IECore::StringAlgo::hasWildcards );\n\tdef( \"matchPatternPath\", &matchPatternPath, ( arg( \"patternPath\" ), arg( \"separator\" ) = '\/' ) );\n\n\tenum_<StringAlgo::Substitutions>( \"Substitutions\" )\n\t\t.value( \"NoSubstitutions\", StringAlgo::NoSubstitutions )\n\t\t.value( \"FrameSubstitutions\", StringAlgo::FrameSubstitutions )\n\t\t.value( \"VariableSubstitutions\", StringAlgo::VariableSubstitutions )\n\t\t.value( \"EscapeSubstitutions\", StringAlgo::EscapeSubstitutions )\n\t\t.value( \"TildeSubstitutions\", StringAlgo::TildeSubstitutions )\n\t\t.value( \"AllSubstitutions\", StringAlgo::AllSubstitutions )\n\t;\n\n\tclass_<VariableProviderWrapper, boost::noncopyable>( \"VariableProvider\" );\n\n\tdef( \"substitute\", &substituteWrapper1, ( arg( \"input\" ), arg( \"variables\" ), arg( \"substitutions\" ) = StringAlgo::AllSubstitutions ) );\n\tdef( \"substitute\", &substituteWrapper2, ( arg( \"input\" ), arg( \"variables\" ), arg( \"substitutions\" ) = StringAlgo::AllSubstitutions ) );\n\tdef( \"substitutions\", &StringAlgo::substitutions );\n\tdef( \"hasSubstitutions\", &StringAlgo::hasSubstitutions );\n\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>BUG: Fixing bug #1037<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>sf::Joystick now handles controllers designated as \"Gamepad\" (Fix #138)<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>FIXES A bug in SystemDisplayDialog iteration over text boxes.<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>[MuLambdaES]: Fixed default mutation<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/===- MachineCopyPropagation.cpp - Machine Copy Propagation Pass ---------===\/\/\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 an extremely simple MachineInstr-level copy propagation pass.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/CodeGen\/Passes.h\"\n#include \"llvm\/ADT\/DenseMap.h\"\n#include \"llvm\/ADT\/SetVector.h\"\n#include \"llvm\/ADT\/SmallVector.h\"\n#include \"llvm\/ADT\/Statistic.h\"\n#include \"llvm\/CodeGen\/MachineFunction.h\"\n#include \"llvm\/CodeGen\/MachineFunctionPass.h\"\n#include \"llvm\/CodeGen\/MachineRegisterInfo.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Target\/TargetInstrInfo.h\"\n#include \"llvm\/Target\/TargetRegisterInfo.h\"\n#include \"llvm\/Target\/TargetSubtargetInfo.h\"\nusing namespace llvm;\n\n#define DEBUG_TYPE \"codegen-cp\"\n\nSTATISTIC(NumDeletes, \"Number of dead copies deleted\");\n\nnamespace {\n  class MachineCopyPropagation : public MachineFunctionPass {\n    const TargetRegisterInfo *TRI;\n    const TargetInstrInfo *TII;\n    MachineRegisterInfo *MRI;\n\n  public:\n    static char ID; \/\/ Pass identification, replacement for typeid\n    MachineCopyPropagation() : MachineFunctionPass(ID) {\n     initializeMachineCopyPropagationPass(*PassRegistry::getPassRegistry());\n    }\n\n    bool runOnMachineFunction(MachineFunction &MF) override;\n\n  private:\n    typedef SmallVector<unsigned, 4> DestList;\n    typedef DenseMap<unsigned, DestList> SourceMap;\n\n    void SourceNoLongerAvailable(unsigned Reg,\n                                 SourceMap &SrcMap,\n                                 DenseMap<unsigned, MachineInstr*> &AvailCopyMap);\n    bool CopyPropagateBlock(MachineBasicBlock &MBB);\n  };\n}\nchar MachineCopyPropagation::ID = 0;\nchar &llvm::MachineCopyPropagationID = MachineCopyPropagation::ID;\n\nINITIALIZE_PASS(MachineCopyPropagation, \"machine-cp\",\n                \"Machine Copy Propagation Pass\", false, false)\n\nvoid\nMachineCopyPropagation::SourceNoLongerAvailable(unsigned Reg,\n                              SourceMap &SrcMap,\n                              DenseMap<unsigned, MachineInstr*> &AvailCopyMap) {\n  for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI) {\n    SourceMap::iterator SI = SrcMap.find(*AI);\n    if (SI != SrcMap.end()) {\n      const DestList& Defs = SI->second;\n      for (DestList::const_iterator I = Defs.begin(), E = Defs.end();\n           I != E; ++I) {\n        unsigned MappedDef = *I;\n        \/\/ Source of copy is no longer available for propagation.\n        AvailCopyMap.erase(MappedDef);\n        for (MCSubRegIterator SR(MappedDef, TRI); SR.isValid(); ++SR)\n          AvailCopyMap.erase(*SR);\n      }\n    }\n  }\n}\n\nstatic bool NoInterveningSideEffect(const MachineInstr *CopyMI,\n                                    const MachineInstr *MI) {\n  const MachineBasicBlock *MBB = CopyMI->getParent();\n  if (MI->getParent() != MBB)\n    return false;\n  MachineBasicBlock::const_iterator I = CopyMI;\n  MachineBasicBlock::const_iterator E = MBB->end();\n  MachineBasicBlock::const_iterator E2 = MI;\n\n  ++I;\n  while (I != E && I != E2) {\n    if (I->hasUnmodeledSideEffects() || I->isCall() ||\n        I->isTerminator())\n      return false;\n    ++I;\n  }\n  return true;\n}\n\n\/\/\/ isNopCopy - Return true if the specified copy is really a nop. That is\n\/\/\/ if the source of the copy is the same of the definition of the copy that\n\/\/\/ supplied the source. If the source of the copy is a sub-register than it\n\/\/\/ must check the sub-indices match. e.g.\n\/\/\/ ecx = mov eax\n\/\/\/ al  = mov cl\n\/\/\/ But not\n\/\/\/ ecx = mov eax\n\/\/\/ al  = mov ch\nstatic bool isNopCopy(MachineInstr *CopyMI, unsigned Def, unsigned Src,\n                      const TargetRegisterInfo *TRI) {\n  unsigned SrcSrc = CopyMI->getOperand(1).getReg();\n  if (Def == SrcSrc)\n    return true;\n  if (TRI->isSubRegister(SrcSrc, Def)) {\n    unsigned SrcDef = CopyMI->getOperand(0).getReg();\n    unsigned SubIdx = TRI->getSubRegIndex(SrcSrc, Def);\n    if (!SubIdx)\n      return false;\n    return SubIdx == TRI->getSubRegIndex(SrcDef, Src);\n  }\n\n  return false;\n}\n\nbool MachineCopyPropagation::CopyPropagateBlock(MachineBasicBlock &MBB) {\n  SmallSetVector<MachineInstr*, 8> MaybeDeadCopies;  \/\/ Candidates for deletion\n  DenseMap<unsigned, MachineInstr*> AvailCopyMap;    \/\/ Def -> available copies map\n  DenseMap<unsigned, MachineInstr*> CopyMap;         \/\/ Def -> copies map\n  SourceMap SrcMap; \/\/ Src -> Def map\n\n  DEBUG(dbgs() << \"MCP: CopyPropagateBlock \" << MBB.getName() << \"\\n\");\n\n  bool Changed = false;\n  for (MachineBasicBlock::iterator I = MBB.begin(), E = MBB.end(); I != E; ) {\n    MachineInstr *MI = &*I;\n    ++I;\n\n    if (MI->isCopy()) {\n      unsigned Def = MI->getOperand(0).getReg();\n      unsigned Src = MI->getOperand(1).getReg();\n\n      assert(!TargetRegisterInfo::isVirtualRegister(Def) &&\n             !TargetRegisterInfo::isVirtualRegister(Src) &&\n             \"MachineCopyPropagation should be run after register allocation!\");\n\n      DenseMap<unsigned, MachineInstr*>::iterator CI = AvailCopyMap.find(Src);\n      if (CI != AvailCopyMap.end()) {\n        MachineInstr *CopyMI = CI->second;\n        if (!MRI->isReserved(Def) &&\n            (!MRI->isReserved(Src) || NoInterveningSideEffect(CopyMI, MI)) &&\n            isNopCopy(CopyMI, Def, Src, TRI)) {\n          \/\/ The two copies cancel out and the source of the first copy\n          \/\/ hasn't been overridden, eliminate the second one. e.g.\n          \/\/  %ECX<def> = COPY %EAX<kill>\n          \/\/  ... nothing clobbered EAX.\n          \/\/  %EAX<def> = COPY %ECX\n          \/\/ =>\n          \/\/  %ECX<def> = COPY %EAX\n          \/\/\n          \/\/ Also avoid eliminating a copy from reserved registers unless the\n          \/\/ definition is proven not clobbered. e.g.\n          \/\/ %RSP<def> = COPY %RAX\n          \/\/ CALL\n          \/\/ %RAX<def> = COPY %RSP\n\n          DEBUG(dbgs() << \"MCP: copy is a NOP, removing: \"; MI->dump());\n\n          \/\/ Clear any kills of Def between CopyMI and MI. This extends the\n          \/\/ live range.\n          for (MachineBasicBlock::iterator I = CopyMI, E = MI; I != E; ++I)\n            I->clearRegisterKills(Def, TRI);\n\n          MI->eraseFromParent();\n          Changed = true;\n          ++NumDeletes;\n          continue;\n        }\n      }\n\n      \/\/ If Src is defined by a previous copy, it cannot be eliminated.\n      for (MCRegAliasIterator AI(Src, TRI, true); AI.isValid(); ++AI) {\n        CI = CopyMap.find(*AI);\n        if (CI != CopyMap.end()) {\n          DEBUG(dbgs() << \"MCP: Copy is no longer dead: \"; CI->second->dump());\n          MaybeDeadCopies.remove(CI->second);\n        }\n      }\n\n      DEBUG(dbgs() << \"MCP: Copy is a deletion candidate: \"; MI->dump());\n\n      \/\/ Copy is now a candidate for deletion.\n      MaybeDeadCopies.insert(MI);\n\n      \/\/ If 'Src' is previously source of another copy, then this earlier copy's\n      \/\/ source is no longer available. e.g.\n      \/\/ %xmm9<def> = copy %xmm2\n      \/\/ ...\n      \/\/ %xmm2<def> = copy %xmm0\n      \/\/ ...\n      \/\/ %xmm2<def> = copy %xmm9\n      SourceNoLongerAvailable(Def, SrcMap, AvailCopyMap);\n\n      \/\/ Remember Def is defined by the copy.\n      \/\/ ... Make sure to clear the def maps of aliases first.\n      for (MCRegAliasIterator AI(Def, TRI, false); AI.isValid(); ++AI) {\n        CopyMap.erase(*AI);\n        AvailCopyMap.erase(*AI);\n      }\n      for (MCSubRegIterator SR(Def, TRI, \/*IncludeSelf=*\/true); SR.isValid();\n           ++SR) {\n        CopyMap[*SR] = MI;\n        AvailCopyMap[*SR] = MI;\n      }\n\n      \/\/ Remember source that's copied to Def. Once it's clobbered, then\n      \/\/ it's no longer available for copy propagation.\n      if (std::find(SrcMap[Src].begin(), SrcMap[Src].end(), Def) ==\n          SrcMap[Src].end()) {\n        SrcMap[Src].push_back(Def);\n      }\n\n      continue;\n    }\n\n    \/\/ Not a copy.\n    SmallVector<unsigned, 2> Defs;\n    int RegMaskOpNum = -1;\n    for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {\n      MachineOperand &MO = MI->getOperand(i);\n      if (MO.isRegMask())\n        RegMaskOpNum = i;\n      if (!MO.isReg())\n        continue;\n      unsigned Reg = MO.getReg();\n      if (!Reg)\n        continue;\n\n      assert(!TargetRegisterInfo::isVirtualRegister(Reg) &&\n             \"MachineCopyPropagation should be run after register allocation!\");\n\n      if (MO.isDef()) {\n        Defs.push_back(Reg);\n        continue;\n      }\n\n      \/\/ If 'Reg' is defined by a copy, the copy is no longer a candidate\n      \/\/ for elimination.\n      for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI) {\n        DenseMap<unsigned, MachineInstr*>::iterator CI = CopyMap.find(*AI);\n        if (CI != CopyMap.end()) {\n          DEBUG(dbgs() << \"MCP: Copy is used - not dead: \"; CI->second->dump());\n          MaybeDeadCopies.remove(CI->second);\n        }\n      }\n      \/\/ Treat undef use like defs for copy propagation but not for\n      \/\/ dead copy. We would need to do a liveness check to be sure the copy\n      \/\/ is dead for undef uses.\n      \/\/ The backends are allowed to do whatever they want with undef value\n      \/\/ and we cannot be sure this register will not be rewritten to break\n      \/\/ some false dependencies for the hardware for instance.\n      if (MO.isUndef())\n        Defs.push_back(Reg);\n    }\n\n    \/\/ The instruction has a register mask operand which means that it clobbers\n    \/\/ a large set of registers.  It is possible to use the register mask to\n    \/\/ prune the available copies, but treat it like a basic block boundary for\n    \/\/ now.\n    if (RegMaskOpNum >= 0) {\n      \/\/ Erase any MaybeDeadCopies whose destination register is clobbered.\n      const MachineOperand &MaskMO = MI->getOperand(RegMaskOpNum);\n      for (SmallSetVector<MachineInstr*, 8>::iterator\n           DI = MaybeDeadCopies.begin(), DE = MaybeDeadCopies.end();\n           DI != DE; ++DI) {\n        unsigned Reg = (*DI)->getOperand(0).getReg();\n        if (MRI->isReserved(Reg) || !MaskMO.clobbersPhysReg(Reg))\n          continue;\n        DEBUG(dbgs() << \"MCP: Removing copy due to regmask clobbering: \";\n              (*DI)->dump());\n        (*DI)->eraseFromParent();\n        Changed = true;\n        ++NumDeletes;\n      }\n\n      \/\/ Clear all data structures as if we were beginning a new basic block.\n      MaybeDeadCopies.clear();\n      AvailCopyMap.clear();\n      CopyMap.clear();\n      SrcMap.clear();\n      continue;\n    }\n\n    for (unsigned i = 0, e = Defs.size(); i != e; ++i) {\n      unsigned Reg = Defs[i];\n\n      \/\/ No longer defined by a copy.\n      for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI) {\n        CopyMap.erase(*AI);\n        AvailCopyMap.erase(*AI);\n      }\n\n      \/\/ If 'Reg' is previously source of a copy, it is no longer available for\n      \/\/ copy propagation.\n      SourceNoLongerAvailable(Reg, SrcMap, AvailCopyMap);\n    }\n  }\n\n  \/\/ If MBB doesn't have successors, delete the copies whose defs are not used.\n  \/\/ If MBB does have successors, then conservative assume the defs are live-out\n  \/\/ since we don't want to trust live-in lists.\n  if (MBB.succ_empty()) {\n    for (SmallSetVector<MachineInstr*, 8>::iterator\n           DI = MaybeDeadCopies.begin(), DE = MaybeDeadCopies.end();\n         DI != DE; ++DI) {\n      if (!MRI->isReserved((*DI)->getOperand(0).getReg())) {\n        (*DI)->eraseFromParent();\n        Changed = true;\n        ++NumDeletes;\n      }\n    }\n  }\n\n  return Changed;\n}\n\nbool MachineCopyPropagation::runOnMachineFunction(MachineFunction &MF) {\n  if (skipOptnoneFunction(*MF.getFunction()))\n    return false;\n\n  bool Changed = false;\n\n  TRI = MF.getSubtarget().getRegisterInfo();\n  TII = MF.getSubtarget().getInstrInfo();\n  MRI = &MF.getRegInfo();\n\n  for (MachineFunction::iterator I = MF.begin(), E = MF.end(); I != E; ++I)\n    Changed |= CopyPropagateBlock(*I);\n\n  return Changed;\n}\n<commit_msg>MachineCopyPropagation: Use ranged for, cleanup; NFC<commit_after>\/\/===- MachineCopyPropagation.cpp - Machine Copy Propagation Pass ---------===\/\/\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 an extremely simple MachineInstr-level copy propagation pass.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/CodeGen\/Passes.h\"\n#include \"llvm\/ADT\/DenseMap.h\"\n#include \"llvm\/ADT\/SetVector.h\"\n#include \"llvm\/ADT\/SmallVector.h\"\n#include \"llvm\/ADT\/Statistic.h\"\n#include \"llvm\/CodeGen\/MachineFunction.h\"\n#include \"llvm\/CodeGen\/MachineFunctionPass.h\"\n#include \"llvm\/CodeGen\/MachineRegisterInfo.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Target\/TargetInstrInfo.h\"\n#include \"llvm\/Target\/TargetRegisterInfo.h\"\n#include \"llvm\/Target\/TargetSubtargetInfo.h\"\nusing namespace llvm;\n\n#define DEBUG_TYPE \"codegen-cp\"\n\nSTATISTIC(NumDeletes, \"Number of dead copies deleted\");\n\nnamespace {\n  class MachineCopyPropagation : public MachineFunctionPass {\n    const TargetRegisterInfo *TRI;\n    const TargetInstrInfo *TII;\n    const MachineRegisterInfo *MRI;\n\n  public:\n    static char ID; \/\/ Pass identification, replacement for typeid\n    MachineCopyPropagation() : MachineFunctionPass(ID) {\n      initializeMachineCopyPropagationPass(*PassRegistry::getPassRegistry());\n    }\n\n    bool runOnMachineFunction(MachineFunction &MF) override;\n\n  private:\n    typedef SmallVector<unsigned, 4> DestList;\n    typedef DenseMap<unsigned, DestList> SourceMap;\n\n    void SourceNoLongerAvailable(unsigned Reg, SourceMap &SrcMap,\n                                 DenseMap<unsigned, MachineInstr*> &AvailCopyMap);\n    bool CopyPropagateBlock(MachineBasicBlock &MBB);\n  };\n}\nchar MachineCopyPropagation::ID = 0;\nchar &llvm::MachineCopyPropagationID = MachineCopyPropagation::ID;\n\nINITIALIZE_PASS(MachineCopyPropagation, \"machine-cp\",\n                \"Machine Copy Propagation Pass\", false, false)\n\nvoid\nMachineCopyPropagation::SourceNoLongerAvailable(unsigned Reg, SourceMap &SrcMap,\n                              DenseMap<unsigned, MachineInstr*> &AvailCopyMap) {\n  for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI) {\n    SourceMap::iterator SI = SrcMap.find(*AI);\n    if (SI != SrcMap.end()) {\n      const DestList& Defs = SI->second;\n      for (unsigned MappedDef : Defs) {\n        \/\/ Source of copy is no longer available for propagation.\n        for (MCSubRegIterator SR(MappedDef, TRI, true); SR.isValid(); ++SR)\n          AvailCopyMap.erase(*SR);\n      }\n    }\n  }\n}\n\nstatic bool NoInterveningSideEffect(const MachineInstr *CopyMI,\n                                    const MachineInstr *MI) {\n  const MachineBasicBlock *MBB = CopyMI->getParent();\n  if (MI->getParent() != MBB)\n    return false;\n\n  for (MachineBasicBlock::const_iterator I = std::next(CopyMI->getIterator()),\n       E = MBB->end(), E2 = MI->getIterator(); I != E && I != E2; ++I) {\n    if (I->hasUnmodeledSideEffects() || I->isCall() ||\n        I->isTerminator())\n      return false;\n  }\n  return true;\n}\n\n\/\/\/ isNopCopy - Return true if the specified copy is really a nop. That is\n\/\/\/ if the source of the copy is the same of the definition of the copy that\n\/\/\/ supplied the source. If the source of the copy is a sub-register than it\n\/\/\/ must check the sub-indices match. e.g.\n\/\/\/ ecx = mov eax\n\/\/\/ al  = mov cl\n\/\/\/ But not\n\/\/\/ ecx = mov eax\n\/\/\/ al  = mov ch\nstatic bool isNopCopy(const MachineInstr *CopyMI, unsigned Def, unsigned Src,\n                      const TargetRegisterInfo *TRI) {\n  unsigned SrcSrc = CopyMI->getOperand(1).getReg();\n  if (Def == SrcSrc)\n    return true;\n  if (TRI->isSubRegister(SrcSrc, Def)) {\n    unsigned SrcDef = CopyMI->getOperand(0).getReg();\n    unsigned SubIdx = TRI->getSubRegIndex(SrcSrc, Def);\n    if (!SubIdx)\n      return false;\n    return SubIdx == TRI->getSubRegIndex(SrcDef, Src);\n  }\n\n  return false;\n}\n\nbool MachineCopyPropagation::CopyPropagateBlock(MachineBasicBlock &MBB) {\n  SmallSetVector<MachineInstr*, 8> MaybeDeadCopies;  \/\/ Candidates for deletion\n  DenseMap<unsigned, MachineInstr*> AvailCopyMap;    \/\/ Def -> available copies map\n  DenseMap<unsigned, MachineInstr*> CopyMap;         \/\/ Def -> copies map\n  SourceMap SrcMap; \/\/ Src -> Def map\n\n  DEBUG(dbgs() << \"MCP: CopyPropagateBlock \" << MBB.getName() << \"\\n\");\n\n  bool Changed = false;\n  for (MachineBasicBlock::iterator I = MBB.begin(), E = MBB.end(); I != E; ) {\n    MachineInstr *MI = &*I;\n    ++I;\n\n    if (MI->isCopy()) {\n      unsigned Def = MI->getOperand(0).getReg();\n      unsigned Src = MI->getOperand(1).getReg();\n\n      assert(!TargetRegisterInfo::isVirtualRegister(Def) &&\n             !TargetRegisterInfo::isVirtualRegister(Src) &&\n             \"MachineCopyPropagation should be run after register allocation!\");\n\n      DenseMap<unsigned, MachineInstr*>::iterator CI = AvailCopyMap.find(Src);\n      if (CI != AvailCopyMap.end()) {\n        MachineInstr *CopyMI = CI->second;\n        if (!MRI->isReserved(Def) &&\n            (!MRI->isReserved(Src) || NoInterveningSideEffect(CopyMI, MI)) &&\n            isNopCopy(CopyMI, Def, Src, TRI)) {\n          \/\/ The two copies cancel out and the source of the first copy\n          \/\/ hasn't been overridden, eliminate the second one. e.g.\n          \/\/  %ECX<def> = COPY %EAX<kill>\n          \/\/  ... nothing clobbered EAX.\n          \/\/  %EAX<def> = COPY %ECX\n          \/\/ =>\n          \/\/  %ECX<def> = COPY %EAX\n          \/\/\n          \/\/ Also avoid eliminating a copy from reserved registers unless the\n          \/\/ definition is proven not clobbered. e.g.\n          \/\/ %RSP<def> = COPY %RAX\n          \/\/ CALL\n          \/\/ %RAX<def> = COPY %RSP\n\n          DEBUG(dbgs() << \"MCP: copy is a NOP, removing: \"; MI->dump());\n\n          \/\/ Clear any kills of Def between CopyMI and MI. This extends the\n          \/\/ live range.\n          for (MachineInstr &MMI\n               : make_range(CopyMI->getIterator(), MI->getIterator()))\n            MMI.clearRegisterKills(Def, TRI);\n\n          MI->eraseFromParent();\n          Changed = true;\n          ++NumDeletes;\n          continue;\n        }\n      }\n\n      \/\/ If Src is defined by a previous copy, it cannot be eliminated.\n      for (MCRegAliasIterator AI(Src, TRI, true); AI.isValid(); ++AI) {\n        CI = CopyMap.find(*AI);\n        if (CI != CopyMap.end()) {\n          DEBUG(dbgs() << \"MCP: Copy is no longer dead: \"; CI->second->dump());\n          MaybeDeadCopies.remove(CI->second);\n        }\n      }\n\n      DEBUG(dbgs() << \"MCP: Copy is a deletion candidate: \"; MI->dump());\n\n      \/\/ Copy is now a candidate for deletion.\n      if (!MRI->isReserved(Def))\n        MaybeDeadCopies.insert(MI);\n\n      \/\/ If 'Src' is previously source of another copy, then this earlier copy's\n      \/\/ source is no longer available. e.g.\n      \/\/ %xmm9<def> = copy %xmm2\n      \/\/ ...\n      \/\/ %xmm2<def> = copy %xmm0\n      \/\/ ...\n      \/\/ %xmm2<def> = copy %xmm9\n      SourceNoLongerAvailable(Def, SrcMap, AvailCopyMap);\n\n      \/\/ Remember Def is defined by the copy.\n      \/\/ ... Make sure to clear the def maps of aliases first.\n      for (MCRegAliasIterator AI(Def, TRI, false); AI.isValid(); ++AI) {\n        CopyMap.erase(*AI);\n        AvailCopyMap.erase(*AI);\n      }\n      for (MCSubRegIterator SR(Def, TRI, \/*IncludeSelf=*\/true); SR.isValid();\n           ++SR) {\n        CopyMap[*SR] = MI;\n        AvailCopyMap[*SR] = MI;\n      }\n\n      \/\/ Remember source that's copied to Def. Once it's clobbered, then\n      \/\/ it's no longer available for copy propagation.\n      SmallVectorImpl<unsigned> &DestList = SrcMap[Src];\n      if (std::find(DestList.begin(), DestList.end(), Def) == DestList.end())\n        DestList.push_back(Def);\n\n      continue;\n    }\n\n    \/\/ Not a copy.\n    SmallVector<unsigned, 2> Defs;\n    const MachineOperand *RegMask = nullptr;\n    for (const MachineOperand &MO : MI->operands()) {\n      if (MO.isRegMask())\n        RegMask = &MO;\n      if (!MO.isReg())\n        continue;\n      unsigned Reg = MO.getReg();\n      if (!Reg)\n        continue;\n\n      assert(!TargetRegisterInfo::isVirtualRegister(Reg) &&\n             \"MachineCopyPropagation should be run after register allocation!\");\n\n      if (MO.isDef()) {\n        Defs.push_back(Reg);\n        continue;\n      }\n\n      \/\/ If 'Reg' is defined by a copy, the copy is no longer a candidate\n      \/\/ for elimination.\n      for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI) {\n        DenseMap<unsigned, MachineInstr*>::iterator CI = CopyMap.find(*AI);\n        if (CI != CopyMap.end()) {\n          DEBUG(dbgs() << \"MCP: Copy is used - not dead: \"; CI->second->dump());\n          MaybeDeadCopies.remove(CI->second);\n        }\n      }\n      \/\/ Treat undef use like defs for copy propagation but not for\n      \/\/ dead copy. We would need to do a liveness check to be sure the copy\n      \/\/ is dead for undef uses.\n      \/\/ The backends are allowed to do whatever they want with undef value\n      \/\/ and we cannot be sure this register will not be rewritten to break\n      \/\/ some false dependencies for the hardware for instance.\n      if (MO.isUndef())\n        Defs.push_back(Reg);\n    }\n\n    \/\/ The instruction has a register mask operand which means that it clobbers\n    \/\/ a large set of registers.  It is possible to use the register mask to\n    \/\/ prune the available copies, but treat it like a basic block boundary for\n    \/\/ now.\n    if (RegMask) {\n      \/\/ Erase any MaybeDeadCopies whose destination register is clobbered.\n      for (MachineInstr *MaybeDead : MaybeDeadCopies) {\n        unsigned Reg = MaybeDead->getOperand(0).getReg();\n        assert(!MRI->isReserved(Reg));\n        if (!RegMask->clobbersPhysReg(Reg))\n          continue;\n        DEBUG(dbgs() << \"MCP: Removing copy due to regmask clobbering: \";\n              MaybeDead->dump());\n        MaybeDead->eraseFromParent();\n        Changed = true;\n        ++NumDeletes;\n      }\n\n      \/\/ Clear all data structures as if we were beginning a new basic block.\n      MaybeDeadCopies.clear();\n      AvailCopyMap.clear();\n      CopyMap.clear();\n      SrcMap.clear();\n      continue;\n    }\n\n    for (unsigned Reg : Defs) {\n      \/\/ No longer defined by a copy.\n      for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI) {\n        CopyMap.erase(*AI);\n        AvailCopyMap.erase(*AI);\n      }\n\n      \/\/ If 'Reg' is previously source of a copy, it is no longer available for\n      \/\/ copy propagation.\n      SourceNoLongerAvailable(Reg, SrcMap, AvailCopyMap);\n    }\n  }\n\n  \/\/ If MBB doesn't have successors, delete the copies whose defs are not used.\n  \/\/ If MBB does have successors, then conservative assume the defs are live-out\n  \/\/ since we don't want to trust live-in lists.\n  if (MBB.succ_empty()) {\n    for (MachineInstr *MaybeDead : MaybeDeadCopies) {\n      assert(!MRI->isReserved(MaybeDead->getOperand(0).getReg()));\n      MaybeDead->eraseFromParent();\n      Changed = true;\n      ++NumDeletes;\n    }\n  }\n\n  return Changed;\n}\n\nbool MachineCopyPropagation::runOnMachineFunction(MachineFunction &MF) {\n  if (skipOptnoneFunction(*MF.getFunction()))\n    return false;\n\n  bool Changed = false;\n\n  TRI = MF.getSubtarget().getRegisterInfo();\n  TII = MF.getSubtarget().getInstrInfo();\n  MRI = &MF.getRegInfo();\n\n  for (MachineBasicBlock &MBB : MF)\n    Changed |= CopyPropagateBlock(MBB);\n\n  return Changed;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- Emitter.cpp - Write machine code to executable memory -------------===\/\/\n\/\/\n\/\/ This file defines a MachineCodeEmitter object that is used by Jello to write\n\/\/ machine code to memory and remember where relocatable values lie.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"VM.h\"\n#include \"Config\/sys\/mman.h\"\n#include \"llvm\/CodeGen\/MachineCodeEmitter.h\"\n#include \"llvm\/CodeGen\/MachineFunction.h\"\n#include \"llvm\/CodeGen\/MachineConstantPool.h\"\n#include \"llvm\/Target\/TargetData.h\"\n#include \"llvm\/Module.h\"\n#include \"Support\/Statistic.h\"\n#include <stdio.h>\n\nnamespace {\n  Statistic<> NumBytes(\"jello\", \"Number of bytes of machine code compiled\");\n  VM *TheVM = 0;\n\n  class Emitter : public MachineCodeEmitter {\n    \/\/ CurBlock - The start of the current block of memory.  CurByte - The\n    \/\/ current byte being emitted to.\n    unsigned char *CurBlock, *CurByte;\n\n    \/\/ When outputting a function stub in the context of some other function, we\n    \/\/ save CurBlock and CurByte here.\n    unsigned char *SavedCurBlock, *SavedCurByte;\n\n    \/\/ ConstantPoolAddresses - Contains the location for each entry in the\n    \/\/ constant pool.\n    std::vector<void*> ConstantPoolAddresses;\n  public:\n    Emitter(VM &vm) { TheVM = &vm; }\n\n    virtual void startFunction(MachineFunction &F);\n    virtual void finishFunction(MachineFunction &F);\n    virtual void emitConstantPool(MachineConstantPool *MCP);\n    virtual void startFunctionStub(const Function &F, unsigned StubSize);\n    virtual void* finishFunctionStub(const Function &F);\n    virtual void emitByte(unsigned char B);\n    virtual void emitWord(unsigned W);\n\n    virtual uint64_t getGlobalValueAddress(GlobalValue *V);\n    virtual uint64_t getGlobalValueAddress(const std::string &Name);\n    virtual uint64_t getConstantPoolEntryAddress(unsigned Entry);\n    virtual uint64_t getCurrentPCValue();\n\n    \/\/ forceCompilationOf - Force the compilation of the specified function, and\n    \/\/ return its address, because we REALLY need the address now.\n    \/\/\n    \/\/ FIXME: This is JIT specific!\n    \/\/\n    virtual uint64_t forceCompilationOf(Function *F);\n  };\n}\n\nMachineCodeEmitter *VM::createEmitter(VM &V) {\n  return new Emitter(V);\n}\n\n\n#define _POSIX_MAPPED_FILES\n#include <unistd.h>\n#include <sys\/mman.h>\n\n\/\/ FIXME: This should be rewritten to support a real memory manager for\n\/\/ executable memory pages!\nstatic void *getMemory(unsigned NumPages) {\n  void *pa;\n  if (NumPages == 0) return 0;\n  static const long pageSize = sysconf(_SC_PAGESIZE);\n\n#if defined(i386) || defined(__i386__) || defined(__x86__)\n  \/* Linux and *BSD tend to have these flags named differently. *\/\n#if defined(MAP_ANON) && !defined(MAP_ANONYMOUS)\n# define MAP_ANONYMOUS MAP_ANON\n#endif\n  pa = mmap(0, pageSize*NumPages, PROT_READ|PROT_WRITE|PROT_EXEC,\n            MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);  \/* fd = 0  *\/\n#elif defined(sparc) || defined(__sparc__) || defined(__sparcv9)\n  static unsigned long Counter = 0;\n  pa = mmap((void*)(0x140000000UL+Counter), pageSize*NumPages,\n            PROT_READ|PROT_WRITE|PROT_EXEC,\n            MAP_PRIVATE|MAP_ANONYMOUS|MAP_FIXED, -1, 0); \/* fd = -1 *\/\n  Counter += pageSize*NumPages;\n#else\n  std::cerr << \"This architecture is not supported by the JIT\\n\";\n  abort();\n#endif\n\n  if (pa == MAP_FAILED) {\n    perror(\"mmap\");\n    abort();\n  }\n  return pa;\n}\n\n\nvoid Emitter::startFunction(MachineFunction &F) {\n  CurBlock = (unsigned char *)getMemory(16);\n  CurByte = CurBlock;  \/\/ Start writing at the beginning of the fn.\n  TheVM->addGlobalMapping(F.getFunction(), CurBlock);\n}\n\nvoid Emitter::finishFunction(MachineFunction &F) {\n  ConstantPoolAddresses.clear();\n  NumBytes += CurByte-CurBlock;\n\n  DEBUG(std::cerr << \"Finished CodeGen of [\" << (void*)CurBlock\n                  << \"] Function: \" << F.getFunction()->getName()\n                  << \": \" << CurByte-CurBlock << \" bytes of text\\n\");\n}\n\nvoid Emitter::emitConstantPool(MachineConstantPool *MCP) {\n  const std::vector<Constant*> &Constants = MCP->getConstants();\n  for (unsigned i = 0, e = Constants.size(); i != e; ++i) {\n    \/\/ For now we just allocate some memory on the heap, this can be\n    \/\/ dramatically improved.\n    const Type *Ty = ((Value*)Constants[i])->getType();\n    void *Addr = malloc(TheVM->getTargetData().getTypeSize(Ty));\n    TheVM->InitializeMemory(Constants[i], Addr);\n    ConstantPoolAddresses.push_back(Addr);\n  }\n}\n\nvoid Emitter::startFunctionStub(const Function &F, unsigned StubSize) {\n  static const long pageSize = sysconf(_SC_PAGESIZE);\n  SavedCurBlock = CurBlock;  SavedCurByte = CurByte;\n  \/\/ FIXME: this is a huge waste of memory.\n  CurBlock = (unsigned char *)getMemory((StubSize+pageSize-1)\/pageSize);\n  CurByte = CurBlock;  \/\/ Start writing at the beginning of the fn.\n}\n\nvoid *Emitter::finishFunctionStub(const Function &F) {\n  NumBytes += CurByte-CurBlock;\n  DEBUG(std::cerr << \"Finished CodeGen of [0x\" << std::hex\n                  << (unsigned)(intptr_t)CurBlock\n                  << std::dec << \"] Function stub for: \" << F.getName()\n                  << \": \" << CurByte-CurBlock << \" bytes of text\\n\");\n  std::swap(CurBlock, SavedCurBlock);\n  CurByte = SavedCurByte;\n  return SavedCurBlock;\n}\n\nvoid Emitter::emitByte(unsigned char B) {\n  *CurByte++ = B;   \/\/ Write the byte to memory\n}\n\nvoid Emitter::emitWord(unsigned W) {\n  \/\/ FIXME: This won't work if the endianness of the host and target don't\n  \/\/ agree!  (For a JIT this can't happen though.  :)\n  *(unsigned*)CurByte = W;\n  CurByte += sizeof(unsigned);\n}\n\n\nuint64_t Emitter::getGlobalValueAddress(GlobalValue *V) {\n  \/\/ Try looking up the function to see if it is already compiled, if not return\n  \/\/ 0.\n  return (intptr_t)TheVM->getPointerToGlobalIfAvailable(V);\n}\nuint64_t Emitter::getGlobalValueAddress(const std::string &Name) {\n  return (intptr_t)TheVM->getPointerToNamedFunction(Name);\n}\n\n\/\/ getConstantPoolEntryAddress - Return the address of the 'ConstantNum' entry\n\/\/ in the constant pool that was last emitted with the 'emitConstantPool'\n\/\/ method.\n\/\/\nuint64_t Emitter::getConstantPoolEntryAddress(unsigned ConstantNum) {\n  assert(ConstantNum < ConstantPoolAddresses.size() &&\n\t \"Invalid ConstantPoolIndex!\");\n  return (intptr_t)ConstantPoolAddresses[ConstantNum];\n}\n\n\/\/ getCurrentPCValue - This returns the address that the next emitted byte\n\/\/ will be output to.\n\/\/\nuint64_t Emitter::getCurrentPCValue() {\n  return (intptr_t)CurByte;\n}\n\nuint64_t Emitter::forceCompilationOf(Function *F) {\n  return (intptr_t)TheVM->getPointerToFunction(F);\n}\n\n\/\/ getPointerToNamedFunction - This function is used as a global wrapper to\n\/\/ VM::getPointerToNamedFunction for the purpose of resolving symbols when\n\/\/ bugpoint is debugging the JIT. In that scenario, we are loading an .so and\n\/\/ need to resolve function(s) that are being mis-codegenerated, so we need to\n\/\/ resolve their addresses at runtime, and this is the way to do it.\nextern \"C\" {\n  void *getPointerToNamedFunction(const char *Name) {\n    Module &M = TheVM->getModule();\n    if (Function *F = M.getNamedFunction(Name))\n      return TheVM->getPointerToFunction(F);\n    return TheVM->getPointerToNamedFunction(Name);\n  }\n}\n<commit_msg>* Stop hard-coding a value for beginning of emitted code on Sparc since we can   now handle far calls (i.e., beyond the 30-bit limit in call instructions). * As a side-effect, this allows us to unify and clean up the mmap() call and   code around it.<commit_after>\/\/===-- Emitter.cpp - Write machine code to executable memory -------------===\/\/\n\/\/\n\/\/ This file defines a MachineCodeEmitter object that is used by Jello to write\n\/\/ machine code to memory and remember where relocatable values lie.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"VM.h\"\n#include \"Config\/sys\/mman.h\"\n#include \"llvm\/CodeGen\/MachineCodeEmitter.h\"\n#include \"llvm\/CodeGen\/MachineFunction.h\"\n#include \"llvm\/CodeGen\/MachineConstantPool.h\"\n#include \"llvm\/Target\/TargetData.h\"\n#include \"llvm\/Module.h\"\n#include \"Support\/Statistic.h\"\n#include <stdio.h>\n\nnamespace {\n  Statistic<> NumBytes(\"jello\", \"Number of bytes of machine code compiled\");\n  VM *TheVM = 0;\n\n  class Emitter : public MachineCodeEmitter {\n    \/\/ CurBlock - The start of the current block of memory.  CurByte - The\n    \/\/ current byte being emitted to.\n    unsigned char *CurBlock, *CurByte;\n\n    \/\/ When outputting a function stub in the context of some other function, we\n    \/\/ save CurBlock and CurByte here.\n    unsigned char *SavedCurBlock, *SavedCurByte;\n\n    \/\/ ConstantPoolAddresses - Contains the location for each entry in the\n    \/\/ constant pool.\n    std::vector<void*> ConstantPoolAddresses;\n  public:\n    Emitter(VM &vm) { TheVM = &vm; }\n\n    virtual void startFunction(MachineFunction &F);\n    virtual void finishFunction(MachineFunction &F);\n    virtual void emitConstantPool(MachineConstantPool *MCP);\n    virtual void startFunctionStub(const Function &F, unsigned StubSize);\n    virtual void* finishFunctionStub(const Function &F);\n    virtual void emitByte(unsigned char B);\n    virtual void emitWord(unsigned W);\n\n    virtual uint64_t getGlobalValueAddress(GlobalValue *V);\n    virtual uint64_t getGlobalValueAddress(const std::string &Name);\n    virtual uint64_t getConstantPoolEntryAddress(unsigned Entry);\n    virtual uint64_t getCurrentPCValue();\n\n    \/\/ forceCompilationOf - Force the compilation of the specified function, and\n    \/\/ return its address, because we REALLY need the address now.\n    \/\/\n    \/\/ FIXME: This is JIT specific!\n    \/\/\n    virtual uint64_t forceCompilationOf(Function *F);\n  };\n}\n\nMachineCodeEmitter *VM::createEmitter(VM &V) {\n  return new Emitter(V);\n}\n\n\n#define _POSIX_MAPPED_FILES\n#include <unistd.h>\n#include <sys\/mman.h>\n\n\/\/ FIXME: This should be rewritten to support a real memory manager for\n\/\/ executable memory pages!\nstatic void *getMemory(unsigned NumPages) {\n  void *pa;\n  if (NumPages == 0) return 0;\n  static const long pageSize = sysconf(_SC_PAGESIZE);\n\n#if defined(i386) || defined(__i386__) || defined(__x86__)\n  \/* Linux and *BSD tend to have these flags named differently. *\/\n#if defined(MAP_ANON) && !defined(MAP_ANONYMOUS)\n# define MAP_ANONYMOUS MAP_ANON\n#endif \/* defined(MAP_ANON) && !defined(MAP_ANONYMOUS) *\/\n#define fd  0\n#elif defined(sparc) || defined(__sparc__) || defined(__sparcv9)\n#define fd -1\n#else\n  std::cerr << \"This architecture is not supported by the JIT!\\n\";\n  abort();\n#endif\n  pa = mmap(0, pageSize*NumPages, PROT_READ|PROT_WRITE|PROT_EXEC,\n            MAP_PRIVATE|MAP_ANONYMOUS, fd, 0);\n  if (pa == MAP_FAILED) {\n    perror(\"mmap\");\n    abort();\n  }\n  return pa;\n}\n\n\nvoid Emitter::startFunction(MachineFunction &F) {\n  CurBlock = (unsigned char *)getMemory(16);\n  CurByte = CurBlock;  \/\/ Start writing at the beginning of the fn.\n  TheVM->addGlobalMapping(F.getFunction(), CurBlock);\n}\n\nvoid Emitter::finishFunction(MachineFunction &F) {\n  ConstantPoolAddresses.clear();\n  NumBytes += CurByte-CurBlock;\n\n  DEBUG(std::cerr << \"Finished CodeGen of [\" << (void*)CurBlock\n                  << \"] Function: \" << F.getFunction()->getName()\n                  << \": \" << CurByte-CurBlock << \" bytes of text\\n\");\n}\n\nvoid Emitter::emitConstantPool(MachineConstantPool *MCP) {\n  const std::vector<Constant*> &Constants = MCP->getConstants();\n  for (unsigned i = 0, e = Constants.size(); i != e; ++i) {\n    \/\/ For now we just allocate some memory on the heap, this can be\n    \/\/ dramatically improved.\n    const Type *Ty = ((Value*)Constants[i])->getType();\n    void *Addr = malloc(TheVM->getTargetData().getTypeSize(Ty));\n    TheVM->InitializeMemory(Constants[i], Addr);\n    ConstantPoolAddresses.push_back(Addr);\n  }\n}\n\nvoid Emitter::startFunctionStub(const Function &F, unsigned StubSize) {\n  static const long pageSize = sysconf(_SC_PAGESIZE);\n  SavedCurBlock = CurBlock;  SavedCurByte = CurByte;\n  \/\/ FIXME: this is a huge waste of memory.\n  CurBlock = (unsigned char *)getMemory((StubSize+pageSize-1)\/pageSize);\n  CurByte = CurBlock;  \/\/ Start writing at the beginning of the fn.\n}\n\nvoid *Emitter::finishFunctionStub(const Function &F) {\n  NumBytes += CurByte-CurBlock;\n  DEBUG(std::cerr << \"Finished CodeGen of [0x\" << std::hex\n                  << (unsigned)(intptr_t)CurBlock\n                  << std::dec << \"] Function stub for: \" << F.getName()\n                  << \": \" << CurByte-CurBlock << \" bytes of text\\n\");\n  std::swap(CurBlock, SavedCurBlock);\n  CurByte = SavedCurByte;\n  return SavedCurBlock;\n}\n\nvoid Emitter::emitByte(unsigned char B) {\n  *CurByte++ = B;   \/\/ Write the byte to memory\n}\n\nvoid Emitter::emitWord(unsigned W) {\n  \/\/ FIXME: This won't work if the endianness of the host and target don't\n  \/\/ agree!  (For a JIT this can't happen though.  :)\n  *(unsigned*)CurByte = W;\n  CurByte += sizeof(unsigned);\n}\n\n\nuint64_t Emitter::getGlobalValueAddress(GlobalValue *V) {\n  \/\/ Try looking up the function to see if it is already compiled, if not return\n  \/\/ 0.\n  return (intptr_t)TheVM->getPointerToGlobalIfAvailable(V);\n}\nuint64_t Emitter::getGlobalValueAddress(const std::string &Name) {\n  return (intptr_t)TheVM->getPointerToNamedFunction(Name);\n}\n\n\/\/ getConstantPoolEntryAddress - Return the address of the 'ConstantNum' entry\n\/\/ in the constant pool that was last emitted with the 'emitConstantPool'\n\/\/ method.\n\/\/\nuint64_t Emitter::getConstantPoolEntryAddress(unsigned ConstantNum) {\n  assert(ConstantNum < ConstantPoolAddresses.size() &&\n\t \"Invalid ConstantPoolIndex!\");\n  return (intptr_t)ConstantPoolAddresses[ConstantNum];\n}\n\n\/\/ getCurrentPCValue - This returns the address that the next emitted byte\n\/\/ will be output to.\n\/\/\nuint64_t Emitter::getCurrentPCValue() {\n  return (intptr_t)CurByte;\n}\n\nuint64_t Emitter::forceCompilationOf(Function *F) {\n  return (intptr_t)TheVM->getPointerToFunction(F);\n}\n\n\/\/ getPointerToNamedFunction - This function is used as a global wrapper to\n\/\/ VM::getPointerToNamedFunction for the purpose of resolving symbols when\n\/\/ bugpoint is debugging the JIT. In that scenario, we are loading an .so and\n\/\/ need to resolve function(s) that are being mis-codegenerated, so we need to\n\/\/ resolve their addresses at runtime, and this is the way to do it.\nextern \"C\" {\n  void *getPointerToNamedFunction(const char *Name) {\n    Module &M = TheVM->getModule();\n    if (Function *F = M.getNamedFunction(Name))\n      return TheVM->getPointerToFunction(F);\n    return TheVM->getPointerToNamedFunction(Name);\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Send UI.ChangeRegistration for background application after PTU (#3927)<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>MipmapAnisotropicVoxelMapAtlas -Voxel맵의 MipmapCount가 1 이하라면, mipmap을 작동시키지 않음<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>MediaFragmentURIParser shouldn't bloatCharacters()<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>ApplicationFileUtil: Stop leaking |prev_value|.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/***************************************************************************\n *   Copyright (c) 2014 Nathan Miller         <Nathan.A.Mill[at]gmail.com> *\n *                                                                         *\n *   This file is part of the FreeCAD CAx development system.              *\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         *\n *   GNU Library General Public License for more details.                  *\n *                                                                         *\n *   You should have received a copy of the GNU Library General Public     *\n *   License along with this library; see the file COPYING.LIB. If not,    *\n *   write to the Free Software Foundation, Inc., 59 Temple Place,         *\n *   Suite 330, Boston, MA  02111-1307, USA                                *\n *                                                                         *\n ***************************************************************************\/\n\n#include \"PreCompiled.h\"\n#ifndef _PreComp_\n#include <BRepBuilderAPI_MakeFace.hxx>\n#include <BRepFill_Filling.hxx>\n#include <BRep_Tool.hxx>\n#include <gp_Pnt.hxx>\n#include <TopoDS.hxx>\n#include <TopoDS_Edge.hxx>\n#include <TopoDS_Face.hxx>\n#include <TopoDS_Vertex.hxx>\n#include <Precision.hxx>\n#endif\n\n#include \"FeatureFilling.h\"\n#include <Base\/Tools.h>\n#include <Base\/Exception.h>\n#include <string>\n\nusing namespace Surface;\n\nPROPERTY_SOURCE(Surface::Filling, Part::Spline)\n\n\/\/Initial values\n\nFilling::Filling()\n{\n    ADD_PROPERTY_TYPE(BoundaryEdges,(0,\"\"), \"Filling\", App::Prop_None, \"Boundary Edges (C0 is required for edges without a corresponding face)\");\n    ADD_PROPERTY_TYPE(BoundaryFaces,(\"\"), \"Filling\", App::Prop_None, \"Boundary Faces\");\n    ADD_PROPERTY_TYPE(BoundaryOrder,(-1), \"Filling\", App::Prop_None, \"Order of constraint on boundary faces (C0, G1 and G2 are possible)\");\n\n    ADD_PROPERTY_TYPE(UnboundEdges,(0,\"\"), \"Filling\", App::Prop_None, \"Unbound constraint edges (C0 is required for edges without a corresponding face)\");\n    ADD_PROPERTY_TYPE(UnboundFaces,(\"\"), \"Filling\", App::Prop_None, \"Unbound constraint faces\");\n    ADD_PROPERTY_TYPE(UnboundOrder,(-1), \"Filling\", App::Prop_None, \"Order of constraint on curve faces (C0, G1 and G2 are possible)\");\n\n    ADD_PROPERTY_TYPE(FreeFaces,(0,\"\"), \"Filling\", App::Prop_None, \"Free constraint on a face\");\n    ADD_PROPERTY_TYPE(FreeOrder,(0), \"Filling\", App::Prop_None, \"Order of constraint on free faces\");\n\n    ADD_PROPERTY_TYPE(Points,(0,\"\"), \"Filling\", App::Prop_None, \"Constraint Points (on Surface)\");\n    ADD_PROPERTY_TYPE(InitialFace,(0), \"Filling\", App::Prop_None, \"Initial surface to use\");\n\n    ADD_PROPERTY_TYPE(Degree,(3), \"Filling\", App::Prop_None, \"Starting degree\");\n    ADD_PROPERTY_TYPE(PointsOnCurve,(15), \"Filling\", App::Prop_None, \"Number of points on an edge for constraint\");\n    ADD_PROPERTY_TYPE(Iterations,(2), \"Filling\", App::Prop_None, \"Number of iterations\");\n    ADD_PROPERTY_TYPE(Anisotropy,(false), \"Filling\", App::Prop_None, \"Anisotropy\");\n    ADD_PROPERTY_TYPE(Tolerance2d,(0.00001), \"Filling\", App::Prop_None, \"2D Tolerance\");\n    ADD_PROPERTY_TYPE(Tolerance3d,(0.0001), \"Filling\", App::Prop_None, \"3D Tolerance\");\n    ADD_PROPERTY_TYPE(TolAngular,(0.01), \"Filling\", App::Prop_None, \"G1 tolerance\");\n    ADD_PROPERTY_TYPE(TolCurvature,(0.1), \"Filling\", App::Prop_None, \"G2 tolerance\");\n    ADD_PROPERTY_TYPE(MaximumDegree,(8), \"Filling\", App::Prop_None, \"Maximum curve degree\");\n    ADD_PROPERTY_TYPE(MaximumSegments,(9), \"Filling\", App::Prop_None, \"Maximum number of segments\");\n\n    BoundaryEdges.setScope(App::LinkScope::Global);\n    UnboundEdges.setScope(App::LinkScope::Global);\n    FreeFaces.setScope(App::LinkScope::Global);\n    Points.setScope(App::LinkScope::Global);\n    InitialFace.setScope(App::LinkScope::Global);\n\n    BoundaryEdges.setSize(0);\n    BoundaryFaces.setSize(0);\n    BoundaryOrder.setSize(0);\n    UnboundEdges.setSize(0);\n    UnboundFaces.setSize(0);\n    UnboundOrder.setSize(0);\n    FreeFaces.setSize(0);\n    FreeOrder.setSize(0);\n    Points.setSize(0);\n}\n\nshort Filling::mustExecute() const\n{\n    if (BoundaryEdges.isTouched() ||\n        BoundaryFaces.isTouched() ||\n        BoundaryOrder.isTouched() ||\n        UnboundEdges.isTouched() ||\n        UnboundFaces.isTouched() ||\n        UnboundOrder.isTouched() ||\n        FreeFaces.isTouched() ||\n        FreeOrder.isTouched() ||\n        Points.isTouched() ||\n        InitialFace.isTouched() ||\n        Degree.isTouched() ||\n        PointsOnCurve.isTouched() ||\n        Iterations.isTouched() ||\n        Anisotropy.isTouched() ||\n        Tolerance2d.isTouched() ||\n        Tolerance3d.isTouched() ||\n        TolAngular.isTouched() ||\n        TolCurvature.isTouched() ||\n        MaximumDegree.isTouched() ||\n        MaximumSegments.isTouched())\n        return 1;\n    return 0;\n}\n\nvoid Filling::addConstraints(BRepFill_Filling& builder,\n                             const App::PropertyLinkSubList& edges,\n                             const App::PropertyStringList& faces,\n                             const App::PropertyIntegerList& orders,\n                             Standard_Boolean bnd)\n{\n    auto edge_obj = edges.getValues();\n    auto edge_sub = edges.getSubValues();\n    auto face_sub = faces.getValues();\n    auto contvals = orders.getValues();\n\n    \/\/ if the number of continuities doesn't match then fall back to C0\n    if (edge_sub.size() != contvals.size()) {\n        contvals.resize(edge_sub.size());\n        std::fill(contvals.begin(), contvals.end(), static_cast<long>(GeomAbs_C0));\n    }\n\n    \/\/ if the number of faces doesn't match then fall back to empty strings\n    \/\/ an empty face string indicates that there is no face associated to an edge\n    if (face_sub.size() != edge_sub.size()) {\n        face_sub.resize(edge_obj.size());\n        std::fill(face_sub.begin(), face_sub.end(), std::string());\n    }\n\n    if (edge_obj.size() == edge_sub.size()) {\n        for (std::size_t index = 0; index < edge_obj.size(); index++) {\n            \/\/ get the part object\n            App::DocumentObject* obj = edge_obj[index];\n            const std::string& sub = edge_sub[index];\n\n            if (obj && obj->getTypeId().isDerivedFrom(Part::Feature::getClassTypeId())) {\n                \/\/ get the sub-edge of the part's shape\n                const Part::TopoShape& shape = static_cast<Part::Feature*>(obj)->Shape.getShape();\n                TopoDS_Shape edge = shape.getSubShape(sub.c_str());\n                if (!edge.IsNull() && edge.ShapeType() == TopAbs_EDGE) {\n                    GeomAbs_Shape cont = static_cast<GeomAbs_Shape>(contvals[index]);\n\n                    \/\/ check for an adjacent face of the edge\n                    std::string subFace = face_sub[index];\n\n                    \/\/ edge doesn't have set an adjacent face\n                    if (subFace.empty()) {\n                        builder.Add(TopoDS::Edge(edge), cont, bnd);\n                    }\n                    else {\n                        TopoDS_Shape face = shape.getSubShape(subFace.c_str());\n                        if (!face.IsNull() && face.ShapeType() == TopAbs_FACE) {\n                            builder.Add(TopoDS::Edge(edge), TopoDS::Face(face), cont, bnd);\n                        }\n                        else {\n                            Standard_Failure::Raise(\"Sub-shape is not a face\");\n                        }\n                    }\n                }\n                else {\n                    Standard_Failure::Raise(\"Sub-shape is not an edge\");\n                }\n            }\n        }\n    }\n    else {\n        Standard_Failure::Raise(\"Number of links doesn't match with number of orders\");\n    }\n}\n\n\/\/ Add free support faces with their continuities\nvoid Filling::addConstraints(BRepFill_Filling& builder,\n                             const App::PropertyLinkSubList& faces,\n                             const App::PropertyIntegerList& orders)\n{\n    auto face_obj = faces.getValues();\n    auto face_sub = faces.getSubValues();\n    auto contvals = orders.getValues();\n\n    if (face_obj.size() == face_sub.size() &&\n        face_obj.size() == contvals.size()) {\n        for (std::size_t index = 0; index < face_obj.size(); index++) {\n            App::DocumentObject* obj = face_obj[index];\n            const std::string& sub = face_sub[index];\n            if (obj && obj->getTypeId().isDerivedFrom(Part::Feature::getClassTypeId())) {\n                const Part::TopoShape& shape = static_cast<Part::Feature*>(obj)->Shape.getShape();\n                TopoDS_Shape face = shape.getSubShape(sub.c_str());\n                if (!face.IsNull() && face.ShapeType() == TopAbs_FACE) {\n                    GeomAbs_Shape cont = static_cast<GeomAbs_Shape>(contvals[index]);\n                    builder.Add(TopoDS::Face(face), cont);\n                }\n                else {\n                    Standard_Failure::Raise(\"Sub-shape is not a face\");\n                }\n            }\n        }\n    }\n    else {\n        Standard_Failure::Raise(\"Number of links doesn't match with number of orders\");\n    }\n}\n\nvoid Filling::addConstraints(BRepFill_Filling& builder,\n                             const App::PropertyLinkSubList& pointsList)\n{\n    auto points = pointsList.getSubListValues();\n    for (auto it : points) {\n        App::DocumentObject* obj = it.first;\n        std::vector<std::string> sub = it.second;\n        if (obj && obj->getTypeId().isDerivedFrom(Part::Feature::getClassTypeId())) {\n            const Part::TopoShape& shape = static_cast<Part::Feature*>(obj)->Shape.getShape();\n            for (auto jt : sub) {\n                TopoDS_Shape subShape = shape.getSubShape(jt.c_str());\n                if (!subShape.IsNull() && subShape.ShapeType() == TopAbs_VERTEX) {\n                    gp_Pnt pnt = BRep_Tool::Pnt(TopoDS::Vertex(subShape));\n                    builder.Add(pnt);\n                }\n            }\n        }\n    }\n}\n\nApp::DocumentObjectExecReturn *Filling::execute(void)\n{\n    \/\/Assign Variables\n    unsigned int degree  = Degree.getValue();\n    unsigned int ptsoncurve = PointsOnCurve.getValue();\n    unsigned int numIter   = Iterations.getValue();\n    bool anisotropy = Anisotropy.getValue();\n    double tol2d = Tolerance2d.getValue();\n    double tol3d = Tolerance3d.getValue();\n    double tolG1 = TolAngular.getValue();\n    double tolG2 = TolCurvature.getValue();\n    unsigned int maxdeg = MaximumDegree.getValue();\n    unsigned int maxseg = MaximumSegments.getValue();\n\n    try {\n        BRepFill_Filling builder(degree, ptsoncurve, numIter, anisotropy, tol2d,\n                                 tol3d, tolG1, tolG2, maxdeg, maxseg);\n\n        if ((BoundaryEdges.getSize()) < 1) {\n            return new App::DocumentObjectExecReturn(\"Border must have at least one curve defined.\");\n        }\n\n        \/\/ Load the initial surface if set\n        App::DocumentObject* initFace = InitialFace.getValue();\n        if (initFace && initFace->getTypeId().isDerivedFrom(Part::Feature::getClassTypeId())) {\n            const Part::TopoShape& shape = static_cast<Part::Feature*>(initFace)->Shape.getShape();\n            std::vector<std::string> subNames = InitialFace.getSubValues();\n            for (auto it : subNames) {\n                TopoDS_Shape subShape = shape.getSubShape(it.c_str());\n                if (!subShape.IsNull() && subShape.ShapeType() == TopAbs_FACE) {\n                    builder.LoadInitSurface(TopoDS::Face(subShape));\n                    break;\n                }\n            }\n        }\n\n        \/\/ Add the constraints of border curves\/faces (bound)\n        addConstraints(builder, BoundaryEdges, BoundaryFaces, BoundaryOrder, Standard_True);\n\n        \/\/ Add additional edge constraints if available (unbound)\n        if (UnboundEdges.getSize() > 0) {\n            addConstraints(builder, UnboundEdges, UnboundFaces, UnboundOrder, Standard_False);\n        }\n\n        \/\/ Add additional constraint on free faces\n        if (FreeFaces.getSize() > 0) {\n            addConstraints(builder, FreeFaces, FreeOrder);\n        }\n\n        \/\/ App point constraints\n        if (Points.getSize() > 0) {\n            addConstraints(builder, Points);\n        }\n\n        \/\/Build the face\n        builder.Build();\n        if (!builder.IsDone()) {\n            Standard_Failure::Raise(\"Failed to create a face from constraints\");\n        }\n\n        \/\/Return the face\n        TopoDS_Face aFace = builder.Face();\n        this->Shape.setValue(aFace);\n        return App::DocumentObject::StdReturn;\n    }\n    catch (Standard_Failure& e) {\n\n        return new App::DocumentObjectExecReturn(e.GetMessageString());\n    }\n}\n<commit_msg>fix crash when boundary edges are not ordered<commit_after>\/***************************************************************************\n *   Copyright (c) 2014 Nathan Miller         <Nathan.A.Mill[at]gmail.com> *\n *                                                                         *\n *   This file is part of the FreeCAD CAx development system.              *\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         *\n *   GNU Library General Public License for more details.                  *\n *                                                                         *\n *   You should have received a copy of the GNU Library General Public     *\n *   License along with this library; see the file COPYING.LIB. If not,    *\n *   write to the Free Software Foundation, Inc., 59 Temple Place,         *\n *   Suite 330, Boston, MA  02111-1307, USA                                *\n *                                                                         *\n ***************************************************************************\/\n\n#include \"PreCompiled.h\"\n#ifndef _PreComp_\n#include <BRepBuilderAPI_MakeFace.hxx>\n#include <BRepBuilderAPI_MakeWire.hxx>\n#include <BRepFill_Filling.hxx>\n#include <BRep_Tool.hxx>\n#include <gp_Pnt.hxx>\n#include <TopoDS.hxx>\n#include <TopoDS_Edge.hxx>\n#include <TopoDS_Face.hxx>\n#include <TopoDS_Vertex.hxx>\n#include <Precision.hxx>\n#endif\n\n#include \"FeatureFilling.h\"\n#include <Base\/Tools.h>\n#include <Base\/Exception.h>\n#include <string>\n\nusing namespace Surface;\n\nPROPERTY_SOURCE(Surface::Filling, Part::Spline)\n\n\/\/Initial values\n\nFilling::Filling()\n{\n    ADD_PROPERTY_TYPE(BoundaryEdges,(0,\"\"), \"Filling\", App::Prop_None, \"Boundary Edges (C0 is required for edges without a corresponding face)\");\n    ADD_PROPERTY_TYPE(BoundaryFaces,(\"\"), \"Filling\", App::Prop_None, \"Boundary Faces\");\n    ADD_PROPERTY_TYPE(BoundaryOrder,(-1), \"Filling\", App::Prop_None, \"Order of constraint on boundary faces (C0, G1 and G2 are possible)\");\n\n    ADD_PROPERTY_TYPE(UnboundEdges,(0,\"\"), \"Filling\", App::Prop_None, \"Unbound constraint edges (C0 is required for edges without a corresponding face)\");\n    ADD_PROPERTY_TYPE(UnboundFaces,(\"\"), \"Filling\", App::Prop_None, \"Unbound constraint faces\");\n    ADD_PROPERTY_TYPE(UnboundOrder,(-1), \"Filling\", App::Prop_None, \"Order of constraint on curve faces (C0, G1 and G2 are possible)\");\n\n    ADD_PROPERTY_TYPE(FreeFaces,(0,\"\"), \"Filling\", App::Prop_None, \"Free constraint on a face\");\n    ADD_PROPERTY_TYPE(FreeOrder,(0), \"Filling\", App::Prop_None, \"Order of constraint on free faces\");\n\n    ADD_PROPERTY_TYPE(Points,(0,\"\"), \"Filling\", App::Prop_None, \"Constraint Points (on Surface)\");\n    ADD_PROPERTY_TYPE(InitialFace,(0), \"Filling\", App::Prop_None, \"Initial surface to use\");\n\n    ADD_PROPERTY_TYPE(Degree,(3), \"Filling\", App::Prop_None, \"Starting degree\");\n    ADD_PROPERTY_TYPE(PointsOnCurve,(15), \"Filling\", App::Prop_None, \"Number of points on an edge for constraint\");\n    ADD_PROPERTY_TYPE(Iterations,(2), \"Filling\", App::Prop_None, \"Number of iterations\");\n    ADD_PROPERTY_TYPE(Anisotropy,(false), \"Filling\", App::Prop_None, \"Anisotropy\");\n    ADD_PROPERTY_TYPE(Tolerance2d,(0.00001), \"Filling\", App::Prop_None, \"2D Tolerance\");\n    ADD_PROPERTY_TYPE(Tolerance3d,(0.0001), \"Filling\", App::Prop_None, \"3D Tolerance\");\n    ADD_PROPERTY_TYPE(TolAngular,(0.01), \"Filling\", App::Prop_None, \"G1 tolerance\");\n    ADD_PROPERTY_TYPE(TolCurvature,(0.1), \"Filling\", App::Prop_None, \"G2 tolerance\");\n    ADD_PROPERTY_TYPE(MaximumDegree,(8), \"Filling\", App::Prop_None, \"Maximum curve degree\");\n    ADD_PROPERTY_TYPE(MaximumSegments,(9), \"Filling\", App::Prop_None, \"Maximum number of segments\");\n\n    BoundaryEdges.setScope(App::LinkScope::Global);\n    UnboundEdges.setScope(App::LinkScope::Global);\n    FreeFaces.setScope(App::LinkScope::Global);\n    Points.setScope(App::LinkScope::Global);\n    InitialFace.setScope(App::LinkScope::Global);\n\n    BoundaryEdges.setSize(0);\n    BoundaryFaces.setSize(0);\n    BoundaryOrder.setSize(0);\n    UnboundEdges.setSize(0);\n    UnboundFaces.setSize(0);\n    UnboundOrder.setSize(0);\n    FreeFaces.setSize(0);\n    FreeOrder.setSize(0);\n    Points.setSize(0);\n}\n\nshort Filling::mustExecute() const\n{\n    if (BoundaryEdges.isTouched() ||\n        BoundaryFaces.isTouched() ||\n        BoundaryOrder.isTouched() ||\n        UnboundEdges.isTouched() ||\n        UnboundFaces.isTouched() ||\n        UnboundOrder.isTouched() ||\n        FreeFaces.isTouched() ||\n        FreeOrder.isTouched() ||\n        Points.isTouched() ||\n        InitialFace.isTouched() ||\n        Degree.isTouched() ||\n        PointsOnCurve.isTouched() ||\n        Iterations.isTouched() ||\n        Anisotropy.isTouched() ||\n        Tolerance2d.isTouched() ||\n        Tolerance3d.isTouched() ||\n        TolAngular.isTouched() ||\n        TolCurvature.isTouched() ||\n        MaximumDegree.isTouched() ||\n        MaximumSegments.isTouched())\n        return 1;\n    return 0;\n}\n\nvoid Filling::addConstraints(BRepFill_Filling& builder,\n                             const App::PropertyLinkSubList& edges,\n                             const App::PropertyStringList& faces,\n                             const App::PropertyIntegerList& orders,\n                             Standard_Boolean bnd)\n{\n    auto edge_obj = edges.getValues();\n    auto edge_sub = edges.getSubValues();\n    auto face_sub = faces.getValues();\n    auto contvals = orders.getValues();\n\n    \/\/ if the number of continuities doesn't match then fall back to C0\n    if (edge_sub.size() != contvals.size()) {\n        contvals.resize(edge_sub.size());\n        std::fill(contvals.begin(), contvals.end(), static_cast<long>(GeomAbs_C0));\n    }\n\n    \/\/ if the number of faces doesn't match then fall back to empty strings\n    \/\/ an empty face string indicates that there is no face associated to an edge\n    if (face_sub.size() != edge_sub.size()) {\n        face_sub.resize(edge_obj.size());\n        std::fill(face_sub.begin(), face_sub.end(), std::string());\n    }\n\n    if (edge_obj.size() == edge_sub.size()) {\n        BRepBuilderAPI_MakeWire testWire;\n        for (std::size_t index = 0; index < edge_obj.size(); index++) {\n            \/\/ get the part object\n            App::DocumentObject* obj = edge_obj[index];\n            const std::string& sub = edge_sub[index];\n\n            if (obj && obj->getTypeId().isDerivedFrom(Part::Feature::getClassTypeId())) {\n                \/\/ get the sub-edge of the part's shape\n                const Part::TopoShape& shape = static_cast<Part::Feature*>(obj)->Shape.getShape();\n                TopoDS_Shape edge = shape.getSubShape(sub.c_str());\n                if (!edge.IsNull() && edge.ShapeType() == TopAbs_EDGE) {\n                    GeomAbs_Shape cont = static_cast<GeomAbs_Shape>(contvals[index]);\n\n                    \/\/ check for an adjacent face of the edge\n                    std::string subFace = face_sub[index];\n\n                    \/\/ edge doesn't have set an adjacent face\n                    if (subFace.empty()) {\n                        if (!bnd) {\n                            builder.Add(TopoDS::Edge(edge), cont, bnd);\n                        }\n                        else {\n                            testWire.Add(TopoDS::Edge(edge));\n                            if (testWire.IsDone()) {\n                                builder.Add(TopoDS::Edge(edge), cont, bnd);\n                            }\n                            else {\n                                Standard_Failure::Raise(\"Boundary edges are not ordered\");\n                            }\n                        }\n                    }\n                    else {\n                        TopoDS_Shape face = shape.getSubShape(subFace.c_str());\n                        if (!face.IsNull() && face.ShapeType() == TopAbs_FACE) {\n                            if (!bnd) {\n                                builder.Add(TopoDS::Edge(edge), TopoDS::Face(face), cont, bnd);\n                            }\n                            else {\n                                testWire.Add(TopoDS::Edge(edge));\n                                if (testWire.IsDone()) {\n                                    builder.Add(TopoDS::Edge(edge), TopoDS::Face(face), cont, bnd);\n                                }\n                                else {\n                                    Standard_Failure::Raise(\"Boundary edges are not ordered\");\n                                }\n                            }\n                        }\n                        else {\n                            Standard_Failure::Raise(\"Sub-shape is not a face\");\n                        }\n                    }\n                }\n                else {\n                    Standard_Failure::Raise(\"Sub-shape is not an edge\");\n                }\n            }\n        }\n    }\n    else {\n        Standard_Failure::Raise(\"Number of links doesn't match with number of orders\");\n    }\n}\n\n\/\/ Add free support faces with their continuities\nvoid Filling::addConstraints(BRepFill_Filling& builder,\n                             const App::PropertyLinkSubList& faces,\n                             const App::PropertyIntegerList& orders)\n{\n    auto face_obj = faces.getValues();\n    auto face_sub = faces.getSubValues();\n    auto contvals = orders.getValues();\n\n    if (face_obj.size() == face_sub.size() &&\n        face_obj.size() == contvals.size()) {\n        for (std::size_t index = 0; index < face_obj.size(); index++) {\n            App::DocumentObject* obj = face_obj[index];\n            const std::string& sub = face_sub[index];\n            if (obj && obj->getTypeId().isDerivedFrom(Part::Feature::getClassTypeId())) {\n                const Part::TopoShape& shape = static_cast<Part::Feature*>(obj)->Shape.getShape();\n                TopoDS_Shape face = shape.getSubShape(sub.c_str());\n                if (!face.IsNull() && face.ShapeType() == TopAbs_FACE) {\n                    GeomAbs_Shape cont = static_cast<GeomAbs_Shape>(contvals[index]);\n                    builder.Add(TopoDS::Face(face), cont);\n                }\n                else {\n                    Standard_Failure::Raise(\"Sub-shape is not a face\");\n                }\n            }\n        }\n    }\n    else {\n        Standard_Failure::Raise(\"Number of links doesn't match with number of orders\");\n    }\n}\n\nvoid Filling::addConstraints(BRepFill_Filling& builder,\n                             const App::PropertyLinkSubList& pointsList)\n{\n    auto points = pointsList.getSubListValues();\n    for (auto it : points) {\n        App::DocumentObject* obj = it.first;\n        std::vector<std::string> sub = it.second;\n        if (obj && obj->getTypeId().isDerivedFrom(Part::Feature::getClassTypeId())) {\n            const Part::TopoShape& shape = static_cast<Part::Feature*>(obj)->Shape.getShape();\n            for (auto jt : sub) {\n                TopoDS_Shape subShape = shape.getSubShape(jt.c_str());\n                if (!subShape.IsNull() && subShape.ShapeType() == TopAbs_VERTEX) {\n                    gp_Pnt pnt = BRep_Tool::Pnt(TopoDS::Vertex(subShape));\n                    builder.Add(pnt);\n                }\n            }\n        }\n    }\n}\n\nApp::DocumentObjectExecReturn *Filling::execute(void)\n{\n    \/\/Assign Variables\n    unsigned int degree  = Degree.getValue();\n    unsigned int ptsoncurve = PointsOnCurve.getValue();\n    unsigned int numIter   = Iterations.getValue();\n    bool anisotropy = Anisotropy.getValue();\n    double tol2d = Tolerance2d.getValue();\n    double tol3d = Tolerance3d.getValue();\n    double tolG1 = TolAngular.getValue();\n    double tolG2 = TolCurvature.getValue();\n    unsigned int maxdeg = MaximumDegree.getValue();\n    unsigned int maxseg = MaximumSegments.getValue();\n\n    try {\n        BRepFill_Filling builder(degree, ptsoncurve, numIter, anisotropy, tol2d,\n                                 tol3d, tolG1, tolG2, maxdeg, maxseg);\n\n        if ((BoundaryEdges.getSize()) < 1) {\n            return new App::DocumentObjectExecReturn(\"Border must have at least one curve defined.\");\n        }\n\n        \/\/ Load the initial surface if set\n        App::DocumentObject* initFace = InitialFace.getValue();\n        if (initFace && initFace->getTypeId().isDerivedFrom(Part::Feature::getClassTypeId())) {\n            const Part::TopoShape& shape = static_cast<Part::Feature*>(initFace)->Shape.getShape();\n            std::vector<std::string> subNames = InitialFace.getSubValues();\n            for (auto it : subNames) {\n                TopoDS_Shape subShape = shape.getSubShape(it.c_str());\n                if (!subShape.IsNull() && subShape.ShapeType() == TopAbs_FACE) {\n                    builder.LoadInitSurface(TopoDS::Face(subShape));\n                    break;\n                }\n            }\n        }\n\n        \/\/ Add the constraints of border curves\/faces (bound)\n        addConstraints(builder, BoundaryEdges, BoundaryFaces, BoundaryOrder, Standard_True);\n\n        \/\/ Add additional edge constraints if available (unbound)\n        if (UnboundEdges.getSize() > 0) {\n            addConstraints(builder, UnboundEdges, UnboundFaces, UnboundOrder, Standard_False);\n        }\n\n        \/\/ Add additional constraint on free faces\n        if (FreeFaces.getSize() > 0) {\n            addConstraints(builder, FreeFaces, FreeOrder);\n        }\n\n        \/\/ App point constraints\n        if (Points.getSize() > 0) {\n            addConstraints(builder, Points);\n        }\n\n        \/\/Build the face\n        builder.Build();\n        if (!builder.IsDone()) {\n            Standard_Failure::Raise(\"Failed to create a face from constraints\");\n        }\n\n        \/\/Return the face\n        TopoDS_Face aFace = builder.Face();\n        this->Shape.setValue(aFace);\n        return App::DocumentObject::StdReturn;\n    }\n    catch (Standard_Failure& e) {\n\n        return new App::DocumentObjectExecReturn(e.GetMessageString());\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef BULL_RENDER_CONTEXT_EXTENSIONSLOADER_HPP\n#define BULL_RENDER_CONTEXT_EXTENSIONSLOADER_HPP\n\n#include <Bull\/Core\/Pattern\/Singleton.hpp>\n\n#include <Bull\/Render\/Context\/Extension.hpp>\n#include <Bull\/Render\/Context\/SurfaceHandler.hpp>\n\nnamespace Bull\n{\n    namespace prv\n    {\n        class ExtensionsLoader : public Singleton<ExtensionsLoader>\n        {\n        public:\n\n            \/*! \\brief Default constructor\n             *\n             *\/\n            ExtensionsLoader();\n\n            \/*! \\brief Constructor\n             *\n             * \\param handler The handler to use to get supported extensions\n             *\n             *\/\n            explicit ExtensionsLoader(SurfaceHandler handler);\n\n            \/*! \\brief Add an extension to load\n             *\n             * \\param extension The extension to load\n             *\n             *\/\n            void require(Extension& extension);\n\n            \/*! \\brief Load required extensions\n             *\n             * \\param surface The surface to get extensions from\n             *\n             *\/\n            void loadExtensions(SurfaceHandler surface);\n\n            \/*! \\brief Load OpenGL functions\n             *\n             *\/\n            void loadFunctions();\n\n            \/*! \\brief Check whether an OpenGL extension is supported\n             *\n             * \\param extension The name of the extension\n             *\n             * \\return Return true if supported, false otherwise\n             *\n             *\/\n            bool isSupported(const String& extension) const;\n\n        private:\n\n            std::vector<std::reference_wrapper<Extension>> m_extensions;\n            std::vector<String>                            m_allExtensions;\n            bool                                           m_loadedFunctions;\n            bool                                           m_loadedExtensions;\n        };\n    }\n}\n\n#endif \/\/ BULL_RENDER_CONTEXT_EXTENSIONSLOADER_HPP\n<commit_msg>[Render\/ExtenionsLoader] Remove unused constructor<commit_after>#ifndef BULL_RENDER_CONTEXT_EXTENSIONSLOADER_HPP\n#define BULL_RENDER_CONTEXT_EXTENSIONSLOADER_HPP\n\n#include <Bull\/Core\/Pattern\/Singleton.hpp>\n\n#include <Bull\/Render\/Context\/Extension.hpp>\n#include <Bull\/Render\/Context\/SurfaceHandler.hpp>\n\nnamespace Bull\n{\n    namespace prv\n    {\n        class ExtensionsLoader : public Singleton<ExtensionsLoader>\n        {\n        public:\n\n            \/*! \\brief Default constructor\n             *\n             *\/\n            ExtensionsLoader();\n\n            \/*! \\brief Add an extension to load\n             *\n             * \\param extension The extension to load\n             *\n             *\/\n            void require(Extension& extension);\n\n            \/*! \\brief Load required extensions\n             *\n             * \\param surface The surface to get extensions from\n             *\n             *\/\n            void loadExtensions(SurfaceHandler surface);\n\n            \/*! \\brief Load OpenGL functions\n             *\n             *\/\n            void loadFunctions();\n\n            \/*! \\brief Check whether an OpenGL extension is supported\n             *\n             * \\param extension The name of the extension\n             *\n             * \\return Return true if supported, false otherwise\n             *\n             *\/\n            bool isSupported(const String& extension) const;\n\n        private:\n\n            std::vector<std::reference_wrapper<Extension>> m_extensions;\n            std::vector<String>                            m_allExtensions;\n            bool                                           m_loadedFunctions;\n            bool                                           m_loadedExtensions;\n        };\n    }\n}\n\n#endif \/\/ BULL_RENDER_CONTEXT_EXTENSIONSLOADER_HPP\n<|endoftext|>"}
{"text":"<commit_before>#include \"NeuralNetwork.h\"\n#include <stdlib.h>     \/* srand, rand *\/\n#include <time.h>\n#include <fstream>\n#include <iostream>\n#include <typeinfo>\n\nusing namespace std;\n\nNeuralNetwork::NeuralNetwork()\n{\n    \/\/ctor\n}\n\nNeuralNetwork::~NeuralNetwork()\n{\n    \/\/dtor\n}\n\nbool NeuralNetwork::createNode(){\n    \/* initialize random seed: *\/\n    srand (time(NULL));\n    float randomNum = rand() % 101;\n    int randomSign = rand() % 7;\n    int selectChange = rand() % 4;\n    if(randomSign%2 == 0){\n        randomNum = randomNum*-1;\n    }\n    if(selectChange == 1 || selectChange == 3){\n        BLOCK += randomNum;\n    }\n    if(selectChange == 2 || selectChange == 3){\n        KILL_PIECE += randomNum;\n    }\n    cout<<BLOCK<<KILL_PIECE<<endl;\n    return true;\n}\n\nbool NeuralNetwork::readFile(){\n    ifstream data(\"data.txt\"); \/\/load file named data.txt\n    {\n        string first_line;\n        getline(data, first_line); \/\/ waste the first line (\"pointSystem winORlost turnsCount\")\n    }\n\n    while( data.good() )\n    {\n        columns temp;\n        data >> temp.block >> temp.kill_piece >> temp.winORlost >> temp.turnsCount;\n        nodes.push_back(temp);\n    }\n\n    \/\/this is for testing purposes\n    for (int i = 0; i < nodes.size()-1; ++i){\n        cout<<\"node:    \"<<i<<endl;\n        cout << \"block points: \" << nodes[i].block << \" type: \" << typeid(nodes[i].block).name() << endl;\n        cout << \"kill points: \" << nodes[i].kill_piece << \" type: \" << typeid(nodes[i].kill_piece).name() << endl;\n        cout << \"win or lost: \" << nodes[i].winORlost << \" type: \" << typeid(nodes[i].winORlost).name() << endl;\n        cout << \"turns Count: \" << nodes[i].turnsCount << \" type: \" << typeid(nodes[i].turnsCount).name() << endl;\n    }\n    return true;\n}\n\nbool NeuralNetwork::writeToFile(int winORlost, int turnsCount){\n    \/\/write to file\n    ofstream myfile (\"data.txt\", ios::app);\n    if (myfile.is_open()){\n\n        myfile <<BLOCK<<\" \"<<KILL_PIECE<<\" \"<<winORlost<<\" \"<<turnsCount<<endl;\n        myfile.close();\n        return true;\n    }\n    else cout << \"Unable to open file\";\n    return false;\n}\n\nbool NeuralNetwork::mind(){\n    int winORlost = 2;\n    int turnsCount = 11;\n    \/\/writeToFile(winORlost, turnsCount);\n    \/\/readFile();\n    createNode();\n}\n<commit_msg>fixed build (temporary changes)<commit_after>#include \"NeuralNetwork.h\"\n#include <stdlib.h>     \/* srand, rand *\/\n#include <time.h>\n#include <fstream>\n#include <iostream>\n#include <typeinfo>\n\nusing namespace std;\n\nNeuralNetwork::NeuralNetwork()\n{\n    \/\/ctor\n}\n\nNeuralNetwork::~NeuralNetwork()\n{\n    \/\/dtor\n}\n\nbool NeuralNetwork::createNode(){\n    \/* initialize random seed: *\/\n    srand (static_cast<unsigned int>(time(NULL)));\n    float randomNum = rand() % 101;\n    int randomSign = rand() % 7;\n    int selectChange = rand() % 4;\n    if(randomSign%2 == 0){\n        randomNum = randomNum*-1;\n    }\n    if(selectChange == 1 || selectChange == 3){\n        BLOCK += randomNum;\n    }\n    if(selectChange == 2 || selectChange == 3){\n        KILL_PIECE += randomNum;\n    }\n    cout<<BLOCK<<KILL_PIECE<<endl;\n    return true;\n}\n\nbool NeuralNetwork::readFile(){\n    ifstream data(\"data.txt\"); \/\/load file named data.txt\n    {\n        string first_line;\n        getline(data, first_line); \/\/ waste the first line (\"pointSystem winORlost turnsCount\")\n    }\n\n    while( data.good() )\n    {\n        columns temp;\n        data >> temp.block >> temp.kill_piece >> temp.winORlost >> temp.turnsCount;\n        nodes.push_back(temp);\n    }\n\n    \/\/this is for testing purposes\n    for (int i = 0; i < nodes.size()-1; ++i){\n        cout<<\"node:    \"<<i<<endl;\n        cout << \"block points: \" << nodes[i].block << \" type: \" << typeid(nodes[i].block).name() << endl;\n        cout << \"kill points: \" << nodes[i].kill_piece << \" type: \" << typeid(nodes[i].kill_piece).name() << endl;\n        cout << \"win or lost: \" << nodes[i].winORlost << \" type: \" << typeid(nodes[i].winORlost).name() << endl;\n        cout << \"turns Count: \" << nodes[i].turnsCount << \" type: \" << typeid(nodes[i].turnsCount).name() << endl;\n    }\n    return true;\n}\n\nbool NeuralNetwork::writeToFile(int winORlost, int turnsCount){\n    \/\/write to file\n    ofstream myfile (\"data.txt\", ios::app);\n    if (myfile.is_open()){\n\n        myfile <<BLOCK<<\" \"<<KILL_PIECE<<\" \"<<winORlost<<\" \"<<turnsCount<<endl;\n        myfile.close();\n        return true;\n    }\n    else cout << \"Unable to open file\";\n    return false;\n}\n\nbool NeuralNetwork::mind(){\n    int winORlost = 2;\n    int turnsCount = 11;\n    \/\/writeToFile(winORlost, turnsCount);\n    \/\/readFile();\n    createNode();\n    \n    \n    \/\/ temporary return to ensure build isnt broken\n    return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"OpenGLTexture.h\"\n\n#include \"TextureRef.h\"\n#include \"Image.h\"\n\n#define GL_GLEXT_PROTOTYPES\n\n#if defined __APPLE__\n#include <OpenGLES\/ES3\/gl.h>\n#include <OpenGLES\/ES3\/glext.h>\n#elif (defined GL_ES)\n#include <GLES3\/gl3.h>\n#include <EGL\/egl.h>\n#include <EGL\/eglext.h>\n#else\n#define GL_GLEXT_PROTOTYPES\n\n#ifdef _WIN32\n#include <GL\/glew.h>\n#include <windows.h>\n#endif\n\n#include <GL\/gl.h>\n\n#ifdef _WIN32\n#include \"glext.h\"\n#else\n#include <GL\/glext.h>\n#endif\n\n#endif\n\n#include <cassert>\n#include <iostream>\n\nusing namespace std;\nusing namespace canvas;\n\nsize_t OpenGLTexture::total_textures = 0;\nvector<unsigned int> OpenGLTexture::freed_textures;\n\nstatic bool checkGLError(const std::string & message) {\n  GLenum errLast = GL_NO_ERROR;\n  bool has_errors = false;\n  for ( ;; ) {\n    GLenum err = glGetError();\n    if ( err == GL_NO_ERROR ) {\n      break;\n    }\n    \n    \/\/ normally the error is reset by the call to glGetError() but if\n    \/\/ glGetError() itself returns an error, we risk looping forever here\n    \/\/ so check that we get a different error than the last time\n    if ( err == errLast ) {\n      cerr << \"OpenGL error state couldn't be reset.\\n\";\n      break;\n    }\n    \n    errLast = err;\n    \n    cerr << message << \": OpenGL error \" << err << \"\\n\";\n    \/\/ assert(0);\n    has_errors = true;\n  }\n  \n  return has_errors;\n}\n\nstatic GLenum getOpenGLInternalFormat(InternalFormat internal_format) {\n  switch (internal_format) {\n  case RG8: return GL_RG8;\n  case RGB565: return GL_RGB565;\n  case RGBA4: return GL_RGBA4;\n  case RGBA8: return GL_RGBA8;\n  case COMPRESSED_RG:\n    assert(0);\n    return GL_COMPRESSED_RG11_EAC;\n  case COMPRESSED_RGB:\n    return GL_COMPRESSED_RGB8_ETC2;\n    \/\/ return GL_COMPRESSED_RGB_PVRTC_2BPPV1_IMG;\n  case COMPRESSED_RGBA:\n    assert(0);\n    \/\/ return GL_COMPRESSED_RGBA8_ETC2_EAC;\n    return GL_COMPRESSED_RGBA_ASTC_4x4_KHR;\n  case LUMINANCE_ALPHA: return GL_RG8;\n  }\n  return 0;\n}\n\nstatic GLenum getOpenGLFilterType(FilterMode mode) {\n  switch (mode) {\n  case NEAREST: return GL_NEAREST;\n  case LINEAR: return GL_LINEAR;\n  case LINEAR_MIPMAP_LINEAR: return GL_LINEAR_MIPMAP_LINEAR;\n  }\n  return 0;\n}\n\nvoid\nOpenGLTexture::updateData(const void * buffer) {\n  updateData(buffer, 0, 0, getActualWidth(), getActualHeight());\n}\n\nvoid\nOpenGLTexture::updateData(const void * buffer, unsigned int x, unsigned int y, unsigned int width, unsigned int height) {\n  checkGLError(\"error before texture update\");\n  \n  assert(buffer);\n\n  bool initialize = false;\n  if (!texture_id) {\n    initialize = true;\n    glGenTextures(1, &texture_id);\n    if (texture_id >= 1) total_textures++;    \n  }\n  assert(texture_id >= 1);\n  \n  glBindTexture(GL_TEXTURE_2D, texture_id);\n\n  glPixelStorei(GL_UNPACK_ALIGNMENT, 1);\n\n  bool has_mipmaps = getMinFilter() == LINEAR_MIPMAP_LINEAR;\n  if (initialize) {\n#if 1\n    glTexStorage2D(GL_TEXTURE_2D, has_mipmaps ? getMipmapLevels() : 1, getOpenGLInternalFormat(getInternalFormat()), getActualWidth(), getActualHeight());\n#else\n    glTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA, getWidth(), getHeight(), 0, GL_RGBA, GL_UNSIGNED_BYTE, 0);\n#endif\n    \n    glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_CLAMP_TO_EDGE);\n    glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_CLAMP_TO_EDGE);\n    glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, getOpenGLFilterType(getMinFilter()));\n    glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, getOpenGLFilterType(getMagFilter()));\n  }\n\n  if (getInternalFormat() == LUMINANCE_ALPHA) {\n    Image tmp_image(width, height, (const unsigned char *)buffer, ImageFormat::RGBA32);\n    auto tmp_image2 = tmp_image.changeFormat(ImageFormat::LUMALPHA8);\n    glTexSubImage2D(GL_TEXTURE_2D, 0, x, y, width, height, GL_RG, GL_UNSIGNED_BYTE, tmp_image2->getData());\n  } else if (getInternalFormat() == RGB565) {\n    Image tmp_image(width, height, (const unsigned char *)buffer, ImageFormat::RGBA32);\n    auto tmp_image2 = tmp_image.changeFormat(ImageFormat::RGB565);\n    glTexSubImage2D(GL_TEXTURE_2D, 0, x, y, width, height, GL_RGB, GL_UNSIGNED_SHORT_5_6_5, tmp_image2->getData());\n  } else if (getInternalFormat() == RGBA4) {\n    assert(0);\n  } else if (getInternalFormat() == COMPRESSED_RGB) {\n    Image tmp_image(width, height, (const unsigned char *)buffer, ImageFormat::RGB32);\n    auto tmp_image2 = tmp_image.changeFormat(ImageFormat::RGB_ETC1, getActualWidth() - x, getActualHeight() - y);\n    unsigned int size = 8 * (tmp_image2->getWidth() \/ 4) * (tmp_image2->getHeight() \/ 4);\n    cerr << \"sending compressed texture to OpenGL, x = \" << x << \", y = \" << y << \", w = \" << tmp_image2->getWidth() << \", h = \" << tmp_image2->getHeight() << \", size = \" << size << endl;\n    glCompressedTexSubImage2D(GL_TEXTURE_2D, 0, x, y, tmp_image2->getWidth(), tmp_image2->getHeight(), getOpenGLInternalFormat(getInternalFormat()), size, tmp_image2->getData());\n  } else {\n#if defined __APPLE__\n    glTexSubImage2D(GL_TEXTURE_2D, 0, x, y, width, height, GL_RGBA, GL_UNSIGNED_BYTE, buffer);\n#else\n    glTexSubImage2D(GL_TEXTURE_2D, 0, x, y, width, height, GL_BGRA, GL_UNSIGNED_INT_8_8_8_8_REV, buffer);    \n    \/\/ glTexSubImage2D(GL_TEXTURE_2D, 0, x, y, width, height, GL_BGRA_EXT, GL_UNSIGNED_BYTE, buffer);\n#endif\n  }\n  if (has_mipmaps) {\n    glGenerateMipmap(GL_TEXTURE_2D);\n  }\n\n  glBindTexture(GL_TEXTURE_2D, 0);\n\n  checkGLError(\"Failed to update texture\");\n}\n\nvoid\nOpenGLTexture::releaseTextures() {\n  \/\/ cerr << \"DELETING TEXTURES: \" << OpenGLTexture::getFreedTextures().size() << \"\/\" << OpenGLTexture::getNumTextures() << endl;\n  \n  for (vector<unsigned int>::const_iterator it = freed_textures.begin(); it != freed_textures.end(); it++) {\n    GLuint texid = *it;\n    glDeleteTextures(1, &texid);\n  }\n  freed_textures.clear();\n}\n\nTextureRef\nOpenGLTexture::createTexture(unsigned int _logical_width, unsigned int _logical_height, unsigned int _actual_width, unsigned int _actual_height, FilterMode min_filter, FilterMode mag_filter, InternalFormat _internal_format, unsigned int mipmap_levels) {\n  return TextureRef(_logical_width, _logical_height, _actual_width, _actual_height, new OpenGLTexture(_logical_width, _logical_height, _actual_width, _actual_height, min_filter, mag_filter, _internal_format, mipmap_levels));\n}\n<commit_msg>switch to explicit formats, fix ETC1, add DXT1 and DXT5<commit_after>#include \"OpenGLTexture.h\"\n\n#include \"TextureRef.h\"\n#include \"Image.h\"\n\n#define GL_GLEXT_PROTOTYPES\n\n#if defined __APPLE__\n#include <OpenGLES\/ES3\/gl.h>\n#include <OpenGLES\/ES3\/glext.h>\n#elif (defined GL_ES)\n#include <GLES3\/gl3.h>\n#include <EGL\/egl.h>\n#include <EGL\/eglext.h>\n#else\n#define GL_GLEXT_PROTOTYPES\n\n#ifdef _WIN32\n#include <GL\/glew.h>\n#include <windows.h>\n#endif\n\n#include <GL\/gl.h>\n\n#ifdef _WIN32\n#include \"glext.h\"\n#else\n#include <GL\/glext.h>\n#endif\n\n#endif\n\n#include <cassert>\n#include <iostream>\n\nusing namespace std;\nusing namespace canvas;\n\nsize_t OpenGLTexture::total_textures = 0;\nvector<unsigned int> OpenGLTexture::freed_textures;\n\nstatic bool checkGLError(const std::string & message) {\n  GLenum errLast = GL_NO_ERROR;\n  bool has_errors = false;\n  for ( ;; ) {\n    GLenum err = glGetError();\n    if ( err == GL_NO_ERROR ) {\n      break;\n    }\n    \n    \/\/ normally the error is reset by the call to glGetError() but if\n    \/\/ glGetError() itself returns an error, we risk looping forever here\n    \/\/ so check that we get a different error than the last time\n    if ( err == errLast ) {\n      cerr << \"OpenGL error state couldn't be reset.\\n\";\n      break;\n    }\n    \n    errLast = err;\n    \n    cerr << message << \": OpenGL error \" << err << \"\\n\";\n    \/\/ assert(0);\n    has_errors = true;\n  }\n  \n  return has_errors;\n}\n\nstatic GLenum getOpenGLInternalFormat(InternalFormat internal_format) {\n  switch (internal_format) {\n  case RG8: return GL_RG8;\n  case RGB565: return GL_RGB565;\n  case RGBA4: return GL_RGBA4;\n  case RGBA8: return GL_RGBA8;\n    \/\/ case RG_RGTC: return GL_COMPRESSED_RG11_EAC;\n  case RGB_ETC1: return GL_COMPRESSED_RGB8_ETC2;\n  case RGB_DXT1: return GL_COMPRESSED_RGB_S3TC_DXT1_EXT;\n  case RGBA_DXT5: return GL_COMPRESSED_RGBA_S3TC_DXT5_EXT;\n  case LUMINANCE_ALPHA: return GL_RG8;\n  }\n  return 0;\n}\n\nstatic GLenum getOpenGLFilterType(FilterMode mode) {\n  switch (mode) {\n  case NEAREST: return GL_NEAREST;\n  case LINEAR: return GL_LINEAR;\n  case LINEAR_MIPMAP_LINEAR: return GL_LINEAR_MIPMAP_LINEAR;\n  }\n  return 0;\n}\n\nvoid\nOpenGLTexture::updateData(const void * buffer) {\n  updateData(buffer, 0, 0, getActualWidth(), getActualHeight());\n}\n\nvoid\nOpenGLTexture::updateData(const void * buffer, unsigned int x, unsigned int y, unsigned int width, unsigned int height) {\n  checkGLError(\"error before texture update\");\n  \n  assert(buffer);\n\n  bool initialize = false;\n  if (!texture_id) {\n    initialize = true;\n    glGenTextures(1, &texture_id);\n    if (texture_id >= 1) total_textures++;    \n  }\n  assert(texture_id >= 1);\n  \n  glBindTexture(GL_TEXTURE_2D, texture_id);\n\n  glPixelStorei(GL_UNPACK_ALIGNMENT, 1);\n\n  bool has_mipmaps = getMinFilter() == LINEAR_MIPMAP_LINEAR;\n  if (initialize) {\n#if 1\n    glTexStorage2D(GL_TEXTURE_2D, has_mipmaps ? getMipmapLevels() : 1, getOpenGLInternalFormat(getInternalFormat()), getActualWidth(), getActualHeight());\n#else\n    glTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA, getWidth(), getHeight(), 0, GL_RGBA, GL_UNSIGNED_BYTE, 0);\n#endif\n    \n    glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_CLAMP_TO_EDGE);\n    glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_CLAMP_TO_EDGE);\n    glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, getOpenGLFilterType(getMinFilter()));\n    glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, getOpenGLFilterType(getMagFilter()));\n  }\n\n  if (getInternalFormat() == LUMINANCE_ALPHA) {\n    Image tmp_image(width, height, (const unsigned char *)buffer, ImageFormat::RGBA32);\n    auto tmp_image2 = tmp_image.changeFormat(ImageFormat::LUMALPHA8);\n    glTexSubImage2D(GL_TEXTURE_2D, 0, x, y, width, height, GL_RG, GL_UNSIGNED_BYTE, tmp_image2->getData());\n  } else if (getInternalFormat() == RGB565) {\n    Image tmp_image(width, height, (const unsigned char *)buffer, ImageFormat::RGBA32);\n    auto tmp_image2 = tmp_image.changeFormat(ImageFormat::RGB565);\n    glTexSubImage2D(GL_TEXTURE_2D, 0, x, y, width, height, GL_RGB, GL_UNSIGNED_SHORT_5_6_5, tmp_image2->getData());\n  } else if (getInternalFormat() == RGBA4) {\n    assert(0);\n  } else if (getInternalFormat() == RGB_ETC1) {\n    Image tmp_image(width, height, (const unsigned char *)buffer, ImageFormat::RGB32);\n    auto tmp_image2 = tmp_image.changeFormat(ImageFormat::RGB_ETC1);\n    unsigned int size = 8 * (tmp_image2->getWidth() \/ 4) * (tmp_image2->getHeight() \/ 4);\n    cerr << \"sending ETC1 texture to OpenGL, x = \" << x << \", y = \" << y << \", w = \" << tmp_image2->getWidth() << \", h = \" << tmp_image2->getHeight() << \", size = \" << size << endl;\n    glCompressedTexSubImage2D(GL_TEXTURE_2D, 0, x, y, tmp_image2->getWidth(), tmp_image2->getHeight(), getOpenGLInternalFormat(getInternalFormat()), size, tmp_image2->getData());\n  } else if (getInternalFormat() == RGB_DXT1) {\n    Image tmp_image(width, height, (const unsigned char *)buffer, ImageFormat::RGB32);\n    auto tmp_image2 = tmp_image.changeFormat(ImageFormat::RGB_DXT1);\n    unsigned int size = 8 * (tmp_image2->getWidth() \/ 4) * (tmp_image2->getHeight() \/ 4);\n    cerr << \"sending DXT1 texture to OpenGL, x = \" << x << \", y = \" << y << \", w = \" << tmp_image2->getWidth() << \", h = \" << tmp_image2->getHeight() << \", size = \" << size << endl;\n    glCompressedTexSubImage2D(GL_TEXTURE_2D, 0, x, y, tmp_image2->getWidth(), tmp_image2->getHeight(), getOpenGLInternalFormat(getInternalFormat()), size, tmp_image2->getData());\n  } else if (getInternalFormat() == RGBA_DXT5) {\n    Image tmp_image(width, height, (const unsigned char *)buffer, ImageFormat::RGB32);\n    auto tmp_image2 = tmp_image.changeFormat(ImageFormat::RGBA_DXT5);\n    unsigned int size = 16 * (tmp_image2->getWidth() \/ 4) * (tmp_image2->getHeight() \/ 4);\n    cerr << \"sending DXT5 texture to OpenGL, x = \" << x << \", y = \" << y << \", w = \" << tmp_image2->getWidth() << \", h = \" << tmp_image2->getHeight() << \", size = \" << size << endl;\n    glCompressedTexSubImage2D(GL_TEXTURE_2D, 0, x, y, tmp_image2->getWidth(), tmp_image2->getHeight(), getOpenGLInternalFormat(getInternalFormat()), size, tmp_image2->getData());\n  } else {\n#if defined __APPLE__\n    glTexSubImage2D(GL_TEXTURE_2D, 0, x, y, width, height, GL_RGBA, GL_UNSIGNED_BYTE, buffer);\n#else\n    glTexSubImage2D(GL_TEXTURE_2D, 0, x, y, width, height, GL_BGRA, GL_UNSIGNED_INT_8_8_8_8_REV, buffer);    \n    \/\/ glTexSubImage2D(GL_TEXTURE_2D, 0, x, y, width, height, GL_BGRA_EXT, GL_UNSIGNED_BYTE, buffer);\n#endif\n  }\n  if (has_mipmaps) {\n    glGenerateMipmap(GL_TEXTURE_2D);\n  }\n\n  glBindTexture(GL_TEXTURE_2D, 0);\n\n  checkGLError(\"Failed to update texture\");\n}\n\nvoid\nOpenGLTexture::releaseTextures() {\n  \/\/ cerr << \"DELETING TEXTURES: \" << OpenGLTexture::getFreedTextures().size() << \"\/\" << OpenGLTexture::getNumTextures() << endl;\n  \n  for (vector<unsigned int>::const_iterator it = freed_textures.begin(); it != freed_textures.end(); it++) {\n    GLuint texid = *it;\n    glDeleteTextures(1, &texid);\n  }\n  freed_textures.clear();\n}\n\nTextureRef\nOpenGLTexture::createTexture(unsigned int _logical_width, unsigned int _logical_height, unsigned int _actual_width, unsigned int _actual_height, FilterMode min_filter, FilterMode mag_filter, InternalFormat _internal_format, unsigned int mipmap_levels) {\n  return TextureRef(_logical_width, _logical_height, _actual_width, _actual_height, new OpenGLTexture(_logical_width, _logical_height, _actual_width, _actual_height, min_filter, mag_filter, _internal_format, mipmap_levels));\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"StorageEnvironment.h\"\n#include \"StorageDataCache.h\"\n#include \"System\/Macros.h\"\n#include \"System\/FileSystem.h\"\n\nStorageEnvironment::StorageEnvironment()\n{\n    manageCache = false;\n    sync = true;\n}\n\nStorageEnvironment::~StorageEnvironment()\n{\n    Close();\n}\n\nvoid StorageEnvironment::InitCache(uint64_t cacheSize)\n{\n    DCACHE->Init(cacheSize);\n    manageCache = true;\n}\n\nvoid StorageEnvironment::SetSync(bool sync_)\n{\n    sync = sync_;\n}\n\nbool StorageEnvironment::Open(const char *path_)\n{\n    char    sep;\n    \n    \/\/ try to create environment directory\n    if (!FS_IsDirectory(path_))\n    {\n        if (!FS_CreateDir(path_))\n            return false;\n    }\n    \n    sep = FS_Separator();\n    path.Append(path_);\n    if (path.GetBuffer()[path.GetLength() - 1] != sep)\n        path.Append(&sep, 1);\n    path.NullTerminate();\n    \n    return true;\n}\n\nvoid StorageEnvironment::Close()\n{\n    StorageDatabase*    it;\n    \n    \n    for (it = databases.First(); it != NULL; it = databases.Delete(it))\n        it->Close();\n    \n    if (manageCache)\n    {\n        DCACHE->Shutdown();\n        manageCache = false;\n    }\n}\n\nuint64_t StorageEnvironment::GetSize()\n{\n    StorageDatabase*    it;\n    uint64_t            size;\n    \n    size = 0;\n    FOREACH (it, databases)\n        size += it->GetSize();\n    \n    return size;\n}\n\nStorageDatabase* StorageEnvironment::GetDatabase(const char* dbName)\n{\n    StorageDatabase*   it;\n    \n    for (it = databases.First(); it != NULL; it = databases.Next(it))\n    {\n        if (MEMCMP(it->GetName(), strlen(it->GetName()), dbName, strlen(dbName)))\n            return it;\n    }\n    \n    it = new StorageDatabase();\n    it->Open(path.GetBuffer(), dbName);\n    it->environment = this;\n    databases.Append(it);\n    \n    return it;\n}\n    \nvoid StorageEnvironment::Commit(bool recovery, bool flush)\n{\n    StorageDatabase*    it;\n    \n    if (recovery)\n    {\n        FOREACH (it, databases)\n            it->CommitPhase1();\n\n        \/\/ TODO: if the OS supports write barriers, then this sync not necessary!\n        if (sync && flush)\n            FS_Sync();\n    }\n    \n    FOREACH (it, databases)\n        it->CommitPhase2();\n\n    if (sync && flush)\n        FS_Sync();\n    \n    if (recovery)\n    {\n        FOREACH (it, databases)\n            it->CommitPhase3();\n    }\n    \n    FOREACH (it, databases)\n        it->CommitPhase4();\n}\n<commit_msg>Fixed bug when StoragEnvironment could not be crated.<commit_after>#include \"StorageEnvironment.h\"\n#include \"StorageDataCache.h\"\n#include \"System\/Macros.h\"\n#include \"System\/FileSystem.h\"\n\nStorageEnvironment::StorageEnvironment()\n{\n    manageCache = false;\n    sync = true;\n}\n\nStorageEnvironment::~StorageEnvironment()\n{\n    Close();\n}\n\nvoid StorageEnvironment::InitCache(uint64_t cacheSize)\n{\n    DCACHE->Init(cacheSize);\n    manageCache = true;\n}\n\nvoid StorageEnvironment::SetSync(bool sync_)\n{\n    sync = sync_;\n}\n\nbool StorageEnvironment::Open(const char *path_)\n{\n    char    sep;\n    \n    \/\/ try to create environment directory\n    if (!FS_IsDirectory(path_))\n    {\n        if (!FS_CreateDir(path_))\n        {\n            STOP_FAIL(1, \"Cannot create directory: %s\", path_);\n            return false;\n        }\n    }\n    \n    sep = FS_Separator();\n    path.Append(path_);\n    if (path.GetBuffer()[path.GetLength() - 1] != sep)\n        path.Append(&sep, 1);\n    path.NullTerminate();\n    \n    return true;\n}\n\nvoid StorageEnvironment::Close()\n{\n    StorageDatabase*    it;\n    \n    \n    for (it = databases.First(); it != NULL; it = databases.Delete(it))\n        it->Close();\n    \n    if (manageCache)\n    {\n        DCACHE->Shutdown();\n        manageCache = false;\n    }\n}\n\nuint64_t StorageEnvironment::GetSize()\n{\n    StorageDatabase*    it;\n    uint64_t            size;\n    \n    size = 0;\n    FOREACH (it, databases)\n        size += it->GetSize();\n    \n    return size;\n}\n\nStorageDatabase* StorageEnvironment::GetDatabase(const char* dbName)\n{\n    StorageDatabase*   it;\n    \n    for (it = databases.First(); it != NULL; it = databases.Next(it))\n    {\n        if (MEMCMP(it->GetName(), strlen(it->GetName()), dbName, strlen(dbName)))\n            return it;\n    }\n    \n    it = new StorageDatabase();\n    it->Open(path.GetBuffer(), dbName);\n    it->environment = this;\n    databases.Append(it);\n    \n    return it;\n}\n    \nvoid StorageEnvironment::Commit(bool recovery, bool flush)\n{\n    StorageDatabase*    it;\n    \n    if (recovery)\n    {\n        FOREACH (it, databases)\n            it->CommitPhase1();\n\n        \/\/ TODO: if the OS supports write barriers, then this sync not necessary!\n        if (sync && flush)\n            FS_Sync();\n    }\n    \n    FOREACH (it, databases)\n        it->CommitPhase2();\n\n    if (sync && flush)\n        FS_Sync();\n    \n    if (recovery)\n    {\n        FOREACH (it, databases)\n            it->CommitPhase3();\n    }\n    \n    FOREACH (it, databases)\n        it->CommitPhase4();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2008-2010 The QXmpp developers\n *\n * Author:\n *  Manjeet Dahiya\n *\n * Source:\n *  http:\/\/code.google.com\/p\/qxmpp\n *\n * This file is a part of QXmpp 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\n#include \"QXmppPresence.h\"\n#include \"QXmppUtils.h\"\n#include <QtDebug>\n#include <QDomElement>\n#include <QXmlStreamWriter>\n#include \"QXmppConstants.h\"\n\n\/\/\/ Constructs a QXmppPresence.\n\/\/\/\n\/\/\/ \\param type\n\/\/\/ \\param status\n\nQXmppPresence::QXmppPresence(QXmppPresence::Type type,\n                             const QXmppPresence::Status& status)\n    : QXmppStanza(),\n    m_type(type),\n    m_status(status),\n    m_vCardUpdateType(VCardUpdateNone)\n{\n\n}\n\n\/\/\/ Destroys a QXmppPresence.\n\nQXmppPresence::~QXmppPresence()\n{\n\n}\n\n\/\/\/ Returns the presence type.\n\/\/\/\n\/\/\/ You can use this method to determine the action which needs to be\n\/\/\/ taken in response to receiving the presence. For instance, if the type is\n\/\/\/ QXmppPresence::Available or QXmppPresence::Unavailable, you could update\n\/\/\/ the icon representing a contact's availability.\n\nQXmppPresence::Type QXmppPresence::type() const\n{\n    return m_type;\n}\n\n\/\/\/ Sets the presence type.\n\/\/\/\n\/\/\/ \\param type\n\nvoid QXmppPresence::setType(QXmppPresence::Type type)\n{\n    m_type = type;\n}\n\n\/\/\/ Returns the presence status.\n\nconst QXmppPresence::Status& QXmppPresence::status() const\n{\n    return m_status;\n}\n\n\/\/\/ Returns a reference to the presence status, allowing you to change it.\n\nQXmppPresence::Status& QXmppPresence::status()\n{\n    return m_status;\n}\n\n\/\/\/ Sets the presence status.\n\/\/\/\n\/\/\/ \\param status\n\nvoid QXmppPresence::setStatus(const QXmppPresence::Status& status)\n{\n    m_status = status;\n}\n\nvoid QXmppPresence::parse(const QDomElement &element)\n{\n    QXmppStanza::parse(element);\n\n    setTypeFromStr(element.attribute(\"type\"));\n    m_status.parse(element);\n\n    QXmppElementList extensions;\n    QDomElement xElement = element.firstChildElement();\n    m_vCardUpdateType = VCardUpdateNone;\n    while(!xElement.isNull())\n    {\n        \/\/ XEP-0153: vCard-Based Avatars\n        if(xElement.namespaceURI() == ns_vcard_update)\n        {\n            QDomElement photoElement = xElement.firstChildElement(\"photo\");\n            if(!photoElement.isNull())\n            {\n                m_photoHash = QByteArray::fromHex(photoElement.text().toAscii());\n                if(m_photoHash.isEmpty())\n                    m_vCardUpdateType = VCardUpdateNoPhoto;\n                else\n                    m_vCardUpdateType = VCardUpdateValidPhoto;\n            }\n            else\n            {\n                m_photoHash = QByteArray();\n                m_vCardUpdateType = VCardUpdateNotReady;\n            }\n        }\n        \/\/ XEP-0115: Entity Capabilities\n        else if(xElement.tagName() == \"c\" && xElement.namespaceURI() == ns_capabilities)\n        {\n            m_capabilityNode = xElement.attribute(\"node\");\n            m_capabilityVer = QByteArray::fromBase64(xElement.attribute(\"ver\").toAscii());\n            m_capabilityHash = xElement.attribute(\"hash\");\n            m_capabilityExt = xElement.attribute(\"ext\").split(\" \", QString::SkipEmptyParts);\n        }\n        else if (xElement.tagName() == \"error\")\n        {\n        }\n        else if (xElement.tagName() == \"show\")\n        {\n        }\n        else if (xElement.tagName() == \"status\")\n        {\n        }\n        else if (xElement.tagName() == \"priority\")\n        {\n        }\n        else\n        {\n            \/\/ other extensions\n            extensions << QXmppElement(xElement);\n        }\n        xElement = xElement.nextSiblingElement();\n    }\n    setExtensions(extensions);\n}\n\nvoid QXmppPresence::toXml(QXmlStreamWriter *xmlWriter) const\n{\n    xmlWriter->writeStartElement(\"presence\");\n    helperToXmlAddAttribute(xmlWriter,\"xml:lang\", lang());\n    helperToXmlAddAttribute(xmlWriter,\"id\", id());\n    helperToXmlAddAttribute(xmlWriter,\"to\", to());\n    helperToXmlAddAttribute(xmlWriter,\"from\", from());\n    helperToXmlAddAttribute(xmlWriter,\"type\", getTypeStr());\n    m_status.toXml(xmlWriter);\n\n    error().toXml(xmlWriter);\n\n    \/\/ XEP-0153: vCard-Based Avatars\n    if(m_vCardUpdateType != VCardUpdateNone)\n    {\n        xmlWriter->writeStartElement(\"x\");\n        helperToXmlAddAttribute(xmlWriter, \"xmlns\", ns_vcard_update);\n        switch(m_vCardUpdateType)\n        {\n        case VCardUpdateNoPhoto:\n            helperToXmlAddTextElement(xmlWriter, \"photo\", \"\");\n            break;\n        case VCardUpdateValidPhoto:\n            helperToXmlAddTextElement(xmlWriter, \"photo\", m_photoHash.toHex());\n            break;\n        case VCardUpdateNotReady:\n            break;\n        default:\n            break;\n        }\n        xmlWriter->writeEndElement();\n    }\n\n    if(!m_capabilityNode.isEmpty() && !m_capabilityVer.isEmpty()\n        && !m_capabilityHash.isEmpty())\n    {\n        xmlWriter->writeStartElement(\"c\");\n        helperToXmlAddAttribute(xmlWriter, \"xmlns\", ns_capabilities);\n        helperToXmlAddAttribute(xmlWriter, \"hash\", m_capabilityHash);\n        helperToXmlAddAttribute(xmlWriter, \"node\", m_capabilityNode);\n        helperToXmlAddAttribute(xmlWriter, \"ver\", m_capabilityVer.toBase64());\n        xmlWriter->writeEndElement();\n    }\n\n    foreach (const QXmppElement &extension, extensions())\n        extension.toXml(xmlWriter);\n\n    xmlWriter->writeEndElement();\n}\n\nQString QXmppPresence::getTypeStr() const\n{\n    QString text;\n    switch(m_type)\n    {\n    case QXmppPresence::Error:\n        text = \"error\"; \n        break;\n    case QXmppPresence::Available:\n        \/\/ no type-attribute if available\n        text = \"\"; \n        break;\n    case QXmppPresence::Unavailable:\n        text = \"unavailable\"; \n        break;\n    case QXmppPresence::Subscribe:\n        text = \"subscribe\"; \n        break;\n    case QXmppPresence::Subscribed:\n        text = \"subscribed\"; \n        break;\n    case QXmppPresence::Unsubscribe:\n        text = \"unsubscribe\"; \n        break;\n    case QXmppPresence::Unsubscribed:\n        text = \"unsubscribed\"; \n        break;\n    case QXmppPresence::Probe:\n        text = \"probe\"; \n        break;\n    default:\n        qWarning(\"QXmppPresence::getTypeStr() invalid type %d\", (int)m_type);\n        break;\n    }\n    return text;\n}\n\nvoid QXmppPresence::setTypeFromStr(const QString& str)\n{\n    QXmppPresence::Type type;\n    if(str == \"error\")\n    {\n        type = QXmppPresence::Error;\n        setType(type);\n        return;\n    }\n    else if(str == \"unavailable\")\n    {\n        type = QXmppPresence::Unavailable;\n        setType(type);\n        return;\n    }\n    else if(str == \"subscribe\")\n    {\n        type = QXmppPresence::Subscribe;\n        setType(type);\n        return;\n    }\n    else if(str == \"subscribed\")\n    {\n        type = QXmppPresence::Subscribed;\n        setType(type);\n        return;\n    }\n    else if(str == \"unsubscribe\")\n    {\n        type = QXmppPresence::Unsubscribe;\n        setType(type);\n        return;\n    }\n    else if(str == \"unsubscribed\")\n    {\n        type = QXmppPresence::Unsubscribed;\n        setType(type);\n        return;\n    }\n    else if(str == \"probe\")\n    {\n        type = QXmppPresence::Probe;\n        setType(type);\n        return;\n    }\n    else if(str == \"\")\n    {\n        type = QXmppPresence::Available;\n        setType(type);\n        return;\n    }\n    else\n    {\n        type = static_cast<QXmppPresence::Type>(-1);\n        qWarning(\"QXmppPresence::setTypeFromStr() invalid input string type: %s\",\n                 qPrintable(str));\n        setType(type);\n        return;\n    }\n}\n\n\/\/\/ Constructs a presence status.\n\nQXmppPresence::Status::Status(QXmppPresence::Status::Type type,\n                             const QString statusText, int priority) :\n                                m_type(type),\n                                m_statusText(statusText), m_priority(priority)\n{\n}\n\n\/\/\/ Returns the status type, for instance busy or away.\n\nQXmppPresence::Status::Type QXmppPresence::Status::type() const\n{\n    return m_type;\n}\n\n\/\/\/ Sets the status type.\n\nvoid QXmppPresence::Status::setType(QXmppPresence::Status::Type type)\n{\n    m_type = type;\n}\n\nvoid QXmppPresence::Status::setTypeFromStr(const QString& str)\n{\n    \/\/ there is no keyword for Offline\n\n    QXmppPresence::Status::Type type;\n    if(str == \"\")   \/\/ not type-attribute means online\n    {\n        type = QXmppPresence::Status::Online;\n        setType(type);\n        return;\n    }\n    else if(str == \"away\")\n    {\n        type = QXmppPresence::Status::Away;\n        setType(type);\n        return;\n    }\n    else if(str == \"xa\")\n    {\n        type = QXmppPresence::Status::XA;\n        setType(type);\n        return;\n    }\n    else if(str == \"dnd\")\n    {\n        type = QXmppPresence::Status::DND;\n        setType(type);\n        return;\n    }\n    else if(str == \"chat\")\n    {\n        type = QXmppPresence::Status::Chat;\n        setType(type);\n        return;\n    }\n    else\n    {\n        type = static_cast<QXmppPresence::Status::Type>(-1);\n        qWarning(\"QXmppPresence::Status::setTypeFromStr() invalid input string type %s\", \n            qPrintable(str));\n        setType(type);\n    }\n}\n\nQString QXmppPresence::Status::getTypeStr() const\n{\n    QString text;\n    switch(m_type)\n    {\n    case QXmppPresence::Status::Online:\n        \/\/ no type-attribute if available\n        text = \"\"; \n        break;\n    case QXmppPresence::Status::Offline:\n        text = \"\"; \n        break;\n    case QXmppPresence::Status::Away:\n        text = \"away\"; \n        break;\n    case QXmppPresence::Status::XA:\n        text = \"xa\"; \n        break;\n    case QXmppPresence::Status::DND:\n        text = \"dnd\"; \n        break;\n    case QXmppPresence::Status::Chat:\n        text = \"chat\"; \n        break;\n    default:\n        qWarning(\"QXmppPresence::Status::getTypeStr() invalid type %d\",\n                 (int)m_type);\n        break;\n    }\n    return text;\n}\n\n\/\/\/ Returns the status text, a textual description of the user's status.\n\nQString QXmppPresence::Status::statusText() const\n{\n    return m_statusText;\n}\n\n\/\/\/ Sets the status text, a textual description of the user's status.\n\/\/\/\n\/\/\/ \\param str The status text, for example \"Gone fishing\".\n\nvoid QXmppPresence::Status::setStatusText(const QString& str)\n{\n    m_statusText = str;\n}\n\n\/\/\/ Returns the priority level of the resource.\n\nint QXmppPresence::Status::priority() const\n{\n    return m_priority;\n}\n\n\/\/\/ Sets the priority level of the resource.\n\/\/\/\n\/\/\/ \\param priority\n\nvoid QXmppPresence::Status::setPriority(int priority)\n{\n    m_priority = priority;\n}\n\nvoid QXmppPresence::Status::parse(const QDomElement &element)\n{\n    setTypeFromStr(element.firstChildElement(\"show\").text());\n    m_statusText = element.firstChildElement(\"status\").text();\n    m_priority = element.firstChildElement(\"priority\").text().toInt();\n}\n\nvoid QXmppPresence::Status::toXml(QXmlStreamWriter *xmlWriter) const\n{\n    const QString show = getTypeStr();\n    if (!show.isEmpty())\n        helperToXmlAddTextElement(xmlWriter, \"show\", getTypeStr());\n    if (!m_statusText.isEmpty())\n        helperToXmlAddTextElement(xmlWriter, \"status\", m_statusText);\n    if (m_priority != 0)\n        helperToXmlAddNumberElement(xmlWriter, \"priority\", m_priority);\n}\n\nQByteArray QXmppPresence::photoHash() const\n{\n    return m_photoHash;\n}\n\nvoid QXmppPresence::setPhotoHash(const QByteArray& photoHash)\n{\n    m_photoHash = photoHash;\n}\n\nQXmppPresence::VCardUpdateType QXmppPresence::vCardUpdateType()\n{\n    return m_vCardUpdateType;\n}\n\nvoid QXmppPresence::setVCardUpdateType(VCardUpdateType type)\n{\n    m_vCardUpdateType = type;\n}\n\n\/\/\/ XEP-0115: Entity Capabilities\nQString QXmppPresence::capabilityHash()\n{\n    return m_capabilityHash;\n}\n\n\/\/\/ XEP-0115: Entity Capabilities\nvoid QXmppPresence::setCapabilityHash(const QString& hash)\n{\n    m_capabilityHash = hash;\n}\n\n\/\/\/ XEP-0115: Entity Capabilities\nQString QXmppPresence::capabilityNode()\n{\n    return m_capabilityNode;\n}\n\n\/\/\/ XEP-0115: Entity Capabilities\nvoid QXmppPresence::setCapabilityNode(const QString& node)\n{\n    m_capabilityNode = node;\n}\n\n\/\/\/ XEP-0115: Entity Capabilities\nQByteArray QXmppPresence::capabilityVer()\n{\n    return m_capabilityVer;\n}\n\n\/\/\/ XEP-0115: Entity Capabilities\nvoid QXmppPresence::setCapabilityVer(const QByteArray& ver)\n{\n    m_capabilityVer = ver;\n}\n\n\/\/\/ Legacy XEP-0115: Entity Capabilities\nQStringList QXmppPresence::capabilityExt()\n{\n    return m_capabilityExt;\n}\n\n\/\/\/ \\cond\n\nQXmppPresence::Type QXmppPresence::getType() const\n{\n    return m_type;\n}\n\nconst QXmppPresence::Status& QXmppPresence::getStatus() const\n{\n    return m_status;\n}\n\nQXmppPresence::Status& QXmppPresence::getStatus()\n{\n    return m_status;\n}\n\nQXmppPresence::Status::Type QXmppPresence::Status::getType() const\n{\n    return m_type;\n}\n\nQString QXmppPresence::Status::getStatusText() const\n{\n    return m_statusText;\n}\n\nint QXmppPresence::Status::getPriority() const\n{\n    return m_priority;\n}\n\n\/\/\/ \\endcond\n<commit_msg>more doc<commit_after>\/*\n * Copyright (C) 2008-2010 The QXmpp developers\n *\n * Author:\n *  Manjeet Dahiya\n *\n * Source:\n *  http:\/\/code.google.com\/p\/qxmpp\n *\n * This file is a part of QXmpp 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\n#include \"QXmppPresence.h\"\n#include \"QXmppUtils.h\"\n#include <QtDebug>\n#include <QDomElement>\n#include <QXmlStreamWriter>\n#include \"QXmppConstants.h\"\n\n\/\/\/ Constructs a QXmppPresence.\n\/\/\/\n\/\/\/ \\param type\n\/\/\/ \\param status\n\nQXmppPresence::QXmppPresence(QXmppPresence::Type type,\n                             const QXmppPresence::Status& status)\n    : QXmppStanza(),\n    m_type(type),\n    m_status(status),\n    m_vCardUpdateType(VCardUpdateNone)\n{\n\n}\n\n\/\/\/ Destroys a QXmppPresence.\n\nQXmppPresence::~QXmppPresence()\n{\n\n}\n\n\/\/\/ Returns the presence type.\n\/\/\/\n\/\/\/ You can use this method to determine the action which needs to be\n\/\/\/ taken in response to receiving the presence. For instance, if the type is\n\/\/\/ QXmppPresence::Available or QXmppPresence::Unavailable, you could update\n\/\/\/ the icon representing a contact's availability.\n\nQXmppPresence::Type QXmppPresence::type() const\n{\n    return m_type;\n}\n\n\/\/\/ Sets the presence type.\n\/\/\/\n\/\/\/ \\param type\n\nvoid QXmppPresence::setType(QXmppPresence::Type type)\n{\n    m_type = type;\n}\n\n\/\/\/ Returns the presence status.\n\nconst QXmppPresence::Status& QXmppPresence::status() const\n{\n    return m_status;\n}\n\n\/\/\/ Returns a reference to the presence status, allowing you to change it.\n\nQXmppPresence::Status& QXmppPresence::status()\n{\n    return m_status;\n}\n\n\/\/\/ Sets the presence status.\n\/\/\/\n\/\/\/ \\param status\n\nvoid QXmppPresence::setStatus(const QXmppPresence::Status& status)\n{\n    m_status = status;\n}\n\nvoid QXmppPresence::parse(const QDomElement &element)\n{\n    QXmppStanza::parse(element);\n\n    setTypeFromStr(element.attribute(\"type\"));\n    m_status.parse(element);\n\n    QXmppElementList extensions;\n    QDomElement xElement = element.firstChildElement();\n    m_vCardUpdateType = VCardUpdateNone;\n    while(!xElement.isNull())\n    {\n        \/\/ XEP-0153: vCard-Based Avatars\n        if(xElement.namespaceURI() == ns_vcard_update)\n        {\n            QDomElement photoElement = xElement.firstChildElement(\"photo\");\n            if(!photoElement.isNull())\n            {\n                m_photoHash = QByteArray::fromHex(photoElement.text().toAscii());\n                if(m_photoHash.isEmpty())\n                    m_vCardUpdateType = VCardUpdateNoPhoto;\n                else\n                    m_vCardUpdateType = VCardUpdateValidPhoto;\n            }\n            else\n            {\n                m_photoHash = QByteArray();\n                m_vCardUpdateType = VCardUpdateNotReady;\n            }\n        }\n        \/\/ XEP-0115: Entity Capabilities\n        else if(xElement.tagName() == \"c\" && xElement.namespaceURI() == ns_capabilities)\n        {\n            m_capabilityNode = xElement.attribute(\"node\");\n            m_capabilityVer = QByteArray::fromBase64(xElement.attribute(\"ver\").toAscii());\n            m_capabilityHash = xElement.attribute(\"hash\");\n            m_capabilityExt = xElement.attribute(\"ext\").split(\" \", QString::SkipEmptyParts);\n        }\n        else if (xElement.tagName() == \"error\")\n        {\n        }\n        else if (xElement.tagName() == \"show\")\n        {\n        }\n        else if (xElement.tagName() == \"status\")\n        {\n        }\n        else if (xElement.tagName() == \"priority\")\n        {\n        }\n        else\n        {\n            \/\/ other extensions\n            extensions << QXmppElement(xElement);\n        }\n        xElement = xElement.nextSiblingElement();\n    }\n    setExtensions(extensions);\n}\n\nvoid QXmppPresence::toXml(QXmlStreamWriter *xmlWriter) const\n{\n    xmlWriter->writeStartElement(\"presence\");\n    helperToXmlAddAttribute(xmlWriter,\"xml:lang\", lang());\n    helperToXmlAddAttribute(xmlWriter,\"id\", id());\n    helperToXmlAddAttribute(xmlWriter,\"to\", to());\n    helperToXmlAddAttribute(xmlWriter,\"from\", from());\n    helperToXmlAddAttribute(xmlWriter,\"type\", getTypeStr());\n    m_status.toXml(xmlWriter);\n\n    error().toXml(xmlWriter);\n\n    \/\/ XEP-0153: vCard-Based Avatars\n    if(m_vCardUpdateType != VCardUpdateNone)\n    {\n        xmlWriter->writeStartElement(\"x\");\n        helperToXmlAddAttribute(xmlWriter, \"xmlns\", ns_vcard_update);\n        switch(m_vCardUpdateType)\n        {\n        case VCardUpdateNoPhoto:\n            helperToXmlAddTextElement(xmlWriter, \"photo\", \"\");\n            break;\n        case VCardUpdateValidPhoto:\n            helperToXmlAddTextElement(xmlWriter, \"photo\", m_photoHash.toHex());\n            break;\n        case VCardUpdateNotReady:\n            break;\n        default:\n            break;\n        }\n        xmlWriter->writeEndElement();\n    }\n\n    if(!m_capabilityNode.isEmpty() && !m_capabilityVer.isEmpty()\n        && !m_capabilityHash.isEmpty())\n    {\n        xmlWriter->writeStartElement(\"c\");\n        helperToXmlAddAttribute(xmlWriter, \"xmlns\", ns_capabilities);\n        helperToXmlAddAttribute(xmlWriter, \"hash\", m_capabilityHash);\n        helperToXmlAddAttribute(xmlWriter, \"node\", m_capabilityNode);\n        helperToXmlAddAttribute(xmlWriter, \"ver\", m_capabilityVer.toBase64());\n        xmlWriter->writeEndElement();\n    }\n\n    foreach (const QXmppElement &extension, extensions())\n        extension.toXml(xmlWriter);\n\n    xmlWriter->writeEndElement();\n}\n\nQString QXmppPresence::getTypeStr() const\n{\n    QString text;\n    switch(m_type)\n    {\n    case QXmppPresence::Error:\n        text = \"error\"; \n        break;\n    case QXmppPresence::Available:\n        \/\/ no type-attribute if available\n        text = \"\"; \n        break;\n    case QXmppPresence::Unavailable:\n        text = \"unavailable\"; \n        break;\n    case QXmppPresence::Subscribe:\n        text = \"subscribe\"; \n        break;\n    case QXmppPresence::Subscribed:\n        text = \"subscribed\"; \n        break;\n    case QXmppPresence::Unsubscribe:\n        text = \"unsubscribe\"; \n        break;\n    case QXmppPresence::Unsubscribed:\n        text = \"unsubscribed\"; \n        break;\n    case QXmppPresence::Probe:\n        text = \"probe\"; \n        break;\n    default:\n        qWarning(\"QXmppPresence::getTypeStr() invalid type %d\", (int)m_type);\n        break;\n    }\n    return text;\n}\n\nvoid QXmppPresence::setTypeFromStr(const QString& str)\n{\n    QXmppPresence::Type type;\n    if(str == \"error\")\n    {\n        type = QXmppPresence::Error;\n        setType(type);\n        return;\n    }\n    else if(str == \"unavailable\")\n    {\n        type = QXmppPresence::Unavailable;\n        setType(type);\n        return;\n    }\n    else if(str == \"subscribe\")\n    {\n        type = QXmppPresence::Subscribe;\n        setType(type);\n        return;\n    }\n    else if(str == \"subscribed\")\n    {\n        type = QXmppPresence::Subscribed;\n        setType(type);\n        return;\n    }\n    else if(str == \"unsubscribe\")\n    {\n        type = QXmppPresence::Unsubscribe;\n        setType(type);\n        return;\n    }\n    else if(str == \"unsubscribed\")\n    {\n        type = QXmppPresence::Unsubscribed;\n        setType(type);\n        return;\n    }\n    else if(str == \"probe\")\n    {\n        type = QXmppPresence::Probe;\n        setType(type);\n        return;\n    }\n    else if(str == \"\")\n    {\n        type = QXmppPresence::Available;\n        setType(type);\n        return;\n    }\n    else\n    {\n        type = static_cast<QXmppPresence::Type>(-1);\n        qWarning(\"QXmppPresence::setTypeFromStr() invalid input string type: %s\",\n                 qPrintable(str));\n        setType(type);\n        return;\n    }\n}\n\n\/\/\/ Constructs a presence status.\n\nQXmppPresence::Status::Status(QXmppPresence::Status::Type type,\n                             const QString statusText, int priority) :\n                                m_type(type),\n                                m_statusText(statusText), m_priority(priority)\n{\n}\n\n\/\/\/ Returns the status type, for instance busy or away.\n\nQXmppPresence::Status::Type QXmppPresence::Status::type() const\n{\n    return m_type;\n}\n\n\/\/\/ Sets the status type.\n\nvoid QXmppPresence::Status::setType(QXmppPresence::Status::Type type)\n{\n    m_type = type;\n}\n\nvoid QXmppPresence::Status::setTypeFromStr(const QString& str)\n{\n    \/\/ there is no keyword for Offline\n\n    QXmppPresence::Status::Type type;\n    if(str == \"\")   \/\/ not type-attribute means online\n    {\n        type = QXmppPresence::Status::Online;\n        setType(type);\n        return;\n    }\n    else if(str == \"away\")\n    {\n        type = QXmppPresence::Status::Away;\n        setType(type);\n        return;\n    }\n    else if(str == \"xa\")\n    {\n        type = QXmppPresence::Status::XA;\n        setType(type);\n        return;\n    }\n    else if(str == \"dnd\")\n    {\n        type = QXmppPresence::Status::DND;\n        setType(type);\n        return;\n    }\n    else if(str == \"chat\")\n    {\n        type = QXmppPresence::Status::Chat;\n        setType(type);\n        return;\n    }\n    else\n    {\n        type = static_cast<QXmppPresence::Status::Type>(-1);\n        qWarning(\"QXmppPresence::Status::setTypeFromStr() invalid input string type %s\", \n            qPrintable(str));\n        setType(type);\n    }\n}\n\nQString QXmppPresence::Status::getTypeStr() const\n{\n    QString text;\n    switch(m_type)\n    {\n    case QXmppPresence::Status::Online:\n        \/\/ no type-attribute if available\n        text = \"\"; \n        break;\n    case QXmppPresence::Status::Offline:\n        text = \"\"; \n        break;\n    case QXmppPresence::Status::Away:\n        text = \"away\"; \n        break;\n    case QXmppPresence::Status::XA:\n        text = \"xa\"; \n        break;\n    case QXmppPresence::Status::DND:\n        text = \"dnd\"; \n        break;\n    case QXmppPresence::Status::Chat:\n        text = \"chat\"; \n        break;\n    default:\n        qWarning(\"QXmppPresence::Status::getTypeStr() invalid type %d\",\n                 (int)m_type);\n        break;\n    }\n    return text;\n}\n\n\/\/\/ Returns the status text, a textual description of the user's status.\n\nQString QXmppPresence::Status::statusText() const\n{\n    return m_statusText;\n}\n\n\/\/\/ Sets the status text, a textual description of the user's status.\n\/\/\/\n\/\/\/ \\param str The status text, for example \"Gone fishing\".\n\nvoid QXmppPresence::Status::setStatusText(const QString& str)\n{\n    m_statusText = str;\n}\n\n\/\/\/ Returns the priority level of the resource.\n\nint QXmppPresence::Status::priority() const\n{\n    return m_priority;\n}\n\n\/\/\/ Sets the priority level of the resource.\n\/\/\/\n\/\/\/ \\param priority\n\nvoid QXmppPresence::Status::setPriority(int priority)\n{\n    m_priority = priority;\n}\n\nvoid QXmppPresence::Status::parse(const QDomElement &element)\n{\n    setTypeFromStr(element.firstChildElement(\"show\").text());\n    m_statusText = element.firstChildElement(\"status\").text();\n    m_priority = element.firstChildElement(\"priority\").text().toInt();\n}\n\nvoid QXmppPresence::Status::toXml(QXmlStreamWriter *xmlWriter) const\n{\n    const QString show = getTypeStr();\n    if (!show.isEmpty())\n        helperToXmlAddTextElement(xmlWriter, \"show\", getTypeStr());\n    if (!m_statusText.isEmpty())\n        helperToXmlAddTextElement(xmlWriter, \"status\", m_statusText);\n    if (m_priority != 0)\n        helperToXmlAddNumberElement(xmlWriter, \"priority\", m_priority);\n}\n\n\/\/\/ Returns the photo-hash of the VCardUpdate.\n\/\/\/\n\/\/\/ \\return QByteArray\n\nQByteArray QXmppPresence::photoHash() const\n{\n    return m_photoHash;\n}\n\n\/\/\/ Sets the photo-hash of the VCardUpdate.\n\/\/\/\n\/\/\/ \\param photoHash as QByteArray\n\nvoid QXmppPresence::setPhotoHash(const QByteArray& photoHash)\n{\n    m_photoHash = photoHash;\n}\n\n\/\/\/ Returns the type of VCardUpdate\n\/\/\/\n\/\/\/ \\return VCardUpdateType\n\nQXmppPresence::VCardUpdateType QXmppPresence::vCardUpdateType()\n{\n    return m_vCardUpdateType;\n}\n\n\/\/\/ Sets the type of VCardUpdate\n\/\/\/\n\/\/\/ \\param type VCardUpdateType\n\nvoid QXmppPresence::setVCardUpdateType(VCardUpdateType type)\n{\n    m_vCardUpdateType = type;\n}\n\n\/\/\/ XEP-0115: Entity Capabilities\nQString QXmppPresence::capabilityHash()\n{\n    return m_capabilityHash;\n}\n\n\/\/\/ XEP-0115: Entity Capabilities\nvoid QXmppPresence::setCapabilityHash(const QString& hash)\n{\n    m_capabilityHash = hash;\n}\n\n\/\/\/ XEP-0115: Entity Capabilities\nQString QXmppPresence::capabilityNode()\n{\n    return m_capabilityNode;\n}\n\n\/\/\/ XEP-0115: Entity Capabilities\nvoid QXmppPresence::setCapabilityNode(const QString& node)\n{\n    m_capabilityNode = node;\n}\n\n\/\/\/ XEP-0115: Entity Capabilities\nQByteArray QXmppPresence::capabilityVer()\n{\n    return m_capabilityVer;\n}\n\n\/\/\/ XEP-0115: Entity Capabilities\nvoid QXmppPresence::setCapabilityVer(const QByteArray& ver)\n{\n    m_capabilityVer = ver;\n}\n\n\/\/\/ Legacy XEP-0115: Entity Capabilities\nQStringList QXmppPresence::capabilityExt()\n{\n    return m_capabilityExt;\n}\n\n\/\/\/ \\cond\n\nQXmppPresence::Type QXmppPresence::getType() const\n{\n    return m_type;\n}\n\nconst QXmppPresence::Status& QXmppPresence::getStatus() const\n{\n    return m_status;\n}\n\nQXmppPresence::Status& QXmppPresence::getStatus()\n{\n    return m_status;\n}\n\nQXmppPresence::Status::Type QXmppPresence::Status::getType() const\n{\n    return m_type;\n}\n\nQString QXmppPresence::Status::getStatusText() const\n{\n    return m_statusText;\n}\n\nint QXmppPresence::Status::getPriority() const\n{\n    return m_priority;\n}\n\n\/\/\/ \\endcond\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Fix release-only build break.<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>Free old transport DIBs for which no PluginHostMsg_UpdateGeometry_ACK was received when destroying a WebPluginDelegateProxy.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ File_SequenceInfo - Info for XML files starting with SEQUENCEINFO\r\n\/\/ Copyright (C) 2012-2012 MediaArea.net SARL, Info@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\/\/ 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_SEQUENCEINFO_YES)\r\n\/\/---------------------------------------------------------------------------\r\n\r\n\/\/---------------------------------------------------------------------------\r\n#include \"MediaInfo\/Multiple\/File_SequenceInfo.h\"\r\n#include \"MediaInfo\/MediaInfo.h\"\r\n#include \"MediaInfo\/MediaInfo_Internal.h\"\r\n#include \"MediaInfo\/Multiple\/File__ReferenceFilesHelper.h\"\r\n#include \"ZenLib\/File.h\"\r\n#include \"ZenLib\/Dir.h\"\r\n#include \"ZenLib\/FileName.h\"\r\n#include \"ZenLib\/TinyXml\/tinyxml.h\"\r\n#include \"ZenLib\/Format\/Http\/Http_Utils.h\"\r\n\/\/---------------------------------------------------------------------------\r\n\r\nnamespace MediaInfoLib\r\n{\r\n\r\n\/\/***************************************************************************\r\n\/\/ Constructor\/Destructor\r\n\/\/***************************************************************************\r\n\r\n\/\/---------------------------------------------------------------------------\r\nFile_SequenceInfo::File_SequenceInfo()\r\n:File__Analyze()\r\n{\r\n    \/\/Temp\r\n    ReferenceFiles=NULL;\r\n}\r\n\r\n\/\/---------------------------------------------------------------------------\r\nFile_SequenceInfo::~File_SequenceInfo()\r\n{\r\n    delete ReferenceFiles; \/\/ReferenceFiles=NULL;\r\n}\r\n\r\n\/\/***************************************************************************\r\n\/\/ Streams management\r\n\/\/***************************************************************************\r\n\r\n\/\/---------------------------------------------------------------------------\r\nvoid File_SequenceInfo::Streams_Finish()\r\n{\r\n    if (ReferenceFiles==NULL)\r\n        return;\r\n\r\n    ReferenceFiles->ParseReferences();\r\n}\r\n\r\n\/\/***************************************************************************\r\n\/\/ Buffer - Global\r\n\/\/***************************************************************************\r\n\r\n\/\/---------------------------------------------------------------------------\r\n#if MEDIAINFO_SEEK\r\nsize_t File_SequenceInfo::Read_Buffer_Seek (size_t Method, int64u Value, int64u ID)\r\n{\r\n    if (ReferenceFiles==NULL)\r\n        return 0;\r\n\r\n    return ReferenceFiles->Read_Buffer_Seek(Method, Value, ID);\r\n}\r\n#endif \/\/MEDIAINFO_SEEK\r\n\r\n\/\/***************************************************************************\r\n\/\/ Buffer - File header\r\n\/\/***************************************************************************\r\n\r\n\/\/---------------------------------------------------------------------------\r\nbool File_SequenceInfo::FileHeader_Begin()\r\n{\r\n    \/\/Element_Size\r\n    if (File_Size>1024*1024)\r\n    {\r\n        Reject(\"SequenceInfo\");\r\n        return false; \/\/SequenceInfo files are not big\r\n    }\r\n\r\n    TiXmlDocument document(File_Name.To_Local());\r\n    if (document.LoadFile())\r\n    {\r\n        TiXmlElement* Root=document.FirstChildElement(\"SEQUENCEINFO\");\r\n        if (Root)\r\n        {\r\n            Accept(\"SequenceInfo\");\r\n            Fill(Stream_General, 0, General_Format, \"SequenceInfo\");\r\n\r\n            ReferenceFiles=new File__ReferenceFilesHelper(this, Config);\r\n\r\n            File__ReferenceFilesHelper::reference ReferenceFile;\r\n\r\n            FileName FN(File_Name);\r\n            Ztring Base=FN.Path_Get();\r\n            size_t Pos=Base.rfind(PathSeparator);\r\n            if (Pos!=string::npos)\r\n            {\r\n                Ztring ToAdd=Base.substr(Pos, string::npos);\r\n                Pos=ToAdd.rfind(_T('_'));\r\n                if (Pos!=string::npos)\r\n                {\r\n                    Ztring Extension=ToAdd.substr(Pos+1, string::npos);\r\n                    Ztring DirectoryBase=Base;\r\n                    DirectoryBase+=ToAdd;\r\n                    DirectoryBase+=_T('_');\r\n\r\n                    size_t DirNumberCount=1;\r\n                    Ztring Directory=DirectoryBase;\r\n                    for (; DirNumberCount<9; DirNumberCount++)\r\n                    {\r\n                        Directory+=_T('0');\r\n                        if (Dir::Exists(Directory))\r\n                            break;\r\n                    }\r\n\r\n                    if (DirNumberCount<9)\r\n                    {\r\n                        int32u DirNumber=0;\r\n                        do\r\n                        {\r\n                            Ztring Number=Ztring::ToZtring(DirNumber);\r\n                            if (Number.size()<DirNumberCount)\r\n                                Number.insert(0, DirNumberCount-Number.size(), _T('0'));\r\n                            \r\n                            Directory=DirectoryBase;\r\n                            Directory+=Number;\r\n                            if (!Dir::Exists(Directory))\r\n                                break;\r\n\r\n                            Ztring FileBase=Directory;\r\n                            FileBase+=ToAdd;\r\n                            FileBase+=_T('_');\r\n                            FileBase+=_T('.');\r\n                            FileBase+=Extension;\r\n\r\n                            size_t FileNumberCount=1;\r\n                            Ztring FullFile=FileBase;\r\n                            for (; FileNumberCount<10; FileNumberCount++)\r\n                            {\r\n                                FullFile.insert(FullFile.begin()+FullFile.size()-Extension.size()-1, _T('0'));\r\n                                if (File::Exists(FullFile))\r\n                                    break;\r\n                            }\r\n                            bool FromZero=true;\r\n                            if (FileNumberCount>=9)\r\n                            {\r\n                                \/\/Trying with consecutive file numbers betweens dirs\r\n                                Number=Ztring::ToZtring(ReferenceFiles->References.size());\r\n                                FullFile=FileBase;\r\n                                FullFile.insert(FullFile.size()-Extension.size()-1, Number);\r\n                                FileNumberCount=Number.size();\r\n                                if (!File::Exists(FullFile))\r\n                                {\r\n                                    FileNumberCount++;\r\n                                    for (; FileNumberCount<10; FileNumberCount++)\r\n                                    {\r\n                                        FullFile.insert(FullFile.begin()+FullFile.size()-Extension.size()-Number.size()-1, _T('0'));\r\n                                        if (File::Exists(FullFile))\r\n                                        {\r\n                                            FromZero=false;\r\n                                            break;\r\n                                        }\r\n                                    }\r\n                                }\r\n                                else\r\n                                    FromZero=false;\r\n                            }\r\n\r\n                            if (FileNumberCount<9)\r\n                            {\r\n                                int32u FileNumber=FromZero?0:ReferenceFiles->References.size();\r\n                                do\r\n                                {\r\n                                    Number=Ztring::ToZtring(FileNumber);\r\n                                    if (Number.size()<FileNumberCount)\r\n                                        Number.insert(0, FileNumberCount-Number.size(), _T('0'));\r\n                            \r\n                                    FullFile=FileBase;\r\n                                    FullFile.insert(FullFile.size()-Extension.size()-1, Number);\r\n                                    if (!File::Exists(FullFile))\r\n                                        break;\r\n\r\n                                    ReferenceFile.FileNames.push_back(Base);\r\n                                    ReferenceFiles->References.push_back(ReferenceFile);\r\n\r\n                                    FileNumber++;\r\n                                }\r\n                                while (FileNumber<1000000000);\r\n                            }\r\n\r\n                            DirNumber++;\r\n                        }\r\n                        while (DirNumber<1000000000);\r\n                    }\r\n                }\r\n            }\r\n        }\r\n        else\r\n        {\r\n            Reject(\"SequenceInfo\");\r\n            return false;\r\n        }\r\n    }\r\n    else\r\n    {\r\n        Reject(\"SequenceInfo\");\r\n        return false;\r\n    }\r\n\r\n    \/\/All should be OK...\r\n    return true;\r\n}\r\n\r\n} \/\/NameSpace\r\n\r\n#endif \/\/MEDIAINFO_SEQUENCEINFO_YES\r\n\r\n<commit_msg>+ SequenceInfo XML format support (update)<commit_after>\/\/ File_SequenceInfo - Info for XML files starting with SEQUENCEINFO\r\n\/\/ Copyright (C) 2012-2012 MediaArea.net SARL, Info@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\/\/ 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_SEQUENCEINFO_YES)\r\n\/\/---------------------------------------------------------------------------\r\n\r\n\/\/---------------------------------------------------------------------------\r\n#include \"MediaInfo\/Multiple\/File_SequenceInfo.h\"\r\n#include \"MediaInfo\/MediaInfo.h\"\r\n#include \"MediaInfo\/MediaInfo_Internal.h\"\r\n#include \"MediaInfo\/Multiple\/File__ReferenceFilesHelper.h\"\r\n#include \"ZenLib\/File.h\"\r\n#include \"ZenLib\/Dir.h\"\r\n#include \"ZenLib\/FileName.h\"\r\n#include \"ZenLib\/TinyXml\/tinyxml.h\"\r\n#include \"ZenLib\/Format\/Http\/Http_Utils.h\"\r\n\/\/---------------------------------------------------------------------------\r\n\r\nnamespace MediaInfoLib\r\n{\r\n\r\n\/\/***************************************************************************\r\n\/\/ Constructor\/Destructor\r\n\/\/***************************************************************************\r\n\r\n\/\/---------------------------------------------------------------------------\r\nFile_SequenceInfo::File_SequenceInfo()\r\n:File__Analyze()\r\n{\r\n    \/\/Temp\r\n    ReferenceFiles=NULL;\r\n}\r\n\r\n\/\/---------------------------------------------------------------------------\r\nFile_SequenceInfo::~File_SequenceInfo()\r\n{\r\n    delete ReferenceFiles; \/\/ReferenceFiles=NULL;\r\n}\r\n\r\n\/\/***************************************************************************\r\n\/\/ Streams management\r\n\/\/***************************************************************************\r\n\r\n\/\/---------------------------------------------------------------------------\r\nvoid File_SequenceInfo::Streams_Finish()\r\n{\r\n    if (ReferenceFiles==NULL)\r\n        return;\r\n\r\n    ReferenceFiles->ParseReferences();\r\n}\r\n\r\n\/\/***************************************************************************\r\n\/\/ Buffer - Global\r\n\/\/***************************************************************************\r\n\r\n\/\/---------------------------------------------------------------------------\r\n#if MEDIAINFO_SEEK\r\nsize_t File_SequenceInfo::Read_Buffer_Seek (size_t Method, int64u Value, int64u ID)\r\n{\r\n    if (ReferenceFiles==NULL)\r\n        return 0;\r\n\r\n    return ReferenceFiles->Read_Buffer_Seek(Method, Value, ID);\r\n}\r\n#endif \/\/MEDIAINFO_SEEK\r\n\r\n\/\/***************************************************************************\r\n\/\/ Buffer - File header\r\n\/\/***************************************************************************\r\n\r\n\/\/---------------------------------------------------------------------------\r\nbool File_SequenceInfo::FileHeader_Begin()\r\n{\r\n    \/\/Element_Size\r\n    if (File_Size>1024*1024)\r\n    {\r\n        Reject(\"SequenceInfo\");\r\n        return false; \/\/SequenceInfo files are not big\r\n    }\r\n\r\n    TiXmlDocument document(File_Name.To_Local());\r\n    if (document.LoadFile())\r\n    {\r\n        TiXmlElement* Root=document.FirstChildElement(\"SEQUENCEINFO\");\r\n        if (Root)\r\n        {\r\n            Accept(\"SequenceInfo\");\r\n            Fill(Stream_General, 0, General_Format, \"SequenceInfo\");\r\n\r\n            ReferenceFiles=new File__ReferenceFilesHelper(this, Config);\r\n\r\n            File__ReferenceFilesHelper::reference ReferenceFile;\r\n            ReferenceFile.StreamKind=Stream_Video;\r\n\r\n            FileName FN(File_Name);\r\n            Ztring Base=FN.Path_Get();\r\n            size_t Pos=Base.rfind(PathSeparator);\r\n            if (Pos!=string::npos)\r\n            {\r\n                Ztring ToAdd=Base.substr(Pos, string::npos);\r\n                Pos=ToAdd.rfind(_T('_'));\r\n                if (Pos!=string::npos)\r\n                {\r\n                    Ztring Extension=ToAdd.substr(Pos+1, string::npos);\r\n                    Ztring DirectoryBase=Base;\r\n                    DirectoryBase+=ToAdd;\r\n                    DirectoryBase+=_T('_');\r\n\r\n                    size_t DirNumberCount=1;\r\n                    Ztring Directory=DirectoryBase;\r\n                    for (; DirNumberCount<9; DirNumberCount++)\r\n                    {\r\n                        Directory+=_T('0');\r\n                        if (Dir::Exists(Directory))\r\n                            break;\r\n                    }\r\n\r\n                    if (DirNumberCount<9)\r\n                    {\r\n                        int32u DirNumber=0;\r\n                        do\r\n                        {\r\n                            Ztring Number=Ztring::ToZtring(DirNumber);\r\n                            if (Number.size()<DirNumberCount)\r\n                                Number.insert(0, DirNumberCount-Number.size(), _T('0'));\r\n                            \r\n                            Directory=DirectoryBase;\r\n                            Directory+=Number;\r\n                            if (!Dir::Exists(Directory))\r\n                                break;\r\n\r\n                            Ztring FileBase=Directory;\r\n                            FileBase+=ToAdd;\r\n                            FileBase+=_T('_');\r\n                            FileBase+=_T('.');\r\n                            FileBase+=Extension;\r\n\r\n                            size_t FileNumberCount=1;\r\n                            Ztring FullFile=FileBase;\r\n                            for (; FileNumberCount<10; FileNumberCount++)\r\n                            {\r\n                                FullFile.insert(FullFile.begin()+FullFile.size()-Extension.size()-1, _T('0'));\r\n                                if (File::Exists(FullFile))\r\n                                    break;\r\n                            }\r\n                            bool FromZero=true;\r\n                            if (FileNumberCount>=9)\r\n                            {\r\n                                \/\/Trying with consecutive file numbers betweens dirs\r\n                                Number=Ztring::ToZtring(ReferenceFile.FileNames.size());\r\n                                FullFile=FileBase;\r\n                                FullFile.insert(FullFile.size()-Extension.size()-1, Number);\r\n                                FileNumberCount=Number.size();\r\n                                if (!File::Exists(FullFile))\r\n                                {\r\n                                    FileNumberCount++;\r\n                                    for (; FileNumberCount<10; FileNumberCount++)\r\n                                    {\r\n                                        FullFile.insert(FullFile.begin()+FullFile.size()-Extension.size()-Number.size()-1, _T('0'));\r\n                                        if (File::Exists(FullFile))\r\n                                        {\r\n                                            FromZero=false;\r\n                                            break;\r\n                                        }\r\n                                    }\r\n                                }\r\n                                else\r\n                                    FromZero=false;\r\n                            }\r\n\r\n                            if (FileNumberCount<9)\r\n                            {\r\n                                int32u FileNumber=FromZero?0:ReferenceFile.FileNames.size();\r\n                                do\r\n                                {\r\n                                    Number=Ztring::ToZtring(FileNumber);\r\n                                    if (Number.size()<FileNumberCount)\r\n                                        Number.insert(0, FileNumberCount-Number.size(), _T('0'));\r\n                            \r\n                                    FullFile=FileBase;\r\n                                    FullFile.insert(FullFile.size()-Extension.size()-1, Number);\r\n                                    if (!File::Exists(FullFile))\r\n                                        break;\r\n\r\n                                    ReferenceFile.FileNames.push_back(FullFile);\r\n\r\n                                    FileNumber++;\r\n                                }\r\n                                while (FileNumber<1000000000);\r\n                            }\r\n\r\n                            DirNumber++;\r\n                        }\r\n                        while (DirNumber<1000000000);\r\n\r\n                        ReferenceFiles->References.push_back(ReferenceFile);\r\n                    }\r\n                }\r\n            }\r\n        }\r\n        else\r\n        {\r\n            Reject(\"SequenceInfo\");\r\n            return false;\r\n        }\r\n    }\r\n    else\r\n    {\r\n        Reject(\"SequenceInfo\");\r\n        return false;\r\n    }\r\n\r\n    \/\/All should be OK...\r\n    return true;\r\n}\r\n\r\n} \/\/NameSpace\r\n\r\n#endif \/\/MEDIAINFO_SEQUENCEINFO_YES\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * The Apache Software License, Version 1.1\n *\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 \"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(PREFIXRESOLVER_HEADER_GUARD_1357924680)\n#define PREFIXRESOLVER_HEADER_GUARD_1357924680\n\n\n\n\/\/ Base include file.  Must be first.\n#include <PlatformSupport\/PlatformSupportDefinitions.hpp>\n\n\n\n#include <XalanDOM\/XalanDOMString.hpp>\n\n\n\n\/**\n * This class defines an interface for classes that resolve namespace prefixes\n * to their URIs \n *\/\nclass XALAN_PLATFORMSUPPORT_EXPORT PrefixResolver\n{\npublic:\n\n\tPrefixResolver();\n\n\tPrefixResolver(const PrefixResolver&);\n\n\tvirtual\n\t~PrefixResolver();\n\n\t\/**\n\t * Retrieve a namespace corresponding to a prefix.  This assumes that \n\t * the PrevixResolver hold's its own namespace context, or is a namespace\n\t * context itself.\n\t *\n\t * @param prefix Prefix to resolve\n\t * @return namespace that prefix resolves to, or null if prefix is not found\n\t *\/\n\tvirtual const XalanDOMString*\n\tgetNamespaceForPrefix(const XalanDOMString&\t\tprefix) const = 0;\n\n\t\/**\n\t * Retrieve the base URI for the resolver.\n\t * \n\t * @return URI string\n\t *\/\n\tvirtual const XalanDOMString&\n\tgetURI() const = 0;\n};\n\n\n\n#endif\t\/\/ PREFIXRESOLVER_HEADER_GUARD_1357924680\n<commit_msg>Fixed typo and updated copyright.<commit_after>\/*\n * The Apache Software License, Version 1.1\n *\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 \"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(PREFIXRESOLVER_HEADER_GUARD_1357924680)\n#define PREFIXRESOLVER_HEADER_GUARD_1357924680\n\n\n\n\/\/ Base include file.  Must be first.\n#include <PlatformSupport\/PlatformSupportDefinitions.hpp>\n\n\n\n#include <XalanDOM\/XalanDOMString.hpp>\n\n\n\n\/**\n * This class defines an interface for classes that resolve namespace prefixes\n * to their URIs \n *\/\nclass XALAN_PLATFORMSUPPORT_EXPORT PrefixResolver\n{\npublic:\n\n\tPrefixResolver();\n\n\tPrefixResolver(const PrefixResolver&);\n\n\tvirtual\n\t~PrefixResolver();\n\n\t\/**\n\t * Retrieve a namespace corresponding to a prefix.  This assumes that \n\t * the PrevixResolver holds its own namespace context, or is a namespace\n\t * context itself.\n\t *\n\t * @param prefix Prefix to resolve\n\t * @return namespace that prefix resolves to, or null if prefix is not found\n\t *\/\n\tvirtual const XalanDOMString*\n\tgetNamespaceForPrefix(const XalanDOMString&\t\tprefix) const = 0;\n\n\t\/**\n\t * Retrieve the base URI for the resolver.\n\t * \n\t * @return URI string\n\t *\/\n\tvirtual const XalanDOMString&\n\tgetURI() const = 0;\n};\n\n\n\n#endif\t\/\/ PREFIXRESOLVER_HEADER_GUARD_1357924680\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\nnamespace ncv\n{\n        namespace optimize\n        {\n                \/\/ these variations have been implemented following\n                \/\/      \"A survey of nonlinear conjugate gradient methods\"\n                \/\/      by William W. Hager and Hongchao Zhang\n\n                \/\/\/\n                \/\/\/ \\brief CGD update parameters (Hestenes and Stiefel, 1952)\n                \/\/\/\n                template\n                <\n                                typename tstate,\n                                typename tscalar = typename tstate::tscalar\n                                >\n                struct cgd_step_HS\n                {\n                        cgd_step_HS()\n                        {\n                        }\n\n                        tscalar operator()(const tstate& pstate, const tstate& cstate) const\n                        {\n                                const auto& dk = pstate.d;\n                                const auto& gk = pstate.g;\n                                const auto& gk1 = cstate.g;\n                                const auto yk = gk1 - gk;\n\n                                return gk1.dot(yk) \/ dk.dot(yk);\n                        }\n\n                        const char* ls_failed_message() const\n                        {\n                                return \"line-search failed for CGD-HS!\";\n                        }\n                };\n\n                \/\/\/\n                \/\/\/ \\brief CGD update parameters (Fletcher and Reeves, 1964)\n                \/\/\/\n                template\n                <\n                                typename tstate,\n                                typename tscalar = typename tstate::tscalar\n                                >\n                struct cgd_step_FR\n                {\n                        cgd_step_FR()\n                        {\n                        }\n\n                        tscalar operator()(const tstate& pstate, const tstate& cstate) const\n                        {\n                                const auto& gk = pstate.g;\n                                const auto& gk1 = cstate.g;\n\n                                return gk1.squaredNorm() \/ gk.squaredNorm();\n                        }\n\n                        const char* ls_failed_message() const\n                        {\n                                return \"line-search failed for CGD-FR!\";\n                        }\n                };\n\n                \/\/\/\n                \/\/\/ \\brief CGD update parameters (Polak and Ribiere, 1969)\n                \/\/\/\n                template\n                <\n                                typename tstate,\n                                typename tscalar = typename tstate::tscalar\n                                >\n                struct cgd_step_PR\n                {\n                        cgd_step_PR()\n                        {\n                        }\n\n                        tscalar operator()(const tstate& pstate, const tstate& cstate) const\n                        {\n                                const auto& gk = pstate.g;\n                                const auto& gk1 = cstate.g;\n                                const auto yk = gk1 - gk;\n\n                                return gk1.dot(yk) \/ gk.squaredNorm();\n                        }\n\n                        const char* ls_failed_message() const\n                        {\n                                return \"line-search failed for CGD-PR!\";\n                        }\n                };\n\n                \/\/\/\n                \/\/\/ \\brief CGD update parameters (Fletcher - Conjugate Descent, 1987)\n                \/\/\/\n                template\n                <\n                                typename tstate,\n                                typename tscalar = typename tstate::tscalar\n                                >\n                struct cgd_step_CD\n                {\n                        cgd_step_CD()\n                        {\n                        }\n\n                        tscalar operator()(const tstate& pstate, const tstate& cstate) const\n                        {\n                                const auto& dk = pstate.d;\n                                const auto& gk = pstate.g;\n                                const auto& gk1 = cstate.g;\n\n                                return - gk1.squaredNorm() \/ dk.dot(gk);\n                        }\n\n                        const char* ls_failed_message() const\n                        {\n                                return \"line-search failed for CGD-CD!\";\n                        }\n                };\n\n                \/\/\/\n                \/\/\/ \\brief CGD update parameters (Liu and Storey, 1991)\n                \/\/\/\n                template\n                <\n                                typename tstate,\n                                typename tscalar = typename tstate::tscalar\n                                >\n                struct cgd_step_LS\n                {\n                        cgd_step_LS()\n                        {\n                        }\n\n                        tscalar operator()(const tstate& pstate, const tstate& cstate) const\n                        {\n                                const auto& dk = pstate.d;\n                                const auto& gk = pstate.g;\n                                const auto& gk1 = cstate.g;\n                                const auto yk = gk1 - gk;\n\n                                return - gk1.dot(yk) \/ dk.dot(gk);\n                        }\n\n                        const char* ls_failed_message() const\n                        {\n                                return \"line-search failed for CGD-LS!\";\n                        }\n                };\n\n                \/\/\/\n                \/\/\/ \\brief CGD update parameters (Dai and Yuan, 1999)\n                \/\/\/\n                template\n                <\n                                typename tstate,\n                                typename tscalar = typename tstate::tscalar\n                                >\n                struct cgd_step_DY\n                {\n                        cgd_step_DY()\n                        {\n                        }\n\n                        tscalar operator()(const tstate& pstate, const tstate& cstate) const\n                        {\n                                const auto& dk = pstate.d;\n                                const auto& gk = pstate.g;\n                                const auto& gk1 = cstate.g;\n                                const auto yk = gk1 - gk;\n\n                                return - gk1.squaredNorm() \/ dk.dot(yk);\n                        }\n\n                        const char* ls_failed_message() const\n                        {\n                                return \"line-search failed for CGD-DY!\";\n                        }\n                };\n\n                \/\/\/\n                \/\/\/ \\brief CGD update parameters (Hager and Zhang, 2005)\n                \/\/\/\n                template\n                <\n                                typename tstate,\n                                typename tscalar = typename tstate::tscalar\n                                >\n                struct cgd_step_N\n                {\n                        cgd_step_N()\n                        {\n                        }\n\n                        tscalar operator()(const tstate& pstate, const tstate& cstate) const\n                        {\n                                const auto& dk = pstate.d;\n                                const auto& gk = pstate.g;\n                                const auto& gk1 = cstate.g;\n                                const auto yk = gk1 - gk;\n                                const tscalar div = 1 \/ dk.dot(yk);\n\n                                return (yk - 2 * dk * yk.squaredNorm() * div).dot(gk1 * div);\n                        }\n\n                        const char* ls_failed_message() const\n                        {\n                                return \"line-search failed for CGD-N!\";\n                        }\n                };\n        }\n}\n\n<commit_msg>formatting<commit_after>#pragma once\n\nnamespace ncv\n{\n        namespace optimize\n        {\n                \/\/ these variations have been implemented following\n                \/\/      \"A survey of nonlinear conjugate gradient methods\"\n                \/\/      by William W. Hager and Hongchao Zhang\n\n                \/\/\/\n                \/\/\/ \\brief CGD update parameters (Hestenes and Stiefel, 1952)\n                \/\/\/\n                template\n                <\n                        typename tstate,\n                        typename tscalar = typename tstate::tscalar\n                >\n                struct cgd_step_HS\n                {\n                        cgd_step_HS()\n                        {\n                        }\n\n                        tscalar operator()(const tstate& pstate, const tstate& cstate) const\n                        {\n                                const auto& dk = pstate.d;\n                                const auto& gk = pstate.g;\n                                const auto& gk1 = cstate.g;\n                                const auto yk = gk1 - gk;\n\n                                return gk1.dot(yk) \/ dk.dot(yk);\n                        }\n\n                        const char* ls_failed_message() const\n                        {\n                                return \"line-search failed for CGD-HS!\";\n                        }\n                };\n\n                \/\/\/\n                \/\/\/ \\brief CGD update parameters (Fletcher and Reeves, 1964)\n                \/\/\/\n                template\n                <\n                        typename tstate,\n                        typename tscalar = typename tstate::tscalar\n                >\n                struct cgd_step_FR\n                {\n                        cgd_step_FR()\n                        {\n                        }\n\n                        tscalar operator()(const tstate& pstate, const tstate& cstate) const\n                        {\n                                const auto& gk = pstate.g;\n                                const auto& gk1 = cstate.g;\n\n                                return gk1.squaredNorm() \/ gk.squaredNorm();\n                        }\n\n                        const char* ls_failed_message() const\n                        {\n                                return \"line-search failed for CGD-FR!\";\n                        }\n                };\n\n                \/\/\/\n                \/\/\/ \\brief CGD update parameters (Polak and Ribiere, 1969)\n                \/\/\/\n                template\n                <\n                        typename tstate,\n                        typename tscalar = typename tstate::tscalar\n                >\n                struct cgd_step_PR\n                {\n                        cgd_step_PR()\n                        {\n                        }\n\n                        tscalar operator()(const tstate& pstate, const tstate& cstate) const\n                        {\n                                const auto& gk = pstate.g;\n                                const auto& gk1 = cstate.g;\n                                const auto yk = gk1 - gk;\n\n                                return gk1.dot(yk) \/ gk.squaredNorm();\n                        }\n\n                        const char* ls_failed_message() const\n                        {\n                                return \"line-search failed for CGD-PR!\";\n                        }\n                };\n\n                \/\/\/\n                \/\/\/ \\brief CGD update parameters (Fletcher - Conjugate Descent, 1987)\n                \/\/\/\n                template\n                <\n                        typename tstate,\n                        typename tscalar = typename tstate::tscalar\n                >\n                struct cgd_step_CD\n                {\n                        cgd_step_CD()\n                        {\n                        }\n\n                        tscalar operator()(const tstate& pstate, const tstate& cstate) const\n                        {\n                                const auto& dk = pstate.d;\n                                const auto& gk = pstate.g;\n                                const auto& gk1 = cstate.g;\n\n                                return - gk1.squaredNorm() \/ dk.dot(gk);\n                        }\n\n                        const char* ls_failed_message() const\n                        {\n                                return \"line-search failed for CGD-CD!\";\n                        }\n                };\n\n                \/\/\/\n                \/\/\/ \\brief CGD update parameters (Liu and Storey, 1991)\n                \/\/\/\n                template\n                <\n                        typename tstate,\n                        typename tscalar = typename tstate::tscalar\n                >\n                struct cgd_step_LS\n                {\n                        cgd_step_LS()\n                        {\n                        }\n\n                        tscalar operator()(const tstate& pstate, const tstate& cstate) const\n                        {\n                                const auto& dk = pstate.d;\n                                const auto& gk = pstate.g;\n                                const auto& gk1 = cstate.g;\n                                const auto yk = gk1 - gk;\n\n                                return - gk1.dot(yk) \/ dk.dot(gk);\n                        }\n\n                        const char* ls_failed_message() const\n                        {\n                                return \"line-search failed for CGD-LS!\";\n                        }\n                };\n\n                \/\/\/\n                \/\/\/ \\brief CGD update parameters (Dai and Yuan, 1999)\n                \/\/\/\n                template\n                <\n                        typename tstate,\n                        typename tscalar = typename tstate::tscalar\n                >\n                struct cgd_step_DY\n                {\n                        cgd_step_DY()\n                        {\n                        }\n\n                        tscalar operator()(const tstate& pstate, const tstate& cstate) const\n                        {\n                                const auto& dk = pstate.d;\n                                const auto& gk = pstate.g;\n                                const auto& gk1 = cstate.g;\n                                const auto yk = gk1 - gk;\n\n                                return - gk1.squaredNorm() \/ dk.dot(yk);\n                        }\n\n                        const char* ls_failed_message() const\n                        {\n                                return \"line-search failed for CGD-DY!\";\n                        }\n                };\n\n                \/\/\/\n                \/\/\/ \\brief CGD update parameters (Hager and Zhang, 2005)\n                \/\/\/\n                template\n                <\n                        typename tstate,\n                        typename tscalar = typename tstate::tscalar\n                >\n                struct cgd_step_N\n                {\n                        cgd_step_N()\n                        {\n                        }\n\n                        tscalar operator()(const tstate& pstate, const tstate& cstate) const\n                        {\n                                const auto& dk = pstate.d;\n                                const auto& gk = pstate.g;\n                                const auto& gk1 = cstate.g;\n                                const auto yk = gk1 - gk;\n                                const tscalar div = 1 \/ dk.dot(yk);\n\n                                return (yk - 2 * dk * yk.squaredNorm() * div).dot(gk1 * div);\n                        }\n\n                        const char* ls_failed_message() const\n                        {\n                                return \"line-search failed for CGD-N!\";\n                        }\n                };\n        }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"StorageBuffer.hpp\"\n\n#include <iostream>\n#include <cstring>\n\nStorageBuffer::StorageBuffer(const void* data, unsigned int size, VkDevice device, VkPhysicalDevice physicalDevice, VkDescriptorPool descriptorPool, VkQueue graphicsQueue, VkCommandPool commandPool) {\n    this->device = device;\n    this->physicalDevice = physicalDevice;\n    this->descriptorPool = descriptorPool;\n    this->graphicsQueue = graphicsQueue;\n    this->commandPool = commandPool;\n\n    VkBuffer stagingBuffer;\n    VkDeviceMemory stagingBufferMemory;\n\n    \/\/ Staging buffer.\n    createBuffer(size, VK_BUFFER_USAGE_STORAGE_BUFFER_BIT | VK_BUFFER_USAGE_TRANSFER_SRC_BIT, VK_MEMORY_PROPERTY_HOST_VISIBLE_BIT | VK_MEMORY_PROPERTY_HOST_COHERENT_BIT, &stagingBuffer, &stagingBufferMemory);\n\n    \/\/ Copy data to mapped memory.\n    void* mappedMemory;\n    vkMapMemory(device, stagingBufferMemory, 0, size, 0, &mappedMemory);\n    memcpy(mappedMemory, data, size);\n    vkUnmapMemory(device, stagingBufferMemory);\n\n    \/\/ Actual buffer.\n    createBuffer(size, VK_BUFFER_USAGE_STORAGE_BUFFER_BIT | VK_BUFFER_USAGE_TRANSFER_DST_BIT, VK_MEMORY_PROPERTY_HOST_COHERENT_BIT, &buffer, &bufferMemory);\n    \n    \/\/ Copy from staging buffer to actual buffer.\n    copyBuffer(stagingBuffer, buffer, size);\n\n    \/\/ Create descriptor set.\n    createDescriptorSetLayout();\n    createDescriptorSet(size);\n}\n\nStorageBuffer::~StorageBuffer() {\n    vkDestroyDescriptorSetLayout(device, descriptorSetLayout, nullptr);\n    vkDestroyBuffer(device, buffer, nullptr);\n    vkFreeMemory(device, bufferMemory, nullptr);\n}\n\nVkDescriptorSet StorageBuffer::getDescriptorSet() const {\n    return descriptorSet;\n}\n\nvoid StorageBuffer::createBuffer(VkDeviceSize size, VkBufferUsageFlags usage, VkMemoryPropertyFlags properties, VkBuffer* buffer, VkDeviceMemory* bufferMemory) {\n    \/\/ Create buffer.\n    VkBufferCreateInfo bufferInfo = {};\n    bufferInfo.sType = VK_STRUCTURE_TYPE_BUFFER_CREATE_INFO;\n    bufferInfo.size = size;\n    bufferInfo.usage = usage;\n    bufferInfo.sharingMode = VK_SHARING_MODE_EXCLUSIVE;\n\n    if (vkCreateBuffer(device, &bufferInfo, nullptr, buffer) != VK_SUCCESS) {\n        std::cerr << \"Failed to create buffer.\" << std::endl;\n        exit(-1);\n    }\n    \n    \/\/ Get information about device memory.\n    VkMemoryRequirements memoryRequirements;\n    vkGetBufferMemoryRequirements(device, *buffer, &memoryRequirements);\n    \n    VkPhysicalDeviceMemoryProperties memoryProperties;\n    vkGetPhysicalDeviceMemoryProperties(physicalDevice, &memoryProperties);\n    \n    \/\/ Find suitable memory type.\n    uint32_t memoryType;\n    for (uint32_t i = 0; i < memoryProperties.memoryTypeCount; i++) {\n        if (memoryRequirements.memoryTypeBits & (1 << i) && (memoryProperties.memoryTypes[i].propertyFlags & properties) == properties )\n            memoryType = i;\n    }\n    \n    \/\/ Allocate buffer memory.\n    VkMemoryAllocateInfo allocateInfo = {};\n    allocateInfo.sType = VK_STRUCTURE_TYPE_MEMORY_ALLOCATE_INFO;\n    allocateInfo.allocationSize = memoryRequirements.size;\n    allocateInfo.memoryTypeIndex = memoryType;\n    \n    if (vkAllocateMemory(device, &allocateInfo, nullptr, bufferMemory) != VK_SUCCESS) {\n        std::cerr << \"Failed to allocate buffer memory.\" << std::endl;\n        exit(-1);\n    }\n    \n    vkBindBufferMemory(device, *buffer, *bufferMemory, 0);\n}\n\nvoid StorageBuffer::copyBuffer(VkBuffer source, VkBuffer destination, VkDeviceSize size){\n    \/\/ Create command buffer allocation info.\n    VkCommandBufferAllocateInfo allocationInfo = {};\n    allocationInfo.sType = VK_STRUCTURE_TYPE_COMMAND_BUFFER_ALLOCATE_INFO;\n    allocationInfo.level = VK_COMMAND_BUFFER_LEVEL_PRIMARY;\n    allocationInfo.commandPool = commandPool;\n    allocationInfo.commandBufferCount = 1;\n\n    \/\/ Create command buffer.\n    VkCommandBuffer commandBuffer;\n    vkAllocateCommandBuffers(device, &allocationInfo, &commandBuffer);\n\n    \/\/ Command buffer begin info.\n    VkCommandBufferBeginInfo beginInfo = {};\n    beginInfo.sType = VK_STRUCTURE_TYPE_COMMAND_BUFFER_BEGIN_INFO;\n    beginInfo.flags = VK_COMMAND_BUFFER_USAGE_ONE_TIME_SUBMIT_BIT;\n\n    \/\/ Start recording commands.\n    vkBeginCommandBuffer(commandBuffer, &beginInfo);\n\n    VkBufferCopy copyRegion = {};\n    copyRegion.size = size;\n    vkCmdCopyBuffer(commandBuffer, source, destination, 1, &copyRegion);\n\n    vkEndCommandBuffer(commandBuffer);\n\n    VkSubmitInfo submitInfo = {};\n    submitInfo.sType = VK_STRUCTURE_TYPE_SUBMIT_INFO;\n    submitInfo.commandBufferCount = 1;\n    submitInfo.pCommandBuffers = &commandBuffer;\n\n    vkQueueSubmit(graphicsQueue, 1, &submitInfo, VK_NULL_HANDLE);\n    vkQueueWaitIdle(graphicsQueue);\n\n    vkFreeCommandBuffers(device, commandPool, 1, &commandBuffer);\n}\n\nvoid StorageBuffer::createDescriptorSetLayout() {\n    VkDescriptorSetLayoutBinding vertexLayoutBinding = {};\n    vertexLayoutBinding.binding = 0;\n    vertexLayoutBinding.descriptorType = VK_DESCRIPTOR_TYPE_STORAGE_BUFFER;\n    vertexLayoutBinding.descriptorCount = 1;\n    vertexLayoutBinding.stageFlags = VK_SHADER_STAGE_VERTEX_BIT;\n    vertexLayoutBinding.pImmutableSamplers = nullptr;\n    \n    VkDescriptorSetLayoutCreateInfo layoutInfo = {};\n    layoutInfo.sType = VK_STRUCTURE_TYPE_DESCRIPTOR_SET_LAYOUT_CREATE_INFO;\n    layoutInfo.bindingCount = 1;\n    layoutInfo.pBindings = &vertexLayoutBinding;\n    \n    if (vkCreateDescriptorSetLayout(device, &layoutInfo, nullptr, &descriptorSetLayout)) {\n        std::cerr << \"Could not create descriptor set layout!\" << std::endl;\n        exit(-1);\n    }\n}\n\nvoid StorageBuffer::createDescriptorSet(VkDeviceSize size) {\n    \/\/ Allocate descriptor set.\n    VkDescriptorSetAllocateInfo allocateInfo = {};\n    allocateInfo.sType = VK_STRUCTURE_TYPE_DESCRIPTOR_SET_ALLOCATE_INFO;\n    allocateInfo.descriptorPool = descriptorPool;\n    allocateInfo.descriptorSetCount = 1;\n    allocateInfo.pSetLayouts = &descriptorSetLayout;\n    \n    if (vkAllocateDescriptorSets(device, &allocateInfo, &descriptorSet) != VK_SUCCESS) {\n        std::cerr << \"Failed to allocate descriptor set\" << std::endl;\n        exit(-1);\n    }\n    \n    \/\/ Update descriptor set.\n    VkDescriptorBufferInfo bufferInfo = {};\n    bufferInfo.buffer = buffer;\n    bufferInfo.offset = 0;\n    bufferInfo.range = size;\n    \n    VkWriteDescriptorSet descriptorWrite = {};\n    descriptorWrite.sType = VK_STRUCTURE_TYPE_WRITE_DESCRIPTOR_SET;\n    descriptorWrite.dstSet = descriptorSet;\n    descriptorWrite.dstBinding = 0;\n    descriptorWrite.dstArrayElement = 0;\n    descriptorWrite.descriptorType = VK_DESCRIPTOR_TYPE_STORAGE_BUFFER;\n    descriptorWrite.descriptorCount = 1;\n    descriptorWrite.pBufferInfo = &bufferInfo;\n    descriptorWrite.pImageInfo = nullptr;\n    descriptorWrite.pTexelBufferView = nullptr;\n    \n    vkUpdateDescriptorSets(device, 1, &descriptorWrite, 0, nullptr);\n}\n<commit_msg>Destroy staging buffer<commit_after>#include \"StorageBuffer.hpp\"\n\n#include <iostream>\n#include <cstring>\n\nStorageBuffer::StorageBuffer(const void* data, unsigned int size, VkDevice device, VkPhysicalDevice physicalDevice, VkDescriptorPool descriptorPool, VkQueue graphicsQueue, VkCommandPool commandPool) {\n    this->device = device;\n    this->physicalDevice = physicalDevice;\n    this->descriptorPool = descriptorPool;\n    this->graphicsQueue = graphicsQueue;\n    this->commandPool = commandPool;\n\n    VkBuffer stagingBuffer;\n    VkDeviceMemory stagingBufferMemory;\n\n    \/\/ Staging buffer.\n    createBuffer(size, VK_BUFFER_USAGE_STORAGE_BUFFER_BIT | VK_BUFFER_USAGE_TRANSFER_SRC_BIT, VK_MEMORY_PROPERTY_HOST_VISIBLE_BIT | VK_MEMORY_PROPERTY_HOST_COHERENT_BIT, &stagingBuffer, &stagingBufferMemory);\n\n    \/\/ Copy data to mapped memory.\n    void* mappedMemory;\n    vkMapMemory(device, stagingBufferMemory, 0, size, 0, &mappedMemory);\n    memcpy(mappedMemory, data, size);\n    vkUnmapMemory(device, stagingBufferMemory);\n\n    \/\/ Actual buffer.\n    createBuffer(size, VK_BUFFER_USAGE_STORAGE_BUFFER_BIT | VK_BUFFER_USAGE_TRANSFER_DST_BIT, VK_MEMORY_PROPERTY_HOST_COHERENT_BIT, &buffer, &bufferMemory);\n    \n    \/\/ Copy from staging buffer to actual buffer.\n    copyBuffer(stagingBuffer, buffer, size);\n\n    \/\/ Create descriptor set.\n    createDescriptorSetLayout();\n    createDescriptorSet(size);\n    \n    \/\/ Destroy staging buffer.\n    vkDestroyBuffer(device, stagingBuffer, nullptr);\n    vkFreeMemory(device, stagingBufferMemory, nullptr);\n}\n\nStorageBuffer::~StorageBuffer() {\n    vkDestroyDescriptorSetLayout(device, descriptorSetLayout, nullptr);\n    vkDestroyBuffer(device, buffer, nullptr);\n    vkFreeMemory(device, bufferMemory, nullptr);\n}\n\nVkDescriptorSet StorageBuffer::getDescriptorSet() const {\n    return descriptorSet;\n}\n\nvoid StorageBuffer::createBuffer(VkDeviceSize size, VkBufferUsageFlags usage, VkMemoryPropertyFlags properties, VkBuffer* buffer, VkDeviceMemory* bufferMemory) {\n    \/\/ Create buffer.\n    VkBufferCreateInfo bufferInfo = {};\n    bufferInfo.sType = VK_STRUCTURE_TYPE_BUFFER_CREATE_INFO;\n    bufferInfo.size = size;\n    bufferInfo.usage = usage;\n    bufferInfo.sharingMode = VK_SHARING_MODE_EXCLUSIVE;\n\n    if (vkCreateBuffer(device, &bufferInfo, nullptr, buffer) != VK_SUCCESS) {\n        std::cerr << \"Failed to create buffer.\" << std::endl;\n        exit(-1);\n    }\n    \n    \/\/ Get information about device memory.\n    VkMemoryRequirements memoryRequirements;\n    vkGetBufferMemoryRequirements(device, *buffer, &memoryRequirements);\n    \n    VkPhysicalDeviceMemoryProperties memoryProperties;\n    vkGetPhysicalDeviceMemoryProperties(physicalDevice, &memoryProperties);\n    \n    \/\/ Find suitable memory type.\n    uint32_t memoryType;\n    for (uint32_t i = 0; i < memoryProperties.memoryTypeCount; i++) {\n        if (memoryRequirements.memoryTypeBits & (1 << i) && (memoryProperties.memoryTypes[i].propertyFlags & properties) == properties )\n            memoryType = i;\n    }\n    \n    \/\/ Allocate buffer memory.\n    VkMemoryAllocateInfo allocateInfo = {};\n    allocateInfo.sType = VK_STRUCTURE_TYPE_MEMORY_ALLOCATE_INFO;\n    allocateInfo.allocationSize = memoryRequirements.size;\n    allocateInfo.memoryTypeIndex = memoryType;\n    \n    if (vkAllocateMemory(device, &allocateInfo, nullptr, bufferMemory) != VK_SUCCESS) {\n        std::cerr << \"Failed to allocate buffer memory.\" << std::endl;\n        exit(-1);\n    }\n    \n    vkBindBufferMemory(device, *buffer, *bufferMemory, 0);\n}\n\nvoid StorageBuffer::copyBuffer(VkBuffer source, VkBuffer destination, VkDeviceSize size){\n    \/\/ Create command buffer allocation info.\n    VkCommandBufferAllocateInfo allocationInfo = {};\n    allocationInfo.sType = VK_STRUCTURE_TYPE_COMMAND_BUFFER_ALLOCATE_INFO;\n    allocationInfo.level = VK_COMMAND_BUFFER_LEVEL_PRIMARY;\n    allocationInfo.commandPool = commandPool;\n    allocationInfo.commandBufferCount = 1;\n\n    \/\/ Create command buffer.\n    VkCommandBuffer commandBuffer;\n    vkAllocateCommandBuffers(device, &allocationInfo, &commandBuffer);\n\n    \/\/ Command buffer begin info.\n    VkCommandBufferBeginInfo beginInfo = {};\n    beginInfo.sType = VK_STRUCTURE_TYPE_COMMAND_BUFFER_BEGIN_INFO;\n    beginInfo.flags = VK_COMMAND_BUFFER_USAGE_ONE_TIME_SUBMIT_BIT;\n\n    \/\/ Start recording commands.\n    vkBeginCommandBuffer(commandBuffer, &beginInfo);\n\n    VkBufferCopy copyRegion = {};\n    copyRegion.size = size;\n    vkCmdCopyBuffer(commandBuffer, source, destination, 1, &copyRegion);\n\n    vkEndCommandBuffer(commandBuffer);\n\n    VkSubmitInfo submitInfo = {};\n    submitInfo.sType = VK_STRUCTURE_TYPE_SUBMIT_INFO;\n    submitInfo.commandBufferCount = 1;\n    submitInfo.pCommandBuffers = &commandBuffer;\n\n    vkQueueSubmit(graphicsQueue, 1, &submitInfo, VK_NULL_HANDLE);\n    vkQueueWaitIdle(graphicsQueue);\n\n    vkFreeCommandBuffers(device, commandPool, 1, &commandBuffer);\n}\n\nvoid StorageBuffer::createDescriptorSetLayout() {\n    VkDescriptorSetLayoutBinding vertexLayoutBinding = {};\n    vertexLayoutBinding.binding = 0;\n    vertexLayoutBinding.descriptorType = VK_DESCRIPTOR_TYPE_STORAGE_BUFFER;\n    vertexLayoutBinding.descriptorCount = 1;\n    vertexLayoutBinding.stageFlags = VK_SHADER_STAGE_VERTEX_BIT;\n    vertexLayoutBinding.pImmutableSamplers = nullptr;\n    \n    VkDescriptorSetLayoutCreateInfo layoutInfo = {};\n    layoutInfo.sType = VK_STRUCTURE_TYPE_DESCRIPTOR_SET_LAYOUT_CREATE_INFO;\n    layoutInfo.bindingCount = 1;\n    layoutInfo.pBindings = &vertexLayoutBinding;\n    \n    if (vkCreateDescriptorSetLayout(device, &layoutInfo, nullptr, &descriptorSetLayout)) {\n        std::cerr << \"Could not create descriptor set layout!\" << std::endl;\n        exit(-1);\n    }\n}\n\nvoid StorageBuffer::createDescriptorSet(VkDeviceSize size) {\n    \/\/ Allocate descriptor set.\n    VkDescriptorSetAllocateInfo allocateInfo = {};\n    allocateInfo.sType = VK_STRUCTURE_TYPE_DESCRIPTOR_SET_ALLOCATE_INFO;\n    allocateInfo.descriptorPool = descriptorPool;\n    allocateInfo.descriptorSetCount = 1;\n    allocateInfo.pSetLayouts = &descriptorSetLayout;\n    \n    if (vkAllocateDescriptorSets(device, &allocateInfo, &descriptorSet) != VK_SUCCESS) {\n        std::cerr << \"Failed to allocate descriptor set\" << std::endl;\n        exit(-1);\n    }\n    \n    \/\/ Update descriptor set.\n    VkDescriptorBufferInfo bufferInfo = {};\n    bufferInfo.buffer = buffer;\n    bufferInfo.offset = 0;\n    bufferInfo.range = size;\n    \n    VkWriteDescriptorSet descriptorWrite = {};\n    descriptorWrite.sType = VK_STRUCTURE_TYPE_WRITE_DESCRIPTOR_SET;\n    descriptorWrite.dstSet = descriptorSet;\n    descriptorWrite.dstBinding = 0;\n    descriptorWrite.dstArrayElement = 0;\n    descriptorWrite.descriptorType = VK_DESCRIPTOR_TYPE_STORAGE_BUFFER;\n    descriptorWrite.descriptorCount = 1;\n    descriptorWrite.pBufferInfo = &bufferInfo;\n    descriptorWrite.pImageInfo = nullptr;\n    descriptorWrite.pTexelBufferView = nullptr;\n    \n    vkUpdateDescriptorSets(device, 1, &descriptorWrite, 0, nullptr);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * ThreadManager.cpp\n *\n *  Created on: Nov 19, 2014\n *      Author: matheus\n *\/\n\n#include \"ThreadManager.hpp\"\n\n#include <queue>\n#include <semaphore.h>\n#include <pthread.h>\n#include <signal.h>\n\nusing namespace std;\n\n\/\/ =============================================================================\n\/\/ Private classes\n\/\/ =============================================================================\n\nclass JobHandle {\n  private:\n    bool done;\n    function<void()> job;\n    pthread_cond_t cond;\n    pthread_mutex_t cond_mutex;\n  public:\n    JobHandle(function<void()> job);\n    ~JobHandle();\n    void run();\n    void wait();\n};\n\nclass Thread {\n  private:\n    pthread_t p_thread;\n  public:\n    Thread();\n    ~Thread();\n  private:\n    static void* func(void*);\n};\n\n\/\/ =============================================================================\n\/\/ Private globals\n\/\/ =============================================================================\n\nstatic int n_threads;\nstatic Thread* threads;\nstatic queue<shared_ptr<JobHandle>> jobs;\nstatic pthread_mutex_t jobs_mutex;\nstatic sem_t jobs_sem;\n\n\/\/ =============================================================================\n\/\/ ThreadManager\n\/\/ =============================================================================\n\nvoid ThreadManager::init(int n_th) {\n  pthread_mutex_init(&jobs_mutex, nullptr);\n  sem_init(&jobs_sem, 0, 0);\n  n_threads = n_th;\n  threads = new Thread[n_threads];\n}\n\nvoid ThreadManager::close() {\n  int n_th = n_threads;\n  n_threads = 0;\n  for (int i = 0; i < n_th; i++) {\n    sem_post(&jobs_sem);\n  }\n  delete[] threads;\n  pthread_mutex_destroy(&jobs_mutex);\n  sem_destroy(&jobs_sem);\n}\n\nint ThreadManager::nthreads() {\n  return n_threads;\n}\n\n\/\/ =============================================================================\n\/\/ JobHandle\n\/\/ =============================================================================\n\nJobHandle::JobHandle(function<void()> job) : done(false), job(job) {\n  pthread_cond_init(&cond, nullptr);\n  pthread_mutex_init(&cond_mutex, nullptr);\n}\n\nJobHandle::~JobHandle() {\n  pthread_cond_destroy(&cond);\n  pthread_mutex_destroy(&cond_mutex);\n}\n\nvoid JobHandle::run() {\n  job();\n  pthread_mutex_lock(&cond_mutex);\n  done = true;\n  pthread_cond_broadcast(&cond);\n  pthread_mutex_unlock(&cond_mutex);\n}\n\nvoid JobHandle::wait() {\n  pthread_mutex_lock(&cond_mutex);\n  if (!done) {\n    pthread_cond_wait(&cond, &cond_mutex);\n  }\n  pthread_mutex_unlock(&cond_mutex);\n}\n\n\/\/ =============================================================================\n\/\/ Job\n\/\/ =============================================================================\n\nJob::Job(function<void()> job) : handle(new JobHandle(job)) {\n  pthread_mutex_lock(&jobs_mutex);\n  jobs.push(handle);\n  pthread_mutex_unlock(&jobs_mutex);\n  sem_post(&jobs_sem);\n}\n\nJob::~Job() {\n  handle->wait();\n}\n\nvoid Job::dispatch(function<void()> job) {\n  pthread_mutex_lock(&jobs_mutex);\n  jobs.emplace(new JobHandle(job));\n  pthread_mutex_unlock(&jobs_mutex);\n  sem_post(&jobs_sem);\n}\n\n\/\/ =============================================================================\n\/\/ JobPool\n\/\/ =============================================================================\n\nJobPool::~JobPool() {\n  for (auto& handle : handles) {\n    handle->wait();\n  }\n}\n\nvoid JobPool::dispatch(function<void()> job) {\n  handles.emplace_back(new JobHandle(job));\n  pthread_mutex_lock(&jobs_mutex);\n  jobs.push(handles.back());\n  pthread_mutex_unlock(&jobs_mutex);\n  sem_post(&jobs_sem);\n}\n\n\/\/ =============================================================================\n\/\/ Thread functions\n\/\/ =============================================================================\n\nThread::Thread() {\n  pthread_create(&p_thread, nullptr, &func, nullptr);\n}\n\nThread::~Thread() {\n  pthread_join(p_thread, nullptr);\n}\n\nvoid* Thread::func(void*) {\n  while (n_threads > 0) {\n    sem_wait(&jobs_sem);\n    if (n_threads > 0) {\n      pthread_mutex_lock(&jobs_mutex);\n      shared_ptr<JobHandle> handle(jobs.front()); jobs.pop();\n      pthread_mutex_unlock(&jobs_mutex);\n      handle->run();\n    }\n  }\n  return nullptr;\n}\n<commit_msg>Improving thread management<commit_after>\/*\n * ThreadManager.cpp\n *\n *  Created on: Nov 19, 2014\n *      Author: matheus\n *\/\n\n#include \"ThreadManager.hpp\"\n\n#include <queue>\n#include <semaphore.h>\n#include <pthread.h>\n#include <signal.h>\n\nusing namespace std;\n\n\/\/ =============================================================================\n\/\/ Private classes\n\/\/ =============================================================================\n\nclass JobHandle {\n  private:\n    bool done;\n    function<void()> job;\n    pthread_cond_t cond;\n    pthread_mutex_t cond_mutex;\n  public:\n    JobHandle(function<void()> job);\n    ~JobHandle();\n    void run();\n    void wait();\n};\n\nclass Thread {\n  private:\n    pthread_t p_thread;\n  public:\n    Thread();\n    ~Thread();\n  private:\n    static void* func(void*);\n};\n\n\/\/ =============================================================================\n\/\/ Private globals\n\/\/ =============================================================================\n\nstatic int n_threads;\nstatic Thread* threads;\nstatic queue<shared_ptr<JobHandle>> jobs;\nstatic pthread_mutex_t jobs_mutex;\nstatic sem_t jobs_sem;\n\n\/\/ =============================================================================\n\/\/ ThreadManager\n\/\/ =============================================================================\n\nvoid ThreadManager::init(int n_th) {\n  pthread_mutex_init(&jobs_mutex, nullptr);\n  sem_init(&jobs_sem, 0, 0);\n  n_threads = n_th;\n  threads = new Thread[n_threads];\n}\n\nvoid ThreadManager::close() {\n  int n_th = n_threads;\n  n_threads = 0;\n  for (int i = 0; i < n_th; i++) {\n    sem_post(&jobs_sem);\n  }\n  delete[] threads;\n  pthread_mutex_destroy(&jobs_mutex);\n  sem_destroy(&jobs_sem);\n}\n\nint ThreadManager::nthreads() {\n  return n_threads;\n}\n\n\/\/ =============================================================================\n\/\/ JobHandle\n\/\/ =============================================================================\n\nJobHandle::JobHandle(function<void()> job) : done(false), job(job) {\n  pthread_cond_init(&cond, nullptr);\n  pthread_mutex_init(&cond_mutex, nullptr);\n}\n\nJobHandle::~JobHandle() {\n  pthread_cond_destroy(&cond);\n  pthread_mutex_destroy(&cond_mutex);\n}\n\nvoid JobHandle::run() {\n  job();\n  pthread_mutex_lock(&cond_mutex);\n  done = true;\n  pthread_cond_broadcast(&cond);\n  pthread_mutex_unlock(&cond_mutex);\n}\n\nvoid JobHandle::wait() {\n  pthread_mutex_lock(&cond_mutex);\n  if (!done) {\n    pthread_cond_wait(&cond, &cond_mutex);\n  }\n  pthread_mutex_unlock(&cond_mutex);\n}\n\n\/\/ =============================================================================\n\/\/ Job\n\/\/ =============================================================================\n\nJob::Job(function<void()> job) : handle(new JobHandle(job)) {\n  pthread_mutex_lock(&jobs_mutex);\n  jobs.push(handle);\n  pthread_mutex_unlock(&jobs_mutex);\n  sem_post(&jobs_sem);\n}\n\nJob::~Job() {\n  handle->wait();\n}\n\nvoid Job::dispatch(function<void()> job) {\n  pthread_mutex_lock(&jobs_mutex);\n  jobs.emplace(new JobHandle(job));\n  pthread_mutex_unlock(&jobs_mutex);\n  sem_post(&jobs_sem);\n}\n\n\/\/ =============================================================================\n\/\/ JobPool\n\/\/ =============================================================================\n\nJobPool::~JobPool() {\n  for (auto& handle : handles) {\n    handle->wait();\n  }\n}\n\nvoid JobPool::dispatch(function<void()> job) {\n  handles.emplace_back(new JobHandle(job));\n  pthread_mutex_lock(&jobs_mutex);\n  jobs.push(handles.back());\n  pthread_mutex_unlock(&jobs_mutex);\n  sem_post(&jobs_sem);\n}\n\n\/\/ =============================================================================\n\/\/ Thread functions\n\/\/ =============================================================================\n\nThread::Thread() {\n  pthread_create(&p_thread, nullptr, &func, nullptr);\n}\n\nThread::~Thread() {\n  pthread_join(p_thread, nullptr);\n}\n\nvoid* Thread::func(void*) {\n  sem_wait(&jobs_sem);\n  while (n_threads > 0) {\n    pthread_mutex_lock(&jobs_mutex);\n    shared_ptr<JobHandle> handle(jobs.front()); jobs.pop();\n    pthread_mutex_unlock(&jobs_mutex);\n    handle->run();\n    sem_wait(&jobs_sem);\n  }\n  return nullptr;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/*\n *  Routines to write data in Nrrd format\n *  Currently handles: raw, gzip and ascii encodings\n *\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#include <hxNrrdIO\/hxNrrdIOAPI.h>\n\n#include <hxcore\/HxData.h>\n#include <hxcore\/HxMessage.h>\n#include <hxfield\/HxUniformScalarField3.h>\n#include <teem\/nrrd.h>\n\nint NrrdWriter(HxUniformScalarField3* field, const char* filename, int encoding)\n{\n\t\/\/ Identify data type\n\tint nrrdType = nrrdTypeUnknown;\n\tswitch ( field->primType() )\n    {\n\t\tcase McPrimType::mc_uint8:  nrrdType = nrrdTypeUChar; break;\n\t\tcase McPrimType::mc_int8:   nrrdType = nrrdTypeChar; break;\n\t\tcase McPrimType::mc_uint16: nrrdType = nrrdTypeUShort; break;\n\t\tcase McPrimType::mc_int16:  nrrdType = nrrdTypeShort; break;\n\t\tcase McPrimType::mc_int32:  nrrdType = nrrdTypeInt; break;\n\t\tcase McPrimType::mc_float:  nrrdType = nrrdTypeFloat; break;\n\t\tcase McPrimType::mc_double: nrrdType = nrrdTypeDouble; break;\n\t\tdefault: break;\n    }\n\n\tif(nrrdType == nrrdTypeUnknown)\n\t{\n\t\ttheMsg->printf(\"ERROR: unsupported output type: %s for nrrd\",field->primType().getName());\n\t\treturn 0;\n\t}\n\n\tvoid* data = field->lattice.dataPtr();\n\n\tNrrd *nrrd = nrrdNew();\n\tNrrdIoState *nios = nrrdIoStateNew();\n\n\tif ( encoding == nrrdEncodingTypeGzip) {\n\t\tif (nrrdEncodingGzip->available() )\n\t\t{\n\t\t\tnrrdIoStateEncodingSet( nios, nrrdEncodingGzip );\n\t\t\tnrrdIoStateSet( nios, nrrdIoStateZlibLevel, 9 );\n\t\t}\n\t\telse theMsg->printf(\"WARNING: Nrrd library does not support Gzip compression encoding.\\n Make sure Teem_ZLIB is on in CMAKE when building Nrrd library.\\n\");\n\t} else if ( encoding == nrrdEncodingTypeBzip2) {\n\t\tif (nrrdEncodingBzip2->available() )\n\t\t{\n\t\t\tnrrdIoStateEncodingSet( nios, nrrdEncodingBzip2 );\n\t\t\t\/\/ nrrdIoStateSet( nios, nrrdIoStateBzip2BlockSize, 9 );\n\t\t}\n\t\telse theMsg->printf(\"WARNING: Nrrd library does not support Bzip2 compression encoding.\\n Make sure Teem_BZIP2 is on in CMAKE when building Nrrd library.\\n\");\n\t} else if ( encoding == nrrdEncodingTypeAscii) {\n\t\tnrrdIoStateEncodingSet( nios, nrrdEncodingAscii );\n\t} else {\n\t\ttheMsg->printf(\"ERROR: Unimplemented nrrd encoding type: %d\\n\",encoding);\n\t\treturn 0;\n\t}\n\n\ttry\n\t{\n\t\tif ( nrrdWrap_va( nrrd, data, nrrdType, (size_t)3,\n\t\t    (size_t)field->lattice.dimsInt()[0],\n\t\t    (size_t)field->lattice.dimsInt()[1],\n\t\t    (size_t)field->lattice.dimsInt()[2] ) )\n\t\t{\n\t\t\tthrow( biffGetDone(NRRD) );\n\t\t}\n\n\t\tnrrdSpaceDimensionSet( nrrd, 3 );\n\n\t\t\/\/ TODO: Would be nice to set space units.  How does Amira store this?\n\/\/\t\tif ( writeVolume->MetaKeyExists(CMTK_META_SPACE_UNITS_STRING) )\n\/\/\t\t{\n\/\/\t\t\tnrrd->spaceUnits[0] = strdup( writeVolume->m_MetaInformation[CMTK_META_SPACE_UNITS_STRING].c_str() );\n\/\/\t\t\tnrrd->spaceUnits[1] = strdup( writeVolume->m_MetaInformation[CMTK_META_SPACE_UNITS_STRING].c_str() );\n\/\/\t\t\tnrrd->spaceUnits[2] = strdup( writeVolume->m_MetaInformation[CMTK_META_SPACE_UNITS_STRING].c_str() );\n\/\/\t\t}\n\n\t\tint kind[NRRD_DIM_MAX] = { nrrdKindDomain, nrrdKindDomain, nrrdKindDomain };\n\t\tnrrdAxisInfoSet_nva( nrrd, nrrdAxisInfoKind, kind );\n\n\t\t\/\/ TODO: Would be nice to write some kind of space if this exists\n\n\t\t\/\/ Fetch bounding box information and voxel size\n\t\tfloat* bbox = field->bbox();\n\t\tMcVec3f voxelSize = field->getVoxelSize();\n\n\t\t\/\/ Just deal with space directions orthogonal to data axes\n\t\t\/\/ TODO: Fetch transformation and use that\n\t\tdouble spaceDir[NRRD_DIM_MAX][NRRD_SPACE_DIM_MAX];\n\t\tfor ( int i = 0; i < 3; ++i )\n\t\t{\n\t\t\tfor ( int j = 0; j < 3; ++j )\n\t\t\t{\n\t\t\t\tif (i == j) spaceDir[i][j] = (double) voxelSize[i];\n\t\t\t\telse spaceDir[i][j] = 0.0; \/\/ Can't assume that memory is zeroed\n\t\t\t}\n\t\t}\n\t\tnrrdAxisInfoSet_nva( nrrd, nrrdAxisInfoSpaceDirection, spaceDir );\n\n\t\tdouble origin[NRRD_DIM_MAX] = { bbox[0], bbox[2], bbox[4] };\n\t\tif ( nrrdSpaceOriginSet( nrrd, origin ) )\n\t\t{\n\t\t\tthrow( biffGetDone(NRRD) );\n\t\t}\n\n\t\tnrrdAxisInfoSet_va( nrrd, nrrdAxisInfoLabel, \"x\", \"y\", \"z\" );\n\n\t\tif ( nrrdSave( filename, nrrd, nios ) )\n\t\t{\n\t\t\tthrow( biffGetDone(NRRD) );\n\t\t}\n    }\n\tcatch ( char* err )\n    {\n\t\ttheMsg->printf(\"ERROR: hxNrrdIO library returned error '%s'\\n\", err);\n\t\tfree( err );\n\t\treturn 0;\n    }\n\n\tnrrdIoStateNix( nios );\n\tnrrdNix(nrrd);\n\n    return 1; \n}\n\nHXNRRDIO_API\nint NrrdWriterRaw(HxUniformScalarField3* field, const char* filename)\n{\n\treturn NrrdWriter(field, filename, nrrdEncodingTypeRaw);\n}\n\nHXNRRDIO_API\nint NrrdWriterGzip(HxUniformScalarField3* field, const char* filename)\n{\n\treturn NrrdWriter(field, filename, nrrdEncodingTypeGzip);\n}\n\nHXNRRDIO_API\nint NrrdWriterAscii(HxUniformScalarField3* field, const char* filename)\n{\n\treturn NrrdWriter(field, filename, nrrdEncodingTypeAscii);\n}\n<commit_msg>Fix bug in writing plain nrrd<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/*\n *  Routines to write data in Nrrd format\n *  Currently handles: raw, gzip and ascii encodings\n *\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#include <hxNrrdIO\/hxNrrdIOAPI.h>\n\n#include <hxcore\/HxData.h>\n#include <hxcore\/HxMessage.h>\n#include <hxfield\/HxUniformScalarField3.h>\n#include <teem\/nrrd.h>\n\nint NrrdWriter(HxUniformScalarField3* field, const char* filename, int encoding)\n{\n\t\/\/ Identify data type\n\tint nrrdType = nrrdTypeUnknown;\n\tswitch ( field->primType() )\n    {\n\t\tcase McPrimType::mc_uint8:  nrrdType = nrrdTypeUChar; break;\n\t\tcase McPrimType::mc_int8:   nrrdType = nrrdTypeChar; break;\n\t\tcase McPrimType::mc_uint16: nrrdType = nrrdTypeUShort; break;\n\t\tcase McPrimType::mc_int16:  nrrdType = nrrdTypeShort; break;\n\t\tcase McPrimType::mc_int32:  nrrdType = nrrdTypeInt; break;\n\t\tcase McPrimType::mc_float:  nrrdType = nrrdTypeFloat; break;\n\t\tcase McPrimType::mc_double: nrrdType = nrrdTypeDouble; break;\n\t\tdefault: break;\n    }\n\n\tif(nrrdType == nrrdTypeUnknown)\n\t{\n\t\ttheMsg->printf(\"ERROR: unsupported output type: %s for nrrd\",field->primType().getName());\n\t\treturn 0;\n\t}\n\n\tvoid* data = field->lattice.dataPtr();\n\n\tNrrd *nrrd = nrrdNew();\n\tNrrdIoState *nios = nrrdIoStateNew();\n\n\tif ( encoding == nrrdEncodingTypeGzip) {\n\t\tif (nrrdEncodingGzip->available() )\n\t\t{\n\t\t\tnrrdIoStateEncodingSet( nios, nrrdEncodingGzip );\n\t\t\tnrrdIoStateSet( nios, nrrdIoStateZlibLevel, 9 );\n\t\t}\n\t\telse theMsg->printf(\"WARNING: Nrrd library does not support Gzip compression encoding.\\n Make sure Teem_ZLIB is on in CMAKE when building Nrrd library.\\n\");\n\t} else if ( encoding == nrrdEncodingTypeBzip2) {\n\t\tif (nrrdEncodingBzip2->available() )\n\t\t{\n\t\t\tnrrdIoStateEncodingSet( nios, nrrdEncodingBzip2 );\n\t\t\t\/\/ nrrdIoStateSet( nios, nrrdIoStateBzip2BlockSize, 9 );\n\t\t}\n\t\telse theMsg->printf(\"WARNING: Nrrd library does not support Bzip2 compression encoding.\\n Make sure Teem_BZIP2 is on in CMAKE when building Nrrd library.\\n\");\n\t} else if ( encoding == nrrdEncodingTypeRaw) {\n\t\t\/\/ Do nothing (the default)\n\t} else if ( encoding == nrrdEncodingTypeAscii) {\n\t\tnrrdIoStateEncodingSet( nios, nrrdEncodingAscii );\n\t} else {\n\t\ttheMsg->printf(\"ERROR: Unimplemented nrrd encoding type: %d\\n\",encoding);\n\t\treturn 0;\n\t}\n\n\ttry\n\t{\n\t\tif ( nrrdWrap_va( nrrd, data, nrrdType, (size_t)3,\n\t\t    (size_t)field->lattice.dimsInt()[0],\n\t\t    (size_t)field->lattice.dimsInt()[1],\n\t\t    (size_t)field->lattice.dimsInt()[2] ) )\n\t\t{\n\t\t\tthrow( biffGetDone(NRRD) );\n\t\t}\n\n\t\tnrrdSpaceDimensionSet( nrrd, 3 );\n\n\t\t\/\/ TODO: Would be nice to set space units.  How does Amira store this?\n\/\/\t\tif ( writeVolume->MetaKeyExists(CMTK_META_SPACE_UNITS_STRING) )\n\/\/\t\t{\n\/\/\t\t\tnrrd->spaceUnits[0] = strdup( writeVolume->m_MetaInformation[CMTK_META_SPACE_UNITS_STRING].c_str() );\n\/\/\t\t\tnrrd->spaceUnits[1] = strdup( writeVolume->m_MetaInformation[CMTK_META_SPACE_UNITS_STRING].c_str() );\n\/\/\t\t\tnrrd->spaceUnits[2] = strdup( writeVolume->m_MetaInformation[CMTK_META_SPACE_UNITS_STRING].c_str() );\n\/\/\t\t}\n\n\t\tint kind[NRRD_DIM_MAX] = { nrrdKindDomain, nrrdKindDomain, nrrdKindDomain };\n\t\tnrrdAxisInfoSet_nva( nrrd, nrrdAxisInfoKind, kind );\n\n\t\t\/\/ TODO: Would be nice to write some kind of space if this exists\n\n\t\t\/\/ Fetch bounding box information and voxel size\n\t\tfloat* bbox = field->bbox();\n\t\tMcVec3f voxelSize = field->getVoxelSize();\n\n\t\t\/\/ Just deal with space directions orthogonal to data axes\n\t\t\/\/ TODO: Fetch transformation and use that\n\t\tdouble spaceDir[NRRD_DIM_MAX][NRRD_SPACE_DIM_MAX];\n\t\tfor ( int i = 0; i < 3; ++i )\n\t\t{\n\t\t\tfor ( int j = 0; j < 3; ++j )\n\t\t\t{\n\t\t\t\tif (i == j) spaceDir[i][j] = (double) voxelSize[i];\n\t\t\t\telse spaceDir[i][j] = 0.0; \/\/ Can't assume that memory is zeroed\n\t\t\t}\n\t\t}\n\t\tnrrdAxisInfoSet_nva( nrrd, nrrdAxisInfoSpaceDirection, spaceDir );\n\n\t\tdouble origin[NRRD_DIM_MAX] = { bbox[0], bbox[2], bbox[4] };\n\t\tif ( nrrdSpaceOriginSet( nrrd, origin ) )\n\t\t{\n\t\t\tthrow( biffGetDone(NRRD) );\n\t\t}\n\n\t\tnrrdAxisInfoSet_va( nrrd, nrrdAxisInfoLabel, \"x\", \"y\", \"z\" );\n\n\t\tif ( nrrdSave( filename, nrrd, nios ) )\n\t\t{\n\t\t\tthrow( biffGetDone(NRRD) );\n\t\t}\n    }\n\tcatch ( char* err )\n    {\n\t\ttheMsg->printf(\"ERROR: hxNrrdIO library returned error '%s'\\n\", err);\n\t\tfree( err );\n\t\treturn 0;\n    }\n\n\tnrrdIoStateNix( nios );\n\tnrrdNix(nrrd);\n\n    return 1; \n}\n\nHXNRRDIO_API\nint NrrdWriterRaw(HxUniformScalarField3* field, const char* filename)\n{\n\treturn NrrdWriter(field, filename, nrrdEncodingTypeRaw);\n}\n\nHXNRRDIO_API\nint NrrdWriterGzip(HxUniformScalarField3* field, const char* filename)\n{\n\treturn NrrdWriter(field, filename, nrrdEncodingTypeGzip);\n}\n\nHXNRRDIO_API\nint NrrdWriterAscii(HxUniformScalarField3* field, const char* filename)\n{\n\treturn NrrdWriter(field, filename, nrrdEncodingTypeAscii);\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 \"KeyTable.hpp\"\n\n\n\n#include <memory>\n\n\n\n#include <dom\/DOM_NamedNodeMap.hpp>\n#include <dom\/DOM_NodeList.hpp>\n\n\n\n#include <Include\/DOMHelper.hpp>\n#include <XPath\/XPath.hpp>\n#include <XPath\/XPathExecutionContext.hpp>\n\n\n\n#include \"KeyDeclaration.hpp\"\n\n\n\nKeyTable::KeyTable(\n\t\t\tconst DOM_Node&\t\t\t\t\t\tdoc,\n\t\t\tconst DOM_Node&\t\t\t\t\t\tstartNode,\n\t\t\tconst PrefixResolver&\t\t\t\tresolver,\n\t\t\tconst std::vector<KeyDeclaration>&\tkeyDeclarations,\n\t\t\tXPathExecutionContext&\t\t\t\texecutionContext) :\n\tm_docKey(doc),\n\tm_keys()\n{\n    DOM_Node\tpos = startNode;\n\n    \/\/ Do a non-recursive pre-walk over the tree.\n    while(0 != pos)\n    {     \n\t\tconst int\tnDeclarations = keyDeclarations.size();\n\n\t\t\/\/ We're going to have to walk the attribute list \n\t\t\/\/ if it's an element, so get the attributes.\n\t\tDOM_NamedNodeMap\tattrs;\n\n\t\tint\t\t\t\t\tnNodes = 0;\n\n\t\tif(DOM_Node::ELEMENT_NODE == pos.getNodeType())\n\t\t{\n\t\t\tattrs = static_cast<const DOM_Element&>(pos).getAttributes();\n\n\t\t\tnNodes = attrs.getLength();\n        \n\t\t\tif(0 == nNodes)\n\t\t\t{\n\t\t\t\tattrs = 0;\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Walk the primary node, and each of the attributes.\n\t\t\/\/ This loop is a little strange... it is meant to always \n\t\t\/\/ execute once, then execute for each of the attributes.\n\t\tDOM_Node\ttestNode = pos;\n\n\t\tfor(int nodeIndex = -1; nodeIndex < nNodes;)\n\t\t{\n\t\t\t\/\/ Walk through each of the declarations made with xsl:key\n\t\t\tfor(int i = 0; i < nDeclarations; i++)\n\t\t\t{\n\t\t\t\tconst KeyDeclaration&\tkd = keyDeclarations[i];\n\n\t\t\t\t\/\/ See if our node matches the given key declaration according to \n\t\t\t\t\/\/ the match attribute on xsl:key.\n\t\t\t\tconst double\tscore = kd.getMatchPattern().getMatchScore(testNode, executionContext);\n\n\t\t\t\tif(score != kd.getMatchPattern().s_MatchScoreNone)\n\t\t\t\t{\n\t\t\t\t\t\/\/ Query from the node, according the the select pattern in the\n\t\t\t\t\t\/\/ use attribute in xsl:key.\n\t\t\t\t\tconst XObject* const\txuse =\n\t\t\t\t\t\/\/ @@ JMD: is this kosher\t\n\t\t\t\t\t\tkd.getUse().execute(testNode, resolver, NodeRefList(), executionContext);\n\n\t\t\t\t\tconst NodeRefListBase&\tnl = xuse->nodeset(); \n\n\t\t\t\t\tconst int\t\t\t\tnUseValues = nl.getLength();\n\n\t\t\t\t\tif(0 != nUseValues)\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ Use each node in the node list as a key value that we'll be \n\t\t\t\t\t\t\/\/ able to use to look up the given node.\n\t\t\t\t\t\tfor(int k = 0; k < nUseValues; k++)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tDOM_Node\tuseNode = nl.item(k);\n\n\t\t\t\t\t\t\t\/\/ Use getExpr to get the string value of the given node. I hope \n\t\t\t\t\t\t\t\/\/ the string assumption is the right thing... I can't see how \n\t\t\t\t\t\t\t\/\/ it could work any other way.\n\t\t\t\t\t\t\tconst DOMString\t\texprResult =\n\t\t\t\t\t\t\t\texecutionContext.getNodeData(useNode);\n\n\t\t\t\t\t\t\tif(length(exprResult) != 0)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tMutableNodeRefList&\t\tkeyNodes =\n\t\t\t\t\t\t\t\t\t\t\tm_keys[kd.getName()][exprResult];\n\n\t\t\t\t\t\t\t\t\/\/ See if the matched node is already in the \n\t\t\t\t\t\t\t\t\/\/ table set.  If it is there, we're done, otherwise \n\t\t\t\t\t\t\t\t\/\/ add it.\n\t\t\t\t\t\t\t\tbool foundit = false;\n\n\t\t\t\t\t\t\t\tconst int\tnKeyNodes = keyNodes.getLength(); \/\/size();\n\n\t\t\t\t\t\t\t\tfor(int j = 0; j < nKeyNodes; j++)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tif(testNode == keyNodes.item(j))\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tfoundit = true;\n\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t} \/\/ end for j\n\n\t\t\t\t\t\t\t\tif(foundit == false)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tkeyNodes.addNode(testNode);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} \/\/ end for(int k = 0; k < nUseValues; k++)\n\t\t\t\t\t} \/\/ if(0 != nUseValues)\n\t\t\t\t} \/\/ if(score != kd.getMatchPattern().s_MatchScoreNone)\n\t\t\t} \/\/ end for(int i = 0; i < nDeclarations; i++)\n\n\t\t\tnodeIndex++;\n\n\t\t\tif(0 != attrs)\n\t\t\t{\n\t\t\t\ttestNode = attrs.item(nodeIndex);\n\t\t\t}\n\t\t} \/\/ for(int nodeIndex = -1; nodeIndex < nNodes;)\n      \n\t\t\/\/ The rest of this is getting the next prewalk position in \n\t\t\/\/ the tree.\n\n\t\tDOM_Node\tnextNode = pos.getFirstChild();\n\n\t\twhile(0 == nextNode)\n\t\t{\n\t\t\tif(startNode == pos)\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tnextNode = pos.getNextSibling();\n\n\t\t\t\tif(0 == nextNode)\n\t\t\t\t{\n\t\t\t\t\tpos = pos.getParentNode();\n\n\t\t\t\t\tif((startNode == pos) || (0 == pos))\n\t\t\t\t\t{\n\t\t\t\t\t\tnextNode = 0;\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\tpos = nextNode;\n    } \/\/ while(0 != pos)\n} \/\/ end buildKeysTable method\n\n\n\nKeyTable::~KeyTable()\n{\n}\n\n\n\nconst NodeRefListBase*\nKeyTable::getNodeSetByKey(\n\t\t\t\t\t  const DOMString&\tname, \n\t\t\t\t\t  const DOMString&\tref) const\n{\n    const MutableNodeRefList*\tnl =0;\n\n\tKeysMapType::const_iterator\t\ti = m_keys.find(name);\n\n\tif (i != m_keys.end())\n\t{\n\t\tconst NodeListMapType&\t\t\t\ttheMap = (*i).second;\n\n\t\tNodeListMapType::const_iterator\t\tj = theMap.find(ref);\n\n\t\tif (j != theMap.end())\n\t\t{\n\t\t\tnl = &(*j).second;\n\t\t}\n\t}\n\n    return nl;\n}\n\n<commit_msg>Sync up with java code<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 \"KeyTable.hpp\"\n\n\n\n#include <memory>\n\n\n\n#include <dom\/DOM_NamedNodeMap.hpp>\n#include <dom\/DOM_NodeList.hpp>\n\n\n\n#include <Include\/DOMHelper.hpp>\n#include <XPath\/XPath.hpp>\n#include <XPath\/XPathExecutionContext.hpp>\n\n\n\n#include \"KeyDeclaration.hpp\"\n\n\n\nKeyTable::KeyTable(\n\t\t\tconst DOM_Node&\t\t\t\t\t\tdoc,\n\t\t\tconst DOM_Node&\t\t\t\t\t\tstartNode,\n\t\t\tconst PrefixResolver&\t\t\t\tresolver,\n\t\t\tconst std::vector<KeyDeclaration>&\tkeyDeclarations,\n\t\t\tXPathExecutionContext&\t\t\t\texecutionContext) :\n\tm_docKey(doc),\n\tm_keys()\n{\n    DOM_Node\tpos = startNode;\n\n    \/\/ Do a non-recursive pre-walk over the tree.\n    while(0 != pos)\n    {     \n\t\tconst int\tnDeclarations = keyDeclarations.size();\n\n\t\t\/\/ We're going to have to walk the attribute list \n\t\t\/\/ if it's an element, so get the attributes.\n\t\tDOM_NamedNodeMap\tattrs;\n\n\t\tint\t\t\t\t\tnNodes = 0;\n\n\t\tif(DOM_Node::ELEMENT_NODE == pos.getNodeType())\n\t\t{\n\t\t\tattrs = static_cast<const DOM_Element&>(pos).getAttributes();\n\n\t\t\tnNodes = attrs.getLength();\n        \n\t\t\tif(0 == nNodes)\n\t\t\t{\n\t\t\t\tattrs = 0;\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Walk the primary node, and each of the attributes.\n\t\t\/\/ This loop is a little strange... it is meant to always \n\t\t\/\/ execute once, then execute for each of the attributes.\n\t\tDOM_Node\ttestNode = pos;\n\n\t\tfor(int nodeIndex = -1; nodeIndex < nNodes;)\n\t\t{\n\t\t\t\/\/ Walk through each of the declarations made with xsl:key\n\t\t\tfor(int i = 0; i < nDeclarations; i++)\n\t\t\t{\n\t\t\t\tconst KeyDeclaration&\tkd = keyDeclarations[i];\n\n\t\t\t\t\/\/ See if our node matches the given key declaration according to \n\t\t\t\t\/\/ the match attribute on xsl:key.\n\t\t\t\tconst double\tscore = kd.getMatchPattern().getMatchScore(testNode, executionContext);\n\n\t\t\t\tif(score != kd.getMatchPattern().s_MatchScoreNone)\n\t\t\t\t{\n\t\t\t\t\t\/\/ Query from the node, according the the select pattern in the\n\t\t\t\t\t\/\/ use attribute in xsl:key.\n\t\t\t\t\tconst XObject* const\txuse =\n\t\t\t\t\t\tkd.getUse().execute(testNode, resolver, NodeRefList(), executionContext);\n\n\t\t\t\tconst NodeRefListBase*\tnl = 0;\n\t\t\t\tint nUseValues;\n\t\t\t\tDOMString\t\texprResult;\n\t\t\t\tif(xuse->getType() != xuse->eTypeNodeSet)\n\t\t\t\t{\n\t\t\t\t\tnUseValues = 1;\n\t\t\t\t\texprResult = xuse->str();\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tnl = &xuse->nodeset();\n\t\t\t\t\t\/\/ Use each node in the node list as a key value that we'll be \n\t\t\t\t\t\/\/ able to use to look up the given node.\n\t\t\t\t\tnUseValues = nl->getLength();\n\t\t\t\t}  \n\t\t\t\t\/\/ Use each node in the node list as a key value that we'll be \n\t\t\t\t\/\/ able to use to look up the given node.\n\t\t\t\tfor(int k = 0; k < nUseValues; k++)\n\t\t\t\t{\n\n\t\t\t\t\t\/\/ Use getExpr to get the string value of the given node. I hope \n\t\t\t\t\t\/\/ the string assumption is the right thing... I can't see how \n\t\t\t\t\t\/\/ it could work any other way.\n\t\t\t\t\tif(0 != nl)\n\t\t\t\t\t{\n\t\t\t\t\t\tDOM_Node\tuseNode = nl->item(k);\n\t\t\t\t\t\texprResult = executionContext.getNodeData(useNode);\n\t\t\t\t\t}\n\n\t\t\t\t\tif(length(exprResult) != 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tMutableNodeRefList&\t\tkeyNodes =\n\t\t\t\t\t\t\tm_keys[kd.getName()][exprResult];\n\n\t\t\t\t\t\t\/\/ See if the matched node is already in the \n\t\t\t\t\t\t\/\/ table set.  If it is there, we're done, otherwise \n\t\t\t\t\t\t\/\/ add it.\n\t\t\t\t\t\tbool foundit = false;\n\n\t\t\t\t\t\tconst int\tnKeyNodes = keyNodes.getLength(); \/\/size();\n\n\t\t\t\t\t\tfor(int j = 0; j < nKeyNodes; j++)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif(testNode == keyNodes.item(j))\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tfoundit = true;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} \/\/ end for j\n\n\t\t\t\t\t\tif(foundit == false)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tkeyNodes.addNode(testNode);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} \/\/ end for(int k = 0; k < nUseValues; k++)\n\t\t\t\t} \/\/ if(score != kd.getMatchPattern().s_MatchScoreNone)\n\t\t\t} \/\/ end for(int i = 0; i < nDeclarations; i++)\n\n\t\t\tnodeIndex++;\n\n\t\t\tif(0 != attrs)\n\t\t\t{\n\t\t\t\ttestNode = attrs.item(nodeIndex);\n\t\t\t}\n\t\t} \/\/ for(int nodeIndex = -1; nodeIndex < nNodes;)\n      \n\t\t\/\/ The rest of this is getting the next prewalk position in \n\t\t\/\/ the tree.\n\n\t\tDOM_Node\tnextNode = pos.getFirstChild();\n\n\t\twhile(0 == nextNode)\n\t\t{\n\t\t\tif(startNode == pos)\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tnextNode = pos.getNextSibling();\n\n\t\t\t\tif(0 == nextNode)\n\t\t\t\t{\n\t\t\t\t\tpos = pos.getParentNode();\n\n\t\t\t\t\tif((startNode == pos) || (0 == pos))\n\t\t\t\t\t{\n\t\t\t\t\t\tnextNode = 0;\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\tpos = nextNode;\n    } \/\/ while(0 != pos)\n} \/\/ end buildKeysTable method\n\n\n\nKeyTable::~KeyTable()\n{\n}\n\n\n\nconst NodeRefListBase*\nKeyTable::getNodeSetByKey(\n\t\t\t\t\t  const DOMString&\tname, \n\t\t\t\t\t  const DOMString&\tref) const\n{\n\tconst MutableNodeRefList*\tnl =0;\n\n\tKeysMapType::const_iterator\t\ti = m_keys.find(name);\n\tif (i != m_keys.end())\n\t{\n\t\tconst NodeListMapType&\t\t\t\ttheMap = (*i).second;\n\t\tNodeListMapType::const_iterator\t\tj = theMap.find(ref);\n\t\tif (j != theMap.end())\n\t\t{\n\t\t\tnl = &(*j).second;\n\t\t\treturn nl;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tstd::auto_ptr<MutableNodeRefList> newnl(new MutableNodeRefList());\n\t\t\treturn newnl.release();\n\t\t}\n\t}\n\treturn nl;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"qhexbuffer.h\"\n#include <QBuffer>\n\nQHexBuffer::QHexBuffer(QObject *parent) : QObject(parent) { }\n\nuchar QHexBuffer::at(int idx) { return this->read(idx, 1).front(); }\nbool QHexBuffer::isEmpty() const { return this->length() <= 0; }\n\nvoid QHexBuffer::replace(int offset, const QByteArray &data)\n{\n    this->remove(offset, data.length());\n    this->insert(offset, data);\n}\n\nvoid QHexBuffer::read(char *data, int size)\n{\n    QBuffer* buffer = new QBuffer(this);\n    buffer->setData(data, size);\n    this->read(buffer);\n}\n\nvoid QHexBuffer::read(const QByteArray &ba)\n{\n    QBuffer* buffer = new QBuffer(this);\n    buffer->open(QBuffer::ReadWrite);\n    buffer->setData(ba);\n    this->read(buffer);\n}\n\n<commit_msg>QHexBuffer: QIODevice checks<commit_after>#include \"qhexbuffer.h\"\n#include <QBuffer>\n\nQHexBuffer::QHexBuffer(QObject *parent) : QObject(parent) { }\n\nuchar QHexBuffer::at(int idx) { return this->read(idx, 1).front(); }\nbool QHexBuffer::isEmpty() const { return this->length() <= 0; }\n\nvoid QHexBuffer::replace(int offset, const QByteArray &data)\n{\n    this->remove(offset, data.length());\n    this->insert(offset, data);\n}\n\nvoid QHexBuffer::read(char *data, int size)\n{\n    QBuffer* buffer = new QBuffer(this);\n    buffer->setData(data, size);\n\n    if(!buffer->isOpen())\n        buffer->open(QBuffer::ReadWrite);\n\n    this->read(buffer);\n}\n\nvoid QHexBuffer::read(const QByteArray &ba)\n{\n    QBuffer* buffer = new QBuffer(this);\n\n    if(!buffer->isOpen())\n        buffer->open(QBuffer::ReadWrite);\n\n    buffer->setData(ba);\n    this->read(buffer);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Module:    itkGaborImageSourceTest.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#include \"itkGaborImageSource.h\"\n#include \"itkImageFileWriter.h\"\n\nint itkGaborImageSourceTest0( int argc, char *argv[] )\n{\n  typedef float PixelType;\n  const unsigned int ImageDimension = 2;\n  typedef itk::Image<PixelType, ImageDimension> ImageType;   \n\n  \/\/ Instantiate the filter\n  typedef itk::GaborImageSource<ImageType> GaborSourceType;\n  GaborSourceType::Pointer gaborImage = GaborSourceType::New();\n  gaborImage->Print(std::cout);\n\n  GaborSourceType::ArrayType sigma;\n  sigma[0] = 2.0;\n  sigma[1] = 5.0;\n\n  ImageType::SizeType size;  \n  size.Fill( 64*4 );\n  \n  gaborImage->SetSize( size );\n\n  gaborImage->SetSigma( sigma );\n  gaborImage->SetFrequency( 0.1 );\n  gaborImage->SetCalculateImaginaryPart( false );\n  \n  try\n    {\n    gaborImage->Update();\n    gaborImage->Print(std::cout);\n    }\n  catch (itk::ExceptionObject & err)\n    { \n    std::cout << \"ExceptionObject caught !\" << std::endl; \n    std::cout << err << std::endl; \n    return EXIT_FAILURE;\n    }\n\n  typedef itk::ImageFileWriter<ImageType> WriterType;\n  WriterType::Pointer writer = WriterType::New();\n  writer->SetFileName( argv[1] );\n  writer->SetInput( gaborImage->GetOutput() );\n  writer->Update();\n\n  return EXIT_SUCCESS;\n}\n\nint itkGaborImageSourceTest1( int argc, char *argv[] )\n{\n  typedef float PixelType;\n  const unsigned int ImageDimension = 3;\n  typedef itk::Image<PixelType, ImageDimension> ImageType;   \n\n  \/\/ Instantiate the filter\n  typedef itk::GaborImageSource<ImageType> GaborSourceType;\n  GaborSourceType::Pointer gaborImage = GaborSourceType::New();\n\n  GaborSourceType::ArrayType sigma;\n  sigma[0] = 2.0;\n  sigma[1] = 10.0;\n  sigma[2] = 10.0;\n\n  gaborImage->Print(std::cout);\n\n  gaborImage->SetSigma( sigma );\n  gaborImage->SetFrequency( 0.1 );\n  gaborImage->SetCalculateImaginaryPart( true );\n  \n  try\n    {\n    gaborImage->Update();\n    }\n  catch (itk::ExceptionObject & err)\n    { \n    std::cout << \"ExceptionObject caught !\" << std::endl; \n    std::cout << err << std::endl; \n    return EXIT_FAILURE;\n    }\n\n  typedef itk::ImageFileWriter<ImageType> WriterType;\n  WriterType::Pointer writer = WriterType::New();\n  writer->SetFileName( argv[1] );\n  writer->SetInput( gaborImage->GetOutput() );\n  writer->Update();\n\n  gaborImage->Print(std::cout);\n\n  return EXIT_SUCCESS;\n}\n\n\nint itkGaborImageSourceTest( int argc, char *argv[] )\n{\n  if ( argc < 3 )\n    {\n    std::cout << \"Usage: \" << argv[0] << \" outputImage whichTest\" << std::endl;\n    return EXIT_FAILURE;\n    }\n    \n  int test = EXIT_FAILURE;  \n  if ( atoi( argv[2] ) == 0 )\n    {\n    test = itkGaborImageSourceTest0( argc, argv );\n    }\n  else\n    {\n    test = itkGaborImageSourceTest1( argc, argv );\n    }\n\n  return test;  \n}\n<commit_msg>COMP: unused variable warnings.<commit_after>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Module:    itkGaborImageSourceTest.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#include \"itkGaborImageSource.h\"\n#include \"itkImageFileWriter.h\"\n\nint itkGaborImageSourceTest0( int, char *argv[] )\n{\n  typedef float PixelType;\n  const unsigned int ImageDimension = 2;\n  typedef itk::Image<PixelType, ImageDimension> ImageType;   \n\n  \/\/ Instantiate the filter\n  typedef itk::GaborImageSource<ImageType> GaborSourceType;\n  GaborSourceType::Pointer gaborImage = GaborSourceType::New();\n  gaborImage->Print(std::cout);\n\n  GaborSourceType::ArrayType sigma;\n  sigma[0] = 2.0;\n  sigma[1] = 5.0;\n\n  ImageType::SizeType size;  \n  size.Fill( 64*4 );\n  \n  gaborImage->SetSize( size );\n\n  gaborImage->SetSigma( sigma );\n  gaborImage->SetFrequency( 0.1 );\n  gaborImage->SetCalculateImaginaryPart( false );\n  \n  try\n    {\n    gaborImage->Update();\n    gaborImage->Print(std::cout);\n    }\n  catch (itk::ExceptionObject & err)\n    { \n    std::cout << \"ExceptionObject caught !\" << std::endl; \n    std::cout << err << std::endl; \n    return EXIT_FAILURE;\n    }\n\n  typedef itk::ImageFileWriter<ImageType> WriterType;\n  WriterType::Pointer writer = WriterType::New();\n  writer->SetFileName( argv[1] );\n  writer->SetInput( gaborImage->GetOutput() );\n  writer->Update();\n\n  return EXIT_SUCCESS;\n}\n\nint itkGaborImageSourceTest1( int, char *argv[] )\n{\n  typedef float PixelType;\n  const unsigned int ImageDimension = 3;\n  typedef itk::Image<PixelType, ImageDimension> ImageType;   \n\n  \/\/ Instantiate the filter\n  typedef itk::GaborImageSource<ImageType> GaborSourceType;\n  GaborSourceType::Pointer gaborImage = GaborSourceType::New();\n\n  GaborSourceType::ArrayType sigma;\n  sigma[0] = 2.0;\n  sigma[1] = 10.0;\n  sigma[2] = 10.0;\n\n  gaborImage->Print(std::cout);\n\n  gaborImage->SetSigma( sigma );\n  gaborImage->SetFrequency( 0.1 );\n  gaborImage->SetCalculateImaginaryPart( true );\n  \n  try\n    {\n    gaborImage->Update();\n    }\n  catch (itk::ExceptionObject & err)\n    { \n    std::cout << \"ExceptionObject caught !\" << std::endl; \n    std::cout << err << std::endl; \n    return EXIT_FAILURE;\n    }\n\n  typedef itk::ImageFileWriter<ImageType> WriterType;\n  WriterType::Pointer writer = WriterType::New();\n  writer->SetFileName( argv[1] );\n  writer->SetInput( gaborImage->GetOutput() );\n  writer->Update();\n\n  gaborImage->Print(std::cout);\n\n  return EXIT_SUCCESS;\n}\n\n\nint itkGaborImageSourceTest( int argc, char *argv[] )\n{\n  if ( argc < 3 )\n    {\n    std::cout << \"Usage: \" << argv[0] << \" outputImage whichTest\" << std::endl;\n    return EXIT_FAILURE;\n    }\n    \n  int test;\n  if ( atoi( argv[2] ) == 0 )\n    {\n    test = itkGaborImageSourceTest0( argc, argv );\n    }\n  else\n    {\n    test = itkGaborImageSourceTest1( argc, argv );\n    }\n\n  return test;  \n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    This file is part of Magnum.\n\n    Copyright © 2010, 2011, 2012, 2013, 2014, 2015\n              Vladimír Vondruš <mosra@centrum.cz>\n\n    Permission is hereby granted, free of charge, to any person obtaining a\n    copy of this software and associated documentation files (the \"Software\"),\n    to deal in the Software without restriction, including without limitation\n    the rights to use, copy, modify, merge, publish, distribute, sublicense,\n    and\/or sell copies of the Software, and to permit persons to whom the\n    Software is furnished to do so, subject to the following conditions:\n\n    The above copyright notice and this permission notice shall be included\n    in all copies or substantial portions of the Software.\n\n    THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n    IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n    FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n    THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n    LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n    FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n    DEALINGS IN THE SOFTWARE.\n*\/\n\n#include \"Magnum\/Context.h\"\n#include \"Magnum\/Extensions.h\"\n#include \"Magnum\/Math\/Range.h\"\n\nnamespace Magnum {\n\nnamespace Implementation {\n\n\/* Used in Shader.cpp (duh) *\/\nbool isShaderCompilationLogEmpty(const std::string&);\nbool isShaderCompilationLogEmpty(const std::string& result) {\n    #ifdef CORRADE_TARGET_WINDOWS\n    \/* Intel Windows drivers are too chatty *\/\n    if((Context::current()->detectedDriver() & Context::DetectedDriver::IntelWindows) && result == \"No errors.\\n\")\n        return true;\n    #else\n    static_cast<void>(result);\n    #endif\n\n    return false;\n}\n\n\/* Used in AbstractShaderProgram.cpp (duh) *\/\nbool isProgramLinkLogEmpty(const std::string&);\nbool isProgramLinkLogEmpty(const std::string& result) {\n    #ifdef CORRADE_TARGET_WINDOWS\n    \/* Intel Windows drivers are too chatty *\/\n    if((Context::current()->detectedDriver() & Context::DetectedDriver::IntelWindows) && result == \"No errors.\\n\")\n        return true;\n    #else\n    static_cast<void>(result);\n    #endif\n\n    return false;\n}\n\n}\n\nauto Context::detectedDriver() -> DetectedDrivers {\n    if(_detectedDrivers) return *_detectedDrivers;\n\n    _detectedDrivers = DetectedDrivers{};\n\n    const std::string vendor = vendorString();\n\n    #ifndef MAGNUM_TARGET_GLES\n    \/* AMD binary desktop drivers *\/\n    if(vendor.find(\"ATI Technologies Inc.\") != std::string::npos)\n        return *_detectedDrivers |= DetectedDriver::AMD;\n\n    #ifdef CORRADE_TARGET_WINDOWS\n    \/* Intel Windows drivers *\/\n    if(vendor.find(\"Intel\") != std::string::npos)\n        return *_detectedDrivers |= DetectedDriver::IntelWindows;\n    #endif\n    #endif\n\n    \/** @todo there is also D3D9\/D3D11 distinction on webglreport.com, is it useful? *\/\n    #ifdef MAGNUM_TARGET_GLES\n    \/* OpenGL ES implementation using ANGLE. Taken from these sources:\n       http:\/\/stackoverflow.com\/a\/20149090\n       http:\/\/webglreport.com\n    *\/\n    {\n        Range1Di range;\n        glGetIntegerv(GL_ALIASED_LINE_WIDTH_RANGE, range.data());\n        if(range.min() == 1 && range.max() == 1 && vendor != \"Internet Explorer\")\n            return *_detectedDrivers |= DetectedDriver::ProbablyAngle;\n    }\n    #endif\n\n    return *_detectedDrivers;\n}\n\nvoid Context::setupDriverWorkarounds() {\n    #define _setRequiredVersion(extension, version)                           \\\n        if(_extensionRequiredVersion[Extensions::extension::Index] < Version::version) \\\n            _extensionRequiredVersion[Extensions::extension::Index] = Version::version\n\n    #ifndef MAGNUM_TARGET_GLES\n    \/* This extension causes crash in GLSL compiler on AMD linux drivers 13.251 *\/\n    if(detectedDriver() & DetectedDriver::AMD)\n        _setRequiredVersion(GL::ARB::explicit_uniform_location, None);\n\n    #ifdef CORRADE_TARGET_WINDOWS\n    \/* On Windows Intel drivers ARB_shading_language_420pack is exposed in GLSL\n       even that the extension (e.g. binding keyword) is not supported *\/\n    if((detectedDriver() & DetectedDriver::IntelWindows) && !isExtensionSupported<Extensions::GL::ARB::shading_language_420pack>())\n        _setRequiredVersion(GL::ARB::shading_language_420pack, None);\n    #endif\n\n    \/* Layout qualifier causes compiler error with GLSL 1.20 on Mesa, GLSL 1.30\n       on NVidia and 1.40 on Mac OS X *\/\n    \/** @todo Different version on different vendors? *\/\n    _setRequiredVersion(GL::ARB::explicit_attrib_location, GL320);\n    _setRequiredVersion(GL::ARB::explicit_uniform_location, GL320);\n    _setRequiredVersion(GL::ARB::shading_language_420pack, GL320);\n    #endif\n\n    \/* Disable extensions not available on NaCl *\/\n    #ifdef CORRADE_TARGET_NACL\n    _setRequiredVersion(GL::EXT::multi_draw_arrays, None);\n    _setRequiredVersion(GL::EXT::debug_label, None);\n    _setRequiredVersion(GL::EXT::debug_marker, None);\n    _setRequiredVersion(GL::EXT::disjoint_timer_query, None);\n    _setRequiredVersion(GL::EXT::separate_shader_objects, None);\n    _setRequiredVersion(GL::EXT::multisampled_render_to_texture, None);\n    _setRequiredVersion(GL::EXT::robustness, None);\n    _setRequiredVersion(GL::KHR::debug, None);\n    _setRequiredVersion(GL::NV::read_buffer_front, None);\n    _setRequiredVersion(GL::OES::mapbuffer, None);\n    _setRequiredVersion(GL::ANGLE::framebuffer_blit, None);\n    _setRequiredVersion(GL::ANGLE::framebuffer_multisample, None);\n    _setRequiredVersion(GL::ANGLE::instanced_arrays, None);\n    _setRequiredVersion(GL::APPLE::framebuffer_multisample, None);\n    _setRequiredVersion(GL::EXT::discard_framebuffer, None);\n    _setRequiredVersion(GL::EXT::blend_minmax, None);\n    _setRequiredVersion(GL::EXT::texture_storage, None);\n    _setRequiredVersion(GL::EXT::map_buffer_range, None);\n    _setRequiredVersion(GL::EXT::instanced_arrays, None);\n    _setRequiredVersion(GL::EXT::draw_instanced, None);\n    _setRequiredVersion(GL::NV::draw_buffers, None);\n    _setRequiredVersion(GL::NV::fbo_color_attachments, None); \/\/ ??\n    _setRequiredVersion(GL::NV::read_buffer, None);\n    _setRequiredVersion(GL::NV::draw_instanced, None);\n    _setRequiredVersion(GL::NV::framebuffer_blit, None);\n    _setRequiredVersion(GL::NV::framebuffer_multisample, None);\n    _setRequiredVersion(GL::NV::instanced_arrays, None);\n    _setRequiredVersion(GL::OES::texture_3D, None);\n    _setRequiredVersion(GL::OES::vertex_array_object, None);\n    #endif\n\n    #undef _setRequiredVersion\n}\n\n}\n<commit_msg>Don't compile desktop-only stuff on ES.<commit_after>\/*\n    This file is part of Magnum.\n\n    Copyright © 2010, 2011, 2012, 2013, 2014, 2015\n              Vladimír Vondruš <mosra@centrum.cz>\n\n    Permission is hereby granted, free of charge, to any person obtaining a\n    copy of this software and associated documentation files (the \"Software\"),\n    to deal in the Software without restriction, including without limitation\n    the rights to use, copy, modify, merge, publish, distribute, sublicense,\n    and\/or sell copies of the Software, and to permit persons to whom the\n    Software is furnished to do so, subject to the following conditions:\n\n    The above copyright notice and this permission notice shall be included\n    in all copies or substantial portions of the Software.\n\n    THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n    IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n    FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n    THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n    LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n    FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n    DEALINGS IN THE SOFTWARE.\n*\/\n\n#include \"Magnum\/Context.h\"\n#include \"Magnum\/Extensions.h\"\n#include \"Magnum\/Math\/Range.h\"\n\nnamespace Magnum {\n\nnamespace Implementation {\n\n\/* Used in Shader.cpp (duh) *\/\nbool isShaderCompilationLogEmpty(const std::string&);\nbool isShaderCompilationLogEmpty(const std::string& result) {\n    #if defined(CORRADE_TARGET_WINDOWS) && !defined(MAGNUM_TARGET_GLES)\n    \/* Intel Windows drivers are too chatty *\/\n    if((Context::current()->detectedDriver() & Context::DetectedDriver::IntelWindows) && result == \"No errors.\\n\")\n        return true;\n    #else\n    static_cast<void>(result);\n    #endif\n\n    return false;\n}\n\n\/* Used in AbstractShaderProgram.cpp (duh) *\/\nbool isProgramLinkLogEmpty(const std::string&);\nbool isProgramLinkLogEmpty(const std::string& result) {\n    #if defined(CORRADE_TARGET_WINDOWS) && !defined(MAGNUM_TARGET_GLES)\n    \/* Intel Windows drivers are too chatty *\/\n    if((Context::current()->detectedDriver() & Context::DetectedDriver::IntelWindows) && result == \"No errors.\\n\")\n        return true;\n    #else\n    static_cast<void>(result);\n    #endif\n\n    return false;\n}\n\n}\n\nauto Context::detectedDriver() -> DetectedDrivers {\n    if(_detectedDrivers) return *_detectedDrivers;\n\n    _detectedDrivers = DetectedDrivers{};\n\n    const std::string vendor = vendorString();\n\n    #ifndef MAGNUM_TARGET_GLES\n    \/* AMD binary desktop drivers *\/\n    if(vendor.find(\"ATI Technologies Inc.\") != std::string::npos)\n        return *_detectedDrivers |= DetectedDriver::AMD;\n\n    #ifdef CORRADE_TARGET_WINDOWS\n    \/* Intel Windows drivers *\/\n    if(vendor.find(\"Intel\") != std::string::npos)\n        return *_detectedDrivers |= DetectedDriver::IntelWindows;\n    #endif\n    #endif\n\n    \/** @todo there is also D3D9\/D3D11 distinction on webglreport.com, is it useful? *\/\n    #ifdef MAGNUM_TARGET_GLES\n    \/* OpenGL ES implementation using ANGLE. Taken from these sources:\n       http:\/\/stackoverflow.com\/a\/20149090\n       http:\/\/webglreport.com\n    *\/\n    {\n        Range1Di range;\n        glGetIntegerv(GL_ALIASED_LINE_WIDTH_RANGE, range.data());\n        if(range.min() == 1 && range.max() == 1 && vendor != \"Internet Explorer\")\n            return *_detectedDrivers |= DetectedDriver::ProbablyAngle;\n    }\n    #endif\n\n    return *_detectedDrivers;\n}\n\nvoid Context::setupDriverWorkarounds() {\n    #define _setRequiredVersion(extension, version)                           \\\n        if(_extensionRequiredVersion[Extensions::extension::Index] < Version::version) \\\n            _extensionRequiredVersion[Extensions::extension::Index] = Version::version\n\n    #ifndef MAGNUM_TARGET_GLES\n    \/* This extension causes crash in GLSL compiler on AMD linux drivers 13.251 *\/\n    if(detectedDriver() & DetectedDriver::AMD)\n        _setRequiredVersion(GL::ARB::explicit_uniform_location, None);\n\n    #ifdef CORRADE_TARGET_WINDOWS\n    \/* On Windows Intel drivers ARB_shading_language_420pack is exposed in GLSL\n       even that the extension (e.g. binding keyword) is not supported *\/\n    if((detectedDriver() & DetectedDriver::IntelWindows) && !isExtensionSupported<Extensions::GL::ARB::shading_language_420pack>())\n        _setRequiredVersion(GL::ARB::shading_language_420pack, None);\n    #endif\n\n    \/* Layout qualifier causes compiler error with GLSL 1.20 on Mesa, GLSL 1.30\n       on NVidia and 1.40 on Mac OS X *\/\n    \/** @todo Different version on different vendors? *\/\n    _setRequiredVersion(GL::ARB::explicit_attrib_location, GL320);\n    _setRequiredVersion(GL::ARB::explicit_uniform_location, GL320);\n    _setRequiredVersion(GL::ARB::shading_language_420pack, GL320);\n    #endif\n\n    \/* Disable extensions not available on NaCl *\/\n    #ifdef CORRADE_TARGET_NACL\n    _setRequiredVersion(GL::EXT::multi_draw_arrays, None);\n    _setRequiredVersion(GL::EXT::debug_label, None);\n    _setRequiredVersion(GL::EXT::debug_marker, None);\n    _setRequiredVersion(GL::EXT::disjoint_timer_query, None);\n    _setRequiredVersion(GL::EXT::separate_shader_objects, None);\n    _setRequiredVersion(GL::EXT::multisampled_render_to_texture, None);\n    _setRequiredVersion(GL::EXT::robustness, None);\n    _setRequiredVersion(GL::KHR::debug, None);\n    _setRequiredVersion(GL::NV::read_buffer_front, None);\n    _setRequiredVersion(GL::OES::mapbuffer, None);\n    _setRequiredVersion(GL::ANGLE::framebuffer_blit, None);\n    _setRequiredVersion(GL::ANGLE::framebuffer_multisample, None);\n    _setRequiredVersion(GL::ANGLE::instanced_arrays, None);\n    _setRequiredVersion(GL::APPLE::framebuffer_multisample, None);\n    _setRequiredVersion(GL::EXT::discard_framebuffer, None);\n    _setRequiredVersion(GL::EXT::blend_minmax, None);\n    _setRequiredVersion(GL::EXT::texture_storage, None);\n    _setRequiredVersion(GL::EXT::map_buffer_range, None);\n    _setRequiredVersion(GL::EXT::instanced_arrays, None);\n    _setRequiredVersion(GL::EXT::draw_instanced, None);\n    _setRequiredVersion(GL::NV::draw_buffers, None);\n    _setRequiredVersion(GL::NV::fbo_color_attachments, None); \/\/ ??\n    _setRequiredVersion(GL::NV::read_buffer, None);\n    _setRequiredVersion(GL::NV::draw_instanced, None);\n    _setRequiredVersion(GL::NV::framebuffer_blit, None);\n    _setRequiredVersion(GL::NV::framebuffer_multisample, None);\n    _setRequiredVersion(GL::NV::instanced_arrays, None);\n    _setRequiredVersion(GL::OES::texture_3D, None);\n    _setRequiredVersion(GL::OES::vertex_array_object, None);\n    #endif\n\n    #undef _setRequiredVersion\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\n * copyright: (c) RDO-Team, 2010\r\n * filename : rdo_memory.h\r\n * author   :  \r\n * date     : 02.12.2010\r\n * bref     : \r\n * indent   : 4T\r\n *\/\r\n\r\n\/\/ ====================================================================== PCH\r\n#include \"rdo_lib\/rdo_runtime\/pch.h\"\r\n\/\/ ====================================================================== INCLUDES\r\n\/\/ ====================================================================== SYNOPSIS\r\n#include \"rdo_lib\/rdo_runtime\/rdo_memory.h\"\r\n\/\/ ===============================================================================\r\n\r\nOPEN_RDO_RUNTIME_NAMESPACE\r\n\/\/ ----------------------------------------------------------------------------\r\n\/\/ ---------- RDOMemory\r\n\/\/ ----------------------------------------------------------------------------\r\nRDOMemory::RDOMemory()\r\n{}\r\n\r\nvoid RDOMemory::createVariable(CREF(tstring) name)\r\n{\r\n\tstd::pair<LocalMemory::iterator, rbool> result =\r\n\t\tm_localMemory.insert(LocalMemory::value_type(name, RDOValue()));\r\n\r\n\tASSERT(result.second);\r\n}\r\n\r\nRDOValue RDOMemory::getVariable(CREF(tstring) name) const\r\n{\r\n\tLocalMemory::const_iterator it = m_localMemory.find(name);\r\n\treturn it->second;\r\n}\r\n\r\nvoid RDOMemory::setVariable(CREF(tstring) name, CREF(RDOValue) varible)\r\n{\r\n\tLocalMemory::iterator it = m_localMemory.find(name);\r\n\tit->second = varible;\r\n}\r\n\r\nrbool RDOMemory::findVarible(CREF(tstring) name) const\r\n{\r\n\trbool result = (m_localMemory.find(name) == m_localMemory.end()) ? FALSE : TRUE;\r\n\treturn result;\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\n\/\/ ---------- RDOMemoryStack\r\n\/\/ ----------------------------------------------------------------------------\r\nRDOMemoryStack::RDOMemoryStack()\r\n{}\r\n\r\nvoid RDOMemoryStack::push(LPRDOMemory pMemory)\r\n{\r\n\tm_pMemoryStack.push_back(pMemory);\r\n}\r\n\r\nvoid RDOMemoryStack::pop()\r\n{\r\n\tASSERT(!m_pMemoryStack.empty());\r\n\r\n\tm_pMemoryStack.pop_back();\r\n}\r\n\r\nvoid RDOMemoryStack::create(CREF(tstring) name)\r\n{\r\n\tASSERT(!m_pMemoryStack.empty());\r\n\r\n\tm_pMemoryStack.back()->createVariable(name);\r\n}\r\n\r\nRDOValue RDOMemoryStack::get(CREF(tstring) name) const\r\n{\r\n\tASSERT(!m_pMemoryStack.empty());\r\n\r\n\tMemoryStack::const_iterator stack_it = m_pMemoryStack.begin();\r\n\twhile (stack_it != m_pMemoryStack.end())\r\n\t{\r\n\t\tif((*stack_it)->findVarible(name)) break;\r\n\t\telse ++stack_it;\r\n\t};\r\n\r\n\tASSERT(stack_it != m_pMemoryStack.end());\r\n\treturn (*stack_it)->getVariable(name);\r\n}\r\n\r\nvoid RDOMemoryStack::set(CREF(tstring) name, CREF(RDOValue) varible)\r\n{\r\n\tASSERT(!m_pMemoryStack.empty());\r\n\r\n\tMemoryStack::iterator stack_it = m_pMemoryStack.begin();\r\n\twhile (stack_it != m_pMemoryStack.end())\r\n\t{\r\n\t\tif((*stack_it)->findVarible(name)) break;\r\n\t\telse ++stack_it;\r\n\t};\r\n\r\n\tASSERT(stack_it != m_pMemoryStack.end());\r\n\t(*stack_it)->setVariable(name, varible);\r\n}\r\n\r\nCLOSE_RDO_RUNTIME_NAMESPACE\r\n<commit_msg> - форматирование<commit_after>\/*\r\n * copyright: (c) RDO-Team, 2010\r\n * filename : rdo_memory.h\r\n * author   :  \r\n * date     : 02.12.2010\r\n * bref     : \r\n * indent   : 4T\r\n *\/\r\n\r\n\/\/ ====================================================================== PCH\r\n#include \"rdo_lib\/rdo_runtime\/pch.h\"\r\n\/\/ ====================================================================== INCLUDES\r\n\/\/ ====================================================================== SYNOPSIS\r\n#include \"rdo_lib\/rdo_runtime\/rdo_memory.h\"\r\n\/\/ ===============================================================================\r\n\r\nOPEN_RDO_RUNTIME_NAMESPACE\r\n\/\/ ----------------------------------------------------------------------------\r\n\/\/ ---------- RDOMemory\r\n\/\/ ----------------------------------------------------------------------------\r\nRDOMemory::RDOMemory()\r\n{}\r\n\r\nvoid RDOMemory::createVariable(CREF(tstring) name)\r\n{\r\n\tstd::pair<LocalMemory::iterator, rbool> result =\r\n\t\tm_localMemory.insert(LocalMemory::value_type(name, RDOValue()));\r\n\r\n\tASSERT(result.second);\r\n}\r\n\r\nRDOValue RDOMemory::getVariable(CREF(tstring) name) const\r\n{\r\n\tLocalMemory::const_iterator it = m_localMemory.find(name);\r\n\tASSERT(it != m_localMemory.end());\r\n\treturn it->second;\r\n}\r\n\r\nvoid RDOMemory::setVariable(CREF(tstring) name, CREF(RDOValue) varible)\r\n{\r\n\tLocalMemory::iterator it = m_localMemory.find(name);\r\n\tASSERT(it != m_localMemory.end());\r\n\tit->second = varible;\r\n}\r\n\r\nrbool RDOMemory::findVarible(CREF(tstring) name) const\r\n{\r\n\treturn (m_localMemory.find(name) == m_localMemory.end()) ? FALSE : TRUE;\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\n\/\/ ---------- RDOMemoryStack\r\n\/\/ ----------------------------------------------------------------------------\r\nRDOMemoryStack::RDOMemoryStack()\r\n{}\r\n\r\nvoid RDOMemoryStack::push(LPRDOMemory pMemory)\r\n{\r\n\tm_pMemoryStack.push_back(pMemory);\r\n}\r\n\r\nvoid RDOMemoryStack::pop()\r\n{\r\n\tASSERT(!m_pMemoryStack.empty());\r\n\r\n\tm_pMemoryStack.pop_back();\r\n}\r\n\r\nvoid RDOMemoryStack::create(CREF(tstring) name)\r\n{\r\n\tASSERT(!m_pMemoryStack.empty());\r\n\r\n\tm_pMemoryStack.back()->createVariable(name);\r\n}\r\n\r\nRDOValue RDOMemoryStack::get(CREF(tstring) name) const\r\n{\r\n\tASSERT(!m_pMemoryStack.empty());\r\n\r\n\tMemoryStack::const_iterator stack_it = m_pMemoryStack.begin();\r\n\twhile (stack_it != m_pMemoryStack.end())\r\n\t{\r\n\t\tif((*stack_it)->findVarible(name)) break;\r\n\t\telse ++stack_it;\r\n\t};\r\n\r\n\tASSERT(stack_it != m_pMemoryStack.end());\r\n\treturn (*stack_it)->getVariable(name);\r\n}\r\n\r\nvoid RDOMemoryStack::set(CREF(tstring) name, CREF(RDOValue) varible)\r\n{\r\n\tASSERT(!m_pMemoryStack.empty());\r\n\r\n\tMemoryStack::iterator stack_it = m_pMemoryStack.begin();\r\n\twhile (stack_it != m_pMemoryStack.end())\r\n\t{\r\n\t\tif((*stack_it)->findVarible(name)) break;\r\n\t\telse ++stack_it;\r\n\t};\r\n\r\n\tASSERT(stack_it != m_pMemoryStack.end());\r\n\t(*stack_it)->setVariable(name, varible);\r\n}\r\n\r\nCLOSE_RDO_RUNTIME_NAMESPACE\r\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2010-2012 RethinkDB, all rights reserved.\n#include \"arch\/io\/disk\/conflict_resolving.hpp\"\n\n#include <deque>\n#include <map>\n\n#include \"containers\/printf_buffer.hpp\"\n#include \"perfmon\/perfmon.hpp\"\n\nvoid debug_print(printf_buffer_t *buf,\n                 const conflict_resolving_diskmgr_action_t &action) {\n    buf->appendf(\"cr_diskmgr_action{conflict_count=%d}<\", action.conflict_count);\n    const accounting_diskmgr_action_t &parent_action = action;\n    debug_print(buf, parent_action);\n}\n\n\nconflict_resolving_diskmgr_t::conflict_resolving_diskmgr_t(perfmon_collection_t *stats) :\n    conflict_sampler(secs_to_ticks(1), true),\n    conflict_sampler_membership(stats, &conflict_sampler, \"conflict\")\n{ }\n\nconflict_resolving_diskmgr_t::~conflict_resolving_diskmgr_t() {\n#ifndef NDEBUG\n    \/* Make sure there are no requests still out. *\/\n    for (std::map<fd_t, std::map<int64_t, std::deque<action_t *> > >::iterator\n             fd_t_chunk_queues = all_chunk_queues.begin();\n         fd_t_chunk_queues != all_chunk_queues.end();\n         ++fd_t_chunk_queues) {\n        rassert(fd_t_chunk_queues->second.empty());\n    }\n    for (auto it = resize_waiter_queues.begin();\n         it != resize_waiter_queues.end();\n         ++it) {\n        rassert(it->second.empty());\n    }\n    for (auto it = resize_active.begin(); it != resize_active.end(); ++it) {\n        rassert(it->second == 0);\n    }\n#endif\n}\n\n\/\/ Fills dest's bufs with data from source.  source's range is a superset of dest's.\nvoid copy_full_action_buf(pool_diskmgr_action_t *dest, pool_diskmgr_action_t *source,\n                          const size_t offset_into_source) {\n    guarantee(source->get_offset() <= dest->get_offset()\n              && source->get_offset() + source->get_count() >= dest->get_offset() + dest->get_count());\n\n    iovec *dest_vecs;\n    size_t dest_size;\n    dest->get_bufs(&dest_vecs, &dest_size);\n    iovec *source_vecs;\n    size_t source_size;\n    source->get_bufs(&source_vecs, &source_size);\n\n    fill_bufs_from_source(dest_vecs, dest_size, source_vecs, source_size, offset_into_source);\n};\n\nvoid conflict_resolving_diskmgr_t::submit(action_t *action) {\n    action->conflict_count = 0;\n\n    if (action->get_is_resize()) {\n        \/* Block out subsequent operations; reads, writes and resizes alike. *\/\n        ++resize_active[action->get_fd()];\n    } else {\n        std::map<int64_t, std::deque<action_t *> > *chunk_queues = &all_chunk_queues[action->get_fd()];\n        \/* Determine the range of file-blocks that this action spans *\/\n        int64_t start;\n        int64_t end;\n        get_range(action, &start, &end);\n\n        \/* If this is a read, we check whether there is a write from which we\n        can \"steal\" data to satisfy the read immediately. We currently only\n        do this if there is a single write operation that provides all the data\n        that we need, we don't combine multiple writes that affect different parts\n        of the read request. *\/\n        if (action->get_is_read()) {\n            \/* The logic here is a bit tricky. What we do is the following:\n            First we check the queue for the first chunk. If there is a write that\n            can satisfy us, it must span all chunks and therefore be on the first\n            chunk's queue. We pick the latest write that exists on that queue, so\n            we get the most recent version of the data. We then check the other\n            chunks and make sure that the same write is also the latest write on\n            these queues. If there is another more recent write, we cannot take\n            the data from our initial write, because a subrange of it will be\n            overwritten by that other write. As an optimization, we could\n            still use the data from the initial write and just replace that part of\n            it, using the data from the other write. We leave this extension as an\n            exercise to the reader. *\/\n\n            action_t *latest_write = NULL;\n\n            std::map<int64_t, std::deque<action_t*> >::iterator it;\n            it = chunk_queues->find(start);\n            if (it != chunk_queues->end()) {\n                std::deque<action_t *> &queue = it->second;\n\n                \/* Locate the latest write on the queue *\/\n                std::deque<action_t *>::reverse_iterator qrit;\n                for (qrit = queue.rbegin(); qrit != queue.rend(); ++qrit) {\n                    if ((*qrit)->get_is_write()) {\n                        \/* We found it! Check if it's of any use to us...\n                        If the range it was supposed to write is a superrange of\n                        our range, then it's a valid candidate. *\/\n                        if ((*qrit)->get_offset() <= action->get_offset() &&\n                                (*qrit)->get_offset() + (*qrit)->get_count() >= action->get_offset() + action->get_count() ) {\n\n                            latest_write = *qrit;\n                        }\n\n                        \/* No other write on the queue can be the latest one. Stop looking. *\/\n                        break;\n                    }\n                }\n            }\n\n            \/* Now check that latest_write is also latest for all other chunks.\n            Keep on validating as long as we have a latest_write candidate. *\/\n            for (int64_t block = start; latest_write && block < end; block++) {\n                it = chunk_queues->find(start);\n                rassert(it != chunk_queues->end()); \/\/ Note: At least latest_write should be there!\n                std::deque<action_t *> &queue = it->second;\n\n                \/* Locate the latest write on the queue *\/\n                std::deque<action_t *>::reverse_iterator qrit;\n                for (qrit = queue.rbegin(); qrit != queue.rend(); ++qrit) {\n                    if ((*qrit)->get_is_write()) {\n\n                        if (*qrit != latest_write) {\n                            \/* This write is more recent than latest_write, so latest_write\n                            isn't actually the latest one over the whole range,\n                            This renders it unusable for us. *\/\n                            latest_write = NULL;\n                        }\n\n                        \/* No other write on the queue can be the latest one. Stop looking. *\/\n                        break;\n                    }\n                }\n            }\n\n            if (latest_write) {\n                guarantee(action->conflict_count == 0,\n                          \"Short-circuited a read despite it already being on a \"\n                          \"waiter queue.\");\n\n                copy_full_action_buf(action, latest_write, action->get_offset() - latest_write->get_offset());\n\n                action->set_successful_due_to_conflict();\n                done_fun(action);\n                return;\n            }\n        }\n\n        \/* Determine if there are chunk conflicts and put ourself on the queues *\/\n        for (int64_t block = start; block < end; block++) {\n            std::map<int64_t, std::deque<action_t*> >::iterator it;\n            it = chunk_queues->find(block);\n\n            if (it != chunk_queues->end()) {\n                \/* We conflict on this block. *\/\n                action->conflict_count++;\n            }\n\n            \/* Put ourself on the queue for this chunk *\/\n            if (it == chunk_queues->end()) {\n                \/* Start a queue because there isn't one already *\/\n                it = chunk_queues->insert(it, std::make_pair(block, std::deque<action_t *>()));\n            }\n            rassert(it->first == block);\n            it->second.push_back(action);\n        }\n    } \/\/ if (!action->get_is_resize())\n\n    if (resize_active[action->get_fd()] > 0) {\n        \/* There is a resizing operation going on. Get in line for it. *\/\n\n        action->conflict_count += resize_active[action->get_fd()];\n        resize_waiter_queues[action->get_fd()].push_back(action);\n    }\n\n    \/* If there are no conflicts, we can start right away. *\/\n    if (action->conflict_count == 0) {\n        submit_action_downwards(action);\n    } else {\n        \/\/ TODO: Refine the perfmon such that it measures the actual time that ops spend\n        \/\/ in a waiting state\n        conflict_sampler.record(1);\n    }\n}\n\nvoid conflict_resolving_diskmgr_t::submit_action_downwards(action_t *action) {\n    accounting_diskmgr_action_t *action_payload =\n        static_cast<accounting_diskmgr_action_t *>(action);\n    submit_fun(action_payload);\n}\n\nvoid conflict_resolving_diskmgr_t::done(accounting_diskmgr_action_t *payload) {\n    \/* The only payloads we get back via done() should be payloads that we sent into\n    submit_fun(), which means they should actually be action_t objects secretly. *\/\n    action_t *action = static_cast<action_t *>(payload);\n\n    if (action->get_is_resize()) {\n        \/* Mark the resize as done. *\/\n        rassert(resize_active[action->get_fd()] > 0);\n        --resize_active[action->get_fd()];\n\n        \/* Resume all operations that were waiting for us. *\/\n        std::deque<action_t *> &waiter_queue = resize_waiter_queues[action->get_fd()];\n\n        std::vector<action_t *> waiters_to_unblock;\n        waiters_to_unblock.reserve(waiter_queue.size());\n\n        while (!waiter_queue.empty()) {\n            \/* Decrease the conflict count for the oldest remaining waiter. *\/\n            action_t *waiter = waiter_queue.front();\n            waiter_queue.pop_front();\n\n            rassert(waiter->conflict_count > 0);\n            waiter->conflict_count--;\n\n            \/* Resizes only wait for other resizes. So if we get here, we must\n            be the last thing that `waiter` has been waiting for. *\/\n            rassert(!waiter->get_is_resize() || waiter->conflict_count == 0);\n\n            if (waiter->conflict_count == 0) {\n                \/* The waiter isn't waiting on anything else. Unblock it. *\/\n                waiters_to_unblock.push_back(waiter);\n\n                if (waiter->get_is_resize()) {\n                    \/* We are about to submit another resize. waiters that come after\n                    this must remain on the resize_waiter_queue, because they\n                    are still waiting for that resize. Continue by\n                    just decrementing the conflict_count, but not\n                    popping the waiters off the queue nor unblocking them. *\/\n                    for (auto it = waiter_queue.begin();\n                         it != waiter_queue.end();\n                         ++it) {\n                        --(*it)->conflict_count;\n                        \/* The waiter must at least still be waiting for the\n                        resize we are about to unblock. *\/\n                        rassert((*it)->conflict_count > 0);\n                    }\n\n                    \/* Sorry, the remaining waiters must wait for a little longer. *\/\n                    break;\n                }\n            }\n        }\n\n        \/* Now actually unblock some waiters. *\/\n        for (size_t i = 0; i < waiters_to_unblock.size(); ++i) {\n            submit_action_downwards(waiters_to_unblock[i]);\n        }\n\n    } else {\n        std::map<int64_t, std::deque<action_t *> > *chunk_queues = &all_chunk_queues[action->get_fd()];\n\n        int64_t start, end;\n        get_range(action, &start, &end);\n\n        \/* Visit every block and see if anything is blocking on us. As we iterate\n        over block indices, we iterate through the corresponding entries in the map. *\/\n\n        std::map<int64_t, std::deque<action_t*> >::iterator it = chunk_queues->find(start);\n        for (int64_t block = start; block < end; block++) {\n            \/* We can assert this because at least we must still be on the queue *\/\n            rassert(it != chunk_queues->end() && it->first == block);\n\n            std::deque<action_t *> &queue = it->second;\n\n            \/* Remove ourselves from the queue *\/\n            rassert(queue.front() == action);\n            queue.pop_front();\n\n            if (!queue.empty()) {\n                \/* Continue with the next chunk queue.\n                We have to move on now, because we might call done() recursively and that might\n                invalidate the iterator. *\/\n                ++it;\n\n                \/* Something was blocking on us for this block. Get the first waiter from the queue. *\/\n                action_t *waiter = queue.front();\n\n                rassert(waiter->conflict_count > 0);\n                waiter->conflict_count--;\n\n                if (waiter->conflict_count == 0) {\n                    \/* We were the last thing it was waiting on *\/\n\n                    \/* If the waiter is a read, and the range it was supposed to read is a subrange of\n                    our range, then we can just fill its buffer directly instead of going to disk. *\/\n                    if (waiter->get_is_read() &&\n                            waiter->get_offset() >= action->get_offset() &&\n                            waiter->get_offset() + waiter->get_count() <= action->get_offset() + action->get_count() ) {\n\n                        copy_full_action_buf(waiter, action, waiter->get_offset() - action->get_offset());\n\n                        waiter->set_successful_due_to_conflict();\n\n                        \/* Recursively calling done() is safe. \"waiter\" must end at or before\n                        our current location, or else its conflict_count would still be nonzero.\n                        Therefore it will not touch any part of the multimap that we have not\n                        yet gotten to. If it touches the queue that we popped it from, that's\n                        also safe, because we've already moved our iterator past it.\n                        Note that we can potentially lose some short-circuit opportunities,\n                        because we might be able to provide a larger range than the request\n                        that we just provided a subset of our data to. So that request might\n                        not be able to short-circuit another watier, while we might have\n                        been able. This should be more of an academic concern though. *\/\n                        done(waiter);\n\n                    } else {\n                        \/* The shortcut didn't work out; do things the normal way *\/\n                        submit_action_downwards(waiter);\n                    }\n                }\n            } else {\n                \/* The queue is empty, erase it. *\/\n                chunk_queues->erase(it++);\n            }\n        }\n    }\n\n    done_fun(action);\n}\n<commit_msg>Revert \"Fix for #2500\"<commit_after>\/\/ Copyright 2010-2012 RethinkDB, all rights reserved.\n#include \"arch\/io\/disk\/conflict_resolving.hpp\"\n\n#include <deque>\n#include <map>\n\n#include \"containers\/printf_buffer.hpp\"\n#include \"perfmon\/perfmon.hpp\"\n\nvoid debug_print(printf_buffer_t *buf,\n                 const conflict_resolving_diskmgr_action_t &action) {\n    buf->appendf(\"cr_diskmgr_action{conflict_count=%d}<\", action.conflict_count);\n    const accounting_diskmgr_action_t &parent_action = action;\n    debug_print(buf, parent_action);\n}\n\n\nconflict_resolving_diskmgr_t::conflict_resolving_diskmgr_t(perfmon_collection_t *stats) :\n    conflict_sampler(secs_to_ticks(1), true),\n    conflict_sampler_membership(stats, &conflict_sampler, \"conflict\")\n{ }\n\nconflict_resolving_diskmgr_t::~conflict_resolving_diskmgr_t() {\n#ifndef NDEBUG\n    \/* Make sure there are no requests still out. *\/\n    for (std::map<fd_t, std::map<int64_t, std::deque<action_t *> > >::iterator\n             fd_t_chunk_queues = all_chunk_queues.begin();\n         fd_t_chunk_queues != all_chunk_queues.end();\n         ++fd_t_chunk_queues) {\n        rassert(fd_t_chunk_queues->second.empty());\n    }\n    for (auto it = resize_waiter_queues.begin();\n         it != resize_waiter_queues.end();\n         ++it) {\n        rassert(it->second.empty());\n    }\n    for (auto it = resize_active.begin(); it != resize_active.end(); ++it) {\n        rassert(it->second == 0);\n    }\n#endif\n}\n\n\/\/ Fills dest's bufs with data from source.  source's range is a superset of dest's.\nvoid copy_full_action_buf(pool_diskmgr_action_t *dest, pool_diskmgr_action_t *source,\n                          const size_t offset_into_source) {\n    guarantee(source->get_offset() <= dest->get_offset()\n              && source->get_offset() + source->get_count() >= dest->get_offset() + dest->get_count());\n\n    iovec *dest_vecs;\n    size_t dest_size;\n    dest->get_bufs(&dest_vecs, &dest_size);\n    iovec *source_vecs;\n    size_t source_size;\n    source->get_bufs(&source_vecs, &source_size);\n\n    fill_bufs_from_source(dest_vecs, dest_size, source_vecs, source_size, offset_into_source);\n};\n\nvoid conflict_resolving_diskmgr_t::submit(action_t *action) {\n    action->conflict_count = 0;\n\n    if (resize_active[action->get_fd()] > 0) {\n        \/* There is a resizing operation going on. Get in line for it. *\/\n\n        action->conflict_count += resize_active[action->get_fd()];\n        resize_waiter_queues[action->get_fd()].push_back(action);\n    }\n\n    if (action->get_is_resize()) {\n        \/* Block out subsequent operations; reads, writes and resizes alike. *\/\n        ++resize_active[action->get_fd()];\n    } else {\n        std::map<int64_t, std::deque<action_t *> > *chunk_queues = &all_chunk_queues[action->get_fd()];\n        \/* Determine the range of file-blocks that this action spans *\/\n        int64_t start;\n        int64_t end;\n        get_range(action, &start, &end);\n\n        \/* If this is a read, we check whether there is a write from which we\n        can \"steal\" data to satisfy the read immediately. We currently only\n        do this if there is a single write operation that provides all the data\n        that we need, we don't combine multiple writes that affect different parts\n        of the read request. *\/\n        if (action->get_is_read()) {\n            \/* The logic here is a bit tricky. What we do is the following:\n            First we check the queue for the first chunk. If there is a write that\n            can satisfy us, it must span all chunks and therefore be on the first\n            chunk's queue. We pick the latest write that exists on that queue, so\n            we get the most recent version of the data. We then check the other\n            chunks and make sure that the same write is also the latest write on\n            these queues. If there is another more recent write, we cannot take\n            the data from our initial write, because a subrange of it will be\n            overwritten by that other write. As an optimization, we could\n            still use the data from the initial write and just replace that part of\n            it, using the data from the other write. We leave this extension as an\n            exercise to the reader. *\/\n\n            action_t *latest_write = NULL;\n\n            std::map<int64_t, std::deque<action_t*> >::iterator it;\n            it = chunk_queues->find(start);\n            if (it != chunk_queues->end()) {\n                std::deque<action_t *> &queue = it->second;\n\n                \/* Locate the latest write on the queue *\/\n                std::deque<action_t *>::reverse_iterator qrit;\n                for (qrit = queue.rbegin(); qrit != queue.rend(); ++qrit) {\n                    if ((*qrit)->get_is_write()) {\n                        \/* We found it! Check if it's of any use to us...\n                        If the range it was supposed to write is a superrange of\n                        our range, then it's a valid candidate. *\/\n                        if ((*qrit)->get_offset() <= action->get_offset() &&\n                                (*qrit)->get_offset() + (*qrit)->get_count() >= action->get_offset() + action->get_count() ) {\n\n                            latest_write = *qrit;\n                        }\n\n                        \/* No other write on the queue can be the latest one. Stop looking. *\/\n                        break;\n                    }\n                }\n            }\n\n            \/* Now check that latest_write is also latest for all other chunks.\n            Keep on validating as long as we have a latest_write candidate. *\/\n            for (int64_t block = start; latest_write && block < end; block++) {\n                it = chunk_queues->find(start);\n                rassert(it != chunk_queues->end()); \/\/ Note: At least latest_write should be there!\n                std::deque<action_t *> &queue = it->second;\n\n                \/* Locate the latest write on the queue *\/\n                std::deque<action_t *>::reverse_iterator qrit;\n                for (qrit = queue.rbegin(); qrit != queue.rend(); ++qrit) {\n                    if ((*qrit)->get_is_write()) {\n\n                        if (*qrit != latest_write) {\n                            \/* This write is more recent than latest_write, so latest_write\n                            isn't actually the latest one over the whole range,\n                            This renders it unusable for us. *\/\n                            latest_write = NULL;\n                        }\n\n                        \/* No other write on the queue can be the latest one. Stop looking. *\/\n                        break;\n                    }\n                }\n            }\n\n            if (latest_write) {\n                copy_full_action_buf(action, latest_write, action->get_offset() - latest_write->get_offset());\n\n                action->set_successful_due_to_conflict();\n                done_fun(action);\n                return;\n            }\n        }\n\n        \/* Determine if there are chunk conflicts and put ourself on the queues *\/\n        for (int64_t block = start; block < end; block++) {\n            std::map<int64_t, std::deque<action_t*> >::iterator it;\n            it = chunk_queues->find(block);\n\n            if (it != chunk_queues->end()) {\n                \/* We conflict on this block. *\/\n                action->conflict_count++;\n            }\n\n            \/* Put ourself on the queue for this chunk *\/\n            if (it == chunk_queues->end()) {\n                \/* Start a queue because there isn't one already *\/\n                it = chunk_queues->insert(it, std::make_pair(block, std::deque<action_t *>()));\n            }\n            rassert(it->first == block);\n            it->second.push_back(action);\n        }\n    } \/\/ if (!action->get_is_resize())\n\n    \/* If there are no conflicts, we can start right away. *\/\n    if (action->conflict_count == 0) {\n        submit_action_downwards(action);\n    } else {\n        \/\/ TODO: Refine the perfmon such that it measures the actual time that ops spend\n        \/\/ in a waiting state\n        conflict_sampler.record(1);\n    }\n}\n\nvoid conflict_resolving_diskmgr_t::submit_action_downwards(action_t *action) {\n    accounting_diskmgr_action_t *action_payload =\n        static_cast<accounting_diskmgr_action_t *>(action);\n    submit_fun(action_payload);\n}\n\nvoid conflict_resolving_diskmgr_t::done(accounting_diskmgr_action_t *payload) {\n    \/* The only payloads we get back via done() should be payloads that we sent into\n    submit_fun(), which means they should actually be action_t objects secretly. *\/\n    action_t *action = static_cast<action_t *>(payload);\n\n    if (action->get_is_resize()) {\n        \/* Mark the resize as done. *\/\n        rassert(resize_active[action->get_fd()] > 0);\n        --resize_active[action->get_fd()];\n\n        \/* Resume all operations that were waiting for us. *\/\n        std::deque<action_t *> &waiter_queue = resize_waiter_queues[action->get_fd()];\n\n        std::vector<action_t *> waiters_to_unblock;\n        waiters_to_unblock.reserve(waiter_queue.size());\n\n        while (!waiter_queue.empty()) {\n            \/* Decrease the conflict count for the oldest remaining waiter. *\/\n            action_t *waiter = waiter_queue.front();\n            waiter_queue.pop_front();\n\n            rassert(waiter->conflict_count > 0);\n            waiter->conflict_count--;\n\n            \/* Resizes only wait for other resizes. So if we get here, we must\n            be the last thing that `waiter` has been waiting for. *\/\n            rassert(!waiter->get_is_resize() || waiter->conflict_count == 0);\n\n            if (waiter->conflict_count == 0) {\n                \/* The waiter isn't waiting on anything else. Unblock it. *\/\n                waiters_to_unblock.push_back(waiter);\n\n                if (waiter->get_is_resize()) {\n                    \/* We are about to submit another resize. waiters that come after\n                    this must remain on the resize_waiter_queue, because they\n                    are still waiting for that resize. Continue by\n                    just decrementing the conflict_count, but not\n                    popping the waiters off the queue nor unblocking them. *\/\n                    for (auto it = waiter_queue.begin();\n                         it != waiter_queue.end();\n                         ++it) {\n                        --(*it)->conflict_count;\n                        \/* The waiter must at least still be waiting for the\n                        resize we are about to unblock. *\/\n                        rassert((*it)->conflict_count > 0);\n                    }\n\n                    \/* Sorry, the remaining waiters must wait for a little longer. *\/\n                    break;\n                }\n            }\n        }\n\n        \/* Now actually unblock some waiters. *\/\n        for (size_t i = 0; i < waiters_to_unblock.size(); ++i) {\n            submit_action_downwards(waiters_to_unblock[i]);\n        }\n\n    } else {\n        std::map<int64_t, std::deque<action_t *> > *chunk_queues = &all_chunk_queues[action->get_fd()];\n\n        int64_t start, end;\n        get_range(action, &start, &end);\n\n        \/* Visit every block and see if anything is blocking on us. As we iterate\n        over block indices, we iterate through the corresponding entries in the map. *\/\n\n        std::map<int64_t, std::deque<action_t*> >::iterator it = chunk_queues->find(start);\n        for (int64_t block = start; block < end; block++) {\n            \/* We can assert this because at least we must still be on the queue *\/\n            rassert(it != chunk_queues->end() && it->first == block);\n\n            std::deque<action_t *> &queue = it->second;\n\n            \/* Remove ourselves from the queue *\/\n            rassert(queue.front() == action);\n            queue.pop_front();\n\n            if (!queue.empty()) {\n                \/* Continue with the next chunk queue.\n                We have to move on now, because we might call done() recursively and that might\n                invalidate the iterator. *\/\n                ++it;\n\n                \/* Something was blocking on us for this block. Get the first waiter from the queue. *\/\n                action_t *waiter = queue.front();\n\n                rassert(waiter->conflict_count > 0);\n                waiter->conflict_count--;\n\n                if (waiter->conflict_count == 0) {\n                    \/* We were the last thing it was waiting on *\/\n\n                    \/* If the waiter is a read, and the range it was supposed to read is a subrange of\n                    our range, then we can just fill its buffer directly instead of going to disk. *\/\n                    if (waiter->get_is_read() &&\n                            waiter->get_offset() >= action->get_offset() &&\n                            waiter->get_offset() + waiter->get_count() <= action->get_offset() + action->get_count() ) {\n\n                        copy_full_action_buf(waiter, action, waiter->get_offset() - action->get_offset());\n\n                        waiter->set_successful_due_to_conflict();\n\n                        \/* Recursively calling done() is safe. \"waiter\" must end at or before\n                        our current location, or else its conflict_count would still be nonzero.\n                        Therefore it will not touch any part of the multimap that we have not\n                        yet gotten to. If it touches the queue that we popped it from, that's\n                        also safe, because we've already moved our iterator past it.\n                        Note that we can potentially lose some short-circuit opportunities,\n                        because we might be able to provide a larger range than the request\n                        that we just provided a subset of our data to. So that request might\n                        not be able to short-circuit another watier, while we might have\n                        been able. This should be more of an academic concern though. *\/\n                        done(waiter);\n\n                    } else {\n                        \/* The shortcut didn't work out; do things the normal way *\/\n                        submit_action_downwards(waiter);\n                    }\n                }\n            } else {\n                \/* The queue is empty, erase it. *\/\n                chunk_queues->erase(it++);\n            }\n        }\n    }\n\n    done_fun(action);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2010-2012 RethinkDB, all rights reserved.\n#ifndef ARCH_RUNTIME_CONTEXT_SWITCHING_HPP_\n#define ARCH_RUNTIME_CONTEXT_SWITCHING_HPP_\n\n#include <pthread.h>\n\n#include \"errors.hpp\"\n\n#include \"arch\/io\/concurrency.hpp\"\n#include \"containers\/scoped.hpp\"\n\n\n\/* Note that `artificial_stack_context_ref_t` is not a POD type. We could make it a POD type, but\nat the cost of removing some safety guarantees provided by the constructor and\ndestructor. *\/\n\nstruct artificial_stack_context_ref_t {\n\n    \/* Creates a nil `context_ref_t`. *\/\n    artificial_stack_context_ref_t();\n\n    \/* Destroys a `context_ref_t`. It must be nil at the time that this\n    destructor is called; if you're trying to call the destructor and it's\n    non-nil, that means you're leaking a stack somewhere. *\/\n    ~artificial_stack_context_ref_t();\n\n    \/* Returns `true` if the `artificial_stack_context_ref_t` is nil, and false otherwise. *\/\n    bool is_nil();\n\nprivate:\n    friend class artificial_stack_t;\n    friend void context_switch(artificial_stack_context_ref_t *,\n                               artificial_stack_context_ref_t *);\n\n    \/* `pointer` points to a location on the stack of the context in question.\n    From that pointer, we find the instruction pointer, relevant registers, and\n    so on. *\/\n    void *pointer;\n\n    DISABLE_COPYING(artificial_stack_context_ref_t);\n};\n\nclass artificial_stack_t {\npublic:\n\n    \/* `artificial_stack_t()` sets up an artificial context. Once it is set up,\n    you can use `context` to swap into and out of it. When you call\n    `~artificial_stack_t()`, the original context must have been returned to\n    `context` again. *\/\n    artificial_stack_t(void (*initial_fun)(void), size_t stack_size);\n    ~artificial_stack_t();\n\n    artificial_stack_context_ref_t context;\n\n    \/* Returns `true` if the given address is on this stack or in its protection\n    page. *\/\n    bool address_in_stack(void *addr);\n\n    \/* Returns `true` if the given address is in the stack's protection page. *\/\n    bool address_is_stack_overflow(void *addr);\n\n    \/* Returns the base of the stack *\/\n    void *get_stack_base() { return static_cast<char*>(stack) + stack_size; }\n\n    \/* Returns the end of the stack *\/\n    void *get_stack_bound() { return stack; }\n\nprivate:\n    void *stack;\n    size_t stack_size;\n#ifdef VALGRIND\n    int valgrind_stack_id;\n#endif\n};\n\n\/* `context_switch()` switches from one context to another.\n`current_context_out` must be nil; it will be filled with the context that we\nwere in when we called `context_switch()`. `destination_context_in` must be\nnon-nil; it will be set to nil, and we will switch to it. *\/\nvoid context_switch(\n    artificial_stack_context_ref_t *current_context_out,\n    artificial_stack_context_ref_t *dest_context_in);\n\n\n\n\/* ____ Threaded version of context_switching ____ *\/\n\n\/*\n * This is an alternative implementation where each context runs in a thread of\n * its own. The primary use case for this is to allow certain profiling tools\n * that would otherwise get confused by our artificial_stack switches to be used\n * with RethinkDB. Another use case is to ease porting RethinkDB to new\n * architectures in cases where performance doesn't matter much.\n *\n * Internally, one thread is created per threaded_stack_t. To be compatible\n * with the artificial_stack_t implementation, we simulate a fixed number of\n * \"virtual threads\" (up to MAX_THREADS) Each threaded_stack_t has an associated\n * virtual thread and only one threaded_stack_t can be active per virtual thread\n * at any time, which is enforced through a mutex per virtual thread and a\n * condition in each threaded_stack_t.\n *\n * A context switch then is simply notifying the condition on the threaded_stack_t\n * that should be swapped in and then making the previous context wait on its own\n * condition (there is some additional logic for handling virtual thread\n * switches and switching from\/to the global context).\n *\/\n\nclass linux_thread_pool_t;\nclass linux_thread_t;\n\nclass threaded_context_ref_t {\npublic:\n    threaded_context_ref_t() : do_rethread(false) { store_virtual_thread(); }\n    ~threaded_context_ref_t() { lock.reset(); }\n\n    \/* Every context reference has a condition that can be used to wake it up.\n    While it is active, it also holds a lock on the virtual_thread_mutexes of\n    its current virtual thread. *\/\n    system_cond_t cond;\n    scoped_ptr_t<system_mutex_t::lock_t> lock;\n\n    \/* Returns `true` if the threaded_context_t has not been used yet,\n    or if it is a reference to the scheduler context and the scheduler is currently\n    running.\n    (in other words: if it doesn't currently hold a context reference) *\/\n    bool is_nil() { return !lock.has(); }\n\n    void wait();\n    void rethread_to_current();\nprivate:\n    friend class threaded_stack_t;\n    void restore_virtual_thread();\n    void store_virtual_thread();\n\n    bool do_rethread;\n\n    \/* These variables store the values that `restore_virtual_thread()` loads into\n    linux_thread_pool_t's `thread_pool`, `thread_id` and `thread` variables.\n    Those variables are thread-local in `linux_thread_pool_t`. Since a threaded\n    context is actually run in a thread of its own, we have to initialize these\n    values when the threaded context is activated.\n    More specifically, we set them to the same values that they had when the\n    `threaded_context_ref_t` was constructed, so it appears like it ran in\n    the same thread. Unless the context is re-threaded, in which case\n    we set them to the values taken from the thread that the context is re-threaded\n    to. *\/\n    linux_thread_pool_t *my_thread_pool;\n    int32_t my_thread_id;\n    linux_thread_t *my_thread;\n\n    DISABLE_COPYING(threaded_context_ref_t);\n};\n\nvoid context_switch(threaded_context_ref_t *current_context,\n                    threaded_context_ref_t *dest_context);\n\nclass threaded_stack_t {\npublic:\n\n    threaded_stack_t(void (*initial_fun_)(void), size_t stack_size);\n    ~threaded_stack_t();\n\n    threaded_context_ref_t context;\n\n    \/* Returns `true` if the given address is on this stack or in its protection\n    page. *\/\n    bool address_in_stack(void *addr);\n\n    \/* Returns `true` if the given address is in the stack's protection page. *\/\n    bool address_is_stack_overflow(void *addr);\n\n    \/* Returns the base of the stack *\/\n    void *get_stack_base();\n\n    \/* Returns the end of the stack *\/\n    void *get_stack_bound();\n\nprivate:\n    static void *internal_run(void *p);\n    void get_stack_addr_size(void **stackaddr_out, size_t *stacksize_out);\n\n    pthread_t thread;\n    void (*initial_fun)(void);\n    system_cond_t launch_cond;\n\n    \/\/ To fake the memory overhead of an artificial_stack_t, we actually\n    \/\/ allocate one here and just let it sit around.\n    \/\/ TODO: If we at some point want to use threaded_stack_t for production\n    \/\/ stuff, we will have to remove this.\n    artificial_stack_t dummy_stack;\n\n    DISABLE_COPYING(threaded_stack_t);\n};\n\n\/* ^^^^ Threaded version of context_switching ^^^^ *\/\n\n#ifdef THREADED_COROUTINES\ntypedef threaded_stack_t coro_stack_t;\ntypedef threaded_context_ref_t coro_context_ref_t;\n#else\ntypedef artificial_stack_t coro_stack_t;\ntypedef artificial_stack_context_ref_t coro_context_ref_t;\n#endif\n\n\n#endif \/* ARCH_RUNTIME_CONTEXT_SWITCHING_HPP_ *\/\n<commit_msg>Removed a redundant destructor<commit_after>\/\/ Copyright 2010-2012 RethinkDB, all rights reserved.\n#ifndef ARCH_RUNTIME_CONTEXT_SWITCHING_HPP_\n#define ARCH_RUNTIME_CONTEXT_SWITCHING_HPP_\n\n#include <pthread.h>\n\n#include \"errors.hpp\"\n\n#include \"arch\/io\/concurrency.hpp\"\n#include \"containers\/scoped.hpp\"\n\n\n\/* Note that `artificial_stack_context_ref_t` is not a POD type. We could make it a POD type, but\nat the cost of removing some safety guarantees provided by the constructor and\ndestructor. *\/\n\nstruct artificial_stack_context_ref_t {\n\n    \/* Creates a nil `context_ref_t`. *\/\n    artificial_stack_context_ref_t();\n\n    \/* Destroys a `context_ref_t`. It must be nil at the time that this\n    destructor is called; if you're trying to call the destructor and it's\n    non-nil, that means you're leaking a stack somewhere. *\/\n    ~artificial_stack_context_ref_t();\n\n    \/* Returns `true` if the `artificial_stack_context_ref_t` is nil, and false otherwise. *\/\n    bool is_nil();\n\nprivate:\n    friend class artificial_stack_t;\n    friend void context_switch(artificial_stack_context_ref_t *,\n                               artificial_stack_context_ref_t *);\n\n    \/* `pointer` points to a location on the stack of the context in question.\n    From that pointer, we find the instruction pointer, relevant registers, and\n    so on. *\/\n    void *pointer;\n\n    DISABLE_COPYING(artificial_stack_context_ref_t);\n};\n\nclass artificial_stack_t {\npublic:\n\n    \/* `artificial_stack_t()` sets up an artificial context. Once it is set up,\n    you can use `context` to swap into and out of it. When you call\n    `~artificial_stack_t()`, the original context must have been returned to\n    `context` again. *\/\n    artificial_stack_t(void (*initial_fun)(void), size_t stack_size);\n    ~artificial_stack_t();\n\n    artificial_stack_context_ref_t context;\n\n    \/* Returns `true` if the given address is on this stack or in its protection\n    page. *\/\n    bool address_in_stack(void *addr);\n\n    \/* Returns `true` if the given address is in the stack's protection page. *\/\n    bool address_is_stack_overflow(void *addr);\n\n    \/* Returns the base of the stack *\/\n    void *get_stack_base() { return static_cast<char*>(stack) + stack_size; }\n\n    \/* Returns the end of the stack *\/\n    void *get_stack_bound() { return stack; }\n\nprivate:\n    void *stack;\n    size_t stack_size;\n#ifdef VALGRIND\n    int valgrind_stack_id;\n#endif\n};\n\n\/* `context_switch()` switches from one context to another.\n`current_context_out` must be nil; it will be filled with the context that we\nwere in when we called `context_switch()`. `destination_context_in` must be\nnon-nil; it will be set to nil, and we will switch to it. *\/\nvoid context_switch(\n    artificial_stack_context_ref_t *current_context_out,\n    artificial_stack_context_ref_t *dest_context_in);\n\n\n\n\/* ____ Threaded version of context_switching ____ *\/\n\n\/*\n * This is an alternative implementation where each context runs in a thread of\n * its own. The primary use case for this is to allow certain profiling tools\n * that would otherwise get confused by our artificial_stack switches to be used\n * with RethinkDB. Another use case is to ease porting RethinkDB to new\n * architectures in cases where performance doesn't matter much.\n *\n * Internally, one thread is created per threaded_stack_t. To be compatible\n * with the artificial_stack_t implementation, we simulate a fixed number of\n * \"virtual threads\" (up to MAX_THREADS) Each threaded_stack_t has an associated\n * virtual thread and only one threaded_stack_t can be active per virtual thread\n * at any time, which is enforced through a mutex per virtual thread and a\n * condition in each threaded_stack_t.\n *\n * A context switch then is simply notifying the condition on the threaded_stack_t\n * that should be swapped in and then making the previous context wait on its own\n * condition (there is some additional logic for handling virtual thread\n * switches and switching from\/to the global context).\n *\/\n\nclass linux_thread_pool_t;\nclass linux_thread_t;\n\nclass threaded_context_ref_t {\npublic:\n    threaded_context_ref_t() : do_rethread(false) { store_virtual_thread(); }\n\n    \/* Every context reference has a condition that can be used to wake it up.\n    While it is active, it also holds a lock on the virtual_thread_mutexes of\n    its current virtual thread. *\/\n    system_cond_t cond;\n    scoped_ptr_t<system_mutex_t::lock_t> lock;\n\n    \/* Returns `true` if the threaded_context_t has not been used yet,\n    or if it is a reference to the scheduler context and the scheduler is currently\n    running.\n    (in other words: if it doesn't currently hold a context reference) *\/\n    bool is_nil() { return !lock.has(); }\n\n    void wait();\n    void rethread_to_current();\nprivate:\n    friend class threaded_stack_t;\n    void restore_virtual_thread();\n    void store_virtual_thread();\n\n    bool do_rethread;\n\n    \/* These variables store the values that `restore_virtual_thread()` loads into\n    linux_thread_pool_t's `thread_pool`, `thread_id` and `thread` variables.\n    Those variables are thread-local in `linux_thread_pool_t`. Since a threaded\n    context is actually run in a thread of its own, we have to initialize these\n    values when the threaded context is activated.\n    More specifically, we set them to the same values that they had when the\n    `threaded_context_ref_t` was constructed, so it appears like it ran in\n    the same thread. Unless the context is re-threaded, in which case\n    we set them to the values taken from the thread that the context is re-threaded\n    to. *\/\n    linux_thread_pool_t *my_thread_pool;\n    int32_t my_thread_id;\n    linux_thread_t *my_thread;\n\n    DISABLE_COPYING(threaded_context_ref_t);\n};\n\nvoid context_switch(threaded_context_ref_t *current_context,\n                    threaded_context_ref_t *dest_context);\n\nclass threaded_stack_t {\npublic:\n\n    threaded_stack_t(void (*initial_fun_)(void), size_t stack_size);\n    ~threaded_stack_t();\n\n    threaded_context_ref_t context;\n\n    \/* Returns `true` if the given address is on this stack or in its protection\n    page. *\/\n    bool address_in_stack(void *addr);\n\n    \/* Returns `true` if the given address is in the stack's protection page. *\/\n    bool address_is_stack_overflow(void *addr);\n\n    \/* Returns the base of the stack *\/\n    void *get_stack_base();\n\n    \/* Returns the end of the stack *\/\n    void *get_stack_bound();\n\nprivate:\n    static void *internal_run(void *p);\n    void get_stack_addr_size(void **stackaddr_out, size_t *stacksize_out);\n\n    pthread_t thread;\n    void (*initial_fun)(void);\n    system_cond_t launch_cond;\n\n    \/\/ To fake the memory overhead of an artificial_stack_t, we actually\n    \/\/ allocate one here and just let it sit around.\n    \/\/ TODO: If we at some point want to use threaded_stack_t for production\n    \/\/ stuff, we will have to remove this.\n    artificial_stack_t dummy_stack;\n\n    DISABLE_COPYING(threaded_stack_t);\n};\n\n\/* ^^^^ Threaded version of context_switching ^^^^ *\/\n\n#ifdef THREADED_COROUTINES\ntypedef threaded_stack_t coro_stack_t;\ntypedef threaded_context_ref_t coro_context_ref_t;\n#else\ntypedef artificial_stack_t coro_stack_t;\ntypedef artificial_stack_context_ref_t coro_context_ref_t;\n#endif\n\n\n#endif \/* ARCH_RUNTIME_CONTEXT_SWITCHING_HPP_ *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/ __BEGIN_LICENSE__\n\/\/  Copyright (c) 2009-2013, United States Government as represented by the\n\/\/  Administrator of the National Aeronautics and Space Administration. All\n\/\/  rights reserved.\n\/\/\n\/\/  The NGT platform is licensed under the Apache License, Version 2.0 (the\n\/\/  \"License\"); you may not use this file except in compliance with the\n\/\/  License. You may obtain a copy of the License at\n\/\/  http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/  Unless required by applicable law or agreed to in writing, software\n\/\/  distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/  See the License for the specific language governing permissions and\n\/\/  limitations under the License.\n\/\/ __END_LICENSE__\n\n#include <vw\/Core\/Log.h>\n#include <vw\/Math\/Functors.h>\n#include <vw\/Math\/Matrix.h>\n#include <vw\/Math\/LevenbergMarquardt.h>\n#include <vw\/Math\/Vector.h>\n#include <vw\/Camera\/CameraModel.h>\n#include <vw\/Cartography\/Datum.h>\n\n#include <asp\/Sessions\/RPC\/RPCModel.h>\n#include <asp\/Sessions\/RPC\/RPCStereoModel.h>\n\nusing namespace vw;\nnamespace asp {\n\n  namespace detail {\n    class RPCTriangulateLMA : public math::LeastSquaresModelBase<RPCTriangulateLMA> {\n      const RPCModel *m_rpc_model1, *m_rpc_model2;\n    public:\n      typedef Vector<double, 4>    result_type;\n      typedef Vector<double, 3>    domain_type;\n      typedef Matrix<double, 4, 3> jacobian_type;\n\n      RPCTriangulateLMA( RPCModel const* rpc_model1,\n                         RPCModel const* rpc_model2 ) :\n        m_rpc_model1(rpc_model1), m_rpc_model2(rpc_model2) {}\n\n      inline result_type operator()( domain_type const& x ) const {\n        result_type output;\n        subvector(output, 0, 2) = m_rpc_model1->geodetic_to_pixel(x);\n        subvector(output, 2, 2) = m_rpc_model2->geodetic_to_pixel(x);\n        return output;\n      }\n\n      inline jacobian_type jacobian( domain_type const& x ) const {\n        jacobian_type J;\n        submatrix(J, 0, 0, 2, 3) = m_rpc_model1->geodetic_to_pixel_Jacobian(x);\n        submatrix(J, 2, 0, 2, 3) = m_rpc_model2->geodetic_to_pixel_Jacobian(x);\n        return J;\n      }\n\n    };\n  }\n\n  Vector3 RPCStereoModel::operator()(Vector2 const& pix1, Vector2 const& pix2,\n                                     Vector3& errorVec) const {\n\n    \/\/ Note: This is a re-implementation of StereoModel::operator().\n\n    errorVec = Vector3();\n\n    \/\/ Check for NaN and invalid pixels\n    if (pix1 != pix1 || pix2 != pix2) return Vector3();\n    if (pix1 == vw::camera::CameraModel::invalid_pixel() ||\n        pix2 == vw::camera::CameraModel::invalid_pixel()\n        ) return Vector3();\n    \n    const RPCModel *rpc_model1 = dynamic_cast<const RPCModel*>(m_camera1);\n    const RPCModel *rpc_model2 = dynamic_cast<const RPCModel*>(m_camera2);\n\n    if (rpc_model1 == NULL || rpc_model2 == NULL){\n      VW_OUT(ErrorMessage) << \"RPC camera models expected.\\n\";\n      return Vector3();\n    }\n\n    try {\n      \n      Vector3 origin1, vec1, origin2, vec2;\n      rpc_model1->point_and_dir(pix1, origin1, vec1);\n      rpc_model2->point_and_dir(pix2, origin2, vec2);\n\n      if (are_nearly_parallel(vec1, vec2)){\n        return Vector3();\n      }\n\n      Vector3 result = triangulate_point(origin1, vec1,\n                                         origin2, vec2,\n                                         errorVec);\n\n      if ( m_least_squares ){\n\n        \/\/ Refine triangulation\n\n        detail::RPCTriangulateLMA model(rpc_model1, rpc_model2);\n        Vector4 objective( pix1[0], pix1[1], pix2[0], pix2[1] );\n        int status = 0;\n\n        Vector3 initialGeodetic = rpc_model1->datum().cartesian_to_geodetic(result);\n\n        \/\/ To do: Find good values for the numbers controlling the convergence\n        Vector3 finalGeodetic = levenberg_marquardt( model, initialGeodetic,\n                                                     objective, status, 1e-3, 1e-6, 10 );\n\n        if ( status > 0 )\n          result = rpc_model1->datum().geodetic_to_cartesian(finalGeodetic);\n      }\n\n      return result;\n\n    } catch (...) {}\n    return Vector3();\n  }\n\n  Vector3 RPCStereoModel::operator()(Vector2 const& pix1, Vector2 const& pix2,\n                                     double& error ) const {\n    Vector3 errorVec;\n    Vector3 result = RPCStereoModel::operator()(pix1, pix2, errorVec);\n    error = norm_2(errorVec);\n    return result;\n  }\n  \n} \/\/ namespace asp\n<commit_msg>RPCStereoModel: Reshuffle for consistency<commit_after>\/\/ __BEGIN_LICENSE__\n\/\/  Copyright (c) 2009-2013, United States Government as represented by the\n\/\/  Administrator of the National Aeronautics and Space Administration. All\n\/\/  rights reserved.\n\/\/\n\/\/  The NGT platform is licensed under the Apache License, Version 2.0 (the\n\/\/  \"License\"); you may not use this file except in compliance with the\n\/\/  License. You may obtain a copy of the License at\n\/\/  http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/  Unless required by applicable law or agreed to in writing, software\n\/\/  distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/  See the License for the specific language governing permissions and\n\/\/  limitations under the License.\n\/\/ __END_LICENSE__\n\n#include <vw\/Core\/Log.h>\n#include <vw\/Math\/Functors.h>\n#include <vw\/Math\/Matrix.h>\n#include <vw\/Math\/LevenbergMarquardt.h>\n#include <vw\/Math\/Vector.h>\n#include <vw\/Camera\/CameraModel.h>\n#include <vw\/Cartography\/Datum.h>\n\n#include <asp\/Sessions\/RPC\/RPCModel.h>\n#include <asp\/Sessions\/RPC\/RPCStereoModel.h>\n\nusing namespace vw;\nnamespace asp {\n\n  namespace detail {\n    class RPCTriangulateLMA : public math::LeastSquaresModelBase<RPCTriangulateLMA> {\n      const RPCModel *m_rpc_model1, *m_rpc_model2;\n    public:\n      typedef Vector<double, 4>    result_type;\n      typedef Vector<double, 3>    domain_type;\n      typedef Matrix<double, 4, 3> jacobian_type;\n\n      RPCTriangulateLMA( RPCModel const* rpc_model1,\n                         RPCModel const* rpc_model2 ) :\n        m_rpc_model1(rpc_model1), m_rpc_model2(rpc_model2) {}\n\n      inline result_type operator()( domain_type const& x ) const {\n        result_type output;\n        subvector(output, 0, 2) = m_rpc_model1->geodetic_to_pixel(x);\n        subvector(output, 2, 2) = m_rpc_model2->geodetic_to_pixel(x);\n        return output;\n      }\n\n      inline jacobian_type jacobian( domain_type const& x ) const {\n        jacobian_type J;\n        submatrix(J, 0, 0, 2, 3) = m_rpc_model1->geodetic_to_pixel_Jacobian(x);\n        submatrix(J, 2, 0, 2, 3) = m_rpc_model2->geodetic_to_pixel_Jacobian(x);\n        return J;\n      }\n\n    };\n  }\n\n  Vector3 RPCStereoModel::operator()(Vector2 const& pix1, Vector2 const& pix2,\n                                     Vector3& errorVec) const {\n\n    \/\/ Note: This is a re-implementation of StereoModel::operator().\n\n    errorVec = Vector3();\n\n    \/\/ Check for NaN and invalid pixels\n    if (pix1 != pix1 || pix2 != pix2) return Vector3();\n    if (pix1 == vw::camera::CameraModel::invalid_pixel() ||\n        pix2 == vw::camera::CameraModel::invalid_pixel()\n        ) return Vector3();\n    \n    try {\n      \n      const RPCModel *rpc_model1 = dynamic_cast<const RPCModel*>(m_camera1);\n      const RPCModel *rpc_model2 = dynamic_cast<const RPCModel*>(m_camera2);\n      \n      if (rpc_model1 == NULL || rpc_model2 == NULL){\n        VW_OUT(ErrorMessage) << \"RPC camera models expected.\\n\";\n        return Vector3();\n      }\n      \n      Vector3 origin1, vec1, origin2, vec2;\n      rpc_model1->point_and_dir(pix1, origin1, vec1);\n      rpc_model2->point_and_dir(pix2, origin2, vec2);\n      \n      if (are_nearly_parallel(vec1, vec2)){\n        return Vector3();\n      }\n      Vector3 result = triangulate_point(origin1, vec1,\n                                         origin2, vec2,\n                                         errorVec);\n      \n      if ( m_least_squares ){\n        \n        \/\/ Refine triangulation\n        \n        detail::RPCTriangulateLMA model(rpc_model1, rpc_model2);\n        Vector4 objective( pix1[0], pix1[1], pix2[0], pix2[1] );\n        int status = 0;\n        \n        Vector3 initialGeodetic = rpc_model1->datum().cartesian_to_geodetic(result);\n        \n        \/\/ To do: Find good values for the numbers controlling the convergence\n        Vector3 finalGeodetic = levenberg_marquardt( model, initialGeodetic,\n                                                     objective, status, 1e-3, 1e-6, 10 );\n\n        if ( status > 0 )\n          result = rpc_model1->datum().geodetic_to_cartesian(finalGeodetic);\n      }\n      \n      return result;\n      \n    } catch (...) {}\n    return Vector3();\n  }\n\n  Vector3 RPCStereoModel::operator()(Vector2 const& pix1, Vector2 const& pix2,\n                                     double& error ) const {\n    Vector3 errorVec;\n    Vector3 result = RPCStereoModel::operator()(pix1, pix2, errorVec);\n    error = norm_2(errorVec);\n    return result;\n  }\n  \n} \/\/ namespace asp\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\/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\/extension_service.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/renderer_host\/render_view_host.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\/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 kDebuggerTestPage[] = \"files\/devtools\/debugger_test_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 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    ExtensionService* service = browser()->profile()->GetExtensionService();\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 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\n\/\/ Marked as disabled: crbug\/73289.\nIN_PROC_BROWSER_TEST_F(DevToolsSanityTest,\n                       DISABLED_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}  \/\/ namespace\n<commit_msg>Enable back DevToolsSanityTest.TestScriptsTabIsPopulatedOnInspectedPageRefresh Should pass after the last WK roll (r75275).<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\/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\/extension_service.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/renderer_host\/render_view_host.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\/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 kDebuggerTestPage[] = \"files\/devtools\/debugger_test_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 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    ExtensionService* service = browser()->profile()->GetExtensionService();\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 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}  \/\/ namespace\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\/\/ 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<commit_msg>Marked DevToolsSanityTest.TestProfilerTab as flaky. See http:\/\/test-results.appspot.com\/dashboards\/flakiness_dashboard.html#testType=interactive_ui_tests&tests=DevToolsSanityTest.TestProfilerTab There's crbug.com\/54592 for that.<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, FLAKY_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) 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#if !defined(OS_CHROMEOS)\n\n#include \"chrome\/browser\/dom_ui\/advanced_options_utils.h\"\n\n#include \"app\/gtk_signal.h\"\n#include \"app\/gtk_util.h\"\n#include \"base\/file_util.h\"\n#include \"base\/environment.h\"\n#include \"base\/process_util.h\"\n#include \"base\/string_tokenizer.h\"\n#include \"base\/xdg_util.h\"\n#include \"chrome\/browser\/browser_list.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/common\/process_watcher.h\"\n\n\/\/ Command used to configure GNOME proxy settings. The command was renamed\n\/\/ in January 2009, so both are used to work on both old and new systems.\nconst char* kOldGNOMEProxyConfigCommand[] = {\"gnome-network-preferences\", NULL};\nconst char* kGNOMEProxyConfigCommand[] = {\"gnome-network-properties\", NULL};\n\/\/ KDE3 and KDE4 are only slightly different, but incompatible. Go figure.\nconst char* kKDE3ProxyConfigCommand[] = {\"kcmshell\", \"proxy\", NULL};\nconst char* kKDE4ProxyConfigCommand[] = {\"kcmshell4\", \"proxy\", NULL};\n\n\/\/ The URL for Linux proxy configuration help when not running under a\n\/\/ supported desktop environment.\nconst char kLinuxProxyConfigUrl[] = \"about:linux-proxy-config\";\n\n\/\/ The URL for Linux ssl certificate configuration help.\nconst char* const kLinuxCertificatesConfigUrl =\n    \"http:\/\/code.google.com\/p\/chromium\/wiki\/LinuxCertManagement\";\n\n\nstruct ProxyConfigCommand {\n  std::string binary;\n  const char** argv;\n};\n\nstatic bool SearchPATH(ProxyConfigCommand* commands, size_t ncommands,\n                       size_t* index) {\n  const char* path = getenv(\"PATH\");\n  if (!path)\n    return false;\n  FilePath bin_path;\n  CStringTokenizer tk(path, path + strlen(path), \":\");\n  \/\/ Search $PATH looking for the commands in order.\n  while (tk.GetNext()) {\n    for (size_t i = 0; i < ncommands; i++) {\n      bin_path = FilePath(tk.token()).Append(commands[i].argv[0]);\n      if (file_util::PathExists(bin_path)) {\n        commands[i].binary = bin_path.value();\n        if (index)\n          *index = i;\n        return true;\n      }\n    }\n  }\n  \/\/ Did not find any of the binaries in $PATH.\n  return false;\n}\n\nstatic void StartProxyConfigUtil(const ProxyConfigCommand& command) {\n  std::vector<std::string> argv;\n  argv.push_back(command.binary);\n  for (size_t i = 1; command.argv[i]; i++)\n    argv.push_back(command.argv[i]);\n  base::file_handle_mapping_vector no_files;\n  base::ProcessHandle handle;\n  if (!base::LaunchApp(argv, no_files, false, &handle)) {\n    LOG(ERROR) << \"StartProxyConfigUtil failed to start \" << command.binary;\n    BrowserList::GetLastActive()->\n        OpenURL(GURL(kLinuxProxyConfigUrl), GURL(), NEW_FOREGROUND_TAB,\n                PageTransition::LINK);\n    return;\n  }\n  ProcessWatcher::EnsureProcessGetsReaped(handle);\n}\n\nvoid AdvancedOptionsUtilities::ShowNetworkProxySettings(\n      TabContents* tab_contents) {\n  scoped_ptr<base::Environment> env(base::Environment::Create());\n\n  ProxyConfigCommand command;\n  bool found_command = false;\n  switch (base::GetDesktopEnvironment(env.get())) {\n    case base::DESKTOP_ENVIRONMENT_GNOME: {\n      size_t index;\n      ProxyConfigCommand commands[2];\n      commands[0].argv = kGNOMEProxyConfigCommand;\n      commands[1].argv = kOldGNOMEProxyConfigCommand;\n      found_command = SearchPATH(commands, 2, &index);\n      if (found_command)\n        command = commands[index];\n      break;\n    }\n\n    case base::DESKTOP_ENVIRONMENT_KDE3:\n      command.argv = kKDE3ProxyConfigCommand;\n      found_command = SearchPATH(&command, 1, NULL);\n      break;\n\n    case base::DESKTOP_ENVIRONMENT_KDE4:\n      command.argv = kKDE4ProxyConfigCommand;\n      found_command = SearchPATH(&command, 1, NULL);\n      break;\n\n    case base::DESKTOP_ENVIRONMENT_XFCE:\n    case base::DESKTOP_ENVIRONMENT_OTHER:\n      break;\n  }\n\n  if (found_command) {\n    StartProxyConfigUtil(command);\n  } else {\n    const char* name = base::GetDesktopEnvironmentName(env.get());\n    if (name)\n      LOG(ERROR) << \"Could not find \" << name << \" network settings in $PATH\";\n    tab_contents->OpenURL(GURL(kLinuxProxyConfigUrl), GURL(),\n                          NEW_FOREGROUND_TAB, PageTransition::LINK);\n  }\n}\n\nvoid AdvancedOptionsUtilities::ShowManageSSLCertificates(\n      TabContents* tab_contents) {\n  tab_contents->OpenURL(GURL(kLinuxCertificatesConfigUrl), GURL(),\n                        NEW_WINDOW, PageTransition::LINK);\n}\n\n#endif  \/\/ !defined(OS_CHROMEOS)\n<commit_msg>dom-ui options: Invoke Linux certs webpage in a new tab instead of a new 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#if !defined(OS_CHROMEOS)\n\n#include \"chrome\/browser\/dom_ui\/advanced_options_utils.h\"\n\n#include \"app\/gtk_signal.h\"\n#include \"app\/gtk_util.h\"\n#include \"base\/file_util.h\"\n#include \"base\/environment.h\"\n#include \"base\/process_util.h\"\n#include \"base\/string_tokenizer.h\"\n#include \"base\/xdg_util.h\"\n#include \"chrome\/browser\/browser_list.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/common\/process_watcher.h\"\n\n\/\/ Command used to configure GNOME proxy settings. The command was renamed\n\/\/ in January 2009, so both are used to work on both old and new systems.\nconst char* kOldGNOMEProxyConfigCommand[] = {\"gnome-network-preferences\", NULL};\nconst char* kGNOMEProxyConfigCommand[] = {\"gnome-network-properties\", NULL};\n\/\/ KDE3 and KDE4 are only slightly different, but incompatible. Go figure.\nconst char* kKDE3ProxyConfigCommand[] = {\"kcmshell\", \"proxy\", NULL};\nconst char* kKDE4ProxyConfigCommand[] = {\"kcmshell4\", \"proxy\", NULL};\n\n\/\/ The URL for Linux proxy configuration help when not running under a\n\/\/ supported desktop environment.\nconst char kLinuxProxyConfigUrl[] = \"about:linux-proxy-config\";\n\n\/\/ The URL for Linux ssl certificate configuration help.\nconst char* const kLinuxCertificatesConfigUrl =\n    \"http:\/\/code.google.com\/p\/chromium\/wiki\/LinuxCertManagement\";\n\n\nstruct ProxyConfigCommand {\n  std::string binary;\n  const char** argv;\n};\n\nstatic bool SearchPATH(ProxyConfigCommand* commands, size_t ncommands,\n                       size_t* index) {\n  const char* path = getenv(\"PATH\");\n  if (!path)\n    return false;\n  FilePath bin_path;\n  CStringTokenizer tk(path, path + strlen(path), \":\");\n  \/\/ Search $PATH looking for the commands in order.\n  while (tk.GetNext()) {\n    for (size_t i = 0; i < ncommands; i++) {\n      bin_path = FilePath(tk.token()).Append(commands[i].argv[0]);\n      if (file_util::PathExists(bin_path)) {\n        commands[i].binary = bin_path.value();\n        if (index)\n          *index = i;\n        return true;\n      }\n    }\n  }\n  \/\/ Did not find any of the binaries in $PATH.\n  return false;\n}\n\nstatic void StartProxyConfigUtil(const ProxyConfigCommand& command) {\n  std::vector<std::string> argv;\n  argv.push_back(command.binary);\n  for (size_t i = 1; command.argv[i]; i++)\n    argv.push_back(command.argv[i]);\n  base::file_handle_mapping_vector no_files;\n  base::ProcessHandle handle;\n  if (!base::LaunchApp(argv, no_files, false, &handle)) {\n    LOG(ERROR) << \"StartProxyConfigUtil failed to start \" << command.binary;\n    BrowserList::GetLastActive()->\n        OpenURL(GURL(kLinuxProxyConfigUrl), GURL(), NEW_FOREGROUND_TAB,\n                PageTransition::LINK);\n    return;\n  }\n  ProcessWatcher::EnsureProcessGetsReaped(handle);\n}\n\nvoid AdvancedOptionsUtilities::ShowNetworkProxySettings(\n      TabContents* tab_contents) {\n  scoped_ptr<base::Environment> env(base::Environment::Create());\n\n  ProxyConfigCommand command;\n  bool found_command = false;\n  switch (base::GetDesktopEnvironment(env.get())) {\n    case base::DESKTOP_ENVIRONMENT_GNOME: {\n      size_t index;\n      ProxyConfigCommand commands[2];\n      commands[0].argv = kGNOMEProxyConfigCommand;\n      commands[1].argv = kOldGNOMEProxyConfigCommand;\n      found_command = SearchPATH(commands, 2, &index);\n      if (found_command)\n        command = commands[index];\n      break;\n    }\n\n    case base::DESKTOP_ENVIRONMENT_KDE3:\n      command.argv = kKDE3ProxyConfigCommand;\n      found_command = SearchPATH(&command, 1, NULL);\n      break;\n\n    case base::DESKTOP_ENVIRONMENT_KDE4:\n      command.argv = kKDE4ProxyConfigCommand;\n      found_command = SearchPATH(&command, 1, NULL);\n      break;\n\n    case base::DESKTOP_ENVIRONMENT_XFCE:\n    case base::DESKTOP_ENVIRONMENT_OTHER:\n      break;\n  }\n\n  if (found_command) {\n    StartProxyConfigUtil(command);\n  } else {\n    const char* name = base::GetDesktopEnvironmentName(env.get());\n    if (name)\n      LOG(ERROR) << \"Could not find \" << name << \" network settings in $PATH\";\n    tab_contents->OpenURL(GURL(kLinuxProxyConfigUrl), GURL(),\n                          NEW_FOREGROUND_TAB, PageTransition::LINK);\n  }\n}\n\nvoid AdvancedOptionsUtilities::ShowManageSSLCertificates(\n      TabContents* tab_contents) {\n  tab_contents->OpenURL(GURL(kLinuxCertificatesConfigUrl), GURL(),\n                        NEW_FOREGROUND_TAB, PageTransition::LINK);\n}\n\n#endif  \/\/ !defined(OS_CHROMEOS)\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/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\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest, 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#if defined(OS_LINUX) || defined(OS_MACOSX)\n\/\/ Flakily times out: http:\/\/crbug.com\/78802\n#define MAYBE_NavigationRace DISABLED_NavigationRace\n#else\n#define MAYBE_NavigationRace NavigationRace\n#endif\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest, MAYBE_NavigationRace) {\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  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>Disable ExecuteScriptApiTest.ExecuteScriptFileAfterClose on OS_CHROMEOS. It crashes occasionally.<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\n#if defined(OS_LINUX) || defined(OS_MACOSX)\n\/\/ Flakily times out: http:\/\/crbug.com\/78802\n#define MAYBE_NavigationRace DISABLED_NavigationRace\n#else\n#define MAYBE_NavigationRace NavigationRace\n#endif\nIN_PROC_BROWSER_TEST_F(ExecuteScriptApiTest, MAYBE_NavigationRace) {\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  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>\/\/ 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\/extension_apitest.h\"\n\nIN_PROC_BROWSER_TEST_F(ExtensionApiTest, ExecuteScript) {\n  host_resolver()->AddRule(\"a.com\", \"127.0.0.1\");\n  host_resolver()->AddRule(\"b.com\", \"127.0.0.1\");\n  StartHTTPServer();\n\n  ASSERT_TRUE(RunExtensionTest(\"executescript\")) << message_;\n  ASSERT_TRUE(RunExtensionTest(\"executescript_in_frame\")) << message_;\n}\n<commit_msg>Marking the ExtensionApiTest.ExecuteScript test as flaky as it failed for no apparent reason on the vista dbg builder. <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\/extension_apitest.h\"\n\n\/\/ This test failed at times on the Vista dbg builder and has been marked as\n\/\/ flaky for now. Bug http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=28630\nIN_PROC_BROWSER_TEST_F(ExtensionApiTest, FLAKY_ExecuteScript) {\n  host_resolver()->AddRule(\"a.com\", \"127.0.0.1\");\n  host_resolver()->AddRule(\"b.com\", \"127.0.0.1\");\n  StartHTTPServer();\n\n  ASSERT_TRUE(RunExtensionTest(\"executescript\")) << message_;\n  ASSERT_TRUE(RunExtensionTest(\"executescript_in_frame\")) << message_;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/browser_about_handler.h\"\n#include \"chrome\/browser\/browser_url_handler.h\"\n#include \"chrome\/browser\/dom_ui\/debugger_ui.h\"\n#include \"chrome\/browser\/dom_ui\/new_tab_ui.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/browser\/renderer_host\/render_process_host.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents_factory.h\"\n#include \"chrome\/browser\/tab_contents\/web_contents.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"net\/base\/net_util.h\"\n\n#if defined(OS_WIN)\n\/\/ TODO(port): port these headers to posix.\n#elif defined(OS_POSIX)\n#include \"chrome\/common\/temp_scaffolding_stubs.h\"\n#endif\n\ntypedef std::map<TabContentsType, TabContentsFactory*> TabContentsFactoryMap;\nstatic TabContentsFactoryMap* g_extra_types;  \/\/ Only allocated if needed.\n\n\/\/ static\nTabContentsType TabContentsFactory::NextUnusedType() {\n  int type = static_cast<int>(TAB_CONTENTS_NUM_TYPES);\n  if (g_extra_types) {\n    for (TabContentsFactoryMap::iterator i = g_extra_types->begin();\n         i != g_extra_types->end(); ++i) {\n      type = std::max(type, static_cast<int>(i->first));\n    }\n  }\n  return static_cast<TabContentsType>(type + 1);\n}\n\n\/\/ static\nTabContents* TabContents::CreateWithType(TabContentsType type,\n                                         Profile* profile,\n                                         SiteInstance* instance) {\n  TabContents* contents = NULL;\n\n  switch (type) {\n    case TAB_CONTENTS_WEB:\n      contents = new WebContents(profile, instance, MSG_ROUTING_NONE, NULL);\n      break;\n    default:\n      if (g_extra_types) {\n        TabContentsFactoryMap::const_iterator it = g_extra_types->find(type);\n        if (it != g_extra_types->end()) {\n          contents = it->second->CreateInstance();\n          break;\n        }\n      }\n      NOTREACHED() << \"Don't know how to create tab contents of type \" << type;\n      contents = NULL;\n  }\n\n  return contents;\n}\n\n\/\/ static\nTabContentsType TabContents::TypeForURL(GURL* url) {\n  \/\/ The BrowserURLHandler::HandleBrowserURL call should just be inside the\n  \/\/ NavigationController once this class is deleted.\n  DCHECK(url);\n  if (g_extra_types) {\n    TabContentsFactoryMap::const_iterator it = g_extra_types->begin();\n    for (; it != g_extra_types->end(); ++it) {\n      if (it->second->CanHandleURL(*url))\n        return it->first;\n    }\n  }\n\n\/\/ TODO(port): port the rest of this function.\n#if defined(OS_WIN)\n  \/\/ Try to handle as a browser URL. If successful, |url| will end up\n  \/\/ containing the real url being loaded (browser url's are just an alias).\n  TabContentsType type(TAB_CONTENTS_UNKNOWN_TYPE);\n  if (BrowserURLHandler::HandleBrowserURL(url, &type))\n    return type;\n\n#elif defined(OS_POSIX)\n  TabContentsType type(TAB_CONTENTS_UNKNOWN_TYPE);\n  if (BrowserURLHandler::HandleBrowserURL(url, &type)) {\n    return type;\n  }\n  NOTIMPLEMENTED();\n#endif\n\n  \/\/ NOTE: Even the empty string can be loaded by a WebContents.\n  return TAB_CONTENTS_WEB;\n}\n\n\/\/ static\nTabContentsFactory* TabContents::RegisterFactory(TabContentsType type,\n                                                 TabContentsFactory* factory) {\n  if (!g_extra_types)\n    g_extra_types = new TabContentsFactoryMap;\n\n  TabContentsFactory* prev_factory = NULL;\n  TabContentsFactoryMap::const_iterator prev = g_extra_types->find(type);\n  if (prev != g_extra_types->end())\n    prev_factory = prev->second;\n\n  if (factory) {\n    g_extra_types->insert(TabContentsFactoryMap::value_type(type, factory));\n  } else {\n    g_extra_types->erase(type);\n    if (g_extra_types->empty()) {\n      delete g_extra_types;\n      g_extra_types = NULL;\n    }\n  }\n\n  return prev_factory;\n}\n<commit_msg>posix: the code path on either side of this ifdef is identical.<commit_after>\/\/ Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/browser_about_handler.h\"\n#include \"chrome\/browser\/browser_url_handler.h\"\n#include \"chrome\/browser\/dom_ui\/debugger_ui.h\"\n#include \"chrome\/browser\/dom_ui\/new_tab_ui.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/browser\/renderer_host\/render_process_host.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents_factory.h\"\n#include \"chrome\/browser\/tab_contents\/web_contents.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"net\/base\/net_util.h\"\n\n#if defined(OS_WIN)\n\/\/ TODO(port): port these headers to posix.\n#elif defined(OS_POSIX)\n#include \"chrome\/common\/temp_scaffolding_stubs.h\"\n#endif\n\ntypedef std::map<TabContentsType, TabContentsFactory*> TabContentsFactoryMap;\nstatic TabContentsFactoryMap* g_extra_types;  \/\/ Only allocated if needed.\n\n\/\/ static\nTabContentsType TabContentsFactory::NextUnusedType() {\n  int type = static_cast<int>(TAB_CONTENTS_NUM_TYPES);\n  if (g_extra_types) {\n    for (TabContentsFactoryMap::iterator i = g_extra_types->begin();\n         i != g_extra_types->end(); ++i) {\n      type = std::max(type, static_cast<int>(i->first));\n    }\n  }\n  return static_cast<TabContentsType>(type + 1);\n}\n\n\/\/ static\nTabContents* TabContents::CreateWithType(TabContentsType type,\n                                         Profile* profile,\n                                         SiteInstance* instance) {\n  TabContents* contents = NULL;\n\n  switch (type) {\n    case TAB_CONTENTS_WEB:\n      contents = new WebContents(profile, instance, MSG_ROUTING_NONE, NULL);\n      break;\n    default:\n      if (g_extra_types) {\n        TabContentsFactoryMap::const_iterator it = g_extra_types->find(type);\n        if (it != g_extra_types->end()) {\n          contents = it->second->CreateInstance();\n          break;\n        }\n      }\n      NOTREACHED() << \"Don't know how to create tab contents of type \" << type;\n      contents = NULL;\n  }\n\n  return contents;\n}\n\n\/\/ static\nTabContentsType TabContents::TypeForURL(GURL* url) {\n  \/\/ The BrowserURLHandler::HandleBrowserURL call should just be inside the\n  \/\/ NavigationController once this class is deleted.\n  DCHECK(url);\n  if (g_extra_types) {\n    TabContentsFactoryMap::const_iterator it = g_extra_types->begin();\n    for (; it != g_extra_types->end(); ++it) {\n      if (it->second->CanHandleURL(*url))\n        return it->first;\n    }\n  }\n\n  \/\/ Try to handle as a browser URL. If successful, |url| will end up\n  \/\/ containing the real url being loaded (browser url's are just an alias).\n  TabContentsType type(TAB_CONTENTS_UNKNOWN_TYPE);\n  if (BrowserURLHandler::HandleBrowserURL(url, &type))\n    return type;\n\n  \/\/ NOTE: Even the empty string can be loaded by a WebContents.\n  return TAB_CONTENTS_WEB;\n}\n\n\/\/ static\nTabContentsFactory* TabContents::RegisterFactory(TabContentsType type,\n                                                 TabContentsFactory* factory) {\n  if (!g_extra_types)\n    g_extra_types = new TabContentsFactoryMap;\n\n  TabContentsFactory* prev_factory = NULL;\n  TabContentsFactoryMap::const_iterator prev = g_extra_types->find(type);\n  if (prev != g_extra_types->end())\n    prev_factory = prev->second;\n\n  if (factory) {\n    g_extra_types->insert(TabContentsFactoryMap::value_type(type, factory));\n  } else {\n    g_extra_types->erase(type);\n    if (g_extra_types->empty()) {\n      delete g_extra_types;\n      g_extra_types = NULL;\n    }\n  }\n\n  return prev_factory;\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#ifdef CHROME_PERSONALIZATION\n\n#include \"chrome\/browser\/views\/user_data_page_view.h\"\n\n#include \"app\/l10n_util.h\"\n#include \"base\/path_service.h\"\n#include \"chrome\/browser\/browser_process.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/browser\/profile_manager.h\"\n#include \"chrome\/browser\/sync\/auth_error_state.h\"\n#include \"chrome\/browser\/sync\/personalization_strings.h\"\n#include \"chrome\/browser\/sync\/profile_sync_service.h\"\n#include \"chrome\/browser\/sync\/sync_status_ui_helper.h\"\n#include \"chrome\/browser\/views\/clear_browsing_data.h\"\n#include \"chrome\/browser\/views\/importer_view.h\"\n#include \"chrome\/browser\/views\/options\/options_group_view.h\"\n#include \"chrome\/browser\/views\/options\/options_page_view.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/pref_member.h\"\n#include \"chrome\/common\/pref_service.h\"\n#include \"grit\/generated_resources.h\"\n#include \"third_party\/skia\/include\/core\/SkColor.h\"\n#include \"views\/background.h\"\n#include \"views\/controls\/button\/native_button.h\"\n#include \"views\/controls\/label.h\"\n#include \"views\/controls\/link.h\"\n#include \"views\/controls\/table\/table_view.h\"\n#include \"views\/grid_layout.h\"\n#include \"views\/standard_layout.h\"\n#include \"views\/view.h\"\n#include \"views\/widget\/widget.h\"\n#include \"views\/window\/window.h\"\n\n\/\/ Background color for the status label when it's showing an error.\nstatic const SkColor kSyncLabelErrorBgColor = SkColorSetRGB(0xff, 0x9a, 0x9a);\n\nstatic views::Background* CreateErrorBackground() {\n  return views::Background::CreateSolidBackground(kSyncLabelErrorBgColor);\n}\n\nUserDataPageView::UserDataPageView(Profile* profile)\n    : OptionsPageView(profile),\n      sync_group_(NULL),\n      sync_status_label_(NULL),\n      sync_action_link_(NULL),\n      sync_start_stop_button_(NULL),\n      sync_service_(profile->GetProfilePersonalization()->sync_service()) {\n  DCHECK(sync_service_);\n  sync_service_->AddObserver(this);\n}\n\nUserDataPageView::~UserDataPageView() {\n  sync_service_->RemoveObserver(this);\n}\n\nvoid UserDataPageView::ButtonPressed(views::Button* sender) {\n  DCHECK(sender == sync_start_stop_button_);\n  if (!sync_service_->IsSyncEnabledByUser()) {\n    \/\/ Sync has not been enabled yet.\n    sync_service_->EnableForUser();\n  } else {\n    sync_service_->DisableForUser();\n  }\n}\n\nvoid UserDataPageView::LinkActivated(views::Link* source, int event_flags) {\n  DCHECK_EQ(source, sync_action_link_);\n  sync_service_->ShowLoginDialog();\n}\n\nvoid UserDataPageView::InitControlLayout() {\n  using views::GridLayout;\n  using views::ColumnSet;\n\n  GridLayout* layout = new GridLayout(this);\n  layout->SetInsets(5, 5, 5, 5);\n  SetLayoutManager(layout);\n\n  const int single_column_view_set_id = 0;\n  ColumnSet* column_set = layout->AddColumnSet(single_column_view_set_id);\n  column_set->AddColumn(GridLayout::FILL, GridLayout::FILL, 1,\n                        GridLayout::USE_PREF, 0, 0);\n  layout->StartRow(0, single_column_view_set_id);\n  InitSyncGroup();\n  layout->AddView(sync_group_);\n  layout->AddPaddingRow(0, kRelatedControlVerticalSpacing);\n}\n\nvoid UserDataPageView::NotifyPrefChanged(const std::wstring* pref_name) {\n}\n\nvoid UserDataPageView::OnStateChanged() {\n  \/\/ If the UI controls are not yet initialized, then don't do anything. This\n  \/\/ can happen if the Options dialog is up, but the User Data tab is not yet\n  \/\/ clicked.\n  if (IsInitialized())\n    Layout();\n}\n\nvoid UserDataPageView::HighlightGroup(OptionsGroup highlight_group) {\n}\n\nvoid UserDataPageView::Layout() {\n  UpdateControls();\n  \/\/ We need to Layout twice - once to get the width of the contents box...\n  View::Layout();\n  int sync_group_width = sync_group_->GetContentsWidth();\n  sync_status_label_->SetBounds(0, 0, sync_group_width, 0);\n  \/\/ ... and twice to get the height of multi-line items correct.\n  View::Layout();\n}\n\nvoid UserDataPageView::InitSyncGroup() {\n  sync_status_label_ = new views::Label;\n  sync_status_label_->SetMultiLine(true);\n  sync_status_label_->SetHorizontalAlignment(views::Label::ALIGN_LEFT);\n\n  sync_action_link_ = new views::Link();\n  sync_action_link_->set_collapse_when_hidden(true);\n  sync_action_link_->SetController(this);\n\n  sync_start_stop_button_ = new views::NativeButton(this, std::wstring());\n\n  using views::GridLayout;\n  using views::ColumnSet;\n\n  views::View* contents = new views::View;\n  GridLayout* layout = new GridLayout(contents);\n  contents->SetLayoutManager(layout);\n\n  const int single_column_view_set_id = 0;\n  ColumnSet* column_set = layout->AddColumnSet(single_column_view_set_id);\n  column_set->AddColumn(GridLayout::LEADING, GridLayout::CENTER, 1,\n                        GridLayout::USE_PREF, 0, 0);\n\n  \/\/ Currently we add the status label and the link in two rows. This is not\n  \/\/ the same as the mocks. If we add label and the link in two columns to make\n  \/\/ it look like the mocks then we can have a UI layout issue. If the label\n  \/\/ has text that fits in one line, the appearance is fine. But if the label\n  \/\/ has text with multiple lines, the appearance can be a bit detached. See\n  \/\/ bug 1648522 for details.\n  \/\/ TODO(munjal): Change the layout after we fix bug 1648522.\n  layout->StartRow(0, single_column_view_set_id);\n  layout->AddView(sync_status_label_);\n  layout->StartRow(0, single_column_view_set_id);\n  layout->AddView(sync_action_link_);\n  layout->AddPaddingRow(0, kRelatedControlVerticalSpacing);\n  layout->StartRow(0, single_column_view_set_id);\n  layout->AddView(sync_start_stop_button_);\n\n  sync_group_ = new OptionsGroupView(contents,\n                                     kSyncGroupName,\n                                     std::wstring(),\n                                     true);\n}\n\nvoid UserDataPageView::UpdateControls() {\n  std::wstring status_label;\n  std::wstring link_label;\n  std::wstring button_label;\n  bool sync_enabled = sync_service_->IsSyncEnabledByUser();\n  bool status_has_error = SyncStatusUIHelper::GetLabels(sync_service_,\n      &status_label, &link_label) == SyncStatusUIHelper::SYNC_ERROR;\n  button_label = sync_enabled ? kStopSyncButtonLabel :\n                 sync_service_->SetupInProgress() ? UTF8ToWide(kSettingUpText)\n                 : kStartSyncButtonLabel;\n\n  sync_status_label_->SetText(status_label);\n  sync_start_stop_button_->SetEnabled(!sync_service_->WizardIsVisible());\n  sync_start_stop_button_->SetLabel(button_label);\n  sync_action_link_->SetText(link_label);\n  sync_action_link_->SetVisible(!link_label.empty());\n  if (status_has_error) {\n    sync_status_label_->set_background(CreateErrorBackground());\n    sync_action_link_->set_background(CreateErrorBackground());\n  } else {\n    sync_status_label_->set_background(NULL);\n    sync_action_link_->set_background(NULL);\n  }\n}\n\n#endif  \/\/ CHROME_PERSONALIZATION\n<commit_msg>Fix include path for header file to fix sync build. I'll hold off committing until Idan lets me know I didn't butcher anything else, too :) Review URL: http:\/\/codereview.chromium.org\/165004<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#ifdef CHROME_PERSONALIZATION\n\n#include \"chrome\/browser\/views\/options\/user_data_page_view.h\"\n\n#include \"app\/l10n_util.h\"\n#include \"base\/path_service.h\"\n#include \"chrome\/browser\/browser_process.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/browser\/profile_manager.h\"\n#include \"chrome\/browser\/sync\/auth_error_state.h\"\n#include \"chrome\/browser\/sync\/personalization_strings.h\"\n#include \"chrome\/browser\/sync\/profile_sync_service.h\"\n#include \"chrome\/browser\/sync\/sync_status_ui_helper.h\"\n#include \"chrome\/browser\/views\/clear_browsing_data.h\"\n#include \"chrome\/browser\/views\/importer_view.h\"\n#include \"chrome\/browser\/views\/options\/options_group_view.h\"\n#include \"chrome\/browser\/views\/options\/options_page_view.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/pref_member.h\"\n#include \"chrome\/common\/pref_service.h\"\n#include \"grit\/generated_resources.h\"\n#include \"third_party\/skia\/include\/core\/SkColor.h\"\n#include \"views\/background.h\"\n#include \"views\/controls\/button\/native_button.h\"\n#include \"views\/controls\/label.h\"\n#include \"views\/controls\/link.h\"\n#include \"views\/controls\/table\/table_view.h\"\n#include \"views\/grid_layout.h\"\n#include \"views\/standard_layout.h\"\n#include \"views\/view.h\"\n#include \"views\/widget\/widget.h\"\n#include \"views\/window\/window.h\"\n\n\/\/ Background color for the status label when it's showing an error.\nstatic const SkColor kSyncLabelErrorBgColor = SkColorSetRGB(0xff, 0x9a, 0x9a);\n\nstatic views::Background* CreateErrorBackground() {\n  return views::Background::CreateSolidBackground(kSyncLabelErrorBgColor);\n}\n\nUserDataPageView::UserDataPageView(Profile* profile)\n    : OptionsPageView(profile),\n      sync_group_(NULL),\n      sync_status_label_(NULL),\n      sync_action_link_(NULL),\n      sync_start_stop_button_(NULL),\n      sync_service_(profile->GetProfilePersonalization()->sync_service()) {\n  DCHECK(sync_service_);\n  sync_service_->AddObserver(this);\n}\n\nUserDataPageView::~UserDataPageView() {\n  sync_service_->RemoveObserver(this);\n}\n\nvoid UserDataPageView::ButtonPressed(views::Button* sender) {\n  DCHECK(sender == sync_start_stop_button_);\n  if (!sync_service_->IsSyncEnabledByUser()) {\n    \/\/ Sync has not been enabled yet.\n    sync_service_->EnableForUser();\n  } else {\n    sync_service_->DisableForUser();\n  }\n}\n\nvoid UserDataPageView::LinkActivated(views::Link* source, int event_flags) {\n  DCHECK_EQ(source, sync_action_link_);\n  sync_service_->ShowLoginDialog();\n}\n\nvoid UserDataPageView::InitControlLayout() {\n  using views::GridLayout;\n  using views::ColumnSet;\n\n  GridLayout* layout = new GridLayout(this);\n  layout->SetInsets(5, 5, 5, 5);\n  SetLayoutManager(layout);\n\n  const int single_column_view_set_id = 0;\n  ColumnSet* column_set = layout->AddColumnSet(single_column_view_set_id);\n  column_set->AddColumn(GridLayout::FILL, GridLayout::FILL, 1,\n                        GridLayout::USE_PREF, 0, 0);\n  layout->StartRow(0, single_column_view_set_id);\n  InitSyncGroup();\n  layout->AddView(sync_group_);\n  layout->AddPaddingRow(0, kRelatedControlVerticalSpacing);\n}\n\nvoid UserDataPageView::NotifyPrefChanged(const std::wstring* pref_name) {\n}\n\nvoid UserDataPageView::OnStateChanged() {\n  \/\/ If the UI controls are not yet initialized, then don't do anything. This\n  \/\/ can happen if the Options dialog is up, but the User Data tab is not yet\n  \/\/ clicked.\n  if (IsInitialized())\n    Layout();\n}\n\nvoid UserDataPageView::HighlightGroup(OptionsGroup highlight_group) {\n}\n\nvoid UserDataPageView::Layout() {\n  UpdateControls();\n  \/\/ We need to Layout twice - once to get the width of the contents box...\n  View::Layout();\n  int sync_group_width = sync_group_->GetContentsWidth();\n  sync_status_label_->SetBounds(0, 0, sync_group_width, 0);\n  \/\/ ... and twice to get the height of multi-line items correct.\n  View::Layout();\n}\n\nvoid UserDataPageView::InitSyncGroup() {\n  sync_status_label_ = new views::Label;\n  sync_status_label_->SetMultiLine(true);\n  sync_status_label_->SetHorizontalAlignment(views::Label::ALIGN_LEFT);\n\n  sync_action_link_ = new views::Link();\n  sync_action_link_->set_collapse_when_hidden(true);\n  sync_action_link_->SetController(this);\n\n  sync_start_stop_button_ = new views::NativeButton(this, std::wstring());\n\n  using views::GridLayout;\n  using views::ColumnSet;\n\n  views::View* contents = new views::View;\n  GridLayout* layout = new GridLayout(contents);\n  contents->SetLayoutManager(layout);\n\n  const int single_column_view_set_id = 0;\n  ColumnSet* column_set = layout->AddColumnSet(single_column_view_set_id);\n  column_set->AddColumn(GridLayout::LEADING, GridLayout::CENTER, 1,\n                        GridLayout::USE_PREF, 0, 0);\n\n  \/\/ Currently we add the status label and the link in two rows. This is not\n  \/\/ the same as the mocks. If we add label and the link in two columns to make\n  \/\/ it look like the mocks then we can have a UI layout issue. If the label\n  \/\/ has text that fits in one line, the appearance is fine. But if the label\n  \/\/ has text with multiple lines, the appearance can be a bit detached. See\n  \/\/ bug 1648522 for details.\n  \/\/ TODO(munjal): Change the layout after we fix bug 1648522.\n  layout->StartRow(0, single_column_view_set_id);\n  layout->AddView(sync_status_label_);\n  layout->StartRow(0, single_column_view_set_id);\n  layout->AddView(sync_action_link_);\n  layout->AddPaddingRow(0, kRelatedControlVerticalSpacing);\n  layout->StartRow(0, single_column_view_set_id);\n  layout->AddView(sync_start_stop_button_);\n\n  sync_group_ = new OptionsGroupView(contents,\n                                     kSyncGroupName,\n                                     std::wstring(),\n                                     true);\n}\n\nvoid UserDataPageView::UpdateControls() {\n  std::wstring status_label;\n  std::wstring link_label;\n  std::wstring button_label;\n  bool sync_enabled = sync_service_->IsSyncEnabledByUser();\n  bool status_has_error = SyncStatusUIHelper::GetLabels(sync_service_,\n      &status_label, &link_label) == SyncStatusUIHelper::SYNC_ERROR;\n  button_label = sync_enabled ? kStopSyncButtonLabel :\n                 sync_service_->SetupInProgress() ? UTF8ToWide(kSettingUpText)\n                 : kStartSyncButtonLabel;\n\n  sync_status_label_->SetText(status_label);\n  sync_start_stop_button_->SetEnabled(!sync_service_->WizardIsVisible());\n  sync_start_stop_button_->SetLabel(button_label);\n  sync_action_link_->SetText(link_label);\n  sync_action_link_->SetVisible(!link_label.empty());\n  if (status_has_error) {\n    sync_status_label_->set_background(CreateErrorBackground());\n    sync_action_link_->set_background(CreateErrorBackground());\n  } else {\n    sync_status_label_->set_background(NULL);\n    sync_action_link_->set_background(NULL);\n  }\n}\n\n#endif  \/\/ CHROME_PERSONALIZATION\n<|endoftext|>"}
{"text":"<commit_before>#include \"midiController.h\"\n\nmidiController::midiController(){\n    \n}\n\nmidiController::~midiController(){\n    \n}\n\nvoid midiController::setup(){\n    ofAddListener(ofEvents().update, this, &midiController::update);\n\/\/    sequencer.setup(6, 4);\n\/\/    sequencer.setBpm(120, 8);\n\/\/    sequencer.setDiscrete(false);\n\/\/    sequencer.setRange(0.0, 127.0);\n\/\/    sequencer.setPosition(ofGetWidth()-300, ofGetHeight()-200, 300, 200);\n\/\/    sequencer.setMouseActive(false);\n\/\/    ofAddListener(sequencer.sequencerEvent, this, &midiController::sequencerStep);\n\/\/    sequencer.start();\n    midiOut.listPorts();\n    midiOut.openPort(\"Network Session 1\");\n}\n\nvoid midiController::updateSequencerStep(int row, float value){\n    int col = sequencer.getColumn();\n    triggerMidiNote(col, row+12, value);\n    \/\/sequencer.setValue(row, col, value);\n}\n\nvoid midiController::clear(){\n\/\/    for(int i = 0; i < sequencer.getNumberColumns(); i++){\n\/\/        for(int j = 0; j < sequencer.getNumberRows(); j++){\n\/\/            sequencer.setValue(j, i, 0);\n\/\/        }\n\/\/    }\n}\n\nvoid midiController::sequencerStep(vector<float> &column) {\n\/\/    int count = 12;\n\/\/    for(int i = 0; i < column.size(); i++){\n\/\/        triggerMidiNote(i, count++, column[i]);\n\/\/    }\n}\n\nvoid midiController::update(ofEventArgs & args){\n\/\/    \/\/if(ofGetFrameNum()%10 == 0){\n\/\/        for(int i = 0; i < sequencer.getNumberColumns(); i++){\n\/\/            for(int j = 0; j < sequencer.getNumberRows(); j++){\n\/\/                sequencer.setValue(j, i, sequencer.getValue(j, i)*0.99);\n\/\/            }\n\/\/        }\n\/\/    \/\/}\n}\n\nvoid midiController::setBMP(int bpm){\n\/\/    sequencer.stop();\n\/\/    sequencer.setBpm(bpm);\n\/\/    sequencer.start();\n}\n\nvoid midiController::draw(){\n\/\/    sequencer.draw();\n}\n\nvoid midiController::triggerMidiNote(int channel, int note, int velocity){\n    midiOut.sendNoteOn(channel, note, velocity);\n    ofLog()<<\n}\n<commit_msg>commenting out sequencer out<commit_after>#include \"midiController.h\"\n\nmidiController::midiController(){\n    \n}\n\nmidiController::~midiController(){\n    \n}\n\nvoid midiController::setup(){\n    ofAddListener(ofEvents().update, this, &midiController::update);\n\/\/    sequencer.setup(6, 4);\n\/\/    sequencer.setBpm(120, 8);\n\/\/    sequencer.setDiscrete(false);\n\/\/    sequencer.setRange(0.0, 127.0);\n\/\/    sequencer.setPosition(ofGetWidth()-300, ofGetHeight()-200, 300, 200);\n\/\/    sequencer.setMouseActive(false);\n\/\/    ofAddListener(sequencer.sequencerEvent, this, &midiController::sequencerStep);\n\/\/    sequencer.start();\n    midiOut.listPorts();\n    midiOut.openPort(\"Network Session 1\");\n}\n\nvoid midiController::updateSequencerStep(int row, float value){\n    int col = sequencer.getColumn();\n    triggerMidiNote(col, row+12, value);\n    \/\/sequencer.setValue(row, col, value);\n}\n\nvoid midiController::clear(){\n\/\/    for(int i = 0; i < sequencer.getNumberColumns(); i++){\n\/\/        for(int j = 0; j < sequencer.getNumberRows(); j++){\n\/\/            sequencer.setValue(j, i, 0);\n\/\/        }\n\/\/    }\n}\n\nvoid midiController::sequencerStep(vector<float> &column) {\n\/\/    int count = 12;\n\/\/    for(int i = 0; i < column.size(); i++){\n\/\/        triggerMidiNote(i, count++, column[i]);\n\/\/    }\n}\n\nvoid midiController::update(ofEventArgs & args){\n\/\/    \/\/if(ofGetFrameNum()%10 == 0){\n\/\/        for(int i = 0; i < sequencer.getNumberColumns(); i++){\n\/\/            for(int j = 0; j < sequencer.getNumberRows(); j++){\n\/\/                sequencer.setValue(j, i, sequencer.getValue(j, i)*0.99);\n\/\/            }\n\/\/        }\n\/\/    \/\/}\n}\n\nvoid midiController::setBMP(int bpm){\n\/\/    sequencer.stop();\n\/\/    sequencer.setBpm(bpm);\n\/\/    sequencer.start();\n}\n\nvoid midiController::draw(){\n\/\/    sequencer.draw();\n}\n\nvoid midiController::triggerMidiNote(int channel, int note, int velocity){\n    midiOut.sendNoteOn(channel, note, velocity);\n    ofLog()<<\"trigger midi\"<<endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*-------------------------------------------------------------------------\n *\n * tuplerecord.cpp\n * file description\n *\n * Copyright(c) 2015, CMU\n *\n * \/peloton\/src\/backend\/logging\/records\/tuplerecord.cpp\n *\n *-------------------------------------------------------------------------\n *\/\n\n#include \"backend\/logging\/records\/tuple_record.h\"\n#include \"backend\/common\/logger.h\"\n#include \"backend\/storage\/tuple.h\"\n\nnamespace peloton {\nnamespace logging {\n\n\/**\n * @brief Serialize given data\n * @return true if we serialize data otherwise false\n *\/\nbool TupleRecord::Serialize(CopySerializeOutput& output){\n  bool status = true;\n  output.Reset();\n\n  \/\/ Serialize the common variables such as database oid, table oid, etc.\n  SerializeHeader(output);\n\n  \/\/ Serialize other parts depends on type\n  switch(GetType()){\n\n    case LOGRECORD_TYPE_ARIES_TUPLE_INSERT:\n    case LOGRECORD_TYPE_ARIES_TUPLE_UPDATE:  {\n      storage::Tuple* tuple = (storage::Tuple*)data;\n      tuple->SerializeTo(output);\n      break;\n    }\n\n    case LOGRECORD_TYPE_ARIES_TUPLE_DELETE:\n      \/\/ Nothing to do here !\n      break;\n\n    case LOGRECORD_TYPE_PELOTON_TUPLE_INSERT:  \n    case LOGRECORD_TYPE_PELOTON_TUPLE_DELETE:  \n    case LOGRECORD_TYPE_PELOTON_TUPLE_UPDATE:\n      \/\/ Nothing to do here !\n      break;\n\n    default:  {\n      LOG_WARN(\"Unsupported TUPLE RECORD TYPE\\n\");\n      status = false;\n      break;\n    }\n  }\n\n  message_length = output.Size();\n  message = (char*)malloc(message_length);\n  memcpy( message, output.Data(), message_length);\n\n  return status;\n}\n\n\/**\n * @brief Serialize LogRecordHeader\n * @param output  \n *\/\nvoid TupleRecord::SerializeHeader(CopySerializeOutput& output){\n\n  \/\/ Record LogRecordType first \n  output.WriteEnumInSingleByte(log_record_type);\n\n  size_t start = output.Position();\n  \/\/ then reserve 4 bytes for the header size\n  output.WriteInt(0);\n\n  output.WriteShort(db_oid);\n  output.WriteShort(table_oid);\n  output.WriteLong(txn_id);\n  output.WriteShort(insert_location.block);\n  output.WriteShort(insert_location.offset);\n  output.WriteShort(delete_location.block);\n  output.WriteShort(delete_location.offset);\n\n  output.WriteIntAt(start, static_cast<int32_t>(output.Position() - start - sizeof(int32_t)));\n}\n\n\/**\n * @brief Deserialize LogRecordHeader\n * @param input  \n *\/\nvoid TupleRecord::DeserializeHeader(CopySerializeInputBE& input) {\n  input.ReadInt();\n  db_oid = (oid_t)(input.ReadShort());\n  assert(db_oid);\n  table_oid = (oid_t)(input.ReadShort());\n  assert(table_oid);\n  txn_id = (txn_id_t)(input.ReadLong());\n  assert(txn_id);\n  insert_location.block = (oid_t)(input.ReadShort());\n  insert_location.offset = (oid_t)(input.ReadShort());\n  delete_location.block = (oid_t)(input.ReadShort());\n  delete_location.offset = (oid_t)(input.ReadShort());\n}\n\n\/\/ Used for peloton logging\nsize_t TupleRecord::GetTupleRecordSize(void){\n  \/\/ log_record_type + header_legnth + db_oid + table_oid + txn_id + insert_location + delete_location \n  return sizeof(char) + sizeof(int) + sizeof(int16_t) + sizeof(int16_t) + sizeof(long) + sizeof(int16_t)*4;\n}\n\n\/\/just for debugging\nvoid TupleRecord::Print(){\n  std::cout << \"#LOG TYPE:\" << LogRecordTypeToString(GetType()) << \"\\n\";\n  std::cout << \" #Db  ID:\" << GetDatabaseOid() << \"\\n\";\n  std::cout << \" #Tb  ID:\" << GetTableId() << \"\\n\";\n  std::cout << \" #Txn ID:\" << GetTransactionId() << \"\\n\";\n  std::cout << \" #Insert Location :\" << GetInsertLocation().block;\n  std::cout << \" \" << GetInsertLocation().offset << \"\\n\";\n  std::cout << \" #Delete Location :\" << GetDeleteLocation().block;\n  std::cout << \" \" << GetDeleteLocation().offset << \"\\n\";\n  std::cout << \"\\n\";\n}\n\n}  \/\/ namespace logging\n}  \/\/ namespace peloton\n<commit_msg>Fix aries logging data type bug.<commit_after>\/*-------------------------------------------------------------------------\n *\n * tuplerecord.cpp\n * file description\n *\n * Copyright(c) 2015, CMU\n *\n * \/peloton\/src\/backend\/logging\/records\/tuplerecord.cpp\n *\n *-------------------------------------------------------------------------\n *\/\n\n#include \"backend\/logging\/records\/tuple_record.h\"\n#include \"backend\/common\/logger.h\"\n#include \"backend\/storage\/tuple.h\"\n\nnamespace peloton {\nnamespace logging {\n\n\/**\n * @brief Serialize given data\n * @return true if we serialize data otherwise false\n *\/\nbool TupleRecord::Serialize(CopySerializeOutput& output){\n  bool status = true;\n  output.Reset();\n\n  \/\/ Serialize the common variables such as database oid, table oid, etc.\n  SerializeHeader(output);\n\n  \/\/ Serialize other parts depends on type\n  switch(GetType()){\n\n    case LOGRECORD_TYPE_ARIES_TUPLE_INSERT:\n    case LOGRECORD_TYPE_ARIES_TUPLE_UPDATE:  {\n      storage::Tuple* tuple = (storage::Tuple*)data;\n      tuple->SerializeTo(output);\n      break;\n    }\n\n    case LOGRECORD_TYPE_ARIES_TUPLE_DELETE:\n      \/\/ Nothing to do here !\n      break;\n\n    case LOGRECORD_TYPE_PELOTON_TUPLE_INSERT:  \n    case LOGRECORD_TYPE_PELOTON_TUPLE_DELETE:  \n    case LOGRECORD_TYPE_PELOTON_TUPLE_UPDATE:\n      \/\/ Nothing to do here !\n      break;\n\n    default:  {\n      LOG_WARN(\"Unsupported TUPLE RECORD TYPE\\n\");\n      status = false;\n      break;\n    }\n  }\n\n  message_length = output.Size();\n  message = (char*)malloc(message_length);\n  memcpy( message, output.Data(), message_length);\n\n  return status;\n}\n\n\/**\n * @brief Serialize LogRecordHeader\n * @param output  \n *\/\nvoid TupleRecord::SerializeHeader(CopySerializeOutput& output){\n\n  \/\/ Record LogRecordType first \n  output.WriteEnumInSingleByte(log_record_type);\n\n  size_t start = output.Position();\n  \/\/ then reserve 4 bytes for the header size\n  output.WriteInt(0);\n\n  output.WriteLong(db_oid);\n  output.WriteLong(table_oid);\n  output.WriteLong(txn_id);\n  output.WriteLong(insert_location.block);\n  output.WriteLong(insert_location.offset);\n  output.WriteLong(delete_location.block);\n  output.WriteLong(delete_location.offset);\n\n  output.WriteIntAt(start, static_cast<int32_t>(output.Position() - start - sizeof(int32_t)));\n}\n\n\/**\n * @brief Deserialize LogRecordHeader\n * @param input  \n *\/\nvoid TupleRecord::DeserializeHeader(CopySerializeInputBE& input) {\n  input.ReadInt();\n  db_oid = (oid_t)(input.ReadLong());\n  assert(db_oid);\n  table_oid = (oid_t)(input.ReadLong());\n  assert(table_oid);\n  txn_id = (txn_id_t)(input.ReadLong());\n  assert(txn_id);\n  insert_location.block = (oid_t)(input.ReadLong());\n  insert_location.offset = (oid_t)(input.ReadLong());\n  delete_location.block = (oid_t)(input.ReadLong());\n  delete_location.offset = (oid_t)(input.ReadLong());\n}\n\n\/\/ Used for peloton logging\nsize_t TupleRecord::GetTupleRecordSize(void){\n  \/\/ log_record_type + header_legnth + db_oid + table_oid + txn_id + insert_location + delete_location \n  return sizeof(char) + sizeof(int) + sizeof(oid_t) + sizeof(oid_t) + sizeof(txn_id_t) + sizeof(oid_t)*2;\n}\n\n\/\/just for debugging\nvoid TupleRecord::Print(){\n  std::cout << \"#LOG TYPE:\" << LogRecordTypeToString(GetType()) << \"\\n\";\n  std::cout << \" #Db  ID:\" << GetDatabaseOid() << \"\\n\";\n  std::cout << \" #Tb  ID:\" << GetTableId() << \"\\n\";\n  std::cout << \" #Txn ID:\" << GetTransactionId() << \"\\n\";\n  std::cout << \" #Insert Location :\" << GetInsertLocation().block;\n  std::cout << \" \" << GetInsertLocation().offset << \"\\n\";\n  std::cout << \" #Delete Location :\" << GetDeleteLocation().block;\n  std::cout << \" \" << GetDeleteLocation().offset << \"\\n\";\n  std::cout << \"\\n\";\n}\n\n}  \/\/ namespace logging\n}  \/\/ namespace peloton\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright (c) 2012 Stanford University\n * Copyright (c) 2014 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 <getopt.h>\n#include <unistd.h>\n\n#include <iostream>\n#include <string>\n\n#include \"Core\/Debug.h\"\n#include \"Core\/StringUtil.h\"\n#include \"Core\/ThreadId.h\"\n#include \"Core\/Util.h\"\n#include \"Server\/Globals.h\"\n#include \"Server\/RaftConsensus.h\"\n\nnamespace {\n\n\/**\n * Parses argv for the main function.\n *\/\nclass OptionParser {\n  public:\n    OptionParser(int& argc, char**& argv)\n        : argc(argc)\n        , argv(argv)\n        , bootstrap(false)\n        , configFilename(\"logcabin.conf\")\n        , daemon(false)\n        , debugLogFilename() \/\/ empty for default\n        , pidFilename() \/\/ empty for none\n        , testConfig(false)\n    {\n        while (true) {\n            static struct option longOptions[] = {\n               {\"bootstrap\",  no_argument, NULL, 'b'},\n               {\"config\",  required_argument, NULL, 'c'},\n               {\"daemon\",  no_argument, NULL, 'd'},\n               {\"help\",  no_argument, NULL, 'h'},\n               {\"log\",  required_argument, NULL, 'l'},\n               {\"pidfile\",  required_argument, NULL, 'p'},\n               {\"test\",  no_argument, NULL, 't'},\n               {0, 0, 0, 0}\n            };\n            int c = getopt_long(argc, argv, \"bc:dhl:p:t\", longOptions, NULL);\n\n            \/\/ Detect the end of the options.\n            if (c == -1)\n                break;\n\n            switch (c) {\n                case 'h':\n                    usage();\n                    exit(0);\n                case 'b':\n                    bootstrap = true;\n                    break;\n                case 'c':\n                    configFilename = optarg;\n                    break;\n                case 'd':\n                    daemon = true;\n                    break;\n                case 'l':\n                    debugLogFilename = optarg;\n                    break;\n                case 'p':\n                    pidFilename = optarg;\n                    break;\n                case 't':\n                    testConfig = true;\n                    break;\n                case '?':\n                default:\n                    \/\/ getopt_long already printed an error message.\n                    usage();\n                    exit(1);\n            }\n        }\n\n        \/\/ We don't expect any additional command line arguments (not options).\n        if (optind != argc) {\n            usage();\n            exit(1);\n        }\n    }\n\n    void usage() {\n        std::cout\n            << \"Runs a LogCabin server.\"\n            << std::endl\n            << std::endl\n            << \"This program was released in LogCabin v1.0.0.\"\n            << std::endl\n            << std::endl\n\n            << \"Usage: \" << argv[0] << \" [options]\"\n            << std::endl\n            << std::endl\n\n            << \"Options:\"\n            << std::endl\n\n            << \"  --bootstrap                  \"\n            << \"Write a cluster configuration into the very\"\n            << std::endl\n            << \"                               \"\n            << \"first server's log and exit. This must only\"\n            << std::endl\n            << \"                               \"\n            << \"be run once on a single server in each cluster.\"\n            << std::endl\n\n            << \"  -c <file>, --config=<file>   \"\n            << \"Set the path to the configuration file\"\n            << std::endl\n            << \"                               \"\n            << \"[default: logcabin.conf]\"\n            << std::endl\n\n            << \"  -d, --daemon                 \"\n            << \"Detach and run in the background\"\n            << std::endl\n            << \"                               \"\n            << \"(requires --log)\"\n            << std::endl\n\n            << \"  -h, --help                   \"\n            << \"Print this usage information\"\n            << std::endl\n\n            << \"  -l <file>, --log=<file>      \"\n            << \"Write debug logs to <file> instead of stderr\"\n            << std::endl\n\n            << \"  -p <file>, --pidfile=<file>  \"\n            << \"Write process ID to <file>\"\n            << std::endl\n\n            << \"  -t, --test                   \"\n            << \"Check the configuration file for basic errors\"\n            << std::endl\n            << \"                               \"\n            << \"and exit\"\n            << std::endl\n            << std::endl\n\n            << \"Signals:\"\n            << std::endl\n\n            << \"  SIGUSR1                      \"\n            << \"Dump ServerStats to debug log (experimental)\"\n            << std::endl\n\n            << \"  SIGUSR2                      \"\n            << \"Reopen the debug log file\"\n            << std::endl;\n    }\n\n    int& argc;\n    char**& argv;\n    bool bootstrap;\n    std::string configFilename;\n    bool daemon;\n    std::string debugLogFilename;\n    std::string pidFilename;\n    bool testConfig;\n};\n\n\/**\n * RAII-style class to manage a file containing the process ID.\n *\/\nclass PidFile {\n  public:\n    explicit PidFile(const std::string& filename)\n        : filename(filename)\n        , written(-1)\n    {\n    }\n\n    ~PidFile() {\n        removeFile();\n    }\n\n    void writePid(int pid) {\n        if (filename.empty())\n            return;\n        FILE* file = fopen(filename.c_str(), \"w\");\n        if (file == NULL) {\n            PANIC(\"Could not open %s for writing process ID: %s\",\n                  filename.c_str(),\n                  strerror(errno));\n        }\n        std::string pidString =\n            LogCabin::Core::StringUtil::format(\"%d\\n\", pid);\n        size_t bytesWritten =\n            fwrite(pidString.c_str(), 1, pidString.size(), file);\n        if (bytesWritten != pidString.size()) {\n            PANIC(\"Could not write process ID %s to pidfile %s: %s\",\n                  pidString.c_str(), filename.c_str(),\n                  strerror(errno));\n        }\n        int r = fclose(file);\n        if (r != 0) {\n            PANIC(\"Could not close pidfile %s: %s\",\n                  filename.c_str(),\n                  strerror(errno));\n        }\n        NOTICE(\"Wrote PID %d to %s\",\n               pid, filename.c_str());\n        written = pid;\n    }\n\n    void removeFile() {\n        if (written < 0)\n            return;\n        FILE* file = fopen(filename.c_str(), \"r\");\n        if (file == NULL) {\n            WARNING(\"Could not open %s for reading process ID prior to \"\n                    \"removal: %s\",\n                    filename.c_str(),\n                    strerror(errno));\n            return;\n        }\n        char readbuf[10];\n        memset(readbuf, 0, sizeof(readbuf));\n        size_t bytesRead = fread(readbuf, 1, sizeof(readbuf), file);\n        if (bytesRead == 0) {\n            WARNING(\"PID could not be read from pidfile: \"\n                    \"will not remove file %s\",\n                    filename.c_str());\n            fclose(file);\n            return;\n        }\n        int pidRead = atoi(readbuf);\n        if (pidRead != written) {\n            WARNING(\"PID read from pidfile (%d) does not match PID written \"\n                    \"earlier (%d): will not remove file %s\",\n                    pidRead, written, filename.c_str());\n            fclose(file);\n            return;\n        }\n        int r = unlink(filename.c_str());\n        if (r != 0) {\n            WARNING(\"Could not unlink %s: %s\",\n                    filename.c_str(), strerror(errno));\n            fclose(file);\n            return;\n        }\n        written = -1;\n        fclose(file);\n        NOTICE(\"Removed pidfile %s\", filename.c_str());\n    }\n\n    std::string filename;\n    int written;\n};\n\n} \/\/ anonymous namespace\n\nint\nmain(int argc, char** argv)\n{\n    using namespace LogCabin;\n\n    try {\n        Core::ThreadId::setName(\"evloop\");\n\n        \/\/ Parse command line args.\n        OptionParser options(argc, argv);\n\n        if (options.testConfig) {\n            Server::Globals globals;\n            globals.config.readFile(options.configFilename.c_str());\n            \/\/ The following settings are required, and Config::read() throws\n            \/\/ an exception with an OK error message if they aren't found:\n            globals.config.read<uint64_t>(\"serverId\");\n            globals.config.read<std::string>(\"listenAddresses\");\n            return 0;\n        }\n\n        \/\/ Set debug log file\n        if (!options.debugLogFilename.empty()) {\n            std::string error =\n                Core::Debug::setLogFilename(options.debugLogFilename);\n            if (!error.empty()) {\n                ERROR(\"Failed to set debug log file: %s\",\n                      error.c_str());\n            }\n        }\n\n        NOTICE(\"Using config file %s\", options.configFilename.c_str());\n\n        \/\/ Detach as daemon\n        if (options.daemon) {\n            if (options.debugLogFilename.empty()) {\n                ERROR(\"Refusing to run as daemon without a log file \"\n                      \"(use \/dev\/null if you insist)\");\n            }\n            NOTICE(\"Detaching\");\n            bool chdir = false; \/\/ leave the current working directory in case\n                                \/\/ the user has specified relative paths for\n                                \/\/ the config file, etc\n            bool close = true;  \/\/ close stdin, stdout, stderr\n            if (daemon(!chdir, !close) != 0) {\n                PANIC(\"Call to daemon() failed: %s\", strerror(errno));\n            }\n            int pid = getpid();\n            Core::Debug::processName = Core::StringUtil::format(\"%d\", pid);\n            NOTICE(\"Detached as daemon with pid %d\", pid);\n        }\n\n        \/\/ Write PID file, removed upon destruction\n        PidFile pidFile(options.pidFilename);\n        pidFile.writePid(getpid());\n\n        {\n            \/\/ Initialize and run Globals.\n            Server::Globals globals;\n            globals.config.readFile(options.configFilename.c_str());\n\n            \/\/ Set debug log policy.\n            \/\/ A few log messages above already got through; oh well.\n            Core::Debug::setLogPolicy(\n                Core::Debug::logPolicyFromString(\n                    globals.config.read<std::string>(\"logPolicy\", \"NOTICE\")));\n\n            NOTICE(\"Config file settings:\\n\"\n                   \"# begin config\\n\"\n                   \"%s\"\n                   \"# end config\",\n                   Core::StringUtil::toString(globals.config).c_str());\n            globals.init();\n            if (options.bootstrap) {\n                globals.raft->bootstrapConfiguration();\n                NOTICE(\"Done bootstrapping configuration. Exiting.\");\n            } else {\n                globals.leaveSignalsBlocked();\n                globals.run();\n            }\n        }\n\n        google::protobuf::ShutdownProtobufLibrary();\n        return 0;\n\n    } catch (const Core::Config::Exception& e) {\n        ERROR(\"Fatal exception from config file: %s\",\n              e.what());\n    }\n}\n<commit_msg>support skipFsync command option<commit_after>\/* Copyright (c) 2012 Stanford University\n * Copyright (c) 2014 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 <getopt.h>\n#include <unistd.h>\n\n#include <iostream>\n#include <string>\n\n#include \"Core\/Debug.h\"\n#include \"Core\/StringUtil.h\"\n#include \"Core\/ThreadId.h\"\n#include \"Core\/Util.h\"\n#include \"Server\/Globals.h\"\n#include \"Server\/RaftConsensus.h\"\n\nextern bool LogCabin::Storage::FilesystemUtil::skipFsync;\n\nnamespace {\n\n\/**\n * Parses argv for the main function.\n *\/\nclass OptionParser {\n  public:\n    OptionParser(int& argc, char**& argv)\n        : argc(argc)\n        , argv(argv)\n        , bootstrap(false)\n        , configFilename(\"logcabin.conf\")\n        , daemon(false)\n        , debugLogFilename() \/\/ empty for default\n        , pidFilename() \/\/ empty for none\n        , testConfig(false)\n    {\n        while (true) {\n            static struct option longOptions[] = {\n               {\"bootstrap\",  no_argument, NULL, 'b'},\n               {\"config\",  required_argument, NULL, 'c'},\n               {\"daemon\",  no_argument, NULL, 'd'},\n               {\"help\",  no_argument, NULL, 'h'},\n               {\"log\",  required_argument, NULL, 'l'},\n               {\"pidfile\",  required_argument, NULL, 'p'},\n               {\"test\",  no_argument, NULL, 't'},\n               {\"skipFsync\", no_argument, NULL, 'f'},\n               {0, 0, 0, 0}\n            };\n            int c = getopt_long(argc, argv, \"bc:dhl:p:tf\", longOptions, NULL);\n\n            \/\/ Detect the end of the options.\n            if (c == -1)\n                break;\n\n            switch (c) {\n                case 'h':\n                    usage();\n                    exit(0);\n                case 'b':\n                    bootstrap = true;\n                    break;\n                case 'c':\n                    configFilename = optarg;\n                    break;\n                case 'd':\n                    daemon = true;\n                    break;\n                case 'l':\n                    debugLogFilename = optarg;\n                    break;\n                case 'p':\n                    pidFilename = optarg;\n                    break;\n                case 't':\n                    testConfig = true;\n                    break;\n                case 'f':\n                    LogCabin::Storage::FilesystemUtil::skipFsync = true;\n                    break;\n                case '?':\n                default:\n                    \/\/ getopt_long already printed an error message.\n                    usage();\n                    exit(1);\n            }\n        }\n\n        \/\/ We don't expect any additional command line arguments (not options).\n        if (optind != argc) {\n            usage();\n            exit(1);\n        }\n    }\n\n    void usage() {\n        std::cout\n            << \"Runs a LogCabin server.\"\n            << std::endl\n            << std::endl\n            << \"This program was released in LogCabin v1.0.0.\"\n            << std::endl\n            << std::endl\n\n            << \"Usage: \" << argv[0] << \" [options]\"\n            << std::endl\n            << std::endl\n\n            << \"Options:\"\n            << std::endl\n\n            << \"  --bootstrap                  \"\n            << \"Write a cluster configuration into the very\"\n            << std::endl\n            << \"                               \"\n            << \"first server's log and exit. This must only\"\n            << std::endl\n            << \"                               \"\n            << \"be run once on a single server in each cluster.\"\n            << std::endl\n\n            << \"  -c <file>, --config=<file>   \"\n            << \"Set the path to the configuration file\"\n            << std::endl\n            << \"                               \"\n            << \"[default: logcabin.conf]\"\n            << std::endl\n\n            << \"  -d, --daemon                 \"\n            << \"Detach and run in the background\"\n            << std::endl\n            << \"                               \"\n            << \"(requires --log)\"\n            << std::endl\n\n            << \"  -h, --help                   \"\n            << \"Print this usage information\"\n            << std::endl\n\n            << \"  -l <file>, --log=<file>      \"\n            << \"Write debug logs to <file> instead of stderr\"\n            << std::endl\n\n            << \"  -p <file>, --pidfile=<file>  \"\n            << \"Write process ID to <file>\"\n            << std::endl\n\n            << \"  -t, --test                   \"\n            << \"Check the configuration file for basic errors\"\n            << std::endl\n            << \"                               \"\n            << \"and exit\"\n            << std::endl\n\n            << \"   -f, --skipFsync                \"\n            << \"Skip file sync\"\n            << std::endl\n            << std::endl\n\n            << \"Signals:\"\n            << std::endl\n\n            << \"  SIGUSR1                      \"\n            << \"Dump ServerStats to debug log (experimental)\"\n            << std::endl\n\n            << \"  SIGUSR2                      \"\n            << \"Reopen the debug log file\"\n            << std::endl;\n    }\n\n    int& argc;\n    char**& argv;\n    bool bootstrap;\n    std::string configFilename;\n    bool daemon;\n    std::string debugLogFilename;\n    std::string pidFilename;\n    bool testConfig;\n};\n\n\/**\n * RAII-style class to manage a file containing the process ID.\n *\/\nclass PidFile {\n  public:\n    explicit PidFile(const std::string& filename)\n        : filename(filename)\n        , written(-1)\n    {\n    }\n\n    ~PidFile() {\n        removeFile();\n    }\n\n    void writePid(int pid) {\n        if (filename.empty())\n            return;\n        FILE* file = fopen(filename.c_str(), \"w\");\n        if (file == NULL) {\n            PANIC(\"Could not open %s for writing process ID: %s\",\n                  filename.c_str(),\n                  strerror(errno));\n        }\n        std::string pidString =\n            LogCabin::Core::StringUtil::format(\"%d\\n\", pid);\n        size_t bytesWritten =\n            fwrite(pidString.c_str(), 1, pidString.size(), file);\n        if (bytesWritten != pidString.size()) {\n            PANIC(\"Could not write process ID %s to pidfile %s: %s\",\n                  pidString.c_str(), filename.c_str(),\n                  strerror(errno));\n        }\n        int r = fclose(file);\n        if (r != 0) {\n            PANIC(\"Could not close pidfile %s: %s\",\n                  filename.c_str(),\n                  strerror(errno));\n        }\n        NOTICE(\"Wrote PID %d to %s\",\n               pid, filename.c_str());\n        written = pid;\n    }\n\n    void removeFile() {\n        if (written < 0)\n            return;\n        FILE* file = fopen(filename.c_str(), \"r\");\n        if (file == NULL) {\n            WARNING(\"Could not open %s for reading process ID prior to \"\n                    \"removal: %s\",\n                    filename.c_str(),\n                    strerror(errno));\n            return;\n        }\n        char readbuf[10];\n        memset(readbuf, 0, sizeof(readbuf));\n        size_t bytesRead = fread(readbuf, 1, sizeof(readbuf), file);\n        if (bytesRead == 0) {\n            WARNING(\"PID could not be read from pidfile: \"\n                    \"will not remove file %s\",\n                    filename.c_str());\n            fclose(file);\n            return;\n        }\n        int pidRead = atoi(readbuf);\n        if (pidRead != written) {\n            WARNING(\"PID read from pidfile (%d) does not match PID written \"\n                    \"earlier (%d): will not remove file %s\",\n                    pidRead, written, filename.c_str());\n            fclose(file);\n            return;\n        }\n        int r = unlink(filename.c_str());\n        if (r != 0) {\n            WARNING(\"Could not unlink %s: %s\",\n                    filename.c_str(), strerror(errno));\n            fclose(file);\n            return;\n        }\n        written = -1;\n        fclose(file);\n        NOTICE(\"Removed pidfile %s\", filename.c_str());\n    }\n\n    std::string filename;\n    int written;\n};\n\n} \/\/ anonymous namespace\n\nint\nmain(int argc, char** argv)\n{\n    using namespace LogCabin;\n\n    try {\n        Core::ThreadId::setName(\"evloop\");\n\n        \/\/ Parse command line args.\n        OptionParser options(argc, argv);\n\n        if (options.testConfig) {\n            Server::Globals globals;\n            globals.config.readFile(options.configFilename.c_str());\n            \/\/ The following settings are required, and Config::read() throws\n            \/\/ an exception with an OK error message if they aren't found:\n            globals.config.read<uint64_t>(\"serverId\");\n            globals.config.read<std::string>(\"listenAddresses\");\n            return 0;\n        }\n\n        \/\/ Set debug log file\n        if (!options.debugLogFilename.empty()) {\n            std::string error =\n                Core::Debug::setLogFilename(options.debugLogFilename);\n            if (!error.empty()) {\n                ERROR(\"Failed to set debug log file: %s\",\n                      error.c_str());\n            }\n        }\n\n        NOTICE(\"Using config file %s\", options.configFilename.c_str());\n\n        \/\/ Detach as daemon\n        if (options.daemon) {\n            if (options.debugLogFilename.empty()) {\n                ERROR(\"Refusing to run as daemon without a log file \"\n                      \"(use \/dev\/null if you insist)\");\n            }\n            NOTICE(\"Detaching\");\n            bool chdir = false; \/\/ leave the current working directory in case\n                                \/\/ the user has specified relative paths for\n                                \/\/ the config file, etc\n            bool close = true;  \/\/ close stdin, stdout, stderr\n            if (daemon(!chdir, !close) != 0) {\n                PANIC(\"Call to daemon() failed: %s\", strerror(errno));\n            }\n            int pid = getpid();\n            Core::Debug::processName = Core::StringUtil::format(\"%d\", pid);\n            NOTICE(\"Detached as daemon with pid %d\", pid);\n        }\n\n        \/\/ Write PID file, removed upon destruction\n        PidFile pidFile(options.pidFilename);\n        pidFile.writePid(getpid());\n\n        {\n            \/\/ Initialize and run Globals.\n            Server::Globals globals;\n            globals.config.readFile(options.configFilename.c_str());\n\n            \/\/ Set debug log policy.\n            \/\/ A few log messages above already got through; oh well.\n            Core::Debug::setLogPolicy(\n                Core::Debug::logPolicyFromString(\n                    globals.config.read<std::string>(\"logPolicy\", \"NOTICE\")));\n\n            NOTICE(\"Config file settings:\\n\"\n                   \"# begin config\\n\"\n                   \"%s\"\n                   \"# end config\",\n                   Core::StringUtil::toString(globals.config).c_str());\n            globals.init();\n            if (options.bootstrap) {\n                globals.raft->bootstrapConfiguration();\n                NOTICE(\"Done bootstrapping configuration. Exiting.\");\n            } else {\n                globals.leaveSignalsBlocked();\n                globals.run();\n            }\n        }\n\n        google::protobuf::ShutdownProtobufLibrary();\n        return 0;\n\n    } catch (const Core::Config::Exception& e) {\n        ERROR(\"Fatal exception from config file: %s\",\n              e.what());\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2018 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 <hspp\/Cards\/Cards.h>\n\n#include <clara.hpp>\n\n#ifdef HEARTHSTONEPP_WINDOWS\n#include <filesystem>\n#endif\n#ifdef HEARTHSTONEPP_LINUX\n#include <experimental\/filesystem>\n#endif\n#include <fstream>\n#include <iostream>\n#include <regex>\n#include <string>\n#include <vector>\n\nusing namespace Hearthstonepp;\n\n#ifndef HEARTHSTONEPP_MACOSX\nnamespace filesystem = std::experimental::filesystem;\n#endif\n\ninline std::string ToString(const clara::Opt& opt)\n{\n    std::ostringstream oss;\n    oss << (clara::Parser() | opt);\n    return oss.str();\n}\n\ninline std::string ToString(const clara::Parser& p)\n{\n    std::ostringstream oss;\n    oss << p;\n    return oss.str();\n}\n\ninline std::vector<Card*> QueryCardSetList(CardSet cardSet)\n{\n    if (cardSet == +CardSet::ALL)\n    {\n        return Cards::GetInstance()->GetAllCards();\n    }\n\n    return Cards::GetInstance()->FindCardBySet(cardSet);\n}\n\ninline bool CheckCardImpl(const std::string& path, const std::string& id)\n{\n#ifndef HEARTHSTONEPP_MACOSX\n    const filesystem::path p(path + \"\/Tests\/UnitTests\/CardSets\");\n\n    if (!filesystem::exists(p))\n    {\n        std::cerr << p << \" does not exist\\n\";\n        exit(EXIT_FAILURE);\n    }\n\n    if (!filesystem::is_directory(p))\n    {\n        std::cerr << p << \" exists, but is not directory\\n\";\n    }\n\n    for (auto&& file : filesystem::recursive_directory_iterator(p))\n    {\n        std::regex fileNamePattern(R\"(.*\\\\(.*)\\..*$)\");\n        std::smatch match;\n\n        std::string pathStr = file.path().string();\n\n        if (std::regex_match(pathStr, match, fileNamePattern))\n        {\n            if (match[1] == id)\n            {\n                return true;\n            }\n        }\n    }\n#else\n    std::cerr << \"CheckCardImpl skip: apple-clang doesn't support <filesystem>\\n\";\n#endif\n    return false;\n}\n\ninline void ExportFile(const std::string& projectPath, std::vector<Card*> cards)\n{\n    std::ofstream outputFile(\"result.md\");\n    if (outputFile)\n    {\n        size_t collectibleCardNum = 0;\n        size_t implementedCardNum = 0;\n\n        outputFile << \"Set | ID | Name | Implemented\\n\";\n        outputFile << \":---: | :---: | :---: | :---:\\n\";\n\n        for (auto& card : cards)\n        {\n            if (!card->isCollectible)\n            {\n                continue;\n            }\n\n            collectibleCardNum++;\n\n            const bool isImplemented = CheckCardImpl(projectPath, card->id);\n            if (isImplemented)\n            {\n                implementedCardNum++;\n            }\n\n            outputFile << card->cardSet._to_string() << \" | \" << card->id\n                       << \" | \" << card->name << \" | \"\n                       << (isImplemented ? 'O' : ' ') << '\\n';\n        }\n\n        const size_t implPercent = static_cast<size_t>(\n            static_cast<double>(implementedCardNum) \/ collectibleCardNum * 100);\n        outputFile << '\\n';\n        outputFile << \"- Progress: \" << implPercent << \"% (\"\n                   << implementedCardNum << \" of \" << collectibleCardNum\n                   << \" Cards)\";\n\n        std::cout << \"Export file is completed.\\n\";\n        exit(EXIT_SUCCESS);\n    }\n\n    std::cerr << \"Failed to write file result.md\\n\";\n    exit(EXIT_FAILURE);\n}\n\nint main(int argc, char* argv[])\n{\n    \/\/ Parse command\n    bool showHelp = false;\n    bool exportAllCard = false;\n    std::string cardSetName;\n    std::string projectPath;\n\n    \/\/ Parsing\n    auto parser = clara::Help(showHelp) |\n                  clara::Opt(exportAllCard)[\"-a\"][\"--all\"](\n                      \"Export all card set list to markdown format\") |\n                  clara::Opt(cardSetName, \"cardSet\")[\"-c\"][\"--cardset\"](\n                      \"Export specific card set list to markdown format\") |\n                  clara::Opt(projectPath, \"path\")[\"-p\"][\"--path\"](\n                      \"Hearthstone++ project path\");\n\n    auto result = parser.parse(clara::Args(argc, argv));\n    if (!result)\n    {\n        std::cerr << \"Error in command line: \" << result.errorMessage() << '\\n';\n        exit(EXIT_FAILURE);\n    }\n\n    if (showHelp)\n    {\n        std::cout << ToString(parser) << '\\n';\n        exit(EXIT_SUCCESS);\n    }\n\n    if (projectPath.empty())\n    {\n        std::cout << \"You should input Hearthstone++ project path\\n\";\n        exit(EXIT_FAILURE);\n    }\n\n    std::vector<Card*> cards;\n\n    if (exportAllCard)\n    {\n        cards = QueryCardSetList(CardSet::ALL);\n    }\n    else if (!cardSetName.empty())\n    {\n        const auto maybeCardSet = CardSet::_from_string_nothrow(cardSetName.c_str());\n        if (!maybeCardSet)\n        {\n            std::cerr << \"Invalid card set name: \" << cardSetName << '\\n';\n            exit(EXIT_FAILURE);\n        }\n\n        cards = QueryCardSetList(*maybeCardSet);\n    }\n\n    if (cards.empty())\n    {\n        std::cerr << \"Your search did not generate any hits.\\n\";\n        exit(EXIT_SUCCESS);\n    }\n\n    ExportFile(projectPath, cards);\n\n    exit(EXIT_SUCCESS);\n}<commit_msg>tool: Apply type changes to tool code<commit_after>\/\/ Copyright (c) 2018 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 <hspp\/Cards\/Cards.h>\n\n#include <clara.hpp>\n\n#ifdef HEARTHSTONEPP_WINDOWS\n#include <filesystem>\n#endif\n#ifdef HEARTHSTONEPP_LINUX\n#include <experimental\/filesystem>\n#endif\n#include <fstream>\n#include <iostream>\n#include <regex>\n#include <string>\n#include <vector>\n\nusing namespace Hearthstonepp;\n\n#ifndef HEARTHSTONEPP_MACOSX\nnamespace filesystem = std::experimental::filesystem;\n#endif\n\ninline std::string ToString(const clara::Opt& opt)\n{\n    std::ostringstream oss;\n    oss << (clara::Parser() | opt);\n    return oss.str();\n}\n\ninline std::string ToString(const clara::Parser& p)\n{\n    std::ostringstream oss;\n    oss << p;\n    return oss.str();\n}\n\ninline std::vector<Card> QueryCardSetList(CardSet cardSet)\n{\n    if (cardSet == +CardSet::ALL)\n    {\n        return Cards::GetInstance()->GetAllCards();\n    }\n\n    return Cards::GetInstance()->FindCardBySet(cardSet);\n}\n\ninline bool CheckCardImpl(const std::string& path, const std::string& id)\n{\n#ifndef HEARTHSTONEPP_MACOSX\n    const filesystem::path p(path + \"\/Tests\/UnitTests\/CardSets\");\n\n    if (!filesystem::exists(p))\n    {\n        std::cerr << p << \" does not exist\\n\";\n        exit(EXIT_FAILURE);\n    }\n\n    if (!filesystem::is_directory(p))\n    {\n        std::cerr << p << \" exists, but is not directory\\n\";\n    }\n\n    for (auto&& file : filesystem::recursive_directory_iterator(p))\n    {\n        std::regex fileNamePattern(R\"(.*\\\\(.*)\\..*$)\");\n        std::smatch match;\n\n        std::string pathStr = file.path().string();\n\n        if (std::regex_match(pathStr, match, fileNamePattern))\n        {\n            if (match[1] == id)\n            {\n                return true;\n            }\n        }\n    }\n#else\n    std::cerr << \"CheckCardImpl skip: apple-clang doesn't support <filesystem>\\n\";\n#endif\n    return false;\n}\n\ninline void ExportFile(const std::string& projectPath, std::vector<Card>& cards)\n{\n    std::ofstream outputFile(\"result.md\");\n    if (outputFile)\n    {\n        size_t collectibleCardNum = 0;\n        size_t implementedCardNum = 0;\n\n        outputFile << \"Set | ID | Name | Implemented\\n\";\n        outputFile << \":---: | :---: | :---: | :---:\\n\";\n\n        for (auto& card : cards)\n        {\n            if (!card.isCollectible)\n            {\n                continue;\n            }\n\n            collectibleCardNum++;\n\n            const bool isImplemented = CheckCardImpl(projectPath, card.id);\n            if (isImplemented)\n            {\n                implementedCardNum++;\n            }\n\n            outputFile << card.cardSet._to_string() << \" | \" << card.id\n                       << \" | \" << card.name << \" | \"\n                       << (isImplemented ? 'O' : ' ') << '\\n';\n        }\n\n        const size_t implPercent = static_cast<size_t>(\n            static_cast<double>(implementedCardNum) \/ collectibleCardNum * 100);\n        outputFile << '\\n';\n        outputFile << \"- Progress: \" << implPercent << \"% (\"\n                   << implementedCardNum << \" of \" << collectibleCardNum\n                   << \" Cards)\";\n\n        std::cout << \"Export file is completed.\\n\";\n        exit(EXIT_SUCCESS);\n    }\n\n    std::cerr << \"Failed to write file result.md\\n\";\n    exit(EXIT_FAILURE);\n}\n\nint main(int argc, char* argv[])\n{\n    \/\/ Parse command\n    bool showHelp = false;\n    bool exportAllCard = false;\n    std::string cardSetName;\n    std::string projectPath;\n\n    \/\/ Parsing\n    auto parser = clara::Help(showHelp) |\n                  clara::Opt(exportAllCard)[\"-a\"][\"--all\"](\n                      \"Export all card set list to markdown format\") |\n                  clara::Opt(cardSetName, \"cardSet\")[\"-c\"][\"--cardset\"](\n                      \"Export specific card set list to markdown format\") |\n                  clara::Opt(projectPath, \"path\")[\"-p\"][\"--path\"](\n                      \"Hearthstone++ project path\");\n\n    auto result = parser.parse(clara::Args(argc, argv));\n    if (!result)\n    {\n        std::cerr << \"Error in command line: \" << result.errorMessage() << '\\n';\n        exit(EXIT_FAILURE);\n    }\n\n    if (showHelp)\n    {\n        std::cout << ToString(parser) << '\\n';\n        exit(EXIT_SUCCESS);\n    }\n\n    if (projectPath.empty())\n    {\n        std::cout << \"You should input Hearthstone++ project path\\n\";\n        exit(EXIT_FAILURE);\n    }\n\n    std::vector<Card> cards;\n\n    if (exportAllCard)\n    {\n        cards = QueryCardSetList(CardSet::ALL);\n    }\n    else if (!cardSetName.empty())\n    {\n        const auto maybeCardSet = CardSet::_from_string_nothrow(cardSetName.c_str());\n        if (!maybeCardSet)\n        {\n            std::cerr << \"Invalid card set name: \" << cardSetName << '\\n';\n            exit(EXIT_FAILURE);\n        }\n\n        cards = QueryCardSetList(*maybeCardSet);\n    }\n\n    if (cards.empty())\n    {\n        std::cerr << \"Your search did not generate any hits.\\n\";\n        exit(EXIT_SUCCESS);\n    }\n\n    ExportFile(projectPath, cards);\n\n    exit(EXIT_SUCCESS);\n}<|endoftext|>"}
{"text":"<commit_before>#ifndef ASTRA_GENERIC_STREAM_API_H\n#define ASTRA_GENERIC_STREAM_API_H\n\n#include <astra_core\/capi\/astra_core.h>\n#include <astra_core\/capi\/plugins\/astra_plugin.h>\n#include <cassert>\n#include <cstring>\n#include <stdio.h>\n\ntemplate<typename TFrameWrapperType, typename TFrameType>\nastra_status_t astra_generic_frame_get(astra_reader_frame_t readerFrame,\n                                       astra_stream_type_t type,\n                                       astra_stream_subtype_t subtype,\n                                       TFrameType** frame)\n{\n    astra_frame_t* subFrame;\n    astra_status_t rc = astra_reader_get_frame(readerFrame, type, subtype, &subFrame);\n\n    if (rc == ASTRA_STATUS_SUCCESS && subFrame != nullptr)\n    {\n        TFrameWrapperType* wrapper = reinterpret_cast<TFrameWrapperType*>(subFrame->data);\n        *frame = reinterpret_cast<TFrameType*>(&(wrapper->frame));\n        (*frame)->frame = subFrame;\n    }\n    else\n    {\n        *frame = nullptr;\n    }\n\n    return rc;\n}\n\ntemplate<typename TFrameType>\nastra_status_t astra_generic_frame_get(astra_reader_frame_t readerFrame,\n                                       astra_stream_type_t type,\n                                       astra_stream_subtype_t subtype,\n                                       TFrameType** frame)\n{\n    astra_frame_t* subFrame;\n    astra_status_t rc = astra_reader_get_frame(readerFrame, type, subtype, &subFrame);\n\n    if (rc == ASTRA_STATUS_SUCCESS && subFrame != nullptr)\n    {\n        *frame = reinterpret_cast<TFrameType*>(subFrame->data);\n        (*frame)->frame = subFrame;\n    }\n    else\n    {\n        *frame = nullptr;\n    }\n\n    return rc;\n}\n\ntemplate<typename TFrameType>\nastra_status_t astra_generic_frame_get_frameindex(TFrameType* frame,\n                                                  astra_frame_index_t* index)\n{\n    *index = frame->frame->frameIndex;\n\n    return ASTRA_STATUS_SUCCESS;\n}\n\n\ntemplate<typename TElementType>\nastra_status_t astra_generic_stream_request_array(astra_streamconnection_t connection,\n                                                  astra_parameter_id parameterId,\n                                                  astra_result_token_t* token,\n                                                  size_t* count)\n{\n    size_t paramSize;\n    astra_status_t rc = astra_stream_get_parameter(connection,\n                                                   parameterId,\n                                                   &paramSize,\n                                                   token);\n\n    *count = paramSize \/ sizeof(TElementType);\n\n    return rc;\n}\n\ntemplate<typename TElementType>\nastra_status_t astra_generic_stream_get_result_array(astra_streamconnection_t connection,\n                                                     astra_result_token_t token,\n                                                     void* array,\n                                                     size_t count)\n{\n    size_t resultSize = count * sizeof(TElementType);\n\n    return astra_stream_get_result(connection,\n                                   token,\n                                   resultSize,\n                                   array);\n}\n\ninline astra_status_t astra_stream_get_parameter_fixed(astra_streamconnection_t connection,\n                                                       astra_parameter_id parameterId,\n                                                       size_t byteLength,\n                                                       astra_parameter_data_t* data)\n{\n    astra_result_token_t token;\n    size_t paramSize;\n    astra_status_t rc = astra_stream_get_parameter(connection,\n                                                   parameterId,\n                                                   &paramSize,\n                                                   &token);\n\n    if (rc != ASTRA_STATUS_SUCCESS)\n    {\n        memset(data, 0, byteLength);\n        return rc;\n    }\n\n    assert(paramSize == byteLength);\n\n    return astra_stream_get_result(connection,\n                                   token,\n                                   byteLength,\n                                   data);\n}\n\n\n\n#endif \/* ASTRA_GENERIC_STREAM_API_H *\/\n<commit_msg>change include stdio.h -> cstdio<commit_after>#ifndef ASTRA_GENERIC_STREAM_API_H\n#define ASTRA_GENERIC_STREAM_API_H\n\n#include <astra_core\/capi\/astra_core.h>\n#include <astra_core\/capi\/plugins\/astra_plugin.h>\n#include <cassert>\n#include <cstring>\n#include <cstdio>\n\ntemplate<typename TFrameWrapperType, typename TFrameType>\nastra_status_t astra_generic_frame_get(astra_reader_frame_t readerFrame,\n                                       astra_stream_type_t type,\n                                       astra_stream_subtype_t subtype,\n                                       TFrameType** frame)\n{\n    astra_frame_t* subFrame;\n    astra_status_t rc = astra_reader_get_frame(readerFrame, type, subtype, &subFrame);\n\n    if (rc == ASTRA_STATUS_SUCCESS && subFrame != nullptr)\n    {\n        TFrameWrapperType* wrapper = reinterpret_cast<TFrameWrapperType*>(subFrame->data);\n        *frame = reinterpret_cast<TFrameType*>(&(wrapper->frame));\n        (*frame)->frame = subFrame;\n    }\n    else\n    {\n        *frame = nullptr;\n    }\n\n    return rc;\n}\n\ntemplate<typename TFrameType>\nastra_status_t astra_generic_frame_get(astra_reader_frame_t readerFrame,\n                                       astra_stream_type_t type,\n                                       astra_stream_subtype_t subtype,\n                                       TFrameType** frame)\n{\n    astra_frame_t* subFrame;\n    astra_status_t rc = astra_reader_get_frame(readerFrame, type, subtype, &subFrame);\n\n    if (rc == ASTRA_STATUS_SUCCESS && subFrame != nullptr)\n    {\n        *frame = reinterpret_cast<TFrameType*>(subFrame->data);\n        (*frame)->frame = subFrame;\n    }\n    else\n    {\n        *frame = nullptr;\n    }\n\n    return rc;\n}\n\ntemplate<typename TFrameType>\nastra_status_t astra_generic_frame_get_frameindex(TFrameType* frame,\n                                                  astra_frame_index_t* index)\n{\n    *index = frame->frame->frameIndex;\n\n    return ASTRA_STATUS_SUCCESS;\n}\n\n\ntemplate<typename TElementType>\nastra_status_t astra_generic_stream_request_array(astra_streamconnection_t connection,\n                                                  astra_parameter_id parameterId,\n                                                  astra_result_token_t* token,\n                                                  std::size_t* count)\n{\n    std::size_t paramSize;\n    astra_status_t rc = astra_stream_get_parameter(connection,\n                                                   parameterId,\n                                                   &paramSize,\n                                                   token);\n\n    *count = paramSize \/ sizeof(TElementType);\n\n    return rc;\n}\n\ntemplate<typename TElementType>\nastra_status_t astra_generic_stream_get_result_array(astra_streamconnection_t connection,\n                                                     astra_result_token_t token,\n                                                     void* array,\n                                                     std::size_t count)\n{\n    std::size_t resultSize = count * sizeof(TElementType);\n\n    return astra_stream_get_result(connection,\n                                   token,\n                                   resultSize,\n                                   array);\n}\n\ninline astra_status_t astra_stream_get_parameter_fixed(astra_streamconnection_t connection,\n                                                       astra_parameter_id parameterId,\n                                                       std::size_t byteLength,\n                                                       astra_parameter_data_t* data)\n{\n    astra_result_token_t token;\n    std::size_t paramSize;\n    astra_status_t rc = astra_stream_get_parameter(connection,\n                                                   parameterId,\n                                                   &paramSize,\n                                                   &token);\n\n    if (rc != ASTRA_STATUS_SUCCESS)\n    {\n        std::memset(data, 0, byteLength);\n        return rc;\n    }\n\n    assert(paramSize == byteLength);\n\n    return astra_stream_get_result(connection,\n                                   token,\n                                   byteLength,\n                                   data);\n}\n\n\n\n#endif \/* ASTRA_GENERIC_STREAM_API_H *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (C) 2012-2014 Leap Motion, Inc. All rights reserved.\n#include \"stdafx.h\"\n#include \"TestFixtures\/SimpleThreaded.hpp\"\n#include <autowiring\/ObjectPool.h>\n#include FUTURE_HEADER\n\nclass ObjectPoolTest:\n  public testing::Test\n{};\n\nclass PooledObject {\n};\n\nTEST_F(ObjectPoolTest, VerifyOutstandingLimit) {\n  ObjectPool<PooledObject> pool(2);\n\n  std::shared_ptr<PooledObject> obj1, obj2, obj3;\n\n  \/\/ Try to grab some objects out of the pool:\n  pool(obj1);\n  pool(obj2);\n\n  \/\/ Verify that grabbing a third object fails:\n  pool(obj3);\n  EXPECT_TRUE(obj3 == nullptr) << \"Object pool issued more objects than it was authorized to issue\";\n}\n\nclass LifeCycle {\n  static int constructNum;\n  static int destructNum;\n  static std::mutex numLock;\n\n  \/\/Lock ensures that status checks are atomic.\n  \/\/This does not prevent asynchronous calls.\n  std::mutex stageLock;\n  enum LifeStage {\n    pooled,\n    issued\n  } stage;\n\npublic:\n  LifeCycle() : stage(pooled) {\n    std::lock_guard<std::mutex> guard(numLock);\n    ++constructNum;\n  }\n\n  ~LifeCycle() {\n    {\n      std::lock_guard<std::mutex> guard(numLock);\n      ++destructNum;\n    }\n    std::lock_guard<std::mutex> guard(stageLock);\n    if (stage != pooled) {\n      throw std::runtime_error(\"Destructor called before Finalize\");\n    }\n  }\n\n  static ObjectPool<LifeCycle>* NewObjectPool(size_t limit = ~0, size_t maxPooled = ~0) {\n    return new ObjectPool<LifeCycle>(limit, maxPooled,\n      [] { return new LifeCycle(); },\n      [] (LifeCycle& life) { life.Initialize(); },\n      [] (LifeCycle& life) { life.Finalize(); }\n    );\n  }\n\n  static void InitializeNum() {\n    std::lock_guard<std::mutex> guard(numLock);\n    constructNum = 0;\n    destructNum = 0;\n  }\n  static int ConstructNum() {\n    std::lock_guard<std::mutex> guard(numLock);\n    return constructNum;\n  }\n  static int DestructNum() {\n    std::lock_guard<std::mutex> guard(numLock);\n    return destructNum;\n  }\n\nprotected:\n  void Initialize() {\n    std::lock_guard<std::mutex> guard(stageLock);\n    if (stage != pooled)\n      throw std::runtime_error(\"Initialize called on object not pooled\");\n    stage = issued;\n  }\n\n  void Finalize() {\n    std::lock_guard<std::mutex> guard(stageLock);\n    if (stage != issued)\n      throw std::runtime_error(\"Finalize called on object not issued\");\n    stage = pooled;\n  }\n};\n\nstd::mutex LifeCycle::numLock;\nint LifeCycle::constructNum = 0;\nint LifeCycle::destructNum = 0;\n\nTEST_F(ObjectPoolTest, LifeCycleTestLimitOne) {\n  LifeCycle::InitializeNum();\n  \n  std::shared_ptr<ObjectPool<LifeCycle>> pool(LifeCycle::NewObjectPool(2, 2));\n  std::shared_ptr<LifeCycle> objHold, objDrop;\n\n  \/\/ Create in Pool\n  try {\n    pool->Preallocate(1);\n  } catch (std::runtime_error e) {\n    FAIL() << e.what();\n  }\n  ASSERT_EQ(1, LifeCycle::ConstructNum());\n  ASSERT_EQ(0, LifeCycle::DestructNum());\n\n  \/\/ Issue from Pool\n  try {\n    (*pool)(objHold);\n  } catch (std::runtime_error e) {\n    FAIL() << e.what();\n  }\n  ASSERT_EQ(1, LifeCycle::ConstructNum());\n  ASSERT_EQ(0, LifeCycle::DestructNum());\n\n  \/\/ Issue from Pool with implicit Creation of objDrop\n  try {\n    (*pool)(objDrop);\n  } catch (std::runtime_error e) {\n    FAIL() << e.what();\n  }\n  ASSERT_EQ(2, LifeCycle::ConstructNum());\n  ASSERT_EQ(0, LifeCycle::DestructNum());\n\n  \/\/ Return to Pool\n  try {\n    objDrop.reset();\n  } catch (std::runtime_error e) {\n    FAIL() << e.what();\n  }\n  ASSERT_EQ(2, LifeCycle::ConstructNum());\n  ASSERT_EQ(0, LifeCycle::DestructNum());\n\n  \/\/ Destroy Pool with implicit Destruction of objDrop\n  try {\n    pool.reset();\n  } catch (std::runtime_error e) {\n    FAIL() << e.what();\n  }\n  ASSERT_EQ(2, LifeCycle::ConstructNum());\n  ASSERT_EQ(1, LifeCycle::DestructNum());\n\n  \/\/ Return to Pool redirected to Destruction of objHold\n  try {\n    objHold.reset();\n  } catch (std::runtime_error e) {\n    FAIL() << e.what();\n  }\n  ASSERT_EQ(2, LifeCycle::ConstructNum());\n  ASSERT_EQ(2, LifeCycle::DestructNum());\n}\n\nTEST_F(ObjectPoolTest, DISABLED_VerifyAsynchronousUsage) {\n  AutoCreateContext ctxt;\n  CurrentContextPusher pshr(ctxt);\n\n  AutoRequired<SimpleThreadedT<PooledObject>> obj;\n  AutoFired<SharedPtrReceiver<PooledObject>> spr;\n  ObjectPool<PooledObject> pool(3);\n\n  {\n    \/\/ Obtain the pool limit in objects:\n    std::shared_ptr<PooledObject> obj1, obj2, obj3;\n    pool(obj1);\n    pool(obj2);\n    pool(obj3);\n\n    ASSERT_TRUE(nullptr != obj1.get()) << \"Failed to obtain an entry from a new object pool\";\n\n    \/\/ Block--verify that we _do not_ get any of those objects back while they are\n    \/\/ still outstanding.\n    {\n      auto obj4 = pool.WaitFor(std::chrono::milliseconds(1));\n      EXPECT_TRUE(obj4 == nullptr) << \"Pool issued another element even though it should have hit its outstanding limit\";\n    }\n\n    \/\/ Now we kick off threads:\n    AutoCurrentContext()->Initiate();\n\n    \/\/ Fire off a few events:\n    spr(&SharedPtrReceiver<PooledObject>::OnEvent)(obj1);\n    spr(&SharedPtrReceiver<PooledObject>::OnEvent)(obj2);\n    spr(&SharedPtrReceiver<PooledObject>::OnEvent)(obj3);\n  }\n\n  \/\/ This should return more or less right away as objects become available:\n  {\n    auto obj4 = pool.WaitFor(std::chrono::milliseconds(10));\n    EXPECT_TRUE(obj4 != nullptr) << \"Object pool failed to be notified that it received a new element\";\n  }\n\n  \/\/ Cause the thread to quit:\n  *obj += [&obj] { obj->Stop(); };\n  obj->Wait();\n}\n\nTEST_F(ObjectPoolTest, ClearCachedEntities) {\n  ObjectPool<PooledObject> pool(3);\n\n  \/\/ Create a pool and get a few items in its cache:\n  pool.Wait(),\n  pool.Wait(),\n  pool.Wait();\n\n  \/\/ Verify the expected initial cache count:\n  ASSERT_EQ(3UL, pool.GetCached()) << \"Expected pool outstanding count to have hit 3 entries\";\n\n  \/\/ Now verify that we can clear the object pool at a point in time when it should already be empty:\n  pool.ClearCachedEntities();\n\n  \/\/ And we should be legitimately empty at this point\n  ASSERT_EQ(0UL, pool.GetCached()) << \"After invoking a cache clearing operation, the cache was nevertheless not cleared\";\n}\n\nTEST_F(ObjectPoolTest, VerifyOutOfOrderDestruction) {\n  std::shared_ptr<int> ptr;\n\n  {\n    ObjectPool<int> pool;\n    pool(ptr);\n  }\n\n  \/\/ Verify that returning a shared pointer after the pool is gone does not result in an exception\n  ASSERT_NO_THROW(ptr.reset()) << \"Attempting to release a shared pointer on a destroyed pool caused an unexpected exception\";\n}\n\nclass HoldsSharedPtrThenQuits:\n  public CoreThread\n{\npublic:\n  std::shared_ptr<int> m_ptr;\n\n  void Run(void) override {\n    ThreadSleep(std::chrono::milliseconds(100));\n    m_ptr.reset();\n  }\n};\n\nTEST_F(ObjectPoolTest, EmptyPoolIssuance) {\n  AutoCurrentContext ctxt;\n  ObjectPool<int> pool;\n\n  \/\/ Create the thread which will hold the shared pointer for awhile:\n  AutoRequired<HoldsSharedPtrThenQuits> thread;\n  pool(thread->m_ptr);\n  std::weak_ptr<int> ptrWeak = thread->m_ptr;\n\n  ASSERT_FALSE(ptrWeak.expired()) << \"Object pool failed to issue a shared pointer as expected\";\n\n  \/\/ Verify properties now that we've zeroized the limit:\n  pool.SetOutstandingLimit(0);\n  EXPECT_ANY_THROW(pool.SetOutstandingLimit(1)) << \"An attempt to alter a zeroized outstanding limit did not throw an exception as expected\";\n  EXPECT_ANY_THROW(pool.Wait()) << \"An attempt to obtain an element on an empty pool did not throw an exception as expected\";\n\n  \/\/ Now see if we can delay for the thread to back out:\n  ctxt->Initiate();\n  pool.Rundown();\n\n  \/\/ Verify that it got released as expected:\n  ASSERT_TRUE(ptrWeak.expired()) << \"Not all shared pointers issued by an object pool expired in a timely fashion\";\n}\n\nTEST_F(ObjectPoolTest, CanRundownOneIssued) {\n  \/\/ No conditions to be checked, we just know these routines should not deadlock.\n  ObjectPool<int> pool;\n  pool.Wait();\n  pool.Rundown();\n}\n\nclass ExposedObjectPool:\n  public ObjectPool<int>\n{\npublic:\n  using ObjectPool<int>::m_monitor;\n};\n\nTEST_F(ObjectPoolTest, RundownWhileWaiting) {\n  ObjectPool<int> pool(1);\n  auto first = pool.Wait();\n  \n  std::mutex lock;\n  std::condition_variable cv;\n  bool proceed = false;\n\n  auto future = std::async(std::launch::async, [&] {\n    {\n      std::lock_guard<std::mutex> lk(lock);\n      proceed = true;\n      cv.notify_all();\n    }\n    ASSERT_ANY_THROW(pool.Wait()) << \"Wait operation should throw if it is rundown while threads are waiting\";\n  });\n  \n  \/\/ Block until the async call is at least started\n  std::unique_lock<std::mutex> lk(lock);\n  ASSERT_TRUE(\n    cv.wait_for(lk, std::chrono::seconds(5), [&proceed] { return proceed; })\n  ) << \"Dependent thread did not initiate in time\";\n\n  \/\/ Block until the thread is (probably) waiting\n  std::this_thread::sleep_for(std::chrono::milliseconds(10));\n  \n  \/\/ Now, ensure no crashing:\n  first.reset();\n  pool.Rundown();\n\n  \/\/ Make sure the thread goes away before we do:\n  future.wait();\n}\n\nTEST_F(ObjectPoolTest, OutstandingLimitIsOne) {\n  ObjectPool<int> pool(1);\n  AutoRequired<CoreThread> ct;\n  AutoCurrentContext()->Initiate();\n\n  \/\/ Bounce 1000 shared pointers into the CoreThread\n  for(size_t i = 0; i < 1000; i++) {\n    \/\/ Try to wait on the pool:\n    auto entity = pool.WaitFor(std::chrono::seconds(10));\n    ASSERT_NE(nullptr, entity) << \"Failed to obtain an entity from a single-element pool\";\n\n    \/\/ Pend a lambda that just holds a closure on the entity:\n    *ct += [entity] {};\n  }\n}\n\nTEST_F(ObjectPoolTest, MovableObjectPool) {\n  ObjectPool<int> to;\n\n  \/\/ Verify a move works correctly when an object has been checked out:\n  {\n    ObjectPool<int> from;\n    auto original = from.Wait();\n    to = std::move(from);\n  }\n\n  \/\/ Now verify that the pooled object returned home to the right place:\n  ASSERT_EQ(1UL, to.GetCached()) << \"Object pool move operation did not correctly relay checked out types\";\n}\n\nTEST_F(ObjectPoolTest, MovableObjectPoolAysnc) {\n  static const size_t s_count = 10000;\n  ObjectPool<int> from;\n\n  {\n    \/\/ Issue a zillion objects from the from pool:\n    std::vector<std::shared_ptr<int>> objs;\n    for(size_t i = s_count; i--;)\n      objs.push_back(from.Wait());\n\n    \/\/ Make a thread, let it hold these objects while we move its pool:\n    *AutoRequired<CoreThread>() += [objs] {};\n  }\n\n  \/\/ Kick off threads, then immediately and asynchronously move the pool:\n  AutoCurrentContext()->Initiate();\n  ObjectPool<int> to = std::move(from);\n\n  \/\/ Shutdown time:\n  AutoCurrentContext()->SignalShutdown(true);\n\n  \/\/ Verify that new pool got all of the objects:\n  ASSERT_EQ(s_count, to.GetCached()) << \"Object pool move operation did not correctly relay checked out types\";\n}\n\nTEST_F(ObjectPoolTest, VerifyInitializerFinalizer) {\n  auto initFlag = std::make_shared<bool>(false);\n  auto termFlag = std::make_shared<bool>(false);\n\n  ObjectPool<bool> pool(\n    &DefaultCreate<bool>,\n    [initFlag](bool&) { *initFlag = true; },\n    [termFlag](bool&) { *termFlag = true; }\n  );\n\n  \/\/ Issue a shared pointer, this shouldn't invoke the finalizer but should invoke the initializer\n  auto issued = pool.Wait();\n  ASSERT_TRUE(*initFlag) << \"Item issued from a pool was not properly initialized\";\n  ASSERT_FALSE(*termFlag) << \"Item issued from a pool was finalized before it was released\";\n\n  \/\/ Now return the issued item, and verify that the correct functions get called\n  *initFlag = false;\n  issued.reset();\n  ASSERT_FALSE(*initFlag) << \"Returned item incorrectly caused a new initialization\";\n  ASSERT_TRUE(*termFlag) << \"Returned item was not correctly finalized\";\n}<commit_msg>Add THREAD_HEADER to ObjectPoolTest<commit_after>\/\/ Copyright (C) 2012-2014 Leap Motion, Inc. All rights reserved.\n#include \"stdafx.h\"\n#include \"TestFixtures\/SimpleThreaded.hpp\"\n#include <autowiring\/ObjectPool.h>\n#include FUTURE_HEADER\n#include THREAD_HEADER\n\nclass ObjectPoolTest:\n  public testing::Test\n{};\n\nclass PooledObject {\n};\n\nTEST_F(ObjectPoolTest, VerifyOutstandingLimit) {\n  ObjectPool<PooledObject> pool(2);\n\n  std::shared_ptr<PooledObject> obj1, obj2, obj3;\n\n  \/\/ Try to grab some objects out of the pool:\n  pool(obj1);\n  pool(obj2);\n\n  \/\/ Verify that grabbing a third object fails:\n  pool(obj3);\n  EXPECT_TRUE(obj3 == nullptr) << \"Object pool issued more objects than it was authorized to issue\";\n}\n\nclass LifeCycle {\n  static int constructNum;\n  static int destructNum;\n  static std::mutex numLock;\n\n  \/\/Lock ensures that status checks are atomic.\n  \/\/This does not prevent asynchronous calls.\n  std::mutex stageLock;\n  enum LifeStage {\n    pooled,\n    issued\n  } stage;\n\npublic:\n  LifeCycle() : stage(pooled) {\n    std::lock_guard<std::mutex> guard(numLock);\n    ++constructNum;\n  }\n\n  ~LifeCycle() {\n    {\n      std::lock_guard<std::mutex> guard(numLock);\n      ++destructNum;\n    }\n    std::lock_guard<std::mutex> guard(stageLock);\n    if (stage != pooled) {\n      throw std::runtime_error(\"Destructor called before Finalize\");\n    }\n  }\n\n  static ObjectPool<LifeCycle>* NewObjectPool(size_t limit = ~0, size_t maxPooled = ~0) {\n    return new ObjectPool<LifeCycle>(limit, maxPooled,\n      [] { return new LifeCycle(); },\n      [] (LifeCycle& life) { life.Initialize(); },\n      [] (LifeCycle& life) { life.Finalize(); }\n    );\n  }\n\n  static void InitializeNum() {\n    std::lock_guard<std::mutex> guard(numLock);\n    constructNum = 0;\n    destructNum = 0;\n  }\n  static int ConstructNum() {\n    std::lock_guard<std::mutex> guard(numLock);\n    return constructNum;\n  }\n  static int DestructNum() {\n    std::lock_guard<std::mutex> guard(numLock);\n    return destructNum;\n  }\n\nprotected:\n  void Initialize() {\n    std::lock_guard<std::mutex> guard(stageLock);\n    if (stage != pooled)\n      throw std::runtime_error(\"Initialize called on object not pooled\");\n    stage = issued;\n  }\n\n  void Finalize() {\n    std::lock_guard<std::mutex> guard(stageLock);\n    if (stage != issued)\n      throw std::runtime_error(\"Finalize called on object not issued\");\n    stage = pooled;\n  }\n};\n\nstd::mutex LifeCycle::numLock;\nint LifeCycle::constructNum = 0;\nint LifeCycle::destructNum = 0;\n\nTEST_F(ObjectPoolTest, LifeCycleTestLimitOne) {\n  LifeCycle::InitializeNum();\n  \n  std::shared_ptr<ObjectPool<LifeCycle>> pool(LifeCycle::NewObjectPool(2, 2));\n  std::shared_ptr<LifeCycle> objHold, objDrop;\n\n  \/\/ Create in Pool\n  try {\n    pool->Preallocate(1);\n  } catch (std::runtime_error e) {\n    FAIL() << e.what();\n  }\n  ASSERT_EQ(1, LifeCycle::ConstructNum());\n  ASSERT_EQ(0, LifeCycle::DestructNum());\n\n  \/\/ Issue from Pool\n  try {\n    (*pool)(objHold);\n  } catch (std::runtime_error e) {\n    FAIL() << e.what();\n  }\n  ASSERT_EQ(1, LifeCycle::ConstructNum());\n  ASSERT_EQ(0, LifeCycle::DestructNum());\n\n  \/\/ Issue from Pool with implicit Creation of objDrop\n  try {\n    (*pool)(objDrop);\n  } catch (std::runtime_error e) {\n    FAIL() << e.what();\n  }\n  ASSERT_EQ(2, LifeCycle::ConstructNum());\n  ASSERT_EQ(0, LifeCycle::DestructNum());\n\n  \/\/ Return to Pool\n  try {\n    objDrop.reset();\n  } catch (std::runtime_error e) {\n    FAIL() << e.what();\n  }\n  ASSERT_EQ(2, LifeCycle::ConstructNum());\n  ASSERT_EQ(0, LifeCycle::DestructNum());\n\n  \/\/ Destroy Pool with implicit Destruction of objDrop\n  try {\n    pool.reset();\n  } catch (std::runtime_error e) {\n    FAIL() << e.what();\n  }\n  ASSERT_EQ(2, LifeCycle::ConstructNum());\n  ASSERT_EQ(1, LifeCycle::DestructNum());\n\n  \/\/ Return to Pool redirected to Destruction of objHold\n  try {\n    objHold.reset();\n  } catch (std::runtime_error e) {\n    FAIL() << e.what();\n  }\n  ASSERT_EQ(2, LifeCycle::ConstructNum());\n  ASSERT_EQ(2, LifeCycle::DestructNum());\n}\n\nTEST_F(ObjectPoolTest, DISABLED_VerifyAsynchronousUsage) {\n  AutoCreateContext ctxt;\n  CurrentContextPusher pshr(ctxt);\n\n  AutoRequired<SimpleThreadedT<PooledObject>> obj;\n  AutoFired<SharedPtrReceiver<PooledObject>> spr;\n  ObjectPool<PooledObject> pool(3);\n\n  {\n    \/\/ Obtain the pool limit in objects:\n    std::shared_ptr<PooledObject> obj1, obj2, obj3;\n    pool(obj1);\n    pool(obj2);\n    pool(obj3);\n\n    ASSERT_TRUE(nullptr != obj1.get()) << \"Failed to obtain an entry from a new object pool\";\n\n    \/\/ Block--verify that we _do not_ get any of those objects back while they are\n    \/\/ still outstanding.\n    {\n      auto obj4 = pool.WaitFor(std::chrono::milliseconds(1));\n      EXPECT_TRUE(obj4 == nullptr) << \"Pool issued another element even though it should have hit its outstanding limit\";\n    }\n\n    \/\/ Now we kick off threads:\n    AutoCurrentContext()->Initiate();\n\n    \/\/ Fire off a few events:\n    spr(&SharedPtrReceiver<PooledObject>::OnEvent)(obj1);\n    spr(&SharedPtrReceiver<PooledObject>::OnEvent)(obj2);\n    spr(&SharedPtrReceiver<PooledObject>::OnEvent)(obj3);\n  }\n\n  \/\/ This should return more or less right away as objects become available:\n  {\n    auto obj4 = pool.WaitFor(std::chrono::milliseconds(10));\n    EXPECT_TRUE(obj4 != nullptr) << \"Object pool failed to be notified that it received a new element\";\n  }\n\n  \/\/ Cause the thread to quit:\n  *obj += [&obj] { obj->Stop(); };\n  obj->Wait();\n}\n\nTEST_F(ObjectPoolTest, ClearCachedEntities) {\n  ObjectPool<PooledObject> pool(3);\n\n  \/\/ Create a pool and get a few items in its cache:\n  pool.Wait(),\n  pool.Wait(),\n  pool.Wait();\n\n  \/\/ Verify the expected initial cache count:\n  ASSERT_EQ(3UL, pool.GetCached()) << \"Expected pool outstanding count to have hit 3 entries\";\n\n  \/\/ Now verify that we can clear the object pool at a point in time when it should already be empty:\n  pool.ClearCachedEntities();\n\n  \/\/ And we should be legitimately empty at this point\n  ASSERT_EQ(0UL, pool.GetCached()) << \"After invoking a cache clearing operation, the cache was nevertheless not cleared\";\n}\n\nTEST_F(ObjectPoolTest, VerifyOutOfOrderDestruction) {\n  std::shared_ptr<int> ptr;\n\n  {\n    ObjectPool<int> pool;\n    pool(ptr);\n  }\n\n  \/\/ Verify that returning a shared pointer after the pool is gone does not result in an exception\n  ASSERT_NO_THROW(ptr.reset()) << \"Attempting to release a shared pointer on a destroyed pool caused an unexpected exception\";\n}\n\nclass HoldsSharedPtrThenQuits:\n  public CoreThread\n{\npublic:\n  std::shared_ptr<int> m_ptr;\n\n  void Run(void) override {\n    ThreadSleep(std::chrono::milliseconds(100));\n    m_ptr.reset();\n  }\n};\n\nTEST_F(ObjectPoolTest, EmptyPoolIssuance) {\n  AutoCurrentContext ctxt;\n  ObjectPool<int> pool;\n\n  \/\/ Create the thread which will hold the shared pointer for awhile:\n  AutoRequired<HoldsSharedPtrThenQuits> thread;\n  pool(thread->m_ptr);\n  std::weak_ptr<int> ptrWeak = thread->m_ptr;\n\n  ASSERT_FALSE(ptrWeak.expired()) << \"Object pool failed to issue a shared pointer as expected\";\n\n  \/\/ Verify properties now that we've zeroized the limit:\n  pool.SetOutstandingLimit(0);\n  EXPECT_ANY_THROW(pool.SetOutstandingLimit(1)) << \"An attempt to alter a zeroized outstanding limit did not throw an exception as expected\";\n  EXPECT_ANY_THROW(pool.Wait()) << \"An attempt to obtain an element on an empty pool did not throw an exception as expected\";\n\n  \/\/ Now see if we can delay for the thread to back out:\n  ctxt->Initiate();\n  pool.Rundown();\n\n  \/\/ Verify that it got released as expected:\n  ASSERT_TRUE(ptrWeak.expired()) << \"Not all shared pointers issued by an object pool expired in a timely fashion\";\n}\n\nTEST_F(ObjectPoolTest, CanRundownOneIssued) {\n  \/\/ No conditions to be checked, we just know these routines should not deadlock.\n  ObjectPool<int> pool;\n  pool.Wait();\n  pool.Rundown();\n}\n\nclass ExposedObjectPool:\n  public ObjectPool<int>\n{\npublic:\n  using ObjectPool<int>::m_monitor;\n};\n\nTEST_F(ObjectPoolTest, RundownWhileWaiting) {\n  ObjectPool<int> pool(1);\n  auto first = pool.Wait();\n  \n  std::mutex lock;\n  std::condition_variable cv;\n  bool proceed = false;\n\n  auto future = std::async(std::launch::async, [&] {\n    {\n      std::lock_guard<std::mutex> lk(lock);\n      proceed = true;\n      cv.notify_all();\n    }\n    ASSERT_ANY_THROW(pool.Wait()) << \"Wait operation should throw if it is rundown while threads are waiting\";\n  });\n  \n  \/\/ Block until the async call is at least started\n  std::unique_lock<std::mutex> lk(lock);\n  ASSERT_TRUE(\n    cv.wait_for(lk, std::chrono::seconds(5), [&proceed] { return proceed; })\n  ) << \"Dependent thread did not initiate in time\";\n\n  \/\/ Block until the thread is (probably) waiting\n  std::this_thread::sleep_for(std::chrono::milliseconds(10));\n  \n  \/\/ Now, ensure no crashing:\n  first.reset();\n  pool.Rundown();\n\n  \/\/ Make sure the thread goes away before we do:\n  future.wait();\n}\n\nTEST_F(ObjectPoolTest, OutstandingLimitIsOne) {\n  ObjectPool<int> pool(1);\n  AutoRequired<CoreThread> ct;\n  AutoCurrentContext()->Initiate();\n\n  \/\/ Bounce 1000 shared pointers into the CoreThread\n  for(size_t i = 0; i < 1000; i++) {\n    \/\/ Try to wait on the pool:\n    auto entity = pool.WaitFor(std::chrono::seconds(10));\n    ASSERT_NE(nullptr, entity) << \"Failed to obtain an entity from a single-element pool\";\n\n    \/\/ Pend a lambda that just holds a closure on the entity:\n    *ct += [entity] {};\n  }\n}\n\nTEST_F(ObjectPoolTest, MovableObjectPool) {\n  ObjectPool<int> to;\n\n  \/\/ Verify a move works correctly when an object has been checked out:\n  {\n    ObjectPool<int> from;\n    auto original = from.Wait();\n    to = std::move(from);\n  }\n\n  \/\/ Now verify that the pooled object returned home to the right place:\n  ASSERT_EQ(1UL, to.GetCached()) << \"Object pool move operation did not correctly relay checked out types\";\n}\n\nTEST_F(ObjectPoolTest, MovableObjectPoolAysnc) {\n  static const size_t s_count = 10000;\n  ObjectPool<int> from;\n\n  {\n    \/\/ Issue a zillion objects from the from pool:\n    std::vector<std::shared_ptr<int>> objs;\n    for(size_t i = s_count; i--;)\n      objs.push_back(from.Wait());\n\n    \/\/ Make a thread, let it hold these objects while we move its pool:\n    *AutoRequired<CoreThread>() += [objs] {};\n  }\n\n  \/\/ Kick off threads, then immediately and asynchronously move the pool:\n  AutoCurrentContext()->Initiate();\n  ObjectPool<int> to = std::move(from);\n\n  \/\/ Shutdown time:\n  AutoCurrentContext()->SignalShutdown(true);\n\n  \/\/ Verify that new pool got all of the objects:\n  ASSERT_EQ(s_count, to.GetCached()) << \"Object pool move operation did not correctly relay checked out types\";\n}\n\nTEST_F(ObjectPoolTest, VerifyInitializerFinalizer) {\n  auto initFlag = std::make_shared<bool>(false);\n  auto termFlag = std::make_shared<bool>(false);\n\n  ObjectPool<bool> pool(\n    &DefaultCreate<bool>,\n    [initFlag](bool&) { *initFlag = true; },\n    [termFlag](bool&) { *termFlag = true; }\n  );\n\n  \/\/ Issue a shared pointer, this shouldn't invoke the finalizer but should invoke the initializer\n  auto issued = pool.Wait();\n  ASSERT_TRUE(*initFlag) << \"Item issued from a pool was not properly initialized\";\n  ASSERT_FALSE(*termFlag) << \"Item issued from a pool was finalized before it was released\";\n\n  \/\/ Now return the issued item, and verify that the correct functions get called\n  *initFlag = false;\n  issued.reset();\n  ASSERT_FALSE(*initFlag) << \"Returned item incorrectly caused a new initialization\";\n  ASSERT_TRUE(*termFlag) << \"Returned item was not correctly finalized\";\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, [Pa]\");\n    params.addCoupledVar(\"enthalpy\", \"Use enthalpy to calculate variable temperature, [J]\");\n    params.addParam(\"temperature\", 373.15, \"Initial value for temperature, [K]\");\n    \/\/params.addParam(\"temp_guess\", \"Guess value for temperature to seed the EOS, [K]\");\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    _pressure(coupledValue(\"pressure\")),\n    _enthalpy(coupledValue(\"enthalpy\")),\n     _input_temperature(getParam<Real>(\"temperature\"))\n     \/\/  _temp_guess(getParam<Real>(\"temp_guess\"))\n{}\n\nReal\nCoupledTemperatureAux::computeValue()\n{\n    Real _temperature = _input_temperature;\n    Real _dummy_var[12];\n\n    if (_t_step == 1)\n    {\n          _water_steam_properties.waterAndSteamEquationOfStatePropertiesPH (_enthalpy[_qp], _pressure[_qp], _input_temperature, _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    else\n    {\n       _water_steam_properties.waterAndSteamEquationOfStatePropertiesPH (_enthalpy[_qp], _pressure[_qp], _u_old[_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>MOOSE now requires that addParam *always* specifies the type - github #2890<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, [Pa]\");\n    params.addCoupledVar(\"enthalpy\", \"Use enthalpy to calculate variable temperature, [J]\");\n    params.addParam<Real>(\"temperature\", 373.15, \"Initial value for temperature, [K]\");\n    \/\/params.addParam(\"temp_guess\", \"Guess value for temperature to seed the EOS, [K]\");\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    _pressure(coupledValue(\"pressure\")),\n    _enthalpy(coupledValue(\"enthalpy\")),\n     _input_temperature(getParam<Real>(\"temperature\"))\n     \/\/  _temp_guess(getParam<Real>(\"temp_guess\"))\n{}\n\nReal\nCoupledTemperatureAux::computeValue()\n{\n    Real _temperature = _input_temperature;\n    Real _dummy_var[12];\n\n    if (_t_step == 1)\n    {\n          _water_steam_properties.waterAndSteamEquationOfStatePropertiesPH (_enthalpy[_qp], _pressure[_qp], _input_temperature, _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    else\n    {\n       _water_steam_properties.waterAndSteamEquationOfStatePropertiesPH (_enthalpy[_qp], _pressure[_qp], _u_old[_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>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\r\n\/\/             OpenLieroX\r\n\/\/\r\n\/\/ code under LGPL, based on JasonBs work,\r\n\/\/ enhanced by Dark Charlie and Albert Zeyer\r\n\/\/\r\n\/\/\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n\r\n\/\/ CProgressBar source file\r\n\/\/ Created 22\/6\/07\r\n\/\/ Dark Charlie\r\n\r\n#include \"LieroX.h\"\r\n#include \"GfxPrimitives.h\"\r\n#include \"SkinnedGUI\/CProgressbar.h\"\r\n#include \"StringUtils.h\"\r\n#include \"MathLib.h\"\r\n#include \"XMLutils.h\"\r\n#include \"FindFile.h\"\r\n\r\n\r\nnamespace SkinnedGUI {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ Constructor\r\nCProgressBar::CProgressBar(COMMON_PARAMS, int num_fore_states, int num_bg_states) :\r\nCWidget(name, parent)  {\r\n\tbmpBar.set(NULL, DEFAULT_PRIORITY);\r\n\tiDirection.set(BAR_LEFTTORIGHT, DEFAULT_PRIORITY);\r\n\tiPosition = 100;\r\n\tiNumForeStates = num_fore_states;\r\n\tiNumBgStates = num_bg_states;\r\n\tiCurrentForeState = 0;\r\n\tiCurrentBgState = 0;\r\n\r\n\t\/\/ Default colors\r\n\tbgColor.set(Color(128, 128, 128), DEFAULT_PRIORITY);\r\n\tforeColor.set(Color(0, 255, 0), DEFAULT_PRIORITY);\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ Set the progressbar position\r\nvoid CProgressBar::setPosition(int _p)\r\n{\r\n\tif (cLabel)\r\n\t\tcLabel->setText(itoa(_p));\r\n\tiPosition = _p;\r\n\tRepaint();\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ Set the current foreground state\r\nvoid CProgressBar::setCurrentForeState(int _s)\r\n{\r\n\tiCurrentForeState = MIN(iNumForeStates-1, _s);\r\n\tRepaint();\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ Set the current background state\r\nvoid CProgressBar::setCurrentBgState(int _s)\r\n{\r\n\tiCurrentBgState = MIN(iNumBgStates-1, _s);\r\n\tRepaint();\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ Draw the bar\r\nvoid CProgressBar::DoRepaint()\r\n{\r\n\tCHECK_BUFFER;\r\n\r\n\tstd::string progress = itoa(iPosition) + \" %\";\r\n\tint pos = CLAMP(iPosition, 0, 100);\r\n\r\n\t\/\/ In the bar image, there's the fully loaded image - it's always the first image starting at 0,0.\r\n\t\/\/ Then there can be unlimited number of states for various purposes\r\n\t\/\/ The last image is the background - fully unloaded image\r\n\r\n\tif (bmpBar.get().get())  {  \/\/ We got a bitmap - many options and possibilities for drawing\r\n\t\tint numstates = iNumForeStates + iNumBgStates;\r\n\r\n\t\tint bar_h = (bmpBar->h - iNumForeStates) \/ (numstates);\r\n\t\tint bar_w = (bmpBar->w - iNumForeStates) \/ (numstates);\r\n\r\n\t\tUint32 clLabel = cLabel ? cLabel->getColor().get(bmpBuffer) : SDL_MapRGB(bmpBuffer->format, 255, 255, 255);\r\n\t\t\r\n\t\t\/\/ Draw the progress bitmap over the background depending on progress direction\r\n\t\tint w, h;\r\n\t\tswitch (iDirection)  {\r\n\t\tcase BAR_LEFTTORIGHT:\r\n\t\t\t\/\/ Background\r\n\t\t\tDrawImageAdv(bmpBuffer.get(), bmpBar, 0, bar_h * (iNumForeStates + iCurrentBgState), 0, 0, bmpBar->w, bar_h);\r\n\r\n\t\t\tDrawImageAdv(bmpBuffer.get(), bmpBar, 0,  bar_h * iCurrentForeState, 0, 0, (bmpBar->w * pos) \/ 100, bar_h);  \/\/ Progress\r\n\t\t\tLOCK_OR_QUIT(bmpBar);\r\n\t\t\tclLabel = GetPixel(bmpBar.get().get(), MAX(0, (bmpBar->w*pos)\/100 - 1), bmpBar->h - iNumForeStates + iCurrentForeState);\r\n\t\t\tUnlockSurface(bmpBar);\r\n\t\t\tbreak;\r\n\t\tcase BAR_RIGHTTOLEFT:\r\n\t\t\t\/\/ Background\r\n\t\t\tDrawImageAdv(bmpBuffer.get(), bmpBar, 0, bar_h * (iNumForeStates + iCurrentBgState), 0, 0, bmpBar->w, bar_h);\r\n\r\n\t\t\tw = (bmpBar->w * pos) \/ 100;\r\n\t\t\tDrawImageAdv(bmpBuffer.get(), bmpBar, bmpBar->w - w,  bar_h * iCurrentForeState, bmpBar->w - w, 0, w, bar_h);  \/\/ Progress\r\n\t\t\tLOCK_OR_QUIT(bmpBar);\r\n\t\t\tclLabel = GetPixel(bmpBar.get().get(), MIN(bmpBar->w - 1, bmpBar->w - w + 1), bmpBar->h - iNumForeStates + iCurrentForeState);\r\n\t\t\tUnlockSurface(bmpBar);\r\n\t\t\tbreak;\r\n\t\tcase BAR_TOPTOBOTTOM: \r\n\t\t\t\/\/ Background\r\n\t\t\tDrawImageAdv(bmpBuffer.get(), bmpBar, bar_w * (iNumForeStates + iCurrentBgState), 0, 0, 0, bar_w, bmpBar->h); \/\/ The last image is the empty one\r\n\r\n\t\t\tDrawImageAdv(bmpBuffer.get(), bmpBar, bar_w * iCurrentForeState, 0, 0, 0, bar_w, (bmpBar->h \/ 100) * pos); \/\/ Progress\r\n\t\t\tLOCK_OR_QUIT(bmpBar);\r\n\t\t\tclLabel = GetPixel(bmpBar.get().get(), bmpBar->w - iNumForeStates + iCurrentForeState, MAX(0, (bmpBar->h * pos)\/100 - 1));\r\n\t\t\tUnlockSurface(bmpBar);\r\n\t\t\tbreak;\r\n\t\tcase BAR_BOTTOMTOTOP:\r\n\t\t\t\/\/ Background\r\n\t\t\tDrawImageAdv(bmpBuffer.get(), bmpBar, bar_w * (iNumForeStates + iCurrentBgState), 0, 0, 0, bar_w, bmpBar->h); \/\/ The last image is the empty one\r\n\r\n\t\t\th = (bmpBar->w * pos) \/ 100;\r\n\t\t\tDrawImageAdv(bmpBuffer.get(), bmpBar,  bar_w * iCurrentForeState, bmpBar->h - h, 0, bmpBar->h - h, bar_w, h);  \/\/ Progress\r\n\t\t\tLOCK_OR_QUIT(bmpBar);\r\n\t\t\tclLabel = GetPixel(bmpBar.get().get(), bmpBar->w - iNumForeStates + iCurrentForeState, MIN(bmpBar->h - 1, bmpBar->h - h - 1));\r\n\t\t\tUnlockSurface(bmpBar);\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n\t\t\tprintf(\"Bad bar type in CProgressBar::DoRepaint\");\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\t\/\/ Set the label color\r\n\t\tif (cLabel)\r\n\t\t\tcLabel->setColor(Color(bmpBuffer, clLabel));\r\n\r\n\t\t\r\n\t} else {  \/\/ No bitmap, just draw the simplest bar without any options\r\n\t\tDrawRectFill(bmpBuffer.get(), 0, 0, getWidth(), getHeight(), bgColor);\r\n\t\tDrawRectFill(bmpBuffer.get(), 1, 1, (getWidth() \/ 100) * pos + 1, getHeight() - 1, foreColor);\r\n\t}\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ Apply the given selector\r\nvoid CProgressBar::ApplySelector(const CSSParser::Selector& sel, const std::string& prefix)\r\n{\r\n\tCWidget::ApplySelector(sel, prefix);\r\n\r\n\tFOR_EACH_ATTRIBUTE(sel, it)  {\r\n\t\tif (it->getName() == prefix + \"direction\")  {\r\n\t\t\tif (stringcaseequal(it->getFirstValue().getString(), \"lefttoright\"))\r\n\t\t\t\tiDirection.set(BAR_LEFTTORIGHT, it->getPriority());\r\n\t\t\telse if (stringcaseequal(it->getFirstValue().getString(), \"righttoleft\"))\r\n\t\t\t\tiDirection.set(BAR_RIGHTTOLEFT, it->getPriority());\r\n\t\t\telse if (stringcaseequal(it->getFirstValue().getString(), \"toptobottom\"))\r\n\t\t\t\tiDirection.set(BAR_TOPTOBOTTOM, it->getPriority());\r\n\t\t\telse if (stringcaseequal(it->getFirstValue().getString(), \"bottomtotop\"))\r\n\t\t\t\tiDirection.set(BAR_BOTTOMTOTOP, it->getPriority());\r\n\t\t\telse\r\n\t\t\t\tprintf(\"Unknown bar direction in the CSS\\n\");\r\n\t\t} else if (it->getName() == prefix + \"image\")  {\r\n\t\t\tbmpBar.set(LoadGameImage(JoinPaths(sel.getBaseURL(), it->getFirstValue().getURL()), true), it->getPriority());\r\n\t\t} else if (it->getName() == prefix + \"background-color\")  {\r\n\t\t\tbgColor.set(it->getFirstValue().getColor(bgColor), it->getPriority());\r\n\t\t} else if (it->getName() == prefix + \"foreground-color\")  {\r\n\t\t\tforeColor.set(it->getFirstValue().getColor(foreColor), it->getPriority());\r\n\t\t}\r\n\t}\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ Apply the given node\r\nvoid CProgressBar::ApplyTag(xmlNodePtr node)\r\n{\r\n\tCWidget::ApplyTag(node);\r\n\r\n\t\/\/ Direction\r\n\tif (xmlPropExists(node, \"dir\"))  {\r\n\t\tstd::string dir = xmlGetString(node, \"dir\", \"lefttoright\");\r\n\t\tif (stringcaseequal(dir, \"lefttoright\"))\r\n\t\t\tiDirection.set(BAR_LEFTTORIGHT, TAG_ATTR_PRIORITY);\r\n\t\telse if (stringcaseequal(dir, \"righttoleft\"))\r\n\t\t\tiDirection.set(BAR_RIGHTTOLEFT, TAG_ATTR_PRIORITY);\r\n\t\telse if (stringcaseequal(dir, \"toptobottom\"))\r\n\t\t\tiDirection.set(BAR_TOPTOBOTTOM, TAG_ATTR_PRIORITY);\r\n\t\telse if (stringcaseequal(dir, \"bottomtotop\"))\r\n\t\t\tiDirection.set(BAR_BOTTOMTOTOP, TAG_ATTR_PRIORITY);\r\n\t}\r\n\r\n\t\/\/ Image\r\n\tif (xmlPropExists(node, \"src\"))  {\r\n\t\tbmpBar.set(LoadGameImage(JoinPaths(xmlGetBaseURL(node), xmlGetString(node, \"src\"))), TAG_ATTR_PRIORITY);\r\n\t}\r\n\r\n\t\/\/ Bgcolor\r\n\tif (xmlPropExists(node, \"bgcolor\"))  {\r\n\t\tbgColor.set(xmlGetColour(node, \"bgcolor\", bgColor), TAG_ATTR_PRIORITY);\r\n\t}\r\n\r\n\t\/\/ Fore color\r\n\tif (xmlPropExists(node, \"color\"))  {\r\n\t\tforeColor.set(xmlGetColour(node, \"color\", foreColor), TAG_ATTR_PRIORITY);\r\n\t}\r\n\r\n\t\/\/ Position\r\n\tiPosition = CLAMP(xmlGetInt(node, \"progress\", iPosition), 0, 100);\r\n\r\n\t\/\/ States\r\n\tiNumForeStates = MAX(0, xmlGetInt(node, \"forestates\", 1));\r\n\tiNumBgStates = MAX(0, xmlGetInt(node, \"bgstates\", 1));\r\n\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ Get width of this bar\r\nint CProgressBar::CalculateWidth()\r\n{\r\n\tif (bmpBar.get().get()) {\r\n\t\tint numstates = iNumForeStates + iNumBgStates;\r\n\t\tswitch (iDirection)  {\r\n\t\tcase BAR_LEFTTORIGHT:\r\n\t\tcase BAR_RIGHTTOLEFT:\r\n\t\t\treturn bmpBar->w;\r\n\t\tcase BAR_TOPTOBOTTOM:\r\n\t\tcase BAR_BOTTOMTOTOP:\r\n\t\t\treturn (bmpBar->w-numstates)\/(numstates + 1);\r\n\t\tdefault:\r\n\t\t\treturn bmpBar->w;\r\n\t\t}\r\n\t} else {\r\n\t\treturn getWidth() > 0 ? getWidth() : 100;\r\n\t}\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ Get width of this bar\r\nint CProgressBar::CalculateHeight()\r\n{\r\n\tif (bmpBar.get().get()) {\r\n\t\tint numstates = iNumForeStates + iNumBgStates;\r\n\t\tswitch (iDirection)  {\r\n\t\tcase BAR_LEFTTORIGHT:\r\n\t\tcase BAR_RIGHTTOLEFT:\r\n\t\t\treturn (bmpBar->h-iNumForeStates)\/(numstates);\r\n\t\tcase BAR_TOPTOBOTTOM:\r\n\t\tcase BAR_BOTTOMTOTOP:\r\n\t\t\treturn bmpBar->h;\r\n\t\tdefault:\r\n\t\t\treturn bmpBar->h;\r\n\t\t}\r\n\t} else {\r\n\t\treturn getHeight() > 0 ? getHeight() : 10;\r\n\t}\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ Create event\r\nint CProgressBar::DoCreate()\r\n{\r\n\tCWidget::DoCreate();\r\n\tResize(getX(), getY(), CalculateWidth(), CalculateHeight());\r\n\r\n\treturn WID_PROCESSED;\r\n}\r\n\n}; \/\/ namespace SkinnedGUI\n<commit_msg>fix: CBar works incorrectly when direction is BottomToTop<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\r\n\/\/             OpenLieroX\r\n\/\/\r\n\/\/ code under LGPL, based on JasonBs work,\r\n\/\/ enhanced by Dark Charlie and Albert Zeyer\r\n\/\/\r\n\/\/\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n\r\n\/\/ CProgressBar source file\r\n\/\/ Created 22\/6\/07\r\n\/\/ Dark Charlie\r\n\r\n#include \"LieroX.h\"\r\n#include \"GfxPrimitives.h\"\r\n#include \"SkinnedGUI\/CProgressbar.h\"\r\n#include \"StringUtils.h\"\r\n#include \"MathLib.h\"\r\n#include \"XMLutils.h\"\r\n#include \"FindFile.h\"\r\n\r\n\r\nnamespace SkinnedGUI {\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ Constructor\r\nCProgressBar::CProgressBar(COMMON_PARAMS, int num_fore_states, int num_bg_states) :\r\nCWidget(name, parent)  {\r\n\tbmpBar.set(NULL, DEFAULT_PRIORITY);\r\n\tiDirection.set(BAR_LEFTTORIGHT, DEFAULT_PRIORITY);\r\n\tiPosition = 100;\r\n\tiNumForeStates = num_fore_states;\r\n\tiNumBgStates = num_bg_states;\r\n\tiCurrentForeState = 0;\r\n\tiCurrentBgState = 0;\r\n\r\n\t\/\/ Default colors\r\n\tbgColor.set(Color(128, 128, 128), DEFAULT_PRIORITY);\r\n\tforeColor.set(Color(0, 255, 0), DEFAULT_PRIORITY);\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ Set the progressbar position\r\nvoid CProgressBar::setPosition(int _p)\r\n{\r\n\tif (cLabel)\r\n\t\tcLabel->setText(itoa(_p));\r\n\tiPosition = _p;\r\n\tRepaint();\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ Set the current foreground state\r\nvoid CProgressBar::setCurrentForeState(int _s)\r\n{\r\n\tiCurrentForeState = MIN(iNumForeStates-1, _s);\r\n\tRepaint();\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ Set the current background state\r\nvoid CProgressBar::setCurrentBgState(int _s)\r\n{\r\n\tiCurrentBgState = MIN(iNumBgStates-1, _s);\r\n\tRepaint();\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ Draw the bar\r\nvoid CProgressBar::DoRepaint()\r\n{\r\n\tCHECK_BUFFER;\r\n\r\n\tstd::string progress = itoa(iPosition) + \" %\";\r\n\tint pos = CLAMP(iPosition, 0, 100);\r\n\r\n\t\/\/ In the bar image, there's the fully loaded image - it's always the first image starting at 0,0.\r\n\t\/\/ Then there can be unlimited number of states for various purposes\r\n\t\/\/ The last image is the background - fully unloaded image\r\n\r\n\tif (bmpBar.get().get())  {  \/\/ We got a bitmap - many options and possibilities for drawing\r\n\t\tint numstates = iNumForeStates + iNumBgStates;\r\n\r\n\t\tint bar_h = (bmpBar->h - iNumForeStates) \/ (numstates);\r\n\t\tint bar_w = (bmpBar->w - iNumForeStates) \/ (numstates);\r\n\r\n\t\tUint32 clLabel = cLabel ? cLabel->getColor().get(bmpBuffer) : SDL_MapRGB(bmpBuffer->format, 255, 255, 255);\r\n\t\t\r\n\t\t\/\/ Draw the progress bitmap over the background depending on progress direction\r\n\t\tint w, h;\r\n\t\tswitch (iDirection)  {\r\n\t\tcase BAR_LEFTTORIGHT:\r\n\t\t\t\/\/ Background\r\n\t\t\tDrawImageAdv(bmpBuffer.get(), bmpBar, 0, bar_h * (iNumForeStates + iCurrentBgState), 0, 0, bmpBar->w, bar_h);\r\n\r\n\t\t\tDrawImageAdv(bmpBuffer.get(), bmpBar, 0,  bar_h * iCurrentForeState, 0, 0, (bmpBar->w * pos) \/ 100, bar_h);  \/\/ Progress\r\n\t\t\tLOCK_OR_QUIT(bmpBar);\r\n\t\t\tclLabel = GetPixel(bmpBar.get().get(), MAX(0, (bmpBar->w*pos)\/100 - 1), bmpBar->h - iNumForeStates + iCurrentForeState);\r\n\t\t\tUnlockSurface(bmpBar);\r\n\t\t\tbreak;\r\n\t\tcase BAR_RIGHTTOLEFT:\r\n\t\t\t\/\/ Background\r\n\t\t\tDrawImageAdv(bmpBuffer.get(), bmpBar, 0, bar_h * (iNumForeStates + iCurrentBgState), 0, 0, bmpBar->w, bar_h);\r\n\r\n\t\t\tw = (bmpBar->w * pos) \/ 100;\r\n\t\t\tDrawImageAdv(bmpBuffer.get(), bmpBar, bmpBar->w - w,  bar_h * iCurrentForeState, bmpBar->w - w, 0, w, bar_h);  \/\/ Progress\r\n\t\t\tLOCK_OR_QUIT(bmpBar);\r\n\t\t\tclLabel = GetPixel(bmpBar.get().get(), MIN(bmpBar->w - 1, bmpBar->w - w + 1), bmpBar->h - iNumForeStates + iCurrentForeState);\r\n\t\t\tUnlockSurface(bmpBar);\r\n\t\t\tbreak;\r\n\t\tcase BAR_TOPTOBOTTOM: \r\n\t\t\t\/\/ Background\r\n\t\t\tDrawImageAdv(bmpBuffer.get(), bmpBar, bar_w * (iNumForeStates + iCurrentBgState), 0, 0, 0, bar_w, bmpBar->h); \/\/ The last image is the empty one\r\n\r\n\t\t\tDrawImageAdv(bmpBuffer.get(), bmpBar, bar_w * iCurrentForeState, 0, 0, 0, bar_w, (bmpBar->h \/ 100) * pos); \/\/ Progress\r\n\t\t\tLOCK_OR_QUIT(bmpBar);\r\n\t\t\tclLabel = GetPixel(bmpBar.get().get(), bmpBar->w - iNumForeStates + iCurrentForeState, MAX(0, (bmpBar->h * pos)\/100 - 1));\r\n\t\t\tUnlockSurface(bmpBar);\r\n\t\t\tbreak;\r\n\t\tcase BAR_BOTTOMTOTOP:\r\n\t\t\t\/\/ Background\r\n\t\t\tDrawImageAdv(bmpBuffer.get(), bmpBar, bar_w * (iNumForeStates + iCurrentBgState), 0, 0, 0, bar_w, bmpBar->h); \/\/ The last image is the empty one\r\n\r\n\t\t\th = (bmpBar->h * pos) \/ 100;\r\n\t\t\tDrawImageAdv(bmpBuffer.get(), bmpBar,  bar_w * iCurrentForeState, bmpBar->h - h, 0, bmpBar->h - h, bar_w, h);  \/\/ Progress\r\n\t\t\tLOCK_OR_QUIT(bmpBar);\r\n\t\t\tclLabel = GetPixel(bmpBar.get().get(), bmpBar->w - iNumForeStates + iCurrentForeState, MIN(bmpBar->h - 1, bmpBar->h - h - 1));\r\n\t\t\tUnlockSurface(bmpBar);\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n\t\t\tprintf(\"Bad bar type in CProgressBar::DoRepaint\");\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\t\/\/ Set the label color\r\n\t\tif (cLabel)\r\n\t\t\tcLabel->setColor(Color(bmpBuffer, clLabel));\r\n\r\n\t\t\r\n\t} else {  \/\/ No bitmap, just draw the simplest bar without any options\r\n\t\tDrawRectFill(bmpBuffer.get(), 0, 0, getWidth(), getHeight(), bgColor);\r\n\t\tDrawRectFill(bmpBuffer.get(), 1, 1, (getWidth() \/ 100) * pos + 1, getHeight() - 1, foreColor);\r\n\t}\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ Apply the given selector\r\nvoid CProgressBar::ApplySelector(const CSSParser::Selector& sel, const std::string& prefix)\r\n{\r\n\tCWidget::ApplySelector(sel, prefix);\r\n\r\n\tFOR_EACH_ATTRIBUTE(sel, it)  {\r\n\t\tif (it->getName() == prefix + \"direction\")  {\r\n\t\t\tif (stringcaseequal(it->getFirstValue().getString(), \"lefttoright\"))\r\n\t\t\t\tiDirection.set(BAR_LEFTTORIGHT, it->getPriority());\r\n\t\t\telse if (stringcaseequal(it->getFirstValue().getString(), \"righttoleft\"))\r\n\t\t\t\tiDirection.set(BAR_RIGHTTOLEFT, it->getPriority());\r\n\t\t\telse if (stringcaseequal(it->getFirstValue().getString(), \"toptobottom\"))\r\n\t\t\t\tiDirection.set(BAR_TOPTOBOTTOM, it->getPriority());\r\n\t\t\telse if (stringcaseequal(it->getFirstValue().getString(), \"bottomtotop\"))\r\n\t\t\t\tiDirection.set(BAR_BOTTOMTOTOP, it->getPriority());\r\n\t\t\telse\r\n\t\t\t\tprintf(\"Unknown bar direction in the CSS\\n\");\r\n\t\t} else if (it->getName() == prefix + \"image\")  {\r\n\t\t\tbmpBar.set(LoadGameImage(JoinPaths(sel.getBaseURL(), it->getFirstValue().getURL()), true), it->getPriority());\r\n\t\t} else if (it->getName() == prefix + \"background-color\")  {\r\n\t\t\tbgColor.set(it->getFirstValue().getColor(bgColor), it->getPriority());\r\n\t\t} else if (it->getName() == prefix + \"foreground-color\")  {\r\n\t\t\tforeColor.set(it->getFirstValue().getColor(foreColor), it->getPriority());\r\n\t\t}\r\n\t}\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ Apply the given node\r\nvoid CProgressBar::ApplyTag(xmlNodePtr node)\r\n{\r\n\tCWidget::ApplyTag(node);\r\n\r\n\t\/\/ Direction\r\n\tif (xmlPropExists(node, \"dir\"))  {\r\n\t\tstd::string dir = xmlGetString(node, \"dir\", \"lefttoright\");\r\n\t\tif (stringcaseequal(dir, \"lefttoright\"))\r\n\t\t\tiDirection.set(BAR_LEFTTORIGHT, TAG_ATTR_PRIORITY);\r\n\t\telse if (stringcaseequal(dir, \"righttoleft\"))\r\n\t\t\tiDirection.set(BAR_RIGHTTOLEFT, TAG_ATTR_PRIORITY);\r\n\t\telse if (stringcaseequal(dir, \"toptobottom\"))\r\n\t\t\tiDirection.set(BAR_TOPTOBOTTOM, TAG_ATTR_PRIORITY);\r\n\t\telse if (stringcaseequal(dir, \"bottomtotop\"))\r\n\t\t\tiDirection.set(BAR_BOTTOMTOTOP, TAG_ATTR_PRIORITY);\r\n\t}\r\n\r\n\t\/\/ Image\r\n\tif (xmlPropExists(node, \"src\"))  {\r\n\t\tbmpBar.set(LoadGameImage(JoinPaths(xmlGetBaseURL(node), xmlGetString(node, \"src\"))), TAG_ATTR_PRIORITY);\r\n\t}\r\n\r\n\t\/\/ Bgcolor\r\n\tif (xmlPropExists(node, \"bgcolor\"))  {\r\n\t\tbgColor.set(xmlGetColour(node, \"bgcolor\", bgColor), TAG_ATTR_PRIORITY);\r\n\t}\r\n\r\n\t\/\/ Fore color\r\n\tif (xmlPropExists(node, \"color\"))  {\r\n\t\tforeColor.set(xmlGetColour(node, \"color\", foreColor), TAG_ATTR_PRIORITY);\r\n\t}\r\n\r\n\t\/\/ Position\r\n\tiPosition = CLAMP(xmlGetInt(node, \"progress\", iPosition), 0, 100);\r\n\r\n\t\/\/ States\r\n\tiNumForeStates = MAX(0, xmlGetInt(node, \"forestates\", 1));\r\n\tiNumBgStates = MAX(0, xmlGetInt(node, \"bgstates\", 1));\r\n\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ Get width of this bar\r\nint CProgressBar::CalculateWidth()\r\n{\r\n\tif (bmpBar.get().get()) {\r\n\t\tint numstates = iNumForeStates + iNumBgStates;\r\n\t\tswitch (iDirection)  {\r\n\t\tcase BAR_LEFTTORIGHT:\r\n\t\tcase BAR_RIGHTTOLEFT:\r\n\t\t\treturn bmpBar->w;\r\n\t\tcase BAR_TOPTOBOTTOM:\r\n\t\tcase BAR_BOTTOMTOTOP:\r\n\t\t\treturn (bmpBar->w-numstates)\/(numstates + 1);\r\n\t\tdefault:\r\n\t\t\treturn bmpBar->w;\r\n\t\t}\r\n\t} else {\r\n\t\treturn getWidth() > 0 ? getWidth() : 100;\r\n\t}\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ Get width of this bar\r\nint CProgressBar::CalculateHeight()\r\n{\r\n\tif (bmpBar.get().get()) {\r\n\t\tint numstates = iNumForeStates + iNumBgStates;\r\n\t\tswitch (iDirection)  {\r\n\t\tcase BAR_LEFTTORIGHT:\r\n\t\tcase BAR_RIGHTTOLEFT:\r\n\t\t\treturn (bmpBar->h-iNumForeStates)\/(numstates);\r\n\t\tcase BAR_TOPTOBOTTOM:\r\n\t\tcase BAR_BOTTOMTOTOP:\r\n\t\t\treturn bmpBar->h;\r\n\t\tdefault:\r\n\t\t\treturn bmpBar->h;\r\n\t\t}\r\n\t} else {\r\n\t\treturn getHeight() > 0 ? getHeight() : 10;\r\n\t}\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ Create event\r\nint CProgressBar::DoCreate()\r\n{\r\n\tCWidget::DoCreate();\r\n\tResize(getX(), getY(), CalculateWidth(), CalculateHeight());\r\n\r\n\treturn WID_PROCESSED;\r\n}\r\n\r\n}; \/\/ namespace SkinnedGUI\r\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2010-2013 RethinkDB, all rights reserved.\n#include \"arch\/os_signal.hpp\"\n\n#include \"arch\/runtime\/thread_pool.hpp\"\n#include \"arch\/types.hpp\"\n#include \"do_on_thread.hpp\"\n\nos_signal_cond_t::os_signal_cond_t() :\n    source_pid(-1),\n    source_uid(-1),\n    source_signo(0)\n{\n    DEBUG_VAR thread_message_t *old = thread_pool_t::set_interrupt_message(this);\n    rassert(old == NULL);\n}\n\nos_signal_cond_t::~os_signal_cond_t() {\n    if (!is_pulsed()) {\n        DEBUG_VAR thread_message_t *old = thread_pool_t::set_interrupt_message(NULL);\n        rassert(old == this);\n    }\n}\n\nint os_signal_cond_t::get_source_signo() const {\n    return source_signo;\n}\n\npid_t os_signal_cond_t::get_source_pid() const {\n    return source_pid;\n}\n\nuid_t os_signal_cond_t::get_source_uid() const {\n    return source_uid;\n}\n\nvoid os_signal_cond_t::on_thread_switch() {\n    \/\/ KSI: There's probably an outside chance of a use-after-free bug here.\n    do_on_thread(home_thread(), std::bind(&os_signal_cond_t::pulse, this));\n}\n<commit_msg>Changed a KSI to a TODO.<commit_after>\/\/ Copyright 2010-2013 RethinkDB, all rights reserved.\n#include \"arch\/os_signal.hpp\"\n\n#include \"arch\/runtime\/thread_pool.hpp\"\n#include \"arch\/types.hpp\"\n#include \"do_on_thread.hpp\"\n\nos_signal_cond_t::os_signal_cond_t() :\n    source_pid(-1),\n    source_uid(-1),\n    source_signo(0)\n{\n    DEBUG_VAR thread_message_t *old = thread_pool_t::set_interrupt_message(this);\n    rassert(old == NULL);\n}\n\nos_signal_cond_t::~os_signal_cond_t() {\n    if (!is_pulsed()) {\n        DEBUG_VAR thread_message_t *old = thread_pool_t::set_interrupt_message(NULL);\n        rassert(old == this);\n    }\n}\n\nint os_signal_cond_t::get_source_signo() const {\n    return source_signo;\n}\n\npid_t os_signal_cond_t::get_source_pid() const {\n    return source_pid;\n}\n\nuid_t os_signal_cond_t::get_source_uid() const {\n    return source_uid;\n}\n\nvoid os_signal_cond_t::on_thread_switch() {\n    \/\/ TODO: There's probably an outside chance of a use-after-free bug here.\n    do_on_thread(home_thread(), std::bind(&os_signal_cond_t::pulse, this));\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 <boost\/tuple\/tuple.hpp>\n#include <hpp\/util\/debug.hh>\n#include <hpp\/pinocchio\/configuration.hh>\n#include <hpp\/pinocchio\/device.hh>\n#include <hpp\/core\/config-projector.hh>\n#include <hpp\/core\/bi-rrt-planner.hh>\n#include <hpp\/core\/node.hh>\n#include <hpp\/core\/edge.hh>\n#include <hpp\/core\/path.hh>\n#include <hpp\/core\/path-validation.hh>\n#include <hpp\/core\/problem.hh>\n#include <hpp\/core\/roadmap.hh>\n#include <hpp\/core\/steering-method.hh>\n#include <hpp\/core\/configuration-shooter.hh>\n\nnamespace hpp {\n  namespace core {\n    using pinocchio::displayConfig;\n\n    BiRRTPlannerPtr_t BiRRTPlanner::createWithRoadmap\n    (const Problem& problem, const RoadmapPtr_t& roadmap)\n    {\n      roadmap->clear();\n      BiRRTPlanner* ptr = new BiRRTPlanner (problem, roadmap);\n      return BiRRTPlannerPtr_t (ptr);\n    }\n\n    BiRRTPlannerPtr_t BiRRTPlanner::create (const Problem& problem)\n    {\n      BiRRTPlanner* ptr = new BiRRTPlanner (problem);\n      return BiRRTPlannerPtr_t (ptr);\n    }\n\n    BiRRTPlanner::BiRRTPlanner (const Problem& problem):\n      PathPlanner (problem),\n      configurationShooter_ (problem.configurationShooter()),\n      qProj_ (problem.robot ()->configSize ())\n    {\n    }\n\n    BiRRTPlanner::BiRRTPlanner (const Problem& problem, const RoadmapPtr_t& roadmap):\n      PathPlanner (problem, roadmap),\n      configurationShooter_ (problem.configurationShooter()),\n      qProj_ (problem.robot ()->configSize ())\n    {\n    }\n\n    void BiRRTPlanner::init (const BiRRTPlannerWkPtr_t& weak)\n    {\n      PathPlanner::init (weak);\n      weakPtr_ = weak;\n    }\n\n    PathPtr_t BiRRTPlanner::extendInternal (const SteeringMethodPtr_t& sm, Configuration_t& qProj_, const NodePtr_t& near,\n                    const ConfigurationPtr_t& target, bool reverse)\n    {\n        const ConstraintSetPtr_t& constraints (sm->constraints ());\n        if (constraints)\n        {\n            ConfigProjectorPtr_t configProjector (constraints->configProjector ());\n            if (configProjector)\n            {\n                configProjector->projectOnKernel (*(near->configuration ()), *target,\n                        qProj_);\n            }\n            else\n            {\n                qProj_ = *target;\n            }\n            if (constraints->apply (qProj_))\n            {\n                return reverse ? (*sm) (qProj_, *(near->configuration ())) : (*sm) (*(near->configuration ()), qProj_);\n            }\n            else\n            {\n                return PathPtr_t ();\n            }\n        }\n        return reverse ? (*sm) (*target, *(near->configuration ())) : (*sm) (*(near->configuration ()), *target);\n    }\n\n\n    \/\/\/ One step of extension.\n    void BiRRTPlanner::startSolve()\n    {\n        PathPlanner::startSolve();\n        startComponent_ = roadmap()->initNode()->connectedComponent();\n        for(NodeVector_t::const_iterator cit = roadmap()->goalNodes().begin();\n            cit != roadmap()->goalNodes().end(); ++cit)\n        {\n            endComponents_.push_back((*cit)->connectedComponent());\n        }\n    }\n\n    void BiRRTPlanner::oneStep ()\n    {\n        PathPtr_t validPath, path;\n        PathValidationPtr_t pathValidation (problem ().pathValidation ());\n        value_type distance;\n        NodePtr_t near, reachedNodeFromStart;\n        bool startComponentConnected(false), pathValidFromStart(false);\n        ConfigurationPtr_t q_new;\n        \/\/ first try to connect to start component\n        ConfigurationPtr_t q_rand = configurationShooter_->shoot ();\n        near = roadmap()->nearestNode (q_rand, startComponent_, distance);\n        path = extendInternal (problem().steeringMethod(), qProj_, near, q_rand);\n        if (path)\n        {\n            PathValidationReportPtr_t report;\n            pathValidFromStart = pathValidation->validate (path, false, validPath, report);\n            if(validPath){\n              \/\/ Insert new path to q_near in roadmap\n              value_type t_final = validPath->timeRange ().second;\n              if (t_final != path->timeRange ().first)\n              {\n                  startComponentConnected = true;\n                  q_new = ConfigurationPtr_t (new Configuration_t(validPath->end ()));\n                  reachedNodeFromStart = roadmap()->addNodeAndEdge(near, q_new, validPath);\n              }\n            }\n        }\n\n        \/\/ now try to connect to end components\n        for (std::vector<ConnectedComponentPtr_t>::const_iterator itcc =\n           endComponents_.begin ();\n         itcc != endComponents_.end (); ++itcc)\n        {\n            near = roadmap()->nearestNode (q_rand, *itcc, distance);\n            path = extendInternal (problem().steeringMethod(), qProj_, near, q_rand, true);\n            if (path)\n            {\n                PathValidationReportPtr_t report;\n                if(pathValidation->validate (path, true, validPath, report) && pathValidFromStart)\n                {\n                    \/\/ we won, a path is found\n                    roadmap()->addEdge(reachedNodeFromStart, near, validPath);\n                    return;\n                }\n                else if (validPath)\n                {\n                    value_type t_final = validPath->timeRange ().second;\n                    if (t_final != path->timeRange ().first)\n                    {\n                        ConfigurationPtr_t q_newEnd = ConfigurationPtr_t (new Configuration_t(validPath->initial()));\n                        NodePtr_t newNode = roadmap()->addNode (q_newEnd);\n                        roadmap()->addEdge(newNode, near, validPath);\n                        \/\/ now try to connect both nodes\n                        if(startComponentConnected)\n                        {\n                            path = (*(problem().steeringMethod())) (*q_new, *q_newEnd);\n                            if(path && pathValidation->validate (path, false, validPath, report))\n                            {\n                                roadmap()->addEdge (reachedNodeFromStart, newNode, path);\n                                return;\n                            }\n                        }\n                    }\n                }\n            }\n        }\n    }\n  } \/\/ namespace core\n} \/\/ namespace hpp\n<commit_msg>BiRRT-planner : correctly use reverse=True in nearestNode()<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 <boost\/tuple\/tuple.hpp>\n#include <hpp\/util\/debug.hh>\n#include <hpp\/pinocchio\/configuration.hh>\n#include <hpp\/pinocchio\/device.hh>\n#include <hpp\/core\/config-projector.hh>\n#include <hpp\/core\/bi-rrt-planner.hh>\n#include <hpp\/core\/node.hh>\n#include <hpp\/core\/edge.hh>\n#include <hpp\/core\/path.hh>\n#include <hpp\/core\/path-validation.hh>\n#include <hpp\/core\/problem.hh>\n#include <hpp\/core\/roadmap.hh>\n#include <hpp\/core\/steering-method.hh>\n#include <hpp\/core\/configuration-shooter.hh>\n\nnamespace hpp {\n  namespace core {\n    using pinocchio::displayConfig;\n\n    BiRRTPlannerPtr_t BiRRTPlanner::createWithRoadmap\n    (const Problem& problem, const RoadmapPtr_t& roadmap)\n    {\n      roadmap->clear();\n      BiRRTPlanner* ptr = new BiRRTPlanner (problem, roadmap);\n      return BiRRTPlannerPtr_t (ptr);\n    }\n\n    BiRRTPlannerPtr_t BiRRTPlanner::create (const Problem& problem)\n    {\n      BiRRTPlanner* ptr = new BiRRTPlanner (problem);\n      return BiRRTPlannerPtr_t (ptr);\n    }\n\n    BiRRTPlanner::BiRRTPlanner (const Problem& problem):\n      PathPlanner (problem),\n      configurationShooter_ (problem.configurationShooter()),\n      qProj_ (problem.robot ()->configSize ())\n    {\n    }\n\n    BiRRTPlanner::BiRRTPlanner (const Problem& problem, const RoadmapPtr_t& roadmap):\n      PathPlanner (problem, roadmap),\n      configurationShooter_ (problem.configurationShooter()),\n      qProj_ (problem.robot ()->configSize ())\n    {\n    }\n\n    void BiRRTPlanner::init (const BiRRTPlannerWkPtr_t& weak)\n    {\n      PathPlanner::init (weak);\n      weakPtr_ = weak;\n    }\n\n    PathPtr_t BiRRTPlanner::extendInternal (const SteeringMethodPtr_t& sm, Configuration_t& qProj_, const NodePtr_t& near,\n                    const ConfigurationPtr_t& target, bool reverse)\n    {\n        const ConstraintSetPtr_t& constraints (sm->constraints ());\n        if (constraints)\n        {\n            ConfigProjectorPtr_t configProjector (constraints->configProjector ());\n            if (configProjector)\n            {\n                configProjector->projectOnKernel (*(near->configuration ()), *target,\n                        qProj_);\n            }\n            else\n            {\n                qProj_ = *target;\n            }\n            if (constraints->apply (qProj_))\n            {\n                return reverse ? (*sm) (qProj_, *(near->configuration ())) : (*sm) (*(near->configuration ()), qProj_);\n            }\n            else\n            {\n                return PathPtr_t ();\n            }\n        }\n        return reverse ? (*sm) (*target, *(near->configuration ())) : (*sm) (*(near->configuration ()), *target);\n    }\n\n\n    \/\/\/ One step of extension.\n    void BiRRTPlanner::startSolve()\n    {\n        PathPlanner::startSolve();\n        startComponent_ = roadmap()->initNode()->connectedComponent();\n        for(NodeVector_t::const_iterator cit = roadmap()->goalNodes().begin();\n            cit != roadmap()->goalNodes().end(); ++cit)\n        {\n            endComponents_.push_back((*cit)->connectedComponent());\n        }\n    }\n\n    void BiRRTPlanner::oneStep ()\n    {\n        PathPtr_t validPath, path;\n        PathValidationPtr_t pathValidation (problem ().pathValidation ());\n        value_type distance;\n        NodePtr_t near, reachedNodeFromStart;\n        bool startComponentConnected(false), pathValidFromStart(false);\n        ConfigurationPtr_t q_new;\n        \/\/ first try to connect to start component\n        ConfigurationPtr_t q_rand = configurationShooter_->shoot ();\n        near = roadmap()->nearestNode (q_rand, startComponent_, distance);\n        path = extendInternal (problem().steeringMethod(), qProj_, near, q_rand);\n        if (path)\n        {\n            PathValidationReportPtr_t report;\n            pathValidFromStart = pathValidation->validate (path, false, validPath, report);\n            if(validPath){\n              \/\/ Insert new path to q_near in roadmap\n              value_type t_final = validPath->timeRange ().second;\n              if (t_final != path->timeRange ().first)\n              {\n                  startComponentConnected = true;\n                  q_new = ConfigurationPtr_t (new Configuration_t(validPath->end ()));\n                  reachedNodeFromStart = roadmap()->addNodeAndEdge(near, q_new, validPath);\n              }\n            }\n        }\n\n        \/\/ now try to connect to end components\n        for (std::vector<ConnectedComponentPtr_t>::const_iterator itcc =\n           endComponents_.begin ();\n         itcc != endComponents_.end (); ++itcc)\n        {\n            near = roadmap()->nearestNode (q_rand, *itcc, distance,true);\n            path = extendInternal (problem().steeringMethod(), qProj_, near, q_rand, true);\n            if (path)\n            {\n                PathValidationReportPtr_t report;\n                if(pathValidation->validate (path, true, validPath, report) && pathValidFromStart)\n                {\n                    \/\/ we won, a path is found\n                    roadmap()->addEdge(reachedNodeFromStart, near, validPath);\n                    return;\n                }\n                else if (validPath)\n                {\n                    value_type t_final = validPath->timeRange ().second;\n                    if (t_final != path->timeRange ().first)\n                    {\n                        ConfigurationPtr_t q_newEnd = ConfigurationPtr_t (new Configuration_t(validPath->initial()));\n                        NodePtr_t newNode = roadmap()->addNode (q_newEnd);\n                        roadmap()->addEdge(newNode, near, validPath);\n                        \/\/ now try to connect both nodes\n                        if(startComponentConnected)\n                        {\n                            path = (*(problem().steeringMethod())) (*q_new, *q_newEnd);\n                            if(path && pathValidation->validate (path, false, validPath, report))\n                            {\n                                roadmap()->addEdge (reachedNodeFromStart, newNode, path);\n                                return;\n                            }\n                        }\n                    }\n                }\n            }\n        }\n    }\n  } \/\/ namespace core\n} \/\/ namespace hpp\n<|endoftext|>"}
{"text":"<commit_before>#include \"includes.h\"\n\nnamespace fancy {\n  namespace bootstrap {\n\n    void init_file_class()\n    {\n      FileClass->def_class_method(\"open:modes:with:\", new NativeMethod(\"open:modes:with:\", class_method_File_open__modes__with, 3));\n      FileClass->def_class_method(\"open:modes:\", new NativeMethod(\"open:modes:\", class_method_File_open__modes, 2));\n      FileClass->def_method(\"write:\", new NativeMethod(\"write:\", method_File_write, 1));\n      FileClass->def_method(\"newline\", new NativeMethod(\"newline\", method_File_newline, 0));\n      FileClass->def_method(\"open?\", new NativeMethod(\"open?\", method_File_is_open, 0));\n      FileClass->def_method(\"close\", new NativeMethod(\"close\", method_File_close, 0));\n      FileClass->def_method(\"eof?\", new NativeMethod(\"eof?\", method_File_eof, 0));\n      FileClass->def_method(\"modes\", new NativeMethod(\"modes\", method_File_modes, 0));\n      FileClass->def_method(\"readln\", new NativeMethod(\"readln\", method_File_readln, 0));\n    }\n\n\n    \/**\n     * File class methods\n     *\/\n\n    FancyObject_p class_method_File_open__modes__with(FancyObject_p self, FancyObject_p *args, int argc, Scope *scope)\n    {\n      EXPECT_ARGS(\"File##open:modes:with:\", 3);\n      FancyObject_p arg1 = args[0];\n      FancyObject_p arg2 = args[1];\n      FancyObject_p arg3 = args[3];\n\n      if(!(IS_STRING(arg1) && IS_ARRAY(arg2) && IS_BLOCK(arg3))) {\n        errorln(\"File##open:modes:with: expects String, Array and Block value\");\n        return nil;\n      }\n  \n      string filename = dynamic_cast<String_p>(arg1)->value();\n      Array_p modes = dynamic_cast<Array_p>(arg2);\n      Block_p block = dynamic_cast<Block_p>(arg3);  \n      File_p file = new File(filename, modes); \n      file->open();\n\n      if(!file->good()) {\n        throw new IOError(\"Could not open file: \", filename, modes);\n      }\n      FancyObject_p call_args[1] = { file };\n      block->call(self, call_args, 1, scope);\n      file->close();\n      return nil;\n    }\n\n    FancyObject_p class_method_File_open__modes(FancyObject_p self, FancyObject_p *args, int argc, Scope *scope)\n    {\n      EXPECT_ARGS(\"File##open:modes:\", 2);\n      FancyObject_p arg1 = args[0];\n      FancyObject_p arg2 = args[1];\n  \n      if(!(IS_STRING(arg1) && IS_ARRAY(arg2))) {\n        errorln(\"File##open:modes: expects String and Array value\");\n        return nil;\n      }\n\n      string filename = dynamic_cast<String_p>(arg1)->value();\n      Array_p modes = dynamic_cast<Array_p>(arg2);\n      \/\/ FILE *f = fopen(filename.c_str(), mode.c_str());\n      File_p file = new File(filename, modes);\n      file->open();\n\n      if(!file->good()) {\n        throw new IOError(\"Could not open file: \", filename, modes);\n      }\n  \n      return file;\n    }\n\n\n    \/**\n     * File instance methods\n     *\/\n\n    FancyObject_p method_File_write(FancyObject_p self, FancyObject_p *args, int argc, Scope *scope)\n    {\n      EXPECT_ARGS(\"File#write:\", 1);\n      File_p file = dynamic_cast<File_p>(self);\n      if(file) {\n        \/\/ fprintf(file->file(), \"%s\", args.front()->to_s().c_str())\n        \/\/ fstream fs = file->file();\n        file->file() << args[0]->to_s();\n        file->file().flush();\n      }\n      return self;\n    }\n\n    FancyObject_p method_File_newline(FancyObject_p self, FancyObject_p *args, int argc, Scope *scope)\n    {\n      File_p file = dynamic_cast<File_p>(self);\n      if(file) {\n        \/\/ fprintf(file->file(), \"\\n\");\n        file->file() << endl;\n      }\n      return self;\n    }\n\n    FancyObject_p method_File_is_open(FancyObject_p self, FancyObject_p *args, int argc, Scope *scope)\n    {\n      File_p file = dynamic_cast<File_p>(self);\n      if(file) {\n        if(file->is_open())\n          return t;\n        return nil;\n      }\n      return nil;\n    }\n\n    FancyObject_p method_File_close(FancyObject_p self, FancyObject_p *args, int argc, Scope *scope)\n    {\n      File_p file = dynamic_cast<File_p>(self);\n      if(file) {\n        file->close();\n      }\n      return nil;\n    }\n\n    FancyObject_p method_File_eof(FancyObject_p self, FancyObject_p *args, int argc, Scope *scope)\n    {\n      File_p file = dynamic_cast<File_p>(self);\n      if(file && file->eof()) {\n          return t;\n      }\n      return nil;\n    }\n\n    FancyObject_p method_File_modes(FancyObject_p self, FancyObject_p *args, int argc, Scope *scope)\n    {\n      File_p file = dynamic_cast<File_p>(self);\n      if(file) {\n        return file->modes();\n      }\n      return new Array();\n    }\n\n    FancyObject_p method_File_readln(FancyObject_p self, FancyObject_p *args, int argc, Scope *scope)\n    {\n      File_p file = dynamic_cast<File_p>(self);\n      if(file && file->is_open()) {\n        string line;\n        getline(file->file(), line);\n        return new String(line);\n      }\n      return nil;\n    }\n\n  }\n}\n<commit_msg>fixed index typo in bootstrap\/file.cc<commit_after>#include \"includes.h\"\n\nnamespace fancy {\n  namespace bootstrap {\n\n    void init_file_class()\n    {\n      FileClass->def_class_method(\"open:modes:with:\", new NativeMethod(\"open:modes:with:\", class_method_File_open__modes__with, 3));\n      FileClass->def_class_method(\"open:modes:\", new NativeMethod(\"open:modes:\", class_method_File_open__modes, 2));\n      FileClass->def_method(\"write:\", new NativeMethod(\"write:\", method_File_write, 1));\n      FileClass->def_method(\"newline\", new NativeMethod(\"newline\", method_File_newline, 0));\n      FileClass->def_method(\"open?\", new NativeMethod(\"open?\", method_File_is_open, 0));\n      FileClass->def_method(\"close\", new NativeMethod(\"close\", method_File_close, 0));\n      FileClass->def_method(\"eof?\", new NativeMethod(\"eof?\", method_File_eof, 0));\n      FileClass->def_method(\"modes\", new NativeMethod(\"modes\", method_File_modes, 0));\n      FileClass->def_method(\"readln\", new NativeMethod(\"readln\", method_File_readln, 0));\n    }\n\n\n    \/**\n     * File class methods\n     *\/\n\n    FancyObject_p class_method_File_open__modes__with(FancyObject_p self, FancyObject_p *args, int argc, Scope *scope)\n    {\n      EXPECT_ARGS(\"File##open:modes:with:\", 3);\n      FancyObject_p arg1 = args[0];\n      FancyObject_p arg2 = args[1];\n      FancyObject_p arg3 = args[2];\n\n      if(!(IS_STRING(arg1) && IS_ARRAY(arg2) && IS_BLOCK(arg3))) {\n        errorln(\"File##open:modes:with: expects String, Array and Block value\");\n        return nil;\n      }\n  \n      string filename = dynamic_cast<String_p>(arg1)->value();\n      Array_p modes = dynamic_cast<Array_p>(arg2);\n      Block_p block = dynamic_cast<Block_p>(arg3);  \n      File_p file = new File(filename, modes); \n      file->open();\n\n      if(!file->good()) {\n        throw new IOError(\"Could not open file: \", filename, modes);\n      }\n      FancyObject_p call_args[1] = { file };\n      block->call(self, call_args, 1, scope);\n      file->close();\n      return nil;\n    }\n\n    FancyObject_p class_method_File_open__modes(FancyObject_p self, FancyObject_p *args, int argc, Scope *scope)\n    {\n      EXPECT_ARGS(\"File##open:modes:\", 2);\n      FancyObject_p arg1 = args[0];\n      FancyObject_p arg2 = args[1];\n  \n      if(!(IS_STRING(arg1) && IS_ARRAY(arg2))) {\n        errorln(\"File##open:modes: expects String and Array value\");\n        return nil;\n      }\n\n      string filename = dynamic_cast<String_p>(arg1)->value();\n      Array_p modes = dynamic_cast<Array_p>(arg2);\n      \/\/ FILE *f = fopen(filename.c_str(), mode.c_str());\n      File_p file = new File(filename, modes);\n      file->open();\n\n      if(!file->good()) {\n        throw new IOError(\"Could not open file: \", filename, modes);\n      }\n  \n      return file;\n    }\n\n\n    \/**\n     * File instance methods\n     *\/\n\n    FancyObject_p method_File_write(FancyObject_p self, FancyObject_p *args, int argc, Scope *scope)\n    {\n      EXPECT_ARGS(\"File#write:\", 1);\n      File_p file = dynamic_cast<File_p>(self);\n      if(file) {\n        \/\/ fprintf(file->file(), \"%s\", args.front()->to_s().c_str())\n        \/\/ fstream fs = file->file();\n        file->file() << args[0]->to_s();\n        file->file().flush();\n      }\n      return self;\n    }\n\n    FancyObject_p method_File_newline(FancyObject_p self, FancyObject_p *args, int argc, Scope *scope)\n    {\n      File_p file = dynamic_cast<File_p>(self);\n      if(file) {\n        \/\/ fprintf(file->file(), \"\\n\");\n        file->file() << endl;\n      }\n      return self;\n    }\n\n    FancyObject_p method_File_is_open(FancyObject_p self, FancyObject_p *args, int argc, Scope *scope)\n    {\n      File_p file = dynamic_cast<File_p>(self);\n      if(file) {\n        if(file->is_open())\n          return t;\n        return nil;\n      }\n      return nil;\n    }\n\n    FancyObject_p method_File_close(FancyObject_p self, FancyObject_p *args, int argc, Scope *scope)\n    {\n      File_p file = dynamic_cast<File_p>(self);\n      if(file) {\n        file->close();\n      }\n      return nil;\n    }\n\n    FancyObject_p method_File_eof(FancyObject_p self, FancyObject_p *args, int argc, Scope *scope)\n    {\n      File_p file = dynamic_cast<File_p>(self);\n      if(file && file->eof()) {\n          return t;\n      }\n      return nil;\n    }\n\n    FancyObject_p method_File_modes(FancyObject_p self, FancyObject_p *args, int argc, Scope *scope)\n    {\n      File_p file = dynamic_cast<File_p>(self);\n      if(file) {\n        return file->modes();\n      }\n      return new Array();\n    }\n\n    FancyObject_p method_File_readln(FancyObject_p self, FancyObject_p *args, int argc, Scope *scope)\n    {\n      File_p file = dynamic_cast<File_p>(self);\n      if(file && file->is_open()) {\n        string line;\n        getline(file->file(), line);\n        return new String(line);\n      }\n      return nil;\n    }\n\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * Created by Jian Chen\n * @since  2016.09.25\n * @author Jian Chen <admin@chensoft.com>\n * @link   http:\/\/chensoft.com\n *\/\n#ifdef __linux__\n\n#include <socket\/bsd\/bsd_epoll.hpp>\n#include <chen\/sys\/sys.hpp>\n#include <sys\/epoll.h>\n#include <unistd.h>\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ epoll\nchen::bsd::epoll::epoll()\n{\n    if ((this->_fd = ::epoll_create1(0)) < 0)\n        throw std::system_error(sys::error(), \"epoll: failed to create epoll\");\n\n    if (::pipe(this->_pp) < 0)\n    {\n        ::close(this->_fd);\n        throw std::system_error(sys::error(), \"epoll: failed to create pipe\");\n    }\n\n    \/\/ register pipe to receive exit message\n    this->add(this->_pp[0], Opcode::Read);\n}\n\nchen::bsd::epoll::~epoll()\n{\n    ::close(this->_fd);\n    ::close(this->_pp[0]);\n    ::close(this->_pp[1]);\n}\n\n\/\/ modify\nvoid chen::bsd::epoll::add(int fd, Opcode opcode, std::uint16_t flag)\n{\n    struct ::epoll_event event{};\n\n    event.events  = this->opcode(opcode) | EPOLLRDHUP;\n    event.data.fd = fd;\n\n    if (flag & FlagOnce)\n        event.events |= EPOLLONESHOT;\n\n    if (flag & FlagEdge)\n        event.events |= EPOLLET;\n\n    if (::epoll_ctl(this->_fd, EPOLL_CTL_ADD, fd, &event) < 0)\n        throw std::system_error(chen::sys::error(), \"epoll: failed to add event\");\n}\n\nvoid chen::bsd::epoll::del(int fd)\n{\n    if ((::epoll_ctl(this->_fd, EPOLL_CTL_DEL, fd, nullptr) < 0) && (errno != ENOENT))\n        throw std::system_error(chen::sys::error(), \"epoll: failed to delete event\");\n}\n\n\/\/ poll\nchen::bsd::epoll::Data chen::bsd::epoll::poll()\n{\n    struct ::epoll_event event{};\n\n    \/\/ poll next event\n    if (::epoll_wait(this->_fd, &event, 1, -1) <= 0)\n        throw std::system_error(sys::error(), \"epoll: failed to poll event\");\n\n    \/\/ check exit status\n    if (event.data.fd == this->_pp[0])\n    {\n        char dummy;\n        ::read(this->_pp[0], &dummy, 1);\n        return {};\n    }\n\n    \/\/ return the data\n    Data ret;\n\n    ret.fd = event.data.fd;\n    ret.ev = this->event(event.events);\n\n    return ret;\n}\n\nvoid chen::bsd::epoll::exit()\n{\n    \/\/ notify exit message via pipe\n    if (::write(this->_pp[1], \"\\n\", 1) != 1)\n        throw std::system_error(sys::error(), \"epoll: failed to exit the epoll\");\n}\n\n\/\/ misc\nstd::uint32_t chen::bsd::epoll::opcode(Opcode opcode)\n{\n    switch (opcode)\n    {\n        case Opcode::Read:\n            return EPOLLIN;\n\n        case Opcode::Write:\n            return EPOLLOUT;\n    }\n\n    return 0;\n}\n\nchen::bsd::epoll::Event chen::bsd::epoll::event(std::uint32_t events)\n{\n    if ((events & EPOLLRDHUP) || (events & EPOLLERR) || (events & EPOLLHUP))\n        return Event::End;\n\n    if (events & EPOLLIN)\n        return Event::Read;\n    else if (events & EPOLLOUT)\n        return Event::Write;\n    else\n        throw std::runtime_error(\"epoll: unknown event detect\");\n}\n\n#endif<commit_msg>epoll: treat remove non-exist fd as successful<commit_after>\/**\n * Created by Jian Chen\n * @since  2016.09.25\n * @author Jian Chen <admin@chensoft.com>\n * @link   http:\/\/chensoft.com\n *\/\n#ifdef __linux__\n\n#include <socket\/bsd\/bsd_epoll.hpp>\n#include <chen\/sys\/sys.hpp>\n#include <sys\/epoll.h>\n#include <unistd.h>\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ epoll\nchen::bsd::epoll::epoll()\n{\n    if ((this->_fd = ::epoll_create1(0)) < 0)\n        throw std::system_error(sys::error(), \"epoll: failed to create epoll\");\n\n    if (::pipe(this->_pp) < 0)\n    {\n        ::close(this->_fd);\n        throw std::system_error(sys::error(), \"epoll: failed to create pipe\");\n    }\n\n    \/\/ register pipe to receive exit message\n    this->add(this->_pp[0], Opcode::Read);\n}\n\nchen::bsd::epoll::~epoll()\n{\n    ::close(this->_fd);\n    ::close(this->_pp[0]);\n    ::close(this->_pp[1]);\n}\n\n\/\/ modify\nvoid chen::bsd::epoll::add(int fd, Opcode opcode, std::uint16_t flag)\n{\n    struct ::epoll_event event{};\n\n    event.events  = this->opcode(opcode) | EPOLLRDHUP;\n    event.data.fd = fd;\n\n    if (flag & FlagOnce)\n        event.events |= EPOLLONESHOT;\n\n    if (flag & FlagEdge)\n        event.events |= EPOLLET;\n\n    if (::epoll_ctl(this->_fd, EPOLL_CTL_ADD, fd, &event) < 0)\n        throw std::system_error(sys::error(), \"epoll: failed to add event\");\n}\n\nvoid chen::bsd::epoll::del(int fd)\n{\n    if ((::epoll_ctl(this->_fd, EPOLL_CTL_DEL, fd, nullptr) < 0) && (errno != ENOENT) && (errno != EBADF))\n        throw std::system_error(sys::error(), \"epoll: failed to delete event\");\n}\n\n\/\/ poll\nchen::bsd::epoll::Data chen::bsd::epoll::poll()\n{\n    struct ::epoll_event event{};\n\n    \/\/ poll next event\n    if (::epoll_wait(this->_fd, &event, 1, -1) <= 0)\n        throw std::system_error(sys::error(), \"epoll: failed to poll event\");\n\n    \/\/ check exit status\n    if (event.data.fd == this->_pp[0])\n    {\n        char dummy;\n        ::read(this->_pp[0], &dummy, 1);\n        return {};\n    }\n\n    \/\/ return the data\n    Data ret;\n\n    ret.fd = event.data.fd;\n    ret.ev = this->event(event.events);\n\n    return ret;\n}\n\nvoid chen::bsd::epoll::exit()\n{\n    \/\/ notify exit message via pipe\n    if (::write(this->_pp[1], \"\\n\", 1) != 1)\n        throw std::system_error(sys::error(), \"epoll: failed to exit the epoll\");\n}\n\n\/\/ misc\nstd::uint32_t chen::bsd::epoll::opcode(Opcode opcode)\n{\n    switch (opcode)\n    {\n        case Opcode::Read:\n            return EPOLLIN;\n\n        case Opcode::Write:\n            return EPOLLOUT;\n    }\n\n    return 0;\n}\n\nchen::bsd::epoll::Event chen::bsd::epoll::event(std::uint32_t events)\n{\n    if ((events & EPOLLRDHUP) || (events & EPOLLERR) || (events & EPOLLHUP))\n        return Event::End;\n\n    if (events & EPOLLIN)\n        return Event::Read;\n    else if (events & EPOLLOUT)\n        return Event::Write;\n    else\n        throw std::runtime_error(\"epoll: unknown event detect\");\n}\n\n#endif<|endoftext|>"}
{"text":"<commit_before>#ifndef _C4_YML_COMMON_HPP_\n#define _C4_YML_COMMON_HPP_\n\n#include <cstddef>\n#include <c4\/substr.hpp>\n\n#define RYML_INLINE inline\n\n#if defined(_MSC_VER)\n#   pragma warning(push)\n#   pragma warning(disable: 4068\/*unknown pragma*\/)\n#endif\n\n#pragma GCC diagnostic push\n#pragma GCC diagnostic ignored \"-Wunknown-pragmas\"\n#pragma GCC system_header\n\n#pragma clang diagnostic push\n#pragma clang diagnostic ignored \"-Wgnu-zero-variadic-macro-arguments\"\n\n\n#ifndef RYML_USE_ASSERT\n#   define RYML_USE_ASSERT C4_USE_ASSERT\n#endif\n\n\n#if RYML_USE_ASSERT\n#   define RYML_ASSERT(cond) RYML_CHECK(cond)\n#   define RYML_ASSERT_MSG(cond, \/*msg, *\/...) RYML_CHECK_MSG(cond, __VA_ARGS__)\n#else\n#   define RYML_ASSERT(cond)\n#   define RYML_ASSERT_MSG(cond, \/*msg, *\/...)\n#endif\n\n\n#ifndef RYML_DBG\n#   define RYML_CHECK(cond) if(!(cond)) { ::c4::yml::error(\"expected true: \" #cond); }\n#   define RYML_CHECK_MSG(cond, msg) if(!(cond)) { ::c4::yml::error(msg \": expected true: \" #cond); }\n#else\n#   define RYML_CHECK(cond)                             \\\n        if(!(cond))                                     \\\n        {                                               \\\n            if(c4::is_debugger_attached())              \\\n            {                                           \\\n                C4_DEBUG_BREAK();                       \\\n            }                                           \\\n            ::c4::yml::error(\"expected true: \" #cond);  \\\n        }\n#   define RYML_CHECK_MSG(cond, msg)                          \\\n        if(!(cond))                                           \\\n        {                                                     \\\n            if(c4::is_debugger_attached())                    \\\n            {                                                 \\\n                C4_DEBUG_BREAK();                             \\\n            }                                                 \\\n            ::c4::yml::error(msg \": expected true: \" #cond);  \\\n        }\n#endif\n\n\n#pragma clang diagnostic pop\n#pragma GCC diagnostic pop\n\n#if defined(_MSC_VER)\n#   pragma warning(pop)\n#endif\n\n\n\/\/-----------------------------------------------------------------------------\n\/\/-----------------------------------------------------------------------------\n\/\/-----------------------------------------------------------------------------\n\nnamespace c4 {\nnamespace yml {\n\n\/** a null position *\/\nenum : size_t { npos = size_t(-1) };\n\n\/** an index to none *\/\nenum : size_t { NONE = size_t(-1) };\n\n\/\/-----------------------------------------------------------------------------\n\/\/-----------------------------------------------------------------------------\n\/\/-----------------------------------------------------------------------------\n\n\/\/! holds a position into a source buffer\nstruct LineCol\n{\n    \/\/!< number of bytes from the beginning of the source buffer\n    size_t offset;\n    \/\/!< line\n    size_t line;\n    \/\/!< column\n    size_t col;\n\n    LineCol() : offset(), line(), col() {}\n    \/\/! construct from line and column\n    LineCol(size_t l, size_t c) : offset(0), line(l), col(c) {}\n    \/\/! construct from offset, line and column\n    LineCol(size_t o, size_t l, size_t c) : offset(o), line(l), col(c) {}\n};\n\n\n\/\/! a source file position\nstruct Location : public LineCol\n{\n    csubstr name;\n\n    operator bool () const { return !name.empty() || line != 0 || offset != 0; }\n\n    Location() : LineCol(), name() {}\n    Location(                     size_t l, size_t c) : LineCol{   l, c}, name( ) {}\n    Location(csubstr n,           size_t l, size_t c) : LineCol{   l, c}, name(n) {}\n    Location(csubstr n, size_t b, size_t l, size_t c) : LineCol{b, l, c}, name(n) {}\n    Location(const char *n,           size_t l, size_t c) : LineCol{   l, c}, name(to_csubstr(n)) {}\n    Location(const char *n, size_t b, size_t l, size_t c) : LineCol{b, l, c}, name(to_csubstr(n)) {}\n};\n\n\n\/\/-----------------------------------------------------------------------------\n\n\/** the type of the function used to report errors. This function must\n * interrupt execution, either by raising an exception or calling\n * std::terminate()\/std::abort(). *\/\nusing pfn_error = void (*)(const char* msg, size_t msg_len, Location location, void *user_data);\n\nvoid error(const char *msg, size_t msg_len, Location loc);\ninline void error(const char *msg, size_t msg_len)\n{\n    error(msg, msg_len, Location{});\n}\n\ntemplate<size_t N>\ninline void error(const char (&msg)[N], Location loc)\n{\n    error(msg, N-1, loc);\n}\ntemplate<size_t N>\ninline void error(const char (&msg)[N])\n{\n    error(msg, N-1, Location{});\n}\n\n\/\/-----------------------------------------------------------------------------\n\n\/** the type of the function used to allocate memory *\/\nusing pfn_allocate = void* (*)(size_t len, void* hint, void *user_data);\n\/** the type of the function used to free memory *\/\nusing pfn_free = void (*)(void* mem, size_t size, void *user_data);\n\n\/\/\/ a c-style callbacks class\nstruct Callbacks\n{\n    void *       m_user_data;\n    pfn_allocate m_allocate;\n    pfn_free     m_free;\n    pfn_error    m_error;\n\n    Callbacks();\n    Callbacks(void *user_data, pfn_allocate alloc, pfn_free free, pfn_error error_);\n\n    inline void* allocate(size_t len, void* hint) const\n    {\n        void* mem = m_allocate(len, hint, m_user_data);\n        if(mem == nullptr)\n        {\n            this->error(\"out of memory\", {});\n        }\n        return mem;\n    }\n\n    inline void free(void *mem, size_t len) const\n    {\n        m_free(mem, len, m_user_data);\n    }\n\n    void error(const char *msg, size_t msg_len, Location loc) const\n    {\n        m_error(msg, msg_len, loc, m_user_data);\n    }\n\n    void error(const char *msg, size_t msg_len) const\n    {\n        m_error(msg, msg_len, {}, m_user_data);\n    }\n\n    template<size_t N>\n    inline void error(const char (&msg)[N], Location loc) const\n    {\n        error(msg, N-1, loc);\n    }\n\n    template<size_t N>\n    inline void error(const char (&msg)[N]) const\n    {\n        error(msg, N-1, {});\n    }\n\n};\n\n\/\/\/ get the global callbacks\nCallbacks const& get_callbacks();\n\/\/\/ set the global callbacks\nvoid set_callbacks(Callbacks const& c);\n#ifdef RYML_NO_DEFAULT_CALLBACKS\n\/\/\/ set the global callbacks to their defaults\nvoid reset_callbacks();\n#endif\n\n\n\/\/-----------------------------------------------------------------------------\n\nclass MemoryResource\n{\npublic:\n\n    virtual ~MemoryResource() = default;\n\n    virtual void * allocate(size_t num_bytes, void *hint) = 0;\n    virtual void   free(void *mem, size_t num_bytes) = 0;\n};\n\n\/\/\/ set the global memory resource\nvoid set_memory_resource(MemoryResource *r);\n\/\/\/ get the global memory resource\nMemoryResource *get_memory_resource();\n\n\/\/-----------------------------------------------------------------------------\n\n\/\/ a memory resource adapter to the c-style allocator\nclass MemoryResourceCallbacks : public MemoryResource\n{\npublic:\n\n    Callbacks cb;\n\n    MemoryResourceCallbacks() : cb(get_callbacks()) {}\n    MemoryResourceCallbacks(Callbacks const& c) : cb(c) {}\n\n    void* allocate(size_t len, void* hint) override final\n    {\n        return cb.allocate(len, hint);\n    }\n\n    void free(void *mem, size_t len) override final\n    {\n        return cb.free(mem, len);\n    }\n};\n\n\/\/-----------------------------------------------------------------------------\n\n\/** an allocator is a lightweight non-owning handle to a memory resource *\/\nstruct Allocator\n{\n    MemoryResource *r;\n\n    Allocator() : r(get_memory_resource()) {}\n    Allocator(MemoryResource *m) : r(m) {}\n\n    inline void *allocate(size_t num_bytes, void *hint)\n    {\n        void *mem = r->allocate(num_bytes, hint);\n        if(mem == nullptr)\n        {\n            error(\"out of memory\");\n        }\n        return mem;\n    }\n\n    inline void free(void *mem, size_t num_bytes)\n    {\n        RYML_ASSERT(r != nullptr);\n        r->free(mem, num_bytes);\n    }\n};\n\n\n} \/\/ namespace yml\n} \/\/ namespace c4\n\n#endif \/* _C4_YML_COMMON_HPP_ *\/\n<commit_msg>make sure file:line is prefixed in triggered assertions<commit_after>#ifndef _C4_YML_COMMON_HPP_\n#define _C4_YML_COMMON_HPP_\n\n#include <cstddef>\n#include <c4\/substr.hpp>\n\n#define RYML_INLINE inline\n\n#if defined(_MSC_VER)\n#   pragma warning(push)\n#   pragma warning(disable: 4068\/*unknown pragma*\/)\n#endif\n\n#pragma GCC diagnostic push\n#pragma GCC diagnostic ignored \"-Wunknown-pragmas\"\n#pragma GCC system_header\n\n#pragma clang diagnostic push\n#pragma clang diagnostic ignored \"-Wgnu-zero-variadic-macro-arguments\"\n\n\n#ifndef RYML_USE_ASSERT\n#   define RYML_USE_ASSERT C4_USE_ASSERT\n#endif\n\n\n#if RYML_USE_ASSERT\n#   define RYML_ASSERT(cond) RYML_CHECK(cond)\n#   define RYML_ASSERT_MSG(cond, \/*msg, *\/...) RYML_CHECK_MSG(cond, __VA_ARGS__)\n#else\n#   define RYML_ASSERT(cond)\n#   define RYML_ASSERT_MSG(cond, \/*msg, *\/...)\n#endif\n\n\n#ifndef RYML_DBG\n#   define RYML_CHECK(cond) if(!(cond)) { ::c4::yml::error(\"ERROR: expected true: \" #cond); }\n#   define RYML_CHECK_MSG(cond, msg) if(!(cond)) { ::c4::yml::error(msg \": ERROR: expected true: \" #cond); }\n#else\n#   define RYML_CHECK(cond)                             \\\n        if(!(cond))                                     \\\n        {                                               \\\n            if(c4::is_debugger_attached())              \\\n            {                                           \\\n                C4_DEBUG_BREAK();                       \\\n            }                                           \\\n            ::c4::yml::error(__FILE__ \":\" C4_XQUOTE(__LINE__) \": ERROR: expected true: \" #cond);  \\\n        }\n#   define RYML_CHECK_MSG(cond, msg)                          \\\n        if(!(cond))                                           \\\n        {                                                     \\\n            if(c4::is_debugger_attached())                    \\\n            {                                                 \\\n                C4_DEBUG_BREAK();                             \\\n            }                                                 \\\n            ::c4::yml::error(__FILE__ \":\" C4_XQUOTE(__LINE__) \": ERROR: expected true: \" #cond \"\\n\" msg);  \\\n        }\n#endif\n\n\n#pragma clang diagnostic pop\n#pragma GCC diagnostic pop\n\n#if defined(_MSC_VER)\n#   pragma warning(pop)\n#endif\n\n\n\/\/-----------------------------------------------------------------------------\n\/\/-----------------------------------------------------------------------------\n\/\/-----------------------------------------------------------------------------\n\nnamespace c4 {\nnamespace yml {\n\n\/** a null position *\/\nenum : size_t { npos = size_t(-1) };\n\n\/** an index to none *\/\nenum : size_t { NONE = size_t(-1) };\n\n\/\/-----------------------------------------------------------------------------\n\/\/-----------------------------------------------------------------------------\n\/\/-----------------------------------------------------------------------------\n\n\/\/! holds a position into a source buffer\nstruct LineCol\n{\n    \/\/!< number of bytes from the beginning of the source buffer\n    size_t offset;\n    \/\/!< line\n    size_t line;\n    \/\/!< column\n    size_t col;\n\n    LineCol() : offset(), line(), col() {}\n    \/\/! construct from line and column\n    LineCol(size_t l, size_t c) : offset(0), line(l), col(c) {}\n    \/\/! construct from offset, line and column\n    LineCol(size_t o, size_t l, size_t c) : offset(o), line(l), col(c) {}\n};\n\n\n\/\/! a source file position\nstruct Location : public LineCol\n{\n    csubstr name;\n\n    operator bool () const { return !name.empty() || line != 0 || offset != 0; }\n\n    Location() : LineCol(), name() {}\n    Location(                     size_t l, size_t c) : LineCol{   l, c}, name( ) {}\n    Location(csubstr n,           size_t l, size_t c) : LineCol{   l, c}, name(n) {}\n    Location(csubstr n, size_t b, size_t l, size_t c) : LineCol{b, l, c}, name(n) {}\n    Location(const char *n,           size_t l, size_t c) : LineCol{   l, c}, name(to_csubstr(n)) {}\n    Location(const char *n, size_t b, size_t l, size_t c) : LineCol{b, l, c}, name(to_csubstr(n)) {}\n};\n\n\n\/\/-----------------------------------------------------------------------------\n\n\/** the type of the function used to report errors. This function must\n * interrupt execution, either by raising an exception or calling\n * std::terminate()\/std::abort(). *\/\nusing pfn_error = void (*)(const char* msg, size_t msg_len, Location location, void *user_data);\n\nvoid error(const char *msg, size_t msg_len, Location loc);\ninline void error(const char *msg, size_t msg_len)\n{\n    error(msg, msg_len, Location{});\n}\n\ntemplate<size_t N>\ninline void error(const char (&msg)[N], Location loc)\n{\n    error(msg, N-1, loc);\n}\ntemplate<size_t N>\ninline void error(const char (&msg)[N])\n{\n    error(msg, N-1, Location{});\n}\n\n\/\/-----------------------------------------------------------------------------\n\n\/** the type of the function used to allocate memory *\/\nusing pfn_allocate = void* (*)(size_t len, void* hint, void *user_data);\n\/** the type of the function used to free memory *\/\nusing pfn_free = void (*)(void* mem, size_t size, void *user_data);\n\n\/\/\/ a c-style callbacks class\nstruct Callbacks\n{\n    void *       m_user_data;\n    pfn_allocate m_allocate;\n    pfn_free     m_free;\n    pfn_error    m_error;\n\n    Callbacks();\n    Callbacks(void *user_data, pfn_allocate alloc, pfn_free free, pfn_error error_);\n\n    inline void* allocate(size_t len, void* hint) const\n    {\n        void* mem = m_allocate(len, hint, m_user_data);\n        if(mem == nullptr)\n        {\n            this->error(\"out of memory\", {});\n        }\n        return mem;\n    }\n\n    inline void free(void *mem, size_t len) const\n    {\n        m_free(mem, len, m_user_data);\n    }\n\n    void error(const char *msg, size_t msg_len, Location loc) const\n    {\n        m_error(msg, msg_len, loc, m_user_data);\n    }\n\n    void error(const char *msg, size_t msg_len) const\n    {\n        m_error(msg, msg_len, {}, m_user_data);\n    }\n\n    template<size_t N>\n    inline void error(const char (&msg)[N], Location loc) const\n    {\n        error(msg, N-1, loc);\n    }\n\n    template<size_t N>\n    inline void error(const char (&msg)[N]) const\n    {\n        error(msg, N-1, {});\n    }\n\n};\n\n\/\/\/ get the global callbacks\nCallbacks const& get_callbacks();\n\/\/\/ set the global callbacks\nvoid set_callbacks(Callbacks const& c);\n#ifdef RYML_NO_DEFAULT_CALLBACKS\n\/\/\/ set the global callbacks to their defaults\nvoid reset_callbacks();\n#endif\n\n\n\/\/-----------------------------------------------------------------------------\n\nclass MemoryResource\n{\npublic:\n\n    virtual ~MemoryResource() = default;\n\n    virtual void * allocate(size_t num_bytes, void *hint) = 0;\n    virtual void   free(void *mem, size_t num_bytes) = 0;\n};\n\n\/\/\/ set the global memory resource\nvoid set_memory_resource(MemoryResource *r);\n\/\/\/ get the global memory resource\nMemoryResource *get_memory_resource();\n\n\/\/-----------------------------------------------------------------------------\n\n\/\/ a memory resource adapter to the c-style allocator\nclass MemoryResourceCallbacks : public MemoryResource\n{\npublic:\n\n    Callbacks cb;\n\n    MemoryResourceCallbacks() : cb(get_callbacks()) {}\n    MemoryResourceCallbacks(Callbacks const& c) : cb(c) {}\n\n    void* allocate(size_t len, void* hint) override final\n    {\n        return cb.allocate(len, hint);\n    }\n\n    void free(void *mem, size_t len) override final\n    {\n        return cb.free(mem, len);\n    }\n};\n\n\/\/-----------------------------------------------------------------------------\n\n\/** an allocator is a lightweight non-owning handle to a memory resource *\/\nstruct Allocator\n{\n    MemoryResource *r;\n\n    Allocator() : r(get_memory_resource()) {}\n    Allocator(MemoryResource *m) : r(m) {}\n\n    inline void *allocate(size_t num_bytes, void *hint)\n    {\n        void *mem = r->allocate(num_bytes, hint);\n        if(mem == nullptr)\n        {\n            error(\"out of memory\");\n        }\n        return mem;\n    }\n\n    inline void free(void *mem, size_t num_bytes)\n    {\n        RYML_ASSERT(r != nullptr);\n        r->free(mem, num_bytes);\n    }\n};\n\n\n} \/\/ namespace yml\n} \/\/ namespace c4\n\n#endif \/* _C4_YML_COMMON_HPP_ *\/\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 <clientversion.h>\n\n#include <tinyformat.h>\n\n\n\/**\n * Name of client reported in the 'version' message. Report the same name\n * for both bitcoind and bitcoin-qt, to make it harder for attackers to\n * target servers or GUI users specifically.\n *\/\nconst std::string CLIENT_NAME(\"Satoshi\");\n\n\/**\n * Client version number\n *\/\n#define CLIENT_VERSION_SUFFIX \" Strider\"\n\n\n\/**\n * The following part of the code determines the CLIENT_BUILD variable.\n * Several mechanisms are used for this:\n * * first, if HAVE_BUILD_INFO is defined, include build.h, a file that is\n *   generated by the build environment, possibly containing the output\n *   of git-describe in a macro called BUILD_DESC\n * * secondly, if this is an exported version of the code, GIT_ARCHIVE will\n *   be defined (automatically using the export-subst git attribute), and\n *   GIT_COMMIT will contain the commit id.\n * * then, three options exist for determining CLIENT_BUILD:\n *   * if BUILD_DESC is defined, use that literally (output of git-describe)\n *   * if not, but GIT_COMMIT is defined, use v[maj].[min].[rev].[build]-g[commit]\n *   * otherwise, use v[maj].[min].[rev].[build]-unk\n * finally CLIENT_VERSION_SUFFIX is added\n *\/\n\n\/\/! First, include build.h if requested\n#ifdef HAVE_BUILD_INFO\n#include <obj\/build.h>\n#endif\n\n\/\/! git will put \"#define GIT_ARCHIVE 1\" on the next line inside archives. $Format:%n#define GIT_ARCHIVE 1$\n#ifdef GIT_ARCHIVE\n#define GIT_COMMIT_ID \"$Format:%h$\"\n#define GIT_COMMIT_DATE \"$Format:%cD$\"\n#endif\n\n#define BUILD_DESC_WITH_SUFFIX(maj, min, rev, build, suffix) \\\n    \"v\" DO_STRINGIZE(maj) \".\" DO_STRINGIZE(min) \".\" DO_STRINGIZE(rev) \".\" DO_STRINGIZE(build) \"-\" DO_STRINGIZE(suffix)\n\n#define BUILD_DESC_FROM_COMMIT(maj, min, rev, build, commit) \\\n    \"v\" DO_STRINGIZE(maj) \".\" DO_STRINGIZE(min) \".\" DO_STRINGIZE(rev) \".\" DO_STRINGIZE(build) \"-g\" commit\n\n#define BUILD_DESC_FROM_UNKNOWN(maj, min, rev, build) \\\n    \"v\" DO_STRINGIZE(maj) \".\" DO_STRINGIZE(min) \".\" DO_STRINGIZE(rev) \".\" DO_STRINGIZE(build) \"-unk\"\n\n#ifndef BUILD_DESC\n#ifdef BUILD_SUFFIX\n#define BUILD_DESC BUILD_DESC_WITH_SUFFIX(PEERCOIN_VERSION_MAJOR, PEERCOIN_VERSION_MINOR, PEERCOIN_VERSION_REVISION, PEERCOIN_VERSION_BUILD, BUILD_SUFFIX)\n#elif defined(GIT_COMMIT_ID)\n#define BUILD_DESC BUILD_DESC_FROM_COMMIT(PEERCOIN_VERSION_MAJOR, PEERCOIN_VERSION_MINOR, PEERCOIN_VERSION_REVISION, PEERCOIN_VERSION_BUILD, GIT_COMMIT_ID)\n#else\n#define BUILD_DESC BUILD_DESC_FROM_UNKNOWN(PEERCOIN_VERSION_MAJOR, PEERCOIN_VERSION_MINOR, PEERCOIN_VERSION_REVISION, PEERCOIN_VERSION_BUILD)\n#endif\n#endif\n\nconst std::string CLIENT_BUILD(BUILD_DESC CLIENT_VERSION_SUFFIX);\n\nstatic std::string FormatVersion(int nVersion)\n{\n    if (nVersion % 100 == 0)\n        return strprintf(\"%d.%d.%d\", nVersion \/ 1000000, (nVersion \/ 10000) % 100, (nVersion \/ 100) % 100);\n    else\n        return strprintf(\"%d.%d.%d.%d\", nVersion \/ 1000000, (nVersion \/ 10000) % 100, (nVersion \/ 100) % 100, nVersion % 100);\n}\n\nstd::string FormatFullVersion()\n{\n    return CLIENT_BUILD;\n}\n\n\/** \n * Format the subversion field according to BIP 14 spec (https:\/\/github.com\/bitcoin\/bips\/blob\/master\/bip-0014.mediawiki) \n *\/\nstd::string FormatSubVersion(const std::string& name, int nClientVersion, const std::vector<std::string>& comments)\n{\n    std::ostringstream ss;\n    ss << \"\/\";\n    ss << name << \":\" << FormatVersion(nClientVersion);\n    if (!comments.empty())\n    {\n        std::vector<std::string>::const_iterator it(comments.begin());\n        ss << \"(\" << *it;\n        for(++it; it != comments.end(); ++it)\n            ss << \"; \" << *it;\n        ss << \")\";\n    }\n    ss << \"\/\";\n    ss << \"Peercoin:\" << FormatVersion(PEERCOIN_VERSION);\n    ss << \"(\" << CLIENT_BUILD << \")\/\";\n    return ss.str();\n}\n<commit_msg>clientversion: Use full commit hash for commit-based version descriptions<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 <clientversion.h>\n\n#include <tinyformat.h>\n\n\n\/**\n * Name of client reported in the 'version' message. Report the same name\n * for both bitcoind and bitcoin-qt, to make it harder for attackers to\n * target servers or GUI users specifically.\n *\/\nconst std::string CLIENT_NAME(\"Satoshi\");\n\n\/**\n * Client version number\n *\/\n#define CLIENT_VERSION_SUFFIX \" Strider\"\n\n\n\/**\n * The following part of the code determines the CLIENT_BUILD variable.\n * Several mechanisms are used for this:\n * * first, if HAVE_BUILD_INFO is defined, include build.h, a file that is\n *   generated by the build environment, possibly containing the output\n *   of git-describe in a macro called BUILD_DESC\n * * secondly, if this is an exported version of the code, GIT_ARCHIVE will\n *   be defined (automatically using the export-subst git attribute), and\n *   GIT_COMMIT will contain the commit id.\n * * then, three options exist for determining CLIENT_BUILD:\n *   * if BUILD_DESC is defined, use that literally (output of git-describe)\n *   * if not, but GIT_COMMIT is defined, use v[maj].[min].[rev].[build]-g[commit]\n *   * otherwise, use v[maj].[min].[rev].[build]-unk\n * finally CLIENT_VERSION_SUFFIX is added\n *\/\n\n\/\/! First, include build.h if requested\n#ifdef HAVE_BUILD_INFO\n#include <obj\/build.h>\n#endif\n\n\/\/! git will put \"#define GIT_ARCHIVE 1\" on the next line inside archives. $Format:%n#define GIT_ARCHIVE 1$\n#ifdef GIT_ARCHIVE\n#define GIT_COMMIT_ID \"$Format:%H$\"\n#define GIT_COMMIT_DATE \"$Format:%cD$\"\n#endif\n\n#define BUILD_DESC_WITH_SUFFIX(maj, min, rev, build, suffix) \\\n    \"v\" DO_STRINGIZE(maj) \".\" DO_STRINGIZE(min) \".\" DO_STRINGIZE(rev) \".\" DO_STRINGIZE(build) \"-\" DO_STRINGIZE(suffix)\n\n#define BUILD_DESC_FROM_COMMIT(maj, min, rev, build, commit) \\\n    \"v\" DO_STRINGIZE(maj) \".\" DO_STRINGIZE(min) \".\" DO_STRINGIZE(rev) \".\" DO_STRINGIZE(build) \"-g\" commit\n\n#define BUILD_DESC_FROM_UNKNOWN(maj, min, rev, build) \\\n    \"v\" DO_STRINGIZE(maj) \".\" DO_STRINGIZE(min) \".\" DO_STRINGIZE(rev) \".\" DO_STRINGIZE(build) \"-unk\"\n\n#ifndef BUILD_DESC\n#ifdef BUILD_SUFFIX\n#define BUILD_DESC BUILD_DESC_WITH_SUFFIX(PEERCOIN_VERSION_MAJOR, PEERCOIN_VERSION_MINOR, PEERCOIN_VERSION_REVISION, PEERCOIN_VERSION_BUILD, BUILD_SUFFIX)\n#elif defined(GIT_COMMIT_ID)\n#define BUILD_DESC BUILD_DESC_FROM_COMMIT(PEERCOIN_VERSION_MAJOR, PEERCOIN_VERSION_MINOR, PEERCOIN_VERSION_REVISION, PEERCOIN_VERSION_BUILD, GIT_COMMIT_ID)\n#else\n#define BUILD_DESC BUILD_DESC_FROM_UNKNOWN(PEERCOIN_VERSION_MAJOR, PEERCOIN_VERSION_MINOR, PEERCOIN_VERSION_REVISION, PEERCOIN_VERSION_BUILD)\n#endif\n#endif\n\nconst std::string CLIENT_BUILD(BUILD_DESC CLIENT_VERSION_SUFFIX);\n\nstatic std::string FormatVersion(int nVersion)\n{\n    if (nVersion % 100 == 0)\n        return strprintf(\"%d.%d.%d\", nVersion \/ 1000000, (nVersion \/ 10000) % 100, (nVersion \/ 100) % 100);\n    else\n        return strprintf(\"%d.%d.%d.%d\", nVersion \/ 1000000, (nVersion \/ 10000) % 100, (nVersion \/ 100) % 100, nVersion % 100);\n}\n\nstd::string FormatFullVersion()\n{\n    return CLIENT_BUILD;\n}\n\n\/** \n * Format the subversion field according to BIP 14 spec (https:\/\/github.com\/bitcoin\/bips\/blob\/master\/bip-0014.mediawiki) \n *\/\nstd::string FormatSubVersion(const std::string& name, int nClientVersion, const std::vector<std::string>& comments)\n{\n    std::ostringstream ss;\n    ss << \"\/\";\n    ss << name << \":\" << FormatVersion(nClientVersion);\n    if (!comments.empty())\n    {\n        std::vector<std::string>::const_iterator it(comments.begin());\n        ss << \"(\" << *it;\n        for(++it; it != comments.end(); ++it)\n            ss << \"; \" << *it;\n        ss << \")\";\n    }\n    ss << \"\/\";\n    ss << \"Peercoin:\" << FormatVersion(PEERCOIN_VERSION);\n    ss << \"(\" << CLIENT_BUILD << \")\/\";\n    return ss.str();\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 <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\/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 \"common.h\"\n#include \"PackedExample.h\"\n\nusing namespace fnord;\n\nint main(int argc, const char** argv) {\n  fnord::Application::init();\n  fnord::Application::logToStderr();\n\n  fnord::cli::FlagParser flags;\n\n  flags.defineFlag(\n      \"input_meta\",\n      fnord::cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"read selected features from file\",\n      \"<filename>\");\n\n  flags.defineFlag(\n      \"output_lightsvm\",\n      fnord::cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"output lightsvm data\",\n      \"<filename>\");\n\n  flags.defineFlag(\n      \"output_mm_labels\",\n      fnord::cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"output matrix market labels\",\n      \"<filename>\");\n\n  flags.defineFlag(\n      \"output_mm_features\",\n      fnord::cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"output matrix market features\",\n      \"<filename>\");\n\n  flags.defineFlag(\n      \"output_meta\",\n      fnord::cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"output feature metadata\",\n      \"<filename>\");\n\n  flags.defineFlag(\n      \"min_observations\",\n      fnord::cli::FlagParser::T_INTEGER,\n      false,\n      NULL,\n      \"100\",\n      \"minimum nuber of feature observations\",\n      \"<num>\");\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 sstables = flags.getArgv();\n  auto tbl_cnt = sstables.size();\n  if (tbl_cnt == 0) {\n    fnord::logCritical(\"cm.featuredump\", \"No input tables, exiting\");\n    return 1;\n  }\n\n  \/* open output: meta file *\/\n  Option<File> output_meta_file;\n  String output_meta_file_path;\n\n  if (flags.isSet(\"output_meta\")) {\n    output_meta_file_path = flags.getString(\"output_meta\");\n\n    fnord::logInfo(\n        \"cm.featureprep\",\n        \"Writing feature metadata to: $0\",\n        output_meta_file_path);\n\n    output_meta_file = std::move(Option<File>(std::move(\n        File::openFile(\n            output_meta_file_path + \"~\",\n            File::O_WRITE | File::O_CREATEOROPEN | File::O_TRUNCATE))));\n  }\n\n  \/* open output: lightsvm file *\/\n  Option<File> output_lightsvm_file;\n  String output_lightsvm_file_path;\n\n  if (flags.isSet(\"output_lightsvm\")) {\n    output_lightsvm_file_path = flags.getString(\"output_lightsvm\");\n\n    fnord::logInfo(\n        \"cm.featureprep\",\n        \"Writing lightSVM features to: $0\",\n        output_lightsvm_file_path);\n\n    output_lightsvm_file = std::move(Option<File>(std::move(\n        File::openFile(\n            output_lightsvm_file_path + \"~\",\n            File::O_WRITE | File::O_CREATEOROPEN | File::O_TRUNCATE))));\n  }\n\n  \/* open output: matrix market labels file *\/\n  Option<File> output_mm_labels_file;\n  String output_mm_labels_file_path;\n\n  if (flags.isSet(\"output_mm_labels\")) {\n    output_mm_labels_file_path = flags.getString(\"output_mm_labels\");\n\n    fnord::logInfo(\n        \"cm.featureprep\",\n        \"Writing matrix market labels to $0\",\n        output_mm_labels_file_path);\n\n    output_mm_labels_file = std::move(Option<File>(std::move(\n        File::openFile(\n            output_mm_labels_file_path + \"~\",\n            File::O_WRITE | File::O_CREATEOROPEN | File::O_TRUNCATE))));\n  }\n\n  \/* open output: matrix market features file *\/\n  Option<File> output_mm_features_file;\n  String output_mm_features_file_path;\n\n  if (flags.isSet(\"output_mm_features\")) {\n    output_mm_features_file_path = flags.getString(\"output_mm_features\");\n\n    fnord::logInfo(\n        \"cm.featureprep\",\n        \"Writing matrix market features to $0\",\n        output_mm_features_file_path);\n\n    output_mm_features_file = std::move(Option<File>(std::move(\n        File::openFile(\n            output_mm_features_file_path + \"~\",\n            File::O_WRITE | File::O_CREATEOROPEN | File::O_TRUNCATE))));\n  }\n\n\n  \/* select features \/ build or load feature idx *\/\n  HashMap<String, uint64_t> feature_idx;\n  size_t orig_count = 0;\n  if (flags.isSet(\"input_meta\")) {\n    \/\/ FIXPAUL slow slow slow\n    auto buf = FileUtil::read(flags.getString(\"input_meta\"));\n    auto lines = StringUtil::split(buf.toString(), \"\\n\");\n\n    for (const auto& line : lines) {\n      auto parts = StringUtil::split(line, \" \");\n\n      if (parts.size() != 2) {\n        RAISEF(kRuntimeError, \"invalid feature meta file line: $0\", line);\n      }\n\n      feature_idx[parts[1]] = std::stoul(parts[0]);\n    }\n  } else {\n    \/* read input meta tables and count features *\/\n    HashMap<String, uint64_t> feature_counts;\n    int row_idx = 0;\n    for (int tbl_idx = 0; tbl_idx < sstables.size(); ++tbl_idx) {\n      String sstable = sstables[tbl_idx];\n      StringUtil::replaceAll(&sstable, \".sstable\", \"_meta.sstable\");\n      fnord::logInfo(\"cm.featuredump\", \"Importing meta sstable: $0\", sstable);\n\n      \/* read sstable heade r*\/\n      sstable::SSTableReader reader(File::openFile(sstable, File::O_READ));\n      sstable::SSTableColumnSchema schema;\n      schema.loadIndex(&reader);\n\n      if (reader.bodySize() == 0) {\n        fnord::logCritical(\"cm.featuredump\", \"unfinished sstable: $0\", sstable);\n        exit(1);\n      }\n\n      \/* get sstable cursor *\/\n      auto cursor = reader.getCursor();\n      auto body_size = reader.bodySize();\n\n      \/* status line *\/\n      util::SimpleRateLimitedFn status_line(kMicrosPerSecond, [&] () {\n        auto p = (tbl_idx \/ (double) tbl_cnt) +\n            ((cursor->position() \/ (double) body_size)) \/ (double) tbl_cnt;\n\n        fnord::logInfo(\n            \"cm.featuredump\",\n            \"[$0%] Reading meta sstables... rows=$1 features=$2\",\n            (size_t) (p * 100),\n            row_idx,\n            feature_counts.size());\n      });\n\n      \/* read sstable rows *\/\n      for (; cursor->valid(); ++row_idx) {\n        status_line.runMaybe();\n\n        auto key = cursor->getKeyString();\n        auto val = cursor->getDataBuffer();\n\n        sstable::SSTableColumnReader cols(&schema, val);\n        auto cnt = cols.getUInt64Column(schema.columnID(\"views\"));\n\n        feature_counts[key] += cnt;\n\n        if (!cursor->next()) {\n          break;\n        }\n      }\n\n      status_line.runForce();\n    }\n\n    \/* select features for export and assign indexes*\/\n    uint64_t cur_idx = 0;\n    orig_count = feature_counts.size();\n    auto min_count = flags.getInt(\"min_observations\");\n    for (auto iter = feature_counts.begin(); iter != feature_counts.end(); ) {\n      if (iter->second > min_count) {\n        feature_idx.emplace(iter->first, ++cur_idx);\n      }\n\n      iter = feature_counts.erase(iter);\n    }\n  }\n\n  fnord::logInfo(\n      \"cm.featuredump\",\n      \"Exporting $1\/$0 features\",\n      orig_count,\n      feature_idx.size());\n\n  \/* write feature idx meta file *\/\n  if (!output_meta_file.isEmpty()) {\n    for (const auto& f : feature_idx) {\n      auto line = StringUtil::format(\"$1 $0\\n\", f.first, f.second);\n      output_meta_file.get().write(line);\n    }\n  }\n\n  \/* read input data tables *\/\n  int rows_read = 0;\n  int rows_written = 0;\n  int features_written = 0;\n  for (int tbl_idx = 0; tbl_idx < sstables.size(); ++tbl_idx) {\n    const auto& sstable = sstables[tbl_idx];\n    fnord::logInfo(\"cm.featuredump\", \"Importing data sstable: $0\", sstable);\n\n    \/* read sstable heade r*\/\n    sstable::SSTableReader reader(File::openFile(sstable, File::O_READ));\n    sstable::SSTableColumnSchema schema;\n    schema.loadIndex(&reader);\n\n    if (reader.bodySize() == 0) {\n      fnord::logCritical(\"cm.featuredump\", \"unfinished sstable: $0\", sstable);\n      exit(1);\n    }\n\n    \/* get sstable cursor *\/\n    auto cursor = reader.getCursor();\n    auto body_size = reader.bodySize();\n\n    \/* status line *\/\n    util::SimpleRateLimitedFn status_line(kMicrosPerSecond, [&] () {\n      auto p = (tbl_idx \/ (double) tbl_cnt) +\n          ((cursor->position() \/ (double) body_size)) \/ (double) tbl_cnt;\n\n      fnord::logInfo(\n          \"cm.featuredump\",\n          \"[$0%] Dumping features... rows_read=$1 rows_written=$2\",\n          (size_t) (p * 100),\n          rows_read,\n          rows_written);\n    });\n\n    \/* read data sstables and copy features *\/\n    for (; cursor->valid(); ++rows_read) {\n      status_line.runMaybe();\n\n      auto val = cursor->getDataBuffer();\n      sstable::SSTableColumnReader cols(&schema, val);\n\n      cm::Example ex;\n#ifndef FNORD_NODEBUG\n      Set<String> dbg_features;\n#endif\n      ex.label = cols.getFloatColumn(schema.columnID(\"label\"));\n      auto features = cols.getStringColumns(schema.columnID(\"feature\"));\n      for (const auto& f : features) {\n        auto idx = feature_idx.find(f);\n        if (idx == feature_idx.end()) {\n          continue;\n        }\n\n#ifndef FNORD_NODEBUG\n        dbg_features.emplace(f);\n#endif\n\n        ex.features.emplace_back(idx->second, 1.0);\n      }\n\n      if (ex.features.size() > 0) {\n        ++rows_written;\n        features_written += ex.features.size();\n\n#ifndef FNORD_NOTRACE\n        fnord::logTrace(\n            \"cm.featuredump\",\n            \"Dumping example: label=$0 features=$1\",\n            ex.label,\n            inspect(dbg_features));\n#endif\n\n        if (!output_lightsvm_file.isEmpty()) {\n          auto ex_str = exampleToSVMLight(ex);\n          output_lightsvm_file.get().write(ex_str + \"\\n\");\n        }\n\n        if (!output_mm_labels_file.isEmpty()) {\n          auto line = StringUtil::format(\"$0\\n\", ex.label);\n          output_mm_labels_file.get().write(line);\n        }\n\n        if (!output_mm_features_file.isEmpty()) {\n          String lines;\n          ex.sortFeatures();\n          for (const auto& f : ex.features) {\n            lines += StringUtil::format(\n                \"$0 $1 $2\\n\",\n                rows_written,\n                f.first,\n                f.second);\n          }\n          output_mm_features_file.get().write(lines);\n        }\n      }\n\n      if (!cursor->next()) {\n        break;\n      }\n    }\n\n    status_line.runForce();\n  }\n\n  if (!output_meta_file.isEmpty()) {\n    FileUtil::mv(output_meta_file_path + \"~\", output_meta_file_path);\n  }\n\n  if (!output_lightsvm_file.isEmpty()) {\n    FileUtil::mv(output_lightsvm_file_path + \"~\", output_lightsvm_file_path);\n  }\n\n  if (!output_mm_labels_file.isEmpty()) {\n    auto tmpfile = File::openFile(\n        output_mm_labels_file_path + \"~~\",\n        File::O_READ | File::O_WRITE | File::O_CREATEOROPEN | File::O_TRUNCATE);\n\n    tmpfile.write(StringUtil::format(\n        \"%%MatrixMarket matrix array real general\\n$0 1\\n\",\n        rows_written));\n\n    FileUtil::cat(\n        output_mm_labels_file_path + \"~\",\n        output_mm_labels_file_path + \"~~\");\n\n    FileUtil::mv(output_mm_labels_file_path + \"~~\", output_mm_labels_file_path);\n    FileUtil::rm(output_mm_labels_file_path + \"~\");\n  }\n\n  if (!output_mm_features_file.isEmpty()) {\n    auto tmpfile = File::openFile(\n        output_mm_features_file_path + \"~~\",\n        File::O_READ | File::O_WRITE | File::O_CREATEOROPEN | File::O_TRUNCATE);\n\n    tmpfile.write(StringUtil::format(\n        \"%%MatrixMarket matrix coordinate real general\\n$0 $1 $2\\n\",\n        rows_written,\n        feature_idx.size(),\n        features_written));\n\n    FileUtil::cat(\n        output_mm_features_file_path + \"~\",\n        output_mm_features_file_path + \"~~\");\n\n    FileUtil::mv(output_mm_features_file_path + \"~~\", output_mm_features_file_path);\n    FileUtil::rm(output_mm_features_file_path + \"~\");\n  }\n\n  return 0;\n}\n\n<commit_msg>fixes<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\/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 \"common.h\"\n#include \"PackedExample.h\"\n\nusing namespace fnord;\n\nint main(int argc, const char** argv) {\n  fnord::Application::init();\n  fnord::Application::logToStderr();\n\n  fnord::cli::FlagParser flags;\n\n  flags.defineFlag(\n      \"input_meta\",\n      fnord::cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"read selected features from file\",\n      \"<filename>\");\n\n  flags.defineFlag(\n      \"output_lightsvm\",\n      fnord::cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"output lightsvm data\",\n      \"<filename>\");\n\n  flags.defineFlag(\n      \"output_mm_labels\",\n      fnord::cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"output matrix market labels\",\n      \"<filename>\");\n\n  flags.defineFlag(\n      \"output_mm_features\",\n      fnord::cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"output matrix market features\",\n      \"<filename>\");\n\n  flags.defineFlag(\n      \"output_meta\",\n      fnord::cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"output feature metadata\",\n      \"<filename>\");\n\n  flags.defineFlag(\n      \"min_observations\",\n      fnord::cli::FlagParser::T_INTEGER,\n      false,\n      NULL,\n      \"100\",\n      \"minimum nuber of feature observations\",\n      \"<num>\");\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 sstables = flags.getArgv();\n  auto tbl_cnt = sstables.size();\n  if (tbl_cnt == 0) {\n    fnord::logCritical(\"cm.featuredump\", \"No input tables, exiting\");\n    return 1;\n  }\n\n  \/* open output: meta file *\/\n  Option<File> output_meta_file;\n  String output_meta_file_path;\n\n  if (flags.isSet(\"output_meta\")) {\n    output_meta_file_path = flags.getString(\"output_meta\");\n\n    fnord::logInfo(\n        \"cm.featureprep\",\n        \"Writing feature metadata to: $0\",\n        output_meta_file_path);\n\n    output_meta_file = std::move(Option<File>(std::move(\n        File::openFile(\n            output_meta_file_path + \"~\",\n            File::O_WRITE | File::O_CREATEOROPEN | File::O_TRUNCATE))));\n  }\n\n  \/* open output: lightsvm file *\/\n  Option<File> output_lightsvm_file;\n  String output_lightsvm_file_path;\n\n  if (flags.isSet(\"output_lightsvm\")) {\n    output_lightsvm_file_path = flags.getString(\"output_lightsvm\");\n\n    fnord::logInfo(\n        \"cm.featureprep\",\n        \"Writing lightSVM features to: $0\",\n        output_lightsvm_file_path);\n\n    output_lightsvm_file = std::move(Option<File>(std::move(\n        File::openFile(\n            output_lightsvm_file_path + \"~\",\n            File::O_WRITE | File::O_CREATEOROPEN | File::O_TRUNCATE))));\n  }\n\n  \/* open output: matrix market labels file *\/\n  Option<File> output_mm_labels_file;\n  String output_mm_labels_file_path;\n\n  if (flags.isSet(\"output_mm_labels\")) {\n    output_mm_labels_file_path = flags.getString(\"output_mm_labels\");\n\n    fnord::logInfo(\n        \"cm.featureprep\",\n        \"Writing matrix market labels to $0\",\n        output_mm_labels_file_path);\n\n    output_mm_labels_file = std::move(Option<File>(std::move(\n        File::openFile(\n            output_mm_labels_file_path + \"~\",\n            File::O_WRITE | File::O_CREATEOROPEN | File::O_TRUNCATE))));\n  }\n\n  \/* open output: matrix market features file *\/\n  Option<File> output_mm_features_file;\n  String output_mm_features_file_path;\n\n  if (flags.isSet(\"output_mm_features\")) {\n    output_mm_features_file_path = flags.getString(\"output_mm_features\");\n\n    fnord::logInfo(\n        \"cm.featureprep\",\n        \"Writing matrix market features to $0\",\n        output_mm_features_file_path);\n\n    output_mm_features_file = std::move(Option<File>(std::move(\n        File::openFile(\n            output_mm_features_file_path + \"~\",\n            File::O_WRITE | File::O_CREATEOROPEN | File::O_TRUNCATE))));\n  }\n\n\n  \/* select features \/ build or load feature idx *\/\n  HashMap<String, uint64_t> feature_idx;\n  size_t orig_count = 0;\n  if (flags.isSet(\"input_meta\")) {\n    \/\/ FIXPAUL slow slow slow\n    auto buf = FileUtil::read(flags.getString(\"input_meta\"));\n    auto lines = StringUtil::split(buf.toString(), \"\\n\");\n\n    for (const auto& line : lines) {\n      if (line.length() < 3) {\n        continue;\n      }\n\n      auto parts = StringUtil::split(line, \" \");\n\n      if (parts.size() != 2) {\n        RAISEF(kRuntimeError, \"invalid feature meta file line: $0\", line);\n      }\n\n      feature_idx[parts[1]] = std::stoul(parts[0]);\n    }\n\n    orig_count = feature_idx.size();\n  } else {\n    \/* read input meta tables and count features *\/\n    HashMap<String, uint64_t> feature_counts;\n    int row_idx = 0;\n    for (int tbl_idx = 0; tbl_idx < sstables.size(); ++tbl_idx) {\n      String sstable = sstables[tbl_idx];\n      StringUtil::replaceAll(&sstable, \".sstable\", \"_meta.sstable\");\n      fnord::logInfo(\"cm.featuredump\", \"Importing meta sstable: $0\", sstable);\n\n      \/* read sstable heade r*\/\n      sstable::SSTableReader reader(File::openFile(sstable, File::O_READ));\n      sstable::SSTableColumnSchema schema;\n      schema.loadIndex(&reader);\n\n      if (reader.bodySize() == 0) {\n        fnord::logCritical(\"cm.featuredump\", \"unfinished sstable: $0\", sstable);\n        exit(1);\n      }\n\n      \/* get sstable cursor *\/\n      auto cursor = reader.getCursor();\n      auto body_size = reader.bodySize();\n\n      \/* status line *\/\n      util::SimpleRateLimitedFn status_line(kMicrosPerSecond, [&] () {\n        auto p = (tbl_idx \/ (double) tbl_cnt) +\n            ((cursor->position() \/ (double) body_size)) \/ (double) tbl_cnt;\n\n        fnord::logInfo(\n            \"cm.featuredump\",\n            \"[$0%] Reading meta sstables... rows=$1 features=$2\",\n            (size_t) (p * 100),\n            row_idx,\n            feature_counts.size());\n      });\n\n      \/* read sstable rows *\/\n      for (; cursor->valid(); ++row_idx) {\n        status_line.runMaybe();\n\n        auto key = cursor->getKeyString();\n        auto val = cursor->getDataBuffer();\n\n        sstable::SSTableColumnReader cols(&schema, val);\n        auto cnt = cols.getUInt64Column(schema.columnID(\"views\"));\n\n        feature_counts[key] += cnt;\n\n        if (!cursor->next()) {\n          break;\n        }\n      }\n\n      status_line.runForce();\n    }\n\n    \/* select features for export and assign indexes*\/\n    uint64_t cur_idx = 0;\n    orig_count = feature_counts.size();\n    auto min_count = flags.getInt(\"min_observations\");\n    for (auto iter = feature_counts.begin(); iter != feature_counts.end(); ) {\n      if (iter->second > min_count) {\n        feature_idx.emplace(iter->first, ++cur_idx);\n      }\n\n      iter = feature_counts.erase(iter);\n    }\n  }\n\n  fnord::logInfo(\n      \"cm.featuredump\",\n      \"Exporting $1\/$0 features\",\n      orig_count,\n      feature_idx.size());\n\n  \/* write feature idx meta file *\/\n  if (!output_meta_file.isEmpty()) {\n    for (const auto& f : feature_idx) {\n      auto line = StringUtil::format(\"$1 $0\\n\", f.first, f.second);\n      output_meta_file.get().write(line);\n    }\n  }\n\n  \/* read input data tables *\/\n  int rows_read = 0;\n  int rows_written = 0;\n  int features_written = 0;\n  for (int tbl_idx = 0; tbl_idx < sstables.size(); ++tbl_idx) {\n    const auto& sstable = sstables[tbl_idx];\n    fnord::logInfo(\"cm.featuredump\", \"Importing data sstable: $0\", sstable);\n\n    \/* read sstable heade r*\/\n    sstable::SSTableReader reader(File::openFile(sstable, File::O_READ));\n    sstable::SSTableColumnSchema schema;\n    schema.loadIndex(&reader);\n\n    if (reader.bodySize() == 0) {\n      fnord::logCritical(\"cm.featuredump\", \"unfinished sstable: $0\", sstable);\n      exit(1);\n    }\n\n    \/* get sstable cursor *\/\n    auto cursor = reader.getCursor();\n    auto body_size = reader.bodySize();\n\n    \/* status line *\/\n    util::SimpleRateLimitedFn status_line(kMicrosPerSecond, [&] () {\n      auto p = (tbl_idx \/ (double) tbl_cnt) +\n          ((cursor->position() \/ (double) body_size)) \/ (double) tbl_cnt;\n\n      fnord::logInfo(\n          \"cm.featuredump\",\n          \"[$0%] Dumping features... rows_read=$1 rows_written=$2\",\n          (size_t) (p * 100),\n          rows_read,\n          rows_written);\n    });\n\n    \/* read data sstables and copy features *\/\n    for (; cursor->valid(); ++rows_read) {\n      status_line.runMaybe();\n\n      auto val = cursor->getDataBuffer();\n      sstable::SSTableColumnReader cols(&schema, val);\n\n      cm::Example ex;\n#ifndef FNORD_NODEBUG\n      Set<String> dbg_features;\n#endif\n      ex.label = cols.getFloatColumn(schema.columnID(\"label\"));\n      auto features = cols.getStringColumns(schema.columnID(\"feature\"));\n      for (const auto& f : features) {\n        auto idx = feature_idx.find(f);\n        if (idx == feature_idx.end()) {\n          continue;\n        }\n\n#ifndef FNORD_NODEBUG\n        dbg_features.emplace(f);\n#endif\n\n        ex.features.emplace_back(idx->second, 1.0);\n      }\n\n      if (ex.features.size() > 0) {\n        ++rows_written;\n        features_written += ex.features.size();\n\n#ifndef FNORD_NOTRACE\n        fnord::logTrace(\n            \"cm.featuredump\",\n            \"Dumping example: label=$0 features=$1\",\n            ex.label,\n            inspect(dbg_features));\n#endif\n\n        if (!output_lightsvm_file.isEmpty()) {\n          auto ex_str = exampleToSVMLight(ex);\n          output_lightsvm_file.get().write(ex_str + \"\\n\");\n        }\n\n        if (!output_mm_labels_file.isEmpty()) {\n          auto line = StringUtil::format(\"$0\\n\", ex.label);\n          output_mm_labels_file.get().write(line);\n        }\n\n        if (!output_mm_features_file.isEmpty()) {\n          String lines;\n          ex.sortFeatures();\n          for (const auto& f : ex.features) {\n            lines += StringUtil::format(\n                \"$0 $1 $2\\n\",\n                rows_written,\n                f.first,\n                f.second);\n          }\n          output_mm_features_file.get().write(lines);\n        }\n      }\n\n      if (!cursor->next()) {\n        break;\n      }\n    }\n\n    status_line.runForce();\n  }\n\n  if (!output_meta_file.isEmpty()) {\n    FileUtil::mv(output_meta_file_path + \"~\", output_meta_file_path);\n  }\n\n  if (!output_lightsvm_file.isEmpty()) {\n    FileUtil::mv(output_lightsvm_file_path + \"~\", output_lightsvm_file_path);\n  }\n\n  if (!output_mm_labels_file.isEmpty()) {\n    auto tmpfile = File::openFile(\n        output_mm_labels_file_path + \"~~\",\n        File::O_READ | File::O_WRITE | File::O_CREATEOROPEN | File::O_TRUNCATE);\n\n    tmpfile.write(StringUtil::format(\n        \"%%MatrixMarket matrix array real general\\n$0 1\\n\",\n        rows_written));\n\n    FileUtil::cat(\n        output_mm_labels_file_path + \"~\",\n        output_mm_labels_file_path + \"~~\");\n\n    FileUtil::mv(output_mm_labels_file_path + \"~~\", output_mm_labels_file_path);\n    FileUtil::rm(output_mm_labels_file_path + \"~\");\n  }\n\n  if (!output_mm_features_file.isEmpty()) {\n    auto tmpfile = File::openFile(\n        output_mm_features_file_path + \"~~\",\n        File::O_READ | File::O_WRITE | File::O_CREATEOROPEN | File::O_TRUNCATE);\n\n    tmpfile.write(StringUtil::format(\n        \"%%MatrixMarket matrix coordinate real general\\n$0 $1 $2\\n\",\n        rows_written,\n        feature_idx.size(),\n        features_written));\n\n    FileUtil::cat(\n        output_mm_features_file_path + \"~\",\n        output_mm_features_file_path + \"~~\");\n\n    FileUtil::mv(output_mm_features_file_path + \"~~\", output_mm_features_file_path);\n    FileUtil::rm(output_mm_features_file_path + \"~\");\n  }\n\n  return 0;\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#define BOOST_NO_CXX11_NUMERIC_LIMITS 1\n#include <stdlib.h>\n#include <unistd.h>\n#include <signal.h>\n#include \"fnord-base\/io\/filerepository.h\"\n#include \"fnord-base\/io\/fileutil.h\"\n#include \"fnord-base\/application.h\"\n#include \"fnord-base\/logging.h\"\n#include \"fnord-base\/random.h\"\n#include \"fnord-base\/thread\/eventloop.h\"\n#include \"fnord-base\/thread\/threadpool.h\"\n#include \"fnord-base\/wallclock.h\"\n#include \"fnord-rpc\/ServerGroup.h\"\n#include \"fnord-rpc\/RPC.h\"\n#include \"fnord-rpc\/RPCClient.h\"\n#include \"fnord-base\/cli\/flagparser.h\"\n#include \"fnord-json\/json.h\"\n#include \"fnord-json\/jsonrpc.h\"\n#include \"fnord-http\/httprouter.h\"\n#include \"fnord-http\/httpserver.h\"\n#include \"fnord-feeds\/FeedService.h\"\n#include \"fnord-feeds\/RemoteFeedFactory.h\"\n#include \"fnord-feeds\/RemoteFeedReader.h\"\n#include \"fnord-base\/stats\/statsdagent.h\"\n#include \"fnord-fts\/fts.h\"\n#include \"fnord-fts\/fts_common.h\"\n#include \"fnord-mdb\/MDB.h\"\n#include \"CustomerNamespace.h\"\n#include \"FeatureSchema.h\"\n#include \"FeaturePack.h\"\n#include \"DocStore.h\"\n#include \"FeatureIndex.h\"\n#include \"IndexRequest.h\"\n\nusing namespace cm;\nusing namespace fnord;\n\nint main(int argc, const char** argv) {\n  Application::init();\n  Application::logToStderr();\n\n  cli::FlagParser flags;\n\n  flags.defineFlag(\n      \"index\",\n      cli::FlagParser::T_STRING,\n      true,\n      NULL,\n      NULL,\n      \"index data dir\",\n      \"<path>\");\n\n  flags.defineFlag(\n      \"docid\",\n      cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"docid\",\n      \"<docid>\");\n\n  flags.defineFlag(\n      \"query\",\n      cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"query\",\n      \"<query>\");\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\n  if (flags.isSet(\"docid\")) {\n    DocID docid = { flags.getString(\"docid\") };\n\n    \/* set up feature schema *\/\n    FeatureSchema feature_schema;\n    feature_schema.registerFeature(\"shop_id\", 1, 1);\n    feature_schema.registerFeature(\"category1\", 2, 1);\n    feature_schema.registerFeature(\"category2\", 3, 1);\n    feature_schema.registerFeature(\"category3\", 4, 1);\n    feature_schema.registerFeature(\"title~de\", 5, 2);\n\n    \/* open featuredb db *\/\n    auto featuredb_path = StringUtil::format(\"$0\/db\", index_path);\n    auto featuredb = mdb::MDB::open(featuredb_path, true);\n\n    \/* open full index  *\/\n    auto fullindex_path = StringUtil::format(\"$0\/docs\", index_path);\n    cm::DocStore full_index(fullindex_path);\n\n    auto doc = full_index.findDocument(docid);\n    doc->debugPrint();\n    return 0;\n  }\n\n  if (flags.isSet(\"query\")) {\n    auto ftsindex_path = StringUtil::format(\"$0\/fts\", index_path);\n    auto index_reader = fts::IndexReader::open(\n        fts::FSDirectory::open(StringUtil::convertUTF8To16(ftsindex_path)),\n        true);\n\n    auto searcher = fts::newLucene<fts::IndexSearcher>(index_reader);\n\n    RefPtr<fnord::fts::Analyzer> analyzer(new fnord::fts::Analyzer(\".\/conf\"));\n    auto adapter = std::make_shared<fnord::fts::AnalyzerAdapter>(analyzer);\n\n    auto query_parser = fts::newLucene<fts::QueryParser>(\n        fts::LuceneVersion::LUCENE_CURRENT,\n        L\"text~de\",\n        adapter);\n\n    auto collector = fts::TopScoreDocCollector::create(\n        500,\n        false);\n\n    auto query = query_parser->parse(\n        StringUtil::convertUTF8To16(flags.getString(\"query\")));\n\n    searcher->search(query, collector);\n    fnord::iputs(\"found $0 documents\", collector->getTotalHits());\n    return 0;\n  }\n\n  \/\/fnord::iputs(\"\\n[features]\")\n  \/\/for (const auto& f : features) {\n  \/\/  auto feature_key = feature_schema.featureKey(f.first);\n  \/\/  fnord::iputs(\n  \/\/      \"  $0=$1\",\n  \/\/      feature_key.isEmpty() ? \"unknown-feature\": feature_key.get(),\n  \/\/      f.second);\n  \/\/}\n\n  return 0;\n}\n\n<commit_msg>DisjunctionMaxQuery without any subqueries<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#define BOOST_NO_CXX11_NUMERIC_LIMITS 1\n#include <stdlib.h>\n#include <unistd.h>\n#include <signal.h>\n#include \"fnord-base\/io\/filerepository.h\"\n#include \"fnord-base\/io\/fileutil.h\"\n#include \"fnord-base\/application.h\"\n#include \"fnord-base\/logging.h\"\n#include \"fnord-base\/random.h\"\n#include \"fnord-base\/thread\/eventloop.h\"\n#include \"fnord-base\/thread\/threadpool.h\"\n#include \"fnord-base\/wallclock.h\"\n#include \"fnord-rpc\/ServerGroup.h\"\n#include \"fnord-rpc\/RPC.h\"\n#include \"fnord-rpc\/RPCClient.h\"\n#include \"fnord-base\/cli\/flagparser.h\"\n#include \"fnord-json\/json.h\"\n#include \"fnord-json\/jsonrpc.h\"\n#include \"fnord-http\/httprouter.h\"\n#include \"fnord-http\/httpserver.h\"\n#include \"fnord-feeds\/FeedService.h\"\n#include \"fnord-feeds\/RemoteFeedFactory.h\"\n#include \"fnord-feeds\/RemoteFeedReader.h\"\n#include \"fnord-base\/stats\/statsdagent.h\"\n#include \"fnord-fts\/fts.h\"\n#include \"fnord-fts\/fts_common.h\"\n#include \"fnord-fts\/search\/DisjunctionMaxQuery.h\"\n#include \"fnord-mdb\/MDB.h\"\n#include \"CustomerNamespace.h\"\n#include \"FeatureSchema.h\"\n#include \"FeaturePack.h\"\n#include \"DocStore.h\"\n#include \"FeatureIndex.h\"\n#include \"IndexRequest.h\"\n\nusing namespace cm;\nusing namespace fnord;\n\nint main(int argc, const char** argv) {\n  Application::init();\n  Application::logToStderr();\n\n  cli::FlagParser flags;\n\n  flags.defineFlag(\n      \"index\",\n      cli::FlagParser::T_STRING,\n      true,\n      NULL,\n      NULL,\n      \"index data dir\",\n      \"<path>\");\n\n  flags.defineFlag(\n      \"docid\",\n      cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"docid\",\n      \"<docid>\");\n\n  flags.defineFlag(\n      \"query\",\n      cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"query\",\n      \"<query>\");\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\n  if (flags.isSet(\"docid\")) {\n    DocID docid = { flags.getString(\"docid\") };\n\n    \/* set up feature schema *\/\n    FeatureSchema feature_schema;\n    feature_schema.registerFeature(\"shop_id\", 1, 1);\n    feature_schema.registerFeature(\"category1\", 2, 1);\n    feature_schema.registerFeature(\"category2\", 3, 1);\n    feature_schema.registerFeature(\"category3\", 4, 1);\n    feature_schema.registerFeature(\"title~de\", 5, 2);\n\n    \/* open featuredb db *\/\n    auto featuredb_path = StringUtil::format(\"$0\/db\", index_path);\n    auto featuredb = mdb::MDB::open(featuredb_path, true);\n\n    \/* open full index  *\/\n    auto fullindex_path = StringUtil::format(\"$0\/docs\", index_path);\n    cm::DocStore full_index(fullindex_path);\n\n    auto doc = full_index.findDocument(docid);\n    doc->debugPrint();\n    return 0;\n  }\n\n  if (flags.isSet(\"query\")) {\n    auto ftsindex_path = StringUtil::format(\"$0\/fts\", index_path);\n    auto index_reader = fts::IndexReader::open(\n        fts::FSDirectory::open(StringUtil::convertUTF8To16(ftsindex_path)),\n        true);\n\n    auto searcher = fts::newLucene<fts::IndexSearcher>(index_reader);\n\n    RefPtr<fnord::fts::Analyzer> analyzer(new fnord::fts::Analyzer(\".\/conf\"));\n    auto adapter = std::make_shared<fnord::fts::AnalyzerAdapter>(analyzer);\n\n    auto query = fts::newLucene<fts::DisjunctionMaxQuery>();\n\n    \/\/auto query_parser = fts::newLucene<fts::QueryParser>(\n    \/\/    fts::LuceneVersion::LUCENE_CURRENT,\n    \/\/    L\"text~de\",\n    \/\/    adapter);\n\n    auto collector = fts::TopScoreDocCollector::create(\n        500,\n        false);\n\n    \/\/auto query = query_parser->parse(\n    \/\/    StringUtil::convertUTF8To16(flags.getString(\"query\")));\n\n    searcher->search(query, collector);\n    fnord::iputs(\"found $0 documents\", collector->getTotalHits());\n    return 0;\n  }\n\n  \/\/fnord::iputs(\"\\n[features]\")\n  \/\/for (const auto& f : features) {\n  \/\/  auto feature_key = feature_schema.featureKey(f.first);\n  \/\/  fnord::iputs(\n  \/\/      \"  $0=$1\",\n  \/\/      feature_key.isEmpty() ? \"unknown-feature\": feature_key.get(),\n  \/\/      f.second);\n  \/\/}\n\n  return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file lars_test.cpp\n *\n * Test for LARS\n *\/\n\n\/\/ Note: We don't use BOOST_REQUIRE_CLOSE in the code below because we need\n\/\/ to use FPC_WEAK, and it's not at all intuitive how to do that.\n\n\n#include <armadillo>\n#include <mlpack\/methods\/lars\/lars.hpp>\n\n#include <boost\/test\/unit_test.hpp>\n\nBOOST_AUTO_TEST_SUITE(LARS_Test);\n\nvoid GenerateProblem(arma::mat& X, arma::vec& y, size_t nPoints, size_t nDims) {\n  X = arma::randn(nPoints, nDims);\n  arma::vec beta = arma::randn(nDims, 1);\n  y = X * beta;\n}\n\n\nvoid VerifyCorrectness(arma::vec beta, arma::vec errCorr, double lambda) {\n  size_t nDims = beta.n_elem;\n  const double tol = 1e-12;\n  for(size_t j = 0; j < nDims; j++) {\n    if(beta(j) == 0) {\n      \/\/ make sure that errCorr(j) <= lambda\n      BOOST_REQUIRE_SMALL(std::max(errCorr(j) - lambda, 0.0), tol);\n    }\n    else if(beta(j) < 0) {\n      \/\/ make sure that errCorr(j) == lambda\n      BOOST_REQUIRE_SMALL(errCorr(j) - lambda, tol);\n    }\n    else { \/\/ beta(j) > 0\n      \/\/ make sure that errCorr(j) == -lambda\n      BOOST_REQUIRE_SMALL(errCorr(j) + lambda, tol);\n    }\n  }\n}\n\n\nvoid LassoTest(size_t nPoints, size_t nDims, bool elasticNet, bool useCholesky) {\n  arma::mat X;\n  arma::vec y;\n  \n  for(size_t i = 0; i < 100; i++) {\n    GenerateProblem(X, y, nPoints, nDims);\n    \n    \/\/ Armadillo's median is broken, so...\n    arma::vec sortedAbsCorr = sort(abs(trans(X) * y));\n    double lambda_1 = sortedAbsCorr(nDims\/2);\n    double lambda_2;\n    if(elasticNet) {\n      lambda_2 = lambda_1 \/ 2;\n    }\n    else {\n      lambda_2 = 0;\n    }\n    \n    mlpack::lars::LARS lars(useCholesky, lambda_1, lambda_2);\n    lars.DoLARS(X, y);\n    \n    arma::vec betaOpt;\n    lars.Solution(betaOpt);\n    arma::vec errCorr = (arma::trans(X) * X + lambda_2 * arma::eye(nDims, nDims)) * betaOpt - arma::trans(X) * y;\n    \n    VerifyCorrectness(betaOpt, errCorr, lambda_1);\n  }\n}\n\n\nBOOST_AUTO_TEST_CASE(LARS_Test_Lasso_Cholesky) {\n  LassoTest(100, 10, true, false);\n}\n\n\nBOOST_AUTO_TEST_CASE(LARS_Test_Lasso_Gram) {\n  LassoTest(100, 10, false, false);\n}\n\n\nBOOST_AUTO_TEST_CASE(LARS_Test_ElasticNet_Cholesky) {\n  LassoTest(100, 10, true, true);\n}\n\n\nBOOST_AUTO_TEST_CASE(LARS_Test_ElasticNet_Gram) {\n  LassoTest(100, 10, true, false);\n}\n\nBOOST_AUTO_TEST_SUITE_END();\n<commit_msg>Update LARS test.<commit_after>\/**\n * @file lars_test.cpp\n *\n * Test for LARS\n *\/\n\n\/\/ Note: We don't use BOOST_REQUIRE_CLOSE in the code below because we need\n\/\/ to use FPC_WEAK, and it's not at all intuitive how to do that.\n#include <armadillo>\n#include <mlpack\/methods\/lars\/lars.hpp>\n\n#include <boost\/test\/unit_test.hpp>\n\nusing namespace mlpack;\nusing namespace mlpack::regression;\n\nBOOST_AUTO_TEST_SUITE(LARS_Test);\n\nvoid GenerateProblem(arma::mat& X, arma::vec& y, size_t nPoints, size_t nDims) {\n  X = arma::randn(nPoints, nDims);\n  arma::vec beta = arma::randn(nDims, 1);\n  y = X * beta;\n}\n\n\nvoid VerifyCorrectness(arma::vec beta, arma::vec errCorr, double lambda) {\n  size_t nDims = beta.n_elem;\n  const double tol = 1e-12;\n  for(size_t j = 0; j < nDims; j++) {\n    if(beta(j) == 0) {\n      \/\/ make sure that errCorr(j) <= lambda\n      BOOST_REQUIRE_SMALL(std::max(errCorr(j) - lambda, 0.0), tol);\n    }\n    else if(beta(j) < 0) {\n      \/\/ make sure that errCorr(j) == lambda\n      BOOST_REQUIRE_SMALL(errCorr(j) - lambda, tol);\n    }\n    else { \/\/ beta(j) > 0\n      \/\/ make sure that errCorr(j) == -lambda\n      BOOST_REQUIRE_SMALL(errCorr(j) + lambda, tol);\n    }\n  }\n}\n\n\nvoid LassoTest(size_t nPoints, size_t nDims, bool elasticNet, bool useCholesky) {\n  arma::mat X;\n  arma::vec y;\n\n  for(size_t i = 0; i < 100; i++) {\n    GenerateProblem(X, y, nPoints, nDims);\n\n    \/\/ Armadillo's median is broken, so...\n    arma::vec sortedAbsCorr = sort(abs(trans(X) * y));\n    double lambda_1 = sortedAbsCorr(nDims\/2);\n    double lambda_2;\n    if(elasticNet) {\n      lambda_2 = lambda_1 \/ 2;\n    }\n    else {\n      lambda_2 = 0;\n    }\n\n    LARS lars(useCholesky, lambda_1, lambda_2);\n    lars.DoLARS(X, y);\n\n    arma::vec betaOpt;\n    lars.Solution(betaOpt);\n    arma::vec errCorr = (arma::trans(X) * X + lambda_2 * arma::eye(nDims, nDims)) * betaOpt - arma::trans(X) * y;\n\n    VerifyCorrectness(betaOpt, errCorr, lambda_1);\n  }\n}\n\n\nBOOST_AUTO_TEST_CASE(LARS_Test_Lasso_Cholesky) {\n  LassoTest(100, 10, true, false);\n}\n\n\nBOOST_AUTO_TEST_CASE(LARS_Test_Lasso_Gram) {\n  LassoTest(100, 10, false, false);\n}\n\n\nBOOST_AUTO_TEST_CASE(LARS_Test_ElasticNet_Cholesky) {\n  LassoTest(100, 10, true, true);\n}\n\n\nBOOST_AUTO_TEST_CASE(LARS_Test_ElasticNet_Gram) {\n  LassoTest(100, 10, true, false);\n}\n\nBOOST_AUTO_TEST_SUITE_END();\n<|endoftext|>"}
{"text":"<commit_before>\/\/==- Deserialize.cpp - Generic Object Serialization to Bitcode --*- 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 internal methods used for object serialization.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Bitcode\/Deserialize.h\"\n\n#ifdef DEBUG_BACKPATCH\n#include \"llvm\/Support\/Streams.h\"\n#endif\n\nusing namespace llvm;\n\nDeserializer::Deserializer(BitstreamReader& stream)\n  : Stream(stream), RecIdx(0), FreeList(NULL), AbbrevNo(0), RecordCode(0) {\n\n    StreamStart = Stream.GetCurrentBitNo();\n}\n\nDeserializer::~Deserializer() {\n  assert (RecIdx >= Record.size() && \n          \"Still scanning bitcode record when deserialization completed.\");\n \n#ifdef DEBUG_BACKPATCH\n  for (MapTy::iterator I=BPatchMap.begin(), E=BPatchMap.end(); I!=E; ++I)\n    assert (I->first.hasFinalPtr() &&\n            \"Some pointers were not backpatched.\");\n#endif\n}\n\n\nbool Deserializer::inRecord() {\n  if (Record.size() > 0) {\n    if (RecIdx >= Record.size()) {\n      RecIdx = 0;\n      Record.clear();\n      AbbrevNo = 0;\n      return false;\n    }\n    else\n      return true;\n  }\n\n  return false;\n}\n\nbool Deserializer::AdvanceStream() {\n  assert (!inRecord() && \n          \"Cannot advance stream.  Still processing a record.\");\n  \n  if (AbbrevNo == bitc::ENTER_SUBBLOCK ||\n      AbbrevNo >= bitc::UNABBREV_RECORD)\n    return true;\n  \n  while (!Stream.AtEndOfStream()) {\n    \n    uint64_t Pos = Stream.GetCurrentBitNo();\n    AbbrevNo = Stream.ReadCode();    \n  \n    switch (AbbrevNo) {        \n      case bitc::ENTER_SUBBLOCK: {\n        unsigned id = Stream.ReadSubBlockID();\n        \n        \/\/ Determine the extent of the block.  This is useful for jumping around\n        \/\/ the stream.  This is hack: we read the header of the block, save\n        \/\/ the length, and then revert the bitstream to a location just before\n        \/\/ the block is entered.\n        uint64_t BPos = Stream.GetCurrentBitNo();\n        Stream.ReadVBR(bitc::CodeLenWidth); \/\/ Skip the code size.\n        Stream.SkipToWord();\n        unsigned NumWords = Stream.Read(bitc::BlockSizeWidth);\n        Stream.JumpToBit(BPos);\n                \n        BlockStack.push_back(Location(Pos,id,NumWords));\n        break;\n      } \n        \n      case bitc::END_BLOCK: {\n        bool x = Stream.ReadBlockEnd();\n        assert (!x && \"Error at block end.\");\n        BlockStack.pop_back();\n        continue;\n      }\n        \n      case bitc::DEFINE_ABBREV:\n        Stream.ReadAbbrevRecord();\n        continue;\n\n      default:\n        break;\n    }\n    \n    return true;\n  }\n  \n  return false;\n}\n\nvoid Deserializer::ReadRecord() {\n\n  while (AdvanceStream() && AbbrevNo == bitc::ENTER_SUBBLOCK) {\n    assert (!BlockStack.empty());\n    Stream.EnterSubBlock(BlockStack.back().BlockID);\n    AbbrevNo = 0;\n  }\n\n  if (Stream.AtEndOfStream())\n    return;\n  \n  assert (Record.empty());\n  assert (AbbrevNo >= bitc::UNABBREV_RECORD);\n  RecordCode = Stream.ReadRecord(AbbrevNo,Record);\n  assert (Record.size() > 0);\n}\n\nvoid Deserializer::SkipBlock() {\n  assert (!inRecord());\n\n  if (AtEnd())\n    return;\n\n  AdvanceStream();  \n\n  assert (AbbrevNo == bitc::ENTER_SUBBLOCK);\n  BlockStack.pop_back();\n  Stream.SkipBlock();\n\n  AbbrevNo = 0;\n  AdvanceStream();\n}\n\nbool Deserializer::SkipToBlock(unsigned BlockID) {\n  assert (!inRecord());\n  \n  AdvanceStream();\n  assert (AbbrevNo == bitc::ENTER_SUBBLOCK);\n  \n  unsigned BlockLevel = BlockStack.size();\n\n  while (!AtEnd() &&\n         BlockLevel == BlockStack.size() && \n         getCurrentBlockID() != BlockID)\n    SkipBlock();\n\n  return !(AtEnd() || BlockLevel != BlockStack.size());\n}\n\nDeserializer::Location Deserializer::getCurrentBlockLocation() {\n  if (!inRecord())\n    AdvanceStream();\n  \n  return BlockStack.back();\n}\n\nbool Deserializer::JumpTo(const Location& Loc) {\n    \n  assert (!inRecord());\n\n  AdvanceStream();\n  \n  assert (!BlockStack.empty() || AtEnd());\n    \n  uint64_t LastBPos = StreamStart;\n  \n  while (!BlockStack.empty()) {\n    \n    LastBPos = BlockStack.back().BitNo;\n    \n    \/\/ Determine of the current block contains the location of the block\n    \/\/ we are looking for.\n    if (BlockStack.back().contains(Loc)) {\n      \/\/ We found the enclosing block.  We must first POP it off to\n      \/\/ destroy any accumulated context within the block scope.  We then\n      \/\/ jump to the position of the block and enter it.\n      Stream.JumpToBit(LastBPos);\n      \n      if (BlockStack.size() == Stream.BlockScope.size())\n        Stream.PopBlockScope();\n\n      BlockStack.pop_back();\n      \n      AbbrevNo = 0;\n      AdvanceStream();      \n      assert (AbbrevNo == bitc::ENTER_SUBBLOCK);\n      \n      Stream.EnterSubBlock(BlockStack.back().BlockID);\n      break;\n    }\n\n    \/\/ This block does not contain the block we are looking for.  Pop it.\n    if (BlockStack.size() == Stream.BlockScope.size())\n      Stream.PopBlockScope();\n    \n    BlockStack.pop_back();\n\n  }\n\n  \/\/ Check if we have popped our way to the outermost scope.  If so,\n  \/\/ we need to adjust our position.\n  if (BlockStack.empty()) {\n    assert (Stream.BlockScope.empty());\n    \n    Stream.JumpToBit(Loc.BitNo < LastBPos ? StreamStart : LastBPos);\n    AbbrevNo = 0;\n    AdvanceStream();\n  }\n\n  assert (AbbrevNo == bitc::ENTER_SUBBLOCK);\n  assert (!BlockStack.empty());\n  \n  while (!AtEnd() && BlockStack.back() != Loc) {\n    if (BlockStack.back().contains(Loc)) {\n      Stream.EnterSubBlock(BlockStack.back().BlockID);\n      AbbrevNo = 0;\n      AdvanceStream();\n      continue;\n    }\n    else\n      SkipBlock();\n  }\n  \n  if (AtEnd())\n    return false;\n  \n  assert (BlockStack.back() == Loc);\n\n  return true;\n}\n\nvoid Deserializer::Rewind() {\n  while (!Stream.BlockScope.empty())\n    Stream.PopBlockScope();\n  \n  while (!BlockStack.empty())\n    BlockStack.pop_back();\n  \n  Stream.JumpToBit(StreamStart);\n  AbbrevNo = 0;\n}\n  \n\nunsigned Deserializer::getCurrentBlockID() { \n  if (!inRecord())\n    AdvanceStream();\n  \n  return BlockStack.back().BlockID;\n}\n\nunsigned Deserializer::getRecordCode() {\n  if (!inRecord()) {\n    AdvanceStream();\n    assert (AbbrevNo >= bitc::UNABBREV_RECORD);\n    ReadRecord();\n  }\n  \n  return RecordCode;\n}\n\nbool Deserializer::FinishedBlock(Location BlockLoc) {\n  if (!inRecord())\n    AdvanceStream();\n\n  for (llvm::SmallVector<Location,8>::reverse_iterator\n        I=BlockStack.rbegin(), E=BlockStack.rend(); I!=E; ++I)\n      if (*I == BlockLoc)\n        return false;\n  \n  return true;\n}\n\nunsigned Deserializer::getAbbrevNo() {\n  if (!inRecord())\n    AdvanceStream();\n  \n  return AbbrevNo;\n}\n\nbool Deserializer::AtEnd() {\n  if (inRecord())\n    return false;\n  \n  if (!AdvanceStream())\n    return true;\n  \n  return false;\n}\n\nuint64_t Deserializer::ReadInt() {\n  \/\/ FIXME: Any error recovery\/handling with incomplete or bad files?\n  if (!inRecord())\n    ReadRecord();\n\n  return Record[RecIdx++];\n}\n\nint64_t Deserializer::ReadSInt() {\n  uint64_t x = ReadInt();\n  int64_t magnitude = x >> 1;\n  return x & 0x1 ? -magnitude : magnitude;\n}\n\nchar* Deserializer::ReadCStr(char* cstr, unsigned MaxLen, bool isNullTerm) {\n  if (cstr == NULL)\n    MaxLen = 0; \/\/ Zero this just in case someone does something funny.\n  \n  unsigned len = ReadInt();\n\n  assert (MaxLen == 0 || (len + (isNullTerm ? 1 : 0)) <= MaxLen);\n\n  if (!cstr)\n    cstr = new char[len + (isNullTerm ? 1 : 0)];\n  \n  assert (cstr != NULL);\n  \n  for (unsigned i = 0; i < len; ++i)\n    cstr[i] = (char) ReadInt();\n  \n  if (isNullTerm)\n    cstr[len] = '\\0';\n  \n  return cstr;\n}\n\nvoid Deserializer::ReadCStr(std::vector<char>& buff, bool isNullTerm,\n                            unsigned Idx) {\n  \n  unsigned len = ReadInt();\n\n  \/\/ If Idx is beyond the current before size, reduce Idx to refer to the\n  \/\/ element after the last element.\n  if (Idx > buff.size())\n    Idx = buff.size();\n\n  buff.reserve(len+Idx);\n  buff.resize(Idx);      \n  \n  for (unsigned i = 0; i < len; ++i)\n    buff.push_back((char) ReadInt());\n  \n  if (isNullTerm)\n    buff.push_back('\\0');\n}\n\nvoid Deserializer::RegisterPtr(const SerializedPtrID& PtrId,\n                               const void* Ptr) {\n  \n  MapTy::value_type& E = BPatchMap.FindAndConstruct(BPKey(PtrId));\n  \n  assert (!HasFinalPtr(E) && \"Pointer already registered.\");\n\n#ifdef DEBUG_BACKPATCH\n  llvm::cerr << \"RegisterPtr: \" << PtrId << \" => \" << Ptr << \"\\n\";\n#endif \n  \n  SetPtr(E,Ptr);\n}\n\nvoid Deserializer::ReadUIntPtr(uintptr_t& PtrRef, \n                               const SerializedPtrID& PtrId,\n                               bool AllowBackpatch) {  \n  if (PtrId == 0) {\n    PtrRef = 0;\n    return;\n  }\n  \n  MapTy::value_type& E = BPatchMap.FindAndConstruct(BPKey(PtrId));\n  \n  if (HasFinalPtr(E)) {\n    PtrRef = GetFinalPtr(E);\n\n#ifdef DEBUG_BACKPATCH\n    llvm::cerr << \"ReadUintPtr: \" << PtrId\n               << \" <-- \" <<  (void*) GetFinalPtr(E) << '\\n';\n#endif    \n  }\n  else {\n    assert (AllowBackpatch &&\n            \"Client forbids backpatching for this pointer.\");\n    \n#ifdef DEBUG_BACKPATCH\n    llvm::cerr << \"ReadUintPtr: \" << PtrId << \" (NO PTR YET)\\n\";\n#endif\n    \n    \/\/ Register backpatch.  Check the freelist for a BPNode.\n    BPNode* N;\n\n    if (FreeList) {\n      N = FreeList;\n      FreeList = FreeList->Next;\n    }\n    else \/\/ No available BPNode.  Allocate one.\n      N = (BPNode*) Allocator.Allocate<BPNode>();\n    \n    new (N) BPNode(GetBPNode(E),PtrRef);\n    SetBPNode(E,N);\n  }\n}\n\nuintptr_t Deserializer::ReadInternalRefPtr() {\n  SerializedPtrID PtrId = ReadPtrID();\n  \n  assert (PtrId != 0 && \"References cannot refer the NULL address.\");\n\n  MapTy::value_type& E = BPatchMap.FindAndConstruct(BPKey(PtrId));\n  \n  assert (HasFinalPtr(E) &&\n          \"Cannot backpatch references.  Object must be already deserialized.\");\n  \n  return GetFinalPtr(E);\n}\n\nvoid Deserializer::BPEntry::SetPtr(BPNode*& FreeList, void* P) {\n  BPNode* Last = NULL;\n  \n  for (BPNode* N = Head; N != NULL; N=N->Next) {\n    Last = N;\n    N->PtrRef |= reinterpret_cast<uintptr_t>(P);\n  }\n  \n  if (Last) {\n    Last->Next = FreeList;\n    FreeList = Head;\n  }\n  \n  Ptr = const_cast<void*>(P);\n}\n\n\n#define INT_READ(TYPE)\\\nvoid SerializeTrait<TYPE>::Read(Deserializer& D, TYPE& X) {\\\n  X = (TYPE) D.ReadInt(); }\n\nINT_READ(bool)\nINT_READ(unsigned char)\nINT_READ(unsigned short)\nINT_READ(unsigned int)\nINT_READ(unsigned long)\n\n#define SINT_READ(TYPE)\\\nvoid SerializeTrait<TYPE>::Read(Deserializer& D, TYPE& X) {\\\n  X = (TYPE) D.ReadSInt(); }\n\nINT_READ(signed char)\nINT_READ(signed short)\nINT_READ(signed int)\nINT_READ(signed long)\n<commit_msg>fix warning when assertion disabled.<commit_after>\/\/==- Deserialize.cpp - Generic Object Serialization to Bitcode --*- 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 internal methods used for object serialization.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Bitcode\/Deserialize.h\"\n\n#ifdef DEBUG_BACKPATCH\n#include \"llvm\/Support\/Streams.h\"\n#endif\n\nusing namespace llvm;\n\nDeserializer::Deserializer(BitstreamReader& stream)\n  : Stream(stream), RecIdx(0), FreeList(NULL), AbbrevNo(0), RecordCode(0) {\n\n    StreamStart = Stream.GetCurrentBitNo();\n}\n\nDeserializer::~Deserializer() {\n  assert (RecIdx >= Record.size() && \n          \"Still scanning bitcode record when deserialization completed.\");\n \n#ifdef DEBUG_BACKPATCH\n  for (MapTy::iterator I=BPatchMap.begin(), E=BPatchMap.end(); I!=E; ++I)\n    assert (I->first.hasFinalPtr() &&\n            \"Some pointers were not backpatched.\");\n#endif\n}\n\n\nbool Deserializer::inRecord() {\n  if (Record.size() > 0) {\n    if (RecIdx >= Record.size()) {\n      RecIdx = 0;\n      Record.clear();\n      AbbrevNo = 0;\n      return false;\n    }\n    else\n      return true;\n  }\n\n  return false;\n}\n\nbool Deserializer::AdvanceStream() {\n  assert (!inRecord() && \n          \"Cannot advance stream.  Still processing a record.\");\n  \n  if (AbbrevNo == bitc::ENTER_SUBBLOCK ||\n      AbbrevNo >= bitc::UNABBREV_RECORD)\n    return true;\n  \n  while (!Stream.AtEndOfStream()) {\n    \n    uint64_t Pos = Stream.GetCurrentBitNo();\n    AbbrevNo = Stream.ReadCode();    \n  \n    switch (AbbrevNo) {        \n      case bitc::ENTER_SUBBLOCK: {\n        unsigned id = Stream.ReadSubBlockID();\n        \n        \/\/ Determine the extent of the block.  This is useful for jumping around\n        \/\/ the stream.  This is hack: we read the header of the block, save\n        \/\/ the length, and then revert the bitstream to a location just before\n        \/\/ the block is entered.\n        uint64_t BPos = Stream.GetCurrentBitNo();\n        Stream.ReadVBR(bitc::CodeLenWidth); \/\/ Skip the code size.\n        Stream.SkipToWord();\n        unsigned NumWords = Stream.Read(bitc::BlockSizeWidth);\n        Stream.JumpToBit(BPos);\n                \n        BlockStack.push_back(Location(Pos,id,NumWords));\n        break;\n      } \n        \n      case bitc::END_BLOCK: {\n        bool x = Stream.ReadBlockEnd();\n        assert(!x && \"Error at block end.\"); x=x;\n        BlockStack.pop_back();\n        continue;\n      }\n        \n      case bitc::DEFINE_ABBREV:\n        Stream.ReadAbbrevRecord();\n        continue;\n\n      default:\n        break;\n    }\n    \n    return true;\n  }\n  \n  return false;\n}\n\nvoid Deserializer::ReadRecord() {\n\n  while (AdvanceStream() && AbbrevNo == bitc::ENTER_SUBBLOCK) {\n    assert (!BlockStack.empty());\n    Stream.EnterSubBlock(BlockStack.back().BlockID);\n    AbbrevNo = 0;\n  }\n\n  if (Stream.AtEndOfStream())\n    return;\n  \n  assert (Record.empty());\n  assert (AbbrevNo >= bitc::UNABBREV_RECORD);\n  RecordCode = Stream.ReadRecord(AbbrevNo,Record);\n  assert (Record.size() > 0);\n}\n\nvoid Deserializer::SkipBlock() {\n  assert (!inRecord());\n\n  if (AtEnd())\n    return;\n\n  AdvanceStream();  \n\n  assert (AbbrevNo == bitc::ENTER_SUBBLOCK);\n  BlockStack.pop_back();\n  Stream.SkipBlock();\n\n  AbbrevNo = 0;\n  AdvanceStream();\n}\n\nbool Deserializer::SkipToBlock(unsigned BlockID) {\n  assert (!inRecord());\n  \n  AdvanceStream();\n  assert (AbbrevNo == bitc::ENTER_SUBBLOCK);\n  \n  unsigned BlockLevel = BlockStack.size();\n\n  while (!AtEnd() &&\n         BlockLevel == BlockStack.size() && \n         getCurrentBlockID() != BlockID)\n    SkipBlock();\n\n  return !(AtEnd() || BlockLevel != BlockStack.size());\n}\n\nDeserializer::Location Deserializer::getCurrentBlockLocation() {\n  if (!inRecord())\n    AdvanceStream();\n  \n  return BlockStack.back();\n}\n\nbool Deserializer::JumpTo(const Location& Loc) {\n    \n  assert (!inRecord());\n\n  AdvanceStream();\n  \n  assert (!BlockStack.empty() || AtEnd());\n    \n  uint64_t LastBPos = StreamStart;\n  \n  while (!BlockStack.empty()) {\n    \n    LastBPos = BlockStack.back().BitNo;\n    \n    \/\/ Determine of the current block contains the location of the block\n    \/\/ we are looking for.\n    if (BlockStack.back().contains(Loc)) {\n      \/\/ We found the enclosing block.  We must first POP it off to\n      \/\/ destroy any accumulated context within the block scope.  We then\n      \/\/ jump to the position of the block and enter it.\n      Stream.JumpToBit(LastBPos);\n      \n      if (BlockStack.size() == Stream.BlockScope.size())\n        Stream.PopBlockScope();\n\n      BlockStack.pop_back();\n      \n      AbbrevNo = 0;\n      AdvanceStream();      \n      assert (AbbrevNo == bitc::ENTER_SUBBLOCK);\n      \n      Stream.EnterSubBlock(BlockStack.back().BlockID);\n      break;\n    }\n\n    \/\/ This block does not contain the block we are looking for.  Pop it.\n    if (BlockStack.size() == Stream.BlockScope.size())\n      Stream.PopBlockScope();\n    \n    BlockStack.pop_back();\n\n  }\n\n  \/\/ Check if we have popped our way to the outermost scope.  If so,\n  \/\/ we need to adjust our position.\n  if (BlockStack.empty()) {\n    assert (Stream.BlockScope.empty());\n    \n    Stream.JumpToBit(Loc.BitNo < LastBPos ? StreamStart : LastBPos);\n    AbbrevNo = 0;\n    AdvanceStream();\n  }\n\n  assert (AbbrevNo == bitc::ENTER_SUBBLOCK);\n  assert (!BlockStack.empty());\n  \n  while (!AtEnd() && BlockStack.back() != Loc) {\n    if (BlockStack.back().contains(Loc)) {\n      Stream.EnterSubBlock(BlockStack.back().BlockID);\n      AbbrevNo = 0;\n      AdvanceStream();\n      continue;\n    }\n    else\n      SkipBlock();\n  }\n  \n  if (AtEnd())\n    return false;\n  \n  assert (BlockStack.back() == Loc);\n\n  return true;\n}\n\nvoid Deserializer::Rewind() {\n  while (!Stream.BlockScope.empty())\n    Stream.PopBlockScope();\n  \n  while (!BlockStack.empty())\n    BlockStack.pop_back();\n  \n  Stream.JumpToBit(StreamStart);\n  AbbrevNo = 0;\n}\n  \n\nunsigned Deserializer::getCurrentBlockID() { \n  if (!inRecord())\n    AdvanceStream();\n  \n  return BlockStack.back().BlockID;\n}\n\nunsigned Deserializer::getRecordCode() {\n  if (!inRecord()) {\n    AdvanceStream();\n    assert (AbbrevNo >= bitc::UNABBREV_RECORD);\n    ReadRecord();\n  }\n  \n  return RecordCode;\n}\n\nbool Deserializer::FinishedBlock(Location BlockLoc) {\n  if (!inRecord())\n    AdvanceStream();\n\n  for (llvm::SmallVector<Location,8>::reverse_iterator\n        I=BlockStack.rbegin(), E=BlockStack.rend(); I!=E; ++I)\n      if (*I == BlockLoc)\n        return false;\n  \n  return true;\n}\n\nunsigned Deserializer::getAbbrevNo() {\n  if (!inRecord())\n    AdvanceStream();\n  \n  return AbbrevNo;\n}\n\nbool Deserializer::AtEnd() {\n  if (inRecord())\n    return false;\n  \n  if (!AdvanceStream())\n    return true;\n  \n  return false;\n}\n\nuint64_t Deserializer::ReadInt() {\n  \/\/ FIXME: Any error recovery\/handling with incomplete or bad files?\n  if (!inRecord())\n    ReadRecord();\n\n  return Record[RecIdx++];\n}\n\nint64_t Deserializer::ReadSInt() {\n  uint64_t x = ReadInt();\n  int64_t magnitude = x >> 1;\n  return x & 0x1 ? -magnitude : magnitude;\n}\n\nchar* Deserializer::ReadCStr(char* cstr, unsigned MaxLen, bool isNullTerm) {\n  if (cstr == NULL)\n    MaxLen = 0; \/\/ Zero this just in case someone does something funny.\n  \n  unsigned len = ReadInt();\n\n  assert (MaxLen == 0 || (len + (isNullTerm ? 1 : 0)) <= MaxLen);\n\n  if (!cstr)\n    cstr = new char[len + (isNullTerm ? 1 : 0)];\n  \n  assert (cstr != NULL);\n  \n  for (unsigned i = 0; i < len; ++i)\n    cstr[i] = (char) ReadInt();\n  \n  if (isNullTerm)\n    cstr[len] = '\\0';\n  \n  return cstr;\n}\n\nvoid Deserializer::ReadCStr(std::vector<char>& buff, bool isNullTerm,\n                            unsigned Idx) {\n  \n  unsigned len = ReadInt();\n\n  \/\/ If Idx is beyond the current before size, reduce Idx to refer to the\n  \/\/ element after the last element.\n  if (Idx > buff.size())\n    Idx = buff.size();\n\n  buff.reserve(len+Idx);\n  buff.resize(Idx);      \n  \n  for (unsigned i = 0; i < len; ++i)\n    buff.push_back((char) ReadInt());\n  \n  if (isNullTerm)\n    buff.push_back('\\0');\n}\n\nvoid Deserializer::RegisterPtr(const SerializedPtrID& PtrId,\n                               const void* Ptr) {\n  \n  MapTy::value_type& E = BPatchMap.FindAndConstruct(BPKey(PtrId));\n  \n  assert (!HasFinalPtr(E) && \"Pointer already registered.\");\n\n#ifdef DEBUG_BACKPATCH\n  llvm::cerr << \"RegisterPtr: \" << PtrId << \" => \" << Ptr << \"\\n\";\n#endif \n  \n  SetPtr(E,Ptr);\n}\n\nvoid Deserializer::ReadUIntPtr(uintptr_t& PtrRef, \n                               const SerializedPtrID& PtrId,\n                               bool AllowBackpatch) {  \n  if (PtrId == 0) {\n    PtrRef = 0;\n    return;\n  }\n  \n  MapTy::value_type& E = BPatchMap.FindAndConstruct(BPKey(PtrId));\n  \n  if (HasFinalPtr(E)) {\n    PtrRef = GetFinalPtr(E);\n\n#ifdef DEBUG_BACKPATCH\n    llvm::cerr << \"ReadUintPtr: \" << PtrId\n               << \" <-- \" <<  (void*) GetFinalPtr(E) << '\\n';\n#endif    \n  }\n  else {\n    assert (AllowBackpatch &&\n            \"Client forbids backpatching for this pointer.\");\n    \n#ifdef DEBUG_BACKPATCH\n    llvm::cerr << \"ReadUintPtr: \" << PtrId << \" (NO PTR YET)\\n\";\n#endif\n    \n    \/\/ Register backpatch.  Check the freelist for a BPNode.\n    BPNode* N;\n\n    if (FreeList) {\n      N = FreeList;\n      FreeList = FreeList->Next;\n    }\n    else \/\/ No available BPNode.  Allocate one.\n      N = (BPNode*) Allocator.Allocate<BPNode>();\n    \n    new (N) BPNode(GetBPNode(E),PtrRef);\n    SetBPNode(E,N);\n  }\n}\n\nuintptr_t Deserializer::ReadInternalRefPtr() {\n  SerializedPtrID PtrId = ReadPtrID();\n  \n  assert (PtrId != 0 && \"References cannot refer the NULL address.\");\n\n  MapTy::value_type& E = BPatchMap.FindAndConstruct(BPKey(PtrId));\n  \n  assert (HasFinalPtr(E) &&\n          \"Cannot backpatch references.  Object must be already deserialized.\");\n  \n  return GetFinalPtr(E);\n}\n\nvoid Deserializer::BPEntry::SetPtr(BPNode*& FreeList, void* P) {\n  BPNode* Last = NULL;\n  \n  for (BPNode* N = Head; N != NULL; N=N->Next) {\n    Last = N;\n    N->PtrRef |= reinterpret_cast<uintptr_t>(P);\n  }\n  \n  if (Last) {\n    Last->Next = FreeList;\n    FreeList = Head;\n  }\n  \n  Ptr = const_cast<void*>(P);\n}\n\n\n#define INT_READ(TYPE)\\\nvoid SerializeTrait<TYPE>::Read(Deserializer& D, TYPE& X) {\\\n  X = (TYPE) D.ReadInt(); }\n\nINT_READ(bool)\nINT_READ(unsigned char)\nINT_READ(unsigned short)\nINT_READ(unsigned int)\nINT_READ(unsigned long)\n\n#define SINT_READ(TYPE)\\\nvoid SerializeTrait<TYPE>::Read(Deserializer& D, TYPE& X) {\\\n  X = (TYPE) D.ReadSInt(); }\n\nINT_READ(signed char)\nINT_READ(signed short)\nINT_READ(signed int)\nINT_READ(signed long)\n<|endoftext|>"}
{"text":"<commit_before>\/**************************************************************************\n**\n** This file is part of Qt Creator\n**\n** Copyright (c) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n**\n** Contact: 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\/\/ Copyright (c) 2008 Roberto Raggi <roberto.raggi@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#include \"TranslationUnit.h\"\n#include \"Control.h\"\n#include \"Parser.h\"\n#include \"Lexer.h\"\n#include \"MemoryPool.h\"\n#include \"AST.h\"\n#include \"Literals.h\"\n#include \"DiagnosticClient.h\"\n#include <stack>\n#include <cstdarg>\n#include <algorithm>\n\nusing namespace CPlusPlus;\n\nTranslationUnit::TranslationUnit(Control *control, const StringLiteral *fileId)\n    : _control(control),\n      _fileId(fileId),\n      _firstSourceChar(0),\n      _lastSourceChar(0),\n      _pool(0),\n      _ast(0),\n      _flags(0)\n{\n    _tokens = new Array<Token, 8>();\n    _previousTranslationUnit = control->switchTranslationUnit(this);\n    _pool = new MemoryPool();\n}\n\nTranslationUnit::~TranslationUnit()\n{\n    (void) _control->switchTranslationUnit(_previousTranslationUnit);\n    delete _tokens;\n    delete _pool;\n}\n\nbool TranslationUnit::qtMocRunEnabled() const\n{ return f._qtMocRunEnabled; }\n\nvoid TranslationUnit::setQtMocRunEnabled(bool onoff)\n{ f._qtMocRunEnabled = onoff; }\n\nbool TranslationUnit::objCEnabled() const\n{ return f._objCEnabled; }\n\nvoid TranslationUnit::setObjCEnabled(bool onoff)\n{ f._objCEnabled = onoff; }\n\nControl *TranslationUnit::control() const\n{ return _control; }\n\nconst StringLiteral *TranslationUnit::fileId() const\n{ return _fileId; }\n\nconst char *TranslationUnit::fileName() const\n{ return _fileId->chars(); }\n\nunsigned TranslationUnit::fileNameLength() const\n{ return _fileId->size(); }\n\nconst char *TranslationUnit::firstSourceChar() const\n{ return _firstSourceChar; }\n\nconst char *TranslationUnit::lastSourceChar() const\n{ return _lastSourceChar; }\n\nunsigned TranslationUnit::sourceLength() const\n{ return _lastSourceChar - _firstSourceChar; }\n\nvoid TranslationUnit::setSource(const char *source, unsigned size)\n{\n    _firstSourceChar = source;\n    _lastSourceChar = source + size;\n}\n\nunsigned TranslationUnit::tokenCount() const\n{ return _tokens->size(); }\n\nconst Token &TranslationUnit::tokenAt(unsigned index) const\n{ return _tokens->at(index); }\n\nint TranslationUnit::tokenKind(unsigned index) const\n{ return _tokens->at(index).f.kind; }\n\nconst char *TranslationUnit::spell(unsigned index) const\n{\n    if (! index)\n        return 0;\n\n    return _tokens->at(index).spell();\n}\n\nconst Identifier *TranslationUnit::identifier(unsigned index) const\n{ return _tokens->at(index).identifier; }\n\nconst Literal *TranslationUnit::literal(unsigned index) const\n{ return _tokens->at(index).literal; }\n\nconst StringLiteral *TranslationUnit::stringLiteral(unsigned index) const\n{ return _tokens->at(index).string; }\n\nconst NumericLiteral *TranslationUnit::numericLiteral(unsigned index) const\n{ return _tokens->at(index).number; }\n\nunsigned TranslationUnit::matchingBrace(unsigned index) const\n{ return _tokens->at(index).close_brace; }\n\nMemoryPool *TranslationUnit::memoryPool() const\n{ return _pool; }\n\nAST *TranslationUnit::ast() const\n{ return _ast; }\n\nbool TranslationUnit::isTokenized() const\n{ return f._tokenized; }\n\nbool TranslationUnit::isParsed() const\n{ return f._parsed; }\n\nvoid TranslationUnit::tokenize()\n{\n    if (isTokenized())\n        return;\n\n    f._tokenized = true;\n\n    Lexer lex(this);\n    lex.setQtMocRunEnabled(f._qtMocRunEnabled);\n    lex.setObjCEnabled(f._objCEnabled);\n\n    std::stack<unsigned> braces;\n    _tokens->push_back(Token()); \/\/ the first token needs to be invalid!\n\n    pushLineOffset(0);\n    pushPreprocessorLine(0, 1, fileId());\n\n    const Identifier *lineId   = control()->findOrInsertIdentifier(\"line\");\n    const Identifier *genId    = control()->findOrInsertIdentifier(\"gen\");\n\n    bool generated = false;\n    Token tk;\n    do {\n        lex(&tk);\n\n      _Lrecognize:\n        if (tk.is(T_POUND)) {\n            unsigned offset = tk.offset;\n            lex(&tk);\n\n            if (! tk.f.newline && tk.is(T_IDENTIFIER) && tk.identifier == genId) {\n                \/\/ it's a gen directive.\n                lex(&tk);\n\n                if (! tk.f.newline && tk.is(T_TRUE)) {\n                    lex(&tk);\n                    generated = true;\n                } else {\n                    generated = false;\n                }\n            } else {\n                if (! tk.f.newline && tk.is(T_IDENTIFIER) && tk.identifier == lineId)\n                    lex(&tk);\n                if (! tk.f.newline && tk.is(T_NUMERIC_LITERAL)) {\n                    unsigned line = (unsigned) strtoul(tk.spell(), 0, 0);\n                    lex(&tk);\n                    if (! tk.f.newline && tk.is(T_STRING_LITERAL)) {\n                        const StringLiteral *fileName = control()->findOrInsertStringLiteral(tk.string->chars(),\n                                                                                             tk.string->size());\n                        pushPreprocessorLine(offset, line, fileName);\n                        lex(&tk);\n                    }\n                }\n            }\n            while (tk.isNot(T_EOF_SYMBOL) && ! tk.f.newline)\n                lex(&tk);\n            goto _Lrecognize;\n        } else if (tk.f.kind == T_LBRACE) {\n            braces.push(_tokens->size());\n        } else if (tk.f.kind == T_RBRACE && ! braces.empty()) {\n            const unsigned open_brace_index = braces.top();\n            braces.pop();\n            (*_tokens)[open_brace_index].close_brace = _tokens->size();\n        }\n        tk.f.generated = generated;\n        _tokens->push_back(tk);\n    } while (tk.f.kind);\n\n    for (; ! braces.empty(); braces.pop()) {\n        unsigned open_brace_index = braces.top();\n        (*_tokens)[open_brace_index].close_brace = _tokens->size();\n    }\n}\n\nbool TranslationUnit::skipFunctionBody() const\n{ return f._skipFunctionBody; }\n\nvoid TranslationUnit::setSkipFunctionBody(bool skipFunctionBody)\n{ f._skipFunctionBody = skipFunctionBody; }\n\nbool TranslationUnit::parse(ParseMode mode)\n{\n    if (isParsed())\n        return false;\n\n    if (! isTokenized())\n        tokenize();\n\n    f._parsed = true;\n\n    Parser parser(this);\n    parser.setQtMocRunEnabled(f._qtMocRunEnabled);\n    parser.setObjCEnabled(f._objCEnabled);\n\n    bool parsed = false;\n\n    switch (mode) {\n    case ParseTranlationUnit: {\n        TranslationUnitAST *node = 0;\n        parsed = parser.parseTranslationUnit(node);\n        _ast = node;\n    } break;\n\n    case ParseDeclaration: {\n        DeclarationAST *node = 0;\n        parsed = parser.parseDeclaration(node);\n        _ast = node;\n    } break;\n\n    case ParseExpression: {\n        ExpressionAST *node = 0;\n        parsed = parser.parseExpression(node);\n        _ast = node;\n    } break;\n\n    case ParseDeclarator: {\n        DeclaratorAST *node = 0;\n        parsed = parser.parseDeclarator(node);\n        _ast = node;\n    } break;\n\n    case ParseStatement: {\n        StatementAST *node = 0;\n        parsed = parser.parseStatement(node);\n        _ast = node;\n    } break;\n\n    default:\n        break;\n    } \/\/ switch\n\n    return parsed;\n}\n\nvoid TranslationUnit::pushLineOffset(unsigned offset)\n{ _lineOffsets.push_back(offset); }\n\nvoid TranslationUnit::pushPreprocessorLine(unsigned offset,\n                                           unsigned line,\n                                           const StringLiteral *fileName)\n{ _ppLines.push_back(PPLine(offset, line, fileName)); }\n\nunsigned TranslationUnit::findLineNumber(unsigned offset) const\n{\n    std::vector<unsigned>::const_iterator it =\n        std::lower_bound(_lineOffsets.begin(), _lineOffsets.end(), offset);\n\n    if (it != _lineOffsets.begin())\n        --it;\n\n    return it - _lineOffsets.begin();\n}\n\nTranslationUnit::PPLine TranslationUnit::findPreprocessorLine(unsigned offset) const\n{\n    std::vector<PPLine>::const_iterator it =\n        std::lower_bound(_ppLines.begin(), _ppLines.end(), PPLine(offset));\n\n    if (it != _ppLines.begin())\n        --it;\n\n    return *it;\n}\n\nunsigned TranslationUnit::findColumnNumber(unsigned offset, unsigned lineNumber) const\n{\n    if (! offset)\n        return 0;\n\n    return offset - _lineOffsets[lineNumber];\n}\n\nvoid TranslationUnit::getTokenPosition(unsigned index,\n                                       unsigned *line,\n                                       unsigned *column,\n                                       const StringLiteral **fileName) const\n{ return getPosition(tokenAt(index).offset, line, column, fileName); }\n\nvoid TranslationUnit::getTokenStartPosition(unsigned index, unsigned *line,\n                                            unsigned *column,\n                                            const StringLiteral **fileName) const\n{ return getPosition(tokenAt(index).begin(), line, column, fileName); }\n\nvoid TranslationUnit::getTokenEndPosition(unsigned index, unsigned *line,\n                                          unsigned *column,\n                                          const StringLiteral **fileName) const\n{ return getPosition(tokenAt(index).end(), line, column, fileName); }\n\nvoid TranslationUnit::getPosition(unsigned tokenOffset,\n                                  unsigned *line,\n                                  unsigned *column,\n                                  const StringLiteral **fileName) const\n{\n    unsigned lineNumber = findLineNumber(tokenOffset);\n    unsigned columnNumber = findColumnNumber(tokenOffset, lineNumber);\n    const PPLine ppLine = findPreprocessorLine(tokenOffset);\n\n    lineNumber -= findLineNumber(ppLine.offset) + 1;\n    lineNumber += ppLine.line;\n\n    if (line)\n        *line = lineNumber;\n\n    if (column)\n        *column = columnNumber;\n\n    if (fileName)\n       *fileName = ppLine.fileName;\n}\n\nbool TranslationUnit::blockErrors(bool block)\n{\n    bool previous = f._blockErrors;\n    f._blockErrors = block;\n    return previous;\n}\n\nvoid TranslationUnit::warning(unsigned index, const char *format, ...)\n{\n    if (f._blockErrors)\n        return;\n\n    index = std::min(index, tokenCount() - 1);\n\n    unsigned line = 0, column = 0;\n    const StringLiteral *fileName = 0;\n    getTokenPosition(index, &line, &column, &fileName);\n\n    if (DiagnosticClient *client = control()->diagnosticClient()) {\n        va_list args;\n        va_start(args, format);\n        client->report(DiagnosticClient::Warning, fileName, line, column,\n                       format, args);\n        va_end(args);\n    } else {\n        fprintf(stderr, \"%s:%d: \", fileName->chars(), line);\n        fprintf(stderr, \"warning: \");\n\n        va_list args;\n        va_start(args, format);\n        vfprintf(stderr, format, args);\n        va_end(args);\n        fputc('\\n', stderr);\n\n        showErrorLine(index, column, stderr);\n    }\n}\n\nvoid TranslationUnit::error(unsigned index, const char *format, ...)\n{\n    if (f._blockErrors)\n        return;\n\n    index = std::min(index, tokenCount() - 1);\n\n    unsigned line = 0, column = 0;\n    const StringLiteral *fileName = 0;\n    getTokenPosition(index, &line, &column, &fileName);\n\n    if (DiagnosticClient *client = control()->diagnosticClient()) {\n        va_list args;\n        va_start(args, format);\n        client->report(DiagnosticClient::Error, fileName, line, column,\n                       format, args);\n        va_end(args);\n    } else {\n        fprintf(stderr, \"%s:%d: \", fileName->chars(), line);\n        fprintf(stderr, \"error: \");\n\n        va_list args;\n        va_start(args, format);\n        vfprintf(stderr, format, args);\n        va_end(args);\n        fputc('\\n', stderr);\n\n        showErrorLine(index, column, stderr);\n    }\n}\n\nvoid TranslationUnit::fatal(unsigned index, const char *format, ...)\n{\n    if (f._blockErrors)\n        return;\n\n    index = std::min(index, tokenCount() - 1);\n\n    unsigned line = 0, column = 0;\n    const StringLiteral *fileName = 0;\n    getTokenPosition(index, &line, &column, &fileName);\n\n    if (DiagnosticClient *client = control()->diagnosticClient()) {\n        va_list args;\n        va_start(args, format);\n        client->report(DiagnosticClient::Fatal, fileName, line, column,\n                       format, args);\n        va_end(args);\n    } else {\n        fprintf(stderr, \"%s:%d: \", fileName->chars(), line);\n        fprintf(stderr, \"fatal: \");\n\n        va_list args;\n        va_start(args, format);\n        vfprintf(stderr, format, args);\n        va_end(args);\n        fputc('\\n', stderr);\n\n        showErrorLine(index, column, stderr);\n    }\n\n    exit(EXIT_FAILURE);\n}\n\nunsigned TranslationUnit::findPreviousLineOffset(unsigned tokenIndex) const\n{\n    unsigned lineOffset = _lineOffsets[findLineNumber(_tokens->at(tokenIndex).offset)];\n    return lineOffset;\n}\n\nvoid TranslationUnit::showErrorLine(unsigned index, unsigned column, FILE *out)\n{\n    unsigned lineOffset = _lineOffsets[findLineNumber(_tokens->at(index).offset)];\n    for (const char *cp = _firstSourceChar + lineOffset + 1; *cp && *cp != '\\n'; ++cp) {\n        fputc(*cp, out);\n    }\n    fputc('\\n', out);\n\n    const char *end = _firstSourceChar + lineOffset + 1 + column - 1;\n    for (const char *cp = _firstSourceChar + lineOffset + 1; cp != end; ++cp) {\n        if (*cp != '\\t')\n            fputc(' ', out);\n        else\n            fputc('\\t', out);\n    }\n    fputc('^', out);\n    fputc('\\n', out);\n}\n\nvoid TranslationUnit::resetAST()\n{\n    delete _pool;\n    _pool = 0;\n}\n\nvoid TranslationUnit::release()\n{\n    resetAST();\n    delete _tokens;\n    _tokens = 0;\n}\n\n\n<commit_msg>Reset the AST<commit_after>\/**************************************************************************\n**\n** This file is part of Qt Creator\n**\n** Copyright (c) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n**\n** Contact: 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\/\/ Copyright (c) 2008 Roberto Raggi <roberto.raggi@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#include \"TranslationUnit.h\"\n#include \"Control.h\"\n#include \"Parser.h\"\n#include \"Lexer.h\"\n#include \"MemoryPool.h\"\n#include \"AST.h\"\n#include \"Literals.h\"\n#include \"DiagnosticClient.h\"\n#include <stack>\n#include <cstdarg>\n#include <algorithm>\n\nusing namespace CPlusPlus;\n\nTranslationUnit::TranslationUnit(Control *control, const StringLiteral *fileId)\n    : _control(control),\n      _fileId(fileId),\n      _firstSourceChar(0),\n      _lastSourceChar(0),\n      _pool(0),\n      _ast(0),\n      _flags(0)\n{\n    _tokens = new Array<Token, 8>();\n    _previousTranslationUnit = control->switchTranslationUnit(this);\n    _pool = new MemoryPool();\n}\n\nTranslationUnit::~TranslationUnit()\n{\n    (void) _control->switchTranslationUnit(_previousTranslationUnit);\n    delete _tokens;\n    delete _pool;\n}\n\nbool TranslationUnit::qtMocRunEnabled() const\n{ return f._qtMocRunEnabled; }\n\nvoid TranslationUnit::setQtMocRunEnabled(bool onoff)\n{ f._qtMocRunEnabled = onoff; }\n\nbool TranslationUnit::objCEnabled() const\n{ return f._objCEnabled; }\n\nvoid TranslationUnit::setObjCEnabled(bool onoff)\n{ f._objCEnabled = onoff; }\n\nControl *TranslationUnit::control() const\n{ return _control; }\n\nconst StringLiteral *TranslationUnit::fileId() const\n{ return _fileId; }\n\nconst char *TranslationUnit::fileName() const\n{ return _fileId->chars(); }\n\nunsigned TranslationUnit::fileNameLength() const\n{ return _fileId->size(); }\n\nconst char *TranslationUnit::firstSourceChar() const\n{ return _firstSourceChar; }\n\nconst char *TranslationUnit::lastSourceChar() const\n{ return _lastSourceChar; }\n\nunsigned TranslationUnit::sourceLength() const\n{ return _lastSourceChar - _firstSourceChar; }\n\nvoid TranslationUnit::setSource(const char *source, unsigned size)\n{\n    _firstSourceChar = source;\n    _lastSourceChar = source + size;\n}\n\nunsigned TranslationUnit::tokenCount() const\n{ return _tokens->size(); }\n\nconst Token &TranslationUnit::tokenAt(unsigned index) const\n{ return _tokens->at(index); }\n\nint TranslationUnit::tokenKind(unsigned index) const\n{ return _tokens->at(index).f.kind; }\n\nconst char *TranslationUnit::spell(unsigned index) const\n{\n    if (! index)\n        return 0;\n\n    return _tokens->at(index).spell();\n}\n\nconst Identifier *TranslationUnit::identifier(unsigned index) const\n{ return _tokens->at(index).identifier; }\n\nconst Literal *TranslationUnit::literal(unsigned index) const\n{ return _tokens->at(index).literal; }\n\nconst StringLiteral *TranslationUnit::stringLiteral(unsigned index) const\n{ return _tokens->at(index).string; }\n\nconst NumericLiteral *TranslationUnit::numericLiteral(unsigned index) const\n{ return _tokens->at(index).number; }\n\nunsigned TranslationUnit::matchingBrace(unsigned index) const\n{ return _tokens->at(index).close_brace; }\n\nMemoryPool *TranslationUnit::memoryPool() const\n{ return _pool; }\n\nAST *TranslationUnit::ast() const\n{ return _ast; }\n\nbool TranslationUnit::isTokenized() const\n{ return f._tokenized; }\n\nbool TranslationUnit::isParsed() const\n{ return f._parsed; }\n\nvoid TranslationUnit::tokenize()\n{\n    if (isTokenized())\n        return;\n\n    f._tokenized = true;\n\n    Lexer lex(this);\n    lex.setQtMocRunEnabled(f._qtMocRunEnabled);\n    lex.setObjCEnabled(f._objCEnabled);\n\n    std::stack<unsigned> braces;\n    _tokens->push_back(Token()); \/\/ the first token needs to be invalid!\n\n    pushLineOffset(0);\n    pushPreprocessorLine(0, 1, fileId());\n\n    const Identifier *lineId   = control()->findOrInsertIdentifier(\"line\");\n    const Identifier *genId    = control()->findOrInsertIdentifier(\"gen\");\n\n    bool generated = false;\n    Token tk;\n    do {\n        lex(&tk);\n\n      _Lrecognize:\n        if (tk.is(T_POUND)) {\n            unsigned offset = tk.offset;\n            lex(&tk);\n\n            if (! tk.f.newline && tk.is(T_IDENTIFIER) && tk.identifier == genId) {\n                \/\/ it's a gen directive.\n                lex(&tk);\n\n                if (! tk.f.newline && tk.is(T_TRUE)) {\n                    lex(&tk);\n                    generated = true;\n                } else {\n                    generated = false;\n                }\n            } else {\n                if (! tk.f.newline && tk.is(T_IDENTIFIER) && tk.identifier == lineId)\n                    lex(&tk);\n                if (! tk.f.newline && tk.is(T_NUMERIC_LITERAL)) {\n                    unsigned line = (unsigned) strtoul(tk.spell(), 0, 0);\n                    lex(&tk);\n                    if (! tk.f.newline && tk.is(T_STRING_LITERAL)) {\n                        const StringLiteral *fileName = control()->findOrInsertStringLiteral(tk.string->chars(),\n                                                                                             tk.string->size());\n                        pushPreprocessorLine(offset, line, fileName);\n                        lex(&tk);\n                    }\n                }\n            }\n            while (tk.isNot(T_EOF_SYMBOL) && ! tk.f.newline)\n                lex(&tk);\n            goto _Lrecognize;\n        } else if (tk.f.kind == T_LBRACE) {\n            braces.push(_tokens->size());\n        } else if (tk.f.kind == T_RBRACE && ! braces.empty()) {\n            const unsigned open_brace_index = braces.top();\n            braces.pop();\n            (*_tokens)[open_brace_index].close_brace = _tokens->size();\n        }\n        tk.f.generated = generated;\n        _tokens->push_back(tk);\n    } while (tk.f.kind);\n\n    for (; ! braces.empty(); braces.pop()) {\n        unsigned open_brace_index = braces.top();\n        (*_tokens)[open_brace_index].close_brace = _tokens->size();\n    }\n}\n\nbool TranslationUnit::skipFunctionBody() const\n{ return f._skipFunctionBody; }\n\nvoid TranslationUnit::setSkipFunctionBody(bool skipFunctionBody)\n{ f._skipFunctionBody = skipFunctionBody; }\n\nbool TranslationUnit::parse(ParseMode mode)\n{\n    if (isParsed())\n        return false;\n\n    if (! isTokenized())\n        tokenize();\n\n    f._parsed = true;\n\n    Parser parser(this);\n    parser.setQtMocRunEnabled(f._qtMocRunEnabled);\n    parser.setObjCEnabled(f._objCEnabled);\n\n    bool parsed = false;\n\n    switch (mode) {\n    case ParseTranlationUnit: {\n        TranslationUnitAST *node = 0;\n        parsed = parser.parseTranslationUnit(node);\n        _ast = node;\n    } break;\n\n    case ParseDeclaration: {\n        DeclarationAST *node = 0;\n        parsed = parser.parseDeclaration(node);\n        _ast = node;\n    } break;\n\n    case ParseExpression: {\n        ExpressionAST *node = 0;\n        parsed = parser.parseExpression(node);\n        _ast = node;\n    } break;\n\n    case ParseDeclarator: {\n        DeclaratorAST *node = 0;\n        parsed = parser.parseDeclarator(node);\n        _ast = node;\n    } break;\n\n    case ParseStatement: {\n        StatementAST *node = 0;\n        parsed = parser.parseStatement(node);\n        _ast = node;\n    } break;\n\n    default:\n        break;\n    } \/\/ switch\n\n    return parsed;\n}\n\nvoid TranslationUnit::pushLineOffset(unsigned offset)\n{ _lineOffsets.push_back(offset); }\n\nvoid TranslationUnit::pushPreprocessorLine(unsigned offset,\n                                           unsigned line,\n                                           const StringLiteral *fileName)\n{ _ppLines.push_back(PPLine(offset, line, fileName)); }\n\nunsigned TranslationUnit::findLineNumber(unsigned offset) const\n{\n    std::vector<unsigned>::const_iterator it =\n        std::lower_bound(_lineOffsets.begin(), _lineOffsets.end(), offset);\n\n    if (it != _lineOffsets.begin())\n        --it;\n\n    return it - _lineOffsets.begin();\n}\n\nTranslationUnit::PPLine TranslationUnit::findPreprocessorLine(unsigned offset) const\n{\n    std::vector<PPLine>::const_iterator it =\n        std::lower_bound(_ppLines.begin(), _ppLines.end(), PPLine(offset));\n\n    if (it != _ppLines.begin())\n        --it;\n\n    return *it;\n}\n\nunsigned TranslationUnit::findColumnNumber(unsigned offset, unsigned lineNumber) const\n{\n    if (! offset)\n        return 0;\n\n    return offset - _lineOffsets[lineNumber];\n}\n\nvoid TranslationUnit::getTokenPosition(unsigned index,\n                                       unsigned *line,\n                                       unsigned *column,\n                                       const StringLiteral **fileName) const\n{ return getPosition(tokenAt(index).offset, line, column, fileName); }\n\nvoid TranslationUnit::getTokenStartPosition(unsigned index, unsigned *line,\n                                            unsigned *column,\n                                            const StringLiteral **fileName) const\n{ return getPosition(tokenAt(index).begin(), line, column, fileName); }\n\nvoid TranslationUnit::getTokenEndPosition(unsigned index, unsigned *line,\n                                          unsigned *column,\n                                          const StringLiteral **fileName) const\n{ return getPosition(tokenAt(index).end(), line, column, fileName); }\n\nvoid TranslationUnit::getPosition(unsigned tokenOffset,\n                                  unsigned *line,\n                                  unsigned *column,\n                                  const StringLiteral **fileName) const\n{\n    unsigned lineNumber = findLineNumber(tokenOffset);\n    unsigned columnNumber = findColumnNumber(tokenOffset, lineNumber);\n    const PPLine ppLine = findPreprocessorLine(tokenOffset);\n\n    lineNumber -= findLineNumber(ppLine.offset) + 1;\n    lineNumber += ppLine.line;\n\n    if (line)\n        *line = lineNumber;\n\n    if (column)\n        *column = columnNumber;\n\n    if (fileName)\n       *fileName = ppLine.fileName;\n}\n\nbool TranslationUnit::blockErrors(bool block)\n{\n    bool previous = f._blockErrors;\n    f._blockErrors = block;\n    return previous;\n}\n\nvoid TranslationUnit::warning(unsigned index, const char *format, ...)\n{\n    if (f._blockErrors)\n        return;\n\n    index = std::min(index, tokenCount() - 1);\n\n    unsigned line = 0, column = 0;\n    const StringLiteral *fileName = 0;\n    getTokenPosition(index, &line, &column, &fileName);\n\n    if (DiagnosticClient *client = control()->diagnosticClient()) {\n        va_list args;\n        va_start(args, format);\n        client->report(DiagnosticClient::Warning, fileName, line, column,\n                       format, args);\n        va_end(args);\n    } else {\n        fprintf(stderr, \"%s:%d: \", fileName->chars(), line);\n        fprintf(stderr, \"warning: \");\n\n        va_list args;\n        va_start(args, format);\n        vfprintf(stderr, format, args);\n        va_end(args);\n        fputc('\\n', stderr);\n\n        showErrorLine(index, column, stderr);\n    }\n}\n\nvoid TranslationUnit::error(unsigned index, const char *format, ...)\n{\n    if (f._blockErrors)\n        return;\n\n    index = std::min(index, tokenCount() - 1);\n\n    unsigned line = 0, column = 0;\n    const StringLiteral *fileName = 0;\n    getTokenPosition(index, &line, &column, &fileName);\n\n    if (DiagnosticClient *client = control()->diagnosticClient()) {\n        va_list args;\n        va_start(args, format);\n        client->report(DiagnosticClient::Error, fileName, line, column,\n                       format, args);\n        va_end(args);\n    } else {\n        fprintf(stderr, \"%s:%d: \", fileName->chars(), line);\n        fprintf(stderr, \"error: \");\n\n        va_list args;\n        va_start(args, format);\n        vfprintf(stderr, format, args);\n        va_end(args);\n        fputc('\\n', stderr);\n\n        showErrorLine(index, column, stderr);\n    }\n}\n\nvoid TranslationUnit::fatal(unsigned index, const char *format, ...)\n{\n    if (f._blockErrors)\n        return;\n\n    index = std::min(index, tokenCount() - 1);\n\n    unsigned line = 0, column = 0;\n    const StringLiteral *fileName = 0;\n    getTokenPosition(index, &line, &column, &fileName);\n\n    if (DiagnosticClient *client = control()->diagnosticClient()) {\n        va_list args;\n        va_start(args, format);\n        client->report(DiagnosticClient::Fatal, fileName, line, column,\n                       format, args);\n        va_end(args);\n    } else {\n        fprintf(stderr, \"%s:%d: \", fileName->chars(), line);\n        fprintf(stderr, \"fatal: \");\n\n        va_list args;\n        va_start(args, format);\n        vfprintf(stderr, format, args);\n        va_end(args);\n        fputc('\\n', stderr);\n\n        showErrorLine(index, column, stderr);\n    }\n\n    exit(EXIT_FAILURE);\n}\n\nunsigned TranslationUnit::findPreviousLineOffset(unsigned tokenIndex) const\n{\n    unsigned lineOffset = _lineOffsets[findLineNumber(_tokens->at(tokenIndex).offset)];\n    return lineOffset;\n}\n\nvoid TranslationUnit::showErrorLine(unsigned index, unsigned column, FILE *out)\n{\n    unsigned lineOffset = _lineOffsets[findLineNumber(_tokens->at(index).offset)];\n    for (const char *cp = _firstSourceChar + lineOffset + 1; *cp && *cp != '\\n'; ++cp) {\n        fputc(*cp, out);\n    }\n    fputc('\\n', out);\n\n    const char *end = _firstSourceChar + lineOffset + 1 + column - 1;\n    for (const char *cp = _firstSourceChar + lineOffset + 1; cp != end; ++cp) {\n        if (*cp != '\\t')\n            fputc(' ', out);\n        else\n            fputc('\\t', out);\n    }\n    fputc('^', out);\n    fputc('\\n', out);\n}\n\nvoid TranslationUnit::resetAST()\n{\n    delete _pool;\n    _pool = 0;\n    _ast = 0;\n}\n\nvoid TranslationUnit::release()\n{\n    resetAST();\n    delete _tokens;\n    _tokens = 0;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ -*- mode: c++; coding: utf-8 -*-\n\/*! @file exclusivity.cpp\n    @brief Inplementation of Exclusivity class\n*\/\n#include \"exclusivity.hpp\"\n\n#include <functional>\n#include <unordered_map>\n#include <csignal>\n\n#include <boost\/dynamic_bitset.hpp>\n\n#include <cxxwtils\/debug.hpp>\n#include <cxxwtils\/exception.hpp>\n#include <cxxwtils\/iostr.hpp>\n#include <cxxwtils\/numeric.hpp>\n#include <cxxwtils\/math.hpp>\n#include <cxxwtils\/eigen.hpp>\n#include <cxxwtils\/itertools.hpp>\n#include <cxxwtils\/gz.hpp>\n\nnamespace {\n    bool SIGINT_RAISED = false;\n}\n\nnamespace likeligrid {\n\nconst std::vector<double> ExclusivityModel::STEPS_ = {0.4, 0.2, 0.1, 0.05, 0.02, 0.01};\nconst std::vector<size_t> ExclusivityModel::BREAKS_ = {5, 5, 5, 6, 5, 5};\n\nExclusivityModel::ExclusivityModel(std::istream& genotypes,\n    const size_t max_sites,\n    const size_t max_results):\n    names_(wtl::read_header(genotypes)),\n    genotypes_(wtl::eigen::read_array<size_t>(genotypes, names_.size())),\n    max_results_(max_results)\n    {HERE;\n\n    const ArrayXu raw_s_sample = genotypes_.rowwise().sum().array();\n    nsam_with_s_.assign(raw_s_sample.maxCoeff() + 1, 0);\n    for (Eigen::Index i=0; i<raw_s_sample.size(); ++i) {\n        ++nsam_with_s_[raw_s_sample[i]];\n    }\n    std::cerr << \"Original N_s: \" << nsam_with_s_ << std::endl;\n    if (nsam_with_s_.size() - 1 < max_sites) {\n        std::cerr << \"Note: -s is too large\" << std::endl;\n    } else {\n        nsam_with_s_.resize(max_sites + 1);\n        std::cerr << \"Filtered N_s: \" << nsam_with_s_ << std::endl;\n    }\n    const auto final_max_s = nsam_with_s_.size() - 1;\n    genotypes_ = wtl::eigen::filter(genotypes_, raw_s_sample <= final_max_s);\n\n    const Eigen::ArrayXd s_pathway = genotypes_.colwise().sum().cast<double>();\n    w_pathway_ = s_pathway \/ s_pathway.sum();\n    a_pathway_ = genotypes_.unaryExpr([](size_t x){\n        if (x > 0) {return --x;} else {return x;}\n    }).colwise().sum().cast<double>();\n    lnp_const_ = (s_pathway * w_pathway_.log()).sum();\n    for (Eigen::Index i=0; i<genotypes_.rows(); ++i) {\n        auto v = wtl::eigen::valarray(genotypes_.row(i));\n        lnp_const_ += std::log(wtl::polynomial(v));\n    }\n    std::cerr << \"s_pathway_: \" << s_pathway.transpose() << std::endl;\n    std::cerr << \"w_pathway_: \" << w_pathway_.transpose() << std::endl;\n    std::cerr << \"a_pathway_: \" << a_pathway_.transpose() << std::endl;\n    std::cerr << \"lnp_const_: \" << lnp_const_ << std::endl;\n\n    index_iters_.reserve(nsam_with_s_.size());\n    std::vector<size_t> indices(genotypes_.cols());\n    std::iota(std::begin(indices), std::end(indices), 0);\n    for (size_t s=0; s<=nsam_with_s_.size(); ++s) {\n        index_iters_.emplace_back(std::vector<std::vector<size_t>>(s, indices));\n    }\n    std::signal(SIGINT, [](int signum){\n        if (signum == SIGINT) SIGINT_RAISED = true;\n        \/\/ TODO: how to handle other signum?\n    });\n}\n\ninline std::vector<Eigen::ArrayXd>\nmake_vicinity(const Eigen::ArrayXd& center, const size_t breaks, const double radius, const double max=1.0) {\n    std::vector<Eigen::ArrayXd> axes;\n    axes.reserve(center.size());\n    for (const double x: wtl::eigen::vector(center)){\n        Eigen::ArrayXd axis = Eigen::ArrayXd::LinSpaced(breaks, x + radius, x - radius);\n        axes.push_back(wtl::eigen::filter(axis, (0.0 < axis) * (axis < max)));\n    }\n    return axes;\n}\n\nvoid ExclusivityModel::run(const std::string& infile) {HERE;\n    init_axes(infile);\n    if (stage_ == STEPS_.size()) {\n        std::cerr << \"Done: step size = \" << STEPS_.back() << std::endl;\n        --stage_;\n        max_results_ = -1;\n        if (true) {\n            axes_.assign(names_.size(), Eigen::ArrayXd::LinSpaced(100, 1.0, 0.01));\n            run_impl(name_outfile(\"uniaxis\"), wtl::itertools::uniaxis(axes_, mle_params_));\n        } else {\n            \/\/TODO\n            const auto axes = make_vicinity(mle_params_, 21, 1.0);\n            const auto vicinity = make_vicinity(mle_params_, 3, 0.01, 1.2);\n            run_impl(name_outfile(\"prototype\"), wtl::itertools::prototype(axes, vicinity));\n        }\n        return;\n    }\n    const std::string outfile = name_outfile(infile);\n    if (read_results(outfile) && start_ == 0) {\n        std::cerr << outfile << \" is already completed:\" << std::endl;\n        run(outfile);\n        return;\n    }\n    std::cerr << \"Start: \" << start_ << std::endl;\n    for (size_t j=0; j<names_.size(); ++j) {\n        std::cerr << names_[j] << \": \" << axes_[j].transpose() << std::endl;\n    }\n    run_impl(outfile, wtl::itertools::product(axes_));\n    if (outfile != \"\/dev\/null\") {\n        run(outfile);\n    }\n}\n\nvoid ExclusivityModel::init_axes(const std::string& infile) {HERE;\n    if (mle_params_.size() > 0 || read_results(infile)) {\n        std::cerr << mle_params_.transpose() << std::endl;\n        if (start_ > 0) {\n            throw std::runtime_error(\"infile must be a complete result\");\n        }\n        axes_ = make_vicinity(mle_params_, BREAKS_.at(stage_), STEPS_.at(stage_), 2.0);\n        ++stage_;\n    } else {\n        const double step = STEPS_[0];\n        const size_t breaks = BREAKS_[0];\n        axes_.assign(names_.size(), Eigen::VectorXd::LinSpaced(breaks, 2.0, step).array());\n    }\n}\n\nstd::string ExclusivityModel::name_outfile(const std::string& infile) const {HERE;\n    std::string prefix = \"output\";\n    if (infile == \"\/dev\/null\") {\n        return infile;\n    } else if (!infile.empty()) {\n        prefix = wtl::split(infile, \"-\")[0];\n    }\n    std::ostringstream oss(prefix, std::ios::ate);\n    oss << \"-s\" << nsam_with_s_.size() - 1\n        << \"-step\" << STEPS_.at(stage_)\n        << \".tsv.gz\";\n    return oss.str();\n}\n\nvoid ExclusivityModel::run_impl(const std::string& outfile, wtl::itertools::Generator<Eigen::ArrayXd>&& gen) {HERE;\n    const auto max_count = gen.max_count();\n    auto buffer = wtl::make_oss();\n    std::ios::openmode mode = std::ios::out;\n    if (start_ == 0) {\n        buffer << \"##max_count=\" << max_count << \"\\n\";\n        buffer << \"##max_sites=\" << nsam_with_s_.size() - 1 << \"\\n\";\n        buffer << \"##step=\" << STEPS_.at(stage_) << \"\\n\";\n        buffer << \"loglik\\t\" << wtl::join(names_, \"\\t\") << \"\\n\";\n    } else {\n        mode |= std::ios::app;\n    }\n    std::cerr << \"\\nWriting to \" << outfile << std::endl;\n    wtl::ogzstream fout(outfile, mode);\n    double max_ll = std::numeric_limits<double>::lowest();\n    for (const auto& params: gen(start_)) {\n        if (gen.count() % 10000 == 0) {  \/\/ snapshot for long run\n            std::cerr << \"\\r\" << gen.count() << \" in \" << max_count << std::flush;\n            fout << buffer.str();\n            fout.strict_sync();\n            buffer.str(\"\");\n        }\n\n        double loglik = 0.0;\n        loglik += (a_pathway_ * params.log()).sum();\n        for (size_t s=0; s<nsam_with_s_.size(); ++s) {\n            loglik -= nsam_with_s_[s] * std::log(calc_denom(w_pathway_, params, s));\n        }\n\n        buffer << (loglik += lnp_const_) << \"\\t\"\n               << wtl::join(wtl::eigen::vector(params), \"\\t\") << \"\\n\";\n        if (loglik > max_ll) {\n            max_ll = loglik;\n            mle_params_ = params;\n        }\n        if (SIGINT_RAISED) {throw wtl::ExitSuccess(\"KeyboardInterrupt\");}\n    }\n    fout << buffer.str();\n}\n\ndouble ExclusivityModel::calc_denom(\n    const Eigen::ArrayXd& w_pathway,\n    const Eigen::ArrayXd& x_pathway,\n    const size_t num_mutations) {\n\n    if (num_mutations < 2) return 1.0;\n    auto& iter = index_iters_[num_mutations];\n    double sum_prob = 0.0;\n    boost::dynamic_bitset<> bits(x_pathway.size());\n    for (const auto& indices: iter()) {\n        double p = 1.0;\n        for (const auto j: indices) {\n            p *= w_pathway[j];\n            if (bits[j]) p *= x_pathway[j];\n            bits.set(j);\n        }\n        sum_prob += p;\n        bits.reset();\n    }\n    iter.reset();\n    return sum_prob;\n}\n\nstd::ostream& ExclusivityModel::write_genotypes(std::ostream& ost, const bool header) const {HERE;\n    if (header) {ost << wtl::join(names_, \"\\t\") << \"\\n\";}\n    return ost << genotypes_.format(wtl::eigen::tsv());\n}\n\nbool ExclusivityModel::read_results(const std::string& infile) {HERE;\n    wtl::igzstream ist(infile);\n    if (!ist || infile == \"\/dev\/null\") return false;\n    std::cerr << \"Reading: \" << infile << std::endl;\n    const size_t max_count = read_metadata(ist);\n    start_ = read_body(ist);\n    if (start_ == max_count) start_ = 0;\n    return true;\n}\n\nsize_t ExclusivityModel::read_metadata(std::istream& ist) {HERE;\n    std::string buffer;\n    std::getline(ist, buffer);\n    const size_t max_count = std::stoul(wtl::split(buffer, \"=\")[1]);\n    std::getline(ist, buffer);\n    const size_t max_sites = std::stoul(wtl::split(buffer, \"=\")[1]);\n    if (nsam_with_s_.size() - 1 != max_sites) {\n        std::cerr << \"Note: -s is different between arg and file\\n\";\n    }\n    std::getline(ist, buffer);\n    const double step = std::stod(wtl::split(buffer, \"=\")[1]);\n    auto pred = std::bind(wtl::equal<double>, std::placeholders::_1, step);\n    const auto it = std::find_if(STEPS_.begin(), STEPS_.end(), pred);\n    if (it == STEPS_.end()) throw std::runtime_error(\"invalid step size\");\n    stage_ = it - STEPS_.begin();\n    return max_count;\n}\n\nsize_t ExclusivityModel::read_body(std::istream& ist) {HERE;\n    std::string buffer;\n    ist >> buffer; \/\/ loglik\n    std::getline(ist, buffer); \/\/ header\n    buffer.erase(0, 1); \/\/ \\t\n    if (names_ != wtl::split(buffer, \"\\t\")) {\n        std::cerr << names_ << std::endl;\n        std::cerr << wtl::split(buffer, \"\\t\") << std::endl;\n        throw std::runtime_error(\"Column names are wrong\");\n    }\n    size_t i = 0;\n    double max_ll = std::numeric_limits<double>::lowest();\n    while (std::getline(ist, buffer)) {\n        ++i;\n        std::istringstream iss(buffer);\n        std::istream_iterator<double> it(iss);\n        if (*it > max_ll) {\n            max_ll = *it;\n            mle_params_ = wtl::eigen::ArrayX(std::vector<double>(++it, std::istream_iterator<double>()));\n        }\n    }\n    return i;\n}\n\nvoid ExclusivityModel::unit_test() {HERE;\n    std::string geno = \"A\\tB\\n0\\t1\\n1\\t0\\n1\\t1\\n0\\t2\\n\";\n    std::istringstream iss(geno);\n    ExclusivityModel model(iss);\n    model.write_genotypes(std::cerr);\n    model.run(\"\/dev\/null\");\n}\n\n} \/\/ namespace likeligrid\n<commit_msg>Expand uniaxis output to (0, 2]<commit_after>\/\/ -*- mode: c++; coding: utf-8 -*-\n\/*! @file exclusivity.cpp\n    @brief Inplementation of Exclusivity class\n*\/\n#include \"exclusivity.hpp\"\n\n#include <functional>\n#include <unordered_map>\n#include <csignal>\n\n#include <boost\/dynamic_bitset.hpp>\n\n#include <cxxwtils\/debug.hpp>\n#include <cxxwtils\/exception.hpp>\n#include <cxxwtils\/iostr.hpp>\n#include <cxxwtils\/numeric.hpp>\n#include <cxxwtils\/math.hpp>\n#include <cxxwtils\/eigen.hpp>\n#include <cxxwtils\/itertools.hpp>\n#include <cxxwtils\/gz.hpp>\n\nnamespace {\n    bool SIGINT_RAISED = false;\n}\n\nnamespace likeligrid {\n\nconst std::vector<double> ExclusivityModel::STEPS_ = {0.4, 0.2, 0.1, 0.05, 0.02, 0.01};\nconst std::vector<size_t> ExclusivityModel::BREAKS_ = {5, 5, 5, 6, 5, 5};\n\nExclusivityModel::ExclusivityModel(std::istream& genotypes,\n    const size_t max_sites,\n    const size_t max_results):\n    names_(wtl::read_header(genotypes)),\n    genotypes_(wtl::eigen::read_array<size_t>(genotypes, names_.size())),\n    max_results_(max_results)\n    {HERE;\n\n    const ArrayXu raw_s_sample = genotypes_.rowwise().sum().array();\n    nsam_with_s_.assign(raw_s_sample.maxCoeff() + 1, 0);\n    for (Eigen::Index i=0; i<raw_s_sample.size(); ++i) {\n        ++nsam_with_s_[raw_s_sample[i]];\n    }\n    std::cerr << \"Original N_s: \" << nsam_with_s_ << std::endl;\n    if (nsam_with_s_.size() - 1 < max_sites) {\n        std::cerr << \"Note: -s is too large\" << std::endl;\n    } else {\n        nsam_with_s_.resize(max_sites + 1);\n        std::cerr << \"Filtered N_s: \" << nsam_with_s_ << std::endl;\n    }\n    const auto final_max_s = nsam_with_s_.size() - 1;\n    genotypes_ = wtl::eigen::filter(genotypes_, raw_s_sample <= final_max_s);\n\n    const Eigen::ArrayXd s_pathway = genotypes_.colwise().sum().cast<double>();\n    w_pathway_ = s_pathway \/ s_pathway.sum();\n    a_pathway_ = genotypes_.unaryExpr([](size_t x){\n        if (x > 0) {return --x;} else {return x;}\n    }).colwise().sum().cast<double>();\n    lnp_const_ = (s_pathway * w_pathway_.log()).sum();\n    for (Eigen::Index i=0; i<genotypes_.rows(); ++i) {\n        auto v = wtl::eigen::valarray(genotypes_.row(i));\n        lnp_const_ += std::log(wtl::polynomial(v));\n    }\n    std::cerr << \"s_pathway_: \" << s_pathway.transpose() << std::endl;\n    std::cerr << \"w_pathway_: \" << w_pathway_.transpose() << std::endl;\n    std::cerr << \"a_pathway_: \" << a_pathway_.transpose() << std::endl;\n    std::cerr << \"lnp_const_: \" << lnp_const_ << std::endl;\n\n    index_iters_.reserve(nsam_with_s_.size());\n    std::vector<size_t> indices(genotypes_.cols());\n    std::iota(std::begin(indices), std::end(indices), 0);\n    for (size_t s=0; s<=nsam_with_s_.size(); ++s) {\n        index_iters_.emplace_back(std::vector<std::vector<size_t>>(s, indices));\n    }\n    std::signal(SIGINT, [](int signum){\n        if (signum == SIGINT) SIGINT_RAISED = true;\n        \/\/ TODO: how to handle other signum?\n    });\n}\n\ninline std::vector<Eigen::ArrayXd>\nmake_vicinity(const Eigen::ArrayXd& center, const size_t breaks, const double radius, const double max=1.0) {\n    std::vector<Eigen::ArrayXd> axes;\n    axes.reserve(center.size());\n    for (const double x: wtl::eigen::vector(center)){\n        Eigen::ArrayXd axis = Eigen::ArrayXd::LinSpaced(breaks, x + radius, x - radius);\n        axes.push_back(wtl::eigen::filter(axis, (0.0 < axis) * (axis < max)));\n    }\n    return axes;\n}\n\nvoid ExclusivityModel::run(const std::string& infile) {HERE;\n    init_axes(infile);\n    if (stage_ == STEPS_.size()) {\n        std::cerr << \"Done: step size = \" << STEPS_.back() << std::endl;\n        --stage_;\n        max_results_ = -1;\n        if (true) {\n            axes_.assign(names_.size(), Eigen::ArrayXd::LinSpaced(200, 2.0, 0.01));\n            run_impl(name_outfile(\"uniaxis\"), wtl::itertools::uniaxis(axes_, mle_params_));\n        } else {\n            \/\/TODO\n            const auto axes = make_vicinity(mle_params_, 21, 1.0);\n            const auto vicinity = make_vicinity(mle_params_, 3, 0.01, 1.2);\n            run_impl(name_outfile(\"prototype\"), wtl::itertools::prototype(axes, vicinity));\n        }\n        return;\n    }\n    const std::string outfile = name_outfile(infile);\n    if (read_results(outfile) && start_ == 0) {\n        std::cerr << outfile << \" is already completed:\" << std::endl;\n        run(outfile);\n        return;\n    }\n    std::cerr << \"Start: \" << start_ << std::endl;\n    for (size_t j=0; j<names_.size(); ++j) {\n        std::cerr << names_[j] << \": \" << axes_[j].transpose() << std::endl;\n    }\n    run_impl(outfile, wtl::itertools::product(axes_));\n    if (outfile != \"\/dev\/null\") {\n        run(outfile);\n    }\n}\n\nvoid ExclusivityModel::init_axes(const std::string& infile) {HERE;\n    if (mle_params_.size() > 0 || read_results(infile)) {\n        std::cerr << mle_params_.transpose() << std::endl;\n        if (start_ > 0) {\n            throw std::runtime_error(\"infile must be a complete result\");\n        }\n        axes_ = make_vicinity(mle_params_, BREAKS_.at(stage_), STEPS_.at(stage_), 2.0);\n        ++stage_;\n    } else {\n        const double step = STEPS_[0];\n        const size_t breaks = BREAKS_[0];\n        axes_.assign(names_.size(), Eigen::VectorXd::LinSpaced(breaks, 2.0, step).array());\n    }\n}\n\nstd::string ExclusivityModel::name_outfile(const std::string& infile) const {HERE;\n    std::string prefix = \"output\";\n    if (infile == \"\/dev\/null\") {\n        return infile;\n    } else if (!infile.empty()) {\n        prefix = wtl::split(infile, \"-\")[0];\n    }\n    std::ostringstream oss(prefix, std::ios::ate);\n    oss << \"-s\" << nsam_with_s_.size() - 1\n        << \"-step\" << STEPS_.at(stage_)\n        << \".tsv.gz\";\n    return oss.str();\n}\n\nvoid ExclusivityModel::run_impl(const std::string& outfile, wtl::itertools::Generator<Eigen::ArrayXd>&& gen) {HERE;\n    const auto max_count = gen.max_count();\n    auto buffer = wtl::make_oss();\n    std::ios::openmode mode = std::ios::out;\n    if (start_ == 0) {\n        buffer << \"##max_count=\" << max_count << \"\\n\";\n        buffer << \"##max_sites=\" << nsam_with_s_.size() - 1 << \"\\n\";\n        buffer << \"##step=\" << STEPS_.at(stage_) << \"\\n\";\n        buffer << \"loglik\\t\" << wtl::join(names_, \"\\t\") << \"\\n\";\n    } else {\n        mode |= std::ios::app;\n    }\n    std::cerr << \"\\nWriting to \" << outfile << std::endl;\n    wtl::ogzstream fout(outfile, mode);\n    double max_ll = std::numeric_limits<double>::lowest();\n    for (const auto& params: gen(start_)) {\n        if (gen.count() % 10000 == 0) {  \/\/ snapshot for long run\n            std::cerr << \"\\r\" << gen.count() << \" in \" << max_count << std::flush;\n            fout << buffer.str();\n            fout.strict_sync();\n            buffer.str(\"\");\n        }\n\n        double loglik = 0.0;\n        loglik += (a_pathway_ * params.log()).sum();\n        for (size_t s=0; s<nsam_with_s_.size(); ++s) {\n            loglik -= nsam_with_s_[s] * std::log(calc_denom(w_pathway_, params, s));\n        }\n\n        buffer << (loglik += lnp_const_) << \"\\t\"\n               << wtl::join(wtl::eigen::vector(params), \"\\t\") << \"\\n\";\n        if (loglik > max_ll) {\n            max_ll = loglik;\n            mle_params_ = params;\n        }\n        if (SIGINT_RAISED) {throw wtl::ExitSuccess(\"KeyboardInterrupt\");}\n    }\n    fout << buffer.str();\n}\n\ndouble ExclusivityModel::calc_denom(\n    const Eigen::ArrayXd& w_pathway,\n    const Eigen::ArrayXd& x_pathway,\n    const size_t num_mutations) {\n\n    if (num_mutations < 2) return 1.0;\n    auto& iter = index_iters_[num_mutations];\n    double sum_prob = 0.0;\n    boost::dynamic_bitset<> bits(x_pathway.size());\n    for (const auto& indices: iter()) {\n        double p = 1.0;\n        for (const auto j: indices) {\n            p *= w_pathway[j];\n            if (bits[j]) p *= x_pathway[j];\n            bits.set(j);\n        }\n        sum_prob += p;\n        bits.reset();\n    }\n    iter.reset();\n    return sum_prob;\n}\n\nstd::ostream& ExclusivityModel::write_genotypes(std::ostream& ost, const bool header) const {HERE;\n    if (header) {ost << wtl::join(names_, \"\\t\") << \"\\n\";}\n    return ost << genotypes_.format(wtl::eigen::tsv());\n}\n\nbool ExclusivityModel::read_results(const std::string& infile) {HERE;\n    wtl::igzstream ist(infile);\n    if (!ist || infile == \"\/dev\/null\") return false;\n    std::cerr << \"Reading: \" << infile << std::endl;\n    const size_t max_count = read_metadata(ist);\n    start_ = read_body(ist);\n    if (start_ == max_count) start_ = 0;\n    return true;\n}\n\nsize_t ExclusivityModel::read_metadata(std::istream& ist) {HERE;\n    std::string buffer;\n    std::getline(ist, buffer);\n    const size_t max_count = std::stoul(wtl::split(buffer, \"=\")[1]);\n    std::getline(ist, buffer);\n    const size_t max_sites = std::stoul(wtl::split(buffer, \"=\")[1]);\n    if (nsam_with_s_.size() - 1 != max_sites) {\n        std::cerr << \"Note: -s is different between arg and file\\n\";\n    }\n    std::getline(ist, buffer);\n    const double step = std::stod(wtl::split(buffer, \"=\")[1]);\n    auto pred = std::bind(wtl::equal<double>, std::placeholders::_1, step);\n    const auto it = std::find_if(STEPS_.begin(), STEPS_.end(), pred);\n    if (it == STEPS_.end()) throw std::runtime_error(\"invalid step size\");\n    stage_ = it - STEPS_.begin();\n    return max_count;\n}\n\nsize_t ExclusivityModel::read_body(std::istream& ist) {HERE;\n    std::string buffer;\n    ist >> buffer; \/\/ loglik\n    std::getline(ist, buffer); \/\/ header\n    buffer.erase(0, 1); \/\/ \\t\n    if (names_ != wtl::split(buffer, \"\\t\")) {\n        std::cerr << names_ << std::endl;\n        std::cerr << wtl::split(buffer, \"\\t\") << std::endl;\n        throw std::runtime_error(\"Column names are wrong\");\n    }\n    size_t i = 0;\n    double max_ll = std::numeric_limits<double>::lowest();\n    while (std::getline(ist, buffer)) {\n        ++i;\n        std::istringstream iss(buffer);\n        std::istream_iterator<double> it(iss);\n        if (*it > max_ll) {\n            max_ll = *it;\n            mle_params_ = wtl::eigen::ArrayX(std::vector<double>(++it, std::istream_iterator<double>()));\n        }\n    }\n    return i;\n}\n\nvoid ExclusivityModel::unit_test() {HERE;\n    std::string geno = \"A\\tB\\n0\\t1\\n1\\t0\\n1\\t1\\n0\\t2\\n\";\n    std::istringstream iss(geno);\n    ExclusivityModel model(iss);\n    model.write_genotypes(std::cerr);\n    model.run(\"\/dev\/null\");\n}\n\n} \/\/ namespace likeligrid\n<|endoftext|>"}
{"text":"<commit_before>#include <cmath>\n\n#include <Poco\/Exception.h>\n\n#include \"di\/Injectable.h\"\n#include \"service\/SensorServiceImpl.h\"\n\nBEEEON_OBJECT_BEGIN(BeeeOn, SensorServiceImpl)\nBEEEON_OBJECT_CASTABLE(SensorService)\nBEEEON_OBJECT_REF(\"deviceDao\", &SensorServiceImpl::setDeviceDao)\nBEEEON_OBJECT_REF(\"sensorHistoryDao\", &SensorServiceImpl::setSensorHistoryDao)\nBEEEON_OBJECT_REF(\"accessPolicy\", &SensorServiceImpl::setAccessPolicy)\nBEEEON_OBJECT_REF(\"transactionManager\", &SensorServiceImpl::setTransactionManager)\nBEEEON_OBJECT_END(BeeeOn, SensorServiceImpl)\n\nusing namespace std;\nusing namespace Poco;\nusing namespace BeeeOn;\n\nvoid SensorServiceImpl::setDeviceDao(DeviceDao::Ptr deviceDao)\n{\n\tm_deviceDao = deviceDao;\n}\n\nvoid SensorServiceImpl::setSensorHistoryDao(SensorHistoryDao::Ptr sensorHistoryDao)\n{\n\tm_sensorHistoryDao = sensorHistoryDao;\n}\n\nvoid SensorServiceImpl::setAccessPolicy(SensorAccessPolicy::Ptr policy)\n{\n\tm_policy = policy;\n}\n\nbool SensorServiceImpl::doFetch(Relation<Sensor, Device> &data)\n{\n\tDevice device(data.base());\n\tSensor &sensor = data.target();\n\n\tm_policy->assure(SensorAccessPolicy::ACTION_USER_GET,\n\t\t\tdata, sensor, device);\n\n\tif (!m_deviceDao->fetch(device, device.gateway()))\n\t\tthrow NotFoundException(\"device \" + device);\n\t\t\n\tSharedPtr<DeviceInfo> deviceInfo = device.type();\n\tModuleInfo moduleInfo;\n\tmoduleInfo.setId(sensor.id());\n\n\tif (!deviceInfo->lookup(moduleInfo))\n\t\treturn false;\n\n\tdouble value;\n\tTimestamp at;\n\n\tif (m_sensorHistoryDao->fetch(device, moduleInfo, at, value)) {\n\t\tsensor.setValue(value);\n\t\tsensor.setAt(at);\n\t}\n\telse {\n\t\tsensor.setValue(NAN);\n\t\tsensor.setAt(Nullable<Timestamp>());\n\t}\n\n\tsensor.setInfo(moduleInfo);\n\treturn true;\n}\n\nvoid SensorServiceImpl::doFetchMany(Relation<list<Sensor>, Device> &data)\n{\n\tDevice device(data.base());\n\n\tm_policy->assureMany(SensorAccessPolicy::ACTION_USER_GET, data, device);\n\n\tif (!m_deviceDao->fetch(device, device.gateway()))\n\t\tthrow NotFoundException(\"device \" + device);\n\t\t\n\tSharedPtr<DeviceInfo> deviceInfo = device.type();\n\tvector<ModuleInfo> modules;\n\n\tfor (const auto info : *deviceInfo) {\n\t\tif (!info.isControllable())\n\t\t\tmodules.emplace_back(info);\n\t}\n\n\tvector<Nullable<ValueAt>> values;\n\tm_sensorHistoryDao->fetchMany(device, modules, values);\n\n\tfor (size_t i = 0; i < values.size(); ++i) {\n\t\tSensor sensor(modules[i].id());\n\n\t\tm_policy->assure(SensorAccessPolicy::ACTION_USER_GET, data, sensor, device);\n\n\t\tsensor.setInfo(modules[i]);\n\n\t\tif (!values[i].isNull()) {\n\t\t\tsensor.setValue(values[i].value().value());\n\t\t\tsensor.setAt(values[i].value().at());\n\t\t}\n\t\telse {\n\t\t\tsensor.setValue(NAN);\n\t\t\tsensor.setAt(Nullable<Timestamp>());\n\t\t}\n\n\t\tdata.target().emplace_back(sensor);\n\t}\n}\n<commit_msg>SensorServiceImpl: fail in a defined way when no device type<commit_after>#include <cmath>\n\n#include <Poco\/Exception.h>\n\n#include \"di\/Injectable.h\"\n#include \"service\/SensorServiceImpl.h\"\n\nBEEEON_OBJECT_BEGIN(BeeeOn, SensorServiceImpl)\nBEEEON_OBJECT_CASTABLE(SensorService)\nBEEEON_OBJECT_REF(\"deviceDao\", &SensorServiceImpl::setDeviceDao)\nBEEEON_OBJECT_REF(\"sensorHistoryDao\", &SensorServiceImpl::setSensorHistoryDao)\nBEEEON_OBJECT_REF(\"accessPolicy\", &SensorServiceImpl::setAccessPolicy)\nBEEEON_OBJECT_REF(\"transactionManager\", &SensorServiceImpl::setTransactionManager)\nBEEEON_OBJECT_END(BeeeOn, SensorServiceImpl)\n\nusing namespace std;\nusing namespace Poco;\nusing namespace BeeeOn;\n\nvoid SensorServiceImpl::setDeviceDao(DeviceDao::Ptr deviceDao)\n{\n\tm_deviceDao = deviceDao;\n}\n\nvoid SensorServiceImpl::setSensorHistoryDao(SensorHistoryDao::Ptr sensorHistoryDao)\n{\n\tm_sensorHistoryDao = sensorHistoryDao;\n}\n\nvoid SensorServiceImpl::setAccessPolicy(SensorAccessPolicy::Ptr policy)\n{\n\tm_policy = policy;\n}\n\nbool SensorServiceImpl::doFetch(Relation<Sensor, Device> &data)\n{\n\tDevice device(data.base());\n\tSensor &sensor = data.target();\n\n\tm_policy->assure(SensorAccessPolicy::ACTION_USER_GET,\n\t\t\tdata, sensor, device);\n\n\tif (!m_deviceDao->fetch(device, device.gateway()))\n\t\tthrow NotFoundException(\"device \" + device);\n\n\tif (device.type().isNull())\n\t\tthrow IllegalStateException(\"device \" + device + \" does not have type\");\n\t\t\n\tSharedPtr<DeviceInfo> deviceInfo = device.type();\n\tModuleInfo moduleInfo;\n\tmoduleInfo.setId(sensor.id());\n\n\tif (!deviceInfo->lookup(moduleInfo))\n\t\treturn false;\n\n\tdouble value;\n\tTimestamp at;\n\n\tif (m_sensorHistoryDao->fetch(device, moduleInfo, at, value)) {\n\t\tsensor.setValue(value);\n\t\tsensor.setAt(at);\n\t}\n\telse {\n\t\tsensor.setValue(NAN);\n\t\tsensor.setAt(Nullable<Timestamp>());\n\t}\n\n\tsensor.setInfo(moduleInfo);\n\treturn true;\n}\n\nvoid SensorServiceImpl::doFetchMany(Relation<list<Sensor>, Device> &data)\n{\n\tDevice device(data.base());\n\n\tm_policy->assureMany(SensorAccessPolicy::ACTION_USER_GET, data, device);\n\n\tif (!m_deviceDao->fetch(device, device.gateway()))\n\t\tthrow NotFoundException(\"device \" + device);\n\n\tif (device.type().isNull())\n\t\tthrow IllegalStateException(\"device \" + device + \" does not have type\");\n\t\t\n\tSharedPtr<DeviceInfo> deviceInfo = device.type();\n\tvector<ModuleInfo> modules;\n\n\tfor (const auto info : *deviceInfo) {\n\t\tif (!info.isControllable())\n\t\t\tmodules.emplace_back(info);\n\t}\n\n\tvector<Nullable<ValueAt>> values;\n\tm_sensorHistoryDao->fetchMany(device, modules, values);\n\n\tfor (size_t i = 0; i < values.size(); ++i) {\n\t\tSensor sensor(modules[i].id());\n\n\t\tm_policy->assure(SensorAccessPolicy::ACTION_USER_GET, data, sensor, device);\n\n\t\tsensor.setInfo(modules[i]);\n\n\t\tif (!values[i].isNull()) {\n\t\t\tsensor.setValue(values[i].value().value());\n\t\t\tsensor.setAt(values[i].value().at());\n\t\t}\n\t\telse {\n\t\t\tsensor.setValue(NAN);\n\t\t\tsensor.setAt(Nullable<Timestamp>());\n\t\t}\n\n\t\tdata.target().emplace_back(sensor);\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2017 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\n#if defined(_INTR_PROFILING_ENABLED)\nMICROPROFILE_DEFINE(MAIN, \"MAIN\", \"Main\", 0x00ff00);\n#endif \/\/ _INTR_PROFILING_ENABLED\n\nnamespace Intrinsic\n{\nnamespace Core\n{\nnamespace\n{\nfloat _stepAccum = 0.0f;\nconst float _stepSize = 0.016f;\n\nstruct PhysicsUpdateTaskSet : enki::ITaskSet\n{\n  virtual ~PhysicsUpdateTaskSet() {}\n\n  void ExecuteRange(enki::TaskSetPartition p_Range,\n                    uint32_t p_ThreadNum) override\n  {\n    const float modDeltaT =\n        TaskManager::_lastDeltaT * TaskManager::_timeModulator;\n    _stepAccum += modDeltaT;\n\n    while (_stepAccum > _stepSize)\n    {\n      Physics::System::dispatchSimulation(modDeltaT);\n      Physics::System::syncSimulation();\n\n      _stepAccum -= modDeltaT;\n    }\n  };\n\n} _physicsUpdateTaskSet;\n}\n\n\/\/ Static members\nfloat TaskManager::_lastDeltaT = 0.016f;\nfloat TaskManager::_lastActualFrameDuration = 0.016f;\nfloat TaskManager::_totalTimePassed = 0.0f;\nuint32_t TaskManager::_frameCounter = 0u;\nuint64_t TaskManager::_lastUpdate = 0u;\nfloat TaskManager::_timeModulator = 1.0f;\n\nvoid TaskManager::executeTasks()\n{\n#if defined(_INTR_PROFILING_ENABLED)\n  MICROPROFILE_SCOPE(MAIN);\n#endif \/\/ _INTR_PROFILING_ENABLED\n\n  _INTR_PROFILE_CPU(\"TaskManager\", \"Execute Tasks\");\n\n  if (_frameCounter > 0u)\n  {\n    _INTR_PROFILE_CPU(\"TaskManager\", \"Limit To Max FPS\");\n\n    _lastDeltaT = std::min(\n        (TimingHelper::getMicroseconds() - _lastUpdate) * 0.000001f, 0.3f);\n    _lastActualFrameDuration = _lastDeltaT;\n\n    \/\/ Adjust deltaT to target frame rate\n    while (_lastDeltaT < Settings::Manager::_targetFrameRate)\n    {\n      _lastDeltaT = (TimingHelper::getMicroseconds() - _lastUpdate) * 0.000001f;\n      std::this_thread::yield();\n    }\n  }\n\n  const float modDeltaT = _lastDeltaT * _timeModulator;\n  _totalTimePassed += modDeltaT;\n  _lastUpdate = TimingHelper::getMicroseconds();\n\n  {\n    _INTR_PROFILE_CPU(\"TaskManager\", \"Non-Rendering Tasks\");\n\n    \/\/ Events and input\n    {\n      _INTR_PROFILE_CPU(\"TaskManager\", \"Pump Events\");\n\n      Input::System::reset();\n      SystemEventProvider::SDL::pumpEvents();\n    }\n\n    \/\/ Game state update\n    {\n      GameStates::Manager::update(modDeltaT);\n    }\n\n    \/\/ Scripts\n    {\n      Components::ScriptManager::tickScripts(\n          Components::ScriptManager::_activeRefs, modDeltaT);\n    }\n\n    \/\/ Physics\n    {\n      _INTR_PROFILE_CPU(\"TaskManager\", \"Update From Physics Results\");\n\n      Components::RigidBodyManager::updateNodesFromActors(\n          Components::RigidBodyManager::_activeRefs);\n      Components::RigidBodyManager::updateActorsFromNodes(\n          Components::RigidBodyManager::_activeRefs);\n      Physics::System::renderLineDebugGeometry();\n    }\n\n    \/\/ Swarms\n    {\n      _INTR_PROFILE_CPU(\"TaskManager\", \"Swarms\");\n\n      Components::SwarmManager::updateSwarms(\n          Components::SwarmManager::_activeRefs, modDeltaT);\n    }\n\n    \/\/ Update the day\/night cycle\n    {\n      World::updateDayNightCycle(modDeltaT);\n    }\n\n    \/\/ Post effect system\n    {\n      Components::PostEffectVolumeManager::blendPostEffects(\n          Components::PostEffectVolumeManager::_activeRefs);\n    }\n\n    \/\/ Fire events\n    {\n      Resources::EventManager::fireEvents();\n    }\n  }\n\n  {\n    _INTR_PROFILE_CPU(\"TaskManager\", \"Rendering Tasks\");\n\n    \/\/ Process physics during rendering\n    Application::_scheduler.AddTaskSetToPipe(&_physicsUpdateTaskSet);\n\n    \/\/ Rendering\n    RV::RenderProcess::Default::renderFrame(modDeltaT);\n\n    Application::_scheduler.WaitforTaskSet(&_physicsUpdateTaskSet);\n  }\n\n  {\n    Physics::System::updatePvdCamera();\n  }\n\n  ++_frameCounter;\n}\n}\n}\n<commit_msg>Clamp the deltaT to a maximum of a 10th of a second<commit_after>\/\/ Copyright 2017 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\n#if defined(_INTR_PROFILING_ENABLED)\nMICROPROFILE_DEFINE(MAIN, \"MAIN\", \"Main\", 0x00ff00);\n#endif \/\/ _INTR_PROFILING_ENABLED\n\nnamespace Intrinsic\n{\nnamespace Core\n{\nnamespace\n{\nfloat _stepAccum = 0.0f;\nconst float _stepSize = 0.016f;\n\nstruct PhysicsUpdateTaskSet : enki::ITaskSet\n{\n  virtual ~PhysicsUpdateTaskSet() {}\n\n  void ExecuteRange(enki::TaskSetPartition p_Range,\n                    uint32_t p_ThreadNum) override\n  {\n    const float modDeltaT =\n        TaskManager::_lastDeltaT * TaskManager::_timeModulator;\n    _stepAccum += modDeltaT;\n\n    while (_stepAccum > _stepSize)\n    {\n      Physics::System::dispatchSimulation(modDeltaT);\n      Physics::System::syncSimulation();\n\n      _stepAccum -= modDeltaT;\n    }\n  };\n\n} _physicsUpdateTaskSet;\n}\n\n\/\/ Static members\nfloat TaskManager::_lastDeltaT = 0.016f;\nfloat TaskManager::_lastActualFrameDuration = 0.016f;\nfloat TaskManager::_totalTimePassed = 0.0f;\nuint32_t TaskManager::_frameCounter = 0u;\nuint64_t TaskManager::_lastUpdate = 0u;\nfloat TaskManager::_timeModulator = 1.0f;\n\nvoid TaskManager::executeTasks()\n{\n#if defined(_INTR_PROFILING_ENABLED)\n  MICROPROFILE_SCOPE(MAIN);\n#endif \/\/ _INTR_PROFILING_ENABLED\n\n  _INTR_PROFILE_CPU(\"TaskManager\", \"Execute Tasks\");\n\n  if (_frameCounter > 0u)\n  {\n    _INTR_PROFILE_CPU(\"TaskManager\", \"Limit To Max FPS\");\n\n    _lastDeltaT = std::min(\n        (TimingHelper::getMicroseconds() - _lastUpdate) * 0.000001f, 0.3f);\n    _lastActualFrameDuration = _lastDeltaT;\n\n    \/\/ Adjust deltaT to target frame rate\n    while (_lastDeltaT < Settings::Manager::_targetFrameRate)\n    {\n      _lastDeltaT = (TimingHelper::getMicroseconds() - _lastUpdate) * 0.000001f;\n      std::this_thread::yield();\n    }\n  }\n\n  \/\/ Avoid very high deltaTs due to stalls\n  _lastDeltaT = std::min(_lastDeltaT, 0.1f);\n\n  const float modDeltaT = _lastDeltaT * _timeModulator;\n  _totalTimePassed += modDeltaT;\n  _lastUpdate = TimingHelper::getMicroseconds();\n\n  {\n    _INTR_PROFILE_CPU(\"TaskManager\", \"Non-Rendering Tasks\");\n\n    \/\/ Events and input\n    {\n      _INTR_PROFILE_CPU(\"TaskManager\", \"Pump Events\");\n\n      Input::System::reset();\n      SystemEventProvider::SDL::pumpEvents();\n    }\n\n    \/\/ Game state update\n    {\n      GameStates::Manager::update(modDeltaT);\n    }\n\n    \/\/ Scripts\n    {\n      Components::ScriptManager::tickScripts(\n          Components::ScriptManager::_activeRefs, modDeltaT);\n    }\n\n    \/\/ Physics\n    {\n      _INTR_PROFILE_CPU(\"TaskManager\", \"Update From Physics Results\");\n\n      Components::RigidBodyManager::updateNodesFromActors(\n          Components::RigidBodyManager::_activeRefs);\n      Components::RigidBodyManager::updateActorsFromNodes(\n          Components::RigidBodyManager::_activeRefs);\n      Physics::System::renderLineDebugGeometry();\n    }\n\n    \/\/ Swarms\n    {\n      _INTR_PROFILE_CPU(\"TaskManager\", \"Swarms\");\n\n      Components::SwarmManager::updateSwarms(\n          Components::SwarmManager::_activeRefs, modDeltaT);\n    }\n\n    \/\/ Update the day\/night cycle\n    {\n      World::updateDayNightCycle(modDeltaT);\n    }\n\n    \/\/ Post effect system\n    {\n      Components::PostEffectVolumeManager::blendPostEffects(\n          Components::PostEffectVolumeManager::_activeRefs);\n    }\n\n    \/\/ Fire events\n    {\n      Resources::EventManager::fireEvents();\n    }\n  }\n\n  {\n    _INTR_PROFILE_CPU(\"TaskManager\", \"Rendering Tasks\");\n\n    \/\/ Process physics during rendering\n    Application::_scheduler.AddTaskSetToPipe(&_physicsUpdateTaskSet);\n\n    \/\/ Rendering\n    RV::RenderProcess::Default::renderFrame(modDeltaT);\n\n    Application::_scheduler.WaitforTaskSet(&_physicsUpdateTaskSet);\n  }\n\n  {\n    Physics::System::updatePvdCamera();\n  }\n\n  ++_frameCounter;\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 <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;\n\nClientBuoy *ptrClientBuoy;\nClientLine *ptrClientLine;\ntask_commons::buoyGoal goalBuoy;\ntask_commons::lineGoal goalLine;\n\nbool successBuoy = false;\nbool successLine = false;\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\/\/ never ever put the argument of the callback function anything other then the specified\nvoid forwardCbBuoy(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 forwardCbLine(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\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, &forwardCbBuoy);\n  ros::Subscriber sub_line = nh.subscribe<task_commons::lineActionFeedback>(\"\/line_server\/feedback\",\n    1000, &forwardCbLine);\n\n  ClientBuoy buoyClient(\"buoy_server\");\n  ptrClientBuoy = &buoyClient;\n  ClientLine lineClient(\"line_server\");\n  ptrClientLine = &lineClient;\n\n  ROS_INFO(\"Waiting for action server to start.\");\n  lineClient.waitForServer();\n  buoyClient.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  ros::spin();\n  return 0;\n}\n<commit_msg>added upward motion after hitting the buoy<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\/UpwardAction.h>\n#include <motion_commons\/UpwardActionFeedback.h>\n#include <motion_commons\/UpwardActionResult.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;\n\nClientBuoy *ptrClientBuoy;\nClientLine *ptrClientLine;\nClientUpward *ptrClientUpward;\ntask_commons::buoyGoal goalBuoy;\ntask_commons::lineGoal goalLine;\nmotion_commons::UpwardGoal goalUpward;\n\nros::Publisher pub_upward;\n\nbool successBuoy = false;\nbool successLine = false;\nbool successUpward = 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\/\/ 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\n  ClientBuoy buoyClient(\"buoy_server\");\n  ptrClientBuoy = &buoyClient;\n  ClientLine lineClient(\"line_server\");\n  ptrClientLine = &lineClient;\n  ClientUpward upwardClient(\"upward\");\n  ptrClientUpward = &upwardClient;\n\n  ROS_INFO(\"Waiting for action server to start.\");\n  lineClient.waitForServer();\n  buoyClient.waitForServer();\n  upwardClient.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 + 5;\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  ros::spin();\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2013-2018.\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 USER_SYSTEM_HPP\n#define USER_SYSTEM_HPP\n\n#include <types.hpp>\n#include <expected.hpp>\n#include <vector.hpp>\n#include <string.hpp>\n\n#include \"tlib\/datetime.hpp\"\n#include \"tlib\/config.hpp\"\n\nASSERT_ONLY_THOR_PROGRAM\n\nnamespace tlib {\n\nvoid exit(size_t return_code) __attribute__((noreturn));\n\nstd::expected<size_t> exec(const char* executable, const std::vector<std::string>& params = {});\nstd::expected<size_t> exec_and_wait(const char* executable, const std::vector<std::string>& params = {});\n\nvoid await_termination(size_t pid);\n\nvoid sleep_ms(size_t ms);\n\ndatetime local_date();\n\nvoid reboot(unsigned int);\nvoid shutdown(unsigned int);\n\nuint64_t s_time();\nuint64_t ms_time();\n\nvoid alpha();\n\n} \/\/ end of tlib namespace\n\n#endif\n<commit_msg>Add default values to reboot\/shutdown (#26)<commit_after>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2013-2018.\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 USER_SYSTEM_HPP\n#define USER_SYSTEM_HPP\n\n#include <types.hpp>\n#include <expected.hpp>\n#include <vector.hpp>\n#include <string.hpp>\n\n#include \"tlib\/datetime.hpp\"\n#include \"tlib\/config.hpp\"\n\nASSERT_ONLY_THOR_PROGRAM\n\nnamespace tlib {\n\nvoid exit(size_t return_code) __attribute__((noreturn));\n\nstd::expected<size_t> exec(const char* executable, const std::vector<std::string>& params = {});\nstd::expected<size_t> exec_and_wait(const char* executable, const std::vector<std::string>& params = {});\n\nvoid await_termination(size_t pid);\n\nvoid sleep_ms(size_t ms);\n\ndatetime local_date();\n\nvoid reboot(unsigned int delay = 0);\nvoid shutdown(unsigned int delay = 0);\n\nuint64_t s_time();\nuint64_t ms_time();\n\nvoid alpha();\n\n} \/\/ end of tlib namespace\n\n#endif\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 <vector>\n\n#include \"media\/base\/mock_filters.h\"\n#include \"media\/filters\/decoder_base.h\"\n#include \"testing\/gmock\/include\/gmock\/gmock.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nusing ::testing::NotNull;\n\nnamespace media {\n\nclass MockOutput : public StreamSample {\n  MOCK_CONST_METHOD0(IsEndOfStream, bool());\n};\n\nclass MockDecoder : public MediaFilter {};\n\nclass MockBuffer : public Buffer {\n public:\n  MOCK_CONST_METHOD0(GetData, const uint8*());\n  MOCK_CONST_METHOD0(GetDataSize, size_t());\n};\n\nACTION(Initialize) {\n  AutoTaskRunner done_runner(arg2);\n  *arg1 = true;\n}\n\nACTION_P(SaveDecodeRequest, list) {\n  scoped_refptr<Buffer> buffer = arg0;\n  list->push_back(arg1);\n}\n\nACTION(CompleteDemuxRequest) {\n  arg0->Run(new MockBuffer());\n  delete arg0;\n}\n\nclass MockDecoderImpl : public DecoderBase<MockDecoder, MockOutput> {\n public:\n  MockDecoderImpl() {\n    media_format_.SetAsString(MediaFormat::kMimeType, \"mock\");\n  }\n\n  \/\/ DecoderBase Implementations.\n  MOCK_METHOD3(DoInitialize,\n               void(DemuxerStream* demuxer_stream, bool* success,\n                    Task* done_cb));\n  MOCK_METHOD0(DoStop, void());\n  MOCK_METHOD2(DoSeek, void(base::TimeDelta time, Task* done_cb));\n  MOCK_METHOD2(DoDecode, void(Buffer* input, Task* done_cb));\n\n private:\n  FRIEND_TEST(DecoderBaseTest, DISABLED_FlowControl);\n\n  DISALLOW_COPY_AND_ASSIGN(MockDecoderImpl);\n};\n\nclass MockReadCallback {\n public:\n  MockReadCallback() {}\n  MOCK_METHOD1(ReadCallback, void(MockOutput* output));\n\n private:\n  DISALLOW_COPY_AND_ASSIGN(MockReadCallback);\n};\n\n\/\/ Test the flow control of decoder base by the following sequnce of actions:\n\/\/ - Read() -> DecoderStream\n\/\/   \\ Read() -> DemuxerStream\n\/\/ - Read() -> DecoderBase\n\/\/   \\ Read() -> DemixerStream\n\/\/ - ReadCallback() -> DecoderBase\n\/\/   \\ DoDecode() -> Decoder\n\/\/ - ReadCallback() -> DecoderBase\n\/\/   \\ DoDecode() -> Decoder\n\/\/ - DecodeCallback() -> DecoderBase\n\/\/   \\ ReadCallback() -> client\n\/\/ - DecodeCallback() -> DecoderBase\n\/\/   \\ ReadCallback() -> client\nTEST(DecoderBaseTest, DISABLED_FlowControl) {\n  MessageLoop message_loop;\n  scoped_refptr<MockDecoderImpl> decoder = new MockDecoderImpl();\n  scoped_refptr<MockDemuxerStream> demuxer_stream = new MockDemuxerStream();\n  MockFilterCallback callback;\n  MockReadCallback read_callback;\n  decoder->set_message_loop(&message_loop);\n\n  \/\/ Initailize.\n  EXPECT_CALL(callback, OnFilterCallback());\n  EXPECT_CALL(callback, OnCallbackDestroyed());\n  EXPECT_CALL(*decoder, DoInitialize(NotNull(), NotNull(), NotNull()))\n      .WillOnce(Initialize());\n  decoder->Initialize(demuxer_stream.get(), callback.NewCallback());\n  message_loop.RunAllPending();\n\n  \/\/ Read.\n  std::vector<Task*> decode_requests;\n  EXPECT_CALL(*demuxer_stream, Read(NotNull()))\n      .Times(2)\n      .WillRepeatedly(CompleteDemuxRequest());\n  EXPECT_CALL(*decoder, DoDecode(NotNull(), NotNull()))\n      .Times(2)\n      .WillRepeatedly(SaveDecodeRequest(&decode_requests));\n  decoder->Read(NewCallback(&read_callback,\n                            &MockReadCallback::ReadCallback));\n  decoder->Read(NewCallback(&read_callback,\n                            &MockReadCallback::ReadCallback));\n  message_loop.RunAllPending();\n\n  \/\/ Fulfill the decode request.\n  EXPECT_CALL(read_callback, ReadCallback(NotNull())).Times(2);\n  for (size_t i = 0; i < decode_requests.size(); ++i) {\n    decoder->EnqueueResult(new MockOutput());\n    AutoTaskRunner done_cb(decode_requests[i]);\n  }\n  decode_requests.clear();\n  message_loop.RunAllPending();\n\n  \/\/ Stop.\n  EXPECT_CALL(*decoder, DoStop());\n  decoder->Stop();\n  message_loop.RunAllPending();\n}\n\n}  \/\/ namespace media\n<commit_msg>Fix DecoderBaseTest in media test<commit_after>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <vector>\n\n#include \"media\/base\/mock_filters.h\"\n#include \"media\/filters\/decoder_base.h\"\n#include \"testing\/gmock\/include\/gmock\/gmock.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nusing ::testing::NotNull;\nusing ::testing::StrictMock;\n\nnamespace media {\n\nclass GTEST_TEST_CLASS_NAME_(DecoderBaseTest, FlowControl);\n\n}  \/\/ namespace media\n\nnamespace {\n\nclass MockDecoderOutput : public media::StreamSample {\n public:\n  MOCK_CONST_METHOD0(IsEndOfStream, bool());\n};\n\nclass MockDecoder : public media::MediaFilter {};\n\nclass MockBuffer : public media::Buffer {\n public:\n  MockBuffer() {}\n  virtual ~MockBuffer() {}\n  MOCK_CONST_METHOD0(GetData, const uint8*());\n  MOCK_CONST_METHOD0(GetDataSize, size_t());\n\n private:\n  DISALLOW_COPY_AND_ASSIGN(MockBuffer);\n};\n\nclass MockDecoderImpl : public media::DecoderBase<\n  MockDecoder, MockDecoderOutput> {\n public:\n  MockDecoderImpl() {\n    media_format_.SetAsString(media::MediaFormat::kMimeType, \"mock\");\n  }\n\n  virtual ~MockDecoderImpl() {}\n\n  \/\/ DecoderBase Implementations.\n  MOCK_METHOD3(DoInitialize,\n               void(media::DemuxerStream* demuxer_stream,\n                    bool* success,\n                    Task* done_cb));\n  MOCK_METHOD0(DoStop, void());\n  MOCK_METHOD2(DoSeek, void(base::TimeDelta time, Task* done_cb));\n  MOCK_METHOD2(DoDecode, void(media::Buffer* input, Task* done_cb));\n\n private:\n  FRIEND_TEST(media::DecoderBaseTest, FlowControl);\n\n  DISALLOW_COPY_AND_ASSIGN(MockDecoderImpl);\n};\n\nclass MockDecoderReadCallback {\n public:\n  MockDecoderReadCallback() {}\n  virtual ~MockDecoderReadCallback() {}\n  MOCK_METHOD1(ReadCallback, void(MockDecoderOutput* output));\n\n private:\n  DISALLOW_COPY_AND_ASSIGN(MockDecoderReadCallback);\n};\n\n}  \/\/ namespace\n\nnamespace media {\n\nACTION(Initialize) {\n  AutoTaskRunner done_runner(arg2);\n  *arg1 = true;\n}\n\nACTION_P(SaveDecodeRequest, list) {\n  scoped_refptr<Buffer> buffer = arg0;\n  list->push_back(arg1);\n}\n\nACTION(CompleteDemuxRequest) {\n  arg0->Run(new MockBuffer());\n  delete arg0;\n}\n\n\/\/ Test the flow control of decoder base by the following sequnce of actions:\n\/\/ - Read() -> DecoderStream\n\/\/   \\ Read() -> DemuxerStream\n\/\/ - Read() -> DecoderBase\n\/\/   \\ Read() -> DemixerStream\n\/\/ - ReadCallback() -> DecoderBase\n\/\/   \\ DoDecode() -> Decoder\n\/\/ - ReadCallback() -> DecoderBase\n\/\/   \\ DoDecode() -> Decoder\n\/\/ - DecodeCallback() -> DecoderBase\n\/\/   \\ ReadCallback() -> client\n\/\/ - DecodeCallback() -> DecoderBase\n\/\/   \\ ReadCallback() -> client\nTEST(DecoderBaseTest, FlowControl) {\n  MessageLoop message_loop;\n  scoped_refptr<MockDecoderImpl> decoder = new MockDecoderImpl();\n  scoped_refptr<MockDemuxerStream> demuxer_stream = new MockDemuxerStream();\n  StrictMock<MockFilterCallback> callback;\n  decoder->set_message_loop(&message_loop);\n\n  \/\/ Initailize.\n  EXPECT_CALL(callback, OnFilterCallback());\n  EXPECT_CALL(callback, OnCallbackDestroyed());\n  EXPECT_CALL(*decoder, DoInitialize(NotNull(), NotNull(), NotNull()))\n      .WillOnce(Initialize());\n  decoder->Initialize(demuxer_stream.get(), callback.NewCallback());\n  message_loop.RunAllPending();\n\n  \/\/ Read.\n  StrictMock<MockDecoderReadCallback> read_callback;\n  std::vector<Task*> decode_requests;\n  EXPECT_CALL(*demuxer_stream, Read(NotNull()))\n      .Times(2)\n      .WillRepeatedly(CompleteDemuxRequest());\n  EXPECT_CALL(*decoder, DoDecode(NotNull(), NotNull()))\n      .Times(2)\n      .WillRepeatedly(SaveDecodeRequest(&decode_requests));\n  decoder->Read(\n      NewCallback(reinterpret_cast<MockDecoderReadCallback*>(&read_callback),\n                  &MockDecoderReadCallback::ReadCallback));\n  decoder->Read(\n      NewCallback(reinterpret_cast<MockDecoderReadCallback*>(&read_callback),\n                  &MockDecoderReadCallback::ReadCallback));\n  message_loop.RunAllPending();\n\n  \/\/ Fulfill the decode request.\n  EXPECT_CALL(read_callback, ReadCallback(NotNull())).Times(2);\n  for (size_t i = 0; i < decode_requests.size(); ++i) {\n    decoder->EnqueueResult(new MockDecoderOutput());\n    AutoTaskRunner done_cb(decode_requests[i]);\n  }\n  decode_requests.clear();\n  message_loop.RunAllPending();\n\n  \/\/ Stop.\n  EXPECT_CALL(*decoder, DoStop());\n  decoder->Stop();\n  message_loop.RunAllPending();\n}\n\n}  \/\/ namespace media\n<|endoftext|>"}
{"text":"<commit_before>\n#include <sys\/socket.h>\n#include <netinet\/in.h>\n#include <arpa\/inet.h>\n#include <string.h>\n#include <errno.h>\n#include <stdio.h>\n#include <iostream>\n#include <fstream>\n#include <boost\/lexical_cast.hpp>\n#include \"packet.h\"\n\n#define BUFSIZE 122\n#define FILENAME \"Testfile\"\n#define TEST_FILENAME \"Testfile2\"\n#define PORT 10038\n#define PAKSIZE 129\n#define ACK 0\n#define NAK 1\n#define WIN_SIZE 16\n\nusing namespace std;\n\nbool gremlin(Packet * pack, int corruptProb, int lossProb);\nbool init(int argc, char** argv);\nbool loadFile();\nbool sendFile();\nbool getFile();\nchar * recvPkt();\nbool isvpack(unsigned char * p);\nPacket createPacket(int index);\nbool sendPacket();\nbool isAck();\nvoid handleAck();\nvoid handleNak(int& x);\n\nint seqNum;\nint probCorrupt;\nint probLoss;\nstring hs;\nshort int port;\nchar * file;\nunsigned char* window[16]; \/\/packet window\nint base; \/\/used to determine position in window of arriving packets\nint length;\nstruct sockaddr_in a;\nstruct sockaddr_in sa;\nsocklen_t salen;\nstring fstr;\nbool dropPck;\nPacket p;\nint delayT;\nint s;\nunsigned char b[BUFSIZE];\n\nint main(int argc, char** argv) {\n  \n  if(!init(argc, argv)) return -1;\n \n  if(sendto(s, \"GET Testfile\", BUFSIZE + 7, 0, (struct sockaddr *)&sa, sizeof(sa)) < 0) {\n    cout << \"Package sending failed. (socket s, server address sa, message m)\" << endl;\n    return false;\n  }\n  \n  getFile();\n\n  return 0;\n}\n\nbool init(int argc, char** argv) {\n  base = 0; \/\/initialize base\n  s = 0;\n\n  hs = string(\"131.204.14.\") + argv[1]; \/* Needs to be updated? Might be a string like \"tux175.engr.auburn.edu.\" *\/\n  port = 10038; \/* Can be any port within 10038-10041, inclusive. *\/\n\n  char* delayTStr = argv[2];\n  delayT = boost::lexical_cast<int>(delayTStr);\n\n  \/*if(!loadFile()) {\n    cout << \"Loading file failed. (filename FILENAME)\" << endl;\n    return false;\n  }*\/\n\n  if ((s = socket(AF_INET, SOCK_DGRAM, IPPROTO_UDP)) < 0) {\n    cout << \"Socket creation failed. (socket s)\" << endl;\n    return false;\n  }\n\n  memset((char *)&a, 0, sizeof(a));\n  a.sin_family = AF_INET;\n  a.sin_addr.s_addr = htonl(INADDR_ANY); \/\/why does this always give us 0? \n  a.sin_port = htons(0);\n\n  if (bind(s, (struct sockaddr *)&a, sizeof(a)) < 0){\n    cout << \"Socket binding failed. (socket s, address a)\" << endl;\n    return false;\n  }\n\n  memset((char *)&sa, 0, sizeof(sa));\n  sa.sin_family = AF_INET;\n  sa.sin_port = htons(port);\n  inet_pton(AF_INET, hs.c_str(), &(sa.sin_addr));\n\n  cout << endl;\n\n  cout << \"Server address (inet mode): \" << inet_ntoa(sa.sin_addr) << endl;\n  cout << \"Port: \" << ntohs(sa.sin_port) << endl;\n\n  cout << endl << endl;\n\n  \/*fstr = string(file);\n\n  cout << \"File: \" << endl << fstr << endl << endl;*\/\n\n  seqNum = 0;\n  dropPck = false;\n  return true;\n}\n\nbool loadFile() {\n\n  ifstream is (FILENAME, ifstream::binary);\n\n  if(is) {\n    is.seekg(0, is.end);\n    length = is.tellg();\n    is.seekg(0, is.beg);\n\n    file = new char[length];\n\n    cout << \"Reading \" << length << \" characters...\" << endl;\n    is.read(file, length);\n\n    if(!is) { cout << \"File reading failed. (filename \" << FILENAME << \"). Only \" << is.gcount() << \" could be read.\"; return false; }\n    is.close();\n  }\n  return true;\n}\n\nbool sendFile() {\n\n  for(int x = 0; x <= length \/ BUFSIZE; x++) {\n    p = createPacket(x);\n    if(!sendPacket()) continue;\n\n    if(isAck()) { \n      handleAck();\n    } else { \n      handleNak(x);\n    }\n\n    memset(b, 0, BUFSIZE);\n  }\n  return true;\n}\n\nPacket createPacket(int index){\n    cout << endl;\n    cout << \"=== TRANSMISSION START\" << endl;\n    string mstr = fstr.substr(index * BUFSIZE, BUFSIZE);\n    if(index * BUFSIZE + BUFSIZE > length) {\n      mstr[length - (index * BUFSIZE)] = '\\0';\n    }\n    return Packet (seqNum, mstr.c_str());\n}\n\nbool sendPacket(){\n    int pc = probCorrupt; int pl = probLoss;\n    if((dropPck = gremlin(&p, pc, pl)) == false){\n      if(sendto(s, p.str(), BUFSIZE + 7, 0, (struct sockaddr *)&sa, sizeof(sa)) < 0) {\n        cout << \"Package sending failed. (socket s, server address sa, message m)\" << endl;\n        return false;\n      }\n      return true;\n    } else return false;\n}\nbool isAck() {\n    recvfrom(s, b, BUFSIZE + 7, 0, (struct sockaddr *)&sa, &salen);\n\n    cout << endl << \"=== SERVER RESPONSE TEST\" << endl;\n    cout << \"Data: \" << b << endl;\n    if(b[6] == '0') return true;\n    else return false;\n}\nvoid handleAck() {\n\n}\nvoid handleNak(int& x) {\n\n      char * sns = new char[2];\n      memcpy(sns, &b[0], 1);\n      sns[1] = '\\0';\n\n      char * css = new char[5];\n      memcpy(css, &b[1], 5);\n      \n      char * db = new char[BUFSIZE + 1];\n      memcpy(db, &b[2], BUFSIZE);\n      db[BUFSIZE] = '\\0';\n\n      cout << \"Sequence number: \" << sns << endl;\n      cout << \"Checksum: \" << css << endl;\n\n      Packet pk (0, db);\n      pk.setSequenceNum(boost::lexical_cast<int>(sns));\n      pk.setCheckSum(boost::lexical_cast<int>(css));\n\n      if(!pk.chksm()) x--; \n      else x = (x - 2 > 0) ? x - 2 : 0;\n}\n\nbool gremlin(Packet * pack, int corruptProb, int lossProb){\n  bool dropPacket = false;\n  int r = rand() % 100;\n\n  cout << \"Corruption probability: \" << corruptProb << endl;\n  cout << \"Random number: \" << r << endl;\n\n  if(r <= (lossProb)){\n    dropPacket = true;\n    cout << \"Dropped!\" << endl;\n  }  \n  else if(r <= (corruptProb)){\n    cout << \"Corrupted!\" << endl;\n    pack->loadDataBuffer((char*)\"GREMLIN LOL\");\n  }\n  else seqNum = (seqNum) ? false : true; \n  cout << \"Seq. num: \" << pack->getSequenceNum() << endl;\n  cout << \"Checksum: \" << pack->getCheckSum() << endl;\n  cout << \"Message: \"  << pack->getDataBuffer() << endl;\n\n  return dropPacket;\n}\n\nbool isvpack(unsigned char * p) {\n\n  char * sns = new char[3];\n  memcpy(sns, &p[0], 3);\n  sns[2] = '\\0';\n\n  char * css = new char[6];\n  memcpy(css, &p[2], 5);\n  css[5] = '\\0';\n      \n  char * db = new char[BUFSIZE + 1];\n  memcpy(db, &p[8], BUFSIZE);\n  db[BUFSIZE] = '\\0';\n\n  int sn = boost::lexical_cast<int>(sns);\n  int cs = boost::lexical_cast<int>(css);\n\n  Packet pk (0, db);\n  pk.setSequenceNum(sn);\n\n  cout << \"cs: \" << cs << endl;\n  cout << \"pk.generateCheckSum(): \" << pk.generateCheckSum() << endl;\n\n\n\n  if(!(sn >= (base % 32) && sn <= (base % 32) + WIN_SIZE - 1)) { cout << \"Bad sequence number.\" << endl; return false; }\n  if(cs != pk.generateCheckSum()) { cout << \"Bad checksum.\" << endl; return false; }\n  return true;\n}\n\n\nbool getFile(){\n  \/* Loop forever, waiting for messages from a client. *\/\n  cout << \"Waiting on port \" << PORT << \"...\" << endl;\n\n  ofstream file(\"Dumpfile\");\n\n  int rlen;\n  int ack;\n  \n  for (;;) {\n    unsigned char packet[PAKSIZE + 1];\n    unsigned char dataPull[BUFSIZE];\n    rlen = recvfrom(s, packet, PAKSIZE + 1, 0, (struct sockaddr *)&sa, &salen);\n\n\tfor(int x = 0; x < BUFSIZE; x++) {\n      dataPull[x] = packet[x + 8];\n    }\n    if (rlen > 0) {\n\t  char * sns = new char[3];\n\t  memcpy(sns, &packet[0], 3);\n\t  sns[2] = '\\0';\n\t\t\n      char * css = new char[6];\n      memcpy(css, &packet[2], 5);\n      css[5] = '\\0';\n      cout << endl << endl << \"=== RECEIPT\" << endl;\n      cout << \"Seq. num: \" << sns << endl;\n      cout << \"Checksum: \" << css << endl;\n      cout << \"Received message: \" << dataPull << endl;\n\t  int pid = boost::lexical_cast<int>(sns);\n      if(isvpack(packet)) {\n\t\tcout << \"Is valid packet. (sq.nm. \" << pid << \", base \" << base << \")\" << endl;\n\t\tif(pid == base % 32) { \n\t\t\tcout << \"Is required packet.\" << endl;\n\t\t\tbase++; \/\/increment base of window\n\t\t\tfile << dataPull;\n\t\t\tfile.flush();\n\t\t}\n      } else cout << \"%%% ERROR IN PACKET \" << pid << \"%%%\" << endl;\n\n      cout << \"Sent response: \";\n      cout << \"ACK \" << base << endl;\n\n\t  if(packet[6] == '1') usleep(delayT*1000);\n\n\t  string wbs = to_string((long long)base);\n\t  const char * ackval = wbs.c_str();\n\n      if(sendto(s, ackval, 10, 0, (struct sockaddr *)&sa, salen) < 0) {\n        cout << \"Acknowledgement failed. (socket s, acknowledgement message ack, client address ca, client address length calen)\" << endl;\n\t\tperror(\"sendto()\");\n        return 0;\n      }\n\t  delete sns;\n      delete css;\n    }\n  }\n  file.close();\n  return true;\n}\n<commit_msg>More clean up<commit_after>\n#include <sys\/socket.h>\n#include <netinet\/in.h>\n#include <arpa\/inet.h>\n#include <string.h>\n#include <errno.h>\n#include <stdio.h>\n#include <iostream>\n#include <fstream>\n#include <boost\/lexical_cast.hpp>\n#include \"packet.h\"\n\n#define BUFSIZE 122\n#define FILENAME \"Testfile\"\n#define TEST_FILENAME \"Testfile2\"\n#define PORT 10038\n#define PAKSIZE 129\n#define ACK 0\n#define NAK 1\n#define WIN_SIZE 16\n\nusing namespace std;\n\nbool gremlin(Packet * pack, int corruptProb, int lossProb);\nbool init(int argc, char** argv);\nbool loadFile();\nbool sendFile();\nbool getFile();\nchar * recvPkt();\nbool isvpack(unsigned char * p);\nPacket createPacket(int index);\nbool sendPacket();\nbool isAck();\nvoid handleAck();\nvoid handleNak(int& x);\n\nint seqNum;\nint probCorrupt;\nint probLoss;\nstring hs;\nshort int port;\nchar * file;\nunsigned char* window[16]; \/\/packet window\nint base; \/\/used to determine position in window of arriving packets\nint length;\nstruct sockaddr_in a;\nstruct sockaddr_in sa;\nsocklen_t salen;\nstring fstr;\nbool dropPck;\nPacket p;\nint delayT;\nint s;\nunsigned char b[BUFSIZE];\n\nint main(int argc, char** argv) {\n  \n  if(!init(argc, argv)) return -1;\n \n  if(sendto(s, \"GET Testfile\", BUFSIZE + 7, 0, (struct sockaddr *)&sa, sizeof(sa)) < 0) {\n    cout << \"Package sending failed. (socket s, server address sa, message m)\" << endl;\n    return false;\n  }\n  \n  getFile();\n\n  return 0;\n}\n\nbool init(int argc, char** argv) {\n  base = 0; \/\/initialize base\n  s = 0;\n\n  hs = string(\"131.204.14.\") + argv[1]; \/* Needs to be updated? Might be a string like \"tux175.engr.auburn.edu.\" *\/\n  port = 10038; \/* Can be any port within 10038-10041, inclusive. *\/\n\n  char* delayTStr = argv[2];\n  delayT = boost::lexical_cast<int>(delayTStr);\n\n  \/*if(!loadFile()) {\n    cout << \"Loading file failed. (filename FILENAME)\" << endl;\n    return false;\n  }*\/\n\n  if ((s = socket(AF_INET, SOCK_DGRAM, IPPROTO_UDP)) < 0) {\n    cout << \"Socket creation failed. (socket s)\" << endl;\n    return false;\n  }\n\n  memset((char *)&a, 0, sizeof(a));\n  a.sin_family = AF_INET;\n  a.sin_addr.s_addr = htonl(INADDR_ANY); \/\/why does this always give us 0? \n  a.sin_port = htons(0);\n\n  if (bind(s, (struct sockaddr *)&a, sizeof(a)) < 0){\n    cout << \"Socket binding failed. (socket s, address a)\" << endl;\n    return false;\n  }\n\n  memset((char *)&sa, 0, sizeof(sa));\n  sa.sin_family = AF_INET;\n  sa.sin_port = htons(port);\n  inet_pton(AF_INET, hs.c_str(), &(sa.sin_addr));\n\n  cout << endl;\n\n  cout << \"Server address (inet mode): \" << inet_ntoa(sa.sin_addr) << endl;\n  cout << \"Port: \" << ntohs(sa.sin_port) << endl;\n\n  cout << endl << endl;\n\n  \/*fstr = string(file);\n\n  cout << \"File: \" << endl << fstr << endl << endl;*\/\n\n  seqNum = 0;\n  dropPck = false;\n  return true;\n}\n\nbool loadFile() {\n\n  ifstream is (FILENAME, ifstream::binary);\n\n  if(is) {\n    is.seekg(0, is.end);\n    length = is.tellg();\n    is.seekg(0, is.beg);\n\n    file = new char[length];\n\n    cout << \"Reading \" << length << \" characters...\" << endl;\n    is.read(file, length);\n\n    if(!is) { cout << \"File reading failed. (filename \" << FILENAME << \"). Only \" << is.gcount() << \" could be read.\"; return false; }\n    is.close();\n  }\n  return true;\n}\n\nbool sendFile() {\n\n  for(int x = 0; x <= length \/ BUFSIZE; x++) {\n    p = createPacket(x);\n    if(!sendPacket()) continue;\n\n    if(isAck()) { \n      handleAck();\n    } else { \n      handleNak(x);\n    }\n\n    memset(b, 0, BUFSIZE);\n  }\n  return true;\n}\n\nPacket createPacket(int index){\n    cout << endl;\n    cout << \"=== TRANSMISSION START\" << endl;\n    string mstr = fstr.substr(index * BUFSIZE, BUFSIZE);\n    if(index * BUFSIZE + BUFSIZE > length) {\n      mstr[length - (index * BUFSIZE)] = '\\0';\n    }\n    return Packet (seqNum, mstr.c_str());\n}\n\nbool sendPacket(){\n    int pc = probCorrupt; int pl = probLoss;\n    if((dropPck = gremlin(&p, pc, pl)) == false){\n      if(sendto(s, p.str(), BUFSIZE + 7, 0, (struct sockaddr *)&sa, sizeof(sa)) < 0) {\n        cout << \"Package sending failed. (socket s, server address sa, message m)\" << endl;\n        return false;\n      }\n      return true;\n    } else return false;\n}\nbool isAck() {\n    recvfrom(s, b, BUFSIZE + 7, 0, (struct sockaddr *)&sa, &salen);\n\n    cout << endl << \"=== SERVER RESPONSE TEST\" << endl;\n    cout << \"Data: \" << b << endl;\n    if(b[6] == '0') return true;\n    else return false;\n}\nvoid handleAck() {\n\n}\nvoid handleNak(int& x) {\n\n      char * sns = new char[2];\n      memcpy(sns, &b[0], 1);\n      sns[1] = '\\0';\n\n      char * css = new char[5];\n      memcpy(css, &b[1], 5);\n      \n      char * db = new char[BUFSIZE + 1];\n      memcpy(db, &b[2], BUFSIZE);\n      db[BUFSIZE] = '\\0';\n\n      cout << \"Sequence number: \" << sns << endl;\n      cout << \"Checksum: \" << css << endl;\n\n      Packet pk (0, db);\n      pk.setSequenceNum(boost::lexical_cast<int>(sns));\n      pk.setCheckSum(boost::lexical_cast<int>(css));\n\n      if(!pk.chksm()) x--; \n      else x = (x - 2 > 0) ? x - 2 : 0;\n}\n\nbool gremlin(Packet * pack, int corruptProb, int lossProb){\n  bool dropPacket = false;\n  int r = rand() % 100;\n\n  cout << \"Corruption probability: \" << corruptProb << endl;\n  cout << \"Random number: \" << r << endl;\n\n  if(r <= (lossProb)){\n    dropPacket = true;\n    cout << \"Dropped!\" << endl;\n  }  \n  else if(r <= (corruptProb)){\n    cout << \"Corrupted!\" << endl;\n    pack->loadDataBuffer((char*)\"GREMLIN LOL\");\n  }\n  else seqNum = (seqNum) ? false : true; \n  cout << \"Seq. num: \" << pack->getSequenceNum() << endl;\n  cout << \"Checksum: \" << pack->getCheckSum() << endl;\n  cout << \"Message: \"  << pack->getDataBuffer() << endl;\n\n  return dropPacket;\n}\n\nbool isvpack(unsigned char * p) {\n\n  char * sns = new char[3];\n  memcpy(sns, &p[0], 3);\n  sns[2] = '\\0';\n\n  char * css = new char[6];\n  memcpy(css, &p[2], 5);\n  css[5] = '\\0';\n      \n  char * db = new char[BUFSIZE + 1];\n  memcpy(db, &p[8], BUFSIZE);\n  db[BUFSIZE] = '\\0';\n\n  int sn = boost::lexical_cast<int>(sns);\n  int cs = boost::lexical_cast<int>(css);\n\n  Packet pk (0, db);\n  pk.setSequenceNum(sn);\n\n  cout << \"cs: \" << cs << endl;\n  cout << \"pk.generateCheckSum(): \" << pk.generateCheckSum() << endl;\n\n\n\n  if(!(sn >= (base % 32) && sn <= (base % 32) + WIN_SIZE - 1)) { cout << \"Bad sequence number.\" << endl; return false; }\n  if(cs != pk.generateCheckSum()) { cout << \"Bad checksum.\" << endl; return false; }\n  return true;\n}\n\n\nbool getFile(){\n  \/* Loop forever, waiting for messages from a client. *\/\n  cout << \"Waiting on port \" << PORT << \"...\" << endl;\n\n  ofstream file(\"Dumpfile\");\n\n  int rlen;\n  int ack;\n  \n  for (;;) {\n    unsigned char packet[PAKSIZE + 1];\n    unsigned char dataPull[BUFSIZE];\n    rlen = recvfrom(s, packet, PAKSIZE + 1, 0, (struct sockaddr *)&sa, &salen);\n\n\tfor(int x = 0; x < BUFSIZE; x++) {\n      dataPull[x] = packet[x + 8];\n    }\n\tdataPull[BUFSIZE] = '\/0';\n    if (rlen > 0) {\n\t  char * sns = new char[3];\n\t  memcpy(sns, &packet[0], 3);\n\t  sns[2] = '\\0';\n\t\t\n      char * css = new char[6];\n      memcpy(css, &packet[2], 5);\n      css[5] = '\\0';\n      cout << endl << endl << \"=== RECEIPT\" << endl;\n      cout << \"Seq. num: \" << sns << endl;\n      cout << \"Checksum: \" << css << endl;\n      cout << \"Received message: \" << dataPull << endl;\n\t  int pid = boost::lexical_cast<int>(sns);\n      if(isvpack(packet)) {\n\t\tcout << \"Is valid packet. (sq.nm. \" << pid << \", base \" << base << \")\" << endl;\n\t\tif(pid == base % 32) { \n\t\t\tcout << \"Is required packet.\" << endl;\n\t\t\tbase++; \/\/increment base of window\n\t\t\tfile << dataPull;\n\t\t\tfile.flush();\n\t\t}\n      } else cout << \"%%% ERROR IN PACKET \" << pid << \"%%%\" << endl;\n\n      cout << \"Sent response: \";\n      cout << \"ACK \" << base << endl;\n\n\t  if(packet[6] == '1') usleep(delayT*1000);\n\n\t  string wbs = to_string((long long)base);\n\t  const char * ackval = wbs.c_str();\n\n      if(sendto(s, ackval, 10, 0, (struct sockaddr *)&sa, salen) < 0) {\n        cout << \"Acknowledgement failed. (socket s, acknowledgement message ack, client address ca, client address length calen)\" << endl;\n\t\tperror(\"sendto()\");\n        return 0;\n      }\n\t  delete sns;\n      delete css;\n    }\n  }\n  file.close();\n  return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"client.h\"\n\nusing namespace bittrex;\n\napi::Public Client::get_public() {\n    return api::Public(std::move(connection));\n}\n\napi::Market Client::get_market() {\n    return api::Market(std::move(connection));\n}\n\napi::Account Client::get_account() {\n    return api::Account(std::move(connection));\n}\n<commit_msg>minor<commit_after>#include \"client.h\"\n\nusing namespace bittrex;\n\napi::Public Client::get_public() {\n    return api::Public(connection);\n}\n\napi::Market Client::get_market() {\n    return api::Market(connection);\n}\n\napi::Account Client::get_account() {\n    return api::Account(connection);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <netdb.h>\n#include <unistd.h>\n#include <sys\/fcntl.h>\n\n#include \"client.h\"\n#include \"duckchat.h\"\n#include \"raw.h\"\n\n\/\/ Variables\nstruct sockaddr_in client_addr;\nstruct sockaddr_in server_addr;\nint client_socket;\nstruct addrinfo *server_info;\nchar *channel;\n\n\n\/\/ Prints an error message and exits the program.\nvoid Error(const char *msg) {\n  std::cerr << msg << std::endl;\n  exit(1);\n}\n\n\nvoid PrintPrompt() {\n  std::cout << \">\" << std::flush;\n}\n\n\n\/\/ Splits strings around spaces.\nstd::vector<std::string> StringSplit(std::string input) {\n  std::istringstream iss(input);\n  std::vector<std::string> result{std::istream_iterator<std::string>{iss}, std::istream_iterator<std::string>{}};\n\n  return result;\n}\n\n\n\/\/ Splits strings around spaces.\nstd::vector<std::string> SplitString(char *input, char delimiter) {\n  std::vector<std::string> result;\n  std::string word = \"\";\n\n  size_t input_size = strlen(input);\n  for (size_t i = 0; i < input_size; i++) {\n    if (input[i] != delimiter) {\n      word += input[i];\n    } else {\n      result.push_back(word);\n      word = \"\";\n    }\n  }\n  result.push_back(word);\n\n  return result;\n}\n\n\nvoid StripChar(char *input, char c) {\n  size_t size = strlen(input);\n  for (size_t i = 0; i < size; i++) {\n    if (input[i] == c) {\n      input[i] = '\\0';\n    }\n  }\n}\n\n\n\/\/ Gets the address info of the server at a the given port and creates the client's socket.\nvoid CreateSocket(char *domain, const char *port) {\n  std::cout << \"Connecting to \" << domain << std::endl;\n\n  struct addrinfo hints;\n  struct addrinfo *server_info_tmp;\n  int status;\n\n  memset(&hints, 0, sizeof(hints));\n  hints.ai_family = AF_UNSPEC;\n  hints.ai_socktype = SOCK_DGRAM;\n  hints.ai_protocol = 0;\n\n  if ((status = getaddrinfo(domain, port, &hints, &server_info_tmp)) != 0) {\n    std::cerr << \"client: unable to resolve address: \" << gai_strerror(status) << std::endl;\n    exit(1);\n  }\n\n  \/\/ getaddrinfo() returns a list of address structures into server_info_tmp.\n  \/\/ Tries each address until a successful connect().\n  \/\/ If socket() (or connect()) fails, closes the socket and tries the next address.\n\n  for (server_info = server_info_tmp; server_info != NULL; server_info = server_info->ai_next) {\n    if ((client_socket = socket(server_info->ai_family, server_info->ai_socktype, server_info->ai_protocol)) < 0) {\n      continue;\n    }\n    if (connect(client_socket, server_info->ai_addr, server_info->ai_addrlen) != -1) {\n      fcntl(client_socket, F_SETFL, O_NONBLOCK);\n      break; \/\/ Success\n    }\n    close(client_socket);\n  }\n\n  if (server_info == NULL) {\n    Error(\"client: all sockets failed to connect\");\n  }\n}\n\n\n\/\/ Sends a message to all users in on the active channel.\nint SendSay(const char *message) {\n  struct request_say say;\n  memset(&say, 0, sizeof(say));\n  say.req_type = REQ_SAY;\n  strncpy(say.req_text, message, SAY_MAX);\n  strncpy(say.req_channel, channel, CHANNEL_MAX);\n\n  if (sendto(client_socket, &say, sizeof(say), 0, server_info->ai_addr, server_info->ai_addrlen) < 0) {\n    Error(\"client: failed to send message\\n\");\n  }\n\n  return 0;\n}\n\n\n\/\/ Sends login requests to the server.\nint SendLogin(char *username) {\n  struct request_login login;\n  memset(&login, 0, sizeof(login));\n  login.req_type = REQ_LOGIN;\n  strncpy(login.req_username, username, USERNAME_MAX);\n\n  size_t message_size = sizeof(struct request_login);\n\n  if (sendto(client_socket, &login, message_size, 0, server_info->ai_addr, server_info->ai_addrlen) < 0) {\n    Error(\"client: failed to request login\\n\");\n  }\n\n  return 0;\n}\n\n\n\/\/ Sends logout requests to the server.\nint SendLogout() {\n  struct request_logout logout;\n  memset((char *) &logout, 0, sizeof(logout));\n  logout.req_type = REQ_LOGOUT;\n\n  size_t message_size = sizeof(struct request_logout);\n\n  if (sendto(client_socket, &logout, message_size, 0, server_info->ai_addr, server_info->ai_addrlen) < 0) {\n    Error(\"client: failed to request logout\\n\");\n  }\n\n  return 0;\n}\n\n\n\/\/ Sends join requests to the server.\nint SendJoin(char *channel) {\n  struct request_join join;\n  memset((char *) &join, 0, sizeof(join));\n  join.req_type = REQ_JOIN;\n  strncpy(join.req_channel, channel, CHANNEL_MAX);\n\n  size_t message_size = sizeof(struct request_join);\n\n  if (sendto(client_socket, &join, message_size, 0, server_info->ai_addr, server_info->ai_addrlen) < 0) {\n    Error(\"client: failed to request join\\n\");\n  }\n\n  return 0;\n}\n\n\n\/\/ Handles TXT-SAY server messages.\nvoid HandleTextSay(char *receive_buffer, char *output) {\n  struct text_say say;\n  memcpy(&say, receive_buffer, sizeof(struct text_say));\n  std::cout << \"\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\";\n  std::cout << \"[\" << say.txt_channel << \"]\" << \"[\" << say.txt_username << \"]: \" << say.txt_text << std::endl;\n  PrintPrompt();\n  std::cout << output << std::flush;\n}\n\n\n\/\/ Processes the input string to decide what type of command it is.\nbool ProcessInput(std::string input) {\n  std::vector<std::string> inputs = StringSplit(input);\n  bool result = true;\n\n  if (inputs[0] == \"\/exit\") {\n    SendLogout();\n    cooked_mode();\n    result = false;\n  } else if (inputs[0] == \"\/list\") {\n\n  } else if (inputs[0] == \"\/join\") {\n\n  } else if (inputs[0] == \"\/leave\") {\n\n  } else if (inputs[0] == \"\/who\") {\n\n  } else if (inputs[0] == \"\/switch\") {\n\n  } else {\n    std::cout << \"\\n*Unknown command\" << std::endl;\n  }\n\n  return result;\n}\n\n\nint main(int argc, char *argv[]) {\n  char *domain;\n  char *port_str;\n  int port_num;\n  char *username;\n  char *input;\n  char *output = (char *) \"\";\n\n  char stdin_buffer[SAY_MAX + 1];\n  char *stdin_buffer_pointer = stdin_buffer;\n\n  fd_set read_set;\n  int result;\n  char receive_buffer[kBufferSize];\n  memset(&receive_buffer, 0, kBufferSize);\n\n  if (argc < 4) {\n    Error(\"usage: client [server name] [port] [username]\");\n  }\n\n  domain = argv[1];\n  port_str = argv[2];\n  port_num = atoi(argv[2]);\n  username = argv[3];\n\n  if (strlen(domain) > UNIX_PATH_MAX) {\n    Error(\"client: server name must be less than 108 characters\");\n  }\n\n  if (port_num < 0 || port_num > 65535) {\n    Error(\"client: port number must be between 0 and 65535\");\n  }\n\n  if (strlen(username) > USERNAME_MAX) {\n    Error(\"client: username must be less than 32 characters\");\n  }\n\n  CreateSocket(domain, port_str);\n\n  SendLogin(username);\n\n  channel = (char *) \"Common\";\n  SendJoin(channel);\n\n  if (raw_mode() != 0){\n    Error(\"client: error using raw mode\");\n  }\n\n  PrintPrompt();\n\n  while (1) {\n    FD_ZERO(&read_set);\n    FD_SET(client_socket, &read_set);\n    FD_SET(STDIN_FILENO, &read_set);\n\n    if ((result = select(client_socket + 1, &read_set, NULL, NULL, NULL)) < 0) {\n      Error(\"client: problem using select\");\n    }\n\n    if (result > 0) {\n      if (FD_ISSET(STDIN_FILENO, &read_set)) {\n        \/\/ User enter a char.\n        char c = (char) getchar();\n        if (c == '\\n') {\n          \/\/ Increments pointer and adds NULL char.\n          *stdin_buffer_pointer++ = '\\0';\n\n          \/\/ Resets stdin_buffer_pointer to the start of stdin_buffer.\n          stdin_buffer_pointer = stdin_buffer;\n\n          std::cout << \"\\n\" << std::flush;\n\n          \/\/ Prevents output from printing on the new prompt after a newline char.\n          output = (char *) \"\";\n\n          input = stdin_buffer;\n          if (input[0] == '\/' && !ProcessInput(input)) {\n            break;\n          } else {\n            \/\/ Sends chat messages.\n            SendSay(input);\n          }\n        } else if (stdin_buffer_pointer != stdin_buffer + SAY_MAX) {\n          \/\/ Increments pointer and adds char c.\n          *stdin_buffer_pointer++ = c;\n          \n          std::cout << c << std::flush;\n\n          \/\/ Copies pointer into output.\n          output = stdin_buffer_pointer;\n          \/\/ Increments and sets NULL char.\n          *output++ = '\\0';\n          \/\/ Copies stdin_buffer into part of output before NULL char.\n          output = stdin_buffer;\n        }\n      } else if (FD_ISSET(client_socket, &read_set)) {\n        \/\/ Socket has data.\n        int read_size = read(client_socket, receive_buffer, kBufferSize);\n\n        if (read_size != 0) {\n          struct text message;\n          memcpy(&message, receive_buffer, sizeof(struct text));\n          text_t text_type = message.txt_type;\n\n          switch (text_type) {\n            case TXT_SAY:\n              HandleTextSay(receive_buffer, output);\n              break;\n            default:\n              break;\n          }\n        }\n\n        memset(&receive_buffer, 0, SAY_MAX);\n      } \/\/ end of if client_socket\n\n    } \/\/ end of if result\n\n  } \/\/ end of while\n\n  return 0;\n}<commit_msg>test join<commit_after>#include <netdb.h>\n#include <unistd.h>\n#include <sys\/fcntl.h>\n\n#include \"client.h\"\n#include \"duckchat.h\"\n#include \"raw.h\"\n\n\/\/ Variables\nstruct sockaddr_in client_addr;\nstruct sockaddr_in server_addr;\nint client_socket;\nstruct addrinfo *server_info;\nchar *channel;\n\n\n\/\/ Prints an error message and exits the program.\nvoid Error(const char *msg) {\n  std::cerr << msg << std::endl;\n  exit(1);\n}\n\n\nvoid PrintPrompt() {\n  std::cout << \">\" << std::flush;\n}\n\n\n\/\/ Splits strings around spaces.\nstd::vector<std::string> StringSplit(std::string input) {\n  std::istringstream iss(input);\n  std::vector<std::string> result{std::istream_iterator<std::string>{iss}, std::istream_iterator<std::string>{}};\n\n  return result;\n}\n\n\n\/\/ Splits strings around spaces.\nstd::vector<std::string> SplitString(char *input, char delimiter) {\n  std::vector<std::string> result;\n  std::string word = \"\";\n\n  size_t input_size = strlen(input);\n  for (size_t i = 0; i < input_size; i++) {\n    if (input[i] != delimiter) {\n      word += input[i];\n    } else {\n      result.push_back(word);\n      word = \"\";\n    }\n  }\n  result.push_back(word);\n\n  return result;\n}\n\n\nvoid StripChar(char *input, char c) {\n  size_t size = strlen(input);\n  for (size_t i = 0; i < size; i++) {\n    if (input[i] == c) {\n      input[i] = '\\0';\n    }\n  }\n}\n\n\n\/\/ Gets the address info of the server at a the given port and creates the client's socket.\nvoid CreateSocket(char *domain, const char *port) {\n  std::cout << \"Connecting to \" << domain << std::endl;\n\n  struct addrinfo hints;\n  struct addrinfo *server_info_tmp;\n  int status;\n\n  memset(&hints, 0, sizeof(hints));\n  hints.ai_family = AF_UNSPEC;\n  hints.ai_socktype = SOCK_DGRAM;\n  hints.ai_protocol = 0;\n\n  if ((status = getaddrinfo(domain, port, &hints, &server_info_tmp)) != 0) {\n    std::cerr << \"client: unable to resolve address: \" << gai_strerror(status) << std::endl;\n    exit(1);\n  }\n\n  \/\/ getaddrinfo() returns a list of address structures into server_info_tmp.\n  \/\/ Tries each address until a successful connect().\n  \/\/ If socket() (or connect()) fails, closes the socket and tries the next address.\n\n  for (server_info = server_info_tmp; server_info != NULL; server_info = server_info->ai_next) {\n    if ((client_socket = socket(server_info->ai_family, server_info->ai_socktype, server_info->ai_protocol)) < 0) {\n      continue;\n    }\n    if (connect(client_socket, server_info->ai_addr, server_info->ai_addrlen) != -1) {\n      fcntl(client_socket, F_SETFL, O_NONBLOCK);\n      break; \/\/ Success\n    }\n    close(client_socket);\n  }\n\n  if (server_info == NULL) {\n    Error(\"client: all sockets failed to connect\");\n  }\n}\n\n\n\/\/ Sends a message to all users in on the active channel.\nint SendSay(const char *message) {\n  struct request_say say;\n  memset(&say, 0, sizeof(say));\n  say.req_type = REQ_SAY;\n  strncpy(say.req_text, message, SAY_MAX);\n  strncpy(say.req_channel, channel, CHANNEL_MAX);\n\n  if (sendto(client_socket, &say, sizeof(say), 0, server_info->ai_addr, server_info->ai_addrlen) < 0) {\n    Error(\"client: failed to send message\\n\");\n  }\n\n  return 0;\n}\n\n\n\/\/ Sends login requests to the server.\nint SendLogin(char *username) {\n  struct request_login login;\n  memset(&login, 0, sizeof(login));\n  login.req_type = REQ_LOGIN;\n  strncpy(login.req_username, username, USERNAME_MAX);\n\n  size_t message_size = sizeof(struct request_login);\n\n  if (sendto(client_socket, &login, message_size, 0, server_info->ai_addr, server_info->ai_addrlen) < 0) {\n    Error(\"client: failed to request login\\n\");\n  }\n\n  return 0;\n}\n\n\n\/\/ Sends logout requests to the server.\nint SendLogout() {\n  struct request_logout logout;\n  memset((char *) &logout, 0, sizeof(logout));\n  logout.req_type = REQ_LOGOUT;\n\n  size_t message_size = sizeof(struct request_logout);\n\n  if (sendto(client_socket, &logout, message_size, 0, server_info->ai_addr, server_info->ai_addrlen) < 0) {\n    Error(\"client: failed to request logout\\n\");\n  }\n\n  return 0;\n}\n\n\n\/\/ Sends join requests to the server.\nint SendJoin(const char *channel) {\n  struct request_join join;\n  memset((char *) &join, 0, sizeof(join));\n  join.req_type = REQ_JOIN;\n  strncpy(join.req_channel, channel, CHANNEL_MAX);\n\n  size_t message_size = sizeof(struct request_join);\n\n  if (sendto(client_socket, &join, message_size, 0, server_info->ai_addr, server_info->ai_addrlen) < 0) {\n    Error(\"client: failed to request join\\n\");\n  }\n\n  return 0;\n}\n\n\n\/\/ Handles TXT-SAY server messages.\nvoid HandleTextSay(char *receive_buffer, char *output) {\n  struct text_say say;\n  memcpy(&say, receive_buffer, sizeof(struct text_say));\n  std::cout << \"\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\\b\";\n  std::cout << \"[\" << say.txt_channel << \"]\" << \"[\" << say.txt_username << \"]: \" << say.txt_text << std::endl;\n  PrintPrompt();\n  std::cout << output << std::flush;\n}\n\n\n\/\/ Processes the input string to decide what type of command it is.\nbool ProcessInput(std::string input) {\n  std::vector<std::string> inputs = StringSplit(input);\n  bool result = true;\n\n  if (inputs[0] == \"\/exit\") {\n    SendLogout();\n    cooked_mode();\n    result = false;\n  } else if (inputs[0] == \"\/list\") {\n\n  } else if (inputs[0] == \"\/join\" && strlen(inputs) > 1) {\n    SendJoin(inputs[1].c_str());\n  } else if (inputs[0] == \"\/leave\") {\n\n  } else if (inputs[0] == \"\/who\") {\n\n  } else if (inputs[0] == \"\/switch\") {\n\n  } else {\n    std::cout << \"\\n*Unknown command\" << std::endl;\n  }\n\n  return result;\n}\n\n\nint main(int argc, char *argv[]) {\n  char *domain;\n  char *port_str;\n  int port_num;\n  char *username;\n  char *input;\n  char *output = (char *) \"\";\n\n  char stdin_buffer[SAY_MAX + 1];\n  char *stdin_buffer_pointer = stdin_buffer;\n\n  fd_set read_set;\n  int result;\n  char receive_buffer[kBufferSize];\n  memset(&receive_buffer, 0, kBufferSize);\n\n  if (argc < 4) {\n    Error(\"usage: client [server name] [port] [username]\");\n  }\n\n  domain = argv[1];\n  port_str = argv[2];\n  port_num = atoi(argv[2]);\n  username = argv[3];\n\n  if (strlen(domain) > UNIX_PATH_MAX) {\n    Error(\"client: server name must be less than 108 characters\");\n  }\n\n  if (port_num < 0 || port_num > 65535) {\n    Error(\"client: port number must be between 0 and 65535\");\n  }\n\n  if (strlen(username) > USERNAME_MAX) {\n    Error(\"client: username must be less than 32 characters\");\n  }\n\n  CreateSocket(domain, port_str);\n\n  SendLogin(username);\n\n  channel = (char *) \"Common\";\n  SendJoin(channel);\n\n  if (raw_mode() != 0){\n    Error(\"client: error using raw mode\");\n  }\n\n  PrintPrompt();\n\n  while (1) {\n    FD_ZERO(&read_set);\n    FD_SET(client_socket, &read_set);\n    FD_SET(STDIN_FILENO, &read_set);\n\n    if ((result = select(client_socket + 1, &read_set, NULL, NULL, NULL)) < 0) {\n      Error(\"client: problem using select\");\n    }\n\n    if (result > 0) {\n      if (FD_ISSET(STDIN_FILENO, &read_set)) {\n        \/\/ User enter a char.\n        char c = (char) getchar();\n        if (c == '\\n') {\n          \/\/ Increments pointer and adds NULL char.\n          *stdin_buffer_pointer++ = '\\0';\n\n          \/\/ Resets stdin_buffer_pointer to the start of stdin_buffer.\n          stdin_buffer_pointer = stdin_buffer;\n\n          std::cout << \"\\n\" << std::flush;\n\n          \/\/ Prevents output from printing on the new prompt after a newline char.\n          output = (char *) \"\";\n\n          input = stdin_buffer;\n          if (input[0] == '\/' && !ProcessInput(input)) {\n            break;\n          } else {\n            \/\/ Sends chat messages.\n            SendSay(input);\n          }\n        } else if (stdin_buffer_pointer != stdin_buffer + SAY_MAX) {\n          \/\/ Increments pointer and adds char c.\n          *stdin_buffer_pointer++ = c;\n          \n          std::cout << c << std::flush;\n\n          \/\/ Copies pointer into output.\n          output = stdin_buffer_pointer;\n          \/\/ Increments and sets NULL char.\n          *output++ = '\\0';\n          \/\/ Copies stdin_buffer into part of output before NULL char.\n          output = stdin_buffer;\n        }\n      } else if (FD_ISSET(client_socket, &read_set)) {\n        \/\/ Socket has data.\n        int read_size = read(client_socket, receive_buffer, kBufferSize);\n\n        if (read_size != 0) {\n          struct text message;\n          memcpy(&message, receive_buffer, sizeof(struct text));\n          text_t text_type = message.txt_type;\n\n          switch (text_type) {\n            case TXT_SAY:\n              HandleTextSay(receive_buffer, output);\n              break;\n            default:\n              break;\n          }\n        }\n\n        memset(&receive_buffer, 0, SAY_MAX);\n      } \/\/ end of if client_socket\n\n    } \/\/ end of if result\n\n  } \/\/ end of while\n\n  return 0;\n}<|endoftext|>"}
{"text":"<commit_before>#include <sys\/types.h>\n#include <sys\/errno.h>\n#include <fcntl.h>\n#include <limits.h>\n#include <stdio.h>\n#include <unistd.h>\n\n#include <map>\n#include <vector>\n\n#include <common\/buffer.h>\n#include <common\/endian.h>\n#include <common\/limits.h>\n#include <common\/timer\/timer.h>\n\n#include <xcodec\/xcodec.h>\n#include <xcodec\/xcodec_cache.h>\n#include <xcodec\/xcodec_decoder.h>\n#include <xcodec\/xcodec_encoder.h>\n\nenum FileAction {\n\tNone, Compress, Decompress\n};\n\n#define\tTACK_FLAG_QUIET_OUTPUT\t\t(0x00000001)\n#define\tTACK_FLAG_CODEC_TIMING\t\t(0x00000002)\n#define\tTACK_FLAG_BYTE_STATS\t\t(0x00000004)\n#define\tTACK_FLAG_CODEC_TIMING_EACH\t(0x00000008)\n\nstatic void compress(const std::string&, int, int, XCodec *, unsigned, Timer *);\nstatic void decompress(const std::string&, int, int, XCodec *, unsigned, Timer *);\nstatic bool fill(int, Buffer *);\nstatic void flush(int, Buffer *);\nstatic void print_ratio(const std::string&, uint64_t, uint64_t);\nstatic void process_file(const std::string&, int, int, FileAction, XCodec *, unsigned, Timer *);\nstatic void process_files(int, char *[], FileAction, XCodec *, unsigned, Timer *);\nstatic void time_samples(Timer *);\nstatic void time_stats(const std::string&, Timer *);\nstatic void usage(void);\n\nint\nmain(int argc, char *argv[])\n{\n\tUUID uuid;\n\tuuid.generate();\n\n\tXCodecCache *cache = XCodecCache::lookup(uuid);\n\tXCodec codec(cache);\n\n\tunsigned flags;\n\tbool samples, verbose;\n\tFileAction action;\n\tint ch;\n\n\taction = None;\n\tsamples = false;\n\tverbose = false;\n\n\twhile ((ch = getopt(argc, argv, \"?cdsvEQST\")) != -1) {\n\t\tswitch (ch) {\n\t\tcase 'c':\n\t\t\taction = Compress;\n\t\t\tbreak;\n\t\tcase 'd':\n\t\t\taction = Decompress;\n\t\t\tbreak;\n\t\tcase 's':\n\t\t\tflags |= TACK_FLAG_BYTE_STATS;\n\t\t\tbreak;\n\t\tcase 'v':\n\t\t\tverbose = true;\n\t\t\tbreak;\n\t\tcase 'E':\n\t\t\tflags |= TACK_FLAG_CODEC_TIMING_EACH;\n\t\t\tbreak;\n\t\tcase 'Q':\n\t\t\tflags |= TACK_FLAG_QUIET_OUTPUT;\n\t\t\tbreak;\n\t\tcase 'S':\n\t\t\tsamples = true;\n\t\t\tbreak;\n\t\tcase 'T':\n\t\t\tflags |= TACK_FLAG_CODEC_TIMING;\n\t\t\tbreak;\n\t\tcase '?':\n\t\tdefault:\n\t\t\tusage();\n\t\t}\n\t}\n\targc -= optind;\n\targv += optind;\n\n\tif ((flags & TACK_FLAG_CODEC_TIMING_EACH) != 0 &&\n\t    (flags & TACK_FLAG_CODEC_TIMING) == 0)\n\t\tusage();\n\n\tif (samples && (flags & TACK_FLAG_CODEC_TIMING) == 0)\n\t\tusage();\n\n\tif ((flags & TACK_FLAG_CODEC_TIMING_EACH) != 0 &&\n\t    samples)\n\t\tusage();\n\n\tif (verbose) {\n\t\tLog::mask(\".?\", Log::Debug);\n\t} else {\n\t\tLog::mask(\".?\", Log::Info);\n\t}\n\n\tTimer codec_timer;\n\n\tswitch (action) {\n\tcase None:\n\t\tusage();\n\tcase Compress:\n\tcase Decompress:\n\t\tprocess_files(argc, argv, action, &codec, flags, &codec_timer);\n\n\t\tif ((flags & TACK_FLAG_CODEC_TIMING_EACH) == 0) {\n\t\t\tif (samples)\n\t\t\t\ttime_samples(&codec_timer);\n\t\t\telse\n\t\t\t\ttime_stats(\"<total>\", &codec_timer);\n\t\t}\n\t\tbreak;\n\tdefault:\n\t\tNOTREACHED();\n\t}\n\n\treturn (0);\n}\n\nstatic void\ncompress(const std::string& name, int ifd, int ofd, XCodec *codec, unsigned flags, Timer *timer)\n{\n\tXCodecEncoder encoder(codec->cache());\n\tBuffer input, output;\n\tuint64_t inbytes, outbytes;\n\n\tif ((flags & TACK_FLAG_BYTE_STATS) != 0)\n\t\tinbytes = outbytes = 0;\n\n\twhile (fill(ifd, &input)) {\n\t\tif ((flags & TACK_FLAG_BYTE_STATS) != 0)\n\t\t\tinbytes += input.length();\n\t\tif ((flags & TACK_FLAG_CODEC_TIMING) != 0)\n\t\t\ttimer->start();\n\t\tencoder.encode(&output, &input);\n\t\tif ((flags & TACK_FLAG_CODEC_TIMING) != 0)\n\t\t\ttimer->stop();\n\t\tif ((flags & TACK_FLAG_BYTE_STATS) != 0) {\n\t\t\tinbytes -= input.length();\n\t\t\toutbytes += output.length();\n\t\t}\n\t\tflush(ofd, &output);\n\t}\n\tASSERT(input.empty());\n\tASSERT(output.empty());\n\n\tif ((flags & TACK_FLAG_BYTE_STATS) != 0)\n\t\tprint_ratio(name, inbytes, outbytes);\n}\n\nstatic void\ndecompress(const std::string& name, int ifd, int ofd, XCodec *codec, unsigned flags, Timer *timer)\n{\n\tstd::set<uint64_t> unknown_hashes;\n\tXCodecDecoder decoder(codec->cache());\n\tBuffer input, output;\n\tuint64_t inbytes, outbytes;\n\n\tif ((flags & TACK_FLAG_BYTE_STATS) != 0)\n\t\tinbytes = outbytes = 0;\n\n\twhile (fill(ifd, &input)) {\n\t\tif ((flags & TACK_FLAG_BYTE_STATS) != 0)\n\t\t\tinbytes += input.length();\n\t\tif ((flags & TACK_FLAG_CODEC_TIMING) != 0)\n\t\t\ttimer->start();\n\t\tif (!decoder.decode(&output, &input, unknown_hashes)) {\n\t\t\tERROR(\"\/decompress\") << \"Decode failed.\";\n\t\t\treturn;\n\t\t}\n\t\tif ((flags & TACK_FLAG_CODEC_TIMING) != 0)\n\t\t\ttimer->stop();\n\t\tif (!unknown_hashes.empty()) {\n\t\t\tERROR(\"\/decompress\") << \"Cannot decode stream with unknown hashes.\";\n\t\t\treturn;\n\t\t}\n\t\tif ((flags & TACK_FLAG_BYTE_STATS) != 0) {\n\t\t\tinbytes -= input.length();\n\t\t\toutbytes += output.length();\n\t\t}\n\t\tflush(ofd, &output);\n\t}\n\tASSERT(input.empty());\n\tASSERT(output.empty());\n\n\tif ((flags & TACK_FLAG_BYTE_STATS) != 0)\n\t\tprint_ratio(name, outbytes, inbytes); \/* Reverse order of compress().  *\/\n}\n\nstatic bool\nfill(int fd, Buffer *input)\n{\n\tuint8_t data[65536];\n\tssize_t len;\n\n\tlen = read(fd, data, sizeof data);\n\tif (len == -1)\n\t\tHALT(\"\/fill\") << \"read failed.\";\n\tif (len == 0)\n\t\treturn (false);\n\tinput->append(data, len);\n\treturn (true);\n}\n\nstatic void\nflush(int fd, Buffer *output)\n{\n\tssize_t len;\n\n\tif (fd == -1) {\n\t\toutput->clear();\n\t\treturn;\n\t}\n\n\tfor (;;) {\n\t\tBuffer::SegmentIterator iter = output->segments();\n\t\tif (iter.end())\n\t\t\tbreak;\n\n\t\tconst BufferSegment *seg = *iter;\n\n\t\tlen = write(fd, seg->data(), seg->length());\n\t\tif (len != (ssize_t)seg->length())\n\t\t\tHALT(\"\/output\") << \"write failed.\";\n\t\toutput->skip((size_t)len);\n\t}\n\tASSERT(output->empty());\n}\n\nstatic void\nprint_ratio(const std::string& name, uint64_t inbytes, uint64_t outbytes)\n{\n\tINFO(\"\/codec_stats\") << name << \": \" << inbytes << \" uncompressed bytes, \" << outbytes << \" compressed bytes.\";\n\tif (inbytes <= outbytes) {\n\t\tINFO(\"\/codec_stats\") << name << \": bloat ratio 1:\" << ((float)outbytes \/ inbytes) << \" (\" << ((float)inbytes \/ outbytes) << \":1)\";\n\t} else {\n\t\tINFO(\"\/codec_stats\") << name << \": compression ratio 1:\" << ((float)outbytes \/ inbytes) << \" (\" << ((float)inbytes \/ outbytes) << \":1)\";\n\t}\n}\n\nstatic void\nprocess_file(const std::string& name, int ifd, int ofd, FileAction action, XCodec *codec, unsigned flags, Timer *timer)\n{\n\tswitch (action) {\n\tcase Compress:\n\t\tcompress(name, ifd, ofd, codec, flags, timer);\n\t\tbreak;\n\tcase Decompress:\n\t\tdecompress(name, ifd, ofd, codec, flags, timer);\n\t\tbreak;\n\tdefault:\n\t\tNOTREACHED();\n\t}\n\n\tif ((flags & TACK_FLAG_CODEC_TIMING_EACH) != 0)\n\t\ttime_stats(name, timer);\n}\n\nstatic void\nprocess_files(int argc, char *argv[], FileAction action, XCodec *codec, unsigned flags, Timer *timer)\n{\n\tint ifd, ofd;\n\n\tif (argc == 0) {\n\t\tifd = STDIN_FILENO;\n\t\tif ((flags & TACK_FLAG_QUIET_OUTPUT) != 0)\n\t\t\tofd = -1;\n\t\telse\n\t\t\tofd = STDOUT_FILENO;\n\t\tprocess_file(\"<stdin>\", ifd, ofd, action, codec, flags, timer);\n\t} else {\n\t\twhile (argc--) {\n\t\t\tconst char *file = *argv++;\n\n\t\t\tifd = open(file, O_RDONLY);\n\t\t\tif (ifd == -1) {\n\t\t\t\tERROR(\"\/tack\") << \"Could not open: \" << file;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif ((flags & TACK_FLAG_QUIET_OUTPUT) != 0)\n\t\t\t\tofd = -1;\n\t\t\telse\n\t\t\t\tofd = STDOUT_FILENO;\n\n\t\t\tprocess_file(file, ifd, ofd, action, codec, flags, timer);\n\n\t\t\tclose(ifd);\n\t\t}\n\t}\n}\n\nstatic void\ntime_samples(Timer *timer)\n{\n\tstd::vector<uintmax_t> samples = timer->samples();\n\tstd::vector<uintmax_t>::iterator it;\n\n\tfor (it = samples.begin(); it != samples.end(); ++it)\n\t\tfprintf(stderr, \"%ju\\n\", *it);\n}\n\nstatic void\ntime_stats(const std::string& name, Timer *timer)\n{\n\tstd::vector<uintmax_t> samples = timer->samples();\n\tstd::vector<uintmax_t>::iterator it;\n\tLogHandle log(\"\/codec_timer\");\n\tuintmax_t microseconds;\n\n\tINFO(log) << name << \": \" << samples.size() << \" timer samples.\";\n\tmicroseconds = 0;\n\tfor (it = samples.begin(); it != samples.end(); ++it)\n\t\tmicroseconds += *it;\n\tINFO(log) << name << \": \" << microseconds << \" total runtime.\";\n\tINFO(log) << name << \": \" << (microseconds \/ samples.size()) << \" mean microseconds\/call.\";\n\n\ttimer->reset();\n}\n\nstatic void\nusage(void)\n{\n\tfprintf(stderr,\n\"usage: tack [-svQ] [-T [-E | -S]] -c [file ...]\\n\"\n\"       tack [-svQ] [-T [-E | -S]] -d [file ...]\\n\");\n\texit(1);\n}\n<commit_msg>o) Initialize flags properly. o) Check that we're doing timing at all before printing samples.<commit_after>#include <sys\/types.h>\n#include <sys\/errno.h>\n#include <fcntl.h>\n#include <limits.h>\n#include <stdio.h>\n#include <unistd.h>\n\n#include <map>\n#include <vector>\n\n#include <common\/buffer.h>\n#include <common\/endian.h>\n#include <common\/limits.h>\n#include <common\/timer\/timer.h>\n\n#include <xcodec\/xcodec.h>\n#include <xcodec\/xcodec_cache.h>\n#include <xcodec\/xcodec_decoder.h>\n#include <xcodec\/xcodec_encoder.h>\n\nenum FileAction {\n\tNone, Compress, Decompress\n};\n\n#define\tTACK_FLAG_QUIET_OUTPUT\t\t(0x00000001)\n#define\tTACK_FLAG_CODEC_TIMING\t\t(0x00000002)\n#define\tTACK_FLAG_BYTE_STATS\t\t(0x00000004)\n#define\tTACK_FLAG_CODEC_TIMING_EACH\t(0x00000008)\n\nstatic void compress(const std::string&, int, int, XCodec *, unsigned, Timer *);\nstatic void decompress(const std::string&, int, int, XCodec *, unsigned, Timer *);\nstatic bool fill(int, Buffer *);\nstatic void flush(int, Buffer *);\nstatic void print_ratio(const std::string&, uint64_t, uint64_t);\nstatic void process_file(const std::string&, int, int, FileAction, XCodec *, unsigned, Timer *);\nstatic void process_files(int, char *[], FileAction, XCodec *, unsigned, Timer *);\nstatic void time_samples(Timer *);\nstatic void time_stats(const std::string&, Timer *);\nstatic void usage(void);\n\nint\nmain(int argc, char *argv[])\n{\n\tUUID uuid;\n\tuuid.generate();\n\n\tXCodecCache *cache = XCodecCache::lookup(uuid);\n\tXCodec codec(cache);\n\n\tbool samples, verbose;\n\tFileAction action;\n\tunsigned flags;\n\tint ch;\n\n\taction = None;\n\tflags = 0;\n\tsamples = false;\n\tverbose = false;\n\n\twhile ((ch = getopt(argc, argv, \"?cdsvEQST\")) != -1) {\n\t\tswitch (ch) {\n\t\tcase 'c':\n\t\t\taction = Compress;\n\t\t\tbreak;\n\t\tcase 'd':\n\t\t\taction = Decompress;\n\t\t\tbreak;\n\t\tcase 's':\n\t\t\tflags |= TACK_FLAG_BYTE_STATS;\n\t\t\tbreak;\n\t\tcase 'v':\n\t\t\tverbose = true;\n\t\t\tbreak;\n\t\tcase 'E':\n\t\t\tflags |= TACK_FLAG_CODEC_TIMING_EACH;\n\t\t\tbreak;\n\t\tcase 'Q':\n\t\t\tflags |= TACK_FLAG_QUIET_OUTPUT;\n\t\t\tbreak;\n\t\tcase 'S':\n\t\t\tsamples = true;\n\t\t\tbreak;\n\t\tcase 'T':\n\t\t\tflags |= TACK_FLAG_CODEC_TIMING;\n\t\t\tbreak;\n\t\tcase '?':\n\t\tdefault:\n\t\t\tusage();\n\t\t}\n\t}\n\targc -= optind;\n\targv += optind;\n\n\tif ((flags & TACK_FLAG_CODEC_TIMING_EACH) != 0 &&\n\t    (flags & TACK_FLAG_CODEC_TIMING) == 0)\n\t\tusage();\n\n\tif (samples && (flags & TACK_FLAG_CODEC_TIMING) == 0)\n\t\tusage();\n\n\tif ((flags & TACK_FLAG_CODEC_TIMING_EACH) != 0 &&\n\t    samples)\n\t\tusage();\n\n\tif (verbose) {\n\t\tLog::mask(\".?\", Log::Debug);\n\t} else {\n\t\tLog::mask(\".?\", Log::Info);\n\t}\n\n\tTimer codec_timer;\n\n\tswitch (action) {\n\tcase None:\n\t\tusage();\n\tcase Compress:\n\tcase Decompress:\n\t\tprocess_files(argc, argv, action, &codec, flags, &codec_timer);\n\n\t\tif ((flags & TACK_FLAG_CODEC_TIMING) != 0 &&\n\t\t    (flags & TACK_FLAG_CODEC_TIMING_EACH) == 0) {\n\t\t\tif (samples)\n\t\t\t\ttime_samples(&codec_timer);\n\t\t\telse\n\t\t\t\ttime_stats(\"<total>\", &codec_timer);\n\t\t}\n\t\tbreak;\n\tdefault:\n\t\tNOTREACHED();\n\t}\n\n\treturn (0);\n}\n\nstatic void\ncompress(const std::string& name, int ifd, int ofd, XCodec *codec, unsigned flags, Timer *timer)\n{\n\tXCodecEncoder encoder(codec->cache());\n\tBuffer input, output;\n\tuint64_t inbytes, outbytes;\n\n\tif ((flags & TACK_FLAG_BYTE_STATS) != 0)\n\t\tinbytes = outbytes = 0;\n\n\twhile (fill(ifd, &input)) {\n\t\tif ((flags & TACK_FLAG_BYTE_STATS) != 0)\n\t\t\tinbytes += input.length();\n\t\tif ((flags & TACK_FLAG_CODEC_TIMING) != 0)\n\t\t\ttimer->start();\n\t\tencoder.encode(&output, &input);\n\t\tif ((flags & TACK_FLAG_CODEC_TIMING) != 0)\n\t\t\ttimer->stop();\n\t\tif ((flags & TACK_FLAG_BYTE_STATS) != 0) {\n\t\t\tinbytes -= input.length();\n\t\t\toutbytes += output.length();\n\t\t}\n\t\tflush(ofd, &output);\n\t}\n\tASSERT(input.empty());\n\tASSERT(output.empty());\n\n\tif ((flags & TACK_FLAG_BYTE_STATS) != 0)\n\t\tprint_ratio(name, inbytes, outbytes);\n}\n\nstatic void\ndecompress(const std::string& name, int ifd, int ofd, XCodec *codec, unsigned flags, Timer *timer)\n{\n\tstd::set<uint64_t> unknown_hashes;\n\tXCodecDecoder decoder(codec->cache());\n\tBuffer input, output;\n\tuint64_t inbytes, outbytes;\n\n\tif ((flags & TACK_FLAG_BYTE_STATS) != 0)\n\t\tinbytes = outbytes = 0;\n\n\twhile (fill(ifd, &input)) {\n\t\tif ((flags & TACK_FLAG_BYTE_STATS) != 0)\n\t\t\tinbytes += input.length();\n\t\tif ((flags & TACK_FLAG_CODEC_TIMING) != 0)\n\t\t\ttimer->start();\n\t\tif (!decoder.decode(&output, &input, unknown_hashes)) {\n\t\t\tERROR(\"\/decompress\") << \"Decode failed.\";\n\t\t\treturn;\n\t\t}\n\t\tif ((flags & TACK_FLAG_CODEC_TIMING) != 0)\n\t\t\ttimer->stop();\n\t\tif (!unknown_hashes.empty()) {\n\t\t\tERROR(\"\/decompress\") << \"Cannot decode stream with unknown hashes.\";\n\t\t\treturn;\n\t\t}\n\t\tif ((flags & TACK_FLAG_BYTE_STATS) != 0) {\n\t\t\tinbytes -= input.length();\n\t\t\toutbytes += output.length();\n\t\t}\n\t\tflush(ofd, &output);\n\t}\n\tASSERT(input.empty());\n\tASSERT(output.empty());\n\n\tif ((flags & TACK_FLAG_BYTE_STATS) != 0)\n\t\tprint_ratio(name, outbytes, inbytes); \/* Reverse order of compress().  *\/\n}\n\nstatic bool\nfill(int fd, Buffer *input)\n{\n\tuint8_t data[65536];\n\tssize_t len;\n\n\tlen = read(fd, data, sizeof data);\n\tif (len == -1)\n\t\tHALT(\"\/fill\") << \"read failed.\";\n\tif (len == 0)\n\t\treturn (false);\n\tinput->append(data, len);\n\treturn (true);\n}\n\nstatic void\nflush(int fd, Buffer *output)\n{\n\tssize_t len;\n\n\tif (fd == -1) {\n\t\toutput->clear();\n\t\treturn;\n\t}\n\n\tfor (;;) {\n\t\tBuffer::SegmentIterator iter = output->segments();\n\t\tif (iter.end())\n\t\t\tbreak;\n\n\t\tconst BufferSegment *seg = *iter;\n\n\t\tlen = write(fd, seg->data(), seg->length());\n\t\tif (len != (ssize_t)seg->length())\n\t\t\tHALT(\"\/output\") << \"write failed.\";\n\t\toutput->skip((size_t)len);\n\t}\n\tASSERT(output->empty());\n}\n\nstatic void\nprint_ratio(const std::string& name, uint64_t inbytes, uint64_t outbytes)\n{\n\tINFO(\"\/codec_stats\") << name << \": \" << inbytes << \" uncompressed bytes, \" << outbytes << \" compressed bytes.\";\n\tif (inbytes <= outbytes) {\n\t\tINFO(\"\/codec_stats\") << name << \": bloat ratio 1:\" << ((float)outbytes \/ inbytes) << \" (\" << ((float)inbytes \/ outbytes) << \":1)\";\n\t} else {\n\t\tINFO(\"\/codec_stats\") << name << \": compression ratio 1:\" << ((float)outbytes \/ inbytes) << \" (\" << ((float)inbytes \/ outbytes) << \":1)\";\n\t}\n}\n\nstatic void\nprocess_file(const std::string& name, int ifd, int ofd, FileAction action, XCodec *codec, unsigned flags, Timer *timer)\n{\n\tswitch (action) {\n\tcase Compress:\n\t\tcompress(name, ifd, ofd, codec, flags, timer);\n\t\tbreak;\n\tcase Decompress:\n\t\tdecompress(name, ifd, ofd, codec, flags, timer);\n\t\tbreak;\n\tdefault:\n\t\tNOTREACHED();\n\t}\n\n\tif ((flags & TACK_FLAG_CODEC_TIMING_EACH) != 0)\n\t\ttime_stats(name, timer);\n}\n\nstatic void\nprocess_files(int argc, char *argv[], FileAction action, XCodec *codec, unsigned flags, Timer *timer)\n{\n\tint ifd, ofd;\n\n\tif (argc == 0) {\n\t\tifd = STDIN_FILENO;\n\t\tif ((flags & TACK_FLAG_QUIET_OUTPUT) != 0)\n\t\t\tofd = -1;\n\t\telse\n\t\t\tofd = STDOUT_FILENO;\n\t\tprocess_file(\"<stdin>\", ifd, ofd, action, codec, flags, timer);\n\t} else {\n\t\twhile (argc--) {\n\t\t\tconst char *file = *argv++;\n\n\t\t\tifd = open(file, O_RDONLY);\n\t\t\tif (ifd == -1) {\n\t\t\t\tERROR(\"\/tack\") << \"Could not open: \" << file;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif ((flags & TACK_FLAG_QUIET_OUTPUT) != 0)\n\t\t\t\tofd = -1;\n\t\t\telse\n\t\t\t\tofd = STDOUT_FILENO;\n\n\t\t\tprocess_file(file, ifd, ofd, action, codec, flags, timer);\n\n\t\t\tclose(ifd);\n\t\t}\n\t}\n}\n\nstatic void\ntime_samples(Timer *timer)\n{\n\tstd::vector<uintmax_t> samples = timer->samples();\n\tstd::vector<uintmax_t>::iterator it;\n\n\tfor (it = samples.begin(); it != samples.end(); ++it)\n\t\tfprintf(stderr, \"%ju\\n\", *it);\n}\n\nstatic void\ntime_stats(const std::string& name, Timer *timer)\n{\n\tstd::vector<uintmax_t> samples = timer->samples();\n\tstd::vector<uintmax_t>::iterator it;\n\tLogHandle log(\"\/codec_timer\");\n\tuintmax_t microseconds;\n\n\tINFO(log) << name << \": \" << samples.size() << \" timer samples.\";\n\tmicroseconds = 0;\n\tfor (it = samples.begin(); it != samples.end(); ++it)\n\t\tmicroseconds += *it;\n\tINFO(log) << name << \": \" << microseconds << \" total runtime.\";\n\tINFO(log) << name << \": \" << (microseconds \/ samples.size()) << \" mean microseconds\/call.\";\n\n\ttimer->reset();\n}\n\nstatic void\nusage(void)\n{\n\tfprintf(stderr,\n\"usage: tack [-svQ] [-T [-E | -S]] -c [file ...]\\n\"\n\"       tack [-svQ] [-T [-E | -S]] -d [file ...]\\n\");\n\texit(1);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*!\n    \\file launcher_console.cpp\n    \\brief Console launcher implementation\n    \\author Ivan Shynkarenka\n    \\date 16.07.2015\n    \\copyright MIT License\n*\/\n\n#include \"benchmark\/launcher_console.h\"\n\n#include \"benchmark\/console.h\"\n#include \"benchmark\/reporter_console.h\"\n#include \"benchmark\/reporter_csv.h\"\n#include \"benchmark\/reporter_json.h\"\n#include \"benchmark\/version.h\"\n\n#include <iomanip>\n#include <regex>\n\n#include <OptionParser.h>\n\nnamespace CppBenchmark {\n\nvoid LauncherConsole::Initialize(const int argc, char const* const* const argv)\n{\n    auto parser = optparse::OptionParser().version(version);\n\n    const char* output[] = { \"console\", \"csv\", \"json\" };\n\n    parser.add_option(\"-h\", \"--help\").help(\"Show help\");\n    parser.add_option(\"-f\", \"--filter\").help(\"Filter benchmarks by the given regexp pattern\");\n    parser.add_option(\"-l\", \"--list\").action(\"store_true\").help(\"List all avaliable benchmarks\");\n    parser.add_option(\"-o\", \"--output\").choices(&output[0], &output[3]).set_default(output[0]).help(\"Output format (console, csv, json). Default: %default\");\n    parser.add_option(\"-q\", \"--quiet\").action(\"store_true\").help(\"Launch in quiet mode. No progress will be shown!\");\n    parser.add_option(\"-r\", \"--histograms\").action(\"store\").type(\"int\").set_default(0).help(\"Create High Dynamic Range (HDR) Histogram files with a given resolution. Default: %default\");\n\n    optparse::Values options = parser.parse_args(argc, argv);\n\n    \/\/ Check for double initialization\n    if (_init)\n    {\n        parser.error(\"Console launcher double initialization!\");\n    }\n\n    \/\/ Print help\n    if (options.get(\"help\"))\n    {\n        parser.print_help();\n        exit(EXIT_SUCCESS);\n    }\n\n    \/\/ Setup console launcher parameters\n    _list = options.get(\"list\");\n    _silent = options.get(\"silent\");\n    _histograms = (int32_t)options.get(\"histograms\");\n    if (options.is_set(\"filter\"))\n        _filter = options[\"filter\"];\n    if (options.is_set(\"output\"))\n        _output = options[\"output\"];\n\n    \/\/ Update initialization flag\n    _init = true;\n}\n\nvoid LauncherConsole::Execute()\n{\n    if (_list)\n    {\n        \/\/ List all suitable benchmarks\n        std::regex matcher(_filter);\n        for (auto& benchmark : _benchmarks)\n        {\n            \/\/ Match benchmark name with the given pattern\n            if (_filter.empty() || std::regex_match(benchmark->name(), matcher))\n                std::cout << benchmark->name() << std::endl;\n        }\n    }\n    else\n    {\n        \/\/ Launch all suitable benchmarks\n        Launcher::Launch(_filter);\n    }\n}\n\nvoid LauncherConsole::Report() const\n{\n    if (_output == \"console\")\n    {\n        ReporterConsole reporter(std::cout);\n        Launcher::Report(reporter);\n    }\n    else if (_output == \"csv\")\n    {\n        ReporterCSV reporter(std::cout);\n        Launcher::Report(reporter);\n    }\n    else if (_output == \"json\")\n    {\n        ReporterJSON reporter(std::cout);\n        Launcher::Report(reporter);\n    }\n\n    \/\/ Report histograms\n    if (_histograms > 0)\n        Launcher::ReportHistograms(_histograms);\n}\n\nvoid LauncherConsole::onLaunching(int current, int total, const BenchmarkBase& benchmark, const Context& context, int attempt)\n{\n    if (_silent)\n        return;\n\n    std::cerr << Color::DARKGREY << \"[\" << std::setw(3) << (100 * current \/ total) << \"%] \" << Color::GREY << \"Launching \" << Color::LIGHTCYAN << benchmark.name() << context.description() << Color::GREY << \". Attempt \" << Color::WHITE << attempt << Color::GREY << \"...\";\n}\n\nvoid LauncherConsole::onLaunched(int current, int total, const BenchmarkBase& benchmark, const Context& context, int attempt)\n{\n    if (_silent)\n        return;\n\n    std::cerr << Color::LIGHTGREEN << \"Done!\" << std::endl;\n}\n\n} \/\/ namespace CppBenchmark\n<commit_msg>update<commit_after>\/*!\n    \\file launcher_console.cpp\n    \\brief Console launcher implementation\n    \\author Ivan Shynkarenka\n    \\date 16.07.2015\n    \\copyright MIT License\n*\/\n\n#include \"benchmark\/launcher_console.h\"\n\n#include \"benchmark\/console.h\"\n#include \"benchmark\/reporter_console.h\"\n#include \"benchmark\/reporter_csv.h\"\n#include \"benchmark\/reporter_json.h\"\n#include \"benchmark\/version.h\"\n\n#include <iomanip>\n#include <regex>\n\n#include <OptionParser.h>\n\nnamespace CppBenchmark {\n\nvoid LauncherConsole::Initialize(const int argc, char const* const* const argv)\n{\n    auto parser = optparse::OptionParser().version(version);\n\n    const char* output[] = { \"console\", \"csv\", \"json\" };\n\n    parser.add_option(\"-f\", \"--filter\").help(\"Filter benchmarks by the given regexp pattern\");\n    parser.add_option(\"-l\", \"--list\").action(\"store_true\").help(\"List all avaliable benchmarks\");\n    parser.add_option(\"-o\", \"--output\").choices(&output[0], &output[3]).set_default(output[0]).help(\"Output format (console, csv, json). Default: %default\");\n    parser.add_option(\"-q\", \"--quiet\").action(\"store_true\").help(\"Launch in quiet mode. No progress will be shown!\");\n    parser.add_option(\"-r\", \"--histograms\").action(\"store\").type(\"int\").set_default(0).help(\"Create High Dynamic Range (HDR) Histogram files with a given resolution. Default: %default\");\n\n    optparse::Values options = parser.parse_args(argc, argv);\n\n    \/\/ Check for double initialization\n    if (_init)\n    {\n        parser.error(\"Console launcher double initialization!\");\n    }\n\n    \/\/ Print help\n    if (options.get(\"help\"))\n    {\n        parser.print_help();\n        exit(EXIT_SUCCESS);\n    }\n\n    \/\/ Setup console launcher parameters\n    _list = options.get(\"list\");\n    _silent = options.get(\"silent\");\n    _histograms = (int32_t)options.get(\"histograms\");\n    if (options.is_set(\"filter\"))\n        _filter = options[\"filter\"];\n    if (options.is_set(\"output\"))\n        _output = options[\"output\"];\n\n    \/\/ Update initialization flag\n    _init = true;\n}\n\nvoid LauncherConsole::Execute()\n{\n    if (_list)\n    {\n        \/\/ List all suitable benchmarks\n        std::regex matcher(_filter);\n        for (auto& benchmark : _benchmarks)\n        {\n            \/\/ Match benchmark name with the given pattern\n            if (_filter.empty() || std::regex_match(benchmark->name(), matcher))\n                std::cout << benchmark->name() << std::endl;\n        }\n    }\n    else\n    {\n        \/\/ Launch all suitable benchmarks\n        Launcher::Launch(_filter);\n    }\n}\n\nvoid LauncherConsole::Report() const\n{\n    if (_output == \"console\")\n    {\n        ReporterConsole reporter(std::cout);\n        Launcher::Report(reporter);\n    }\n    else if (_output == \"csv\")\n    {\n        ReporterCSV reporter(std::cout);\n        Launcher::Report(reporter);\n    }\n    else if (_output == \"json\")\n    {\n        ReporterJSON reporter(std::cout);\n        Launcher::Report(reporter);\n    }\n\n    \/\/ Report histograms\n    if (_histograms > 0)\n        Launcher::ReportHistograms(_histograms);\n}\n\nvoid LauncherConsole::onLaunching(int current, int total, const BenchmarkBase& benchmark, const Context& context, int attempt)\n{\n    if (_silent)\n        return;\n\n    std::cerr << Color::DARKGREY << \"[\" << std::setw(3) << (100 * current \/ total) << \"%] \" << Color::GREY << \"Launching \" << Color::LIGHTCYAN << benchmark.name() << context.description() << Color::GREY << \". Attempt \" << Color::WHITE << attempt << Color::GREY << \"...\";\n}\n\nvoid LauncherConsole::onLaunched(int current, int total, const BenchmarkBase& benchmark, const Context& context, int attempt)\n{\n    if (_silent)\n        return;\n\n    std::cerr << Color::LIGHTGREEN << \"Done!\" << std::endl;\n}\n\n} \/\/ namespace CppBenchmark\n<|endoftext|>"}
{"text":"<commit_before>#include \"PcaProductTokenizer.h\"\n#include <la-manager\/TitlePCAWrapper.h>\n#include <string>\n#include <vector>\n#include <map>\n#include <set>\n#include <algorithm>\n\nusing namespace sf1r;\nusing izenelib::util::UString;\n\nnamespace\n{\nconst std::size_t kMajorTermNum = 4;\n}\n\nvoid PcaProductTokenizer::tokenize(ProductTokenParam& param)\n{\n    TokenScoreVec tokens, subTokens;\n    std::string brand;\n    std::string model;\n\n    TitlePCAWrapper* titlePCA = TitlePCAWrapper::get();\n    titlePCA->pca(param.query, tokens, brand, model, subTokens, false);\n\n    if (tokens.empty())\n        return;\n\n    TokenScoreMap tokenScoreMap;\n    double scoreSum = 0;\n\n    for (TokenScoreVec::const_iterator it = tokens.begin();\n         it != tokens.end(); ++it)\n    {\n        if (tokenScoreMap.find(it->first) != tokenScoreMap.end())\n            continue;\n\n        tokenScoreMap[it->first] = it->second;\n        scoreSum += it->second;\n    }\n\n    TokenScoreVec sortTokens;\n    for (TokenScoreMap::iterator it = tokenScoreMap.begin();\n         it != tokenScoreMap.end(); ++it)\n    {\n        it->second \/= scoreSum;\n        sortTokens.push_back(*it);\n    }\n\n    std::sort(sortTokens.begin(), sortTokens.end(), compareTokenScore_);\n\n    std::vector<std::string> majorTokens;\n    extractMajorTokens_(sortTokens, majorTokens);\n\n    getMajorTokens_(majorTokens, tokenScoreMap, param.majorTokens);\n    getMinorTokens_(tokenScoreMap, param.minorTokens);\n\n    param.rankBoundary = 0.5;\n\n    if (param.isRefineResult)\n    {\n        getRefinedResult_(majorTokens, param.refinedResult);\n    }\n}\n\nbool PcaProductTokenizer::compareTokenScore_(const TokenScore& x, const TokenScore& y)\n{\n    return x.second > y.second;\n}\n\nvoid PcaProductTokenizer::extractMajorTokens_(\n    const TokenScoreVec& sortTokens,\n    std::vector<std::string>& majorTokens)\n{\n    const std::size_t num = std::min(sortTokens.size(), kMajorTermNum);\n\n    for (size_t i = 0; i < num; ++i)\n    {\n        majorTokens.push_back(sortTokens[i].first);\n    }\n}\n\nvoid PcaProductTokenizer::getMajorTokens_(\n    const std::vector<std::string>& majorTokens,\n    TokenScoreMap& tokenScoreMap,\n    ProductTokenParam::TokenScoreList& tokenScoreList)\n{\n    for (std::vector<std::string>::const_iterator it = majorTokens.begin();\n         it != majorTokens.end(); ++it)\n    {\n        TokenScoreMap::iterator mapIter = tokenScoreMap.find(*it);\n\n        if (mapIter == tokenScoreMap.end())\n            continue;\n\n        UString ustr(mapIter->first, UString::UTF_8);\n        std::pair<UString, double> tokenScore(ustr, mapIter->second);\n\n        tokenScoreMap.erase(mapIter);\n        tokenScoreList.push_back(tokenScore);\n    }\n}\n\nvoid PcaProductTokenizer::getMinorTokens_(\n    const TokenScoreMap& tokenScoreMap,\n    ProductTokenParam::TokenScoreList& tokenScoreList)\n{\n    for (TokenScoreMap::const_iterator it = tokenScoreMap.begin();\n         it != tokenScoreMap.end(); ++it)\n    {\n        UString ustr(it->first, UString::UTF_8);\n        std::pair<UString, double> tokenScore(ustr, it->second);\n\n        tokenScoreList.push_back(tokenScore);\n    }\n}\n\nvoid PcaProductTokenizer::getRefinedResult_(\n    const std::vector<std::string>& majorTokens,\n    izenelib::util::UString& refinedResult)\n{\n    for (std::vector<std::string>::const_iterator it = majorTokens.begin();\n         it != majorTokens.end(); ++it)\n    {\n        UString ustr(*it, UString::UTF_8);\n        refinedResult.append(ustr);\n        refinedResult.push_back(SPACE_UCHAR);\n    }\n}\n<commit_msg>For fuzzy search, reduce major term number from 4 to 3.<commit_after>#include \"PcaProductTokenizer.h\"\n#include <la-manager\/TitlePCAWrapper.h>\n#include <string>\n#include <vector>\n#include <map>\n#include <set>\n#include <algorithm>\n\nusing namespace sf1r;\nusing izenelib::util::UString;\n\nnamespace\n{\nconst std::size_t kMajorTermNum = 3;\n}\n\nvoid PcaProductTokenizer::tokenize(ProductTokenParam& param)\n{\n    TokenScoreVec tokens, subTokens;\n    std::string brand;\n    std::string model;\n\n    TitlePCAWrapper* titlePCA = TitlePCAWrapper::get();\n    titlePCA->pca(param.query, tokens, brand, model, subTokens, false);\n\n    if (tokens.empty())\n        return;\n\n    TokenScoreMap tokenScoreMap;\n    double scoreSum = 0;\n\n    for (TokenScoreVec::const_iterator it = tokens.begin();\n         it != tokens.end(); ++it)\n    {\n        if (tokenScoreMap.find(it->first) != tokenScoreMap.end())\n            continue;\n\n        tokenScoreMap[it->first] = it->second;\n        scoreSum += it->second;\n    }\n\n    TokenScoreVec sortTokens;\n    for (TokenScoreMap::iterator it = tokenScoreMap.begin();\n         it != tokenScoreMap.end(); ++it)\n    {\n        it->second \/= scoreSum;\n        sortTokens.push_back(*it);\n    }\n\n    std::sort(sortTokens.begin(), sortTokens.end(), compareTokenScore_);\n\n    std::vector<std::string> majorTokens;\n    extractMajorTokens_(sortTokens, majorTokens);\n\n    getMajorTokens_(majorTokens, tokenScoreMap, param.majorTokens);\n    getMinorTokens_(tokenScoreMap, param.minorTokens);\n\n    param.rankBoundary = 0.5;\n\n    if (param.isRefineResult)\n    {\n        getRefinedResult_(majorTokens, param.refinedResult);\n    }\n}\n\nbool PcaProductTokenizer::compareTokenScore_(const TokenScore& x, const TokenScore& y)\n{\n    return x.second > y.second;\n}\n\nvoid PcaProductTokenizer::extractMajorTokens_(\n    const TokenScoreVec& sortTokens,\n    std::vector<std::string>& majorTokens)\n{\n    const std::size_t num = std::min(sortTokens.size(), kMajorTermNum);\n\n    for (size_t i = 0; i < num; ++i)\n    {\n        majorTokens.push_back(sortTokens[i].first);\n    }\n}\n\nvoid PcaProductTokenizer::getMajorTokens_(\n    const std::vector<std::string>& majorTokens,\n    TokenScoreMap& tokenScoreMap,\n    ProductTokenParam::TokenScoreList& tokenScoreList)\n{\n    for (std::vector<std::string>::const_iterator it = majorTokens.begin();\n         it != majorTokens.end(); ++it)\n    {\n        TokenScoreMap::iterator mapIter = tokenScoreMap.find(*it);\n\n        if (mapIter == tokenScoreMap.end())\n            continue;\n\n        UString ustr(mapIter->first, UString::UTF_8);\n        std::pair<UString, double> tokenScore(ustr, mapIter->second);\n\n        tokenScoreMap.erase(mapIter);\n        tokenScoreList.push_back(tokenScore);\n    }\n}\n\nvoid PcaProductTokenizer::getMinorTokens_(\n    const TokenScoreMap& tokenScoreMap,\n    ProductTokenParam::TokenScoreList& tokenScoreList)\n{\n    for (TokenScoreMap::const_iterator it = tokenScoreMap.begin();\n         it != tokenScoreMap.end(); ++it)\n    {\n        UString ustr(it->first, UString::UTF_8);\n        std::pair<UString, double> tokenScore(ustr, it->second);\n\n        tokenScoreList.push_back(tokenScore);\n    }\n}\n\nvoid PcaProductTokenizer::getRefinedResult_(\n    const std::vector<std::string>& majorTokens,\n    izenelib::util::UString& refinedResult)\n{\n    for (std::vector<std::string>::const_iterator it = majorTokens.begin();\n         it != majorTokens.end(); ++it)\n    {\n        UString ustr(*it, UString::UTF_8);\n        refinedResult.append(ustr);\n        refinedResult.push_back(SPACE_UCHAR);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright (C) 2005-2010, 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 \"UserInformation.h\"\n#include \"Net.h\"\n#include \"ServerHandler.h\"\n#include \"ViewCert.h\"\n#include \"Audio.h\"\n#include \"Global.h\"\n\nUserInformation::UserInformation(const MumbleProto::UserStats &msg, QWidget *p) : QDialog(p) {\n\tsetupUi(this);\n\t\n\tuiSession = msg.session();\n\t\n\tqtTimer = new QTimer(this);\n\tconnect(qtTimer, SIGNAL(timeout()), this, SLOT(tick()));\n\tqtTimer->start(12000);\n\n\tqgbConnection->setVisible(false);\n\n\tupdate(msg);\n}\n\nunsigned int UserInformation::session() const {\n\treturn uiSession;\n}\n\nvoid UserInformation::tick() {\n\tqWarning() << \"Resend\" << bRequested << uiSession;\n\n\tif (bRequested)\n\t\treturn;\n\t\t\n\tbRequested = true;\n\tMumbleProto::UserStats mpus;\n\tmpus.set_session(uiSession);\n\tmpus.set_stats_only(true);\n\tg.sh->sendMessage(mpus);\n}\n\nvoid UserInformation::on_qpbCertificate_clicked() {\n\tViewCert *vc = new ViewCert(qlCerts, this);\n\tvc->exec();\n\tdelete vc;\n}\n\nQString UserInformation::secsToString(unsigned int secs) {\n\tQStringList qsl;\n\n\tint weeks = secs \/ (60 * 60 * 24 * 7);\n\tsecs = secs % (60 * 60 * 24 * 7);\n\tint days = secs \/ (60 * 60 * 24);\n\tsecs = secs % (60 * 60 * 24);\n\tint hours = secs \/ (60 * 60);\n\tsecs = secs % (60 * 60);\n\tint minutes = secs \/ 60;\n\tint seconds = secs % 60;\n\t\n\tif (weeks)\n\t\tqsl << tr(\"%1w\").arg(weeks);\n\tif (days)\n\t\tqsl << tr(\"%1d\").arg(days);\n\tif (hours)\n\t\tqsl << tr(\"%1h\").arg(hours);\n\tif (minutes || hours)\n\t\tqsl << tr(\"%1m\").arg(minutes);\n\tqsl << tr(\"%1s\").arg(seconds);\n\t\n\treturn qsl.join(tr(\" \"));\n}\n\nvoid UserInformation::update(const MumbleProto::UserStats &msg) {\n\tqWarning() << \"UPDATE\";\n\n\tbRequested = false;\n\t\n\tbool showcon = false;\n\t\n\tif (msg.certificates_size() > 0) {\n\t\tshowcon = true;\n\t\tqlCerts.clear();\n\t\tfor(int i=0;i<msg.certificates_size(); ++i) {\n\t\t\tconst std::string &s = msg.certificates(i);\n\t\t\tQList<QSslCertificate> certs = QSslCertificate::fromData(QByteArray(s.data(), s.length()), QSsl::Der);\n\t\t\tqlCerts <<certs;\n\t\t}\n\t\tif (! qlCerts.isEmpty()) {\n\t\t\tqpbCertificate->setEnabled(true);\n\t\t\tqlCertificate->setText(qlCerts.last().subjectInfo(QSslCertificate::CommonName));\n\t\t}\n\t}\n\tif (msg.has_address()) {\n\t\tshowcon = true;\n\t\tHostAddress ha(msg.address());\n\t\tqlAddress->setText(ha.toString());\n\t}\n\tif (msg.has_version()) {\n\t\tshowcon = true;\n\n\t\tconst MumbleProto::Version &mpv = msg.version();\n\t\tunsigned int v = mpv.version();\n\t\tunsigned int major = (v >> 16) & 0xFFFF;\n\t\tunsigned int minor = (v >> 8) & 0xFF;\n\t\tunsigned int patch = (v & 0xFF);\n\t\t\n\t\tqlVersion->setText(tr(\"%1.%2.%3 (%4)\").arg(major).arg(minor).arg(patch).arg(u8(mpv.release())));\n\t\tqlOS->setText(tr(\"%1 (%2)\").arg(u8(mpv.os())).arg(u8(mpv.os_version())));\n\t}\n\tif (msg.celt_versions_size() > 0) {\n\t\tQStringList qsl;\n\t\tfor(int i=0;i<msg.celt_versions_size(); ++i) {\n\t\t\tint v = msg.celt_versions(i);\n\t\t\tCELTCodec *cc = g.qmCodecs.value(v);\n\t\t\tif (cc) \n\t\t\t\tqsl << cc->version();\n\t\t\telse\n\t\t\t\tqsl << QString::number(v, 16);\n\t\t}\n\t\tqlCELT->setText(qsl.join(tr(\", \")));\n\t}\n\tif (showcon)\n\t\tqgbConnection->setVisible(true);\n\t\t\n\tqlTCPCount->setText(QString::number(msg.tcp_packets()));\n\tqlTCPAvg->setText(QString::number(msg.tcp_ping_avg(), 'f', 2));\n\tqlTCPVar->setText(QString::number(msg.tcp_ping_var(), 'f', 2));\n\n\tqlUDPCount->setText(QString::number(msg.udp_packets()));\n\tqlUDPAvg->setText(QString::number(msg.udp_ping_avg(), 'f', 2));\n\tqlUDPVar->setText(QString::number(msg.udp_ping_var(), 'f', 2));\n\t\n\tconst MumbleProto::UserStats_Stats &from = msg.from_client();\n\tqlFromGood->setText(QString::number(from.good()));\n\tqlFromLate->setText(QString::number(from.late()));\n\tqlFromLost->setText(QString::number(from.lost()));\n\tqlFromResync->setText(QString::number(from.resync()));\n\n\tconst MumbleProto::UserStats_Stats &to = msg.from_server();\n\tqlToGood->setText(QString::number(to.good()));\n\tqlToLate->setText(QString::number(to.late()));\n\tqlToLost->setText(QString::number(to.lost()));\n\tqlToResync->setText(QString::number(to.resync()));\n\t\n\tif (msg.has_onlinesecs()) {\n\t\tif (msg.has_idlesecs())\n\t\t\tqlTime->setText(tr(\"%1 online (%2 idle)\").arg(secsToString(msg.onlinesecs()), secsToString(msg.idlesecs())));\n\t\telse\n\t\t\tqlTime->setText(tr(\"%1 online\").arg(secsToString(msg.onlinesecs())));\n\t} \n\tif (msg.has_bandwidth())\n\t\tqlBandwidth->setText(tr(\"%1 kbit\/s\").arg(msg.bandwidth() \/ 125.0f, 0, 'f', 1));\n\telse\n\t\tqlBandwidth->setText(QString());\n}\n<commit_msg>Hide empty statistics fields<commit_after>\/* Copyright (C) 2005-2010, 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 \"UserInformation.h\"\n#include \"Net.h\"\n#include \"ServerHandler.h\"\n#include \"ViewCert.h\"\n#include \"Audio.h\"\n#include \"Global.h\"\n\nUserInformation::UserInformation(const MumbleProto::UserStats &msg, QWidget *p) : QDialog(p) {\n\tsetupUi(this);\n\t\n\tuiSession = msg.session();\n\t\n\tqtTimer = new QTimer(this);\n\tconnect(qtTimer, SIGNAL(timeout()), this, SLOT(tick()));\n\tqtTimer->start(12000);\n\n\tqgbConnection->setVisible(false);\n\n\tupdate(msg);\n\tresize(sizeHint());\n}\n\nunsigned int UserInformation::session() const {\n\treturn uiSession;\n}\n\nvoid UserInformation::tick() {\n\tif (bRequested)\n\t\treturn;\n\t\t\n\tbRequested = true;\n\tMumbleProto::UserStats mpus;\n\tmpus.set_session(uiSession);\n\tmpus.set_stats_only(true);\n\tg.sh->sendMessage(mpus);\n}\n\nvoid UserInformation::on_qpbCertificate_clicked() {\n\tViewCert *vc = new ViewCert(qlCerts, this);\n\tvc->setAttribute(Qt::WA_DeleteOnClose, true);\n\tvc->show();\n}\n\nQString UserInformation::secsToString(unsigned int secs) {\n\tQStringList qsl;\n\n\tint weeks = secs \/ (60 * 60 * 24 * 7);\n\tsecs = secs % (60 * 60 * 24 * 7);\n\tint days = secs \/ (60 * 60 * 24);\n\tsecs = secs % (60 * 60 * 24);\n\tint hours = secs \/ (60 * 60);\n\tsecs = secs % (60 * 60);\n\tint minutes = secs \/ 60;\n\tint seconds = secs % 60;\n\t\n\tif (weeks)\n\t\tqsl << tr(\"%1w\").arg(weeks);\n\tif (days)\n\t\tqsl << tr(\"%1d\").arg(days);\n\tif (hours)\n\t\tqsl << tr(\"%1h\").arg(hours);\n\tif (minutes || hours)\n\t\tqsl << tr(\"%1m\").arg(minutes);\n\tqsl << tr(\"%1s\").arg(seconds);\n\t\n\treturn qsl.join(tr(\" \"));\n}\n\nvoid UserInformation::update(const MumbleProto::UserStats &msg) {\n\tbRequested = false;\n\t\n\tbool showcon = false;\n\t\n\tif (msg.certificates_size() > 0) {\n\t\tshowcon = true;\n\t\tqlCerts.clear();\n\t\tfor(int i=0;i<msg.certificates_size(); ++i) {\n\t\t\tconst std::string &s = msg.certificates(i);\n\t\t\tQList<QSslCertificate> certs = QSslCertificate::fromData(QByteArray(s.data(), s.length()), QSsl::Der);\n\t\t\tqlCerts <<certs;\n\t\t}\n\t\tif (! qlCerts.isEmpty()) {\n\t\t\tqpbCertificate->setEnabled(true);\n\t\t\tqlCertificate->setText(qlCerts.last().subjectInfo(QSslCertificate::CommonName));\n\t\t}\n\t}\n\tif (msg.has_address()) {\n\t\tshowcon = true;\n\t\tHostAddress ha(msg.address());\n\t\tqlAddress->setText(ha.toString());\n\t}\n\tif (msg.has_version()) {\n\t\tshowcon = true;\n\n\t\tconst MumbleProto::Version &mpv = msg.version();\n\t\tunsigned int v = mpv.version();\n\t\tunsigned int major = (v >> 16) & 0xFFFF;\n\t\tunsigned int minor = (v >> 8) & 0xFF;\n\t\tunsigned int patch = (v & 0xFF);\n\t\t\n\t\tqlVersion->setText(tr(\"%1.%2.%3 (%4)\").arg(major).arg(minor).arg(patch).arg(u8(mpv.release())));\n\t\tqlOS->setText(tr(\"%1 (%2)\").arg(u8(mpv.os())).arg(u8(mpv.os_version())));\n\t}\n\tif (msg.celt_versions_size() > 0) {\n\t\tQStringList qsl;\n\t\tfor(int i=0;i<msg.celt_versions_size(); ++i) {\n\t\t\tint v = msg.celt_versions(i);\n\t\t\tCELTCodec *cc = g.qmCodecs.value(v);\n\t\t\tif (cc) \n\t\t\t\tqsl << cc->version();\n\t\t\telse\n\t\t\t\tqsl << QString::number(v, 16);\n\t\t}\n\t\tqlCELT->setText(qsl.join(tr(\", \")));\n\t}\n\tif (showcon)\n\t\tqgbConnection->setVisible(true);\n\t\t\n\tqlTCPCount->setText(QString::number(msg.tcp_packets()));\n\tqlTCPAvg->setText(QString::number(msg.tcp_ping_avg(), 'f', 2));\n\tqlTCPVar->setText(QString::number(msg.tcp_ping_var(), 'f', 2));\n\n\tqlUDPCount->setText(QString::number(msg.udp_packets()));\n\tqlUDPAvg->setText(QString::number(msg.udp_ping_avg(), 'f', 2));\n\tqlUDPVar->setText(QString::number(msg.udp_ping_var(), 'f', 2));\n\t\n\tif (msg.has_from_client() && msg.has_from_server()) {\n\t\tqgbUDP->setVisible(true);\n\t\tconst MumbleProto::UserStats_Stats &from = msg.from_client();\n\t\tqlFromGood->setText(QString::number(from.good()));\n\t\tqlFromLate->setText(QString::number(from.late()));\n\t\tqlFromLost->setText(QString::number(from.lost()));\n\t\tqlFromResync->setText(QString::number(from.resync()));\n\n\t\tconst MumbleProto::UserStats_Stats &to = msg.from_server();\n\t\tqlToGood->setText(QString::number(to.good()));\n\t\tqlToLate->setText(QString::number(to.late()));\n\t\tqlToLost->setText(QString::number(to.lost()));\n\t\tqlToResync->setText(QString::number(to.resync()));\n\t} else {\n\t\tqgbUDP->setVisible(false);\n\t}\n\t\n\tif (msg.has_onlinesecs()) {\n\t\tif (msg.has_idlesecs())\n\t\t\tqlTime->setText(tr(\"%1 online (%2 idle)\").arg(secsToString(msg.onlinesecs()), secsToString(msg.idlesecs())));\n\t\telse\n\t\t\tqlTime->setText(tr(\"%1 online\").arg(secsToString(msg.onlinesecs())));\n\t} \n\tif (msg.has_bandwidth()) {\n\t\tqlBandwidth->setVisible(true);\n\t\tqliBandwidth->setVisible(true);\n\t\tqlBandwidth->setText(tr(\"%1 kbit\/s\").arg(msg.bandwidth() \/ 125.0f, 0, 'f', 1));\n\t} else {\n\t\tqlBandwidth->setVisible(false);\n\t\tqliBandwidth->setVisible(false);\n\t\tqlBandwidth->setText(QString());\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * fbautostart.cpp\n * \n * This file is part of the Fluxbox Autostart ( fbautostart )\n * Utility.\n *\n * Copyright(c) 2010 Paul Tagliamonte <paultag@ubuntu.com>\n *\n * This file may be licensed under the terms of of the\n * GNU General Public License Version 3 (the ``GPL'').\n *\n * Software distributed under the License is distributed\n * on an ``AS IS'' basis, WITHOUT WARRANTY OF ANY KIND, either\n * express or implied. See the GPL for the specific language\n * governing rights and limitations.\n *\n * You should have received a copy of the GPL along with this\n * program. If not, go to http:\/\/www.gnu.org\/licenses\/gpl.html\n * or write to the Free Software Foundation, Inc.,\n * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n *\n *\/\n\n#include <iostream>\n#include <vector>\n#include <string>\n\n#include <fbautostart.h>\n#include \"dot_desktop.cpp\"\n\nusing namespace std;\n\nvoid runApplication( std::string appl ) {\n\n\tstd::cout << \"Doing: \" << appl << \" \" << std::endl;\n\n\tpid_t pID = fork();\n\tif (pID == 0) {\n\t\tsystem( appl.c_str() );\n\t\texit(1);\n\t} else if (pID < 0) {\n\t\tlogError( \"\" );\n\t\tlogError( \"Failed to fork \" );\n\t\tlogError( appl );\n\t\texit(1);\n\t} else {\n\t\tdebug(\"Whoh! I'm living!\");\n\t\treturn;\n\t}\n}\n\nint main ( int argc, char ** argv ) {\n\tstd::cout << \"Launching on behalf of \" << _ON_BEHALF_OF << std::endl;\n\tstd::vector<dot_desktop *> * files = loadDesktopFiles(getConfFiles(getConfDirs())); \/\/ XXX: This kinda sucks. Fix me if you have freetime.\n\tfor ( unsigned int i = 0; i < files->size(); ++i ) {\n\t\tfiles->at(i)->load();  \/\/ I'm doing this so you can load on-demand\n\t\t\/\/                        if you need to. I might change that later. ( Load, fork, load, fork )\n\t}\n\tfor ( unsigned int i = 0; i < files->size(); ++i ) {\n\t\tdot_desktop * d = files->at(i);\n\t\tbool happy = true;\n\t\t\/\/ do only \/ not checks.\n\t\tstd::string only = d->getAttr(\"OnlyShowIn\");\n\t\tstd::string noti = d->getAttr(\"NotShowIn\");\n\t\tif ( only != \"\" ) {\n\t\t\tint index = -1;\n\t\t\tindex = only.find(_ON_BEHALF_OF);\n\t\t\tif ( index < 0 ) {\n\t\t\t\thappy = false;\n\t\t\t\tdebug(\"\");\n\t\t\t\tdebug(\"Not running the following app ( Excluded by a OnlyShowIn )\");\n\t\t\t\tdebug(d->getAttr(\"Name\"));\n\t\t\t}\n\t\t}\n\t\tif ( noti != \"\" ) { \/\/ NAUGHTY NAUGHTY\n\t\t\tint index = -1;\n\t\t\tindex = noti.find(_ON_BEHALF_OF);\n\t\t\tif ( index < 0 ) {\n\t\t\t\thappy = true;\n\t\t\t\tdebug(\"\");\n\t\t\t\tdebug(\"Forced into running the following app ( Included by not being in NotShowIn )\");\n\t\t\t\tdebug(d->getAttr(\"Name\"));\n\t\t\t}\n\t\t}\n\t\tif ( d->getAttr(\"Hidden\") == \"\" && happy ) {\n\t\t\tstd::string appl = d->getAttr(\"Exec\");\n\t\t\tif ( appl != \"\" ) {\n\t\t\t\trunApplication( appl );\n\t\t\t}\n\t\t} \/\/ otherwise, we're out of here.\n\t}\n\treturn 0;\n}\n\n<commit_msg>pushing in some usage stuff<commit_after>\/*\n * fbautostart.cpp\n * \n * This file is part of the Fluxbox Autostart ( fbautostart )\n * Utility.\n *\n * Copyright(c) 2010 Paul Tagliamonte <paultag@ubuntu.com>\n *\n * This file may be licensed under the terms of of the\n * GNU General Public License Version 3 (the ``GPL'').\n *\n * Software distributed under the License is distributed\n * on an ``AS IS'' basis, WITHOUT WARRANTY OF ANY KIND, either\n * express or implied. See the GPL for the specific language\n * governing rights and limitations.\n *\n * You should have received a copy of the GPL along with this\n * program. If not, go to http:\/\/www.gnu.org\/licenses\/gpl.html\n * or write to the Free Software Foundation, Inc.,\n * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n *\n *\/\n\n#include <iostream>\n#include <vector>\n#include <string>\n\n#include <fbautostart.h>\n#include \"dot_desktop.cpp\"\n\n#define _APPNAME_ \"fbautostart\"\n#define _VERSION_ \"2.7\"\n\nusing namespace std;\n\nbool noexec = false;\n\nvoid lecture() {\n\tstd::cout << \"\" << _APPNAME_ << \" \" << _VERSION_ << std::endl;\n\tstd::cout << \"Copyright (C) 2010 Paul Tagliamonte\" << std::endl;\n\tstd::cout << \"License GPLv3+: GNU GPL version 3 or later <http:\/\/gnu.org\/licenses\/gpl.html>\" << std::endl;\n\tstd::cout << \"This is free software: you are free to change and redistribute it.\" << std::endl;\n\tstd::cout << \"There is NO WARRANTY, to the extent permitted by law.\" << std::endl;\n}\n\nvoid help() {\n\tstd::cout << \"Usage: fbautostart [OPTION] ... \" << std::endl;\n\tstd::cout << \"Startup all applications according to the\" << std::endl;\n\tstd::cout << \"XDG Spec. \" << std::endl;\n\tstd::cout << std::endl;\n\tstd::cout << \"--license           Print out license information\" << std::endl;\n\tstd::cout << \"--help              Print out this message\" << std::endl;\n\tstd::cout << \"--noexec            Don't exec, just do a dry run\" << std::endl;\n\tstd::cout << \"\" << std::endl;\n\n\tstd::cout << \"Copyleft (c) Paul Tagliamonte, 2010, GNU GPLv3\" << std::endl;\n\tstd::cout << \"\" << std::endl;\n}\n\nvoid runApplication( std::string appl ) {\n\tstd::cout << \"Doing: \" << appl << \" \" << std::endl;\n\tpid_t pID = fork();\n\n\tif (pID == 0) {\n\t\tif ( ! noexec ) {\n\t\t\tsystem( appl.c_str() );\n\t\t} else {\n\t\t\tstd::cout << \"Would have run: \" << appl << std::endl;\n\t\t}\n\t\texit(1);\n\t} else if (pID < 0) {\n\t\tlogError( \"\" );\n\t\tlogError( \"Failed to fork \" );\n\t\tlogError( appl );\n\t\texit(1);\n\t}\n\n\treturn;\n}\n\nvoid processArgs( int argc, char ** args ) {\n\tfor ( int i = 0; i < argc; ++i ) {\n\t\tif ( strcmp(args[i], \"--license\") == 0 ) {\n\t\t\tlecture();\n\t\t\texit(0);\n\t\t}\n\n\t\tif ( strcmp(args[i], \"--help\") == 0 ) {\n\t\t\thelp();\n\t\t\texit(0);\n\t\t}\n\n\t\tif ( strcmp(args[i], \"--noexec\") == 0 )\n\t\t\tnoexec = true;\n\t}\n}\n\nint main ( int argc, char ** argv ) {\n\tprocessArgs( argc, argv );\n\n\tif ( noexec ) {\n\t\tstd::cout << \"Warning: In noexec mode.\" << std::endl;\n\t}\n\n\tstd::cout << \"Launching on behalf of \" << _ON_BEHALF_OF << std::endl;\n\tstd::vector<dot_desktop *> * files = loadDesktopFiles(getConfFiles(getConfDirs())); \/\/ XXX: This kinda sucks. Fix me if you have freetime.\n\tfor ( unsigned int i = 0; i < files->size(); ++i ) {\n\t\tfiles->at(i)->load();  \/\/ I'm doing this so you can load on-demand\n\t\t\/\/                        if you need to. I might change that later. ( Load, fork, load, fork )\n\t}\n\tfor ( unsigned int i = 0; i < files->size(); ++i ) {\n\t\tdot_desktop * d = files->at(i);\n\t\tbool happy = true;\n\t\t\/\/ do only \/ not checks.\n\t\tstd::string only = d->getAttr(\"OnlyShowIn\");\n\t\tstd::string noti = d->getAttr(\"NotShowIn\");\n\t\tif ( only != \"\" ) {\n\t\t\tint index = -1;\n\t\t\tindex = only.find(_ON_BEHALF_OF);\n\t\t\tif ( index < 0 ) { \/\/ we're disabled\n\t\t\t\thappy = false;\n\t\t\t\tdebug(\"\");\n\t\t\t\tdebug(\"Not running the following app ( Excluded by a OnlyShowIn )\");\n\t\t\t\tdebug(d->getAttr(\"Name\"));\n\t\t\t} \/\/ we're not disabled ( therefore enabled )\n\t\t}\n\t\tif ( noti != \"\" ) { \/\/ NAUGHTY NAUGHTY\n\t\t\tint index = -1;\n\t\t\tindex = noti.find(_ON_BEHALF_OF);\n\t\t\tif ( index < 0 ) { \/\/ we're in 'dis\n\t\t\t\thappy = true;\n\t\t\t\tdebug(\"\");\n\t\t\t\tdebug(\"Forced into running the following app ( Included by not being in NotShowIn )\");\n\t\t\t\tdebug(d->getAttr(\"Name\"));\n\t\t\t} \/\/ we're not enabled ( therefore disabled )\n\t\t}\n\t\tif ( d->getAttr(\"Hidden\") == \"\" && happy ) { \/\/ LET'S DO THIS\n\t\t\tstd::string appl = d->getAttr(\"Exec\");\n\t\t\tif ( appl != \"\" ) {\n\t\t\t\trunApplication( appl );\n\t\t\t}\n\t\t} \/\/ otherwise, we're out of here.\n\t}\n\treturn 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/chips\/ocmb\/explorer\/procedures\/hwp\/memory\/exp_scominit.C $ *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2018,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<commit_msg>Adds initfile for Explorer<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/chips\/ocmb\/explorer\/procedures\/hwp\/memory\/exp_scominit.C $ *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2018,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 exp_scominit.C\n\/\/\/ @brief Contains explorer scominits\n\/\/\/\n\/\/ *HWP HWP Owner: Andre Marin <aamarin@us.ibm.com>\n\/\/ *HWP HWP Backup: Stephen Glancy <sglancy@us.ibm.com>\n\/\/ *HWP Team: Memory\n\/\/ *HWP Level: 3\n\/\/ *HWP Consumed by: Memory\n\n#include <fapi2.H>\n#include <generic\/memory\/lib\/utils\/c_str.H>\n#include <generic\/memory\/lib\/utils\/count_dimm.H>\n#include <generic\/memory\/lib\/utils\/find.H>\n#include <explorer_scom.H>\n\nextern \"C\"\n{\n\n    \/\/\/\n    \/\/\/ @brief Scominit for Explorer\n    \/\/\/ @param[in] i_target the OCMB target to operate on\n    \/\/\/ @return FAPI2_RC_SUCCESS iff ok\n    \/\/\/\n    fapi2::ReturnCode exp_scominit( const fapi2::Target<fapi2::TARGET_TYPE_OCMB_CHIP>& i_target)\n    {\n        if (mss::count_dimm(i_target) == 0)\n        {\n            FAPI_INF(\"... skipping mss_scominit %s - no DIMM ...\", mss::c_str(i_target));\n            return fapi2::FAPI2_RC_SUCCESS;\n        }\n\n        \/\/ We need to make sure we hit all ports\n        const auto& l_port_targets = mss::find_targets<fapi2::TARGET_TYPE_MEM_PORT>(i_target);\n\n        fapi2::Target<fapi2::TARGET_TYPE_SYSTEM> FAPI_SYSTEM;\n        const auto& l_mc = i_target.getParent<fapi2::TARGET_TYPE_OMI>()\n                           .getParent<fapi2::TARGET_TYPE_MCC>()\n                           .getParent<fapi2::TARGET_TYPE_MI>()\n                           .getParent<fapi2::TARGET_TYPE_MC>();\n\n        for(const auto& l_port : l_port_targets)\n        {\n            fapi2::ReturnCode l_rc;\n            FAPI_INF(\"phy scominit for %s\", mss::c_str(l_port));\n            FAPI_EXEC_HWP(l_rc, explorer_scom, i_target, l_port, FAPI_SYSTEM, l_mc);\n\n            FAPI_TRY(l_rc, \"Error from explorer.scom.initfile %s\", mss::c_str(l_port));\n        }\n\n        return fapi2::FAPI2_RC_SUCCESS;\n\n    fapi_try_exit:\n        FAPI_INF(\"End MSS SCOM init\");\n        return fapi2::current_err;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: VCollection.hxx,v $\n *\n *  $Revision: 1.21 $\n *\n *  last change: $Author: vg $ $Date: 2005-03-10 15: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\n#ifndef _CONNECTIVITY_SDBCX_COLLECTION_HXX_\n#define _CONNECTIVITY_SDBCX_COLLECTION_HXX_\n\n#ifndef _CPPUHELPER_IMPLBASE10_HXX_\n#include <cppuhelper\/implbase10.hxx>\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_XINDEXACCESS_HPP_\n#include <com\/sun\/star\/container\/XIndexAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XENUMERATIONACCESS_HPP_\n#include <com\/sun\/star\/container\/XEnumerationAccess.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_BEANS_XPROPERTYSET_HPP_\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UTIL_XREFRESHABLE_HPP_\n#include <com\/sun\/star\/util\/XRefreshable.hpp>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XCOMPONENT_HPP_\n#include <com\/sun\/star\/lang\/XComponent.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBCX_XDATADESCRIPTORFACTORY_HPP_\n#include <com\/sun\/star\/sdbcx\/XDataDescriptorFactory.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBCX_XAPPEND_HPP_\n#include <com\/sun\/star\/sdbcx\/XAppend.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBCX_XDROP_HPP_\n#include <com\/sun\/star\/sdbcx\/XDrop.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XCOLUMNLOCATE_HPP_\n#include <com\/sun\/star\/sdbc\/XColumnLocate.hpp>\n#endif\n#ifndef _COMPHELPER_STLTYPES_HXX_\n#include <comphelper\/stl_types.hxx>\n#endif\n#ifndef _CPPUHELPER_INTERFACECONTAINER_H_\n#include <cppuhelper\/interfacecontainer.h>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XSERVICEINFO_HPP_\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#endif\n#ifndef _CONNECTIVITY_COMMONTOOLS_HXX_\n#include \"connectivity\/CommonTools.hxx\"\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XCONTAINER_HPP_\n#include <com\/sun\/star\/container\/XContainer.hpp>\n#endif\n#ifndef CONNECTIVITY_STDTYPEDEFS_HXX\n#include \"connectivity\/StdTypeDefs.hxx\"\n#endif\n#include <memory>\n\n\nnamespace connectivity\n{\n    namespace sdbcx\n    {\n\n        \/\/ the class OCollection is base class for collections :-)\n        typedef ::cppu::ImplHelper10< ::com::sun::star::container::XNameAccess,\n                                         ::com::sun::star::container::XIndexAccess,\n                                         ::com::sun::star::container::XEnumerationAccess,\n                                         ::com::sun::star::container::XContainer,\n                                         ::com::sun::star::sdbc::XColumnLocate,\n                                         ::com::sun::star::util::XRefreshable,\n                                         ::com::sun::star::sdbcx::XDataDescriptorFactory,\n                                         ::com::sun::star::sdbcx::XAppend,\n                                         ::com::sun::star::sdbcx::XDrop,\n                                         ::com::sun::star::lang::XServiceInfo> OCollectionBase;\n\n        typedef ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet > ObjectType;\n\n        class SAL_NO_VTABLE IObjectCollection\n        {\n        public:\n            virtual void reserve(size_t nLength) = 0;\n            virtual bool exists(const ::rtl::OUString& _sName ) = 0;\n            virtual bool empty() = 0;\n            virtual void swapAll() = 0;\n            virtual void swap() = 0;\n            virtual void clear() = 0;\n            virtual void reFill(const TStringVector &_rVector) = 0;\n            virtual void insert(const ::rtl::OUString& _sName,const ObjectType& _xObject) = 0;\n            virtual bool rename(const ::rtl::OUString _sOldName,const ::rtl::OUString _sNewName) = 0;\n            virtual sal_Int32 size() = 0;\n            virtual ::com::sun::star::uno::Sequence< ::rtl::OUString > getElementNames() = 0;\n            virtual ::rtl::OUString getName(sal_Int32 _nIndex) = 0;\n            virtual void disposeAndErase(sal_Int32 _nIndex) = 0;\n            virtual void disposeElements() = 0;\n            virtual sal_Int32 findColumn( const ::rtl::OUString& columnName ) = 0;\n            virtual ::rtl::OUString findColumnAtIndex(  sal_Int32 _nIndex) = 0;\n            virtual ObjectType getObject(sal_Int32 _nIndex) = 0;\n            virtual ObjectType getObject(const ::rtl::OUString& columnName) = 0;\n            virtual void setObject(sal_Int32 _nIndex,const ObjectType& _xObject) = 0;\n            virtual sal_Bool isCaseSensitive() const = 0;\n        };\n        \/\/************************************************************\n        \/\/  OCollection\n        \/\/************************************************************\n        class SAL_NO_VTABLE OCollection : public OCollectionBase\n        {\n        protected:\n            ::std::auto_ptr<IObjectCollection>      m_pElements;\n\n            ::cppu::OInterfaceContainerHelper       m_aContainerListeners;\n            ::cppu::OInterfaceContainerHelper       m_aRefreshListeners;\n\n        protected:\n            ::cppu::OWeakObject&                    m_rParent;          \/\/ parent of the collection\n            ::osl::Mutex&                           m_rMutex;           \/\/ mutex of the parent\n            sal_Bool                                m_bUseIndexOnly;    \/\/ is only TRUE when only an indexaccess is needed\n\n            \/\/ the implementing class should refresh their elements\n            virtual void impl_refresh() throw(::com::sun::star::uno::RuntimeException) = 0;\n\n            \/\/ will be called when a object was requested by one of the accessing methods like getByIndex\n            virtual ObjectType createObject(const ::rtl::OUString& _rName) = 0;\n\n            \/\/ will be called when a new object should be generated by a call of createDataDescriptor\n            \/\/ the returned object is empty will be filled outside and added to the collection\n            virtual ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet > createEmptyObject();\n\n            \/\/ return an object which is the copy of the argument\n            virtual ObjectType cloneObject(const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& _xDescriptor);\n\n            virtual void appendObject( const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& descriptor );\n            \/\/ called when XDrop was called\n            virtual void dropObject(sal_Int32 _nPos,const ::rtl::OUString _sElementName);\n\n            \/** returns the name for the object. The default implementation ask for the property NAME. If this doesn't satisfy, it has to be overloaded.\n                @param  _xObject    The object where the name should be extracted.\n                @return The name of the object.\n            *\/\n            virtual ::rtl::OUString getNameForObject(const ObjectType& _xObject);\n\n            OCollection(::cppu::OWeakObject& _rParent,\n                        sal_Bool _bCase,\n                        ::osl::Mutex& _rMutex,\n                        const TStringVector &_rVector,\n                        sal_Bool _bUseIndexOnly = sal_False,\n                        sal_Bool _bUseHardRef = sal_True);\n\n            \/** clear the name map\n                <p>Does <em>not<\/em> dispose the objects hold by the collection.<\/p>\n            *\/\n            void clear_NoDispose();\n\n            \/**  insert a new element into the collection\n            *\/\n            void insertElement(const ::rtl::OUString& _sElementName,const ObjectType& _xElement);\n\n            \/** return the name of element at index _nIndex\n            *\/\n            inline ::rtl::OUString getElementName(sal_Int32 _nIndex)\n            {\n                return m_pElements->findColumnAtIndex(_nIndex);\n            }\n\n\n            \/** return the object, if not existent it creates it.\n                @param  _nIndex\n                    The index of the object to create.\n                @return ObjectType\n            *\/\n            ObjectType getObject(sal_Int32 _nIndex);\n\n        public:\n            virtual ~OCollection();\n            DECLARE_SERVICE_INFO();\n\n            void reFill(const TStringVector &_rVector);\n            inline sal_Bool isCaseSensitive() const { return m_pElements->isCaseSensitive(); }\n            void renameObject(const ::rtl::OUString _sOldName,const ::rtl::OUString _sNewName);\n\n            \/\/ only the name is identical to ::cppu::OComponentHelper\n            virtual void SAL_CALL disposing(void);\n            \/\/ dispatch the refcounting to the parent\n            virtual void SAL_CALL acquire() throw();\n            virtual void SAL_CALL release() throw();\n\n            \/\/ XInterface\n            virtual ::com::sun::star::uno::Any SAL_CALL queryInterface( const ::com::sun::star::uno::Type & rType ) throw (::com::sun::star::uno::RuntimeException);\n            virtual ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > SAL_CALL getTypes() 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            \/\/ ::com::sun::star::container::XIndexAccess\n            virtual sal_Int32 SAL_CALL getCount(  ) throw(::com::sun::star::uno::RuntimeException);\n            virtual ::com::sun::star::uno::Any SAL_CALL getByIndex( sal_Int32 Index ) throw(::com::sun::star::lang::IndexOutOfBoundsException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n\n                \/\/ ::com::sun::star::container::XNameAccess\n            virtual ::com::sun::star::uno::Any SAL_CALL getByName( const ::rtl::OUString& aName ) throw(::com::sun::star::container::NoSuchElementException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n            virtual ::com::sun::star::uno::Sequence< ::rtl::OUString > SAL_CALL getElementNames(  ) throw(::com::sun::star::uno::RuntimeException);\n            virtual sal_Bool SAL_CALL hasByName( const ::rtl::OUString& aName ) throw(::com::sun::star::uno::RuntimeException);\n            \/\/ XEnumerationAccess\n            virtual ::com::sun::star::uno::Reference< ::com::sun::star::container::XEnumeration > SAL_CALL createEnumeration(  ) throw(::com::sun::star::uno::RuntimeException);\n                        \/\/ ::com::sun::star::util::XRefreshable\n            virtual void SAL_CALL refresh(  ) throw(::com::sun::star::uno::RuntimeException);\n            virtual void SAL_CALL addRefreshListener( const ::com::sun::star::uno::Reference< ::com::sun::star::util::XRefreshListener >& l ) throw(::com::sun::star::uno::RuntimeException);\n            virtual void SAL_CALL removeRefreshListener( const ::com::sun::star::uno::Reference< ::com::sun::star::util::XRefreshListener >& l ) throw(::com::sun::star::uno::RuntimeException);\n            \/\/ XDataDescriptorFactory\n            virtual ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet > SAL_CALL createDataDescriptor(  ) throw(::com::sun::star::uno::RuntimeException);\n            \/\/ XAppend\n            virtual void SAL_CALL appendByDescriptor( const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& descriptor ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::container::ElementExistException, ::com::sun::star::uno::RuntimeException);\n            \/\/ XDrop\n            virtual void SAL_CALL dropByName( const ::rtl::OUString& elementName ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::container::NoSuchElementException, ::com::sun::star::uno::RuntimeException);\n            virtual void SAL_CALL dropByIndex( sal_Int32 index ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::lang::IndexOutOfBoundsException, ::com::sun::star::uno::RuntimeException);\n            \/\/ XColumnLocate\n            virtual sal_Int32 SAL_CALL findColumn( const ::rtl::OUString& columnName ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n            \/\/ ::com::sun::star::container::XContainer\n            virtual void SAL_CALL addContainerListener( const ::com::sun::star::uno::Reference< ::com::sun::star::container::XContainerListener >& xListener ) throw(::com::sun::star::uno::RuntimeException);\n            virtual void SAL_CALL removeContainerListener( const ::com::sun::star::uno::Reference< ::com::sun::star::container::XContainerListener >& xListener ) throw(::com::sun::star::uno::RuntimeException);\n        private:\n            void notifyElementRemoved(const ::rtl::OUString& _sName);\n            void disposeElements();\n            void dropImpl(sal_Int32 _nIndex,sal_Bool _bReallyDrop = sal_True);\n        };\n    }\n}\n#endif \/\/ _CONNECTIVITY_SDBCX_COLLECTION_HXX_\n\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.21.74); FILE MERGED 2005\/09\/05 17:22:41 rt 1.21.74.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: VCollection.hxx,v $\n *\n *  $Revision: 1.22 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 05:03: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_SDBCX_COLLECTION_HXX_\n#define _CONNECTIVITY_SDBCX_COLLECTION_HXX_\n\n#ifndef _CPPUHELPER_IMPLBASE10_HXX_\n#include <cppuhelper\/implbase10.hxx>\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_XINDEXACCESS_HPP_\n#include <com\/sun\/star\/container\/XIndexAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XENUMERATIONACCESS_HPP_\n#include <com\/sun\/star\/container\/XEnumerationAccess.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_BEANS_XPROPERTYSET_HPP_\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UTIL_XREFRESHABLE_HPP_\n#include <com\/sun\/star\/util\/XRefreshable.hpp>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XCOMPONENT_HPP_\n#include <com\/sun\/star\/lang\/XComponent.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBCX_XDATADESCRIPTORFACTORY_HPP_\n#include <com\/sun\/star\/sdbcx\/XDataDescriptorFactory.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBCX_XAPPEND_HPP_\n#include <com\/sun\/star\/sdbcx\/XAppend.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBCX_XDROP_HPP_\n#include <com\/sun\/star\/sdbcx\/XDrop.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XCOLUMNLOCATE_HPP_\n#include <com\/sun\/star\/sdbc\/XColumnLocate.hpp>\n#endif\n#ifndef _COMPHELPER_STLTYPES_HXX_\n#include <comphelper\/stl_types.hxx>\n#endif\n#ifndef _CPPUHELPER_INTERFACECONTAINER_H_\n#include <cppuhelper\/interfacecontainer.h>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XSERVICEINFO_HPP_\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#endif\n#ifndef _CONNECTIVITY_COMMONTOOLS_HXX_\n#include \"connectivity\/CommonTools.hxx\"\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XCONTAINER_HPP_\n#include <com\/sun\/star\/container\/XContainer.hpp>\n#endif\n#ifndef CONNECTIVITY_STDTYPEDEFS_HXX\n#include \"connectivity\/StdTypeDefs.hxx\"\n#endif\n#include <memory>\n\n\nnamespace connectivity\n{\n    namespace sdbcx\n    {\n\n        \/\/ the class OCollection is base class for collections :-)\n        typedef ::cppu::ImplHelper10< ::com::sun::star::container::XNameAccess,\n                                         ::com::sun::star::container::XIndexAccess,\n                                         ::com::sun::star::container::XEnumerationAccess,\n                                         ::com::sun::star::container::XContainer,\n                                         ::com::sun::star::sdbc::XColumnLocate,\n                                         ::com::sun::star::util::XRefreshable,\n                                         ::com::sun::star::sdbcx::XDataDescriptorFactory,\n                                         ::com::sun::star::sdbcx::XAppend,\n                                         ::com::sun::star::sdbcx::XDrop,\n                                         ::com::sun::star::lang::XServiceInfo> OCollectionBase;\n\n        typedef ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet > ObjectType;\n\n        class SAL_NO_VTABLE IObjectCollection\n        {\n        public:\n            virtual void reserve(size_t nLength) = 0;\n            virtual bool exists(const ::rtl::OUString& _sName ) = 0;\n            virtual bool empty() = 0;\n            virtual void swapAll() = 0;\n            virtual void swap() = 0;\n            virtual void clear() = 0;\n            virtual void reFill(const TStringVector &_rVector) = 0;\n            virtual void insert(const ::rtl::OUString& _sName,const ObjectType& _xObject) = 0;\n            virtual bool rename(const ::rtl::OUString _sOldName,const ::rtl::OUString _sNewName) = 0;\n            virtual sal_Int32 size() = 0;\n            virtual ::com::sun::star::uno::Sequence< ::rtl::OUString > getElementNames() = 0;\n            virtual ::rtl::OUString getName(sal_Int32 _nIndex) = 0;\n            virtual void disposeAndErase(sal_Int32 _nIndex) = 0;\n            virtual void disposeElements() = 0;\n            virtual sal_Int32 findColumn( const ::rtl::OUString& columnName ) = 0;\n            virtual ::rtl::OUString findColumnAtIndex(  sal_Int32 _nIndex) = 0;\n            virtual ObjectType getObject(sal_Int32 _nIndex) = 0;\n            virtual ObjectType getObject(const ::rtl::OUString& columnName) = 0;\n            virtual void setObject(sal_Int32 _nIndex,const ObjectType& _xObject) = 0;\n            virtual sal_Bool isCaseSensitive() const = 0;\n        };\n        \/\/************************************************************\n        \/\/  OCollection\n        \/\/************************************************************\n        class SAL_NO_VTABLE OCollection : public OCollectionBase\n        {\n        protected:\n            ::std::auto_ptr<IObjectCollection>      m_pElements;\n\n            ::cppu::OInterfaceContainerHelper       m_aContainerListeners;\n            ::cppu::OInterfaceContainerHelper       m_aRefreshListeners;\n\n        protected:\n            ::cppu::OWeakObject&                    m_rParent;          \/\/ parent of the collection\n            ::osl::Mutex&                           m_rMutex;           \/\/ mutex of the parent\n            sal_Bool                                m_bUseIndexOnly;    \/\/ is only TRUE when only an indexaccess is needed\n\n            \/\/ the implementing class should refresh their elements\n            virtual void impl_refresh() throw(::com::sun::star::uno::RuntimeException) = 0;\n\n            \/\/ will be called when a object was requested by one of the accessing methods like getByIndex\n            virtual ObjectType createObject(const ::rtl::OUString& _rName) = 0;\n\n            \/\/ will be called when a new object should be generated by a call of createDataDescriptor\n            \/\/ the returned object is empty will be filled outside and added to the collection\n            virtual ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet > createEmptyObject();\n\n            \/\/ return an object which is the copy of the argument\n            virtual ObjectType cloneObject(const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& _xDescriptor);\n\n            virtual void appendObject( const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& descriptor );\n            \/\/ called when XDrop was called\n            virtual void dropObject(sal_Int32 _nPos,const ::rtl::OUString _sElementName);\n\n            \/** returns the name for the object. The default implementation ask for the property NAME. If this doesn't satisfy, it has to be overloaded.\n                @param  _xObject    The object where the name should be extracted.\n                @return The name of the object.\n            *\/\n            virtual ::rtl::OUString getNameForObject(const ObjectType& _xObject);\n\n            OCollection(::cppu::OWeakObject& _rParent,\n                        sal_Bool _bCase,\n                        ::osl::Mutex& _rMutex,\n                        const TStringVector &_rVector,\n                        sal_Bool _bUseIndexOnly = sal_False,\n                        sal_Bool _bUseHardRef = sal_True);\n\n            \/** clear the name map\n                <p>Does <em>not<\/em> dispose the objects hold by the collection.<\/p>\n            *\/\n            void clear_NoDispose();\n\n            \/**  insert a new element into the collection\n            *\/\n            void insertElement(const ::rtl::OUString& _sElementName,const ObjectType& _xElement);\n\n            \/** return the name of element at index _nIndex\n            *\/\n            inline ::rtl::OUString getElementName(sal_Int32 _nIndex)\n            {\n                return m_pElements->findColumnAtIndex(_nIndex);\n            }\n\n\n            \/** return the object, if not existent it creates it.\n                @param  _nIndex\n                    The index of the object to create.\n                @return ObjectType\n            *\/\n            ObjectType getObject(sal_Int32 _nIndex);\n\n        public:\n            virtual ~OCollection();\n            DECLARE_SERVICE_INFO();\n\n            void reFill(const TStringVector &_rVector);\n            inline sal_Bool isCaseSensitive() const { return m_pElements->isCaseSensitive(); }\n            void renameObject(const ::rtl::OUString _sOldName,const ::rtl::OUString _sNewName);\n\n            \/\/ only the name is identical to ::cppu::OComponentHelper\n            virtual void SAL_CALL disposing(void);\n            \/\/ dispatch the refcounting to the parent\n            virtual void SAL_CALL acquire() throw();\n            virtual void SAL_CALL release() throw();\n\n            \/\/ XInterface\n            virtual ::com::sun::star::uno::Any SAL_CALL queryInterface( const ::com::sun::star::uno::Type & rType ) throw (::com::sun::star::uno::RuntimeException);\n            virtual ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > SAL_CALL getTypes() 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            \/\/ ::com::sun::star::container::XIndexAccess\n            virtual sal_Int32 SAL_CALL getCount(  ) throw(::com::sun::star::uno::RuntimeException);\n            virtual ::com::sun::star::uno::Any SAL_CALL getByIndex( sal_Int32 Index ) throw(::com::sun::star::lang::IndexOutOfBoundsException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n\n                \/\/ ::com::sun::star::container::XNameAccess\n            virtual ::com::sun::star::uno::Any SAL_CALL getByName( const ::rtl::OUString& aName ) throw(::com::sun::star::container::NoSuchElementException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n            virtual ::com::sun::star::uno::Sequence< ::rtl::OUString > SAL_CALL getElementNames(  ) throw(::com::sun::star::uno::RuntimeException);\n            virtual sal_Bool SAL_CALL hasByName( const ::rtl::OUString& aName ) throw(::com::sun::star::uno::RuntimeException);\n            \/\/ XEnumerationAccess\n            virtual ::com::sun::star::uno::Reference< ::com::sun::star::container::XEnumeration > SAL_CALL createEnumeration(  ) throw(::com::sun::star::uno::RuntimeException);\n                        \/\/ ::com::sun::star::util::XRefreshable\n            virtual void SAL_CALL refresh(  ) throw(::com::sun::star::uno::RuntimeException);\n            virtual void SAL_CALL addRefreshListener( const ::com::sun::star::uno::Reference< ::com::sun::star::util::XRefreshListener >& l ) throw(::com::sun::star::uno::RuntimeException);\n            virtual void SAL_CALL removeRefreshListener( const ::com::sun::star::uno::Reference< ::com::sun::star::util::XRefreshListener >& l ) throw(::com::sun::star::uno::RuntimeException);\n            \/\/ XDataDescriptorFactory\n            virtual ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet > SAL_CALL createDataDescriptor(  ) throw(::com::sun::star::uno::RuntimeException);\n            \/\/ XAppend\n            virtual void SAL_CALL appendByDescriptor( const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& descriptor ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::container::ElementExistException, ::com::sun::star::uno::RuntimeException);\n            \/\/ XDrop\n            virtual void SAL_CALL dropByName( const ::rtl::OUString& elementName ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::container::NoSuchElementException, ::com::sun::star::uno::RuntimeException);\n            virtual void SAL_CALL dropByIndex( sal_Int32 index ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::lang::IndexOutOfBoundsException, ::com::sun::star::uno::RuntimeException);\n            \/\/ XColumnLocate\n            virtual sal_Int32 SAL_CALL findColumn( const ::rtl::OUString& columnName ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n            \/\/ ::com::sun::star::container::XContainer\n            virtual void SAL_CALL addContainerListener( const ::com::sun::star::uno::Reference< ::com::sun::star::container::XContainerListener >& xListener ) throw(::com::sun::star::uno::RuntimeException);\n            virtual void SAL_CALL removeContainerListener( const ::com::sun::star::uno::Reference< ::com::sun::star::container::XContainerListener >& xListener ) throw(::com::sun::star::uno::RuntimeException);\n        private:\n            void notifyElementRemoved(const ::rtl::OUString& _sName);\n            void disposeElements();\n            void dropImpl(sal_Int32 _nIndex,sal_Bool _bReallyDrop = sal_True);\n        };\n    }\n}\n#endif \/\/ _CONNECTIVITY_SDBCX_COLLECTION_HXX_\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\/\/ This class simulates what wininet does when a dns lookup fails.\n\n#include <algorithm>\n#include <cstring>\n\n#include \"base\/compiler_specific.h\"\n#include \"base\/string_util.h\"\n#include \"base\/task.h\"\n#include \"content\/browser\/net\/url_request_abort_on_end_job.h\"\n#include \"content\/public\/browser\/browser_thread.h\"\n#include \"net\/base\/io_buffer.h\"\n#include \"net\/base\/net_errors.h\"\n#include \"net\/http\/http_response_headers.h\"\n#include \"net\/url_request\/url_request_filter.h\"\n#include \"net\/url_request\/url_request_status.h\"\n\nnamespace {\nconst char kPageContent[] = \"some data\\r\\n\";\n}\n\nconst char URLRequestAbortOnEndJob::k400AbortOnEndUrl[] =\n    \"http:\/\/url.handled.by.abort.on.end\/400\";\n\n\/\/ static\nvoid URLRequestAbortOnEndJob::AddUrlHandler() {\n  net::URLRequestFilter* filter = net::URLRequestFilter::GetInstance();\n  filter->AddUrlHandler(GURL(k400AbortOnEndUrl),\n                        &URLRequestAbortOnEndJob::Factory);\n}\n\n\/\/ static\nnet::URLRequestJob* URLRequestAbortOnEndJob::Factory(\n    net::URLRequest* request,\n    const std::string& scheme) {\n  DCHECK(content::BrowserThread::CurrentlyOn(content::BrowserThread::IO));\n  return new URLRequestAbortOnEndJob(request);\n}\n\n\/\/ Private const version.\nvoid URLRequestAbortOnEndJob::GetResponseInfoConst(\n    net::HttpResponseInfo* info) const {\n  \/\/ Send back mock headers.\n  std::string raw_headers;\n  if (LowerCaseEqualsASCII(k400AbortOnEndUrl,\n                           request_->url().spec().c_str())) {\n    raw_headers.append(\n      \"HTTP\/1.1 400 This is not OK\\n\"\n      \"Content-type: text\/plain\\n\");\n  } else {\n    NOTREACHED();\n  }\n  \/\/ ParseRawHeaders expects \\0 to end each header line.\n  ReplaceSubstringsAfterOffset(&raw_headers, 0, \"\\n\", std::string(\"\\0\", 1));\n  info->headers = new net::HttpResponseHeaders(raw_headers);\n}\n\nURLRequestAbortOnEndJob::URLRequestAbortOnEndJob(net::URLRequest* request)\n    : URLRequestJob(request), sent_data_(false),\n      ALLOW_THIS_IN_INITIALIZER_LIST(weak_factory_(this)) {\n}\n\nURLRequestAbortOnEndJob::~URLRequestAbortOnEndJob() {\n}\n\nvoid URLRequestAbortOnEndJob::GetResponseInfo(net::HttpResponseInfo* info) {\n  GetResponseInfoConst(info);\n}\n\nbool URLRequestAbortOnEndJob::GetMimeType(std::string* mime_type) const {\n  net::HttpResponseInfo info;\n  GetResponseInfoConst(&info);\n  return info.headers && info.headers->GetMimeType(mime_type);\n}\n\nvoid URLRequestAbortOnEndJob::StartAsync() {\n  NotifyHeadersComplete();\n}\n\nvoid URLRequestAbortOnEndJob::Start() {\n  MessageLoop::current()->PostTask(\n      FROM_HERE,\n      base::Bind(&URLRequestAbortOnEndJob::StartAsync,\n                 weak_factory_.GetWeakPtr()));\n}\n\nbool URLRequestAbortOnEndJob::ReadRawData(net::IOBuffer* buf,\n                                          const int max_bytes,\n                                          int* bytes_read) {\n  if (!sent_data_) {\n    *bytes_read = std::max(size_t(max_bytes), sizeof(kPageContent));\n    std::memcpy(buf->data(), kPageContent, *bytes_read);\n    sent_data_ = true;\n    return true;\n  }\n\n  SetStatus(net::URLRequestStatus(net::URLRequestStatus::FAILED,\n                                  net::ERR_CONNECTION_ABORTED));\n  *bytes_read = -1;\n  return false;\n}\n\n\n<commit_msg>Fix URLRequestJobAbortOnEndJob::ReadRawData<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\/\/ This class simulates what wininet does when a dns lookup fails.\n\n#include <algorithm>\n#include <cstring>\n\n#include \"base\/compiler_specific.h\"\n#include \"base\/string_util.h\"\n#include \"base\/task.h\"\n#include \"content\/browser\/net\/url_request_abort_on_end_job.h\"\n#include \"content\/public\/browser\/browser_thread.h\"\n#include \"net\/base\/io_buffer.h\"\n#include \"net\/base\/net_errors.h\"\n#include \"net\/http\/http_response_headers.h\"\n#include \"net\/url_request\/url_request_filter.h\"\n#include \"net\/url_request\/url_request_status.h\"\n\nnamespace {\nconst char kPageContent[] = \"some data\\r\\n\";\n}\n\nconst char URLRequestAbortOnEndJob::k400AbortOnEndUrl[] =\n    \"http:\/\/url.handled.by.abort.on.end\/400\";\n\n\/\/ static\nvoid URLRequestAbortOnEndJob::AddUrlHandler() {\n  net::URLRequestFilter* filter = net::URLRequestFilter::GetInstance();\n  filter->AddUrlHandler(GURL(k400AbortOnEndUrl),\n                        &URLRequestAbortOnEndJob::Factory);\n}\n\n\/\/ static\nnet::URLRequestJob* URLRequestAbortOnEndJob::Factory(\n    net::URLRequest* request,\n    const std::string& scheme) {\n  DCHECK(content::BrowserThread::CurrentlyOn(content::BrowserThread::IO));\n  return new URLRequestAbortOnEndJob(request);\n}\n\n\/\/ Private const version.\nvoid URLRequestAbortOnEndJob::GetResponseInfoConst(\n    net::HttpResponseInfo* info) const {\n  \/\/ Send back mock headers.\n  std::string raw_headers;\n  if (LowerCaseEqualsASCII(k400AbortOnEndUrl,\n                           request_->url().spec().c_str())) {\n    raw_headers.append(\n      \"HTTP\/1.1 400 This is not OK\\n\"\n      \"Content-type: text\/plain\\n\");\n  } else {\n    NOTREACHED();\n  }\n  \/\/ ParseRawHeaders expects \\0 to end each header line.\n  ReplaceSubstringsAfterOffset(&raw_headers, 0, \"\\n\", std::string(\"\\0\", 1));\n  info->headers = new net::HttpResponseHeaders(raw_headers);\n}\n\nURLRequestAbortOnEndJob::URLRequestAbortOnEndJob(net::URLRequest* request)\n    : URLRequestJob(request), sent_data_(false),\n      ALLOW_THIS_IN_INITIALIZER_LIST(weak_factory_(this)) {\n}\n\nURLRequestAbortOnEndJob::~URLRequestAbortOnEndJob() {\n}\n\nvoid URLRequestAbortOnEndJob::GetResponseInfo(net::HttpResponseInfo* info) {\n  GetResponseInfoConst(info);\n}\n\nbool URLRequestAbortOnEndJob::GetMimeType(std::string* mime_type) const {\n  net::HttpResponseInfo info;\n  GetResponseInfoConst(&info);\n  return info.headers && info.headers->GetMimeType(mime_type);\n}\n\nvoid URLRequestAbortOnEndJob::StartAsync() {\n  NotifyHeadersComplete();\n}\n\nvoid URLRequestAbortOnEndJob::Start() {\n  MessageLoop::current()->PostTask(\n      FROM_HERE,\n      base::Bind(&URLRequestAbortOnEndJob::StartAsync,\n                 weak_factory_.GetWeakPtr()));\n}\n\nbool URLRequestAbortOnEndJob::ReadRawData(net::IOBuffer* buf,\n                                          const int max_bytes,\n                                          int* bytes_read) {\n  if (!sent_data_) {\n    *bytes_read = std::min(size_t(max_bytes), sizeof(kPageContent));\n    std::memcpy(buf->data(), kPageContent, *bytes_read);\n    sent_data_ = true;\n    return true;\n  }\n\n  SetStatus(net::URLRequestStatus(net::URLRequestStatus::FAILED,\n                                  net::ERR_CONNECTION_ABORTED));\n  *bytes_read = -1;\n  return false;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"base.hpp\"\n#include \"NumHeldDownKeys.hpp\"\n#include \"Config.hpp\"\n\nnamespace org_pqrs_KeyRemap4MacBook {\n  int NumHeldDownKeys::num_ = 0;\n\n  void\n  NumHeldDownKeys::log(void)\n  {\n    IOLOG_DEVEL(\"NumHeldDownKeys = %d\\n\", num_);\n  }\n\n  void\n  NumHeldDownKeys::set(EventType eventType, KeyCode key, Flags flags)\n  {\n    if (eventType.isKeyDownOrModifierDown(key, flags)) {\n      ++num_;\n    } else {\n      --num_;\n    }\n    log();\n  }\n\n  void\n  NumHeldDownKeys::set(EventType eventType)\n  {\n    if (eventType == EventType::DOWN) {\n      ++num_;\n    } else if (eventType == EventType::UP) {\n      --num_;\n    }\n    log();\n  }\n\n  void\n  NumHeldDownKeys::set(int diff) {\n    num_ += diff;\n    log();\n  }\n\n  void\n  NumHeldDownKeys::reset(void)\n  {\n    if (config.debug_devel) {\n      printf(\"KeyRemap4MacBook NumHeldDownKeys::reset\\n\");\n    }\n    num_ = 0;\n  }\n\n  bool\n  NumHeldDownKeys::iszero(void)\n  {\n    return num_ <= 0;\n  }\n}\n<commit_msg>update NumHeldDownKeys to use IOLOG_*<commit_after>#include \"base.hpp\"\n#include \"NumHeldDownKeys.hpp\"\n#include \"Config.hpp\"\n\nnamespace org_pqrs_KeyRemap4MacBook {\n  int NumHeldDownKeys::num_ = 0;\n\n  void\n  NumHeldDownKeys::log(void)\n  {\n    IOLOG_DEVEL(\"NumHeldDownKeys = %d\\n\", num_);\n  }\n\n  void\n  NumHeldDownKeys::set(EventType eventType, KeyCode key, Flags flags)\n  {\n    if (eventType.isKeyDownOrModifierDown(key, flags)) {\n      ++num_;\n    } else {\n      --num_;\n    }\n    log();\n  }\n\n  void\n  NumHeldDownKeys::set(EventType eventType)\n  {\n    if (eventType == EventType::DOWN) {\n      ++num_;\n    } else if (eventType == EventType::UP) {\n      --num_;\n    }\n    log();\n  }\n\n  void\n  NumHeldDownKeys::set(int diff) {\n    num_ += diff;\n    log();\n  }\n\n  void\n  NumHeldDownKeys::reset(void)\n  {\n    IOLOG_DEVEL(\"NumHeldDownKeys::reset\\n\");\n    num_ = 0;\n  }\n\n  bool\n  NumHeldDownKeys::iszero(void)\n  {\n    return num_ <= 0;\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"stream_utility.hpp\"\n#include <cstdint>\n\nnamespace krbn {\nenum class modifier_flag : uint32_t {\n  zero,\n  caps_lock,\n  left_control,\n  left_shift,\n  left_option,\n  left_command,\n  right_control,\n  right_shift,\n  right_option,\n  right_command,\n  fn,\n  end_,\n};\n\ninline std::ostream& operator<<(std::ostream& stream, const modifier_flag& value) {\n#define KRBN_MODIFIER_FLAG_STREAM_OUTPUT(NAME) \\\n  case modifier_flag::NAME:                    \\\n    stream << #NAME;                           \\\n    break;\n\n  switch (value) {\n    KRBN_MODIFIER_FLAG_STREAM_OUTPUT(zero);\n    KRBN_MODIFIER_FLAG_STREAM_OUTPUT(caps_lock);\n    KRBN_MODIFIER_FLAG_STREAM_OUTPUT(left_control);\n    KRBN_MODIFIER_FLAG_STREAM_OUTPUT(left_shift);\n    KRBN_MODIFIER_FLAG_STREAM_OUTPUT(left_option);\n    KRBN_MODIFIER_FLAG_STREAM_OUTPUT(left_command);\n    KRBN_MODIFIER_FLAG_STREAM_OUTPUT(right_control);\n    KRBN_MODIFIER_FLAG_STREAM_OUTPUT(right_shift);\n    KRBN_MODIFIER_FLAG_STREAM_OUTPUT(right_option);\n    KRBN_MODIFIER_FLAG_STREAM_OUTPUT(right_command);\n    KRBN_MODIFIER_FLAG_STREAM_OUTPUT(fn);\n    KRBN_MODIFIER_FLAG_STREAM_OUTPUT(end_);\n  }\n\n#undef KRBN_MODIFIER_FLAG_STREAM_OUTPUT\n\n  return stream;\n}\n\ntemplate <template <class T, class A> class container>\ninline std::ostream& operator<<(std::ostream& stream, const container<modifier_flag, std::allocator<modifier_flag>>& values) {\n  return stream_utility::output_enums(stream, values);\n}\n\ntemplate <template <class T, class H, class K, class A> class container>\ninline std::ostream& operator<<(std::ostream& stream, const container<modifier_flag, std::hash<modifier_flag>, std::equal_to<modifier_flag>, std::allocator<modifier_flag>>& values) {\n  return stream_utility::output_enums(stream, values);\n}\n} \/\/ namespace krbn\n<commit_msg>add from_json(modifier_flag)<commit_after>#pragma once\n\n#include <cstdint>\n\nnamespace krbn {\nenum class modifier_flag : uint32_t {\n  zero,\n  caps_lock,\n  left_control,\n  left_shift,\n  left_option,\n  left_command,\n  right_control,\n  right_shift,\n  right_option,\n  right_command,\n  fn,\n  end_,\n};\n\ninline void from_json(const nlohmann::json& json, modifier_flag& value) {\n  if (!json.is_string()) {\n    throw pqrs::json::unmarshal_error(fmt::format(\"json must be string, but is `{0}`\", json.dump()));\n  }\n\n  auto name = json.get<std::string>();\n  if (name == \"zero\") {\n    value = modifier_flag::zero;\n  } else if (name == \"caps_lock\") {\n    value = modifier_flag::caps_lock;\n  } else if (name == \"left_control\") {\n    value = modifier_flag::left_control;\n  } else if (name == \"left_shift\") {\n    value = modifier_flag::left_shift;\n  } else if (name == \"left_option\") {\n    value = modifier_flag::left_option;\n  } else if (name == \"left_command\") {\n    value = modifier_flag::left_command;\n  } else if (name == \"right_control\") {\n    value = modifier_flag::right_control;\n  } else if (name == \"right_shift\") {\n    value = modifier_flag::right_shift;\n  } else if (name == \"right_option\") {\n    value = modifier_flag::right_option;\n  } else if (name == \"right_command\") {\n    value = modifier_flag::right_command;\n  } else if (name == \"fn\") {\n    value = modifier_flag::fn;\n  } else {\n    throw pqrs::json::unmarshal_error(fmt::format(\"unknown modifier_flag: `{0}`\", name));\n  }\n}\n} \/\/ namespace krbn\n<|endoftext|>"}
{"text":"<commit_before>#ifndef THIN_PLATE_SPLINE_HPP\n#define THIN_PLATE_SPLINE_HPP\n\n#include <Eigen\/Dense>\n#include <Eigen\/QR>\n#include \"arc_utilities\/arc_exceptions.hpp\"\n#include \"arc_utilities\/eigen_helpers.hpp\"\n\nnamespace arc_utilities\n{\n    \/\/ Note that DIMENSIONS must be a postive integer, not something like `Eigen::Dynamic`\n    template <int DIMENSIONS = 3>\n    class ThinPlateSpline\n    {\n    public:\n        typedef Eigen::Matrix<double, DIMENSIONS,     Eigen::Dynamic> PointSet;\n        typedef Eigen::Matrix<double, DIMENSIONS + 1, Eigen::Dynamic> HomogeneousPointSet;\n\n        EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n        ThinPlateSpline()\n            : solved_(false)\n        {}\n\n        \/**\n         * @brief ThinPlateSpline::ThinPlateSpline An arbitrary dimensional thin\n         *  plate spline for interpolation between points.\n         * @param template_points A (DIMINESION x NUMPOINTS) matrix which define\n         *  the starting points that control the warping. I.e. the template is\n         *  warped to the target\n         * @param target_points A (DIMINESION x NUMPOINTS) matrix which define\n         *  the target points that control the warping. I.e. the template is\n         *  warped to the target\n         *\/\n        template <typename DerivedA, typename DerivedB>\n        ThinPlateSpline(\n                const Eigen::MatrixBase<DerivedA>& template_points,\n                const Eigen::MatrixBase<DerivedB>& target_points)\n            : solved_(false)\n        {\n            setTemplatePoints(template_points);\n            setTargetPoints(target_points);\n            solveForCoeffs();\n        }\n\n        \/**\n         * @note Checking for the vailidty of the input data is put off until\n         *  the warping function is solved\n         *\/\n        template <typename Derived>\n        void setTemplatePoints(\n                const Eigen::MatrixBase<Derived>& template_points)\n        {\n            using namespace Eigen;\n            static_assert(MatrixBase<Derived>::RowsAtCompileTime == DIMENSIONS ||\n                          MatrixBase<Derived>::RowsAtCompileTime == Dynamic,\n                          \"INVALID DATA DIMENSIONS FOR template_points\");\n\n            homogeneous_template_points_.resize(DIMENSIONS + 1, template_points.cols());\n            homogeneous_template_points_ << template_points, RowVectorXd::Ones(template_points.cols());\n            solved_ = false;\n        }\n\n        \/**\n         * @note Checking for the vailidty of the input data is put off until\n         *  the warping function is solved\n         *\/\n        template <typename Derived>\n        void setTargetPoints(\n                const Eigen::MatrixBase<Derived>& target_points)\n        {\n            using namespace Eigen;\n            static_assert(MatrixBase<Derived>::RowsAtCompileTime == DIMENSIONS ||\n                          MatrixBase<Derived>::RowsAtCompileTime == Dynamic,\n                          \"INVALID DATA DIMENSIONS FOR target_points\");\n\n            target_points_ = target_points;\n            solved_ = false;\n        }\n\n        void solveForCoeffs()\n        {\n            using namespace Eigen;\n            if (homogeneous_template_points_.cols() < 1 || target_points_.cols() < 1)\n            {\n                throw_arc_exception(\n                            std::invalid_argument,\n                            \"template and target points must have valid data before solving\");\n            }\n            if (homogeneous_template_points_.cols() != target_points_.cols())\n            {\n                throw_arc_exception(\n                            std::invalid_argument,\n                            \"template and target points must have the same number of points\");\n            }\n\n            const auto NUMPOINTS = homogeneous_template_points_.cols();\n\n            \/\/ Calculate the kernel matrix for the template (control) points\n            const MatrixXd Rsquared =\n                    EigenHelpers::CalculateSquaredDistanceMatrix(homogeneous_template_points_);\n            const MatrixXd kernel = Rsquared.unaryExpr(&ThinPlateSpline::KernelFunction);\n\n            \/\/ Form the system:   A * params = B\n            \/\/       A = [K,       template'\n            \/\/            template,    0]\n            \/\/       B = [target'\n            \/\/              0    ]\n            MatrixXd A(NUMPOINTS + DIMENSIONS + 1, NUMPOINTS + DIMENSIONS + 1);\n            A << kernel,                       homogeneous_template_points_.transpose(),\n                 homogeneous_template_points_, MatrixXd::Zero(DIMENSIONS + 1, DIMENSIONS + 1);\n            MatrixXd B(NUMPOINTS + DIMENSIONS + 1, DIMENSIONS);\n            B << target_points_.transpose(),\n                 MatrixXd::Zero(DIMENSIONS + 1, DIMENSIONS);\n\n            \/\/ params = A \\ B\n            const Matrix<double, Dynamic, DIMENSIONS> params =\n                    A.colPivHouseholderQr().solve(B).eval();\n            warping_coeffs_ = params.topRows(NUMPOINTS).transpose();\n            affine_coeffs_ = params.bottomRows(DIMENSIONS + 1).transpose();\n            solved_ = true;\n        }\n\n        template<typename Derived>\n        Eigen::Matrix<double, DIMENSIONS, Eigen::Dynamic> interpolate(\n                const Eigen::MatrixBase<Derived>& interpolation_points)\n        {\n            using namespace Eigen;\n            static_assert(MatrixBase<Derived>::RowsAtCompileTime == DIMENSIONS ||\n                          MatrixBase<Derived>::RowsAtCompileTime == Dynamic,\n                          \"INVALID DATA DIMENSIONS FOR interpolation_points\");\n\n            if (!solved_)\n            {\n                solveForCoeffs();\n            }\n\n            HomogeneousPointSet homogeneous_interpolation_points(\n                        DIMENSIONS + 1, interpolation_points.cols());\n            homogeneous_interpolation_points << interpolation_points,\n                                                RowVectorXd::Ones(interpolation_points.cols());\n\n            \/\/ Calculate the kenerl matrix comparing the new points to the template (control) points\n            const MatrixXd Rsquared = EigenHelpers::SquaredDistancesBetweenPointSets(\n                        homogeneous_template_points_, homogeneous_interpolation_points);\n            const MatrixXd kernel = Rsquared.unaryExpr(&ThinPlateSpline::KernelFunction);\n\n            return affine_coeffs_ * homogeneous_interpolation_points + warping_coeffs_ * kernel;\n\n        }\n\n    protected:\n        static double KernelFunction(const double r_sq)\n        {\n            \/\/ Handle the limit as r -> 0 explicitly\n            return r_sq == 0.0 ? 0.0 : r_sq * std::log(std::sqrt(r_sq));\n        }\n\n        HomogeneousPointSet homogeneous_template_points_;\n        PointSet target_points_;\n        Eigen::Matrix<double, DIMENSIONS, DIMENSIONS + 1> affine_coeffs_;\n        PointSet warping_coeffs_;\n        bool solved_;\n    };\n}\n\n#endif \/\/ THIN_PLATE_SPLINE_HPP\n<commit_msg>Updated TPS kernel function with comments. Removed DIM >= 4 support.<commit_after>#ifndef THIN_PLATE_SPLINE_HPP\n#define THIN_PLATE_SPLINE_HPP\n\n#include <Eigen\/Dense>\n#include <Eigen\/QR>\n#include \"arc_utilities\/arc_exceptions.hpp\"\n#include \"arc_utilities\/eigen_helpers.hpp\"\n\nnamespace arc_utilities\n{\n    \/\/ Note that DIMENSIONS must be 2 or 3, not something like `Eigen::Dynamic`\n    template <int DIMENSIONS = 3>\n    class ThinPlateSpline\n    {\n    public:\n        typedef Eigen::Matrix<double, DIMENSIONS,     Eigen::Dynamic> PointSet;\n        typedef Eigen::Matrix<double, DIMENSIONS + 1, Eigen::Dynamic> HomogeneousPointSet;\n\n        EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n        static_assert(DIMENSIONS > 1,\n                      \"Using TPS only makes sense for 2 or more dimensions\");\n        static_assert(DIMENSIONS <= 3,\n                      \"The choice of kernel function for DIMENSIONS >= 4 is not clear.\"\n                      \" See note after equation (29) in \"\n                      \"https:\/\/www.geometrictools.com\/Documentation\/ThinPlateSplines.pdf\");\n\n        ThinPlateSpline()\n            : solved_(false)\n        {}\n\n        \/**\n         * @brief ThinPlateSpline::ThinPlateSpline An arbitrary dimensional thin\n         *  plate spline for interpolation between points.\n         * @param template_points A (DIMINESION x NUMPOINTS) matrix which define\n         *  the starting points that control the warping. I.e. the template is\n         *  warped to the target\n         * @param target_points A (DIMINESION x NUMPOINTS) matrix which define\n         *  the target points that control the warping. I.e. the template is\n         *  warped to the target\n         *\/\n        template <typename DerivedA, typename DerivedB>\n        ThinPlateSpline(\n                const Eigen::MatrixBase<DerivedA>& template_points,\n                const Eigen::MatrixBase<DerivedB>& target_points)\n            : solved_(false)\n        {\n            setTemplatePoints(template_points);\n            setTargetPoints(target_points);\n            solveForCoeffs();\n        }\n\n        \/**\n         * @note Checking for the vailidty of the input data is put off until\n         *  the warping function is solved\n         *\/\n        template <typename Derived>\n        void setTemplatePoints(\n                const Eigen::MatrixBase<Derived>& template_points)\n        {\n            using namespace Eigen;\n            static_assert(MatrixBase<Derived>::RowsAtCompileTime == DIMENSIONS ||\n                          MatrixBase<Derived>::RowsAtCompileTime == Dynamic,\n                          \"INVALID DATA DIMENSIONS FOR template_points\");\n\n            homogeneous_template_points_.resize(DIMENSIONS + 1, template_points.cols());\n            homogeneous_template_points_ << template_points, RowVectorXd::Ones(template_points.cols());\n            solved_ = false;\n        }\n\n        \/**\n         * @note Checking for the vailidty of the input data is put off until\n         *  the warping function is solved\n         *\/\n        template <typename Derived>\n        void setTargetPoints(\n                const Eigen::MatrixBase<Derived>& target_points)\n        {\n            using namespace Eigen;\n            static_assert(MatrixBase<Derived>::RowsAtCompileTime == DIMENSIONS ||\n                          MatrixBase<Derived>::RowsAtCompileTime == Dynamic,\n                          \"INVALID DATA DIMENSIONS FOR target_points\");\n\n            target_points_ = target_points;\n            solved_ = false;\n        }\n\n        void solveForCoeffs()\n        {\n            using namespace Eigen;\n            if (homogeneous_template_points_.cols() < 1 || target_points_.cols() < 1)\n            {\n                throw_arc_exception(\n                            std::invalid_argument,\n                            \"template and target points must have valid data before solving\");\n            }\n            if (homogeneous_template_points_.cols() != target_points_.cols())\n            {\n                throw_arc_exception(\n                            std::invalid_argument,\n                            \"template and target points must have the same number of points\");\n            }\n\n            const auto NUMPOINTS = homogeneous_template_points_.cols();\n\n            \/\/ Calculate the kernel matrix for the template (control) points\n            const MatrixXd Rsquared =\n                    EigenHelpers::CalculateSquaredDistanceMatrix(homogeneous_template_points_);\n            const MatrixXd kernel = Rsquared.unaryExpr(&ThinPlateSpline::KernelFunction);\n\n            \/\/ Form the system:   A * params = B\n            \/\/       A = [K,       template'\n            \/\/            template,    0]\n            \/\/       B = [target'\n            \/\/              0    ]\n            MatrixXd A(NUMPOINTS + DIMENSIONS + 1, NUMPOINTS + DIMENSIONS + 1);\n            A << kernel,                       homogeneous_template_points_.transpose(),\n                 homogeneous_template_points_, MatrixXd::Zero(DIMENSIONS + 1, DIMENSIONS + 1);\n            MatrixXd B(NUMPOINTS + DIMENSIONS + 1, DIMENSIONS);\n            B << target_points_.transpose(),\n                 MatrixXd::Zero(DIMENSIONS + 1, DIMENSIONS);\n\n            \/\/ params = A \\ B\n            const Matrix<double, Dynamic, DIMENSIONS> params =\n                    A.colPivHouseholderQr().solve(B).eval();\n            warping_coeffs_ = params.topRows(NUMPOINTS).transpose();\n            affine_coeffs_ = params.bottomRows(DIMENSIONS + 1).transpose();\n            solved_ = true;\n        }\n\n        template<typename Derived>\n        Eigen::Matrix<double, DIMENSIONS, Eigen::Dynamic> interpolate(\n                const Eigen::MatrixBase<Derived>& interpolation_points)\n        {\n            using namespace Eigen;\n            static_assert(MatrixBase<Derived>::RowsAtCompileTime == DIMENSIONS ||\n                          MatrixBase<Derived>::RowsAtCompileTime == Dynamic,\n                          \"INVALID DATA DIMENSIONS FOR interpolation_points\");\n\n            if (!solved_)\n            {\n                solveForCoeffs();\n            }\n\n            const auto num_points = interpolation_points.cols();\n            HomogeneousPointSet homogeneous_interpolation_points(\n                        DIMENSIONS + 1, num_points);\n            homogeneous_interpolation_points << interpolation_points,\n                                                RowVectorXd::Ones(num_points);\n\n            \/\/ Calculate the kenerl matrix comparing the new points to the template (control) points\n            const MatrixXd Rsquared = EigenHelpers::SquaredDistancesBetweenPointSets(\n                        homogeneous_template_points_, homogeneous_interpolation_points);\n            const MatrixXd kernel = Rsquared.unaryExpr(&ThinPlateSpline::KernelFunction);\n\n            return affine_coeffs_ * homogeneous_interpolation_points + warping_coeffs_ * kernel;\n\n        }\n\n    protected:\n        static double KernelFunction(const double r_sq)\n        {\n            \/\/ Equations taken from\n            \/\/ https:\/\/www.geometrictools.com\/Documentation\/ThinPlateSplines.pdf\n            \/\/ with coefficient (alpha) dropped as it is absorbed by warping_coeffs_\n            switch (DIMENSIONS)\n            {\n                case 2:\n                    \/\/ This should be r^2 * log(r). We do not take the square root\n                    \/\/ because the factor of 2 gets absorbed by warping_coeffs_\n                    return r_sq == 0.0 ? 0.0 : r_sq * std::log(r_sq);\n                case 3:\n                    \/\/ The negative is kept here for consistency with\n                    \/\/ https:\/\/www.geometrictools.com\/GTEngine\/Include\/Mathematics\/GteIntpThinPlateSpline3.h\n                    \/\/ and other TPS implementations found online\n                    return r_sq == 0.0 ? 0.0 : -std::sqrt(r_sq);\n                default:\n                    static_assert(DIMENSIONS == 2 || DIMENSIONS == 3,\n                                  \"Only 2 and 3 dimensional kernels are implemented\");\n            }\n        }\n\n        HomogeneousPointSet homogeneous_template_points_;\n        PointSet target_points_;\n        Eigen::Matrix<double, DIMENSIONS, DIMENSIONS + 1> affine_coeffs_;\n        PointSet warping_coeffs_;\n        bool solved_;\n    };\n}\n\n#endif \/\/ THIN_PLATE_SPLINE_HPP\n<|endoftext|>"}
{"text":"<commit_before>\n#include <glbinding\/gl\/gl.h>\n\n#include <glm\/glm.hpp>\n#include <glm\/gtx\/transform.hpp>\n\n#include <globjects\/logging.h>\n#include <globjects\/globjects.h>\n\n#include <globjects\/Uniform.h>\n#include <globjects\/Program.h>\n#include <globjects\/Shader.h>\n#include <globjects\/Buffer.h>\n\n#include <common\/Timer.h>\n#include <common\/Icosahedron.h>\n#include <common\/Camera.h>\n#include <common\/ContextFormat.h>\n#include <common\/Context.h>\n#include <common\/Window.h>\n#include <common\/WindowEventHandler.h>\n#include <common\/events.h>\n\n\nusing namespace gl;\nusing namespace glm;\nusing namespace globjects;\n\nclass EventHandler : public WindowEventHandler\n{\npublic:\n    EventHandler()\n    : m_camera(vec3(0.f, 1.f, 4.f))\n    {\n    }\n\n    virtual ~EventHandler()\n    {\n    }\n\n    virtual void initialize(Window & window) override\n    {\n        WindowEventHandler::initialize(window);\n\n        if (!hasExtension(GLextension::GL_ARB_tessellation_shader))\n        {\n            critical() << \"Tesselation not supported.\";\n\n            window.close();\n            return;\n        }\n\n        glClearColor(1.f, 1.f, 1.f, 0.f);\n\n        m_sphere = new Program();\n        m_sphere->attach(\n            Shader::fromFile(GL_VERTEX_SHADER,          \"data\/tessellation\/sphere.vert\")\n        ,   Shader::fromFile(GL_TESS_CONTROL_SHADER,    \"data\/tessellation\/sphere.tcs\")\n        ,   Shader::fromFile(GL_TESS_EVALUATION_SHADER, \"data\/tessellation\/sphere.tes\")\n        ,   Shader::fromFile(GL_GEOMETRY_SHADER,        \"data\/tessellation\/sphere.geom\")\n        ,   Shader::fromFile(GL_FRAGMENT_SHADER,        \"data\/tessellation\/sphere.frag\")\n        ,   Shader::fromFile(GL_FRAGMENT_SHADER,        \"data\/common\/phong.frag\"));\n\n        m_icosahedron = new Icosahedron();\n\n        m_time.reset();\n        m_time.start();\n\n        m_camera.setZNear(1.f);\n        m_camera.setZFar(16.f);\n    }\n\n    virtual void framebufferResizeEvent(ResizeEvent & event) override\n    {\n        WindowEventHandler::framebufferResizeEvent(event);\n\n        m_camera.setViewport(event.width(), event.height());\n    }\n\n    virtual void paintEvent(PaintEvent & event) override\n    {\n        WindowEventHandler::paintEvent(event);\n\n        glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n        float t = static_cast<float>(m_time.elapsed().count()) * 4e-10f;\n        mat4 R = rotate(t * 10.f, vec3(sin(t * 0.321f), cos(t * 0.234f), sin(t * 0.123f)));\n\n        m_sphere->setUniform(\"transform\", m_camera.viewProjection());\n        m_sphere->setUniform(\"rotation\", R);\n\n        int level = static_cast<int>((sin(t) * 0.5f + 0.5f) * 16) + 1;\n        m_sphere->setUniform(\"level\", level);\n        m_sphere->use();\n\n        glPatchParameteri(GL_PATCH_VERTICES, 3);\n        m_icosahedron->draw(GL_PATCHES);\n\n        m_sphere->release();\n    }\n\nprotected:\n    ref_ptr<Program> m_sphere;\n\n    ref_ptr<Icosahedron> m_icosahedron;\n\n    Camera m_camera;\n    Timer m_time;\n\n    vec3 m_rand;\n};\n\n\nint main(int \/*argc*\/, char * \/*argv*\/[])\n{\n    info() << \"Usage:\";\n    info() << \"\\t\" << \"ESC\" << \"\\t\\t\"       << \"Close example\";\n    info() << \"\\t\" << \"ALT + Enter\" << \"\\t\" << \"Toggle fullscreen\";\n    info() << \"\\t\" << \"F11\" << \"\\t\\t\"       << \"Toggle fullscreen\";\n    info() << \"\\t\" << \"F10\" << \"\\t\\t\"       << \"Toggle vertical sync\";\n    info() << \"\\t\" << \"F5\" << \"\\t\\t\"        << \"Reload shaders\";\n\n    ContextFormat format;\n    format.setVersion(4, 0);\n    format.setProfile(ContextFormat::Profile::Core);\n    format.setDepthBufferSize(16);\n    format.setForwardCompatible(true);\n\n    Window::init();\n\n    Window window;\n    window.setEventHandler(new EventHandler());\n\n    if (!window.create(format, \"Tesselation Example\"))\n        return 1;\n\n    window.show();\n\n    return MainLoop::run();\n}\n<commit_msg>Rewrite tesselation example to not use the common module anymore (except Icosahedron). #291<commit_after>\n#include <chrono>\n\n#include <glm\/glm.hpp>\n\n#include <glm\/gtx\/transform.hpp>\n\n#include <glbinding\/gl\/gl.h>\n#include <glbinding\/ContextInfo.h>\n#include <glbinding\/Version.h>\n\n#define GLFW_INCLUDE_NONE\n#include <GLFW\/glfw3.h>\n\n#include <globjects\/globjects.h>\n#include <globjects\/logging.h>\n#include <globjects\/Uniform.h>\n#include <globjects\/Program.h>\n#include <globjects\/Shader.h>\n\n#include <common\/Icosahedron.h>\n\n\nusing namespace gl;\nusing namespace glm;\nusing namespace globjects;\n\n\nvoid key_callback(GLFWwindow * window, int key, int \/*scancode*\/, int action, int \/*modes*\/)\n{\n    if (key == GLFW_KEY_ESCAPE && action == GLFW_RELEASE)\n        glfwSetWindowShouldClose(window, true);\n}\n\nvoid draw(Program * sphere, Icosahedron * icosahedron, std::chrono::high_resolution_clock::time_point t_start, glm::mat4 viewProjection)\n{\n    glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n    const auto t_elapsed = std::chrono::high_resolution_clock::now() - t_start;  \n    float t = static_cast<float>(t_elapsed.count()) * 4e-10f;\n    mat4 R = rotate(t * 10.f, vec3(sin(t * 0.321f), cos(t * 0.234f), sin(t * 0.123f)));\n\n    sphere->setUniform(\"transform\", viewProjection);\n    sphere->setUniform(\"rotation\", R);\n\n    int level = static_cast<int>((sin(t) * 0.5f + 0.5f) * 16) + 1;\n    sphere->setUniform(\"level\", level);\n    sphere->use();\n\n    glPatchParameteri(GL_PATCH_VERTICES, 3);\n    icosahedron->draw(GL_PATCHES);\n\n    sphere->release();\n}\n\n\nint main(int \/*argc*\/, char * \/*argv*\/[])\n{\n    \/\/ Initialize GLFW with error callback and needed OpenGL version window hint\n    glfwInit();\n    glfwSetErrorCallback( [] (int \/*error*\/, const char * description) { puts(description); } );\n    glfwWindowHint(GLFW_CONTEXT_VERSION_MAJOR, 4);\n    glfwWindowHint(GLFW_CONTEXT_VERSION_MINOR, 0);\n\n    \/\/ Create a context and, if valid, make it current\n    GLFWwindow * window = glfwCreateWindow(1024, 768, \"\", NULL, NULL);\n    if (window == nullptr)\n    {\n        critical() << \"Context creation failed. Terminate execution.\";\n\n        glfwTerminate();\n        return 1;\n    }\n    glfwMakeContextCurrent(window);\n\n    \/\/ Create callback that when user presses ESC, the context should be destroyed and window closed\n    glfwSetKeyCallback(window, key_callback);\n\n    \/\/ Initialize globjects (internally initializes glbinding, and registers the current context)\n    globjects::init();\n\n    \/\/ Dump information about context and graphics card\n    info() << std::endl\n        << \"OpenGL Version:  \" << glbinding::ContextInfo::version() << std::endl\n        << \"OpenGL Vendor:   \" << glbinding::ContextInfo::vendor() << std::endl\n        << \"OpenGL Renderer: \" << glbinding::ContextInfo::renderer() << std::endl;\n\n    if (!hasExtension(GLextension::GL_ARB_tessellation_shader))\n    {\n        critical() << \"Tesselation not supported.\";\n\n        glfwTerminate();\n        return 1;\n    }\n\n    glClearColor(1.f, 1.f, 1.f, 0.f);\n\n    {\n        \/\/ Initialize\n        ref_ptr<Program> sphere = new Program();\n        sphere->attach(\n            Shader::fromFile(GL_VERTEX_SHADER,          \"data\/tessellation\/sphere.vert\")\n        ,   Shader::fromFile(GL_TESS_CONTROL_SHADER,    \"data\/tessellation\/sphere.tcs\")\n        ,   Shader::fromFile(GL_TESS_EVALUATION_SHADER, \"data\/tessellation\/sphere.tes\")\n        ,   Shader::fromFile(GL_GEOMETRY_SHADER,        \"data\/tessellation\/sphere.geom\")\n        ,   Shader::fromFile(GL_FRAGMENT_SHADER,        \"data\/tessellation\/sphere.frag\")\n        ,   Shader::fromFile(GL_FRAGMENT_SHADER,        \"data\/common\/phong.frag\"));\n\n\n        float fovy = radians(40.f);\n        float aspect = static_cast<float>(1024) \/ max(static_cast<float>(768), 1.f);\n        float zNear = 1.f;\n        float zFar = 16.f;\n        vec3 eye(0.f, 1.f, 4.f);\n        vec3 center(0.0, 0.0, 0.0);\n        vec3 up(0.0, 1.0, 0.0);\n        \n        ref_ptr<Icosahedron> icosahedron = new Icosahedron();\n        const auto t_start = std::chrono::high_resolution_clock::now();\n        mat4 viewProjection = perspective(fovy, aspect, zNear, zFar) * lookAt(eye, center, up);\n\n\n        \/\/ Main loop\n        while (!glfwWindowShouldClose(window))\n        {\n            glfwPollEvents();\n            draw(sphere, icosahedron, t_start, viewProjection);\n            glfwSwapBuffers(window);\n        }\n\n    }\n\n    \/\/ Properly shutdown GLFW\n    glfwTerminate();\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>题目描述\n\n给定一个double类型的浮点数base和int类型的整数exponent。求base的exponent次方。 \n\nclass Solution {\npublic:\n    double Power(double base, int exponent) {\n        if(equal(base, 0.0) && exponent < 0) return 0.0;\n        double result = 1.0;\n        unsigned int abs_exponent = (unsigned int)exponent;\n        \n        if(exponent < 0) abs_exponent = (unsigned int)(-exponent);\n        \n        for(int i=0;i<abs_exponent;++i){\n            result *= base;\n        }\n        \n        if(exponent < 0)\n            return 1.0 \/ result;\n        else\n            return result;\n    }\n    \n    bool equal(double num1, double num2){\n        if(num1 - num2 < 0.0000001 && num1 - num2 > -0.0000001)\n            return true;\n        else\n            return false;\n    }\n};\n<commit_msg>Delete 数值的整数次方.cpp<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>+ MockRotor<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n * SessionSVN.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 \"SessionSVN.hpp\"\n\n#include <boost\/bind.hpp>\n\n#include <core\/rapidxml\/rapidxml.hpp>\n#include <core\/system\/Environment.hpp>\n#include <core\/system\/Process.hpp>\n#include <core\/system\/ShellUtils.hpp>\n#include <core\/Exec.hpp>\n\n#include <session\/projects\/SessionProjects.hpp>\n#include <session\/SessionModuleContext.hpp>\n#include <session\/SessionOptions.hpp>\n\nusing namespace core;\nusing namespace core::shell_utils;\n\nnamespace session {\nnamespace modules {\nnamespace svn {\n\nnamespace {\n\n\/** GLOBAL STATE **\/\nFilePath s_workingDir;\n\ncore::system::ProcessOptions procOptions()\n{\n   core::system::ProcessOptions options;\n\n   \/\/ detach the session so there is no terminal\n#ifndef _WIN32\n   options.detachSession = true;\n#endif\n\n   \/\/ get current environment for modification prior to passing to child\n   core::system::Options childEnv;\n   core::system::environment(&childEnv);\n\n   \/\/ TODO: Add Subversion bin dir to path if necessary\n\n   \/\/ add postback directory to PATH\n   FilePath postbackDir = session::options().rpostbackPath().parent();\n   core::system::addToPath(&childEnv, postbackDir.absolutePath());\n\n   options.workingDir = projects::projectContext().directory();\n\n   \/\/ on windows set HOME to USERPROFILE\n#ifdef _WIN32\n   std::string userProfile = core::system::getenv(childEnv, \"USERPROFILE\");\n   core::system::setenv(&childEnv, \"HOME\", userProfile);\n#endif\n\n   \/\/ set custom environment\n   options.environment = childEnv;\n\n   return options;\n}\n\n} \/\/ namespace\n\n\nbool isSvnInstalled()\n{\n   core::system::ProcessResult result;\n   Error error = core::system::runCommand(\"svn help\", \"\", procOptions(), &result);\n\n   if (error)\n   {\n      LOG_ERROR(error);\n      return false;\n   }\n\n   return result.exitStatus == EXIT_SUCCESS;\n}\n\nbool isSvnDirectory(const core::FilePath& workingDir)\n{\n   if (workingDir.empty())\n      return false;\n\n   core::system::ProcessOptions options = procOptions();\n   options.workingDir = workingDir;\n\n   core::system::ProcessResult result;\n\n   Error error = core::system::runCommand(\"svn info\",\n                                          \"\",\n                                          options,\n                                          &result);\n\n   if (error)\n      return false;\n\n   return result.exitStatus == EXIT_SUCCESS;\n}\n\nbool isSvnEnabled()\n{\n   return !s_workingDir.empty();\n}\n\nstd::string translateItemStatus(const std::string& status)\n{\n   if (status == \"added\")\n      return \"A\";\n   if (status == \"conflicted\")\n      return \"C\";\n   if (status == \"deleted\")\n      return \"D\";\n   if (status == \"external\")\n      return \"X\";\n   if (status == \"ignored\")\n      return \"I\";\n   if (status == \"incomplete\")\n      return \"!\";\n   if (status == \"merged\")      \/\/ ??\n      return \"G\";\n   if (status == \"missing\")\n      return \"!\";\n   if (status == \"modified\")\n      return \"M\";\n   if (status == \"none\")\n      return \" \";\n   if (status == \"normal\")      \/\/ ??\n      return \" \";\n   if (status == \"obstructed\")\n      return \"~\";\n   if (status == \"replaced\")\n      return \"~\";\n   if (status == \"unversioned\")\n      return \"?\";\n\n   return \" \";\n}\n\n#define FOREACH_NODE(parent, varname, name) \\\n   for (rapidxml::xml_node<>* varname = parent->first_node(name); \\\n        varname; \\\n        varname = varname->next_sibling(name))\n\nstd::string attr_value(rapidxml::xml_node<>* pNode, const std::string& attrName)\n{\n   if (!pNode)\n      return std::string();\n   rapidxml::xml_attribute<>* pAttr = pNode->first_attribute(attrName.c_str());\n   if (!pAttr)\n      return std::string();\n   return std::string(pAttr->value());\n}\n\nFilePath resolveAliasedJsonPath(const json::Value& value)\n{\n   return module_context::resolveAliasedPath(value.get_str());\n}\n\nError svnAdd(const json::JsonRpcRequest& request,\n             json::JsonRpcResponse* pResponse)\n{\n   json::Array files;\n   Error error = json::readParams(request.params, &files);\n   if (error)\n      return error;\n\n   std::vector<FilePath> paths;\n   std::transform(files.begin(), files.end(), std::back_inserter(paths),\n                  &resolveAliasedJsonPath);\n\n   core::system::ProcessResult result;\n   error = core::system::runCommand(\n         ShellCommand(\"svn\") << \"add\" << \"--\" << paths,\n         \"\",\n         procOptions(),\n         &result);\n\n   if (error)\n      return error;\n\n   return Success();\n}\n\nError svnRevert(const json::JsonRpcRequest& request,\n                json::JsonRpcResponse* pResponse)\n{\n   json::Array files;\n   Error error = json::readParams(request.params, &files);\n   if (error)\n      return error;\n\n   std::vector<FilePath> paths;\n   std::transform(files.begin(), files.end(), std::back_inserter(paths),\n                  &resolveAliasedJsonPath);\n\n   core::system::ProcessResult result;\n   error = core::system::runCommand(\n         ShellCommand(\"svn\") << \"revert\" << \"--\" << paths,\n         \"\",\n         procOptions(),\n         &result);\n\n   if (error)\n      return error;\n\n   return Success();\n}\n\nError svnStatus(const json::JsonRpcRequest& request,\n                json::JsonRpcResponse* pResponse)\n{\n   core::system::ProcessResult result;\n   Error error = core::system::runCommand(\n         ShellCommand(\"svn\") << \"status\" << \"--xml\" << \"--ignore-externals\",\n         \"\",\n         procOptions(),\n         &result);\n\n   if (error)\n      return error;\n\n   if (result.exitStatus != EXIT_SUCCESS)\n   {\n      LOG_ERROR_MESSAGE(result.stdErr);\n      return Success();\n   }\n\n   std::vector<char> xmlData;\n   xmlData.reserve(result.stdOut.size() + 1);\n   std::copy(result.stdOut.begin(),\n             result.stdOut.end(),\n             std::back_inserter(xmlData));\n   xmlData.push_back(NULL); \/\/ null terminator\n\n   using namespace rapidxml;\n   xml_document<> doc;\n   doc.parse<0>(&(xmlData[0]));\n\n   json::Array results;\n\n   xml_node<>* pStatus = doc.first_node(\"status\");\n   if (pStatus)\n   {\n      FOREACH_NODE(pStatus, pList,)\n      {\n         FOREACH_NODE(pList, pEntry, \"entry\")\n         {\n            std::string path = attr_value(pEntry, \"path\");\n            if (path.empty())\n            {\n               LOG_ERROR_MESSAGE(\"Path attribute not found\");\n               continue;\n            }\n\n            xml_node<>* pStatus = pEntry->first_node(\"wc-status\");\n            if (!pStatus)\n            {\n               LOG_ERROR_MESSAGE(\"Status node not found\");\n               continue;\n            }\n\n            std::string item = attr_value(pStatus, \"item\");\n            if (item.empty())\n            {\n               LOG_ERROR_MESSAGE(\"Item attribute not found\");\n               continue;\n            }\n\n            json::Object info;\n            info[\"status\"] = translateItemStatus(item);\n            \/\/ TODO: escape path relative to <target>\n            info[\"path\"] = path;\n            info[\"raw_path\"] = module_context::createAliasedPath(\n                  projects::projectContext().directory().childPath(path));\n            results.push_back(info);\n         }\n      }\n   }\n\n   pResponse->setResult(results);\n\n   return Success();\n}\n\nError initialize()\n{\n   \/\/ install rpc methods\n   using boost::bind;\n   using namespace module_context;\n   ExecBlock initBlock ;\n   initBlock.addFunctions()\n      (bind(registerRpcMethod, \"svn_add\", svnAdd))\n      (bind(registerRpcMethod, \"svn_revert\", svnRevert))\n      (bind(registerRpcMethod, \"svn_status\", svnStatus));\n   Error error = initBlock.execute();\n   if (error)\n      return error;\n\n   return Success();\n}\n\nError initializeSvn(const core::FilePath& workingDir)\n{\n   s_workingDir = workingDir;\n   return Success();\n}\n\n} \/\/ namespace svn\n} \/\/ namespace modules\n} \/\/namespace session\n<commit_msg>Clean up SVN command impls<commit_after>\/*\n * SessionSVN.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 \"SessionSVN.hpp\"\n\n#include <boost\/bind.hpp>\n\n#include <core\/rapidxml\/rapidxml.hpp>\n#include <core\/system\/Environment.hpp>\n#include <core\/system\/Process.hpp>\n#include <core\/system\/ShellUtils.hpp>\n#include <core\/Exec.hpp>\n\n#include <session\/projects\/SessionProjects.hpp>\n#include <session\/SessionModuleContext.hpp>\n#include <session\/SessionOptions.hpp>\n\nusing namespace core;\nusing namespace core::shell_utils;\n\nnamespace session {\nnamespace modules {\nnamespace svn {\n\nnamespace {\n\n\/** GLOBAL STATE **\/\nFilePath s_workingDir;\n\ncore::system::ProcessOptions procOptions()\n{\n   core::system::ProcessOptions options;\n\n   \/\/ detach the session so there is no terminal\n#ifndef _WIN32\n   options.detachSession = true;\n#endif\n\n   \/\/ get current environment for modification prior to passing to child\n   core::system::Options childEnv;\n   core::system::environment(&childEnv);\n\n   \/\/ TODO: Add Subversion bin dir to path if necessary\n\n   \/\/ add postback directory to PATH\n   FilePath postbackDir = session::options().rpostbackPath().parent();\n   core::system::addToPath(&childEnv, postbackDir.absolutePath());\n\n   if (!s_workingDir.empty())\n      options.workingDir = s_workingDir;\n   else\n      options.workingDir = projects::projectContext().directory();\n\n   \/\/ on windows set HOME to USERPROFILE\n#ifdef _WIN32\n   std::string userProfile = core::system::getenv(childEnv, \"USERPROFILE\");\n   core::system::setenv(&childEnv, \"HOME\", userProfile);\n#endif\n\n   \/\/ set custom environment\n   options.environment = childEnv;\n\n   return options;\n}\n\nError runSvn(const ShellArgs& args,\n             std::string* pStdOut=NULL,\n             std::string* pStdErr=NULL,\n             int* pExitCode=NULL)\n{\n   core::system::ProcessOptions options = procOptions();\n#ifdef _WIN32\n   options.detachProcess = true;\n#endif\n\n   core::system::ProcessResult result;\n\n#ifdef _WIN32\n   Error error = core::system::runProgram(\"svn.exe\",\n                                          args.args(),\n                                          options,\n                                          &result);\n#else\n   Error error = core::system::runCommand(ShellCommand(\"svn\") << args.args(),\n                                          options,\n                                          &result);\n#endif\n   if (error)\n      return error;\n\n   if (pStdOut)\n      *pStdOut = result.stdOut;\n   if (pStdErr)\n      *pStdErr = result.stdErr;\n   if (pExitCode)\n      *pExitCode = result.exitStatus;\n\n   if (result.exitStatus != EXIT_SUCCESS)\n   {\n      LOG_DEBUG_MESSAGE(result.stdErr);\n   }\n\n   return Success();\n}\n\n} \/\/ namespace\n\n\nbool isSvnInstalled()\n{\n   int exitCode;\n   Error error = runSvn(ShellArgs() << \"help\", NULL, NULL, &exitCode);\n\n   if (error)\n   {\n      LOG_ERROR(error);\n      return false;\n   }\n\n   return exitCode == EXIT_SUCCESS;\n}\n\nbool isSvnDirectory(const core::FilePath& workingDir)\n{\n   if (workingDir.empty())\n      return false;\n\n   core::system::ProcessOptions options = procOptions();\n   options.workingDir = workingDir;\n\n   core::system::ProcessResult result;\n\n   Error error = core::system::runCommand(\"svn info\",\n                                          \"\",\n                                          options,\n                                          &result);\n\n   if (error)\n      return false;\n\n   return result.exitStatus == EXIT_SUCCESS;\n}\n\nbool isSvnEnabled()\n{\n   return !s_workingDir.empty();\n}\n\nstd::string translateItemStatus(const std::string& status)\n{\n   if (status == \"added\")\n      return \"A\";\n   if (status == \"conflicted\")\n      return \"C\";\n   if (status == \"deleted\")\n      return \"D\";\n   if (status == \"external\")\n      return \"X\";\n   if (status == \"ignored\")\n      return \"I\";\n   if (status == \"incomplete\")\n      return \"!\";\n   if (status == \"merged\")      \/\/ ??\n      return \"G\";\n   if (status == \"missing\")\n      return \"!\";\n   if (status == \"modified\")\n      return \"M\";\n   if (status == \"none\")\n      return \" \";\n   if (status == \"normal\")      \/\/ ??\n      return \" \";\n   if (status == \"obstructed\")\n      return \"~\";\n   if (status == \"replaced\")\n      return \"~\";\n   if (status == \"unversioned\")\n      return \"?\";\n\n   return \" \";\n}\n\n#define FOREACH_NODE(parent, varname, name) \\\n   for (rapidxml::xml_node<>* varname = parent->first_node(name); \\\n        varname; \\\n        varname = varname->next_sibling(name))\n\nstd::string attr_value(rapidxml::xml_node<>* pNode, const std::string& attrName)\n{\n   if (!pNode)\n      return std::string();\n   rapidxml::xml_attribute<>* pAttr = pNode->first_attribute(attrName.c_str());\n   if (!pAttr)\n      return std::string();\n   return std::string(pAttr->value());\n}\n\nFilePath resolveAliasedJsonPath(const json::Value& value)\n{\n   return module_context::resolveAliasedPath(value.get_str());\n}\n\nError svnAdd(const json::JsonRpcRequest& request,\n             json::JsonRpcResponse* pResponse)\n{\n   json::Array files;\n   Error error = json::readParams(request.params, &files);\n   if (error)\n      return error;\n\n   std::vector<FilePath> paths;\n   std::transform(files.begin(), files.end(), std::back_inserter(paths),\n                  &resolveAliasedJsonPath);\n\n   error = runSvn(ShellArgs() << \"add\" << \"--\" << paths);\n   if (error)\n      return error;\n\n   return Success();\n}\n\nError svnRevert(const json::JsonRpcRequest& request,\n                json::JsonRpcResponse* pResponse)\n{\n   json::Array files;\n   Error error = json::readParams(request.params, &files);\n   if (error)\n      return error;\n\n   std::vector<FilePath> paths;\n   std::transform(files.begin(), files.end(), std::back_inserter(paths),\n                  &resolveAliasedJsonPath);\n\n   error = runSvn(ShellArgs() << \"revert\" << \"--\" << paths);\n   if (error)\n      return error;\n\n   return Success();\n}\n\nError svnStatus(const json::JsonRpcRequest& request,\n                json::JsonRpcResponse* pResponse)\n{\n   std::string stdOut, stdErr;\n   int exitCode;\n   Error error = runSvn(\n         ShellArgs() << \"status\" << \"--xml\" << \"--ignore-externals\",\n         &stdOut,\n         &stdErr,\n         &exitCode);\n   if (error)\n      return error;\n\n   if (exitCode != EXIT_SUCCESS)\n   {\n      LOG_ERROR_MESSAGE(stdErr);\n      return Success();\n   }\n\n   std::vector<char> xmlData;\n   xmlData.reserve(stdOut.size() + 1);\n   std::copy(stdOut.begin(),\n             stdOut.end(),\n             std::back_inserter(xmlData));\n   xmlData.push_back(NULL); \/\/ null terminator\n\n   using namespace rapidxml;\n   xml_document<> doc;\n   doc.parse<0>(&(xmlData[0]));\n\n   json::Array results;\n\n   xml_node<>* pStatus = doc.first_node(\"status\");\n   if (pStatus)\n   {\n      FOREACH_NODE(pStatus, pList,)\n      {\n         FOREACH_NODE(pList, pEntry, \"entry\")\n         {\n            std::string path = attr_value(pEntry, \"path\");\n            if (path.empty())\n            {\n               LOG_ERROR_MESSAGE(\"Path attribute not found\");\n               continue;\n            }\n\n            xml_node<>* pStatus = pEntry->first_node(\"wc-status\");\n            if (!pStatus)\n            {\n               LOG_ERROR_MESSAGE(\"Status node not found\");\n               continue;\n            }\n\n            std::string item = attr_value(pStatus, \"item\");\n            if (item.empty())\n            {\n               LOG_ERROR_MESSAGE(\"Item attribute not found\");\n               continue;\n            }\n\n            json::Object info;\n            info[\"status\"] = translateItemStatus(item);\n            \/\/ TODO: escape path relative to <target>\n            info[\"path\"] = path;\n            info[\"raw_path\"] = module_context::createAliasedPath(\n                  projects::projectContext().directory().childPath(path));\n            results.push_back(info);\n         }\n      }\n   }\n\n   pResponse->setResult(results);\n\n   return Success();\n}\n\nError initialize()\n{\n   \/\/ install rpc methods\n   using boost::bind;\n   using namespace module_context;\n   ExecBlock initBlock ;\n   initBlock.addFunctions()\n      (bind(registerRpcMethod, \"svn_add\", svnAdd))\n      (bind(registerRpcMethod, \"svn_revert\", svnRevert))\n      (bind(registerRpcMethod, \"svn_status\", svnStatus));\n   Error error = initBlock.execute();\n   if (error)\n      return error;\n\n   return Success();\n}\n\nError initializeSvn(const core::FilePath& workingDir)\n{\n   s_workingDir = workingDir;\n   return Success();\n}\n\n} \/\/ namespace svn\n} \/\/ namespace modules\n} \/\/namespace session\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * \\file\n * \\brief ThisThread::Signals namespace implementation\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-02-21\n *\/\n\n#include \"distortos\/ThisThread-Signals.hpp\"\n\n#include \"distortos\/scheduler\/getScheduler.hpp\"\n#include \"distortos\/scheduler\/Scheduler.hpp\"\n\n#include \"distortos\/architecture\/InterruptMaskingLock.hpp\"\n\n#include <cerrno>\n\nnamespace distortos\n{\n\nnamespace ThisThread\n{\n\nnamespace Signals\n{\n\nnamespace\n{\n\n\/*---------------------------------------------------------------------------------------------------------------------+\n| local types\n+---------------------------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ SignalsWaitUnblockFunctor is a functor executed when unblocking a thread that is waiting for signal\nclass SignalsWaitUnblockFunctor : public scheduler::ThreadControlBlock::UnblockFunctor\n{\npublic:\n\n\t\/**\n\t * \\brief SignalsWaitUnblockFunctor's constructor\n\t *\n\t * \\param [in] pendingSignalSet is a reference to SignalSet that will be used to return saved pending signal set\n\t *\/\n\n\tconstexpr explicit SignalsWaitUnblockFunctor(SignalSet& pendingSignalSet) :\n\t\t\tpendingSignalSet_(pendingSignalSet)\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief SignalsWaitUnblockFunctor's function call operator\n\t *\n\t * Saves pending signal set of unblocked thread and clears pointer to set of signals that were \"waited for\".\n\t *\n\t * \\param [in] threadControlBlock is a reference to ThreadControlBlock that is being unblocked\n\t *\/\n\n\tvoid operator()(scheduler::ThreadControlBlock& threadControlBlock) const override\n\t{\n\t\tpendingSignalSet_ = threadControlBlock.getPendingSignalSet();\n\t\tthreadControlBlock.setWaitingSignalSet(nullptr);\n\t}\n\nprivate:\n\n\t\/\/\/ reference to SignalSet that will be used to return saved pending signal set\n\tSignalSet& pendingSignalSet_;\n};\n\n\/*---------------------------------------------------------------------------------------------------------------------+\n| local functions\n+---------------------------------------------------------------------------------------------------------------------*\/\n\n\/**\n * \\brief Implementation of distortos::ThisThread::Signals::wait() and distortos::ThisThread::Signals::tryWait().\n *\n * \\param [in] signalSet is a reference to set of signals that will be waited for\n * \\param [in] nonBlocking selects whether this function operates in blocking mode (false) or non-blocking mode (true)\n *\n * \\return pair with return code (0 on success, error code otherwise) and signal number of signal that was accepted;\n * error codes:\n * - EAGAIN - no signal specified by \\a signalSet was pending and non-blocking mode was selected;\n *\/\n\nstd::pair<int, uint8_t> waitImplementation(const SignalSet& signalSet, const bool nonBlocking)\n{\n\tarchitecture::InterruptMaskingLock interruptMaskingLock;\n\n\tauto& scheduler = scheduler::getScheduler();\n\tauto& currentThreadControlBlock = scheduler.getCurrentThreadControlBlock();\n\n\tconst auto bitset = signalSet.getBitset();\n\tauto pendingSignalSet = currentThreadControlBlock.getPendingSignalSet();\n\tauto pendingBitset = pendingSignalSet.getBitset();\n\tauto intersection = bitset & pendingBitset;\n\n\tif (intersection.none() == true)\t\/\/ none of desired signals is pending, so current thread must be blocked\n\t{\n\t\tif (nonBlocking == true)\n\t\t\treturn {EAGAIN, {}};\n\n\t\tscheduler::ThreadControlBlockList waitingList {scheduler.getThreadControlBlockListAllocator(),\n\t\t\t\tscheduler::ThreadControlBlock::State::WaitingForSignal};\n\n\t\tcurrentThreadControlBlock.setWaitingSignalSet(&signalSet);\n\t\tconst SignalsWaitUnblockFunctor signalsWaitUnblockFunctor {pendingSignalSet};\n\t\tconst auto ret = scheduler.block(waitingList, &signalsWaitUnblockFunctor);\n\t\tif (ret != 0)\n\t\t\treturn {ret, {}};\n\n\t\tpendingBitset = pendingSignalSet.getBitset();\n\t\tintersection = bitset & pendingBitset;\n\t}\n\n\tconst auto intersectionValue = intersection.to_ulong();\n\t\/\/ GCC builtin - \"find first set\" - https:\/\/gcc.gnu.org\/onlinedocs\/gcc\/Other-Builtins.html\n\tconst auto signalNumber = __builtin_ffsl(intersectionValue) - 1;\n\tconst auto ret = currentThreadControlBlock.acceptPendingSignal(signalNumber);\n\treturn {ret, signalNumber};\n}\n\n}\t\/\/ namespace\n\n\/*---------------------------------------------------------------------------------------------------------------------+\n| global functions\n+---------------------------------------------------------------------------------------------------------------------*\/\n\nstd::pair<int, uint8_t> tryWait(const SignalSet& signalSet)\n{\n\treturn waitImplementation(signalSet, true);\t\/\/ non-blocking mode\n}\n\nstd::pair<int, uint8_t> wait(const SignalSet& signalSet)\n{\n\treturn waitImplementation(signalSet, false);\t\/\/ blocking mode\n}\n\n}\t\/\/ namespace Signals\n\n}\t\/\/ namespace ThisThread\n\n}\t\/\/ namespace distortos\n<commit_msg>ThisThread::Signals: add support for blocking with timeout to local waitImplementation()<commit_after>\/**\n * \\file\n * \\brief ThisThread::Signals namespace implementation\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-02-21\n *\/\n\n#include \"distortos\/ThisThread-Signals.hpp\"\n\n#include \"distortos\/scheduler\/getScheduler.hpp\"\n#include \"distortos\/scheduler\/Scheduler.hpp\"\n\n#include \"distortos\/architecture\/InterruptMaskingLock.hpp\"\n\n#include <cerrno>\n\nnamespace distortos\n{\n\nnamespace ThisThread\n{\n\nnamespace Signals\n{\n\nnamespace\n{\n\n\/*---------------------------------------------------------------------------------------------------------------------+\n| local types\n+---------------------------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ SignalsWaitUnblockFunctor is a functor executed when unblocking a thread that is waiting for signal\nclass SignalsWaitUnblockFunctor : public scheduler::ThreadControlBlock::UnblockFunctor\n{\npublic:\n\n\t\/**\n\t * \\brief SignalsWaitUnblockFunctor's constructor\n\t *\n\t * \\param [in] pendingSignalSet is a reference to SignalSet that will be used to return saved pending signal set\n\t *\/\n\n\tconstexpr explicit SignalsWaitUnblockFunctor(SignalSet& pendingSignalSet) :\n\t\t\tpendingSignalSet_(pendingSignalSet)\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief SignalsWaitUnblockFunctor's function call operator\n\t *\n\t * Saves pending signal set of unblocked thread and clears pointer to set of signals that were \"waited for\".\n\t *\n\t * \\param [in] threadControlBlock is a reference to ThreadControlBlock that is being unblocked\n\t *\/\n\n\tvoid operator()(scheduler::ThreadControlBlock& threadControlBlock) const override\n\t{\n\t\tpendingSignalSet_ = threadControlBlock.getPendingSignalSet();\n\t\tthreadControlBlock.setWaitingSignalSet(nullptr);\n\t}\n\nprivate:\n\n\t\/\/\/ reference to SignalSet that will be used to return saved pending signal set\n\tSignalSet& pendingSignalSet_;\n};\n\n\/*---------------------------------------------------------------------------------------------------------------------+\n| local functions\n+---------------------------------------------------------------------------------------------------------------------*\/\n\n\/**\n * \\brief Implementation of distortos::ThisThread::Signals::wait(), distortos::ThisThread::Signals::tryWait() and\n * distortos::ThisThread::Signals::tryWaitUntil().\n *\n * \\param [in] signalSet is a reference to set of signals that will be waited for\n * \\param [in] nonBlocking selects whether this function operates in blocking mode (false) or non-blocking mode (true)\n * \\param [in] timePoint is a pointer to time point at which the wait for signals will be terminated, used only if\n * blocking mode is selected, nullptr to block without timeout\n *\n * \\return pair with return code (0 on success, error code otherwise) and signal number of signal that was accepted;\n * error codes:\n * - EAGAIN - no signal specified by \\a signalSet was pending and non-blocking mode was selected;\n * - ETIMEDOUT - no signal specified by \\a signalSet was generated before specified \\a timePoint;\n *\/\n\nstd::pair<int, uint8_t> waitImplementation(const SignalSet& signalSet, const bool nonBlocking,\n\t\tconst TickClock::time_point* const timePoint)\n{\n\tarchitecture::InterruptMaskingLock interruptMaskingLock;\n\n\tauto& scheduler = scheduler::getScheduler();\n\tauto& currentThreadControlBlock = scheduler.getCurrentThreadControlBlock();\n\n\tconst auto bitset = signalSet.getBitset();\n\tauto pendingSignalSet = currentThreadControlBlock.getPendingSignalSet();\n\tauto pendingBitset = pendingSignalSet.getBitset();\n\tauto intersection = bitset & pendingBitset;\n\n\tif (intersection.none() == true)\t\/\/ none of desired signals is pending, so current thread must be blocked\n\t{\n\t\tif (nonBlocking == true)\n\t\t\treturn {EAGAIN, {}};\n\n\t\tscheduler::ThreadControlBlockList waitingList {scheduler.getThreadControlBlockListAllocator(),\n\t\t\t\tscheduler::ThreadControlBlock::State::WaitingForSignal};\n\n\t\tcurrentThreadControlBlock.setWaitingSignalSet(&signalSet);\n\t\tconst SignalsWaitUnblockFunctor signalsWaitUnblockFunctor {pendingSignalSet};\n\t\tconst auto ret = timePoint == nullptr ? scheduler.block(waitingList, &signalsWaitUnblockFunctor) :\n\t\t\t\tscheduler.blockUntil(waitingList, *timePoint, &signalsWaitUnblockFunctor);\n\t\tif (ret != 0)\n\t\t\treturn {ret, {}};\n\n\t\tpendingBitset = pendingSignalSet.getBitset();\n\t\tintersection = bitset & pendingBitset;\n\t}\n\n\tconst auto intersectionValue = intersection.to_ulong();\n\t\/\/ GCC builtin - \"find first set\" - https:\/\/gcc.gnu.org\/onlinedocs\/gcc\/Other-Builtins.html\n\tconst auto signalNumber = __builtin_ffsl(intersectionValue) - 1;\n\tconst auto ret = currentThreadControlBlock.acceptPendingSignal(signalNumber);\n\treturn {ret, signalNumber};\n}\n\n}\t\/\/ namespace\n\n\/*---------------------------------------------------------------------------------------------------------------------+\n| global functions\n+---------------------------------------------------------------------------------------------------------------------*\/\n\nstd::pair<int, uint8_t> tryWait(const SignalSet& signalSet)\n{\n\treturn waitImplementation(signalSet, true, nullptr);\t\/\/ non-blocking mode\n}\n\nstd::pair<int, uint8_t> wait(const SignalSet& signalSet)\n{\n\treturn waitImplementation(signalSet, false, nullptr);\t\/\/ blocking mode, no timeout\n}\n\n}\t\/\/ namespace Signals\n\n}\t\/\/ namespace ThisThread\n\n}\t\/\/ namespace distortos\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>MAINT-3541 (crash in std::vector >::reserve)<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n * LinkBasedFileLock.cpp\n *\n * Copyright (C) 2009-12 by RStudio, Inc.\n *\n * Unless you have received this program directly from RStudio pursuant\n * to the terms of a commercial license agreement with RStudio, then\n * this program is licensed to you under the terms of version 3 of the\n * GNU Affero General Public License. This program is distributed WITHOUT\n * ANY EXPRESS OR IMPLIED WARRANTY, INCLUDING THOSE OF NON-INFRINGEMENT,\n * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Please refer to the\n * AGPL (http:\/\/www.gnu.org\/licenses\/agpl-3.0.txt) for more details.\n *\n *\/\n\n#include <core\/FileLock.hpp>\n\n#include <errno.h>\n\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n#include <fcntl.h>\n\n#include <set>\n#include <vector>\n\n#include <core\/SafeConvert.hpp>\n#include <core\/Algorithm.hpp>\n#include <core\/Thread.hpp>\n#include <core\/Error.hpp>\n#include <core\/Log.hpp>\n#include <core\/FilePath.hpp>\n#include <core\/FileSerializer.hpp>\n#include <core\/system\/System.hpp>\n\n#include <boost\/foreach.hpp>\n#include <boost\/system\/error_code.hpp>\n\nnamespace rstudio {\nnamespace core {\n\nnamespace {\n\nconst char * const kFileLockPrefix =\n      \".rstudio-lock-41c29\";\n\nstd::string pidString()\n{\n   PidType pid = system::currentProcessId();\n   return safe_convert::numberToString((long) pid);\n}\n\nstd::string hostName()\n{\n   char buffer[256];\n   int status = ::gethostname(buffer, 255);\n   if (status)\n      LOG_ERROR(systemError(errno, ERROR_LOCATION));\n   return std::string(buffer);\n}\n\nstd::string threadId()\n{\n   std::stringstream ss;\n   ss << boost::this_thread::get_id();\n   return ss.str();\n}\n\nstd::string proxyLockFileName()\n{\n   return std::string()\n         + kFileLockPrefix\n         + \"-\" + hostName()\n         + \"-\" + pidString()\n         + \"-\" + threadId();\n         \n}\n\nbool isLockFileStale(const FilePath& lockFilePath)\n{\n   return LinkBasedFileLock::isLockFileStale(lockFilePath);\n}\n\n} \/\/ end anonymous namespace\n\nbool LinkBasedFileLock::isLockFileStale(const FilePath& lockFilePath)\n{\n   double seconds = s_timeoutInterval.total_seconds();\n   double diff = ::difftime(::time(NULL), lockFilePath.lastWriteTime());\n   return diff >= seconds;\n}\n\nnamespace {\n\nvoid cleanStaleLockfiles(const FilePath& dir)\n{\n   std::vector<FilePath> children;\n   Error error = dir.children(&children);\n   if (error)\n      LOG_ERROR(error);\n   \n   BOOST_FOREACH(const FilePath& filePath, children)\n   {\n      if (boost::algorithm::starts_with(filePath.filename(), kFileLockPrefix) &&\n          isLockFileStale(filePath))\n      {\n         Error error = filePath.removeIfExists();\n         if (error)\n            LOG_ERROR(error);\n      }\n   }\n}\n\nclass LockRegistration : boost::noncopyable\n{\npublic:\n   \n   void registerLock(const FilePath& lockFilePath)\n   {\n      LOCK_MUTEX(mutex_)\n      {\n         registration_.insert(lockFilePath);\n      }\n      END_LOCK_MUTEX\n   }\n   \n   void deregisterLock(const FilePath& lockFilePath)\n   {\n      LOCK_MUTEX(mutex_)\n      {\n         registration_.erase(lockFilePath);\n      }\n      END_LOCK_MUTEX\n   }\n   \n   void refreshLocks()\n   {\n      LOCK_MUTEX(mutex_)\n      {\n         BOOST_FOREACH(const FilePath& lockFilePath, registration_)\n         {\n            lockFilePath.setLastWriteTime();\n         }\n      }\n      END_LOCK_MUTEX\n   }\n   \n   void clearLocks()\n   {\n      LOCK_MUTEX(mutex_)\n      {\n         BOOST_FOREACH(const FilePath& lockFilePath, registration_)\n         {\n            Error error = lockFilePath.removeIfExists();\n            if (error)\n               LOG_ERROR(error);\n         }\n         registration_.clear();\n      }\n      END_LOCK_MUTEX\n   }\n   \nprivate:\n   \n   boost::mutex mutex_;\n   std::set<FilePath> registration_;\n};\n\nLockRegistration& lockRegistration()\n{\n   static LockRegistration instance;\n   return instance;\n}\n\nError writeLockFile(const FilePath& lockFilePath)\n{\n\n#ifndef _WIN32\n\n   \/\/ generate proxy lockfile\n   FilePath proxyPath = lockFilePath.parent().complete(proxyLockFileName());\n   \n   \/\/ since the proxy lockfile should be unique, it should _never_ be possible\n   \/\/ for a collision to be found. if that does happen, it must be a leftover\n   \/\/ from a previous process that crashed in this stage\n   Error error = proxyPath.removeIfExists();\n   if (error)\n      LOG_ERROR(error);\n   \n   \/\/ ensure the proxy file is created, and remove it when we're done\n   RemoveOnExitScope scope(proxyPath, ERROR_LOCATION);\n   error = proxyPath.ensureFile();\n   if (error)\n   {\n      \/\/ log the error since it isn't expected and could get swallowed\n      \/\/ upstream by a caller ignore lock_not_available errors\n      LOG_ERROR(error);\n      return error;\n   }\n   \n   \/\/ attempt to link to the desired location -- ignore return value\n   \/\/ and just stat our original link after, as that's a more reliable\n   \/\/ indicator of success on old NFS systems\n   ::link(\n            proxyPath.absolutePathNative().c_str(),\n            lockFilePath.absolutePathNative().c_str());\n\n   struct stat info;\n   int errc = ::stat(proxyPath.absolutePathNative().c_str(), &info);\n   if (errc)\n   {\n      \/\/ log the error since it isn't expected and could get swallowed\n      \/\/ upstream by a caller ignore lock_not_available errors\n      Error error = systemError(errno, ERROR_LOCATION);\n      LOG_ERROR(error);\n      return error;\n   }\n   \n   \/\/ assume that a failure here is the result of someone else\n   \/\/ acquiring the lock before we could\n   if (info.st_nlink != 2)\n      return fileExistsError(ERROR_LOCATION);\n   \n   return Success();\n   \n#else\n\n   return systemError(boost::system::errc::function_not_supported, ERROR_LOCATION);\n\n#endif\n}\n\n} \/\/ end anonymous namespace\n\nstruct LinkBasedFileLock::Impl\n{\n   FilePath lockFilePath;\n};\n\nLinkBasedFileLock::LinkBasedFileLock()\n   : pImpl_(new Impl())\n{\n}\n\nLinkBasedFileLock::~LinkBasedFileLock()\n{\n}\n\nFilePath LinkBasedFileLock::lockFilePath() const\n{\n   return pImpl_->lockFilePath;\n}\n\nbool LinkBasedFileLock::isLocked(const FilePath& lockFilePath) const\n{\n   if (!lockFilePath.exists())\n      return false;\n   \n   return !isLockFileStale(lockFilePath);\n}\n\nError LinkBasedFileLock::acquire(const FilePath& lockFilePath)\n{\n   \/\/ if the lock file exists...\n   if (lockFilePath.exists())\n   {\n      \/\/ ... and it's stale, it's a leftover lock from a previously\n      \/\/ (crashed?) process. remove it and acquire our own lock\n      if (isLockFileStale(lockFilePath))\n      {\n         \/\/ note that multiple processes may attempt to remove this\n         \/\/ file at the same time, so errors shouldn't be fatal\n         Error error = lockFilePath.remove();\n         if (error)\n            LOG_ERROR(error);\n      }\n      \n      \/\/ ... it's not stale -- someone else has the lock, cannot proceed\n      else\n      {\n         return systemError(boost::system::errc::no_lock_available,\n                            ERROR_LOCATION);\n      }\n   }\n   \n   \/\/ ensure the parent directory exists\n   Error error = lockFilePath.parent().ensureDirectory();\n   if (error)\n      return error;\n\n   \/\/ write the lock file -- this step _must_ be atomic and so only one\n   \/\/ competing process should be able to succeed here\n   error = writeLockFile(lockFilePath);\n   if (error)\n   {\n      return systemError(boost::system::errc::no_lock_available,\n                         error,\n                         ERROR_LOCATION);\n   }\n\n   \/\/ clean any other stale lockfiles in that directory\n   cleanStaleLockfiles(lockFilePath.parent());\n   \n   \/\/ register our lock (for refresh)\n   pImpl_->lockFilePath = lockFilePath;\n   lockRegistration().registerLock(lockFilePath);\n   return Success();\n}\n\nError LinkBasedFileLock::release()\n{\n   const FilePath& lockFilePath = pImpl_->lockFilePath;\n   \n   Error error = lockFilePath.remove();\n   if (error)\n      LOG_ERROR(error);\n   \n   pImpl_->lockFilePath = FilePath();\n   lockRegistration().deregisterLock(lockFilePath);\n   return error;\n}\n\nvoid LinkBasedFileLock::refresh()\n{\n   lockRegistration().refreshLocks();\n}\n\nvoid LinkBasedFileLock::cleanUp()\n{\n   lockRegistration().clearLocks();\n}\n\n} \/\/ namespace core\n} \/\/ namespace rstudio\n<commit_msg>debug logging for link based file locks<commit_after>\/*\n * LinkBasedFileLock.cpp\n *\n * Copyright (C) 2009-12 by RStudio, Inc.\n *\n * Unless you have received this program directly from RStudio pursuant\n * to the terms of a commercial license agreement with RStudio, then\n * this program is licensed to you under the terms of version 3 of the\n * GNU Affero General Public License. This program is distributed WITHOUT\n * ANY EXPRESS OR IMPLIED WARRANTY, INCLUDING THOSE OF NON-INFRINGEMENT,\n * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Please refer to the\n * AGPL (http:\/\/www.gnu.org\/licenses\/agpl-3.0.txt) for more details.\n *\n *\/\n\n#include <core\/FileLock.hpp>\n\n#include <errno.h>\n\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n#include <fcntl.h>\n\n#include <set>\n#include <vector>\n\n\/\/ #define RSTUDIO_ENABLE_DEBUG_MACROS\n#define RSTUDIO_DEBUG_LABEL \"linklock\"\n#include <core\/Macros.hpp>\n\n#ifdef RSTUDIO_ENABLE_DEBUG_MACROS\n# define DEBUG_PID(__X__) DEBUG(\"[PID: \" << ::getpid() << \"]: \" << __X__);\n#else\n# define DEBUG_PID(__X__)\n#endif\n\n#include <core\/SafeConvert.hpp>\n#include <core\/Algorithm.hpp>\n#include <core\/Thread.hpp>\n#include <core\/Error.hpp>\n#include <core\/Log.hpp>\n#include <core\/FilePath.hpp>\n#include <core\/FileSerializer.hpp>\n#include <core\/system\/System.hpp>\n\n#include <boost\/foreach.hpp>\n#include <boost\/system\/error_code.hpp>\n\nnamespace rstudio {\nnamespace core {\n\nnamespace {\n\nconst char * const kFileLockPrefix =\n      \".rstudio-lock-41c29\";\n\nstd::string pidString()\n{\n   PidType pid = system::currentProcessId();\n   return safe_convert::numberToString((long) pid);\n}\n\nstd::string hostName()\n{\n   char buffer[256];\n   int status = ::gethostname(buffer, 255);\n   if (status)\n      LOG_ERROR(systemError(errno, ERROR_LOCATION));\n   return std::string(buffer);\n}\n\nstd::string threadId()\n{\n   std::stringstream ss;\n   ss << boost::this_thread::get_id();\n   return ss.str();\n}\n\nstd::string proxyLockFileName()\n{\n   return std::string()\n         + kFileLockPrefix\n         + \"-\" + hostName()\n         + \"-\" + pidString()\n         + \"-\" + threadId();\n         \n}\n\nbool isLockFileStale(const FilePath& lockFilePath)\n{\n   return LinkBasedFileLock::isLockFileStale(lockFilePath);\n}\n\n} \/\/ end anonymous namespace\n\nbool LinkBasedFileLock::isLockFileStale(const FilePath& lockFilePath)\n{\n   double seconds = s_timeoutInterval.total_seconds();\n   double diff = ::difftime(::time(NULL), lockFilePath.lastWriteTime());\n   return diff >= seconds;\n}\n\nnamespace {\n\nvoid cleanStaleLockfiles(const FilePath& dir)\n{\n   std::vector<FilePath> children;\n   Error error = dir.children(&children);\n   if (error)\n      LOG_ERROR(error);\n   \n   BOOST_FOREACH(const FilePath& filePath, children)\n   {\n      if (boost::algorithm::starts_with(filePath.filename(), kFileLockPrefix) &&\n          isLockFileStale(filePath))\n      {\n         Error error = filePath.removeIfExists();\n         if (error)\n            LOG_ERROR(error);\n      }\n   }\n}\n\nclass LockRegistration : boost::noncopyable\n{\npublic:\n   \n   void registerLock(const FilePath& lockFilePath)\n   {\n      LOCK_MUTEX(mutex_)\n      {\n         registration_.insert(lockFilePath);\n      }\n      END_LOCK_MUTEX\n   }\n   \n   void deregisterLock(const FilePath& lockFilePath)\n   {\n      LOCK_MUTEX(mutex_)\n      {\n         registration_.erase(lockFilePath);\n      }\n      END_LOCK_MUTEX\n   }\n   \n   void refreshLocks()\n   {\n      LOCK_MUTEX(mutex_)\n      {\n         BOOST_FOREACH(const FilePath& lockFilePath, registration_)\n         {\n            DEBUG_PID(\"Bumping write time: \" << lockFilePath.absolutePath());\n            lockFilePath.setLastWriteTime();\n         }\n      }\n      END_LOCK_MUTEX\n   }\n   \n   void clearLocks()\n   {\n      LOCK_MUTEX(mutex_)\n      {\n         BOOST_FOREACH(const FilePath& lockFilePath, registration_)\n         {\n            Error error = lockFilePath.removeIfExists();\n            if (error)\n               LOG_ERROR(error);\n            DEBUG_PID(\"Clearing lock: \" << lockFilePath.absolutePath());\n         }\n         registration_.clear();\n      }\n      END_LOCK_MUTEX\n   }\n   \nprivate:\n   \n   boost::mutex mutex_;\n   std::set<FilePath> registration_;\n};\n\nLockRegistration& lockRegistration()\n{\n   static LockRegistration instance;\n   return instance;\n}\n\nError writeLockFile(const FilePath& lockFilePath)\n{\n\n#ifndef _WIN32\n\n   \/\/ generate proxy lockfile\n   FilePath proxyPath = lockFilePath.parent().complete(proxyLockFileName());\n   \n   \/\/ since the proxy lockfile should be unique, it should _never_ be possible\n   \/\/ for a collision to be found. if that does happen, it must be a leftover\n   \/\/ from a previous process that crashed in this stage\n   Error error = proxyPath.removeIfExists();\n   if (error)\n      LOG_ERROR(error);\n   \n   \/\/ ensure the proxy file is created, and remove it when we're done\n   RemoveOnExitScope scope(proxyPath, ERROR_LOCATION);\n   error = proxyPath.ensureFile();\n   if (error)\n   {\n      \/\/ log the error since it isn't expected and could get swallowed\n      \/\/ upstream by a caller ignore lock_not_available errors\n      LOG_ERROR(error);\n      return error;\n   }\n   \n   \/\/ attempt to link to the desired location -- ignore return value\n   \/\/ and just stat our original link after, as that's a more reliable\n   \/\/ indicator of success on old NFS systems\n   int status = ::link(\n            proxyPath.absolutePathNative().c_str(),\n            lockFilePath.absolutePathNative().c_str());\n   \n   \/\/ Log errors (remove this if it is too noisy on NFS)\n   if (status == -1)\n      LOG_ERROR(systemError(errno, ERROR_LOCATION));\n\n   struct stat info;\n   int errc = ::stat(proxyPath.absolutePathNative().c_str(), &info);\n   if (errc)\n   {\n      \/\/ log the error since it isn't expected and could get swallowed\n      \/\/ upstream by a caller ignoring lock_not_available errors\n      Error error = systemError(errno, ERROR_LOCATION);\n      LOG_ERROR(error);\n      return error;\n   }\n   \n   \/\/ assume that a failure here is the result of someone else\n   \/\/ acquiring the lock before we could\n   if (info.st_nlink != 2)\n      return fileExistsError(ERROR_LOCATION);\n   \n   return Success();\n   \n#else\n\n   return systemError(boost::system::errc::function_not_supported, ERROR_LOCATION);\n\n#endif\n}\n\n} \/\/ end anonymous namespace\n\nstruct LinkBasedFileLock::Impl\n{\n   FilePath lockFilePath;\n};\n\nLinkBasedFileLock::LinkBasedFileLock()\n   : pImpl_(new Impl())\n{\n}\n\nLinkBasedFileLock::~LinkBasedFileLock()\n{\n}\n\nFilePath LinkBasedFileLock::lockFilePath() const\n{\n   return pImpl_->lockFilePath;\n}\n\nbool LinkBasedFileLock::isLocked(const FilePath& lockFilePath) const\n{\n   if (!lockFilePath.exists())\n      return false;\n   \n   return !isLockFileStale(lockFilePath);\n}\n\nError LinkBasedFileLock::acquire(const FilePath& lockFilePath)\n{\n   \/\/ if the lock file exists...\n   if (lockFilePath.exists())\n   {\n      \/\/ ... and it's stale, it's a leftover lock from a previously\n      \/\/ (crashed?) process. remove it and acquire our own lock\n      if (isLockFileStale(lockFilePath))\n      {\n         \/\/ note that multiple processes may attempt to remove this\n         \/\/ file at the same time, so errors shouldn't be fatal\n         DEBUG_PID(\"Removing stale lockfile: \" << lockFilePath.absolutePath());\n         Error error = lockFilePath.remove();\n         if (error)\n            LOG_ERROR(error);\n      }\n      \n      \/\/ ... it's not stale -- someone else has the lock, cannot proceed\n      else\n      {\n         DEBUG_PID(\"No lock available: \" << lockFilePath.absolutePath());\n         return systemError(boost::system::errc::no_lock_available,\n                            ERROR_LOCATION);\n      }\n   }\n   \n   \/\/ ensure the parent directory exists\n   Error error = lockFilePath.parent().ensureDirectory();\n   if (error)\n      return error;\n\n   \/\/ write the lock file -- this step _must_ be atomic and so only one\n   \/\/ competing process should be able to succeed here\n   error = writeLockFile(lockFilePath);\n   if (error)\n   {\n      DEBUG_PID(\"Failed to acquire lock (lost race?): \" << lockFilePath.absolutePath());\n      return systemError(boost::system::errc::no_lock_available,\n                         error,\n                         ERROR_LOCATION);\n   }\n\n   \/\/ clean any other stale lockfiles in that directory\n   cleanStaleLockfiles(lockFilePath.parent());\n   \n   \/\/ register our lock (for refresh)\n   pImpl_->lockFilePath = lockFilePath;\n   lockRegistration().registerLock(lockFilePath);\n   DEBUG_PID(\"Acquired lock: \" << lockFilePath.absolutePath());\n   return Success();\n}\n\nError LinkBasedFileLock::release()\n{\n   const FilePath& lockFilePath = pImpl_->lockFilePath;\n   DEBUG_PID(\"Released lock: \" << lockFilePath.absolutePath());\n   \n   Error error = lockFilePath.remove();\n   if (error)\n      LOG_ERROR(error);\n   \n   pImpl_->lockFilePath = FilePath();\n   lockRegistration().deregisterLock(lockFilePath);\n   return error;\n}\n\nvoid LinkBasedFileLock::refresh()\n{\n   DEBUG_PID(\"Refreshing locks...\");\n   lockRegistration().refreshLocks();\n}\n\nvoid LinkBasedFileLock::cleanUp()\n{\n   DEBUG_PID(\"Cleaning stale locks...\");\n   lockRegistration().clearLocks();\n}\n\n} \/\/ namespace core\n} \/\/ namespace rstudio\n<|endoftext|>"}
{"text":"<commit_before>\/** ==========================================================================\n * 2011 by KjellKod.cc. This is PUBLIC DOMAIN to use at your own risk and comes\n * with no warranties. This code is yours to share, use and modify with no\n * strings attached and no restrictions or obligations.\n *\n * For more information see g3log\/LICENSE or refer refer to http:\/\/unlicense.org\n * ============================================================================\n *\n * Filename:g3log.hpp  Framework for Logging and Design By Contract\n * Created: 2011 by Kjell Hedström\n *\n * PUBLIC DOMAIN and Not copywrited since it was built on public-domain software and influenced\n * at least in \"spirit\" from the following sources\n * 1. kjellkod.cc ;)\n * 2. Dr.Dobbs, Petru Marginean:  http:\/\/drdobbs.com\/article\/printableArticle.jhtml?articleId=201804215&dept_url=\/caddpp\/\n * 3. Dr.Dobbs, Michael Schulze: http:\/\/drdobbs.com\/article\/printableArticle.jhtml?articleId=225700666&dept_url=\/cpp\/\n * 4. Google 'glog': http:\/\/google-glog.googlecode.com\/svn\/trunk\/doc\/glog.html\n * 5. Various Q&A at StackOverflow\n * ********************************************* *\/\n\n\n#pragma once\n\n#include \"g3log\/loglevels.hpp\"\n#include \"g3log\/logcapture.hpp\"\n#include \"g3log\/logmessage.hpp\"\n\n#include <string>\n#include <functional>\n\n\n#if !(defined(__PRETTY_FUNCTION__))\n#define __PRETTY_FUNCTION__   __FUNCTION__\n#endif\n\n\/\/ thread_local doesn't exist before VS2013\n\/\/ it exists on VS2015\n#if !(defined(thread_local)) && defined(_MSC_VER) && _MSC_VER < 1900\n#define thread_local __declspec(thread)\n#endif\n\n\n\/** namespace for LOG() and CHECK() frameworks\n * History lesson:   Why the names 'g3' and 'g3log'?:\n * The framework was made in my own free time as PUBLIC DOMAIN but the\n * first commercial project to use it used 'g3' as an internal denominator for\n * the current project. g3 as in 'generation 2'. I decided to keep the g3 and g3log names\n * to give credit to the people in that project (you know who you are :) and I guess also\n * for 'sentimental' reasons. That a big influence was google's glog is just a happy\n *  concidence or subconscious choice. Either way g3log became the name for this logger.\n *\n * --- Thanks for a great 2011 and good luck with 'g3' --- KjellKod\n *\/\nnamespace g3 {\n   class LogWorker;\n   struct LogMessage;\n   struct FatalMessage;\n\n   \/** Should be called at very first startup of the software with \\ref g3LogWorker\n    *  pointer. Ownership of the \\ref g3LogWorker is the responsibilkity of the caller *\/\n   void initializeLogging(LogWorker *logger);\n\n\n   \/** setFatalPreLoggingHook() provides an optional extra step before the fatalExitHandler is called\n    *\n    * Set a function-hook before a fatal message will be sent to the logger\n    * i.e. this is a great place to put a break point, either in your debugger\n    * or programatically to catch LOG(FATAL), CHECK(...) or an OS fatal event (exception or signal)\n    * This will be reset to default (does nothing) at initializeLogging(...);\n    *\n    * Example usage:\n    * Windows: g3::setFatalPreLoggingHook([]{__debugbreak();}); \/\/ remember #include <intrin.h>\n    *         WARNING: '__debugbreak()' when not running in Debug in your Visual Studio IDE will likely\n    *                   trigger a recursive crash if used here. It should only be used when debugging\n    *                   in your Visual Studio IDE. Recursive crashes are handled but are unnecessary.\n    *\n    * Linux:   g3::setFatalPreLoggingHook([]{ raise(SIGTRAP); });\n    *\/\n   void setFatalPreLoggingHook(std::function<void(void)>  pre_fatal_hook);\n\n   \/** If the @ref setFatalPreLoggingHook is not enough and full fatal exit handling is needed then\n    * use \"setFatalExithandler\".  Please see g3log.cpp and crashhandler_windows.cpp or crashhandler_unix for\n    * example of restoring signal and exception handlers, flushing the log and shutting down.\n    *\/\n   void setFatalExitHandler(std::function<void(FatalMessagePtr)> fatal_call);\n\n\n\n\n   \/\/ internal namespace is for completely internal or semi-hidden from the g3 namespace due to that it is unlikely\n   \/\/ that you will use these\n   namespace internal {\n      \/\/\/ @returns true if logger is initialized\n      bool isLoggingInitialized();\n\n      \/\/ Save the created LogMessage to any existing sinks\n      void saveMessage(const char *message, const char *file, int line, const char *function, const LEVELS &level,\n                       const char *boolean_expression, int fatal_signal, const char *stack_trace);\n\n      \/\/ forwards the message to all sinks\n      void pushMessageToLogger(LogMessagePtr log_entry);\n\n\n      \/\/ forwards a FATAL message to all sinks,. after which the g3logworker\n      \/\/ will trigger crashhandler \/ g3::internal::exitWithDefaultSignalHandler\n      \/\/\n      \/\/ By default the \"fatalCall\" will forward a Fatalessageptr to this function\n      \/\/ this behaviour can be changed if you set a different fatal handler through\n      \/\/ \"setFatalExitHandler\"\n      void pushFatalMessageToLogger(FatalMessagePtr message);\n\n\n      \/\/ Save the created FatalMessage to any existing sinks and exit with\n      \/\/ the originating fatal signal,. or SIGABRT if it originated from a broken contract\n      \/\/ By default forwards to: pushFatalMessageToLogger, see \"setFatalExitHandler\" to override\n      \/\/\n      \/\/ If you override it then you probably want to call \"pushFatalMessageToLogger\" after your\n      \/\/ custom fatal handler is done. This will make sure that the fatal message the pushed\n      \/\/ to sinks as well as shutting down the process\n      void fatalCall(FatalMessagePtr message);\n\n      \/\/ Shuts down logging. No object cleanup but further LOG(...) calls will be ignored.\n      void shutDownLogging();\n\n      \/\/ Shutdown logging, but ONLY if the active logger corresponds to the one currently initialized\n      bool shutDownLoggingForActiveOnly(LogWorker *active);\n\n   } \/\/ internal\n} \/\/ g3\n\n#define INTERNAL_LOG_MESSAGE(level) LogCapture(__FILE__, __LINE__, __PRETTY_FUNCTION__, level)\n\n#define INTERNAL_CONTRACT_MESSAGE(boolean_expression)  \\\n   LogCapture(__FILE__, __LINE__, __PRETTY_FUNCTION__, g3::internal::CONTRACT, boolean_expression)\n\n\n\/\/ LOG(level) is the API for the stream log\n#define LOG(level) if(g3::logLevel(level)) INTERNAL_LOG_MESSAGE(level).stream()\n\n\n\/\/ 'Conditional' stream log\n#define LOG_IF(level, boolean_expression)  \\\n   if(true == boolean_expression)  \\\n      if(g3::logLevel(level))  INTERNAL_LOG_MESSAGE(level).stream()\n\n\/\/ 'Design By Contract' stream API. For Broken Contracts:\n\/\/         unit testing: it will throw std::runtime_error when a contract breaks\n\/\/         I.R.L : it will exit the application by using fatal signal SIGABRT\n#define CHECK(boolean_expression)        \\\n   if (false == (boolean_expression))  INTERNAL_CONTRACT_MESSAGE(#boolean_expression).stream()\n\n\n\/** For details please see this\n * REFERENCE: http:\/\/www.cppreference.com\/wiki\/io\/c\/printf_format\n * \\verbatim\n *\n  There are different %-codes for different variable types, as well as options to\n    limit the length of the variables and whatnot.\n    Code Format\n    %[flags][width][.precision][length]specifier\n SPECIFIERS\n ----------\n %c character\n %d signed integers\n %i signed integers\n %e scientific notation, with a lowercase “e”\n %E scientific notation, with a uppercase “E”\n %f floating point\n %g use %e or %f, whichever is shorter\n %G use %E or %f, whichever is shorter\n %o octal\n %s a string of characters\n %u unsigned integer\n %x unsigned hexadecimal, with lowercase letters\n %X unsigned hexadecimal, with uppercase letters\n %p a pointer\n %n the argument shall be a pointer to an integer into which is placed the number of characters written so far\n\nFor flags, width, precision etc please see the above references.\nEXAMPLES:\n{\n   LOGF(INFO, \"Characters: %c %c \\n\", 'a', 65);\n   LOGF(INFO, \"Decimals: %d %ld\\n\", 1977, 650000L);      \/\/ printing long\n   LOGF(INFO, \"Preceding with blanks: %10d \\n\", 1977);\n   LOGF(INFO, \"Preceding with zeros: %010d \\n\", 1977);\n   LOGF(INFO, \"Some different radixes: %d %x %o %#x %#o \\n\", 100, 100, 100, 100, 100);\n   LOGF(INFO, \"floats: %4.2f %+.0e %E \\n\", 3.1416, 3.1416, 3.1416);\n   LOGF(INFO, \"Width trick: %*d \\n\", 5, 10);\n   LOGF(INFO, \"%s \\n\", \"A string\");\n   return 0;\n}\nAnd here is possible output\n:      Characters: a A\n:      Decimals: 1977 650000\n:      Preceding with blanks:       1977\n:      Preceding with zeros: 0000001977\n:      Some different radixes: 100 64 144 0x64 0144\n:      floats: 3.14 +3e+000 3.141600E+000\n:      Width trick:    10\n:      A string  \\endverbatim *\/\n#define LOGF(level, printf_like_message, ...)                 \\\n   if(g3::logLevel(level)) INTERNAL_LOG_MESSAGE(level).capturef(printf_like_message, ##__VA_ARGS__)\n\n\/\/ Conditional log printf syntax\n#define LOGF_IF(level,boolean_expression, printf_like_message, ...) \\\n   if(true == boolean_expression)                                     \\\n      if(g3::logLevel(level))  INTERNAL_LOG_MESSAGE(level).capturef(printf_like_message, ##__VA_ARGS__)\n\n\/\/ Design By Contract, printf-like API syntax with variadic input parameters.\n\/\/ Throws std::runtime_eror if contract breaks\n#define CHECKF(boolean_expression, printf_like_message, ...)    \\\n   if (false == (boolean_expression))  INTERNAL_CONTRACT_MESSAGE(#boolean_expression).capturef(printf_like_message, ##__VA_ARGS__)\n\n\/\/ Backwards compatible. The same as CHECKF. \n\/\/ Design By Contract, printf-like API syntax with variadic input parameters.\n\/\/ Throws std::runtime_eror if contract breaks\n#define CHECK_F(boolean_expression, printf_like_message, ...)    \\\n   if (false == (boolean_expression))  INTERNAL_CONTRACT_MESSAGE(#boolean_expression).capturef(printf_like_message, ##__VA_ARGS__)\n\n\n<commit_msg>Cast char array to pointer to char in INTERNAL_LOG_MESSAGE (#193)<commit_after>\/** ==========================================================================\n * 2011 by KjellKod.cc. This is PUBLIC DOMAIN to use at your own risk and comes\n * with no warranties. This code is yours to share, use and modify with no\n * strings attached and no restrictions or obligations.\n *\n * For more information see g3log\/LICENSE or refer refer to http:\/\/unlicense.org\n * ============================================================================\n *\n * Filename:g3log.hpp  Framework for Logging and Design By Contract\n * Created: 2011 by Kjell Hedström\n *\n * PUBLIC DOMAIN and Not copywrited since it was built on public-domain software and influenced\n * at least in \"spirit\" from the following sources\n * 1. kjellkod.cc ;)\n * 2. Dr.Dobbs, Petru Marginean:  http:\/\/drdobbs.com\/article\/printableArticle.jhtml?articleId=201804215&dept_url=\/caddpp\/\n * 3. Dr.Dobbs, Michael Schulze: http:\/\/drdobbs.com\/article\/printableArticle.jhtml?articleId=225700666&dept_url=\/cpp\/\n * 4. Google 'glog': http:\/\/google-glog.googlecode.com\/svn\/trunk\/doc\/glog.html\n * 5. Various Q&A at StackOverflow\n * ********************************************* *\/\n\n\n#pragma once\n\n#include \"g3log\/loglevels.hpp\"\n#include \"g3log\/logcapture.hpp\"\n#include \"g3log\/logmessage.hpp\"\n\n#include <string>\n#include <functional>\n\n\n#if !(defined(__PRETTY_FUNCTION__))\n#define __PRETTY_FUNCTION__   __FUNCTION__\n#endif\n\n\/\/ thread_local doesn't exist before VS2013\n\/\/ it exists on VS2015\n#if !(defined(thread_local)) && defined(_MSC_VER) && _MSC_VER < 1900\n#define thread_local __declspec(thread)\n#endif\n\n\n\/** namespace for LOG() and CHECK() frameworks\n * History lesson:   Why the names 'g3' and 'g3log'?:\n * The framework was made in my own free time as PUBLIC DOMAIN but the\n * first commercial project to use it used 'g3' as an internal denominator for\n * the current project. g3 as in 'generation 2'. I decided to keep the g3 and g3log names\n * to give credit to the people in that project (you know who you are :) and I guess also\n * for 'sentimental' reasons. That a big influence was google's glog is just a happy\n *  concidence or subconscious choice. Either way g3log became the name for this logger.\n *\n * --- Thanks for a great 2011 and good luck with 'g3' --- KjellKod\n *\/\nnamespace g3 {\n   class LogWorker;\n   struct LogMessage;\n   struct FatalMessage;\n\n   \/** Should be called at very first startup of the software with \\ref g3LogWorker\n    *  pointer. Ownership of the \\ref g3LogWorker is the responsibilkity of the caller *\/\n   void initializeLogging(LogWorker *logger);\n\n\n   \/** setFatalPreLoggingHook() provides an optional extra step before the fatalExitHandler is called\n    *\n    * Set a function-hook before a fatal message will be sent to the logger\n    * i.e. this is a great place to put a break point, either in your debugger\n    * or programatically to catch LOG(FATAL), CHECK(...) or an OS fatal event (exception or signal)\n    * This will be reset to default (does nothing) at initializeLogging(...);\n    *\n    * Example usage:\n    * Windows: g3::setFatalPreLoggingHook([]{__debugbreak();}); \/\/ remember #include <intrin.h>\n    *         WARNING: '__debugbreak()' when not running in Debug in your Visual Studio IDE will likely\n    *                   trigger a recursive crash if used here. It should only be used when debugging\n    *                   in your Visual Studio IDE. Recursive crashes are handled but are unnecessary.\n    *\n    * Linux:   g3::setFatalPreLoggingHook([]{ raise(SIGTRAP); });\n    *\/\n   void setFatalPreLoggingHook(std::function<void(void)>  pre_fatal_hook);\n\n   \/** If the @ref setFatalPreLoggingHook is not enough and full fatal exit handling is needed then\n    * use \"setFatalExithandler\".  Please see g3log.cpp and crashhandler_windows.cpp or crashhandler_unix for\n    * example of restoring signal and exception handlers, flushing the log and shutting down.\n    *\/\n   void setFatalExitHandler(std::function<void(FatalMessagePtr)> fatal_call);\n\n\n\n\n   \/\/ internal namespace is for completely internal or semi-hidden from the g3 namespace due to that it is unlikely\n   \/\/ that you will use these\n   namespace internal {\n      \/\/\/ @returns true if logger is initialized\n      bool isLoggingInitialized();\n\n      \/\/ Save the created LogMessage to any existing sinks\n      void saveMessage(const char *message, const char *file, int line, const char *function, const LEVELS &level,\n                       const char *boolean_expression, int fatal_signal, const char *stack_trace);\n\n      \/\/ forwards the message to all sinks\n      void pushMessageToLogger(LogMessagePtr log_entry);\n\n\n      \/\/ forwards a FATAL message to all sinks,. after which the g3logworker\n      \/\/ will trigger crashhandler \/ g3::internal::exitWithDefaultSignalHandler\n      \/\/\n      \/\/ By default the \"fatalCall\" will forward a Fatalessageptr to this function\n      \/\/ this behaviour can be changed if you set a different fatal handler through\n      \/\/ \"setFatalExitHandler\"\n      void pushFatalMessageToLogger(FatalMessagePtr message);\n\n\n      \/\/ Save the created FatalMessage to any existing sinks and exit with\n      \/\/ the originating fatal signal,. or SIGABRT if it originated from a broken contract\n      \/\/ By default forwards to: pushFatalMessageToLogger, see \"setFatalExitHandler\" to override\n      \/\/\n      \/\/ If you override it then you probably want to call \"pushFatalMessageToLogger\" after your\n      \/\/ custom fatal handler is done. This will make sure that the fatal message the pushed\n      \/\/ to sinks as well as shutting down the process\n      void fatalCall(FatalMessagePtr message);\n\n      \/\/ Shuts down logging. No object cleanup but further LOG(...) calls will be ignored.\n      void shutDownLogging();\n\n      \/\/ Shutdown logging, but ONLY if the active logger corresponds to the one currently initialized\n      bool shutDownLoggingForActiveOnly(LogWorker *active);\n\n   } \/\/ internal\n} \/\/ g3\n\n#define INTERNAL_LOG_MESSAGE(level) LogCapture(__FILE__, __LINE__, static_cast<const char*>(__PRETTY_FUNCTION__), level)\n\n#define INTERNAL_CONTRACT_MESSAGE(boolean_expression)  \\\n   LogCapture(__FILE__, __LINE__, __PRETTY_FUNCTION__, g3::internal::CONTRACT, boolean_expression)\n\n\n\/\/ LOG(level) is the API for the stream log\n#define LOG(level) if(g3::logLevel(level)) INTERNAL_LOG_MESSAGE(level).stream()\n\n\n\/\/ 'Conditional' stream log\n#define LOG_IF(level, boolean_expression)  \\\n   if(true == boolean_expression)  \\\n      if(g3::logLevel(level))  INTERNAL_LOG_MESSAGE(level).stream()\n\n\/\/ 'Design By Contract' stream API. For Broken Contracts:\n\/\/         unit testing: it will throw std::runtime_error when a contract breaks\n\/\/         I.R.L : it will exit the application by using fatal signal SIGABRT\n#define CHECK(boolean_expression)        \\\n   if (false == (boolean_expression))  INTERNAL_CONTRACT_MESSAGE(#boolean_expression).stream()\n\n\n\/** For details please see this\n * REFERENCE: http:\/\/www.cppreference.com\/wiki\/io\/c\/printf_format\n * \\verbatim\n *\n  There are different %-codes for different variable types, as well as options to\n    limit the length of the variables and whatnot.\n    Code Format\n    %[flags][width][.precision][length]specifier\n SPECIFIERS\n ----------\n %c character\n %d signed integers\n %i signed integers\n %e scientific notation, with a lowercase “e”\n %E scientific notation, with a uppercase “E”\n %f floating point\n %g use %e or %f, whichever is shorter\n %G use %E or %f, whichever is shorter\n %o octal\n %s a string of characters\n %u unsigned integer\n %x unsigned hexadecimal, with lowercase letters\n %X unsigned hexadecimal, with uppercase letters\n %p a pointer\n %n the argument shall be a pointer to an integer into which is placed the number of characters written so far\n\nFor flags, width, precision etc please see the above references.\nEXAMPLES:\n{\n   LOGF(INFO, \"Characters: %c %c \\n\", 'a', 65);\n   LOGF(INFO, \"Decimals: %d %ld\\n\", 1977, 650000L);      \/\/ printing long\n   LOGF(INFO, \"Preceding with blanks: %10d \\n\", 1977);\n   LOGF(INFO, \"Preceding with zeros: %010d \\n\", 1977);\n   LOGF(INFO, \"Some different radixes: %d %x %o %#x %#o \\n\", 100, 100, 100, 100, 100);\n   LOGF(INFO, \"floats: %4.2f %+.0e %E \\n\", 3.1416, 3.1416, 3.1416);\n   LOGF(INFO, \"Width trick: %*d \\n\", 5, 10);\n   LOGF(INFO, \"%s \\n\", \"A string\");\n   return 0;\n}\nAnd here is possible output\n:      Characters: a A\n:      Decimals: 1977 650000\n:      Preceding with blanks:       1977\n:      Preceding with zeros: 0000001977\n:      Some different radixes: 100 64 144 0x64 0144\n:      floats: 3.14 +3e+000 3.141600E+000\n:      Width trick:    10\n:      A string  \\endverbatim *\/\n#define LOGF(level, printf_like_message, ...)                 \\\n   if(g3::logLevel(level)) INTERNAL_LOG_MESSAGE(level).capturef(printf_like_message, ##__VA_ARGS__)\n\n\/\/ Conditional log printf syntax\n#define LOGF_IF(level,boolean_expression, printf_like_message, ...) \\\n   if(true == boolean_expression)                                     \\\n      if(g3::logLevel(level))  INTERNAL_LOG_MESSAGE(level).capturef(printf_like_message, ##__VA_ARGS__)\n\n\/\/ Design By Contract, printf-like API syntax with variadic input parameters.\n\/\/ Throws std::runtime_eror if contract breaks\n#define CHECKF(boolean_expression, printf_like_message, ...)    \\\n   if (false == (boolean_expression))  INTERNAL_CONTRACT_MESSAGE(#boolean_expression).capturef(printf_like_message, ##__VA_ARGS__)\n\n\/\/ Backwards compatible. The same as CHECKF. \n\/\/ Design By Contract, printf-like API syntax with variadic input parameters.\n\/\/ Throws std::runtime_eror if contract breaks\n#define CHECK_F(boolean_expression, printf_like_message, ...)    \\\n   if (false == (boolean_expression))  INTERNAL_CONTRACT_MESSAGE(#boolean_expression).capturef(printf_like_message, ##__VA_ARGS__)\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2015 Microsoft\n#include \"multiverso\/table\/sparse_matrix_table.h\"\n#include <vector>\n#include <cctype>\n\n#include \"multiverso\/multiverso.h\"\n#include \"multiverso\/util\/log.h\"\n#include \"multiverso\/util\/quantization_util.h\"\n#include \"multiverso\/updater\/updater.h\"\n\nnamespace multiverso {\n\n\/\/ get whole table, data is user-allocated memory\ntemplate <typename T>\nvoid SparseMatrixWorkerTable<T>::Get(T* data, size_t size,\n  const GeneralOption* option) {\n  CHECK(size == num_col_ * num_row_);\n  int whole_table = -1;\n  Get(whole_table, data, size, option);\n}\n\n\/\/ data is user-allocated memory\ntemplate <typename T>\nvoid SparseMatrixWorkerTable<T>::Get(int row_id, T* data, size_t size,\n  const GeneralOption* option) {\n  if (row_id >= 0) CHECK(size == num_col_);\n  for (auto i = 0; i < num_row_ + 1; ++i) row_index_[i] = nullptr;\n  if (row_id == -1) {\n    row_index_[num_row_] = data;\n  } else {\n    row_index_[row_id] = data; \/\/ data_ = data;\n  }\n  Blob keys(&row_id, sizeof(int) * 1);\n\n  if (option == nullptr){\n    option = new GeneralOption();\n  }\n\n  WorkerTable::Get(keys, option);\n  Log::Debug(\"[Get] worker = %d, #row = %d\\n\", MV_Rank(), row_id);\n}\n\ntemplate <typename T>\nvoid SparseMatrixWorkerTable<T>::Get(const std::vector<int>& row_ids,\n  const std::vector<T*>& data_vec, size_t size, \n  const GeneralOption* option) {\n  for (auto i = 0; i < num_row_ + 1; ++i) row_index_[i] = nullptr;\n  CHECK(size == num_col_);\n  CHECK(row_ids.size() == data_vec.size());\n  for (int i = 0; i < row_ids.size(); ++i) {\n    row_index_[row_ids[i]] = data_vec[i];\n  }\n  Blob keys(row_ids.data(), sizeof(int) * row_ids.size());\n\n  if (option == nullptr){\n    option = new GeneralOption();\n  }\n\n  WorkerTable::Get(keys, option);\n  Log::Debug(\"[Get] worker = %d, #rows_set = %d\\n\", MV_Rank(),\n    row_ids.size());\n}\n\ntemplate <typename T>\nint SparseMatrixWorkerTable<T>::Partition(const std::vector<Blob>& kv,\n  std::unordered_map<int, std::vector<Blob>>* out) {\n  int res;\n  CHECK(kv.size() == 1 || kv.size() == 2 || kv.size() == 3);\n  CHECK_NOTNULL(out);\n\n  if (kv.size() == 2) {\n    size_t keys_size = kv[0].size<int>();\n    int *keys = reinterpret_cast<int*>(kv[0].data());\n    if (keys[0] == -1) {\n      for (int i = 0; i < server_offsets_.size() - 1; ++i) {\n        int rank = MV_ServerIdToRank(i);\n        (*out)[rank].push_back(kv[0]);\n      }\n\n      for (int i = 0; i < server_offsets_.size() - 1; ++i){\n        int rank = MV_ServerIdToRank(i);\n        if (kv.size() == 2) {\/\/ general option blob\n          (*out)[rank].push_back(kv[1]);\n        }\n      }\n\n      CHECK(get_reply_count_ == 0);\n      get_reply_count_ = static_cast<int>(out->size());\n      res = static_cast<int>(out->size());\n    } else {\n      \/\/ count row number in each server\n      std::unordered_map<int, int> count;\n      std::vector<int> dest;\n      int actual_num_server = static_cast<int>(server_offsets_.size() - 1);\n      int num_row_each = num_row_ \/ actual_num_server;  \/\/  num_server_;\n      for (int i = 0; i < keys_size; ++i) {\n        int dst = keys[i] \/ num_row_each;\n        dst = (dst == actual_num_server ? dst - 1 : dst);\n        dest.push_back(dst);\n        ++count[dst];\n      }\n\n      for (auto& it : count) {  \/\/ Allocate memory\n        int rank = MV_ServerIdToRank(it.first);\n        std::vector<Blob>& vec = (*out)[rank];\n        vec.push_back(Blob(it.second * sizeof(int)));\n      }\n      count.clear();\n\n      \/\/int offset = 0;\n      for (int i = 0; i < keys_size; ++i) {\n        int dst = dest[i];\n        int rank = MV_ServerIdToRank(dst);\n        (*out)[rank][0].As<int>(count[dst]) = keys[i];\n        ++count[dst];\n      }\n\n\n      for (int i = 0; i < server_offsets_.size() - 1; ++i){\n        int rank = MV_ServerIdToRank(i);\n        if (kv.size() == 2) {\/\/ general option blob\n          (*out)[rank].push_back(kv[1]);\n        }\n      }\n\n      CHECK(get_reply_count_ == 0);\n      get_reply_count_ = static_cast<int>(out->size());\n      res = static_cast<int>(out->size());\n    }\n  } else {\n    \/\/ call base class's Partition\n    res = MatrixWorkerTable<T>::Partition(kv, out);\n  }\n\n   \/\/ only have effect when adding elements\n  SparseFilter<T, int32_t>  filter(0, true);\n  for (auto& pair : *out) {\n    std::vector<Blob> compressed_blobs;\n    filter.FilterIn(pair.second, &compressed_blobs);\n    pair.second.swap(compressed_blobs);\n  }\n\n  return res;\n}\n\ntemplate <typename T>\nvoid SparseMatrixWorkerTable<T>::ProcessReplyGet(\n  std::vector<Blob>& reply_data) {\n  \/\/ replace row_index when original key == -1\n  if (row_index_[num_row_] != nullptr) {\n    size_t keys_size = reply_data[0].size<int>();\n    Log::Debug(\"[SparseMatrixWorkerTable:ProcessReplyGet] worker = %d, #keys_size = %d\\n\", MV_Rank(),\n      keys_size);\n    int* keys = reinterpret_cast<int*>(reply_data[0].data());\n    for (auto i = 0; i < keys_size; ++i) {\n      row_index_[keys[i]] = row_index_[num_row_] + keys[i] * num_col_;\n    }\n  }\n\n  MatrixWorkerTable<T>::ProcessReplyGet(reply_data);\n}\n\ntemplate <typename T>\nSparseMatrixServerTable<T>::~SparseMatrixServerTable() {\n  for (auto i = 0; i < workers_nums_; ++i) {\n    delete[]up_to_date_[i];\n  }\n  delete[]up_to_date_;\n}\n\ntemplate <typename T>\nSparseMatrixServerTable<T>::SparseMatrixServerTable(int num_row, int num_col,\n  bool using_pipeline) : MatrixServerTable<T>(num_row, num_col) {\n   workers_nums_ = multiverso::MV_NumWorkers();\n  if (using_pipeline) {\n    workers_nums_ *= 2;\n  }\n        \n  up_to_date_ = new bool*[workers_nums_];\n  for (auto i = 0; i < workers_nums_; ++i) {\n    up_to_date_[i] = new bool[my_num_row_];\n    memset(up_to_date_[i], 0, sizeof(bool) * my_num_row_);\n  }\n  Log::Debug(\"[SparseMatrixServerTable] workers_nums_= %d .\\n\", workers_nums_);\n}\n\ntemplate <typename T>\nvoid SparseMatrixServerTable<T>::UpdateAddState(int worker_id,\n  Blob keys_blob) {\n  size_t keys_size = keys_blob.size<int>();\n  int* keys = reinterpret_cast<int*>(keys_blob.data());\n  \/\/ add all values\n  if (keys_size == 1 && keys[0] == -1) {\n    for (auto id = 0; id < workers_nums_; ++id) {\n      if (id == worker_id) continue;\n      for (auto local_row_id = 0; local_row_id < my_num_row_; ++local_row_id) {\n        \/\/ if other worker doen't update the row, we can marked it as the updated.\n        up_to_date_[id][local_row_id] = false;\n      }\n    }\n  }\n  else {\n    for (auto id = 0; id < workers_nums_; ++id) {\n      if (id == worker_id) continue;\n      for (int i = 0; i < keys_size; ++i) {\n        \/\/ if other worker doen't update the row, we can marked it as the updated.\n        auto local_row_id = get_local_row_id(keys[i]);\n        up_to_date_[id][local_row_id] = false;\n      }\n    }\n  }\n}\n\ntemplate <typename T>\nvoid SparseMatrixServerTable<T>::UpdateGetState(int worker_id, int* keys,\n  size_t key_size, std::vector<int>* out_rows) {\n\n  if (worker_id == -1) {\n    for (auto local_row_id = 0; local_row_id < my_num_row_; ++local_row_id)  {\n      out_rows->push_back(get_global_row_id(local_row_id));\n    }\n    return;\n  }\n\n  if (key_size == 1 && keys[0] == -1) {\n    for (auto local_row_id = 0; local_row_id < my_num_row_; ++local_row_id)  {\n      if (!up_to_date_[worker_id][local_row_id]) {\n        out_rows->push_back(get_global_row_id(local_row_id));\n        up_to_date_[worker_id][local_row_id] = true;\n      }\n    }\n  }\n  else {\n    for (auto i = 0; i < key_size; ++i)  {\n      auto global_row_id = keys[i];\n      auto local_row_id = get_local_row_id(global_row_id);\n      if (!up_to_date_[worker_id][local_row_id]) {\n        up_to_date_[worker_id][local_row_id] = true;\n        out_rows->push_back(global_row_id);\n      }\n    }\n  }\n\n  \/\/ if all rows are up-to-date, then send the first row\n  if (out_rows->size() == 0) {\n    out_rows->push_back(get_global_row_id(0));\n  }\n}\n\ntemplate <typename T>\nvoid SparseMatrixServerTable<T>::ProcessAdd(\n  const std::vector<Blob>& compressed_data) {\n  std::vector<Blob> data;\n  SparseFilter<T, int32_t> filter(0, true);\n  filter.FilterOut(compressed_data, &data);\n\n  \/\/ the UpdateOption option is needed for the sparse update\n  CHECK(data.size() == 3);\n  UpdateOption* option = nullptr;\n  option = new UpdateOption(data[2].data(), data[2].size());\n  UpdateAddState(option->worker_id(), data[0]);\n\n  MatrixServerTable<T>::ProcessAdd(data);\n  delete option;\n}\n\ntemplate <typename T>\nvoid SparseMatrixServerTable<T>::ProcessGet(\n  const std::vector<Blob>& compressed_data,\n  std::vector<Blob>* result) {\n  std::vector<Blob> data;\n  SparseFilter<T, int32_t> filter(0, true);\n  filter.FilterOut(compressed_data, &data);\n\n  \/\/ the general option is needed for the sparse update\n  CHECK(data.size() == 2);\n  CHECK_NOTNULL(result);\n\n  size_t keys_size = data[0].size<int>();\n  \/\/TODO[qiwye]  make the keys to support int64_t\n  int* keys = reinterpret_cast<int*>(data[0].data());\n  GeneralOption* option = nullptr;\n  if (data.size() == 2) {\n    option = new GeneralOption(data[1].data(), data[1].size());\n  }\n  std::vector<int> outdated_rows;\n\n  UpdateGetState(option->worker_id(), keys, keys_size, &outdated_rows);\n\n  Blob outdated_rows_blob(sizeof(int) * outdated_rows.size());\n  for (auto i = 0; i < outdated_rows.size(); ++i) {\n    outdated_rows_blob.As<int>(i) = outdated_rows[i];\n  }\n\n  std::vector<Blob> blobs{ outdated_rows_blob };\n  MatrixServerTable<T>::ProcessGet(blobs, result);\n  delete option;\n}\n\nMV_INSTANTIATE_CLASS_WITH_BASE_TYPE(SparseMatrixWorkerTable);\nMV_INSTANTIATE_CLASS_WITH_BASE_TYPE(SparseMatrixServerTable);\n\n}   \/\/  namespace multiverso\n<commit_msg>deleting general option<commit_after>\/\/ Copyright 2015 Microsoft\n#include \"multiverso\/table\/sparse_matrix_table.h\"\n#include <vector>\n#include <cctype>\n\n#include \"multiverso\/multiverso.h\"\n#include \"multiverso\/util\/log.h\"\n#include \"multiverso\/util\/quantization_util.h\"\n#include \"multiverso\/updater\/updater.h\"\n\nnamespace multiverso {\n\n\/\/ get whole table, data is user-allocated memory\ntemplate <typename T>\nvoid SparseMatrixWorkerTable<T>::Get(T* data, size_t size,\n  const GeneralOption* option) {\n  CHECK(size == num_col_ * num_row_);\n  int whole_table = -1;\n  Get(whole_table, data, size, option);\n}\n\n\/\/ data is user-allocated memory\ntemplate <typename T>\nvoid SparseMatrixWorkerTable<T>::Get(int row_id, T* data, size_t size,\n  const GeneralOption* option) {\n  if (row_id >= 0) CHECK(size == num_col_);\n  for (auto i = 0; i < num_row_ + 1; ++i) row_index_[i] = nullptr;\n  if (row_id == -1) {\n    row_index_[num_row_] = data;\n  } else {\n    row_index_[row_id] = data; \/\/ data_ = data;\n  }\n  Blob keys(&row_id, sizeof(int) * 1);\n\n  if (option == nullptr){\n    option = new GeneralOption();\n  }\n\n  WorkerTable::Get(keys, option);\n  Log::Debug(\"[Get] worker = %d, #row = %d\\n\", MV_Rank(), row_id);\n  delete option;\n}\n\ntemplate <typename T>\nvoid SparseMatrixWorkerTable<T>::Get(const std::vector<int>& row_ids,\n  const std::vector<T*>& data_vec, size_t size, \n  const GeneralOption* option) {\n  for (auto i = 0; i < num_row_ + 1; ++i) row_index_[i] = nullptr;\n  CHECK(size == num_col_);\n  CHECK(row_ids.size() == data_vec.size());\n  for (int i = 0; i < row_ids.size(); ++i) {\n    row_index_[row_ids[i]] = data_vec[i];\n  }\n  Blob keys(row_ids.data(), sizeof(int) * row_ids.size());\n\n  if (option == nullptr){\n    option = new GeneralOption();\n  }\n\n  WorkerTable::Get(keys, option);\n  Log::Debug(\"[Get] worker = %d, #rows_set = %d\\n\", MV_Rank(),\n    row_ids.size());\n  delete option;\n}\n\ntemplate <typename T>\nint SparseMatrixWorkerTable<T>::Partition(const std::vector<Blob>& kv,\n  std::unordered_map<int, std::vector<Blob>>* out) {\n  int res;\n  CHECK(kv.size() == 1 || kv.size() == 2 || kv.size() == 3);\n  CHECK_NOTNULL(out);\n\n  if (kv.size() == 2) {\n    size_t keys_size = kv[0].size<int>();\n    int *keys = reinterpret_cast<int*>(kv[0].data());\n    if (keys[0] == -1) {\n      for (int i = 0; i < server_offsets_.size() - 1; ++i) {\n        int rank = MV_ServerIdToRank(i);\n        (*out)[rank].push_back(kv[0]);\n      }\n\n      for (int i = 0; i < server_offsets_.size() - 1; ++i){\n        int rank = MV_ServerIdToRank(i);\n        if (kv.size() == 2) {\/\/ general option blob\n          (*out)[rank].push_back(kv[1]);\n        }\n      }\n\n      CHECK(get_reply_count_ == 0);\n      get_reply_count_ = static_cast<int>(out->size());\n      res = static_cast<int>(out->size());\n    } else {\n      \/\/ count row number in each server\n      std::unordered_map<int, int> count;\n      std::vector<int> dest;\n      int actual_num_server = static_cast<int>(server_offsets_.size() - 1);\n      int num_row_each = num_row_ \/ actual_num_server;  \/\/  num_server_;\n      for (int i = 0; i < keys_size; ++i) {\n        int dst = keys[i] \/ num_row_each;\n        dst = (dst == actual_num_server ? dst - 1 : dst);\n        dest.push_back(dst);\n        ++count[dst];\n      }\n\n      for (auto& it : count) {  \/\/ Allocate memory\n        int rank = MV_ServerIdToRank(it.first);\n        std::vector<Blob>& vec = (*out)[rank];\n        vec.push_back(Blob(it.second * sizeof(int)));\n      }\n      count.clear();\n\n      \/\/int offset = 0;\n      for (int i = 0; i < keys_size; ++i) {\n        int dst = dest[i];\n        int rank = MV_ServerIdToRank(dst);\n        (*out)[rank][0].As<int>(count[dst]) = keys[i];\n        ++count[dst];\n      }\n\n\n      for (int i = 0; i < server_offsets_.size() - 1; ++i){\n        int rank = MV_ServerIdToRank(i);\n        if (kv.size() == 2) {\/\/ general option blob\n          (*out)[rank].push_back(kv[1]);\n        }\n      }\n\n      CHECK(get_reply_count_ == 0);\n      get_reply_count_ = static_cast<int>(out->size());\n      res = static_cast<int>(out->size());\n    }\n  } else {\n    \/\/ call base class's Partition\n    res = MatrixWorkerTable<T>::Partition(kv, out);\n  }\n\n   \/\/ only have effect when adding elements\n  SparseFilter<T, int32_t>  filter(0, true);\n  for (auto& pair : *out) {\n    std::vector<Blob> compressed_blobs;\n    filter.FilterIn(pair.second, &compressed_blobs);\n    pair.second.swap(compressed_blobs);\n  }\n\n  return res;\n}\n\ntemplate <typename T>\nvoid SparseMatrixWorkerTable<T>::ProcessReplyGet(\n  std::vector<Blob>& reply_data) {\n  \/\/ replace row_index when original key == -1\n  if (row_index_[num_row_] != nullptr) {\n    size_t keys_size = reply_data[0].size<int>();\n    Log::Debug(\"[SparseMatrixWorkerTable:ProcessReplyGet] worker = %d, #keys_size = %d\\n\", MV_Rank(),\n      keys_size);\n    int* keys = reinterpret_cast<int*>(reply_data[0].data());\n    for (auto i = 0; i < keys_size; ++i) {\n      row_index_[keys[i]] = row_index_[num_row_] + keys[i] * num_col_;\n    }\n  }\n\n  MatrixWorkerTable<T>::ProcessReplyGet(reply_data);\n}\n\ntemplate <typename T>\nSparseMatrixServerTable<T>::~SparseMatrixServerTable() {\n  for (auto i = 0; i < workers_nums_; ++i) {\n    delete[]up_to_date_[i];\n  }\n  delete[]up_to_date_;\n}\n\ntemplate <typename T>\nSparseMatrixServerTable<T>::SparseMatrixServerTable(int num_row, int num_col,\n  bool using_pipeline) : MatrixServerTable<T>(num_row, num_col) {\n   workers_nums_ = multiverso::MV_NumWorkers();\n  if (using_pipeline) {\n    workers_nums_ *= 2;\n  }\n        \n  up_to_date_ = new bool*[workers_nums_];\n  for (auto i = 0; i < workers_nums_; ++i) {\n    up_to_date_[i] = new bool[my_num_row_];\n    memset(up_to_date_[i], 0, sizeof(bool) * my_num_row_);\n  }\n  Log::Debug(\"[SparseMatrixServerTable] workers_nums_= %d .\\n\", workers_nums_);\n}\n\ntemplate <typename T>\nvoid SparseMatrixServerTable<T>::UpdateAddState(int worker_id,\n  Blob keys_blob) {\n  size_t keys_size = keys_blob.size<int>();\n  int* keys = reinterpret_cast<int*>(keys_blob.data());\n  \/\/ add all values\n  if (keys_size == 1 && keys[0] == -1) {\n    for (auto id = 0; id < workers_nums_; ++id) {\n      if (id == worker_id) continue;\n      for (auto local_row_id = 0; local_row_id < my_num_row_; ++local_row_id) {\n        \/\/ if other worker doen't update the row, we can marked it as the updated.\n        up_to_date_[id][local_row_id] = false;\n      }\n    }\n  }\n  else {\n    for (auto id = 0; id < workers_nums_; ++id) {\n      if (id == worker_id) continue;\n      for (int i = 0; i < keys_size; ++i) {\n        \/\/ if other worker doen't update the row, we can marked it as the updated.\n        auto local_row_id = get_local_row_id(keys[i]);\n        up_to_date_[id][local_row_id] = false;\n      }\n    }\n  }\n}\n\ntemplate <typename T>\nvoid SparseMatrixServerTable<T>::UpdateGetState(int worker_id, int* keys,\n  size_t key_size, std::vector<int>* out_rows) {\n\n  if (worker_id == -1) {\n    for (auto local_row_id = 0; local_row_id < my_num_row_; ++local_row_id)  {\n      out_rows->push_back(get_global_row_id(local_row_id));\n    }\n    return;\n  }\n\n  if (key_size == 1 && keys[0] == -1) {\n    for (auto local_row_id = 0; local_row_id < my_num_row_; ++local_row_id)  {\n      if (!up_to_date_[worker_id][local_row_id]) {\n        out_rows->push_back(get_global_row_id(local_row_id));\n        up_to_date_[worker_id][local_row_id] = true;\n      }\n    }\n  }\n  else {\n    for (auto i = 0; i < key_size; ++i)  {\n      auto global_row_id = keys[i];\n      auto local_row_id = get_local_row_id(global_row_id);\n      if (!up_to_date_[worker_id][local_row_id]) {\n        up_to_date_[worker_id][local_row_id] = true;\n        out_rows->push_back(global_row_id);\n      }\n    }\n  }\n\n  \/\/ if all rows are up-to-date, then send the first row\n  if (out_rows->size() == 0) {\n    out_rows->push_back(get_global_row_id(0));\n  }\n}\n\ntemplate <typename T>\nvoid SparseMatrixServerTable<T>::ProcessAdd(\n  const std::vector<Blob>& compressed_data) {\n  std::vector<Blob> data;\n  SparseFilter<T, int32_t> filter(0, true);\n  filter.FilterOut(compressed_data, &data);\n\n  \/\/ the UpdateOption option is needed for the sparse update\n  CHECK(data.size() == 3);\n  UpdateOption* option = nullptr;\n  option = new UpdateOption(data[2].data(), data[2].size());\n  UpdateAddState(option->worker_id(), data[0]);\n\n  MatrixServerTable<T>::ProcessAdd(data);\n  delete option;\n}\n\ntemplate <typename T>\nvoid SparseMatrixServerTable<T>::ProcessGet(\n  const std::vector<Blob>& compressed_data,\n  std::vector<Blob>* result) {\n  std::vector<Blob> data;\n  SparseFilter<T, int32_t> filter(0, true);\n  filter.FilterOut(compressed_data, &data);\n\n  \/\/ the general option is needed for the sparse update\n  CHECK(data.size() == 2);\n  CHECK_NOTNULL(result);\n\n  size_t keys_size = data[0].size<int>();\n  \/\/TODO[qiwye]  make the keys to support int64_t\n  int* keys = reinterpret_cast<int*>(data[0].data());\n  GeneralOption* option = nullptr;\n  if (data.size() == 2) {\n    option = new GeneralOption(data[1].data(), data[1].size());\n  }\n  std::vector<int> outdated_rows;\n\n  UpdateGetState(option->worker_id(), keys, keys_size, &outdated_rows);\n\n  Blob outdated_rows_blob(sizeof(int) * outdated_rows.size());\n  for (auto i = 0; i < outdated_rows.size(); ++i) {\n    outdated_rows_blob.As<int>(i) = outdated_rows[i];\n  }\n\n  std::vector<Blob> blobs{ outdated_rows_blob };\n  MatrixServerTable<T>::ProcessGet(blobs, result);\n  delete option;\n}\n\nMV_INSTANTIATE_CLASS_WITH_BASE_TYPE(SparseMatrixWorkerTable);\nMV_INSTANTIATE_CLASS_WITH_BASE_TYPE(SparseMatrixServerTable);\n\n}   \/\/  namespace multiverso\n<|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/base:$Name:  $:$Id: TFolder.cxx,v 1.12 2001\/04\/04 13:59:37 brun Exp $\n\/\/ Author: Rene Brun   02\/09\/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\/\/\n\/\/ A TFolder object is a collection of objects and folders.\n\/\/ Folders have a name and a title and are identified in the folder hierarchy\n\/\/ by a \"Unix-like\" naming mechanism. The root of all folders is \/\/root.\n\/\/ New folders can be dynamically added or removed to\/from a folder.\n\/\/ The folder hierarchy can be visualized via the TBrowser.\n\/\/\n\/\/ The Root folders hierarchy can be seen as a whiteboard where objects\n\/\/ are posted. Other classes\/tasks can access these objects by specifying\n\/\/ only a string pathname. This whiteboard facility greatly improves the\n\/\/ modularity of an application, minimizing the class relationship problem\n\/\/ that penalizes large applications.\n\/\/\n\/\/ Pointers are efficient to communicate between classes.\n\/\/ However, one has interest to minimize direct coupling between classes\n\/\/ in the form of direct pointers. One better uses the naming and search\n\/\/ service provided by the Root folders hierarchy. This makes the classes\n\/\/ loosely coupled and also greatly facilitates I\/O operations.\n\/\/ In a client\/server environment, this mechanism facilitates the access\n\/\/ to any kind of object in \/\/root stores running on different processes.\n\/\/\n\/\/ A TFolder is created by invoking the TFolder constructor. It is placed\n\/\/ inside an existing folder via the TFolder::AddFolder method.\n\/\/ One can search for a folder or an object in a folder using the FindObject\n\/\/ method. FindObject analyzes the string passed as its argument and searches\n\/\/ in the hierarchy until it finds an object or folder matching the name.\n\/\/\n\/\/ When a folder is deleted, its reference from the parent folder and\n\/\/ possible other folders is deleted.\n\/\/\n\/\/ If a folder has been declared the owner of its objects\/folders via\n\/\/ TFolder::SetOwner, then the contained objects are deleted when the\n\/\/ folder is deleted. By default, a folder does not own its contained objects.\n\/\/\n\/\/ Standard Root objects are automatically added to the folder hierarchy.\n\/\/ For example, the following folders exist:\n\/\/   \/\/root\/Files      with the list of currently connected Root files\n\/\/   \/\/root\/Classes    with the list of active classes\n\/\/   \/\/root\/Geometries with active geometries\n\/\/   \/\/root\/Canvases   with the list of active canvases\n\/\/   \/\/root\/Styles     with the list of graphics styles\n\/\/   \/\/root\/Colors     with the list of active colors\n\/\/\n\/\/ For example, if a file \"myFile.root\" is added to the list of files, one can\n\/\/ retrieve a pointer to the corresponding TFile object with a statement like:\n\/\/   TFile *myFile = (TFile*)gROOT->FindObject(\"\/\/root\/Files\/myFile.root\");\n\/\/ The above statement can be abbreviated to:\n\/\/   TFile *myFile = (TFile*)gROOT->FindObject(\"\/Files\/myFile.root\");\n\/\/ or even to:\n\/\/   TFile *myFile = (TFile*)gROOT->FindObjectAny(\"myFile.root\");\n\/\/ In this last case, the TROOT::FindObjectAny function will scan the folder hierarchy\n\/\/ starting at \/\/root and will return the first object named \"myFile.root\".\n\/\/\n\/\/ Because a string-based search mechanism is expensive, it is recommended\n\/\/ to save the pointer to the object as a class member or local variable\n\/\/ if this pointer is used frequently or inside loops.\n\/\/\n\/\/Begin_Html\n\/*\n<img src=\"gif\/folder.gif\">\n*\/\n\/\/End_Html\n\n#include <iostream.h>\n\n#include \"Strlen.h\"\n#include \"TFolder.h\"\n#include \"TBrowser.h\"\n#include \"TROOT.h\"\n#include \"TClass.h\"\n#include \"TError.h\"\n#include \"TFile.h\"\n#include \"TRegexp.h\"\n\nconst int kMAXDEPTH = 64;\nstatic const char *d[kMAXDEPTH];\nstatic Int_t level = -1;\nstatic char path[512];\n\nClassImp(TFolder)\n\n\/\/______________________________________________________________________________\nTFolder::TFolder() : TNamed()\n{\n\/\/ default constructor used by the Input functions\n\/\/\n   fFolders = 0;\n   fIsOwner = kFALSE;\n}\n\n\/\/______________________________________________________________________________\nTFolder::TFolder(const TFolder &folder)\n{\n   ((TFolder&)folder).Copy(*this);\n}\n\n\/\/______________________________________________________________________________\nTFolder::~TFolder()\n{\n\/\/ folder destructor. Remove all objects from its lists and delete\n\/\/ all its sub folders\n\n   TCollection::StartGarbageCollection();\n\n   if (fFolders) {\n      fFolders->Delete();\n      SafeDelete(fFolders);\n   }\n\n   TCollection::EmptyGarbageCollection();\n\n   if (gDebug)\n      cerr << \"TFolder dtor called for \"<< GetName() << endl;\n}\n\n\/\/______________________________________________________________________________\nvoid TFolder::Add(TObject *obj)\n{\n\/\/ Add object to this folder. obj must be a TObject or a TFolder\n\n   if (obj == 0 || fFolders == 0) return;\n   obj->SetBit(kMustCleanup);\n   fFolders->Add(obj);\n}\n\n\/\/______________________________________________________________________________\nTFolder *TFolder::AddFolder(const char *name, const char *title, TCollection *collection)\n{\n\/\/ Create a new folder and add it to the list of folders of this folder\n\/\/ return a pointer to the created folder\n\/\/ Note that a folder can be added to several folders\n\/\/\n\/\/ if (collection is non NULL, the pointer fFolders is set to the existing\n\/\/ collection, otherwise a default collection (Tlist) is created\n\/\/ Note that the folder name cannot contain slashes.\n\n   if (strchr(name,'\/')) {\n      ::Error(\"TFolder::TFolder\",\"folder name cannot contain a slash\", name);\n      return 0;\n   }\n   if (strlen(GetName()) == 0) {\n      ::Error(\"TFolder::TFolder\",\"folder name cannot be \\\"\\\"\");\n      return 0;\n   }\n   TFolder *folder = new TFolder();\n   folder->SetName(name);\n   folder->SetTitle(title);\n   if (!fFolders) fFolders = new TList(); \/\/only true when gROOT creates its 1st folder\n   fFolders->Add(folder);\n\n   if (collection) folder->fFolders = collection;\n   else            folder->fFolders = new TList();\n   return folder;\n}\n\n\/\/______________________________________________________________________________\nvoid TFolder::Browse(TBrowser *b)\n{\n\/\/ Browse this folder\n\n   if (fFolders) fFolders->Browse(b);\n}\n\n\/\/______________________________________________________________________________\nvoid TFolder::Clear(Option_t *option)\n{\n\/\/ Delete all objects from a folder list\n\n   if (fFolders) fFolders->Clear(option);\n\n}\n\n\n\/\/______________________________________________________________________________\nconst char *TFolder::FindFullPathName(const char *name) const\n{\n\/\/ return the full pathname corresponding to subpath name\n\/\/ The returned path will be re-used by the next call to GetPath().\n\n   TObject *obj = FindObject(name);\n   if (obj || !fFolders) {\n      level++;\n      d[level] = GetName();\n      path[0] = '\/';\n      path[1] = 0;\n      for (Int_t l=0;l<=level;l++) {\n         strcat(path,\"\/\");\n         strcat(path,d[l]);\n     }\n      strcat(path,\"\/\");\n      strcat(path,name);\n      level = -1;\n      return path;\n   }\n   if (name[0] == '\/') return 0;\n   TIter next(fFolders);\n   TFolder *folder;\n   const char *found;\n   level++;\n   d[level] = GetName();\n   while ((obj=next())) {\n      if (!obj->InheritsFrom(TFolder::Class())) continue;\n      if (obj->InheritsFrom(TClass::Class())) continue;\n      folder = (TFolder*)obj;\n      found = folder->FindFullPathName(name);\n      if (found) return found;\n   }\n   level--;\n   return 0;\n}\n\n\n\/\/______________________________________________________________________________\nconst char *TFolder::FindFullPathName(const TObject *obj) const\n{\n\/\/ return the full pathname corresponding to subpath name\n\/\/ The returned path will be re-used by the next call to GetPath().\n\n   Error(\"FindFullPathname\",\"Not yet implemented\");\n   return 0;\n}\n\n\/\/______________________________________________________________________________\nTObject *TFolder::FindObject(const TObject *) const\n{\n\/\/ find object in an folder\n\n   Error(\"FindObject\",\"Not yet implemented\");\n   return 0;\n}\n\n\/\/______________________________________________________________________________\nTObject *TFolder::FindObject(const char *name) const\n{\n\/\/ search object identified by name in the tree of folders inside\n\/\/ this folder.\n\/\/ name may be of the forms:\n\/\/   A, specify a full pathname starting at the top ROOT folder\n\/\/     \/\/root\/xxx\/yyy\/name \n\/\/\n\/\/   B, specify a pathname starting with a single slash. \/\/root is assumed\n\/\/     \/xxx\/yyy\/name\n\/\/\n\/\/   C, Specify a pathname relative to this folder\n\/\/     xxx\/yyy\/name\n\/\/     name\n\n   if (name == 0) return 0;\n   if (name[0] == '\/') {\n      if (name[1] == '\/') {\n         if (!strstr(name,\"\/\/root\/\")) return 0;\n         return gROOT->GetRootFolder()->FindObject(name+7);\n      } else {\n         return gROOT->GetRootFolder()->FindObject(name+1);\n      }\n   }\n   char cname[1024];\n   strcpy(cname,name);\n   TObject *obj;\n   char *slash = strchr(cname,'\/');\n   if (slash) {\n      *slash = 0;\n      obj = fFolders->FindObject(cname);\n      if (!obj) return 0;\n      return obj->FindObject(slash+1);\n   } else {\n      return fFolders->FindObject(name);\n   }\n}\n\n\n\/\/______________________________________________________________________________\nTObject *TFolder::FindObjectAny(const char *name) const\n{\n\/\/ return a pointer to the first object with name starting at this folder\n\n   TObject *obj = FindObject(name);\n   if (obj || !fFolders) return obj;\n\n\/\/   if (!obj->InheritsFrom(TFolder::Class())) continue;\n   if (name[0] == '\/') return 0;\n   TIter next(fFolders);\n   TFolder *folder;\n   TObject *found;\n   if (level >= 0) d[level] = GetName();\n   while ((obj=next())) {\n      if (!obj->InheritsFrom(TFolder::Class())) continue;\n      if (obj->IsA() == TClass::Class()) continue;\n      folder = (TFolder*)obj;\n      found = folder->FindObjectAny(name);\n      if (found) return found;\n   }\n   return 0;\n}\n\n\/\/______________________________________________________________________________\nvoid TFolder::ls(Option_t *option) const\n{\n\/\/ List folder contents\n\/\/   if option contains \"dump\",  the Dump function of contained objects is called\n\/\/   if option contains \"print\", the Print function of contained objects is called\n\/\/   By default the ls function of contained objects is called.\n\/\/  Indentation is used to identify the folder tree\n\/\/\n\/\/  The <regexp> will be used to match the name of the objects.\n\/\/\n   TROOT::IndentLevel();\n   cout <<ClassName()<<\"*\\t\\t\"<<GetName()<<\"\\t\"<<GetTitle()<<endl;\n   TROOT::IncreaseDirLevel();\n\n   TString opta = option;\n   TString opt  = opta.Strip(TString::kBoth);\n   opt.ToLower();\n   TString reg  = opt;\n   Bool_t dump  = opt.Contains(\"dump\");\n   Bool_t print = opt.Contains(\"print\");\n   TRegexp re(reg, kTRUE);\n\n   TObject *obj;\n   TIter nextobj(fFolders);\n   while ((obj = (TObject *) nextobj())) {\n      TString s = obj->GetName();\n      if (s.Index(re) == kNPOS) continue;\n      if (dump)      obj->Dump();\n      else if(print) obj->Print(option);\n      else           obj->ls(option);\n   }\n   TROOT::DecreaseDirLevel();\n}\n\n\/\/______________________________________________________________________________\nInt_t TFolder::Occurence(const TObject *object) const\n{\n\/\/ Return occurence number of object in the list of objects of this folder.\n\/\/ The function returns the number of objects with the same name as object\n\/\/ found in the list of objects in this folder before object itself.\n\/\/ If only one object is found, return 0;\n   Int_t n = 0;\n   TIter next(fFolders);\n   TObject *obj;\n   while ((obj=next())) {\n      if (strcmp(obj->GetName(),object->GetName()) == 0) n++;\n   }\n   if (n <=1) return n-1;\n   n = 0;\n   next.Reset();\n   while ((obj=next())) {\n      if (strcmp(obj->GetName(),object->GetName()) == 0) n++;\n      if (obj == object) return n;\n   }\n   return 0;\n}\n\n\/\/______________________________________________________________________________\nvoid TFolder::RecursiveRemove(TObject *obj)\n{\n\/\/ Recursively remove object from a Folder\n\n   fFolders->RecursiveRemove(obj);\n}\n\n\/\/______________________________________________________________________________\nvoid TFolder::Remove(TObject *obj)\n{\n\/\/ Remove object from this folder. obj must be a TObject or a TFolder\n\n   if (obj == 0 || fFolders == 0) return;\n   fFolders->Remove(obj);\n}\n\n\/\/______________________________________________________________________________\nvoid TFolder::SaveAs(const char *filename)\n{\n\/\/ Save all objects in this folder in filename\n\/\/ Each object in this folder will have a key in the file where the name of\n\/\/ the key will be the name of the object.\n\n   TFile f(filename,\"recreate\");\n   if (f.IsZombie()) return;\n   fFolders->Write();\n   printf(\"Folder: %s saved to file: %s\\n\",GetName(),filename);\n}\n<commit_msg>Add some protections in case a folder has been created via the default constructor. Add a comment in the default constructor to indicate the normal procedure to create a folder using TFolder::AddFolder.<commit_after>\/\/ @(#)root\/base:$Name:  $:$Id: TFolder.cxx,v 1.13 2001\/07\/06 13:22:42 brun Exp $\n\/\/ Author: Rene Brun   02\/09\/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\/\/\n\/\/ A TFolder object is a collection of objects and folders.\n\/\/ Folders have a name and a title and are identified in the folder hierarchy\n\/\/ by a \"Unix-like\" naming mechanism. The root of all folders is \/\/root.\n\/\/ New folders can be dynamically added or removed to\/from a folder.\n\/\/ The folder hierarchy can be visualized via the TBrowser.\n\/\/\n\/\/ The Root folders hierarchy can be seen as a whiteboard where objects\n\/\/ are posted. Other classes\/tasks can access these objects by specifying\n\/\/ only a string pathname. This whiteboard facility greatly improves the\n\/\/ modularity of an application, minimizing the class relationship problem\n\/\/ that penalizes large applications.\n\/\/\n\/\/ Pointers are efficient to communicate between classes.\n\/\/ However, one has interest to minimize direct coupling between classes\n\/\/ in the form of direct pointers. One better uses the naming and search\n\/\/ service provided by the Root folders hierarchy. This makes the classes\n\/\/ loosely coupled and also greatly facilitates I\/O operations.\n\/\/ In a client\/server environment, this mechanism facilitates the access\n\/\/ to any kind of object in \/\/root stores running on different processes.\n\/\/\n\/\/ A TFolder is created by invoking the TFolder constructor. It is placed\n\/\/ inside an existing folder via the TFolder::AddFolder method.\n\/\/ One can search for a folder or an object in a folder using the FindObject\n\/\/ method. FindObject analyzes the string passed as its argument and searches\n\/\/ in the hierarchy until it finds an object or folder matching the name.\n\/\/\n\/\/ When a folder is deleted, its reference from the parent folder and\n\/\/ possible other folders is deleted.\n\/\/\n\/\/ If a folder has been declared the owner of its objects\/folders via\n\/\/ TFolder::SetOwner, then the contained objects are deleted when the\n\/\/ folder is deleted. By default, a folder does not own its contained objects.\n\/\/\n\/\/ Standard Root objects are automatically added to the folder hierarchy.\n\/\/ For example, the following folders exist:\n\/\/   \/\/root\/Files      with the list of currently connected Root files\n\/\/   \/\/root\/Classes    with the list of active classes\n\/\/   \/\/root\/Geometries with active geometries\n\/\/   \/\/root\/Canvases   with the list of active canvases\n\/\/   \/\/root\/Styles     with the list of graphics styles\n\/\/   \/\/root\/Colors     with the list of active colors\n\/\/\n\/\/ For example, if a file \"myFile.root\" is added to the list of files, one can\n\/\/ retrieve a pointer to the corresponding TFile object with a statement like:\n\/\/   TFile *myFile = (TFile*)gROOT->FindObject(\"\/\/root\/Files\/myFile.root\");\n\/\/ The above statement can be abbreviated to:\n\/\/   TFile *myFile = (TFile*)gROOT->FindObject(\"\/Files\/myFile.root\");\n\/\/ or even to:\n\/\/   TFile *myFile = (TFile*)gROOT->FindObjectAny(\"myFile.root\");\n\/\/ In this last case, the TROOT::FindObjectAny function will scan the folder hierarchy\n\/\/ starting at \/\/root and will return the first object named \"myFile.root\".\n\/\/\n\/\/ Because a string-based search mechanism is expensive, it is recommended\n\/\/ to save the pointer to the object as a class member or local variable\n\/\/ if this pointer is used frequently or inside loops.\n\/\/\n\/\/Begin_Html\n\/*\n<img src=\"gif\/folder.gif\">\n*\/\n\/\/End_Html\n\n#include <iostream.h>\n\n#include \"Strlen.h\"\n#include \"TFolder.h\"\n#include \"TBrowser.h\"\n#include \"TROOT.h\"\n#include \"TClass.h\"\n#include \"TError.h\"\n#include \"TFile.h\"\n#include \"TRegexp.h\"\n\nconst int kMAXDEPTH = 64;\nstatic const char *d[kMAXDEPTH];\nstatic Int_t level = -1;\nstatic char path[512];\n\nClassImp(TFolder)\n\n\/\/______________________________________________________________________________\nTFolder::TFolder() : TNamed()\n{\n\/\/ default constructor used by the Input functions\n\/\/\n\/\/ This constructor should not be called by a user directly.\n\/\/ The normal way to create a folder is by calling TFolder::AddFolder\n   \n   fFolders = 0;\n   fIsOwner = kFALSE;\n}\n\n\/\/______________________________________________________________________________\nTFolder::TFolder(const TFolder &folder)\n{\n   ((TFolder&)folder).Copy(*this);\n}\n\n\/\/______________________________________________________________________________\nTFolder::~TFolder()\n{\n\/\/ folder destructor. Remove all objects from its lists and delete\n\/\/ all its sub folders\n\n   TCollection::StartGarbageCollection();\n\n   if (fFolders) {\n      fFolders->Delete();\n      SafeDelete(fFolders);\n   }\n\n   TCollection::EmptyGarbageCollection();\n\n   if (gDebug)\n      cerr << \"TFolder dtor called for \"<< GetName() << endl;\n}\n\n\/\/______________________________________________________________________________\nvoid TFolder::Add(TObject *obj)\n{\n\/\/ Add object to this folder. obj must be a TObject or a TFolder\n\n   if (obj == 0 || fFolders == 0) return;\n   obj->SetBit(kMustCleanup);\n   fFolders->Add(obj);\n}\n\n\/\/______________________________________________________________________________\nTFolder *TFolder::AddFolder(const char *name, const char *title, TCollection *collection)\n{\n\/\/ Create a new folder and add it to the list of folders of this folder\n\/\/ return a pointer to the created folder\n\/\/ Note that a folder can be added to several folders\n\/\/\n\/\/ if (collection is non NULL, the pointer fFolders is set to the existing\n\/\/ collection, otherwise a default collection (Tlist) is created\n\/\/ Note that the folder name cannot contain slashes.\n\n   if (strchr(name,'\/')) {\n      ::Error(\"TFolder::TFolder\",\"folder name cannot contain a slash\", name);\n      return 0;\n   }\n   if (strlen(GetName()) == 0) {\n      ::Error(\"TFolder::TFolder\",\"folder name cannot be \\\"\\\"\");\n      return 0;\n   }\n   TFolder *folder = new TFolder();\n   folder->SetName(name);\n   folder->SetTitle(title);\n   if (!fFolders) fFolders = new TList(); \/\/only true when gROOT creates its 1st folder\n   fFolders->Add(folder);\n\n   if (collection) folder->fFolders = collection;\n   else            folder->fFolders = new TList();\n   return folder;\n}\n\n\/\/______________________________________________________________________________\nvoid TFolder::Browse(TBrowser *b)\n{\n\/\/ Browse this folder\n\n   if (fFolders) fFolders->Browse(b);\n}\n\n\/\/______________________________________________________________________________\nvoid TFolder::Clear(Option_t *option)\n{\n\/\/ Delete all objects from a folder list\n\n   if (fFolders) fFolders->Clear(option);\n\n}\n\n\n\/\/______________________________________________________________________________\nconst char *TFolder::FindFullPathName(const char *name) const\n{\n\/\/ return the full pathname corresponding to subpath name\n\/\/ The returned path will be re-used by the next call to GetPath().\n\n   TObject *obj = FindObject(name);\n   if (obj || !fFolders) {\n      level++;\n      d[level] = GetName();\n      path[0] = '\/';\n      path[1] = 0;\n      for (Int_t l=0;l<=level;l++) {\n         strcat(path,\"\/\");\n         strcat(path,d[l]);\n     }\n      strcat(path,\"\/\");\n      strcat(path,name);\n      level = -1;\n      return path;\n   }\n   if (name[0] == '\/') return 0;\n   TIter next(fFolders);\n   TFolder *folder;\n   const char *found;\n   level++;\n   d[level] = GetName();\n   while ((obj=next())) {\n      if (!obj->InheritsFrom(TFolder::Class())) continue;\n      if (obj->InheritsFrom(TClass::Class())) continue;\n      folder = (TFolder*)obj;\n      found = folder->FindFullPathName(name);\n      if (found) return found;\n   }\n   level--;\n   return 0;\n}\n\n\n\/\/______________________________________________________________________________\nconst char *TFolder::FindFullPathName(const TObject *obj) const\n{\n\/\/ return the full pathname corresponding to subpath name\n\/\/ The returned path will be re-used by the next call to GetPath().\n\n   Error(\"FindFullPathname\",\"Not yet implemented\");\n   return 0;\n}\n\n\/\/______________________________________________________________________________\nTObject *TFolder::FindObject(const TObject *) const\n{\n\/\/ find object in an folder\n\n   Error(\"FindObject\",\"Not yet implemented\");\n   return 0;\n}\n\n\/\/______________________________________________________________________________\nTObject *TFolder::FindObject(const char *name) const\n{\n\/\/ search object identified by name in the tree of folders inside\n\/\/ this folder.\n\/\/ name may be of the forms:\n\/\/   A, specify a full pathname starting at the top ROOT folder\n\/\/     \/\/root\/xxx\/yyy\/name \n\/\/\n\/\/   B, specify a pathname starting with a single slash. \/\/root is assumed\n\/\/     \/xxx\/yyy\/name\n\/\/\n\/\/   C, Specify a pathname relative to this folder\n\/\/     xxx\/yyy\/name\n\/\/     name\n\n   if (!fFolders) return 0;\n   if (name == 0) return 0;\n   if (name[0] == '\/') {\n      if (name[1] == '\/') {\n         if (!strstr(name,\"\/\/root\/\")) return 0;\n         return gROOT->GetRootFolder()->FindObject(name+7);\n      } else {\n         return gROOT->GetRootFolder()->FindObject(name+1);\n      }\n   }\n   char cname[1024];\n   strcpy(cname,name);\n   TObject *obj;\n   char *slash = strchr(cname,'\/');\n   if (slash) {\n      *slash = 0;\n      obj = fFolders->FindObject(cname);\n      if (!obj) return 0;\n      return obj->FindObject(slash+1);\n   } else {\n      return fFolders->FindObject(name);\n   }\n}\n\n\n\/\/______________________________________________________________________________\nTObject *TFolder::FindObjectAny(const char *name) const\n{\n\/\/ return a pointer to the first object with name starting at this folder\n\n   TObject *obj = FindObject(name);\n   if (obj || !fFolders) return obj;\n\n\/\/   if (!obj->InheritsFrom(TFolder::Class())) continue;\n   if (name[0] == '\/') return 0;\n   TIter next(fFolders);\n   TFolder *folder;\n   TObject *found;\n   if (level >= 0) d[level] = GetName();\n   while ((obj=next())) {\n      if (!obj->InheritsFrom(TFolder::Class())) continue;\n      if (obj->IsA() == TClass::Class()) continue;\n      folder = (TFolder*)obj;\n      found = folder->FindObjectAny(name);\n      if (found) return found;\n   }\n   return 0;\n}\n\n\/\/______________________________________________________________________________\nvoid TFolder::ls(Option_t *option) const\n{\n\/\/ List folder contents\n\/\/   if option contains \"dump\",  the Dump function of contained objects is called\n\/\/   if option contains \"print\", the Print function of contained objects is called\n\/\/   By default the ls function of contained objects is called.\n\/\/  Indentation is used to identify the folder tree\n\/\/\n\/\/  The <regexp> will be used to match the name of the objects.\n\/\/\n   if (!fFolders) return;\n   TROOT::IndentLevel();\n   cout <<ClassName()<<\"*\\t\\t\"<<GetName()<<\"\\t\"<<GetTitle()<<endl;\n   TROOT::IncreaseDirLevel();\n\n   TString opta = option;\n   TString opt  = opta.Strip(TString::kBoth);\n   opt.ToLower();\n   TString reg  = opt;\n   Bool_t dump  = opt.Contains(\"dump\");\n   Bool_t print = opt.Contains(\"print\");\n   TRegexp re(reg, kTRUE);\n\n   TObject *obj;\n   TIter nextobj(fFolders);\n   while ((obj = (TObject *) nextobj())) {\n      TString s = obj->GetName();\n      if (s.Index(re) == kNPOS) continue;\n      if (dump)      obj->Dump();\n      else if(print) obj->Print(option);\n      else           obj->ls(option);\n   }\n   TROOT::DecreaseDirLevel();\n}\n\n\/\/______________________________________________________________________________\nInt_t TFolder::Occurence(const TObject *object) const\n{\n\/\/ Return occurence number of object in the list of objects of this folder.\n\/\/ The function returns the number of objects with the same name as object\n\/\/ found in the list of objects in this folder before object itself.\n\/\/ If only one object is found, return 0;\n   Int_t n = 0;\n   if (!fFolders) return 0;\n   TIter next(fFolders);\n   TObject *obj;\n   while ((obj=next())) {\n      if (strcmp(obj->GetName(),object->GetName()) == 0) n++;\n   }\n   if (n <=1) return n-1;\n   n = 0;\n   next.Reset();\n   while ((obj=next())) {\n      if (strcmp(obj->GetName(),object->GetName()) == 0) n++;\n      if (obj == object) return n;\n   }\n   return 0;\n}\n\n\/\/______________________________________________________________________________\nvoid TFolder::RecursiveRemove(TObject *obj)\n{\n\/\/ Recursively remove object from a Folder\n\n   if (fFolders) fFolders->RecursiveRemove(obj);\n}\n\n\/\/______________________________________________________________________________\nvoid TFolder::Remove(TObject *obj)\n{\n\/\/ Remove object from this folder. obj must be a TObject or a TFolder\n\n   if (obj == 0 || fFolders == 0) return;\n   fFolders->Remove(obj);\n}\n\n\/\/______________________________________________________________________________\nvoid TFolder::SaveAs(const char *filename)\n{\n\/\/ Save all objects in this folder in filename\n\/\/ Each object in this folder will have a key in the file where the name of\n\/\/ the key will be the name of the object.\n\n   TFile f(filename,\"recreate\");\n   if (f.IsZombie()) return;\n   if (fFolders) fFolders->Write();\n   printf(\"Folder: %s saved to file: %s\\n\",GetName(),filename);\n}\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\/**\n * @file mag.cpp\n *\n * Driver for the ak09916 magnetometer within the Invensense mpu9250\n *\n * @author Robert Dickenson\n *\n *\/\n\n#include <px4_config.h>\n#include <px4_log.h>\n#include <px4_time.h>\n#include <lib\/perf\/perf_counter.h>\n#include <drivers\/drv_hrt.h>\n#include <lib\/conversion\/rotation.h>\n#include <px4_getopt.h>\n\n#include \"ak09916.hpp\"\n\n\n\/** driver 'main' command *\/\nextern \"C\" { __EXPORT int ak09916_main(int argc, char *argv[]); }\n\n#define AK09916_CONVERSION_INTERVAL\t(1000000 \/ 100)\t\/* microseconds *\/\n\nnamespace ak09916\n{\n\nAK09916 *g_dev_ext;\nAK09916 *g_dev_int;\n\nvoid start(bool, enum Rotation);\nvoid info(bool);\nvoid usage();\n\n\/**\n * Start the driver.\n *\n * This function only returns if the driver is up and running\n * or failed to detect the sensor.\n *\/\nvoid start(bool external_bus, enum Rotation rotation)\n{\n\tAK09916 **g_dev_ptr = (external_bus ? &g_dev_ext : &g_dev_int);\n\tconst char *path = (external_bus ? AK09916_DEVICE_PATH_MAG_EXT : AK09916_DEVICE_PATH_MAG);\n\n\tif (*g_dev_ptr != nullptr)\n\t\t\/* if already started, the still command succeeded *\/\n\t{\n\t\tPX4_ERR(\"already started\");\n\t\texit(0);\n\t}\n\n\t\/* create the driver *\/\n\tif (external_bus) {\n#if defined(PX4_I2C_BUS_EXPANSION)\n\t\t*g_dev_ptr = new AK09916(PX4_I2C_BUS_EXPANSION, path, rotation);\n#else\n\t\tPX4_ERR(\"External I2C not available\");\n\t\texit(0);\n#endif\n\n\t} else {\n\t\tPX4_ERR(\"Internal I2C not available\");\n\t\texit(0);\n\t}\n\n\tif (*g_dev_ptr == nullptr) {\n\t\tgoto fail;\n\t}\n\n\n\tif (OK != (*g_dev_ptr)->init()) {\n\t\tgoto fail;\n\t}\n\n\texit(0);\nfail:\n\n\tif (*g_dev_ptr != nullptr) {\n\t\tdelete (*g_dev_ptr);\n\t\t*g_dev_ptr = nullptr;\n\t}\n\n\tPX4_ERR(\"driver start failed\");\n\texit(1);\n}\n\nvoid\nstop(bool external_bus)\n{\n\tAK09916 **g_dev_ptr = external_bus ? &g_dev_ext : &g_dev_int;\n\n\tif (*g_dev_ptr == nullptr) {\n\t\tPX4_ERR(\"driver not running\");\n\t\texit(1);\n\t}\n\n\t(*g_dev_ptr)->stop();\n\n\texit(0);\n}\n\nvoid\ninfo(bool external_bus)\n{\n\tAK09916 **g_dev_ptr = external_bus ? &g_dev_ext : &g_dev_int;\n\n\tif (*g_dev_ptr == nullptr) {\n\t\tPX4_ERR(\"driver not running\");\n\t\texit(1);\n\t}\n\n\tprintf(\"state @ %p\\n\", *g_dev_ptr);\n\t(*g_dev_ptr)->print_info();\n\n\texit(0);\n}\n\nvoid\nusage()\n{\n\tPX4_WARN(\"missing command: try 'start', 'info', stop'\");\n\tPX4_WARN(\"options:\");\n\tPX4_WARN(\"    -X    (external bus)\");\n\n}\n\n} \/\/ namespace AK09916\n\n\/\/ If interface is non-null, then it will used for interacting with the device.\n\/\/ Otherwise, it will passthrough the parent AK09916\nAK09916::AK09916(int bus, const char *path, enum Rotation rotation) :\n\tI2C(\"AK09916\", path, bus, AK09916_I2C_ADDR, 400000),\n\tScheduledWorkItem(px4::device_bus_to_wq(get_device_id())),\n\t_px4_mag(get_device_id(), ORB_PRIO_MAX, rotation),\n\t_mag_reads(perf_alloc(PC_COUNT, \"ak09916_mag_reads\")),\n\t_mag_errors(perf_alloc(PC_COUNT, \"ak09916_mag_errors\")),\n\t_mag_overruns(perf_alloc(PC_COUNT, \"ak09916_mag_overruns\")),\n\t_mag_overflows(perf_alloc(PC_COUNT, \"ak09916_mag_overflows\")),\n\t_mag_duplicates(perf_alloc(PC_COUNT, \"ak09916_mag_duplicates\"))\n{\n\t_px4_mag.set_device_type(DRV_MAG_DEVTYPE_AK09916);\n\t_px4_mag.set_scale(AK09916_MAG_RANGE_GA);\n}\n\nAK09916::~AK09916()\n{\n\tperf_free(_mag_reads);\n\tperf_free(_mag_errors);\n\tperf_free(_mag_overruns);\n\tperf_free(_mag_overflows);\n\tperf_free(_mag_duplicates);\n}\n\nint\nAK09916::init()\n{\n\tint ret = I2C::init();\n\n\t\/* if cdev init failed, bail now *\/\n\tif (ret != OK) {\n\t\tDEVICE_DEBUG(\"AK09916 mag init failed\");\n\n\t\treturn ret;\n\t}\n\n\tret = reset();\n\n\tif (ret != PX4_OK) {\n\t\treturn PX4_ERROR;\n\t}\n\n\tstart();\n\n\treturn PX4_OK;\n}\n\nbool AK09916::check_duplicate(uint8_t *mag_data)\n{\n\tif (memcmp(mag_data, &_last_mag_data, sizeof(_last_mag_data)) == 0) {\n\t\t\/\/ it isn't new data - wait for next timer\n\t\treturn true;\n\n\t} else {\n\t\tmemcpy(&_last_mag_data, mag_data, sizeof(_last_mag_data));\n\t\treturn false;\n\t}\n}\n\nvoid\nAK09916::measure()\n{\n\tuint8_t cmd = AK09916REG_ST1;\n\tstruct ak09916_regs raw_data;\n\n\tconst hrt_abstime timestamp_sample = hrt_absolute_time();\n\tuint8_t ret = transfer(&cmd, 1, (uint8_t *)(&raw_data), sizeof(struct ak09916_regs));\n\n\tif (ret == OK) {\n\t\traw_data.st2 = raw_data.st2;\n\n\t\tif (check_duplicate((uint8_t *)&raw_data.x) && !(raw_data.st1 & 0x02)) {\n\t\t\tperf_count(_mag_duplicates);\n\t\t\treturn;\n\t\t}\n\n\t\t\/* monitor for if data overrun flag is ever set *\/\n\t\tif (raw_data.st1 & 0x02) {\n\t\t\tperf_count(_mag_overruns);\n\t\t}\n\n\t\t\/* monitor for if magnetic sensor overflow flag is ever set noting that st2\n\t\t* is usually not even refreshed, but will always be in the same place in the\n\t\t* mpu's buffers regardless, hence the actual count would be bogus\n\t\t*\/\n\t\tif (raw_data.st2 & 0x08) {\n\t\t\tperf_count(_mag_overflows);\n\t\t}\n\n\t\t_px4_mag.set_error_count(perf_event_count(_mag_errors));\n\t\t_px4_mag.update(timestamp_sample, raw_data.x, raw_data.y, raw_data.z);\n\t}\n}\n\nvoid\nAK09916::print_info()\n{\n\tperf_print_counter(_mag_reads);\n\tperf_print_counter(_mag_errors);\n\tperf_print_counter(_mag_overruns);\n\t_px4_mag.print_status();\n}\n\nuint8_t\nAK09916::read_reg(uint8_t reg)\n{\n\tconst uint8_t cmd = reg;\n\tuint8_t ret{};\n\n\ttransfer(&cmd, 1, &ret, 1);\n\n\treturn ret;\n}\n\nbool\nAK09916::check_id(uint8_t &deviceid)\n{\n\tdeviceid = read_reg(AK09916REG_WIA);\n\n\treturn (AK09916_DEVICE_ID_A == deviceid);\n}\n\nvoid\nAK09916::write_reg(uint8_t reg, uint8_t value)\n{\n\tconst uint8_t cmd[2] = { reg, value};\n\ttransfer(cmd, 2, nullptr, 0);\n}\n\nint\nAK09916::reset()\n{\n\tint rv = probe();\n\n\tif (rv == OK) {\n\t\t\/\/ Now reset the mag\n\t\twrite_reg(AK09916REG_CNTL3, AK09916_RESET);\n\n\t\t\/\/ Then re-initialize the bus\/mag\n\t\trv = setup();\n\t}\n\n\treturn rv;\n}\n\nint\nAK09916::probe()\n{\n\tint retries = 10;\n\n\tdo {\n\t\twrite_reg(AK09916REG_CNTL3, AK09916_RESET);\n\n\t\tuint8_t id = 0;\n\n\t\tif (check_id(id)) {\n\t\t\treturn OK;\n\t\t}\n\n\t\tretries--;\n\t} while (retries > 0);\n\n\treturn PX4_ERROR;\n}\n\nint\nAK09916::setup()\n{\n\twrite_reg(AK09916REG_CNTL2, AK09916_CNTL2_CONTINOUS_MODE_100HZ);\n\n\treturn OK;\n}\n\nvoid\nAK09916::start()\n{\n\t_measure_interval = AK09916_CONVERSION_INTERVAL;\n\n\t\/* schedule a cycle to start things *\/\n\tScheduleNow();\n}\n\nvoid\nAK09916::stop()\n{\n\t\/* ensure no new items are queued while we cancel this one *\/\n\t_measure_interval = 0;\n\n\tScheduleClear();\n}\n\nvoid\nAK09916::Run()\n{\n\tif (_measure_interval == 0) {\n\t\treturn;\n\t}\n\n\t\/* measurement phase *\/\n\tmeasure();\n\n\tif (_measure_interval > 0) {\n\t\t\/* schedule a fresh cycle call when the measurement is done *\/\n\t\tScheduleDelayed(_measure_interval);\n\t}\n}\n\nint\nak09916_main(int argc, char *argv[])\n{\n\tint myoptind = 1;\n\tint ch;\n\tconst char *myoptarg = nullptr;\n\tbool external_bus = false;\n\tenum Rotation rotation = ROTATION_NONE;\n\n\twhile ((ch = px4_getopt(argc, argv, \"XR:\", &myoptind, &myoptarg)) != EOF) {\n\t\tswitch (ch) {\n\t\tcase 'X':\n\t\t\texternal_bus = true;\n\t\t\tbreak;\n\n\t\tcase 'R':\n\t\t\trotation = (enum Rotation)atoi(myoptarg);\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tak09916::usage();\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\tif (myoptind >= argc) {\n\t\tak09916::usage();\n\t\treturn -1;\n\t}\n\n\tconst char *verb = argv[myoptind];\n\n\t\/*\n\t * Start\/load the driver.\n\t *\/\n\tif (!strcmp(verb, \"start\")) {\n\t\tak09916::start(external_bus, rotation);\n\t}\n\n\t\/*\n\t * Stop the driver.\n\t *\/\n\tif (!strcmp(verb, \"stop\")) {\n\t\tak09916::stop(external_bus);\n\t}\n\n\t\/*\n\t * Print driver information.\n\t *\/\n\tif (!strcmp(verb, \"info\")) {\n\t\tak09916::info(external_bus);\n\t}\n\n\tak09916::usage();\n\treturn -1;\n}\n<commit_msg>ak09916: fixed driver not reporting magnetometer as external<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\/**\n * @file mag.cpp\n *\n * Driver for the ak09916 magnetometer within the Invensense mpu9250\n *\n * @author Robert Dickenson\n *\n *\/\n\n#include <px4_config.h>\n#include <px4_log.h>\n#include <px4_time.h>\n#include <lib\/perf\/perf_counter.h>\n#include <drivers\/drv_hrt.h>\n#include <lib\/conversion\/rotation.h>\n#include <px4_getopt.h>\n\n#include \"ak09916.hpp\"\n\n\n\/** driver 'main' command *\/\nextern \"C\" { __EXPORT int ak09916_main(int argc, char *argv[]); }\n\n#define AK09916_CONVERSION_INTERVAL\t(1000000 \/ 100)\t\/* microseconds *\/\n\nnamespace ak09916\n{\n\nAK09916 *g_dev_ext;\nAK09916 *g_dev_int;\n\nvoid start(bool, enum Rotation);\nvoid info(bool);\nvoid usage();\n\n\/**\n * Start the driver.\n *\n * This function only returns if the driver is up and running\n * or failed to detect the sensor.\n *\/\nvoid start(bool external_bus, enum Rotation rotation)\n{\n\tAK09916 **g_dev_ptr = (external_bus ? &g_dev_ext : &g_dev_int);\n\tconst char *path = (external_bus ? AK09916_DEVICE_PATH_MAG_EXT : AK09916_DEVICE_PATH_MAG);\n\n\tif (*g_dev_ptr != nullptr)\n\t\t\/* if already started, the still command succeeded *\/\n\t{\n\t\tPX4_ERR(\"already started\");\n\t\texit(0);\n\t}\n\n\t\/* create the driver *\/\n\tif (external_bus) {\n#if defined(PX4_I2C_BUS_EXPANSION)\n\t\t*g_dev_ptr = new AK09916(PX4_I2C_BUS_EXPANSION, path, rotation);\n#else\n\t\tPX4_ERR(\"External I2C not available\");\n\t\texit(0);\n#endif\n\n\t} else {\n\t\tPX4_ERR(\"Internal I2C not available\");\n\t\texit(0);\n\t}\n\n\tif (*g_dev_ptr == nullptr) {\n\t\tgoto fail;\n\t}\n\n\n\tif (OK != (*g_dev_ptr)->init()) {\n\t\tgoto fail;\n\t}\n\n\texit(0);\nfail:\n\n\tif (*g_dev_ptr != nullptr) {\n\t\tdelete (*g_dev_ptr);\n\t\t*g_dev_ptr = nullptr;\n\t}\n\n\tPX4_ERR(\"driver start failed\");\n\texit(1);\n}\n\nvoid\nstop(bool external_bus)\n{\n\tAK09916 **g_dev_ptr = external_bus ? &g_dev_ext : &g_dev_int;\n\n\tif (*g_dev_ptr == nullptr) {\n\t\tPX4_ERR(\"driver not running\");\n\t\texit(1);\n\t}\n\n\t(*g_dev_ptr)->stop();\n\n\texit(0);\n}\n\nvoid\ninfo(bool external_bus)\n{\n\tAK09916 **g_dev_ptr = external_bus ? &g_dev_ext : &g_dev_int;\n\n\tif (*g_dev_ptr == nullptr) {\n\t\tPX4_ERR(\"driver not running\");\n\t\texit(1);\n\t}\n\n\tprintf(\"state @ %p\\n\", *g_dev_ptr);\n\t(*g_dev_ptr)->print_info();\n\n\texit(0);\n}\n\nvoid\nusage()\n{\n\tPX4_WARN(\"missing command: try 'start', 'info', stop'\");\n\tPX4_WARN(\"options:\");\n\tPX4_WARN(\"    -X    (external bus)\");\n\n}\n\n} \/\/ namespace AK09916\n\n\/\/ If interface is non-null, then it will used for interacting with the device.\n\/\/ Otherwise, it will passthrough the parent AK09916\nAK09916::AK09916(int bus, const char *path, enum Rotation rotation) :\n\tI2C(\"AK09916\", path, bus, AK09916_I2C_ADDR, 400000),\n\tScheduledWorkItem(px4::device_bus_to_wq(get_device_id())),\n\t_px4_mag(get_device_id(), ORB_PRIO_MAX, rotation),\n\t_mag_reads(perf_alloc(PC_COUNT, \"ak09916_mag_reads\")),\n\t_mag_errors(perf_alloc(PC_COUNT, \"ak09916_mag_errors\")),\n\t_mag_overruns(perf_alloc(PC_COUNT, \"ak09916_mag_overruns\")),\n\t_mag_overflows(perf_alloc(PC_COUNT, \"ak09916_mag_overflows\")),\n\t_mag_duplicates(perf_alloc(PC_COUNT, \"ak09916_mag_duplicates\"))\n{\n\t_px4_mag.set_device_type(DRV_MAG_DEVTYPE_AK09916);\n\t_px4_mag.set_scale(AK09916_MAG_RANGE_GA);\n}\n\nAK09916::~AK09916()\n{\n\tperf_free(_mag_reads);\n\tperf_free(_mag_errors);\n\tperf_free(_mag_overruns);\n\tperf_free(_mag_overflows);\n\tperf_free(_mag_duplicates);\n}\n\nint\nAK09916::init()\n{\n\tint ret = I2C::init();\n\n\t\/* if cdev init failed, bail now *\/\n\tif (ret != OK) {\n\t\tDEVICE_DEBUG(\"AK09916 mag init failed\");\n\n\t\treturn ret;\n\t}\n\n\tret = reset();\n\n\tif (ret != PX4_OK) {\n\t\treturn PX4_ERROR;\n\t}\n\n\tstart();\n\n\treturn PX4_OK;\n}\n\nbool AK09916::check_duplicate(uint8_t *mag_data)\n{\n\tif (memcmp(mag_data, &_last_mag_data, sizeof(_last_mag_data)) == 0) {\n\t\t\/\/ it isn't new data - wait for next timer\n\t\treturn true;\n\n\t} else {\n\t\tmemcpy(&_last_mag_data, mag_data, sizeof(_last_mag_data));\n\t\treturn false;\n\t}\n}\n\nvoid\nAK09916::measure()\n{\n\tuint8_t cmd = AK09916REG_ST1;\n\tstruct ak09916_regs raw_data;\n\n\tconst hrt_abstime timestamp_sample = hrt_absolute_time();\n\tuint8_t ret = transfer(&cmd, 1, (uint8_t *)(&raw_data), sizeof(struct ak09916_regs));\n\n\tif (ret == OK) {\n\t\traw_data.st2 = raw_data.st2;\n\n\t\tif (check_duplicate((uint8_t *)&raw_data.x) && !(raw_data.st1 & 0x02)) {\n\t\t\tperf_count(_mag_duplicates);\n\t\t\treturn;\n\t\t}\n\n\t\t\/* monitor for if data overrun flag is ever set *\/\n\t\tif (raw_data.st1 & 0x02) {\n\t\t\tperf_count(_mag_overruns);\n\t\t}\n\n\t\t\/* monitor for if magnetic sensor overflow flag is ever set noting that st2\n\t\t* is usually not even refreshed, but will always be in the same place in the\n\t\t* mpu's buffers regardless, hence the actual count would be bogus\n\t\t*\/\n\t\tif (raw_data.st2 & 0x08) {\n\t\t\tperf_count(_mag_overflows);\n\t\t}\n\n\t\t_px4_mag.set_error_count(perf_event_count(_mag_errors));\n\t\t_px4_mag.set_external(external());\n\t\t_px4_mag.update(timestamp_sample, raw_data.x, raw_data.y, raw_data.z);\n\t}\n}\n\nvoid\nAK09916::print_info()\n{\n\tperf_print_counter(_mag_reads);\n\tperf_print_counter(_mag_errors);\n\tperf_print_counter(_mag_overruns);\n\t_px4_mag.print_status();\n}\n\nuint8_t\nAK09916::read_reg(uint8_t reg)\n{\n\tconst uint8_t cmd = reg;\n\tuint8_t ret{};\n\n\ttransfer(&cmd, 1, &ret, 1);\n\n\treturn ret;\n}\n\nbool\nAK09916::check_id(uint8_t &deviceid)\n{\n\tdeviceid = read_reg(AK09916REG_WIA);\n\n\treturn (AK09916_DEVICE_ID_A == deviceid);\n}\n\nvoid\nAK09916::write_reg(uint8_t reg, uint8_t value)\n{\n\tconst uint8_t cmd[2] = { reg, value};\n\ttransfer(cmd, 2, nullptr, 0);\n}\n\nint\nAK09916::reset()\n{\n\tint rv = probe();\n\n\tif (rv == OK) {\n\t\t\/\/ Now reset the mag\n\t\twrite_reg(AK09916REG_CNTL3, AK09916_RESET);\n\n\t\t\/\/ Then re-initialize the bus\/mag\n\t\trv = setup();\n\t}\n\n\treturn rv;\n}\n\nint\nAK09916::probe()\n{\n\tint retries = 10;\n\n\tdo {\n\t\twrite_reg(AK09916REG_CNTL3, AK09916_RESET);\n\n\t\tuint8_t id = 0;\n\n\t\tif (check_id(id)) {\n\t\t\treturn OK;\n\t\t}\n\n\t\tretries--;\n\t} while (retries > 0);\n\n\treturn PX4_ERROR;\n}\n\nint\nAK09916::setup()\n{\n\twrite_reg(AK09916REG_CNTL2, AK09916_CNTL2_CONTINOUS_MODE_100HZ);\n\n\treturn OK;\n}\n\nvoid\nAK09916::start()\n{\n\t_measure_interval = AK09916_CONVERSION_INTERVAL;\n\n\t\/* schedule a cycle to start things *\/\n\tScheduleNow();\n}\n\nvoid\nAK09916::stop()\n{\n\t\/* ensure no new items are queued while we cancel this one *\/\n\t_measure_interval = 0;\n\n\tScheduleClear();\n}\n\nvoid\nAK09916::Run()\n{\n\tif (_measure_interval == 0) {\n\t\treturn;\n\t}\n\n\t\/* measurement phase *\/\n\tmeasure();\n\n\tif (_measure_interval > 0) {\n\t\t\/* schedule a fresh cycle call when the measurement is done *\/\n\t\tScheduleDelayed(_measure_interval);\n\t}\n}\n\nint\nak09916_main(int argc, char *argv[])\n{\n\tint myoptind = 1;\n\tint ch;\n\tconst char *myoptarg = nullptr;\n\tbool external_bus = false;\n\tenum Rotation rotation = ROTATION_NONE;\n\n\twhile ((ch = px4_getopt(argc, argv, \"XR:\", &myoptind, &myoptarg)) != EOF) {\n\t\tswitch (ch) {\n\t\tcase 'X':\n\t\t\texternal_bus = true;\n\t\t\tbreak;\n\n\t\tcase 'R':\n\t\t\trotation = (enum Rotation)atoi(myoptarg);\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tak09916::usage();\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\tif (myoptind >= argc) {\n\t\tak09916::usage();\n\t\treturn -1;\n\t}\n\n\tconst char *verb = argv[myoptind];\n\n\t\/*\n\t * Start\/load the driver.\n\t *\/\n\tif (!strcmp(verb, \"start\")) {\n\t\tak09916::start(external_bus, rotation);\n\t}\n\n\t\/*\n\t * Stop the driver.\n\t *\/\n\tif (!strcmp(verb, \"stop\")) {\n\t\tak09916::stop(external_bus);\n\t}\n\n\t\/*\n\t * Print driver information.\n\t *\/\n\tif (!strcmp(verb, \"info\")) {\n\t\tak09916::info(external_bus);\n\t}\n\n\tak09916::usage();\n\treturn -1;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Fixed a misspelling<commit_after><|endoftext|>"}
{"text":"<commit_before>#include <ros\/ros.h>\n#include <control_toolbox\/pid.h>\n#include <nav_msgs\/Odometry.h>\n#include <geometry_msgs\/Accel.h>\n#include <tf\/transform_datatypes.h>\n#include \"imu_3dm_gx4\/FilterOutput.h\"\n#include <sensor_msgs\/Imu.h>\n\ncontrol_toolbox::Pid roll, pitch, yaw;\ngeometry_msgs::Accel cmd;\n\nros::Time then;\nros::Duration dt;\n\nros::Subscriber filter_sub;\nros::Subscriber target_sub;\nros::Subscriber feedfwd_sub;\nros::Publisher accel_pub;\n\ndouble state[6] = {};\ndouble target[6] = {};\ndouble error[6] = {};\n\nvoid filter_cb(const imu_3dm_gx4::FilterOutput::ConstPtr& new_state)\n{\n  tf::Quaternion quaternion;\n  tf::quaternionMsgToTF(new_state->orientation, quaternion);\n  tf::Matrix3x3 attitude = tf::Matrix3x3(quaternion);\n  attitude.getRPY(state[0], state[1], state[2]);\n}\n\nvoid imu_cb(const sensor_msgs::Imu::ConstPtr& new_state)\n{\n  state[3] = new_state->angular_velocity.x;\n  state[4] = new_state->angular_velocity.y;\n  state[5] = new_state->angular_velocity.z;\n}\n\nvoid target_cb(const nav_msgs::Odometry::ConstPtr& new_target)\n{\n  tf::Quaternion quaternion;\n  tf::quaternionMsgToTF(new_target->pose.pose.orientation, quaternion);\n  tf::Matrix3x3 attitude = tf::Matrix3x3(quaternion);\n  attitude.getRPY(target[0], target[1], target[2]);\n  target[3] = new_target->twist.twist.angular.x;\n  target[4] = new_target->twist.twist.angular.y;\n  target[5] = new_target->twist.twist.angular.z;\n}\n\nvoid feedfwd_cb(const geometry_msgs::Accel::ConstPtr& feedfwd)\n{\n  cmd.linear.x = feedfwd->linear.x;\n  cmd.linear.y = feedfwd->linear.y;\n  cmd.linear.z = feedfwd->linear.z;\n}\n\nint main(int argc, char **argv)\n{\n  ros::init(argc, argv, \"attitude_controller\");\n  ros::NodeHandle nh;\n  ros::NodeHandle r(\"~roll\");\n  ros::NodeHandle p(\"~pitch\");\n  ros::NodeHandle y(\"~yaw\");\n\n  filter_sub = nh.subscribe<imu_3dm_gx4::FilterOutput>(\"state\/filter\", 1, &filter_cb);\n  target_sub = nh.subscribe<nav_msgs::Odometry>(\"target\/odom\", 1, &target_cb);\n  feedfwd_sub = nh.subscribe<geometry_msgs::Accel>(\"state\/imu\", 1, &feedfwd_cb);\n  accel_pub = nh.advertise<geometry_msgs::Accel>(\"command\/accel\", 1);\n\n  roll.init(r);\n  pitch.init(p);\n  yaw.init(y);\n\n  then = ros::Time::now();\n  ros::Rate rate(50.0);\n\n  while(ros::ok())\n  {\n    ros::spinOnce();\n\n    for(int i = 0; i < 6; i ++)\n    {\n      error[i] = target[i] - state[i];\n    }\n    dt = ros::Time::now() - then;\n\n    cmd.angular.x = roll.computeCommand(error[0], error[3], dt);\n    cmd.angular.y = pitch.computeCommand(error[1], error[4], dt);\n    cmd.angular.z = yaw.computeCommand(error[2], error[5], dt);\n\n    accel_pub.publish(cmd);\n    rate.sleep();\n  }\n}\n<commit_msg>Switch to imu message.<commit_after>#include <ros\/ros.h>\n#include <control_toolbox\/pid.h>\n#include <nav_msgs\/Odometry.h>\n#include <geometry_msgs\/Accel.h>\n#include <tf\/transform_datatypes.h>\n#include \"imu_3dm_gx4\/FilterOutput.h\"\n#include <sensor_msgs\/Imu.h>\n\ncontrol_toolbox::Pid roll, pitch, yaw;\ngeometry_msgs::Accel cmd;\n\nros::Time then;\nros::Duration dt;\n\nros::Subscriber filter_sub;\nros::Subscriber target_sub;\nros::Subscriber feedfwd_sub;\nros::Publisher accel_pub;\n\ndouble state[6] = {};\ndouble target[6] = {};\ndouble error[6] = {};\n\nvoid filter_cb(const imu_3dm_gx4::FilterOutput::ConstPtr& new_state)\n{\n  tf::Quaternion quaternion;\n  tf::quaternionMsgToTF(new_state->orientation, quaternion);\n  tf::Matrix3x3 attitude = tf::Matrix3x3(quaternion);\n  attitude.getRPY(state[0], state[1], state[2]);\n}\n\nvoid imu_cb(const sensor_msgs::Imu::ConstPtr& new_state)\n{\n  state[3] = new_state->angular_velocity.x;\n  state[4] = new_state->angular_velocity.y;\n  state[5] = new_state->angular_velocity.z;\n}\n\nvoid target_cb(const nav_msgs::Odometry::ConstPtr& new_target)\n{\n  tf::Quaternion quaternion;\n  tf::quaternionMsgToTF(new_target->pose.pose.orientation, quaternion);\n  tf::Matrix3x3 attitude = tf::Matrix3x3(quaternion);\n  attitude.getRPY(target[0], target[1], target[2]);\n  target[3] = new_target->twist.twist.angular.x;\n  target[4] = new_target->twist.twist.angular.y;\n  target[5] = new_target->twist.twist.angular.z;\n}\n\nvoid feedfwd_cb(const sensor_msgs::Imu::ConstPtr& feedfwd)\n{\n  cmd.linear.x = feedfwd->linear_acceleration.x;\n  cmd.linear.y = feedfwd->linear_acceleration.y;\n  cmd.linear.z = feedfwd->linear_acceleration.z;\n}\n\nint main(int argc, char **argv)\n{\n  ros::init(argc, argv, \"attitude_controller\");\n  ros::NodeHandle nh;\n  ros::NodeHandle r(\"~roll\");\n  ros::NodeHandle p(\"~pitch\");\n  ros::NodeHandle y(\"~yaw\");\n\n  filter_sub = nh.subscribe<imu_3dm_gx4::FilterOutput>(\"state\/filter\", 1, &filter_cb);\n  target_sub = nh.subscribe<nav_msgs::Odometry>(\"target\/odom\", 1, &target_cb);\n  feedfwd_sub = nh.subscribe<sensor_msgs::Imu>(\"state\/imu\", 1, &feedfwd_cb);\n  accel_pub = nh.advertise<geometry_msgs::Accel>(\"command\/accel\", 1);\n\n  roll.init(r);\n  pitch.init(p);\n  yaw.init(y);\n\n  then = ros::Time::now();\n  ros::Rate rate(50.0);\n\n  while(ros::ok())\n  {\n    ros::spinOnce();\n\n    for(int i = 0; i < 6; i ++)\n    {\n      error[i] = target[i] - state[i];\n    }\n    dt = ros::Time::now() - then;\n\n    cmd.angular.x = roll.computeCommand(error[0], error[3], dt);\n    cmd.angular.y = pitch.computeCommand(error[1], error[4], dt);\n    cmd.angular.z = yaw.computeCommand(error[2], error[5], dt);\n\n    accel_pub.publish(cmd);\n    rate.sleep();\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/roostats:$Id$\n\/\/ Author: Kyle Cranmer, Lorenzo Moneta, Gregory Schott, Wouter Verkerke, Sven Kreiss\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#include \"RooStats\/ModelConfig.h\"\n\n#include \"TROOT.h\"\n\n#ifndef ROO_MSG_SERVICE\n#include \"RooMsgService.h\"\n#endif\n\n#ifndef RooStats_RooStatsUtils\n#include \"RooStats\/RooStatsUtils.h\"\n#endif\n\n#include <sstream>\n\n\nClassImp(RooStats::ModelConfig)\n\nusing namespace std;\n\nnamespace RooStats {\n\nvoid ModelConfig::GuessObsAndNuisance(const RooAbsData& data) {\n   \/\/ Makes sensible guesses of observables, parameters of interest\n   \/\/ and nuisance parameters.\n   \/\/\n   \/\/ Defaults:\n   \/\/  observables: determined from data,\n   \/\/  global observables = explicit obs  -  obs from data\n   \/\/  parameters of interest: empty,\n   \/\/  nuisance parameters: all parameters except parameters of interest\n  \/\/\n  \/\/ We use NULL to mean not set, so we don't want to fill\n  \/\/ with empty RooArgSets\n\n   \/\/ observables\n  if (!GetObservables()) {\n    SetObservables(*GetPdf()->getObservables(data));\n    \/\/const RooArgSet* temp = data.get();\n    \/\/     SetObservables(*(RooArgSet*)temp->snapshot());\n    \/\/     delete temp;\n   }\n   if (!GetGlobalObservables()) {\n      RooArgSet co(*GetObservables());\n      co.remove(*GetPdf()->getObservables(data));\n      RemoveConstantParameters(&co);\n      if(co.getSize()>0)\n\tSetGlobalObservables(co);\n\n      \/\/ TODO BUG This does not work as observables with the same name are already in the workspace.\n      \/*\n      RooArgSet o(*GetObservables());\n      o.remove(co);\n      SetObservables(o);\n      *\/\n   }\n\n   \/\/ parameters\n   \/\/   if (!GetParametersOfInterest()) {\n   \/\/      SetParametersOfInterest(RooArgSet());\n   \/\/   }\n   if (!GetNuisanceParameters()) {\n      RooArgSet p(*GetPdf()->getParameters(data));\n      p.remove(*GetParametersOfInterest());\n      RemoveConstantParameters(&p);\n      if(p.getSize()>0)\n\tSetNuisanceParameters(p);\n   }\n\n   Print();\n}\n\nvoid ModelConfig::Print(Option_t*) const {\n   \/\/ print contents\n   ccoutI(InputArguments) << endl << \"=== Using the following for \" << GetName() << \" ===\" << endl;\n\n   \/\/ necessary so that GetObservables()->Print(\"\") gets piped to the\n   \/\/ ccoutI(InputArguments) stream\n   ostream& oldstream = RooPrintable::defaultPrintStream(&ccoutI(InputArguments));\n\n   \/\/ args\n   if(GetObservables()){\n      ccoutI(InputArguments) << \"Observables:             \";\n      GetObservables()->Print(\"\");\n   }\n   if(GetParametersOfInterest()) {\n      ccoutI(InputArguments) << \"Parameters of Interest:  \";\n      GetParametersOfInterest()->Print(\"\");\n   }\n   if(GetNuisanceParameters()){\n      ccoutI(InputArguments) << \"Nuisance Parameters:     \";\n      GetNuisanceParameters()->Print(\"\");\n   }\n   if(GetGlobalObservables()){\n      ccoutI(InputArguments) << \"Global Observables:      \";\n      GetGlobalObservables()->Print(\"\");\n   }\n   if(GetConstraintParameters()){\n      ccoutI(InputArguments) << \"Constraint Parameters:   \";\n      GetConstraintParameters()->Print(\"\");\n   }\n   if(GetConditionalObservables()){\n      ccoutI(InputArguments) << \"Conditional Observables: \";\n      GetConditionalObservables()->Print(\"\");\n   }\n   if(GetProtoData()){\n      ccoutI(InputArguments) << \"Proto Data:              \";\n      GetProtoData()->Print(\"\");\n   }\n\n   \/\/ pdfs\n   if(GetPdf()) {\n      ccoutI(InputArguments) << \"PDF:                     \";\n      GetPdf()->Print(\"\");\n   }\n   if(GetPriorPdf()) {\n      ccoutI(InputArguments) << \"Prior PDF:               \";\n      GetPriorPdf()->Print(\"\");\n   }\n\n   \/\/ snapshot\n   const RooArgSet * snapshot = GetSnapshot();\n   if(snapshot) {\n      ccoutI(InputArguments) << \"Snapshot:                \" << endl;\n      snapshot->Print(\"v\");\n      delete snapshot;\n   }\n\n   ccoutI(InputArguments) << endl;\n   RooPrintable::defaultPrintStream(&oldstream);\n}\n\n\nvoid ModelConfig::SetWS(RooWorkspace & ws) {\n   \/\/ set a workspace that owns all the necessary components for the analysis\n   if( !fRefWS.GetObject() ) {\n      fRefWS = &ws; \n      fWSName = ws.GetName();\n   }   \n   else{\n      RooFit::MsgLevel level = RooMsgService::instance().globalKillBelow();\n      RooMsgService::instance().setGlobalKillBelow(RooFit::ERROR) ;\n      GetWS()->merge(ws);\n      RooMsgService::instance().setGlobalKillBelow(level) ;\n   }\n}\n\nRooWorkspace * ModelConfig::GetWS() const {\n   \/\/ get from TRef\n   RooWorkspace *ws = dynamic_cast<RooWorkspace *>(fRefWS.GetObject() );\n   if(!ws) {\n      coutE(ObjectHandling) << \"workspace not set\" << endl;\n      return NULL;\n   }\n   return ws;\n}\n\nvoid ModelConfig::SetSnapshot(const RooArgSet& set) {\n   \/\/ save snaphot in the workspace \n   \/\/ and use values passed with the set\n   if ( !GetWS() ) return;\n\n   fSnapshotName = GetName();\n   if (fSnapshotName.size()  > 0) fSnapshotName += \"_\";\n   fSnapshotName += set.GetName();\n   if (fSnapshotName.size()  > 0) fSnapshotName += \"_\";\n   fSnapshotName += \"snapshot\";\n   GetWS()->saveSnapshot(fSnapshotName.c_str(), set, true);  \/\/ import also the given parameter values\n   DefineSetInWS(fSnapshotName.c_str(), set);\n}    \n\nconst RooArgSet * ModelConfig::GetSnapshot() const{\n   \/\/ Load the snapshot from ws and return the corresponding set with the snapshot values.\n   \/\/ User must delete returned RooArgSet.\n   if ( !GetWS() ) return 0;\n   if (!fSnapshotName.length()) return 0;\n   if (!(GetWS()->loadSnapshot(fSnapshotName.c_str())) ) return 0;\n\n   return dynamic_cast<const RooArgSet*>(GetWS()->set(fSnapshotName.c_str() )->snapshot());\n}\n\nvoid ModelConfig::LoadSnapshot() const{\n   \/\/ load the snapshot from ws if it exists\n   if ( !GetWS() ) return;\n\n   \/\/ kill output\n   RooFit::MsgLevel level = RooMsgService::instance().globalKillBelow();\n   RooMsgService::instance().setGlobalKillBelow(RooFit::ERROR);\n   GetWS()->loadSnapshot(fSnapshotName.c_str());\n   RooMsgService::instance().setGlobalKillBelow(level);\n}\n\nvoid ModelConfig::DefineSetInWS(const char* name, const RooArgSet& set) {\n   \/\/ helper functions to avoid code duplication\n   if ( !GetWS() ) return;\n\n   if (  GetWS()->set(name) ) {\n      GetWS()->removeSet(name);\n   }\n   \n   RooFit::MsgLevel level = RooMsgService::instance().globalKillBelow();\n   RooMsgService::instance().setGlobalKillBelow(RooFit::ERROR) ;\n\n   GetWS()->defineSet(name, set,true);\n\n   RooMsgService::instance().setGlobalKillBelow(level) ;\n   \n}\n   \nvoid ModelConfig::ImportPdfInWS(const RooAbsPdf & pdf) { \n   \/\/ internal function to import Pdf in WS \n   if ( !GetWS() ) return;\n\n   if (! GetWS()->pdf( pdf.GetName() ) ){\n      RooFit::MsgLevel level = RooMsgService::instance().globalKillBelow();\n      RooMsgService::instance().setGlobalKillBelow(RooFit::ERROR) ;\n      GetWS()->import(pdf, RooFit::RecycleConflictNodes());\n      RooMsgService::instance().setGlobalKillBelow(level) ;\n   }\n}\n   \nvoid ModelConfig::ImportDataInWS(RooAbsData & data) { \n   \/\/ internal function to import data in WS\n   if ( !GetWS() ) return;\n\n   if (! GetWS()->data( data.GetName() ) ){\n      RooFit::MsgLevel level = RooMsgService::instance().globalKillBelow();\n      RooMsgService::instance().setGlobalKillBelow(RooFit::ERROR) ;\n      GetWS()->import(data);\n      RooMsgService::instance().setGlobalKillBelow(level) ;\n   }\n}\n\n\n} \/\/ end namespace RooStats\n<commit_msg>fix ModelConfig::GetSnapshot to just retrieve the snapshot in a an argset and not doing also a Load.  use instead ModelCOnfig::LoadSnapshot for lofing the snapshot values <commit_after>\/\/ @(#)root\/roostats:$Id$\n\/\/ Author: Kyle Cranmer, Lorenzo Moneta, Gregory Schott, Wouter Verkerke, Sven Kreiss\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#include \"RooStats\/ModelConfig.h\"\n\n#include \"TROOT.h\"\n\n#ifndef ROO_MSG_SERVICE\n#include \"RooMsgService.h\"\n#endif\n\n#ifndef RooStats_RooStatsUtils\n#include \"RooStats\/RooStatsUtils.h\"\n#endif\n\n#include <sstream>\n\n\nClassImp(RooStats::ModelConfig)\n\nusing namespace std;\n\nnamespace RooStats {\n\nvoid ModelConfig::GuessObsAndNuisance(const RooAbsData& data) {\n   \/\/ Makes sensible guesses of observables, parameters of interest\n   \/\/ and nuisance parameters.\n   \/\/\n   \/\/ Defaults:\n   \/\/  observables: determined from data,\n   \/\/  global observables = explicit obs  -  obs from data\n   \/\/  parameters of interest: empty,\n   \/\/  nuisance parameters: all parameters except parameters of interest\n  \/\/\n  \/\/ We use NULL to mean not set, so we don't want to fill\n  \/\/ with empty RooArgSets\n\n   \/\/ observables\n  if (!GetObservables()) {\n    SetObservables(*GetPdf()->getObservables(data));\n    \/\/const RooArgSet* temp = data.get();\n    \/\/     SetObservables(*(RooArgSet*)temp->snapshot());\n    \/\/     delete temp;\n   }\n   if (!GetGlobalObservables()) {\n      RooArgSet co(*GetObservables());\n      co.remove(*GetPdf()->getObservables(data));\n      RemoveConstantParameters(&co);\n      if(co.getSize()>0)\n\tSetGlobalObservables(co);\n\n      \/\/ TODO BUG This does not work as observables with the same name are already in the workspace.\n      \/*\n      RooArgSet o(*GetObservables());\n      o.remove(co);\n      SetObservables(o);\n      *\/\n   }\n\n   \/\/ parameters\n   \/\/   if (!GetParametersOfInterest()) {\n   \/\/      SetParametersOfInterest(RooArgSet());\n   \/\/   }\n   if (!GetNuisanceParameters()) {\n      RooArgSet p(*GetPdf()->getParameters(data));\n      p.remove(*GetParametersOfInterest());\n      RemoveConstantParameters(&p);\n      if(p.getSize()>0)\n\tSetNuisanceParameters(p);\n   }\n\n   Print();\n}\n\nvoid ModelConfig::Print(Option_t*) const {\n   \/\/ print contents of Model on the default print stream \n   \/\/ It can be changed using RooPrintable\n   ostream& os = RooPrintable::defaultPrintStream();\n\n   os << endl << \"=== Using the following for \" << GetName() << \" ===\" << endl;\n\n \n   \/\/ args\n   if(GetObservables()){\n      os << \"Observables:             \";\n      GetObservables()->Print(\"\");\n   }\n   if(GetParametersOfInterest()) {\n      os << \"Parameters of Interest:  \";\n      GetParametersOfInterest()->Print(\"\");\n   }\n   if(GetNuisanceParameters()){\n      os << \"Nuisance Parameters:     \";\n      GetNuisanceParameters()->Print(\"\");\n   }\n   if(GetGlobalObservables()){\n      os << \"Global Observables:      \";\n      GetGlobalObservables()->Print(\"\");\n   }\n   if(GetConstraintParameters()){\n      os << \"Constraint Parameters:   \";\n      GetConstraintParameters()->Print(\"\");\n   }\n   if(GetConditionalObservables()){\n      os << \"Conditional Observables: \";\n      GetConditionalObservables()->Print(\"\");\n   }\n   if(GetProtoData()){\n      os << \"Proto Data:              \";\n      GetProtoData()->Print(\"\");\n   }\n\n   \/\/ pdfs\n   if(GetPdf()) {\n      os << \"PDF:                     \";\n      GetPdf()->Print(\"\");\n   }\n   if(GetPriorPdf()) {\n      os << \"Prior PDF:               \";\n      GetPriorPdf()->Print(\"\");\n   }\n\n   \/\/ snapshot\n   const RooArgSet * snapshot = GetSnapshot();\n   if(snapshot) {\n      os << \"Snapshot:                \" << endl;\n      snapshot->Print(\"v\");\n      delete snapshot;\n   }\n\n   os << endl;\n}\n\n\nvoid ModelConfig::SetWS(RooWorkspace & ws) {\n   \/\/ set a workspace that owns all the necessary components for the analysis\n   if( !fRefWS.GetObject() ) {\n      fRefWS = &ws; \n      fWSName = ws.GetName();\n   }   \n   else{\n      RooFit::MsgLevel level = RooMsgService::instance().globalKillBelow();\n      RooMsgService::instance().setGlobalKillBelow(RooFit::ERROR) ;\n      GetWS()->merge(ws);\n      RooMsgService::instance().setGlobalKillBelow(level) ;\n   }\n}\n\nRooWorkspace * ModelConfig::GetWS() const {\n   \/\/ get from TRef\n   RooWorkspace *ws = dynamic_cast<RooWorkspace *>(fRefWS.GetObject() );\n   if(!ws) {\n      coutE(ObjectHandling) << \"workspace not set\" << endl;\n      return NULL;\n   }\n   return ws;\n}\n\nvoid ModelConfig::SetSnapshot(const RooArgSet& set) {\n   \/\/ save snaphot in the workspace \n   \/\/ and use values passed with the set\n   if ( !GetWS() ) return;\n\n   fSnapshotName = GetName();\n   if (fSnapshotName.size()  > 0) fSnapshotName += \"_\";\n   fSnapshotName += set.GetName();\n   if (fSnapshotName.size()  > 0) fSnapshotName += \"_\";\n   fSnapshotName += \"snapshot\";\n   GetWS()->saveSnapshot(fSnapshotName.c_str(), set, true);  \/\/ import also the given parameter values\n   DefineSetInWS(fSnapshotName.c_str(), set);\n}    \n\nconst RooArgSet * ModelConfig::GetSnapshot() const{\n   \/\/ Load the snapshot from ws and return the corresponding set with the snapshot values.\n   \/\/ User must delete returned RooArgSet.\n   if ( !GetWS() ) return 0;\n   if (!fSnapshotName.length()) return 0;\n   \/\/ calling loadSnapshot will also copy the current parameter values in the workspaces\n   \/\/ since we do not want to change the model parameters - we restore the previous ones \n   if (! GetWS()->set(fSnapshotName.c_str() ) )return 0;\n   RooArgSet snapshotVars(*GetWS()->set(fSnapshotName.c_str() ) );\n   if (snapshotVars.getSize() == 0) return 0;\n   \/\/ make my snapshot which will contain a copy of the snapshot variables \n   RooArgSet tempSnapshot; \n   snapshotVars.snapshot(tempSnapshot);  \n   \/\/ load snapshot value from the workspace \n   if (!(GetWS()->loadSnapshot(fSnapshotName.c_str())) ) return 0;\n   \/\/ by doing this snapshotVars will have the snapshot values - make the snapshot to return\n   const RooArgSet * modelSnapshot = dynamic_cast<const RooArgSet*>( snapshotVars.snapshot());\n   \/\/ restore now the variables of snapshot in ws to their original values\n   \/\/ need to const cast since assign is not const (but in reality in just assign values and does not change the set)\n   \/\/ and anyway the set is const \n   snapshotVars.assignFast(tempSnapshot);\n   return modelSnapshot;  \n}\n\nvoid ModelConfig::LoadSnapshot() const{\n   \/\/ load the snapshot from ws if it exists\n   if ( !GetWS() ) return;\n   GetWS()->loadSnapshot(fSnapshotName.c_str());\n}\n\nvoid ModelConfig::DefineSetInWS(const char* name, const RooArgSet& set) {\n   \/\/ helper functions to avoid code duplication\n   if ( !GetWS() ) return;\n\n   if (  GetWS()->set(name) ) {\n      GetWS()->removeSet(name);\n   }\n   \n   RooFit::MsgLevel level = RooMsgService::instance().globalKillBelow();\n   RooMsgService::instance().setGlobalKillBelow(RooFit::ERROR) ;\n\n   GetWS()->defineSet(name, set,true);\n\n   RooMsgService::instance().setGlobalKillBelow(level) ;\n   \n}\n   \nvoid ModelConfig::ImportPdfInWS(const RooAbsPdf & pdf) { \n   \/\/ internal function to import Pdf in WS \n   if ( !GetWS() ) return;\n\n   if (! GetWS()->pdf( pdf.GetName() ) ){\n      RooFit::MsgLevel level = RooMsgService::instance().globalKillBelow();\n      RooMsgService::instance().setGlobalKillBelow(RooFit::ERROR) ;\n      GetWS()->import(pdf, RooFit::RecycleConflictNodes());\n      RooMsgService::instance().setGlobalKillBelow(level) ;\n   }\n}\n   \nvoid ModelConfig::ImportDataInWS(RooAbsData & data) { \n   \/\/ internal function to import data in WS\n   if ( !GetWS() ) return;\n\n   if (! GetWS()->data( data.GetName() ) ){\n      RooFit::MsgLevel level = RooMsgService::instance().globalKillBelow();\n      RooMsgService::instance().setGlobalKillBelow(RooFit::ERROR) ;\n      GetWS()->import(data);\n      RooMsgService::instance().setGlobalKillBelow(level) ;\n   }\n}\n\n\n} \/\/ end namespace RooStats\n<|endoftext|>"}
{"text":"<commit_before>\n\/\/ g++-4.4 bench_gemm.cpp -I .. -O2 -DNDEBUG -lrt -fopenmp && OMP_NUM_THREADS=2  .\/a.out\n\/\/ icpc bench_gemm.cpp -I .. -O3 -DNDEBUG -lrt -openmp  && OMP_NUM_THREADS=2  .\/a.out\n\n#include <iostream>\n#include <Eigen\/Core>\n#include <bench\/BenchTimer.h>\n\nusing namespace std;\nusing namespace Eigen;\n\n#ifndef SCALAR\n#define SCALAR std::complex<float>\n#endif\n\ntypedef SCALAR Scalar;\ntypedef Matrix<Scalar,Dynamic,Dynamic> M;\n\n#ifdef HAVE_BLAS\n\nextern \"C\" {\n  #include <bench\/btl\/libs\/C_BLAS\/blas.h>\n}\n\nstatic float fone = 1;\nstatic float fzero = 0;\nstatic double done = 1;\nstatic double szero = 0;\nstatic std::complex<float> cfone = 1;\nstatic std::complex<float> cfzero = 0;\nstatic char notrans = 'N';\nstatic char trans = 'T';\nstatic char nonunit = 'N';\nstatic char lower = 'L';\nstatic char right = 'R';\nstatic int intone = 1;\n\nvoid blas_gemm(const MatrixXf& a, const MatrixXf& b, MatrixXf& c)\n{\n  int M = c.rows(); int N = c.cols(); int K = a.cols();\n  int lda = a.rows(); int ldb = b.rows(); int ldc = c.rows();\n\n  sgemm_(&notrans,&notrans,&M,&N,&K,&fone,\n         const_cast<float*>(a.data()),&lda,\n         const_cast<float*>(b.data()),&ldb,&fone,\n         c.data(),&ldc);\n}\n\nvoid blas_gemm(const MatrixXcf& a, const MatrixXcf& b, MatrixXcf& c)\n{\n  int M = c.rows(); int N = c.cols(); int K = a.cols();\n  int lda = a.rows(); int ldb = b.rows(); int ldc = c.rows();\n\n  cgemm_(&notrans,&notrans,&M,&N,&K,(float*)&cfone,\n         const_cast<float*>((const float*)a.data()),&lda,\n         const_cast<float*>((const float*)b.data()),&ldb,(float*)&cfone,\n         (float*)c.data(),&ldc);\n}\n\nvoid blas_gemm(const MatrixXd& a, const MatrixXd& b, MatrixXd& c)\n{\n  int M = c.rows(); int N = c.cols(); int K = a.cols();\n  int lda = a.rows(); int ldb = b.rows(); int ldc = c.rows();\n\n  dgemm_(&notrans,&notrans,&M,&N,&K,&done,\n         const_cast<double*>(a.data()),&lda,\n         const_cast<double*>(b.data()),&ldb,&done,\n         c.data(),&ldc);\n}\n\n#endif\n\ntemplate<typename M>\nvoid gemm(const M& a, const M& b, M& c)\n{\n  c.noalias() += a * b;\n}\n\nint main(int argc, char ** argv)\n{\n  std::ptrdiff_t l1 = ei_queryL1CacheSize();\n  std::ptrdiff_t l2 = ei_queryTopLevelCacheSize();\n  std::cout << \"L1 cache size    = \" << (l1>0 ? l1\/1024 : -1) << \" KB\\n\";\n  std::cout << \"L2\/L3 cache size = \" << (l2>0 ? l2\/1024 : -1) << \" KB\\n\";\n\n  int rep = 1;    \/\/ number of repetitions per try\n  int tries = 2;  \/\/ number of tries, we keep the best\n\n  int s = 2048;\n  int cache_size = -1;\n\n  bool need_help = false;\n  for (int i=1; i<argc; ++i)\n  {\n    if(argv[i][0]=='s')\n      s = atoi(argv[i]+1);\n    else if(argv[i][0]=='c')\n      cache_size = atoi(argv[i]+1);\n    else if(argv[i][0]=='t')\n      tries = atoi(argv[i]+1);\n    else if(argv[i][0]=='p')\n      rep = atoi(argv[i]+1);\n    else\n      need_help = true;\n  }\n\n  if(need_help)\n  {\n    std::cout << argv[0] << \" s<matrix size> c<cache size> t<nb tries> p<nb repeats>\\n\";\n    return 1;\n  }\n\n  if(cache_size>0)\n    setCpuCacheSizes(cache_size,96*cache_size);\n\n  int m = s;\n  int n = s;\n  int p = s;\n  M a(m,n); a.setRandom();\n  M b(n,p); b.setRandom();\n  M c(m,p); c.setOnes();\n\n  std::cout << \"Matrix sizes = \" << m << \"x\" << p << \" * \" << p << \"x\" << n << \"\\n\";\n  std::ptrdiff_t cm(m), cn(n), ck(p);\n  computeProductBlockingSizes<Scalar,Scalar>(ck, cm, cn);\n  std::cout << \"blocking size = \" << cm << \" x \" << ck << \"\\n\";\n\n  M r = c;\n\n  \/\/ check the parallel product is correct\n  #ifdef EIGEN_HAS_OPENMP\n  int procs = omp_get_max_threads();\n  if(procs>1)\n  {\n    #ifdef HAVE_BLAS\n    blas_gemm(a,b,r);\n    #else\n    omp_set_num_threads(1);\n    r.noalias() += a * b;\n    omp_set_num_threads(procs);\n    #endif\n    c.noalias() += a * b;\n    if(!r.isApprox(c)) std::cerr << \"Warning, your parallel product is crap!\\n\\n\";\n  }\n  #endif\n\n  #ifdef HAVE_BLAS\n  BenchTimer tblas;\n  BENCH(tblas, tries, rep, blas_gemm(a,b,c));\n  std::cout << \"blas  cpu         \" << tblas.best(CPU_TIMER)\/rep  << \"s  \\t\" << (double(m)*n*p*rep*2\/tblas.best(CPU_TIMER))*1e-9  <<  \" GFLOPS \\t(\" << tblas.total(CPU_TIMER)  << \"s)\\n\";\n  std::cout << \"blas  real        \" << tblas.best(REAL_TIMER)\/rep << \"s  \\t\" << (double(m)*n*p*rep*2\/tblas.best(REAL_TIMER))*1e-9 <<  \" GFLOPS \\t(\" << tblas.total(REAL_TIMER) << \"s)\\n\";\n  #endif\n\n  BenchTimer tmt;\n  BENCH(tmt, tries, rep, gemm(a,b,c));\n  std::cout << \"eigen cpu         \" << tmt.best(CPU_TIMER)\/rep  << \"s  \\t\" << (double(m)*n*p*rep*2\/tmt.best(CPU_TIMER))*1e-9  <<  \" GFLOPS \\t(\" << tmt.total(CPU_TIMER)  << \"s)\\n\";\n  std::cout << \"eigen real        \" << tmt.best(REAL_TIMER)\/rep << \"s  \\t\" << (double(m)*n*p*rep*2\/tmt.best(REAL_TIMER))*1e-9 <<  \" GFLOPS \\t(\" << tmt.total(REAL_TIMER) << \"s)\\n\";\n\n  #ifdef EIGEN_HAS_OPENMP\n  if(procs>1)\n  {\n    BenchTimer tmono;\n    \/\/omp_set_num_threads(1);\n    Eigen::setNbThreads(1);\n    BENCH(tmono, tries, rep, gemm(a,b,c));\n    std::cout << \"eigen mono cpu    \" << tmono.best(CPU_TIMER)\/rep  << \"s  \\t\" << (double(m)*n*p*rep*2\/tmono.best(CPU_TIMER))*1e-9  <<  \" GFLOPS \\t(\" << tmono.total(CPU_TIMER)  << \"s)\\n\";\n    std::cout << \"eigen mono real   \" << tmono.best(REAL_TIMER)\/rep << \"s  \\t\" << (double(m)*n*p*rep*2\/tmono.best(REAL_TIMER))*1e-9 <<  \" GFLOPS \\t(\" << tmono.total(REAL_TIMER) << \"s)\\n\";\n    std::cout << \"mt speed up x\" << tmono.best(CPU_TIMER) \/ tmt.best(REAL_TIMER)  << \" => \" << (100.0*tmono.best(CPU_TIMER) \/ tmt.best(REAL_TIMER))\/procs << \"%\\n\";\n  }\n  #endif\n\n  return 0;\n}\n\n<commit_msg>add support for complex<commit_after>\n\/\/ g++-4.4 bench_gemm.cpp -I .. -O2 -DNDEBUG -lrt -fopenmp && OMP_NUM_THREADS=2  .\/a.out\n\/\/ icpc bench_gemm.cpp -I .. -O3 -DNDEBUG -lrt -openmp  && OMP_NUM_THREADS=2  .\/a.out\n\n#include <iostream>\n#include <Eigen\/Core>\n#include <bench\/BenchTimer.h>\n\nusing namespace std;\nusing namespace Eigen;\n\n#ifndef SCALAR\n#define SCALAR std::complex<double>\n\/\/ #define SCALAR double\n#endif\n\ntypedef SCALAR Scalar;\ntypedef Matrix<Scalar,Dynamic,Dynamic> M;\n\n#ifdef HAVE_BLAS\n\nextern \"C\" {\n  #include <bench\/btl\/libs\/C_BLAS\/blas.h>\n}\n\nstatic float fone = 1;\nstatic float fzero = 0;\nstatic double done = 1;\nstatic double szero = 0;\nstatic std::complex<float> cfone = 1;\nstatic std::complex<float> cfzero = 0;\nstatic std::complex<double> cdone = 1;\nstatic std::complex<double> cdzero = 0;\nstatic char notrans = 'N';\nstatic char trans = 'T';\nstatic char nonunit = 'N';\nstatic char lower = 'L';\nstatic char right = 'R';\nstatic int intone = 1;\n\nvoid blas_gemm(const MatrixXf& a, const MatrixXf& b, MatrixXf& c)\n{\n  int M = c.rows(); int N = c.cols(); int K = a.cols();\n  int lda = a.rows(); int ldb = b.rows(); int ldc = c.rows();\n\n  sgemm_(&notrans,&notrans,&M,&N,&K,&fone,\n         const_cast<float*>(a.data()),&lda,\n         const_cast<float*>(b.data()),&ldb,&fone,\n         c.data(),&ldc);\n}\n\nvoid blas_gemm(const MatrixXcf& a, const MatrixXcf& b, MatrixXcf& c)\n{\n  int M = c.rows(); int N = c.cols(); int K = a.cols();\n  int lda = a.rows(); int ldb = b.rows(); int ldc = c.rows();\n\n  cgemm_(&notrans,&notrans,&M,&N,&K,(float*)&cfone,\n         const_cast<float*>((const float*)a.data()),&lda,\n         const_cast<float*>((const float*)b.data()),&ldb,(float*)&cfone,\n         (float*)c.data(),&ldc);\n}\n\nvoid blas_gemm(const MatrixXcd& a, const MatrixXcd& b, MatrixXcd& c)\n{\n  int M = c.rows(); int N = c.cols(); int K = a.cols();\n  int lda = a.rows(); int ldb = b.rows(); int ldc = c.rows();\n\n  zgemm_(&notrans,&notrans,&M,&N,&K,(double*)&cdone,\n         const_cast<double*>((const double*)a.data()),&lda,\n         const_cast<double*>((const double*)b.data()),&ldb,(double*)&cdone,\n         (double*)c.data(),&ldc);\n}\n\nvoid blas_gemm(const MatrixXd& a, const MatrixXd& b, MatrixXd& c)\n{\n  int M = c.rows(); int N = c.cols(); int K = a.cols();\n  int lda = a.rows(); int ldb = b.rows(); int ldc = c.rows();\n\n  dgemm_(&notrans,&notrans,&M,&N,&K,&done,\n         const_cast<double*>(a.data()),&lda,\n         const_cast<double*>(b.data()),&ldb,&done,\n         c.data(),&ldc);\n}\n\n#endif\n\ntemplate<typename M>\nEIGEN_DONT_INLINE void gemm(const M& a, const M& b, M& c)\n{\n  c.noalias() += a * b;\n}\n\nint main(int argc, char ** argv)\n{\n  std::ptrdiff_t l1 = ei_queryL1CacheSize();\n  std::ptrdiff_t l2 = ei_queryTopLevelCacheSize();\n  std::cout << \"L1 cache size     = \" << (l1>0 ? l1\/1024 : -1) << \" KB\\n\";\n  std::cout << \"L2\/L3 cache size  = \" << (l2>0 ? l2\/1024 : -1) << \" KB\\n\";\n  typedef ei_product_blocking_traits<Scalar> Blocking;\n  std::cout << \"Register blocking = \" << Blocking::mr << \" x \" << Blocking::nr << \"\\n\";\n\n  int rep = 1;    \/\/ number of repetitions per try\n  int tries = 2;  \/\/ number of tries, we keep the best\n\n  int s = 2048;\n  int cache_size = -1;\n\n  bool need_help = false;\n  for (int i=1; i<argc; ++i)\n  {\n    if(argv[i][0]=='s')\n      s = atoi(argv[i]+1);\n    else if(argv[i][0]=='c')\n      cache_size = atoi(argv[i]+1);\n    else if(argv[i][0]=='t')\n      tries = atoi(argv[i]+1);\n    else if(argv[i][0]=='p')\n      rep = atoi(argv[i]+1);\n    else\n      need_help = true;\n  }\n\n  if(need_help)\n  {\n    std::cout << argv[0] << \" s<matrix size> c<cache size> t<nb tries> p<nb repeats>\\n\";\n    return 1;\n  }\n\n  if(cache_size>0)\n    setCpuCacheSizes(cache_size,96*cache_size);\n\n  int m = s;\n  int n = s;\n  int p = s;\n  M a(m,n); a.setRandom();\n  M b(n,p); b.setRandom();\n  M c(m,p); c.setOnes();\n\n  std::cout << \"Matrix sizes = \" << m << \"x\" << p << \" * \" << p << \"x\" << n << \"\\n\";\n  std::ptrdiff_t cm(m), cn(n), ck(p);\n  computeProductBlockingSizes<Scalar,Scalar>(ck, cm, cn);\n  std::cout << \"blocking size = \" << cm << \" x \" << ck << \"\\n\";\n\n  M r = c;\n\n  \/\/ check the parallel product is correct\n  #ifdef EIGEN_HAS_OPENMP\n  int procs = omp_get_max_threads();\n  if(procs>1)\n  {\n    #ifdef HAVE_BLAS\n    blas_gemm(a,b,r);\n    #else\n    omp_set_num_threads(1);\n    r.noalias() += a * b;\n    omp_set_num_threads(procs);\n    #endif\n    c.noalias() += a * b;\n    if(!r.isApprox(c)) std::cerr << \"Warning, your parallel product is crap!\\n\\n\";\n  }\n  #endif\n\n  #ifdef HAVE_BLAS\n  BenchTimer tblas;\n  BENCH(tblas, tries, rep, blas_gemm(a,b,c));\n  std::cout << \"blas  cpu         \" << tblas.best(CPU_TIMER)\/rep  << \"s  \\t\" << (double(m)*n*p*rep*2\/tblas.best(CPU_TIMER))*1e-9  <<  \" GFLOPS \\t(\" << tblas.total(CPU_TIMER)  << \"s)\\n\";\n  std::cout << \"blas  real        \" << tblas.best(REAL_TIMER)\/rep << \"s  \\t\" << (double(m)*n*p*rep*2\/tblas.best(REAL_TIMER))*1e-9 <<  \" GFLOPS \\t(\" << tblas.total(REAL_TIMER) << \"s)\\n\";\n  #endif\n\n  BenchTimer tmt;\n  BENCH(tmt, tries, rep, gemm(a,b,c));\n  std::cout << \"eigen cpu         \" << tmt.best(CPU_TIMER)\/rep  << \"s  \\t\" << (double(m)*n*p*rep*2\/tmt.best(CPU_TIMER))*1e-9  <<  \" GFLOPS \\t(\" << tmt.total(CPU_TIMER)  << \"s)\\n\";\n  std::cout << \"eigen real        \" << tmt.best(REAL_TIMER)\/rep << \"s  \\t\" << (double(m)*n*p*rep*2\/tmt.best(REAL_TIMER))*1e-9 <<  \" GFLOPS \\t(\" << tmt.total(REAL_TIMER) << \"s)\\n\";\n\n  #ifdef EIGEN_HAS_OPENMP\n  if(procs>1)\n  {\n    BenchTimer tmono;\n    \/\/omp_set_num_threads(1);\n    Eigen::setNbThreads(1);\n    BENCH(tmono, tries, rep, gemm(a,b,c));\n    std::cout << \"eigen mono cpu    \" << tmono.best(CPU_TIMER)\/rep  << \"s  \\t\" << (double(m)*n*p*rep*2\/tmono.best(CPU_TIMER))*1e-9  <<  \" GFLOPS \\t(\" << tmono.total(CPU_TIMER)  << \"s)\\n\";\n    std::cout << \"eigen mono real   \" << tmono.best(REAL_TIMER)\/rep << \"s  \\t\" << (double(m)*n*p*rep*2\/tmono.best(REAL_TIMER))*1e-9 <<  \" GFLOPS \\t(\" << tmono.total(REAL_TIMER) << \"s)\\n\";\n    std::cout << \"mt speed up x\" << tmono.best(CPU_TIMER) \/ tmt.best(REAL_TIMER)  << \" => \" << (100.0*tmono.best(CPU_TIMER) \/ tmt.best(REAL_TIMER))\/procs << \"%\\n\";\n  }\n  #endif\n\n  return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n * The MIT License (MIT)\n *\n * Copyright (c) 2017 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 \"PerformanceCounterViewer.h\"\n#include \"Windows\/Dialogs\/PerformanceCounterSelection.h\"\n#include \"ui_PerformanceCounterViewer.h\"\n\nPerformanceCounterViewer::PerformanceCounterViewer(ICaptureContext &ctx, QWidget *parent)\n    : QFrame(parent), ui(new Ui::PerformanceCounterViewer), m_Ctx(ctx)\n{\n  ui->setupUi(this);\n\n  m_Ctx.AddLogViewer(this);\n\n  connect(ui->captureCounters, &QToolButton::pressed, this,\n          &PerformanceCounterViewer::CaptureCounters);\n\n  ui->captureCounters->setEnabled(m_Ctx.LogLoaded());\n}\n\nPerformanceCounterViewer::~PerformanceCounterViewer()\n{\n  m_Ctx.BuiltinWindowClosed(this);\n\n  m_Ctx.RemoveLogViewer(this);\n  delete ui;\n}\n\nQString PerformanceCounterViewer::FormatCounterResult(const CounterResult &result,\n                                                      const CounterDescription &description)\n{\n  QString returnValue;\n\n  double mul = 1.0;\n\n  TimeUnit timeunit = m_Ctx.Config().EventBrowser_TimeUnit;\n\n  if(description.unit == CounterUnit::Seconds)\n  {\n    if(timeunit == TimeUnit::Milliseconds)\n      mul *= 1000.0;\n    else if(timeunit == TimeUnit::Microseconds)\n      mul *= 1000000.0;\n    else if(timeunit == TimeUnit::Nanoseconds)\n      mul *= 1000000000.0;\n  }\n\n  switch(description.resultType)\n  {\n    case CompType::Float: returnValue += Formatter::Format(mul * result.value.f); break;\n\n    case CompType::Double: returnValue += Formatter::Format(mul * result.value.d); break;\n\n    case CompType::UInt:\n      if(description.resultByteWidth == 8)\n      {\n        returnValue += Formatter::Format(result.value.u64);\n      }\n      else\n      {\n        returnValue += Formatter::Format(result.value.u32);\n      }\n\n    default:\n      \/\/ assert (false)\n      break;\n  }\n\n  switch(description.unit)\n  {\n    case CounterUnit::Bytes: returnValue += lit(\" bytes\"); break;\n\n    case CounterUnit::Cycles: returnValue += lit(\" cycles\"); break;\n\n    case CounterUnit::Percentage: returnValue += lit(\" %\"); break;\n\n    case CounterUnit::Seconds: returnValue += lit(\" \") + UnitSuffix(timeunit); break;\n\n    case CounterUnit::Absolute:\n    case CounterUnit::Ratio: break;\n  }\n\n  return returnValue;\n}\n\nvoid PerformanceCounterViewer::CaptureCounters()\n{\n  if(!m_Ctx.LogLoaded())\n    return;\n\n  PerformanceCounterSelection pcs(m_Ctx, m_SelectedCounters, this);\n  if(RDDialog::show(&pcs) != QDialog::Accepted)\n    return;\n  m_SelectedCounters = pcs.GetSelectedCounters();\n\n  bool done = false;\n  m_Ctx.Replay().AsyncInvoke([this, &done](IReplayController *controller) -> void {\n    rdctype::array<GPUCounter> counters;\n    counters.create(m_SelectedCounters.size());\n\n    QMap<GPUCounter, CounterDescription> counterDescriptions;\n\n    for(int i = 0; i < m_SelectedCounters.size(); ++i)\n    {\n      counters[i] = (GPUCounter)m_SelectedCounters[i];\n      counterDescriptions.insert(counters[i], controller->DescribeCounter(counters[i]));\n    }\n\n    QMap<GPUCounter, int> counterIndex;\n    for(int i = 0; i < m_SelectedCounters.size(); ++i)\n    {\n      counterIndex.insert((GPUCounter)m_SelectedCounters[i], i);\n    }\n\n    const rdctype::array<CounterResult> results = controller->FetchCounters(counters);\n\n    GUIInvoke::call([this, results, counterDescriptions, counterIndex]() -> void {\n      ui->counterResults->clear();\n\n      QStringList headers;\n      headers << lit(\"EID\");\n      for(const CounterDescription &cd : counterDescriptions)\n      {\n        headers << cd.name;\n      }\n\n      QMap<uint32_t, int> eventIdToRow;\n      for(const CounterResult &result : results)\n      {\n        if(eventIdToRow.contains(result.eventID))\n          continue;\n        eventIdToRow[result.eventID] = eventIdToRow.size();\n      }\n\n      ui->counterResults->setColumnCount(headers.size());\n      ui->counterResults->setHorizontalHeaderLabels(headers);\n      ui->counterResults->setRowCount(eventIdToRow.size());\n\n      for(int i = 0; i < (int)results.size(); ++i)\n      {\n        int row = eventIdToRow[results[i].eventID];\n        ui->counterResults->setItem(row, 0,\n                                    new QTableWidgetItem(QString::number(results[i].eventID)));\n        ui->counterResults->setItem(row, counterIndex[results[i].counterID] + 1,\n                                    new QTableWidgetItem(FormatCounterResult(\n                                        results[i], counterDescriptions[results[i].counterID])));\n\n        ui->counterResults->item(row, 0)->setData(Qt::UserRole, results[i].eventID);\n      }\n\n      ui->counterResults->resizeColumnsToContents();\n    });\n\n    done = true;\n  });\n\n  ShowProgressDialog(this, tr(\"Capturing counters\"), [&done]() -> bool { return done; });\n}\n\nvoid PerformanceCounterViewer::OnLogfileClosed()\n{\n  ui->captureCounters->setEnabled(false);\n}\n\nvoid PerformanceCounterViewer::OnLogfileLoaded()\n{\n  ui->captureCounters->setEnabled(true);\n}\n\nvoid PerformanceCounterViewer::on_counterResults_doubleClicked(const QModelIndex &index)\n{\n  QTableWidgetItem *item = ui->counterResults->item(index.row(), 0);\n\n  if(item)\n  {\n    bool ok = false;\n    uint32_t eid = item->data(Qt::UserRole).toUInt(&ok);\n\n    if(ok)\n      m_Ctx.SetEventID({}, eid, eid);\n  }\n}\n<commit_msg>Bind to clicked not pressed (clicked fires too early, before mouseup)<commit_after>\/******************************************************************************\n * The MIT License (MIT)\n *\n * Copyright (c) 2017 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 \"PerformanceCounterViewer.h\"\n#include \"Windows\/Dialogs\/PerformanceCounterSelection.h\"\n#include \"ui_PerformanceCounterViewer.h\"\n\nPerformanceCounterViewer::PerformanceCounterViewer(ICaptureContext &ctx, QWidget *parent)\n    : QFrame(parent), ui(new Ui::PerformanceCounterViewer), m_Ctx(ctx)\n{\n  ui->setupUi(this);\n\n  m_Ctx.AddLogViewer(this);\n\n  connect(ui->captureCounters, &QToolButton::clicked, this,\n          &PerformanceCounterViewer::CaptureCounters);\n\n  ui->captureCounters->setEnabled(m_Ctx.LogLoaded());\n}\n\nPerformanceCounterViewer::~PerformanceCounterViewer()\n{\n  m_Ctx.BuiltinWindowClosed(this);\n\n  m_Ctx.RemoveLogViewer(this);\n  delete ui;\n}\n\nQString PerformanceCounterViewer::FormatCounterResult(const CounterResult &result,\n                                                      const CounterDescription &description)\n{\n  QString returnValue;\n\n  double mul = 1.0;\n\n  TimeUnit timeunit = m_Ctx.Config().EventBrowser_TimeUnit;\n\n  if(description.unit == CounterUnit::Seconds)\n  {\n    if(timeunit == TimeUnit::Milliseconds)\n      mul *= 1000.0;\n    else if(timeunit == TimeUnit::Microseconds)\n      mul *= 1000000.0;\n    else if(timeunit == TimeUnit::Nanoseconds)\n      mul *= 1000000000.0;\n  }\n\n  switch(description.resultType)\n  {\n    case CompType::Float: returnValue += Formatter::Format(mul * result.value.f); break;\n\n    case CompType::Double: returnValue += Formatter::Format(mul * result.value.d); break;\n\n    case CompType::UInt:\n      if(description.resultByteWidth == 8)\n      {\n        returnValue += Formatter::Format(result.value.u64);\n      }\n      else\n      {\n        returnValue += Formatter::Format(result.value.u32);\n      }\n\n    default:\n      \/\/ assert (false)\n      break;\n  }\n\n  switch(description.unit)\n  {\n    case CounterUnit::Bytes: returnValue += lit(\" bytes\"); break;\n\n    case CounterUnit::Cycles: returnValue += lit(\" cycles\"); break;\n\n    case CounterUnit::Percentage: returnValue += lit(\" %\"); break;\n\n    case CounterUnit::Seconds: returnValue += lit(\" \") + UnitSuffix(timeunit); break;\n\n    case CounterUnit::Absolute:\n    case CounterUnit::Ratio: break;\n  }\n\n  return returnValue;\n}\n\nvoid PerformanceCounterViewer::CaptureCounters()\n{\n  if(!m_Ctx.LogLoaded())\n    return;\n\n  PerformanceCounterSelection pcs(m_Ctx, m_SelectedCounters, this);\n  if(RDDialog::show(&pcs) != QDialog::Accepted)\n    return;\n  m_SelectedCounters = pcs.GetSelectedCounters();\n\n  bool done = false;\n  m_Ctx.Replay().AsyncInvoke([this, &done](IReplayController *controller) -> void {\n    rdctype::array<GPUCounter> counters;\n    counters.create(m_SelectedCounters.size());\n\n    QMap<GPUCounter, CounterDescription> counterDescriptions;\n\n    for(int i = 0; i < m_SelectedCounters.size(); ++i)\n    {\n      counters[i] = (GPUCounter)m_SelectedCounters[i];\n      counterDescriptions.insert(counters[i], controller->DescribeCounter(counters[i]));\n    }\n\n    QMap<GPUCounter, int> counterIndex;\n    for(int i = 0; i < m_SelectedCounters.size(); ++i)\n    {\n      counterIndex.insert((GPUCounter)m_SelectedCounters[i], i);\n    }\n\n    const rdctype::array<CounterResult> results = controller->FetchCounters(counters);\n\n    GUIInvoke::call([this, results, counterDescriptions, counterIndex]() -> void {\n      ui->counterResults->clear();\n\n      QStringList headers;\n      headers << lit(\"EID\");\n      for(const CounterDescription &cd : counterDescriptions)\n      {\n        headers << cd.name;\n      }\n\n      QMap<uint32_t, int> eventIdToRow;\n      for(const CounterResult &result : results)\n      {\n        if(eventIdToRow.contains(result.eventID))\n          continue;\n        eventIdToRow[result.eventID] = eventIdToRow.size();\n      }\n\n      ui->counterResults->setColumnCount(headers.size());\n      ui->counterResults->setHorizontalHeaderLabels(headers);\n      ui->counterResults->setRowCount(eventIdToRow.size());\n\n      for(int i = 0; i < (int)results.size(); ++i)\n      {\n        int row = eventIdToRow[results[i].eventID];\n        ui->counterResults->setItem(row, 0,\n                                    new QTableWidgetItem(QString::number(results[i].eventID)));\n        ui->counterResults->setItem(row, counterIndex[results[i].counterID] + 1,\n                                    new QTableWidgetItem(FormatCounterResult(\n                                        results[i], counterDescriptions[results[i].counterID])));\n\n        ui->counterResults->item(row, 0)->setData(Qt::UserRole, results[i].eventID);\n      }\n\n      ui->counterResults->resizeColumnsToContents();\n    });\n\n    done = true;\n  });\n\n  ShowProgressDialog(this, tr(\"Capturing counters\"), [&done]() -> bool { return done; });\n}\n\nvoid PerformanceCounterViewer::OnLogfileClosed()\n{\n  ui->captureCounters->setEnabled(false);\n}\n\nvoid PerformanceCounterViewer::OnLogfileLoaded()\n{\n  ui->captureCounters->setEnabled(true);\n}\n\nvoid PerformanceCounterViewer::on_counterResults_doubleClicked(const QModelIndex &index)\n{\n  QTableWidgetItem *item = ui->counterResults->item(index.row(), 0);\n\n  if(item)\n  {\n    bool ok = false;\n    uint32_t eid = item->data(Qt::UserRole).toUInt(&ok);\n\n    if(ok)\n      m_Ctx.SetEventID({}, eid, eid);\n  }\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 <eventql\/sql\/qtree\/TableExpressionNode.h>\n#include <eventql\/util\/inspect.h>\n\n#include \"eventql\/eventql.h\"\n\nnamespace csql {\n\n} \/\/ namespace csql\n<commit_msg>QualifiedColumn::QualifiedColumn<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 <eventql\/sql\/qtree\/TableExpressionNode.h>\n#include <eventql\/util\/inspect.h>\n\n#include \"eventql\/eventql.h\"\n\nnamespace csql {\n\nQualifiedColumn::QualifiedColumn(\n    const std::string& _qualified_name,\n    const std::string& _short_name,\n    SType _type) :\n    qualified_name(_qualified_name),\n    short_name(_short_name),\n    type(_type) {}\n\n} \/\/ namespace csql\n<|endoftext|>"}
{"text":"<commit_before>\/\/ This file is a part of the IncludeOS unikernel - www.includeos.org\n\/\/\n\/\/ Copyright 2015-2016 Oslo and Akershus University College of Applied Sciences\n\/\/ and Alfred Bratterud\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#pragma once\n#ifndef MODEL_SQUIRREL_HPP\n#define MODEL_SQUIRREL_HPP\n\n#include <locale>\n#include <algorithm>\n\n#include \"json.hpp\"\n\nnamespace acorn {\n\n\/**\n *\n *\/\nstruct Squirrel : json::Serializable {\n  size_t key;\n\n  Squirrel() : key(0) {}\n\n  \/**\n   *\n   *\/\n  Squirrel(std::string name, size_t age, std::string occupation)\n    : key         {0}\n    , name_       {name}\n    , age_        {age}\n    , occupation_ {occupation}\n  {}\n\n  \/**\n   *\n   *\/\n  std::string json() const;\n\n  \/**\n   *\n   *\/\n  virtual void serialize(rapidjson::Writer<rapidjson::StringBuffer>&) const override;\n\n  \/**\n   *\n   *\/\n  virtual bool deserialize(const rapidjson::Document&) override;\n\n  \/**\n   *\n   *\/\n  bool is_equal(const Squirrel&) const;\n\n  \/**\n   *\n   *\/\n  static bool is_equal(const Squirrel&, const Squirrel&);\n\nprivate:\n  const std::string name_;\n  const size_t      age_;\n  const std::string occupation_;\n}; \/\/< struct Squirrel\n\n\/**--v----------- Implementation Details -----------v--**\/\n\ninline std::ostream& operator << (std::ostream& output_device, const Squirrel& s) {\n  return output_device.json();\n}\n\nvoid Squirrel::serialize(rapidjson::Writer<rapidjson::StringBuffer>& writer) const {\n  writer.StartObject();\n\n  writer.Key(\"key\");\n  writer.Uint(key);\n\n  writer.Key(\"name\");\n  writer.String(name_);\n\n  writer.Key(\"age\");\n  writer.Uint(age_);\n\n  writer.Key(\"occupation\");\n  writer.String(occupation_);\n\n  writer.EndObject();\n}\n\nbool Squirrel::deserialize(const rapidjson::Document& doc) {\n  name_       = doc[\"name\"].GetString();\n  age_        = doc[\"age\"].GetUint();\n  occupation_ = doc[\"occupation\"].GetString();\n  return true;\n}\n\nstd::string Squirrel::json() const {\n  using namespace rapidjson;\n  StringBuffer sb;\n  Writer<StringBuffer> writer(sb);\n  serialize(writer);\n  return sb.GetString();\n}\n\nbool Squirrel::is_equal(const Squirrel& s) const {\n  if(name_.size() not_eq s.name_.size()) {\n    return false;\n  }\n\n  return std::equal(name_.begin(), name_.end(), s.name_.begin(), s.name_.end(),\n    [](const auto a, const auto b) { return ::tolower(a) == ::tolower(b);\n  });\n}\n\nbool Squirrel::is_equal(const Squirrel& s1, const Squirrel& s2) {\n  return s1.is_equal(s2);\n}\n\n\/**--^----------- Implementation Details -----------^--**\/\n\n} \/\/< namespace acorn\n\n#endif \/\/< MODEL_SQUIRREL_HPP\n<commit_msg>Moved output operator to end of file<commit_after>\/\/ This file is a part of the IncludeOS unikernel - www.includeos.org\n\/\/\n\/\/ Copyright 2015-2016 Oslo and Akershus University College of Applied Sciences\n\/\/ and Alfred Bratterud\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#pragma once\n#ifndef MODEL_SQUIRREL_HPP\n#define MODEL_SQUIRREL_HPP\n\n#include <locale>\n#include <algorithm>\n\n#include \"json.hpp\"\n\nnamespace acorn {\n\n\/**\n *\n *\/\nstruct Squirrel : json::Serializable {\n  size_t key;\n\n  Squirrel() : key(0) {}\n\n  \/**\n   *\n   *\/\n  Squirrel(std::string name, size_t age, std::string occupation)\n    : key         {0}\n    , name_       {name}\n    , age_        {age}\n    , occupation_ {occupation}\n  {}\n\n  \/**\n   *\n   *\/\n  std::string json() const;\n\n  \/**\n   *\n   *\/\n  virtual void serialize(rapidjson::Writer<rapidjson::StringBuffer>&) const override;\n\n  \/**\n   *\n   *\/\n  virtual bool deserialize(const rapidjson::Document&) override;\n\n  \/**\n   *\n   *\/\n  bool is_equal(const Squirrel&) const;\n\n  \/**\n   *\n   *\/\n  static bool is_equal(const Squirrel&, const Squirrel&);\n\nprivate:\n  const std::string name_;\n  const size_t      age_;\n  const std::string occupation_;\n}; \/\/< struct Squirrel\n\n\/**--v----------- Implementation Details -----------v--**\/\n\nvoid Squirrel::serialize(rapidjson::Writer<rapidjson::StringBuffer>& writer) const {\n  writer.StartObject();\n\n  writer.Key(\"key\");\n  writer.Uint(key);\n\n  writer.Key(\"name\");\n  writer.String(name_);\n\n  writer.Key(\"age\");\n  writer.Uint(age_);\n\n  writer.Key(\"occupation\");\n  writer.String(occupation_);\n\n  writer.EndObject();\n}\n\nbool Squirrel::deserialize(const rapidjson::Document& doc) {\n  name_       = doc[\"name\"].GetString();\n  age_        = doc[\"age\"].GetUint();\n  occupation_ = doc[\"occupation\"].GetString();\n  return true;\n}\n\nstd::string Squirrel::json() const {\n  using namespace rapidjson;\n  StringBuffer sb;\n  Writer<StringBuffer> writer(sb);\n  serialize(writer);\n  return sb.GetString();\n}\n\nbool Squirrel::is_equal(const Squirrel& s) const {\n  if(name_.size() not_eq s.name_.size()) {\n    return false;\n  }\n\n  return std::equal(name_.begin(), name_.end(), s.name_.begin(), s.name_.end(),\n    [](const auto a, const auto b) { return ::tolower(a) == ::tolower(b);\n  });\n}\n\nbool Squirrel::is_equal(const Squirrel& s1, const Squirrel& s2) {\n  return s1.is_equal(s2);\n}\n\ninline std::ostream& operator << (std::ostream& output_device, const Squirrel& s) {\n  return output_device.json();\n}\n\n\/**--^----------- Implementation Details -----------^--**\/\n\n} \/\/< namespace acorn\n\n#endif \/\/< MODEL_SQUIRREL_HPP\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#include \"itkMultiThreader.h\"\n#include \"itkTimeProbe.h\"\n#include \"itkConfigure.h\"\n\nvoid* execute(void *ptr)\n{\n  \/\/ Here - get any args from ptr.\n  \/\/std::cout << std::endl << \"Thread fn starting..\" << std::endl;\n  int *data = reinterpret_cast<int *>(ptr);\n  int m = 100;\n  std::cout << \"Ptr received  :\" << ptr\n            << \"Value \" << *data << std::endl;\n  int    n = 10;\n  double sum = 1.0;\n\n  for( int j = 0; j < m; j++ )\n    {\n    sum = 1.0;\n    for( int i = 1; i <= n; i++ )\n      {\n      sum = sum + i + j;\n      }\n    }\n  \/\/std::cout << std::endl << \"Thread fn DONE\" << std::endl;\n  return ITK_NULLPTR;\n}\n\n#if !defined(ITK_USE_PTHREADS)\nint itkThreadPoolTest(int, char* [])\n{\n#else\nint itkThreadPoolTest(int argc, char* argv[])\n{\n  int count = 1000000;\n  if( argc > 1 )\n    {\n    const int nt = atoi( argv[1] );\n    if(nt > 1)\n      {\n      count = nt;\n      }\n    }\n\n  itk::MultiThreader::Pointer    threader = itk::MultiThreader::New();\n  if(threader.IsNull())\n    {\n    return EXIT_FAILURE;\n    }\n  itk::TimeProbe timeProbe;\n  itk::TimeProbe::TimeStampType startTime = timeProbe.GetInstantValue();\n  int data = 100;\n  for(int i=0; i<count;i++)\n    {\n\n    threader->SetSingleMethod(&execute,(void *)&data);\n    threader->SingleMethodExecute();\n    }\n  itk::TimeProbe::TimeStampType elapsed = timeProbe.GetInstantValue() - startTime;\n  std::cout<<std::endl <<\" Thread pool test : Time elapsed : \" << elapsed << std::endl;\n#endif\n  return EXIT_SUCCESS;\n}\n<commit_msg>BUG: Fixed the failed test case of itkThreadPoolTest on OS X 10.8<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#include \"itkMultiThreader.h\"\n#include \"itkTimeProbe.h\"\n#include \"itkConfigure.h\"\n\nitk::MutexLock::Pointer sharedMutex;\n\nvoid* execute(void *ptr)\n{\n  \/\/ Here - get any args from ptr.\n  itk::MultiThreader::ThreadInfoStruct* threadInfo =\n    static_cast<itk::MultiThreader::ThreadInfoStruct*>(ptr);\n\n  int *data = static_cast<int *>(threadInfo->UserData);\n\n  sharedMutex->Lock();\n  std::cout << \"Ptr received  :\" << ptr\n            << \", Value \" << *data << std::endl;\n  sharedMutex->Unlock();\n\n  int    n = 10;\n  int m = 100;\n  double sum = 1.0;\n\n  for( int j = 0; j < m; j++ )\n    {\n    sum = 1.0;\n    for( int i = 1; i <= n; i++ )\n      {\n      sum = sum + i + j;\n      }\n    }\n\n  return ITK_NULLPTR;\n}\n\n#if !defined(ITK_USE_PTHREADS)\nint itkThreadPoolTest(int, char* [])\n{\n#else\nint itkThreadPoolTest(int argc, char* argv[])\n{\n\n  sharedMutex = itk::MutexLock::New();\n\n  int count = 1000000;\n  if( argc > 1 )\n    {\n    const int nt = atoi( argv[1] );\n    if(nt > 1)\n      {\n      count = nt;\n      }\n    }\n\n  itk::MultiThreader::Pointer    threader = itk::MultiThreader::New();\n  if(threader.IsNull())\n    {\n    return EXIT_FAILURE;\n    }\n  itk::TimeProbe timeProbe;\n  itk::TimeProbe::TimeStampType startTime = timeProbe.GetInstantValue();\n  int data = 100;\n  for(int i=0; i<count;i++)\n    {\n    threader->SetSingleMethod(&execute,(void *)&data);\n    threader->SingleMethodExecute();\n    }\n  itk::TimeProbe::TimeStampType elapsed = timeProbe.GetInstantValue() - startTime;\n  std::cout<<std::endl <<\" Thread pool test : Time elapsed : \" << elapsed << std::endl;\n#endif\n  return EXIT_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * InitBIDSLateralParams.cpp\n *\n *  Created on: Aug 10, 2012\n *      Author: bnowers\n *\/\n\n#include \"InitBIDSLateralParams.hpp\"\n\nnamespace PV {\n\nInitBIDSLateralParams::InitBIDSLateralParams()\n{\n   initialize_base();\n}\nInitBIDSLateralParams::InitBIDSLateralParams(HyPerConn * parentConn)\n                     : InitWeightsParams() {\n   initialize_base();\n   initialize(parentConn);\n}\n\nInitBIDSLateralParams::~InitBIDSLateralParams()\n{\n   free(falloffType); falloffType = NULL;\n   free(jitterSource); jitterSource = NULL;\n}\n\nint InitBIDSLateralParams::initialize_base() {\n\n   \/\/ default values\n   strength = 1.0f;\n   coords = NULL;\n   jitterSource = NULL;\n   falloffType = NULL;\n\n   return 1;\n}\n\nint InitBIDSLateralParams::initialize(HyPerConn * parentConn) {\n   return InitWeightsParams::initialize(parentConn);\n\n}\n\nint InitBIDSLateralParams::ioParamsFillGroup(enum ParamsIOFlag ioFlag) {\n   int status = InitWeightsParams::ioParamsFillGroup(ioFlag);\n   \/\/ old if condition failed to account for connections between oriented to non-oriented cells\n\n   return status;\n}\n\nvoid InitBIDSLateralParams::ioParam_strength(enum ParamsIOFlag ioFlag) {\n   parentConn->ioParam_strength(ioFlag, &strength, true\/*warnIfAbsent*\/);\n}\n\nvoid InitBIDSLateralParams::ioParam_falloffType(enum ParamsIOFlag ioFlag) {\n   parent->ioParamString(ioFlag, name, \"falloffType\", &falloffType, falloffType);\n   if (ioFlag==PARAMS_IO_READ && falloffType==NULL) {\n      if (parent->columnId()==0) {\n         fprintf(stderr, \"%s \\\"%s\\\": falloffType must be set.  Allowable values are \\\"Gaussian\\\", \\\"radSquared\\\", or \\\"Log\\\".\\n\",\n               parent->parameters()->groupKeywordFromName(name), name);\n      }\n   }\n}\n\nvoid InitBIDSLateralParams::ioParam_lateralRadius(enum ParamsIOFlag ioFlag) {\n   parent->ioParamValue(ioFlag, name, \"lateralRadius\", &lateralRadius, lateralRadius);\n}\n\nvoid InitBIDSLateralParams::ioParam_jitterSource(enum ParamsIOFlag ioFlag) {\n   parent->ioParamStringRequired(ioFlag, name, \"jitterSource\", &jitterSource);\n}\n\nint InitBIDSLateralParams::communicateParamsInfo() {\n   int status = InitWeightsParams::communicateParamsInfo();\n   BIDSMovieCloneMap * post = dynamic_cast<BIDSMovieCloneMap *>(parent->getLayerFromName(jitterSource));\n   assert (post != NULL);\n   coords = post->getCoords();\n\n   HyPerLayer * jitter_layer = parent->getLayerFromName(jitterSource);\n   BIDSMovieCloneMap * bids_layer = dynamic_cast<BIDSMovieCloneMap *>(jitter_layer);\n   if (bids_layer == NULL) {\n      if (parent->columnId()==0) {\n         fprintf(stderr, \"%s \\\"%s\\\" error: jitterSource \\\"%s\\\" is not a BIDSMovieCloneMap.\\n\",\n               parent->parameters()->groupKeywordFromName(name), name, jitterSource);\n      }\n#if PV_USE_MPI\n      MPI_Barrier(parent->icCommunicator()->communicator());\n#endif\n      exit(EXIT_FAILURE);\n   }\n   jitter = bids_layer->getJitter();\n\n   return PV_SUCCESS;\n}\n\nvoid InitBIDSLateralParams::calcOtherParams(int patchIndex) {\n   this->getcheckdimensionsandstrides();\n\n   const int kfPre_tmp = this->kernelIndexCalculations(patchIndex);\n}\n\n} \/* namespace PV *\/\n<commit_msg>Replaced #if PV_USE_MPI with #ifdef construct.<commit_after>\/*\n * InitBIDSLateralParams.cpp\n *\n *  Created on: Aug 10, 2012\n *      Author: bnowers\n *\/\n\n#include \"InitBIDSLateralParams.hpp\"\n\nnamespace PV {\n\nInitBIDSLateralParams::InitBIDSLateralParams()\n{\n   initialize_base();\n}\nInitBIDSLateralParams::InitBIDSLateralParams(HyPerConn * parentConn)\n                     : InitWeightsParams() {\n   initialize_base();\n   initialize(parentConn);\n}\n\nInitBIDSLateralParams::~InitBIDSLateralParams()\n{\n   free(falloffType); falloffType = NULL;\n   free(jitterSource); jitterSource = NULL;\n}\n\nint InitBIDSLateralParams::initialize_base() {\n\n   \/\/ default values\n   strength = 1.0f;\n   coords = NULL;\n   jitterSource = NULL;\n   falloffType = NULL;\n\n   return 1;\n}\n\nint InitBIDSLateralParams::initialize(HyPerConn * parentConn) {\n   return InitWeightsParams::initialize(parentConn);\n\n}\n\nint InitBIDSLateralParams::ioParamsFillGroup(enum ParamsIOFlag ioFlag) {\n   int status = InitWeightsParams::ioParamsFillGroup(ioFlag);\n   \/\/ old if condition failed to account for connections between oriented to non-oriented cells\n\n   return status;\n}\n\nvoid InitBIDSLateralParams::ioParam_strength(enum ParamsIOFlag ioFlag) {\n   parentConn->ioParam_strength(ioFlag, &strength, true\/*warnIfAbsent*\/);\n}\n\nvoid InitBIDSLateralParams::ioParam_falloffType(enum ParamsIOFlag ioFlag) {\n   parent->ioParamString(ioFlag, name, \"falloffType\", &falloffType, falloffType);\n   if (ioFlag==PARAMS_IO_READ && falloffType==NULL) {\n      if (parent->columnId()==0) {\n         fprintf(stderr, \"%s \\\"%s\\\": falloffType must be set.  Allowable values are \\\"Gaussian\\\", \\\"radSquared\\\", or \\\"Log\\\".\\n\",\n               parent->parameters()->groupKeywordFromName(name), name);\n      }\n   }\n}\n\nvoid InitBIDSLateralParams::ioParam_lateralRadius(enum ParamsIOFlag ioFlag) {\n   parent->ioParamValue(ioFlag, name, \"lateralRadius\", &lateralRadius, lateralRadius);\n}\n\nvoid InitBIDSLateralParams::ioParam_jitterSource(enum ParamsIOFlag ioFlag) {\n   parent->ioParamStringRequired(ioFlag, name, \"jitterSource\", &jitterSource);\n}\n\nint InitBIDSLateralParams::communicateParamsInfo() {\n   int status = InitWeightsParams::communicateParamsInfo();\n   BIDSMovieCloneMap * post = dynamic_cast<BIDSMovieCloneMap *>(parent->getLayerFromName(jitterSource));\n   assert (post != NULL);\n   coords = post->getCoords();\n\n   HyPerLayer * jitter_layer = parent->getLayerFromName(jitterSource);\n   BIDSMovieCloneMap * bids_layer = dynamic_cast<BIDSMovieCloneMap *>(jitter_layer);\n   if (bids_layer == NULL) {\n      if (parent->columnId()==0) {\n         fprintf(stderr, \"%s \\\"%s\\\" error: jitterSource \\\"%s\\\" is not a BIDSMovieCloneMap.\\n\",\n               parent->parameters()->groupKeywordFromName(name), name, jitterSource);\n      }\n#ifdef PV_USE_MPI\n      MPI_Barrier(parent->icCommunicator()->communicator());\n#endif\n      exit(EXIT_FAILURE);\n   }\n   jitter = bids_layer->getJitter();\n\n   return PV_SUCCESS;\n}\n\nvoid InitBIDSLateralParams::calcOtherParams(int patchIndex) {\n   this->getcheckdimensionsandstrides();\n\n   const int kfPre_tmp = this->kernelIndexCalculations(patchIndex);\n}\n\n} \/* namespace PV *\/\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 libdui.\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 \"duikeyboardstatetracker.h\"\n#include \"duikeyboardstatetracker_p.h\"\n#include <QVariant>\n#include <QCoreApplication>\n\n#include <DuiDebug>\n\nDuiKeyboardStateTracker *DuiKeyboardStateTrackerPrivate::tracker = 0;\n\nDuiKeyboardStateTrackerPrivate::DuiKeyboardStateTrackerPrivate(DuiKeyboardStateTracker *controller) :\n#ifdef HAVE_CONTEXTSUBSCRIBER\n    keyboardOpenProperty(\"\/maemo\/InternalKeyboard\/Open\"),\n#elif defined(HAVE_N900)\n    keyboardOpenConf(\"\/system\/osso\/af\/slide-open\"),\n#endif\n    q_ptr(controller),\n    present(false)\n{\n#ifdef HAVE_CONTEXTSUBSCRIBER\n#if 0\n    Q_Q(DuiKeyboardStateTracker);\n    QObject::connect(&keyboardOpenProperty, SIGNAL(valueChanged()),\n                     q, SIGNAL(stateChanged()));\n#endif\n#elif defined(HAVE_N900)\n    Q_Q(DuiKeyboardStateTracker);\n    QObject::connect(&keyboardOpenConf, SIGNAL(valueChanged()),\n                     q, SIGNAL(stateChanged()));\n#endif\n\n    initContextSubscriber();\n}\n\nvoid DuiKeyboardStateTrackerPrivate::initContextSubscriber()\n{\n#ifdef HAVE_CONTEXTSUBSCRIBER\n#if 0\n    \/\/waiting for properties to synchronize\n    keyboardOpenProperty.waitForSubscription();\n#endif\n    \/\/ TODO: use actual ContextProperty for present, which is still unready.\n    present = true;\n#elif defined(HAVE_N900)\n    present = true;\n#endif\n}\n\nDuiKeyboardStateTracker::DuiKeyboardStateTracker() :\n    d_ptr(new DuiKeyboardStateTrackerPrivate(this))\n{\n    setParent(QCoreApplication::instance()); \/\/get collected when needed.\n}\n\nDuiKeyboardStateTracker *DuiKeyboardStateTracker::instance()\n{\n    if (!DuiKeyboardStateTrackerPrivate::tracker)\n        DuiKeyboardStateTrackerPrivate::tracker = new DuiKeyboardStateTracker();\n    return DuiKeyboardStateTrackerPrivate::tracker;\n}\n\nDuiKeyboardStateTracker::~DuiKeyboardStateTracker()\n{\n    if (this == DuiKeyboardStateTrackerPrivate::tracker)\n        DuiKeyboardStateTrackerPrivate::tracker = 0;\n}\n\nbool DuiKeyboardStateTracker::isPresent() const\n{\n    Q_D(const DuiKeyboardStateTracker);\n\n    return d->present;\n}\n\nbool DuiKeyboardStateTracker::isOpen() const\n{\n    bool val = false;\n#ifdef HAVE_CONTEXTSUBSCRIBER\n#if 0\n    Q_D(const DuiKeyboardStateTracker);\n    if (isPresent()) {\n        val = d->keyboardOpenProperty.value().toBool();\n    }\n#endif\n#elif defined(HAVE_N900)\n    Q_D(const DuiKeyboardStateTracker);\n    val = d->keyboardOpenConf.value().toBool();\n#endif\n    return val;\n}\n<commit_msg>Changes: Enable reading the keyboardOpen contextProperty<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 libdui.\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 \"duikeyboardstatetracker.h\"\n#include \"duikeyboardstatetracker_p.h\"\n#include <QVariant>\n#include <QCoreApplication>\n\n#include <DuiDebug>\n\nDuiKeyboardStateTracker *DuiKeyboardStateTrackerPrivate::tracker = 0;\n\nDuiKeyboardStateTrackerPrivate::DuiKeyboardStateTrackerPrivate(DuiKeyboardStateTracker *controller) :\n#ifdef HAVE_CONTEXTSUBSCRIBER\n    keyboardOpenProperty(\"\/maemo\/InternalKeyboard\/Open\"),\n#elif defined(HAVE_N900)\n    keyboardOpenConf(\"\/system\/osso\/af\/slide-open\"),\n#endif\n    q_ptr(controller),\n    present(false)\n{\n#ifdef HAVE_CONTEXTSUBSCRIBER\n    Q_Q(DuiKeyboardStateTracker);\n    QObject::connect(&keyboardOpenProperty, SIGNAL(valueChanged()),\n                     q, SIGNAL(stateChanged()));\n#elif defined(HAVE_N900)\n    Q_Q(DuiKeyboardStateTracker);\n    QObject::connect(&keyboardOpenConf, SIGNAL(valueChanged()),\n                     q, SIGNAL(stateChanged()));\n#endif\n\n    initContextSubscriber();\n}\n\nvoid DuiKeyboardStateTrackerPrivate::initContextSubscriber()\n{\n#ifdef HAVE_CONTEXTSUBSCRIBER\n    \/\/waiting for properties to synchronize\n    keyboardOpenProperty.waitForSubscription();\n    \/\/ TODO: use actual ContextProperty for present, which is still unready.\n    present = true;\n#elif defined(HAVE_N900)\n    present = true;\n#endif\n}\n\nDuiKeyboardStateTracker::DuiKeyboardStateTracker() :\n    d_ptr(new DuiKeyboardStateTrackerPrivate(this))\n{\n    setParent(QCoreApplication::instance()); \/\/get collected when needed.\n}\n\nDuiKeyboardStateTracker *DuiKeyboardStateTracker::instance()\n{\n    if (!DuiKeyboardStateTrackerPrivate::tracker)\n        DuiKeyboardStateTrackerPrivate::tracker = new DuiKeyboardStateTracker();\n    return DuiKeyboardStateTrackerPrivate::tracker;\n}\n\nDuiKeyboardStateTracker::~DuiKeyboardStateTracker()\n{\n    if (this == DuiKeyboardStateTrackerPrivate::tracker)\n        DuiKeyboardStateTrackerPrivate::tracker = 0;\n}\n\nbool DuiKeyboardStateTracker::isPresent() const\n{\n    Q_D(const DuiKeyboardStateTracker);\n\n    return d->present;\n}\n\nbool DuiKeyboardStateTracker::isOpen() const\n{\n    bool val = false;\n#ifdef HAVE_CONTEXTSUBSCRIBER\n    Q_D(const DuiKeyboardStateTracker);\n    if (isPresent()) {\n        val = d->keyboardOpenProperty.value().toBool();\n    }\n#elif defined(HAVE_N900)\n    Q_D(const DuiKeyboardStateTracker);\n    val = d->keyboardOpenConf.value().toBool();\n#endif\n    return val;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * Copyright (c) 2016 DeepCortex GmbH <legal@eventql.io>\n * Authors:\n *   - Paul Asmuth <paul@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 <stdlib.h>\n#include <string.h>\n#include <arpa\/inet.h>\n#include <eventql\/util\/util\/binarymessagewriter.h>\n#include <eventql\/util\/exception.h>\n#include <eventql\/util\/ieee754.h>\n\nnamespace util {\n\nBinaryMessageWriter::BinaryMessageWriter(\n    size_t initial_size) :\n    ptr_(malloc(initial_size)),\n    size_(initial_size),\n    used_(0),\n    owned_(true) {\n  if (ptr_ == nullptr) {\n    RAISE(kMallocError, \"malloc() failed\");\n  }\n}\n\nBinaryMessageWriter::BinaryMessageWriter(\n    void* buf,\n    size_t buf_len) :\n    ptr_(buf),\n    size_(buf_len),\n    used_(0),\n    owned_(false) {}\n\nBinaryMessageWriter::~BinaryMessageWriter() {\n  if (owned_) {\n    free(ptr_);\n  }\n}\n\nvoid BinaryMessageWriter::appendUInt8(uint8_t value) {\n  append(&value, sizeof(value));\n}\n\nvoid BinaryMessageWriter::appendUInt16(uint16_t value) {\n  append(&value, sizeof(value));\n}\n\nvoid BinaryMessageWriter::updateUInt16(size_t offset, uint16_t value) {\n  update(offset, &value, sizeof(value));\n}\n\nvoid BinaryMessageWriter::appendUInt32(uint32_t value) {\n  append(&value, sizeof(value));\n}\n\nvoid BinaryMessageWriter::appendNUInt16(uint16_t value) {\n  uint16_t v = htons(value);\n  append(&v, sizeof(v));\n}\n\nvoid BinaryMessageWriter::updateNUInt16(size_t offset, uint16_t value) {\n  uint16_t v = htons(value);\n  update(offset, &v, sizeof(v));\n}\n\nvoid BinaryMessageWriter::updateUInt32(size_t offset, uint32_t value) {\n  update(offset, &value, sizeof(value));\n}\n\nvoid BinaryMessageWriter::appendNUInt32(uint32_t value) {\n  uint32_t v = htonl(value);\n  append(&v, sizeof(v));\n}\n\nvoid BinaryMessageWriter::updateNUInt32(size_t offset, uint32_t value) {\n  uint32_t v = htonl(value);\n  update(offset, &v, sizeof(v));\n}\n\nvoid BinaryMessageWriter::appendUInt64(uint64_t value) {\n  append(&value, sizeof(value));\n}\n\nvoid BinaryMessageWriter::updateUInt64(size_t offset, uint64_t value) {\n  update(offset, &value, sizeof(value));\n}\n\nvoid BinaryMessageWriter::appendDouble(double value) {\n  auto bytes = IEEE754::toBytes(value);\n  append(&bytes, sizeof(bytes));\n}\n\nvoid BinaryMessageWriter::appendString(const std::string& string) {\n  append(string.data(), string.size());\n}\n\nvoid BinaryMessageWriter::updateString(\n    size_t offset,\n    const std::string& string) {\n  update(offset, string.data(), string.size());\n}\n\nvoid BinaryMessageWriter::appendLenencString(const std::string& string) {\n  appendVarUInt(string.size());\n  append(string.data(), string.size());\n}\n\nvoid BinaryMessageWriter::appendVarUInt(uint64_t value) {\n  unsigned char buf[10];\n  size_t bytes = 0;\n  do {\n    buf[bytes] = value & 0x7fU;\n    if (value >>= 7) buf[bytes] |= 0x80U;\n    ++bytes;\n  } while (value);\n\n  append(buf, bytes);\n}\n\n\nvoid* BinaryMessageWriter::data() const {\n  return ptr_;\n}\n\nsize_t BinaryMessageWriter::size() const {\n  return used_;\n}\n\nvoid BinaryMessageWriter::append(void const* data, size_t size) {\n  size_t resize = size_;\n\n  while (used_ + size > resize) {\n    resize *= 2;\n  }\n\n  if (resize > size_) {\n    if (!owned_) {\n      RAISE(kBufferOverflowError, \"provided buffer is too small\");\n    }\n\n    auto new_ptr = realloc(ptr_, resize);\n\n    if (ptr_ == nullptr) {\n      RAISE(kMallocError, \"realloc() failed\");\n    }\n\n    ptr_ = new_ptr;\n  }\n\n  memcpy(((char*) ptr_) + used_, data, size);\n  used_ += size;\n}\n\nvoid BinaryMessageWriter::update(size_t offset, void const* data, size_t size) {\n  if (offset + size > size_) {\n    RAISE(kBufferOverflowError, \"update exceeds buffer boundary\");\n  }\n\n  memcpy(((char*) ptr_) + offset, data, size);\n}\n\nvoid BinaryMessageWriter::clear() {\n  used_ = 0;\n}\n\ntemplate <>\nvoid BinaryMessageWriter::appendValue<uint16_t>(const uint16_t& val) {\n  appendUInt16(val);\n}\n\ntemplate <>\nvoid BinaryMessageWriter::appendValue<uint32_t>(const uint32_t& val) {\n  appendUInt32(val);\n}\n\ntemplate <>\nvoid BinaryMessageWriter::appendValue<String>(const String& val) {\n  appendUInt32(val.size());\n  append(val.data(), val.size());\n}\n\n}\n\n<commit_msg>fix a bug where the internal size wasn't updated properly in BinaryMessageWriter<commit_after>\/**\n * Copyright (c) 2016 DeepCortex GmbH <legal@eventql.io>\n * Authors:\n *   - Paul Asmuth <paul@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 <stdlib.h>\n#include <string.h>\n#include <arpa\/inet.h>\n#include <eventql\/util\/util\/binarymessagewriter.h>\n#include <eventql\/util\/exception.h>\n#include <eventql\/util\/ieee754.h>\n\nnamespace util {\n\nBinaryMessageWriter::BinaryMessageWriter(\n    size_t initial_size) :\n    ptr_(malloc(initial_size)),\n    size_(initial_size),\n    used_(0),\n    owned_(true) {\n  if (ptr_ == nullptr) {\n    RAISE(kMallocError, \"malloc() failed\");\n  }\n}\n\nBinaryMessageWriter::BinaryMessageWriter(\n    void* buf,\n    size_t buf_len) :\n    ptr_(buf),\n    size_(buf_len),\n    used_(0),\n    owned_(false) {}\n\nBinaryMessageWriter::~BinaryMessageWriter() {\n  if (owned_) {\n    free(ptr_);\n  }\n}\n\nvoid BinaryMessageWriter::appendUInt8(uint8_t value) {\n  append(&value, sizeof(value));\n}\n\nvoid BinaryMessageWriter::appendUInt16(uint16_t value) {\n  append(&value, sizeof(value));\n}\n\nvoid BinaryMessageWriter::updateUInt16(size_t offset, uint16_t value) {\n  update(offset, &value, sizeof(value));\n}\n\nvoid BinaryMessageWriter::appendUInt32(uint32_t value) {\n  append(&value, sizeof(value));\n}\n\nvoid BinaryMessageWriter::appendNUInt16(uint16_t value) {\n  uint16_t v = htons(value);\n  append(&v, sizeof(v));\n}\n\nvoid BinaryMessageWriter::updateNUInt16(size_t offset, uint16_t value) {\n  uint16_t v = htons(value);\n  update(offset, &v, sizeof(v));\n}\n\nvoid BinaryMessageWriter::updateUInt32(size_t offset, uint32_t value) {\n  update(offset, &value, sizeof(value));\n}\n\nvoid BinaryMessageWriter::appendNUInt32(uint32_t value) {\n  uint32_t v = htonl(value);\n  append(&v, sizeof(v));\n}\n\nvoid BinaryMessageWriter::updateNUInt32(size_t offset, uint32_t value) {\n  uint32_t v = htonl(value);\n  update(offset, &v, sizeof(v));\n}\n\nvoid BinaryMessageWriter::appendUInt64(uint64_t value) {\n  append(&value, sizeof(value));\n}\n\nvoid BinaryMessageWriter::updateUInt64(size_t offset, uint64_t value) {\n  update(offset, &value, sizeof(value));\n}\n\nvoid BinaryMessageWriter::appendDouble(double value) {\n  auto bytes = IEEE754::toBytes(value);\n  append(&bytes, sizeof(bytes));\n}\n\nvoid BinaryMessageWriter::appendString(const std::string& string) {\n  append(string.data(), string.size());\n}\n\nvoid BinaryMessageWriter::updateString(\n    size_t offset,\n    const std::string& string) {\n  update(offset, string.data(), string.size());\n}\n\nvoid BinaryMessageWriter::appendLenencString(const std::string& string) {\n  appendVarUInt(string.size());\n  append(string.data(), string.size());\n}\n\nvoid BinaryMessageWriter::appendVarUInt(uint64_t value) {\n  unsigned char buf[10];\n  size_t bytes = 0;\n  do {\n    buf[bytes] = value & 0x7fU;\n    if (value >>= 7) buf[bytes] |= 0x80U;\n    ++bytes;\n  } while (value);\n\n  append(buf, bytes);\n}\n\n\nvoid* BinaryMessageWriter::data() const {\n  return ptr_;\n}\n\nsize_t BinaryMessageWriter::size() const {\n  return used_;\n}\n\nvoid BinaryMessageWriter::append(void const* data, size_t size) {\n  size_t resize = size_;\n\n  while (used_ + size > resize) {\n    resize *= 2;\n  }\n\n  if (resize > size_) {\n    if (!owned_) {\n      RAISE(kBufferOverflowError, \"provided buffer is too small\");\n    }\n\n    auto new_ptr = realloc(ptr_, resize);\n\n    if (ptr_ == nullptr) {\n      RAISE(kMallocError, \"realloc() failed\");\n    }\n\n    ptr_ = new_ptr;\n    size_ = resize;\n  }\n\n  memcpy(((char*) ptr_) + used_, data, size);\n  used_ += size;\n}\n\nvoid BinaryMessageWriter::update(size_t offset, void const* data, size_t size) {\n  if (offset + size > size_) {\n    RAISE(kBufferOverflowError, \"update exceeds buffer boundary\");\n  }\n\n  memcpy(((char*) ptr_) + offset, data, size);\n}\n\nvoid BinaryMessageWriter::clear() {\n  used_ = 0;\n}\n\ntemplate <>\nvoid BinaryMessageWriter::appendValue<uint16_t>(const uint16_t& val) {\n  appendUInt16(val);\n}\n\ntemplate <>\nvoid BinaryMessageWriter::appendValue<uint32_t>(const uint32_t& val) {\n  appendUInt32(val);\n}\n\ntemplate <>\nvoid BinaryMessageWriter::appendValue<String>(const String& val) {\n  appendUInt32(val.size());\n  append(val.data(), val.size());\n}\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>make the output of territorymgr nicer on startup :ok_hand:<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2016, 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#if !defined(DART_IO_DISABLED)\n\n#include \"platform\/globals.h\"\n#if defined(TARGET_OS_FUCHSIA)\n\n#include \"bin\/eventhandler.h\"\n#include \"bin\/eventhandler_fuchsia.h\"\n\n#include <magenta\/status.h>\n#include <magenta\/syscalls.h>\n\n#include \"bin\/thread.h\"\n#include \"bin\/utils.h\"\n\nnamespace dart {\nnamespace bin {\n\nEventHandlerImplementation::EventHandlerImplementation() {\n  mx_status_t status = mx_msgpipe_create(interrupt_handles_, 0);\n  if (status != NO_ERROR) {\n    FATAL1(\"mx_msgpipe_create failed: %s\\n\", mx_status_get_string(status));\n  }\n  shutdown_ = false;\n}\n\n\nEventHandlerImplementation::~EventHandlerImplementation() {\n  mx_status_t status = mx_handle_close(interrupt_handles_[0]);\n  if (status != NO_ERROR) {\n    FATAL1(\"mx_handle_close failed: %s\\n\", mx_status_get_string(status));\n  }\n  status = mx_handle_close(interrupt_handles_[1]);\n  if (status != NO_ERROR) {\n    FATAL1(\"mx_handle_close failed: %s\\n\", mx_status_get_string(status));\n  }\n}\n\n\nvoid EventHandlerImplementation::WakeupHandler(intptr_t id,\n                                               Dart_Port dart_port,\n                                               int64_t data) {\n  InterruptMessage msg;\n  msg.id = id;\n  msg.dart_port = dart_port;\n  msg.data = data;\n\n  mx_status_t status =\n    mx_msgpipe_write(interrupt_handles_[1], &msg, sizeof(msg), NULL, 0, 0);\n  if (status != NO_ERROR) {\n    FATAL1(\"mx_msgpipe_write failed: %s\\n\", mx_status_get_string(status));\n  }\n}\n\n\nvoid EventHandlerImplementation::HandleInterruptFd() {\n  InterruptMessage msg;\n  uint32_t bytes = kInterruptMessageSize;\n  mx_status_t status;\n  while (true) {\n    status = mx_msgpipe_read(\n        interrupt_handles_[0], &msg, &bytes, NULL, NULL, 0);\n    if (status != NO_ERROR) {\n      break;\n    }\n    ASSERT(bytes == kInterruptMessageSize);\n    if (msg.id == kTimerId) {\n      timeout_queue_.UpdateTimeout(msg.dart_port, msg.data);\n    } else if (msg.id == kShutdownId) {\n      shutdown_ = true;\n    } else {\n      UNIMPLEMENTED();\n    }\n  }\n  \/\/ status == ERR_BAD_STATE when we try to read and there are no messages\n  \/\/ available, so it is an error if we get here and status != ERR_BAD_STATE.\n  if (status != ERR_BAD_STATE) {\n    FATAL1(\"mx_msgpipe_read failed: %s\\n\", mx_status_get_string(status));\n  }\n}\n\n\nvoid EventHandlerImplementation::HandleEvents() {\n  \/\/ TODO(zra): Handle events from other handles. At the moment we are only\n  \/\/ interrupted when there is a message on interrupt_handles_[0].\n  HandleInterruptFd();\n}\n\n\nint64_t EventHandlerImplementation::GetTimeout() const {\n  if (!timeout_queue_.HasTimeout()) {\n    return kInfinityTimeout;\n  }\n  int64_t millis = timeout_queue_.CurrentTimeout() -\n      TimerUtils::GetCurrentMonotonicMillis();\n  return (millis < 0) ? 0 : millis;\n}\n\n\nvoid EventHandlerImplementation::HandleTimeout() {\n  if (timeout_queue_.HasTimeout()) {\n    int64_t millis = timeout_queue_.CurrentTimeout() -\n        TimerUtils::GetCurrentMonotonicMillis();\n    if (millis <= 0) {\n      DartUtils::PostNull(timeout_queue_.CurrentPort());\n      timeout_queue_.RemoveCurrent();\n    }\n  }\n}\n\n\nvoid EventHandlerImplementation::Poll(uword args) {\n  EventHandler* handler = reinterpret_cast<EventHandler*>(args);\n  EventHandlerImplementation* handler_impl = &handler->delegate_;\n  ASSERT(handler_impl != NULL);\n\n  while (!handler_impl->shutdown_) {\n    int64_t millis = handler_impl->GetTimeout();\n    ASSERT((millis == kInfinityTimeout) || (millis >= 0));\n\n    mx_time_t timeout =\n        millis * kMicrosecondsPerMillisecond * kNanosecondsPerMicrosecond;\n    mx_signals_state_t signals_state;\n    mx_status_t status = mx_handle_wait_one(\n        handler_impl->interrupt_handles_[0],\n        MX_SIGNAL_READABLE | MX_SIGNAL_PEER_CLOSED,\n        timeout,\n        &signals_state);\n    if ((status != NO_ERROR) && (status != ERR_TIMED_OUT)) {\n      FATAL1(\"mx_handle_wait_one failed: %s\\n\", mx_status_get_string(status));\n    } else {\n      handler_impl->HandleTimeout();\n      if ((signals_state.satisfied & MX_SIGNAL_READABLE) != 0) {\n        handler_impl->HandleEvents();\n      }\n      if ((signals_state.satisfied & MX_SIGNAL_PEER_CLOSED) != 0) {\n        FATAL(\"EventHandlerImplementation::Poll: Unexpected peer closed\\n\");\n      }\n    }\n  }\n  handler->NotifyShutdownDone();\n}\n\n\nvoid EventHandlerImplementation::Start(EventHandler* handler) {\n  int result = Thread::Start(&EventHandlerImplementation::Poll,\n                             reinterpret_cast<uword>(handler));\n  if (result != 0) {\n    FATAL1(\"Failed to start event handler thread %d\", result);\n  }\n}\n\n\nvoid EventHandlerImplementation::Shutdown() {\n  SendData(kShutdownId, 0, 0);\n}\n\n\nvoid EventHandlerImplementation::SendData(intptr_t id,\n                                          Dart_Port dart_port,\n                                          int64_t data) {\n  WakeupHandler(id, dart_port, data);\n}\n\n}  \/\/ namespace bin\n}  \/\/ namespace dart\n\n#endif  \/\/ defined(TARGET_OS_FUCHSIA)\n\n#endif  \/\/ !defined(DART_IO_DISABLED)\n<commit_msg>Fuchsia: Fix eventhandler for changed syscall return<commit_after>\/\/ Copyright (c) 2016, 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#if !defined(DART_IO_DISABLED)\n\n#include \"platform\/globals.h\"\n#if defined(TARGET_OS_FUCHSIA)\n\n#include \"bin\/eventhandler.h\"\n#include \"bin\/eventhandler_fuchsia.h\"\n\n#include <magenta\/status.h>\n#include <magenta\/syscalls.h>\n\n#include \"bin\/thread.h\"\n#include \"bin\/utils.h\"\n\nnamespace dart {\nnamespace bin {\n\nEventHandlerImplementation::EventHandlerImplementation() {\n  mx_status_t status = mx_msgpipe_create(interrupt_handles_, 0);\n  if (status != NO_ERROR) {\n    FATAL1(\"mx_msgpipe_create failed: %s\\n\", mx_status_get_string(status));\n  }\n  shutdown_ = false;\n}\n\n\nEventHandlerImplementation::~EventHandlerImplementation() {\n  mx_status_t status = mx_handle_close(interrupt_handles_[0]);\n  if (status != NO_ERROR) {\n    FATAL1(\"mx_handle_close failed: %s\\n\", mx_status_get_string(status));\n  }\n  status = mx_handle_close(interrupt_handles_[1]);\n  if (status != NO_ERROR) {\n    FATAL1(\"mx_handle_close failed: %s\\n\", mx_status_get_string(status));\n  }\n}\n\n\nvoid EventHandlerImplementation::WakeupHandler(intptr_t id,\n                                               Dart_Port dart_port,\n                                               int64_t data) {\n  InterruptMessage msg;\n  msg.id = id;\n  msg.dart_port = dart_port;\n  msg.data = data;\n\n  mx_status_t status =\n    mx_msgpipe_write(interrupt_handles_[1], &msg, sizeof(msg), NULL, 0, 0);\n  if (status != NO_ERROR) {\n    FATAL1(\"mx_msgpipe_write failed: %s\\n\", mx_status_get_string(status));\n  }\n}\n\n\nvoid EventHandlerImplementation::HandleInterruptFd() {\n  InterruptMessage msg;\n  uint32_t bytes = kInterruptMessageSize;\n  mx_status_t status;\n  while (true) {\n    status = mx_msgpipe_read(\n        interrupt_handles_[0], &msg, &bytes, NULL, NULL, 0);\n    if (status != NO_ERROR) {\n      break;\n    }\n    ASSERT(bytes == kInterruptMessageSize);\n    if (msg.id == kTimerId) {\n      timeout_queue_.UpdateTimeout(msg.dart_port, msg.data);\n    } else if (msg.id == kShutdownId) {\n      shutdown_ = true;\n    } else {\n      UNIMPLEMENTED();\n    }\n  }\n  \/\/ status == ERR_SHOULD_WAIT when we try to read and there are no messages\n  \/\/ available, so it is an error if we get here and status != ERR_SHOULD_WAIT.\n  if (status != ERR_SHOULD_WAIT) {\n    FATAL1(\"mx_msgpipe_read failed: %s\\n\", mx_status_get_string(status));\n  }\n}\n\n\nvoid EventHandlerImplementation::HandleEvents() {\n  \/\/ TODO(zra): Handle events from other handles. At the moment we are only\n  \/\/ interrupted when there is a message on interrupt_handles_[0].\n  HandleInterruptFd();\n}\n\n\nint64_t EventHandlerImplementation::GetTimeout() const {\n  if (!timeout_queue_.HasTimeout()) {\n    return kInfinityTimeout;\n  }\n  int64_t millis = timeout_queue_.CurrentTimeout() -\n      TimerUtils::GetCurrentMonotonicMillis();\n  return (millis < 0) ? 0 : millis;\n}\n\n\nvoid EventHandlerImplementation::HandleTimeout() {\n  if (timeout_queue_.HasTimeout()) {\n    int64_t millis = timeout_queue_.CurrentTimeout() -\n        TimerUtils::GetCurrentMonotonicMillis();\n    if (millis <= 0) {\n      DartUtils::PostNull(timeout_queue_.CurrentPort());\n      timeout_queue_.RemoveCurrent();\n    }\n  }\n}\n\n\nvoid EventHandlerImplementation::Poll(uword args) {\n  EventHandler* handler = reinterpret_cast<EventHandler*>(args);\n  EventHandlerImplementation* handler_impl = &handler->delegate_;\n  ASSERT(handler_impl != NULL);\n\n  while (!handler_impl->shutdown_) {\n    int64_t millis = handler_impl->GetTimeout();\n    ASSERT((millis == kInfinityTimeout) || (millis >= 0));\n\n    mx_time_t timeout =\n        millis * kMicrosecondsPerMillisecond * kNanosecondsPerMicrosecond;\n    mx_signals_state_t signals_state;\n    mx_status_t status = mx_handle_wait_one(\n        handler_impl->interrupt_handles_[0],\n        MX_SIGNAL_READABLE | MX_SIGNAL_PEER_CLOSED,\n        timeout,\n        &signals_state);\n    if ((status != NO_ERROR) && (status != ERR_TIMED_OUT)) {\n      FATAL1(\"mx_handle_wait_one failed: %s\\n\", mx_status_get_string(status));\n    } else {\n      handler_impl->HandleTimeout();\n      if ((signals_state.satisfied & MX_SIGNAL_READABLE) != 0) {\n        handler_impl->HandleEvents();\n      }\n      if ((signals_state.satisfied & MX_SIGNAL_PEER_CLOSED) != 0) {\n        FATAL(\"EventHandlerImplementation::Poll: Unexpected peer closed\\n\");\n      }\n    }\n  }\n  handler->NotifyShutdownDone();\n}\n\n\nvoid EventHandlerImplementation::Start(EventHandler* handler) {\n  int result = Thread::Start(&EventHandlerImplementation::Poll,\n                             reinterpret_cast<uword>(handler));\n  if (result != 0) {\n    FATAL1(\"Failed to start event handler thread %d\", result);\n  }\n}\n\n\nvoid EventHandlerImplementation::Shutdown() {\n  SendData(kShutdownId, 0, 0);\n}\n\n\nvoid EventHandlerImplementation::SendData(intptr_t id,\n                                          Dart_Port dart_port,\n                                          int64_t data) {\n  WakeupHandler(id, dart_port, data);\n}\n\n}  \/\/ namespace bin\n}  \/\/ namespace dart\n\n#endif  \/\/ defined(TARGET_OS_FUCHSIA)\n\n#endif  \/\/ !defined(DART_IO_DISABLED)\n<|endoftext|>"}
{"text":"<commit_before>\/\/ This file is a part of the IncludeOS unikernel - www.includeos.org\n\/\/\n\/\/ Copyright 2015-2016 Oslo and Akershus University College of Applied Sciences\n\/\/ and Alfred Bratterud\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#pragma once\n#ifndef MODEL_SQUIRREL_HPP\n#define MODEL_SQUIRREL_HPP\n\n#include <locale>\n\n#include \"json.hpp\"\n\nnamespace acorn {\n\n\/**\n *\n *\/\nstruct Squirrel : json::Serializable {\n  size_t key;\n\n  Squirrel() : key(0) {}\n\n  \/**\n   *\n   *\/\n  Squirrel(std::string name, size_t age, std::string occupation)\n    : key(0), name_(name), age_(age), occupation_(occupation) {}\n\n  \/**\n   *\n   *\/\n  std::string json() const;\n\n  \/**\n   *\n   *\/\n  virtual void serialize(rapidjson::Writer<rapidjson::StringBuffer>&) const override;\n\n  \/**\n   *\n   *\/\n  virtual bool deserialize(const rapidjson::Document&) override;\n\n  \/**\n   *\n   *\/\n  bool is_equal(const Squirrel&) const;\n\n  \/**\n   *\n   *\/\n  static bool is_equal(const Squirrel&, const Squirrel&);\n\nprivate:\n  const std::string name_;\n  const size_t      age_;\n  const std::string occupation_;\n}; \/\/< struct Squirrel\n\n\/**--v----------- Implementation Details -----------v--**\/\n\ninline std::ostream& operator << (std::ostream& output_device, const Squirrel& s) {\n  return output_device.json();\n}\n\nvoid Squirrel::serialize(rapidjson::Writer<rapidjson::StringBuffer>& writer) const {\n  writer.StartObject();\n\n  writer.Key(\"key\");\n  writer.Uint(key);\n\n  writer.Key(\"name\");\n  writer.String(name_);\n\n  writer.Key(\"age\");\n  writer.Uint(age_);\n\n  writer.Key(\"occupation\");\n  writer.String(occupation_);\n\n  writer.EndObject();\n}\n\nbool Squirrel::deserialize(const rapidjson::Document& doc) {\n  name_ = doc[\"name\"].GetString();\n  age_ = doc[\"age\"].GetUint();\n  occupation_ = doc[\"occupation\"].GetString();\n  return true;\n}\n\nstd::string Squirrel::json() const {\n  using namespace rapidjson;\n  StringBuffer sb;\n  Writer<StringBuffer> writer(sb);\n  serialize(writer);\n  return sb.GetString();\n}\n\nbool Squirrel::is_equal(const Squirrel& s) const {\n  if(name_.size() != s.name_.size())\n    return false;\n  for(size_t i = 0; i < name_.size(); i++) {\n    if(std::tolower(name_[i]) != std::tolower(s.name_[i]))\n      return false;\n  }\n  return true;\n}\n\nbool Squirrel::is_equal(const Squirrel& s1, const Squirrel& s2) {\n  return s1.is_equal(s2);\n}\n\n\/**--^----------- Implementation Details -----------^--**\/\n\n} \/\/< namespace acorn\n\n#endif \/\/< MODEL_SQUIRREL_HPP\n<commit_msg>Refactored constructor<commit_after>\/\/ This file is a part of the IncludeOS unikernel - www.includeos.org\n\/\/\n\/\/ Copyright 2015-2016 Oslo and Akershus University College of Applied Sciences\n\/\/ and Alfred Bratterud\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#pragma once\n#ifndef MODEL_SQUIRREL_HPP\n#define MODEL_SQUIRREL_HPP\n\n#include <locale>\n\n#include \"json.hpp\"\n\nnamespace acorn {\n\n\/**\n *\n *\/\nstruct Squirrel : json::Serializable {\n  size_t key;\n\n  Squirrel() : key(0) {}\n\n  \/**\n   *\n   *\/\n  Squirrel(std::string name, size_t age, std::string occupation)\n    : key         {0}\n    , name_       {name}\n    , age_        {age}\n    , occupation_ {occupation}\n  {}\n\n  \/**\n   *\n   *\/\n  std::string json() const;\n\n  \/**\n   *\n   *\/\n  virtual void serialize(rapidjson::Writer<rapidjson::StringBuffer>&) const override;\n\n  \/**\n   *\n   *\/\n  virtual bool deserialize(const rapidjson::Document&) override;\n\n  \/**\n   *\n   *\/\n  bool is_equal(const Squirrel&) const;\n\n  \/**\n   *\n   *\/\n  static bool is_equal(const Squirrel&, const Squirrel&);\n\nprivate:\n  const std::string name_;\n  const size_t      age_;\n  const std::string occupation_;\n}; \/\/< struct Squirrel\n\n\/**--v----------- Implementation Details -----------v--**\/\n\ninline std::ostream& operator << (std::ostream& output_device, const Squirrel& s) {\n  return output_device.json();\n}\n\nvoid Squirrel::serialize(rapidjson::Writer<rapidjson::StringBuffer>& writer) const {\n  writer.StartObject();\n\n  writer.Key(\"key\");\n  writer.Uint(key);\n\n  writer.Key(\"name\");\n  writer.String(name_);\n\n  writer.Key(\"age\");\n  writer.Uint(age_);\n\n  writer.Key(\"occupation\");\n  writer.String(occupation_);\n\n  writer.EndObject();\n}\n\nbool Squirrel::deserialize(const rapidjson::Document& doc) {\n  name_ = doc[\"name\"].GetString();\n  age_ = doc[\"age\"].GetUint();\n  occupation_ = doc[\"occupation\"].GetString();\n  return true;\n}\n\nstd::string Squirrel::json() const {\n  using namespace rapidjson;\n  StringBuffer sb;\n  Writer<StringBuffer> writer(sb);\n  serialize(writer);\n  return sb.GetString();\n}\n\nbool Squirrel::is_equal(const Squirrel& s) const {\n  if(name_.size() != s.name_.size())\n    return false;\n  for(size_t i = 0; i < name_.size(); i++) {\n    if(std::tolower(name_[i]) != std::tolower(s.name_[i]))\n      return false;\n  }\n  return true;\n}\n\nbool Squirrel::is_equal(const Squirrel& s1, const Squirrel& s2) {\n  return s1.is_equal(s2);\n}\n\n\/**--^----------- Implementation Details -----------^--**\/\n\n} \/\/< namespace acorn\n\n#endif \/\/< MODEL_SQUIRREL_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/\/ -------------------------------------------------------------------------\r\n\/\/    @FileName      :    NFCElementInfoModule.h\r\n\/\/    @Author           :    LvSheng.Huang\r\n\/\/    @Date             :    2012-12-15\r\n\/\/    @Module           :    NFCElementInfoModule\r\n\/\/\r\n\/\/ -------------------------------------------------------------------------\r\n\r\n\/\/\/\/#include \"stdafx.h\"\r\n#include <algorithm>\r\n#include <ctype.h>\r\n#include \"NFConfigPlugin.h\"\r\n#include \"NFCElementInfoModule.h\"\r\n#include \"NFCLogicClassModule.h\"\r\n\r\n\/\/\/\/\r\n\r\nNFCElementInfoModule::NFCElementInfoModule(NFIPluginManager* p)\r\n{\r\n    pPluginManager = p;\r\n    mbLoaded = false;\r\n}\r\n\r\nNFCElementInfoModule::~NFCElementInfoModule()\r\n{\r\n\r\n}\r\n\r\nbool NFCElementInfoModule::Init()\r\n{\r\n    m_pLogicClassModule = dynamic_cast<NFCLogicClassModule*>(pPluginManager->FindModule(\"NFCLogicClassModule\"));\r\n\r\n    assert(NULL != m_pLogicClassModule);\r\n\r\n\tClear();\r\n    Load();\r\n\r\n    return true;\r\n}\r\n\r\nbool NFCElementInfoModule::Shut()\r\n{\r\n    Clear();\r\n    return true;\r\n}\r\n\r\nbool NFCElementInfoModule::Load()\r\n{\r\n    if (mbLoaded)\r\n    {\r\n        return false;\r\n    }\r\n\r\n    NFILogicClass* pLogicClass = m_pLogicClassModule->First();\r\n    while (pLogicClass)\r\n    {\r\n        const std::string& strInstancePath = pLogicClass->GetInstancePath();\r\n        if (strInstancePath.length() == 0)\r\n        {\r\n            pLogicClass = m_pLogicClassModule->Next();\r\n            continue;\r\n        }\r\n\r\n        rapidxml::file<> fdoc(strInstancePath.c_str());\r\n        \/\/std::cout << fdoc.data() << std::endl;\r\n        rapidxml::xml_document<>  doc;\r\n        doc.parse<0>(fdoc.data());\r\n\r\n        \/\/support for unlimited layer class inherits\r\n        rapidxml::xml_node<>* root = doc.first_node();\r\n        for (rapidxml::xml_node<>* attrNode = root->first_node(); attrNode; attrNode = attrNode->next_sibling())\r\n        {\r\n            Load(attrNode, pLogicClass);\r\n        }\r\n\r\n        mbLoaded = true;\r\n\r\n        pLogicClass = m_pLogicClassModule->Next();\r\n    }\r\n\r\n    return true;\r\n}\r\n\r\nbool NFCElementInfoModule::Load(rapidxml::xml_node<>* attrNode, NFILogicClass* pLogicClass)\r\n{\r\n    \/\/attrNode is the node of a object\r\n    std::string strConfigID = attrNode->first_attribute(\"ID\")->value();\r\n\tif (strConfigID.empty())\r\n\t{\r\n\t\tNFASSERT(0, strConfigID, __FILE__, __FUNCTION__);\r\n\t\treturn false;\r\n\t}\r\n\r\n    if (ExistElement(strConfigID))\r\n    {\r\n\t\tNFASSERT(0, strConfigID, __FILE__, __FUNCTION__);\r\n        return false;\r\n    }\r\n\r\n    ElementConfigInfo* pElementInfo = new ElementConfigInfo();\r\n    AddElement(strConfigID, pElementInfo);\r\n\r\n    \/\/can find all configid by class name\r\n    pLogicClass->AddConfigName(strConfigID);\r\n\r\n    \/\/ElementConfigInfo* pElementInfo = CreateElement( strConfigID, pElementInfo );\r\n    NFIPropertyManager* pElementPropertyManager = pElementInfo->GetPropertyManager();\r\n    NFIRecordManager* pElementRecordManager = pElementInfo->GetRecordManager();\r\n\r\n    \/\/1.add property\r\n    \/\/2.set the default value  of them\r\n    NFIPropertyManager* pClassPropertyManager = pLogicClass->GetPropertyManager();\r\n    NFIRecordManager* pClassRecordManager = pLogicClass->GetRecordManager();\r\n    if (pClassPropertyManager && pClassRecordManager)\r\n    {\r\n        NFIProperty* pProperty = pClassPropertyManager->First();\r\n        while (pProperty)\r\n        {\r\n\r\n            pElementPropertyManager->AddProperty(0, pProperty);\r\n\r\n            pProperty = pClassPropertyManager->Next();\r\n        }\r\n\r\n        NFIRecord* pRecord = pClassRecordManager->First();\r\n        while (pRecord)\r\n        {\r\n            pElementRecordManager->AddRecord(0, pRecord->GetName(), pRecord->GetInitData(), pRecord->GetKeyState(), pRecord->GetInitDesc(), pRecord->GetTag(), pRecord->GetRelatedRecord(), pRecord->GetRows(), pRecord->GetPublic(), pRecord->GetPrivate(), pRecord->GetSave(), pRecord->GetIndex());\r\n            pRecord = pClassRecordManager->Next();\r\n        }\r\n\r\n    }\r\n\r\n    \/\/3.set the config value to them\r\n\r\n    \/\/const char* pstrConfigID = attrNode->first_attribute( \"ID\" );\r\n    for (rapidxml::xml_attribute<>* pAttribute = attrNode->first_attribute(); pAttribute; pAttribute = pAttribute->next_attribute())\r\n    {\r\n        const char* pstrConfigName = pAttribute->name();\r\n        const char* pstrConfigValue = pAttribute->value();\r\n        \/\/printf( \"%s : %s\\n\", pstrConfigName, pstrConfigValue );\r\n\r\n        NFIProperty* temProperty = pElementPropertyManager->GetElement(pstrConfigName);\r\n        if (!temProperty)\r\n        {\r\n            continue;\r\n        }\r\n\r\n        NFIValueList::VarData var;\r\n        VARIANT_TYPE eType = temProperty->GetType();\r\n        var.nType = eType;\r\n        switch (eType)\r\n        {\r\n            case VTYPE_INT:\r\n\t\t\t\t{\r\n\t\t\t\t\tif(!LegalNumber(pstrConfigValue))\r\n\t\t\t\t\t{\r\n                        NFASSERT(0, temProperty->GetKey(), __FILE__, __FUNCTION__);\r\n\t\t\t\t\t}\r\n\t\t\t\t\tvar.variantData = (int)atoi(pstrConfigValue);\r\n\t\t\t\t}\r\n                break;\r\n            case VTYPE_FLOAT:\r\n                {\r\n                    if (strlen(pstrConfigValue) <= 0)\r\n                    {\r\n                        NFASSERT(0, temProperty->GetKey(), __FILE__, __FUNCTION__);\r\n                    }\r\n                    var.variantData = (float)atof(pstrConfigValue);\r\n                }\r\n                break;\r\n            case VTYPE_DOUBLE:\r\n                {\r\n                    if (strlen(pstrConfigValue) <= 0)\r\n                    {\r\n                        NFASSERT(0, temProperty->GetKey(), __FILE__, __FUNCTION__);\r\n                    }\r\n                    var.variantData = (double)atof(pstrConfigValue);\r\n                }                \r\n                break;\r\n            case VTYPE_STRING:\r\n                var.variantData = std::string(pstrConfigValue);\r\n                break;\r\n            case VTYPE_OBJECT:\r\n                {\r\n                    if (strlen(pstrConfigValue) <= 0)\r\n                    {\r\n                        NFASSERT(0, temProperty->GetKey(), __FILE__, __FUNCTION__);\r\n                    }\r\n                    var.variantData = (NFINT64)0;\r\n                }\r\n                \r\n                break;\r\n            case VTYPE_POINTER:\r\n                var.variantData = (void*)NULL;\r\n                break;\r\n            default:\r\n               NFASSERT(0, temProperty->GetKey(), __FILE__, __FUNCTION__);\r\n                break;\r\n        }\r\n\r\n        pElementPropertyManager->SetProperty(pstrConfigName, var);\r\n    }\r\n\r\n    NFCValueList varClassName;\r\n    varClassName << pLogicClass->GetClassName().c_str();\r\n    pElementPropertyManager->SetProperty(\"ClassName\", *varClassName.GetStackConst(0));\r\n\r\n    return true;\r\n}\r\n\r\nbool NFCElementInfoModule::Save()\r\n{\r\n    return true;\r\n}\r\n\r\nint NFCElementInfoModule::QueryPropertyInt(const std::string& strConfigName, const std::string& strPropertyName)\r\n{\r\n    NFIProperty* pProperty = QueryProperty(strConfigName, strPropertyName);\r\n    if (pProperty)\r\n    {\r\n        return pProperty->QueryInt();\r\n    }\r\n\r\n    return 0;\r\n}\r\n\r\nfloat NFCElementInfoModule::QueryPropertyFloat(const std::string& strConfigName, const std::string& strPropertyName)\r\n{\r\n    NFIProperty* pProperty = QueryProperty(strConfigName, strPropertyName);\r\n    if (pProperty)\r\n    {\r\n        return pProperty->QueryFloat();\r\n    }\r\n\r\n    return 0.0f;\r\n}\r\n\r\ndouble NFCElementInfoModule::QueryPropertyDouble(const std::string& strConfigName, const std::string& strPropertyName)\r\n{\r\n    NFIProperty* pProperty = QueryProperty(strConfigName, strPropertyName);\r\n    if (pProperty)\r\n    {\r\n        return pProperty->QueryDouble();\r\n    }\r\n\r\n    return 0.0;\r\n}\r\n\r\nconst std::string& NFCElementInfoModule::QueryPropertyString(const std::string& strConfigName, const std::string& strPropertyName)\r\n{\r\n    NFIProperty* pProperty = QueryProperty(strConfigName, strPropertyName);\r\n    if (pProperty)\r\n    {\r\n        return pProperty->QueryString();\r\n    }\r\n\r\n    return  NULL_STR;\r\n}\r\n\r\nNFIProperty* NFCElementInfoModule::QueryProperty(const std::string& strConfigName, const std::string& strPropertyName)\r\n{\r\n    ElementConfigInfo* pElementInfo = GetElement(strConfigName);\r\n    if (pElementInfo)\r\n    {\r\n        return pElementInfo->GetPropertyManager()->GetElement(strPropertyName);\r\n    }\r\n\r\n    return NULL;\r\n}\r\n\r\nNFIPropertyManager* NFCElementInfoModule::GetPropertyManager(const std::string& strConfigName)\r\n{\r\n    ElementConfigInfo* pElementInfo = GetElement(strConfigName);\r\n    if (pElementInfo)\r\n    {\r\n        return pElementInfo->GetPropertyManager();\r\n    }\r\n\r\n    return NULL;\r\n}\r\n\r\nNFIRecordManager* NFCElementInfoModule::GetRecordManager(const std::string& strConfigName)\r\n{\r\n    ElementConfigInfo* pElementInfo = GetElement(strConfigName);\r\n    if (pElementInfo)\r\n    {\r\n        return pElementInfo->GetRecordManager();\r\n    }\r\n    return NULL;\r\n}\r\n\r\nbool NFCElementInfoModule::LoadSceneInfo(const std::string& strFileName, const std::string& strClassName)\r\n{\r\n    rapidxml::file<> fdoc(strFileName.c_str());\r\n    \/\/std::cout << fdoc.data() << std::endl;\r\n    rapidxml::xml_document<>  doc;\r\n    doc.parse<0>(fdoc.data());\r\n\r\n    NFILogicClass* pLogicClass = m_pLogicClassModule->GetElement(strClassName.c_str());\r\n    if (pLogicClass)\r\n    {\r\n        \/\/support for unlimited layer class inherits\r\n        rapidxml::xml_node<>* root = doc.first_node();\r\n        for (rapidxml::xml_node<>* attrNode = root->first_node(); attrNode; attrNode = attrNode->next_sibling())\r\n        {\r\n            Load(attrNode, pLogicClass);\r\n        }\r\n    }\r\n    else\r\n    {\r\n        std::cout << \"error load scene info failed, name is:\" << strClassName << \" file name is :\" << strFileName << std::endl;\r\n    }\r\n\r\n    return true;\r\n}\r\n\r\nbool NFCElementInfoModule::ExistElement(const std::string& strConfigName)\r\n{\r\n    ElementConfigInfo* pElementInfo = GetElement(strConfigName);\r\n    if (pElementInfo)\r\n    {\r\n        return true;\r\n    }\r\n\r\n    return false;\r\n}\r\n\r\nbool NFCElementInfoModule::LegalNumber( const char* str )\r\n{\r\n\tint nLen = int(strlen(str));\r\n\tif (nLen <= 0)\r\n\t{\r\n\t\treturn false;\r\n\t}\r\n\r\n\tint nStart = 0;\r\n\tif('-' == str[0])\r\n\t{\r\n\t\tnStart = 1;\r\n\t}\r\n\r\n\tfor (int i = nStart; i < nLen; ++i)\r\n\t{\r\n\t\tif(!isdigit(str[i]))\r\n\t\t{\r\n\t\t\treturn false;\r\n\t\t}\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\nbool NFCElementInfoModule::AfterInit()\r\n{\r\n\treturn true;\r\n\r\n}\r\n\r\nbool NFCElementInfoModule::BeforeShut()\r\n{\r\n\treturn true;\r\n\r\n}\r\n\r\nbool NFCElementInfoModule::Execute( const float fLasFrametime, const float fStartedTime )\r\n{\r\n\treturn true;\r\n\r\n}\r\n\r\nvoid NFCElementInfoModule::OnReload( const char* strModuleName, NFILogicModule* pModule )\r\n{\r\n\t\r\n\r\n\treturn;\r\n\r\n}\r\n\r\nbool NFCElementInfoModule::Clear()\r\n{\r\n    ElementConfigInfo* pElementConfigInfo = First();\r\n    while (pElementConfigInfo)\r\n    {\r\n        delete pElementConfigInfo;\r\n        pElementConfigInfo = NULL;\r\n\r\n        pElementConfigInfo = Next();\r\n    }\r\n\r\n\treturn true;\r\n}\r\n<commit_msg>modify init function in NFCElementInfoModule; modify clear function in NFCElementInfoModule<commit_after>\/\/ -------------------------------------------------------------------------\r\n\/\/    @FileName      :    NFCElementInfoModule.h\r\n\/\/    @Author           :    LvSheng.Huang\r\n\/\/    @Date             :    2012-12-15\r\n\/\/    @Module           :    NFCElementInfoModule\r\n\/\/\r\n\/\/ -------------------------------------------------------------------------\r\n\r\n\/\/\/\/#include \"stdafx.h\"\r\n#include <algorithm>\r\n#include <ctype.h>\r\n#include \"NFConfigPlugin.h\"\r\n#include \"NFCElementInfoModule.h\"\r\n#include \"NFCLogicClassModule.h\"\r\n\r\n\/\/\/\/\r\n\r\nNFCElementInfoModule::NFCElementInfoModule(NFIPluginManager* p)\r\n{\r\n    pPluginManager = p;\r\n    mbLoaded = false;\r\n}\r\n\r\nNFCElementInfoModule::~NFCElementInfoModule()\r\n{\r\n\r\n}\r\n\r\nbool NFCElementInfoModule::Init()\r\n{\r\n    m_pLogicClassModule = dynamic_cast<NFCLogicClassModule*>(pPluginManager->FindModule(\"NFCLogicClassModule\"));\r\n\r\n    assert(NULL != m_pLogicClassModule);\r\n\r\n\/\/     Clear();\r\n\/\/     Load();\r\n\r\n    return true;\r\n}\r\n\r\nbool NFCElementInfoModule::Shut()\r\n{\r\n    Clear();\r\n    return true;\r\n}\r\n\r\nbool NFCElementInfoModule::Load()\r\n{\r\n    if (mbLoaded)\r\n    {\r\n        return false;\r\n    }\r\n\r\n    NFILogicClass* pLogicClass = m_pLogicClassModule->First();\r\n    while (pLogicClass)\r\n    {\r\n        const std::string& strInstancePath = pLogicClass->GetInstancePath();\r\n        if (strInstancePath.length() == 0)\r\n        {\r\n            pLogicClass = m_pLogicClassModule->Next();\r\n            continue;\r\n        }\r\n\r\n        rapidxml::file<> fdoc(strInstancePath.c_str());\r\n        \/\/std::cout << fdoc.data() << std::endl;\r\n        rapidxml::xml_document<>  doc;\r\n        doc.parse<0>(fdoc.data());\r\n\r\n        \/\/support for unlimited layer class inherits\r\n        rapidxml::xml_node<>* root = doc.first_node();\r\n        for (rapidxml::xml_node<>* attrNode = root->first_node(); attrNode; attrNode = attrNode->next_sibling())\r\n        {\r\n            Load(attrNode, pLogicClass);\r\n        }\r\n\r\n        mbLoaded = true;\r\n\r\n        pLogicClass = m_pLogicClassModule->Next();\r\n    }\r\n\r\n    return true;\r\n}\r\n\r\nbool NFCElementInfoModule::Load(rapidxml::xml_node<>* attrNode, NFILogicClass* pLogicClass)\r\n{\r\n    \/\/attrNode is the node of a object\r\n    std::string strConfigID = attrNode->first_attribute(\"ID\")->value();\r\n\tif (strConfigID.empty())\r\n\t{\r\n\t\tNFASSERT(0, strConfigID, __FILE__, __FUNCTION__);\r\n\t\treturn false;\r\n\t}\r\n\r\n    if (ExistElement(strConfigID))\r\n    {\r\n\t\tNFASSERT(0, strConfigID, __FILE__, __FUNCTION__);\r\n        return false;\r\n    }\r\n\r\n    ElementConfigInfo* pElementInfo = new ElementConfigInfo();\r\n    AddElement(strConfigID, pElementInfo);\r\n\r\n    \/\/can find all configid by class name\r\n    pLogicClass->AddConfigName(strConfigID);\r\n\r\n    \/\/ElementConfigInfo* pElementInfo = CreateElement( strConfigID, pElementInfo );\r\n    NFIPropertyManager* pElementPropertyManager = pElementInfo->GetPropertyManager();\r\n    NFIRecordManager* pElementRecordManager = pElementInfo->GetRecordManager();\r\n\r\n    \/\/1.add property\r\n    \/\/2.set the default value  of them\r\n    NFIPropertyManager* pClassPropertyManager = pLogicClass->GetPropertyManager();\r\n    NFIRecordManager* pClassRecordManager = pLogicClass->GetRecordManager();\r\n    if (pClassPropertyManager && pClassRecordManager)\r\n    {\r\n        NFIProperty* pProperty = pClassPropertyManager->First();\r\n        while (pProperty)\r\n        {\r\n\r\n            pElementPropertyManager->AddProperty(0, pProperty);\r\n\r\n            pProperty = pClassPropertyManager->Next();\r\n        }\r\n\r\n        NFIRecord* pRecord = pClassRecordManager->First();\r\n        while (pRecord)\r\n        {\r\n            pElementRecordManager->AddRecord(0, pRecord->GetName(), pRecord->GetInitData(), pRecord->GetKeyState(), pRecord->GetInitDesc(), pRecord->GetTag(), pRecord->GetRelatedRecord(), pRecord->GetRows(), pRecord->GetPublic(), pRecord->GetPrivate(), pRecord->GetSave(), pRecord->GetIndex());\r\n            pRecord = pClassRecordManager->Next();\r\n        }\r\n\r\n    }\r\n\r\n    \/\/3.set the config value to them\r\n\r\n    \/\/const char* pstrConfigID = attrNode->first_attribute( \"ID\" );\r\n    for (rapidxml::xml_attribute<>* pAttribute = attrNode->first_attribute(); pAttribute; pAttribute = pAttribute->next_attribute())\r\n    {\r\n        const char* pstrConfigName = pAttribute->name();\r\n        const char* pstrConfigValue = pAttribute->value();\r\n        \/\/printf( \"%s : %s\\n\", pstrConfigName, pstrConfigValue );\r\n\r\n        NFIProperty* temProperty = pElementPropertyManager->GetElement(pstrConfigName);\r\n        if (!temProperty)\r\n        {\r\n            continue;\r\n        }\r\n\r\n        NFIValueList::VarData var;\r\n        VARIANT_TYPE eType = temProperty->GetType();\r\n        var.nType = eType;\r\n        switch (eType)\r\n        {\r\n            case VTYPE_INT:\r\n\t\t\t\t{\r\n\t\t\t\t\tif(!LegalNumber(pstrConfigValue))\r\n\t\t\t\t\t{\r\n                        NFASSERT(0, temProperty->GetKey(), __FILE__, __FUNCTION__);\r\n\t\t\t\t\t}\r\n\t\t\t\t\tvar.variantData = (int)atoi(pstrConfigValue);\r\n\t\t\t\t}\r\n                break;\r\n            case VTYPE_FLOAT:\r\n                {\r\n                    if (strlen(pstrConfigValue) <= 0)\r\n                    {\r\n                        NFASSERT(0, temProperty->GetKey(), __FILE__, __FUNCTION__);\r\n                    }\r\n                    var.variantData = (float)atof(pstrConfigValue);\r\n                }\r\n                break;\r\n            case VTYPE_DOUBLE:\r\n                {\r\n                    if (strlen(pstrConfigValue) <= 0)\r\n                    {\r\n                        NFASSERT(0, temProperty->GetKey(), __FILE__, __FUNCTION__);\r\n                    }\r\n                    var.variantData = (double)atof(pstrConfigValue);\r\n                }                \r\n                break;\r\n            case VTYPE_STRING:\r\n                var.variantData = std::string(pstrConfigValue);\r\n                break;\r\n            case VTYPE_OBJECT:\r\n                {\r\n                    if (strlen(pstrConfigValue) <= 0)\r\n                    {\r\n                        NFASSERT(0, temProperty->GetKey(), __FILE__, __FUNCTION__);\r\n                    }\r\n                    var.variantData = (NFINT64)0;\r\n                }\r\n                \r\n                break;\r\n            case VTYPE_POINTER:\r\n                var.variantData = (void*)NULL;\r\n                break;\r\n            default:\r\n               NFASSERT(0, temProperty->GetKey(), __FILE__, __FUNCTION__);\r\n                break;\r\n        }\r\n\r\n        pElementPropertyManager->SetProperty(pstrConfigName, var);\r\n    }\r\n\r\n    NFCValueList varClassName;\r\n    varClassName << pLogicClass->GetClassName().c_str();\r\n    pElementPropertyManager->SetProperty(\"ClassName\", *varClassName.GetStackConst(0));\r\n\r\n    return true;\r\n}\r\n\r\nbool NFCElementInfoModule::Save()\r\n{\r\n    return true;\r\n}\r\n\r\nint NFCElementInfoModule::QueryPropertyInt(const std::string& strConfigName, const std::string& strPropertyName)\r\n{\r\n    NFIProperty* pProperty = QueryProperty(strConfigName, strPropertyName);\r\n    if (pProperty)\r\n    {\r\n        return pProperty->QueryInt();\r\n    }\r\n\r\n    return 0;\r\n}\r\n\r\nfloat NFCElementInfoModule::QueryPropertyFloat(const std::string& strConfigName, const std::string& strPropertyName)\r\n{\r\n    NFIProperty* pProperty = QueryProperty(strConfigName, strPropertyName);\r\n    if (pProperty)\r\n    {\r\n        return pProperty->QueryFloat();\r\n    }\r\n\r\n    return 0.0f;\r\n}\r\n\r\ndouble NFCElementInfoModule::QueryPropertyDouble(const std::string& strConfigName, const std::string& strPropertyName)\r\n{\r\n    NFIProperty* pProperty = QueryProperty(strConfigName, strPropertyName);\r\n    if (pProperty)\r\n    {\r\n        return pProperty->QueryDouble();\r\n    }\r\n\r\n    return 0.0;\r\n}\r\n\r\nconst std::string& NFCElementInfoModule::QueryPropertyString(const std::string& strConfigName, const std::string& strPropertyName)\r\n{\r\n    NFIProperty* pProperty = QueryProperty(strConfigName, strPropertyName);\r\n    if (pProperty)\r\n    {\r\n        return pProperty->QueryString();\r\n    }\r\n\r\n    return  NULL_STR;\r\n}\r\n\r\nNFIProperty* NFCElementInfoModule::QueryProperty(const std::string& strConfigName, const std::string& strPropertyName)\r\n{\r\n    ElementConfigInfo* pElementInfo = GetElement(strConfigName);\r\n    if (pElementInfo)\r\n    {\r\n        return pElementInfo->GetPropertyManager()->GetElement(strPropertyName);\r\n    }\r\n\r\n    return NULL;\r\n}\r\n\r\nNFIPropertyManager* NFCElementInfoModule::GetPropertyManager(const std::string& strConfigName)\r\n{\r\n    ElementConfigInfo* pElementInfo = GetElement(strConfigName);\r\n    if (pElementInfo)\r\n    {\r\n        return pElementInfo->GetPropertyManager();\r\n    }\r\n\r\n    return NULL;\r\n}\r\n\r\nNFIRecordManager* NFCElementInfoModule::GetRecordManager(const std::string& strConfigName)\r\n{\r\n    ElementConfigInfo* pElementInfo = GetElement(strConfigName);\r\n    if (pElementInfo)\r\n    {\r\n        return pElementInfo->GetRecordManager();\r\n    }\r\n    return NULL;\r\n}\r\n\r\nbool NFCElementInfoModule::LoadSceneInfo(const std::string& strFileName, const std::string& strClassName)\r\n{\r\n    rapidxml::file<> fdoc(strFileName.c_str());\r\n    \/\/std::cout << fdoc.data() << std::endl;\r\n    rapidxml::xml_document<>  doc;\r\n    doc.parse<0>(fdoc.data());\r\n\r\n    NFILogicClass* pLogicClass = m_pLogicClassModule->GetElement(strClassName.c_str());\r\n    if (pLogicClass)\r\n    {\r\n        \/\/support for unlimited layer class inherits\r\n        rapidxml::xml_node<>* root = doc.first_node();\r\n        for (rapidxml::xml_node<>* attrNode = root->first_node(); attrNode; attrNode = attrNode->next_sibling())\r\n        {\r\n            Load(attrNode, pLogicClass);\r\n        }\r\n    }\r\n    else\r\n    {\r\n        std::cout << \"error load scene info failed, name is:\" << strClassName << \" file name is :\" << strFileName << std::endl;\r\n    }\r\n\r\n    return true;\r\n}\r\n\r\nbool NFCElementInfoModule::ExistElement(const std::string& strConfigName)\r\n{\r\n    ElementConfigInfo* pElementInfo = GetElement(strConfigName);\r\n    if (pElementInfo)\r\n    {\r\n        return true;\r\n    }\r\n\r\n    return false;\r\n}\r\n\r\nbool NFCElementInfoModule::LegalNumber( const char* str )\r\n{\r\n\tint nLen = int(strlen(str));\r\n\tif (nLen <= 0)\r\n\t{\r\n\t\treturn false;\r\n\t}\r\n\r\n\tint nStart = 0;\r\n\tif('-' == str[0])\r\n\t{\r\n\t\tnStart = 1;\r\n\t}\r\n\r\n\tfor (int i = nStart; i < nLen; ++i)\r\n\t{\r\n\t\tif(!isdigit(str[i]))\r\n\t\t{\r\n\t\t\treturn false;\r\n\t\t}\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\nbool NFCElementInfoModule::AfterInit()\r\n{\r\n\treturn true;\r\n\r\n}\r\n\r\nbool NFCElementInfoModule::BeforeShut()\r\n{\r\n\treturn true;\r\n\r\n}\r\n\r\nbool NFCElementInfoModule::Execute( const float fLasFrametime, const float fStartedTime )\r\n{\r\n\treturn true;\r\n\r\n}\r\n\r\nvoid NFCElementInfoModule::OnReload( const char* strModuleName, NFILogicModule* pModule )\r\n{\r\n\t\r\n\r\n\treturn;\r\n\r\n}\r\n\r\nbool NFCElementInfoModule::Clear()\r\n{\r\n    ElementConfigInfo* pElementConfigInfo = First();\r\n    while (pElementConfigInfo)\r\n    {\r\n        delete pElementConfigInfo;\r\n        pElementConfigInfo = NULL;\r\n\r\n        pElementConfigInfo = Next();\r\n    }\r\n\r\n    mbLoaded = false;\r\n\treturn true;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>#ifndef __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__DISCRETE__ORDERED_LOGISTIC_HPP__\n#define __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__DISCRETE__ORDERED_LOGISTIC_HPP__\n\n#include <boost\/random\/uniform_01.hpp>\n#include <boost\/random\/variate_generator.hpp>\n#include <stan\/prob\/distributions\/multivariate\/discrete\/categorical.hpp>\n\n#include <stan\/prob\/traits.hpp>\n#include <stan\/math\/error_handling.hpp>\n#include <stan\/math\/special_functions.hpp>\n#include <stan\/math\/functions\/log1m.hpp>\n#include <stan\/math\/matrix_error_handling.hpp>\n#include <stan\/math\/error_handling.hpp>\n#include <stan\/prob\/constants.hpp>\n\n\nnamespace stan {\n\n  namespace prob {\n\n\n    template <typename T>\n    inline T log_inv_logit_diff(const T& alpha, const T& beta) {\n      using std::exp;\n      using stan::math::log1m;\n      using stan::math::log1p_exp;\n      return beta + log1m(exp(alpha - beta)) - log1p_exp(alpha) - log1p_exp(beta);\n    }\n \n    \/\/ y in 0,...,K-1;   c.size()==K-2,  c increasing,  lambda finite\n    \/**\n     * Returns the (natural) log probability of the specified integer\n     * outcome given the continuous location and specified cutpoints\n     * in an ordered logistic model.  \n     *\n     * <p>Typically the continous location\n     * will be the dot product of a vector of regression coefficients\n     * and a vector of predictors for the outcome.\n     *\n     * @tparam propto True if calculating up to a proportion.\n     * @tparam T_loc Location type.\n     * @tparam T_cut Cut-point type.\n     * @tparam Policy Error policy (only its type matters). \n\n     * @param y Outcome.\n     * @param lambda Location.\n     * @param c Positive increasing vector of cutpoints.\n     * @return Log probability of outcome given location and\n     * cutpoints.\n     \n     * @throw std::domain_error If the outcome is not between 1 and\n     * the number of cutpoints plus 2; if the cutpoint vector is\n     * empty; if the cutpoint vector contains a non-positive,\n     * non-finite value; or if the cutpoint vector is not sorted in\n     * ascending order.\n     *\/\n    template <bool propto,\n              typename T_lambda,\n              typename T_cut,\n              class Policy>\n    typename boost::math::tools::promote_args<T_lambda,T_cut>::type\n    ordered_logistic_log(int y,  \n                         const T_lambda& lambda,  \n                         const Eigen::Matrix<T_cut,Eigen::Dynamic,1>& c, \n                         const Policy&) {\n\n      using std::exp;\n      using std::log;\n      using stan::math::inv_logit;\n      using stan::math::log1m;\n      using stan::math::log1p_exp;\n\n      static const char* function = \"stan::prob::ordered_logistic(%1%)\";\n      \n      using stan::math::check_finite;\n      using stan::math::check_positive;\n      using stan::math::check_nonnegative;\n      using stan::math::check_less;\n      using stan::math::check_less_or_equal;\n      using stan::math::check_greater;\n      using stan::math::check_bounded;\n\n      int K = c.size() + 1;\n\n      typename boost::math::tools::promote_args<T_lambda,T_cut>::type lp(0.0);\n      if (!check_bounded(function, y, 1, K,\n                         \"Random variable\", \n                         &lp, Policy()))\n        return lp;\n\n      if (!check_finite(function, lambda, \n                        \"Location parameter\", &lp, Policy()))\n        return lp;\n\n      if (!check_greater(function, c.size(), 0,\n                         \"Size of cut points parameter\",\n                         &lp, Policy()))\n        return lp;\n\n\n      for (int i = 1; i < c.size(); ++i) {\n        if (!check_greater(function, c(i), c(i - 1),\n                           \"Cut points parameter\",\n                           &lp, Policy()))\n          return lp;\n      }\n\n      if (!check_finite(function, c(c.size()-1), \n                        \"Cut points parameter\",\n                        &lp, Policy()))\n        return lp;\n      \n      if (!check_finite(function, c(0),\n                        \"Cut points parameter\",\n                        &lp, Policy())) \n        return lp;\n\n      \/\/ log(1 - inv_logit(lambda))\n      if (y == 1)\n        return -log1p_exp(lambda - c(0)); \n\n      \/\/ log(inv_logit(lambda - c(K-3)));\n      if (y == K) {\n        return -log1p_exp(c(K-2) - lambda);\n      }\n\n      \/\/ if (2 < y < K) { ... }\n      \/\/ log(inv_logit(lambda - c(y-2)) - inv_logit(lambda - c(y-1)))\n      return log_inv_logit_diff(c(y-2) - lambda, \n                                c(y-1) - lambda);\n\n    }\n\n\n    template <bool propto,\n              typename T_lambda,\n              typename T_cut>\n    typename boost::math::tools::promote_args<T_lambda,T_cut>::type\n    ordered_logistic_log(int y,  \n                         const T_lambda& lambda,  \n                         const Eigen::Matrix<T_cut,Eigen::Dynamic,1>& c) {\n      return ordered_logistic_log<propto>(y,lambda,c,stan::math::default_policy());\n    }\n\n\n    template <typename T_lambda,\n              typename T_cut,\n              class Policy>\n    typename boost::math::tools::promote_args<T_lambda,T_cut>::type\n    ordered_logistic_log(int y,  \n                         const T_lambda& lambda,  \n                         const Eigen::Matrix<T_cut,Eigen::Dynamic,1>& c,\n                         const Policy&) {\n      return ordered_logistic_log<false>(y,lambda,c,Policy());\n    }\n\n\n    template <typename T_lambda,\n              typename T_cut>\n    typename boost::math::tools::promote_args<T_lambda,T_cut>::type\n    ordered_logistic_log(int y,  \n                         const T_lambda& lambda,  \n                         const Eigen::Matrix<T_cut,Eigen::Dynamic,1>& c) {\n      return ordered_logistic_log<false>(y,lambda,c,stan::math::default_policy());\n    }\n\n    template <class RNG>\n    inline int\n    ordered_logistic_rng(double eta,\n\t\t\t const Eigen::Matrix<double,Eigen::Dynamic,1>& c,\n\t\t\t RNG& rng) {\n      using boost::variate_generator;\n      using stan::math::inv_logit;\n      Eigen::VectorXd cut(c.rows());\n      cut(0) = 1 - inv_logit(eta - c(0));\n      for(int j = 1; j < c.rows() - 1; j++)\n\tcut(j) = inv_logit(eta - c(j - 1)) - inv_logit(eta - c(j));\n      cut(c.rows() - 1) = inv_logit(eta - c(c.rows() - 2));\n\n      return stan::prob::categorical_rng(cut, rng);\n    }\n  }\n}\n\n#endif\n<commit_msg>moving log1p_exp out of src\/stan\/math\/special_functions.hpp<commit_after>#ifndef __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__DISCRETE__ORDERED_LOGISTIC_HPP__\n#define __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__DISCRETE__ORDERED_LOGISTIC_HPP__\n\n#include <boost\/random\/uniform_01.hpp>\n#include <boost\/random\/variate_generator.hpp>\n#include <stan\/prob\/distributions\/multivariate\/discrete\/categorical.hpp>\n\n#include <stan\/prob\/traits.hpp>\n#include <stan\/math\/error_handling.hpp>\n#include <stan\/math\/special_functions.hpp>\n#include <stan\/math\/functions\/log1m.hpp>\n#include <stan\/math\/functions\/log1p_exp.hpp>\n#include <stan\/math\/matrix_error_handling.hpp>\n#include <stan\/math\/error_handling.hpp>\n#include <stan\/prob\/constants.hpp>\n\n\nnamespace stan {\n\n  namespace prob {\n\n\n    template <typename T>\n    inline T log_inv_logit_diff(const T& alpha, const T& beta) {\n      using std::exp;\n      using stan::math::log1m;\n      using stan::math::log1p_exp;\n      return beta + log1m(exp(alpha - beta)) - log1p_exp(alpha) - log1p_exp(beta);\n    }\n \n    \/\/ y in 0,...,K-1;   c.size()==K-2,  c increasing,  lambda finite\n    \/**\n     * Returns the (natural) log probability of the specified integer\n     * outcome given the continuous location and specified cutpoints\n     * in an ordered logistic model.  \n     *\n     * <p>Typically the continous location\n     * will be the dot product of a vector of regression coefficients\n     * and a vector of predictors for the outcome.\n     *\n     * @tparam propto True if calculating up to a proportion.\n     * @tparam T_loc Location type.\n     * @tparam T_cut Cut-point type.\n     * @tparam Policy Error policy (only its type matters). \n\n     * @param y Outcome.\n     * @param lambda Location.\n     * @param c Positive increasing vector of cutpoints.\n     * @return Log probability of outcome given location and\n     * cutpoints.\n     \n     * @throw std::domain_error If the outcome is not between 1 and\n     * the number of cutpoints plus 2; if the cutpoint vector is\n     * empty; if the cutpoint vector contains a non-positive,\n     * non-finite value; or if the cutpoint vector is not sorted in\n     * ascending order.\n     *\/\n    template <bool propto,\n              typename T_lambda,\n              typename T_cut,\n              class Policy>\n    typename boost::math::tools::promote_args<T_lambda,T_cut>::type\n    ordered_logistic_log(int y,  \n                         const T_lambda& lambda,  \n                         const Eigen::Matrix<T_cut,Eigen::Dynamic,1>& c, \n                         const Policy&) {\n\n      using std::exp;\n      using std::log;\n      using stan::math::inv_logit;\n      using stan::math::log1m;\n      using stan::math::log1p_exp;\n\n      static const char* function = \"stan::prob::ordered_logistic(%1%)\";\n      \n      using stan::math::check_finite;\n      using stan::math::check_positive;\n      using stan::math::check_nonnegative;\n      using stan::math::check_less;\n      using stan::math::check_less_or_equal;\n      using stan::math::check_greater;\n      using stan::math::check_bounded;\n\n      int K = c.size() + 1;\n\n      typename boost::math::tools::promote_args<T_lambda,T_cut>::type lp(0.0);\n      if (!check_bounded(function, y, 1, K,\n                         \"Random variable\", \n                         &lp, Policy()))\n        return lp;\n\n      if (!check_finite(function, lambda, \n                        \"Location parameter\", &lp, Policy()))\n        return lp;\n\n      if (!check_greater(function, c.size(), 0,\n                         \"Size of cut points parameter\",\n                         &lp, Policy()))\n        return lp;\n\n\n      for (int i = 1; i < c.size(); ++i) {\n        if (!check_greater(function, c(i), c(i - 1),\n                           \"Cut points parameter\",\n                           &lp, Policy()))\n          return lp;\n      }\n\n      if (!check_finite(function, c(c.size()-1), \n                        \"Cut points parameter\",\n                        &lp, Policy()))\n        return lp;\n      \n      if (!check_finite(function, c(0),\n                        \"Cut points parameter\",\n                        &lp, Policy())) \n        return lp;\n\n      \/\/ log(1 - inv_logit(lambda))\n      if (y == 1)\n        return -log1p_exp(lambda - c(0)); \n\n      \/\/ log(inv_logit(lambda - c(K-3)));\n      if (y == K) {\n        return -log1p_exp(c(K-2) - lambda);\n      }\n\n      \/\/ if (2 < y < K) { ... }\n      \/\/ log(inv_logit(lambda - c(y-2)) - inv_logit(lambda - c(y-1)))\n      return log_inv_logit_diff(c(y-2) - lambda, \n                                c(y-1) - lambda);\n\n    }\n\n\n    template <bool propto,\n              typename T_lambda,\n              typename T_cut>\n    typename boost::math::tools::promote_args<T_lambda,T_cut>::type\n    ordered_logistic_log(int y,  \n                         const T_lambda& lambda,  \n                         const Eigen::Matrix<T_cut,Eigen::Dynamic,1>& c) {\n      return ordered_logistic_log<propto>(y,lambda,c,stan::math::default_policy());\n    }\n\n\n    template <typename T_lambda,\n              typename T_cut,\n              class Policy>\n    typename boost::math::tools::promote_args<T_lambda,T_cut>::type\n    ordered_logistic_log(int y,  \n                         const T_lambda& lambda,  \n                         const Eigen::Matrix<T_cut,Eigen::Dynamic,1>& c,\n                         const Policy&) {\n      return ordered_logistic_log<false>(y,lambda,c,Policy());\n    }\n\n\n    template <typename T_lambda,\n              typename T_cut>\n    typename boost::math::tools::promote_args<T_lambda,T_cut>::type\n    ordered_logistic_log(int y,  \n                         const T_lambda& lambda,  \n                         const Eigen::Matrix<T_cut,Eigen::Dynamic,1>& c) {\n      return ordered_logistic_log<false>(y,lambda,c,stan::math::default_policy());\n    }\n\n    template <class RNG>\n    inline int\n    ordered_logistic_rng(double eta,\n\t\t\t const Eigen::Matrix<double,Eigen::Dynamic,1>& c,\n\t\t\t RNG& rng) {\n      using boost::variate_generator;\n      using stan::math::inv_logit;\n      Eigen::VectorXd cut(c.rows());\n      cut(0) = 1 - inv_logit(eta - c(0));\n      for(int j = 1; j < c.rows() - 1; j++)\n\tcut(j) = inv_logit(eta - c(j - 1)) - inv_logit(eta - c(j));\n      cut(c.rows() - 1) = inv_logit(eta - c(c.rows() - 2));\n\n      return stan::prob::categorical_rng(cut, rng);\n    }\n  }\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/#define DEBUG \/\/ Allow debug\n\n#include <virtio\/class_virtio.hpp>\n#include <malloc.h>\n#include <string.h>\n#include <syscalls.hpp>\n#include <virtio\/virtio.h>\n#include <assert.h>\n\n\n\/** \n    Virtio Queue class, nested inside Virtio.\n *\/\n#define ALIGN(x) (((x) + PAGE_SIZE) & ~PAGE_SIZE) \nunsigned Virtio::Queue::virtq_size(unsigned int qsz) \n{ \n  return ALIGN(sizeof(virtq_desc)*qsz + sizeof(u16)*(3 + qsz)) \n    + ALIGN(sizeof(u16)*3 + sizeof(virtq_used_elem)*qsz); \n}\n\n\nvoid Virtio::Queue::init_queue(int size, void* buf){\n\n  \/\/ The buffer starts with is an array of queue descriptors\n  _queue.desc = (virtq_desc*)buf;\n  debug(\"\\t * Queue desc  @ 0x%lx \\n \",(long)_queue.desc);\n\n  \/\/ The available buffer starts right after the queue descriptors\n  _queue.avail = (virtq_avail*)((char*)buf + size*sizeof(virtq_desc));  \n  debug(\"\\t * Queue avail @ 0x%lx \\n \",(long)_queue.avail);\n\n  \/\/ The used queue starts at the beginning of the next page\n  \/\/ (This is  a formula from sanos - don't know why it works, but it does\n  \/\/ align the used queue to the next page border)  \n  _queue.used = (virtq_used*)(((uint32_t)&_queue.avail->ring[size] +\n                                sizeof(uint16_t)+PAGESIZE-1) & ~(PAGESIZE -1));\n  debug(\"\\t * Queue used  @ 0x%lx \\n \",(long)_queue.used);\n  \n}\n\n\n\n\/** A default handler doing nothing. \n    \n    It's here because we might not want to look at the data, e.g. for \n    the VirtioNet TX-queue which will get used buffers in. *\/\nint empty_handler(uint8_t* UNUSED(data),int UNUSED(size)) {\n  debug(\"<Virtio::Queue> Empty handler. DROP! \");\n  return -1;\n};\n\n\/** Constructor *\/\nVirtio::Queue::Queue(uint16_t size, uint16_t q_index, uint16_t iobase)\n  : _size(size),_size_bytes(virtq_size(size)),_iobase(iobase),_num_free(size),\n    _free_head(0), _num_added(0),_last_used_idx(0),_pci_index(q_index),\n    _data_handler(delegate<int(uint8_t*,int)>(empty_handler))\n{\n  \/\/Allocate space for the queue and clear it out\n  void* buffer = memalign(PAGE_SIZE,_size_bytes);\n  \/\/void* buffer = malloc(_size_bytes);\n  if (!buffer) panic(\"Could not allocate space for Virtio::Queue\");\n  memset(buffer,0,_size_bytes);    \n\n  debug(\">>> Virtio Queue of size %i (%li bytes) initializing \\n\",\n         _size,_size_bytes);  \n  init_queue(size,buffer);\n  \n  debug(\"\\t * Chaining buffers \\n\");  \n  \/\/ Chain buffers  \n  for (int i=0; i<size; i++) _queue.desc[i].next = i +1;\n  \/\/_queue.desc[size -1].next = 0;\n\n  \n  \/\/ Allocate space for actual data tokens\n  \/\/_data = (void**) malloc(sizeof(void*) * size);\n  \n  \n  debug(\" >> Virtio Queue setup complete. \\n\");\n}\n\n\n\/** Ported more or less directly from SanOS. *\/\nint Virtio::Queue::enqueue(scatterlist sg[], uint32_t out, uint32_t in, void* UNUSED(data)){\n  \n  int i,avail,head, prev = _free_head;\n  \n  \n  while (_num_free < out + in){ \/\/ Queue is full (we think)\n    \/\/while( num_avail() >= _size) \/\/ Wait for Virtio\n        printf(\"<Q %i>Buffer full (%i avail,\"\\\n               \" used.idx: %i, avail.idx: %i )\\n\",\n               _pci_index,num_avail(),\n               _queue.used->idx,_queue.avail->idx\n               );\n        panic(\"Buffer full\");\n  }\n\n  \/\/ Remove buffers from the free list  \n  _num_free -= out + in;\n  head = _free_head;\n  \n  \n  \/\/ (implicitly) Mark all outbound tokens as device-readable\n  for (i = _free_head; out; i = _queue.desc[i].next, out--) \n    {\n      _queue.desc[i].flags = VRING_DESC_F_NEXT;\n      _queue.desc[i].addr = (uint64_t)sg->data;\n      _queue.desc[i].len = sg->size;\n\n      debug(\"<Q %i> Enqueueing outbound: index %i len %li, next %i\\n\",\n            _pci_index,i,_queue.desc[i].len,_queue.desc[i].next);\n\n      prev = i;\n      sg++;\n    }\n  \n  \/\/ Mark all inbound tokens as device-writable\n  for (; in; i = _queue.desc[i].next, in--) \n    {\n      \/\/debug(\"<Q> Enqueuing inbound \\n\");\n      _queue.desc[i].flags = VRING_DESC_F_NEXT | VRING_DESC_F_WRITE;\n      _queue.desc[i].addr = (uint64_t)sg->data;\n      _queue.desc[i].len = sg->size;\n      prev = i;\n      sg++;\n    }\n  \n  \/\/ No continue on last buffer\n  _queue.desc[prev].flags &= ~VRING_DESC_F_NEXT;\n  \n  \n  \/\/ Update free pointer\n  _free_head = i;\n\n  \/\/ Set callback token\n  \/\/vq->data[head] = data;\n\n  \/\/ SanOS: Put entry in available array, but do not update avail->idx until sync\n  avail = (_queue.avail->idx + _num_added++) % _size;\n  _queue.avail->ring[avail] = head;\n  \n  \n  \/\/ Notify about free buffers\n  \/\/if (_num_free > 0) set_event(&vq->bufavail);\n    \n  return _num_free;  \n}\n\nvoid Virtio::Queue::release(uint32_t head){\n  \n  \/\/ Clear callback data token\n  \/\/vq->data[head] = NULL;\n\n  \/\/ Mark queue element \"head\" as free (the whole token chain)\n  uint32_t i = head;\n  \n  \/\/It's at least one token...\n  _num_free++;\n\n  \/\/...possibly with a tail\n  while (_queue.desc[i].flags & VRING_DESC_F_NEXT) \n  {\n    i = _queue.desc[i].next;\n    _num_free++;\n  }\n  \n  \/\/ Add buffers back to free list\n  _queue.desc[i].next = _free_head;\n  _free_head = head;\n\n  \/\/ SanOS: Notify about free buffers\n  \/\/ Now this thread can wake up threads waiting to enqueue...\n  \/\/ But IncludeOS doesn't have threads, so we have to defer transmissions\n  \/\/ if (_num_free > 0) set_event(&vq->bufavail);\n}\n\nuint8_t* Virtio::Queue::dequeue(uint32_t* len){\n\n  \/\/ Return NULL if there are no more completed buffers in the queue\n  if (_last_used_idx == _queue.used->idx){\n    debug(\"<Q %i> Can't dequeue - no used buffers \\n\",_pci_index);\n    return NULL;\n  }\n\n  \/\/ Get next completed buffer\n  auto* e = &_queue.used->ring[_last_used_idx % _size];\n  *len = e->len;\n\n  debug(\"<Q %i> Releasing token %li. Len: %li\\n\",_pci_index,e->id, e->len);\n  uint8_t* data = (uint8_t*)_queue.desc[e->id].addr;\n  \n  \/\/ Release buffer\n  release(e->id);\n  _last_used_idx++;\n\n  return data;\n}\n\n\/\/TEMP. REMOVE - This belongs to VirtioNet.\nstruct virtio_net_hdr\n  {\n    uint8_t flags;\n    uint8_t gso_type;\n    uint16_t hdr_len;          \/\/ Ethernet + IP + TCP\/UDP headers\n    uint16_t gso_size;         \/\/ Bytes to append to hdr_len per frame\n    uint16_t csum_start;       \/\/ Position to start checksumming from\n    uint16_t csum_offset;      \/\/ Offset after that to place checksum\n    uint16_t num_buffers;      \/\/ ONLY if \"Merge RX-buffers\"\n  };\n\n\n\nvoid Virtio::Queue::notify(){\n  debug(\"\\t <Q %i> Notified, checking buffers.... \\n\",_pci_index);\n  debug(\"\\t             Used idx: %i, Avail idx: %i \\n\",\n        _queue.used->idx, _queue.avail->idx );\n  \n  int new_packets = _queue.used->idx - _last_used_idx;\n  \n  if (new_packets && _queue.used->idx >= _queue.avail->idx)\n    printf(\"<Q %i> !!! BUFER FULL !!!  \\n\",_pci_index);\n\n\n  \n  debug(\"\\t <VirtQueue> %i new packets: \\n\", new_packets);\n    \n  \/\/ For each token, extract data. We're merging RX-buffers, so no chaining \n  for (;_last_used_idx != _queue.used->idx; _last_used_idx++){\n    auto id = _queue.used->ring[_last_used_idx % _size].id;\n    auto len = _queue.used->ring[_last_used_idx % _size].len;\n    debug(\"\\tHandling packet id: 0x%lx len: %li last used: %i Q used idx: %i\\n\",\n          id,len,_last_used_idx, _queue.used->idx);        \n\n    auto tok_addr = _queue.desc[id].addr;    \n    uint8_t* data = (uint8_t*)tok_addr + sizeof(virtio_net_hdr); \n    \n    \/\/ Push data to a handler\n    _data_handler(data, len);\n    \n  }\n  \n}\n\n\nvoid Virtio::Queue::set_data_handler(delegate<int(uint8_t* data,int len)> del){\n  _data_handler=del;\n};\n\n\nvoid Virtio::Queue::kick(){\n  \/\/__sync_synchronize ();\n\n  __sync_add_and_fetch(_queue.avail->idx,_num_added);\/\/ += _num_added;\n  \/\/_queue.avail->idx += _num_added;\n  \/\/__sync_synchronize ();\n\n  _num_added = 0;\n \n\n  if (!(_queue.used->flags & VRING_USED_F_NO_NOTIFY)){\n    debug(\"<Queue %i> Kicking virtio. Iobase 0x%x \\n\",\n          _pci_index, _iobase);\n    \/\/outpw(_iobase + VIRTIO_PCI_QUEUE_SEL, _pci_index);\n    outpw(_iobase + VIRTIO_PCI_QUEUE_NOTIFY , _pci_index);\n  }else{\n    debug(\"<VirtioQueue>Virtio device says we can't kick!\");\n  }\n}\n<commit_msg>Fixed wrong args to add_and_fetch. Probably #102 wasn't fixed by this, but now it seems to be gone. Scary.<commit_after>\/\/#define DEBUG \/\/ Allow debug\n\n#include <virtio\/class_virtio.hpp>\n#include <malloc.h>\n#include <string.h>\n#include <syscalls.hpp>\n#include <virtio\/virtio.h>\n#include <assert.h>\n\n\n\/** \n    Virtio Queue class, nested inside Virtio.\n *\/\n#define ALIGN(x) (((x) + PAGE_SIZE) & ~PAGE_SIZE) \nunsigned Virtio::Queue::virtq_size(unsigned int qsz) \n{ \n  return ALIGN(sizeof(virtq_desc)*qsz + sizeof(u16)*(3 + qsz)) \n    + ALIGN(sizeof(u16)*3 + sizeof(virtq_used_elem)*qsz); \n}\n\n\nvoid Virtio::Queue::init_queue(int size, void* buf){\n\n  \/\/ The buffer starts with is an array of queue descriptors\n  _queue.desc = (virtq_desc*)buf;\n  debug(\"\\t * Queue desc  @ 0x%lx \\n \",(long)_queue.desc);\n\n  \/\/ The available buffer starts right after the queue descriptors\n  _queue.avail = (virtq_avail*)((char*)buf + size*sizeof(virtq_desc));  \n  debug(\"\\t * Queue avail @ 0x%lx \\n \",(long)_queue.avail);\n\n  \/\/ The used queue starts at the beginning of the next page\n  \/\/ (This is  a formula from sanos - don't know why it works, but it does\n  \/\/ align the used queue to the next page border)  \n  _queue.used = (virtq_used*)(((uint32_t)&_queue.avail->ring[size] +\n                                sizeof(uint16_t)+PAGESIZE-1) & ~(PAGESIZE -1));\n  debug(\"\\t * Queue used  @ 0x%lx \\n \",(long)_queue.used);\n  \n}\n\n\n\n\/** A default handler doing nothing. \n    \n    It's here because we might not want to look at the data, e.g. for \n    the VirtioNet TX-queue which will get used buffers in. *\/\nint empty_handler(uint8_t* UNUSED(data),int UNUSED(size)) {\n  debug(\"<Virtio::Queue> Empty handler. DROP! \");\n  return -1;\n};\n\n\/** Constructor *\/\nVirtio::Queue::Queue(uint16_t size, uint16_t q_index, uint16_t iobase)\n  : _size(size),_size_bytes(virtq_size(size)),_iobase(iobase),_num_free(size),\n    _free_head(0), _num_added(0),_last_used_idx(0),_pci_index(q_index),\n    _data_handler(delegate<int(uint8_t*,int)>(empty_handler))\n{\n  \/\/Allocate space for the queue and clear it out\n  void* buffer = memalign(PAGE_SIZE,_size_bytes);\n  \/\/void* buffer = malloc(_size_bytes);\n  if (!buffer) panic(\"Could not allocate space for Virtio::Queue\");\n  memset(buffer,0,_size_bytes);    \n\n  debug(\">>> Virtio Queue of size %i (%li bytes) initializing \\n\",\n         _size,_size_bytes);  \n  init_queue(size,buffer);\n  \n  debug(\"\\t * Chaining buffers \\n\");  \n  \/\/ Chain buffers  \n  for (int i=0; i<size; i++) _queue.desc[i].next = i +1;\n  \/\/_queue.desc[size -1].next = 0;\n\n  \n  \/\/ Allocate space for actual data tokens\n  \/\/_data = (void**) malloc(sizeof(void*) * size);\n  \n  \n  debug(\" >> Virtio Queue setup complete. \\n\");\n}\n\n\n\/** Ported more or less directly from SanOS. *\/\nint Virtio::Queue::enqueue(scatterlist sg[], uint32_t out, uint32_t in, void* UNUSED(data)){\n  \n  int i,avail,head, prev = _free_head;\n  \n  \n  while (_num_free < out + in){ \/\/ Queue is full (we think)\n    \/\/while( num_avail() >= _size) \/\/ Wait for Virtio\n        printf(\"<Q %i>Buffer full (%i avail,\"\\\n               \" used.idx: %i, avail.idx: %i )\\n\",\n               _pci_index,num_avail(),\n               _queue.used->idx,_queue.avail->idx\n               );\n        panic(\"Buffer full\");\n  }\n\n  \/\/ Remove buffers from the free list  \n  _num_free -= out + in;\n  head = _free_head;\n  \n  \n  \/\/ (implicitly) Mark all outbound tokens as device-readable\n  for (i = _free_head; out; i = _queue.desc[i].next, out--) \n    {\n      _queue.desc[i].flags = VRING_DESC_F_NEXT;\n      _queue.desc[i].addr = (uint64_t)sg->data;\n      _queue.desc[i].len = sg->size;\n\n      debug(\"<Q %i> Enqueueing outbound: index %i len %li, next %i\\n\",\n            _pci_index,i,_queue.desc[i].len,_queue.desc[i].next);\n\n      prev = i;\n      sg++;\n    }\n  \n  \/\/ Mark all inbound tokens as device-writable\n  for (; in; i = _queue.desc[i].next, in--) \n    {\n      \/\/debug(\"<Q> Enqueuing inbound \\n\");\n      _queue.desc[i].flags = VRING_DESC_F_NEXT | VRING_DESC_F_WRITE;\n      _queue.desc[i].addr = (uint64_t)sg->data;\n      _queue.desc[i].len = sg->size;\n      prev = i;\n      sg++;\n    }\n  \n  \/\/ No continue on last buffer\n  _queue.desc[prev].flags &= ~VRING_DESC_F_NEXT;\n  \n  \n  \/\/ Update free pointer\n  _free_head = i;\n\n  \/\/ Set callback token\n  \/\/vq->data[head] = data;\n\n  \/\/ SanOS: Put entry in available array, but do not update avail->idx until sync\n  avail = (_queue.avail->idx + _num_added++) % _size;\n  _queue.avail->ring[avail] = head;\n  \n  \n  \/\/ Notify about free buffers\n  \/\/if (_num_free > 0) set_event(&vq->bufavail);\n    \n  return _num_free;  \n}\n\nvoid Virtio::Queue::release(uint32_t head){\n  \n  \/\/ Clear callback data token\n  \/\/vq->data[head] = NULL;\n\n  \/\/ Mark queue element \"head\" as free (the whole token chain)\n  uint32_t i = head;\n  \n  \/\/It's at least one token...\n  _num_free++;\n\n  \/\/...possibly with a tail\n  while (_queue.desc[i].flags & VRING_DESC_F_NEXT) \n  {\n    i = _queue.desc[i].next;\n    _num_free++;\n  }\n  \n  \/\/ Add buffers back to free list\n  _queue.desc[i].next = _free_head;\n  _free_head = head;\n\n  \/\/ SanOS: Notify about free buffers\n  \/\/ Now this thread can wake up threads waiting to enqueue...\n  \/\/ But IncludeOS doesn't have threads, so we have to defer transmissions\n  \/\/ if (_num_free > 0) set_event(&vq->bufavail);\n}\n\nuint8_t* Virtio::Queue::dequeue(uint32_t* len){\n\n  \/\/ Return NULL if there are no more completed buffers in the queue\n  if (_last_used_idx == _queue.used->idx){\n    debug(\"<Q %i> Can't dequeue - no used buffers \\n\",_pci_index);\n    return NULL;\n  }\n\n  \/\/ Get next completed buffer\n  auto* e = &_queue.used->ring[_last_used_idx % _size];\n  *len = e->len;\n\n  debug(\"<Q %i> Releasing token %li. Len: %li\\n\",_pci_index,e->id, e->len);\n  uint8_t* data = (uint8_t*)_queue.desc[e->id].addr;\n  \n  \/\/ Release buffer\n  release(e->id);\n  _last_used_idx++;\n\n  return data;\n}\n\n\/\/TEMP. REMOVE - This belongs to VirtioNet.\nstruct virtio_net_hdr\n  {\n    uint8_t flags;\n    uint8_t gso_type;\n    uint16_t hdr_len;          \/\/ Ethernet + IP + TCP\/UDP headers\n    uint16_t gso_size;         \/\/ Bytes to append to hdr_len per frame\n    uint16_t csum_start;       \/\/ Position to start checksumming from\n    uint16_t csum_offset;      \/\/ Offset after that to place checksum\n    uint16_t num_buffers;      \/\/ ONLY if \"Merge RX-buffers\"\n  };\n\n\n\nvoid Virtio::Queue::notify(){\n  debug(\"\\t <Q %i> Notified, checking buffers.... \\n\",_pci_index);\n  debug(\"\\t             Used idx: %i, Avail idx: %i \\n\",\n        _queue.used->idx, _queue.avail->idx );\n  \n  int new_packets = _queue.used->idx - _last_used_idx;\n  \n  if (new_packets && _queue.used->idx >= _queue.avail->idx)\n    printf(\"<Q %i> !!! BUFER FULL !!!  \\n\",_pci_index);\n\n\n  \n  debug(\"\\t <VirtQueue> %i new packets: \\n\", new_packets);\n    \n  \/\/ For each token, extract data. We're merging RX-buffers, so no chaining \n  for (;_last_used_idx != _queue.used->idx; _last_used_idx++){\n    auto id = _queue.used->ring[_last_used_idx % _size].id;\n    auto len = _queue.used->ring[_last_used_idx % _size].len;\n    debug(\"\\tHandling packet id: 0x%lx len: %li last used: %i Q used idx: %i\\n\",\n          id,len,_last_used_idx, _queue.used->idx);        \n\n    auto tok_addr = _queue.desc[id].addr;    \n    uint8_t* data = (uint8_t*)tok_addr + sizeof(virtio_net_hdr); \n    \n    \/\/ Push data to a handler\n    _data_handler(data, len);\n    \n  }\n  \n}\n\n\nvoid Virtio::Queue::set_data_handler(delegate<int(uint8_t* data,int len)> del){\n  _data_handler=del;\n};\n\n\nvoid Virtio::Queue::kick(){\n  \/\/__sync_synchronize ();\n\n  \/\/ Atomically increment (maybe not necessary?)\n  __sync_add_and_fetch(&(_queue.avail->idx),_num_added);\n  \/\/_queue.avail->idx += _num_added;\n  \/\/__sync_synchronize ();\n\n  _num_added = 0;\n \n\n  if (!(_queue.used->flags & VRING_USED_F_NO_NOTIFY)){\n    debug(\"<Queue %i> Kicking virtio. Iobase 0x%x \\n\",\n          _pci_index, _iobase);\n    \/\/outpw(_iobase + VIRTIO_PCI_QUEUE_SEL, _pci_index);\n    outpw(_iobase + VIRTIO_PCI_QUEUE_NOTIFY , _pci_index);\n  }else{\n    debug(\"<VirtioQueue>Virtio device says we can't kick!\");\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 \"CommonDevice.h\"\n#include \"medialibrary\/filesystem\/Errors.h\"\n#include \"utils\/Filename.h\"\n\n#include <algorithm>\n#include <cassert>\n#include <cstring>\n\nnamespace medialibrary\n{\nnamespace fs\n{\n\nCommonDevice::CommonDevice( const std::string& uuid, const std::string& mountpoint,\n                            std::string scheme, bool isRemovable, bool isNetwork )\n    : m_uuid( uuid )\n    , m_mountpoints( { Mountpoint{ utils::file::toFolderPath( mountpoint ) } } )\n    , m_scheme( std::move( scheme ) )\n    , m_removable( isRemovable )\n    , m_isNetwork( isNetwork )\n{\n}\n\nconst std::string& CommonDevice::uuid() const\n{\n    return m_uuid;\n}\n\nconst std::string& CommonDevice::scheme() const\n{\n    return m_scheme;\n}\n\nbool CommonDevice::isRemovable() const\n{\n    return m_removable;\n}\n\nbool CommonDevice::isPresent() const\n{\n    std::unique_lock<compat::Mutex> lock{ m_mutex };\n    return m_mountpoints.empty() == false;\n}\n\nbool CommonDevice::isNetwork() const\n{\n    return m_isNetwork;\n}\n\nstd::vector<std::string> CommonDevice::mountpoints() const\n{\n    std::unique_lock<compat::Mutex> lock{ m_mutex };\n    if ( m_mountpoints.empty() == true )\n        throw fs::errors::DeviceRemoved();\n    std::vector<std::string> res;\n    res.reserve( m_mountpoints.size() );\n    std::transform( cbegin( m_mountpoints ), cend( m_mountpoints ),\n                    std::back_inserter( res ), []( const Mountpoint& m ) {\n        return m.mrl;\n    });\n    return res;\n}\n\nvoid CommonDevice::addMountpoint( std::string mp )\n{\n    Mountpoint mountpoint( utils::file::toFolderPath( mp ) );\n    std::unique_lock<compat::Mutex> lock{ m_mutex };\n    if ( std::find( cbegin( m_mountpoints ), cend( m_mountpoints ),\n                    mountpoint ) != cend( m_mountpoints ) )\n        return;\n    m_mountpoints.emplace_back( std::move( mountpoint ) );\n}\n\nvoid CommonDevice::removeMountpoint( const std::string& mp )\n{\n    Mountpoint mountpoint( utils::file::toFolderPath( mp ) );\n    std::unique_lock<compat::Mutex> lock{ m_mutex };\n    auto it = std::find( begin( m_mountpoints ), end( m_mountpoints ), mountpoint );\n    if ( it != end( m_mountpoints ) )\n        m_mountpoints.erase( it );\n}\n\nstd::tuple<bool, std::string>\nCommonDevice::matchesMountpoint( const std::string& mrl ) const\n{\n    std::unique_lock<compat::Mutex> lock{ m_mutex };\n    return matchesMountpointLocked( mrl );\n}\n\nstd::tuple<bool, std::string> CommonDevice::matchesMountpointLocked( const std::string& mrl ) const\n{\n    Mountpoint mountpoint( utils::file::toFolderPath( mrl ) );\n    auto it = std::find( cbegin( m_mountpoints ), cend( m_mountpoints ), mountpoint );\n    if ( it == cend( m_mountpoints ) )\n        return std::make_tuple( false, \"\" );\n    return std::make_tuple( true, (*it).mrl );\n}\n\n\nstd::string CommonDevice::relativeMrl( const std::string& absoluteMrl ) const\n{\n    std::tuple<bool, std::string> res;\n    {\n        std::unique_lock<compat::Mutex> lock{ m_mutex };\n        if ( m_mountpoints.empty() == true )\n            throw fs::errors::DeviceRemoved{};\n        res = matchesMountpointLocked( absoluteMrl );\n        if ( std::get<0>( res ) == false )\n            throw errors::NotFound{ absoluteMrl, \"device \" + m_mountpoints[0].mrl };\n    }\n    return utils::file::removePath( absoluteMrl, std::get<1>( res ) );\n}\n\nstd::string CommonDevice::absoluteMrl( const std::string& relativeMrl ) const\n{\n    std::unique_lock<compat::Mutex> lock{ m_mutex };\n    if ( m_mountpoints.empty() == true )\n        throw fs::errors::DeviceRemoved{};\n    return m_mountpoints[0].mrl + relativeMrl;\n}\n\nbool CommonDevice::Mountpoint::operator==( const Mountpoint& lhs ) const\n{\n    if ( strcasecmp( url.scheme.c_str(), lhs.url.scheme.c_str() ) != 0 )\n        return false;\n    if ( strcasecmp( url.host.c_str(), lhs.url.host.c_str() ) != 0 )\n        return false;\n    if ( url.port != lhs.url.port )\n    {\n        if ( strcasecmp( lhs.url.scheme.c_str(), \"smb\" ) == 0 )\n        {\n            if ( ! ( url.port.empty() == true && lhs.url.port == \"445\" ) &&\n                 ! ( lhs.url.port.empty() == true && url.port == \"445\" ) )\n                return false;\n        }\n        else\n            return false;\n    }\n    return strncasecmp( lhs.url.path.c_str(), url.path.c_str(), url.path.length() ) == 0;\n}\n\n}\n}\n<commit_msg>CommonDevice: Fix relative MRL generation<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 \"CommonDevice.h\"\n#include \"medialibrary\/filesystem\/Errors.h\"\n#include \"utils\/Filename.h\"\n\n#include <algorithm>\n#include <cassert>\n#include <cstring>\n\nnamespace medialibrary\n{\nnamespace fs\n{\n\nCommonDevice::CommonDevice( const std::string& uuid, const std::string& mountpoint,\n                            std::string scheme, bool isRemovable, bool isNetwork )\n    : m_uuid( uuid )\n    , m_mountpoints( { Mountpoint{ utils::file::toFolderPath( mountpoint ) } } )\n    , m_scheme( std::move( scheme ) )\n    , m_removable( isRemovable )\n    , m_isNetwork( isNetwork )\n{\n}\n\nconst std::string& CommonDevice::uuid() const\n{\n    return m_uuid;\n}\n\nconst std::string& CommonDevice::scheme() const\n{\n    return m_scheme;\n}\n\nbool CommonDevice::isRemovable() const\n{\n    return m_removable;\n}\n\nbool CommonDevice::isPresent() const\n{\n    std::unique_lock<compat::Mutex> lock{ m_mutex };\n    return m_mountpoints.empty() == false;\n}\n\nbool CommonDevice::isNetwork() const\n{\n    return m_isNetwork;\n}\n\nstd::vector<std::string> CommonDevice::mountpoints() const\n{\n    std::unique_lock<compat::Mutex> lock{ m_mutex };\n    if ( m_mountpoints.empty() == true )\n        throw fs::errors::DeviceRemoved();\n    std::vector<std::string> res;\n    res.reserve( m_mountpoints.size() );\n    std::transform( cbegin( m_mountpoints ), cend( m_mountpoints ),\n                    std::back_inserter( res ), []( const Mountpoint& m ) {\n        return m.mrl;\n    });\n    return res;\n}\n\nvoid CommonDevice::addMountpoint( std::string mp )\n{\n    Mountpoint mountpoint( utils::file::toFolderPath( mp ) );\n    std::unique_lock<compat::Mutex> lock{ m_mutex };\n    if ( std::find( cbegin( m_mountpoints ), cend( m_mountpoints ),\n                    mountpoint ) != cend( m_mountpoints ) )\n        return;\n    m_mountpoints.emplace_back( std::move( mountpoint ) );\n}\n\nvoid CommonDevice::removeMountpoint( const std::string& mp )\n{\n    Mountpoint mountpoint( utils::file::toFolderPath( mp ) );\n    std::unique_lock<compat::Mutex> lock{ m_mutex };\n    auto it = std::find( begin( m_mountpoints ), end( m_mountpoints ), mountpoint );\n    if ( it != end( m_mountpoints ) )\n        m_mountpoints.erase( it );\n}\n\nstd::tuple<bool, std::string>\nCommonDevice::matchesMountpoint( const std::string& mrl ) const\n{\n    std::unique_lock<compat::Mutex> lock{ m_mutex };\n    return matchesMountpointLocked( mrl );\n}\n\nstd::tuple<bool, std::string> CommonDevice::matchesMountpointLocked( const std::string& mrl ) const\n{\n    Mountpoint mountpoint( utils::file::toFolderPath( mrl ) );\n    auto it = std::find( cbegin( m_mountpoints ), cend( m_mountpoints ), mountpoint );\n    if ( it == cend( m_mountpoints ) )\n        return std::make_tuple( false, \"\" );\n    return std::make_tuple( true, (*it).mrl );\n}\n\n\nstd::string CommonDevice::relativeMrl( const std::string& absoluteMrl ) const\n{\n    std::tuple<bool, std::string> res;\n    {\n        std::unique_lock<compat::Mutex> lock{ m_mutex };\n        if ( m_mountpoints.empty() == true )\n            throw fs::errors::DeviceRemoved{};\n        res = matchesMountpointLocked( absoluteMrl );\n        if ( std::get<0>( res ) == false )\n            throw errors::NotFound{ absoluteMrl, \"device \" + m_mountpoints[0].mrl };\n    }\n    return absoluteMrl.substr( std::get<1>( res ).length() );\n}\n\nstd::string CommonDevice::absoluteMrl( const std::string& relativeMrl ) const\n{\n    std::unique_lock<compat::Mutex> lock{ m_mutex };\n    if ( m_mountpoints.empty() == true )\n        throw fs::errors::DeviceRemoved{};\n    return m_mountpoints[0].mrl + relativeMrl;\n}\n\nbool CommonDevice::Mountpoint::operator==( const Mountpoint& lhs ) const\n{\n    if ( strcasecmp( url.scheme.c_str(), lhs.url.scheme.c_str() ) != 0 )\n        return false;\n    if ( strcasecmp( url.host.c_str(), lhs.url.host.c_str() ) != 0 )\n        return false;\n    if ( url.port != lhs.url.port )\n    {\n        if ( strcasecmp( lhs.url.scheme.c_str(), \"smb\" ) == 0 )\n        {\n            if ( ! ( url.port.empty() == true && lhs.url.port == \"445\" ) &&\n                 ! ( lhs.url.port.empty() == true && url.port == \"445\" ) )\n                return false;\n        }\n        else\n            return false;\n    }\n    return strncasecmp( lhs.url.path.c_str(), url.path.c_str(), url.path.length() ) == 0;\n}\n\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* BEGIN_COMMON_COPYRIGHT_HEADER\n * (c)LGPL2+\n *\n * Razor - a lightweight, Qt based, desktop toolset\n * http:\/\/razor-qt.org\n *\n * Copyright: 2012 Razor team\n * Authors:\n *   Aaron Lewis <the.warl0ck.1989@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#include \"globalaccel.h\"\n\nCommandShortcut::CommandShortcut (const QString & cmd, QObject *parent):\n    AbstractShortcut (parent),\n    m_cmd (cmd)\n{\n}\n\nbool CommandShortcut::exec()\n{\n    return QProcess::startDetached (m_cmd);\n}\n\n\/\/\/\/\nDBusShortcut::DBusShortcut (const QString & dest, \n                            const QString & path,\n                            const QString & interface,\n                            const QString & method,\n                            const QList<QVariant> & parameters,\n                            QObject *parent) :\n    AbstractShortcut (parent),\n    m_dest (dest),\n    m_path (path),\n    m_interface (interface),\n    m_method (method),\n    m_params (parameters)\n\n{\n}\n\nbool DBusShortcut::exec()\n{\n    QDBusMessage message = QDBusMessage::createMethodCall( \n            m_dest, \n            m_path,\n            m_interface,\n            m_method\n            );\n    message.setArguments (m_params);\n\n    return QDBusConnection::sessionBus().send (message);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nGlobalAccel::GlobalAccel(QObject *parent):\n    QObject (parent),\n    m_shortcutSettings (new RazorSettings(\"globalkeyshortcuts\", this))\n{\n    \/\/ read settings\n    bindDefault ();\n\n    \/\/ monitor changes\n    connect(m_shortcutSettings , SIGNAL(settingsChanged())  , SLOT(rebindAll()));\n}\n\nGlobalAccel::~GlobalAccel()\n{\n\n}\n\nvoid GlobalAccel::bindDefault()\n{\n    \/\/ clear existing\n    mapping.clear();\n\n    foreach(const QString & group , m_shortcutSettings->childGroups())\n    {\n        m_shortcutSettings->beginGroup(group);\n\n        const QString & cmd = m_shortcutSettings->value(\"Exec\").toString();\n        bool enabled = m_shortcutSettings->value(\"Enabled\").toBool();\n\n        \/\/ bind shortcut only when it's enabled by user\n        if (enabled && ! cmd.isEmpty())\n        {\n            mapping.insert(QKeySequence(group), new CommandShortcut (cmd));\n\n            \/\/ create shortcut\n            QxtGlobalShortcut *sc = new QxtGlobalShortcut(this);\n            sc->setShortcut(QKeySequence (group));\n            connect(sc , SIGNAL(activated()) , SLOT(launchApp()));\n        }\n\n        m_shortcutSettings->endGroup();\n    }\n\n}\n\nvoid GlobalAccel::rebindAll()\n{\n    qDebug() << \"Reloading settings..\";\n    bindDefault();\n}\n\nvoid GlobalAccel::launchApp()\n{\n    QxtGlobalShortcut *sc = qobject_cast<QxtGlobalShortcut *>(sender());\n    mapping.value ( sc->shortcut() )->exec();\n}\n<commit_msg>complete setting parsing part for dbus call<commit_after>\/* BEGIN_COMMON_COPYRIGHT_HEADER\n * (c)LGPL2+\n *\n * Razor - a lightweight, Qt based, desktop toolset\n * http:\/\/razor-qt.org\n *\n * Copyright: 2012 Razor team\n * Authors:\n *   Aaron Lewis <the.warl0ck.1989@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#include \"globalaccel.h\"\n\nCommandShortcut::CommandShortcut (const QString & cmd, QObject *parent):\n    AbstractShortcut (parent),\n    m_cmd (cmd)\n{\n}\n\nbool CommandShortcut::exec()\n{\n    return QProcess::startDetached (m_cmd);\n}\n\n\/\/\/\/\nDBusShortcut::DBusShortcut (const QString & dest, \n                            const QString & path,\n                            const QString & interface,\n                            const QString & method,\n                            const QList<QVariant> & parameters,\n                            QObject *parent) :\n    AbstractShortcut (parent),\n    m_dest (dest),\n    m_path (path),\n    m_interface (interface),\n    m_method (method),\n    m_params (parameters)\n\n{\n}\n\nbool DBusShortcut::exec()\n{\n    QDBusMessage message = QDBusMessage::createMethodCall( \n            m_dest, \n            m_path,\n            m_interface,\n            m_method\n            );\n    message.setArguments (m_params);\n\n    return QDBusConnection::sessionBus().send (message);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nGlobalAccel::GlobalAccel(QObject *parent):\n    QObject (parent),\n    m_shortcutSettings (new RazorSettings(\"globalkeyshortcuts\", this))\n{\n    \/\/ read settings\n    bindDefault ();\n\n    \/\/ monitor changes\n    connect(m_shortcutSettings , SIGNAL(settingsChanged())  , SLOT(rebindAll()));\n}\n\nGlobalAccel::~GlobalAccel()\n{\n\n}\n\nvoid GlobalAccel::bindDefault()\n{\n    \/\/ clear existing\n    mapping.clear();\n\n#define GET_VALUE_BOOL(a) m_shortcutSettings->value(a).toBool()\n#define GET_VALUE_STRING(a) m_shortcutSettings->value(a).toString()\n#define GET_VALUE_LIST(a) m_shortcutSettings->value(a).toList()\n\n    foreach(const QString & group , m_shortcutSettings->childGroups())\n    {\n        m_shortcutSettings->beginGroup(group);\n\n\t\t\/\/ shortcut is not enabled\n        if ( ! GET_VALUE_BOOL(\"Enabled\") )\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tconst QString & type = GET_VALUE_STRING(\"Type\");\n\t\t\/\/ if shortcut is dbus call\n\t\tif ( type.toLower() == \"dbus\" )\n\t\t{\n\t\t\tmapping.insert(QKeySequence(group), new DBusShortcut (\n\t\t\t\t\t\tGET_VALUE_STRING(\"Destination\"),\n\t\t\t\t\t\tGET_VALUE_STRING(\"Path\"),\n\t\t\t\t\t\tGET_VALUE_STRING(\"Interface\"),\n\t\t\t\t\t\tGET_VALUE_STRING(\"Method\"),\n\t\t\t\t\t\tGET_VALUE_LIST(\"Parameter\")\n\t\t\t\t\t\t));\n\n\t\t\tQxtGlobalShortcut *sc = new QxtGlobalShortcut(this);\n\t\t\tsc->setShortcut(QKeySequence (group));\n\t\t\tconnect(sc , SIGNAL(activated()) , SLOT(launchApp()));\n\t\t}\n\t\t\/\/ otherwise it \"should\" be a command execution for now\n\t\telse\n\t\t{\n\t\t\tconst QString & cmd = GET_VALUE_STRING(\"Exec\");\n\t\t\t\/\/ command is not empty\n\t\t\tif ( ! cmd.isEmpty() )\n\t\t\t{\n\t\t\t\tmapping.insert(QKeySequence(group), new CommandShortcut (cmd));\n\n\t\t\t\t\/\/ create shortcut binding\n\t\t\t\tQxtGlobalShortcut *sc = new QxtGlobalShortcut(this);\n\t\t\t\tsc->setShortcut(QKeySequence (group));\n\t\t\t\tconnect(sc , SIGNAL(activated()) , SLOT(launchApp()));\n\t\t\t}\n\t\t}\n\n        m_shortcutSettings->endGroup();\n    }\n\n}\n\nvoid GlobalAccel::rebindAll()\n{\n    qDebug() << \"Reloading settings..\";\n    bindDefault();\n}\n\nvoid GlobalAccel::launchApp()\n{\n    QxtGlobalShortcut *sc = qobject_cast<QxtGlobalShortcut *>(sender());\n    mapping.value ( sc->shortcut() )->exec();\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\/\/ ---------------------------------------------------------------------------\n\/\/  Includes\n\/\/ ---------------------------------------------------------------------------\n#include <util\/BinFileInputStream.hpp>\n#include <util\/PlatformUtils.hpp>\n#include <framework\/LocalFileInputSource.hpp>\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  LocalFileInputSource: Constructors and Destructor\n\/\/ ---------------------------------------------------------------------------\nLocalFileInputSource::LocalFileInputSource( const   XMLCh* const basePath\n                                            , const XMLCh* const relativePath)\n{\n    \/\/\n    \/\/  Weave the two paths together in order to base the relative one\n    \/\/  off of the base one. Assume that the base path is a full path to\n    \/\/  a real file, so we throw off the name right off the bat.\n    \/\/\n    XMLCh* tmpBuf = XMLPlatformUtils::weavePaths(basePath, relativePath);\n    setSystemId(tmpBuf);\n    delete [] tmpBuf;\n}\n\nLocalFileInputSource::LocalFileInputSource(const XMLCh* const filePath)\n{\n    \/\/ Complete the path before storing it\n    if (XMLPlatformUtils::isRelative(filePath))\n    {\n        XMLCh* tmpBuf = XMLPlatformUtils::getFullPath(filePath);\n        setSystemId(tmpBuf);\n        delete [] tmpBuf;\n    }\n     else\n    {\n        setSystemId(filePath);\n    }\n}\n\nLocalFileInputSource::~LocalFileInputSource()\n{\n}\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  LocalFileInputSource: InputSource interface implementation\n\/\/ ---------------------------------------------------------------------------\nBinInputStream* LocalFileInputSource::makeStream() const\n{\n    BinFileInputStream* retStrm = new BinFileInputStream(getSystemId());\n    if (!retStrm->getIsOpen())\n    {\n        delete retStrm;\n        return 0;\n    }\n    return retStrm;\n}\n<commit_msg>Don't weave base and relative paths unless relative part is really relative.<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\/\/ ---------------------------------------------------------------------------\n\/\/  Includes\n\/\/ ---------------------------------------------------------------------------\n#include <util\/BinFileInputStream.hpp>\n#include <util\/PlatformUtils.hpp>\n#include <framework\/LocalFileInputSource.hpp>\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  LocalFileInputSource: Constructors and Destructor\n\/\/ ---------------------------------------------------------------------------\nLocalFileInputSource::LocalFileInputSource( const   XMLCh* const basePath\n                                            , const XMLCh* const relativePath)\n{\n    \/\/\n    \/\/  If the relative part is really relative, then weave it together\n    \/\/  with the base path. If not, just take the relative path as the\n    \/\/  entire path.\n    \/\/\n    if (XMLPlatformUtils::isRelative(relativePath))\n    {\n        XMLCh* tmpBuf = XMLPlatformUtils::weavePaths(basePath, relativePath);\n        setSystemId(tmpBuf);\n        delete [] tmpBuf;\n    }\n     else\n    {\n        setSystemId(relativePath);\n    }\n}\n\nLocalFileInputSource::LocalFileInputSource(const XMLCh* const filePath)\n{\n    \/\/\n    \/\/  If the path is relative, then complete it acording to the current\n    \/\/  working directory rules of the current platform. Else, just take\n    \/\/  it as is.\n    \/\/\n    if (XMLPlatformUtils::isRelative(filePath))\n    {\n        XMLCh* tmpBuf = XMLPlatformUtils::getFullPath(filePath);\n        setSystemId(tmpBuf);\n        delete [] tmpBuf;\n    }\n     else\n    {\n        setSystemId(filePath);\n    }\n}\n\nLocalFileInputSource::~LocalFileInputSource()\n{\n}\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/  LocalFileInputSource: InputSource interface implementation\n\/\/ ---------------------------------------------------------------------------\nBinInputStream* LocalFileInputSource::makeStream() const\n{\n    BinFileInputStream* retStrm = new BinFileInputStream(getSystemId());\n    if (!retStrm->getIsOpen())\n    {\n        delete retStrm;\n        return 0;\n    }\n    return retStrm;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef STAN_MATH_REV_MAT_FUN_CHOLESKY_DECOMPOSE_HPP\n#define STAN_MATH_REV_MAT_FUN_CHOLESKY_DECOMPOSE_HPP\n\n#include <stan\/math\/rev\/meta.hpp>\n#include <stan\/math\/prim\/fun\/Eigen.hpp>\n#include <stan\/math\/prim\/fun\/typedefs.hpp>\n#include <stan\/math\/prim\/fun\/cholesky_decompose.hpp>\n#include <stan\/math\/rev\/fun\/value_of_rec.hpp>\n#include <stan\/math\/rev\/fun\/value_of.hpp>\n#include <stan\/math\/rev\/core.hpp>\n#include <stan\/math\/prim\/fun\/value_of_rec.hpp>\n#include <stan\/math\/prim\/err\/check_pos_definite.hpp>\n#include <stan\/math\/prim\/err\/check_square.hpp>\n#include <stan\/math\/prim\/err\/check_symmetric.hpp>\n\n#ifdef STAN_OPENCL\n#include <stan\/math\/opencl\/prim.hpp>\n#endif\n\n#include <algorithm>\n#include <vector>\n\nnamespace stan {\nnamespace math {\n\nnamespace internal {\ntemplate <typename LMat, typename LAMat>\ninline void initialize_return(LMat& L, const LAMat& L_A, vari*& dummy) {\n  for (Eigen::Index j = 0; j < L_A.rows(); ++j) {\n    for (Eigen::Index i = 0; i < L_A.rows(); ++i) {\n      if (j > i) {\n        L.coeffRef(i, j) = dummy;\n      } else {\n        L.coeffRef(i, j) = new vari(L_A.coeffRef(i, j), false);\n      }\n    }\n  }\n}\n\n\/**\n * Reverse mode differentiation algorithm reference:\n *\n * Mike Giles. An extended collection of matrix derivative results for\n * forward and reverse mode AD.  Jan. 2008.\n *\n * Note algorithm  as laid out in Giles is row-major, so Eigen::Matrices\n * are explicitly storage order RowMajor, whereas Eigen defaults to\n * ColumnMajor. Also note algorithm starts by calculating the adjoint for\n * A(M_ - 1, M_ - 1), hence pos on line 94 is decremented to start at pos\n * = M_ * (M_ + 1) \/ 2.\n *\/\ntemplate <typename T1, typename T2, typename T3>\ninline auto unblocked_cholesky_lambda(T1& L_A, T2& L, T3& A) {\n  return [L_A, L, A]() mutable {\n    const size_t N = A.rows();\n    \/\/ Algorithm is in rowmajor so we make the adjoint copy rowmajor\n    Eigen::Matrix<double, -1, -1, Eigen::RowMajor> adjL(L.rows(), L.cols());\n    adjL.template triangularView<Eigen::Lower>() = L.adj();\n    for (int i = N - 1; i >= 0; --i) {\n      for (int j = i; j >= 0; --j) {\n        if (i == j) {\n          A.adj()(i, j) = 0.5 * adjL.coeff(i, j) \/ L_A.coeff(i, j);\n        } else {\n          A.adj()(i, j) = adjL.coeff(i, j) \/ L_A.coeff(j, j);\n          adjL.coeffRef(j, j)\n              -= adjL.coeff(i, j) * L_A.coeff(i, j) \/ L_A.coeff(j, j);\n        }\n        for (int k = j - 1; k >= 0; --k) {\n          adjL.coeffRef(i, k) -= A.adj().coeff(i, j) * L_A.coeff(j, k);\n          adjL.coeffRef(j, k) -= A.adj().coeff(i, j) * L_A.coeff(i, k);\n        }\n      }\n    }\n  };\n}\n\n\/**\n * Reverse mode differentiation algorithm reference:\n *\n * Iain Murray: Differentiation of the Cholesky decomposition, 2016.\n *\n *\/\ntemplate <typename T1, typename T2, typename T3>\ninline auto cholesky_lambda(T1& L_A, T2& L, T3& A) {\n  return [L_A, L, A]() mutable {\n    using Block_ = Eigen::Block<Eigen::MatrixXd>;\n    using Eigen::Lower;\n    using Eigen::StrictlyUpper;\n    using Eigen::Upper;\n    Eigen::MatrixXd L_adj(L.rows(), L.cols());\n    L_adj.template triangularView<Eigen::Lower>() = L.adj();\n    const int M_ = L_A.rows();\n    int block_size_ = std::max(M_ \/ 8, 8);\n    block_size_ = std::min(block_size_, 128);\n    for (int k = M_; k > 0; k -= block_size_) {\n      int j = std::max(0, k - block_size_);\n      auto R = L_A.block(j, 0, k - j, j);\n      auto D = L_A.block(j, j, k - j, k - j).eval();\n      auto B = L_A.block(k, 0, M_ - k, j);\n      auto C = L_A.block(k, j, M_ - k, k - j);\n      auto R_adj = L_adj.block(j, 0, k - j, j);\n      auto D_adj = L_adj.block(j, j, k - j, k - j);\n      auto B_adj = L_adj.block(k, 0, M_ - k, j);\n      auto C_adj = L_adj.block(k, j, M_ - k, k - j);\n      D.transposeInPlace();\n      if (C_adj.size() > 0) {\n        C_adj = D.template triangularView<Upper>()\n                    .solve(C_adj.transpose())\n                    .transpose();\n        B_adj.noalias() -= C_adj * R;\n        D_adj.noalias() -= C_adj.transpose() * C;\n      }\n      D_adj = (D * D_adj.template triangularView<Lower>()).eval();\n      D_adj.template triangularView<StrictlyUpper>()\n          = D_adj.adjoint().template triangularView<StrictlyUpper>();\n      D.template triangularView<Upper>().solveInPlace(D_adj);\n      D.template triangularView<Upper>().solveInPlace(D_adj.transpose());\n      R_adj.noalias() -= C_adj.transpose() * B;\n      R_adj.noalias() -= D_adj.template selfadjointView<Lower>() * R;\n      D_adj.diagonal() *= 0.5;\n    }\n    A.adj().template triangularView<Eigen::Lower>() = L_adj;\n  };\n}\n\n#ifdef STAN_OPENCL\n\/**\n * Reverse mode differentiation for Cholesky using OpenCL\n * Reverse mode differentiation algorithm reference:\n *\n * Iain Murray: Differentiation of the Cholesky decomposition, 2016.\n *\n *\/\ntemplate <typename AMat, typename LVari>\ninline auto opencl_cholesky_lambda(AMat& arena_A, LVari& vari_L) {\n  return [arena_A, vari_L]() mutable {\n    const int M_ = arena_A.rows();\n    const int packed_size = M_ * (M_ + 1) \/ 2;\n    Eigen::Map<Eigen::Matrix<vari*, Eigen::Dynamic, 1>> L_cpu(\n        vari_L, M_ * (M_ + 1) \/ 2);\n    Eigen::VectorXd L_val_cpu = L_cpu.val();\n    Eigen::VectorXd L_adj_cpu = L_cpu.adj();\n    matrix_cl<double> L_val = packed_copy<matrix_cl_view::Lower>(L_val_cpu, M_);\n    matrix_cl<double> L_adj = packed_copy<matrix_cl_view::Lower>(L_adj_cpu, M_);\n    int block_size\n        = M_\n          \/ std::max(1,\n                     opencl_context.tuning_opts().cholesky_rev_block_partition);\n    block_size = std::max(block_size, 8);\n    block_size = std::min(\n        block_size, opencl_context.tuning_opts().cholesky_rev_min_block_size);\n    \/\/ The following is an OpenCL implementation of\n    \/\/ the chain() function from the cholesky_block\n    \/\/ vari class implementation\n    for (int k = M_; k > 0; k -= block_size) {\n      const int j = std::max(0, k - block_size);\n      const int k_j_ind = k - j;\n      const int m_k_ind = M_ - k;\n\n      auto&& R_val = block_zero_based(L_val, j, 0, k_j_ind, j);\n      auto&& R_adj = block_zero_based(L_adj, j, 0, k_j_ind, j);\n      matrix_cl<double> D_val = block_zero_based(L_val, j, j, k_j_ind, k_j_ind);\n      matrix_cl<double> D_adj = block_zero_based(L_adj, j, j, k_j_ind, k_j_ind);\n      auto&& B_val = block_zero_based(L_val, k, 0, m_k_ind, j);\n      auto&& B_adj = block_zero_based(L_adj, k, 0, m_k_ind, j);\n      auto&& C_val = block_zero_based(L_val, k, j, m_k_ind, k_j_ind);\n      auto&& C_adj = block_zero_based(L_adj, k, j, m_k_ind, k_j_ind);\n\n      C_adj = C_adj * tri_inverse(D_val);\n      B_adj = B_adj - C_adj * R_val;\n      D_adj = D_adj - transpose(C_adj) * C_val;\n\n      D_adj = transpose(D_val) * D_adj;\n      D_adj.triangular_transpose<TriangularMapCL::LowerToUpper>();\n      D_val = transpose(tri_inverse(D_val));\n      D_adj = D_val * transpose(D_val * D_adj);\n      D_adj.triangular_transpose<TriangularMapCL::LowerToUpper>();\n\n      R_adj = R_adj - transpose(C_adj) * B_val - D_adj * R_val;\n      diagonal(D_adj) = diagonal(D_adj) + 0.5;\n\n      block_zero_based(L_adj, j, j, k_j_ind, k_j_ind) = D_adj;\n    }\n    L_adj.view(matrix_cl_view::Lower);\n    std::vector<double> L_adj_cpu_res = packed_copy(L_adj);\n    int pos = 0;\n    for (Eigen::Index j = 0; j < arena_A.rows(); ++j) {\n      for (Eigen::Index i = j; i < arena_A.rows(); ++i) {\n        arena_A.coeffRef(i, j)->adj_ += L_adj_cpu_res[pos];\n        pos++;\n      }\n    }\n  };\n}\n\n#endif\n}  \/\/ namespace internal\n\n\/**\n * Reverse mode specialization of cholesky decomposition\n *\n * Internally calls Eigen::LLT rather than using\n * stan::math::cholesky_decompose in order to use an inplace decomposition.\n *\n * Note chainable stack varis are created below in Matrix<var, -1, -1>\n *\n * @param A Matrix\n * @return L cholesky factor of A\n *\/\ntemplate <typename EigMat, require_eigen_vt<is_var, EigMat>* = nullptr>\ninline auto cholesky_decompose(const EigMat& A) {\n  check_square(\"cholesky_decompose\", \"A\", A);\n  arena_t<EigMat> arena_A = A;\n  arena_t<Eigen::Matrix<double, -1, -1>> L_A(arena_A.val());\n#ifdef STAN_OPENCL\n  L_A = cholesky_decompose(L_A);\n#else\n  check_symmetric(\"cholesky_decompose\", \"A\", A);\n  Eigen::LLT<Eigen::Ref<Eigen::MatrixXd>, Eigen::Lower> L_factor(L_A);\n  check_pos_definite(\"cholesky_decompose\", \"m\", L_factor);\n#endif\n  L_A.template triangularView<Eigen::StrictlyUpper>().setZero();\n  \/\/ looping gradient calcs faster for small matrices compared to\n  \/\/ cholesky_block\n  vari* dummy = new vari(0.0, false);\n  arena_t<EigMat> L(L_A.rows(), L_A.cols());\n  if (L_A.rows() <= 35) {\n    internal::initialize_return(L, L_A, dummy);\n    reverse_pass_callback(internal::unblocked_cholesky_lambda(L_A, L, arena_A));\n  } else {\n#ifdef STAN_OPENCL\n    if (L_A.rows()\n        > opencl_context.tuning_opts().cholesky_size_worth_transfer) {\n      vari** vari_L = ChainableStack::instance_->memalloc_.alloc_array<vari*>(\n          arena_A.rows() * (arena_A.rows() + 1) \/ 2);\n      size_t pos = 0;\n      for (Eigen::Index j = 0; j < arena_A.rows(); ++j) {\n        for (Eigen::Index i = j; i < arena_A.rows(); ++i) {\n          vari_L[pos] = new vari(L_A.coeffRef(i, j), false);\n          L.coeffRef(i, j).vi_ = vari_L[pos];\n          ++pos;\n        }\n        for (Eigen::Index k = 0; k < j; ++k) {\n          L.coeffRef(k, j).vi_ = dummy;\n        }\n      }\n      reverse_pass_callback(internal::opencl_cholesky_lambda(arena_A, vari_L));\n    } else {\n      internal::initialize_return(L, L_A, dummy);\n      reverse_pass_callback(internal::cholesky_lambda(L_A, L, arena_A));\n    }\n#else\n    internal::initialize_return(L, L_A, dummy);\n    reverse_pass_callback(internal::cholesky_lambda(L_A, L, arena_A));\n#endif\n  }\n  return plain_type_t<EigMat>(L);\n}\n\n\/**\n * Reverse mode specialization of Cholesky decomposition\n *\n * Internally calls Eigen::LLT rather than using\n * stan::math::cholesky_decompose in order to use an inplace decomposition.\n *\n * Note chainable stack varis are created below in Matrix<var, -1, -1>\n * @tparam T A `var_value` holding an inner eigen type.\n * @param A A square positive definite matrix with no nan values.\n * @return L Cholesky factor of A\n *\/\ntemplate <typename T, require_var_matrix_t<T>* = nullptr>\ninline auto cholesky_decompose(const T& A) {\n  check_symmetric(\"cholesky_decompose\", \"A\", A.val());\n  plain_type_t<T> L = cholesky_decompose(A.val());\n  if (A.rows() <= 35) {\n    reverse_pass_callback(internal::unblocked_cholesky_lambda(L.val(), L, A));\n  } else {\n    reverse_pass_callback(internal::cholesky_lambda(L.val(), L, A));\n  }\n  return L;\n}\n\n}  \/\/ namespace math\n}  \/\/ namespace stan\n#endif\n<commit_msg>fix cholesky typo<commit_after>#ifndef STAN_MATH_REV_MAT_FUN_CHOLESKY_DECOMPOSE_HPP\n#define STAN_MATH_REV_MAT_FUN_CHOLESKY_DECOMPOSE_HPP\n\n#include <stan\/math\/rev\/meta.hpp>\n#include <stan\/math\/prim\/fun\/Eigen.hpp>\n#include <stan\/math\/prim\/fun\/typedefs.hpp>\n#include <stan\/math\/prim\/fun\/cholesky_decompose.hpp>\n#include <stan\/math\/rev\/fun\/value_of_rec.hpp>\n#include <stan\/math\/rev\/fun\/value_of.hpp>\n#include <stan\/math\/rev\/core.hpp>\n#include <stan\/math\/prim\/fun\/value_of_rec.hpp>\n#include <stan\/math\/prim\/err\/check_pos_definite.hpp>\n#include <stan\/math\/prim\/err\/check_square.hpp>\n#include <stan\/math\/prim\/err\/check_symmetric.hpp>\n\n#ifdef STAN_OPENCL\n#include <stan\/math\/opencl\/prim.hpp>\n#endif\n\n#include <algorithm>\n#include <vector>\n\nnamespace stan {\nnamespace math {\n\nnamespace internal {\ntemplate <typename LMat, typename LAMat>\ninline void initialize_return(LMat& L, const LAMat& L_A, vari*& dummy) {\n  for (Eigen::Index j = 0; j < L_A.rows(); ++j) {\n    for (Eigen::Index i = 0; i < L_A.rows(); ++i) {\n      if (j > i) {\n        L.coeffRef(i, j) = dummy;\n      } else {\n        L.coeffRef(i, j) = new vari(L_A.coeffRef(i, j), false);\n      }\n    }\n  }\n}\n\n\/**\n * Reverse mode differentiation algorithm reference:\n *\n * Mike Giles. An extended collection of matrix derivative results for\n * forward and reverse mode AD.  Jan. 2008.\n *\n * Note algorithm  as laid out in Giles is row-major, so Eigen::Matrices\n * are explicitly storage order RowMajor, whereas Eigen defaults to\n * ColumnMajor. Also note algorithm starts by calculating the adjoint for\n * A(M_ - 1, M_ - 1), hence pos on line 94 is decremented to start at pos\n * = M_ * (M_ + 1) \/ 2.\n *\/\ntemplate <typename T1, typename T2, typename T3>\ninline auto unblocked_cholesky_lambda(T1& L_A, T2& L, T3& A) {\n  return [L_A, L, A]() mutable {\n    const size_t N = A.rows();\n    \/\/ Algorithm is in rowmajor so we make the adjoint copy rowmajor\n    Eigen::Matrix<double, -1, -1, Eigen::RowMajor> adjL(L.rows(), L.cols());\n    adjL.template triangularView<Eigen::Lower>() = L.adj();\n    for (int i = N - 1; i >= 0; --i) {\n      for (int j = i; j >= 0; --j) {\n        if (i == j) {\n          A.adj()(i, j) = 0.5 * adjL.coeff(i, j) \/ L_A.coeff(i, j);\n        } else {\n          A.adj()(i, j) = adjL.coeff(i, j) \/ L_A.coeff(j, j);\n          adjL.coeffRef(j, j)\n              -= adjL.coeff(i, j) * L_A.coeff(i, j) \/ L_A.coeff(j, j);\n        }\n        for (int k = j - 1; k >= 0; --k) {\n          adjL.coeffRef(i, k) -= A.adj().coeff(i, j) * L_A.coeff(j, k);\n          adjL.coeffRef(j, k) -= A.adj().coeff(i, j) * L_A.coeff(i, k);\n        }\n      }\n    }\n  };\n}\n\n\/**\n * Reverse mode differentiation algorithm reference:\n *\n * Iain Murray: Differentiation of the Cholesky decomposition, 2016.\n *\n *\/\ntemplate <typename T1, typename T2, typename T3>\ninline auto cholesky_lambda(T1& L_A, T2& L, T3& A) {\n  return [L_A, L, A]() mutable {\n    using Block_ = Eigen::Block<Eigen::MatrixXd>;\n    using Eigen::Lower;\n    using Eigen::StrictlyUpper;\n    using Eigen::Upper;\n    Eigen::MatrixXd L_adj(L.rows(), L.cols());\n    L_adj.template triangularView<Eigen::Lower>() = L.adj();\n    const int M_ = L_A.rows();\n    int block_size_ = std::max(M_ \/ 8, 8);\n    block_size_ = std::min(block_size_, 128);\n    for (int k = M_; k > 0; k -= block_size_) {\n      int j = std::max(0, k - block_size_);\n      auto R = L_A.block(j, 0, k - j, j);\n      auto D = L_A.block(j, j, k - j, k - j).eval();\n      auto B = L_A.block(k, 0, M_ - k, j);\n      auto C = L_A.block(k, j, M_ - k, k - j);\n      auto R_adj = L_adj.block(j, 0, k - j, j);\n      auto D_adj = L_adj.block(j, j, k - j, k - j);\n      auto B_adj = L_adj.block(k, 0, M_ - k, j);\n      auto C_adj = L_adj.block(k, j, M_ - k, k - j);\n      D.transposeInPlace();\n      if (C_adj.size() > 0) {\n        C_adj = D.template triangularView<Upper>()\n                    .solve(C_adj.transpose())\n                    .transpose();\n        B_adj.noalias() -= C_adj * R;\n        D_adj.noalias() -= C_adj.transpose() * C;\n      }\n      D_adj = (D * D_adj.template triangularView<Lower>()).eval();\n      D_adj.template triangularView<StrictlyUpper>()\n          = D_adj.adjoint().template triangularView<StrictlyUpper>();\n      D.template triangularView<Upper>().solveInPlace(D_adj);\n      D.template triangularView<Upper>().solveInPlace(D_adj.transpose());\n      R_adj.noalias() -= C_adj.transpose() * B;\n      R_adj.noalias() -= D_adj.template selfadjointView<Lower>() * R;\n      D_adj.diagonal() *= 0.5;\n    }\n    A.adj().template triangularView<Eigen::Lower>() = L_adj;\n  };\n}\n\n#ifdef STAN_OPENCL\n\/**\n * Reverse mode differentiation for Cholesky using OpenCL\n * Reverse mode differentiation algorithm reference:\n *\n * Iain Murray: Differentiation of the Cholesky decomposition, 2016.\n *\n *\/\ntemplate <typename AMat, typename LVari>\ninline auto opencl_cholesky_lambda(AMat& arena_A, LVari& vari_L) {\n  return [arena_A, vari_L]() mutable {\n    const int M_ = arena_A.rows();\n    const int packed_size = M_ * (M_ + 1) \/ 2;\n    Eigen::Map<Eigen::Matrix<vari*, Eigen::Dynamic, 1>> L_cpu(\n        vari_L, M_ * (M_ + 1) \/ 2);\n    Eigen::VectorXd L_val_cpu = L_cpu.val();\n    Eigen::VectorXd L_adj_cpu = L_cpu.adj();\n    matrix_cl<double> L_val = packed_copy<matrix_cl_view::Lower>(L_val_cpu, M_);\n    matrix_cl<double> L_adj = packed_copy<matrix_cl_view::Lower>(L_adj_cpu, M_);\n    int block_size\n        = M_\n          \/ std::max(1,\n                     opencl_context.tuning_opts().cholesky_rev_block_partition);\n    block_size = std::max(block_size, 8);\n    block_size = std::min(\n        block_size, opencl_context.tuning_opts().cholesky_rev_min_block_size);\n    \/\/ The following is an OpenCL implementation of\n    \/\/ the chain() function from the cholesky_block\n    \/\/ vari class implementation\n    for (int k = M_; k > 0; k -= block_size) {\n      const int j = std::max(0, k - block_size);\n      const int k_j_ind = k - j;\n      const int m_k_ind = M_ - k;\n\n      auto&& R_val = block_zero_based(L_val, j, 0, k_j_ind, j);\n      auto&& R_adj = block_zero_based(L_adj, j, 0, k_j_ind, j);\n      matrix_cl<double> D_val = block_zero_based(L_val, j, j, k_j_ind, k_j_ind);\n      matrix_cl<double> D_adj = block_zero_based(L_adj, j, j, k_j_ind, k_j_ind);\n      auto&& B_val = block_zero_based(L_val, k, 0, m_k_ind, j);\n      auto&& B_adj = block_zero_based(L_adj, k, 0, m_k_ind, j);\n      auto&& C_val = block_zero_based(L_val, k, j, m_k_ind, k_j_ind);\n      auto&& C_adj = block_zero_based(L_adj, k, j, m_k_ind, k_j_ind);\n\n      C_adj = C_adj * tri_inverse(D_val);\n      B_adj = B_adj - C_adj * R_val;\n      D_adj = D_adj - transpose(C_adj) * C_val;\n\n      D_adj = transpose(D_val) * D_adj;\n      D_adj.triangular_transpose<TriangularMapCL::LowerToUpper>();\n      D_val = transpose(tri_inverse(D_val));\n      D_adj = D_val * transpose(D_val * D_adj);\n      D_adj.triangular_transpose<TriangularMapCL::LowerToUpper>();\n\n      R_adj = R_adj - transpose(C_adj) * B_val - D_adj * R_val;\n      diagonal(D_adj) = diagonal(D_adj) * 0.5;\n\n      block_zero_based(L_adj, j, j, k_j_ind, k_j_ind) = D_adj;\n    }\n    L_adj.view(matrix_cl_view::Lower);\n    std::vector<double> L_adj_cpu_res = packed_copy(L_adj);\n    int pos = 0;\n    for (Eigen::Index j = 0; j < arena_A.rows(); ++j) {\n      for (Eigen::Index i = j; i < arena_A.rows(); ++i) {\n        arena_A.coeffRef(i, j)->adj_ += L_adj_cpu_res[pos];\n        pos++;\n      }\n    }\n  };\n}\n\n#endif\n}  \/\/ namespace internal\n\n\/**\n * Reverse mode specialization of cholesky decomposition\n *\n * Internally calls Eigen::LLT rather than using\n * stan::math::cholesky_decompose in order to use an inplace decomposition.\n *\n * Note chainable stack varis are created below in Matrix<var, -1, -1>\n *\n * @param A Matrix\n * @return L cholesky factor of A\n *\/\ntemplate <typename EigMat, require_eigen_vt<is_var, EigMat>* = nullptr>\ninline auto cholesky_decompose(const EigMat& A) {\n  check_square(\"cholesky_decompose\", \"A\", A);\n  arena_t<EigMat> arena_A = A;\n  arena_t<Eigen::Matrix<double, -1, -1>> L_A(arena_A.val());\n#ifdef STAN_OPENCL\n  L_A = cholesky_decompose(L_A);\n#else\n  check_symmetric(\"cholesky_decompose\", \"A\", A);\n  Eigen::LLT<Eigen::Ref<Eigen::MatrixXd>, Eigen::Lower> L_factor(L_A);\n  check_pos_definite(\"cholesky_decompose\", \"m\", L_factor);\n#endif\n  L_A.template triangularView<Eigen::StrictlyUpper>().setZero();\n  \/\/ looping gradient calcs faster for small matrices compared to\n  \/\/ cholesky_block\n  vari* dummy = new vari(0.0, false);\n  arena_t<EigMat> L(L_A.rows(), L_A.cols());\n  if (L_A.rows() <= 35) {\n    internal::initialize_return(L, L_A, dummy);\n    reverse_pass_callback(internal::unblocked_cholesky_lambda(L_A, L, arena_A));\n  } else {\n#ifdef STAN_OPENCL\n    if (L_A.rows()\n        > opencl_context.tuning_opts().cholesky_size_worth_transfer) {\n      vari** vari_L = ChainableStack::instance_->memalloc_.alloc_array<vari*>(\n          arena_A.rows() * (arena_A.rows() + 1) \/ 2);\n      size_t pos = 0;\n      for (Eigen::Index j = 0; j < arena_A.rows(); ++j) {\n        for (Eigen::Index i = j; i < arena_A.rows(); ++i) {\n          vari_L[pos] = new vari(L_A.coeffRef(i, j), false);\n          L.coeffRef(i, j).vi_ = vari_L[pos];\n          ++pos;\n        }\n        for (Eigen::Index k = 0; k < j; ++k) {\n          L.coeffRef(k, j).vi_ = dummy;\n        }\n      }\n      reverse_pass_callback(internal::opencl_cholesky_lambda(arena_A, vari_L));\n    } else {\n      internal::initialize_return(L, L_A, dummy);\n      reverse_pass_callback(internal::cholesky_lambda(L_A, L, arena_A));\n    }\n#else\n    internal::initialize_return(L, L_A, dummy);\n    reverse_pass_callback(internal::cholesky_lambda(L_A, L, arena_A));\n#endif\n  }\n  return plain_type_t<EigMat>(L);\n}\n\n\/**\n * Reverse mode specialization of Cholesky decomposition\n *\n * Internally calls Eigen::LLT rather than using\n * stan::math::cholesky_decompose in order to use an inplace decomposition.\n *\n * Note chainable stack varis are created below in Matrix<var, -1, -1>\n * @tparam T A `var_value` holding an inner eigen type.\n * @param A A square positive definite matrix with no nan values.\n * @return L Cholesky factor of A\n *\/\ntemplate <typename T, require_var_matrix_t<T>* = nullptr>\ninline auto cholesky_decompose(const T& A) {\n  check_symmetric(\"cholesky_decompose\", \"A\", A.val());\n  plain_type_t<T> L = cholesky_decompose(A.val());\n  if (A.rows() <= 35) {\n    reverse_pass_callback(internal::unblocked_cholesky_lambda(L.val(), L, A));\n  } else {\n    reverse_pass_callback(internal::cholesky_lambda(L.val(), L, A));\n  }\n  return L;\n}\n\n}  \/\/ namespace math\n}  \/\/ namespace stan\n#endif\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>-Fix text not cleaning up shader stages after rendering<commit_after><|endoftext|>"}
{"text":"<commit_before>\/**\n * \\file VolumeFilter.cpp\n *\/\n\n#include \"VolumeFilter.h\"\n\n#include <cmath>\n#include <cstdint>\n\nnamespace ATK\n{\n  template<typename DataType_>\n  VolumeFilter<DataType_>::VolumeFilter(int nb_channels)\n  :Parent(nb_channels, nb_channels), volume(1)\n  {\n    \n  }\n  \n  template<typename DataType_>\n  VolumeFilter<DataType_>::~VolumeFilter()\n  {\n    \n  }\n  \n  template<typename DataType_>\n  void VolumeFilter<DataType_>::set_volume_db(double volume_db)\n  {\n    set_volume(std::pow(10., volume_db\/20));\n  }\n  \n  template<typename DataType_>\n  void VolumeFilter<DataType_>::set_volume(double volume)\n  {\n    this->volume = volume;\n  }\n  \n  template<typename DataType_>\n  void VolumeFilter<DataType_>::process_impl(int64_t size) const\n  {\n    for(int channel = 0; channel < nb_input_ports; ++channel)\n    {\n      const DataType* ATK_RESTRICT input = converted_inputs[channel];\n      DataType* ATK_RESTRICT output = outputs[channel];\n      for(int64_t i = 0; i < size; ++i)\n      {\n        output[i] = static_cast<DataType>(volume * input[i]);\n      }\n    }\n  }\n  \n  template class VolumeFilter<std::int16_t>;\n  template class VolumeFilter<std::int32_t>;\n  template class VolumeFilter<int64_t>;\n  template class VolumeFilter<float>;\n  template class VolumeFilter<double>;\n}\n<commit_msg>Better volume filter<commit_after>\/**\n * \\file VolumeFilter.cpp\n *\/\n\n#include \"VolumeFilter.h\"\n\n#include <cmath>\n#include <cstdint>\n\nnamespace ATK\n{\n  template<typename DataType_>\n  VolumeFilter<DataType_>::VolumeFilter(int nb_channels)\n  :Parent(nb_channels, nb_channels), volume(1)\n  {\n    \n  }\n  \n  template<typename DataType_>\n  VolumeFilter<DataType_>::~VolumeFilter()\n  {\n    \n  }\n  \n  template<typename DataType_>\n  void VolumeFilter<DataType_>::set_volume_db(double volume_db)\n  {\n    set_volume(std::pow(10., volume_db\/20));\n  }\n  \n  template<typename DataType_>\n  void VolumeFilter<DataType_>::set_volume(double volume)\n  {\n    this->volume = volume;\n  }\n  \n  template<typename DataType_>\n  void VolumeFilter<DataType_>::process_impl(int64_t size) const\n  {\n    for(int channel = 0; channel < nb_input_ports; ++channel)\n    {\n      const DataType* ATK_RESTRICT input = converted_inputs[channel];\n      DataType* ATK_RESTRICT output = outputs[channel];\n      for(int64_t i = 0; i < size; ++i)\n      {\n        *(output++) = static_cast<DataType>(volume * *(input++));\n      }\n    }\n  }\n  \n  template class VolumeFilter<std::int16_t>;\n  template class VolumeFilter<std::int32_t>;\n  template class VolumeFilter<int64_t>;\n  template class VolumeFilter<float>;\n  template class VolumeFilter<double>;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"PlatformInterface.h\"\n\n#include \"Config.h\"\n#include \"HumbugApplication.h\"\n#include \"HumbugWindow.h\"\n#include \"IconRenderer.h\"\n\n#include <shobjidl.h>\n#include <windows.h>\n#include <mmsystem.h>\n\n\/\/ QtSparkle\n#include <updater.h>\n\n#include <QIcon>\n#include <QUrl>\n#include <QDebug>\n#include <QTimer>\n#include <QTemporaryFile>\n#include <QResource>\n\nclass PlatformInterfacePrivate : public QObject {\n    Q_OBJECT\npublic:\n    PlatformInterfacePrivate(PlatformInterface *qq) : QObject(qq), q(qq), updater(0) {\n        setupTaskbarIcon();\n        \n        sound_temp.open();\n        QResource memory_soundfile(\":\/audio\/humbug.wav\");\n        sound_temp.write((char*) memory_soundfile.data(), memory_soundfile.size());\n        sound_temp.flush();\n        sound_temp.close();\n\n        QTimer::singleShot(0, this, SLOT(setupQtSparkle()));\n    }\n    \n    virtual ~PlatformInterfacePrivate() {\n    }\n    \n    void setupQtSparkle() {   \n        updater = new qtsparkle::Updater(QUrl(\"https:\/\/humbughq.com\/dist\/apps\/win\/sparkle.xml\"), APP->mainWindow());\n    }\n\n    void setupTaskbarIcon() {\n        m_taskbarInterface = NULL;\n\n        \/\/ Compute the value for the TaskbarButtonCreated message\n        m_IDTaskbarButtonCreated = RegisterWindowMessage(L\"TaskbarButtonCreated\");\n\n        HRESULT hr = CoCreateInstance(CLSID_TaskbarList, NULL, CLSCTX_INPROC_SERVER, IID_ITaskbarList3, reinterpret_cast<void**> (&(m_taskbarInterface)));\n\n        if (SUCCEEDED(hr)) {\n            hr = m_taskbarInterface->HrInit();\n\n            if (FAILED(hr)) {\n                m_taskbarInterface->Release();\n                m_taskbarInterface = NULL;\n            }\n        }\n    }\n\n    void setOverlayIcon(const QIcon& icon, const QString& description) {\n        qDebug() << \"Setting windows overlay icon!\";\n        if (m_taskbarInterface) {\n            qDebug() << \"Doing it now!\";\n            HICON overlay_icon = icon.isNull() ? NULL : icon.pixmap(48).toWinHICON();\n            m_taskbarInterface->SetOverlayIcon(APP->mainWindow()->winId(), overlay_icon, description.toStdWString().c_str());\n\n            if (overlay_icon) {\n                DestroyIcon(overlay_icon);\n                return;\n            }\n        }\n\n        return;\n    }\n\n    PlatformInterface *q;\n    qtsparkle::Updater *updater;\n    QTemporaryFile sound_temp;\n\n    unsigned int m_IDTaskbarButtonCreated;\n    ITaskbarList3* m_taskbarInterface;\n\n};\n\nPlatformInterface::PlatformInterface(QObject *parent)\n    : QObject(parent)\n    , m_d(new PlatformInterfacePrivate(this))\n{\n\n}\n\nPlatformInterface::~PlatformInterface() {\n    delete m_d;\n}\n\nvoid PlatformInterface::checkForUpdates() {\n    if (m_d->updater)\n        m_d->updater->CheckNow();\n}\n\nvoid PlatformInterface::desktopNotification(const QString &title, const QString &content) {\n    FLASHWINFO finfo;\n    finfo.cbSize = sizeof( FLASHWINFO );\n    finfo.hwnd = APP->mainWindow()->winId();\n    finfo.uCount = 1;         \/\/ Flash 40 times\n    finfo.dwTimeout = 400; \/\/ Duration in milliseconds between flashes\n    finfo.dwFlags = FLASHW_ALL | FLASHW_TIMERNOFG; \/\/Flash all, until window comes to the foreground\n    ::FlashWindowEx( &finfo );\n}\n\nvoid PlatformInterface::unreadCountUpdated(int oldCount, int newCount) {\n    if (newCount == 0)\n        m_d->setOverlayIcon(QIcon(), \"\");\n    else\n        m_d->setOverlayIcon(APP->mainWindow()->iconRenderer()->winBadgeIcon(newCount), tr(\"%1 unread messages\").arg(newCount));\n}\n\nvoid PlatformInterface::playSound() {\n    LPCTSTR filename = reinterpret_cast<const wchar_t *>(m_d->sound_temp.fileName().utf16());\n    PlaySound(filename, NULL, SND_ASYNC | SND_FILENAME | SND_NODEFAULT);\n}\n\n#include \"PlatformInterface_win.moc\"\n<commit_msg>Mark slots as slots so they are actually called<commit_after>#include \"PlatformInterface.h\"\n\n#include \"Config.h\"\n#include \"HumbugApplication.h\"\n#include \"HumbugWindow.h\"\n#include \"IconRenderer.h\"\n\n#include <shobjidl.h>\n#include <windows.h>\n#include <mmsystem.h>\n\n\/\/ QtSparkle\n#include <updater.h>\n\n#include <QIcon>\n#include <QUrl>\n#include <QDebug>\n#include <QTimer>\n#include <QTemporaryFile>\n#include <QResource>\n\nclass PlatformInterfacePrivate : public QObject {\n    Q_OBJECT\npublic:\n    PlatformInterfacePrivate(PlatformInterface *qq) : QObject(qq), q(qq), updater(0) {\n        setupTaskbarIcon();\n        \n        sound_temp.open();\n        QResource memory_soundfile(\":\/audio\/humbug.wav\");\n        sound_temp.write((char*) memory_soundfile.data(), memory_soundfile.size());\n        sound_temp.flush();\n        sound_temp.close();\n\n        QTimer::singleShot(0, this, SLOT(setupQtSparkle()));\n    }\n    \n    virtual ~PlatformInterfacePrivate() {\n    }\n\n    void setupTaskbarIcon() {\n        m_taskbarInterface = NULL;\n\n        \/\/ Compute the value for the TaskbarButtonCreated message\n        m_IDTaskbarButtonCreated = RegisterWindowMessage(L\"TaskbarButtonCreated\");\n\n        HRESULT hr = CoCreateInstance(CLSID_TaskbarList, NULL, CLSCTX_INPROC_SERVER, IID_ITaskbarList3, reinterpret_cast<void**> (&(m_taskbarInterface)));\n\n        if (SUCCEEDED(hr)) {\n            hr = m_taskbarInterface->HrInit();\n\n            if (FAILED(hr)) {\n                m_taskbarInterface->Release();\n                m_taskbarInterface = NULL;\n            }\n        }\n    }\n\n    void setOverlayIcon(const QIcon& icon, const QString& description) {\n        qDebug() << \"Setting windows overlay icon!\";\n        if (m_taskbarInterface) {\n            qDebug() << \"Doing it now!\";\n            HICON overlay_icon = icon.isNull() ? NULL : icon.pixmap(48).toWinHICON();\n            m_taskbarInterface->SetOverlayIcon(APP->mainWindow()->winId(), overlay_icon, description.toStdWString().c_str());\n\n            if (overlay_icon) {\n                DestroyIcon(overlay_icon);\n                return;\n            }\n        }\n\n        return;\n    }\n\nprivate slots:\n    void setupQtSparkle() {\n        updater = new qtsparkle::Updater(QUrl(\"https:\/\/humbughq.com\/dist\/apps\/win\/sparkle.xml\"), APP->mainWindow());\n    }\n\npublic:\n    PlatformInterface *q;\n    qtsparkle::Updater *updater;\n    QTemporaryFile sound_temp;\n\n    unsigned int m_IDTaskbarButtonCreated;\n    ITaskbarList3* m_taskbarInterface;\n\n};\n\nPlatformInterface::PlatformInterface(QObject *parent)\n    : QObject(parent)\n    , m_d(new PlatformInterfacePrivate(this))\n{\n\n}\n\nPlatformInterface::~PlatformInterface() {\n    delete m_d;\n}\n\nvoid PlatformInterface::checkForUpdates() {\n    if (m_d->updater)\n        m_d->updater->CheckNow();\n}\n\nvoid PlatformInterface::desktopNotification(const QString &title, const QString &content) {\n    FLASHWINFO finfo;\n    finfo.cbSize = sizeof( FLASHWINFO );\n    finfo.hwnd = APP->mainWindow()->winId();\n    finfo.uCount = 1;         \/\/ Flash 40 times\n    finfo.dwTimeout = 400; \/\/ Duration in milliseconds between flashes\n    finfo.dwFlags = FLASHW_ALL | FLASHW_TIMERNOFG; \/\/Flash all, until window comes to the foreground\n    ::FlashWindowEx( &finfo );\n}\n\nvoid PlatformInterface::unreadCountUpdated(int oldCount, int newCount) {\n    if (newCount == 0)\n        m_d->setOverlayIcon(QIcon(), \"\");\n    else\n        m_d->setOverlayIcon(APP->mainWindow()->iconRenderer()->winBadgeIcon(newCount), tr(\"%1 unread messages\").arg(newCount));\n}\n\nvoid PlatformInterface::playSound() {\n    LPCTSTR filename = reinterpret_cast<const wchar_t *>(m_d->sound_temp.fileName().utf16());\n    PlaySound(filename, NULL, SND_ASYNC | SND_FILENAME | SND_NODEFAULT);\n}\n\n#include \"PlatformInterface_win.moc\"\n<|endoftext|>"}
{"text":"<commit_before>#include \"j1App.h\"\n#include \"j1Render.h\"\n#include \"p2Log.h\"\n#include \"j1Camera.h\"\n#include \"j1Player.h\"\n#include \"j1Window.h\"\n#include \"Color.h\"\n#include \"GuiLabel.h\"\n\nj1Camera::j1Camera()\n{\n\tname = \"camera\";\n}\n\nj1Camera::~j1Camera()\n{\n\n}\n\n\/\/ Called before render is available\nbool j1Camera::Awake(pugi::xml_node&)\n{\n\t\/\/Create the ellipses\n\tLitleEllipse.ellipsecentre = { 0,0 };\n\tLitleEllipse.semimajoraxis = 160;\n\tLitleEllipse.semiminoraxis = 90;\n\n\tBigEllipse.ellipsecentre = { 0,0 };\n\tBigEllipse.semimajoraxis = 320;\n\tBigEllipse.semiminoraxis = 180;\n\n\tf_border_between_ellipses = BigEllipse.InsideEllipseValue({ 0,LitleEllipse.semiminoraxis});\n\n\tDebugPerformanceData_Rect = { 0,0,260,150 };\n\n\treturn true;\n}\n\n\/\/ Called before the first frame\nbool j1Camera::Start()\n{\n\t\/\/Get some useful variables\n\tf_Max_scale = App->win->scale;\n\tf_Min_scale = f_Max_scale - 0.3f;\n\tif (f_Min_scale < 0.8f)\n\t\tf_Min_scale = 0.8f;\n\tint w = 0, h = 0;\n\tSDL_GetRendererOutputSize(App->render->renderer, &w, &h);\n\ti_Half_w = (int)(w * 0.5f);\n\ti_Half_h = (int)(h * 0.5f);\n\n\t\/\/Fill up debug performance data vector\n\tfor (int i = 0, pos = App->win->GetWindowH() - DebugPerformanceData_Rect.h + 6; i < 9; i++, pos += 15) \/\/9, number of debug strings\n\t\tDebugPerformanceData.push_back(App->gui->CreateLabel({ 10,pos }, &std::string(\"\"), false, AddGuiTo::none));\n\tDebugPerformanceData[6]->EditLabelStr(&std::string(\"Press F9 to toggle this window visibility.\"));\n\tDebugPerformanceData[6]->SetLabelColor(&Yellow);\n\tDebugPerformanceData[7]->EditLabelStr(&std::string(\"Press F10 to report a bug.\"));\n\tDebugPerformanceData[7]->SetLabelColor(&Yellow);\n\tDebugPerformanceData[8]->EditLabelStr(&std::string(\"Press F11 to take a screenshot.\"));\n\tDebugPerformanceData[8]->SetLabelColor(&Yellow);\n\n\treturn true;\n}\n\n\/\/ Called each loop iteration\nbool j1Camera::PreUpdate()\n{\n\t\/\/Calculate camera centre\n\t\n\tfloat Scale = App->win->GetScale();\n\tiPoint Centre = { 0,0 };\n\tCentre.x = (int)((((float)(App->player->Link->pos.x + App->player->Zelda->pos.x)) * 0.5f));\n\tCentre.y = (int)((((float)(App->player->Link->pos.y + App->player->Zelda->pos.y)) * 0.5f));\n\t\/\/Camera position\n\t\n\tApp->render->camera.x = (int)(-Centre.x * Scale + i_Half_w);\n\tApp->render->camera.y = (int)(-Centre.y * Scale + i_Half_h);\n\n\tif(App->render->camera.x >= 0)\n\t\tApp->render->camera.x = 0;\n\n\tif (App->render->camera.y >= 0)\n\t\tApp->render->camera.y = 0;\n\n\t\/*\n\tif (App->render->camera.x >= 0) \n\t\tApp->render->camera.x = 0;\n\tif (-App->render->camera.x >= App->map->data.width * App->map->data.tile_width - App->render->camera.w \/Scale)\n\t\tApp->render->camera.x = (int)(-1 * (App->map->data.width * App->map->data.tile_width - App->render->camera.w \/ Scale));\n\t\n\tif (App->render->camera.y >= 0)\n\t\tApp->render->camera.y = 0;\n\tif (-App->render->camera.y >= App->map->data.height * App->map->data.tile_height )\n\t\tApp->render->camera.y = -1 * (App->map->data.height * App->map->data.tile_height );\n\t*\/\n\n\t\/\/Ellipss centre\n\tiPoint CentrePos = { 0,0 };\n\tCentrePos = App->render->WorldToScreen(Centre.x, Centre.y);\n\tLitleEllipse.ellipsecentre = BigEllipse.ellipsecentre = { (int)(CentrePos.x), (int)(CentrePos.y) };\n\n\t\/\/Debug Performance Data\n\tDebugPerformanceData_Rect.x = -App->render->camera.x;\n\tDebugPerformanceData_Rect.y = -App->render->camera.y + App->win->GetWindowH() - DebugPerformanceData_Rect.h;\n\treturn true;\n}\n\n\/\/ Called each loop iteration\nbool j1Camera::Update(float dt)\n{\n\tiPoint LinkPos = { 0,0 };\n\tLinkPos = App->render->WorldToScreen(App->player->Link->pos.x, App->player->Link->pos.y);\n\t\/**\/\n\t\/\/Is inside the little ellipse\n\tif (LitleEllipse.InsideEllipse(LinkPos))\n\t\tApp->win->scale = f_Max_scale;\n\t\/\/Is out the little ellipse\n\telse\n\t{\n\t\t\/\/Is between the big ellipse and the little one\n\t\tif (BigEllipse.InsideEllipse(LinkPos))\n\t\t{\n\t\t\t\/\/Scale between f_Max_scale and f_Min_scale\n\t\t\tfloat f_percentual_value = (((float)(BigEllipse.InsideEllipseValue(LinkPos) - f_border_between_ellipses)) \/ ((float)(1.0f - f_border_between_ellipses))) * 100.0f;\n\t\t\tfloat f_invert_percentual_value = 100.0f - f_percentual_value;\n\t\t\tif (f_invert_percentual_value < 0.0f)\n\t\t\t\tf_invert_percentual_value = 0.0f;\n\t\t\telse if (f_invert_percentual_value > 100.0f)\n\t\t\t\tf_invert_percentual_value = 100.0f;\n\t\t\tApp->win->scale = (((f_Max_scale - f_Min_scale) * f_invert_percentual_value) \/ (100.0f)) + f_Min_scale;\n\t\t}\n\t\t\/\/Is out the big ellipse\n\t\telse\n\t\t\tApp->win->scale = f_Min_scale;\n\t}\n\t\/**\/\n\n\t\/\/Some ellipses debug draw for testing\n\t\/*\n\t\/\/Little ellipse\n\t\/\/Centre\n\tApp->render->DrawCircle(LitleEllipse.ellipsecentre.x, LitleEllipse.ellipsecentre.y, 5, 0, 0, 255);\n\t\/\/Axis\n\tApp->render->DrawCircle(LitleEllipse.ellipsecentre.x + LitleEllipse.semimajoraxis, LitleEllipse.ellipsecentre.y, 5, 0, 0, 255);\n\tApp->render->DrawCircle(LitleEllipse.ellipsecentre.x - LitleEllipse.semimajoraxis, LitleEllipse.ellipsecentre.y, 5, 0, 0, 255);\n\tApp->render->DrawCircle(LitleEllipse.ellipsecentre.x, LitleEllipse.ellipsecentre.y + LitleEllipse.semiminoraxis, 5, 0, 0, 255);\n\tApp->render->DrawCircle(LitleEllipse.ellipsecentre.x, LitleEllipse.ellipsecentre.y - LitleEllipse.semiminoraxis, 5, 0, 0, 255);\n\n\t\/\/Big ellipse\n\t\/\/Centre\n\tApp->render->DrawCircle(BigEllipse.ellipsecentre.x, BigEllipse.ellipsecentre.y, 10, 255, 0, 0);\n\t\/\/Axis\n\tApp->render->DrawCircle(BigEllipse.ellipsecentre.x + BigEllipse.semimajoraxis, BigEllipse.ellipsecentre.y, 10, 255, 0, 0);\n\tApp->render->DrawCircle(BigEllipse.ellipsecentre.x - BigEllipse.semimajoraxis, BigEllipse.ellipsecentre.y, 10, 255, 0, 0);\n\tApp->render->DrawCircle(BigEllipse.ellipsecentre.x, BigEllipse.ellipsecentre.y + BigEllipse.semiminoraxis, 10, 255, 0, 0);\n\tApp->render->DrawCircle(BigEllipse.ellipsecentre.x, BigEllipse.ellipsecentre.y - BigEllipse.semiminoraxis, 10, 255, 0, 0);\n\t*\/\n\n\t\/\/Debug window with perdformance data\n\tif (App->input->GetKey(SDL_SCANCODE_F9) == KEY_DOWN)\n\t\tf_DebugPerformanceData = !f_DebugPerformanceData;\n\n\tif (App->input->GetKey(SDL_SCANCODE_F10) == KEY_DOWN)\n\t\tShellExecute(NULL, \"open\", \"https:\/\/github.com\/Guille1406\/The-Legend-of-Zelda-Hyrule-Conquest\/issues\", NULL, NULL, SW_SHOWMAXIMIZED);\n\n\tif (f_DebugPerformanceData)\n\t{\n\t\tApp->render->DrawQuad(DebugPerformanceData_Rect, Blue(0), Blue(1), Blue(2), 150, true, true, false);\n\n\t\tfor (uint i = 0; i < DebugPerformanceData.size(); i++)\n\t\t{\n\t\t\tswitch (i)\n\t\t\t{\n\t\t\tcase 0:\n\t\t\t\tstatic char AvFPS[25];\n\t\t\t\tsprintf_s(AvFPS, 25, \"Av.FPS: %.2f\", App->avg_fps);\n\t\t\t\tDebugPerformanceData[i]->EditLabelStr(&std::string(AvFPS));\n\t\t\t\tbreak;\n\t\t\tcase 1:\n\t\t\t\tstatic char LastFrameMs[25];\n\t\t\t\tsprintf_s(LastFrameMs, 25, \"Last Frame Ms: %u\", App->last_frame_ms);\n\t\t\t\tDebugPerformanceData[i]->EditLabelStr(&std::string(LastFrameMs));\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\tstatic char Lastsecframes[25];\n\t\t\t\tsprintf_s(Lastsecframes, 25, \"Last sec frames: %i\", App->frames_on_last_update);\n\t\t\t\tDebugPerformanceData[i]->EditLabelStr(&std::string(Lastsecframes));\n\t\t\t\tbreak;\n\t\t\tcase 3:\n\t\t\t\tstatic char Lastdt[25];\n\t\t\t\tsprintf_s(Lastdt, 25, \"Last dt: %.3f\", App->dt);\n\t\t\t\tDebugPerformanceData[i]->EditLabelStr(&std::string(Lastdt));\n\t\t\t\tbreak;\n\t\t\tcase 4:\n\t\t\t\tstatic char Timesincestartup[100];\n\t\t\t\tsprintf_s(Timesincestartup, 100, \"Time since startup: %.3f\", App->seconds_since_startup);\n\t\t\t\tDebugPerformanceData[i]->EditLabelStr(&std::string(Timesincestartup));\n\t\t\t\tbreak;\n\t\t\tcase 5:\n\t\t\t\tstatic char FrameCount[100];\n\t\t\t\tsprintf_s(FrameCount, 100, \"Frame Count: %lu\", App->frame_count);\n\t\t\t\tDebugPerformanceData[i]->EditLabelStr(&std::string(FrameCount));\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tDebugPerformanceData[i]->Draw();\n\t\t}\n\t}\n\n\treturn true;\n}\n\n\/\/ Called each loop iteration\nbool j1Camera::PostUpdate()\n{\n\treturn true;\n}\n\n\/\/ Called before quitting\nbool j1Camera::CleanUp()\n{\n\tLOG(\"Freeing camera\");\n\n\tfor (std::vector<GuiLabel*>::iterator item = DebugPerformanceData.begin(); item != DebugPerformanceData.cend(); ++item)\n\t\tRELEASE(*item);\n\n\treturn true;\n}\n\nvoid j1Camera::OnGui(Gui* ui, GuiEvent event)\n{\n\n}\n\nvoid j1Camera::OnConsoleCommand(const Command* command, const std::vector<std::string>& commandarguments)\n{\n\n}\n\nvoid j1Camera::OnConsoleCVar(const CVar* cvar)\n{\n\n}<commit_msg>Camera position fix<commit_after>#include \"j1App.h\"\n#include \"j1Render.h\"\n#include \"p2Log.h\"\n#include \"j1Camera.h\"\n#include \"j1Player.h\"\n#include \"j1Window.h\"\n#include \"Color.h\"\n#include \"GuiLabel.h\"\n\nj1Camera::j1Camera()\n{\n\tname = \"camera\";\n}\n\nj1Camera::~j1Camera()\n{\n\n}\n\n\/\/ Called before render is available\nbool j1Camera::Awake(pugi::xml_node&)\n{\n\t\/\/Create the ellipses\n\tLitleEllipse.ellipsecentre = { 0,0 };\n\tLitleEllipse.semimajoraxis = 160;\n\tLitleEllipse.semiminoraxis = 90;\n\n\tBigEllipse.ellipsecentre = { 0,0 };\n\tBigEllipse.semimajoraxis = 320;\n\tBigEllipse.semiminoraxis = 180;\n\n\tf_border_between_ellipses = BigEllipse.InsideEllipseValue({ 0,LitleEllipse.semiminoraxis});\n\n\tDebugPerformanceData_Rect = { 0,0,260,150 };\n\n\treturn true;\n}\n\n\/\/ Called before the first frame\nbool j1Camera::Start()\n{\n\t\/\/Get some useful variables\n\tf_Max_scale = App->win->scale;\n\tf_Min_scale = f_Max_scale - 0.3f;\n\tif (f_Min_scale < 0.8f)\n\t\tf_Min_scale = 0.8f;\n\tint w = 0, h = 0;\n\tSDL_GetRendererOutputSize(App->render->renderer, &w, &h);\n\ti_Half_w = (int)(w * 0.5f);\n\ti_Half_h = (int)(h * 0.5f);\n\n\t\/\/Fill up debug performance data vector\n\tfor (int i = 0, pos = App->win->GetWindowH() - DebugPerformanceData_Rect.h + 6; i < 9; i++, pos += 15) \/\/9, number of debug strings\n\t\tDebugPerformanceData.push_back(App->gui->CreateLabel({ 10,pos }, &std::string(\"\"), false, AddGuiTo::none));\n\tDebugPerformanceData[6]->EditLabelStr(&std::string(\"Press F9 to toggle this window visibility.\"));\n\tDebugPerformanceData[6]->SetLabelColor(&Yellow);\n\tDebugPerformanceData[7]->EditLabelStr(&std::string(\"Press F10 to report a bug.\"));\n\tDebugPerformanceData[7]->SetLabelColor(&Yellow);\n\tDebugPerformanceData[8]->EditLabelStr(&std::string(\"Press F11 to take a screenshot.\"));\n\tDebugPerformanceData[8]->SetLabelColor(&Yellow);\n\n\treturn true;\n}\n\n\/\/ Called each loop iteration\nbool j1Camera::PreUpdate()\n{\n\t\/\/Calculate camera centre\n\t\n\tfloat Scale = App->win->GetScale();\n\tiPoint Centre = { 0,0 };\n\tCentre.x = (int)((((float)(App->player->Link->pos.x + App->player->Zelda->pos.x)) * 0.5f));\n\tCentre.y = (int)((((float)(App->player->Link->pos.y + App->player->Zelda->pos.y)) * 0.5f));\n\t\n\t\/\/Camera position\n\tApp->render->camera.x = (int)(-Centre.x * Scale + i_Half_w);\n\tApp->render->camera.y = (int)(-Centre.y * Scale + i_Half_h);\n\n\tif(App->render->camera.x >= 0)\n\t\tApp->render->camera.x = 0;\n\tif (-App->render->camera.x >= App->map->data.width * App->map->data.tile_width * Scale - App->render->camera.w)\n\t\tApp->render->camera.x = (int)(-(App->map->data.width * App->map->data.tile_width * Scale - App->render->camera.w));\n\n\tif (App->render->camera.y >= 0)\n\t\tApp->render->camera.y = 0;\n\tif (-App->render->camera.y >= App->map->data.height * App->map->data.tile_height * Scale - App->render->camera.h)\n\t\tApp->render->camera.y = (int)(-(App->map->data.height * App->map->data.tile_height * Scale - App->render->camera.h));\n\n\t\/\/Ellipss centre\n\tiPoint CentrePos = { 0,0 };\n\tCentrePos = App->render->WorldToScreen(Centre.x, Centre.y);\n\tLitleEllipse.ellipsecentre = BigEllipse.ellipsecentre = { (int)(CentrePos.x), (int)(CentrePos.y) };\n\n\t\/\/Debug Performance Data\n\tDebugPerformanceData_Rect.x = -App->render->camera.x;\n\tDebugPerformanceData_Rect.y = -App->render->camera.y + App->win->GetWindowH() - DebugPerformanceData_Rect.h;\n\treturn true;\n}\n\n\/\/ Called each loop iteration\nbool j1Camera::Update(float dt)\n{\n\tiPoint LinkPos = { 0,0 };\n\tLinkPos = App->render->WorldToScreen(App->player->Link->pos.x, App->player->Link->pos.y);\n\t\/**\/\n\t\/\/Is inside the little ellipse\n\tif (LitleEllipse.InsideEllipse(LinkPos))\n\t\tApp->win->scale = f_Max_scale;\n\t\/\/Is out the little ellipse\n\telse\n\t{\n\t\t\/\/Is between the big ellipse and the little one\n\t\tif (BigEllipse.InsideEllipse(LinkPos))\n\t\t{\n\t\t\t\/\/Scale between f_Max_scale and f_Min_scale\n\t\t\tfloat f_percentual_value = (((float)(BigEllipse.InsideEllipseValue(LinkPos) - f_border_between_ellipses)) \/ ((float)(1.0f - f_border_between_ellipses))) * 100.0f;\n\t\t\tfloat f_invert_percentual_value = 100.0f - f_percentual_value;\n\t\t\tif (f_invert_percentual_value < 0.0f)\n\t\t\t\tf_invert_percentual_value = 0.0f;\n\t\t\telse if (f_invert_percentual_value > 100.0f)\n\t\t\t\tf_invert_percentual_value = 100.0f;\n\t\t\tApp->win->scale = (((f_Max_scale - f_Min_scale) * f_invert_percentual_value) \/ (100.0f)) + f_Min_scale;\n\t\t}\n\t\t\/\/Is out the big ellipse\n\t\telse\n\t\t\tApp->win->scale = f_Min_scale;\n\t}\n\t\/**\/\n\n\t\/\/Some ellipses debug draw for testing\n\t\/*\n\t\/\/Little ellipse\n\t\/\/Centre\n\tApp->render->DrawCircle(LitleEllipse.ellipsecentre.x, LitleEllipse.ellipsecentre.y, 5, 0, 0, 255);\n\t\/\/Axis\n\tApp->render->DrawCircle(LitleEllipse.ellipsecentre.x + LitleEllipse.semimajoraxis, LitleEllipse.ellipsecentre.y, 5, 0, 0, 255);\n\tApp->render->DrawCircle(LitleEllipse.ellipsecentre.x - LitleEllipse.semimajoraxis, LitleEllipse.ellipsecentre.y, 5, 0, 0, 255);\n\tApp->render->DrawCircle(LitleEllipse.ellipsecentre.x, LitleEllipse.ellipsecentre.y + LitleEllipse.semiminoraxis, 5, 0, 0, 255);\n\tApp->render->DrawCircle(LitleEllipse.ellipsecentre.x, LitleEllipse.ellipsecentre.y - LitleEllipse.semiminoraxis, 5, 0, 0, 255);\n\n\t\/\/Big ellipse\n\t\/\/Centre\n\tApp->render->DrawCircle(BigEllipse.ellipsecentre.x, BigEllipse.ellipsecentre.y, 10, 255, 0, 0);\n\t\/\/Axis\n\tApp->render->DrawCircle(BigEllipse.ellipsecentre.x + BigEllipse.semimajoraxis, BigEllipse.ellipsecentre.y, 10, 255, 0, 0);\n\tApp->render->DrawCircle(BigEllipse.ellipsecentre.x - BigEllipse.semimajoraxis, BigEllipse.ellipsecentre.y, 10, 255, 0, 0);\n\tApp->render->DrawCircle(BigEllipse.ellipsecentre.x, BigEllipse.ellipsecentre.y + BigEllipse.semiminoraxis, 10, 255, 0, 0);\n\tApp->render->DrawCircle(BigEllipse.ellipsecentre.x, BigEllipse.ellipsecentre.y - BigEllipse.semiminoraxis, 10, 255, 0, 0);\n\t*\/\n\n\t\/\/Debug window with perdformance data\n\tif (App->input->GetKey(SDL_SCANCODE_F9) == KEY_DOWN)\n\t\tf_DebugPerformanceData = !f_DebugPerformanceData;\n\n\tif (App->input->GetKey(SDL_SCANCODE_F10) == KEY_DOWN)\n\t\tShellExecute(NULL, \"open\", \"https:\/\/github.com\/Guille1406\/The-Legend-of-Zelda-Hyrule-Conquest\/issues\", NULL, NULL, SW_SHOWMAXIMIZED);\n\n\tif (f_DebugPerformanceData)\n\t{\n\t\tApp->render->DrawQuad(DebugPerformanceData_Rect, Blue(0), Blue(1), Blue(2), 150, true, true, false);\n\n\t\tfor (uint i = 0; i < DebugPerformanceData.size(); i++)\n\t\t{\n\t\t\tswitch (i)\n\t\t\t{\n\t\t\tcase 0:\n\t\t\t\tstatic char AvFPS[25];\n\t\t\t\tsprintf_s(AvFPS, 25, \"Av.FPS: %.2f\", App->avg_fps);\n\t\t\t\tDebugPerformanceData[i]->EditLabelStr(&std::string(AvFPS));\n\t\t\t\tbreak;\n\t\t\tcase 1:\n\t\t\t\tstatic char LastFrameMs[25];\n\t\t\t\tsprintf_s(LastFrameMs, 25, \"Last Frame Ms: %u\", App->last_frame_ms);\n\t\t\t\tDebugPerformanceData[i]->EditLabelStr(&std::string(LastFrameMs));\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\tstatic char Lastsecframes[25];\n\t\t\t\tsprintf_s(Lastsecframes, 25, \"Last sec frames: %i\", App->frames_on_last_update);\n\t\t\t\tDebugPerformanceData[i]->EditLabelStr(&std::string(Lastsecframes));\n\t\t\t\tbreak;\n\t\t\tcase 3:\n\t\t\t\tstatic char Lastdt[25];\n\t\t\t\tsprintf_s(Lastdt, 25, \"Last dt: %.3f\", App->dt);\n\t\t\t\tDebugPerformanceData[i]->EditLabelStr(&std::string(Lastdt));\n\t\t\t\tbreak;\n\t\t\tcase 4:\n\t\t\t\tstatic char Timesincestartup[100];\n\t\t\t\tsprintf_s(Timesincestartup, 100, \"Time since startup: %.3f\", App->seconds_since_startup);\n\t\t\t\tDebugPerformanceData[i]->EditLabelStr(&std::string(Timesincestartup));\n\t\t\t\tbreak;\n\t\t\tcase 5:\n\t\t\t\tstatic char FrameCount[100];\n\t\t\t\tsprintf_s(FrameCount, 100, \"Frame Count: %lu\", App->frame_count);\n\t\t\t\tDebugPerformanceData[i]->EditLabelStr(&std::string(FrameCount));\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tDebugPerformanceData[i]->Draw();\n\t\t}\n\t}\n\n\treturn true;\n}\n\n\/\/ Called each loop iteration\nbool j1Camera::PostUpdate()\n{\n\treturn true;\n}\n\n\/\/ Called before quitting\nbool j1Camera::CleanUp()\n{\n\tLOG(\"Freeing camera\");\n\n\tfor (std::vector<GuiLabel*>::iterator item = DebugPerformanceData.begin(); item != DebugPerformanceData.cend(); ++item)\n\t\tRELEASE(*item);\n\n\treturn true;\n}\n\nvoid j1Camera::OnGui(Gui* ui, GuiEvent event)\n{\n\n}\n\nvoid j1Camera::OnConsoleCommand(const Command* command, const std::vector<std::string>& commandarguments)\n{\n\n}\n\nvoid j1Camera::OnConsoleCVar(const CVar* cvar)\n{\n\n}<|endoftext|>"}
{"text":"<commit_before>#include \"mitkClaronTrackingDevice.h\"\n#include \"mitkClaronTool.h\"\n#include \"mitkIGTConfig.h\"\n#include <itksys\/SystemTools.hxx>\n#include <iostream>\n\n\n\nmitk::ClaronTrackingDevice::~ClaronTrackingDevice()\n{\n}\n\n\nbool mitk::ClaronTrackingDevice::AddTool(ClaronTool::Pointer tool)\n{\n  m_AllTools.push_back(tool);\n  return true;\n}\n\n\nstd::vector<mitk::ClaronTool::Pointer> mitk::ClaronTrackingDevice::DetectTools()\n{\n  std::vector<mitk::ClaronTool::Pointer> returnValue;\n  std::vector<claronToolHandle> allHandles = m_Device->GetAllActiveTools();\n  for (std::vector<claronToolHandle>::iterator iter = allHandles.begin(); iter != allHandles.end(); ++iter)\n  {\n    ClaronTool::Pointer neu = ClaronTool::New();\n    neu->SetToolName(m_Device->GetName(*iter));\n    neu->SetCalibrationName(m_Device->GetName(*iter));\n    neu->SetToolHandle(*iter);\n    returnValue.push_back(neu);\n  }\n  return returnValue;\n}\n\nmitk::ClaronTrackingDevice::ClaronTrackingDevice(void)\n{\n  \/\/set the type of this tracking device\n  this->m_Type = ClaronMicron;\n\n  \/\/set the tracking volume\n  this->m_TrackingVolume->SetTrackingDeviceType(this->m_Type);\n\n  this->m_MultiThreader = itk::MultiThreader::New();\n\n  \/\/############################# standard directories (from cmake) ##################################\n  if (m_Device->IsMicronTrackerInstalled())\n    {\n    #ifdef MITK_MICRON_TRACKER_TEMP_DIR\n    m_ToolfilesDir = std::string(MITK_MICRON_TRACKER_TEMP_DIR);\n    #endif\n    #ifdef MITK_MICRON_TRACKER_TEMP_DIR\n    m_CalibrationDir = std::string(MITK_MICRON_TRACKER_CALIBRATION_DIR);\n    #endif\n    }\n  else\n    {\n    m_ToolfilesDir = \"Error - No Microntracker installed\";\n    m_CalibrationDir = \"Error - No Microntracker installed\";\n    }\n  \/\/##################################################################################################\n}\n\n\n\nbool mitk::ClaronTrackingDevice::StartTracking()\n{\n\n  \/\/By Alfred: next line because no temp directory is set if MicronTracker is not installed\n  if (!m_Device->IsMicronTrackerInstalled()) return false;\n  \/\/##################################################################################\n\n  \/\/copy all toolfiles into the temp directory\n  for (unsigned int i=0; i<m_AllTools.size(); i++)\n  {\n    itksys::SystemTools::CopyAFile(m_AllTools[i]->GetFile(), m_ToolfilesDir.c_str());\n  }\n  this->SetMode(Tracking);            \/\/ go to mode Tracking\n  this->m_StopTrackingMutex->Lock();  \/\/ update the local copy of m_StopTracking\n  this->m_StopTracking = false;\n  this->m_StopTrackingMutex->Unlock();\n\n  \/\/restart the Microntracker, so that it will load the new tool files\n  m_Device->StopTracking();\n  delete m_Device;\n\n  m_Device = new ClaronInterface(m_CalibrationDir, m_ToolfilesDir);\n  if (m_Device->StartTracking())\n    {\n    m_ThreadID = m_MultiThreader->SpawnThread(this->ThreadStartTracking, this);    \/\/ start a new thread that executes the TrackTools() method\n    return true;\n    }\n  else return false;\n}\n\n\nbool mitk::ClaronTrackingDevice::StopTracking()\n{\n  if (this->GetMode() == Tracking) \/\/ Only if the object is in the correct state\n  {\n    m_StopTrackingMutex->Lock();  \/\/ m_StopTracking is used by two threads, so we have to ensure correct thread handling\n    m_StopTracking = true;\n    m_StopTrackingMutex->Unlock();\n    this->SetMode(Ready);\n  }\n\n  m_TrackingFinishedMutex->Lock();\n\n  \/\/delete all files in the tool files directory\n  itksys::SystemTools::RemoveADirectory(m_ToolfilesDir.c_str());\n  itksys::SystemTools::MakeDirectory(m_ToolfilesDir.c_str());\n\n  return true;\n}\n\n\nunsigned int mitk::ClaronTrackingDevice::GetToolCount() const\n{\n  return (unsigned int)this->m_AllTools.size();\n}\n\n\nmitk::TrackingTool* mitk::ClaronTrackingDevice::GetTool(unsigned int toolNumber)\n{\n  if ( toolNumber >= this->GetToolCount())\n    return NULL;\n  else\n    return this->m_AllTools[toolNumber];\n}\n\n\nbool mitk::ClaronTrackingDevice::OpenConnection()\n{\n  bool returnValue;\n  \/\/Create the temp directory\n  itksys::SystemTools::MakeDirectory(m_ToolfilesDir.c_str());\n\n  m_Device = new ClaronInterface(m_CalibrationDir, m_ToolfilesDir);\n  returnValue = m_Device->StartTracking();\n\n  if (returnValue)\n  {\n    this->SetMode(Ready);\n  }\n  else\n  {\n    \/\/reset everything\n    if(m_Device == NULL)\n      m_Device = new ClaronInterface(m_CalibrationDir, m_ToolfilesDir);\n    m_Device->StopTracking();\n    delete m_Device;\n    this->SetMode(Setup);\n  }\n  return returnValue;\n}\n\n\nbool mitk::ClaronTrackingDevice::CloseConnection()\n{\n  bool returnValue = true;\n  if(this->GetMode() == Setup)\n    return true;\n\n  returnValue = m_Device->StopTracking();\n  delete m_Device;\n\n  \/\/delete the temporary directory\n  itksys::SystemTools::RemoveADirectory(m_ToolfilesDir.c_str());\n\n  this->SetMode(Setup);\n  return returnValue;\n}\n\n\nmitk::ClaronInterface* mitk::ClaronTrackingDevice::GetDevice()\n{\n  return m_Device;\n}\n\n\nstd::vector<mitk::ClaronTool::Pointer> mitk::ClaronTrackingDevice::GetAllTools()\n{\n  return this->m_AllTools;\n}\n\n\nvoid mitk::ClaronTrackingDevice::TrackTools()\n{\n  try\n  {\n    while (this->GetMode() == Tracking)\n    {\n      this->GetDevice()->GrabFrame();\n\n      std::vector<mitk::ClaronTool::Pointer> detectedTools = this->DetectTools();\n      std::vector<mitk::ClaronTool::Pointer> allTools = this->GetAllTools();\n      std::vector<mitk::ClaronTool::Pointer>::iterator itAllTools;\n      for(itAllTools = allTools.begin(); itAllTools != allTools.end(); itAllTools++)\n      {\n        mitk::ClaronTool::Pointer currentTool = *itAllTools;\n\n        \/\/test if current tool was detected\n        std::vector<mitk::ClaronTool::Pointer>::iterator itDetectedTools;\n        bool foundTool = false;\n        for(itDetectedTools = detectedTools.begin(); itDetectedTools != detectedTools.end(); itDetectedTools++)\n        {\n          mitk::ClaronTool::Pointer aktuDet = *itDetectedTools;\n          std::string tempString(currentTool->GetCalibrationName());\n          if (tempString.compare(aktuDet->GetCalibrationName())==0)\n          {\n            currentTool->SetToolHandle(aktuDet->GetToolHandle());\n            foundTool = true;\n          }\n        }\n        if (!foundTool)\n        {\n          currentTool->SetToolHandle(0);\n        }\n\n        if (currentTool->GetToolHandle() != 0)\n        {\n          \/\/get tip position of tool:\n          std::vector<double> pos = this->GetDevice()->GetTipPosition(currentTool->GetToolHandle());\n          \/\/write tip position into tool:\n          currentTool->SetPosition(pos[0], pos[1], pos[2]);\n          \/\/get tip quaternion of tool\n          std::vector<double> quat = this->GetDevice()->GetTipQuaternions(currentTool->GetToolHandle());\n          \/\/write tip quaternion into tool\n          currentTool->SetQuaternion(quat[0], quat[1], quat[2], quat[3]);\n        }\n        else\n        {\n          currentTool->SetPosition(0,0,0);\n          currentTool->SetQuaternion(0,0,0,0);\n          currentTool->SetDataValid(false);\n        }\n      }\n    }\n  }\n  catch(...)\n  {\n    this->StopTracking();\n    this->SetErrorMessage(\"Error while trying to track tools. Thread stopped.\");\n  }\n}\n\n\nbool mitk::ClaronTrackingDevice::IsMicronTrackerInstalled()\n{\n  return this->m_Device->IsMicronTrackerInstalled();\n}\n\n\nITK_THREAD_RETURN_TYPE mitk::ClaronTrackingDevice::ThreadStartTracking(void* pInfoStruct)\n{\n  \/* extract this pointer from Thread Info structure *\/\n  struct itk::MultiThreader::ThreadInfoStruct * pInfo = (struct itk::MultiThreader::ThreadInfoStruct*)pInfoStruct;\n  if (pInfo == NULL)\n  {\n    return ITK_THREAD_RETURN_VALUE;\n  }\n  if (pInfo->UserData == NULL)\n  {\n    return ITK_THREAD_RETURN_VALUE;\n  }\n  ClaronTrackingDevice *trackingDevice = (ClaronTrackingDevice*)pInfo->UserData;\n\n  if (trackingDevice != NULL)\n    trackingDevice->TrackTools();\n\n  return ITK_THREAD_RETURN_VALUE;\n}<commit_msg>COMP: Corrected Error in mitkClaronTrackingDevice.cpp<commit_after>#include \"mitkClaronTrackingDevice.h\"\n#include \"mitkClaronTool.h\"\n#include \"mitkIGTConfig.h\"\n#include <itksys\/SystemTools.hxx>\n#include <iostream>\n\n\n\nmitk::ClaronTrackingDevice::~ClaronTrackingDevice()\n{\n}\n\n\nbool mitk::ClaronTrackingDevice::AddTool(ClaronTool::Pointer tool)\n{\n  m_AllTools.push_back(tool);\n  return true;\n}\n\n\nstd::vector<mitk::ClaronTool::Pointer> mitk::ClaronTrackingDevice::DetectTools()\n{\n  std::vector<mitk::ClaronTool::Pointer> returnValue;\n  std::vector<claronToolHandle> allHandles = m_Device->GetAllActiveTools();\n  for (std::vector<claronToolHandle>::iterator iter = allHandles.begin(); iter != allHandles.end(); ++iter)\n  {\n    ClaronTool::Pointer neu = ClaronTool::New();\n    neu->SetToolName(m_Device->GetName(*iter));\n    neu->SetCalibrationName(m_Device->GetName(*iter));\n    neu->SetToolHandle(*iter);\n    returnValue.push_back(neu);\n  }\n  return returnValue;\n}\n\nmitk::ClaronTrackingDevice::ClaronTrackingDevice(void)\n{\n  \/\/set the type of this tracking device\n  this->m_Type = ClaronMicron;\n\n  \/\/set the tracking volume\n  this->m_TrackingVolume->SetTrackingDeviceType(this->m_Type);\n\n  this->m_MultiThreader = itk::MultiThreader::New();\n\n  \/\/############################# standard directories (from cmake) ##################################\n  if (m_Device->IsMicronTrackerInstalled())\n    {\n    #ifdef MITK_MICRON_TRACKER_TEMP_DIR\n    m_ToolfilesDir = std::string(MITK_MICRON_TRACKER_TEMP_DIR);\n    #endif\n    #ifdef MITK_MICRON_TRACKER_CALIBRATION_DIR\n    m_CalibrationDir = std::string(MITK_MICRON_TRACKER_CALIBRATION_DIR);\n    #endif\n    }\n  else\n    {\n    m_ToolfilesDir = \"Error - No Microntracker installed\";\n    m_CalibrationDir = \"Error - No Microntracker installed\";\n    }\n  \/\/##################################################################################################\n}\n\n\n\nbool mitk::ClaronTrackingDevice::StartTracking()\n{\n\n  \/\/By Alfred: next line because no temp directory is set if MicronTracker is not installed\n  if (!m_Device->IsMicronTrackerInstalled()) return false;\n  \/\/##################################################################################\n\n  \/\/copy all toolfiles into the temp directory\n  for (unsigned int i=0; i<m_AllTools.size(); i++)\n  {\n    itksys::SystemTools::CopyAFile(m_AllTools[i]->GetFile(), m_ToolfilesDir.c_str());\n  }\n  this->SetMode(Tracking);            \/\/ go to mode Tracking\n  this->m_StopTrackingMutex->Lock();  \/\/ update the local copy of m_StopTracking\n  this->m_StopTracking = false;\n  this->m_StopTrackingMutex->Unlock();\n\n  \/\/restart the Microntracker, so that it will load the new tool files\n  m_Device->StopTracking();\n  delete m_Device;\n\n  m_Device = new ClaronInterface(m_CalibrationDir, m_ToolfilesDir);\n  if (m_Device->StartTracking())\n    {\n    m_ThreadID = m_MultiThreader->SpawnThread(this->ThreadStartTracking, this);    \/\/ start a new thread that executes the TrackTools() method\n    return true;\n    }\n  else return false;\n}\n\n\nbool mitk::ClaronTrackingDevice::StopTracking()\n{\n  if (this->GetMode() == Tracking) \/\/ Only if the object is in the correct state\n  {\n    m_StopTrackingMutex->Lock();  \/\/ m_StopTracking is used by two threads, so we have to ensure correct thread handling\n    m_StopTracking = true;\n    m_StopTrackingMutex->Unlock();\n    this->SetMode(Ready);\n  }\n\n  m_TrackingFinishedMutex->Lock();\n\n  \/\/delete all files in the tool files directory\n  itksys::SystemTools::RemoveADirectory(m_ToolfilesDir.c_str());\n  itksys::SystemTools::MakeDirectory(m_ToolfilesDir.c_str());\n\n  return true;\n}\n\n\nunsigned int mitk::ClaronTrackingDevice::GetToolCount() const\n{\n  return (unsigned int)this->m_AllTools.size();\n}\n\n\nmitk::TrackingTool* mitk::ClaronTrackingDevice::GetTool(unsigned int toolNumber)\n{\n  if ( toolNumber >= this->GetToolCount())\n    return NULL;\n  else\n    return this->m_AllTools[toolNumber];\n}\n\n\nbool mitk::ClaronTrackingDevice::OpenConnection()\n{\n  bool returnValue;\n  \/\/Create the temp directory\n  itksys::SystemTools::MakeDirectory(m_ToolfilesDir.c_str());\n\n  m_Device = new ClaronInterface(m_CalibrationDir, m_ToolfilesDir);\n  returnValue = m_Device->StartTracking();\n\n  if (returnValue)\n  {\n    this->SetMode(Ready);\n  }\n  else\n  {\n    \/\/reset everything\n    if(m_Device == NULL)\n      m_Device = new ClaronInterface(m_CalibrationDir, m_ToolfilesDir);\n    m_Device->StopTracking();\n    delete m_Device;\n    this->SetMode(Setup);\n  }\n  return returnValue;\n}\n\n\nbool mitk::ClaronTrackingDevice::CloseConnection()\n{\n  bool returnValue = true;\n  if(this->GetMode() == Setup)\n    return true;\n\n  returnValue = m_Device->StopTracking();\n  delete m_Device;\n\n  \/\/delete the temporary directory\n  itksys::SystemTools::RemoveADirectory(m_ToolfilesDir.c_str());\n\n  this->SetMode(Setup);\n  return returnValue;\n}\n\n\nmitk::ClaronInterface* mitk::ClaronTrackingDevice::GetDevice()\n{\n  return m_Device;\n}\n\n\nstd::vector<mitk::ClaronTool::Pointer> mitk::ClaronTrackingDevice::GetAllTools()\n{\n  return this->m_AllTools;\n}\n\n\nvoid mitk::ClaronTrackingDevice::TrackTools()\n{\n  try\n  {\n    while (this->GetMode() == Tracking)\n    {\n      this->GetDevice()->GrabFrame();\n\n      std::vector<mitk::ClaronTool::Pointer> detectedTools = this->DetectTools();\n      std::vector<mitk::ClaronTool::Pointer> allTools = this->GetAllTools();\n      std::vector<mitk::ClaronTool::Pointer>::iterator itAllTools;\n      for(itAllTools = allTools.begin(); itAllTools != allTools.end(); itAllTools++)\n      {\n        mitk::ClaronTool::Pointer currentTool = *itAllTools;\n\n        \/\/test if current tool was detected\n        std::vector<mitk::ClaronTool::Pointer>::iterator itDetectedTools;\n        bool foundTool = false;\n        for(itDetectedTools = detectedTools.begin(); itDetectedTools != detectedTools.end(); itDetectedTools++)\n        {\n          mitk::ClaronTool::Pointer aktuDet = *itDetectedTools;\n          std::string tempString(currentTool->GetCalibrationName());\n          if (tempString.compare(aktuDet->GetCalibrationName())==0)\n          {\n            currentTool->SetToolHandle(aktuDet->GetToolHandle());\n            foundTool = true;\n          }\n        }\n        if (!foundTool)\n        {\n          currentTool->SetToolHandle(0);\n        }\n\n        if (currentTool->GetToolHandle() != 0)\n        {\n          \/\/get tip position of tool:\n          std::vector<double> pos = this->GetDevice()->GetTipPosition(currentTool->GetToolHandle());\n          \/\/write tip position into tool:\n          currentTool->SetPosition(pos[0], pos[1], pos[2]);\n          \/\/get tip quaternion of tool\n          std::vector<double> quat = this->GetDevice()->GetTipQuaternions(currentTool->GetToolHandle());\n          \/\/write tip quaternion into tool\n          currentTool->SetQuaternion(quat[0], quat[1], quat[2], quat[3]);\n        }\n        else\n        {\n          currentTool->SetPosition(0,0,0);\n          currentTool->SetQuaternion(0,0,0,0);\n          currentTool->SetDataValid(false);\n        }\n      }\n    }\n  }\n  catch(...)\n  {\n    this->StopTracking();\n    this->SetErrorMessage(\"Error while trying to track tools. Thread stopped.\");\n  }\n}\n\n\nbool mitk::ClaronTrackingDevice::IsMicronTrackerInstalled()\n{\n  return this->m_Device->IsMicronTrackerInstalled();\n}\n\n\nITK_THREAD_RETURN_TYPE mitk::ClaronTrackingDevice::ThreadStartTracking(void* pInfoStruct)\n{\n  \/* extract this pointer from Thread Info structure *\/\n  struct itk::MultiThreader::ThreadInfoStruct * pInfo = (struct itk::MultiThreader::ThreadInfoStruct*)pInfoStruct;\n  if (pInfo == NULL)\n  {\n    return ITK_THREAD_RETURN_VALUE;\n  }\n  if (pInfo->UserData == NULL)\n  {\n    return ITK_THREAD_RETURN_VALUE;\n  }\n  ClaronTrackingDevice *trackingDevice = (ClaronTrackingDevice*)pInfo->UserData;\n\n  if (trackingDevice != NULL)\n    trackingDevice->TrackTools();\n\n  return ITK_THREAD_RETURN_VALUE;\n}<|endoftext|>"}
{"text":"<commit_before>\/\/===-- Internalize.cpp - Mark functions internal -------------------------===\/\/\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 loops over all of the functions in the input module, looking for a\n\/\/ main function.  If a main function is found, all other functions and all\n\/\/ global variables with initializers are marked as internal.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Transforms\/IPO.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/ADT\/Statistic.h\"\n#include <fstream>\n#include <iostream>\n#include <set>\nusing namespace llvm;\n\nnamespace {\n  Statistic<> NumFunctions(\"internalize\", \"Number of functions internalized\");\n  Statistic<> NumGlobals  (\"internalize\", \"Number of global vars internalized\");\n\n  \/\/ APIFile - A file which contains a list of symbols that should not be marked\n  \/\/ external.\n  cl::opt<std::string>\n  APIFile(\"internalize-public-api-file\", cl::value_desc(\"filename\"),\n          cl::desc(\"A file containing list of symbol names to preserve\"));\n\n  \/\/ APIList - A list of symbols that should not be marked internal.\n  cl::list<std::string>\n  APIList(\"internalize-public-api-list\", cl::value_desc(\"list\"),\n          cl::desc(\"A list of symbol names to preserve\"),\n          cl::CommaSeparated);\n\n  class InternalizePass : public ModulePass {\n    std::set<std::string> ExternalNames;\n    bool DontInternalize;\n  public:\n    InternalizePass(bool InternalizeEverything = true);\n    InternalizePass(const std::vector <const char *>& exportList);\n    void LoadFile(const char *Filename);\n    virtual bool runOnModule(Module &M);\n  };\n  RegisterPass<InternalizePass> X(\"internalize\", \"Internalize Global Symbols\");\n} \/\/ end anonymous namespace\n\nInternalizePass::InternalizePass(bool InternalizeEverything) \n  : DontInternalize(false){\n  if (!APIFile.empty())           \/\/ If a filename is specified, use it\n    LoadFile(APIFile.c_str());\n  else if (!APIList.empty())      \/\/ Else, if a list is specified, use it.\n    ExternalNames.insert(APIList.begin(), APIList.end());\n  else if (!InternalizeEverything)\n    \/\/ Finally, if we're allowed to, internalize all but main.\n    DontInternalize = true;\n}\n\nInternalizePass::InternalizePass(const std::vector<const char *>&exportList) {\n  for(std::vector<const char *>::const_iterator itr = exportList.begin();\n\titr != exportList.end(); itr++) {\n    ExternalNames.insert(*itr);\n  }\n}\n\nvoid InternalizePass::LoadFile(const char *Filename) {\n  \/\/ Load the APIFile...\n  std::ifstream In(Filename);\n  if (!In.good()) {\n    std::cerr << \"WARNING: Internalize couldn't load file '\" << Filename\n    << \"'!\\n\";\n    return;   \/\/ Do not internalize anything...\n  }\n  while (In) {\n    std::string Symbol;\n    In >> Symbol;\n    if (!Symbol.empty())\n      ExternalNames.insert(Symbol);\n  }\n}\n\nbool InternalizePass::runOnModule(Module &M) {\n  if (DontInternalize) return false;\n  \n  \/\/ If no list or file of symbols was specified, check to see if there is a\n  \/\/ \"main\" symbol defined in the module.  If so, use it, otherwise do not\n  \/\/ internalize the module, it must be a library or something.\n  \/\/\n  if (ExternalNames.empty()) {\n    Function *MainFunc = M.getMainFunction();\n    if (MainFunc == 0 || MainFunc->isExternal())\n      return false;  \/\/ No main found, must be a library...\n    \n    \/\/ Preserve main, internalize all else.\n    ExternalNames.insert(MainFunc->getName());\n  }\n  \n  bool Changed = false;\n  \n  \/\/ Found a main function, mark all functions not named main as internal.\n  for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)\n    if (!I->isExternal() &&         \/\/ Function must be defined here\n        !I->hasInternalLinkage() &&  \/\/ Can't already have internal linkage\n        !ExternalNames.count(I->getName())) {\/\/ Not marked to keep external?\n      I->setLinkage(GlobalValue::InternalLinkage);\n      Changed = true;\n      ++NumFunctions;\n      DEBUG(std::cerr << \"Internalizing func \" << I->getName() << \"\\n\");\n    }\n  \n  \/\/ Never internalize the llvm.used symbol.  It is used to implement\n  \/\/ attribute((used)).\n  ExternalNames.insert(\"llvm.used\");\n  \n  \/\/ Never internalize anchors used by the debugger, else the debugger won't\n  \/\/ find them.  (see MachineDebugInfo.)\n  ExternalNames.insert(\"llvm.dbg.compile_units\");\n  ExternalNames.insert(\"llvm.dbg.global_variables\");\n  ExternalNames.insert(\"llvm.dbg.subprograms\");\n      \n  \/\/ Mark all global variables with initializers as internal as well.\n  for (Module::global_iterator I = M.global_begin(), E = M.global_end();\n       I != E; ++I)\n    if (!I->isExternal() && !I->hasInternalLinkage() &&\n        !ExternalNames.count(I->getName())) {\n      \/\/ Special case handling of the global ctor and dtor list.  When we\n      \/\/ internalize it, we mark it constant, which allows elimination of\n      \/\/ the list if it's empty.\n      \/\/\n      if (I->hasAppendingLinkage() && (I->getName() == \"llvm.global_ctors\" ||\n                                       I->getName() == \"llvm.global_dtors\")) {\n        \/\/ If the global ctors\/dtors list has no uses, do not internalize it, as\n        \/\/ there is no __main in this program, so the asmprinter should handle\n        \/\/ it.\n        if (I->use_empty()) continue;\n \n        \/\/ Otherwise, also mark the list constant, as we know that it will not\n        \/\/ be mutated any longer, and the makes simple IPO xforms automatically\n        \/\/ better.\n        I->setConstant(true);\n      }\n      \n      I->setLinkage(GlobalValue::InternalLinkage);\n      Changed = true;\n      ++NumGlobals;\n      DEBUG(std::cerr << \"Internalized gvar \" << I->getName() << \"\\n\");\n    }\n      \n  return Changed;\n}\n\nModulePass *llvm::createInternalizePass(bool InternalizeEverything) {\n  return new InternalizePass(InternalizeEverything);\n}\n\nModulePass *llvm::createInternalizePass(const std::vector <const char *> &el) {\n  return new InternalizePass(el);\n}\n<commit_msg>Initialize DontInternalize.<commit_after>\/\/===-- Internalize.cpp - Mark functions internal -------------------------===\/\/\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 loops over all of the functions in the input module, looking for a\n\/\/ main function.  If a main function is found, all other functions and all\n\/\/ global variables with initializers are marked as internal.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Transforms\/IPO.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/ADT\/Statistic.h\"\n#include <fstream>\n#include <iostream>\n#include <set>\nusing namespace llvm;\n\nnamespace {\n  Statistic<> NumFunctions(\"internalize\", \"Number of functions internalized\");\n  Statistic<> NumGlobals  (\"internalize\", \"Number of global vars internalized\");\n\n  \/\/ APIFile - A file which contains a list of symbols that should not be marked\n  \/\/ external.\n  cl::opt<std::string>\n  APIFile(\"internalize-public-api-file\", cl::value_desc(\"filename\"),\n          cl::desc(\"A file containing list of symbol names to preserve\"));\n\n  \/\/ APIList - A list of symbols that should not be marked internal.\n  cl::list<std::string>\n  APIList(\"internalize-public-api-list\", cl::value_desc(\"list\"),\n          cl::desc(\"A list of symbol names to preserve\"),\n          cl::CommaSeparated);\n\n  class InternalizePass : public ModulePass {\n    std::set<std::string> ExternalNames;\n    bool DontInternalize;\n  public:\n    InternalizePass(bool InternalizeEverything = true);\n    InternalizePass(const std::vector <const char *>& exportList);\n    void LoadFile(const char *Filename);\n    virtual bool runOnModule(Module &M);\n  };\n  RegisterPass<InternalizePass> X(\"internalize\", \"Internalize Global Symbols\");\n} \/\/ end anonymous namespace\n\nInternalizePass::InternalizePass(bool InternalizeEverything) \n  : DontInternalize(false){\n  if (!APIFile.empty())           \/\/ If a filename is specified, use it\n    LoadFile(APIFile.c_str());\n  else if (!APIList.empty())      \/\/ Else, if a list is specified, use it.\n    ExternalNames.insert(APIList.begin(), APIList.end());\n  else if (!InternalizeEverything)\n    \/\/ Finally, if we're allowed to, internalize all but main.\n    DontInternalize = true;\n}\n\nInternalizePass::InternalizePass(const std::vector<const char *>&exportList) \n  : DontInternalize(false){\n  for(std::vector<const char *>::const_iterator itr = exportList.begin();\n\titr != exportList.end(); itr++) {\n    ExternalNames.insert(*itr);\n  }\n}\n\nvoid InternalizePass::LoadFile(const char *Filename) {\n  \/\/ Load the APIFile...\n  std::ifstream In(Filename);\n  if (!In.good()) {\n    std::cerr << \"WARNING: Internalize couldn't load file '\" << Filename\n    << \"'!\\n\";\n    return;   \/\/ Do not internalize anything...\n  }\n  while (In) {\n    std::string Symbol;\n    In >> Symbol;\n    if (!Symbol.empty())\n      ExternalNames.insert(Symbol);\n  }\n}\n\nbool InternalizePass::runOnModule(Module &M) {\n  if (DontInternalize) return false;\n  \n  \/\/ If no list or file of symbols was specified, check to see if there is a\n  \/\/ \"main\" symbol defined in the module.  If so, use it, otherwise do not\n  \/\/ internalize the module, it must be a library or something.\n  \/\/\n  if (ExternalNames.empty()) {\n    Function *MainFunc = M.getMainFunction();\n    if (MainFunc == 0 || MainFunc->isExternal())\n      return false;  \/\/ No main found, must be a library...\n    \n    \/\/ Preserve main, internalize all else.\n    ExternalNames.insert(MainFunc->getName());\n  }\n  \n  bool Changed = false;\n  \n  \/\/ Found a main function, mark all functions not named main as internal.\n  for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)\n    if (!I->isExternal() &&         \/\/ Function must be defined here\n        !I->hasInternalLinkage() &&  \/\/ Can't already have internal linkage\n        !ExternalNames.count(I->getName())) {\/\/ Not marked to keep external?\n      I->setLinkage(GlobalValue::InternalLinkage);\n      Changed = true;\n      ++NumFunctions;\n      DEBUG(std::cerr << \"Internalizing func \" << I->getName() << \"\\n\");\n    }\n  \n  \/\/ Never internalize the llvm.used symbol.  It is used to implement\n  \/\/ attribute((used)).\n  ExternalNames.insert(\"llvm.used\");\n  \n  \/\/ Never internalize anchors used by the debugger, else the debugger won't\n  \/\/ find them.  (see MachineDebugInfo.)\n  ExternalNames.insert(\"llvm.dbg.compile_units\");\n  ExternalNames.insert(\"llvm.dbg.global_variables\");\n  ExternalNames.insert(\"llvm.dbg.subprograms\");\n      \n  \/\/ Mark all global variables with initializers as internal as well.\n  for (Module::global_iterator I = M.global_begin(), E = M.global_end();\n       I != E; ++I)\n    if (!I->isExternal() && !I->hasInternalLinkage() &&\n        !ExternalNames.count(I->getName())) {\n      \/\/ Special case handling of the global ctor and dtor list.  When we\n      \/\/ internalize it, we mark it constant, which allows elimination of\n      \/\/ the list if it's empty.\n      \/\/\n      if (I->hasAppendingLinkage() && (I->getName() == \"llvm.global_ctors\" ||\n                                       I->getName() == \"llvm.global_dtors\")) {\n        \/\/ If the global ctors\/dtors list has no uses, do not internalize it, as\n        \/\/ there is no __main in this program, so the asmprinter should handle\n        \/\/ it.\n        if (I->use_empty()) continue;\n \n        \/\/ Otherwise, also mark the list constant, as we know that it will not\n        \/\/ be mutated any longer, and the makes simple IPO xforms automatically\n        \/\/ better.\n        I->setConstant(true);\n      }\n      \n      I->setLinkage(GlobalValue::InternalLinkage);\n      Changed = true;\n      ++NumGlobals;\n      DEBUG(std::cerr << \"Internalized gvar \" << I->getName() << \"\\n\");\n    }\n      \n  return Changed;\n}\n\nModulePass *llvm::createInternalizePass(bool InternalizeEverything) {\n  return new InternalizePass(InternalizeEverything);\n}\n\nModulePass *llvm::createInternalizePass(const std::vector <const char *> &el) {\n  return new InternalizePass(el);\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#if !defined(XALANDEQUE_HEADER_GUARD_1357924680)\n#define XALANDEQUE_HEADER_GUARD_1357924680\n\n\n\n\/\/ Base include file.  Must be first.\n#include <xalanc\/Include\/PlatformDefinitions.hpp>\n\n\n\n#include <xalanc\/Include\/XalanVector.hpp>\n#include <xalanc\/Include\/XalanMemoryManagement.hpp> \n\n\n\nXALAN_CPP_NAMESPACE_BEGIN\n\n\n\ntemplate <class Value>\nstruct XalanDequeIteratorTraits\n{\n    typedef Value           value_type;\n    typedef Value&          reference;\n    typedef Value*          pointer;\n    typedef const Value&    const_reference;\n};\n\ntemplate <class Value>\nstruct XalanDequeConstIteratorTraits\n{\n    typedef Value           value_type;\n    typedef const Value&    reference;\n    typedef const Value*    pointer;\n    typedef const Value&    const_reference;\n};\n\ntemplate <class Traits, class XalanDeque>\nclass XalanDequeIterator\n{\npublic:\n\n    typedef size_t                              size_type;\n    typedef typename Traits::value_type         value_type;\n    typedef typename Traits::reference          reference;\n    typedef typename Traits::pointer            pointer;\n    typedef typename Traits::const_reference    const_reference;\n    typedef ptrdiff_t                           difference_type;\n\n    typedef XALAN_STD_QUALIFIER random_access_iterator_tag  iterator_category;\n\n    \/\/ The non-const iterator type.  In the case of the non-const instatiation, this\n    \/\/ is the same type.\n    typedef XalanDequeIterator<XalanDequeIteratorTraits<value_type>, XalanDeque>    Iterator;\n\n    \/\/ The const version needs access to our private data members for copy construction and\n    \/\/ assignment.  For the const instantiation, this is a superfluous friend declaration,\n    \/\/ since it's the same type as the class itself.\n    friend class XalanDequeIterator<XalanDequeConstIteratorTraits<value_type>, XalanDeque>;\n\n    XalanDequeIterator(\n                XalanDeque*     deque,\n                size_type       pos) :\n        m_deque(deque),\n        m_pos(pos)\n    {\n    }\n\n    \/\/ The is standard copy-construction for the non-const iterator type.  For the\n    \/\/ const iterator type, this is copy construction from the non-const type, and the\n    \/\/ compiler will generate the standard copy constructor.\n    XalanDequeIterator(const Iterator&  iterator) :\n        m_deque(iterator.m_deque),\n        m_pos(iterator.m_pos)\n    {\n    }\n\n    \/\/ The is the standard assignment operator for the non-const iterator type.\n    \/\/ For the const iterator type, this is the assignment operator from the\n    \/\/ non-const type, and the compiler will generate the standard assignment\n    \/\/ operator.\n    XalanDequeIterator&\n    operator=(const Iterator&   iterator)\n    {\n        m_deque = iterator.m_deque;\n        m_pos = iterator.m_pos;\n\n        return *this;\n    }\n\n    XalanDequeIterator&\n    operator++()\n    {\n        ++m_pos;\n\n        return *this;\n    }\n\n    XalanDequeIterator\n    operator++(int)\n    {\n        XalanDequeIterator temp = *this;\n        ++m_pos;\n\n        return temp;\n    }\n\n    XalanDequeIterator&\n    operator--()\n    {   \n        --m_pos;\n\n        return *this;\n    }\n\n    pointer\n    operator->()\n    {\n        return &(*m_deque[m_pos]);\n    }\n\n    reference\n    operator*()\n    {\n        return (*m_deque)[m_pos];\n    }\n\n    const_reference\n    operator*() const\n    {\n        return (*m_deque)[m_pos];\n    }\n\n    XalanDequeIterator\n    operator+(difference_type   difference) const\n    {\n        return XalanDequeIterator(m_deque, m_pos + difference);\n    }\n\n    XalanDequeIterator\n    operator-(difference_type   difference) const\n    {\n        return XalanDequeIterator(m_deque, m_pos - difference);\n    }\n\n    difference_type\n    operator-(const XalanDequeIterator&     theRHS) const\n    {\n        return m_pos - theRHS.m_pos;\n    }\n\n    bool\n    operator==(const XalanDequeIterator&    theRHS) const\n    {\n        return theRHS.m_deque == m_deque &&\n               theRHS.m_pos == m_pos;\n    }\n\n    bool\n    operator!=(const XalanDequeIterator&   theRHS) const\n    {\n        return !(theRHS == *this);\n    }\n\n    bool\n    operator<(const XalanDequeIterator&     theRHS) const\n    {\n        return m_pos < theRHS.m_pos;\n    }\n\nprivate:\n\n    XalanDeque*     m_deque;\n\n    size_type       m_pos;\n};\n\n\/**\n * Xalan implementation of deque\n *\/\ntemplate <class Type, class ConstructionTraits = MemoryManagedConstructionTraits<Type> >\nclass XalanDeque\n{\npublic:\n\n    typedef size_t  size_type;\n\n    typedef Type            value_type;\n    typedef Type&           reference;\n    typedef const Type&     const_reference;\n\n    typedef XalanVector<Type, ConstructionTraits>   BlockType;\n    typedef XalanVector<BlockType*>                 BlockIndexType;\n\n    typedef XalanDeque<Type, ConstructionTraits>    ThisType;\n\n    typedef XalanDequeIterator<XalanDequeIteratorTraits<value_type>, ThisType>          iterator;\n    typedef XalanDequeIterator<XalanDequeConstIteratorTraits<value_type>, ThisType>     const_iterator;\n\n#if defined(XALAN_HAS_STD_ITERATORS)\n    typedef XALAN_STD_QUALIFIER reverse_iterator<iterator>          reverse_iterator_;\n    typedef XALAN_STD_QUALIFIER reverse_iterator<const_iterator>    const_reverse_iterator_;\n#elif defined(XALAN_RW_NO_CLASS_PARTIAL_SPEC)\n    typedef typename iterator::iterator_category    iterator_category;\n\n    \/\/ This is a specific case for the Rogue Wave STL on Solaris.\n    typedef XALAN_STD_QUALIFIER reverse_iterator<\n        iterator,\n        iterator_category,\n        value_type> reverse_iterator_;\n\n    typedef XALAN_STD_QUALIFIER reverse_iterator<\n        const_iterator,\n        iterator_category,\n        const value_type> const_reverse_iterator_;\n#else\n    typedef XALAN_STD_QUALIFIER reverse_iterator<\n        iterator,\n        value_type>        reverse_iterator_;\n\n    typedef XALAN_STD_QUALIFIER reverse_iterator<\n        const_iterator,\n        value_type,\n        const_reference>   const_reverse_iterator_;\n#endif\n\n    typedef reverse_iterator_           reverse_iterator;\n    typedef const_reverse_iterator_     const_reverse_iterator;\n\n    typedef typename ConstructionTraits::Constructor    Constructor;\n    typedef typename Constructor::ConstructableType     ConstructableType;\n\n    XalanDeque(\n            MemoryManager&  memoryManager,\n            size_type       initialSize = 0,\n            size_type       blockSize = 10) :\n        m_memoryManager(&memoryManager),\n        m_blockSize(blockSize),\n        m_blockIndex(memoryManager,\n                    initialSize \/ blockSize + (initialSize % blockSize == 0 ? 0 : 1)),                    \n        m_freeBlockVector(memoryManager)\n    {\n        const ConstructableType     defaultValue(*m_memoryManager);\n\n        XALAN_USING_STD(fill_n)\n        XALAN_USING_STD(back_inserter)\n\n        fill_n(\n            back_inserter(*this),\n            initialSize, \n            defaultValue.value);\n    }\n\n    XalanDeque(\n                const XalanDeque&   theRHS,\n                MemoryManager&      theMemoryManager) :\n        m_memoryManager(&theMemoryManager),\n        m_blockSize(theRHS.m_blockSize),\n        m_blockIndex(*theRHS.m_memoryManager,\n                    theRHS.size() \/ theRHS.m_blockSize + (theRHS.size() % theRHS.m_blockSize == 0 ? 0 : 1)),\n        m_freeBlockVector(theMemoryManager)\n    {\n        XALAN_USING_STD(copy)\n        XALAN_USING_STD(back_inserter)\n\n        copy(\n            theRHS.begin(),\n            theRHS.end(), \n            back_inserter(*this));\n    }\n\n   static XalanDeque*\n   create(\n            MemoryManager&  theManager,\n            size_type       initialSize = 0,\n            size_type       blockSize = 10)\n    {\n        XalanAllocationGuard    theGuard(theManager, theManager.allocate(sizeof(ThisType)));\n\n        ThisType* const     theResult =\n            new (theGuard.get()) ThisType(theManager, initialSize, blockSize);\n\n        theGuard.release();\n\n        return theResult;\n    }\n\n    ~XalanDeque()\n    {\n        destroyBlockList(m_freeBlockVector);\n\n        destroyBlockList(m_blockIndex);\n    }\n\n    iterator\n    begin()\n    {\n        return iterator(this, 0);\n    }\n\n    const_iterator\n    begin() const\n    {\n        return const_iterator(const_cast<XalanDeque*>(this), 0);\n    }\n\n    iterator\n    end()\n    {\n        return iterator(this, size());\n    }\n\n    const_iterator \n    end() const\n    {\n         return const_iterator(const_cast<XalanDeque*>(this), size());\n    }\n\n    const_reverse_iterator \n    rbegin() const\n    {\n        return const_reverse_iterator(end());\n    }\n\n    const_reverse_iterator \n    rend() const\n    {\n        return const_reverse_iterator(begin());\n    }\n\n    bool \n    empty() const\n    {\n        return m_blockIndex.empty();\n    }\n\n    size_type \n    size() const\n    {\n       if (m_blockIndex.empty())\n       {\n           return 0;\n       }\n       else\n       {\n           return (m_blockIndex.size() - 1) * m_blockSize\n               +  m_blockIndex.back()->size();\n       }\n    }\n\n    value_type&\n    back()\n    {\n        return m_blockIndex.back()->back();\n    }\n\n    value_type&\n    operator[](size_type    index)\n    {\n        BlockType&  block = *m_blockIndex[index \/ m_blockSize];\n\n        return block[index % m_blockSize];\n    }\n\n    const value_type&\n    operator[](size_type    index) const\n    {\n        BlockType&  block = *m_blockIndex[index \/ m_blockSize];\n\n        return block[index % m_blockSize];\n    }\n\n    void\n    clear()\n    {\n        typename BlockIndexType::iterator   iter = m_blockIndex.begin();\n\n        m_freeBlockVector.reserve(m_freeBlockVector.size() + m_blockIndex.size());\n\n        while (iter != m_blockIndex.end())\n        {\n            (*iter)->clear();\n            m_freeBlockVector.push_back(*iter);\n            ++iter;\n        }\n\n        m_blockIndex.clear();\n    }\n\n    void\n    push_back(const value_type&     value)\n    {\n        if (m_blockIndex.empty() ||\n            m_blockIndex.back()->size() >= m_blockSize)\n        {\n            pushNewIndexBlock();\n        }\n\n        m_blockIndex.back()->push_back(value);\n    }\n\n    void\n    pop_back()\n    {\n        assert(!empty());\n\n        BlockType&  lastBlock = *m_blockIndex.back();\n        lastBlock.pop_back();\n\n        if (lastBlock.empty())\n        {\n            m_freeBlockVector.push_back(&lastBlock);\n            m_blockIndex.pop_back();\n        }\n    }\n\n    void\n    resize(size_type    newSize)\n    {\n        const ConstructableType     defaultValue(*m_memoryManager);\n\n        if (newSize > size())\n        {\n            for (size_type i = 0; i < newSize - size(); ++i)\n            {\n                push_back(defaultValue.value);\n            }\n        }\n        else\n        {\n            for (size_type i = 0; i < size() - newSize; ++i)\n            {\n                pop_back();\n            }\n        }\n    }\n\n    void\n    swap(XalanDeque&    theRHS)\n    {\n        XALAN_USING_STD(swap)\n\n        swap(m_memoryManager, theRHS.m_memoryManager);\n\n        theRHS.m_blockIndex.swap(m_blockIndex);\n        theRHS.m_freeBlockVector.swap(m_freeBlockVector);\n    }\n\n    XalanDeque&\n    operator=(const XalanDeque&     theRHS) \n    {\n        if (this != &theRHS)\n        {\n            XALAN_USING_STD(copy)\n            XALAN_USING_STD(back_inserter)\n\n            clear();\n\n            copy(\n                theRHS.begin(),\n                theRHS.end(),\n                back_inserter(*this));\n        }\n\n        return *this;\n    }\n\n    MemoryManager&\n    getMemoryManager()\n    {\n        assert (m_memoryManager != 0);\n\n        return *m_memoryManager;\n    }\n\nprivate:\n\n    void\n    pushNewIndexBlock()\n    {\n        \/\/ Allocate space first, so we don't have to worry\n        \/\/ about an out-of-memory error once we've constructed\n        \/\/ the new block.\n        m_blockIndex.push_back(0);\n\n        if (m_freeBlockVector.empty())\n        {\n            XalanConstruct(\n                *m_memoryManager,\n                m_blockIndex.back(),\n                *m_memoryManager,\n                m_blockSize);\n        }\n        else\n        {\n            m_blockIndex.back() = m_freeBlockVector.back();\n\n            \/\/ Now that ownership has been transfered, pop\n            \/\/ it off the free list.\n            m_freeBlockVector.pop_back();\n        }\n\n        assert(m_blockIndex.back() != 0);\n    }\n\n    void\n    destroyBlockList(BlockIndexType&    theBlockIndex)\n    {\n        typename BlockIndexType::iterator iter =\n            theBlockIndex.begin();\n\n        while (iter != theBlockIndex.end())\n        {\n            XalanDestroy(*m_memoryManager, **iter);\n\n            ++iter;\n        }\n    }\n\n    void\n    deallocate(BlockType*  pointer)\n    {\n        m_memoryManager->deallocate(pointer);\n    }\n\n    MemoryManager*      m_memoryManager;\n\n    const size_type     m_blockSize;\n\n    BlockIndexType\t\tm_blockIndex; \n    BlockIndexType\t\tm_freeBlockVector;\n\n\n    \/\/ These are not implemented\n    XalanDeque();\n\n    XalanDeque(const XalanDeque&);\n};\n\n\n\nXALAN_CPP_NAMESPACE_END\n\n\n\n#endif  \/\/ XALANDEQUE_HEADER_GUARD_1357924680\n\n<commit_msg>Removed unused member function and fixed tabs.<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#if !defined(XALANDEQUE_HEADER_GUARD_1357924680)\n#define XALANDEQUE_HEADER_GUARD_1357924680\n\n\n\n\/\/ Base include file.  Must be first.\n#include <xalanc\/Include\/PlatformDefinitions.hpp>\n\n\n\n#include <xalanc\/Include\/XalanVector.hpp>\n#include <xalanc\/Include\/XalanMemoryManagement.hpp> \n\n\n\nXALAN_CPP_NAMESPACE_BEGIN\n\n\n\ntemplate <class Value>\nstruct XalanDequeIteratorTraits\n{\n    typedef Value           value_type;\n    typedef Value&          reference;\n    typedef Value*          pointer;\n    typedef const Value&    const_reference;\n};\n\ntemplate <class Value>\nstruct XalanDequeConstIteratorTraits\n{\n    typedef Value           value_type;\n    typedef const Value&    reference;\n    typedef const Value*    pointer;\n    typedef const Value&    const_reference;\n};\n\ntemplate <class Traits, class XalanDeque>\nclass XalanDequeIterator\n{\npublic:\n\n    typedef size_t                              size_type;\n    typedef typename Traits::value_type         value_type;\n    typedef typename Traits::reference          reference;\n    typedef typename Traits::pointer            pointer;\n    typedef typename Traits::const_reference    const_reference;\n    typedef ptrdiff_t                           difference_type;\n\n    typedef XALAN_STD_QUALIFIER random_access_iterator_tag  iterator_category;\n\n    \/\/ The non-const iterator type.  In the case of the non-const instatiation, this\n    \/\/ is the same type.\n    typedef XalanDequeIterator<XalanDequeIteratorTraits<value_type>, XalanDeque>    Iterator;\n\n    \/\/ The const version needs access to our private data members for copy construction and\n    \/\/ assignment.  For the const instantiation, this is a superfluous friend declaration,\n    \/\/ since it's the same type as the class itself.\n    friend class XalanDequeIterator<XalanDequeConstIteratorTraits<value_type>, XalanDeque>;\n\n    XalanDequeIterator(\n                XalanDeque*     deque,\n                size_type       pos) :\n        m_deque(deque),\n        m_pos(pos)\n    {\n    }\n\n    \/\/ The is standard copy-construction for the non-const iterator type.  For the\n    \/\/ const iterator type, this is copy construction from the non-const type, and the\n    \/\/ compiler will generate the standard copy constructor.\n    XalanDequeIterator(const Iterator&  iterator) :\n        m_deque(iterator.m_deque),\n        m_pos(iterator.m_pos)\n    {\n    }\n\n    \/\/ The is the standard assignment operator for the non-const iterator type.\n    \/\/ For the const iterator type, this is the assignment operator from the\n    \/\/ non-const type, and the compiler will generate the standard assignment\n    \/\/ operator.\n    XalanDequeIterator&\n    operator=(const Iterator&   iterator)\n    {\n        m_deque = iterator.m_deque;\n        m_pos = iterator.m_pos;\n\n        return *this;\n    }\n\n    XalanDequeIterator&\n    operator++()\n    {\n        ++m_pos;\n\n        return *this;\n    }\n\n    XalanDequeIterator\n    operator++(int)\n    {\n        XalanDequeIterator temp = *this;\n        ++m_pos;\n\n        return temp;\n    }\n\n    XalanDequeIterator&\n    operator--()\n    {   \n        --m_pos;\n\n        return *this;\n    }\n\n    pointer\n    operator->()\n    {\n        return &(*m_deque[m_pos]);\n    }\n\n    reference\n    operator*()\n    {\n        return (*m_deque)[m_pos];\n    }\n\n    const_reference\n    operator*() const\n    {\n        return (*m_deque)[m_pos];\n    }\n\n    XalanDequeIterator\n    operator+(difference_type   difference) const\n    {\n        return XalanDequeIterator(m_deque, m_pos + difference);\n    }\n\n    XalanDequeIterator\n    operator-(difference_type   difference) const\n    {\n        return XalanDequeIterator(m_deque, m_pos - difference);\n    }\n\n    difference_type\n    operator-(const XalanDequeIterator&     theRHS) const\n    {\n        return m_pos - theRHS.m_pos;\n    }\n\n    bool\n    operator==(const XalanDequeIterator&    theRHS) const\n    {\n        return theRHS.m_deque == m_deque &&\n               theRHS.m_pos == m_pos;\n    }\n\n    bool\n    operator!=(const XalanDequeIterator&   theRHS) const\n    {\n        return !(theRHS == *this);\n    }\n\n    bool\n    operator<(const XalanDequeIterator&     theRHS) const\n    {\n        return m_pos < theRHS.m_pos;\n    }\n\nprivate:\n\n    XalanDeque*     m_deque;\n\n    size_type       m_pos;\n};\n\n\/**\n * Xalan implementation of deque\n *\/\ntemplate <class Type, class ConstructionTraits = MemoryManagedConstructionTraits<Type> >\nclass XalanDeque\n{\npublic:\n\n    typedef size_t  size_type;\n\n    typedef Type            value_type;\n    typedef Type&           reference;\n    typedef const Type&     const_reference;\n\n    typedef XalanVector<Type, ConstructionTraits>   BlockType;\n    typedef XalanVector<BlockType*>                 BlockIndexType;\n\n    typedef XalanDeque<Type, ConstructionTraits>    ThisType;\n\n    typedef XalanDequeIterator<XalanDequeIteratorTraits<value_type>, ThisType>          iterator;\n    typedef XalanDequeIterator<XalanDequeConstIteratorTraits<value_type>, ThisType>     const_iterator;\n\n#if defined(XALAN_HAS_STD_ITERATORS)\n    typedef XALAN_STD_QUALIFIER reverse_iterator<iterator>          reverse_iterator_;\n    typedef XALAN_STD_QUALIFIER reverse_iterator<const_iterator>    const_reverse_iterator_;\n#elif defined(XALAN_RW_NO_CLASS_PARTIAL_SPEC)\n    typedef typename iterator::iterator_category    iterator_category;\n\n    \/\/ This is a specific case for the Rogue Wave STL on Solaris.\n    typedef XALAN_STD_QUALIFIER reverse_iterator<\n        iterator,\n        iterator_category,\n        value_type> reverse_iterator_;\n\n    typedef XALAN_STD_QUALIFIER reverse_iterator<\n        const_iterator,\n        iterator_category,\n        const value_type> const_reverse_iterator_;\n#else\n    typedef XALAN_STD_QUALIFIER reverse_iterator<\n        iterator,\n        value_type>        reverse_iterator_;\n\n    typedef XALAN_STD_QUALIFIER reverse_iterator<\n        const_iterator,\n        value_type,\n        const_reference>   const_reverse_iterator_;\n#endif\n\n    typedef reverse_iterator_           reverse_iterator;\n    typedef const_reverse_iterator_     const_reverse_iterator;\n\n    typedef typename ConstructionTraits::Constructor    Constructor;\n    typedef typename Constructor::ConstructableType     ConstructableType;\n\n    XalanDeque(\n            MemoryManager&  memoryManager,\n            size_type       initialSize = 0,\n            size_type       blockSize = 10) :\n        m_memoryManager(&memoryManager),\n        m_blockSize(blockSize),\n        m_blockIndex(memoryManager,\n                    initialSize \/ blockSize + (initialSize % blockSize == 0 ? 0 : 1)),                    \n        m_freeBlockVector(memoryManager)\n    {\n        const ConstructableType     defaultValue(*m_memoryManager);\n\n        XALAN_USING_STD(fill_n)\n        XALAN_USING_STD(back_inserter)\n\n        fill_n(\n            back_inserter(*this),\n            initialSize, \n            defaultValue.value);\n    }\n\n    XalanDeque(\n                const XalanDeque&   theRHS,\n                MemoryManager&      theMemoryManager) :\n        m_memoryManager(&theMemoryManager),\n        m_blockSize(theRHS.m_blockSize),\n        m_blockIndex(*theRHS.m_memoryManager,\n                    theRHS.size() \/ theRHS.m_blockSize + (theRHS.size() % theRHS.m_blockSize == 0 ? 0 : 1)),\n        m_freeBlockVector(theMemoryManager)\n    {\n        XALAN_USING_STD(copy)\n        XALAN_USING_STD(back_inserter)\n\n        copy(\n            theRHS.begin(),\n            theRHS.end(), \n            back_inserter(*this));\n    }\n\n   static XalanDeque*\n   create(\n            MemoryManager&  theManager,\n            size_type       initialSize = 0,\n            size_type       blockSize = 10)\n    {\n        XalanAllocationGuard    theGuard(theManager, theManager.allocate(sizeof(ThisType)));\n\n        ThisType* const     theResult =\n            new (theGuard.get()) ThisType(theManager, initialSize, blockSize);\n\n        theGuard.release();\n\n        return theResult;\n    }\n\n    ~XalanDeque()\n    {\n        destroyBlockList(m_freeBlockVector);\n\n        destroyBlockList(m_blockIndex);\n    }\n\n    iterator\n    begin()\n    {\n        return iterator(this, 0);\n    }\n\n    const_iterator\n    begin() const\n    {\n        return const_iterator(const_cast<XalanDeque*>(this), 0);\n    }\n\n    iterator\n    end()\n    {\n        return iterator(this, size());\n    }\n\n    const_iterator \n    end() const\n    {\n         return const_iterator(const_cast<XalanDeque*>(this), size());\n    }\n\n    const_reverse_iterator \n    rbegin() const\n    {\n        return const_reverse_iterator(end());\n    }\n\n    const_reverse_iterator \n    rend() const\n    {\n        return const_reverse_iterator(begin());\n    }\n\n    bool \n    empty() const\n    {\n        return m_blockIndex.empty();\n    }\n\n    size_type \n    size() const\n    {\n       if (m_blockIndex.empty())\n       {\n           return 0;\n       }\n       else\n       {\n           return (m_blockIndex.size() - 1) * m_blockSize\n               +  m_blockIndex.back()->size();\n       }\n    }\n\n    value_type&\n    back()\n    {\n        return m_blockIndex.back()->back();\n    }\n\n    value_type&\n    operator[](size_type    index)\n    {\n        BlockType&  block = *m_blockIndex[index \/ m_blockSize];\n\n        return block[index % m_blockSize];\n    }\n\n    const value_type&\n    operator[](size_type    index) const\n    {\n        BlockType&  block = *m_blockIndex[index \/ m_blockSize];\n\n        return block[index % m_blockSize];\n    }\n\n    void\n    clear()\n    {\n        typename BlockIndexType::iterator   iter = m_blockIndex.begin();\n\n        m_freeBlockVector.reserve(m_freeBlockVector.size() + m_blockIndex.size());\n\n        while (iter != m_blockIndex.end())\n        {\n            (*iter)->clear();\n            m_freeBlockVector.push_back(*iter);\n            ++iter;\n        }\n\n        m_blockIndex.clear();\n    }\n\n    void\n    push_back(const value_type&     value)\n    {\n        if (m_blockIndex.empty() ||\n            m_blockIndex.back()->size() >= m_blockSize)\n        {\n            pushNewIndexBlock();\n        }\n\n        m_blockIndex.back()->push_back(value);\n    }\n\n    void\n    pop_back()\n    {\n        assert(!empty());\n\n        BlockType&  lastBlock = *m_blockIndex.back();\n        lastBlock.pop_back();\n\n        if (lastBlock.empty())\n        {\n            m_freeBlockVector.push_back(&lastBlock);\n            m_blockIndex.pop_back();\n        }\n    }\n\n    void\n    resize(size_type    newSize)\n    {\n        const ConstructableType     defaultValue(*m_memoryManager);\n\n        if (newSize > size())\n        {\n            for (size_type i = 0; i < newSize - size(); ++i)\n            {\n                push_back(defaultValue.value);\n            }\n        }\n        else\n        {\n            for (size_type i = 0; i < size() - newSize; ++i)\n            {\n                pop_back();\n            }\n        }\n    }\n\n    void\n    swap(XalanDeque&    theRHS)\n    {\n        XALAN_USING_STD(swap)\n\n        swap(m_memoryManager, theRHS.m_memoryManager);\n\n        theRHS.m_blockIndex.swap(m_blockIndex);\n        theRHS.m_freeBlockVector.swap(m_freeBlockVector);\n    }\n\n    XalanDeque&\n    operator=(const XalanDeque&     theRHS) \n    {\n        if (this != &theRHS)\n        {\n            XALAN_USING_STD(copy)\n            XALAN_USING_STD(back_inserter)\n\n            clear();\n\n            copy(\n                theRHS.begin(),\n                theRHS.end(),\n                back_inserter(*this));\n        }\n\n        return *this;\n    }\n\n    MemoryManager&\n    getMemoryManager()\n    {\n        assert (m_memoryManager != 0);\n\n        return *m_memoryManager;\n    }\n\nprivate:\n\n    void\n    pushNewIndexBlock()\n    {\n        \/\/ Allocate space first, so we don't have to worry\n        \/\/ about an out-of-memory error once we've constructed\n        \/\/ the new block.\n        m_blockIndex.push_back(0);\n\n        if (m_freeBlockVector.empty())\n        {\n            XalanConstruct(\n                *m_memoryManager,\n                m_blockIndex.back(),\n                *m_memoryManager,\n                m_blockSize);\n        }\n        else\n        {\n            m_blockIndex.back() = m_freeBlockVector.back();\n\n            \/\/ Now that ownership has been transfered, pop\n            \/\/ it off the free list.\n            m_freeBlockVector.pop_back();\n        }\n\n        assert(m_blockIndex.back() != 0);\n    }\n\n    void\n    destroyBlockList(BlockIndexType&    theBlockIndex)\n    {\n        typename BlockIndexType::iterator iter =\n            theBlockIndex.begin();\n\n        while (iter != theBlockIndex.end())\n        {\n            XalanDestroy(*m_memoryManager, **iter);\n\n            ++iter;\n        }\n    }\n\n    MemoryManager*      m_memoryManager;\n\n    const size_type     m_blockSize;\n\n    BlockIndexType\t    m_blockIndex; \n    BlockIndexType\t    m_freeBlockVector;\n\n\n    \/\/ These are not implemented\n    XalanDeque();\n\n    XalanDeque(const XalanDeque&);\n};\n\n\n\nXALAN_CPP_NAMESPACE_END\n\n\n\n#endif  \/\/ XALANDEQUE_HEADER_GUARD_1357924680\n\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"AssimpLoader.hpp\"\n#include \"SkeletonLoader.hpp\"\n\n#include <map>\n#include <Skinning\/Skeleton.hpp>\n#include <Geometry\/Mesh.hpp>\n#include <glm\/glm.hpp>\n#include <BulletCollision\/CollisionShapes\/btShapeHull.h>\n#include <BulletCollision\/CollisionShapes\/btTriangleMesh.h>\n#include <BulletCollision\/CollisionShapes\/btBvhTriangleMeshShape.h>\n\nnamespace AGE\n{\n\tclass BulletLoader\n\t{\n\tpublic:\n\t\tstatic bool save(AssetDataSet &dataSet)\n\t\t{\n\t\t\tif (dataSet.meshLoaded == false)\n\t\t\t\treturn false;\n\t\t\tauto folderPath = std::tr2::sys::path(dataSet.serializedDirectory.path().directory_string() + \"\\\\\" + dataSet.filePath.getFolder());\n\n\t\t\tif (!std::tr2::sys::exists(folderPath) && !std::tr2::sys::create_directories(folderPath))\n\t\t\t{\n\t\t\t\tstd::cerr << \"Bullet convertor error : creating directory\" << std::endl;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tauto fileName = dataSet.skinName.empty() ? dataSet.filePath.getShortFileName() + \"_static.phage\" : dataSet.skinName + \"_static.phage\";\n\t\t\tauto name = dataSet.serializedDirectory.path().directory_string() + \"\\\\\" + dataSet.filePath.getFolder() + fileName;\n\n\t\t\tstd::ofstream ofs(name, std::ios::trunc | std::ios::binary);\n\t\t\tbtDefaultSerializer\tserializer;\n\t\t\tserializer.startSerialization();\n\t\t\tdataSet.staticShape->serializeSingleShape(&serializer);\n\t\t\tserializer.finishSerialization();\n\t\t\tofs.write((const char *)(serializer.getBufferPointer()), serializer.getCurrentBufferSize());\n\t\t\treturn true;\n\t\t}\n\n\t\tstatic bool load(AssetDataSet &dataSet)\n\t\t{\n\t\t\tdataSet.staticPhysicLoaded = false;\n\t\t\tif (!dataSet.mesh)\n\t\t\t\treturn false;\n\t\t\tauto &meshs = dataSet.mesh->subMeshs;\n\t\t\tauto trimesh = new btTriangleMesh();\n\t\t\tfor (std::size_t j = 0; j < meshs.size(); ++j)\n\t\t\t{\n\t\t\t\tauto &geo = meshs[j];\n\t\t\t\tfor (std::size_t i = 0; i < geo.positions.size() - 2; i += 3)\n\t\t\t\t{\n\t\t\t\t\ttrimesh->addTriangle(btVector3(geo.positions[i].x, geo.positions[i].y, geo.positions[i].z)\n\t\t\t\t\t\t, btVector3(geo.positions[i + std::size_t(1)].x, geo.positions[i + std::size_t(1)].y, geo.positions[i + std::size_t(1)].z)\n\t\t\t\t\t\t, btVector3(geo.positions[i + std::size_t(2)].x, geo.positions[i + std::size_t(2)].y, geo.positions[i + std::size_t(2)].z), false);\n\t\t\t\t}\n\t\t\t}\n\t\t\tdataSet.staticShape = std::make_shared<btBvhTriangleMeshShape>(trimesh, true);\n\t\t\tdataSet.staticShape->buildOptimizedBvh();\n\t\t\tdataSet.staticPhysicLoaded = true;\n\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\t\t\t\/\/dataSet.mesh->name = dataSet.skinName.empty() ? dataSet.filePath.getShortFileName() : dataSet.skinName;\n\t\t\t\/\/dataSet.mesh->subMeshs.resize(dataSet.assimpScene->mNumMeshes);\n\n\t\t\t\/\/auto &meshs = dataSet.mesh->subMeshs;\n\n\t\t\t\/\/for (unsigned int meshIndex = 0; meshIndex < dataSet.assimpScene->mNumMeshes; ++meshIndex)\n\t\t\t\/\/{\n\t\t\t\/\/\taiMesh *mesh = dataSet.assimpScene->mMeshes[meshIndex];\n\n\t\t\t\/\/\tstd::uint32_t indice = 0;\n\n\t\t\t\/\/\t\/\/ init the bounding box to the first vertex\n\t\t\t\/\/\tmeshs[meshIndex].boundingBox.maxPoint = glm::vec3(mesh->mVertices[0].x, mesh->mVertices[0].y, mesh->mVertices[0].z);\n\t\t\t\/\/\tmeshs[meshIndex].boundingBox.minPoint = glm::vec3(mesh->mVertices[0].x, mesh->mVertices[0].y, mesh->mVertices[0].z);\n\n\t\t\t\/\/\tfor (size_t i = 0; i < mesh->mNumVertices; i++)\n\t\t\t\/\/\t{\n\t\t\t\/\/\t\tif (mesh->HasPositions())\n\t\t\t\/\/\t\t{\n\t\t\t\/\/\t\t\tauto &aiPositions = mesh->mVertices[i];\n\t\t\t\/\/\t\t\t\/\/ set the bounding box\n\t\t\t\/\/\t\t\tmeshs[meshIndex].boundingBox.maxPoint = glm::max(meshs[meshIndex].boundingBox.maxPoint,\n\t\t\t\/\/\t\t\t\tglm::vec3(aiPositions.x, aiPositions.y, aiPositions.z));\n\t\t\t\/\/\t\t\tmeshs[meshIndex].boundingBox.minPoint = glm::min(meshs[meshIndex].boundingBox.minPoint,\n\t\t\t\/\/\t\t\t\tglm::vec3(aiPositions.x, aiPositions.y, aiPositions.z));\n\n\t\t\t\/\/\t\t\tmeshs[meshIndex].positions.push_back(glm::vec4(aiPositions.x, aiPositions.y, aiPositions.z, 1));\n\t\t\t\/\/\t\t\tmeshs[meshIndex].infos.set(MeshInfos::Positions);\n\t\t\t\/\/\t\t}\n\t\t\t\/\/\t\tif (mesh->HasNormals())\n\t\t\t\/\/\t\t{\n\t\t\t\/\/\t\t\tauto &aiNormals = mesh->mNormals[i];\n\t\t\t\/\/\t\t\tmeshs[meshIndex].normals.push_back(glm::vec4(aiNormals.x, aiNormals.y, aiNormals.z, 1));\n\t\t\t\/\/\t\t\tmeshs[meshIndex].infos.set(MeshInfos::Normals);\n\t\t\t\/\/\t\t}\n\t\t\t\/\/\t\tfor (unsigned int texCoordIndex = 0; texCoordIndex < 1 \/*AI_MAX_NUMBER_OF_TEXTURECOORDS*\/; ++texCoordIndex)\n\t\t\t\/\/\t\t{\n\t\t\t\/\/\t\t\tif (mesh->HasTextureCoords(texCoordIndex))\n\t\t\t\/\/\t\t\t{\n\t\t\t\/\/\t\t\t\tmeshs[meshIndex].uvs.resize(texCoordIndex + 1);\n\t\t\t\/\/\t\t\t\tauto &aiUvs = mesh->mTextureCoords[texCoordIndex][i];\n\t\t\t\/\/\t\t\t\tmeshs[meshIndex].uvs[texCoordIndex].push_back(glm::vec2(aiUvs.x, aiUvs.y));\n\t\t\t\/\/\t\t\t\tmeshs[meshIndex].infos.set(MeshInfos::Uvs);\n\t\t\t\/\/\t\t\t}\n\t\t\t\/\/\t\t}\n\t\t\t\/\/\t\tif (mesh->HasTangentsAndBitangents())\n\t\t\t\/\/\t\t{\n\t\t\t\/\/\t\t\tauto &aiTangents = mesh->mTangents[i];\n\t\t\t\/\/\t\t\tmeshs[meshIndex].tangents.push_back(glm::vec4(aiTangents.x, aiTangents.y, aiTangents.z, 1));\n\t\t\t\/\/\t\t\tauto &aiBiTangents = mesh->mBitangents[i];\n\t\t\t\/\/\t\t\tmeshs[meshIndex].biTangents.push_back(glm::vec4(aiBiTangents.x, aiBiTangents.y, aiBiTangents.z, 1));\n\t\t\t\/\/\t\t\tmeshs[meshIndex].infos.set(MeshInfos::Tangents);\n\t\t\t\/\/\t\t\tmeshs[meshIndex].infos.set(MeshInfos::BiTangents);\n\t\t\t\/\/\t\t}\n\t\t\t\/\/\t}\n\t\t\t\/\/\t\/\/ The meshes dont have bounding box (only the subMeshes)\n\t\t\t\/\/\t\/\/\t\t\t\tsubMeshBoundings.push_back(meshs[meshIndex].boundingBox);\n\n\t\t\t\/\/\tglm::vec3 dist = meshs[meshIndex].boundingBox.maxPoint - meshs[meshIndex].boundingBox.minPoint;\n\t\t\t\/\/\tmeshs[meshIndex].boundingBox.center = meshs[meshIndex].boundingBox.minPoint + (dist \/ 2.0f);\n\n\t\t\t\/\/\tunsigned int meshFacesNbr = mesh->mNumFaces;\n\t\t\t\/\/\tfor (unsigned int faceIndex = 0; faceIndex < meshFacesNbr; ++faceIndex)\n\t\t\t\/\/\t{\n\t\t\t\/\/\t\tconst aiFace &face = mesh->mFaces[faceIndex];\n\t\t\t\/\/\t\tfor (unsigned int k = 0; k < 3; ++k)\n\t\t\t\/\/\t\t{\n\t\t\t\/\/\t\t\tmeshs[meshIndex].indices.push_back(face.mIndices[k]);\n\t\t\t\/\/\t\t}\n\t\t\t\/\/\t}\n\n\t\t\t\/\/\tstd::map<std::string, unsigned int> bonesIndices;\n\t\t\t\/\/\tunsigned int numBone = 0;\n\n\t\t\t\/\/\tmeshs[meshIndex].weights.resize(meshs[meshIndex].positions.size(), glm::vec4(0));\n\t\t\t\/\/\tmeshs[meshIndex].boneIndices.resize(meshs[meshIndex].positions.size(), glm::vec4(0));\n\t\t\t\/\/\tmeshs[meshIndex].name = mesh->mName.C_Str();\n\t\t\t\/\/\tmeshs[meshIndex].defaultMaterialIndex = mesh->mMaterialIndex > 0 ? mesh->mMaterialIndex : std::uint16_t(-1);\n\t\t\t\/\/\tfor (unsigned int i = 0; i < mesh->mNumBones; ++i)\n\t\t\t\/\/\t{\n\t\t\t\/\/\t\tunsigned int boneIndex = dataSet.skeleton->bonesReferences.find(mesh->mBones[i]->mName.data)->second;\n\n\t\t\t\/\/\t\tmeshs[meshIndex].infos.set(MeshInfos::Weights);\n\t\t\t\/\/\t\tmeshs[meshIndex].infos.set(MeshInfos::BoneIndices);\n\n\t\t\t\/\/\t\tfor (unsigned int j = 0; j < mesh->mBones[i]->mNumWeights; ++j)\n\t\t\t\/\/\t\t{\n\t\t\t\/\/\t\t\tfloat weight = mesh->mBones[i]->mWeights[j].mWeight;\n\t\t\t\/\/\t\t\tfloat vid = mesh->mBones[i]->mWeights[j].mVertexId;\n\t\t\t\/\/\t\t\tif (meshs[meshIndex].weights[vid].r == 0.0f)\n\t\t\t\/\/\t\t\t{\n\t\t\t\/\/\t\t\t\tmeshs[meshIndex].weights[vid].r = weight;\n\t\t\t\/\/\t\t\t\tmeshs[meshIndex].boneIndices[vid].r = boneIndex;\n\t\t\t\/\/\t\t\t}\n\t\t\t\/\/\t\t\telse if (meshs[meshIndex].weights[vid].g == 0.0f)\n\t\t\t\/\/\t\t\t{\n\t\t\t\/\/\t\t\t\tmeshs[meshIndex].weights[vid].g = weight;\n\t\t\t\/\/\t\t\t\tmeshs[meshIndex].boneIndices[vid].g = boneIndex;\n\t\t\t\/\/\t\t\t}\n\t\t\t\/\/\t\t\telse if (meshs[meshIndex].weights[vid].b == 0.0f)\n\t\t\t\/\/\t\t\t{\n\t\t\t\/\/\t\t\t\tmeshs[meshIndex].weights[vid].b = weight;\n\t\t\t\/\/\t\t\t\tmeshs[meshIndex].boneIndices[vid].b = boneIndex;\n\t\t\t\/\/\t\t\t}\n\t\t\t\/\/\t\t\telse if (meshs[meshIndex].weights[vid].a == 0.0f)\n\t\t\t\/\/\t\t\t{\n\t\t\t\/\/\t\t\t\tmeshs[meshIndex].weights[vid].a = weight;\n\t\t\t\/\/\t\t\t\tmeshs[meshIndex].boneIndices[vid].a = boneIndex;\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\t\/\/dataSet.meshLoaded = true;\n\t\t\treturn true;\n\t\t}\n\t};\n}<commit_msg>physic mesh index fixed<commit_after>#pragma once\n\n#include \"AssimpLoader.hpp\"\n#include \"SkeletonLoader.hpp\"\n\n#include <map>\n#include <Skinning\/Skeleton.hpp>\n#include <Geometry\/Mesh.hpp>\n#include <glm\/glm.hpp>\n#include <BulletCollision\/CollisionShapes\/btShapeHull.h>\n#include <BulletCollision\/CollisionShapes\/btTriangleMesh.h>\n#include <BulletCollision\/CollisionShapes\/btBvhTriangleMeshShape.h>\n\nnamespace AGE\n{\n\tclass BulletLoader\n\t{\n\tpublic:\n\t\tstatic bool save(AssetDataSet &dataSet)\n\t\t{\n\t\t\tif (dataSet.meshLoaded == false)\n\t\t\t\treturn false;\n\t\t\tauto folderPath = std::tr2::sys::path(dataSet.serializedDirectory.path().directory_string() + \"\\\\\" + dataSet.filePath.getFolder());\n\n\t\t\tif (!std::tr2::sys::exists(folderPath) && !std::tr2::sys::create_directories(folderPath))\n\t\t\t{\n\t\t\t\tstd::cerr << \"Bullet convertor error : creating directory\" << std::endl;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tauto fileName = dataSet.skinName.empty() ? dataSet.filePath.getShortFileName() + \"_static.phage\" : dataSet.skinName + \"_static.phage\";\n\t\t\tauto name = dataSet.serializedDirectory.path().directory_string() + \"\\\\\" + dataSet.filePath.getFolder() + fileName;\n\n\t\t\tstd::ofstream ofs(name, std::ios::trunc | std::ios::binary);\n\t\t\tbtDefaultSerializer\tserializer;\n\t\t\tserializer.startSerialization();\n\t\t\tdataSet.staticShape->serializeSingleShape(&serializer);\n\t\t\tserializer.finishSerialization();\n\t\t\tofs.write((const char *)(serializer.getBufferPointer()), serializer.getCurrentBufferSize());\n\t\t\treturn true;\n\t\t}\n\n\t\tstatic bool load(AssetDataSet &dataSet)\n\t\t{\n\t\t\tdataSet.staticPhysicLoaded = false;\n\t\t\tif (!dataSet.mesh)\n\t\t\t\treturn false;\n\t\t\tauto &meshs = dataSet.mesh->subMeshs;\n\t\t\tauto trimesh = new btTriangleMesh();\n\t\t\tstd::size_t indiceNb = 0;\n\t\t\tstd::size_t verticeNb = 0;\n\t\t\tfor (auto &e : dataSet.mesh->subMeshs)\n\t\t\t{\n\t\t\t\tindiceNb += e.indices.size();\n\t\t\t\tverticeNb += e.positions.size();\n\t\t\t}\n\t\t\ttrimesh->preallocateIndices(indiceNb);\n\t\t\ttrimesh->preallocateVertices(verticeNb);\n\t\t\tfor (std::size_t j = 0; j < meshs.size(); ++j)\n\t\t\t{\n\t\t\t\tauto &geo = meshs[j];\n\t\t\t\tfor (std::size_t i = 0; i < geo.indices.size(); i += 3)\n\t\t\t\t{\n\t\t\t\t\tauto a = geo.positions[geo.indices[i]];\n\t\t\t\t\tauto b = geo.positions[geo.indices[i+1]];\n\t\t\t\t\tauto c = geo.positions[geo.indices[i+2]];\n\t\t\t\t\ttrimesh->addTriangle(btVector3(a.x, a.y, a.z)\n\t\t\t\t\t\t, btVector3(b.x, b.y, b.z)\n\t\t\t\t\t\t, btVector3(c.x, c.y, c.z), true);\n\t\t\t\t}\n\t\t\t}\n\t\t\tdataSet.staticShape = std::make_shared<btBvhTriangleMeshShape>(trimesh, true);\n\t\t\tdataSet.staticShape->buildOptimizedBvh();\n\t\t\tdataSet.staticPhysicLoaded = true;\n\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\t\t\t\/\/dataSet.mesh->name = dataSet.skinName.empty() ? dataSet.filePath.getShortFileName() : dataSet.skinName;\n\t\t\t\/\/dataSet.mesh->subMeshs.resize(dataSet.assimpScene->mNumMeshes);\n\n\t\t\t\/\/auto &meshs = dataSet.mesh->subMeshs;\n\n\t\t\t\/\/for (unsigned int meshIndex = 0; meshIndex < dataSet.assimpScene->mNumMeshes; ++meshIndex)\n\t\t\t\/\/{\n\t\t\t\/\/\taiMesh *mesh = dataSet.assimpScene->mMeshes[meshIndex];\n\n\t\t\t\/\/\tstd::uint32_t indice = 0;\n\n\t\t\t\/\/\t\/\/ init the bounding box to the first vertex\n\t\t\t\/\/\tmeshs[meshIndex].boundingBox.maxPoint = glm::vec3(mesh->mVertices[0].x, mesh->mVertices[0].y, mesh->mVertices[0].z);\n\t\t\t\/\/\tmeshs[meshIndex].boundingBox.minPoint = glm::vec3(mesh->mVertices[0].x, mesh->mVertices[0].y, mesh->mVertices[0].z);\n\n\t\t\t\/\/\tfor (size_t i = 0; i < mesh->mNumVertices; i++)\n\t\t\t\/\/\t{\n\t\t\t\/\/\t\tif (mesh->HasPositions())\n\t\t\t\/\/\t\t{\n\t\t\t\/\/\t\t\tauto &aiPositions = mesh->mVertices[i];\n\t\t\t\/\/\t\t\t\/\/ set the bounding box\n\t\t\t\/\/\t\t\tmeshs[meshIndex].boundingBox.maxPoint = glm::max(meshs[meshIndex].boundingBox.maxPoint,\n\t\t\t\/\/\t\t\t\tglm::vec3(aiPositions.x, aiPositions.y, aiPositions.z));\n\t\t\t\/\/\t\t\tmeshs[meshIndex].boundingBox.minPoint = glm::min(meshs[meshIndex].boundingBox.minPoint,\n\t\t\t\/\/\t\t\t\tglm::vec3(aiPositions.x, aiPositions.y, aiPositions.z));\n\n\t\t\t\/\/\t\t\tmeshs[meshIndex].positions.push_back(glm::vec4(aiPositions.x, aiPositions.y, aiPositions.z, 1));\n\t\t\t\/\/\t\t\tmeshs[meshIndex].infos.set(MeshInfos::Positions);\n\t\t\t\/\/\t\t}\n\t\t\t\/\/\t\tif (mesh->HasNormals())\n\t\t\t\/\/\t\t{\n\t\t\t\/\/\t\t\tauto &aiNormals = mesh->mNormals[i];\n\t\t\t\/\/\t\t\tmeshs[meshIndex].normals.push_back(glm::vec4(aiNormals.x, aiNormals.y, aiNormals.z, 1));\n\t\t\t\/\/\t\t\tmeshs[meshIndex].infos.set(MeshInfos::Normals);\n\t\t\t\/\/\t\t}\n\t\t\t\/\/\t\tfor (unsigned int texCoordIndex = 0; texCoordIndex < 1 \/*AI_MAX_NUMBER_OF_TEXTURECOORDS*\/; ++texCoordIndex)\n\t\t\t\/\/\t\t{\n\t\t\t\/\/\t\t\tif (mesh->HasTextureCoords(texCoordIndex))\n\t\t\t\/\/\t\t\t{\n\t\t\t\/\/\t\t\t\tmeshs[meshIndex].uvs.resize(texCoordIndex + 1);\n\t\t\t\/\/\t\t\t\tauto &aiUvs = mesh->mTextureCoords[texCoordIndex][i];\n\t\t\t\/\/\t\t\t\tmeshs[meshIndex].uvs[texCoordIndex].push_back(glm::vec2(aiUvs.x, aiUvs.y));\n\t\t\t\/\/\t\t\t\tmeshs[meshIndex].infos.set(MeshInfos::Uvs);\n\t\t\t\/\/\t\t\t}\n\t\t\t\/\/\t\t}\n\t\t\t\/\/\t\tif (mesh->HasTangentsAndBitangents())\n\t\t\t\/\/\t\t{\n\t\t\t\/\/\t\t\tauto &aiTangents = mesh->mTangents[i];\n\t\t\t\/\/\t\t\tmeshs[meshIndex].tangents.push_back(glm::vec4(aiTangents.x, aiTangents.y, aiTangents.z, 1));\n\t\t\t\/\/\t\t\tauto &aiBiTangents = mesh->mBitangents[i];\n\t\t\t\/\/\t\t\tmeshs[meshIndex].biTangents.push_back(glm::vec4(aiBiTangents.x, aiBiTangents.y, aiBiTangents.z, 1));\n\t\t\t\/\/\t\t\tmeshs[meshIndex].infos.set(MeshInfos::Tangents);\n\t\t\t\/\/\t\t\tmeshs[meshIndex].infos.set(MeshInfos::BiTangents);\n\t\t\t\/\/\t\t}\n\t\t\t\/\/\t}\n\t\t\t\/\/\t\/\/ The meshes dont have bounding box (only the subMeshes)\n\t\t\t\/\/\t\/\/\t\t\t\tsubMeshBoundings.push_back(meshs[meshIndex].boundingBox);\n\n\t\t\t\/\/\tglm::vec3 dist = meshs[meshIndex].boundingBox.maxPoint - meshs[meshIndex].boundingBox.minPoint;\n\t\t\t\/\/\tmeshs[meshIndex].boundingBox.center = meshs[meshIndex].boundingBox.minPoint + (dist \/ 2.0f);\n\n\t\t\t\/\/\tunsigned int meshFacesNbr = mesh->mNumFaces;\n\t\t\t\/\/\tfor (unsigned int faceIndex = 0; faceIndex < meshFacesNbr; ++faceIndex)\n\t\t\t\/\/\t{\n\t\t\t\/\/\t\tconst aiFace &face = mesh->mFaces[faceIndex];\n\t\t\t\/\/\t\tfor (unsigned int k = 0; k < 3; ++k)\n\t\t\t\/\/\t\t{\n\t\t\t\/\/\t\t\tmeshs[meshIndex].indices.push_back(face.mIndices[k]);\n\t\t\t\/\/\t\t}\n\t\t\t\/\/\t}\n\n\t\t\t\/\/\tstd::map<std::string, unsigned int> bonesIndices;\n\t\t\t\/\/\tunsigned int numBone = 0;\n\n\t\t\t\/\/\tmeshs[meshIndex].weights.resize(meshs[meshIndex].positions.size(), glm::vec4(0));\n\t\t\t\/\/\tmeshs[meshIndex].boneIndices.resize(meshs[meshIndex].positions.size(), glm::vec4(0));\n\t\t\t\/\/\tmeshs[meshIndex].name = mesh->mName.C_Str();\n\t\t\t\/\/\tmeshs[meshIndex].defaultMaterialIndex = mesh->mMaterialIndex > 0 ? mesh->mMaterialIndex : std::uint16_t(-1);\n\t\t\t\/\/\tfor (unsigned int i = 0; i < mesh->mNumBones; ++i)\n\t\t\t\/\/\t{\n\t\t\t\/\/\t\tunsigned int boneIndex = dataSet.skeleton->bonesReferences.find(mesh->mBones[i]->mName.data)->second;\n\n\t\t\t\/\/\t\tmeshs[meshIndex].infos.set(MeshInfos::Weights);\n\t\t\t\/\/\t\tmeshs[meshIndex].infos.set(MeshInfos::BoneIndices);\n\n\t\t\t\/\/\t\tfor (unsigned int j = 0; j < mesh->mBones[i]->mNumWeights; ++j)\n\t\t\t\/\/\t\t{\n\t\t\t\/\/\t\t\tfloat weight = mesh->mBones[i]->mWeights[j].mWeight;\n\t\t\t\/\/\t\t\tfloat vid = mesh->mBones[i]->mWeights[j].mVertexId;\n\t\t\t\/\/\t\t\tif (meshs[meshIndex].weights[vid].r == 0.0f)\n\t\t\t\/\/\t\t\t{\n\t\t\t\/\/\t\t\t\tmeshs[meshIndex].weights[vid].r = weight;\n\t\t\t\/\/\t\t\t\tmeshs[meshIndex].boneIndices[vid].r = boneIndex;\n\t\t\t\/\/\t\t\t}\n\t\t\t\/\/\t\t\telse if (meshs[meshIndex].weights[vid].g == 0.0f)\n\t\t\t\/\/\t\t\t{\n\t\t\t\/\/\t\t\t\tmeshs[meshIndex].weights[vid].g = weight;\n\t\t\t\/\/\t\t\t\tmeshs[meshIndex].boneIndices[vid].g = boneIndex;\n\t\t\t\/\/\t\t\t}\n\t\t\t\/\/\t\t\telse if (meshs[meshIndex].weights[vid].b == 0.0f)\n\t\t\t\/\/\t\t\t{\n\t\t\t\/\/\t\t\t\tmeshs[meshIndex].weights[vid].b = weight;\n\t\t\t\/\/\t\t\t\tmeshs[meshIndex].boneIndices[vid].b = boneIndex;\n\t\t\t\/\/\t\t\t}\n\t\t\t\/\/\t\t\telse if (meshs[meshIndex].weights[vid].a == 0.0f)\n\t\t\t\/\/\t\t\t{\n\t\t\t\/\/\t\t\t\tmeshs[meshIndex].weights[vid].a = weight;\n\t\t\t\/\/\t\t\t\tmeshs[meshIndex].boneIndices[vid].a = boneIndex;\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\t\/\/dataSet.meshLoaded = true;\n\t\t\treturn true;\n\t\t}\n\t};\n}<|endoftext|>"}
{"text":"<commit_before>#include \"applications.h\"\n#include <QDir>\n#include <qdebug.h>\n\nconst int Applications::NameRole = Qt::UserRole + 1;\nconst int Applications::IconRole = Qt::UserRole + 2;\nconst int Applications::ExecRole = Qt::UserRole + 3;\nconst int Applications::TerminalRole = Qt::UserRole + 4;\n\nApplications::Applications(QObject *parent) :\n    QAbstractListModel(parent)\n{\n    connect(&m_parserThreadWatcher, SIGNAL(finished()), this, SLOT(parseFinished()));\n    m_parserRunning = true;\n    m_parserThread = QtConcurrent::run(this, &Applications::parseApplications);\n    m_parserThreadWatcher.setFuture(m_parserThread);\n}\n\nApplications::~Applications()\n{\n    if (m_parserThread.isRunning())\n        m_parserThread.cancel();\n    qDeleteAll(this->m_internalData);\n}\n\nvoid Applications::parseApplications()\n{\n    this->m_files.append(this->readFolder(QDir::homePath() + APPLICATIONS_LOCAL_PATH));\n    this->m_files.append(this->readFolder(APPLICATIONS_PATH));\n\n    foreach(QString file, this->m_files)\n    {\n        DesktopFile* app = new DesktopFile(file);\n        if (!app->noDisplay() && !app->terminal() && !app->isHidden())\n        {\n            \/\/ qDebug() << \"Found application: \" << app->name();\n            m_internalData.append(app);\n        }\n    }\n    this->m_files.clear();\n}\n\nQStringList Applications::readFolder(QString folder)\n{\n    QDir dir(folder);\n    QFileInfoList file_list = dir.entryInfoList(\n                QStringList(APPLICATIONS_FILES), QDir::Files | QDir::Readable);\n\n    QStringList files;\n    foreach(QFileInfo file, file_list)\n    {\n        if (this->m_files.filter(file.fileName()).count() == 0)\n        {\n            files.append(file.absoluteFilePath());\n        }\n    }\n    return files;\n}\n\nvoid Applications::add(DesktopFile *item)\n{\n    beginInsertRows(QModelIndex(), m_data.size(), m_data.size());\n    m_data.append(item);\n    endInsertRows();\n    emit countChanged(m_data.size());\n}\n\nvoid Applications::sortApps()\n{\n    std::sort(this->m_data.begin(), this->m_data.end(),\n              [](const DesktopFile* left, const DesktopFile* right) -> bool\n    {\n        return QString::compare(left->nameLocalized(),right->nameLocalized(), Qt::CaseInsensitive) < 0;\n    });\n}\n\nDesktopFile* Applications::get(int index) const\n{\n    return m_data.at(index);\n}\n\nvoid Applications::filter(QString search)\n{\n    if (m_parserRunning) return;\n    beginRemoveRows(QModelIndex(), 0, m_data.size());\n    m_data.clear();\n    endRemoveRows();\n    foreach(DesktopFile* file, m_internalData)\n    {\n        \/\/ qDebug() \"Searching in: \" << file->name();\n        if (file->contains(search))\n            this->add(file);\n    }\n    this->sortApps();\n}\n\nint Applications::rowCount(const QModelIndex &) const\n{\n    return m_data.count();\n}\n\nQVariant Applications::data(const QModelIndex &index, int role) const\n{\n    if (!index.isValid())\n        return QVariant();\n    if (index.row() > (m_data.size()-1) )\n        return QVariant();\n\n    DesktopFile* obj = m_data.at(index.row());\n    switch(role)\n    {\n        case Qt::DisplayRole:\n        case NameRole:\n            return QVariant::fromValue(obj->nameLocalized());\n        break;\n\n        case IconRole:\n            return QVariant::fromValue(obj->icon());\n\n        case ExecRole:\n            return QVariant::fromValue(obj->exec());\n\n        case TerminalRole:\n            return QVariant::fromValue(obj->terminal());\n\n        default:\n            return QVariant();\n    }\n}\n\nQHash<int, QByteArray> Applications::roleNames() const\n{\n    QHash<int, QByteArray> roles = QAbstractListModel::roleNames();\n    roles.insert(NameRole, QByteArray(\"name\"));\n    roles.insert(IconRole, QByteArray(\"icon\"));\n    roles.insert(ExecRole, QByteArray(\"exec\"));\n    roles.insert(TerminalRole, QByteArray(\"terminal\"));\n    return roles;\n}\n\nvoid Applications::parseFinished()\n{\n    \/\/ qDebug() << \"Parser finished\";\n    m_parserRunning = false;\n    this->filter(\"\");\n    emit ready();\n}\n<commit_msg>Presort internal list of apps for faster filtering<commit_after>#include \"applications.h\"\n#include <QDir>\n#include <qdebug.h>\n\nconst int Applications::NameRole = Qt::UserRole + 1;\nconst int Applications::IconRole = Qt::UserRole + 2;\nconst int Applications::ExecRole = Qt::UserRole + 3;\nconst int Applications::TerminalRole = Qt::UserRole + 4;\n\nApplications::Applications(QObject *parent) :\n    QAbstractListModel(parent)\n{\n    connect(&m_parserThreadWatcher, SIGNAL(finished()), this, SLOT(parseFinished()));\n    m_parserRunning = true;\n    m_parserThread = QtConcurrent::run(this, &Applications::parseApplications);\n    m_parserThreadWatcher.setFuture(m_parserThread);\n}\n\nApplications::~Applications()\n{\n    if (m_parserThread.isRunning())\n        m_parserThread.cancel();\n    qDeleteAll(this->m_internalData);\n}\n\nvoid Applications::parseApplications()\n{\n    this->m_files.append(this->readFolder(QDir::homePath() + APPLICATIONS_LOCAL_PATH));\n    this->m_files.append(this->readFolder(APPLICATIONS_PATH));\n\n    foreach(QString file, this->m_files)\n    {\n        DesktopFile* app = new DesktopFile(file);\n        if (!app->noDisplay() && !app->terminal() && !app->isHidden())\n        {\n            \/\/ qDebug() << \"Found application: \" << app->name();\n            m_internalData.append(app);\n        }\n    }\n    this->m_files.clear();\n}\n\nQStringList Applications::readFolder(QString folder)\n{\n    QDir dir(folder);\n    QFileInfoList file_list = dir.entryInfoList(\n                QStringList(APPLICATIONS_FILES), QDir::Files | QDir::Readable);\n\n    QStringList files;\n    foreach(QFileInfo file, file_list)\n    {\n        if (this->m_files.filter(file.fileName()).count() == 0)\n        {\n            files.append(file.absoluteFilePath());\n        }\n    }\n    return files;\n}\n\nvoid Applications::add(DesktopFile *item)\n{\n    beginInsertRows(QModelIndex(), m_data.size(), m_data.size());\n    m_data.append(item);\n    endInsertRows();\n    emit countChanged(m_data.size());\n}\n\nvoid Applications::sortApps()\n{\n    std::sort(this->m_internalData.begin(), this->m_internalData.end(),\n              [](const DesktopFile* left, const DesktopFile* right) -> bool\n    {\n        return QString::compare(left->nameLocalized(),right->nameLocalized(), Qt::CaseInsensitive) < 0;\n    });\n}\n\nDesktopFile* Applications::get(int index) const\n{\n    return m_data.at(index);\n}\n\nvoid Applications::filter(QString search)\n{\n    if (m_parserRunning) return;\n    beginRemoveRows(QModelIndex(), 0, m_data.size());\n    m_data.clear();\n    endRemoveRows();\n    foreach(DesktopFile* file, m_internalData)\n    {\n        \/\/ qDebug() \"Searching in: \" << file->name();\n        if (file->contains(search))\n            this->add(file);\n    }\n}\n\nint Applications::rowCount(const QModelIndex &) const\n{\n    return m_data.count();\n}\n\nQVariant Applications::data(const QModelIndex &index, int role) const\n{\n    if (!index.isValid())\n        return QVariant();\n    if (index.row() > (m_data.size()-1) )\n        return QVariant();\n\n    DesktopFile* obj = m_data.at(index.row());\n    switch(role)\n    {\n        case Qt::DisplayRole:\n        case NameRole:\n            return QVariant::fromValue(obj->nameLocalized());\n        break;\n\n        case IconRole:\n            return QVariant::fromValue(obj->icon());\n\n        case ExecRole:\n            return QVariant::fromValue(obj->exec());\n\n        case TerminalRole:\n            return QVariant::fromValue(obj->terminal());\n\n        default:\n            return QVariant();\n    }\n}\n\nQHash<int, QByteArray> Applications::roleNames() const\n{\n    QHash<int, QByteArray> roles = QAbstractListModel::roleNames();\n    roles.insert(NameRole, QByteArray(\"name\"));\n    roles.insert(IconRole, QByteArray(\"icon\"));\n    roles.insert(ExecRole, QByteArray(\"exec\"));\n    roles.insert(TerminalRole, QByteArray(\"terminal\"));\n    return roles;\n}\n\nvoid Applications::parseFinished()\n{\n    \/\/ qDebug() << \"Parser finished\";\n    m_parserRunning = false;\n    this->sortApps();\n    this->filter(\"\");\n    emit ready();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2011-2014 UFNA, LLC. All Rights Reserved.\n\n#include \"SeaCraft.h\"\n\n#include \"SeaCraft.generated.inl\"\n\nclass FSeaCraftGameModule : public FDefaultGameModuleImpl\n{\n\tvirtual void StartupModule() override\n\t{\n\t\t\n\t}\n\n\tvirtual void ShutdownModule() override\n\t{\n\t\t\n\t}\n};\n\nIMPLEMENT_PRIMARY_GAME_MODULE( FSeaCraftGameModule, SeaCraft, \"SeaCraft\" );\n\nDEFINE_LOG_CATEGORY(LogShipPhysics);\nDEFINE_LOG_CATEGORY(LogOcean);\nDEFINE_LOG_CATEGORY(LogWeapon);\n<commit_msg>deprecated include removed<commit_after>\/\/ Copyright 2011-2014 UFNA, LLC. All Rights Reserved.\n\n#include \"SeaCraft.h\"\n\nclass FSeaCraftGameModule : public FDefaultGameModuleImpl\n{\n\tvirtual void StartupModule() override\n\t{\n\t\t\n\t}\n\n\tvirtual void ShutdownModule() override\n\t{\n\t\t\n\t}\n};\n\nIMPLEMENT_PRIMARY_GAME_MODULE( FSeaCraftGameModule, SeaCraft, \"SeaCraft\" );\n\nDEFINE_LOG_CATEGORY(LogShipPhysics);\nDEFINE_LOG_CATEGORY(LogOcean);\nDEFINE_LOG_CATEGORY(LogWeapon);\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 that exercise the functionality of our rigid transform typedefs, which\n\/\/\/ come straight from Eigen.\n\n#include <Eigen\/Core>\n#include <Eigen\/Geometry>\n#include \"SurgSim\/Math\/RigidTransform.h\"\n#include \"SurgSim\/Math\/Quaternion.h\"\n#include \"gtest\/gtest.h\"\n\ntemplate <class T>\nclass RigidTransformTestBase : public testing::Test\n{\npublic:\n\ttypedef T RigidTransform;\n\ttypedef typename T::Scalar Scalar;\n};\n\n\ntemplate <class T>\nclass RigidTransform3Tests : public RigidTransformTestBase<T>\n{\n};\n\ntypedef ::testing::Types<SurgSim::Math::RigidTransform3d,\n\t\t\t\t\t\t SurgSim::Math::RigidTransform3f> RigidTransform3Variants;\nTYPED_TEST_CASE(RigidTransform3Tests, RigidTransform3Variants);\n\n\ntemplate <class T>\nclass AllRigidTransformTests : public RigidTransformTestBase<T>\n{\n};\n\ntypedef ::testing::Types<SurgSim::Math::RigidTransform2d,\n\t\t\t\t\t\t SurgSim::Math::RigidTransform2f,\n\t\t\t\t\t\t SurgSim::Math::RigidTransform3d,\n\t\t\t\t\t\t SurgSim::Math::RigidTransform3f> AllRigidTransformVariants;\nTYPED_TEST_CASE(AllRigidTransformTests, AllRigidTransformVariants);\n\n\n\/\/\/ Test that rigid transforms can be constructed\nTYPED_TEST(AllRigidTransformTests, CanConstruct)\n{\n\ttypename TestFixture::RigidTransform transform;\n}\n\n\/\/\/ Test rigid transforms interpolation\nTYPED_TEST(AllRigidTransformTests, Interpolation)\n{\n\tusing SurgSim::Math::makeRigidTransform;\n\n\ttypedef typename TestFixture::Scalar T;\n\ttypedef Eigen::Quaternion<T> Quaternion;\n\ttypedef Eigen::Transform<T, 3, Eigen::Isometry> Transform;\n\ttypedef Eigen::Matrix<T, 3, 1> Vector3;\n\n\tfor (unsigned int numLoop = 0; numLoop < 100; numLoop++)\n\t{\n\t\tQuaternion q0(Eigen::Matrix<T,4,1>::Random());\n\t\tQuaternion q1(Eigen::Matrix<T,4,1>::Random());\n\t\tq0.normalize();\n\t\tq1.normalize();\n\n\t\tVector3 t0(Vector3::Random());\n\t\tVector3 t1(Vector3::Random());\n\n\t\tTransform transform0 = makeRigidTransform(q0, t0);\n\t\tTransform transform1 = makeRigidTransform(q1, t1);\n\t\t{\n\t\t\tTransform transform = SurgSim::Math::interpolate(transform0, transform1, static_cast<T>(0.0));\n\t\t\tEXPECT_TRUE(transform.isApprox(transform0));\n\t\t}\n\t\t{\n\t\t\tTransform transform = SurgSim::Math::interpolate(transform0, transform1, static_cast<T>(1.0));\n\t\t\tEXPECT_TRUE(transform.isApprox(transform1));\n\t\t}\n\n\t\t{\n\t\t\tTransform transform = SurgSim::Math::interpolate(transform0, transform1, static_cast<T>(0.234));\n\t\t\tEXPECT_FALSE(transform.isApprox(transform0));\n\t\t\tEXPECT_FALSE(transform.isApprox(transform1));\n\t\t}\n\n\t\t{\n\t\t\tTransform transform = SurgSim::Math::interpolate(transform0, transform1, static_cast<T>(0.5));\n\t\t\tEXPECT_FALSE(transform.isApprox(transform0));\n\t\t\tEXPECT_FALSE(transform.isApprox(transform1));\n\n\t\t\t\/\/ At t=0.5, the rotation interpolation should return (q0 + q1)\/2 normalized\n\t\t\t\/\/ c.f. http:\/\/en.wikipedia.org\/wiki\/Slerp\n\t\t\t\/\/ If the quaternions are over PI angle, the slerp will interpolate between q0 and -q1\n\t\t\t\/\/ in this case, the interpolation is (q0 - q1)\/2 normalized\n\t\t\t\/\/ From our specification, both quaternions could be considered negative, so we extend\n\t\t\t\/\/ the tests to these possibilities as well:\n\t\t\t\/\/ (-q0 + q1) \/ 2 normalized\n\t\t\t\/\/ (-q0 - q1) \/ 2 normalized\n\t\t\tQuaternion qHalf0(( q0.coeffs() + q1.coeffs()) * 0.5);\n\t\t\tQuaternion qHalf1(( q0.coeffs() - q1.coeffs()) * 0.5);\n\t\t\tQuaternion qHalf2((-q0.coeffs() + q1.coeffs()) * 0.5);\n\t\t\tQuaternion qHalf3((-q0.coeffs() - q1.coeffs()) * 0.5);\n\t\t\tqHalf0.normalize();\n\t\t\tqHalf1.normalize();\n\t\t\tqHalf2.normalize();\n\t\t\tqHalf3.normalize();\n\n\t\t\tVector3 tHalf = (t0 + t1) * 0.5;\n\t\t\tTransform transformHalf0 = makeRigidTransform(qHalf0, tHalf);\n\t\t\tTransform transformHalf1 = makeRigidTransform(qHalf1, tHalf);\n\t\t\tTransform transformHalf2 = makeRigidTransform(qHalf2, tHalf);\n\t\t\tTransform transformHalf3 = makeRigidTransform(qHalf3, tHalf);\n\t\t\tEXPECT_TRUE(transform.isApprox(transformHalf0) || transform.isApprox(transformHalf1) ||\n\t\t\t\ttransform.isApprox(transformHalf2) || transform.isApprox(transformHalf3));\n\t\t}\n\n\t\t{\n\t\t\tTransform transform = SurgSim::Math::interpolate(transform0, transform1, static_cast<T>(0.839));\n\t\t\tEXPECT_FALSE(transform.isApprox(transform0));\n\t\t\tEXPECT_FALSE(transform.isApprox(transform1));\n\t\t}\n\t}\n}\n\nTYPED_TEST(AllRigidTransformTests, MakeLookAt)\n{\n\ttypedef typename TestFixture::Scalar T;\n\ttypedef Eigen::Transform<T, 3, Eigen::Isometry> Transform;\n\n\ttypedef Eigen::Matrix<T, 3, 1> Vector3;\n\ttypedef Eigen::Matrix<T, 4, 1> Vector4;\n\n\tVector3 origin(0.0, 0.0, 0.0);\n\tVector3 eye(10.0, 10.0, 10.0);\n\tVector3 up(0.0, 1.0, 0.0);\n\n\tVector4 point4(10.0, 10.0, 10.0, 1.0);\n\tVector4 origin4(0.0, 0.0, 0.0, 1.0);\n\n\tTransform transform = SurgSim::Math::makeRigidTransform(eye, origin, up);\n\n\tEXPECT_TRUE(origin4.isApprox(transform*point4)) << transform * point4;\n}\n\n\n<commit_msg>Fix the testdata for the makerigidtransform test<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 that exercise the functionality of our rigid transform typedefs, which\n\/\/\/ come straight from Eigen.\n\n#include <Eigen\/Core>\n#include <Eigen\/Geometry>\n#include \"SurgSim\/Math\/RigidTransform.h\"\n#include \"SurgSim\/Math\/Quaternion.h\"\n#include \"gtest\/gtest.h\"\n\ntemplate <class T>\nclass RigidTransformTestBase : public testing::Test\n{\npublic:\n\ttypedef T RigidTransform;\n\ttypedef typename T::Scalar Scalar;\n};\n\n\ntemplate <class T>\nclass RigidTransform3Tests : public RigidTransformTestBase<T>\n{\n};\n\ntypedef ::testing::Types<SurgSim::Math::RigidTransform3d,\n\t\t\t\t\t\t SurgSim::Math::RigidTransform3f> RigidTransform3Variants;\nTYPED_TEST_CASE(RigidTransform3Tests, RigidTransform3Variants);\n\n\ntemplate <class T>\nclass AllRigidTransformTests : public RigidTransformTestBase<T>\n{\n};\n\ntypedef ::testing::Types<SurgSim::Math::RigidTransform2d,\n\t\t\t\t\t\t SurgSim::Math::RigidTransform2f,\n\t\t\t\t\t\t SurgSim::Math::RigidTransform3d,\n\t\t\t\t\t\t SurgSim::Math::RigidTransform3f> AllRigidTransformVariants;\nTYPED_TEST_CASE(AllRigidTransformTests, AllRigidTransformVariants);\n\n\n\/\/\/ Test that rigid transforms can be constructed\nTYPED_TEST(AllRigidTransformTests, CanConstruct)\n{\n\ttypename TestFixture::RigidTransform transform;\n}\n\n\/\/\/ Test rigid transforms interpolation\nTYPED_TEST(AllRigidTransformTests, Interpolation)\n{\n\tusing SurgSim::Math::makeRigidTransform;\n\n\ttypedef typename TestFixture::Scalar T;\n\ttypedef Eigen::Quaternion<T> Quaternion;\n\ttypedef Eigen::Transform<T, 3, Eigen::Isometry> Transform;\n\ttypedef Eigen::Matrix<T, 3, 1> Vector3;\n\n\tfor (unsigned int numLoop = 0; numLoop < 100; numLoop++)\n\t{\n\t\tQuaternion q0(Eigen::Matrix<T,4,1>::Random());\n\t\tQuaternion q1(Eigen::Matrix<T,4,1>::Random());\n\t\tq0.normalize();\n\t\tq1.normalize();\n\n\t\tVector3 t0(Vector3::Random());\n\t\tVector3 t1(Vector3::Random());\n\n\t\tTransform transform0 = makeRigidTransform(q0, t0);\n\t\tTransform transform1 = makeRigidTransform(q1, t1);\n\t\t{\n\t\t\tTransform transform = SurgSim::Math::interpolate(transform0, transform1, static_cast<T>(0.0));\n\t\t\tEXPECT_TRUE(transform.isApprox(transform0));\n\t\t}\n\t\t{\n\t\t\tTransform transform = SurgSim::Math::interpolate(transform0, transform1, static_cast<T>(1.0));\n\t\t\tEXPECT_TRUE(transform.isApprox(transform1));\n\t\t}\n\n\t\t{\n\t\t\tTransform transform = SurgSim::Math::interpolate(transform0, transform1, static_cast<T>(0.234));\n\t\t\tEXPECT_FALSE(transform.isApprox(transform0));\n\t\t\tEXPECT_FALSE(transform.isApprox(transform1));\n\t\t}\n\n\t\t{\n\t\t\tTransform transform = SurgSim::Math::interpolate(transform0, transform1, static_cast<T>(0.5));\n\t\t\tEXPECT_FALSE(transform.isApprox(transform0));\n\t\t\tEXPECT_FALSE(transform.isApprox(transform1));\n\n\t\t\t\/\/ At t=0.5, the rotation interpolation should return (q0 + q1)\/2 normalized\n\t\t\t\/\/ c.f. http:\/\/en.wikipedia.org\/wiki\/Slerp\n\t\t\t\/\/ If the quaternions are over PI angle, the slerp will interpolate between q0 and -q1\n\t\t\t\/\/ in this case, the interpolation is (q0 - q1)\/2 normalized\n\t\t\t\/\/ From our specification, both quaternions could be considered negative, so we extend\n\t\t\t\/\/ the tests to these possibilities as well:\n\t\t\t\/\/ (-q0 + q1) \/ 2 normalized\n\t\t\t\/\/ (-q0 - q1) \/ 2 normalized\n\t\t\tQuaternion qHalf0(( q0.coeffs() + q1.coeffs()) * 0.5);\n\t\t\tQuaternion qHalf1(( q0.coeffs() - q1.coeffs()) * 0.5);\n\t\t\tQuaternion qHalf2((-q0.coeffs() + q1.coeffs()) * 0.5);\n\t\t\tQuaternion qHalf3((-q0.coeffs() - q1.coeffs()) * 0.5);\n\t\t\tqHalf0.normalize();\n\t\t\tqHalf1.normalize();\n\t\t\tqHalf2.normalize();\n\t\t\tqHalf3.normalize();\n\n\t\t\tVector3 tHalf = (t0 + t1) * 0.5;\n\t\t\tTransform transformHalf0 = makeRigidTransform(qHalf0, tHalf);\n\t\t\tTransform transformHalf1 = makeRigidTransform(qHalf1, tHalf);\n\t\t\tTransform transformHalf2 = makeRigidTransform(qHalf2, tHalf);\n\t\t\tTransform transformHalf3 = makeRigidTransform(qHalf3, tHalf);\n\t\t\tEXPECT_TRUE(transform.isApprox(transformHalf0) || transform.isApprox(transformHalf1) ||\n\t\t\t\ttransform.isApprox(transformHalf2) || transform.isApprox(transformHalf3));\n\t\t}\n\n\t\t{\n\t\t\tTransform transform = SurgSim::Math::interpolate(transform0, transform1, static_cast<T>(0.839));\n\t\t\tEXPECT_FALSE(transform.isApprox(transform0));\n\t\t\tEXPECT_FALSE(transform.isApprox(transform1));\n\t\t}\n\t}\n}\n\nTYPED_TEST(AllRigidTransformTests, MakeLookAt)\n{\n\ttypedef typename TestFixture::Scalar T;\n\ttypedef Eigen::Transform<T, 3, Eigen::Isometry> Transform;\n\n\ttypedef Eigen::Matrix<T, 3, 1> Vector3;\n\ttypedef Eigen::Matrix<T, 4, 1> Vector4;\n\n\tVector3 origin(0.0, 0.0, 0.0);\n\tVector3 eye(10.0, 10.0, 10.0);\n\tVector3 up(0.0, 1.0, 0.0);\n\n\tVector4 center4(0.0, 0.0, 0.0, 1.0);\n\n\t\/\/ This follows the OpenGl convention for the camera view matrix transform, any axis would do see\n\t\/\/ the documentation for makeRigidTransform and gluLookAt()\n\tVector4 direction4(0.0, 0.0, -1.0, 1.0);\n\tVector4 eye4(10.0, 10.0, 10.0, 1.0);\n\n\tTransform transform = SurgSim::Math::makeRigidTransform(eye, origin, up);\n\n\tEXPECT_TRUE(eye4.isApprox(transform*center4));\n\t\n\tVector4 transformed = transform*direction4;\n\n\tVector3 direction3(transformed[0], transformed[1], transformed[2]);\n\tEXPECT_TRUE(eye.normalized().isApprox(direction3.normalized()));\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: editbrowsebox2.cxx,v $\n *\n *  $Revision: 1.15 $\n *\n *  last change: $Author: hr $ $Date: 2007-06-27 14:49: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_svtools.hxx\"\n#ifndef _SVTOOLS_EDITBROWSEBOX_HXX_\n#include \"editbrowsebox.hxx\"\n#endif\n#ifndef _COM_SUN_STAR_ACCESSIBILITY_XACCESSIBLE_HPP_\n#include <com\/sun\/star\/accessibility\/XAccessible.hpp>\n#endif\n#ifndef _COM_SUN_STAR_ACCESSIBILITY_ACCESSIBLEEVENTID_HPP_\n#include <com\/sun\/star\/accessibility\/AccessibleEventId.hpp>\n#endif\n#ifndef SVTOOLS_EDITBROWSEBOX_IMPL_HXX\n#include \"editbrowseboximpl.hxx\"\n#endif\n#ifndef _COMPHELPER_TYPES_HXX_\n#include <comphelper\/types.hxx>\n#endif\n#ifndef _TOOLKIT_HELPER_VCLUNOHELPER_HXX_\n#include <toolkit\/helper\/vclunohelper.hxx>\n#endif\n#ifndef SVTOOLS_ACCESSIBLE_FACTORY_ACCESS_HXX\n#include \"svtaccessiblefactory.hxx\"\n#endif\n\nnamespace svt\n{\n    using namespace com::sun::star::accessibility;\n    using namespace com::sun::star::uno;\n    using namespace ::com::sun::star::accessibility::AccessibleEventId;\n\n\/\/ -----------------------------------------------------------------------------\nReference< XAccessible > EditBrowseBox::CreateAccessibleCheckBoxCell(long _nRow, USHORT _nColumnPos,const TriState& eState,sal_Bool _bEnabled)\n{\n    Reference< XAccessible > xAccessible( GetAccessible() );\n    Reference< XAccessibleContext > xAccContext;\n    if ( xAccessible.is() )\n        xAccContext = xAccessible->getAccessibleContext();\n\n    Reference< XAccessible > xReturn;\n    if ( xAccContext.is() )\n    {\n        xReturn = getAccessibleFactory().createAccessibleCheckBoxCell(\n            xAccContext->getAccessibleChild( ::svt::BBINDEX_TABLE ),\n            *this,\n            NULL,\n            _nRow,\n            _nColumnPos,\n            eState,\n            _bEnabled,\n            sal_True\n        );\n    }\n    return xReturn;\n}\n\/\/ -----------------------------------------------------------------------------\nReference< XAccessible > EditBrowseBox::CreateAccessibleCell( sal_Int32 _nRow, sal_uInt16 _nColumnPos )\n{\n    return BrowseBox::CreateAccessibleCell( _nRow, _nColumnPos );\n}\n\/\/ -----------------------------------------------------------------------------\nsal_Int32 EditBrowseBox::GetAccessibleControlCount() const\n{\n    return IsEditing() ? 1 : 0;\n}\n\/\/ -----------------------------------------------------------------------------\nvoid EditBrowseBox::implCreateActiveAccessible( )\n{\n    DBG_ASSERT( IsEditing(), \"EditBrowseBox::implCreateActiveAccessible: not to be called if we're not editing currently!\" );\n    DBG_ASSERT( !m_aImpl->m_xActiveCell.is(), \"EditBrowseBox::implCreateActiveAccessible: not to be called if the old one is still alive!\" );\n\n    if ( !m_aImpl->m_xActiveCell.is() && IsEditing() )\n    {\n         Reference< XAccessible > xCont = aController->GetWindow().GetAccessible();\n         Reference< XAccessible > xMy = GetAccessible();\n         if ( xMy.is() && xCont.is() )\n          {\n             m_aImpl->m_xActiveCell = getAccessibleFactory().createEditBrowseBoxTableCellAccess(\n                 xMy,                                                       \/\/ parent accessible\n                 xCont,                                                     \/\/ control accessible\n                 VCLUnoHelper::GetInterface( &aController->GetWindow() ),   \/\/ focus window (for notifications)\n                 *this,                                                     \/\/ the browse box\n                 GetCurRow(),\n                 GetColumnPos( GetCurColumnId() )\n             );\n\n             commitBrowseBoxEvent( CHILD, makeAny( m_aImpl->m_xActiveCell ), Any() );\n          }\n    }\n}\n\n\/\/ -----------------------------------------------------------------------------\nReference< XAccessible > EditBrowseBox::CreateAccessibleControl( sal_Int32\n#ifdef DBG_UTIL\n_nIndex\n#endif\n)\n{\n    DBG_ASSERT( 0 == _nIndex, \"EditBrowseBox::CreateAccessibleControl: invalid index!\" );\n\n    if ( isAccessibleAlive() )\n    {\n        if ( !m_aImpl->m_xActiveCell.is() )\n            implCreateActiveAccessible();\n    }\n\n    return m_aImpl->m_xActiveCell;\n}\n\/\/ -----------------------------------------------------------------------------\nReference<XAccessible > EditBrowseBox::CreateAccessibleRowHeader( sal_Int32 _nRow )\n{\n    return BrowseBox::CreateAccessibleRowHeader( _nRow );\n}\n\/\/ -----------------------------------------------------------------------------\nvoid EditBrowseBoxImpl::clearActiveCell()\n{\n    try\n    {\n        ::comphelper::disposeComponent(m_xActiveCell);\n    }\n    catch(const Exception&)\n    {\n        OSL_ENSURE( sal_False, \"EditBrowseBoxImpl::clearActiveCell: caught an exception while disposing the AccessibleCell!\" );\n    }\n\n    m_xActiveCell = NULL;\n}\n\/\/ -----------------------------------------------------------------------------\nvoid EditBrowseBox::GrabTableFocus()\n{\n    if ( aController.Is() )\n        aController->GetWindow().GrabFocus();\n}\n\/\/------------------------------------------------------------------------------\nvoid EditBrowseBox::DetermineFocus( const sal_uInt16 _nGetFocusFlags )\n{\n    sal_Bool bFocus = sal_False;\n    for (Window* pWindow = Application::GetFocusWindow();\n         pWindow && !bFocus;\n         pWindow = pWindow->GetParent())\n         bFocus = pWindow == this;\n\n    if (bFocus != bHasFocus)\n    {\n        bHasFocus = bFocus;\n\n        if ( GetBrowserFlags( ) & EBBF_SMART_TAB_TRAVEL )\n        {\n            if  (   bHasFocus                           \/\/ we got the focus\n                &&  ( _nGetFocusFlags & GETFOCUS_TAB )  \/\/ using the TAB key\n                )\n            {\n                long nRows = GetRowCount();\n                USHORT nCols = ColCount();\n\n                if ( ( nRows > 0 ) && ( nCols > 0 ) )\n                {\n                    if ( _nGetFocusFlags & GETFOCUS_FORWARD )\n                    {\n                        if ( GetColumnId( 0 ) != 0 )\n                        {\n                            GoToRowColumnId( 0, GetColumnId( 0 ) );\n                        }\n                        else\n                        {   \/\/ the first column is the handle column -> not focussable\n                            if ( nCols > 1 )\n                                GoToRowColumnId( 0, GetColumnId( 1 ) );\n                        }\n                    }\n                    else if ( _nGetFocusFlags & GETFOCUS_BACKWARD )\n                    {\n                        GoToRowColumnId( nRows - 1, GetColumnId( nCols -1 ) );\n                    }\n                }\n            }\n        }\n    }\n}\n\/\/ -----------------------------------------------------------------------------\nRectangle EditBrowseBox::GetFieldCharacterBounds(sal_Int32 _nRow,sal_Int32 _nColumnPos,sal_Int32 _nIndex)\n{\n    Rectangle aRect;\n    if ( SeekRow(_nRow) )\n    {\n        CellController* pController = GetController(\n            _nRow, GetColumnId( sal::static_int_cast< USHORT >(_nColumnPos) ) );\n        if ( pController )\n            aRect = pController->GetWindow().GetCharacterBounds(_nIndex);\n    }\n    return aRect;\n}\n\/\/ -----------------------------------------------------------------------------\nsal_Int32 EditBrowseBox::GetFieldIndexAtPoint(sal_Int32 _nRow,sal_Int32 _nColumnPos,const Point& _rPoint)\n{\n    sal_Int32 nRet = -1;\n    if ( SeekRow(_nRow) )\n    {\n        CellController* pController = GetController(\n            _nRow, GetColumnId( sal::static_int_cast< USHORT >(_nColumnPos) ) );\n        if ( pController )\n            nRet = pController->GetWindow().GetIndexForPoint(_rPoint);\n    }\n    return nRet;\n}\n\/\/ -----------------------------------------------------------------------------\n\/\/ -----------------------------------------------------------------------------\n} \/\/ namespace svt\n\/\/ -----------------------------------------------------------------------------\n\n\n<commit_msg>INTEGRATION: CWS vgbugs07 (1.14.180); FILE MERGED 2007\/06\/04 13:31:25 vg 1.14.180.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: editbrowsebox2.cxx,v $\n *\n *  $Revision: 1.16 $\n *\n *  last change: $Author: hr $ $Date: 2007-06-27 21:09:10 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_svtools.hxx\"\n#ifndef _SVTOOLS_EDITBROWSEBOX_HXX_\n#include <svtools\/editbrowsebox.hxx>\n#endif\n#ifndef _COM_SUN_STAR_ACCESSIBILITY_XACCESSIBLE_HPP_\n#include <com\/sun\/star\/accessibility\/XAccessible.hpp>\n#endif\n#ifndef _COM_SUN_STAR_ACCESSIBILITY_ACCESSIBLEEVENTID_HPP_\n#include <com\/sun\/star\/accessibility\/AccessibleEventId.hpp>\n#endif\n#ifndef SVTOOLS_EDITBROWSEBOX_IMPL_HXX\n#include \"editbrowseboximpl.hxx\"\n#endif\n#ifndef _COMPHELPER_TYPES_HXX_\n#include <comphelper\/types.hxx>\n#endif\n#ifndef _TOOLKIT_HELPER_VCLUNOHELPER_HXX_\n#include <toolkit\/helper\/vclunohelper.hxx>\n#endif\n#ifndef SVTOOLS_ACCESSIBLE_FACTORY_ACCESS_HXX\n#include \"svtaccessiblefactory.hxx\"\n#endif\n\nnamespace svt\n{\n    using namespace com::sun::star::accessibility;\n    using namespace com::sun::star::uno;\n    using namespace ::com::sun::star::accessibility::AccessibleEventId;\n\n\/\/ -----------------------------------------------------------------------------\nReference< XAccessible > EditBrowseBox::CreateAccessibleCheckBoxCell(long _nRow, USHORT _nColumnPos,const TriState& eState,sal_Bool _bEnabled)\n{\n    Reference< XAccessible > xAccessible( GetAccessible() );\n    Reference< XAccessibleContext > xAccContext;\n    if ( xAccessible.is() )\n        xAccContext = xAccessible->getAccessibleContext();\n\n    Reference< XAccessible > xReturn;\n    if ( xAccContext.is() )\n    {\n        xReturn = getAccessibleFactory().createAccessibleCheckBoxCell(\n            xAccContext->getAccessibleChild( ::svt::BBINDEX_TABLE ),\n            *this,\n            NULL,\n            _nRow,\n            _nColumnPos,\n            eState,\n            _bEnabled,\n            sal_True\n        );\n    }\n    return xReturn;\n}\n\/\/ -----------------------------------------------------------------------------\nReference< XAccessible > EditBrowseBox::CreateAccessibleCell( sal_Int32 _nRow, sal_uInt16 _nColumnPos )\n{\n    return BrowseBox::CreateAccessibleCell( _nRow, _nColumnPos );\n}\n\/\/ -----------------------------------------------------------------------------\nsal_Int32 EditBrowseBox::GetAccessibleControlCount() const\n{\n    return IsEditing() ? 1 : 0;\n}\n\/\/ -----------------------------------------------------------------------------\nvoid EditBrowseBox::implCreateActiveAccessible( )\n{\n    DBG_ASSERT( IsEditing(), \"EditBrowseBox::implCreateActiveAccessible: not to be called if we're not editing currently!\" );\n    DBG_ASSERT( !m_aImpl->m_xActiveCell.is(), \"EditBrowseBox::implCreateActiveAccessible: not to be called if the old one is still alive!\" );\n\n    if ( !m_aImpl->m_xActiveCell.is() && IsEditing() )\n    {\n         Reference< XAccessible > xCont = aController->GetWindow().GetAccessible();\n         Reference< XAccessible > xMy = GetAccessible();\n         if ( xMy.is() && xCont.is() )\n          {\n             m_aImpl->m_xActiveCell = getAccessibleFactory().createEditBrowseBoxTableCellAccess(\n                 xMy,                                                       \/\/ parent accessible\n                 xCont,                                                     \/\/ control accessible\n                 VCLUnoHelper::GetInterface( &aController->GetWindow() ),   \/\/ focus window (for notifications)\n                 *this,                                                     \/\/ the browse box\n                 GetCurRow(),\n                 GetColumnPos( GetCurColumnId() )\n             );\n\n             commitBrowseBoxEvent( CHILD, makeAny( m_aImpl->m_xActiveCell ), Any() );\n          }\n    }\n}\n\n\/\/ -----------------------------------------------------------------------------\nReference< XAccessible > EditBrowseBox::CreateAccessibleControl( sal_Int32\n#ifdef DBG_UTIL\n_nIndex\n#endif\n)\n{\n    DBG_ASSERT( 0 == _nIndex, \"EditBrowseBox::CreateAccessibleControl: invalid index!\" );\n\n    if ( isAccessibleAlive() )\n    {\n        if ( !m_aImpl->m_xActiveCell.is() )\n            implCreateActiveAccessible();\n    }\n\n    return m_aImpl->m_xActiveCell;\n}\n\/\/ -----------------------------------------------------------------------------\nReference<XAccessible > EditBrowseBox::CreateAccessibleRowHeader( sal_Int32 _nRow )\n{\n    return BrowseBox::CreateAccessibleRowHeader( _nRow );\n}\n\/\/ -----------------------------------------------------------------------------\nvoid EditBrowseBoxImpl::clearActiveCell()\n{\n    try\n    {\n        ::comphelper::disposeComponent(m_xActiveCell);\n    }\n    catch(const Exception&)\n    {\n        OSL_ENSURE( sal_False, \"EditBrowseBoxImpl::clearActiveCell: caught an exception while disposing the AccessibleCell!\" );\n    }\n\n    m_xActiveCell = NULL;\n}\n\/\/ -----------------------------------------------------------------------------\nvoid EditBrowseBox::GrabTableFocus()\n{\n    if ( aController.Is() )\n        aController->GetWindow().GrabFocus();\n}\n\/\/------------------------------------------------------------------------------\nvoid EditBrowseBox::DetermineFocus( const sal_uInt16 _nGetFocusFlags )\n{\n    sal_Bool bFocus = sal_False;\n    for (Window* pWindow = Application::GetFocusWindow();\n         pWindow && !bFocus;\n         pWindow = pWindow->GetParent())\n         bFocus = pWindow == this;\n\n    if (bFocus != bHasFocus)\n    {\n        bHasFocus = bFocus;\n\n        if ( GetBrowserFlags( ) & EBBF_SMART_TAB_TRAVEL )\n        {\n            if  (   bHasFocus                           \/\/ we got the focus\n                &&  ( _nGetFocusFlags & GETFOCUS_TAB )  \/\/ using the TAB key\n                )\n            {\n                long nRows = GetRowCount();\n                USHORT nCols = ColCount();\n\n                if ( ( nRows > 0 ) && ( nCols > 0 ) )\n                {\n                    if ( _nGetFocusFlags & GETFOCUS_FORWARD )\n                    {\n                        if ( GetColumnId( 0 ) != 0 )\n                        {\n                            GoToRowColumnId( 0, GetColumnId( 0 ) );\n                        }\n                        else\n                        {   \/\/ the first column is the handle column -> not focussable\n                            if ( nCols > 1 )\n                                GoToRowColumnId( 0, GetColumnId( 1 ) );\n                        }\n                    }\n                    else if ( _nGetFocusFlags & GETFOCUS_BACKWARD )\n                    {\n                        GoToRowColumnId( nRows - 1, GetColumnId( nCols -1 ) );\n                    }\n                }\n            }\n        }\n    }\n}\n\/\/ -----------------------------------------------------------------------------\nRectangle EditBrowseBox::GetFieldCharacterBounds(sal_Int32 _nRow,sal_Int32 _nColumnPos,sal_Int32 _nIndex)\n{\n    Rectangle aRect;\n    if ( SeekRow(_nRow) )\n    {\n        CellController* pController = GetController(\n            _nRow, GetColumnId( sal::static_int_cast< USHORT >(_nColumnPos) ) );\n        if ( pController )\n            aRect = pController->GetWindow().GetCharacterBounds(_nIndex);\n    }\n    return aRect;\n}\n\/\/ -----------------------------------------------------------------------------\nsal_Int32 EditBrowseBox::GetFieldIndexAtPoint(sal_Int32 _nRow,sal_Int32 _nColumnPos,const Point& _rPoint)\n{\n    sal_Int32 nRet = -1;\n    if ( SeekRow(_nRow) )\n    {\n        CellController* pController = GetController(\n            _nRow, GetColumnId( sal::static_int_cast< USHORT >(_nColumnPos) ) );\n        if ( pController )\n            nRet = pController->GetWindow().GetIndexForPoint(_rPoint);\n    }\n    return nRet;\n}\n\/\/ -----------------------------------------------------------------------------\n\/\/ -----------------------------------------------------------------------------\n} \/\/ namespace svt\n\/\/ -----------------------------------------------------------------------------\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\n@Copyright Barrett Adair 2015-2017\nDistributed under the Boost Software License, Version 1.0.\n(See accompanying file LICENSE.md or copy at http:\/\/boost.org\/LICENSE_1_0.txt)\n\n*\/\n\n#ifndef BOOST_CLBL_TRTS_IS_CONST_MEMBER_HPP\n#define BOOST_CLBL_TRTS_IS_CONST_MEMBER_HPP\n\n#include <boost\/callable_traits\/detail\/core.hpp>\n\nnamespace boost { namespace callable_traits {\n\n\/\/[ is_const_member_hpp\n\/*`[section:ref_is_const_member is_const_member]\n[heading Header]\n``#include <boost\/callable_traits\/is_const_member.hpp>``\n[heading Definition]\n*\/\n\n\/\/ inherits from either std::true_type or std::false_type\ntemplate<typename T>\nstruct is_const_member;\n\n\/\/<-\ntemplate<typename T>\nstruct is_const_member\n    : detail::traits<detail::shallow_decay<T>>::is_const_member {\n    using type = typename detail::traits<\n        detail::shallow_decay<T>>::is_const_member;\n};\n\n#ifdef BOOST_CLBL_TRTS_DISABLE_VARIABLE_TEMPLATES\n\ntemplate<typename T>\nstruct is_const_member_v {\n    static_assert(std::is_same<T, detail::dummy>::value,\n        \"Variable templates not supported on this compiler.\");\n};\n\n#else\n\/\/->\n\/\/ only available when variable templates are supported\ntemplate<typename T>\n\/\/<-\nBOOST_CLBL_TRAITS_INLINE_VAR\n\/\/->\nconstexpr bool is_const_member_v = \/\/see below\n\/\/<-\n    detail::traits<detail::shallow_decay<T>>::is_const_member::value;\n\n#endif\n\n}} \/\/ namespace boost::callable_traits\n\/\/->\n\n\/*`\n[heading Constraints]\n* none\n\n[heading Behavior]\n* `is_const_member<T>::value` is `true` when either:\n  * `T` is a function type with a `const` member qualifier\n  * `T` is a pointer to a member function with a `const` member qualifier\n  * `T` is a function object with a non-overloaded `operator()`, where the `operator()` has a `const` member qualifier\n* On compilers that support variable templates, `is_const_member_v<T>` is equivalent to `is_const_member<T>::value`.\n\n[heading Input\/Output Examples]\n[table\n    [[`T`]                              [`is_const_member_v<T>`]]\n    [[`int() const`]                    [`true`]]\n    [[`int() const volatile`]           [`true`]]\n    [[`int() const & transaction_safe`] [`true`]]\n    [[`int() const &&`]                 [`true`]]\n    [[`int(foo::*&)() const`]           [`true`]]\n    [[`int(foo::*)() const volatile`]   [`true`]]\n    [[`int(foo::*)() const volatile &&`][`true`]]\n    [[`int(foo::* const)() const`]      [`true`]]\n    [[`int()`]                          [`false`]]\n    [[`int() volatile`]                 [`false`]]\n    [[`int() &&`]                       [`false`]]\n    [[`int(*)()`]                       [`false`]]\n    [[`int`]                            [`false`]]\n    [[`int foo::*`]                     [`false`]]\n    [[`const int foo::*`]               [`false`]]\n]\n\n[heading Example Program]\n[import ..\/example\/is_const_member.cpp]\n[is_const_member]\n[endsect]\n*\/\n\/\/]\n\n#endif \/\/ #ifndef BOOST_CLBL_TRTS_IS_CONST_MEMBER_HPP\n<commit_msg>Delete is_const_member.hpp<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/!\n\/\/! @file   HydraulicPressureSourceC.hpp\n\/\/! @author FluMeS\n\/\/! @date   2009-12-21\n\/\/!\n\/\/! @brief Contains a Hydraulic Pressure Source Component of C-type\n\/\/!\n\/\/$Id$\n\n#ifndef HYDRAULICPRESSURESOURCEC_HPP_INCLUDED\n#define HYDRAULICPRESSURESOURCEC_HPP_INCLUDED\n\n#include <iostream>\n#include \"..\/..\/ComponentEssentials.h\"\n\nnamespace hopsan {\n\n    \/\/!\n    \/\/! @brief\n    \/\/! @ingroup HydraulicComponents\n    \/\/!\n    class HydraulicPressureSourceC : public ComponentC\n    {\n    private:\n        double Zc;\n        double p;\n        Port *mpIn, *mpP1;\n\n        double *mpND_in, *mpND_p, *mpND_q, *mpND_c, *mpND_Zc;\n\n    public:\n        static Component *Creator()\n        {\n            return new HydraulicPressureSourceC(\"PressureSourceC\");\n        }\n\n        HydraulicPressureSourceC(const std::string name) : ComponentC(name)\n        {\n            mTypeName = \"HydraulicPressureSourceC\";\n            p         = 1.0e5;\n            Zc        = 0.0;\n\n            mpIn = addReadPort(\"In\", \"NodeSignal\", Port::NOTREQUIRED);\n            mpP1 = addPowerPort(\"P1\", \"NodeHydraulic\");\n\n            registerParameter(\"P\", \"Default pressure\", \"[Pa]\", p);\n\n            setStartValue(mpP1, NodeHydraulic::PRESSURE, p);\n            setStartValue(mpP1, NodeHydraulic::FLOW, 0.0);\n        }\n\n\n        void initialize()\n        {\n\n            mpND_in = getSafeNodeDataPtr(mpIn, NodeSignal::VALUE, p);\n            mpND_p = getSafeNodeDataPtr(mpP1, NodeHydraulic::PRESSURE);\n            mpND_c = getSafeNodeDataPtr(mpP1, NodeHydraulic::WAVEVARIABLE);\n            mpND_Zc = getSafeNodeDataPtr(mpP1, NodeHydraulic::CHARIMP);\n\n            (*mpND_p) = p; \/\/Override the startvalue for the pressure\n            setStartValue(mpP1, NodeHydraulic::PRESSURE, p); \/\/This is here to show the user that the start value is hard coded!\n\n            simulateOneTimestep();\n        }\n\n\n        void simulateOneTimestep()\n        {\n            (*mpND_c) = (*mpND_in);\n            (*mpND_Zc) = Zc;\n        }\n    };\n}\n\n#endif \/\/ HYDRAULICPRESSURESOURCEC_HPP_INCLUDED\n<commit_msg>Added (outcommented) real-time support for pressure source<commit_after>\/\/!\n\/\/! @file   HydraulicPressureSourceC.hpp\n\/\/! @author FluMeS\n\/\/! @date   2009-12-21\n\/\/!\n\/\/! @brief Contains a Hydraulic Pressure Source Component of C-type\n\/\/!\n\/\/$Id$\n\n#ifndef HYDRAULICPRESSURESOURCEC_HPP_INCLUDED\n#define HYDRAULICPRESSURESOURCEC_HPP_INCLUDED\n\n#include <iostream>\n#include \"..\/..\/ComponentEssentials.h\"\n\nnamespace hopsan {\n\n    \/\/!\n    \/\/! @brief\n    \/\/! @ingroup HydraulicComponents\n    \/\/!\n    class HydraulicPressureSourceC : public ComponentC\n    {\n    private:\n        double Zc;\n        double p;\n        Port *mpIn, *mpP1;\n\n        double *mpND_in, *mpND_p, *mpND_q, *mpND_c, *mpND_Zc;\n\n    public:\n        static Component *Creator()\n        {\n            return new HydraulicPressureSourceC(\"PressureSourceC\");\n        }\n\n        HydraulicPressureSourceC(const std::string name) : ComponentC(name)\n        {\n            mTypeName = \"HydraulicPressureSourceC\";\n            p         = 1.0e5;\n            Zc        = 0.0;\n\n            mpIn = addReadPort(\"In\", \"NodeSignal\", Port::NOTREQUIRED);\n            mpP1 = addPowerPort(\"P1\", \"NodeHydraulic\");\n\n            registerParameter(\"P\", \"Default pressure\", \"[Pa]\", p);\n\n            setStartValue(mpP1, NodeHydraulic::PRESSURE, p);\n            setStartValue(mpP1, NodeHydraulic::FLOW, 0.0);\n        }\n\n\n        void initialize()\n        {\n\n            mpND_in = getSafeNodeDataPtr(mpIn, NodeSignal::VALUE, p);\n            mpND_p = getSafeNodeDataPtr(mpP1, NodeHydraulic::PRESSURE);\n            mpND_c = getSafeNodeDataPtr(mpP1, NodeHydraulic::WAVEVARIABLE);\n            mpND_Zc = getSafeNodeDataPtr(mpP1, NodeHydraulic::CHARIMP);\n\n            (*mpND_p) = p; \/\/Override the startvalue for the pressure\n            setStartValue(mpP1, NodeHydraulic::PRESSURE, p); \/\/This is here to show the user that the start value is hard coded!\n\n            simulateOneTimestep();\n        }\n\n\n        void simulateOneTimestep()\n        {\n            (*mpND_c) = (*mpND_in);\n            (*mpND_Zc) = Zc;\n\n\/\/            if(mpIn->isConnected())\n\/\/                    (*mpND_c) = (*mpND_in);\n\/\/            else\n\/\/                    (*mpND_c) = p;\n\/\/            (*mpND_Zc) = Zc;\n        }\n    };\n}\n\n#endif \/\/ HYDRAULICPRESSURESOURCEC_HPP_INCLUDED\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\r\n \r\nProgram:   Medical Imaging & Interaction Toolkit\r\nModule:    $RCSfile: mitkPropertyManager.cpp,v $\r\nLanguage:  C++\r\nDate:      $Date$\r\nVersion:   $Revision: 1.12 $\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 \"mitkImageSerializer.h\"\r\n\r\n#include \"mitkImageWriter.h\"\r\n\r\nMITK_REGISTER_SERIALIZER(ImageSerializer)\r\n\r\nmitk::ImageSerializer::ImageSerializer()\r\n{\r\n}\r\n\r\nmitk::ImageSerializer::~ImageSerializer()\r\n{\r\n}\r\n\r\nstd::string mitk::ImageSerializer::Serialize()\r\n{\r\n  LOG_INFO << this->GetNameOfClass() \r\n           << \" is asked to serialize an object \" << (const void*) this->m_Data\r\n           << \" into a directory \" << m_WorkingDirectory\r\n           << \" using a filename hint \" << m_FilenameHint;\r\n\r\n  const Image* image = dynamic_cast<const Image*>( m_Data.GetPointer() );\r\n  if (!image)\r\n  {\r\n    LOG_ERROR << \" Object at \" << (const void*) this->m_Data\r\n              << \" is not an mitk::Image. Cannot serialize as image.\";\r\n    return \"\";\r\n  }\r\n\r\n  std::string filename( this->GetUniqueFilenameInWorkingDirectory() );\r\nstd::cout << \"creating file \" << filename << \" in \" << m_WorkingDirectory << std::endl;\r\n  filename += \"_\";\r\n  filename += m_FilenameHint;\r\n\r\n  std::string fullname(m_WorkingDirectory);\r\n  fullname += \"\/\";\r\n  fullname += filename;\r\n\r\n  try\r\n  {\r\n    ImageWriter::Pointer writer = ImageWriter::New();\r\n    writer->SetFileName( fullname );\r\n    writer->SetExtension(\".pic\");\r\n    writer->SetInput( const_cast<Image*>(image) ); \/\/ bad writer design??\r\n    writer->Write();\r\n  }\r\n  catch (std::exception& e)\r\n  {\r\n    LOG_ERROR << \" Error serializing object at \" << (const void*) this->m_Data\r\n              << \" to \" \r\n              << fullname \r\n              << \": \" \r\n              << e.what();\r\n    return \"\";\r\n  }\r\n\r\n  return filename + \".pic\";\r\n}\r\n\r\n<commit_msg>FIX (#2183): use plattform specific path separator, query the used file name from ImageWriter to make sure that the correct file name is written to the scene file.<commit_after>\/*=========================================================================\r\n \r\nProgram:   Medical Imaging & Interaction Toolkit\r\nModule:    $RCSfile: mitkPropertyManager.cpp,v $\r\nLanguage:  C++\r\nDate:      $Date$\r\nVersion:   $Revision: 1.12 $\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 \"mitkImageSerializer.h\"\r\n\r\n#include \"mitkImageWriter.h\"\r\n#include <Poco\/Path.h>\r\n\r\nMITK_REGISTER_SERIALIZER(ImageSerializer)\r\n\r\nmitk::ImageSerializer::ImageSerializer()\r\n{\r\n}\r\n\r\nmitk::ImageSerializer::~ImageSerializer()\r\n{\r\n}\r\n\r\nstd::string mitk::ImageSerializer::Serialize()\r\n{\r\n  LOG_INFO << this->GetNameOfClass() \r\n           << \" is asked to serialize an object \" << (const void*) this->m_Data\r\n           << \" into a directory '\" << m_WorkingDirectory\r\n           << \"' using a filename hint '\" << m_FilenameHint << \"'\";\r\n\r\n  const Image* image = dynamic_cast<const Image*>( m_Data.GetPointer() );\r\n  if (!image)\r\n  {\r\n    LOG_ERROR << \" Object at \" << (const void*) this->m_Data\r\n              << \" is not an mitk::Image. Cannot serialize as image.\";\r\n    return \"\";\r\n  }\r\n\r\n  std::string filename( this->GetUniqueFilenameInWorkingDirectory() );\r\nstd::cout << \"creating file \" << filename << \" in \" << m_WorkingDirectory << std::endl;\r\n  filename += \"_\";\r\n  filename += m_FilenameHint;\r\n\r\n  std::string fullname(m_WorkingDirectory);\r\n  fullname += Poco::Path::separator();\r\n  fullname += filename;\r\n\r\n  try\r\n  {\r\n    ImageWriter::Pointer writer = ImageWriter::New();\r\n    writer->SetFileName( fullname );\r\n    writer->SetExtension(\".pic\");\r\n    writer->SetInput( const_cast<Image*>(image) ); \/\/ bad writer design??\r\n    writer->Write();\r\n    fullname = writer->GetFileName();\r\n  }\r\n  catch (std::exception& e)\r\n  {\r\n    LOG_ERROR << \" Error serializing object at \" << (const void*) this->m_Data\r\n              << \" to \" \r\n              << fullname \r\n              << \": \" \r\n              << e.what();\r\n    return \"\";\r\n  }\r\n  return Poco::Path(fullname).getFileName();\/\/ + \".pic\";\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>INTEGRATION: CWS chart17 (1.15.2); FILE MERGED 2007\/11\/05 13:59:08 iha 1.15.2.1: #i63857#, #i4039# more flexible placement of data point labels, best fit for pie labels<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: dp_sfwk.cxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: rt $ $Date: 2004-10-22 14: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#include \"dp_sfwk.hrc\"\n#include \"dp_backend.h\"\n#include \"dp_ucb.h\"\n#include \"dp_parceldesc.hxx\"\n#include \"rtl\/uri.hxx\"\n#include \"ucbhelper\/content.hxx\"\n#include \"cppuhelper\/exc_hlp.hxx\"\n#include \"svtools\/inettype.hxx\"\n#include <com\/sun\/star\/container\/XNameContainer.hpp>\n#include <com\/sun\/star\/script\/provider\/XScriptProviderFactory.hpp>\n#include <memory>\n\n\nusing namespace ::dp_misc;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::ucb;\nusing namespace ::com::sun::star::script;\n\nusing ::rtl::OUString;\nnamespace css = ::com::sun::star;\n\nnamespace dp_registry\n{\nnamespace backend\n{\nnamespace sfwk\n{\n\n\/\/==============================================================================\nclass BackendImpl : public ::dp_registry::backend::PackageRegistryBackend\n{\nprivate:\n    OUString m_sCtx; \/\/TODO needs an accessor or needs to be passed as part of create for Package\nprotected:\n    \/\/ PackageRegistryBackend\n    virtual Reference<deployment::XPackage> bindPackage_(\n        OUString const & url, OUString const & mediaType,\n        Reference<XCommandEnvironment> const & xCmdEnv );\n\npublic:\n    BackendImpl(\n        Sequence<Any> const & args,\n        Reference<XComponentContext> const & xComponentContext,\n        OUString const & implName,\n        Sequence<OUString> const & supportedMediaTypes );\n\n    OUString getCtx() { return m_sCtx; }\n};\n\n\/\/==============================================================================\nclass PackageImpl : public ::dp_registry::backend::Package\n{\nprotected:\n    Reference< container::XNameContainer > m_xNameCntrPkgHandler;\n\n    inline BackendImpl * getMyBackend() const\n        { return static_cast<BackendImpl *>(m_myBackend.get()); }\n    void initPackageHandler();\n    \/\/ Package\n    virtual beans::Optional< beans::Ambiguous<sal_Bool> > isRegistered_(\n        ::osl::ResettableMutexGuard & guard,\n        ::rtl::Reference<AbortChannel> const & abortChannel,\n        Reference<XCommandEnvironment> const & xCmdEnv );\n    virtual void processPackage_(\n        ::osl::ResettableMutexGuard & guard,\n        bool registerPackage,\n        ::rtl::Reference<AbortChannel> const & abortChannel,\n        Reference<XCommandEnvironment> const & xCmdEnv );\n\n    inline PackageImpl(\n        ::rtl::Reference<BackendImpl> const & myBackend,\n        OUString const & url, OUString const & libType,\n        OUString const & mediaType )\n        : Package( myBackend.get(), url, mediaType,\n                   OUString(), OUString(), \/\/ will be late-initialized\n           OUString( libType ) )\n        { initPackageHandler(); }\n\npublic:\n    static PackageImpl * create(\n        ::rtl::Reference<BackendImpl> const & myBackend,\n        OUString const & url,\n        OUString const & mediaType,\n        Reference<XCommandEnvironment> const &xCmdEnv, OUString const & libType );\n\n    \/\/ XPackage\n    virtual Any SAL_CALL getIcon( sal_Bool highContrast, sal_Bool smallIcon )\n        throw (RuntimeException);\n};\n\n\/\/______________________________________________________________________________\nPackageImpl * PackageImpl::create(\n    ::rtl::Reference<BackendImpl> const & myBackend,\n    OUString const & url,\n    OUString const & mediaType,\n    Reference<XCommandEnvironment> const &xCmdEnv,\n    OUString const & libType  )\n{\n    ::std::auto_ptr<PackageImpl> ret(\n        new PackageImpl( myBackend, url, libType, mediaType ) );\n\n    \/\/ name, displayName:\n    \/\/ name and display name default the same\n    ret->m_displayName = url.copy( url.lastIndexOf( '\/' ) + 1 );\n    ret->m_name = ret->m_displayName;\n\n    OSL_TRACE(\"PakageImpl displayName is %s\",\n        ::rtl::OUStringToOString( ret->m_displayName , RTL_TEXTENCODING_ASCII_US ).pData->buffer );\n\n    return ret.release();\n}\n\n\/\/______________________________________________________________________________\nBackendImpl::BackendImpl(\n    Sequence<Any> const & args,\n    Reference<XComponentContext> const & xComponentContext,\n    OUString const & implName,\n    Sequence<OUString> const & supportedMediaTypes )\n    : PackageRegistryBackend(\n        args, xComponentContext, implName, supportedMediaTypes )\n{\n    if (! transientMode())\n    {\n\/*\n        if (office_is_running())\n        {\n            Reference<XComponentContext> xContext( getComponentContext() );\n            m_xScriptLibs.set(\n                xContext->getServiceManager()->createInstanceWithContext(\n                    OUSTR(\"com.sun.star.\"\n                          \"script.ApplicationScriptLibraryContainer\"),\n                    xContext ), UNO_QUERY_THROW );\n            m_xDialogLibs.set(\n                xContext->getServiceManager()->createInstanceWithContext(\n                    OUSTR(\"com.sun.star.\"\n                          \"script.ApplicationDialogLibraryContainer\"),\n                    xContext ), UNO_QUERY_THROW );\n        }\n        else\n        {\n            OUString basic_path(\n                m_eContext == CONTEXT_USER\n                ? OUSTR(\"vnd.sun.star.expand:${$SYSBINDIR\/\"\n                        SAL_CONFIGFILE(\"bootstrap\")\n                        \":UserInstallation}\/user\/basic\")\n                : OUSTR(\"vnd.sun.star.expand:${$SYSBINDIR\/\"\n                        SAL_CONFIGFILE(\"bootstrap\")\n                        \":BaseInstallation}\/share\/basic\") );\n            m_basic_script_libs.reset(\n                new LibraryContainer(\n                    make_url( basic_path, OUSTR(\"\/script.xlc\") ),\n                    getMutex(),\n                    getComponentContext() ) );\n            m_dialog_libs.reset(\n                new LibraryContainer(\n                    make_url( basic_path, OUSTR(\"\/dialog.xlc\") ),\n                    getMutex(),\n                    getComponentContext() ) );\n        }\n*\/\n        OUString ctx(\n            m_eContext == CONTEXT_USER\n                ? OUSTR(\"user\") : OUSTR(\"share\") );\n        m_sCtx = ctx;\n    }\n}\n\n\/\/==============================================================================\nOUString SAL_CALL getImplementationName()\n{\n    return OUSTR(\"com.sun.star.comp.deployment.sfwk.PackageRegistryBackend\");\n}\n\n\/\/==============================================================================\nReference<XInterface> SAL_CALL create(\n    Sequence<Any> const & args,\n    Reference<XComponentContext> const & xComponentContext )\n    SAL_THROW( (Exception) )\n{\n    OUString const mediaTypes [] = {\n        OUSTR(\"application\/vnd.sun.star.framework-script\")\n    };\n    return static_cast< ::cppu::OWeakObject * >(\n        new BackendImpl(\n            args, xComponentContext, getImplementationName(),\n            Sequence<OUString >( mediaTypes, ARLEN(mediaTypes) ) ) );\n}\n\n\/\/ PackageRegistryBackend\n\/\/______________________________________________________________________________\nReference<deployment::XPackage> BackendImpl::bindPackage_(\n    OUString const & url, OUString const & mediaType_,\n    Reference<XCommandEnvironment> const & xCmdEnv )\n{\n    OUString mediaType( mediaType_ );\n    if (mediaType.getLength() == 0)\n    {\n        \/\/ detect media-type:\n        ::ucb::Content ucbContent;\n        if (create_ucb_content( &ucbContent, url, xCmdEnv ) &&\n            ucbContent.isFolder())\n        {\n            \/\/ probe for script.xlb:\n            if (create_ucb_content(\n                    0, make_url( url, OUSTR(\"parcel-descriptor.xml\") ),\n                    xCmdEnv, false \/* no throw *\/ ))\n        {\n                mediaType = OUSTR(\"application\/vnd.sun.star.framework-script\");\n\n        }\n        }\n        if (mediaType.getLength() == 0)\n            throw lang::IllegalArgumentException(\n                m_strCannotDetectMediaType + url,\n                static_cast<OWeakObject *>(this), static_cast<sal_Int16>(-1) );\n    }\n\n    String type, subType;\n    INetContentTypeParameterList params;\n    if (INetContentTypes::parse( mediaType, type, subType, &params ))\n    {\n        if (type.EqualsIgnoreCaseAscii(\"application\"))\n        {\n            if (subType.EqualsIgnoreCaseAscii(\"vnd.sun.star.framework-script\"))\n            {\n                OUString sParcelDescURL = make_url( url, OUSTR(\"parcel-descriptor.xml\") );\n                ::ucb::Content ucb_content( sParcelDescURL, xCmdEnv );\n                ParcelDescDocHandler* pHandler =\n                    new ParcelDescDocHandler();\n                Reference< xml::sax::XDocumentHandler > xDocHandler =  pHandler;\n                Reference<XComponentContext> xContext( getComponentContext() );\n                Reference< xml::sax::XParser > xParser(\n                    xContext->getServiceManager()->createInstanceWithContext(\n                        OUSTR(\"com.sun.star.xml.sax.Parser\"), xContext ),\n                            UNO_QUERY_THROW );\n                xParser->setDocumentHandler( xDocHandler );\n                xml::sax::InputSource source;\n                source.aInputStream = ucb_content.openStream();\n                source.sSystemId = ucb_content.getURL();\n                xParser->parseStream( source );\n                OUString lang;\n\n                if ( !pHandler->isParsed() )\n                {\n                    throw lang::IllegalArgumentException(\n                        m_strCannotDetectMediaType + url,\n                        static_cast<OWeakObject *>(this), static_cast<sal_Int16>(-1) );\n                }\n                lang =  pHandler->getParcelLanguage();\n                OUString sfwkLibType = getResourceString( RID_STR_SFWK_LIB );\n                \/\/ replace %MACRONAME placeholder with language name\n                OUString MACRONAME( OUSTR(\"%MACROLANG\" ) );\n                sal_Int32 startOfReplace = sfwkLibType.indexOf( MACRONAME );\n                sal_Int32 charsToReplace = MACRONAME.getLength();\n                sfwkLibType = sfwkLibType.replaceAt( startOfReplace, charsToReplace, lang );\n                OSL_TRACE(\"******************************\");\n                OSL_TRACE(\" BackEnd detected lang = %s  \",\n                     rtl::OUStringToOString( lang, RTL_TEXTENCODING_ASCII_US ).getStr() );\n                OSL_TRACE(\" for url %s\",\n                     rtl::OUStringToOString( source.sSystemId, RTL_TEXTENCODING_ASCII_US ).getStr() );\n                OSL_TRACE(\"******************************\");\n                return PackageImpl::create(\n                    this, url, mediaType, xCmdEnv, sfwkLibType );\n            }\n        }\n    }\n    throw lang::IllegalArgumentException(\n        m_strUnsupportedMediaType + mediaType,\n        static_cast<OWeakObject *>(this),\n        static_cast<sal_Int16>(-1) );\n}\n\n\/\/##############################################################################\n\n\/\/ XPackage\n\/\/______________________________________________________________________________\n\nvoid PackageImpl:: initPackageHandler()\n{\n    BackendImpl * that = getMyBackend();\n    Any aContext;\n\n    if ( that->getCtx().equals(  OUSTR(\"user\") ) )\n    {\n        aContext  <<= OUSTR(\"user\");\n\n    }\n    else if ( that->getCtx().equals( OUSTR( \"share\" ) ) )\n    {\n        aContext  <<= OUSTR(\"share\");\n    }\n    else\n    {\n        \/\/ NOT supported at the momemtn \/\/ TODO\n    }\n\n    Reference< provider::XScriptProviderFactory > xFac(\n        that->getComponentContext()->getValueByName(\n            OUSTR( \"\/singletons\/com.sun.star.script.provider.theMasterScriptProviderFactory\") ), UNO_QUERY );\n\n    if ( xFac.is() )\n    {\n        Reference< container::XNameContainer > xName( xFac->createScriptProvider( aContext ), UNO_QUERY );\n        if ( xName.is() )\n        {\n            m_xNameCntrPkgHandler.set( xName );\n        }\n    }\n    \/\/ TODO what happens if above fails??\n}\n\nAny PackageImpl::getIcon( sal_Bool highContrast, sal_Bool smallIcon )\n    throw (RuntimeException)\n{\n    OSL_ASSERT( smallIcon );\n    if (smallIcon)\n    {\n        sal_uInt16 ret = highContrast ? RID_IMG_SCRIPTLIB_HC : RID_IMG_SCRIPTLIB;\n        return makeAny(ret);\n    }\n    return Package::getIcon( highContrast, smallIcon );\n}\n\n\/\/ Package\n\/\/______________________________________________________________________________\nbeans::Optional< beans::Ambiguous<sal_Bool> > PackageImpl::isRegistered_(\n    ::osl::ResettableMutexGuard & guard,\n    ::rtl::Reference<AbortChannel> const & abortChannel,\n    Reference<XCommandEnvironment> const & xCmdEnv )\n{\n    return beans::Optional< beans::Ambiguous<sal_Bool> >(\n        true \/* IsPresent *\/,\n        beans::Ambiguous<sal_Bool>(\n            m_xNameCntrPkgHandler.is() && m_xNameCntrPkgHandler->hasByName(\n                m_url ),\n            false \/* IsAmbiguous *\/ ) );\n}\n\n\/\/______________________________________________________________________________\nvoid PackageImpl::processPackage_(\n    ::osl::ResettableMutexGuard & guard,\n    bool registerPackage,\n    ::rtl::Reference<AbortChannel> const & abortChannel,\n    Reference<XCommandEnvironment> const & xCmdEnv )\n{\n    BackendImpl * that = getMyBackend();\n\n    if ( !m_xNameCntrPkgHandler.is() )\n    {\n        OSL_TRACE(\"no package handler!!!!\");\n        throw RuntimeException( OUSTR(\"No package Handler \" ),\n            Reference< XInterface >() );\n    }\n\n    if (registerPackage)\n    {\n        \/\/ will throw if it fails\n        m_xNameCntrPkgHandler->insertByName( m_url, makeAny( Reference< XPackage >(this) ) );\n\n    }\n    else \/\/ revokePackage()\n    {\n        m_xNameCntrPkgHandler->removeByName( m_url );\n    }\n}\n\n} \/\/ namespace sfwk\n} \/\/ namespace backend\n} \/\/ namespace dp_registry\n\n<commit_msg>INTEGRATION: CWS jl13 (1.3.12); FILE MERGED 2004\/11\/02 15:34:59 dbo 1.3.12.6: #i36265# 2004\/10\/21 13:27:09 jl 1.3.12.5: RESYNC: (1.3-1.4); FILE MERGED 2004\/09\/30 16:54:00 dbo 1.3.12.4: #i34555# correct double checked locking, misc cleanup 2004\/09\/29 16:56:58 dbo 1.3.12.3: #i34555##i34149# changes for CC 2004\/09\/29 16:16:31 dbo 1.3.12.2: #i34555##i34409# GUI filter list, legacy bundles error warnings 2004\/09\/14 15:31:48 dbo 1.3.12.1: #i34149##i33982# modified makeURL(), misc fixes<commit_after>\/*************************************************************************\n *\n *  $RCSfile: dp_sfwk.cxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: hr $ $Date: 2004-11-09 14:13: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#include \"dp_sfwk.hrc\"\n#include \"dp_backend.h\"\n#include \"dp_ucb.h\"\n#include \"dp_parceldesc.hxx\"\n#include \"rtl\/uri.hxx\"\n#include \"ucbhelper\/content.hxx\"\n#include \"cppuhelper\/exc_hlp.hxx\"\n#include \"svtools\/inettype.hxx\"\n#include <com\/sun\/star\/container\/XNameContainer.hpp>\n#include <com\/sun\/star\/script\/provider\/XScriptProviderFactory.hpp>\n#include <memory>\n\n\nusing namespace ::dp_misc;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::ucb;\nusing namespace ::com::sun::star::script;\n\nusing ::rtl::OUString;\nnamespace css = ::com::sun::star;\n\nnamespace dp_registry\n{\nnamespace backend\n{\nnamespace sfwk\n{\n\n\/\/==============================================================================\nclass BackendImpl : public ::dp_registry::backend::PackageRegistryBackend\n{\n    class PackageImpl : public ::dp_registry::backend::Package\n    {\n        BackendImpl * getMyBackend() const {\n            return static_cast<BackendImpl *>(m_myBackend.get());\n        }\n\n        Reference< container::XNameContainer > m_xNameCntrPkgHandler;\n        OUString m_descr;\n\n        void initPackageHandler();\n\n        \/\/ Package\n        virtual beans::Optional< beans::Ambiguous<sal_Bool> > isRegistered_(\n            ::osl::ResettableMutexGuard & guard,\n            ::rtl::Reference<AbortChannel> const & abortChannel,\n            Reference<XCommandEnvironment> const & xCmdEnv );\n        virtual void processPackage_(\n            ::osl::ResettableMutexGuard & guard,\n            bool registerPackage,\n            ::rtl::Reference<AbortChannel> const & abortChannel,\n            Reference<XCommandEnvironment> const & xCmdEnv );\n\n    public:\n        PackageImpl( ::rtl::Reference<BackendImpl> const & myBackend,\n                     OUString const & url, OUString const & libType,\n                     Reference<XCommandEnvironment> const &xCmdEnv );\n        \/\/ XPackage\n        virtual OUString SAL_CALL getDescription() throw (RuntimeException);\n    };\n    friend class PackageImpl;\n\n    \/\/ PackageRegistryBackend\n    virtual Reference<deployment::XPackage> bindPackage_(\n        OUString const & url, OUString const & mediaType,\n        Reference<XCommandEnvironment> const & xCmdEnv );\n\n    const Reference<deployment::XPackageTypeInfo> m_xTypeInfo;\n\npublic:\n    BackendImpl(\n        Sequence<Any> const & args,\n        Reference<XComponentContext> const & xComponentContext,\n        OUString const & implName );\n\n    \/\/ XPackageRegistry\n    virtual Sequence< Reference<deployment::XPackageTypeInfo> > SAL_CALL\n    getSupportedPackageTypes() throw (RuntimeException);\n};\n\n\/\/______________________________________________________________________________\nOUString BackendImpl::PackageImpl::getDescription() throw (RuntimeException)\n{\n    if (m_descr.getLength() == 0)\n        return Package::getDescription();\n    else\n        return m_descr;\n}\n\n\/\/______________________________________________________________________________\nBackendImpl::PackageImpl::PackageImpl(\n    ::rtl::Reference<BackendImpl> const & myBackend,\n    OUString const & url, OUString const & libType,\n    Reference<XCommandEnvironment> const &xCmdEnv )\n    : Package( myBackend.get(), url, OUString(), OUString(),\n               myBackend->m_xTypeInfo ),\n      m_descr(libType)\n{\n    initPackageHandler();\n\n    sal_Int32 segmEnd = url.getLength();\n    if (url.getLength() > 0 && url[ url.getLength() - 1 ] == '\/')\n        --segmEnd;\n    sal_Int32 segmStart = (url.lastIndexOf( '\/', segmEnd ) + 1);\n    if (segmStart < 0)\n        segmStart = 0;\n    \/\/ name and display name default the same:\n    m_displayName = ::rtl::Uri::decode(\n        url.copy( segmStart, segmEnd - segmStart ),\n        rtl_UriDecodeWithCharset, RTL_TEXTENCODING_UTF8 );\n    m_name = m_displayName;\n\n    OSL_TRACE(\"PakageImpl displayName is %s\",\n        ::rtl::OUStringToOString( m_displayName , RTL_TEXTENCODING_ASCII_US ).pData->buffer );\n}\n\n\/\/______________________________________________________________________________\nBackendImpl::BackendImpl(\n    Sequence<Any> const & args,\n    Reference<XComponentContext> const & xComponentContext,\n    OUString const & implName )\n    : PackageRegistryBackend( args, xComponentContext, implName ),\n      m_xTypeInfo( new Package::TypeInfo(\n                       OUSTR(\"application\/vnd.sun.star.framework-script\"),\n                       OUString() \/* no file filter *\/,\n                       OUSTR(\"Scripting Framework Script Library\"),\n                       RID_IMG_SCRIPTLIB, RID_IMG_SCRIPTLIB_HC ) )\n{\n    if (! transientMode())\n    {\n\/*\n        if (office_is_running())\n        {\n            Reference<XComponentContext> xContext( getComponentContext() );\n            m_xScriptLibs.set(\n                xContext->getServiceManager()->createInstanceWithContext(\n                    OUSTR(\"com.sun.star.\"\n                          \"script.ApplicationScriptLibraryContainer\"),\n                    xContext ), UNO_QUERY_THROW );\n            m_xDialogLibs.set(\n                xContext->getServiceManager()->createInstanceWithContext(\n                    OUSTR(\"com.sun.star.\"\n                          \"script.ApplicationDialogLibraryContainer\"),\n                    xContext ), UNO_QUERY_THROW );\n        }\n        else\n        {\n            OUString basic_path(\n                m_eContext == CONTEXT_USER\n                ? OUSTR(\"vnd.sun.star.expand:${$SYSBINDIR\/\"\n                        SAL_CONFIGFILE(\"bootstrap\")\n                        \":UserInstallation}\/user\/basic\")\n                : OUSTR(\"vnd.sun.star.expand:${$SYSBINDIR\/\"\n                        SAL_CONFIGFILE(\"bootstrap\")\n                        \":BaseInstallation}\/share\/basic\") );\n            m_basic_script_libs.reset(\n                new LibraryContainer(\n                    makeURL( basic_path, OUSTR(\"script.xlc\") ),\n                    getMutex(),\n                    getComponentContext() ) );\n            m_dialog_libs.reset(\n                new LibraryContainer(\n                    makeURL( basic_path, OUSTR(\"dialog.xlc\") ),\n                    getMutex(),\n                    getComponentContext() ) );\n        }\n*\/\n    }\n}\n\n\/\/==============================================================================\nOUString SAL_CALL getImplementationName()\n{\n    return OUSTR(\"com.sun.star.comp.deployment.sfwk.PackageRegistryBackend\");\n}\n\n\/\/==============================================================================\nReference<XInterface> SAL_CALL create(\n    Sequence<Any> const & args,\n    Reference<XComponentContext> const & xComponentContext )\n    SAL_THROW( (Exception) )\n{\n    return static_cast< ::cppu::OWeakObject * >(\n        new BackendImpl( args, xComponentContext, getImplementationName() ) );\n}\n\n\/\/ XPackageRegistry\n\/\/______________________________________________________________________________\nSequence< Reference<deployment::XPackageTypeInfo> >\nBackendImpl::getSupportedPackageTypes() throw (RuntimeException)\n{\n    return Sequence< Reference<deployment::XPackageTypeInfo> >(&m_xTypeInfo, 1);\n}\n\n\/\/ PackageRegistryBackend\n\/\/______________________________________________________________________________\nReference<deployment::XPackage> BackendImpl::bindPackage_(\n    OUString const & url, OUString const & mediaType_,\n    Reference<XCommandEnvironment> const & xCmdEnv )\n{\n    OUString mediaType( mediaType_ );\n    if (mediaType.getLength() == 0)\n    {\n        \/\/ detect media-type:\n        ::ucb::Content ucbContent;\n        if (create_ucb_content( &ucbContent, url, xCmdEnv ) &&\n            ucbContent.isFolder())\n        {\n            \/\/ probe for script.xlb:\n            if (create_ucb_content(\n                    0, makeURL( url, OUSTR(\"parcel-descriptor.xml\") ),\n                    xCmdEnv, false \/* no throw *\/ ))\n        {\n                mediaType = OUSTR(\"application\/vnd.sun.star.framework-script\");\n\n        }\n        }\n        if (mediaType.getLength() == 0)\n            throw lang::IllegalArgumentException(\n                StrCannotDetectMediaType::get() + url,\n                static_cast<OWeakObject *>(this), static_cast<sal_Int16>(-1) );\n    }\n\n    String type, subType;\n    INetContentTypeParameterList params;\n    if (INetContentTypes::parse( mediaType, type, subType, &params ))\n    {\n        if (type.EqualsIgnoreCaseAscii(\"application\"))\n        {\n            if (subType.EqualsIgnoreCaseAscii(\"vnd.sun.star.framework-script\"))\n            {\n                OUString sParcelDescURL = makeURL(\n                    url, OUSTR(\"parcel-descriptor.xml\") );\n                ::ucb::Content ucb_content( sParcelDescURL, xCmdEnv );\n                ParcelDescDocHandler* pHandler =\n                    new ParcelDescDocHandler();\n                Reference< xml::sax::XDocumentHandler > xDocHandler =  pHandler;\n                Reference<XComponentContext> xContext( getComponentContext() );\n                Reference< xml::sax::XParser > xParser(\n                    xContext->getServiceManager()->createInstanceWithContext(\n                        OUSTR(\"com.sun.star.xml.sax.Parser\"), xContext ),\n                            UNO_QUERY_THROW );\n                xParser->setDocumentHandler( xDocHandler );\n                xml::sax::InputSource source;\n                source.aInputStream = ucb_content.openStream();\n                source.sSystemId = ucb_content.getURL();\n                xParser->parseStream( source );\n                OUString lang;\n\n                if ( !pHandler->isParsed() )\n                {\n                    throw lang::IllegalArgumentException(\n                        StrCannotDetectMediaType::get() + url,\n                        static_cast<OWeakObject *>(this), static_cast<sal_Int16>(-1) );\n                }\n                lang =  pHandler->getParcelLanguage();\n                OUString sfwkLibType = getResourceString( RID_STR_SFWK_LIB );\n                \/\/ replace %MACRONAME placeholder with language name\n                OUString MACRONAME( OUSTR(\"%MACROLANG\" ) );\n                sal_Int32 startOfReplace = sfwkLibType.indexOf( MACRONAME );\n                sal_Int32 charsToReplace = MACRONAME.getLength();\n                sfwkLibType = sfwkLibType.replaceAt( startOfReplace, charsToReplace, lang );\n                OSL_TRACE(\"******************************\");\n                OSL_TRACE(\" BackEnd detected lang = %s  \",\n                     rtl::OUStringToOString( lang, RTL_TEXTENCODING_ASCII_US ).getStr() );\n                OSL_TRACE(\" for url %s\",\n                     rtl::OUStringToOString( source.sSystemId, RTL_TEXTENCODING_ASCII_US ).getStr() );\n                OSL_TRACE(\"******************************\");\n                return new PackageImpl( this, url, sfwkLibType, xCmdEnv );\n            }\n        }\n    }\n    throw lang::IllegalArgumentException(\n        StrUnsupportedMediaType::get() + mediaType,\n        static_cast<OWeakObject *>(this),\n        static_cast<sal_Int16>(-1) );\n}\n\n\/\/##############################################################################\n\nvoid BackendImpl::PackageImpl:: initPackageHandler()\n{\n    if (m_xNameCntrPkgHandler.is())\n        return;\n\n    BackendImpl * that = getMyBackend();\n    Any aContext;\n\n    if ( that->m_eContext == CONTEXT_USER )\n    {\n        aContext  <<= OUSTR(\"user\");\n    }\n    else if ( that->m_eContext == CONTEXT_SHARED )\n    {\n        aContext  <<= OUSTR(\"share\");\n    }\n    else\n    {\n        OSL_ASSERT( 0 );\n        \/\/ NOT supported at the momemtn \/\/ TODO\n    }\n\n    Reference< provider::XScriptProviderFactory > xFac(\n        that->getComponentContext()->getValueByName(\n            OUSTR( \"\/singletons\/com.sun.star.script.provider.theMasterScriptProviderFactory\") ), UNO_QUERY );\n\n    if ( xFac.is() )\n    {\n        Reference< container::XNameContainer > xName( xFac->createScriptProvider( aContext ), UNO_QUERY );\n        if ( xName.is() )\n        {\n            m_xNameCntrPkgHandler.set( xName );\n        }\n    }\n    \/\/ TODO what happens if above fails??\n}\n\n\/\/ Package\n\/\/______________________________________________________________________________\nbeans::Optional< beans::Ambiguous<sal_Bool> >\nBackendImpl::PackageImpl::isRegistered_(\n    ::osl::ResettableMutexGuard & guard,\n    ::rtl::Reference<AbortChannel> const & abortChannel,\n    Reference<XCommandEnvironment> const & xCmdEnv )\n{\n    return beans::Optional< beans::Ambiguous<sal_Bool> >(\n        true \/* IsPresent *\/,\n        beans::Ambiguous<sal_Bool>(\n            m_xNameCntrPkgHandler.is() && m_xNameCntrPkgHandler->hasByName(\n                m_url ),\n            false \/* IsAmbiguous *\/ ) );\n}\n\n\/\/______________________________________________________________________________\nvoid BackendImpl::PackageImpl::processPackage_(\n    ::osl::ResettableMutexGuard & guard,\n    bool registerPackage,\n    ::rtl::Reference<AbortChannel> const & abortChannel,\n    Reference<XCommandEnvironment> const & xCmdEnv )\n{\n    BackendImpl * that = getMyBackend();\n\n    if ( !m_xNameCntrPkgHandler.is() )\n    {\n        OSL_TRACE(\"no package handler!!!!\");\n        throw RuntimeException( OUSTR(\"No package Handler \" ),\n            Reference< XInterface >() );\n    }\n\n    if (registerPackage)\n    {\n        \/\/ will throw if it fails\n        m_xNameCntrPkgHandler->insertByName( m_url, makeAny( Reference< XPackage >(this) ) );\n\n    }\n    else \/\/ revokePackage()\n    {\n        m_xNameCntrPkgHandler->removeByName( m_url );\n    }\n}\n\n} \/\/ namespace sfwk\n} \/\/ namespace backend\n} \/\/ namespace dp_registry\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *\n * Copyright (c) 2014, weizhenwei\n * All rights reserved.\n * \n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * \n * * Redistributions of source code must retain the above copyright notice, this\n *   list of conditions and the following disclaimer.\n * \n * * Redistributions in binary form must reproduce the above copyright notice,\n *   this list of conditions and the following disclaimer in the documentation\n *   and\/or other materials provided with the distribution.\n * \n * * Neither the name of the {organization} nor the names of its\n *   contributors may be used to endorse or promote products derived from\n *   this software without specific prior written permission.\n * \n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * File: 2012-04-03_Text_Justification.cpp\n *\n *\n * Brief: https:\/\/oj.leetcode.com\/problems\/text-justification\/\n * Given an array of words and a length L, format the text such that each line\n * has exactly L characters and is fully (left and right) justified.\n *\n * You should pack your words in a greedy approach; that is, pack as many words\n * as you can in each line. Pad extra spaces ' ' when necessary so that each\n * line has exactly L characters.\n *\n * Extra spaces between words should be distributed as evenly as possible. If\n * the number of spaces on a line do not divide evenly between words, the empty\n * slots on the left will be assigned more spaces than the slots on the right.\n *\n * For the last line of text, it should be left justified and no extra space is\n * inserted between words.\n *\n * For example,\n * words: [\"This\", \"is\", \"an\", \"example\", \"of\", \"text\", \"justification.\"]\n * L: 16.\n *\n * Return the formatted lines as:\n * [\n *    \"This    is    an\",\n *    \"example  of text\",\n *    \"justification.  \"\n * ]\n * Note: Each word is guaranteed not to exceed L in length.\n *\n * Corner Cases:\n * A line other than the last line might contain only one word. What\n * should you do in this case? In this case, that line should be left-justified.\n *\n *\n * Date: 2014.12.15\n *\n * Author: weizhenwei <weizhenwei1988@gmail.com>\n *\n * *****************************************************************************\n *\/\n\n#include <stdio.h>\n#include <vector>\n#include <string>\n\nusing std::vector;\nusing std::string;\n\nclass Solution_Text_Justification {\npublic:\n    vector<string> fullJustify(vector<string> &words, int L) {\n        vector<string> res;\n        for (int i = 0, k, l; i < words.size(); i += k) {\n            for (k = l = 0; (i + k < words.size()) && (l + words[i+k].size() <= L - k); k++) {\n                l += words[i+k].size();\n            }\n\n            string tmp = words[i];\n            for (int j = 0; j < k - 1; j++) {\n                if (i + k >= words.size()) {\n                    tmp += \" \";\n                } else {\n                    tmp += string((L - l) \/ (k - 1) + (j < (L - l) % (k - 1)), ' ');\n                }\n                tmp += words[i+j+1];\n            }  \/\/ for j\n\n            tmp += string(L - tmp.size(), ' ');\n            res.push_back(tmp);\n        }  \/\/ for i\n\n        return res;\n    }\n};\n\nstatic void print_vector(vector<string> &v) {\n    for (int i = 0; i < v.size(); i++) {\n        printf(\"%s\\n\", v[i].c_str());\n    }\n\n    printf(\"\\n\");\n}\n\nint main(int argc, char *argv[]) {\n    Solution_Text_Justification solution;\n    vector<string> words;\n    words.push_back(\"This\");\n    words.push_back(\"is\");\n    words.push_back(\"an\");\n    words.push_back(\"example\");\n    words.push_back(\"of\");\n    words.push_back(\"text\");\n    words.push_back(\"justification\");\n\n    printf(\"words:\\n\");\n    print_vector(words);\n\n    int L = 15;\n    vector<string> full = solution.fullJustify(words, L);\n    printf(\"full justification:\\n\");\n    print_vector(full);\n\n    words.clear();\n    words.push_back(\"what\");\n    words.push_back(\"must\");\n    words.push_back(\"be\");\n    words.push_back(\"shall\");\n    words.push_back(\"be.\");\n    L = 12;\n    printf(\"words:\\n\");\n    print_vector(words);\n    full = solution.fullJustify(words, L);\n    printf(\"full justification:\\n\");\n    print_vector(full);\n\n    return 0;\n}\n\n<commit_msg>tiny addition<commit_after>\/*\n *\n * Copyright (c) 2014, weizhenwei\n * All rights reserved.\n * \n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * \n * * Redistributions of source code must retain the above copyright notice, this\n *   list of conditions and the following disclaimer.\n * \n * * Redistributions in binary form must reproduce the above copyright notice,\n *   this list of conditions and the following disclaimer in the documentation\n *   and\/or other materials provided with the distribution.\n * \n * * Neither the name of the {organization} nor the names of its\n *   contributors may be used to endorse or promote products derived from\n *   this software without specific prior written permission.\n * \n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * File: 2012-04-03_Text_Justification.cpp\n *\n *\n * Brief: https:\/\/oj.leetcode.com\/problems\/text-justification\/\n * Given an array of words and a length L, format the text such that each line\n * has exactly L characters and is fully (left and right) justified.\n *\n * You should pack your words in a greedy approach; that is, pack as many words\n * as you can in each line. Pad extra spaces ' ' when necessary so that each\n * line has exactly L characters.\n *\n * Extra spaces between words should be distributed as evenly as possible. If\n * the number of spaces on a line do not divide evenly between words, the empty\n * slots on the left will be assigned more spaces than the slots on the right.\n *\n * For the last line of text, it should be left justified and no extra space is\n * inserted between words.\n *\n * For example,\n * words: [\"This\", \"is\", \"an\", \"example\", \"of\", \"text\", \"justification.\"]\n * L: 16.\n *\n * Return the formatted lines as:\n * [\n *    \"This    is    an\",\n *    \"example  of text\",\n *    \"justification.  \"\n * ]\n * Note: Each word is guaranteed not to exceed L in length.\n *\n * Corner Cases:\n * A line other than the last line might contain only one word. What\n * should you do in this case? In this case, that line should be left-justified.\n *\n *\n * Date: 2014.12.15\n *\n * Author: weizhenwei <weizhenwei1988@gmail.com>\n *\n * *****************************************************************************\n *\/\n\n#include <stdio.h>\n#include <vector>\n#include <string>\n\nusing std::vector;\nusing std::string;\n\n\/\/ originates from:\n\/\/ https:\/\/oj.leetcode.com\/discuss\/13610\/share-my-concise-c-solution-less-than-20-lines\nclass Solution_Text_Justification {\npublic:\n    vector<string> fullJustify(vector<string> &words, int L) {\n        vector<string> res;\n        for (int i = 0, k, l; i < words.size(); i += k) {\n            for (k = l = 0; (i + k < words.size()) && (l + words[i+k].size() <= L - k); k++) {\n                l += words[i+k].size();\n            }\n\n            string tmp = words[i];\n            for (int j = 0; j < k - 1; j++) {\n                if (i + k >= words.size()) {\n                    tmp += \" \";\n                } else {\n                    tmp += string((L - l) \/ (k - 1) + (j < (L - l) % (k - 1)), ' ');\n                }\n                tmp += words[i+j+1];\n            }  \/\/ for j\n\n            tmp += string(L - tmp.size(), ' ');\n            res.push_back(tmp);\n        }  \/\/ for i\n\n        return res;\n    }\n};\n\nstatic void print_vector(vector<string> &v) {\n    for (int i = 0; i < v.size(); i++) {\n        printf(\"%s\\n\", v[i].c_str());\n    }\n\n    printf(\"\\n\");\n}\n\nint main(int argc, char *argv[]) {\n    Solution_Text_Justification solution;\n    vector<string> words;\n    words.push_back(\"This\");\n    words.push_back(\"is\");\n    words.push_back(\"an\");\n    words.push_back(\"example\");\n    words.push_back(\"of\");\n    words.push_back(\"text\");\n    words.push_back(\"justification\");\n\n    printf(\"words:\\n\");\n    print_vector(words);\n\n    int L = 15;\n    vector<string> full = solution.fullJustify(words, L);\n    printf(\"full justification:\\n\");\n    print_vector(full);\n\n    words.clear();\n    words.push_back(\"what\");\n    words.push_back(\"must\");\n    words.push_back(\"be\");\n    words.push_back(\"shall\");\n    words.push_back(\"be.\");\n    L = 12;\n    printf(\"words:\\n\");\n    print_vector(words);\n    full = solution.fullJustify(words, L);\n    printf(\"full justification:\\n\");\n    print_vector(full);\n\n    return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 3 of the License, or\n * (at your option) any later version.\n *\n * Written (W) 2011 Heiko Strathmann\n * Copyright (C) 2011 Berlin Institute of Technology and Max-Planck-Society\n *\/\n\n#include <shogun\/base\/init.h>\n#include <shogun\/evaluation\/CrossValidation.h>\n#include <shogun\/evaluation\/ContingencyTableEvaluation.h>\n#include <shogun\/evaluation\/StratifiedCrossValidationSplitting.h>\n#include <shogun\/modelselection\/GridSearchModelSelection.h>\n#include <shogun\/modelselection\/ModelSelectionParameters.h>\n#include <shogun\/modelselection\/ParameterCombination.h>\n#include <shogun\/features\/Labels.h>\n#include <shogun\/features\/SimpleFeatures.h>\n#include <shogun\/classifier\/svm\/LibSVM.h>\n#include <shogun\/classifier\/svm\/LibLinear.h>\n#include <shogun\/kernel\/GaussianKernel.h>\n\n\nusing namespace shogun;\n\nvoid print_message(FILE* target, const char* str)\n{\n\tfprintf(target, \"%s\", str);\n}\n\nCModelSelectionParameters* create_param_tree()\n{\n\tCModelSelectionParameters* root=new CModelSelectionParameters();\n\n\tCModelSelectionParameters* c1=new CModelSelectionParameters(\"C1\");\n\troot->append_child(c1);\n\tc1->build_values(-5, 5, R_EXP);\n\n\tCModelSelectionParameters* c2=new CModelSelectionParameters(\"C2\");\n\troot->append_child(c2);\n\tc2->build_values(-5, 5, R_EXP);\n\n\tCGaussianKernel* kernel=new CGaussianKernel();\n\tCModelSelectionParameters* param_kernel=\n\t\t\tnew CModelSelectionParameters(\"kernel\",\tkernel);\n\tCModelSelectionParameters* kernel_width=new CModelSelectionParameters(\"width\");\n\tkernel_width->build_values(-5, 5, R_EXP, 1, 2);\n\tparam_kernel->append_child(kernel_width);\n\troot->append_child(param_kernel);\n\n\treturn root;\n}\n\nint main(int argc, char **argv)\n{\n\tinit_shogun(&print_message, &print_message, &print_message);\n\n\tint32_t num_subsets=3;\n\tint32_t num_vectors=20;\n\tint32_t dim_vectors=3;\n\n\t\/* create some data and labels *\/\n\tfloat64_t* matrix=new float64_t[num_vectors*dim_vectors];\n\tCLabels* labels=new CLabels(num_vectors);\n\tfor (int32_t i=0; i<num_vectors*dim_vectors; i++)\n\t\tmatrix[i]=CMath::randn_double();\n\n\t\/* create num_feautres 2-dimensional vectors *\/\n\tCSimpleFeatures<float64_t>* features=new CSimpleFeatures<float64_t> ();\n\tfeatures->set_feature_matrix(matrix, dim_vectors, num_vectors);\n\n\t\/* create labels, two classes *\/\n\tfor (index_t i=0; i<num_vectors; ++i)\n\t\tlabels->set_label(i, i%2==0 ? 1 : -1);\n\n\t\/* create linear classifier (use -s 2 option to avoid warnings) *\/\n\tCLibSVM* classifier=new CLibSVM();\n\tclassifier->set_store_sv_features(true);\n\n\t\/* splitting strategy *\/\n\tCStratifiedCrossValidationSplitting* splitting_strategy=\n\t\t\tnew CStratifiedCrossValidationSplitting(labels, num_subsets);\n\n\t\/* accuracy evaluation *\/\n\tCContingencyTableEvaluation* evaluation_criterium=\n\t\t\tnew CContingencyTableEvaluation(ACCURACY);\n\n\t\/* cross validation class for evaluation in model selection, 3 repetitions *\/\n\tCCrossValidation* cross=new CCrossValidation(classifier, features, labels,\n\t\t\tsplitting_strategy, evaluation_criterium);\n\tcross->set_num_runs(3);\n\n\t\/* model parameter selection, deletion is handled by modsel class (SG_UNREF) *\/\n\tCModelSelectionParameters* param_tree=create_param_tree();\n\tparam_tree->print_tree();\n\n\t\/* this is on the stack and handles all of the above structures in memory *\/\n\tCGridSearchModelSelection grid_search(param_tree, cross);\n\n\tCParameterCombination* best_combination=grid_search.select_model();\n\tSG_SPRINT(\"best parameter(s):\\n\");\n\tbest_combination->print_tree();\n\n\tbest_combination->apply_to_machine(classifier);\n\n\t\/* larger number of runs to have tighter confidence intervals *\/\n\tcross->set_num_runs(100);\n\tcross->set_conf_int_alpha(0.01);\n\tCrossValidationResult result=cross->evaluate();\n\tSG_SPRINT(\"result: \");\n\tresult.print_result();\n\n\t\/* clean up destroy result parameter *\/\n\tSG_UNREF(best_combination);\n\n\tSG_SPRINT(\"\\nEND\\n\");\n\texit_shogun();\n\n\treturn 0;\n}\n\n<commit_msg>cleaned up includes<commit_after>\/*\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 3 of the License, or\n * (at your option) any later version.\n *\n * Written (W) 2011 Heiko Strathmann\n * Copyright (C) 2011 Berlin Institute of Technology and Max-Planck-Society\n *\/\n\n#include <shogun\/base\/init.h>\n#include <shogun\/evaluation\/CrossValidation.h>\n#include <shogun\/evaluation\/ContingencyTableEvaluation.h>\n#include <shogun\/evaluation\/StratifiedCrossValidationSplitting.h>\n#include <shogun\/modelselection\/GridSearchModelSelection.h>\n#include <shogun\/modelselection\/ModelSelectionParameters.h>\n#include <shogun\/modelselection\/ParameterCombination.h>\n#include <shogun\/features\/Labels.h>\n#include <shogun\/features\/SimpleFeatures.h>\n#include <shogun\/classifier\/svm\/LibSVM.h>\n#include <shogun\/kernel\/GaussianKernel.h>\n\n\nusing namespace shogun;\n\nvoid print_message(FILE* target, const char* str)\n{\n\tfprintf(target, \"%s\", str);\n}\n\nCModelSelectionParameters* create_param_tree()\n{\n\tCModelSelectionParameters* root=new CModelSelectionParameters();\n\n\tCModelSelectionParameters* c1=new CModelSelectionParameters(\"C1\");\n\troot->append_child(c1);\n\tc1->build_values(-5, 5, R_EXP);\n\n\tCModelSelectionParameters* c2=new CModelSelectionParameters(\"C2\");\n\troot->append_child(c2);\n\tc2->build_values(-5, 5, R_EXP);\n\n\tCGaussianKernel* kernel=new CGaussianKernel();\n\tCModelSelectionParameters* param_kernel=\n\t\t\tnew CModelSelectionParameters(\"kernel\",\tkernel);\n\tCModelSelectionParameters* kernel_width=new CModelSelectionParameters(\"width\");\n\tkernel_width->build_values(-5, 5, R_EXP, 1, 2);\n\tparam_kernel->append_child(kernel_width);\n\troot->append_child(param_kernel);\n\n\treturn root;\n}\n\nint main(int argc, char **argv)\n{\n\tinit_shogun(&print_message, &print_message, &print_message);\n\n\tint32_t num_subsets=3;\n\tint32_t num_vectors=20;\n\tint32_t dim_vectors=3;\n\n\t\/* create some data and labels *\/\n\tfloat64_t* matrix=new float64_t[num_vectors*dim_vectors];\n\tCLabels* labels=new CLabels(num_vectors);\n\tfor (int32_t i=0; i<num_vectors*dim_vectors; i++)\n\t\tmatrix[i]=CMath::randn_double();\n\n\t\/* create num_feautres 2-dimensional vectors *\/\n\tCSimpleFeatures<float64_t>* features=new CSimpleFeatures<float64_t> ();\n\tfeatures->set_feature_matrix(matrix, dim_vectors, num_vectors);\n\n\t\/* create labels, two classes *\/\n\tfor (index_t i=0; i<num_vectors; ++i)\n\t\tlabels->set_label(i, i%2==0 ? 1 : -1);\n\n\t\/* create linear classifier (use -s 2 option to avoid warnings) *\/\n\tCLibSVM* classifier=new CLibSVM();\n\tclassifier->set_store_sv_features(true);\n\n\t\/* splitting strategy *\/\n\tCStratifiedCrossValidationSplitting* splitting_strategy=\n\t\t\tnew CStratifiedCrossValidationSplitting(labels, num_subsets);\n\n\t\/* accuracy evaluation *\/\n\tCContingencyTableEvaluation* evaluation_criterium=\n\t\t\tnew CContingencyTableEvaluation(ACCURACY);\n\n\t\/* cross validation class for evaluation in model selection, 3 repetitions *\/\n\tCCrossValidation* cross=new CCrossValidation(classifier, features, labels,\n\t\t\tsplitting_strategy, evaluation_criterium);\n\tcross->set_num_runs(3);\n\n\t\/* model parameter selection, deletion is handled by modsel class (SG_UNREF) *\/\n\tCModelSelectionParameters* param_tree=create_param_tree();\n\tparam_tree->print_tree();\n\n\t\/* this is on the stack and handles all of the above structures in memory *\/\n\tCGridSearchModelSelection grid_search(param_tree, cross);\n\n\tCParameterCombination* best_combination=grid_search.select_model();\n\tSG_SPRINT(\"best parameter(s):\\n\");\n\tbest_combination->print_tree();\n\n\tbest_combination->apply_to_machine(classifier);\n\n\t\/* larger number of runs to have tighter confidence intervals *\/\n\tcross->set_num_runs(100);\n\tcross->set_conf_int_alpha(0.01);\n\tCrossValidationResult result=cross->evaluate();\n\tSG_SPRINT(\"result: \");\n\tresult.print_result();\n\n\t\/* clean up destroy result parameter *\/\n\tSG_UNREF(best_combination);\n\n\tSG_SPRINT(\"\\nEND\\n\");\n\texit_shogun();\n\n\treturn 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  Copyright (c) 2018, 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\n\/\/        copyright notice, this list of conditions and the following\n\/\/        disclaimer.\n\/\/\n\/\/      * Redistributions in binary form must reproduce the above\n\/\/        copyright notice, this list of conditions and the following\n\/\/        disclaimer in the documentation and\/or other materials provided with\n\/\/        the distribution.\n\/\/\n\/\/      * Neither the name of Image Engine Design Inc nor the names of\n\/\/        any other contributors to this software may be used to endorse or\n\/\/        promote products derived from this software without specific prior\n\/\/        written permission.\n\/\/\n\/\/  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n\/\/  IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\n\/\/  THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n\/\/  PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n\/\/  CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\/\/  EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/  PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\/\/  PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\/\/  LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/  NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"boost\/python.hpp\"\n\n#include \"TBBBinding.h\"\n\n#include \"tbb\/tbb.h\"\n\nusing namespace boost::python;\n\nnamespace\n{\n\n\/\/ Wraps task_scheduler_init so it can be used as a python\n\/\/ context manager.\nclass TaskSchedulerInitWrapper : public tbb::task_scheduler_init\n{\n\n\tpublic :\n\n\t\tTaskSchedulerInitWrapper( int max_threads )\n\t\t\t:\ttbb::task_scheduler_init( deferred ), m_maxThreads( max_threads )\n\t\t{\n\t\t\tif( max_threads != automatic && max_threads <= 0 )\n\t\t\t{\n\t\t\t\tPyErr_SetString( PyExc_ValueError, \"max_threads must be either automatic or a positive integer\" );\n\t\t\t\tthrow_error_already_set();\n\t\t\t}\n\t\t}\n\n\t\tvoid enter()\n\t\t{\n\t\t\tinitialize( m_maxThreads );\n\t\t}\n\n\t\tbool exit( boost::python::object excType, boost::python::object excValue, boost::python::object excTraceBack )\n\t\t{\n\t\t\tterminate();\n\t\t\treturn false; \/\/ don't suppress exceptions\n\t\t}\n\n\tprivate :\n\n\t\tint m_maxThreads;\n\n};\n\n} \/\/ namespace\n\nvoid IECorePythonModule::bindTBB()\n{\n\tobject tsi = class_<TaskSchedulerInitWrapper, boost::noncopyable>( \"tbb_task_scheduler_init\", no_init )\n\t\t.def( init<int>( arg( \"max_threads\" ) = int( tbb::task_scheduler_init::automatic ) ) )\n\t\t.def( \"__enter__\", &TaskSchedulerInitWrapper::enter, return_self<>() )\n\t\t.def( \"__exit__\", &TaskSchedulerInitWrapper::exit )\n\t;\n\ttsi.attr( \"automatic\" ) = int( tbb::task_scheduler_init::automatic );\n\n\tdef( \"hardwareConcurrency\", &tbb::tbb_thread::hardware_concurrency );\n}\n\n<commit_msg>TBBBinding : Bind tbb::global_control<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  Copyright (c) 2018, 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\n\/\/        copyright notice, this list of conditions and the following\n\/\/        disclaimer.\n\/\/\n\/\/      * Redistributions in binary form must reproduce the above\n\/\/        copyright notice, this list of conditions and the following\n\/\/        disclaimer in the documentation and\/or other materials provided with\n\/\/        the distribution.\n\/\/\n\/\/      * Neither the name of Image Engine Design Inc nor the names of\n\/\/        any other contributors to this software may be used to endorse or\n\/\/        promote products derived from this software without specific prior\n\/\/        written permission.\n\/\/\n\/\/  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n\/\/  IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\n\/\/  THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n\/\/  PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n\/\/  CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\/\/  EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/  PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\/\/  PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\/\/  LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/  NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"boost\/python.hpp\"\n\n#include \"TBBBinding.h\"\n\n#include \"tbb\/tbb.h\"\n\n#define TBB_PREVIEW_GLOBAL_CONTROL 1\n#include \"tbb\/global_control.h\"\n\nusing namespace boost::python;\n\nnamespace\n{\n\n\/\/ Wraps task_scheduler_init so it can be used as a python\n\/\/ context manager.\nclass TaskSchedulerInitWrapper : public tbb::task_scheduler_init\n{\n\n\tpublic :\n\n\t\tTaskSchedulerInitWrapper( int max_threads )\n\t\t\t:\ttbb::task_scheduler_init( deferred ), m_maxThreads( max_threads )\n\t\t{\n\t\t\tif( max_threads != automatic && max_threads <= 0 )\n\t\t\t{\n\t\t\t\tPyErr_SetString( PyExc_ValueError, \"max_threads must be either automatic or a positive integer\" );\n\t\t\t\tthrow_error_already_set();\n\t\t\t}\n\t\t}\n\n\t\tvoid enter()\n\t\t{\n\t\t\tinitialize( m_maxThreads );\n\t\t}\n\n\t\tbool exit( boost::python::object excType, boost::python::object excValue, boost::python::object excTraceBack )\n\t\t{\n\t\t\tterminate();\n\t\t\treturn false; \/\/ don't suppress exceptions\n\t\t}\n\n\tprivate :\n\n\t\tint m_maxThreads;\n\n};\n\nclass GlobalControlWrapper : public boost::noncopyable\n{\n\n\tpublic :\n\n\t\tGlobalControlWrapper( tbb::global_control::parameter parameter, size_t value )\n\t\t\t:\tm_parameter( parameter ), m_value( value )\n\t\t{\n\t\t}\n\n\t\tvoid enter()\n\t\t{\n\t\t\tm_globalControl.reset( new tbb::global_control( m_parameter, m_value ) );\n\t\t}\n\n\t\tbool exit( boost::python::object excType, boost::python::object excValue, boost::python::object excTraceBack )\n\t\t{\n\t\t\tm_globalControl.reset();\n\t\t\treturn false; \/\/ don't suppress exceptions\n\t\t}\n\n\tprivate :\n\n\t\tconst tbb::global_control::parameter m_parameter;\n\t\tconst size_t m_value;\n\t\tstd::unique_ptr<tbb::global_control> m_globalControl;\n\n};\n\n} \/\/ namespace\n\nvoid IECorePythonModule::bindTBB()\n{\n\tobject tsi = class_<TaskSchedulerInitWrapper, boost::noncopyable>( \"tbb_task_scheduler_init\", no_init )\n\t\t.def( init<int>( arg( \"max_threads\" ) = int( tbb::task_scheduler_init::automatic ) ) )\n\t\t.def( \"__enter__\", &TaskSchedulerInitWrapper::enter, return_self<>() )\n\t\t.def( \"__exit__\", &TaskSchedulerInitWrapper::exit )\n\t;\n\ttsi.attr( \"automatic\" ) = int( tbb::task_scheduler_init::automatic );\n\n\tclass_<GlobalControlWrapper, boost::noncopyable> globalControl( \"tbb_global_control\", no_init );\n\t{\n\t\tscope globalControlScope = globalControl;\n\t\tenum_<tbb::global_control::parameter>( \"parameter\" )\n\t\t\t.value( \"max_allowed_parallelism\", tbb::global_control::max_allowed_parallelism )\n\t\t\t.value( \"thread_stack_size\", tbb::global_control::thread_stack_size )\n\t\t;\n\t}\n\tglobalControl\n\t\t.def( init<tbb::global_control::parameter, size_t>() )\n\t\t.def( \"__enter__\", &GlobalControlWrapper::enter, return_self<>() )\n\t\t.def( \"__exit__\", &GlobalControlWrapper::exit )\n\t;\n\n\tdef( \"hardwareConcurrency\", &tbb::tbb_thread::hardware_concurrency );\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <SceneGraph\/GraphicRenderer.h>\n#include <SceneGraph\/SceneNode.h>\n#include <SceneGraph\/OpenGL.h>\n#include <iostream>\n\n#include <cmath>\n\nIMPGEARS_BEGIN\n\n\/\/--------------------------------------------------------------\nint SceneNode::nbDisplayed = 0;\n\n\/\/--------------------------------------------------------------\nSceneNode::SceneNode():\n\t_state(nullptr),\n    rx(0.f),\n    ry(0.f),\n    rz(0.f),\n    renderActivated(true),\n    m_localMatrixHasChanged(true)\n{\n    m_parentModelMatrix = Matrix4::getIdentityMat();\n    m_parentNormalMatrix = Matrix4::getIdentityMat();\n\n    m_localModelMatrix = Matrix4::getIdentityMat();\n    m_localNormalMatrix = Matrix4::getIdentityMat();\n\n    scale = Vec3(1.f, 1.f, 1.f);\n}\n\n\/\/--------------------------------------------------------------\nSceneNode::~SceneNode(){\n\n}\n\n\/\/--------------------------------------------------------------\nvoid SceneNode::addSubNode(const std::shared_ptr<SceneNode>& sceneNode){\n    subSceneNodes.push_back( sceneNode );\n}\n\n\/\/--------------------------------------------------------------\nvoid SceneNode::removeSubNode(const std::shared_ptr<SceneNode>& sceneNode){\n    subSceneNodes.remove( sceneNode );\n}\n\n\/\/--------------------------------------------------------------\nvoid SceneNode::renderAll()\n{\t\n    if(!renderActivated)return;\n\n    SceneNode::nbDisplayed++;\n\n    Matrix4 modelMat = getModelMatrix();\n    Matrix4 normalMat = getNormalMatrix();\n\t\n\tGraphicRenderer* renderer = GraphicRenderer::getInstance();\n\tGraphicStatesManager& states = renderer->getStateManager();\n\t\n\tstates.pushState( _state.get() );\n\tif(states.getShader())\n\t{\n\t\tstates.getShader()->setModel(modelMat);\n\t\tif(imp::Camera::getActiveCamera())\n\t\t\tstates.getShader()->setView( imp::Camera::getActiveCamera()->getViewMatrix() );\n\t\tif(states.getParameters())\n\t\t\tstates.getShader()->setProjection( states.getParameters()->getProjectionMatrix() );\n\t}\n\t\n    render();\n\n    for(SceneNodeIt it = subSceneNodes.begin(); it != subSceneNodes.end(); it++)\n    {\n        SceneNode* sub = it->get();\n        sub->setParentModelMatrices(modelMat, normalMat);\n        sub->renderAll();\n    }\n\t\n\tstates.popState();\n}\n\n\/\/--------------------------------------------------------------\nvoid SceneNode::commitTransformation()\n{\n    if(m_localMatrixHasChanged)\n    {\n        m_localModelMatrix =\n            Matrix4::getTranslationMat(position.x(), position.y(), position.z())\n            * Matrix4::getRotationMat(rx, 0.f, 0.f)\n            * Matrix4::getRotationMat(0.f, ry, 0.f)\n            * Matrix4::getRotationMat(0.f, 0.f, rz)\n            * Matrix4::getScaleMat(scale.x(), scale.y(), scale.z());\n\n        m_localNormalMatrix =\n            Matrix4::getRotationMat(rx, 0.f, 0.f)\n            * Matrix4::getRotationMat(0.f, ry, 0.f)\n            * Matrix4::getRotationMat(0.f, 0.f, rz)\n            * Matrix4::getScaleMat(scale.x(), scale.y(), scale.z()).getInverse();\n\n        m_localMatrixHasChanged = false;\n    }\n}\n\n\/\/--------------------------------------------------------------\nvoid SceneNode::calculateRotation(){\n\n    orientation.normalize();\n\n    float convertion = 180.f\/3.14159265359f;\n\n    float x2 = orientation.x()*orientation.x();\n    float y2 = orientation.y()*orientation.y();\n    float xy = sqrt(x2+y2);\n\n    rx = 0.f; \/\/Rotation sur axe frontal\n    ry = -convertion * atan2f(orientation.z(), xy);\n    rz = convertion * atan2f(orientation.y(), orientation.x());\n\n    m_localMatrixHasChanged = true;\n}\n\n\/\/--------------------------------------------------------------\nconst Matrix4 SceneNode::getModelMatrix()\n{\n    commitTransformation();\n\n    return m_parentModelMatrix * m_localModelMatrix;\n}\n\n\/\/--------------------------------------------------------------\nconst Matrix4 SceneNode::getNormalMatrix()\n{\n    commitTransformation();\n\n    return m_parentNormalMatrix * m_localNormalMatrix;\n}\n\n\/\/--------------------------------------------------------------\nstd::shared_ptr<GraphicState> SceneNode::getGraphicState()\n{\n\tif(_state == nullptr)_state = std::shared_ptr<GraphicState>(new GraphicState());\n\treturn _state;\n}\n\nIMPGEARS_END\n<commit_msg>fix Scene node transformation order<commit_after>#include <SceneGraph\/GraphicRenderer.h>\n#include <SceneGraph\/SceneNode.h>\n#include <SceneGraph\/OpenGL.h>\n#include <iostream>\n\n#include <cmath>\n\nIMPGEARS_BEGIN\n\n\/\/--------------------------------------------------------------\nint SceneNode::nbDisplayed = 0;\n\n\/\/--------------------------------------------------------------\nSceneNode::SceneNode():\n\t_state(nullptr),\n    rx(0.f),\n    ry(0.f),\n    rz(0.f),\n    renderActivated(true),\n    m_localMatrixHasChanged(true)\n{\n    m_parentModelMatrix = Matrix4::getIdentityMat();\n    m_parentNormalMatrix = Matrix4::getIdentityMat();\n\n    m_localModelMatrix = Matrix4::getIdentityMat();\n    m_localNormalMatrix = Matrix4::getIdentityMat();\n\n    scale = Vec3(1.f, 1.f, 1.f);\n}\n\n\/\/--------------------------------------------------------------\nSceneNode::~SceneNode(){\n\n}\n\n\/\/--------------------------------------------------------------\nvoid SceneNode::addSubNode(const std::shared_ptr<SceneNode>& sceneNode){\n    subSceneNodes.push_back( sceneNode );\n}\n\n\/\/--------------------------------------------------------------\nvoid SceneNode::removeSubNode(const std::shared_ptr<SceneNode>& sceneNode){\n    subSceneNodes.remove( sceneNode );\n}\n\n\/\/--------------------------------------------------------------\nvoid SceneNode::renderAll()\n{\t\n    if(!renderActivated)return;\n\n    SceneNode::nbDisplayed++;\n\n    Matrix4 modelMat = getModelMatrix();\n    Matrix4 normalMat = getNormalMatrix();\n\t\n\tGraphicRenderer* renderer = GraphicRenderer::getInstance();\n\tGraphicStatesManager& states = renderer->getStateManager();\n\t\n\tstates.pushState( _state.get() );\n\tif(states.getShader())\n\t{\n\t\tstates.getShader()->setModel(modelMat);\n\t\tif(imp::Camera::getActiveCamera())\n\t\t\tstates.getShader()->setView( imp::Camera::getActiveCamera()->getViewMatrix() );\n\t\tif(states.getParameters())\n\t\t\tstates.getShader()->setProjection( states.getParameters()->getProjectionMatrix() );\n\t}\n\t\n    render();\n\n    for(SceneNodeIt it = subSceneNodes.begin(); it != subSceneNodes.end(); it++)\n    {\n        SceneNode* sub = it->get();\n        sub->setParentModelMatrices(modelMat, normalMat);\n        sub->renderAll();\n    }\n\t\n\tstates.popState();\n}\n\n\/\/--------------------------------------------------------------\nvoid SceneNode::commitTransformation()\n{\n    if(m_localMatrixHasChanged)\n    {\n        m_localModelMatrix =\n            Matrix4::getScaleMat(scale.x(), scale.y(), scale.z())\n            * Matrix4::getRotationMat(rx, 0.f, 0.f)\n            * Matrix4::getRotationMat(0.f, ry, 0.f)\n            * Matrix4::getRotationMat(0.f, 0.f, rz)\n            * Matrix4::getTranslationMat(position.x(), position.y(), position.z());\n\n        m_localNormalMatrix =\n            Matrix4::getRotationMat(rx, 0.f, 0.f)\n            * Matrix4::getRotationMat(0.f, ry, 0.f)\n            * Matrix4::getRotationMat(0.f, 0.f, rz)\n            * Matrix4::getScaleMat(scale.x(), scale.y(), scale.z()).getInverse();\n\n        m_localMatrixHasChanged = false;\n    }\n}\n\n\/\/--------------------------------------------------------------\nvoid SceneNode::calculateRotation(){\n\n    orientation.normalize();\n\n    float convertion = 180.f\/3.14159265359f;\n\n    float x2 = orientation.x()*orientation.x();\n    float y2 = orientation.y()*orientation.y();\n    float xy = sqrt(x2+y2);\n\n    rx = 0.f; \/\/Rotation sur axe frontal\n    ry = -convertion * atan2f(orientation.z(), xy);\n    rz = convertion * atan2f(orientation.y(), orientation.x());\n\n    m_localMatrixHasChanged = true;\n}\n\n\/\/--------------------------------------------------------------\nconst Matrix4 SceneNode::getModelMatrix()\n{\n    commitTransformation();\n\n    return m_parentModelMatrix * m_localModelMatrix;\n}\n\n\/\/--------------------------------------------------------------\nconst Matrix4 SceneNode::getNormalMatrix()\n{\n    commitTransformation();\n\n    return m_parentNormalMatrix * m_localNormalMatrix;\n}\n\n\/\/--------------------------------------------------------------\nstd::shared_ptr<GraphicState> SceneNode::getGraphicState()\n{\n\tif(_state == nullptr)_state = std::shared_ptr<GraphicState>(new GraphicState());\n\treturn _state;\n}\n\nIMPGEARS_END\n<|endoftext|>"}
{"text":"<commit_before>#include \"low_exponent.hh\"\n\nnamespace lowexp {\n\n  using namespace std;\n  \/\/for this attack to work, the message must be the same, exponent must be low\n  mpz_class low_exponent_attack(rsatk::RSA_data m_1, rsatk::RSA_data m_2, rsatk::RSA_data m_3){\n    \/\/first check that attack is valid\n    if(!lowexp_valid(m_1, m_2, m_3)){\n      return -1;\n    }\n    mpz_class message_cubed = 0; \/\/will be assigned in pow_ui\n\n    \/\/mpz_pow_ui(message_cubed, m_1.C, 3);\n    \/\/mod(m_cubed, m_2.n);\n    \/\/for an in depth discussion of these eqs..http:\/\/crypto.stackexchange.com\/a\/6715\n    cout << rsatk::extended_euclidean(m_2.n * m_3.n, m_1.n)[0] << endl;\n\n    mpz_class t_1 = mpz_class(m_1.C) * (m_2.n * m_3.n) * rsatk::extended_euclidean(m_2.n * m_3.n, m_1.n)[0];\n    mpz_class t_2 = mpz_class(m_2.C) * (m_1.n * m_3.n) * rsatk::extended_euclidean(m_1.n * m_3.n, m_2.n)[0];\n    mpz_class t_3 = mpz_class(m_3.C) * (m_2.n * m_1.n) * rsatk::extended_euclidean(m_2.n * m_1.n, m_3.n)[0];\n    mpz_class c = rsatk::mod((t_1 + t_2 + t_3), (m_1.n * m_2.n * m_3.n));\n\n    mpz_class m;\n    mpz_root(m.get_mpz_t(), c.get_mpz_t(), 3);\n    cout << \"Decrypted message is: \" << m << endl;\n    return m;\n  }\n\n  bool lowexp_valid(rsatk::RSA_data m_1, rsatk::RSA_data m_2, rsatk::RSA_data m_3){\n\n    if(m_1.e != m_2.e || m_1.e != m_3.e || m_1.e != 3){\n      cerr << \"Invalid message to use low exponent attack. Must have an exponent of 3.\" << endl;\n      return false;\n    }\n    return true;\n  }\n}\n<commit_msg>Removing a cout<commit_after>#include \"low_exponent.hh\"\n\nnamespace lowexp {\n\n  using namespace std;\n  \/\/for this attack to work, the message must be the same, exponent must be low\n  mpz_class low_exponent_attack(rsatk::RSA_data m_1, rsatk::RSA_data m_2, rsatk::RSA_data m_3){\n    \/\/first check that attack is valid\n    if(!lowexp_valid(m_1, m_2, m_3)){\n      return -1;\n    }\n    mpz_class message_cubed = 0; \/\/will be assigned in pow_ui\n\n    \/\/mpz_pow_ui(message_cubed, m_1.C, 3);\n    \/\/mod(m_cubed, m_2.n);\n    \/\/for an in depth discussion of these eqs..http:\/\/crypto.stackexchange.com\/a\/6715\n    \/\/cout << rsatk::extended_euclidean(m_2.n * m_3.n, m_1.n)[0] << endl;\n\n    mpz_class t_1 = mpz_class(m_1.C) * (m_2.n * m_3.n) * rsatk::extended_euclidean(m_2.n * m_3.n, m_1.n)[0];\n    mpz_class t_2 = mpz_class(m_2.C) * (m_1.n * m_3.n) * rsatk::extended_euclidean(m_1.n * m_3.n, m_2.n)[0];\n    mpz_class t_3 = mpz_class(m_3.C) * (m_2.n * m_1.n) * rsatk::extended_euclidean(m_2.n * m_1.n, m_3.n)[0];\n    mpz_class c = rsatk::mod((t_1 + t_2 + t_3), (m_1.n * m_2.n * m_3.n));\n\n    mpz_class m;\n    mpz_root(m.get_mpz_t(), c.get_mpz_t(), 3);\n    cout << \"Decrypted message is: \" << m << endl;\n    return m;\n  }\n\n  bool lowexp_valid(rsatk::RSA_data m_1, rsatk::RSA_data m_2, rsatk::RSA_data m_3){\n\n    if(m_1.e != m_2.e || m_1.e != m_3.e || m_1.e != 3){\n      cerr << \"Invalid message to use low exponent attack. Must have an exponent of 3.\" << endl;\n      return false;\n    }\n    return true;\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Fix CSV generated time axis. (#666)<commit_after><|endoftext|>"}
{"text":"<commit_before>#include <array>\n#include <string>\n#include <utility>\n\n#include <ros\/ros.h>\n#include <controller_manager\/controller_manager.h>\n#include <hardware_interface\/joint_command_interface.h>\n#include <hardware_interface\/joint_state_interface.h>\n#include <hardware_interface\/robot_hw.h>\n\n#include <ics3\/ics>\n\nclass JointControlInterface\n{\npublic:\n  virtual void fetch() = 0;\n  virtual void move() = 0;\n};\n\nstruct JointData\n{\n  std::string name_;\n  double cmd_;\n  double pos_;\n  double vel_;\n  double eff_;\n};\n\ntemplate<class JntCmdInterface>\nvoid registerJoint(\n    JointData&,\n    hardware_interface::JointStateInterface&,\n    JntCmdInterface&);\n\ntemplate<class JntCmdInterface>\nstruct JointControlBuildData\n{\n  std::string joint_name_;\n  hardware_interface::JointStateInterface& jnt_stat_;\n  JntCmdInterface& jnt_cmd_;\n};\n\nclass ICSControl\n  : public JointControlInterface\n{\npublic:\n  using JntCmdType = hardware_interface::PositionJointInterface;\n  using BuildDataType = JointControlBuildData<JntCmdType>;\n  ICSControl(\n      const BuildDataType&,\n      const std::string&,\n      const ics::ID&);\n  void fetch() override;\n  void move() override;\nprivate:\n  JointData data;\n};\n\nint main(int argc, char *argv[])\n{\n  ros::init(argc, argv, \"arcsys2_control_node\");\n\/\/\n\/\/  Arcsys2HW robot {};\n\/\/  controller_manager::ControllerManager cm {&robot};\n\/\/\n\/\/  ros::Rate rate(1.0 \/ robot.getPeriod().toSec());\n  ros::AsyncSpinner spinner {1};\n\n  spinner.start();\n  while(ros::ok())\n  {\n\/\/    robot.read();\n\/\/    cm.update(robot.getTime(), robot.getPeriod());\n\/\/    robot.write();\n\/\/    rate.sleep();\n  }\n  spinner.stop();\n\n  return 0;\n}\n\ntemplate<class JntCmdInterface>\nvoid registerJoint(\n    JointData& joint,\n    hardware_interface::JointStateInterface& jnt_state,\n    JntCmdInterface& jnt_cmd)\n{\n  jnt_state.registerHandle(hardware_interface::JointStateHandle {joint.name_, joint.pos_, joint.vel_, joint.eff_});\n  jnt_cmd.registerHandle(hardware_interface::JointHandle {jnt_state.getHandle(joint.name_), joint.cmd_});\n}\n<commit_msg>Update registerJoint functions<commit_after>#include <array>\n#include <string>\n#include <utility>\n\n#include <ros\/ros.h>\n#include <controller_manager\/controller_manager.h>\n#include <hardware_interface\/joint_command_interface.h>\n#include <hardware_interface\/joint_state_interface.h>\n#include <hardware_interface\/robot_hw.h>\n\n#include <ics3\/ics>\n\nclass JointControlInterface\n{\npublic:\n  virtual void fetch() = 0;\n  virtual void move() = 0;\n};\n\nstruct JointData\n{\n  std::string name_;\n  double cmd_;\n  double pos_;\n  double vel_;\n  double eff_;\n};\n\ntemplate<class JntCmdInterface>\nstruct JointControlBuildData\n{\n  std::string joint_name_;\n  hardware_interface::JointStateInterface& jnt_stat_;\n  JntCmdInterface& jnt_cmd_;\n};\n\nclass ICSControl\n  : public JointControlInterface\n{\npublic:\n  using JntCmdType = hardware_interface::PositionJointInterface;\n  using BuildDataType = JointControlBuildData<JntCmdType>;\n  ICSControl(\n      const BuildDataType&,\n      const std::string&,\n      const ics::ID&);\n  void fetch() override;\n  void move() override;\nprivate:\n  JointData data_;\n};\n\ntemplate<class JntCmdInterface>\nvoid registerJoint(\n    JointData&,\n    hardware_interface::JointStateInterface&,\n    JntCmdInterface&);\n\ntemplate<class JntCmdInterface>\nvoid registerJoint(\n    JointData&,\n    JointControlBuildData<JntCmdInterface>&);\n\nint main(int argc, char *argv[])\n{\n  ros::init(argc, argv, \"arcsys2_control_node\");\n\/\/\n\/\/  Arcsys2HW robot {};\n\/\/  controller_manager::ControllerManager cm {&robot};\n\/\/\n\/\/  ros::Rate rate(1.0 \/ robot.getPeriod().toSec());\n  ros::AsyncSpinner spinner {1};\n\n  spinner.start();\n  while(ros::ok())\n  {\n\/\/    robot.read();\n\/\/    cm.update(robot.getTime(), robot.getPeriod());\n\/\/    robot.write();\n\/\/    rate.sleep();\n  }\n  spinner.stop();\n\n  return 0;\n}\n\ntemplate<class JntCmdInterface>\ninline void registerJoint(\n    JointData& joint,\n    hardware_interface::JointStateInterface& jnt_stat,\n    JntCmdInterface& jnt_cmd)\n{\n  jnt_stat.registerHandle(hardware_interface::JointStateHandle {joint.name_, joint.pos_, joint.vel_, joint.eff_});\n  jnt_cmd.registerHandle(hardware_interface::JointHandle {jnt_stat.getHandle(joint.name_), joint.cmd_});\n}\n\ntemplate<class JntCmdInterface>\ninline void registerJoint(\n    JointData& joint,\n    JointControlBuildData<JntCmdInterface>& build_data)\n{\n  registerJoint(joint, build_data.jnt_stat_, build_data.jnt_cmd_);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n *                       ____    _    _____                                   *\n *                      \/ ___|  \/ \\  |  ___|    C++                           *\n *                     | |     \/ _ \\ | |_       Actor                         *\n *                     | |___ \/ ___ \\|  _|      Framework                     *\n *                      \\____\/_\/   \\_|_|                                      *\n *                                                                            *\n * Copyright (C) 2011 - 2014                                                  *\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 LICENCE_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_BLOCKING_UNTYPED_ACTOR_HPP\n#define CAF_BLOCKING_UNTYPED_ACTOR_HPP\n\n#include \"caf\/none.hpp\"\n\n#include \"caf\/on.hpp\"\n#include \"caf\/extend.hpp\"\n#include \"caf\/behavior.hpp\"\n#include \"caf\/local_actor.hpp\"\n#include \"caf\/typed_actor.hpp\"\n#include \"caf\/mailbox_element.hpp\"\n#include \"caf\/response_handle.hpp\"\n\n#include \"caf\/mixin\/sync_sender.hpp\"\n#include \"caf\/mixin\/mailbox_based.hpp\"\n\nnamespace caf {\n\n\/**\n * A thread-mapped or context-switching actor using a blocking\n * receive rather than a behavior-stack based message processing.\n * @extends local_actor\n *\/\nclass blocking_actor\n    : public extend<local_actor, blocking_actor>::\n             with<mixin::mailbox_based,\n                  mixin::sync_sender<blocking_response_handle_tag>::impl> {\n public:\n  class functor_based;\n\n  blocking_actor();\n\n  \/**************************************************************************\n   *       utility stuff and receive() member function family       *\n   **************************************************************************\/\n  using timeout_type = std::chrono::high_resolution_clock::time_point;\n\n  struct receive_while_helper {\n\n    std::function<void(behavior&)> m_dq;\n    std::function<bool()> m_stmt;\n\n    template <class... Ts>\n    void operator()(Ts&&... args) {\n      static_assert(sizeof...(Ts) > 0,\n              \"operator() requires at least one argument\");\n      behavior bhvr{std::forward<Ts>(args)...};\n      while (m_stmt()) m_dq(bhvr);\n    }\n\n  };\n\n  template <class T>\n  struct receive_for_helper {\n\n    std::function<void(behavior&)> m_dq;\n    T& begin;\n    T end;\n\n    template <class... Ts>\n    void operator()(Ts&&... args) {\n      behavior bhvr{std::forward<Ts>(args)...};\n      for (; begin != end; ++begin) m_dq(bhvr);\n    }\n\n  };\n\n  struct do_receive_helper {\n\n    std::function<void(behavior&)> m_dq;\n    behavior m_bhvr;\n\n    template <class Statement>\n    void until(Statement stmt) {\n      do {\n        m_dq(m_bhvr);\n      } while (stmt() == false);\n    }\n\n    void until(const bool& bvalue) {\n      until([&] { return bvalue; });\n    }\n\n  };\n\n  \/**\n   * Dequeues the next message from the mailbox that is\n   * matched by given behavior.\n   *\/\n  template <class... Ts>\n  void receive(Ts&&... args) {\n    static_assert(sizeof...(Ts), \"at least one argument required\");\n    behavior bhvr{std::forward<Ts>(args)...};\n    dequeue(bhvr);\n  }\n\n  \/**\n   * Semantically equal to: `for (;;) { receive(...); }`, but does\n   * not cause a temporary behavior object per iteration.\n   *\/\n  template <class... Ts>\n  void receive_loop(Ts&&... args) {\n    behavior bhvr{std::forward<Ts>(args)...};\n    for (;;) dequeue(bhvr);\n  }\n\n  \/**\n   * Receives messages for range `[begin, first)`.\n   * Semantically equal to:\n   * `for ( ; begin != end; ++begin) { receive(...); }`.\n   *\n   * **Usage example:**\n   * ~~~\n   * int i = 0;\n   * receive_for(i, 10) (\n   *   on(atom(\"get\")) >> [&]() -> message {\n   *     return {\"result\", i};\n   *   }\n   * );\n   * ~~~\n   *\/\n  template <class T>\n  receive_for_helper<T> receive_for(T& begin, const T& end) {\n    return {make_dequeue_callback(), begin, end};\n  }\n\n  \/**\n   * Receives messages as long as `stmt` returns true.\n   * Semantically equal to: `while (stmt()) { receive(...); }`.\n   *\n   * **Usage example:**\n   * ~~~\n   * int i = 0;\n   * receive_while([&]() { return (++i <= 10); })\n   * (\n   *   on<int>() >> int_fun,\n   *   on<float>() >> float_fun\n   * );\n   * ~~~\n   *\/\n  template <class Statement>\n  receive_while_helper receive_while(Statement stmt) {\n    static_assert(std::is_same<bool, decltype(stmt())>::value,\n            \"functor or function does not return a boolean\");\n    return {make_dequeue_callback(), stmt};\n  }\n\n  \/**\n   * Receives messages until `stmt` returns true.\n   *\n   * Semantically equal to:\n   * `do { receive(...); } while (stmt() == false);`\n   *\n   * **Usage example:**\n   * ~~~\n   * int i = 0;\n   * do_receive\n   * (\n   *   on<int>() >> int_fun,\n   *   on<float>() >> float_fun\n   * )\n   * .until([&]() { return (++i >= 10); };\n   * ~~~\n   *\/\n  template <class... Ts>\n  do_receive_helper do_receive(Ts&&... args) {\n    return {make_dequeue_callback(), behavior{std::forward<Ts>(args)...}};\n  }\n\n  optional<behavior&> sync_handler(message_id msg_id) {\n    auto i = m_sync_handler.find(msg_id);\n    if (i != m_sync_handler.end()) return i->second;\n    return none;\n  }\n\n  \/**\n   * Blocks this actor until all other actors are done.\n   *\/\n  void await_all_other_actors_done();\n\n  \/**\n   * Implements the actor's behavior.\n   *\/\n  virtual void act() = 0;\n\n  \/** @cond PRIVATE *\/\n\n  \/\/ required from invoke_policy; unused in blocking actors\n  inline void remove_handler(message_id) {}\n\n  \/\/ required by receive() member function family\n  inline void dequeue(behavior&& bhvr) {\n    behavior tmp{std::move(bhvr)};\n    dequeue(tmp);\n  }\n\n  \/\/ required by receive() member function family\n  inline void dequeue(behavior& bhvr) {\n    dequeue_response(bhvr, invalid_message_id);\n  }\n\n  \/\/ implemented by detail::proper_actor\n  virtual void dequeue_response(behavior& bhvr, message_id mid) = 0;\n\n  \/** @endcond *\/\n\n private:\n\n  \/\/ helper function to implement receive_(for|while) and do_receive\n  std::function<void(behavior&)> make_dequeue_callback() {\n    return [=](behavior& bhvr) { dequeue(bhvr); };\n  }\n\n  std::map<message_id, behavior> m_sync_handler;\n\n};\n\nclass blocking_actor::functor_based : public blocking_actor {\n\n public:\n\n  using act_fun = std::function<void(blocking_actor*)>;\n\n  template <class F, class... Ts>\n  functor_based(F f, Ts&&... vs) {\n    blocking_actor* dummy = nullptr;\n    create(dummy, f, std::forward<Ts>(vs)...);\n  }\n\n protected:\n  void act() override;\n\n private:\n  void create(blocking_actor*, act_fun);\n\n  template <class Actor, typename F, typename T0, class... Ts>\n  auto create(Actor* dummy, F f, T0&& v0, Ts&&... vs)\n    -> typename std::enable_if<std::is_same<\n        decltype(f(dummy, std::forward<T0>(v0), std::forward<Ts>(vs)...)),\n        void>::value>::type {\n    create(dummy, std::bind(f, std::placeholders::_1, std::forward<T0>(v0),\n                std::forward<Ts>(vs)...));\n  }\n\n  template <class Actor, typename F, typename T0, class... Ts>\n  auto create(Actor* dummy, F f, T0&& v0, Ts&&... vs)\n    -> typename std::enable_if<std::is_same<\n        decltype(f(std::forward<T0>(v0), std::forward<Ts>(vs)...)),\n        void>::value>::type {\n    std::function<void()> fun =\n      std::bind(f, std::forward<T0>(v0), std::forward<Ts>(vs)...);\n    create(dummy, [fun](Actor*) { fun(); });\n  }\n\n  act_fun m_act;\n};\n\n} \/\/ namespace caf\n\n#endif \/\/ CAF_BLOCKING_UNTYPED_ACTOR_HPP\n<commit_msg>Refactor `create` to work w\/o `enable_if`<commit_after>\/******************************************************************************\n *                       ____    _    _____                                   *\n *                      \/ ___|  \/ \\  |  ___|    C++                           *\n *                     | |     \/ _ \\ | |_       Actor                         *\n *                     | |___ \/ ___ \\|  _|      Framework                     *\n *                      \\____\/_\/   \\_|_|                                      *\n *                                                                            *\n * Copyright (C) 2011 - 2014                                                  *\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 LICENCE_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_BLOCKING_UNTYPED_ACTOR_HPP\n#define CAF_BLOCKING_UNTYPED_ACTOR_HPP\n\n#include \"caf\/none.hpp\"\n\n#include \"caf\/on.hpp\"\n#include \"caf\/extend.hpp\"\n#include \"caf\/behavior.hpp\"\n#include \"caf\/local_actor.hpp\"\n#include \"caf\/typed_actor.hpp\"\n#include \"caf\/mailbox_element.hpp\"\n#include \"caf\/response_handle.hpp\"\n\n#include \"caf\/detail\/type_traits.hpp\"\n\n#include \"caf\/mixin\/sync_sender.hpp\"\n#include \"caf\/mixin\/mailbox_based.hpp\"\n\nnamespace caf {\n\n\/**\n * A thread-mapped or context-switching actor using a blocking\n * receive rather than a behavior-stack based message processing.\n * @extends local_actor\n *\/\nclass blocking_actor\n    : public extend<local_actor, blocking_actor>::\n             with<mixin::mailbox_based,\n                  mixin::sync_sender<blocking_response_handle_tag>::impl> {\n public:\n  class functor_based;\n\n  blocking_actor();\n\n  \/**************************************************************************\n   *       utility stuff and receive() member function family       *\n   **************************************************************************\/\n  using timeout_type = std::chrono::high_resolution_clock::time_point;\n\n  struct receive_while_helper {\n\n    std::function<void(behavior&)> m_dq;\n    std::function<bool()> m_stmt;\n\n    template <class... Ts>\n    void operator()(Ts&&... args) {\n      static_assert(sizeof...(Ts) > 0,\n              \"operator() requires at least one argument\");\n      behavior bhvr{std::forward<Ts>(args)...};\n      while (m_stmt()) m_dq(bhvr);\n    }\n\n  };\n\n  template <class T>\n  struct receive_for_helper {\n\n    std::function<void(behavior&)> m_dq;\n    T& begin;\n    T end;\n\n    template <class... Ts>\n    void operator()(Ts&&... args) {\n      behavior bhvr{std::forward<Ts>(args)...};\n      for (; begin != end; ++begin) m_dq(bhvr);\n    }\n\n  };\n\n  struct do_receive_helper {\n\n    std::function<void(behavior&)> m_dq;\n    behavior m_bhvr;\n\n    template <class Statement>\n    void until(Statement stmt) {\n      do {\n        m_dq(m_bhvr);\n      } while (stmt() == false);\n    }\n\n    void until(const bool& bvalue) {\n      until([&] { return bvalue; });\n    }\n\n  };\n\n  \/**\n   * Dequeues the next message from the mailbox that is\n   * matched by given behavior.\n   *\/\n  template <class... Ts>\n  void receive(Ts&&... args) {\n    static_assert(sizeof...(Ts), \"at least one argument required\");\n    behavior bhvr{std::forward<Ts>(args)...};\n    dequeue(bhvr);\n  }\n\n  \/**\n   * Semantically equal to: `for (;;) { receive(...); }`, but does\n   * not cause a temporary behavior object per iteration.\n   *\/\n  template <class... Ts>\n  void receive_loop(Ts&&... args) {\n    behavior bhvr{std::forward<Ts>(args)...};\n    for (;;) dequeue(bhvr);\n  }\n\n  \/**\n   * Receives messages for range `[begin, first)`.\n   * Semantically equal to:\n   * `for ( ; begin != end; ++begin) { receive(...); }`.\n   *\n   * **Usage example:**\n   * ~~~\n   * int i = 0;\n   * receive_for(i, 10) (\n   *   on(atom(\"get\")) >> [&]() -> message {\n   *     return {\"result\", i};\n   *   }\n   * );\n   * ~~~\n   *\/\n  template <class T>\n  receive_for_helper<T> receive_for(T& begin, const T& end) {\n    return {make_dequeue_callback(), begin, end};\n  }\n\n  \/**\n   * Receives messages as long as `stmt` returns true.\n   * Semantically equal to: `while (stmt()) { receive(...); }`.\n   *\n   * **Usage example:**\n   * ~~~\n   * int i = 0;\n   * receive_while([&]() { return (++i <= 10); })\n   * (\n   *   on<int>() >> int_fun,\n   *   on<float>() >> float_fun\n   * );\n   * ~~~\n   *\/\n  template <class Statement>\n  receive_while_helper receive_while(Statement stmt) {\n    static_assert(std::is_same<bool, decltype(stmt())>::value,\n            \"functor or function does not return a boolean\");\n    return {make_dequeue_callback(), stmt};\n  }\n\n  \/**\n   * Receives messages until `stmt` returns true.\n   *\n   * Semantically equal to:\n   * `do { receive(...); } while (stmt() == false);`\n   *\n   * **Usage example:**\n   * ~~~\n   * int i = 0;\n   * do_receive\n   * (\n   *   on<int>() >> int_fun,\n   *   on<float>() >> float_fun\n   * )\n   * .until([&]() { return (++i >= 10); };\n   * ~~~\n   *\/\n  template <class... Ts>\n  do_receive_helper do_receive(Ts&&... args) {\n    return {make_dequeue_callback(), behavior{std::forward<Ts>(args)...}};\n  }\n\n  optional<behavior&> sync_handler(message_id msg_id) {\n    auto i = m_sync_handler.find(msg_id);\n    if (i != m_sync_handler.end()) return i->second;\n    return none;\n  }\n\n  \/**\n   * Blocks this actor until all other actors are done.\n   *\/\n  void await_all_other_actors_done();\n\n  \/**\n   * Implements the actor's behavior.\n   *\/\n  virtual void act() = 0;\n\n  \/** @cond PRIVATE *\/\n\n  \/\/ required from invoke_policy; unused in blocking actors\n  inline void remove_handler(message_id) {}\n\n  \/\/ required by receive() member function family\n  inline void dequeue(behavior&& bhvr) {\n    behavior tmp{std::move(bhvr)};\n    dequeue(tmp);\n  }\n\n  \/\/ required by receive() member function family\n  inline void dequeue(behavior& bhvr) {\n    dequeue_response(bhvr, invalid_message_id);\n  }\n\n  \/\/ implemented by detail::proper_actor\n  virtual void dequeue_response(behavior& bhvr, message_id mid) = 0;\n\n  \/** @endcond *\/\n\n private:\n\n  \/\/ helper function to implement receive_(for|while) and do_receive\n  std::function<void(behavior&)> make_dequeue_callback() {\n    return [=](behavior& bhvr) { dequeue(bhvr); };\n  }\n\n  std::map<message_id, behavior> m_sync_handler;\n\n};\n\nclass blocking_actor::functor_based : public blocking_actor {\n\n public:\n\n  using act_fun = std::function<void(blocking_actor*)>;\n\n  template <class F, class... Ts>\n  functor_based(F f, Ts&&... vs) {\n    using trait = typename detail::get_callable_trait<F>::type;\n    using arg0 = typename detail::tl_head<typename trait::arg_types>::type;\n    blocking_actor* dummy = nullptr;\n    std::integral_constant<bool, std::is_same<arg0, blocking_actor*>::value> tk;\n    create(dummy, tk, f, std::forward<Ts>(vs)...);\n  }\n\n protected:\n  void act() override;\n\n private:\n  void create(blocking_actor*, act_fun);\n\n  template <class Actor, typename F, class... Ts>\n  void create(Actor* dummy, std::true_type, F f, Ts&&... vs) {\n    create(dummy, std::bind(f, std::placeholders::_1, std::forward<Ts>(vs)...));\n  }\n\n  template <class Actor, typename F, class... Ts>\n  void create(Actor* dummy, std::false_type, F f, Ts&&... vs) {\n    std::function<void()> fun = std::bind(f, std::forward<Ts>(vs)...);\n    create(dummy, [fun](Actor*) { fun(); });\n  }\n\n  act_fun m_act;\n};\n\n} \/\/ namespace caf\n\n#endif \/\/ CAF_BLOCKING_UNTYPED_ACTOR_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n *                       ____    _    _____                                   *\n *                      \/ ___|  \/ \\  |  ___|    C++                           *\n *                     | |     \/ _ \\ | |_       Actor                         *\n *                     | |___ \/ ___ \\|  _|      Framework                     *\n *                      \\____\/_\/   \\_|_|                                      *\n *                                                                            *\n * Copyright 2011-2019 Dominik Charousset                                     *\n *                                                                            *\n * Distributed under the terms and conditions of the BSD 3-Clause License or  *\n * (at your option) under the terms and conditions of the Boost Software      *\n * License 1.0. See accompanying files LICENSE and LICENSE_ALTERNATIVE.       *\n *                                                                            *\n * If you did not receive a copy of the license files, see                    *\n * http:\/\/opensource.org\/licenses\/BSD-3-Clause and                            *\n * http:\/\/www.boost.org\/LICENSE_1_0.txt.                                      *\n ******************************************************************************\/\n\n#include \"caf\/net\/pollset_updater.hpp\"\n\n#include \"caf\/net\/multiplexer.hpp\"\n#include \"caf\/sec.hpp\"\n#include \"caf\/span.hpp\"\n#include \"caf\/variant.hpp\"\n\nnamespace caf {\nnamespace net {\n\npollset_updater::pollset_updater(pipe_socket read_handle,\n                                 multiplexer_ptr parent)\n  : super(read_handle, std::move(parent)), buf_size_(0) {\n  mask_ = operation::read;\n  nonblocking(read_handle, true);\n}\n\npollset_updater::~pollset_updater() {\n  \/\/ nop\n}\n\nbool pollset_updater::handle_read_event() {\n  for (;;) {\n    auto res = read(handle(), make_span(buf_.data(), buf_.size() - buf_size_));\n    if (auto num_bytes = get_if<size_t>(&res)) {\n      buf_size_ += *num_bytes;\n      if (buf_.size() == buf_size_) {\n        buf_size_ = 0;\n        auto value = *reinterpret_cast<intptr_t*>(buf_.data());\n        socket_manager_ptr mgr{reinterpret_cast<socket_manager*>(value), false};\n        if (auto ptr = parent_.lock())\n          ptr->update(mgr);\n      }\n    } else {\n      return get<sec>(res) == sec::unavailable_or_would_block;\n    }\n  }\n}\n\nbool pollset_updater::handle_write_event() {\n  return false;\n}\n\nvoid pollset_updater::handle_error(sec) {\n  \/\/ nop\n}\n\n} \/\/ namespace net\n} \/\/ namespace caf\n<commit_msg>Fix offset bug<commit_after>\/******************************************************************************\n *                       ____    _    _____                                   *\n *                      \/ ___|  \/ \\  |  ___|    C++                           *\n *                     | |     \/ _ \\ | |_       Actor                         *\n *                     | |___ \/ ___ \\|  _|      Framework                     *\n *                      \\____\/_\/   \\_|_|                                      *\n *                                                                            *\n * Copyright 2011-2019 Dominik Charousset                                     *\n *                                                                            *\n * Distributed under the terms and conditions of the BSD 3-Clause License or  *\n * (at your option) under the terms and conditions of the Boost Software      *\n * License 1.0. See accompanying files LICENSE and LICENSE_ALTERNATIVE.       *\n *                                                                            *\n * If you did not receive a copy of the license files, see                    *\n * http:\/\/opensource.org\/licenses\/BSD-3-Clause and                            *\n * http:\/\/www.boost.org\/LICENSE_1_0.txt.                                      *\n ******************************************************************************\/\n\n#include \"caf\/net\/pollset_updater.hpp\"\n\n#include \"caf\/net\/multiplexer.hpp\"\n#include \"caf\/sec.hpp\"\n#include \"caf\/span.hpp\"\n#include \"caf\/variant.hpp\"\n\nnamespace caf {\nnamespace net {\n\npollset_updater::pollset_updater(pipe_socket read_handle,\n                                 multiplexer_ptr parent)\n  : super(read_handle, std::move(parent)), buf_size_(0) {\n  mask_ = operation::read;\n  nonblocking(read_handle, true);\n}\n\npollset_updater::~pollset_updater() {\n  \/\/ nop\n}\n\nbool pollset_updater::handle_read_event() {\n  for (;;) {\n    auto res = read(handle(), make_span(buf_.data() + buf_size_,\n                                        buf_.size() - buf_size_));\n    if (auto num_bytes = get_if<size_t>(&res)) {\n      buf_size_ += *num_bytes;\n      if (buf_.size() == buf_size_) {\n        buf_size_ = 0;\n        auto value = *reinterpret_cast<intptr_t*>(buf_.data());\n        socket_manager_ptr mgr{reinterpret_cast<socket_manager*>(value), false};\n        if (auto ptr = parent_.lock())\n          ptr->update(mgr);\n      }\n    } else {\n      return get<sec>(res) == sec::unavailable_or_would_block;\n    }\n  }\n}\n\nbool pollset_updater::handle_write_event() {\n  return false;\n}\n\nvoid pollset_updater::handle_error(sec) {\n  \/\/ nop\n}\n\n} \/\/ namespace net\n} \/\/ namespace caf\n<|endoftext|>"}
{"text":"<commit_before>\/***************************************************************************\n *   Copyright (C) 1998-2013 by authors (see AUTHORS.txt)                  *\n *                                                                         *\n *   This file is part of LuxRays.                                         *\n *                                                                         *\n *   LuxRays 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 *   LuxRays is distributed in the hope that it will be 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 *   LuxRays website: http:\/\/www.luxrender.net                             *\n ***************************************************************************\/\n\n#include <cstdlib>\n#include <queue>\n#include <iostream>\n#include <iomanip>\n\n#include \"luxrays\/luxrays.h\"\n#include \"luxrays\/core\/context.h\"\n#include \"luxrays\/core\/intersectiondevice.h\"\n#include \"luxrays\/core\/oclintersectiondevice.h\"\n#include \"luxrays\/core\/randomgen.h\"\n\n#define RAYBUFFERS_COUNT 10\n#define TRIANGLE_COUNT 500\n#define SPACE_SIZE 1000.f\n\nvoid DebugHandler(const char *msg) {\n\tstd::cerr << msg << std::endl;\n}\n\nint main(int argc, char** argv) {\n\ttry {\n\t\tstd::cerr << \"LuxRays Simple IntersectionDevice Benchmark v\" << LUXRAYS_VERSION_MAJOR << \".\" << LUXRAYS_VERSION_MINOR << std::endl;\n\t\tstd::cerr << \"Usage: \" << argv[0] << std::endl;\n\n\t\t\/\/--------------------------------------------------------------------------\n\t\t\/\/ Create the context\n\t\t\/\/--------------------------------------------------------------------------\n\n\t\tluxrays::Context *ctx = new luxrays::Context(DebugHandler);\n\n\t\t\/\/ Get the list of all devices available\n\t\tstd::vector<luxrays::DeviceDescription *> deviceDescs = std::vector<luxrays::DeviceDescription *>(ctx->GetAvailableDeviceDescriptions());\n\n\t\t\/\/ Use the first device available\n\t\t\/\/luxrays::DeviceDescription::FilterOne(deviceDescs);\n\n\t\t\/\/ Use the first native C++ device available\n\t\t\/\/luxrays::DeviceDescription::Filter(luxrays::DEVICE_TYPE_NATIVE_THREAD, deviceDescs);\n\n\t\t\/\/ Use the first OpenCL device available\n\t\t\/\/luxrays::DeviceDescription::Filter(luxrays::DEVICE_TYPE_OPENCL_ALL, deviceDescs);\n\t\t\/\/luxrays::DeviceDescription::FilterOne(deviceDescs);\n\n\t\t\/\/ Use the first OpenCL CPU device available\n\t\t\/\/luxrays::DeviceDescription::Filter(luxrays::DEVICE_TYPE_OPENCL_ALL, deviceDescs);\n\t\t\/\/luxrays::OpenCLDeviceDescription::Filter(luxrays::DEVICE_TYPE_OPENCL_CPU, deviceDescs);\n\n\t\t\/\/ Use the first OpenCL GPU device available\n\t\tluxrays::DeviceDescription::Filter(luxrays::DEVICE_TYPE_OPENCL_ALL, deviceDescs);\n\t\tluxrays::OpenCLDeviceDescription::Filter(luxrays::DEVICE_TYPE_OPENCL_GPU, deviceDescs);\n\n\t\t\/\/ Use all GPU devices available (for virtual device)\n\t\t\/\/luxrays::DeviceDescription::Filter(luxrays::DEVICE_TYPE_OPENCL_ALL, deviceDescs);\n\t\t\/\/luxrays::OpenCLDeviceDescription::Filter(luxrays::DEVICE_TYPE_OPENCL_GPU, deviceDescs);\n\t\t\n\t\tif (deviceDescs.size() < 1) {\n\t\t\tstd::cerr << \"Unable to find an usable intersection device\" << std::endl;\n\t\t\treturn (EXIT_FAILURE);\n\t\t}\n\n\t\t\/\/ Single device\n\t\tdeviceDescs.resize(1);\n\t\tstd::cerr << \"Selected intersection device: \" << deviceDescs[0]->GetName();\n\t\tluxrays::IntersectionDevice *device = ctx->AddIntersectionDevices(deviceDescs)[0];\n\n\t\t\/\/ Multiple devices\n\t\t\/\/ctx->AddVirtualIntersectionDevices(deviceDescs);\n\t\t\/\/luxrays::IntersectionDevice *device = ctx->GetIntersectionDevices()[0];\n\t\t\n\n\t\t\/\/ If it is a NativeThreadIntersectionDevice, you can set the number of threads\n\t\t\/\/ to use. The default is to use one for each core available.\n\t\t\/\/((luxrays::NativeThreadIntersectionDevice *)device)->SetThreadCount(1);\n\n\t\t\/\/--------------------------------------------------------------------------\n\t\t\/\/ Build the data set\n\t\t\/\/--------------------------------------------------------------------------\n\n\t\tstd::cerr << \"Creating a \" << TRIANGLE_COUNT << \" triangle data set\" << std::endl;\n\n\t\tluxrays::RandomGenerator rnd(1u);\n\t\tluxrays::Point *verts = new luxrays::Point[TRIANGLE_COUNT * 3];\n\t\tluxrays::Triangle *tris = new luxrays::Triangle[TRIANGLE_COUNT];\n\n\t\tfor (size_t i = 0; i < TRIANGLE_COUNT; ++i) {\n\t\t\tluxrays::Vector v0(0.1f * rnd.floatValue(), 0.1f * rnd.floatValue(), 0.1f * rnd.floatValue());\n\t\t\tv0.x += 0.1f * luxrays::Sgn(v0.x);\n\t\t\tv0.y += 0.1f * luxrays::Sgn(v0.y);\n\t\t\tv0.z += 0.1f * luxrays::Sgn(v0.z);\n\n\t\t\tluxrays::Vector v1, v2;\n\t\t\tluxrays::CoordinateSystem(v0, &v1, &v2);\n\t\t\tv1 *= 0.1f;\n\t\t\tv2 *= 0.1f;\n\n\t\t\tsize_t vIndex = i * 3;\n\t\t\tverts[vIndex].x = (SPACE_SIZE * rnd.floatValue() - SPACE_SIZE \/ 2.f) + v0.x;\n\t\t\tverts[vIndex].y = (SPACE_SIZE * rnd.floatValue() - SPACE_SIZE \/ 2.f) + v0.y;\n\t\t\tverts[vIndex].z = (SPACE_SIZE * rnd.floatValue() - SPACE_SIZE \/ 2.f) + v0.z;\n\n\t\t\tverts[vIndex + 1].x = (SPACE_SIZE * rnd.floatValue() - SPACE_SIZE \/ 2.f) + v1.x;\n\t\t\tverts[vIndex + 1].y = (SPACE_SIZE * rnd.floatValue() - SPACE_SIZE \/ 2.f) + v1.y;\n\t\t\tverts[vIndex + 1].z = (SPACE_SIZE * rnd.floatValue() - SPACE_SIZE \/ 2.f) + v1.z;\n\n\t\t\tverts[vIndex + 2].x = (SPACE_SIZE * rnd.floatValue() - SPACE_SIZE \/ 2.f) + v2.x;\n\t\t\tverts[vIndex + 2].y = (SPACE_SIZE * rnd.floatValue() - SPACE_SIZE \/ 2.f) + v2.y;\n\t\t\tverts[vIndex + 2].z = (SPACE_SIZE * rnd.floatValue() - SPACE_SIZE \/ 2.f) + v2.z;\n\n\t\t\ttris[i].v[0] = vIndex;\n\t\t\ttris[i].v[1] = vIndex + 1;\n\t\t\ttris[i].v[2] = vIndex + 2;\n\t\t}\n\n\t\tluxrays::TriangleMesh *mesh = new luxrays::TriangleMesh(TRIANGLE_COUNT * 3, TRIANGLE_COUNT, verts, tris);\n\t\tluxrays::DataSet *dataSet = new luxrays::DataSet(ctx);\n\t\tdataSet->Add(mesh);\n\t\tdataSet->Preprocess();\n\t\tctx->SetDataSet(dataSet);\n\n\t\t\/\/--------------------------------------------------------------------------\n\t\t\/\/ Build the ray buffers\n\t\t\/\/--------------------------------------------------------------------------\n\n\t\tstd::cerr << \"Creating \" << RAYBUFFERS_COUNT << \" ray buffers\" << std::endl;\n\n\t\tluxrays::Ray ray;\n\t\tstd::queue<luxrays::RayBuffer *> todoRayBuffers;\n\t\tstd::vector<luxrays::RayBuffer *> rayBuffers;\n\t\tfor (size_t i = 0; i < RAYBUFFERS_COUNT; ++i) {\n\t\t\tluxrays::RayBuffer *rayBuffer = device->NewRayBuffer();\n\t\t\ttodoRayBuffers.push(rayBuffer);\n\t\t\trayBuffers.push_back(rayBuffer);\n\n\t\t\tfor (size_t j = 0; j < rayBuffer->GetSize(); ++j) {\n\t\t\t\tray.o = luxrays::Point(SPACE_SIZE * rnd.floatValue() - SPACE_SIZE \/ 2.f,\n\t\t\t\t\t\tSPACE_SIZE * rnd.floatValue() - SPACE_SIZE \/ 2.f,\n\t\t\t\t\t\tSPACE_SIZE * rnd.floatValue() - SPACE_SIZE \/ 2.f);\n\n\t\t\t\tdo {\n\t\t\t\t\tray.d = luxrays::Vector(rnd.floatValue(), rnd.floatValue(), rnd.floatValue());\n\t\t\t\t} while (ray.d == luxrays::Vector(0.f, 0.f, 0.f)); \/\/ Just in case ...\n\t\t\t\tray.d = luxrays::Normalize(ray.d);\n\n\t\t\t\tray.mint = luxrays::MachineEpsilon::E(ray.o);\n\t\t\t\tray.maxt = 1000.f;\n\n\t\t\t\trayBuffer->AddRay(ray);\n\t\t\t}\n\t\t}\n\n\t\t\/\/--------------------------------------------------------------------------\n\t\t\/\/ Run the serial benchmark. This simulate one single thread pushing\n\t\t\/\/ rays to trace.\n\t\t\/\/--------------------------------------------------------------------------\n\n\t\t{\n\t\t\t\/\/ The number of queues used\n\t\t\tdevice->SetQueueCount(1);\n\t\t\t\/\/ You have to set the max. number of buffers you can push between 2 pop.\n\t\t\tdevice->SetBufferCount(RAYBUFFERS_COUNT);\n\n\t\t\tctx->Start();\n\n\t\t\tstd::cerr << \"Running the serial benchmark for 15 seconds...\" << std::endl;\n\t\t\tdouble tStart = luxrays::WallClockTime();\n\t\t\tdouble tLastCheck = tStart;\n\t\t\tdouble bufferDone = 0.0;\n\t\t\tbool done = false;\n\t\t\twhile (!done) {\n\t\t\t\twhile (todoRayBuffers.size() > 0) {\n\t\t\t\t\tdevice->PushRayBuffer(todoRayBuffers.front());\n\t\t\t\t\ttodoRayBuffers.pop();\n\t\n\t\t\t\t\t\/\/ Check if it is time to stop\n\t\t\t\t\tconst double tNow = luxrays::WallClockTime();\n\t\t\t\t\tif (tNow - tLastCheck > 1.0) {\n\t\t\t\t\t\tif (tNow - tStart > 15.0) {\n\t\t\t\t\t\t\tdone = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\n\t\t\t\t\t\tstd::cerr << int(tNow - tStart) << \"\/15secs\" << std::endl;\n\t\t\t\t\t\ttLastCheck = tNow;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\n\t\t\t\ttodoRayBuffers.push(device->PopRayBuffer());\n\t\t\t\tbufferDone += 1.0;\n\t\t\t}\n\t\n\t\t\twhile (todoRayBuffers.size() != RAYBUFFERS_COUNT) {\n\t\t\t\ttodoRayBuffers.push(device->PopRayBuffer());\n\t\t\t\tbufferDone += 1.0;\n\t\t\t}\n\t\t\tdouble tStop = luxrays::WallClockTime();\n\t\t\tdouble tTime = tStop - tStart;\n\t\n\t\t\tctx->Stop();\n\n\t\t\tstd::cerr << \"Test total time: \" << tTime << std::endl;\n\t\t\tstd::cerr << \"Test total ray buffer count: \" << int(bufferDone) << std::endl;\n\t\t\tstd::cerr << \"Test ray buffer size: \" << todoRayBuffers.front()->GetRayCount() << std::endl;\n\t\t\tdouble raySec = (bufferDone * todoRayBuffers.front()->GetRayCount()) \/ tTime;\n\t\t\tif (raySec < 10000.0)\n\t\t\t\tstd::cerr << \"Test performance: \" << std::setiosflags(std::ios::fixed) << std::setprecision(2) <<\n\t\t\t\t\t\traySec <<\" rays\/sec\" << std::endl;\n\t\t\telse if (raySec < 1000000.0)\n\t\t\t\tstd::cerr << \"Test performance: \" << std::setiosflags(std::ios::fixed) << std::setprecision(2) <<\n\t\t\t\t\t\t(raySec \/ 1000.0) <<\"K rays\/sec\" << std::endl;\n\t\t\telse\n\t\t\t\tstd::cerr << \"Test performance: \" << std::setiosflags(std::ios::fixed) << std::setprecision(2) <<\n\t\t\t\t\t\t(raySec \/ 1000000.0) <<\"M rays\/sec\" << std::endl;\n\t\t}\n\n\t\t\/\/--------------------------------------------------------------------------\n\t\t\/\/ Run the parallel benchmark. This simulate multiple threads pushing\n\t\t\/\/ rays to trace.\n\t\t\/\/--------------------------------------------------------------------------\n\n\t\t{\n\t\t\t\/\/ The number of queues used\n\t\t\tdevice->SetQueueCount(RAYBUFFERS_COUNT);\n\t\t\t\/\/ You have to set the max. number of buffers you can push between 2 pop.\n\t\t\tdevice->SetBufferCount(1);\n\n\t\t\tctx->Start();\n\n\t\t\tstd::cerr << \"Running the parallel benchmark for 15 seconds...\" << std::endl;\n\t\t\tdouble tStart = luxrays::WallClockTime();\n\n\t\t\tfor (u_int i = 0; i < RAYBUFFERS_COUNT; ++i)\n\t\t\t\tdevice->PushRayBuffer(rayBuffers[i], i);\n\n\t\t\tdouble tLastCheck = tStart;\n\t\t\tdouble bufferDone = 0.0;\n\t\t\tbool done = false;\n\t\t\tu_int queueIndex = 0;\n\t\t\twhile (!done) {\n\t\t\t\tdevice->PopRayBuffer(queueIndex);\n\t\t\t\tbufferDone += 1.0;\n\t\n\t\t\t\tdevice->PushRayBuffer(rayBuffers[queueIndex], queueIndex);\n\t\n\t\t\t\t\/\/ Check if it is time to stop\n\t\t\t\tconst double tNow = luxrays::WallClockTime();\n\t\t\t\tif (tNow - tLastCheck > 1.0) {\n\t\t\t\t\tif (tNow - tStart > 15.0) {\n\t\t\t\t\t\tdone = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\n\t\t\t\t\tstd::cerr << int(tNow - tStart) << \"\/15secs\" << std::endl;\n\t\t\t\t\ttLastCheck = tNow;\n\t\t\t\t}\n\t\n\t\t\t\tqueueIndex = (queueIndex + 1) % RAYBUFFERS_COUNT;\n\t\t\t}\n\n\t\t\tfor (u_int i = 0; i < RAYBUFFERS_COUNT; ++i)\n\t\t\t\tdevice->PopRayBuffer(i);\n\t\t\tbufferDone += RAYBUFFERS_COUNT;\n\n\t\t\tdouble tStop = luxrays::WallClockTime();\n\t\t\tdouble tTime = tStop - tStart;\n\n\t\t\tctx->Stop();\n\n\t\t\tstd::cerr << \"Test total time: \" << tTime << std::endl;\n\t\t\tstd::cerr << \"Test total ray buffer count: \" << int(bufferDone) << std::endl;\n\t\t\tstd::cerr << \"Test ray buffer size: \" << todoRayBuffers.front()->GetRayCount() << std::endl;\n\t\t\tdouble raySec = (bufferDone * todoRayBuffers.front()->GetRayCount()) \/ tTime;\n\t\t\tif (raySec < 10000.0)\n\t\t\t\tstd::cerr << \"Test performance: \" << std::setiosflags(std::ios::fixed) << std::setprecision(2) <<\n\t\t\t\t\t\traySec <<\" rays\/sec\" << std::endl;\n\t\t\telse if (raySec < 1000000.0)\n\t\t\t\tstd::cerr << \"Test performance: \" << std::setiosflags(std::ios::fixed) << std::setprecision(2) <<\n\t\t\t\t\t\t(raySec \/ 1000.0) <<\"K rays\/sec\" << std::endl;\n\t\t\telse\n\t\t\t\tstd::cerr << \"Test performance: \" << std::setiosflags(std::ios::fixed) << std::setprecision(2) <<\n\t\t\t\t\t\t(raySec \/ 1000000.0) <<\"M rays\/sec\" << std::endl;\n\t\t}\n\n\t\t\/\/--------------------------------------------------------------------------\n\t\t\/\/ Free everything\n\t\t\/\/--------------------------------------------------------------------------\n\n\t\twhile (todoRayBuffers.size() > 0) {\n\t\t\tdelete todoRayBuffers.front();\n\t\t\ttodoRayBuffers.pop();\n\t\t}\n\n\t\tdelete ctx;\n\t\tdelete dataSet;\n\t\tmesh->Delete();\n\t\tdelete mesh;\n\n\t\tstd::cerr << \"Done.\" << std::endl;\n#if !defined(LUXRAYS_DISABLE_OPENCL)\n\t} catch (cl::Error err) {\n\t\tstd::cout << \"OpenCL ERROR: \" << err.what() << \"(\" << luxrays::oclErrorString(err.err()) << \")\" << std::endl;\n\t\treturn EXIT_FAILURE;\n#endif\n\t} catch (std::runtime_error err) {\n\t\tstd::cout << \"RUNTIME ERROR: \" << err.what() << std::endl;\n\t\treturn EXIT_FAILURE;\n\t} catch (std::exception err) {\n\t\tstd::cout << \"ERROR: \" << err.what() << std::endl;\n\t\treturn EXIT_FAILURE;\n\t}\n\n\treturn EXIT_SUCCESS;\n}\n<commit_msg>Fixed a typo<commit_after>\/***************************************************************************\n *   Copyright (C) 1998-2013 by authors (see AUTHORS.txt)                  *\n *                                                                         *\n *   This file is part of LuxRays.                                         *\n *                                                                         *\n *   LuxRays 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 *   LuxRays is distributed in the hope that it will be 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 *   LuxRays website: http:\/\/www.luxrender.net                             *\n ***************************************************************************\/\n\n#include <cstdlib>\n#include <queue>\n#include <iostream>\n#include <iomanip>\n\n#include \"luxrays\/luxrays.h\"\n#include \"luxrays\/core\/context.h\"\n#include \"luxrays\/core\/intersectiondevice.h\"\n#include \"luxrays\/core\/oclintersectiondevice.h\"\n#include \"luxrays\/core\/randomgen.h\"\n\n#define RAYBUFFERS_COUNT 10\n#define TRIANGLE_COUNT 500\n#define SPACE_SIZE 1000.f\n\nvoid DebugHandler(const char *msg) {\n\tstd::cerr << msg << std::endl;\n}\n\nint main(int argc, char** argv) {\n\ttry {\n\t\tstd::cerr << \"LuxRays Simple IntersectionDevice Benchmark v\" << LUXRAYS_VERSION_MAJOR << \".\" << LUXRAYS_VERSION_MINOR << std::endl;\n\t\tstd::cerr << \"Usage: \" << argv[0] << std::endl;\n\n\t\t\/\/--------------------------------------------------------------------------\n\t\t\/\/ Create the context\n\t\t\/\/--------------------------------------------------------------------------\n\n\t\tluxrays::Context *ctx = new luxrays::Context(DebugHandler);\n\n\t\t\/\/ Get the list of all devices available\n\t\tstd::vector<luxrays::DeviceDescription *> deviceDescs = std::vector<luxrays::DeviceDescription *>(ctx->GetAvailableDeviceDescriptions());\n\n\t\t\/\/ Use the first device available\n\t\t\/\/luxrays::DeviceDescription::FilterOne(deviceDescs);\n\n\t\t\/\/ Use the first native C++ device available\n\t\t\/\/luxrays::DeviceDescription::Filter(luxrays::DEVICE_TYPE_NATIVE_THREAD, deviceDescs);\n\n\t\t\/\/ Use the first OpenCL device available\n\t\t\/\/luxrays::DeviceDescription::Filter(luxrays::DEVICE_TYPE_OPENCL_ALL, deviceDescs);\n\t\t\/\/luxrays::DeviceDescription::FilterOne(deviceDescs);\n\n\t\t\/\/ Use the first OpenCL CPU device available\n\t\t\/\/luxrays::DeviceDescription::Filter(luxrays::DEVICE_TYPE_OPENCL_ALL, deviceDescs);\n\t\t\/\/luxrays::OpenCLDeviceDescription::Filter(luxrays::DEVICE_TYPE_OPENCL_CPU, deviceDescs);\n\n\t\t\/\/ Use the first OpenCL GPU device available\n\t\tluxrays::DeviceDescription::Filter(luxrays::DEVICE_TYPE_OPENCL_ALL, deviceDescs);\n\t\tluxrays::OpenCLDeviceDescription::Filter(luxrays::DEVICE_TYPE_OPENCL_GPU, deviceDescs);\n\n\t\t\/\/ Use all GPU devices available (for virtual device)\n\t\t\/\/luxrays::DeviceDescription::Filter(luxrays::DEVICE_TYPE_OPENCL_ALL, deviceDescs);\n\t\t\/\/luxrays::OpenCLDeviceDescription::Filter(luxrays::DEVICE_TYPE_OPENCL_GPU, deviceDescs);\n\t\t\n\t\tif (deviceDescs.size() < 1) {\n\t\t\tstd::cerr << \"Unable to find an usable intersection device\" << std::endl;\n\t\t\treturn (EXIT_FAILURE);\n\t\t}\n\n\t\t\/\/ Single device\n\t\tdeviceDescs.resize(1);\n\t\tstd::cerr << \"Selected intersection device: \" << deviceDescs[0]->GetName();\n\t\tluxrays::IntersectionDevice *device = ctx->AddIntersectionDevices(deviceDescs)[0];\n\n\t\t\/\/ Multiple devices\n\t\t\/\/ctx->AddVirtualIntersectionDevices(deviceDescs);\n\t\t\/\/luxrays::IntersectionDevice *device = ctx->GetIntersectionDevice()[0];\n\t\t\n\n\t\t\/\/ If it is a NativeThreadIntersectionDevice, you can set the number of threads\n\t\t\/\/ to use. The default is to use one for each core available.\n\t\t\/\/((luxrays::NativeThreadIntersectionDevice *)device)->SetThreadCount(1);\n\n\t\t\/\/--------------------------------------------------------------------------\n\t\t\/\/ Build the data set\n\t\t\/\/--------------------------------------------------------------------------\n\n\t\tstd::cerr << \"Creating a \" << TRIANGLE_COUNT << \" triangle data set\" << std::endl;\n\n\t\tluxrays::RandomGenerator rnd(1u);\n\t\tluxrays::Point *verts = new luxrays::Point[TRIANGLE_COUNT * 3];\n\t\tluxrays::Triangle *tris = new luxrays::Triangle[TRIANGLE_COUNT];\n\n\t\tfor (size_t i = 0; i < TRIANGLE_COUNT; ++i) {\n\t\t\tluxrays::Vector v0(0.1f * rnd.floatValue(), 0.1f * rnd.floatValue(), 0.1f * rnd.floatValue());\n\t\t\tv0.x += 0.1f * luxrays::Sgn(v0.x);\n\t\t\tv0.y += 0.1f * luxrays::Sgn(v0.y);\n\t\t\tv0.z += 0.1f * luxrays::Sgn(v0.z);\n\n\t\t\tluxrays::Vector v1, v2;\n\t\t\tluxrays::CoordinateSystem(v0, &v1, &v2);\n\t\t\tv1 *= 0.1f;\n\t\t\tv2 *= 0.1f;\n\n\t\t\tsize_t vIndex = i * 3;\n\t\t\tverts[vIndex].x = (SPACE_SIZE * rnd.floatValue() - SPACE_SIZE \/ 2.f) + v0.x;\n\t\t\tverts[vIndex].y = (SPACE_SIZE * rnd.floatValue() - SPACE_SIZE \/ 2.f) + v0.y;\n\t\t\tverts[vIndex].z = (SPACE_SIZE * rnd.floatValue() - SPACE_SIZE \/ 2.f) + v0.z;\n\n\t\t\tverts[vIndex + 1].x = (SPACE_SIZE * rnd.floatValue() - SPACE_SIZE \/ 2.f) + v1.x;\n\t\t\tverts[vIndex + 1].y = (SPACE_SIZE * rnd.floatValue() - SPACE_SIZE \/ 2.f) + v1.y;\n\t\t\tverts[vIndex + 1].z = (SPACE_SIZE * rnd.floatValue() - SPACE_SIZE \/ 2.f) + v1.z;\n\n\t\t\tverts[vIndex + 2].x = (SPACE_SIZE * rnd.floatValue() - SPACE_SIZE \/ 2.f) + v2.x;\n\t\t\tverts[vIndex + 2].y = (SPACE_SIZE * rnd.floatValue() - SPACE_SIZE \/ 2.f) + v2.y;\n\t\t\tverts[vIndex + 2].z = (SPACE_SIZE * rnd.floatValue() - SPACE_SIZE \/ 2.f) + v2.z;\n\n\t\t\ttris[i].v[0] = vIndex;\n\t\t\ttris[i].v[1] = vIndex + 1;\n\t\t\ttris[i].v[2] = vIndex + 2;\n\t\t}\n\n\t\tluxrays::TriangleMesh *mesh = new luxrays::TriangleMesh(TRIANGLE_COUNT * 3, TRIANGLE_COUNT, verts, tris);\n\t\tluxrays::DataSet *dataSet = new luxrays::DataSet(ctx);\n\t\tdataSet->Add(mesh);\n\t\tdataSet->Preprocess();\n\t\tctx->SetDataSet(dataSet);\n\n\t\t\/\/--------------------------------------------------------------------------\n\t\t\/\/ Build the ray buffers\n\t\t\/\/--------------------------------------------------------------------------\n\n\t\tstd::cerr << \"Creating \" << RAYBUFFERS_COUNT << \" ray buffers\" << std::endl;\n\n\t\tluxrays::Ray ray;\n\t\tstd::queue<luxrays::RayBuffer *> todoRayBuffers;\n\t\tstd::vector<luxrays::RayBuffer *> rayBuffers;\n\t\tfor (size_t i = 0; i < RAYBUFFERS_COUNT; ++i) {\n\t\t\tluxrays::RayBuffer *rayBuffer = device->NewRayBuffer();\n\t\t\ttodoRayBuffers.push(rayBuffer);\n\t\t\trayBuffers.push_back(rayBuffer);\n\n\t\t\tfor (size_t j = 0; j < rayBuffer->GetSize(); ++j) {\n\t\t\t\tray.o = luxrays::Point(SPACE_SIZE * rnd.floatValue() - SPACE_SIZE \/ 2.f,\n\t\t\t\t\t\tSPACE_SIZE * rnd.floatValue() - SPACE_SIZE \/ 2.f,\n\t\t\t\t\t\tSPACE_SIZE * rnd.floatValue() - SPACE_SIZE \/ 2.f);\n\n\t\t\t\tdo {\n\t\t\t\t\tray.d = luxrays::Vector(rnd.floatValue(), rnd.floatValue(), rnd.floatValue());\n\t\t\t\t} while (ray.d == luxrays::Vector(0.f, 0.f, 0.f)); \/\/ Just in case ...\n\t\t\t\tray.d = luxrays::Normalize(ray.d);\n\n\t\t\t\tray.mint = luxrays::MachineEpsilon::E(ray.o);\n\t\t\t\tray.maxt = 1000.f;\n\n\t\t\t\trayBuffer->AddRay(ray);\n\t\t\t}\n\t\t}\n\n\t\t\/\/--------------------------------------------------------------------------\n\t\t\/\/ Run the serial benchmark. This simulate one single thread pushing\n\t\t\/\/ rays to trace.\n\t\t\/\/--------------------------------------------------------------------------\n\n\t\t{\n\t\t\t\/\/ The number of queues used\n\t\t\tdevice->SetQueueCount(1);\n\t\t\t\/\/ You have to set the max. number of buffers you can push between 2 pop.\n\t\t\tdevice->SetBufferCount(RAYBUFFERS_COUNT);\n\n\t\t\tctx->Start();\n\n\t\t\tstd::cerr << \"Running the serial benchmark for 15 seconds...\" << std::endl;\n\t\t\tdouble tStart = luxrays::WallClockTime();\n\t\t\tdouble tLastCheck = tStart;\n\t\t\tdouble bufferDone = 0.0;\n\t\t\tbool done = false;\n\t\t\twhile (!done) {\n\t\t\t\twhile (todoRayBuffers.size() > 0) {\n\t\t\t\t\tdevice->PushRayBuffer(todoRayBuffers.front());\n\t\t\t\t\ttodoRayBuffers.pop();\n\t\n\t\t\t\t\t\/\/ Check if it is time to stop\n\t\t\t\t\tconst double tNow = luxrays::WallClockTime();\n\t\t\t\t\tif (tNow - tLastCheck > 1.0) {\n\t\t\t\t\t\tif (tNow - tStart > 15.0) {\n\t\t\t\t\t\t\tdone = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\n\t\t\t\t\t\tstd::cerr << int(tNow - tStart) << \"\/15secs\" << std::endl;\n\t\t\t\t\t\ttLastCheck = tNow;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\n\t\t\t\ttodoRayBuffers.push(device->PopRayBuffer());\n\t\t\t\tbufferDone += 1.0;\n\t\t\t}\n\t\n\t\t\twhile (todoRayBuffers.size() != RAYBUFFERS_COUNT) {\n\t\t\t\ttodoRayBuffers.push(device->PopRayBuffer());\n\t\t\t\tbufferDone += 1.0;\n\t\t\t}\n\t\t\tdouble tStop = luxrays::WallClockTime();\n\t\t\tdouble tTime = tStop - tStart;\n\t\n\t\t\tctx->Stop();\n\n\t\t\tstd::cerr << \"Test total time: \" << tTime << std::endl;\n\t\t\tstd::cerr << \"Test total ray buffer count: \" << int(bufferDone) << std::endl;\n\t\t\tstd::cerr << \"Test ray buffer size: \" << todoRayBuffers.front()->GetRayCount() << std::endl;\n\t\t\tdouble raySec = (bufferDone * todoRayBuffers.front()->GetRayCount()) \/ tTime;\n\t\t\tif (raySec < 10000.0)\n\t\t\t\tstd::cerr << \"Test performance: \" << std::setiosflags(std::ios::fixed) << std::setprecision(2) <<\n\t\t\t\t\t\traySec <<\" rays\/sec\" << std::endl;\n\t\t\telse if (raySec < 1000000.0)\n\t\t\t\tstd::cerr << \"Test performance: \" << std::setiosflags(std::ios::fixed) << std::setprecision(2) <<\n\t\t\t\t\t\t(raySec \/ 1000.0) <<\"K rays\/sec\" << std::endl;\n\t\t\telse\n\t\t\t\tstd::cerr << \"Test performance: \" << std::setiosflags(std::ios::fixed) << std::setprecision(2) <<\n\t\t\t\t\t\t(raySec \/ 1000000.0) <<\"M rays\/sec\" << std::endl;\n\t\t}\n\n\t\t\/\/--------------------------------------------------------------------------\n\t\t\/\/ Run the parallel benchmark. This simulate multiple threads pushing\n\t\t\/\/ rays to trace.\n\t\t\/\/--------------------------------------------------------------------------\n\n\t\t{\n\t\t\t\/\/ The number of queues used\n\t\t\tdevice->SetQueueCount(RAYBUFFERS_COUNT);\n\t\t\t\/\/ You have to set the max. number of buffers you can push between 2 pop.\n\t\t\tdevice->SetBufferCount(1);\n\n\t\t\tctx->Start();\n\n\t\t\tstd::cerr << \"Running the parallel benchmark for 15 seconds...\" << std::endl;\n\t\t\tdouble tStart = luxrays::WallClockTime();\n\n\t\t\tfor (u_int i = 0; i < RAYBUFFERS_COUNT; ++i)\n\t\t\t\tdevice->PushRayBuffer(rayBuffers[i], i);\n\n\t\t\tdouble tLastCheck = tStart;\n\t\t\tdouble bufferDone = 0.0;\n\t\t\tbool done = false;\n\t\t\tu_int queueIndex = 0;\n\t\t\twhile (!done) {\n\t\t\t\tdevice->PopRayBuffer(queueIndex);\n\t\t\t\tbufferDone += 1.0;\n\t\n\t\t\t\tdevice->PushRayBuffer(rayBuffers[queueIndex], queueIndex);\n\t\n\t\t\t\t\/\/ Check if it is time to stop\n\t\t\t\tconst double tNow = luxrays::WallClockTime();\n\t\t\t\tif (tNow - tLastCheck > 1.0) {\n\t\t\t\t\tif (tNow - tStart > 15.0) {\n\t\t\t\t\t\tdone = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\n\t\t\t\t\tstd::cerr << int(tNow - tStart) << \"\/15secs\" << std::endl;\n\t\t\t\t\ttLastCheck = tNow;\n\t\t\t\t}\n\t\n\t\t\t\tqueueIndex = (queueIndex + 1) % RAYBUFFERS_COUNT;\n\t\t\t}\n\n\t\t\tfor (u_int i = 0; i < RAYBUFFERS_COUNT; ++i)\n\t\t\t\tdevice->PopRayBuffer(i);\n\t\t\tbufferDone += RAYBUFFERS_COUNT;\n\n\t\t\tdouble tStop = luxrays::WallClockTime();\n\t\t\tdouble tTime = tStop - tStart;\n\n\t\t\tctx->Stop();\n\n\t\t\tstd::cerr << \"Test total time: \" << tTime << std::endl;\n\t\t\tstd::cerr << \"Test total ray buffer count: \" << int(bufferDone) << std::endl;\n\t\t\tstd::cerr << \"Test ray buffer size: \" << todoRayBuffers.front()->GetRayCount() << std::endl;\n\t\t\tdouble raySec = (bufferDone * todoRayBuffers.front()->GetRayCount()) \/ tTime;\n\t\t\tif (raySec < 10000.0)\n\t\t\t\tstd::cerr << \"Test performance: \" << std::setiosflags(std::ios::fixed) << std::setprecision(2) <<\n\t\t\t\t\t\traySec <<\" rays\/sec\" << std::endl;\n\t\t\telse if (raySec < 1000000.0)\n\t\t\t\tstd::cerr << \"Test performance: \" << std::setiosflags(std::ios::fixed) << std::setprecision(2) <<\n\t\t\t\t\t\t(raySec \/ 1000.0) <<\"K rays\/sec\" << std::endl;\n\t\t\telse\n\t\t\t\tstd::cerr << \"Test performance: \" << std::setiosflags(std::ios::fixed) << std::setprecision(2) <<\n\t\t\t\t\t\t(raySec \/ 1000000.0) <<\"M rays\/sec\" << std::endl;\n\t\t}\n\n\t\t\/\/--------------------------------------------------------------------------\n\t\t\/\/ Free everything\n\t\t\/\/--------------------------------------------------------------------------\n\n\t\twhile (todoRayBuffers.size() > 0) {\n\t\t\tdelete todoRayBuffers.front();\n\t\t\ttodoRayBuffers.pop();\n\t\t}\n\n\t\tdelete ctx;\n\t\tdelete dataSet;\n\t\tmesh->Delete();\n\t\tdelete mesh;\n\n\t\tstd::cerr << \"Done.\" << std::endl;\n#if !defined(LUXRAYS_DISABLE_OPENCL)\n\t} catch (cl::Error err) {\n\t\tstd::cout << \"OpenCL ERROR: \" << err.what() << \"(\" << luxrays::oclErrorString(err.err()) << \")\" << std::endl;\n\t\treturn EXIT_FAILURE;\n#endif\n\t} catch (std::runtime_error err) {\n\t\tstd::cout << \"RUNTIME ERROR: \" << err.what() << std::endl;\n\t\treturn EXIT_FAILURE;\n\t} catch (std::exception err) {\n\t\tstd::cout << \"ERROR: \" << err.what() << std::endl;\n\t\treturn EXIT_FAILURE;\n\t}\n\n\treturn EXIT_SUCCESS;\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 \"xeextlst.hxx\"\n#include \"xeroot.hxx\"\n#include \"xehelper.hxx\"\n#include \"xestyle.hxx\"\n#include \"xename.hxx\"\n#include \"xecontent.hxx\"\n#include \"tokenarray.hxx\"\n#include <oox\/export\/utils.hxx>\n\nusing namespace ::oox;\n\nXclExpExt::XclExpExt( const XclExpRoot& rRoot ):\n    XclExpRoot(rRoot)\n{\n}\n\nXclExtLst::XclExtLst( const XclExpRoot& rRoot ):\n    XclExpRoot(rRoot)\n{\n}\n\nXclExpExtNegativeColor::XclExpExtNegativeColor( const Color& rColor ):\n    maColor(rColor)\n{\n}\n\nvoid XclExpExtNegativeColor::SaveXml( XclExpXmlStream& rStrm )\n{\n    rStrm.GetCurrentStream()->singleElementNS( XML_x14, XML_negativeFillColor,\n                                                XML_rgb, XclXmlUtils::ToOString( maColor ).getStr(),\n                                                FSEND );\n}\n\nXclExpExtAxisColor::XclExpExtAxisColor( const Color& rColor ):\n    maAxisColor(rColor)\n{\n}\n\nvoid XclExpExtAxisColor::SaveXml( XclExpXmlStream& rStrm )\n{\n    rStrm.GetCurrentStream()->singleElementNS( XML_x14, XML_axisColor,\n                                                XML_rgb, XclXmlUtils::ToOString( maAxisColor ).getStr(),\n                                                FSEND );\n}\n\nXclExpExtCfvo::XclExpExtCfvo( const XclExpRoot& rRoot, const ScColorScaleEntry& rEntry, const ScAddress& rSrcPos, bool bFirst ):\n    XclExpRoot(rRoot),\n    meType(rEntry.GetType()),\n    mbFirst(bFirst)\n{\n    if( rEntry.GetType() == COLORSCALE_FORMULA )\n    {\n        const ScTokenArray* pArr = rEntry.GetFormula();\n        OUString aFormula;\n        if(pArr)\n        {\n            aFormula = XclXmlUtils::ToOUString( GetCompileFormulaContext(), rSrcPos,\n                    pArr->Clone());\n        }\n        maValue = OUStringToOString(aFormula, RTL_TEXTENCODING_UTF8 );\n    }\n    else\n        maValue = OString::number(rEntry.GetValue());\n}\n\nnamespace {\n\nconst char* getColorScaleType( ScColorScaleEntryType eType, bool bFirst )\n{\n    switch(eType)\n    {\n        case COLORSCALE_MIN:\n            return \"min\";\n        case COLORSCALE_MAX:\n            return \"max\";\n        case COLORSCALE_PERCENT:\n            return \"percent\";\n        case COLORSCALE_FORMULA:\n            return \"formula\";\n        case COLORSCALE_AUTO:\n            if(bFirst)\n                return \"autoMin\";\n            else\n                return \"autoMax\";\n        case COLORSCALE_PERCENTILE:\n            return \"percentile\";\n        default:\n            break;\n    }\n    return \"num\";\n}\n\n}\n\nvoid XclExpExtCfvo::SaveXml( XclExpXmlStream& rStrm )\n{\n    sax_fastparser::FSHelperPtr& rWorksheet = rStrm.GetCurrentStream();\n    rWorksheet->singleElementNS( XML_x14, XML_cfvo,\n                                XML_type, getColorScaleType(meType, mbFirst),\n                                XML_value, maValue.getStr(),\n                                FSEND );\n}\n\nXclExpExtDataBar::XclExpExtDataBar( const XclExpRoot& rRoot, const ScDataBarFormat& rFormat, const ScAddress& rPos ):\n    XclExpRoot(rRoot)\n{\n    const ScDataBarFormatData& rFormatData = *rFormat.GetDataBarData();\n    mpLowerLimit.reset( new XclExpExtCfvo( *this, *rFormatData.mpLowerLimit.get(), rPos, true ) );\n    mpUpperLimit.reset( new XclExpExtCfvo( *this, *rFormatData.mpUpperLimit.get(), rPos, false ) );\n    if(rFormatData.mpNegativeColor.get())\n        mpNegativeColor.reset( new XclExpExtNegativeColor( *rFormatData.mpNegativeColor.get() ) );\n    else\n        mpNegativeColor.reset( new XclExpExtNegativeColor( rFormatData.maPositiveColor ) );\n    mpAxisColor.reset( new XclExpExtAxisColor( rFormatData.maAxisColor ) );\n\n    meAxisPosition = rFormatData.meAxisPosition;\n    mbGradient = rFormatData.mbGradient;\n}\n\nnamespace {\n\nconst char* getAxisPosition(databar::ScAxisPosition eAxisPosition)\n{\n    switch(eAxisPosition)\n    {\n        case databar::NONE:\n            return \"none\";\n        case databar::AUTOMATIC:\n            return \"automatic\";\n        case databar::MIDDLE:\n            return \"middle\";\n    }\n    return \"\";\n}\n\n}\n\nvoid XclExpExtDataBar::SaveXml( XclExpXmlStream& rStrm )\n{\n    sax_fastparser::FSHelperPtr& rWorksheet = rStrm.GetCurrentStream();\n    rWorksheet->startElementNS( XML_x14, XML_dataBar,\n                                XML_minLength, OString::number(0).getStr(),\n                                XML_maxLength, OString::number(100).getStr(),\n                                XML_axisPosition, getAxisPosition(meAxisPosition),\n                                XML_gradient, BS(mbGradient),\n                                FSEND );\n\n    mpLowerLimit->SaveXml( rStrm );\n    mpUpperLimit->SaveXml( rStrm );\n    mpNegativeColor->SaveXml( rStrm );\n    mpAxisColor->SaveXml( rStrm );\n\n    rWorksheet->endElementNS( XML_x14, XML_dataBar );\n}\n\nXclExpExtCfRule::XclExpExtCfRule( const XclExpRoot& rRoot, const ScDataBarFormat& rFormat, const ScAddress& rPos, const OString& rId ):\n    XclExpRoot(rRoot),\n    maId(rId)\n{\n    maDataBar.reset( new XclExpExtDataBar( *this, rFormat, rPos ) );\n}\n\nvoid XclExpExtCfRule::SaveXml( XclExpXmlStream& rStrm )\n{\n    sax_fastparser::FSHelperPtr& rWorksheet = rStrm.GetCurrentStream();\n    rWorksheet->startElementNS( XML_x14, XML_cfRule,\n                                XML_type, \"dataBar\",\n                                XML_id, maId.getStr(),\n                                FSEND );\n\n    maDataBar->SaveXml( rStrm );\n\n    rWorksheet->endElementNS( XML_x14, XML_cfRule );\n\n}\n\nXclExpExtConditionalFormatting::XclExpExtConditionalFormatting( const XclExpRoot& rRoot, const ScDataBarFormat& rFormat, const ScAddress& rPos, const OString& rId ):\n    XclExpRoot(rRoot)\n{\n    maCfRule.reset( new XclExpExtCfRule( *this, rFormat, rPos, rId ) );\n    maRange = rFormat.GetRange();\n}\n\nvoid XclExpExtConditionalFormatting::SaveXml( XclExpXmlStream& rStrm )\n{\n    sax_fastparser::FSHelperPtr& rWorksheet = rStrm.GetCurrentStream();\n    rWorksheet->startElementNS( XML_x14, XML_conditionalFormatting,\n                                FSNS( XML_xmlns, XML_xm ), \"http:\/\/schemas.microsoft.com\/office\/excel\/2006\/main\",\n                                FSEND );\n\n    maCfRule->SaveXml( rStrm );\n    rWorksheet->startElementNS( XML_xm, XML_sqref, FSEND );\n    rWorksheet->write(XclXmlUtils::ToOString(maRange).getStr());\n\n    rWorksheet->endElementNS( XML_xm, XML_sqref );\n\n    rWorksheet->endElementNS( XML_x14, XML_conditionalFormatting );\n}\n\nXclExpExtCondFormat::XclExpExtCondFormat( const XclExpRoot& rRoot ):\n    XclExpExt( rRoot )\n{\n    maURI = OString(\"{78C0D931-6437-407d-A8EE-F0AAD7539E65}\");\n}\n\nvoid XclExpExtCondFormat::SaveXml( XclExpXmlStream& rStrm )\n{\n    sax_fastparser::FSHelperPtr& rWorksheet = rStrm.GetCurrentStream();\n    rWorksheet->startElement( XML_ext,\n                                FSNS( XML_xmlns, XML_x14 ), \"http:\/\/schemas.microsoft.com\/office\/spreadsheetml\/2009\/9\/main\",\n                                XML_uri, maURI.getStr(),\n                                FSEND );\n\n    rWorksheet->startElementNS( XML_x14, XML_conditionalFormattings,\n                                FSEND );\n\n    maCF.SaveXml( rStrm );\n\n    rWorksheet->endElementNS( XML_x14, XML_conditionalFormattings );\n    rWorksheet->endElement( XML_ext );\n}\n\nvoid XclExpExtCondFormat::AddRecord( XclExpExtConditionalFormattingRef aEntry )\n{\n    maCF.AppendRecord( aEntry );\n}\n\nvoid XclExtLst::SaveXml( XclExpXmlStream& rStrm )\n{\n    if(maExtEntries.IsEmpty())\n        return;\n\n    sax_fastparser::FSHelperPtr& rWorksheet = rStrm.GetCurrentStream();\n    rWorksheet->startElement( XML_extLst,\n                                FSEND );\n\n    maExtEntries.SaveXml(rStrm);\n\n    rWorksheet->endElement( XML_extLst );\n}\n\nvoid XclExtLst::AddRecord( XclExpExtRef aEntry )\n{\n    maExtEntries.AppendRecord( aEntry );\n}\n\nXclExpExtRef XclExtLst::GetItem( XclExpExtType eType )\n{\n    size_t n = maExtEntries.GetSize();\n    for( size_t i = 0; i < n; ++i )\n    {\n        if (maExtEntries.GetRecord( i )->GetType() == eType)\n            return maExtEntries.GetRecord( i );\n    }\n\n    return XclExpExtRef();\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>Seems that BS() does something else than I thought<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 \"xeextlst.hxx\"\n#include \"xeroot.hxx\"\n#include \"xehelper.hxx\"\n#include \"xestyle.hxx\"\n#include \"xename.hxx\"\n#include \"xecontent.hxx\"\n#include \"tokenarray.hxx\"\n\nusing namespace ::oox;\n\nXclExpExt::XclExpExt( const XclExpRoot& rRoot ):\n    XclExpRoot(rRoot)\n{\n}\n\nXclExtLst::XclExtLst( const XclExpRoot& rRoot ):\n    XclExpRoot(rRoot)\n{\n}\n\nXclExpExtNegativeColor::XclExpExtNegativeColor( const Color& rColor ):\n    maColor(rColor)\n{\n}\n\nvoid XclExpExtNegativeColor::SaveXml( XclExpXmlStream& rStrm )\n{\n    rStrm.GetCurrentStream()->singleElementNS( XML_x14, XML_negativeFillColor,\n                                                XML_rgb, XclXmlUtils::ToOString( maColor ).getStr(),\n                                                FSEND );\n}\n\nXclExpExtAxisColor::XclExpExtAxisColor( const Color& rColor ):\n    maAxisColor(rColor)\n{\n}\n\nvoid XclExpExtAxisColor::SaveXml( XclExpXmlStream& rStrm )\n{\n    rStrm.GetCurrentStream()->singleElementNS( XML_x14, XML_axisColor,\n                                                XML_rgb, XclXmlUtils::ToOString( maAxisColor ).getStr(),\n                                                FSEND );\n}\n\nXclExpExtCfvo::XclExpExtCfvo( const XclExpRoot& rRoot, const ScColorScaleEntry& rEntry, const ScAddress& rSrcPos, bool bFirst ):\n    XclExpRoot(rRoot),\n    meType(rEntry.GetType()),\n    mbFirst(bFirst)\n{\n    if( rEntry.GetType() == COLORSCALE_FORMULA )\n    {\n        const ScTokenArray* pArr = rEntry.GetFormula();\n        OUString aFormula;\n        if(pArr)\n        {\n            aFormula = XclXmlUtils::ToOUString( GetCompileFormulaContext(), rSrcPos,\n                    pArr->Clone());\n        }\n        maValue = OUStringToOString(aFormula, RTL_TEXTENCODING_UTF8 );\n    }\n    else\n        maValue = OString::number(rEntry.GetValue());\n}\n\nnamespace {\n\nconst char* getColorScaleType( ScColorScaleEntryType eType, bool bFirst )\n{\n    switch(eType)\n    {\n        case COLORSCALE_MIN:\n            return \"min\";\n        case COLORSCALE_MAX:\n            return \"max\";\n        case COLORSCALE_PERCENT:\n            return \"percent\";\n        case COLORSCALE_FORMULA:\n            return \"formula\";\n        case COLORSCALE_AUTO:\n            if(bFirst)\n                return \"autoMin\";\n            else\n                return \"autoMax\";\n        case COLORSCALE_PERCENTILE:\n            return \"percentile\";\n        default:\n            break;\n    }\n    return \"num\";\n}\n\n}\n\nvoid XclExpExtCfvo::SaveXml( XclExpXmlStream& rStrm )\n{\n    sax_fastparser::FSHelperPtr& rWorksheet = rStrm.GetCurrentStream();\n    rWorksheet->singleElementNS( XML_x14, XML_cfvo,\n                                XML_type, getColorScaleType(meType, mbFirst),\n                                XML_value, maValue.getStr(),\n                                FSEND );\n}\n\nXclExpExtDataBar::XclExpExtDataBar( const XclExpRoot& rRoot, const ScDataBarFormat& rFormat, const ScAddress& rPos ):\n    XclExpRoot(rRoot)\n{\n    const ScDataBarFormatData& rFormatData = *rFormat.GetDataBarData();\n    mpLowerLimit.reset( new XclExpExtCfvo( *this, *rFormatData.mpLowerLimit.get(), rPos, true ) );\n    mpUpperLimit.reset( new XclExpExtCfvo( *this, *rFormatData.mpUpperLimit.get(), rPos, false ) );\n    if(rFormatData.mpNegativeColor.get())\n        mpNegativeColor.reset( new XclExpExtNegativeColor( *rFormatData.mpNegativeColor.get() ) );\n    else\n        mpNegativeColor.reset( new XclExpExtNegativeColor( rFormatData.maPositiveColor ) );\n    mpAxisColor.reset( new XclExpExtAxisColor( rFormatData.maAxisColor ) );\n\n    meAxisPosition = rFormatData.meAxisPosition;\n    mbGradient = rFormatData.mbGradient;\n}\n\nnamespace {\n\nconst char* getAxisPosition(databar::ScAxisPosition eAxisPosition)\n{\n    switch(eAxisPosition)\n    {\n        case databar::NONE:\n            return \"none\";\n        case databar::AUTOMATIC:\n            return \"automatic\";\n        case databar::MIDDLE:\n            return \"middle\";\n    }\n    return \"\";\n}\n\n}\n\nvoid XclExpExtDataBar::SaveXml( XclExpXmlStream& rStrm )\n{\n    sax_fastparser::FSHelperPtr& rWorksheet = rStrm.GetCurrentStream();\n    rWorksheet->startElementNS( XML_x14, XML_dataBar,\n                                XML_minLength, OString::number(0).getStr(),\n                                XML_maxLength, OString::number(100).getStr(),\n                                XML_axisPosition, getAxisPosition(meAxisPosition),\n                                XML_gradient, XclXmlUtils::ToPsz(mbGradient),\n                                FSEND );\n\n    mpLowerLimit->SaveXml( rStrm );\n    mpUpperLimit->SaveXml( rStrm );\n    mpNegativeColor->SaveXml( rStrm );\n    mpAxisColor->SaveXml( rStrm );\n\n    rWorksheet->endElementNS( XML_x14, XML_dataBar );\n}\n\nXclExpExtCfRule::XclExpExtCfRule( const XclExpRoot& rRoot, const ScDataBarFormat& rFormat, const ScAddress& rPos, const OString& rId ):\n    XclExpRoot(rRoot),\n    maId(rId)\n{\n    maDataBar.reset( new XclExpExtDataBar( *this, rFormat, rPos ) );\n}\n\nvoid XclExpExtCfRule::SaveXml( XclExpXmlStream& rStrm )\n{\n    sax_fastparser::FSHelperPtr& rWorksheet = rStrm.GetCurrentStream();\n    rWorksheet->startElementNS( XML_x14, XML_cfRule,\n                                XML_type, \"dataBar\",\n                                XML_id, maId.getStr(),\n                                FSEND );\n\n    maDataBar->SaveXml( rStrm );\n\n    rWorksheet->endElementNS( XML_x14, XML_cfRule );\n\n}\n\nXclExpExtConditionalFormatting::XclExpExtConditionalFormatting( const XclExpRoot& rRoot, const ScDataBarFormat& rFormat, const ScAddress& rPos, const OString& rId ):\n    XclExpRoot(rRoot)\n{\n    maCfRule.reset( new XclExpExtCfRule( *this, rFormat, rPos, rId ) );\n    maRange = rFormat.GetRange();\n}\n\nvoid XclExpExtConditionalFormatting::SaveXml( XclExpXmlStream& rStrm )\n{\n    sax_fastparser::FSHelperPtr& rWorksheet = rStrm.GetCurrentStream();\n    rWorksheet->startElementNS( XML_x14, XML_conditionalFormatting,\n                                FSNS( XML_xmlns, XML_xm ), \"http:\/\/schemas.microsoft.com\/office\/excel\/2006\/main\",\n                                FSEND );\n\n    maCfRule->SaveXml( rStrm );\n    rWorksheet->startElementNS( XML_xm, XML_sqref, FSEND );\n    rWorksheet->write(XclXmlUtils::ToOString(maRange).getStr());\n\n    rWorksheet->endElementNS( XML_xm, XML_sqref );\n\n    rWorksheet->endElementNS( XML_x14, XML_conditionalFormatting );\n}\n\nXclExpExtCondFormat::XclExpExtCondFormat( const XclExpRoot& rRoot ):\n    XclExpExt( rRoot )\n{\n    maURI = OString(\"{78C0D931-6437-407d-A8EE-F0AAD7539E65}\");\n}\n\nvoid XclExpExtCondFormat::SaveXml( XclExpXmlStream& rStrm )\n{\n    sax_fastparser::FSHelperPtr& rWorksheet = rStrm.GetCurrentStream();\n    rWorksheet->startElement( XML_ext,\n                                FSNS( XML_xmlns, XML_x14 ), \"http:\/\/schemas.microsoft.com\/office\/spreadsheetml\/2009\/9\/main\",\n                                XML_uri, maURI.getStr(),\n                                FSEND );\n\n    rWorksheet->startElementNS( XML_x14, XML_conditionalFormattings,\n                                FSEND );\n\n    maCF.SaveXml( rStrm );\n\n    rWorksheet->endElementNS( XML_x14, XML_conditionalFormattings );\n    rWorksheet->endElement( XML_ext );\n}\n\nvoid XclExpExtCondFormat::AddRecord( XclExpExtConditionalFormattingRef aEntry )\n{\n    maCF.AppendRecord( aEntry );\n}\n\nvoid XclExtLst::SaveXml( XclExpXmlStream& rStrm )\n{\n    if(maExtEntries.IsEmpty())\n        return;\n\n    sax_fastparser::FSHelperPtr& rWorksheet = rStrm.GetCurrentStream();\n    rWorksheet->startElement( XML_extLst,\n                                FSEND );\n\n    maExtEntries.SaveXml(rStrm);\n\n    rWorksheet->endElement( XML_extLst );\n}\n\nvoid XclExtLst::AddRecord( XclExpExtRef aEntry )\n{\n    maExtEntries.AppendRecord( aEntry );\n}\n\nXclExpExtRef XclExtLst::GetItem( XclExpExtType eType )\n{\n    size_t n = maExtEntries.GetSize();\n    for( size_t i = 0; i < n; ++i )\n    {\n        if (maExtEntries.GetRecord( i )->GetType() == eType)\n            return maExtEntries.GetRecord( i );\n    }\n\n    return XclExpExtRef();\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: ToolBarManager.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: vg $ $Date: 2006-11-01 18:04: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#ifndef SD_TOOL_BAR_MANAGER_HXX\n#define SD_TOOL_BAR_MANAGER_HXX\n\n#include \"ViewShell.hxx\"\n#include \"ShellFactory.hxx\"\n#include <rtl\/ustring.hxx>\n\n#ifndef _COM_SUN_STAR_FRAME_XFRAME_HPP_\n#include <com\/sun\/star\/frame\/XFrame.hpp>\n#endif\n\n#include <sal\/types.h>\n#include <memory>\n\nclass SdrView;\n\nnamespace sd { namespace tools {\nclass EventMultiplexer;\n} }\n\n\nnamespace sd {\n\nclass PaneManager;\nclass ViewShellBase;\nclass ViewShellManager;\n\n\/** Manage the set of visible tool bars (and object bars).  Usually they\n    belong to the current view in the center pane.\n\n    Tool bars are managed in groups.  Each group can be set, reset, or\n    modified independently of the others.  This allows for instance to\n    replace the toolbars associated with the current function independently\n    from those assoicated with the main view.\n\n    The ToolBarManager has two high level methods which contain the\n    knowledge about which tool bars to show in a specific context.\n    When the view in the center pane changes then MainViewShellChanged()\n    sets up the tool bars for the new view.  On changes of the selection the\n    SelectionHasChanged() method shows the tool bars for the new context.\n\n    The update of the actually visible tool bars to the set currently\n    required by the main view shell and its functions is divided into two\n    parts, PreUpdate() and PostUpdate().  This are to be called before\n    respectively after the update of the view shell stack.  The reason for\n    this is to save time by not updating tool bars that will not be visible\n    in a short time on a view shell switch.\n*\/\nclass ToolBarManager\n{\npublic:\n    \/** Use this method instead of the constructor to create new objects of\n        this class.\n    *\/\n    static ::std::auto_ptr<ToolBarManager> Create (\n        ViewShellBase& rBase,\n        tools::EventMultiplexer& rMultiplexer,\n        PaneManager& rPaneManager,\n        ViewShellManager& rViewShellManager);\n\n    ~ToolBarManager (void);\n\n    \/** Call this method prior to the destructor to prevent the\n        ToolBarManager from accessing the ViewShellManager or the\n        XLayoutManager when those are possibly not well and alive anymore\n        (like during the destruction of the ViewShellBase.)\n    *\/\n    void Shutdown (void);\n\n    \/** When the view in the center pane changes then this method sets up\n        the initial set of tool bars for the new view.\n        The ToolBarManager listenes for view switching itself and then calls\n        MainViewShellChanged().  Calling this method from the outside should\n        not be necessary.\n        @param nShellType\n            The type of the new main view shell.\n    *\/\n    void MainViewShellChanged (ViewShell::ShellType nShellType);\n    void MainViewShellChanged (const ViewShell& rMainViewShell);\n\n    \/** Call this method when the selection has changed to update the more\n        temporary tool bars (those in the TBG_FUNCTION group.)\n    *\/\n    void SelectionHasChanged (\n        const ViewShell& rViewShell,\n        const SdrView& rView);\n\n    \/** The set of tool bars that are handled by this manager class.\n    *\/\n    const static ::rtl::OUString msToolBar;                  \/\/ RID_DRAW_TOOLBOX, 23011\n                                                             \/\/ RID_GRAPHIC_TOOLBOX, 23025\n    const static ::rtl::OUString msOptionsToolBar;           \/\/ RID_DRAW_OPTIONS_TOOLBOX, 23020\n                                                             \/\/ RID_GRAPHIC_OPTIONS_TOOLBOX, 23026\n    const static ::rtl::OUString msCommonTaskToolBar;        \/\/ RID_DRAW_COMMONTASK_TOOLBOX, 23021\n    const static ::rtl::OUString msViewerToolBar;            \/\/ RID_DRAW_VIEWER_TOOLBOX, 23023\n                                                             \/\/ RID_GRAPHIC_VIEWER_TOOLBOX, 23024\n    const static ::rtl::OUString msSlideSorterToolBar;       \/\/ RID_SLIDE_TOOLBOX, 23012\n    const static ::rtl::OUString msSlideSorterObjectBar;     \/\/ RID_SLIDE_OBJ_TOOLBOX, 23014\n    const static ::rtl::OUString msOutlineToolBar;           \/\/ RID_OUTLINE_TOOLBOX, 23017\n    const static ::rtl::OUString msMasterViewToolBar;        \/\/ SID_MASTERPAGE, 27053\n    const static ::rtl::OUString msDrawingObjectToolBar;     \/\/ RID_DRAW_OBJ_TOOLBOX, 23013\n    const static ::rtl::OUString msGluePointsToolBar;        \/\/ RID_GLUEPOINTS_TOOLBOX, 23019\n    const static ::rtl::OUString msTextObjectBar;            \/\/ RID_DRAW_TEXT_TOOLBOX, 23016\n                                                             \/\/ RID_GRAPHIC_TEXT_TOOLBOX, 23028\n    const static ::rtl::OUString msBezierObjectBar;          \/\/ RID_BEZIER_TOOLBOX, 23015\n    const static ::rtl::OUString msGraphicObjectBar;         \/\/ RID_DRAW_GRAF_TOOLBOX, 23030\n    const static ::rtl::OUString msMediaObjectBar;           \/\/ RID_DRAW_MEDIA_TOOLBOX, 23031\n\n    \/** The set of tool bar groups.\n    *\/\n    enum ToolBarGroup {\n        TBG__FIRST,\n\n        TBG_PERMANENT = TBG__FIRST,\n        TBG_FUNCTION,\n        TBG_MASTER_MODE,\n\n        TBG__LAST = TBG_MASTER_MODE\n    };\n\n    \/** Only after calls with bValid=<TRUE\/> may the tool bar manager use\n        the frame::XLayoutManager to change the visible tool bars.  Call\n        this method when the controller is attached to or detachted from the\n        frame.  When called with <FALSE\/> then ResetAllToolBars() is\n        executed.\n    *\/\n    void SetValid (bool bValid);\n\n    \/** Reset the set of visible object bars in the specified group.  Tool\n        bars in other groups are not affected.\n        @param rParentShell\n            When this shell is not the main view then the method returns\n            immediately.\n        @param eGroup\n            Only the tool bars in this group are rest.\n    *\/\n    void ResetToolBars (ToolBarGroup eGroup);\n\n    \/** Reset all tool bars, regardless of the group they belong to.\n        @param rParentShell\n            When this shell is not the main view then the method returns\n            immediately.\n    *\/\n    void ResetAllToolBars (void);\n\n    \/** Add the tool bar with the given name to the specified group of tool\n        bars.\n        @param rParentShell\n            When this shell is not the main view then the method returns\n            immediately.\n        @param eGroup\n            The new tool bar is added to this group.\n        @param rsToolBarName\n            The base name of the tool bar.  A proper prefix (like\n            private:resource\/toolbar\/) is added.  The name may be one of the\n            ones defined above.  Other names are allowed as well.\n    *\/\n    void AddToolBar (\n        ToolBarGroup eGroup,\n        const ::rtl::OUString& rsToolBarName);\n\n    \/** Add the tool bar shell to the shell stack.  This method basically\n        forwards the call to the ViewShellManager.\n        For some tool bar shells additional tool bars are made visible.\n        @param rParentShell\n            When this shell is not the main view then the method returns\n            immediately.\n        @param eGroup\n            The group is used for the actual tool bars.\n        @param nToolBarId\n            Id of the tool bar shell.\n    *\/\n    void AddToolBarShell (\n        ToolBarGroup eGroup,\n        ShellId nToolBarId);\n\n    \/** Remove the tool bar with the given name from the specified group.\n        If the tool bar is not visible then nothing happens.\n        If the tool bar is a member of another group then nothing happens\n        either.\n    *\/\n    void RemoveToolBar (\n        ToolBarGroup eGroup,\n        const ::rtl::OUString& rsToolBarName);\n\n    void RemoveToolBarShell (\n        ToolBarGroup eGroup,\n        ShellId nToolBarId);\n\n    \/** This is basically a shortcut for ResetToolBars(),AddToolBar().  The\n        main difference is, that all sub shells of the specified parent\n        shell are deactivated as well.\n        @param rParentShell\n            When this shell is not the main view then the method returns\n            immediately.\n        @param eGroup\n            The new tool bar is added to this group.\n        @param rsToolBarName\n            The base name of the tool bar.  A proper prefix (like\n            private:resource\/toolbar\/) is added.  The name may be one of the\n            ones defined above.  Other names are allowed as well.\n    *\/\n    void SetToolBar (\n        ToolBarGroup eGroup,\n        const ::rtl::OUString& rsToolBarName);\n\n    \/** This is basically a shortcut for ResetToolBars(),AddToolBar().  The\n        main difference is, that all sub shells of the specified parent\n        shell are deactivated as well.\n        @param rParentShell\n            When this shell is not the main view then the method returns\n            immediately.\n        @param rParentShell\n            When this shell is not the main view then the method returns\n            immediately.\n        @param eGroup\n            The group is currently not used.\n        @param nToolBarId\n            Id of the tool bar shell.\n    *\/\n    void SetToolBarShell (\n        ToolBarGroup eGroup,\n        ShellId nToolBarId);\n\n    void PreUpdate (void);\n    \/\/    void PostUpdate (void);\n\n    void Update (void);\n\n    \/** This is a hint for the ToolBarManager to improve the performance\n        when it updates its tool bars when its own lock is released.  Taking\n        control of the release of the update lock of the ViewShellManager\n        avoids some shell stack modifications and tool bar updates.\n    *\/\n    void LockViewShellManager (void);\n\n    \/** Use this class to prevent the visible tool bars from being updated\n        (and thus causing repaints and GUI rearrangements) when several tool\n        bar operations are made in a row.\n    *\/\n    class UpdateLock { public:\n        UpdateLock(ToolBarManager& rManager) : mrManager(rManager) { mrManager.LockUpdate(); }\n        ~UpdateLock(void) { mrManager.UnlockUpdate(); }\n    private:\n        ToolBarManager& mrManager;\n    };\n    friend class UpdateLock;\n\n    \/** Return whether updates of tool bars are locked.\n    *\/\n    bool IsUpdateLocked (void) const;\n\n    void ToolBarsDestroyed(void);\n\nprivate:\n    class Implementation;\n    ::std::auto_ptr<Implementation> mpImpl;\n\n    \/** The ViewShellBase is used to get the XLayoutManager and to determine\n        the plug in mode.\n    *\/\n    ToolBarManager (void);\n\n    void LockUpdate (void);\n    void UnlockUpdate (void);\n};\n\n} \/\/ end of namespace sd\n\n#endif\n<commit_msg>INTEGRATION: CWS components1 (1.2.98); FILE MERGED 2007\/02\/16 14:04:00 af 1.2.98.3: #i68075# Renamed Update() to RequestUpdate(). 2006\/11\/21 09:38:21 af 1.2.98.2: RESYNC: (1.2-1.3); FILE MERGED 2006\/08\/22 11:29:57 af 1.2.98.1: #i68075# Transition to new drawing framework.<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: ToolBarManager.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: rt $ $Date: 2007-04-03 16:07:49 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n#ifndef SD_TOOL_BAR_MANAGER_HXX\n#define SD_TOOL_BAR_MANAGER_HXX\n\n#include \"ViewShell.hxx\"\n#include \"ShellFactory.hxx\"\n#include <rtl\/ustring.hxx>\n\n#ifndef _COM_SUN_STAR_FRAME_XFRAME_HPP_\n#include <com\/sun\/star\/frame\/XFrame.hpp>\n#endif\n\n#include <sal\/types.h>\n#include <memory>\n\nclass SdrView;\n\nnamespace sd { namespace tools {\nclass EventMultiplexer;\n} }\n\n\nnamespace sd {\n\nclass ViewShellBase;\nclass ViewShellManager;\n\n\/** Manage the set of visible tool bars (and object bars).  Usually they\n    belong to the current view in the center pane.\n\n    Tool bars are managed in groups.  Each group can be set, reset, or\n    modified independently of the others.  This allows for instance to\n    replace the toolbars associated with the current function independently\n    from those assoicated with the main view.\n\n    The ToolBarManager has two high level methods which contain the\n    knowledge about which tool bars to show in a specific context.\n    When the view in the center pane changes then MainViewShellChanged()\n    sets up the tool bars for the new view.  On changes of the selection the\n    SelectionHasChanged() method shows the tool bars for the new context.\n\n    The update of the actually visible tool bars to the set currently\n    required by the main view shell and its functions is divided into two\n    parts, PreUpdate() and PostUpdate().  This are to be called before\n    respectively after the update of the view shell stack.  The reason for\n    this is to save time by not updating tool bars that will not be visible\n    in a short time on a view shell switch.\n*\/\nclass ToolBarManager\n{\npublic:\n    \/** Use this method instead of the constructor to create new objects of\n        this class.\n    *\/\n    static ::std::auto_ptr<ToolBarManager> Create (\n        ViewShellBase& rBase,\n        tools::EventMultiplexer& rMultiplexer,\n        ViewShellManager& rViewShellManager);\n\n    ~ToolBarManager (void);\n\n    \/** Call this method prior to the destructor to prevent the\n        ToolBarManager from accessing the ViewShellManager or the\n        XLayoutManager when those are possibly not well and alive anymore\n        (like during the destruction of the ViewShellBase.)\n    *\/\n    void Shutdown (void);\n\n    \/** When the view in the center pane changes then this method sets up\n        the initial set of tool bars for the new view.\n        The ToolBarManager listenes for view switching itself and then calls\n        MainViewShellChanged().  Calling this method from the outside should\n        not be necessary.\n        @param nShellType\n            The type of the new main view shell.\n    *\/\n    void MainViewShellChanged (ViewShell::ShellType nShellType);\n    void MainViewShellChanged (const ViewShell& rMainViewShell);\n\n    \/** Call this method when the selection has changed to update the more\n        temporary tool bars (those in the TBG_FUNCTION group.)\n    *\/\n    void SelectionHasChanged (\n        const ViewShell& rViewShell,\n        const SdrView& rView);\n\n    \/** The set of tool bars that are handled by this manager class.\n    *\/\n    const static ::rtl::OUString msToolBar;                  \/\/ RID_DRAW_TOOLBOX, 23011\n                                                             \/\/ RID_GRAPHIC_TOOLBOX, 23025\n    const static ::rtl::OUString msOptionsToolBar;           \/\/ RID_DRAW_OPTIONS_TOOLBOX, 23020\n                                                             \/\/ RID_GRAPHIC_OPTIONS_TOOLBOX, 23026\n    const static ::rtl::OUString msCommonTaskToolBar;        \/\/ RID_DRAW_COMMONTASK_TOOLBOX, 23021\n    const static ::rtl::OUString msViewerToolBar;            \/\/ RID_DRAW_VIEWER_TOOLBOX, 23023\n                                                             \/\/ RID_GRAPHIC_VIEWER_TOOLBOX, 23024\n    const static ::rtl::OUString msSlideSorterToolBar;       \/\/ RID_SLIDE_TOOLBOX, 23012\n    const static ::rtl::OUString msSlideSorterObjectBar;     \/\/ RID_SLIDE_OBJ_TOOLBOX, 23014\n    const static ::rtl::OUString msOutlineToolBar;           \/\/ RID_OUTLINE_TOOLBOX, 23017\n    const static ::rtl::OUString msMasterViewToolBar;        \/\/ SID_MASTERPAGE, 27053\n    const static ::rtl::OUString msDrawingObjectToolBar;     \/\/ RID_DRAW_OBJ_TOOLBOX, 23013\n    const static ::rtl::OUString msGluePointsToolBar;        \/\/ RID_GLUEPOINTS_TOOLBOX, 23019\n    const static ::rtl::OUString msTextObjectBar;            \/\/ RID_DRAW_TEXT_TOOLBOX, 23016\n                                                             \/\/ RID_GRAPHIC_TEXT_TOOLBOX, 23028\n    const static ::rtl::OUString msBezierObjectBar;          \/\/ RID_BEZIER_TOOLBOX, 23015\n    const static ::rtl::OUString msGraphicObjectBar;         \/\/ RID_DRAW_GRAF_TOOLBOX, 23030\n    const static ::rtl::OUString msMediaObjectBar;           \/\/ RID_DRAW_MEDIA_TOOLBOX, 23031\n\n    \/** The set of tool bar groups.\n    *\/\n    enum ToolBarGroup {\n        TBG__FIRST,\n\n        TBG_PERMANENT = TBG__FIRST,\n        TBG_FUNCTION,\n        TBG_MASTER_MODE,\n\n        TBG__LAST = TBG_MASTER_MODE\n    };\n\n    \/** Only after calls with bValid=<TRUE\/> may the tool bar manager use\n        the frame::XLayoutManager to change the visible tool bars.  Call\n        this method when the controller is attached to or detachted from the\n        frame.  When called with <FALSE\/> then ResetAllToolBars() is\n        executed.\n    *\/\n    void SetValid (bool bValid);\n\n    \/** Reset the set of visible object bars in the specified group.  Tool\n        bars in other groups are not affected.\n        @param rParentShell\n            When this shell is not the main view then the method returns\n            immediately.\n        @param eGroup\n            Only the tool bars in this group are rest.\n    *\/\n    void ResetToolBars (ToolBarGroup eGroup);\n\n    \/** Reset all tool bars, regardless of the group they belong to.\n        @param rParentShell\n            When this shell is not the main view then the method returns\n            immediately.\n    *\/\n    void ResetAllToolBars (void);\n\n    \/** Add the tool bar with the given name to the specified group of tool\n        bars.\n        @param rParentShell\n            When this shell is not the main view then the method returns\n            immediately.\n        @param eGroup\n            The new tool bar is added to this group.\n        @param rsToolBarName\n            The base name of the tool bar.  A proper prefix (like\n            private:resource\/toolbar\/) is added.  The name may be one of the\n            ones defined above.  Other names are allowed as well.\n    *\/\n    void AddToolBar (\n        ToolBarGroup eGroup,\n        const ::rtl::OUString& rsToolBarName);\n\n    \/** Add the tool bar shell to the shell stack.  This method basically\n        forwards the call to the ViewShellManager.\n        For some tool bar shells additional tool bars are made visible.\n        @param rParentShell\n            When this shell is not the main view then the method returns\n            immediately.\n        @param eGroup\n            The group is used for the actual tool bars.\n        @param nToolBarId\n            Id of the tool bar shell.\n    *\/\n    void AddToolBarShell (\n        ToolBarGroup eGroup,\n        ShellId nToolBarId);\n\n    \/** Remove the tool bar with the given name from the specified group.\n        If the tool bar is not visible then nothing happens.\n        If the tool bar is a member of another group then nothing happens\n        either.\n    *\/\n    void RemoveToolBar (\n        ToolBarGroup eGroup,\n        const ::rtl::OUString& rsToolBarName);\n\n    void RemoveToolBarShell (\n        ToolBarGroup eGroup,\n        ShellId nToolBarId);\n\n    \/** This is basically a shortcut for ResetToolBars(),AddToolBar().  The\n        main difference is, that all sub shells of the specified parent\n        shell are deactivated as well.\n        @param rParentShell\n            When this shell is not the main view then the method returns\n            immediately.\n        @param eGroup\n            The new tool bar is added to this group.\n        @param rsToolBarName\n            The base name of the tool bar.  A proper prefix (like\n            private:resource\/toolbar\/) is added.  The name may be one of the\n            ones defined above.  Other names are allowed as well.\n    *\/\n    void SetToolBar (\n        ToolBarGroup eGroup,\n        const ::rtl::OUString& rsToolBarName);\n\n    \/** This is basically a shortcut for ResetToolBars(),AddToolBar().  The\n        main difference is, that all sub shells of the specified parent\n        shell are deactivated as well.\n        @param rParentShell\n            When this shell is not the main view then the method returns\n            immediately.\n        @param rParentShell\n            When this shell is not the main view then the method returns\n            immediately.\n        @param eGroup\n            The group is currently not used.\n        @param nToolBarId\n            Id of the tool bar shell.\n    *\/\n    void SetToolBarShell (\n        ToolBarGroup eGroup,\n        ShellId nToolBarId);\n\n    void PreUpdate (void);\n\n    \/** Request an update of the active tool bars.  The update is made\n        asynchronously.\n    *\/\n    void RequestUpdate (void);\n\n    \/** This is a hint for the ToolBarManager to improve the performance\n        when it updates its tool bars when its own lock is released.  Taking\n        control of the release of the update lock of the ViewShellManager\n        avoids some shell stack modifications and tool bar updates.\n    *\/\n    void LockViewShellManager (void);\n\n    \/** Use this class to prevent the visible tool bars from being updated\n        (and thus causing repaints and GUI rearrangements) when several tool\n        bar operations are made in a row.\n    *\/\n    class UpdateLock { public:\n        UpdateLock(ToolBarManager& rManager) : mrManager(rManager) { mrManager.LockUpdate(); }\n        ~UpdateLock(void) { mrManager.UnlockUpdate(); }\n    private:\n        ToolBarManager& mrManager;\n    };\n    friend class UpdateLock;\n\n    \/** Return whether updates of tool bars are locked.\n    *\/\n    bool IsUpdateLocked (void) const;\n\n    void ToolBarsDestroyed(void);\n\nprivate:\n    class Implementation;\n    ::std::auto_ptr<Implementation> mpImpl;\n\n    \/** The ViewShellBase is used to get the XLayoutManager and to determine\n        the plug in mode.\n    *\/\n    ToolBarManager (void);\n\n    void LockUpdate (void);\n    void UnlockUpdate (void);\n};\n\n} \/\/ end of namespace sd\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/***************************************************************************\n *   Copyright (c) 2013 Jrgen Riegel (FreeCAD@juergen-riegel.net)         *\n *                                                                         *\n *   This file is part of the FreeCAD CAx development system.              *\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         *\n *   GNU Library General Public License for more details.                  *\n *                                                                         *\n *   You should have received a copy of the GNU Library General Public     *\n *   License along with this library; see the file COPYING.LIB. If not,    *\n *   write to the Free Software Foundation, Inc., 59 Temple Place,         *\n *   Suite 330, Boston, MA  02111-1307, USA                                *\n *                                                                         *\n ***************************************************************************\/\n\n\n#include \"PreCompiled.h\"\n\n\n#include <QString>\n#include <QSlider>\n#include \"ui_TaskCreateNodeSet.h\"\n#include \"TaskCreateNodeSet.h\"\n#include <Gui\/Application.h>\n#include <Gui\/Document.h>\n#include <Gui\/BitmapFactory.h>\n#include <Gui\/ViewProvider.h>\n#include <Gui\/WaitCursor.h>\n#include <Base\/Console.h>\n#include <Gui\/View3DInventor.h>\n#include <Gui\/View3DInventorViewer.h>\n#include <Gui\/Utilities.h>\n\n#include <Inventor\/nodes\/SoEventCallback.h>\n#include <Inventor\/nodes\/SoCamera.h>\n#include <Inventor\/events\/SoMouseButtonEvent.h>\n\n#include <SMESH_Mesh.hxx>\n#include <SMESHDS_Mesh.hxx>\n#include <SMDSAbs_ElementType.hxx>\n\n#include <Mod\/Fem\/App\/FemMeshObject.h>\n#include <Mod\/Fem\/App\/FemSetNodesObject.h>\n#include \"ViewProviderFemMesh.h\"\n\n\nusing namespace FemGui;\nusing namespace Gui;\n\nTaskCreateNodeSet::TaskCreateNodeSet(Fem::FemSetNodesObject *pcObject,QWidget *parent)\n    : TaskBox(Gui::BitmapFactory().pixmap(\"Fem_FemMesh_createnodebypoly\"),\n      tr(\"Nodes set\"),\n      true, \n      parent),\n      pcObject(pcObject)\n{\n    \/\/ we need a separate container widget to add all controls to\n    proxy = new QWidget(this);\n    ui = new Ui_TaskCreateNodeSet();\n    ui->setupUi(proxy);\n    QMetaObject::connectSlotsByName(this);\n\n    this->groupLayout()->addWidget(proxy);\n\n    QObject::connect(ui->toolButton_Poly,SIGNAL(clicked()),this,SLOT(Poly()));\n    QObject::connect(ui->comboBox,SIGNAL(activated  (int)),this,SLOT(SwitchMethod(int)));\n\n    MeshViewProvider = dynamic_cast<ViewProviderFemMesh*>(Gui::Application::Instance->getViewProvider( pcObject->FemMesh.getValue<Fem::FemMeshObject*>()));\n    assert(MeshViewProvider);\n\n    tempSet = pcObject->Nodes.getValues();\n\n    MeshViewProvider->setHighlightNodes(tempSet);\n\n    ui->groupBox_AngleSearch->setEnabled(false);\n\n}\n\nvoid TaskCreateNodeSet::Poly(void)\n{\n    Gui::Document* doc = Gui::Application::Instance->activeDocument();\n    Gui::MDIView* view = doc->getActiveView();\n    if (view->getTypeId().isDerivedFrom(Gui::View3DInventor::getClassTypeId())) {\n        Gui::View3DInventorViewer* viewer = ((Gui::View3DInventor*)view)->getViewer();\n        viewer->setEditing(true);\n        viewer->startSelection(Gui::View3DInventorViewer::Clip);\n        viewer->addEventCallback(SoMouseButtonEvent::getClassTypeId(), DefineNodesCallback,this);\n    }\n}\n\nvoid TaskCreateNodeSet::SwitchMethod(int Value)\n{\n    if(Value == 1)\n        ui->groupBox_AngleSearch->setEnabled(true);\n    else\n        ui->groupBox_AngleSearch->setEnabled(false);\n}\n\n\n\nvoid TaskCreateNodeSet::DefineNodesCallback(void * ud, SoEventCallback * n)\n{\n    \/\/ show the wait cursor because this could take quite some time\n    Gui::WaitCursor wc;\n\n    TaskCreateNodeSet *taskBox = static_cast<TaskCreateNodeSet *>(ud);\n\n\n    \/\/ When this callback function is invoked we must in either case leave the edit mode\n    Gui::View3DInventorViewer* view  = reinterpret_cast<Gui::View3DInventorViewer*>(n->getUserData());\n    view->setEditing(false);\n    view->removeEventCallback(SoMouseButtonEvent::getClassTypeId(), DefineNodesCallback,ud);\n    n->setHandled();\n\n    SbBool clip_inner;\n    std::vector<SbVec2f> clPoly = view->getGLPolygon(&clip_inner);\n    if (clPoly.size() < 3)\n        return;\n    if (clPoly.front() != clPoly.back())\n        clPoly.push_back(clPoly.front());\n\n    SoCamera* cam = view->getCamera();\n    SbViewVolume vv = cam->getViewVolume();\n    Gui::ViewVolumeProjection proj(vv);\n    Base::Polygon2D polygon;\n    for (std::vector<SbVec2f>::const_iterator it = clPoly.begin(); it != clPoly.end(); ++it)\n        polygon.Add(Base::Vector2D((*it)[0],(*it)[1]));\n\n    taskBox->DefineNodes(polygon,proj,clip_inner);\n\n}\n\nvoid TaskCreateNodeSet::DefineNodes(const Base::Polygon2D &polygon,const Gui::ViewVolumeProjection &proj,bool inner)\n{\n    const SMESHDS_Mesh* data = const_cast<SMESH_Mesh*>(pcObject->FemMesh.getValue<Fem::FemMeshObject*>()->FemMesh.getValue().getSMesh())->GetMeshDS();\n\n    SMDS_NodeIteratorPtr aNodeIter = data->nodesIterator();\n    Base::Vector3f pt2d;\n\n    if(! ui->checkBox_Add->isChecked())\n        tempSet.clear();\n\n    for (int i=0;aNodeIter->more();) {\n        const SMDS_MeshNode* aNode = aNodeIter->next();\n        Base::Vector3f vec(aNode->X(),aNode->Y(),aNode->Z());\n        pt2d = proj(vec);\n        if (polygon.Contains(Base::Vector2D(pt2d.x, pt2d.y)) == inner) \n            tempSet.insert(aNode->GetID());\n    }\n\n    MeshViewProvider->setHighlightNodes(tempSet);\n    \n}\n\n\n\nTaskCreateNodeSet::~TaskCreateNodeSet()\n{\n    delete ui;\n}\n\n\n#include \"moc_TaskCreateNodeSet.cpp\"\n<commit_msg>Fix compiler warning<commit_after>\/***************************************************************************\n *   Copyright (c) 2013 Jrgen Riegel (FreeCAD@juergen-riegel.net)         *\n *                                                                         *\n *   This file is part of the FreeCAD CAx development system.              *\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         *\n *   GNU Library General Public License for more details.                  *\n *                                                                         *\n *   You should have received a copy of the GNU Library General Public     *\n *   License along with this library; see the file COPYING.LIB. If not,    *\n *   write to the Free Software Foundation, Inc., 59 Temple Place,         *\n *   Suite 330, Boston, MA  02111-1307, USA                                *\n *                                                                         *\n ***************************************************************************\/\n\n\n#include \"PreCompiled.h\"\n#ifndef _PreComp_\n# include <QString>\n# include <QSlider>\n#endif\n\n#include <Standard_math.hxx>\n#include \"ui_TaskCreateNodeSet.h\"\n#include \"TaskCreateNodeSet.h\"\n#include <Gui\/Application.h>\n#include <Gui\/Document.h>\n#include <Gui\/BitmapFactory.h>\n#include <Gui\/ViewProvider.h>\n#include <Gui\/WaitCursor.h>\n#include <Base\/Console.h>\n#include <Gui\/View3DInventor.h>\n#include <Gui\/View3DInventorViewer.h>\n#include <Gui\/Utilities.h>\n\n#include <Inventor\/nodes\/SoEventCallback.h>\n#include <Inventor\/nodes\/SoCamera.h>\n#include <Inventor\/events\/SoMouseButtonEvent.h>\n\n#include <SMESH_Mesh.hxx>\n#include <SMESHDS_Mesh.hxx>\n#include <SMDSAbs_ElementType.hxx>\n\n#include <Mod\/Fem\/App\/FemMeshObject.h>\n#include <Mod\/Fem\/App\/FemSetNodesObject.h>\n#include \"ViewProviderFemMesh.h\"\n\n\nusing namespace FemGui;\nusing namespace Gui;\n\nTaskCreateNodeSet::TaskCreateNodeSet(Fem::FemSetNodesObject *pcObject,QWidget *parent)\n    : TaskBox(Gui::BitmapFactory().pixmap(\"Fem_FemMesh_createnodebypoly\"),\n      tr(\"Nodes set\"),\n      true, \n      parent),\n      pcObject(pcObject)\n{\n    \/\/ we need a separate container widget to add all controls to\n    proxy = new QWidget(this);\n    ui = new Ui_TaskCreateNodeSet();\n    ui->setupUi(proxy);\n    QMetaObject::connectSlotsByName(this);\n\n    this->groupLayout()->addWidget(proxy);\n\n    QObject::connect(ui->toolButton_Poly,SIGNAL(clicked()),this,SLOT(Poly()));\n    QObject::connect(ui->comboBox,SIGNAL(activated  (int)),this,SLOT(SwitchMethod(int)));\n\n    MeshViewProvider = dynamic_cast<ViewProviderFemMesh*>(Gui::Application::Instance->getViewProvider( pcObject->FemMesh.getValue<Fem::FemMeshObject*>()));\n    assert(MeshViewProvider);\n\n    tempSet = pcObject->Nodes.getValues();\n\n    MeshViewProvider->setHighlightNodes(tempSet);\n\n    ui->groupBox_AngleSearch->setEnabled(false);\n\n}\n\nvoid TaskCreateNodeSet::Poly(void)\n{\n    Gui::Document* doc = Gui::Application::Instance->activeDocument();\n    Gui::MDIView* view = doc->getActiveView();\n    if (view->getTypeId().isDerivedFrom(Gui::View3DInventor::getClassTypeId())) {\n        Gui::View3DInventorViewer* viewer = ((Gui::View3DInventor*)view)->getViewer();\n        viewer->setEditing(true);\n        viewer->startSelection(Gui::View3DInventorViewer::Clip);\n        viewer->addEventCallback(SoMouseButtonEvent::getClassTypeId(), DefineNodesCallback,this);\n    }\n}\n\nvoid TaskCreateNodeSet::SwitchMethod(int Value)\n{\n    if(Value == 1)\n        ui->groupBox_AngleSearch->setEnabled(true);\n    else\n        ui->groupBox_AngleSearch->setEnabled(false);\n}\n\n\n\nvoid TaskCreateNodeSet::DefineNodesCallback(void * ud, SoEventCallback * n)\n{\n    \/\/ show the wait cursor because this could take quite some time\n    Gui::WaitCursor wc;\n\n    TaskCreateNodeSet *taskBox = static_cast<TaskCreateNodeSet *>(ud);\n\n\n    \/\/ When this callback function is invoked we must in either case leave the edit mode\n    Gui::View3DInventorViewer* view  = reinterpret_cast<Gui::View3DInventorViewer*>(n->getUserData());\n    view->setEditing(false);\n    view->removeEventCallback(SoMouseButtonEvent::getClassTypeId(), DefineNodesCallback,ud);\n    n->setHandled();\n\n    SbBool clip_inner;\n    std::vector<SbVec2f> clPoly = view->getGLPolygon(&clip_inner);\n    if (clPoly.size() < 3)\n        return;\n    if (clPoly.front() != clPoly.back())\n        clPoly.push_back(clPoly.front());\n\n    SoCamera* cam = view->getCamera();\n    SbViewVolume vv = cam->getViewVolume();\n    Gui::ViewVolumeProjection proj(vv);\n    Base::Polygon2D polygon;\n    for (std::vector<SbVec2f>::const_iterator it = clPoly.begin(); it != clPoly.end(); ++it)\n        polygon.Add(Base::Vector2D((*it)[0],(*it)[1]));\n\n    taskBox->DefineNodes(polygon,proj,clip_inner);\n\n}\n\nvoid TaskCreateNodeSet::DefineNodes(const Base::Polygon2D &polygon,const Gui::ViewVolumeProjection &proj,bool inner)\n{\n    const SMESHDS_Mesh* data = const_cast<SMESH_Mesh*>(pcObject->FemMesh.getValue<Fem::FemMeshObject*>()->FemMesh.getValue().getSMesh())->GetMeshDS();\n\n    SMDS_NodeIteratorPtr aNodeIter = data->nodesIterator();\n    Base::Vector3f pt2d;\n\n    if(! ui->checkBox_Add->isChecked())\n        tempSet.clear();\n\n    for (int i=0;aNodeIter->more();) {\n        const SMDS_MeshNode* aNode = aNodeIter->next();\n        Base::Vector3f vec(aNode->X(),aNode->Y(),aNode->Z());\n        pt2d = proj(vec);\n        if (polygon.Contains(Base::Vector2D(pt2d.x, pt2d.y)) == inner) \n            tempSet.insert(aNode->GetID());\n    }\n\n    MeshViewProvider->setHighlightNodes(tempSet);\n    \n}\n\n\n\nTaskCreateNodeSet::~TaskCreateNodeSet()\n{\n    delete ui;\n}\n\n\n#include \"moc_TaskCreateNodeSet.cpp\"\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 \"methc.la\/plugins\/sampler\/sampler.h\"\n\n#include <iostream>\n#include <oscpp\/server.hpp>\n#include <unistd.h>\n\ntypedef enum {\n    kSampler_amp,\n    kSampler_output_0,\n    \/\/ kSampler_output_1,\n    kSamplerPorts\n} PortIndex;\n\ntypedef struct {\n    float* ports[kSamplerPorts];\n    float* buffer;\n    size_t channels;\n    size_t frames;\n    bool loop;\n    size_t pos;\n} Synth;\n\nstatic bool\nport_descriptor( const Methcla_SynthOptions* options\n               , size_t index\n               , Methcla_PortDescriptor* port )\n{\n    switch ((PortIndex)index) {\n        case kSampler_amp:\n            *port = { .type = kMethcla_ControlPort,\n                      .direction = kMethcla_Input,\n                      .flags = kMethcla_PortFlags };\n            return true;\n        case kSampler_output_0:\n        \/\/ case kSampler_output_1:\n            *port = { .type = kMethcla_AudioPort,\n                      .direction = kMethcla_Output,\n                      .flags = kMethcla_PortFlags };\n            return true;\n        default:\n            return false;\n    }\n}\n\nstruct Options\n{\n    const char* path;\n    bool loop;\n    int32_t numFrames;\n};\n\nstatic void\nconfigure(const void* tags, size_t tags_size, const void* args, size_t args_size, Methcla_SynthOptions* outOptions)\n{\n    OSC::Server::ArgStream argStream(OSC::ReadStream(tags, tags_size), OSC::ReadStream(args, args_size));\n    Options* options = (Options*)outOptions;\n    options->path = argStream.string();\n    options->loop = argStream.atEnd() ? false : argStream.int32();\n    options->numFrames = argStream.atEnd() ? -1 : argStream.int32();\n    std::cout << \"Sampler: \"\n              << options->path << \" \"\n              << options->loop << \" \"\n              << options->numFrames << \"\\n\";\n}\n\nstruct LoadMessage\n{\n    Synth* synth;\n    size_t numChannels;\n    int64_t numFrames;\n    float* buffer;\n    char path[];\n};\n\nstatic void set_buffer(const Methcla_World* world, const Methcla_CommandChannel* channel, void* data)\n{\n    std::cout << \"set_buffer\\n\";\n    LoadMessage* msg = (LoadMessage*)data;\n    msg->synth->buffer = msg->buffer;\n    msg->synth->channels = msg->numChannels;\n    msg->synth->frames = msg->numFrames;\n    methcla_world_free(world, msg);\n}\n\nstatic void load_sound_file(const Methcla_World* world, const Methcla_CommandChannel* channel, void* data)\n{\n    std::cout << \"load_sound_file\\n\";\n    LoadMessage* msg = (LoadMessage*)data;\n\n    Methcla_SoundFile* file;\n    Methcla_SoundFileInfo info;\n    Methcla_FileError err = methcla_host_soundfile_open(methcla_world_host(world), msg->path, kMethcla_Read, &file, &info);\n\n    if (err == kMethcla_FileNoError) {\n        msg->numFrames = msg->numFrames < 0 ? info.frames : std::min<int64_t>(msg->numFrames, info.frames);\n        msg->numChannels = info.channels;\n        msg->buffer = (float*)malloc(msg->numChannels * msg->numFrames * sizeof(float));\n        \/\/ TODO: error handling\n        if (msg->buffer != nullptr) {\n            size_t numFrames;\n            err = methcla_soundfile_read_float(file, msg->buffer, msg->numFrames, &numFrames);\n        }\n        methcla_soundfile_close(file);\n    }\n\n    methcla_command_channel_send(channel, set_buffer, msg);\n}\n\nstatic void free_buffer_cb(const Methcla_World* world, const Methcla_CommandChannel* channel, void* data)\n{\n    std::cout << \"free_buffer\\n\";\n    free(data);\n}\n\nstatic void freeBuffer(const Methcla_World* world, Synth* self)\n{\n    if (self->buffer) {\n        methcla_world_perform_command(world, free_buffer_cb, self->buffer);\n        self->buffer = nullptr;\n    }\n}\n\nstatic void\nconstruct( const Methcla_World* world\n         , const Methcla_SynthDef* synthDef\n         , const Methcla_SynthOptions* inOptions\n         , Methcla_Synth* synth )\n{\n    const Options* options = (const Options*)inOptions;\n\n    Synth* self = (Synth*)synth;\n    self->buffer = nullptr;\n    self->channels = 0;\n    self->frames = 0;\n    self->loop = options->loop;\n    self->pos = 0;\n\n    LoadMessage* msg = (LoadMessage*)methcla_world_alloc(world, sizeof(LoadMessage) + strlen(options->path)+1);\n    msg->synth = self;\n    msg->numFrames = options->numFrames;\n    strcpy(msg->path, options->path);\n\n    methcla_world_perform_command(world, load_sound_file, msg);\n}\n\nstatic void\ndestroy(const Methcla_World* world, Methcla_Synth* synth)\n{\n    Synth* self = (Synth*)synth;\n    freeBuffer(world, self);\n}\n\nstatic void\nconnect( Methcla_Synth* synth\n       , size_t index\n       , void* data )\n{\n    ((Synth*)synth)->ports[index] = (float*)data;\n}\n\nstatic void\nprocess(const Methcla_World* world, Methcla_Synth* synth, size_t numFrames)\n{\n    Synth* self = (Synth*)synth;\n\n    const float amp = *self->ports[kSampler_amp];\n    float* out = self->ports[kSampler_output_0];\n\n    float* buffer = self->buffer;\n    if (buffer) {\n        size_t pos = self->pos;\n        const size_t left = self->frames - pos;\n        const size_t channels = self->channels;\n\n        if (left >= numFrames) {\n            for (size_t k = 0; k < numFrames; k++) {\n                out[k] = amp * buffer[(pos+k)*channels];\n            }\n            if (left == numFrames) {\n                if (self->loop) self->pos = 0;\n                else freeBuffer(world, self);\n            } else {\n                self->pos = pos + numFrames;\n            }\n        } else if (self->loop) {\n            size_t played = 0;\n            size_t toPlay = left;\n            while (played < numFrames) {\n                for (size_t k = 0; k < toPlay; k++) {\n                    out[played+k] = amp * buffer[(pos+k)*channels];\n                }\n                played += toPlay;\n                toPlay = std::min(numFrames - played, self->frames);\n                pos += toPlay;\n                if (pos >= self->frames)\n                    pos = 0;\n            }\n            self->pos = pos;\n        } else {\n            for (size_t k = 0; k < left; k++) {\n                out[k] = amp * buffer[(pos+k)*channels];\n            }\n            for (size_t k = left; k < numFrames; k++) {\n                out[k] = 0.f;\n            }\n            freeBuffer(world, self);\n        }\n    } else {\n        for (size_t k = 0; k < numFrames; k++) {\n            out[k] = 0.f;\n        }\n    }\n}\n\nstatic const Methcla_SynthDef descriptor =\n{\n    nullptr,\n    METHCLA_PLUGINS_SAMPLER_URI,\n    sizeof(Synth),\n    sizeof(Options),\n    configure,\n    port_descriptor,\n    construct,\n    connect,\n    nullptr,\n    process,\n    destroy,\n    nullptr\n};\n\nstatic const Methcla_Library library = { NULL, NULL };\n\nMETHCLA_EXPORT const Methcla_Library* methcla_plugins_sampler(const Methcla_Host* host, const char* bundlePath)\n{\n    methcla_host_register_synthdef(host, &descriptor);\n    return &library;\n}\n<commit_msg>Fix looping for sampler plugin<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 \"methc.la\/plugins\/sampler\/sampler.h\"\n\n#include <iostream>\n#include <oscpp\/server.hpp>\n#include <unistd.h>\n\ntypedef enum {\n    kSampler_amp,\n    kSampler_output_0,\n    \/\/ kSampler_output_1,\n    kSamplerPorts\n} PortIndex;\n\ntypedef struct {\n    float* ports[kSamplerPorts];\n    float* buffer;\n    size_t channels;\n    size_t frames;\n    bool loop;\n    size_t pos;\n} Synth;\n\nstatic bool\nport_descriptor( const Methcla_SynthOptions* options\n               , size_t index\n               , Methcla_PortDescriptor* port )\n{\n    switch ((PortIndex)index) {\n        case kSampler_amp:\n            *port = { .type = kMethcla_ControlPort,\n                      .direction = kMethcla_Input,\n                      .flags = kMethcla_PortFlags };\n            return true;\n        case kSampler_output_0:\n        \/\/ case kSampler_output_1:\n            *port = { .type = kMethcla_AudioPort,\n                      .direction = kMethcla_Output,\n                      .flags = kMethcla_PortFlags };\n            return true;\n        default:\n            return false;\n    }\n}\n\nstruct Options\n{\n    const char* path;\n    bool loop;\n    int32_t numFrames;\n};\n\nstatic void\nconfigure(const void* tags, size_t tags_size, const void* args, size_t args_size, Methcla_SynthOptions* outOptions)\n{\n    OSC::Server::ArgStream argStream(OSC::ReadStream(tags, tags_size), OSC::ReadStream(args, args_size));\n    Options* options = (Options*)outOptions;\n    options->path = argStream.string();\n    options->loop = argStream.atEnd() ? false : argStream.int32();\n    options->numFrames = argStream.atEnd() ? -1 : argStream.int32();\n    std::cout << \"Sampler: \"\n              << options->path << \" \"\n              << options->loop << \" \"\n              << options->numFrames << \"\\n\";\n}\n\nstruct LoadMessage\n{\n    Synth* synth;\n    size_t numChannels;\n    int64_t numFrames;\n    float* buffer;\n    char path[];\n};\n\nstatic void set_buffer(const Methcla_World* world, const Methcla_CommandChannel* channel, void* data)\n{\n    std::cout << \"set_buffer\\n\";\n    LoadMessage* msg = (LoadMessage*)data;\n    msg->synth->buffer = msg->buffer;\n    msg->synth->channels = msg->numChannels;\n    msg->synth->frames = msg->numFrames;\n    methcla_world_free(world, msg);\n}\n\nstatic void load_sound_file(const Methcla_World* world, const Methcla_CommandChannel* channel, void* data)\n{\n    std::cout << \"load_sound_file\\n\";\n    LoadMessage* msg = (LoadMessage*)data;\n\n    Methcla_SoundFile* file;\n    Methcla_SoundFileInfo info;\n    Methcla_FileError err = methcla_host_soundfile_open(methcla_world_host(world), msg->path, kMethcla_Read, &file, &info);\n\n    if (err == kMethcla_FileNoError) {\n        msg->numFrames = msg->numFrames < 0 ? info.frames : std::min<int64_t>(msg->numFrames, info.frames);\n        msg->numChannels = info.channels;\n        msg->buffer = (float*)malloc(msg->numChannels * msg->numFrames * sizeof(float));\n        std::cout << \"load_sound_file: \" << msg->path << \" \" << info.channels << \" \" << info.frames << \"\\n\";\n        \/\/ TODO: error handling\n        if (msg->buffer != nullptr) {\n            size_t numFrames;\n            err = methcla_soundfile_read_float(file, msg->buffer, msg->numFrames, &numFrames);\n        }\n        methcla_soundfile_close(file);\n    }\n\n    methcla_command_channel_send(channel, set_buffer, msg);\n}\n\nstatic void free_buffer_cb(const Methcla_World* world, const Methcla_CommandChannel* channel, void* data)\n{\n    std::cout << \"free_buffer\\n\";\n    free(data);\n}\n\nstatic void freeBuffer(const Methcla_World* world, Synth* self)\n{\n    if (self->buffer) {\n        methcla_world_perform_command(world, free_buffer_cb, self->buffer);\n        self->buffer = nullptr;\n    }\n}\n\nstatic void\nconstruct( const Methcla_World* world\n         , const Methcla_SynthDef* synthDef\n         , const Methcla_SynthOptions* inOptions\n         , Methcla_Synth* synth )\n{\n    const Options* options = (const Options*)inOptions;\n\n    Synth* self = (Synth*)synth;\n    self->buffer = nullptr;\n    self->channels = 0;\n    self->frames = 0;\n    self->loop = options->loop;\n    self->pos = 0;\n\n    LoadMessage* msg = (LoadMessage*)methcla_world_alloc(world, sizeof(LoadMessage) + strlen(options->path)+1);\n    msg->synth = self;\n    msg->numFrames = options->numFrames;\n    strcpy(msg->path, options->path);\n\n    methcla_world_perform_command(world, load_sound_file, msg);\n}\n\nstatic void\ndestroy(const Methcla_World* world, Methcla_Synth* synth)\n{\n    Synth* self = (Synth*)synth;\n    freeBuffer(world, self);\n}\n\nstatic void\nconnect( Methcla_Synth* synth\n       , size_t index\n       , void* data )\n{\n    ((Synth*)synth)->ports[index] = (float*)data;\n}\n\nstatic void\nprocess(const Methcla_World* world, Methcla_Synth* synth, size_t numFrames)\n{\n    Synth* self = (Synth*)synth;\n\n    const float amp = *self->ports[kSampler_amp];\n    float* out = self->ports[kSampler_output_0];\n\n    float* buffer = self->buffer;\n    if (buffer) {\n        size_t pos = self->pos;\n        const size_t left = self->frames - pos;\n        const size_t channels = self->channels;\n\n        if (left >= numFrames) {\n            for (size_t k = 0; k < numFrames; k++) {\n                out[k] = amp * buffer[(pos+k)*channels];\n            }\n            if (left == numFrames) {\n                if (self->loop) self->pos = 0;\n                else freeBuffer(world, self);\n            } else {\n                self->pos = pos + numFrames;\n            }\n        } else if (self->loop) {\n            size_t played = 0;\n            size_t toPlay = left;\n            while (played < numFrames) {\n                for (size_t k = 0; k < toPlay; k++) {\n                    out[played+k] = amp * buffer[(pos+k)*channels];\n                }\n                played += toPlay;\n                pos += toPlay;\n                if (pos >= self->frames)\n                    pos = 0;\n                toPlay = std::min(numFrames - played, self->frames);\n            }\n            self->pos = pos;\n        } else {\n            for (size_t k = 0; k < left; k++) {\n                out[k] = amp * buffer[(pos+k)*channels];\n            }\n            for (size_t k = left; k < numFrames; k++) {\n                out[k] = 0.f;\n            }\n            freeBuffer(world, self);\n        }\n    } else {\n        for (size_t k = 0; k < numFrames; k++) {\n            out[k] = 0.f;\n        }\n    }\n}\n\nstatic const Methcla_SynthDef descriptor =\n{\n    nullptr,\n    METHCLA_PLUGINS_SAMPLER_URI,\n    sizeof(Synth),\n    sizeof(Options),\n    configure,\n    port_descriptor,\n    construct,\n    connect,\n    nullptr,\n    process,\n    destroy,\n    nullptr\n};\n\nstatic const Methcla_Library library = { NULL, NULL };\n\nMETHCLA_EXPORT const Methcla_Library* methcla_plugins_sampler(const Methcla_Host* host, const char* bundlePath)\n{\n    methcla_host_register_synthdef(host, &descriptor);\n    return &library;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: register3rdcomponents.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: obo $ $Date: 2005-03-15 12:56: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\/\/  includes of my own project\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef __FRAMEWORK_MACROS_REGISTRATION_HXX_\n#include <macros\/registration.hxx>\n#endif\n\n\/*=================================================================================================================\n    Add new include and new register info to for new services.\n\n    Example:\n\n        #ifndef __YOUR_SERVICE_1_HXX_\n        #include <service1.hxx>\n        #endif\n\n        #ifndef __YOUR_SERVICE_2_HXX_\n        #include <service2.hxx>\n        #endif\n\n        COMPONENTGETIMPLEMENTATIONENVIRONMENT\n\n        COMPONENTWRITEINFO  (   COMPONENTINFO( Service1 )\n                                 COMPONENTINFO( Service2 )\n                            )\n\n        COMPONENTGETFACTORY (   IFFACTORIE( Service1 )\n                                 else\n                                IFFACTORIE( Service2 )\n                             )\n=================================================================================================================*\/\n\n#ifndef __FRAMEWORK_JOBS_HELPONSTARTUP_HXX_\n#include <jobs\/helponstartup.hxx>\n#endif\n\nCOMPONENTGETIMPLEMENTATIONENVIRONMENT\n\nCOMPONENTWRITEINFO  (   COMPONENTINFO( ::framework::HelpOnStartup   )\n                    )\n\nCOMPONENTGETFACTORY (   IFFACTORY( ::framework::HelpOnStartup       )\n                    )\n<commit_msg>INTEGRATION: CWS ooo19126 (1.2.106); FILE MERGED 2005\/09\/05 13:06:44 rt 1.2.106.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: register3rdcomponents.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 01:39: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\/\/  includes of my own project\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef __FRAMEWORK_MACROS_REGISTRATION_HXX_\n#include <macros\/registration.hxx>\n#endif\n\n\/*=================================================================================================================\n    Add new include and new register info to for new services.\n\n    Example:\n\n        #ifndef __YOUR_SERVICE_1_HXX_\n        #include <service1.hxx>\n        #endif\n\n        #ifndef __YOUR_SERVICE_2_HXX_\n        #include <service2.hxx>\n        #endif\n\n        COMPONENTGETIMPLEMENTATIONENVIRONMENT\n\n        COMPONENTWRITEINFO  (   COMPONENTINFO( Service1 )\n                                 COMPONENTINFO( Service2 )\n                            )\n\n        COMPONENTGETFACTORY (   IFFACTORIE( Service1 )\n                                 else\n                                IFFACTORIE( Service2 )\n                             )\n=================================================================================================================*\/\n\n#ifndef __FRAMEWORK_JOBS_HELPONSTARTUP_HXX_\n#include <jobs\/helponstartup.hxx>\n#endif\n\nCOMPONENTGETIMPLEMENTATIONENVIRONMENT\n\nCOMPONENTWRITEINFO  (   COMPONENTINFO( ::framework::HelpOnStartup   )\n                    )\n\nCOMPONENTGETFACTORY (   IFFACTORY( ::framework::HelpOnStartup       )\n                    )\n<|endoftext|>"}
{"text":"<commit_before>#include <QDebug>\n#include <QVBoxLayout>\n#include <QHBoxLayout>\n#include <QPushButton>\n#include <QButtonGroup>\n#include <QStackedLayout>\n\n#include \"keyboard.hpp\"\n\nconst int DEFAULT_WIDTH = 1;\nconst int SPACEBAR_WIDTH = 3;\n\nKeyboardLayout::KeyboardLayout(QWidget *parent, std::vector<QVector<QString>> layout) : QWidget(parent) {\n  QVBoxLayout* vlayout = new QVBoxLayout;\n  QButtonGroup* btn_group = new QButtonGroup(this);\n\n  QObject::connect(btn_group, SIGNAL(buttonClicked(QAbstractButton*)), parent, SLOT(handleButton(QAbstractButton*)));\n\n  int i = 0;\n  for (auto s : layout) {\n    QHBoxLayout *hlayout = new QHBoxLayout;\n\n    if (i == 1) {\n      hlayout->addSpacing(90);\n    }\n\n    for (QString p : s) {\n      QPushButton* btn = new QPushButton(p);\n      btn->setFixedHeight(120);\n      btn_group->addButton(btn);\n      hlayout->addSpacing(30);\n      if (p == QString(\"  \")) {\n        hlayout->addWidget(btn, SPACEBAR_WIDTH);\n      } else {\n        hlayout->addWidget(btn, DEFAULT_WIDTH);\n      }\n\n    }\n\n    if (i == 1) {\n      hlayout->addSpacing(90);\n    }\n\n    vlayout->addLayout(hlayout);\n    i++;\n  }\n\n  setLayout(vlayout);\n}\n\nKeyboard::Keyboard(QWidget *parent) : QWidget(parent) {\n  main_layout = new QStackedLayout;\n\n  \/\/ lowercase\n  std::vector<QVector<QString>> lowercase = {\n    {\"q\",\"w\",\"e\",\"r\",\"t\",\"y\",\"u\",\"i\",\"o\",\"p\"},\n    {\"a\",\"s\",\"d\",\"f\",\"g\",\"h\",\"j\",\"k\",\"l\"},\n    {\"⇧\",\"z\",\"x\",\"c\",\"v\",\"b\",\"n\",\"m\",\"⌫\"},\n    {\"123\",\"  \",\"⏎\"},\n  };\n  main_layout->addWidget(new KeyboardLayout(this, lowercase));\n\n  \/\/ uppercase\n  std::vector<QVector<QString>> uppercase = {\n    {\"Q\",\"W\",\"E\",\"R\",\"T\",\"Y\",\"U\",\"I\",\"O\",\"P\"},\n    {\"A\",\"S\",\"D\",\"F\",\"G\",\"H\",\"J\",\"K\",\"L\"},\n    {\"↑\",\"Z\",\"X\",\"C\",\"V\",\"B\",\"N\",\"M\",\"⌫\"},\n    {\"123\",\"  \",\"⏎\"},\n  };\n  main_layout->addWidget(new KeyboardLayout(this, uppercase));\n\n  \/\/ 1234567890\n  std::vector<QVector<QString>> numbers = {\n    {\"1\",\"2\",\"3\",\"4\",\"5\",\"6\",\"7\",\"8\",\"9\",\"0\"},\n    {\"-\",\"\/\",\":\",\";\",\"(\",\")\",\"$\",\"&&\",\"@\",\"\\\"\"},\n    {\"#+=\",\".\",\",\",\"?\",\"!\",\"`\",\"⌫\"},\n    {\"ABC\",\"  \",\"⏎\"},\n  };\n  main_layout->addWidget(new KeyboardLayout(this, numbers));\n\n  \/\/ Special characters\n  std::vector<QVector<QString>> specials = {\n    {\"[\",\"]\",\"{\",\"}\",\"#\",\"%\",\"^\",\"*\",\"+\",\"=\"},\n    {\"_\",\"\\\\\",\"|\",\"~\",\"<\",\">\",\"€\",\"£\",\"¥\",\"•\"},\n    {\"123\",\".\",\",\",\"?\",\"!\",\"`\",\"⌫\"},\n    {\"ABC\",\"  \",\"⏎\"},\n  };\n  main_layout->addWidget(new KeyboardLayout(this, specials));\n\n  setLayout(main_layout);\n  main_layout->setCurrentIndex(0);\n\n  setStyleSheet(R\"(\n    QPushButton {\n      padding: 0;\n      font-size: 50px;\n    }\n    * {\n      background-color: #99777777;\n    }\n  )\");\n}\n\n\nvoid Keyboard::handleButton(QAbstractButton* m_button) {\n  QString id = m_button->text();\n  if (!QString::compare(m_button->text(), \"↑\") || !QString::compare(m_button->text(), \"ABC\")) {\n    main_layout->setCurrentIndex(0);\n  }\n  if (!QString::compare(m_button->text(), \"⇧\")) {\n    main_layout->setCurrentIndex(1);\n  }\n  if (!QString::compare(m_button->text(), \"123\")) {\n    main_layout->setCurrentIndex(2);\n  }\n  if (!QString::compare(m_button->text(), \"#+=\")) {\n    main_layout->setCurrentIndex(3);\n  }\n  if (!QString::compare(m_button->text(), \"⏎\")) {\n    main_layout->setCurrentIndex(0);\n  }\n  if (\"A\" <= id && id <= \"Z\") {\n    main_layout->setCurrentIndex(0);\n  }\n  emit emitButton(m_button->text());\n}\n<commit_msg>keyboard.cc: get value by reference in ranged based loop (#19950)<commit_after>#include <QDebug>\n#include <QVBoxLayout>\n#include <QHBoxLayout>\n#include <QPushButton>\n#include <QButtonGroup>\n#include <QStackedLayout>\n\n#include \"keyboard.hpp\"\n\nconst int DEFAULT_WIDTH = 1;\nconst int SPACEBAR_WIDTH = 3;\n\nKeyboardLayout::KeyboardLayout(QWidget *parent, std::vector<QVector<QString>> layout) : QWidget(parent) {\n  QVBoxLayout* vlayout = new QVBoxLayout;\n  QButtonGroup* btn_group = new QButtonGroup(this);\n\n  QObject::connect(btn_group, SIGNAL(buttonClicked(QAbstractButton*)), parent, SLOT(handleButton(QAbstractButton*)));\n\n  int i = 0;\n  for (const auto &s : layout) {\n    QHBoxLayout *hlayout = new QHBoxLayout;\n\n    if (i == 1) {\n      hlayout->addSpacing(90);\n    }\n\n    for (const QString &p : s) {\n      QPushButton* btn = new QPushButton(p);\n      btn->setFixedHeight(120);\n      btn_group->addButton(btn);\n      hlayout->addSpacing(30);\n      if (p == QString(\"  \")) {\n        hlayout->addWidget(btn, SPACEBAR_WIDTH);\n      } else {\n        hlayout->addWidget(btn, DEFAULT_WIDTH);\n      }\n\n    }\n\n    if (i == 1) {\n      hlayout->addSpacing(90);\n    }\n\n    vlayout->addLayout(hlayout);\n    i++;\n  }\n\n  setLayout(vlayout);\n}\n\nKeyboard::Keyboard(QWidget *parent) : QWidget(parent) {\n  main_layout = new QStackedLayout;\n\n  \/\/ lowercase\n  std::vector<QVector<QString>> lowercase = {\n    {\"q\",\"w\",\"e\",\"r\",\"t\",\"y\",\"u\",\"i\",\"o\",\"p\"},\n    {\"a\",\"s\",\"d\",\"f\",\"g\",\"h\",\"j\",\"k\",\"l\"},\n    {\"⇧\",\"z\",\"x\",\"c\",\"v\",\"b\",\"n\",\"m\",\"⌫\"},\n    {\"123\",\"  \",\"⏎\"},\n  };\n  main_layout->addWidget(new KeyboardLayout(this, lowercase));\n\n  \/\/ uppercase\n  std::vector<QVector<QString>> uppercase = {\n    {\"Q\",\"W\",\"E\",\"R\",\"T\",\"Y\",\"U\",\"I\",\"O\",\"P\"},\n    {\"A\",\"S\",\"D\",\"F\",\"G\",\"H\",\"J\",\"K\",\"L\"},\n    {\"↑\",\"Z\",\"X\",\"C\",\"V\",\"B\",\"N\",\"M\",\"⌫\"},\n    {\"123\",\"  \",\"⏎\"},\n  };\n  main_layout->addWidget(new KeyboardLayout(this, uppercase));\n\n  \/\/ 1234567890\n  std::vector<QVector<QString>> numbers = {\n    {\"1\",\"2\",\"3\",\"4\",\"5\",\"6\",\"7\",\"8\",\"9\",\"0\"},\n    {\"-\",\"\/\",\":\",\";\",\"(\",\")\",\"$\",\"&&\",\"@\",\"\\\"\"},\n    {\"#+=\",\".\",\",\",\"?\",\"!\",\"`\",\"⌫\"},\n    {\"ABC\",\"  \",\"⏎\"},\n  };\n  main_layout->addWidget(new KeyboardLayout(this, numbers));\n\n  \/\/ Special characters\n  std::vector<QVector<QString>> specials = {\n    {\"[\",\"]\",\"{\",\"}\",\"#\",\"%\",\"^\",\"*\",\"+\",\"=\"},\n    {\"_\",\"\\\\\",\"|\",\"~\",\"<\",\">\",\"€\",\"£\",\"¥\",\"•\"},\n    {\"123\",\".\",\",\",\"?\",\"!\",\"`\",\"⌫\"},\n    {\"ABC\",\"  \",\"⏎\"},\n  };\n  main_layout->addWidget(new KeyboardLayout(this, specials));\n\n  setLayout(main_layout);\n  main_layout->setCurrentIndex(0);\n\n  setStyleSheet(R\"(\n    QPushButton {\n      padding: 0;\n      font-size: 50px;\n    }\n    * {\n      background-color: #99777777;\n    }\n  )\");\n}\n\n\nvoid Keyboard::handleButton(QAbstractButton* m_button) {\n  QString id = m_button->text();\n  if (!QString::compare(m_button->text(), \"↑\") || !QString::compare(m_button->text(), \"ABC\")) {\n    main_layout->setCurrentIndex(0);\n  }\n  if (!QString::compare(m_button->text(), \"⇧\")) {\n    main_layout->setCurrentIndex(1);\n  }\n  if (!QString::compare(m_button->text(), \"123\")) {\n    main_layout->setCurrentIndex(2);\n  }\n  if (!QString::compare(m_button->text(), \"#+=\")) {\n    main_layout->setCurrentIndex(3);\n  }\n  if (!QString::compare(m_button->text(), \"⏎\")) {\n    main_layout->setCurrentIndex(0);\n  }\n  if (\"A\" <= id && id <= \"Z\") {\n    main_layout->setCurrentIndex(0);\n  }\n  emit emitButton(m_button->text());\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"BrainStdAfx.h\"\n#include \"PIGPIO.h\"\n\n#include \"sz_math.hpp\"\n#include \"sz_PIGPIO.hpp\"\n\n#ifdef RASPBERRY_PI\nextern \"C\"\n{\n    #include \"hw\/pigpio.h\"\n}\nextern std::chrono::microseconds PIGPIO_PERIOD;\n\n#endif\n\nnamespace silk\n{\nnamespace node\n{\n\nPIGPIO::PIGPIO(HAL& hal)\n    : m_hal(hal)\n    , m_init_params(new sz::PIGPIO::Init_Params())\n    , m_config(new sz::PIGPIO::Config())\n{\n    m_pwm_channels.resize(8);\n}\n\nPIGPIO::~PIGPIO()\n{\n}\n\n\nauto PIGPIO::get_inputs() const -> std::vector<Input>\n{\n    std::vector<Input> inputs =\n    {{\n        { stream::IPWM::TYPE, m_init_params->channel_4.rate, \"Channel 4\", m_pwm_channels[0].stream_path },\n        { stream::IPWM::TYPE, m_init_params->channel_17.rate, \"Channel 17\", m_pwm_channels[1].stream_path },\n        { stream::IPWM::TYPE, m_init_params->channel_18.rate, \"Channel 18\", m_pwm_channels[2].stream_path },\n        { stream::IPWM::TYPE, m_init_params->channel_22.rate, \"Channel 22\", m_pwm_channels[3].stream_path },\n        { stream::IPWM::TYPE, m_init_params->channel_23.rate, \"Channel 23\", m_pwm_channels[4].stream_path },\n        { stream::IPWM::TYPE, m_init_params->channel_24.rate, \"Channel 24\", m_pwm_channels[5].stream_path },\n        { stream::IPWM::TYPE, m_init_params->channel_25.rate, \"Channel 25\", m_pwm_channels[6].stream_path },\n        { stream::IPWM::TYPE, m_init_params->channel_27.rate, \"Channel 27\", m_pwm_channels[7].stream_path }\n    }};\n    return inputs;\n}\n\n\nauto PIGPIO::init(rapidjson::Value const& init_params) -> bool\n{\n    QLOG_TOPIC(\"pigpio::init\");\n\n    sz::PIGPIO::Init_Params sz;\n    autojsoncxx::error::ErrorStack result;\n    if (!autojsoncxx::from_value(sz, init_params, result))\n    {\n        std::ostringstream ss;\n        ss << result;\n        QLOGE(\"Cannot deserialize PIGPIO data: {}\", ss.str());\n        return false;\n    }\n    *m_init_params = sz;\n    return init();\n}\n\nauto PIGPIO::init() -> bool\n{\n    size_t period = PIGPIO_PERIOD.count();\n\n    std::vector<size_t> rates = { 40000, 20000, 10000, 8000, 5000, 4000, 2500, 2000, 1600, 1250, 1000, 800, 500, 400, 250, 200, 100, 50 };\n    for (auto& f: rates)\n    {\n        auto x = math::round(double(f) \/ double(period));\n        f = static_cast<size_t>(x);\n    }\n\n    m_pwm_channels[0].gpio = 4;\n    m_pwm_channels[0].config = &m_init_params->channel_4;\n    m_pwm_channels[1].gpio = 17;\n    m_pwm_channels[1].config = &m_init_params->channel_17;\n    m_pwm_channels[2].gpio = 18;\n    m_pwm_channels[2].config = &m_init_params->channel_18;\n    m_pwm_channels[3].gpio = 22;\n    m_pwm_channels[3].config = &m_init_params->channel_22;\n    m_pwm_channels[4].gpio = 23;\n    m_pwm_channels[4].config = &m_init_params->channel_23;\n    m_pwm_channels[5].gpio = 24;\n    m_pwm_channels[5].config = &m_init_params->channel_24;\n    m_pwm_channels[6].gpio = 25;\n    m_pwm_channels[6].config = &m_init_params->channel_25;\n    m_pwm_channels[7].gpio = 27;\n    m_pwm_channels[7].config = &m_init_params->channel_27;\n\n#if defined (RASPBERRY_PI)\n    \/\/first validate\n    for (size_t i = 0; i < m_pwm_channels.size(); i++)\n    {\n        auto const& ch = *m_pwm_channels[i].config;\n        auto gpio = m_pwm_channels[i].gpio;\n        if (ch.min >= ch.max)\n        {\n            QLOGE(\"channel {}: min ({}) is bigger than max ({})\", gpio, ch.min, ch.max);\n            return false;\n        }\n        if (ch.max > ch.range)\n        {\n            QLOGE(\"channel {}: max ({}) is bigger than the range ({})\", gpio, ch.max, ch.range);\n            return false;\n        }\n        if (std::find(rates.begin(), rates.end(), ch.rate) == rates.end())\n        {\n            QLOGE(\"channel {}: invalid rate {}. Supported are: {}\", gpio, ch.rate, rates);\n            return false;\n        }\n    }\n\n    \/\/first of all turn on the pull-down to that if the board is reset of powerred off the motors don't start spinning\n    \/\/after a restart the GPIO pins are configured as inputs so their state is floating. Most of the time this results in a high pin\n    for (size_t i = 0; i < m_pwm_channels.size(); i++)\n    {\n        auto gpio = m_pwm_channels[i].gpio;\n        if (gpioSetPullUpDown(gpio, PI_PUD_DOWN) < 0)\n        {\n            QLOGE(\"channel {} on GPIO {}: Cannot set pull down mode\", i, gpio);\n            return false;\n        }\n        if (gpioSetMode(gpio, PI_OUTPUT) < 0)\n        {\n            QLOGE(\"channel {} on GPIO {}: Cannot set GPIO mode to output\", i, gpio);\n            return false;\n        }\n     }\n\n    \/\/now configure the pin for PWM or servo\n    for (size_t i = 0; i < m_pwm_channels.size(); i++)\n    {\n        auto const& ch = *m_pwm_channels[i].config;\n        auto gpio = m_pwm_channels[i].gpio;\n        auto f = gpioSetPWMfrequency(gpio, ch.rate);\n        if (f < 0)\n        {\n            QLOGE(\"channel {}: Cannot set pwm rate {}\", gpio, ch.rate);\n            return false;\n        }\n        if (gpioSetPWMrange(gpio, ch.range) < 0)\n        {\n            QLOGE(\"channel {}: Cannot set pwm range {} on gpio {}\", gpio, ch.range);\n            return false;\n        }\n        QLOGI(\"channel {}: rate {} range {}\", gpio, ch.rate, ch.range);\n    }\n\n    return true;\n#else\n    QLOGE(\"PIGPIO only supported on the raspberry pi\");\n    return false;\n#endif\n}\n\nauto PIGPIO::start(q::Clock::time_point tp) -> bool\n{\n    return true;\n}\n\nvoid PIGPIO::set_pwm_value(size_t idx, float value)\n{\n    QLOG_TOPIC(\"pigpio::set_pwm_value\");\n\n#if defined RASPBERRY_PI\n    auto const& ch = *m_pwm_channels[idx].config;\n    value = math::clamp(value, 0.f, 1.f);\n    int pulse = value * (ch.max - ch.min);\n    gpioPWM(m_pwm_channels[idx].gpio, ch.min + pulse);\n#else\n    QUNUSED(idx);\n    QUNUSED(value);\n    QASSERT(0);\n#endif\n}\n\nvoid PIGPIO::process()\n{\n    QLOG_TOPIC(\"pigpio::process\");\n\n    for (size_t i = 0; i < m_pwm_channels.size(); i++)\n    {\n        auto& ch = m_pwm_channels[i];\n        auto stream = ch.stream.lock();\n        if (stream)\n        {\n            auto const& samples = stream->get_samples();\n            if (!samples.empty())\n            {\n\/\/                if (samples.size() > 20)\n\/\/                {\n\/\/                    QLOGW(\"channel {} on GPIO {} is too slow. {} samples are queued\", i, ch.gpio, samples.size());\n\/\/                }\n\n                set_pwm_value(i, samples.back().value);\n            }\n        }\n    }\n}\n\n\n#define READ_CONFIG(IDX, CH)\\\nif (idx == IDX)\\\n{\\\n    auto input_stream = m_hal.get_streams().find_by_name<stream::IPWM>(path.get_as<std::string>());\\\n    auto rate = input_stream ? input_stream->get_rate() : 0u;\\\n    if (rate != m_init_params->channel_##CH.rate)\\\n    {\\\n        if (input_stream)\\\n        {\\\n            QLOGW(\"Bad input stream '{}'. Expected rate {}Hz, got {}Hz\", path, m_init_params->channel_##CH.rate, rate);\\\n        }\\\n        m_pwm_channels[IDX].stream.reset();\\\n        m_pwm_channels[IDX].stream_path = q::Path();\\\n    }\\\n    else\\\n    {\\\n        m_pwm_channels[IDX].stream = input_stream;\\\n        m_pwm_channels[IDX].stream_path = path;\\\n    }\\\n}\n\nvoid PIGPIO::set_input_stream_path(size_t idx, q::Path const& path)\n{\n    READ_CONFIG(0, 4);\n    READ_CONFIG(1, 17);\n    READ_CONFIG(2, 18);\n    READ_CONFIG(3, 22);\n    READ_CONFIG(4, 23);\n    READ_CONFIG(5, 24);\n    READ_CONFIG(6, 25);\n    READ_CONFIG(7, 27);\n}\n\n\nauto PIGPIO::set_config(rapidjson::Value const& json) -> bool\n{\n    QLOG_TOPIC(\"pigpio::set_config\");\n\n    sz::PIGPIO::Config sz;\n    autojsoncxx::error::ErrorStack result;\n    if (!autojsoncxx::from_value(sz, json, result))\n    {\n        std::ostringstream ss;\n        ss << result;\n        QLOGE(\"Cannot deserialize PIGPIO config data: {}\", ss.str());\n        return false;\n    }\n\n    *m_config = sz;\n\n    return true;\n}\nauto PIGPIO::get_config() const -> rapidjson::Document\n{\n    rapidjson::Document json;\n    autojsoncxx::to_document(*m_config, json);\n    return std::move(json);\n}\n\nauto PIGPIO::get_init_params() const -> rapidjson::Document\n{\n    rapidjson::Document json;\n    autojsoncxx::to_document(*m_init_params, json);\n    return std::move(json);\n}\nauto PIGPIO::send_message(rapidjson::Value const& \/*json*\/) -> rapidjson::Document\n{\n    return rapidjson::Document();\n}\n\n\n}\n}\n<commit_msg>fixed compilation on desktop<commit_after>#include \"BrainStdAfx.h\"\n#include \"PIGPIO.h\"\n\n#include \"sz_math.hpp\"\n#include \"sz_PIGPIO.hpp\"\n\n#ifdef RASPBERRY_PI\nextern \"C\"\n{\n    #include \"hw\/pigpio.h\"\n}\nextern std::chrono::microseconds PIGPIO_PERIOD;\n\n#endif\n\nnamespace silk\n{\nnamespace node\n{\n\nPIGPIO::PIGPIO(HAL& hal)\n    : m_hal(hal)\n    , m_init_params(new sz::PIGPIO::Init_Params())\n    , m_config(new sz::PIGPIO::Config())\n{\n    m_pwm_channels.resize(8);\n}\n\nPIGPIO::~PIGPIO()\n{\n}\n\n\nauto PIGPIO::get_inputs() const -> std::vector<Input>\n{\n    std::vector<Input> inputs =\n    {{\n        { stream::IPWM::TYPE, m_init_params->channel_4.rate, \"Channel 4\", m_pwm_channels[0].stream_path },\n        { stream::IPWM::TYPE, m_init_params->channel_17.rate, \"Channel 17\", m_pwm_channels[1].stream_path },\n        { stream::IPWM::TYPE, m_init_params->channel_18.rate, \"Channel 18\", m_pwm_channels[2].stream_path },\n        { stream::IPWM::TYPE, m_init_params->channel_22.rate, \"Channel 22\", m_pwm_channels[3].stream_path },\n        { stream::IPWM::TYPE, m_init_params->channel_23.rate, \"Channel 23\", m_pwm_channels[4].stream_path },\n        { stream::IPWM::TYPE, m_init_params->channel_24.rate, \"Channel 24\", m_pwm_channels[5].stream_path },\n        { stream::IPWM::TYPE, m_init_params->channel_25.rate, \"Channel 25\", m_pwm_channels[6].stream_path },\n        { stream::IPWM::TYPE, m_init_params->channel_27.rate, \"Channel 27\", m_pwm_channels[7].stream_path }\n    }};\n    return inputs;\n}\n\n\nauto PIGPIO::init(rapidjson::Value const& init_params) -> bool\n{\n    QLOG_TOPIC(\"pigpio::init\");\n\n    sz::PIGPIO::Init_Params sz;\n    autojsoncxx::error::ErrorStack result;\n    if (!autojsoncxx::from_value(sz, init_params, result))\n    {\n        std::ostringstream ss;\n        ss << result;\n        QLOGE(\"Cannot deserialize PIGPIO data: {}\", ss.str());\n        return false;\n    }\n    *m_init_params = sz;\n    return init();\n}\n\nauto PIGPIO::init() -> bool\n{\n    m_pwm_channels[0].gpio = 4;\n    m_pwm_channels[0].config = &m_init_params->channel_4;\n    m_pwm_channels[1].gpio = 17;\n    m_pwm_channels[1].config = &m_init_params->channel_17;\n    m_pwm_channels[2].gpio = 18;\n    m_pwm_channels[2].config = &m_init_params->channel_18;\n    m_pwm_channels[3].gpio = 22;\n    m_pwm_channels[3].config = &m_init_params->channel_22;\n    m_pwm_channels[4].gpio = 23;\n    m_pwm_channels[4].config = &m_init_params->channel_23;\n    m_pwm_channels[5].gpio = 24;\n    m_pwm_channels[5].config = &m_init_params->channel_24;\n    m_pwm_channels[6].gpio = 25;\n    m_pwm_channels[6].config = &m_init_params->channel_25;\n    m_pwm_channels[7].gpio = 27;\n    m_pwm_channels[7].config = &m_init_params->channel_27;\n\n#if defined (RASPBERRY_PI)\n    size_t period = PIGPIO_PERIOD.count();\n\n    std::vector<size_t> rates = { 40000, 20000, 10000, 8000, 5000, 4000, 2500, 2000, 1600, 1250, 1000, 800, 500, 400, 250, 200, 100, 50 };\n    for (auto& f: rates)\n    {\n        auto x = math::round(double(f) \/ double(period));\n        f = static_cast<size_t>(x);\n    }\n\n    \/\/first validate\n    for (size_t i = 0; i < m_pwm_channels.size(); i++)\n    {\n        auto const& ch = *m_pwm_channels[i].config;\n        auto gpio = m_pwm_channels[i].gpio;\n        if (ch.min >= ch.max)\n        {\n            QLOGE(\"channel {}: min ({}) is bigger than max ({})\", gpio, ch.min, ch.max);\n            return false;\n        }\n        if (ch.max > ch.range)\n        {\n            QLOGE(\"channel {}: max ({}) is bigger than the range ({})\", gpio, ch.max, ch.range);\n            return false;\n        }\n        if (std::find(rates.begin(), rates.end(), ch.rate) == rates.end())\n        {\n            QLOGE(\"channel {}: invalid rate {}. Supported are: {}\", gpio, ch.rate, rates);\n            return false;\n        }\n    }\n\n    \/\/first of all turn on the pull-down to that if the board is reset of powerred off the motors don't start spinning\n    \/\/after a restart the GPIO pins are configured as inputs so their state is floating. Most of the time this results in a high pin\n    for (size_t i = 0; i < m_pwm_channels.size(); i++)\n    {\n        auto gpio = m_pwm_channels[i].gpio;\n        if (gpioSetPullUpDown(gpio, PI_PUD_DOWN) < 0)\n        {\n            QLOGE(\"channel {} on GPIO {}: Cannot set pull down mode\", i, gpio);\n            return false;\n        }\n        if (gpioSetMode(gpio, PI_OUTPUT) < 0)\n        {\n            QLOGE(\"channel {} on GPIO {}: Cannot set GPIO mode to output\", i, gpio);\n            return false;\n        }\n     }\n\n    \/\/now configure the pin for PWM or servo\n    for (size_t i = 0; i < m_pwm_channels.size(); i++)\n    {\n        auto const& ch = *m_pwm_channels[i].config;\n        auto gpio = m_pwm_channels[i].gpio;\n        auto f = gpioSetPWMfrequency(gpio, ch.rate);\n        if (f < 0)\n        {\n            QLOGE(\"channel {}: Cannot set pwm rate {}\", gpio, ch.rate);\n            return false;\n        }\n        if (gpioSetPWMrange(gpio, ch.range) < 0)\n        {\n            QLOGE(\"channel {}: Cannot set pwm range {} on gpio {}\", gpio, ch.range);\n            return false;\n        }\n        QLOGI(\"channel {}: rate {} range {}\", gpio, ch.rate, ch.range);\n    }\n\n    return true;\n#else\n    QLOGE(\"PIGPIO only supported on the raspberry pi\");\n    return false;\n#endif\n}\n\nauto PIGPIO::start(q::Clock::time_point tp) -> bool\n{\n    return true;\n}\n\nvoid PIGPIO::set_pwm_value(size_t idx, float value)\n{\n    QLOG_TOPIC(\"pigpio::set_pwm_value\");\n\n#if defined RASPBERRY_PI\n    auto const& ch = *m_pwm_channels[idx].config;\n    value = math::clamp(value, 0.f, 1.f);\n    int pulse = value * (ch.max - ch.min);\n    gpioPWM(m_pwm_channels[idx].gpio, ch.min + pulse);\n#else\n    QUNUSED(idx);\n    QUNUSED(value);\n    QASSERT(0);\n#endif\n}\n\nvoid PIGPIO::process()\n{\n    QLOG_TOPIC(\"pigpio::process\");\n\n    for (size_t i = 0; i < m_pwm_channels.size(); i++)\n    {\n        auto& ch = m_pwm_channels[i];\n        auto stream = ch.stream.lock();\n        if (stream)\n        {\n            auto const& samples = stream->get_samples();\n            if (!samples.empty())\n            {\n\/\/                if (samples.size() > 20)\n\/\/                {\n\/\/                    QLOGW(\"channel {} on GPIO {} is too slow. {} samples are queued\", i, ch.gpio, samples.size());\n\/\/                }\n\n                set_pwm_value(i, samples.back().value);\n            }\n        }\n    }\n}\n\n\n#define READ_CONFIG(IDX, CH)\\\nif (idx == IDX)\\\n{\\\n    auto input_stream = m_hal.get_streams().find_by_name<stream::IPWM>(path.get_as<std::string>());\\\n    auto rate = input_stream ? input_stream->get_rate() : 0u;\\\n    if (rate != m_init_params->channel_##CH.rate)\\\n    {\\\n        if (input_stream)\\\n        {\\\n            QLOGW(\"Bad input stream '{}'. Expected rate {}Hz, got {}Hz\", path, m_init_params->channel_##CH.rate, rate);\\\n        }\\\n        m_pwm_channels[IDX].stream.reset();\\\n        m_pwm_channels[IDX].stream_path = q::Path();\\\n    }\\\n    else\\\n    {\\\n        m_pwm_channels[IDX].stream = input_stream;\\\n        m_pwm_channels[IDX].stream_path = path;\\\n    }\\\n}\n\nvoid PIGPIO::set_input_stream_path(size_t idx, q::Path const& path)\n{\n    READ_CONFIG(0, 4);\n    READ_CONFIG(1, 17);\n    READ_CONFIG(2, 18);\n    READ_CONFIG(3, 22);\n    READ_CONFIG(4, 23);\n    READ_CONFIG(5, 24);\n    READ_CONFIG(6, 25);\n    READ_CONFIG(7, 27);\n}\n\n\nauto PIGPIO::set_config(rapidjson::Value const& json) -> bool\n{\n    QLOG_TOPIC(\"pigpio::set_config\");\n\n    sz::PIGPIO::Config sz;\n    autojsoncxx::error::ErrorStack result;\n    if (!autojsoncxx::from_value(sz, json, result))\n    {\n        std::ostringstream ss;\n        ss << result;\n        QLOGE(\"Cannot deserialize PIGPIO config data: {}\", ss.str());\n        return false;\n    }\n\n    *m_config = sz;\n\n    return true;\n}\nauto PIGPIO::get_config() const -> rapidjson::Document\n{\n    rapidjson::Document json;\n    autojsoncxx::to_document(*m_config, json);\n    return std::move(json);\n}\n\nauto PIGPIO::get_init_params() const -> rapidjson::Document\n{\n    rapidjson::Document json;\n    autojsoncxx::to_document(*m_init_params, json);\n    return std::move(json);\n}\nauto PIGPIO::send_message(rapidjson::Value const& \/*json*\/) -> rapidjson::Document\n{\n    return rapidjson::Document();\n}\n\n\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Copyright (C) 2004-2006 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 \"os\/OsServerTask.h\"\n#include \"os\/OsMsg.h\"\n\n\/\/ EXTERNAL FUNCTIONS\n\/\/ EXTERNAL VARIABLES\n\/\/ CONSTANTS\nconst int OsServerTask::DEF_MAX_MSGS = OsMsgQ::DEF_MAX_MSGS;\n\n\/\/ STATIC VARIABLE INITIALIZATIONS\n\n\/* \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ PUBLIC \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ *\/\n\n\/* ============================ CREATORS ================================== *\/\n\n\/\/ Constructor\nOsServerTask::OsServerTask(const UtlString& name,\n                           void* pArg,\n                           const int maxRequestQMsgs,\n                           const int priority,\n                           const int options,\n                           const int stackSize)\n:  OsTask(name, pArg, priority, options, stackSize),\n   mIncomingQ(maxRequestQMsgs, OsMsgQ::DEF_MAX_MSG_LEN, OsMsgQ::Q_PRIORITY)\n\n   \/\/ other than initialization, no work required\n{\n\/*\n   \/\/ Only useful when debugging queue problems -- very small case and doesn't\n   \/\/ warrant spam in general case -- my opinion anyways.\n\n   if (OsSysLog::willLog(FAC_KERNEL, PRI_INFO))\n   {\n\n           OsSysLog::add(FAC_KERNEL, PRI_INFO,\n                                \"OsServerTask::OsServerTask %s queue: %p queue limit: %d\",\n                                mName.data(), &mIncomingQ, maxRequestQMsgs);\n   }\n*\/\n}\n\n\/\/ Destructor\n\/\/ As part of destroying the task, flush all messages from the incoming\n\/\/ OsMsgQ.\nOsServerTask::~OsServerTask()\n{\n   waitUntilShutDown(20000);  \/\/ upto 20 seconds\n\n   mIncomingQ.flush();    \/\/ dispose of any messages in the request queue\n}\n\n\/* ============================ MANIPULATORS ============================== *\/\n\n\/\/ Handle an incoming message.\n\/\/ This is the message handler of last resort. It should only be called when\n\/\/ the handleMessage() method in the derived class returns FALSE (indicating\n\/\/ that the message has not been handled.\nUtlBoolean OsServerTask::handleMessage(OsMsg& rMsg)\n{\n   UtlBoolean handled;\n\n   handled = FALSE;\n\n   switch (rMsg.getMsgType())\n   {\n   case OsMsg::OS_SHUTDOWN:\n      handled = TRUE;\n      break;\n   default:\n      osPrintf(\n         \"OsServerTask::handleMessage(): msg type is %d.%d, not OS_SHUTDOWN\\n\",\n         rMsg.getMsgType(), rMsg.getMsgSubType());\n   \/\/   assert(FALSE);\n      break;\n   }\n\n   return handled;\n}\n\n\/\/ Post a message to this task.\n\/\/ Return the result of the message send operation.\nOsStatus OsServerTask::postMessage(const OsMsg& rMsg, const OsTime& rTimeout,\n                                   UtlBoolean sentFromISR)\n{\n   OsStatus res;\n\n   if (sentFromISR)\n      res = mIncomingQ.sendFromISR(rMsg);\n   else\n      res = mIncomingQ.send(rMsg, rTimeout);\n   return res;\n}\n\n\/\/ Call OsTask::requestShutdown() and then post an OS_SHUTDOWN message\n\/\/ to the incoming message queue to unblock the task.\nvoid OsServerTask::requestShutdown(void)\n{\n   OsStatus res;\n\n   OsMsg msg(OsMsg::OS_SHUTDOWN, 0);\n\n   OsTask::requestShutdown();\n   res = postMessage(msg);\n   assert(res = OS_SUCCESS);\n}\n\n\/* ============================ ACCESSORS ================================= *\/\n\n\/\/ Get the pointer to the incoming message queue\nOsMsgQ* OsServerTask::getMessageQueue()\n{\n    return(&mIncomingQ);\n}\n\n\/* ============================ INQUIRY =================================== *\/\n\n\/* \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ PROTECTED \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ *\/\n\n\/\/ Waits for a message to arrive on the task's incoming message queue.\nOsStatus OsServerTask::receiveMessage(OsMsg*& rpMsg)\n{\n   return mIncomingQ.receive(rpMsg);\n}\n\n\/\/ Waits for a message to arrive on the task's incoming message queue.\nOsStatus OsServerTask::receiveMessage(OsMsg*& rpMsg,\n                                      const OsTime& rTimeout)\n{\n   return mIncomingQ.receive(rpMsg, rTimeout);\n}\n\n\/\/ The entry point for the task.\n\/\/ This method executes a message processing loop until either\n\/\/ requestShutdown(), deleteForce(), or the destructor for this object\n\/\/ is called.\nint OsServerTask::run(void* pArg)\n{\n   UtlBoolean doShutdown;\n   OsMsg*    pMsg = NULL;\n   OsStatus  res;\n\n   do\n   {\n      res = receiveMessage((OsMsg*&) pMsg);          \/\/ wait for a message\n      assert(res == OS_SUCCESS);\n\n      doShutdown = isShuttingDown();\n      if (!doShutdown)\n      {                                              \/\/ comply with shutdown\n         if (!handleMessage(*pMsg))                  \/\/ process the message\n            OsServerTask::handleMessage(*pMsg);\n      }\n\n      if (!pMsg->getSentFromISR())\n         pMsg->releaseMsg();                         \/\/ free the message\n   }\n   while (!doShutdown);\n\n   return 0;        \/\/ and then exit\n}\n\n\/* \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ PRIVATE \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ *\/\n\n\/* ============================ FUNCTIONS ================================= *\/\n<commit_msg>sipXportLib: Initialize doShutdown variable in OsServerTask::run() beforehand, so there will be no temptation to use it uninitialized.<commit_after>\/\/\n\/\/ Copyright (C) 2004-2006 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 \"os\/OsServerTask.h\"\n#include \"os\/OsMsg.h\"\n\n\/\/ EXTERNAL FUNCTIONS\n\/\/ EXTERNAL VARIABLES\n\/\/ CONSTANTS\nconst int OsServerTask::DEF_MAX_MSGS = OsMsgQ::DEF_MAX_MSGS;\n\n\/\/ STATIC VARIABLE INITIALIZATIONS\n\n\/* \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ PUBLIC \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ *\/\n\n\/* ============================ CREATORS ================================== *\/\n\n\/\/ Constructor\nOsServerTask::OsServerTask(const UtlString& name,\n                           void* pArg,\n                           const int maxRequestQMsgs,\n                           const int priority,\n                           const int options,\n                           const int stackSize)\n:  OsTask(name, pArg, priority, options, stackSize),\n   mIncomingQ(maxRequestQMsgs, OsMsgQ::DEF_MAX_MSG_LEN, OsMsgQ::Q_PRIORITY)\n\n   \/\/ other than initialization, no work required\n{\n\/*\n   \/\/ Only useful when debugging queue problems -- very small case and doesn't\n   \/\/ warrant spam in general case -- my opinion anyways.\n\n   if (OsSysLog::willLog(FAC_KERNEL, PRI_INFO))\n   {\n\n           OsSysLog::add(FAC_KERNEL, PRI_INFO,\n                                \"OsServerTask::OsServerTask %s queue: %p queue limit: %d\",\n                                mName.data(), &mIncomingQ, maxRequestQMsgs);\n   }\n*\/\n}\n\n\/\/ Destructor\n\/\/ As part of destroying the task, flush all messages from the incoming\n\/\/ OsMsgQ.\nOsServerTask::~OsServerTask()\n{\n   waitUntilShutDown(20000);  \/\/ upto 20 seconds\n\n   mIncomingQ.flush();    \/\/ dispose of any messages in the request queue\n}\n\n\/* ============================ MANIPULATORS ============================== *\/\n\n\/\/ Handle an incoming message.\n\/\/ This is the message handler of last resort. It should only be called when\n\/\/ the handleMessage() method in the derived class returns FALSE (indicating\n\/\/ that the message has not been handled.\nUtlBoolean OsServerTask::handleMessage(OsMsg& rMsg)\n{\n   UtlBoolean handled;\n\n   handled = FALSE;\n\n   switch (rMsg.getMsgType())\n   {\n   case OsMsg::OS_SHUTDOWN:\n      handled = TRUE;\n      break;\n   default:\n      osPrintf(\n         \"OsServerTask::handleMessage(): msg type is %d.%d, not OS_SHUTDOWN\\n\",\n         rMsg.getMsgType(), rMsg.getMsgSubType());\n   \/\/   assert(FALSE);\n      break;\n   }\n\n   return handled;\n}\n\n\/\/ Post a message to this task.\n\/\/ Return the result of the message send operation.\nOsStatus OsServerTask::postMessage(const OsMsg& rMsg, const OsTime& rTimeout,\n                                   UtlBoolean sentFromISR)\n{\n   OsStatus res;\n\n   if (sentFromISR)\n      res = mIncomingQ.sendFromISR(rMsg);\n   else\n      res = mIncomingQ.send(rMsg, rTimeout);\n   return res;\n}\n\n\/\/ Call OsTask::requestShutdown() and then post an OS_SHUTDOWN message\n\/\/ to the incoming message queue to unblock the task.\nvoid OsServerTask::requestShutdown(void)\n{\n   OsStatus res;\n\n   OsMsg msg(OsMsg::OS_SHUTDOWN, 0);\n\n   OsTask::requestShutdown();\n   res = postMessage(msg);\n   assert(res = OS_SUCCESS);\n}\n\n\/* ============================ ACCESSORS ================================= *\/\n\n\/\/ Get the pointer to the incoming message queue\nOsMsgQ* OsServerTask::getMessageQueue()\n{\n    return(&mIncomingQ);\n}\n\n\/* ============================ INQUIRY =================================== *\/\n\n\/* \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ PROTECTED \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ *\/\n\n\/\/ Waits for a message to arrive on the task's incoming message queue.\nOsStatus OsServerTask::receiveMessage(OsMsg*& rpMsg)\n{\n   return mIncomingQ.receive(rpMsg);\n}\n\n\/\/ Waits for a message to arrive on the task's incoming message queue.\nOsStatus OsServerTask::receiveMessage(OsMsg*& rpMsg,\n                                      const OsTime& rTimeout)\n{\n   return mIncomingQ.receive(rpMsg, rTimeout);\n}\n\n\/\/ The entry point for the task.\n\/\/ This method executes a message processing loop until either\n\/\/ requestShutdown(), deleteForce(), or the destructor for this object\n\/\/ is called.\nint OsServerTask::run(void* pArg)\n{\n   UtlBoolean doShutdown = FALSE;\n   OsMsg*    pMsg = NULL;\n   OsStatus  res;\n\n   do\n   {\n      res = receiveMessage((OsMsg*&) pMsg);          \/\/ wait for a message\n      assert(res == OS_SUCCESS);\n\n      doShutdown = isShuttingDown();\n      if (!doShutdown)\n      {                                              \/\/ comply with shutdown\n         if (!handleMessage(*pMsg))                  \/\/ process the message\n            OsServerTask::handleMessage(*pMsg);\n      }\n\n      if (!pMsg->getSentFromISR())\n         pMsg->releaseMsg();                         \/\/ free the message\n   }\n   while (!doShutdown);\n\n   return 0;        \/\/ and then exit\n}\n\n\/* \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ PRIVATE \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ *\/\n\n\/* ============================ FUNCTIONS ================================= *\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"server\/configuration_impl.h\"\n\n#include <chrono>\n#include <list>\n#include <memory>\n#include <string>\n#include <vector>\n\n#include \"envoy\/common\/exception.h\"\n#include \"envoy\/config\/bootstrap\/v3\/bootstrap.pb.h\"\n#include \"envoy\/config\/metrics\/v3\/stats.pb.h\"\n#include \"envoy\/config\/trace\/v3\/http_tracer.pb.h\"\n#include \"envoy\/network\/connection.h\"\n#include \"envoy\/runtime\/runtime.h\"\n#include \"envoy\/server\/instance.h\"\n#include \"envoy\/server\/tracer_config.h\"\n#include \"envoy\/ssl\/context_manager.h\"\n\n#include \"common\/common\/assert.h\"\n#include \"common\/common\/utility.h\"\n#include \"common\/config\/runtime_utility.h\"\n#include \"common\/config\/utility.h\"\n#include \"common\/network\/socket_option_factory.h\"\n#include \"common\/protobuf\/utility.h\"\n\nnamespace Envoy {\nnamespace Server {\nnamespace Configuration {\n\nbool FilterChainUtility::buildFilterChain(Network::FilterManager& filter_manager,\n                                          const std::vector<Network::FilterFactoryCb>& factories) {\n  for (const Network::FilterFactoryCb& factory : factories) {\n    factory(filter_manager);\n  }\n\n  return filter_manager.initializeReadFilters();\n}\n\nbool FilterChainUtility::buildFilterChain(\n    Network::ListenerFilterManager& filter_manager,\n    const std::vector<Network::ListenerFilterFactoryCb>& factories) {\n  for (const Network::ListenerFilterFactoryCb& factory : factories) {\n    factory(filter_manager);\n  }\n\n  return true;\n}\n\nvoid FilterChainUtility::buildUdpFilterChain(\n    Network::UdpListenerFilterManager& filter_manager, Network::UdpReadFilterCallbacks& callbacks,\n    const std::vector<Network::UdpListenerFilterFactoryCb>& factories) {\n  for (const Network::UdpListenerFilterFactoryCb& factory : factories) {\n    factory(filter_manager, callbacks);\n  }\n}\n\nStatsConfigImpl::StatsConfigImpl(const envoy::config::bootstrap::v3::Bootstrap& bootstrap) {\n  if (bootstrap.has_stats_flush_interval() &&\n      bootstrap.stats_flush_case() !=\n          envoy::config::bootstrap::v3::Bootstrap::STATS_FLUSH_NOT_SET) {\n    throw EnvoyException(\"Only one of stats_flush_interval or stats_flush_on_admin should be set!\");\n  }\n\n  flush_interval_ =\n      std::chrono::milliseconds(PROTOBUF_GET_MS_OR_DEFAULT(bootstrap, stats_flush_interval, 5000));\n\n  if (bootstrap.stats_flush_case() == envoy::config::bootstrap::v3::Bootstrap::kStatsFlushOnAdmin) {\n    flush_on_admin_ = bootstrap.stats_flush_on_admin();\n  }\n}\n\nvoid MainImpl::initialize(const envoy::config::bootstrap::v3::Bootstrap& bootstrap,\n                          Instance& server,\n                          Upstream::ClusterManagerFactory& cluster_manager_factory) {\n  \/\/ In order to support dynamic configuration of tracing providers,\n  \/\/ a former server-wide HttpTracer singleton has been replaced by\n  \/\/ an HttpTracer instance per \"envoy.filters.network.http_connection_manager\" filter.\n  \/\/ Tracing configuration as part of bootstrap config is still supported,\n  \/\/ however, it's become mandatory to process it prior to static Listeners.\n  \/\/ Otherwise, static Listeners will be configured in assumption that\n  \/\/ tracing configuration is missing from the bootstrap config.\n  initializeTracers(bootstrap.tracing(), server);\n\n  const auto& secrets = bootstrap.static_resources().secrets();\n  ENVOY_LOG(info, \"loading {} static secret(s)\", secrets.size());\n  for (ssize_t i = 0; i < secrets.size(); i++) {\n    ENVOY_LOG(debug, \"static secret #{}: {}\", i, secrets[i].name());\n    server.secretManager().addStaticSecret(secrets[i]);\n  }\n\n  ENVOY_LOG(info, \"loading {} cluster(s)\", bootstrap.static_resources().clusters().size());\n  cluster_manager_ = cluster_manager_factory.clusterManagerFromProto(bootstrap);\n\n  const auto& listeners = bootstrap.static_resources().listeners();\n  ENVOY_LOG(info, \"loading {} listener(s)\", listeners.size());\n  for (ssize_t i = 0; i < listeners.size(); i++) {\n    ENVOY_LOG(debug, \"listener #{}:\", i);\n    server.listenerManager().addOrUpdateListener(listeners[i], \"\", false);\n  }\n\n  initializeWatchdogs(bootstrap, server);\n  initializeStatsConfig(bootstrap, server);\n}\n\nvoid MainImpl::initializeStatsConfig(const envoy::config::bootstrap::v3::Bootstrap& bootstrap,\n                                     Instance& server) {\n  ENVOY_LOG(info, \"loading stats configuration\");\n\n  \/\/ stats_config_ should be set before populating the sinks so that it is available\n  \/\/ from the ServerFactoryContext when creating the stats sinks.\n  stats_config_ = std::make_unique<StatsConfigImpl>(bootstrap);\n\n  for (const envoy::config::metrics::v3::StatsSink& sink_object : bootstrap.stats_sinks()) {\n    \/\/ Generate factory and translate stats sink custom config.\n    auto& factory = Config::Utility::getAndCheckFactory<StatsSinkFactory>(sink_object);\n    ProtobufTypes::MessagePtr message = Config::Utility::translateToFactoryConfig(\n        sink_object, server.messageValidationContext().staticValidationVisitor(), factory);\n\n    stats_config_->addSink(factory.createStatsSink(*message, server.serverFactoryContext()));\n  }\n}\n\nvoid MainImpl::initializeTracers(const envoy::config::trace::v3::Tracing& configuration,\n                                 Instance& server) {\n  ENVOY_LOG(info, \"loading tracing configuration\");\n\n  \/\/ Default tracing configuration must be set prior to processing of static Listeners begins.\n  server.setDefaultTracingConfig(configuration);\n\n  if (!configuration.has_http()) {\n    return;\n  }\n\n  \/\/ Validating tracing configuration (minimally).\n  ENVOY_LOG(info, \"  validating default server-wide tracing driver: {}\",\n            configuration.http().name());\n\n  \/\/ Now see if there is a factory that will accept the config.\n  auto& factory = Config::Utility::getAndCheckFactory<TracerFactory>(configuration.http());\n  ProtobufTypes::MessagePtr message = Config::Utility::translateToFactoryConfig(\n      configuration.http(), server.messageValidationContext().staticValidationVisitor(), factory);\n\n  \/\/ Notice that the actual HttpTracer instance will be created on demand\n  \/\/ in the context of \"envoy.filters.network.http_connection_manager\" filter.\n  \/\/ The side effect of this is that provider-specific configuration\n  \/\/ is no longer validated in this step.\n}\n\nvoid MainImpl::initializeWatchdogs(const envoy::config::bootstrap::v3::Bootstrap& bootstrap,\n                                   Instance& server) {\n  if (bootstrap.has_watchdog() && bootstrap.has_watchdogs()) {\n    throw EnvoyException(\"Only one of watchdog or watchdogs should be set!\");\n  }\n\n  if (bootstrap.has_watchdog()) {\n    main_thread_watchdog_ = std::make_unique<WatchdogImpl>(bootstrap.watchdog(), server);\n    worker_watchdog_ = std::make_unique<WatchdogImpl>(bootstrap.watchdog(), server);\n  } else {\n    main_thread_watchdog_ =\n        std::make_unique<WatchdogImpl>(bootstrap.watchdogs().main_thread_watchdog(), server);\n    worker_watchdog_ =\n        std::make_unique<WatchdogImpl>(bootstrap.watchdogs().worker_watchdog(), server);\n  }\n}\n\nWatchdogImpl::WatchdogImpl(const envoy::config::bootstrap::v3::Watchdog& watchdog,\n                           Instance& server) {\n  miss_timeout_ =\n      std::chrono::milliseconds(PROTOBUF_GET_MS_OR_DEFAULT(watchdog, miss_timeout, 200));\n  megamiss_timeout_ =\n      std::chrono::milliseconds(PROTOBUF_GET_MS_OR_DEFAULT(watchdog, megamiss_timeout, 1000));\n\n  uint64_t kill_timeout = PROTOBUF_GET_MS_OR_DEFAULT(watchdog, kill_timeout, 0);\n  const uint64_t max_kill_timeout_jitter =\n      PROTOBUF_GET_MS_OR_DEFAULT(watchdog, max_kill_timeout_jitter, 0);\n\n  \/\/ Adjust kill timeout if we have skew enabled.\n  if (kill_timeout > 0 && max_kill_timeout_jitter > 0) {\n    \/\/ Increments the kill timeout with a random value in (0, max_skew].\n    \/\/ We shouldn't have overflow issues due to the range of Duration.\n    \/\/ This won't be entirely uniform, depending on how large max_skew\n    \/\/ is relation to uint64.\n    kill_timeout += (server.api().randomGenerator().random() % max_kill_timeout_jitter) + 1;\n  }\n\n  kill_timeout_ = std::chrono::milliseconds(kill_timeout);\n  multikill_timeout_ =\n      std::chrono::milliseconds(PROTOBUF_GET_MS_OR_DEFAULT(watchdog, multikill_timeout, 0));\n  multikill_threshold_ = PROTOBUF_PERCENT_TO_DOUBLE_OR_DEFAULT(watchdog, multikill_threshold, 0.0);\n  actions_ = watchdog.actions();\n}\n\nInitialImpl::InitialImpl(const envoy::config::bootstrap::v3::Bootstrap& bootstrap,\n                         const Options& options)\n    : enable_deprecated_v2_api_(options.bootstrapVersion() == 2) {\n  const auto& admin = bootstrap.admin();\n  admin_.access_log_path_ = admin.access_log_path();\n  admin_.profile_path_ =\n      admin.profile_path().empty() ? \"\/var\/log\/envoy\/envoy.prof\" : admin.profile_path();\n  if (admin.has_address()) {\n    admin_.address_ = Network::Address::resolveProtoAddress(admin.address());\n  }\n  admin_.socket_options_ = std::make_shared<std::vector<Network::Socket::OptionConstSharedPtr>>();\n  if (!admin.socket_options().empty()) {\n    Network::Socket::appendOptions(\n        admin_.socket_options_,\n        Network::SocketOptionFactory::buildLiteralOptions(admin.socket_options()));\n  }\n\n  if (!bootstrap.flags_path().empty()) {\n    flags_path_ = bootstrap.flags_path();\n  }\n\n  if (bootstrap.has_layered_runtime()) {\n    layered_runtime_.MergeFrom(bootstrap.layered_runtime());\n    if (layered_runtime_.layers().empty()) {\n      layered_runtime_.add_layers()->mutable_admin_layer();\n    }\n  } else {\n    Config::translateRuntime(bootstrap.hidden_envoy_deprecated_runtime(), layered_runtime_);\n  }\n  if (enable_deprecated_v2_api_) {\n    auto* enabled_deprecated_v2_api_layer = layered_runtime_.add_layers();\n    enabled_deprecated_v2_api_layer->set_name(\"enabled_deprecated_v2_api (auto-injected)\");\n    auto* static_layer = enabled_deprecated_v2_api_layer->mutable_static_layer();\n    ProtobufWkt::Value val;\n    val.set_bool_value(true);\n    (*static_layer->mutable_fields())[\"envoy.reloadable_features.enable_deprecated_v2_api\"] = val;\n  }\n}\n\n} \/\/ namespace Configuration\n} \/\/ namespace Server\n} \/\/ namespace Envoy\n<commit_msg>configuration impl: add cast for ios compilation (#14590)<commit_after>#include \"server\/configuration_impl.h\"\n\n#include <chrono>\n#include <list>\n#include <memory>\n#include <string>\n#include <vector>\n\n#include \"envoy\/common\/exception.h\"\n#include \"envoy\/config\/bootstrap\/v3\/bootstrap.pb.h\"\n#include \"envoy\/config\/metrics\/v3\/stats.pb.h\"\n#include \"envoy\/config\/trace\/v3\/http_tracer.pb.h\"\n#include \"envoy\/network\/connection.h\"\n#include \"envoy\/runtime\/runtime.h\"\n#include \"envoy\/server\/instance.h\"\n#include \"envoy\/server\/tracer_config.h\"\n#include \"envoy\/ssl\/context_manager.h\"\n\n#include \"common\/common\/assert.h\"\n#include \"common\/common\/utility.h\"\n#include \"common\/config\/runtime_utility.h\"\n#include \"common\/config\/utility.h\"\n#include \"common\/network\/socket_option_factory.h\"\n#include \"common\/protobuf\/utility.h\"\n\nnamespace Envoy {\nnamespace Server {\nnamespace Configuration {\n\nbool FilterChainUtility::buildFilterChain(Network::FilterManager& filter_manager,\n                                          const std::vector<Network::FilterFactoryCb>& factories) {\n  for (const Network::FilterFactoryCb& factory : factories) {\n    factory(filter_manager);\n  }\n\n  return filter_manager.initializeReadFilters();\n}\n\nbool FilterChainUtility::buildFilterChain(\n    Network::ListenerFilterManager& filter_manager,\n    const std::vector<Network::ListenerFilterFactoryCb>& factories) {\n  for (const Network::ListenerFilterFactoryCb& factory : factories) {\n    factory(filter_manager);\n  }\n\n  return true;\n}\n\nvoid FilterChainUtility::buildUdpFilterChain(\n    Network::UdpListenerFilterManager& filter_manager, Network::UdpReadFilterCallbacks& callbacks,\n    const std::vector<Network::UdpListenerFilterFactoryCb>& factories) {\n  for (const Network::UdpListenerFilterFactoryCb& factory : factories) {\n    factory(filter_manager, callbacks);\n  }\n}\n\nStatsConfigImpl::StatsConfigImpl(const envoy::config::bootstrap::v3::Bootstrap& bootstrap) {\n  if (bootstrap.has_stats_flush_interval() &&\n      bootstrap.stats_flush_case() !=\n          envoy::config::bootstrap::v3::Bootstrap::STATS_FLUSH_NOT_SET) {\n    throw EnvoyException(\"Only one of stats_flush_interval or stats_flush_on_admin should be set!\");\n  }\n\n  flush_interval_ =\n      std::chrono::milliseconds(PROTOBUF_GET_MS_OR_DEFAULT(bootstrap, stats_flush_interval, 5000));\n\n  if (bootstrap.stats_flush_case() == envoy::config::bootstrap::v3::Bootstrap::kStatsFlushOnAdmin) {\n    flush_on_admin_ = bootstrap.stats_flush_on_admin();\n  }\n}\n\nvoid MainImpl::initialize(const envoy::config::bootstrap::v3::Bootstrap& bootstrap,\n                          Instance& server,\n                          Upstream::ClusterManagerFactory& cluster_manager_factory) {\n  \/\/ In order to support dynamic configuration of tracing providers,\n  \/\/ a former server-wide HttpTracer singleton has been replaced by\n  \/\/ an HttpTracer instance per \"envoy.filters.network.http_connection_manager\" filter.\n  \/\/ Tracing configuration as part of bootstrap config is still supported,\n  \/\/ however, it's become mandatory to process it prior to static Listeners.\n  \/\/ Otherwise, static Listeners will be configured in assumption that\n  \/\/ tracing configuration is missing from the bootstrap config.\n  initializeTracers(bootstrap.tracing(), server);\n\n  const auto& secrets = bootstrap.static_resources().secrets();\n  ENVOY_LOG(info, \"loading {} static secret(s)\", secrets.size());\n  for (ssize_t i = 0; i < secrets.size(); i++) {\n    ENVOY_LOG(debug, \"static secret #{}: {}\", i, secrets[i].name());\n    server.secretManager().addStaticSecret(secrets[i]);\n  }\n\n  ENVOY_LOG(info, \"loading {} cluster(s)\", bootstrap.static_resources().clusters().size());\n  cluster_manager_ = cluster_manager_factory.clusterManagerFromProto(bootstrap);\n\n  const auto& listeners = bootstrap.static_resources().listeners();\n  ENVOY_LOG(info, \"loading {} listener(s)\", listeners.size());\n  for (ssize_t i = 0; i < listeners.size(); i++) {\n    ENVOY_LOG(debug, \"listener #{}:\", i);\n    server.listenerManager().addOrUpdateListener(listeners[i], \"\", false);\n  }\n\n  initializeWatchdogs(bootstrap, server);\n  initializeStatsConfig(bootstrap, server);\n}\n\nvoid MainImpl::initializeStatsConfig(const envoy::config::bootstrap::v3::Bootstrap& bootstrap,\n                                     Instance& server) {\n  ENVOY_LOG(info, \"loading stats configuration\");\n\n  \/\/ stats_config_ should be set before populating the sinks so that it is available\n  \/\/ from the ServerFactoryContext when creating the stats sinks.\n  stats_config_ = std::make_unique<StatsConfigImpl>(bootstrap);\n\n  for (const envoy::config::metrics::v3::StatsSink& sink_object : bootstrap.stats_sinks()) {\n    \/\/ Generate factory and translate stats sink custom config.\n    auto& factory = Config::Utility::getAndCheckFactory<StatsSinkFactory>(sink_object);\n    ProtobufTypes::MessagePtr message = Config::Utility::translateToFactoryConfig(\n        sink_object, server.messageValidationContext().staticValidationVisitor(), factory);\n\n    stats_config_->addSink(factory.createStatsSink(*message, server.serverFactoryContext()));\n  }\n}\n\nvoid MainImpl::initializeTracers(const envoy::config::trace::v3::Tracing& configuration,\n                                 Instance& server) {\n  ENVOY_LOG(info, \"loading tracing configuration\");\n\n  \/\/ Default tracing configuration must be set prior to processing of static Listeners begins.\n  server.setDefaultTracingConfig(configuration);\n\n  if (!configuration.has_http()) {\n    return;\n  }\n\n  \/\/ Validating tracing configuration (minimally).\n  ENVOY_LOG(info, \"  validating default server-wide tracing driver: {}\",\n            configuration.http().name());\n\n  \/\/ Now see if there is a factory that will accept the config.\n  auto& factory = Config::Utility::getAndCheckFactory<TracerFactory>(configuration.http());\n  ProtobufTypes::MessagePtr message = Config::Utility::translateToFactoryConfig(\n      configuration.http(), server.messageValidationContext().staticValidationVisitor(), factory);\n\n  \/\/ Notice that the actual HttpTracer instance will be created on demand\n  \/\/ in the context of \"envoy.filters.network.http_connection_manager\" filter.\n  \/\/ The side effect of this is that provider-specific configuration\n  \/\/ is no longer validated in this step.\n}\n\nvoid MainImpl::initializeWatchdogs(const envoy::config::bootstrap::v3::Bootstrap& bootstrap,\n                                   Instance& server) {\n  if (bootstrap.has_watchdog() && bootstrap.has_watchdogs()) {\n    throw EnvoyException(\"Only one of watchdog or watchdogs should be set!\");\n  }\n\n  if (bootstrap.has_watchdog()) {\n    main_thread_watchdog_ = std::make_unique<WatchdogImpl>(bootstrap.watchdog(), server);\n    worker_watchdog_ = std::make_unique<WatchdogImpl>(bootstrap.watchdog(), server);\n  } else {\n    main_thread_watchdog_ =\n        std::make_unique<WatchdogImpl>(bootstrap.watchdogs().main_thread_watchdog(), server);\n    worker_watchdog_ =\n        std::make_unique<WatchdogImpl>(bootstrap.watchdogs().worker_watchdog(), server);\n  }\n}\n\nWatchdogImpl::WatchdogImpl(const envoy::config::bootstrap::v3::Watchdog& watchdog,\n                           Instance& server) {\n  miss_timeout_ =\n      std::chrono::milliseconds(PROTOBUF_GET_MS_OR_DEFAULT(watchdog, miss_timeout, 200));\n  megamiss_timeout_ =\n      std::chrono::milliseconds(PROTOBUF_GET_MS_OR_DEFAULT(watchdog, megamiss_timeout, 1000));\n\n  uint64_t kill_timeout = PROTOBUF_GET_MS_OR_DEFAULT(watchdog, kill_timeout, 0);\n  const uint64_t max_kill_timeout_jitter =\n      PROTOBUF_GET_MS_OR_DEFAULT(watchdog, max_kill_timeout_jitter, 0);\n\n  \/\/ Adjust kill timeout if we have skew enabled.\n  if (kill_timeout > 0 && max_kill_timeout_jitter > 0) {\n    \/\/ Increments the kill timeout with a random value in (0, max_skew].\n    \/\/ We shouldn't have overflow issues due to the range of Duration.\n    \/\/ This won't be entirely uniform, depending on how large max_skew\n    \/\/ is relation to uint64.\n    kill_timeout += (server.api().randomGenerator().random() % max_kill_timeout_jitter) + 1;\n  }\n\n  kill_timeout_ = std::chrono::milliseconds(kill_timeout);\n  multikill_timeout_ =\n      std::chrono::milliseconds(PROTOBUF_GET_MS_OR_DEFAULT(watchdog, multikill_timeout, 0));\n  multikill_threshold_ = PROTOBUF_PERCENT_TO_DOUBLE_OR_DEFAULT(watchdog, multikill_threshold, 0.0);\n  actions_ = watchdog.actions();\n}\n\nInitialImpl::InitialImpl(const envoy::config::bootstrap::v3::Bootstrap& bootstrap,\n                         const Options& options)\n    : enable_deprecated_v2_api_(options.bootstrapVersion() == 2u) {\n  const auto& admin = bootstrap.admin();\n  admin_.access_log_path_ = admin.access_log_path();\n  admin_.profile_path_ =\n      admin.profile_path().empty() ? \"\/var\/log\/envoy\/envoy.prof\" : admin.profile_path();\n  if (admin.has_address()) {\n    admin_.address_ = Network::Address::resolveProtoAddress(admin.address());\n  }\n  admin_.socket_options_ = std::make_shared<std::vector<Network::Socket::OptionConstSharedPtr>>();\n  if (!admin.socket_options().empty()) {\n    Network::Socket::appendOptions(\n        admin_.socket_options_,\n        Network::SocketOptionFactory::buildLiteralOptions(admin.socket_options()));\n  }\n\n  if (!bootstrap.flags_path().empty()) {\n    flags_path_ = bootstrap.flags_path();\n  }\n\n  if (bootstrap.has_layered_runtime()) {\n    layered_runtime_.MergeFrom(bootstrap.layered_runtime());\n    if (layered_runtime_.layers().empty()) {\n      layered_runtime_.add_layers()->mutable_admin_layer();\n    }\n  } else {\n    Config::translateRuntime(bootstrap.hidden_envoy_deprecated_runtime(), layered_runtime_);\n  }\n  if (enable_deprecated_v2_api_) {\n    auto* enabled_deprecated_v2_api_layer = layered_runtime_.add_layers();\n    enabled_deprecated_v2_api_layer->set_name(\"enabled_deprecated_v2_api (auto-injected)\");\n    auto* static_layer = enabled_deprecated_v2_api_layer->mutable_static_layer();\n    ProtobufWkt::Value val;\n    val.set_bool_value(true);\n    (*static_layer->mutable_fields())[\"envoy.reloadable_features.enable_deprecated_v2_api\"] = val;\n  }\n}\n\n} \/\/ namespace Configuration\n} \/\/ namespace Server\n} \/\/ namespace Envoy\n<|endoftext|>"}
{"text":"<commit_before>#include <QFile>\n#include <QMessageBox>\n#include \"RepeatExpansionWidget.h\"\n#include \"ui_RepeatExpansionWidget.h\"\n#include \"Helper.h\"\n#include \"GUIHelper.h\"\n#include \"TsvFile.h\"\n#include \"VcfFile.h\"\n\nNumericWidgetItem::NumericWidgetItem(QString text):\n\tQTableWidgetItem(text)\n{\n\tsetTextAlignment(Qt::AlignRight);\n\t\/\/ make cell readonly\n\tsetFlags(flags() & (~Qt::ItemIsEditable));\n}\n\nbool NumericWidgetItem::operator<(const QTableWidgetItem& other) const\n{\n\t\/\/convert text to double\n\tdouble this_value = Helper::toDouble(text());\n\tdouble other_value = Helper::toDouble(other.text());\n\treturn (this_value < other_value);\n}\n\nRepeatExpansionWidget::RepeatExpansionWidget(QString vcf_filename, bool is_exome, QWidget* parent):\n\tQWidget(parent),\n\tvcf_filename_(vcf_filename),\n\tis_exome_(is_exome),\n\tui_(new Ui::RepeatExpansionWidget)\n{\n\tui_->setupUi(this);\n\tloadRepeatExpansionData();\n}\n\nRepeatExpansionWidget::~RepeatExpansionWidget()\n{\n\tdelete ui_;\n}\n\nvoid RepeatExpansionWidget::loadRepeatExpansionData()\n{\n\t\/\/load VCF file\n\tVcfFile repeat_expansions;\n\trepeat_expansions.load(vcf_filename_);\n\n\t\/\/load filter file\n\tQMap<QPair<QByteArray,QByteArray>, RepeatCutoffInfo> cutoff_info_map;\n\tQStringList cutoff_file_content = Helper::loadTextFile(\":\/Resources\/repeat_expansion_cutoffs.tsv\", false);\n\n\tforeach(const QString& line, cutoff_file_content)\n\t{\n\t\t\/\/ skip empty lines and comments\n\t\tif((line==\"\") || (line.startsWith(\"#\"))) continue;\n\n\t\t\/\/parse line\n\t\tQStringList split_line = line.split('\\t');\n\t\tif (split_line.size() < 7) THROW(FileParseException, \"Error parsing repeat expansion file: file has to contain 7 tab-separated columns!\");\n\t\tRepeatCutoffInfo repeat_cutoff;\n\n\t\trepeat_cutoff.repeat_id = split_line.at(0).trimmed().toUtf8();\n\t\trepeat_cutoff.repeat_unit = split_line.at(1).trimmed().toUtf8();\n\t\tif(split_line.at(2).trimmed() == \"\") repeat_cutoff.max_normal = -1;\n\t\telse repeat_cutoff.max_normal = Helper::toInt(split_line.at(2));\n\t\tif(split_line.at(3).trimmed() == \"\") repeat_cutoff.min_pathogenic = -1;\n\t\telse repeat_cutoff.min_pathogenic = Helper::toInt(split_line.at(3));\n\t\trepeat_cutoff.inheritance = split_line.at(4).trimmed().toUtf8();\n\n\n\t\t\/\/parse exome reliability\n\t\tQByteArray reliable_in_exomes = split_line.at(5).trimmed().toUtf8();\n\t\tif(reliable_in_exomes == \"0\") repeat_cutoff.reliable_in_exomes = false;\n\t\telse repeat_cutoff.reliable_in_exomes = true;\n\t\t\/\/parse additional info\n\t\tQByteArrayList additional_info = split_line.at(6).trimmed().toUtf8().split(';');\n\t\tforeach(const QByteArray& info, additional_info)\n\t\t{\n\t\t\tif(info.trimmed() != \"\") repeat_cutoff.additional_info.append(info.trimmed());\n\t\t}\n\n\t\tcutoff_info_map.insert(QPair<QByteArray,QByteArray>(repeat_cutoff.repeat_id, repeat_cutoff.repeat_unit), repeat_cutoff);\n\t}\n\n\t\/\/create table\n\n\t\/\/define columns\n\tQStringList column_names;\n\tQVector<bool> numeric_columns;\n\tQStringList description;\n\tcolumn_names << \"chr\" << \"start\" << \"end\" << \"repeat_id\" << \"repeat_unit\"\n\t\t\t\t << \"repeats\" << \"wt_repeat\" << \"repeat_ci\"<< \"filter\" << \"locus_coverage\"\n\t\t\t\t << \"reads_flanking\" << \"reads_in_repeat\" << \"reads_spanning\";\n\tnumeric_columns << false << true << true << false << false << false << true << false << true << false << false << false;\n\tdescription << \"\"\n\t\t\t\t<< \"\"\n\t\t\t\t<< \"\"\n\t\t\t\t<< \"Repeat identifier as specified in the variant catalog\"\n\t\t\t\t<< \"Repeat unit in the reference orientation\"\n\t\t\t\t<< \"Number of repeat units spanned by the allele\"\n\t\t\t\t<< \"Reference repeat count\"\n\t\t\t\t<< \"Confidence interval for allele copy number\"\n\t\t\t\t<< QString(\"Filter:\\n\")\n\t\t\t\t   + \"  PASS:\\t\\tAll filters passed\\n\"\n\t\t\t\t   + \"  LowDepth:\\tThe overall locus depth is below 10x or number of reads spanning one or both breakends is below 5.\"\n\t\t\t\t<< \"Locus coverage\"\n\t\t\t\t<< \"Number of flanking reads consistent with the allele\"\n\t\t\t\t<< \"Number of in-repeat reads consistent with the allele\"\n\t\t\t\t<< \"Number of spanning reads consistent with the allele\";\n\n\n\t\/\/create header\n\tui_->repeat_expansions->setColumnCount(column_names.size());\n\tfor (int col_idx = 0; col_idx < column_names.size(); ++col_idx)\n\t{\n\t\tui_->repeat_expansions->setHorizontalHeaderItem(col_idx, new QTableWidgetItem(column_names.at(col_idx)));\n\t\tif (description.at(col_idx) != \"\")\n\t\t{\n\t\t\tui_->repeat_expansions->horizontalHeaderItem(col_idx)->setToolTip(description.at(col_idx));\n\t\t}\n\t}\n\n\t\/\/ check that there is exactly one sample\n\tQByteArrayList samples = repeat_expansions.sampleIDs();\n\tif (samples.count()!=1)\n\t{\n\t\tTHROW(ArgumentException, \"Repeat expansion VCF file '\" + vcf_filename_ + \"' does not contain exactly one sample!\");\n\t}\n\n\t\/\/ define table backround colors\n\tQColor bg_red = Qt::red;\n\tbg_red.setAlphaF(0.5);\n\tQColor bg_green = Qt::darkGreen;\n\tbg_green.setAlphaF(0.5);\n\tQColor bg_orange = QColor(255, 135, 60);\n\tbg_orange.setAlphaF(0.5);\n\n\n\t\/\/ fill table widget with variants\/repeat expansions\n\tui_->repeat_expansions->setRowCount(repeat_expansions.count());\n\tfor(int row_idx=0; row_idx<repeat_expansions.count(); ++row_idx)\n\t{\n\t\tconst VcfLine& re = repeat_expansions[row_idx];\n\t\tint col_idx = 0;\n\n\t\t\/\/extract info\/format values\n\t\tQByteArray info_repid = re.info(\"REPID\").trimmed();\n\t\tQByteArray info_ru = re.info(\"RU\").trimmed();\n\t\tQByteArray info_end = re.info(\"END\").trimmed();\n\t\tQByteArray info_ref = re.info(\"REF\").trimmed();\n\n\t\tQByteArray format_repcn = re.formatValueFromSample(\"REPCN\").trimmed();\n\t\tQByteArray format_repci = re.formatValueFromSample(\"REPCI\").trimmed();\n\t\tQByteArray format_lc = re.formatValueFromSample(\"LC\").trimmed();\n\t\tQByteArray format_adfl = re.formatValueFromSample(\"ADFL\").trimmed();\n\t\tQByteArray format_adir = re.formatValueFromSample(\"ADIR\").trimmed();\n\t\tQByteArray format_adsp = re.formatValueFromSample(\"ADSP\").trimmed();\n\n\t\t\/\/ get cutoff\/reliability info from cutoff file\n\t\tQPair<QByteArray, QByteArray> key = QPair<QByteArray, QByteArray>(info_repid, info_ru);\n\t\tif(!cutoff_info_map.contains(key))\n\t\t{\n\t\t\tTHROW(FileParseException, \"Repeat '\" + info_repid + \", \" + info_ru + \"' not fout in cutoff file!\");\n\t\t}\n\t\tRepeatCutoffInfo cutoff_info = cutoff_info_map.value(key);\n\n\t\t\/\/create repeat tool tip:\n\t\tQStringList repeat_tool_tip_text;\n\t\tif(cutoff_info.max_normal != -1) repeat_tool_tip_text.append(\"normal: \\t≤ \" + QString::number(cutoff_info.max_normal));\n\t\telse repeat_tool_tip_text.append(\"normal: \\t unkown \");\n\t\tif(cutoff_info.min_pathogenic != -1) repeat_tool_tip_text.append(\"pathogenic: \\t> \" + QString::number(cutoff_info.min_pathogenic));\n\t\telse repeat_tool_tip_text.append(\"pathogenic: \\t unkown \");\n\t\tif(cutoff_info.inheritance != \"\" ) repeat_tool_tip_text.append(\"inheritance: \\t\" + cutoff_info.inheritance);\n\t\tif(cutoff_info.additional_info.size() > 0) repeat_tool_tip_text.append(\"info: \\t\\t\" + cutoff_info.additional_info.join(\"\\n\\t\\t\"));\n\n\t\t\/\/add position\n\t\tui_->repeat_expansions->setItem(row_idx, col_idx++, GUIHelper::createTableItem(QString(re.chr().strNormalized(true))));\n\t\tui_->repeat_expansions->setItem(row_idx, col_idx++, new NumericWidgetItem(QString::number(re.start())));\n\t\tui_->repeat_expansions->setItem(row_idx, col_idx++, new NumericWidgetItem(info_end));\n\n\t\t\/\/add repeat\n\t\tQTableWidgetItem* repeat_id_cell = GUIHelper::createTableItem(info_repid);\n\t\tif (is_exome_ && !cutoff_info.reliable_in_exomes )\n\t\t{\n\t\t\trepeat_id_cell->setBackgroundColor(bg_red);\n\t\t\trepeat_id_cell->setToolTip(\"Repeat calling of this repeat is not reliable in Exomes!\");\n\t\t}\n\t\tui_->repeat_expansions->setItem(row_idx, col_idx++, repeat_id_cell);\n\t\tui_->repeat_expansions->setItem(row_idx, col_idx++, GUIHelper::createTableItem(info_ru));\n\n\t\t\/\/add allele\/ref copy number\n\t\t\/\/replace \".\" with \"-\"\n\t\tQString repeat_text = format_repcn;\n\t\tif (repeat_text == \".\") repeat_text = \"-\";\n\t\tif (repeat_text == \".\/.\") repeat_text = \"-\/-\";\n\t\tQTableWidgetItem* repeat_cell = GUIHelper::createTableItem(repeat_text);\n\n\t\t\/\/color table acording to cutoff table\n\t\tQByteArrayList repeats = format_repcn.split('\/');\n\t\tint repeats_allele1, repeats_allele2;\n\t\tif ((repeats.size() < 1) || (repeats.size() > 2)) THROW(FileParseException, \"Invalid allele count in repeat entries!\");\n\n\t\t\/\/ skip coloring if no repeat information is available:\n\t\tif (repeats.at(0).trimmed() != \".\")\n\t\t{\n\t\t\trepeats_allele1 = Helper::toInt(repeats.at(0), \"Repeat allele 1\", QString::number(row_idx));\n\n\t\t\tif (repeats.size() == 1) repeats_allele2 = 0; \/\/ special case for male samples on chrX\n\t\t\telse repeats_allele2 = Helper::toInt(repeats.at(1), \"Repeat allele 2\", QString::number(row_idx));\n\n\t\t\t\/\/check if pathogenic\n\t\t\tif ((cutoff_info.min_pathogenic != -1) &&\n\t\t\t\t((repeats_allele1 >= cutoff_info.min_pathogenic) || (repeats_allele2 >= cutoff_info.min_pathogenic)))\n\t\t\t{\n\t\t\t\t\/\/pathogenic\n\t\t\t\trepeat_cell->setBackgroundColor(bg_red);\n\t\t\t}\n\t\t\telse if ((cutoff_info.max_normal != -1) &&\n\t\t\t\t\t ((repeats_allele1 > cutoff_info.max_normal) || (repeats_allele2 > cutoff_info.max_normal)))\n\t\t\t{\n\t\t\t\t\/\/above normal\n\t\t\t\trepeat_cell->setBackgroundColor(bg_orange);\n\t\t\t}\n\t\t\telse if (cutoff_info.max_normal != -1)\n\t\t\t{\n\t\t\t\t\/\/normal\n\t\t\t\trepeat_cell->setBackgroundColor(bg_green);\n\t\t\t}\n\t\t}\n\n\n\t\trepeat_cell->setToolTip(repeat_tool_tip_text.join('\\n'));\n\n\t\tui_->repeat_expansions->setItem(row_idx, col_idx++, repeat_cell);\n\t\tui_->repeat_expansions->setItem(row_idx, col_idx++, new NumericWidgetItem(info_ref));\n\n\t\t\/\/add additional info\n\t\tui_->repeat_expansions->setItem(row_idx, col_idx++, GUIHelper::createTableItem(format_repci.replace(\".\", \"-\")));\n\n\t\t\/\/add filter column and color background if not 'PASS'\n\t\tQTableWidgetItem* filter_cell = GUIHelper::createTableItem(re.filter().join(\",\"));\n\t\tif(filter_cell->text().trimmed() != \"PASS\") filter_cell->setBackgroundColor(bg_orange);\n\t\tui_->repeat_expansions->setItem(row_idx, col_idx++, filter_cell);\n\n\t\t\/\/round local coverage\n\t\tdouble coverage = Helper::toDouble(format_lc);\n\t\tui_->repeat_expansions->setItem(row_idx, col_idx++, new NumericWidgetItem(QString::number(coverage, 'f', 2)));\n\n\t\t\/\/add read counts\n\t\tui_->repeat_expansions->setItem(row_idx, col_idx++, GUIHelper::createTableItem(format_adfl.replace(\".\", \"-\")));\n\t\tui_->repeat_expansions->setItem(row_idx, col_idx++, GUIHelper::createTableItem(format_adir.replace(\".\", \"-\")));\n\t\tui_->repeat_expansions->setItem(row_idx, col_idx++, GUIHelper::createTableItem(format_adsp.replace(\".\", \"-\")));\n\n\t}\n\n\t\/\/ optimize column width\n\tGUIHelper::resizeTableCells(ui_->repeat_expansions);\n\n\t\/\/ display vertical header\n\tui_->repeat_expansions->verticalHeader()->setVisible(true);\n}\n\n\n\n\n<commit_msg>src\/GSvar\/RepeatExpansionWidget.cpp: BugFix: Widget crashed if repeat count in chrX\/Y is not present (\".\") in new VCF class<commit_after>#include <QFile>\n#include <QMessageBox>\n#include \"RepeatExpansionWidget.h\"\n#include \"ui_RepeatExpansionWidget.h\"\n#include \"Helper.h\"\n#include \"GUIHelper.h\"\n#include \"TsvFile.h\"\n#include \"VcfFile.h\"\n\nNumericWidgetItem::NumericWidgetItem(QString text):\n\tQTableWidgetItem(text)\n{\n\tsetTextAlignment(Qt::AlignRight);\n\t\/\/ make cell readonly\n\tsetFlags(flags() & (~Qt::ItemIsEditable));\n}\n\nbool NumericWidgetItem::operator<(const QTableWidgetItem& other) const\n{\n\t\/\/convert text to double\n\tdouble this_value = Helper::toDouble(text());\n\tdouble other_value = Helper::toDouble(other.text());\n\treturn (this_value < other_value);\n}\n\nRepeatExpansionWidget::RepeatExpansionWidget(QString vcf_filename, bool is_exome, QWidget* parent):\n\tQWidget(parent),\n\tvcf_filename_(vcf_filename),\n\tis_exome_(is_exome),\n\tui_(new Ui::RepeatExpansionWidget)\n{\n\tui_->setupUi(this);\n\tloadRepeatExpansionData();\n}\n\nRepeatExpansionWidget::~RepeatExpansionWidget()\n{\n\tdelete ui_;\n}\n\nvoid RepeatExpansionWidget::loadRepeatExpansionData()\n{\n\t\/\/load VCF file\n\tVcfFile repeat_expansions;\n\trepeat_expansions.load(vcf_filename_);\n\n\t\/\/load filter file\n\tQMap<QPair<QByteArray,QByteArray>, RepeatCutoffInfo> cutoff_info_map;\n\tQStringList cutoff_file_content = Helper::loadTextFile(\":\/Resources\/repeat_expansion_cutoffs.tsv\", false);\n\n\tforeach(const QString& line, cutoff_file_content)\n\t{\n\t\t\/\/ skip empty lines and comments\n\t\tif((line==\"\") || (line.startsWith(\"#\"))) continue;\n\n\t\t\/\/parse line\n\t\tQStringList split_line = line.split('\\t');\n\t\tif (split_line.size() < 7) THROW(FileParseException, \"Error parsing repeat expansion file: file has to contain 7 tab-separated columns!\");\n\t\tRepeatCutoffInfo repeat_cutoff;\n\n\t\trepeat_cutoff.repeat_id = split_line.at(0).trimmed().toUtf8();\n\t\trepeat_cutoff.repeat_unit = split_line.at(1).trimmed().toUtf8();\n\t\tif(split_line.at(2).trimmed() == \"\") repeat_cutoff.max_normal = -1;\n\t\telse repeat_cutoff.max_normal = Helper::toInt(split_line.at(2));\n\t\tif(split_line.at(3).trimmed() == \"\") repeat_cutoff.min_pathogenic = -1;\n\t\telse repeat_cutoff.min_pathogenic = Helper::toInt(split_line.at(3));\n\t\trepeat_cutoff.inheritance = split_line.at(4).trimmed().toUtf8();\n\n\n\t\t\/\/parse exome reliability\n\t\tQByteArray reliable_in_exomes = split_line.at(5).trimmed().toUtf8();\n\t\tif(reliable_in_exomes == \"0\") repeat_cutoff.reliable_in_exomes = false;\n\t\telse repeat_cutoff.reliable_in_exomes = true;\n\t\t\/\/parse additional info\n\t\tQByteArrayList additional_info = split_line.at(6).trimmed().toUtf8().split(';');\n\t\tforeach(const QByteArray& info, additional_info)\n\t\t{\n\t\t\tif(info.trimmed() != \"\") repeat_cutoff.additional_info.append(info.trimmed());\n\t\t}\n\n\t\tcutoff_info_map.insert(QPair<QByteArray,QByteArray>(repeat_cutoff.repeat_id, repeat_cutoff.repeat_unit), repeat_cutoff);\n\t}\n\n\t\/\/create table\n\n\t\/\/define columns\n\tQStringList column_names;\n\tQVector<bool> numeric_columns;\n\tQStringList description;\n\tcolumn_names << \"chr\" << \"start\" << \"end\" << \"repeat_id\" << \"repeat_unit\"\n\t\t\t\t << \"repeats\" << \"wt_repeat\" << \"repeat_ci\"<< \"filter\" << \"locus_coverage\"\n\t\t\t\t << \"reads_flanking\" << \"reads_in_repeat\" << \"reads_spanning\";\n\tnumeric_columns << false << true << true << false << false << false << true << false << true << false << false << false;\n\tdescription << \"\"\n\t\t\t\t<< \"\"\n\t\t\t\t<< \"\"\n\t\t\t\t<< \"Repeat identifier as specified in the variant catalog\"\n\t\t\t\t<< \"Repeat unit in the reference orientation\"\n\t\t\t\t<< \"Number of repeat units spanned by the allele\"\n\t\t\t\t<< \"Reference repeat count\"\n\t\t\t\t<< \"Confidence interval for allele copy number\"\n\t\t\t\t<< QString(\"Filter:\\n\")\n\t\t\t\t   + \"  PASS:\\t\\tAll filters passed\\n\"\n\t\t\t\t   + \"  LowDepth:\\tThe overall locus depth is below 10x or number of reads spanning one or both breakends is below 5.\"\n\t\t\t\t<< \"Locus coverage\"\n\t\t\t\t<< \"Number of flanking reads consistent with the allele\"\n\t\t\t\t<< \"Number of in-repeat reads consistent with the allele\"\n\t\t\t\t<< \"Number of spanning reads consistent with the allele\";\n\n\n\t\/\/create header\n\tui_->repeat_expansions->setColumnCount(column_names.size());\n\tfor (int col_idx = 0; col_idx < column_names.size(); ++col_idx)\n\t{\n\t\tui_->repeat_expansions->setHorizontalHeaderItem(col_idx, new QTableWidgetItem(column_names.at(col_idx)));\n\t\tif (description.at(col_idx) != \"\")\n\t\t{\n\t\t\tui_->repeat_expansions->horizontalHeaderItem(col_idx)->setToolTip(description.at(col_idx));\n\t\t}\n\t}\n\n\t\/\/ check that there is exactly one sample\n\tQByteArrayList samples = repeat_expansions.sampleIDs();\n\tif (samples.count()!=1)\n\t{\n\t\tTHROW(ArgumentException, \"Repeat expansion VCF file '\" + vcf_filename_ + \"' does not contain exactly one sample!\");\n\t}\n\n\t\/\/ define table backround colors\n\tQColor bg_red = Qt::red;\n\tbg_red.setAlphaF(0.5);\n\tQColor bg_green = Qt::darkGreen;\n\tbg_green.setAlphaF(0.5);\n\tQColor bg_orange = QColor(255, 135, 60);\n\tbg_orange.setAlphaF(0.5);\n\n\n\t\/\/ fill table widget with variants\/repeat expansions\n\tui_->repeat_expansions->setRowCount(repeat_expansions.count());\n\tfor(int row_idx=0; row_idx<repeat_expansions.count(); ++row_idx)\n\t{\n\t\tconst VcfLine& re = repeat_expansions[row_idx];\n\t\tint col_idx = 0;\n\n\t\t\/\/extract info\/format values\n\t\tQByteArray info_repid = re.info(\"REPID\").trimmed();\n\t\tQByteArray info_ru = re.info(\"RU\").trimmed();\n\t\tQByteArray info_end = re.info(\"END\").trimmed();\n\t\tQByteArray info_ref = re.info(\"REF\").trimmed();\n\n\t\tQByteArray format_repcn = re.formatValueFromSample(\"REPCN\").trimmed();\n\t\tQByteArray format_repci = re.formatValueFromSample(\"REPCI\").trimmed();\n\t\tQByteArray format_lc = re.formatValueFromSample(\"LC\").trimmed();\n\t\tQByteArray format_adfl = re.formatValueFromSample(\"ADFL\").trimmed();\n\t\tQByteArray format_adir = re.formatValueFromSample(\"ADIR\").trimmed();\n\t\tQByteArray format_adsp = re.formatValueFromSample(\"ADSP\").trimmed();\n\n\t\t\/\/ get cutoff\/reliability info from cutoff file\n\t\tQPair<QByteArray, QByteArray> key = QPair<QByteArray, QByteArray>(info_repid, info_ru);\n\t\tif(!cutoff_info_map.contains(key))\n\t\t{\n\t\t\tTHROW(FileParseException, \"Repeat '\" + info_repid + \", \" + info_ru + \"' not fout in cutoff file!\");\n\t\t}\n\t\tRepeatCutoffInfo cutoff_info = cutoff_info_map.value(key);\n\n\t\t\/\/create repeat tool tip:\n\t\tQStringList repeat_tool_tip_text;\n\t\tif(cutoff_info.max_normal != -1) repeat_tool_tip_text.append(\"normal: \\t≤ \" + QString::number(cutoff_info.max_normal));\n\t\telse repeat_tool_tip_text.append(\"normal: \\t unkown \");\n\t\tif(cutoff_info.min_pathogenic != -1) repeat_tool_tip_text.append(\"pathogenic: \\t> \" + QString::number(cutoff_info.min_pathogenic));\n\t\telse repeat_tool_tip_text.append(\"pathogenic: \\t unkown \");\n\t\tif(cutoff_info.inheritance != \"\" ) repeat_tool_tip_text.append(\"inheritance: \\t\" + cutoff_info.inheritance);\n\t\tif(cutoff_info.additional_info.size() > 0) repeat_tool_tip_text.append(\"info: \\t\\t\" + cutoff_info.additional_info.join(\"\\n\\t\\t\"));\n\n\t\t\/\/add position\n\t\tui_->repeat_expansions->setItem(row_idx, col_idx++, GUIHelper::createTableItem(QString(re.chr().strNormalized(true))));\n\t\tui_->repeat_expansions->setItem(row_idx, col_idx++, new NumericWidgetItem(QString::number(re.start())));\n\t\tui_->repeat_expansions->setItem(row_idx, col_idx++, new NumericWidgetItem(info_end));\n\n\t\t\/\/add repeat\n\t\tQTableWidgetItem* repeat_id_cell = GUIHelper::createTableItem(info_repid);\n\t\tif (is_exome_ && !cutoff_info.reliable_in_exomes )\n\t\t{\n\t\t\trepeat_id_cell->setBackgroundColor(bg_red);\n\t\t\trepeat_id_cell->setToolTip(\"Repeat calling of this repeat is not reliable in Exomes!\");\n\t\t}\n\t\tui_->repeat_expansions->setItem(row_idx, col_idx++, repeat_id_cell);\n\t\tui_->repeat_expansions->setItem(row_idx, col_idx++, GUIHelper::createTableItem(info_ru));\n\n\t\t\/\/add allele\/ref copy number\n\t\t\/\/replace \".\" with \"-\"\n\t\tQString repeat_text = format_repcn;\n\t\tif ((repeat_text == \".\") || (repeat_text == \"\")) repeat_text = \"-\";\n\t\tif (repeat_text == \".\/.\") repeat_text = \"-\/-\";\n\t\tQTableWidgetItem* repeat_cell = GUIHelper::createTableItem(repeat_text);\n\n\t\t\/\/color table acording to cutoff table\n\t\tQByteArrayList repeats = format_repcn.split('\/');\n\t\tint repeats_allele1, repeats_allele2;\n\t\tif ((repeats.size() < 1) || (repeats.size() > 2)) THROW(FileParseException, \"Invalid allele count in repeat entries!\");\n\n\t\t\/\/ skip coloring if no repeat information is available:\n\t\tif ((repeats.at(0).trimmed() != \".\") && (repeats.at(0).trimmed() != \"\"))\n\t\t{\n\t\t\trepeats_allele1 = Helper::toInt(repeats.at(0), \"Repeat allele 1\", QString::number(row_idx));\n\n\t\t\tif (repeats.size() == 1) repeats_allele2 = 0; \/\/ special case for male samples on chrX\n\t\t\telse repeats_allele2 = Helper::toInt(repeats.at(1), \"Repeat allele 2\", QString::number(row_idx));\n\n\t\t\t\/\/check if pathogenic\n\t\t\tif ((cutoff_info.min_pathogenic != -1) &&\n\t\t\t\t((repeats_allele1 >= cutoff_info.min_pathogenic) || (repeats_allele2 >= cutoff_info.min_pathogenic)))\n\t\t\t{\n\t\t\t\t\/\/pathogenic\n\t\t\t\trepeat_cell->setBackgroundColor(bg_red);\n\t\t\t}\n\t\t\telse if ((cutoff_info.max_normal != -1) &&\n\t\t\t\t\t ((repeats_allele1 > cutoff_info.max_normal) || (repeats_allele2 > cutoff_info.max_normal)))\n\t\t\t{\n\t\t\t\t\/\/above normal\n\t\t\t\trepeat_cell->setBackgroundColor(bg_orange);\n\t\t\t}\n\t\t\telse if (cutoff_info.max_normal != -1)\n\t\t\t{\n\t\t\t\t\/\/normal\n\t\t\t\trepeat_cell->setBackgroundColor(bg_green);\n\t\t\t}\n\t\t}\n\n\n\t\trepeat_cell->setToolTip(repeat_tool_tip_text.join('\\n'));\n\n\t\tui_->repeat_expansions->setItem(row_idx, col_idx++, repeat_cell);\n\t\tui_->repeat_expansions->setItem(row_idx, col_idx++, new NumericWidgetItem(info_ref));\n\n\t\t\/\/add additional info\n\t\tui_->repeat_expansions->setItem(row_idx, col_idx++, GUIHelper::createTableItem(format_repci.replace(\".\", \"-\")));\n\n\t\t\/\/add filter column and color background if not 'PASS'\n\t\tQTableWidgetItem* filter_cell = GUIHelper::createTableItem(re.filter().join(\",\"));\n\t\tif(filter_cell->text().trimmed() != \"PASS\") filter_cell->setBackgroundColor(bg_orange);\n\t\tui_->repeat_expansions->setItem(row_idx, col_idx++, filter_cell);\n\n\t\t\/\/round local coverage\n\t\tdouble coverage = Helper::toDouble(format_lc);\n\t\tui_->repeat_expansions->setItem(row_idx, col_idx++, new NumericWidgetItem(QString::number(coverage, 'f', 2)));\n\n\t\t\/\/add read counts\n\t\tui_->repeat_expansions->setItem(row_idx, col_idx++, GUIHelper::createTableItem(format_adfl.replace(\".\", \"-\")));\n\t\tui_->repeat_expansions->setItem(row_idx, col_idx++, GUIHelper::createTableItem(format_adir.replace(\".\", \"-\")));\n\t\tui_->repeat_expansions->setItem(row_idx, col_idx++, GUIHelper::createTableItem(format_adsp.replace(\".\", \"-\")));\n\n\t}\n\n\t\/\/ optimize column width\n\tGUIHelper::resizeTableCells(ui_->repeat_expansions);\n\n\t\/\/ display vertical header\n\tui_->repeat_expansions->verticalHeader()->setVisible(true);\n}\n\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  Copyright (c) 2015, 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\n\/\/        copyright notice, this list of conditions and the following\n\/\/        disclaimer.\n\/\/\n\/\/      * Redistributions in binary form must reproduce the above\n\/\/        copyright notice, this list of conditions and the following\n\/\/        disclaimer in the documentation and\/or other materials provided with\n\/\/        the distribution.\n\/\/\n\/\/      * Neither the name of John Haddon nor the names of\n\/\/        any other contributors to this software may be used to endorse or\n\/\/        promote products derived from this software without specific prior\n\/\/        written permission.\n\/\/\n\/\/  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n\/\/  IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\n\/\/  THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n\/\/  PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n\/\/  CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\/\/  EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/  PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\/\/  PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\/\/  LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/  NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"GafferScene\/FilterProcessor.h\"\n\n#include \"Gaffer\/ArrayPlug.h\"\n\nusing namespace IECore;\nusing namespace Gaffer;\nusing namespace GafferScene;\n\nIE_CORE_DEFINERUNTIMETYPED( FilterProcessor );\n\nsize_t FilterProcessor::g_firstPlugIndex = 0;\n\nFilterProcessor::FilterProcessor( const std::string &name )\n\t:\tFilter( name )\n{\n\tstoreIndexOfNextChild( g_firstPlugIndex );\n\taddChild( outPlug()->createCounterpart( \"in\", Plug::In ) );\n}\n\nFilterProcessor::FilterProcessor( const std::string &name, size_t minInputs, size_t maxInputs )\n\t:\tFilter( name )\n{\n\tstoreIndexOfNextChild( g_firstPlugIndex );\n\taddChild(\n\t\tnew ArrayPlug( \"in\", Gaffer::Plug::In, outPlug()->createCounterpart( \"in0\", Plug::In ), minInputs, maxInputs )\n\t);\n}\n\nFilterProcessor::~FilterProcessor()\n{\n}\n\nFilterPlug *FilterProcessor::inPlug()\n{\n\tGraphComponent *p = getChild( g_firstPlugIndex );\n\tif( FilterPlug *s = IECore::runTimeCast<FilterPlug>( p ) )\n\t{\n\t\treturn s;\n\t}\n\telse\n\t{\n\t\treturn static_cast<ArrayPlug *>( p )->getChild<FilterPlug>( 0 );\n\t}\n}\n\nconst FilterPlug *FilterProcessor::inPlug() const\n{\n\tconst GraphComponent *p = getChild( g_firstPlugIndex );\n\tif( const FilterPlug *s = IECore::runTimeCast<const FilterPlug>( p ) )\n\t{\n\t\treturn s;\n\t}\n\telse\n\t{\n\t\treturn static_cast<const ArrayPlug *>( p )->getChild<FilterPlug>( 0 );\n\t}\n}\n\nGaffer::ArrayPlug *FilterProcessor::inPlugs()\n{\n\treturn getChild<Gaffer::ArrayPlug>( g_firstPlugIndex );\n}\n\nconst Gaffer::ArrayPlug *FilterProcessor::inPlugs() const\n{\n\treturn getChild<Gaffer::ArrayPlug>( g_firstPlugIndex );\n}\n\nbool FilterProcessor::sceneAffectsMatch( const ScenePlug *scene, const Gaffer::ValuePlug *child ) const\n{\n\tfor( InputFilterPlugIterator it( inPlugs() ); !it.done(); ++it )\n\t{\n\t\tif( (*it)->sceneAffectsMatch( scene, child ) )\n\t\t{\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nGaffer::Plug *FilterProcessor::correspondingInput( const Gaffer::Plug *output )\n{\n\tif( output == outPlug() )\n\t{\n\t\treturn inPlug();\n\t}\n\treturn Filter::correspondingInput( output );\n}\n\nconst Gaffer::Plug *FilterProcessor::correspondingInput( const Gaffer::Plug *output ) const\n{\n\tif( output == outPlug() )\n\t{\n\t\treturn inPlug();\n\t}\n\treturn Filter::correspondingInput( output );\n}\n\nvoid FilterProcessor::hash( const Gaffer::ValuePlug *output, const Gaffer::Context *context, IECore::MurmurHash &h ) const\n{\n\tif( output == outPlug() && !enabledPlug()->getValue() )\n\t{\n\t\th = inPlug()->hash();\n\t}\n\telse\n\t{\n\t\tFilter::hash( output, context, h );\n\t}\n}\n\nvoid FilterProcessor::compute( Gaffer::ValuePlug *output, const Gaffer::Context *context ) const\n{\n\tif( output == outPlug() && !enabledPlug()->getValue() )\n\t{\n\t\toutput->setFrom( inPlug() );\n\t}\n\telse\n\t{\n\t\tFilter::compute( output, context );\n\t}\n}\n<commit_msg>FilterProcessor : Support non-array inputs in `sceneAffectsMatch()`<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  Copyright (c) 2015, 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\n\/\/        copyright notice, this list of conditions and the following\n\/\/        disclaimer.\n\/\/\n\/\/      * Redistributions in binary form must reproduce the above\n\/\/        copyright notice, this list of conditions and the following\n\/\/        disclaimer in the documentation and\/or other materials provided with\n\/\/        the distribution.\n\/\/\n\/\/      * Neither the name of John Haddon nor the names of\n\/\/        any other contributors to this software may be used to endorse or\n\/\/        promote products derived from this software without specific prior\n\/\/        written permission.\n\/\/\n\/\/  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n\/\/  IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\n\/\/  THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n\/\/  PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n\/\/  CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\/\/  EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/  PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\/\/  PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\/\/  LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/  NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"GafferScene\/FilterProcessor.h\"\n\n#include \"Gaffer\/ArrayPlug.h\"\n\nusing namespace IECore;\nusing namespace Gaffer;\nusing namespace GafferScene;\n\nIE_CORE_DEFINERUNTIMETYPED( FilterProcessor );\n\nsize_t FilterProcessor::g_firstPlugIndex = 0;\n\nFilterProcessor::FilterProcessor( const std::string &name )\n\t:\tFilter( name )\n{\n\tstoreIndexOfNextChild( g_firstPlugIndex );\n\taddChild( outPlug()->createCounterpart( \"in\", Plug::In ) );\n}\n\nFilterProcessor::FilterProcessor( const std::string &name, size_t minInputs, size_t maxInputs )\n\t:\tFilter( name )\n{\n\tstoreIndexOfNextChild( g_firstPlugIndex );\n\taddChild(\n\t\tnew ArrayPlug( \"in\", Gaffer::Plug::In, outPlug()->createCounterpart( \"in0\", Plug::In ), minInputs, maxInputs )\n\t);\n}\n\nFilterProcessor::~FilterProcessor()\n{\n}\n\nFilterPlug *FilterProcessor::inPlug()\n{\n\tGraphComponent *p = getChild( g_firstPlugIndex );\n\tif( FilterPlug *s = IECore::runTimeCast<FilterPlug>( p ) )\n\t{\n\t\treturn s;\n\t}\n\telse\n\t{\n\t\treturn static_cast<ArrayPlug *>( p )->getChild<FilterPlug>( 0 );\n\t}\n}\n\nconst FilterPlug *FilterProcessor::inPlug() const\n{\n\tconst GraphComponent *p = getChild( g_firstPlugIndex );\n\tif( const FilterPlug *s = IECore::runTimeCast<const FilterPlug>( p ) )\n\t{\n\t\treturn s;\n\t}\n\telse\n\t{\n\t\treturn static_cast<const ArrayPlug *>( p )->getChild<FilterPlug>( 0 );\n\t}\n}\n\nGaffer::ArrayPlug *FilterProcessor::inPlugs()\n{\n\treturn getChild<Gaffer::ArrayPlug>( g_firstPlugIndex );\n}\n\nconst Gaffer::ArrayPlug *FilterProcessor::inPlugs() const\n{\n\treturn getChild<Gaffer::ArrayPlug>( g_firstPlugIndex );\n}\n\nbool FilterProcessor::sceneAffectsMatch( const ScenePlug *scene, const Gaffer::ValuePlug *child ) const\n{\n\tif( const ArrayPlug *arrayIn = this->inPlugs() )\n\t{\n\t\tfor( InputFilterPlugIterator it( arrayIn ); !it.done(); ++it )\n\t\t{\n\t\t\tif( (*it)->sceneAffectsMatch( scene, child ) )\n\t\t\t{\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\telse\n\t{\n\t\treturn inPlug()->sceneAffectsMatch( scene, child );\n\t}\n}\n\nGaffer::Plug *FilterProcessor::correspondingInput( const Gaffer::Plug *output )\n{\n\tif( output == outPlug() )\n\t{\n\t\treturn inPlug();\n\t}\n\treturn Filter::correspondingInput( output );\n}\n\nconst Gaffer::Plug *FilterProcessor::correspondingInput( const Gaffer::Plug *output ) const\n{\n\tif( output == outPlug() )\n\t{\n\t\treturn inPlug();\n\t}\n\treturn Filter::correspondingInput( output );\n}\n\nvoid FilterProcessor::hash( const Gaffer::ValuePlug *output, const Gaffer::Context *context, IECore::MurmurHash &h ) const\n{\n\tif( output == outPlug() && !enabledPlug()->getValue() )\n\t{\n\t\th = inPlug()->hash();\n\t}\n\telse\n\t{\n\t\tFilter::hash( output, context, h );\n\t}\n}\n\nvoid FilterProcessor::compute( Gaffer::ValuePlug *output, const Gaffer::Context *context ) const\n{\n\tif( output == outPlug() && !enabledPlug()->getValue() )\n\t{\n\t\toutput->setFrom( inPlug() );\n\t}\n\telse\n\t{\n\t\tFilter::compute( output, context );\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) Microsoft. All rights reserved.\n\/\/ Licensed under the MIT license. See LICENSE file in the project root for full license information.\n\n#include \"common.h\"\n\n#include \"gcenv.h\"\n\n#include \"gc.h\"\n#include \"objecthandle.h\"\n\n#pragma warning(disable:4297)\n\nextern \"C\" Object * RhNewObject(MethodTable * pMT);\nextern \"C\" Object * RhNewArray(MethodTable * pMT, int32_t elements);\nextern \"C\" void RhpReversePInvoke2(ReversePInvokeFrame* pRevFrame);\nextern \"C\" void RhpReversePInvokeReturn(ReversePInvokeFrame* pRevFrame);\nextern \"C\" int32_t RhpEnableConservativeStackReporting();\nextern \"C\" void RhpRegisterSimpleModule(SimpleModuleHeader* pModule);\n\n#define DLL_PROCESS_ATTACH      1\nextern \"C\" BOOL WINAPI RtuDllMain(HANDLE hPalInstance, DWORD dwReason, void* pvReserved);\n\n#include \"platform.h\"\n\nint __initialize_runtime()\n{\n    RtuDllMain(NULL, DLL_PROCESS_ATTACH, NULL);\n\n    RhpEnableConservativeStackReporting();\n\n    return 0;\n}\n\nvoid __shutdown_runtime()\n{\n}\n\nvoid __reverse_pinvoke(ReversePInvokeFrame* pRevFrame)\n{\n    RhpReversePInvoke2(pRevFrame);\n}\n\nvoid __reverse_pinvoke_return(ReversePInvokeFrame* pRevFrame)\n{\n    RhpReversePInvokeReturn(pRevFrame);\n}\n\nvoid __register_module(SimpleModuleHeader* pModule)\n{\n    RhpRegisterSimpleModule(pModule);\n}\n\nnamespace System_Private_CoreLib { namespace System { \n\n    class Object {\n    public:\n        MethodTable * get_EEType() { return *(MethodTable **)this; }\n    };\n\n    class Array : public Object {\n    public:\n        int32_t GetArrayLength() {\n            return *(int32_t *)((void **)this + 1);\n        }\n        void * GetArrayData() {\n            return (void **)this + 2;\n        }\n    };\n\n    class String : public Object { public:\n        static MethodTable * __getMethodTable();\n    };\n\n    class String__Array : public Object { public:\n        static MethodTable * __getMethodTable();\n    };\n\n    class EETypePtr { public:\n        intptr_t m_value;\n    };\n\n}; };\n\nusing namespace System_Private_CoreLib;\n\n\/\/\n\/\/ The fast paths for object allocation and write barriers is performance critical. They are often\n\/\/ hand written in assembly code, etc.\n\/\/\nextern \"C\" Object * __allocate_object(MethodTable * pMT)\n{\n    return RhNewObject(pMT);\n}\n\nextern \"C\" void __EEType_System_Private_CoreLib_System_String();\n\nObject * __allocate_string(int32_t len)\n{\n#ifdef CPPCODEGEN\n    return RhNewArray(System::String::__getMethodTable(), len);\n#else\n    return RhNewArray((MethodTable*)__EEType_System_Private_CoreLib_System_String, len);\n#endif\n}\n\nextern \"C\" Object * __allocate_array(size_t elements, MethodTable * pMT)\n{\n    return RhNewArray(pMT, (int32_t)elements); \/\/ TODO: type mismatch\n}\n\n#if defined(_WIN64)\n\/\/ Card byte shift is different on 64bit.\n#define card_byte_shift     11\n#else\n#define card_byte_shift     10\n#endif\n\n#define card_byte(addr) (((size_t)(addr)) >> card_byte_shift)\n\ninline void ErectWriteBarrier(Object ** dst, Object * ref)\n{\n    \/\/ if the dst is outside of the heap (unboxed value classes) then we\n    \/\/      simply exit\n    if (((BYTE*)dst < g_lowest_address) || ((BYTE*)dst >= g_highest_address))\n        return;\n\n    if ((BYTE*)ref >= g_ephemeral_low && (BYTE*)ref < g_ephemeral_high)\n    {\n        \/\/ volatile is used here to prevent fetch of g_card_table from being reordered \n        \/\/ with g_lowest\/highest_address check above. See comment in code:gc_heap::grow_brick_card_tables.\n        BYTE* pCardByte = (BYTE *)*(volatile BYTE **)(&g_card_table) + card_byte((BYTE *)dst);\n        if (*pCardByte != 0xFF)\n            *pCardByte = 0xFF;\n    }\n}\n\nextern \"C\" void WriteBarrier(Object ** dst, Object * ref)\n{\n    *dst = ref;\n    ErectWriteBarrier(dst, ref);\n}\n\nextern \"C\" void __stelem_ref(System::Array * pArray, unsigned idx, Object * val)\n{\n    \/\/ TODO: Range checks, writer barrier, etc.\n    ((Object **)(pArray->GetArrayData()))[idx] = val;\n}\n\nextern \"C\" void* __ldelema_ref(System::Array * pArray, unsigned idx, MethodTable * type)\n{\n    \/\/ TODO: Range checks, etc.\n    return &(((Object **)(pArray->GetArrayData()))[idx]);\n}\n\nextern \"C\" void __throw_exception(void * pEx)\n{\n    \/\/ TODO: Exception throwing\n    throw pEx;\n}\n\nextern \"C\" void __fail_fast()\n{\n    \/\/ TODO: FailFast\n    throw 42;\n}\n\nObject * __load_string_literal(const char * string)\n{\n    \/\/ TODO: Cache\/intern string literals\n    \/\/ TODO: Unicode string literals\n\n    size_t len = strlen(string);\n\n    Object * pString = __allocate_string((int32_t)len);\n\n    uint16_t * p = (uint16_t *)((char*)pString + sizeof(intptr_t) + sizeof(int32_t));\n    for (size_t i = 0; i < len; i++)\n        p[i] = string[i];\n    return pString;\n}\n\nOBJECTHANDLE __load_static_string_literal(const uint8_t* utf8, int32_t utf8Len, int32_t strLen)\n{\n    Object * pString = __allocate_string(strLen);\n    uint16_t * buffer = (uint16_t *)((char*)pString + sizeof(intptr_t) + sizeof(int32_t));\n    if (strLen > 0)\n        UTF8ToWideChar((char*)utf8, utf8Len, buffer, strLen);\n    return CreateGlobalHandle(ObjectToOBJECTREF(pString));\n}\n\n\/\/ TODO: Rewrite in C#\n\nextern \"C\" Object * __castclass_class(void * p, MethodTable * pTargetMT)\n{\n    Object * o = (Object *)p;\n\n    if (o == NULL)\n        return o;\n\n    MethodTable * pMT = o->RawGetMethodTable();\n\n    do {\n        if (pMT == pTargetMT)\n            return o;\n\n        pMT = pMT->GetParent();\n    } while (pMT);\n\n    \/\/ TODO: Handle corner cases, throw proper exception\n    throw 1;\n}\n\nextern \"C\" Object * __isinst_class(void * p, MethodTable * pTargetMT)\n{\n    Object * o = (Object *)p;\n\n    if (o == NULL)\n        return o;\n\n    MethodTable * pMT = o->RawGetMethodTable();\n\n    do {\n        if (pMT == pTargetMT)\n            return o;\n\n        pMT = pMT->GetParent();\n    } while (pMT);\n\n    \/\/ TODO: Handle corner cases\n    return NULL;\n}\n\n__declspec(noreturn)\n__declspec(noinline)\nvoid ThrowRangeOverflowException()\n{\n    throw 0;\n}\n\nvoid __range_check_fail()\n{\n    ThrowRangeOverflowException();\n}\n\nvoid __range_check(void * a, size_t elem)\n{\n    if (elem >= *((size_t*)a + 1))\n        ThrowRangeOverflowException();\n}\n\n#ifdef CPPCODEGEN\nObject * __get_commandline_args(int argc, char * argv[])\n{\n    System::Array * p = (System::Array *)__allocate_array(argc, System::String__Array::__getMethodTable());\n\n    for (int i = 0; i < argc; i++)\n    {\n        \/\/ TODO: Write barrier\n        ((Object **)(p->GetArrayData()))[i] = __load_string_literal(argv[i]);\n    }    \n\n    return (Object *)p;\n}\n#endif\n\nextern \"C\" void Buffer_BlockCopy(class System::Array * src, int srcOfs, class System::Array * dst, int dstOfs, int count)\n{\n    \/\/ TODO: Argument validation\n    memmove((uint8_t*)dst + 2 * sizeof(void*) + dstOfs, (uint8_t*)src + 2 * sizeof(void*) + srcOfs, count);\n}\n\nextern \"C\" Object* RhMemberwiseClone(Object*)\n{\n    throw 42;\n}\n\nextern \"C\" uint8_t RhGetCorElementType(MethodTable*)\n{\n    throw 42;\n}\n\nextern \"C\" MethodTable* RhGetRelatedParameterType(MethodTable*)\n{\n    throw 42;\n}\n\nextern \"C\" uint16_t RhGetComponentSize(MethodTable*)\n{\n    throw 42;\n}\n\nextern \"C\" uint8_t RhHasReferenceFields(MethodTable*)\n{\n    throw 42;\n}\n\nextern \"C\" uint8_t RhIsValueType(MethodTable*)\n{\n    throw 42;\n}\n\nextern \"C\" uint8_t RhIsArray(MethodTable*)\n{\n    throw 42;\n}\n\nextern \"C\" uint8_t RhTypeCast_AreTypesEquivalent(MethodTable*, MethodTable*)\n{\n    throw 42;\n}\n\nextern \"C\" void RhGetCurrentThreadStackTrace()\n{\n    throw 42;\n}\n\nextern \"C\" intptr_t RhHandleAlloc(Object * pObject, int type)\n{\n    return (intptr_t)CreateTypedHandle(g_HandleTableMap.pBuckets[0]->pTable[GetCurrentThreadHomeHeapNumber()], pObject, type);\n}\n\nextern \"C\" intptr_t RhHandleAllocDependent(Object* pPrimary, Object* pSecondary)\n{\n    return (intptr_t)CreateDependentHandle(g_HandleTableMap.pBuckets[0]->pTable[GetCurrentThreadHomeHeapNumber()], pPrimary, pSecondary);\n}\n\nextern \"C\" void RhpUniversalTransition()\n{\n    throw 42;\n}\nextern \"C\" void RhpAssignRefEDX()\n{\n    throw 42;\n}\nextern \"C\" void RhpCheckedAssignRefEDX()\n{\n    throw 42;\n}\nextern \"C\" void RhpCheckedLockCmpXchgAVLocation()\n{\n    throw 42;\n}\nextern \"C\" void RhpCheckedXchgAVLocation()\n{\n    throw 42;\n}\nextern \"C\" void RhpCopyMultibyteDestAVLocation()\n{\n    throw 42;\n}\nextern \"C\" void RhpCopyMultibyteSrcAVLocation()\n{\n    throw 42;\n}\nextern \"C\" void RhpCopyMultibyteNoGCRefsDestAVLocation()\n{\n    throw 42;\n}\nextern \"C\" void RhpCopyMultibyteNoGCRefsSrcAVLocation()\n{\n    throw 42;\n}\nextern \"C\" void RhpFailFastForPInvokeExceptionPreemp()\n{\n    throw 42;\n}\nextern \"C\" void RhpFailFastForPInvokeExceptionCoop()\n{\n    throw 42;\n}\nextern \"C\" void RhpThrowHwEx()\n{\n    throw 42;\n}\n\n#ifndef CPPCODEGEN\nSimpleModuleHeader __module = { NULL, NULL \/* &__gcStatics, &__gcStaticsDescs *\/ };\n\nextern \"C\" int repro_Program__Main();\n\nextern \"C\" void __str_fixup();\nextern \"C\" void __str_fixup_end();\nint __strings_fixup()\n{\n    for (unsigned** ptr = (unsigned**)__str_fixup;\n         ptr < (unsigned**)__str_fixup_end; ptr++)\n    {\n        int utf8Len;\n        uint8_t* bytes = (uint8_t*) *ptr;\n        if (AsmDataFormat::DecodeUnsigned(&bytes, bytes + 5, (unsigned*)&utf8Len) != 0)\n            return -1;\n\n        assert(bytes <= ((uint8_t*)*ptr) + 5);\n        assert(utf8Len >= 0);\n\n        int strLen = 0;\n        if (utf8Len != 0)\n        {\n            strLen = UTF8ToWideCharLen((char*)bytes, utf8Len);\n            if (strLen <= 0) return -1;\n        }\n\n        *((OBJECTHANDLE*)ptr) = __load_static_string_literal(bytes, utf8Len, strLen);\n        \/\/ TODO: This \"handle\" will leak, deallocate with __unload\n    }\n    return 0;\n}\n\nextern \"C\" void* __GCStaticRegionStart;\nextern \"C\" void* __GCStaticRegionEnd;\nint __statics_fixup()\n{\n    for (void** currentBlock = &__GCStaticRegionStart; currentBlock < &__GCStaticRegionEnd; currentBlock++)\n    {\n        Object* gcBlock = __allocate_object((MethodTable*)*currentBlock);\n        *currentBlock = CreateGlobalHandle(ObjectToOBJECTREF(gcBlock));\n    }\n\n    return 0;\n}\n\nint main(int argc, char * argv[]) {\n    if (__initialize_runtime() != 0) return -1;\n    __register_module(&__module);\n    ReversePInvokeFrame frame; __reverse_pinvoke(&frame);\n\t\n    if (__strings_fixup() != 0) return -1;\n    if (__statics_fixup() != 0) return -1;\n\n    repro_Program__Main();\n\n    __reverse_pinvoke_return(&frame);\n    __shutdown_runtime();\n    return 0;\n}\n\n#endif\n<commit_msg>Add more stubs for managed runtime calls<commit_after>\/\/ Copyright (c) Microsoft. All rights reserved.\n\/\/ Licensed under the MIT license. See LICENSE file in the project root for full license information.\n\n#include \"common.h\"\n\n#include \"gcenv.h\"\n\n#include \"gc.h\"\n#include \"objecthandle.h\"\n\n#pragma warning(disable:4297)\n\nextern \"C\" Object * RhNewObject(MethodTable * pMT);\nextern \"C\" Object * RhNewArray(MethodTable * pMT, int32_t elements);\nextern \"C\" void RhpReversePInvoke2(ReversePInvokeFrame* pRevFrame);\nextern \"C\" void RhpReversePInvokeReturn(ReversePInvokeFrame* pRevFrame);\nextern \"C\" int32_t RhpEnableConservativeStackReporting();\nextern \"C\" void RhpRegisterSimpleModule(SimpleModuleHeader* pModule);\n\n#define DLL_PROCESS_ATTACH      1\nextern \"C\" BOOL WINAPI RtuDllMain(HANDLE hPalInstance, DWORD dwReason, void* pvReserved);\n\n#include \"platform.h\"\n\nint __initialize_runtime()\n{\n    RtuDllMain(NULL, DLL_PROCESS_ATTACH, NULL);\n\n    RhpEnableConservativeStackReporting();\n\n    return 0;\n}\n\nvoid __shutdown_runtime()\n{\n}\n\nvoid __reverse_pinvoke(ReversePInvokeFrame* pRevFrame)\n{\n    RhpReversePInvoke2(pRevFrame);\n}\n\nvoid __reverse_pinvoke_return(ReversePInvokeFrame* pRevFrame)\n{\n    RhpReversePInvokeReturn(pRevFrame);\n}\n\nvoid __register_module(SimpleModuleHeader* pModule)\n{\n    RhpRegisterSimpleModule(pModule);\n}\n\nnamespace System_Private_CoreLib { namespace System { \n\n    class Object {\n    public:\n        MethodTable * get_EEType() { return *(MethodTable **)this; }\n    };\n\n    class Array : public Object {\n    public:\n        int32_t GetArrayLength() {\n            return *(int32_t *)((void **)this + 1);\n        }\n        void * GetArrayData() {\n            return (void **)this + 2;\n        }\n    };\n\n    class String : public Object { public:\n        static MethodTable * __getMethodTable();\n    };\n\n    class String__Array : public Object { public:\n        static MethodTable * __getMethodTable();\n    };\n\n    class EETypePtr { public:\n        intptr_t m_value;\n    };\n\n}; };\n\nusing namespace System_Private_CoreLib;\n\n\/\/\n\/\/ The fast paths for object allocation and write barriers is performance critical. They are often\n\/\/ hand written in assembly code, etc.\n\/\/\nextern \"C\" Object * __allocate_object(MethodTable * pMT)\n{\n    return RhNewObject(pMT);\n}\n\nextern \"C\" void __EEType_System_Private_CoreLib_System_String();\n\nObject * __allocate_string(int32_t len)\n{\n#ifdef CPPCODEGEN\n    return RhNewArray(System::String::__getMethodTable(), len);\n#else\n    return RhNewArray((MethodTable*)__EEType_System_Private_CoreLib_System_String, len);\n#endif\n}\n\nextern \"C\" Object * __allocate_array(size_t elements, MethodTable * pMT)\n{\n    return RhNewArray(pMT, (int32_t)elements); \/\/ TODO: type mismatch\n}\n\n#if defined(_WIN64)\n\/\/ Card byte shift is different on 64bit.\n#define card_byte_shift     11\n#else\n#define card_byte_shift     10\n#endif\n\n#define card_byte(addr) (((size_t)(addr)) >> card_byte_shift)\n\ninline void ErectWriteBarrier(Object ** dst, Object * ref)\n{\n    \/\/ if the dst is outside of the heap (unboxed value classes) then we\n    \/\/      simply exit\n    if (((BYTE*)dst < g_lowest_address) || ((BYTE*)dst >= g_highest_address))\n        return;\n\n    if ((BYTE*)ref >= g_ephemeral_low && (BYTE*)ref < g_ephemeral_high)\n    {\n        \/\/ volatile is used here to prevent fetch of g_card_table from being reordered \n        \/\/ with g_lowest\/highest_address check above. See comment in code:gc_heap::grow_brick_card_tables.\n        BYTE* pCardByte = (BYTE *)*(volatile BYTE **)(&g_card_table) + card_byte((BYTE *)dst);\n        if (*pCardByte != 0xFF)\n            *pCardByte = 0xFF;\n    }\n}\n\nextern \"C\" void WriteBarrier(Object ** dst, Object * ref)\n{\n    *dst = ref;\n    ErectWriteBarrier(dst, ref);\n}\n\nextern \"C\" void __stelem_ref(System::Array * pArray, unsigned idx, Object * val)\n{\n    \/\/ TODO: Range checks, writer barrier, etc.\n    ((Object **)(pArray->GetArrayData()))[idx] = val;\n}\n\nextern \"C\" void* __ldelema_ref(System::Array * pArray, unsigned idx, MethodTable * type)\n{\n    \/\/ TODO: Range checks, etc.\n    return &(((Object **)(pArray->GetArrayData()))[idx]);\n}\n\nextern \"C\" void __throw_exception(void * pEx)\n{\n    \/\/ TODO: Exception throwing\n    throw pEx;\n}\n\nextern \"C\" void __fail_fast()\n{\n    \/\/ TODO: FailFast\n    throw 42;\n}\n\nObject * __load_string_literal(const char * string)\n{\n    \/\/ TODO: Cache\/intern string literals\n    \/\/ TODO: Unicode string literals\n\n    size_t len = strlen(string);\n\n    Object * pString = __allocate_string((int32_t)len);\n\n    uint16_t * p = (uint16_t *)((char*)pString + sizeof(intptr_t) + sizeof(int32_t));\n    for (size_t i = 0; i < len; i++)\n        p[i] = string[i];\n    return pString;\n}\n\nOBJECTHANDLE __load_static_string_literal(const uint8_t* utf8, int32_t utf8Len, int32_t strLen)\n{\n    Object * pString = __allocate_string(strLen);\n    uint16_t * buffer = (uint16_t *)((char*)pString + sizeof(intptr_t) + sizeof(int32_t));\n    if (strLen > 0)\n        UTF8ToWideChar((char*)utf8, utf8Len, buffer, strLen);\n    return CreateGlobalHandle(ObjectToOBJECTREF(pString));\n}\n\n\/\/ TODO: Rewrite in C#\n\nextern \"C\" Object * __castclass_class(void * p, MethodTable * pTargetMT)\n{\n    Object * o = (Object *)p;\n\n    if (o == NULL)\n        return o;\n\n    MethodTable * pMT = o->RawGetMethodTable();\n\n    do {\n        if (pMT == pTargetMT)\n            return o;\n\n        pMT = pMT->GetParent();\n    } while (pMT);\n\n    \/\/ TODO: Handle corner cases, throw proper exception\n    throw 1;\n}\n\nextern \"C\" Object * __isinst_class(void * p, MethodTable * pTargetMT)\n{\n    Object * o = (Object *)p;\n\n    if (o == NULL)\n        return o;\n\n    MethodTable * pMT = o->RawGetMethodTable();\n\n    do {\n        if (pMT == pTargetMT)\n            return o;\n\n        pMT = pMT->GetParent();\n    } while (pMT);\n\n    \/\/ TODO: Handle corner cases\n    return NULL;\n}\n\n__declspec(noreturn)\n__declspec(noinline)\nvoid ThrowRangeOverflowException()\n{\n    throw 0;\n}\n\nvoid __range_check_fail()\n{\n    ThrowRangeOverflowException();\n}\n\nvoid __range_check(void * a, size_t elem)\n{\n    if (elem >= *((size_t*)a + 1))\n        ThrowRangeOverflowException();\n}\n\n#ifdef CPPCODEGEN\nObject * __get_commandline_args(int argc, char * argv[])\n{\n    System::Array * p = (System::Array *)__allocate_array(argc, System::String__Array::__getMethodTable());\n\n    for (int i = 0; i < argc; i++)\n    {\n        \/\/ TODO: Write barrier\n        ((Object **)(p->GetArrayData()))[i] = __load_string_literal(argv[i]);\n    }    \n\n    return (Object *)p;\n}\n#endif\n\nextern \"C\" void Buffer_BlockCopy(class System::Array * src, int srcOfs, class System::Array * dst, int dstOfs, int count)\n{\n    \/\/ TODO: Argument validation\n    memmove((uint8_t*)dst + 2 * sizeof(void*) + dstOfs, (uint8_t*)src + 2 * sizeof(void*) + srcOfs, count);\n}\n\nextern \"C\" Object* RhMemberwiseClone(Object*)\n{\n    throw 42;\n}\n\nextern \"C\" uint8_t RhGetCorElementType(MethodTable*)\n{\n    throw 42;\n}\n\nextern \"C\" MethodTable* RhGetRelatedParameterType(MethodTable*)\n{\n    throw 42;\n}\n\nextern \"C\" uint16_t RhGetComponentSize(MethodTable*)\n{\n    throw 42;\n}\n\nextern \"C\" uint8_t RhHasReferenceFields(MethodTable*)\n{\n    throw 42;\n}\n\nextern \"C\" uint8_t RhIsValueType(MethodTable*)\n{\n    throw 42;\n}\n\nextern \"C\" uint8_t RhIsArray(MethodTable*)\n{\n    throw 42;\n}\n\nextern \"C\" uint8_t RhTypeCast_AreTypesEquivalent(MethodTable*, MethodTable*)\n{\n    throw 42;\n}\n\nextern \"C\" void RhGetCurrentThreadStackTrace()\n{\n    throw 42;\n}\n\nextern \"C\" intptr_t RhHandleAlloc(Object * pObject, int type)\n{\n    return (intptr_t)CreateTypedHandle(g_HandleTableMap.pBuckets[0]->pTable[GetCurrentThreadHomeHeapNumber()], pObject, type);\n}\n\nextern \"C\" intptr_t RhHandleAllocDependent(Object* pPrimary, Object* pSecondary)\n{\n    return (intptr_t)CreateDependentHandle(g_HandleTableMap.pBuckets[0]->pTable[GetCurrentThreadHomeHeapNumber()], pPrimary, pSecondary);\n}\n\nextern \"C\" void RhGetNonArrayBaseType()\n{\n    throw 42;\n}\n\nextern \"C\" void RhGetEETypeClassification()\n{\n    throw 42;\n}\n\nextern \"C\" void RhpUniversalTransition()\n{\n    throw 42;\n}\nextern \"C\" void RhpAssignRefEDX()\n{\n    throw 42;\n}\nextern \"C\" void RhpCheckedAssignRefEDX()\n{\n    throw 42;\n}\nextern \"C\" void RhpCheckedLockCmpXchgAVLocation()\n{\n    throw 42;\n}\nextern \"C\" void RhpCheckedXchgAVLocation()\n{\n    throw 42;\n}\nextern \"C\" void RhpCopyMultibyteDestAVLocation()\n{\n    throw 42;\n}\nextern \"C\" void RhpCopyMultibyteSrcAVLocation()\n{\n    throw 42;\n}\nextern \"C\" void RhpCopyMultibyteNoGCRefsDestAVLocation()\n{\n    throw 42;\n}\nextern \"C\" void RhpCopyMultibyteNoGCRefsSrcAVLocation()\n{\n    throw 42;\n}\nextern \"C\" void RhpFailFastForPInvokeExceptionPreemp()\n{\n    throw 42;\n}\nextern \"C\" void RhpFailFastForPInvokeExceptionCoop()\n{\n    throw 42;\n}\nextern \"C\" void RhpThrowHwEx()\n{\n    throw 42;\n}\n\n#ifndef CPPCODEGEN\nSimpleModuleHeader __module = { NULL, NULL \/* &__gcStatics, &__gcStaticsDescs *\/ };\n\nextern \"C\" int repro_Program__Main();\n\nextern \"C\" void __str_fixup();\nextern \"C\" void __str_fixup_end();\nint __strings_fixup()\n{\n    for (unsigned** ptr = (unsigned**)__str_fixup;\n         ptr < (unsigned**)__str_fixup_end; ptr++)\n    {\n        int utf8Len;\n        uint8_t* bytes = (uint8_t*) *ptr;\n        if (AsmDataFormat::DecodeUnsigned(&bytes, bytes + 5, (unsigned*)&utf8Len) != 0)\n            return -1;\n\n        assert(bytes <= ((uint8_t*)*ptr) + 5);\n        assert(utf8Len >= 0);\n\n        int strLen = 0;\n        if (utf8Len != 0)\n        {\n            strLen = UTF8ToWideCharLen((char*)bytes, utf8Len);\n            if (strLen <= 0) return -1;\n        }\n\n        *((OBJECTHANDLE*)ptr) = __load_static_string_literal(bytes, utf8Len, strLen);\n        \/\/ TODO: This \"handle\" will leak, deallocate with __unload\n    }\n    return 0;\n}\n\nextern \"C\" void* __GCStaticRegionStart;\nextern \"C\" void* __GCStaticRegionEnd;\nint __statics_fixup()\n{\n    for (void** currentBlock = &__GCStaticRegionStart; currentBlock < &__GCStaticRegionEnd; currentBlock++)\n    {\n        Object* gcBlock = __allocate_object((MethodTable*)*currentBlock);\n        *currentBlock = CreateGlobalHandle(ObjectToOBJECTREF(gcBlock));\n    }\n\n    return 0;\n}\n\nint main(int argc, char * argv[]) {\n    if (__initialize_runtime() != 0) return -1;\n    __register_module(&__module);\n    ReversePInvokeFrame frame; __reverse_pinvoke(&frame);\n\t\n    if (__strings_fixup() != 0) return -1;\n    if (__statics_fixup() != 0) return -1;\n\n    repro_Program__Main();\n\n    __reverse_pinvoke_return(&frame);\n    __shutdown_runtime();\n    return 0;\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"RecordManager.hpp\"\r\n#include \"Utility.hpp\"\r\n#include <list>\r\n#include <fstream>\r\n#include <iostream>\r\nusing namespace std;\r\n\/\/calculate the datalen\r\nunsigned int RecordManager::get_datalen(const Entry &entry)\r\n{\r\n\tunsigned int datalen = 0;\r\n\tlist<Wrapper>::const_iterator it;\r\n\tit = entry.begin();\r\n\twhile (it != entry.end())\r\n\t{\r\n\t\tswitch (it->type)\r\n\t\t{\r\n\t\tcase utls::INT:\r\n\t\t\tdatalen += sizeof(int);\r\n\t\t\tbreak;\r\n\t\tcase utls::FLOAT:\r\n\t\t\tdatalen += sizeof(float);\r\n\t\t\tbreak;\r\n\t\tcase utls::CHAR:\r\n\t\t\tdatalen += it->intv * sizeof(char);\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tit++;\r\n\t}\r\n\tfor (unsigned int i = 1; i < datalen; i = i * 2)\r\n\tif (i<=4096)\r\n\t{\r\n\t\tdatalen = i;\r\n\t}\r\n\telse\r\n\t{\r\n        throw runtime_error(\"too large entry\");\r\n\/\/\t\tcerr << \"too large entry\" << endl;\r\n\/\/\t\tabort();\r\n\t}\r\n\treturn datalen;\r\n}\r\n\r\nunsigned int RecordManager::get_datalen(std::string tableName)\r\n{\r\n\tunsigned int datalen;\r\n\tmap<string, unsigned int>::iterator it = datalenTable.find(tableName);\r\n\tif (it != datalenTable.end())\r\n\t{\r\n\t\tdatalen = it->second;\r\n\t}\r\n\telse\r\n\t{\r\n\t\tdatalen = get_datalen_from_file(tableName);\r\n\t\tdatalenTable.insert(make_pair(tableName, datalen));\r\n\t}\r\n\treturn datalen;\r\n}\r\n\r\nunsigned int RecordManager::get_datalen_from_file(std::string tableName)\r\n{\r\n\tunsigned int result;\r\n\tstring filename = tableName + \".db\";\r\n\tifstream infile(filename.c_str(), ios::binary | ios::in);\r\n    if(!infile) throw runtime_error(\"the is no table:\"+tableName);\r\n\tinfile.seekg(sizeof(unsigned int), ios::beg);\r\n\tinfile.read((char *)&result, sizeof(unsigned int));\r\n\tinfile.close();\r\n\treturn result;\r\n}\r\n\r\nWrapper RecordManager::get_wrapper(const std::list<Wrapper>::const_iterator it,const char * temp)\r\n{\r\n\tswitch (it->type)\r\n\t{\r\n\tcase utls::INT:\r\n\t\tint k;\r\n\t\tk = *(int *)temp;\r\n\t\treturn Wrapper(utls::INT, k);\r\n\t\tbreak;\r\n\tcase utls::FLOAT:\r\n\t\tfloat kk;\r\n\t\tkk = *(float *)temp;\r\n\t\treturn Wrapper(utls::FLOAT, kk);\r\n\t\tbreak;\r\n\tcase utls::CHAR:\r\n\t{\r\n        char *ch = new char[it->intv+1];\r\n        for (int i = 0; i < it->intv; i++)\r\n            ch[i] = temp[i];\r\n        ch[it->intv] = 0;\r\n        string s(ch);\r\n        delete[] ch;\r\n        return Wrapper(utls::CHAR, s);\r\n        break;\r\n\t}\r\n\tdefault:\r\n        throw runtime_error(\"getAttValue error\");\r\n\/\/\t\tcerr << \"getAttValue error\" << endl;\r\n\/\/\t\tabort();\r\n\t\tbreak;\r\n\t}\r\n}\r\n\r\n\/\/use the info from API to bulid FilePtr\r\nFilePtr RecordManager::get_fileptr(\r\n\tconst std::string &tablename,\r\n\tconst unsigned int &dataaddr,\r\n\tconst unsigned int &datalen)\r\n{\r\n\tFilePtr addr;\r\n\taddr.filename = tablename + \".db\";\r\n\taddr.dataaddr = dataaddr;\r\n\taddr.datalen = datalen;\r\n\treturn addr;\r\n}\r\n\/\/get the next address\r\nunsigned int  RecordManager::getNext(const  std::string &tableName, bool reset)\r\n{\r\n\tFilePtr addr;\r\n\taddr.datalen = get_datalen(tableName);\r\n\r\n\tif (reset)\r\n\t{\r\n\t\taddr = get_fileptr(tableName, 4096 - addr.datalen, addr.datalen);\r\n\t}\r\n\r\n\taddr = buffer.nextAddr(addr);\r\n\treturn addr.dataaddr;\r\n}\r\n\/\/creat schema,if exist, return false\r\nvoid  RecordManager::creatSchema(\r\n\tconst std::string &tableName,\r\n\tconst Entry &entry)\r\n{\r\n\tFilePtr addr;\r\n\tunsigned int datalen;\r\n\tdatalen = get_datalen(entry);\r\n\taddr = get_fileptr(tableName, 0, datalen);\r\n\tbuffer.create(addr);\r\n}\r\n\/\/build a fileptr,then return the Entry\r\nEntry &  RecordManager::getValue(\r\n\tconst std::string &tableName,\r\n\tconst unsigned int &pos,\r\n\tconst Entry &entry)\r\n{\r\n\tFilePtr addr;\r\n\tint offset = 0;\r\n\tchar * value, *temp;\r\n\tunsigned int datalen = get_datalen(tableName);\r\n\tvalue = new char[datalen];\r\n\taddr = get_fileptr(tableName, pos, datalen);\r\n\tbuffer.Search(addr, value);\r\n\r\n\tEntryResult.clear();\r\n\tlist<Wrapper>::const_iterator it = entry.begin();\r\n\twhile (it != entry.end())\r\n\t{\r\n\t\tswitch (it->type)\r\n\t\t{\r\n\t\tcase utls::INT:\r\n\t\t\toffset += sizeof(int);\r\n\t\t\tbreak;\r\n\t\tcase utls::FLOAT:\r\n\t\t\toffset += sizeof(float);\r\n\t\t\tbreak;\r\n\t\tcase utls::CHAR:\r\n\t\t\toffset += it->intv * sizeof(char);\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n            throw runtime_error(\"type erreor\");\r\n\/\/\t\t\tcerr << \"Type error\" << endl;\r\n\/\/\t\t\tabort();\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\ttemp = value + offset;\r\n\t\tEntryResult.push_back(get_wrapper(it, temp));\r\n\t\tit++;\r\n\t}\r\n\treturn EntryResult;\r\n\r\n}\r\n\/\/build a fileptr,then return the attribuye\r\nWrapper  RecordManager::getAttValue(\r\n\tconst std::string &tableName,\r\n\tconst unsigned int &pos,\r\n\tconst std::string &colName,\r\n\tconst Entry &entry)\r\n{\r\n\tFilePtr addr;\r\n\tint offset = 0;\r\n\tchar * value, *temp;\r\n\tunsigned int datalen = get_datalen(tableName);\r\n\tvalue = new char[datalen];\r\n\taddr = get_fileptr(tableName, pos, datalen);\r\n\tbuffer.Search(addr, value);\r\n\r\n\tlist<Wrapper>::const_iterator it = entry.begin();\r\n\twhile (it != entry.end())\r\n\t{\r\n\t\tif (colName != it->name)\r\n\t\t{\r\n\t\t\tswitch (it->type)\r\n\t\t\t{\r\n\t\t\tcase utls::INT:\r\n\t\t\t\toffset += sizeof(int);\r\n\t\t\t\tbreak;\r\n\t\t\tcase utls::FLOAT:\r\n\t\t\t\toffset += sizeof(float);\r\n\t\t\t\tbreak;\r\n\t\t\tcase utls::CHAR:\r\n\t\t\t\toffset += it->intv * sizeof(char);\r\n\t\t\t\tbreak;\r\n\t\t\tdefault:\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t\telse\r\n\t\t\tbreak;\r\n\t\tit++;\r\n\t}\r\n\tif (it == entry.end())\r\n\t{\r\n        throw runtime_error(\"there is no such attribute:\"+colName);\r\n\/\/\t\tcerr << \"there is no attribute \" + colName << endl;\r\n\/\/\t\tabort();\r\n\t}\r\n\ttemp = value + offset;\r\n\treturn get_wrapper(it, temp);\r\n}\r\n\/\/delete the entry pionted\r\nvoid  RecordManager::deleteEntry(\r\n\tconst std::string &tableName,\r\n\tconst unsigned int &pos)\r\n{\r\n\tFilePtr addr;\r\n\taddr = get_fileptr(tableName, pos, get_datalen(tableName));\r\n    buffer.remove(addr);\r\n\r\n    --totalEntries[tableName];\r\n}\r\n\r\nvoid RecordManager::deleteEntry(const std::string &tableName)\r\n{\r\n    int total = totalEntries[tableName];\r\n    totalEntries[tableName] = 0;\r\n\r\n\tFilePtr addr;\r\n\taddr = get_fileptr(tableName, 0, get_datalen(tableName));\r\n\tbuffer.Drop(addr);\r\n\tbuffer.create(addr);\r\n\r\n    return total;\r\n}\r\n\r\nbool RecordManager::dropSchema(const std::string &tableName)\r\n{\r\n    totalEntries.erase(tableName);\r\n\r\n\tFilePtr addr;\r\n\taddr = get_fileptr(tableName, 0, 0);\r\n\tbuffer.Drop(addr);\r\n\treturn true;\r\n}\r\n\r\nunsigned int  RecordManager::insertEntry(\r\n\tconst std::string &tableName,\r\n\tconst Entry &entry)\r\n{\r\n    if (totalEntries.count(tableName) == 0) totalEntries[tableName] = 1;\r\n    else ++totalEntries[tableName];\r\n\r\n\r\n\tFilePtr addr;\r\n\tchar * insertvalue, * temp;\r\n\tint offset = 0;\r\n\taddr = get_fileptr(tableName, 0, get_datalen(tableName));\r\n\tinsertvalue = new char[addr.dataaddr];\r\n\tlist<Wrapper>::const_iterator it = entry.begin();\r\n\twhile (it != entry.end());\r\n\t{\r\n\t\ttemp = insertvalue + offset;\r\n\t\tswitch (it->type)\r\n\t\t{\r\n\t\tcase utls::INT:\r\n\t\t\tfor (int i = 0; i < sizeof (int); i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[i] = *(char *)(&(it->intv)+i);\r\n\t\t\t}\r\n\t\t\toffset += sizeof(int);\r\n\t\tcase utls::FLOAT:\r\n\t\t\tfor (int i = 0; i < sizeof (float); i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[i] = *((char *)&(it->floatv) + i);\r\n\t\t\t}\r\n\t\t\toffset += sizeof(float);\r\n\t\tcase utls::CHAR:\r\n\t\t\tfor (unsigned int i = 0; i < it->strv.length(); i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[i] = it->strv[i];\r\n\t\t\t}\r\n\t\t\ttemp[it->strv.length()] = 0;\r\n\t\t\toffset += it->intv * sizeof(char);\r\n\t\tdefault:\r\n            throw runtime_error(\"insert attribute type error\");\r\n\/\/\t\t\tcerr << \"insert attribute type error\" << endl;\r\n\/\/\t\t\tabort();\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tit++;\r\n\t}\r\n\tbuffer.Insert(addr, insertvalue);\r\n}\r\n<commit_msg>record<commit_after>#include \"RecordManager.hpp\"\r\n#include \"Utility.hpp\"\r\n#include <list>\r\n#include <fstream>\r\n#include <iostream>\r\nusing namespace std;\r\n\/\/calculate the datalen\r\nunsigned int RecordManager::get_datalen(const Entry &entry)\r\n{\r\n\tunsigned int datalen = 0;\r\n\tlist<Wrapper>::const_iterator it;\r\n\tit = entry.begin();\r\n\twhile (it != entry.end())\r\n\t{\r\n\t\tswitch (it->type)\r\n\t\t{\r\n\t\tcase utls::INT:\r\n\t\t\tdatalen += sizeof(int);\r\n\t\t\tbreak;\r\n\t\tcase utls::FLOAT:\r\n\t\t\tdatalen += sizeof(float);\r\n\t\t\tbreak;\r\n\t\tcase utls::CHAR:\r\n\t\t\tdatalen += it->intv * sizeof(char);\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tit++;\r\n\t}\r\n    for (unsigned int i = 1; i < datalen; i = i * 2);\r\n\tif (i<=4096)\r\n\t{\r\n\t\tdatalen = i;\r\n\t}\r\n\telse\r\n\t{\r\n        throw runtime_error(\"too large entry\");\r\n\/\/\t\tcerr << \"too large entry\" << endl;\r\n\/\/\t\tabort();\r\n\t}\r\n\treturn datalen;\r\n}\r\n\r\nunsigned int RecordManager::get_datalen(std::string tableName)\r\n{\r\n\tunsigned int datalen;\r\n\tmap<string, unsigned int>::iterator it = datalenTable.find(tableName);\r\n\tif (it != datalenTable.end())\r\n\t{\r\n\t\tdatalen = it->second;\r\n\t}\r\n\telse\r\n\t{\r\n\t\tdatalen = get_datalen_from_file(tableName);\r\n\t\tdatalenTable.insert(make_pair(tableName, datalen));\r\n\t}\r\n\treturn datalen;\r\n}\r\n\r\nunsigned int RecordManager::get_datalen_from_file(std::string tableName)\r\n{\r\n\tunsigned int result;\r\n\tstring filename = tableName + \".db\";\r\n\tifstream infile(filename.c_str(), ios::binary | ios::in);\r\n    if(!infile) throw runtime_error(\"the is no table:\"+tableName);\r\n\tinfile.seekg(sizeof(unsigned int), ios::beg);\r\n\tinfile.read((char *)&result, sizeof(unsigned int));\r\n\tinfile.close();\r\n\treturn result;\r\n}\r\n\r\nWrapper RecordManager::get_wrapper(const std::list<Wrapper>::const_iterator it,const char * temp)\r\n{\r\n\tswitch (it->type)\r\n\t{\r\n\tcase utls::INT:\r\n\t\tint k;\r\n\t\tk = *(int *)temp;\r\n\t\treturn Wrapper(utls::INT, k);\r\n\t\tbreak;\r\n\tcase utls::FLOAT:\r\n\t\tfloat kk;\r\n\t\tkk = *(float *)temp;\r\n\t\treturn Wrapper(utls::FLOAT, kk);\r\n\t\tbreak;\r\n\tcase utls::CHAR:\r\n\t{\r\n        char *ch = new char[it->intv+1];\r\n        for (int i = 0; i < it->intv; i++)\r\n            ch[i] = temp[i];\r\n        ch[it->intv] = 0;\r\n        string s(ch);\r\n        delete[] ch;\r\n        return Wrapper(utls::CHAR, s);\r\n        break;\r\n\t}\r\n\tdefault:\r\n        throw runtime_error(\"getAttValue error\");\r\n\/\/\t\tcerr << \"getAttValue error\" << endl;\r\n\/\/\t\tabort();\r\n\t\tbreak;\r\n\t}\r\n}\r\n\r\n\/\/use the info from API to bulid FilePtr\r\nFilePtr RecordManager::get_fileptr(\r\n\tconst std::string &tablename,\r\n\tconst unsigned int &dataaddr,\r\n\tconst unsigned int &datalen)\r\n{\r\n\tFilePtr addr;\r\n\taddr.filename = tablename + \".db\";\r\n\taddr.dataaddr = dataaddr;\r\n\taddr.datalen = datalen;\r\n\treturn addr;\r\n}\r\n\/\/get the next address\r\nunsigned int  RecordManager::getNext(const  std::string &tableName, bool reset)\r\n{\r\n\tFilePtr addr;\r\n\taddr.datalen = get_datalen(tableName);\r\n\r\n\tif (reset)\r\n\t{\r\n\t\taddr = get_fileptr(tableName, 4096 - addr.datalen, addr.datalen);\r\n\t}\r\n\r\n\taddr = buffer.nextAddr(addr);\r\n\treturn addr.dataaddr;\r\n}\r\n\/\/creat schema,if exist, return false\r\nvoid  RecordManager::creatSchema(\r\n\tconst std::string &tableName,\r\n\tconst Entry &entry)\r\n{\r\n\tFilePtr addr;\r\n\tunsigned int datalen;\r\n\tdatalen = get_datalen(entry);\r\n\taddr = get_fileptr(tableName, 0, datalen);\r\n\tbuffer.create(addr);\r\n}\r\n\/\/build a fileptr,then return the Entry\r\nEntry &  RecordManager::getValue(\r\n\tconst std::string &tableName,\r\n\tconst unsigned int &pos,\r\n\tconst Entry &entry)\r\n{\r\n\tFilePtr addr;\r\n\tint offset = 0;\r\n\tchar * value, *temp;\r\n\tunsigned int datalen = get_datalen(tableName);\r\n\tvalue = new char[datalen];\r\n\taddr = get_fileptr(tableName, pos, datalen);\r\n\tbuffer.Search(addr, value);\r\n\r\n\tEntryResult.clear();\r\n\tlist<Wrapper>::const_iterator it = entry.begin();\r\n\twhile (it != entry.end())\r\n\t{\r\n\t\tswitch (it->type)\r\n\t\t{\r\n\t\tcase utls::INT:\r\n\t\t\toffset += sizeof(int);\r\n\t\t\tbreak;\r\n\t\tcase utls::FLOAT:\r\n\t\t\toffset += sizeof(float);\r\n\t\t\tbreak;\r\n\t\tcase utls::CHAR:\r\n\t\t\toffset += it->intv * sizeof(char);\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n            throw runtime_error(\"type erreor\");\r\n\/\/\t\t\tcerr << \"Type error\" << endl;\r\n\/\/\t\t\tabort();\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\ttemp = value + offset;\r\n\t\tEntryResult.push_back(get_wrapper(it, temp));\r\n\t\tit++;\r\n\t}\r\n\treturn EntryResult;\r\n\r\n}\r\n\/\/build a fileptr,then return the attribuye\r\nWrapper  RecordManager::getAttValue(\r\n\tconst std::string &tableName,\r\n\tconst unsigned int &pos,\r\n\tconst std::string &colName,\r\n\tconst Entry &entry)\r\n{\r\n\tFilePtr addr;\r\n\tint offset = 0;\r\n\tchar * value, *temp;\r\n\tunsigned int datalen = get_datalen(tableName);\r\n\tvalue = new char[datalen];\r\n\taddr = get_fileptr(tableName, pos, datalen);\r\n\tbuffer.Search(addr, value);\r\n\r\n\tlist<Wrapper>::const_iterator it = entry.begin();\r\n\twhile (it != entry.end())\r\n\t{\r\n\t\tif (colName != it->name)\r\n\t\t{\r\n\t\t\tswitch (it->type)\r\n\t\t\t{\r\n\t\t\tcase utls::INT:\r\n\t\t\t\toffset += sizeof(int);\r\n\t\t\t\tbreak;\r\n\t\t\tcase utls::FLOAT:\r\n\t\t\t\toffset += sizeof(float);\r\n\t\t\t\tbreak;\r\n\t\t\tcase utls::CHAR:\r\n\t\t\t\toffset += it->intv * sizeof(char);\r\n\t\t\t\tbreak;\r\n\t\t\tdefault:\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t\telse\r\n\t\t\tbreak;\r\n\t\tit++;\r\n\t}\r\n\tif (it == entry.end())\r\n\t{\r\n        throw runtime_error(\"there is no such attribute:\"+colName);\r\n\/\/\t\tcerr << \"there is no attribute \" + colName << endl;\r\n\/\/\t\tabort();\r\n\t}\r\n\ttemp = value + offset;\r\n\treturn get_wrapper(it, temp);\r\n}\r\n\/\/delete the entry pionted\r\nvoid  RecordManager::deleteEntry(\r\n\tconst std::string &tableName,\r\n\tconst unsigned int &pos)\r\n{\r\n\tFilePtr addr;\r\n\taddr = get_fileptr(tableName, pos, get_datalen(tableName));\r\n    buffer.remove(addr);\r\n\r\n    --totalEntries[tableName];\r\n}\r\n\r\nvoid RecordManager::deleteEntry(const std::string &tableName)\r\n{\r\n    int total = totalEntries[tableName];\r\n    totalEntries[tableName] = 0;\r\n\r\n\tFilePtr addr;\r\n\taddr = get_fileptr(tableName, 0, get_datalen(tableName));\r\n\tbuffer.Drop(addr);\r\n\tbuffer.create(addr);\r\n\r\n    return total;\r\n}\r\n\r\nbool RecordManager::dropSchema(const std::string &tableName)\r\n{\r\n    totalEntries.erase(tableName);\r\n\r\n\tFilePtr addr;\r\n\taddr = get_fileptr(tableName, 0, 0);\r\n\tbuffer.Drop(addr);\r\n\treturn true;\r\n}\r\n\r\nunsigned int  RecordManager::insertEntry(\r\n\tconst std::string &tableName,\r\n\tconst Entry &entry)\r\n{\r\n    if (totalEntries.count(tableName) == 0) totalEntries[tableName] = 1;\r\n    else ++totalEntries[tableName];\r\n\r\n\r\n\tFilePtr addr;\r\n\tchar * insertvalue, * temp;\r\n\tint offset = 0;\r\n\taddr = get_fileptr(tableName, 0, get_datalen(tableName));\r\n\tinsertvalue = new char[addr.dataaddr];\r\n\tlist<Wrapper>::const_iterator it = entry.begin();\r\n\twhile (it != entry.end());\r\n\t{\r\n\t\ttemp = insertvalue + offset;\r\n\t\tswitch (it->type)\r\n\t\t{\r\n\t\tcase utls::INT:\r\n\t\t\tfor (int i = 0; i < sizeof (int); i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[i] = *(char *)(&(it->intv)+i);\r\n\t\t\t}\r\n\t\t\toffset += sizeof(int);\r\n\t\tcase utls::FLOAT:\r\n\t\t\tfor (int i = 0; i < sizeof (float); i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[i] = *((char *)&(it->floatv) + i);\r\n\t\t\t}\r\n\t\t\toffset += sizeof(float);\r\n\t\tcase utls::CHAR:\r\n\t\t\tfor (unsigned int i = 0; i < it->strv.length(); i++)\r\n\t\t\t{\r\n\t\t\t\ttemp[i] = it->strv[i];\r\n\t\t\t}\r\n\t\t\ttemp[it->strv.length()] = 0;\r\n\t\t\toffset += it->intv * sizeof(char);\r\n\t\tdefault:\r\n            throw runtime_error(\"insert attribute type error\");\r\n\/\/\t\t\tcerr << \"insert attribute type error\" << endl;\r\n\/\/\t\t\tabort();\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tit++;\r\n\t}\r\n\tbuffer.Insert(addr, insertvalue);\r\n}\r\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\/**\n * \n * @author David N. Bertoni (david_n_bertoni@lotus.com)\n * *\/\n\n\n\n\/\/ Base class header file.\n#include \"ProblemListenerDefault.hpp\"\n\n\n\n#include <XalanDOM\/XalanNode.hpp>\n\n\n\n#include <PlatformSupport\/DOMStringHelper.hpp>\n#include <PlatformSupport\/PrintWriter.hpp>\n\n\n\n#include <XSLT\/ElemTemplateElement.hpp>\n\n\n\nstatic const char* const\terrorHeader = \"error: \";\nstatic const char* const\twarningHeader = \"warning: \";\n\nstatic const char* const\txslHeader = \"XSLT \";\nstatic const char* const\txmlHeader = \"XML \";\nstatic const char* const\txpathHeader = \"XPath \";\n\nstatic const char* const\tstyleTreeNodeHeader = \", style tree node: \";\nstatic const char* const\tsourceTreeNodeHeader = \", source tree node: \";\nstatic const char* const\tlocationOpen = \" (\";\nstatic const char* const\turiHeader = \"\";\nstatic const char* const\tlineNoHeader = \", line \";\nstatic const char* const\tcharOffsetHeader = \", column \";\nstatic const char* const\tlocationClose = \")\";\n\n\n\nProblemListenerDefault::ProblemListenerDefault(PrintWriter*\t\tpw) :\n\tProblemListener(),\n\tm_pw(pw)\n{\n}\n\n\n\nProblemListenerDefault::~ProblemListenerDefault()\n{\n\tm_pw = 0;\n}\n\n\n\nvoid\nProblemListenerDefault::setPrintWriter(PrintWriter*\t\tpw)\n{\n\tm_pw = pw;\n}\n\n\n\nvoid\nProblemListenerDefault::problem(\n\t\t\teProblemSource\t\t\twhere,\n\t\t\teClassification\t\t\tclassification, \n\t\t\tconst XalanNode*\t\tsourceNode,\n\t\t\tconst XalanNode*\t\tstyleNode,\n\t\t\tconst XalanDOMString&\tmsg,\n\t\t\tconst XalanDOMChar*\t\turi,\n\t\t\tint\t\t\t\t\t\tlineNo,\n\t\t\tint\t\t\t\t\t\tcharOffset)\n{\n\tif (m_pw != 0)\n\t{\n\t\tif (eXMLPARSER == where)\n\t\t{\n\t\t\tm_pw->print(xmlHeader);\n\t\t}\n\t\telse if (eXPATH == where)\n\t\t{\n\t\t\tm_pw->print(xpathHeader);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_pw->print(xslHeader);\n\t\t}\n\n\t\tif (eERROR == classification)\n\t\t{\n\t\t\tm_pw->print(errorHeader);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_pw->print(warningHeader);\n\t\t}\n\n\t\tm_pw->print(msg);\n\n\t\tif (0 != styleNode)\n\t\t{\n\t\t\tm_pw->print(styleTreeNodeHeader);\n\t\t\tm_pw->print(styleNode->getNodeName());\n\t\t}\n\n\t\tif (0 != sourceNode)\n\t\t{\n\t\t\tm_pw->print(sourceTreeNodeHeader);\n\t\t\tm_pw->print(sourceNode->getNodeName());\n\t\t}\n\n\t\tm_pw->print(locationOpen);\n\n\t\tif (0 != uri)\n\t\t{\n\t\t\tm_pw->print(uriHeader);\n\t\t\tm_pw->print(uri);\n\t\t}\n\n\t\tif (0 != lineNo)\n\t\t{\n\t\t\tm_pw->print(lineNoHeader);\n\t\t\tm_pw->print(lineNo);\n\t\t}\n\n\t\tif (0 != charOffset)\n\t\t{\n\t\t\tm_pw->print(charOffsetHeader);\n\t\t\tm_pw->print(charOffset);\n\t\t}\n\n\t\tm_pw->print(locationClose);\n\n\t\tm_pw->println();\n\t}\n}\n<commit_msg>Removed bogus destructor code.<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\/**\n * \n * @author David N. Bertoni (david_n_bertoni@lotus.com)\n * *\/\n\n\n\n\/\/ Base class header file.\n#include \"ProblemListenerDefault.hpp\"\n\n\n\n#include <XalanDOM\/XalanNode.hpp>\n\n\n\n#include <PlatformSupport\/DOMStringHelper.hpp>\n#include <PlatformSupport\/PrintWriter.hpp>\n\n\n\n#include <XSLT\/ElemTemplateElement.hpp>\n\n\n\nstatic const char* const\terrorHeader = \"error: \";\nstatic const char* const\twarningHeader = \"warning: \";\n\nstatic const char* const\txslHeader = \"XSLT \";\nstatic const char* const\txmlHeader = \"XML \";\nstatic const char* const\txpathHeader = \"XPath \";\n\nstatic const char* const\tstyleTreeNodeHeader = \", style tree node: \";\nstatic const char* const\tsourceTreeNodeHeader = \", source tree node: \";\nstatic const char* const\tlocationOpen = \" (\";\nstatic const char* const\turiHeader = \"\";\nstatic const char* const\tlineNoHeader = \", line \";\nstatic const char* const\tcharOffsetHeader = \", column \";\nstatic const char* const\tlocationClose = \")\";\n\n\n\nProblemListenerDefault::ProblemListenerDefault(PrintWriter*\t\tpw) :\n\tProblemListener(),\n\tm_pw(pw)\n{\n}\n\n\n\nProblemListenerDefault::~ProblemListenerDefault()\n{\n}\n\n\n\nvoid\nProblemListenerDefault::setPrintWriter(PrintWriter*\t\tpw)\n{\n\tm_pw = pw;\n}\n\n\n\nvoid\nProblemListenerDefault::problem(\n\t\t\teProblemSource\t\t\twhere,\n\t\t\teClassification\t\t\tclassification, \n\t\t\tconst XalanNode*\t\tsourceNode,\n\t\t\tconst XalanNode*\t\tstyleNode,\n\t\t\tconst XalanDOMString&\tmsg,\n\t\t\tconst XalanDOMChar*\t\turi,\n\t\t\tint\t\t\t\t\t\tlineNo,\n\t\t\tint\t\t\t\t\t\tcharOffset)\n{\n\tif (m_pw != 0)\n\t{\n\t\tif (eXMLPARSER == where)\n\t\t{\n\t\t\tm_pw->print(xmlHeader);\n\t\t}\n\t\telse if (eXPATH == where)\n\t\t{\n\t\t\tm_pw->print(xpathHeader);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_pw->print(xslHeader);\n\t\t}\n\n\t\tif (eERROR == classification)\n\t\t{\n\t\t\tm_pw->print(errorHeader);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_pw->print(warningHeader);\n\t\t}\n\n\t\tm_pw->print(msg);\n\n\t\tif (0 != styleNode)\n\t\t{\n\t\t\tm_pw->print(styleTreeNodeHeader);\n\t\t\tm_pw->print(styleNode->getNodeName());\n\t\t}\n\n\t\tif (0 != sourceNode)\n\t\t{\n\t\t\tm_pw->print(sourceTreeNodeHeader);\n\t\t\tm_pw->print(sourceNode->getNodeName());\n\t\t}\n\n\t\tm_pw->print(locationOpen);\n\n\t\tif (0 != uri)\n\t\t{\n\t\t\tm_pw->print(uriHeader);\n\t\t\tm_pw->print(uri);\n\t\t}\n\n\t\tif (0 != lineNo)\n\t\t{\n\t\t\tm_pw->print(lineNoHeader);\n\t\t\tm_pw->print(lineNo);\n\t\t}\n\n\t\tif (0 != charOffset)\n\t\t{\n\t\t\tm_pw->print(charOffsetHeader);\n\t\t\tm_pw->print(charOffset);\n\t\t}\n\n\t\tm_pw->print(locationClose);\n\n\t\tm_pw->println();\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"PrecursorKernelAction.h\"\n#include \"Factory.h\"\n#include \"Parser.h\"\n#include \"Conversion.h\"\n#include \"FEProblem.h\"\n\ntemplate<>\nInputParameters validParams<PrecursorKernelAction>()\n{\n  InputParameters params = validParams<AddVariableAction>();\n  params.addRequiredParam<int>(\"num_precursor_groups\", \"specifies the total number of precursors to create\");\n  params.addRequiredParam<std::string>(\"var_name_base\", \"specifies the base name of the variables\");\n  params.addParam<VariableName>(\"T\", \"Name of temperature variable\");\n  params.addParam<VariableName>(\"u\", \"Name of x-component of velocity\");\n  params.addParam<VariableName>(\"v\", \"Name of y-component of velocity\");\n  params.addParam<VariableName>(\"w\", \"Name of z-component of velocity\");\n  params.addParam<Real>(\"u_def\", \"Allows user to specify constant value for u component of velocity.\");\n  params.addParam<Real>(\"v_def\", \"Allows user to specify constant value for v component of velocity.\");\n  params.addParam<Real>(\"w_def\", \"Allows user to specify constant value for w component of velocity.\");\n  params.addRequiredParam<std::vector<VariableName> >(\"group_fluxes\", \"All the variables that hold the group fluxes. These MUST be listed by decreasing energy\/increasing group number.\");\n  params.addRequiredParam<int>(\"num_groups\", \"The total number of energy groups.\");\n  params.addParam<bool>(\"transient_simulation\", false, \"Whether to conduct a transient simulation.\");\n  params.addParam<std::vector<SubdomainName> >(\"block\", \"The list of block ids (SubdomainID) that this object will be applied to\");\n  params.addRequiredParam<std::vector<BoundaryName> >(\"inlet_boundary\", \"The inlet boundary for the precursors.\");\n  params.addRequiredParam<std::string>(\"inlet_boundary_condition\", \"The type of boundary condition to apply at the inlet.\");\n  params.addParam<Real>(\"inlet_dirichlet_value\", \"If inlet_boundary_condition is DirichletBC, specify the value.\");\n  params.addRequiredParam<std::vector<BoundaryName> >(\"outlet_boundary\", \"The outlet boundary for the precursors.\");\n  params.addParam<bool>(\"add_artificial_diffusion\", true, \"Whether to add artificial diffusion\");\n  params.addParam<bool>(\"incompressible_flow\", true, \"Determines whether we use a divergence-free form of the advecting velocity.\");\n  params.addParam<bool>(\"use_exp_form\", \"Whether concentrations should be in an expotential\/logarithmic format.\");\n  return params;\n}\n\nPrecursorKernelAction::PrecursorKernelAction(const InputParameters & params) :\n    AddVariableAction(params),\n    _num_precursor_groups(getParam<int>(\"num_precursor_groups\")),\n    _var_name_base(getParam<std::string>(\"var_name_base\")),\n    _num_groups(getParam<int>(\"num_groups\"))\n{\n}\n\nvoid\nPrecursorKernelAction::act()\n{\n  for (int op = 1; op <= _num_precursor_groups; ++op)\n  {\n    \/\/\n    \/\/ Create variable names\n    \/\/\n\n    std::string var_name = _var_name_base + Moose::stringify(op);\n\n    if (_current_task == \"add_variable\")\n      addVariable(var_name);\n\n    if (_current_task == \"add_kernel\")\n    {\n      \/\/\n      \/\/ Set up advection kernels\n      \/\/\n      if (getParam<bool>(\"incompressible_flow\"))\n      {\n        InputParameters params = _factory.getValidParams(\"DivFreeCoupledScalarAdvection\");\n        params.set<NonlinearVariableName>(\"variable\") = var_name;\n        if (isParamValid(\"u\"))\n          params.set<std::vector<VariableName> >(\"u\") = {getParam<VariableName>(\"u\")};\n        else if (isParamValid(\"u_def\"))\n          params.set<Real>(\"u_def\") = getParam<Real>(\"u_def\");\n        if (isParamValid(\"v\"))\n          params.set<std::vector<VariableName> >(\"v\") = {getParam<VariableName>(\"v\")};\n        else if (isParamValid(\"v_def\"))\n          params.set<Real>(\"v_def\") = getParam<Real>(\"v_def\");\n        if (isParamValid(\"w\"))\n          params.set<std::vector<VariableName> >(\"w\") = {getParam<VariableName>(\"w\")};\n        else if (isParamValid(\"w_def\"))\n          params.set<Real>(\"w_def\") = getParam<Real>(\"w_def\");\n        if (isParamValid(\"block\"))\n          params.set<std::vector<SubdomainName> >(\"block\") = getParam<std::vector<SubdomainName> >(\"block\");\n\n        std::string kernel_name = \"DivFreeCoupledScalarAdvection_\" + var_name;\n        _problem->addKernel(\"DivFreeCoupledScalarAdvection\", kernel_name, params);\n      }\n      else\n      {\n        InputParameters params = _factory.getValidParams(\"CoupledScalarAdvection\");\n        params.set<NonlinearVariableName>(\"variable\") = var_name;\n        if (isParamValid(\"u\"))\n          params.set<std::vector<VariableName> >(\"u\") = {getParam<VariableName>(\"u\")};\n        else if (isParamValid(\"u_def\"))\n          params.set<Real>(\"u_def\") = getParam<Real>(\"u_def\");\n        if (isParamValid(\"v\"))\n          params.set<std::vector<VariableName> >(\"v\") = {getParam<VariableName>(\"v\")};\n        else if (isParamValid(\"v_def\"))\n          params.set<Real>(\"v_def\") = getParam<Real>(\"v_def\");\n        if (isParamValid(\"w\"))\n          params.set<std::vector<VariableName> >(\"w\") = {getParam<VariableName>(\"w\")};\n        else if (isParamValid(\"w_def\"))\n          params.set<Real>(\"w_def\") = getParam<Real>(\"w_def\");\n        if (isParamValid(\"block\"))\n          params.set<std::vector<SubdomainName> >(\"block\") = getParam<std::vector<SubdomainName> >(\"block\");\n        if (isParamValid(\"use_exp_form\"))\n          params.set<bool>(\"use_exp_form\") = getParam<bool>(\"use_exp_form\");\n\n        std::string kernel_name = \"CoupledScalarAdvection_\" + var_name;\n        _problem->addKernel(\"CoupledScalarAdvection\", kernel_name, params);\n      }\n\n\n      \/\/ Set up PrecursorSource kernels\n\n      {\n        InputParameters params = _factory.getValidParams(\"PrecursorSource\");\n        params.set<NonlinearVariableName>(\"variable\") = var_name;\n        params.set<int>(\"num_groups\") = _num_groups;\n        params.set<std::vector<VariableName> >(\"group_fluxes\") = getParam<std::vector<VariableName> >(\"group_fluxes\");\n        params.set<int>(\"precursor_group_number\") = op;\n        if (isParamValid(\"T\"))\n          params.set<std::vector<VariableName> >(\"temperature\") = {getParam<VariableName>(\"T\")};\n        if (isParamValid(\"block\"))\n          params.set<std::vector<SubdomainName> >(\"block\") = getParam<std::vector<SubdomainName> >(\"block\");\n\n        std::string kernel_name = \"PrecursorSource_\" + var_name;\n        _problem->addKernel(\"PrecursorSource\", kernel_name, params);\n      }\n\n      \/\/\n      \/\/ Set up PrecursorDecay kernels\n      \/\/\n\n      {\n        InputParameters params = _factory.getValidParams(\"PrecursorDecay\");\n        params.set<NonlinearVariableName>(\"variable\") = var_name;\n        params.set<int>(\"precursor_group_number\") = op;\n        if (isParamValid(\"T\"))\n          params.set<std::vector<VariableName> >(\"temperature\") = {getParam<VariableName>(\"T\")};\n        if (isParamValid(\"block\"))\n          params.set<std::vector<SubdomainName> >(\"block\") = getParam<std::vector<SubdomainName> >(\"block\");\n\n        std::string kernel_name = \"PrecursorDecay_\" + var_name;\n        _problem->addKernel(\"PrecursorDecay\", kernel_name, params);\n      }\n\n      \/\/\n      \/\/ If doing a transient simulation, set up TimeDerivative kernels\n      \/\/\n\n      if (getParam<bool>(\"transient_simulation\"))\n      {\n        InputParameters params = _factory.getValidParams(\"ScalarTransportTimeDerivative\");\n        params.set<NonlinearVariableName>(\"variable\") = var_name;\n        params.set<bool>(\"implicit\") = true;\n        if (isParamValid(\"block\"))\n          params.set<std::vector<SubdomainName> >(\"block\") = getParam<std::vector<SubdomainName> >(\"block\");\n\n        std::string kernel_name = \"ScalarTransportTimeDerivative_\" + var_name;\n        _problem->addKernel(\"ScalarTransportTimeDerivative\", kernel_name, params);\n      }\n\n      \/\/ Set up artificial diffusion\n\n      if (getParam<bool>(\"add_artificial_diffusion\"))\n      {\n        InputParameters params = _factory.getValidParams(\"ScalarAdvectionArtDiff\");\n        params.set<NonlinearVariableName>(\"variable\") = var_name;\n        if (isParamValid(\"u\"))\n          params.set<std::vector<VariableName> >(\"u\") = {getParam<VariableName>(\"u\")};\n        else if (isParamValid(\"u_def\"))\n          params.set<Real>(\"u_def\") = getParam<Real>(\"u_def\");\n        if (isParamValid(\"v\"))\n          params.set<std::vector<VariableName> >(\"v\") = {getParam<VariableName>(\"v\")};\n        else if (isParamValid(\"v_def\"))\n          params.set<Real>(\"v_def\") = getParam<Real>(\"v_def\");\n        if (isParamValid(\"w\"))\n          params.set<std::vector<VariableName> >(\"w\") = {getParam<VariableName>(\"w\")};\n        else if (isParamValid(\"w_def\"))\n          params.set<Real>(\"w_def\") = getParam<Real>(\"w_def\");\n        if (isParamValid(\"block\"))\n          params.set<std::vector<SubdomainName> >(\"block\") = getParam<std::vector<SubdomainName> >(\"block\");\n\n        std::string kernel_name = \"ScalarAdvectionArtDiff_\" + var_name;\n        _problem->addKernel(\"ScalarAdvectionArtDiff\", kernel_name, params);\n      }\n    }\n\n    if (_current_task == \"add_bc\")\n    {\n\n      \/\/ Set up precursor inlet boundary conditions\n\n\n      {\n        std::string bc_type_name = getParam<std::string>(\"inlet_boundary_condition\");\n        InputParameters params = _factory.getValidParams(bc_type_name);\n        params.set<std::vector<BoundaryName> >(\"boundary\") = getParam<std::vector<BoundaryName> >(\"inlet_boundary\");\n        params.set<NonlinearVariableName>(\"variable\") = var_name;\n        if (bc_type_name == \"DirichletBC\")\n          params.set<Real>(\"value\") = getParam<Real>(\"inlet_dirichlet_value\");\n        std::string bc_name = bc_type_name + \"_\" + var_name;\n        _problem->addBoundaryCondition(bc_type_name, bc_name, params);\n      }\n\n      \/\/\n      \/\/ Set up precursor outlet boundary conditions\n      \/\/\n\n      if (!(getParam<bool>(\"incompressible_flow\")))\n      {\n        InputParameters params = _factory.getValidParams(\"CoupledScalarAdvectionNoBCBC\");\n        params.set<std::vector<BoundaryName> >(\"boundary\") = getParam<std::vector<BoundaryName> >(\"outlet_boundary\");\n        params.set<NonlinearVariableName>(\"variable\") = var_name;\n        if (isParamValid(\"u\"))\n          params.set<std::vector<VariableName> >(\"u\") = {getParam<VariableName>(\"u\")};\n        else if (isParamValid(\"u_def\"))\n          params.set<Real>(\"u_def\") = getParam<Real>(\"u_def\");\n        if (isParamValid(\"v\"))\n          params.set<std::vector<VariableName> >(\"v\") = {getParam<VariableName>(\"v\")};\n        else if (isParamValid(\"v_def\"))\n          params.set<Real>(\"v_def\") = getParam<Real>(\"v_def\");\n        if (isParamValid(\"w\"))\n          params.set<std::vector<VariableName> >(\"w\") = {getParam<VariableName>(\"w\")};\n        else if (isParamValid(\"w_def\"))\n          params.set<Real>(\"w_def\") = getParam<Real>(\"w_def\");\n\n        std::string bc_name = \"CoupledScalarAdvectionNoBCBC_\" + var_name;\n        _problem->addBoundaryCondition(\"CoupledScalarAdvectionNoBCBC\", bc_name, params);\n      }\n\n      \/\/ Set up artificial diffusion\n\n      if (getParam<bool>(\"add_artificial_diffusion\"))\n      {\n        InputParameters params = _factory.getValidParams(\"ScalarAdvectionArtDiffNoBCBC\");\n        params.set<std::vector<BoundaryName> >(\"boundary\") = getParam<std::vector<BoundaryName> >(\"outlet_boundary\");\n        params.set<NonlinearVariableName>(\"variable\") = var_name;\n        if (isParamValid(\"u\"))\n          params.set<std::vector<VariableName> >(\"u\") = {getParam<VariableName>(\"u\")};\n        else if (isParamValid(\"u_def\"))\n          params.set<Real>(\"u_def\") = getParam<Real>(\"u_def\");\n        if (isParamValid(\"v\"))\n          params.set<std::vector<VariableName> >(\"v\") = {getParam<VariableName>(\"v\")};\n        else if (isParamValid(\"v_def\"))\n          params.set<Real>(\"v_def\") = getParam<Real>(\"v_def\");\n        if (isParamValid(\"w\"))\n          params.set<std::vector<VariableName> >(\"w\") = {getParam<VariableName>(\"w\")};\n        else if (isParamValid(\"w_def\"))\n          params.set<Real>(\"w_def\") = getParam<Real>(\"w_def\");\n\n        std::string bc_name = \"ScalarAdvectionArtDiffNoBCBC_\" + var_name;\n        _problem->addBoundaryCondition(\"ScalarAdvectionArtDiffNoBCBC\", bc_name, params);\n      }\n\n    }\n  }\n}\n<commit_msg>Add ICs in PrecursorAction.<commit_after>#include \"PrecursorKernelAction.h\"\n#include \"Factory.h\"\n#include \"Parser.h\"\n#include \"Conversion.h\"\n#include \"FEProblem.h\"\n\ntemplate<>\nInputParameters validParams<PrecursorKernelAction>()\n{\n  InputParameters params = validParams<AddVariableAction>();\n  params.addRequiredParam<int>(\"num_precursor_groups\", \"specifies the total number of precursors to create\");\n  params.addRequiredParam<std::string>(\"var_name_base\", \"specifies the base name of the variables\");\n  params.addParam<VariableName>(\"T\", \"Name of temperature variable\");\n  params.addParam<VariableName>(\"u\", \"Name of x-component of velocity\");\n  params.addParam<VariableName>(\"v\", \"Name of y-component of velocity\");\n  params.addParam<VariableName>(\"w\", \"Name of z-component of velocity\");\n  params.addParam<Real>(\"u_def\", \"Allows user to specify constant value for u component of velocity.\");\n  params.addParam<Real>(\"v_def\", \"Allows user to specify constant value for v component of velocity.\");\n  params.addParam<Real>(\"w_def\", \"Allows user to specify constant value for w component of velocity.\");\n  params.addRequiredParam<std::vector<VariableName> >(\"group_fluxes\", \"All the variables that hold the group fluxes. These MUST be listed by decreasing energy\/increasing group number.\");\n  params.addRequiredParam<int>(\"num_groups\", \"The total number of energy groups.\");\n  params.addParam<bool>(\"transient_simulation\", false, \"Whether to conduct a transient simulation.\");\n  params.addParam<std::vector<SubdomainName> >(\"block\", \"The list of block ids (SubdomainID) that this object will be applied to\");\n  params.addRequiredParam<std::vector<BoundaryName> >(\"inlet_boundary\", \"The inlet boundary for the precursors.\");\n  params.addRequiredParam<std::string>(\"inlet_boundary_condition\", \"The type of boundary condition to apply at the inlet.\");\n  params.addParam<Real>(\"inlet_dirichlet_value\", \"If inlet_boundary_condition is DirichletBC, specify the value.\");\n  params.addRequiredParam<std::vector<BoundaryName> >(\"outlet_boundary\", \"The outlet boundary for the precursors.\");\n  params.addParam<bool>(\"add_artificial_diffusion\", true, \"Whether to add artificial diffusion\");\n  params.addParam<bool>(\"incompressible_flow\", true, \"Determines whether we use a divergence-free form of the advecting velocity.\");\n  params.addParam<bool>(\"use_exp_form\", \"Whether concentrations should be in an expotential\/logarithmic format.\");\n  return params;\n}\n\nPrecursorKernelAction::PrecursorKernelAction(const InputParameters & params) :\n    AddVariableAction(params),\n    _num_precursor_groups(getParam<int>(\"num_precursor_groups\")),\n    _var_name_base(getParam<std::string>(\"var_name_base\")),\n    _num_groups(getParam<int>(\"num_groups\"))\n{\n}\n\nvoid\nPrecursorKernelAction::act()\n{\n  for (int op = 1; op <= _num_precursor_groups; ++op)\n  {\n    \/\/\n    \/\/ Create variable names\n    \/\/\n\n    std::string var_name = _var_name_base + Moose::stringify(op);\n\n    if (_current_task == \"add_variable\")\n      addVariable(var_name);\n\n    if (_current_task == \"add_kernel\")\n    {\n      \/\/\n      \/\/ Set up advection kernels\n      \/\/\n      if (getParam<bool>(\"incompressible_flow\"))\n      {\n        InputParameters params = _factory.getValidParams(\"DivFreeCoupledScalarAdvection\");\n        params.set<NonlinearVariableName>(\"variable\") = var_name;\n        if (isParamValid(\"u\"))\n          params.set<std::vector<VariableName> >(\"u\") = {getParam<VariableName>(\"u\")};\n        else if (isParamValid(\"u_def\"))\n          params.set<Real>(\"u_def\") = getParam<Real>(\"u_def\");\n        if (isParamValid(\"v\"))\n          params.set<std::vector<VariableName> >(\"v\") = {getParam<VariableName>(\"v\")};\n        else if (isParamValid(\"v_def\"))\n          params.set<Real>(\"v_def\") = getParam<Real>(\"v_def\");\n        if (isParamValid(\"w\"))\n          params.set<std::vector<VariableName> >(\"w\") = {getParam<VariableName>(\"w\")};\n        else if (isParamValid(\"w_def\"))\n          params.set<Real>(\"w_def\") = getParam<Real>(\"w_def\");\n        if (isParamValid(\"block\"))\n          params.set<std::vector<SubdomainName> >(\"block\") = getParam<std::vector<SubdomainName> >(\"block\");\n\n        std::string kernel_name = \"DivFreeCoupledScalarAdvection_\" + var_name;\n        _problem->addKernel(\"DivFreeCoupledScalarAdvection\", kernel_name, params);\n      }\n      else\n      {\n        InputParameters params = _factory.getValidParams(\"CoupledScalarAdvection\");\n        params.set<NonlinearVariableName>(\"variable\") = var_name;\n        if (isParamValid(\"u\"))\n          params.set<std::vector<VariableName> >(\"u\") = {getParam<VariableName>(\"u\")};\n        else if (isParamValid(\"u_def\"))\n          params.set<Real>(\"u_def\") = getParam<Real>(\"u_def\");\n        if (isParamValid(\"v\"))\n          params.set<std::vector<VariableName> >(\"v\") = {getParam<VariableName>(\"v\")};\n        else if (isParamValid(\"v_def\"))\n          params.set<Real>(\"v_def\") = getParam<Real>(\"v_def\");\n        if (isParamValid(\"w\"))\n          params.set<std::vector<VariableName> >(\"w\") = {getParam<VariableName>(\"w\")};\n        else if (isParamValid(\"w_def\"))\n          params.set<Real>(\"w_def\") = getParam<Real>(\"w_def\");\n        if (isParamValid(\"block\"))\n          params.set<std::vector<SubdomainName> >(\"block\") = getParam<std::vector<SubdomainName> >(\"block\");\n        if (isParamValid(\"use_exp_form\"))\n          params.set<bool>(\"use_exp_form\") = getParam<bool>(\"use_exp_form\");\n\n        std::string kernel_name = \"CoupledScalarAdvection_\" + var_name;\n        _problem->addKernel(\"CoupledScalarAdvection\", kernel_name, params);\n      }\n\n\n      \/\/ Set up PrecursorSource kernels\n\n      {\n        InputParameters params = _factory.getValidParams(\"PrecursorSource\");\n        params.set<NonlinearVariableName>(\"variable\") = var_name;\n        params.set<int>(\"num_groups\") = _num_groups;\n        params.set<std::vector<VariableName> >(\"group_fluxes\") = getParam<std::vector<VariableName> >(\"group_fluxes\");\n        params.set<int>(\"precursor_group_number\") = op;\n        if (isParamValid(\"T\"))\n          params.set<std::vector<VariableName> >(\"temperature\") = {getParam<VariableName>(\"T\")};\n        if (isParamValid(\"block\"))\n          params.set<std::vector<SubdomainName> >(\"block\") = getParam<std::vector<SubdomainName> >(\"block\");\n\n        std::string kernel_name = \"PrecursorSource_\" + var_name;\n        _problem->addKernel(\"PrecursorSource\", kernel_name, params);\n      }\n\n      \/\/\n      \/\/ Set up PrecursorDecay kernels\n      \/\/\n\n      {\n        InputParameters params = _factory.getValidParams(\"PrecursorDecay\");\n        params.set<NonlinearVariableName>(\"variable\") = var_name;\n        params.set<int>(\"precursor_group_number\") = op;\n        if (isParamValid(\"T\"))\n          params.set<std::vector<VariableName> >(\"temperature\") = {getParam<VariableName>(\"T\")};\n        if (isParamValid(\"block\"))\n          params.set<std::vector<SubdomainName> >(\"block\") = getParam<std::vector<SubdomainName> >(\"block\");\n\n        std::string kernel_name = \"PrecursorDecay_\" + var_name;\n        _problem->addKernel(\"PrecursorDecay\", kernel_name, params);\n      }\n\n      \/\/\n      \/\/ If doing a transient simulation, set up TimeDerivative kernels\n      \/\/\n\n      if (getParam<bool>(\"transient_simulation\"))\n      {\n        InputParameters params = _factory.getValidParams(\"ScalarTransportTimeDerivative\");\n        params.set<NonlinearVariableName>(\"variable\") = var_name;\n        params.set<bool>(\"implicit\") = true;\n        if (isParamValid(\"block\"))\n          params.set<std::vector<SubdomainName> >(\"block\") = getParam<std::vector<SubdomainName> >(\"block\");\n\n        std::string kernel_name = \"ScalarTransportTimeDerivative_\" + var_name;\n        _problem->addKernel(\"ScalarTransportTimeDerivative\", kernel_name, params);\n      }\n\n      \/\/ Set up artificial diffusion\n\n      if (getParam<bool>(\"add_artificial_diffusion\"))\n      {\n        InputParameters params = _factory.getValidParams(\"ScalarAdvectionArtDiff\");\n        params.set<NonlinearVariableName>(\"variable\") = var_name;\n        if (isParamValid(\"u\"))\n          params.set<std::vector<VariableName> >(\"u\") = {getParam<VariableName>(\"u\")};\n        else if (isParamValid(\"u_def\"))\n          params.set<Real>(\"u_def\") = getParam<Real>(\"u_def\");\n        if (isParamValid(\"v\"))\n          params.set<std::vector<VariableName> >(\"v\") = {getParam<VariableName>(\"v\")};\n        else if (isParamValid(\"v_def\"))\n          params.set<Real>(\"v_def\") = getParam<Real>(\"v_def\");\n        if (isParamValid(\"w\"))\n          params.set<std::vector<VariableName> >(\"w\") = {getParam<VariableName>(\"w\")};\n        else if (isParamValid(\"w_def\"))\n          params.set<Real>(\"w_def\") = getParam<Real>(\"w_def\");\n        if (isParamValid(\"block\"))\n          params.set<std::vector<SubdomainName> >(\"block\") = getParam<std::vector<SubdomainName> >(\"block\");\n\n        std::string kernel_name = \"ScalarAdvectionArtDiff_\" + var_name;\n        _problem->addKernel(\"ScalarAdvectionArtDiff\", kernel_name, params);\n      }\n    }\n\n    if (_current_task == \"add_bc\")\n    {\n\n      \/\/ Set up precursor inlet boundary conditions\n\n\n      {\n        std::string bc_type_name = getParam<std::string>(\"inlet_boundary_condition\");\n        InputParameters params = _factory.getValidParams(bc_type_name);\n        params.set<std::vector<BoundaryName> >(\"boundary\") = getParam<std::vector<BoundaryName> >(\"inlet_boundary\");\n        params.set<NonlinearVariableName>(\"variable\") = var_name;\n        if (bc_type_name == \"DirichletBC\")\n          params.set<Real>(\"value\") = getParam<Real>(\"inlet_dirichlet_value\");\n        std::string bc_name = bc_type_name + \"_\" + var_name;\n        _problem->addBoundaryCondition(bc_type_name, bc_name, params);\n      }\n\n      \/\/\n      \/\/ Set up precursor outlet boundary conditions\n      \/\/\n\n      if (!(getParam<bool>(\"incompressible_flow\")))\n      {\n        InputParameters params = _factory.getValidParams(\"CoupledScalarAdvectionNoBCBC\");\n        params.set<std::vector<BoundaryName> >(\"boundary\") = getParam<std::vector<BoundaryName> >(\"outlet_boundary\");\n        params.set<NonlinearVariableName>(\"variable\") = var_name;\n        if (isParamValid(\"u\"))\n          params.set<std::vector<VariableName> >(\"u\") = {getParam<VariableName>(\"u\")};\n        else if (isParamValid(\"u_def\"))\n          params.set<Real>(\"u_def\") = getParam<Real>(\"u_def\");\n        if (isParamValid(\"v\"))\n          params.set<std::vector<VariableName> >(\"v\") = {getParam<VariableName>(\"v\")};\n        else if (isParamValid(\"v_def\"))\n          params.set<Real>(\"v_def\") = getParam<Real>(\"v_def\");\n        if (isParamValid(\"w\"))\n          params.set<std::vector<VariableName> >(\"w\") = {getParam<VariableName>(\"w\")};\n        else if (isParamValid(\"w_def\"))\n          params.set<Real>(\"w_def\") = getParam<Real>(\"w_def\");\n\n        std::string bc_name = \"CoupledScalarAdvectionNoBCBC_\" + var_name;\n        _problem->addBoundaryCondition(\"CoupledScalarAdvectionNoBCBC\", bc_name, params);\n      }\n\n      \/\/ Set up artificial diffusion\n\n      if (getParam<bool>(\"add_artificial_diffusion\"))\n      {\n        InputParameters params = _factory.getValidParams(\"ScalarAdvectionArtDiffNoBCBC\");\n        params.set<std::vector<BoundaryName> >(\"boundary\") = getParam<std::vector<BoundaryName> >(\"outlet_boundary\");\n        params.set<NonlinearVariableName>(\"variable\") = var_name;\n        if (isParamValid(\"u\"))\n          params.set<std::vector<VariableName> >(\"u\") = {getParam<VariableName>(\"u\")};\n        else if (isParamValid(\"u_def\"))\n          params.set<Real>(\"u_def\") = getParam<Real>(\"u_def\");\n        if (isParamValid(\"v\"))\n          params.set<std::vector<VariableName> >(\"v\") = {getParam<VariableName>(\"v\")};\n        else if (isParamValid(\"v_def\"))\n          params.set<Real>(\"v_def\") = getParam<Real>(\"v_def\");\n        if (isParamValid(\"w\"))\n          params.set<std::vector<VariableName> >(\"w\") = {getParam<VariableName>(\"w\")};\n        else if (isParamValid(\"w_def\"))\n          params.set<Real>(\"w_def\") = getParam<Real>(\"w_def\");\n\n        std::string bc_name = \"ScalarAdvectionArtDiffNoBCBC_\" + var_name;\n        _problem->addBoundaryCondition(\"ScalarAdvectionArtDiffNoBCBC\", bc_name, params);\n      }\n    }\n\n    if (_current_task = \"add_ic\")\n    {\n      if (isParamValid(\"inlet_dirichlet_value\"))\n      \/\/ set up constant ics\n      {\n        InputParameters params = _factory.getValidParams(\"ConstantIC\");\n        params.set<VariableName>(\"variable\") = var_name;\n        params.set<Real>(\"value\") = getParam<Real>(\"inlet_dirichlet_value\");\n        _problem->addInitialCondition(\"ConstantIC\", var_name, params);\n      }\n    }\n  }\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\/\/$Id$\n\n\/\/ mapnik\n#include <mapnik\/agg_renderer.hpp>\n#include <mapnik\/agg_rasterizer.hpp>\n#include <mapnik\/line_symbolizer.hpp>\n\n\/\/ agg\n#include \"agg_basics.h\"\n#include \"agg_rendering_buffer.h\"\n#include \"agg_pixfmt_rgba.h\"\n#include \"agg_rasterizer_scanline_aa.h\"\n#include \"agg_scanline_u.h\"\n#include \"agg_renderer_scanline.h\"\n#include \"agg_scanline_p.h\"\n#include \"agg_conv_stroke.h\"\n#include \"agg_conv_dash.h\"\n#include \"agg_renderer_outline_aa.h\"\n#include \"agg_rasterizer_outline_aa.h\"\n#include \"agg_conv_clip_polyline.h\"\n\n\/\/ stl\n#include <string>\n\nnamespace mapnik {\n\ntemplate <typename T>\nvoid agg_renderer<T>::process(line_symbolizer const& sym,\n                              mapnik::feature_ptr const& feature,\n                              proj_transform const& prj_trans)\n{\n    typedef agg::renderer_base<agg::pixfmt_rgba32_plain> ren_base;\n    typedef agg::conv_clip_polyline<geometry_type> clipped_geometry_type;\n    typedef coord_transform2<CoordTransform,clipped_geometry_type> path_type;\n\n    stroke const& stroke_ = sym.get_stroke();\n    color const& col = stroke_.get_color();\n    unsigned r=col.red();\n    unsigned g=col.green();\n    unsigned b=col.blue();\n    unsigned a=col.alpha();\n\n    agg::rendering_buffer buf(pixmap_.raw_data(),width_,height_, width_ * 4);\n    agg::pixfmt_rgba32_plain pixf(buf);\n\n    if (sym.get_rasterizer() == RASTERIZER_FAST)\n    {\n        typedef agg::renderer_outline_aa<ren_base> renderer_type;\n        typedef agg::rasterizer_outline_aa<renderer_type> rasterizer_type;\n\n        agg::line_profile_aa profile;\n        \/\/agg::line_profile_aa profile(stroke_.get_width() * scale_factor_, agg::gamma_none());\n        profile.width(stroke_.get_width() * scale_factor_);\n        ren_base base_ren(pixf);\n        renderer_type ren(base_ren, profile);\n        ren.color(agg::rgba8(r, g, b, int(a*stroke_.get_opacity())));\n        \/\/ren.clip_box(0,0,width_,height_);\n        rasterizer_type ras(ren);\n        ras.line_join(agg::outline_miter_accurate_join);\n        ras.round_cap(true);\n\n        for (unsigned i=0;i<feature->num_geometries();++i)\n        {\n            geometry_type & geom = feature->get_geometry(i);\n            if (geom.num_points() > 1)\n            {\n                clipped_geometry_type clipped(geom);\n                clipped.clip_box(query_extent_.minx(),query_extent_.miny(),query_extent_.maxx(),query_extent_.maxy());\n                path_type path(t_,clipped,prj_trans);\n                ras.add_path(path);\n            }\n        }\n    }\n    else\n    {\n        typedef agg::renderer_scanline_aa_solid<ren_base> renderer;\n\n        agg::scanline_p8 sl;\n\n        ren_base renb(pixf);\n        renderer ren(renb);\n        ras_ptr->reset();\n        switch (stroke_.get_gamma_method())\n        {\n        case GAMMA_POWER:\n            ras_ptr->gamma(agg::gamma_power(stroke_.get_gamma()));\n            break;\n        case GAMMA_LINEAR:\n            ras_ptr->gamma(agg::gamma_linear(0.0, stroke_.get_gamma()));\n            break;\n        case GAMMA_NONE:\n            ras_ptr->gamma(agg::gamma_none());\n            break;\n        case GAMMA_THRESHOLD:\n            ras_ptr->gamma(agg::gamma_threshold(stroke_.get_gamma()));\n            break;\n        case GAMMA_MULTIPLY:\n            ras_ptr->gamma(agg::gamma_multiply(stroke_.get_gamma()));\n            break;\n        default:\n            ras_ptr->gamma(agg::gamma_power(stroke_.get_gamma()));\n        }\n\n        metawriter_with_properties writer = sym.get_metawriter();\n        for (unsigned i=0;i<feature->num_geometries();++i)\n        {\n            geometry_type & geom = feature->get_geometry(i);\n            if (geom.num_points() > 1)\n            {\n                clipped_geometry_type clipped(geom);\n                clipped.clip_box(query_extent_.minx(),query_extent_.miny(),query_extent_.maxx(),query_extent_.maxy());\n                path_type path(t_,clipped,prj_trans);\n\n                if (stroke_.has_dash())\n                {\n                    agg::conv_dash<path_type> dash(path);\n                    dash_array const& d = stroke_.get_dash_array();\n                    dash_array::const_iterator itr = d.begin();\n                    dash_array::const_iterator end = d.end();\n                    for (;itr != end;++itr)\n                    {\n                        dash.add_dash(itr->first * scale_factor_,\n                                      itr->second * scale_factor_);\n                    }\n\n                    agg::conv_stroke<agg::conv_dash<path_type > > stroke(dash);\n\n                    line_join_e join=stroke_.get_line_join();\n                    if ( join == MITER_JOIN)\n                        stroke.generator().line_join(agg::miter_join);\n                    else if( join == MITER_REVERT_JOIN)\n                        stroke.generator().line_join(agg::miter_join);\n                    else if( join == ROUND_JOIN)\n                        stroke.generator().line_join(agg::round_join);\n                    else\n                        stroke.generator().line_join(agg::bevel_join);\n\n                    line_cap_e cap=stroke_.get_line_cap();\n                    if (cap == BUTT_CAP)\n                        stroke.generator().line_cap(agg::butt_cap);\n                    else if (cap == SQUARE_CAP)\n                        stroke.generator().line_cap(agg::square_cap);\n                    else\n                        stroke.generator().line_cap(agg::round_cap);\n\n                    stroke.generator().miter_limit(4.0);\n                    stroke.generator().width(stroke_.get_width() * scale_factor_);\n                    ras_ptr->add_path(stroke);\n\n                }\n                else\n                {\n                    agg::conv_stroke<path_type>  stroke(path);\n                    line_join_e join=stroke_.get_line_join();\n                    if ( join == MITER_JOIN)\n                        stroke.generator().line_join(agg::miter_join);\n                    else if( join == MITER_REVERT_JOIN)\n                        stroke.generator().line_join(agg::miter_join);\n                    else if( join == ROUND_JOIN)\n                        stroke.generator().line_join(agg::round_join);\n                    else\n                        stroke.generator().line_join(agg::bevel_join);\n\n                    line_cap_e cap=stroke_.get_line_cap();\n                    if (cap == BUTT_CAP)\n                        stroke.generator().line_cap(agg::butt_cap);\n                    else if (cap == SQUARE_CAP)\n                        stroke.generator().line_cap(agg::square_cap);\n                    else\n                        stroke.generator().line_cap(agg::round_cap);\n\n                    stroke.generator().miter_limit(4.0);\n                    stroke.generator().width(stroke_.get_width() * scale_factor_);\n                    ras_ptr->add_path(stroke);\n                    \/\/if (writer.first) writer.first->add_line(path, *feature, t_, writer.second);\n                }\n            }\n        }\n        ren.color(agg::rgba8(r, g, b, int(a*stroke_.get_opacity())));\n        agg::render_scanlines(*ras_ptr, sl, ren);\n    }\n}\n\n\ntemplate void agg_renderer<image_32>::process(line_symbolizer const&,\n                                              mapnik::feature_ptr const&,\n                                              proj_transform const&);\n\n}\n\n<commit_msg>+ inflate query extent to avoid line joining artifacts<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\/\/$Id$\n\n\/\/ mapnik\n#include <mapnik\/agg_renderer.hpp>\n#include <mapnik\/agg_rasterizer.hpp>\n#include <mapnik\/line_symbolizer.hpp>\n\n\/\/ agg\n#include \"agg_basics.h\"\n#include \"agg_rendering_buffer.h\"\n#include \"agg_pixfmt_rgba.h\"\n#include \"agg_rasterizer_scanline_aa.h\"\n#include \"agg_scanline_u.h\"\n#include \"agg_renderer_scanline.h\"\n#include \"agg_scanline_p.h\"\n#include \"agg_conv_stroke.h\"\n#include \"agg_conv_dash.h\"\n#include \"agg_renderer_outline_aa.h\"\n#include \"agg_rasterizer_outline_aa.h\"\n#include \"agg_conv_clip_polyline.h\"\n\n\/\/ stl\n#include <string>\n\nnamespace mapnik {\n\ntemplate <typename T>\nvoid agg_renderer<T>::process(line_symbolizer const& sym,\n                              mapnik::feature_ptr const& feature,\n                              proj_transform const& prj_trans)\n{\n    typedef agg::renderer_base<agg::pixfmt_rgba32_plain> ren_base;\n    typedef agg::conv_clip_polyline<geometry_type> clipped_geometry_type;\n    typedef coord_transform2<CoordTransform,clipped_geometry_type> path_type;\n\n    stroke const& stroke_ = sym.get_stroke();\n    color const& col = stroke_.get_color();\n    unsigned r=col.red();\n    unsigned g=col.green();\n    unsigned b=col.blue();\n    unsigned a=col.alpha();\n\n    agg::rendering_buffer buf(pixmap_.raw_data(),width_,height_, width_ * 4);\n    agg::pixfmt_rgba32_plain pixf(buf);\n    \n    box2d<double> ext = query_extent_ * 1.1;\n    if (sym.get_rasterizer() == RASTERIZER_FAST)\n    {\n        typedef agg::renderer_outline_aa<ren_base> renderer_type;\n        typedef agg::rasterizer_outline_aa<renderer_type> rasterizer_type;\n\n        agg::line_profile_aa profile;\n        \/\/agg::line_profile_aa profile(stroke_.get_width() * scale_factor_, agg::gamma_none());\n        profile.width(stroke_.get_width() * scale_factor_);\n        ren_base base_ren(pixf);\n        renderer_type ren(base_ren, profile);\n        ren.color(agg::rgba8(r, g, b, int(a*stroke_.get_opacity())));\n        \/\/ren.clip_box(0,0,width_,height_);\n        rasterizer_type ras(ren);\n        ras.line_join(agg::outline_miter_accurate_join);\n        ras.round_cap(true);\n\n        for (unsigned i=0;i<feature->num_geometries();++i)\n        {\n            geometry_type & geom = feature->get_geometry(i);\n            if (geom.num_points() > 1)\n            {\n                clipped_geometry_type clipped(geom);\n                clipped.clip_box(ext.minx(),ext.miny(),ext.maxx(),ext.maxy());\n                path_type path(t_,clipped,prj_trans);\n                ras.add_path(path);\n            }\n        }\n    }\n    else\n    {\n        typedef agg::renderer_scanline_aa_solid<ren_base> renderer;\n\n        agg::scanline_p8 sl;\n\n        ren_base renb(pixf);\n        renderer ren(renb);\n        ras_ptr->reset();\n        switch (stroke_.get_gamma_method())\n        {\n        case GAMMA_POWER:\n            ras_ptr->gamma(agg::gamma_power(stroke_.get_gamma()));\n            break;\n        case GAMMA_LINEAR:\n            ras_ptr->gamma(agg::gamma_linear(0.0, stroke_.get_gamma()));\n            break;\n        case GAMMA_NONE:\n            ras_ptr->gamma(agg::gamma_none());\n            break;\n        case GAMMA_THRESHOLD:\n            ras_ptr->gamma(agg::gamma_threshold(stroke_.get_gamma()));\n            break;\n        case GAMMA_MULTIPLY:\n            ras_ptr->gamma(agg::gamma_multiply(stroke_.get_gamma()));\n            break;\n        default:\n            ras_ptr->gamma(agg::gamma_power(stroke_.get_gamma()));\n        }\n\n        metawriter_with_properties writer = sym.get_metawriter();\n        for (unsigned i=0;i<feature->num_geometries();++i)\n        {\n            geometry_type & geom = feature->get_geometry(i);\n            if (geom.num_points() > 1)\n            {\n                clipped_geometry_type clipped(geom);\n                clipped.clip_box(ext.minx(),ext.miny(),ext.maxx(),ext.maxy());\n                path_type path(t_,clipped,prj_trans);\n\n                if (stroke_.has_dash())\n                {\n                    agg::conv_dash<path_type> dash(path);\n                    dash_array const& d = stroke_.get_dash_array();\n                    dash_array::const_iterator itr = d.begin();\n                    dash_array::const_iterator end = d.end();\n                    for (;itr != end;++itr)\n                    {\n                        dash.add_dash(itr->first * scale_factor_,\n                                      itr->second * scale_factor_);\n                    }\n\n                    agg::conv_stroke<agg::conv_dash<path_type > > stroke(dash);\n\n                    line_join_e join=stroke_.get_line_join();\n                    if ( join == MITER_JOIN)\n                        stroke.generator().line_join(agg::miter_join);\n                    else if( join == MITER_REVERT_JOIN)\n                        stroke.generator().line_join(agg::miter_join);\n                    else if( join == ROUND_JOIN)\n                        stroke.generator().line_join(agg::round_join);\n                    else\n                        stroke.generator().line_join(agg::bevel_join);\n\n                    line_cap_e cap=stroke_.get_line_cap();\n                    if (cap == BUTT_CAP)\n                        stroke.generator().line_cap(agg::butt_cap);\n                    else if (cap == SQUARE_CAP)\n                        stroke.generator().line_cap(agg::square_cap);\n                    else\n                        stroke.generator().line_cap(agg::round_cap);\n\n                    stroke.generator().miter_limit(4.0);\n                    stroke.generator().width(stroke_.get_width() * scale_factor_);\n                    ras_ptr->add_path(stroke);\n\n                }\n                else\n                {\n                    agg::conv_stroke<path_type>  stroke(path);\n                    line_join_e join=stroke_.get_line_join();\n                    if ( join == MITER_JOIN)\n                        stroke.generator().line_join(agg::miter_join);\n                    else if( join == MITER_REVERT_JOIN)\n                        stroke.generator().line_join(agg::miter_join);\n                    else if( join == ROUND_JOIN)\n                        stroke.generator().line_join(agg::round_join);\n                    else\n                        stroke.generator().line_join(agg::bevel_join);\n\n                    line_cap_e cap=stroke_.get_line_cap();\n                    if (cap == BUTT_CAP)\n                        stroke.generator().line_cap(agg::butt_cap);\n                    else if (cap == SQUARE_CAP)\n                        stroke.generator().line_cap(agg::square_cap);\n                    else\n                        stroke.generator().line_cap(agg::round_cap);\n\n                    stroke.generator().miter_limit(4.0);\n                    stroke.generator().width(stroke_.get_width() * scale_factor_);\n                    ras_ptr->add_path(stroke);\n                    \/\/if (writer.first) writer.first->add_line(path, *feature, t_, writer.second);\n                }\n            }\n        }\n        ren.color(agg::rgba8(r, g, b, int(a*stroke_.get_opacity())));\n        agg::render_scanlines(*ras_ptr, sl, ren);\n    }\n}\n\n\ntemplate void agg_renderer<image_32>::process(line_symbolizer const&,\n                                              mapnik::feature_ptr const&,\n                                              proj_transform const&);\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Change parameter name<commit_after><|endoftext|>"}
{"text":"<commit_before>#define png_infopp_NULL (png_infopp)NULL\n#define int_p_NULL (int*)NULL\n#include <boost\/gil\/extension\/io\/png_io.hpp>\n\n#include \"cctag\/utils\/FileDebug.hpp\"\n#include \"cctag\/utils\/VisualDebug.hpp\"\n#include \"cctag\/utils\/Exceptions.hpp\"\n#include \"cctag\/Detection.hpp\"\n#include \"CmdLine.hpp\"\n\n#ifdef WITH_CUDA\n#include \"cuda\/device_prop.hpp\"\n#include \"cuda\/debug_macros.hpp\"\n#endif \/\/ WITH_CUDA\n\n#include <boost\/filesystem\/convenience.hpp>\n#include <boost\/filesystem.hpp>\n#include <boost\/progress.hpp>\n#include <boost\/exception\/all.hpp>\n#include <boost\/ptr_container\/ptr_list.hpp>\n#include <boost\/archive\/xml_oarchive.hpp>\n#include <boost\/archive\/xml_iarchive.hpp>\n#include <boost\/thread\/thread.hpp>\n#include <boost\/thread\/mutex.hpp>\n\n#include <opencv\/cv.h>\n#include <opencv2\/videoio.hpp>\n#include <opencv2\/core\/core.hpp>\n#include \"opencv2\/opencv.hpp\"\n\n#include <sstream>\n#include <iostream>\n#include <string>\n#include <fstream>\n#include <exception>\n\n#define PRINT_TO_CERR\n\nusing namespace cctag;\nusing boost::timer;\n\nusing namespace boost::gil;\nnamespace bfs = boost::filesystem;\n\n\/\/ static const std::string kUsageString = \"Usage: detection image_file.png\\n\";\n\nvoid detection(std::size_t frameId, const cv::Mat & src, const cctag::Parameters & params, const cctag::CCTagMarkersBank & bank, std::ostream & output, std::string debugFileName = \"\")\n{\n    if (debugFileName == \"\") {\n      debugFileName = \"00000\";\n    }\n    \n    \/\/ Process markers detection\n    boost::timer t;\n    boost::ptr_list<CCTag> markers;\n    \n    CCTagVisualDebug::instance().initBackgroundImage(src);\n    CCTagVisualDebug::instance().setImageFileName(debugFileName);\n    CCTagFileDebug::instance().setPath(CCTagVisualDebug::instance().getPath());\n\n    static cctag::logtime::Mgmt* durations = 0;\n#if 0\n    if( not durations ) {\n        durations = new cctag::logtime::Mgmt( 25 );\n    } else {\n        durations->resetStartTime();\n    }\n#endif\n    cctagDetection( markers, frameId , src, params, bank, true, durations );\n\n    if( durations ) {\n        durations->print( std::cerr );\n    }\n\n    CCTagFileDebug::instance().outPutAllSessions();\n    CCTagFileDebug::instance().clearSessions();\n    CCTagVisualDebug::instance().outPutAllSessions();\n    CCTagVisualDebug::instance().clearSessions();\n\n    CCTAG_COUT( markers.size() << \" markers.\");\n    CCTAG_COUT(\"Total time: \" << t.elapsed());\n    CCTAG_COUT_NOENDL(\"Id : \");\n\n    int i = 0;\n    output << \"#frame \" << frameId << '\\n';\n    output << markers.size() << '\\n';\n    BOOST_FOREACH(const cctag::CCTag & marker, markers) {\n      output << marker.x() << \" \" << marker.y() << \" \" << marker.id() << \" \" << marker.getStatus() << '\\n';\n      if (i == 0) {\n          CCTAG_COUT_NOENDL(marker.id() + 1);\n      } else {\n          CCTAG_COUT_NOENDL(\", \" << marker.id() + 1);\n      }\n      ++i;\n    }\n    CCTAG_COUT(\"\");\n}\n\n\/*************************************************************\/\n\/*                    Main entry                             *\/\n\/*************************************************************\/\nint main(int argc, char** argv)\n{\n  CmdLine cmdline;\n\n  if( cmdline.parse( argc, argv ) == false ) {\n    cmdline.usage( argv[0] );\n    return EXIT_FAILURE;\n  }\n\n  cmdline.print( argv[0] );\n\n  \/\/ Check input path\n  if( cmdline._filename.compare(\"\") != 0){\n    if (!boost::filesystem::exists( cmdline._filename )) {\n      std::cerr << std::endl\n        << \"The input file \\\"\"<< cmdline._filename << \"\\\" is missing\" << std::endl;\n      return EXIT_FAILURE;\n    }\n  }else{\n    std::cerr << std::endl\n        << \"An input file is required\" << std::endl;\n    cmdline.usage( argv[0] );\n    return EXIT_FAILURE;\n  }\n\n#ifdef WITH_CUDA\n  popart::pop_cuda_only_sync_calls( cmdline._switchSync );\n#endif\n\n  \/\/ Check the (optional) parameters path\n  std::size_t nCrowns = std::atoi(cmdline._nCrowns.c_str());\n  cctag::Parameters params(nCrowns);\n  \n  if( cmdline._paramsFilename != \"\" ) {\n    if (!boost::filesystem::exists( cmdline._paramsFilename )) {\n      std::cerr << std::endl\n        << \"The input file \\\"\"<< cmdline._paramsFilename << \"\\\" is missing\" << std::endl;\n      return EXIT_FAILURE;\n    }\n\n    \/\/ Read the parameter file provided by the user\n    std::ifstream ifs( cmdline._paramsFilename.c_str() );\n    boost::archive::xml_iarchive ia(ifs);\n    ia >> boost::serialization::make_nvp(\"CCTagsParams\", params);\n    CCTAG_COUT(params._nCrowns);\n    CCTAG_COUT(nCrowns);\n    assert( nCrowns == params._nCrowns );\n  } else {\n    \/\/ Use the default parameters and save them in defaultParameters.xml\n    cmdline._paramsFilename = \"defaultParameters.xml\";\n    std::ofstream ofs( cmdline._paramsFilename.c_str() );\n    boost::archive::xml_oarchive oa(ofs);\n    oa << boost::serialization::make_nvp(\"CCTagsParams\", params);\n    CCTAG_COUT(\"Parameter file not provided. Default parameters are used.\");\n  }\n  \n  CCTagMarkersBank bank(params._nCrowns);\n  if ( !cmdline._cctagBankFilename.empty())\n  {\n    bank = CCTagMarkersBank(cmdline._cctagBankFilename);\n  }\n\n#ifdef WITH_CUDA\n  if( cmdline._useCuda ) {\n    params.setUseCuda( true );\n  } else {\n    params.setUseCuda( false );\n  }\n\n  if( cmdline._debugDir != \"\" ) {\n    params.setDebugDir( cmdline._debugDir );\n  }\n\n  popart::device_prop_t deviceInfo( false );\n#if 0\n  deviceInfo.print( );\n#endif\n#endif \/\/ WITH_CUDA\n\n  bfs::path myPath( cmdline._filename );\n  std::string ext(myPath.extension().string());\n\n  const bfs::path subFilenamePath(myPath.filename());\n  const bfs::path parentPath( myPath.parent_path() == \"\" ? \".\" : myPath.parent_path());\n  std::string outputFileName;\n  if (!bfs::is_directory(myPath))\n  {\n    CCTagVisualDebug::instance().initializeFolders( parentPath , cmdline._outputFolderName , params._nCrowns );\n    outputFileName = parentPath.string() + \"\/\" + cmdline._outputFolderName + \"\/cctag\" + std::to_string(nCrowns) + \"CC.out\";\n  }else\n  {\n    CCTagVisualDebug::instance().initializeFolders( myPath , cmdline._outputFolderName , params._nCrowns );\n    outputFileName = myPath.string() + \"\/\" + cmdline._outputFolderName + \"\/cctag\" + std::to_string(nCrowns) + \"CC.out\";\n  }\n  std::ofstream outputFile;\n  outputFile.open( outputFileName );\n  \n  if ( (ext == \".png\") || (ext == \".jpg\") || (ext == \".PNG\") || (ext == \".JPG\")) {\n    POP_INFO(\"looking at image \" << myPath.string());\n    \n    \/\/ Gray scale convertion\n    cv::Mat src = cv::imread(cmdline._filename);\n    cv::Mat graySrc;\n    cv::cvtColor( src, graySrc, CV_BGR2GRAY );\n\n    \/\/ Upscale original image\n    \/*{\n            rgb8_image_t simage;\n            simage.recreate( 2 * image.width(), 2 * image.height() );\n            rgb8_view_t osvw( view( simage ) );\n            terry::resize_view( svw, osvw, terry::sampler::bicubic_sampler() );\n    }*\/\n\n    \/\/ Call the CCTag detection\n#ifdef PRINT_TO_CERR\n    detection(0, graySrc, params, bank, std::cerr, myPath.stem().string());\n#else\n    detection(0, graySrc, params, bank, outputFile, myPath.stem().string());\n#endif\n} else if (ext == \".avi\" )\n  {\n    CCTAG_COUT(\"*** Video mode ***\");\n    POP_INFO( \"looking at video \" << myPath.string() );\n\n    \/\/ open video and check\n    cv::VideoCapture video( cmdline._filename.c_str() );\n    if(!video.isOpened())\n    {\n      CCTAG_COUT(\"Unable to open the video : \" << cmdline._filename); return -1;\n    }\n\n    \/\/ play loop\n    int lastFrame = video.get(CV_CAP_PROP_FRAME_COUNT);\n\n    std::list<cv::Mat*> frames;\n\n    std::cerr << \"Starting to read video frames\" << std::endl;\n    while( video.get(CV_CAP_PROP_POS_FRAMES) < lastFrame )\n    {\n      cv::Mat frame;\n      video >> frame;\n      cv::Mat* imgGray = new cv::Mat;\n      cv::cvtColor( frame, *imgGray, CV_BGR2GRAY );\n\n      frames.push_back( imgGray );\n    }\n    std::cerr << \"Done. Now processing.\" << std::endl;\n\n    boost::timer t;\n    std::size_t         frameId = 0;\n#if 0\n    boost::mutex        frame_mutex;\n    boost::thread_group frame_processor;\n    for( int proc=0; proc<1 ; proc++ ) {\n      frame_processor.create_thread(\n        [&frames, &frameId, &frame_mutex, &t, params, bank, &outputFile](){\n            bool   empty;\n            do {\n                cv::Mat* imgGray;\n                frame_mutex.lock();\n                empty = frames.empty();\n                if( not empty ) {\n                    imgGray = frames.front();\n                    frames.pop_front();\n                    ++frameId; \n                }\n                frame_mutex.unlock();\n\n                std::stringstream outFileName;\n                outFileName << std::setfill('0') << std::setw(5) << frameId;\n\n                detection(frameId, *imgGray, params, bank, outputFile, outFileName.str());\n                if( frameId % 100 == 0 ) {\n                    std::cerr << frameId << \" (\" << std::setprecision(3) << t.elapsed()*1000.0\/frameId << \") \";\n                }\n                delete imgGray;\n            } while( not empty );\n        } );\n    }\n    frame_processor.join_all();\n#else\n    for( cv::Mat* imgGray : frames ) {\n        \/\/ Set the output folder\n        std::stringstream outFileName;\n        outFileName << std::setfill('0') << std::setw(5) << frameId;\n\n        \/\/ Invert the image for the projection scenario\n        \/\/cv::Mat imgGrayInverted;\n        \/\/bitwise_not ( imgGray, imgGrayInverted );\n      \n        \/\/ Call the CCTag detection\n#ifdef PRINT_TO_CERR\n        detection(frameId, *imgGray, params, bank, std::cerr, outFileName.str());\n#else\n        detection(frameId, *imgGray, params, bank, outputFile, outFileName.str());\n#endif\n        ++frameId; \n        if( frameId % 100 == 0 ) {\n            std::cerr << frameId << \" (\" << std::setprecision(3) << t.elapsed()*1000.0\/frameId << \") \";\n        }\n    }\n#endif\n    std::cerr << std::endl;\n  } else if (bfs::is_directory(myPath)) {\n    CCTAG_COUT(\"*** Image sequence mode ***\");\n\n    std::vector<bfs::path> vFileInFolder;\n\n    std::copy(bfs::directory_iterator(myPath), bfs::directory_iterator(), std::back_inserter(vFileInFolder)); \/\/ is directory_entry, which is\n    std::sort(vFileInFolder.begin(), vFileInFolder.end());\n\n    std::size_t frameId = 0;\n\n    for(const auto & fileInFolder : vFileInFolder) {\n      const std::string subExt(bfs::extension(fileInFolder));\n      \n      if ( (subExt == \".png\") || (subExt == \".jpg\") || (subExt == \".PNG\") || (subExt == \".JPG\") ) {\n\n        CCTAG_COUT( \"Processing image \" << fileInFolder.string() );\n\n\t\tcv::Mat src;\n    \tsrc = cv::imread(fileInFolder.string());\n\n        cv::Mat imgGray;\n        cv::cvtColor( src, imgGray, CV_BGR2GRAY );\n      \n        \/\/ Call the CCTag detection\n#ifdef PRINT_TO_CERR\n        detection(frameId, imgGray, params, bank, std::cerr, fileInFolder.stem().string());\n#else\n        detection(frameId, imgGray, params, bank, outputFile, fileInFolder.stem().string());\n#endif\n++frameId;\n      }\n    }\n  }else\n  {\n      throw std::logic_error(\"Unrecognized input.\");\n  }\n  outputFile.close();\n  return 0;\n}\n\n<commit_msg>[application] Print elapsed time in any case.<commit_after>#define png_infopp_NULL (png_infopp)NULL\n#define int_p_NULL (int*)NULL\n#include <boost\/gil\/extension\/io\/png_io.hpp>\n\n#include \"cctag\/utils\/FileDebug.hpp\"\n#include \"cctag\/utils\/VisualDebug.hpp\"\n#include \"cctag\/utils\/Exceptions.hpp\"\n#include \"cctag\/Detection.hpp\"\n#include \"CmdLine.hpp\"\n\n#ifdef WITH_CUDA\n#include \"cuda\/device_prop.hpp\"\n#include \"cuda\/debug_macros.hpp\"\n#endif \/\/ WITH_CUDA\n\n#include <boost\/filesystem\/convenience.hpp>\n#include <boost\/filesystem.hpp>\n#include <boost\/progress.hpp>\n#include <boost\/exception\/all.hpp>\n#include <boost\/ptr_container\/ptr_list.hpp>\n#include <boost\/archive\/xml_oarchive.hpp>\n#include <boost\/archive\/xml_iarchive.hpp>\n#include <boost\/thread\/thread.hpp>\n#include <boost\/thread\/mutex.hpp>\n\n#include <opencv\/cv.h>\n#include <opencv2\/videoio.hpp>\n#include <opencv2\/core\/core.hpp>\n#include \"opencv2\/opencv.hpp\"\n\n#include <sstream>\n#include <iostream>\n#include <string>\n#include <fstream>\n#include <exception>\n\n#define PRINT_TO_CERR\n\nusing namespace cctag;\nusing boost::timer;\n\nusing namespace boost::gil;\nnamespace bfs = boost::filesystem;\n\n\/\/ static const std::string kUsageString = \"Usage: detection image_file.png\\n\";\n\nvoid detection(std::size_t frameId, const cv::Mat & src, const cctag::Parameters & params, const cctag::CCTagMarkersBank & bank, std::ostream & output, std::string debugFileName = \"\")\n{\n    if (debugFileName == \"\") {\n      debugFileName = \"00000\";\n    }\n    \n    \/\/ Process markers detection\n    boost::timer t;\n    boost::ptr_list<CCTag> markers;\n    \n    CCTagVisualDebug::instance().initBackgroundImage(src);\n    CCTagVisualDebug::instance().setImageFileName(debugFileName);\n    CCTagFileDebug::instance().setPath(CCTagVisualDebug::instance().getPath());\n\n    static cctag::logtime::Mgmt* durations = 0;\n#if 0\n    if( not durations ) {\n        durations = new cctag::logtime::Mgmt( 25 );\n    } else {\n        durations->resetStartTime();\n    }\n#endif\n    cctagDetection( markers, frameId , src, params, bank, true, durations );\n\n    if( durations ) {\n        durations->print( std::cerr );\n    }\n\n    CCTagFileDebug::instance().outPutAllSessions();\n    CCTagFileDebug::instance().clearSessions();\n    CCTagVisualDebug::instance().outPutAllSessions();\n    CCTagVisualDebug::instance().clearSessions();\n\n    CCTAG_COUT( markers.size() << \" markers.\");\n    std::cout << \"Total time: \" << t.elapsed() << std::endl;\n    CCTAG_COUT_NOENDL(\"Id : \");\n\n    int i = 0;\n    output << \"#frame \" << frameId << '\\n';\n    output << markers.size() << '\\n';\n    BOOST_FOREACH(const cctag::CCTag & marker, markers) {\n      output << marker.x() << \" \" << marker.y() << \" \" << marker.id() << \" \" << marker.getStatus() << '\\n';\n      if (i == 0) {\n          CCTAG_COUT_NOENDL(marker.id() + 1);\n      } else {\n          CCTAG_COUT_NOENDL(\", \" << marker.id() + 1);\n      }\n      ++i;\n    }\n    CCTAG_COUT(\"\");\n}\n\n\/*************************************************************\/\n\/*                    Main entry                             *\/\n\/*************************************************************\/\nint main(int argc, char** argv)\n{\n  CmdLine cmdline;\n\n  if( cmdline.parse( argc, argv ) == false ) {\n    cmdline.usage( argv[0] );\n    return EXIT_FAILURE;\n  }\n\n  cmdline.print( argv[0] );\n\n  \/\/ Check input path\n  if( cmdline._filename.compare(\"\") != 0){\n    if (!boost::filesystem::exists( cmdline._filename )) {\n      std::cerr << std::endl\n        << \"The input file \\\"\"<< cmdline._filename << \"\\\" is missing\" << std::endl;\n      return EXIT_FAILURE;\n    }\n  }else{\n    std::cerr << std::endl\n        << \"An input file is required\" << std::endl;\n    cmdline.usage( argv[0] );\n    return EXIT_FAILURE;\n  }\n\n#ifdef WITH_CUDA\n  popart::pop_cuda_only_sync_calls( cmdline._switchSync );\n#endif\n\n  \/\/ Check the (optional) parameters path\n  std::size_t nCrowns = std::atoi(cmdline._nCrowns.c_str());\n  cctag::Parameters params(nCrowns);\n  \n  if( cmdline._paramsFilename != \"\" ) {\n    if (!boost::filesystem::exists( cmdline._paramsFilename )) {\n      std::cerr << std::endl\n        << \"The input file \\\"\"<< cmdline._paramsFilename << \"\\\" is missing\" << std::endl;\n      return EXIT_FAILURE;\n    }\n\n    \/\/ Read the parameter file provided by the user\n    std::ifstream ifs( cmdline._paramsFilename.c_str() );\n    boost::archive::xml_iarchive ia(ifs);\n    ia >> boost::serialization::make_nvp(\"CCTagsParams\", params);\n    CCTAG_COUT(params._nCrowns);\n    CCTAG_COUT(nCrowns);\n    assert( nCrowns == params._nCrowns );\n  } else {\n    \/\/ Use the default parameters and save them in defaultParameters.xml\n    cmdline._paramsFilename = \"defaultParameters.xml\";\n    std::ofstream ofs( cmdline._paramsFilename.c_str() );\n    boost::archive::xml_oarchive oa(ofs);\n    oa << boost::serialization::make_nvp(\"CCTagsParams\", params);\n    CCTAG_COUT(\"Parameter file not provided. Default parameters are used.\");\n  }\n  \n  CCTagMarkersBank bank(params._nCrowns);\n  if ( !cmdline._cctagBankFilename.empty())\n  {\n    bank = CCTagMarkersBank(cmdline._cctagBankFilename);\n  }\n\n#ifdef WITH_CUDA\n  if( cmdline._useCuda ) {\n    params.setUseCuda( true );\n  } else {\n    params.setUseCuda( false );\n  }\n\n  if( cmdline._debugDir != \"\" ) {\n    params.setDebugDir( cmdline._debugDir );\n  }\n\n  popart::device_prop_t deviceInfo( false );\n#if 0\n  deviceInfo.print( );\n#endif\n#endif \/\/ WITH_CUDA\n\n  bfs::path myPath( cmdline._filename );\n  std::string ext(myPath.extension().string());\n\n  const bfs::path subFilenamePath(myPath.filename());\n  const bfs::path parentPath( myPath.parent_path() == \"\" ? \".\" : myPath.parent_path());\n  std::string outputFileName;\n  if (!bfs::is_directory(myPath))\n  {\n    CCTagVisualDebug::instance().initializeFolders( parentPath , cmdline._outputFolderName , params._nCrowns );\n    outputFileName = parentPath.string() + \"\/\" + cmdline._outputFolderName + \"\/cctag\" + std::to_string(nCrowns) + \"CC.out\";\n  }else\n  {\n    CCTagVisualDebug::instance().initializeFolders( myPath , cmdline._outputFolderName , params._nCrowns );\n    outputFileName = myPath.string() + \"\/\" + cmdline._outputFolderName + \"\/cctag\" + std::to_string(nCrowns) + \"CC.out\";\n  }\n  std::ofstream outputFile;\n  outputFile.open( outputFileName );\n  \n  if ( (ext == \".png\") || (ext == \".jpg\") || (ext == \".PNG\") || (ext == \".JPG\")) {\n    POP_INFO(\"looking at image \" << myPath.string());\n    \n    \/\/ Gray scale convertion\n    cv::Mat src = cv::imread(cmdline._filename);\n    cv::Mat graySrc;\n    cv::cvtColor( src, graySrc, CV_BGR2GRAY );\n\n    \/\/ Upscale original image\n    \/*{\n            rgb8_image_t simage;\n            simage.recreate( 2 * image.width(), 2 * image.height() );\n            rgb8_view_t osvw( view( simage ) );\n            terry::resize_view( svw, osvw, terry::sampler::bicubic_sampler() );\n    }*\/\n\n    \/\/ Call the CCTag detection\n#ifdef PRINT_TO_CERR\n    detection(0, graySrc, params, bank, std::cerr, myPath.stem().string());\n#else\n    detection(0, graySrc, params, bank, outputFile, myPath.stem().string());\n#endif\n} else if (ext == \".avi\" )\n  {\n    CCTAG_COUT(\"*** Video mode ***\");\n    POP_INFO( \"looking at video \" << myPath.string() );\n\n    \/\/ open video and check\n    cv::VideoCapture video( cmdline._filename.c_str() );\n    if(!video.isOpened())\n    {\n      CCTAG_COUT(\"Unable to open the video : \" << cmdline._filename); return -1;\n    }\n\n    \/\/ play loop\n    int lastFrame = video.get(CV_CAP_PROP_FRAME_COUNT);\n\n    std::list<cv::Mat*> frames;\n\n    std::cerr << \"Starting to read video frames\" << std::endl;\n    while( video.get(CV_CAP_PROP_POS_FRAMES) < lastFrame )\n    {\n      cv::Mat frame;\n      video >> frame;\n      cv::Mat* imgGray = new cv::Mat;\n      cv::cvtColor( frame, *imgGray, CV_BGR2GRAY );\n\n      frames.push_back( imgGray );\n    }\n    std::cerr << \"Done. Now processing.\" << std::endl;\n\n    boost::timer t;\n    std::size_t         frameId = 0;\n#if 0\n    boost::mutex        frame_mutex;\n    boost::thread_group frame_processor;\n    for( int proc=0; proc<1 ; proc++ ) {\n      frame_processor.create_thread(\n        [&frames, &frameId, &frame_mutex, &t, params, bank, &outputFile](){\n            bool   empty;\n            do {\n                cv::Mat* imgGray;\n                frame_mutex.lock();\n                empty = frames.empty();\n                if( not empty ) {\n                    imgGray = frames.front();\n                    frames.pop_front();\n                    ++frameId; \n                }\n                frame_mutex.unlock();\n\n                std::stringstream outFileName;\n                outFileName << std::setfill('0') << std::setw(5) << frameId;\n\n                detection(frameId, *imgGray, params, bank, outputFile, outFileName.str());\n                if( frameId % 100 == 0 ) {\n                    std::cerr << frameId << \" (\" << std::setprecision(3) << t.elapsed()*1000.0\/frameId << \") \";\n                }\n                delete imgGray;\n            } while( not empty );\n        } );\n    }\n    frame_processor.join_all();\n#else\n    for( cv::Mat* imgGray : frames ) {\n        \/\/ Set the output folder\n        std::stringstream outFileName;\n        outFileName << std::setfill('0') << std::setw(5) << frameId;\n\n        \/\/ Invert the image for the projection scenario\n        \/\/cv::Mat imgGrayInverted;\n        \/\/bitwise_not ( imgGray, imgGrayInverted );\n      \n        \/\/ Call the CCTag detection\n#ifdef PRINT_TO_CERR\n        detection(frameId, *imgGray, params, bank, std::cerr, outFileName.str());\n#else\n        detection(frameId, *imgGray, params, bank, outputFile, outFileName.str());\n#endif\n        ++frameId; \n        if( frameId % 100 == 0 ) {\n            std::cerr << frameId << \" (\" << std::setprecision(3) << t.elapsed()*1000.0\/frameId << \") \";\n        }\n    }\n#endif\n    std::cerr << std::endl;\n  } else if (bfs::is_directory(myPath)) {\n    CCTAG_COUT(\"*** Image sequence mode ***\");\n\n    std::vector<bfs::path> vFileInFolder;\n\n    std::copy(bfs::directory_iterator(myPath), bfs::directory_iterator(), std::back_inserter(vFileInFolder)); \/\/ is directory_entry, which is\n    std::sort(vFileInFolder.begin(), vFileInFolder.end());\n\n    std::size_t frameId = 0;\n\n    for(const auto & fileInFolder : vFileInFolder) {\n      const std::string subExt(bfs::extension(fileInFolder));\n      \n      if ( (subExt == \".png\") || (subExt == \".jpg\") || (subExt == \".PNG\") || (subExt == \".JPG\") ) {\n\n        CCTAG_COUT( \"Processing image \" << fileInFolder.string() );\n\n\t\tcv::Mat src;\n    \tsrc = cv::imread(fileInFolder.string());\n\n        cv::Mat imgGray;\n        cv::cvtColor( src, imgGray, CV_BGR2GRAY );\n      \n        \/\/ Call the CCTag detection\n#ifdef PRINT_TO_CERR\n        detection(frameId, imgGray, params, bank, std::cerr, fileInFolder.stem().string());\n#else\n        detection(frameId, imgGray, params, bank, outputFile, fileInFolder.stem().string());\n#endif\n++frameId;\n      }\n    }\n  }else\n  {\n      throw std::logic_error(\"Unrecognized input.\");\n  }\n  outputFile.close();\n  return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>LLC-433 — Remove external Tezos explorer fallback recover for HTTP errors.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2018 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 <sstream>\n#include <vector>\n#include \"nyx_container.h\"\n\nnamespace nyx {\n\nclass nyx_list : public PyObject {\n  using ObjectVector = std::vector<PyObject*>;\n  ObjectVector* vec_{};\npublic:\n  inline void _init(void) {\n    if (vec_ != nullptr)\n      _clear();\n    else\n      vec_ = new ObjectVector();\n  }\n\n  inline void _dealloc(void) {\n    if (vec_ != nullptr) {\n      _clear();\n      delete vec_;\n    }\n  }\n\n  inline int _contains(PyObject* o) const {\n    int cmp{};\n    for (auto* x : *vec_) {\n      cmp = PyObject_RichCompareBool(o, x, Py_EQ);\n      if (cmp != 0)\n        break;\n    }\n    return cmp;\n  }\n\n  inline void _clear(void) {\n    for (auto* x : *vec_)\n      Py_DECREF(x);\n    vec_->clear();\n  }\n\n  inline Py_ssize_t _size(void) const {\n    return vec_->size();\n  }\n\n  std::string _repr(void) const {\n    std::ostringstream oss;\n    oss << \"[\";\n    auto begin = vec_->begin();\n    while (begin != vec_->end()) {\n      if (PyString_Check(*begin))\n        oss << \"'\" << PyString_AsString(*begin) << \"'\";\n      else\n        oss << PyString_AsString(PyObject_Repr(*begin));\n\n      if (++begin != vec_->end())\n        oss << \", \";\n    }\n    oss << \"]\";\n\n    return oss.str();\n  }\n\n  inline void _append(PyObject* x) {\n    vec_->push_back(x);\n  }\n\n  inline void _insert(Py_ssize_t i, PyObject* x) {\n    vec_->insert(vec_->begin() + i, x);\n  }\n\n  inline PyObject* _at(Py_ssize_t i) const {\n    return vec_->at(i);\n  }\n};\n\nstatic bool __is_nyxlist(PyObject* o);\nstatic PyObject* _nyxlist_extend(nyx_list* self, PyObject* other);\n\nstatic int _nyxlist_init(\n    nyx_list* self, PyObject* args, PyObject* kwargs) {\n  PyObject* arg{};\n  static char* kwlist[] = {\"sequence\", 0};\n\n  if (!PyArg_ParseTupleAndKeywords(args, kwargs, \"|O:nyx_list\", kwlist, &arg))\n    return -1;\n\n  self->_init();\n  if (arg != nullptr) {\n    auto* r = _nyxlist_extend(self, arg);\n    if (r == nullptr)\n      return -1;\n    Py_DECREF(r);\n  }\n  return 0;\n}\n\nstatic void _nyxlist_dealloc(nyx_list* self) {\n  self->_dealloc();\n}\n\nstatic PyObject* _nyxlist_repr(nyx_list* self) {\n  return Py_BuildValue(\"s\", self->_repr().c_str());\n}\n\nstatic PyObject* _nyxlist_clear(nyx_list* self) {\n  self->_clear();\n  Py_RETURN_NONE;\n}\n\nstatic PyObject* _nyxlist_size(nyx_list* self) {\n  return Py_BuildValue(\"l\", self->_size());\n}\n\nstatic PyObject* _nyxlist_append(nyx_list* self, PyObject* v) {\n  if (v == nullptr)\n    return nullptr;\n  if (self == v) {\n    PyErr_SetString(PyExc_RuntimeError, \"append(object): can not append self\");\n    return nullptr;\n  }\n\n  Py_INCREF(v);\n  self->_append(v);\n  Py_RETURN_NONE;\n}\n\nstatic PyObject* _nyxlist_insert(nyx_list* self, PyObject* args) {\n  Py_ssize_t i;\n  PyObject* v;\n  if (!PyArg_ParseTuple(args, \"nO:insert\", &i, &v))\n    return nullptr;\n  if (v == nullptr) {\n    PyErr_BadInternalCall();\n    return nullptr;\n  }\n  if (self == v) {\n    PyErr_SetString(PyExc_RuntimeError,\n        \"insert(index, object): cannot insert self\");\n    return nullptr;\n  }\n\n  auto n = self->_size();\n  if (n == PY_SSIZE_T_MAX) {\n    PyErr_SetString(PyExc_OverflowError,\n        \"insert(index, object): cannot add more objects to list\");\n    return nullptr;\n  }\n  if (i < 0)\n    i += n;\n  if (i < 0 || i > n) {\n    PyErr_SetString(PyExc_IndexError,\n        \"insert(index, object): index out of range\");\n    return nullptr;\n  }\n\n  Py_INCREF(v);\n  self->_insert(i, v);\n  Py_RETURN_NONE;\n}\n\nstatic PyObject* _nyxlist_extend(nyx_list* self, PyObject* other) {\n  if (self == other) {\n    PyErr_SetString(PyExc_RuntimeError, \"extend(iterable): cannot extend self\");\n    return nullptr;\n  }\n\n  if (PyTuple_CheckExact(other) || PyList_CheckExact(other)) {\n    other = PySequence_Fast(other, \"argument must be iterable\");\n    if (other == nullptr)\n      return nullptr;\n    auto n = PySequence_Fast_GET_SIZE(other);\n    if (n == 0) {\n      Py_DECREF(other);\n      Py_RETURN_NONE;\n    }\n\n    auto* src = PySequence_Fast_ITEMS(other);\n    for (auto i = 0; i < n; ++i) {\n      auto* x = src[i];\n      Py_INCREF(x);\n      self->_append(x);\n    }\n    Py_DECREF(other);\n  }\n  else if (__is_nyxlist(other)) {\n    auto* other_self = static_cast<nyx_list*>(other);\n    auto n = other_self->_size();\n    if (n > 0) {\n      for (auto i = 0; i < n; ++i) {\n        auto* x = other_self->_at(i);\n        Py_INCREF(x);\n        self->_append(x);\n      }\n    }\n  }\n  else {\n    return nullptr;\n  }\n  Py_RETURN_NONE;\n}\n\nstatic Py_ssize_t _nyxlist__meth_length(nyx_list* self) {\n  return self->_size();\n}\n\nstatic PyObject* _nyxlist__meth_item(nyx_list* self, Py_ssize_t i) {\n  if (i < 0 || i >= self->_size()) {\n    PyErr_SetString(PyExc_IndexError, \"list index out of range\");\n    return nullptr;\n  }\n\n  auto* v = self->_at(i);\n  Py_INCREF(v);\n  return v;\n}\n\nstatic int _nyxlist__meth_contains(nyx_list* self, PyObject* o) {\n  return self->_contains(o);\n}\n\nstatic PyObject* _nyxlist__meth_subscript(nyx_list* self, PyObject* index) {\n  if (PyIndex_Check(index)) {\n    auto i = PyNumber_AsSsize_t(index, PyExc_IndexError);\n    if (i == -1 && PyErr_Occurred())\n      return nullptr;\n    if (i < 0)\n      i += self->_size();\n    return _nyxlist__meth_item(self, i);\n  }\n  else {\n    PyErr_Format(PyExc_TypeError,\n        \"list indices must be integers, not %.200s\", index->ob_type->tp_name);\n    return nullptr;\n  }\n}\n\nPyDoc_STRVAR(_nyxlist_doc,\n\"nyx_list() -> new empty nyx_list\\n\"\n\"nyx_list(iterable) -> new nyx_list initialized from iterable's items\");\nPyDoc_STRVAR(__clear_doc,\n\"L.clear() -- clear all elements of L\");\nPyDoc_STRVAR(__size_doc,\n\"L.size() -- return number of elements in L\");\nPyDoc_STRVAR(__append_doc,\n\"L.append(object) -- append object to end\");\nPyDoc_STRVAR(__insert_doc,\n\"L.insert(index, object) -- insert object before index\");\nPyDoc_STRVAR(__extend_doc,\n\"L.extend(iterable) -- extend list by appending elements from the iterable\");\nPyDoc_STRVAR(__getitem_doc,\n\"x.__getitem__(y) <==> x[y]\");\n\nstatic PySequenceMethods _nyxlist_as_sequence = {\n  (lenfunc)_nyxlist__meth_length, \/\/ sq_length\n  0, \/\/ sq_concat\n  0, \/\/ sq_repeat\n  (ssizeargfunc)_nyxlist__meth_item, \/\/ sq_item\n  0, \/\/ sq_slice\n  0, \/\/ sq_ass_item\n  0, \/\/ sq_ass_slice\n  (objobjproc)_nyxlist__meth_contains, \/\/ sq_contains\n  0, \/\/ sq_inplace_concat\n  0, \/\/ sq_inplace_repeat\n};\n\nstatic PyMappingMethods _nyxlist_as_mapping = {\n  (lenfunc)_nyxlist__meth_length, \/\/ mp_length\n  (binaryfunc)_nyxlist__meth_subscript, \/\/ mp_subscript\n  0, \/\/ map_ass_subscript\n};\n\nstatic PyMethodDef _nyxlist_methods[] = {\n  {\"clear\", (PyCFunction)_nyxlist_clear, METH_NOARGS, __clear_doc},\n  {\"size\", (PyCFunction)_nyxlist_size, METH_NOARGS, __size_doc},\n  {\"append\", (PyCFunction)_nyxlist_append, METH_O, __append_doc},\n  {\"insert\", (PyCFunction)_nyxlist_insert, METH_VARARGS, __insert_doc},\n  {\"extend\", (PyCFunction)_nyxlist_extend, METH_O, __extend_doc},\n  {\"__getitem__\", (PyCFunction)_nyxlist__meth_subscript, METH_O | METH_COEXIST, __getitem_doc},\n  {nullptr}\n};\n\nstatic PyTypeObject _nyxlist_type = {\n  PyObject_HEAD_INIT(nullptr)\n  0, \/\/ ob_size\n  \"_nyxcore.nyx_list\", \/\/ tp_name\n  sizeof(nyx_list), \/\/ tp_basicsize\n  0, \/\/ tp_itemsize\n  (destructor)_nyxlist_dealloc, \/\/ tp_dealloc\n  0, \/\/ tp_print\n  0, \/\/ tp_getattr\n  0, \/\/ tp_setattr\n  0, \/\/ tp_compare\n  (reprfunc)_nyxlist_repr, \/\/ tp_repr\n  0, \/\/ tp_as_number\n  &_nyxlist_as_sequence, \/\/ tp_as_sequence\n  &_nyxlist_as_mapping, \/\/ tp_as_mapping\n  (hashfunc)PyObject_HashNotImplemented, \/\/ tp_hash\n  0, \/\/ tp_call\n  (reprfunc)_nyxlist_repr, \/\/ tp_str\n  PyObject_GenericGetAttr, \/\/ tp_getattro\n  0, \/\/ tp_setattro\n  0, \/\/ tp_as_buffer\n  Py_TPFLAGS_DEFAULT | Py_TPFLAGS_BASETYPE, \/\/ tp_flags\n  _nyxlist_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  _nyxlist_methods, \/\/ 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  (initproc)_nyxlist_init, \/\/ tp_init\n  0, \/\/ tp_alloc\n  PyType_GenericNew, \/\/ tp_new\n};\n\nstatic bool __is_nyxlist(PyObject* o) {\n  return Py_TYPE(o) == &_nyxlist_type;\n}\n\nvoid nyx_list_wrap(PyObject* m) {\n  if (PyType_Ready(&_nyxlist_type) < 0)\n    return;\n\n  auto* _type = reinterpret_cast<PyObject*>(&_nyxlist_type);\n  Py_INCREF(_type);\n  PyModule_AddObject(m, \"nyx_list\", _type);\n}\n\n}\n<commit_msg>:construction: chore(nyx_list): add sizeof for nyx_list<commit_after>\/\/ Copyright (c) 2018 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 <sstream>\n#include <vector>\n#include \"nyx_container.h\"\n\nnamespace nyx {\n\nclass nyx_list : public PyObject {\n  using ObjectVector = std::vector<PyObject*>;\n  ObjectVector* vec_{};\npublic:\n  inline void _init(void) {\n    if (vec_ != nullptr)\n      _clear();\n    else\n      vec_ = new ObjectVector();\n  }\n\n  inline void _dealloc(void) {\n    if (vec_ != nullptr) {\n      _clear();\n      delete vec_;\n    }\n  }\n\n  inline int _contains(PyObject* o) const {\n    int cmp{};\n    for (auto* x : *vec_) {\n      cmp = PyObject_RichCompareBool(o, x, Py_EQ);\n      if (cmp != 0)\n        break;\n    }\n    return cmp;\n  }\n\n  inline void _clear(void) {\n    for (auto* x : *vec_)\n      Py_DECREF(x);\n    vec_->clear();\n  }\n\n  inline Py_ssize_t _size(void) const {\n    return vec_->size();\n  }\n\n  inline Py_ssize_t _capacity_bytes(void) const {\n    return vec_->capacity() * sizeof(PyObject*);\n  }\n\n  std::string _repr(void) const {\n    std::ostringstream oss;\n    oss << \"[\";\n    auto begin = vec_->begin();\n    while (begin != vec_->end()) {\n      if (PyString_Check(*begin))\n        oss << \"'\" << PyString_AsString(*begin) << \"'\";\n      else\n        oss << PyString_AsString(PyObject_Repr(*begin));\n\n      if (++begin != vec_->end())\n        oss << \", \";\n    }\n    oss << \"]\";\n\n    return oss.str();\n  }\n\n  inline void _append(PyObject* x) {\n    vec_->push_back(x);\n  }\n\n  inline void _insert(Py_ssize_t i, PyObject* x) {\n    vec_->insert(vec_->begin() + i, x);\n  }\n\n  inline PyObject* _at(Py_ssize_t i) const {\n    return vec_->at(i);\n  }\n};\n\nstatic bool __is_nyxlist(PyObject* o);\nstatic PyObject* _nyxlist_extend(nyx_list* self, PyObject* other);\n\nstatic int _nyxlist_init(\n    nyx_list* self, PyObject* args, PyObject* kwargs) {\n  PyObject* arg{};\n  static char* kwlist[] = {\"sequence\", 0};\n\n  if (!PyArg_ParseTupleAndKeywords(args, kwargs, \"|O:nyx_list\", kwlist, &arg))\n    return -1;\n\n  self->_init();\n  if (arg != nullptr) {\n    auto* r = _nyxlist_extend(self, arg);\n    if (r == nullptr)\n      return -1;\n    Py_DECREF(r);\n  }\n  return 0;\n}\n\nstatic void _nyxlist_dealloc(nyx_list* self) {\n  self->_dealloc();\n}\n\nstatic PyObject* _nyxlist_repr(nyx_list* self) {\n  return Py_BuildValue(\"s\", self->_repr().c_str());\n}\n\nstatic PyObject* _nyxlist_clear(nyx_list* self) {\n  self->_clear();\n  Py_RETURN_NONE;\n}\n\nstatic PyObject* _nyxlist_size(nyx_list* self) {\n  return Py_BuildValue(\"l\", self->_size());\n}\n\nstatic PyObject* _nyxlist_sizeof(nyx_list* self) {\n  auto s = _PyObject_SIZE(Py_TYPE(self)) + self->_capacity_bytes();\n  return PyInt_FromSsize_t(s);\n}\n\nstatic PyObject* _nyxlist_append(nyx_list* self, PyObject* v) {\n  if (v == nullptr)\n    return nullptr;\n  if (self == v) {\n    PyErr_SetString(PyExc_RuntimeError, \"append(object): can not append self\");\n    return nullptr;\n  }\n\n  Py_INCREF(v);\n  self->_append(v);\n  Py_RETURN_NONE;\n}\n\nstatic PyObject* _nyxlist_insert(nyx_list* self, PyObject* args) {\n  Py_ssize_t i;\n  PyObject* v;\n  if (!PyArg_ParseTuple(args, \"nO:insert\", &i, &v))\n    return nullptr;\n  if (v == nullptr) {\n    PyErr_BadInternalCall();\n    return nullptr;\n  }\n  if (self == v) {\n    PyErr_SetString(PyExc_RuntimeError,\n        \"insert(index, object): cannot insert self\");\n    return nullptr;\n  }\n\n  auto n = self->_size();\n  if (n == PY_SSIZE_T_MAX) {\n    PyErr_SetString(PyExc_OverflowError,\n        \"insert(index, object): cannot add more objects to list\");\n    return nullptr;\n  }\n  if (i < 0)\n    i += n;\n  if (i < 0 || i > n) {\n    PyErr_SetString(PyExc_IndexError,\n        \"insert(index, object): index out of range\");\n    return nullptr;\n  }\n\n  Py_INCREF(v);\n  self->_insert(i, v);\n  Py_RETURN_NONE;\n}\n\nstatic PyObject* _nyxlist_extend(nyx_list* self, PyObject* other) {\n  if (self == other) {\n    PyErr_SetString(PyExc_RuntimeError, \"extend(iterable): cannot extend self\");\n    return nullptr;\n  }\n\n  if (PyTuple_CheckExact(other) || PyList_CheckExact(other)) {\n    other = PySequence_Fast(other, \"argument must be iterable\");\n    if (other == nullptr)\n      return nullptr;\n    auto n = PySequence_Fast_GET_SIZE(other);\n    if (n == 0) {\n      Py_DECREF(other);\n      Py_RETURN_NONE;\n    }\n\n    auto* src = PySequence_Fast_ITEMS(other);\n    for (auto i = 0; i < n; ++i) {\n      auto* x = src[i];\n      Py_INCREF(x);\n      self->_append(x);\n    }\n    Py_DECREF(other);\n  }\n  else if (__is_nyxlist(other)) {\n    auto* other_self = static_cast<nyx_list*>(other);\n    auto n = other_self->_size();\n    if (n > 0) {\n      for (auto i = 0; i < n; ++i) {\n        auto* x = other_self->_at(i);\n        Py_INCREF(x);\n        self->_append(x);\n      }\n    }\n  }\n  else {\n    return nullptr;\n  }\n  Py_RETURN_NONE;\n}\n\nstatic Py_ssize_t _nyxlist__meth_length(nyx_list* self) {\n  return self->_size();\n}\n\nstatic PyObject* _nyxlist__meth_item(nyx_list* self, Py_ssize_t i) {\n  if (i < 0 || i >= self->_size()) {\n    PyErr_SetString(PyExc_IndexError, \"list index out of range\");\n    return nullptr;\n  }\n\n  auto* v = self->_at(i);\n  Py_INCREF(v);\n  return v;\n}\n\nstatic int _nyxlist__meth_contains(nyx_list* self, PyObject* o) {\n  return self->_contains(o);\n}\n\nstatic PyObject* _nyxlist__meth_subscript(nyx_list* self, PyObject* index) {\n  if (PyIndex_Check(index)) {\n    auto i = PyNumber_AsSsize_t(index, PyExc_IndexError);\n    if (i == -1 && PyErr_Occurred())\n      return nullptr;\n    if (i < 0)\n      i += self->_size();\n    return _nyxlist__meth_item(self, i);\n  }\n  else {\n    PyErr_Format(PyExc_TypeError,\n        \"list indices must be integers, not %.200s\", index->ob_type->tp_name);\n    return nullptr;\n  }\n}\n\nPyDoc_STRVAR(_nyxlist_doc,\n\"nyx_list() -> new empty nyx_list\\n\"\n\"nyx_list(iterable) -> new nyx_list initialized from iterable's items\");\nPyDoc_STRVAR(__clear_doc,\n\"L.clear() -- clear all elements of L\");\nPyDoc_STRVAR(__size_doc,\n\"L.size() -- return number of elements in L\");\nPyDoc_STRVAR(__append_doc,\n\"L.append(object) -- append object to end\");\nPyDoc_STRVAR(__insert_doc,\n\"L.insert(index, object) -- insert object before index\");\nPyDoc_STRVAR(__extend_doc,\n\"L.extend(iterable) -- extend list by appending elements from the iterable\");\nPyDoc_STRVAR(__getitem_doc,\n\"x.__getitem__(y) <==> x[y]\");\nPyDoc_STRVAR(__sizeof_doc,\n\"L.__sizeof__() -- size of L in memory, in bytes\");\n\nstatic PySequenceMethods _nyxlist_as_sequence = {\n  (lenfunc)_nyxlist__meth_length, \/\/ sq_length\n  0, \/\/ sq_concat\n  0, \/\/ sq_repeat\n  (ssizeargfunc)_nyxlist__meth_item, \/\/ sq_item\n  0, \/\/ sq_slice\n  0, \/\/ sq_ass_item\n  0, \/\/ sq_ass_slice\n  (objobjproc)_nyxlist__meth_contains, \/\/ sq_contains\n  0, \/\/ sq_inplace_concat\n  0, \/\/ sq_inplace_repeat\n};\n\nstatic PyMappingMethods _nyxlist_as_mapping = {\n  (lenfunc)_nyxlist__meth_length, \/\/ mp_length\n  (binaryfunc)_nyxlist__meth_subscript, \/\/ mp_subscript\n  0, \/\/ map_ass_subscript\n};\n\nstatic PyMethodDef _nyxlist_methods[] = {\n  {\"clear\", (PyCFunction)_nyxlist_clear, METH_NOARGS, __clear_doc},\n  {\"size\", (PyCFunction)_nyxlist_size, METH_NOARGS, __size_doc},\n  {\"append\", (PyCFunction)_nyxlist_append, METH_O, __append_doc},\n  {\"insert\", (PyCFunction)_nyxlist_insert, METH_VARARGS, __insert_doc},\n  {\"extend\", (PyCFunction)_nyxlist_extend, METH_O, __extend_doc},\n  {\"__getitem__\", (PyCFunction)_nyxlist__meth_subscript, METH_O | METH_COEXIST, __getitem_doc},\n  {\"__sizeof__\", (PyCFunction)_nyxlist_sizeof, METH_NOARGS, __sizeof_doc},\n  {nullptr}\n};\n\nstatic PyTypeObject _nyxlist_type = {\n  PyObject_HEAD_INIT(nullptr)\n  0, \/\/ ob_size\n  \"_nyxcore.nyx_list\", \/\/ tp_name\n  sizeof(nyx_list), \/\/ tp_basicsize\n  0, \/\/ tp_itemsize\n  (destructor)_nyxlist_dealloc, \/\/ tp_dealloc\n  0, \/\/ tp_print\n  0, \/\/ tp_getattr\n  0, \/\/ tp_setattr\n  0, \/\/ tp_compare\n  (reprfunc)_nyxlist_repr, \/\/ tp_repr\n  0, \/\/ tp_as_number\n  &_nyxlist_as_sequence, \/\/ tp_as_sequence\n  &_nyxlist_as_mapping, \/\/ tp_as_mapping\n  (hashfunc)PyObject_HashNotImplemented, \/\/ tp_hash\n  0, \/\/ tp_call\n  (reprfunc)_nyxlist_repr, \/\/ tp_str\n  PyObject_GenericGetAttr, \/\/ tp_getattro\n  0, \/\/ tp_setattro\n  0, \/\/ tp_as_buffer\n  Py_TPFLAGS_DEFAULT | Py_TPFLAGS_BASETYPE, \/\/ tp_flags\n  _nyxlist_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  _nyxlist_methods, \/\/ 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  (initproc)_nyxlist_init, \/\/ tp_init\n  0, \/\/ tp_alloc\n  PyType_GenericNew, \/\/ tp_new\n};\n\nstatic bool __is_nyxlist(PyObject* o) {\n  return Py_TYPE(o) == &_nyxlist_type;\n}\n\nvoid nyx_list_wrap(PyObject* m) {\n  if (PyType_Ready(&_nyxlist_type) < 0)\n    return;\n\n  auto* _type = reinterpret_cast<PyObject*>(&_nyxlist_type);\n  Py_INCREF(_type);\n  PyModule_AddObject(m, \"nyx_list\", _type);\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* bzflag\n * Copyright (c) 1993 - 2008 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 MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.\n *\/\n\n#ifdef _MSC_VER\n#pragma warning(4:4786)\n#endif\n\n\/\/ interface header\n#include \"Bundle.h\"\n\n\/\/ system headers\n#include <iostream>\n#include <fstream>\n#include <stdio.h>\n\n\/\/ local implementation headers\n#include \"StateDatabase.h\"\n#include \"AnsiCodes.h\"\n\n\nBundle::Bundle(const Bundle *pBundle)\n{\n  if (pBundle == NULL)\n    return;\n\n  mappings = pBundle->mappings;\n}\n\nvoid Bundle::load(const std::string &path)\n{\n  std::string untranslated;\n  std::string translated;\n  char buffer[1024];\n\n  std::ifstream poStrm(path.c_str());\n  if (!poStrm.good())\n    return;\n\n  poStrm.getline(buffer,1024);\n  while (poStrm.good()) {\n    std::string line = buffer;\n    std::string data;\n    TLineType type = parseLine(line, data);\n    if (type == tMSGID) {\n      if (untranslated.length() > 0) {\n\tmappings.erase(untranslated);\n\tmappings.insert(std::pair<std::string,std::string>(untranslated, translated));\n      }\n      untranslated = data;\n      translated.resize(0);\n    }\n    else if (type == tMSGSTR) {\n      if (untranslated.length() > 0)\n\ttranslated = data;\n    }\n    else if (type == tAPPEND) {\n      if (untranslated.length() > 0)\n\ttranslated += data;\n    }\n    else if (type == tERROR) {\n\n    }\n\n\n    poStrm.getline(buffer,1024);\n  }\n\n  if ((untranslated.length() > 0) && (translated.length() > 0)) {\n    mappings.erase(untranslated);\n    mappings.insert(std::pair<std::string,std::string>(untranslated, translated));\n  }\n}\n\nBundle::TLineType Bundle::parseLine(const std::string &line, std::string &data) const\n{\n  int startPos, endPos;\n  TLineType type;\n\n  data.resize(0);\n  startPos = line.find_first_not_of(\"\\t \\r\\n\");\n\n  if ((startPos < 0) || (line.at(startPos) == '#'))\n    return tCOMMENT;\n\n  else if (line.at(startPos) == '\"') {\n    endPos = line.find_first_of('\"', startPos+1);\n    if (endPos < 0)\n      endPos = line.length();\n    data = line.substr(startPos+1, endPos-startPos-1);\n    return tAPPEND;\n  }\n\n  endPos = line.find_first_of(\"\\t \\r\\n\\\"\");\n  if (endPos < 0)\n    endPos = line.length();\n  std::string key = line.substr(startPos, endPos-startPos);\n  if (key == \"msgid\")\n    type = tMSGID;\n  else if (key == \"msgstr\")\n    type = tMSGSTR;\n  else\n    return tERROR;\n\n  startPos = line.find_first_of('\"', endPos + 1);\n  if (startPos >= 0) {\n    startPos++;\n    endPos = line.find_first_of('\"', startPos);\n    if (endPos < 0)\n      endPos = line.length();\n    data = line.substr( startPos, endPos-startPos);\n  }\n  return type;\n}\n\n#include <set>\nstatic std::set<std::string> unmapped;\n\nstd::string Bundle::getLocalString(const std::string &key) const\n{\n  if (key == \"\") return key;\n  BundleStringMap::const_iterator it = mappings.find(key);\n  if (it != mappings.end()) {\n    return it->second;\n  } else {\n    if (BZDB.getDebug()) {\n      if (unmapped.find( key ) == unmapped.end( )) {\n\tunmapped.insert( key );\n\tlogDebugMessage(1,\"Unmapped Locale String: %s\\n\", stripAnsiCodes(key.c_str()));\n      }\n    }\n    return key;\n  }\n}\n\nconst char utf8bytes[256] = {\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  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  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  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  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  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, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,\n  3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3, 4,4,4,4,4,4,4,4,5,5,5,5,6,6,6,6\n};\n\n#if 0\n    \/\/ TODO: find the utf-8 values for these\n    switch (c) {\n      case 'Œ':\n      case 'Š':\n\tmsg[i] = 'a';\n      break;\n      case '':\n      case '€':\n\tmsg[i] = 'A';\n      break;\n      case '†':\n\tmsg[i] = 'i';\n      break;\n      case 'š':\n\tmsg[i] = 'o';\n      break;\n      case '\n':\n\tmsg[i] = 'O';\n      break;\n      case 'Ÿ':\n\tmsg[i] = 'Y';\n      break;\n    }\n#endif\n\nstd::string Bundle::formatMessage(const std::string &key, const std::vector<std::string> *parms) const\n{\n  std::string messageIn = getLocalString(key);\n  std::string messageOut;\n\n  if (!parms || (parms->size() == 0))\n    return messageIn;\n\n  int parmCnt = parms->size();\n  int startPos = 0;\n  int lCurlyPos = messageIn.find_first_of(\"{\");\n\n  while (lCurlyPos >= 0) {\n    messageOut += messageIn.substr( startPos, lCurlyPos - startPos);\n    int rCurlyPos = messageIn.find_first_of(\"}\", lCurlyPos++);\n    if (rCurlyPos < 0) {\n      messageOut += messageIn.substr(lCurlyPos);\n      return messageOut;\n    }\n    std::string numStr = messageIn.substr(lCurlyPos, rCurlyPos-lCurlyPos);\n    int num;\n    if (sscanf(numStr.c_str(), \"%d\", &num) != 1)\n      messageOut += messageIn.substr(lCurlyPos, rCurlyPos-lCurlyPos);\n    else {\n      num--;\n      if ((num >= 0) && (num < parmCnt))\n\tmessageOut += (*parms)[num];\n    }\n    startPos = rCurlyPos+1;\n    lCurlyPos = messageIn.find_first_of(\"{\", startPos);\n  }\n  messageOut += messageIn.substr(startPos);\n  return messageOut;\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>undo erroneous normalization<commit_after>\/* bzflag\n * Copyright (c) 1993 - 2008 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 MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.\n *\/\n\n#ifdef _MSC_VER\n#pragma warning(4:4786)\n#endif\n\n\/\/ interface header\n#include \"Bundle.h\"\n\n\/\/ system headers\n#include <iostream>\n#include <fstream>\n#include <stdio.h>\n\n\/\/ local implementation headers\n#include \"StateDatabase.h\"\n#include \"AnsiCodes.h\"\n\n\nBundle::Bundle(const Bundle *pBundle)\n{\n  if (pBundle == NULL)\n    return;\n\n  mappings = pBundle->mappings;\n}\n\nvoid Bundle::load(const std::string &path)\n{\n  std::string untranslated;\n  std::string translated;\n  char buffer[1024];\n\n  std::ifstream poStrm(path.c_str());\n  if (!poStrm.good())\n    return;\n\n  poStrm.getline(buffer,1024);\n  while (poStrm.good()) {\n    std::string line = buffer;\n    std::string data;\n    TLineType type = parseLine(line, data);\n    if (type == tMSGID) {\n      if (untranslated.length() > 0) {\n\tmappings.erase(untranslated);\n\tmappings.insert(std::pair<std::string,std::string>(untranslated, translated));\n      }\n      untranslated = data;\n      translated.resize(0);\n    }\n    else if (type == tMSGSTR) {\n      if (untranslated.length() > 0)\n\ttranslated = data;\n    }\n    else if (type == tAPPEND) {\n      if (untranslated.length() > 0)\n\ttranslated += data;\n    }\n    else if (type == tERROR) {\n\n    }\n\n\n    poStrm.getline(buffer,1024);\n  }\n\n  if ((untranslated.length() > 0) && (translated.length() > 0)) {\n    mappings.erase(untranslated);\n    mappings.insert(std::pair<std::string,std::string>(untranslated, translated));\n  }\n}\n\nBundle::TLineType Bundle::parseLine(const std::string &line, std::string &data) const\n{\n  int startPos, endPos;\n  TLineType type;\n\n  data.resize(0);\n  startPos = line.find_first_not_of(\"\\t \\r\\n\");\n\n  if ((startPos < 0) || (line.at(startPos) == '#'))\n    return tCOMMENT;\n\n  else if (line.at(startPos) == '\"') {\n    endPos = line.find_first_of('\"', startPos+1);\n    if (endPos < 0)\n      endPos = line.length();\n    data = line.substr(startPos+1, endPos-startPos-1);\n    return tAPPEND;\n  }\n\n  endPos = line.find_first_of(\"\\t \\r\\n\\\"\");\n  if (endPos < 0)\n    endPos = line.length();\n  std::string key = line.substr(startPos, endPos-startPos);\n  if (key == \"msgid\")\n    type = tMSGID;\n  else if (key == \"msgstr\")\n    type = tMSGSTR;\n  else\n    return tERROR;\n\n  startPos = line.find_first_of('\"', endPos + 1);\n  if (startPos >= 0) {\n    startPos++;\n    endPos = line.find_first_of('\"', startPos);\n    if (endPos < 0)\n      endPos = line.length();\n    data = line.substr( startPos, endPos-startPos);\n  }\n  return type;\n}\n\n#include <set>\nstatic std::set<std::string> unmapped;\n\nstd::string Bundle::getLocalString(const std::string &key) const\n{\n  if (key == \"\") return key;\n  BundleStringMap::const_iterator it = mappings.find(key);\n  if (it != mappings.end()) {\n    return it->second;\n  } else {\n    if (BZDB.getDebug()) {\n      if (unmapped.find( key ) == unmapped.end( )) {\n\tunmapped.insert( key );\n\tlogDebugMessage(1,\"Unmapped Locale String: %s\\n\", stripAnsiCodes(key.c_str()));\n      }\n    }\n    return key;\n  }\n}\n\nconst char utf8bytes[256] = {\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  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  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  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  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  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, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,\n  3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3, 4,4,4,4,4,4,4,4,5,5,5,5,6,6,6,6\n};\n\n#if 0\n    \/\/ TODO: find the utf-8 values for these\n    switch (c) {\n      case 'Œ':\n      case 'Š':\n\tmsg[i] = 'a';\n      break;\n      case '':\n      case '€':\n\tmsg[i] = 'A';\n      break;\n      case '†':\n\tmsg[i] = 'i';\n      break;\n      case 'š':\n\tmsg[i] = 'o';\n      break;\n      case '…':\n\tmsg[i] = 'O';\n      break;\n      case 'Ÿ':\n\tmsg[i] = 'Y';\n      break;\n    }\n#endif\n\nstd::string Bundle::formatMessage(const std::string &key, const std::vector<std::string> *parms) const\n{\n  std::string messageIn = getLocalString(key);\n  std::string messageOut;\n\n  if (!parms || (parms->size() == 0))\n    return messageIn;\n\n  int parmCnt = parms->size();\n  int startPos = 0;\n  int lCurlyPos = messageIn.find_first_of(\"{\");\n\n  while (lCurlyPos >= 0) {\n    messageOut += messageIn.substr( startPos, lCurlyPos - startPos);\n    int rCurlyPos = messageIn.find_first_of(\"}\", lCurlyPos++);\n    if (rCurlyPos < 0) {\n      messageOut += messageIn.substr(lCurlyPos);\n      return messageOut;\n    }\n    std::string numStr = messageIn.substr(lCurlyPos, rCurlyPos-lCurlyPos);\n    int num;\n    if (sscanf(numStr.c_str(), \"%d\", &num) != 1)\n      messageOut += messageIn.substr(lCurlyPos, rCurlyPos-lCurlyPos);\n    else {\n      num--;\n      if ((num >= 0) && (num < parmCnt))\n\tmessageOut += (*parms)[num];\n    }\n    startPos = rCurlyPos+1;\n    lCurlyPos = messageIn.find_first_of(\"{\", startPos);\n  }\n  messageOut += messageIn.substr(startPos);\n  return messageOut;\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\/\/#include \"rhodes\/JNIRhodes.h\"\n\/\/#include <rhodes.h>\n\/\/#include <android\/log.h>\n#include <common\/RhodesApp.h>\n#include <logging\/RhoLogConf.h>\n\n\n#include <stdlib.h>\n#include <windows.h>\n#include <commctrl.h>\n\n#include <imaging.h>\n#include <initguid.h>\n#include <imgguids.h>\n\n\n\n#define IP_PORTION_COUNT 32 \n\nvoid msg_out(const char* text) {\n\t\/\/wchar_t msg[2048];\n\t\/\/mbstowcs(msg, text, 2048);\n\t\/\/MessageBox(0, msg, L\"ImageProvider\", MB_OK);\n\t\/\/RAWLOG_ERROR(\"rho_platform_image_load_grayscale\");\n\t\/\/RAWLOG_ERROR(text);\n}\n\nvoid err_out(const char* text) {\n\t\/\/wchar_t msg[2048];\n\t\/\/mbstowcs(msg, text, 2048);\n\t\/\/MessageBox(0, msg, L\"ImageProvider\", MB_OK);\n\tRAWLOG_ERROR(\"rho_platform_image_load_grayscale\");\n\tRAWLOG_ERROR(text);\n}\n\n\nextern \"C\" void rho_platform_image_load_grayscale(const char* url, void** image_pixels, int* pwidth, int* pheight) {\n\t*image_pixels = 0;\n\t*pwidth = 0;\n\t*pheight = 0;\n\n\tmsg_out(url);\n\n\tIImagingFactory *pImgFactory = NULL;\n\tIImage *pImage = NULL;\n\n\tHRESULT co_init_result = CoInitializeEx(NULL, 0\/*COINIT_APARTMENTTHREADED*\/);\n\tif ( (co_init_result == S_OK) || (co_init_result == S_FALSE)  ) {\n\t\tmsg_out(\"CoInitializeEx OK\");\n\tif (SUCCEEDED(CoCreateInstance (CLSID_ImagingFactory,\n\t\tNULL,\n\t\tCLSCTX_INPROC_SERVER,\n\t\tIID_IImagingFactory,\n\t\t(void **)&pImgFactory)))\n\t{\n\t\tmsg_out(\"Create Image Factory OK\");\n\t\twchar_t wc_filename[2048];\n\t\tmbstowcs(wc_filename, url, 2048);\n\t\tif (SUCCEEDED(pImgFactory->CreateImageFromFile(\n\t\t\twc_filename,\n\t\t\t&pImage)))\n\t\t{\n\t\t\tmsg_out(\"Create Image OK\");\n\t\t\tImageInfo img_info;\n\t\t\tif ( SUCCEEDED(pImage->GetImageInfo(&img_info))) {\n\t\t\t\tmsg_out(\"Get Image Info OK\");\n\t\t\t\tIBitmapImage* pBitmap = 0;\n\t\t\t\tif ( SUCCEEDED(pImgFactory->CreateBitmapFromImage(\tpImage,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\timg_info.Width,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\timg_info.Height,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tPixelFormat16bppRGB565,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tInterpolationHintDefault,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t&pBitmap) )) {\n\t\t\t\t\tmsg_out(\"Create Bitmap OK\");\n\t\t\t\t\tRECT rc = { 0, 0, img_info.Width, img_info.Height};\n\t\t\t\t\tBitmapData bitmap_data;\n\t\t\t\t\tif ( SUCCEEDED(pBitmap->LockBits(\t&rc,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tImageLockModeRead,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tPixelFormatDontCare,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t&bitmap_data))) {\n\t\t\t\t\t\t\/\/\n\t\t\t\t\t\tmsg_out(\"Lock Bits OK\");\n\t\t\t\t\t\tvoid* src_buf = bitmap_data.Scan0;\n\t\t\t\t\t\tint stride = bitmap_data.Stride;\n\t\t\t\t\t\tint w = bitmap_data.Width;\n\t\t\t\t\t\tint h = bitmap_data.Height;\n\t\t\t\t\t\tunsigned char* gray_buf = new unsigned char[w*h];\n\t\t\t\t\t\tif (gray_buf != 0) {\n\t\t\t\t\t\t\tmsg_out(\"Gray buffer allocated OK\");\n\t\t\t\t\t\t\t*image_pixels = gray_buf;\n\t\t\t\t\t\t\t*pwidth = w;\n\t\t\t\t\t\t\t*pheight = h;\n\t\t\t\t\t\t\t\/\/ start convert\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\/\/ make gray image\n\t\t\t\t\t\t\t\tunsigned char* dst = gray_buf;\n\t\t\t\t\t\t\t\tunsigned short* src;\n\t\t\t\t\t\t\t\tint x;\n\t\t\t\t\t\t\t\tint y;\n\t\t\t\t\t\t\t\tfor (y = 0 ; y < h; y++) {\n\t\t\t\t\t\t\t\t\tint tk = (1<<16)\/3;\n\t\t\t\t\t\t\t\t\tif (stride < 0) {\n\t\t\t\t\t\t\t\t\t\tsrc = (unsigned short*)(((unsigned char*)src_buf) + (h-1-y)*(-stride));\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\telse {\n\t\t\t\t\t\t\t\t\t\tsrc = (unsigned short*)(((unsigned char*)src_buf) + y*(stride));\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tfor (x = w; x > 0; x--) {\n\t\t\t\t\t\t\t\t\t\tunsigned short c = *src++;\n\t\t\t\t\t\t\t\t\t\t*dst++ = (unsigned char)(((((c & 0x1F)<<3) + ((c & 0x7E0)>>3) + ((c & 0xF800)>>8))*tk)>>16);\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tmsg_out(\"Convert to grayscale finished OK\");\n\t\t\t\t\t\t\t\/\/ finish convert\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\terr_out(\"Gray Buffer not allocated !\");\n\t\t\t\t\t\t}\n\t\t\t\t\t\tpBitmap->UnlockBits(&bitmap_data);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\terr_out(\"Bitmap bits not locked !\");\n\t\t\t\t\t}\n\t\t\t\t\tpBitmap->Release();\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\terr_out(\"Bitmap not created !\");\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\terr_out(\"ImageInfo not received !\");\n\t\t\t}\n\t\t\tpImage->Release();\n\t\t}\n\t\telse {\n\t\t\terr_out(\"Image not created !\");\n\t\t}\n\t\tpImgFactory->Release();\n\t}\n\telse {\n\t\terr_out(\"ImageFactory not created !\");\n\t}\n\tCoUninitialize();\n\t}\n\telse {\n\t\terr_out(\"CoInitializeEx not initialized !\");\n\t}\n\tmsg_out(\"Finish !\");\n}\n\nextern \"C\" void rho_platform_image_free(void* image_pixels) {\n  if (image_pixels != 0) {\n    delete image_pixels;\n  }\n}\n\n\n<commit_msg>fix barcode build<commit_after>\n\/\/#include \"rhodes\/JNIRhodes.h\"\n\/\/#include <rhodes.h>\n\/\/#include <android\/log.h>\n#include <common\/RhodesApp.h>\n#include <logging\/RhoLogConf.h>\n\n\n#include <stdlib.h>\n#include <windows.h>\n#include <commctrl.h>\n\n#include <imaging.h>\n\/\/#include <initguid.h>\n#include <imgguids.h>\n\n\n\n#define IP_PORTION_COUNT 32 \n\nvoid msg_out(const char* text) {\n\t\/\/wchar_t msg[2048];\n\t\/\/mbstowcs(msg, text, 2048);\n\t\/\/MessageBox(0, msg, L\"ImageProvider\", MB_OK);\n\t\/\/RAWLOG_ERROR(\"rho_platform_image_load_grayscale\");\n\t\/\/RAWLOG_ERROR(text);\n}\n\nvoid err_out(const char* text) {\n\t\/\/wchar_t msg[2048];\n\t\/\/mbstowcs(msg, text, 2048);\n\t\/\/MessageBox(0, msg, L\"ImageProvider\", MB_OK);\n\tRAWLOG_ERROR(\"rho_platform_image_load_grayscale\");\n\tRAWLOG_ERROR(text);\n}\n\n\nextern \"C\" void rho_platform_image_load_grayscale(const char* url, void** image_pixels, int* pwidth, int* pheight) {\n\t*image_pixels = 0;\n\t*pwidth = 0;\n\t*pheight = 0;\n\n\tmsg_out(url);\n\n\tIImagingFactory *pImgFactory = NULL;\n\tIImage *pImage = NULL;\n\n\tHRESULT co_init_result = CoInitializeEx(NULL, 0\/*COINIT_APARTMENTTHREADED*\/);\n\tif ( (co_init_result == S_OK) || (co_init_result == S_FALSE)  ) {\n\t\tmsg_out(\"CoInitializeEx OK\");\n\tif (SUCCEEDED(CoCreateInstance (CLSID_ImagingFactory,\n\t\tNULL,\n\t\tCLSCTX_INPROC_SERVER,\n\t\tIID_IImagingFactory,\n\t\t(void **)&pImgFactory)))\n\t{\n\t\tmsg_out(\"Create Image Factory OK\");\n\t\twchar_t wc_filename[2048];\n\t\tmbstowcs(wc_filename, url, 2048);\n\t\tif (SUCCEEDED(pImgFactory->CreateImageFromFile(\n\t\t\twc_filename,\n\t\t\t&pImage)))\n\t\t{\n\t\t\tmsg_out(\"Create Image OK\");\n\t\t\tImageInfo img_info;\n\t\t\tif ( SUCCEEDED(pImage->GetImageInfo(&img_info))) {\n\t\t\t\tmsg_out(\"Get Image Info OK\");\n\t\t\t\tIBitmapImage* pBitmap = 0;\n\t\t\t\tif ( SUCCEEDED(pImgFactory->CreateBitmapFromImage(\tpImage,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\timg_info.Width,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\timg_info.Height,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tPixelFormat16bppRGB565,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tInterpolationHintDefault,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t&pBitmap) )) {\n\t\t\t\t\tmsg_out(\"Create Bitmap OK\");\n\t\t\t\t\tRECT rc = { 0, 0, img_info.Width, img_info.Height};\n\t\t\t\t\tBitmapData bitmap_data;\n\t\t\t\t\tif ( SUCCEEDED(pBitmap->LockBits(\t&rc,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tImageLockModeRead,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tPixelFormatDontCare,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t&bitmap_data))) {\n\t\t\t\t\t\t\/\/\n\t\t\t\t\t\tmsg_out(\"Lock Bits OK\");\n\t\t\t\t\t\tvoid* src_buf = bitmap_data.Scan0;\n\t\t\t\t\t\tint stride = bitmap_data.Stride;\n\t\t\t\t\t\tint w = bitmap_data.Width;\n\t\t\t\t\t\tint h = bitmap_data.Height;\n\t\t\t\t\t\tunsigned char* gray_buf = new unsigned char[w*h];\n\t\t\t\t\t\tif (gray_buf != 0) {\n\t\t\t\t\t\t\tmsg_out(\"Gray buffer allocated OK\");\n\t\t\t\t\t\t\t*image_pixels = gray_buf;\n\t\t\t\t\t\t\t*pwidth = w;\n\t\t\t\t\t\t\t*pheight = h;\n\t\t\t\t\t\t\t\/\/ start convert\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\/\/ make gray image\n\t\t\t\t\t\t\t\tunsigned char* dst = gray_buf;\n\t\t\t\t\t\t\t\tunsigned short* src;\n\t\t\t\t\t\t\t\tint x;\n\t\t\t\t\t\t\t\tint y;\n\t\t\t\t\t\t\t\tfor (y = 0 ; y < h; y++) {\n\t\t\t\t\t\t\t\t\tint tk = (1<<16)\/3;\n\t\t\t\t\t\t\t\t\tif (stride < 0) {\n\t\t\t\t\t\t\t\t\t\tsrc = (unsigned short*)(((unsigned char*)src_buf) + (h-1-y)*(-stride));\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\telse {\n\t\t\t\t\t\t\t\t\t\tsrc = (unsigned short*)(((unsigned char*)src_buf) + y*(stride));\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tfor (x = w; x > 0; x--) {\n\t\t\t\t\t\t\t\t\t\tunsigned short c = *src++;\n\t\t\t\t\t\t\t\t\t\t*dst++ = (unsigned char)(((((c & 0x1F)<<3) + ((c & 0x7E0)>>3) + ((c & 0xF800)>>8))*tk)>>16);\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tmsg_out(\"Convert to grayscale finished OK\");\n\t\t\t\t\t\t\t\/\/ finish convert\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\terr_out(\"Gray Buffer not allocated !\");\n\t\t\t\t\t\t}\n\t\t\t\t\t\tpBitmap->UnlockBits(&bitmap_data);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\terr_out(\"Bitmap bits not locked !\");\n\t\t\t\t\t}\n\t\t\t\t\tpBitmap->Release();\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\terr_out(\"Bitmap not created !\");\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\terr_out(\"ImageInfo not received !\");\n\t\t\t}\n\t\t\tpImage->Release();\n\t\t}\n\t\telse {\n\t\t\terr_out(\"Image not created !\");\n\t\t}\n\t\tpImgFactory->Release();\n\t}\n\telse {\n\t\terr_out(\"ImageFactory not created !\");\n\t}\n\tCoUninitialize();\n\t}\n\telse {\n\t\terr_out(\"CoInitializeEx not initialized !\");\n\t}\n\tmsg_out(\"Finish !\");\n}\n\nextern \"C\" void rho_platform_image_free(void* image_pixels) {\n  if (image_pixels != 0) {\n    delete image_pixels;\n  }\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Render primitive circles using radius rather than diameter<commit_after><|endoftext|>"}
{"text":"<commit_before>\r\n#include <clcpp\/clcpp.h>\r\n#include <clutl\/Containers.h>\r\n#include <clutl\/SerialiseVersionedBinary.h>\r\n\r\n\r\nclcpp_reflect(Stuff)\r\nnamespace Stuff\r\n{\r\n\tenum SomeEnum\r\n\t{\r\n\t\tVAL_A = 23,\r\n\t\tVAL_B = 51,\r\n\t\tVAL_C = 25,\r\n\t};\r\n\r\n\tenum NoInit { NO_INIT };\r\n\r\n\r\n\t#pragma pack(push, 8)\r\n\tstruct BaseStruct\r\n\t{\r\n\t\t\/*BaseStruct()\r\n\t\t\t\/\/: be(VAL_C), v0(0), v1(1)\r\n\t\t{\r\n\t\t}\r\n\t\tBaseStruct(NoInit) { }*\/\r\n\t\t\/\/SomeEnum be;\r\n\t\tBaseStruct() { }\r\n\t\tdouble v0;\r\n\t\tfloat v1;\r\n\t};\r\n\r\n\t\r\n\tstruct NestedStruct\r\n\t{\r\n\t\tNestedStruct()\r\n\t\t\t: a(1), b(2), c(3), d(4), e(5), f(6), g(7), h(8), i(9)\r\n\t\t{\r\n\t\t}\r\n\t\tNestedStruct(NoInit) { }\r\n\t\tshort a, b, c;\r\n\t\tchar d, e, f;\r\n\t\tint g, h, i;\r\n\t};\r\n\t#pragma pack(pop)\r\n\r\n\r\n\tstruct DerivedStruct : public BaseStruct\r\n\t{\r\n\t\t\/*DerivedStruct()\r\n\t\t\/\/\t: x(1), y(2), z(3), w(4), e(VAL_B)\r\n\t\t{\r\n\t\t}\r\n\t\tDerivedStruct(NoInit) {}\/\/: BaseStruct(NO_INIT), n(NO_INIT) { }*\/\r\n\t\tint x;\r\n\t\t\/\/float y;\r\n\t\t\/\/char z;\r\n\t\t\/\/double w;\r\n\t\t\/\/SomeEnum e;\r\n\t\t\/\/NestedStruct n;\r\n\t};\r\n};\r\n\r\n\r\n#include <stdio.h>\r\n\r\n\r\nvoid TestSerialise(clcpp::Database& db)\r\n{\r\n\tclutl::DataBuffer buffer(1024);\r\n\r\n\t\/\/ BUG: sizeof(BaseStruct) match with both MSVC and Clang. However:\r\n\t\/\/      DerivedStruct::x is at 24 in MSVC and 20 in Clang.\r\n\t\/\/      Odd point: sizeof(BaseStruct) is 24!\r\n\r\n\tint s = sizeof(Stuff::BaseStruct);\r\n\r\n\t\/\/int offset = (int)&(((Stuff::DerivedStruct*)0)->x);\r\n\tconst clcpp::Class* cptr = clcpp_get_type(db, Stuff::DerivedStruct)->AsClass();\r\n\tconst clcpp::Field* fptr = clcpp::FindPrimitive(cptr->fields, db.GetName(\"Stuff::DerivedStruct::x\").hash);\r\n\r\n\tprintf(\"sizeof(BaseStruct):         %d\\n\", sizeof(Stuff::BaseStruct));\r\n\tprintf(\"clang size:                 %d\\n\", clcpp_get_type(db, Stuff::BaseStruct)->size);\r\n\tprintf(\"sizeof(DerivedStruct):      %d\\n\", sizeof(Stuff::DerivedStruct));\r\n\tprintf(\"clang size:                 %d\\n\", clcpp_get_type(db, Stuff::DerivedStruct)->size);\r\n\tprintf(\"offsetof(DerivedStruct::x): %d\\n\", (int)&(((Stuff::DerivedStruct*)0)->x));\r\n\tprintf(\"clang offset:               %d\\n\", fptr->offset);\r\n\r\n\t\/*Stuff::DerivedStruct src;\r\n\tclutl::SaveVersionedBinary(buffer, &src, clcpp_get_type(db, Stuff::DerivedStruct));\r\n\tbuffer.Reset();\r\n\tStuff::DerivedStruct dest(Stuff::NO_INIT);\r\n\tclutl::LoadVersionedBinary(buffer, &dest, clcpp_get_type(db, Stuff::DerivedStruct));*\/\r\n}\r\n<commit_msg>Restored the serialisation tests that now work with the appropriate clang patch!<commit_after>\r\n#include <clcpp\/clcpp.h>\r\n#include <clutl\/Containers.h>\r\n#include <clutl\/SerialiseVersionedBinary.h>\r\n\r\n\r\nclcpp_reflect(Stuff)\r\nnamespace Stuff\r\n{\r\n\tenum SomeEnum\r\n\t{\r\n\t\tVAL_A = 23,\r\n\t\tVAL_B = 51,\r\n\t\tVAL_C = 25,\r\n\t};\r\n\r\n\tenum NoInit { NO_INIT };\r\n\r\n\r\n\tstruct BaseStruct\r\n\t{\r\n\t\tBaseStruct()\r\n\t\t\t: be(VAL_C), v0(0), v1(1)\r\n\t\t{\r\n\t\t}\r\n\t\tBaseStruct(NoInit) { }\r\n\t\tSomeEnum be;\r\n\t\tdouble v0;\r\n\t\tfloat v1;\r\n\t};\r\n\r\n\t\r\n\tstruct NestedStruct\r\n\t{\r\n\t\tNestedStruct()\r\n\t\t\t: a(1), b(2), c(3), d(4), e(5), f(6), g(7), h(8), i(9)\r\n\t\t{\r\n\t\t}\r\n\t\tNestedStruct(NoInit) { }\r\n\t\tshort a, b, c;\r\n\t\tchar d, e, f;\r\n\t\tint g, h, i;\r\n\t};\r\n\r\n\r\n\tstruct DerivedStruct : public BaseStruct\r\n\t{\r\n\t\tDerivedStruct()\r\n\t\t\t: x(1), y(2), z(3), w(4), e(VAL_B)\r\n\t\t{\r\n\t\t}\r\n\t\tDerivedStruct(NoInit) : BaseStruct(NO_INIT), n(NO_INIT) { }\r\n\t\tint x;\r\n\t\tfloat y;\r\n\t\tchar z;\r\n\t\tdouble w;\r\n\t\tSomeEnum e;\r\n\t\tNestedStruct n;\r\n\t};\r\n};\r\n\r\n\r\n#include <stdio.h>\r\n\r\n\r\nvoid TestSerialise(clcpp::Database& db)\r\n{\r\n\tclutl::DataBuffer buffer(1024);\r\n\r\n\t\/\/ BUG: sizeof(BaseStruct) match with both MSVC and Clang. However:\r\n\t\/\/      DerivedStruct::x is at 24 in MSVC and 20 in Clang.\r\n\t\/\/      Odd point: sizeof(BaseStruct) is 24!\r\n\r\n\tStuff::DerivedStruct src;\r\n\tclutl::SaveVersionedBinary(buffer, &src, clcpp_get_type(db, Stuff::DerivedStruct));\r\n\tbuffer.Reset();\r\n\tStuff::DerivedStruct dest(Stuff::NO_INIT);\r\n\tclutl::LoadVersionedBinary(buffer, &dest, clcpp_get_type(db, Stuff::DerivedStruct));\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>#include \"likelihood.h\"\n\n#include <queso\/GslVector.h>\n#include <queso\/GslMatrix.h>\n#include <queso\/VectorSet.h>\n\n#include <mkl.h>\n\n#include <cmath>\n\ntemplate <class V, class M>\nLikelihood<V, M>::Likelihood(const char * prefix,\n    const QUESO::VectorSet<V, M> & domainSet,\n    unsigned int num_simulations)\n  : QUESO::BaseScalarFunction<V, M>(prefix, domainSet),\n    m_observationParameter(1.0),\n    m_num_simulations(num_simulations),\n    m_simulations(m_num_simulations),\n    m_simulationParameters(m_num_simulations),\n    m_rho(0.5)\n{\n  \/\/ Generate observational data\n  double x = 0.25;  \/\/ Observation location\n  m_observation = m_observationParameter * std::sin(2.0 * M_PI * x);\n\n  \/\/ Generate `simulation data'\n  for (unsigned int i = 0; i < m_num_simulations; i++) {\n    \/\/ Evenly spaced parameters between 0 and 2\n    m_simulationParameters[i] = i * 2.0 \/ (m_num_simulations - 1);\n    \/\/ Observable is at the same location as the experiment\n    m_simulations[i] = m_simulationParameters[i] * std::sin(2.0 * M_PI * x);\n  }\n\n  \/\/ Allocate memory for the covariance matrix\n  \/\/ Exceptions will lead to memory leaks.  lul\n  m_covariance = (double *)malloc(sizeof(double) *\n                                  (m_num_simulations + 1) *\n                                  (m_num_simulations + 1));\n\n  if (m_covariance == NULL) {\n    queso_error_msg(\"Could not allocate memory for covariance matrix\");\n  }\n}\n\ntemplate <class V, class M>\nLikelihood<V, M>::~Likelihood()\n{\n  \/\/ free(m_covariance);\n}\n\ntemplate <class V, class M>\ndouble\nLikelihood<V, M>::lnValue(const V & domainVector, const V * domainDirection,\n    V * gradVector, M * hessianMatrix, V * hessianEffect) const\n{\n  unsigned int total_dim = m_num_simulations + 1;  \/\/ Plus 1 for one experiment\n\n  \/\/ First, fill up the covariance matrix\n  for (unsigned int i = 0; i < total_dim; i++) {\n    double parameter1;\n    \/\/ Deal with the single experiment\n    if (i == 0) {\n      \/\/ Difference in scenario variables is always zero.  No need to handle it.\n      \/\/ Deal with difference in parameters\n      parameter1 = domainVector[0];\n    }\n    else {\n      \/\/ Subtract 1 because we have 1 experiment (observation)\n      parameter1 = m_simulationParameters[i-1];\n    }\n\n    for (unsigned int j = 0; j < total_dim; j++) {\n      double parameter2;\n\n      \/\/ Deal with the single experiment (observation)\n      if (j == 0) {\n        parameter2 = domainVector[0];\n      }\n      else {\n        \/\/ Subtract 1 because we have 1 experiment (observation)\n        parameter2 = m_simulationParameters[j-1];\n      }\n\n      double param_diff = parameter1 - parameter2;\n      m_covariance[i*total_dim+j] = std::pow(m_rho, 4.0 * param_diff * param_diff);\n\n      if (i == j) {\n        m_covariance[i*total_dim+j] += 1e-6;\n      }\n    }\n  }\n\n  int info;\n  \/\/ Compute the \\infty-norm of m_covariance\n  \/\/ All elements of m_covariance are nonnegative\n  double norm = 0.0;\n  for (unsigned int i = 0; i < total_dim; i++) {\n    double tmp = 0.0;\n\n    for (unsigned int j = 0; j < total_dim; j++) {\n      tmp += m_covariance[i*total_dim+j];\n    }\n\n    if (tmp > norm) {\n      norm = tmp;\n    }\n  }\n    \n  \/\/ We're letting MKL choose the workspace array at runtime\n  \/\/ Assume unsigned int N converts to lapack_int\n  info = LAPACKE_dpotrf(LAPACK_ROW_MAJOR, 'U', total_dim, m_covariance, total_dim);\n\n  if (info == 0) {\n    std::cout << \"LAPACKE_dpotrf was successful\" << std::endl;\n  }\n  else if (info < 0) {\n    std::cout << \"LAPACKE_dpotrf was unsuccessful.\"\n              << \"  Parameter \" << info << \" had an illegal value.\"\n              << std::endl;\n    queso_error();\n  }\n  else {  \/\/ if (info > 0) {\n    std::cout << \"LAPACKE_dpotrf was unseccessful.\"\n              << \"  The leading minor of order \" << info << \" is not pos. def.\"\n              << \"  The Cholesky factorisation could not be completed.\"\n              << std::endl;\n    queso_error();\n  }\n\n  \/\/ Estimate the condition number of m_covariance\n  double cond;\n  info = LAPACKE_dpocon(LAPACK_ROW_MAJOR, 'U', total_dim, m_covariance, total_dim, norm, &cond);\n\n  if (info == 0) {\n    std::cout << \"Approximate reciprocal condition number of m_covariance is: \" << cond << std::endl;\n  }\n  else {\n    std::cout << \"Condition number estimation failed.\"\n              << \"  Parameter \" << info << \" had an illegal value.\"\n              << std::endl;\n    queso_error();\n  }\n\n  \/\/ Now do y^T \\Sigma^{-1} y\n  \/\/ First solve \\Sigma x = y for x\n  double * y = (double *)malloc(sizeof(double) * total_dim);\n  double * x = (double *)malloc(sizeof(double) * total_dim);\n\n  if (x == NULL) {\n    std::cout << \"Could not allocate enough memory for rhs\" << std::endl;\n    queso_error();\n  }\n\n  if (y == NULL) {\n    std::cout << \"Could not allocate enough memory for data\" << std::endl;\n    queso_error();\n  }\n\n  y[0] = m_observation;\n  x[0] = m_observation;\n  for (unsigned int i = 0; i < m_num_simulations; i++) {\n    y[i+1] = m_simulations[i];\n    x[i+1] = m_simulations[i];\n  }\n\n  \/\/ LAPACK treats the right-hand side as a matrix.  Since we only have one right-hand side\n  \/\/ the leading dimension of this 'matrix' is 1, not total_dim.  I'm an idiot.\n  info = LAPACKE_dpotrs(LAPACK_ROW_MAJOR, 'U', total_dim, 1, m_covariance, total_dim, x, 1);\n  if (info == 0) {\n    std::cout << \"LAPACKE_dpotrs successful\" << std::endl;\n  }\n  else {\n    std::cout << \"LAPACKE_dpotrs unsuccessful.  Parameter \" << info << \" had an illegal value\" << std::endl;\n    queso_error();\n  }\n\n  \/\/ Second compute y^T x\n  double llhd = cblas_ddot(total_dim, y, 1, x, 1);\n\n  \/\/ free(y);\n  \/\/ free(x);\n\n  return -0.5 * llhd;\n}\n\ntemplate <class V, class M>\ndouble\nLikelihood<V, M>::actualValue(const V & domainVector,\n    const V * domainDirection, V * gradVector, M * hessianMatrix,\n    V * hessianEffect) const\n{\n  return std::exp(this->lnValue(domainVector,\n                                domainDirection,\n                                gradVector,\n                                hessianMatrix,\n                                hessianEffect));\n}\n\ntemplate class Likelihood<QUESO::GslVector, QUESO::GslMatrix>;\n<commit_msg>Remove trailing whitespace<commit_after>#include \"likelihood.h\"\n\n#include <queso\/GslVector.h>\n#include <queso\/GslMatrix.h>\n#include <queso\/VectorSet.h>\n\n#include <mkl.h>\n\n#include <cmath>\n\ntemplate <class V, class M>\nLikelihood<V, M>::Likelihood(const char * prefix,\n    const QUESO::VectorSet<V, M> & domainSet,\n    unsigned int num_simulations)\n  : QUESO::BaseScalarFunction<V, M>(prefix, domainSet),\n    m_observationParameter(1.0),\n    m_num_simulations(num_simulations),\n    m_simulations(m_num_simulations),\n    m_simulationParameters(m_num_simulations),\n    m_rho(0.5)\n{\n  \/\/ Generate observational data\n  double x = 0.25;  \/\/ Observation location\n  m_observation = m_observationParameter * std::sin(2.0 * M_PI * x);\n\n  \/\/ Generate `simulation data'\n  for (unsigned int i = 0; i < m_num_simulations; i++) {\n    \/\/ Evenly spaced parameters between 0 and 2\n    m_simulationParameters[i] = i * 2.0 \/ (m_num_simulations - 1);\n    \/\/ Observable is at the same location as the experiment\n    m_simulations[i] = m_simulationParameters[i] * std::sin(2.0 * M_PI * x);\n  }\n\n  \/\/ Allocate memory for the covariance matrix\n  \/\/ Exceptions will lead to memory leaks.  lul\n  m_covariance = (double *)malloc(sizeof(double) *\n                                  (m_num_simulations + 1) *\n                                  (m_num_simulations + 1));\n\n  if (m_covariance == NULL) {\n    queso_error_msg(\"Could not allocate memory for covariance matrix\");\n  }\n}\n\ntemplate <class V, class M>\nLikelihood<V, M>::~Likelihood()\n{\n  \/\/ free(m_covariance);\n}\n\ntemplate <class V, class M>\ndouble\nLikelihood<V, M>::lnValue(const V & domainVector, const V * domainDirection,\n    V * gradVector, M * hessianMatrix, V * hessianEffect) const\n{\n  unsigned int total_dim = m_num_simulations + 1;  \/\/ Plus 1 for one experiment\n\n  \/\/ First, fill up the covariance matrix\n  for (unsigned int i = 0; i < total_dim; i++) {\n    double parameter1;\n    \/\/ Deal with the single experiment\n    if (i == 0) {\n      \/\/ Difference in scenario variables is always zero.  No need to handle it.\n      \/\/ Deal with difference in parameters\n      parameter1 = domainVector[0];\n    }\n    else {\n      \/\/ Subtract 1 because we have 1 experiment (observation)\n      parameter1 = m_simulationParameters[i-1];\n    }\n\n    for (unsigned int j = 0; j < total_dim; j++) {\n      double parameter2;\n\n      \/\/ Deal with the single experiment (observation)\n      if (j == 0) {\n        parameter2 = domainVector[0];\n      }\n      else {\n        \/\/ Subtract 1 because we have 1 experiment (observation)\n        parameter2 = m_simulationParameters[j-1];\n      }\n\n      double param_diff = parameter1 - parameter2;\n      m_covariance[i*total_dim+j] = std::pow(m_rho, 4.0 * param_diff * param_diff);\n\n      if (i == j) {\n        m_covariance[i*total_dim+j] += 1e-6;\n      }\n    }\n  }\n\n  int info;\n  \/\/ Compute the \\infty-norm of m_covariance\n  \/\/ All elements of m_covariance are nonnegative\n  double norm = 0.0;\n  for (unsigned int i = 0; i < total_dim; i++) {\n    double tmp = 0.0;\n\n    for (unsigned int j = 0; j < total_dim; j++) {\n      tmp += m_covariance[i*total_dim+j];\n    }\n\n    if (tmp > norm) {\n      norm = tmp;\n    }\n  }\n\n  \/\/ We're letting MKL choose the workspace array at runtime\n  \/\/ Assume unsigned int N converts to lapack_int\n  info = LAPACKE_dpotrf(LAPACK_ROW_MAJOR, 'U', total_dim, m_covariance, total_dim);\n\n  if (info == 0) {\n    std::cout << \"LAPACKE_dpotrf was successful\" << std::endl;\n  }\n  else if (info < 0) {\n    std::cout << \"LAPACKE_dpotrf was unsuccessful.\"\n              << \"  Parameter \" << info << \" had an illegal value.\"\n              << std::endl;\n    queso_error();\n  }\n  else {  \/\/ if (info > 0) {\n    std::cout << \"LAPACKE_dpotrf was unseccessful.\"\n              << \"  The leading minor of order \" << info << \" is not pos. def.\"\n              << \"  The Cholesky factorisation could not be completed.\"\n              << std::endl;\n    queso_error();\n  }\n\n  \/\/ Estimate the condition number of m_covariance\n  double cond;\n  info = LAPACKE_dpocon(LAPACK_ROW_MAJOR, 'U', total_dim, m_covariance, total_dim, norm, &cond);\n\n  if (info == 0) {\n    std::cout << \"Approximate reciprocal condition number of m_covariance is: \" << cond << std::endl;\n  }\n  else {\n    std::cout << \"Condition number estimation failed.\"\n              << \"  Parameter \" << info << \" had an illegal value.\"\n              << std::endl;\n    queso_error();\n  }\n\n  \/\/ Now do y^T \\Sigma^{-1} y\n  \/\/ First solve \\Sigma x = y for x\n  double * y = (double *)malloc(sizeof(double) * total_dim);\n  double * x = (double *)malloc(sizeof(double) * total_dim);\n\n  if (x == NULL) {\n    std::cout << \"Could not allocate enough memory for rhs\" << std::endl;\n    queso_error();\n  }\n\n  if (y == NULL) {\n    std::cout << \"Could not allocate enough memory for data\" << std::endl;\n    queso_error();\n  }\n\n  y[0] = m_observation;\n  x[0] = m_observation;\n  for (unsigned int i = 0; i < m_num_simulations; i++) {\n    y[i+1] = m_simulations[i];\n    x[i+1] = m_simulations[i];\n  }\n\n  \/\/ LAPACK treats the right-hand side as a matrix.  Since we only have one right-hand side\n  \/\/ the leading dimension of this 'matrix' is 1, not total_dim.  I'm an idiot.\n  info = LAPACKE_dpotrs(LAPACK_ROW_MAJOR, 'U', total_dim, 1, m_covariance, total_dim, x, 1);\n  if (info == 0) {\n    std::cout << \"LAPACKE_dpotrs successful\" << std::endl;\n  }\n  else {\n    std::cout << \"LAPACKE_dpotrs unsuccessful.  Parameter \" << info << \" had an illegal value\" << std::endl;\n    queso_error();\n  }\n\n  \/\/ Second compute y^T x\n  double llhd = cblas_ddot(total_dim, y, 1, x, 1);\n\n  \/\/ free(y);\n  \/\/ free(x);\n\n  return -0.5 * llhd;\n}\n\ntemplate <class V, class M>\ndouble\nLikelihood<V, M>::actualValue(const V & domainVector,\n    const V * domainDirection, V * gradVector, M * hessianMatrix,\n    V * hessianEffect) const\n{\n  return std::exp(this->lnValue(domainVector,\n                                domainDirection,\n                                gradVector,\n                                hessianMatrix,\n                                hessianEffect));\n}\n\ntemplate class Likelihood<QUESO::GslVector, QUESO::GslMatrix>;\n<|endoftext|>"}
{"text":"<commit_before>#include <cmd_handlers_leaks.h>\n#include <iostream>\n#include <employ_database.h>\n#include <QJsonArray>\n#include <QUuid>\n\n\/*********************************************\n * This handler will return the list of leaks\n**********************************************\/\n\nCmdHandlerLeaksList::CmdHandlerLeaksList()\n    : CmdHandlerBase(\"leaks_list\", \"Method returns list of leaks\"){\n\n    m_modelCommandAccess.setAccessUnauthorized(true);\n    m_modelCommandAccess.setAccessUser(true);\n    m_modelCommandAccess.setAccessAdmin(true);\n\n\t\/\/ validation and description input fields\n    m_vInputs.push_back(CmdInputDef(\"page\").required().integer_().description(\"Number of page\"));\n    m_vInputs.push_back(CmdInputDef(\"onpage\").required().integer_().description(\"How much rows in one page\"));\n}\n\n\/\/ ---------------------------------------------------------------------\n\nvoid CmdHandlerLeaksList::handle(ModelRequest *pRequest){\n\n    EmployDatabase *pDatabase = findEmploy<EmployDatabase>();\n\n    QJsonObject jsonRequest = pRequest->data();\n    QJsonObject jsonResponse;\n\n    int nPage = jsonRequest[\"page\"].toInt();\n    jsonResponse[\"page\"] = nPage;\n\n    int nOnPage = jsonRequest[\"onpage\"].toInt();\n    if(nOnPage > 50){\n        pRequest->sendMessageError(cmd(), Errors::OnPageCouldNotBeMoreThen50());\n        return;\n    }\n    jsonResponse[\"onpage\"] = nOnPage;\n\n    QStringList filters;\n    QMap<QString,QString> filter_values;\n\n    if(jsonRequest.contains(\"name\")){\n        QString name = jsonRequest[\"name\"].toString().trimmed();\n        if(name != \"\"){\n            filters << \"(l.name = :name)\";\n            filter_values[\":name\"] = name;\n        }\n    }\n\n    if(jsonRequest.contains(\"search\")){\n        QString search = jsonRequest[\"search\"].toString().trimmed();\n        if(search != \"\"){\n            filters << \"(l.message LIKE :search)\";\n            filter_values[\":search\"] = \"%\" + search + \"%\";\n        }\n        jsonResponse[\"search\"] = search;\n    }\n\n    QString where = filters.join(\" AND \");\n    if(where.length() > 0){\n        where = \"WHERE \" + where;\n    }\n\n    QSqlDatabase db = *(pDatabase->database());\n\n    \/\/count leaks\n    {\n        QSqlQuery query(db);\n        query.prepare(\"SELECT count(*) as cnt FROM leaks l \"\n            \" \" + where\n        );\n        foreach(QString key, filter_values.keys() ){\n            query.bindValue(key, filter_values.value(key));\n        }\n        if (!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n        if (query.next()) {\n            QSqlRecord record = query.record();\n            jsonResponse[\"count\"] = record.value(\"cnt\").toInt();\n        }\n    }\n\n    \/\/data\n    QJsonArray leakslist;\n    {\n        QSqlQuery query(db);\n        query.prepare(\"SELECT * FROM leaks l\"\n            \" \" + where +\n            \" ORDER BY id \"\n            \" LIMIT \" + QString::number(nPage*nOnPage) + \",\" + QString::number(nOnPage)\n        );\n        foreach(QString key, filter_values.keys() ){\n            query.bindValue(key, filter_values.value(key));\n        }\n        if (!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n        while (query.next()) {\n            QSqlRecord record = query.record();\n            QJsonObject leak;\n            leak[\"id\"] = record.value(\"id\").toInt();\n            leak[\"uuid\"] = record.value(\"uuid\").toString().toHtmlEscaped();\n            leak[\"gameid\"] = record.value(\"gameid\").toInt();\n            leak[\"name\"] = record.value(\"name\").toString().toHtmlEscaped();\n            leak[\"name\"] = record.value(\"name\").toString().toHtmlEscaped();\n            leak[\"content\"] = record.value(\"content\").toString().toHtmlEscaped();\n            leak[\"score\"] = record.value(\"score\").toInt();\n            leak[\"created\"] = record.value(\"created\").toString().toHtmlEscaped();\n            leak[\"updated\"] = record.value(\"updated\").toString().toHtmlEscaped();\n            leak[\"sold\"] = record.value(\"sold\").toInt();\n\n            leakslist.push_back(leak);\n        }\n    }\n\n    jsonResponse[\"data\"] = leakslist;\n    pRequest->sendMessageSuccess(cmd(), jsonResponse);\n}\n\n\/*********************************************\n * This handler will add one new leak\n**********************************************\/\n\nCmdHandlerLeaksAdd::CmdHandlerLeaksAdd()\n    : CmdHandlerBase(\"leaks_add\", \"Method adds a leak\"){\n\n    m_modelCommandAccess.setAccessUnauthorized(false);\n    m_modelCommandAccess.setAccessUser(false);\n    m_modelCommandAccess.setAccessAdmin(true);\n\n    \/\/ validation and description input fields\n    m_vInputs.push_back(CmdInputDef(\"gameid\").required().integer_().description(\"Id of the game\"));\n    m_vInputs.push_back(CmdInputDef(\"name\").required().string_().description(\"Visible part of the content\"));\n    m_vInputs.push_back(CmdInputDef(\"content\").required().string_().description(\"Content of the leak\"));\n    m_vInputs.push_back(CmdInputDef(\"score\").required().integer_().description(\"Price of the leak\"));\n}\n\n\/\/ ---------------------------------------------------------------------\n\nvoid CmdHandlerLeaksAdd::handle(ModelRequest *pRequest){\n\n    EmployDatabase *pDatabase = findEmploy<EmployDatabase>();\n\n    QJsonObject jsonRequest = pRequest->data();\n    QJsonObject jsonResponse;\n\n    QSqlDatabase db = *(pDatabase->database());\n\n    int nGameid = jsonRequest[\"gameid\"].toInt();\n    QString sName = jsonRequest[\"name\"].toString().trimmed().toHtmlEscaped();\n    QString sContent = jsonRequest[\"content\"].toString().trimmed().toHtmlEscaped();\n    int nScore = jsonRequest[\"score\"].toInt();\n\n    QSqlQuery query(db);\n    {\n        query.prepare(\"SELECT gameid FROM games WHERE id = :gameid\");\n        query.bindValue(\":gameid\", nGameid);\n        if (!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n        if (!query.next()){\n            pRequest->sendMessageError(cmd(), Errors::NotFound(\"game with this id\"));\n            return;\n        }\n    }\n\n    QString uuid = QUuid::createUuid().toString().replace(\"{\", \"\").replace(\"}\", \"\");\n\n    query.prepare(\"INSERT INTO leaks(\"\n                  \"uuid,\"\n                  \"gameid,\"\n                  \"name,\"\n                  \"content,\"\n                  \"score,\"\n                  \"created,\"\n                  \"updated,\"\n                  \"sold\"\n                  \")\"\n                  \"VALUES(\"\n                  \":uuid,\"\n                  \":gameid,\"\n                  \":name,\"\n                  \":content,\"\n                  \":score,\"\n                  \"NOW(),\"\n                  \"NOW(),\"\n                  \":sold\"\n                  \")\");\n    query.bindValue(\":uuid\", uuid);\n    query.bindValue(\":gameid\", nGameid);\n    query.bindValue(\":name\", sName);\n    query.bindValue(\":content\", sContent);\n    query.bindValue(\":score\", nScore);\n    query.bindValue(\":sold\", 0);\n    if (!query.exec()){\n        pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n        return;\n    }\n\n    pRequest->sendMessageSuccess(cmd(), jsonResponse);\n}\n\n\/*********************************************\n * This handler will update a leak\n**********************************************\/\n\nCmdHandlerLeaksUpdate::CmdHandlerLeaksUpdate()\n    : CmdHandlerBase(\"leaks_update\", \"Method updates a leak\"){\n\n    m_modelCommandAccess.setAccessUnauthorized(false);\n    m_modelCommandAccess.setAccessUser(false);\n    m_modelCommandAccess.setAccessAdmin(true);\n\n    \/\/ validation and description input fields\n    m_vInputs.push_back(CmdInputDef(\"id\").required().integer_().description(\"Leak id\"));\n    m_vInputs.push_back(CmdInputDef(\"name\").optional().string_().description(\"Visible part of the content\"));\n    m_vInputs.push_back(CmdInputDef(\"content\").optional().string_().description(\"Content of the leak\"));\n    m_vInputs.push_back(CmdInputDef(\"score\").optional().integer_().description(\"Price of the leak\"));\n}\n\n\/\/ ---------------------------------------------------------------------\n\nvoid CmdHandlerLeaksUpdate::handle(ModelRequest *pRequest){\n\n    EmployDatabase *pDatabase = findEmploy<EmployDatabase>();\n\n    QJsonObject jsonRequest = pRequest->data();\n    QJsonObject jsonResponse;\n\n    QSqlDatabase db = *(pDatabase->database());\n\n    int id = jsonRequest[\"id\"].toInt();\n\n    QSqlQuery query(db);\n    {\n        query.prepare(\"SELECT id FROM leaks WHERE id = :id\");\n        query.bindValue(\":id\", id);\n        if (!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n        if (!query.next()){\n            pRequest->sendMessageError(cmd(), Errors::NotFound(\"leak with this id\"));\n            return;\n        }\n    }\n\n    QString sName;\n    if(jsonRequest.contains(\"name\")){\n        sName = jsonRequest.value(\"name\").toString().trimmed().toHtmlEscaped();\n        query.prepare(\"UPDATE leaks SET name=:name WHERE id = :id\");\n        query.bindValue(\":name\", sName);\n        query.bindValue(\":id\", id);\n        if (!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n    }\n\n    QString sContent;\n    if(jsonRequest.contains(\"content\")){\n        sContent = jsonRequest.value(\"content\").toString().trimmed().toHtmlEscaped();\n        query.prepare(\"UPDATE leaks SET content=:content WHERE id = :id\");\n        query.bindValue(\":content\", sContent);\n        query.bindValue(\":id\", id);\n        if (!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n    }\n\n    int nScore;\n    if(jsonRequest.contains(\"score\")){\n        nScore = jsonRequest.value(\"score\").toInt();\n        query.prepare(\"UPDATE leaks SET score=:score WHERE id = :id\");\n        query.bindValue(\":score\", nScore);\n        query.bindValue(\":id\", id);\n        if (!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n    }\n\n    pRequest->sendMessageSuccess(cmd(), jsonResponse);\n}\n\n\/*********************************************\n * This handler will delete a leak\n**********************************************\/\n\nCmdHandlerLeaksDelete::CmdHandlerLeaksDelete()\n    : CmdHandlerBase(\"leaks_delete\", \"Method deletes a leak\"){\n\n    m_modelCommandAccess.setAccessUnauthorized(false);\n    m_modelCommandAccess.setAccessUser(false);\n    m_modelCommandAccess.setAccessAdmin(true);\n\n    \/\/ validation and description input fields\n    m_vInputs.push_back(CmdInputDef(\"id\").required().integer_().description(\"Leak id\"));\n}\n\n\/\/ ---------------------------------------------------------------------\n\nvoid CmdHandlerLeaksDelete::handle(ModelRequest *pRequest){\n\n    EmployDatabase *pDatabase = findEmploy<EmployDatabase>();\n\n    QJsonObject jsonRequest = pRequest->data();\n    QJsonObject jsonResponse;\n\n    QSqlDatabase db = *(pDatabase->database());\n\n    QSqlQuery query(db);\n\n    int id = jsonRequest[\"id\"].toInt();\n    {\n        query.prepare(\"SELECT id FROM leaks WHERE id = :id\");\n        query.bindValue(\":id\", id);\n        if (!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n        if (!query.next()){\n            pRequest->sendMessageError(cmd(), Errors::NotFound(\"leak with this id\"));\n            return;\n        }\n    }\n\n    \/\/deleting from users_leaks\n    {\n        query.prepare(\"DELETE FROM users_leaks WHERE leakid = :id\");\n        query.bindValue(\":id\", id);\n        if(!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n    }\n\n    \/\/deleting from leaks_files\n    {\n        query.prepare(\"DELETE FROM leaks_files WHERE leakid = :id\");\n        query.bindValue(\":id\", id);\n        if(!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n    }\n\n    \/\/deleting from leaks\n    {\n        query.prepare(\"DELETE FROM leaks WHERE id = :id\");\n        query.bindValue(\":id\", id);\n        if(!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n    }\n\n    pRequest->sendMessageSuccess(cmd(), jsonResponse);\n}\n\n\/*********************************************\n * This handler allows you to buy a leak\n**********************************************\/\n\nCmdHandlerLeaksBuy::CmdHandlerLeaksBuy()\n    : CmdHandlerBase(\"leaks_buy\", \"Method buys a leak\"){\n\n    m_modelCommandAccess.setAccessUnauthorized(false);\n    m_modelCommandAccess.setAccessUser(true);\n    m_modelCommandAccess.setAccessAdmin(false);\n\n    \/\/ validation and description input fields\n    m_vInputs.push_back(CmdInputDef(\"id\").required().integer_().description(\"Leak id\"));\n}\n\n\/\/ ---------------------------------------------------------------------\n\nvoid CmdHandlerLeaksBuy::handle(ModelRequest *pRequest){\n\n    EmployDatabase *pDatabase = findEmploy<EmployDatabase>();\n\n    QJsonObject jsonRequest = pRequest->data();\n    QJsonObject jsonResponse;\n\n    QSqlDatabase db = *(pDatabase->database());\n\n    QSqlQuery query(db);\n\n    int id = jsonRequest[\"id\"].toInt();\n    {\n        query.prepare(\"SELECT id FROM leaks WHERE id = :id\");\n        query.bindValue(\":id\", id);\n        if (!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n        if (!query.next()){\n            pRequest->sendMessageError(cmd(), Errors::NotFound(\"leak with this id\"));\n            return;\n        }\n    }\n\n    IUserToken *pUserToken = pRequest->userToken();\n    int nUserID = 0;\n    if(pUserToken != NULL) nUserID = pUserToken->userid();\n\n    int nScore;\n    {\n        query.prepare(\"SELECT score FROM leaks WHERE id = :id\");\n        query.bindValue(\":id\", id);\n        if (!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n        if (!query.next()){\n            pRequest->sendMessageError(cmd(), Errors::NotFound(\"leak with this id\"));\n            return;\n        }\n        else\n        {\n            QSqlRecord record = query.record();\n            nScore = record.value(\"score\").toInt();\n        }\n    }\n\n    \/\/update the user rating\n    {\n        query.prepare(\"UPDATE users SET rating = rating - :score WHERE id = :id\");\n        query.bindValue(\":score\", nScore);\n        query.bindValue(\":id\", nUserID);\n        if (!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n    }\n\n    \/\/attaching a leak to the user\n    query.prepare(\"INSERT INTO users_leaks(\"\n                  \"leakid,\"\n                  \"userid,\"\n                  \"grade,\"\n                  \"dt\"\n                  \")\"\n                  \"VALUES(\"\n                  \":leakid,\"\n                  \":userid,\"\n                  \":grade,\"\n                  \"NOW()\"\n                  \")\");\n    query.bindValue(\":leakid\", id);\n    query.bindValue(\":userid\", nUserID);\n    query.bindValue(\":grade\", -1);\n    if (!query.exec()){\n        pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n        return;\n    }\n\n    \/\/increment of the number of leaks sold\n    {\n        query.prepare(\"UPDATE leaks SET sold = sold + 1 WHERE id = :id\");\n        query.bindValue(\":id\", id);\n        if (!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n    }\n\n    pRequest->sendMessageSuccess(cmd(), jsonResponse);\n}\n<commit_msg>Fixed leaks_add<commit_after>#include <cmd_handlers_leaks.h>\n#include <iostream>\n#include <employ_database.h>\n#include <QJsonArray>\n#include <QUuid>\n\n\/*********************************************\n * This handler will return the list of leaks\n**********************************************\/\n\nCmdHandlerLeaksList::CmdHandlerLeaksList()\n    : CmdHandlerBase(\"leaks_list\", \"Method returns list of leaks\"){\n\n    m_modelCommandAccess.setAccessUnauthorized(true);\n    m_modelCommandAccess.setAccessUser(true);\n    m_modelCommandAccess.setAccessAdmin(true);\n\n\t\/\/ validation and description input fields\n    m_vInputs.push_back(CmdInputDef(\"page\").required().integer_().description(\"Number of page\"));\n    m_vInputs.push_back(CmdInputDef(\"onpage\").required().integer_().description(\"How much rows in one page\"));\n}\n\n\/\/ ---------------------------------------------------------------------\n\nvoid CmdHandlerLeaksList::handle(ModelRequest *pRequest){\n\n    EmployDatabase *pDatabase = findEmploy<EmployDatabase>();\n\n    QJsonObject jsonRequest = pRequest->data();\n    QJsonObject jsonResponse;\n\n    int nPage = jsonRequest[\"page\"].toInt();\n    jsonResponse[\"page\"] = nPage;\n\n    int nOnPage = jsonRequest[\"onpage\"].toInt();\n    if(nOnPage > 50){\n        pRequest->sendMessageError(cmd(), Errors::OnPageCouldNotBeMoreThen50());\n        return;\n    }\n    jsonResponse[\"onpage\"] = nOnPage;\n\n    QStringList filters;\n    QMap<QString,QString> filter_values;\n\n    if(jsonRequest.contains(\"name\")){\n        QString name = jsonRequest[\"name\"].toString().trimmed();\n        if(name != \"\"){\n            filters << \"(l.name = :name)\";\n            filter_values[\":name\"] = name;\n        }\n    }\n\n    if(jsonRequest.contains(\"search\")){\n        QString search = jsonRequest[\"search\"].toString().trimmed();\n        if(search != \"\"){\n            filters << \"(l.message LIKE :search)\";\n            filter_values[\":search\"] = \"%\" + search + \"%\";\n        }\n        jsonResponse[\"search\"] = search;\n    }\n\n    QString where = filters.join(\" AND \");\n    if(where.length() > 0){\n        where = \"WHERE \" + where;\n    }\n\n    QSqlDatabase db = *(pDatabase->database());\n\n    \/\/count leaks\n    {\n        QSqlQuery query(db);\n        query.prepare(\"SELECT count(*) as cnt FROM leaks l \"\n            \" \" + where\n        );\n        foreach(QString key, filter_values.keys() ){\n            query.bindValue(key, filter_values.value(key));\n        }\n        if (!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n        if (query.next()) {\n            QSqlRecord record = query.record();\n            jsonResponse[\"count\"] = record.value(\"cnt\").toInt();\n        }\n    }\n\n    \/\/data\n    QJsonArray leakslist;\n    {\n        QSqlQuery query(db);\n        query.prepare(\"SELECT * FROM leaks l\"\n            \" \" + where +\n            \" ORDER BY id \"\n            \" LIMIT \" + QString::number(nPage*nOnPage) + \",\" + QString::number(nOnPage)\n        );\n        foreach(QString key, filter_values.keys() ){\n            query.bindValue(key, filter_values.value(key));\n        }\n        if (!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n        while (query.next()) {\n            QSqlRecord record = query.record();\n            QJsonObject leak;\n            leak[\"id\"] = record.value(\"id\").toInt();\n            leak[\"uuid\"] = record.value(\"uuid\").toString().toHtmlEscaped();\n            leak[\"gameid\"] = record.value(\"gameid\").toInt();\n            leak[\"name\"] = record.value(\"name\").toString().toHtmlEscaped();\n            leak[\"name\"] = record.value(\"name\").toString().toHtmlEscaped();\n            leak[\"content\"] = record.value(\"content\").toString().toHtmlEscaped();\n            leak[\"score\"] = record.value(\"score\").toInt();\n            leak[\"created\"] = record.value(\"created\").toString().toHtmlEscaped();\n            leak[\"updated\"] = record.value(\"updated\").toString().toHtmlEscaped();\n            leak[\"sold\"] = record.value(\"sold\").toInt();\n\n            leakslist.push_back(leak);\n        }\n    }\n\n    jsonResponse[\"data\"] = leakslist;\n    pRequest->sendMessageSuccess(cmd(), jsonResponse);\n}\n\n\/*********************************************\n * This handler will add one new leak\n**********************************************\/\n\nCmdHandlerLeaksAdd::CmdHandlerLeaksAdd()\n    : CmdHandlerBase(\"leaks_add\", \"Method adds a leak\"){\n\n    m_modelCommandAccess.setAccessUnauthorized(false);\n    m_modelCommandAccess.setAccessUser(false);\n    m_modelCommandAccess.setAccessAdmin(true);\n\n    \/\/ validation and description input fields\n    m_vInputs.push_back(CmdInputDef(\"game_uuid\").required().uuid_().description(\"UUID of the game\"));\n    m_vInputs.push_back(CmdInputDef(\"leak_uuid\").required().uuid_().description(\"UUID of the leak\"));\n    m_vInputs.push_back(CmdInputDef(\"name\").required().string_().description(\"Visible part of the content\"));\n    m_vInputs.push_back(CmdInputDef(\"content\").required().string_().description(\"Content of the leak\"));\n    m_vInputs.push_back(CmdInputDef(\"score\").required().integer_().description(\"Price of the leak\"));\n}\n\n\/\/ ---------------------------------------------------------------------\n\nvoid CmdHandlerLeaksAdd::handle(ModelRequest *pRequest){\n    EmployDatabase *pDatabase = findEmploy<EmployDatabase>();\n\n    nlohmann::json jsonRequest = pRequest->jsonRequest();\n\n    \/\/ game_uuid - new leak uuid\n    \/\/ TODO trim\n    std::string sGameUuid = \"\";\n    if(jsonRequest[\"game_uuid\"].is_string()){\n        sGameUuid = jsonRequest[\"game_uuid\"];\n    }\n\n    \/\/ leak_uuid - new leak uuid\n    \/\/ TODO trim\n    std::string sLeakUuid = \"\";\n    if(jsonRequest[\"leak_uuid\"].is_string()){\n        sLeakUuid = jsonRequest[\"leak_uuid\"];\n    }\n\n    \/\/ name\n    \/\/ TODO trim\n    std::string sName = \"\";\n    if(jsonRequest[\"name\"].is_string()){\n        sName = jsonRequest[\"name\"];\n    }\n\n    \/\/ content \n    \/\/ TODO trim\n    std::string sContent = \"\";\n    if(jsonRequest[\"content\"].is_string()){\n        sContent = jsonRequest[\"content\"];\n    }\n\n    \/\/ score\n    int nScore = 0;\n    if(jsonRequest[\"score\"].is_number_integer()){\n        nScore = jsonRequest.at(\"score\");\n    }\n    if(nScore <= 0){\n        \/\/ todo this check move to cmd input def\n        pRequest->sendMessageError(cmd(), Error(400, \"Score must be more then 0\"));\n        return;\n    }\n\n    int nGameId = 0;\n\n    QSqlDatabase db = *(pDatabase->database());\n\n    \/\/ check the game\n    {\n        QSqlQuery query(db);\n        query.prepare(\"SELECT id,uuid FROM games WHERE uuid = :game_uuid\");\n        query.bindValue(\":game_uuid\", QString(sGameUuid.c_str()));\n        if (!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n        if (!query.next()){\n            pRequest->sendMessageError(cmd(), Errors::NotFound(\"Game does not exists with this uuid\"));\n            return;\n        }\n\n        QSqlRecord record = query.record();\n        nGameId = record.value(\"id\").toInt();\n    }\n    \n    \/\/ check the leak (possible raise condition)\n    {\n        QSqlQuery query(db);\n        query.prepare(\"SELECT id FROM leaks WHERE uuid = :leak_uuid\");\n        query.bindValue(\":leak_uuid\", QString(sLeakUuid.c_str()));\n        \/\/ TODO use define ?\n        if (!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n        if (query.next()){\n            pRequest->sendMessageError(cmd(), Error(403, \"Leak already exists with this uuid\"));\n            return;\n        }\n    }\n\n    \/\/ insert new leak\n    {\n        QSqlQuery query(db);\n        query.prepare(\n            \"INSERT INTO leaks( \"\n            \" uuid, gameid, name, \"\n            \" content, score, sold, \"\n            \" created, updated \"\n            \") \"\n            \"VALUES( \"\n            \" :uuid, :gameid, :name,\"\n            \" :content, :score, :sold, \"\n            \" NOW(), NOW()\"\n            \");\");\n        query.bindValue(\":uuid\", QString(sLeakUuid.c_str()));\n        query.bindValue(\":gameid\", nGameId);\n        query.bindValue(\":name\", QString(sName.c_str()));\n        query.bindValue(\":content\", QString(sContent.c_str()));\n        query.bindValue(\":score\", nScore);\n        query.bindValue(\":sold\", 0);\n\n        if (!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n    }\n\n    \/\/ get leak for return\n    nlohmann::json jsonLeak;\n    {\n        QSqlQuery query(db);\n        query.prepare(\"SELECT * FROM leaks WHERE uuid = :leak_uuid\");\n        query.bindValue(\":leak_uuid\", QString(sLeakUuid.c_str()));\n        if (!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n        if (!query.next()){\n            pRequest->sendMessageError(cmd(), Errors::NotFound(\"game with this uuid\"));\n            return;\n        }\n\n        QSqlRecord record = query.record();\n        jsonLeak[\"uuid\"] = record.value(\"uuid\").toString().toStdString();\n        jsonLeak[\"gameid\"] = record.value(\"gameid\").toInt();\n        \/\/ TODO game uuid\n        jsonLeak[\"score\"] = record.value(\"score\").toInt();\n        jsonLeak[\"sold\"] = record.value(\"sold\").toInt();\n        jsonLeak[\"name\"] = record.value(\"name\").toString().toHtmlEscaped().toStdString();\n        jsonLeak[\"content\"] = record.value(\"content\").toString().toHtmlEscaped().toStdString();\n    }\n\n    nlohmann::json jsonResponse;\n    jsonResponse[\"data\"] = jsonLeak;\n    pRequest->sendMessageSuccess(cmd(), jsonResponse);\n}\n\n\/*********************************************\n * This handler will update a leak\n**********************************************\/\n\nCmdHandlerLeaksUpdate::CmdHandlerLeaksUpdate()\n    : CmdHandlerBase(\"leaks_update\", \"Method updates a leak\"){\n\n    m_modelCommandAccess.setAccessUnauthorized(false);\n    m_modelCommandAccess.setAccessUser(false);\n    m_modelCommandAccess.setAccessAdmin(true);\n\n    \/\/ validation and description input fields\n    m_vInputs.push_back(CmdInputDef(\"id\").required().integer_().description(\"Leak id\"));\n    m_vInputs.push_back(CmdInputDef(\"name\").optional().string_().description(\"Visible part of the content\"));\n    m_vInputs.push_back(CmdInputDef(\"content\").optional().string_().description(\"Content of the leak\"));\n    m_vInputs.push_back(CmdInputDef(\"score\").optional().integer_().description(\"Price of the leak\"));\n}\n\n\/\/ ---------------------------------------------------------------------\n\nvoid CmdHandlerLeaksUpdate::handle(ModelRequest *pRequest){\n\n    EmployDatabase *pDatabase = findEmploy<EmployDatabase>();\n\n    QJsonObject jsonRequest = pRequest->data();\n    QJsonObject jsonResponse;\n\n    QSqlDatabase db = *(pDatabase->database());\n\n    int id = jsonRequest[\"id\"].toInt();\n\n    QSqlQuery query(db);\n    {\n        query.prepare(\"SELECT id FROM leaks WHERE id = :id\");\n        query.bindValue(\":id\", id);\n        if (!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n        if (!query.next()){\n            pRequest->sendMessageError(cmd(), Errors::NotFound(\"leak with this id\"));\n            return;\n        }\n    }\n\n    QString sName;\n    if(jsonRequest.contains(\"name\")){\n        sName = jsonRequest.value(\"name\").toString().trimmed().toHtmlEscaped();\n        query.prepare(\"UPDATE leaks SET name=:name WHERE id = :id\");\n        query.bindValue(\":name\", sName);\n        query.bindValue(\":id\", id);\n        if (!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n    }\n\n    QString sContent;\n    if(jsonRequest.contains(\"content\")){\n        sContent = jsonRequest.value(\"content\").toString().trimmed().toHtmlEscaped();\n        query.prepare(\"UPDATE leaks SET content=:content WHERE id = :id\");\n        query.bindValue(\":content\", sContent);\n        query.bindValue(\":id\", id);\n        if (!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n    }\n\n    int nScore;\n    if(jsonRequest.contains(\"score\")){\n        nScore = jsonRequest.value(\"score\").toInt();\n        query.prepare(\"UPDATE leaks SET score=:score WHERE id = :id\");\n        query.bindValue(\":score\", nScore);\n        query.bindValue(\":id\", id);\n        if (!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n    }\n\n    pRequest->sendMessageSuccess(cmd(), jsonResponse);\n}\n\n\/*********************************************\n * This handler will delete a leak\n**********************************************\/\n\nCmdHandlerLeaksDelete::CmdHandlerLeaksDelete()\n    : CmdHandlerBase(\"leaks_delete\", \"Method deletes a leak\"){\n\n    m_modelCommandAccess.setAccessUnauthorized(false);\n    m_modelCommandAccess.setAccessUser(false);\n    m_modelCommandAccess.setAccessAdmin(true);\n\n    \/\/ validation and description input fields\n    m_vInputs.push_back(CmdInputDef(\"id\").required().integer_().description(\"Leak id\"));\n}\n\n\/\/ ---------------------------------------------------------------------\n\nvoid CmdHandlerLeaksDelete::handle(ModelRequest *pRequest){\n\n    EmployDatabase *pDatabase = findEmploy<EmployDatabase>();\n\n    QJsonObject jsonRequest = pRequest->data();\n    QJsonObject jsonResponse;\n\n    QSqlDatabase db = *(pDatabase->database());\n\n    QSqlQuery query(db);\n\n    int id = jsonRequest[\"id\"].toInt();\n    {\n        query.prepare(\"SELECT id FROM leaks WHERE id = :id\");\n        query.bindValue(\":id\", id);\n        if (!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n        if (!query.next()){\n            pRequest->sendMessageError(cmd(), Errors::NotFound(\"leak with this id\"));\n            return;\n        }\n    }\n\n    \/\/deleting from users_leaks\n    {\n        query.prepare(\"DELETE FROM users_leaks WHERE leakid = :id\");\n        query.bindValue(\":id\", id);\n        if(!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n    }\n\n    \/\/deleting from leaks_files\n    {\n        query.prepare(\"DELETE FROM leaks_files WHERE leakid = :id\");\n        query.bindValue(\":id\", id);\n        if(!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n    }\n\n    \/\/deleting from leaks\n    {\n        query.prepare(\"DELETE FROM leaks WHERE id = :id\");\n        query.bindValue(\":id\", id);\n        if(!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n    }\n\n    pRequest->sendMessageSuccess(cmd(), jsonResponse);\n}\n\n\/*********************************************\n * This handler allows you to buy a leak\n**********************************************\/\n\nCmdHandlerLeaksBuy::CmdHandlerLeaksBuy()\n    : CmdHandlerBase(\"leaks_buy\", \"Method buys a leak\"){\n\n    m_modelCommandAccess.setAccessUnauthorized(false);\n    m_modelCommandAccess.setAccessUser(true);\n    m_modelCommandAccess.setAccessAdmin(false);\n\n    \/\/ validation and description input fields\n    m_vInputs.push_back(CmdInputDef(\"id\").required().integer_().description(\"Leak id\"));\n}\n\n\/\/ ---------------------------------------------------------------------\n\nvoid CmdHandlerLeaksBuy::handle(ModelRequest *pRequest){\n\n    EmployDatabase *pDatabase = findEmploy<EmployDatabase>();\n\n    QJsonObject jsonRequest = pRequest->data();\n    QJsonObject jsonResponse;\n\n    QSqlDatabase db = *(pDatabase->database());\n\n    QSqlQuery query(db);\n\n    int id = jsonRequest[\"id\"].toInt();\n    {\n        query.prepare(\"SELECT id FROM leaks WHERE id = :id\");\n        query.bindValue(\":id\", id);\n        if (!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n        if (!query.next()){\n            pRequest->sendMessageError(cmd(), Errors::NotFound(\"leak with this id\"));\n            return;\n        }\n    }\n\n    IUserToken *pUserToken = pRequest->userToken();\n    int nUserID = 0;\n    if(pUserToken != NULL) nUserID = pUserToken->userid();\n\n    int nScore;\n    {\n        query.prepare(\"SELECT score FROM leaks WHERE id = :id\");\n        query.bindValue(\":id\", id);\n        if (!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n        if (!query.next()){\n            pRequest->sendMessageError(cmd(), Errors::NotFound(\"leak with this id\"));\n            return;\n        }\n        else\n        {\n            QSqlRecord record = query.record();\n            nScore = record.value(\"score\").toInt();\n        }\n    }\n\n    \/\/update the user rating\n    {\n        query.prepare(\"UPDATE users SET rating = rating - :score WHERE id = :id\");\n        query.bindValue(\":score\", nScore);\n        query.bindValue(\":id\", nUserID);\n        if (!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n    }\n\n    \/\/attaching a leak to the user\n    query.prepare(\"INSERT INTO users_leaks(\"\n                  \"leakid,\"\n                  \"userid,\"\n                  \"grade,\"\n                  \"dt\"\n                  \")\"\n                  \"VALUES(\"\n                  \":leakid,\"\n                  \":userid,\"\n                  \":grade,\"\n                  \"NOW()\"\n                  \")\");\n    query.bindValue(\":leakid\", id);\n    query.bindValue(\":userid\", nUserID);\n    query.bindValue(\":grade\", -1);\n    if (!query.exec()){\n        pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n        return;\n    }\n\n    \/\/increment of the number of leaks sold\n    {\n        query.prepare(\"UPDATE leaks SET sold = sold + 1 WHERE id = :id\");\n        query.bindValue(\":id\", id);\n        if (!query.exec()){\n            pRequest->sendMessageError(cmd(), Error(500, query.lastError().text()));\n            return;\n        }\n    }\n\n    pRequest->sendMessageSuccess(cmd(), jsonResponse);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <cstdlib>\n#include <string>\n\n#include <unistd.h>\n\n#include \"benchmark\/benchmark.h\"\n\nstatic int runTutorial(const std::string& dir, const std::string& filename) {\n  if (getenv(\"ROOTSYS\") == nullptr) {\n    std::cerr << \"Couldn't find ROOTSYS environment variable!\\n\";\n    exit(1);\n  }\n  std::string rootsys = getenv(\"ROOTSYS\");\n  std::string fullpath = rootsys + \"\/\" + dir + \"\/\" + filename;\n  std::string rootInvocation = \"root.exe -l -q -b -n -x \\\"\" + fullpath + \"\\\" -e return \";\n  return std::system(rootInvocation.c_str());\n}\n\nstatic void TestTutorial(benchmark::State &state, const char *dir, const char *tutorial) {\n   while (state.KeepRunning())\n      runTutorial(dir, tutorial);\n}\n\nBENCHMARK_CAPTURE(TestTutorial, Test_hsimple, \"tutorials\/\", \"hsimple.C\")->Unit(benchmark::kMicrosecond);\nBENCHMARK_CAPTURE(TestTutorial, Test_hsimple, \"tutorials\/\", \"tmva\/TMVAGAexample.C\")->Unit(benchmark::kMicrosecond);\nBENCHMARK_CAPTURE(TestTutorial, Test_hsimple, \"tutorials\/\", \"tree\/hvector.C\")->Unit(benchmark::kMicrosecond);\nBENCHMARK_CAPTURE(TestTutorial, Test_hsimple, \"tutorials\/\", \"matrix\/invertMatrix.C\")->Unit(benchmark::kMicrosecond);\nBENCHMARK_CAPTURE(TestTutorial, Test_hsimple, \"tutorials\/\", \"math\/normalDist.C\")->Unit(benchmark::kMicrosecond);\nBENCHMARK_CAPTURE(TestTutorial, Test_hsimple, \"tutorials\/\", \"fit\/fitLinear.C\")->Unit(benchmark::kMicrosecond);\n\nBENCHMARK_MAIN();\n<commit_msg>Fixing naming of benchmarks for interpreter<commit_after>#include <iostream>\n#include <cstdlib>\n#include <string>\n\n#include <unistd.h>\n\n#include \"benchmark\/benchmark.h\"\n\nstatic int runTutorial(const std::string& dir, const std::string& filename) {\n  if (getenv(\"ROOTSYS\") == nullptr) {\n    std::cerr << \"Couldn't find ROOTSYS environment variable!\\n\";\n    exit(1);\n  }\n  std::string rootsys = getenv(\"ROOTSYS\");\n  std::string fullpath = rootsys + \"\/\" + dir + \"\/\" + filename;\n  std::string rootInvocation = \"root.exe -l -q -b -n -x \\\"\" + fullpath + \"\\\" -e return \";\n  return std::system(rootInvocation.c_str());\n}\n\nstatic void TestTutorial(benchmark::State &state, const char *dir, const char *tutorial) {\n   while (state.KeepRunning())\n      runTutorial(dir, tutorial);\n}\n\nBENCHMARK_CAPTURE(TestTutorial, Test_hsimple, \"tutorials\/\", \"hsimple.C\")->Unit(benchmark::kMicrosecond);\nBENCHMARK_CAPTURE(TestTutorial, Test_TMVAGAexample, \"tutorials\/\", \"tmva\/TMVAGAexample.C\")->Unit(benchmark::kMicrosecond);\nBENCHMARK_CAPTURE(TestTutorial, Test_hvector, \"tutorials\/\", \"tree\/hvector.C\")->Unit(benchmark::kMicrosecond);\nBENCHMARK_CAPTURE(TestTutorial, Test_hinvertMatrix, \"tutorials\/\", \"matrix\/invertMatrix.C\")->Unit(benchmark::kMicrosecond);\nBENCHMARK_CAPTURE(TestTutorial, Test_invertMatrix, \"tutorials\/\", \"math\/invertMatrix.C\")->Unit(benchmark::kMicrosecond);\nBENCHMARK_CAPTURE(TestTutorial, Test_fitLinear, \"tutorials\/\", \"fit\/fitLinear.C\")->Unit(benchmark::kMicrosecond);\n\nBENCHMARK_MAIN();\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\nCopyright (c) 2015, Project OSRM contributors\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#ifndef MAP_MATCHING_HPP\n#define MAP_MATCHING_HPP\n\n#include \"routing_base.hpp\"\n\n#include \"..\/algorithms\/coordinate_calculation.hpp\"\n#include \"..\/data_structures\/hidden_markov_model.hpp\"\n#include \"..\/util\/json_logger.hpp\"\n#include \"..\/util\/matching_debug_info.hpp\"\n\n#include <cstddef>\n\n#include <algorithm>\n#include <deque>\n#include <iomanip>\n#include <numeric>\n#include <utility>\n#include <vector>\n\nnamespace osrm\n{\nnamespace matching\n{\n\nstruct SubMatching\n{\n    std::vector<PhantomNode> nodes;\n    std::vector<unsigned> indices;\n    double length;\n    double confidence;\n};\n\nusing CandidateList = std::vector<PhantomNodeWithDistance>;\nusing CandidateLists = std::vector<CandidateList>;\nusing HMM = HiddenMarkovModel<CandidateLists>;\nusing SubMatchingList = std::vector<SubMatching>;\n\nconstexpr static const unsigned MAX_BROKEN_STATES = 10;\n\nconstexpr static const double MAX_SPEED = 180 \/ 3.6; \/\/ 180km -> m\/s\nconstexpr static const unsigned SUSPICIOUS_DISTANCE_DELTA = 100;\n}\n}\n\n\/\/ implements a hidden markov model map matching algorithm\ntemplate <class DataFacadeT>\nclass MapMatching final : public BasicRoutingInterface<DataFacadeT, MapMatching<DataFacadeT>>\n{\n    using super = BasicRoutingInterface<DataFacadeT, MapMatching<DataFacadeT>>;\n    using QueryHeap = SearchEngineData::QueryHeap;\n    SearchEngineData &engine_working_data;\n\n    unsigned GetMedianSampleTime(const std::vector<unsigned>& timestamps) const\n    {\n        BOOST_ASSERT(timestamps.size() > 1);\n\n        std::vector<unsigned> sample_times(timestamps.size());\n\n        std::adjacent_difference(timestamps.begin(), timestamps.end(), sample_times.begin());\n\n        \/\/ don't use first element of sample_times -> will not be a difference.\n        auto first_elem = std::next(sample_times.begin());\n        auto median = first_elem + std::distance(first_elem, sample_times.end())\/2;\n        std::nth_element(first_elem, median, sample_times.end());\n        return *median;\n    }\n\n  public:\n    MapMatching(DataFacadeT *facade, SearchEngineData &engine_working_data)\n        : super(facade), engine_working_data(engine_working_data)\n    {\n    }\n\n    void operator()(const osrm::matching::CandidateLists &candidates_list,\n                    const std::vector<FixedPointCoordinate> &trace_coordinates,\n                    const std::vector<unsigned> &trace_timestamps,\n                    const double matching_beta,\n                    const double gps_precision,\n                    osrm::matching::SubMatchingList &sub_matchings) const\n    {\n        BOOST_ASSERT(candidates_list.size() == trace_coordinates.size());\n\n        const auto median_sample_time = [&]() {\n            if (trace_timestamps.size() > 1)\n            {\n                return GetMedianSampleTime(trace_timestamps);\n            }\n            else\n            {\n                return 0u;\n            }\n        }();\n        const auto max_broken_time = median_sample_time * osrm::matching::MAX_BROKEN_STATES;\n        const auto max_distance_delta = [&]() {\n            if (trace_timestamps.size() > 1)\n            {\n                return median_sample_time * osrm::matching::MAX_SPEED;\n            }\n            else\n            {\n                return std::numeric_limits<double>::max();\n            }\n        }();\n\n        \/\/ TODO replace default values with table lookup based on sampling frequency\n        EmissionLogProbability emission_log_probability(gps_precision);\n        TransitionLogProbability transition_log_probability(matching_beta);\n\n        osrm::matching::HMM model(candidates_list, emission_log_probability);\n\n        std::size_t initial_timestamp = model.initialize(0);\n        if (initial_timestamp == osrm::matching::INVALID_STATE)\n        {\n            return;\n        }\n\n        MatchingDebugInfo matching_debug(osrm::json::Logger::get());\n        matching_debug.initialize(candidates_list);\n\n        engine_working_data.InitializeOrClearFirstThreadLocalStorage(\n            super::facade->GetNumberOfNodes());\n\n        QueryHeap &forward_heap = *(engine_working_data.forward_heap_1);\n        QueryHeap &reverse_heap = *(engine_working_data.reverse_heap_1);\n\n        std::size_t breakage_begin = osrm::matching::INVALID_STATE;\n        std::vector<std::size_t> split_points;\n        std::vector<std::size_t> prev_unbroken_timestamps;\n        prev_unbroken_timestamps.reserve(candidates_list.size());\n        prev_unbroken_timestamps.push_back(initial_timestamp);\n        for (auto t = initial_timestamp + 1; t < candidates_list.size(); ++t)\n        {\n            \/\/ breakage recover has removed all previous good points\n            bool trace_split = prev_unbroken_timestamps.empty();\n\n            \/\/ use temporal information if available to determine a split\n            if (!trace_timestamps.empty())\n            {\n                trace_split =\n                    trace_split ||\n                    (trace_timestamps[t] - trace_timestamps[prev_unbroken_timestamps.back()] >\n                     max_broken_time);\n            }\n            else\n            {\n                trace_split = trace_split || (t - prev_unbroken_timestamps.back() >\n                                              osrm::matching::MAX_BROKEN_STATES);\n            }\n\n            if (trace_split)\n            {\n                std::size_t split_index = t;\n                if (breakage_begin != osrm::matching::INVALID_STATE)\n                {\n                    split_index = breakage_begin;\n                    breakage_begin = osrm::matching::INVALID_STATE;\n                }\n                split_points.push_back(split_index);\n\n                \/\/ note: this preserves everything before split_index\n                model.clear(split_index);\n                std::size_t new_start = model.initialize(split_index);\n                \/\/ no new start was found -> stop viterbi calculation\n                if (new_start == osrm::matching::INVALID_STATE)\n                {\n                    break;\n                }\n\n                prev_unbroken_timestamps.clear();\n                prev_unbroken_timestamps.push_back(new_start);\n                \/\/ Important: We potentially go back here!\n                \/\/ However since t > new_start >= breakge_begin\n                \/\/ we can only reset trace_coordindates.size() times.\n                t = new_start + 1;\n            }\n\n            BOOST_ASSERT(!prev_unbroken_timestamps.empty());\n            const std::size_t prev_unbroken_timestamp = prev_unbroken_timestamps.back();\n\n            const auto &prev_viterbi = model.viterbi[prev_unbroken_timestamp];\n            const auto &prev_pruned = model.pruned[prev_unbroken_timestamp];\n            const auto &prev_unbroken_timestamps_list = candidates_list[prev_unbroken_timestamp];\n            const auto &prev_coordinate = trace_coordinates[prev_unbroken_timestamp];\n\n            auto &current_viterbi = model.viterbi[t];\n            auto &current_pruned = model.pruned[t];\n            auto &current_suspicious = model.suspicious[t];\n            auto &current_parents = model.parents[t];\n            auto &current_lengths = model.path_lengths[t];\n            const auto &current_timestamps_list = candidates_list[t];\n            const auto &current_coordinate = trace_coordinates[t];\n\n            const auto haversine_distance = coordinate_calculation::haversine_distance(prev_coordinate, current_coordinate);\n\n            \/\/ compute d_t for this timestamp and the next one\n            for (const auto s : osrm::irange<std::size_t>(0u, prev_viterbi.size()))\n            {\n                if (prev_pruned[s])\n                {\n                    continue;\n                }\n\n                for (const auto s_prime : osrm::irange<std::size_t>(0u, current_viterbi.size()))\n                {\n                    \/\/ how likely is candidate s_prime at time t to be emitted?\n                    \/\/ FIXME this can be pre-computed\n                    const double emission_pr =\n                        emission_log_probability(candidates_list[t][s_prime].distance);\n                    double new_value = prev_viterbi[s] + emission_pr;\n                    if (current_viterbi[s_prime] > new_value)\n                    {\n                        continue;\n                    }\n\n                    forward_heap.Clear();\n                    reverse_heap.Clear();\n\n                    \/\/ get distance diff between loc1\/2 and locs\/s_prime\n                    const auto network_distance = super::get_network_distance(\n                        forward_heap, reverse_heap, prev_unbroken_timestamps_list[s].phantom_node,\n                        current_timestamps_list[s_prime].phantom_node);\n\n                    const auto d_t = std::abs(network_distance - haversine_distance);\n\n                    \/\/ very low probability transition -> prune\n                    if (d_t >= max_distance_delta)\n                    {\n                        continue;\n                    }\n\n                    const double transition_pr = transition_log_probability(d_t);\n                    new_value += transition_pr;\n\n                    matching_debug.add_transition_info(prev_unbroken_timestamp, t, s, s_prime,\n                                                       prev_viterbi[s], emission_pr, transition_pr,\n                                                       network_distance, haversine_distance);\n\n                    if (new_value > current_viterbi[s_prime])\n                    {\n                        current_viterbi[s_prime] = new_value;\n                        current_parents[s_prime] = std::make_pair(prev_unbroken_timestamp, s);\n                        current_lengths[s_prime] = network_distance;\n                        current_pruned[s_prime] = false;\n                        current_suspicious[s_prime] = d_t > osrm::matching::SUSPICIOUS_DISTANCE_DELTA;\n                        model.breakage[t] = false;\n                    }\n                }\n            }\n\n            if (model.breakage[t])\n            {\n                \/\/ save start of breakage -> we need this as split point\n                if (t < breakage_begin)\n                {\n                    breakage_begin = t;\n                }\n\n                BOOST_ASSERT(prev_unbroken_timestamps.size() > 0);\n                \/\/ remove both ends of the breakage\n                prev_unbroken_timestamps.pop_back();\n            }\n            else\n            {\n                prev_unbroken_timestamps.push_back(t);\n            }\n        }\n\n        matching_debug.set_viterbi(model.viterbi, model.pruned, model.suspicious);\n\n        if (!prev_unbroken_timestamps.empty())\n        {\n            split_points.push_back(prev_unbroken_timestamps.back() + 1);\n        }\n\n        std::size_t sub_matching_begin = initial_timestamp;\n        for (const auto sub_matching_end : split_points)\n        {\n            osrm::matching::SubMatching matching;\n\n            std::size_t parent_timestamp_index = sub_matching_end - 1;\n            while (parent_timestamp_index >= sub_matching_begin &&\n                   model.breakage[parent_timestamp_index])\n            {\n                --parent_timestamp_index;\n            }\n            while (sub_matching_begin < sub_matching_end &&\n                   model.breakage[sub_matching_begin])\n            {\n                ++sub_matching_begin;\n            }\n\n            \/\/ matchings that only consist of one candidate are invalid\n            if (parent_timestamp_index - sub_matching_begin + 1 < 2)\n            {\n                sub_matching_begin = sub_matching_end;\n                continue;\n            }\n\n            \/\/ loop through the columns, and only compare the last entry\n            const auto max_element_iter =\n                std::max_element(model.viterbi[parent_timestamp_index].begin(),\n                                 model.viterbi[parent_timestamp_index].end());\n\n            std::size_t parent_candidate_index =\n                std::distance(model.viterbi[parent_timestamp_index].begin(), max_element_iter);\n\n            std::deque<std::pair<std::size_t, std::size_t>> reconstructed_indices;\n            while (parent_timestamp_index > sub_matching_begin)\n            {\n                if (model.breakage[parent_timestamp_index])\n                {\n                    continue;\n                }\n\n                reconstructed_indices.emplace_front(parent_timestamp_index, parent_candidate_index);\n                const auto &next = model.parents[parent_timestamp_index][parent_candidate_index];\n                \/\/ make sure we can never get stuck in this loop\n                if (parent_timestamp_index == next.first)\n                {\n                    break;\n                }\n                parent_timestamp_index = next.first;\n                parent_candidate_index = next.second;\n            }\n            reconstructed_indices.emplace_front(parent_timestamp_index, parent_candidate_index);\n            if (reconstructed_indices.size() < 2)\n            {\n                sub_matching_begin = sub_matching_end;\n                continue;\n            }\n\n            matching.length = 0.0f;\n            matching.nodes.resize(reconstructed_indices.size());\n            matching.indices.resize(reconstructed_indices.size());\n            for (const auto i : osrm::irange<std::size_t>(0u, reconstructed_indices.size()))\n            {\n                const auto timestamp_index = reconstructed_indices[i].first;\n                const auto location_index = reconstructed_indices[i].second;\n\n                matching.indices[i] = timestamp_index;\n                matching.nodes[i] = candidates_list[timestamp_index][location_index].phantom_node;\n                matching.length += model.path_lengths[timestamp_index][location_index];\n\n                matching_debug.add_chosen(timestamp_index, location_index);\n            }\n\n            sub_matchings.push_back(matching);\n            sub_matching_begin = sub_matching_end;\n        }\n        matching_debug.add_breakage(model.breakage);\n    }\n};\n\n\/\/[1] \"Hidden Markov Map Matching Through Noise and Sparseness\"; P. Newson and J. Krumm; 2009; ACM\n\/\/ GIS\n\n#endif \/* MAP_MATCHING_HPP *\/\n<commit_msg>Fix min average sample time<commit_after>\/*\n\nCopyright (c) 2015, Project OSRM contributors\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#ifndef MAP_MATCHING_HPP\n#define MAP_MATCHING_HPP\n\n#include \"routing_base.hpp\"\n\n#include \"..\/algorithms\/coordinate_calculation.hpp\"\n#include \"..\/data_structures\/hidden_markov_model.hpp\"\n#include \"..\/util\/json_logger.hpp\"\n#include \"..\/util\/matching_debug_info.hpp\"\n\n#include <cstddef>\n\n#include <algorithm>\n#include <deque>\n#include <iomanip>\n#include <numeric>\n#include <utility>\n#include <vector>\n\nnamespace osrm\n{\nnamespace matching\n{\n\nstruct SubMatching\n{\n    std::vector<PhantomNode> nodes;\n    std::vector<unsigned> indices;\n    double length;\n    double confidence;\n};\n\nusing CandidateList = std::vector<PhantomNodeWithDistance>;\nusing CandidateLists = std::vector<CandidateList>;\nusing HMM = HiddenMarkovModel<CandidateLists>;\nusing SubMatchingList = std::vector<SubMatching>;\n\nconstexpr static const unsigned MAX_BROKEN_STATES = 10;\n\nconstexpr static const double MAX_SPEED = 180 \/ 3.6; \/\/ 180km -> m\/s\nconstexpr static const unsigned SUSPICIOUS_DISTANCE_DELTA = 100;\n}\n}\n\n\/\/ implements a hidden markov model map matching algorithm\ntemplate <class DataFacadeT>\nclass MapMatching final : public BasicRoutingInterface<DataFacadeT, MapMatching<DataFacadeT>>\n{\n    using super = BasicRoutingInterface<DataFacadeT, MapMatching<DataFacadeT>>;\n    using QueryHeap = SearchEngineData::QueryHeap;\n    SearchEngineData &engine_working_data;\n\n    unsigned GetMedianSampleTime(const std::vector<unsigned>& timestamps) const\n    {\n        BOOST_ASSERT(timestamps.size() > 1);\n\n        std::vector<unsigned> sample_times(timestamps.size());\n\n        std::adjacent_difference(timestamps.begin(), timestamps.end(), sample_times.begin());\n\n        \/\/ don't use first element of sample_times -> will not be a difference.\n        auto first_elem = std::next(sample_times.begin());\n        auto median = first_elem + std::distance(first_elem, sample_times.end())\/2;\n        std::nth_element(first_elem, median, sample_times.end());\n        return *median;\n    }\n\n  public:\n    MapMatching(DataFacadeT *facade, SearchEngineData &engine_working_data)\n        : super(facade), engine_working_data(engine_working_data)\n    {\n    }\n\n    void operator()(const osrm::matching::CandidateLists &candidates_list,\n                    const std::vector<FixedPointCoordinate> &trace_coordinates,\n                    const std::vector<unsigned> &trace_timestamps,\n                    const double matching_beta,\n                    const double gps_precision,\n                    osrm::matching::SubMatchingList &sub_matchings) const\n    {\n        BOOST_ASSERT(candidates_list.size() == trace_coordinates.size());\n        BOOST_ASSERT(candidates_list.size() > 1);\n\n        const bool use_timestamps = trace_timestamps.size() > 1;\n\n        const auto median_sample_time = [&]() {\n            if (use_timestamps)\n            {\n                return std::max(1u, GetMedianSampleTime(trace_timestamps));\n            }\n            else\n            {\n                return 1u;\n            }\n        }();\n        const auto max_broken_time = median_sample_time * osrm::matching::MAX_BROKEN_STATES;\n        const auto max_distance_delta = [&]() {\n            if (use_timestamps)\n            {\n                return median_sample_time * osrm::matching::MAX_SPEED;\n            }\n            else\n            {\n                return std::numeric_limits<double>::max();\n            }\n        }();\n\n        \/\/ TODO replace default values with table lookup based on sampling frequency\n        EmissionLogProbability emission_log_probability(gps_precision);\n        TransitionLogProbability transition_log_probability(matching_beta);\n\n        osrm::matching::HMM model(candidates_list, emission_log_probability);\n\n        std::size_t initial_timestamp = model.initialize(0);\n        if (initial_timestamp == osrm::matching::INVALID_STATE)\n        {\n            return;\n        }\n\n        MatchingDebugInfo matching_debug(osrm::json::Logger::get());\n        matching_debug.initialize(candidates_list);\n\n        engine_working_data.InitializeOrClearFirstThreadLocalStorage(\n            super::facade->GetNumberOfNodes());\n\n        QueryHeap &forward_heap = *(engine_working_data.forward_heap_1);\n        QueryHeap &reverse_heap = *(engine_working_data.reverse_heap_1);\n\n        std::size_t breakage_begin = osrm::matching::INVALID_STATE;\n        std::vector<std::size_t> split_points;\n        std::vector<std::size_t> prev_unbroken_timestamps;\n        prev_unbroken_timestamps.reserve(candidates_list.size());\n        prev_unbroken_timestamps.push_back(initial_timestamp);\n        for (auto t = initial_timestamp + 1; t < candidates_list.size(); ++t)\n        {\n            \/\/ breakage recover has removed all previous good points\n            bool trace_split = prev_unbroken_timestamps.empty();\n\n            \/\/ use temporal information if available to determine a split\n            if (use_timestamps)\n            {\n                trace_split =\n                    trace_split ||\n                    (trace_timestamps[t] - trace_timestamps[prev_unbroken_timestamps.back()] >\n                     max_broken_time);\n            }\n            else\n            {\n                trace_split = trace_split || (t - prev_unbroken_timestamps.back() >\n                                              osrm::matching::MAX_BROKEN_STATES);\n            }\n\n            if (trace_split)\n            {\n                std::size_t split_index = t;\n                if (breakage_begin != osrm::matching::INVALID_STATE)\n                {\n                    split_index = breakage_begin;\n                    breakage_begin = osrm::matching::INVALID_STATE;\n                }\n                split_points.push_back(split_index);\n\n                \/\/ note: this preserves everything before split_index\n                model.clear(split_index);\n                std::size_t new_start = model.initialize(split_index);\n                \/\/ no new start was found -> stop viterbi calculation\n                if (new_start == osrm::matching::INVALID_STATE)\n                {\n                    break;\n                }\n\n                prev_unbroken_timestamps.clear();\n                prev_unbroken_timestamps.push_back(new_start);\n                \/\/ Important: We potentially go back here!\n                \/\/ However since t > new_start >= breakge_begin\n                \/\/ we can only reset trace_coordindates.size() times.\n                t = new_start + 1;\n            }\n\n            BOOST_ASSERT(!prev_unbroken_timestamps.empty());\n            const std::size_t prev_unbroken_timestamp = prev_unbroken_timestamps.back();\n\n            const auto &prev_viterbi = model.viterbi[prev_unbroken_timestamp];\n            const auto &prev_pruned = model.pruned[prev_unbroken_timestamp];\n            const auto &prev_unbroken_timestamps_list = candidates_list[prev_unbroken_timestamp];\n            const auto &prev_coordinate = trace_coordinates[prev_unbroken_timestamp];\n\n            auto &current_viterbi = model.viterbi[t];\n            auto &current_pruned = model.pruned[t];\n            auto &current_suspicious = model.suspicious[t];\n            auto &current_parents = model.parents[t];\n            auto &current_lengths = model.path_lengths[t];\n            const auto &current_timestamps_list = candidates_list[t];\n            const auto &current_coordinate = trace_coordinates[t];\n\n            const auto haversine_distance = coordinate_calculation::haversine_distance(prev_coordinate, current_coordinate);\n\n            \/\/ compute d_t for this timestamp and the next one\n            for (const auto s : osrm::irange<std::size_t>(0u, prev_viterbi.size()))\n            {\n                if (prev_pruned[s])\n                {\n                    continue;\n                }\n\n                for (const auto s_prime : osrm::irange<std::size_t>(0u, current_viterbi.size()))\n                {\n                    \/\/ how likely is candidate s_prime at time t to be emitted?\n                    \/\/ FIXME this can be pre-computed\n                    const double emission_pr =\n                        emission_log_probability(candidates_list[t][s_prime].distance);\n                    double new_value = prev_viterbi[s] + emission_pr;\n                    if (current_viterbi[s_prime] > new_value)\n                    {\n                        continue;\n                    }\n\n                    forward_heap.Clear();\n                    reverse_heap.Clear();\n\n                    \/\/ get distance diff between loc1\/2 and locs\/s_prime\n                    const auto network_distance = super::get_network_distance(\n                        forward_heap, reverse_heap, prev_unbroken_timestamps_list[s].phantom_node,\n                        current_timestamps_list[s_prime].phantom_node);\n\n                    const auto d_t = std::abs(network_distance - haversine_distance);\n\n                    \/\/ very low probability transition -> prune\n                    if (d_t >= max_distance_delta)\n                    {\n                        continue;\n                    }\n\n                    const double transition_pr = transition_log_probability(d_t);\n                    new_value += transition_pr;\n\n                    matching_debug.add_transition_info(prev_unbroken_timestamp, t, s, s_prime,\n                                                       prev_viterbi[s], emission_pr, transition_pr,\n                                                       network_distance, haversine_distance);\n\n                    if (new_value > current_viterbi[s_prime])\n                    {\n                        current_viterbi[s_prime] = new_value;\n                        current_parents[s_prime] = std::make_pair(prev_unbroken_timestamp, s);\n                        current_lengths[s_prime] = network_distance;\n                        current_pruned[s_prime] = false;\n                        current_suspicious[s_prime] = d_t > osrm::matching::SUSPICIOUS_DISTANCE_DELTA;\n                        model.breakage[t] = false;\n                    }\n                }\n            }\n\n            if (model.breakage[t])\n            {\n                \/\/ save start of breakage -> we need this as split point\n                if (t < breakage_begin)\n                {\n                    breakage_begin = t;\n                }\n\n                BOOST_ASSERT(prev_unbroken_timestamps.size() > 0);\n                \/\/ remove both ends of the breakage\n                prev_unbroken_timestamps.pop_back();\n            }\n            else\n            {\n                prev_unbroken_timestamps.push_back(t);\n            }\n        }\n\n        matching_debug.set_viterbi(model.viterbi, model.pruned, model.suspicious);\n\n        if (!prev_unbroken_timestamps.empty())\n        {\n            split_points.push_back(prev_unbroken_timestamps.back() + 1);\n        }\n\n        std::size_t sub_matching_begin = initial_timestamp;\n        for (const auto sub_matching_end : split_points)\n        {\n            osrm::matching::SubMatching matching;\n\n            std::size_t parent_timestamp_index = sub_matching_end - 1;\n            while (parent_timestamp_index >= sub_matching_begin &&\n                   model.breakage[parent_timestamp_index])\n            {\n                --parent_timestamp_index;\n            }\n            while (sub_matching_begin < sub_matching_end &&\n                   model.breakage[sub_matching_begin])\n            {\n                ++sub_matching_begin;\n            }\n\n            \/\/ matchings that only consist of one candidate are invalid\n            if (parent_timestamp_index - sub_matching_begin + 1 < 2)\n            {\n                sub_matching_begin = sub_matching_end;\n                continue;\n            }\n\n            \/\/ loop through the columns, and only compare the last entry\n            const auto max_element_iter =\n                std::max_element(model.viterbi[parent_timestamp_index].begin(),\n                                 model.viterbi[parent_timestamp_index].end());\n\n            std::size_t parent_candidate_index =\n                std::distance(model.viterbi[parent_timestamp_index].begin(), max_element_iter);\n\n            std::deque<std::pair<std::size_t, std::size_t>> reconstructed_indices;\n            while (parent_timestamp_index > sub_matching_begin)\n            {\n                if (model.breakage[parent_timestamp_index])\n                {\n                    continue;\n                }\n\n                reconstructed_indices.emplace_front(parent_timestamp_index, parent_candidate_index);\n                const auto &next = model.parents[parent_timestamp_index][parent_candidate_index];\n                \/\/ make sure we can never get stuck in this loop\n                if (parent_timestamp_index == next.first)\n                {\n                    break;\n                }\n                parent_timestamp_index = next.first;\n                parent_candidate_index = next.second;\n            }\n            reconstructed_indices.emplace_front(parent_timestamp_index, parent_candidate_index);\n            if (reconstructed_indices.size() < 2)\n            {\n                sub_matching_begin = sub_matching_end;\n                continue;\n            }\n\n            matching.length = 0.0f;\n            matching.nodes.resize(reconstructed_indices.size());\n            matching.indices.resize(reconstructed_indices.size());\n            for (const auto i : osrm::irange<std::size_t>(0u, reconstructed_indices.size()))\n            {\n                const auto timestamp_index = reconstructed_indices[i].first;\n                const auto location_index = reconstructed_indices[i].second;\n\n                matching.indices[i] = timestamp_index;\n                matching.nodes[i] = candidates_list[timestamp_index][location_index].phantom_node;\n                matching.length += model.path_lengths[timestamp_index][location_index];\n\n                matching_debug.add_chosen(timestamp_index, location_index);\n            }\n\n            sub_matchings.push_back(matching);\n            sub_matching_begin = sub_matching_end;\n        }\n        matching_debug.add_breakage(model.breakage);\n    }\n};\n\n\/\/[1] \"Hidden Markov Map Matching Through Noise and Sparseness\"; P. Newson and J. Krumm; 2009; ACM\n\/\/ GIS\n\n#endif \/* MAP_MATCHING_HPP *\/\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2010-2011 Dmitry Marakasov\n *\n * This file is part of glosm.\n *\n * glosm is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * glosm is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with glosm.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include <glosm\/TileManager.hh>\n\n#if defined(__APPLE__)\n#\tinclude <OpenGL\/gl.h>\n#else\n#\tinclude <GL\/gl.h>\n#endif\n\n#include <glosm\/Viewer.hh>\n#include <glosm\/Geometry.hh>\n#include <glosm\/GeometryDatasource.hh>\n#include <glosm\/Tile.hh>\n\n#include <stdexcept>\n#include <cassert>\n\nTileManager::TileId::TileId(int lev, int xx, int yy) : level(lev), x(xx), y(yy) {\n}\n\nbool TileManager::TileId::operator<(const TileId& other) const {\n\tif (level < other.level) return true;\n\tif (level > other.level) return false;\n\tif (x < other.x) return true;\n\tif (x > other.x) return false;\n\treturn y < other.y;\n}\n\nTileManager::TileData::TileData(): tile(NULL), geometry(NULL), generation(0), loading(false) {\n}\n\nTileManager::TileData::~TileData() {\n\tdelete tile;\n\tdelete geometry;\n}\n\nTileManager::TileManager(const Projection projection, const GeometryDatasource& ds): projection_(projection), datasource_(ds) {\n\tif (pthread_mutex_init(&tiles_mutex_, 0) != 0)\n\t\tthrow std::runtime_error(\"pthread_mutex_init failed\");\n\n\tif (pthread_cond_init(&tiles_cond_, 0) != 0) {\n\t\tpthread_mutex_destroy(&tiles_mutex_);\n\t\tthrow std::runtime_error(\"pthread_cond_init failed\");\n\t}\n\n\tif (pthread_create(&loading_thread_, NULL, LoadingThreadFuncWrapper, (void*)this) != 0) {\n\t\tpthread_cond_destroy(&tiles_cond_);\n\t\tpthread_mutex_destroy(&tiles_mutex_);\n\t\tthrow std::runtime_error(\"pthread_create failed\");\n\t}\n\n\ttarget_level_ = 10;\n\tgeneration_ = 0;\n\tthread_die_flag_ = false;\n}\n\nTileManager::~TileManager() {\n\tthread_die_flag_ = true;\n\tpthread_cond_signal(&tiles_cond_);\n\n\tpthread_join(loading_thread_, NULL);\n\tpthread_cond_destroy(&tiles_cond_);\n\tpthread_mutex_destroy(&tiles_mutex_);\n}\n\n\/*\n * recursive quadtree processing\n *\/\n\nvoid TileManager::LoadTiles(const BBoxi& bbox, bool sync, int level, int x, int y) {\n\tif (level == target_level_) {\n\t\tTilesMap::iterator thistile = tiles_.find(TileId(level, x, y));\n\t\tif (thistile == tiles_.end()) {\n\t\t\tstd::pair<TilesMap::iterator, bool> pair = tiles_.insert(std::make_pair(TileId(level, x, y), TileData()));\n\t\t\tassert(pair.second);\n\t\t\tthistile = pair.first;\n\t\t}\n\n\t\t\/* update generation *\/\n\t\tthistile->second.generation = generation_;\n\n\t\t\/* already loaded or loading, skip *\/\n\t\tif (thistile->second.tile || thistile->second.loading)\n\t\t\treturn;\n\n\t\t\/* geometry loaded by thread, turn into tile *\/\n\t\tif (thistile->second.geometry) {\n\t\t\t\/* XXX: projection and VBO loading still\n\t\t\t * takes some time, maybe we need to limit\n\t\t\t * this per-frame *\/\n\t\t\tthistile->second.tile = SpawnTile(*thistile->second.geometry);\n\t\t\tdelete thistile->second.geometry;\n\t\t\tthistile->second.geometry = NULL;\n\t\t\treturn;\n\t\t}\n\n\t\t\/* load immediately for sync case *\/\n\t\tif (sync) {\n\t\t\tBBoxi bbox = BBoxi::ForGeoTile(level, x, y);\n\t\t\tGeometry geom(bbox);\n\t\t\tdatasource_.GetGeometry(geom, bbox);\n\t\t\tthistile->second.tile = SpawnTile(geom);\n\t\t\treturn;\n\t\t}\n\n\t\t\/* in other case, it will be loaded by thread *\/\n\t\tpthread_cond_signal(&tiles_cond_);\n\t\treturn;\n\t}\n\n\t\/* children *\/\n\tfor (int d = 0; d < 4; ++d) {\n\t\tint xx = x * 2 + d % 2;\n\t\tint yy = y * 2 + d \/ 2;\n\t\tif (BBoxi::ForGeoTile(level + 1, xx, yy).Intersects(bbox)) {\n\t\t\tLoadTiles(bbox, sync, level + 1, xx, yy);\n\t\t}\n\t}\n}\n\n\/*\n * loading queue - related\n *\/\n\nvoid TileManager::LoadingThreadFunc() {\n\twhile (!thread_die_flag_) {\n\t\tpthread_mutex_lock(&tiles_mutex_);\n\n\t\tTilesMap::iterator to_load = tiles_.end();\n\t\tfor (TilesMap::iterator i = tiles_.begin(); i != tiles_.end(); ++i) {\n\t\t\tif (!i->second.loading && !i->second.tile && !i->second.geometry) {\n\t\t\t\tto_load = i;\n\t\t\t\ti->second.loading = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\t\/* found nothing, sleep *\/\n\t\tif (to_load == tiles_.end()) {\n\t\t\tpthread_cond_wait(&tiles_cond_, &tiles_mutex_);\n\t\t\tpthread_mutex_unlock(&tiles_mutex_);\n\t\t\tcontinue;\n\t\t}\n\n\t\tpthread_mutex_unlock(&tiles_mutex_);\n\n\t\t\/* load tile *\/\n\t\tBBoxi bbox = BBoxi::ForGeoTile(to_load->first.level, to_load->first.x, to_load->first.y);\n\t\tto_load->second.geometry = new Geometry(bbox);\n\t\tdatasource_.GetGeometry(*(to_load->second.geometry), bbox);\n\n\t\tto_load->second.loading = false;\n\t}\n}\n\nvoid* TileManager::LoadingThreadFuncWrapper(void* arg) {\n\tstatic_cast<TileManager*>(arg)->LoadingThreadFunc();\n\treturn NULL;\n}\n\n\/*\n * protected interface\n *\/\n\nvoid TileManager::Render(const Viewer& viewer) const {\n\tstd::vector<Tile*> tiles;\n\n\t\/* create array of renderable tiles *\/\n\tpthread_mutex_lock(&tiles_mutex_);\n\ttiles.reserve(tiles_.size());\n\tfor (TilesMap::const_iterator i = tiles_.begin(); i != tiles_.end(); ++i)\n\t\tif (i->second.tile && i->second.generation == generation_)\n\t\t\ttiles.push_back(i->second.tile);\n\tpthread_mutex_unlock(&tiles_mutex_);\n\n\t\/* and render them *\/\n\tfor (std::vector<Tile*>::iterator i = tiles.begin(); i != tiles.end(); ++i) {\n\t\tglMatrixMode(GL_MODELVIEW);\n\t\tglPushMatrix();\n\n\t\tVector3f offset = projection_.Project((*i)->GetReference(), Vector2i(viewer.GetPos(projection_))) +\n\t\t\t\tprojection_.Project(Vector2i(viewer.GetPos(projection_)), viewer.GetPos(projection_));\n\t\tVector3f voffset = projection_.Project(Vector2i(viewer.GetPos(projection_)), viewer.GetPos(projection_));\n\t\tglTranslatef(offset.x, offset.y, offset.z);\n\n\t\t(*i)->Render();\n\n\t\tglMatrixMode(GL_MODELVIEW);\n\t\tglPopMatrix();\n\t}\n}\n\n\/*\n * public interface\n *\/\n\nvoid TileManager::SetTargetLevel(int level) {\n\ttarget_level_ = level;\n}\n\nvoid TileManager::RequestVisible(const BBoxi& bbox, bool sync) {\n\t++generation_;\n\tpthread_mutex_lock(&tiles_mutex_);\n\tLoadTiles(bbox, sync);\n\tpthread_mutex_unlock(&tiles_mutex_);\n}\n\nvoid TileManager::GarbageCollect() {\n\tpthread_mutex_lock(&tiles_mutex_);\n\tfor (TilesMap::iterator i = tiles_.begin(); i != tiles_.end(); ) {\n\t\tif (!i->second.loading && i->second.generation != generation_) {\n\t\t\tTilesMap::iterator tmp = i++;\n\t\t\ttiles_.erase(tmp);\n\t\t} else {\n\t\t\ti++;\n\t\t}\n\t}\n\tpthread_mutex_unlock(&tiles_mutex_);\n}\n<commit_msg>Proper tile placing, enough to support both Mercator and Spherical projections<commit_after>\/*\n * Copyright (C) 2010-2011 Dmitry Marakasov\n *\n * This file is part of glosm.\n *\n * glosm is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * glosm is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with glosm.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include <glosm\/TileManager.hh>\n\n#if defined(__APPLE__)\n#\tinclude <OpenGL\/gl.h>\n#else\n#\tinclude <GL\/gl.h>\n#endif\n\n#include <glosm\/Viewer.hh>\n#include <glosm\/Geometry.hh>\n#include <glosm\/GeometryDatasource.hh>\n#include <glosm\/Tile.hh>\n\n#include <stdexcept>\n#include <cassert>\n\nTileManager::TileId::TileId(int lev, int xx, int yy) : level(lev), x(xx), y(yy) {\n}\n\nbool TileManager::TileId::operator<(const TileId& other) const {\n\tif (level < other.level) return true;\n\tif (level > other.level) return false;\n\tif (x < other.x) return true;\n\tif (x > other.x) return false;\n\treturn y < other.y;\n}\n\nTileManager::TileData::TileData(): tile(NULL), geometry(NULL), generation(0), loading(false) {\n}\n\nTileManager::TileData::~TileData() {\n\tdelete tile;\n\tdelete geometry;\n}\n\nTileManager::TileManager(const Projection projection, const GeometryDatasource& ds): projection_(projection), datasource_(ds) {\n\tif (pthread_mutex_init(&tiles_mutex_, 0) != 0)\n\t\tthrow std::runtime_error(\"pthread_mutex_init failed\");\n\n\tif (pthread_cond_init(&tiles_cond_, 0) != 0) {\n\t\tpthread_mutex_destroy(&tiles_mutex_);\n\t\tthrow std::runtime_error(\"pthread_cond_init failed\");\n\t}\n\n\tif (pthread_create(&loading_thread_, NULL, LoadingThreadFuncWrapper, (void*)this) != 0) {\n\t\tpthread_cond_destroy(&tiles_cond_);\n\t\tpthread_mutex_destroy(&tiles_mutex_);\n\t\tthrow std::runtime_error(\"pthread_create failed\");\n\t}\n\n\ttarget_level_ = 10;\n\tgeneration_ = 0;\n\tthread_die_flag_ = false;\n}\n\nTileManager::~TileManager() {\n\tthread_die_flag_ = true;\n\tpthread_cond_signal(&tiles_cond_);\n\n\tpthread_join(loading_thread_, NULL);\n\tpthread_cond_destroy(&tiles_cond_);\n\tpthread_mutex_destroy(&tiles_mutex_);\n}\n\n\/*\n * recursive quadtree processing\n *\/\n\nvoid TileManager::LoadTiles(const BBoxi& bbox, bool sync, int level, int x, int y) {\n\tif (level == target_level_) {\n\t\tTilesMap::iterator thistile = tiles_.find(TileId(level, x, y));\n\t\tif (thistile == tiles_.end()) {\n\t\t\tstd::pair<TilesMap::iterator, bool> pair = tiles_.insert(std::make_pair(TileId(level, x, y), TileData()));\n\t\t\tassert(pair.second);\n\t\t\tthistile = pair.first;\n\t\t}\n\n\t\t\/* update generation *\/\n\t\tthistile->second.generation = generation_;\n\n\t\t\/* already loaded or loading, skip *\/\n\t\tif (thistile->second.tile || thistile->second.loading)\n\t\t\treturn;\n\n\t\t\/* geometry loaded by thread, turn into tile *\/\n\t\tif (thistile->second.geometry) {\n\t\t\t\/* XXX: projection and VBO loading still\n\t\t\t * takes some time, maybe we need to limit\n\t\t\t * this per-frame *\/\n\t\t\tthistile->second.tile = SpawnTile(*thistile->second.geometry);\n\t\t\tdelete thistile->second.geometry;\n\t\t\tthistile->second.geometry = NULL;\n\t\t\treturn;\n\t\t}\n\n\t\t\/* load immediately for sync case *\/\n\t\tif (sync) {\n\t\t\tBBoxi bbox = BBoxi::ForGeoTile(level, x, y);\n\t\t\tGeometry geom(bbox);\n\t\t\tdatasource_.GetGeometry(geom, bbox);\n\t\t\tthistile->second.tile = SpawnTile(geom);\n\t\t\treturn;\n\t\t}\n\n\t\t\/* in other case, it will be loaded by thread *\/\n\t\tpthread_cond_signal(&tiles_cond_);\n\t\treturn;\n\t}\n\n\t\/* children *\/\n\tfor (int d = 0; d < 4; ++d) {\n\t\tint xx = x * 2 + d % 2;\n\t\tint yy = y * 2 + d \/ 2;\n\t\tif (BBoxi::ForGeoTile(level + 1, xx, yy).Intersects(bbox)) {\n\t\t\tLoadTiles(bbox, sync, level + 1, xx, yy);\n\t\t}\n\t}\n}\n\n\/*\n * loading queue - related\n *\/\n\nvoid TileManager::LoadingThreadFunc() {\n\twhile (!thread_die_flag_) {\n\t\tpthread_mutex_lock(&tiles_mutex_);\n\n\t\tTilesMap::iterator to_load = tiles_.end();\n\t\tfor (TilesMap::iterator i = tiles_.begin(); i != tiles_.end(); ++i) {\n\t\t\tif (!i->second.loading && !i->second.tile && !i->second.geometry) {\n\t\t\t\tto_load = i;\n\t\t\t\ti->second.loading = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\t\/* found nothing, sleep *\/\n\t\tif (to_load == tiles_.end()) {\n\t\t\tpthread_cond_wait(&tiles_cond_, &tiles_mutex_);\n\t\t\tpthread_mutex_unlock(&tiles_mutex_);\n\t\t\tcontinue;\n\t\t}\n\n\t\tpthread_mutex_unlock(&tiles_mutex_);\n\n\t\t\/* load tile *\/\n\t\tBBoxi bbox = BBoxi::ForGeoTile(to_load->first.level, to_load->first.x, to_load->first.y);\n\t\tto_load->second.geometry = new Geometry(bbox);\n\t\tdatasource_.GetGeometry(*(to_load->second.geometry), bbox);\n\n\t\tto_load->second.loading = false;\n\t}\n}\n\nvoid* TileManager::LoadingThreadFuncWrapper(void* arg) {\n\tstatic_cast<TileManager*>(arg)->LoadingThreadFunc();\n\treturn NULL;\n}\n\n\/*\n * protected interface\n *\/\n\nvoid TileManager::Render(const Viewer& viewer) const {\n\tstd::vector<Tile*> tiles;\n\n\t\/* create array of renderable tiles *\/\n\tpthread_mutex_lock(&tiles_mutex_);\n\ttiles.reserve(tiles_.size());\n\tfor (TilesMap::const_iterator i = tiles_.begin(); i != tiles_.end(); ++i)\n\t\tif (i->second.tile && i->second.generation == generation_)\n\t\t\ttiles.push_back(i->second.tile);\n\tpthread_mutex_unlock(&tiles_mutex_);\n\n\t\/* and render them *\/\n\tfor (std::vector<Tile*>::iterator i = tiles.begin(); i != tiles.end(); ++i) {\n\t\tglMatrixMode(GL_MODELVIEW);\n\t\tglPushMatrix();\n\n\t\t\/* prepare modelview matrix for the tile: position\n\t\t * it in the right place given that viewer is always\n\t\t * at (0, 0, 0) *\/\n\t\tVector3f offset = projection_.Project((*i)->GetReference(), Vector2i(viewer.GetPos(projection_))) +\n\t\t\t\tprojection_.Project(Vector2i(viewer.GetPos(projection_)), viewer.GetPos(projection_));\n\n\t\tglTranslatef(offset.x, offset.y, offset.z);\n\n\t\t\/* same for rotation *\/\n\t\tVector3i ref = (*i)->GetReference();\n\t\tVector3i pos = viewer.GetPos(projection_);\n\n\t\tVector3d refnormal = (\n\t\t\t\t(Vector3d)projection_.Project(Vector3i(ref.x, ref.y, std::numeric_limits<osmint_t>::max()), pos) -\n\t\t\t\t(Vector3d)projection_.Project(Vector3i(ref.x, ref.y, 0), pos)\n\t\t\t).Normalized();\n\n\t\tVector3d refeqnormal = (\n\t\t\t\t(Vector3d)projection_.Project(Vector3i(ref.x, 0, std::numeric_limits<osmint_t>::max()), pos) -\n\t\t\t\t(Vector3d)projection_.Project(Vector3i(ref.x, 0, 0), pos)\n\t\t\t).Normalized();\n\n\t\tif (refnormal != refeqnormal) {\n\t\t\tVector3d side = ref.y < 0 ? -refnormal.CrossProduct(refeqnormal).Normalized() : refnormal.CrossProduct(refeqnormal).Normalized();\n\t\t\tdouble sideangle = (double)((osmlong_t)pos.y - (osmlong_t)ref.y) \/ 10000000.0;\n\n\t\t\tVector3d pole = side.CrossProduct(refeqnormal).Normalized();\n\t\t\tdouble poleangle = (double)((osmlong_t)pos.x - (osmlong_t)ref.x) \/ 10000000.0;\n\n\t\t\tglRotatef(sideangle, side.x, side.y, side.z);\n\t\t\tglRotatef(poleangle, pole.x, pole.y, pole.z);\n\t\t}\n\n\t\t(*i)->Render();\n\n\t\tglMatrixMode(GL_MODELVIEW);\n\t\tglPopMatrix();\n\t}\n}\n\n\/*\n * public interface\n *\/\n\nvoid TileManager::SetTargetLevel(int level) {\n\ttarget_level_ = level;\n}\n\nvoid TileManager::RequestVisible(const BBoxi& bbox, bool sync) {\n\t++generation_;\n\tpthread_mutex_lock(&tiles_mutex_);\n\tLoadTiles(bbox, sync);\n\tpthread_mutex_unlock(&tiles_mutex_);\n}\n\nvoid TileManager::GarbageCollect() {\n\tpthread_mutex_lock(&tiles_mutex_);\n\tfor (TilesMap::iterator i = tiles_.begin(); i != tiles_.end(); ) {\n\t\tif (!i->second.loading && i->second.generation != generation_) {\n\t\t\tTilesMap::iterator tmp = i++;\n\t\t\ttiles_.erase(tmp);\n\t\t} else {\n\t\t\ti++;\n\t\t}\n\t}\n\tpthread_mutex_unlock(&tiles_mutex_);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ [WriteFile Name=ShowPopup, Category=DisplayInformation]\n\/\/ [Legal]\n\/\/ Copyright 2020 Esri.\n\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/ [Legal]\n\n#ifdef PCH_BUILD\n#include \"pch.hpp\"\n#endif \/\/ PCH_BUILD\n\n#include \"ShowPopup.h\"\n\n#include \"FeatureLayer.h\"\n#include \"Map.h\"\n#include \"MapQuickView.h\"\n#include \"PopupManager.h\"\n\nusing namespace Esri::ArcGISRuntime;\n\nShowPopup::ShowPopup(QObject* parent \/* = nullptr *\/):\n  QObject(parent),\n  m_map(new Map(QUrl(\"https:\/\/runtime.maps.arcgis.com\/home\/webmap\/viewer.html?webmap=e4c6eb667e6c43b896691f10cc2f1580\"), this))\n{\n}\n\nShowPopup::~ShowPopup() = default;\n\nvoid ShowPopup::init()\n{\n  \/\/ Register the map view for QML\n  qmlRegisterType<MapQuickView>(\"Esri.Samples\", 1, 0, \"MapView\");\n  qmlRegisterType<ShowPopup>(\"Esri.Samples\", 1, 0, \"ShowPopupSample\");\n\n  \/\/ Required to use the PopupManager with a QML UI.\n  qmlRegisterUncreatableType<PopupManager>(\"Esri.Samples\", 1, 0, \"PopupManager\", \"PopupManager is uncreateable\");\n  qmlRegisterUncreatableType<PopupAttachmentManager>(\"Esri.Samples\", 1, 0, \"PopupAttachmentManager\", \"PopupAttachmentManager is uncreateable\");\n  qmlRegisterUncreatableType<PopupAttributeListModel>(\"Esri.Samples\", 1, 0, \"PopupAttributeListModel\", \"PopupAttributeListModel is uncreateable\");\n  qmlRegisterUncreatableType<PopupAttachmentListModel>(\"Esri.Samples\", 1, 0, \"PopupAttachmentListModel\", \"PopupAttachmentListModel is uncreateable\");\n}\n\nMapQuickView* ShowPopup::mapView() const\n{\n  return m_mapView;\n}\n\n\/\/ Set the view (created in QML)\nvoid ShowPopup::setMapView(MapQuickView* mapView)\n{\n  if (!mapView || mapView == m_mapView)\n    return;\n\n  m_mapView = mapView;\n  m_mapView->setMap(m_map);\n\n  \/\/ once map is set, connect to MapQuickView mouse clicked signal\n  connect(m_mapView, &MapQuickView::mouseClicked, this, &ShowPopup::onMouseClicked);\n\n  \/\/ connect to MapQuickView::identifyLayerCompleted signal\n  connect(m_mapView, &MapQuickView::identifyLayerCompleted, this, &ShowPopup::onIdentifyLayerCompleted);\n  emit mapViewChanged();\n}\n\nvoid ShowPopup::onIdentifyLayerCompleted(QUuid, IdentifyLayerResult* rawIdentifyResult)\n{\n  emit taskRunningChanged();\n  auto identifyResult = std::unique_ptr<IdentifyLayerResult>(rawIdentifyResult);\n\n  \/\/ Invalid identify result\n  if (!identifyResult)\n    return;\n\n  if (!identifyResult->error().isEmpty())\n  {\n    qDebug() << \"Identify error occurred: \" << identifyResult->error().message();\n    return;\n  }\n\n  m_featureLayer->clearSelection();\n  for (GeoElement* geoElement : identifyResult->geoElements())\n  {\n    Feature* feature = static_cast<Feature*>(geoElement);\n    m_featureLayer->selectFeature(feature);\n  }\n\n  if (!identifyResult->popups().isEmpty())\n  {\n    \/\/ clear the list of PopupManagers\n    m_popupManagers.clear();\n    for (Popup* popup : identifyResult->popups())\n    {\n      \/\/ create a popup manager\n      PopupManager* popupManager = new PopupManager{popup, this};\n      \/\/ append popup manager to list\n      m_popupManagers.append(popupManager);\n      \/\/ notify QML that m_popupManagers has changed and to display the popup(s).\n      emit popupManagersChanged();\n    }\n  }\n}\n\nvoid ShowPopup::onMouseClicked(QMouseEvent& mouseEvent)\n{\n  if (m_map->loadStatus() != LoadStatus::Loaded)\n    return;\n\n  Layer* layer = m_map->operationalLayers()->at(0);\n  if (layer->layerType() == LayerType::FeatureLayer)\n  {\n    m_featureLayer = static_cast<FeatureLayer*>(layer);\n  }\n\n  constexpr double tolerance = 12;\n  constexpr bool returnPopupsOnly = false;\n\n  m_taskWatcher = m_mapView->identifyLayer(m_featureLayer, mouseEvent.x(), mouseEvent.y(), tolerance, returnPopupsOnly);\n\n  if (!m_taskWatcher.isValid())\n    qWarning() << \"Task not valid.\";\n\n  emit taskRunningChanged();\n}\n\nbool ShowPopup::taskRunning() const\n{\n  return !m_taskWatcher.isDone();\n}\n\nQQmlListProperty<PopupManager> ShowPopup::popupManagers()\n{\n  return QQmlListProperty<PopupManager>(this, m_popupManagers);\n}\n\nvoid ShowPopup::clearSelection() const\n{\n  m_featureLayer->clearSelection();\n}\n<commit_msg>this fixes the warning.<commit_after>\/\/ [WriteFile Name=ShowPopup, Category=DisplayInformation]\n\/\/ [Legal]\n\/\/ Copyright 2020 Esri.\n\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/ [Legal]\n\n#ifdef PCH_BUILD\n#include \"pch.hpp\"\n#endif \/\/ PCH_BUILD\n\n#include \"ShowPopup.h\"\n\n#include \"FeatureLayer.h\"\n#include \"Map.h\"\n#include \"MapQuickView.h\"\n#include \"PopupManager.h\"\n\nusing namespace Esri::ArcGISRuntime;\n\nShowPopup::ShowPopup(QObject* parent \/* = nullptr *\/):\n  QObject(parent),\n  m_map(new Map(QUrl(\"https:\/\/runtime.maps.arcgis.com\/home\/webmap\/viewer.html?webmap=e4c6eb667e6c43b896691f10cc2f1580\"), this))\n{\n}\n\nShowPopup::~ShowPopup() = default;\n\nvoid ShowPopup::init()\n{\n  \/\/ Register the map view for QML\n  qmlRegisterType<MapQuickView>(\"Esri.Samples\", 1, 0, \"MapView\");\n  qmlRegisterType<ShowPopup>(\"Esri.Samples\", 1, 0, \"ShowPopupSample\");\n\n  \/\/ Required to use the PopupManager with a QML UI.\n  qmlRegisterUncreatableType<PopupManager>(\"Esri.Samples\", 1, 0, \"PopupManager\", \"PopupManager is uncreateable\");\n  qmlRegisterUncreatableType<PopupAttachmentManager>(\"Esri.Samples\", 1, 0, \"PopupAttachmentManager\", \"PopupAttachmentManager is uncreateable\");\n  qmlRegisterUncreatableType<PopupAttributeListModel>(\"Esri.Samples\", 1, 0, \"PopupAttributeListModel\", \"PopupAttributeListModel is uncreateable\");\n  qmlRegisterUncreatableType<PopupAttachmentListModel>(\"Esri.Samples\", 1, 0, \"PopupAttachmentListModel\", \"PopupAttachmentListModel is uncreateable\");\n}\n\nMapQuickView* ShowPopup::mapView() const\n{\n  return m_mapView;\n}\n\n\/\/ Set the view (created in QML)\nvoid ShowPopup::setMapView(MapQuickView* mapView)\n{\n  if (!mapView || mapView == m_mapView)\n    return;\n\n  m_mapView = mapView;\n  m_mapView->setMap(m_map);\n\n  \/\/ once map is set, connect to MapQuickView mouse clicked signal\n  connect(m_mapView, &MapQuickView::mouseClicked, this, &ShowPopup::onMouseClicked);\n\n  \/\/ connect to MapQuickView::identifyLayerCompleted signal\n  connect(m_mapView, &MapQuickView::identifyLayerCompleted, this, &ShowPopup::onIdentifyLayerCompleted);\n  emit mapViewChanged();\n}\n\nvoid ShowPopup::onIdentifyLayerCompleted(QUuid, IdentifyLayerResult* rawIdentifyResult)\n{\n  emit taskRunningChanged();\n  auto identifyResult = std::unique_ptr<IdentifyLayerResult>(rawIdentifyResult);\n\n  \/\/ Invalid identify result\n  if (!identifyResult)\n    return;\n\n  if (!identifyResult->error().isEmpty())\n  {\n    qDebug() << \"Identify error occurred: \" << identifyResult->error().message();\n    return;\n  }\n\n  m_featureLayer->clearSelection();\n  for (GeoElement* geoElement : identifyResult->geoElements())\n  {\n    Feature* feature = static_cast<Feature*>(geoElement);\n    m_featureLayer->selectFeature(feature);\n  }\n\n  if (!identifyResult->popups().isEmpty())\n  {\n    \/\/ clear the list of PopupManagers\n    m_popupManagers.clear();\n    for (Popup* popup : identifyResult->popups())\n    {\n      \/\/ create a popup manager\n      PopupManager* popupManager = new PopupManager{popup, this};\n      \/\/ append popup manager to list\n      m_popupManagers.append(popupManager);\n      \/\/ notify QML that m_popupManagers has changed and to display the popup(s).\n      emit popupManagersChanged();\n    }\n  }\n}\n\nvoid ShowPopup::onMouseClicked(QMouseEvent& mouseEvent)\n{\n  if (m_map->loadStatus() != LoadStatus::Loaded)\n    return;\n\n  Layer* layer = m_map->operationalLayers()->at(0);\n  if (layer->layerType() == LayerType::FeatureLayer)\n  {\n    m_featureLayer = static_cast<FeatureLayer*>(layer);\n  }\n\n  constexpr double tolerance = 12;\n  constexpr bool returnPopupsOnly = false;\n\n  m_taskWatcher = m_mapView->identifyLayer(m_featureLayer, mouseEvent.x(), mouseEvent.y(), tolerance, returnPopupsOnly);\n\n  if (!m_taskWatcher.isValid())\n    qWarning() << \"Task not valid.\";\n\n  emit taskRunningChanged();\n}\n\nbool ShowPopup::taskRunning() const\n{\n  return !m_taskWatcher.isDone();\n}\n\nQQmlListProperty<PopupManager> ShowPopup::popupManagers()\n{\n  return QQmlListProperty<PopupManager>(this, &m_popupManagers);\n}\n\nvoid ShowPopup::clearSelection() const\n{\n  m_featureLayer->clearSelection();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: DAVProperties.cxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 14:04: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_ucb.hxx\"\n\n#include <string.h>\n\n#ifndef _DAVPROPERTIES_HXX_\n#include \"DAVProperties.hxx\"\n#endif\n\nusing namespace webdav_ucp;\n\nconst ::rtl::OUString DAVProperties::CREATIONDATE =\n                ::rtl::OUString::createFromAscii( \"DAV:creationdate\" );\nconst ::rtl::OUString DAVProperties::DISPLAYNAME =\n                ::rtl::OUString::createFromAscii( \"DAV:displayname\" );\nconst ::rtl::OUString DAVProperties::GETCONTENTLANGUAGE =\n                ::rtl::OUString::createFromAscii( \"DAV:getcontentlanguage\" );\nconst ::rtl::OUString DAVProperties::GETCONTENTLENGTH =\n                ::rtl::OUString::createFromAscii( \"DAV:getcontentlength\" );\nconst ::rtl::OUString DAVProperties::GETCONTENTTYPE =\n                ::rtl::OUString::createFromAscii( \"DAV:getcontenttype\" );\nconst ::rtl::OUString DAVProperties::GETETAG =\n                ::rtl::OUString::createFromAscii( \"DAV:getetag\" );\nconst ::rtl::OUString DAVProperties::GETLASTMODIFIED =\n                ::rtl::OUString::createFromAscii( \"DAV:getlastmodified\" );\nconst ::rtl::OUString DAVProperties::LOCKDISCOVERY =\n                ::rtl::OUString::createFromAscii( \"DAV:lockdiscovery\" );\nconst ::rtl::OUString DAVProperties::RESOURCETYPE =\n                ::rtl::OUString::createFromAscii( \"DAV:resourcetype\" );\nconst ::rtl::OUString DAVProperties::SOURCE =\n                ::rtl::OUString::createFromAscii( \"DAV:source\" );\nconst ::rtl::OUString DAVProperties::SUPPORTEDLOCK =\n                ::rtl::OUString::createFromAscii( \"DAV:supportedlock\" );\n\nconst ::rtl::OUString DAVProperties::EXECUTABLE =\n                ::rtl::OUString::createFromAscii(\n                                \"http:\/\/apache.org\/dav\/props\/executable\" );\n\n\/\/ -------------------------------------------------------------------\n\/\/ static\nvoid DAVProperties::createNeonPropName( const rtl::OUString & rFullName,\n                                        NeonPropName & rName )\n{\n    if ( rFullName.compareToAscii( RTL_CONSTASCII_STRINGPARAM( \"DAV:\" ) ) == 0 )\n    {\n        rName.nspace = \"DAV:\";\n        rName.name\n            = strdup( rtl::OUStringToOString(\n                        rFullName.copy( RTL_CONSTASCII_LENGTH( \"DAV:\" ) ),\n                                        RTL_TEXTENCODING_UTF8 ) );\n    }\n    else if ( rFullName.compareToAscii( RTL_CONSTASCII_STRINGPARAM(\n                \"http:\/\/apache.org\/dav\/props\/\" ) ) == 0 )\n    {\n        rName.nspace = \"http:\/\/apache.org\/dav\/props\/\";\n        rName.name\n            = strdup( rtl::OUStringToOString(\n                        rFullName.copy(\n                            RTL_CONSTASCII_LENGTH(\n                                \"http:\/\/apache.org\/dav\/props\/\" ) ),\n                            RTL_TEXTENCODING_UTF8 ) );\n    }\n    else if ( rFullName.compareToAscii( RTL_CONSTASCII_STRINGPARAM(\n                \"http:\/\/ucb.openoffice.org\/dav\/props\/\" ) ) == 0 )\n    {\n        rName.nspace = \"http:\/\/ucb.openoffice.org\/dav\/props\/\";\n        rName.name\n            = strdup( rtl::OUStringToOString(\n                        rFullName.copy(\n                            RTL_CONSTASCII_LENGTH(\n                                \"http:\/\/ucb.openoffice.org\/dav\/props\/\" ) ),\n                            RTL_TEXTENCODING_UTF8 ) );\n    }\n    else if ( rFullName.compareToAscii( RTL_CONSTASCII_STRINGPARAM(\n                \"<prop:\" ) ) == 0 )\n    {\n        \/\/ Support for 3rd party namespaces\/props\n\n        rtl::OString aFullName\n            = rtl::OUStringToOString( rFullName, RTL_TEXTENCODING_UTF8 );\n\n        \/\/ Format: <prop:the_propname xmlns:prop=\"the_namespace\">\n\n        sal_Int32 nStart = RTL_CONSTASCII_LENGTH( \"<prop:\" );\n        sal_Int32 nLen = aFullName.indexOf( ' ' ) - nStart;\n        rName.name = strdup( aFullName.copy( nStart, nLen ) );\n\n        nStart = aFullName.indexOf( '=', nStart + nLen ) + 2; \/\/ after =\"\n        nLen = aFullName.getLength() - RTL_CONSTASCII_LENGTH( \"\\\">\" ) - nStart;\n        rName.nspace = strdup( aFullName.copy( nStart, nLen ) );\n    }\n    else\n    {\n        \/\/ Add our namespace to our own properties.\n        rName.nspace = \"http:\/\/ucb.openoffice.org\/dav\/props\/\";\n        rName.name\n            = strdup( rtl::OUStringToOString( rFullName,\n                                              RTL_TEXTENCODING_UTF8 ) );\n    }\n}\n\n\/\/ -------------------------------------------------------------------\n\/\/ static\nvoid DAVProperties::createUCBPropName( const char * nspace,\n                                       const char * name,\n                                       rtl::OUString & rFullName )\n{\n    rtl::OUString aNameSpace\n        = rtl::OStringToOUString( nspace, RTL_TEXTENCODING_UTF8 );\n    rtl::OUString aName\n        = rtl::OStringToOUString( name,   RTL_TEXTENCODING_UTF8 );\n\n    \/\/ Note: Concatenating strings BEFORE comparing against known namespaces\n    \/\/       is important. See RFC 2815 ( 23.4.2 Meaning of Qualified Names ).\n    rFullName  = aNameSpace;\n    rFullName += aName;\n\n    if ( rFullName.compareToAscii( RTL_CONSTASCII_STRINGPARAM(\n                \"DAV:\" ) ) == 0 )\n    {\n        \/\/ Okay, Just concat strings.\n    }\n    else if ( rFullName.compareToAscii( RTL_CONSTASCII_STRINGPARAM(\n                \"http:\/\/apache.org\/dav\/props\/\" ) ) == 0 )\n    {\n        \/\/ Okay, Just concat strings.\n    }\n    else if ( rFullName.compareToAscii( RTL_CONSTASCII_STRINGPARAM(\n                \"http:\/\/ucb.openoffice.org\/dav\/props\/\" ) ) == 0 )\n    {\n        \/\/ Remove namespace from our own properties.\n        rFullName = rFullName.copy(\n                        RTL_CONSTASCII_LENGTH(\n                            \"http:\/\/ucb.openoffice.org\/dav\/props\/\" ) );\n    }\n    else\n    {\n        \/\/ Create property name that encodes, namespace and name ( XML ).\n        rFullName  = rtl::OUString::createFromAscii( \"<prop:\" );\n        rFullName += aName;\n        rFullName += rtl::OUString::createFromAscii( \" xmlns:prop=\\\"\" );\n        rFullName += aNameSpace;\n        rFullName += rtl::OUString::createFromAscii( \"\\\">\" );\n    }\n}\n\n\/\/ -------------------------------------------------------------------\n\/\/ static\nbool DAVProperties::isUCBDeadProperty( const NeonPropName & rName )\n{\n    return ( rtl_str_compareIgnoreAsciiCase(\n                rName.nspace, \"http:\/\/ucb.openoffice.org\/dav\/props\/\" ) == 0 );\n}\n<commit_msg>INTEGRATION: CWS changefileheader (1.5.118); FILE MERGED 2008\/04\/01 12:58:25 thb 1.5.118.2: #i85898# Stripping all external header guards 2008\/03\/31 15:30:29 rt 1.5.118.1: #i87441# Change license header to LPGL v3.<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: DAVProperties.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_ucb.hxx\"\n\n#include <string.h>\n#include \"DAVProperties.hxx\"\n\nusing namespace webdav_ucp;\n\nconst ::rtl::OUString DAVProperties::CREATIONDATE =\n                ::rtl::OUString::createFromAscii( \"DAV:creationdate\" );\nconst ::rtl::OUString DAVProperties::DISPLAYNAME =\n                ::rtl::OUString::createFromAscii( \"DAV:displayname\" );\nconst ::rtl::OUString DAVProperties::GETCONTENTLANGUAGE =\n                ::rtl::OUString::createFromAscii( \"DAV:getcontentlanguage\" );\nconst ::rtl::OUString DAVProperties::GETCONTENTLENGTH =\n                ::rtl::OUString::createFromAscii( \"DAV:getcontentlength\" );\nconst ::rtl::OUString DAVProperties::GETCONTENTTYPE =\n                ::rtl::OUString::createFromAscii( \"DAV:getcontenttype\" );\nconst ::rtl::OUString DAVProperties::GETETAG =\n                ::rtl::OUString::createFromAscii( \"DAV:getetag\" );\nconst ::rtl::OUString DAVProperties::GETLASTMODIFIED =\n                ::rtl::OUString::createFromAscii( \"DAV:getlastmodified\" );\nconst ::rtl::OUString DAVProperties::LOCKDISCOVERY =\n                ::rtl::OUString::createFromAscii( \"DAV:lockdiscovery\" );\nconst ::rtl::OUString DAVProperties::RESOURCETYPE =\n                ::rtl::OUString::createFromAscii( \"DAV:resourcetype\" );\nconst ::rtl::OUString DAVProperties::SOURCE =\n                ::rtl::OUString::createFromAscii( \"DAV:source\" );\nconst ::rtl::OUString DAVProperties::SUPPORTEDLOCK =\n                ::rtl::OUString::createFromAscii( \"DAV:supportedlock\" );\n\nconst ::rtl::OUString DAVProperties::EXECUTABLE =\n                ::rtl::OUString::createFromAscii(\n                                \"http:\/\/apache.org\/dav\/props\/executable\" );\n\n\/\/ -------------------------------------------------------------------\n\/\/ static\nvoid DAVProperties::createNeonPropName( const rtl::OUString & rFullName,\n                                        NeonPropName & rName )\n{\n    if ( rFullName.compareToAscii( RTL_CONSTASCII_STRINGPARAM( \"DAV:\" ) ) == 0 )\n    {\n        rName.nspace = \"DAV:\";\n        rName.name\n            = strdup( rtl::OUStringToOString(\n                        rFullName.copy( RTL_CONSTASCII_LENGTH( \"DAV:\" ) ),\n                                        RTL_TEXTENCODING_UTF8 ) );\n    }\n    else if ( rFullName.compareToAscii( RTL_CONSTASCII_STRINGPARAM(\n                \"http:\/\/apache.org\/dav\/props\/\" ) ) == 0 )\n    {\n        rName.nspace = \"http:\/\/apache.org\/dav\/props\/\";\n        rName.name\n            = strdup( rtl::OUStringToOString(\n                        rFullName.copy(\n                            RTL_CONSTASCII_LENGTH(\n                                \"http:\/\/apache.org\/dav\/props\/\" ) ),\n                            RTL_TEXTENCODING_UTF8 ) );\n    }\n    else if ( rFullName.compareToAscii( RTL_CONSTASCII_STRINGPARAM(\n                \"http:\/\/ucb.openoffice.org\/dav\/props\/\" ) ) == 0 )\n    {\n        rName.nspace = \"http:\/\/ucb.openoffice.org\/dav\/props\/\";\n        rName.name\n            = strdup( rtl::OUStringToOString(\n                        rFullName.copy(\n                            RTL_CONSTASCII_LENGTH(\n                                \"http:\/\/ucb.openoffice.org\/dav\/props\/\" ) ),\n                            RTL_TEXTENCODING_UTF8 ) );\n    }\n    else if ( rFullName.compareToAscii( RTL_CONSTASCII_STRINGPARAM(\n                \"<prop:\" ) ) == 0 )\n    {\n        \/\/ Support for 3rd party namespaces\/props\n\n        rtl::OString aFullName\n            = rtl::OUStringToOString( rFullName, RTL_TEXTENCODING_UTF8 );\n\n        \/\/ Format: <prop:the_propname xmlns:prop=\"the_namespace\">\n\n        sal_Int32 nStart = RTL_CONSTASCII_LENGTH( \"<prop:\" );\n        sal_Int32 nLen = aFullName.indexOf( ' ' ) - nStart;\n        rName.name = strdup( aFullName.copy( nStart, nLen ) );\n\n        nStart = aFullName.indexOf( '=', nStart + nLen ) + 2; \/\/ after =\"\n        nLen = aFullName.getLength() - RTL_CONSTASCII_LENGTH( \"\\\">\" ) - nStart;\n        rName.nspace = strdup( aFullName.copy( nStart, nLen ) );\n    }\n    else\n    {\n        \/\/ Add our namespace to our own properties.\n        rName.nspace = \"http:\/\/ucb.openoffice.org\/dav\/props\/\";\n        rName.name\n            = strdup( rtl::OUStringToOString( rFullName,\n                                              RTL_TEXTENCODING_UTF8 ) );\n    }\n}\n\n\/\/ -------------------------------------------------------------------\n\/\/ static\nvoid DAVProperties::createUCBPropName( const char * nspace,\n                                       const char * name,\n                                       rtl::OUString & rFullName )\n{\n    rtl::OUString aNameSpace\n        = rtl::OStringToOUString( nspace, RTL_TEXTENCODING_UTF8 );\n    rtl::OUString aName\n        = rtl::OStringToOUString( name,   RTL_TEXTENCODING_UTF8 );\n\n    \/\/ Note: Concatenating strings BEFORE comparing against known namespaces\n    \/\/       is important. See RFC 2815 ( 23.4.2 Meaning of Qualified Names ).\n    rFullName  = aNameSpace;\n    rFullName += aName;\n\n    if ( rFullName.compareToAscii( RTL_CONSTASCII_STRINGPARAM(\n                \"DAV:\" ) ) == 0 )\n    {\n        \/\/ Okay, Just concat strings.\n    }\n    else if ( rFullName.compareToAscii( RTL_CONSTASCII_STRINGPARAM(\n                \"http:\/\/apache.org\/dav\/props\/\" ) ) == 0 )\n    {\n        \/\/ Okay, Just concat strings.\n    }\n    else if ( rFullName.compareToAscii( RTL_CONSTASCII_STRINGPARAM(\n                \"http:\/\/ucb.openoffice.org\/dav\/props\/\" ) ) == 0 )\n    {\n        \/\/ Remove namespace from our own properties.\n        rFullName = rFullName.copy(\n                        RTL_CONSTASCII_LENGTH(\n                            \"http:\/\/ucb.openoffice.org\/dav\/props\/\" ) );\n    }\n    else\n    {\n        \/\/ Create property name that encodes, namespace and name ( XML ).\n        rFullName  = rtl::OUString::createFromAscii( \"<prop:\" );\n        rFullName += aName;\n        rFullName += rtl::OUString::createFromAscii( \" xmlns:prop=\\\"\" );\n        rFullName += aNameSpace;\n        rFullName += rtl::OUString::createFromAscii( \"\\\">\" );\n    }\n}\n\n\/\/ -------------------------------------------------------------------\n\/\/ static\nbool DAVProperties::isUCBDeadProperty( const NeonPropName & rName )\n{\n    return ( rtl_str_compareIgnoreAsciiCase(\n                rName.nspace, \"http:\/\/ucb.openoffice.org\/dav\/props\/\" ) == 0 );\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"sipfieldparsing.h\"\n\n#include \"sipconversions.h\"\n\n#include <QRegularExpression>\n#include <QDebug>\n\n\n\/\/ TODO: Support SIPS uri scheme. Needed for TLS\nbool parseURI(QStringList &words, SIP_URI& uri);\nConnectionType parseUritype(QString type);\nbool parseParameterNameToValue(std::shared_ptr<QList<SIPParameter>> parameters,\n                               QString name, QString& value);\nbool parseUint(QString values, uint& number);\n\n\nbool parseURI(QStringList& words, SIP_URI& uri)\n{\n  if (words.size() == 0 || words.size() > 2)\n  {\n    qDebug() << \"PEER ERROR: Wrong amount of words in words list for URI. Expected 1-2. Got:\"\n             << words;\n    return false;\n  }\n\n  int uriIndex = 0;\n  if (words.size() == 2)\n  {\n    uri.realname = words.at(0);\n    uriIndex = 1;\n  }\n\n  QRegularExpression re_field(\"<(\\\\w+):(?:(\\\\w+)@)?(.+)>\");\n  QRegularExpressionMatch field_match = re_field.match(words.at(uriIndex));\n\n  \/\/ number of matches depends whether real name or the port were given\n  if (field_match.hasMatch() &&\n      field_match.lastCapturedIndex() == 3)\n  {\n    QString addressString = \"\";\n\n    if(field_match.lastCapturedIndex() == 3)\n    {\n      uri.connectionType = parseUritype(field_match.captured(1));\n      uri.username = field_match.captured(2);\n      addressString = field_match.captured(3);\n    }\n\n    QStringList parameters = addressString.split(\";\", QString::SkipEmptyParts);\n\n    if (!parameters.empty())\n    {\n      const int firstParameterIndex = 1;\n      if (parameters.size() > firstParameterIndex)\n      {\n        for (int i = firstParameterIndex; i < parameters.size(); ++i)\n        {\n          \/\/ currently parsing doesn't do any further processing on URI parameters\n          uri.parameters.push_back(SIPParameter());\n          parseParameter(parameters.at(i), uri.parameters.back());\n        }\n      }\n\n      QRegularExpression re_address(\"([\\\\w.]+):?(\\\\d*)\");\n      QRegularExpressionMatch address_match = re_address.match(parameters.first());\n\n      if(address_match.hasMatch() &&\n         address_match.lastCapturedIndex() >= 1 &&\n         address_match.lastCapturedIndex() <= 2)\n      {\n        uri.host = address_match.captured(1);\n\n        if (address_match.lastCapturedIndex() == 2 && address_match.captured(2) != \"\")\n        {\n          uri.port = address_match.captured(2).toUInt();\n        }\n        else\n        {\n          uri.port = 0;\n        }\n      }\n      else\n      {\n        return false;\n      }\n    }\n\n    return uri.connectionType != NONE;\n  }\n\n  return false;\n}\n\n\nConnectionType parseUritype(QString type)\n{\n  if (type == \"sip\")\n  {\n    return TCP;\n  }\n  else if (type == \"sips\")\n  {\n    return TLS;\n  }\n  else if (type == \"tel\")\n  {\n    return TEL;\n  }\n  else\n  {\n    qDebug() << \"ERROR:  Could not identify connection type:\" << type;\n  }\n\n  return NONE;\n}\n\n\nbool parseParameterNameToValue(std::shared_ptr<QList<SIPParameter>> parameters,\n                               QString name, QString& value)\n{\n  if(parameters != nullptr)\n  {\n    for(SIPParameter parameter : *parameters)\n    {\n      if(parameter.name == name)\n      {\n        value = parameter.value;\n        return true;\n      }\n    }\n  }\n  return false;\n}\n\n\nbool parseUint(QString values, uint& number)\n{\n  QRegularExpression re_field(\"(\\\\d+)\");\n  QRegularExpressionMatch field_match = re_field.match(values);\n\n  if(field_match.hasMatch() && field_match.lastCapturedIndex() == 1)\n  {\n    number = values.toUInt();\n    return true;\n  }\n  return false;\n}\n\n\nbool parseToField(SIPField& field,\n                  std::shared_ptr<SIPMessageInfo> message)\n{\n  Q_ASSERT(message);\n  Q_ASSERT(message->dialog);\n  Q_ASSERT(!field.valueSets.empty());\n\n  if (field.valueSets[0].words.size() >= 1 &&\n      !parseURI(field.valueSets[0].words, message->to))\n  {\n    return false;\n  }\n\n  parseParameterNameToValue(field.valueSets[0].parameters, \"tag\", message->dialog->toTag);\n  return true;\n}\n\n\nbool parseFromField(SIPField& field,\n                    std::shared_ptr<SIPMessageInfo> message)\n{\n  Q_ASSERT(message);\n  Q_ASSERT(message->dialog);\n  Q_ASSERT(!field.valueSets.empty());\n\n  if (field.valueSets[0].words.size() >= 1 &&\n      !parseURI(field.valueSets[0].words, message->from))\n  {\n    return false;\n  }\n\n  parseParameterNameToValue(field.valueSets[0].parameters, \"tag\", message->dialog->fromTag);\n  return true;\n}\n\n\nbool parseCSeqField(SIPField& field,\n                  std::shared_ptr<SIPMessageInfo> message)\n{\n  Q_ASSERT(message);\n  Q_ASSERT(!field.valueSets.empty());\n\n  if (field.valueSets[0].words.size() != 2)\n  {\n    return false;\n  }\n\n  bool ok = false;\n\n  message->cSeq = field.valueSets[0].words[0].toUInt(&ok);\n  message->transactionRequest = stringToRequest(field.valueSets[0].words[1]);\n  return message->transactionRequest != SIP_NO_REQUEST && ok;\n}\n\n\nbool parseCallIDField(SIPField& field,\n                      std::shared_ptr<SIPMessageInfo> message)\n{\n  Q_ASSERT(message);\n  Q_ASSERT(message->dialog);\n  Q_ASSERT(!field.valueSets.empty());\n\n  if (field.valueSets[0].words.size() != 1)\n  {\n    return false;\n  }\n\n  message->dialog->callID = field.valueSets[0].words[0];\n  return true;\n}\n\n\nbool parseViaField(SIPField& field,\n                   std::shared_ptr<SIPMessageInfo> message)\n{\n  Q_ASSERT(message);\n  Q_ASSERT(!field.valueSets.empty());\n\n  if (field.valueSets[0].words.size() != 2)\n  {\n    return false;\n  }\n\n  ViaInfo via = {NONE, \"\", \"\", 0, \"\", false, false, 0, \"\"};\n\n  QRegularExpression re_first(\"SIP\/(\\\\d.\\\\d)\/(\\\\w+)\");\n  QRegularExpressionMatch first_match = re_first.match(field.valueSets[0].words[0]);\n\n  if(!first_match.hasMatch() || first_match.lastCapturedIndex() != 2)\n  {\n    return false;\n  }\n\n  via.connectionType = stringToConnection(first_match.captured(2));\n  via.version = first_match.captured(1);\n\n  QRegularExpression re_second(\"([\\\\w.]+):?(\\\\d*)\");\n  QRegularExpressionMatch second_match = re_second.match(field.valueSets[0].words[1]);\n\n  if(!second_match.hasMatch() || second_match.lastCapturedIndex() > 2)\n  {\n    return false;\n  }\n\n  via.address = second_match.captured(1);\n\n  if (second_match.lastCapturedIndex() == 2)\n  {\n    via.port = second_match.captured(2).toUInt();\n  }\n\n  parseParameterNameToValue(field.valueSets[0].parameters, \"branch\", via.branch);\n  parseParameterNameToValue(field.valueSets[0].parameters, \"received\", via.receivedAddress);\n\n  QString rportValue = \"\";\n  if (parseParameterNameToValue(field.valueSets[0].parameters, \"rport\", rportValue))\n  {\n    bool ok = false;\n    via.rportValue = rportValue.toUInt(&ok);\n\n    if (!ok)\n    {\n      via.rportValue = 0;\n    }\n  }\n\n  message->vias.push_back(via);\n\n  return true;\n}\n\n\nbool parseMaxForwardsField(SIPField& field,\n                           std::shared_ptr<SIPMessageInfo> message)\n{\n  Q_ASSERT(message);\n  Q_ASSERT(!field.valueSets.empty());\n\n  return field.valueSets[0].words.size() == 1 &&\n      parseUint(field.valueSets[0].words[0], message->maxForwards);\n}\n\n\nbool parseContactField(SIPField& field,\n                       std::shared_ptr<SIPMessageInfo> message)\n{\n  Q_ASSERT(message);\n  Q_ASSERT(!field.valueSets.empty());\n  return field.valueSets[0].words.size() == 1 &&\n      parseURI(field.valueSets[0].words, message->contact);\n\n  \/\/ TODO: parse expires parameter\n}\n\n\nbool parseContentTypeField(SIPField& field,\n                           std::shared_ptr<SIPMessageInfo> message)\n{\n  Q_ASSERT(message);\n  Q_ASSERT(!field.valueSets.empty());\n\n  QRegularExpression re_field(\"(\\\\w+\/\\\\w+)\");\n  QRegularExpressionMatch field_match = re_field.match(field.valueSets[0].words[0]);\n\n  if(field_match.hasMatch() && field_match.lastCapturedIndex() == 1)\n  {\n    message->content.type = stringToContentType(field_match.captured(1));\n    return true;\n  }\n  return false;\n}\n\n\nbool parseContentLengthField(SIPField& field,\n                             std::shared_ptr<SIPMessageInfo> message)\n{\n  Q_ASSERT(message);\n  Q_ASSERT(!field.valueSets.empty());\n  return field.valueSets[0].words.size() == 1 &&\n      parseUint(field.valueSets[0].words[0], message->content.length);\n}\n\n\nbool parseRecordRouteField(SIPField& field,\n                  std::shared_ptr<SIPMessageInfo> message)\n{\n  Q_ASSERT(message);\n  Q_ASSERT(!field.valueSets.empty());\n  message->recordRoutes.push_back(SIP_URI{});\n  return parseURI(field.valueSets[0].words, message->recordRoutes.back());\n}\n\n\nbool parseServerField(SIPField& field,\n                  std::shared_ptr<SIPMessageInfo> message)\n{\n  Q_ASSERT(message);\n  Q_ASSERT(!field.valueSets.empty());\n\n  if (field.valueSets[0].words.size() < 1\n      || field.valueSets[0].words.size() > 100)\n  {\n    return false;\n  }\n\n  message->server = field.valueSets[0].words[0];\n  return true;\n}\n\n\nbool parseUserAgentField(SIPField& field,\n                  std::shared_ptr<SIPMessageInfo> message)\n{\n  Q_ASSERT(message);\n  Q_ASSERT(!field.valueSets.empty());\n\n  if (field.valueSets[0].words.size() < 1\n      || field.valueSets[0].words.size() > 100)\n  {\n    return false;\n  }\n\n  message->userAgent = field.valueSets[0].words[0];\n  return true;\n}\n\n\nbool isLinePresent(QString name, QList<SIPField>& fields)\n{\n  for(SIPField field : fields)\n  {\n    if(field.name == name)\n    {\n      return true;\n    }\n  }\n  qDebug() << \"Did not find header:\" << name;\n  return false;\n}\n\n\nbool parseParameter(QString text, SIPParameter& parameter)\n{\n  QRegularExpression re_parameter(\"([^=]+)=?([^;]*)\");\n  QRegularExpressionMatch parameter_match = re_parameter.match(text);\n\n  if(parameter_match.hasMatch() && parameter_match.lastCapturedIndex() == 2)\n  {\n    parameter.name = parameter_match.captured(1);\n\n    if (parameter_match.captured(2) != \"\")\n    {\n      parameter.value = parameter_match.captured(2);\n    }\n\n    return true;\n  }\n\n  return false;\n}\n<commit_msg>fix(Transport): Parsing of IPv6 addresses in URIs.<commit_after>#include \"sipfieldparsing.h\"\n\n#include \"sipconversions.h\"\n\n#include <QRegularExpression>\n#include <QDebug>\n\n\n\/\/ TODO: Support SIPS uri scheme. Needed for TLS\nbool parseURI(QStringList &words, SIP_URI& uri);\nConnectionType parseUritype(QString type);\nbool parseParameterNameToValue(std::shared_ptr<QList<SIPParameter>> parameters,\n                               QString name, QString& value);\nbool parseUint(QString values, uint& number);\n\n\nbool parseURI(QStringList& words, SIP_URI& uri)\n{\n  if (words.size() == 0 || words.size() > 2)\n  {\n    qDebug() << \"PEER ERROR: Wrong amount of words in words list for URI. Expected 1-2. Got:\"\n             << words;\n    return false;\n  }\n\n  int uriIndex = 0;\n  if (words.size() == 2)\n  {\n    uri.realname = words.at(0);\n    uriIndex = 1;\n  }\n\n  QRegularExpression re_field(\"<(\\\\w+):(?:(\\\\w+)@)?(.+)>\");\n  QRegularExpressionMatch field_match = re_field.match(words.at(uriIndex));\n\n  \/\/ number of matches depends whether real name or the port were given\n  if (field_match.hasMatch() &&\n      field_match.lastCapturedIndex() == 3)\n  {\n    QString addressString = \"\";\n\n    if(field_match.lastCapturedIndex() == 3)\n    {\n      uri.connectionType = parseUritype(field_match.captured(1));\n      uri.username = field_match.captured(2);\n      addressString = field_match.captured(3);\n    }\n\n    QStringList parameters = addressString.split(\";\", QString::SkipEmptyParts);\n\n    if (!parameters.empty())\n    {\n      const int firstParameterIndex = 1;\n      if (parameters.size() > firstParameterIndex)\n      {\n        for (int i = firstParameterIndex; i < parameters.size(); ++i)\n        {\n          \/\/ currently parsing doesn't do any further processing on URI parameters\n          uri.parameters.push_back(SIPParameter());\n          parseParameter(parameters.at(i), uri.parameters.back());\n        }\n      }\n\n      QRegularExpression re_address(\"(\\\\[.+\\\\]|[\\\\w.]+):?(\\\\d*)\");\n      QRegularExpressionMatch address_match = re_address.match(parameters.first());\n\n      if(address_match.hasMatch() &&\n         address_match.lastCapturedIndex() >= 1 &&\n         address_match.lastCapturedIndex() <= 2)\n      {\n        uri.host = address_match.captured(1);\n\n        if (address_match.lastCapturedIndex() == 2 && address_match.captured(2) != \"\")\n        {\n          uri.port = address_match.captured(2).toUInt();\n        }\n        else\n        {\n          uri.port = 0;\n        }\n      }\n      else\n      {\n        return false;\n      }\n    }\n\n    return uri.connectionType != NONE;\n  }\n\n  return false;\n}\n\n\nConnectionType parseUritype(QString type)\n{\n  if (type == \"sip\")\n  {\n    return TCP;\n  }\n  else if (type == \"sips\")\n  {\n    return TLS;\n  }\n  else if (type == \"tel\")\n  {\n    return TEL;\n  }\n  else\n  {\n    qDebug() << \"ERROR:  Could not identify connection type:\" << type;\n  }\n\n  return NONE;\n}\n\n\nbool parseParameterNameToValue(std::shared_ptr<QList<SIPParameter>> parameters,\n                               QString name, QString& value)\n{\n  if(parameters != nullptr)\n  {\n    for(SIPParameter parameter : *parameters)\n    {\n      if(parameter.name == name)\n      {\n        value = parameter.value;\n        return true;\n      }\n    }\n  }\n  return false;\n}\n\n\nbool parseUint(QString values, uint& number)\n{\n  QRegularExpression re_field(\"(\\\\d+)\");\n  QRegularExpressionMatch field_match = re_field.match(values);\n\n  if(field_match.hasMatch() && field_match.lastCapturedIndex() == 1)\n  {\n    number = values.toUInt();\n    return true;\n  }\n  return false;\n}\n\n\nbool parseToField(SIPField& field,\n                  std::shared_ptr<SIPMessageInfo> message)\n{\n  Q_ASSERT(message);\n  Q_ASSERT(message->dialog);\n  Q_ASSERT(!field.valueSets.empty());\n\n  if (field.valueSets[0].words.size() >= 1 &&\n      !parseURI(field.valueSets[0].words, message->to))\n  {\n    return false;\n  }\n\n  parseParameterNameToValue(field.valueSets[0].parameters, \"tag\", message->dialog->toTag);\n  return true;\n}\n\n\nbool parseFromField(SIPField& field,\n                    std::shared_ptr<SIPMessageInfo> message)\n{\n  Q_ASSERT(message);\n  Q_ASSERT(message->dialog);\n  Q_ASSERT(!field.valueSets.empty());\n\n  if (field.valueSets[0].words.size() >= 1 &&\n      !parseURI(field.valueSets[0].words, message->from))\n  {\n    return false;\n  }\n\n  parseParameterNameToValue(field.valueSets[0].parameters, \"tag\", message->dialog->fromTag);\n  return true;\n}\n\n\nbool parseCSeqField(SIPField& field,\n                  std::shared_ptr<SIPMessageInfo> message)\n{\n  Q_ASSERT(message);\n  Q_ASSERT(!field.valueSets.empty());\n\n  if (field.valueSets[0].words.size() != 2)\n  {\n    return false;\n  }\n\n  bool ok = false;\n\n  message->cSeq = field.valueSets[0].words[0].toUInt(&ok);\n  message->transactionRequest = stringToRequest(field.valueSets[0].words[1]);\n  return message->transactionRequest != SIP_NO_REQUEST && ok;\n}\n\n\nbool parseCallIDField(SIPField& field,\n                      std::shared_ptr<SIPMessageInfo> message)\n{\n  Q_ASSERT(message);\n  Q_ASSERT(message->dialog);\n  Q_ASSERT(!field.valueSets.empty());\n\n  if (field.valueSets[0].words.size() != 1)\n  {\n    return false;\n  }\n\n  message->dialog->callID = field.valueSets[0].words[0];\n  return true;\n}\n\n\nbool parseViaField(SIPField& field,\n                   std::shared_ptr<SIPMessageInfo> message)\n{\n  Q_ASSERT(message);\n  Q_ASSERT(!field.valueSets.empty());\n\n  if (field.valueSets[0].words.size() != 2)\n  {\n    return false;\n  }\n\n  ViaInfo via = {NONE, \"\", \"\", 0, \"\", false, false, 0, \"\"};\n\n  QRegularExpression re_first(\"SIP\/(\\\\d.\\\\d)\/(\\\\w+)\");\n  QRegularExpressionMatch first_match = re_first.match(field.valueSets[0].words[0]);\n\n  if(!first_match.hasMatch() || first_match.lastCapturedIndex() != 2)\n  {\n    return false;\n  }\n\n  via.connectionType = stringToConnection(first_match.captured(2));\n  via.version = first_match.captured(1);\n\n  QRegularExpression re_second(\"([\\\\w.]+):?(\\\\d*)\");\n  QRegularExpressionMatch second_match = re_second.match(field.valueSets[0].words[1]);\n\n  if(!second_match.hasMatch() || second_match.lastCapturedIndex() > 2)\n  {\n    return false;\n  }\n\n  via.address = second_match.captured(1);\n\n  if (second_match.lastCapturedIndex() == 2)\n  {\n    via.port = second_match.captured(2).toUInt();\n  }\n\n  parseParameterNameToValue(field.valueSets[0].parameters, \"branch\", via.branch);\n  parseParameterNameToValue(field.valueSets[0].parameters, \"received\", via.receivedAddress);\n\n  QString rportValue = \"\";\n  if (parseParameterNameToValue(field.valueSets[0].parameters, \"rport\", rportValue))\n  {\n    bool ok = false;\n    via.rportValue = rportValue.toUInt(&ok);\n\n    if (!ok)\n    {\n      via.rportValue = 0;\n    }\n  }\n\n  message->vias.push_back(via);\n\n  return true;\n}\n\n\nbool parseMaxForwardsField(SIPField& field,\n                           std::shared_ptr<SIPMessageInfo> message)\n{\n  Q_ASSERT(message);\n  Q_ASSERT(!field.valueSets.empty());\n\n  return field.valueSets[0].words.size() == 1 &&\n      parseUint(field.valueSets[0].words[0], message->maxForwards);\n}\n\n\nbool parseContactField(SIPField& field,\n                       std::shared_ptr<SIPMessageInfo> message)\n{\n  Q_ASSERT(message);\n  Q_ASSERT(!field.valueSets.empty());\n  return field.valueSets[0].words.size() == 1 &&\n      parseURI(field.valueSets[0].words, message->contact);\n\n  \/\/ TODO: parse expires parameter\n}\n\n\nbool parseContentTypeField(SIPField& field,\n                           std::shared_ptr<SIPMessageInfo> message)\n{\n  Q_ASSERT(message);\n  Q_ASSERT(!field.valueSets.empty());\n\n  QRegularExpression re_field(\"(\\\\w+\/\\\\w+)\");\n  QRegularExpressionMatch field_match = re_field.match(field.valueSets[0].words[0]);\n\n  if(field_match.hasMatch() && field_match.lastCapturedIndex() == 1)\n  {\n    message->content.type = stringToContentType(field_match.captured(1));\n    return true;\n  }\n  return false;\n}\n\n\nbool parseContentLengthField(SIPField& field,\n                             std::shared_ptr<SIPMessageInfo> message)\n{\n  Q_ASSERT(message);\n  Q_ASSERT(!field.valueSets.empty());\n  return field.valueSets[0].words.size() == 1 &&\n      parseUint(field.valueSets[0].words[0], message->content.length);\n}\n\n\nbool parseRecordRouteField(SIPField& field,\n                  std::shared_ptr<SIPMessageInfo> message)\n{\n  Q_ASSERT(message);\n  Q_ASSERT(!field.valueSets.empty());\n  message->recordRoutes.push_back(SIP_URI{});\n  return parseURI(field.valueSets[0].words, message->recordRoutes.back());\n}\n\n\nbool parseServerField(SIPField& field,\n                  std::shared_ptr<SIPMessageInfo> message)\n{\n  Q_ASSERT(message);\n  Q_ASSERT(!field.valueSets.empty());\n\n  if (field.valueSets[0].words.size() < 1\n      || field.valueSets[0].words.size() > 100)\n  {\n    return false;\n  }\n\n  message->server = field.valueSets[0].words[0];\n  return true;\n}\n\n\nbool parseUserAgentField(SIPField& field,\n                  std::shared_ptr<SIPMessageInfo> message)\n{\n  Q_ASSERT(message);\n  Q_ASSERT(!field.valueSets.empty());\n\n  if (field.valueSets[0].words.size() < 1\n      || field.valueSets[0].words.size() > 100)\n  {\n    return false;\n  }\n\n  message->userAgent = field.valueSets[0].words[0];\n  return true;\n}\n\n\nbool isLinePresent(QString name, QList<SIPField>& fields)\n{\n  for(SIPField field : fields)\n  {\n    if(field.name == name)\n    {\n      return true;\n    }\n  }\n  qDebug() << \"Did not find header:\" << name;\n  return false;\n}\n\n\nbool parseParameter(QString text, SIPParameter& parameter)\n{\n  QRegularExpression re_parameter(\"([^=]+)=?([^;]*)\");\n  QRegularExpressionMatch parameter_match = re_parameter.match(text);\n\n  if(parameter_match.hasMatch() && parameter_match.lastCapturedIndex() == 2)\n  {\n    parameter.name = parameter_match.captured(1);\n\n    if (parameter_match.captured(2) != \"\")\n    {\n      parameter.value = parameter_match.captured(2);\n    }\n\n    return true;\n  }\n\n  return false;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2011 Scientific Computation Research Center\n *\n * This work is open source software, licensed under the terms of the\n * BSD license as described in the LICENSE file in the top-level directory.\n *\/\n\n#include \"awrLinearSystem.h\"\n#include <AztecOO.h>\n#include <Epetra_MpiComm.h>\n#include <Epetra_Map.h>\n#include <Epetra_MultiVector.h>\n#include <Epetra_CrsMatrix.h>\n\nnamespace awr\n{\n\nLinearSystem::LinearSystem(GO n, Epetra_Map* map) :\n  numGlobalEqs_(n),\n  map_(map)\n{\n  numLocalEqs_ = map_->NumMyElements();\n  A_ = new Epetra_CrsMatrix(Copy,*map_,n);\n  x_ = new Epetra_MultiVector(*map_,\/*num vectors=*\/1);\n  b_ = new Epetra_MultiVector(*map_,\/*num vectors=*\/1);\n}\n\nLinearSystem::~LinearSystem()\n{\n  delete map_;\n  delete A_;\n  delete x_;\n  delete b_;\n}\n\nGO LinearSystem::mapLIDtoGID(LO lid)\n{\n  GO* myGlobalElements = NULL;\n  myGlobalElements = map_->MyGlobalElements64();\n  return myGlobalElements[lid];\n}\n\nvoid LinearSystem::sumToVector(double v, GO i)\n{\n  b_->SumIntoGlobalValue(i,\/*vec idx=*\/0,v);\n}\n\nvoid LinearSystem::replaceToVector(double v, GO i)\n{\n  b_->ReplaceGlobalValue(i,\/*vec idx=*\/0,v);\n}\n\nvoid LinearSystem::sumToMatrix(double v, GO i, GO j)\n{\n  double val[1]; val[0] = v;\n  GO col[1]; col[0] = j;\n  A_->InsertGlobalValues(i,1,val,col);\n}\n\nvoid LinearSystem::diagonalizeMatrixRow(GO i)\n{\n  int n;\n  double* v;\n  GO* j;\n  A_->ExtractGlobalRowView(i,n,v,j);\n  for (int i=0; i < n; ++i)\n    v[i] = 0.0;\n  this->sumToMatrix(1.0,i,i);\n}\n\nvoid LinearSystem::completeMatrixFill()\n{\n  A_->FillComplete();\n}\n\ndouble* LinearSystem::getSolution()\n{\n  double** sol;\n  x_->ExtractView(&sol);\n  return sol[0];\n}\n\nvoid LinearSystem::solve()\n{\n  Epetra_LinearProblem problem(A_,x_,b_);\n  AztecOO solver(problem);\n  solver.SetAztecOption(AZ_precond,AZ_Jacobi);\n  solver.SetAztecOption(AZ_output,AZ_none);\n  solver.Iterate(1000,1.0e-8);\n}\n\n}\n<commit_msg>silence shadow warning<commit_after>\/*\n * Copyright (C) 2011 Scientific Computation Research Center\n *\n * This work is open source software, licensed under the terms of the\n * BSD license as described in the LICENSE file in the top-level directory.\n *\/\n\n#include \"awrLinearSystem.h\"\n#include <AztecOO.h>\n#include <Epetra_MpiComm.h>\n#include <Epetra_Map.h>\n#include <Epetra_MultiVector.h>\n#include <Epetra_CrsMatrix.h>\n\nnamespace awr\n{\n\nLinearSystem::LinearSystem(GO n, Epetra_Map* map) :\n  numGlobalEqs_(n),\n  map_(map)\n{\n  numLocalEqs_ = map_->NumMyElements();\n  A_ = new Epetra_CrsMatrix(Copy,*map_,n);\n  x_ = new Epetra_MultiVector(*map_,\/*num vectors=*\/1);\n  b_ = new Epetra_MultiVector(*map_,\/*num vectors=*\/1);\n}\n\nLinearSystem::~LinearSystem()\n{\n  delete map_;\n  delete A_;\n  delete x_;\n  delete b_;\n}\n\nGO LinearSystem::mapLIDtoGID(LO lid)\n{\n  GO* myGlobalElements = NULL;\n  myGlobalElements = map_->MyGlobalElements64();\n  return myGlobalElements[lid];\n}\n\nvoid LinearSystem::sumToVector(double v, GO i)\n{\n  b_->SumIntoGlobalValue(i,\/*vec idx=*\/0,v);\n}\n\nvoid LinearSystem::replaceToVector(double v, GO i)\n{\n  b_->ReplaceGlobalValue(i,\/*vec idx=*\/0,v);\n}\n\nvoid LinearSystem::sumToMatrix(double v, GO i, GO j)\n{\n  double val[1]; val[0] = v;\n  GO col[1]; col[0] = j;\n  A_->InsertGlobalValues(i,1,val,col);\n}\n\nvoid LinearSystem::diagonalizeMatrixRow(GO i)\n{\n  int n;\n  double* v;\n  GO* j;\n  A_->ExtractGlobalRowView(i,n,v,j);\n  for (int k=0; k < n; ++k)\n    v[k] = 0.0;\n  this->sumToMatrix(1.0,i,i);\n}\n\nvoid LinearSystem::completeMatrixFill()\n{\n  A_->FillComplete();\n}\n\ndouble* LinearSystem::getSolution()\n{\n  double** sol;\n  x_->ExtractView(&sol);\n  return sol[0];\n}\n\nvoid LinearSystem::solve()\n{\n  Epetra_LinearProblem problem(A_,x_,b_);\n  AztecOO solver(problem);\n  solver.SetAztecOption(AZ_precond,AZ_Jacobi);\n  solver.SetAztecOption(AZ_output,AZ_none);\n  solver.Iterate(1000,1.0e-8);\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Copyright (c) 2009 Kevin Ottens <ervin@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 \"widget.h\"\n\n#include <akonadi\/collection.h>\n#include <akonadi\/item.h>\n#include <akonadi\/itemcopyjob.h>\n#include <akonadi\/itemmovejob.h>\n\n#include \"storagemodel.h\"\n#include \"core\/messageitem.h\"\n#include \"core\/view.h\"\n\n#include <QtCore\/QTimer>\n\n#include <QtGui\/QAction>\n#include <QtGui\/QApplication>\n#include <QtGui\/QDrag>\n#include <QtGui\/QDragMoveEvent>\n#include <QtGui\/QDropEvent>\n\n#include <KDE\/KDebug>\n#include <KDE\/KIcon>\n#include <KDE\/KIconLoader>\n#include <KDE\/KLocale>\n#include <KDE\/KMenu>\n\nnamespace MessageList\n{\n\nclass Widget::Private\n{\npublic:\n  Private( Widget *owner )\n    : q( owner ) { }\n\n  Akonadi::Item::List selectionAsItems() const;\n  Akonadi::Item itemForRow( int row ) const;\n\n  Widget * const q;\n\n  int mLastSelectedMessage;\n};\n\n} \/\/ namespace MessageList\n\nusing namespace MessageList;\nusing namespace Akonadi;\n\nstruct DragPayload\n{\n  QList<Collection::Id> sourceCollections;\n  QList<Item::Id> items;\n  bool readOnly;\n\n  DragPayload() : readOnly( false ) { }\n\n  static QString mimeType()\n  {\n    return \"x-akonadi-drag\/message-list\";\n  }\n};\n\nQDataStream &operator<<(QDataStream &stream, const DragPayload &payload)\n{\n  stream << payload.sourceCollections;\n  stream << payload.items;\n  stream << payload.readOnly;\n\n  return stream;\n}\n\nQDataStream &operator>>(QDataStream &stream, DragPayload &payload)\n{\n  stream >> payload.sourceCollections;\n  stream >> payload.items;\n  stream >> payload.readOnly;\n\n  return stream;\n}\n\nWidget::Widget( QWidget *parent )\n  : Core::Widget( parent ), d( new Private( this ) )\n{\n  QTimer::singleShot( 0, this, SLOT( populateStatusFilterCombo() ) );\n}\n\nWidget::~Widget()\n{\n  delete d;\n}\n\nbool Widget::canAcceptDrag( const QDragMoveEvent * e )\n{\n  Collection::List collections = static_cast<const StorageModel*>( storageModel() )->displayedCollections();\n\n  if ( collections.size()!=1 )\n    return false; \/\/ no folder here or too many (in case we can't decide where the drop will end)\n\n  Collection c = collections.first();\n\n  if ( ( c.rights() & Collection::CanCreateItem ) == 0 )\n    return false; \/\/ no way to drag into\n\n  if ( !e->mimeData()->hasFormat( DragPayload::mimeType() ) )\n    return false; \/\/ no way to decode it\n\n  DragPayload payload;\n  QDataStream stream( e->mimeData()->data( DragPayload::mimeType() ) );\n  stream >> payload;\n\n  foreach ( Collection::Id id, payload.sourceCollections ) {\n    if ( id == c.id() ) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\nbool Widget::selectNextMessageItem( MessageList::Core::MessageTypeFilter messageTypeFilter,\n                                    MessageList::Core::ExistingSelectionBehaviour existingSelectionBehaviour,\n                                    bool centerItem,\n                                    bool loop )\n{\n  return view()->selectNextMessageItem( messageTypeFilter, existingSelectionBehaviour, centerItem, loop );\n}\n\nbool Widget::selectPreviousMessageItem( MessageList::Core::MessageTypeFilter messageTypeFilter,\n                                        MessageList::Core::ExistingSelectionBehaviour existingSelectionBehaviour,\n                                        bool centerItem,\n                                        bool loop )\n{\n  return view()->selectPreviousMessageItem( messageTypeFilter, existingSelectionBehaviour, centerItem, loop );\n}\n\nbool Widget::focusNextMessageItem( MessageList::Core::MessageTypeFilter messageTypeFilter, bool centerItem, bool loop )\n{\n  return view()->focusNextMessageItem( messageTypeFilter, centerItem, loop );\n}\n\nbool Widget::focusPreviousMessageItem( MessageList::Core::MessageTypeFilter messageTypeFilter, bool centerItem, bool loop )\n{\n  return view()->focusNextMessageItem( messageTypeFilter, centerItem, loop );\n}\n\nvoid Widget::selectFocusedMessageItem( bool centerItem )\n{\n  view()->selectFocusedMessageItem( centerItem );\n}\n\nbool Widget::selectFirstMessageItem( MessageList::Core::MessageTypeFilter messageTypeFilter, bool centerItem )\n{\n  return view()->selectFirstMessageItem( messageTypeFilter, centerItem );\n}\n\nvoid Widget::selectAll()\n{\n  view()->setAllGroupsExpanded( true );\n  view()->selectAll();\n}\n\nvoid Widget::setCurrentThreadExpanded( bool expand )\n{\n  view()->setCurrentThreadExpanded(expand );\n}\n\nvoid Widget::setAllThreadsExpanded( bool expand )\n{\n  view()->setAllThreadsExpanded( expand );\n}\n\nvoid Widget::setAllGroupsExpanded( bool expand )\n{\n  view()->setAllGroupsExpanded(expand);\n}\n\n\nvoid Widget::viewMessageSelected( MessageList::Core::MessageItem *msg )\n{\n  int row = -1;\n  if ( msg ) {\n    row = msg->currentModelIndexRow();\n  }\n\n  if ( !msg || !msg->isValid() || !storageModel() ) {\n    d->mLastSelectedMessage = -1;\n    emit messageSelected( Item() );\n    return;\n  }\n\n  Q_ASSERT( row >= 0 );\n\n  d->mLastSelectedMessage = row;\n\n  emit messageSelected( d->itemForRow( row ) ); \/\/ this MAY be null\n}\n\nvoid Widget::viewMessageActivated( MessageList::Core::MessageItem *msg )\n{\n  Q_ASSERT( msg ); \/\/ must not be null\n  Q_ASSERT( storageModel() );\n\n  if ( !msg->isValid() ) {\n    return;\n  }\n\n  int row = msg->currentModelIndexRow();\n  Q_ASSERT( row >= 0 );\n\n  \/\/ The assert below may fail when quickly opening and closing a non-selected thread.\n  \/\/ This will actually activate the item without selecting it...\n  \/\/Q_ASSERT( d->mLastSelectedMessage == row );\n\n  if ( d->mLastSelectedMessage != row ) {\n    \/\/ Very ugly. We are activating a non selected message.\n    \/\/ This is very likely a double click on the plus sign near a thread leader.\n    \/\/ Dealing with mLastSelectedMessage here would be expensive: it would involve releasing the last selected,\n    \/\/ emitting signals, handling recursion... ugly.\n    \/\/ We choose a very simple solution: double clicking on the plus sign near a thread leader does\n    \/\/ NOT activate the message (i.e open it in a toplevel window) if it isn't previously selected.\n    return;\n  }\n\n  emit messageActivated( d->itemForRow( row ) ); \/\/ this MAY be null\n}\n\nvoid Widget::viewSelectionChanged()\n{\n  emit selectionChanged();\n  if ( !currentMessageItem() ) {\n    emit messageSelected( Item() );\n  }\n}\n\nvoid Widget::viewMessageListContextPopupRequest( const QList< MessageList::Core::MessageItem * > &selectedItems, const QPoint &globalPos )\n{\n  \/\/FIXME: To implement once the other infrastructure is ready for a KMail independent implementation\n  kWarning() << \"Needs to be reimplemented\";\n}\n\nvoid Widget::viewMessageStatusChangeRequest( MessageList::Core::MessageItem *msg, const KPIM::MessageStatus &set, const KPIM::MessageStatus &clear )\n{\n  Q_ASSERT( msg ); \/\/ must not be null\n  Q_ASSERT( storageModel() );\n\n  if ( !msg->isValid() ) {\n    return;\n  }\n\n  int row = msg->currentModelIndexRow();\n  Q_ASSERT( row >= 0 );\n\n  Item item = d->itemForRow( row );\n  Q_ASSERT( item.isValid() );\n\n  emit messageStatusChangeRequest( item, set, clear );\n}\n\nvoid Widget::viewGroupHeaderContextPopupRequest( MessageList::Core::GroupHeaderItem *ghi, const QPoint &globalPos )\n{\n  Q_UNUSED( ghi );\n\n  KMenu menu( this );\n\n  QAction *act;\n\n  menu.addSeparator();\n\n  act = menu.addAction( i18n( \"Expand All Groups\" ) );\n  connect( act, SIGNAL( triggered( bool ) ),\n           view(), SLOT( slotExpandAllGroups() ) );\n\n  act = menu.addAction( i18n( \"Collapse All Groups\" ) );\n  connect( act, SIGNAL( triggered( bool ) ),\n           view(), SLOT( slotCollapseAllGroups() ) );\n\n  menu.exec( globalPos );\n}\n\nvoid Widget::viewDragEnterEvent( QDragEnterEvent *e )\n{\n  if ( !canAcceptDrag( e ) ) {\n    e->ignore();\n    return;\n  }\n\n  e->accept();\n}\n\nvoid Widget::viewDragMoveEvent( QDragMoveEvent *e )\n{\n  if ( !canAcceptDrag( e ) ) {\n    e->ignore();\n    return;\n  }\n\n  e->accept();\n}\n\nenum DragMode\n{\n  DragCopy,\n  DragMove,\n  DragCancel\n};\n\nvoid Widget::viewDropEvent( QDropEvent *e )\n{\n  Collection::List collections = static_cast<const StorageModel*>( storageModel() )->displayedCollections();\n\n  if ( collections.size()!=1 || !e->mimeData()->hasFormat( DragPayload::mimeType() ) ) {\n    \/\/ no folder here or too many (in case we can't decide where the drop will end), or we can't decode\n    e->ignore();\n    return;\n  }\n\n  DragPayload payload;\n  QDataStream stream( e->mimeData()->data( DragPayload::mimeType() ) );\n  stream >> payload;\n\n  if ( payload.items.isEmpty() ) {\n    kWarning() << \"Could not decode drag data!\";\n    e->ignore();\n    return;\n  }\n\n  e->accept();\n\n  int action;\n  if ( payload.readOnly ) {\n    action = DragCopy;\n  } else {\n    action = DragCancel;\n    int keybstate = QApplication::keyboardModifiers();\n    if ( keybstate & Qt::CTRL ) {\n      action = DragCopy;\n\n    } else if ( keybstate & Qt::SHIFT ) {\n      action = DragMove;\n\n    } else {\n      \/\/ FIXME: This code is duplicated almost exactly in FolderView... shouldn't we share ?\n      KMenu menu;\n      QAction *moveAction = menu.addAction( KIcon( \"go-jump\"), i18n( \"&Move Here\" ) );\n      QAction *copyAction = menu.addAction( KIcon( \"edit-copy\" ), i18n( \"&Copy Here\" ) );\n      menu.addSeparator();\n      menu.addAction( KIcon( \"dialog-cancel\" ), i18n( \"C&ancel\" ) );\n\n      QAction *menuChoice = menu.exec( QCursor::pos() );\n      if ( menuChoice == moveAction ) {\n        action = DragMove;\n      } else if ( menuChoice == copyAction ) {\n        action = DragCopy;\n      } else {\n        action = DragCancel;\n      }\n    }\n  }\n\n  Collection target = collections.first();\n  Item::List items;\n  foreach ( Item::Id id, payload.items ) {\n    items << Item( id );\n  }\n\n  if ( action == DragCopy ) {\n    new ItemCopyJob( items, target, this );\n  } else if ( action == DragMove ) {\n    new ItemMoveJob( items, target, this );\n  }\n}\n\n\nvoid Widget::viewStartDragRequest()\n{\n  Collection::List collections = static_cast<const StorageModel*>( storageModel() )->displayedCollections();\n\n  if ( collections.isEmpty() )\n    return; \/\/ no folder here\n\n  QList<Item> items = d->selectionAsItems();\n  if ( items.isEmpty() )\n    return;\n\n  DragPayload payload;\n\n  foreach ( const Collection c, collections ) {\n    payload.sourceCollections << c.id();\n    \/\/ We won't be able to remove items from this collection\n    if ( ( c.rights() & Collection::CanDeleteItem ) == 0 ) {\n      \/\/ So the drag will be read-only\n      payload.readOnly = true;\n    }\n  }\n\n  foreach ( const Item i, items ) {\n    payload.items << i.id();\n  }\n\n  QByteArray data;\n  {\n    QDataStream stream( &data, QIODevice::WriteOnly );\n    stream << payload;\n  }\n\n  QMimeData *mimeData = new QMimeData;\n  mimeData->setData( DragPayload::mimeType(), data );\n\n  QDrag *drag = new QDrag( view()->viewport() );\n  drag->setMimeData( mimeData );\n\n  \/\/ Set pixmap\n  QPixmap pixmap;\n  if( items.size() == 1 ) {\n    pixmap = QPixmap( DesktopIcon(\"mail-message\", KIconLoader::SizeSmall) );\n  } else {\n    pixmap = QPixmap( DesktopIcon(\"document-multiple\", KIconLoader::SizeSmall) );\n  }\n\n  \/\/ Calculate hotspot (as in Konqueror)\n  if( !pixmap.isNull() ) {\n    drag->setHotSpot( QPoint( pixmap.width() \/ 2, pixmap.height() \/ 2 ) );\n    drag->setPixmap( pixmap );\n  }\n\n  if ( payload.readOnly )\n    drag->exec( Qt::CopyAction );\n  else\n    drag->exec( Qt::CopyAction | Qt::MoveAction );\n}\n\nItem::List Widget::Private::selectionAsItems() const\n{\n  Item::List res;\n  QList<Core::MessageItem *> selection = q->view()->selectionAsMessageItemList();\n\n  foreach ( Core::MessageItem *mi, selection ) {\n    Item i = itemForRow( mi->currentModelIndexRow() );\n    Q_ASSERT( i.isValid() );\n    res << i;\n  }\n\n  return res;\n}\n\nItem Widget::Private::itemForRow( int row ) const\n{\n  return static_cast<const StorageModel*>( q->storageModel() )->itemForRow( row );\n}\n<commit_msg>SVN_MERGE<commit_after>\/*\n    Copyright (c) 2009 Kevin Ottens <ervin@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 \"widget.h\"\n\n#include <akonadi\/collection.h>\n#include <akonadi\/item.h>\n#include <akonadi\/itemcopyjob.h>\n#include <akonadi\/itemmovejob.h>\n\n#include \"storagemodel.h\"\n#include \"core\/messageitem.h\"\n#include \"core\/view.h\"\n\n#include <QtCore\/QTimer>\n\n#include <QtGui\/QAction>\n#include <QtGui\/QApplication>\n#include <QtGui\/QDrag>\n#include <QtGui\/QDragMoveEvent>\n#include <QtGui\/QDropEvent>\n\n#include <KDE\/KDebug>\n#include <KDE\/KIcon>\n#include <KDE\/KIconLoader>\n#include <KDE\/KLocale>\n#include <KDE\/KMenu>\n\nnamespace MessageList\n{\n\nclass Widget::Private\n{\npublic:\n  Private( Widget *owner )\n    : q( owner ) { }\n\n  Akonadi::Item::List selectionAsItems() const;\n  Akonadi::Item itemForRow( int row ) const;\n\n  Widget * const q;\n\n  int mLastSelectedMessage;\n};\n\n} \/\/ namespace MessageList\n\nusing namespace MessageList;\nusing namespace Akonadi;\n\nstruct DragPayload\n{\n  QList<Collection::Id> sourceCollections;\n  QList<Item::Id> items;\n  bool readOnly;\n\n  DragPayload() : readOnly( false ) { }\n\n  static QString mimeType()\n  {\n    return \"x-akonadi-drag\/message-list\";\n  }\n};\n\nQDataStream &operator<<(QDataStream &stream, const DragPayload &payload)\n{\n  stream << payload.sourceCollections;\n  stream << payload.items;\n  stream << payload.readOnly;\n\n  return stream;\n}\n\nQDataStream &operator>>(QDataStream &stream, DragPayload &payload)\n{\n  stream >> payload.sourceCollections;\n  stream >> payload.items;\n  stream >> payload.readOnly;\n\n  return stream;\n}\n\nWidget::Widget( QWidget *parent )\n  : Core::Widget( parent ), d( new Private( this ) )\n{\n  populateStatusFilterCombo();\n}\n\nWidget::~Widget()\n{\n  delete d;\n}\n\nbool Widget::canAcceptDrag( const QDragMoveEvent * e )\n{\n  Collection::List collections = static_cast<const StorageModel*>( storageModel() )->displayedCollections();\n\n  if ( collections.size()!=1 )\n    return false; \/\/ no folder here or too many (in case we can't decide where the drop will end)\n\n  Collection c = collections.first();\n\n  if ( ( c.rights() & Collection::CanCreateItem ) == 0 )\n    return false; \/\/ no way to drag into\n\n  if ( !e->mimeData()->hasFormat( DragPayload::mimeType() ) )\n    return false; \/\/ no way to decode it\n\n  DragPayload payload;\n  QDataStream stream( e->mimeData()->data( DragPayload::mimeType() ) );\n  stream >> payload;\n\n  foreach ( Collection::Id id, payload.sourceCollections ) {\n    if ( id == c.id() ) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\nbool Widget::selectNextMessageItem( MessageList::Core::MessageTypeFilter messageTypeFilter,\n                                    MessageList::Core::ExistingSelectionBehaviour existingSelectionBehaviour,\n                                    bool centerItem,\n                                    bool loop )\n{\n  return view()->selectNextMessageItem( messageTypeFilter, existingSelectionBehaviour, centerItem, loop );\n}\n\nbool Widget::selectPreviousMessageItem( MessageList::Core::MessageTypeFilter messageTypeFilter,\n                                        MessageList::Core::ExistingSelectionBehaviour existingSelectionBehaviour,\n                                        bool centerItem,\n                                        bool loop )\n{\n  return view()->selectPreviousMessageItem( messageTypeFilter, existingSelectionBehaviour, centerItem, loop );\n}\n\nbool Widget::focusNextMessageItem( MessageList::Core::MessageTypeFilter messageTypeFilter, bool centerItem, bool loop )\n{\n  return view()->focusNextMessageItem( messageTypeFilter, centerItem, loop );\n}\n\nbool Widget::focusPreviousMessageItem( MessageList::Core::MessageTypeFilter messageTypeFilter, bool centerItem, bool loop )\n{\n  return view()->focusNextMessageItem( messageTypeFilter, centerItem, loop );\n}\n\nvoid Widget::selectFocusedMessageItem( bool centerItem )\n{\n  view()->selectFocusedMessageItem( centerItem );\n}\n\nbool Widget::selectFirstMessageItem( MessageList::Core::MessageTypeFilter messageTypeFilter, bool centerItem )\n{\n  return view()->selectFirstMessageItem( messageTypeFilter, centerItem );\n}\n\nvoid Widget::selectAll()\n{\n  view()->setAllGroupsExpanded( true );\n  view()->selectAll();\n}\n\nvoid Widget::setCurrentThreadExpanded( bool expand )\n{\n  view()->setCurrentThreadExpanded(expand );\n}\n\nvoid Widget::setAllThreadsExpanded( bool expand )\n{\n  view()->setAllThreadsExpanded( expand );\n}\n\nvoid Widget::setAllGroupsExpanded( bool expand )\n{\n  view()->setAllGroupsExpanded(expand);\n}\n\n\nvoid Widget::viewMessageSelected( MessageList::Core::MessageItem *msg )\n{\n  int row = -1;\n  if ( msg ) {\n    row = msg->currentModelIndexRow();\n  }\n\n  if ( !msg || !msg->isValid() || !storageModel() ) {\n    d->mLastSelectedMessage = -1;\n    emit messageSelected( Item() );\n    return;\n  }\n\n  Q_ASSERT( row >= 0 );\n\n  d->mLastSelectedMessage = row;\n\n  emit messageSelected( d->itemForRow( row ) ); \/\/ this MAY be null\n}\n\nvoid Widget::viewMessageActivated( MessageList::Core::MessageItem *msg )\n{\n  Q_ASSERT( msg ); \/\/ must not be null\n  Q_ASSERT( storageModel() );\n\n  if ( !msg->isValid() ) {\n    return;\n  }\n\n  int row = msg->currentModelIndexRow();\n  Q_ASSERT( row >= 0 );\n\n  \/\/ The assert below may fail when quickly opening and closing a non-selected thread.\n  \/\/ This will actually activate the item without selecting it...\n  \/\/Q_ASSERT( d->mLastSelectedMessage == row );\n\n  if ( d->mLastSelectedMessage != row ) {\n    \/\/ Very ugly. We are activating a non selected message.\n    \/\/ This is very likely a double click on the plus sign near a thread leader.\n    \/\/ Dealing with mLastSelectedMessage here would be expensive: it would involve releasing the last selected,\n    \/\/ emitting signals, handling recursion... ugly.\n    \/\/ We choose a very simple solution: double clicking on the plus sign near a thread leader does\n    \/\/ NOT activate the message (i.e open it in a toplevel window) if it isn't previously selected.\n    return;\n  }\n\n  emit messageActivated( d->itemForRow( row ) ); \/\/ this MAY be null\n}\n\nvoid Widget::viewSelectionChanged()\n{\n  emit selectionChanged();\n  if ( !currentMessageItem() ) {\n    emit messageSelected( Item() );\n  }\n}\n\nvoid Widget::viewMessageListContextPopupRequest( const QList< MessageList::Core::MessageItem * > &selectedItems, const QPoint &globalPos )\n{\n  \/\/FIXME: To implement once the other infrastructure is ready for a KMail independent implementation\n  kWarning() << \"Needs to be reimplemented\";\n}\n\nvoid Widget::viewMessageStatusChangeRequest( MessageList::Core::MessageItem *msg, const KPIM::MessageStatus &set, const KPIM::MessageStatus &clear )\n{\n  Q_ASSERT( msg ); \/\/ must not be null\n  Q_ASSERT( storageModel() );\n\n  if ( !msg->isValid() ) {\n    return;\n  }\n\n  int row = msg->currentModelIndexRow();\n  Q_ASSERT( row >= 0 );\n\n  Item item = d->itemForRow( row );\n  Q_ASSERT( item.isValid() );\n\n  emit messageStatusChangeRequest( item, set, clear );\n}\n\nvoid Widget::viewGroupHeaderContextPopupRequest( MessageList::Core::GroupHeaderItem *ghi, const QPoint &globalPos )\n{\n  Q_UNUSED( ghi );\n\n  KMenu menu( this );\n\n  QAction *act;\n\n  menu.addSeparator();\n\n  act = menu.addAction( i18n( \"Expand All Groups\" ) );\n  connect( act, SIGNAL( triggered( bool ) ),\n           view(), SLOT( slotExpandAllGroups() ) );\n\n  act = menu.addAction( i18n( \"Collapse All Groups\" ) );\n  connect( act, SIGNAL( triggered( bool ) ),\n           view(), SLOT( slotCollapseAllGroups() ) );\n\n  menu.exec( globalPos );\n}\n\nvoid Widget::viewDragEnterEvent( QDragEnterEvent *e )\n{\n  if ( !canAcceptDrag( e ) ) {\n    e->ignore();\n    return;\n  }\n\n  e->accept();\n}\n\nvoid Widget::viewDragMoveEvent( QDragMoveEvent *e )\n{\n  if ( !canAcceptDrag( e ) ) {\n    e->ignore();\n    return;\n  }\n\n  e->accept();\n}\n\nenum DragMode\n{\n  DragCopy,\n  DragMove,\n  DragCancel\n};\n\nvoid Widget::viewDropEvent( QDropEvent *e )\n{\n  Collection::List collections = static_cast<const StorageModel*>( storageModel() )->displayedCollections();\n\n  if ( collections.size()!=1 || !e->mimeData()->hasFormat( DragPayload::mimeType() ) ) {\n    \/\/ no folder here or too many (in case we can't decide where the drop will end), or we can't decode\n    e->ignore();\n    return;\n  }\n\n  DragPayload payload;\n  QDataStream stream( e->mimeData()->data( DragPayload::mimeType() ) );\n  stream >> payload;\n\n  if ( payload.items.isEmpty() ) {\n    kWarning() << \"Could not decode drag data!\";\n    e->ignore();\n    return;\n  }\n\n  e->accept();\n\n  int action;\n  if ( payload.readOnly ) {\n    action = DragCopy;\n  } else {\n    action = DragCancel;\n    int keybstate = QApplication::keyboardModifiers();\n    if ( keybstate & Qt::CTRL ) {\n      action = DragCopy;\n\n    } else if ( keybstate & Qt::SHIFT ) {\n      action = DragMove;\n\n    } else {\n      \/\/ FIXME: This code is duplicated almost exactly in FolderView... shouldn't we share ?\n      KMenu menu;\n      QAction *moveAction = menu.addAction( KIcon( \"go-jump\"), i18n( \"&Move Here\" ) );\n      QAction *copyAction = menu.addAction( KIcon( \"edit-copy\" ), i18n( \"&Copy Here\" ) );\n      menu.addSeparator();\n      menu.addAction( KIcon( \"dialog-cancel\" ), i18n( \"C&ancel\" ) );\n\n      QAction *menuChoice = menu.exec( QCursor::pos() );\n      if ( menuChoice == moveAction ) {\n        action = DragMove;\n      } else if ( menuChoice == copyAction ) {\n        action = DragCopy;\n      } else {\n        action = DragCancel;\n      }\n    }\n  }\n\n  Collection target = collections.first();\n  Item::List items;\n  foreach ( Item::Id id, payload.items ) {\n    items << Item( id );\n  }\n\n  if ( action == DragCopy ) {\n    new ItemCopyJob( items, target, this );\n  } else if ( action == DragMove ) {\n    new ItemMoveJob( items, target, this );\n  }\n}\n\n\nvoid Widget::viewStartDragRequest()\n{\n  Collection::List collections = static_cast<const StorageModel*>( storageModel() )->displayedCollections();\n\n  if ( collections.isEmpty() )\n    return; \/\/ no folder here\n\n  QList<Item> items = d->selectionAsItems();\n  if ( items.isEmpty() )\n    return;\n\n  DragPayload payload;\n\n  foreach ( const Collection c, collections ) {\n    payload.sourceCollections << c.id();\n    \/\/ We won't be able to remove items from this collection\n    if ( ( c.rights() & Collection::CanDeleteItem ) == 0 ) {\n      \/\/ So the drag will be read-only\n      payload.readOnly = true;\n    }\n  }\n\n  foreach ( const Item i, items ) {\n    payload.items << i.id();\n  }\n\n  QByteArray data;\n  {\n    QDataStream stream( &data, QIODevice::WriteOnly );\n    stream << payload;\n  }\n\n  QMimeData *mimeData = new QMimeData;\n  mimeData->setData( DragPayload::mimeType(), data );\n\n  QDrag *drag = new QDrag( view()->viewport() );\n  drag->setMimeData( mimeData );\n\n  \/\/ Set pixmap\n  QPixmap pixmap;\n  if( items.size() == 1 ) {\n    pixmap = QPixmap( DesktopIcon(\"mail-message\", KIconLoader::SizeSmall) );\n  } else {\n    pixmap = QPixmap( DesktopIcon(\"document-multiple\", KIconLoader::SizeSmall) );\n  }\n\n  \/\/ Calculate hotspot (as in Konqueror)\n  if( !pixmap.isNull() ) {\n    drag->setHotSpot( QPoint( pixmap.width() \/ 2, pixmap.height() \/ 2 ) );\n    drag->setPixmap( pixmap );\n  }\n\n  if ( payload.readOnly )\n    drag->exec( Qt::CopyAction );\n  else\n    drag->exec( Qt::CopyAction | Qt::MoveAction );\n}\n\nItem::List Widget::Private::selectionAsItems() const\n{\n  Item::List res;\n  QList<Core::MessageItem *> selection = q->view()->selectionAsMessageItemList();\n\n  foreach ( Core::MessageItem *mi, selection ) {\n    Item i = itemForRow( mi->currentModelIndexRow() );\n    Q_ASSERT( i.isValid() );\n    res << i;\n  }\n\n  return res;\n}\n\nItem Widget::Private::itemForRow( int row ) const\n{\n  return static_cast<const StorageModel*>( q->storageModel() )->itemForRow( row );\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Mac XCode 11 doesn't define HOST_NAME_MAX<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ This file is part of the dune-stuff project:\n\/\/   https:\/\/github.com\/wwu-numerik\/dune-stuff\n\/\/ Copyright holders: Rene Milk, Felix Schindler\n\/\/ License: BSD 2-Clause License (http:\/\/opensource.org\/licenses\/BSD-2-Clause)\n\n#ifndef DUNE_STUFF_GRID_INFORMATION_HH\n#define DUNE_STUFF_GRID_INFORMATION_HH\n\n#include <ostream>\n\n#include <boost\/format.hpp>\n#include <boost\/range\/adaptor\/reversed.hpp>\n\n#include <dune\/common\/unused.hh>\n\n#include <dune\/grid\/common\/gridview.hh>\n\n#include <dune\/stuff\/common\/math.hh>\n#include <dune\/stuff\/grid\/intersection.hh>\n#include <dune\/stuff\/common\/ranges.hh>\n#include <dune\/stuff\/grid\/walk.hh>\n#include <dune\/stuff\/aliases.hh>\n#include <dune\/stuff\/grid\/entity.hh>\n\n\nnamespace Dune {\nnamespace Stuff {\nnamespace Grid {\n\nusing namespace Dune::Stuff::Common;\n\nstruct Statistics {\n  size_t numberOfEntities;\n  size_t numberOfIntersections;\n  size_t numberOfInnerIntersections;\n  size_t numberOfBoundaryIntersections;\n  double maxGridWidth;\n  template <class GridViewType>\n  Statistics(const GridViewType& gridView)\n    : numberOfEntities(gridView.size(0)), numberOfIntersections(0), numberOfInnerIntersections(0)\n    , numberOfBoundaryIntersections(0), maxGridWidth(0)\n  {\n    for (const auto& entity : entityRange(gridView)) {\n      for (const auto& intIt : intersectionRange(gridView, entity)) {\n        ++numberOfIntersections;\n        maxGridWidth = std::max(intIt.geometry().volume(), maxGridWidth);\n        \/\/ if we are inside the grid\n        numberOfInnerIntersections += ( intIt.neighbor() && !intIt.boundary() );\n        \/\/ if we are on the boundary of the grid\n        numberOfBoundaryIntersections += ( !intIt.neighbor() && intIt.boundary() );\n      }\n    }\n  }\n};\n\n\/** \\brief grid statistic output to given stream\n   *\/\ntemplate< class GridViewType >\nvoid printInfo(const GridViewType& gridView, std::ostream& out) {\n  const Statistics st(gridView);\n  out << \"found \" << st.numberOfEntities << \" entities,\" << std::endl;\n  out << \"found \" << st.numberOfIntersections << \" intersections,\" << std::endl;\n  out << \"      \" << st.numberOfInnerIntersections << \" intersections inside and\" << std::endl;\n  out << \"      \" << st.numberOfBoundaryIntersections << \" intersections on the boundary.\" << std::endl;\n  out << \"      maxGridWidth is \" << st.maxGridWidth << std::endl;\n} \/\/ printGridInformation\n\n  \/**\n  * \\attention Not optimal, does a whole grid walk!\n  **\/\ntemplate< class GridViewType >\nsize_t maxNumberOfNeighbors(const GridViewType& gridView)\n{\n  size_t maxNeighbours = 0;\n  for (const auto& entity : entityRange(gridView)) {\n    size_t neighbours = 0;\n    for (const auto& DUNE_UNUSED(i) : intersectionRange(gridView, entity)) {\n      ++neighbours;\n    }\n    maxNeighbours = std::max(maxNeighbours, neighbours);\n  }\n  return maxNeighbours;\n} \/\/ size_t maxNumberOfNeighbors(const GridPartType& gridPart)\n\n\/\/! Provide min\/max coordinates for all space dimensions of a GridView\ntemplate< class GridViewType >\nstruct Dimensions\n{\n  static_assert(std::is_base_of<GridView<typename GridViewType::Traits>, GridViewType>::value,\n                \"GridViewType is no GridView\");\n  typedef typename GridViewType::Grid GridType;\n  \/\/! automatic running min\/max\n  typedef Dune::Stuff::Common::MinMaxAvg< typename GridType::ctype >\n    MinMaxAvgType;\n  typedef std::array< MinMaxAvgType, GridType::dimensionworld >\n    CoordLimitsType;\n  typedef typename GridType::template Codim<0>::Entity EntityType;\n  CoordLimitsType coord_limits;\n  MinMaxAvgType entity_volume;\n  MinMaxAvgType entity_width;\n\n  \/\/! gridwalk functor that does the actual work for \\ref GridDimensions\n  class GridDimensionsFunctor\n  {\n    CoordLimitsType& coord_limits_;\n    MinMaxAvgType& entity_volume_;\n    MinMaxAvgType& entity_width_;\n\n    public:\n      GridDimensionsFunctor(CoordLimitsType& c, MinMaxAvgType& e, MinMaxAvgType& w)\n        : coord_limits_(c)\n        , entity_volume_(e)\n        , entity_width_(w) {}\n\n      template< class Entity >\n      void operator()(const Entity& ent, const size_t \/*ent_idx*\/) {\n        const auto& geo = ent.geometry();\n        entity_volume_( geo.volume() );\n        entity_width_(entity_diameter(ent));\n        for (decltype(geo.corners()) i = 0; i < geo.corners(); ++i)\n        {\n          const auto& corner( geo.corner(i) );\n          for (size_t k = 0; k < GridType::dimensionworld; ++k)\n            coord_limits_[k](corner[k]);\n        }\n      } \/\/ ()\n  };\n\n  double volumeRelation() const\n  { return entity_volume.min() != 0.0 ? entity_volume.max() \/ entity_volume.min() : -1; }\n\n  Dimensions(const GridViewType& gridView) {\n    GridDimensionsFunctor f(coord_limits, entity_volume, entity_width);\n    GridWalk< GridViewType >(gridView).operator()(f);\n  }\n\n  Dimensions(const EntityType& entity) {\n    GridDimensionsFunctor f(coord_limits, entity_volume, entity_width);\n    f(entity, 0);\n  }\n};\n\ntemplate <class GridType>\nDimensions<typename GridType::LeafGridViewType> dimensions(const GridType& grid) {\n  return Dimensions<typename GridType::LeafGridViewType>(grid.leafGridView());\n}\n\ntemplate <class GridViewType >\nDimensions<GridViewType> dimensions(const GridViewType& gridView) {\n  return Dimensions<GridViewType>(gridView);\n}\n\ntemplate <class GridViewType>\nDimensions<GridViewType> dimensions(const typename GridViewType::Grid::template Codim<0>::Entity& entity) {\n  return Dimensions<GridViewType>(entity);\n}\n\n} \/\/ namespace Grid\n} \/\/ end of namespace Stuff\n} \/\/ namespace Dune\n\ntemplate< class T >\ninline std::ostream& operator<<(std::ostream& s, const DSG::Dimensions< T >& d) {\n  for (size_t k = 0; k < T::dimensionworld; ++k)\n  {\n    const auto& mma = d.coord_limits[k];\n    s << boost::format(\"x%d\\tmin: %e\\tavg: %e\\tmax: %e\\n\")\n      % k\n      % mma.min()\n      % mma.average()\n      % mma.max();\n  }\n  s << boost::format(\"Entity vol min: %e\\tavg: %e\\tmax: %e\\tQout: %e\")\n    % d.entity_volume.min()\n    % d.entity_volume.average()\n    % d.entity_volume.max()\n    % d.volumeRelation();\n  s << std::endl;\n  return s;\n} \/\/ <<\n#endif \/\/ DUNE_STUFF_GRID_INFORMATION_HH\n<commit_msg>[grid.information] use valueRange, refs #10<commit_after>\/\/ This file is part of the dune-stuff project:\n\/\/   https:\/\/github.com\/wwu-numerik\/dune-stuff\n\/\/ Copyright holders: Rene Milk, Felix Schindler\n\/\/ License: BSD 2-Clause License (http:\/\/opensource.org\/licenses\/BSD-2-Clause)\n\n#ifndef DUNE_STUFF_GRID_INFORMATION_HH\n#define DUNE_STUFF_GRID_INFORMATION_HH\n\n#include <ostream>\n\n#include <boost\/format.hpp>\n#include <boost\/range\/adaptor\/reversed.hpp>\n\n#include <dune\/common\/unused.hh>\n\n#include <dune\/grid\/common\/gridview.hh>\n\n#include <dune\/stuff\/common\/math.hh>\n#include <dune\/stuff\/grid\/intersection.hh>\n#include <dune\/stuff\/common\/ranges.hh>\n#include <dune\/stuff\/grid\/walk.hh>\n#include <dune\/stuff\/aliases.hh>\n#include <dune\/stuff\/grid\/entity.hh>\n\n\nnamespace Dune {\nnamespace Stuff {\nnamespace Grid {\n\nusing namespace Dune::Stuff::Common;\n\nstruct Statistics {\n  size_t numberOfEntities;\n  size_t numberOfIntersections;\n  size_t numberOfInnerIntersections;\n  size_t numberOfBoundaryIntersections;\n  double maxGridWidth;\n  template <class GridViewType>\n  Statistics(const GridViewType& gridView)\n    : numberOfEntities(gridView.size(0)), numberOfIntersections(0), numberOfInnerIntersections(0)\n    , numberOfBoundaryIntersections(0), maxGridWidth(0)\n  {\n    for (const auto& entity : entityRange(gridView)) {\n      for (const auto& intIt : intersectionRange(gridView, entity)) {\n        ++numberOfIntersections;\n        maxGridWidth = std::max(intIt.geometry().volume(), maxGridWidth);\n        \/\/ if we are inside the grid\n        numberOfInnerIntersections += ( intIt.neighbor() && !intIt.boundary() );\n        \/\/ if we are on the boundary of the grid\n        numberOfBoundaryIntersections += ( !intIt.neighbor() && intIt.boundary() );\n      }\n    }\n  }\n};\n\n\/** \\brief grid statistic output to given stream\n   *\/\ntemplate< class GridViewType >\nvoid printInfo(const GridViewType& gridView, std::ostream& out) {\n  const Statistics st(gridView);\n  out << \"found \" << st.numberOfEntities << \" entities,\" << std::endl;\n  out << \"found \" << st.numberOfIntersections << \" intersections,\" << std::endl;\n  out << \"      \" << st.numberOfInnerIntersections << \" intersections inside and\" << std::endl;\n  out << \"      \" << st.numberOfBoundaryIntersections << \" intersections on the boundary.\" << std::endl;\n  out << \"      maxGridWidth is \" << st.maxGridWidth << std::endl;\n} \/\/ printGridInformation\n\n  \/**\n  * \\attention Not optimal, does a whole grid walk!\n  **\/\ntemplate< class GridViewType >\nsize_t maxNumberOfNeighbors(const GridViewType& gridView)\n{\n  size_t maxNeighbours = 0;\n  for (const auto& entity : entityRange(gridView)) {\n    size_t neighbours = 0;\n    for (const auto& DUNE_UNUSED(i) : intersectionRange(gridView, entity)) {\n      ++neighbours;\n    }\n    maxNeighbours = std::max(maxNeighbours, neighbours);\n  }\n  return maxNeighbours;\n} \/\/ size_t maxNumberOfNeighbors(const GridPartType& gridPart)\n\n\/\/! Provide min\/max coordinates for all space dimensions of a GridView\ntemplate< class GridViewType >\nstruct Dimensions\n{\n  static_assert(std::is_base_of<GridView<typename GridViewType::Traits>, GridViewType>::value,\n                \"GridViewType is no GridView\");\n  typedef typename GridViewType::Grid GridType;\n  \/\/! automatic running min\/max\n  typedef Dune::Stuff::Common::MinMaxAvg< typename GridType::ctype >\n    MinMaxAvgType;\n  typedef std::array< MinMaxAvgType, GridType::dimensionworld >\n    CoordLimitsType;\n  typedef typename GridType::template Codim<0>::Entity EntityType;\n  CoordLimitsType coord_limits;\n  MinMaxAvgType entity_volume;\n  MinMaxAvgType entity_width;\n\n  \/\/! gridwalk functor that does the actual work for \\ref GridDimensions\n  class GridDimensionsFunctor\n  {\n    CoordLimitsType& coord_limits_;\n    MinMaxAvgType& entity_volume_;\n    MinMaxAvgType& entity_width_;\n\n    public:\n      GridDimensionsFunctor(CoordLimitsType& c, MinMaxAvgType& e, MinMaxAvgType& w)\n        : coord_limits_(c)\n        , entity_volume_(e)\n        , entity_width_(w) {}\n\n      template< class Entity >\n      void operator()(const Entity& ent, const size_t \/*ent_idx*\/) {\n        const auto& geo = ent.geometry();\n        entity_volume_( geo.volume() );\n        entity_width_(entity_diameter(ent));\n        for (auto i : DSC::valueRange(geo.corners()))\n        {\n          const auto& corner( geo.corner(i) );\n          for (size_t k = 0; k < GridType::dimensionworld; ++k)\n            coord_limits_[k](corner[k]);\n        }\n      } \/\/ ()\n  };\n\n  double volumeRelation() const\n  { return entity_volume.min() != 0.0 ? entity_volume.max() \/ entity_volume.min() : -1; }\n\n  Dimensions(const GridViewType& gridView) {\n    GridDimensionsFunctor f(coord_limits, entity_volume, entity_width);\n    GridWalk< GridViewType >(gridView).operator()(f);\n  }\n\n  Dimensions(const EntityType& entity) {\n    GridDimensionsFunctor f(coord_limits, entity_volume, entity_width);\n    f(entity, 0);\n  }\n};\n\ntemplate <class GridType>\nDimensions<typename GridType::LeafGridViewType> dimensions(const GridType& grid) {\n  return Dimensions<typename GridType::LeafGridViewType>(grid.leafGridView());\n}\n\ntemplate <class GridViewType >\nDimensions<GridViewType> dimensions(const GridViewType& gridView) {\n  return Dimensions<GridViewType>(gridView);\n}\n\ntemplate <class GridViewType>\nDimensions<GridViewType> dimensions(const typename GridViewType::Grid::template Codim<0>::Entity& entity) {\n  return Dimensions<GridViewType>(entity);\n}\n\n} \/\/ namespace Grid\n} \/\/ end of namespace Stuff\n} \/\/ namespace Dune\n\ntemplate< class T >\ninline std::ostream& operator<<(std::ostream& s, const DSG::Dimensions< T >& d) {\n  for (size_t k = 0; k < T::dimensionworld; ++k)\n  {\n    const auto& mma = d.coord_limits[k];\n    s << boost::format(\"x%d\\tmin: %e\\tavg: %e\\tmax: %e\\n\")\n      % k\n      % mma.min()\n      % mma.average()\n      % mma.max();\n  }\n  s << boost::format(\"Entity vol min: %e\\tavg: %e\\tmax: %e\\tQout: %e\")\n    % d.entity_volume.min()\n    % d.entity_volume.average()\n    % d.entity_volume.max()\n    % d.volumeRelation();\n  s << std::endl;\n  return s;\n} \/\/ <<\n#endif \/\/ DUNE_STUFF_GRID_INFORMATION_HH\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 \"vm\/class_finalizer.h\"\n#include \"vm\/compiler.h\"\n#include \"vm\/object.h\"\n#include \"vm\/pages.h\"\n#include \"vm\/stack_frame.h\"\n#include \"vm\/symbols.h\"\n#include \"vm\/unit_test.h\"\n\nnamespace dart {\n\nTEST_CASE(FindCodeObject) {\n#if defined(TARGET_ARCH_IA32) || defined(TARGET_ARCH_X64)\n  const int kLoopCount = 50000;\n#else\n  const int kLoopCount = 25000;\n#endif\n  const int kScriptSize = 512 * KB;\n  const int kNumFunctions = 1024;\n  char scriptChars[kScriptSize];\n  String& url = String::Handle(String::New(\"dart-test:FindCodeObject\"));\n  String& source = String::Handle();\n  Script& script = Script::Handle();\n  Library& lib = Library::Handle();\n  Class& clsA = Class::Handle();\n  Class& clsB = Class::Handle();\n  String& function_name = String::Handle();\n  Function& function = Function::Handle();\n  char buffer[256];\n\n  \/\/ Get access to the code index table.\n  Isolate* isolate = Isolate::Current();\n  ASSERT(isolate != NULL);\n\n  lib = Library::CoreLibrary();\n\n  \/\/ Load up class A with 1024 functions.\n  int written = OS::SNPrint(scriptChars, kScriptSize, \"class A {\");\n  for (int i = 0; i < kNumFunctions; i++) {\n    OS::SNPrint(buffer,\n                256,\n                \"static foo%d([int i=1,int j=2,int k=3]){return i+j+k;}\", i);\n    written += OS::SNPrint((scriptChars + written),\n                           (kScriptSize - written),\n                           \"%s\",\n                           buffer);\n  }\n  OS::SNPrint((scriptChars + written), (kScriptSize - written), \"}\");\n  source = String::New(scriptChars);\n  script = Script::New(url, source, RawScript::kScriptTag);\n  EXPECT(CompilerTest::TestCompileScript(lib, script));\n  clsA = lib.LookupClass(String::Handle(Symbols::New(\"A\")));\n  EXPECT(!clsA.IsNull());\n  ClassFinalizer::FinalizeTypeHierarchy();\n  for (int i = 0; i < kNumFunctions; i++) {\n    OS::SNPrint(buffer, 256, \"foo%d\", i);\n    function_name = String::New(buffer);\n    function = clsA.LookupStaticFunction(function_name);\n    EXPECT(!function.IsNull());\n    EXPECT(CompilerTest::TestCompileFunction(function));\n    EXPECT(function.HasCode());\n  }\n\n  \/\/ Now load up class B with 1024 functions.\n  written = OS::SNPrint(scriptChars, kScriptSize, \"class B {\");\n  \/\/ Create one large function.\n  OS::SNPrint(buffer, sizeof(buffer), \"static moo0([var i=1]) { \");\n  written += OS::SNPrint((scriptChars + written),\n                         (kScriptSize - written),\n                         \"%s\",\n                         buffer);\n  \/\/ Generate a large function so that the code for this function when\n  \/\/ compiled will reside in a large page.\n  for (int i = 0; i < kLoopCount; i++) {\n    OS::SNPrint(buffer, sizeof(buffer), \"i = i+i;\");\n    written += OS::SNPrint((scriptChars + written),\n                           (kScriptSize - written),\n                           \"%s\",\n                           buffer);\n  }\n  OS::SNPrint(buffer, sizeof(buffer), \"return i; }\");\n  written += OS::SNPrint((scriptChars + written),\n                         (kScriptSize - written),\n                         \"%s\",\n                         buffer);\n  for (int i = 1; i < kNumFunctions; i++) {\n    OS::SNPrint(buffer,\n                256,\n                \"static moo%d([int i=1,int j=2,int k=3]){return i+j+k;}\", i);\n    written += OS::SNPrint((scriptChars + written),\n                           (kScriptSize - written),\n                           \"%s\",\n                           buffer);\n  }\n  OS::SNPrint((scriptChars + written), (kScriptSize - written), \"}\");\n  url = String::New(\"dart-test:FindCodeObject\");\n  source = String::New(scriptChars);\n  script = Script::New(url, source, RawScript::kScriptTag);\n  EXPECT(CompilerTest::TestCompileScript(lib, script));\n  clsB = lib.LookupClass(String::Handle(Symbols::New(\"B\")));\n  EXPECT(!clsB.IsNull());\n  ClassFinalizer::FinalizeTypeHierarchy();\n  for (int i = 0; i < kNumFunctions; i++) {\n    OS::SNPrint(buffer, 256, \"moo%d\", i);\n    function_name = String::New(buffer);\n    function = clsB.LookupStaticFunction(function_name);\n    EXPECT(!function.IsNull());\n    EXPECT(CompilerTest::TestCompileFunction(function));\n    EXPECT(function.HasCode());\n  }\n\n  \/\/ Now try and access these functions using the code index table.\n  Code& code = Code::Handle();\n  uword pc;\n  OS::SNPrint(buffer, 256, \"foo%d\", 123);\n  function_name = String::New(buffer);\n  function = clsA.LookupStaticFunction(function_name);\n  EXPECT(!function.IsNull());\n  code = function.CurrentCode();\n  EXPECT(code.Size() > 16);\n  pc = code.EntryPoint() + 16;\n  EXPECT(Code::LookupCode(pc) == code.raw());\n\n  OS::SNPrint(buffer, 256, \"moo%d\", 54);\n  function_name = String::New(buffer);\n  function = clsB.LookupStaticFunction(function_name);\n  EXPECT(!function.IsNull());\n  code = function.CurrentCode();\n  EXPECT(code.Size() > 16);\n  pc = code.EntryPoint() + 16;\n  EXPECT(Code::LookupCode(pc) == code.raw());\n\n  \/\/ Lookup the large function\n  OS::SNPrint(buffer, 256, \"moo%d\", 0);\n  function_name = String::New(buffer);\n  function = clsB.LookupStaticFunction(function_name);\n  EXPECT(!function.IsNull());\n  code = function.CurrentCode();\n  EXPECT(code.Size() > 16);\n  pc = code.EntryPoint() + 16;\n  EXPECT(code.Size() > (PageSpace::kPageSizeInWords << kWordSizeLog2));\n  EXPECT(Code::LookupCode(pc) == code.raw());\n  EXPECT(code.Size() > (1 * MB));\n  pc = code.EntryPoint() + (1 * MB);\n  EXPECT(Code::LookupCode(pc) == code.raw());\n}\n\n}  \/\/ namespace dart\n<commit_msg>Fixes FindCodeObject test.<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 \"platform\/assert.h\"\n#include \"vm\/class_finalizer.h\"\n#include \"vm\/compiler.h\"\n#include \"vm\/object.h\"\n#include \"vm\/pages.h\"\n#include \"vm\/stack_frame.h\"\n#include \"vm\/symbols.h\"\n#include \"vm\/unit_test.h\"\n\nnamespace dart {\n\nTEST_CASE(FindCodeObject) {\n#if defined(TARGET_ARCH_IA32) || defined(TARGET_ARCH_X64)\n  const int kLoopCount = 50000;\n#else\n  const int kLoopCount = 25000;\n#endif\n  const int kScriptSize = 512 * KB;\n  const int kNumFunctions = 1024;\n  char scriptChars[kScriptSize];\n\n  \/\/ Get access to the code index table.\n  Isolate* isolate = Isolate::Current();\n  ASSERT(isolate != NULL);\n\n  StackZone zone(isolate);\n  String& url = String::Handle(String::New(\"dart-test:FindCodeObject\"));\n  String& source = String::Handle();\n  Script& script = Script::Handle();\n  Library& lib = Library::Handle();\n  Class& clsA = Class::Handle();\n  Class& clsB = Class::Handle();\n  String& function_name = String::Handle();\n  Function& function = Function::Handle();\n  char buffer[256];\n\n  lib = Library::CoreLibrary();\n\n  \/\/ Load up class A with 1024 functions.\n  int written = OS::SNPrint(scriptChars, kScriptSize, \"class A {\");\n  for (int i = 0; i < kNumFunctions; i++) {\n    OS::SNPrint(buffer,\n                256,\n                \"static foo%d([int i=1,int j=2,int k=3]){return i+j+k;}\", i);\n    written += OS::SNPrint((scriptChars + written),\n                           (kScriptSize - written),\n                           \"%s\",\n                           buffer);\n  }\n  OS::SNPrint((scriptChars + written), (kScriptSize - written), \"}\");\n  source = String::New(scriptChars);\n  script = Script::New(url, source, RawScript::kScriptTag);\n  EXPECT(CompilerTest::TestCompileScript(lib, script));\n  clsA = lib.LookupClass(String::Handle(Symbols::New(\"A\")));\n  EXPECT(!clsA.IsNull());\n  ClassFinalizer::FinalizeTypeHierarchy();\n  for (int i = 0; i < kNumFunctions; i++) {\n    OS::SNPrint(buffer, 256, \"foo%d\", i);\n    function_name = String::New(buffer);\n    function = clsA.LookupStaticFunction(function_name);\n    EXPECT(!function.IsNull());\n    EXPECT(CompilerTest::TestCompileFunction(function));\n    const Code& code = Code::ZoneHandle(function.CurrentCode());\n    EXPECT(!code.IsNull())\n    EXPECT(function.HasCode());\n  }\n\n  \/\/ Now load up class B with 1024 functions.\n  written = OS::SNPrint(scriptChars, kScriptSize, \"class B {\");\n  \/\/ Create one large function.\n  OS::SNPrint(buffer, sizeof(buffer), \"static moo0([var i=1]) { \");\n  written += OS::SNPrint((scriptChars + written),\n                         (kScriptSize - written),\n                         \"%s\",\n                         buffer);\n  \/\/ Generate a large function so that the code for this function when\n  \/\/ compiled will reside in a large page.\n  for (int i = 0; i < kLoopCount; i++) {\n    OS::SNPrint(buffer, sizeof(buffer), \"i = i+i;\");\n    written += OS::SNPrint((scriptChars + written),\n                           (kScriptSize - written),\n                           \"%s\",\n                           buffer);\n  }\n  OS::SNPrint(buffer, sizeof(buffer), \"return i; }\");\n  written += OS::SNPrint((scriptChars + written),\n                         (kScriptSize - written),\n                         \"%s\",\n                         buffer);\n  for (int i = 1; i < kNumFunctions; i++) {\n    OS::SNPrint(buffer,\n                256,\n                \"static moo%d([int i=1,int j=2,int k=3]){return i+j+k;}\", i);\n    written += OS::SNPrint((scriptChars + written),\n                           (kScriptSize - written),\n                           \"%s\",\n                           buffer);\n  }\n  OS::SNPrint((scriptChars + written), (kScriptSize - written), \"}\");\n  url = String::New(\"dart-test:FindCodeObject\");\n  source = String::New(scriptChars);\n  script = Script::New(url, source, RawScript::kScriptTag);\n  EXPECT(CompilerTest::TestCompileScript(lib, script));\n  clsB = lib.LookupClass(String::Handle(Symbols::New(\"B\")));\n  EXPECT(!clsB.IsNull());\n  ClassFinalizer::FinalizeTypeHierarchy();\n  for (int i = 0; i < kNumFunctions; i++) {\n    OS::SNPrint(buffer, 256, \"moo%d\", i);\n    function_name = String::New(buffer);\n    function = clsB.LookupStaticFunction(function_name);\n    EXPECT(!function.IsNull());\n    EXPECT(CompilerTest::TestCompileFunction(function));\n    const Code& code = Code::ZoneHandle(function.CurrentCode());\n    EXPECT(!code.IsNull());\n    EXPECT(function.HasCode());\n  }\n\n  \/\/ Now try and access these functions using the code index table.\n  Code& code = Code::Handle();\n  uword pc;\n  OS::SNPrint(buffer, 256, \"foo%d\", 123);\n  function_name = String::New(buffer);\n  function = clsA.LookupStaticFunction(function_name);\n  EXPECT(!function.IsNull());\n  code = function.CurrentCode();\n  EXPECT(code.Size() > 16);\n  pc = code.EntryPoint() + 16;\n  EXPECT(Code::LookupCode(pc) == code.raw());\n\n  OS::SNPrint(buffer, 256, \"moo%d\", 54);\n  function_name = String::New(buffer);\n  function = clsB.LookupStaticFunction(function_name);\n  EXPECT(!function.IsNull());\n  code = function.CurrentCode();\n  EXPECT(code.Size() > 16);\n  pc = code.EntryPoint() + 16;\n  EXPECT(Code::LookupCode(pc) == code.raw());\n\n  \/\/ Lookup the large function\n  OS::SNPrint(buffer, 256, \"moo%d\", 0);\n  function_name = String::New(buffer);\n  function = clsB.LookupStaticFunction(function_name);\n  EXPECT(!function.IsNull());\n  code = function.CurrentCode();\n  EXPECT(code.Size() > 16);\n  pc = code.EntryPoint() + 16;\n  EXPECT(code.Size() > (PageSpace::kPageSizeInWords << kWordSizeLog2));\n  EXPECT(Code::LookupCode(pc) == code.raw());\n  EXPECT(code.Size() > (1 * MB));\n  pc = code.EntryPoint() + (1 * MB);\n  EXPECT(Code::LookupCode(pc) == code.raw());\n}\n\n}  \/\/ namespace dart\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 \"otbWrapperInputImageParameter.h\"\n#include \"itksys\/SystemTools.hxx\"\n#include \"otbWrapperTypes.h\"\n#include \"otbWrapperInputImageParameterMacros.h\"\n#include \"otb_boost_string_header.h\"\n\n\nnamespace otb\n{\n\nnamespace Wrapper\n{\n\nInputImageParameter::InputImageParameter()\n{\n  this->SetName(\"Input Image\");\n  this->SetKey(\"in\");\n  m_FileName=\"\";\n  m_PreviousFileName=\"\";\n  m_UseFilename = true;\n  this->ClearValue();\n}\n\nInputImageParameter::~InputImageParameter()\n{\n}\n\nbool\nInputImageParameter::SetFromFileName(const std::string& filename)\n{\n  \/\/ First clear previous file chosen\n  this->ClearValue();\n\n  \/\/ No file existence is done here :\n  \/\/  - Done in the reader\n  \/\/  - allow appending additional information to the filename\n  \/\/ myfile.tif:2 for example, or myfile.tif:nocarto\n  m_FileName = filename;\n  m_UseFilename = true;\n  SetActive( true );\n\n  return true;\n}\n\n\nImageBaseType *\nInputImageParameter\n::GetImage()\n{\n  return m_Image.GetPointer();\n}\n\n\nImageBaseType const *\nInputImageParameter\n::GetImage() const\n{\n  return m_Image.GetPointer();\n}\n\n\ntemplate <>\nImageBaseType*\nInputImageParameter::GetImage<ImageBaseType>()\n{\n  if (m_Image.IsNull())\n    return this->GetImage<FloatVectorImageType>();\n\n  return m_Image;\n}\n\notbGetImageMacro(UInt8RGBImage);\notbGetImageMacro(UInt8RGBAImage);\n\n\nvoid\nInputImageParameter\n::SetImage( ImageBaseType * image )\n{\n  m_UseFilename = false;\n  m_Image = image;\n}\n\n\nbool\nInputImageParameter::HasValue() const\n{\n  return m_FileName.empty() && m_Image.IsNull();\n}\n\nvoid\nInputImageParameter\n::ClearValue()\n{\n  m_Image  = nullptr;\n  m_Reader = nullptr;\n  m_InputCaster = nullptr;\n  m_OutputCaster = nullptr;\n  m_FileName = \"\";\n  m_PreviousFileName=\"\";\n  m_UseFilename = true;\n}\n\n}\n}\n<commit_msg>ENH: 1649: Fixed otb::Wrapper::InputImageParameter::HasValue() predicate.<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 \"otbWrapperInputImageParameter.h\"\n#include \"itksys\/SystemTools.hxx\"\n#include \"otbWrapperTypes.h\"\n#include \"otbWrapperInputImageParameterMacros.h\"\n#include \"otb_boost_string_header.h\"\n\n\nnamespace otb\n{\n\nnamespace Wrapper\n{\n\nInputImageParameter::InputImageParameter()\n{\n  this->SetName(\"Input Image\");\n  this->SetKey(\"in\");\n  m_FileName=\"\";\n  m_PreviousFileName=\"\";\n  m_UseFilename = true;\n  this->ClearValue();\n}\n\nInputImageParameter::~InputImageParameter()\n{\n}\n\nbool\nInputImageParameter::SetFromFileName(const std::string& filename)\n{\n  \/\/ First clear previous file chosen\n  this->ClearValue();\n\n  \/\/ No file existence is done here :\n  \/\/  - Done in the reader\n  \/\/  - allow appending additional information to the filename\n  \/\/ myfile.tif:2 for example, or myfile.tif:nocarto\n  m_FileName = filename;\n  m_UseFilename = true;\n  SetActive( true );\n\n  return true;\n}\n\n\nImageBaseType *\nInputImageParameter\n::GetImage()\n{\n  return m_Image.GetPointer();\n}\n\n\nImageBaseType const *\nInputImageParameter\n::GetImage() const\n{\n  return m_Image.GetPointer();\n}\n\n\ntemplate <>\nImageBaseType*\nInputImageParameter::GetImage<ImageBaseType>()\n{\n  if (m_Image.IsNull())\n    return this->GetImage<FloatVectorImageType>();\n\n  return m_Image;\n}\n\notbGetImageMacro(UInt8RGBImage);\notbGetImageMacro(UInt8RGBAImage);\n\n\nvoid\nInputImageParameter\n::SetImage( ImageBaseType * image )\n{\n  m_UseFilename = false;\n  m_Image = image;\n}\n\n\nbool\nInputImageParameter::HasValue() const\n{\n  return !m_FileName.empty() || !m_Image.IsNull();\n}\n\nvoid\nInputImageParameter\n::ClearValue()\n{\n  m_Image  = nullptr;\n  m_Reader = nullptr;\n  m_InputCaster = nullptr;\n  m_OutputCaster = nullptr;\n  m_FileName = \"\";\n  m_PreviousFileName=\"\";\n  m_UseFilename = true;\n}\n\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Copyright (C) 2003 by Matthias Braun\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\n#include <sys\/stat.h>\n\n#include \"csutil\/snprintf.h\"\n#include \"csutil\/cfgfile.h\"\n#include \"cssys\/sysfunc.h\"\n\ncsPtr<iConfigFile> csGetPlatformConfig(const char* key)\n{\n  \/\/ is $HOME set? otherwise fallback to standard mode\n  const char* home = getenv(\"HOME\");\n  if (!home)\n    return 0;\n  \n  \/\/ construct directory and filename of the config file\n  char fname[1000];\n  char dir[1000];\n  cs_snprintf(dir, 1000, \"%s\/.crystal\", getenv(\"HOME\"));\n  cs_snprintf(fname, 1000, \"%s\/%s.cfg\", dir, key);\n\n  \/\/ try to create the directory (we assume that $HOME is already created)\n  struct stat stats;\n  if (stat(dir, &stats) != 0)\n  {\n    if (mkdir(dir, S_IWUSR | S_IXUSR | S_IRUSR) != 0)\n    {\n      fprintf(stderr,\n  \t  \"couldn't create directory '%s' for configuration files.\\n\", dir);\n      return 0;\n    }\n  }\n\n  \/\/ create\/read a config file\n  csRef<csConfigFile> configfile = csPtr<csConfigFile> (new csConfigFile);\n  if (!configfile->Load(fname)) {\n    fprintf(stderr, \"couldn't create configfile '%s'.\\n\", fname);\n    return 0;\n  }\n    \n  return csPtr<iConfigFile> (configfile);\n}\n\n<commit_msg>change so that new config files get created<commit_after>\/*\n    Copyright (C) 2003 by Matthias Braun\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\n#include <sys\/stat.h>\n\n#include \"csutil\/snprintf.h\"\n#include \"csutil\/cfgfile.h\"\n#include \"cssys\/sysfunc.h\"\n\ncsPtr<iConfigFile> csGetPlatformConfig(const char* key)\n{\n  \/\/ is $HOME set? otherwise fallback to standard mode\n  const char* home = getenv(\"HOME\");\n  if (!home)\n    return 0;\n  \n  \/\/ construct directory and filename of the config file\n  char fname[1000];\n  char dir[1000];\n  cs_snprintf(dir, 1000, \"%s\/.crystal\", getenv(\"HOME\"));\n  cs_snprintf(fname, 1000, \"%s\/%s.cfg\", dir, key);\n\n  \/\/ try to create the directory (we assume that $HOME is already created)\n  struct stat stats;\n  if (stat(dir, &stats) != 0)\n  {\n    if (mkdir(dir, S_IWUSR | S_IXUSR | S_IRUSR) != 0)\n    {\n      fprintf(stderr,\n  \t  \"couldn't create directory '%s' for configuration files.\\n\", dir);\n      return 0;\n    }\n  }\n\n  \/\/ create\/read a config file\n  csRef<csConfigFile> configfile \n      = csPtr<csConfigFile> (new csConfigFile(fname));\n    \n  return csPtr<iConfigFile> (configfile);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n  Copyright (c) DataStax, 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 \"http_client.hpp\"\n\n#include \"constants.hpp\"\n#include \"driver_info.hpp\"\n\nusing namespace datastax;\nusing namespace datastax::internal::core;\n\nnamespace datastax { namespace internal { namespace core {\n\nclass HttpClientSocketHandler : public SocketHandler {\npublic:\n  HttpClientSocketHandler(HttpClient* client)\n      : client_(client) {}\n\n  virtual void on_read(Socket* socket, ssize_t nread, const uv_buf_t* buf) {\n    client_->on_read(buf->base, nread);\n    free_buffer(buf);\n  }\n\n  virtual void on_write(Socket* socket, int status, SocketRequest* request) { delete request; }\n\n  virtual void on_close() { client_->finish(); }\n\nprivate:\n  HttpClient* client_;\n};\n\nclass HttpClientSslSocketHandler : public SslSocketHandler {\npublic:\n  HttpClientSslSocketHandler(SslSession* ssl_session, HttpClient* client)\n      : SslSocketHandler(ssl_session)\n      , client_(client) {}\n\n  virtual void on_ssl_read(Socket* socket, char* buf, size_t size) { client_->on_read(buf, size); }\n\n  virtual void on_write(Socket* socket, int status, SocketRequest* request) { delete request; }\n\n  virtual void on_close() { client_->finish(); }\n\nprivate:\n  HttpClient* client_;\n};\n\n}}} \/\/ namespace datastax::internal::core\n\nHttpClient::HttpClient(const Address& address, const String& path, const Callback& callback)\n    : error_code_(HTTP_CLIENT_OK)\n    , address_(address)\n    , path_(path)\n    , callback_(callback)\n    , socket_connector_(\n          new SocketConnector(address, bind_callback(&HttpClient::on_socket_connect, this)))\n    , request_timeout_ms_(CASS_DEFAULT_CONNECT_TIMEOUT_MS)\n    , status_code_(0) {\n  http_parser_init(&parser_, HTTP_RESPONSE);\n  http_parser_settings_init(&parser_settings_);\n\n  parser_.data = this;\n  parser_settings_.on_status = on_status;\n  parser_settings_.on_header_field = on_header_field;\n  parser_settings_.on_header_value = on_header_value;\n  parser_settings_.on_body = on_body;\n  parser_settings_.on_message_complete = on_message_complete;\n}\n\nHttpClient* HttpClient::with_settings(const SocketSettings& settings) {\n  socket_connector_->with_settings(settings);\n  return this;\n}\n\nHttpClient* HttpClient::with_request_timeout_ms(uint64_t request_timeout_ms) {\n  request_timeout_ms_ = request_timeout_ms;\n  return this;\n}\n\nvoid HttpClient::request(uv_loop_t* loop) {\n  inc_ref();\n  socket_connector_->connect(loop);\n  if (request_timeout_ms_ > 0) {\n    request_timer_.start(loop, request_timeout_ms_, bind_callback(&HttpClient::on_timeout, this));\n  }\n}\n\nvoid HttpClient::cancel() {\n  error_code_ = HTTP_CLIENT_CANCELED;\n  socket_connector_->cancel();\n  if (socket_) socket_->close();\n  request_timer_.stop();\n}\n\nvoid HttpClient::on_socket_connect(SocketConnector* connector) {\n  if (connector->is_ok()) {\n    socket_ = connector->release_socket();\n    if (connector->ssl_session()) {\n      socket_->set_handler(\n          new HttpClientSslSocketHandler(connector->ssl_session().release(), this));\n    } else {\n      socket_->set_handler(new HttpClientSocketHandler(this));\n    }\n\n    OStringStream ss;\n    ss << \"GET \" << path_ << \" HTTP\/1.0\\r\\n\" \/\/ HTTP\/1.0 ensures chunked responses are not sent\n       << \"Host: \" << socket_->address().to_string(true) << \"\\r\\n\"\n       << \"User-Agent: cpp-driver\/\" << driver_version() << \"\\r\\nAccept: *\/*\\r\\n\\r\\n\";\n\n    String request = ss.str();\n    socket_->write_and_flush(new BufferSocketRequest(Buffer(request.c_str(), request.size())));\n  } else {\n    if (!connector->is_canceled()) {\n      error_code_ = HTTP_CLIENT_ERROR_SOCKET;\n      error_message_ = \"Failed to establish HTTP connection: \" + connector->error_message();\n    }\n    finish();\n  }\n}\n\nvoid HttpClient::on_read(char* buf, ssize_t nread) {\n  if (is_canceled()) return;\n\n  if (nread > 0) {\n    size_t parsed = http_parser_execute(&parser_, &parser_settings_, buf, nread);\n    if (parsed < static_cast<size_t>(nread)) {\n      error_code_ = HTTP_CLIENT_ERROR_PARSING;\n      OStringStream ss;\n      enum http_errno err = HTTP_PARSER_ERRNO(&parser_);\n      ss << \"HTTP parsing error (\" << http_errno_name(err) << \"):\" << http_errno_description(err);\n      error_message_ = ss.str();\n      socket_->close();\n    }\n  } else if (is_ok() && status_code_ == 0) { \/\/ Make sure there wasn't an existing error\n    error_code_ = HTTP_CLIENT_ERROR_CLOSED;\n    error_message_ = \"HTTP connection prematurely closed\";\n  }\n}\n\nvoid HttpClient::on_timeout(Timer* timer) {\n  error_code_ = HTTP_CLIENT_ERROR_TIMEOUT;\n  OStringStream ss;\n  ss << \"HTTP request timed out after \" << request_timeout_ms_ << \" ms\";\n  error_message_ = ss.str();\n  socket_connector_->cancel();\n  if (socket_) socket_->close();\n}\n\nint HttpClient::on_status(http_parser* parser, const char* buf, size_t len) {\n  HttpClient* self = static_cast<HttpClient*>(parser->data);\n  return self->handle_status(parser->status_code);\n}\n\nint HttpClient::handle_status(unsigned status_code) {\n  if (status_code < 200 || status_code > 299) {\n    error_code_ = HTTP_CLIENT_ERROR_HTTP_STATUS;\n  }\n  status_code_ = status_code;\n  return 0;\n}\n\nint HttpClient::on_header_field(http_parser* parser, const char* buf, size_t len) {\n  HttpClient* self = static_cast<HttpClient*>(parser->data);\n  return self->handle_header_field(buf, len);\n}\n\nint HttpClient::handle_header_field(const char* buf, size_t len) {\n  current_header_.assign(buf, len);\n  return 0;\n}\n\nint HttpClient::on_header_value(http_parser* parser, const char* buf, size_t len) {\n  HttpClient* self = static_cast<HttpClient*>(parser->data);\n  return self->handle_header_value(buf, len);\n}\n\nint HttpClient::handle_header_value(const char* buf, size_t len) {\n  if (StringRef(current_header_).iequals(\"content-type\")) {\n    content_type_.assign(buf, len);\n  }\n  return 0;\n}\n\nint HttpClient::on_body(http_parser* parser, const char* buf, size_t len) {\n  HttpClient* self = static_cast<HttpClient*>(parser->data);\n  return self->handle_body(buf, len);\n}\n\nint HttpClient::handle_body(const char* buf, size_t len) {\n  response_body_.assign(buf, len);\n  return 0;\n}\n\nint HttpClient::on_message_complete(http_parser* parser) {\n  HttpClient* self = static_cast<HttpClient*>(parser->data);\n  return self->handle_message_complete();\n}\n\nint HttpClient::handle_message_complete() {\n  socket_->close();\n  return 0;\n}\n\nvoid HttpClient::finish() {\n  request_timer_.stop();\n  if (callback_) callback_(this);\n  dec_ref();\n}\n<commit_msg>Fix `Host:` header when calling metadata service (#494)<commit_after>\/*\n  Copyright (c) DataStax, 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 \"http_client.hpp\"\n\n#include \"constants.hpp\"\n#include \"driver_info.hpp\"\n\nusing namespace datastax;\nusing namespace datastax::internal::core;\n\nnamespace datastax { namespace internal { namespace core {\n\nclass HttpClientSocketHandler : public SocketHandler {\npublic:\n  HttpClientSocketHandler(HttpClient* client)\n      : client_(client) {}\n\n  virtual void on_read(Socket* socket, ssize_t nread, const uv_buf_t* buf) {\n    client_->on_read(buf->base, nread);\n    free_buffer(buf);\n  }\n\n  virtual void on_write(Socket* socket, int status, SocketRequest* request) { delete request; }\n\n  virtual void on_close() { client_->finish(); }\n\nprivate:\n  HttpClient* client_;\n};\n\nclass HttpClientSslSocketHandler : public SslSocketHandler {\npublic:\n  HttpClientSslSocketHandler(SslSession* ssl_session, HttpClient* client)\n      : SslSocketHandler(ssl_session)\n      , client_(client) {}\n\n  virtual void on_ssl_read(Socket* socket, char* buf, size_t size) { client_->on_read(buf, size); }\n\n  virtual void on_write(Socket* socket, int status, SocketRequest* request) { delete request; }\n\n  virtual void on_close() { client_->finish(); }\n\nprivate:\n  HttpClient* client_;\n};\n\n}}} \/\/ namespace datastax::internal::core\n\nHttpClient::HttpClient(const Address& address, const String& path, const Callback& callback)\n    : error_code_(HTTP_CLIENT_OK)\n    , address_(address)\n    , path_(path)\n    , callback_(callback)\n    , socket_connector_(\n          new SocketConnector(address, bind_callback(&HttpClient::on_socket_connect, this)))\n    , request_timeout_ms_(CASS_DEFAULT_CONNECT_TIMEOUT_MS)\n    , status_code_(0) {\n  http_parser_init(&parser_, HTTP_RESPONSE);\n  http_parser_settings_init(&parser_settings_);\n\n  parser_.data = this;\n  parser_settings_.on_status = on_status;\n  parser_settings_.on_header_field = on_header_field;\n  parser_settings_.on_header_value = on_header_value;\n  parser_settings_.on_body = on_body;\n  parser_settings_.on_message_complete = on_message_complete;\n}\n\nHttpClient* HttpClient::with_settings(const SocketSettings& settings) {\n  socket_connector_->with_settings(settings);\n  return this;\n}\n\nHttpClient* HttpClient::with_request_timeout_ms(uint64_t request_timeout_ms) {\n  request_timeout_ms_ = request_timeout_ms;\n  return this;\n}\n\nvoid HttpClient::request(uv_loop_t* loop) {\n  inc_ref();\n  socket_connector_->connect(loop);\n  if (request_timeout_ms_ > 0) {\n    request_timer_.start(loop, request_timeout_ms_, bind_callback(&HttpClient::on_timeout, this));\n  }\n}\n\nvoid HttpClient::cancel() {\n  error_code_ = HTTP_CLIENT_CANCELED;\n  socket_connector_->cancel();\n  if (socket_) socket_->close();\n  request_timer_.stop();\n}\n\nvoid HttpClient::on_socket_connect(SocketConnector* connector) {\n  if (connector->is_ok()) {\n    socket_ = connector->release_socket();\n    if (connector->ssl_session()) {\n      socket_->set_handler(\n          new HttpClientSslSocketHandler(connector->ssl_session().release(), this));\n    } else {\n      socket_->set_handler(new HttpClientSocketHandler(this));\n    }\n\n    OStringStream ss;\n    ss << \"GET \" << path_ << \" HTTP\/1.0\\r\\n\" \/\/ HTTP\/1.0 ensures chunked responses are not sent\n       << \"Host: \" << address_.to_string(false) << \"\\r\\n\"\n       << \"User-Agent: cpp-driver\/\" << driver_version() << \"\\r\\nAccept: *\/*\\r\\n\\r\\n\";\n\n    String request = ss.str();\n    socket_->write_and_flush(new BufferSocketRequest(Buffer(request.c_str(), request.size())));\n  } else {\n    if (!connector->is_canceled()) {\n      error_code_ = HTTP_CLIENT_ERROR_SOCKET;\n      error_message_ = \"Failed to establish HTTP connection: \" + connector->error_message();\n    }\n    finish();\n  }\n}\n\nvoid HttpClient::on_read(char* buf, ssize_t nread) {\n  if (is_canceled()) return;\n\n  if (nread > 0) {\n    size_t parsed = http_parser_execute(&parser_, &parser_settings_, buf, nread);\n    if (parsed < static_cast<size_t>(nread)) {\n      error_code_ = HTTP_CLIENT_ERROR_PARSING;\n      OStringStream ss;\n      enum http_errno err = HTTP_PARSER_ERRNO(&parser_);\n      ss << \"HTTP parsing error (\" << http_errno_name(err) << \"):\" << http_errno_description(err);\n      error_message_ = ss.str();\n      socket_->close();\n    }\n  } else if (is_ok() && status_code_ == 0) { \/\/ Make sure there wasn't an existing error\n    error_code_ = HTTP_CLIENT_ERROR_CLOSED;\n    error_message_ = \"HTTP connection prematurely closed\";\n  }\n}\n\nvoid HttpClient::on_timeout(Timer* timer) {\n  error_code_ = HTTP_CLIENT_ERROR_TIMEOUT;\n  OStringStream ss;\n  ss << \"HTTP request timed out after \" << request_timeout_ms_ << \" ms\";\n  error_message_ = ss.str();\n  socket_connector_->cancel();\n  if (socket_) socket_->close();\n}\n\nint HttpClient::on_status(http_parser* parser, const char* buf, size_t len) {\n  HttpClient* self = static_cast<HttpClient*>(parser->data);\n  return self->handle_status(parser->status_code);\n}\n\nint HttpClient::handle_status(unsigned status_code) {\n  if (status_code < 200 || status_code > 299) {\n    error_code_ = HTTP_CLIENT_ERROR_HTTP_STATUS;\n  }\n  status_code_ = status_code;\n  return 0;\n}\n\nint HttpClient::on_header_field(http_parser* parser, const char* buf, size_t len) {\n  HttpClient* self = static_cast<HttpClient*>(parser->data);\n  return self->handle_header_field(buf, len);\n}\n\nint HttpClient::handle_header_field(const char* buf, size_t len) {\n  current_header_.assign(buf, len);\n  return 0;\n}\n\nint HttpClient::on_header_value(http_parser* parser, const char* buf, size_t len) {\n  HttpClient* self = static_cast<HttpClient*>(parser->data);\n  return self->handle_header_value(buf, len);\n}\n\nint HttpClient::handle_header_value(const char* buf, size_t len) {\n  if (StringRef(current_header_).iequals(\"content-type\")) {\n    content_type_.assign(buf, len);\n  }\n  return 0;\n}\n\nint HttpClient::on_body(http_parser* parser, const char* buf, size_t len) {\n  HttpClient* self = static_cast<HttpClient*>(parser->data);\n  return self->handle_body(buf, len);\n}\n\nint HttpClient::handle_body(const char* buf, size_t len) {\n  response_body_.assign(buf, len);\n  return 0;\n}\n\nint HttpClient::on_message_complete(http_parser* parser) {\n  HttpClient* self = static_cast<HttpClient*>(parser->data);\n  return self->handle_message_complete();\n}\n\nint HttpClient::handle_message_complete() {\n  socket_->close();\n  return 0;\n}\n\nvoid HttpClient::finish() {\n  request_timer_.stop();\n  if (callback_) callback_(this);\n  dec_ref();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/#define ENABLE_DEBUG_TRACES\n#include <libport\/compiler.hh>\n\n#include <libport\/unistd.h>\n#include <iostream>\n#include <fstream>\n#include <algorithm>\n#include <libport\/cstring>\n\n#include <boost\/function.hpp>\n#include <boost\/bind.hpp>\n\n#include <libport\/cli.hh>\n#include <libport\/debug.hh>\n#include <libport\/exception.hh>\n#include <libport\/foreach.hh>\n#include <libport\/format.hh>\n#include <libport\/option-parser.hh>\n#include <libport\/package-info.hh>\n#include <libport\/program-name.hh>\n#include <libport\/read-stdin.hh>\n#include <libport\/sys\/socket.h>\n#include <libport\/sysexits.hh>\n#include <libport\/thread.hh>\n#include <libport\/utime.hh>\n#include <libport\/windows.hh>\n\n#include <libltdl\/ltdl.h>\n\n\/\/ Inclusion order matters for windows. Leave userver.hh after network.hh.\n#include <network\/bsdnet\/network.hh>\n#include <kernel\/uqueue.hh>\n#include <kernel\/userver.hh>\n#include <kernel\/uconnection.hh>\n\n#include <sched\/configuration.hh>\n#include <sched\/scheduler.hh>\n\n#include <kernel\/ubanner.hh>\n#include <object\/symbols.hh>\n#include <object\/object.hh>\n#include <object\/float.hh>\n#include <object\/system.hh>\n#include <urbi\/export.hh>\n#include <urbi\/umain.hh>\n#include <urbi\/uobject.hh>\n\nGD_INIT();\nGD_ADD_CATEGORY(URBI);\n\nusing libport::program_name;\n\nclass ConsoleServer\n  : public kernel::UServer\n{\npublic:\n  ConsoleServer(bool fast)\n    : kernel::UServer(\"console\"), fast(fast), ctime(0)\n  {}\n\n  virtual ~ConsoleServer()\n  {}\n\n  virtual void reset()\n  {}\n\n  virtual void reboot()\n  {}\n\n  virtual libport::utime_t getTime()\n  {\n    return fast ? ctime : libport::utime();\n  }\n\n  virtual\n  UErrorValue\n  save_file(const std::string& filename, const std::string& content)\n  {\n    \/\/! \\todo check this code\n    std::ofstream os(filename.c_str());\n    os << content;\n    os.close();\n    return os.good() ? USUCCESS : UFAIL;\n  }\n\n  virtual\n  void effectiveDisplay(const char* t)\n  {\n    std::cout << t;\n  }\n\n  bool fast;\n  libport::utime_t ctime;\n};\n\nnamespace\n{\n  static\n  void\n  help(libport::OptionParser& parser)\n  {\n    std::stringstream output;\n    output\n      << \"usage: \" << libport::program_name()\n      << \" [OPTIONS] [PROGRAM_FILE] [ARGS...]\" << std::endl\n      << std::endl\n      << \"  PROGRAM_FILE   Urbi script to load.\"\n      << \"  `-' stands for standard input\" << std::endl\n      << \"  ARGS           user arguments passed to PROGRAM_FILE\" << std::endl\n      << parser;\n    throw urbi::Exit(EX_OK, output.str());\n  }\n\n  static\n  void\n  version()\n  {\n    throw urbi::Exit(EX_OK, kernel::UServer::package_info().signature());\n  }\n\n  static\n  void\n  forbid_option(const std::string& arg)\n  {\n    if (arg.size() > 1 && arg[0] == '-')\n    {\n      boost::format fmt(\"%s: unrecognized command line option: %s\");\n      throw urbi::Exit(EX_USAGE, str(fmt % libport::program_name() % arg));\n    }\n  }\n}\n\nnamespace urbi\n{\n\n  \/\/\/ Command line options needed in the main loop.\n  struct LoopData\n  {\n    LoopData()\n      : interactive(false)\n      , fast(false)\n      , network(true)\n      , server(0)\n    {}\n\n    bool interactive;\n    bool fast;\n    \/\/\/ Whether network connections are enabled.\n    bool network;\n    ConsoleServer* server;\n  };\n\n  int main_loop(LoopData& l);\n\n\n  static\n  int\n  ltdebug(unsigned verbosity, unsigned level, const char* format, va_list args)\n  {\n    int errors = 0;\n    if (level <= verbosity)\n    {\n      errors += fprintf(stderr, \"%s: \", program_name().c_str()) < 0;\n      errors += vfprintf(stderr, format, args) < 0;\n    }\n    return errors;\n  }\n\n  static std::string convert_input_file(const std::string& arg)\n  {\n    return (arg == \"-\") ? \"\/dev\/stdin\" : arg;\n  }\n\n  \/\/\/ Data to send to the server.\n  struct Input\n  {\n    Input(bool f, const std::string& v)\n      : file_p(f), value(v)\n    {}\n    \/\/\/ Whether it's a file (or a litteral).\n    bool file_p;\n    \/\/\/ File name or litteral value.\n    std::string value;\n  };\n\n  int\n  main(const libport::cli_args_type& _args, bool block, bool errors)\n  {\n    if (errors)\n    {\n      try\n      {\n        return main(_args, block);\n      }\n      catch (const urbi::Exit& e)\n      {\n        std::cerr << program_name() << \": \" << e.what() << std::endl;\n        return e.error_get();\n      }\n    }\n\n    GD_CATEGORY(URBI);\n\n    libport::cli_args_type args = _args;\n\n    object::system_set_program_name(args[0]);\n    args.erase(args.begin());\n\n    \/\/ Input files.\n    typedef std::vector<Input> input_type;\n    input_type input;\n    \/\/\/ The size of the stacks.\n    size_t arg_stack_size = 0;\n\n    \/\/ Parse the command line.\n    LoopData data;\n\n    libport::OptionFlag\n      arg_fast(\"ignore system time, go as fast as possible\",\n               \"fast\", 'F'),\n      arg_interactive(\"read and parse stdin in a nonblocking way\",\n                      \"interactive\", 'i'),\n      arg_no_net(\"ignored for backward compatibility\", \"no-network\", 'n');\n\n    libport::OptionValue\n      arg_dbg      (\"\", \"debug\"),\n      arg_period   (\"ignored for backward compatibility\", \"period\", 'P'),\n      arg_port_file(\"write port number to the specified file.\",\n                    \"port-file\", 'w', \"FILE\"),\n      arg_stack    (\"set the job stack size in KB\", \"stack-size\", 's', \"SIZE\");\n\n    libport::OptionValues\n      arg_exps(\"run expression\", \"expression\", 'e', \"EXP\");\n\n    {\n      libport::OptionParser parser;\n      parser\n        << \"Options:\"\n        << arg_dbg\n        << arg_fast\n        << libport::opts::help\n        << libport::opts::version\n        << arg_period\n        << \"Tuning:\"\n        << arg_stack\n        << \"Networking:\"\n        << libport::opts::host_l\n        << libport::opts::port_l\n        << arg_port_file\n        << arg_no_net\n        << \"Execution:\"\n        << arg_exps\n        << libport::opts::files\n        << arg_interactive\n        ;\n      try\n      {\n        args = parser(args);\n      }\n      catch (libport::Error& e)\n      {\n        boost::format fmt(\"%s: command line error: %s\");\n        throw Exit(EX_USAGE, str(fmt % libport::program_name() % e.what()));\n      }\n\n      if (libport::opts::help.get())\n        help(parser);\n      if (libport::opts::version.get())\n        version();\n      data.interactive = arg_interactive.get();\n      data.fast = arg_fast.get();\n      foreach (const std::string& exp, arg_exps.get())\n        input.push_back(Input(false, exp));\n      foreach (const std::string& file, libport::opts::files.get())\n        input.push_back(Input(true, convert_input_file(file)));\n      arg_stack_size = arg_stack.get<size_t>(static_cast<size_t>(0));\n\n      \/\/ Unrecognized options. These are a script file, followed by user args.\n      if (!args.empty())\n      {\n        forbid_option(args[0]);\n        input.push_back(Input(true, convert_input_file(args[0])));\n        \/\/ Anything left is user argument\n        for (unsigned i = 1; i < args.size(); ++i)\n        {\n          std::string arg = args[i];\n          forbid_option(arg);\n          object::system_push_argument(arg);\n        }\n      }\n    }\n\n    \/\/ Libtool traces.\n    lt_dladd_log_function((lt_dllog_function*) &ltdebug,\n                          (void*) arg_dbg.get<int>(0));\n\n    \/\/ If not defined in command line, use the envvar.\n    if (!arg_stack.filled() && getenv(\"URBI_STACK_SIZE\"))\n      arg_stack_size = libport::convert_envvar<size_t> (\"URBI_STACK_SIZE\");\n\n    if (arg_stack_size)\n    {\n      \/\/ Make sure the result is a multiple of the page size.  This\n      \/\/ required at least on OSX (which unfortunately fails with errno\n      \/\/ = 0).\n      arg_stack_size *= 1024;\n      size_t pagesize = getpagesize();\n      arg_stack_size = ((arg_stack_size + pagesize - 1) \/ pagesize) * pagesize;\n      sched::configuration.default_stack_size = arg_stack_size;\n    }\n\n    data.server = new ConsoleServer(data.fast);\n    ConsoleServer& s = *data.server;\n\n    \/*----------------.\n    | --port\/--host.  |\n    `----------------*\/\n    int port = -1;\n    {\n      int desired_port = libport::opts::port_l.get<int>(-1);\n      if (desired_port != -1)\n      {\n        std::string host = libport::opts::host_l.value(\"\");\n        port = Network::createTCPServer(host, desired_port);\n        if (!port)\n          throw urbi::Exit\n            (EX_UNAVAILABLE,\n             libport::format(\"%s: cannot bind to port %s:%s\",\n                             program_name(), host, desired_port));\n      }\n    }\n    data.network = 0 < port;\n    \/\/ In Urbi: System.listenPort = <port>.\n    object::system_class->slot_set(SYMBOL(listenPort),\n                                   object::to_urbi(port),\n                                   true);\n\n    s.initialize(data.interactive);\n\n    \/*--------------.\n    | --port-file.  |\n    `--------------*\/\n    \/\/ Write the port file after initialize returned; that is, after\n    \/\/ urbi.u is loaded.\n    if (arg_port_file.filled())\n      std::ofstream(arg_port_file.value().c_str(), std::ios::out)\n        << port << std::endl;\n\n    kernel::UConnection& c = s.ghost_connection_get();\n#ifdef ENABLE_DEBUG_TRACES\n    std::cerr << program_name() << \": got ghost connection\" << std::endl;\n#endif\n\n    foreach (const Input& i, input)\n    {\n      int res = USUCCESS;\n      if (i.file_p)\n        res = s.load_file(i.value, c.recv_queue_get());\n      else\n        c.recv_queue_get().push(i.value.c_str());\n      if (res != USUCCESS)\n      {\n        boost::format fmt(\"%s: failed to process %s\");\n        throw urbi::Exit(EX_NOINPUT, str(fmt % program_name() % i.value));\n      }\n    }\n\n    c.new_data_added_get() = true;\n\n#ifdef ENABLE_DEBUG_TRACES\n    std::cerr << program_name() << \": going to work...\" << std::endl;\n#endif\n    if (block)\n      return main_loop(data);\n    else\n      libport::startThread(new boost::function0<void>(\n                             boost::bind(&main_loop, data)));\n    return 0;\n  }\n\n  int\n  main_loop(LoopData& data)\n  {\n    ConsoleServer& s = *data.server;\n    libport::utime_t next_time = 0;\n    while (true)\n    {\n      if (data.interactive)\n      {\n        std::string input;\n        try\n        {\n          input = libport::read_stdin();\n        }\n        catch (libport::exception::Exception e)\n        {\n          std::cerr << program_name() << \": \"  << e.what() << std::endl;\n          data.interactive = false;\n        }\n        if (!input.empty())\n          s.ghost_connection_get().received(input);\n      }\n\n      if (data.network)\n      {\n        libport::utime_t select_time = 0;\n        if (!data.fast)\n        {\n          select_time = std::max(next_time - libport::utime(), select_time);\n          if (data.interactive)\n            select_time = std::min(100000LL, select_time);\n        }\n        Network::selectAndProcess(select_time);\n      }\n\n      next_time = s.work();\n      if (next_time == sched::SCHED_EXIT)\n        break;\n      s.ctime = std::max(next_time, s.ctime + 1000L);\n    }\n\n    return EX_OK;\n  }\n\n}\n<commit_msg>Do not trigger the wrong-thread UServer assertion in main non-blocking mode.<commit_after>\/\/#define ENABLE_DEBUG_TRACES\n#include <libport\/compiler.hh>\n\n#include <libport\/unistd.h>\n#include <iostream>\n#include <fstream>\n#include <algorithm>\n#include <libport\/cstring>\n\n#include <boost\/function.hpp>\n#include <boost\/bind.hpp>\n\n#include <libport\/cli.hh>\n#include <libport\/debug.hh>\n#include <libport\/exception.hh>\n#include <libport\/foreach.hh>\n#include <libport\/format.hh>\n#include <libport\/option-parser.hh>\n#include <libport\/package-info.hh>\n#include <libport\/program-name.hh>\n#include <libport\/read-stdin.hh>\n#include <libport\/semaphore.hh>\n#include <libport\/sys\/socket.h>\n#include <libport\/sysexits.hh>\n#include <libport\/thread.hh>\n#include <libport\/utime.hh>\n#include <libport\/windows.hh>\n\n#include <libltdl\/ltdl.h>\n\n\/\/ Inclusion order matters for windows. Leave userver.hh after network.hh.\n#include <network\/bsdnet\/network.hh>\n#include <kernel\/uqueue.hh>\n#include <kernel\/userver.hh>\n#include <kernel\/uconnection.hh>\n\n#include <sched\/configuration.hh>\n#include <sched\/scheduler.hh>\n\n#include <kernel\/ubanner.hh>\n#include <object\/symbols.hh>\n#include <object\/object.hh>\n#include <object\/float.hh>\n#include <object\/system.hh>\n#include <urbi\/export.hh>\n#include <urbi\/umain.hh>\n#include <urbi\/uobject.hh>\n\nGD_INIT();\nGD_ADD_CATEGORY(URBI);\n\nusing libport::program_name;\n\nclass ConsoleServer\n  : public kernel::UServer\n{\npublic:\n  ConsoleServer(bool fast)\n    : kernel::UServer(\"console\"), fast(fast), ctime(0)\n  {}\n\n  virtual ~ConsoleServer()\n  {}\n\n  virtual void reset()\n  {}\n\n  virtual void reboot()\n  {}\n\n  virtual libport::utime_t getTime()\n  {\n    return fast ? ctime : libport::utime();\n  }\n\n  virtual\n  UErrorValue\n  save_file(const std::string& filename, const std::string& content)\n  {\n    \/\/! \\todo check this code\n    std::ofstream os(filename.c_str());\n    os << content;\n    os.close();\n    return os.good() ? USUCCESS : UFAIL;\n  }\n\n  virtual\n  void effectiveDisplay(const char* t)\n  {\n    std::cout << t;\n  }\n\n  bool fast;\n  libport::utime_t ctime;\n};\n\nnamespace\n{\n  static\n  void\n  help(libport::OptionParser& parser)\n  {\n    std::stringstream output;\n    output\n      << \"usage: \" << libport::program_name()\n      << \" [OPTIONS] [PROGRAM_FILE] [ARGS...]\" << std::endl\n      << std::endl\n      << \"  PROGRAM_FILE   Urbi script to load.\"\n      << \"  `-' stands for standard input\" << std::endl\n      << \"  ARGS           user arguments passed to PROGRAM_FILE\" << std::endl\n      << parser;\n    throw urbi::Exit(EX_OK, output.str());\n  }\n\n  static\n  void\n  version()\n  {\n    throw urbi::Exit(EX_OK, kernel::UServer::package_info().signature());\n  }\n\n  static\n  void\n  forbid_option(const std::string& arg)\n  {\n    if (arg.size() > 1 && arg[0] == '-')\n    {\n      boost::format fmt(\"%s: unrecognized command line option: %s\");\n      throw urbi::Exit(EX_USAGE, str(fmt % libport::program_name() % arg));\n    }\n  }\n}\n\nnamespace urbi\n{\n\n  \/\/\/ Command line options needed in the main loop.\n  struct LoopData\n  {\n    LoopData()\n      : interactive(false)\n      , fast(false)\n      , network(true)\n      , server(0)\n    {}\n\n    bool interactive;\n    bool fast;\n    \/\/\/ Whether network connections are enabled.\n    bool network;\n    ConsoleServer* server;\n  };\n\n  int main_loop(LoopData& l);\n\n\n  static\n  int\n  ltdebug(unsigned verbosity, unsigned level, const char* format, va_list args)\n  {\n    int errors = 0;\n    if (level <= verbosity)\n    {\n      errors += fprintf(stderr, \"%s: \", program_name().c_str()) < 0;\n      errors += vfprintf(stderr, format, args) < 0;\n    }\n    return errors;\n  }\n\n  static std::string convert_input_file(const std::string& arg)\n  {\n    return (arg == \"-\") ? \"\/dev\/stdin\" : arg;\n  }\n\n  \/\/\/ Data to send to the server.\n  struct Input\n  {\n    Input(bool f, const std::string& v)\n      : file_p(f), value(v)\n    {}\n    \/\/\/ Whether it's a file (or a litteral).\n    bool file_p;\n    \/\/\/ File name or litteral value.\n    std::string value;\n  };\n\n  static int\n  init(const libport::cli_args_type& _args, bool errors,\n             libport::Semaphore* sem)\n  {\n    libport::Finally f;\n    if (sem)\n      f << boost::bind(&libport::Semaphore::operator++, sem);\n    if (errors)\n    {\n      try\n      {\n        return init(_args, false, sem);\n      }\n      catch (const urbi::Exit& e)\n      {\n        std::cerr << program_name() << \": \" << e.what() << std::endl;\n        return e.error_get();\n      }\n    }\n\n    GD_CATEGORY(URBI);\n\n    libport::cli_args_type args = _args;\n\n    object::system_set_program_name(args[0]);\n    args.erase(args.begin());\n\n    \/\/ Input files.\n    typedef std::vector<Input> input_type;\n    input_type input;\n    \/\/\/ The size of the stacks.\n    size_t arg_stack_size = 0;\n\n    \/\/ Parse the command line.\n    LoopData data;\n\n    libport::OptionFlag\n      arg_fast(\"ignore system time, go as fast as possible\",\n               \"fast\", 'F'),\n      arg_interactive(\"read and parse stdin in a nonblocking way\",\n                      \"interactive\", 'i'),\n      arg_no_net(\"ignored for backward compatibility\", \"no-network\", 'n');\n\n    libport::OptionValue\n      arg_dbg      (\"\", \"debug\"),\n      arg_period   (\"ignored for backward compatibility\", \"period\", 'P'),\n      arg_port_file(\"write port number to the specified file.\",\n                    \"port-file\", 'w', \"FILE\"),\n      arg_stack    (\"set the job stack size in KB\", \"stack-size\", 's', \"SIZE\");\n\n    libport::OptionValues\n      arg_exps(\"run expression\", \"expression\", 'e', \"EXP\");\n\n    {\n      libport::OptionParser parser;\n      parser\n        << \"Options:\"\n        << arg_dbg\n        << arg_fast\n        << libport::opts::help\n        << libport::opts::version\n        << arg_period\n        << \"Tuning:\"\n        << arg_stack\n        << \"Networking:\"\n        << libport::opts::host_l\n        << libport::opts::port_l\n        << arg_port_file\n        << arg_no_net\n        << \"Execution:\"\n        << arg_exps\n        << libport::opts::files\n        << arg_interactive\n        ;\n      try\n      {\n        args = parser(args);\n      }\n      catch (libport::Error& e)\n      {\n        boost::format fmt(\"%s: command line error: %s\");\n        throw Exit(EX_USAGE, str(fmt % libport::program_name() % e.what()));\n      }\n\n      if (libport::opts::help.get())\n        help(parser);\n      if (libport::opts::version.get())\n        version();\n      data.interactive = arg_interactive.get();\n      data.fast = arg_fast.get();\n      foreach (const std::string& exp, arg_exps.get())\n        input.push_back(Input(false, exp));\n      foreach (const std::string& file, libport::opts::files.get())\n        input.push_back(Input(true, convert_input_file(file)));\n      arg_stack_size = arg_stack.get<size_t>(static_cast<size_t>(0));\n\n      \/\/ Unrecognized options. These are a script file, followed by user args.\n      if (!args.empty())\n      {\n        forbid_option(args[0]);\n        input.push_back(Input(true, convert_input_file(args[0])));\n        \/\/ Anything left is user argument\n        for (unsigned i = 1; i < args.size(); ++i)\n        {\n          std::string arg = args[i];\n          forbid_option(arg);\n          object::system_push_argument(arg);\n        }\n      }\n    }\n\n    \/\/ Libtool traces.\n    lt_dladd_log_function((lt_dllog_function*) &ltdebug,\n                          (void*) arg_dbg.get<int>(0));\n\n    \/\/ If not defined in command line, use the envvar.\n    if (!arg_stack.filled() && getenv(\"URBI_STACK_SIZE\"))\n      arg_stack_size = libport::convert_envvar<size_t> (\"URBI_STACK_SIZE\");\n\n    if (arg_stack_size)\n    {\n      \/\/ Make sure the result is a multiple of the page size.  This\n      \/\/ required at least on OSX (which unfortunately fails with errno\n      \/\/ = 0).\n      arg_stack_size *= 1024;\n      size_t pagesize = getpagesize();\n      arg_stack_size = ((arg_stack_size + pagesize - 1) \/ pagesize) * pagesize;\n      sched::configuration.default_stack_size = arg_stack_size;\n    }\n\n    data.server = new ConsoleServer(data.fast);\n    ConsoleServer& s = *data.server;\n\n    \/*----------------.\n    | --port\/--host.  |\n    `----------------*\/\n    int port = -1;\n    {\n      int desired_port = libport::opts::port_l.get<int>(-1);\n      if (desired_port != -1)\n      {\n        std::string host = libport::opts::host_l.value(\"\");\n        port = Network::createTCPServer(host, desired_port);\n        if (!port)\n          throw urbi::Exit\n            (EX_UNAVAILABLE,\n             libport::format(\"%s: cannot bind to port %s:%s\",\n                             program_name(), host, desired_port));\n      }\n    }\n    data.network = 0 < port;\n    \/\/ In Urbi: System.listenPort = <port>.\n    object::system_class->slot_set(SYMBOL(listenPort),\n                                   object::to_urbi(port),\n                                   true);\n\n    s.initialize(data.interactive);\n\n    \/*--------------.\n    | --port-file.  |\n    `--------------*\/\n    \/\/ Write the port file after initialize returned; that is, after\n    \/\/ urbi.u is loaded.\n    if (arg_port_file.filled())\n      std::ofstream(arg_port_file.value().c_str(), std::ios::out)\n        << port << std::endl;\n\n    kernel::UConnection& c = s.ghost_connection_get();\n#ifdef ENABLE_DEBUG_TRACES\n    std::cerr << program_name() << \": got ghost connection\" << std::endl;\n#endif\n\n    foreach (const Input& i, input)\n    {\n      int res = USUCCESS;\n      if (i.file_p)\n        res = s.load_file(i.value, c.recv_queue_get());\n      else\n        c.recv_queue_get().push(i.value.c_str());\n      if (res != USUCCESS)\n      {\n        boost::format fmt(\"%s: failed to process %s\");\n        throw urbi::Exit(EX_NOINPUT, str(fmt % program_name() % i.value));\n      }\n    }\n\n    c.new_data_added_get() = true;\n\n#ifdef ENABLE_DEBUG_TRACES\n    std::cerr << program_name() << \": going to work...\" << std::endl;\n#endif\n\n    if (sem)\n      (*sem)++;\n\n    return main_loop(data);\n\n  }\n\n  int\n  main_loop(LoopData& data)\n  {\n    ConsoleServer& s = *data.server;\n    libport::utime_t next_time = 0;\n    while (true)\n    {\n      if (data.interactive)\n      {\n        std::string input;\n        try\n        {\n          input = libport::read_stdin();\n        }\n        catch (libport::exception::Exception e)\n        {\n          std::cerr << program_name() << \": \"  << e.what() << std::endl;\n          data.interactive = false;\n        }\n        if (!input.empty())\n          s.ghost_connection_get().received(input);\n      }\n\n      if (data.network)\n      {\n        libport::utime_t select_time = 0;\n        if (!data.fast)\n        {\n          select_time = std::max(next_time - libport::utime(), select_time);\n          if (data.interactive)\n            select_time = std::min(100000LL, select_time);\n        }\n        Network::selectAndProcess(select_time);\n      }\n\n      next_time = s.work();\n      if (next_time == sched::SCHED_EXIT)\n        break;\n      s.ctime = std::max(next_time, s.ctime + 1000L);\n    }\n\n    return EX_OK;\n  }\n\n  int\n  main(const libport::cli_args_type& _args, bool block, bool errors)\n  {\n    if (block)\n      return init(_args, errors, 0);\n    else\n    {\n      \/\/ The semaphore must survive this block, as init will use it when\n      \/\/ exiting.\n      libport::Semaphore* s = new libport::Semaphore;\n      libport::startThread(boost::bind(&init, boost::ref(_args),\n                                       errors, s));\n      (*s)--;\n      return 0;\n    }\n  }\n\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#include \"precompiled_sal.hxx\"\n#include \"sal\/config.h\"\n\n#include <cstdlib>\n#include <iostream>\n#include <limits>\n#include <string>\n\n#include \"cppunittester\/protectorfactory.hxx\"\n#include \"osl\/module.h\"\n#include \"osl\/module.hxx\"\n#include \"osl\/thread.h\"\n#include \"rtl\/process.h\"\n#include \"rtl\/string.h\"\n#include \"rtl\/string.hxx\"\n#include \"rtl\/textcvt.h\"\n#include \"rtl\/ustring.hxx\"\n#include \"sal\/main.h\"\n#include \"sal\/types.h\"\n\n#include \"preextstl.h\"\n#include \"cppunit\/CompilerOutputter.h\"\n#include \"cppunit\/TestResult.h\"\n#include \"cppunit\/TestResultCollector.h\"\n#include \"cppunit\/TestRunner.h\"\n#include \"cppunit\/extensions\/TestFactoryRegistry.h\"\n#include \"cppunit\/plugin\/PlugInManager.h\"\n#include \"cppunit\/portability\/Stream.h\"\n#include \"postextstl.h\"\n\nnamespace {\n\nvoid usageFailure() {\n    std::cerr\n        << (\"Usage: cppunittester (--protector <shared-library-path>\"\n            \" <function-symbol>)* <shared-library-path>\")\n        << std::endl;\n    std::exit(EXIT_FAILURE);\n}\n\nrtl::OUString getArgument(sal_Int32 index) {\n    rtl::OUString arg;\n    rtl_getAppCommandArg(index, &arg.pData);\n    return arg;\n}\n\nstd::string convertLazy(rtl::OUString const & s16) {\n    rtl::OString s8(rtl::OUStringToOString(s16, osl_getThreadTextEncoding()));\n    return std::string(\n        s8.getStr(),\n        ((static_cast< sal_uInt32 >(s8.getLength())\n          > std::numeric_limits< std::string::size_type >::max())\n         ? std::numeric_limits< std::string::size_type >::max()\n         : static_cast< std::string::size_type >(s8.getLength())));\n}\n\nstd::string convertStrict(rtl::OUString const & s16) {\n    rtl::OString s8;\n    if (!s16.convertToString(\n            &s8, osl_getThreadTextEncoding(),\n            (RTL_UNICODETOTEXT_FLAGS_UNDEFINED_ERROR\n             | RTL_UNICODETOTEXT_FLAGS_INVALID_ERROR))\n        || (static_cast< sal_uInt32 >(s8.getLength())\n            > std::numeric_limits< std::string::size_type >::max()))\n    {\n        std::cerr\n            << \"Failure converting argument from UTF-16 back to system encoding\"\n            << std::endl;\n        std::exit(EXIT_FAILURE);\n    }\n    return std::string(\n        s8.getStr(), static_cast< std::string::size_type >(s8.getLength()));\n}\n\n}\n\nSAL_IMPLEMENT_MAIN() {\n    CppUnit::TestResult result;\n    sal_uInt32 index = 0;\n    for (; index < rtl_getAppCommandArgCount(); index += 3) {\n        if (!getArgument(index).equalsAsciiL(\n                RTL_CONSTASCII_STRINGPARAM(\"--protector\")))\n        {\n            break;\n        }\n        if (rtl_getAppCommandArgCount() - index < 3) {\n            usageFailure();\n        }\n        rtl::OUString lib(getArgument(index + 1));\n        rtl::OUString sym(getArgument(index + 2));\n        oslGenericFunction fn = (new osl::Module(lib))->getFunctionSymbol(sym);\n        CppUnit::Protector * p = fn == 0\n            ? 0\n            : (*reinterpret_cast< cppunittester::ProtectorFactory * >(fn))();\n        if (p == 0) {\n            std::cerr\n                << \"Failure instantiating protector \\\"\" << convertLazy(lib)\n                << \"\\\", \\\"\" << convertLazy(sym) << '\"' << std::endl;\n            std::exit(EXIT_FAILURE);\n        }\n        result.pushProtector(p);\n    }\n    if (rtl_getAppCommandArgCount() - index != 1) {\n        usageFailure();\n    }\n    CppUnit::PlugInManager manager;\n    manager.load(convertStrict(getArgument(index)));\n    CppUnit::TestRunner runner;\n    runner.addTest(CppUnit::TestFactoryRegistry::getRegistry().makeTest());\n    CppUnit::TestResultCollector collector;\n    result.addListener(&collector);\n    runner.run(result);\n    CppUnit::CompilerOutputter(&collector, CppUnit::stdCErr()).write();\n    return collector.wasSuccessful() ? EXIT_SUCCESS : EXIT_FAILURE;\n}\n<commit_msg>debuglevels: #i117073# Linux\/GCC needs SAL_LOADMODULE_GLOBAL for exception handling to work<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 \"precompiled_sal.hxx\"\n#include \"sal\/config.h\"\n\n#include <cstdlib>\n#include <iostream>\n#include <limits>\n#include <string>\n\n#include \"cppunittester\/protectorfactory.hxx\"\n#include \"osl\/module.h\"\n#include \"osl\/module.hxx\"\n#include \"osl\/thread.h\"\n#include \"rtl\/process.h\"\n#include \"rtl\/string.h\"\n#include \"rtl\/string.hxx\"\n#include \"rtl\/textcvt.h\"\n#include \"rtl\/ustring.hxx\"\n#include \"sal\/main.h\"\n#include \"sal\/types.h\"\n\n#include \"preextstl.h\"\n#include \"cppunit\/CompilerOutputter.h\"\n#include \"cppunit\/TestResult.h\"\n#include \"cppunit\/TestResultCollector.h\"\n#include \"cppunit\/TestRunner.h\"\n#include \"cppunit\/extensions\/TestFactoryRegistry.h\"\n#include \"cppunit\/plugin\/PlugInManager.h\"\n#include \"cppunit\/portability\/Stream.h\"\n#include \"postextstl.h\"\n\nnamespace {\n\nvoid usageFailure() {\n    std::cerr\n        << (\"Usage: cppunittester (--protector <shared-library-path>\"\n            \" <function-symbol>)* <shared-library-path>\")\n        << std::endl;\n    std::exit(EXIT_FAILURE);\n}\n\nrtl::OUString getArgument(sal_Int32 index) {\n    rtl::OUString arg;\n    rtl_getAppCommandArg(index, &arg.pData);\n    return arg;\n}\n\nstd::string convertLazy(rtl::OUString const & s16) {\n    rtl::OString s8(rtl::OUStringToOString(s16, osl_getThreadTextEncoding()));\n    return std::string(\n        s8.getStr(),\n        ((static_cast< sal_uInt32 >(s8.getLength())\n          > std::numeric_limits< std::string::size_type >::max())\n         ? std::numeric_limits< std::string::size_type >::max()\n         : static_cast< std::string::size_type >(s8.getLength())));\n}\n\nstd::string convertStrict(rtl::OUString const & s16) {\n    rtl::OString s8;\n    if (!s16.convertToString(\n            &s8, osl_getThreadTextEncoding(),\n            (RTL_UNICODETOTEXT_FLAGS_UNDEFINED_ERROR\n             | RTL_UNICODETOTEXT_FLAGS_INVALID_ERROR))\n        || (static_cast< sal_uInt32 >(s8.getLength())\n            > std::numeric_limits< std::string::size_type >::max()))\n    {\n        std::cerr\n            << \"Failure converting argument from UTF-16 back to system encoding\"\n            << std::endl;\n        std::exit(EXIT_FAILURE);\n    }\n    return std::string(\n        s8.getStr(), static_cast< std::string::size_type >(s8.getLength()));\n}\n\n}\n\nSAL_IMPLEMENT_MAIN() {\n    CppUnit::TestResult result;\n    sal_uInt32 index = 0;\n    for (; index < rtl_getAppCommandArgCount(); index += 3) {\n        if (!getArgument(index).equalsAsciiL(\n                RTL_CONSTASCII_STRINGPARAM(\"--protector\")))\n        {\n            break;\n        }\n        if (rtl_getAppCommandArgCount() - index < 3) {\n            usageFailure();\n        }\n        rtl::OUString lib(getArgument(index + 1));\n        rtl::OUString sym(getArgument(index + 2));\n        oslGenericFunction fn = (new osl::Module(lib, SAL_LOADMODULE_GLOBAL))\n            ->getFunctionSymbol(sym);\n        CppUnit::Protector * p = fn == 0\n            ? 0\n            : (*reinterpret_cast< cppunittester::ProtectorFactory * >(fn))();\n        if (p == 0) {\n            std::cerr\n                << \"Failure instantiating protector \\\"\" << convertLazy(lib)\n                << \"\\\", \\\"\" << convertLazy(sym) << '\"' << std::endl;\n            std::exit(EXIT_FAILURE);\n        }\n        result.pushProtector(p);\n    }\n    if (rtl_getAppCommandArgCount() - index != 1) {\n        usageFailure();\n    }\n    CppUnit::PlugInManager manager;\n    manager.load(convertStrict(getArgument(index)));\n    CppUnit::TestRunner runner;\n    runner.addTest(CppUnit::TestFactoryRegistry::getRegistry().makeTest());\n    CppUnit::TestResultCollector collector;\n    result.addListener(&collector);\n    runner.run(result);\n    CppUnit::CompilerOutputter(&collector, CppUnit::stdCErr()).write();\n    return collector.wasSuccessful() ? EXIT_SUCCESS : EXIT_FAILURE;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>git-svn-id: https:\/\/svn.csail.mit.edu\/drc\/trunk@6865 c7283977-0100-402a-a91a-fa70b306dbfe<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2015 The Shaderc 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 \"shaderc.hpp\"\n\n#include <gmock\/gmock.h>\n#include <gtest\/gtest.h>\n#include <memory>\n#include <thread>\n\n#include \"SPIRV\/spirv.h\"\n\nnamespace {\n\nusing testing::Each;\nusing testing::HasSubstr;\n\nTEST(CppInterface, MultipleCalls) {\n  shaderc::Compiler compiler1, compiler2, compiler3;\n  EXPECT_TRUE(compiler1.IsValid());\n  EXPECT_TRUE(compiler2.IsValid());\n  EXPECT_TRUE(compiler3.IsValid());\n}\n\nTEST(CppInterface, MultipleThreadsInitializing) {\n  std::unique_ptr<shaderc::Compiler> compiler1;\n  std::unique_ptr<shaderc::Compiler> compiler2;\n  std::unique_ptr<shaderc::Compiler> compiler3;\n  std::thread t1([&compiler1]() {\n    compiler1 = std::unique_ptr<shaderc::Compiler>(new shaderc::Compiler());\n  });\n  std::thread t2([&compiler2]() {\n    compiler2 = std::unique_ptr<shaderc::Compiler>(new shaderc::Compiler());\n  });\n  std::thread t3([&compiler3]() {\n    compiler3 = std::unique_ptr<shaderc::Compiler>(new shaderc::Compiler());\n  });\n  t1.join();\n  t2.join();\n  t3.join();\n  EXPECT_TRUE(compiler1->IsValid());\n  EXPECT_TRUE(compiler2->IsValid());\n  EXPECT_TRUE(compiler3->IsValid());\n}\n\n\/\/ Compiles a shader and returns true on success, false on failure.\nbool CompilationSuccess(const shaderc::Compiler& compiler,\n                        const std::string& shader, shaderc_shader_kind kind) {\n  return compiler.CompileGlslToSpv(shader.c_str(), shader.length(), kind)\n      .GetSuccess();\n}\n\n\/\/ Compiles a shader with the given options and returns true on success, false\n\/\/ on failure.\nbool CompilationSuccess(const shaderc::Compiler& compiler,\n                        const std::string& shader, shaderc_shader_kind kind,\n                        const shaderc::CompileOptions& options) {\n  return compiler.CompileGlslToSpv(shader.c_str(), shader.length(), kind,\n                                   options).GetSuccess();\n}\n\n\/\/ Compiles a shader and returns true if the result is valid SPIR-V.\nbool CompilesToValidSpv(const shaderc::Compiler& compiler,\n                        const std::string& shader, shaderc_shader_kind kind) {\n  shaderc::SpvModule result = compiler.CompileGlslToSpv(shader, kind);\n  if (!result.GetSuccess()) return false;\n  size_t length = result.GetLength();\n  if (length < 20) return false;\n  const uint32_t* bytes =\n      static_cast<const uint32_t*>(static_cast<const void*>(result.GetData()));\n  return bytes[0] == spv::MagicNumber;\n}\n\n\/\/ Compiles a shader with the given options and returns true if the result is\n\/\/ valid SPIR-V.\nbool CompilesToValidSpv(const shaderc::Compiler& compiler,\n                        const std::string& shader, shaderc_shader_kind kind,\n                        const shaderc::CompileOptions& options) {\n  shaderc::SpvModule result = compiler.CompileGlslToSpv(shader, kind, options);\n  if (!result.GetSuccess()) return false;\n  size_t length = result.GetLength();\n  if (length < 20) return false;\n  const uint32_t* bytes =\n      static_cast<const uint32_t*>(static_cast<const void*>(result.GetData()));\n  return bytes[0] == spv::MagicNumber;\n}\n\nTEST(CppInterface, CompilerMoves) {\n  shaderc::Compiler compiler;\n  ASSERT_TRUE(compiler.IsValid());\n  shaderc::Compiler compiler2(std::move(compiler));\n  ASSERT_FALSE(compiler.IsValid());\n  ASSERT_TRUE(compiler2.IsValid());\n}\n\nTEST(CppInterface, EmptyString) {\n  shaderc::Compiler compiler;\n  ASSERT_TRUE(compiler.IsValid());\n  EXPECT_FALSE(CompilationSuccess(compiler, \"\", shaderc_glsl_vertex_shader));\n  EXPECT_FALSE(CompilationSuccess(compiler, \"\", shaderc_glsl_fragment_shader));\n}\n\nTEST(CppInterface, ModuleMoves) {\n  shaderc::Compiler compiler;\n  ASSERT_TRUE(compiler.IsValid());\n  shaderc::SpvModule result =\n      compiler.CompileGlslToSpv(\"void main() {}\", shaderc_glsl_vertex_shader);\n  EXPECT_TRUE(result.GetSuccess());\n  shaderc::SpvModule result2(std::move(result));\n  EXPECT_FALSE(result.GetSuccess());\n  EXPECT_TRUE(result2.GetSuccess());\n}\n\nTEST(CppInterface, GarbageString) {\n  shaderc::Compiler compiler;\n  ASSERT_TRUE(compiler.IsValid());\n  EXPECT_FALSE(\n      CompilationSuccess(compiler, \"jfalkds\", shaderc_glsl_vertex_shader));\n  EXPECT_FALSE(\n      CompilationSuccess(compiler, \"jfalkds\", shaderc_glsl_fragment_shader));\n}\n\nTEST(CppInterface, MinimalShader) {\n  shaderc::Compiler compiler;\n  ASSERT_TRUE(compiler.IsValid());\n  const std::string kMinimalShader = \"void main(){}\";\n  EXPECT_TRUE(\n      CompilesToValidSpv(compiler, kMinimalShader, shaderc_glsl_vertex_shader));\n  EXPECT_TRUE(CompilesToValidSpv(compiler, kMinimalShader,\n                                 shaderc_glsl_fragment_shader));\n}\n\nTEST(CppInterface, BasicOptions) {\n  shaderc::Compiler compiler;\n  shaderc::CompileOptions options;\n  ASSERT_TRUE(compiler.IsValid());\n  const std::string kMinimalShader = \"void main(){}\";\n  EXPECT_TRUE(CompilesToValidSpv(compiler, kMinimalShader,\n                                 shaderc_glsl_vertex_shader, options));\n  EXPECT_TRUE(CompilesToValidSpv(compiler, kMinimalShader,\n                                 shaderc_glsl_fragment_shader, options));\n}\n\nTEST(CppInterface, CopiedOptions) {\n  shaderc::Compiler compiler;\n  shaderc::CompileOptions options;\n  ASSERT_TRUE(compiler.IsValid());\n  const std::string kMinimalShader = \"void main(){}\";\n  EXPECT_TRUE(CompilesToValidSpv(compiler, kMinimalShader,\n                                 shaderc_glsl_vertex_shader, options));\n  shaderc::CompileOptions copied_options(options);\n  EXPECT_TRUE(CompilesToValidSpv(compiler, kMinimalShader,\n                                 shaderc_glsl_fragment_shader, copied_options));\n}\n\nTEST(CppInterface, MovedOptions) {\n  shaderc::Compiler compiler;\n  shaderc::CompileOptions options;\n  ASSERT_TRUE(compiler.IsValid());\n  const std::string kMinimalShader = \"void main(){}\";\n  EXPECT_TRUE(CompilesToValidSpv(compiler, kMinimalShader,\n                                 shaderc_glsl_vertex_shader, options));\n  shaderc::CompileOptions copied_options(std::move(options));\n  EXPECT_TRUE(CompilesToValidSpv(compiler, kMinimalShader,\n                                 shaderc_glsl_fragment_shader, copied_options));\n}\n\nTEST(CppInterface, StdAndCString) {\n  shaderc::Compiler compiler;\n  ASSERT_TRUE(compiler.IsValid());\n  const char* kMinimalShader = \"void main(){}\";\n  shaderc::SpvModule result1 = compiler.CompileGlslToSpv(\n      kMinimalShader, strlen(kMinimalShader), shaderc_glsl_fragment_shader);\n  shaderc::SpvModule result2 = compiler.CompileGlslToSpv(\n      std::string(kMinimalShader), shaderc_glsl_fragment_shader);\n  EXPECT_TRUE(result1.GetSuccess());\n  EXPECT_TRUE(result2.GetSuccess());\n  EXPECT_EQ(result1.GetLength(), result2.GetLength());\n  EXPECT_EQ(std::vector<char>(result1.GetData(),\n                              result1.GetData() + result1.GetLength()),\n            std::vector<char>(result2.GetData(),\n                              result2.GetData() + result2.GetLength()));\n}\n\nTEST(CppInterface, ErrorsReported) {\n  shaderc::Compiler compiler;\n  ASSERT_TRUE(compiler.IsValid());\n  shaderc::SpvModule result = compiler.CompileGlslToSpv(\n      \"int f(){return wrongname;}\", shaderc_glsl_vertex_shader);\n  ASSERT_FALSE(result.GetSuccess());\n  EXPECT_THAT(result.GetErrorMessage(), HasSubstr(\"wrongname\"));\n}\n\nTEST(CppInterface, MultipleThreadsCalling) {\n  shaderc::Compiler compiler;\n  ASSERT_TRUE(compiler.IsValid());\n  bool results[10];\n  std::vector<std::thread> threads;\n  for (auto& r : results) {\n    threads.emplace_back([&compiler, &r]() {\n      r = CompilationSuccess(compiler, \"void main(){}\",\n                             shaderc_glsl_vertex_shader);\n    });\n  }\n  for (auto& t : threads) {\n    t.join();\n  }\n  EXPECT_THAT(results, Each(true));\n}\n\nTEST(CppInterface, AccessorsOnNullModule) {\n  shaderc::SpvModule result(nullptr);\n  EXPECT_FALSE(result.GetSuccess());\n  EXPECT_EQ(std::string(), result.GetErrorMessage());\n  EXPECT_EQ(std::string(), result.GetData());\n  EXPECT_EQ(0u, result.GetLength());\n}\n\nTEST(CppInterface, MacroCompileOptions) {\n  shaderc::Compiler compiler;\n  shaderc::CompileOptions options;\n  options.AddMacroDefinition(\"E\", \"main\");\n  const std::string kMinimalExpandedShader = \"void E(){}\";\n  const std::string kMinimalDoubleExpandedShader = \"F E(){}\";\n  EXPECT_TRUE(compiler.CompileGlslToSpv(kMinimalExpandedShader,\n                                        shaderc_glsl_vertex_shader,\n                                        options).GetSuccess());\n\n  shaderc::CompileOptions cloned_options(options);\n  \/\/ The simplest should still compile with the cloned options.\n  EXPECT_TRUE(compiler.CompileGlslToSpv(kMinimalExpandedShader,\n                                        shaderc_glsl_vertex_shader,\n                                        cloned_options).GetSuccess());\n\n  EXPECT_FALSE(compiler.CompileGlslToSpv(kMinimalDoubleExpandedShader,\n                                         shaderc_glsl_vertex_shader,\n                                         cloned_options).GetSuccess());\n\n  cloned_options.AddMacroDefinition(\"F\", \"void\");\n  \/\/ This should still not work with the original options.\n  EXPECT_FALSE(compiler.CompileGlslToSpv(kMinimalDoubleExpandedShader,\n                                         shaderc_glsl_vertex_shader,\n                                         options).GetSuccess());\n  \/\/ This should work with the cloned options that have the additional\n  \/\/ parameter.\n  EXPECT_TRUE(compiler.CompileGlslToSpv(kMinimalDoubleExpandedShader,\n                                        shaderc_glsl_vertex_shader,\n                                        cloned_options).GetSuccess());\n}\n\n}  \/\/ anonymous namespace\n<commit_msg>DRY kMinimalShader in shaderc_cpp_test.cc.<commit_after>\/\/ Copyright 2015 The Shaderc 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 \"shaderc.hpp\"\n\n#include <gmock\/gmock.h>\n#include <gtest\/gtest.h>\n#include <memory>\n#include <thread>\n\n#include \"SPIRV\/spirv.h\"\n\nnamespace {\n\nusing testing::Each;\nusing testing::HasSubstr;\n\nconst char kMinimalShader[] = \"void main(){}\";\n\nTEST(CppInterface, MultipleCalls) {\n  shaderc::Compiler compiler1, compiler2, compiler3;\n  EXPECT_TRUE(compiler1.IsValid());\n  EXPECT_TRUE(compiler2.IsValid());\n  EXPECT_TRUE(compiler3.IsValid());\n}\n\nTEST(CppInterface, MultipleThreadsInitializing) {\n  std::unique_ptr<shaderc::Compiler> compiler1;\n  std::unique_ptr<shaderc::Compiler> compiler2;\n  std::unique_ptr<shaderc::Compiler> compiler3;\n  std::thread t1([&compiler1]() {\n    compiler1 = std::unique_ptr<shaderc::Compiler>(new shaderc::Compiler());\n  });\n  std::thread t2([&compiler2]() {\n    compiler2 = std::unique_ptr<shaderc::Compiler>(new shaderc::Compiler());\n  });\n  std::thread t3([&compiler3]() {\n    compiler3 = std::unique_ptr<shaderc::Compiler>(new shaderc::Compiler());\n  });\n  t1.join();\n  t2.join();\n  t3.join();\n  EXPECT_TRUE(compiler1->IsValid());\n  EXPECT_TRUE(compiler2->IsValid());\n  EXPECT_TRUE(compiler3->IsValid());\n}\n\n\/\/ Compiles a shader and returns true on success, false on failure.\nbool CompilationSuccess(const shaderc::Compiler& compiler,\n                        const std::string& shader, shaderc_shader_kind kind) {\n  return compiler.CompileGlslToSpv(shader.c_str(), shader.length(), kind)\n      .GetSuccess();\n}\n\n\/\/ Compiles a shader with the given options and returns true on success, false\n\/\/ on failure.\nbool CompilationSuccess(const shaderc::Compiler& compiler,\n                        const std::string& shader, shaderc_shader_kind kind,\n                        const shaderc::CompileOptions& options) {\n  return compiler.CompileGlslToSpv(shader.c_str(), shader.length(), kind,\n                                   options)\n      .GetSuccess();\n}\n\n\/\/ Compiles a shader and returns true if the result is valid SPIR-V.\nbool CompilesToValidSpv(const shaderc::Compiler& compiler,\n                        const std::string& shader, shaderc_shader_kind kind) {\n  shaderc::SpvModule result = compiler.CompileGlslToSpv(shader, kind);\n  if (!result.GetSuccess()) return false;\n  size_t length = result.GetLength();\n  if (length < 20) return false;\n  const uint32_t* bytes =\n      static_cast<const uint32_t*>(static_cast<const void*>(result.GetData()));\n  return bytes[0] == spv::MagicNumber;\n}\n\n\/\/ Compiles a shader with the given options and returns true if the result is\n\/\/ valid SPIR-V.\nbool CompilesToValidSpv(const shaderc::Compiler& compiler,\n                        const std::string& shader, shaderc_shader_kind kind,\n                        const shaderc::CompileOptions& options) {\n  shaderc::SpvModule result = compiler.CompileGlslToSpv(shader, kind, options);\n  if (!result.GetSuccess()) return false;\n  size_t length = result.GetLength();\n  if (length < 20) return false;\n  const uint32_t* bytes =\n      static_cast<const uint32_t*>(static_cast<const void*>(result.GetData()));\n  return bytes[0] == spv::MagicNumber;\n}\n\nTEST(CppInterface, CompilerMoves) {\n  shaderc::Compiler compiler;\n  ASSERT_TRUE(compiler.IsValid());\n  shaderc::Compiler compiler2(std::move(compiler));\n  ASSERT_FALSE(compiler.IsValid());\n  ASSERT_TRUE(compiler2.IsValid());\n}\n\nTEST(CppInterface, EmptyString) {\n  shaderc::Compiler compiler;\n  ASSERT_TRUE(compiler.IsValid());\n  EXPECT_FALSE(CompilationSuccess(compiler, \"\", shaderc_glsl_vertex_shader));\n  EXPECT_FALSE(CompilationSuccess(compiler, \"\", shaderc_glsl_fragment_shader));\n}\n\nTEST(CppInterface, ModuleMoves) {\n  shaderc::Compiler compiler;\n  ASSERT_TRUE(compiler.IsValid());\n  shaderc::SpvModule result =\n      compiler.CompileGlslToSpv(kMinimalShader, shaderc_glsl_vertex_shader);\n  EXPECT_TRUE(result.GetSuccess());\n  shaderc::SpvModule result2(std::move(result));\n  EXPECT_FALSE(result.GetSuccess());\n  EXPECT_TRUE(result2.GetSuccess());\n}\n\nTEST(CppInterface, GarbageString) {\n  shaderc::Compiler compiler;\n  ASSERT_TRUE(compiler.IsValid());\n  EXPECT_FALSE(\n      CompilationSuccess(compiler, \"jfalkds\", shaderc_glsl_vertex_shader));\n  EXPECT_FALSE(\n      CompilationSuccess(compiler, \"jfalkds\", shaderc_glsl_fragment_shader));\n}\n\nTEST(CppInterface, MinimalShader) {\n  shaderc::Compiler compiler;\n  ASSERT_TRUE(compiler.IsValid());\n  EXPECT_TRUE(\n      CompilesToValidSpv(compiler, kMinimalShader, shaderc_glsl_vertex_shader));\n  EXPECT_TRUE(CompilesToValidSpv(compiler, kMinimalShader,\n                                 shaderc_glsl_fragment_shader));\n}\n\nTEST(CppInterface, BasicOptions) {\n  shaderc::Compiler compiler;\n  shaderc::CompileOptions options;\n  ASSERT_TRUE(compiler.IsValid());\n  EXPECT_TRUE(CompilesToValidSpv(compiler, kMinimalShader,\n                                 shaderc_glsl_vertex_shader, options));\n  EXPECT_TRUE(CompilesToValidSpv(compiler, kMinimalShader,\n                                 shaderc_glsl_fragment_shader, options));\n}\n\nTEST(CppInterface, CopiedOptions) {\n  shaderc::Compiler compiler;\n  shaderc::CompileOptions options;\n  ASSERT_TRUE(compiler.IsValid());\n  EXPECT_TRUE(CompilesToValidSpv(compiler, kMinimalShader,\n                                 shaderc_glsl_vertex_shader, options));\n  shaderc::CompileOptions copied_options(options);\n  EXPECT_TRUE(CompilesToValidSpv(compiler, kMinimalShader,\n                                 shaderc_glsl_fragment_shader, copied_options));\n}\n\nTEST(CppInterface, MovedOptions) {\n  shaderc::Compiler compiler;\n  shaderc::CompileOptions options;\n  ASSERT_TRUE(compiler.IsValid());\n  EXPECT_TRUE(CompilesToValidSpv(compiler, kMinimalShader,\n                                 shaderc_glsl_vertex_shader, options));\n  shaderc::CompileOptions copied_options(std::move(options));\n  EXPECT_TRUE(CompilesToValidSpv(compiler, kMinimalShader,\n                                 shaderc_glsl_fragment_shader, copied_options));\n}\n\nTEST(CppInterface, StdAndCString) {\n  shaderc::Compiler compiler;\n  ASSERT_TRUE(compiler.IsValid());\n  shaderc::SpvModule result1 = compiler.CompileGlslToSpv(\n      kMinimalShader, strlen(kMinimalShader), shaderc_glsl_fragment_shader);\n  shaderc::SpvModule result2 = compiler.CompileGlslToSpv(\n      std::string(kMinimalShader), shaderc_glsl_fragment_shader);\n  EXPECT_TRUE(result1.GetSuccess());\n  EXPECT_TRUE(result2.GetSuccess());\n  EXPECT_EQ(result1.GetLength(), result2.GetLength());\n  EXPECT_EQ(std::vector<char>(result1.GetData(),\n                              result1.GetData() + result1.GetLength()),\n            std::vector<char>(result2.GetData(),\n                              result2.GetData() + result2.GetLength()));\n}\n\nTEST(CppInterface, ErrorsReported) {\n  shaderc::Compiler compiler;\n  ASSERT_TRUE(compiler.IsValid());\n  shaderc::SpvModule result = compiler.CompileGlslToSpv(\n      \"int f(){return wrongname;}\", shaderc_glsl_vertex_shader);\n  ASSERT_FALSE(result.GetSuccess());\n  EXPECT_THAT(result.GetErrorMessage(), HasSubstr(\"wrongname\"));\n}\n\nTEST(CppInterface, MultipleThreadsCalling) {\n  shaderc::Compiler compiler;\n  ASSERT_TRUE(compiler.IsValid());\n  bool results[10];\n  std::vector<std::thread> threads;\n  for (auto& r : results) {\n    threads.emplace_back([&compiler, &r]() {\n      r = CompilationSuccess(compiler, kMinimalShader,\n                             shaderc_glsl_vertex_shader);\n    });\n  }\n  for (auto& t : threads) {\n    t.join();\n  }\n  EXPECT_THAT(results, Each(true));\n}\n\nTEST(CppInterface, AccessorsOnNullModule) {\n  shaderc::SpvModule result(nullptr);\n  EXPECT_FALSE(result.GetSuccess());\n  EXPECT_EQ(std::string(), result.GetErrorMessage());\n  EXPECT_EQ(std::string(), result.GetData());\n  EXPECT_EQ(0u, result.GetLength());\n}\n\nTEST(CppInterface, MacroCompileOptions) {\n  shaderc::Compiler compiler;\n  shaderc::CompileOptions options;\n  options.AddMacroDefinition(\"E\", \"main\");\n  const std::string kMinimalExpandedShader = \"void E(){}\";\n  const std::string kMinimalDoubleExpandedShader = \"F E(){}\";\n  EXPECT_TRUE(compiler.CompileGlslToSpv(kMinimalExpandedShader,\n                                        shaderc_glsl_vertex_shader, options)\n                  .GetSuccess());\n\n  shaderc::CompileOptions cloned_options(options);\n  \/\/ The simplest should still compile with the cloned options.\n  EXPECT_TRUE(compiler.CompileGlslToSpv(kMinimalExpandedShader,\n                                        shaderc_glsl_vertex_shader,\n                                        cloned_options)\n                  .GetSuccess());\n\n  EXPECT_FALSE(compiler.CompileGlslToSpv(kMinimalDoubleExpandedShader,\n                                         shaderc_glsl_vertex_shader,\n                                         cloned_options)\n                   .GetSuccess());\n\n  cloned_options.AddMacroDefinition(\"F\", \"void\");\n  \/\/ This should still not work with the original options.\n  EXPECT_FALSE(compiler.CompileGlslToSpv(kMinimalDoubleExpandedShader,\n                                         shaderc_glsl_vertex_shader, options)\n                   .GetSuccess());\n  \/\/ This should work with the cloned options that have the additional\n  \/\/ parameter.\n  EXPECT_TRUE(compiler.CompileGlslToSpv(kMinimalDoubleExpandedShader,\n                                        shaderc_glsl_vertex_shader,\n                                        cloned_options)\n                  .GetSuccess());\n}\n\n}  \/\/ anonymous namespace\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 \"utils\/logger.h\"\n\nnamespace media_manager {\n\nCREATE_LOGGERPTR_GLOBAL(logger_, \"MediaManager\")\n\nGMainLoop* FromMicToFileRecorderThread::loop = NULL;\n\nFromMicToFileRecorderThread::FromMicToFileRecorderThread(\n    const std::string& output_file, int32_t duration)\n    : threads::ThreadDelegate()\n    , argc_(5)\n    , argv_(NULL)\n    , oKey_(\"-o\")\n    , tKey_(\"-t\")\n    , sleepThread_(NULL)\n    , outputFileName_(output_file) {\n  LOG4CXX_AUTO_TRACE(logger_);\n  set_record_duration(duration);\n}\n\nFromMicToFileRecorderThread::~FromMicToFileRecorderThread() {\n  LOG4CXX_AUTO_TRACE(logger_);\n  if (sleepThread_) {\n    sleepThread_->join();\n    delete sleepThread_->delegate();\n    threads::DeleteThread(sleepThread_);\n  }\n}\n\nvoid FromMicToFileRecorderThread::set_output_file(\n    const std::string& output_file) {\n  LOG4CXX_AUTO_TRACE(logger_);\n  outputFileName_ = output_file;\n}\n\nvoid FromMicToFileRecorderThread::set_record_duration(int32_t duration) {\n  LOG4CXX_AUTO_TRACE(logger_);\n\n  std::stringstream stringStream;\n  stringStream << duration \/ 1000;\n  durationString_ = stringStream.str();\n}\n\nvoid FromMicToFileRecorderThread::initArgs() {\n  LOG4CXX_AUTO_TRACE(logger_);\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  LOG4CXX_AUTO_TRACE(logger_);\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  LOG4CXX_AUTO_TRACE(logger_);\n\n  {\n    sync_primitives::AutoLock auto_lock(stopFlagLock_);\n    shouldBeStoped_ = false;\n  }\n\n  initArgs();\n\n  GstElement* pipeline;\n  GstElement* alsasrc, *wavenc, *filesink;\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  LOG4CXX_TRACE(logger_, \"Reading from device: \" << device);\n  LOG4CXX_TRACE(logger_, \"Saving pipeline output to: \" << outfile);\n  LOG4CXX_TRACE(logger_, \"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  wavenc = gst_element_factory_make(\"wavenc\", \"wavenc0\");\n  filesink = gst_element_factory_make(\"filesink\", \"filesink0\");\n\n  \/\/ Assert that all the elements were created\n  if (!alsasrc || !wavenc || !filesink) {\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), alsasrc, wavenc, filesink, NULL);\n\n  \/\/ Link the elements\n  gst_element_link_many(alsasrc, wavenc, filesink, NULL);\n\n  gst_element_set_state(pipeline, GST_STATE_PLAYING);\n\n  LOG4CXX_TRACE(logger_, \"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  LOG4CXX_TRACE(logger_, \"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  LOG4CXX_TRACE(logger_, \"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\nFromMicToFileRecorderThread::SleepThreadDelegate::SleepThreadDelegate(\n    GstTimeout timeout)\n    : threads::ThreadDelegate(), timeout_(timeout) {}\n\nvoid FromMicToFileRecorderThread::SleepThreadDelegate::threadMain() {\n  LOG4CXX_TRACE(logger_, \"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  LOG4CXX_AUTO_TRACE(logger_);\n\n  if (NULL != loop) {\n    if (g_main_loop_is_running(loop)) {\n      LOG4CXX_TRACE(logger_, \"Quit loop\\n\");\n      g_main_loop_quit(loop);\n    }\n  }\n\n  if (sleepThread_) {\n    LOG4CXX_DEBUG(logger_, \"Stop sleep thread\\n\");\n    sleepThread_->stop();\n  }\n\n  LOG4CXX_TRACE(logger_, \"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: make sure to run AudioPassThru in monaural<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 \"utils\/logger.h\"\n\nnamespace media_manager {\n\nCREATE_LOGGERPTR_GLOBAL(logger_, \"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, int32_t duration)\n    : threads::ThreadDelegate()\n    , argc_(5)\n    , argv_(NULL)\n    , oKey_(\"-o\")\n    , tKey_(\"-t\")\n    , sleepThread_(NULL)\n    , outputFileName_(output_file) {\n  LOG4CXX_AUTO_TRACE(logger_);\n  set_record_duration(duration);\n}\n\nFromMicToFileRecorderThread::~FromMicToFileRecorderThread() {\n  LOG4CXX_AUTO_TRACE(logger_);\n  if (sleepThread_) {\n    sleepThread_->join();\n    delete sleepThread_->delegate();\n    threads::DeleteThread(sleepThread_);\n  }\n}\n\nvoid FromMicToFileRecorderThread::set_output_file(\n    const std::string& output_file) {\n  LOG4CXX_AUTO_TRACE(logger_);\n  outputFileName_ = output_file;\n}\n\nvoid FromMicToFileRecorderThread::set_record_duration(int32_t duration) {\n  LOG4CXX_AUTO_TRACE(logger_);\n\n  std::stringstream stringStream;\n  stringStream << duration \/ 1000;\n  durationString_ = stringStream.str();\n}\n\nvoid FromMicToFileRecorderThread::initArgs() {\n  LOG4CXX_AUTO_TRACE(logger_);\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  LOG4CXX_AUTO_TRACE(logger_);\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  LOG4CXX_AUTO_TRACE(logger_);\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  LOG4CXX_TRACE(logger_, \"Reading from device: \" << device);\n  LOG4CXX_TRACE(logger_, \"Saving pipeline output to: \" << outfile);\n  LOG4CXX_TRACE(logger_, \"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 downmix the recorded audio to monaural\n  audiocaps = gst_caps_new_simple(\n      \"audio\/x-raw\", \"channels\", G_TYPE_INT, kNumAudioChannels, NULL);\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  LOG4CXX_TRACE(logger_, \"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  LOG4CXX_TRACE(logger_, \"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  LOG4CXX_TRACE(logger_, \"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\nFromMicToFileRecorderThread::SleepThreadDelegate::SleepThreadDelegate(\n    GstTimeout timeout)\n    : threads::ThreadDelegate(), timeout_(timeout) {}\n\nvoid FromMicToFileRecorderThread::SleepThreadDelegate::threadMain() {\n  LOG4CXX_TRACE(logger_, \"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  LOG4CXX_AUTO_TRACE(logger_);\n\n  if (NULL != loop) {\n    if (g_main_loop_is_running(loop)) {\n      LOG4CXX_TRACE(logger_, \"Quit loop\\n\");\n      g_main_loop_quit(loop);\n    }\n  }\n\n  if (sleepThread_) {\n    LOG4CXX_DEBUG(logger_, \"Stop sleep thread\\n\");\n    sleepThread_->stop();\n  }\n\n  LOG4CXX_TRACE(logger_, \"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>\/*\n * gallerytiltshiftplugin.cpp\n *\n * Copyright (C) 2012 Igalia, S.L.\n * Author: Simon Pena <spena@igalia.com>\n *\n * This file is part of the Gallery Tilt Shift Plugin.\n *\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 * as published by the Free Software Foundation; version 2.1 of\n * the License, or (at your option) any later version.\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, see http:\/\/www.gnu.org\/licenses\/ *\n *\/\n\n#include \"gallerytiltshiftplugin.h\"\n#include \"gallerytiltshiftplugin_p.h\"\n#include \"gallerytiltshiftwidget.h\"\n\n#include <galleryedituiprovider.h>\n\n#include <MApplication>\n#include <MMessageBox>\n#include <MBanner>\n#include <MLabel>\n#include <MLibrary>\n#include <MSceneWindow>\n#include <QuillImageFilter>\n#include <QDesktopServices>\n#include <QGraphicsLinearLayout>\n#include <QGraphicsSceneMouseEvent>\n#include <QUrl>\n\nstatic const int PORTRAIT_HEIGHT        = 224;\nstatic const int LANDSCAPE_HEIGHT       = 170;\nstatic const int TAP_DISTANCE           = 20;\nstatic const int INFO_BANNER_TIMEOUT    = 2000;\n\nM_LIBRARY\n\nGalleryTiltShiftPluginPrivate::GalleryTiltShiftPluginPrivate() :\n    m_focusPosition(),\n    m_validImage(true)\n{\n}\n\nGalleryTiltShiftPluginPrivate::~GalleryTiltShiftPluginPrivate()\n{\n}\n\nGalleryTiltShiftPlugin::GalleryTiltShiftPlugin(QObject* parent):\n    GalleryEditPlugin(parent),\n    d_ptr(new GalleryTiltShiftPluginPrivate())\n{\n}\n\n\nGalleryTiltShiftPlugin::~GalleryTiltShiftPlugin()\n{\n    delete d_ptr;\n}\n\n\nQString GalleryTiltShiftPlugin::name() const\n{\n    return QString(\"Tilt Shift\");\n}\n\nint GalleryTiltShiftPlugin::menuIndex() const\n{\n    return 10;\n}\n\nQString GalleryTiltShiftPlugin::iconID() const\n{\n    return QString(\"icon-m-image-edit-tilt-shift\");\n}\n\nbool GalleryTiltShiftPlugin::containsUi() const\n{\n    return true;\n}\n\nvoid GalleryTiltShiftPlugin::paint(QPainter* painter,\n                                   const QStyleOptionGraphicsItem* option,\n                                   QWidget* widget)\n{\n    Q_UNUSED(painter)\n    Q_UNUSED(option)\n    Q_UNUSED(widget)\n\n    if (editUiProvider() && toolBarWidget()) {\n        GalleryTiltShiftWidget* widget = static_cast<GalleryTiltShiftWidget*>(toolBarWidget());\n        if (widget->isSliderHandleLabelVisible()) {\n            const QString text = QString(\"%L1\").arg(widget->sliderValue());\n            widget->setSliderHandleText(text);\n        }\n    }\n}\n\nQGraphicsWidget* GalleryTiltShiftPlugin::createToolBarWidget(QGraphicsItem* parent)\n{\n    GalleryTiltShiftWidget* pluginWidget = new GalleryTiltShiftWidget(parent);\n    connect(pluginWidget, SIGNAL(applicationOrientationChanged()),\n            SLOT(performEditOperation()));\n    connect(pluginWidget, SIGNAL(sliderValueChanged()),\n            SLOT(performEditOperation()));\n    connect(pluginWidget, SIGNAL(aboutLinkActivated(QString)),\n            SLOT(onAboutLinkActivated(QString)));\n    return pluginWidget;\n}\n\nbool GalleryTiltShiftPlugin::receiveMouseEvent(QGraphicsSceneMouseEvent* event)\n{\n    if (event &&\n            event->type() == QEvent::GraphicsSceneMouseRelease &&\n            event->button() == Qt::LeftButton &&\n            (event->scenePos() - event->buttonDownScenePos(Qt::LeftButton)).manhattanLength() < TAP_DISTANCE) {\n        Q_D(GalleryTiltShiftPlugin);\n        if (d->m_validImage) {\n            d->m_focusPosition.setX(event->pos().toPoint().x());\n            d->m_focusPosition.setY(event->pos().toPoint().y());\n            performEditOperation();\n            return true;\n        }\n    }\n    return false;\n}\n\nconst QSize GalleryTiltShiftPlugin::toolBarWidgetSize(const M::Orientation& orientation) const\n{\n    QSize size = GalleryEditPlugin::toolBarWidgetSize(orientation);\n\n    if (M::Portrait == orientation) {\n        size.setHeight(PORTRAIT_HEIGHT);\n    } else {\n        size.setHeight(LANDSCAPE_HEIGHT);\n    }\n\n    return size;\n}\n\nvoid GalleryTiltShiftPlugin::performEditOperation()\n{\n    if (editUiProvider()) {\n        Q_D(GalleryTiltShiftPlugin);\n        GalleryTiltShiftWidget* widget = static_cast<GalleryTiltShiftWidget*>(toolBarWidget());\n        const QPoint imagePoint = editUiProvider()->convertScreenCoordToImageCoord(d->m_focusPosition);\n        if (imagePoint != QPoint(-1,-1)) {\n            QHash<QuillImageFilter::QuillFilterOption, QVariant> optionHash;\n            optionHash.insert(QuillImageFilter::Center,\n                              imagePoint);\n            optionHash.insert(QuillImageFilter::Radius,\n                              QVariant(widget->sliderValue()));\n            optionHash.insert(QuillImageFilter::Horizontal,\n                              QVariant(widget->applicationOrientation() == Qt::Horizontal));\n            editUiProvider()->runEditFilter(\"com.igalia.tiltshift\", optionHash, true);\n            emit editOperationPerformed();\n        }\n    }\n}\n\nvoid GalleryTiltShiftPlugin::activate()\n{\n    if (editUiProvider()) {\n        Q_D(GalleryTiltShiftPlugin);\n        d->m_validImage = editUiProvider()->fullImageSize().height() <= 512 &&\n                editUiProvider()->fullImageSize().width() <= 512;\n        if (d->m_validImage) {\n            showInfoBanner(\"Tap on an area to keep it focused\");\n        } else {\n            GalleryTiltShiftWidget* widget = static_cast<GalleryTiltShiftWidget*>(toolBarWidget());\n            widget->setEnabled(d->m_validImage);\n        }\n    }\n}\n\nvoid GalleryTiltShiftPlugin::onAboutLinkActivated(const QString &link)\n{\n    Q_UNUSED(link)\n    if (link.toLower().startsWith(\"http\")) {\n        QDesktopServices::openUrl(QUrl(link));\n    } else {\n        showMessageBox(\"About Tilt Shift plugin\",\n                       \"Copyright (c) 2012 Igalia S.L.\"\n                       \"<br \/>\"\n                       \"<a href=\\\"mailto:spena@igalia.com\\\">spena@igalia.com<\/a> | \"\n                       \"<a href=\\\"http:\/\/www.igalia.com\\\">www.igalia.com<\/a>\"\n                       \"<br \/>\"\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                       \"as published by the Free Software Foundation; version 2.1 of \"\n                       \"the License, or (at your option) any later version.\");\n    }\n}\n\nMMessageBox* GalleryTiltShiftPlugin::showMessageBox(const QString& title, const QString& text) const\n{\n    MMessageBox* messageBox = new MMessageBox(title,\n                                              text);\n    connect(this, SIGNAL(deactivated()),\n            messageBox, SLOT(disappear()));\n    messageBox->appear(MSceneWindow::DestroyWhenDone);\n\n    return messageBox;\n}\n\nMBanner* GalleryTiltShiftPlugin::showInfoBanner(const QString& title) const\n{\n    MBanner *infoBanner = new MBanner;\n    infoBanner->setTitle(title);\n    infoBanner->setStyleName(\"InformationBanner\");\n    infoBanner->model()->setDisappearTimeout(2000);\n    connect(this, SIGNAL(deactivated()),\n            infoBanner, SLOT(disappear()));\n\n    infoBanner->appear(MApplication::activeWindow(), MSceneWindow::DestroyWhenDone);\n\n    return infoBanner;\n}\n\nQ_EXPORT_PLUGIN2(gallerytiltshiftplugin, GalleryTiltShiftPlugin)\n\n<commit_msg>Notify the user when the image is too large for the filter<commit_after>\/*\n * gallerytiltshiftplugin.cpp\n *\n * Copyright (C) 2012 Igalia, S.L.\n * Author: Simon Pena <spena@igalia.com>\n *\n * This file is part of the Gallery Tilt Shift Plugin.\n *\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 * as published by the Free Software Foundation; version 2.1 of\n * the License, or (at your option) any later version.\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, see http:\/\/www.gnu.org\/licenses\/ *\n *\/\n\n#include \"gallerytiltshiftplugin.h\"\n#include \"gallerytiltshiftplugin_p.h\"\n#include \"gallerytiltshiftwidget.h\"\n\n#include <galleryedituiprovider.h>\n\n#include <MApplication>\n#include <MMessageBox>\n#include <MBanner>\n#include <MLabel>\n#include <MLibrary>\n#include <MSceneWindow>\n#include <QuillImageFilter>\n#include <QDesktopServices>\n#include <QGraphicsLinearLayout>\n#include <QGraphicsSceneMouseEvent>\n#include <QUrl>\n\nstatic const int PORTRAIT_HEIGHT        = 224;\nstatic const int LANDSCAPE_HEIGHT       = 170;\nstatic const int TAP_DISTANCE           = 20;\nstatic const int INFO_BANNER_TIMEOUT    = 2000;\n\nM_LIBRARY\n\nGalleryTiltShiftPluginPrivate::GalleryTiltShiftPluginPrivate() :\n    m_focusPosition(),\n    m_validImage(true)\n{\n}\n\nGalleryTiltShiftPluginPrivate::~GalleryTiltShiftPluginPrivate()\n{\n}\n\nGalleryTiltShiftPlugin::GalleryTiltShiftPlugin(QObject* parent):\n    GalleryEditPlugin(parent),\n    d_ptr(new GalleryTiltShiftPluginPrivate())\n{\n}\n\n\nGalleryTiltShiftPlugin::~GalleryTiltShiftPlugin()\n{\n    delete d_ptr;\n}\n\n\nQString GalleryTiltShiftPlugin::name() const\n{\n    return QString(\"Tilt Shift\");\n}\n\nint GalleryTiltShiftPlugin::menuIndex() const\n{\n    return 10;\n}\n\nQString GalleryTiltShiftPlugin::iconID() const\n{\n    return QString(\"icon-m-image-edit-tilt-shift\");\n}\n\nbool GalleryTiltShiftPlugin::containsUi() const\n{\n    return true;\n}\n\nvoid GalleryTiltShiftPlugin::paint(QPainter* painter,\n                                   const QStyleOptionGraphicsItem* option,\n                                   QWidget* widget)\n{\n    Q_UNUSED(painter)\n    Q_UNUSED(option)\n    Q_UNUSED(widget)\n\n    if (editUiProvider() && toolBarWidget()) {\n        GalleryTiltShiftWidget* widget = static_cast<GalleryTiltShiftWidget*>(toolBarWidget());\n        if (widget->isSliderHandleLabelVisible()) {\n            const QString text = QString(\"%L1\").arg(widget->sliderValue());\n            widget->setSliderHandleText(text);\n        }\n    }\n}\n\nQGraphicsWidget* GalleryTiltShiftPlugin::createToolBarWidget(QGraphicsItem* parent)\n{\n    GalleryTiltShiftWidget* pluginWidget = new GalleryTiltShiftWidget(parent);\n    connect(pluginWidget, SIGNAL(applicationOrientationChanged()),\n            SLOT(performEditOperation()));\n    connect(pluginWidget, SIGNAL(sliderValueChanged()),\n            SLOT(performEditOperation()));\n    connect(pluginWidget, SIGNAL(aboutLinkActivated(QString)),\n            SLOT(onAboutLinkActivated(QString)));\n    return pluginWidget;\n}\n\nbool GalleryTiltShiftPlugin::receiveMouseEvent(QGraphicsSceneMouseEvent* event)\n{\n    if (event &&\n            event->type() == QEvent::GraphicsSceneMouseRelease &&\n            event->button() == Qt::LeftButton &&\n            (event->scenePos() - event->buttonDownScenePos(Qt::LeftButton)).manhattanLength() < TAP_DISTANCE) {\n        Q_D(GalleryTiltShiftPlugin);\n        if (d->m_validImage) {\n            d->m_focusPosition.setX(event->pos().toPoint().x());\n            d->m_focusPosition.setY(event->pos().toPoint().y());\n            performEditOperation();\n            return true;\n        } else {\n            showInfoBanner(\"Plugin disabled for this image size\");\n        }\n    }\n    return false;\n}\n\nconst QSize GalleryTiltShiftPlugin::toolBarWidgetSize(const M::Orientation& orientation) const\n{\n    QSize size = GalleryEditPlugin::toolBarWidgetSize(orientation);\n\n    if (M::Portrait == orientation) {\n        size.setHeight(PORTRAIT_HEIGHT);\n    } else {\n        size.setHeight(LANDSCAPE_HEIGHT);\n    }\n\n    return size;\n}\n\nvoid GalleryTiltShiftPlugin::performEditOperation()\n{\n    if (editUiProvider()) {\n        Q_D(GalleryTiltShiftPlugin);\n        GalleryTiltShiftWidget* widget = static_cast<GalleryTiltShiftWidget*>(toolBarWidget());\n        const QPoint imagePoint = editUiProvider()->convertScreenCoordToImageCoord(d->m_focusPosition);\n        if (imagePoint != QPoint(-1,-1)) {\n            QHash<QuillImageFilter::QuillFilterOption, QVariant> optionHash;\n            optionHash.insert(QuillImageFilter::Center,\n                              imagePoint);\n            optionHash.insert(QuillImageFilter::Radius,\n                              QVariant(widget->sliderValue()));\n            optionHash.insert(QuillImageFilter::Horizontal,\n                              QVariant(widget->applicationOrientation() == Qt::Horizontal));\n            editUiProvider()->runEditFilter(\"com.igalia.tiltshift\", optionHash, true);\n            emit editOperationPerformed();\n        }\n    }\n}\n\nvoid GalleryTiltShiftPlugin::activate()\n{\n    if (editUiProvider()) {\n        Q_D(GalleryTiltShiftPlugin);\n        d->m_validImage = editUiProvider()->fullImageSize().height() <= 512 &&\n                editUiProvider()->fullImageSize().width() <= 512;\n        if (d->m_validImage) {\n            showInfoBanner(\"Tap on an area to keep it focused\");\n        } else {\n            showMessageBox(\"Tilt Shift plugin limitations\",\n                           \"Gallery Tilt Shift plugin is currently limited to small images (512x512)<br \/>\"\n                           \"For a given image:\"\n                           \"<ol>\"\n                           \"<li>Scale it or crop it<\/li>\"\n                           \"<li>Save it with a different name<\/li>\"\n                           \"<li>Apply the filter to the new one<\/li>\"\n                           \"<\/ol>\");\n            GalleryTiltShiftWidget* widget = static_cast<GalleryTiltShiftWidget*>(toolBarWidget());\n            widget->setEnabled(d->m_validImage);\n        }\n    }\n}\n\nvoid GalleryTiltShiftPlugin::onAboutLinkActivated(const QString &link)\n{\n    Q_UNUSED(link)\n    if (link.toLower().startsWith(\"http\")) {\n        QDesktopServices::openUrl(QUrl(link));\n    } else {\n        showMessageBox(\"About Tilt Shift plugin\",\n                       \"Copyright (c) 2012 Igalia S.L.\"\n                       \"<br \/>\"\n                       \"<a href=\\\"mailto:spena@igalia.com\\\">spena@igalia.com<\/a> | \"\n                       \"<a href=\\\"http:\/\/www.igalia.com\\\">www.igalia.com<\/a>\"\n                       \"<br \/>\"\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                       \"as published by the Free Software Foundation; version 2.1 of \"\n                       \"the License, or (at your option) any later version.\");\n    }\n}\n\nMMessageBox* GalleryTiltShiftPlugin::showMessageBox(const QString& title, const QString& text) const\n{\n    MMessageBox* messageBox = new MMessageBox(title,\n                                              text);\n    connect(this, SIGNAL(deactivated()),\n            messageBox, SLOT(disappear()));\n    messageBox->appear(MSceneWindow::DestroyWhenDone);\n\n    return messageBox;\n}\n\nMBanner* GalleryTiltShiftPlugin::showInfoBanner(const QString& title) const\n{\n    MBanner *infoBanner = new MBanner;\n    infoBanner->setTitle(title);\n    infoBanner->setStyleName(\"InformationBanner\");\n    infoBanner->model()->setDisappearTimeout(2000);\n    connect(this, SIGNAL(deactivated()),\n            infoBanner, SLOT(disappear()));\n\n    infoBanner->appear(MApplication::activeWindow(), MSceneWindow::DestroyWhenDone);\n\n    return infoBanner;\n}\n\nQ_EXPORT_PLUGIN2(gallerytiltshiftplugin, GalleryTiltShiftPlugin)\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) 2009 Jitse Niesen <jitse@maths.leeds.ac.uk>\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 <unsupported\/Eigen\/MatrixFunctions>\n\ndouble binom(int n, int k)\n{\n  double res = 1;\n  for (int i=0; i<k; i++)\n    res = res * (n-k+i+1) \/ (i+1);\n  return res;\n}\n\ntemplate <typename Derived, typename OtherDerived>\ndouble relerr(const MatrixBase<Derived>& A, const MatrixBase<OtherDerived>& B)\n{\n  return std::sqrt((A - B).cwiseAbs2().sum() \/ std::min(A.cwiseAbs2().sum(), B.cwiseAbs2().sum()));\n}\n\ntemplate <typename T>\nT expfn(T x, int)\n{\n  return std::exp(x);\n}\n\ntemplate <typename T>\nvoid test2dRotation(double tol)\n{\n  Matrix<T,2,2> A, B, C;\n  T angle;\n\n  A << 0, 1, -1, 0;\n  for (int i=0; i<=20; i++)\n  {\n    angle = static_cast<T>(pow(10, i \/ 5. - 2));\n    B << cos(angle), sin(angle), -sin(angle), cos(angle);\n\n    C = (angle*A).matrixFunction(expfn);\n    std::cout << \"test2dRotation: i = \" << i << \"   error funm = \" << relerr(C, B);\n    VERIFY(C.isApprox(B, static_cast<T>(tol)));\n\n    C = (angle*A).exp();\n    std::cout << \"   error expm = \" << relerr(C, B) << \"\\n\";\n    VERIFY(C.isApprox(B, static_cast<T>(tol)));\n  }\n}\n\ntemplate <typename T>\nvoid test2dHyperbolicRotation(double tol)\n{\n  Matrix<std::complex<T>,2,2> A, B, C;\n  std::complex<T> imagUnit(0,1);\n  T angle, ch, sh;\n\n  for (int i=0; i<=20; i++)\n  {\n    angle = static_cast<T>((i-10) \/ 2.0);\n    ch = std::cosh(angle);\n    sh = std::sinh(angle);\n    A << 0, angle*imagUnit, -angle*imagUnit, 0;\n    B << ch, sh*imagUnit, -sh*imagUnit, ch;\n\n    C = A.matrixFunction(expfn);\n    std::cout << \"test2dHyperbolicRotation: i = \" << i << \"   error funm = \" << relerr(C, B);\n    VERIFY(C.isApprox(B, static_cast<T>(tol)));\n\n    C = A.exp();\n    std::cout << \"   error expm = \" << relerr(C, B) << \"\\n\";\n    VERIFY(C.isApprox(B, static_cast<T>(tol)));\n  }\n}\n\ntemplate <typename T>\nvoid testPascal(double tol)\n{\n  for (int size=1; size<20; size++)\n  {\n    Matrix<T,Dynamic,Dynamic> A(size,size), B(size,size), C(size,size);\n    A.setZero();\n    for (int i=0; i<size-1; i++)\n      A(i+1,i) = static_cast<T>(i+1);\n    B.setZero();\n    for (int i=0; i<size; i++)\n      for (int j=0; j<=i; j++)\n    B(i,j) = static_cast<T>(binom(i,j));\n\n    C = A.matrixFunction(expfn);\n    std::cout << \"testPascal: size = \" << size << \"   error funm = \" << relerr(C, B);\n    VERIFY(C.isApprox(B, static_cast<T>(tol)));\n\n    C = A.exp();\n    std::cout << \"   error expm = \" << relerr(C, B) << \"\\n\";\n    VERIFY(C.isApprox(B, static_cast<T>(tol)));\n  }\n}\n\ntemplate<typename MatrixType>\nvoid randomTest(const MatrixType& m, double tol)\n{\n  \/* this test covers the following files:\n     Inverse.h\n  *\/\n  MatrixType::Index rows = m.rows();\n  MatrixType::Index cols = m.cols();\n  MatrixType m1(rows, cols), m2(rows, cols), m3(rows, cols),\n             identity = MatrixType::Identity(rows, rows);\n\n  typedef typename NumTraits<typename ei_traits<MatrixType>::Scalar>::Real RealScalar;\n\n  for(int i = 0; i < g_repeat; i++) {\n    m1 = MatrixType::Random(rows, cols);\n\n    m2 = m1.matrixFunction(expfn) * (-m1).matrixFunction(expfn);\n    std::cout << \"randomTest: error funm = \" << relerr(identity, m2);\n    VERIFY(identity.isApprox(m2, static_cast<RealScalar>(tol)));\n\n    m2 = m1.exp() * (-m1).exp();\n    std::cout << \"   error expm = \" << relerr(identity, m2) << \"\\n\";\n    VERIFY(identity.isApprox(m2, static_cast<RealScalar>(tol)));\n  }\n}\n\nvoid test_matrix_exponential()\n{\n  CALL_SUBTEST_2(test2dRotation<double>(1e-13));\n  CALL_SUBTEST_1(test2dRotation<float>(1e-5));\n  CALL_SUBTEST_2(test2dHyperbolicRotation<double>(1e-14));\n  CALL_SUBTEST_1(test2dHyperbolicRotation<float>(1e-5));\n  CALL_SUBTEST_6(testPascal<float>(1e-6));\n  CALL_SUBTEST_5(testPascal<double>(1e-15));\n  CALL_SUBTEST_2(randomTest(Matrix2d(), 1e-13));\n  CALL_SUBTEST_7(randomTest(Matrix<double,3,3,RowMajor>(), 1e-13));\n  CALL_SUBTEST_3(randomTest(Matrix4cd(), 1e-13));\n  CALL_SUBTEST_4(randomTest(MatrixXd(8,8), 1e-13));\n  CALL_SUBTEST_1(randomTest(Matrix2f(), 1e-4));\n  CALL_SUBTEST_5(randomTest(Matrix3cf(), 1e-4));\n  CALL_SUBTEST_1(randomTest(Matrix4f(), 1e-4));\n  CALL_SUBTEST_6(randomTest(MatrixXf(8,8), 1e-4));\n}\n<commit_msg>Compilation fix for matrix_exponential test: add 'typename'.<commit_after>\/\/ This file is part of Eigen, a lightweight C++ template library\n\/\/ for linear algebra.\n\/\/\n\/\/ Copyright (C) 2009 Jitse Niesen <jitse@maths.leeds.ac.uk>\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 <unsupported\/Eigen\/MatrixFunctions>\n\ndouble binom(int n, int k)\n{\n  double res = 1;\n  for (int i=0; i<k; i++)\n    res = res * (n-k+i+1) \/ (i+1);\n  return res;\n}\n\ntemplate <typename Derived, typename OtherDerived>\ndouble relerr(const MatrixBase<Derived>& A, const MatrixBase<OtherDerived>& B)\n{\n  return std::sqrt((A - B).cwiseAbs2().sum() \/ std::min(A.cwiseAbs2().sum(), B.cwiseAbs2().sum()));\n}\n\ntemplate <typename T>\nT expfn(T x, int)\n{\n  return std::exp(x);\n}\n\ntemplate <typename T>\nvoid test2dRotation(double tol)\n{\n  Matrix<T,2,2> A, B, C;\n  T angle;\n\n  A << 0, 1, -1, 0;\n  for (int i=0; i<=20; i++)\n  {\n    angle = static_cast<T>(pow(10, i \/ 5. - 2));\n    B << cos(angle), sin(angle), -sin(angle), cos(angle);\n\n    C = (angle*A).matrixFunction(expfn);\n    std::cout << \"test2dRotation: i = \" << i << \"   error funm = \" << relerr(C, B);\n    VERIFY(C.isApprox(B, static_cast<T>(tol)));\n\n    C = (angle*A).exp();\n    std::cout << \"   error expm = \" << relerr(C, B) << \"\\n\";\n    VERIFY(C.isApprox(B, static_cast<T>(tol)));\n  }\n}\n\ntemplate <typename T>\nvoid test2dHyperbolicRotation(double tol)\n{\n  Matrix<std::complex<T>,2,2> A, B, C;\n  std::complex<T> imagUnit(0,1);\n  T angle, ch, sh;\n\n  for (int i=0; i<=20; i++)\n  {\n    angle = static_cast<T>((i-10) \/ 2.0);\n    ch = std::cosh(angle);\n    sh = std::sinh(angle);\n    A << 0, angle*imagUnit, -angle*imagUnit, 0;\n    B << ch, sh*imagUnit, -sh*imagUnit, ch;\n\n    C = A.matrixFunction(expfn);\n    std::cout << \"test2dHyperbolicRotation: i = \" << i << \"   error funm = \" << relerr(C, B);\n    VERIFY(C.isApprox(B, static_cast<T>(tol)));\n\n    C = A.exp();\n    std::cout << \"   error expm = \" << relerr(C, B) << \"\\n\";\n    VERIFY(C.isApprox(B, static_cast<T>(tol)));\n  }\n}\n\ntemplate <typename T>\nvoid testPascal(double tol)\n{\n  for (int size=1; size<20; size++)\n  {\n    Matrix<T,Dynamic,Dynamic> A(size,size), B(size,size), C(size,size);\n    A.setZero();\n    for (int i=0; i<size-1; i++)\n      A(i+1,i) = static_cast<T>(i+1);\n    B.setZero();\n    for (int i=0; i<size; i++)\n      for (int j=0; j<=i; j++)\n    B(i,j) = static_cast<T>(binom(i,j));\n\n    C = A.matrixFunction(expfn);\n    std::cout << \"testPascal: size = \" << size << \"   error funm = \" << relerr(C, B);\n    VERIFY(C.isApprox(B, static_cast<T>(tol)));\n\n    C = A.exp();\n    std::cout << \"   error expm = \" << relerr(C, B) << \"\\n\";\n    VERIFY(C.isApprox(B, static_cast<T>(tol)));\n  }\n}\n\ntemplate<typename MatrixType>\nvoid randomTest(const MatrixType& m, double tol)\n{\n  \/* this test covers the following files:\n     Inverse.h\n  *\/\n  typename MatrixType::Index rows = m.rows();\n  typename MatrixType::Index cols = m.cols();\n  MatrixType m1(rows, cols), m2(rows, cols), m3(rows, cols),\n             identity = MatrixType::Identity(rows, rows);\n\n  typedef typename NumTraits<typename ei_traits<MatrixType>::Scalar>::Real RealScalar;\n\n  for(int i = 0; i < g_repeat; i++) {\n    m1 = MatrixType::Random(rows, cols);\n\n    m2 = m1.matrixFunction(expfn) * (-m1).matrixFunction(expfn);\n    std::cout << \"randomTest: error funm = \" << relerr(identity, m2);\n    VERIFY(identity.isApprox(m2, static_cast<RealScalar>(tol)));\n\n    m2 = m1.exp() * (-m1).exp();\n    std::cout << \"   error expm = \" << relerr(identity, m2) << \"\\n\";\n    VERIFY(identity.isApprox(m2, static_cast<RealScalar>(tol)));\n  }\n}\n\nvoid test_matrix_exponential()\n{\n  CALL_SUBTEST_2(test2dRotation<double>(1e-13));\n  CALL_SUBTEST_1(test2dRotation<float>(1e-5));\n  CALL_SUBTEST_2(test2dHyperbolicRotation<double>(1e-14));\n  CALL_SUBTEST_1(test2dHyperbolicRotation<float>(1e-5));\n  CALL_SUBTEST_6(testPascal<float>(1e-6));\n  CALL_SUBTEST_5(testPascal<double>(1e-15));\n  CALL_SUBTEST_2(randomTest(Matrix2d(), 1e-13));\n  CALL_SUBTEST_7(randomTest(Matrix<double,3,3,RowMajor>(), 1e-13));\n  CALL_SUBTEST_3(randomTest(Matrix4cd(), 1e-13));\n  CALL_SUBTEST_4(randomTest(MatrixXd(8,8), 1e-13));\n  CALL_SUBTEST_1(randomTest(Matrix2f(), 1e-4));\n  CALL_SUBTEST_5(randomTest(Matrix3cf(), 1e-4));\n  CALL_SUBTEST_1(randomTest(Matrix4f(), 1e-4));\n  CALL_SUBTEST_6(randomTest(MatrixXf(8,8), 1e-4));\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>working on aff tags for real robot<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2021.  All rights reserved\n *\/\n#include \"..\/..\/..\/StroikaPreComp.h\"\n\n#include \"..\/..\/..\/Characters\/FloatConversion.h\"\n#include \"..\/..\/..\/Characters\/Format.h\"\n#include \"..\/..\/..\/Characters\/String2Int.h\"\n#include \"..\/..\/..\/Streams\/TextReader.h\"\n#include \"..\/..\/BadFormatException.h\"\n\n#include \"Reader.h\"\n\nusing std::byte;\n\nusing namespace Stroika::Foundation;\nusing namespace Stroika::Foundation::DataExchange;\n\nusing Characters::Character;\nusing Characters::String;\nusing Containers::Sequence;\nusing Containers::Set;\nusing Traversal::Iterable;\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 *********** DataExchange::::CharacterDelimitedLines::Reader ********************\n ********************************************************************************\n *\/\nclass Variant::CharacterDelimitedLines::Reader::Rep_ : public Variant::Reader::_IRep {\npublic:\n    Set<Character> fDelimiters_;\n    Rep_ (const Set<Character>& columnDelimiters)\n        : fDelimiters_{columnDelimiters}\n    {\n    }\n    virtual _SharedPtrIRep Clone () const override\n    {\n        return make_shared<Rep_> (fDelimiters_);\n    }\n    virtual String GetDefaultFileSuffix () const override\n    {\n        return L\".txt\"sv;\n    }\n    virtual VariantValue Read (const Streams::InputStream<byte>::Ptr& in) override\n    {\n        return Read (Streams::TextReader::New (in));\n    }\n    virtual VariantValue Read (const Streams::InputStream<Character>::Ptr& \/*in*\/) override\n    {\n        AssertNotImplemented ();\n        return VariantValue ();\n    }\n    nonvirtual Iterable<Sequence<String>> ReadMatrix (const Streams::InputStream<Character>::Ptr& in) const\n    {\n#if USE_NOISY_TRACE_IN_THIS_MODULE_\n        Debug::TraceContextBumper ctx {\"DataExchange::Variant::CharacterDelimitedLines::Reader::Rep_::ReadMatrix\"};\n#endif\n        Sequence<Sequence<String>> result;\n        for (String line : in.ReadLines ()) {\n            Sequence<String> tokens{line.Tokenize (fDelimiters_)};\n#if USE_NOISY_TRACE_IN_THIS_MODULE_\n            DbgTrace (L\"DataExchange::Variant::CharacterDelimitedLines::Reader::ReadMatrix: line=%s, tokenCount=%d\", line.c_str (), tokens.size ());\n            for (const auto& i : tokens) {\n                DbgTrace (L\"token='%s'\", i.c_str ());\n            }\n#endif\n            result.Append (tokens);\n        }\n        return move (result);\n    }\n#if 0\n    nonvirtual  Mapping<String, String>  ReadAsMapping (const Streams::InputStream<Character>::Ptr& in) const\n    {\n        \/\/tmphack\n        return Mapping<String, String> ();\n    }\n#endif\n};\nVariant::CharacterDelimitedLines::Reader::Reader (const Set<Character>& columnDelimiters)\n    : inherited{make_shared<Rep_> (columnDelimiters)}\n{\n}\n\nIterable<Sequence<String>> Variant::CharacterDelimitedLines::Reader::ReadMatrix (const Streams::InputStream<byte>::Ptr& in) const\n{\n    return ReadMatrix (Streams::TextReader::New (in));\n}\n\nIterable<Sequence<String>> Variant::CharacterDelimitedLines::Reader::ReadMatrix (const Streams::InputStream<Character>::Ptr& in) const\n{\n    const _IRep& baseRep = _GetRep ();\n    AssertMember (&baseRep, Rep_);\n    return reinterpret_cast<const Rep_*> (&baseRep)->ReadMatrix (in);\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 \"..\/..\/..\/Characters\/FloatConversion.h\"\n#include \"..\/..\/..\/Characters\/Format.h\"\n#include \"..\/..\/..\/Characters\/String2Int.h\"\n#include \"..\/..\/..\/Streams\/TextReader.h\"\n#include \"..\/..\/BadFormatException.h\"\n\n#include \"Reader.h\"\n\nusing std::byte;\n\nusing namespace Stroika::Foundation;\nusing namespace Stroika::Foundation::DataExchange;\n\nusing Characters::Character;\nusing Characters::String;\nusing Containers::Sequence;\nusing Containers::Set;\nusing Traversal::Iterable;\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 *********** DataExchange::::CharacterDelimitedLines::Reader ********************\n ********************************************************************************\n *\/\nclass Variant::CharacterDelimitedLines::Reader::Rep_ : public Variant::Reader::_IRep {\npublic:\n    Set<Character> fDelimiters_;\n    Rep_ (const Set<Character>& columnDelimiters)\n        : fDelimiters_{columnDelimiters}\n    {\n    }\n    virtual _SharedPtrIRep Clone () const override\n    {\n        return make_shared<Rep_> (fDelimiters_);\n    }\n    virtual String GetDefaultFileSuffix () const override\n    {\n        return L\".txt\"sv;\n    }\n    virtual VariantValue Read (const Streams::InputStream<byte>::Ptr& in) override\n    {\n        return Read (Streams::TextReader::New (in));\n    }\n    virtual VariantValue Read (const Streams::InputStream<Character>::Ptr& \/*in*\/) override\n    {\n        AssertNotImplemented ();\n        return VariantValue ();\n    }\n    nonvirtual Iterable<Sequence<String>> ReadMatrix (const Streams::InputStream<Character>::Ptr& in) const\n    {\n#if USE_NOISY_TRACE_IN_THIS_MODULE_\n        Debug::TraceContextBumper ctx{\"DataExchange::Variant::CharacterDelimitedLines::Reader::Rep_::ReadMatrix\"};\n#endif\n        Sequence<Sequence<String>> result;\n        for (String line : in.ReadLines ()) {\n            Sequence<String> tokens{line.Tokenize (fDelimiters_)};\n#if USE_NOISY_TRACE_IN_THIS_MODULE_\n            DbgTrace (L\"DataExchange::Variant::CharacterDelimitedLines::Reader::ReadMatrix: line=%s, tokenCount=%d\", line.c_str (), tokens.size ());\n            for (const auto& i : tokens) {\n                DbgTrace (L\"token='%s'\", i.c_str ());\n            }\n#endif\n            result.Append (tokens);\n        }\n        return move (result);\n    }\n#if 0\n    nonvirtual  Mapping<String, String>  ReadAsMapping (const Streams::InputStream<Character>::Ptr& in) const\n    {\n        \/\/tmphack\n        return Mapping<String, String> ();\n    }\n#endif\n};\nVariant::CharacterDelimitedLines::Reader::Reader (const Set<Character>& columnDelimiters)\n    : inherited{make_shared<Rep_> (columnDelimiters)}\n{\n}\n\nIterable<Sequence<String>> Variant::CharacterDelimitedLines::Reader::ReadMatrix (const Streams::InputStream<byte>::Ptr& in) const\n{\n    return ReadMatrix (Streams::TextReader::New (in));\n}\n\nIterable<Sequence<String>> Variant::CharacterDelimitedLines::Reader::ReadMatrix (const Streams::InputStream<Character>::Ptr& in) const\n{\n    const _IRep& baseRep = _GetRep ();\n    AssertMember (&baseRep, Rep_);\n    return reinterpret_cast<const Rep_*> (&baseRep)->ReadMatrix (in);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: configunoreg.cxx,v $\n *\n *  $Revision: 1.31 $\n *\n *  last change: $Author: kz $ $Date: 2006-07-19 16:13: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#include <stdio.h>\n\n#include \"confapifactory.hxx\"\n\n#ifndef CONFIGMGR_SERVICEINFOHELPER_HXX_\n#include \"serviceinfohelper.hxx\"\n#endif\n\n#ifndef _CPPUHELPER_FACTORY_HXX_\n#include <cppuhelper\/factory.hxx>\n#endif\n#ifndef _RTL_USTRBUF_HXX_\n#include <rtl\/ustrbuf.hxx>\n#endif\n\nusing ::rtl::OUString;\nusing ::rtl::OUStringBuffer;\nusing ::com::sun::star::uno::Reference;\nusing ::com::sun::star::uno::Exception;\nusing ::com::sun::star::uno::XInterface;\nusing ::com::sun::star::uno::Sequence;\nusing ::com::sun::star::registry::XRegistryKey;\nusing ::com::sun::star::lang::XSingleComponentFactory;\nusing ::com::sun::star::lang::XMultiServiceFactory;\nusing ::configmgr::ServiceRegistrationInfo;\nusing ::configmgr::SingletonRegistrationInfo;\nusing ::configmgr::AsciiServiceName;\n\n\/\/ ***************************************************************************************\n\/\/\n\/\/ Die vorgeschriebene C-Api muss erfuellt werden!\n\/\/ Sie besteht aus drei Funktionen, die von dem Modul exportiert werden muessen.\n\/\/\n\n\/\/---------------------------------------------------------------------------------------\nvoid RegisterService(\n        const ServiceRegistrationInfo* pInfo,\n        const Reference< XRegistryKey > & xKey)\n{\n    if (pInfo == 0 || pInfo->registeredServiceNames==0 || pInfo->implementationName==0)\n        return;\n\n    OUStringBuffer aMainKeyName;\n    aMainKeyName.appendAscii(\"\/\");\n    aMainKeyName.appendAscii(pInfo->implementationName);\n    aMainKeyName.appendAscii(\"\/UNO\/SERVICES\");\n\n    Reference< XRegistryKey >  xNewKey( xKey->createKey(aMainKeyName.makeStringAndClear()) );\n    OSL_ENSURE(xNewKey.is(), \"CONFMGR::component_writeInfo : could not create a registry key !\");\n\n    for(AsciiServiceName const* p = pInfo->registeredServiceNames ; *p; ++p)\n    {\n        xNewKey->createKey(OUString::createFromAscii(*p));\n    }\n}\n\n\/\/---------------------------------------------------------------------------------------\n\nvoid RegisterSingleton(\n        const SingletonRegistrationInfo* pInfo,\n        const Reference< XRegistryKey > & xKey)\n{\n    if (pInfo == 0 ||   pInfo->singletonName            ==0 ||\n                        pInfo->implementationName       ==0 ||\n                        pInfo->instantiatedServiceName  ==0 )\n        return;\n\n    OUStringBuffer aSingletonKeyName;\n    aSingletonKeyName.appendAscii(\"\/\");\n    aSingletonKeyName.appendAscii(pInfo->implementationName);\n    aSingletonKeyName.appendAscii(\"\/UNO\/SINGLETONS\/\");\n    aSingletonKeyName.appendAscii(pInfo->singletonName);\n\n    Reference< XRegistryKey >  xNewKey( xKey->createKey(aSingletonKeyName.makeStringAndClear()) );\n    OSL_ENSURE(xNewKey.is(), \"CONFMGR::component_writeInfo : could not create a registry key !\");\n\n    xNewKey->setStringValue(OUString::createFromAscii(pInfo->instantiatedServiceName));\n\n    if (pInfo->mappedImplementation != 0)\n        RegisterService(pInfo->mappedImplementation,xKey);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nstruct ServiceImplementationRequest\n{\n    Reference< XInterface > xRet;\n    Reference< XMultiServiceFactory > const m_xServiceManager;\n    OUString const sImplementationName;\n\n    \/\/-------------------------------------------------------------------------\n    ServiceImplementationRequest(\n        void* pServiceManager,\n        sal_Char const* pImplementationName\n    )\n    : m_xServiceManager(reinterpret_cast<XMultiServiceFactory*>(pServiceManager))\n    , sImplementationName(OUString::createFromAscii(pImplementationName))\n    {\n    }\n    \/\/-------------------------------------------------------------------------\n    inline\n    sal_Bool shouldCreate(const ServiceRegistrationInfo* pInfo) const\n    {\n        OSL_ENSURE(!xRet.is(), \"CreateProvider : invalid creation request: we already have a return value !\");\n        return !xRet.is()   &&\n                pInfo != 0  &&\n                0 == sImplementationName.compareToAscii(pInfo->implementationName);\n    }\n\n    \/\/-------------------------------------------------------------------------\n\n    sal_Bool CreateProviderFactory(\n                const ServiceRegistrationInfo* pInfo,\n                bool bAdmin\n            )\n    {\n        if (this->shouldCreate(pInfo))\n        try\n        {\n            configmgr::ServiceRegistrationHelper aInfo(pInfo);\n\n            const Sequence< OUString > Services=  aInfo.getRegisteredServiceNames();\n\n            xRet = configmgr::createProviderFactory( aInfo.getImplementationName(), bAdmin);\n\n            OSL_ENSURE(xRet.is(), \"CreateProvider : WHERE IS THE return value !\");\n        }\n        catch(Exception&)\n        {\n        }\n        return xRet.is();\n    }\n\n    \/\/-------------------------------------------------------------------------\n\n    sal_Bool CreateServiceFactory(\n                const ServiceRegistrationInfo* pInfo,\n                ::cppu::ComponentFactoryFunc Factory\n            )\n    {\n        if (this->shouldCreate(pInfo))\n        try\n        {\n            configmgr::ServiceRegistrationHelper aInfo(pInfo);\n\n            const Sequence< OUString > Services=  aInfo.getRegisteredServiceNames();\n\n            xRet = cppu::createSingleComponentFactory( Factory, aInfo.getImplementationName(), Services, 0);\n\n            OSL_ENSURE(xRet.is(), \"CreateProvider : WHERE IS THE return value !\");\n        }\n        catch(Exception&)\n        {\n        }\n        return xRet.is();\n    }\n\n    \/\/-------------------------------------------------------------------------\n\n    sal_Bool CreateSingletonMapperFactory(\n                const SingletonRegistrationInfo* pInfo,\n                ::cppu::ComponentFactoryFunc Mapper\n            )\n    {\n        OSL_ENSURE(pInfo && pInfo->mappedImplementation, \"CreateProvider : Cannot map unmapped singleton !\");\n\n        return pInfo && pInfo->mappedImplementation &&\n                CreateServiceFactory(pInfo->mappedImplementation,Mapper);\n    }\n\n    \/\/-------------------------------------------------------------------------\n    void* getService() const\n    {\n        \/\/ we want to transport the interface pointer as flat C void pointer, so this prevents deletion\n        if (xRet.is())\n            xRet->acquire();\n\n        return xRet.get();\n    }\n};\n\n\/\/---------------------------------------------------------------------------------------\n\nextern \"C\" void SAL_CALL component_getImplementationEnvironment(\n                const sal_Char  **ppEnvTypeName,\n                uno_Environment ** \/* ppEnv *\/\n            )\n{\n    *ppEnvTypeName = CPPU_CURRENT_LANGUAGE_BINDING_NAME;\n}\n\n\/\/---------------------------------------------------------------------------------------\nextern \"C\" sal_Bool SAL_CALL component_writeInfo(\n                            void* \/* pServiceManager *\/,\n                            void* pRegistryKey\n            )\n{\n    if (pRegistryKey)\n    try\n    {\n        Reference< XRegistryKey > xKey(reinterpret_cast<XRegistryKey*>(pRegistryKey));\n\n        \/\/ configuration access entry points: configuration provider\n        RegisterSingleton(configmgr::getDefaultProviderSingletonInfo(), xKey) ;\n\n        RegisterService(configmgr::getConfigurationProviderServiceInfo(), xKey);\n        RegisterService(configmgr::getDefaultProviderServiceInfo(), xKey);\n        RegisterService(configmgr::getAdminProviderServiceInfo(), xKey);\n\n        \/\/ registry wrapper (deprecated)\n        RegisterService(configmgr::getConfigurationRegistryServiceInfo(), xKey);\n\n        \/\/ updating\n        RegisterService(configmgr::backend::getUpdateMergerServiceInfo(), xKey);\n\n        \/\/ xml handling\n        RegisterService(configmgr::xml::getSchemaParserServiceInfo(), xKey);\n        RegisterService(configmgr::xml::getLayerParserServiceInfo(), xKey);\n        RegisterService(configmgr::xml::getLayerWriterServiceInfo(), xKey);\n\n        \/\/ bootstrap handling\n        RegisterSingleton(configmgr::getBootstrapContextSingletonInfo(), xKey) ;\n        RegisterService(configmgr::getBootstrapContextServiceInfo(), xKey) ;\n\n        \/\/ backend singletons\n        RegisterSingleton(configmgr::backend::getDefaultBackendSingletonInfo(), xKey) ;\n\n        \/\/ backends\n        RegisterService(configmgr::backend::getDefaultBackendServiceInfo(), xKey) ;\n        RegisterService(configmgr::backend::getSingleBackendAdapterServiceInfo(), xKey) ;\n        RegisterService(configmgr::backend::getMultiStratumBackendServiceInfo(), xKey) ;\n        RegisterService(configmgr::localbe::getLocalBackendServiceInfo(), xKey) ;\n        RegisterService(configmgr::localbe::getLocalDataImportServiceInfo(), xKey) ;\n        RegisterService(configmgr::localbe::getLocalHierarchyBrowserServiceInfo(), xKey) ;\n        RegisterService(configmgr::localbe::getLocalSchemaSupplierServiceInfo(), xKey) ;\n        RegisterService(configmgr::localbe::getLocalLegacyStratumServiceInfo(), xKey) ;\n        RegisterService(configmgr::localbe::getLocalDataStratumServiceInfo(), xKey) ;\n        RegisterService(configmgr::localbe::getLocalReadonlyStratumServiceInfo(), xKey) ;\n        RegisterService(configmgr::localbe::getLocalResourceStratumServiceInfo(), xKey) ;\n        RegisterService(configmgr::localbe::getLocalMultiStratumServiceInfo(), xKey) ;\n\n        \/\/ im\/export\n        RegisterService(configmgr::backend::getMergeImportServiceInfo(), xKey);\n        RegisterService(configmgr::backend::getCopyImportServiceInfo(), xKey);\n\n        return sal_True;\n    }\n    catch (::com::sun::star::registry::InvalidRegistryException& )\n    {\n        OSL_ENSURE(sal_False, \"configmgr: component_writeInfo : could not create a registry key ! ## InvalidRegistryException !\");\n    }\n\n    return sal_False;\n}\n\n\/\/---------------------------------------------------------------------------------------\nextern \"C\" void* SAL_CALL component_getFactory(\n                    const sal_Char* pImplementationName,\n                    void* pServiceManager,\n                    void* \/*pRegistryKey*\/)\n{\n    void* pRet = 0;\n    if (pServiceManager)\n    {\n        ServiceImplementationRequest aReq(pServiceManager,pImplementationName);\n\n        \/\/ configuration access entry points: configuration provider\n        aReq.CreateProviderFactory(\n            configmgr::getConfigurationProviderServiceInfo(),\n            false)\n        ||\n        aReq.CreateProviderFactory(\n            configmgr::getAdminProviderServiceInfo(),\n            true)\n        ||\n        aReq.CreateServiceFactory(\n            configmgr::getDefaultProviderServiceInfo(),\n            &configmgr::instantiateDefaultProvider)\n        ||\n        \/\/ registry wrapper (deprecated)\n        aReq.CreateServiceFactory(\n            configmgr::getConfigurationRegistryServiceInfo(),\n            &configmgr::instantiateConfigRegistry)\n        ||\n        \/\/ updating\n        aReq.CreateServiceFactory(\n            configmgr::backend::getUpdateMergerServiceInfo(),\n            &configmgr::backend::instantiateUpdateMerger)\n        ||\n        \/\/ xml handling\n        aReq.CreateServiceFactory(\n            configmgr::xml::getSchemaParserServiceInfo(),\n            &configmgr::xml::instantiateSchemaParser)\n        ||\n        aReq.CreateServiceFactory(\n            configmgr::xml::getLayerParserServiceInfo(),\n            &configmgr::xml::instantiateLayerParser)\n        ||\n        aReq.CreateServiceFactory(\n            configmgr::xml::getLayerWriterServiceInfo(),\n            &configmgr::xml::instantiateLayerWriter)\n        ||\n        \/\/ bootstrap handling\n        aReq.CreateServiceFactory(\n            configmgr::getBootstrapContextServiceInfo(),\n            &configmgr::instantiateBootstrapContext)\n        ||\n        \/\/ backend singletons\n        aReq.CreateSingletonMapperFactory(\n                configmgr::backend::getDefaultBackendSingletonInfo(),\n                configmgr::backend::getDefaultBackendSingleton)\n        ||\n        \/\/ backends\n        aReq.CreateServiceFactory(\n                configmgr::backend::getDefaultBackendServiceInfo(),\n                configmgr::backend::instantiateDefaultBackend)\n        ||\n        aReq.CreateServiceFactory(\n                configmgr::backend::getSingleBackendAdapterServiceInfo(),\n                configmgr::backend::instantiateSingleBackendAdapter)\n        ||\n        aReq.CreateServiceFactory(\n                configmgr::backend::getMultiStratumBackendServiceInfo(),\n                configmgr::backend::instantiateMultiStratumBackend)\n        ||\n        aReq.CreateServiceFactory(\n                configmgr::localbe::getLocalBackendServiceInfo(),\n                configmgr::localbe::instantiateLocalBackend)\n        ||\n        aReq.CreateServiceFactory(\n                configmgr::localbe::getLocalDataImportServiceInfo(),\n                configmgr::localbe::instantiateLocalDataImporter)\n        ||\n        aReq.CreateServiceFactory(\n                configmgr::localbe::getLocalHierarchyBrowserServiceInfo(),\n                configmgr::localbe::instantiateLocalHierarchyBrowser)\n        ||\n         aReq.CreateServiceFactory(\n                configmgr::localbe::getLocalSchemaSupplierServiceInfo(),\n                configmgr::localbe::instantiateLocalSchemaSupplier)\n        ||\n         aReq.CreateServiceFactory(\n                configmgr::localbe::getLocalLegacyStratumServiceInfo(),\n                configmgr::localbe::instantiateLocalLegacyStratum)\n        ||\n         aReq.CreateServiceFactory(\n                configmgr::localbe::getLocalDataStratumServiceInfo(),\n                configmgr::localbe::instantiateLocalDataStratum)\n        ||\n         aReq.CreateServiceFactory(\n                configmgr::localbe::getLocalReadonlyStratumServiceInfo(),\n                configmgr::localbe::instantiateLocalReadonlyStratum)\n        ||\n         aReq.CreateServiceFactory(\n                configmgr::localbe::getLocalResourceStratumServiceInfo(),\n                configmgr::localbe::instantiateLocalResourceStratum)\n        ||\n         aReq.CreateServiceFactory(\n                configmgr::localbe::getLocalMultiStratumServiceInfo(),\n                configmgr::localbe::instantiateLocalMultiStratum)\n        ||\n        \/\/ im\/export\n        aReq.CreateServiceFactory(\n            configmgr::backend::getMergeImportServiceInfo(),\n            &configmgr::backend::instantiateMergeImporter)\n        ||\n        aReq.CreateServiceFactory(\n            configmgr::backend::getCopyImportServiceInfo(),\n            &configmgr::backend::instantiateCopyImporter);\n\n        pRet = aReq.getService();\n    }\n\n    return pRet;\n}\n\/\/---------------------------------------------------------------------------------------\n\n<commit_msg>INTEGRATION: CWS pchfix02 (1.31.10); FILE MERGED 2006\/09\/01 17:20:37 kaib 1.31.10.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: configunoreg.cxx,v $\n *\n *  $Revision: 1.32 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-16 15:15: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_configmgr.hxx\"\n#include <stdio.h>\n\n#include \"confapifactory.hxx\"\n\n#ifndef CONFIGMGR_SERVICEINFOHELPER_HXX_\n#include \"serviceinfohelper.hxx\"\n#endif\n\n#ifndef _CPPUHELPER_FACTORY_HXX_\n#include <cppuhelper\/factory.hxx>\n#endif\n#ifndef _RTL_USTRBUF_HXX_\n#include <rtl\/ustrbuf.hxx>\n#endif\n\nusing ::rtl::OUString;\nusing ::rtl::OUStringBuffer;\nusing ::com::sun::star::uno::Reference;\nusing ::com::sun::star::uno::Exception;\nusing ::com::sun::star::uno::XInterface;\nusing ::com::sun::star::uno::Sequence;\nusing ::com::sun::star::registry::XRegistryKey;\nusing ::com::sun::star::lang::XSingleComponentFactory;\nusing ::com::sun::star::lang::XMultiServiceFactory;\nusing ::configmgr::ServiceRegistrationInfo;\nusing ::configmgr::SingletonRegistrationInfo;\nusing ::configmgr::AsciiServiceName;\n\n\/\/ ***************************************************************************************\n\/\/\n\/\/ Die vorgeschriebene C-Api muss erfuellt werden!\n\/\/ Sie besteht aus drei Funktionen, die von dem Modul exportiert werden muessen.\n\/\/\n\n\/\/---------------------------------------------------------------------------------------\nvoid RegisterService(\n        const ServiceRegistrationInfo* pInfo,\n        const Reference< XRegistryKey > & xKey)\n{\n    if (pInfo == 0 || pInfo->registeredServiceNames==0 || pInfo->implementationName==0)\n        return;\n\n    OUStringBuffer aMainKeyName;\n    aMainKeyName.appendAscii(\"\/\");\n    aMainKeyName.appendAscii(pInfo->implementationName);\n    aMainKeyName.appendAscii(\"\/UNO\/SERVICES\");\n\n    Reference< XRegistryKey >  xNewKey( xKey->createKey(aMainKeyName.makeStringAndClear()) );\n    OSL_ENSURE(xNewKey.is(), \"CONFMGR::component_writeInfo : could not create a registry key !\");\n\n    for(AsciiServiceName const* p = pInfo->registeredServiceNames ; *p; ++p)\n    {\n        xNewKey->createKey(OUString::createFromAscii(*p));\n    }\n}\n\n\/\/---------------------------------------------------------------------------------------\n\nvoid RegisterSingleton(\n        const SingletonRegistrationInfo* pInfo,\n        const Reference< XRegistryKey > & xKey)\n{\n    if (pInfo == 0 ||   pInfo->singletonName            ==0 ||\n                        pInfo->implementationName       ==0 ||\n                        pInfo->instantiatedServiceName  ==0 )\n        return;\n\n    OUStringBuffer aSingletonKeyName;\n    aSingletonKeyName.appendAscii(\"\/\");\n    aSingletonKeyName.appendAscii(pInfo->implementationName);\n    aSingletonKeyName.appendAscii(\"\/UNO\/SINGLETONS\/\");\n    aSingletonKeyName.appendAscii(pInfo->singletonName);\n\n    Reference< XRegistryKey >  xNewKey( xKey->createKey(aSingletonKeyName.makeStringAndClear()) );\n    OSL_ENSURE(xNewKey.is(), \"CONFMGR::component_writeInfo : could not create a registry key !\");\n\n    xNewKey->setStringValue(OUString::createFromAscii(pInfo->instantiatedServiceName));\n\n    if (pInfo->mappedImplementation != 0)\n        RegisterService(pInfo->mappedImplementation,xKey);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nstruct ServiceImplementationRequest\n{\n    Reference< XInterface > xRet;\n    Reference< XMultiServiceFactory > const m_xServiceManager;\n    OUString const sImplementationName;\n\n    \/\/-------------------------------------------------------------------------\n    ServiceImplementationRequest(\n        void* pServiceManager,\n        sal_Char const* pImplementationName\n    )\n    : m_xServiceManager(reinterpret_cast<XMultiServiceFactory*>(pServiceManager))\n    , sImplementationName(OUString::createFromAscii(pImplementationName))\n    {\n    }\n    \/\/-------------------------------------------------------------------------\n    inline\n    sal_Bool shouldCreate(const ServiceRegistrationInfo* pInfo) const\n    {\n        OSL_ENSURE(!xRet.is(), \"CreateProvider : invalid creation request: we already have a return value !\");\n        return !xRet.is()   &&\n                pInfo != 0  &&\n                0 == sImplementationName.compareToAscii(pInfo->implementationName);\n    }\n\n    \/\/-------------------------------------------------------------------------\n\n    sal_Bool CreateProviderFactory(\n                const ServiceRegistrationInfo* pInfo,\n                bool bAdmin\n            )\n    {\n        if (this->shouldCreate(pInfo))\n        try\n        {\n            configmgr::ServiceRegistrationHelper aInfo(pInfo);\n\n            const Sequence< OUString > Services=  aInfo.getRegisteredServiceNames();\n\n            xRet = configmgr::createProviderFactory( aInfo.getImplementationName(), bAdmin);\n\n            OSL_ENSURE(xRet.is(), \"CreateProvider : WHERE IS THE return value !\");\n        }\n        catch(Exception&)\n        {\n        }\n        return xRet.is();\n    }\n\n    \/\/-------------------------------------------------------------------------\n\n    sal_Bool CreateServiceFactory(\n                const ServiceRegistrationInfo* pInfo,\n                ::cppu::ComponentFactoryFunc Factory\n            )\n    {\n        if (this->shouldCreate(pInfo))\n        try\n        {\n            configmgr::ServiceRegistrationHelper aInfo(pInfo);\n\n            const Sequence< OUString > Services=  aInfo.getRegisteredServiceNames();\n\n            xRet = cppu::createSingleComponentFactory( Factory, aInfo.getImplementationName(), Services, 0);\n\n            OSL_ENSURE(xRet.is(), \"CreateProvider : WHERE IS THE return value !\");\n        }\n        catch(Exception&)\n        {\n        }\n        return xRet.is();\n    }\n\n    \/\/-------------------------------------------------------------------------\n\n    sal_Bool CreateSingletonMapperFactory(\n                const SingletonRegistrationInfo* pInfo,\n                ::cppu::ComponentFactoryFunc Mapper\n            )\n    {\n        OSL_ENSURE(pInfo && pInfo->mappedImplementation, \"CreateProvider : Cannot map unmapped singleton !\");\n\n        return pInfo && pInfo->mappedImplementation &&\n                CreateServiceFactory(pInfo->mappedImplementation,Mapper);\n    }\n\n    \/\/-------------------------------------------------------------------------\n    void* getService() const\n    {\n        \/\/ we want to transport the interface pointer as flat C void pointer, so this prevents deletion\n        if (xRet.is())\n            xRet->acquire();\n\n        return xRet.get();\n    }\n};\n\n\/\/---------------------------------------------------------------------------------------\n\nextern \"C\" void SAL_CALL component_getImplementationEnvironment(\n                const sal_Char  **ppEnvTypeName,\n                uno_Environment ** \/* ppEnv *\/\n            )\n{\n    *ppEnvTypeName = CPPU_CURRENT_LANGUAGE_BINDING_NAME;\n}\n\n\/\/---------------------------------------------------------------------------------------\nextern \"C\" sal_Bool SAL_CALL component_writeInfo(\n                            void* \/* pServiceManager *\/,\n                            void* pRegistryKey\n            )\n{\n    if (pRegistryKey)\n    try\n    {\n        Reference< XRegistryKey > xKey(reinterpret_cast<XRegistryKey*>(pRegistryKey));\n\n        \/\/ configuration access entry points: configuration provider\n        RegisterSingleton(configmgr::getDefaultProviderSingletonInfo(), xKey) ;\n\n        RegisterService(configmgr::getConfigurationProviderServiceInfo(), xKey);\n        RegisterService(configmgr::getDefaultProviderServiceInfo(), xKey);\n        RegisterService(configmgr::getAdminProviderServiceInfo(), xKey);\n\n        \/\/ registry wrapper (deprecated)\n        RegisterService(configmgr::getConfigurationRegistryServiceInfo(), xKey);\n\n        \/\/ updating\n        RegisterService(configmgr::backend::getUpdateMergerServiceInfo(), xKey);\n\n        \/\/ xml handling\n        RegisterService(configmgr::xml::getSchemaParserServiceInfo(), xKey);\n        RegisterService(configmgr::xml::getLayerParserServiceInfo(), xKey);\n        RegisterService(configmgr::xml::getLayerWriterServiceInfo(), xKey);\n\n        \/\/ bootstrap handling\n        RegisterSingleton(configmgr::getBootstrapContextSingletonInfo(), xKey) ;\n        RegisterService(configmgr::getBootstrapContextServiceInfo(), xKey) ;\n\n        \/\/ backend singletons\n        RegisterSingleton(configmgr::backend::getDefaultBackendSingletonInfo(), xKey) ;\n\n        \/\/ backends\n        RegisterService(configmgr::backend::getDefaultBackendServiceInfo(), xKey) ;\n        RegisterService(configmgr::backend::getSingleBackendAdapterServiceInfo(), xKey) ;\n        RegisterService(configmgr::backend::getMultiStratumBackendServiceInfo(), xKey) ;\n        RegisterService(configmgr::localbe::getLocalBackendServiceInfo(), xKey) ;\n        RegisterService(configmgr::localbe::getLocalDataImportServiceInfo(), xKey) ;\n        RegisterService(configmgr::localbe::getLocalHierarchyBrowserServiceInfo(), xKey) ;\n        RegisterService(configmgr::localbe::getLocalSchemaSupplierServiceInfo(), xKey) ;\n        RegisterService(configmgr::localbe::getLocalLegacyStratumServiceInfo(), xKey) ;\n        RegisterService(configmgr::localbe::getLocalDataStratumServiceInfo(), xKey) ;\n        RegisterService(configmgr::localbe::getLocalReadonlyStratumServiceInfo(), xKey) ;\n        RegisterService(configmgr::localbe::getLocalResourceStratumServiceInfo(), xKey) ;\n        RegisterService(configmgr::localbe::getLocalMultiStratumServiceInfo(), xKey) ;\n\n        \/\/ im\/export\n        RegisterService(configmgr::backend::getMergeImportServiceInfo(), xKey);\n        RegisterService(configmgr::backend::getCopyImportServiceInfo(), xKey);\n\n        return sal_True;\n    }\n    catch (::com::sun::star::registry::InvalidRegistryException& )\n    {\n        OSL_ENSURE(sal_False, \"configmgr: component_writeInfo : could not create a registry key ! ## InvalidRegistryException !\");\n    }\n\n    return sal_False;\n}\n\n\/\/---------------------------------------------------------------------------------------\nextern \"C\" void* SAL_CALL component_getFactory(\n                    const sal_Char* pImplementationName,\n                    void* pServiceManager,\n                    void* \/*pRegistryKey*\/)\n{\n    void* pRet = 0;\n    if (pServiceManager)\n    {\n        ServiceImplementationRequest aReq(pServiceManager,pImplementationName);\n\n        \/\/ configuration access entry points: configuration provider\n        aReq.CreateProviderFactory(\n            configmgr::getConfigurationProviderServiceInfo(),\n            false)\n        ||\n        aReq.CreateProviderFactory(\n            configmgr::getAdminProviderServiceInfo(),\n            true)\n        ||\n        aReq.CreateServiceFactory(\n            configmgr::getDefaultProviderServiceInfo(),\n            &configmgr::instantiateDefaultProvider)\n        ||\n        \/\/ registry wrapper (deprecated)\n        aReq.CreateServiceFactory(\n            configmgr::getConfigurationRegistryServiceInfo(),\n            &configmgr::instantiateConfigRegistry)\n        ||\n        \/\/ updating\n        aReq.CreateServiceFactory(\n            configmgr::backend::getUpdateMergerServiceInfo(),\n            &configmgr::backend::instantiateUpdateMerger)\n        ||\n        \/\/ xml handling\n        aReq.CreateServiceFactory(\n            configmgr::xml::getSchemaParserServiceInfo(),\n            &configmgr::xml::instantiateSchemaParser)\n        ||\n        aReq.CreateServiceFactory(\n            configmgr::xml::getLayerParserServiceInfo(),\n            &configmgr::xml::instantiateLayerParser)\n        ||\n        aReq.CreateServiceFactory(\n            configmgr::xml::getLayerWriterServiceInfo(),\n            &configmgr::xml::instantiateLayerWriter)\n        ||\n        \/\/ bootstrap handling\n        aReq.CreateServiceFactory(\n            configmgr::getBootstrapContextServiceInfo(),\n            &configmgr::instantiateBootstrapContext)\n        ||\n        \/\/ backend singletons\n        aReq.CreateSingletonMapperFactory(\n                configmgr::backend::getDefaultBackendSingletonInfo(),\n                configmgr::backend::getDefaultBackendSingleton)\n        ||\n        \/\/ backends\n        aReq.CreateServiceFactory(\n                configmgr::backend::getDefaultBackendServiceInfo(),\n                configmgr::backend::instantiateDefaultBackend)\n        ||\n        aReq.CreateServiceFactory(\n                configmgr::backend::getSingleBackendAdapterServiceInfo(),\n                configmgr::backend::instantiateSingleBackendAdapter)\n        ||\n        aReq.CreateServiceFactory(\n                configmgr::backend::getMultiStratumBackendServiceInfo(),\n                configmgr::backend::instantiateMultiStratumBackend)\n        ||\n        aReq.CreateServiceFactory(\n                configmgr::localbe::getLocalBackendServiceInfo(),\n                configmgr::localbe::instantiateLocalBackend)\n        ||\n        aReq.CreateServiceFactory(\n                configmgr::localbe::getLocalDataImportServiceInfo(),\n                configmgr::localbe::instantiateLocalDataImporter)\n        ||\n        aReq.CreateServiceFactory(\n                configmgr::localbe::getLocalHierarchyBrowserServiceInfo(),\n                configmgr::localbe::instantiateLocalHierarchyBrowser)\n        ||\n         aReq.CreateServiceFactory(\n                configmgr::localbe::getLocalSchemaSupplierServiceInfo(),\n                configmgr::localbe::instantiateLocalSchemaSupplier)\n        ||\n         aReq.CreateServiceFactory(\n                configmgr::localbe::getLocalLegacyStratumServiceInfo(),\n                configmgr::localbe::instantiateLocalLegacyStratum)\n        ||\n         aReq.CreateServiceFactory(\n                configmgr::localbe::getLocalDataStratumServiceInfo(),\n                configmgr::localbe::instantiateLocalDataStratum)\n        ||\n         aReq.CreateServiceFactory(\n                configmgr::localbe::getLocalReadonlyStratumServiceInfo(),\n                configmgr::localbe::instantiateLocalReadonlyStratum)\n        ||\n         aReq.CreateServiceFactory(\n                configmgr::localbe::getLocalResourceStratumServiceInfo(),\n                configmgr::localbe::instantiateLocalResourceStratum)\n        ||\n         aReq.CreateServiceFactory(\n                configmgr::localbe::getLocalMultiStratumServiceInfo(),\n                configmgr::localbe::instantiateLocalMultiStratum)\n        ||\n        \/\/ im\/export\n        aReq.CreateServiceFactory(\n            configmgr::backend::getMergeImportServiceInfo(),\n            &configmgr::backend::instantiateMergeImporter)\n        ||\n        aReq.CreateServiceFactory(\n            configmgr::backend::getCopyImportServiceInfo(),\n            &configmgr::backend::instantiateCopyImporter);\n\n        pRet = aReq.getService();\n    }\n\n    return pRet;\n}\n\/\/---------------------------------------------------------------------------------------\n\n<|endoftext|>"}
{"text":"<commit_before>#include <climits>\n#include <iostream>\n#include <atomic>\n#include <thread>\n#include <chrono>\n#include <set>\n\n#include <wibble\/commandline\/parser.h>\n\n#include <elevator\/elevator.h>\n#include <elevator\/scheduler.h>\n#include <elevator\/udptools.h>\n#include <elevator\/udpqueue.h>\n\n\nnamespace elevator {\n\nusing namespace wibble;\nusing namespace wibble::commandline;\nusing namespace udp;\n\nstruct Main {\n\n    const Address commSend{ IPv4Address::any, Port{ 64123 } };\n    const Address commRcv{ IPv4Address::any, Port{ 64125 } };\n    const Address commBroadcast{ IPv4Address::broadcast, Port{ 64125 } };\n\n    const Port stateChangePort{ 64016 };\n    const Port commandPort{ 64017 };\n\n    StandardParser opts;\n    OptionGroup *execution;\n    IntOption *optNodes;\n    BoolOption *avoidRecovery;\n    IntOption *elevatorId;\n    const int peerMsg = 1000;\n    std::set< IPv4Address > peerAddresses;\n    int id = INT_MIN;\n    int nodes = 1;\n\n    Main( int argc, const char **argv ) : opts( \"elevator\", \"0.1\" ) {\n        \/\/ setup options\n        execution = opts.createGroup( \"Execution options\" );\n        optNodes = execution->add< IntOption >(\n                \"nodes\", 'n', \"nodes\", \"\",\n                \"specifies number of elevator nodes to expect\" );\n        elevatorId = execution->add< IntOption >(\n                \"elevator id\", 'i', \"elevator-id\", \"\",\n                \"explicitly set elevator id\" );\n\n        avoidRecovery = execution->add< BoolOption >(\n                \"avoid recovery\", 0, \"avoid-recovery\", \"\",\n                \"avoid auto-recovery when program is killed (do not fork)\" );\n\n        opts.usage = \"\";\n        opts.description = \"Elevator control software as a project for the \"\n                           \"TTK4145 Real-Time Programming at NTNU. Controls \"\n                           \"multiple elevator connected with local network.\\n\"\n                           \"(c) 2014, Vladimír Štill and Sameh Khalil\\n\"\n                           \"https:\/\/github.com\/vlstill\/ttk4145\/tree\/master\/project\";\n\n        opts.add( execution );\n\n        \/\/ parse options\n        try {\n            opts.parse( argc, argv );\n        } catch ( exception::BadOption &ex ) {\n            std::cerr << \"FATAL: \" << ex.fullInfo() << std::endl;\n            exit( 1 );\n        }\n        if ( opts.help->boolValue() || opts.version->boolValue() )\n            exit( 0 );\n    }\n\n    \/\/ initPhase == 0 means we don't know other peers\n    \/\/ initPhase == 1 means we know but they may not know (so we must wait)\n    \/\/ initPhase == 2 means all peers know other peers\n    void sendToPeers( std::atomic< int > *initPhase ) {\n        Socket snd_sock{ commSend, true };\n        snd_sock.enableBroadcast();\n        while( *initPhase < 2 ) {\n            Packet pack( sizeof( int ) );\n            pack.address() = commBroadcast;\n            pack.get< int >() = peerMsg + (*initPhase > 0 ? 1 : 0);\n            bool sent = snd_sock.sendPacket( pack );\n            assert( sent, \"send failed\" );\n            std::this_thread::sleep_for( std::chrono::milliseconds( 500 ) );\n        }\n    }\n\n    void  findPeersListener( std::atomic< int > *initPhase ) {\n        Socket rd_sock{ commRcv, true };\n        std::set< IPv4Address > barrier;\n\n        while ( *initPhase < 2 ) {\n            Packet pack = rd_sock.recvPacketWithTimeout( 300 );\n            if ( pack.size() != 0 ) {\n                if ( pack.get< int >() == peerMsg ) {\n                    peerAddresses.insert( pack.address().ip() );\n                } else if ( pack.get< int >() == peerMsg + 1 ) {\n                    peerAddresses.insert( pack.address().ip() ); \/\/ it might still be that we dont know\n                    barrier.insert( pack.address().ip() );\n                }\n                if ( int( barrier.size() ) == nodes )\n                    *initPhase = 2;\n                else if ( int( peerAddresses.size() ) == nodes )\n                    *initPhase = 1;\n            }\n        }\n    }\n\n    void main() {\n\n        if ( optNodes->boolValue() && optNodes->intValue() > 1 ) {\n            nodes = optNodes->intValue();\n            std::atomic< int > initPhase{ 0 };\n            std::thread findPeers( &Main::sendToPeers, this, &initPhase );\n            findPeersListener( &initPhase );\n            findPeers.join();\n\n            auto localAddrs = IPv4Address::getMachineAddresses();\n            int i = 0;\n            \/\/ the set is sorted (guaranteed by C++) and same on all elevators\n            for ( auto addr : peerAddresses ) {\n                if ( localAddrs.find( addr ) != localAddrs.end() ) {\n                    id = i;\n                    break;\n                }\n                ++i;\n            }\n            assert_leq( 0, id, \"Could not assing ID\" );\n            std::cout << \"detected id \" << id << std::endl;\n        } else {\n            id = 0;\n        }\n\n        if ( elevatorId->boolValue() ) {\n            id = elevatorId->intValue();\n        }\n\n        if ( avoidRecovery->boolValue() ) {\n            runElevator( id );\n        } else {\n            assert_unimplemented();\n        }\n    }\n\n    void runElevator( int id ) {\n        std::cout << \"starting elevator, id \" << id << \" of \" << nodes << \" elevators\" << std::endl;\n        HeartBeatManager heartbeatManager;\n\n        ConcurrentQueue< Command > commandsToLocalElevator;\n        ConcurrentQueue< Command > commandsToOthers;\n        ConcurrentQueue< StateChange > stateChangesIn;\n        ConcurrentQueue< StateChange > stateChangesOut;\n\n        std::unique_ptr< QueueReceiver< Command > > commandsToLocalElevatorReceiver;\n        std::unique_ptr< QueueReceiver< StateChange > > stateChangesInReceiver;\n        std::unique_ptr< QueueSender< StateChange > > stateChangesOutSender;\n        std::unique_ptr< QueueSender< Command > > commandsToOthersReceiver;\n\n        if ( nodes > 1 ) {\n            commandsToOthersReceiver.reset( new QueueSender< Command >{\n                    commSend,\n                    Address{ IPv4Address::broadcast, commandPort },\n                    commandsToOthers\n                } );\n\n            commandsToLocalElevatorReceiver.reset( new QueueReceiver< Command >{\n                    Address{ IPv4Address::any, commandPort },\n                    commandsToLocalElevator,\n                    [id]( const Command &comm ) { return comm.targetElevatorId == id; }\n                } );\n\n            stateChangesInReceiver.reset( new QueueReceiver< StateChange >{\n                    Address{ IPv4Address::any, commandPort },\n                    stateChangesIn\n                } );\n\n            stateChangesOutSender.reset( new QueueSender< StateChange >{\n                    commSend,\n                    Address{ IPv4Address::broadcast, stateChangePort },\n                    stateChangesOut\n                } );\n        }\n\n        \/* about heartbeat lengths:\n         * - elevator loop is polling and never sleeping, therefore its scheduling\n         *   is quite relieable and it can have short heartbeat,\n         *   furthermore we need to make sure we will detect any floor change,\n         *   therefore heartbeat it must respond faster then is time to cross sensor\n         *   (approx 400ms), also note that even with heartbeat of 10ms the elevator\n         *   seems to be running reliably\n         * - scheduler again has quite tight demand, as it should be able to handle\n         *   all state changes from elevator, but we have to be more carefull here\n         *   as it is sleeping sometimes\n         *\/\n        Elevator elevator{ id, heartbeatManager.getNew( 50 \/* ms *\/ ),\n            commandsToLocalElevator, stateChangesIn };\n        Scheduler scheduler{ id, heartbeatManager.getNew( 100 \/* ms *\/ ),\n            elevator.info(),\n            stateChangesIn, stateChangesOut, commandsToOthers, commandsToLocalElevator };\n\n        if ( nodes > 1 ) {\n            commandsToLocalElevatorReceiver->run();\n            stateChangesInReceiver->run();\n            commandsToOthersReceiver->run();\n            stateChangesOutSender->run();\n        }\n        elevator.run();\n        scheduler.run();\n\n        \/\/ wait for 2 seconds so that everything has chance to start\n        \/\/ it something fails to start in this time heartbeat will\n        \/\/ fail and process will be terminated\n        std::this_thread::sleep_for( std::chrono::seconds( 2 ) );\n        \/\/ heartbeat failure will throw an exception which will terminate\n        \/\/ process (as it is not catched)\n        heartbeatManager.runInThisThread();\n    }\n};\n\n}\n\nint main( int args, const char **argv ) {\n    elevator::Main m( args, argv );\n    m.main();\n}\n<commit_msg>main: Do not allow id to be set explicitly.<commit_after>#include <climits>\n#include <iostream>\n#include <atomic>\n#include <thread>\n#include <chrono>\n#include <set>\n\n#include <wibble\/commandline\/parser.h>\n\n#include <elevator\/elevator.h>\n#include <elevator\/scheduler.h>\n#include <elevator\/udptools.h>\n#include <elevator\/udpqueue.h>\n\n\nnamespace elevator {\n\nusing namespace wibble;\nusing namespace wibble::commandline;\nusing namespace udp;\n\nstruct Main {\n\n    const Address commSend{ IPv4Address::any, Port{ 64123 } };\n    const Address commRcv{ IPv4Address::any, Port{ 64125 } };\n    const Address commBroadcast{ IPv4Address::broadcast, Port{ 64125 } };\n\n    const Port stateChangePort{ 64016 };\n    const Port commandPort{ 64017 };\n\n    StandardParser opts;\n    OptionGroup *execution;\n    IntOption *optNodes;\n    BoolOption *avoidRecovery;\n    const int peerMsg = 1000;\n    std::set< IPv4Address > peerAddresses;\n    int id = INT_MIN;\n    int nodes = 1;\n\n    Main( int argc, const char **argv ) : opts( \"elevator\", \"0.1\" ) {\n        \/\/ setup options\n        execution = opts.createGroup( \"Execution options\" );\n        optNodes = execution->add< IntOption >(\n                \"nodes\", 'n', \"nodes\", \"\",\n                \"specifies number of elevator nodes to expect\" );\n\n        avoidRecovery = execution->add< BoolOption >(\n                \"avoid recovery\", 0, \"avoid-recovery\", \"\",\n                \"avoid auto-recovery when program is killed (do not fork)\" );\n\n        opts.usage = \"\";\n        opts.description = \"Elevator control software as a project for the \"\n                           \"TTK4145 Real-Time Programming at NTNU. Controls \"\n                           \"multiple elevator connected with local network.\\n\"\n                           \"(c) 2014, Vladimír Štill and Sameh Khalil\\n\"\n                           \"https:\/\/github.com\/vlstill\/ttk4145\/tree\/master\/project\";\n\n        opts.add( execution );\n\n        \/\/ parse options\n        try {\n            opts.parse( argc, argv );\n        } catch ( exception::BadOption &ex ) {\n            std::cerr << \"FATAL: \" << ex.fullInfo() << std::endl;\n            exit( 1 );\n        }\n        if ( opts.help->boolValue() || opts.version->boolValue() )\n            exit( 0 );\n    }\n\n    \/\/ initPhase == 0 means we don't know other peers\n    \/\/ initPhase == 1 means we know but they may not know (so we must wait)\n    \/\/ initPhase == 2 means all peers know other peers\n    void sendToPeers( std::atomic< int > *initPhase ) {\n        Socket snd_sock{ commSend, true };\n        snd_sock.enableBroadcast();\n        while( *initPhase < 2 ) {\n            Packet pack( sizeof( int ) );\n            pack.address() = commBroadcast;\n            pack.get< int >() = peerMsg + (*initPhase > 0 ? 1 : 0);\n            bool sent = snd_sock.sendPacket( pack );\n            assert( sent, \"send failed\" );\n            std::this_thread::sleep_for( std::chrono::milliseconds( 500 ) );\n        }\n    }\n\n    void  findPeersListener( std::atomic< int > *initPhase ) {\n        Socket rd_sock{ commRcv, true };\n        std::set< IPv4Address > barrier;\n\n        while ( *initPhase < 2 ) {\n            Packet pack = rd_sock.recvPacketWithTimeout( 300 );\n            if ( pack.size() != 0 ) {\n                if ( pack.get< int >() == peerMsg ) {\n                    peerAddresses.insert( pack.address().ip() );\n                } else if ( pack.get< int >() == peerMsg + 1 ) {\n                    peerAddresses.insert( pack.address().ip() ); \/\/ it might still be that we dont know\n                    barrier.insert( pack.address().ip() );\n                }\n                if ( int( barrier.size() ) == nodes )\n                    *initPhase = 2;\n                else if ( int( peerAddresses.size() ) == nodes )\n                    *initPhase = 1;\n            }\n        }\n    }\n\n    void main() {\n\n        if ( optNodes->boolValue() && optNodes->intValue() > 1 ) {\n            nodes = optNodes->intValue();\n            std::atomic< int > initPhase{ 0 };\n            std::thread findPeers( &Main::sendToPeers, this, &initPhase );\n            findPeersListener( &initPhase );\n            findPeers.join();\n\n            auto localAddrs = IPv4Address::getMachineAddresses();\n            int i = 0;\n            \/\/ the set is sorted (guaranteed by C++) and same on all elevators\n            for ( auto addr : peerAddresses ) {\n                if ( localAddrs.find( addr ) != localAddrs.end() ) {\n                    id = i;\n                    break;\n                }\n                ++i;\n            }\n            assert_leq( 0, id, \"Could not assing ID\" );\n            std::cout << \"detected id \" << id << std::endl;\n        } else {\n            id = 0;\n        }\n\n        if ( avoidRecovery->boolValue() ) {\n            runElevator( id );\n        } else {\n            assert_unimplemented();\n        }\n    }\n\n    void runElevator( int id ) {\n        std::cout << \"starting elevator, id \" << id << \" of \" << nodes << \" elevators\" << std::endl;\n        HeartBeatManager heartbeatManager;\n\n        ConcurrentQueue< Command > commandsToLocalElevator;\n        ConcurrentQueue< Command > commandsToOthers;\n        ConcurrentQueue< StateChange > stateChangesIn;\n        ConcurrentQueue< StateChange > stateChangesOut;\n\n        std::unique_ptr< QueueReceiver< Command > > commandsToLocalElevatorReceiver;\n        std::unique_ptr< QueueReceiver< StateChange > > stateChangesInReceiver;\n        std::unique_ptr< QueueSender< StateChange > > stateChangesOutSender;\n        std::unique_ptr< QueueSender< Command > > commandsToOthersReceiver;\n\n        if ( nodes > 1 ) {\n            commandsToOthersReceiver.reset( new QueueSender< Command >{\n                    commSend,\n                    Address{ IPv4Address::broadcast, commandPort },\n                    commandsToOthers\n                } );\n\n            commandsToLocalElevatorReceiver.reset( new QueueReceiver< Command >{\n                    Address{ IPv4Address::any, commandPort },\n                    commandsToLocalElevator,\n                    [id]( const Command &comm ) { return comm.targetElevatorId == id; }\n                } );\n\n            stateChangesInReceiver.reset( new QueueReceiver< StateChange >{\n                    Address{ IPv4Address::any, commandPort },\n                    stateChangesIn\n                } );\n\n            stateChangesOutSender.reset( new QueueSender< StateChange >{\n                    commSend,\n                    Address{ IPv4Address::broadcast, stateChangePort },\n                    stateChangesOut\n                } );\n        }\n\n        \/* about heartbeat lengths:\n         * - elevator loop is polling and never sleeping, therefore its scheduling\n         *   is quite relieable and it can have short heartbeat,\n         *   furthermore we need to make sure we will detect any floor change,\n         *   therefore heartbeat it must respond faster then is time to cross sensor\n         *   (approx 400ms), also note that even with heartbeat of 10ms the elevator\n         *   seems to be running reliably\n         * - scheduler again has quite tight demand, as it should be able to handle\n         *   all state changes from elevator, but we have to be more carefull here\n         *   as it is sleeping sometimes\n         *\/\n        Elevator elevator{ id, heartbeatManager.getNew( 50 \/* ms *\/ ),\n            commandsToLocalElevator, stateChangesIn };\n        Scheduler scheduler{ id, heartbeatManager.getNew( 100 \/* ms *\/ ),\n            elevator.info(),\n            stateChangesIn, stateChangesOut, commandsToOthers, commandsToLocalElevator };\n\n        if ( nodes > 1 ) {\n            commandsToLocalElevatorReceiver->run();\n            stateChangesInReceiver->run();\n            commandsToOthersReceiver->run();\n            stateChangesOutSender->run();\n        }\n        elevator.run();\n        scheduler.run();\n\n        \/\/ wait for 2 seconds so that everything has chance to start\n        \/\/ it something fails to start in this time heartbeat will\n        \/\/ fail and process will be terminated\n        std::this_thread::sleep_for( std::chrono::seconds( 2 ) );\n        \/\/ heartbeat failure will throw an exception which will terminate\n        \/\/ process (as it is not catched)\n        heartbeatManager.runInThisThread();\n    }\n};\n\n}\n\nint main( int args, const char **argv ) {\n    elevator::Main m( args, argv );\n    m.main();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright 2016 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\/\/ gRPC server implementation of\n\/\/ tensorflow_serving\/apis\/prediction_service.proto.\n\/\/\n\/\/ It bring up a standard server to serve a single TensorFlow model using\n\/\/ command line flags, or multiple models via config file.\n\/\/\n\/\/ ModelServer prioritizes easy invocation over flexibility,\n\/\/ and thus serves a statically configured set of models. New versions of these\n\/\/ models will be loaded and managed over time using the EagerLoadPolicy at:\n\/\/     tensorflow_serving\/core\/eager_load_policy.h.\n\/\/ by AspiredVersionsManager at:\n\/\/     tensorflow_serving\/core\/aspired_versions_manager.h\n\/\/\n\/\/ ModelServer has inter-request batching support built-in, by using the\n\/\/ BatchingSession at:\n\/\/     tensorflow_serving\/batching\/batching_session.h\n\/\/\n\/\/ To serve a single model, run with:\n\/\/     $path_to_binary\/tensorflow_model_server \\\n\/\/     --model_base_path=[\/tmp\/my_model | gs:\/\/gcs_address]\n\/\/ IMPORTANT: Be sure the base path excludes the version directory. For\n\/\/ example for a model at \/tmp\/my_model\/123, where 123 is the version, the base\n\/\/ path is \/tmp\/my_model.\n\/\/\n\/\/ To specify model name (default \"default\"): --model_name=my_name\n\/\/ To specify port (default 8500): --port=my_port\n\/\/ To enable batching (default disabled): --enable_batching\n\/\/ To log on stderr (default disabled): --alsologtostderr\n\n#include <unistd.h>\n#include <iostream>\n#include <memory>\n#include <utility>\n#include <vector>\n\n#include \"google\/protobuf\/wrappers.pb.h\"\n#include \"grpc++\/security\/server_credentials.h\"\n#include \"grpc++\/server.h\"\n#include \"grpc++\/server_builder.h\"\n#include \"grpc++\/server_context.h\"\n#include \"grpc++\/support\/status.h\"\n#include \"grpc++\/support\/status_code_enum.h\"\n#include \"grpc\/grpc.h\"\n#include \"tensorflow\/core\/lib\/core\/status.h\"\n#include \"tensorflow\/core\/platform\/init_main.h\"\n#include \"tensorflow\/core\/util\/command_line_flags.h\"\n#include \"tensorflow_serving\/apis\/prediction_service.grpc.pb.h\"\n#include \"tensorflow_serving\/apis\/prediction_service.pb.h\"\n#include \"tensorflow_serving\/config\/model_server_config.pb.h\"\n#include \"tensorflow_serving\/core\/eager_load_policy.h\"\n#include \"tensorflow_serving\/model_servers\/model_platform_types.h\"\n#include \"tensorflow_serving\/model_servers\/server_core.h\"\n#include \"tensorflow_serving\/servables\/tensorflow\/predict_impl.h\"\n#include \"tensorflow_serving\/servables\/tensorflow\/session_bundle_source_adapter.h\"\n\nusing tensorflow::serving::AspiredVersionsManager;\nusing tensorflow::serving::AspiredVersionPolicy;\nusing tensorflow::serving::BatchingParameters;\nusing tensorflow::serving::EagerLoadPolicy;\nusing tensorflow::serving::EventBus;\nusing tensorflow::serving::Loader;\nusing tensorflow::serving::ModelServerConfig;\nusing tensorflow::serving::ServableState;\nusing tensorflow::serving::ServerCore;\nusing tensorflow::serving::SessionBundleSourceAdapter;\nusing tensorflow::serving::SessionBundleSourceAdapterConfig;\nusing tensorflow::serving::Target;\nusing tensorflow::serving::TensorflowPredictImpl;\nusing tensorflow::serving::UniquePtrWithDeps;\nusing tensorflow::string;\n\nusing grpc::InsecureServerCredentials;\nusing grpc::Server;\nusing grpc::ServerAsyncResponseWriter;\nusing grpc::ServerBuilder;\nusing grpc::ServerContext;\nusing grpc::ServerCompletionQueue;\nusing tensorflow::serving::PredictRequest;\nusing tensorflow::serving::PredictResponse;\nusing tensorflow::serving::PredictionService;\n\nnamespace {\n\ntensorflow::Status CreateSourceAdapter(\n    const SessionBundleSourceAdapterConfig& config,\n    const string& model_platform,\n    std::unique_ptr<ServerCore::ModelServerSourceAdapter>* adapter) {\n  CHECK(model_platform == kTensorFlowModelPlatform)  \/\/ Crash ok\n      << \"ModelServer supports only TensorFlow model.\";\n  std::unique_ptr<SessionBundleSourceAdapter> typed_adapter;\n  const ::tensorflow::Status status =\n      SessionBundleSourceAdapter::Create(config, &typed_adapter);\n  if (!status.ok()) {\n    VLOG(1) << \"Error creating source adapter: \" << status;\n    return status;\n  }\n  *adapter = std::move(typed_adapter);\n  return tensorflow::Status::OK();\n}\n\ntensorflow::Status LoadCustomModelConfig(\n    const ::google::protobuf::Any& any,\n    EventBus<ServableState>* servable_event_bus,\n    UniquePtrWithDeps<AspiredVersionsManager>* manager) {\n  CHECK(false)  \/\/ Crash ok\n      << \"ModelServer does not yet support custom model config.\";\n}\n\nModelServerConfig BuildSingleModelConfig(const string& model_name,\n                                         const string& model_base_path) {\n  ModelServerConfig config;\n  LOG(INFO) << \"Building single TensorFlow model file config: \"\n            << \" model_name: \" << model_name\n            << \" model_base_path: \" << model_base_path;\n  tensorflow::serving::ModelConfig* single_model =\n      config.mutable_model_config_list()->add_config();\n  single_model->set_name(model_name);\n  single_model->set_base_path(model_base_path);\n  single_model->set_model_platform(kTensorFlowModelPlatform);\n  return config;\n}\n\ngrpc::Status ToGRPCStatus(const tensorflow::Status& status) {\n  const int kErrorMessageLimit = 1024;\n  string error_message;\n  if (status.error_message().length() > kErrorMessageLimit) {\n    error_message =\n        status.error_message().substr(0, kErrorMessageLimit) + \"...TRUNCATED\";\n  } else {\n    error_message = status.error_message();\n  }\n  return grpc::Status(static_cast<grpc::StatusCode>(status.code()),\n                      error_message);\n}\n\nclass PredictionServiceImpl final : public PredictionService::Service {\n public:\n  explicit PredictionServiceImpl(std::unique_ptr<ServerCore> core)\n      : core_(std::move(core)) {}\n\n  grpc::Status Predict(ServerContext* context, const PredictRequest* request,\n                       PredictResponse* response) override {\n    const grpc::Status status = ToGRPCStatus(\n        TensorflowPredictImpl::Predict(core_.get(), *request, response));\n    if (!status.ok()) {\n      VLOG(1) << \"Predict failed: \" << status;\n    }\n    return status;\n  }\n\n private:\n  std::unique_ptr<ServerCore> core_;\n};\n\nvoid RunServer(int port, std::unique_ptr<ServerCore> core) {\n  \/\/ \"0.0.0.0\" is the way to listen on localhost in gRPC.\n  const string server_address = \"0.0.0.0:\" + std::to_string(port);\n  PredictionServiceImpl service(std::move(core));\n  ServerBuilder builder;\n  std::shared_ptr<grpc::ServerCredentials> creds = InsecureServerCredentials();\n  builder.AddListeningPort(server_address, creds);\n  builder.RegisterService(&service);\n  std::unique_ptr<Server> server(builder.BuildAndStart());\n  LOG(INFO) << \"Running ModelServer at \" << server_address << \" ...\";\n  server->Wait();\n}\n\n}  \/\/ namespace\n\nint main(int argc, char** argv) {\n  tensorflow::int32 port = 8500;\n  bool enable_batching = false;\n  tensorflow::string model_name = \"default\";\n  tensorflow::int32 file_system_poll_wait_seconds = 1;\n  tensorflow::string model_base_path;\n  std::vector<tensorflow::Flag> flag_list = {\n      tensorflow::Flag(\"port\", &port, \"port to listen on\"),\n      tensorflow::Flag(\"enable_batching\", &enable_batching, \"enable batching\"),\n      tensorflow::Flag(\"model_name\", &model_name, \"name of model\"),\n      tensorflow::Flag(\"file_system_poll_wait_seconds\",\n                       &file_system_poll_wait_seconds,\n                       \"interval in seconds between each poll of the file \"\n                       \"system for new model version\"),\n      tensorflow::Flag(\"model_base_path\", &model_base_path,\n                       \"path to export (required)\")};\n  string usage = tensorflow::Flags::Usage(argv[0], flag_list);\n  const bool parse_result = tensorflow::Flags::Parse(&argc, argv, flag_list);\n  if (!parse_result || model_base_path.empty()) {\n    std::cout << usage;\n    return -1;\n  }\n  tensorflow::port::InitMain(argv[0], &argc, &argv);\n  if (argc != 1) {\n    std::cout << \"unknown argument: \" << argv[1] << \"\\n\" << usage;\n  }\n\n  \/\/ For ServerCore Options, we leave servable_state_monitor_creator unspecified\n  \/\/ so the default servable_state_monitor_creator will be used.\n  ServerCore::Options options;\n  options.model_server_config =\n      BuildSingleModelConfig(model_name, model_base_path);\n\n  SessionBundleSourceAdapterConfig source_adapter_config;\n  \/\/ Batching config\n  if (enable_batching) {\n    BatchingParameters* batching_parameters =\n        source_adapter_config.mutable_config()->mutable_batching_parameters();\n    batching_parameters->mutable_thread_pool_name()->set_value(\n        \"model_server_batch_threads\");\n  }\n  options.source_adapter_creator = [source_adapter_config](\n      const string& model_platform,\n      std::unique_ptr<ServerCore::ModelServerSourceAdapter>* adapter) {\n    return CreateSourceAdapter(source_adapter_config, model_platform, adapter);\n  };\n\n  options.custom_model_config_loader = &LoadCustomModelConfig;\n\n  options.aspired_version_policy =\n      std::unique_ptr<AspiredVersionPolicy>(new EagerLoadPolicy);\n  options.file_system_poll_wait_seconds = file_system_poll_wait_seconds;\n\n  std::unique_ptr<ServerCore> core;\n  TF_CHECK_OK(ServerCore::Create(std::move(options), &core));\n  RunServer(port, std::move(core));\n\n  return 0;\n}\n<commit_msg>Fix VLOG statement errors. Change: 138890195<commit_after>\/* Copyright 2016 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\/\/ gRPC server implementation of\n\/\/ tensorflow_serving\/apis\/prediction_service.proto.\n\/\/\n\/\/ It bring up a standard server to serve a single TensorFlow model using\n\/\/ command line flags, or multiple models via config file.\n\/\/\n\/\/ ModelServer prioritizes easy invocation over flexibility,\n\/\/ and thus serves a statically configured set of models. New versions of these\n\/\/ models will be loaded and managed over time using the EagerLoadPolicy at:\n\/\/     tensorflow_serving\/core\/eager_load_policy.h.\n\/\/ by AspiredVersionsManager at:\n\/\/     tensorflow_serving\/core\/aspired_versions_manager.h\n\/\/\n\/\/ ModelServer has inter-request batching support built-in, by using the\n\/\/ BatchingSession at:\n\/\/     tensorflow_serving\/batching\/batching_session.h\n\/\/\n\/\/ To serve a single model, run with:\n\/\/     $path_to_binary\/tensorflow_model_server \\\n\/\/     --model_base_path=[\/tmp\/my_model | gs:\/\/gcs_address]\n\/\/ IMPORTANT: Be sure the base path excludes the version directory. For\n\/\/ example for a model at \/tmp\/my_model\/123, where 123 is the version, the base\n\/\/ path is \/tmp\/my_model.\n\/\/\n\/\/ To specify model name (default \"default\"): --model_name=my_name\n\/\/ To specify port (default 8500): --port=my_port\n\/\/ To enable batching (default disabled): --enable_batching\n\/\/ To log on stderr (default disabled): --alsologtostderr\n\n#include <unistd.h>\n#include <iostream>\n#include <memory>\n#include <utility>\n#include <vector>\n\n#include \"google\/protobuf\/wrappers.pb.h\"\n#include \"grpc++\/security\/server_credentials.h\"\n#include \"grpc++\/server.h\"\n#include \"grpc++\/server_builder.h\"\n#include \"grpc++\/server_context.h\"\n#include \"grpc++\/support\/status.h\"\n#include \"grpc++\/support\/status_code_enum.h\"\n#include \"grpc\/grpc.h\"\n#include \"tensorflow\/core\/lib\/core\/status.h\"\n#include \"tensorflow\/core\/platform\/init_main.h\"\n#include \"tensorflow\/core\/util\/command_line_flags.h\"\n#include \"tensorflow_serving\/apis\/prediction_service.grpc.pb.h\"\n#include \"tensorflow_serving\/apis\/prediction_service.pb.h\"\n#include \"tensorflow_serving\/config\/model_server_config.pb.h\"\n#include \"tensorflow_serving\/core\/eager_load_policy.h\"\n#include \"tensorflow_serving\/model_servers\/model_platform_types.h\"\n#include \"tensorflow_serving\/model_servers\/server_core.h\"\n#include \"tensorflow_serving\/servables\/tensorflow\/predict_impl.h\"\n#include \"tensorflow_serving\/servables\/tensorflow\/session_bundle_source_adapter.h\"\n\nusing tensorflow::serving::AspiredVersionsManager;\nusing tensorflow::serving::AspiredVersionPolicy;\nusing tensorflow::serving::BatchingParameters;\nusing tensorflow::serving::EagerLoadPolicy;\nusing tensorflow::serving::EventBus;\nusing tensorflow::serving::Loader;\nusing tensorflow::serving::ModelServerConfig;\nusing tensorflow::serving::ServableState;\nusing tensorflow::serving::ServerCore;\nusing tensorflow::serving::SessionBundleSourceAdapter;\nusing tensorflow::serving::SessionBundleSourceAdapterConfig;\nusing tensorflow::serving::Target;\nusing tensorflow::serving::TensorflowPredictImpl;\nusing tensorflow::serving::UniquePtrWithDeps;\nusing tensorflow::string;\n\nusing grpc::InsecureServerCredentials;\nusing grpc::Server;\nusing grpc::ServerAsyncResponseWriter;\nusing grpc::ServerBuilder;\nusing grpc::ServerContext;\nusing grpc::ServerCompletionQueue;\nusing tensorflow::serving::PredictRequest;\nusing tensorflow::serving::PredictResponse;\nusing tensorflow::serving::PredictionService;\n\nnamespace {\n\ntensorflow::Status CreateSourceAdapter(\n    const SessionBundleSourceAdapterConfig& config,\n    const string& model_platform,\n    std::unique_ptr<ServerCore::ModelServerSourceAdapter>* adapter) {\n  CHECK(model_platform == kTensorFlowModelPlatform)  \/\/ Crash ok\n      << \"ModelServer supports only TensorFlow model.\";\n  std::unique_ptr<SessionBundleSourceAdapter> typed_adapter;\n  const ::tensorflow::Status status =\n      SessionBundleSourceAdapter::Create(config, &typed_adapter);\n  if (!status.ok()) {\n    VLOG(1) << \"Error creating source adapter: \" << status.error_message();\n    return status;\n  }\n  *adapter = std::move(typed_adapter);\n  return tensorflow::Status::OK();\n}\n\ntensorflow::Status LoadCustomModelConfig(\n    const ::google::protobuf::Any& any,\n    EventBus<ServableState>* servable_event_bus,\n    UniquePtrWithDeps<AspiredVersionsManager>* manager) {\n  CHECK(false)  \/\/ Crash ok\n      << \"ModelServer does not yet support custom model config.\";\n}\n\nModelServerConfig BuildSingleModelConfig(const string& model_name,\n                                         const string& model_base_path) {\n  ModelServerConfig config;\n  LOG(INFO) << \"Building single TensorFlow model file config: \"\n            << \" model_name: \" << model_name\n            << \" model_base_path: \" << model_base_path;\n  tensorflow::serving::ModelConfig* single_model =\n      config.mutable_model_config_list()->add_config();\n  single_model->set_name(model_name);\n  single_model->set_base_path(model_base_path);\n  single_model->set_model_platform(kTensorFlowModelPlatform);\n  return config;\n}\n\ngrpc::Status ToGRPCStatus(const tensorflow::Status& status) {\n  const int kErrorMessageLimit = 1024;\n  string error_message;\n  if (status.error_message().length() > kErrorMessageLimit) {\n    error_message =\n        status.error_message().substr(0, kErrorMessageLimit) + \"...TRUNCATED\";\n  } else {\n    error_message = status.error_message();\n  }\n  return grpc::Status(static_cast<grpc::StatusCode>(status.code()),\n                      error_message);\n}\n\nclass PredictionServiceImpl final : public PredictionService::Service {\n public:\n  explicit PredictionServiceImpl(std::unique_ptr<ServerCore> core)\n      : core_(std::move(core)) {}\n\n  grpc::Status Predict(ServerContext* context, const PredictRequest* request,\n                       PredictResponse* response) override {\n    const grpc::Status status = ToGRPCStatus(\n        TensorflowPredictImpl::Predict(core_.get(), *request, response));\n    if (!status.ok()) {\n      VLOG(1) << \"Predict failed: \" << status.error_message();\n    }\n    return status;\n  }\n\n private:\n  std::unique_ptr<ServerCore> core_;\n};\n\nvoid RunServer(int port, std::unique_ptr<ServerCore> core) {\n  \/\/ \"0.0.0.0\" is the way to listen on localhost in gRPC.\n  const string server_address = \"0.0.0.0:\" + std::to_string(port);\n  PredictionServiceImpl service(std::move(core));\n  ServerBuilder builder;\n  std::shared_ptr<grpc::ServerCredentials> creds = InsecureServerCredentials();\n  builder.AddListeningPort(server_address, creds);\n  builder.RegisterService(&service);\n  std::unique_ptr<Server> server(builder.BuildAndStart());\n  LOG(INFO) << \"Running ModelServer at \" << server_address << \" ...\";\n  server->Wait();\n}\n\n}  \/\/ namespace\n\nint main(int argc, char** argv) {\n  tensorflow::int32 port = 8500;\n  bool enable_batching = false;\n  tensorflow::string model_name = \"default\";\n  tensorflow::int32 file_system_poll_wait_seconds = 1;\n  tensorflow::string model_base_path;\n  std::vector<tensorflow::Flag> flag_list = {\n      tensorflow::Flag(\"port\", &port, \"port to listen on\"),\n      tensorflow::Flag(\"enable_batching\", &enable_batching, \"enable batching\"),\n      tensorflow::Flag(\"model_name\", &model_name, \"name of model\"),\n      tensorflow::Flag(\"file_system_poll_wait_seconds\",\n                       &file_system_poll_wait_seconds,\n                       \"interval in seconds between each poll of the file \"\n                       \"system for new model version\"),\n      tensorflow::Flag(\"model_base_path\", &model_base_path,\n                       \"path to export (required)\")};\n  string usage = tensorflow::Flags::Usage(argv[0], flag_list);\n  const bool parse_result = tensorflow::Flags::Parse(&argc, argv, flag_list);\n  if (!parse_result || model_base_path.empty()) {\n    std::cout << usage;\n    return -1;\n  }\n  tensorflow::port::InitMain(argv[0], &argc, &argv);\n  if (argc != 1) {\n    std::cout << \"unknown argument: \" << argv[1] << \"\\n\" << usage;\n  }\n\n  \/\/ For ServerCore Options, we leave servable_state_monitor_creator unspecified\n  \/\/ so the default servable_state_monitor_creator will be used.\n  ServerCore::Options options;\n  options.model_server_config =\n      BuildSingleModelConfig(model_name, model_base_path);\n\n  SessionBundleSourceAdapterConfig source_adapter_config;\n  \/\/ Batching config\n  if (enable_batching) {\n    BatchingParameters* batching_parameters =\n        source_adapter_config.mutable_config()->mutable_batching_parameters();\n    batching_parameters->mutable_thread_pool_name()->set_value(\n        \"model_server_batch_threads\");\n  }\n  options.source_adapter_creator = [source_adapter_config](\n      const string& model_platform,\n      std::unique_ptr<ServerCore::ModelServerSourceAdapter>* adapter) {\n    return CreateSourceAdapter(source_adapter_config, model_platform, adapter);\n  };\n\n  options.custom_model_config_loader = &LoadCustomModelConfig;\n\n  options.aspired_version_policy =\n      std::unique_ptr<AspiredVersionPolicy>(new EagerLoadPolicy);\n  options.file_system_poll_wait_seconds = file_system_poll_wait_seconds;\n\n  std::unique_ptr<ServerCore> core;\n  TF_CHECK_OK(ServerCore::Create(std::move(options), &core));\n  RunServer(port, std::move(core));\n\n  return 0;\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#include \"itkMattesMutualInformationImageToImageMetricv4.h\"\n\n#include \"itkLinearInterpolateImageFunction.h\"\n#include \"itkBSplineInterpolateImageFunction.h\"\n#include \"itkTextOutput.h\"\n#include \"itkBSplineSmoothingOnUpdateDisplacementFieldTransform.h\"\n#include \"itkImageMaskSpatialObject.h\"\n\n#include <iostream>\n\n\/**\n * This test was copied for v4 metric from itkMattesMutualInformationImageToMetricTest\n *\/\n\n\/**\n * TODO: check this text:\n *\n *  This templated function tests the MattesMutualInformationImageToMetricv4\n *  class using an AfffineTransform and various interpolators.\n *\n *  This test uses two 2D-Gaussians (standard deviation RegionSize\/2)\n *  One is shifted by 5 pixels from the other.\n *\n *  This test computes the mutual information value and derivatives\n *  for various shift values in (-10,10). Then it checks the numerical\n *  accuracy of computed derivatives by perturbing parameters by\n *  delta = 0.001.\n *\n *\/\ntemplate< typename TImage, typename TInterpolator>\nint TestMattesMetricWithAffineTransform(\n  TInterpolator * interpolator, bool useSampling )\n{\n\n\/\/------------------------------------------------------------\n\/\/ Create two simple images\n\/\/------------------------------------------------------------\n\n  \/\/Allocate Images\n  typedef TImage           MovingImageType;\n  typedef TImage           FixedImageType;\n  enum { ImageDimension = MovingImageType::ImageDimension };\n\n  typename MovingImageType::SizeType size = {{100,100}};\n  typename MovingImageType::IndexType index = {{0,0}};\n  typename MovingImageType::RegionType region;\n  region.SetSize( size );\n  region.SetIndex( index );\n\n  typename MovingImageType::SpacingType imgSpacing;\n  imgSpacing[0] = 3.0;\n  imgSpacing[1] = 2.0;\n\n  typename MovingImageType::PointType imgOrigin;\n  imgOrigin[0] = 0.0;\n  imgOrigin[1] = 0.0;\n\n  typename MovingImageType::Pointer imgMoving = MovingImageType::New();\n  imgMoving->SetLargestPossibleRegion( region );\n  imgMoving->SetBufferedRegion( region );\n  imgMoving->SetRequestedRegion( region );\n  imgMoving->Allocate();\n  imgMoving->SetSpacing( imgSpacing );\n  imgMoving->SetOrigin( imgOrigin );\n\n  typename FixedImageType::Pointer imgFixed = FixedImageType::New();\n  imgFixed->SetLargestPossibleRegion( region );\n  imgFixed->SetBufferedRegion( region );\n  imgFixed->SetRequestedRegion( region );\n  imgFixed->Allocate();\n  imgFixed->SetSpacing( imgSpacing );\n  imgFixed->SetOrigin( imgOrigin );\n\n  \/\/ Fill images with a 2D gaussian\n  typedef  itk::ImageRegionIterator<MovingImageType>\n    ReferenceIteratorType;\n  typedef  itk::ImageRegionIterator<FixedImageType>\n    TargetIteratorType;\n\n  itk::Point<double,2> center;\n  center[0] = (double)region.GetSize()[0]\/2.0;\n  center[1] = (double)region.GetSize()[1]\/2.0;\n\n  const double s = (double)region.GetSize()[0]\/2.0;\n\n  itk::Point<double,2>  p;\n  itk::Vector<double,2> d;\n\n  \/\/ Set the displacement\n  itk::Vector<double,2> displacement;\n  displacement[0] = 5;\n  displacement[1] = 5;\n\n  ReferenceIteratorType ri(imgMoving,region);\n  TargetIteratorType ti(imgFixed,region);\n  ri.GoToBegin();\n  while(!ri.IsAtEnd())\n    {\n    p[0] = ri.GetIndex()[0];\n    p[1] = ri.GetIndex()[1];\n    d = p-center;\n    d += displacement;\n    const double x = d[0];\n    const double y = d[1];\n    ri.Set( (unsigned char) ( 200.0 * std::exp( - ( x*x + y*y )\/(s*s) ) ) );\n    ++ri;\n    }\n\n  ti.GoToBegin();\n  while(!ti.IsAtEnd())\n    {\n    p[0] = ti.GetIndex()[0];\n    p[1] = ti.GetIndex()[1];\n    d = p-center;\n    const double x = d[0];\n    const double y = d[1];\n    ti.Set( (unsigned char) ( 200.0 * std::exp( - ( x*x + y*y )\/(s*s) ) ) );\n    ++ti;\n    }\n\n  \/\/Setup a fixed image mask for the image\n  typename MovingImageType::Pointer imgMovingMask = MovingImageType::New();\n  imgMovingMask->CopyInformation(imgMoving);\n  imgMovingMask->SetRegions(region);\n  imgMovingMask->Allocate(true); \/\/ initialize\n                                                        \/\/ buffer to zero\n\n  typename FixedImageType::Pointer imgFixedMask   = FixedImageType::New();\n  imgFixedMask->CopyInformation(imgFixed);\n  imgFixedMask->SetRegions(region);\n  imgFixedMask->Allocate(true); \/\/ initialize\n                                                       \/\/ buffer to zero\n\n  int NumberFixedImageMaskVoxels=0;\n    {\/\/Set up a mask that only has every 10th voxel listed is used in fixed image region\n    \/\/This should result in only about 588 samples\n      {\n      ReferenceIteratorType ri1(imgMovingMask,region);\n      ri1.GoToBegin();\n      while(!ri1.IsAtEnd()) \/\/Set all moving mask voxels to 1\n        {\n        ri1.Set(1);\n        ++ri1;\n        }\n      }\n\n      {\n      int count=0;\n      TargetIteratorType ti1(imgFixedMask,region);\n      ti1.GoToBegin();\n      while(!ti1.IsAtEnd())\/\/Set a subset of fixed mask voxels to 1, so that requested number can be made more than possible number\n        {\n        if(count%17 == 0)\n          {\n          ti1.Set(1);\n          ++NumberFixedImageMaskVoxels;\n          }\n        count++;\n        ++ti1;\n        }\n      }\n    }\n\n\/\/-----------------------------------------------------------\n\/\/ Set up a transformer\n\/\/-----------------------------------------------------------\n  typedef itk::AffineTransform< double, ImageDimension > TransformType;\n  typedef typename TransformType::ParametersType         ParametersType;\n\n  typename TransformType::Pointer transformer = TransformType::New();\n\n\/\/------------------------------------------------------------\n\/\/ Set up the metric\n\/\/------------------------------------------------------------\n  typedef itk::MattesMutualInformationImageToImageMetricv4<\n    FixedImageType, MovingImageType > MetricType;\n\n  typename MetricType::Pointer metric = MetricType::New();\n\n  \/\/ Sanity check before metric is run, these should be NULL;\n  if( metric->GetJointPDFDerivatives().IsNotNull() )\n    {\n    return EXIT_FAILURE;\n    }\n  if( metric->GetJointPDF().IsNotNull() )\n    {\n    return EXIT_FAILURE;\n    }\n\n  \/\/ connect the interpolator\n  metric->SetMovingInterpolator( interpolator );\n\n  \/\/ connect the transform\n  metric->SetMovingTransform( transformer );\n\n  \/\/ connect the images to the metric\n  metric->SetFixedImage( imgFixed );\n  metric->SetMovingImage( imgMoving );\n\n  \/\/ set the number of histogram bins\n  metric->SetNumberOfHistogramBins( 50 );\n\n  \/\/ this test doesn't pass when using gradient image filters,\n  \/\/ presumably because of different deriviative scaling created\n  \/\/ by the filter output. The derivative results match those\n  \/\/ from when using the central difference calculator, but are\n  \/\/ scaled by a factor of 3.\n  metric->SetUseFixedImageGradientFilter(false);\n  metric->SetUseMovingImageGradientFilter(false);\n\n  std::cout << \"useSampling: \" << useSampling << std::endl;\n  if( useSampling )\n    {\n    typedef typename MetricType::FixedSampledPointSetType PointSetType;\n    typedef typename PointSetType::PointType              PointType;\n    typename PointSetType::Pointer                        pset(PointSetType::New());\n    unsigned int ind=0,ct=0;\n    itk::ImageRegionIteratorWithIndex<FixedImageType> It(imgFixed, imgFixed->GetLargestPossibleRegion() );\n    for( It.GoToBegin(); !It.IsAtEnd(); ++It )\n      {\n      \/\/ take every N^th point\n      if ( ct % 5 == 0  )\n        {\n        PointType pt;\n        imgFixed->TransformIndexToPhysicalPoint( It.GetIndex(), pt);\n        pset->SetPoint(ind, pt);\n        ind++;\n        }\n        ct++;\n      }\n    std::cout << \"Setting point set with \" << ind << \" points of \" << imgFixed->GetLargestPossibleRegion().GetNumberOfPixels() << \" total \" << std::endl;\n    metric->SetFixedSampledPointSet( pset );\n    metric->SetUseFixedSampledPointSet( true );\n    }\n\n  \/\/ initialize the metric before use\n  metric->Initialize();\n\n\/\/------------------------------------------------------------\n\/\/ Set up a affine transform parameters\n\/\/------------------------------------------------------------\n  unsigned int numberOfParameters = transformer->GetNumberOfParameters();\n  ParametersType parameters( numberOfParameters );\n\n  \/\/ set the parameters to the identity\n  unsigned long count = 0;\n\n     \/\/ initialize the linear\/matrix part\n  for( unsigned int row = 0; row < ImageDimension; row++ )\n    {\n    for( unsigned int col = 0; col < ImageDimension; col++ )\n      {\n      parameters[count] = 0;\n      if( row == col )\n        {\n        parameters[count] = 1;\n        }\n      ++count;\n      }\n    }\n\n     \/\/ initialize the offset\/vector part\n  for( unsigned int k = 0; k < ImageDimension; k++ )\n    {\n    parameters[count] = 0;\n    ++count;\n    }\n\n  transformer->SetParameters( parameters );\n\n\/\/---------------------------------------------------------\n\/\/ Print out mutual information values\n\/\/ for parameters[4] = {-10,10} (arbitrary choice)\n\/\/---------------------------------------------------------\n\n  typename MetricType::MeasureType measure, measure2;\n  typename MetricType::DerivativeType derivative( numberOfParameters );\n\n  std::cout << \"param[4]\\tMI\\tMI2\\tdMI\/dparam[4]\" << std::endl;\n\n  bool testFailed = false;\n\n  for( double trans = -10; trans <= 10; trans += 0.5 )\n    {\n    parameters[4] = trans;\n    transformer->SetParameters( parameters );\n    metric->GetValueAndDerivative( measure, derivative );\n    measure2 = metric->GetValue();\n\n    std::cout << trans << \"\\t\" << measure << \"\\t\" <<\n      measure2 << \"\\t\" << derivative[4] <<std::endl;\n\n    \/\/ Make sure the metric value calculation is\n    \/\/ consistent\n    if( measure != measure2 )\n      {\n      std::cerr << \"Error: measure values do not match: \"\n                << measure << \", \" << measure2 << std::endl;\n      testFailed = true;\n      }\n    }\n\n  std::cout << \"NumberOfValidPoints: \" << metric->GetNumberOfValidPoints() << \" of \" << metric->GetVirtualRegion().GetNumberOfPixels() << std::endl;\n\n\/\/---------------------------------------------------------\n\/\/ Check output gradients for numerical accuracy\n\/\/---------------------------------------------------------\n  parameters[4] = 0;\n  transformer->SetParameters( parameters );\n  metric->Initialize();\n  metric->GetValueAndDerivative( measure, derivative );\n\n  ParametersType parametersPlus( numberOfParameters );\n  ParametersType parametersMinus( numberOfParameters );\n  typename MetricType::MeasureType measurePlus;\n  typename MetricType::MeasureType measureMinus;\n\n  double delta = 0.001;\n\n  for( unsigned int i = 0; i < numberOfParameters; ++i )\n    {\n    \/\/copy the parameters and perturb the current one.\n    for( unsigned int j = 0; j < numberOfParameters; ++j )\n      {\n      if( j == i )\n        {\n        parametersPlus[j] = parameters[i] + delta;    \/\/positive perturbation\n        parametersMinus[j] = parameters[i] - delta;  \/\/negative perturbation\n        }\n      else\n        {\n        parametersPlus[j] = parameters[j];\n        parametersMinus[j] = parameters[j];\n        }\n      }\n\n    transformer->SetParameters( parametersPlus );\n    measurePlus = metric->GetValue();\n\n    transformer->SetParameters( parametersMinus );\n    measureMinus = metric->GetValue();\n\n    double approxDerivative = -1 * ( measurePlus - measureMinus ) \/ ( 2 * delta );\n    double ratio = derivative[i]\/approxDerivative;\n\n    std::cout << i << \"\\t\";\n    std::cout << parameters[i] << \"\\t\";\n    std::cout << derivative[i] << \"\\t\";\n    std::cout << approxDerivative << \"\\t\";\n    std::cout << ratio << \"\\t\";\n    std::cout << std::endl;\n\n    double tolerance = static_cast<double>(0.014);\n    if( useSampling )\n      {\n      tolerance = static_cast<double>(0.075);\n      }\n    if ( vnl_math_abs( ratio - 1.0 ) > tolerance )\n      {\n      std::cout << \"computed derivative differ from central difference.\" << std::endl;\n      testFailed = true;\n      }\n\n    }\n\n  std::cout << \"GetNumberOfThreadsUsed: \" << metric->GetNumberOfThreadsUsed() << std::endl;\n\n  if( testFailed )\n    {\n    return EXIT_FAILURE;\n    }\n\n\/\/-------------------------------------------------------\n\/\/ exercise misc member functions\n\/\/-------------------------------------------------------\n  std::cout << \"Name of class: \" <<\n    metric->GetNameOfClass() << std::endl;\n  std::cout << \"No. of histogram bin used = \" <<\n    metric->GetNumberOfHistogramBins() << std::endl;\n  if( metric->GetJointPDF().IsNotNull() )\n    {\n    std::cout << \"JointPDF image info: \" <<\n      metric->GetJointPDF() << std::endl;\n    }\n  if( metric->GetJointPDFDerivatives().IsNotNull() )\n    {\n    std::cout << \"JointPDFDerivative image info: \" <<\n      metric->GetJointPDFDerivatives() << std::endl;\n    }\n\n  metric->Print(std::cout);\n\n  return EXIT_SUCCESS;\n}\n\n\/**\n * Test entry point.\n *\/\nint itkMattesMutualInformationImageToImageMetricv4Test(int, char *[] )\n{\n  int failed;\n\n  \/\/typedef itk::Image<unsigned char,2> ImageType;\n  typedef itk::Image<double,2> ImageType;\n\n  bool useSampling = false;\n\n  itk::OutputWindow::SetInstance(itk::TextOutput::New().GetPointer());\n\n  \/\/ Test metric with a linear interpolator\n  typedef itk::LinearInterpolateImageFunction< ImageType, double >\n    LinearInterpolatorType;\n\n  LinearInterpolatorType::Pointer linearInterpolator = LinearInterpolatorType::New();\n\n  std::cout << \"Test metric with a linear interpolator.\" << std::endl;\n  failed = TestMattesMetricWithAffineTransform<ImageType,LinearInterpolatorType>( linearInterpolator, useSampling );\n\n  if ( failed )\n    {\n    std::cout << \"Test failed when using all the pixels instead of sampling\" << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  useSampling = true;\n  failed = TestMattesMetricWithAffineTransform<ImageType,LinearInterpolatorType>( linearInterpolator, useSampling );\n\n  if ( failed )\n    {\n    std::cout << \"Test failed\" << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  \/\/ Test metric with a BSpline interpolator\n  typedef itk::BSplineInterpolateImageFunction< ImageType, double > BSplineInterpolatorType;\n\n  BSplineInterpolatorType::Pointer bSplineInterpolator = BSplineInterpolatorType::New();\n\n  bSplineInterpolator->SetSplineOrder( 3 );\n\n  useSampling = false;\n  std::cout << \"Test metric with a BSpline interpolator.\" << std::endl;\n  failed = TestMattesMetricWithAffineTransform<ImageType,BSplineInterpolatorType>( bSplineInterpolator, useSampling );\n\n  if ( failed )\n    {\n    std::cout << \"Test failed when using all the pixels instead of sampling\" << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  std::cout << \"Test passed\" << std::endl;\n  return EXIT_SUCCESS;\n}\n<commit_msg>ENH: Improve test in preparation for performance testing<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#include \"itkMattesMutualInformationImageToImageMetricv4.h\"\n\n#include \"itkLinearInterpolateImageFunction.h\"\n#include \"itkBSplineInterpolateImageFunction.h\"\n#include \"itkTextOutput.h\"\n#include \"itkBSplineSmoothingOnUpdateDisplacementFieldTransform.h\"\n#include \"itkImageMaskSpatialObject.h\"\n\n#include <iostream>\n\n\/**\n * This test was copied for v4 metric from itkMattesMutualInformationImageToMetricTest\n *\/\n\n\/**\n * TODO: check this text:\n *\n *  This templated function tests the MattesMutualInformationImageToMetricv4\n *  class using an AfffineTransform and various interpolators.\n *\n *  This test uses two 2D-Gaussians (standard deviation RegionSize\/2)\n *  One is shifted by 5 pixels from the other.\n *\n *  This test computes the mutual information value and derivatives\n *  for various shift values in (-10,10). Then it checks the numerical\n *  accuracy of computed derivatives by perturbing parameters by\n *  delta = 0.001.\n *\n *\/\ntemplate< typename TImage, typename TInterpolator>\nint TestMattesMetricWithAffineTransform(\n  TInterpolator * const interpolator, const bool useSampling )\n{\n\n\/\/------------------------------------------------------------\n\/\/ Create two simple images\n\/\/------------------------------------------------------------\n\n  \/\/Allocate Images\n  typedef TImage           MovingImageType;\n  typedef TImage           FixedImageType;\n\n  const unsigned int ImageDimension = MovingImageType::ImageDimension;\n\n  typename MovingImageType::SizeType size = {{100,100}};\n  typename MovingImageType::IndexType index = {{0,0}};\n  typename MovingImageType::RegionType region;\n  region.SetSize( size );\n  region.SetIndex( index );\n\n  typename MovingImageType::SpacingType imgSpacing;\n  imgSpacing[0] = 3.0;\n  imgSpacing[1] = 2.0;\n\n  typename MovingImageType::PointType imgOrigin;\n  imgOrigin[0] = 0.001;\n  imgOrigin[1] = -0.002;\n\n  typename MovingImageType::Pointer imgMoving = MovingImageType::New();\n  imgMoving->SetLargestPossibleRegion( region );\n  imgMoving->SetBufferedRegion( region );\n  imgMoving->SetRequestedRegion( region );\n  imgMoving->Allocate();\n  imgMoving->SetSpacing( imgSpacing );\n  imgMoving->SetOrigin( imgOrigin );\n\n  typename FixedImageType::Pointer imgFixed = FixedImageType::New();\n  imgFixed->SetLargestPossibleRegion( region );\n  imgFixed->SetBufferedRegion( region );\n  imgFixed->SetRequestedRegion( region );\n  imgFixed->Allocate();\n  imgFixed->SetSpacing( imgSpacing );\n  imgFixed->SetOrigin( imgOrigin );\n\n  \/\/ Fill images with a 2D gaussian\n  typedef  itk::ImageRegionIterator<MovingImageType> ReferenceIteratorType;\n  typedef  itk::ImageRegionIterator<FixedImageType>  TargetIteratorType;\n\n  itk::Point<double,2> center;\n  center[0] = (double)region.GetSize()[0]\/2.0;\n  center[1] = (double)region.GetSize()[1]\/2.0;\n\n  const double s = (double)region.GetSize()[0]\/2.0;\n\n  itk::Point<double,2>  p;\n\n  \/\/ Set the displacement\n  itk::Vector<double,2> displacement;\n  displacement[0] = 5;\n  displacement[1] = 5;\n\n    {\n    ReferenceIteratorType ri(imgMoving,region);\n    ri.GoToBegin();\n    while(!ri.IsAtEnd())\n      {\n      p[0] = ri.GetIndex()[0];\n      p[1] = ri.GetIndex()[1];\n      itk::Vector<double,2> d = p-center;\n      d += displacement;\n      const double x = d[0];\n      const double y = d[1];\n      ri.Set( (unsigned char) ( 200.0 * std::exp( - ( x*x + y*y )\/(s*s) ) ) );\n      ++ri;\n      }\n    }\n    {\n    TargetIteratorType ti(imgFixed,region);\n    ti.GoToBegin();\n    while(!ti.IsAtEnd())\n      {\n      p[0] = ti.GetIndex()[0];\n      p[1] = ti.GetIndex()[1];\n      itk::Vector<double,2> d = p-center;\n      const double x = d[0];\n      const double y = d[1];\n      ti.Set( (unsigned char) ( 200.0 * std::exp( - ( x*x + y*y )\/(s*s) ) ) );\n      ++ti;\n      }\n    }\n\n  \/\/Setup a fixed image mask for the image\n  typename MovingImageType::Pointer imgMovingMask = MovingImageType::New();\n  imgMovingMask->CopyInformation(imgMoving);\n  imgMovingMask->SetRegions(region);\n  imgMovingMask->Allocate(true); \/\/ initialize buffer to zero\n\n  typename FixedImageType::Pointer imgFixedMask   = FixedImageType::New();\n  imgFixedMask->CopyInformation(imgFixed);\n  imgFixedMask->SetRegions(region);\n  imgFixedMask->Allocate(true); \/\/ initialize buffer to zero\n\n    {\n      {\n      \/\/Set up a mask that only has every third voxel listed is used in fixed image region\n      int count=0;\n      ReferenceIteratorType ri1(imgMovingMask,region);\n      ri1.GoToBegin();\n      while(!ri1.IsAtEnd()) \/\/Set all moving mask voxels to 1\n        {\n        if(count%3 == 0)\n          {\n          ri1.Set(1);\n          }\n        ++ri1;\n        ++count;\n        }\n      }\n\n      {\n      \/\/Set up a mask that only has every other voxel listed is used in fixed image region\n      int count=0;\n      TargetIteratorType ti1(imgFixedMask,region);\n      ti1.GoToBegin();\n      while(!ti1.IsAtEnd())\/\/Set a subset of fixed mask voxels to 1, so that requested number can be made more than possible number\n        {\n        if(count%2 == 0)\n          {\n          ti1.Set(1);\n          }\n        ++ti1;\n        ++count;\n        }\n      }\n    }\n\n\/\/-----------------------------------------------------------\n\/\/ Set up a transformer\n\/\/-----------------------------------------------------------\n  typedef itk::AffineTransform< double, ImageDimension > TransformType;\n  typedef typename TransformType::ParametersType         ParametersType;\n\n  typename TransformType::Pointer transformer = TransformType::New();\n\n\/\/------------------------------------------------------------\n\/\/ Set up the metric\n\/\/------------------------------------------------------------\n  typedef itk::MattesMutualInformationImageToImageMetricv4<\n    FixedImageType, MovingImageType > MetricType;\n\n  typename MetricType::Pointer metric = MetricType::New();\n\n  \/\/ Sanity check before metric is run, these should be NULL;\n  if( metric->GetJointPDFDerivatives().IsNotNull() )\n    {\n    return EXIT_FAILURE;\n    }\n  if( metric->GetJointPDF().IsNotNull() )\n    {\n    return EXIT_FAILURE;\n    }\n\n  \/\/ connect the interpolator\n  metric->SetMovingInterpolator( interpolator );\n\n  \/\/ connect the transform\n  metric->SetMovingTransform( transformer );\n\n  \/\/ connect the images to the metric\n  metric->SetFixedImage( imgFixed );\n  metric->SetMovingImage( imgMoving );\n\n  \/\/ set the number of histogram bins\n  metric->SetNumberOfHistogramBins( 50 );\n\n  \/\/ this test doesn't pass when using gradient image filters,\n  \/\/ presumably because of different deriviative scaling created\n  \/\/ by the filter output. The derivative results match those\n  \/\/ from when using the central difference calculator, but are\n  \/\/ scaled by a factor of 3.\n  metric->SetUseFixedImageGradientFilter(false);\n  metric->SetUseMovingImageGradientFilter(false);\n\n  std::cout << \"useSampling: \" << useSampling << std::endl;\n  if( useSampling )\n    {\n    typedef typename MetricType::FixedSampledPointSetType PointSetType;\n    typedef typename PointSetType::PointType              PointType;\n    typename PointSetType::Pointer                        pset(PointSetType::New());\n    unsigned int ind=0;\n    unsigned int ct=0;\n    itk::ImageRegionIteratorWithIndex<FixedImageType> It(imgFixed, imgFixed->GetLargestPossibleRegion() );\n    for( It.GoToBegin(); !It.IsAtEnd(); ++It )\n      {\n      \/\/ take every N^th point\n      if ( ct % 5 == 0  )\n        {\n        PointType pt;\n        imgFixed->TransformIndexToPhysicalPoint( It.GetIndex(), pt);\n        pset->SetPoint(ind, pt);\n        ind++;\n        }\n        ct++;\n      }\n    std::cout << \"Setting point set with \" << ind << \" points of \" << imgFixed->GetLargestPossibleRegion().GetNumberOfPixels() << \" total \" << std::endl;\n    metric->SetFixedSampledPointSet( pset );\n    metric->SetUseFixedSampledPointSet( true );\n    }\n\n  \/\/ initialize the metric before use\n  metric->Initialize();\n\n\/\/------------------------------------------------------------\n\/\/ Set up a affine transform parameters\n\/\/------------------------------------------------------------\n  transformer->SetIdentity();\n  const unsigned int numberOfParameters = transformer->GetNumberOfParameters();\n  ParametersType parameters = transformer->GetParameters();\n\n\/\/---------------------------------------------------------\n\/\/ Print out mutual information values\n\/\/ for parameters[4] = {-10,10} (arbitrary choice)\n\/\/---------------------------------------------------------\n\n  typename MetricType::MeasureType metricValueWithDerivative;\n  typename MetricType::MeasureType metricValueOnly;\n  typename MetricType::DerivativeType derivative( numberOfParameters );\n\n\n  bool testFailed = false;\n\n  std::cout << \"param[4]\\tMI\\tMI2\\tdMI\/dparam[4]\" << std::endl;\n  for( double trans = -10; trans <= 10; trans += 0.5 )\n    {\n    parameters[4] = trans;\n    transformer->SetParameters( parameters );\n    metric->GetValueAndDerivative( metricValueWithDerivative, derivative );\n    metricValueOnly = metric->GetValue();\n\n    std::cout << \"OffsetParam: \" << trans << \"\\tvalueWithDerivative: \" << metricValueWithDerivative << \"\\tvalueOnly: \" <<\n      metricValueOnly << \"\\tderivative[4]: \" << derivative[4];\n    \/\/ Make sure the metric value calculation is\n    \/\/ consistent\n    if( metricValueWithDerivative != metricValueOnly )\n      {\n      std::cout << \"\\t[FAILED]: metricValueWithDerivative values do not match: (\"\n                << metricValueWithDerivative << \" - \" << metricValueOnly <<  \") = \"\n                << (metricValueWithDerivative - metricValueOnly ) << std::endl;\n      testFailed = true;\n      }\n    else\n      {\n      std::cout << \"\\t[PASSED]\" << std::endl;\n      }\n    }\n\n  std::cout << \"NumberOfValidPoints: \" << metric->GetNumberOfValidPoints() << \" of \" << metric->GetVirtualRegion().GetNumberOfPixels() << std::endl;\n\n\/\/---------------------------------------------------------\n\/\/ Check output gradients for numerical accuracy\n\/\/---------------------------------------------------------\n  parameters[4] = 0;\n  transformer->SetParameters( parameters );\n  metric->Initialize();\n  metric->GetValueAndDerivative( metricValueWithDerivative, derivative );\n\n  ParametersType parametersPlus( numberOfParameters );\n  ParametersType parametersMinus( numberOfParameters );\n  typename MetricType::MeasureType measurePlus;\n  typename MetricType::MeasureType measureMinus;\n\n  const double delta = 0.001;\n\n  const double tolerance = (useSampling) ? static_cast<double>(0.075) : static_cast<double>(0.014);\n  for( unsigned int perturbParamIndex = 0; perturbParamIndex < numberOfParameters; ++perturbParamIndex )\n    {\n    \/\/copy the parameters and perturb the current one.\n    for( unsigned int j = 0; j < numberOfParameters; ++j )\n      {\n      if( j == perturbParamIndex )\n        {\n        parametersPlus[j] = parameters[perturbParamIndex] + delta;    \/\/positive perturbation\n        parametersMinus[j] = parameters[perturbParamIndex] - delta;  \/\/negative perturbation\n        }\n      else\n        {\n        parametersPlus[j] = parameters[j];\n        parametersMinus[j] = parameters[j];\n        }\n      }\n\n    transformer->SetParameters( parametersPlus );\n    measurePlus = metric->GetValue();\n\n    transformer->SetParameters( parametersMinus );\n    measureMinus = metric->GetValue();\n\n    const double approxDerivative = -1.0 * ( measurePlus - measureMinus ) \/ ( 2.0 * delta );\n    const double ratio = derivative[perturbParamIndex]\/approxDerivative;\n\n    std::cout << \"perturbParamIndex: \" << perturbParamIndex\n      << \"\\tparameters[]: \" << parameters[perturbParamIndex]\n      << \"\\tderivative[]\" << derivative[perturbParamIndex]\n      << \"\\tapproxDerivative[]\" << approxDerivative\n      << \"\\tratio: \" << ratio;\n\n    const double evalDiff = vnl_math_abs( ratio - 1.0 );\n    if ( evalDiff > tolerance )\n      {\n      std::cout << \"\\t[FAILED] computed derivative differ from central difference by (\" << evalDiff << \" > \" << tolerance << \").\" << std::endl;\n      testFailed = true;\n      }\n    else\n      {\n      std::cout << \"\\t[PASSED]\" << std::endl;\n      }\n    }\n\n\/\/-------------------------------------------------------\n\/\/ exercise misc member functions\n\/\/-------------------------------------------------------\n  std::cout << \"Name of class: \" << metric->GetNameOfClass() << std::endl;\n  std::cout << \"No. of histogram bin used = \" << metric->GetNumberOfHistogramBins() << std::endl;\n  if( metric->GetJointPDF().IsNotNull() )\n    {\n    std::cout << \"JointPDF image info: \" << metric->GetJointPDF() << std::endl;\n    }\n  if( metric->GetJointPDFDerivatives().IsNotNull() )\n    {\n    std::cout << \"JointPDFDerivative image info: \" << metric->GetJointPDFDerivatives() << std::endl;\n    }\n  std::cout << \"GetNumberOfThreadsUsed: \" << metric->GetNumberOfThreadsUsed() << std::endl;\n  metric->Print(std::cout);\n  if( testFailed )\n    {\n    return EXIT_FAILURE;\n    }\n  return EXIT_SUCCESS;\n}\n\n\/**\n * Test entry point.\n *\/\nint itkMattesMutualInformationImageToImageMetricv4Test(int, char *[] )\n{\n\n  \/\/typedef itk::Image<unsigned char,2> ImageType;\n  typedef itk::Image<double,2> ImageType;\n\n  itk::OutputWindow::SetInstance(itk::TextOutput::New().GetPointer());\n\n  \/\/ Test metric with a linear interpolator\n  typedef itk::LinearInterpolateImageFunction< ImageType, double > LinearInterpolatorType;\n\n  LinearInterpolatorType::Pointer linearInterpolator = LinearInterpolatorType::New();\n\n  std::cout << \"Test metric with a linear interpolator.\" << std::endl;\n  bool useSampling = false;\n  int failed = TestMattesMetricWithAffineTransform<ImageType,LinearInterpolatorType>( linearInterpolator, useSampling );\n  if ( failed )\n    {\n    std::cout << \"Test failed when using all the pixels instead of sampling\" << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  useSampling = true;\n  failed = TestMattesMetricWithAffineTransform<ImageType,LinearInterpolatorType>( linearInterpolator, useSampling );\n  if ( failed )\n    {\n    std::cout << \"Test failed\" << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  \/\/ Test metric with a BSpline interpolator\n  typedef itk::BSplineInterpolateImageFunction< ImageType, double > BSplineInterpolatorType;\n\n  BSplineInterpolatorType::Pointer bSplineInterpolator = BSplineInterpolatorType::New();\n\n  bSplineInterpolator->SetSplineOrder( 3 );\n\n  useSampling = false;\n  std::cout << \"Test metric with a BSpline interpolator.\" << std::endl;\n  failed = TestMattesMetricWithAffineTransform<ImageType,BSplineInterpolatorType>( bSplineInterpolator, useSampling );\n  if ( failed )\n    {\n    std::cout << \"Test failed when using all the pixels instead of sampling\" << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  std::cout << \"Test passed\" << std::endl;\n  return EXIT_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  inpal_prime.cpp\n\/\/  Inverse Palindrome Library\n\/\/\n\/\/  Created by Bryan Triana on 7\/21\/16.\n\/\/  Copyright © 2016 Inverse Palindrome. All rights reserved.\n\/\/\n\n\n#include \"inpal_prime.hpp\"\n#include \"inpal_algorithm.hpp\"\n\n\nstd::vector<std::size_t> inpal::prime::prime_list(std::size_t range)\n{\n    const auto primes = prime_sieve(range);\n    std::vector<std::size_t> p_list;\n    if(range<2) return p_list;\n   \n    p_list.push_back(2);\n    if(range==2) return p_list;\n    \n    for(std::size_t i=3; i<=range; i+=2) if(primes[i]) p_list.push_back(i);\n    \n    return p_list;\n}\n\n\nstd::vector<bool> inpal::prime::prime_sieve(std::size_t range)\n{\n    std::vector<bool> p_test(range+1, false);\n    \n    \/\/defines square root of range for future usage\n    const std::size_t root = ceil(sqrt(range));\n    \n    \/\/sieve axioms\n    for(std::size_t x=1; x<=root; x++)\n        for(std::size_t y=1; y<=root; y++)\n        {\n            std::size_t i = (4*x*x)+(y*y);\n            if(i<=range && (i%12==1 || i%12==5)) p_test[i].flip();\n            \n            i = (3*x*x)+(y*y);\n            if(i<=range && i%12==7) p_test[i].flip();\n            \n            i = (3*x*x)-(y*y);\n            if(x>y && i<=range && i%12==11) p_test[i].flip();\n        }\n    \n    \/\/marks 2,3,5 and 7 as prime numbers to deal with input smaller than 7\n    p_test[2]=p_test[3]=p_test[5]=true;\n    \n    \/\/marks all multiples of primes as non primes\n    for(std::size_t r=5; r<=root; r++)\n    {\n        if(p_test[r])\n        {\n            for(std::size_t j=r*r; j<=range; j+=r*r) p_test[j]=false;\n        }\n    }\n    \n    return p_test;\n}\n\n\nstd::vector<std::size_t> inpal::prime::factor_list(std::size_t num)\n{\n    std::vector<std::size_t> factors;\n    std::vector<std::size_t> primes;\n    \n    if(num<2) return primes;\n    \n    std::size_t factor = algorithm::pollard_rho(num);\n    factors.push_back(num\/factor);\n    factors.push_back(factor);\n    \n    do\n    {\n        std::size_t m = factors.back();\n        factors.pop_back();\n        \n        if(m==1) continue;\n        if(prime_test(m))\n        {\n            primes.push_back(m);\n            \n            \/\/decomposes the factors into primes\n            for(std::size_t i=0; i<factors.size(); i++)\n            {\n                std::size_t k = factors[i];\n                if(k%m==0)\n                {\n                    do k\/=m;\n                    while(k%m==0);\n                    \n                    factors[i]=k;\n                }\n            }\n        }\n        else\n        {\n            factor=algorithm::pollard_rho(m);\n            factors.push_back(m\/factor);\n            factors.push_back(factor);\n        }\n    }\n    while(factors.size());\n    \n    \/\/prime factors found by pollard rho arent always ordered\n    std::sort(primes.begin(), primes.end());\n    \n    return primes;\n}\n\n\nstd::size_t inpal::prime::prime_locate(std::size_t pos)\n{\n    \/\/index starts at 1 instead of 0, eg 1st prime is 2\n    pos = pos-1;\n    \n    \/\/return values for input less or equal to 10\n    const auto small_primes = prime_list(29);\n    if(pos<10) return small_primes[pos];\n    \n    \/\/denotes the limit of the sieve\n    std::size_t limit = pos*log(pos)+pos*log(log(pos));\n    const auto primes = prime_list(limit);\n    \n    return primes[pos];\n}\n\n\nstd::size_t inpal::prime::max_prime(std::size_t range)\n{\n    if(range<2) throw std::invalid_argument(\"There are no prime numbers less than two 2\");\n    \n    for(std::size_t i=range; i>0; i--) if(prime_test(i)) return i;\n    \n    return 2;\n}\n\n\nstd::size_t inpal::prime::prime_count(std::size_t range)\n{\n    const auto primes = prime_sieve(range);\n    \n    return std::count(primes.begin(), primes.end(), true);\n}\n\n\ndouble inpal::prime::prime_density(double range)\n{\n    return prime_count(range)\/range;\n}\n\n\nbool inpal::prime::prime_test(std::size_t num)\n{\n    if(num<2 ||(num!=2 && num%2==0)) return false;\n    \n    \/\/iterations will occur 20 times to ensure that the margin of error is less than 4^-20\n    const std::size_t cycle = 20;\n    std::size_t s = num-1;\n    while(s%2==0) s\/=2;\n    \n    for(std::size_t i=0; i<cycle; i++)\n    {\n        std::size_t a = rand()%(num-1)+1;\n        std::size_t b = s;\n        std::size_t mod = algorithm::modulo(a,b,num);\n        \n        while(b!=num-1 && mod!=1 && mod!=num-1)\n        {\n            mod=algorithm::mulmod(mod,mod,num);\n            b*=2;\n        }\n        if(mod!=num-1 && b%2==0) return false;\n    }\n    \n    return true;\n}\n\n\nbool inpal::prime::twin_test(std::size_t num)\n{\n    return prime_test(num) && (prime_test(num-2) || prime_test(num+2));\n}\n\n\nbool inpal::prime::cousin_test(std::size_t num)\n{\n    return  prime_test(num) && (prime_test(num-4) || prime_test(num+4));\n}\n\n\nbool inpal::prime::sexy_test(std::size_t num)\n{\n    return num!=3 && prime_test(num) && (prime_test(num-6) || prime_test(num+6));\n}\n\n\nstd::size_t inpal::prime::max_palprime(std::size_t range)\n{\n    if(range<2) throw std::invalid_argument(\"There are no palindromic prime numbers less than two 2\");\n    \n    for(std::size_t i=range; i>=2; --i) if(prime_test(i) && algorithm::pal_test(i)) return i;\n    \n    return 2;\n}\n\n\nstd::size_t inpal::prime::max_factor(std::size_t num)\n{\n    if(num<2) throw std::invalid_argument(\"There are no prime factors less than two 2\");\n    \n    return factor_list(num).back();\n}\n\n\nstd::size_t inpal::prime::factor_count(std::size_t num)\n{\n    return factor_list(num).size();\n}\n\n\n<commit_msg>optimized prime_count function<commit_after>\/\/\n\/\/  inpal_prime.cpp\n\/\/  Inverse Palindrome Library\n\/\/\n\/\/  Created by Bryan Triana on 7\/21\/16.\n\/\/  Copyright © 2016 Inverse Palindrome. All rights reserved.\n\/\/\n\n\n#include \"inpal_prime.hpp\"\n#include \"inpal_algorithm.hpp\"\n\n\nstd::vector<std::size_t> inpal::prime::prime_list(std::size_t range)\n{\n    const auto primes = prime_sieve(range);\n    std::vector<std::size_t> p_list;\n    if(range<2) return p_list;\n   \n    p_list.push_back(2);\n    if(range==2) return p_list;\n    \n    for(std::size_t i=3; i<=range; i+=2) if(primes[i]) p_list.push_back(i);\n    \n    return p_list;\n}\n\n\nstd::vector<bool> inpal::prime::prime_sieve(std::size_t range)\n{\n    std::vector<bool> p_test(range+1, false);\n    \n    \/\/sieve axioms\n    for(std::size_t x=1; x<=std::sqrt(range); x++)\n        for(std::size_t y=1; y<=std::sqrt(range); y++)\n        {\n            std::size_t i = (4*x*x)+(y*y);\n            if(i<=range && (i%12==1 || i%12==5)) p_test[i].flip();\n            \n            i = (3*x*x)+(y*y);\n            if(i<=range && i%12==7) p_test[i].flip();\n            \n            i = (3*x*x)-(y*y);\n            if(x>y && i<=range && i%12==11) p_test[i].flip();\n        }\n    \n    \/\/marks 2,3,5 and 7 as prime numbers to deal with input smaller than 7\n    p_test[2]=p_test[3]=p_test[5]=true;\n    \n    \/\/marks all multiples of primes as non primes\n    for(std::size_t r=5; r<=std::sqrt(range); r++)\n    {\n        if(p_test[r])\n        {\n            for(std::size_t j=r*r; j<=range; j+=r*r) p_test[j]=false;\n        }\n    }\n    \n    return p_test;\n}\n\n\nstd::vector<std::size_t> inpal::prime::factor_list(std::size_t num)\n{\n    std::vector<std::size_t> factors;\n    std::vector<std::size_t> primes;\n    \n    if(num<2) return primes;\n    \n    std::size_t factor = algorithm::pollard_rho(num);\n    factors.push_back(num\/factor);\n    factors.push_back(factor);\n    \n    do\n    {\n        std::size_t m = factors.back();\n        factors.pop_back();\n        \n        if(m==1) continue;\n        if(prime_test(m))\n        {\n            primes.push_back(m);\n            \n            \/\/decomposes the factors into primes\n            for(std::size_t i=0; i<factors.size(); i++)\n            {\n                std::size_t k = factors[i];\n                if(k%m==0)\n                {\n                    do k\/=m;\n                    while(k%m==0);\n                    \n                    factors[i]=k;\n                }\n            }\n        }\n        else\n        {\n            factor=algorithm::pollard_rho(m);\n            factors.push_back(m\/factor);\n            factors.push_back(factor);\n        }\n    }\n    while(factors.size());\n    \n    \/\/prime factors found by pollard rho arent always ordered\n    std::sort(primes.begin(), primes.end());\n    \n    return primes;\n}\n\n\nstd::size_t inpal::prime::prime_locate(std::size_t pos)\n{\n    \/\/index starts at 1 instead of 0, eg 1st prime is 2\n    pos = pos-1;\n    \n    \/\/return values for input less or equal to 10\n    const auto small_primes = prime_list(29);\n    if(pos<10) return small_primes[pos];\n    \n    \/\/denotes the limit of the sieve\n    std::size_t limit = pos*log(pos)+pos*log(log(pos));\n    const auto primes = prime_list(limit);\n    \n    return primes[pos];\n}\n\n\nstd::size_t inpal::prime::max_prime(std::size_t range)\n{\n    if(range<2) throw std::invalid_argument(\"There are no prime numbers less than two 2\");\n    \n    for(std::size_t i=range; i>0; i--) if(prime_test(i)) return i;\n    \n    return 2;\n}\n\n\nstd::size_t inpal::prime::prime_count(std::size_t range)\n{\n    if(range<2) return 0;\n    if(range==2) return 1;\n    \n    std::vector<bool> p_count(range\/2+1, true);\n    \n    \/\/modified sieve of eratosthenes\n    for(std::size_t i=1; i<=std::sqrt(range\/2+1); i++)\n    {\n       if(p_count[i])\n       {\n           for(std::size_t j=2*i*(i+1); j<range\/2+1; j+=2*i+1) p_count[j]=false;\n       }\n    }\n    \n    return std::count(p_count.begin(), p_count.end(), true);\n}\n\n\ndouble inpal::prime::prime_density(double range)\n{\n    return prime_count(range)\/range;\n}\n\n\nbool inpal::prime::prime_test(std::size_t num)\n{\n    if(num<2 ||(num!=2 && num%2==0)) return false;\n    \n    \/\/iterations will occur 20 times to ensure that the margin of error is less than 4^-20\n    const std::size_t cycle = 20;\n    std::size_t s = num-1;\n    while(s%2==0) s\/=2;\n    \n    for(std::size_t i=0; i<cycle; i++)\n    {\n        std::size_t a = rand()%(num-1)+1;\n        std::size_t b = s;\n        std::size_t mod = algorithm::modulo(a,b,num);\n        \n        while(b!=num-1 && mod!=1 && mod!=num-1)\n        {\n            mod=algorithm::mulmod(mod,mod,num);\n            b*=2;\n        }\n        if(mod!=num-1 && b%2==0) return false;\n    }\n    \n    return true;\n}\n\n\nbool inpal::prime::twin_test(std::size_t num)\n{\n    return prime_test(num) && (prime_test(num-2) || prime_test(num+2));\n}\n\n\nbool inpal::prime::cousin_test(std::size_t num)\n{\n    return  prime_test(num) && (prime_test(num-4) || prime_test(num+4));\n}\n\n\nbool inpal::prime::sexy_test(std::size_t num)\n{\n    return num!=3 && prime_test(num) && (prime_test(num-6) || prime_test(num+6));\n}\n\n\nstd::size_t inpal::prime::max_palprime(std::size_t range)\n{\n    if(range<2) throw std::invalid_argument(\"There are no palindromic prime numbers less than two 2\");\n    \n    for(std::size_t i=range; i>=2; --i) if(prime_test(i) && algorithm::pal_test(i)) return i;\n    \n    return 2;\n}\n\n\nstd::size_t inpal::prime::max_factor(std::size_t num)\n{\n    if(num<2) throw std::invalid_argument(\"There are no prime factors less than two 2\");\n    \n    return factor_list(num).back();\n}\n\n\nstd::size_t inpal::prime::factor_count(std::size_t num)\n{\n    return factor_list(num).size();\n}\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 <cphvb.h>\n#include <cassert>\n#include <map>\n#include \"cphvb_vem_cluster.h\"\n#include \"dispatch.h\"\n#include \"pgrid.h\"\n#include \"exec.h\"\n\n\n\/\/Check for error. Will exit on error.\nstatic void check_error(cphvb_error err, const char *file, int line)\n{\n    if(err != CPHVB_SUCCESS)\n    {\n        fprintf(stderr, \"[VEM-CLUSTER] Slave (rank %d) encountered the error %s at %s:%d\\n\",\n                pgrid_myrank, cphvb_error_text(err), file, line);\n        MPI_Abort(MPI_COMM_WORLD,-1);\n    }\n}\n\n\/\/Check for execution error. Will exit on error.\nstatic void check_exec_error(cphvb_error err, const char *file, int line, \n                             cphvb_intp count, cphvb_instruction inst_list[])\n{\n    if(err == CPHVB_PARTIAL_SUCCESS)\/\/Only partial success\n    {\n        char msg[count+4096];\n        sprintf(msg, \"[VEM-CLUSTER] Slave (rank %d) encountered error in instruction batch: %s\\n\",\n                pgrid_myrank, cphvb_error_text(err));\n        for(cphvb_intp i=0; i<count; ++i)\n        {\n            cphvb_instruction *ist = &inst_list[i];\n            sprintf(msg+strlen(msg),\"\\tOpcode: %s\", cphvb_opcode_text(ist->opcode));\n            if(ist->opcode == CPHVB_USERFUNC)\n            {\n                sprintf(msg+strlen(msg),\", Operand types:\");\n                for(cphvb_intp j=0; j<cphvb_operands_in_instruction(ist); ++j)\n                    sprintf(msg+strlen(msg),\" %s\", cphvb_type_text(cphvb_type_operand(ist,j))); \n            }\n            else\n            {\n                sprintf(msg+strlen(msg),\", Operand types:\");\n                for(cphvb_intp j=0; j<cphvb_operands_in_instruction(ist); ++j)\n                    sprintf(msg+strlen(msg),\" %s\", cphvb_type_text(cphvb_type_operand(ist,j))); \n            }\n            sprintf(msg+strlen(msg),\", Status: %s\\n\", cphvb_error_text(ist->status));\n        }\n        fprintf(stderr,\"%s\", msg);\n        MPI_Abort(MPI_COMM_WORLD,-1);\n    }\n    check_error(err, file, line);\n}  \n\nint main()\n{\n    dispatch_msg *msg;\n    \n    \/\/Initiate the process grid\n    check_error(pgrid_init(),__FILE__,__LINE__);\n\n    while(1)\n    {\n        \/\/Receive the dispatch message from the master-process\n        check_error(dispatch_reset(),__FILE__,__LINE__);\n        check_error(dispatch_recv(&msg),__FILE__,__LINE__);\n\n        \/\/Handle the message\n        switch(msg->type) \n        {\n            case CPHVB_CLUSTER_DISPATCH_INIT:\n            {\n                char *name = msg->payload;\n                printf(\"Slave (rank %d) received INIT. name: %s\\n\", pgrid_myrank, name);\n                check_error(exec_init(name),__FILE__,__LINE__);\n                break;\n            }\n            case CPHVB_CLUSTER_DISPATCH_SHUTDOWN:\n            {\n                printf(\"Slave (rank %d) received SHUTDOWN\\n\",pgrid_myrank);\n                check_error(exec_shutdown(),__FILE__,__LINE__);\n                return 0;\n            }\n            case CPHVB_CLUSTER_DISPATCH_UFUNC:\n            {\n                cphvb_intp *id = (cphvb_intp *)msg->payload;\n                char *fun = msg->payload+sizeof(cphvb_intp);\n                printf(\"Slave (rank %d) received UFUNC. fun: %s, id: %ld\\n\",pgrid_myrank, fun, *id);\n                check_error(exec_reg_func(fun, id),__FILE__,__LINE__);\n                break;\n            }\n            case CPHVB_CLUSTER_DISPATCH_EXEC:\n            {\n                \/\/The number of instructions\n                cphvb_intp *noi = (cphvb_intp *)msg->payload;                 \n                \/\/The master-instruction list\n                cphvb_instruction *master_list = (cphvb_instruction *)(noi+1);\n                \/\/The number of new arrays\n                cphvb_intp *noa = (cphvb_intp *)(master_list + *noi);\n                \/\/The list of new arrays\n                dispatch_array *darys = (dispatch_array*)(noa+1); \/\/number of new arrays\n                \/\/The number of user-defined functions\n                cphvb_intp *nou = (cphvb_intp *)(darys + *noa);\n                \/\/The list of user-defined functions\n                cphvb_userfunc *ufunc = (cphvb_userfunc*)(nou+1); \/\/number of new arrays\n\n\n   printf(\"Slave (rank %d) received EXEC. noi: %ld, noa: %ld, nou: %ld\\n\",pgrid_myrank, *noi, *noa, *nou);\n               \n                \/\/Insert the new array into the array store and the array maps\n                std::stack<cphvb_array*> base_darys;\n                for(cphvb_intp i=0; i < *noa; ++i)\n                {\n                    cphvb_array *ary = dispatch_new_slave_array(&darys[i].ary, darys[i].id);\n                    if(ary->base == NULL)\/\/This is a base array.\n                        base_darys.push(ary);\n                } \n                \/\/Update the base-array-pointers\n                for(cphvb_intp i=0; i < *noa; ++i)\n                {\n                    cphvb_array *ary = dispatch_master2slave(darys[i].id);\n                    if(ary->base != NULL)\/\/This is NOT a base array\n                    {\n                        assert(dispatch_slave_exist(((cphvb_intp)ary->base)));\n                        ary->base = dispatch_master2slave((cphvb_intp)ary->base);\n                    }\n                }\n\n                \/\/Receive the dispatched array-data from the master-process\n                check_error(dispatch_array_data(base_darys),__FILE__,__LINE__);\n                    \n                    \n                \/\/Allocate the local instruction list that should reference local arrays\n                cphvb_instruction *local_list = (cphvb_instruction *)malloc(*noi*sizeof(cphvb_instruction));\n                if(local_list == NULL)\n                    check_error(CPHVB_OUT_OF_MEMORY,__FILE__,__LINE__);\n        \n                memcpy(local_list, master_list, (*noi)*sizeof(cphvb_instruction));\n            \n                \/\/De-serialize all user-defined function pointers.\n                for(cphvb_intp i=0; i < *noi; ++i)\n                {\n                    cphvb_instruction *inst = &local_list[i];\n                    if(inst->opcode == CPHVB_USERFUNC)\n                    {   \n                        inst->userfunc = (cphvb_userfunc*) malloc(ufunc->struct_size);\n                        if(inst->userfunc == NULL)\n                            check_error(CPHVB_OUT_OF_MEMORY,__FILE__,__LINE__);\n                        \/\/Save a local copy of the user-defined function\n                        memcpy(inst->userfunc, ufunc, ufunc->struct_size);\n                        \/\/Iterate to the next user-defined function\n                        ufunc = (cphvb_userfunc*)(((char*)ufunc) + ufunc->struct_size);\n                    }\n                }\n\n                \/\/Update all instruction to reference local arrays \n                for(cphvb_intp i=0; i < *noi; ++i)\n                {\n                    cphvb_instruction *inst = &local_list[i];\n                    int nop = cphvb_operands_in_instruction(inst);\n                    cphvb_array **ops;\n                    if(inst->opcode == CPHVB_USERFUNC)\n                        ops = inst->userfunc->operand;\n                    else\n                        ops = inst->operand;\n\n                    \/\/Convert all instructon operands\n                    for(cphvb_intp j=0; j<nop; ++j)\n                    { \n                        if(cphvb_is_constant(ops[j]))\n                            continue;\n                        assert(dispatch_slave_exist((cphvb_intp)ops[j]));\n                        ops[j] = dispatch_master2slave((cphvb_intp)ops[j]);\n                    }\n                }\n\n\/\/                cphvb_pprint_instr_list(local_list, *noi, \"SLAVE\");\n\n                check_exec_error(exec_execute(*noi, local_list),__FILE__,__LINE__, *noi, local_list);\n                free(local_list);\n                break;\n            }\n            default:\n                fprintf(stderr, \"[VEM-CLUSTER] Slave (rank %d) \"\n                        \"received unknown message type\\n\", pgrid_myrank);\n                MPI_Abort(MPI_COMM_WORLD,CPHVB_ERROR);\n        }\n    }\n    return CPHVB_SUCCESS; \n}\n<commit_msg>Removed some debug prints<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 <cphvb.h>\n#include <cassert>\n#include <map>\n#include \"cphvb_vem_cluster.h\"\n#include \"dispatch.h\"\n#include \"pgrid.h\"\n#include \"exec.h\"\n\n\n\/\/Check for error. Will exit on error.\nstatic void check_error(cphvb_error err, const char *file, int line)\n{\n    if(err != CPHVB_SUCCESS)\n    {\n        fprintf(stderr, \"[VEM-CLUSTER] Slave (rank %d) encountered the error %s at %s:%d\\n\",\n                pgrid_myrank, cphvb_error_text(err), file, line);\n        MPI_Abort(MPI_COMM_WORLD,-1);\n    }\n}\n\n\/\/Check for execution error. Will exit on error.\nstatic void check_exec_error(cphvb_error err, const char *file, int line, \n                             cphvb_intp count, cphvb_instruction inst_list[])\n{\n    if(err == CPHVB_PARTIAL_SUCCESS)\/\/Only partial success\n    {\n        char msg[count+4096];\n        sprintf(msg, \"[VEM-CLUSTER] Slave (rank %d) encountered error in instruction batch: %s\\n\",\n                pgrid_myrank, cphvb_error_text(err));\n        for(cphvb_intp i=0; i<count; ++i)\n        {\n            cphvb_instruction *ist = &inst_list[i];\n            sprintf(msg+strlen(msg),\"\\tOpcode: %s\", cphvb_opcode_text(ist->opcode));\n            if(ist->opcode == CPHVB_USERFUNC)\n            {\n                sprintf(msg+strlen(msg),\", Operand types:\");\n                for(cphvb_intp j=0; j<cphvb_operands_in_instruction(ist); ++j)\n                    sprintf(msg+strlen(msg),\" %s\", cphvb_type_text(cphvb_type_operand(ist,j))); \n            }\n            else\n            {\n                sprintf(msg+strlen(msg),\", Operand types:\");\n                for(cphvb_intp j=0; j<cphvb_operands_in_instruction(ist); ++j)\n                    sprintf(msg+strlen(msg),\" %s\", cphvb_type_text(cphvb_type_operand(ist,j))); \n            }\n            sprintf(msg+strlen(msg),\", Status: %s\\n\", cphvb_error_text(ist->status));\n        }\n        fprintf(stderr,\"%s\", msg);\n        MPI_Abort(MPI_COMM_WORLD,-1);\n    }\n    check_error(err, file, line);\n}  \n\nint main()\n{\n    dispatch_msg *msg;\n    \n    \/\/Initiate the process grid\n    check_error(pgrid_init(),__FILE__,__LINE__);\n\n    while(1)\n    {\n        \/\/Receive the dispatch message from the master-process\n        check_error(dispatch_reset(),__FILE__,__LINE__);\n        check_error(dispatch_recv(&msg),__FILE__,__LINE__);\n\n        \/\/Handle the message\n        switch(msg->type) \n        {\n            case CPHVB_CLUSTER_DISPATCH_INIT:\n            {\n                char *name = msg->payload;\n                printf(\"Slave (rank %d) received INIT. name: %s\\n\", pgrid_myrank, name);\n                check_error(exec_init(name),__FILE__,__LINE__);\n                break;\n            }\n            case CPHVB_CLUSTER_DISPATCH_SHUTDOWN:\n            {\n                printf(\"Slave (rank %d) received SHUTDOWN\\n\",pgrid_myrank);\n                check_error(exec_shutdown(),__FILE__,__LINE__);\n                return 0;\n            }\n            case CPHVB_CLUSTER_DISPATCH_UFUNC:\n            {\n                cphvb_intp *id = (cphvb_intp *)msg->payload;\n                char *fun = msg->payload+sizeof(cphvb_intp);\n                printf(\"Slave (rank %d) received UFUNC. fun: %s, id: %ld\\n\",pgrid_myrank, fun, *id);\n                check_error(exec_reg_func(fun, id),__FILE__,__LINE__);\n                break;\n            }\n            case CPHVB_CLUSTER_DISPATCH_EXEC:\n            {\n                \/\/The number of instructions\n                cphvb_intp *noi = (cphvb_intp *)msg->payload;                 \n                \/\/The master-instruction list\n                cphvb_instruction *master_list = (cphvb_instruction *)(noi+1);\n                \/\/The number of new arrays\n                cphvb_intp *noa = (cphvb_intp *)(master_list + *noi);\n                \/\/The list of new arrays\n                dispatch_array *darys = (dispatch_array*)(noa+1); \/\/number of new arrays\n                \/\/The number of user-defined functions\n                cphvb_intp *nou = (cphvb_intp *)(darys + *noa);\n                \/\/The list of user-defined functions\n                cphvb_userfunc *ufunc = (cphvb_userfunc*)(nou+1); \/\/number of new arrays\n\n\n\/\/   printf(\"Slave (rank %d) received EXEC. noi: %ld, noa: %ld, nou: %ld\\n\",pgrid_myrank, *noi, *noa, *nou);\n               \n                \/\/Insert the new array into the array store and the array maps\n                std::stack<cphvb_array*> base_darys;\n                for(cphvb_intp i=0; i < *noa; ++i)\n                {\n                    cphvb_array *ary = dispatch_new_slave_array(&darys[i].ary, darys[i].id);\n                    if(ary->base == NULL)\/\/This is a base array.\n                        base_darys.push(ary);\n                } \n                \/\/Update the base-array-pointers\n                for(cphvb_intp i=0; i < *noa; ++i)\n                {\n                    cphvb_array *ary = dispatch_master2slave(darys[i].id);\n                    if(ary->base != NULL)\/\/This is NOT a base array\n                    {\n                        assert(dispatch_slave_exist(((cphvb_intp)ary->base)));\n                        ary->base = dispatch_master2slave((cphvb_intp)ary->base);\n                    }\n                }\n\n                \/\/Receive the dispatched array-data from the master-process\n                check_error(dispatch_array_data(base_darys),__FILE__,__LINE__);\n                    \n                    \n                \/\/Allocate the local instruction list that should reference local arrays\n                cphvb_instruction *local_list = (cphvb_instruction *)malloc(*noi*sizeof(cphvb_instruction));\n                if(local_list == NULL)\n                    check_error(CPHVB_OUT_OF_MEMORY,__FILE__,__LINE__);\n        \n                memcpy(local_list, master_list, (*noi)*sizeof(cphvb_instruction));\n            \n                \/\/De-serialize all user-defined function pointers.\n                for(cphvb_intp i=0; i < *noi; ++i)\n                {\n                    cphvb_instruction *inst = &local_list[i];\n                    if(inst->opcode == CPHVB_USERFUNC)\n                    {   \n                        inst->userfunc = (cphvb_userfunc*) malloc(ufunc->struct_size);\n                        if(inst->userfunc == NULL)\n                            check_error(CPHVB_OUT_OF_MEMORY,__FILE__,__LINE__);\n                        \/\/Save a local copy of the user-defined function\n                        memcpy(inst->userfunc, ufunc, ufunc->struct_size);\n                        \/\/Iterate to the next user-defined function\n                        ufunc = (cphvb_userfunc*)(((char*)ufunc) + ufunc->struct_size);\n                    }\n                }\n\n                \/\/Update all instruction to reference local arrays \n                for(cphvb_intp i=0; i < *noi; ++i)\n                {\n                    cphvb_instruction *inst = &local_list[i];\n                    int nop = cphvb_operands_in_instruction(inst);\n                    cphvb_array **ops;\n                    if(inst->opcode == CPHVB_USERFUNC)\n                        ops = inst->userfunc->operand;\n                    else\n                        ops = inst->operand;\n\n                    \/\/Convert all instructon operands\n                    for(cphvb_intp j=0; j<nop; ++j)\n                    { \n                        if(cphvb_is_constant(ops[j]))\n                            continue;\n                        assert(dispatch_slave_exist((cphvb_intp)ops[j]));\n                        ops[j] = dispatch_master2slave((cphvb_intp)ops[j]);\n                    }\n                }\n\n\/\/                cphvb_pprint_instr_list(local_list, *noi, \"SLAVE\");\n\n                check_exec_error(exec_execute(*noi, local_list),__FILE__,__LINE__, *noi, local_list);\n                free(local_list);\n                break;\n            }\n            default:\n                fprintf(stderr, \"[VEM-CLUSTER] Slave (rank %d) \"\n                        \"received unknown message type\\n\", pgrid_myrank);\n                MPI_Abort(MPI_COMM_WORLD,CPHVB_ERROR);\n        }\n    }\n    return CPHVB_SUCCESS; \n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  zero-dimensional kinetics example program\n\/\/\n\/\/  copyright California Institute of Technology 2002\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"cantera\/zerodim.h\"\n#include \"cantera\/IdealGasMix.h\"\n#include \"cantera\/numerics.h\"\n\n#include <time.h>\n#include \"example_utils.h\"\n\nusing namespace Cantera;\nusing std::cout;\nusing std::endl;\n\nint kinetics1(int np, void* p)\n{\n\n    cout << \"Constant-pressure ignition of a \"\n         << \"hydrogen\/oxygen\/nitrogen\"\n         \" mixture \\nbeginning at T = 1001 K and P = 1 atm.\" << endl;\n\n    \/\/ create an ideal gas mixture that corresponds to GRI-Mech\n    \/\/ 3.0\n    IdealGasMix gas(\"gri30.cti\", \"gri30\");\n\n    \/\/ set the state\n    gas.setState_TPX(1001.0, OneAtm, \"H2:2.0, O2:1.0, N2:4.0\");\n    int nsp = gas.nSpecies();\n\n    \/\/ create a reactor\n    Reactor r;\n\n    \/\/ create a reservoir to represent the environment\n    Reservoir env;\n\n    \/\/ 'insert' the gas into the reactor and environment.  Note\n    \/\/ that it is ok to insert the same gas object into multiple\n    \/\/ reactors or reservoirs. All this means is that this object\n    \/\/ will be used to evaluate thermodynamic or kinetic\n    \/\/ quantities needed.\n    r.insert(gas);\n    env.insert(gas);\n\n    \/\/r.addHomogenRxnSens(0);\n\n    \/\/ create a wall between the reactor and the environment\n    Wall w;\n    w.install(r,env);\n\n    \/\/ The wall \"expansion rate coefficient\" controls how fast it\n    \/\/ moves in response to a pressure difference. Set it to a\n    \/\/ large value to approach the constant-pressure limit, so\n    \/\/ that the wall moves to counteract even small pressure\n    \/\/ differences\n    w.setExpansionRateCoeff(1.e9);\n\n    \/\/ set the wall to have unit area (arbitrary)\n    w.setArea(1.0);\n\n    double tm;\n    double dt = 1.e-5;    \/\/ interval at which output is written\n    int nsteps = 100;     \/\/ number of intervals\n\n    \/\/ create a 2D array to hold the output variables,\n    \/\/ and store the values for the initial state\n    Array2D soln(nsp+4, 1);\n    saveSoln(0, 0.0, gas, soln);\n\n    \/\/ create a container object to run the simulation\n    \/\/ and add the reactor to it\n    ReactorNet sim;\n    sim.addReactor(&r);\n\n    \/\/ main loop\n    clock_t t0 = clock();        \/\/ save start time\n    for (int i = 1; i <= nsteps; i++) {\n        tm = i*dt;\n        sim.advance(tm);\n        cout << \"time = \" << tm << \" s\" << endl;\n        saveSoln(tm, gas, soln);\n    }\n    clock_t t1 = clock();        \/\/ save end time\n\n\n    \/\/ make a Tecplot data file and an Excel spreadsheet\n    std::string plotTitle = \"kinetics example 1: constant-pressure ignition\";\n    plotSoln(\"kin1.dat\", \"TEC\", plotTitle, gas, soln);\n    plotSoln(\"kin1.csv\", \"XL\", plotTitle, gas, soln);\n\n\n    \/\/ print final temperature and timing data\n    doublereal tmm = 1.0*(t1 - t0)\/CLOCKS_PER_SEC;\n    cout << \" Tfinal = \" << r.temperature() << endl;\n    cout << \" time = \" << tmm << endl;\n    cout << \" number of residual function evaluations = \"\n         << sim.integrator().nEvals() << endl;\n    cout << \" time per evaluation = \" << tmm\/sim.integrator().nEvals()\n         << endl << endl;\n    cout << \"Output files:\" << endl\n         << \"  kin1.csv    (Excel CSV file)\" << endl\n         << \"  kin1.dat    (Tecplot data file)\" << endl;\n\n    return 0;\n}\n\n\n#ifndef CXX_DEMO\n\nint main()\n{\n\n    try {\n        int retn = kinetics1(0, 0);\n        appdelete();\n        return retn;\n    }\n    \/\/ handle exceptions thrown by Cantera\n    catch (CanteraError& err) {\n        std::cout << err.what() << std::endl;\n        cout << \" terminating... \" << endl;\n        appdelete();\n        return -1;\n    }\n}\n\n#endif\n<commit_msg>[Reactor\/Samples] Cleanup of kinetics1.cpp<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  zero-dimensional kinetics example program\n\/\/\n\/\/  copyright California Institute of Technology 2002\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"cantera\/zerodim.h\"\n#include \"cantera\/IdealGasMix.h\"\n#include \"example_utils.h\"\n\nusing namespace Cantera;\nusing std::cout;\nusing std::endl;\n\nint kinetics1(int np, void* p)\n{\n    cout << \"Constant-pressure ignition of a \"\n         << \"hydrogen\/oxygen\/nitrogen\"\n         \" mixture \\nbeginning at T = 1001 K and P = 1 atm.\" << endl;\n\n    \/\/ create an ideal gas mixture that corresponds to GRI-Mech 3.0\n    IdealGasMix gas(\"gri30.cti\", \"gri30\");\n\n    \/\/ set the state\n    gas.setState_TPX(1001.0, OneAtm, \"H2:2.0, O2:1.0, N2:4.0\");\n    int nsp = gas.nSpecies();\n\n    \/\/ create a reactor\n    IdealGasConstPressureReactor r;\n\n    \/\/ 'insert' the gas into the reactor and environment.  Note\n    \/\/ that it is ok to insert the same gas object into multiple\n    \/\/ reactors or reservoirs. All this means is that this object\n    \/\/ will be used to evaluate thermodynamic or kinetic\n    \/\/ quantities needed.\n    r.insert(gas);\n\n    double dt = 1.e-5;    \/\/ interval at which output is written\n    int nsteps = 100;     \/\/ number of intervals\n\n    \/\/ create a 2D array to hold the output variables,\n    \/\/ and store the values for the initial state\n    Array2D soln(nsp+4, 1);\n    saveSoln(0, 0.0, gas, soln);\n\n    \/\/ create a container object to run the simulation\n    \/\/ and add the reactor to it\n    ReactorNet sim;\n    sim.addReactor(&r);\n\n    \/\/ main loop\n    clock_t t0 = clock();        \/\/ save start time\n    for (int i = 1; i <= nsteps; i++) {\n        double tm = i*dt;\n        sim.advance(tm);\n        cout << \"time = \" << tm << \" s\" << endl;\n        saveSoln(tm, gas, soln);\n    }\n    clock_t t1 = clock();        \/\/ save end time\n\n\n    \/\/ make a Tecplot data file and an Excel spreadsheet\n    std::string plotTitle = \"kinetics example 1: constant-pressure ignition\";\n    plotSoln(\"kin1.dat\", \"TEC\", plotTitle, gas, soln);\n    plotSoln(\"kin1.csv\", \"XL\", plotTitle, gas, soln);\n\n\n    \/\/ print final temperature and timing data\n    doublereal tmm = 1.0*(t1 - t0)\/CLOCKS_PER_SEC;\n    cout << \" Tfinal = \" << r.temperature() << endl;\n    cout << \" time = \" << tmm << endl;\n    cout << \" number of residual function evaluations = \"\n         << sim.integrator().nEvals() << endl;\n    cout << \" time per evaluation = \" << tmm\/sim.integrator().nEvals()\n         << endl << endl;\n    cout << \"Output files:\" << endl\n         << \"  kin1.csv    (Excel CSV file)\" << endl\n         << \"  kin1.dat    (Tecplot data file)\" << endl;\n\n    return 0;\n}\n\n\nint main()\n{\n    try {\n        int retn = kinetics1(0, 0);\n        appdelete();\n        return retn;\n    }\n    \/\/ handle exceptions thrown by Cantera\n    catch (CanteraError& err) {\n        std::cout << err.what() << std::endl;\n        cout << \" terminating... \" << endl;\n        appdelete();\n        return -1;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"core\/argparse.h\"\n\n#include \"core\/cint.h\"\n\n#include <iostream>\n\n\n\/*\n\n   argparse issues:\n\n   * output looks horrible\n\n   * unhelpful error messages\n\n   * positionals eat help argument\n\n   * subcommands are missing help text\n\n   * assert invalid setups and arguments\n\n   * simplify simple parsers that doesn't use the OnComplete style\n\n   * SetTrue\/SetFalse\/SetConst arguments\n\n   * non-greedy sub commands to operate lite ImageMagic \"scripting\": https:\/\/imagemagick.org\/script\/magick-script.php\n\n   * Help\/Narg chainging functions renaming on return value of Add\n\n   * comma parsing of Names (with multiple names)\n\n*\/\n\n\nnamespace euphoria::core::argparse\n{\n    int\n    ReturnValue(ParseResult pr)\n    {\n        switch (pr)\n        {\n        case ParseResult::Ok: return 0;\n        case ParseResult::Error: return -1;\n        case ParseResult::Quit: return 0;\n        default: return -1;\n        }\n    }\n\n\n    Arguments::Arguments(const std::string& n, const std::vector<std::string>& a)\n        : name(n)\n        , arguments(a)\n    {\n    }\n\n\n    Arguments\n    Arguments::Extract(int argc, char* argv[])\n    {\n        auto ret = Arguments{argv[0] , {}};\n        \n        for (int i = 1; i < argc; i += 1)\n        {\n            ret.arguments.emplace_back(argv[i]);\n        }\n\n        return ret;\n    }\n\n\n    ArgumentReader::ArgumentReader(const Arguments& a)\n        : arguments(a)\n        , next_position(0)\n    {\n    }\n\n\n    bool\n    ArgumentReader::HasMore() const\n    {\n        return next_position < Csizet_to_int(arguments.arguments.size());\n    }\n\n\n    std::string\n    ArgumentReader::Peek() const\n    {\n        if (HasMore())\n        {\n            const auto arg = arguments.arguments[next_position];\n            return arg;\n        }\n        else\n        {\n            return \"\";\n        }\n    }\n\n\n    std::string\n    ArgumentReader::Read()\n    {\n        const auto arg = Peek();\n        next_position += 1;\n        return arg;\n    }\n\n\n    Printer::~Printer()\n    {\n    }\n\n\n    void\n    ConsolePrinter::PrintError(const std::string& line)\n    {\n        std::cerr << line << \"\\n\";\n    }\n\n\n    void\n    ConsolePrinter::PrintInfo(const std::string& line)\n    {\n        std::cout << line << \"\\n\";\n    }\n\n\n    Name::Name(const std::string& n)\n        : name(n)\n    {\n    }\n\n\n    Name::Name(const char* n)\n        : name(n)\n    {\n    }\n\n\n    bool\n    IsOptionalArgument(const std::string& name)\n    {\n        return name[0] == '-';\n    }\n\n\n    bool\n    Name::IsOptional() const\n    {\n        return IsOptionalArgument(name);\n    }\n\n\n    Argument::~Argument()\n    {\n    }\n\n\n    ArgumentAndName::ArgumentAndName(const Name& n, std::shared_ptr<Argument> a)\n        : name(n)\n        , argument(a)\n    {\n    }\n\n\n    ArgumentNoValue::ArgumentNoValue(Callback cb)\n        : callback(cb)\n    {\n    }\n\n\n    ParseResult\n    ArgumentNoValue::Parse(Runner* runner)\n    {\n        return callback(runner);\n    }\n\n\n    SingleArgument::SingleArgument(Callback cb)\n        : callback(cb)\n    {\n    }\n\n\n    ParseResult\n    SingleArgument::Parse(Runner* runner)\n    {\n        if (runner->arguments->HasMore())\n        {\n            auto res = callback(runner, runner->arguments->Read());\n            return res;\n        }\n        else\n        {\n            \/\/ todo(Gustav): improve eof error message by including argument name\n            runner->printer->PrintError(\"missing argument\");\n            return ParseResult::Error;\n        }\n    }\n\n\n    SubParserContainer::SubParserContainer(SubParserCallback cb)\n        : callback(cb)\n    {\n    }\n\n\n    Argument&\n    ParserBase::AddArgument(const Name& name, std::shared_ptr<Argument> argument)\n    {\n        if (name.IsOptional())\n        {\n            optional_arguments[name.name] = argument;\n            optional_argument_list.emplace_back(name, argument);\n        }\n        else\n        {\n            positional_argument_list.emplace_back(name, argument);\n        }\n        return *argument;\n    }\n\n\n    Argument&\n    ParserBase::AddVoidFunction(const Name& name, std::function<void()> void_function)\n    {\n        return AddArgument(name, std::make_shared<ArgumentNoValue>([void_function](Runner*) {void_function(); return ParseResult::Ok; }));\n    }\n\n\n    void\n    ParserBase::OnComplete(CompleteFunction cf)\n    {\n        on_complete = cf;\n    }\n\n\n    void\n    ParserBase::AddSubParser\n    (\n        const std::string& name,\n        const std::string& desc,\n        SubParserCallback sub\n    )\n    {\n        auto container = std::make_shared<SubParserContainer>(sub);\n        subparsers.Add(name, container);\n    }\n\n\n    std::shared_ptr<Argument>\n    ParserBase::FindArgument(const std::string& name)\n    {\n        return optional_arguments[name];\n    }\n\n\n    ParseResult\n    ParserBase::ParseArgs(Runner* runner)\n    {\n        int positional_index = 0;\n\n        auto has_more_positionals = [&]()\n        {\n            return positional_index < Csizet_to_int(positional_argument_list.size());\n        };\n\n        while (runner->arguments->HasMore())\n        {\n            if (has_more_positionals())\n            {\n                auto match = positional_argument_list[positional_index];\n                auto arg_parse_result = match.argument->Parse(runner);\n                if (arg_parse_result != ParseResult::Ok)\n                {\n                    return arg_parse_result;\n                }\n                positional_index += 1;\n            }\n            else\n            {\n                const auto arg = runner->arguments->Read();\n                if(IsOptionalArgument(arg))\n                {\n                    auto match = FindArgument(arg);\n                    if (match == nullptr)\n                    {\n                        runner->printer->PrintError(\"invalid argument: \" + arg);\n                        return ParseResult::Error;\n                    }\n                    auto arg_parse_result = match->Parse(runner);\n                    if (arg_parse_result != ParseResult::Ok)\n                    {\n                        return arg_parse_result;\n                    }\n                }\n                else\n                {\n                    \/\/ arg doesn't look like a optional argument\n                    \/\/ hence it must be a sub command\n                    \/\/ or it's a error\n                    if(subparsers.size == 0)\n                    {\n                        runner->printer->PrintError(\"no subcomands for \" + arg);\n                        return ParseResult::Error;\n                    }\n                    else\n                    {\n                        auto match = subparsers.Match(arg, 3);\n                        if(match.single_match == false)\n                        {\n                            runner->printer->PrintError(\"too many matches for \" + arg);\n                            return ParseResult::Error;\n                        }\n                        else\n                        {\n                            auto sub = SubParser{runner};\n                            return match.values[0]->callback(&sub);\n                        }\n                    }\n                }\n            }\n        }\n\n        if (has_more_positionals())\n        {\n            runner->printer->PrintError(\"positionals left\");\n            return ParseResult::Error;\n        }\n\n        if(subparsers.size != 0)\n        {\n            runner->printer->PrintError(\"no subparser specified\");\n            return ParseResult::Error;\n        }\n\n        if(on_complete.has_value())\n        {\n            on_complete.value()();\n        }\n\n        return ParseResult::Ok;\n    }\n\n\n    SubParser::SubParser(Runner* r)\n        : runner(r)\n    {\n    }\n\n\n    ParseResult\n    SubParser::OnComplete(CompleteFunction com)\n    {\n        ParserBase::OnComplete(com);\n        return ParseArgs(runner);\n    }\n\n\n    Parser::Parser(const std::string& d)\n        : description(d)\n        , printer(std::make_shared<ConsolePrinter>())\n    {\n        AddArgument(\"-h\", std::make_shared<ArgumentNoValue>([this](Runner*) {PrintHelp(); return ParseResult::Quit; }))\n            .help = \"print help\";\n    }\n\n\n    void\n    Parser::PrintHelp()\n    {\n        if (description.empty() == false)\n        {\n            printer->PrintInfo(description);\n        }\n\n        \/\/ todo(Gustav): use a string table here, add wordwrap to table\n        for (auto& a : positional_argument_list)\n        {\n            printer->PrintInfo(a.name.name + \" \" + a.argument->help);\n        }\n        for (auto& a : optional_argument_list)\n        {\n            printer->PrintInfo(a.name.name + \" \" + a.argument->help);\n        }\n    }\n\n\n    ParseResult\n    Parser::ParseArgs(const Arguments& args)\n    {\n        auto reader = ArgumentReader{ args };\n        auto runner = Runner{ &reader, printer };\n        return ParserBase::ParseArgs(&runner);\n    }\n\n\n    int\n    ParseFromMain(Parser* parser, int argc, char* argv[])\n    {\n        const auto args = Arguments::Extract(argc, argv);\n        const auto res = parser->ParseArgs(args);\n        return ReturnValue(res);\n    }\n}\n<commit_msg>more todos<commit_after>#include \"core\/argparse.h\"\n\n#include \"core\/cint.h\"\n\n#include <iostream>\n\n\n\/*\n\n   argparse issues & todos:\n\n   * output looks horrible\n\n   * unhelpful error messages, hint misspelled argument via StringToEnum code\n\n   * positionals eat help argument! -h with positional generates parsing error\n\n   * assert invalid setups and arguments\n\n   * simplify simple parsers that doesn't use the OnComplete style\n\n   * SetTrue\/SetFalse\/SetConst arguments\n\n   * non-greedy sub commands to operate lite ImageMagic \"scripting\": https:\/\/imagemagick.org\/script\/magick-script.php\n\n   * Help\/Narg chainging functions renaming on return value of Add\n\n   * comma parsing of Names (with multiple names)\n\n   * ParseResult should be a struct\/handle custom arguments\n\n   * generic OnComplete unit test\n\n*\/\n\n\nnamespace euphoria::core::argparse\n{\n    int\n    ReturnValue(ParseResult pr)\n    {\n        switch (pr)\n        {\n        case ParseResult::Ok: return 0;\n        case ParseResult::Error: return -1;\n        case ParseResult::Quit: return 0;\n        default: return -1;\n        }\n    }\n\n\n    Arguments::Arguments(const std::string& n, const std::vector<std::string>& a)\n        : name(n)\n        , arguments(a)\n    {\n    }\n\n\n    Arguments\n    Arguments::Extract(int argc, char* argv[])\n    {\n        auto ret = Arguments{argv[0] , {}};\n        \n        for (int i = 1; i < argc; i += 1)\n        {\n            ret.arguments.emplace_back(argv[i]);\n        }\n\n        return ret;\n    }\n\n\n    ArgumentReader::ArgumentReader(const Arguments& a)\n        : arguments(a)\n        , next_position(0)\n    {\n    }\n\n\n    bool\n    ArgumentReader::HasMore() const\n    {\n        return next_position < Csizet_to_int(arguments.arguments.size());\n    }\n\n\n    std::string\n    ArgumentReader::Peek() const\n    {\n        if (HasMore())\n        {\n            const auto arg = arguments.arguments[next_position];\n            return arg;\n        }\n        else\n        {\n            return \"\";\n        }\n    }\n\n\n    std::string\n    ArgumentReader::Read()\n    {\n        const auto arg = Peek();\n        next_position += 1;\n        return arg;\n    }\n\n\n    Printer::~Printer()\n    {\n    }\n\n\n    void\n    ConsolePrinter::PrintError(const std::string& line)\n    {\n        std::cerr << line << \"\\n\";\n    }\n\n\n    void\n    ConsolePrinter::PrintInfo(const std::string& line)\n    {\n        std::cout << line << \"\\n\";\n    }\n\n\n    Name::Name(const std::string& n)\n        : name(n)\n    {\n    }\n\n\n    Name::Name(const char* n)\n        : name(n)\n    {\n    }\n\n\n    bool\n    IsOptionalArgument(const std::string& name)\n    {\n        return name[0] == '-';\n    }\n\n\n    bool\n    Name::IsOptional() const\n    {\n        return IsOptionalArgument(name);\n    }\n\n\n    Argument::~Argument()\n    {\n    }\n\n\n    ArgumentAndName::ArgumentAndName(const Name& n, std::shared_ptr<Argument> a)\n        : name(n)\n        , argument(a)\n    {\n    }\n\n\n    ArgumentNoValue::ArgumentNoValue(Callback cb)\n        : callback(cb)\n    {\n    }\n\n\n    ParseResult\n    ArgumentNoValue::Parse(Runner* runner)\n    {\n        return callback(runner);\n    }\n\n\n    SingleArgument::SingleArgument(Callback cb)\n        : callback(cb)\n    {\n    }\n\n\n    ParseResult\n    SingleArgument::Parse(Runner* runner)\n    {\n        if (runner->arguments->HasMore())\n        {\n            auto res = callback(runner, runner->arguments->Read());\n            return res;\n        }\n        else\n        {\n            \/\/ todo(Gustav): improve eof error message by including argument name\n            runner->printer->PrintError(\"missing argument\");\n            return ParseResult::Error;\n        }\n    }\n\n\n    SubParserContainer::SubParserContainer(SubParserCallback cb)\n        : callback(cb)\n    {\n    }\n\n\n    Argument&\n    ParserBase::AddArgument(const Name& name, std::shared_ptr<Argument> argument)\n    {\n        if (name.IsOptional())\n        {\n            optional_arguments[name.name] = argument;\n            optional_argument_list.emplace_back(name, argument);\n        }\n        else\n        {\n            positional_argument_list.emplace_back(name, argument);\n        }\n        return *argument;\n    }\n\n\n    Argument&\n    ParserBase::AddVoidFunction(const Name& name, std::function<void()> void_function)\n    {\n        return AddArgument(name, std::make_shared<ArgumentNoValue>([void_function](Runner*) {void_function(); return ParseResult::Ok; }));\n    }\n\n\n    void\n    ParserBase::OnComplete(CompleteFunction cf)\n    {\n        on_complete = cf;\n    }\n\n\n    void\n    ParserBase::AddSubParser\n    (\n        const std::string& name,\n        const std::string& desc,\n        SubParserCallback sub\n    )\n    {\n        auto container = std::make_shared<SubParserContainer>(sub);\n        subparsers.Add(name, container);\n    }\n\n\n    std::shared_ptr<Argument>\n    ParserBase::FindArgument(const std::string& name)\n    {\n        return optional_arguments[name];\n    }\n\n\n    ParseResult\n    ParserBase::ParseArgs(Runner* runner)\n    {\n        int positional_index = 0;\n\n        auto has_more_positionals = [&]()\n        {\n            return positional_index < Csizet_to_int(positional_argument_list.size());\n        };\n\n        while (runner->arguments->HasMore())\n        {\n            if (has_more_positionals())\n            {\n                auto match = positional_argument_list[positional_index];\n                auto arg_parse_result = match.argument->Parse(runner);\n                if (arg_parse_result != ParseResult::Ok)\n                {\n                    return arg_parse_result;\n                }\n                positional_index += 1;\n            }\n            else\n            {\n                const auto arg = runner->arguments->Read();\n                if(IsOptionalArgument(arg))\n                {\n                    auto match = FindArgument(arg);\n                    if (match == nullptr)\n                    {\n                        runner->printer->PrintError(\"invalid argument: \" + arg);\n                        return ParseResult::Error;\n                    }\n                    auto arg_parse_result = match->Parse(runner);\n                    if (arg_parse_result != ParseResult::Ok)\n                    {\n                        return arg_parse_result;\n                    }\n                }\n                else\n                {\n                    \/\/ arg doesn't look like a optional argument\n                    \/\/ hence it must be a sub command\n                    \/\/ or it's a error\n                    if(subparsers.size == 0)\n                    {\n                        runner->printer->PrintError(\"no subcomands for \" + arg);\n                        return ParseResult::Error;\n                    }\n                    else\n                    {\n                        auto match = subparsers.Match(arg, 3);\n                        if(match.single_match == false)\n                        {\n                            runner->printer->PrintError(\"too many matches for \" + arg);\n                            return ParseResult::Error;\n                        }\n                        else\n                        {\n                            auto sub = SubParser{runner};\n                            return match.values[0]->callback(&sub);\n                        }\n                    }\n                }\n            }\n        }\n\n        if (has_more_positionals())\n        {\n            runner->printer->PrintError(\"positionals left\");\n            return ParseResult::Error;\n        }\n\n        if(subparsers.size != 0)\n        {\n            runner->printer->PrintError(\"no subparser specified\");\n            return ParseResult::Error;\n        }\n\n        if(on_complete.has_value())\n        {\n            on_complete.value()();\n        }\n\n        return ParseResult::Ok;\n    }\n\n\n    SubParser::SubParser(Runner* r)\n        : runner(r)\n    {\n    }\n\n\n    ParseResult\n    SubParser::OnComplete(CompleteFunction com)\n    {\n        ParserBase::OnComplete(com);\n        return ParseArgs(runner);\n    }\n\n\n    Parser::Parser(const std::string& d)\n        : description(d)\n        , printer(std::make_shared<ConsolePrinter>())\n    {\n        AddArgument(\"-h\", std::make_shared<ArgumentNoValue>([this](Runner*) {PrintHelp(); return ParseResult::Quit; }))\n            .help = \"print help\";\n    }\n\n\n    void\n    Parser::PrintHelp()\n    {\n        if (description.empty() == false)\n        {\n            printer->PrintInfo(description);\n        }\n\n        \/\/ todo(Gustav): use a string table here, add wordwrap to table\n        for (auto& a : positional_argument_list)\n        {\n            printer->PrintInfo(a.name.name + \" \" + a.argument->help);\n        }\n        for (auto& a : optional_argument_list)\n        {\n            printer->PrintInfo(a.name.name + \" \" + a.argument->help);\n        }\n    }\n\n\n    ParseResult\n    Parser::ParseArgs(const Arguments& args)\n    {\n        auto reader = ArgumentReader{ args };\n        auto runner = Runner{ &reader, printer };\n        return ParserBase::ParseArgs(&runner);\n    }\n\n\n    int\n    ParseFromMain(Parser* parser, int argc, char* argv[])\n    {\n        const auto args = Arguments::Extract(argc, argv);\n        const auto res = parser->ParseArgs(args);\n        return ReturnValue(res);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"musictimersliderwidget.h\"\n#include \"musicuiobject.h\"\n\n#include <QLabel>\n#include <QSlider>\n\nMusicTimerSliderWidget::MusicTimerSliderWidget(QWidget *parent)\n    : QWidget(parent)\n{\n    setGeometry(0, 0, 376, 40);\n\n    m_label = new QLabel(this);\n    m_label->setFixedSize(35, 35);\n    m_label->setAttribute(Qt::WA_TransparentForMouseEvents, true);\n    m_label->hide();\n\n    m_slider = new QSlider(Qt::Horizontal,this);\n    m_slider->setGeometry(17, 17, 345, 10);\n    m_slider->setStyleSheet(MusicUIObject::MSliderStyle05);\n    m_slider->setCursor(QCursor(Qt::PointingHandCursor));\n\n    m_picIndex = -1;\n    m_reverse = false;\n\n}\n\nvoid MusicTimerSliderWidget::setObject(QObject *object) const\n{\n    connect(&m_timer, SIGNAL(timeout()), SLOT(timeout()));\n    connect(m_slider, SIGNAL(sliderMoved(int)), SLOT(sliderMovedAt(int)));\n    connect(m_slider, SIGNAL(sliderMoved(int)), object, SLOT(musicPlayAnyTimeAt(int)));\n}\n\nMusicTimerSliderWidget::~MusicTimerSliderWidget()\n{\n    delete m_label;\n    delete m_slider;\n}\n\nvoid MusicTimerSliderWidget::setPlayState(bool state)\n{\n    if(!state)\n    {\n        m_timer.start(200);\n        m_label->show();\n        m_label->raise();\n    }\n    else\n    {\n        m_timer.stop();\n        m_label->hide();\n    }\n}\n\nvoid MusicTimerSliderWidget::setValue(qint64 value) const\n{\n    sliderMovedAt(value);\n    m_slider->setValue(value);\n}\n\nvoid MusicTimerSliderWidget::setRange(int min, int max)\n{\n    m_duration = max;\n    m_slider->setRange(min, max);\n}\n\nvoid MusicTimerSliderWidget::sliderMovedAt(int pos) const\n{\n    m_label->move(5 + ceil(pos * 338 \/ m_duration), 5);\n}\n\nvoid MusicTimerSliderWidget::timeout()\n{\n    if(!m_reverse)\n    {\n        if(++m_picIndex == 6)\n        {\n            m_reverse = true;\n        }\n    }\n    else\n    {\n        if(--m_picIndex == 0)\n        {\n            m_reverse = false;\n        }\n    }\n    m_label->setPixmap(QPixmap(\":\/\/slidergif\/\" + QString::number(m_picIndex)));\n}\n\nvoid MusicTimerSliderWidget::setSliderStyleByType(int type)\n{\n    QString rgba1 = \"rgb(231, 80, 229)\", rgba2 = \"rgb(7, 208, 255)\";\n    switch(type)\n    {\n        case 1: rgba1 = \"rgb(232, 202, 189)\"; rgba2 = \"rgb(191, 252, 198)\"; break;\n        case 2: rgba1 = \"rgb(255, 179, 249)\"; rgba2 = \"rgb(247, 246, 200)\"; break;\n        case 3: rgba1 = \"rgb(122, 246, 231)\"; rgba2 = \"rgb(244, 247, 191)\"; break;\n        case 4: rgba1 = \"rgb(213, 203, 255)\"; rgba2 = \"rgb(153, 236, 255)\"; break;\n    }\n    QString prefix = \"QSlider::sub-page:Horizontal{background-color:qlineargradient(\"\n                     \"spread:pad,x1:0,y1:0,x2:1,y2:0,stop:0 \" + rgba1 + \", stop:1 \" + rgba2 + \");}\";\n    m_slider->setStyleSheet(MusicUIObject::MSliderStyle05 + prefix);\n}\n<commit_msg>update movie label position error when the song not exist[412596]<commit_after>#include \"musictimersliderwidget.h\"\n#include \"musicuiobject.h\"\n\n#include <QLabel>\n#include <QSlider>\n\nMusicTimerSliderWidget::MusicTimerSliderWidget(QWidget *parent)\n    : QWidget(parent)\n{\n    setGeometry(0, 0, 376, 40);\n\n    m_label = new QLabel(this);\n    m_label->move(5, 5);\n    m_label->setFixedSize(35, 35);\n    m_label->setAttribute(Qt::WA_TransparentForMouseEvents, true);\n    m_label->hide();\n\n    m_slider = new QSlider(Qt::Horizontal,this);\n    m_slider->setGeometry(17, 17, 345, 10);\n    m_slider->setStyleSheet(MusicUIObject::MSliderStyle05);\n    m_slider->setCursor(QCursor(Qt::PointingHandCursor));\n\n    m_picIndex = -1;\n    m_reverse = false;\n\n}\n\nvoid MusicTimerSliderWidget::setObject(QObject *object) const\n{\n    connect(&m_timer, SIGNAL(timeout()), SLOT(timeout()));\n    connect(m_slider, SIGNAL(sliderMoved(int)), SLOT(sliderMovedAt(int)));\n    connect(m_slider, SIGNAL(sliderMoved(int)), object, SLOT(musicPlayAnyTimeAt(int)));\n}\n\nMusicTimerSliderWidget::~MusicTimerSliderWidget()\n{\n    delete m_label;\n    delete m_slider;\n}\n\nvoid MusicTimerSliderWidget::setPlayState(bool state)\n{\n    if(!state)\n    {\n        m_timer.start(200);\n        m_label->show();\n        m_label->raise();\n    }\n    else\n    {\n        m_timer.stop();\n        m_label->hide();\n    }\n}\n\nvoid MusicTimerSliderWidget::setValue(qint64 value) const\n{\n    sliderMovedAt(value);\n    m_slider->setValue(value);\n}\n\nvoid MusicTimerSliderWidget::setRange(int min, int max)\n{\n    m_duration = max;\n    m_slider->setRange(min, max);\n}\n\nvoid MusicTimerSliderWidget::sliderMovedAt(int pos) const\n{\n    m_label->move(5 + ceil(pos * 338 \/ m_duration), 5);\n}\n\nvoid MusicTimerSliderWidget::timeout()\n{\n    if(!m_reverse)\n    {\n        if(++m_picIndex == 6)\n        {\n            m_reverse = true;\n        }\n    }\n    else\n    {\n        if(--m_picIndex == 0)\n        {\n            m_reverse = false;\n        }\n    }\n    m_label->setPixmap(QPixmap(\":\/\/slidergif\/\" + QString::number(m_picIndex)));\n}\n\nvoid MusicTimerSliderWidget::setSliderStyleByType(int type)\n{\n    QString rgba1 = \"rgb(231, 80, 229)\", rgba2 = \"rgb(7, 208, 255)\";\n    switch(type)\n    {\n        case 1: rgba1 = \"rgb(232, 202, 189)\"; rgba2 = \"rgb(191, 252, 198)\"; break;\n        case 2: rgba1 = \"rgb(255, 179, 249)\"; rgba2 = \"rgb(247, 246, 200)\"; break;\n        case 3: rgba1 = \"rgb(122, 246, 231)\"; rgba2 = \"rgb(244, 247, 191)\"; break;\n        case 4: rgba1 = \"rgb(213, 203, 255)\"; rgba2 = \"rgb(153, 236, 255)\"; break;\n    }\n    QString prefix = \"QSlider::sub-page:Horizontal{background-color:qlineargradient(\"\n                     \"spread:pad,x1:0,y1:0,x2:1,y2:0,stop:0 \" + rgba1 + \", stop:1 \" + rgba2 + \");}\";\n    m_slider->setStyleSheet(MusicUIObject::MSliderStyle05 + prefix);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\n * \n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2006 Artem Pavlenko\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA\n *\n *****************************************************************************\/\n\n\/\/$Id: graphics.hpp 39 2005-04-10 20:39:53Z pavlenko $\n\n#ifndef GRAPHICS_HPP\n#define GRAPHICS_HPP\n\n#include <cmath>\n#include <string>\n#include <cassert>\n#include \"color.hpp\"\n#include \"gamma.hpp\"\n#include \"image_data.hpp\"\n#include \"envelope.hpp\"\n\nnamespace mapnik\n{\n    class MAPNIK_DECL Image32\n    {\n    private:\n\tunsigned width_;\n\tunsigned height_;\n\tColor background_;\n\tImageData32 data_;\n    public:\n\tImage32(int width,int height);\n\tImage32(const Image32& rhs);\n\t~Image32();\n\tvoid setBackground(const Color& background);\n\tconst Color& getBackground() const;     \n\tconst ImageData32& data() const;\n\tinline ImageData32& data() {\n\t    return data_;\n\t}\n\tinline const unsigned char* raw_data() const\n\t{\n\t    return data_.getBytes();\n\t}\n\t\n\tinline unsigned char* raw_data()\n\t{\n\t    return data_.getBytes();\n\t}\n\t\n\tvoid saveToFile(const std::string& file,const std::string& format=\"auto\"); \n    private:\n\n\tinline bool checkBounds(unsigned x, unsigned y) const\n\t{\n\t    return (x < width_ && y < height_);\n\t}\n\n    public:\n\tinline void setPixel(int x,int y,unsigned int rgba)\n\t{\n\t    if (checkBounds(x,y))\n\t    {\n\t\tdata_(x,y)=rgba;\n\t    }\n\t}\n\tinline void blendPixel(int x,int y,unsigned int rgba1,int t)\n\t{\n\t    if (checkBounds(x,y))\n\t    {\n\t\tunsigned rgba0 = data_(x,y);\t\n\t\tunsigned a1 = t;\/\/(rgba1 >> 24) & 0xff;\n\t\tif (a1 == 0) return;\n\t\tunsigned r1 = rgba1 & 0xff;\n\t\tunsigned g1 = (rgba1 >> 8 ) & 0xff;\n\t\tunsigned b1 = (rgba1 >> 16) & 0xff;\n\t\t\n\t\tunsigned a0 = (rgba0 >> 24) & 0xff;\n\t\tunsigned r0 = (rgba0 & 0xff) * a0;\n\t\tunsigned g0 = ((rgba0 >> 8 ) & 0xff) * a0;\n\t\tunsigned b0 = ((rgba0 >> 16) & 0xff) * a0;\n\t\t\n\t\t\n\t\ta0 = ((a1 + a0) << 8) - a0*a1;\n\t\t\n\t\tr0 = ((((r1 << 8) - r0) * a1 + (r0 << 8)) \/ a0);\n\t\tg0 = ((((g1 << 8) - g0) * a1 + (g0 << 8)) \/ a0);\n\t\tb0 = ((((b1 << 8) - b0) * a1 + (b0 << 8)) \/ a0);\n\t\ta0 = a0 >> 8;\n\t\tdata_(x,y)= (a0 << 24)| (b0 << 16) |  (g0 << 8) | (r0) ;\n\t    }\n\t}\n\n\tinline unsigned width() const\n\t{\n\t    return width_;\n\t}\n\t\n\tinline unsigned height() const\n\t{\n\t    return height_;\n\t}\n\n\tinline void set_rectangle(int x0,int y0,ImageData32 const& data)\n\t{\n\t    Envelope<int> ext0(0,0,width_,height_);   \n\t    Envelope<int> ext1(x0,y0,x0+data.width(),y0+data.height());\n\t    \n\t    if (ext0.intersects(ext1))\n\t    {\t\n\t\tEnvelope<int> box = ext0.intersect(ext1);\n\t\tfor (int y = box.miny(); y < box.maxy(); ++y)\n\t\t{\n\t\t    for (int x = box.minx(); x < box.maxx(); ++x)\n\t\t    {\n\t\t\tif ((data(x-x0,y-y0) & 0xff000000)) \n\t\t\t{\n\t\t\t    data_(x,y)=data(x-x0,y-y0);\n\t\t\t}\n\t\t    }\n\t\t}   \n\t    }\n\t}\n\t\n\tinline void set_rectangle_alpha(int x0,int y0,const ImageData32& data)\n\t{\n\t    Envelope<int> ext0(0,0,width_,height_);   \n\t    Envelope<int> ext1(x0,y0,x0 + data.width(),y0 + data.height());\n\t    \n\t    if (ext0.intersects(ext1))\n\t    {\t                \t\t\n\t\tEnvelope<int> box = ext0.intersect(ext1);\t\t\n\t\tfor (int y = box.miny(); y < box.maxy(); ++y)\n\t\t{\n\t\t    for (int x = box.minx(); x < box.maxx(); ++x)\n\t\t    {\n\t\t\tunsigned rgba0 = data_(x,y);\n\t\t\tunsigned rgba1 = data(x-x0,y-y0);\n\t\t    \n\t\t\tunsigned a1 = (rgba1 >> 24) & 0xff;\n\t\t\tif (a1 == 0) continue;\n\t\t\tunsigned r1 = rgba1 & 0xff;\n\t\t\tunsigned g1 = (rgba1 >> 8 ) & 0xff;\n\t\t\tunsigned b1 = (rgba1 >> 16) & 0xff;\n\t\t    \n\t\t\tunsigned a0 = (rgba0 >> 24) & 0xff;\n\t\t\tunsigned r0 = (rgba0 & 0xff) * a0;\n\t\t\tunsigned g0 = ((rgba0 >> 8 ) & 0xff) * a0;\n\t\t\tunsigned b0 = ((rgba0 >> 16) & 0xff) * a0;\n\t\t    \n\t\t    \n\t\t\ta0 = ((a1 + a0) << 8) - a0*a1;\n\t\t    \n\t\t\tr0 = ((((r1 << 8) - r0) * a1 + (r0 << 8)) \/ a0);\n\t\t\tg0 = ((((g1 << 8) - g0) * a1 + (g0 << 8)) \/ a0);\n\t\t\tb0 = ((((b1 << 8) - b0) * a1 + (b0 << 8)) \/ a0);\n\t\t\ta0 = a0 >> 8;\n\t\t\tdata_(x,y)= (a0 << 24)| (b0 << 16) |  (g0 << 8) | (r0) ;\n\t\t    }\n\t\t}\n\t    }\n\t}\n    };\n}\n#endif \/\/GRAPHICS_HPP\n<commit_msg>replaced tabs with spaces<commit_after>\/*****************************************************************************\n * \n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2006 Artem Pavlenko\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA\n *\n *****************************************************************************\/\n\n\/\/$Id: graphics.hpp 39 2005-04-10 20:39:53Z pavlenko $\n\n#ifndef GRAPHICS_HPP\n#define GRAPHICS_HPP\n\n#include <cmath>\n#include <string>\n#include <cassert>\n#include \"color.hpp\"\n#include \"gamma.hpp\"\n#include \"image_data.hpp\"\n#include \"envelope.hpp\"\n\nnamespace mapnik\n{\n    class MAPNIK_DECL Image32\n    {\n    private:\n        unsigned width_;\n        unsigned height_;\n        Color background_;\n        ImageData32 data_;\n    public:\n        Image32(int width,int height);\n        Image32(const Image32& rhs);\n        ~Image32();\n        void setBackground(const Color& background);\n        const Color& getBackground() const;     \n        const ImageData32& data() const;\n        inline ImageData32& data() {\n            return data_;\n        }\n        inline const unsigned char* raw_data() const\n        {\n            return data_.getBytes();\n        }\n\t\n        inline unsigned char* raw_data()\n        {\n            return data_.getBytes();\n        }\n\t\n        void saveToFile(const std::string& file,const std::string& format=\"auto\"); \n    private:\n\n        inline bool checkBounds(unsigned x, unsigned y) const\n        {\n            return (x < width_ && y < height_);\n        }\n\n    public:\n        inline void setPixel(int x,int y,unsigned int rgba)\n        {\n            if (checkBounds(x,y))\n            {\n                data_(x,y)=rgba;\n            }\n        }\n        inline void blendPixel(int x,int y,unsigned int rgba1,int t)\n        {\n            if (checkBounds(x,y))\n            {\n                unsigned rgba0 = data_(x,y);\t\n                unsigned a1 = t;\/\/(rgba1 >> 24) & 0xff;\n                if (a1 == 0) return;\n                unsigned r1 = rgba1 & 0xff;\n                unsigned g1 = (rgba1 >> 8 ) & 0xff;\n                unsigned b1 = (rgba1 >> 16) & 0xff;\n\t\t\n                unsigned a0 = (rgba0 >> 24) & 0xff;\n                unsigned r0 = (rgba0 & 0xff) * a0;\n                unsigned g0 = ((rgba0 >> 8 ) & 0xff) * a0;\n                unsigned b0 = ((rgba0 >> 16) & 0xff) * a0;\n\t\t\n\t\t\n                a0 = ((a1 + a0) << 8) - a0*a1;\n\t\t\n                r0 = ((((r1 << 8) - r0) * a1 + (r0 << 8)) \/ a0);\n                g0 = ((((g1 << 8) - g0) * a1 + (g0 << 8)) \/ a0);\n                b0 = ((((b1 << 8) - b0) * a1 + (b0 << 8)) \/ a0);\n                a0 = a0 >> 8;\n                data_(x,y)= (a0 << 24)| (b0 << 16) |  (g0 << 8) | (r0) ;\n            }\n        }\n\n        inline unsigned width() const\n        {\n            return width_;\n        }\n\t\n        inline unsigned height() const\n        {\n            return height_;\n        }\n\n        inline void set_rectangle(int x0,int y0,ImageData32 const& data)\n        {\n            Envelope<int> ext0(0,0,width_,height_);   \n            Envelope<int> ext1(x0,y0,x0+data.width(),y0+data.height());\n\t    \n            if (ext0.intersects(ext1))\n            {\t\n                Envelope<int> box = ext0.intersect(ext1);\n                for (int y = box.miny(); y < box.maxy(); ++y)\n                {\n                    for (int x = box.minx(); x < box.maxx(); ++x)\n                    {\n                        if ((data(x-x0,y-y0) & 0xff000000)) \n                        {\n                            data_(x,y)=data(x-x0,y-y0);\n                        }\n                    }\n                }   \n            }\n        }\n\t\n        inline void set_rectangle_alpha(int x0,int y0,const ImageData32& data)\n        {\n            Envelope<int> ext0(0,0,width_,height_);   \n            Envelope<int> ext1(x0,y0,x0 + data.width(),y0 + data.height());\n\t    \n            if (ext0.intersects(ext1))\n            {\t                \t\t\n                Envelope<int> box = ext0.intersect(ext1);\t\t\n                for (int y = box.miny(); y < box.maxy(); ++y)\n                {\n                    for (int x = box.minx(); x < box.maxx(); ++x)\n                    {\n                        unsigned rgba0 = data_(x,y);\n                        unsigned rgba1 = data(x-x0,y-y0);\n\t\t    \n                        unsigned a1 = (rgba1 >> 24) & 0xff;\n                        if (a1 == 0) continue;\n                        unsigned r1 = rgba1 & 0xff;\n                        unsigned g1 = (rgba1 >> 8 ) & 0xff;\n                        unsigned b1 = (rgba1 >> 16) & 0xff;\n\t\t    \n                        unsigned a0 = (rgba0 >> 24) & 0xff;\n                        unsigned r0 = (rgba0 & 0xff) * a0;\n                        unsigned g0 = ((rgba0 >> 8 ) & 0xff) * a0;\n                        unsigned b0 = ((rgba0 >> 16) & 0xff) * a0;\n\t\t    \n\t\t    \n                        a0 = ((a1 + a0) << 8) - a0*a1;\n\t\t    \n                        r0 = ((((r1 << 8) - r0) * a1 + (r0 << 8)) \/ a0);\n                        g0 = ((((g1 << 8) - g0) * a1 + (g0 << 8)) \/ a0);\n                        b0 = ((((b1 << 8) - b0) * a1 + (b0 << 8)) \/ a0);\n                        a0 = a0 >> 8;\n                        data_(x,y)= (a0 << 24)| (b0 << 16) |  (g0 << 8) | (r0) ;\n                    }\n                }\n            }\n        }\n    };\n}\n#endif \/\/GRAPHICS_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/\/  (C) Copyright Gennadiy Rozental 2011-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: 74248 $\n\/\/\n\/\/  Description : FPC tolerance manipulator implementation\n\/\/ ***************************************************************************\n\n#ifndef BOOST_TEST_TOOLS_DETAIL_TOLERANCE_MANIP_HPP_012705GER\n#define BOOST_TEST_TOOLS_DETAIL_TOLERANCE_MANIP_HPP_012705GER\n\n\/\/ Boost Test\n#include <boost\/test\/tools\/detail\/fwd.hpp>\n#include <boost\/test\/tools\/detail\/indirections.hpp>\n\n#include <boost\/test\/tools\/fpc_tolerance.hpp>\n#include <boost\/test\/tools\/floating_point_comparison.hpp>\n\n#include <boost\/test\/detail\/suppress_warnings.hpp>\n\n\/\/____________________________________________________________________________\/\/\n\nnamespace boost {\nnamespace test_tools {\nnamespace tt_detail {\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************           fpc tolerance manipulator          ************** \/\/\n\/\/ ************************************************************************** \/\/\n\ntemplate<typename FPT>\nstruct tolerance_manip {\n    explicit tolerance_manip( FPT const & tol ) : m_value( tol ) {}\n\n    FPT m_value;\n};\n\n\/\/____________________________________________________________________________\/\/\n\nstruct tolerance_manip_delay {};\n\ntemplate<typename FPT>\ninline tolerance_manip<FPT>\noperator%( FPT v, tolerance_manip_delay const& )\n{\n    BOOST_STATIC_ASSERT_MSG( (fpc::tolerance_based<FPT>::value), \n                             \"tolerance only for floating points\" );\n\n    return tolerance_manip<FPT>( static_cast<FPT>(v * 0.01) ); \n}\n\n\/\/____________________________________________________________________________\/\/\n\ntemplate<typename E, typename FPT>\ninline assertion_result\noperator<<(assertion_evaluate_t<E> const& ae, tolerance_manip<FPT> const& tol)\n{\n    local_fpc_tolerance<FPT> lt( tol.m_value );\n\n    return ae.m_e.evaluate();\n}\n\n\/\/____________________________________________________________________________\/\/\n\ntemplate<typename FPT>\ninline int\noperator<<( unit_test::lazy_ostream const&, tolerance_manip<FPT> const& )   { return 0; }\n\n\/\/____________________________________________________________________________\/\/\n\ntemplate<typename FPT>\ninline check_type\noperator<<( assertion_type const& \/*at*\/, tolerance_manip<FPT> const& )         { return CHECK_BUILT_ASSERTION; }\n\n\/\/____________________________________________________________________________\/\/\n\n} \/\/ namespace tt_detail\n\ntemplate<typename FPT>\ninline tt_detail::tolerance_manip<FPT>\ntolerance( FPT v )\n{\n    BOOST_STATIC_ASSERT_MSG( (fpc::tolerance_based<FPT>::value), \n                             \"tolerance only for floating points\" );\n\n    return tt_detail::tolerance_manip<FPT>( v );\n}\n\n\/\/____________________________________________________________________________\/\/\n\ntemplate<typename FPT>\ninline tt_detail::tolerance_manip<FPT>\ntolerance( fpc::percent_tolerance_t<FPT> v )\n{\n    BOOST_STATIC_ASSERT_MSG( (fpc::tolerance_based<FPT>::value), \n                             \"tolerance only for floating points\" );\n\n    return tt_detail::tolerance_manip<FPT>( static_cast<FPT>(v.m_value * 0.01) );\n}\n\n\/\/____________________________________________________________________________\/\/\n\ninline tt_detail::tolerance_manip_delay\ntolerance()\n{\n    return tt_detail::tolerance_manip_delay();\n}\n\n\/\/____________________________________________________________________________\/\/\n\n} \/\/ namespace test_tools\n} \/\/ namespace boost\n\n#include <boost\/test\/detail\/enable_warnings.hpp>\n\n#endif \/\/ BOOST_TEST_TOOLS_DETAIL_TOLERANCE_MANIP_HPP_012705GER\n<commit_msg>doxygen on floating point manipulators<commit_after>\/\/  (C) Copyright Gennadiy Rozental 2011-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\n\/\/! @brief Floating point comparison tolerance manipulators\n\/\/! \n\/\/! This file defines several manipulators for floating point comparison. These\n\/\/! manipulators are intended to be used with BOOST_TEST.\n\/\/ ***************************************************************************\n\n#ifndef BOOST_TEST_TOOLS_DETAIL_TOLERANCE_MANIP_HPP_012705GER\n#define BOOST_TEST_TOOLS_DETAIL_TOLERANCE_MANIP_HPP_012705GER\n\n\/\/ Boost Test\n#include <boost\/test\/tools\/detail\/fwd.hpp>\n#include <boost\/test\/tools\/detail\/indirections.hpp>\n\n#include <boost\/test\/tools\/fpc_tolerance.hpp>\n#include <boost\/test\/tools\/floating_point_comparison.hpp>\n\n#include <boost\/test\/detail\/suppress_warnings.hpp>\n\n\/\/____________________________________________________________________________\/\/\n\nnamespace boost {\nnamespace test_tools {\nnamespace tt_detail {\n\n\/\/ ************************************************************************** \/\/\n\/\/ **************           fpc tolerance manipulator          ************** \/\/\n\/\/ ************************************************************************** \/\/\n\ntemplate<typename FPT>\nstruct tolerance_manip {\n    explicit tolerance_manip( FPT const & tol ) : m_value( tol ) {}\n\n    FPT m_value;\n};\n\n\/\/____________________________________________________________________________\/\/\n\nstruct tolerance_manip_delay {};\n\ntemplate<typename FPT>\ninline tolerance_manip<FPT>\noperator%( FPT v, tolerance_manip_delay const& )\n{\n    BOOST_STATIC_ASSERT_MSG( (fpc::tolerance_based<FPT>::value), \n                             \"tolerance only for floating points\" );\n\n    return tolerance_manip<FPT>( static_cast<FPT>(v * 0.01) ); \n}\n\n\/\/____________________________________________________________________________\/\/\n\ntemplate<typename E, typename FPT>\ninline assertion_result\noperator<<(assertion_evaluate_t<E> const& ae, tolerance_manip<FPT> const& tol)\n{\n    local_fpc_tolerance<FPT> lt( tol.m_value );\n\n    return ae.m_e.evaluate();\n}\n\n\/\/____________________________________________________________________________\/\/\n\ntemplate<typename FPT>\ninline int\noperator<<( unit_test::lazy_ostream const&, tolerance_manip<FPT> const& )   { return 0; }\n\n\/\/____________________________________________________________________________\/\/\n\ntemplate<typename FPT>\ninline check_type\noperator<<( assertion_type const& \/*at*\/, tolerance_manip<FPT> const& )         { return CHECK_BUILT_ASSERTION; }\n\n\/\/____________________________________________________________________________\/\/\n\n} \/\/ namespace tt_detail\n\n\n\/*! Tolerance manipulator\n *\n * These functions return a manipulator that can be used in conjunction with BOOST_TEST\n * in order to specify the tolerance with which floating point comparisons are made.\n *\/\ntemplate<typename FPT>\ninline tt_detail::tolerance_manip<FPT>\ntolerance( FPT v )\n{\n    BOOST_STATIC_ASSERT_MSG( (fpc::tolerance_based<FPT>::value), \n                             \"tolerance only for floating points\" );\n\n    return tt_detail::tolerance_manip<FPT>( v );\n}\n\n\/\/____________________________________________________________________________\/\/\n\n\/\/! @overload tolerance( FPT v )\ntemplate<typename FPT>\ninline tt_detail::tolerance_manip<FPT>\ntolerance( fpc::percent_tolerance_t<FPT> v )\n{\n    BOOST_STATIC_ASSERT_MSG( (fpc::tolerance_based<FPT>::value), \n                             \"tolerance only for floating points\" );\n\n    return tt_detail::tolerance_manip<FPT>( static_cast<FPT>(v.m_value * 0.01) );\n}\n\n\/\/____________________________________________________________________________\/\/\n\n\/\/! @overload tolerance( FPT v )\ninline tt_detail::tolerance_manip_delay\ntolerance()\n{\n    return tt_detail::tolerance_manip_delay();\n}\n\n\/\/____________________________________________________________________________\/\/\n\n} \/\/ namespace test_tools\n} \/\/ namespace boost\n\n#include <boost\/test\/detail\/enable_warnings.hpp>\n\n#endif \/\/ BOOST_TEST_TOOLS_DETAIL_TOLERANCE_MANIP_HPP_012705GER\n<|endoftext|>"}
{"text":"<commit_before>\/\/ This file is distributed under the MIT license.\n\/\/ See the LICENSE file for details.\n\n#include <cmath>\n\nnamespace MATH_NAMESPACE\n{\nnamespace simd\n{\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ float4 members\n\/\/\n\nVSNRAY_FORCE_INLINE float4::basic_float(float x, float y, float z, float w)\n{\n    \/\/ TODO: check if this can be done in the initializer list\n    VSNRAY_ALIGN(16) float data[4] = { x, y, z, w };\n    value = vld1q_f32(data);\n}\n\nVSNRAY_FORCE_INLINE float4::basic_float(float const v[4])\n    : value(vld1q_f32(v))\n{\n}\n\nVSNRAY_FORCE_INLINE float4::basic_float(float s)\n    : value(vdupq_n_f32(s))\n{\n}\n\nVSNRAY_FORCE_INLINE float4::basic_float(int32x4_t const& i)\n    : value(vcvtq_f32_s32(i))\n{\n}\n\nVSNRAY_FORCE_INLINE float4::basic_float(float32x4_t const& v)\n    : value(v)\n{\n}\n\nVSNRAY_FORCE_INLINE float4::operator float32x4_t() const\n{\n    return value;\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ Bitwise cast\n\/\/\n\nVSNRAY_FORCE_INLINE int4 reinterpret_as_int(float4 const& a)\n{\n    return vreinterpretq_s32_f32(a);\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ Static cast\n\/\/\n\nVSNRAY_FORCE_INLINE int4 convert_to_int(float4 const& a)\n{\n    return vcvtq_s32_f32(a);\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ select intrinsic\n\/\/\n\nVSNRAY_FORCE_INLINE float4 select(mask4 const& m, float4 const& a, float4 const& b)\n{\n    return vbslq_f32(m.i, a, b);\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ Load \/ store \/ get\n\/\/\n\nVSNRAY_FORCE_INLINE float4 load(float const src[4])\n{\n    return vld1q_f32(src);\n}\n\nVSNRAY_FORCE_INLINE void store(float dst[4], float4 const& v)\n{\n    vst1q_f32(dst, v);\n}\n\ntemplate <size_t I>\nVSNRAY_FORCE_INLINE float& get(float4& v)\n{\n    static_assert(I < 4, \"Index out of range for SIMD vector access\");\n\n    return reinterpret_cast<float*>(&v)[I];\n}\n\ntemplate <size_t I>\nVSNRAY_FORCE_INLINE float const& get(float4 const& v)\n{\n    static_assert(I < 4, \"Index out of range for SIMD vector access\");\n\n    return reinterpret_cast<float const*>(&v)[I];\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ Transposition\n\/\/\n\ntemplate <int U0, int U1, int V2, int V3>\nVSNRAY_FORCE_INLINE float4 shuffle(float4 const& u, float4 const& v)\n{\n    \/\/ TODO: are dedicated implementations using\n    \/\/ vget_{low|high}, vcombine, vzip, etc. faster?\n    auto uu = reinterpret_cast<float const*>(&u);\n    auto vv = reinterpret_cast<float const*>(&v);\n\n    return float4(uu[U0], uu[U1], vv[V2], vv[V3]);\n}\n\ntemplate <int V0, int V1, int V2, int V3>\nVSNRAY_FORCE_INLINE float4 shuffle(float4 const& v)\n{\n    \/\/ TODO: are dedicated implementations using\n    \/\/ vget_{low|high}, vcombine, vzip, etc. faster?\n    auto vv = reinterpret_cast<float const*>(&v);\n\n    return float4(vv[V0], vv[V1], vv[V2], vv[V3]);\n}\n\nVSNRAY_FORCE_INLINE float4 move_lo(float4 const& u, float4 const& v)\n{\n    \/\/ r1 := u1, r2 := u2, r3 := v1, r4 := v2\n    auto ulo = vget_low_f32(u);\n    auto vlo = vget_low_f32(v);\n    return vcombine_f32(ulo, vlo);\n}\n\nVSNRAY_FORCE_INLINE float4 move_hi(float4 const& u, float4 const& v)\n{\n    \/\/ r1 := v3, r2 := v4, r3 := u3, r4 := u4\n    auto uhi = vget_high_f32(u);\n    auto vhi = vget_high_f32(v);\n    return vcombine_f32(vhi, uhi);\n}\n\nVSNRAY_FORCE_INLINE float4 interleave_lo(float4 const& u, float4 const& v)\n{\n    \/\/ r1 := u1, r2 := v1, r3 := u2, r4 := v2\n    auto ulo = vget_low_f32(u);\n    auto vlo = vget_low_f32(v);\n    auto zip = vzip_f32(ulo, vlo);\n    return vcombine_f32(zip.val[0], zip.val[1]);\n}\n\nVSNRAY_FORCE_INLINE float4 interleave_hi(float4 const& u, float4 const& v)\n{\n    \/\/ r1 := u3, r2 := v3, r3 := u4, r4 := v4\n    auto uhi = vget_high_f32(u);\n    auto vhi = vget_high_f32(v);\n    auto zip = vzip_f32(uhi, vhi);\n    return vcombine_f32(zip.val[0], zip.val[1]);\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ Basic arithmetics\n\/\/\n\nVSNRAY_FORCE_INLINE float4 operator+(float4 const& v)\n{\n    return vaddq_f32(vdupq_n_f32(0.0f), v);\n}\n\nVSNRAY_FORCE_INLINE float4 operator-(float4 const& v)\n{\n    return vnegq_f32(v);\n}\n\nVSNRAY_FORCE_INLINE float4 operator+(float4 const& u, float4 const& v)\n{\n    return vaddq_f32(u, v);\n}\n\nVSNRAY_FORCE_INLINE float4 operator-(float4 const& u, float4 const& v)\n{\n    return vsubq_f32(u, v);\n}\n\nVSNRAY_FORCE_INLINE float4 operator*(float4 const& u, float4 const& v)\n{\n    return vmulq_f32(u, v);\n}\n\nVSNRAY_FORCE_INLINE float4 operator\/(float4 const& u, float4 const& v)\n{\n    \/\/ NEON has no division instruction, so multiply by reciprocal\n    \/\/ and refine with a couple of Newton-Raphson steps\n    float32x4_t rcp = vrecpeq_f32(v);\n    \/\/ vrecpsq_f32 conveniently performs a Newton-Raphson step\n    rcp = vmulq_f32(vrecpsq_f32(v, rcp), rcp);\n    rcp = vmulq_f32(vrecpsq_f32(v, rcp), rcp);\n    return vmulq_f32(u, rcp);\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ Bitwise operations\n\/\/\n\nVSNRAY_FORCE_INLINE float4 operator&(float4 const& u, float4 const& v)\n{\n    int32x4_t ui = vreinterpretq_s32_f32(u);\n    int32x4_t vi = vreinterpretq_s32_f32(v);\n    int32x4_t ri = vandq_s32(ui, vi);\n    return vreinterpretq_f32_s32(ri);\n}\n\nVSNRAY_FORCE_INLINE float4 operator|(float4 const& u, float4 const& v)\n{\n    int32x4_t ui = vreinterpretq_s32_f32(u);\n    int32x4_t vi = vreinterpretq_s32_f32(v);\n    int32x4_t ri = vorrq_s32(ui, vi);\n    return vreinterpretq_f32_s32(ri);\n}\n\nVSNRAY_FORCE_INLINE float4 operator^(float4 const& u, float4 const& v)\n{\n    int32x4_t ui = vreinterpretq_s32_f32(u);\n    int32x4_t vi = vreinterpretq_s32_f32(v);\n    int32x4_t ri = veorq_s32(ui, vi);\n    return vreinterpretq_f32_s32(ri);\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ Logical operations\n\/\/\n\nVSNRAY_FORCE_INLINE float4 operator&&(float4 const& u, float4 const& v)\n{\n    int32x4_t ui = vreinterpretq_s32_f32(u);\n    int32x4_t vi = vreinterpretq_s32_f32(v);\n    int32x4_t ri = vandq_s32(ui, vi);\n    return vreinterpretq_f32_s32(ri);\n}\n\nVSNRAY_FORCE_INLINE float4 operator||(float4 const& u, float4 const& v)\n{\n    int32x4_t ui = vreinterpretq_s32_f32(u);\n    int32x4_t vi = vreinterpretq_s32_f32(v);\n    int32x4_t ri = vorrq_s32(ui, vi);\n    return vreinterpretq_f32_s32(ri);\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ Comparisons\n\/\/\n\nVSNRAY_FORCE_INLINE mask4 operator<(float4 const& u, float4 const& v)\n{\n    return vcltq_f32(u, v);\n}\n\nVSNRAY_FORCE_INLINE mask4 operator>(float4 const& u, float4 const& v)\n{\n    return vcgtq_f32(u, v);\n}\n\nVSNRAY_FORCE_INLINE mask4 operator<=(float4 const& u, float4 const& v)\n{\n    return vcleq_f32(u, v);\n}\n\nVSNRAY_FORCE_INLINE mask4 operator>=(float4 const& u, float4 const& v)\n{\n    return vcgeq_f32(u, v);\n}\n\nVSNRAY_FORCE_INLINE mask4 operator==(float4 const& u, float4 const& v)\n{\n    return vceqq_f32(u, v);\n}\n\nVSNRAY_FORCE_INLINE mask4 operator!=(float4 const& u, float4 const& v)\n{\n    return vmvnq_u32(vceqq_f32(u, v));\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ Math functions\n\/\/\n\nVSNRAY_FORCE_INLINE float4 dot(float4 const& u, float4 const& v)\n{\n}\n\nVSNRAY_FORCE_INLINE float4 min(float4 const& u, float4 const& v)\n{\n    return vminq_f32(u, v);\n}\n\nVSNRAY_FORCE_INLINE float4 max(float4 const& u, float4 const& v)\n{\n    return vmaxq_f32(u, v);\n}\n\nVSNRAY_FORCE_INLINE float4 saturate(float4 const& u)\n{\n    return vmaxq_f32(vdupq_n_f32(0.0f), vminq_f32(u, vdupq_n_f32(1.0f)));\n}\n\nVSNRAY_FORCE_INLINE float4 abs(float4 const& u)\n{\n    int4 a = vreinterpretq_s32_f32(u);\n    int4 b = vdupq_n_s32(0x7FFFFFFF);\n    return vreinterpretq_f32_s32(vandq_s32(a, b));\n}\n\nVSNRAY_FORCE_INLINE float4 ceil(float4 const& v)\n{\n    \/\/ i = trunc(v)\n    float32x4_t i = vcvtq_f32_s32(vcvtq_s32_f32(v));\n    \/\/ r = i < v ? i i + 1 : i\n    uint32x4_t t = vcltq_f32(i, v);\n    int32x4_t st = vreinterpretq_s32_u32(t); \/\/ underflow: 0xFFFFFFFF -> -1\n    float32x4_t d = vcvtq_f32_s32(st); \/\/ signed mask to float (0.0f or -1.0f)\n    float32x4_t r = vsubq_f32(i, d);\n\n    return r;\n}\n\nVSNRAY_FORCE_INLINE float4 floor(float4 const& v)\n{\n    \/\/ i = trunc(v)\n    float32x4_t i = vcvtq_f32_s32(vcvtq_s32_f32(v));\n    \/\/ r = i > v ? i - 1 : i\n    uint32x4_t t = vcgtq_f32(i, v);\n    int32x4_t st = vreinterpretq_s32_u32(t); \/\/ underflow: 0xFFFFFFFF -> -1\n    float32x4_t d = vcvtq_f32_s32(st); \/\/ signed mask to float (0.0f or -1.0f)\n    float32x4_t r = vaddq_f32(i, d);\n\n    return r;\n}\n\nVSNRAY_FORCE_INLINE float4 sqrt(float4 const& v)\n{\n    float32x4_t rsqrt = vrsqrteq_f32(v);\n    \/\/ Newton-Raphson step\n    rsqrt = vrsqrtsq_f32(v * rsqrt, rsqrt) * rsqrt;\n    \/\/ rsqrt => sqrt\n    return v * rsqrt;\n}\n\nVSNRAY_FORCE_INLINE mask4 isinf(float4 const& v)\n{\n    VSNRAY_ALIGN(16) float values[4] = {};\n    store(values, v);\n\n    return mask4(\n            std::isinf(values[0]),\n            std::isinf(values[1]),\n            std::isinf(values[2]),\n            std::isinf(values[3])\n            );\n}\n\nVSNRAY_FORCE_INLINE mask4 isnan(float4 const& v)\n{\n    return v != v;\n}\n\nVSNRAY_FORCE_INLINE mask4 isfinite(float4 const& v)\n{\n    return !(isinf(v) | isnan(v));\n}\n\n} \/\/ simd\n} \/\/ MATH_NAMESPACE\n<commit_msg>Implement dot() with ARM NEON<commit_after>\/\/ This file is distributed under the MIT license.\n\/\/ See the LICENSE file for details.\n\n#include <cmath>\n\nnamespace MATH_NAMESPACE\n{\nnamespace simd\n{\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ float4 members\n\/\/\n\nVSNRAY_FORCE_INLINE float4::basic_float(float x, float y, float z, float w)\n{\n    \/\/ TODO: check if this can be done in the initializer list\n    VSNRAY_ALIGN(16) float data[4] = { x, y, z, w };\n    value = vld1q_f32(data);\n}\n\nVSNRAY_FORCE_INLINE float4::basic_float(float const v[4])\n    : value(vld1q_f32(v))\n{\n}\n\nVSNRAY_FORCE_INLINE float4::basic_float(float s)\n    : value(vdupq_n_f32(s))\n{\n}\n\nVSNRAY_FORCE_INLINE float4::basic_float(int32x4_t const& i)\n    : value(vcvtq_f32_s32(i))\n{\n}\n\nVSNRAY_FORCE_INLINE float4::basic_float(float32x4_t const& v)\n    : value(v)\n{\n}\n\nVSNRAY_FORCE_INLINE float4::operator float32x4_t() const\n{\n    return value;\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ Bitwise cast\n\/\/\n\nVSNRAY_FORCE_INLINE int4 reinterpret_as_int(float4 const& a)\n{\n    return vreinterpretq_s32_f32(a);\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ Static cast\n\/\/\n\nVSNRAY_FORCE_INLINE int4 convert_to_int(float4 const& a)\n{\n    return vcvtq_s32_f32(a);\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ select intrinsic\n\/\/\n\nVSNRAY_FORCE_INLINE float4 select(mask4 const& m, float4 const& a, float4 const& b)\n{\n    return vbslq_f32(m.i, a, b);\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ Load \/ store \/ get\n\/\/\n\nVSNRAY_FORCE_INLINE float4 load(float const src[4])\n{\n    return vld1q_f32(src);\n}\n\nVSNRAY_FORCE_INLINE void store(float dst[4], float4 const& v)\n{\n    vst1q_f32(dst, v);\n}\n\ntemplate <size_t I>\nVSNRAY_FORCE_INLINE float& get(float4& v)\n{\n    static_assert(I < 4, \"Index out of range for SIMD vector access\");\n\n    return reinterpret_cast<float*>(&v)[I];\n}\n\ntemplate <size_t I>\nVSNRAY_FORCE_INLINE float const& get(float4 const& v)\n{\n    static_assert(I < 4, \"Index out of range for SIMD vector access\");\n\n    return reinterpret_cast<float const*>(&v)[I];\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ Transposition\n\/\/\n\ntemplate <int U0, int U1, int V2, int V3>\nVSNRAY_FORCE_INLINE float4 shuffle(float4 const& u, float4 const& v)\n{\n    \/\/ TODO: are dedicated implementations using\n    \/\/ vget_{low|high}, vcombine, vzip, etc. faster?\n    auto uu = reinterpret_cast<float const*>(&u);\n    auto vv = reinterpret_cast<float const*>(&v);\n\n    return float4(uu[U0], uu[U1], vv[V2], vv[V3]);\n}\n\ntemplate <int V0, int V1, int V2, int V3>\nVSNRAY_FORCE_INLINE float4 shuffle(float4 const& v)\n{\n    \/\/ TODO: are dedicated implementations using\n    \/\/ vget_{low|high}, vcombine, vzip, etc. faster?\n    auto vv = reinterpret_cast<float const*>(&v);\n\n    return float4(vv[V0], vv[V1], vv[V2], vv[V3]);\n}\n\nVSNRAY_FORCE_INLINE float4 move_lo(float4 const& u, float4 const& v)\n{\n    \/\/ r1 := u1, r2 := u2, r3 := v1, r4 := v2\n    auto ulo = vget_low_f32(u);\n    auto vlo = vget_low_f32(v);\n    return vcombine_f32(ulo, vlo);\n}\n\nVSNRAY_FORCE_INLINE float4 move_hi(float4 const& u, float4 const& v)\n{\n    \/\/ r1 := v3, r2 := v4, r3 := u3, r4 := u4\n    auto uhi = vget_high_f32(u);\n    auto vhi = vget_high_f32(v);\n    return vcombine_f32(vhi, uhi);\n}\n\nVSNRAY_FORCE_INLINE float4 interleave_lo(float4 const& u, float4 const& v)\n{\n    \/\/ r1 := u1, r2 := v1, r3 := u2, r4 := v2\n    auto ulo = vget_low_f32(u);\n    auto vlo = vget_low_f32(v);\n    auto zip = vzip_f32(ulo, vlo);\n    return vcombine_f32(zip.val[0], zip.val[1]);\n}\n\nVSNRAY_FORCE_INLINE float4 interleave_hi(float4 const& u, float4 const& v)\n{\n    \/\/ r1 := u3, r2 := v3, r3 := u4, r4 := v4\n    auto uhi = vget_high_f32(u);\n    auto vhi = vget_high_f32(v);\n    auto zip = vzip_f32(uhi, vhi);\n    return vcombine_f32(zip.val[0], zip.val[1]);\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ Basic arithmetics\n\/\/\n\nVSNRAY_FORCE_INLINE float4 operator+(float4 const& v)\n{\n    return vaddq_f32(vdupq_n_f32(0.0f), v);\n}\n\nVSNRAY_FORCE_INLINE float4 operator-(float4 const& v)\n{\n    return vnegq_f32(v);\n}\n\nVSNRAY_FORCE_INLINE float4 operator+(float4 const& u, float4 const& v)\n{\n    return vaddq_f32(u, v);\n}\n\nVSNRAY_FORCE_INLINE float4 operator-(float4 const& u, float4 const& v)\n{\n    return vsubq_f32(u, v);\n}\n\nVSNRAY_FORCE_INLINE float4 operator*(float4 const& u, float4 const& v)\n{\n    return vmulq_f32(u, v);\n}\n\nVSNRAY_FORCE_INLINE float4 operator\/(float4 const& u, float4 const& v)\n{\n    \/\/ NEON has no division instruction, so multiply by reciprocal\n    \/\/ and refine with a couple of Newton-Raphson steps\n    float32x4_t rcp = vrecpeq_f32(v);\n    \/\/ vrecpsq_f32 conveniently performs a Newton-Raphson step\n    rcp = vmulq_f32(vrecpsq_f32(v, rcp), rcp);\n    rcp = vmulq_f32(vrecpsq_f32(v, rcp), rcp);\n    return vmulq_f32(u, rcp);\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ Bitwise operations\n\/\/\n\nVSNRAY_FORCE_INLINE float4 operator&(float4 const& u, float4 const& v)\n{\n    int32x4_t ui = vreinterpretq_s32_f32(u);\n    int32x4_t vi = vreinterpretq_s32_f32(v);\n    int32x4_t ri = vandq_s32(ui, vi);\n    return vreinterpretq_f32_s32(ri);\n}\n\nVSNRAY_FORCE_INLINE float4 operator|(float4 const& u, float4 const& v)\n{\n    int32x4_t ui = vreinterpretq_s32_f32(u);\n    int32x4_t vi = vreinterpretq_s32_f32(v);\n    int32x4_t ri = vorrq_s32(ui, vi);\n    return vreinterpretq_f32_s32(ri);\n}\n\nVSNRAY_FORCE_INLINE float4 operator^(float4 const& u, float4 const& v)\n{\n    int32x4_t ui = vreinterpretq_s32_f32(u);\n    int32x4_t vi = vreinterpretq_s32_f32(v);\n    int32x4_t ri = veorq_s32(ui, vi);\n    return vreinterpretq_f32_s32(ri);\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ Logical operations\n\/\/\n\nVSNRAY_FORCE_INLINE float4 operator&&(float4 const& u, float4 const& v)\n{\n    int32x4_t ui = vreinterpretq_s32_f32(u);\n    int32x4_t vi = vreinterpretq_s32_f32(v);\n    int32x4_t ri = vandq_s32(ui, vi);\n    return vreinterpretq_f32_s32(ri);\n}\n\nVSNRAY_FORCE_INLINE float4 operator||(float4 const& u, float4 const& v)\n{\n    int32x4_t ui = vreinterpretq_s32_f32(u);\n    int32x4_t vi = vreinterpretq_s32_f32(v);\n    int32x4_t ri = vorrq_s32(ui, vi);\n    return vreinterpretq_f32_s32(ri);\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ Comparisons\n\/\/\n\nVSNRAY_FORCE_INLINE mask4 operator<(float4 const& u, float4 const& v)\n{\n    return vcltq_f32(u, v);\n}\n\nVSNRAY_FORCE_INLINE mask4 operator>(float4 const& u, float4 const& v)\n{\n    return vcgtq_f32(u, v);\n}\n\nVSNRAY_FORCE_INLINE mask4 operator<=(float4 const& u, float4 const& v)\n{\n    return vcleq_f32(u, v);\n}\n\nVSNRAY_FORCE_INLINE mask4 operator>=(float4 const& u, float4 const& v)\n{\n    return vcgeq_f32(u, v);\n}\n\nVSNRAY_FORCE_INLINE mask4 operator==(float4 const& u, float4 const& v)\n{\n    return vceqq_f32(u, v);\n}\n\nVSNRAY_FORCE_INLINE mask4 operator!=(float4 const& u, float4 const& v)\n{\n    return vmvnq_u32(vceqq_f32(u, v));\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ Math functions\n\/\/\n\nVSNRAY_FORCE_INLINE float4 dot(float4 const& u, float4 const& v)\n{\n   float4 t1 = u * v;\n   float4 t2 = shuffle<1,0,3,2>(t1);\n   float4 t3 = t1 + t2;\n   float4 t4 = shuffle<3,2,1,0>(t3);\n   float4 t5 = t3 + t4;\n\n   return t5;\n}\n\nVSNRAY_FORCE_INLINE float4 min(float4 const& u, float4 const& v)\n{\n    return vminq_f32(u, v);\n}\n\nVSNRAY_FORCE_INLINE float4 max(float4 const& u, float4 const& v)\n{\n    return vmaxq_f32(u, v);\n}\n\nVSNRAY_FORCE_INLINE float4 saturate(float4 const& u)\n{\n    return vmaxq_f32(vdupq_n_f32(0.0f), vminq_f32(u, vdupq_n_f32(1.0f)));\n}\n\nVSNRAY_FORCE_INLINE float4 abs(float4 const& u)\n{\n    int4 a = vreinterpretq_s32_f32(u);\n    int4 b = vdupq_n_s32(0x7FFFFFFF);\n    return vreinterpretq_f32_s32(vandq_s32(a, b));\n}\n\nVSNRAY_FORCE_INLINE float4 ceil(float4 const& v)\n{\n    \/\/ i = trunc(v)\n    float32x4_t i = vcvtq_f32_s32(vcvtq_s32_f32(v));\n    \/\/ r = i < v ? i i + 1 : i\n    uint32x4_t t = vcltq_f32(i, v);\n    int32x4_t st = vreinterpretq_s32_u32(t); \/\/ underflow: 0xFFFFFFFF -> -1\n    float32x4_t d = vcvtq_f32_s32(st); \/\/ signed mask to float (0.0f or -1.0f)\n    float32x4_t r = vsubq_f32(i, d);\n\n    return r;\n}\n\nVSNRAY_FORCE_INLINE float4 floor(float4 const& v)\n{\n    \/\/ i = trunc(v)\n    float32x4_t i = vcvtq_f32_s32(vcvtq_s32_f32(v));\n    \/\/ r = i > v ? i - 1 : i\n    uint32x4_t t = vcgtq_f32(i, v);\n    int32x4_t st = vreinterpretq_s32_u32(t); \/\/ underflow: 0xFFFFFFFF -> -1\n    float32x4_t d = vcvtq_f32_s32(st); \/\/ signed mask to float (0.0f or -1.0f)\n    float32x4_t r = vaddq_f32(i, d);\n\n    return r;\n}\n\nVSNRAY_FORCE_INLINE float4 sqrt(float4 const& v)\n{\n    float32x4_t rsqrt = vrsqrteq_f32(v);\n    \/\/ Newton-Raphson step\n    rsqrt = vrsqrtsq_f32(v * rsqrt, rsqrt) * rsqrt;\n    \/\/ rsqrt => sqrt\n    return v * rsqrt;\n}\n\nVSNRAY_FORCE_INLINE mask4 isinf(float4 const& v)\n{\n    VSNRAY_ALIGN(16) float values[4] = {};\n    store(values, v);\n\n    return mask4(\n            std::isinf(values[0]),\n            std::isinf(values[1]),\n            std::isinf(values[2]),\n            std::isinf(values[3])\n            );\n}\n\nVSNRAY_FORCE_INLINE mask4 isnan(float4 const& v)\n{\n    return v != v;\n}\n\nVSNRAY_FORCE_INLINE mask4 isfinite(float4 const& v)\n{\n    return !(isinf(v) | isnan(v));\n}\n\n} \/\/ simd\n} \/\/ MATH_NAMESPACE\n<|endoftext|>"}
{"text":"<commit_before>#include \"interpreter.hpp\"\n#include \"numbers.hpp\"\n#include \"token.hpp\"\n#include \"value.hpp\"\n#include <sstream>\n\nnamespace laskin\n{\n    typedef std::vector<token>::const_iterator token_iterator;\n\n    static value parse_value(token_iterator&, const token_iterator&);\n    static std::vector<value> parse_list(token_iterator&, const token_iterator&);\n    static signature parse_function_signature(token_iterator&, const token_iterator&);\n    static std::vector<token> parse_block(token_iterator&, const token_iterator&);\n    static void parse_if(token_iterator&, const token_iterator&, interpreter&, std::deque<value>&);\n\n    namespace internal\n    {\n        void initialize_bool(interpreter*);\n        void initialize_io(interpreter*);\n        void initialize_list(interpreter*);\n        void initialize_numbers(interpreter*);\n        void initialize_program(interpreter*);\n        void initialize_stack(interpreter*);\n        void initialize_string(interpreter*);\n        void initialize_trigonometry(interpreter*);\n    }\n\n    interpreter::interpreter() {}\n\n    interpreter::interpreter(const interpreter& that)\n        : m_functions(that.m_functions) {}\n\n    void interpreter::initialize()\n    {\n        using namespace internal;\n\n        initialize_bool(this);\n        initialize_io(this);\n        initialize_list(this);\n        initialize_numbers(this);\n        initialize_program(this);\n        initialize_stack(this);\n        initialize_string(this);\n        initialize_trigonometry(this);\n    }\n\n    void interpreter::execute(const std::vector<token>& tokens,\n                              std::deque<value>& stack)\n        throw(script_error, syntax_error)\n    {\n        const token_iterator end = tokens.end();\n\n        for (token_iterator current = tokens.begin(); current < end;)\n        {\n            switch (current->type())\n            {\n                case token::type_lparen:\n                case token::type_rparen:\n                case token::type_rbrack:\n                case token::type_lbrace:\n                case token::type_rbrace:\n                {\n                    std::stringstream ss;\n\n                    ss << \"unexpected \" << current->type();\n\n                    throw syntax_error(ss.str());\n                }\n\n                case token::type_int:\n                    try\n                    {\n                        stack.push_back(string_to_int(current++->data()));\n                    }\n                    catch (std::length_error& e)\n                    {\n                        throw syntax_error(e.what());\n                    }\n                    break;\n\n                case token::type_real:\n                    try\n                    {\n                        stack.push_back(string_to_real(current++->data()));\n                    }\n                    catch (std::length_error& e)\n                    {\n                        throw syntax_error(e.what());\n                    }\n                    break;\n\n                case token::type_string:\n                    stack.push_back(current++->data());\n                    break;\n\n                case token::type_lbrack:\n                    stack.push_back(parse_list(++current, end));\n                    break;\n\n                case token::type_word:\n                {\n                    const std::string& id = current++->data();\n\n                    if (!id.compare(\"if\"))\n                    {\n                        parse_if(current, end, *this, stack);\n                    } else {\n                        auto entry = m_functions.find(id);\n\n                        if (entry)\n                        {\n                            bool found = false;\n\n                            for (auto& function : entry->value)\n                            {\n                                if (function.signature().test(stack))\n                                {\n                                    found = true;\n                                    function.invoke(*this, stack);\n                                    break;\n                                }\n                            }\n                            if (!found)\n                            {\n                                throw script_error(\n                                        \"signature of function `\"\n                                        + id\n                                        + \"' does not match with given stack\"\n                                );\n                            }\n                        } else {\n                            throw script_error(\n                                    \"undefined function `\"\n                                    + id\n                                    + \"'\"\n                            );\n                        }\n                    }\n                    break;\n                }\n\n                case token::type_colon:\n                {\n                    std::string name;\n                    class signature signature;\n                    std::vector<token> body;\n\n                    if (++current < end && current->is(token::type_word))\n                    {\n                        name = current++->data();\n                    }\n                    if (current < end && current->is(token::type_lparen))\n                    {\n                        signature = parse_function_signature(++current, end);\n                    }\n                    body = parse_block(current, end);\n                    if (name.empty())\n                    {\n                        stack.push_back(function(signature, body));\n                    } else {\n                        register_function(name, signature, body);\n                    }\n                }\n            }\n        }\n    }\n\n    void interpreter::register_function(const std::string& name,\n                                        const class signature& signature,\n                                        void (*callback)(interpreter&, std::deque<value>&))\n    {\n        hashmap<std::vector<function> >::entry* e = m_functions.find(name);\n\n        if (e)\n        {\n            for (auto& f : e->value)\n            {\n                if (signature == f.signature())\n                {\n                    f = function(signature, callback);\n                    return;\n                }\n            }\n            e->value.push_back(function(signature, callback));\n        } else {\n            std::vector<function> vector;\n\n            vector.push_back(function(signature, callback));\n            m_functions.insert(name, vector);\n        }\n    }\n\n    void interpreter::register_function(const std::string& name,\n                                        const std::string& sig,\n                                        void (*callback)(interpreter&, std::deque<value>&))\n    {\n        register_function(name, signature(sig), callback);\n    }\n\n    void interpreter::register_function(const std::string& name,\n                                        const class signature& signature,\n                                        const std::vector<token>& callback)\n    {\n        hashmap<std::vector<function> >::entry* e = m_functions.find(name);\n\n        if (e)\n        {\n            for (auto& f : e->value)\n            {\n                if (signature == f.signature())\n                {\n                    f = function(signature, callback);\n                    return;\n                }\n            }\n            e->value.push_back(function(signature, callback));\n        } else {\n            std::vector<function> vector;\n\n            vector.push_back(function(signature, callback));\n            m_functions.insert(name, vector);\n        }\n    }\n\n    interpreter& interpreter::assign(const interpreter& that)\n    {\n        m_functions = that.m_functions;\n\n        return *this;\n    }\n\n    static value parse_value(token_iterator& current,\n                             const token_iterator& end)\n    {\n        const class token& token = *current++;\n\n        switch (token.type())\n        {\n            case token::type_int:\n                try\n                {\n                    return string_to_int(current++->data());\n                }\n                catch (std::length_error& e)\n                {\n                    throw syntax_error(e.what());\n                }\n\n            case token::type_real:\n                try\n                {\n                    return string_to_real(current++->data());\n                }\n                catch (std::length_error& e)\n                {\n                    throw syntax_error(e.what());\n                }\n\n            case token::type_string:\n                return token.data();\n\n            case token::type_lbrack:\n                return parse_list(current, end);\n\n            case token::type_colon:\n            {\n                class signature signature;\n\n                if (current < end && current->is(token::type_lparen))\n                {\n                    signature = parse_function_signature(++current, end);\n                }\n\n                return function(signature, parse_block(current, end));\n            }\n\n            default:\n            {\n                std::stringstream ss;\n\n                ss << \"unexpected \" << token.type() << \"; missing value\";\n\n                throw syntax_error(ss.str());\n            }\n        }\n    }\n\n    static std::vector<value> parse_list(token_iterator& current,\n                                         const token_iterator& end)\n    {\n        std::vector<value> list;\n\n        while (current < end && !current->is(token::type_rbrack))\n        {\n            list.push_back(parse_value(current, end));\n        }\n        if (current++ >= end)\n        {\n            throw syntax_error(\"unterminated list: missing `]'\");\n        }\n\n        return list;\n    }\n\n    static signature parse_function_signature(token_iterator& current,\n                                              const token_iterator& end)\n    {\n        std::vector<signature::entry> parameter_types;\n        std::vector<signature::entry> return_types;\n        bool in_parameters = true;\n\n        while (current < end && !current->is(token::type_rparen))\n        {\n            if (current->is(token::type_colon))\n            {\n                ++current;\n                if (in_parameters)\n                {\n                    in_parameters = false;\n                } else {\n                    throw syntax_error(\"multiple `:' found in function signature\");\n                }\n            }\n            else if (current->is(token::type_word))\n            {\n                const std::string& id = current++->data();\n                signature::entry entry;\n\n                if (!id.compare(\"any\"))\n                {\n                    entry = signature::type_any;\n                }\n                else if (!id.compare(\"bool\"))\n                {\n                    entry = signature::type_bool;\n                }\n                else if (!id.compare(\"number\"))\n                {\n                    entry = signature::type_number;\n                }\n                else if (!id.compare(\"int\"))\n                {\n                    entry = signature::type_int;\n                }\n                else if (!id.compare(\"real\"))\n                {\n                    entry = signature::type_real;\n                }\n                else if (!id.compare(\"string\"))\n                {\n                    entry = signature::type_string;\n                }\n                else if (!id.compare(\"list\"))\n                {\n                    entry = signature::type_list;\n                }\n                else if (!id.compare(\"function\"))\n                {\n                    entry = signature::type_function;\n                } else {\n                    throw syntax_error(\"unknown type: `\" + id + \"'\");\n                }\n                if (in_parameters)\n                {\n                    parameter_types.push_back(entry);\n                } else {\n                    return_types.push_back(entry);\n                }\n            } else {\n                std::stringstream ss;\n\n                ss << \"unexpected \"\n                   << current->type()\n                   << \"; missing type signature\";\n\n                throw syntax_error(ss.str());\n            }\n        }\n        if (current++ >= end)\n        {\n            throw syntax_error(\"unterminated function signature: missing `)'\");\n        }\n\n        return signature(parameter_types, return_types);\n    }\n\n    static std::vector<token> parse_block(token_iterator& current,\n                                          const token_iterator& end)\n    {\n        std::vector<token> tokens;\n        unsigned int counter = 1;\n\n        if (current >= end || !current->is(token::type_lbrace))\n        {\n            throw syntax_error(\"missing block\");\n        }\n        ++current;\n        while (current < end)\n        {\n            const class token& token = *current++;\n\n            if (token.is(token::type_lbrace))\n            {\n                ++counter;\n            }\n            else if (token.is(token::type_rbrace) && --counter == 0)\n            {\n                break;\n            }\n            tokens.push_back(token);\n        }\n        if (counter > 0)\n        {\n            throw syntax_error(\"unterminated block: missing `}'\");\n        }\n\n        return tokens;\n    }\n\n    static void skip_block(token_iterator& current,\n                           const token_iterator& end)\n    {\n        unsigned int counter = 1;\n\n        if (current >= end || !current->is(token::type_lbrace))\n        {\n            throw syntax_error(\"missing block\");\n        }\n        for (++current; current < end && counter > 0; ++current)\n        {\n            if (current->is(token::type_lbrace))\n            {\n                ++counter;\n            }\n            else if (current->is(token::type_rbrace))\n            {\n                --counter;\n            }\n        }\n        if (counter > 0)\n        {\n            throw syntax_error(\"unterminated block: missing `}'\");\n        }\n    }\n\n    static void parse_if(token_iterator& current,\n                         const token_iterator& end,\n                         class interpreter& interpreter,\n                         std::deque<value>& stack)\n    {\n        token_iterator begin = current;\n        bool condition;\n\n        while (current < end && !current->is(token::type_lbrace))\n        {\n            ++current;\n        }\n        interpreter.execute(std::vector<token>(begin, current), stack);\n        if (stack.empty() || !stack[stack.size() - 1].is(value::type_bool))\n        {\n            throw script_error(\"`if' statement is missing condition\");\n        }\n        condition = stack[stack.size() - 1].as_bool();\n        stack.pop_back();\n        if (condition)\n        {\n            interpreter.execute(parse_block(current, end), stack);\n            if (current < end && current->is(\"else\"))\n            {\n                skip_block(++current, end);\n            }\n        } else {\n            skip_block(current, end);\n            if (current < end && current->is(\"else\"))\n            {\n                interpreter.execute(parse_block(++current, end), stack);\n            }\n        }\n    }\n}\n<commit_msg>fix value parsing routine<commit_after>#include \"interpreter.hpp\"\n#include \"numbers.hpp\"\n#include \"token.hpp\"\n#include \"value.hpp\"\n#include <sstream>\n\nnamespace laskin\n{\n    typedef std::vector<token>::const_iterator token_iterator;\n\n    static value parse_value(token_iterator&, const token_iterator&);\n    static std::vector<value> parse_list(token_iterator&, const token_iterator&);\n    static signature parse_function_signature(token_iterator&, const token_iterator&);\n    static std::vector<token> parse_block(token_iterator&, const token_iterator&);\n    static void parse_if(token_iterator&, const token_iterator&, interpreter&, std::deque<value>&);\n\n    namespace internal\n    {\n        void initialize_bool(interpreter*);\n        void initialize_io(interpreter*);\n        void initialize_list(interpreter*);\n        void initialize_numbers(interpreter*);\n        void initialize_program(interpreter*);\n        void initialize_stack(interpreter*);\n        void initialize_string(interpreter*);\n        void initialize_trigonometry(interpreter*);\n    }\n\n    interpreter::interpreter() {}\n\n    interpreter::interpreter(const interpreter& that)\n        : m_functions(that.m_functions) {}\n\n    void interpreter::initialize()\n    {\n        using namespace internal;\n\n        initialize_bool(this);\n        initialize_io(this);\n        initialize_list(this);\n        initialize_numbers(this);\n        initialize_program(this);\n        initialize_stack(this);\n        initialize_string(this);\n        initialize_trigonometry(this);\n    }\n\n    void interpreter::execute(const std::vector<token>& tokens,\n                              std::deque<value>& stack)\n        throw(script_error, syntax_error)\n    {\n        const token_iterator end = tokens.end();\n\n        for (token_iterator current = tokens.begin(); current < end;)\n        {\n            switch (current->type())\n            {\n                case token::type_lparen:\n                case token::type_rparen:\n                case token::type_rbrack:\n                case token::type_lbrace:\n                case token::type_rbrace:\n                {\n                    std::stringstream ss;\n\n                    ss << \"unexpected \" << current->type();\n\n                    throw syntax_error(ss.str());\n                }\n\n                case token::type_int:\n                    try\n                    {\n                        stack.push_back(string_to_int(current++->data()));\n                    }\n                    catch (std::length_error& e)\n                    {\n                        throw syntax_error(e.what());\n                    }\n                    break;\n\n                case token::type_real:\n                    try\n                    {\n                        stack.push_back(string_to_real(current++->data()));\n                    }\n                    catch (std::length_error& e)\n                    {\n                        throw syntax_error(e.what());\n                    }\n                    break;\n\n                case token::type_string:\n                    stack.push_back(current++->data());\n                    break;\n\n                case token::type_lbrack:\n                    stack.push_back(parse_list(++current, end));\n                    break;\n\n                case token::type_word:\n                {\n                    const std::string& id = current++->data();\n\n                    if (!id.compare(\"if\"))\n                    {\n                        parse_if(current, end, *this, stack);\n                    } else {\n                        auto entry = m_functions.find(id);\n\n                        if (entry)\n                        {\n                            bool found = false;\n\n                            for (auto& function : entry->value)\n                            {\n                                if (function.signature().test(stack))\n                                {\n                                    found = true;\n                                    function.invoke(*this, stack);\n                                    break;\n                                }\n                            }\n                            if (!found)\n                            {\n                                throw script_error(\n                                        \"signature of function `\"\n                                        + id\n                                        + \"' does not match with given stack\"\n                                );\n                            }\n                        } else {\n                            throw script_error(\n                                    \"undefined function `\"\n                                    + id\n                                    + \"'\"\n                            );\n                        }\n                    }\n                    break;\n                }\n\n                case token::type_colon:\n                {\n                    std::string name;\n                    class signature signature;\n                    std::vector<token> body;\n\n                    if (++current < end && current->is(token::type_word))\n                    {\n                        name = current++->data();\n                    }\n                    if (current < end && current->is(token::type_lparen))\n                    {\n                        signature = parse_function_signature(++current, end);\n                    }\n                    body = parse_block(current, end);\n                    if (name.empty())\n                    {\n                        stack.push_back(function(signature, body));\n                    } else {\n                        register_function(name, signature, body);\n                    }\n                }\n            }\n        }\n    }\n\n    void interpreter::register_function(const std::string& name,\n                                        const class signature& signature,\n                                        void (*callback)(interpreter&, std::deque<value>&))\n    {\n        hashmap<std::vector<function> >::entry* e = m_functions.find(name);\n\n        if (e)\n        {\n            for (auto& f : e->value)\n            {\n                if (signature == f.signature())\n                {\n                    f = function(signature, callback);\n                    return;\n                }\n            }\n            e->value.push_back(function(signature, callback));\n        } else {\n            std::vector<function> vector;\n\n            vector.push_back(function(signature, callback));\n            m_functions.insert(name, vector);\n        }\n    }\n\n    void interpreter::register_function(const std::string& name,\n                                        const std::string& sig,\n                                        void (*callback)(interpreter&, std::deque<value>&))\n    {\n        register_function(name, signature(sig), callback);\n    }\n\n    void interpreter::register_function(const std::string& name,\n                                        const class signature& signature,\n                                        const std::vector<token>& callback)\n    {\n        hashmap<std::vector<function> >::entry* e = m_functions.find(name);\n\n        if (e)\n        {\n            for (auto& f : e->value)\n            {\n                if (signature == f.signature())\n                {\n                    f = function(signature, callback);\n                    return;\n                }\n            }\n            e->value.push_back(function(signature, callback));\n        } else {\n            std::vector<function> vector;\n\n            vector.push_back(function(signature, callback));\n            m_functions.insert(name, vector);\n        }\n    }\n\n    interpreter& interpreter::assign(const interpreter& that)\n    {\n        m_functions = that.m_functions;\n\n        return *this;\n    }\n\n    static value parse_value(token_iterator& current,\n                             const token_iterator& end)\n    {\n        const class token& token = *current++;\n\n        switch (token.type())\n        {\n            case token::type_int:\n                try\n                {\n                    return string_to_int(token.data());\n                }\n                catch (std::length_error& e)\n                {\n                    throw syntax_error(e.what());\n                }\n\n            case token::type_real:\n                try\n                {\n                    return string_to_real(token.data());\n                }\n                catch (std::length_error& e)\n                {\n                    throw syntax_error(e.what());\n                }\n\n            case token::type_string:\n                return token.data();\n\n            case token::type_lbrack:\n                return parse_list(current, end);\n\n            case token::type_colon:\n            {\n                class signature signature;\n\n                if (current < end && current->is(token::type_lparen))\n                {\n                    signature = parse_function_signature(++current, end);\n                }\n\n                return function(signature, parse_block(current, end));\n            }\n\n            default:\n            {\n                std::stringstream ss;\n\n                ss << \"unexpected \" << token.type() << \"; missing value\";\n\n                throw syntax_error(ss.str());\n            }\n        }\n    }\n\n    static std::vector<value> parse_list(token_iterator& current,\n                                         const token_iterator& end)\n    {\n        std::vector<value> list;\n\n        while (current < end && !current->is(token::type_rbrack))\n        {\n            list.push_back(parse_value(current, end));\n        }\n        if (current++ >= end)\n        {\n            throw syntax_error(\"unterminated list: missing `]'\");\n        }\n\n        return list;\n    }\n\n    static signature parse_function_signature(token_iterator& current,\n                                              const token_iterator& end)\n    {\n        std::vector<signature::entry> parameter_types;\n        std::vector<signature::entry> return_types;\n        bool in_parameters = true;\n\n        while (current < end && !current->is(token::type_rparen))\n        {\n            if (current->is(token::type_colon))\n            {\n                ++current;\n                if (in_parameters)\n                {\n                    in_parameters = false;\n                } else {\n                    throw syntax_error(\"multiple `:' found in function signature\");\n                }\n            }\n            else if (current->is(token::type_word))\n            {\n                const std::string& id = current++->data();\n                signature::entry entry;\n\n                if (!id.compare(\"any\"))\n                {\n                    entry = signature::type_any;\n                }\n                else if (!id.compare(\"bool\"))\n                {\n                    entry = signature::type_bool;\n                }\n                else if (!id.compare(\"number\"))\n                {\n                    entry = signature::type_number;\n                }\n                else if (!id.compare(\"int\"))\n                {\n                    entry = signature::type_int;\n                }\n                else if (!id.compare(\"real\"))\n                {\n                    entry = signature::type_real;\n                }\n                else if (!id.compare(\"string\"))\n                {\n                    entry = signature::type_string;\n                }\n                else if (!id.compare(\"list\"))\n                {\n                    entry = signature::type_list;\n                }\n                else if (!id.compare(\"function\"))\n                {\n                    entry = signature::type_function;\n                } else {\n                    throw syntax_error(\"unknown type: `\" + id + \"'\");\n                }\n                if (in_parameters)\n                {\n                    parameter_types.push_back(entry);\n                } else {\n                    return_types.push_back(entry);\n                }\n            } else {\n                std::stringstream ss;\n\n                ss << \"unexpected \"\n                   << current->type()\n                   << \"; missing type signature\";\n\n                throw syntax_error(ss.str());\n            }\n        }\n        if (current++ >= end)\n        {\n            throw syntax_error(\"unterminated function signature: missing `)'\");\n        }\n\n        return signature(parameter_types, return_types);\n    }\n\n    static std::vector<token> parse_block(token_iterator& current,\n                                          const token_iterator& end)\n    {\n        std::vector<token> tokens;\n        unsigned int counter = 1;\n\n        if (current >= end || !current->is(token::type_lbrace))\n        {\n            throw syntax_error(\"missing block\");\n        }\n        ++current;\n        while (current < end)\n        {\n            const class token& token = *current++;\n\n            if (token.is(token::type_lbrace))\n            {\n                ++counter;\n            }\n            else if (token.is(token::type_rbrace) && --counter == 0)\n            {\n                break;\n            }\n            tokens.push_back(token);\n        }\n        if (counter > 0)\n        {\n            throw syntax_error(\"unterminated block: missing `}'\");\n        }\n\n        return tokens;\n    }\n\n    static void skip_block(token_iterator& current,\n                           const token_iterator& end)\n    {\n        unsigned int counter = 1;\n\n        if (current >= end || !current->is(token::type_lbrace))\n        {\n            throw syntax_error(\"missing block\");\n        }\n        for (++current; current < end && counter > 0; ++current)\n        {\n            if (current->is(token::type_lbrace))\n            {\n                ++counter;\n            }\n            else if (current->is(token::type_rbrace))\n            {\n                --counter;\n            }\n        }\n        if (counter > 0)\n        {\n            throw syntax_error(\"unterminated block: missing `}'\");\n        }\n    }\n\n    static void parse_if(token_iterator& current,\n                         const token_iterator& end,\n                         class interpreter& interpreter,\n                         std::deque<value>& stack)\n    {\n        token_iterator begin = current;\n        bool condition;\n\n        while (current < end && !current->is(token::type_lbrace))\n        {\n            ++current;\n        }\n        interpreter.execute(std::vector<token>(begin, current), stack);\n        if (stack.empty() || !stack[stack.size() - 1].is(value::type_bool))\n        {\n            throw script_error(\"`if' statement is missing condition\");\n        }\n        condition = stack[stack.size() - 1].as_bool();\n        stack.pop_back();\n        if (condition)\n        {\n            interpreter.execute(parse_block(current, end), stack);\n            if (current < end && current->is(\"else\"))\n            {\n                skip_block(++current, end);\n            }\n        } else {\n            skip_block(current, end);\n            if (current < end && current->is(\"else\"))\n            {\n                interpreter.execute(parse_block(++current, end), stack);\n            }\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkSetGet.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 SetGet Macros - standard macros for setting\/getting instance variables\n\/\/ .SECTION Description\n\/\/ The SetGet macros are used to interface to instance variables\n\/\/ in a standard fashion. This includes properly treating modified time\n\/\/ and printing out debug information.\n\/\/\n\/\/ Macros are available for built-in types; for character strings; \n\/\/ vector arrays of built-in types size 2,3,4; for setting objects; and\n\/\/ debug, warning, and error printout information.\n\n#ifndef __vtkSetGet_hh\n#define __vtkSetGet_hh\n\n#include <string.h>\n\n\/\/\n\/\/ Some constants used throughout code\n\/\/\n#define VTK_LARGE_FLOAT 1.0e29\n#define VTK_LARGE_INTEGER 2147483646 \/\/ 2^31 - 1\n\n\/\/\n\/\/ Set built-in type.  Creates member Set\"name\"() (e.g., SetVisibility());\n\/\/\n#define vtkSetMacro(name,type) \\\nvoid Set##name (type _arg) \\\n  { \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): setting \" << #name \" to \" << _arg << \"\\n\\n\"; \\\n  if (name != _arg) \\\n    { \\\n    name = _arg; \\\n    this->Modified(); \\\n    } \\\n  } \n\n\/\/\n\/\/ Get built-in type.  Creates member Get\"name\"() (e.g., GetVisibility());\n\/\/\n#define vtkGetMacro(name,type) \\\ntype Get##name () { \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): returning \" << #name \" of \" << name << \"\\n\\n\"; \\\n  return name; \\\n  } \n\n\/\/\n\/\/ Set character string.  Creates member Set\"name\"() \n\/\/ (e.g., SetFilename(char *));\n\/\/\n#define vtkSetStringMacro(name) \\\nvoid Set##name (char* _arg) \\\n  { \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): setting \" << #name \" to \" << _arg << \"\\n\\n\"; \\\n  if ( name && _arg && (!strcmp(name,_arg))) return; \\\n  if (name) delete [] name; \\\n  if (_arg) \\\n    { \\\n    name = new char[strlen(_arg)+1]; \\\n    strcpy(name,_arg); \\\n    } \\\n   else \\\n    { \\\n    name = NULL; \\\n    } \\\n  this->Modified(); \\\n  } \n\n\/\/\n\/\/ Get character string.  Creates member Get\"name\"() \n\/\/ (e.g., char *GetFilename());\n\/\/\n#define vtkGetStringMacro(name) \\\nchar* Get##name () { \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): returning \" << #name \" of \" << name << \"\\n\\n\"; \\\n  return name; \\\n  } \n\n\/\/\n\/\/ Set built-in type where value is constrained between min\/max limits.\n\/\/ Create member Set\"name\"() (e.q., SetRadius()). #defines are \n\/\/ convienience for clamping open-ended values.\n\/\/\n#define vtkSetClampMacro(name,type,min,max) \\\nvoid Set##name (type _arg) \\\n  { \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): setting \" << #name \" to \" << _arg << \"\\n\\n\"; \\\n  if (name != _arg) \\\n    { \\\n    name = (_arg<min?min:(_arg>max?max:_arg)); \\\n    this->Modified(); \\\n    } \\\n  } \n\n\/\/\n\/\/ Set pointer to object. Creates method Set\"name\"() (e.g., SetPoints()).\n\/\/\n#define vtkSetObjectMacro(name,type) \\\nvoid Set##name (type* _arg) \\\n  { \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): setting \" << #name \" to \" << &_arg << \"\\n\\n\"; \\\n  if (name != _arg) \\\n    { \\\n    name = _arg; \\\n    this->Modified(); \\\n    } \\\n  } \\\nvoid Set##name (type& _arg) \\\n  { \\\n  Set##name (&_arg);\\\n  } \n\n\/\/\n\/\/ Set pointer to object; uses vtkRefCount reference counting methodology.\n\/\/ Creates method Set\"name\"() (e.g., SetPoints()).\n\/\/\n#define vtkSetRefCountedObjectMacro(name,type) \\\nvoid Set##name (type* _arg) \\\n  { \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): setting \" << #name \" to \" << &_arg << \"\\n\\n\"; \\\n  if (name != _arg) \\\n    { \\\n    if (name != NULL) name->UnRegister(this); \\\n    name = _arg; \\\n    if (name != NULL) name->Register(this); \\\n    this->Modified(); \\\n    } \\\n  } \n\n\/\/\n\/\/ Get pointer to object.  Creates member Get\"name\" (e.g., GetPoints()).\n\/\/\n#define vtkGetObjectMacro(name,type) \\\ntype *Get##name () \\\n  { \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): returning \" << #name \" address \" << name << \"\\n\\n\"; \\\n  return name; \\\n  } \n\n\/\/\n\/\/ Create members \"name\"On() and \"name\"Off() (e.g., DebugOn() DebugOff()).\n\/\/ Set method must be defined to use this macro.\n\/\/\n#define vtkBooleanMacro(name,type) \\\nvoid name##On () { Set##name((type)1);}; \\\nvoid name##Off () { Set##name((type)0);}\n\n\/\/\n\/\/ Following set macros for vectors define two members for each macro.  The first \n\/\/ allows setting of individual components (e.g, SetColor(float,float,float)), \n\/\/ the second allows setting from an array (e.g., SetColor(float* rgb[3])).\n\/\/ The macros vary in the size of the vector they deal with.\n\/\/\n#define vtkSetVector2Macro(name,type) \\\nvoid Set##name (type _arg1, type _arg2) \\\n  { \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): setting \" << #name \" to (\" << _arg1 << \",\" << _arg2 << \")\\n\\n\"; \\\n  if ((name[0] != _arg1)||(name[1] != _arg2)) \\\n    { \\\n    this->Modified(); \\\n    name[0] = _arg1; \\\n    name[1] = _arg2; \\\n    } \\\n  }; \\\nvoid Set##name (type _arg[2]) \\\n  { \\\n  Set##name (_arg[0], _arg[1]); \\\n  } \n\n#define vtkSetVector3Macro(name,type) \\\nvoid Set##name (type _arg1, type _arg2, type _arg3) \\\n  { \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): setting \" << #name \" to (\" << _arg1 << \",\" << _arg2 << \",\" << _arg3 << \")\\n\\n\"; \\\n  if ((name[0] != _arg1)||(name[1] != _arg2)||(name[2] != _arg3)) \\\n    { \\\n    this->Modified(); \\\n    name[0] = _arg1; \\\n    name[1] = _arg2; \\\n    name[2] = _arg3; \\\n    } \\\n  }; \\\nvoid Set##name (type _arg[3]) \\\n  { \\\n  Set##name (_arg[0], _arg[1], _arg[2]);\\\n  } \n\n#define vtkSetVector4Macro(name,type) \\\nvoid Set##name (type _arg1, type _arg2, type _arg3, type _arg4) \\\n  { \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): setting \" << #name \" to (\" << _arg1 << \",\" << _arg2 << \",\" << _arg3 << \",\" << _arg4 << \")\\n\\n\"; \\\n  if ((name[0] != _arg1)||(name[1] != _arg2)||(name[2] != _arg3)||(name[3] != _arg4)) \\\n    { \\\n    this->Modified(); \\\n    name[0] = _arg1; \\\n    name[1] = _arg2; \\\n    name[2] = _arg3; \\\n    name[3] = _arg4; \\\n    } \\\n  }; \\\nvoid Set##name (type _arg[4]) \\\n  { \\\n  Set##name (_arg[0], _arg[1], _arg[2], _arg[3]);\\\n  } \n\n\/\/\n\/\/ General set vector macro creates a single method that copies specified\n\/\/ number of values into object.\n\/\/ Examples: void SetColor(c,3)\n\/\/\n#define vtkSetVectorMacro(name,type,count) \\\nvoid Set##name(type data[]) \\\n{ \\\n  int i; \\\n  for (i=0; i<count; i++) if ( data[i] != name[i] ) break; \\\n  if ( i < count ) \\\n    { \\\n    this->Modified(); \\\n    for (i=0; i<count; i++) name[i] = data[i]; \\\n    } \\\n}\n\n\/\/\n\/\/ Get vector macro defines two methods. One returns pointer to type \n\/\/ (i.e., array of type). This is for efficiency. The second copies data\n\/\/ into user provided array. This is more object-oriented.\n\/\/ Examples: float *GetColor() and void GetColor(float c[count]).\n\/\/\n#define vtkGetVectorMacro(name,type,count) \\\ntype *Get##name () \\\n{ \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): returning \" << #name \" pointer \" << name << \"\\n\\n\"; \\\n  return name; \\\n} \\\nvoid Get##name (type data[count]) \\\n{ \\\n  for (int i=0; i<count; i++) data[i] = name[i]; \\\n}\n\n\/\/\n\/\/ This macro is used for  debug statements in instance methods\n\/\/ vtkDebugMacro(<< \"this is debug info\" << this->SomeVariable);\n\/\/\n#define vtkDebugMacro(x) \\\n  if (Debug) cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): \" x << \"\\n\\n\"\n\n\/\/\n\/\/ This macro is used to print out warning messages.\n\/\/ vtkWarningMacro(<< \"Warning message\" << variable);\n\/\/\n#define vtkWarningMacro(x) \\\n  cerr << \"Warning: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): \" x << \"\\n\\n\"\n\n\/\/\n\/\/ This macro is used to print out errors\n\/\/ vtkErrorMacro(<< \"Error message\" << variable);\n\/\/\n#define vtkErrorMacro(x) \\\n  cerr << \"ERROR In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): \" x << \"\\n\\n\"\n\n#endif\n<commit_msg>added macros for getting arrays.  Array values are returned in arguments.<commit_after>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkSetGet.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  vtkDebugMacro(<< \"\n\n\n\n=========================================================================*\/\n\/\/ .NAME SetGet Macros - standard macros for setting\/getting instance variables\n\/\/ .SECTION Description\n\/\/ The SetGet macros are used to interface to instance variables\n\/\/ in a standard fashion. This includes properly treating modified time\n\/\/ and printing out debug information.\n\/\/\n\/\/ Macros are available for built-in types; for character strings; \n\/\/ vector arrays of built-in types size 2,3,4; for setting objects; and\n\/\/ debug, warning, and error printout information.\n\n#ifndef __vtkSetGet_hh\n#define __vtkSetGet_hh\n\n#include <string.h>\n\n\/\/\n\/\/ Some constants used throughout code\n\/\/\n#define VTK_LARGE_FLOAT 1.0e29\n#define VTK_LARGE_INTEGER 2147483646 \/\/ 2^31 - 1\n\n\/\/\n\/\/ Set built-in type.  Creates member Set\"name\"() (e.g., SetVisibility());\n\/\/\n#define vtkSetMacro(name,type) \\\nvoid Set##name (type _arg) \\\n  { \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): setting \" << #name \" to \" << _arg << \"\\n\\n\"; \\\n  if (name != _arg) \\\n    { \\\n    name = _arg; \\\n    this->Modified(); \\\n    } \\\n  } \n\n\/\/\n\/\/ Get built-in type.  Creates member Get\"name\"() (e.g., GetVisibility());\n\/\/\n#define vtkGetMacro(name,type) \\\ntype Get##name () { \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): returning \" << #name \" of \" << name << \"\\n\\n\"; \\\n  return name; \\\n  } \n\n\/\/\n\/\/ Set character string.  Creates member Set\"name\"() \n\/\/ (e.g., SetFilename(char *));\n\/\/\n#define vtkSetStringMacro(name) \\\nvoid Set##name (char* _arg) \\\n  { \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): setting \" << #name \" to \" << _arg << \"\\n\\n\"; \\\n  if ( name && _arg && (!strcmp(name,_arg))) return; \\\n  if (name) delete [] name; \\\n  if (_arg) \\\n    { \\\n    name = new char[strlen(_arg)+1]; \\\n    strcpy(name,_arg); \\\n    } \\\n   else \\\n    { \\\n    name = NULL; \\\n    } \\\n  this->Modified(); \\\n  } \n\n\/\/\n\/\/ Get character string.  Creates member Get\"name\"() \n\/\/ (e.g., char *GetFilename());\n\/\/\n#define vtkGetStringMacro(name) \\\nchar* Get##name () { \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): returning \" << #name \" of \" << name << \"\\n\\n\"; \\\n  return name; \\\n  } \n\n\/\/\n\/\/ Set built-in type where value is constrained between min\/max limits.\n\/\/ Create member Set\"name\"() (e.q., SetRadius()). #defines are \n\/\/ convienience for clamping open-ended values.\n\/\/\n#define vtkSetClampMacro(name,type,min,max) \\\nvoid Set##name (type _arg) \\\n  { \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): setting \" << #name \" to \" << _arg << \"\\n\\n\"; \\\n  if (name != _arg) \\\n    { \\\n    name = (_arg<min?min:(_arg>max?max:_arg)); \\\n    this->Modified(); \\\n    } \\\n  } \n\n\/\/\n\/\/ Set pointer to object. Creates method Set\"name\"() (e.g., SetPoints()).\n\/\/\n#define vtkSetObjectMacro(name,type) \\\nvoid Set##name (type* _arg) \\\n  { \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): setting \" << #name \" to \" << &_arg << \"\\n\\n\"; \\\n  if (name != _arg) \\\n    { \\\n    name = _arg; \\\n    this->Modified(); \\\n    } \\\n  } \\\nvoid Set##name (type& _arg) \\\n  { \\\n  Set##name (&_arg);\\\n  } \n\n\/\/\n\/\/ Set pointer to object; uses vtkRefCount reference counting methodology.\n\/\/ Creates method Set\"name\"() (e.g., SetPoints()).\n\/\/\n#define vtkSetRefCountedObjectMacro(name,type) \\\nvoid Set##name (type* _arg) \\\n  { \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): setting \" << #name \" to \" << &_arg << \"\\n\\n\"; \\\n  if (name != _arg) \\\n    { \\\n    if (name != NULL) name->UnRegister(this); \\\n    name = _arg; \\\n    if (name != NULL) name->Register(this); \\\n    this->Modified(); \\\n    } \\\n  } \n\n\/\/\n\/\/ Get pointer to object.  Creates member Get\"name\" (e.g., GetPoints()).\n\/\/\n#define vtkGetObjectMacro(name,type) \\\ntype *Get##name () \\\n  { \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): returning \" << #name \" address \" << name << \"\\n\\n\"; \\\n  return name; \\\n  } \n\n\/\/\n\/\/ Create members \"name\"On() and \"name\"Off() (e.g., DebugOn() DebugOff()).\n\/\/ Set method must be defined to use this macro.\n\/\/\n#define vtkBooleanMacro(name,type) \\\nvoid name##On () { Set##name((type)1);}; \\\nvoid name##Off () { Set##name((type)0);}\n\n\/\/\n\/\/ Following set macros for vectors define two members for each macro.  The first \n\/\/ allows setting of individual components (e.g, SetColor(float,float,float)), \n\/\/ the second allows setting from an array (e.g., SetColor(float* rgb[3])).\n\/\/ The macros vary in the size of the vector they deal with.\n\/\/\n#define vtkSetVector2Macro(name,type) \\\nvoid Set##name (type _arg1, type _arg2) \\\n  { \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): setting \" << #name \" to (\" << _arg1 << \",\" << _arg2 << \")\\n\\n\"; \\\n  if ((name[0] != _arg1)||(name[1] != _arg2)) \\\n    { \\\n    this->Modified(); \\\n    name[0] = _arg1; \\\n    name[1] = _arg2; \\\n    } \\\n  }; \\\nvoid Set##name (type _arg[2]) \\\n  { \\\n  Set##name (_arg[0], _arg[1]); \\\n  } \n\n#define vtkGetVector2Macro(name,type) \\\ntype *Get##name () \\\n{ \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): returning \" << #name \" pointer \" << name << \"\\n\\n\"; \\\n  return name; \\\n} \\\nvoid Get##name (type &_arg1, type &_arg2) \\\n  { \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): returning \" << #name \" = (\" << _arg1 << \",\" << _arg2 << \")\\n\\n\"; \\\n    _arg1 = name[0]; \\\n    _arg2 = name[1]; \\\n  }; \\\nvoid Get##name (type _arg[2]) \\\n  { \\\n  Get##name (_arg[0], _arg[1]);\\\n  } \n\n#define vtkSetVector3Macro(name,type) \\\nvoid Set##name (type _arg1, type _arg2, type _arg3) \\\n  { \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): setting \" << #name \" to (\" << _arg1 << \",\" << _arg2 << \",\" << _arg3 << \")\\n\\n\"; \\\n  if ((name[0] != _arg1)||(name[1] != _arg2)||(name[2] != _arg3)) \\\n    { \\\n    this->Modified(); \\\n    name[0] = _arg1; \\\n    name[1] = _arg2; \\\n    name[2] = _arg3; \\\n    } \\\n  }; \\\nvoid Set##name (type _arg[3]) \\\n  { \\\n  Set##name (_arg[0], _arg[1], _arg[2]);\\\n  } \n\n#define vtkGetVector3Macro(name,type) \\\ntype *Get##name () \\\n{ \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): returning \" << #name \" pointer \" << name << \"\\n\\n\"; \\\n  return name; \\\n} \\\nvoid Get##name (type &_arg1, type &_arg2, type &_arg3) \\\n  { \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): returning \" << #name \" = (\" << _arg1 << \",\" << _arg2 << \",\" << _arg3 << \")\\n\\n\"; \\\n    _arg1 = name[0]; \\\n    _arg2 = name[1]; \\\n    _arg3 = name[2]; \\\n  }; \\\nvoid Get##name (type _arg[3]) \\\n  { \\\n  Get##name (_arg[0], _arg[1], _arg[2]);\\\n  } \n\n#define vtkSetVector4Macro(name,type) \\\nvoid Set##name (type _arg1, type _arg2, type _arg3, type _arg4) \\\n  { \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): setting \" << #name \" to (\" << _arg1 << \",\" << _arg2 << \",\" << _arg3 << \",\" << _arg4 << \")\\n\\n\"; \\\n  if ((name[0] != _arg1)||(name[1] != _arg2)||(name[2] != _arg3)||(name[3] != _arg4)) \\\n    { \\\n    this->Modified(); \\\n    name[0] = _arg1; \\\n    name[1] = _arg2; \\\n    name[2] = _arg3; \\\n    name[3] = _arg4; \\\n    } \\\n  }; \\\nvoid Set##name (type _arg[4]) \\\n  { \\\n  Set##name (_arg[0], _arg[1], _arg[2], _arg[3]);\\\n  } \n\n#define vtkGetVector4Macro(name,type) \\\ntype *Get##name () \\\n{ \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): returning \" << #name \" pointer \" << name << \"\\n\\n\"; \\\n  return name; \\\n} \\\nvoid Get##name (type &_arg1, type &_arg2, type &_arg3, type &_arg4) \\\n  { \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): returning \" << #name \" = (\" << _arg1 << \",\" << _arg2 << \",\" << _arg3 << \",\" << _arg4 << \")\\n\\n\"; \\\n    _arg1 = name[0]; \\\n    _arg2 = name[1]; \\\n    _arg3 = name[2]; \\\n    _arg4 = name[3]; \\\n  }; \\\nvoid Get##name (type _arg[4]) \\\n  { \\\n  Get##name (_arg[0], _arg[1], _arg[2], _arg[3]);\\\n  } \n\n\/\/\n\/\/ General set vector macro creates a single method that copies specified\n\/\/ number of values into object.\n\/\/ Examples: void SetColor(c,3)\n\/\/\n#define vtkSetVectorMacro(name,type,count) \\\nvoid Set##name(type data[]) \\\n{ \\\n  int i; \\\n  for (i=0; i<count; i++) if ( data[i] != name[i] ) break; \\\n  if ( i < count ) \\\n    { \\\n    this->Modified(); \\\n    for (i=0; i<count; i++) name[i] = data[i]; \\\n    } \\\n}\n\n\/\/\n\/\/ Get vector macro defines two methods. One returns pointer to type \n\/\/ (i.e., array of type). This is for efficiency. The second copies data\n\/\/ into user provided array. This is more object-oriented.\n\/\/ Examples: float *GetColor() and void GetColor(float c[count]).\n\/\/\n#define vtkGetVectorMacro(name,type,count) \\\ntype *Get##name () \\\n{ \\\n  if (Debug)   cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): returning \" << #name \" pointer \" << name << \"\\n\\n\"; \\\n  return name; \\\n} \\\nvoid Get##name (type data[count]) \\\n{ \\\n  for (int i=0; i<count; i++) data[i] = name[i]; \\\n}\n\n\/\/\n\/\/ This macro is used for  debug statements in instance methods\n\/\/ vtkDebugMacro(<< \"this is debug info\" << this->SomeVariable);\n\/\/\n#define vtkDebugMacro(x) \\\n  if (Debug) cerr << \"Debug: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): \" x << \"\\n\\n\"\n\n\/\/\n\/\/ This macro is used to print out warning messages.\n\/\/ vtkWarningMacro(<< \"Warning message\" << variable);\n\/\/\n#define vtkWarningMacro(x) \\\n  cerr << \"Warning: In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): \" x << \"\\n\\n\"\n\n\/\/\n\/\/ This macro is used to print out errors\n\/\/ vtkErrorMacro(<< \"Error message\" << variable);\n\/\/\n#define vtkErrorMacro(x) \\\n  cerr << \"ERROR In \" __FILE__ << \", line \" << __LINE__ << \"\\n\" << this->GetClassName() << \" (\" << this << \"): \" x << \"\\n\\n\"\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*******************************************************************************\n * include\/wx_ps_fe.hpp\n *\n * Copyright (C) 2018 Jonas Ellert <jonas.ellert@tu-dortmund.de>\n *\n * All rights reserved. Published under the BSD-2 license in the LICENSE file.\n ******************************************************************************\/\n\n#pragma once\n\n#include <vector>\n#include <thread>\n#include <sstream>\n\n#include \"arrays\/memory_types.hpp\"\n#include \"construction\/merge_external.hpp\"\n#include \"construction\/wavelet_structure.hpp\"\n#include \"construction\/wavelet_structure_external.hpp\"\n#include \"util\/permutation.hpp\"\n\n#include \"wx_base.hpp\"\n#include \"wx_dd_pc.hpp\"\n\n#define DDE_VERBOSE if constexpr (false) atomic_out()\n\n\ntemplate <typename AlphabetType, bool is_tree_, uint64_t bytesPerBlock = 1024 * 1024 * 1024>\nclass wx_dd_fe : public wx_in_out_external<true, true> {\n  static constexpr uint64_t given_block_chars = bytesPerBlock \/ sizeof(AlphabetType);\n  static constexpr uint64_t max_block_chars =\n      std::max(uint64_t(64), uint64_t(given_block_chars \/ 64 * 64));\n\n  class atomic_out {\n    std::ostringstream stream;\n  public:\n    template <typename in_type>\n    atomic_out& operator<<(const in_type& in) {\n      stream << in;\n      return *this;\n    }\n    ~atomic_out() {\n      std::cout << stream.str() << std::flush;\n    }\n  };\n\n  template <typename InputType, bool dd_verbose = false>\n  struct dd_ctx {\n    using result_type = typename wavelet_structure_external::bv_type;\n    using result_writer_type = typename result_type::bufwriter_type;\n    using text_reader_type = typename InputType::bufreader_type;\n    using parallel_algo = wx_dd_pc<AlphabetType, is_tree_>;\n\n    const uint64_t levels;\n\n    const uint64_t block_chars;\n    const uint64_t block_count;\n    const uint64_t last_block_chars;\n\n    const uint64_t block_level_words;\n    const uint64_t block_level_bits;\n    const uint64_t last_block_level_words;\n    const uint64_t last_block_level_bits;\n    const uint64_t result_level_words;\n\n    const uint64_t block_words;\n    const uint64_t block_bits;\n    const uint64_t result_words;\n\n    const std::vector<uint64_t> bit_reverse;\n\n    std::vector<AlphabetType> block_vec1;\n    std::vector<AlphabetType> block_vec2;\n    AlphabetType * frontIn = block_vec1.data();\n    AlphabetType * backIn = block_vec2.data();\n\n    std::vector<std::vector<std::vector<uint64_t>>> block_hists;\n\n    wavelet_structure * frontRes = nullptr;\n    wavelet_structure * backRes = nullptr;\n\n    text_reader_type text_reader;\n\n    result_type temp_result;\n    result_writer_type temp_result_writer;\n\n    dd_ctx(const InputType &text, const uint64_t size, const uint64_t plevels)\n        : levels(plevels),\n          block_chars(std::min(max_block_chars, size)),\n          block_count((size + block_chars - 1) \/ block_chars),\n          last_block_chars(size - ((block_count - 1) * block_chars)),\n          block_level_words((block_chars + 63) \/ 64),\n          block_level_bits(block_level_words * 64),\n          last_block_level_words((last_block_chars + 63) \/ 64),\n          last_block_level_bits(last_block_level_words * 64),\n          result_level_words(block_level_words * (block_count - 1) + last_block_level_words),\n          block_words(block_level_words * levels),\n          block_bits(block_words * 64),\n          result_words(result_level_words * levels),\n          bit_reverse(bit_reverse_permutation(levels - 1)),\n          block_vec1(block_chars),\n          block_vec2(block_chars),\n          frontIn(block_vec1.data()),\n          backIn(block_vec2.data()),\n          block_hists(block_count),\n          text_reader(text),\n          temp_result_writer(temp_result) {\n      temp_result = stxxl_files::getVectorTemporary<result_type>(1);\n      temp_result.reserve(result_words);\n      DDE_VERBOSE\n          << \"Created context for wx_dd_fe \"\n          << \"[blocks: \" << block_count << \", \"\n          << \"block_chars: \" << block_chars << \", \"\n          << \"last_block_chars: \" << last_block_chars\n          << \"].\\n\";\n    }\n\n    inline void swapInputs() {\n      std::swap(frontIn, backIn);\n    }\n\n    inline void swapResults() {\n      std::swap(frontRes, backRes);\n    }\n\n    inline void loadBackInput(uint64_t b) {\n      DDE_VERBOSE << \"(load \" << b << \" start) \";\n\n      block_hists[b].resize(levels + 1);\n      block_hists[b][0].resize(1, 0);\n      for(uint64_t l = 1; l < levels + 1; l++) {\n        block_hists[b][l].resize(block_hists[b][l - 1].size() * 2, 0);\n      }\n\n      const uint64_t current_block_chars =\n          (b + 1 < block_count) ?\n          block_chars : last_block_chars;\n\n      auto& current_block_hist = block_hists[b];\n      auto& block_hist_last_level = current_block_hist[levels];\n      \/\/read block to internal memory and calculate last level histograms\n      for(uint64_t i = 0; i < current_block_chars; i++) {\n        auto symbol = *text_reader;\n        backIn[i] = symbol;\n        ++block_hist_last_level[symbol];\n        ++text_reader;\n      }\n\n      if constexpr (is_tree_) {\n        \/\/ calculate remaining histograms\n        for (int64_t l = levels - 1; l >= 0; l--) {\n          auto &block_hist_level = current_block_hist[l];\n          auto &block_hist_level_plus = current_block_hist[l + 1];\n          for (uint64_t s = 0; s < block_hist_level.size(); s++) {\n            block_hist_level[s] =\n                block_hist_level_plus[2 * s] +\n                block_hist_level_plus[2 * s + 1];\n          }\n        }\n      } else {\n        {\n          auto &block_hist_level = current_block_hist[levels - 1];\n          auto &block_hist_level_plus = current_block_hist[levels];\n          uint64_t block_hist_level_size = block_hist_level.size();\n          for (uint64_t s = 0; s < block_hist_level_size; s++) {\n            auto rho_s = bit_reverse[s];\n            block_hist_level[rho_s] =\n                block_hist_level_plus[2 * s] +\n                block_hist_level_plus[2 * s + 1];\n          }\n        }\n        for (int64_t l = levels - 2; l >= 0; l--) {\n          auto &block_hist_level = current_block_hist[l];\n          auto &block_hist_level_plus = current_block_hist[l + 1];\n          uint64_t block_hist_level_size = block_hist_level.size();\n          for (uint64_t s = 0; s < block_hist_level_size; s++) {\n            block_hist_level[s] =\n                block_hist_level_plus[s] +\n                block_hist_level_plus[s + block_hist_level_size];\n          }\n        }\n      }\n      DDE_VERBOSE << \"(load \" << b << \" done) \";\n    }\n\n    inline void processFrontInput(uint64_t b) {\n      DDE_VERBOSE << \"(process \" << b << \" start) \";\n      const uint64_t current_block_chars =\n          (b + 1 < block_count) ?\n          block_chars : last_block_chars;\n\n      delete frontRes;\n\n      frontRes = new wavelet_structure(\n          parallel_algo::compute(\n          frontIn,\n          current_block_chars,\n          levels));\n      DDE_VERBOSE << \"(process \" << b << \" done) \";\n    }\n\n    inline void saveBackResult(uint64_t b) {\n      DDE_VERBOSE << \"(save \" << b << \" start) \";\n      const uint64_t current_block_level_words =\n          (b + 1 < block_count) ?\n          block_level_words : last_block_level_words;\n\n      auto& block_bvs = (*backRes).bvs();\n\n      for(uint64_t l = 0; l < levels; l++) {\n        for(uint64_t w = 0; w < current_block_level_words; w++) {\n          temp_result_writer << block_bvs[l][w];\n        }\n      }\n      DDE_VERBOSE << \"(save \" << b << \" done) \";\n    }\n\n    inline void finish() {\n      temp_result_writer.finish();\n      DDE_VERBOSE << \"\\n\";\n    }\n\n\n    inline void merge(wavelet_structure_external& result) {\n      DDE_VERBOSE << \"Merging... \";\n\n      auto& bvs = wavelet_structure_external_writer::bvs(result);\n      auto& zeros = wavelet_structure_external_writer::zeros(result);\n      auto& hists = wavelet_structure_external_writer::histograms(result);\n\n      external_merger merger(temp_result, bvs);\n      for(uint64_t l = 0; l < levels; l++) {\n        std::vector<uint64_t> block_offsets(block_count);\n        for(uint64_t b = 0; b < block_count - 1; b++)\n          block_offsets[b] = b * block_bits + l * block_level_bits;\n        block_offsets[block_count - 1] =\n            (block_count - 1) * block_bits +\n            l * last_block_level_bits;\n        for(uint64_t s = 0; s < block_hists[0][l].size(); s++) {\n          for (uint64_t b = 0; b < block_count; b++) {\n            auto bits_to_copy = block_hists[b][l][s];\n            auto block_offset = block_offsets[b];\n            merger.write(bits_to_copy, block_offset);\n            block_offsets[b] += bits_to_copy;\n          }\n        }\n        merger.finishLevel();\n      }\n      merger.finish();\n\n      for (uint64_t b = 0; b < block_count; ++b) {\n        if constexpr (is_tree_) hists[0][0] += block_hists[b][0][0];\n        for (uint64_t l = 1; l < levels; ++l) {\n          auto &block_hist_level = block_hists[b][l];\n          const uint64_t hist_level_size = block_hist_level.size();\n          if constexpr (is_tree_) {\n            for (uint64_t s = 0; s < hist_level_size; s++) {\n              hists[l][s] += block_hist_level[s];\n\/\/              if(s % 2 == 0) zeros[l - 1] += block_hist_level[s];\n            }\n          } else {\n            for (uint64_t s = 0; s < hist_level_size \/ 2; s++) {\n\/\/              global_hist_level[s] += block_hist_level[s];\n              zeros[l - 1] += block_hist_level[s];\n            }\n\/\/            for (uint64_t s = hist_level_size \/ 2; s < hist_level_size; s++) {\n\/\/              global_hist_level[s] += block_hist_level[s];\n\/\/            }\n          }\n        }\n      }\n      DDE_VERBOSE << \"Done.\\n\";\n    }\n  };\n\npublic:\n  static constexpr bool is_parallel = true;\n  static constexpr bool is_tree = is_tree_;\n  static constexpr uint8_t word_width = sizeof(AlphabetType);\n  static constexpr bool is_huffman_shaped = false;\n\n  template <typename InputType>\n  static wavelet_structure_external\n  compute(const InputType& text,\n          const uint64_t size,\n          const uint64_t levels) {\n    static_assert(sizeof(typename InputType::value_type) == sizeof(AlphabetType));\n\n    \/\/ create empty result\n    std::ostringstream name;\n    name << \"w\" << (is_tree_ ? \"t\" : \"m\") << \"_dd_fe\";\n    auto result =\n        wavelet_structure_external_factory(is_tree_).\n            histograms(is_tree_).zeros(!is_tree_).\n            construct(size, levels, name.str(), 0);\n    if(size == 0) return result;\n\n    wavelet_structure_external_writer::bvs(result).clear();\n\n    using ctx_t = dd_ctx<InputType>;\n    ctx_t ctx(text, size, levels);\n\n    if(ctx.block_count <= 2) {\n      for(uint64_t b = 0; b < ctx.block_count; b++) {\n        ctx.loadBackInput(b);\n        ctx.swapInputs();\n        ctx.processFrontInput(b);\n        ctx.swapResults();\n        ctx.saveBackResult(b);\n      }\n    } else {\n      \/\/ initialize:\n      \/\/   load first input block\n      \/\/   load second input block (background task)\n      ctx.loadBackInput(0);\n      ctx.swapInputs();\n      std::thread worker_loadBack([&ctx](){ctx.loadBackInput(1);});\n      \/\/ no partial result to write to disk yet\n      std::thread worker_saveBack([](){});\n\n      for(uint64_t b = 0; b < ctx.block_count - 2; b++) {\n        \/\/ process current block\n        ctx.processFrontInput(b);\n\n        \/\/ wait until next input block is loaded from disk\n        worker_loadBack.join();\n        ctx.swapInputs();\n        \/\/ load second next input block from disk (background task)\n        worker_loadBack =\n            std::thread([&ctx, b] () {ctx.loadBackInput(b + 2);});\n\n        \/\/ wait until previous result is written to disk\n        worker_saveBack.join();\n        ctx.swapResults();\n        \/\/ save current result to disk (background task)\n        worker_saveBack =\n            std::thread([&ctx, b] () {ctx.saveBackResult(b);});\n      }\n\n      ctx.processFrontInput(ctx.block_count - 2);\n      worker_loadBack.join();\n      ctx.swapInputs();\n      worker_saveBack.join();\n      ctx.swapResults();\n      \/\/ save second last result to disk (background task)\n      worker_saveBack =\n          std::thread([&ctx](){ctx.saveBackResult(ctx.block_count - 2);});\n      ctx.processFrontInput(ctx.block_count - 1);\n      worker_saveBack.join();\n      ctx.swapResults();\n      ctx.saveBackResult(ctx.block_count - 1);\n    }\n    ctx.finish();\n\n    \/\/MERGE:\n    ctx.merge(result);\n\n    return result;\n  }\n}; \/\/ class wx_ps\n\n\/******************************************************************************\/\n<commit_msg>Bug fix for wx_dd_fe<commit_after>\/*******************************************************************************\n * include\/wx_ps_fe.hpp\n *\n * Copyright (C) 2018 Jonas Ellert <jonas.ellert@tu-dortmund.de>\n *\n * All rights reserved. Published under the BSD-2 license in the LICENSE file.\n ******************************************************************************\/\n\n#pragma once\n\n#include <vector>\n#include <thread>\n#include <sstream>\n\n#include \"arrays\/memory_types.hpp\"\n#include \"construction\/merge_external.hpp\"\n#include \"construction\/wavelet_structure.hpp\"\n#include \"construction\/wavelet_structure_external.hpp\"\n#include \"util\/permutation.hpp\"\n\n#include \"wx_base.hpp\"\n#include \"wx_dd_pc.hpp\"\n\n#define DDE_VERBOSE if constexpr (false) atomic_out()\n\n\ntemplate <typename AlphabetType, bool is_tree_, uint64_t bytesPerBlock = 1024 * 1024 * 1024>\nclass wx_dd_fe : public wx_in_out_external<true, true> {\n  static constexpr uint64_t given_block_chars = bytesPerBlock \/ sizeof(AlphabetType);\n  static constexpr uint64_t max_block_chars =\n      std::max(uint64_t(64), uint64_t(given_block_chars \/ 64 * 64));\n\n  class atomic_out {\n    std::ostringstream stream;\n  public:\n    template <typename in_type>\n    atomic_out& operator<<(const in_type& in) {\n      stream << in;\n      return *this;\n    }\n    ~atomic_out() {\n      std::cout << stream.str() << std::flush;\n    }\n  };\n\n  template <typename InputType, bool dd_verbose = false>\n  struct dd_ctx {\n    using result_type = typename wavelet_structure_external::bv_type;\n    using result_writer_type = typename result_type::bufwriter_type;\n    using text_reader_type = typename InputType::bufreader_type;\n    using parallel_algo = wx_dd_pc<AlphabetType, is_tree_>;\n\n    const uint64_t levels;\n\n    const uint64_t block_chars;\n    const uint64_t block_count;\n    const uint64_t last_block_chars;\n\n    const uint64_t block_level_words;\n    const uint64_t block_level_bits;\n    const uint64_t last_block_level_words;\n    const uint64_t last_block_level_bits;\n    const uint64_t result_level_words;\n\n    const uint64_t block_words;\n    const uint64_t block_bits;\n    const uint64_t result_words;\n\n    const std::vector<uint64_t> bit_reverse;\n\n    std::vector<AlphabetType> block_vec1;\n    std::vector<AlphabetType> block_vec2;\n    AlphabetType * frontIn = block_vec1.data();\n    AlphabetType * backIn = block_vec2.data();\n\n    std::vector<std::vector<std::vector<uint64_t>>> block_hists;\n\n    wavelet_structure * frontRes = nullptr;\n    wavelet_structure * backRes = nullptr;\n\n    text_reader_type text_reader;\n\n    result_type temp_result;\n    result_writer_type temp_result_writer;\n\n    dd_ctx(const InputType &text, const uint64_t size, const uint64_t plevels)\n        : levels(plevels),\n          block_chars(std::min(max_block_chars, size)),\n          block_count((size + block_chars - 1) \/ block_chars),\n          last_block_chars(size - ((block_count - 1) * block_chars)),\n          block_level_words((block_chars + 63) \/ 64),\n          block_level_bits(block_level_words * 64),\n          last_block_level_words((last_block_chars + 63) \/ 64),\n          last_block_level_bits(last_block_level_words * 64),\n          result_level_words(block_level_words * (block_count - 1) + last_block_level_words),\n          block_words(block_level_words * levels),\n          block_bits(block_words * 64),\n          result_words(result_level_words * levels),\n          bit_reverse(bit_reverse_permutation(levels - 1)),\n          block_vec1(block_chars),\n          block_vec2(block_chars),\n          frontIn(block_vec1.data()),\n          backIn(block_vec2.data()),\n          block_hists(block_count),\n          text_reader(text),\n          temp_result_writer(temp_result) {\n      temp_result = stxxl_files::getVectorTemporary<result_type>(1);\n      temp_result.reserve(result_words);\n      DDE_VERBOSE\n          << \"Created context for wx_dd_fe \"\n          << \"[blocks: \" << block_count << \", \"\n          << \"block_chars: \" << block_chars << \", \"\n          << \"last_block_chars: \" << last_block_chars\n          << \"].\\n\";\n    }\n\n    inline void swapInputs() {\n      std::swap(frontIn, backIn);\n    }\n\n    inline void swapResults() {\n      std::swap(frontRes, backRes);\n    }\n\n    inline void loadBackInput(uint64_t b) {\n      DDE_VERBOSE << \"(load \" << b << \" start) \";\n\n      block_hists[b].resize(levels + 1);\n      block_hists[b][0].resize(1, 0);\n      for(uint64_t l = 1; l < levels + 1; l++) {\n        block_hists[b][l].resize(block_hists[b][l - 1].size() * 2, 0);\n      }\n\n      const uint64_t current_block_chars =\n          (b + 1 < block_count) ?\n          block_chars : last_block_chars;\n\n      auto& current_block_hist = block_hists[b];\n      auto& block_hist_last_level = current_block_hist[levels];\n      \/\/read block to internal memory and calculate last level histograms\n      for(uint64_t i = 0; i < current_block_chars; i++) {\n        auto symbol = *text_reader;\n        backIn[i] = symbol;\n        ++block_hist_last_level[symbol];\n        ++text_reader;\n      }\n\n      if constexpr (is_tree_) {\n        \/\/ calculate remaining histograms\n        for (int64_t l = levels - 1; l >= 0; l--) {\n          auto &block_hist_level = current_block_hist[l];\n          auto &block_hist_level_plus = current_block_hist[l + 1];\n          for (uint64_t s = 0; s < block_hist_level.size(); s++) {\n            block_hist_level[s] =\n                block_hist_level_plus[2 * s] +\n                block_hist_level_plus[2 * s + 1];\n          }\n        }\n      } else {\n        {\n          auto &block_hist_level = current_block_hist[levels - 1];\n          auto &block_hist_level_plus = current_block_hist[levels];\n          uint64_t block_hist_level_size = block_hist_level.size();\n          for (uint64_t s = 0; s < block_hist_level_size; s++) {\n            auto rho_s = bit_reverse[s];\n            block_hist_level[rho_s] =\n                block_hist_level_plus[2 * s] +\n                block_hist_level_plus[2 * s + 1];\n          }\n        }\n        for (int64_t l = levels - 2; l >= 0; l--) {\n          auto &block_hist_level = current_block_hist[l];\n          auto &block_hist_level_plus = current_block_hist[l + 1];\n          uint64_t block_hist_level_size = block_hist_level.size();\n          for (uint64_t s = 0; s < block_hist_level_size; s++) {\n            block_hist_level[s] =\n                block_hist_level_plus[s] +\n                block_hist_level_plus[s + block_hist_level_size];\n          }\n        }\n      }\n      DDE_VERBOSE << \"(load \" << b << \" done) \";\n    }\n\n    inline void processFrontInput(uint64_t b) {\n      DDE_VERBOSE << \"(process \" << b << \" start) \";\n      const uint64_t current_block_chars =\n          (b + 1 < block_count) ?\n          block_chars : last_block_chars;\n\n      delete frontRes;\n\n      frontRes = new wavelet_structure(\n          parallel_algo::compute(\n          frontIn,\n          current_block_chars,\n          levels));\n      DDE_VERBOSE << \"(process \" << b << \" done) \";\n    }\n\n    inline void saveBackResult(uint64_t b) {\n      DDE_VERBOSE << \"(save \" << b << \" start) \";\n      const uint64_t current_block_level_words =\n          (b + 1 < block_count) ?\n          block_level_words : last_block_level_words;\n\n      auto& block_bvs = (*backRes).bvs();\n\n      for(uint64_t l = 0; l < levels; l++) {\n        for(uint64_t w = 0; w < current_block_level_words; w++) {\n          temp_result_writer << block_bvs[l][w];\n        }\n      }\n      DDE_VERBOSE << \"(save \" << b << \" done) \";\n    }\n\n    inline void finish() {\n      temp_result_writer.finish();\n      DDE_VERBOSE << \"\\n\";\n    }\n\n\n    inline void merge(wavelet_structure_external& result) {\n      DDE_VERBOSE << \"Merging... \";\n\n      auto& bvs = wavelet_structure_external_writer::bvs(result);\n      auto& zeros = wavelet_structure_external_writer::zeros(result);\n      auto& hists = wavelet_structure_external_writer::histograms(result);\n\n      external_merger merger(temp_result, bvs);\n      for(uint64_t l = 0; l < levels; l++) {\n        std::vector<uint64_t> block_offsets(block_count);\n        for(uint64_t b = 0; b < block_count - 1; b++)\n          block_offsets[b] = b * block_bits + l * block_level_bits;\n        block_offsets[block_count - 1] =\n            (block_count - 1) * block_bits +\n            l * last_block_level_bits;\n        for(uint64_t s = 0; s < block_hists[0][l].size(); s++) {\n          for (uint64_t b = 0; b < block_count; b++) {\n            auto bits_to_copy = block_hists[b][l][s];\n            auto block_offset = block_offsets[b];\n            merger.write(bits_to_copy, block_offset);\n            block_offsets[b] += bits_to_copy;\n          }\n        }\n        merger.finishLevel();\n      }\n      merger.finish();\n\n      for (uint64_t b = 0; b < block_count; ++b) {\n        if constexpr (is_tree_) hists[0][0] += block_hists[b][0][0];\n        for (uint64_t l = 1; l < levels; ++l) {\n          auto &block_hist_level = block_hists[b][l];\n          const uint64_t hist_level_size = block_hist_level.size();\n          if constexpr (is_tree_) {\n            for (uint64_t s = 0; s < hist_level_size; s++) {\n              hists[l][s] += block_hist_level[s];\n\/\/              if(s % 2 == 0) zeros[l - 1] += block_hist_level[s];\n            }\n          } else {\n            for (uint64_t s = 0; s < hist_level_size \/ 2; s++) {\n\/\/              global_hist_level[s] += block_hist_level[s];\n              zeros[l - 1] += block_hist_level[s];\n            }\n\/\/            for (uint64_t s = hist_level_size \/ 2; s < hist_level_size; s++) {\n\/\/              global_hist_level[s] += block_hist_level[s];\n\/\/            }\n          }\n        }\n      }\n      DDE_VERBOSE << \"Done.\\n\";\n    }\n  };\n\npublic:\n  static constexpr bool is_parallel = true;\n  static constexpr bool is_tree = is_tree_;\n  static constexpr uint8_t word_width = sizeof(AlphabetType);\n  static constexpr bool is_huffman_shaped = false;\n\n  template <typename InputType>\n  static wavelet_structure_external\n  compute(const InputType& text,\n          const uint64_t size,\n          const uint64_t levels) {\n    static_assert(sizeof(typename InputType::value_type) == sizeof(AlphabetType));\n\n    \/\/ create empty result\n    std::ostringstream name;\n    name << \"w\" << (is_tree_ ? \"t\" : \"m\") << \"_dd_fe\";\n    auto result =\n        wavelet_structure_external_factory(is_tree_).\n            histograms(is_tree_).zeros(!is_tree_).\n            construct(size, levels, name.str(), 0);\n    if(size == 0) return result;\n\n    wavelet_structure_external_writer::bvs(result).clear();\n\n    using ctx_t = dd_ctx<InputType>;\n    ctx_t ctx(text, size, levels);\n\n    if(ctx.block_count < 2) {\n      for(uint64_t b = 0; b < ctx.block_count; b++) {\n        ctx.loadBackInput(b);\n        ctx.swapInputs();\n        ctx.processFrontInput(b);\n        ctx.swapResults();\n        ctx.saveBackResult(b);\n      }\n    } else {\n      \/\/ initialize:\n      \/\/   load first input block\n      \/\/   load second input block (background task)\n      ctx.loadBackInput(0);\n      ctx.swapInputs();\n      std::thread worker_loadBack([&ctx](){ctx.loadBackInput(1);});\n      \/\/ no partial result to write to disk yet\n      std::thread worker_saveBack([](){});\n\n      for(uint64_t b = 0; b < ctx.block_count - 2; b++) {\n        \/\/ process current block\n        ctx.processFrontInput(b);\n\n        \/\/ wait until next input block is loaded from disk\n        worker_loadBack.join();\n        ctx.swapInputs();\n        \/\/ load second next input block from disk (background task)\n        worker_loadBack =\n            std::thread([&ctx, b] () {ctx.loadBackInput(b + 2);});\n\n        \/\/ wait until previous result is written to disk\n        worker_saveBack.join();\n        ctx.swapResults();\n        \/\/ save current result to disk (background task)\n        worker_saveBack =\n            std::thread([&ctx, b] () {ctx.saveBackResult(b);});\n      }\n\n      ctx.processFrontInput(ctx.block_count - 2);\n      worker_loadBack.join();\n      ctx.swapInputs();\n      worker_saveBack.join();\n      ctx.swapResults();\n      \/\/ save second last result to disk (background task)\n      worker_saveBack =\n          std::thread([&ctx](){ctx.saveBackResult(ctx.block_count - 2);});\n      ctx.processFrontInput(ctx.block_count - 1);\n      worker_saveBack.join();\n      ctx.swapResults();\n      ctx.saveBackResult(ctx.block_count - 1);\n    }\n    ctx.finish();\n\n    \/\/MERGE:\n    ctx.merge(result);\n\n    return result;\n  }\n}; \/\/ class wx_ps\n\n\/******************************************************************************\/\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Marked db dirty aber loading packages<commit_after><|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <SDL2\/SDL.h>\n#include <cassert>\n\n#include <sdlinputwrapper\/sdlinputwrapper.h>\n#include <memory>\n\n#include \"device.h\"\n#include <sdlinputwrapper\/callback.h>\n\nenum SampleInputActions\n{\n    SampleDown,\n    Shoot,\n    CHANGE_CTX,\n\n    GAME_QUIT\n};\n\nenum SampleContext\n{\n    GameMod,\n    Game,\n    Menu,\n\n    MAX_COUNT\n};\n\nvoid func()\n{\n    std::cout << \"raw c function\" << std::endl;\n}\n\nvoid sdlKeyEvent(const SDL_Event& e, sdli::Interface& device)\n{\n    device.push(sdli::InputType::Keyboard, e.key.keysym.scancode, e.key.state);\n}\n\n#include \"stub.h\"\n\nint main(int argc, char** argv)\n{\n\/\/    std::setbuf(stdout, NULL); \/\/ used to always flush std::cout\n\n    auto sdl_init_status = SDL_Init(SDL_INIT_EVENTS\n                                     | SDL_INIT_JOYSTICK\n                                     | SDL_INIT_GAMECONTROLLER);\n    assert(sdl_init_status==0);\n\n    bool sampleQuit = false;\n\n    auto inputproc = std::unique_ptr<sdli::Processor>(new sdli::Processor(SampleContext::MAX_COUNT));\n    auto& device = inputproc->getDevice(sdli::InputType::Keyboard, 0);\n    auto& pad = inputproc->getDevice(sdli::InputType::Gamecontroller, 0);\n\n    \/** BEG Mappings **\/\n\n    auto ctx1 = inputproc->createContext(SampleContext::GameMod);\n    auto ctx2 = inputproc->createContext(SampleContext::Game);\n\n    ctx1->mapDigital(SDL_SCANCODE_S, SampleInputActions::SampleDown);\n\n    ctx2->mapDigital(SDL_SCANCODE_S, SampleInputActions::SampleDown);\n\n    ctx1->mapDigital(SDL_SCANCODE_F1, SampleInputActions::CHANGE_CTX);\n    ctx2->mapDigital(SDL_SCANCODE_F1, SampleInputActions::CHANGE_CTX);\n\n    ctx1->mapDigital(SDL_CONTROLLER_BUTTON_A, SampleInputActions::SampleDown);\n    ctx1->mapDigital(SDL_CONTROLLER_BUTTON_X, SampleInputActions::CHANGE_CTX);\n\n    ctx2->mapDigital(SDL_CONTROLLER_BUTTON_X, SampleInputActions::CHANGE_CTX);\n    ctx2->mapDigital(SDL_SCANCODE_ESCAPE, SampleInputActions::GAME_QUIT);\n\n    auto l = []()\n    {\n        std::cout << \"Hello\";\n    };\n    ctx1->addCallback(SampleInputActions::SampleDown, sdli::CallType::OnPress, l);\n\n    auto l2 = [ctx1, ctx2, &device, &pad]()\n    {\n        device.popContext();\n        device.pushContext(ctx2);\n\n        pad.popContext();\n        pad.pushContext(ctx2);\n        std::cout << \"swap to ctx2 while hold\" << std::endl;\n    };\n\n    ctx2->addCallback(SampleInputActions::GAME_QUIT, sdli::CallType::OnPress, [&sampleQuit](){\n        sampleQuit = true;\n    });\n\n    ctx1->addCallback(SampleInputActions::CHANGE_CTX, sdli::CallType::OnPress, l2);\n\n    ctx2->addCallback(SampleInputActions::CHANGE_CTX, sdli::CallType::OnRelease, [=, &device, &pad]()\n    {\n        device.popContext();\n        device.pushContext(ctx1);\n\n        pad.popContext();\n        pad.pushContext(ctx1);\n        std::cout << \"change back to ctx1 - released\" << std::endl;\n    });\n\n    ctx2->addCallback(SampleInputActions::SampleDown, sdli::CallType::OnPress, &func);\n\n    ctx1->addCallback(SampleInputActions::SampleDown, sdli::CallType::OnRelease, []()\n    {\n        std::cout << \" World\" << std::endl;\n    });\n\n    \/** END Mappings **\/\n\n\n    SDL_Window* w = SDL_CreateWindow(\"SampleWindow\", 0, 0, 256, 256, SDL_WindowFlags::SDL_WINDOW_SHOWN|SDL_WindowFlags::SDL_WINDOW_OPENGL);\n\n    auto sdl_glContext = SDL_GL_CreateContext(w);\n\n    device.pushContext(ctx1);\n    pad.pushContext(ctx1);\n\n\n    SDL_Event event;\n    while(!sampleQuit)\n    {\n        while(SDL_PollEvent(&event))\n        {\n            switch(event.type)\n            {\n            case SDL_QUIT:\n                sampleQuit = true;\n                break;\n            }\n\/\/            inputproc->handleSdlEvents(event);\n        }\n\/\/        device.poll();\n\/\/        pad.poll();\n\n        inputproc->poll();\n\n\/\/        device.dispatch();\n\/\/        pad.dispatch();\n\n        SDL_GL_SwapWindow(w);\n    }\n\n    SDL_GL_DeleteContext(sdl_glContext);\n    SDL_DestroyWindow(w);\n    return 0;\n}\n<commit_msg>Update sample<commit_after>#include <iostream>\n#include <SDL2\/SDL.h>\n#include <cassert>\n\n#include <sdlinputwrapper\/sdlinputwrapper.h>\n#include <memory>\n\n#include \"device.h\"\n#include <sdlinputwrapper\/callback.h>\n\nenum SampleInputActions\n{\n    SampleDown,\n    Shoot,\n    CHANGE_CTX,\n\n    GAME_QUIT\n};\n\nenum SampleContext\n{\n    GameMod,\n    Game,\n    Menu,\n\n    MAX_COUNT\n};\n\nvoid func()\n{\n    std::cout << \"raw c function\" << std::endl;\n}\n\nvoid sdlKeyEvent(const SDL_Event& e, sdli::Interface& device)\n{\n    device.push(sdli::InputType::Keyboard, e.key.keysym.scancode, e.key.state);\n}\n\n#include \"stub.h\"\n\nint main(int argc, char** argv)\n{\n\/\/    std::setbuf(stdout, NULL); \/\/ used to always flush std::cout\n\n    auto sdl_init_status = SDL_Init(SDL_INIT_EVENTS\n                                     | SDL_INIT_JOYSTICK\n                                     | SDL_INIT_GAMECONTROLLER);\n    assert(sdl_init_status==0);\n\n    bool sampleQuit = false;\n\n    auto inputproc = std::unique_ptr<sdli::Processor>(new sdli::Processor(SampleContext::MAX_COUNT));\n    auto& device = inputproc->getDevice(sdli::InputType::Keyboard, 0);\n    auto& pad = inputproc->getDevice(sdli::InputType::Gamecontroller, 0);\n\n    \/** BEG Mappings **\/\n\n    auto ctx1 = inputproc->createContext(SampleContext::GameMod);\n    auto ctx2 = inputproc->createContext(SampleContext::Game);\n\n    ctx1->mapDigital(SDL_SCANCODE_S, SampleInputActions::SampleDown);\n\n    ctx2->mapDigital(SDL_SCANCODE_S, SampleInputActions::SampleDown);\n\n    ctx1->mapDigital(SDL_SCANCODE_F1, SampleInputActions::CHANGE_CTX);\n    ctx2->mapDigital(SDL_SCANCODE_F1, SampleInputActions::CHANGE_CTX);\n\n    ctx1->mapDigital(SDL_CONTROLLER_BUTTON_A, SampleInputActions::SampleDown);\n    ctx1->mapDigital(SDL_CONTROLLER_BUTTON_X, SampleInputActions::CHANGE_CTX);\n\n    ctx2->mapDigital(SDL_CONTROLLER_BUTTON_X, SampleInputActions::CHANGE_CTX);\n    ctx2->mapDigital(SDL_SCANCODE_ESCAPE, SampleInputActions::GAME_QUIT);\n\n    auto l = []()\n    {\n        std::cout << \"Hello\";\n    };\n    ctx1->addCallback(SampleInputActions::SampleDown, sdli::CallType::OnPress, l);\n\n    auto l2 = [ctx1, ctx2, &device, &pad]()\n    {\n        device.popContext();\n        device.pushContext(ctx2);\n\n        pad.popContext();\n        pad.pushContext(ctx2);\n        std::cout << \"swap to ctx2 while hold\" << std::endl;\n    };\n\n    ctx2->addCallback(SampleInputActions::GAME_QUIT, sdli::CallType::OnPress, [&sampleQuit](){\n        sampleQuit = true;\n    });\n\n    ctx1->addCallback(SampleInputActions::CHANGE_CTX, sdli::CallType::OnPress, l2);\n\n    ctx2->addCallback(SampleInputActions::CHANGE_CTX, sdli::CallType::OnRelease, [=, &device, &pad]()\n    {\n        device.popContext();\n        device.pushContext(ctx1);\n\n        pad.popContext();\n        pad.pushContext(ctx1);\n        std::cout << \"change back to ctx1 - released\" << std::endl;\n    });\n\n    ctx2->addCallback(SampleInputActions::SampleDown, sdli::CallType::OnPress, &func);\n\n    ctx1->addCallback(SampleInputActions::SampleDown, sdli::CallType::OnRelease, []()\n    {\n        std::cout << \" World\" << std::endl;\n    });\n\n    \/** END Mappings **\/\n\n\n    SDL_Window* w = SDL_CreateWindow(\"SampleWindow\", 0, 0, 256, 256, SDL_WindowFlags::SDL_WINDOW_SHOWN|SDL_WindowFlags::SDL_WINDOW_OPENGL);\n\n    auto sdl_glContext = SDL_GL_CreateContext(w);\n\n    device.pushContext(ctx1);\n    pad.pushContext(ctx1);\n\n\n    SDL_Event event;\n    while(!sampleQuit)\n    {\n        while(SDL_PollEvent(&event))\n        {\n            switch(event.type)\n            {\n            case SDL_QUIT:\n                sampleQuit = true;\n                break;\n            }\n            inputproc->handleSdlEvents(event);\n        }\n\/\/        device.poll();\n\/\/        pad.poll();\n\n        inputproc->poll();\n\n        device.dispatch();\n\/\/        pad.dispatch();\n\n        SDL_GL_SwapWindow(w);\n    }\n\n    SDL_GL_DeleteContext(sdl_glContext);\n    SDL_DestroyWindow(w);\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2015-2019 Dubalu 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 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 \"database_utils.h\"\n\n#include <algorithm>                                 \/\/ for count, replace\n#include <chrono>                                    \/\/ for seconds, duration_cast\n#include <cstdio>                                    \/\/ for snprintf, size_t\n#include <cstring>                                   \/\/ for strlen\n#include <fcntl.h>                                   \/\/ for O_CLOEXEC, O_CREAT, O_RDONLY\n#include <sys\/stat.h>                                \/\/ for stat\n\n#include \"base_x.hh\"                                 \/\/ for base62\n#include \"cast.h\"                                    \/\/ for Cast\n#include \"exception.h\"                               \/\/ for ClientError, MSG_ClientError\n#include \"io.hh\"                                     \/\/ for close, open, read, write\n#include \"length.h\"                                  \/\/ for serialise_length and unserialise_length\n#include \"log.h\"                                     \/\/ for L_DATABASE\n#include \"opts.h\"                                    \/\/ for opts\n#include \"rapidjson\/document.h\"                      \/\/ for Document, GenericDocument\n#include \"rapidjson\/error\/en.h\"                      \/\/ for GetParseError_En\n#include \"rapidjson\/error\/error.h\"                   \/\/ for ParseResult\n#include \"schema.h\"                                  \/\/ for FieldType\n#include \"serialise.h\"                               \/\/ for Serialise\n#include \"storage.h\"                                 \/\/ for STORAGE_BIN_HEADER_MAGIC and STORAGE_BIN_FOOTER_MAGIC\n\n\nstd::string prefixed(std::string_view term, std::string_view field_prefix, char field_type)\n{\n\tstd::string result;\n\tresult.reserve(field_prefix.size() + term.size() + 1);\n\tresult.assign(field_prefix).push_back(field_type);\n\tresult.append(term);\n\treturn result;\n}\n\n\nXapian::valueno get_slot(std::string_view field_prefix, char field_type)\n{\n\tauto slot = static_cast<Xapian::valueno>(xxh32::hash(std::string(field_prefix) + field_type));\n\tif (slot < DB_SLOT_RESERVED) {\n\t\tslot += DB_SLOT_RESERVED;\n\t} else if (slot == Xapian::BAD_VALUENO) {\n\t\tslot = 0xfffffffe;\n\t}\n\treturn slot;\n}\n\n\nstd::string get_prefix(unsigned long long field_number)\n{\n\treturn serialise_length(field_number);\n}\n\n\nstd::string get_prefix(std::string_view field_name)\n{\n\t\/\/ Mask 0x1fffff for maximum length prefix of 4.\n\treturn serialise_length(xxh32::hash(field_name) & 0x1fffff);\n}\n\n\nstd::string normalize_uuid(std::string_view uuid)\n{\n\treturn Unserialise::uuid(Serialise::uuid(uuid), static_cast<UUIDRepr>(opts.uuid_repr));\n}\n\n\nstd::string normalize_uuid(const std::string& uuid) {\n\treturn normalize_uuid(std::string_view(uuid));\n}\n\n\nMsgPack normalize_uuid(const MsgPack& uuid)\n{\n\tif (uuid.is_string()) {\n\t\treturn normalize_uuid(uuid.str_view());\n\t}\n\treturn uuid;\n}\n\n\nint read_uuid(std::string_view dir, std::array<unsigned char, 16>& uuid)\n{\n\tauto sdir = std::string(dir);\n\tL_DATABASE(\"+ READING UUID OF INDEX '{}'...\", sdir);\n\n\tstruct stat info;\n\tif ((::stat(sdir.c_str(), &info) != 0) || ((info.st_mode & S_IFDIR) == 0)) {\n\t\tL_DATABASE(\"- NO DATABASE INDEX '{}'\", sdir);\n\t\treturn -1;\n\t}\n\n\tint fd = io::open((sdir + \"\/iamglass\").c_str(), O_RDONLY | O_CLOEXEC);\n\tif (fd == -1) {\n\t\tL_DATABASE(\"- NO DATABASE INDEX '{}'\", sdir);\n\t\treturn -1;\n\t}\n\n\tchar bytes[32];\n\tsize_t length = io::read(fd, bytes, 32);\n\tio::close(fd);\n\tif (length == 32) {\n\t\tstd::copy(bytes + 16, bytes + 32, uuid.begin());\n\t\treturn 0;\n\t}\n\n\treturn -1;\n}\n\n\nvoid json_load(rapidjson::Document& doc, std::string_view str)\n{\n\trapidjson::ParseResult parse_done = doc.Parse<rapidjson::kParseCommentsFlag | rapidjson::kParseTrailingCommasFlag>(str.data(), str.size());\n\tif (!parse_done) {\n\t\tconstexpr size_t tabsize = 3;\n\t\tstd::string tabs(tabsize, ' ');\n\t\tauto offset = parse_done.Offset();\n\t\tchar buffer[20];\n\t\tauto a = str.substr(0, offset);\n\t\tauto line = std::count(a.begin(), a.end(), '\\n') + 1;\n\t\tif (line > 1) {\n\t\t\tauto f = a.rfind(\"\\n\");\n\t\t\tif (f != std::string::npos) {\n\t\t\t\ta = a.substr(f + 1);\n\t\t\t}\n\t\t}\n\t\tsnprintf(buffer, sizeof(buffer), \"%zu. \", line);\n\t\tauto b = str.substr(offset);\n\t\tb = b.substr(0, b.find(\"\\n\"));\n\t\tauto tsz = std::count(a.begin(), a.end(), '\\t');\n\t\tauto col = a.size() + 1;\n\t\tauto sz = col - 1 - tsz + tsz * tabsize;\n\t\tstd::string snippet(buffer);\n\t\tauto indent = sz + snippet.size();\n\t\tsnippet.append(a);\n\t\tsnippet.append(b);\n\t\tsnippet.push_back('\\n');\n\t\tsnippet.append(indent, ' ');\n\t\tsnippet.push_back('^');\n\t\tsize_t p = 0;\n\t\twhile ((p = snippet.find(\"\\t\", p)) != std::string::npos) {\n\t\t\tsnippet.replace(p, 1, tabs);\n\t\t\t++p;\n\t\t}\n\t\tTHROW(ClientError, \"JSON parse error at line {}, col: {} : {}\\n{}\", line, col, GetParseError_En(parse_done.Code()), snippet);\n\t}\n}\n\n\nrapidjson::Document to_json(std::string_view str)\n{\n\trapidjson::Document doc;\n\tjson_load(doc, str);\n\treturn doc;\n}\n\n\nstd::string msgpack_to_html(const msgpack::object& o)\n{\n\tif (o.type == msgpack::type::MAP) {\n\t\tstd::string key_tag_head = \"<dt>\";\n\t\tstd::string key_tag_tail = \"<\/dt>\";\n\n\t\tstd::string html = \"<dl>\";\n\t\tconst msgpack::object_kv* pend(o.via.map.ptr + o.via.map.size);\n\t\tfor (auto p = o.via.map.ptr; p != pend; ++p) {\n\t\t\tif (p->key.type == msgpack::type::STR) { \/* check if it is valid numeric as a key *\/\n\t\t\t\thtml += key_tag_head + std::string(p->key.via.str.ptr, p->key.via.str.size) + key_tag_tail;\n\t\t\t\thtml += msgpack_map_value_to_html(p->val);\n\t\t\t} else if (p->key.type == msgpack::type::POSITIVE_INTEGER) {\n\t\t\t\thtml += key_tag_head + std::to_string(p->key.via.u64) + key_tag_tail;\n\t\t\t\thtml += msgpack_map_value_to_html(p->val);\n\t\t\t} else if (p->key.type == msgpack::type::NEGATIVE_INTEGER) {\n\t\t\t\thtml += key_tag_head + std::to_string(p->key.via.i64) + key_tag_tail;\n\t\t\t\thtml += msgpack_map_value_to_html(p->val);\n\t\t\t} else if (p->key.type == msgpack::type::FLOAT) {\n\t\t\t\thtml += key_tag_head + std::to_string(p->key.via.f64) + key_tag_tail;\n\t\t\t\thtml += msgpack_map_value_to_html(p->val);\n\t\t\t}\n\t\t\t \/* other types are ignored (boolean included)*\/\n\t\t}\n\t\thtml += \"<\/dl>\";\n\t\treturn html;\n\t}\n\n\tif (o.type == msgpack::type::ARRAY) {\n\t\tstd::string term_tag_head = \"<li>\";\n\t\tstd::string term_tag_tail = \"<\/li>\";\n\n\t\tstd::string html = \"<ol>\";\n\t\tconst msgpack::object* pend(o.via.array.ptr + o.via.array.size);\n\t\tfor (auto p = o.via.array.ptr; p != pend; ++p) {\n\t\t\tif (p->type == msgpack::type::STR) {\n\t\t\t\thtml += term_tag_head + std::string(p->via.str.ptr, p->via.str.size) + term_tag_tail;\n\t\t\t} else if(p->type == msgpack::type::POSITIVE_INTEGER) {\n\t\t\t\thtml += term_tag_head + std::to_string(p->via.u64) + term_tag_tail;\n\t\t\t} else if (p->type == msgpack::type::NEGATIVE_INTEGER) {\n\t\t\t\thtml += term_tag_head + std::to_string(p->via.i64) + term_tag_tail;\n\t\t\t} else if (p->type == msgpack::type::FLOAT) {\n\t\t\t\thtml += term_tag_head + std::to_string(p->via.f64) + term_tag_tail;\n\t\t\t} else if (p->type == msgpack::type::BOOLEAN) {\n\t\t\t\tstd::string boolean_str;\n\t\t\t\tif (p->via.boolean) {\n\t\t\t\t\tboolean_str = \"True\";\n\t\t\t\t} else {\n\t\t\t\t\tboolean_str = \"False\";\n\t\t\t\t}\n\t\t\t\thtml += term_tag_head + boolean_str + term_tag_head;\n\t\t\t} else if (p->type == msgpack::type::MAP or p->type == msgpack::type::ARRAY) {\n\t\t\t\thtml += term_tag_head + msgpack_to_html(*p) + term_tag_head;\n\t\t\t}\n\t\t}\n\t\thtml += \"<\/ol>\";\n\t\treturn html;\n\t}\n\n\tif (o.type == msgpack::type::STR) {\n\t\treturn std::string(o.via.str.ptr, o.via.str.size);\n\t}\n\n\tif (o.type == msgpack::type::POSITIVE_INTEGER) {\n\t\treturn std::to_string(o.via.u64);\n\t}\n\n\tif (o.type == msgpack::type::NEGATIVE_INTEGER) {\n\t\treturn std::to_string(o.via.i64);\n\t}\n\n\tif (o.type == msgpack::type::FLOAT) {\n\t\treturn std::to_string(o.via.f64);\n\t}\n\n\tif (o.type == msgpack::type::BOOLEAN) {\n\t\treturn o.via.boolean ? \"True\" : \"False\";\n\t}\n\n\treturn \"\";\n}\n\n\nstd::string msgpack_map_value_to_html(const msgpack::object& o)\n{\n\tstd::string tag_head = \"<dd>\";\n\tstd::string tag_tail = \"<\/dd>\";\n\n\tif (o.type == msgpack::type::STR) {\n\t\treturn tag_head + std::string(o.via.str.ptr, o.via.str.size) + tag_tail;\n\t}\n\n\tif (o.type == msgpack::type::POSITIVE_INTEGER) {\n\t\treturn tag_head + std::to_string(o.via.u64) + tag_tail;\n\t}\n\n\tif (o.type == msgpack::type::NEGATIVE_INTEGER) {\n\t\treturn tag_head + std::to_string(o.via.i64) + tag_tail;\n\t}\n\n\tif (o.type == msgpack::type::FLOAT) {\n\t\treturn tag_head + std::to_string(o.via.f64) + tag_tail;\n\t}\n\n\tif (o.type == msgpack::type::BOOLEAN) {\n\t\treturn o.via.boolean ? tag_head + \"True\" +  tag_tail : tag_head + \"False\" + tag_tail;\n\t}\n\n\tif (o.type == msgpack::type::MAP or o.type == msgpack::type::ARRAY) {\n\t\treturn tag_head + msgpack_to_html(o) + tag_tail;\n\t}\n\n\treturn \"\";\n}\n\n\nstd::string msgpack_to_html_error(const msgpack::object& o)\n{\n\tstd::string html;\n\tif (o.type == msgpack::type::MAP) {\n\t\tconst msgpack::object_kv* pend(o.via.map.ptr + o.via.map.size);\n\t\tint c = 0;\n\t\thtml += \"<h1>\";\n\t\tfor (auto p = o.via.map.ptr; p != pend; ++p, ++c) {\n\t\t\tif (p->key.type == msgpack::type::STR) {\n\t\t\t\tif (p->val.type == msgpack::type::STR) {\n\t\t\t\t\tif (c != 0) { html += \" - \"; }\n\t\t\t\t\thtml += std::string(p->val.via.str.ptr, p->val.via.str.size);\n\t\t\t\t} else if (p->val.type == msgpack::type::POSITIVE_INTEGER) {\n\t\t\t\t\tif (c != 0) { html += \" - \"; }\n\t\t\t\t\thtml += std::to_string(p->val.via.u64);\n\t\t\t\t} else if (p->val.type == msgpack::type::NEGATIVE_INTEGER) {\n\t\t\t\t\tif (c != 0) { html += \" - \"; }\n\t\t\t\t\thtml += std::to_string(p->val.via.i64);\n\t\t\t\t} else if (p->val.type == msgpack::type::FLOAT) {\n\t\t\t\t\tif (c != 0) { html += \" - \"; }\n\t\t\t\t\thtml += std::to_string(p->val.via.f64);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\thtml += \"<\/h1>\";\n\t}\n\n\treturn html;\n}\n\n\nvoid split_path_id(std::string_view path_id, std::string_view& path, std::string_view& id)\n{\n\tstd::size_t found = path_id.find_last_of('\/');\n\tif (found != std::string::npos) {\n\t\tpath = path_id.substr(0, found);\n\t\tid = path_id.substr(found + 1);\n\t} else {\n\t\tpath = \"\";\n\t\tid = \"\";\n\t}\n}\n<commit_msg>Using RapidJSON now default relaxed flags<commit_after>\/*\n * Copyright (c) 2015-2019 Dubalu 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 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 \"database_utils.h\"\n\n#include <algorithm>                                 \/\/ for count, replace\n#include <chrono>                                    \/\/ for seconds, duration_cast\n#include <cstdio>                                    \/\/ for snprintf, size_t\n#include <cstring>                                   \/\/ for strlen\n#include <fcntl.h>                                   \/\/ for O_CLOEXEC, O_CREAT, O_RDONLY\n#include <sys\/stat.h>                                \/\/ for stat\n\n#include \"base_x.hh\"                                 \/\/ for base62\n#include \"cast.h\"                                    \/\/ for Cast\n#include \"exception.h\"                               \/\/ for ClientError, MSG_ClientError\n#include \"io.hh\"                                     \/\/ for close, open, read, write\n#include \"length.h\"                                  \/\/ for serialise_length and unserialise_length\n#include \"log.h\"                                     \/\/ for L_DATABASE\n#include \"opts.h\"                                    \/\/ for opts\n#include \"rapidjson\/document.h\"                      \/\/ for Document, GenericDocument\n#include \"rapidjson\/error\/en.h\"                      \/\/ for GetParseError_En\n#include \"rapidjson\/error\/error.h\"                   \/\/ for ParseResult\n#include \"schema.h\"                                  \/\/ for FieldType\n#include \"serialise.h\"                               \/\/ for Serialise\n#include \"storage.h\"                                 \/\/ for STORAGE_BIN_HEADER_MAGIC and STORAGE_BIN_FOOTER_MAGIC\n\n\nstd::string prefixed(std::string_view term, std::string_view field_prefix, char field_type)\n{\n\tstd::string result;\n\tresult.reserve(field_prefix.size() + term.size() + 1);\n\tresult.assign(field_prefix).push_back(field_type);\n\tresult.append(term);\n\treturn result;\n}\n\n\nXapian::valueno get_slot(std::string_view field_prefix, char field_type)\n{\n\tauto slot = static_cast<Xapian::valueno>(xxh32::hash(std::string(field_prefix) + field_type));\n\tif (slot < DB_SLOT_RESERVED) {\n\t\tslot += DB_SLOT_RESERVED;\n\t} else if (slot == Xapian::BAD_VALUENO) {\n\t\tslot = 0xfffffffe;\n\t}\n\treturn slot;\n}\n\n\nstd::string get_prefix(unsigned long long field_number)\n{\n\treturn serialise_length(field_number);\n}\n\n\nstd::string get_prefix(std::string_view field_name)\n{\n\t\/\/ Mask 0x1fffff for maximum length prefix of 4.\n\treturn serialise_length(xxh32::hash(field_name) & 0x1fffff);\n}\n\n\nstd::string normalize_uuid(std::string_view uuid)\n{\n\treturn Unserialise::uuid(Serialise::uuid(uuid), static_cast<UUIDRepr>(opts.uuid_repr));\n}\n\n\nstd::string normalize_uuid(const std::string& uuid) {\n\treturn normalize_uuid(std::string_view(uuid));\n}\n\n\nMsgPack normalize_uuid(const MsgPack& uuid)\n{\n\tif (uuid.is_string()) {\n\t\treturn normalize_uuid(uuid.str_view());\n\t}\n\treturn uuid;\n}\n\n\nint read_uuid(std::string_view dir, std::array<unsigned char, 16>& uuid)\n{\n\tauto sdir = std::string(dir);\n\tL_DATABASE(\"+ READING UUID OF INDEX '{}'...\", sdir);\n\n\tstruct stat info;\n\tif ((::stat(sdir.c_str(), &info) != 0) || ((info.st_mode & S_IFDIR) == 0)) {\n\t\tL_DATABASE(\"- NO DATABASE INDEX '{}'\", sdir);\n\t\treturn -1;\n\t}\n\n\tint fd = io::open((sdir + \"\/iamglass\").c_str(), O_RDONLY | O_CLOEXEC);\n\tif (fd == -1) {\n\t\tL_DATABASE(\"- NO DATABASE INDEX '{}'\", sdir);\n\t\treturn -1;\n\t}\n\n\tchar bytes[32];\n\tsize_t length = io::read(fd, bytes, 32);\n\tio::close(fd);\n\tif (length == 32) {\n\t\tstd::copy(bytes + 16, bytes + 32, uuid.begin());\n\t\treturn 0;\n\t}\n\n\treturn -1;\n}\n\n\nvoid json_load(rapidjson::Document& doc, std::string_view str)\n{\n\trapidjson::ParseResult parse_done = doc.Parse(str.data(), str.size());\n\tif (!parse_done) {\n\t\tconstexpr size_t tabsize = 3;\n\t\tstd::string tabs(tabsize, ' ');\n\t\tauto offset = parse_done.Offset();\n\t\tchar buffer[20];\n\t\tauto a = str.substr(0, offset);\n\t\tauto line = std::count(a.begin(), a.end(), '\\n') + 1;\n\t\tif (line > 1) {\n\t\t\tauto f = a.rfind(\"\\n\");\n\t\t\tif (f != std::string::npos) {\n\t\t\t\ta = a.substr(f + 1);\n\t\t\t}\n\t\t}\n\t\tsnprintf(buffer, sizeof(buffer), \"%zu. \", line);\n\t\tauto b = str.substr(offset);\n\t\tb = b.substr(0, b.find(\"\\n\"));\n\t\tauto tsz = std::count(a.begin(), a.end(), '\\t');\n\t\tauto col = a.size() + 1;\n\t\tauto sz = col - 1 - tsz + tsz * tabsize;\n\t\tstd::string snippet(buffer);\n\t\tauto indent = sz + snippet.size();\n\t\tsnippet.append(a);\n\t\tsnippet.append(b);\n\t\tsnippet.push_back('\\n');\n\t\tsnippet.append(indent, ' ');\n\t\tsnippet.push_back('^');\n\t\tsize_t p = 0;\n\t\twhile ((p = snippet.find(\"\\t\", p)) != std::string::npos) {\n\t\t\tsnippet.replace(p, 1, tabs);\n\t\t\t++p;\n\t\t}\n\t\tTHROW(ClientError, \"JSON parse error at line {}, col: {} : {}\\n{}\", line, col, GetParseError_En(parse_done.Code()), snippet);\n\t}\n}\n\n\nrapidjson::Document to_json(std::string_view str)\n{\n\trapidjson::Document doc;\n\tjson_load(doc, str);\n\treturn doc;\n}\n\n\nstd::string msgpack_to_html(const msgpack::object& o)\n{\n\tif (o.type == msgpack::type::MAP) {\n\t\tstd::string key_tag_head = \"<dt>\";\n\t\tstd::string key_tag_tail = \"<\/dt>\";\n\n\t\tstd::string html = \"<dl>\";\n\t\tconst msgpack::object_kv* pend(o.via.map.ptr + o.via.map.size);\n\t\tfor (auto p = o.via.map.ptr; p != pend; ++p) {\n\t\t\tif (p->key.type == msgpack::type::STR) { \/* check if it is valid numeric as a key *\/\n\t\t\t\thtml += key_tag_head + std::string(p->key.via.str.ptr, p->key.via.str.size) + key_tag_tail;\n\t\t\t\thtml += msgpack_map_value_to_html(p->val);\n\t\t\t} else if (p->key.type == msgpack::type::POSITIVE_INTEGER) {\n\t\t\t\thtml += key_tag_head + std::to_string(p->key.via.u64) + key_tag_tail;\n\t\t\t\thtml += msgpack_map_value_to_html(p->val);\n\t\t\t} else if (p->key.type == msgpack::type::NEGATIVE_INTEGER) {\n\t\t\t\thtml += key_tag_head + std::to_string(p->key.via.i64) + key_tag_tail;\n\t\t\t\thtml += msgpack_map_value_to_html(p->val);\n\t\t\t} else if (p->key.type == msgpack::type::FLOAT) {\n\t\t\t\thtml += key_tag_head + std::to_string(p->key.via.f64) + key_tag_tail;\n\t\t\t\thtml += msgpack_map_value_to_html(p->val);\n\t\t\t}\n\t\t\t \/* other types are ignored (boolean included)*\/\n\t\t}\n\t\thtml += \"<\/dl>\";\n\t\treturn html;\n\t}\n\n\tif (o.type == msgpack::type::ARRAY) {\n\t\tstd::string term_tag_head = \"<li>\";\n\t\tstd::string term_tag_tail = \"<\/li>\";\n\n\t\tstd::string html = \"<ol>\";\n\t\tconst msgpack::object* pend(o.via.array.ptr + o.via.array.size);\n\t\tfor (auto p = o.via.array.ptr; p != pend; ++p) {\n\t\t\tif (p->type == msgpack::type::STR) {\n\t\t\t\thtml += term_tag_head + std::string(p->via.str.ptr, p->via.str.size) + term_tag_tail;\n\t\t\t} else if(p->type == msgpack::type::POSITIVE_INTEGER) {\n\t\t\t\thtml += term_tag_head + std::to_string(p->via.u64) + term_tag_tail;\n\t\t\t} else if (p->type == msgpack::type::NEGATIVE_INTEGER) {\n\t\t\t\thtml += term_tag_head + std::to_string(p->via.i64) + term_tag_tail;\n\t\t\t} else if (p->type == msgpack::type::FLOAT) {\n\t\t\t\thtml += term_tag_head + std::to_string(p->via.f64) + term_tag_tail;\n\t\t\t} else if (p->type == msgpack::type::BOOLEAN) {\n\t\t\t\tstd::string boolean_str;\n\t\t\t\tif (p->via.boolean) {\n\t\t\t\t\tboolean_str = \"True\";\n\t\t\t\t} else {\n\t\t\t\t\tboolean_str = \"False\";\n\t\t\t\t}\n\t\t\t\thtml += term_tag_head + boolean_str + term_tag_head;\n\t\t\t} else if (p->type == msgpack::type::MAP or p->type == msgpack::type::ARRAY) {\n\t\t\t\thtml += term_tag_head + msgpack_to_html(*p) + term_tag_head;\n\t\t\t}\n\t\t}\n\t\thtml += \"<\/ol>\";\n\t\treturn html;\n\t}\n\n\tif (o.type == msgpack::type::STR) {\n\t\treturn std::string(o.via.str.ptr, o.via.str.size);\n\t}\n\n\tif (o.type == msgpack::type::POSITIVE_INTEGER) {\n\t\treturn std::to_string(o.via.u64);\n\t}\n\n\tif (o.type == msgpack::type::NEGATIVE_INTEGER) {\n\t\treturn std::to_string(o.via.i64);\n\t}\n\n\tif (o.type == msgpack::type::FLOAT) {\n\t\treturn std::to_string(o.via.f64);\n\t}\n\n\tif (o.type == msgpack::type::BOOLEAN) {\n\t\treturn o.via.boolean ? \"True\" : \"False\";\n\t}\n\n\treturn \"\";\n}\n\n\nstd::string msgpack_map_value_to_html(const msgpack::object& o)\n{\n\tstd::string tag_head = \"<dd>\";\n\tstd::string tag_tail = \"<\/dd>\";\n\n\tif (o.type == msgpack::type::STR) {\n\t\treturn tag_head + std::string(o.via.str.ptr, o.via.str.size) + tag_tail;\n\t}\n\n\tif (o.type == msgpack::type::POSITIVE_INTEGER) {\n\t\treturn tag_head + std::to_string(o.via.u64) + tag_tail;\n\t}\n\n\tif (o.type == msgpack::type::NEGATIVE_INTEGER) {\n\t\treturn tag_head + std::to_string(o.via.i64) + tag_tail;\n\t}\n\n\tif (o.type == msgpack::type::FLOAT) {\n\t\treturn tag_head + std::to_string(o.via.f64) + tag_tail;\n\t}\n\n\tif (o.type == msgpack::type::BOOLEAN) {\n\t\treturn o.via.boolean ? tag_head + \"True\" +  tag_tail : tag_head + \"False\" + tag_tail;\n\t}\n\n\tif (o.type == msgpack::type::MAP or o.type == msgpack::type::ARRAY) {\n\t\treturn tag_head + msgpack_to_html(o) + tag_tail;\n\t}\n\n\treturn \"\";\n}\n\n\nstd::string msgpack_to_html_error(const msgpack::object& o)\n{\n\tstd::string html;\n\tif (o.type == msgpack::type::MAP) {\n\t\tconst msgpack::object_kv* pend(o.via.map.ptr + o.via.map.size);\n\t\tint c = 0;\n\t\thtml += \"<h1>\";\n\t\tfor (auto p = o.via.map.ptr; p != pend; ++p, ++c) {\n\t\t\tif (p->key.type == msgpack::type::STR) {\n\t\t\t\tif (p->val.type == msgpack::type::STR) {\n\t\t\t\t\tif (c != 0) { html += \" - \"; }\n\t\t\t\t\thtml += std::string(p->val.via.str.ptr, p->val.via.str.size);\n\t\t\t\t} else if (p->val.type == msgpack::type::POSITIVE_INTEGER) {\n\t\t\t\t\tif (c != 0) { html += \" - \"; }\n\t\t\t\t\thtml += std::to_string(p->val.via.u64);\n\t\t\t\t} else if (p->val.type == msgpack::type::NEGATIVE_INTEGER) {\n\t\t\t\t\tif (c != 0) { html += \" - \"; }\n\t\t\t\t\thtml += std::to_string(p->val.via.i64);\n\t\t\t\t} else if (p->val.type == msgpack::type::FLOAT) {\n\t\t\t\t\tif (c != 0) { html += \" - \"; }\n\t\t\t\t\thtml += std::to_string(p->val.via.f64);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\thtml += \"<\/h1>\";\n\t}\n\n\treturn html;\n}\n\n\nvoid split_path_id(std::string_view path_id, std::string_view& path, std::string_view& id)\n{\n\tstd::size_t found = path_id.find_last_of('\/');\n\tif (found != std::string::npos) {\n\t\tpath = path_id.substr(0, found);\n\t\tid = path_id.substr(found + 1);\n\t} else {\n\t\tpath = \"\";\n\t\tid = \"\";\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"motor\/multirotor_quad_x_motor_mapper.hpp\"\n\n#include <array>\n#include <cstddef>\n#include \"protocol\/messages.hpp\"\n\nMultirotorQuadXMotorMapper::MultirotorQuadXMotorMapper(PWMDeviceGroup<4>& motors, Communicator& communicator)\n  : motors(motors),\n    throttleStream(communicator, 10) {\n}\n\nvoid MultirotorQuadXMotorMapper::run(bool armed, actuator_setpoint_t& input) {\n  \/\/ Calculate output shifts\n  \/\/ TODO(yoos): comment on motor indexing convention starting from positive\n  \/\/ X in counterclockwise order.\n  std::array<float, 4> output_shifts = {\n      1.0f * input.roll_sp - 1.0f * input.pitch_sp + 1.0f * input.yaw_sp,   \/\/ front left\n      1.0f * input.roll_sp + 1.0f * input.pitch_sp - 1.0f * input.yaw_sp,   \/\/ back left\n    - 1.0f * input.roll_sp + 1.0f * input.pitch_sp + 1.0f * input.yaw_sp,   \/\/ back right\n    - 1.0f * input.roll_sp - 1.0f * input.pitch_sp - 1.0f * input.yaw_sp    \/\/ front right\n  };\n\n  \/\/ Add throttle to shifts to get absolute output value\n  std::array<float, 4> outputs;\n  for(std::size_t i = 0; i < 4; i++) {\n    outputs[i] = input.throttle_sp + output_shifts[i];\n  }\n\n  motors.set(armed, outputs);\n\n  if(throttleStream.ready()) {\n    protocol::message::motor_throttle_message_t msg;\n\n    for(std::size_t i = 0; i < 4; i++) {\n      msg.throttles[i] = outputs[i];\n    }\n\n    throttleStream.publish(msg);\n  }\n}\n<commit_msg>Use universal initialization when possible.<commit_after>#include \"motor\/multirotor_quad_x_motor_mapper.hpp\"\n\n#include <array>\n#include <cstddef>\n#include \"protocol\/messages.hpp\"\n\nMultirotorQuadXMotorMapper::MultirotorQuadXMotorMapper(PWMDeviceGroup<4>& motors, Communicator& communicator)\n  : motors(motors),\n    throttleStream(communicator, 10) {\n}\n\nvoid MultirotorQuadXMotorMapper::run(bool armed, actuator_setpoint_t& input) {\n  \/\/ Calculate output shifts\n  \/\/ TODO(yoos): comment on motor indexing convention starting from positive\n  \/\/ X in counterclockwise order.\n  std::array<float, 4> output_shifts {\n      1.0f * input.roll_sp - 1.0f * input.pitch_sp + 1.0f * input.yaw_sp,   \/\/ front left\n      1.0f * input.roll_sp + 1.0f * input.pitch_sp - 1.0f * input.yaw_sp,   \/\/ back left\n    - 1.0f * input.roll_sp + 1.0f * input.pitch_sp + 1.0f * input.yaw_sp,   \/\/ back right\n    - 1.0f * input.roll_sp - 1.0f * input.pitch_sp - 1.0f * input.yaw_sp    \/\/ front right\n  };\n\n  \/\/ Add throttle to shifts to get absolute output value\n  std::array<float, 4> outputs;\n  for(std::size_t i = 0; i < 4; i++) {\n    outputs[i] = input.throttle_sp + output_shifts[i];\n  }\n\n  motors.set(armed, outputs);\n\n  if(throttleStream.ready()) {\n    protocol::message::motor_throttle_message_t msg;\n\n    for(std::size_t i = 0; i < 4; i++) {\n      msg.throttles[i] = outputs[i];\n    }\n\n    throttleStream.publish(msg);\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 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\/\/ Author: jmaessen@google.com (Jan-Willem Maessen)\n\n#include <limits.h>\n#include <algorithm>\n#include <vector>\n#include \"base\/logging.h\"\n#include \"net\/instaweb\/util\/public\/basictypes.h\"\n#include \"net\/instaweb\/util\/public\/fast_wildcard_group.h\"\n#include \"net\/instaweb\/util\/public\/rolling_hash.h\"\n#include \"net\/instaweb\/util\/public\/stl_util.h\"\n#include \"net\/instaweb\/util\/public\/string.h\"\n#include \"net\/instaweb\/util\/public\/string_util.h\"\n#include \"net\/instaweb\/util\/public\/wildcard.h\"\n\nnamespace net_instaweb {\n\nnamespace {\n\/\/ Don't generate a hash unless there are this many\n\/\/ non-wildcard-only patterns.\nconst int kMinPatterns = 10;\n\n\/\/ Special index value for unused hash table entry.\nconst int kNoEntry = -1;\n\nStringPiece LongestLiteralStringInWildcard(const Wildcard* wildcard) {\n  StringPiece spec = wildcard->spec();\n  const char kWildcardChars[] = { Wildcard::kMatchAny, Wildcard::kMatchOne };\n  StringPiece wildcardChars(kWildcardChars, arraysize(kWildcardChars));\n  int longest_pos = 0;\n  int longest_len = 0;\n  int next_wildcard = 0;\n  for (int pos = 0;\n       pos < static_cast<int>(spec.size()); pos = next_wildcard + 1) {\n    next_wildcard = spec.find_first_of(wildcardChars, pos);\n    if (next_wildcard == static_cast<int>(StringPiece::npos)) {\n      next_wildcard = spec.size();\n    }\n    int len = next_wildcard - pos;\n    if (len > longest_len) {\n      longest_pos = pos;\n      longest_len = len;\n    }\n  }\n  return spec.substr(longest_pos, longest_len);\n}\n\n}  \/\/ namespace\n\nFastWildcardGroup::~FastWildcardGroup() {\n  Clear();\n}\n\nvoid FastWildcardGroup::Uncompile() {\n  if (rolling_hash_length_ == kUncompiled) {\n    return;\n  }\n  rolling_hashes_.clear();\n  effective_indices_.clear();\n  wildcard_only_indices_.clear();\n  pattern_hash_index_.clear();\n}\n\nvoid FastWildcardGroup::Clear() {\n  Uncompile();\n  STLDeleteElements(&wildcards_);\n  allow_.clear();\n}\n\ninline int& FastWildcardGroup::pattern_hash_index(uint64 rolling_hash) const {\n  \/\/ We exploit the fact that pattern_hash_index.size() is a power of two\n  \/\/ to do integer modulus by bit masking.\n  return pattern_hash_index_[rolling_hash & (pattern_hash_index_.size() - 1)];\n}\n\nvoid FastWildcardGroup::CompileNonTrivial() const {\n  \/\/ First, assemble longest literal strings of each pattern\n  std::vector<StringPiece> longest_literal_strings;\n  int num_nontrivial_patterns = 0;\n  rolling_hash_length_ = INT_MAX;\n  for (int i = 0; i < static_cast<int>(wildcards_.size()); ++i) {\n    longest_literal_strings.push_back(\n        LongestLiteralStringInWildcard(wildcards_[i]));\n    CHECK_EQ(i + 1, static_cast<int>(longest_literal_strings.size()));\n    int length = longest_literal_strings[i].size();\n    if (length > 0) {\n      ++num_nontrivial_patterns;\n      rolling_hash_length_ = std::min(rolling_hash_length_, length);\n    }\n  }\n  if (num_nontrivial_patterns < kMinPatterns) {\n    \/\/ Not enough non-trivial patterns.  Don't compile.\n    rolling_hash_length_ = kDontHash;\n    return;\n  }\n  CHECK_LT(0, rolling_hash_length_);\n  CHECK_GT(INT_MAX, rolling_hash_length_);\n  \/\/ Allocate a hash table that's power-of-2 sized and >=\n  \/\/ 2*num_nontrivial_patterns.\n  int hash_index_size;\n  for (hash_index_size = 8;\n       hash_index_size < 2 * num_nontrivial_patterns;\n       hash_index_size *= 2) { }\n  pattern_hash_index_.resize(hash_index_size, kNoEntry);\n  rolling_hashes_.resize(wildcards_.size());\n  effective_indices_.resize(allow_.size());\n  int current_effective_index = allow_.size() - 1;\n  int current_allow = allow_[current_effective_index];\n  \/\/ Fill in the hash table with a rolling hash.  We do this in\n  \/\/ reverse order so that collisions will result in the later\n  \/\/ pattern being matched first (if that succeeds, no further\n  \/\/ matching will be required).\n  for (int i = longest_literal_strings.size() - 1; i >= 0; --i) {\n    const StringPiece literal(longest_literal_strings[i]);\n    if (allow_[i] != current_allow) {\n      \/\/ Change from allow to deny or vice versa;\n      \/\/ change the current effective index and allow state.\n      current_effective_index = i;\n      current_allow = allow_[i];\n    }\n    effective_indices_[i] = current_effective_index;\n    CHECK_LE(i, current_effective_index);\n    CHECK_EQ(allow_[i], current_allow);\n    CHECK_EQ(current_allow, allow_[effective_indices_[i]]);\n    if (literal.size() == 0) {\n      \/\/ All-wildcard pattern.\n      wildcard_only_indices_.push_back(i);\n      rolling_hashes_[i] = 0;\n    } else {\n      CHECK_GE(static_cast<int>(literal.size()), rolling_hash_length_);\n      \/\/ If possible, find a non-colliding rolling hash taken from literal.  If\n      \/\/ the first hash collides, using a different hash is OK; we'll still end\n      \/\/ up checking both matches in the table for an input that matches both.\n      \/\/ The goal is to avoid chaining by spreading the entries out across the\n      \/\/ table.\n      \/\/ TODO(jmaessen): Consider re-hashing the current entry as well on\n      \/\/ collision to favor collision-free hash tables.\n      int max_start = literal.size() - rolling_hash_length_;\n      int start = 0;\n      uint64 rolling_hash =\n          RollingHash(literal.data(), start, rolling_hash_length_);\n      for (start = 1;\n           start <= max_start && pattern_hash_index(rolling_hash) != kNoEntry;\n           ++start) {\n        rolling_hash = NextRollingHash(literal.data(), start,\n                                       rolling_hash_length_, rolling_hash);\n      }\n      \/\/ Now insert the entry, dealing with any collisions.\n      rolling_hashes_[i] = rolling_hash;\n      while (pattern_hash_index(rolling_hash) != kNoEntry) {\n        ++rolling_hash;\n      }\n      pattern_hash_index(rolling_hash) = i;\n    }\n  }\n}\n\nvoid FastWildcardGroup::Compile() const {\n  \/\/ Basic invariant\n  CHECK_EQ(wildcards_.size(), allow_.size());\n  \/\/ Make sure we don't have cruft left around from a previous compile.\n  CHECK_EQ(0, static_cast<int>(rolling_hashes_.size()));\n  CHECK_EQ(0, static_cast<int>(effective_indices_.size()));\n  CHECK_EQ(0, static_cast<int>(wildcard_only_indices_.size()));\n  CHECK_EQ(0, static_cast<int>(pattern_hash_index_.size()));\n  CHECK_EQ(kUncompiled, rolling_hash_length_);\n\n  \/\/ Fast path for small groups\n  if (static_cast<int>(wildcards_.size()) < kMinPatterns) {\n    rolling_hash_length_ = kDontHash;\n  } else {\n    CompileNonTrivial();\n  }\n\n  \/\/ When we're done, things should be in a sensible state.\n  CHECK_NE(kUncompiled, rolling_hash_length_);\n  if (rolling_hash_length_ == kDontHash) {\n    CHECK_EQ(0, static_cast<int>(rolling_hashes_.size()));\n    CHECK_EQ(0, static_cast<int>(effective_indices_.size()));\n    CHECK_EQ(0, static_cast<int>(wildcard_only_indices_.size()));\n    CHECK_EQ(0, static_cast<int>(pattern_hash_index_.size()));\n  } else {\n    CHECK_EQ(wildcards_.size(), rolling_hashes_.size());\n    CHECK_EQ(wildcards_.size(), effective_indices_.size());\n    int hash_pats = wildcards_.size() - wildcard_only_indices_.size();\n    CHECK_LE(kMinPatterns, hash_pats);\n    CHECK_LE(2 * hash_pats, static_cast<int>(pattern_hash_index_.size()));\n    CHECK_LT(0, rolling_hash_length_);\n  }\n}\n\nvoid FastWildcardGroup::Allow(const StringPiece& expr) {\n  Uncompile();\n  Wildcard* wildcard = new Wildcard(expr);\n  wildcards_.push_back(wildcard);\n  allow_.push_back(true);\n}\n\nvoid FastWildcardGroup::Disallow(const StringPiece& expr) {\n  Uncompile();\n  Wildcard* wildcard = new Wildcard(expr);\n  wildcards_.push_back(wildcard);\n  allow_.push_back(false);\n}\n\nbool FastWildcardGroup::Match(const StringPiece& str, bool allow) const {\n  if (rolling_hash_length_ == kUncompiled) {\n    Compile();\n  }\n  if (rolling_hash_length_ == kDontHash) {\n    \/\/ Set of wildcards is small.\n    \/\/ Just match against each pattern in reverse order (starting with most\n    \/\/ recent, which overrides less recent), returning when a match succeeds.\n    for (int i = wildcards_.size() - 1; i >= 0; --i) {\n      if (wildcards_[i]->Match(str)) {\n        return allow_[i];\n      }\n    }\n    return allow;\n  }\n  int max_effective_index = kNoEntry;\n  \/\/ Start by matching against all-wildcard patterns in reverse order,\n  \/\/ stopping if a match is found (since earlier matches will have\n  \/\/ a smaller index and be overridden by the already-found match).\n  \/\/ TODO(jmaessen): These patterns all devolve to\n  \/\/ a string length check (== or >=).  Consider optimizing them.\n  for (int i = wildcard_only_indices_.size() - 1; i >= 0; --i) {\n    int index = wildcard_only_indices_[i];\n    if (wildcards_[index]->Match(str)) {\n      max_effective_index = effective_indices_[index];\n      break;\n    }\n  }\n  int rolling_end = str.size() - rolling_hash_length_;\n  if (rolling_end >= 0) {\n    \/\/ Do a Rabin-Karp rolling match through the string.\n    uint64 rolling_hash = RollingHash(str.data(), 0, rolling_hash_length_);\n    int exit_effective_index = wildcards_.size() - 1;\n      \/\/ Uses signed arithmetic for correct comparison below.\n    for (int ofs = 0;\n         max_effective_index < exit_effective_index && ofs <= rolling_end; ) {\n      \/\/ Look up rolling_hash in table, stopping if we find a:\n      \/\/   1) Smaller index than max_effective_index\n      \/\/   2) Matching string (update max_effective_index).\n      \/\/ In either case, all subsequent hash matches will be overridden by\n      \/\/ max_effective_index, so we need not search the bucket anymore.  This is\n      \/\/ guaranteed by the order of table insertion (largest index first)\n      \/\/ and the fact that later smaller colliding entries are further along\n      \/\/ in the linear probe.  This is true even if intervening slots are\n      \/\/ occupied by entries with completely different hash values - those\n      \/\/ entries will still have larger indices as they were inserted earlier.\n      for (uint64 probe = 0; ; ++probe) {\n        \/\/ The following invariant (and thus loop termination) should be\n        \/\/ guaranteed by the sparseness of pattern_hash_index_.\n        DCHECK_GT(pattern_hash_index_.size(), probe);\n        int index = pattern_hash_index(rolling_hash + probe);\n        if (index <= max_effective_index) {\n          \/\/ This also includes the kNoEntry case.\n          break;\n        }\n        if (rolling_hash == rolling_hashes_[index] &&\n            wildcards_[index]->Match(str)) {\n          max_effective_index = effective_indices_[index];\n          break;\n        }\n      }\n      if (++ofs <= rolling_end) {\n        rolling_hash = NextRollingHash(str.data(), ofs, rolling_hash_length_,\n                                       rolling_hash);\n      }\n    }\n  }\n  if (max_effective_index == kNoEntry) {\n    return allow;\n  } else {\n    return allow_[max_effective_index];\n  }\n}\n\nvoid FastWildcardGroup::CopyFrom(const FastWildcardGroup& src) {\n  Clear();\n  AppendFrom(src);\n}\n\nvoid FastWildcardGroup::AppendFrom(const FastWildcardGroup& src) {\n  CHECK_EQ(src.wildcards_.size(), src.allow_.size());\n  for (int i = 0, n = src.wildcards_.size(); i < n; ++i) {\n    wildcards_.push_back(src.wildcards_[i]->Duplicate());\n    allow_.push_back(src.allow_[i]);\n  }\n}\n\nGoogleString FastWildcardGroup::Signature() const {\n  GoogleString signature;\n  for (int i = 0, n = wildcards_.size(); i < n; ++i) {\n    StrAppend(&signature, wildcards_[i]->spec(), (allow_[i] ? \"A\" : \"D\"), \",\");\n  }\n  return signature;\n}\n\n}  \/\/ namespace net_instaweb\n<commit_msg>Try to fix problem with Win32 build of util_core (which is  used by libpagespeed). <commit_after>\/*\n * Copyright 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\/\/ Author: jmaessen@google.com (Jan-Willem Maessen)\n\n#include <limits.h>\n#include <algorithm>\n#include <vector>\n#include \"base\/logging.h\"\n#include \"net\/instaweb\/util\/public\/basictypes.h\"\n#include \"net\/instaweb\/util\/public\/fast_wildcard_group.h\"\n#include \"net\/instaweb\/util\/public\/rolling_hash.h\"\n#include \"net\/instaweb\/util\/public\/stl_util.h\"\n#include \"net\/instaweb\/util\/public\/string.h\"\n#include \"net\/instaweb\/util\/public\/string_util.h\"\n#include \"net\/instaweb\/util\/public\/wildcard.h\"\n\nnamespace net_instaweb {\n\nnamespace {\n\/\/ Don't generate a hash unless there are this many\n\/\/ non-wildcard-only patterns.\nconst int kMinPatterns = 10;\n\n\/\/ Special index value for unused hash table entry.\nconst int kNoEntry = -1;\n\nStringPiece LongestLiteralStringInWildcard(const Wildcard* wildcard) {\n  StringPiece spec = wildcard->spec();\n  const char kWildcardChars[] = { Wildcard::kMatchAny, Wildcard::kMatchOne };\n  StringPiece wildcardChars(kWildcardChars, arraysize(kWildcardChars));\n  int longest_pos = 0;\n  int longest_len = 0;\n  int next_wildcard = 0;\n  for (int pos = 0;\n       pos < static_cast<int>(spec.size()); pos = next_wildcard + 1) {\n    next_wildcard = spec.find_first_of(wildcardChars, pos);\n    if (next_wildcard == static_cast<int>(StringPiece::npos)) {\n      next_wildcard = spec.size();\n    }\n    int len = next_wildcard - pos;\n    if (len > longest_len) {\n      longest_pos = pos;\n      longest_len = len;\n    }\n  }\n  return spec.substr(longest_pos, longest_len);\n}\n\n}  \/\/ namespace\n\nFastWildcardGroup::~FastWildcardGroup() {\n  Clear();\n}\n\nvoid FastWildcardGroup::Uncompile() {\n  if (rolling_hash_length_ == kUncompiled) {\n    return;\n  }\n  rolling_hashes_.clear();\n  effective_indices_.clear();\n  wildcard_only_indices_.clear();\n  pattern_hash_index_.clear();\n}\n\nvoid FastWildcardGroup::Clear() {\n  Uncompile();\n  STLDeleteElements(&wildcards_);\n  allow_.clear();\n}\n\ninline int& FastWildcardGroup::pattern_hash_index(uint64 rolling_hash) const {\n  \/\/ We exploit the fact that pattern_hash_index.size() is a power of two\n  \/\/ to do integer modulus by bit masking.\n  return pattern_hash_index_[rolling_hash & (pattern_hash_index_.size() - 1)];\n}\n\nvoid FastWildcardGroup::CompileNonTrivial() const {\n  \/\/ First, assemble longest literal strings of each pattern\n  std::vector<StringPiece> longest_literal_strings;\n  int num_nontrivial_patterns = 0;\n  rolling_hash_length_ = INT_MAX;\n  for (int i = 0; i < static_cast<int>(wildcards_.size()); ++i) {\n    longest_literal_strings.push_back(\n        LongestLiteralStringInWildcard(wildcards_[i]));\n    CHECK_EQ(i + 1, static_cast<int>(longest_literal_strings.size()));\n    int length = longest_literal_strings[i].size();\n    if (length > 0) {\n      ++num_nontrivial_patterns;\n      rolling_hash_length_ = std::min(rolling_hash_length_, length);\n    }\n  }\n  if (num_nontrivial_patterns < kMinPatterns) {\n    \/\/ Not enough non-trivial patterns.  Don't compile.\n    rolling_hash_length_ = kDontHash;\n    return;\n  }\n  CHECK_LT(0, rolling_hash_length_);\n  CHECK_GT(INT_MAX, rolling_hash_length_);\n  \/\/ Allocate a hash table that's power-of-2 sized and >=\n  \/\/ 2*num_nontrivial_patterns.\n  int hash_index_size;\n  for (hash_index_size = 8;\n       hash_index_size < 2 * num_nontrivial_patterns;\n       hash_index_size *= 2) { }\n  pattern_hash_index_.resize(hash_index_size, kNoEntry);\n  rolling_hashes_.resize(wildcards_.size());\n  effective_indices_.resize(allow_.size());\n  int current_effective_index = allow_.size() - 1;\n  bool current_allow = allow_[current_effective_index];\n  \/\/ Fill in the hash table with a rolling hash.  We do this in\n  \/\/ reverse order so that collisions will result in the later\n  \/\/ pattern being matched first (if that succeeds, no further\n  \/\/ matching will be required).\n  for (int i = longest_literal_strings.size() - 1; i >= 0; --i) {\n    const StringPiece literal(longest_literal_strings[i]);\n    if (allow_[i] != current_allow) {\n      \/\/ Change from allow to deny or vice versa;\n      \/\/ change the current effective index and allow state.\n      current_effective_index = i;\n      current_allow = allow_[i];\n    }\n    effective_indices_[i] = current_effective_index;\n    CHECK_LE(i, current_effective_index);\n    CHECK_EQ(allow_[i], current_allow);\n    CHECK_EQ(current_allow, allow_[effective_indices_[i]]);\n    if (literal.size() == 0) {\n      \/\/ All-wildcard pattern.\n      wildcard_only_indices_.push_back(i);\n      rolling_hashes_[i] = 0;\n    } else {\n      CHECK_GE(static_cast<int>(literal.size()), rolling_hash_length_);\n      \/\/ If possible, find a non-colliding rolling hash taken from literal.  If\n      \/\/ the first hash collides, using a different hash is OK; we'll still end\n      \/\/ up checking both matches in the table for an input that matches both.\n      \/\/ The goal is to avoid chaining by spreading the entries out across the\n      \/\/ table.\n      \/\/ TODO(jmaessen): Consider re-hashing the current entry as well on\n      \/\/ collision to favor collision-free hash tables.\n      int max_start = literal.size() - rolling_hash_length_;\n      int start = 0;\n      uint64 rolling_hash =\n          RollingHash(literal.data(), start, rolling_hash_length_);\n      for (start = 1;\n           start <= max_start && pattern_hash_index(rolling_hash) != kNoEntry;\n           ++start) {\n        rolling_hash = NextRollingHash(literal.data(), start,\n                                       rolling_hash_length_, rolling_hash);\n      }\n      \/\/ Now insert the entry, dealing with any collisions.\n      rolling_hashes_[i] = rolling_hash;\n      while (pattern_hash_index(rolling_hash) != kNoEntry) {\n        ++rolling_hash;\n      }\n      pattern_hash_index(rolling_hash) = i;\n    }\n  }\n}\n\nvoid FastWildcardGroup::Compile() const {\n  \/\/ Basic invariant\n  CHECK_EQ(wildcards_.size(), allow_.size());\n  \/\/ Make sure we don't have cruft left around from a previous compile.\n  CHECK_EQ(0, static_cast<int>(rolling_hashes_.size()));\n  CHECK_EQ(0, static_cast<int>(effective_indices_.size()));\n  CHECK_EQ(0, static_cast<int>(wildcard_only_indices_.size()));\n  CHECK_EQ(0, static_cast<int>(pattern_hash_index_.size()));\n  CHECK_EQ(kUncompiled, rolling_hash_length_);\n\n  \/\/ Fast path for small groups\n  if (static_cast<int>(wildcards_.size()) < kMinPatterns) {\n    rolling_hash_length_ = kDontHash;\n  } else {\n    CompileNonTrivial();\n  }\n\n  \/\/ When we're done, things should be in a sensible state.\n  CHECK_NE(kUncompiled, rolling_hash_length_);\n  if (rolling_hash_length_ == kDontHash) {\n    CHECK_EQ(0, static_cast<int>(rolling_hashes_.size()));\n    CHECK_EQ(0, static_cast<int>(effective_indices_.size()));\n    CHECK_EQ(0, static_cast<int>(wildcard_only_indices_.size()));\n    CHECK_EQ(0, static_cast<int>(pattern_hash_index_.size()));\n  } else {\n    CHECK_EQ(wildcards_.size(), rolling_hashes_.size());\n    CHECK_EQ(wildcards_.size(), effective_indices_.size());\n    int hash_pats = wildcards_.size() - wildcard_only_indices_.size();\n    CHECK_LE(kMinPatterns, hash_pats);\n    CHECK_LE(2 * hash_pats, static_cast<int>(pattern_hash_index_.size()));\n    CHECK_LT(0, rolling_hash_length_);\n  }\n}\n\nvoid FastWildcardGroup::Allow(const StringPiece& expr) {\n  Uncompile();\n  Wildcard* wildcard = new Wildcard(expr);\n  wildcards_.push_back(wildcard);\n  allow_.push_back(true);\n}\n\nvoid FastWildcardGroup::Disallow(const StringPiece& expr) {\n  Uncompile();\n  Wildcard* wildcard = new Wildcard(expr);\n  wildcards_.push_back(wildcard);\n  allow_.push_back(false);\n}\n\nbool FastWildcardGroup::Match(const StringPiece& str, bool allow) const {\n  if (rolling_hash_length_ == kUncompiled) {\n    Compile();\n  }\n  if (rolling_hash_length_ == kDontHash) {\n    \/\/ Set of wildcards is small.\n    \/\/ Just match against each pattern in reverse order (starting with most\n    \/\/ recent, which overrides less recent), returning when a match succeeds.\n    for (int i = wildcards_.size() - 1; i >= 0; --i) {\n      if (wildcards_[i]->Match(str)) {\n        return allow_[i];\n      }\n    }\n    return allow;\n  }\n  int max_effective_index = kNoEntry;\n  \/\/ Start by matching against all-wildcard patterns in reverse order,\n  \/\/ stopping if a match is found (since earlier matches will have\n  \/\/ a smaller index and be overridden by the already-found match).\n  \/\/ TODO(jmaessen): These patterns all devolve to\n  \/\/ a string length check (== or >=).  Consider optimizing them.\n  for (int i = wildcard_only_indices_.size() - 1; i >= 0; --i) {\n    int index = wildcard_only_indices_[i];\n    if (wildcards_[index]->Match(str)) {\n      max_effective_index = effective_indices_[index];\n      break;\n    }\n  }\n  int rolling_end = str.size() - rolling_hash_length_;\n  if (rolling_end >= 0) {\n    \/\/ Do a Rabin-Karp rolling match through the string.\n    uint64 rolling_hash = RollingHash(str.data(), 0, rolling_hash_length_);\n    int exit_effective_index = wildcards_.size() - 1;\n      \/\/ Uses signed arithmetic for correct comparison below.\n    for (int ofs = 0;\n         max_effective_index < exit_effective_index && ofs <= rolling_end; ) {\n      \/\/ Look up rolling_hash in table, stopping if we find a:\n      \/\/   1) Smaller index than max_effective_index\n      \/\/   2) Matching string (update max_effective_index).\n      \/\/ In either case, all subsequent hash matches will be overridden by\n      \/\/ max_effective_index, so we need not search the bucket anymore.  This is\n      \/\/ guaranteed by the order of table insertion (largest index first)\n      \/\/ and the fact that later smaller colliding entries are further along\n      \/\/ in the linear probe.  This is true even if intervening slots are\n      \/\/ occupied by entries with completely different hash values - those\n      \/\/ entries will still have larger indices as they were inserted earlier.\n      for (uint64 probe = 0; ; ++probe) {\n        \/\/ The following invariant (and thus loop termination) should be\n        \/\/ guaranteed by the sparseness of pattern_hash_index_.\n        DCHECK_GT(pattern_hash_index_.size(), probe);\n        int index = pattern_hash_index(rolling_hash + probe);\n        if (index <= max_effective_index) {\n          \/\/ This also includes the kNoEntry case.\n          break;\n        }\n        if (rolling_hash == rolling_hashes_[index] &&\n            wildcards_[index]->Match(str)) {\n          max_effective_index = effective_indices_[index];\n          break;\n        }\n      }\n      if (++ofs <= rolling_end) {\n        rolling_hash = NextRollingHash(str.data(), ofs, rolling_hash_length_,\n                                       rolling_hash);\n      }\n    }\n  }\n  if (max_effective_index == kNoEntry) {\n    return allow;\n  } else {\n    return allow_[max_effective_index];\n  }\n}\n\nvoid FastWildcardGroup::CopyFrom(const FastWildcardGroup& src) {\n  Clear();\n  AppendFrom(src);\n}\n\nvoid FastWildcardGroup::AppendFrom(const FastWildcardGroup& src) {\n  CHECK_EQ(src.wildcards_.size(), src.allow_.size());\n  for (int i = 0, n = src.wildcards_.size(); i < n; ++i) {\n    wildcards_.push_back(src.wildcards_[i]->Duplicate());\n    allow_.push_back(src.allow_[i]);\n  }\n}\n\nGoogleString FastWildcardGroup::Signature() const {\n  GoogleString signature;\n  for (int i = 0, n = wildcards_.size(); i < n; ++i) {\n    StrAppend(&signature, wildcards_[i]->spec(), (allow_[i] ? \"A\" : \"D\"), \",\");\n  }\n  return signature;\n}\n\n}  \/\/ namespace net_instaweb\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Finished writing membership tests<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>Pull in r185616 from llvm trunk:<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2012 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 \"compilation_unit.h\"\n\n#include \"constants.h\"\n#include \"ir_builder.h\"\n#include \"logging.h\"\n\n#include <llvm\/ADT\/OwningPtr.h>\n#include <llvm\/ADT\/StringSet.h>\n#include <llvm\/ADT\/Triple.h>\n#include <llvm\/Analysis\/CallGraph.h>\n#include <llvm\/Analysis\/DebugInfo.h>\n#include <llvm\/Analysis\/LoopPass.h>\n#include <llvm\/Analysis\/RegionPass.h>\n#include <llvm\/Analysis\/Verifier.h>\n#include <llvm\/Assembly\/PrintModulePass.h>\n#include <llvm\/Bitcode\/ReaderWriter.h>\n#include <llvm\/CallGraphSCCPass.h>\n#include <llvm\/DerivedTypes.h>\n#include <llvm\/LLVMContext.h>\n#include <llvm\/Module.h>\n#include <llvm\/PassManager.h>\n#include <llvm\/Support\/Debug.h>\n#include <llvm\/Support\/FormattedStream.h>\n#include <llvm\/Support\/ManagedStatic.h>\n#include <llvm\/Support\/PassNameParser.h>\n#include <llvm\/Support\/PluginLoader.h>\n#include <llvm\/Support\/PrettyStackTrace.h>\n#include <llvm\/Support\/Signals.h>\n#include <llvm\/Support\/SystemUtils.h>\n#include <llvm\/Support\/TargetRegistry.h>\n#include <llvm\/Support\/TargetSelect.h>\n#include <llvm\/Support\/ToolOutputFile.h>\n#include <llvm\/Support\/raw_ostream.h>\n#include <llvm\/Target\/TargetData.h>\n#include <llvm\/Target\/TargetLibraryInfo.h>\n#include <llvm\/Target\/TargetMachine.h>\n#include <llvm\/Transforms\/IPO\/PassManagerBuilder.h>\n\n#include <string>\n\nnamespace art {\nnamespace compiler_llvm {\n\nllvm::Module* makeLLVMModuleContents(llvm::Module* module);\n\n\nCompilationUnit::CompilationUnit(InstructionSet insn_set)\n: insn_set_(insn_set), context_(new llvm::LLVMContext()), mem_usage_(0) {\n\n  \/\/ Create the module and include the runtime function declaration\n  module_ = new llvm::Module(\"art\", *context_);\n  makeLLVMModuleContents(module_);\n\n  \/\/ Create IRBuilder\n  irb_.reset(new IRBuilder(*context_, *module_));\n}\n\n\nCompilationUnit::~CompilationUnit() {\n}\n\n\nbool CompilationUnit::WriteBitcodeToFile() {\n  std::string errmsg;\n\n  llvm::OwningPtr<llvm::tool_output_file> out_file(\n    new llvm::tool_output_file(bitcode_filename_.c_str(), errmsg,\n                               llvm::raw_fd_ostream::F_Binary));\n\n\n  if (!errmsg.empty()) {\n    LOG(ERROR) << \"Failed to create bitcode output file: \" << errmsg;\n    return false;\n  }\n\n  llvm::WriteBitcodeToFile(module_, out_file->os());\n  out_file->keep();\n\n  return true;\n}\n\n\nbool CompilationUnit::Materialize() {\n  \/\/ Lookup the LLVM target\n  char const* target_triple = NULL;\n  char const* target_attr = NULL;\n\n  if (insn_set_ == kThumb2) {\n    target_triple = \"thumb-none-linux-gnueabi\";\n    target_attr = \"+thumb2,+neon,+neonfp,+vfp3\";\n  } else if (insn_set_ == kArm) {\n    target_triple = \"armv7-none-linux-gnueabi\";\n    target_attr = \"+v7,+neon,+neonfp,+vfp3\";\n  } else if (insn_set_ == kX86) {\n    target_triple = \"i386-pc-linux-gnu\";\n    target_attr = \"\";\n  \/\/ } else if (insn_set_ == kMips) {\n  \/\/  target_triple = \"mipsel-unknown-linux\";\n  \/\/  target_attr = \"\";\n  } else {\n    LOG(FATAL) << \"Unknown instruction set: \" << insn_set_;\n  }\n\n  std::string errmsg;\n  llvm::Target const* target =\n    llvm::TargetRegistry::lookupTarget(target_triple, errmsg);\n\n  CHECK(target != NULL) << errmsg;\n\n  \/\/ Target options\n  llvm::TargetOptions target_options;\n\n  target_options.NoFramePointerElim = true;\n  target_options.NoFramePointerElimNonLeaf = true;\n  target_options.FloatABIType = llvm::FloatABI::Soft;\n  target_options.UseSoftFloat = false;\n  target_options.NoFramePointerElim = true;\n  target_options.NoFramePointerElimNonLeaf = true;\n\n  \/\/ Create the llvm::TargetMachine\n  llvm::TargetMachine* target_machine =\n    target->createTargetMachine(target_triple, \"\", target_attr, target_options,\n                                llvm::Reloc::Static, llvm::CodeModel::Small,\n                                llvm::CodeGenOpt::Aggressive);\n\n  CHECK(target_machine != NULL) << \"Failed to create target machine\";\n\n\n  \/\/ Add target data\n  llvm::TargetData const* target_data = target_machine->getTargetData();\n\n  \/\/ PassManager for code generation passes\n  llvm::PassManager pm;\n  pm.add(new llvm::TargetData(*target_data));\n\n  \/\/ FunctionPassManager for optimization pass\n  llvm::FunctionPassManager fpm(module_);\n  fpm.add(new llvm::TargetData(*target_data));\n\n  \/\/ Add optimization pass\n  llvm::PassManagerBuilder pm_builder;\n  pm_builder.Inliner = NULL; \/\/ TODO: add some inline in the future\n  pm_builder.OptLevel = 3;\n  pm_builder.DisableSimplifyLibCalls = 1;\n  pm_builder.populateModulePassManager(pm);\n  pm_builder.populateFunctionPassManager(fpm);\n\n  \/\/ Add passes to emit file\n  llvm::OwningPtr<llvm::tool_output_file> out_file(\n    new llvm::tool_output_file(elf_filename_.c_str(), errmsg,\n                               llvm::raw_fd_ostream::F_Binary));\n\n  llvm::formatted_raw_ostream formatted_os(out_file->os(), false);\n\n  \/\/ Ask the target to add backend passes as necessary.\n  if (target_machine->addPassesToEmitFile(pm,\n                                          formatted_os,\n                                          llvm::TargetMachine::CGFT_ObjectFile,\n                                          true)) {\n    LOG(FATAL) << \"Unable to generate ELF for this target\";\n    return false;\n  }\n\n  \/\/ Run the per-function optimization\n  fpm.doInitialization();\n  for (llvm::Module::iterator F = module_->begin(), E = module_->end();\n       F != E; ++F) {\n    fpm.run(*F);\n  }\n  fpm.doFinalization();\n  LOG(INFO) << \"Intraprocedural optimization finished!\";\n\n  \/\/ Run the code generation passes\n  pm.run(*module_);\n  LOG(INFO) << \"Code generation finished!\";\n\n  out_file->keep();\n  LOG(DEBUG) << \"ELF: \" << elf_filename_ << \" (done)\";\n\n  return true;\n}\n\n\nvoid CompilationUnit::Finalize() {\n  context_.reset(NULL);\n  irb_.reset(NULL);\n  module_ = NULL;\n}\n\n} \/\/ namespace compiler_llvm\n} \/\/ namespace art\n<commit_msg>Use switch statement to select target triple.<commit_after>\/*\n * Copyright (C) 2012 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 \"compilation_unit.h\"\n\n#include \"constants.h\"\n#include \"ir_builder.h\"\n#include \"logging.h\"\n\n#include <llvm\/ADT\/OwningPtr.h>\n#include <llvm\/ADT\/StringSet.h>\n#include <llvm\/ADT\/Triple.h>\n#include <llvm\/Analysis\/CallGraph.h>\n#include <llvm\/Analysis\/DebugInfo.h>\n#include <llvm\/Analysis\/LoopPass.h>\n#include <llvm\/Analysis\/RegionPass.h>\n#include <llvm\/Analysis\/Verifier.h>\n#include <llvm\/Assembly\/PrintModulePass.h>\n#include <llvm\/Bitcode\/ReaderWriter.h>\n#include <llvm\/CallGraphSCCPass.h>\n#include <llvm\/DerivedTypes.h>\n#include <llvm\/LLVMContext.h>\n#include <llvm\/Module.h>\n#include <llvm\/PassManager.h>\n#include <llvm\/Support\/Debug.h>\n#include <llvm\/Support\/FormattedStream.h>\n#include <llvm\/Support\/ManagedStatic.h>\n#include <llvm\/Support\/PassNameParser.h>\n#include <llvm\/Support\/PluginLoader.h>\n#include <llvm\/Support\/PrettyStackTrace.h>\n#include <llvm\/Support\/Signals.h>\n#include <llvm\/Support\/SystemUtils.h>\n#include <llvm\/Support\/TargetRegistry.h>\n#include <llvm\/Support\/TargetSelect.h>\n#include <llvm\/Support\/ToolOutputFile.h>\n#include <llvm\/Support\/raw_ostream.h>\n#include <llvm\/Target\/TargetData.h>\n#include <llvm\/Target\/TargetLibraryInfo.h>\n#include <llvm\/Target\/TargetMachine.h>\n#include <llvm\/Transforms\/IPO\/PassManagerBuilder.h>\n\n#include <string>\n\nnamespace art {\nnamespace compiler_llvm {\n\nllvm::Module* makeLLVMModuleContents(llvm::Module* module);\n\n\nCompilationUnit::CompilationUnit(InstructionSet insn_set)\n: insn_set_(insn_set), context_(new llvm::LLVMContext()), mem_usage_(0) {\n\n  \/\/ Create the module and include the runtime function declaration\n  module_ = new llvm::Module(\"art\", *context_);\n  makeLLVMModuleContents(module_);\n\n  \/\/ Create IRBuilder\n  irb_.reset(new IRBuilder(*context_, *module_));\n}\n\n\nCompilationUnit::~CompilationUnit() {\n}\n\n\nbool CompilationUnit::WriteBitcodeToFile() {\n  std::string errmsg;\n\n  llvm::OwningPtr<llvm::tool_output_file> out_file(\n    new llvm::tool_output_file(bitcode_filename_.c_str(), errmsg,\n                               llvm::raw_fd_ostream::F_Binary));\n\n\n  if (!errmsg.empty()) {\n    LOG(ERROR) << \"Failed to create bitcode output file: \" << errmsg;\n    return false;\n  }\n\n  llvm::WriteBitcodeToFile(module_, out_file->os());\n  out_file->keep();\n\n  return true;\n}\n\n\nbool CompilationUnit::Materialize() {\n  \/\/ Lookup the LLVM target\n  char const* target_triple = NULL;\n  char const* target_attr = NULL;\n\n  switch (insn_set_) {\n  case kThumb2:\n    target_triple = \"thumb-none-linux-gnueabi\";\n    target_attr = \"+thumb2,+neon,+neonfp,+vfp3\";\n    break;\n\n  case kArm:\n    target_triple = \"armv7-none-linux-gnueabi\";\n    target_attr = \"+v7,+neon,+neonfp,+vfp3\";\n    break;\n\n  case kX86:\n    target_triple = \"i386-pc-linux-gnu\";\n    target_attr = \"\";\n    break;\n\n  \/\/case kMips:\n  \/\/  target_triple = \"mipsel-unknown-linux\";\n  \/\/  target_attr = \"\";\n  \/\/  break;\n\n  default:\n    LOG(FATAL) << \"Unknown instruction set: \" << insn_set_;\n  }\n\n  std::string errmsg;\n  llvm::Target const* target =\n    llvm::TargetRegistry::lookupTarget(target_triple, errmsg);\n\n  CHECK(target != NULL) << errmsg;\n\n  \/\/ Target options\n  llvm::TargetOptions target_options;\n\n  target_options.NoFramePointerElim = true;\n  target_options.NoFramePointerElimNonLeaf = true;\n  target_options.FloatABIType = llvm::FloatABI::Soft;\n  target_options.UseSoftFloat = false;\n  target_options.NoFramePointerElim = true;\n  target_options.NoFramePointerElimNonLeaf = true;\n\n  \/\/ Create the llvm::TargetMachine\n  llvm::TargetMachine* target_machine =\n    target->createTargetMachine(target_triple, \"\", target_attr, target_options,\n                                llvm::Reloc::Static, llvm::CodeModel::Small,\n                                llvm::CodeGenOpt::Aggressive);\n\n  CHECK(target_machine != NULL) << \"Failed to create target machine\";\n\n\n  \/\/ Add target data\n  llvm::TargetData const* target_data = target_machine->getTargetData();\n\n  \/\/ PassManager for code generation passes\n  llvm::PassManager pm;\n  pm.add(new llvm::TargetData(*target_data));\n\n  \/\/ FunctionPassManager for optimization pass\n  llvm::FunctionPassManager fpm(module_);\n  fpm.add(new llvm::TargetData(*target_data));\n\n  \/\/ Add optimization pass\n  llvm::PassManagerBuilder pm_builder;\n  pm_builder.Inliner = NULL; \/\/ TODO: add some inline in the future\n  pm_builder.OptLevel = 3;\n  pm_builder.DisableSimplifyLibCalls = 1;\n  pm_builder.populateModulePassManager(pm);\n  pm_builder.populateFunctionPassManager(fpm);\n\n  \/\/ Add passes to emit file\n  llvm::OwningPtr<llvm::tool_output_file> out_file(\n    new llvm::tool_output_file(elf_filename_.c_str(), errmsg,\n                               llvm::raw_fd_ostream::F_Binary));\n\n  llvm::formatted_raw_ostream formatted_os(out_file->os(), false);\n\n  \/\/ Ask the target to add backend passes as necessary.\n  if (target_machine->addPassesToEmitFile(pm,\n                                          formatted_os,\n                                          llvm::TargetMachine::CGFT_ObjectFile,\n                                          true)) {\n    LOG(FATAL) << \"Unable to generate ELF for this target\";\n    return false;\n  }\n\n  \/\/ Run the per-function optimization\n  fpm.doInitialization();\n  for (llvm::Module::iterator F = module_->begin(), E = module_->end();\n       F != E; ++F) {\n    fpm.run(*F);\n  }\n  fpm.doFinalization();\n  LOG(INFO) << \"Intraprocedural optimization finished!\";\n\n  \/\/ Run the code generation passes\n  pm.run(*module_);\n  LOG(INFO) << \"Code generation finished!\";\n\n  out_file->keep();\n  LOG(DEBUG) << \"ELF: \" << elf_filename_ << \" (done)\";\n\n  return true;\n}\n\n\nvoid CompilationUnit::Finalize() {\n  context_.reset(NULL);\n  irb_.reset(NULL);\n  module_ = NULL;\n}\n\n} \/\/ namespace compiler_llvm\n} \/\/ namespace art\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#include \"condor_common.h\"\n#include \"condor_config.h\"\n#include \"condor_classad.h\"\n#include \"condor_io.h\"\n#include \"condor_debug.h\"\n#include \"expr.h\"\n#include \"dgram_io_handle.h\"\n#include \"xferstat2.h\"\n#include \"xfer_summary.h\"\n#include \"condor_network.h\"\n#include \"condor_collector.h\"\n#include \"condor_attributes.h\"\n#include \"my_hostname.h\"\n\nstatic char *_FileName_ = __FILE__;\n\nextern \"C\" {\n\tchar *calc_subnet_name();\n\tint\tfree_fs_blocks(const char*);\n\tchar* getwd( char* );\n}\n\n\n\nXferSummary::XferSummary() \n{\n\ts = 0;\n\tsubnet = 0;\n\tlog_file = 0;\n\tCondorViewHost=NULL;\n}\n\n\n\nXferSummary::~XferSummary() \n{\n\tif( log_file ) { fclose(log_file); }\n\tif( s ) { delete s; }\n\tif( subnet ) { free(subnet); }\n\n}\n\n\nXferSummary::init()\n{\n\tif( s ) { delete s; }\n\ts = new SafeSock();\n\ts->timeout(30);\n\n\tchar* tmp = param( \"COLLECTOR_HOST\" );\n\tif( tmp ) {\n\t\tif( ! s->connect(tmp, COLLECTOR_PORT) ) {\n\t\t\tEXCEPT( \"Can't connect to collector: %s\", tmp );\n\t\t}\n\t\tfree( tmp );\n\t} else {\n\t\tEXCEPT( \"COLLECTOR_HOST not defined.\" );\n\t}\n\n\t\/\/ Get the condor view host name from the config file\n\tif( CondorViewHost ) free( CondorViewHost );\n    CondorViewHost = param(\"CONDOR_VIEW_HOST\");\n\n\tstart_time = time(0);\n\n\tnum_sends = 0;\n\tbytes_sent = 0;\n\ttot_send_bandwidth = 0;\n\ttime_sending = 0;\n\n\tnum_recvs = 0;\n\tbytes_recv = 0;\n\ttot_recv_bandwidth = 0;\n\ttime_recving = 0;\n\n\tif( subnet ) { free( subnet ); }\n\tsubnet = (char *)calc_subnet_name(NULL);\n\n\tif( ! getwd( pwd ) ) {\n\t\tEXCEPT( \"Can't get working directory.\" );\n\t}\n}\n\n\nXferSummary::Result(transferinfo *tinfo, bool success_flag,\n\t\t\t\t\tstruct in_addr peer)\n{\n\ttime_t\tnow;\n\tint\t\txfer_len;\n\tint\t\txfer_bandwidth = 0;\n\txfer_type type = tinfo->status;\n\ttime_t xfer_begin = tinfo->start_time;\n\tu_lint xfer_size = tinfo->file_size;\n\n\tnow = time(0);\n\n\txfer_len = now - xfer_begin;\n\n\tif (xfer_len != 0) {\n\t\txfer_bandwidth = xfer_size \/ xfer_len;\n\t}\n\n\tif (type == RECV) {\n\t\tdprintf(D_ALWAYS, \"RECV \");\n\t\tnum_recvs++;\n\t\tbytes_recv += xfer_size;\n\t\ttot_recv_bandwidth += xfer_bandwidth;\n\t\ttime_recving += xfer_len;\n\t} else if (type == XMIT) {\n\t\tdprintf(D_ALWAYS, \"SEND \");\n\t\tnum_sends++;\n\t\tbytes_sent += xfer_size;\n\t\ttot_send_bandwidth += xfer_bandwidth;\n\t\ttime_sending += xfer_len;\n\t}\n\tdprintf(D_ALWAYS | D_NOHEADER,\n\t\t\t\"transferred %d bytes in %d seconds (%d bytes \/ sec)\\n\", \n\t\t\txfer_size, xfer_len, xfer_bandwidth);\n\tlog_transfer(now, tinfo, success_flag, peer);\n}\n\nextern \"C\" {\n\tCONTEXT *create_context();\n\tEXPR *build_expr();\n\tint store_stmt(EXPR *, CONTEXT *);\n\tvoid free_context( CONTEXT *);\n}\n\nvoid\nXferSummary::time_out(time_t now)\n{\n\tClassAd\t   \tinfo;\n\tchar\t\tline[128], *tmp;\n\tint\t\t\tcommand = UPDATE_CKPT_SRVR_AD;\n\tstruct in_addr addr;\n\n\tinfo.SetMyTypeName(\"CkptServer\");\n\tinfo.SetTargetTypeName(\"CkptFile\");\n\n\tsprintf(line, \"%s = \\\"%s\\\"\", ATTR_NAME, my_full_hostname() );\n\tinfo.Insert(line);\n\tsprintf(line, \"%s = \\\"%s\\\"\", ATTR_MACHINE, my_full_hostname() );\n\tinfo.Insert(line);\n\tsprintf(line, \"Subnet = \\\"%s\\\"\", subnet);\n\tinfo.Insert(line);\n\tsprintf(line, \"NumSends = %d\", num_sends);\n\tinfo.Insert(line);\n\tsprintf(line, \"BytesSent = %d\", bytes_sent);\n\tinfo.Insert(line);\n\tsprintf(line, \"TimeSending = %d\", time_sending);\n\tinfo.Insert(line);\n\tsprintf(line, \"AvgSendBandwidth = %f\", num_sends ?\n\t\t\ttot_send_bandwidth \/ num_sends : 0.0);\n\tinfo.Insert(line);\n\tsprintf(line, \"NumRecvs = %d\", num_recvs);\n\tinfo.Insert(line);\n\tsprintf(line, \"BytesReceived = %d\", bytes_recv);\n\tinfo.Insert(line);\n\tsprintf(line, \"TimeReceiving = %d\", time_recving);\n\tinfo.Insert(line);\n\tsprintf(line, \"AvgReceiveBandwidth = %f\", num_recvs ?\n\t\t\ttot_recv_bandwidth \/ num_recvs : 0.0);\n\tinfo.Insert(line);\n\tsprintf(line, \"CkptServerIntervalStart = \\\"%s\\\"\", ctime(&start_time));\n\ttmp = strchr( line, '\\n' );\n\tstrcpy( tmp, \"\\\"\" );\n\tinfo.Insert(line);\n\tsprintf(line, \"CkptServerIntervalEnd = \\\"%s\\\"\", ctime(&now));\n\ttmp = strchr( line, '\\n' );\n\tstrcpy( tmp, \"\\\"\" );\n\tinfo.Insert(line);\n\tsprintf(line, \"Disk = %d\", free_fs_blocks(pwd) );\n\tinfo.Insert(line);\n\t\n\ts->encode();\n\ts->code(command);\n\tinfo.put(*s);\n\ts->eom();\n\n\t\/\/ Send to condor view host\n\tif (CondorViewHost) {\n        SafeSock sock(CondorViewHost, CONDOR_VIEW_PORT);\n        sock.encode();\n        if (!sock.put(command) ||\n            !info.put(sock) ||\n            !sock.end_of_message()) {\n            dprintf(D_ALWAYS, \"failed to update condor view server!\\n\");\n\t\t}\n\t}\n\n\tif (now - start_time > XFER_SUMMARY_INTERVAL) {\n\t\tinit();\n\t}\n}\n\nvoid\nXferSummary::log_transfer(time_t now, transferinfo *tinfo, bool success_flag,\n\t\t\t\t\t\t  struct in_addr peer)\n{\n\tstruct tm *tm;\n\tchar peer_IP[20];\n\n\tif (log_file == 0) {\n\t\tlog_file = fopen(\"TransferLog\", \"a\");\n\t}\n\tif (log_file == 0) {\n\t\treturn;\n\t}\n\n\ttm = localtime( &now );\n\t\/\/ make local copy of peer address to avoid calling inet_ntoa twice in\n\t\/\/ fprintf below\n\tstrcpy(peer_IP, inet_ntoa(peer));\n\tfprintf( log_file, \"%d\/%d %02d:%02d \", tm->tm_mon + 1, tm->tm_mday,\n\t\t\ttm->tm_hour, tm->tm_min );\n\tfprintf( log_file, \"%s %s %u bytes %d sec %s %s@%s\\n\",\n\t\t\t(tinfo->status == RECV ? \"R\" : \"S\"),\n\t\t\t(success_flag ? \"S\" : \"F\"),\n\t\t\ttinfo->file_size,\n\t\t\tnow - tinfo->start_time,\n\t\t\tpeer_IP,\n\t\t\ttinfo->owner,\n\t\t\tinet_ntoa(tinfo->shadow_addr));\n\tfflush( log_file );\n}\n\n\nunsigned long\nget_file_size(char *path)\n{\n\tint\t\tfd;\n\tunsigned long answer;\n\n\tfd = open(path, O_RDONLY, 0);\n\tif (fd < 0) {\n\t\treturn 0;\n\t}\n\n\tanswer=lseek(fd,0,2);\n\tclose(fd);\n\treturn answer;\n}\n\n\n<commit_msg>log time with seconds in TransferLog<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#include \"condor_common.h\"\n#include \"condor_config.h\"\n#include \"condor_classad.h\"\n#include \"condor_io.h\"\n#include \"condor_debug.h\"\n#include \"expr.h\"\n#include \"dgram_io_handle.h\"\n#include \"xferstat2.h\"\n#include \"xfer_summary.h\"\n#include \"condor_network.h\"\n#include \"condor_collector.h\"\n#include \"condor_attributes.h\"\n#include \"my_hostname.h\"\n\nstatic char *_FileName_ = __FILE__;\n\nextern \"C\" {\n\tchar *calc_subnet_name();\n\tint\tfree_fs_blocks(const char*);\n\tchar* getwd( char* );\n}\n\n\n\nXferSummary::XferSummary() \n{\n\ts = 0;\n\tsubnet = 0;\n\tlog_file = 0;\n\tCondorViewHost=NULL;\n}\n\n\n\nXferSummary::~XferSummary() \n{\n\tif( log_file ) { fclose(log_file); }\n\tif( s ) { delete s; }\n\tif( subnet ) { free(subnet); }\n\n}\n\n\nXferSummary::init()\n{\n\tif( s ) { delete s; }\n\ts = new SafeSock();\n\ts->timeout(30);\n\n\tchar* tmp = param( \"COLLECTOR_HOST\" );\n\tif( tmp ) {\n\t\tif( ! s->connect(tmp, COLLECTOR_PORT) ) {\n\t\t\tEXCEPT( \"Can't connect to collector: %s\", tmp );\n\t\t}\n\t\tfree( tmp );\n\t} else {\n\t\tEXCEPT( \"COLLECTOR_HOST not defined.\" );\n\t}\n\n\t\/\/ Get the condor view host name from the config file\n\tif( CondorViewHost ) free( CondorViewHost );\n    CondorViewHost = param(\"CONDOR_VIEW_HOST\");\n\n\tstart_time = time(0);\n\n\tnum_sends = 0;\n\tbytes_sent = 0;\n\ttot_send_bandwidth = 0;\n\ttime_sending = 0;\n\n\tnum_recvs = 0;\n\tbytes_recv = 0;\n\ttot_recv_bandwidth = 0;\n\ttime_recving = 0;\n\n\tif( subnet ) { free( subnet ); }\n\tsubnet = (char *)calc_subnet_name(NULL);\n\n\tif( ! getwd( pwd ) ) {\n\t\tEXCEPT( \"Can't get working directory.\" );\n\t}\n}\n\n\nXferSummary::Result(transferinfo *tinfo, bool success_flag,\n\t\t\t\t\tstruct in_addr peer)\n{\n\ttime_t\tnow;\n\tint\t\txfer_len;\n\tint\t\txfer_bandwidth = 0;\n\txfer_type type = tinfo->status;\n\ttime_t xfer_begin = tinfo->start_time;\n\tu_lint xfer_size = tinfo->file_size;\n\n\tnow = time(0);\n\n\txfer_len = now - xfer_begin;\n\n\tif (xfer_len != 0) {\n\t\txfer_bandwidth = xfer_size \/ xfer_len;\n\t}\n\n\tif (type == RECV) {\n\t\tdprintf(D_ALWAYS, \"RECV \");\n\t\tnum_recvs++;\n\t\tbytes_recv += xfer_size;\n\t\ttot_recv_bandwidth += xfer_bandwidth;\n\t\ttime_recving += xfer_len;\n\t} else if (type == XMIT) {\n\t\tdprintf(D_ALWAYS, \"SEND \");\n\t\tnum_sends++;\n\t\tbytes_sent += xfer_size;\n\t\ttot_send_bandwidth += xfer_bandwidth;\n\t\ttime_sending += xfer_len;\n\t}\n\tdprintf(D_ALWAYS | D_NOHEADER,\n\t\t\t\"transferred %d bytes in %d seconds (%d bytes \/ sec)\\n\", \n\t\t\txfer_size, xfer_len, xfer_bandwidth);\n\tlog_transfer(now, tinfo, success_flag, peer);\n}\n\nextern \"C\" {\n\tCONTEXT *create_context();\n\tEXPR *build_expr();\n\tint store_stmt(EXPR *, CONTEXT *);\n\tvoid free_context( CONTEXT *);\n}\n\nvoid\nXferSummary::time_out(time_t now)\n{\n\tClassAd\t   \tinfo;\n\tchar\t\tline[128], *tmp;\n\tint\t\t\tcommand = UPDATE_CKPT_SRVR_AD;\n\tstruct in_addr addr;\n\n\tinfo.SetMyTypeName(\"CkptServer\");\n\tinfo.SetTargetTypeName(\"CkptFile\");\n\n\tsprintf(line, \"%s = \\\"%s\\\"\", ATTR_NAME, my_full_hostname() );\n\tinfo.Insert(line);\n\tsprintf(line, \"%s = \\\"%s\\\"\", ATTR_MACHINE, my_full_hostname() );\n\tinfo.Insert(line);\n\tsprintf(line, \"Subnet = \\\"%s\\\"\", subnet);\n\tinfo.Insert(line);\n\tsprintf(line, \"NumSends = %d\", num_sends);\n\tinfo.Insert(line);\n\tsprintf(line, \"BytesSent = %d\", bytes_sent);\n\tinfo.Insert(line);\n\tsprintf(line, \"TimeSending = %d\", time_sending);\n\tinfo.Insert(line);\n\tsprintf(line, \"AvgSendBandwidth = %f\", num_sends ?\n\t\t\ttot_send_bandwidth \/ num_sends : 0.0);\n\tinfo.Insert(line);\n\tsprintf(line, \"NumRecvs = %d\", num_recvs);\n\tinfo.Insert(line);\n\tsprintf(line, \"BytesReceived = %d\", bytes_recv);\n\tinfo.Insert(line);\n\tsprintf(line, \"TimeReceiving = %d\", time_recving);\n\tinfo.Insert(line);\n\tsprintf(line, \"AvgReceiveBandwidth = %f\", num_recvs ?\n\t\t\ttot_recv_bandwidth \/ num_recvs : 0.0);\n\tinfo.Insert(line);\n\tsprintf(line, \"CkptServerIntervalStart = \\\"%s\\\"\", ctime(&start_time));\n\ttmp = strchr( line, '\\n' );\n\tstrcpy( tmp, \"\\\"\" );\n\tinfo.Insert(line);\n\tsprintf(line, \"CkptServerIntervalEnd = \\\"%s\\\"\", ctime(&now));\n\ttmp = strchr( line, '\\n' );\n\tstrcpy( tmp, \"\\\"\" );\n\tinfo.Insert(line);\n\tsprintf(line, \"Disk = %d\", free_fs_blocks(pwd) );\n\tinfo.Insert(line);\n\t\n\ts->encode();\n\ts->code(command);\n\tinfo.put(*s);\n\ts->eom();\n\n\t\/\/ Send to condor view host\n\tif (CondorViewHost) {\n        SafeSock sock(CondorViewHost, CONDOR_VIEW_PORT);\n        sock.encode();\n        if (!sock.put(command) ||\n            !info.put(sock) ||\n            !sock.end_of_message()) {\n            dprintf(D_ALWAYS, \"failed to update condor view server!\\n\");\n\t\t}\n\t}\n\n\tif (now - start_time > XFER_SUMMARY_INTERVAL) {\n\t\tinit();\n\t}\n}\n\nvoid\nXferSummary::log_transfer(time_t now, transferinfo *tinfo, bool success_flag,\n\t\t\t\t\t\t  struct in_addr peer)\n{\n\tstruct tm *tm;\n\tchar peer_IP[20];\n\n\tif (log_file == 0) {\n\t\tlog_file = fopen(\"TransferLog\", \"a\");\n\t}\n\tif (log_file == 0) {\n\t\treturn;\n\t}\n\n\ttm = localtime( &now );\n\t\/\/ make local copy of peer address to avoid calling inet_ntoa twice in\n\t\/\/ fprintf below\n\tstrcpy(peer_IP, inet_ntoa(peer));\n\tfprintf( log_file, \"%d\/%d %02d:%02d:%02d \", tm->tm_mon + 1, tm->tm_mday,\n\t\t\ttm->tm_hour, tm->tm_min, tm->tm_sec );\n\tfprintf( log_file, \"%s %s %u bytes %d sec %s %s@%s\\n\",\n\t\t\t(tinfo->status == RECV ? \"R\" : \"S\"),\n\t\t\t(success_flag ? \"S\" : \"F\"),\n\t\t\ttinfo->file_size,\n\t\t\tnow - tinfo->start_time,\n\t\t\tpeer_IP,\n\t\t\ttinfo->owner,\n\t\t\tinet_ntoa(tinfo->shadow_addr));\n\tfflush( log_file );\n}\n\n\nunsigned long\nget_file_size(char *path)\n{\n\tint\t\tfd;\n\tunsigned long answer;\n\n\tfd = open(path, O_RDONLY, 0);\n\tif (fd < 0) {\n\t\treturn 0;\n\t}\n\n\tanswer=lseek(fd,0,2);\n\tclose(fd);\n\treturn answer;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include <mist\/procs.h>\n#include <mist\/config.h>\n#include <mist\/timing.h>\n#include <mist\/stream.h>\n#include <mist\/dtsc.h>\n#include <mist\/defines.h>\n#include <mist\/shared_memory.h>\n#include \"controller_streams.h\"\n#include \"controller_capabilities.h\"\n#include \"controller_storage.h\"\n#include \"controller_statistics.h\"\n#include \"controller_limits.h\" \/*LTS*\/\n#include <sys\/stat.h>\n#include <map>\n\n\/\/\/\\brief Holds everything unique to the controller.\nnamespace Controller {\n  std::map<std::string, pid_t> inputProcesses;\n\n  \/\/\/\\brief Checks whether two streams are equal.\n  \/\/\/\\param one The first stream for the comparison.\n  \/\/\/\\param two The second stream for the comparison.\n  \/\/\/\\return True if the streams are equal, false otherwise.\n  bool streamsEqual(JSON::Value & one, JSON::Value & two){\n    if (one.isMember(\"source\") != two.isMember(\"source\") || one[\"source\"] != two[\"source\"]){\n      return false;\n    }\n    \n    \/\/\/ \\todo Change this to use capabilities[\"inputs\"] and only compare required\/optional parameters.\n    \/\/\/ \\todo Maybe change this to check for correct source and\/or required parameters.\n    \n    \/\/temporary: compare the two JSON::Value objects.\n    return one==two;\n    \n    \/\/nothing different? return true by default\n    \/\/return true;\n  }\n\n  \/\/\/\\brief Checks the validity of a stream, updates internal stream status.\n  \/\/\/\\param name The name of the stream\n  \/\/\/\\param data The corresponding configuration values.\n  void checkStream(std::string name, JSON::Value & data){\n    std::string prevState = data[\"error\"].asStringRef();\n    data[\"online\"] = (std::string)\"Checking...\";\n    data.removeMember(\"error\");\n    std::string URL;\n    if (data.isMember(\"channel\") && data[\"channel\"].isMember(\"URL\")){\n      URL = data[\"channel\"][\"URL\"].asString();\n    }\n    if (data.isMember(\"source\")){\n      URL = data[\"source\"].asString();\n    }\n    if (URL == \"\"){\n      data[\"error\"] = \"Stream offline: Missing source parameter!\";\n      if (data[\"error\"].asStringRef() != prevState){\n        Log(\"STRM\", \"Error for stream \" + name + \"! Source parameter missing.\");\n      }\n      return;\n    }\n    if (URL.substr(0, 1) != \"\/\"){\n      \/\/push-style stream\n      if (data[\"udpport\"].asInt()){\n        std::string udpPort = data[\"udpport\"].asString();\n        \/\/Check running\n        if (!inputProcesses.count(name) || !Util::Procs::isRunning(inputProcesses[name])){\n          \/\/  False: start TS input\n          INFO_MSG(\"No TS Input running on port %s for stream %s, starting it\", udpPort.c_str(), name.c_str());\n          std::deque<std::string> command;\n          command.push_back(Util::getMyPath() + \"MistInTSStream\");\n          command.push_back(\"-s\");\n          command.push_back(name);\n          command.push_back(\"-p\");\n          command.push_back(udpPort);\n          command.push_back(URL);\n          int stdIn = 0;\n          int stdOut = 1;\n          int stdErr = 2;\n          pid_t program = Util::Procs::StartPiped(command, &stdIn, &stdOut, &stdErr);\n          if (program){\n            inputProcesses[name] = program;\n          }\n        }\n        \/\/Check hasViewers\n        \/\/  True: data[\"online\"] = 2;\n        \/\/  False: data[\"online\"] =11;\n      }\n      return;\n    }\n    if (URL.substr(0, 1) == \"\/\"){\n      \/\/vod-style stream\n      data.removeMember(\"error\");\n      struct stat fileinfo;\n      if (stat(URL.c_str(), &fileinfo) != 0){\n        data[\"error\"] = \"Stream offline: Not found: \" + URL;\n        if (data[\"error\"].asStringRef() != prevState){\n          Log(\"BUFF\", \"Warning for VoD stream \" + name + \"! File not found: \" + URL);\n        }\n        data[\"online\"] = 0;\n        return;\n      }\n      if (!hasViewers(name)){\n        if ( !data.isMember(\"error\")){\n          data[\"error\"] = \"Available\";\n        }\n        data[\"online\"] = 2;\n      }else{\n        data[\"online\"] = 1;\n      }\n      checkServerLimits(); \/*LTS*\/\n      return;\n    }\n    \/\/not recognized\n    data[\"error\"] = \"Invalid source format\";\n    if (data[\"error\"].asStringRef() != prevState){\n      Log(\"STRM\", \"Invalid source format for stream \" + name + \"!\");\n    }\n    return;\n  }\n\n  \/\/\/\\brief Checks all streams, restoring if needed.\n  \/\/\/\\param data The stream configuration for the server.\n  \/\/\/\\returns True if the server status changed\n  bool CheckAllStreams(JSON::Value & data){\n    long long int currTime = Util::epoch();\n    jsonForEach(data, jit) {\n      checkStream(jit.key(), (*jit));\n      if (!jit->isMember(\"name\")){\n        (*jit)[\"name\"] = jit.key();\n      }\n      if (!hasViewers(jit.key())){\n        if (jit->isMember(\"source\") && (*jit)[\"source\"].asString().substr(0, 1) == \"\/\" && jit->isMember(\"error\")\n            && (*jit)[\"error\"].asString().substr(0,15) != \"Stream offline:\"){\n          (*jit)[\"online\"] = 2;\n        }else{\n          if (jit->isMember(\"error\") && (*jit)[\"error\"].asString() == \"Available\"){\n            jit->removeMember(\"error\");\n          }\n          (*jit)[\"online\"] = 0;\n        }\n        checkServerLimits(); \/*LTS*\/\n      }else{\n        \/\/ assume all is fine\n        jit->removeMember(\"error\");\n        (*jit)[\"online\"] = 1;\n      }\n    }\n\n    \/\/check for changes in config or streams\n    static JSON::Value strlist;\n    if (strlist[\"config\"] != Storage[\"config\"] || strlist[\"streams\"] != Storage[\"streams\"]){\n      strlist[\"config\"] = Storage[\"config\"];\n      strlist[\"streams\"] = Storage[\"streams\"];\n      return true;\n    }\n    return false;\n  }\n  \n  void AddStreams(JSON::Value & in, JSON::Value & out){\n    \/\/check for new streams and updates\n    jsonForEach(in, jit) {\n      if (out.isMember(jit.key())){\n        if ( !streamsEqual((*jit), out[jit.key()])){\n          out[jit.key()] = (*jit);\n          out[jit.key()][\"name\"] = jit.key();\n          Log(\"STRM\", std::string(\"Updated stream \") + jit.key());\n        }\n      }else{\n        out[jit.key()] = (*jit);\n        out[jit.key()][\"name\"] = (*jit);\n        Log(\"STRM\", std::string(\"New stream \") + jit.key());\n      }\n    }\n  }\n\n  \/\/\/\\brief Parse a given stream configuration.\n  \/\/\/\\param in The requested configuration.\n  \/\/\/\\param out The new configuration after parsing.\n  \/\/\/\n  \/\/\/ \\api\n  \/\/\/ `\"streams\"` requests take the form of:\n  \/\/\/ ~~~~~~~~~~~~~~~{.js}\n  \/\/\/ {\n  \/\/\/   \"streamname_here\": { \/\/name of the stream\n  \/\/\/     \"source\": \"\/mnt\/media\/a.dtsc\" \/\/full path to a VoD file, or \"push:\/\/\" followed by the IP or hostname of the machine allowed to push live data. Empty means everyone is allowed to push live data.\n  \/\/\/     \"DVR\": 30000 \/\/optional. For live streams, indicates the requested minimum size of the available DVR buffer in milliseconds.\n  \/\/\/   },\n  \/\/\/   \/\/the above structure repeated for all configured streams\n  \/\/\/ }\n  \/\/\/ ~~~~~~~~~~~~~~~\n  \/\/\/ and are responded to as:\n  \/\/\/ ~~~~~~~~~~~~~~~{.js}\n  \/\/\/ {\n  \/\/\/   \"streamname_here\": { \/\/name of the configured stream\n  \/\/\/     \"error\": \"Available\", \/\/error state, if any. \"Available\" is a special value for VoD streams, indicating it has no current viewers (is not active), but is available for activation.\n  \/\/\/     \"h_meta\": 1398113185, \/\/unix time the stream header (if any) was last processed for metadata\n  \/\/\/     \"l_meta\": 1398115447, \/\/unix time the stream itself was last processed for metadata\n  \/\/\/     \"meta\": { \/\/available metadata for this stream, if any\n  \/\/\/       \"format\": \"dtsc\", \/\/detected media source format\n  \/\/\/       \"tracks\": { \/\/list of tracks in this stream\n  \/\/\/         \"audio_AAC_2ch_48000hz_2\": {\/\/human-readable track name\n  \/\/\/           \"bps\": 16043,\n  \/\/\/           \"channels\": 2,\n  \/\/\/           \"codec\": \"AAC\",\n  \/\/\/           \"firstms\": 0,\n  \/\/\/           \"init\": \"\\u0011Vå\\u0000\",\n  \/\/\/           \"lastms\": 596480,\n  \/\/\/           \"rate\": 48000,\n  \/\/\/           \"size\": 16,\n  \/\/\/           \"trackid\": 2,\n  \/\/\/           \"type\": \"audio\"\n  \/\/\/         },\n  \/\/\/         \/\/the above structure repeated for all tracks\n  \/\/\/       },\n  \/\/\/       \"vod\": 1 \/\/indicates VoD stream, or \"live\" to indicated live stream.\n  \/\/\/     },\n  \/\/\/     \"name\": \"a\", \/\/the stream name, guaranteed to be equal to the object name.\n  \/\/\/     \"online\": 2, \/\/online state. 0 = error, 1 = active, 2 = inactive.\n  \/\/\/     \"source\": \"\/home\/thulinma\/a.dtsc\" \/\/source for this stream, as configured.\n  \/\/\/   },\n  \/\/\/   \/\/the above structure repeated for all configured streams\n  \/\/\/ }\n  \/\/\/ ~~~~~~~~~~~~~~~\n  \/\/\/ Through this request, ALL streams must always be configured. To remove a stream, simply leave it out of the request. To add a stream, simply add it to the request. To edit a stream, simply edit it in the request. The LTS edition has additional requests that allow per-stream changing of the configuration.\n  void CheckStreams(JSON::Value & in, JSON::Value & out){\n    \/\/check for new streams and updates\n    AddStreams(in, out);\n\n    \/\/check for deleted streams\n    std::set<std::string> toDelete;\n    jsonForEach(out, jit) {\n      if ( !in.isMember(jit.key())){\n        toDelete.insert(jit.key());\n        Log(\"STRM\", std::string(\"Deleted stream \") + jit.key());\n      }\n    }\n    \/\/actually delete the streams\n    while (toDelete.size() > 0){\n      std::string deleting = *(toDelete.begin());\n      deleteStream(deleting, out);\n      toDelete.erase(deleting);\n    }\n\n    \/\/update old-style configurations to new-style\n    jsonForEach(in, jit) {\n      if (jit->isMember(\"channel\")){\n        if ( !jit->isMember(\"source\")){\n          (*jit)[\"source\"] = (*jit)[\"channel\"][\"URL\"];\n        }\n        jit->removeMember(\"channel\");\n      }\n      if (jit->isMember(\"preset\")){\n        jit->removeMember(\"preset\");\n      }\n    }\n\n  }\n\n  void deleteStream(const std::string & name, JSON::Value & out) {\n    if (!out.isMember(name)){\n      return;\n    }\n    Log(\"STRM\", std::string(\"Deleted stream \") + name);\n    out.removeMember(name);\n    if (inputProcesses.count(name)){\n      pid_t procId = inputProcesses[name];\n      if (Util::Procs::isRunning(procId)){\n        Util::Procs::Stop(procId);\n      }\n      inputProcesses.erase(name);\n    }\n  }\n\n} \/\/Controller namespace\n<commit_msg>Haha.<commit_after>#include <mist\/procs.h>\n#include <mist\/config.h>\n#include <mist\/timing.h>\n#include <mist\/stream.h>\n#include <mist\/dtsc.h>\n#include <mist\/defines.h>\n#include <mist\/shared_memory.h>\n#include \"controller_streams.h\"\n#include \"controller_capabilities.h\"\n#include \"controller_storage.h\"\n#include \"controller_statistics.h\"\n#include \"controller_limits.h\" \/*LTS*\/\n#include <sys\/stat.h>\n#include <map>\n\n\/\/\/\\brief Holds everything unique to the controller.\nnamespace Controller {\n  std::map<std::string, pid_t> inputProcesses;\n\n  \/\/\/\\brief Checks whether two streams are equal.\n  \/\/\/\\param one The first stream for the comparison.\n  \/\/\/\\param two The second stream for the comparison.\n  \/\/\/\\return True if the streams are equal, false otherwise.\n  bool streamsEqual(JSON::Value & one, JSON::Value & two){\n    if (one.isMember(\"source\") != two.isMember(\"source\") || one[\"source\"] != two[\"source\"]){\n      return false;\n    }\n    \n    \/\/\/ \\todo Change this to use capabilities[\"inputs\"] and only compare required\/optional parameters.\n    \/\/\/ \\todo Maybe change this to check for correct source and\/or required parameters.\n    \n    \/\/temporary: compare the two JSON::Value objects.\n    return one==two;\n    \n    \/\/nothing different? return true by default\n    \/\/return true;\n  }\n\n  \/\/\/\\brief Checks the validity of a stream, updates internal stream status.\n  \/\/\/\\param name The name of the stream\n  \/\/\/\\param data The corresponding configuration values.\n  void checkStream(std::string name, JSON::Value & data){\n    std::string prevState = data[\"error\"].asStringRef();\n    data[\"online\"] = (std::string)\"Checking...\";\n    data.removeMember(\"error\");\n    std::string URL;\n    if (data.isMember(\"channel\") && data[\"channel\"].isMember(\"URL\")){\n      URL = data[\"channel\"][\"URL\"].asString();\n    }\n    if (data.isMember(\"source\")){\n      URL = data[\"source\"].asString();\n    }\n    if (URL == \"\"){\n      data[\"error\"] = \"Stream offline: Missing source parameter!\";\n      if (data[\"error\"].asStringRef() != prevState){\n        Log(\"STRM\", \"Error for stream \" + name + \"! Source parameter missing.\");\n      }\n      return;\n    }\n    if (URL.substr(0, 1) != \"\/\"){\n      \/\/push-style stream\n      if (data[\"udpport\"].asInt()){\n        std::string udpPort = data[\"udpport\"].asString();\n        \/\/Check running\n        if (!inputProcesses.count(name) || !Util::Procs::isRunning(inputProcesses[name])){\n          \/\/  False: start TS input\n          INFO_MSG(\"No TS Input running on port %s for stream %s, starting it\", udpPort.c_str(), name.c_str());\n          std::deque<std::string> command;\n          command.push_back(Util::getMyPath() + \"MistInTSStream\");\n          command.push_back(\"-s\");\n          command.push_back(name);\n          command.push_back(\"-p\");\n          command.push_back(udpPort);\n          command.push_back(URL);\n          int stdIn = 0;\n          int stdOut = 1;\n          int stdErr = 2;\n          pid_t program = Util::Procs::StartPiped(command, &stdIn, &stdOut, &stdErr);\n          if (program){\n            inputProcesses[name] = program;\n          }\n        }\n        \/\/Check hasViewers\n        \/\/  True: data[\"online\"] = 2;\n        \/\/  False: data[\"online\"] =11;\n      }\n      return;\n    }\n    if (URL.substr(0, 1) == \"\/\"){\n      \/\/vod-style stream\n      data.removeMember(\"error\");\n      struct stat fileinfo;\n      if (stat(URL.c_str(), &fileinfo) != 0){\n        data[\"error\"] = \"Stream offline: Not found: \" + URL;\n        if (data[\"error\"].asStringRef() != prevState){\n          Log(\"BUFF\", \"Warning for VoD stream \" + name + \"! File not found: \" + URL);\n        }\n        data[\"online\"] = 0;\n        return;\n      }\n      if (!hasViewers(name)){\n        if ( !data.isMember(\"error\")){\n          data[\"error\"] = \"Available\";\n        }\n        data[\"online\"] = 2;\n      }else{\n        data[\"online\"] = 1;\n      }\n      checkServerLimits(); \/*LTS*\/\n      return;\n    }\n    \/\/not recognized\n    data[\"error\"] = \"Invalid source format\";\n    if (data[\"error\"].asStringRef() != prevState){\n      Log(\"STRM\", \"Invalid source format for stream \" + name + \"!\");\n    }\n    return;\n  }\n\n  \/\/\/\\brief Checks all streams, restoring if needed.\n  \/\/\/\\param data The stream configuration for the server.\n  \/\/\/\\returns True if the server status changed\n  bool CheckAllStreams(JSON::Value & data){\n    long long int currTime = Util::epoch();\n    jsonForEach(data, jit) {\n      checkStream(jit.key(), (*jit));\n      if (!jit->isMember(\"name\")){\n        (*jit)[\"name\"] = jit.key();\n      }\n      if (!hasViewers(jit.key())){\n        if (jit->isMember(\"source\") && (*jit)[\"source\"].asString().substr(0, 1) == \"\/\" && jit->isMember(\"error\")\n            && (*jit)[\"error\"].asString().substr(0,15) != \"Stream offline:\"){\n          (*jit)[\"online\"] = 2;\n        }else{\n          if (jit->isMember(\"error\") && (*jit)[\"error\"].asString() == \"Available\"){\n            jit->removeMember(\"error\");\n          }\n          (*jit)[\"online\"] = 0;\n        }\n        checkServerLimits(); \/*LTS*\/\n      }else{\n        \/\/ assume all is fine\n        jit->removeMember(\"error\");\n        (*jit)[\"online\"] = 1;\n      }\n    }\n\n    \/\/check for changes in config or streams\n    static JSON::Value strlist;\n    if (strlist[\"config\"] != Storage[\"config\"] || strlist[\"streams\"] != Storage[\"streams\"]){\n      strlist[\"config\"] = Storage[\"config\"];\n      strlist[\"streams\"] = Storage[\"streams\"];\n      return true;\n    }\n    return false;\n  }\n  \n  void AddStreams(JSON::Value & in, JSON::Value & out){\n    \/\/check for new streams and updates\n    jsonForEach(in, jit) {\n      if (out.isMember(jit.key())){\n        if ( !streamsEqual((*jit), out[jit.key()])){\n          out[jit.key()] = (*jit);\n          out[jit.key()][\"name\"] = jit.key();\n          Log(\"STRM\", std::string(\"Updated stream \") + jit.key());\n        }\n      }else{\n        out[jit.key()] = (*jit);\n        out[jit.key()][\"name\"] = jit.key();\n        Log(\"STRM\", std::string(\"New stream \") + jit.key());\n      }\n    }\n  }\n\n  \/\/\/\\brief Parse a given stream configuration.\n  \/\/\/\\param in The requested configuration.\n  \/\/\/\\param out The new configuration after parsing.\n  \/\/\/\n  \/\/\/ \\api\n  \/\/\/ `\"streams\"` requests take the form of:\n  \/\/\/ ~~~~~~~~~~~~~~~{.js}\n  \/\/\/ {\n  \/\/\/   \"streamname_here\": { \/\/name of the stream\n  \/\/\/     \"source\": \"\/mnt\/media\/a.dtsc\" \/\/full path to a VoD file, or \"push:\/\/\" followed by the IP or hostname of the machine allowed to push live data. Empty means everyone is allowed to push live data.\n  \/\/\/     \"DVR\": 30000 \/\/optional. For live streams, indicates the requested minimum size of the available DVR buffer in milliseconds.\n  \/\/\/   },\n  \/\/\/   \/\/the above structure repeated for all configured streams\n  \/\/\/ }\n  \/\/\/ ~~~~~~~~~~~~~~~\n  \/\/\/ and are responded to as:\n  \/\/\/ ~~~~~~~~~~~~~~~{.js}\n  \/\/\/ {\n  \/\/\/   \"streamname_here\": { \/\/name of the configured stream\n  \/\/\/     \"error\": \"Available\", \/\/error state, if any. \"Available\" is a special value for VoD streams, indicating it has no current viewers (is not active), but is available for activation.\n  \/\/\/     \"h_meta\": 1398113185, \/\/unix time the stream header (if any) was last processed for metadata\n  \/\/\/     \"l_meta\": 1398115447, \/\/unix time the stream itself was last processed for metadata\n  \/\/\/     \"meta\": { \/\/available metadata for this stream, if any\n  \/\/\/       \"format\": \"dtsc\", \/\/detected media source format\n  \/\/\/       \"tracks\": { \/\/list of tracks in this stream\n  \/\/\/         \"audio_AAC_2ch_48000hz_2\": {\/\/human-readable track name\n  \/\/\/           \"bps\": 16043,\n  \/\/\/           \"channels\": 2,\n  \/\/\/           \"codec\": \"AAC\",\n  \/\/\/           \"firstms\": 0,\n  \/\/\/           \"init\": \"\\u0011Vå\\u0000\",\n  \/\/\/           \"lastms\": 596480,\n  \/\/\/           \"rate\": 48000,\n  \/\/\/           \"size\": 16,\n  \/\/\/           \"trackid\": 2,\n  \/\/\/           \"type\": \"audio\"\n  \/\/\/         },\n  \/\/\/         \/\/the above structure repeated for all tracks\n  \/\/\/       },\n  \/\/\/       \"vod\": 1 \/\/indicates VoD stream, or \"live\" to indicated live stream.\n  \/\/\/     },\n  \/\/\/     \"name\": \"a\", \/\/the stream name, guaranteed to be equal to the object name.\n  \/\/\/     \"online\": 2, \/\/online state. 0 = error, 1 = active, 2 = inactive.\n  \/\/\/     \"source\": \"\/home\/thulinma\/a.dtsc\" \/\/source for this stream, as configured.\n  \/\/\/   },\n  \/\/\/   \/\/the above structure repeated for all configured streams\n  \/\/\/ }\n  \/\/\/ ~~~~~~~~~~~~~~~\n  \/\/\/ Through this request, ALL streams must always be configured. To remove a stream, simply leave it out of the request. To add a stream, simply add it to the request. To edit a stream, simply edit it in the request. The LTS edition has additional requests that allow per-stream changing of the configuration.\n  void CheckStreams(JSON::Value & in, JSON::Value & out){\n    \/\/check for new streams and updates\n    AddStreams(in, out);\n\n    \/\/check for deleted streams\n    std::set<std::string> toDelete;\n    jsonForEach(out, jit) {\n      if ( !in.isMember(jit.key())){\n        toDelete.insert(jit.key());\n        Log(\"STRM\", std::string(\"Deleted stream \") + jit.key());\n      }\n    }\n    \/\/actually delete the streams\n    while (toDelete.size() > 0){\n      std::string deleting = *(toDelete.begin());\n      deleteStream(deleting, out);\n      toDelete.erase(deleting);\n    }\n\n    \/\/update old-style configurations to new-style\n    jsonForEach(in, jit) {\n      if (jit->isMember(\"channel\")){\n        if ( !jit->isMember(\"source\")){\n          (*jit)[\"source\"] = (*jit)[\"channel\"][\"URL\"];\n        }\n        jit->removeMember(\"channel\");\n      }\n      if (jit->isMember(\"preset\")){\n        jit->removeMember(\"preset\");\n      }\n    }\n\n  }\n\n  void deleteStream(const std::string & name, JSON::Value & out) {\n    if (!out.isMember(name)){\n      return;\n    }\n    Log(\"STRM\", std::string(\"Deleted stream \") + name);\n    out.removeMember(name);\n    if (inputProcesses.count(name)){\n      pid_t procId = inputProcesses[name];\n      if (Util::Procs::isRunning(procId)){\n        Util::Procs::Stop(procId);\n      }\n      inputProcesses.erase(name);\n    }\n  }\n\n} \/\/Controller namespace\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Fix wrong matrix order<commit_after><|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#if defined(__arm__)\n#  define __NR_waitid 280\n#elif defined(__x86_64__)\n#  define __NR_waitid 247\n#else\n#  error\n#endif\n\n#error\n<commit_msg>waitid: not needed (yet)<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>BUG: Mantis-1425: explore into choices even if it has a default value<commit_after><|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 QtDBus module of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the 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 \"qdbusconnectioninterface.h\"\n\n#include <QtCore\/QByteArray>\n#include <QtCore\/QList>\n#include <QtCore\/QMap>\n#include <QtCore\/QString>\n#include <QtCore\/QStringList>\n#include <QtCore\/QVariant>\n#include <QtCore\/QDebug>\n\n#include <qdbus_symbols_p.h>          \/\/ for the DBUS_* constants\n\nQT_BEGIN_NAMESPACE\n\n\/*\n * Implementation of interface class QDBusConnectionInterface\n *\/\n\n\/*!\n    \\class QDBusConnectionInterface\n    \\inmodule QtDBus\n    \\since 4.2\n\n    \\brief The QDBusConnectionInterface class provides access to the D-Bus bus daemon service.\n\n    The D-Bus bus server daemon provides one special interface \\c\n    org.freedesktop.DBus that allows clients to access certain\n    properties of the bus, such as the current list of clients\n    connected. The QDBusConnectionInterface class provides access to that\n    interface.\n\n    The most common uses of this class are to register and unregister\n    service names on the bus using the registerService() and\n    unregisterService() functions, query about existing names using\n    the isServiceRegistered(), registeredServiceNames() and\n    serviceOwner() functions, and to receive notification that a\n    client has registered or de-registered through the\n    serviceRegistered(), serviceUnregistered() and serviceOwnerChanged()\n    signals.\n*\/\n\n\/*!\n    \\enum QDBusConnectionInterface::ServiceQueueOptions\n\n    Flags for determining how a service registration should behave, in\n    case the service name is already registered.\n\n    \\value DontQueueService     If an application requests a name that\n                                is already owned, no queueing will be\n                                performed. The registeredService()\n                                call will simply fail.\n                                This is the default.\n\n    \\value QueueService         Attempts to register the requested\n                                service, but do not try to replace it\n                                if another application already has it\n                                registered. Instead, simply put this\n                                application in queue, until it is\n                                given up. The serviceRegistered()\n                                signal will be emitted when that\n                                happens.\n\n    \\value ReplaceExistingService If another application already has\n                                the service name registered, attempt\n                                to replace it.\n\n    \\sa ServiceReplacementOptions\n*\/\n\n\/*!\n    \\enum QDBusConnectionInterface::ServiceReplacementOptions\n\n    Flags for determining if the D-Bus server should allow another\n    application to replace a name that this application has registered\n    with the ReplaceExistingService option.\n\n    The possible values are:\n\n    \\value DontAllowReplacement Do not allow another application to\n                                replace us. The service must be\n                                explicitly unregistered with\n                                unregisterService() for another\n                                application to acquire it.\n                                This is the default.\n\n    \\value AllowReplacement     Allow other applications to replace us\n                                with the ReplaceExistingService option\n                                to registerService() without\n                                intervention. If that happens, the\n                                serviceUnregistered() signal will be\n                                emitted.\n\n    \\sa ServiceQueueOptions\n*\/\n\n\/*!\n    \\enum QDBusConnectionInterface::RegisterServiceReply\n\n    The possible return values from registerService():\n\n    \\value ServiceNotRegistered The call failed and the service name was not registered.\n    \\value ServiceRegistered    The caller is now the owner of the service name.\n    \\value ServiceQueued        The caller specified the QueueService flag and the\n                                service was already registered, so we are in queue.\n\n    The serviceRegistered() signal will be emitted when the service is\n    acquired by this application.\n*\/\n\n\/*!\n    \\internal\n*\/\nconst char *QDBusConnectionInterface::staticInterfaceName()\n{ return \"org.freedesktop.DBus\"; }\n\n\/*!\n    \\internal\n*\/\nQDBusConnectionInterface::QDBusConnectionInterface(const QDBusConnection &connection,\n                                                   QObject *parent)\n    : QDBusAbstractInterface(QLatin1String(DBUS_SERVICE_DBUS),\n                             QLatin1String(DBUS_PATH_DBUS),\n                             DBUS_INTERFACE_DBUS, connection, parent)\n{\n    connect(this, SIGNAL(NameAcquired(QString)), this, SIGNAL(serviceRegistered(QString)));\n    connect(this, SIGNAL(NameLost(QString)), this, SIGNAL(serviceUnregistered(QString)));\n    connect(this, SIGNAL(NameOwnerChanged(QString,QString,QString)),\n            this, SIGNAL(serviceOwnerChanged(QString,QString,QString)));\n}\n\n\/*!\n    \\internal\n*\/\nQDBusConnectionInterface::~QDBusConnectionInterface()\n{\n}\n\n\/*!\n    Returns the unique connection name of the primary owner of the\n    name \\a name. If the requested name doesn't have an owner, returns\n    a \\c org.freedesktop.DBus.Error.NameHasNoOwner error.\n*\/\nQDBusReply<QString> QDBusConnectionInterface::serviceOwner(const QString &name) const\n{\n    return internalConstCall(QDBus::AutoDetect, QLatin1String(\"GetNameOwner\"), QList<QVariant>() << name);\n}\n\n\/*!\n  \\property QDBusConnectionInterface::registeredServiceNames\n  \\brief holds the registered service names\n\n  Lists all names currently registered on the bus.\n*\/\nQDBusReply<QStringList> QDBusConnectionInterface::registeredServiceNames() const\n{\n    return internalConstCall(QDBus::AutoDetect, QLatin1String(\"ListNames\"));\n}\n\n\/*!\n    Returns true if the service name \\a serviceName has is currently\n    registered.\n*\/\nQDBusReply<bool> QDBusConnectionInterface::isServiceRegistered(const QString &serviceName) const\n{\n    return internalConstCall(QDBus::AutoDetect, QLatin1String(\"NameHasOwner\"),\n                             QList<QVariant>() << serviceName);\n}\n\n\/*!\n    Returns the Unix Process ID (PID) for the process currently\n    holding the bus service \\a serviceName.\n*\/\nQDBusReply<uint> QDBusConnectionInterface::servicePid(const QString &serviceName) const\n{\n    return internalConstCall(QDBus::AutoDetect, QLatin1String(\"GetConnectionUnixProcessID\"),\n                             QList<QVariant>() << serviceName);\n}\n\n\/*!\n    Returns the Unix User ID (UID) for the process currently holding\n    the bus service \\a serviceName.\n*\/\nQDBusReply<uint> QDBusConnectionInterface::serviceUid(const QString &serviceName) const\n{\n    return internalConstCall(QDBus::AutoDetect, QLatin1String(\"GetConnectionUnixUser\"),\n                             QList<QVariant>() << serviceName);\n}\n\n\/*!\n    Requests that the bus start the service given by the name \\a name.\n*\/\nQDBusReply<void> QDBusConnectionInterface::startService(const QString &name)\n{\n    return call(QLatin1String(\"StartServiceByName\"), name, uint(0));\n}\n\n\/*!\n    Requests to register the service name \\a serviceName on the\n    bus. The \\a qoption flag specifies how the D-Bus server should behave\n    if \\a serviceName is already registered. The \\a roption flag\n    specifies if the server should allow another application to\n    replace our registered name.\n\n    If the service registration succeeds, the serviceRegistered()\n    signal will be emitted. If we are placed in queue, the signal will\n    be emitted when we obtain the name. If \\a roption is\n    AllowReplacement, the serviceUnregistered() signal will be emitted\n    if another application replaces this one.\n\n    \\sa unregisterService()\n*\/\nQDBusReply<QDBusConnectionInterface::RegisterServiceReply>\nQDBusConnectionInterface::registerService(const QString &serviceName,\n                                          ServiceQueueOptions qoption,\n                                          ServiceReplacementOptions roption)\n{\n    \/\/ reconstruct the low-level flags\n    uint flags = 0;\n    switch (qoption) {\n    case DontQueueService:\n        flags = DBUS_NAME_FLAG_DO_NOT_QUEUE;\n        break;\n    case QueueService:\n        flags = 0;\n        break;\n    case ReplaceExistingService:\n        flags = DBUS_NAME_FLAG_DO_NOT_QUEUE | DBUS_NAME_FLAG_REPLACE_EXISTING;\n        break;\n    }\n\n    switch (roption) {\n    case DontAllowReplacement:\n        break;\n    case AllowReplacement:\n        flags |= DBUS_NAME_FLAG_ALLOW_REPLACEMENT;\n        break;\n    }\n\n    QDBusMessage reply = call(QLatin1String(\"RequestName\"), serviceName, flags);\n\/\/    qDebug() << \"QDBusConnectionInterface::registerService\" << serviceName << \"Reply:\" << reply;\n\n    \/\/ convert the low-level flags to something that we can use\n    if (reply.type() == QDBusMessage::ReplyMessage) {\n        uint code = 0;\n\n        switch (reply.arguments().at(0).toUInt()) {\n        case DBUS_REQUEST_NAME_REPLY_PRIMARY_OWNER:\n        case DBUS_REQUEST_NAME_REPLY_ALREADY_OWNER:\n            code = uint(ServiceRegistered);\n            break;\n\n        case DBUS_REQUEST_NAME_REPLY_EXISTS:\n            code = uint(ServiceNotRegistered);\n            break;\n\n        case DBUS_REQUEST_NAME_REPLY_IN_QUEUE:\n            code = uint(ServiceQueued);\n            break;\n        }\n\n        reply.setArguments(QVariantList() << code);\n    }\n\n    return reply;\n}\n\n\/*!\n    Releases the claim on the bus service name \\a serviceName, that\n    had been previously registered with registerService(). If this\n    application had ownership of the name, it will be released for\n    other applications to claim. If it only had the name queued, it\n    gives up its position in the queue.\n*\/\nQDBusReply<bool>\nQDBusConnectionInterface::unregisterService(const QString &serviceName)\n{\n    QDBusMessage reply = call(QLatin1String(\"ReleaseName\"), serviceName);\n    if (reply.type() == QDBusMessage::ReplyMessage) {\n        bool success = reply.arguments().at(0).toUInt() == DBUS_RELEASE_NAME_REPLY_RELEASED;\n        reply.setArguments(QVariantList() << success);\n    }\n    return reply;\n}\n\n\/*!\n    \\internal\n*\/\nvoid QDBusConnectionInterface::connectNotify(const char *signalName)\n{\n    \/\/ translate the signal names to what we really want\n    \/\/ this avoids setting hooks for signals that don't exist on the bus\n    if (qstrcmp(signalName, SIGNAL(serviceRegistered(QString))) == 0)\n        QDBusAbstractInterface::connectNotify(SIGNAL(NameAcquired(QString)));\n\n    else if (qstrcmp(signalName, SIGNAL(serviceUnregistered(QString))) == 0)\n        QDBusAbstractInterface::connectNotify(SIGNAL(NameLost(QString)));\n\n    else if (qstrcmp(signalName, SIGNAL(serviceOwnerChanged(QString,QString,QString))) == 0) {\n        QDBusAbstractInterface::connectNotify(SIGNAL(NameOwnerChanged(QString,QString,QString)));\n    }\n}\n\n\/*!\n    \\internal\n*\/\nvoid QDBusConnectionInterface::disconnectNotify(const char *signalName)\n{\n    \/\/ translate the signal names to what we really want\n    \/\/ this avoids setting hooks for signals that don't exist on the bus\n    if (qstrcmp(signalName, SIGNAL(serviceRegistered(QString))) == 0)\n        QDBusAbstractInterface::disconnectNotify(SIGNAL(NameAcquired(QString)));\n\n    else if (qstrcmp(signalName, SIGNAL(serviceUnregistered(QString))) == 0)\n        QDBusAbstractInterface::disconnectNotify(SIGNAL(NameLost(QString)));\n\n    else if (qstrcmp(signalName, SIGNAL(serviceOwnerChanged(QString,QString,QString))) == 0)\n        QDBusAbstractInterface::disconnectNotify(SIGNAL(NameOwnerChanged(QString,QString,QString)));\n}\n\n\/\/ signals\n\/*!\n    \\fn QDBusConnectionInterface::serviceRegistered(const QString &serviceName)\n\n    This signal is emitted by the D-Bus server when the bus service\n    name (unique connection name or well-known service name) given by\n    \\a serviceName is acquired by this application.\n\n    Acquisition happens after this application has requested a name using\n    registerService().\n*\/\n\n\/*!\n    \\fn QDBusConnectionInterface::serviceUnregistered(const QString &serviceName)\n\n    This signal is emitted by the D-Bus server when this application\n    loses ownership of the bus service name given by \\a serviceName.\n*\/\n\n\/*!\n    \\fn QDBusConnectionInterface::serviceOwnerChanged(const QString &name, const QString &oldOwner, const QString &newOwner)\n\n    This signal is emitted by the D-Bus server whenever a service\n    ownership change happens in the bus, including apparition and\n    disparition of names.\n\n    This signal means the application \\a oldOwner lost ownership of\n    bus name \\a name to application \\a newOwner. If \\a oldOwner is an\n    empty string, it means the name \\a name has just been created; if\n    \\a newOwner is empty, the name \\a name has no current owner and is\n    no longer available.\n*\/\n\n\/*!\n  \\fn void QDBusConnectionInterface::callWithCallbackFailed(const QDBusError &error, const QDBusMessage &call)\n\n  This signal is emitted when there is an error during a\n  QDBusConnection::callWithCallback(). \\a error specifies the error.\n  \\a call is the message that couldn't be delivered.\n\n  \\sa QDBusConnection::callWithCallback()\n *\/\n\nQT_END_NAMESPACE\n<commit_msg>Revert \"Disable the deprecation warning for this signal since we're using it now\"<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 QtDBus module of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the 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 \"qdbusconnectioninterface.h\"\n\n#include <QtCore\/QByteArray>\n#include <QtCore\/QList>\n#include <QtCore\/QMap>\n#include <QtCore\/QString>\n#include <QtCore\/QStringList>\n#include <QtCore\/QVariant>\n#include <QtCore\/QDebug>\n\n#include <qdbus_symbols_p.h>          \/\/ for the DBUS_* constants\n\nQT_BEGIN_NAMESPACE\n\n\/*\n * Implementation of interface class QDBusConnectionInterface\n *\/\n\n\/*!\n    \\class QDBusConnectionInterface\n    \\inmodule QtDBus\n    \\since 4.2\n\n    \\brief The QDBusConnectionInterface class provides access to the D-Bus bus daemon service.\n\n    The D-Bus bus server daemon provides one special interface \\c\n    org.freedesktop.DBus that allows clients to access certain\n    properties of the bus, such as the current list of clients\n    connected. The QDBusConnectionInterface class provides access to that\n    interface.\n\n    The most common uses of this class are to register and unregister\n    service names on the bus using the registerService() and\n    unregisterService() functions, query about existing names using\n    the isServiceRegistered(), registeredServiceNames() and\n    serviceOwner() functions, and to receive notification that a\n    client has registered or de-registered through the\n    serviceRegistered(), serviceUnregistered() and serviceOwnerChanged()\n    signals.\n*\/\n\n\/*!\n    \\enum QDBusConnectionInterface::ServiceQueueOptions\n\n    Flags for determining how a service registration should behave, in\n    case the service name is already registered.\n\n    \\value DontQueueService     If an application requests a name that\n                                is already owned, no queueing will be\n                                performed. The registeredService()\n                                call will simply fail.\n                                This is the default.\n\n    \\value QueueService         Attempts to register the requested\n                                service, but do not try to replace it\n                                if another application already has it\n                                registered. Instead, simply put this\n                                application in queue, until it is\n                                given up. The serviceRegistered()\n                                signal will be emitted when that\n                                happens.\n\n    \\value ReplaceExistingService If another application already has\n                                the service name registered, attempt\n                                to replace it.\n\n    \\sa ServiceReplacementOptions\n*\/\n\n\/*!\n    \\enum QDBusConnectionInterface::ServiceReplacementOptions\n\n    Flags for determining if the D-Bus server should allow another\n    application to replace a name that this application has registered\n    with the ReplaceExistingService option.\n\n    The possible values are:\n\n    \\value DontAllowReplacement Do not allow another application to\n                                replace us. The service must be\n                                explicitly unregistered with\n                                unregisterService() for another\n                                application to acquire it.\n                                This is the default.\n\n    \\value AllowReplacement     Allow other applications to replace us\n                                with the ReplaceExistingService option\n                                to registerService() without\n                                intervention. If that happens, the\n                                serviceUnregistered() signal will be\n                                emitted.\n\n    \\sa ServiceQueueOptions\n*\/\n\n\/*!\n    \\enum QDBusConnectionInterface::RegisterServiceReply\n\n    The possible return values from registerService():\n\n    \\value ServiceNotRegistered The call failed and the service name was not registered.\n    \\value ServiceRegistered    The caller is now the owner of the service name.\n    \\value ServiceQueued        The caller specified the QueueService flag and the\n                                service was already registered, so we are in queue.\n\n    The serviceRegistered() signal will be emitted when the service is\n    acquired by this application.\n*\/\n\n\/*!\n    \\internal\n*\/\nconst char *QDBusConnectionInterface::staticInterfaceName()\n{ return \"org.freedesktop.DBus\"; }\n\n\/*!\n    \\internal\n*\/\nQDBusConnectionInterface::QDBusConnectionInterface(const QDBusConnection &connection,\n                                                   QObject *parent)\n    : QDBusAbstractInterface(QLatin1String(DBUS_SERVICE_DBUS),\n                             QLatin1String(DBUS_PATH_DBUS),\n                             DBUS_INTERFACE_DBUS, connection, parent)\n{\n    connect(this, SIGNAL(NameAcquired(QString)), this, SIGNAL(serviceRegistered(QString)));\n    connect(this, SIGNAL(NameLost(QString)), this, SIGNAL(serviceUnregistered(QString)));\n    connect(this, SIGNAL(NameOwnerChanged(QString,QString,QString)),\n            this, SIGNAL(serviceOwnerChanged(QString,QString,QString)));\n}\n\n\/*!\n    \\internal\n*\/\nQDBusConnectionInterface::~QDBusConnectionInterface()\n{\n}\n\n\/*!\n    Returns the unique connection name of the primary owner of the\n    name \\a name. If the requested name doesn't have an owner, returns\n    a \\c org.freedesktop.DBus.Error.NameHasNoOwner error.\n*\/\nQDBusReply<QString> QDBusConnectionInterface::serviceOwner(const QString &name) const\n{\n    return internalConstCall(QDBus::AutoDetect, QLatin1String(\"GetNameOwner\"), QList<QVariant>() << name);\n}\n\n\/*!\n  \\property QDBusConnectionInterface::registeredServiceNames\n  \\brief holds the registered service names\n\n  Lists all names currently registered on the bus.\n*\/\nQDBusReply<QStringList> QDBusConnectionInterface::registeredServiceNames() const\n{\n    return internalConstCall(QDBus::AutoDetect, QLatin1String(\"ListNames\"));\n}\n\n\/*!\n    Returns true if the service name \\a serviceName has is currently\n    registered.\n*\/\nQDBusReply<bool> QDBusConnectionInterface::isServiceRegistered(const QString &serviceName) const\n{\n    return internalConstCall(QDBus::AutoDetect, QLatin1String(\"NameHasOwner\"),\n                             QList<QVariant>() << serviceName);\n}\n\n\/*!\n    Returns the Unix Process ID (PID) for the process currently\n    holding the bus service \\a serviceName.\n*\/\nQDBusReply<uint> QDBusConnectionInterface::servicePid(const QString &serviceName) const\n{\n    return internalConstCall(QDBus::AutoDetect, QLatin1String(\"GetConnectionUnixProcessID\"),\n                             QList<QVariant>() << serviceName);\n}\n\n\/*!\n    Returns the Unix User ID (UID) for the process currently holding\n    the bus service \\a serviceName.\n*\/\nQDBusReply<uint> QDBusConnectionInterface::serviceUid(const QString &serviceName) const\n{\n    return internalConstCall(QDBus::AutoDetect, QLatin1String(\"GetConnectionUnixUser\"),\n                             QList<QVariant>() << serviceName);\n}\n\n\/*!\n    Requests that the bus start the service given by the name \\a name.\n*\/\nQDBusReply<void> QDBusConnectionInterface::startService(const QString &name)\n{\n    return call(QLatin1String(\"StartServiceByName\"), name, uint(0));\n}\n\n\/*!\n    Requests to register the service name \\a serviceName on the\n    bus. The \\a qoption flag specifies how the D-Bus server should behave\n    if \\a serviceName is already registered. The \\a roption flag\n    specifies if the server should allow another application to\n    replace our registered name.\n\n    If the service registration succeeds, the serviceRegistered()\n    signal will be emitted. If we are placed in queue, the signal will\n    be emitted when we obtain the name. If \\a roption is\n    AllowReplacement, the serviceUnregistered() signal will be emitted\n    if another application replaces this one.\n\n    \\sa unregisterService()\n*\/\nQDBusReply<QDBusConnectionInterface::RegisterServiceReply>\nQDBusConnectionInterface::registerService(const QString &serviceName,\n                                          ServiceQueueOptions qoption,\n                                          ServiceReplacementOptions roption)\n{\n    \/\/ reconstruct the low-level flags\n    uint flags = 0;\n    switch (qoption) {\n    case DontQueueService:\n        flags = DBUS_NAME_FLAG_DO_NOT_QUEUE;\n        break;\n    case QueueService:\n        flags = 0;\n        break;\n    case ReplaceExistingService:\n        flags = DBUS_NAME_FLAG_DO_NOT_QUEUE | DBUS_NAME_FLAG_REPLACE_EXISTING;\n        break;\n    }\n\n    switch (roption) {\n    case DontAllowReplacement:\n        break;\n    case AllowReplacement:\n        flags |= DBUS_NAME_FLAG_ALLOW_REPLACEMENT;\n        break;\n    }\n\n    QDBusMessage reply = call(QLatin1String(\"RequestName\"), serviceName, flags);\n\/\/    qDebug() << \"QDBusConnectionInterface::registerService\" << serviceName << \"Reply:\" << reply;\n\n    \/\/ convert the low-level flags to something that we can use\n    if (reply.type() == QDBusMessage::ReplyMessage) {\n        uint code = 0;\n\n        switch (reply.arguments().at(0).toUInt()) {\n        case DBUS_REQUEST_NAME_REPLY_PRIMARY_OWNER:\n        case DBUS_REQUEST_NAME_REPLY_ALREADY_OWNER:\n            code = uint(ServiceRegistered);\n            break;\n\n        case DBUS_REQUEST_NAME_REPLY_EXISTS:\n            code = uint(ServiceNotRegistered);\n            break;\n\n        case DBUS_REQUEST_NAME_REPLY_IN_QUEUE:\n            code = uint(ServiceQueued);\n            break;\n        }\n\n        reply.setArguments(QVariantList() << code);\n    }\n\n    return reply;\n}\n\n\/*!\n    Releases the claim on the bus service name \\a serviceName, that\n    had been previously registered with registerService(). If this\n    application had ownership of the name, it will be released for\n    other applications to claim. If it only had the name queued, it\n    gives up its position in the queue.\n*\/\nQDBusReply<bool>\nQDBusConnectionInterface::unregisterService(const QString &serviceName)\n{\n    QDBusMessage reply = call(QLatin1String(\"ReleaseName\"), serviceName);\n    if (reply.type() == QDBusMessage::ReplyMessage) {\n        bool success = reply.arguments().at(0).toUInt() == DBUS_RELEASE_NAME_REPLY_RELEASED;\n        reply.setArguments(QVariantList() << success);\n    }\n    return reply;\n}\n\n\/*!\n    \\internal\n*\/\nvoid QDBusConnectionInterface::connectNotify(const char *signalName)\n{\n    \/\/ translate the signal names to what we really want\n    \/\/ this avoids setting hooks for signals that don't exist on the bus\n    if (qstrcmp(signalName, SIGNAL(serviceRegistered(QString))) == 0)\n        QDBusAbstractInterface::connectNotify(SIGNAL(NameAcquired(QString)));\n\n    else if (qstrcmp(signalName, SIGNAL(serviceUnregistered(QString))) == 0)\n        QDBusAbstractInterface::connectNotify(SIGNAL(NameLost(QString)));\n\n    else if (qstrcmp(signalName, SIGNAL(serviceOwnerChanged(QString,QString,QString))) == 0) {\n        static bool warningPrinted = false;\n        if (!warningPrinted) {\n            qWarning(\"Connecting to deprecated signal QDBusConnectionInterface::serviceOwnerChanged(QString,QString,QString)\");\n            warningPrinted = true;\n        }\n        QDBusAbstractInterface::connectNotify(SIGNAL(NameOwnerChanged(QString,QString,QString)));\n    }\n}\n\n\/*!\n    \\internal\n*\/\nvoid QDBusConnectionInterface::disconnectNotify(const char *signalName)\n{\n    \/\/ translate the signal names to what we really want\n    \/\/ this avoids setting hooks for signals that don't exist on the bus\n    if (qstrcmp(signalName, SIGNAL(serviceRegistered(QString))) == 0)\n        QDBusAbstractInterface::disconnectNotify(SIGNAL(NameAcquired(QString)));\n\n    else if (qstrcmp(signalName, SIGNAL(serviceUnregistered(QString))) == 0)\n        QDBusAbstractInterface::disconnectNotify(SIGNAL(NameLost(QString)));\n\n    else if (qstrcmp(signalName, SIGNAL(serviceOwnerChanged(QString,QString,QString))) == 0)\n        QDBusAbstractInterface::disconnectNotify(SIGNAL(NameOwnerChanged(QString,QString,QString)));\n}\n\n\/\/ signals\n\/*!\n    \\fn QDBusConnectionInterface::serviceRegistered(const QString &serviceName)\n\n    This signal is emitted by the D-Bus server when the bus service\n    name (unique connection name or well-known service name) given by\n    \\a serviceName is acquired by this application.\n\n    Acquisition happens after this application has requested a name using\n    registerService().\n*\/\n\n\/*!\n    \\fn QDBusConnectionInterface::serviceUnregistered(const QString &serviceName)\n\n    This signal is emitted by the D-Bus server when this application\n    loses ownership of the bus service name given by \\a serviceName.\n*\/\n\n\/*!\n    \\fn QDBusConnectionInterface::serviceOwnerChanged(const QString &name, const QString &oldOwner, const QString &newOwner)\n\n    This signal is emitted by the D-Bus server whenever a service\n    ownership change happens in the bus, including apparition and\n    disparition of names.\n\n    This signal means the application \\a oldOwner lost ownership of\n    bus name \\a name to application \\a newOwner. If \\a oldOwner is an\n    empty string, it means the name \\a name has just been created; if\n    \\a newOwner is empty, the name \\a name has no current owner and is\n    no longer available.\n*\/\n\n\/*!\n  \\fn void QDBusConnectionInterface::callWithCallbackFailed(const QDBusError &error, const QDBusMessage &call)\n\n  This signal is emitted when there is an error during a\n  QDBusConnection::callWithCallback(). \\a error specifies the error.\n  \\a call is the message that couldn't be delivered.\n\n  \\sa QDBusConnection::callWithCallback()\n *\/\n\nQT_END_NAMESPACE\n<|endoftext|>"}
{"text":"<commit_before>\/* This file is part of VoltDB.\n * Copyright (C) 2008-2013 VoltDB Inc.\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 VoltDB.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n#include \"storage\/CopyOnWriteContext.h\"\n#include \"storage\/temptable.h\"\n#include \"storage\/tablefactory.h\"\n#include \"storage\/CopyOnWriteIterator.h\"\n#include \"storage\/tableiterator.h\"\n#include \"common\/FatalException.hpp\"\n#include <algorithm>\n#include <cassert>\n\nnamespace voltdb {\n\nCopyOnWriteContext::CopyOnWriteContext(PersistentTable *table, TupleSerializer *serializer, int32_t partitionId) :\n             m_table(table),\n             m_backedUpTuples(TableFactory::getCopiedTempTable(table->databaseId(),\n                                                               \"COW of \" + table->name(),\n                                                               table, NULL)),\n             m_serializer(serializer), m_pool(2097152, 320), m_blocks(m_table->m_data),\n             m_iterator(new CopyOnWriteIterator(table, m_blocks.begin(), m_blocks.end())),\n             m_maxTupleLength(serializer->getMaxSerializedTupleSize(table->schema())),\n             m_tuple(table->schema()), m_finishedTableScan(false), m_partitionId(partitionId),\n             m_tuplesSerialized(0),\n             m_expectedTupleCount(static_cast<int32_t>(table->activeTupleCount())) {}\n\nbool CopyOnWriteContext::serializeMore(ReferenceSerializeOutput *out) {\n    out->writeInt(m_partitionId);\n    int rowsSerialized = 0;\n    const std::size_t rowCountPosition = out->reserveBytes(4);\n\n    TableTuple tuple(m_table->schema());\n    if (out->remaining() < (m_maxTupleLength + sizeof(int32_t))) {\n        throwFatalException(\"Serialize more should never be called \"\n                \"a 2nd time after return indicating there is no more data\");\n\/\/        out->writeInt(0);\n\/\/        assert(false);\n\/\/        return false;\n    }\n\n    std::size_t bytesSerialized = 0;\n    while (out->remaining() >= (m_maxTupleLength + sizeof(int32_t))) {\n        const bool hadMore = m_iterator->next(tuple);\n\n        \/**\n         * After this finishes scanning the persistent table switch to scanning\n         * the temp table with the tuples that were backed up\n         *\/\n        if (!hadMore) {\n            if (m_finishedTableScan) {\n                out->writeIntAt( rowCountPosition, rowsSerialized);\n                if (m_tuplesSerialized != m_expectedTupleCount) {\n                    throwFatalException(\n                            \"Expected %d rows but only found %d rows while serializing snapshot\",\n                            m_expectedTupleCount, m_tuplesSerialized);\n                }\n                return false;\n            } else {\n                m_finishedTableScan = true;\n                m_iterator.reset(m_backedUpTuples.get()->makeIterator());\n                continue;\n            }\n        }\n\n        const std::size_t tupleStartPosition = out->position();\n        m_serializer->serializeTo( tuple, out);\n        const std::size_t tupleEndPosition = out->position();\n        m_tuplesSerialized++;\n        rowsSerialized++;\n\n        \/*\n         * If this is the table scan, check to see if the tuple is pending delete\n         * and return the tuple if it is\n         *\/\n        if (!m_finishedTableScan && tuple.isPendingDelete()) {\n            assert(!tuple.isPendingDeleteOnUndoRelease());\n            if (m_table->m_schema->getUninlinedObjectColumnCount() != 0)\n            {\n                m_table->decreaseStringMemCount(tuple.getNonInlinedMemorySize());\n            }\n            tuple.setPendingDeleteFalse();\n            tuple.freeObjectColumns();\n            CopyOnWriteIterator *iter = static_cast<CopyOnWriteIterator*>(m_iterator.get());\n            \/\/Save the extra lookup if possible\n            m_table->deleteTupleStorage(tuple, iter->m_currentBlock);\n        }\n\n        \/\/ If we have serialized more than 512Kb of tuple data, stop for a while\n        bytesSerialized += tupleEndPosition - tupleStartPosition;\n        if (bytesSerialized >= 1024 * 512) {\n            break;\n        }\n    }\n    \/*\n     * Number of rows serialized is not known until the end. Written at the end so it\n     * can be included in the CRC. It will be moved back to the front\n     * to match the table serialization format when chunk is read later.\n     *\/\n    out->writeIntAt( rowCountPosition, rowsSerialized);\n    return true;\n}\n\nbool CopyOnWriteContext::canSafelyFreeTuple(TableTuple tuple) {\n    if (tuple.isDirty() || m_finishedTableScan) {\n        return true;\n    }\n\n    \/**\n     * Find out which block the address is contained in. Lower bound returns the first entry\n     * in the index >= the address. Unless the address happens to be equal then the block\n     * we are looking for is probably the previous entry. Then check if the address fits\n     * in the previous entry. If it doesn't then the block is something new.\n     *\/\n    char *address = tuple.address();\n    TBMapI i =\n                            m_blocks.lower_bound(address);\n    if (i == m_blocks.end() && m_blocks.empty()) {\n        return true;\n    }\n    if (i == m_blocks.end()) {\n        i--;\n        if (i.key() + m_table->m_tableAllocationSize < address) {\n            return true;\n        }\n        \/\/OK it is in the very last block\n    } else {\n        if (i.key() != address) {\n            i--;\n            if (i.key() + m_table->m_tableAllocationSize < address) {\n                return true;\n            }\n            \/\/OK... this is in this particular block\n        }\n    }\n\n    const char *blockStartAddress = i.key();\n\n    \/**\n     * Now check where this is relative to the COWIterator.\n     *\/\n    CopyOnWriteIterator *iter = reinterpret_cast<CopyOnWriteIterator*>(m_iterator.get());\n    return !iter->needToDirtyTuple(blockStartAddress, address);\n}\n\nvoid CopyOnWriteContext::markTupleDirty(TableTuple tuple, bool newTuple) {\n    \/**\n     * If this an update or a delete of a tuple that is already dirty then no further action is\n     * required.\n     *\/\n    if (!newTuple && tuple.isDirty()) {\n        return;\n    }\n\n    \/**\n     * If the table has been scanned already there is no need to continue marking tuples dirty\n     * If the tuple is dirty then it has already been backed up.\n     *\/\n    if (m_finishedTableScan) {\n        tuple.setDirtyFalse();\n        return;\n    }\n\n    \/**\n     * Find out which block the address is contained in.\n     *\/\n    char *address = tuple.address();\n    TBMapI i =\n                            m_blocks.lower_bound(address);\n    if (i == m_blocks.end() && m_blocks.empty()) {\n        tuple.setDirtyFalse();\n        return;\n    }\n    if (i == m_blocks.end()) {\n        i--;\n        if (i.key() + m_table->m_tableAllocationSize < address) {\n            tuple.setDirtyFalse();\n            return;\n        }\n        \/\/OK it is in the very last block\n    } else {\n        if (i.key() != address) {\n            i--;\n            if (i.key() + m_table->m_tableAllocationSize < address) {\n                tuple.setDirtyFalse();\n                return;\n            }\n            \/\/OK... this is in this particular block\n        }\n    }\n\n    const char *blockStartAddress = i.key();\n\n    \/**\n     * Now check where this is relative to the COWIterator.\n     *\/\n    CopyOnWriteIterator *iter = reinterpret_cast<CopyOnWriteIterator*>(m_iterator.get());\n    if (iter->needToDirtyTuple(blockStartAddress, address)) {\n        tuple.setDirtyTrue();\n        \/**\n         * Don't back up a newly introduced tuple, just mark it as dirty.\n         *\/\n        if (!newTuple) {\n            m_backedUpTuples->insertTupleNonVirtualWithDeepCopy(tuple, &m_pool);\n        }\n    } else {\n        tuple.setDirtyFalse();\n        return;\n    }\n}\n\nvoid CopyOnWriteContext::notifyBlockWasCompactedAway(TBPtr block) {\n    assert(!m_finishedTableScan);\n    CopyOnWriteIterator *iter = static_cast<CopyOnWriteIterator*>(m_iterator.get());\n    if (iter->m_blockIterator != m_blocks.end()) {\n        TBPtr nextBlock = iter->m_blockIterator.data();\n        \/\/The next block is the one that was compacted away\n        \/\/Need to move the iterator forward to skip it\n        if (nextBlock == block) {\n            iter->m_blockIterator++;\n\n            \/\/There is another block after the one that was compacted away\n            if (iter->m_blockIterator != m_blocks.end()) {\n                TBPtr newNextBlock = iter->m_blockIterator.data();\n                m_blocks.erase(block->address());\n                iter->m_blockIterator = m_blocks.find(newNextBlock->address());\n                iter->m_end = m_blocks.end();\n                assert(iter->m_blockIterator != m_blocks.end());\n            } else {\n                \/\/No block after the one compacted away\n                \/\/set everything to end\n                m_blocks.erase(block->address());\n                iter->m_blockIterator = m_blocks.end();\n                iter->m_end = m_blocks.end();\n            }\n        } else {\n            \/\/Some random block was compacted away. Remove it and regenerate the iterator\n            m_blocks.erase(block->address());\n            iter->m_blockIterator = m_blocks.find(nextBlock->address());\n            iter->m_end = m_blocks.end();\n            assert(iter->m_blockIterator != m_blocks.end());\n        }\n    }\n}\n\nCopyOnWriteContext::~CopyOnWriteContext() {}\n\n}\n<commit_msg>Change from fatal exception to log so people can still get their data out.<commit_after>\/* This file is part of VoltDB.\n * Copyright (C) 2008-2013 VoltDB Inc.\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 VoltDB.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n#include \"storage\/CopyOnWriteContext.h\"\n#include \"storage\/temptable.h\"\n#include \"storage\/tablefactory.h\"\n#include \"storage\/CopyOnWriteIterator.h\"\n#include \"storage\/tableiterator.h\"\n#include \"common\/FatalException.hpp\"\n#include \"logging\/LogManager.h\"\n#include <algorithm>\n#include <cassert>\n\nnamespace voltdb {\n\nCopyOnWriteContext::CopyOnWriteContext(PersistentTable *table, TupleSerializer *serializer, int32_t partitionId) :\n             m_table(table),\n             m_backedUpTuples(TableFactory::getCopiedTempTable(table->databaseId(),\n                                                               \"COW of \" + table->name(),\n                                                               table, NULL)),\n             m_serializer(serializer), m_pool(2097152, 320), m_blocks(m_table->m_data),\n             m_iterator(new CopyOnWriteIterator(table, m_blocks.begin(), m_blocks.end())),\n             m_maxTupleLength(serializer->getMaxSerializedTupleSize(table->schema())),\n             m_tuple(table->schema()), m_finishedTableScan(false), m_partitionId(partitionId),\n             m_tuplesSerialized(0),\n             m_expectedTupleCount(static_cast<int32_t>(table->activeTupleCount())) {}\n\nbool CopyOnWriteContext::serializeMore(ReferenceSerializeOutput *out) {\n    out->writeInt(m_partitionId);\n    int rowsSerialized = 0;\n    const std::size_t rowCountPosition = out->reserveBytes(4);\n\n    TableTuple tuple(m_table->schema());\n    if (out->remaining() < (m_maxTupleLength + sizeof(int32_t))) {\n        throwFatalException(\"Serialize more should never be called \"\n                \"a 2nd time after return indicating there is no more data\");\n\/\/        out->writeInt(0);\n\/\/        assert(false);\n\/\/        return false;\n    }\n\n    std::size_t bytesSerialized = 0;\n    while (out->remaining() >= (m_maxTupleLength + sizeof(int32_t))) {\n        const bool hadMore = m_iterator->next(tuple);\n\n        \/**\n         * After this finishes scanning the persistent table switch to scanning\n         * the temp table with the tuples that were backed up\n         *\/\n        if (!hadMore) {\n            if (m_finishedTableScan) {\n                out->writeIntAt( rowCountPosition, rowsSerialized);\n                if (m_tuplesSerialized != m_expectedTupleCount) {\n                    char message[1024 * 16];\n                    snprintf(message, 1024 * 16, \"Expected %d rows but only found %d rows while serializing snapshot\",\n                            m_expectedTupleCount, m_tuplesSerialized);\n                    LogManager::getThreadLogger(LOGGERID_HOST)->log(LOGLEVEL_ERROR, message);\n                }\n                return false;\n            } else {\n                m_finishedTableScan = true;\n                m_iterator.reset(m_backedUpTuples.get()->makeIterator());\n                continue;\n            }\n        }\n\n        const std::size_t tupleStartPosition = out->position();\n        m_serializer->serializeTo( tuple, out);\n        const std::size_t tupleEndPosition = out->position();\n        m_tuplesSerialized++;\n        rowsSerialized++;\n\n        \/*\n         * If this is the table scan, check to see if the tuple is pending delete\n         * and return the tuple if it is\n         *\/\n        if (!m_finishedTableScan && tuple.isPendingDelete()) {\n            assert(!tuple.isPendingDeleteOnUndoRelease());\n            if (m_table->m_schema->getUninlinedObjectColumnCount() != 0)\n            {\n                m_table->decreaseStringMemCount(tuple.getNonInlinedMemorySize());\n            }\n            tuple.setPendingDeleteFalse();\n            tuple.freeObjectColumns();\n            CopyOnWriteIterator *iter = static_cast<CopyOnWriteIterator*>(m_iterator.get());\n            \/\/Save the extra lookup if possible\n            m_table->deleteTupleStorage(tuple, iter->m_currentBlock);\n        }\n\n        \/\/ If we have serialized more than 512Kb of tuple data, stop for a while\n        bytesSerialized += tupleEndPosition - tupleStartPosition;\n        if (bytesSerialized >= 1024 * 512) {\n            break;\n        }\n    }\n    \/*\n     * Number of rows serialized is not known until the end. Written at the end so it\n     * can be included in the CRC. It will be moved back to the front\n     * to match the table serialization format when chunk is read later.\n     *\/\n    out->writeIntAt( rowCountPosition, rowsSerialized);\n    return true;\n}\n\nbool CopyOnWriteContext::canSafelyFreeTuple(TableTuple tuple) {\n    if (tuple.isDirty() || m_finishedTableScan) {\n        return true;\n    }\n\n    \/**\n     * Find out which block the address is contained in. Lower bound returns the first entry\n     * in the index >= the address. Unless the address happens to be equal then the block\n     * we are looking for is probably the previous entry. Then check if the address fits\n     * in the previous entry. If it doesn't then the block is something new.\n     *\/\n    char *address = tuple.address();\n    TBMapI i =\n                            m_blocks.lower_bound(address);\n    if (i == m_blocks.end() && m_blocks.empty()) {\n        return true;\n    }\n    if (i == m_blocks.end()) {\n        i--;\n        if (i.key() + m_table->m_tableAllocationSize < address) {\n            return true;\n        }\n        \/\/OK it is in the very last block\n    } else {\n        if (i.key() != address) {\n            i--;\n            if (i.key() + m_table->m_tableAllocationSize < address) {\n                return true;\n            }\n            \/\/OK... this is in this particular block\n        }\n    }\n\n    const char *blockStartAddress = i.key();\n\n    \/**\n     * Now check where this is relative to the COWIterator.\n     *\/\n    CopyOnWriteIterator *iter = reinterpret_cast<CopyOnWriteIterator*>(m_iterator.get());\n    return !iter->needToDirtyTuple(blockStartAddress, address);\n}\n\nvoid CopyOnWriteContext::markTupleDirty(TableTuple tuple, bool newTuple) {\n    \/**\n     * If this an update or a delete of a tuple that is already dirty then no further action is\n     * required.\n     *\/\n    if (!newTuple && tuple.isDirty()) {\n        return;\n    }\n\n    \/**\n     * If the table has been scanned already there is no need to continue marking tuples dirty\n     * If the tuple is dirty then it has already been backed up.\n     *\/\n    if (m_finishedTableScan) {\n        tuple.setDirtyFalse();\n        return;\n    }\n\n    \/**\n     * Find out which block the address is contained in.\n     *\/\n    char *address = tuple.address();\n    TBMapI i =\n                            m_blocks.lower_bound(address);\n    if (i == m_blocks.end() && m_blocks.empty()) {\n        tuple.setDirtyFalse();\n        return;\n    }\n    if (i == m_blocks.end()) {\n        i--;\n        if (i.key() + m_table->m_tableAllocationSize < address) {\n            tuple.setDirtyFalse();\n            return;\n        }\n        \/\/OK it is in the very last block\n    } else {\n        if (i.key() != address) {\n            i--;\n            if (i.key() + m_table->m_tableAllocationSize < address) {\n                tuple.setDirtyFalse();\n                return;\n            }\n            \/\/OK... this is in this particular block\n        }\n    }\n\n    const char *blockStartAddress = i.key();\n\n    \/**\n     * Now check where this is relative to the COWIterator.\n     *\/\n    CopyOnWriteIterator *iter = reinterpret_cast<CopyOnWriteIterator*>(m_iterator.get());\n    if (iter->needToDirtyTuple(blockStartAddress, address)) {\n        tuple.setDirtyTrue();\n        \/**\n         * Don't back up a newly introduced tuple, just mark it as dirty.\n         *\/\n        if (!newTuple) {\n            m_backedUpTuples->insertTupleNonVirtualWithDeepCopy(tuple, &m_pool);\n        }\n    } else {\n        tuple.setDirtyFalse();\n        return;\n    }\n}\n\nvoid CopyOnWriteContext::notifyBlockWasCompactedAway(TBPtr block) {\n    assert(!m_finishedTableScan);\n    CopyOnWriteIterator *iter = static_cast<CopyOnWriteIterator*>(m_iterator.get());\n    if (iter->m_blockIterator != m_blocks.end()) {\n        TBPtr nextBlock = iter->m_blockIterator.data();\n        \/\/The next block is the one that was compacted away\n        \/\/Need to move the iterator forward to skip it\n        if (nextBlock == block) {\n            iter->m_blockIterator++;\n\n            \/\/There is another block after the one that was compacted away\n            if (iter->m_blockIterator != m_blocks.end()) {\n                TBPtr newNextBlock = iter->m_blockIterator.data();\n                m_blocks.erase(block->address());\n                iter->m_blockIterator = m_blocks.find(newNextBlock->address());\n                iter->m_end = m_blocks.end();\n                assert(iter->m_blockIterator != m_blocks.end());\n            } else {\n                \/\/No block after the one compacted away\n                \/\/set everything to end\n                m_blocks.erase(block->address());\n                iter->m_blockIterator = m_blocks.end();\n                iter->m_end = m_blocks.end();\n            }\n        } else {\n            \/\/Some random block was compacted away. Remove it and regenerate the iterator\n            m_blocks.erase(block->address());\n            iter->m_blockIterator = m_blocks.find(nextBlock->address());\n            iter->m_end = m_blocks.end();\n            assert(iter->m_blockIterator != m_blocks.end());\n        }\n    }\n}\n\nCopyOnWriteContext::~CopyOnWriteContext() {}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n===========================================================================\nDaemon BSD Source Code\nCopyright (c) 2013-2014, Daemon Developers\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n    * Redistributions of source code must retain the above copyright\n      notice, this list of conditions and the following disclaimer.\n    * Redistributions in binary form must reproduce the above copyright\n      notice, this list of conditions and the following disclaimer in the\n      documentation and\/or other materials provided with the distribution.\n    * Neither the name of the Daemon developers nor the\n      names of its contributors may be used to endorse or promote products\n      derived from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\nANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\nWARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL DAEMON DEVELOPERS BE LIABLE FOR ANY\nDIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\nLOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\nON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n===========================================================================\n*\/\n\n#include \"qcommon\/q_shared.h\"\n#include \"ConsoleField.h\"\n#include \"CommandSystem.h\"\n\nnamespace Console {\n\n    Field::Field(int size): LineEditData(size), hist(HISTORY_END) {\n    }\n\n    void Field::HistoryPrev() {\n        std::string current = Str::UTF32To8(GetText());\n        PrevLine(hist, current);\n        SetText(Str::UTF8To32(current));\n    }\n\n    void Field::HistoryNext() {\n        std::string current = Str::UTF32To8(GetText());\n        NextLine(hist, current);\n        SetText(Str::UTF8To32(current));\n    }\n\n    void Field::RunCommand(Str::StringRef defaultCommand) {\n        if (GetText().empty()) {\n            return;\n        }\n\n        std::string current = Str::UTF32To8(GetText());\n        if (current[0] == '\/' or current[0] == '\\\\') {\n            Cmd::BufferCommandText(current.c_str() + 1, true);\n        } else if (defaultCommand.empty()) {\n            Cmd::BufferCommandText(current, true);\n        } else {\n            Cmd::BufferCommandText(defaultCommand + \" \" + Cmd::Escape(current), true);\n        }\n        AddToHistory(hist, std::move(current));\n\n        Clear();\n    }\n\n    void Field::AutoComplete() {\n        \/\/We want to complete in the middle of a command text with potentially multiple commands\n\n        \/\/Add slash prefix and get command text up to cursor\n        if (GetText().empty() || (GetText()[0] != '\/' && GetText()[0] != '\\\\')) {\n            GetText().insert(GetText().begin(), '\/');\n            SetCursor(GetCursorPos() + 1);\n        }\n        std::string commandText = Str::UTF32To8(GetText().substr(1, GetCursorPos() - 1));\n\n        \/\/Split the command text and find the command to complete\n        const char* commandStart = commandText.data();\n        const char* commandEnd = commandText.data() + commandText.size();\n        while (true) {\n            const char* next = Cmd::SplitCommand(commandStart, commandEnd);\n            if (next != commandEnd)\n                commandStart = next;\n            else\n                break;\n        }\n\n        \/\/Parse the arguments and get the list of candidates\n        Cmd::Args args(std::string(commandStart, commandEnd));\n        int argNum = args.Argc() - 1;\n        std::string prefix;\n        if (!args.Argc() || Str::cisspace(GetText()[GetCursorPos() - 1])) {\n            argNum++;\n        } else {\n            prefix = args.Argv(argNum);\n        }\n\n        Cmd::CompletionResult candidates = Cmd::CompleteArgument(args, argNum);\n        if (candidates.empty()) {\n            return;\n        }\n        std::sort(candidates.begin(), candidates.end());\n        candidates.erase(std::unique(candidates.begin(), candidates.end()), candidates.end());\n\n        \/\/Compute the longest common prefix of all the results\n        int prefixSize = candidates[0].first.size();\n        size_t maxCandidateLength = 0;\n        for (auto& candidate : candidates) {\n            prefixSize = std::min(prefixSize, Str::LongestIPrefixSize(candidate.first, candidates[0].first));\n            maxCandidateLength = std::max(maxCandidateLength, candidate.first.length());\n        }\n\n        std::string completedArg(candidates[0].first, 0, prefixSize);\n\n        \/\/Help the user bash the TAB key, but not when completing paths\n        if (candidates.size() == 1 && !Str::cisspace(GetText()[GetCursorPos()]) && !Str::IsSuffix(\"\/\", completedArg)) {\n            completedArg += \" \";\n        }\n\n        \/\/Insert the completed arg\n        std::u32string toInsert = Str::UTF8To32(completedArg);\n        DeletePrev(prefix.size());\n        GetText().insert(GetCursorPos(), toInsert);\n        SetCursor(GetCursorPos() + toInsert.size());\n\n        \/\/Print the matches if it is ambiguous\n        if (candidates.size() >= 2) {\n            Log::Notice(S_COLOR_YELLOW \"-> \" S_COLOR_WHITE \"%s\\n\", Str::UTF32To8(GetText()).c_str());\n            for (const auto& candidate : candidates) {\n                std::string filler(maxCandidateLength - candidate.first.length(), ' ');\n                Log::Notice(\"   %s%s %s\\n\", candidate.first.c_str(), filler.c_str(), candidate.second.c_str());\n            }\n        }\n    }\n\n}\n<commit_msg>Fix double newline in ConsoleField<commit_after>\/*\n===========================================================================\nDaemon BSD Source Code\nCopyright (c) 2013-2014, Daemon Developers\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n    * Redistributions of source code must retain the above copyright\n      notice, this list of conditions and the following disclaimer.\n    * Redistributions in binary form must reproduce the above copyright\n      notice, this list of conditions and the following disclaimer in the\n      documentation and\/or other materials provided with the distribution.\n    * Neither the name of the Daemon developers nor the\n      names of its contributors may be used to endorse or promote products\n      derived from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\nANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\nWARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL DAEMON DEVELOPERS BE LIABLE FOR ANY\nDIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\nLOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\nON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n===========================================================================\n*\/\n\n#include \"qcommon\/q_shared.h\"\n#include \"ConsoleField.h\"\n#include \"CommandSystem.h\"\n\nnamespace Console {\n\n    Field::Field(int size): LineEditData(size), hist(HISTORY_END) {\n    }\n\n    void Field::HistoryPrev() {\n        std::string current = Str::UTF32To8(GetText());\n        PrevLine(hist, current);\n        SetText(Str::UTF8To32(current));\n    }\n\n    void Field::HistoryNext() {\n        std::string current = Str::UTF32To8(GetText());\n        NextLine(hist, current);\n        SetText(Str::UTF8To32(current));\n    }\n\n    void Field::RunCommand(Str::StringRef defaultCommand) {\n        if (GetText().empty()) {\n            return;\n        }\n\n        std::string current = Str::UTF32To8(GetText());\n        if (current[0] == '\/' or current[0] == '\\\\') {\n            Cmd::BufferCommandText(current.c_str() + 1, true);\n        } else if (defaultCommand.empty()) {\n            Cmd::BufferCommandText(current, true);\n        } else {\n            Cmd::BufferCommandText(defaultCommand + \" \" + Cmd::Escape(current), true);\n        }\n        AddToHistory(hist, std::move(current));\n\n        Clear();\n    }\n\n    void Field::AutoComplete() {\n        \/\/We want to complete in the middle of a command text with potentially multiple commands\n\n        \/\/Add slash prefix and get command text up to cursor\n        if (GetText().empty() || (GetText()[0] != '\/' && GetText()[0] != '\\\\')) {\n            GetText().insert(GetText().begin(), '\/');\n            SetCursor(GetCursorPos() + 1);\n        }\n        std::string commandText = Str::UTF32To8(GetText().substr(1, GetCursorPos() - 1));\n\n        \/\/Split the command text and find the command to complete\n        const char* commandStart = commandText.data();\n        const char* commandEnd = commandText.data() + commandText.size();\n        while (true) {\n            const char* next = Cmd::SplitCommand(commandStart, commandEnd);\n            if (next != commandEnd)\n                commandStart = next;\n            else\n                break;\n        }\n\n        \/\/Parse the arguments and get the list of candidates\n        Cmd::Args args(std::string(commandStart, commandEnd));\n        int argNum = args.Argc() - 1;\n        std::string prefix;\n        if (!args.Argc() || Str::cisspace(GetText()[GetCursorPos() - 1])) {\n            argNum++;\n        } else {\n            prefix = args.Argv(argNum);\n        }\n\n        Cmd::CompletionResult candidates = Cmd::CompleteArgument(args, argNum);\n        if (candidates.empty()) {\n            return;\n        }\n        std::sort(candidates.begin(), candidates.end());\n        candidates.erase(std::unique(candidates.begin(), candidates.end()), candidates.end());\n\n        \/\/Compute the longest common prefix of all the results\n        int prefixSize = candidates[0].first.size();\n        size_t maxCandidateLength = 0;\n        for (auto& candidate : candidates) {\n            prefixSize = std::min(prefixSize, Str::LongestIPrefixSize(candidate.first, candidates[0].first));\n            maxCandidateLength = std::max(maxCandidateLength, candidate.first.length());\n        }\n\n        std::string completedArg(candidates[0].first, 0, prefixSize);\n\n        \/\/Help the user bash the TAB key, but not when completing paths\n        if (candidates.size() == 1 && !Str::cisspace(GetText()[GetCursorPos()]) && !Str::IsSuffix(\"\/\", completedArg)) {\n            completedArg += \" \";\n        }\n\n        \/\/Insert the completed arg\n        std::u32string toInsert = Str::UTF8To32(completedArg);\n        DeletePrev(prefix.size());\n        GetText().insert(GetCursorPos(), toInsert);\n        SetCursor(GetCursorPos() + toInsert.size());\n\n        \/\/Print the matches if it is ambiguous\n        if (candidates.size() >= 2) {\n            Log::Notice(S_COLOR_YELLOW \"-> \" S_COLOR_WHITE \"%s\", Str::UTF32To8(GetText()).c_str());\n            for (const auto& candidate : candidates) {\n                std::string filler(maxCandidateLength - candidate.first.length(), ' ');\n                Log::Notice(\"   %s%s %s\", candidate.first.c_str(), filler.c_str(), candidate.second.c_str());\n            }\n        }\n    }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"precompiled.h\"\n#include \"engine\/render\/term\/TermRender.h\"\n\n\/\/Only compile if its in use\n#ifdef TERMRENDER\n\n#include \"engine\/console\/Cvar.h\"\n\nnamespace cvar {\n\tCVAR(int,fastexit,0,CVAR_NORMAL);\n}\n\nnamespace engine {\nnamespace render {\nnamespace term {\n\n\tvoid TermRender::update(){\n\t\ttb_cell cell; \/\/temp cell used in rendering\n\n\t\t\/\/Check that the camera is not out of bounds...\n\t\tif(cameraPos.x < 0 || cameraPos.x >= WORLD_WIDTH){\n\t\t\tLOG_ERROR(\"Camera out of bounds! (x)\");\n\t\t\treturn;\n\t\t}\n\n\t\tif(cameraPos.y < 0 || cameraPos.y >= WORLD_HEIGHT){\n\t\t\tLOG_ERROR(\"Camera out of bounds! (y)\");\n\t\t\treturn;\n\t\t}\n\n\t\tif(cameraPos.z < 0 || cameraPos.z >= WORLD_DEPTH){\n\t\t\tLOG_ERROR(\"Camera out of bounds! (z)\");\n\t\t\treturn;\n\t\t}\n\n\t\t\/* RENDER MAP *\/\n\t\tworld::Room *currentRoom = sceneSystem->getWorld()->getRoom(cameraPos);\n\n\t\tvec2 pos;\n\t\tfor(int x = 0;x < ROOM_WIDTH;++x){\n\t\t\tfor(int y = 0;y < ROOM_HEIGHT;++y){\n\t\t\t\tpos.x = (x + 2);\n\t\t\t\tpos.y = (y + 2);\n\t\t\t\t\/\/Changing the color\n\t\t\t\tworld::Tile *tile = currentRoom->getVisual(x,y);\n\n\t\t\t\tcell.ch = tile->visual;\n\t\t\t\tcell.fg = convertColor(tile->fgColor);\n\t\t\t\tcell.bg = convertColor(tile->bgColor);\n\n\t\t\t\ttb_put_cell(x,y,&cell);\n\t\t\t}\n\t\t}\n\n\t\t\/* RENDER ACTORS *\/\n\n\t\tstd::vector<actor::ActorBase *> actors = sceneSystem->getActorManager()->getActorSystem()->getActorsInRoom(cameraPos);\n\n\t\tcell.fg = TB_WHITE;\n\t\tcell.bg = TB_BLACK;\n\t\tfor(unsigned int i = 0; i < actors.size();++i){\n\t\t\tcell.ch = actors.at(i)->getSymbol();\n\t\t\tcell.bg = currentRoom->getVisual(actors.at(i)->getPos()->x,actors.at(i)->getPos()->y)->bgColor;\n\t\t\ttb_put_cell(actors.at(i)->getPos()->x, actors.at(i)->getPos()->y, &cell);\n\t\t}\n\n\t\t\/* \"RENDER\" UI *\/\n\n\t\tuiSystem->windows.size();\n\n\t\t\/* RENDER THE ACTUAL STUFF *\/\n\n\t\ttb_present();\n\n\t\ttb_event event;\n\n\t\ttb_poll_event(&event);\n\n\t\tif(*cvar::fastexit == 1){\n\t\t\tif(event.type == TB_EVENT_KEY){\n\t\t\t\tif(event.key == TB_KEY_ESC){\n\t\t\t\t\tLOG_INFO(\"User wants to quit the game\");\n\n\t\t\t\t\t\/\/Dont fuck up the console while closing the game.\n\t\t\t\t\ttb_shutdown();\n\t\t\t\t\texit(0);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn;\n\t}\n\n\t\/**\n\t * Convert engine color to termbox color\n\t *\/\n\tuint16_t TermRender::convertColor(render::Color color){\n\t\tswitch(color){\n\t\t\tcase C_WHITE:\n\t\t\t\treturn TB_WHITE;\n\t\t\tcase C_BLACK:\n\t\t\t\treturn TB_BLACK;\n\t\t\tcase C_RED:\n\t\t\t\treturn TB_RED;\n\t\t\tcase C_GREEN:\n\t\t\t\treturn TB_GREEN;\n\t\t\tcase C_BLUE:\n\t\t\t\treturn TB_BLUE;\n\t\t}\n\n\t\treturn TB_WHITE;\n\t}\n\n}\n}\n}\n\n#endif\n<commit_msg>Fixed actor LOS on the termrendering, added wallhack cvar for termrender<commit_after>#include \"precompiled.h\"\n#include \"engine\/render\/term\/TermRender.h\"\n#include \"engine\/console\/Cvar.h\"\n\n\/\/Only compile if its in use\n#ifdef TERMRENDER\n\n#include \"engine\/console\/Cvar.h\"\n\nnamespace cvar {\n\tCVAR(int,fastexit,0,CVAR_NORMAL);\n\tCVAR(int,wallhack,0,CVAR_CHEAT);\n}\n\nnamespace engine {\nnamespace render {\nnamespace term {\n\n\tvoid TermRender::update(){\n\t\ttb_cell cell; \/\/temp cell used in rendering\n\n\t\t\/\/Check that the camera is not out of bounds...\n\t\tif(cameraPos.x < 0 || cameraPos.x >= WORLD_WIDTH){\n\t\t\tLOG_ERROR(\"Camera out of bounds! (x)\");\n\t\t\treturn;\n\t\t}\n\n\t\tif(cameraPos.y < 0 || cameraPos.y >= WORLD_HEIGHT){\n\t\t\tLOG_ERROR(\"Camera out of bounds! (y)\");\n\t\t\treturn;\n\t\t}\n\n\t\tif(cameraPos.z < 0 || cameraPos.z >= WORLD_DEPTH){\n\t\t\tLOG_ERROR(\"Camera out of bounds! (z)\");\n\t\t\treturn;\n\t\t}\n\n\t\t\/* RENDER MAP *\/\n\t\tworld::Room *currentRoom = sceneSystem->getWorld()->getRoom(cameraPos);\n\t\tvec2 currentPosition     = sceneSystem->getPlayerActor()->getPosition();\n\n\t\tvec2 pos;\n\t\tfor(int x = 0;x < ROOM_WIDTH;++x){\n\t\t\tfor(int y = 0;y < ROOM_HEIGHT;++y){\n\t\t\t\tpos.x = (x + 2);\n\t\t\t\tpos.y = (y + 2);\n\n\t\t\t\tworld::Tile *tile;\n\n\t\t\t\tif(*cvar::wallhack){\n\t\t\t\t\ttile = currentRoom->getTile(x,y);\n\t\t\t\t}else{\n\t\t\t\t\ttile = currentRoom->getVisual(x,y);\n\t\t\t\t}\n\n\t\t\t\tcell.ch = tile->visual;\n\t\t\t\tcell.fg = convertColor(tile->fgColor);\n\t\t\t\tcell.bg = convertColor(tile->bgColor);\n\n\t\t\t\ttb_put_cell(x,y,&cell);\n\t\t\t}\n\t\t}\n\n\t\t\/* RENDER ACTORS *\/\n\n\t\tstd::vector<actor::ActorBase *> actors = sceneSystem->getActorManager()->getActorSystem()->getActorsInRoom(cameraPos);\n\n\t\tcell.fg = TB_WHITE;\n\t\tcell.bg = TB_BLACK;\n\t\tfor(unsigned int i = 0; i < actors.size();++i){\n\t\t\tcell.ch = actors.at(i)->getSymbol();\n\t\t\tcell.bg = currentRoom->getVisual(actors.at(i)->getPos()->x,actors.at(i)->getPos()->y)->bgColor;\n\n\t\t\tif(currentRoom->lineOfSight(currentPosition,actors.at(i)->getPosition() ) ){\n\t\t\t\ttb_put_cell(actors.at(i)->getPos()->x, actors.at(i)->getPos()->y, &cell);\n\t\t\t}\n\t\t}\n\n\t\t\/* \"RENDER\" UI *\/\n\n\t\tuiSystem->windows.size();\n\n\t\t\/* RENDER THE ACTUAL STUFF *\/\n\n\t\ttb_present();\n\n\t\ttb_event event;\n\n\t\ttb_poll_event(&event);\n\n\t\tif(*cvar::fastexit == 1){\n\t\t\tif(event.type == TB_EVENT_KEY){\n\t\t\t\tif(event.key == TB_KEY_ESC){\n\t\t\t\t\tLOG_INFO(\"User wants to quit the game\");\n\n\t\t\t\t\t\/\/Dont fuck up the console while closing the game.\n\t\t\t\t\ttb_shutdown();\n\t\t\t\t\texit(0);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn;\n\t}\n\n\t\/**\n\t * Convert engine color to termbox color\n\t *\/\n\tuint16_t TermRender::convertColor(render::Color color){\n\t\tswitch(color){\n\t\t\tcase C_WHITE:\n\t\t\t\treturn TB_WHITE;\n\t\t\tcase C_BLACK:\n\t\t\t\treturn TB_BLACK;\n\t\t\tcase C_RED:\n\t\t\t\treturn TB_RED;\n\t\t\tcase C_GREEN:\n\t\t\t\treturn TB_GREEN;\n\t\t\tcase C_BLUE:\n\t\t\t\treturn TB_BLUE;\n\t\t}\n\n\t\treturn TB_WHITE;\n\t}\n\n}\n}\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2003-2005 The Apache Software Foundation.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/*\n * XSEC\n *\n * XSECAlgorithmMapper := Provides a table of AlgorithmHandlers\n *\t\t\t\t\t\t  Mapped by Type URI\n *\n * $Id$\n *\n *\/\n\n\/\/ XSEC Includes\n\n#include <xsec\/framework\/XSECDefs.hpp>\n#include <xsec\/framework\/XSECAlgorithmMapper.hpp>\n#include <xsec\/framework\/XSECError.hpp>\n#include <xsec\/utils\/XSECDOMUtils.hpp>\n\n#include \"XSECAlgorithmMapper.hpp\"\n#include \"XSECAlgorithmHandler.hpp\"\n\n\/\/ Xerces\n\n#include <xercesc\/util\/XMLString.hpp>\n#include <xercesc\/util\/XMLUniDefs.hpp>\n\nXERCES_CPP_NAMESPACE_USE\n\n\/\/ Default strings\n\nconst XMLCh XSECAlgorithmMapper::s_defaultEncryptionMapping [] = {\n\tchLatin_D,\n\tchLatin_e,\n\tchLatin_f,\n\tchLatin_a,\n\tchLatin_u,\n\tchLatin_l,\n\tchLatin_t,\n\tchLatin_E,\n\tchLatin_n,\n\tchLatin_c,\n\tchLatin_r,\n\tchLatin_y,\n\tchLatin_p,\n\tchLatin_t,\n\tchLatin_i,\n\tchLatin_o,\n\tchLatin_n,\n\tchNull\n};\n\n\n\nXSECAlgorithmMapper::XSECAlgorithmMapper(void) {\n\n}\n\n\nXSECAlgorithmMapper::~XSECAlgorithmMapper() {\n\n\tMapperEntryVectorType::iterator it = m_mapping.begin();\n\n\twhile (it != m_mapping.end()) {\n\t\t\n\t\tXSEC_RELEASE_XMLCH(((*it)->mp_uri));\n\t\tdelete (*it)->mp_handler;\n\t\tdelete (*it);\n\n\t\tit++;\n\n\t}\n\n\tm_mapping.clear();\n\n}\n\nXSECAlgorithmMapper::MapperEntry * XSECAlgorithmMapper::findEntry(const XMLCh * URI) const {\n\n\tMapperEntryVectorType::iterator it = m_mapping.begin();\n\n\twhile (it != m_mapping.end()) {\n\t\t\n\t\tif (strEquals((*it)->mp_uri, URI)) {\n\t\t\treturn (*it);\n\t\t}\n\n\t\tit++;\n\n\t}\n\n\treturn NULL;\n\n}\n\n\nXSECAlgorithmHandler * XSECAlgorithmMapper::mapURIToHandler(const XMLCh * URI) const {\n\n\n\tMapperEntry * entry = findEntry(URI);\n\n\tif (entry == NULL) {\n\t\tsafeBuffer output;\n\t\toutput.sbTranscodeIn(\"XSECAlgorithmMapper::mapURIToHandler - URI \");\n\t\toutput.sbXMLChCat(URI);\n\t\toutput.sbXMLChCat(\" not found\");\n\t\tthrow XSECException(XSECException::AlgorithmMapperError,\n\t\t\toutput.rawXMLChBuffer());\n\t}\n\n\treturn entry->mp_handler;\n}\n\nvoid XSECAlgorithmMapper::registerHandler(const XMLCh * URI, const XSECAlgorithmHandler & handler) {\n\n\tMapperEntry * entry = findEntry(URI);\n\n\tif (entry != NULL) {\n\n\t\tdelete entry->mp_handler;\n\n\t}\n\telse {\n\t\tXSECnew(entry, MapperEntry);\n\n\t\tentry->mp_uri = XMLString::replicate(URI);\n\t\tm_mapping.push_back(entry);\n\n\t}\n\tentry->mp_handler = handler.clone();\n\n}\n\n<commit_msg>Local reference to header fails during RPM build.<commit_after>\/*\n * Copyright 2003-2005 The Apache Software Foundation.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/*\n * XSEC\n *\n * XSECAlgorithmMapper := Provides a table of AlgorithmHandlers\n *\t\t\t\t\t\t  Mapped by Type URI\n *\n * $Id$\n *\n *\/\n\n\/\/ XSEC Includes\n\n#include <xsec\/framework\/XSECDefs.hpp>\n#include <xsec\/framework\/XSECAlgorithmHandler.hpp>\n#include <xsec\/framework\/XSECAlgorithmMapper.hpp>\n#include <xsec\/framework\/XSECError.hpp>\n#include <xsec\/utils\/XSECDOMUtils.hpp>\n\n\/\/ Xerces\n\n#include <xercesc\/util\/XMLString.hpp>\n#include <xercesc\/util\/XMLUniDefs.hpp>\n\nXERCES_CPP_NAMESPACE_USE\n\n\/\/ Default strings\n\nconst XMLCh XSECAlgorithmMapper::s_defaultEncryptionMapping [] = {\n\tchLatin_D,\n\tchLatin_e,\n\tchLatin_f,\n\tchLatin_a,\n\tchLatin_u,\n\tchLatin_l,\n\tchLatin_t,\n\tchLatin_E,\n\tchLatin_n,\n\tchLatin_c,\n\tchLatin_r,\n\tchLatin_y,\n\tchLatin_p,\n\tchLatin_t,\n\tchLatin_i,\n\tchLatin_o,\n\tchLatin_n,\n\tchNull\n};\n\n\n\nXSECAlgorithmMapper::XSECAlgorithmMapper(void) {\n\n}\n\n\nXSECAlgorithmMapper::~XSECAlgorithmMapper() {\n\n\tMapperEntryVectorType::iterator it = m_mapping.begin();\n\n\twhile (it != m_mapping.end()) {\n\t\t\n\t\tXSEC_RELEASE_XMLCH(((*it)->mp_uri));\n\t\tdelete (*it)->mp_handler;\n\t\tdelete (*it);\n\n\t\tit++;\n\n\t}\n\n\tm_mapping.clear();\n\n}\n\nXSECAlgorithmMapper::MapperEntry * XSECAlgorithmMapper::findEntry(const XMLCh * URI) const {\n\n\tMapperEntryVectorType::iterator it = m_mapping.begin();\n\n\twhile (it != m_mapping.end()) {\n\t\t\n\t\tif (strEquals((*it)->mp_uri, URI)) {\n\t\t\treturn (*it);\n\t\t}\n\n\t\tit++;\n\n\t}\n\n\treturn NULL;\n\n}\n\n\nXSECAlgorithmHandler * XSECAlgorithmMapper::mapURIToHandler(const XMLCh * URI) const {\n\n\n\tMapperEntry * entry = findEntry(URI);\n\n\tif (entry == NULL) {\n\t\tsafeBuffer output;\n\t\toutput.sbTranscodeIn(\"XSECAlgorithmMapper::mapURIToHandler - URI \");\n\t\toutput.sbXMLChCat(URI);\n\t\toutput.sbXMLChCat(\" not found\");\n\t\tthrow XSECException(XSECException::AlgorithmMapperError,\n\t\t\toutput.rawXMLChBuffer());\n\t}\n\n\treturn entry->mp_handler;\n}\n\nvoid XSECAlgorithmMapper::registerHandler(const XMLCh * URI, const XSECAlgorithmHandler & handler) {\n\n\tMapperEntry * entry = findEntry(URI);\n\n\tif (entry != NULL) {\n\n\t\tdelete entry->mp_handler;\n\n\t}\n\telse {\n\t\tXSECnew(entry, MapperEntry);\n\n\t\tentry->mp_uri = XMLString::replicate(URI);\n\t\tm_mapping.push_back(entry);\n\n\t}\n\tentry->mp_handler = handler.clone();\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * GraphBenchmarkGTest.cpp\n *\n *  Created on: 30.01.2013\n *      Author: cls\n *\/\n\n#include \"GraphBenchmarkGTest.h\"\n\nnamespace EnsembleClustering {\n\nGraphBenchmarkGTest::GraphBenchmarkGTest() {\n\tthis->n = 1000;\n}\n\nGraphBenchmarkGTest::~GraphBenchmarkGTest() {\n\t\/\/ TODO Auto-generated destructor stub\n}\n\n\n\/\/ TASK: benchmark edge insertions standard vs raw\n\nTEST_F(GraphBenchmarkGTest, edgeInsertions_noop_seq) {\n\tint64_t n = this->n;\n\tAux::Timer runtime;\n\n\tGraph G(n);\n\tint64_t i = 0;\n\truntime.start();\n\tG.forallNodePairs([&](node u, node v) {\n\t\ti++;\n\t\t\/\/ G.insertEdge(u, v);\n\t});\n\truntime.stop();\n\n\tTRACE(\"counted i = \" << i);\n\n\tINFO(\"[DONE] edgeInsertions_noop_seq (\" << runtime.elapsed().count() << \" ms)\");\n\n}\n\nTEST_F(GraphBenchmarkGTest, edgeInsertions_noop_par) {\n\tint64_t n = this->n;\n\tAux::Timer runtime;\n\n\tGraph G(n);\n\tint64_t i = 0;\n\truntime.start();\n\tG.forallNodePairs([&](node u, node v) {\n\t\ti++;\n\t\t\/\/ G.insertEdge(u, v);\n\t}, \"parallel\");\n\truntime.stop();\n\n\tTRACE(\"counted i = \" << i);\n\n\tINFO(\"[DONE] edgeInsertions_noop_par (\" << runtime.elapsed().count() << \" ms)\");\n\n}\n\nTEST_F(GraphBenchmarkGTest, edgeInsertions_standard_seq) {\n\tint64_t n = this->n;\n\tAux::Timer runtime;\n\n\tGraph G(n);\n\truntime.start();\n\tG.forallNodePairs([&](node u, node v) {\n\t\tG.insertEdge(u, v);\n\t});\n\truntime.stop();\n\n\tINFO(\"[DONE] edgeInsertions_standard_seq (\" << runtime.elapsed().count() << \" ms)\");\n\n}\n\nTEST_F(GraphBenchmarkGTest, edgeInsertions_standard_par) {\n\tint64_t n = this->n;\n\tAux::Timer runtime;\n\n\tGraph G(n);\n\truntime.start();\n\tG.forallNodePairs([&](node u, node v) {\n\t\tG.insertEdge(u, v);\n\t}, \"parallel\");\n\truntime.stop();\n\n\tINFO(\"[DONE] edgeInsertions_standard_par(\" << runtime.elapsed().count() << \" ms)\");\n\tint64_t m = G.numberOfEdges();\n\tEXPECT_EQ((n * (n-1)) \/ 2, m);\n\n}\n\nTEST_F(GraphBenchmarkGTest, edgeInsertions_raw_seq) {\n\tint64_t n = this->n;\n\tAux::Timer runtime;\n\n\tGraph G(n);\n\tstinger* S = G.asSTINGER();\n\n\truntime.start();\n\tfor (node u = 1; u <= n; ++u) {\n\t\tfor (node v = u + 1; v <= n; ++v) {\n\t\t\tstinger_insert_edge_pair(S, G.defaultEdgeType, u, v, G.defaultEdgeWeight, G.defaultTimeStamp);\n\t\t}\n\t}\n\truntime.stop();\n\n\n\tINFO(\"[DONE] edgeInsertions_raw_seq (\" << runtime.elapsed().count() << \" ms)\");\n\tint64_t m = G.numberOfEdges();\n\tEXPECT_EQ((n * (n-1)) \/ 2, m);\n\n}\n\nTEST_F(GraphBenchmarkGTest, edgeInsertions_raw_par) {\n\tint64_t n = this->n;\n\tAux::Timer runtime;\n\n\tGraph G(n);\n\tstinger* S = G.asSTINGER();\n\n\truntime.start();\n\t#pragma omp parallel\n\tfor (node u = 1; u <= n; ++u) {\n\t\tfor (node v = u + 1; v <= n; ++v) {\n\t\t\tstinger_insert_edge_pair(S, G.defaultEdgeType, u, v, G.defaultEdgeWeight, G.defaultTimeStamp);\n\t\t}\n\t}\n\truntime.stop();\n\n\tINFO(\"[DONE] edgeInsertions_raw_par (\" << runtime.elapsed().count() << \" ms)\");\n\tint64_t m = G.numberOfEdges();\n\tEXPECT_EQ((n * (n-1)) \/ 2, m);\n}\n\n\n\n\n\/\/ Task: precompute incident weights with different methods\n\n\n\nTEST_F(GraphBenchmarkGTest, incidentWeight_standard_seq) {\n\tint64_t n = this->n;\n\tGraphGenerator graphGen;\n\tGraph G = graphGen.makeCompleteGraph(n);\n\n\tAux::Timer runtime;\n\n\truntime.start();\n\tNodeMap<double> incidentWeight(n, 0.0);\n\n\tG.forallNodes([&](node v) {\n\t\tincidentWeight[v] = G.incidentWeight(v);\n\t});\n\truntime.stop();\n\n\tINFO(\"[DONE] (\" << runtime.elapsed().count() << \" ms)\");\n\n\t\/\/ test correctness of result\n\tbool correct = true;\n\tG.forallNodes([&](node v){\n\t\tcorrect &= (incidentWeight[v] == (n - 1));\n\t});\n\n\tEXPECT_TRUE(correct);\n}\n\n\n\/\/ TEST: use different containers\n\/\/ RESULT: NodeMap, vector and array are about equally fast\n\n\n\/\/ TEST: parallelize\n\nTEST_F(GraphBenchmarkGTest, incidentWeight_standard_par) {\n\tint64_t n = this->n;\n\tGraphGenerator graphGen;\n\tGraph G = graphGen.makeCompleteGraph(n);\n\n\tAux::Timer runtime;\n\n\truntime.start();\n\tNodeMap<double> incidentWeight(n, 0.0);\n\n\tG.forallNodes([&](node v) {\n\t\tincidentWeight[v] = G.incidentWeight(v);\n\t}, \"parallel\");\n\truntime.stop();\n\n\tINFO(\"[DONE] (\" << runtime.elapsed().count() << \" ms)\");\n\n\t\/\/ test correctness of result\n\tbool correct = true;\n\tG.forallNodes([&](node v){\n\t\tcorrect &= (incidentWeight[v] == (n - 1));\n\t});\n\n\tEXPECT_TRUE(correct);\n}\n\n\n\/\/ RESULT: significant super-linear speedup regardless of target container\n\nTEST_F(GraphBenchmarkGTest, incidentWeight_raw_seq) {\n\tint64_t n = this->n;\n\tGraphGenerator graphGen;\n\tGraph G = graphGen.makeCompleteGraph(n);\n\tstinger* S = G.asSTINGER();\n\n\tAux::Timer runtime;\n\n\truntime.start();\n\tNodeMap<double> incidentWeight(n, 0.0);\n\n\tfor (node v = 1; v <= n; ++v) {\n\t\tdouble iw = 0.0;\n\t\tSTINGER_READ_ONLY_FORALL_EDGES_OF_VTX_BEGIN(S, v) {\n\t\t\tiw += stinger_edgeweight(S, STINGER_EDGE_SOURCE, STINGER_EDGE_DEST, G.defaultEdgeType);\n\t\t} STINGER_READ_ONLY_FORALL_EDGES_OF_VTX_END();\n\t\tincidentWeight[v] = iw;\n\t}\n\truntime.stop();\n\n\tINFO(\"[DONE] (\" << runtime.elapsed().count() << \" ms)\");\n\n\t\/\/ test correctness of result\n\tbool correct = true;\n\tG.forallNodes([&](node v){\n\t\tcorrect &= (incidentWeight[v] == (n - 1));\n\t});\n\n\tEXPECT_TRUE(correct);\n\n}\n\n\nTEST_F(GraphBenchmarkGTest, incidentWeight_raw_par) {\n\tint64_t n = this->n;\n\tGraphGenerator graphGen;\n\tGraph G = graphGen.makeCompleteGraph(n);\n\tstinger* S = G.asSTINGER();\n\n\tAux::Timer runtime;\n\n\truntime.start();\n\tNodeMap<double> incidentWeight(n, 0.0);\n\n\t#pragma omp parallel for\n\tfor (node v = 1; v <= n; ++v) {\n\t\tdouble iw = 0.0;\n\t\tSTINGER_READ_ONLY_FORALL_EDGES_OF_VTX_BEGIN(S, v) {\n\t\t\tiw += stinger_edgeweight(S, STINGER_EDGE_SOURCE, STINGER_EDGE_DEST, G.defaultEdgeType);\n\t\t} STINGER_READ_ONLY_FORALL_EDGES_OF_VTX_END();\n\t\tincidentWeight[v] = iw;\n\t}\n\truntime.stop();\n\n\tINFO(\"[DONE] (\" << runtime.elapsed().count() << \" ms)\");\n\n\t\/\/ test correctness of result\n\tbool correct = true;\n\tG.forallNodes([&](node v){\n\t\tcorrect &= (incidentWeight[v] == (n - 1));\n\t});\n\n\tEXPECT_TRUE(correct);\n\n}\n\n\n} \/* namespace EnsembleClustering *\/\n<commit_msg>n info<commit_after>\/*\n * GraphBenchmarkGTest.cpp\n *\n *  Created on: 30.01.2013\n *      Author: cls\n *\/\n\n#include \"GraphBenchmarkGTest.h\"\n\nnamespace EnsembleClustering {\n\nGraphBenchmarkGTest::GraphBenchmarkGTest() {\n\tthis->n = 1000;\n\tINFO(\"n = \" << this->n);\n}\n\nGraphBenchmarkGTest::~GraphBenchmarkGTest() {\n\t\/\/ TODO Auto-generated destructor stub\n}\n\n\n\/\/ TASK: benchmark edge insertions standard vs raw\n\nTEST_F(GraphBenchmarkGTest, edgeInsertions_noop_seq) {\n\tint64_t n = this->n;\n\tAux::Timer runtime;\n\n\tGraph G(n);\n\tint64_t i = 0;\n\truntime.start();\n\tG.forallNodePairs([&](node u, node v) {\n\t\ti++;\n\t\t\/\/ G.insertEdge(u, v);\n\t});\n\truntime.stop();\n\n\tTRACE(\"counted i = \" << i);\n\n\tINFO(\"[DONE] edgeInsertions_noop_seq (\" << runtime.elapsed().count() << \" ms)\");\n\n}\n\nTEST_F(GraphBenchmarkGTest, edgeInsertions_noop_par) {\n\tint64_t n = this->n;\n\tAux::Timer runtime;\n\n\tGraph G(n);\n\tint64_t i = 0;\n\truntime.start();\n\tG.forallNodePairs([&](node u, node v) {\n\t\ti++;\n\t\t\/\/ G.insertEdge(u, v);\n\t}, \"parallel\");\n\truntime.stop();\n\n\tTRACE(\"counted i = \" << i);\n\n\tINFO(\"[DONE] edgeInsertions_noop_par (\" << runtime.elapsed().count() << \" ms)\");\n\n}\n\nTEST_F(GraphBenchmarkGTest, edgeInsertions_standard_seq) {\n\tint64_t n = this->n;\n\tAux::Timer runtime;\n\n\tGraph G(n);\n\truntime.start();\n\tG.forallNodePairs([&](node u, node v) {\n\t\tG.insertEdge(u, v);\n\t});\n\truntime.stop();\n\n\tINFO(\"[DONE] edgeInsertions_standard_seq (\" << runtime.elapsed().count() << \" ms)\");\n\n}\n\nTEST_F(GraphBenchmarkGTest, edgeInsertions_standard_par) {\n\tint64_t n = this->n;\n\tAux::Timer runtime;\n\n\tGraph G(n);\n\truntime.start();\n\tG.forallNodePairs([&](node u, node v) {\n\t\tG.insertEdge(u, v);\n\t}, \"parallel\");\n\truntime.stop();\n\n\tINFO(\"[DONE] edgeInsertions_standard_par(\" << runtime.elapsed().count() << \" ms)\");\n\tint64_t m = G.numberOfEdges();\n\tEXPECT_EQ((n * (n-1)) \/ 2, m);\n\n}\n\nTEST_F(GraphBenchmarkGTest, edgeInsertions_raw_seq) {\n\tint64_t n = this->n;\n\tAux::Timer runtime;\n\n\tGraph G(n);\n\tstinger* S = G.asSTINGER();\n\n\truntime.start();\n\tfor (node u = 1; u <= n; ++u) {\n\t\tfor (node v = u + 1; v <= n; ++v) {\n\t\t\tstinger_insert_edge_pair(S, G.defaultEdgeType, u, v, G.defaultEdgeWeight, G.defaultTimeStamp);\n\t\t}\n\t}\n\truntime.stop();\n\n\n\tINFO(\"[DONE] edgeInsertions_raw_seq (\" << runtime.elapsed().count() << \" ms)\");\n\tint64_t m = G.numberOfEdges();\n\tEXPECT_EQ((n * (n-1)) \/ 2, m);\n\n}\n\nTEST_F(GraphBenchmarkGTest, edgeInsertions_raw_par) {\n\tint64_t n = this->n;\n\tAux::Timer runtime;\n\n\tGraph G(n);\n\tstinger* S = G.asSTINGER();\n\n\truntime.start();\n\t#pragma omp parallel\n\tfor (node u = 1; u <= n; ++u) {\n\t\tfor (node v = u + 1; v <= n; ++v) {\n\t\t\tstinger_insert_edge_pair(S, G.defaultEdgeType, u, v, G.defaultEdgeWeight, G.defaultTimeStamp);\n\t\t}\n\t}\n\truntime.stop();\n\n\tINFO(\"[DONE] edgeInsertions_raw_par (\" << runtime.elapsed().count() << \" ms)\");\n\tint64_t m = G.numberOfEdges();\n\tEXPECT_EQ((n * (n-1)) \/ 2, m);\n}\n\n\n\n\n\/\/ Task: precompute incident weights with different methods\n\n\n\nTEST_F(GraphBenchmarkGTest, incidentWeight_standard_seq) {\n\tint64_t n = this->n;\n\tGraphGenerator graphGen;\n\tGraph G = graphGen.makeCompleteGraph(n);\n\n\tAux::Timer runtime;\n\n\truntime.start();\n\tNodeMap<double> incidentWeight(n, 0.0);\n\n\tG.forallNodes([&](node v) {\n\t\tincidentWeight[v] = G.incidentWeight(v);\n\t});\n\truntime.stop();\n\n\tINFO(\"[DONE] (\" << runtime.elapsed().count() << \" ms)\");\n\n\t\/\/ test correctness of result\n\tbool correct = true;\n\tG.forallNodes([&](node v){\n\t\tcorrect &= (incidentWeight[v] == (n - 1));\n\t});\n\n\tEXPECT_TRUE(correct);\n}\n\n\n\/\/ TEST: use different containers\n\/\/ RESULT: NodeMap, vector and array are about equally fast\n\n\n\/\/ TEST: parallelize\n\nTEST_F(GraphBenchmarkGTest, incidentWeight_standard_par) {\n\tint64_t n = this->n;\n\tGraphGenerator graphGen;\n\tGraph G = graphGen.makeCompleteGraph(n);\n\n\tAux::Timer runtime;\n\n\truntime.start();\n\tNodeMap<double> incidentWeight(n, 0.0);\n\n\tG.forallNodes([&](node v) {\n\t\tincidentWeight[v] = G.incidentWeight(v);\n\t}, \"parallel\");\n\truntime.stop();\n\n\tINFO(\"[DONE] (\" << runtime.elapsed().count() << \" ms)\");\n\n\t\/\/ test correctness of result\n\tbool correct = true;\n\tG.forallNodes([&](node v){\n\t\tcorrect &= (incidentWeight[v] == (n - 1));\n\t});\n\n\tEXPECT_TRUE(correct);\n}\n\n\n\/\/ RESULT: significant super-linear speedup regardless of target container\n\nTEST_F(GraphBenchmarkGTest, incidentWeight_raw_seq) {\n\tint64_t n = this->n;\n\tGraphGenerator graphGen;\n\tGraph G = graphGen.makeCompleteGraph(n);\n\tstinger* S = G.asSTINGER();\n\n\tAux::Timer runtime;\n\n\truntime.start();\n\tNodeMap<double> incidentWeight(n, 0.0);\n\n\tfor (node v = 1; v <= n; ++v) {\n\t\tdouble iw = 0.0;\n\t\tSTINGER_READ_ONLY_FORALL_EDGES_OF_VTX_BEGIN(S, v) {\n\t\t\tiw += stinger_edgeweight(S, STINGER_EDGE_SOURCE, STINGER_EDGE_DEST, G.defaultEdgeType);\n\t\t} STINGER_READ_ONLY_FORALL_EDGES_OF_VTX_END();\n\t\tincidentWeight[v] = iw;\n\t}\n\truntime.stop();\n\n\tINFO(\"[DONE] (\" << runtime.elapsed().count() << \" ms)\");\n\n\t\/\/ test correctness of result\n\tbool correct = true;\n\tG.forallNodes([&](node v){\n\t\tcorrect &= (incidentWeight[v] == (n - 1));\n\t});\n\n\tEXPECT_TRUE(correct);\n\n}\n\n\nTEST_F(GraphBenchmarkGTest, incidentWeight_raw_par) {\n\tint64_t n = this->n;\n\tGraphGenerator graphGen;\n\tGraph G = graphGen.makeCompleteGraph(n);\n\tstinger* S = G.asSTINGER();\n\n\tAux::Timer runtime;\n\n\truntime.start();\n\tNodeMap<double> incidentWeight(n, 0.0);\n\n\t#pragma omp parallel for\n\tfor (node v = 1; v <= n; ++v) {\n\t\tdouble iw = 0.0;\n\t\tSTINGER_READ_ONLY_FORALL_EDGES_OF_VTX_BEGIN(S, v) {\n\t\t\tiw += stinger_edgeweight(S, STINGER_EDGE_SOURCE, STINGER_EDGE_DEST, G.defaultEdgeType);\n\t\t} STINGER_READ_ONLY_FORALL_EDGES_OF_VTX_END();\n\t\tincidentWeight[v] = iw;\n\t}\n\truntime.stop();\n\n\tINFO(\"[DONE] (\" << runtime.elapsed().count() << \" ms)\");\n\n\t\/\/ test correctness of result\n\tbool correct = true;\n\tG.forallNodes([&](node v){\n\t\tcorrect &= (incidentWeight[v] == (n - 1));\n\t});\n\n\tEXPECT_TRUE(correct);\n\n}\n\n\n} \/* namespace EnsembleClustering *\/\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\/util\/json_util.h>\n\n#include <google\/protobuf\/stubs\/common.h>\n#include <google\/protobuf\/io\/coded_stream.h>\n#include <google\/protobuf\/io\/zero_copy_stream.h>\n#include <google\/protobuf\/stubs\/once.h>\n#include <google\/protobuf\/util\/internal\/default_value_objectwriter.h>\n#include <google\/protobuf\/util\/internal\/error_listener.h>\n#include <google\/protobuf\/util\/internal\/json_objectwriter.h>\n#include <google\/protobuf\/util\/internal\/json_stream_parser.h>\n#include <google\/protobuf\/util\/internal\/protostream_objectsource.h>\n#include <google\/protobuf\/util\/internal\/protostream_objectwriter.h>\n#include <google\/protobuf\/util\/type_resolver.h>\n#include <google\/protobuf\/util\/type_resolver_util.h>\n#include <google\/protobuf\/stubs\/bytestream.h>\n\n#include <google\/protobuf\/stubs\/strutil.h>\n#include <google\/protobuf\/stubs\/status_macros.h>\n\n#include <google\/protobuf\/port_def.inc>\n\nnamespace google {\nnamespace protobuf {\nnamespace util {\n\nnamespace internal {\nZeroCopyStreamByteSink::~ZeroCopyStreamByteSink() {\n  if (buffer_size_ > 0) {\n    stream_->BackUp(buffer_size_);\n  }\n}\n\nvoid ZeroCopyStreamByteSink::Append(const char* bytes, size_t len) {\n  while (true) {\n    if (len <= buffer_size_) {\n      memcpy(buffer_, bytes, len);\n      buffer_ = static_cast<char*>(buffer_) + len;\n      buffer_size_ -= len;\n      return;\n    }\n    if (buffer_size_ > 0) {\n      memcpy(buffer_, bytes, buffer_size_);\n      bytes += buffer_size_;\n      len -= buffer_size_;\n    }\n    if (!stream_->Next(&buffer_, &buffer_size_)) {\n      \/\/ There isn't a way for ByteSink to report errors.\n      buffer_size_ = 0;\n      return;\n    }\n  }\n}\n}  \/\/ namespace internal\n\nutil::Status BinaryToJsonStream(TypeResolver* resolver,\n                                  const std::string& type_url,\n                                  io::ZeroCopyInputStream* binary_input,\n                                  io::ZeroCopyOutputStream* json_output,\n                                  const JsonPrintOptions& options) {\n  io::CodedInputStream in_stream(binary_input);\n  google::protobuf::Type type;\n  RETURN_IF_ERROR(resolver->ResolveMessageType(type_url, &type));\n  converter::ProtoStreamObjectSource proto_source(&in_stream, resolver, type);\n  proto_source.set_use_ints_for_enums(options.always_print_enums_as_ints);\n  proto_source.set_preserve_proto_field_names(\n      options.preserve_proto_field_names);\n  io::CodedOutputStream out_stream(json_output);\n  converter::JsonObjectWriter json_writer(options.add_whitespace ? \" \" : \"\",\n                                          &out_stream);\n  if (options.always_print_primitive_fields) {\n    converter::DefaultValueObjectWriter default_value_writer(resolver, type,\n                                                             &json_writer);\n    default_value_writer.set_preserve_proto_field_names(\n        options.preserve_proto_field_names);\n    default_value_writer.set_print_enums_as_ints(\n        options.always_print_enums_as_ints);\n    return proto_source.WriteTo(&default_value_writer);\n  } else {\n    return proto_source.WriteTo(&json_writer);\n  }\n}\n\nutil::Status BinaryToJsonString(TypeResolver* resolver,\n                                  const std::string& type_url,\n                                  const std::string& binary_input,\n                                  std::string* json_output,\n                                  const JsonPrintOptions& options) {\n  io::ArrayInputStream input_stream(binary_input.data(), binary_input.size());\n  io::StringOutputStream output_stream(json_output);\n  return BinaryToJsonStream(resolver, type_url, &input_stream, &output_stream,\n                            options);\n}\n\nnamespace {\nclass StatusErrorListener : public converter::ErrorListener {\n public:\n  StatusErrorListener() {}\n  ~StatusErrorListener() override {}\n\n  util::Status GetStatus() { return status_; }\n\n  void InvalidName(const converter::LocationTrackerInterface& loc,\n                   StringPiece unknown_name,\n                   StringPiece message) override {\n    std::string loc_string = GetLocString(loc);\n    if (!loc_string.empty()) {\n      loc_string.append(\" \");\n    }\n    status_ =\n        util::Status(util::error::INVALID_ARGUMENT,\n                       StrCat(loc_string, unknown_name, \": \", message));\n  }\n\n  void InvalidValue(const converter::LocationTrackerInterface& loc,\n                    StringPiece type_name,\n                    StringPiece value) override {\n    status_ = util::Status(\n        util::error::INVALID_ARGUMENT,\n        StrCat(GetLocString(loc), \": invalid value \", string(value),\n                     \" for type \", string(type_name)));\n  }\n\n  void MissingField(const converter::LocationTrackerInterface& loc,\n                    StringPiece missing_name) override {\n    status_ = util::Status(util::error::INVALID_ARGUMENT,\n                             StrCat(GetLocString(loc), \": missing field \",\n                                          std::string(missing_name)));\n  }\n\n private:\n  util::Status status_;\n\n  std::string GetLocString(const converter::LocationTrackerInterface& loc) {\n    std::string loc_string = loc.ToString();\n    StripWhitespace(&loc_string);\n    if (!loc_string.empty()) {\n      loc_string = StrCat(\"(\", loc_string, \")\");\n    }\n    return loc_string;\n  }\n\n  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(StatusErrorListener);\n};\n}  \/\/ namespace\n\nutil::Status JsonToBinaryStream(TypeResolver* resolver,\n                                  const std::string& type_url,\n                                  io::ZeroCopyInputStream* json_input,\n                                  io::ZeroCopyOutputStream* binary_output,\n                                  const JsonParseOptions& options) {\n  google::protobuf::Type type;\n  RETURN_IF_ERROR(resolver->ResolveMessageType(type_url, &type));\n  internal::ZeroCopyStreamByteSink sink(binary_output);\n  StatusErrorListener listener;\n  converter::ProtoStreamObjectWriter::Options proto_writer_options;\n  proto_writer_options.ignore_unknown_fields = options.ignore_unknown_fields;\n  proto_writer_options.ignore_unknown_enum_values =\n      options.ignore_unknown_fields;\n  proto_writer_options.case_insensitive_enum_parsing =\n      options.case_insensitive_enum_parsing;\n  converter::ProtoStreamObjectWriter proto_writer(\n      resolver, type, &sink, &listener, proto_writer_options);\n\n  converter::JsonStreamParser parser(&proto_writer);\n  const void* buffer;\n  int length;\n  while (json_input->Next(&buffer, &length)) {\n    if (length == 0) continue;\n    RETURN_IF_ERROR(parser.Parse(\n        StringPiece(static_cast<const char*>(buffer), length)));\n  }\n  RETURN_IF_ERROR(parser.FinishParse());\n\n  return listener.GetStatus();\n}\n\nutil::Status JsonToBinaryString(TypeResolver* resolver,\n                                  const std::string& type_url,\n                                  StringPiece json_input,\n                                  std::string* binary_output,\n                                  const JsonParseOptions& options) {\n  io::ArrayInputStream input_stream(json_input.data(), json_input.size());\n  io::StringOutputStream output_stream(binary_output);\n  return JsonToBinaryStream(resolver, type_url, &input_stream, &output_stream,\n                            options);\n}\n\nnamespace {\nconst char* kTypeUrlPrefix = \"type.googleapis.com\";\nTypeResolver* generated_type_resolver_ = NULL;\nPROTOBUF_NAMESPACE_ID::internal::once_flag generated_type_resolver_init_;\n\nstd::string GetTypeUrl(const Message& message) {\n  return std::string(kTypeUrlPrefix) + \"\/\" +\n         message.GetDescriptor()->full_name();\n}\n\nvoid DeleteGeneratedTypeResolver() { delete generated_type_resolver_; }\n\nvoid InitGeneratedTypeResolver() {\n  generated_type_resolver_ = NewTypeResolverForDescriptorPool(\n      kTypeUrlPrefix, DescriptorPool::generated_pool());\n  ::google::protobuf::internal::OnShutdown(&DeleteGeneratedTypeResolver);\n}\n\nTypeResolver* GetGeneratedTypeResolver() {\n  PROTOBUF_NAMESPACE_ID::internal::call_once(generated_type_resolver_init_,\n                                             InitGeneratedTypeResolver);\n  return generated_type_resolver_;\n}\n}  \/\/ namespace\n\nutil::Status MessageToJsonString(const Message& message, std::string* output,\n                                   const JsonOptions& options) {\n  const DescriptorPool* pool = message.GetDescriptor()->file()->pool();\n  TypeResolver* resolver =\n      pool == DescriptorPool::generated_pool()\n          ? GetGeneratedTypeResolver()\n          : NewTypeResolverForDescriptorPool(kTypeUrlPrefix, pool);\n  util::Status result =\n      BinaryToJsonString(resolver, GetTypeUrl(message),\n                         message.SerializeAsString(), output, options);\n  if (pool != DescriptorPool::generated_pool()) {\n    delete resolver;\n  }\n  return result;\n}\n\nutil::Status JsonStringToMessage(StringPiece input, Message* message,\n                                   const JsonParseOptions& options) {\n  const DescriptorPool* pool = message->GetDescriptor()->file()->pool();\n  TypeResolver* resolver =\n      pool == DescriptorPool::generated_pool()\n          ? GetGeneratedTypeResolver()\n          : NewTypeResolverForDescriptorPool(kTypeUrlPrefix, pool);\n  std::string binary;\n  util::Status result = JsonToBinaryString(resolver, GetTypeUrl(*message),\n                                             input, &binary, options);\n  if (result.ok() && !message->ParseFromString(binary)) {\n    result =\n        util::Status(util::error::INVALID_ARGUMENT,\n                       \"JSON transcoder produced invalid protobuf output.\");\n  }\n  if (pool != DescriptorPool::generated_pool()) {\n    delete resolver;\n  }\n  return result;\n}\n\n}  \/\/ namespace util\n}  \/\/ namespace protobuf\n}  \/\/ namespace google\n<commit_msg>JSON string output funtions should clear() the destination first<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\/util\/json_util.h>\n\n#include <google\/protobuf\/stubs\/common.h>\n#include <google\/protobuf\/io\/coded_stream.h>\n#include <google\/protobuf\/io\/zero_copy_stream.h>\n#include <google\/protobuf\/stubs\/once.h>\n#include <google\/protobuf\/util\/internal\/default_value_objectwriter.h>\n#include <google\/protobuf\/util\/internal\/error_listener.h>\n#include <google\/protobuf\/util\/internal\/json_objectwriter.h>\n#include <google\/protobuf\/util\/internal\/json_stream_parser.h>\n#include <google\/protobuf\/util\/internal\/protostream_objectsource.h>\n#include <google\/protobuf\/util\/internal\/protostream_objectwriter.h>\n#include <google\/protobuf\/util\/type_resolver.h>\n#include <google\/protobuf\/util\/type_resolver_util.h>\n#include <google\/protobuf\/stubs\/bytestream.h>\n\n#include <google\/protobuf\/stubs\/strutil.h>\n#include <google\/protobuf\/stubs\/status_macros.h>\n\n#include <google\/protobuf\/port_def.inc>\n\nnamespace google {\nnamespace protobuf {\nnamespace util {\n\nnamespace internal {\nZeroCopyStreamByteSink::~ZeroCopyStreamByteSink() {\n  if (buffer_size_ > 0) {\n    stream_->BackUp(buffer_size_);\n  }\n}\n\nvoid ZeroCopyStreamByteSink::Append(const char* bytes, size_t len) {\n  while (true) {\n    if (len <= buffer_size_) {\n      memcpy(buffer_, bytes, len);\n      buffer_ = static_cast<char*>(buffer_) + len;\n      buffer_size_ -= len;\n      return;\n    }\n    if (buffer_size_ > 0) {\n      memcpy(buffer_, bytes, buffer_size_);\n      bytes += buffer_size_;\n      len -= buffer_size_;\n    }\n    if (!stream_->Next(&buffer_, &buffer_size_)) {\n      \/\/ There isn't a way for ByteSink to report errors.\n      buffer_size_ = 0;\n      return;\n    }\n  }\n}\n}  \/\/ namespace internal\n\nutil::Status BinaryToJsonStream(TypeResolver* resolver,\n                                  const std::string& type_url,\n                                  io::ZeroCopyInputStream* binary_input,\n                                  io::ZeroCopyOutputStream* json_output,\n                                  const JsonPrintOptions& options) {\n  io::CodedInputStream in_stream(binary_input);\n  google::protobuf::Type type;\n  RETURN_IF_ERROR(resolver->ResolveMessageType(type_url, &type));\n  converter::ProtoStreamObjectSource proto_source(&in_stream, resolver, type);\n  proto_source.set_use_ints_for_enums(options.always_print_enums_as_ints);\n  proto_source.set_preserve_proto_field_names(\n      options.preserve_proto_field_names);\n  io::CodedOutputStream out_stream(json_output);\n  converter::JsonObjectWriter json_writer(options.add_whitespace ? \" \" : \"\",\n                                          &out_stream);\n  if (options.always_print_primitive_fields) {\n    converter::DefaultValueObjectWriter default_value_writer(resolver, type,\n                                                             &json_writer);\n    default_value_writer.set_preserve_proto_field_names(\n        options.preserve_proto_field_names);\n    default_value_writer.set_print_enums_as_ints(\n        options.always_print_enums_as_ints);\n    return proto_source.WriteTo(&default_value_writer);\n  } else {\n    return proto_source.WriteTo(&json_writer);\n  }\n}\n\nutil::Status BinaryToJsonString(TypeResolver* resolver,\n                                  const std::string& type_url,\n                                  const std::string& binary_input,\n                                  std::string* json_output,\n                                  const JsonPrintOptions& options) {\n  json_output->clear();\n  io::ArrayInputStream input_stream(binary_input.data(), binary_input.size());\n  io::StringOutputStream output_stream(json_output);\n  return BinaryToJsonStream(resolver, type_url, &input_stream, &output_stream,\n                            options);\n}\n\nnamespace {\nclass StatusErrorListener : public converter::ErrorListener {\n public:\n  StatusErrorListener() {}\n  ~StatusErrorListener() override {}\n\n  util::Status GetStatus() { return status_; }\n\n  void InvalidName(const converter::LocationTrackerInterface& loc,\n                   StringPiece unknown_name,\n                   StringPiece message) override {\n    std::string loc_string = GetLocString(loc);\n    if (!loc_string.empty()) {\n      loc_string.append(\" \");\n    }\n    status_ =\n        util::Status(util::error::INVALID_ARGUMENT,\n                       StrCat(loc_string, unknown_name, \": \", message));\n  }\n\n  void InvalidValue(const converter::LocationTrackerInterface& loc,\n                    StringPiece type_name,\n                    StringPiece value) override {\n    status_ = util::Status(\n        util::error::INVALID_ARGUMENT,\n        StrCat(GetLocString(loc), \": invalid value \", string(value),\n                     \" for type \", string(type_name)));\n  }\n\n  void MissingField(const converter::LocationTrackerInterface& loc,\n                    StringPiece missing_name) override {\n    status_ = util::Status(util::error::INVALID_ARGUMENT,\n                             StrCat(GetLocString(loc), \": missing field \",\n                                          std::string(missing_name)));\n  }\n\n private:\n  util::Status status_;\n\n  std::string GetLocString(const converter::LocationTrackerInterface& loc) {\n    std::string loc_string = loc.ToString();\n    StripWhitespace(&loc_string);\n    if (!loc_string.empty()) {\n      loc_string = StrCat(\"(\", loc_string, \")\");\n    }\n    return loc_string;\n  }\n\n  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(StatusErrorListener);\n};\n}  \/\/ namespace\n\nutil::Status JsonToBinaryStream(TypeResolver* resolver,\n                                  const std::string& type_url,\n                                  io::ZeroCopyInputStream* json_input,\n                                  io::ZeroCopyOutputStream* binary_output,\n                                  const JsonParseOptions& options) {\n  google::protobuf::Type type;\n  RETURN_IF_ERROR(resolver->ResolveMessageType(type_url, &type));\n  internal::ZeroCopyStreamByteSink sink(binary_output);\n  StatusErrorListener listener;\n  converter::ProtoStreamObjectWriter::Options proto_writer_options;\n  proto_writer_options.ignore_unknown_fields = options.ignore_unknown_fields;\n  proto_writer_options.ignore_unknown_enum_values =\n      options.ignore_unknown_fields;\n  proto_writer_options.case_insensitive_enum_parsing =\n      options.case_insensitive_enum_parsing;\n  converter::ProtoStreamObjectWriter proto_writer(\n      resolver, type, &sink, &listener, proto_writer_options);\n\n  converter::JsonStreamParser parser(&proto_writer);\n  const void* buffer;\n  int length;\n  while (json_input->Next(&buffer, &length)) {\n    if (length == 0) continue;\n    RETURN_IF_ERROR(parser.Parse(\n        StringPiece(static_cast<const char*>(buffer), length)));\n  }\n  RETURN_IF_ERROR(parser.FinishParse());\n\n  return listener.GetStatus();\n}\n\nutil::Status JsonToBinaryString(TypeResolver* resolver,\n                                  const std::string& type_url,\n                                  StringPiece json_input,\n                                  std::string* binary_output,\n                                  const JsonParseOptions& options) {\n  binary_output->clear();\n  io::ArrayInputStream input_stream(json_input.data(), json_input.size());\n  io::StringOutputStream output_stream(binary_output);\n  return JsonToBinaryStream(resolver, type_url, &input_stream, &output_stream,\n                            options);\n}\n\nnamespace {\nconst char* kTypeUrlPrefix = \"type.googleapis.com\";\nTypeResolver* generated_type_resolver_ = NULL;\nPROTOBUF_NAMESPACE_ID::internal::once_flag generated_type_resolver_init_;\n\nstd::string GetTypeUrl(const Message& message) {\n  return std::string(kTypeUrlPrefix) + \"\/\" +\n         message.GetDescriptor()->full_name();\n}\n\nvoid DeleteGeneratedTypeResolver() { delete generated_type_resolver_; }\n\nvoid InitGeneratedTypeResolver() {\n  generated_type_resolver_ = NewTypeResolverForDescriptorPool(\n      kTypeUrlPrefix, DescriptorPool::generated_pool());\n  ::google::protobuf::internal::OnShutdown(&DeleteGeneratedTypeResolver);\n}\n\nTypeResolver* GetGeneratedTypeResolver() {\n  PROTOBUF_NAMESPACE_ID::internal::call_once(generated_type_resolver_init_,\n                                             InitGeneratedTypeResolver);\n  return generated_type_resolver_;\n}\n}  \/\/ namespace\n\nutil::Status MessageToJsonString(const Message& message, std::string* output,\n                                   const JsonOptions& options) {\n  const DescriptorPool* pool = message.GetDescriptor()->file()->pool();\n  TypeResolver* resolver =\n      pool == DescriptorPool::generated_pool()\n          ? GetGeneratedTypeResolver()\n          : NewTypeResolverForDescriptorPool(kTypeUrlPrefix, pool);\n  util::Status result =\n      BinaryToJsonString(resolver, GetTypeUrl(message),\n                         message.SerializeAsString(), output, options);\n  if (pool != DescriptorPool::generated_pool()) {\n    delete resolver;\n  }\n  return result;\n}\n\nutil::Status JsonStringToMessage(StringPiece input, Message* message,\n                                   const JsonParseOptions& options) {\n  const DescriptorPool* pool = message->GetDescriptor()->file()->pool();\n  TypeResolver* resolver =\n      pool == DescriptorPool::generated_pool()\n          ? GetGeneratedTypeResolver()\n          : NewTypeResolverForDescriptorPool(kTypeUrlPrefix, pool);\n  std::string binary;\n  util::Status result = JsonToBinaryString(resolver, GetTypeUrl(*message),\n                                             input, &binary, options);\n  if (result.ok() && !message->ParseFromString(binary)) {\n    result =\n        util::Status(util::error::INVALID_ARGUMENT,\n                       \"JSON transcoder produced invalid protobuf output.\");\n  }\n  if (pool != DescriptorPool::generated_pool()) {\n    delete resolver;\n  }\n  return result;\n}\n\n}  \/\/ namespace util\n}  \/\/ namespace protobuf\n}  \/\/ namespace google\n<|endoftext|>"}
{"text":"<commit_before>\/*-------------------------------------------------------------------------\n* Vulkan Conformance Tests\n* ------------------------\n*\n* Copyright (c) 2018 Advanced Micro Devices, Inc.\n* Copyright (c) 2018 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* \\file\n* \\brief VK_KHR_driver_properties tests\n*\/\/*--------------------------------------------------------------------*\/\n\n#include \"vktApiDriverPropertiesTests.hpp\"\n#include \"vktTestGroupUtil.hpp\"\n#include \"vktTestCaseUtil.hpp\"\n#include \"vkQueryUtil.hpp\"\n#include \"vkTypeUtil.hpp\"\n\nusing namespace vk;\n\nnamespace vkt\n{\nnamespace api\n{\nnamespace\n{\n\nenum TestType\n{\n\tTEST_TYPE_DRIVER_ID_MATCH\t\t\t= 0,\n\tTEST_TYPE_NAME_IS_NOT_EMPTY,\n\tTEST_TYPE_NAME_ZERO_TERMINATED,\n\tTEST_TYPE_INFO_ZERO_TERMINATED,\n\tTEST_TYPE_VERSION,\n};\n\nstatic const deUint32 knownDriverIds[] =\n{\n\t\/\/ Specified in the Vulkan registry (vk.xml)\n\t1,\t\/\/ author = \"Advanced Micro Devices, Inc.\"   comment = \"AMD proprietary driver\"\n\t2,\t\/\/ author = \"Advanced Micro Devices, Inc.\"   comment = \"AMD open-source driver\"\n\t3,\t\/\/ author = \"Mesa open source project\"       comment = \"Mesa RADV driver\"\n\t4,\t\/\/ author = \"NVIDIA Corporation\"             comment = \"NVIDIA proprietary driver\"\n\t5,\t\/\/ author = \"Intel Corporation\"              comment = \"Intel proprietary Windows driver\"\n\t6,\t\/\/ author = \"Intel Corporation\"              comment = \"Intel open-source Mesa driver\"\n\t7,\t\/\/ author = \"Imagination Technologies\"       comment = \"Imagination proprietary driver\"\n\t8,\t\/\/ author = \"Qualcomm Technologies, Inc.\"    comment = \"Qualcomm proprietary driver\"\n\t9,\t\/\/ author = \"Arm Limited\"                    comment = \"Arm proprietary driver\"\n\t10,\t\/\/ <enum value=\"10\"      name=\"VK_DRIVER_ID_GOOGLE_SWIFTSHADER_KHR\"        comment=\"Google LLC\"\/>\n\t11,\t\/\/ <enum value=\"11\"      name=\"VK_DRIVER_ID_GGP_PROPRIETARY_KHR\"           comment=\"Google LLC\"\/>\n\t12,\t\/\/ <enum value=\"12\"      name=\"VK_DRIVER_ID_BROADCOM_PROPRIETARY_KHR\"      comment=\"Broadcom Inc.\"\/>\n};\n\nstatic const VkConformanceVersionKHR knownConformanceVersions[] =\n{\n\tmakeConformanceVersionKHR(1, 1, 6, 2),\n\tmakeConformanceVersionKHR(1, 1, 6, 1),\n\tmakeConformanceVersionKHR(1, 1, 6, 0),\n\tmakeConformanceVersionKHR(1, 1, 5, 2),\n\tmakeConformanceVersionKHR(1, 1, 5, 1),\n\tmakeConformanceVersionKHR(1, 1, 5, 0),\n\tmakeConformanceVersionKHR(1, 1, 4, 3),\n\tmakeConformanceVersionKHR(1, 1, 4, 2),\n\tmakeConformanceVersionKHR(1, 1, 4, 1),\n\tmakeConformanceVersionKHR(1, 1, 4, 0),\n\tmakeConformanceVersionKHR(1, 1, 3, 3),\n\tmakeConformanceVersionKHR(1, 1, 3, 2),\n\tmakeConformanceVersionKHR(1, 1, 3, 1),\n\tmakeConformanceVersionKHR(1, 1, 3, 0),\n\tmakeConformanceVersionKHR(1, 1, 2, 3),\n\tmakeConformanceVersionKHR(1, 1, 2, 2),\n\tmakeConformanceVersionKHR(1, 1, 2, 1),\n\tmakeConformanceVersionKHR(1, 1, 2, 0),\n};\n\nDE_INLINE bool isNullTerminated(const char* str, const deUint32 maxSize)\n{\n\treturn deStrnlen(str, maxSize) < maxSize;\n}\n\nDE_INLINE bool operator==(const VkConformanceVersionKHR& a, const VkConformanceVersionKHR& b)\n{\n\treturn ((a.major == b.major)\t\t&&\n\t\t\t(a.minor == b.minor)\t\t&&\n\t\t\t(a.subminor == b.subminor)\t&&\n\t\t\t(a.patch == b.patch));\n}\n\nvoid checkSupport (Context& context, const TestType config)\n{\n\tDE_UNREF(config);\n\tcontext.requireDeviceFunctionality(\"VK_KHR_driver_properties\");\n}\n\nvoid testDriverMatch (const VkPhysicalDeviceDriverPropertiesKHR& deviceDriverProperties)\n{\n\tfor (const deUint32* pDriverId = knownDriverIds; pDriverId != DE_ARRAY_END(knownDriverIds); ++pDriverId)\n\t{\n\t\tif (deviceDriverProperties.driverID == *pDriverId)\n\t\t\treturn;\n\t}\n\n\tTCU_FAIL(\"Driver ID did not match any known driver\");\n}\n\nvoid testNameIsNotEmpty (const VkPhysicalDeviceDriverPropertiesKHR& deviceDriverProperties)\n{\n\tif (deviceDriverProperties.driverName[0] == 0)\n\t\tTCU_FAIL(\"Driver name is empty\");\n}\n\nvoid testNameZeroTerminated (const VkPhysicalDeviceDriverPropertiesKHR& deviceDriverProperties)\n{\n\tif (!isNullTerminated(deviceDriverProperties.driverName, VK_MAX_DRIVER_NAME_SIZE_KHR))\n\t\tTCU_FAIL(\"Driver name is not a null-terminated string\");\n}\n\nvoid testInfoZeroTerminated (const VkPhysicalDeviceDriverPropertiesKHR& deviceDriverProperties)\n{\n\tif (!isNullTerminated(deviceDriverProperties.driverInfo, VK_MAX_DRIVER_INFO_SIZE_KHR))\n\t\tTCU_FAIL(\"Driver info is not a null-terminated string\");\n}\n\nvoid testVersion (const VkPhysicalDeviceDriverPropertiesKHR& deviceDriverProperties)\n{\n\tfor (const VkConformanceVersionKHR* pConformanceVersion  = knownConformanceVersions;\n\t\t\t\t\t\t\t\t\t\tpConformanceVersion != DE_ARRAY_END(knownConformanceVersions);\n\t\t\t\t\t\t\t\t\t  ++pConformanceVersion)\n\t{\n\t\tif (deviceDriverProperties.conformanceVersion == *pConformanceVersion)\n\t\t\treturn;\n\t}\n\n\tTCU_FAIL(\"Wrong driver conformance version\");\n}\n\ntcu::TestStatus testQueryProperties (Context& context, const TestType testType)\n{\n\t\/\/ Query the driver properties\n\tconst VkPhysicalDevice\t\t\t\tphysDevice\t\t\t= context.getPhysicalDevice();\n\tconst int\t\t\t\t\t\t\tmemsetPattern\t\t= 0xaa;\n\tVkPhysicalDeviceProperties2\t\t\tdeviceProperties2;\n\tVkPhysicalDeviceDriverPropertiesKHR\tdeviceDriverProperties;\n\n\tdeMemset(&deviceDriverProperties, memsetPattern, sizeof(deviceDriverProperties));\n\tdeviceDriverProperties.sType = VK_STRUCTURE_TYPE_PHYSICAL_DEVICE_DRIVER_PROPERTIES_KHR;\n\tdeviceDriverProperties.pNext = DE_NULL;\n\n\tdeMemset(&deviceProperties2, memsetPattern, sizeof(deviceProperties2));\n\tdeviceProperties2.sType = VK_STRUCTURE_TYPE_PHYSICAL_DEVICE_PROPERTIES_2;\n\tdeviceProperties2.pNext = &deviceDriverProperties;\n\n\tcontext.getInstanceInterface().getPhysicalDeviceProperties2(physDevice, &deviceProperties2);\n\n\t\/\/ Verify the returned values\n\tswitch (testType)\n\t{\n\t\tcase TEST_TYPE_DRIVER_ID_MATCH:\t\t\ttestDriverMatch\t\t\t(deviceDriverProperties);\tbreak;\n\t\tcase TEST_TYPE_NAME_IS_NOT_EMPTY:\t\ttestNameIsNotEmpty\t\t(deviceDriverProperties);\tbreak;\n\t\tcase TEST_TYPE_NAME_ZERO_TERMINATED:\ttestNameZeroTerminated\t(deviceDriverProperties);\tbreak;\n\t\tcase TEST_TYPE_INFO_ZERO_TERMINATED:\ttestInfoZeroTerminated\t(deviceDriverProperties);\tbreak;\n\t\tcase TEST_TYPE_VERSION:\t\t\t\t\ttestVersion\t\t\t\t(deviceDriverProperties);\tbreak;\n\t\tdefault:\t\t\t\t\t\t\t\tTCU_THROW(InternalError, \"Unknown test type specified\");\n\t}\n\n\treturn tcu::TestStatus::pass(\"Pass\");\n}\n\nvoid createTestCases (tcu::TestCaseGroup* group)\n{\n\taddFunctionCase(group, \"driver_id_match\",\t\t\"Check driverID is supported\",\t\t\t\t\tcheckSupport,\ttestQueryProperties,\tTEST_TYPE_DRIVER_ID_MATCH);\n\taddFunctionCase(group, \"name_is_not_empty\",\t\t\"Check name field is not empty\",\t\t\t\tcheckSupport,\ttestQueryProperties,\tTEST_TYPE_NAME_IS_NOT_EMPTY);\n\taddFunctionCase(group, \"name_zero_terminated\",\t\"Check name field is zero-terminated\",\t\t\tcheckSupport,\ttestQueryProperties,\tTEST_TYPE_NAME_ZERO_TERMINATED);\n\taddFunctionCase(group, \"info_zero_terminated\",\t\"Check info field is zero-terminated\",\t\t\tcheckSupport,\ttestQueryProperties,\tTEST_TYPE_INFO_ZERO_TERMINATED);\n\taddFunctionCase(group, \"conformance_version\",\t\"Check conformanceVersion reported by driver\",\tcheckSupport,\ttestQueryProperties,\tTEST_TYPE_VERSION);\n}\n\n} \/\/ anonymous\n\ntcu::TestCaseGroup*\tcreateDriverPropertiesTests(tcu::TestContext& testCtx)\n{\n\treturn createTestGroup(testCtx, \"driver_properties\", \"VK_KHR_driver_properties tests\", createTestCases);\n}\n\n} \/\/ api\n} \/\/ vkt\n<commit_msg>Whitelist Vulkan CTS 1.1.6.3<commit_after>\/*-------------------------------------------------------------------------\n* Vulkan Conformance Tests\n* ------------------------\n*\n* Copyright (c) 2018 Advanced Micro Devices, Inc.\n* Copyright (c) 2018 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* \\file\n* \\brief VK_KHR_driver_properties tests\n*\/\/*--------------------------------------------------------------------*\/\n\n#include \"vktApiDriverPropertiesTests.hpp\"\n#include \"vktTestGroupUtil.hpp\"\n#include \"vktTestCaseUtil.hpp\"\n#include \"vkQueryUtil.hpp\"\n#include \"vkTypeUtil.hpp\"\n\nusing namespace vk;\n\nnamespace vkt\n{\nnamespace api\n{\nnamespace\n{\n\nenum TestType\n{\n\tTEST_TYPE_DRIVER_ID_MATCH\t\t\t= 0,\n\tTEST_TYPE_NAME_IS_NOT_EMPTY,\n\tTEST_TYPE_NAME_ZERO_TERMINATED,\n\tTEST_TYPE_INFO_ZERO_TERMINATED,\n\tTEST_TYPE_VERSION,\n};\n\nstatic const deUint32 knownDriverIds[] =\n{\n\t\/\/ Specified in the Vulkan registry (vk.xml)\n\t1,\t\/\/ author = \"Advanced Micro Devices, Inc.\"   comment = \"AMD proprietary driver\"\n\t2,\t\/\/ author = \"Advanced Micro Devices, Inc.\"   comment = \"AMD open-source driver\"\n\t3,\t\/\/ author = \"Mesa open source project\"       comment = \"Mesa RADV driver\"\n\t4,\t\/\/ author = \"NVIDIA Corporation\"             comment = \"NVIDIA proprietary driver\"\n\t5,\t\/\/ author = \"Intel Corporation\"              comment = \"Intel proprietary Windows driver\"\n\t6,\t\/\/ author = \"Intel Corporation\"              comment = \"Intel open-source Mesa driver\"\n\t7,\t\/\/ author = \"Imagination Technologies\"       comment = \"Imagination proprietary driver\"\n\t8,\t\/\/ author = \"Qualcomm Technologies, Inc.\"    comment = \"Qualcomm proprietary driver\"\n\t9,\t\/\/ author = \"Arm Limited\"                    comment = \"Arm proprietary driver\"\n\t10,\t\/\/ <enum value=\"10\"      name=\"VK_DRIVER_ID_GOOGLE_SWIFTSHADER_KHR\"        comment=\"Google LLC\"\/>\n\t11,\t\/\/ <enum value=\"11\"      name=\"VK_DRIVER_ID_GGP_PROPRIETARY_KHR\"           comment=\"Google LLC\"\/>\n\t12,\t\/\/ <enum value=\"12\"      name=\"VK_DRIVER_ID_BROADCOM_PROPRIETARY_KHR\"      comment=\"Broadcom Inc.\"\/>\n};\n\nstatic const VkConformanceVersionKHR knownConformanceVersions[] =\n{\n\tmakeConformanceVersionKHR(1, 1, 6, 3),\n\tmakeConformanceVersionKHR(1, 1, 6, 2),\n\tmakeConformanceVersionKHR(1, 1, 6, 1),\n\tmakeConformanceVersionKHR(1, 1, 6, 0),\n\tmakeConformanceVersionKHR(1, 1, 5, 2),\n\tmakeConformanceVersionKHR(1, 1, 5, 1),\n\tmakeConformanceVersionKHR(1, 1, 5, 0),\n\tmakeConformanceVersionKHR(1, 1, 4, 3),\n\tmakeConformanceVersionKHR(1, 1, 4, 2),\n\tmakeConformanceVersionKHR(1, 1, 4, 1),\n\tmakeConformanceVersionKHR(1, 1, 4, 0),\n\tmakeConformanceVersionKHR(1, 1, 3, 3),\n\tmakeConformanceVersionKHR(1, 1, 3, 2),\n\tmakeConformanceVersionKHR(1, 1, 3, 1),\n\tmakeConformanceVersionKHR(1, 1, 3, 0),\n\tmakeConformanceVersionKHR(1, 1, 2, 3),\n\tmakeConformanceVersionKHR(1, 1, 2, 2),\n\tmakeConformanceVersionKHR(1, 1, 2, 1),\n\tmakeConformanceVersionKHR(1, 1, 2, 0),\n};\n\nDE_INLINE bool isNullTerminated(const char* str, const deUint32 maxSize)\n{\n\treturn deStrnlen(str, maxSize) < maxSize;\n}\n\nDE_INLINE bool operator==(const VkConformanceVersionKHR& a, const VkConformanceVersionKHR& b)\n{\n\treturn ((a.major == b.major)\t\t&&\n\t\t\t(a.minor == b.minor)\t\t&&\n\t\t\t(a.subminor == b.subminor)\t&&\n\t\t\t(a.patch == b.patch));\n}\n\nvoid checkSupport (Context& context, const TestType config)\n{\n\tDE_UNREF(config);\n\tcontext.requireDeviceFunctionality(\"VK_KHR_driver_properties\");\n}\n\nvoid testDriverMatch (const VkPhysicalDeviceDriverPropertiesKHR& deviceDriverProperties)\n{\n\tfor (const deUint32* pDriverId = knownDriverIds; pDriverId != DE_ARRAY_END(knownDriverIds); ++pDriverId)\n\t{\n\t\tif (deviceDriverProperties.driverID == *pDriverId)\n\t\t\treturn;\n\t}\n\n\tTCU_FAIL(\"Driver ID did not match any known driver\");\n}\n\nvoid testNameIsNotEmpty (const VkPhysicalDeviceDriverPropertiesKHR& deviceDriverProperties)\n{\n\tif (deviceDriverProperties.driverName[0] == 0)\n\t\tTCU_FAIL(\"Driver name is empty\");\n}\n\nvoid testNameZeroTerminated (const VkPhysicalDeviceDriverPropertiesKHR& deviceDriverProperties)\n{\n\tif (!isNullTerminated(deviceDriverProperties.driverName, VK_MAX_DRIVER_NAME_SIZE_KHR))\n\t\tTCU_FAIL(\"Driver name is not a null-terminated string\");\n}\n\nvoid testInfoZeroTerminated (const VkPhysicalDeviceDriverPropertiesKHR& deviceDriverProperties)\n{\n\tif (!isNullTerminated(deviceDriverProperties.driverInfo, VK_MAX_DRIVER_INFO_SIZE_KHR))\n\t\tTCU_FAIL(\"Driver info is not a null-terminated string\");\n}\n\nvoid testVersion (const VkPhysicalDeviceDriverPropertiesKHR& deviceDriverProperties)\n{\n\tfor (const VkConformanceVersionKHR* pConformanceVersion  = knownConformanceVersions;\n\t\t\t\t\t\t\t\t\t\tpConformanceVersion != DE_ARRAY_END(knownConformanceVersions);\n\t\t\t\t\t\t\t\t\t  ++pConformanceVersion)\n\t{\n\t\tif (deviceDriverProperties.conformanceVersion == *pConformanceVersion)\n\t\t\treturn;\n\t}\n\n\tTCU_FAIL(\"Wrong driver conformance version\");\n}\n\ntcu::TestStatus testQueryProperties (Context& context, const TestType testType)\n{\n\t\/\/ Query the driver properties\n\tconst VkPhysicalDevice\t\t\t\tphysDevice\t\t\t= context.getPhysicalDevice();\n\tconst int\t\t\t\t\t\t\tmemsetPattern\t\t= 0xaa;\n\tVkPhysicalDeviceProperties2\t\t\tdeviceProperties2;\n\tVkPhysicalDeviceDriverPropertiesKHR\tdeviceDriverProperties;\n\n\tdeMemset(&deviceDriverProperties, memsetPattern, sizeof(deviceDriverProperties));\n\tdeviceDriverProperties.sType = VK_STRUCTURE_TYPE_PHYSICAL_DEVICE_DRIVER_PROPERTIES_KHR;\n\tdeviceDriverProperties.pNext = DE_NULL;\n\n\tdeMemset(&deviceProperties2, memsetPattern, sizeof(deviceProperties2));\n\tdeviceProperties2.sType = VK_STRUCTURE_TYPE_PHYSICAL_DEVICE_PROPERTIES_2;\n\tdeviceProperties2.pNext = &deviceDriverProperties;\n\n\tcontext.getInstanceInterface().getPhysicalDeviceProperties2(physDevice, &deviceProperties2);\n\n\t\/\/ Verify the returned values\n\tswitch (testType)\n\t{\n\t\tcase TEST_TYPE_DRIVER_ID_MATCH:\t\t\ttestDriverMatch\t\t\t(deviceDriverProperties);\tbreak;\n\t\tcase TEST_TYPE_NAME_IS_NOT_EMPTY:\t\ttestNameIsNotEmpty\t\t(deviceDriverProperties);\tbreak;\n\t\tcase TEST_TYPE_NAME_ZERO_TERMINATED:\ttestNameZeroTerminated\t(deviceDriverProperties);\tbreak;\n\t\tcase TEST_TYPE_INFO_ZERO_TERMINATED:\ttestInfoZeroTerminated\t(deviceDriverProperties);\tbreak;\n\t\tcase TEST_TYPE_VERSION:\t\t\t\t\ttestVersion\t\t\t\t(deviceDriverProperties);\tbreak;\n\t\tdefault:\t\t\t\t\t\t\t\tTCU_THROW(InternalError, \"Unknown test type specified\");\n\t}\n\n\treturn tcu::TestStatus::pass(\"Pass\");\n}\n\nvoid createTestCases (tcu::TestCaseGroup* group)\n{\n\taddFunctionCase(group, \"driver_id_match\",\t\t\"Check driverID is supported\",\t\t\t\t\tcheckSupport,\ttestQueryProperties,\tTEST_TYPE_DRIVER_ID_MATCH);\n\taddFunctionCase(group, \"name_is_not_empty\",\t\t\"Check name field is not empty\",\t\t\t\tcheckSupport,\ttestQueryProperties,\tTEST_TYPE_NAME_IS_NOT_EMPTY);\n\taddFunctionCase(group, \"name_zero_terminated\",\t\"Check name field is zero-terminated\",\t\t\tcheckSupport,\ttestQueryProperties,\tTEST_TYPE_NAME_ZERO_TERMINATED);\n\taddFunctionCase(group, \"info_zero_terminated\",\t\"Check info field is zero-terminated\",\t\t\tcheckSupport,\ttestQueryProperties,\tTEST_TYPE_INFO_ZERO_TERMINATED);\n\taddFunctionCase(group, \"conformance_version\",\t\"Check conformanceVersion reported by driver\",\tcheckSupport,\ttestQueryProperties,\tTEST_TYPE_VERSION);\n}\n\n} \/\/ anonymous\n\ntcu::TestCaseGroup*\tcreateDriverPropertiesTests(tcu::TestContext& testCtx)\n{\n\treturn createTestGroup(testCtx, \"driver_properties\", \"VK_KHR_driver_properties tests\", createTestCases);\n}\n\n} \/\/ api\n} \/\/ vkt\n<|endoftext|>"}
{"text":"<commit_before>#ifndef MIMOSA_SYNC_CHANNEL_HH\n# define MIMOSA_SYNC_CHANNEL_HH\n\n# include \"mutex.hh\"\n# include \"condition.hh\"\n\nnamespace mimosa\n{\n  namespace sync\n  {\n    template <typename T, typename QueueType = std::queue<T> >\n    class Channel : public RefCountable<Channel>,\n                    private NonCopyable\n    {\n    public:\n      inline Channel()\n        : closed_(false),\n          queue_(),\n          mutex_(),\n          cond_()\n      {\n      }\n\n      inline bool push(const T & t)\n      {\n        Mutex::Locker locker(mutex_);\n        if (closed_)\n          return false;\n\n        queue_.push_back(t);\n        cond_.wakeOne();\n        return true;\n      }\n\n      inline bool pop(T & t)\n      {\n        Mutex::Locker locker(mutex_);\n        while (true)\n        {\n          if (!queue_.empty())\n          {\n            t = queue_.front();\n            queue_.pop_front();\n            return true;\n          }\n          else if (closed_)\n            return false;\n          else\n            cond_.wait(mutex_);\n        }\n      }\n\n      inline void close()\n      {\n        Mutex::Locker locker(mutex_);\n        closed_ = true;\n        cond_.wakeAll();\n      }\n\n      bool      closed_;\n      QueueType queue_;\n      Mutex     mutex_;\n      Condition cond_;\n    };\n  }\n}\n\n#endif \/* !MIMOSA_SYNC_CHANNEL_HH *\/\n<commit_msg>Fixes for sync::Channel<commit_after>#ifndef MIMOSA_SYNC_CHANNEL_HH\n# define MIMOSA_SYNC_CHANNEL_HH\n\n# include <queue>\n\n# include \"mutex.hh\"\n# include \"condition.hh\"\n# include \"..\/ref-countable.hh\"\n\nnamespace mimosa\n{\n  namespace sync\n  {\n    template <typename T, typename QueueType = std::queue<T> >\n    class Channel : public RefCountable<Channel<T, QueueType> >,\n                    private NonCopyable\n    {\n    public:\n      inline Channel()\n        : closed_(false),\n          queue_(),\n          mutex_(),\n          cond_()\n      {\n      }\n\n      inline bool push(const T & t)\n      {\n        Mutex::Locker locker(mutex_);\n        if (closed_)\n          return false;\n\n        queue_.push_back(t);\n        cond_.wakeOne();\n        return true;\n      }\n\n      inline bool pop(T & t)\n      {\n        Mutex::Locker locker(mutex_);\n        while (true)\n        {\n          if (!queue_.empty())\n          {\n            t = queue_.front();\n            queue_.pop();\n            return true;\n          }\n          else if (closed_)\n            return false;\n          else\n            cond_.wait(mutex_);\n        }\n      }\n\n      inline void close()\n      {\n        Mutex::Locker locker(mutex_);\n        closed_ = true;\n        cond_.wakeAll();\n      }\n\n      bool      closed_;\n      QueueType queue_;\n      Mutex     mutex_;\n      Condition cond_;\n    };\n  }\n}\n\n#endif \/* !MIMOSA_SYNC_CHANNEL_HH *\/\n<|endoftext|>"}
{"text":"<commit_before>\/**********\n This library 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 2.1 of the License, or (at your\n option) any later version. (See <http:\/\/www.gnu.org\/copyleft\/lesser.html>.)\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 FITNESS\n 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\n along with this library; if not, write to the Free Software Foundation, Inc.,\n 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301  USA\n **********\/\n\/\/ \"liveMedia\"\n\/\/ Copyright (c) 1996-2015 Live Networks, Inc.  All rights reserved.\n\/\/ A file source that is a plain byte stream (rather than frames)\n\/\/ Implementation\n\n#include <stdint.h>\n#include <iostream>\n#include <string>\n\n#include \"m31_hvc_api\/HVC_types.h\"\n#include \"m31_hvc_api\/HVC_encoder.h\"\n#include \"include\/HvcEncoder.hh\"\n\n#include \"ByteStreamFileSource.hh\"\n#include \"InputFile.hh\"\n#include \"GroupsockHelper.hh\"\n\nHvcEncoder *pstEncoder;\n\n\n\/\/\/\/\/\/\/\/\/\/ ByteStreamFileSource \/\/\/\/\/\/\/\/\/\/\n\nByteStreamFileSource*\nByteStreamFileSource::createNew(UsageEnvironment& env, char const* fileName,\n                                unsigned preferredFrameSize,\n                                unsigned playTimePerFrame)\n{\n    FILE* fid = OpenInputFile(env, fileName);\n    if (fid == NULL) return NULL;\n    \n    ByteStreamFileSource* newSource\n    = new ByteStreamFileSource(env, fid, preferredFrameSize, playTimePerFrame);\n    newSource->fFileSize = GetFileSize(fileName, fid);\n    \n    return newSource;\n}\n\nByteStreamFileSource*\nByteStreamFileSource::createNew(UsageEnvironment& env, FILE* fid,\n                                unsigned preferredFrameSize,\n                                unsigned playTimePerFrame)\n{\n    if (fid == NULL) return NULL;\n    \n    ByteStreamFileSource* newSource = new ByteStreamFileSource(env, fid, preferredFrameSize, playTimePerFrame);\n    newSource->fFileSize = GetFileSize(NULL, fid);\n    \n    return newSource;\n}\n\nvoid ByteStreamFileSource::seekToByteAbsolute(u_int64_t byteNumber, u_int64_t numBytesToStream)\n{\n    SeekFile64(fFid, (int64_t)byteNumber, SEEK_SET);\n    \n    fNumBytesToStream = numBytesToStream;\n    fLimitNumBytesToStream = fNumBytesToStream > 0;\n}\n\nvoid ByteStreamFileSource::seekToByteRelative(int64_t offset, u_int64_t numBytesToStream)\n{\n    SeekFile64(fFid, offset, SEEK_CUR);\n    \n    fNumBytesToStream = numBytesToStream;\n    fLimitNumBytesToStream = fNumBytesToStream > 0;\n}\n\nvoid ByteStreamFileSource::seekToEnd()\n{\n    SeekFile64(fFid, 0, SEEK_END);\n}\n\nByteStreamFileSource::ByteStreamFileSource(UsageEnvironment& env, FILE* fid,\n                                           unsigned preferredFrameSize,\n                                           unsigned playTimePerFrame)\n: FramedFileSource(env, fid), fFileSize(0), fPreferredFrameSize(preferredFrameSize),\nfPlayTimePerFrame(playTimePerFrame), fLastPlayTime(0),\nfHaveStartedReading(False), fLimitNumBytesToStream(False), fNumBytesToStream(0)\n{\n#ifndef READ_FROM_FILES_SYNCHRONOUSLY\n    makeSocketNonBlocking(fileno(fFid));\n#endif\n    \n    \/\/ Test whether the file is seekable\n    fFidIsSeekable = FileIsSeekable(fFid);\n}\n\nByteStreamFileSource::~ByteStreamFileSource()\n{\n    if (fFid == NULL) return;\n    \n#ifndef READ_FROM_FILES_SYNCHRONOUSLY\n    envir().taskScheduler().turnOffBackgroundReadHandling(fileno(fFid));\n#endif\n    \n    CloseInputFile(fFid);\n}\n\nvoid ByteStreamFileSource::doGetNextFrame()\n{\n    if (feof(fFid) || ferror(fFid) || (fLimitNumBytesToStream && fNumBytesToStream == 0))\n    {\n        handleClosure();\n        return;\n    }\n    \n#ifdef READ_FROM_FILES_SYNCHRONOUSLY\n    doReadFromFile();\n#else\n    if (!fHaveStartedReading)\n    {\n        \/\/ Await readable data from the file:\n        envir().taskScheduler().turnOnBackgroundReadHandling(fileno(fFid),\n                                                             (TaskScheduler::BackgroundHandlerProc*)&fileReadableHandler, this);\n        fHaveStartedReading = True;\n    }\n#endif\n}\n\nvoid ByteStreamFileSource::doStopGettingFrames()\n{\n    envir().taskScheduler().unscheduleDelayedTask(nextTask());\n#ifndef READ_FROM_FILES_SYNCHRONOUSLY\n    envir().taskScheduler().turnOffBackgroundReadHandling(fileno(fFid));\n    fHaveStartedReading = False;\n#endif\n}\n\nvoid ByteStreamFileSource::fileReadableHandler(ByteStreamFileSource* source, int \/*mask*\/)\n{\n    if (!source->isCurrentlyAwaitingData())\n    {\n        source->doStopGettingFrames(); \/\/ we're not ready for the data yet\n        return;\n    }\n    source->doReadFromFile();\n}\n\n\nvoid ByteStreamFileSource::doReadFromFile()\n{\n    \/\/ Try to read as many bytes as will fit in the buffer provided (or \"fPreferredFrameSize\" if less)\n    if (fLimitNumBytesToStream && fNumBytesToStream < (u_int64_t)fMaxSize)\n    {\n        fMaxSize = (unsigned)fNumBytesToStream;\n    }\n    \n    if (fPreferredFrameSize > 0 && fPreferredFrameSize < fMaxSize)\n    {\n        fMaxSize = fPreferredFrameSize;\n    }\n\n#ifdef READ_FROM_FILES_SYNCHRONOUSLY\n    fFrameSize = fread(fTo, 1, fMaxSize, fFid);\n#else\n    \n    fprintf(stderr, \"\\nfMaxSize=%d\\n\", fMaxSize);\n\n    if (fFidIsSeekable)\n    {\n        \/\/fFrameSize = fread(fTo, 1, fMaxSize, fFid);\n        if (pstEncoder->hasLast())\n        {\n            fprintf(stderr, \"Last ES already!\\n\");\n            fFrameSize = 0;\n\n            pstEncoder->stop();\n            pstEncoder->exit();\n\n            exit(0);            \n        }        \n        \n        fFrameSize = pstEncoder->read(fTo, fMaxSize);\n        \n        fprintf(stderr, \"send length=%d\\n\", fFrameSize);        \n    }\n    else\n    {\n        \/\/ For non-seekable files (e.g., pipes), call \"read()\" rather than \"fread()\", to ensure that the read doesn't block:\n        fFrameSize = read(fileno(fFid), fTo, fMaxSize);\n    }\n#endif\n    if (fFrameSize == 0)\n    {\n        handleClosure();\n        return;\n    }\n    fNumBytesToStream -= fFrameSize;\n    \n    \/\/ Set the 'presentation time':\n    if (fPlayTimePerFrame > 0 && fPreferredFrameSize > 0)\n    {\n        if (fPresentationTime.tv_sec == 0 && fPresentationTime.tv_usec == 0)\n        {\n            \/\/ This is the first frame, so use the current time:\n            gettimeofday(&fPresentationTime, NULL);\n        }\n        else\n        {\n            \/\/ Increment by the play time of the previous data:\n            unsigned uSeconds   = fPresentationTime.tv_usec + fLastPlayTime;\n            fPresentationTime.tv_sec += uSeconds\/1000000;\n            fPresentationTime.tv_usec = uSeconds%1000000;\n        }\n        \n        \/\/ Remember the play time of this data:\n        fLastPlayTime = (fPlayTimePerFrame*fFrameSize)\/fPreferredFrameSize;\n        fDurationInMicroseconds = fLastPlayTime;\n    }\n    else\n    {\n        \/\/ We don't know a specific play time duration for this data,\n        \/\/ so just record the current time as being the 'presentation time':\n        gettimeofday(&fPresentationTime, NULL);\n    }\n    \n    \/\/ Inform the reader that he has data:\n#ifdef READ_FROM_FILES_SYNCHRONOUSLY\n    \/\/ To avoid possible infinite recursion, we need to return to the event loop to do this:\n    nextTask() = envir().taskScheduler().scheduleDelayedTask(0,\n                                                             (TaskFunc*)FramedSource::afterGetting, this);\n#else\n    \/\/ Because the file read was done from the event loop, we can call the\n    \/\/ 'after getting' function directly, without risk of infinite recursion:\n    FramedSource::afterGetting(this);\n#endif\n}\n\n<commit_msg>Checkin test!<commit_after>\/**********\n This library 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 2.1 of the License, or (at your\n option) any later version. (See <http:\/\/www.gnu.org\/copyleft\/lesser.html>.)\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 FITNESS\n 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\n along with this library; if not, write to the Free Software Foundation, Inc.,\n 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301  USA\n **********\/\n\/\/ \"liveMedia\"\n\/\/ Copyright (c) 1996-2015 Live Networks, Inc.  All rights reserved.\n\/\/ A file source that is a plain byte stream (rather than frames)\n\/\/ Implementation\n\n#include <stdint.h>\n#include <iostream>\n#include <string>\n\n\n#include <libvega_encoder_api\/VEGA330X_types.h>\n#include <libvega_encoder_api\/VEGA330X_encoder.h>\n#include \"include\/HvcEncoder.hh\"\n\n#include \"ByteStreamFileSource.hh\"\n#include \"InputFile.hh\"\n#include \"GroupsockHelper.hh\"\n\nEncoder *pstEncoder;\n\n\n\/\/\/\/\/\/\/\/\/\/ ByteStreamFileSource \/\/\/\/\/\/\/\/\/\/\n\nByteStreamFileSource*\nByteStreamFileSource::createNew(UsageEnvironment& env, char const* fileName,\n                                unsigned preferredFrameSize,\n                                unsigned playTimePerFrame)\n{\n    FILE* fid = OpenInputFile(env, fileName);\n    if (fid == NULL) return NULL;\n    \n    ByteStreamFileSource* newSource\n    = new ByteStreamFileSource(env, fid, preferredFrameSize, playTimePerFrame);\n    newSource->fFileSize = GetFileSize(fileName, fid);\n    \n    return newSource;\n}\n\nByteStreamFileSource*\nByteStreamFileSource::createNew(UsageEnvironment& env, FILE* fid,\n                                unsigned preferredFrameSize,\n                                unsigned playTimePerFrame)\n{\n    if (fid == NULL) return NULL;\n    \n    ByteStreamFileSource* newSource = new ByteStreamFileSource(env, fid, preferredFrameSize, playTimePerFrame);\n    newSource->fFileSize = GetFileSize(NULL, fid);\n    \n    return newSource;\n}\n\nvoid ByteStreamFileSource::seekToByteAbsolute(u_int64_t byteNumber, u_int64_t numBytesToStream)\n{\n    SeekFile64(fFid, (int64_t)byteNumber, SEEK_SET);\n    \n    fNumBytesToStream = numBytesToStream;\n    fLimitNumBytesToStream = fNumBytesToStream > 0;\n}\n\nvoid ByteStreamFileSource::seekToByteRelative(int64_t offset, u_int64_t numBytesToStream)\n{\n    SeekFile64(fFid, offset, SEEK_CUR);\n    \n    fNumBytesToStream = numBytesToStream;\n    fLimitNumBytesToStream = fNumBytesToStream > 0;\n}\n\nvoid ByteStreamFileSource::seekToEnd()\n{\n    SeekFile64(fFid, 0, SEEK_END);\n}\n\nByteStreamFileSource::ByteStreamFileSource(UsageEnvironment& env, FILE* fid,\n                                           unsigned preferredFrameSize,\n                                           unsigned playTimePerFrame)\n: FramedFileSource(env, fid), fFileSize(0), fPreferredFrameSize(preferredFrameSize),\nfPlayTimePerFrame(playTimePerFrame), fLastPlayTime(0),\nfHaveStartedReading(False), fLimitNumBytesToStream(False), fNumBytesToStream(0)\n{\n#ifndef READ_FROM_FILES_SYNCHRONOUSLY\n    makeSocketNonBlocking(fileno(fFid));\n#endif\n    \n    \/\/ Test whether the file is seekable\n    fFidIsSeekable = FileIsSeekable(fFid);\n}\n\nByteStreamFileSource::~ByteStreamFileSource()\n{\n    if (fFid == NULL) return;\n    \n#ifndef READ_FROM_FILES_SYNCHRONOUSLY\n    envir().taskScheduler().turnOffBackgroundReadHandling(fileno(fFid));\n#endif\n    \n    CloseInputFile(fFid);\n}\n\nvoid ByteStreamFileSource::doGetNextFrame()\n{\n    if (feof(fFid) || ferror(fFid) || (fLimitNumBytesToStream && fNumBytesToStream == 0))\n    {\n        handleClosure();\n        return;\n    }\n    \n#ifdef READ_FROM_FILES_SYNCHRONOUSLY\n    doReadFromFile();\n#else\n    if (!fHaveStartedReading)\n    {\n        \/\/ Await readable data from the file:\n        envir().taskScheduler().turnOnBackgroundReadHandling(fileno(fFid),\n                                                             (TaskScheduler::BackgroundHandlerProc*)&fileReadableHandler, this);\n        fHaveStartedReading = True;\n    }\n#endif\n}\n\nvoid ByteStreamFileSource::doStopGettingFrames()\n{\n    envir().taskScheduler().unscheduleDelayedTask(nextTask());\n#ifndef READ_FROM_FILES_SYNCHRONOUSLY\n    envir().taskScheduler().turnOffBackgroundReadHandling(fileno(fFid));\n    fHaveStartedReading = False;\n#endif\n}\n\nvoid ByteStreamFileSource::fileReadableHandler(ByteStreamFileSource* source, int \/*mask*\/)\n{\n    if (!source->isCurrentlyAwaitingData())\n    {\n        source->doStopGettingFrames(); \/\/ we're not ready for the data yet\n        return;\n    }\n    source->doReadFromFile();\n}\n\n\nvoid ByteStreamFileSource::doReadFromFile()\n{\n    \/\/ Try to read as many bytes as will fit in the buffer provided (or \"fPreferredFrameSize\" if less)\n    if (fLimitNumBytesToStream && fNumBytesToStream < (u_int64_t)fMaxSize)\n    {\n        fMaxSize = (unsigned)fNumBytesToStream;\n    }\n    \n    if (fPreferredFrameSize > 0 && fPreferredFrameSize < fMaxSize)\n    {\n        fMaxSize = fPreferredFrameSize;\n    }\n\n#ifdef READ_FROM_FILES_SYNCHRONOUSLY\n    fFrameSize = fread(fTo, 1, fMaxSize, fFid);\n#else\n    \n    fprintf(stderr, \"\\nfMaxSize=%d\\n\", fMaxSize);\n\n    if (fFidIsSeekable)\n    {\n        \/\/fFrameSize = fread(fTo, 1, fMaxSize, fFid);\n        if (pstEncoder->hasLastES())\n        {\n            fprintf(stderr, \"Last ES already!\\n\");\n            fFrameSize = 0;\n\n            pstEncoder->stop();\n            pstEncoder->exit();\n\n            exit(0);            \n        }        \n        \n        fFrameSize = pstEncoder->fillWithES(fTo, fMaxSize);\n        \n        fprintf(stderr, \"send length=%d\\n\", fFrameSize);        \n    }\n    else\n    {\n        \/\/ For non-seekable files (e.g., pipes), call \"read()\" rather than \"fread()\", to ensure that the read doesn't block:\n        fFrameSize = read(fileno(fFid), fTo, fMaxSize);\n    }\n#endif\n    if (fFrameSize == 0)\n    {\n        handleClosure();\n        return;\n    }\n    fNumBytesToStream -= fFrameSize;\n    \n    \/\/ Set the 'presentation time':\n    if (fPlayTimePerFrame > 0 && fPreferredFrameSize > 0)\n    {\n        if (fPresentationTime.tv_sec == 0 && fPresentationTime.tv_usec == 0)\n        {\n            \/\/ This is the first frame, so use the current time:\n            gettimeofday(&fPresentationTime, NULL);\n        }\n        else\n        {\n            \/\/ Increment by the play time of the previous data:\n            unsigned uSeconds   = fPresentationTime.tv_usec + fLastPlayTime;\n            fPresentationTime.tv_sec += uSeconds\/1000000;\n            fPresentationTime.tv_usec = uSeconds%1000000;\n        }\n        \n        \/\/ Remember the play time of this data:\n        fLastPlayTime = (fPlayTimePerFrame*fFrameSize)\/fPreferredFrameSize;\n        fDurationInMicroseconds = fLastPlayTime;\n    }\n    else\n    {\n        \/\/ We don't know a specific play time duration for this data,\n        \/\/ so just record the current time as being the 'presentation time':\n        gettimeofday(&fPresentationTime, NULL);\n    }\n    \n    \/\/ Inform the reader that he has data:\n#ifdef READ_FROM_FILES_SYNCHRONOUSLY\n    \/\/ To avoid possible infinite recursion, we need to return to the event loop to do this:\n    nextTask() = envir().taskScheduler().scheduleDelayedTask(0,\n                                                             (TaskFunc*)FramedSource::afterGetting, this);\n#else\n    \/\/ Because the file read was done from the event loop, we can call the\n    \/\/ 'after getting' function directly, without risk of infinite recursion:\n    FramedSource::afterGetting(this);\n#endif\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\\\n* File:          file.cpp\n* Purpose:       Implementation of wxWidgets file extension 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#ifdef __WXMSW__\n#include <io.h> \/\/ for chmod\n#endif\n#include <wx\/stdpaths.h> \/\/ strangely enough, for wxTheFileIconsTable\n#include <wx\/generic\/dirctrlg.h> \/\/ for wxTheFileIconsTable\n#include <wx\/extension\/file.h>\n#include <wx\/extension\/app.h> \/\/ for wxExApp\n#include <wx\/extension\/base.h> \/\/ for wxExFrame\n\nwxExFile::wxExFile()\n  : m_FileName()\n  , m_Stat()\n  , m_Message(_(\"Select File\"))\n  , m_Wildcard(wxFileSelectorDefaultWildcardStr)\n{\n}\n\nwxExFile::wxExFile(const wxString& filename, wxFile::OpenMode mode)\n  : wxFile(filename, mode)\n  , m_FileName(filename)\n  , m_Stat(filename)\n  , m_Message(_(\"Select File\"))\n  , m_Wildcard(wxFileSelectorDefaultWildcardStr)\n{\n  MakeAbsolute();\n}\n\nint wxExFile::AskFileOpen(wxFileDialog& dlg, bool ask_for_continue)\n{\n  if (ask_for_continue)\n  {\n    if (!Continue())\n    {\n      return wxID_CANCEL;\n    }\n  }\n\n  \/\/ Take care that if current filename exists, we set\n  \/\/ the directory member and filename, so that is where the dialog will open.\n  if (m_FileName.FileExists())\n  {\n    dlg.SetFilename(m_FileName.GetFullPath());\n    dlg.SetDirectory(m_FileName.GetPath());\n  }\n\n  m_Message = dlg.GetMessage();\n  m_Wildcard = dlg.GetWildcard();\n\n  return dlg.ShowModal();\n}\n\nbool wxExFile::CheckSyncNeeded()\n{\n  if (IsOpened() ||\n     !m_FileName.GetStat().IsOk() ||\n     !wxExApp::GetConfigBool(\"AllowSync\", true))\n  {\n    return false;\n  }\n\n  if (m_FileName.GetStat().st_mtime != m_Stat.st_mtime)\n  {\n    FileSync();\n  }\n\n  return true;\n}\n\nbool wxExFile::Continue()\n{\n  if (GetContentsChanged())\n  {\n    if (!m_FileName.FileExists())\n    {\n      switch (wxMessageBox(\n        _(\"Save changes\") + \"?\",\n        _(\"Confirm\"),\n        wxYES_NO | wxCANCEL | wxICON_QUESTION))\n      {\n        case wxYES:    if (!FileSaveAs()) return false; break;\n        case wxNO:     ResetContentsChanged(); break;\n        case wxCANCEL: return false; break;\n      }\n    }\n    else\n    {\n      switch (wxMessageBox(\n        _(\"Save changes to\") + \": \" + m_FileName.GetFullPath() + \"?\",\n        _(\"Confirm\"),\n        wxYES_NO | wxCANCEL | wxICON_QUESTION))\n      {\n        case wxYES:    FileSave(); break;\n        case wxNO:     ResetContentsChanged(); break;\n        case wxCANCEL: return false; break;\n      }\n    }\n  }\n\n  return true;\n}\n\nbool wxExFile::FileNew(const wxExFileName& filename)\n{\n  if (!Continue()) return false;\n\n  m_FileName = filename;\n\n  \/\/ Do not make it absolute, the specified filename does not need\n  \/\/ to exist.\n  return true;\n}\n\nbool wxExFile::FileOpen(const wxExFileName& filename)\n{\n  if (\n    !Continue() ||\n    !filename.FileExists()) return false;\n\n  m_FileName = filename;\n\n  if (MakeAbsolute())\n  {\n    return Open(m_FileName.GetFullPath());\n  }\n  else\n  {\n    return false;\n  }\n}\n\nbool wxExFile::FileSave()\n{\n  wxFile::Close();\n\n  return MakeAbsolute();\n}\n\nbool wxExFile::FileSaveAs()\n{\n  wxFileDialog dlg(\n    wxTheApp->GetTopWindow(),\n    m_Message,\n    wxEmptyString,\n    wxEmptyString,\n    m_Wildcard,\n    wxFD_SAVE | wxFD_OVERWRITE_PROMPT);\n\n  if (AskFileOpen(dlg, false) == wxID_CANCEL)\n  {\n    return false;\n  }\n\n  const wxString filename = dlg.GetPath();\n\n  if (!filename.empty())\n  {\n    m_FileName.Assign(filename);\n    m_FileName.SetLexer();\n    return FileSave();\n  }\n\n  return false;\n}\n\nvoid wxExFile::FileSync()\n{\n  if (FileOpen(m_FileName))\n  {\n    m_FileName.StatusText(STAT_SYNC | STAT_FULLPATH);\n  }\n}\n\nbool wxExFile::MakeAbsolute()\n{\n  if (m_FileName.MakeAbsolute())\n  {\n    m_FileName.GetStat().Update(m_FileName.GetFullPath());\n    m_Stat.Update(m_FileName.GetFullPath());\n    return true;\n  }\n  else\n  {\n    return false;\n  }\n}\n\nconst wxCharBuffer wxExFile::Read(wxFileOffset seek_position)\n{\n  const wxFileOffset bytes_to_read = Length() - seek_position;\n\n  \/\/ Always do a seek, so you can do more Reads on the same object.\n  Seek(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;\r\n  }\n\n  return buffer;\n}\n\nint wxExFileName::GetIcon() const\n{\n  if (m_Stat.IsOk())\n  {\n    if (DirExists(GetFullPath()))\n    {\n      return wxFileIconsTable::folder;\n    }\n    else if (!GetExt().empty())\n    {\n      return wxTheFileIconsTable->GetIconID(GetExt());\n    }\n    else\n    {\n      return wxFileIconsTable::computer;\n    }\n  }\n  else\n  {\n    return wxFileIconsTable::computer;\n  }\n}\n\nvoid wxExFileName::SetLexer(\n  const wxString& lexer,\n  const wxString& text)\n{\n  \/\/ Of course, if the lexers are not yet constructed, skip the rest.\n  if (wxExApp::GetLexers() == NULL) return;\n\n  if (lexer.empty())\n  {\n    if (text != \"forced\")\n    {\n      m_Lexer = wxExApp::GetLexers()->FindByFileName(*this);\n\n      if (m_Lexer.GetScintillaLexer().empty() && !text.empty())\n      {\n        m_Lexer = wxExApp::GetLexers()->FindByText(text);\n      }\n    }\n    else\n    {\n      m_Lexer = wxExLexer();\n    }\n  }\n  else\n  {\n    m_Lexer = wxExApp::GetLexers()->FindByName(lexer);\n  }\n}\n\n#if wxUSE_STATUSBAR\nvoid wxExFileName::StatusText(long flags) const\n{\n  wxString text; \/\/ clear status bar for empty or not existing or not initialized file names\n\n  if (IsOk())\n  {\n    const wxString path = (flags & STAT_FULLPATH\n      ? GetFullPath(): GetFullName());\n\n    text += path;\n\n    if (m_Stat.IsOk())\n    {\n      const wxString what = (flags & STAT_SYNC\n        ? _(\"Synchronized\"): _(\"Modified\"));\n      const wxString time = (flags & STAT_SYNC\n        ? wxDateTime::Now().Format(): m_Stat.GetModificationTime());\n      text += \" \" + what + \" \" + time;\n    }\n  }\n\n  wxExFrame::StatusText(text);\n}\n#endif \/\/ wxUSE_STATUSBAR\n\nconst wxString wxExStat::GetModificationTime(const wxString& format) const\n{\n  return wxDateTime(st_mtime).Format(format);\n}\n\nbool wxExStat::IsLink() const\n{\n#ifdef __UNIX__\n  return m_IsOk && (S_ISLNK(st_mode) != 0);\n#else \/\/ S_ISLNK not known\n  return false;\n#endif\n}\n\nbool wxExStat::SetReadOnly(const bool read_only)\n{\n  if (IsOk())\n  {\n    if (chmod(m_FullPath.c_str(),\n          read_only ?\n            st_mode & ~wxS_IWUSR:\n            st_mode | wxS_IWUSR) == 0)\n    {\n      Update(m_FullPath);\n      return IsOk();\n    }\n  }\n\n  return false;\n}\n<commit_msg>inconsistent linefeeds reported by Visual Studio 2008<commit_after>\/******************************************************************************\\\n* File:          file.cpp\n* Purpose:       Implementation of wxWidgets file extension 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#ifdef __WXMSW__\n#include <io.h> \/\/ for chmod\n#endif\n#include <wx\/stdpaths.h> \/\/ strangely enough, for wxTheFileIconsTable\n#include <wx\/generic\/dirctrlg.h> \/\/ for wxTheFileIconsTable\n#include <wx\/extension\/file.h>\n#include <wx\/extension\/app.h> \/\/ for wxExApp\n#include <wx\/extension\/base.h> \/\/ for wxExFrame\n\nwxExFile::wxExFile()\n  : m_FileName()\n  , m_Stat()\n  , m_Message(_(\"Select File\"))\n  , m_Wildcard(wxFileSelectorDefaultWildcardStr)\n{\n}\n\nwxExFile::wxExFile(const wxString& filename, wxFile::OpenMode mode)\n  : wxFile(filename, mode)\n  , m_FileName(filename)\n  , m_Stat(filename)\n  , m_Message(_(\"Select File\"))\n  , m_Wildcard(wxFileSelectorDefaultWildcardStr)\n{\n  MakeAbsolute();\n}\n\nint wxExFile::AskFileOpen(wxFileDialog& dlg, bool ask_for_continue)\n{\n  if (ask_for_continue)\n  {\n    if (!Continue())\n    {\n      return wxID_CANCEL;\n    }\n  }\n\n  \/\/ Take care that if current filename exists, we set\n  \/\/ the directory member and filename, so that is where the dialog will open.\n  if (m_FileName.FileExists())\n  {\n    dlg.SetFilename(m_FileName.GetFullPath());\n    dlg.SetDirectory(m_FileName.GetPath());\n  }\n\n  m_Message = dlg.GetMessage();\n  m_Wildcard = dlg.GetWildcard();\n\n  return dlg.ShowModal();\n}\n\nbool wxExFile::CheckSyncNeeded()\n{\n  if (IsOpened() ||\n     !m_FileName.GetStat().IsOk() ||\n     !wxExApp::GetConfigBool(\"AllowSync\", true))\n  {\n    return false;\n  }\n\n  if (m_FileName.GetStat().st_mtime != m_Stat.st_mtime)\n  {\n    FileSync();\n  }\n\n  return true;\n}\n\nbool wxExFile::Continue()\n{\n  if (GetContentsChanged())\n  {\n    if (!m_FileName.FileExists())\n    {\n      switch (wxMessageBox(\n        _(\"Save changes\") + \"?\",\n        _(\"Confirm\"),\n        wxYES_NO | wxCANCEL | wxICON_QUESTION))\n      {\n        case wxYES:    if (!FileSaveAs()) return false; break;\n        case wxNO:     ResetContentsChanged(); break;\n        case wxCANCEL: return false; break;\n      }\n    }\n    else\n    {\n      switch (wxMessageBox(\n        _(\"Save changes to\") + \": \" + m_FileName.GetFullPath() + \"?\",\n        _(\"Confirm\"),\n        wxYES_NO | wxCANCEL | wxICON_QUESTION))\n      {\n        case wxYES:    FileSave(); break;\n        case wxNO:     ResetContentsChanged(); break;\n        case wxCANCEL: return false; break;\n      }\n    }\n  }\n\n  return true;\n}\n\nbool wxExFile::FileNew(const wxExFileName& filename)\n{\n  if (!Continue()) return false;\n\n  m_FileName = filename;\n\n  \/\/ Do not make it absolute, the specified filename does not need\n  \/\/ to exist.\n  return true;\n}\n\nbool wxExFile::FileOpen(const wxExFileName& filename)\n{\n  if (\n    !Continue() ||\n    !filename.FileExists()) return false;\n\n  m_FileName = filename;\n\n  if (MakeAbsolute())\n  {\n    return Open(m_FileName.GetFullPath());\n  }\n  else\n  {\n    return false;\n  }\n}\n\nbool wxExFile::FileSave()\n{\n  wxFile::Close();\n\n  return MakeAbsolute();\n}\n\nbool wxExFile::FileSaveAs()\n{\n  wxFileDialog dlg(\n    wxTheApp->GetTopWindow(),\n    m_Message,\n    wxEmptyString,\n    wxEmptyString,\n    m_Wildcard,\n    wxFD_SAVE | wxFD_OVERWRITE_PROMPT);\n\n  if (AskFileOpen(dlg, false) == wxID_CANCEL)\n  {\n    return false;\n  }\n\n  const wxString filename = dlg.GetPath();\n\n  if (!filename.empty())\n  {\n    m_FileName.Assign(filename);\n    m_FileName.SetLexer();\n    return FileSave();\n  }\n\n  return false;\n}\n\nvoid wxExFile::FileSync()\n{\n  if (FileOpen(m_FileName))\n  {\n    m_FileName.StatusText(STAT_SYNC | STAT_FULLPATH);\n  }\n}\n\nbool wxExFile::MakeAbsolute()\n{\n  if (m_FileName.MakeAbsolute())\n  {\n    m_FileName.GetStat().Update(m_FileName.GetFullPath());\n    m_Stat.Update(m_FileName.GetFullPath());\n    return true;\n  }\n  else\n  {\n    return false;\n  }\n}\n\nconst wxCharBuffer wxExFile::Read(wxFileOffset seek_position)\n{\n  const wxFileOffset bytes_to_read = Length() - seek_position;\n\n  \/\/ Always do a seek, so you can do more Reads on the same object.\n  Seek(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  return buffer;\n}\n\nint wxExFileName::GetIcon() const\n{\n  if (m_Stat.IsOk())\n  {\n    if (DirExists(GetFullPath()))\n    {\n      return wxFileIconsTable::folder;\n    }\n    else if (!GetExt().empty())\n    {\n      return wxTheFileIconsTable->GetIconID(GetExt());\n    }\n    else\n    {\n      return wxFileIconsTable::computer;\n    }\n  }\n  else\n  {\n    return wxFileIconsTable::computer;\n  }\n}\n\nvoid wxExFileName::SetLexer(\n  const wxString& lexer,\n  const wxString& text)\n{\n  \/\/ Of course, if the lexers are not yet constructed, skip the rest.\n  if (wxExApp::GetLexers() == NULL) return;\n\n  if (lexer.empty())\n  {\n    if (text != \"forced\")\n    {\n      m_Lexer = wxExApp::GetLexers()->FindByFileName(*this);\n\n      if (m_Lexer.GetScintillaLexer().empty() && !text.empty())\n      {\n        m_Lexer = wxExApp::GetLexers()->FindByText(text);\n      }\n    }\n    else\n    {\n      m_Lexer = wxExLexer();\n    }\n  }\n  else\n  {\n    m_Lexer = wxExApp::GetLexers()->FindByName(lexer);\n  }\n}\n\n#if wxUSE_STATUSBAR\nvoid wxExFileName::StatusText(long flags) const\n{\n  wxString text; \/\/ clear status bar for empty or not existing or not initialized file names\n\n  if (IsOk())\n  {\n    const wxString path = (flags & STAT_FULLPATH\n      ? GetFullPath(): GetFullName());\n\n    text += path;\n\n    if (m_Stat.IsOk())\n    {\n      const wxString what = (flags & STAT_SYNC\n        ? _(\"Synchronized\"): _(\"Modified\"));\n      const wxString time = (flags & STAT_SYNC\n        ? wxDateTime::Now().Format(): m_Stat.GetModificationTime());\n      text += \" \" + what + \" \" + time;\n    }\n  }\n\n  wxExFrame::StatusText(text);\n}\n#endif \/\/ wxUSE_STATUSBAR\n\nconst wxString wxExStat::GetModificationTime(const wxString& format) const\n{\n  return wxDateTime(st_mtime).Format(format);\n}\n\nbool wxExStat::IsLink() const\n{\n#ifdef __UNIX__\n  return m_IsOk && (S_ISLNK(st_mode) != 0);\n#else \/\/ S_ISLNK not known\n  return false;\n#endif\n}\n\nbool wxExStat::SetReadOnly(const bool read_only)\n{\n  if (IsOk())\n  {\n    if (chmod(m_FullPath.c_str(),\n          read_only ?\n            st_mode & ~wxS_IWUSR:\n            st_mode | wxS_IWUSR) == 0)\n    {\n      Update(m_FullPath);\n      return IsOk();\n    }\n  }\n\n  return false;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\\\n* File:          menu.cpp\n* Purpose:       Implementation of wxExMenu 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 <map>\n#include <wx\/extension\/menu.h>\n#include <wx\/extension\/art.h>\n#include <wx\/extension\/lexers.h>\n#include <wx\/extension\/tool.h>\n#include <wx\/extension\/util.h> \/\/ for wxExEllipsed\n#include <wx\/extension\/vcs.h>\n\n#if wxUSE_GUI\n\nwxExMenu::wxExMenu(long style)\n  : m_Style(style)\n  , m_MenuVCSFilled(false)\n{\n}\n\nwxExMenu::wxExMenu(const wxExMenu& menu)\n  : m_Style(menu.m_Style)\n  , m_MenuVCSFilled(menu.m_MenuVCSFilled)\n{\n}\n\nwxMenuItem* wxExMenu::Append(int id)\n{\n  \/\/ Using wxMenu::Append(id)\n  \/\/ also appends the stock item,\n  \/\/ but does not add the bitmap.\n\n  wxMenuItem* item = new wxMenuItem(this, id);\n\n  const wxExStockArt art(id);\n\n  if (art.GetBitmap().IsOk())\n  {\n    item->SetBitmap(art.GetBitmap(\n      wxART_MENU, \n      wxArtProvider::GetSizeHint(wxART_MENU, true)));\n  }\n\n  return wxMenu::Append(item);\n}\n\nwxMenuItem* wxExMenu::Append(\n  int id,\n  const wxString& name,\n  const wxString& helptext,\n  const wxArtID& artid)\n{\n  wxMenuItem* item = new wxMenuItem(this, id, name, helptext);\n\n  if (!artid.empty())\n  {\n    const wxBitmap bitmap = \n      wxArtProvider::GetBitmap(\n        artid, \n        wxART_MENU, \n        wxArtProvider::GetSizeHint(wxART_MENU, true));\n\n    if (bitmap.IsOk())\n    {\n      item->SetBitmap(bitmap);\n    }\n  }\n\n  return wxMenu::Append(item);\n}\n\nvoid wxExMenu::AppendBars()\n{\n#ifndef __WXGTK__\n  AppendCheckItem(ID_VIEW_MENUBAR, _(\"&Menubar\\tCtrl+B\");\n#endif\n  AppendCheckItem(ID_VIEW_STATUSBAR, _(\"&Statusbar\"));\n  AppendCheckItem(ID_VIEW_TOOLBAR, _(\"&Toolbar\"));\n  AppendCheckItem(ID_VIEW_FINDBAR, _(\"&Findbar\"));\n}\n\nvoid wxExMenu::AppendEdit(bool add_invert)\n{\n  if (!(m_Style & MENU_IS_READ_ONLY) &&\n       (m_Style & MENU_IS_SELECTED))\n  {\n    Append(wxID_CUT);\n  }\n\n  if (m_Style & MENU_IS_SELECTED)\n  {\n    Append(wxID_COPY);\n  }\n\n  if (!(m_Style & MENU_IS_READ_ONLY) &&\n       (m_Style & MENU_CAN_PASTE))\n  {\n    Append(wxID_PASTE);\n  }\n\n  if (!(m_Style & MENU_IS_SELECTED) &&\n      !(m_Style & MENU_IS_EMPTY))\n  {\n    Append(wxID_SELECTALL);\n  }\n  else\n  {\n    if (add_invert && !(m_Style & MENU_IS_EMPTY))\n    {\n      Append(ID_EDIT_SELECT_NONE, _(\"&Deselect All\"));\n    }\n  }\n\n  if (m_Style & MENU_ALLOW_CLEAR)\n  {\n    Append(wxID_CLEAR);\n  }\n\n  if (add_invert && !(m_Style & MENU_IS_EMPTY))\n  {\n    Append(ID_EDIT_SELECT_INVERT, _(\"&Invert\"));\n  }\n\n  if (!(m_Style & MENU_IS_READ_ONLY) &&\n       (m_Style & MENU_IS_SELECTED) &&\n      !(m_Style & MENU_IS_EMPTY))\n  {\n    Append(wxID_DELETE);\n  }\n}\n\nvoid wxExMenu::AppendPrint()\n{\n  Append(wxID_PRINT_SETUP, wxExEllipsed(_(\"Page &Setup\")));\n  Append(wxID_PREVIEW);\n  Append(wxID_PRINT);\n}\n\nvoid wxExMenu::AppendSeparator()\n{\n  if (\n    GetMenuItemCount() == 0 ||\n    FindItemByPosition(GetMenuItemCount() - 1)->IsSeparator())\n  {\n    return;\n  }\n\n  wxMenu::AppendSeparator();\n}\n\nvoid wxExMenu::AppendSubMenu(\n  wxMenu *submenu,\n  const wxString& text,\n  const wxString& help,\n  int itemid)\n{\n  if (itemid == wxID_ANY)\n  {\n    wxMenu::AppendSubMenu(submenu, text, help);\n  }\n  else\n  {\n    \/\/ This one is deprecated, but is necessary if\n    \/\/ we have an explicit itemid.\n    wxMenu::Append(itemid, text, submenu, help);\n  }\n}\n\nbool wxExMenu::AppendTools(int itemid)\n{\n  if (wxExLexers::Get()->Count() == 0)\n  {\n    return false;\n  }\n\n  wxExMenu* menuTool = new wxExMenu(*this);\n\n  for (\n    auto it = \n      wxExTool::Get()->GetToolInfo().begin();\n    it != wxExTool::Get()->GetToolInfo().end();\n    ++it)\n  {\n    if (!it->second.GetText().empty())\n    {\n      const bool vcs_type = wxExTool(it->first).IsRCSType();\n\n      if ((vcs_type && !wxExVCS::Get()->Use()) || !vcs_type)\n      {\n        menuTool->Append(\n          it->first, \n          it->second.GetText(), \n          it->second.GetHelpText());\n      }\n    }\n  }\n\n  AppendSubMenu(menuTool, _(\"&Tools\"), wxEmptyString, itemid);\n\n  return true;\n}\n\n\/\/ This is the VCS submenu, as present on a popup.\n\/\/ Therefore it is build when clicking, and does not\n\/\/ need to be destroyed an old one.\nvoid wxExMenu::AppendVCS(const wxExFileName& filename)\n{\n  if (!wxExVCS::Get()->Use())\n  {\n    return;\n  }\n\n  const int vcs_offset_id = ID_EDIT_VCS_LOWEST + 1;\n\n  wxExMenu* vcsmenu = new wxExMenu;\n  wxExVCS::Get()->BuildMenu(vcs_offset_id, vcsmenu, filename);\n\n  if (vcsmenu->GetMenuItemCount() > 0)\n  { \n    AppendSubMenu(vcsmenu, \"&VCS\");\n  }\n}\n\n\/\/ This is the general VCS menu, it is in the main menu,\n\/\/ and because contents depends on actual VCS used,\n\/\/ it is rebuild after change of VCS system.\nvoid wxExMenu::BuildVCS(bool fill)\n{\n  if (m_MenuVCSFilled)\n  {\n    wxMenuItem* item;\n\n    while ((item = FindItem(wxID_SEPARATOR)) != NULL)\n    {\n      Destroy(item);\n    }\n\n    for (int id = ID_VCS_LOWEST + 1; id < ID_VCS_HIGHEST; id++)\n    {\n      \/\/ When using only Destroy, and the item does not exist,\n      \/\/ an assert happens.\n      if (FindItem(id) != NULL)\n      {\n        Destroy(id);\n      }\n    }\n  }\n\n  if (fill)\n  {\n    const int vcs_offset_id = ID_VCS_LOWEST + 1;\n    \n    wxExVCS::Get()->BuildMenu(\n      vcs_offset_id, \n      this, \n      wxExFileName(), \n      false); \/\/ no popup\n      \n    if (GetMenuItemCount() == 0)\n    {\n      fill = false;\n    }\n  }\n\n  m_MenuVCSFilled = fill;\n}\n#endif \/\/ wxUSE_GUI\n<commit_msg>fixed compile error<commit_after>\/******************************************************************************\\\n* File:          menu.cpp\n* Purpose:       Implementation of wxExMenu 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 <map>\n#include <wx\/extension\/menu.h>\n#include <wx\/extension\/art.h>\n#include <wx\/extension\/lexers.h>\n#include <wx\/extension\/tool.h>\n#include <wx\/extension\/util.h> \/\/ for wxExEllipsed\n#include <wx\/extension\/vcs.h>\n\n#if wxUSE_GUI\n\nwxExMenu::wxExMenu(long style)\n  : m_Style(style)\n  , m_MenuVCSFilled(false)\n{\n}\n\nwxExMenu::wxExMenu(const wxExMenu& menu)\n  : m_Style(menu.m_Style)\n  , m_MenuVCSFilled(menu.m_MenuVCSFilled)\n{\n}\n\nwxMenuItem* wxExMenu::Append(int id)\n{\n  \/\/ Using wxMenu::Append(id)\n  \/\/ also appends the stock item,\n  \/\/ but does not add the bitmap.\n\n  wxMenuItem* item = new wxMenuItem(this, id);\n\n  const wxExStockArt art(id);\n\n  if (art.GetBitmap().IsOk())\n  {\n    item->SetBitmap(art.GetBitmap(\n      wxART_MENU, \n      wxArtProvider::GetSizeHint(wxART_MENU, true)));\n  }\n\n  return wxMenu::Append(item);\n}\n\nwxMenuItem* wxExMenu::Append(\n  int id,\n  const wxString& name,\n  const wxString& helptext,\n  const wxArtID& artid)\n{\n  wxMenuItem* item = new wxMenuItem(this, id, name, helptext);\n\n  if (!artid.empty())\n  {\n    const wxBitmap bitmap = \n      wxArtProvider::GetBitmap(\n        artid, \n        wxART_MENU, \n        wxArtProvider::GetSizeHint(wxART_MENU, true));\n\n    if (bitmap.IsOk())\n    {\n      item->SetBitmap(bitmap);\n    }\n  }\n\n  return wxMenu::Append(item);\n}\n\nvoid wxExMenu::AppendBars()\n{\n#ifndef __WXGTK__\n  AppendCheckItem(ID_VIEW_MENUBAR, _(\"&Menubar\\tCtrl+B\"));\n#endif\n  AppendCheckItem(ID_VIEW_STATUSBAR, _(\"&Statusbar\"));\n  AppendCheckItem(ID_VIEW_TOOLBAR, _(\"&Toolbar\"));\n  AppendCheckItem(ID_VIEW_FINDBAR, _(\"&Findbar\"));\n}\n\nvoid wxExMenu::AppendEdit(bool add_invert)\n{\n  if (!(m_Style & MENU_IS_READ_ONLY) &&\n       (m_Style & MENU_IS_SELECTED))\n  {\n    Append(wxID_CUT);\n  }\n\n  if (m_Style & MENU_IS_SELECTED)\n  {\n    Append(wxID_COPY);\n  }\n\n  if (!(m_Style & MENU_IS_READ_ONLY) &&\n       (m_Style & MENU_CAN_PASTE))\n  {\n    Append(wxID_PASTE);\n  }\n\n  if (!(m_Style & MENU_IS_SELECTED) &&\n      !(m_Style & MENU_IS_EMPTY))\n  {\n    Append(wxID_SELECTALL);\n  }\n  else\n  {\n    if (add_invert && !(m_Style & MENU_IS_EMPTY))\n    {\n      Append(ID_EDIT_SELECT_NONE, _(\"&Deselect All\"));\n    }\n  }\n\n  if (m_Style & MENU_ALLOW_CLEAR)\n  {\n    Append(wxID_CLEAR);\n  }\n\n  if (add_invert && !(m_Style & MENU_IS_EMPTY))\n  {\n    Append(ID_EDIT_SELECT_INVERT, _(\"&Invert\"));\n  }\n\n  if (!(m_Style & MENU_IS_READ_ONLY) &&\n       (m_Style & MENU_IS_SELECTED) &&\n      !(m_Style & MENU_IS_EMPTY))\n  {\n    Append(wxID_DELETE);\n  }\n}\n\nvoid wxExMenu::AppendPrint()\n{\n  Append(wxID_PRINT_SETUP, wxExEllipsed(_(\"Page &Setup\")));\n  Append(wxID_PREVIEW);\n  Append(wxID_PRINT);\n}\n\nvoid wxExMenu::AppendSeparator()\n{\n  if (\n    GetMenuItemCount() == 0 ||\n    FindItemByPosition(GetMenuItemCount() - 1)->IsSeparator())\n  {\n    return;\n  }\n\n  wxMenu::AppendSeparator();\n}\n\nvoid wxExMenu::AppendSubMenu(\n  wxMenu *submenu,\n  const wxString& text,\n  const wxString& help,\n  int itemid)\n{\n  if (itemid == wxID_ANY)\n  {\n    wxMenu::AppendSubMenu(submenu, text, help);\n  }\n  else\n  {\n    \/\/ This one is deprecated, but is necessary if\n    \/\/ we have an explicit itemid.\n    wxMenu::Append(itemid, text, submenu, help);\n  }\n}\n\nbool wxExMenu::AppendTools(int itemid)\n{\n  if (wxExLexers::Get()->Count() == 0)\n  {\n    return false;\n  }\n\n  wxExMenu* menuTool = new wxExMenu(*this);\n\n  for (\n    auto it = \n      wxExTool::Get()->GetToolInfo().begin();\n    it != wxExTool::Get()->GetToolInfo().end();\n    ++it)\n  {\n    if (!it->second.GetText().empty())\n    {\n      const bool vcs_type = wxExTool(it->first).IsRCSType();\n\n      if ((vcs_type && !wxExVCS::Get()->Use()) || !vcs_type)\n      {\n        menuTool->Append(\n          it->first, \n          it->second.GetText(), \n          it->second.GetHelpText());\n      }\n    }\n  }\n\n  AppendSubMenu(menuTool, _(\"&Tools\"), wxEmptyString, itemid);\n\n  return true;\n}\n\n\/\/ This is the VCS submenu, as present on a popup.\n\/\/ Therefore it is build when clicking, and does not\n\/\/ need to be destroyed an old one.\nvoid wxExMenu::AppendVCS(const wxExFileName& filename)\n{\n  if (!wxExVCS::Get()->Use())\n  {\n    return;\n  }\n\n  const int vcs_offset_id = ID_EDIT_VCS_LOWEST + 1;\n\n  wxExMenu* vcsmenu = new wxExMenu;\n  wxExVCS::Get()->BuildMenu(vcs_offset_id, vcsmenu, filename);\n\n  if (vcsmenu->GetMenuItemCount() > 0)\n  { \n    AppendSubMenu(vcsmenu, \"&VCS\");\n  }\n}\n\n\/\/ This is the general VCS menu, it is in the main menu,\n\/\/ and because contents depends on actual VCS used,\n\/\/ it is rebuild after change of VCS system.\nvoid wxExMenu::BuildVCS(bool fill)\n{\n  if (m_MenuVCSFilled)\n  {\n    wxMenuItem* item;\n\n    while ((item = FindItem(wxID_SEPARATOR)) != NULL)\n    {\n      Destroy(item);\n    }\n\n    for (int id = ID_VCS_LOWEST + 1; id < ID_VCS_HIGHEST; id++)\n    {\n      \/\/ When using only Destroy, and the item does not exist,\n      \/\/ an assert happens.\n      if (FindItem(id) != NULL)\n      {\n        Destroy(id);\n      }\n    }\n  }\n\n  if (fill)\n  {\n    const int vcs_offset_id = ID_VCS_LOWEST + 1;\n    \n    wxExVCS::Get()->BuildMenu(\n      vcs_offset_id, \n      this, \n      wxExFileName(), \n      false); \/\/ no popup\n      \n    if (GetMenuItemCount() == 0)\n    {\n      fill = false;\n    }\n  }\n\n  m_MenuVCSFilled = fill;\n}\n#endif \/\/ wxUSE_GUI\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2009-2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-2018 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <primitives\/transaction.h>\n\n#include <hash.h>\n#include <tinyformat.h>\n#include <util\/strencodings.h>\n#include <assert.h>\n\/\/ SYSCOIN\nconst int SYSCOIN_TX_VERSION_ALLOCATION_BURN_TO_SYSCOIN = 128;\nstd::string COutPoint::ToString() const\n{\n    return strprintf(\"COutPoint(%s, %u)\", hash.ToString().substr(0,10), n);\n}\n\/\/ SYSCOIN\nstd::string COutPoint::ToStringShort() const\n{\n    return strprintf(\"%s-%u\", hash.ToString().substr(0,64), n);\n}\nCTxIn::CTxIn(COutPoint prevoutIn, CScript scriptSigIn, uint32_t nSequenceIn)\n{\n    prevout = prevoutIn;\n    scriptSig = scriptSigIn;\n    nSequence = nSequenceIn;\n}\n\nCTxIn::CTxIn(uint256 hashPrevTx, uint32_t nOut, CScript scriptSigIn, uint32_t nSequenceIn)\n{\n    prevout = COutPoint(hashPrevTx, nOut);\n    scriptSig = scriptSigIn;\n    nSequence = nSequenceIn;\n}\n\nstd::string CTxIn::ToString() const\n{\n    std::string str;\n    str += \"CTxIn(\";\n    str += prevout.ToString();\n    if (prevout.IsNull())\n        str += strprintf(\", coinbase %s\", HexStr(scriptSig));\n    else\n        str += strprintf(\", scriptSig=%s\", HexStr(scriptSig).substr(0, 24));\n    if (nSequence != SEQUENCE_FINAL)\n        str += strprintf(\", nSequence=%u\", nSequence);\n    str += \")\";\n    return str;\n}\n\nCTxOut::CTxOut(const CAmount& nValueIn, CScript scriptPubKeyIn)\n{\n    nValue = nValueIn;\n    scriptPubKey = scriptPubKeyIn;\n}\nstd::string CTxOut::ToString() const\n{\n    return strprintf(\"CTxOut(nValue=%d.%08d, scriptPubKey=%s\", nValue \/ COIN, nValue % COIN, HexStr(scriptPubKey).substr(0, 30));\n}\n\/\/ SYSCOIN\nstd::string CTxOutCoin::ToString() const\n{\n    if(assetInfo.IsNull())\n        return strprintf(\"CTxOutCoin(nValue=%d.%08d, scriptPubKey=%s)\", nValue \/ COIN, nValue % COIN, HexStr(scriptPubKey).substr(0, 30));\n    else\n        return strprintf(\"CTxOutCoin(nValue=%d.%08d, scriptPubKey=%s, nAsset=%d, nAssetValue=%d.%08d)\", nValue \/ COIN, nValue % COIN, HexStr(scriptPubKey).substr(0, 30), assetInfo.nAsset, assetInfo.nValue \/ COIN, assetInfo.nValue % COIN);\n}\nCMutableTransaction::CMutableTransaction() : nVersion(CTransaction::CURRENT_VERSION), nLockTime(0) {}\nCMutableTransaction::CMutableTransaction(const CTransaction& tx) : vin(tx.vin), vout(tx.vout), nVersion(tx.nVersion), nLockTime(tx.nLockTime) {}\n\nuint256 CMutableTransaction::GetHash() const\n{\n    return SerializeHash(*this, SER_GETHASH, SERIALIZE_TRANSACTION_NO_WITNESS);\n}\n\nuint256 CTransaction::ComputeHash() const\n{\n    return SerializeHash(*this, SER_GETHASH, SERIALIZE_TRANSACTION_NO_WITNESS);\n}\n\nuint256 CTransaction::ComputeWitnessHash() const\n{\n    if (!HasWitness()) {\n        return hash;\n    }\n    return SerializeHash(*this, SER_GETHASH, 0);\n}\n\n\/* For backward compatibility, the hash is initialized to 0. TODO: remove the need for this default constructor entirely. *\/\nCTransaction::CTransaction() : vin(), vout(), hash{}, m_witness_hash{}, nVersion(CTransaction::CURRENT_VERSION), nLockTime(0) {}\nCTransaction::CTransaction(const CMutableTransaction& tx) : vin(tx.vin), vout(tx.vout), hash{ComputeHash()}, m_witness_hash{ComputeWitnessHash()}, nVersion(tx.nVersion), nLockTime(tx.nLockTime) {}\nCTransaction::CTransaction(CMutableTransaction&& tx) : vin(std::move(tx.vin)), vout(std::move(tx.vout)), hash{ComputeHash()}, m_witness_hash{ComputeWitnessHash()}, nVersion(tx.nVersion), nLockTime(tx.nLockTime) {}\n\n\/\/ SYSCOIN\nCTransaction& CTransaction::operator=(const CTransaction &tx) {\n    *const_cast<int32_t*>(&nVersion) = tx.nVersion;\n    *const_cast<std::vector<CTxIn>*>(&vin) = tx.vin;\n    *const_cast<std::vector<CTxOut>*>(&vout) = tx.vout;\n    *const_cast<uint32_t*>(&nLockTime) = tx.nLockTime;\n    *const_cast<uint256*>(&hash) = tx.hash;\n    *const_cast<uint256*>(&m_witness_hash) = tx.m_witness_hash;\n    return *this;\n}\nCAmount CTransaction::GetValueOut() const\n{\n    CAmount nValueOut = 0;\n    bool bFirstOutput = true;\n    for (const auto& tx_out : vout) {\n        \/\/ SYSCOIN\n        if(bFirstOutput && nVersion == SYSCOIN_TX_VERSION_ALLOCATION_BURN_TO_SYSCOIN){\n            bFirstOutput = false;\n            continue;\n        }\n        if (!MoneyRange(tx_out.nValue) || !MoneyRange(nValueOut + tx_out.nValue))\n            throw std::runtime_error(std::string(__func__) + \": value out of range\");\n        nValueOut += tx_out.nValue;\n    }\n    assert(MoneyRange(nValueOut));\n    return nValueOut;\n}\n\nunsigned int CTransaction::GetTotalSize() const\n{\n    return ::GetSerializeSize(*this, PROTOCOL_VERSION);\n}\n\nstd::string CTransaction::ToString() const\n{\n    std::string str;\n    str += strprintf(\"CTransaction(hash=%s, ver=%d, vin.size=%u, vout.size=%u, nLockTime=%u)\\n\",\n        GetHash().ToString().substr(0,10),\n        nVersion,\n        vin.size(),\n        vout.size(),\n        nLockTime);\n    for (const auto& tx_in : vin)\n        str += \"    \" + tx_in.ToString() + \"\\n\";\n    for (const auto& tx_in : vin)\n        str += \"    \" + tx_in.scriptWitness.ToString() + \"\\n\";\n    for (const auto& tx_out : vout)\n        str += \"    \" + tx_out.ToString() + \"\\n\";\n    return str;\n}\n<commit_msg>resync to current network<commit_after>\/\/ Copyright (c) 2009-2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-2018 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <primitives\/transaction.h>\n\n#include <hash.h>\n#include <tinyformat.h>\n#include <util\/strencodings.h>\n#include <assert.h>\n\/\/ SYSCOIN\nconst int SYSCOIN_TX_VERSION_ALLOCATION_BURN_TO_SYSCOIN = 128;\nconst int SYSCOIN_TX_VERSION_ALLOCATION_BURN_TO_SYSCOIN_LEGACY = 0x7400;\nstd::string COutPoint::ToString() const\n{\n    return strprintf(\"COutPoint(%s, %u)\", hash.ToString().substr(0,10), n);\n}\n\/\/ SYSCOIN\nstd::string COutPoint::ToStringShort() const\n{\n    return strprintf(\"%s-%u\", hash.ToString().substr(0,64), n);\n}\nCTxIn::CTxIn(COutPoint prevoutIn, CScript scriptSigIn, uint32_t nSequenceIn)\n{\n    prevout = prevoutIn;\n    scriptSig = scriptSigIn;\n    nSequence = nSequenceIn;\n}\n\nCTxIn::CTxIn(uint256 hashPrevTx, uint32_t nOut, CScript scriptSigIn, uint32_t nSequenceIn)\n{\n    prevout = COutPoint(hashPrevTx, nOut);\n    scriptSig = scriptSigIn;\n    nSequence = nSequenceIn;\n}\n\nstd::string CTxIn::ToString() const\n{\n    std::string str;\n    str += \"CTxIn(\";\n    str += prevout.ToString();\n    if (prevout.IsNull())\n        str += strprintf(\", coinbase %s\", HexStr(scriptSig));\n    else\n        str += strprintf(\", scriptSig=%s\", HexStr(scriptSig).substr(0, 24));\n    if (nSequence != SEQUENCE_FINAL)\n        str += strprintf(\", nSequence=%u\", nSequence);\n    str += \")\";\n    return str;\n}\n\nCTxOut::CTxOut(const CAmount& nValueIn, CScript scriptPubKeyIn)\n{\n    nValue = nValueIn;\n    scriptPubKey = scriptPubKeyIn;\n}\nstd::string CTxOut::ToString() const\n{\n    return strprintf(\"CTxOut(nValue=%d.%08d, scriptPubKey=%s\", nValue \/ COIN, nValue % COIN, HexStr(scriptPubKey).substr(0, 30));\n}\n\/\/ SYSCOIN\nstd::string CTxOutCoin::ToString() const\n{\n    if(assetInfo.IsNull())\n        return strprintf(\"CTxOutCoin(nValue=%d.%08d, scriptPubKey=%s)\", nValue \/ COIN, nValue % COIN, HexStr(scriptPubKey).substr(0, 30));\n    else\n        return strprintf(\"CTxOutCoin(nValue=%d.%08d, scriptPubKey=%s, nAsset=%d, nAssetValue=%d.%08d)\", nValue \/ COIN, nValue % COIN, HexStr(scriptPubKey).substr(0, 30), assetInfo.nAsset, assetInfo.nValue \/ COIN, assetInfo.nValue % COIN);\n}\nCMutableTransaction::CMutableTransaction() : nVersion(CTransaction::CURRENT_VERSION), nLockTime(0) {}\nCMutableTransaction::CMutableTransaction(const CTransaction& tx) : vin(tx.vin), vout(tx.vout), nVersion(tx.nVersion), nLockTime(tx.nLockTime) {}\n\nuint256 CMutableTransaction::GetHash() const\n{\n    return SerializeHash(*this, SER_GETHASH, SERIALIZE_TRANSACTION_NO_WITNESS);\n}\n\nuint256 CTransaction::ComputeHash() const\n{\n    return SerializeHash(*this, SER_GETHASH, SERIALIZE_TRANSACTION_NO_WITNESS);\n}\n\nuint256 CTransaction::ComputeWitnessHash() const\n{\n    if (!HasWitness()) {\n        return hash;\n    }\n    return SerializeHash(*this, SER_GETHASH, 0);\n}\n\n\/* For backward compatibility, the hash is initialized to 0. TODO: remove the need for this default constructor entirely. *\/\nCTransaction::CTransaction() : vin(), vout(), hash{}, m_witness_hash{}, nVersion(CTransaction::CURRENT_VERSION), nLockTime(0) {}\nCTransaction::CTransaction(const CMutableTransaction& tx) : vin(tx.vin), vout(tx.vout), hash{ComputeHash()}, m_witness_hash{ComputeWitnessHash()}, nVersion(tx.nVersion), nLockTime(tx.nLockTime) {}\nCTransaction::CTransaction(CMutableTransaction&& tx) : vin(std::move(tx.vin)), vout(std::move(tx.vout)), hash{ComputeHash()}, m_witness_hash{ComputeWitnessHash()}, nVersion(tx.nVersion), nLockTime(tx.nLockTime) {}\n\n\/\/ SYSCOIN\nCTransaction& CTransaction::operator=(const CTransaction &tx) {\n    *const_cast<int32_t*>(&nVersion) = tx.nVersion;\n    *const_cast<std::vector<CTxIn>*>(&vin) = tx.vin;\n    *const_cast<std::vector<CTxOut>*>(&vout) = tx.vout;\n    *const_cast<uint32_t*>(&nLockTime) = tx.nLockTime;\n    *const_cast<uint256*>(&hash) = tx.hash;\n    *const_cast<uint256*>(&m_witness_hash) = tx.m_witness_hash;\n    return *this;\n}\nCAmount CTransaction::GetValueOut() const\n{\n    CAmount nValueOut = 0;\n    bool bFirstOutput = true;\n    for (const auto& tx_out : vout) {\n        \/\/ SYSCOIN\n        if(bFirstOutput && (nVersion == SYSCOIN_TX_VERSION_ALLOCATION_BURN_TO_SYSCOIN || nVersion == SYSCOIN_TX_VERSION_ALLOCATION_BURN_TO_SYSCOIN_LEGACY)){\n            bFirstOutput = false;\n            continue;\n        }\n        if (!MoneyRange(tx_out.nValue) || !MoneyRange(nValueOut + tx_out.nValue))\n            throw std::runtime_error(std::string(__func__) + \": value out of range\");\n        nValueOut += tx_out.nValue;\n    }\n    assert(MoneyRange(nValueOut));\n    return nValueOut;\n}\n\nunsigned int CTransaction::GetTotalSize() const\n{\n    return ::GetSerializeSize(*this, PROTOCOL_VERSION);\n}\n\nstd::string CTransaction::ToString() const\n{\n    std::string str;\n    str += strprintf(\"CTransaction(hash=%s, ver=%d, vin.size=%u, vout.size=%u, nLockTime=%u)\\n\",\n        GetHash().ToString().substr(0,10),\n        nVersion,\n        vin.size(),\n        vout.size(),\n        nLockTime);\n    for (const auto& tx_in : vin)\n        str += \"    \" + tx_in.ToString() + \"\\n\";\n    for (const auto& tx_in : vin)\n        str += \"    \" + tx_in.scriptWitness.ToString() + \"\\n\";\n    for (const auto& tx_out : vout)\n        str += \"    \" + tx_out.ToString() + \"\\n\";\n    return str;\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 \"qmlproject.h\"\n#include \"qmlprojectfile.h\"\n#include \"qmlprojectmanagerconstants.h\"\n#include \"fileformat\/qmlprojectitem.h\"\n#include \"qmlprojectrunconfiguration.h\"\n#include \"qmlprojectconstants.h\"\n#include \"qmlprojectnodes.h\"\n#include \"qmlprojectmanager.h\"\n\n#include <coreplugin\/icore.h>\n#include <coreplugin\/messagemanager.h>\n#include <coreplugin\/documentmanager.h>\n#include <extensionsystem\/pluginmanager.h>\n#include <qtsupport\/qmldumptool.h>\n#include <qtsupport\/baseqtversion.h>\n#include <qtsupport\/qtversionmanager.h>\n#include <qtsupport\/qtkitinformation.h>\n#include <qmljs\/qmljsmodelmanagerinterface.h>\n#include <qmljstools\/qmljsmodelmanager.h>\n#include <utils\/fileutils.h>\n#include <projectexplorer\/kitinformation.h>\n#include <projectexplorer\/kitmanager.h>\n#include <projectexplorer\/target.h>\n#include <utils\/filesystemwatcher.h>\n\n#include <QTextStream>\n#include <QDeclarativeComponent>\n#include <QDebug>\n\nnamespace QmlProjectManager {\n\nQmlProject::QmlProject(Internal::Manager *manager, const QString &fileName)\n    : m_manager(manager),\n      m_fileName(fileName),\n      m_defaultImport(UnknownImport),\n      m_modelManager(QmlJS::ModelManagerInterface::instance())\n{\n    setProjectContext(Core::Context(QmlProjectManager::Constants::PROJECTCONTEXT));\n    setProjectLanguages(Core::Context(QmlProjectManager::Constants::LANG_QML));\n\n    QFileInfo fileInfo(m_fileName);\n    m_projectName = fileInfo.completeBaseName();\n\n    m_file = new Internal::QmlProjectFile(this, fileName);\n    m_rootNode = new Internal::QmlProjectNode(this, m_file);\n\n    Core::DocumentManager::addDocument(m_file, true);\n\n    m_manager->registerProject(this);\n}\n\nQmlProject::~QmlProject()\n{\n    m_manager->unregisterProject(this);\n\n    Core::DocumentManager::removeDocument(m_file);\n\n    delete m_projectItem.data();\n    delete m_rootNode;\n}\n\nvoid QmlProject::addedTarget(ProjectExplorer::Target *target)\n{\n    connect(target, SIGNAL(addedRunConfiguration(ProjectExplorer::RunConfiguration*)),\n            this, SLOT(addedRunConfiguration(ProjectExplorer::RunConfiguration*)));\n    foreach (ProjectExplorer::RunConfiguration *rc, target->runConfigurations())\n        addedRunConfiguration(rc);\n}\n\nvoid QmlProject::addedRunConfiguration(ProjectExplorer::RunConfiguration *rc)\n{\n    \/\/ The enabled state of qml runconfigurations can only be decided after\n    \/\/ they have been added to a project\n    QmlProjectRunConfiguration *qmlrc = qobject_cast<QmlProjectRunConfiguration *>(rc);\n    if (qmlrc)\n        qmlrc->updateEnabled();\n}\n\nQDir QmlProject::projectDir() const\n{\n    return QFileInfo(document()->fileName()).dir();\n}\n\nQString QmlProject::filesFileName() const\n{ return m_fileName; }\n\nstatic QmlProject::QmlImport detectImport(const QString &qml) {\n    static QRegExp qtQuick1RegExp(QLatin1String(\"import\\\\s+QtQuick\\\\s+1\"));\n    static QRegExp qtQuick2RegExp(QLatin1String(\"import\\\\s+QtQuick\\\\s+2\"));\n\n    if (qml.contains(qtQuick1RegExp))\n        return QmlProject::QtQuick1Import;\n    else if (qml.contains(qtQuick2RegExp))\n        return QmlProject::QtQuick2Import;\n    else\n        return QmlProject::UnknownImport;\n}\n\nvoid QmlProject::parseProject(RefreshOptions options)\n{\n    Core::MessageManager *messageManager = Core::ICore::messageManager();\n    if (options & Files) {\n        if (options & ProjectFile)\n            delete m_projectItem.data();\n        if (!m_projectItem) {\n            Utils::FileReader reader;\n            if (reader.fetch(m_fileName)) {\n                QDeclarativeComponent *component = new QDeclarativeComponent(&m_engine, this);\n                component->setData(reader.data(), QUrl::fromLocalFile(m_fileName));\n                if (component->isReady()\n                    && qobject_cast<QmlProjectItem*>(component->create())) {\n                    m_projectItem = qobject_cast<QmlProjectItem*>(component->create());\n                    connect(m_projectItem.data(), SIGNAL(qmlFilesChanged(QSet<QString>,QSet<QString>)),\n                            this, SLOT(refreshFiles(QSet<QString>,QSet<QString>)));\n                } else {\n                    messageManager->printToOutputPane(tr(\"Error while loading project file %1.\").arg(m_fileName));\n                    messageManager->printToOutputPane(component->errorString(), true);\n                }\n            } else {\n                messageManager->printToOutputPane(tr(\"QML project: %1\").arg(reader.errorString()), true);\n            }\n        }\n        if (m_projectItem) {\n            m_projectItem.data()->setSourceDirectory(projectDir().path());\n            m_modelManager->updateSourceFiles(m_projectItem.data()->files(), true);\n\n            QString mainFilePath = m_projectItem.data()->mainFile();\n            if (!mainFilePath.isEmpty()) {\n                mainFilePath = projectDir().absoluteFilePath(mainFilePath);\n                Utils::FileReader reader;\n                QString errorMessage;\n                if (!reader.fetch(mainFilePath, &errorMessage)) {\n                    messageManager->printToOutputPane(\n                                tr(\"Warning while loading project file %1.\").arg(m_fileName));\n                    messageManager->printToOutputPane(errorMessage, true);\n                } else {\n                    m_defaultImport = detectImport(QString::fromUtf8(reader.data()));\n                }\n            }\n        }\n        m_rootNode->refresh();\n    }\n\n    if (options & Configuration) {\n        \/\/ update configuration\n    }\n\n    if (options & Files)\n        emit fileListChanged();\n}\n\nvoid QmlProject::refresh(RefreshOptions options)\n{\n    parseProject(options);\n\n    if (options & Files)\n        m_rootNode->refresh();\n\n    QmlJS::ModelManagerInterface::ProjectInfo projectInfo =\n            QmlJSTools::defaultProjectInfoForProject(this);\n    projectInfo.importPaths = customImportPaths();\n\n    m_modelManager->updateProjectInfo(projectInfo);\n}\n\nQStringList QmlProject::convertToAbsoluteFiles(const QStringList &paths) const\n{\n    const QDir projectDir(QFileInfo(m_fileName).dir());\n    QStringList absolutePaths;\n    foreach (const QString &file, paths) {\n        QFileInfo fileInfo(projectDir, file);\n        absolutePaths.append(fileInfo.absoluteFilePath());\n    }\n    absolutePaths.removeDuplicates();\n    return absolutePaths;\n}\n\nQStringList QmlProject::files() const\n{\n    QStringList files;\n    if (m_projectItem)\n        files = m_projectItem.data()->files();\n    else\n        files = m_files;\n    return files;\n}\n\nQString QmlProject::mainFile() const\n{\n    if (m_projectItem)\n        return m_projectItem.data()->mainFile();\n    return QString();\n}\n\nbool QmlProject::validProjectFile() const\n{\n    return !m_projectItem.isNull();\n}\n\nQStringList QmlProject::customImportPaths() const\n{\n    QStringList importPaths;\n    if (m_projectItem)\n        importPaths = m_projectItem.data()->importPaths();\n\n    return importPaths;\n}\n\nbool QmlProject::addFiles(const QStringList &filePaths)\n{\n    QStringList toAdd;\n    foreach (const QString &filePath, filePaths) {\n        if (!m_projectItem.data()->matchesFile(filePath))\n            toAdd << filePaths;\n    }\n    return toAdd.isEmpty();\n}\n\nvoid QmlProject::refreshProjectFile()\n{\n    refresh(QmlProject::ProjectFile | Files);\n}\n\nQmlProject::QmlImport QmlProject::defaultImport() const\n{\n    return m_defaultImport;\n}\n\nvoid QmlProject::refreshFiles(const QSet<QString> &\/*added*\/, const QSet<QString> &removed)\n{\n    refresh(Files);\n    if (!removed.isEmpty())\n        m_modelManager->removeFiles(removed.toList());\n}\n\nQString QmlProject::displayName() const\n{\n    return m_projectName;\n}\n\nCore::Id QmlProject::id() const\n{\n    return Core::Id(\"QmlProjectManager.QmlProject\");\n}\n\nCore::IDocument *QmlProject::document() const\n{\n    return m_file;\n}\n\nProjectExplorer::IProjectManager *QmlProject::projectManager() const\n{\n    return m_manager;\n}\n\nbool QmlProject::supportsKit(ProjectExplorer::Kit *k, QString *errorMessage) const\n{\n    Core::Id deviceType = ProjectExplorer::DeviceTypeKitInformation::deviceTypeId(k);\n    if (deviceType != ProjectExplorer::Constants::DESKTOP_DEVICE_TYPE) {\n        if (errorMessage)\n            *errorMessage = tr(\"Device type is not desktop.\");\n        return false;\n    }\n\n    QtSupport::BaseQtVersion *version = QtSupport::QtKitInformation::qtVersion(k);\n    if (!version) {\n        if (errorMessage)\n            *errorMessage = tr(\"No Qt version set in kit.\");\n        return false;\n    }\n\n    if (version->qtVersion() < QtSupport::QtVersionNumber(4, 7, 0)) {\n        if (errorMessage)\n            *errorMessage = tr(\"Qt version is too old.\");\n        return false;\n    }\n\n    if (version->qtVersion() < QtSupport::QtVersionNumber(5, 0, 0)\n            && defaultImport() == QtQuick2Import) {\n        if (errorMessage)\n            *errorMessage = tr(\"Qt version is too old.\");\n        return false;\n    }\n    return true;\n}\n\nProjectExplorer::ProjectNode *QmlProject::rootProjectNode() const\n{\n    return m_rootNode;\n}\n\nQStringList QmlProject::files(FilesMode) const\n{\n    return files();\n}\n\nbool QmlProject::fromMap(const QVariantMap &map)\n{\n    if (!Project::fromMap(map))\n        return false;\n\n    \/\/ refresh first - project information is used e.g. to decide the default RC's\n    refresh(Everything);\n\n    ProjectExplorer::Kit *defaultKit = ProjectExplorer::KitManager::instance()->defaultKit();\n    if (!activeTarget() && defaultKit)\n        addTarget(createTarget(defaultKit));\n\n    \/\/ addedTarget calls updateEnabled on the runconfigurations\n    \/\/ which needs to happen after refresh\n    foreach (ProjectExplorer::Target *t, targets())\n        addedTarget(t);\n\n    connect(this, SIGNAL(addedTarget(ProjectExplorer::Target*)),\n            this, SLOT(addedTarget(ProjectExplorer::Target*)));\n\n    return true;\n}\n\n} \/\/ namespace QmlProjectManager\n\n<commit_msg>QmlProject: Select matching kit when loading .qmlproject file<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 \"qmlproject.h\"\n#include \"qmlprojectfile.h\"\n#include \"qmlprojectmanagerconstants.h\"\n#include \"fileformat\/qmlprojectitem.h\"\n#include \"qmlprojectrunconfiguration.h\"\n#include \"qmlprojectconstants.h\"\n#include \"qmlprojectnodes.h\"\n#include \"qmlprojectmanager.h\"\n\n#include <coreplugin\/icore.h>\n#include <coreplugin\/messagemanager.h>\n#include <coreplugin\/documentmanager.h>\n#include <extensionsystem\/pluginmanager.h>\n#include <qtsupport\/qmldumptool.h>\n#include <qtsupport\/baseqtversion.h>\n#include <qtsupport\/qtversionmanager.h>\n#include <qtsupport\/qtkitinformation.h>\n#include <qmljs\/qmljsmodelmanagerinterface.h>\n#include <qmljstools\/qmljsmodelmanager.h>\n#include <utils\/fileutils.h>\n#include <projectexplorer\/kitinformation.h>\n#include <projectexplorer\/kitmanager.h>\n#include <projectexplorer\/target.h>\n#include <utils\/filesystemwatcher.h>\n#include <qtsupport\/qtsupportconstants.h>\n\n#include <QTextStream>\n#include <QDeclarativeComponent>\n#include <QDebug>\n\nnamespace QmlProjectManager {\n\nnamespace Internal {\n\nclass QmlProjectKitMatcher : public ProjectExplorer::KitMatcher\n{\npublic:\n    QmlProjectKitMatcher(const QmlProject::QmlImport &import)\n        : import(import)\n    {\n    }\n\n    bool matches(const ProjectExplorer::Kit *k) const\n    {\n        if (!k->isValid())\n            return false;\n\n        ProjectExplorer::IDevice::ConstPtr dev = ProjectExplorer::DeviceKitInformation::device(k);\n        if (dev.isNull() || dev->type() != ProjectExplorer::Constants::DESKTOP_DEVICE_TYPE)\n            return false;\n        QtSupport::BaseQtVersion *version = QtSupport::QtKitInformation::qtVersion(k);\n        if (!version || version->type() != QLatin1String(QtSupport::Constants::DESKTOPQT))\n            return false;\n\n        bool hasViewer;\n        QtSupport::QtVersionNumber minVersion;\n        switch (import) {\n        case QmlProject::UnknownImport:\n            minVersion = QtSupport::QtVersionNumber(4, 7, 0);\n            hasViewer = !version->qmlviewerCommand().isEmpty() || !version->qmlsceneCommand().isEmpty();\n            break;\n        case QmlProject::QtQuick1Import:\n            minVersion = QtSupport::QtVersionNumber(4, 7, 1);\n            hasViewer = !version->qmlviewerCommand().isEmpty();\n            break;\n        case QmlProject::QtQuick2Import:\n            minVersion = QtSupport::QtVersionNumber(5, 0, 0);\n            hasViewer = !version->qmlsceneCommand().isEmpty();\n            break;\n        }\n\n        if (version->qtVersion() >= minVersion\n                && hasViewer)\n            return true;\n\n        return false;\n    }\nprivate:\n    QmlProject::QmlImport import;\n};\n\n} \/\/ namespace Internal\n\nQmlProject::QmlProject(Internal::Manager *manager, const QString &fileName)\n    : m_manager(manager),\n      m_fileName(fileName),\n      m_defaultImport(UnknownImport),\n      m_modelManager(QmlJS::ModelManagerInterface::instance())\n{\n    setProjectContext(Core::Context(QmlProjectManager::Constants::PROJECTCONTEXT));\n    setProjectLanguages(Core::Context(QmlProjectManager::Constants::LANG_QML));\n\n    QFileInfo fileInfo(m_fileName);\n    m_projectName = fileInfo.completeBaseName();\n\n    m_file = new Internal::QmlProjectFile(this, fileName);\n    m_rootNode = new Internal::QmlProjectNode(this, m_file);\n\n    Core::DocumentManager::addDocument(m_file, true);\n\n    m_manager->registerProject(this);\n}\n\nQmlProject::~QmlProject()\n{\n    m_manager->unregisterProject(this);\n\n    Core::DocumentManager::removeDocument(m_file);\n\n    delete m_projectItem.data();\n    delete m_rootNode;\n}\n\nvoid QmlProject::addedTarget(ProjectExplorer::Target *target)\n{\n    connect(target, SIGNAL(addedRunConfiguration(ProjectExplorer::RunConfiguration*)),\n            this, SLOT(addedRunConfiguration(ProjectExplorer::RunConfiguration*)));\n    foreach (ProjectExplorer::RunConfiguration *rc, target->runConfigurations())\n        addedRunConfiguration(rc);\n}\n\nvoid QmlProject::addedRunConfiguration(ProjectExplorer::RunConfiguration *rc)\n{\n    \/\/ The enabled state of qml runconfigurations can only be decided after\n    \/\/ they have been added to a project\n    QmlProjectRunConfiguration *qmlrc = qobject_cast<QmlProjectRunConfiguration *>(rc);\n    if (qmlrc)\n        qmlrc->updateEnabled();\n}\n\nQDir QmlProject::projectDir() const\n{\n    return QFileInfo(document()->fileName()).dir();\n}\n\nQString QmlProject::filesFileName() const\n{ return m_fileName; }\n\nstatic QmlProject::QmlImport detectImport(const QString &qml) {\n    static QRegExp qtQuick1RegExp(QLatin1String(\"import\\\\s+QtQuick\\\\s+1\"));\n    static QRegExp qtQuick2RegExp(QLatin1String(\"import\\\\s+QtQuick\\\\s+2\"));\n\n    if (qml.contains(qtQuick1RegExp))\n        return QmlProject::QtQuick1Import;\n    else if (qml.contains(qtQuick2RegExp))\n        return QmlProject::QtQuick2Import;\n    else\n        return QmlProject::UnknownImport;\n}\n\nvoid QmlProject::parseProject(RefreshOptions options)\n{\n    Core::MessageManager *messageManager = Core::ICore::messageManager();\n    if (options & Files) {\n        if (options & ProjectFile)\n            delete m_projectItem.data();\n        if (!m_projectItem) {\n            Utils::FileReader reader;\n            if (reader.fetch(m_fileName)) {\n                QDeclarativeComponent *component = new QDeclarativeComponent(&m_engine, this);\n                component->setData(reader.data(), QUrl::fromLocalFile(m_fileName));\n                if (component->isReady()\n                    && qobject_cast<QmlProjectItem*>(component->create())) {\n                    m_projectItem = qobject_cast<QmlProjectItem*>(component->create());\n                    connect(m_projectItem.data(), SIGNAL(qmlFilesChanged(QSet<QString>,QSet<QString>)),\n                            this, SLOT(refreshFiles(QSet<QString>,QSet<QString>)));\n                } else {\n                    messageManager->printToOutputPane(tr(\"Error while loading project file %1.\").arg(m_fileName));\n                    messageManager->printToOutputPane(component->errorString(), true);\n                }\n            } else {\n                messageManager->printToOutputPane(tr(\"QML project: %1\").arg(reader.errorString()), true);\n            }\n        }\n        if (m_projectItem) {\n            m_projectItem.data()->setSourceDirectory(projectDir().path());\n            m_modelManager->updateSourceFiles(m_projectItem.data()->files(), true);\n\n            QString mainFilePath = m_projectItem.data()->mainFile();\n            if (!mainFilePath.isEmpty()) {\n                mainFilePath = projectDir().absoluteFilePath(mainFilePath);\n                Utils::FileReader reader;\n                QString errorMessage;\n                if (!reader.fetch(mainFilePath, &errorMessage)) {\n                    messageManager->printToOutputPane(\n                                tr(\"Warning while loading project file %1.\").arg(m_fileName));\n                    messageManager->printToOutputPane(errorMessage, true);\n                } else {\n                    m_defaultImport = detectImport(QString::fromUtf8(reader.data()));\n                }\n            }\n        }\n        m_rootNode->refresh();\n    }\n\n    if (options & Configuration) {\n        \/\/ update configuration\n    }\n\n    if (options & Files)\n        emit fileListChanged();\n}\n\nvoid QmlProject::refresh(RefreshOptions options)\n{\n    parseProject(options);\n\n    if (options & Files)\n        m_rootNode->refresh();\n\n    QmlJS::ModelManagerInterface::ProjectInfo projectInfo =\n            QmlJSTools::defaultProjectInfoForProject(this);\n    projectInfo.importPaths = customImportPaths();\n\n    m_modelManager->updateProjectInfo(projectInfo);\n}\n\nQStringList QmlProject::convertToAbsoluteFiles(const QStringList &paths) const\n{\n    const QDir projectDir(QFileInfo(m_fileName).dir());\n    QStringList absolutePaths;\n    foreach (const QString &file, paths) {\n        QFileInfo fileInfo(projectDir, file);\n        absolutePaths.append(fileInfo.absoluteFilePath());\n    }\n    absolutePaths.removeDuplicates();\n    return absolutePaths;\n}\n\nQStringList QmlProject::files() const\n{\n    QStringList files;\n    if (m_projectItem)\n        files = m_projectItem.data()->files();\n    else\n        files = m_files;\n    return files;\n}\n\nQString QmlProject::mainFile() const\n{\n    if (m_projectItem)\n        return m_projectItem.data()->mainFile();\n    return QString();\n}\n\nbool QmlProject::validProjectFile() const\n{\n    return !m_projectItem.isNull();\n}\n\nQStringList QmlProject::customImportPaths() const\n{\n    QStringList importPaths;\n    if (m_projectItem)\n        importPaths = m_projectItem.data()->importPaths();\n\n    return importPaths;\n}\n\nbool QmlProject::addFiles(const QStringList &filePaths)\n{\n    QStringList toAdd;\n    foreach (const QString &filePath, filePaths) {\n        if (!m_projectItem.data()->matchesFile(filePath))\n            toAdd << filePaths;\n    }\n    return toAdd.isEmpty();\n}\n\nvoid QmlProject::refreshProjectFile()\n{\n    refresh(QmlProject::ProjectFile | Files);\n}\n\nQmlProject::QmlImport QmlProject::defaultImport() const\n{\n    return m_defaultImport;\n}\n\nvoid QmlProject::refreshFiles(const QSet<QString> &\/*added*\/, const QSet<QString> &removed)\n{\n    refresh(Files);\n    if (!removed.isEmpty())\n        m_modelManager->removeFiles(removed.toList());\n}\n\nQString QmlProject::displayName() const\n{\n    return m_projectName;\n}\n\nCore::Id QmlProject::id() const\n{\n    return Core::Id(\"QmlProjectManager.QmlProject\");\n}\n\nCore::IDocument *QmlProject::document() const\n{\n    return m_file;\n}\n\nProjectExplorer::IProjectManager *QmlProject::projectManager() const\n{\n    return m_manager;\n}\n\nbool QmlProject::supportsKit(ProjectExplorer::Kit *k, QString *errorMessage) const\n{\n    Core::Id deviceType = ProjectExplorer::DeviceTypeKitInformation::deviceTypeId(k);\n    if (deviceType != ProjectExplorer::Constants::DESKTOP_DEVICE_TYPE) {\n        if (errorMessage)\n            *errorMessage = tr(\"Device type is not desktop.\");\n        return false;\n    }\n\n    QtSupport::BaseQtVersion *version = QtSupport::QtKitInformation::qtVersion(k);\n    if (!version) {\n        if (errorMessage)\n            *errorMessage = tr(\"No Qt version set in kit.\");\n        return false;\n    }\n\n    if (version->qtVersion() < QtSupport::QtVersionNumber(4, 7, 0)) {\n        if (errorMessage)\n            *errorMessage = tr(\"Qt version is too old.\");\n        return false;\n    }\n\n    if (version->qtVersion() < QtSupport::QtVersionNumber(5, 0, 0)\n            && defaultImport() == QtQuick2Import) {\n        if (errorMessage)\n            *errorMessage = tr(\"Qt version is too old.\");\n        return false;\n    }\n    return true;\n}\n\nProjectExplorer::ProjectNode *QmlProject::rootProjectNode() const\n{\n    return m_rootNode;\n}\n\nQStringList QmlProject::files(FilesMode) const\n{\n    return files();\n}\n\nbool QmlProject::fromMap(const QVariantMap &map)\n{\n    if (!Project::fromMap(map))\n        return false;\n\n    \/\/ refresh first - project information is used e.g. to decide the default RC's\n    refresh(Everything);\n\n    if (!activeTarget()) {\n        \/\/ find a kit that matches prerequisites (prefer default one)\n        Internal::QmlProjectKitMatcher matcher(defaultImport());\n        ProjectExplorer::KitManager *kitManager = ProjectExplorer::KitManager::instance();\n        QList<ProjectExplorer::Kit*> kits = kitManager->kits(&matcher);\n\n        if (!kits.isEmpty()) {\n            ProjectExplorer::Kit *kit = 0;\n            if (kits.contains(kitManager->defaultKit())) {\n                kit = kitManager->defaultKit();\n            } else {\n                kit = kits.first();\n            }\n            addTarget(createTarget(kit));\n        }\n    }\n\n    \/\/ addedTarget calls updateEnabled on the runconfigurations\n    \/\/ which needs to happen after refresh\n    foreach (ProjectExplorer::Target *t, targets())\n        addedTarget(t);\n\n    connect(this, SIGNAL(addedTarget(ProjectExplorer::Target*)),\n            this, SLOT(addedTarget(ProjectExplorer::Target*)));\n\n    return true;\n}\n\n} \/\/ namespace QmlProjectManager\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef MJOLNIR_UTIL_RANGE_HPP\n#define MJOLNIR_UTIL_RANGE_HPP\n#include <iterator>\n\nnamespace mjolnir\n{\n\ntemplate<typename Iterator>\nstruct range\n{\n    using iterator         = Iterator;\n    using reverse_iterator = std::reverse_iterator<iterator>;\n    using value_type       = typename std::iterator_traits<iterator>::value_type;\n    using reference        = typename std::iterator_traits<iterator>::reference;\n\n    static_assert(std::is_same<std::random_access_iterator_tag,\n        typename std::iterator_traits<iterator>::iterator_category\n        >::value, \"mjolnir::range assumes iterator to be randomly accessible\");\n\n    range(iterator b, iterator e) noexcept\n        : begin_(b), end_(e), sz_(std::distance(b, e))\n    {}\n\n    range() noexcept : sz_(0){}\n    ~range() = default;\n    range(const range&) = default;\n    range(range&&)      = default;\n    range& operator=(const range&) = default;\n    range& operator=(range&&)      = default;\n\n    iterator begin() const noexcept {return begin_;}\n    iterator end()   const noexcept {return end_;}\n    reverse_iterator rbegin() const noexcept {return reverse_iterator(begin_);}\n    reverse_iterator rend()   const noexcept {return reverse_iterator(end_);}\n\n    std::size_t size() const noexcept {return sz_;}\n\n    iterator begin_;\n    iterator end_;\n    std::size_t sz_;\n};\n\ntemplate<typename Iterator>\ninline range<Iterator> make_range(Iterator b, Iterator e)\n{\n    return range<Iterator>(b, e);\n}\n\n} \/\/ mjolnir\n#endif\/\/ MJOLNIR_UTIL_RANGE_HPP\n<commit_msg>feat: add random-access operator to range<commit_after>#ifndef MJOLNIR_UTIL_RANGE_HPP\n#define MJOLNIR_UTIL_RANGE_HPP\n#include <mjolnir\/util\/throw_exception.hpp>\n#include <iterator>\n\nnamespace mjolnir\n{\n\ntemplate<typename Iterator>\nstruct range\n{\n    using iterator         = Iterator;\n    using reverse_iterator = std::reverse_iterator<iterator>;\n    using value_type       = typename std::iterator_traits<iterator>::value_type;\n    using reference        = typename std::iterator_traits<iterator>::reference;\n\n    static_assert(std::is_same<std::random_access_iterator_tag,\n        typename std::iterator_traits<iterator>::iterator_category\n        >::value, \"mjolnir::range assumes iterator to be randomly accessible\");\n\n    range(iterator b, iterator e) noexcept\n        : begin_(b), end_(e), sz_(std::distance(b, e))\n    {}\n\n    range() noexcept : sz_(0){}\n    ~range() = default;\n    range(const range&) = default;\n    range(range&&)      = default;\n    range& operator=(const range&) = default;\n    range& operator=(range&&)      = default;\n\n    iterator begin() const noexcept {return begin_;}\n    iterator end()   const noexcept {return end_;}\n    reverse_iterator rbegin() const noexcept {return reverse_iterator(begin_);}\n    reverse_iterator rend()   const noexcept {return reverse_iterator(end_);}\n\n    reference operator[](const std::size_t i) const noexcept\n    {\n        return *(this->begin_ + i);\n    }\n    reference at(const std::size_t i) const noexcept\n    {\n        if(i >= sz_)\n        {\n            throw_exception<std::out_of_range>(\"mjolnir::range::at(i = \", i,\n                    \"), index out of range (this->size() = \", this->sz_, \")\");\n        }\n        return *(this->begin_ + i);\n    }\n\n    std::size_t size() const noexcept {return sz_;}\n\n    iterator begin_;\n    iterator end_;\n    std::size_t sz_;\n};\n\ntemplate<typename Iterator>\ninline range<Iterator> make_range(Iterator b, Iterator e)\n{\n    return range<Iterator>(b, e);\n}\n\n} \/\/ mjolnir\n#endif\/\/ MJOLNIR_UTIL_RANGE_HPP\n<|endoftext|>"}
{"text":"<commit_before>#include <string>\n#include <iostream>\n#include <sstream>\n#include <cassert>\n\n#include <QString>\n#include <QVBoxLayout>\n#include <QHBoxLayout>\n#include <QPushButton>\n#include <QLabel>\n#include <QPixmap>\n\n#include \"wifi.hpp\"\n#include \"settings.hpp\"\n#include \"widgets\/toggle.hpp\"\n#include \"widgets\/offroad_alerts.hpp\"\n\n#include \"common\/params.h\"\n#include \"common\/util.h\"\n\nQFrame* horizontal_line(QWidget* parent = 0){\n  QFrame* line = new QFrame(parent);\n  line->setFrameShape(QFrame::StyledPanel);\n  line->setStyleSheet(\"margin-left: 40px; margin-right: 40px; border-width: 1px; border-bottom-style: solid; border-color: gray;\");\n  line->setFixedHeight(2);\n  return line;\n}\nQWidget* labelWidget(QString labelName, QString labelContent){\n  QHBoxLayout* labelLayout = new QHBoxLayout;\n  labelLayout->addWidget(new QLabel(labelName), 0, Qt::AlignLeft);\n  QLabel* paramContent = new QLabel(labelContent);\n  paramContent->setStyleSheet(\"color: #aaaaaa\");\n  labelLayout->addWidget(paramContent, 0, Qt::AlignRight);\n  QWidget* labelWidget = new QWidget;\n  labelWidget->setLayout(labelLayout);\n  return labelWidget;\n}\n\nParamsToggle::ParamsToggle(QString param, QString title, QString description, QString icon_path, QWidget *parent): QFrame(parent) , param(param) {\n  QHBoxLayout *layout = new QHBoxLayout;\n  layout->setSpacing(50);\n\n  \/\/ Parameter image\n  if (icon_path.length()) {\n    QPixmap pix(icon_path);\n    QLabel *icon = new QLabel();\n    icon->setPixmap(pix.scaledToWidth(80, Qt::SmoothTransformation));\n    icon->setSizePolicy(QSizePolicy(QSizePolicy::Fixed, QSizePolicy::Fixed));\n    layout->addWidget(icon);\n  } else {\n    layout->addSpacing(80);\n  }\n\n  \/\/ Name of the parameter\n  QLabel *label = new QLabel(title);\n  label->setStyleSheet(R\"(font-size: 50px;)\");\n  layout->addWidget(label);\n\n  \/\/ toggle switch\n  Toggle *toggle = new Toggle(this);\n  toggle->setFixedSize(150, 100);\n  layout->addWidget(toggle);\n  QObject::connect(toggle, SIGNAL(stateChanged(int)), this, SLOT(checkboxClicked(int)));\n\n  \/\/ set initial state from param\n  if (Params().read_db_bool(param.toStdString().c_str())) {\n    toggle->togglePosition();\n  }\n\n  setLayout(layout);\n}\n\nvoid ParamsToggle::checkboxClicked(int state) {\n  char value = state ? '1': '0';\n  Params().write_db_value(param.toStdString().c_str(), &value, 1);\n}\n\nQWidget * toggles_panel() {\n  QVBoxLayout *toggles_list = new QVBoxLayout();\n  toggles_list->setMargin(50);\n\n  toggles_list->addWidget(new ParamsToggle(\"OpenpilotEnabledToggle\",\n                                            \"Enable openpilot\",\n                                            \"Use the openpilot system for adaptive cruise control and lane keep driver assistance. Your attention is required at all times to use this feature. Changing this setting takes effect when the car is powered off.\",\n                                            \"..\/assets\/offroad\/icon_openpilot.png\"\n                                              ));\n  toggles_list->addWidget(horizontal_line());\n  toggles_list->addWidget(new ParamsToggle(\"LaneChangeEnabled\",\n                                            \"Enable Lane Change Assist\",\n                                            \"Perform assisted lane changes with openpilot by checking your surroundings for safety, activating the turn signal and gently nudging the steering wheel towards your desired lane. openpilot is not capable of checking if a lane change is safe. You must continuously observe your surroundings to use this feature.\",\n                                            \"..\/assets\/offroad\/icon_road.png\"\n                                              ));\n  toggles_list->addWidget(horizontal_line());\n  toggles_list->addWidget(new ParamsToggle(\"IsLdwEnabled\",\n                                            \"Enable Lane Departure Warnings\",\n                                            \"Receive alerts to steer back into the lane when your vehicle drifts over a detected lane line without a turn signal activated while driving over 31mph (50kph).\",\n                                            \"..\/assets\/offroad\/icon_warning.png\"\n                                              ));\n  toggles_list->addWidget(horizontal_line());\n  toggles_list->addWidget(new ParamsToggle(\"RecordFront\",\n                                            \"Record and Upload Driver Camera\",\n                                            \"Upload data from the driver facing camera and help improve the driver monitoring algorithm.\",\n                                            \"..\/assets\/offroad\/icon_network.png\"\n                                            ));\n  toggles_list->addWidget(horizontal_line());\n  toggles_list->addWidget(new ParamsToggle(\"IsRHD\",\n                                            \"Enable Right-Hand Drive\",\n                                            \"Allow openpilot to obey left-hand traffic conventions and perform driver monitoring on right driver seat.\",\n                                            \"..\/assets\/offroad\/icon_openpilot_mirrored.png\"\n                                            ));\n  toggles_list->addWidget(horizontal_line());\n  toggles_list->addWidget(new ParamsToggle(\"IsMetric\",\n                                            \"Use Metric System\",\n                                            \"Display speed in km\/h instead of mp\/h.\",\n                                            \"..\/assets\/offroad\/icon_metric.png\"\n                                            ));\n  toggles_list->addWidget(horizontal_line());\n  toggles_list->addWidget(new ParamsToggle(\"CommunityFeaturesToggle\",\n                                            \"Enable Community Features\",\n                                            \"Use features from the open source community that are not maintained or supported by comma.ai and have not been confirmed to meet the standard safety model. These features include community supported cars and community supported hardware. Be extra cautious when using these features\",\n                                            \"..\/assets\/offroad\/icon_shell.png\"\n                                            ));\n\n  QWidget *widget = new QWidget;\n  widget->setLayout(toggles_list);\n  return widget;\n}\n\nQWidget * device_panel() {\n\n  QVBoxLayout *device_layout = new QVBoxLayout;\n  device_layout->setMargin(100);\n  device_layout->setSpacing(30);\n\n  Params params = Params();\n  std::vector<std::pair<std::string, std::string>> labels = {\n    {\"Dongle ID\", params.get(\"DongleId\", false)},\n  };\n\n  \/\/ get serial number\n  \/\/std::string cmdline = util::read_file(\"\/proc\/cmdline\");\n  \/\/auto delim = cmdline.find(\"serialno=\");\n  \/\/if (delim != std::string::npos) {\n  \/\/  labels.push_back({\"Serial\", cmdline.substr(delim, cmdline.find(\" \", delim))});\n  \/\/}\n\n  for (auto &l : labels) {\n    device_layout->addWidget(labelWidget(QString::fromStdString(l.first+\":\"), QString::fromStdString(l.second)), 0, Qt::AlignTop);\n  }\n\n  \/\/ TODO: show current calibration values\n  QPushButton *clear_cal_btn = new QPushButton(\"Reset Calibration\");\n  device_layout->addWidget(clear_cal_btn, 0, Qt::AlignBottom);\n  device_layout->addWidget(horizontal_line(), Qt::AlignBottom);\n  QObject::connect(clear_cal_btn, &QPushButton::released, [=]() {\n    Params().delete_db_value(\"CalibrationParams\");\n  });\n\n  QPushButton *poweroff_btn = new QPushButton(\"Power Off\");\n  device_layout->addWidget(poweroff_btn, Qt::AlignBottom);\n  device_layout->addWidget(horizontal_line(), Qt::AlignBottom);\n  QPushButton *reboot_btn = new QPushButton(\"Reboot\");\n  device_layout->addWidget(reboot_btn, Qt::AlignBottom);\n  device_layout->addWidget(horizontal_line(), Qt::AlignBottom);\n#ifdef __aarch64__\n  QObject::connect(poweroff_btn, &QPushButton::released, [=]() { std::system(\"sudo poweroff\"); });\n  QObject::connect(reboot_btn, &QPushButton::released, [=]() { std::system(\"sudo reboot\"); });\n#endif\n\n  \/\/ TODO: add confirmation dialog\n  QPushButton *uninstall_btn = new QPushButton(\"Uninstall openpilot\");\n  device_layout->addWidget(uninstall_btn);\n  QObject::connect(uninstall_btn, &QPushButton::released, [=]() { Params().write_db_value(\"DoUninstall\", \"1\"); });\n\n  QWidget *widget = new QWidget;\n  widget->setLayout(device_layout);\n  widget->setStyleSheet(R\"(\n    QPushButton {\n      padding: 0;\n      height: 120px;\n      border-radius: 15px;\n      background-color: #393939;\n    }\n  )\");\n  return widget;\n}\n\nQWidget * developer_panel() {\n  QVBoxLayout *main_layout = new QVBoxLayout;\n  main_layout->setMargin(100);\n\n  \/\/ TODO: enable SSH toggle and github keys\n\n  Params params = Params();\n  std::string brand = params.read_db_bool(\"Passive\") ? \"dashcam\" : \"openpilot\";\n  std::vector<std::pair<std::string, std::string>> labels = {\n    {\"Version\", brand + \" v\" + params.get(\"Version\", false)},\n    {\"Git Branch\", params.get(\"GitBranch\", false)},\n    {\"Git Commit\", params.get(\"GitCommit\", false).substr(0, 10)},\n    {\"Panda Firmware\", params.get(\"PandaFirmwareHex\", false)},\n  };\n\n  std::string os_version = util::read_file(\"\/VERSION\");\n  if (os_version.size()) {\n    labels.push_back({\"OS Version\", \"AGNOS \" + os_version});\n  }\n\n  for (int i = 0; i<labels.size(); i++) {\n    auto l = labels[i];\n    main_layout->addWidget(labelWidget(QString::fromStdString(l.first+\":\"), QString::fromStdString(l.second)));\n\n    if(i+1<labels.size()) {\n      main_layout->addWidget(horizontal_line());\n    }\n  }\n\n  QWidget *widget = new QWidget;\n  widget->setLayout(main_layout);\n  widget->setStyleSheet(R\"(\n    QLabel {\n      font-size: 50px;\n    }\n  )\");\n  return widget;\n}\n\nQWidget * network_panel(QWidget * parent) {\n  Networking *w = new Networking(parent);\n  QObject::connect(parent, SIGNAL(sidebarPressed()), w, SLOT(sidebarChange()));\n  QObject::connect(w, SIGNAL(openKeyboard()), parent, SLOT(closeSidebar()));\n  QObject::connect(w, SIGNAL(closeKeyboard()), parent, SLOT(openSidebar()));\n  return w;\n}\n\n\nvoid SettingsWindow::setActivePanel() {\n  auto *btn = qobject_cast<QPushButton *>(nav_btns->checkedButton());\n  panel_layout->setCurrentWidget(panels[btn->text()]);\n}\n\nSettingsWindow::SettingsWindow(QWidget *parent) : QFrame(parent) {\n  \/\/ setup two main layouts\n  QVBoxLayout *sidebar_layout = new QVBoxLayout();\n  sidebar_layout->setMargin(0);\n  panel_layout = new QStackedLayout();\n\n  \/\/ close button\n  QPushButton *close_btn = new QPushButton(\"X\");\n  close_btn->setStyleSheet(R\"(\n    font-size: 90px;\n    font-weight: bold;\n    border 1px grey solid;\n    border-radius: 100px;\n    background-color: #292929;\n  )\");\n  close_btn->setFixedSize(200, 200);\n  sidebar_layout->addSpacing(45);\n  sidebar_layout->addWidget(close_btn, 0, Qt::AlignCenter);\n  QObject::connect(close_btn, SIGNAL(released()), this, SIGNAL(closeSettings()));\n\n  \/\/ setup panels\n  panels = {\n    {\"Developer\", developer_panel()},\n    {\"Device\", device_panel()},\n    {\"Network\", network_panel(this)},\n    {\"Toggles\", toggles_panel()},\n  };\n\n  sidebar_layout->addSpacing(45);\n  nav_btns = new QButtonGroup();\n  for (auto &panel : panels) {\n    QPushButton *btn = new QPushButton(panel.first);\n    btn->setCheckable(true);\n    btn->setStyleSheet(R\"(\n      QPushButton {\n        color: grey;\n        border: none;\n        background: none;\n        font-size: 65px;\n        font-weight: bold;\n        padding-top: 35px;\n        padding-bottom: 35px;\n      }\n      QPushButton:checked {\n        color: white;\n      }\n    )\");\n\n    nav_btns->addButton(btn);\n    sidebar_layout->addWidget(btn, 0, Qt::AlignRight);\n    panel_layout->addWidget(panel.second);\n    QObject::connect(btn, SIGNAL(released()), this, SLOT(setActivePanel()));\n    QObject::connect(btn, &QPushButton::released, [=](){emit sidebarPressed();});\n  }\n  qobject_cast<QPushButton *>(nav_btns->buttons()[0])->setChecked(true);\n  sidebar_layout->setContentsMargins(50, 50, 100, 50);\n\n  \/\/ main settings layout, sidebar + main panel\n  QHBoxLayout *settings_layout = new QHBoxLayout();\n\n  sidebar_widget = new QWidget;\n  sidebar_widget->setLayout(sidebar_layout);\n  sidebar_widget->setFixedWidth(500);\n  settings_layout->addWidget(sidebar_widget);\n\n\n  panel_frame = new QFrame;\n  panel_frame->setLayout(panel_layout);\n  panel_frame->setStyleSheet(R\"(\n    QFrame {\n      border-radius: 30px;\n      background-color: #292929;\n    }\n    * {\n      background-color: none;\n    }\n  )\");\n  settings_layout->addWidget(panel_frame);\n\n  setLayout(settings_layout);\n  setStyleSheet(R\"(\n    * {\n      color: white;\n      font-size: 50px;\n    }\n    SettingsWindow {\n      background-color: black;\n    }\n  )\");\n}\n\nvoid SettingsWindow::closeSidebar() {\n  sidebar_widget->setFixedWidth(0);\n}\n\nvoid SettingsWindow::openSidebar() {\n  sidebar_widget->setFixedWidth(500);\n}\n<commit_msg>qt ui: remove line between poweroff\/reboot<commit_after>#include <string>\n#include <iostream>\n#include <sstream>\n#include <cassert>\n\n#include <QString>\n#include <QVBoxLayout>\n#include <QHBoxLayout>\n#include <QPushButton>\n#include <QLabel>\n#include <QPixmap>\n\n#include \"wifi.hpp\"\n#include \"settings.hpp\"\n#include \"widgets\/toggle.hpp\"\n#include \"widgets\/offroad_alerts.hpp\"\n\n#include \"common\/params.h\"\n#include \"common\/util.h\"\n\nQFrame* horizontal_line(QWidget* parent = 0){\n  QFrame* line = new QFrame(parent);\n  line->setFrameShape(QFrame::StyledPanel);\n  line->setStyleSheet(\"margin-left: 40px; margin-right: 40px; border-width: 1px; border-bottom-style: solid; border-color: gray;\");\n  line->setFixedHeight(2);\n  return line;\n}\nQWidget* labelWidget(QString labelName, QString labelContent){\n  QHBoxLayout* labelLayout = new QHBoxLayout;\n  labelLayout->addWidget(new QLabel(labelName), 0, Qt::AlignLeft);\n  QLabel* paramContent = new QLabel(labelContent);\n  paramContent->setStyleSheet(\"color: #aaaaaa\");\n  labelLayout->addWidget(paramContent, 0, Qt::AlignRight);\n  QWidget* labelWidget = new QWidget;\n  labelWidget->setLayout(labelLayout);\n  return labelWidget;\n}\n\nParamsToggle::ParamsToggle(QString param, QString title, QString description, QString icon_path, QWidget *parent): QFrame(parent) , param(param) {\n  QHBoxLayout *layout = new QHBoxLayout;\n  layout->setSpacing(50);\n\n  \/\/ Parameter image\n  if (icon_path.length()) {\n    QPixmap pix(icon_path);\n    QLabel *icon = new QLabel();\n    icon->setPixmap(pix.scaledToWidth(80, Qt::SmoothTransformation));\n    icon->setSizePolicy(QSizePolicy(QSizePolicy::Fixed, QSizePolicy::Fixed));\n    layout->addWidget(icon);\n  } else {\n    layout->addSpacing(80);\n  }\n\n  \/\/ Name of the parameter\n  QLabel *label = new QLabel(title);\n  label->setStyleSheet(R\"(font-size: 50px;)\");\n  layout->addWidget(label);\n\n  \/\/ toggle switch\n  Toggle *toggle = new Toggle(this);\n  toggle->setFixedSize(150, 100);\n  layout->addWidget(toggle);\n  QObject::connect(toggle, SIGNAL(stateChanged(int)), this, SLOT(checkboxClicked(int)));\n\n  \/\/ set initial state from param\n  if (Params().read_db_bool(param.toStdString().c_str())) {\n    toggle->togglePosition();\n  }\n\n  setLayout(layout);\n}\n\nvoid ParamsToggle::checkboxClicked(int state) {\n  char value = state ? '1': '0';\n  Params().write_db_value(param.toStdString().c_str(), &value, 1);\n}\n\nQWidget * toggles_panel() {\n  QVBoxLayout *toggles_list = new QVBoxLayout();\n  toggles_list->setMargin(50);\n\n  toggles_list->addWidget(new ParamsToggle(\"OpenpilotEnabledToggle\",\n                                            \"Enable openpilot\",\n                                            \"Use the openpilot system for adaptive cruise control and lane keep driver assistance. Your attention is required at all times to use this feature. Changing this setting takes effect when the car is powered off.\",\n                                            \"..\/assets\/offroad\/icon_openpilot.png\"\n                                              ));\n  toggles_list->addWidget(horizontal_line());\n  toggles_list->addWidget(new ParamsToggle(\"LaneChangeEnabled\",\n                                            \"Enable Lane Change Assist\",\n                                            \"Perform assisted lane changes with openpilot by checking your surroundings for safety, activating the turn signal and gently nudging the steering wheel towards your desired lane. openpilot is not capable of checking if a lane change is safe. You must continuously observe your surroundings to use this feature.\",\n                                            \"..\/assets\/offroad\/icon_road.png\"\n                                              ));\n  toggles_list->addWidget(horizontal_line());\n  toggles_list->addWidget(new ParamsToggle(\"IsLdwEnabled\",\n                                            \"Enable Lane Departure Warnings\",\n                                            \"Receive alerts to steer back into the lane when your vehicle drifts over a detected lane line without a turn signal activated while driving over 31mph (50kph).\",\n                                            \"..\/assets\/offroad\/icon_warning.png\"\n                                              ));\n  toggles_list->addWidget(horizontal_line());\n  toggles_list->addWidget(new ParamsToggle(\"RecordFront\",\n                                            \"Record and Upload Driver Camera\",\n                                            \"Upload data from the driver facing camera and help improve the driver monitoring algorithm.\",\n                                            \"..\/assets\/offroad\/icon_network.png\"\n                                            ));\n  toggles_list->addWidget(horizontal_line());\n  toggles_list->addWidget(new ParamsToggle(\"IsRHD\",\n                                            \"Enable Right-Hand Drive\",\n                                            \"Allow openpilot to obey left-hand traffic conventions and perform driver monitoring on right driver seat.\",\n                                            \"..\/assets\/offroad\/icon_openpilot_mirrored.png\"\n                                            ));\n  toggles_list->addWidget(horizontal_line());\n  toggles_list->addWidget(new ParamsToggle(\"IsMetric\",\n                                            \"Use Metric System\",\n                                            \"Display speed in km\/h instead of mp\/h.\",\n                                            \"..\/assets\/offroad\/icon_metric.png\"\n                                            ));\n  toggles_list->addWidget(horizontal_line());\n  toggles_list->addWidget(new ParamsToggle(\"CommunityFeaturesToggle\",\n                                            \"Enable Community Features\",\n                                            \"Use features from the open source community that are not maintained or supported by comma.ai and have not been confirmed to meet the standard safety model. These features include community supported cars and community supported hardware. Be extra cautious when using these features\",\n                                            \"..\/assets\/offroad\/icon_shell.png\"\n                                            ));\n\n  QWidget *widget = new QWidget;\n  widget->setLayout(toggles_list);\n  return widget;\n}\n\nQWidget * device_panel() {\n\n  QVBoxLayout *device_layout = new QVBoxLayout;\n  device_layout->setMargin(100);\n  device_layout->setSpacing(30);\n\n  Params params = Params();\n  std::vector<std::pair<std::string, std::string>> labels = {\n    {\"Dongle ID\", params.get(\"DongleId\", false)},\n  };\n\n  \/\/ get serial number\n  \/\/std::string cmdline = util::read_file(\"\/proc\/cmdline\");\n  \/\/auto delim = cmdline.find(\"serialno=\");\n  \/\/if (delim != std::string::npos) {\n  \/\/  labels.push_back({\"Serial\", cmdline.substr(delim, cmdline.find(\" \", delim))});\n  \/\/}\n\n  for (auto &l : labels) {\n    device_layout->addWidget(labelWidget(QString::fromStdString(l.first+\":\"), QString::fromStdString(l.second)), 0, Qt::AlignTop);\n  }\n\n  \/\/ TODO: show current calibration values\n  QPushButton *clear_cal_btn = new QPushButton(\"Reset Calibration\");\n  device_layout->addWidget(clear_cal_btn, 0, Qt::AlignBottom);\n  device_layout->addWidget(horizontal_line(), Qt::AlignBottom);\n  QObject::connect(clear_cal_btn, &QPushButton::released, [=]() {\n    Params().delete_db_value(\"CalibrationParams\");\n  });\n\n  QPushButton *poweroff_btn = new QPushButton(\"Power Off\");\n  device_layout->addWidget(poweroff_btn, Qt::AlignBottom);\n  QPushButton *reboot_btn = new QPushButton(\"Reboot\");\n  device_layout->addWidget(reboot_btn, Qt::AlignBottom);\n  device_layout->addWidget(horizontal_line(), Qt::AlignBottom);\n#ifdef __aarch64__\n  QObject::connect(poweroff_btn, &QPushButton::released, [=]() { std::system(\"sudo poweroff\"); });\n  QObject::connect(reboot_btn, &QPushButton::released, [=]() { std::system(\"sudo reboot\"); });\n#endif\n\n  \/\/ TODO: add confirmation dialog\n  QPushButton *uninstall_btn = new QPushButton(\"Uninstall openpilot\");\n  device_layout->addWidget(uninstall_btn);\n  QObject::connect(uninstall_btn, &QPushButton::released, [=]() { Params().write_db_value(\"DoUninstall\", \"1\"); });\n\n  QWidget *widget = new QWidget;\n  widget->setLayout(device_layout);\n  widget->setStyleSheet(R\"(\n    QPushButton {\n      padding: 0;\n      height: 120px;\n      border-radius: 15px;\n      background-color: #393939;\n    }\n  )\");\n  return widget;\n}\n\nQWidget * developer_panel() {\n  QVBoxLayout *main_layout = new QVBoxLayout;\n  main_layout->setMargin(100);\n\n  \/\/ TODO: enable SSH toggle and github keys\n\n  Params params = Params();\n  std::string brand = params.read_db_bool(\"Passive\") ? \"dashcam\" : \"openpilot\";\n  std::vector<std::pair<std::string, std::string>> labels = {\n    {\"Version\", brand + \" v\" + params.get(\"Version\", false)},\n    {\"Git Branch\", params.get(\"GitBranch\", false)},\n    {\"Git Commit\", params.get(\"GitCommit\", false).substr(0, 10)},\n    {\"Panda Firmware\", params.get(\"PandaFirmwareHex\", false)},\n  };\n\n  std::string os_version = util::read_file(\"\/VERSION\");\n  if (os_version.size()) {\n    labels.push_back({\"OS Version\", \"AGNOS \" + os_version});\n  }\n\n  for (int i = 0; i<labels.size(); i++) {\n    auto l = labels[i];\n    main_layout->addWidget(labelWidget(QString::fromStdString(l.first+\":\"), QString::fromStdString(l.second)));\n\n    if(i+1<labels.size()) {\n      main_layout->addWidget(horizontal_line());\n    }\n  }\n\n  QWidget *widget = new QWidget;\n  widget->setLayout(main_layout);\n  widget->setStyleSheet(R\"(\n    QLabel {\n      font-size: 50px;\n    }\n  )\");\n  return widget;\n}\n\nQWidget * network_panel(QWidget * parent) {\n  Networking *w = new Networking(parent);\n  QObject::connect(parent, SIGNAL(sidebarPressed()), w, SLOT(sidebarChange()));\n  QObject::connect(w, SIGNAL(openKeyboard()), parent, SLOT(closeSidebar()));\n  QObject::connect(w, SIGNAL(closeKeyboard()), parent, SLOT(openSidebar()));\n  return w;\n}\n\n\nvoid SettingsWindow::setActivePanel() {\n  auto *btn = qobject_cast<QPushButton *>(nav_btns->checkedButton());\n  panel_layout->setCurrentWidget(panels[btn->text()]);\n}\n\nSettingsWindow::SettingsWindow(QWidget *parent) : QFrame(parent) {\n  \/\/ setup two main layouts\n  QVBoxLayout *sidebar_layout = new QVBoxLayout();\n  sidebar_layout->setMargin(0);\n  panel_layout = new QStackedLayout();\n\n  \/\/ close button\n  QPushButton *close_btn = new QPushButton(\"X\");\n  close_btn->setStyleSheet(R\"(\n    font-size: 90px;\n    font-weight: bold;\n    border 1px grey solid;\n    border-radius: 100px;\n    background-color: #292929;\n  )\");\n  close_btn->setFixedSize(200, 200);\n  sidebar_layout->addSpacing(45);\n  sidebar_layout->addWidget(close_btn, 0, Qt::AlignCenter);\n  QObject::connect(close_btn, SIGNAL(released()), this, SIGNAL(closeSettings()));\n\n  \/\/ setup panels\n  panels = {\n    {\"Developer\", developer_panel()},\n    {\"Device\", device_panel()},\n    {\"Network\", network_panel(this)},\n    {\"Toggles\", toggles_panel()},\n  };\n\n  sidebar_layout->addSpacing(45);\n  nav_btns = new QButtonGroup();\n  for (auto &panel : panels) {\n    QPushButton *btn = new QPushButton(panel.first);\n    btn->setCheckable(true);\n    btn->setStyleSheet(R\"(\n      QPushButton {\n        color: grey;\n        border: none;\n        background: none;\n        font-size: 65px;\n        font-weight: bold;\n        padding-top: 35px;\n        padding-bottom: 35px;\n      }\n      QPushButton:checked {\n        color: white;\n      }\n    )\");\n\n    nav_btns->addButton(btn);\n    sidebar_layout->addWidget(btn, 0, Qt::AlignRight);\n    panel_layout->addWidget(panel.second);\n    QObject::connect(btn, SIGNAL(released()), this, SLOT(setActivePanel()));\n    QObject::connect(btn, &QPushButton::released, [=](){emit sidebarPressed();});\n  }\n  qobject_cast<QPushButton *>(nav_btns->buttons()[0])->setChecked(true);\n  sidebar_layout->setContentsMargins(50, 50, 100, 50);\n\n  \/\/ main settings layout, sidebar + main panel\n  QHBoxLayout *settings_layout = new QHBoxLayout();\n\n  sidebar_widget = new QWidget;\n  sidebar_widget->setLayout(sidebar_layout);\n  sidebar_widget->setFixedWidth(500);\n  settings_layout->addWidget(sidebar_widget);\n\n\n  panel_frame = new QFrame;\n  panel_frame->setLayout(panel_layout);\n  panel_frame->setStyleSheet(R\"(\n    QFrame {\n      border-radius: 30px;\n      background-color: #292929;\n    }\n    * {\n      background-color: none;\n    }\n  )\");\n  settings_layout->addWidget(panel_frame);\n\n  setLayout(settings_layout);\n  setStyleSheet(R\"(\n    * {\n      color: white;\n      font-size: 50px;\n    }\n    SettingsWindow {\n      background-color: black;\n    }\n  )\");\n}\n\nvoid SettingsWindow::closeSidebar() {\n  sidebar_widget->setFixedWidth(0);\n}\n\nvoid SettingsWindow::openSidebar() {\n  sidebar_widget->setFixedWidth(500);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <QtGui>\n#include <QDebug>\n#include \"mapeditor.h\"\nMapEditor::MapEditor(QWidget *parent) :\n        QMainWindow(parent),\n      ui(new Ui::MapEditor)\n{\n    ui->setupUi(this);\n   ui->tableWidget->setRowCount(999);\/\/设置行数为999\n   ui->tableWidget->setColumnCount(999);\/\/设置列数为999\n   QTextCodec::setCodecForTr(QTextCodec::codecForName(\"UTF-8\"));\/\/编码设置为utf8\n   ui->tableWidget->setHorizontalHeaderLabels(QStringList() <<(\"1\"));\n   ui->tableWidget->setVerticalHeaderLabels(QStringList()<<(\"1\"));\n}\nMapEditor::~MapEditor()\n{\n    delete ui;\n}\n\nvoid MapEditor::createMenuBar()\n{\n    menubar = new QMenuBar(this);\n    menubar->setGeometry(0,0,1000,20);\n    fileMenu = menubar->addMenu(tr(\"File\"));\n    actionNew = fileMenu->addAction(\"New\");\n    actionOpen = fileMenu->addAction(\"Open\");\n    actionSave = fileMenu->addAction(\"Save\");\n    actionQuit = fileMenu->addAction(\"Quit\");\n\n\n    toolMenu = menubar->addMenu(tr(\"Tool\"));\n\n    connect(actionOpen,SIGNAL(triggered()),this,SLOT(openFile()));\n    connect(actionNew,SIGNAL(triggered()),this,SLOT(newFile()));\n    connect(actionSave,SIGNAL(triggered()),this,SLOT(saveFile()));\n    connect(actionQuit,SIGNAL(triggered()),this,SLOT(quitFile()));\n}\n\nvoid MapEditor::createStatusBar()\n{\n    statusLabel->setText(\"game loading\");\n    statusBar()->addWidget(statusLabel);\n}\n\nvoid MapEditor::openFile()\n{\n\/\/   QString filename = QFileDialog::getOpenFileName(this,tr(\"choose the edit map\"),\".\",tr(\"map(*.data)\"));\n}\nvoid MapEditor::saveFile()\n{\n\n}\n\nvoid MapEditor::newFile()\n{\n\n}\n\nvoid MapEditor::quitFile()\n{\n\n    this->close();\n    delete ui;\n}\n#if 0\nvoid MapEditor::on_mapButton_clicked()\n{\n    \/\/map *mapDialog = new map;\n    \/\/delete ui;\n    \/\/mapDialog->show();\n\n    filename = QFileDialog::getOpenFileName(this,tr(\"choose your image\"),\".\",tr(\"png(*.png)\"));\n    QSettings imageSet(\"Carrow Inc.\",\"fun catching\");\n    imageSet.setValue(\"imagePath\",filename);\n    QString filename;\n        filename=QFileDialog::getOpenFileName(this,\n                                              tr(\"选择图像\"),\n                                              \".\",\n                                              tr(\"Images (*.png *.bmp *.jpg *.tif *.GIF )\"));\n        if(filename.isEmpty())\n        {\n             return;\n        }\n        else\n        {\n            QImage* img=new QImage;\n\n            if(! ( img->load(filename) ) ) \/\/加载图像\n            {\n                QMessageBox::information(this,\n                                         tr(\"打开图像失败\"),\n                                         tr(\"打开图像失败!\"));\n                delete img;\n                return;\n            }\n            ui->label->setPixmap(QPixmap::fromImage(*img));\n        }\n\n}\n#endif\n\n\nvoid MapEditor::on_treeWidget_clicked(const QModelIndex &index)\n{\n    qDebug(\"a\");\n}\n<commit_msg>you gai le yi xia<commit_after>#include <QtGui>\n#include <QDebug>\n#include \"mapeditor.h\"\nMapEditor::MapEditor(QWidget *parent) :\n        QMainWindow(parent),\n      ui(new Ui::MapEditor)\n{\n    ui->setupUi(this);\n   ui->tableWidget->setRowCount(999);\/\/设置行数为999\n   ui->tableWidget->setColumnCount(999);\/\/设置列数为999\n   QTextCodec::setCodecForTr(QTextCodec::codecForName(\"UTF-8\"));\/\/编码设置为utf8\n   ui->tableWidget->setHorizontalHeaderLabels(QStringList() <<(\"1\"));\n   ui->tableWidget->setVerticalHeaderLabels(QStringList()<<(\"1\"));\n}\nMapEditor::~MapEditor()\n{\n    delete ui;\n}\n\nvoid MapEditor::createMenuBar()\n{\n    menubar = new QMenuBar(this);\n    menubar->setGeometry(0,0,1000,20);\n    fileMenu = menubar->addMenu(tr(\"File\"));\n    actionNew = fileMenu->addAction(\"New\");\n    actionOpen = fileMenu->addAction(\"Open\");\n    actionSave = fileMenu->addAction(\"Save\");\n    actionQuit = fileMenu->addAction(\"Quit\");\n\n\n    toolMenu = menubar->addMenu(tr(\"Tool\"));\n\n    connect(actionOpen,SIGNAL(triggered()),this,SLOT(openFile()));\n    connect(actionNew,SIGNAL(triggered()),this,SLOT(newFile()));\n    connect(actionSave,SIGNAL(triggered()),this,SLOT(saveFile()));\n    connect(actionQuit,SIGNAL(triggered()),this,SLOT(quitFile()));\n}\n\nvoid MapEditor::createStatusBar()\n{\n    statusLabel->setText(\"game loading\");\n    statusBar()->addWidget(statusLabel);\n}\n\nvoid MapEditor::openFile()\n{\n\/\/   QString filename = QFileDialog::getOpenFileName(this,tr(\"choose the edit map\"),\".\",tr(\"map(*.data)\"));\n}\nvoid MapEditor::saveFile()\n{\n\n}\n\nvoid MapEditor::newFile()\n{\n\n}\n\nvoid MapEditor::quitFile()\n{\n\n    this->close();\n    delete ui;\n}\n#if 0\nvoid MapEditor::on_mapButton_clicked()\n{\n    \/\/map *mapDialog = new map;\n    \/\/delete ui;\n    \/\/mapDialog->show();\n\n    filename = QFileDialog::getOpenFileName(this,tr(\"choose your image\"),\".\",tr(\"png(*.png)\"));\n    QSettings imageSet(\"Carrow Inc.\",\"fun catching\");\n    imageSet.setValue(\"imagePath\",filename);\n    QString filename;\n        filename=QFileDialog::getOpenFileName(this,\n                                              tr(\"选择图像\"),\n                                              \".\",\n                                              tr(\"Images (*.png *.bmp *.jpg *.tif *.GIF )\"));\n        if(filename.isEmpty())\n        {\n             return;\n        }\n        else\n        {\n            QImage* img=new QImage;\n\n            if(! ( img->load(filename) ) ) \/\/加载图像\n            {\n                QMessageBox::information(this,\n                                         tr(\"打开图像失败\"),\n                                         tr(\"打开图像失败!\"));\n                delete img;\n                return;\n            }\n            ui->label->setPixmap(QPixmap::fromImage(*img));\n        }\n\n}\n#endif\n\n\nvoid MapEditor::on_treeWidget_clicked(const QModelIndex &index)\n{\n    qDebug(\"a\");\n}\nvoid MapEditor::on_treeWidget_activated(const QModelIndex &index)\n{\n    ;\/\/input something here in the future\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/ \\file\n\/\/\/ \\ingroup tutorial_v7\n\/\/\/\n\/\/\/ This macro generates a small V7 TH1D, fills it and draw it in a V7 canvas.\n\/\/\/ The canvas is display in the web browser and the corresponding png picture\n\/\/\/ is generated.\n\/\/\/\n\/\/\/ \\macro_code\n\/\/\/\n\/\/\/ \\date 2015-03-22\n\/\/\/ \\warning This is part of the ROOT 7 prototype! It will change without notice. It might trigger earthquakes. Feedback is welcome!\n\/\/\/ \\author Axel Naumann <axel@cern.ch>\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\/RHistDrawable.hxx\"\n#include \"ROOT\/RCanvas.hxx\"\n#include \"ROOT\/RLegend.hxx\"\n#include \"TRandom.h\"\n\nusing namespace ROOT::Experimental;\n\nvoid draw_legend()\n{\n   \/\/ Create the histogram.\n   RAxisConfig xaxis(25, 0., 10.);\n   auto pHist = std::make_shared<RH1D>(xaxis);\n   auto pHist2 = std::make_shared<RH1D>(xaxis);\n\n   for (int n=0;n<1000;n++) {\n      pHist->Fill(gRandom->Gaus(3,0.8));\n      pHist2->Fill(gRandom->Gaus(7,1.2));\n   }\n\n   \/\/ Create a canvas to be displayed.\n   auto canvas = RCanvas::Create(\"Canvas Title\");\n   auto draw1 = canvas->Draw(pHist);\n   draw1->AttrLine().SetColor(RColor::kRed).SetWidth(2);\n\n   auto draw2 = canvas->Draw(pHist2);\n   draw2->AttrLine().SetColor(RColor::kBlue).SetWidth(4);\n   \n   auto legend = canvas->Draw<RLegend>(RPadPos(0.5_normal, 0.6_normal), RPadPos(0.9_normal,0.9_normal), \"Legend title\");\n   legend->AttrBox().Fill().SetStyle(5).SetColor(RColor::kWhite);\n   legend->AttrBox().Border().SetWidth(2).SetColor(RColor::kRed);\n   legend->AddEntry(draw1, \"histo1\").SetLine(\"line_\");\n   legend->AddEntry(draw2, \"histo2\").SetLine(\"line_\");\n\n   canvas->Show();\n}\n<commit_msg>[rlegend] update tutorials macro with auto-color example<commit_after>\/\/\/ \\file\n\/\/\/ \\ingroup tutorial_v7\n\/\/\/\n\/\/\/ This macro generates two TH1D objects and build RLegend\n\/\/\/ In addition use of auto colors are shown\n\/\/\/\n\/\/\/ \\macro_code\n\/\/\/\n\/\/\/ \\date 2019-10-09\n\/\/\/ \\warning This is part of the ROOT 7 prototype! It will change without notice. It might trigger earthquakes. Feedback is welcome!\n\/\/\/ \\author Sergey Linev <s.linev@gsi.de>\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\/RHistDrawable.hxx\"\n#include \"ROOT\/RCanvas.hxx\"\n#include \"ROOT\/RLegend.hxx\"\n#include \"TRandom.h\"\n\nusing namespace ROOT::Experimental;\n\nvoid draw_legend()\n{\n   \/\/ Create the histograms.\n   RAxisConfig xaxis(25, 0., 10.);\n   auto pHist = std::make_shared<RH1D>(xaxis);\n   auto pHist2 = std::make_shared<RH1D>(xaxis);\n\n   for (int n=0;n<1000;n++) {\n      pHist->Fill(gRandom->Gaus(3,0.8));\n      pHist2->Fill(gRandom->Gaus(7,1.2));\n   }\n\n   \/\/ Create a canvas to be displayed.\n   auto canvas = RCanvas::Create(\"Canvas Title\");\n\n   \/\/ draw histogram\n   auto draw1 = canvas->Draw(pHist);\n   draw1->AttrLine().SetWidth(2).Color().SetAuto();\n\n   \/\/ draw histogram\n   auto draw2 = canvas->Draw(pHist2);\n   draw2->AttrLine().SetWidth(4).Color().SetAuto();\n\n   canvas->AssignAutoColors();\n   \n   auto legend = canvas->Draw<RLegend>(RPadPos(0.5_normal, 0.6_normal), RPadPos(0.9_normal,0.9_normal), \"Legend title\");\n   legend->AttrBox().Fill().SetStyle(5).SetColor(RColor::kWhite);\n   legend->AttrBox().Border().SetWidth(2).SetColor(RColor::kRed);\n   legend->AddEntry(draw1, \"histo1\").SetLine(\"line_\");\n   legend->AddEntry(draw2, \"histo2\").SetLine(\"line_\");\n\n   canvas->Show();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"runtimeLibrary.class.hpp\"\n#include \"..\/..\/headerList.hpp\"\n\n#ifdef  __APPLE_\n# define FILE_AGE(F)(F.st_mtimespec.tv_sec)\n#else\n# define FILE_AGE(F)(F.st_mtim.tv_sec)\n#endif\n\nvoid runtimeLibrary::init()\n{\n\n}\n\nvoid runtimeLibrary::shutdown()\n{\n\n}\n\nvoid utoa(int n, char *s)\n{\n    int len = log10(n) + 1;\n\tint i = 0;\n\n\tif (!n)\n\t{\n\t\ts[0] = '0';\n\t\ts[1] = 0;\n\t\treturn ;\n\t}\n\ts[len - i] = 0;\n\twhile (n > 0)\n\t{\n\t\ts[len - i - 1] = n % 10 + '0';\n\t\tn \/= 10;\n\t\ti++;\n\t}\n}\n\nvoid fill_sources(char ret[64][1024], char *sourceDir)\n{\n\tDIR\t\t\t\t\t*dir;\n\tuint32_t\t\t\ti;\n\tstruct dirent\t\t*dirent;\n\n\n\ti = 0;\n\tret[0][0] = 0;\n\tdir = opendir(sourceDir);\n\tif (dir == NULL)\n\t{\n\t\tprintf(\"ERROR: cant open folder: %s\\n\", sourceDir);\n\t\texit(0);\/\/errorSys\n\t}\n\twhile ((dirent = readdir(dir)))\n\t{\n\n\t\tif (dirent->d_type == DT_REG && !strcmp(dirent->d_name + strlen(dirent->d_name) - 4, \".cpp\")\n\t\t\t&& strlen(dirent->d_name) + strlen(sourceDir) < 1022 && i < 64)\n\t\t{\n\t\t\tstrncat(strcat(strcpy(ret[i], sourceDir), \"\/\"), dirent->d_name, strlen(dirent->d_name) - 4);\n\t\t\ti++;\n\t\t\tret[i][0] = 0;\n\t\t}\n\t}\n\tfree(dir);\n}\n\nvoid *runtimeLibrary::create_lib(char *sourceDir)\n{\n\tchar sources[64][1024] = {0};\n\n\tfill_sources(sources, sourceDir);\n\treturn (compile_object(sources, sourceDir));\n}\n\nbool create_stm_line(char *str, char *head, char *sources, struct stat libstat, int statret)\n{\n \tuint32_t \t\ti = 0;\n \tstruct stat \tfilestat;\n \tchar \t\t\tpathstat[65536] = {0};\n\n \t*str = 0;\n\tif (statret == 0 && stat(strcat(strcat(pathstat, sources), \".cpp\"), &filestat) == 0)\n\t{\n\t\tif (FILE_AGE(filestat) < FILE_AGE(libstat))\n\t\t\treturn (false);\n \t}\n\tstrcat(str, head);\n\tstrcat(str, sources);\n\tstrcat(str, \".o\");\n\tstrcat(str, \" -c \");\n\tstrcat(str, sources);\n\tstrcat(str, \".cpp\");\n\treturn (true);\n}\n\nvoid link_library(char *stmline, char sources[][1024], char *srcdir)\n{\n\tchar head[] = \"g++ -fPIC -Wl,-undefined -Wl,dynamic_lookup -shared \";\n\n\tstrcat(stmline, head);\n\tstrcat(stmline, \" -o \");\n\tstrcat(stmline, srcdir);\n\tstrcat(stmline, \"\/\");\n\tstrcat(stmline, \"0xdeadd00d.so \");\n\tfor (uint32_t i = 0; sources[i][0]; i++)\n\t{\n\t\tstrcat(stmline, sources[i]);\n\t\tstrcat(stmline, \".o \");\n\t}\n}\n\nint\trun_sys(char *str)\n{\n\tint ret;\n\n\twrite(1, \"\\x1B[34m\", 6);\n\twrite(1, str, strlen(str));\n\twrite(1, \"\\n\", 1);\n\twrite(1, \"\\x1B[37m\", 6);\n\tint pid = vfork();\n\tif (pid == 0)\n\t\texecl(\"\/bin\/sh\", \"sh\",\"-c\", str, (char*)0);\n\twhile ((ret = waitpid(pid, NULL, 0)) > 0);\n\treturn (0);\n}\n\nvoid *runtimeLibrary::compile_object(char sources[64][1024], char *srcdir)\n{\n\tchar \t\tstmLineHead[65536] = \"g++ -std=c++11 -fPIC \";\n\tchar \t\tstmLine[65536] = {0};\n\tvoid \t\t*handle;\n\n\tstruct stat \t\tlibstat;\n\tint \t\t\t\tstatret;\n\n\tstatret = stat(strcat(strcat(strcat(stmLine, srcdir),  \"\/\"), \"0xdeadd00d.so\"), &libstat);\n\tstmLine[0] = 0;\n\tstrcat(stmLineHead, headerList);\n\tstrcat(stmLineHead, \" -o \");\n\tuint32_t\ti = 0;\n\tvoid (*f)(void);\n\twhile (sources[i][0])\n\t{\n\t\tif (create_stm_line(stmLine, stmLineHead, sources[i], libstat, statret) == false)\n\t\t{\n\t\t\ti++;\n\t\t\tcontinue ;\n\t\t}\n\t\tif (run_sys(stmLine) < 0)\n\t\t{\n\t\t\tprintf(\"Script cannot be compiled\\n\");\n\t\t\treturn NULL;\n\t\t}\n\t\ti++;\n\t}\n\tstmLine[0] = 0;\n\tlink_library(stmLine, sources, srcdir);\n\tif (run_sys(stmLine) < 0)\n\t{\n\t\tprintf(\"Script cannot be compiled\\n\");\n\t\treturn NULL;\n\t}\n\t*stmLine = 0;\n\tstrcat(stmLine, srcdir);\n\tstrcat(stmLine, \"\/\");\n\tstrcat(stmLine,  \"0xdeadd00d.so\");\n\thandle = link(stmLine);\n\tif (!handle)\n\t{\n\t\tprintf(\"%s\\n\", dlerror());\n\t\treturn (NULL);\n\t}\n\tf = (void(*)())dlsym(handle, \"_Z5debutv\");\n\tif (f)\n\t\tf();\n\treturn (handle);\n}\n\nvoid *runtimeLibrary::link(char *sourcesLib)\n{\n\treturn (dlopen(sourcesLib, RTLD_NOW | RTLD_GLOBAL));\n}\n\nvoid runtimeLibrary::close_lib(void *handle)\n{\n\tdlclose(handle);\t\n}\n<commit_msg>maccompatibility<commit_after>#include \"runtimeLibrary.class.hpp\"\n#include \"..\/..\/headerList.hpp\"\n\n#ifdef  __APPLE__\n# define FILE_AGE(F)(F.st_mtimespec.tv_sec)\n#else\n# define FILE_AGE(F)(F.st_mtim.tv_sec)\n#endif\n\nvoid runtimeLibrary::init()\n{\n\n}\n\nvoid runtimeLibrary::shutdown()\n{\n\n}\n\nvoid utoa(int n, char *s)\n{\n    int len = log10(n) + 1;\n\tint i = 0;\n\n\tif (!n)\n\t{\n\t\ts[0] = '0';\n\t\ts[1] = 0;\n\t\treturn ;\n\t}\n\ts[len - i] = 0;\n\twhile (n > 0)\n\t{\n\t\ts[len - i - 1] = n % 10 + '0';\n\t\tn \/= 10;\n\t\ti++;\n\t}\n}\n\nvoid fill_sources(char ret[64][1024], char *sourceDir)\n{\n\tDIR\t\t\t\t\t*dir;\n\tuint32_t\t\t\ti;\n\tstruct dirent\t\t*dirent;\n\n\n\ti = 0;\n\tret[0][0] = 0;\n\tdir = opendir(sourceDir);\n\tif (dir == NULL)\n\t{\n\t\tprintf(\"ERROR: cant open folder: %s\\n\", sourceDir);\n\t\texit(0);\/\/errorSys\n\t}\n\twhile ((dirent = readdir(dir)))\n\t{\n\n\t\tif (dirent->d_type == DT_REG && !strcmp(dirent->d_name + strlen(dirent->d_name) - 4, \".cpp\")\n\t\t\t&& strlen(dirent->d_name) + strlen(sourceDir) < 1022 && i < 64)\n\t\t{\n\t\t\tstrncat(strcat(strcpy(ret[i], sourceDir), \"\/\"), dirent->d_name, strlen(dirent->d_name) - 4);\n\t\t\ti++;\n\t\t\tret[i][0] = 0;\n\t\t}\n\t}\n\tfree(dir);\n}\n\nvoid *runtimeLibrary::create_lib(char *sourceDir)\n{\n\tchar sources[64][1024] = {0};\n\n\tfill_sources(sources, sourceDir);\n\treturn (compile_object(sources, sourceDir));\n}\n\nbool create_stm_line(char *str, char *head, char *sources, struct stat libstat, int statret)\n{\n \tuint32_t \t\ti = 0;\n \tstruct stat \tfilestat;\n \tchar \t\t\tpathstat[65536] = {0};\n\n \t*str = 0;\n\tif (statret == 0 && stat(strcat(strcat(pathstat, sources), \".cpp\"), &filestat) == 0)\n\t{\n\t\tif (FILE_AGE(filestat) < FILE_AGE(libstat))\n\t\t\treturn (false);\n \t}\n\tstrcat(str, head);\n\tstrcat(str, sources);\n\tstrcat(str, \".o\");\n\tstrcat(str, \" -c \");\n\tstrcat(str, sources);\n\tstrcat(str, \".cpp\");\n\treturn (true);\n}\n\nvoid link_library(char *stmline, char sources[][1024], char *srcdir)\n{\n\tchar head[] = \"g++ -fPIC -Wl,-undefined -Wl,dynamic_lookup -shared \";\n\n\tstrcat(stmline, head);\n\tstrcat(stmline, \" -o \");\n\tstrcat(stmline, srcdir);\n\tstrcat(stmline, \"\/\");\n\tstrcat(stmline, \"0xdeadd00d.so \");\n\tfor (uint32_t i = 0; sources[i][0]; i++)\n\t{\n\t\tstrcat(stmline, sources[i]);\n\t\tstrcat(stmline, \".o \");\n\t}\n}\n\nint\trun_sys(char *str)\n{\n\tint ret;\n\n\twrite(1, \"\\x1B[34m\", 6);\n\twrite(1, str, strlen(str));\n\twrite(1, \"\\n\", 1);\n\twrite(1, \"\\x1B[37m\", 6);\n\tint pid = vfork();\n\tif (pid == 0)\n\t\texecl(\"\/bin\/sh\", \"sh\",\"-c\", str, (char*)0);\n\twhile ((ret = waitpid(pid, NULL, 0)) > 0);\n\treturn (0);\n}\n\nvoid *runtimeLibrary::compile_object(char sources[64][1024], char *srcdir)\n{\n\tchar \t\tstmLineHead[65536] = \"g++ -std=c++11 -fPIC \";\n\tchar \t\tstmLine[65536] = {0};\n\tvoid \t\t*handle;\n\n\tstruct stat \t\tlibstat;\n\tint \t\t\t\tstatret;\n\n\tstatret = stat(strcat(strcat(strcat(stmLine, srcdir),  \"\/\"), \"0xdeadd00d.so\"), &libstat);\n\tstmLine[0] = 0;\n\tstrcat(stmLineHead, headerList);\n\tstrcat(stmLineHead, \" -o \");\n\tuint32_t\ti = 0;\n\tvoid (*f)(void);\n\twhile (sources[i][0])\n\t{\n\t\tif (create_stm_line(stmLine, stmLineHead, sources[i], libstat, statret) == false)\n\t\t{\n\t\t\ti++;\n\t\t\tcontinue ;\n\t\t}\n\t\tif (run_sys(stmLine) < 0)\n\t\t{\n\t\t\tprintf(\"Script cannot be compiled\\n\");\n\t\t\treturn NULL;\n\t\t}\n\t\ti++;\n\t}\n\tstmLine[0] = 0;\n\tlink_library(stmLine, sources, srcdir);\n\tif (run_sys(stmLine) < 0)\n\t{\n\t\tprintf(\"Script cannot be compiled\\n\");\n\t\treturn NULL;\n\t}\n\t*stmLine = 0;\n\tstrcat(stmLine, srcdir);\n\tstrcat(stmLine, \"\/\");\n\tstrcat(stmLine,  \"0xdeadd00d.so\");\n\thandle = link(stmLine);\n\tif (!handle)\n\t{\n\t\tprintf(\"%s\\n\", dlerror());\n\t\treturn (NULL);\n\t}\n\tf = (void(*)())dlsym(handle, \"_Z5debutv\");\n\tif (f)\n\t\tf();\n\treturn (handle);\n}\n\nvoid *runtimeLibrary::link(char *sourcesLib)\n{\n\treturn (dlopen(sourcesLib, RTLD_NOW | RTLD_GLOBAL));\n}\n\nvoid runtimeLibrary::close_lib(void *handle)\n{\n\tdlclose(handle);\t\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2011-2016 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#if defined(HAVE_CONFIG_H)\n#include \"config\/bitcoin-config.h\"\n#endif\n\n#include \"askpassphrasedialog.h\"\n#include \"ui_askpassphrasedialog.h\"\n\n#include \"guiconstants.h\"\n#include \"walletmodel.h\"\n\n#include \"support\/allocators\/secure.h\"\n\n#include <QKeyEvent>\n#include <QMessageBox>\n#include <QPushButton>\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\n    ui->passEdit1->setMinimumSize(ui->passEdit1->sizeHint());\n    ui->passEdit2->setMinimumSize(ui->passEdit2->sizeHint());\n    ui->passEdit3->setMinimumSize(ui->passEdit3->sizeHint());\n\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    switch(mode)\n    {\n        case Encrypt: \/\/ Ask passphrase x2\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            ui->passLabel1->hide();\n            ui->passEdit1->hide();\n            setWindowTitle(tr(\"Encrypt wallet\"));\n            break;\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 passphrase and new passphrase to the wallet.\"));\n            break;\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 MYRIADCOINS<\/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(\"%1 will close now to finish the encryption process. \"\n                                         \"Remember that encrypting your wallet cannot fully protect \"\n                                         \"your bitcoins from being stolen by malware infecting your computer.\").arg(tr(PACKAGE_NAME)) +\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 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            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 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 >= 'a' && *psz <= 'z') || (!fShift && *psz >= 'A' && *psz <= 'Z')) {\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\nstatic void SecureClearQLineEdit(QLineEdit* edit)\n{\n    \/\/ Attempt to overwrite text so that they do not linger around in memory\n    edit->setText(QString(\" \").repeated(edit->text().size()));\n    edit->clear();\n}\n\nvoid AskPassphraseDialog::secureClearPassFields()\n{\n    SecureClearQLineEdit(ui->passEdit1);\n    SecureClearQLineEdit(ui->passEdit2);\n    SecureClearQLineEdit(ui->passEdit3);\n}\n<commit_msg>update from jwinterm<commit_after>\/\/ Copyright (c) 2011-2016 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#if defined(HAVE_CONFIG_H)\n#include \"config\/bitcoin-config.h\"\n#endif\n\n#include \"askpassphrasedialog.h\"\n#include \"ui_askpassphrasedialog.h\"\n\n#include \"guiconstants.h\"\n#include \"walletmodel.h\"\n\n#include \"support\/allocators\/secure.h\"\n\n#include <QKeyEvent>\n#include <QMessageBox>\n#include <QPushButton>\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\n    ui->passEdit1->setMinimumSize(ui->passEdit1->sizeHint());\n    ui->passEdit2->setMinimumSize(ui->passEdit2->sizeHint());\n    ui->passEdit3->setMinimumSize(ui->passEdit3->sizeHint());\n\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    switch(mode)\n    {\n        case Encrypt: \/\/ Ask passphrase x2\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            ui->passLabel1->hide();\n            ui->passEdit1->hide();\n            setWindowTitle(tr(\"Encrypt wallet\"));\n            break;\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 passphrase and new passphrase to the wallet.\"));\n            break;\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 MYRIADCOINS<\/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(\"%1 will close now to finish the encryption process. \"\n                                         \"Remember that encrypting your wallet cannot fully protect \"\n                                         \"your myriadcoins from being stolen by malware infecting your computer.\").arg(tr(PACKAGE_NAME)) +\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 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            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 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 >= 'a' && *psz <= 'z') || (!fShift && *psz >= 'A' && *psz <= 'Z')) {\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\nstatic void SecureClearQLineEdit(QLineEdit* edit)\n{\n    \/\/ Attempt to overwrite text so that they do not linger around in memory\n    edit->setText(QString(\" \").repeated(edit->text().size()));\n    edit->clear();\n}\n\nvoid AskPassphraseDialog::secureClearPassFields()\n{\n    SecureClearQLineEdit(ui->passEdit1);\n    SecureClearQLineEdit(ui->passEdit2);\n    SecureClearQLineEdit(ui->passEdit3);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2016, Andrej Kislovskij\n *\n * This is PUBLIC DOMAIN software so use at your own risk as it comes\n * with no warranties. This code is yours to share, use and modify without\n * any restrictions or obligations.\n *\n * For more information see conwrap\/LICENSE or refer refer to http:\/\/unlicense.org\n *\n * Author: gimesketvirtadieni at gmail dot com (Andrej Kislovskij)\n *\/\n\n#pragma once\n\n#include <boost\/asio.hpp>\n#include <functional>\n#include <memory>\n#include <mutex>\n#include <thread>\n#include <conwrap\/HandlerContext.hpp>\n#include <conwrap\/HandlerWrapper.hpp>\n#include <conwrap\/Processor.hpp>\n#include <conwrap\/ProcessorQueue.hpp>\n\n\nnamespace conwrap\n{\n\n\ttemplate <typename ResourceType>\n\tclass ProcessorAsio : public Processor<ResourceType>\n\t{\n\t\tpublic:\n\t\t\ttemplate <typename... Args>\n\t\t\tProcessorAsio(Args... args)\n\t\t\t: processorImplPtr(std::make_shared<ProcessorAsioImpl<ResourceType>>(std::move(std::make_unique<ResourceType>(this, std::forward<Args>(args)...))))\n\t\t\t, processorProxyPtr(std::unique_ptr<ProcessorAsio<ResourceType>>(new ProcessorAsio<ResourceType>(processorImplPtr)))\n\t\t\t, proxy(false)\n\t\t\t{\n\t\t\t\tprocessorImplPtr->start();\n\t\t\t}\n\n\t\t\ttemplate <typename... Args>\n\t\t\tProcessorAsio(std::unique_ptr<ResourceType> resource)\n\t\t\t: processorImplPtr(std::make_shared<ProcessorAsioImpl<ResourceType>>(std::move(resource)))\n\t\t\t, processorProxyPtr(std::unique_ptr<ProcessorAsio<ResourceType>>(new ProcessorAsio<ResourceType>(processorImplPtr)))\n\t\t\t, proxy(false)\n\t\t\t{\n\t\t\t\tprocessorImplPtr->start();\n\t\t\t}\n\n\t\t\tvirtual ~ProcessorAsio()\n\t\t\t{\n\t\t\t\tif (!proxy)\n\t\t\t\t{\n\t\t\t\t\tprocessorImplPtr->stop();\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tboost::asio::io_service* getDispatcher()\n\t\t\t{\n\t\t\t\treturn processorImplPtr->getDispatcher();\n\t\t\t}\n\n\t\t\tvirtual ResourceType* getResource() override\n\t\t\t{\n\t\t\t\treturn processorImplPtr->getResource();\n\t\t\t}\n\n\t\t\tvirtual void flush() override\n\t\t\t{\n\t\t\t\tprocessorImplPtr->flush();\n\t\t\t}\n\n\t\t\tvirtual HandlerWrapper wrapHandler(std::function<void()> handler) override\n\t\t\t{\n\t\t\t\treturn processorImplPtr->wrapHandler(handler);\n\t\t\t}\n\n\t\tprotected:\n\t\t\ttemplate <typename ResourceType2>\n\t\t\tclass ProcessorAsioImpl : public Processor<ResourceType2>\n\t\t\t{\n\t\t\t\tpublic:\n\t\t\t\t\ttemplate <typename... Args>\n\t\t\t\t\tProcessorAsioImpl(std::unique_ptr<ResourceType2> r)\n\t\t\t\t\t: processorQueue(std::move(r)) {}\n\n\t\t\t\t\tvirtual ~ProcessorAsioImpl() {}\n\n\t\t\t\t\tboost::asio::io_service* getDispatcher()\n\t\t\t\t\t{\n\t\t\t\t\t\treturn &dispatcher;\n\t\t\t\t\t}\n\n\t\t\t\t\tvirtual ResourceType2* getResource() override\n\t\t\t\t\t{\n\t\t\t\t\t\treturn processorQueue.getResource();\n\t\t\t\t\t}\n\n\t\t\t\t\tvirtual void flush() override\n\t\t\t\t\t{\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tstd::lock_guard<std::recursive_mutex> guard(lock);\n\n\t\t\t\t\t\t\t\/\/ TODO: redesign to avoid invoking stop-start as it changes running thread\n\t\t\t\t\t\t\tif (thread.joinable())\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\/\/ stopping dispatcher will make sure all handlers are in processor queue\n\t\t\t\t\t\t\t\tstop();\n\n\t\t\t\t\t\t\t\t\/\/ start processing as flush will not be affected by incomming handlers\n\t\t\t\t\t\t\t\tstart();\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\/\/ flushing processor's queue\n\t\t\t\t\t\tprocessorQueue.flush();\n\t\t\t\t\t}\n\n\t\t\t\t\tvirtual void post(std::function<void()> handler) override\n\t\t\t\t\t{\n\t\t\t\t\t\tdispatcher.post(wrapHandler(handler));\n\t\t\t\t\t}\n\n\t\t\t\t\tvoid start()\n\t\t\t\t\t{\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tstd::lock_guard<std::recursive_mutex> guard(lock);\n\n\t\t\t\t\t\t\tif (!thread.joinable())\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\/\/ creating work object to make sure dispatcher performs until work object is deleted\n\t\t\t\t\t\t\t\tworkPtr = std::make_unique<boost::asio::io_service::work>(dispatcher);\n\n\t\t\t\t\t\t\t\t\/\/ running dispacther on its dedicated thread\n\t\t\t\t\t\t\t\tthread = std::thread([&]\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\/\/ TODO: rewrite...\n\t\t\t\t\t\t\t\t\tdispatcher.reset();\n\t\t\t\t\t\t\t\t\tauto processedCount = dispatcher.run();\n\n\t\t\t\t\t\t\t\t\tfor (processedCount = 1 ;processedCount > 0;)\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tprocessorQueue.flush();\n\t\t\t\t\t\t\t\t\t\tdispatcher.reset();\n\t\t\t\t\t\t\t\t\t\tprocessedCount = dispatcher.run();\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t});\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tvoid stop()\n\t\t\t\t\t{\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tstd::lock_guard<std::recursive_mutex> guard(lock);\n\n\t\t\t\t\t\t\tif (thread.joinable())\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\/\/ reseting work object will make dispatcher exit as soon as there is no handler to process\n\t\t\t\t\t\t\t\tworkPtr.reset();\n\n\t\t\t\t\t\t\t\t\/\/ waiting for the thread to finish\n\t\t\t\t\t\t\t\tthread.join();\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t};\n\t\t\t\t\t}\n\n\t\t\t\t\tvirtual HandlerWrapper wrapHandler(std::function<void()> handler) override\n\t\t\t\t\t{\n\t\t\t\t\t\treturn HandlerWrapper([=]\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tprocessorQueue.process([=](auto)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\thandler();\n\t\t\t\t\t\t\t});\n\t\t\t\t\t\t});\n\t\t\t\t\t}\n\n\t\t\t\tprivate:\n\t\t\t\t\tProcessorQueue<ResourceType2>                  processorQueue;\n\t\t\t\t\tstd::unique_ptr<boost::asio::io_service::work> workPtr;\n\t\t\t\t\tboost::asio::io_service                        dispatcher;\n\t\t\t\t\tstd::thread                                    thread;\n\t\t\t\t\tstd::recursive_mutex                           lock;\n\t\t\t};\n\n\t\t\tProcessorAsio(std::shared_ptr<ProcessorAsioImpl<ResourceType>> processorImplPtr)\n\t\t\t: processorImplPtr(processorImplPtr)\n\t\t\t, proxy(true) {}\n\n\t\t\tvirtual void post(std::function<void()> handler) override\n\t\t\t{\n\t\t\t\tprocessorImplPtr->post(handler);\n\t\t\t}\n\n\t\tprivate:\n\t\t\tstd::shared_ptr<ProcessorAsioImpl<ResourceType>> processorImplPtr;\n\t\t\tstd::unique_ptr<ProcessorAsio<ResourceType>>     processorProxyPtr;\n\t\t\tbool                                             proxy;\n\t};\n\n}\n<commit_msg>Minor improvement<commit_after>\/*\n * Copyright 2016, Andrej Kislovskij\n *\n * This is PUBLIC DOMAIN software so use at your own risk as it comes\n * with no warranties. This code is yours to share, use and modify without\n * any restrictions or obligations.\n *\n * For more information see conwrap\/LICENSE or refer refer to http:\/\/unlicense.org\n *\n * Author: gimesketvirtadieni at gmail dot com (Andrej Kislovskij)\n *\/\n\n#pragma once\n\n#include <boost\/asio.hpp>\n#include <functional>\n#include <memory>\n#include <mutex>\n#include <thread>\n#include <conwrap\/HandlerContext.hpp>\n#include <conwrap\/HandlerWrapper.hpp>\n#include <conwrap\/Processor.hpp>\n#include <conwrap\/ProcessorQueue.hpp>\n\n\nnamespace conwrap\n{\n\n\ttemplate <typename ResourceType>\n\tclass ProcessorAsio : public Processor<ResourceType>\n\t{\n\t\tpublic:\n\t\t\ttemplate <typename... Args>\n\t\t\tProcessorAsio(Args... args)\n\t\t\t: processorImplPtr(std::make_shared<ProcessorAsioImpl<ResourceType>>(std::move(std::make_unique<ResourceType>(this, std::forward<Args>(args)...))))\n\t\t\t, processorProxyPtr(std::unique_ptr<ProcessorAsio<ResourceType>>(new ProcessorAsio<ResourceType>(processorImplPtr)))\n\t\t\t, proxy(false)\n\t\t\t{\n\t\t\t\tprocessorImplPtr->start();\n\t\t\t}\n\n\t\t\ttemplate <typename... Args>\n\t\t\tProcessorAsio(std::unique_ptr<ResourceType> resource)\n\t\t\t: processorImplPtr(std::make_shared<ProcessorAsioImpl<ResourceType>>(std::move(resource)))\n\t\t\t, processorProxyPtr(std::unique_ptr<ProcessorAsio<ResourceType>>(new ProcessorAsio<ResourceType>(processorImplPtr)))\n\t\t\t, proxy(false)\n\t\t\t{\n\t\t\t\tprocessorImplPtr->start();\n\t\t\t}\n\n\t\t\tvirtual ~ProcessorAsio()\n\t\t\t{\n\t\t\t\tif (!proxy)\n\t\t\t\t{\n\t\t\t\t\tprocessorImplPtr->stop();\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tboost::asio::io_service* getDispatcher()\n\t\t\t{\n\t\t\t\treturn processorImplPtr->getDispatcher();\n\t\t\t}\n\n\t\t\tvirtual ResourceType* getResource() override\n\t\t\t{\n\t\t\t\treturn processorImplPtr->getResource();\n\t\t\t}\n\n\t\t\tvirtual void flush() override\n\t\t\t{\n\t\t\t\tprocessorImplPtr->flush();\n\t\t\t}\n\n\t\t\tvirtual HandlerWrapper wrapHandler(std::function<void()> handler) override\n\t\t\t{\n\t\t\t\treturn processorImplPtr->wrapHandler(handler);\n\t\t\t}\n\n\t\tprotected:\n\t\t\ttemplate <typename ResourceType2>\n\t\t\tclass ProcessorAsioImpl : public Processor<ResourceType2>\n\t\t\t{\n\t\t\t\tpublic:\n\t\t\t\t\ttemplate <typename... Args>\n\t\t\t\t\tProcessorAsioImpl(std::unique_ptr<ResourceType2> r)\n\t\t\t\t\t: processorQueue(std::move(r)) {}\n\n\t\t\t\t\tvirtual ~ProcessorAsioImpl() {}\n\n\t\t\t\t\tboost::asio::io_service* getDispatcher()\n\t\t\t\t\t{\n\t\t\t\t\t\treturn &dispatcher;\n\t\t\t\t\t}\n\n\t\t\t\t\tvirtual ResourceType2* getResource() override\n\t\t\t\t\t{\n\t\t\t\t\t\treturn processorQueue.getResource();\n\t\t\t\t\t}\n\n\t\t\t\t\tvirtual void flush() override\n\t\t\t\t\t{\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tstd::lock_guard<std::recursive_mutex> guard(lock);\n\n\t\t\t\t\t\t\t\/\/ TODO: redesign to avoid invoking stop-start as it changes running thread\n\t\t\t\t\t\t\tif (thread.joinable())\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\/\/ stopping dispatcher will make sure all handlers are in processor queue\n\t\t\t\t\t\t\t\tstop();\n\n\t\t\t\t\t\t\t\t\/\/ start processing as flush will not be affected by incomming handlers\n\t\t\t\t\t\t\t\tstart();\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\/\/ flushing processor's queue\n\t\t\t\t\t\tprocessorQueue.flush();\n\t\t\t\t\t}\n\n\t\t\t\t\tvirtual void post(std::function<void()> handler) override\n\t\t\t\t\t{\n\t\t\t\t\t\tdispatcher.post(wrapHandler(handler));\n\t\t\t\t\t}\n\n\t\t\t\t\tvoid start()\n\t\t\t\t\t{\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tstd::lock_guard<std::recursive_mutex> guard(lock);\n\n\t\t\t\t\t\t\tif (!thread.joinable())\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\/\/ creating work object to make sure dispatcher performs until work object is deleted\n\t\t\t\t\t\t\t\tworkPtr = std::make_unique<boost::asio::io_service::work>(dispatcher);\n\n\t\t\t\t\t\t\t\t\/\/ running dispacther on its dedicated thread\n\t\t\t\t\t\t\t\tthread = std::thread([&]\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tfor (std::size_t processedCount; (processedCount = dispatcher.run()) > 0;)\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tprocessorQueue.flush();\n\t\t\t\t\t\t\t\t\t\tdispatcher.reset();\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t});\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tvoid stop()\n\t\t\t\t\t{\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tstd::lock_guard<std::recursive_mutex> guard(lock);\n\n\t\t\t\t\t\t\tif (thread.joinable())\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\/\/ reseting work object will make dispatcher exit as soon as there is no handler to process\n\t\t\t\t\t\t\t\tworkPtr.reset();\n\n\t\t\t\t\t\t\t\t\/\/ waiting for the thread to finish\n\t\t\t\t\t\t\t\tthread.join();\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t};\n\t\t\t\t\t}\n\n\t\t\t\t\tvirtual HandlerWrapper wrapHandler(std::function<void()> handler) override\n\t\t\t\t\t{\n\t\t\t\t\t\treturn HandlerWrapper([=]\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tprocessorQueue.process([=](auto)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\thandler();\n\t\t\t\t\t\t\t});\n\t\t\t\t\t\t});\n\t\t\t\t\t}\n\n\t\t\t\tprivate:\n\t\t\t\t\tProcessorQueue<ResourceType2>                  processorQueue;\n\t\t\t\t\tstd::unique_ptr<boost::asio::io_service::work> workPtr;\n\t\t\t\t\tboost::asio::io_service                        dispatcher;\n\t\t\t\t\tstd::thread                                    thread;\n\t\t\t\t\tstd::recursive_mutex                           lock;\n\t\t\t};\n\n\t\t\tProcessorAsio(std::shared_ptr<ProcessorAsioImpl<ResourceType>> processorImplPtr)\n\t\t\t: processorImplPtr(processorImplPtr)\n\t\t\t, proxy(true) {}\n\n\t\t\tvirtual void post(std::function<void()> handler) override\n\t\t\t{\n\t\t\t\tprocessorImplPtr->post(handler);\n\t\t\t}\n\n\t\tprivate:\n\t\t\tstd::shared_ptr<ProcessorAsioImpl<ResourceType>> processorImplPtr;\n\t\t\tstd::unique_ptr<ProcessorAsio<ResourceType>>     processorProxyPtr;\n\t\t\tbool                                             proxy;\n\t};\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"driver.h\"\n#include <cstdio>\n#include <string>\n#include <system_error>\n#include <vector>\n#pragma warning(push, 0)\n#include <llvm\/ADT\/SmallVector.h>\n#include <llvm\/ADT\/StringRef.h>\n#include <llvm\/ADT\/StringSet.h>\n#include <llvm\/Bitcode\/BitcodeWriter.h>\n#include <llvm\/IR\/LegacyPassManager.h>\n#include <llvm\/IR\/Module.h>\n#include <llvm\/Linker\/Linker.h>\n#include <llvm\/Support\/CodeGen.h>\n#include <llvm\/Support\/ErrorOr.h>\n#include <llvm\/Support\/FileSystem.h>\n#include <llvm\/Support\/Path.h>\n#include <llvm\/Support\/Process.h>\n#include <llvm\/Support\/Program.h>\n#include <llvm\/Support\/TargetRegistry.h>\n#include <llvm\/Support\/TargetSelect.h>\n#include <llvm\/Support\/raw_ostream.h>\n#include <llvm\/Target\/TargetMachine.h>\n#pragma warning(pop)\n#include \"clang.h\"\n#include \"..\/ast\/module.h\"\n#include \"..\/irgen\/irgen.h\"\n#include \"..\/package-manager\/manifest.h\"\n#include \"..\/package-manager\/package-manager.h\"\n#include \"..\/parser\/parse.h\"\n#include \"..\/sema\/typecheck.h\"\n#include \"..\/support\/utility.h\"\n\n#ifdef _MSC_VER\n#define popen _popen\n#define pclose _pclose\n#define WEXITSTATUS(x) x\n#endif\n\nusing namespace delta;\n\nstatic int exec(const char* command, std::string& output) {\n    FILE* pipe = popen(command, \"r\");\n    if (!pipe) {\n        ABORT(\"failed to execute '\" << command << \"'\");\n    }\n\n    try {\n        char buffer[128];\n        while (fgets(buffer, sizeof buffer, pipe)) {\n            output += buffer;\n        }\n    } catch (...) {\n        pclose(pipe);\n        throw;\n    }\n\n    int status = pclose(pipe);\n    return WEXITSTATUS(status);\n}\n\nbool delta::checkFlag(llvm::StringRef flag, std::vector<llvm::StringRef>& args) {\n    const auto it = std::find(args.begin(), args.end(), flag);\n    const bool contains = it != args.end();\n    if (contains) args.erase(it);\n    return contains;\n}\n\nstatic std::vector<std::string> collectStringOptionValues(llvm::StringRef flagPrefix, std::vector<llvm::StringRef>& args) {\n    std::vector<std::string> values;\n    for (auto arg = args.begin(); arg != args.end();) {\n        if (arg->startswith(flagPrefix)) {\n            values.push_back(arg->substr(flagPrefix.size()));\n            arg = args.erase(arg);\n        } else {\n            ++arg;\n        }\n    }\n    return values;\n}\n\nstatic std::string collectStringOptionValue(llvm::StringRef flagPrefix, std::vector<llvm::StringRef>& args) {\n    auto values = collectStringOptionValues(flagPrefix, args);\n    if (values.empty()) {\n        return \"\";\n    } else {\n        return std::move(values.back());\n    }\n}\n\nstatic void addHeaderSearchPathsFromEnvVar(std::vector<std::string>& importSearchPaths, const char* name) {\n    if (auto pathList = llvm::sys::Process::GetEnv(name)) {\n        llvm::SmallVector<llvm::StringRef, 16> paths;\n        llvm::StringRef(*pathList).split(paths, llvm::sys::EnvPathSeparator, -1, false);\n\n        for (llvm::StringRef path : paths) {\n            importSearchPaths.push_back(path);\n        }\n    }\n}\n\nstatic void addHeaderSearchPathsFromCCompilerOutput(std::vector<std::string>& importSearchPaths) {\n    auto compilerPath = getCCompilerPath();\n    if (compilerPath.empty()) return;\n\n    if (llvm::sys::path::filename(compilerPath) != \"cl.exe\") {\n        std::string command = \"echo | \" + compilerPath + \" -E -v - 2>&1 | grep '^ \/'\";\n        std::string output;\n        exec(command.c_str(), output);\n\n        llvm::SmallVector<llvm::StringRef, 8> lines;\n        llvm::SplitString(output, lines, \"\\n\");\n\n        for (auto line : lines) {\n            auto path = line.trim();\n            if (llvm::sys::fs::is_directory(path)) {\n                importSearchPaths.push_back(path);\n            }\n        }\n    }\n}\n\nstatic void addPredefinedImportSearchPaths(std::vector<std::string>& importSearchPaths, llvm::ArrayRef<std::string> inputFiles) {\n    llvm::StringSet<> relativeImportSearchPaths;\n\n    for (llvm::StringRef filePath : inputFiles) {\n        auto directoryPath = llvm::sys::path::parent_path(filePath);\n        if (directoryPath.empty()) directoryPath = \".\";\n        relativeImportSearchPaths.insert(directoryPath);\n    }\n\n    for (auto& keyValue : relativeImportSearchPaths) {\n        importSearchPaths.push_back(keyValue.getKey());\n    }\n\n    importSearchPaths.push_back(DELTA_ROOT_DIR);\n    importSearchPaths.push_back(CLANG_BUILTIN_INCLUDE_PATH);\n    addHeaderSearchPathsFromCCompilerOutput(importSearchPaths);\n    importSearchPaths.push_back(\"\/usr\/include\");\n    importSearchPaths.push_back(\"\/usr\/local\/include\");\n    addHeaderSearchPathsFromEnvVar(importSearchPaths, \"CPATH\");\n    addHeaderSearchPathsFromEnvVar(importSearchPaths, \"C_INCLUDE_PATH\");\n    addHeaderSearchPathsFromEnvVar(importSearchPaths, \"INCLUDE\");\n}\n\nstatic void emitMachineCode(llvm::Module& module, llvm::StringRef fileName, llvm::TargetMachine::CodeGenFileType fileType, llvm::Reloc::Model relocModel) {\n    llvm::InitializeNativeTarget();\n    llvm::InitializeNativeTargetAsmPrinter();\n    llvm::InitializeNativeTargetAsmParser();\n\n    llvm::Triple triple(llvm::sys::getDefaultTargetTriple());\n    const std::string& targetTriple = triple.str();\n    module.setTargetTriple(targetTriple);\n\n    std::string errorMessage;\n    auto* target = llvm::TargetRegistry::lookupTarget(targetTriple, errorMessage);\n    if (!target) ABORT(errorMessage);\n\n    llvm::TargetOptions options;\n    auto* targetMachine = target->createTargetMachine(targetTriple, \"generic\", \"\", options, relocModel);\n    module.setDataLayout(targetMachine->createDataLayout());\n\n    std::error_code error;\n    llvm::raw_fd_ostream file(fileName, error, llvm::sys::fs::F_None);\n    if (error) ABORT(error.message());\n\n    llvm::legacy::PassManager passManager;\n    if (targetMachine->addPassesToEmitFile(passManager, file, nullptr, fileType)) {\n        ABORT(\"TargetMachine can't emit a file of this type\");\n    }\n\n    passManager.run(module);\n    file.flush();\n}\n\nstatic void emitLLVMBitcode(const llvm::Module& module, llvm::StringRef fileName) {\n    std::error_code error;\n    llvm::raw_fd_ostream file(fileName, error, llvm::sys::fs::F_None);\n    if (error) ABORT(error.message());\n    llvm::WriteBitcodeToFile(module, file);\n    file.flush();\n}\n\nint delta::buildPackage(llvm::StringRef packageRoot, const char* argv0, std::vector<llvm::StringRef>& args, bool run) {\n    auto manifestPath = (packageRoot + \"\/\" + PackageManifest::manifestFileName).str();\n    PackageManifest manifest(packageRoot);\n    fetchDependencies(packageRoot);\n\n    for (auto& targetRootDir : manifest.getTargetRootDirectories()) {\n        llvm::StringRef outputFileName;\n        if (manifest.isMultiTarget() || manifest.getPackageName().empty()) {\n            outputFileName = llvm::sys::path::filename(targetRootDir);\n        } else {\n            outputFileName = manifest.getPackageName();\n        }\n        \/\/ TODO: Add support for library packages.\n        int exitStatus = buildExecutable(getSourceFiles(targetRootDir, manifestPath), &manifest, argv0, args, manifest.getOutputDirectory(),\n                                         outputFileName, run);\n        if (exitStatus != 0) return exitStatus;\n    }\n\n    return 0;\n}\n\nint delta::buildExecutable(llvm::ArrayRef<std::string> files, const PackageManifest* manifest, const char* argv0,\n                           std::vector<llvm::StringRef>& args, llvm::StringRef outputDirectory, llvm::StringRef outputFileName, bool run) {\n    CompileOptions options;\n    bool parse = checkFlag(\"-parse\", args);\n    bool typecheck = checkFlag(\"-typecheck\", args);\n    bool compileOnly = checkFlag(\"-c\", args);\n    bool printIR = checkFlag(\"-print-ir\", args);\n    bool emitAssembly = checkFlag(\"-emit-assembly\", args) || checkFlag(\"-S\", args);\n    bool emitLLVMBitcode = checkFlag(\"-emit-llvm-bitcode\", args);\n    bool emitPositionIndependentCode = checkFlag(\"-fPIC\", args);\n    if (checkFlag(\"-w\", args)) warningMode = WarningMode::Suppress;\n    if (checkFlag(\"-Werror\", args)) warningMode = WarningMode::TreatAsErrors;\n    options.disabledWarnings = collectStringOptionValues(\"-Wno-\", args);\n    options.defines = collectStringOptionValues(\"-D\", args);\n#ifdef _WIN32\n    options.defines.push_back(\"Windows\");\n#endif\n    options.importSearchPaths = collectStringOptionValues(\"-I\", args);\n    options.frameworkSearchPaths = collectStringOptionValues(\"-F\", args);\n    auto specifiedOutputFileName = collectStringOptionValue(\"-o\", args);\n    if (!specifiedOutputFileName.empty()) {\n        outputFileName = specifiedOutputFileName;\n    }\n\n    \/\/ Pass remaining options to C compiler.\n    for (llvm::StringRef arg : args) {\n        options.cflags.push_back(arg);\n    }\n\n    if (files.empty()) {\n        ABORT(\"no input files\");\n    }\n\n    addPredefinedImportSearchPaths(options.importSearchPaths, files);\n    Module module(\"main\");\n\n    for (llvm::StringRef filePath : files) {\n        Parser parser(filePath, module, options);\n        parser.parse();\n    }\n\n    if (parse) return 0;\n\n    Typechecker typechecker(options);\n    for (auto& importedModule : module.getImportedModules()) {\n        typechecker.typecheckModule(*importedModule, nullptr);\n    }\n    typechecker.typecheckModule(module, manifest);\n\n    bool treatAsLibrary = !module.getSymbolTable().contains(\"main\") && !run;\n    if (treatAsLibrary) {\n        compileOnly = true;\n    }\n\n    if (typecheck) return 0;\n\n    IRGenerator irGenerator;\n\n    for (auto* module : Module::getAllImportedModules()) {\n        irGenerator.codegenModule(*module);\n    }\n\n    auto& mainModule = irGenerator.codegenModule(module);\n\n    if (printIR) {\n        mainModule.setModuleIdentifier(\"\");\n        mainModule.setSourceFileName(\"\");\n        mainModule.print(llvm::outs(), nullptr);\n        return 0;\n    }\n\n    llvm::Module linkedModule(\"\", irGenerator.getLLVMContext());\n    llvm::Linker linker(linkedModule);\n\n    for (auto& module : irGenerator.getGeneratedModules()) {\n        bool error = linker.linkInModule(std::unique_ptr<llvm::Module>(module));\n        if (error) ABORT(\"LLVM module linking failed\");\n    }\n\n    if (emitLLVMBitcode) {\n        ::emitLLVMBitcode(linkedModule, \"output.bc\");\n        return 0;\n    }\n\n    auto ccPath = getCCompilerPath();\n    bool msvc = llvm::sys::path::extension(ccPath) == \".exe\";\n\n    llvm::SmallString<128> temporaryOutputFilePath;\n    auto* outputFileExtension = emitAssembly ? \"s\" : msvc ? \"obj\" : \"o\";\n    if (auto error = llvm::sys::fs::createTemporaryFile(\"delta\", outputFileExtension, temporaryOutputFilePath)) {\n        ABORT(error.message());\n    }\n\n    auto fileType = emitAssembly ? llvm::TargetMachine::CGFT_AssemblyFile : llvm::TargetMachine::CGFT_ObjectFile;\n    if (msvc) emitPositionIndependentCode = true;\n    auto relocModel = emitPositionIndependentCode ? llvm::Reloc::Model::PIC_ : llvm::Reloc::Model::Static;\n    emitMachineCode(linkedModule, temporaryOutputFilePath, fileType, relocModel);\n\n    if (!outputDirectory.empty()) {\n        auto error = llvm::sys::fs::create_directories(outputDirectory);\n        if (error) ABORT(error.message());\n    }\n\n    if (compileOnly || emitAssembly) {\n        llvm::SmallString<128> outputFilePath = outputDirectory;\n        llvm::sys::path::append(outputFilePath, llvm::Twine(\"output.\") + outputFileExtension);\n        renameFile(temporaryOutputFilePath, outputFilePath);\n        return 0;\n    }\n\n    \/\/ Link the output.\n\n    llvm::SmallString<128> temporaryExecutablePath;\n    const char* executableNamePattern = msvc ? \"delta-%%%%%%%%.exe\" : \"delta-%%%%%%%%.out\";\n\n    if (auto error = llvm::sys::fs::createUniqueFile(executableNamePattern, temporaryExecutablePath)) {\n        ABORT(error.message());\n    }\n\n    std::vector<const char*> ccArgs = {\n        msvc ? ccPath.c_str() : argv0,\n        temporaryOutputFilePath.c_str(),\n    };\n\n    std::string outputPathFlag = ((msvc ? \"-Fe\" : \"-o\") + temporaryExecutablePath).str();\n    ccArgs.push_back(outputPathFlag.c_str());\n\n    if (msvc) {\n        ccArgs.push_back(\"-link\");\n        ccArgs.push_back(\"-DEBUG\");\n        ccArgs.push_back(\"legacy_stdio_definitions.lib\");\n        ccArgs.push_back(\"ucrt.lib\");\n        ccArgs.push_back(\"msvcrt.lib\");\n    }\n\n    std::vector<llvm::StringRef> ccArgStringRefs(ccArgs.begin(), ccArgs.end());\n    int ccExitStatus = msvc ? llvm::sys::ExecuteAndWait(ccArgs[0], ccArgStringRefs) : invokeClang(ccArgs);\n    llvm::sys::fs::remove(temporaryOutputFilePath);\n    if (ccExitStatus != 0) return ccExitStatus;\n\n    if (run) {\n        if (auto error = llvm::sys::fs::make_absolute(temporaryExecutablePath)) {\n            ABORT(\"couldn't make an absolute path: \" << error.message());\n        }\n\n        std::string command = (temporaryExecutablePath + \" 2>&1\").str();\n        std::string output;\n        int executableExitStatus = exec(command.c_str(), output);\n        llvm::outs() << output;\n        llvm::sys::fs::remove(temporaryExecutablePath);\n\n        if (msvc) {\n            auto path = temporaryExecutablePath;\n            llvm::sys::path::replace_extension(path, \"ilk\");\n            llvm::sys::fs::remove(path);\n            llvm::sys::path::replace_extension(path, \"pdb\");\n            llvm::sys::fs::remove(path);\n        }\n\n        return executableExitStatus;\n    }\n\n    llvm::SmallString<128> outputPathPrefix = outputDirectory;\n    if (!outputPathPrefix.empty()) {\n        outputPathPrefix.append(llvm::sys::path::get_separator());\n    }\n\n    if (outputFileName.empty()) {\n        outputFileName = msvc ? \"a.exe\" : \"a.out\";\n    }\n\n    renameFile(temporaryExecutablePath, outputPathPrefix + outputFileName);\n\n    if (msvc) {\n        auto path = temporaryExecutablePath;\n        auto outputPath = outputPathPrefix;\n        outputPath += outputFileName;\n\n        llvm::sys::path::replace_extension(path, \"ilk\");\n        llvm::sys::path::replace_extension(outputPath, \"ilk\");\n        renameFile(path, outputPath);\n\n        llvm::sys::path::replace_extension(path, \"pdb\");\n        llvm::sys::path::replace_extension(outputPath, \"pdb\");\n        renameFile(path, outputPath);\n    }\n\n    return 0;\n}\n<commit_msg>Pass unknown compiler flags also to Clang\/cl.exe invocation<commit_after>#include \"driver.h\"\n#include <cstdio>\n#include <string>\n#include <system_error>\n#include <vector>\n#pragma warning(push, 0)\n#include <llvm\/ADT\/SmallVector.h>\n#include <llvm\/ADT\/StringRef.h>\n#include <llvm\/ADT\/StringSet.h>\n#include <llvm\/Bitcode\/BitcodeWriter.h>\n#include <llvm\/IR\/LegacyPassManager.h>\n#include <llvm\/IR\/Module.h>\n#include <llvm\/Linker\/Linker.h>\n#include <llvm\/Support\/CodeGen.h>\n#include <llvm\/Support\/ErrorOr.h>\n#include <llvm\/Support\/FileSystem.h>\n#include <llvm\/Support\/Path.h>\n#include <llvm\/Support\/Process.h>\n#include <llvm\/Support\/Program.h>\n#include <llvm\/Support\/TargetRegistry.h>\n#include <llvm\/Support\/TargetSelect.h>\n#include <llvm\/Support\/raw_ostream.h>\n#include <llvm\/Target\/TargetMachine.h>\n#pragma warning(pop)\n#include \"clang.h\"\n#include \"..\/ast\/module.h\"\n#include \"..\/irgen\/irgen.h\"\n#include \"..\/package-manager\/manifest.h\"\n#include \"..\/package-manager\/package-manager.h\"\n#include \"..\/parser\/parse.h\"\n#include \"..\/sema\/typecheck.h\"\n#include \"..\/support\/utility.h\"\n\n#ifdef _MSC_VER\n#define popen _popen\n#define pclose _pclose\n#define WEXITSTATUS(x) x\n#endif\n\nusing namespace delta;\n\nstatic int exec(const char* command, std::string& output) {\n    FILE* pipe = popen(command, \"r\");\n    if (!pipe) {\n        ABORT(\"failed to execute '\" << command << \"'\");\n    }\n\n    try {\n        char buffer[128];\n        while (fgets(buffer, sizeof buffer, pipe)) {\n            output += buffer;\n        }\n    } catch (...) {\n        pclose(pipe);\n        throw;\n    }\n\n    int status = pclose(pipe);\n    return WEXITSTATUS(status);\n}\n\nbool delta::checkFlag(llvm::StringRef flag, std::vector<llvm::StringRef>& args) {\n    const auto it = std::find(args.begin(), args.end(), flag);\n    const bool contains = it != args.end();\n    if (contains) args.erase(it);\n    return contains;\n}\n\nstatic std::vector<std::string> collectStringOptionValues(llvm::StringRef flagPrefix, std::vector<llvm::StringRef>& args) {\n    std::vector<std::string> values;\n    for (auto arg = args.begin(); arg != args.end();) {\n        if (arg->startswith(flagPrefix)) {\n            values.push_back(arg->substr(flagPrefix.size()));\n            arg = args.erase(arg);\n        } else {\n            ++arg;\n        }\n    }\n    return values;\n}\n\nstatic std::string collectStringOptionValue(llvm::StringRef flagPrefix, std::vector<llvm::StringRef>& args) {\n    auto values = collectStringOptionValues(flagPrefix, args);\n    if (values.empty()) {\n        return \"\";\n    } else {\n        return std::move(values.back());\n    }\n}\n\nstatic void addHeaderSearchPathsFromEnvVar(std::vector<std::string>& importSearchPaths, const char* name) {\n    if (auto pathList = llvm::sys::Process::GetEnv(name)) {\n        llvm::SmallVector<llvm::StringRef, 16> paths;\n        llvm::StringRef(*pathList).split(paths, llvm::sys::EnvPathSeparator, -1, false);\n\n        for (llvm::StringRef path : paths) {\n            importSearchPaths.push_back(path);\n        }\n    }\n}\n\nstatic void addHeaderSearchPathsFromCCompilerOutput(std::vector<std::string>& importSearchPaths) {\n    auto compilerPath = getCCompilerPath();\n    if (compilerPath.empty()) return;\n\n    if (llvm::sys::path::filename(compilerPath) != \"cl.exe\") {\n        std::string command = \"echo | \" + compilerPath + \" -E -v - 2>&1 | grep '^ \/'\";\n        std::string output;\n        exec(command.c_str(), output);\n\n        llvm::SmallVector<llvm::StringRef, 8> lines;\n        llvm::SplitString(output, lines, \"\\n\");\n\n        for (auto line : lines) {\n            auto path = line.trim();\n            if (llvm::sys::fs::is_directory(path)) {\n                importSearchPaths.push_back(path);\n            }\n        }\n    }\n}\n\nstatic void addPredefinedImportSearchPaths(std::vector<std::string>& importSearchPaths, llvm::ArrayRef<std::string> inputFiles) {\n    llvm::StringSet<> relativeImportSearchPaths;\n\n    for (llvm::StringRef filePath : inputFiles) {\n        auto directoryPath = llvm::sys::path::parent_path(filePath);\n        if (directoryPath.empty()) directoryPath = \".\";\n        relativeImportSearchPaths.insert(directoryPath);\n    }\n\n    for (auto& keyValue : relativeImportSearchPaths) {\n        importSearchPaths.push_back(keyValue.getKey());\n    }\n\n    importSearchPaths.push_back(DELTA_ROOT_DIR);\n    importSearchPaths.push_back(CLANG_BUILTIN_INCLUDE_PATH);\n    addHeaderSearchPathsFromCCompilerOutput(importSearchPaths);\n    importSearchPaths.push_back(\"\/usr\/include\");\n    importSearchPaths.push_back(\"\/usr\/local\/include\");\n    addHeaderSearchPathsFromEnvVar(importSearchPaths, \"CPATH\");\n    addHeaderSearchPathsFromEnvVar(importSearchPaths, \"C_INCLUDE_PATH\");\n    addHeaderSearchPathsFromEnvVar(importSearchPaths, \"INCLUDE\");\n}\n\nstatic void emitMachineCode(llvm::Module& module, llvm::StringRef fileName, llvm::TargetMachine::CodeGenFileType fileType, llvm::Reloc::Model relocModel) {\n    llvm::InitializeNativeTarget();\n    llvm::InitializeNativeTargetAsmPrinter();\n    llvm::InitializeNativeTargetAsmParser();\n\n    llvm::Triple triple(llvm::sys::getDefaultTargetTriple());\n    const std::string& targetTriple = triple.str();\n    module.setTargetTriple(targetTriple);\n\n    std::string errorMessage;\n    auto* target = llvm::TargetRegistry::lookupTarget(targetTriple, errorMessage);\n    if (!target) ABORT(errorMessage);\n\n    llvm::TargetOptions options;\n    auto* targetMachine = target->createTargetMachine(targetTriple, \"generic\", \"\", options, relocModel);\n    module.setDataLayout(targetMachine->createDataLayout());\n\n    std::error_code error;\n    llvm::raw_fd_ostream file(fileName, error, llvm::sys::fs::F_None);\n    if (error) ABORT(error.message());\n\n    llvm::legacy::PassManager passManager;\n    if (targetMachine->addPassesToEmitFile(passManager, file, nullptr, fileType)) {\n        ABORT(\"TargetMachine can't emit a file of this type\");\n    }\n\n    passManager.run(module);\n    file.flush();\n}\n\nstatic void emitLLVMBitcode(const llvm::Module& module, llvm::StringRef fileName) {\n    std::error_code error;\n    llvm::raw_fd_ostream file(fileName, error, llvm::sys::fs::F_None);\n    if (error) ABORT(error.message());\n    llvm::WriteBitcodeToFile(module, file);\n    file.flush();\n}\n\nint delta::buildPackage(llvm::StringRef packageRoot, const char* argv0, std::vector<llvm::StringRef>& args, bool run) {\n    auto manifestPath = (packageRoot + \"\/\" + PackageManifest::manifestFileName).str();\n    PackageManifest manifest(packageRoot);\n    fetchDependencies(packageRoot);\n\n    for (auto& targetRootDir : manifest.getTargetRootDirectories()) {\n        llvm::StringRef outputFileName;\n        if (manifest.isMultiTarget() || manifest.getPackageName().empty()) {\n            outputFileName = llvm::sys::path::filename(targetRootDir);\n        } else {\n            outputFileName = manifest.getPackageName();\n        }\n        \/\/ TODO: Add support for library packages.\n        int exitStatus = buildExecutable(getSourceFiles(targetRootDir, manifestPath), &manifest, argv0, args, manifest.getOutputDirectory(),\n                                         outputFileName, run);\n        if (exitStatus != 0) return exitStatus;\n    }\n\n    return 0;\n}\n\nint delta::buildExecutable(llvm::ArrayRef<std::string> files, const PackageManifest* manifest, const char* argv0,\n                           std::vector<llvm::StringRef>& args, llvm::StringRef outputDirectory, llvm::StringRef outputFileName, bool run) {\n    CompileOptions options;\n    bool parse = checkFlag(\"-parse\", args);\n    bool typecheck = checkFlag(\"-typecheck\", args);\n    bool compileOnly = checkFlag(\"-c\", args);\n    bool printIR = checkFlag(\"-print-ir\", args);\n    bool emitAssembly = checkFlag(\"-emit-assembly\", args) || checkFlag(\"-S\", args);\n    bool emitLLVMBitcode = checkFlag(\"-emit-llvm-bitcode\", args);\n    bool emitPositionIndependentCode = checkFlag(\"-fPIC\", args);\n    if (checkFlag(\"-w\", args)) warningMode = WarningMode::Suppress;\n    if (checkFlag(\"-Werror\", args)) warningMode = WarningMode::TreatAsErrors;\n    options.disabledWarnings = collectStringOptionValues(\"-Wno-\", args);\n    options.defines = collectStringOptionValues(\"-D\", args);\n#ifdef _WIN32\n    options.defines.push_back(\"Windows\");\n#endif\n    options.importSearchPaths = collectStringOptionValues(\"-I\", args);\n    options.frameworkSearchPaths = collectStringOptionValues(\"-F\", args);\n    auto specifiedOutputFileName = collectStringOptionValue(\"-o\", args);\n    if (!specifiedOutputFileName.empty()) {\n        outputFileName = specifiedOutputFileName;\n    }\n\n    \/\/ Pass remaining options to C compiler.\n    for (llvm::StringRef arg : args) {\n        options.cflags.push_back(arg);\n    }\n\n    if (files.empty()) {\n        ABORT(\"no input files\");\n    }\n\n    addPredefinedImportSearchPaths(options.importSearchPaths, files);\n    Module module(\"main\");\n\n    for (llvm::StringRef filePath : files) {\n        Parser parser(filePath, module, options);\n        parser.parse();\n    }\n\n    if (parse) return 0;\n\n    Typechecker typechecker(options);\n    for (auto& importedModule : module.getImportedModules()) {\n        typechecker.typecheckModule(*importedModule, nullptr);\n    }\n    typechecker.typecheckModule(module, manifest);\n\n    bool treatAsLibrary = !module.getSymbolTable().contains(\"main\") && !run;\n    if (treatAsLibrary) {\n        compileOnly = true;\n    }\n\n    if (typecheck) return 0;\n\n    IRGenerator irGenerator;\n\n    for (auto* module : Module::getAllImportedModules()) {\n        irGenerator.codegenModule(*module);\n    }\n\n    auto& mainModule = irGenerator.codegenModule(module);\n\n    if (printIR) {\n        mainModule.setModuleIdentifier(\"\");\n        mainModule.setSourceFileName(\"\");\n        mainModule.print(llvm::outs(), nullptr);\n        return 0;\n    }\n\n    llvm::Module linkedModule(\"\", irGenerator.getLLVMContext());\n    llvm::Linker linker(linkedModule);\n\n    for (auto& module : irGenerator.getGeneratedModules()) {\n        bool error = linker.linkInModule(std::unique_ptr<llvm::Module>(module));\n        if (error) ABORT(\"LLVM module linking failed\");\n    }\n\n    if (emitLLVMBitcode) {\n        ::emitLLVMBitcode(linkedModule, \"output.bc\");\n        return 0;\n    }\n\n    auto ccPath = getCCompilerPath();\n    bool msvc = llvm::sys::path::extension(ccPath) == \".exe\";\n\n    llvm::SmallString<128> temporaryOutputFilePath;\n    auto* outputFileExtension = emitAssembly ? \"s\" : msvc ? \"obj\" : \"o\";\n    if (auto error = llvm::sys::fs::createTemporaryFile(\"delta\", outputFileExtension, temporaryOutputFilePath)) {\n        ABORT(error.message());\n    }\n\n    auto fileType = emitAssembly ? llvm::TargetMachine::CGFT_AssemblyFile : llvm::TargetMachine::CGFT_ObjectFile;\n    if (msvc) emitPositionIndependentCode = true;\n    auto relocModel = emitPositionIndependentCode ? llvm::Reloc::Model::PIC_ : llvm::Reloc::Model::Static;\n    emitMachineCode(linkedModule, temporaryOutputFilePath, fileType, relocModel);\n\n    if (!outputDirectory.empty()) {\n        auto error = llvm::sys::fs::create_directories(outputDirectory);\n        if (error) ABORT(error.message());\n    }\n\n    if (compileOnly || emitAssembly) {\n        llvm::SmallString<128> outputFilePath = outputDirectory;\n        llvm::sys::path::append(outputFilePath, llvm::Twine(\"output.\") + outputFileExtension);\n        renameFile(temporaryOutputFilePath, outputFilePath);\n        return 0;\n    }\n\n    \/\/ Link the output.\n\n    llvm::SmallString<128> temporaryExecutablePath;\n    const char* executableNamePattern = msvc ? \"delta-%%%%%%%%.exe\" : \"delta-%%%%%%%%.out\";\n\n    if (auto error = llvm::sys::fs::createUniqueFile(executableNamePattern, temporaryExecutablePath)) {\n        ABORT(error.message());\n    }\n\n    std::vector<const char*> ccArgs = {\n        msvc ? ccPath.c_str() : argv0,\n        temporaryOutputFilePath.c_str(),\n    };\n\n    std::string outputPathFlag = ((msvc ? \"-Fe\" : \"-o\") + temporaryExecutablePath).str();\n    ccArgs.push_back(outputPathFlag.c_str());\n\n    for (auto& cflag : options.cflags) {\n        ccArgs.push_back(cflag.c_str());\n    }\n\n    if (msvc) {\n        ccArgs.push_back(\"-link\");\n        ccArgs.push_back(\"-DEBUG\");\n        ccArgs.push_back(\"legacy_stdio_definitions.lib\");\n        ccArgs.push_back(\"ucrt.lib\");\n        ccArgs.push_back(\"msvcrt.lib\");\n    }\n\n    std::vector<llvm::StringRef> ccArgStringRefs(ccArgs.begin(), ccArgs.end());\n    int ccExitStatus = msvc ? llvm::sys::ExecuteAndWait(ccArgs[0], ccArgStringRefs) : invokeClang(ccArgs);\n    llvm::sys::fs::remove(temporaryOutputFilePath);\n    if (ccExitStatus != 0) return ccExitStatus;\n\n    if (run) {\n        if (auto error = llvm::sys::fs::make_absolute(temporaryExecutablePath)) {\n            ABORT(\"couldn't make an absolute path: \" << error.message());\n        }\n\n        std::string command = (temporaryExecutablePath + \" 2>&1\").str();\n        std::string output;\n        int executableExitStatus = exec(command.c_str(), output);\n        llvm::outs() << output;\n        llvm::sys::fs::remove(temporaryExecutablePath);\n\n        if (msvc) {\n            auto path = temporaryExecutablePath;\n            llvm::sys::path::replace_extension(path, \"ilk\");\n            llvm::sys::fs::remove(path);\n            llvm::sys::path::replace_extension(path, \"pdb\");\n            llvm::sys::fs::remove(path);\n        }\n\n        return executableExitStatus;\n    }\n\n    llvm::SmallString<128> outputPathPrefix = outputDirectory;\n    if (!outputPathPrefix.empty()) {\n        outputPathPrefix.append(llvm::sys::path::get_separator());\n    }\n\n    if (outputFileName.empty()) {\n        outputFileName = msvc ? \"a.exe\" : \"a.out\";\n    }\n\n    renameFile(temporaryExecutablePath, outputPathPrefix + outputFileName);\n\n    if (msvc) {\n        auto path = temporaryExecutablePath;\n        auto outputPath = outputPathPrefix;\n        outputPath += outputFileName;\n\n        llvm::sys::path::replace_extension(path, \"ilk\");\n        llvm::sys::path::replace_extension(outputPath, \"ilk\");\n        renameFile(path, outputPath);\n\n        llvm::sys::path::replace_extension(path, \"pdb\");\n        llvm::sys::path::replace_extension(outputPath, \"pdb\");\n        renameFile(path, outputPath);\n    }\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- mode: C++ ; c-file-style: \"stroustrup\" -*- *****************************\n * Qwt Widget Library\n * Copyright (C) 1997   Josef Wilgen\n * Copyright (C) 2002   Uwe Rathmann\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the Qwt License, Version 1.0\n *****************************************************************************\/\n\n#include <qpainter.h>\n#include \"qwt_polygon.h\"\n#include \"qwt_scale_map.h\"\n#include \"qwt_painter.h\"\n#include \"qwt_plot_intervalcurve.h\"\n\nclass QwtPlotIntervalCurve::PrivateData\n{\npublic:\n    PrivateData():\n        curveStyle(Tube),\n        symbolStyle(NoSymbol),\n        pen(Qt::black, 0)\n    {\n    }\n\n    CurveStyle curveStyle;\n    SymbolStyle symbolStyle;\n\n    QPen pen;\n    QBrush brush;\n};\n\n\/*!\n  \\brief Ctor\n  \\param title title of the curve   \n*\/\nQwtPlotIntervalCurve::QwtPlotIntervalCurve(const QwtText &title):\n    QwtPlotSeriesItem<QwtIntervalSample>(title)\n{\n    init();\n}\n\n\/*!\n  \\brief Ctor\n  \\param title title of the curve   \n*\/\nQwtPlotIntervalCurve::QwtPlotIntervalCurve(const QString &title):\n    QwtPlotSeriesItem<QwtIntervalSample>(QwtText(title))\n{\n    init();\n}\n\n\/\/! Dtor\nQwtPlotIntervalCurve::~QwtPlotIntervalCurve()\n{\n    delete d_data;\n}\n\n\/*!\n  \\brief Initialize data members\n*\/\nvoid QwtPlotIntervalCurve::init()\n{\n    setItemAttribute(QwtPlotItem::Legend);\n    setItemAttribute(QwtPlotItem::AutoScale);\n\n    d_data = new PrivateData;\n    d_series = new QwtIntervalSeriesData();\n\n    setZ(19.0);\n}\n\nint QwtPlotIntervalCurve::rtti() const\n{\n    return QwtPlotIntervalCurve::Rtti_PlotIntervalCurve;\n}\n\nvoid QwtPlotIntervalCurve::setData(\n    const QwtArray<QwtIntervalSample> &data)\n{\n    QwtPlotSeriesItem<QwtIntervalSample>::setData(\n        QwtIntervalSeriesData(data));\n}\n\nvoid QwtPlotIntervalCurve::setData(\n    const QwtSeriesData<QwtIntervalSample> &data)\n{\n    QwtPlotSeriesItem<QwtIntervalSample>::setData(data);\n}\n\nvoid QwtPlotIntervalCurve::setCurveStyle(CurveStyle style)\n{\n    if ( style != d_data->curveStyle )\n    {\n        d_data->curveStyle = style;\n        itemChanged();\n    }\n}\n\n\/*!\n    \\brief Return the current style\n    \\sa setStyle\n*\/\nQwtPlotIntervalCurve::CurveStyle QwtPlotIntervalCurve::curveStyle() const \n{ \n    return d_data->curveStyle; \n}\n\nvoid QwtPlotIntervalCurve::setSymbolStyle(SymbolStyle style)\n{\n    if ( style != d_data->symbolStyle )\n    {\n        d_data->symbolStyle = style;\n        itemChanged();\n    }\n}\n\nconst QwtPlotIntervalCurve::SymbolStyle &\nQwtPlotIntervalCurve::symbolStyle() const \n{ \n    return d_data->symbolStyle; \n}\n\n\/*!\n  \\brief Assign a pen\n  \\param p New pen\n  \\sa pen(), brush()\n*\/\nvoid QwtPlotIntervalCurve::setPen(const QPen &p)\n{\n    if ( p != d_data->pen )\n    {\n        d_data->pen = p;\n        itemChanged();\n    }\n}\n\n\/*!\n    \\brief Return the pen used to draw the lines\n    \\sa setPen(), brush()\n*\/\nconst QPen& QwtPlotIntervalCurve::pen() const \n{ \n    return d_data->pen; \n}\n\nvoid QwtPlotIntervalCurve::setBrush(const QBrush &brush)\n{\n    if ( brush != d_data->brush )\n    {\n        d_data->brush = brush;\n        itemChanged();\n    }\n}\n\nconst QBrush& QwtPlotIntervalCurve::brush() const \n{\n    return d_data->brush;\n}\n\n\/*!\n  \\brief Draw the complete curve\n\n  \\param painter Painter\n  \\param xMap Maps x-values into pixel coordinates.\n  \\param yMap Maps y-values into pixel coordinates.\n\n  \\sa drawCurve(), drawSymbols()\n*\/\nvoid QwtPlotIntervalCurve::draw(QPainter *painter,\n    const QwtScaleMap &xMap, const QwtScaleMap &yMap,\n    const QRect &) const\n{\n    draw(painter, xMap, yMap, 0, -1);\n}\n\nvoid QwtPlotIntervalCurve::draw(QPainter *painter,\n    const QwtScaleMap &xMap, const QwtScaleMap &yMap, \n    int from, int to) const\n{\n    if (to < 0)\n        to = dataSize() - 1;\n\n    if ( from < 0 )\n        from = 0;\n\n    if ( from >= to )\n        return;\n        \n    switch(d_data->curveStyle)\n    {\n        case Tube:\n            drawTube(painter, xMap, yMap, from, to);\n            break;\n        case NoCurve:\n        default:\n            break;\n    }\n\n    if ( d_data->symbolStyle != NoSymbol )\n    {\n        drawSymbols(painter, xMap, yMap, from, to);\n    }\n}\n\nvoid QwtPlotIntervalCurve::drawTube(QPainter *painter, \n    const QwtScaleMap &xMap, const QwtScaleMap &yMap, \n    int from, int to) const\n{\n    painter->save();\n\n    const size_t size = dataSize();\n    QwtPolygon minValues(size);\n    QwtPolygon maxValues(size);\n\n    for ( int i = from; i <= to; i++ )\n    {\n        const QwtIntervalSample intervalSample = sample(i);\n        QPoint &minValue = minValues[i];\n        QPoint &maxValue = maxValues[to - i];\n\n        if ( curveType() == Yfx )\n        {\n            const int x = xMap.transform(intervalSample.value);\n            const int y1 = yMap.transform(intervalSample.interval.minValue());\n            const int y2 = yMap.transform(intervalSample.interval.maxValue());\n\n            minValue.setX(x);\n            minValue.setY(y1);\n            maxValue.setX(x);\n            maxValue.setY(y2);\n        }\n        else\n        {\n            const int y = yMap.transform(intervalSample.value);\n            const int x1 = xMap.transform(intervalSample.interval.minValue());\n            const int x2 = xMap.transform(intervalSample.interval.maxValue());\n\n            minValue.setX(x1);\n            minValue.setY(y);\n            maxValue.setX(x2);\n            maxValue.setY(y);\n        }\n    }\n\n    painter->setPen(d_data->pen);\n    painter->setBrush(Qt::NoBrush);\n\n    QwtPainter::drawPolyline(painter, minValues);\n    QwtPainter::drawPolyline(painter, maxValues);\n\n    minValues += maxValues;\n    maxValues.clear();\n\n    painter->setPen(Qt::NoPen);\n    painter->setBrush(d_data->brush);\n\n    QwtPainter::drawPolygon(painter, minValues);\n\n    painter->restore();\n}\n\nvoid QwtPlotIntervalCurve::drawSymbols(\n    QPainter *painter, const QwtScaleMap &xMap, const QwtScaleMap &yMap, \n    int from, int to) const\n{\n    painter->save();\n\n    painter->setPen(d_data->pen);\n\n    for ( int i = from; i <= to; i++ )\n    {\n        const QwtIntervalSample intervalSample = sample(i);\n\n        QPoint p[2];\n\n        if ( curveType() == Yfx )\n        {\n            const int x = xMap.transform(intervalSample.value);\n            const int y1 = yMap.transform(intervalSample.interval.minValue());\n            const int y2 = yMap.transform(intervalSample.interval.maxValue());\n\n            p[0].setX(x);\n            p[0].setY(y1);\n            p[1].setX(x);\n            p[1].setY(y2);\n        }\n        else\n        {\n            const int y = yMap.transform(intervalSample.value);\n            const int x1 = xMap.transform(intervalSample.interval.minValue());\n            const int x2 = xMap.transform(intervalSample.interval.maxValue());\n\n            p[0].setX(x1);\n            p[0].setY(y);\n            p[1].setX(x2);\n            p[1].setY(y);\n        }\n\n        switch(d_data->symbolStyle)\n        {\n            case Bar:\n                drawBar(painter, i, p[0], p[1]);\n                break;\n            default:;\n        }\n    }\n\n    painter->restore();\n}\n\nvoid QwtPlotIntervalCurve::drawBar(QPainter *painter, int,\n    const QPoint& from, const QPoint& to ) const\n{\n    const int capWidth = 3;\n\n    QwtPainter::drawLine(painter, from, to);\n    if ( curveType() == Yfx )\n    {\n        const int x1 = from.x() - capWidth;\n        const int x2 = from.x() + capWidth;\n\n        QwtPainter::drawLine(painter, x1, from.y(), x2, from.y());\n        QwtPainter::drawLine(painter, x1, to.y(), x2, to.y());\n    }\n    else\n    {\n        const int y1 = from.y() - capWidth;\n        const int y2 = from.y() + capWidth;\n\n        QwtPainter::drawLine(painter, from.x(), y1, from.x(), y1);\n        QwtPainter::drawLine(painter, from.x(), y2, from.x(), y2);\n    }\n}\n\nvoid QwtPlotIntervalCurve::updateLegend(QwtLegend *) const\n{\n}\n<commit_msg>Qt3 compiler errors fixed<commit_after>\/* -*- mode: C++ ; c-file-style: \"stroustrup\" -*- *****************************\n * Qwt Widget Library\n * Copyright (C) 1997   Josef Wilgen\n * Copyright (C) 2002   Uwe Rathmann\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the Qwt License, Version 1.0\n *****************************************************************************\/\n\n#include <qpainter.h>\n#include \"qwt_polygon.h\"\n#include \"qwt_scale_map.h\"\n#include \"qwt_painter.h\"\n#include \"qwt_plot_intervalcurve.h\"\n\nclass QwtPlotIntervalCurve::PrivateData\n{\npublic:\n    PrivateData():\n        curveStyle(Tube),\n        symbolStyle(NoSymbol),\n        pen(Qt::black, 0)\n    {\n    }\n\n    CurveStyle curveStyle;\n    SymbolStyle symbolStyle;\n\n    QPen pen;\n    QBrush brush;\n};\n\n\/*!\n  \\brief Ctor\n  \\param title title of the curve   \n*\/\nQwtPlotIntervalCurve::QwtPlotIntervalCurve(const QwtText &title):\n    QwtPlotSeriesItem<QwtIntervalSample>(title)\n{\n    init();\n}\n\n\/*!\n  \\brief Ctor\n  \\param title title of the curve   \n*\/\nQwtPlotIntervalCurve::QwtPlotIntervalCurve(const QString &title):\n    QwtPlotSeriesItem<QwtIntervalSample>(QwtText(title))\n{\n    init();\n}\n\n\/\/! Dtor\nQwtPlotIntervalCurve::~QwtPlotIntervalCurve()\n{\n    delete d_data;\n}\n\n\/*!\n  \\brief Initialize data members\n*\/\nvoid QwtPlotIntervalCurve::init()\n{\n    setItemAttribute(QwtPlotItem::Legend);\n    setItemAttribute(QwtPlotItem::AutoScale);\n\n    d_data = new PrivateData;\n    d_series = new QwtIntervalSeriesData();\n\n    setZ(19.0);\n}\n\nint QwtPlotIntervalCurve::rtti() const\n{\n    return QwtPlotIntervalCurve::Rtti_PlotIntervalCurve;\n}\n\nvoid QwtPlotIntervalCurve::setData(\n    const QwtArray<QwtIntervalSample> &data)\n{\n    QwtPlotSeriesItem<QwtIntervalSample>::setData(\n        QwtIntervalSeriesData(data));\n}\n\nvoid QwtPlotIntervalCurve::setData(\n    const QwtSeriesData<QwtIntervalSample> &data)\n{\n    QwtPlotSeriesItem<QwtIntervalSample>::setData(data);\n}\n\nvoid QwtPlotIntervalCurve::setCurveStyle(CurveStyle style)\n{\n    if ( style != d_data->curveStyle )\n    {\n        d_data->curveStyle = style;\n        itemChanged();\n    }\n}\n\n\/*!\n    \\brief Return the current style\n    \\sa setStyle\n*\/\nQwtPlotIntervalCurve::CurveStyle QwtPlotIntervalCurve::curveStyle() const \n{ \n    return d_data->curveStyle; \n}\n\nvoid QwtPlotIntervalCurve::setSymbolStyle(SymbolStyle style)\n{\n    if ( style != d_data->symbolStyle )\n    {\n        d_data->symbolStyle = style;\n        itemChanged();\n    }\n}\n\nconst QwtPlotIntervalCurve::SymbolStyle &\nQwtPlotIntervalCurve::symbolStyle() const \n{ \n    return d_data->symbolStyle; \n}\n\n\/*!\n  \\brief Assign a pen\n  \\param p New pen\n  \\sa pen(), brush()\n*\/\nvoid QwtPlotIntervalCurve::setPen(const QPen &p)\n{\n    if ( p != d_data->pen )\n    {\n        d_data->pen = p;\n        itemChanged();\n    }\n}\n\n\/*!\n    \\brief Return the pen used to draw the lines\n    \\sa setPen(), brush()\n*\/\nconst QPen& QwtPlotIntervalCurve::pen() const \n{ \n    return d_data->pen; \n}\n\nvoid QwtPlotIntervalCurve::setBrush(const QBrush &brush)\n{\n    if ( brush != d_data->brush )\n    {\n        d_data->brush = brush;\n        itemChanged();\n    }\n}\n\nconst QBrush& QwtPlotIntervalCurve::brush() const \n{\n    return d_data->brush;\n}\n\n\/*!\n  \\brief Draw the complete curve\n\n  \\param painter Painter\n  \\param xMap Maps x-values into pixel coordinates.\n  \\param yMap Maps y-values into pixel coordinates.\n\n  \\sa drawCurve(), drawSymbols()\n*\/\nvoid QwtPlotIntervalCurve::draw(QPainter *painter,\n    const QwtScaleMap &xMap, const QwtScaleMap &yMap,\n    const QRect &) const\n{\n    draw(painter, xMap, yMap, 0, -1);\n}\n\nvoid QwtPlotIntervalCurve::draw(QPainter *painter,\n    const QwtScaleMap &xMap, const QwtScaleMap &yMap, \n    int from, int to) const\n{\n    if (to < 0)\n        to = dataSize() - 1;\n\n    if ( from < 0 )\n        from = 0;\n\n    if ( from >= to )\n        return;\n        \n    switch(d_data->curveStyle)\n    {\n        case Tube:\n            drawTube(painter, xMap, yMap, from, to);\n            break;\n        case NoCurve:\n        default:\n            break;\n    }\n\n    if ( d_data->symbolStyle != NoSymbol )\n    {\n        drawSymbols(painter, xMap, yMap, from, to);\n    }\n}\n\nvoid QwtPlotIntervalCurve::drawTube(QPainter *painter, \n    const QwtScaleMap &xMap, const QwtScaleMap &yMap, \n    int from, int to) const\n{\n    painter->save();\n\n    const size_t size = dataSize();\n    QwtPolygon minValues(size);\n    QwtPolygon maxValues(size);\n\n    for ( int i = from; i <= to; i++ )\n    {\n        const QwtIntervalSample intervalSample = sample(i);\n        QPoint &minValue = minValues[i];\n        QPoint &maxValue = maxValues[to - i];\n\n        if ( curveType() == Yfx )\n        {\n            const int x = xMap.transform(intervalSample.value);\n            const int y1 = yMap.transform(intervalSample.interval.minValue());\n            const int y2 = yMap.transform(intervalSample.interval.maxValue());\n\n            minValue.setX(x);\n            minValue.setY(y1);\n            maxValue.setX(x);\n            maxValue.setY(y2);\n        }\n        else\n        {\n            const int y = yMap.transform(intervalSample.value);\n            const int x1 = xMap.transform(intervalSample.interval.minValue());\n            const int x2 = xMap.transform(intervalSample.interval.maxValue());\n\n            minValue.setX(x1);\n            minValue.setY(y);\n            maxValue.setX(x2);\n            maxValue.setY(y);\n        }\n    }\n\n    painter->setPen(d_data->pen);\n    painter->setBrush(Qt::NoBrush);\n\n    QwtPainter::drawPolyline(painter, minValues);\n    QwtPainter::drawPolyline(painter, maxValues);\n\n#if QT_VERSION < 0x040000\n    minValues.resize(minValues.size() + maxValues.size());\n    minValues.putPoints(minValues.size(), maxValues.size(), maxValues);\n#else\n    minValues += maxValues;\n    maxValues.clear();\n#endif\n\n    painter->setPen(Qt::NoPen);\n    painter->setBrush(d_data->brush);\n\n    QwtPainter::drawPolygon(painter, minValues);\n\n    painter->restore();\n}\n\nvoid QwtPlotIntervalCurve::drawSymbols(\n    QPainter *painter, const QwtScaleMap &xMap, const QwtScaleMap &yMap, \n    int from, int to) const\n{\n    painter->save();\n\n    painter->setPen(d_data->pen);\n\n    for ( int i = from; i <= to; i++ )\n    {\n        const QwtIntervalSample intervalSample = sample(i);\n\n        QPoint p[2];\n\n        if ( curveType() == Yfx )\n        {\n            const int x = xMap.transform(intervalSample.value);\n            const int y1 = yMap.transform(intervalSample.interval.minValue());\n            const int y2 = yMap.transform(intervalSample.interval.maxValue());\n\n            p[0].setX(x);\n            p[0].setY(y1);\n            p[1].setX(x);\n            p[1].setY(y2);\n        }\n        else\n        {\n            const int y = yMap.transform(intervalSample.value);\n            const int x1 = xMap.transform(intervalSample.interval.minValue());\n            const int x2 = xMap.transform(intervalSample.interval.maxValue());\n\n            p[0].setX(x1);\n            p[0].setY(y);\n            p[1].setX(x2);\n            p[1].setY(y);\n        }\n\n        switch(d_data->symbolStyle)\n        {\n            case Bar:\n                drawBar(painter, i, p[0], p[1]);\n                break;\n            default:;\n        }\n    }\n\n    painter->restore();\n}\n\nvoid QwtPlotIntervalCurve::drawBar(QPainter *painter, int,\n    const QPoint& from, const QPoint& to ) const\n{\n    const int capWidth = 3;\n\n    QwtPainter::drawLine(painter, from, to);\n    if ( curveType() == Yfx )\n    {\n        const int x1 = from.x() - capWidth;\n        const int x2 = from.x() + capWidth;\n\n        QwtPainter::drawLine(painter, x1, from.y(), x2, from.y());\n        QwtPainter::drawLine(painter, x1, to.y(), x2, to.y());\n    }\n    else\n    {\n        const int y1 = from.y() - capWidth;\n        const int y2 = from.y() + capWidth;\n\n        QwtPainter::drawLine(painter, from.x(), y1, from.x(), y1);\n        QwtPainter::drawLine(painter, from.x(), y2, from.x(), y2);\n    }\n}\n\nvoid QwtPlotIntervalCurve::updateLegend(QwtLegend *) const\n{\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2010-2013 RethinkDB, all rights reserved.\n#include \"cjson\/json.hpp\"\n#include \"rdb_protocol\/op.hpp\"\n#include \"rdb_protocol\/term.hpp\"\n#include \"rdb_protocol\/terms\/terms.hpp\"\n#include \"rapidjson\/document.h\"\n#include \"rapidjson\/error\/en.h\"\n#include \"rapidjson\/rapidjson.h\"\n#include \"rapidjson\/stringbuffer.h\"\n#include \"rapidjson\/writer.h\"\n\nnamespace ql {\nclass json_term_t : public op_term_t {\npublic:\n    json_term_t(compile_env_t *env, const protob_t<const Term> &term)\n        : op_term_t(env, term, argspec_t(1)) { }\n\n    scoped_ptr_t<val_t> eval_impl(scope_env_t *env, args_t *args, eval_flags_t) const {\n        const datum_string_t data = args->arg(env, 0)->as_str();\n\n        if (env->env->reql_version() < reql_version_t::v2_1) {\n            const std::string std_data = data.to_std();\n            scoped_cJSON_t cjson(cJSON_Parse(std_data.c_str()));\n            rcheck(cjson.get() != NULL, base_exc_t::GENERIC,\n                   strprintf(\"Failed to parse \\\"%s\\\" as JSON.\",\n                     (data.size() > 40\n                      ? (std_data.substr(0, 37) + \"...\").c_str()\n                      : std_data.c_str())));\n            return new_val(to_datum(cjson.get(), env->env->limits(),\n                                    env->env->reql_version()));\n        } else {\n            \/\/ Copy the string into a null-terminated c-string that we can write to,\n            \/\/ so we can use RapidJSON in-situ parsing (and at least avoid some additional\n            \/\/ copying).\n            std::vector<char> str_buf(data.size() + 1);\n            memcpy(str_buf.data(), data.data(), data.size());\n            for (size_t i = 0; i < data.size(); ++i) {\n                rcheck(str_buf[i] != '\\0', base_exc_t::GENERIC,\n                       \"Encountered unescaped null byte in JSON string.\");\n            }\n            str_buf[data.size()] = '\\0';\n\n            rapidjson::Document json;\n            \/\/ Note: Insitu will cause some parts of `json` to directly point into\n            \/\/ `str_buf`. `str_buf`'s life time must be at least as long as `json`'s.\n            json.ParseInsitu(str_buf.data());\n\n            rcheck(!json.HasParseError(), base_exc_t::GENERIC,\n                   strprintf(\"Failed to parse \\\"%s\\\" as JSON: %s\",\n                       (data.size() > 40\n                        ? (data.to_std().substr(0, 37) + \"...\").c_str()\n                        : data.to_std().c_str()),\n                       rapidjson::GetParseError_En(json.GetParseError())));\n            return new_val(to_datum(json, env->env->limits(),\n                                    env->env->reql_version()));\n        }\n    }\n\n    virtual const char *name() const { return \"json\"; }\n};\n\nclass to_json_string_term_t : public op_term_t {\npublic:\n    to_json_string_term_t(compile_env_t *env, const protob_t<const Term> &term)\n        : op_term_t(env, term, argspec_t(1)) { }\n\n    scoped_ptr_t<val_t> eval_impl(scope_env_t *env, args_t *args, eval_flags_t) const {\n        scoped_ptr_t<val_t> v = args->arg(env, 0);\n        datum_t d = v->as_datum();\n        r_sanity_check(d.has());\n        if (env->env->reql_version() < reql_version_t::v2_1) {\n            scoped_cJSON_t json = d.as_json();\n            return new_val(datum_t(datum_string_t(json.PrintUnformatted())));\n        }\n        else {\n            rapidjson::StringBuffer buffer;\n            rapidjson::Writer<rapidjson::StringBuffer> writer(buffer);\n            d.write_json(&writer);\n            return new_val(datum_t(datum_string_t(buffer.GetSize(), buffer.GetString())));\n        }\n    }\n\n    virtual const char *name() const { return \"to_json_string\"; }\n};\n\ncounted_t<term_t> make_json_term(\n        compile_env_t *env, const protob_t<const Term> &term) {\n    return make_counted<json_term_t>(env, term);\n}\n\ncounted_t<term_t> make_to_json_string_term(\n        compile_env_t *env, const protob_t<const Term> &term) {\n    return make_counted<to_json_string_term_t>(env, term);\n}\n} \/\/ namespace ql\n<commit_msg>Style fix<commit_after>\/\/ Copyright 2010-2013 RethinkDB, all rights reserved.\n#include \"cjson\/json.hpp\"\n#include \"rdb_protocol\/op.hpp\"\n#include \"rdb_protocol\/term.hpp\"\n#include \"rdb_protocol\/terms\/terms.hpp\"\n#include \"rapidjson\/document.h\"\n#include \"rapidjson\/error\/en.h\"\n#include \"rapidjson\/rapidjson.h\"\n#include \"rapidjson\/stringbuffer.h\"\n#include \"rapidjson\/writer.h\"\n\nnamespace ql {\nclass json_term_t : public op_term_t {\npublic:\n    json_term_t(compile_env_t *env, const protob_t<const Term> &term)\n        : op_term_t(env, term, argspec_t(1)) { }\n\n    scoped_ptr_t<val_t> eval_impl(scope_env_t *env, args_t *args, eval_flags_t) const {\n        const datum_string_t data = args->arg(env, 0)->as_str();\n\n        if (env->env->reql_version() < reql_version_t::v2_1) {\n            const std::string std_data = data.to_std();\n            scoped_cJSON_t cjson(cJSON_Parse(std_data.c_str()));\n            rcheck(cjson.get() != NULL, base_exc_t::GENERIC,\n                   strprintf(\"Failed to parse \\\"%s\\\" as JSON.\",\n                     (data.size() > 40\n                      ? (std_data.substr(0, 37) + \"...\").c_str()\n                      : std_data.c_str())));\n            return new_val(to_datum(cjson.get(), env->env->limits(),\n                                    env->env->reql_version()));\n        } else {\n            \/\/ Copy the string into a null-terminated c-string that we can write to,\n            \/\/ so we can use RapidJSON in-situ parsing (and at least avoid some additional\n            \/\/ copying).\n            std::vector<char> str_buf(data.size() + 1);\n            memcpy(str_buf.data(), data.data(), data.size());\n            for (size_t i = 0; i < data.size(); ++i) {\n                rcheck(str_buf[i] != '\\0', base_exc_t::GENERIC,\n                       \"Encountered unescaped null byte in JSON string.\");\n            }\n            str_buf[data.size()] = '\\0';\n\n            rapidjson::Document json;\n            \/\/ Note: Insitu will cause some parts of `json` to directly point into\n            \/\/ `str_buf`. `str_buf`'s life time must be at least as long as `json`'s.\n            json.ParseInsitu(str_buf.data());\n\n            rcheck(!json.HasParseError(), base_exc_t::GENERIC,\n                   strprintf(\"Failed to parse \\\"%s\\\" as JSON: %s\",\n                       (data.size() > 40\n                        ? (data.to_std().substr(0, 37) + \"...\").c_str()\n                        : data.to_std().c_str()),\n                       rapidjson::GetParseError_En(json.GetParseError())));\n            return new_val(to_datum(json, env->env->limits(),\n                                    env->env->reql_version()));\n        }\n    }\n\n    virtual const char *name() const { return \"json\"; }\n};\n\nclass to_json_string_term_t : public op_term_t {\npublic:\n    to_json_string_term_t(compile_env_t *env, const protob_t<const Term> &term)\n        : op_term_t(env, term, argspec_t(1)) { }\n\n    scoped_ptr_t<val_t> eval_impl(scope_env_t *env, args_t *args, eval_flags_t) const {\n        scoped_ptr_t<val_t> v = args->arg(env, 0);\n        datum_t d = v->as_datum();\n        r_sanity_check(d.has());\n        if (env->env->reql_version() < reql_version_t::v2_1) {\n            scoped_cJSON_t json = d.as_json();\n            return new_val(datum_t(datum_string_t(json.PrintUnformatted())));\n        } else {\n            rapidjson::StringBuffer buffer;\n            rapidjson::Writer<rapidjson::StringBuffer> writer(buffer);\n            d.write_json(&writer);\n            return new_val(datum_t(datum_string_t(buffer.GetSize(), buffer.GetString())));\n        }\n    }\n\n    virtual const char *name() const { return \"to_json_string\"; }\n};\n\ncounted_t<term_t> make_json_term(\n        compile_env_t *env, const protob_t<const Term> &term) {\n    return make_counted<json_term_t>(env, term);\n}\n\ncounted_t<term_t> make_to_json_string_term(\n        compile_env_t *env, const protob_t<const Term> &term) {\n    return make_counted<to_json_string_term_t>(env, term);\n}\n} \/\/ namespace ql\n<|endoftext|>"}
{"text":"<commit_before>\/\/ RSI: Fucking fuck.\n#include <iostream>\n\n#include \"errors.hpp\"\n#include <boost\/date_time.hpp>\n\n#include \"rdb_protocol\/op.hpp\"\n#include \"rdb_protocol\/term.hpp\"\n#include \"rdb_protocol\/terms\/terms.hpp\"\n#include \"rdb_protocol\/pseudo_time.hpp\"\n\nnamespace ql {\n\nclass iso8601_term_t : public op_term_t {\npublic:\n    iso8601_term_t(env_t *env, const protob_t<const Term> &term)\n        : op_term_t(env, term, argspec_t(1)) { }\nprivate:\n    counted_t<val_t> eval_impl(UNUSED eval_flags_t flags) {\n        counted_t<val_t> v = arg(0);\n        return new_val(pseudo::iso8601_to_time(v->as_str(), v.get()));\n    }\n    virtual const char *name() const { return \"iso8601\"; }\n};\n\nclass to_iso8601_term_t : public op_term_t {\npublic:\n    to_iso8601_term_t(env_t *env, const protob_t<const Term> &term)\n        : op_term_t(env, term, argspec_t(1)) { }\nprivate:\n    counted_t<val_t> eval_impl(UNUSED eval_flags_t flags) {\n        return new_val(\n            make_counted<const datum_t>(\n                pseudo::time_to_iso8601(arg(0)->as_ptype(pseudo::time_string))));\n    }\n    virtual const char *name() const { return \"to_iso8601\"; }\n};\n\nclass epoch_time_term_t : public op_term_t {\npublic:\n    epoch_time_term_t(env_t *env, const protob_t<const Term> &term)\n        : op_term_t(env, term, argspec_t(1)) { }\nprivate:\n    counted_t<val_t> eval_impl(UNUSED eval_flags_t flags) {\n        counted_t<val_t> v = arg(0);\n        return new_val(pseudo::make_time(v->as_num()));\n    }\n    virtual const char *name() const { return \"epoch_time\"; }\n};\n\nclass to_epoch_time_term_t : public op_term_t {\npublic:\n    to_epoch_time_term_t(env_t *env, const protob_t<const Term> &term)\n        : op_term_t(env, term, argspec_t(1)) { }\nprivate:\n    counted_t<val_t> eval_impl(UNUSED eval_flags_t flags) {\n        return new_val(\n            make_counted<const datum_t>(\n                pseudo::time_to_epoch_time(arg(0)->as_ptype(pseudo::time_string))));\n    }\n    virtual const char *name() const { return \"to_epoch_time\"; }\n};\n\nclass now_term_t : public op_term_t {\npublic:\n    now_term_t(env_t *env, const protob_t<const Term> &term)\n        : op_term_t(env, term, argspec_t(0)) { }\nprivate:\n    counted_t<val_t> eval_impl(UNUSED eval_flags_t flags) {\n        \/\/ This should never get called because we rewrite `now` calls to a\n        \/\/ constant so that they're deterministic.\n        r_sanity_check(false);\n        unreachable();\n    }\n    bool is_deterministic() const { return false; }\n    virtual const char *name() const { return \"now\"; }\n};\n\nclass in_timezone_term_t : public op_term_t {\npublic:\n    in_timezone_term_t(env_t *env, const protob_t<const Term> &term)\n        : op_term_t(env, term, argspec_t(2)) { }\nprivate:\n    counted_t<val_t> eval_impl(UNUSED eval_flags_t flags) {\n        return new_val(pseudo::time_in_tz(arg(0)->as_ptype(pseudo::time_string),\n                                          arg(1)->as_datum()));\n    }\n    virtual const char *name() const { return \"in_timezone\"; }\n};\n\nclass during_term_t : public bounded_op_term_t {\npublic:\n    during_term_t(env_t *env, const protob_t<const Term> &term)\n        : bounded_op_term_t(env, term, argspec_t(3)) { }\nprivate:\n    counted_t<val_t> eval_impl(UNUSED eval_flags_t flags) {\n        counted_t<const datum_t> t = arg(0)->as_ptype(pseudo::time_string);\n        counted_t<const datum_t> lb = arg(1)->as_ptype(pseudo::time_string);\n        counted_t<const datum_t> rb = arg(2)->as_ptype(pseudo::time_string);\n        int lcmp = pseudo::time_cmp(*lb, *t);\n        int rcmp = pseudo::time_cmp(*t, *rb);\n        return new_val_bool(!(lcmp == 1 || (lcmp == 0 && left_open())\n                              || rcmp == 1 || (rcmp == 0 && right_open())));\n    }\n    virtual const char *name() const { return \"during\"; }\n};\n\nclass date_term_t : public op_term_t {\npublic:\n    date_term_t(env_t *env, const protob_t<const Term> &term)\n        : op_term_t(env, term, argspec_t(1)) { }\nprivate:\n    counted_t<val_t> eval_impl(UNUSED eval_flags_t flags) {\n        return new_val(pseudo::time_date(arg(0)->as_ptype(pseudo::time_string), this));\n    }\n    virtual const char *name() const { return \"date\"; }\n};\n\nclass time_of_day_term_t : public op_term_t {\npublic:\n    time_of_day_term_t(env_t *env, const protob_t<const Term> &term)\n        : op_term_t(env, term, argspec_t(1)) { }\nprivate:\n    counted_t<val_t> eval_impl(UNUSED eval_flags_t flags) {\n        return new_val(pseudo::time_of_day(arg(0)->as_ptype(pseudo::time_string)));\n    }\n    virtual const char *name() const { return \"time_of_day\"; }\n};\n\nclass timezone_term_t : public op_term_t {\npublic:\n    timezone_term_t(env_t *env, const protob_t<const Term> &term)\n        : op_term_t(env, term, argspec_t(1)) { }\nprivate:\n    counted_t<val_t> eval_impl(UNUSED eval_flags_t flags) {\n        return new_val(pseudo::time_tz(arg(0)->as_ptype(pseudo::time_string)));\n    }\n    virtual const char *name() const { return \"timezone\"; }\n};\n\nclass portion_term_t : public op_term_t {\npublic:\n    portion_term_t(env_t *env, protob_t<const Term> term,\n                   pseudo::time_component_t _component)\n        : op_term_t(env, term, argspec_t(1)), component(_component) { }\nprivate:\n    counted_t<val_t> eval_impl(UNUSED eval_flags_t flags) {\n        double d = pseudo::time_portion(arg(0)->as_ptype(pseudo::time_string), component);\n        return new_val(make_counted<const datum_t>(d));\n    }\n    virtual const char *name() const {\n        switch (component) {\n        case pseudo::YEAR: return \"year\";\n        case pseudo::MONTH: return \"month\";\n        case pseudo::DAY: return \"day\";\n        case pseudo::DAY_OF_WEEK: return \"day_of_week\";\n        case pseudo::DAY_OF_YEAR: return \"day_of_year\";\n        case pseudo::HOURS: return \"hours\";\n        case pseudo::MINUTES: return \"minutes\";\n        case pseudo::SECONDS: return \"seconds\";\n        default: unreachable();\n        }\n    }\n    pseudo::time_component_t component;\n};\n\nclass time_term_t : public op_term_t {\npublic:\n    time_term_t(env_t *env, const protob_t<const Term> &term)\n        : op_term_t(env, term, argspec_t(3, 7)) { }\nprivate:\n    counted_t<val_t> eval_impl(UNUSED eval_flags_t flags) {\n        if (num_args() != 3 && num_args() != 4 && num_args() != 6 && num_args() != 7) {\n            rfail(base_exc_t::GENERIC,\n                  \"Got %zu arguments to TIME (expected 3, 4, 6 or 7).\", num_args());\n        }\n        int year = arg(0)->as_int<int>();\n        int month = arg(1)->as_int<int>();\n        int day = arg(2)->as_int<int>();\n        int hours = 0;\n        int minutes = 0;\n        double seconds = 0;\n        std::string tz = \"\";\n        if (num_args() == 4) {\n            tz = parse_tz(arg(3));\n        } else if (num_args() >= 6) {\n            hours = arg(3)->as_int<int>();\n            minutes = arg(4)->as_int<int>();\n            seconds = arg(5)->as_num();\n            if (num_args() == 7) {\n                tz = parse_tz(arg(6));\n            }\n        }\n        return new_val(\n            pseudo::make_time(year, month, day, hours, minutes, seconds, tz, this));\n    }\n    std::string parse_tz(counted_t<val_t> v) {\n        counted_t<const datum_t> d = v->as_datum();\n        if (d->get_type() == datum_t::R_NULL) {\n            return \"\";\n        } else {\n            return d->as_str();\n        }\n    }\n    virtual const char *name() const { return \"time\"; }\n};\n\ncounted_t<term_t> make_iso8601_term(env_t *env, const protob_t<const Term> &term) {\n    return make_counted<iso8601_term_t>(env, term);\n}\ncounted_t<term_t> make_to_iso8601_term(env_t *env, const protob_t<const Term> &term) {\n    return make_counted<to_iso8601_term_t>(env, term);\n}\ncounted_t<term_t> make_epoch_time_term(env_t *env, const protob_t<const Term> &term) {\n    return make_counted<epoch_time_term_t>(env, term);\n}\ncounted_t<term_t> make_to_epoch_time_term(env_t *env, const protob_t<const Term> &term) {\n    return make_counted<to_epoch_time_term_t>(env, term);\n}\ncounted_t<term_t> make_now_term(env_t *env, const protob_t<const Term> &term) {\n    return make_counted<now_term_t>(env, term);\n}\ncounted_t<term_t> make_in_timezone_term(env_t *env, const protob_t<const Term> &term) {\n    return make_counted<in_timezone_term_t>(env, term);\n}\ncounted_t<term_t> make_during_term(env_t *env, const protob_t<const Term> &term) {\n    return make_counted<during_term_t>(env, term);\n}\n\ncounted_t<term_t> make_date_term(env_t *env, const protob_t<const Term> &term) {\n    return make_counted<date_term_t>(env, term);\n}\ncounted_t<term_t> make_time_of_day_term(env_t *env, const protob_t<const Term> &term) {\n    return make_counted<time_of_day_term_t>(env, term);\n}\ncounted_t<term_t> make_timezone_term(env_t *env, const protob_t<const Term> &term) {\n    return make_counted<timezone_term_t>(env, term);\n}\ncounted_t<term_t> make_time_term(env_t *env, const protob_t<const Term> &term) {\n    return make_counted<time_term_t>(env, term);\n}\ncounted_t<term_t> make_portion_term(env_t *env, const protob_t<const Term> &term,\n                                    pseudo::time_component_t component) {\n    return make_counted<portion_term_t>(env, term, component);\n}\n\n} \/\/ namespace ql\n\n<commit_msg>Removed unused <iostream> header.<commit_after>#include \"errors.hpp\"\n#include <boost\/date_time.hpp>\n\n#include \"rdb_protocol\/op.hpp\"\n#include \"rdb_protocol\/term.hpp\"\n#include \"rdb_protocol\/terms\/terms.hpp\"\n#include \"rdb_protocol\/pseudo_time.hpp\"\n\nnamespace ql {\n\nclass iso8601_term_t : public op_term_t {\npublic:\n    iso8601_term_t(env_t *env, const protob_t<const Term> &term)\n        : op_term_t(env, term, argspec_t(1)) { }\nprivate:\n    counted_t<val_t> eval_impl(UNUSED eval_flags_t flags) {\n        counted_t<val_t> v = arg(0);\n        return new_val(pseudo::iso8601_to_time(v->as_str(), v.get()));\n    }\n    virtual const char *name() const { return \"iso8601\"; }\n};\n\nclass to_iso8601_term_t : public op_term_t {\npublic:\n    to_iso8601_term_t(env_t *env, const protob_t<const Term> &term)\n        : op_term_t(env, term, argspec_t(1)) { }\nprivate:\n    counted_t<val_t> eval_impl(UNUSED eval_flags_t flags) {\n        return new_val(\n            make_counted<const datum_t>(\n                pseudo::time_to_iso8601(arg(0)->as_ptype(pseudo::time_string))));\n    }\n    virtual const char *name() const { return \"to_iso8601\"; }\n};\n\nclass epoch_time_term_t : public op_term_t {\npublic:\n    epoch_time_term_t(env_t *env, const protob_t<const Term> &term)\n        : op_term_t(env, term, argspec_t(1)) { }\nprivate:\n    counted_t<val_t> eval_impl(UNUSED eval_flags_t flags) {\n        counted_t<val_t> v = arg(0);\n        return new_val(pseudo::make_time(v->as_num()));\n    }\n    virtual const char *name() const { return \"epoch_time\"; }\n};\n\nclass to_epoch_time_term_t : public op_term_t {\npublic:\n    to_epoch_time_term_t(env_t *env, const protob_t<const Term> &term)\n        : op_term_t(env, term, argspec_t(1)) { }\nprivate:\n    counted_t<val_t> eval_impl(UNUSED eval_flags_t flags) {\n        return new_val(\n            make_counted<const datum_t>(\n                pseudo::time_to_epoch_time(arg(0)->as_ptype(pseudo::time_string))));\n    }\n    virtual const char *name() const { return \"to_epoch_time\"; }\n};\n\nclass now_term_t : public op_term_t {\npublic:\n    now_term_t(env_t *env, const protob_t<const Term> &term)\n        : op_term_t(env, term, argspec_t(0)) { }\nprivate:\n    counted_t<val_t> eval_impl(UNUSED eval_flags_t flags) {\n        \/\/ This should never get called because we rewrite `now` calls to a\n        \/\/ constant so that they're deterministic.\n        r_sanity_check(false);\n        unreachable();\n    }\n    bool is_deterministic() const { return false; }\n    virtual const char *name() const { return \"now\"; }\n};\n\nclass in_timezone_term_t : public op_term_t {\npublic:\n    in_timezone_term_t(env_t *env, const protob_t<const Term> &term)\n        : op_term_t(env, term, argspec_t(2)) { }\nprivate:\n    counted_t<val_t> eval_impl(UNUSED eval_flags_t flags) {\n        return new_val(pseudo::time_in_tz(arg(0)->as_ptype(pseudo::time_string),\n                                          arg(1)->as_datum()));\n    }\n    virtual const char *name() const { return \"in_timezone\"; }\n};\n\nclass during_term_t : public bounded_op_term_t {\npublic:\n    during_term_t(env_t *env, const protob_t<const Term> &term)\n        : bounded_op_term_t(env, term, argspec_t(3)) { }\nprivate:\n    counted_t<val_t> eval_impl(UNUSED eval_flags_t flags) {\n        counted_t<const datum_t> t = arg(0)->as_ptype(pseudo::time_string);\n        counted_t<const datum_t> lb = arg(1)->as_ptype(pseudo::time_string);\n        counted_t<const datum_t> rb = arg(2)->as_ptype(pseudo::time_string);\n        int lcmp = pseudo::time_cmp(*lb, *t);\n        int rcmp = pseudo::time_cmp(*t, *rb);\n        return new_val_bool(!(lcmp == 1 || (lcmp == 0 && left_open())\n                              || rcmp == 1 || (rcmp == 0 && right_open())));\n    }\n    virtual const char *name() const { return \"during\"; }\n};\n\nclass date_term_t : public op_term_t {\npublic:\n    date_term_t(env_t *env, const protob_t<const Term> &term)\n        : op_term_t(env, term, argspec_t(1)) { }\nprivate:\n    counted_t<val_t> eval_impl(UNUSED eval_flags_t flags) {\n        return new_val(pseudo::time_date(arg(0)->as_ptype(pseudo::time_string), this));\n    }\n    virtual const char *name() const { return \"date\"; }\n};\n\nclass time_of_day_term_t : public op_term_t {\npublic:\n    time_of_day_term_t(env_t *env, const protob_t<const Term> &term)\n        : op_term_t(env, term, argspec_t(1)) { }\nprivate:\n    counted_t<val_t> eval_impl(UNUSED eval_flags_t flags) {\n        return new_val(pseudo::time_of_day(arg(0)->as_ptype(pseudo::time_string)));\n    }\n    virtual const char *name() const { return \"time_of_day\"; }\n};\n\nclass timezone_term_t : public op_term_t {\npublic:\n    timezone_term_t(env_t *env, const protob_t<const Term> &term)\n        : op_term_t(env, term, argspec_t(1)) { }\nprivate:\n    counted_t<val_t> eval_impl(UNUSED eval_flags_t flags) {\n        return new_val(pseudo::time_tz(arg(0)->as_ptype(pseudo::time_string)));\n    }\n    virtual const char *name() const { return \"timezone\"; }\n};\n\nclass portion_term_t : public op_term_t {\npublic:\n    portion_term_t(env_t *env, protob_t<const Term> term,\n                   pseudo::time_component_t _component)\n        : op_term_t(env, term, argspec_t(1)), component(_component) { }\nprivate:\n    counted_t<val_t> eval_impl(UNUSED eval_flags_t flags) {\n        double d = pseudo::time_portion(arg(0)->as_ptype(pseudo::time_string), component);\n        return new_val(make_counted<const datum_t>(d));\n    }\n    virtual const char *name() const {\n        switch (component) {\n        case pseudo::YEAR: return \"year\";\n        case pseudo::MONTH: return \"month\";\n        case pseudo::DAY: return \"day\";\n        case pseudo::DAY_OF_WEEK: return \"day_of_week\";\n        case pseudo::DAY_OF_YEAR: return \"day_of_year\";\n        case pseudo::HOURS: return \"hours\";\n        case pseudo::MINUTES: return \"minutes\";\n        case pseudo::SECONDS: return \"seconds\";\n        default: unreachable();\n        }\n    }\n    pseudo::time_component_t component;\n};\n\nclass time_term_t : public op_term_t {\npublic:\n    time_term_t(env_t *env, const protob_t<const Term> &term)\n        : op_term_t(env, term, argspec_t(3, 7)) { }\nprivate:\n    counted_t<val_t> eval_impl(UNUSED eval_flags_t flags) {\n        if (num_args() != 3 && num_args() != 4 && num_args() != 6 && num_args() != 7) {\n            rfail(base_exc_t::GENERIC,\n                  \"Got %zu arguments to TIME (expected 3, 4, 6 or 7).\", num_args());\n        }\n        int year = arg(0)->as_int<int>();\n        int month = arg(1)->as_int<int>();\n        int day = arg(2)->as_int<int>();\n        int hours = 0;\n        int minutes = 0;\n        double seconds = 0;\n        std::string tz = \"\";\n        if (num_args() == 4) {\n            tz = parse_tz(arg(3));\n        } else if (num_args() >= 6) {\n            hours = arg(3)->as_int<int>();\n            minutes = arg(4)->as_int<int>();\n            seconds = arg(5)->as_num();\n            if (num_args() == 7) {\n                tz = parse_tz(arg(6));\n            }\n        }\n        return new_val(\n            pseudo::make_time(year, month, day, hours, minutes, seconds, tz, this));\n    }\n    std::string parse_tz(counted_t<val_t> v) {\n        counted_t<const datum_t> d = v->as_datum();\n        if (d->get_type() == datum_t::R_NULL) {\n            return \"\";\n        } else {\n            return d->as_str();\n        }\n    }\n    virtual const char *name() const { return \"time\"; }\n};\n\ncounted_t<term_t> make_iso8601_term(env_t *env, const protob_t<const Term> &term) {\n    return make_counted<iso8601_term_t>(env, term);\n}\ncounted_t<term_t> make_to_iso8601_term(env_t *env, const protob_t<const Term> &term) {\n    return make_counted<to_iso8601_term_t>(env, term);\n}\ncounted_t<term_t> make_epoch_time_term(env_t *env, const protob_t<const Term> &term) {\n    return make_counted<epoch_time_term_t>(env, term);\n}\ncounted_t<term_t> make_to_epoch_time_term(env_t *env, const protob_t<const Term> &term) {\n    return make_counted<to_epoch_time_term_t>(env, term);\n}\ncounted_t<term_t> make_now_term(env_t *env, const protob_t<const Term> &term) {\n    return make_counted<now_term_t>(env, term);\n}\ncounted_t<term_t> make_in_timezone_term(env_t *env, const protob_t<const Term> &term) {\n    return make_counted<in_timezone_term_t>(env, term);\n}\ncounted_t<term_t> make_during_term(env_t *env, const protob_t<const Term> &term) {\n    return make_counted<during_term_t>(env, term);\n}\n\ncounted_t<term_t> make_date_term(env_t *env, const protob_t<const Term> &term) {\n    return make_counted<date_term_t>(env, term);\n}\ncounted_t<term_t> make_time_of_day_term(env_t *env, const protob_t<const Term> &term) {\n    return make_counted<time_of_day_term_t>(env, term);\n}\ncounted_t<term_t> make_timezone_term(env_t *env, const protob_t<const Term> &term) {\n    return make_counted<timezone_term_t>(env, term);\n}\ncounted_t<term_t> make_time_term(env_t *env, const protob_t<const Term> &term) {\n    return make_counted<time_term_t>(env, term);\n}\ncounted_t<term_t> make_portion_term(env_t *env, const protob_t<const Term> &term,\n                                    pseudo::time_component_t component) {\n    return make_counted<portion_term_t>(env, term, component);\n}\n\n} \/\/ namespace ql\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>lua API<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ ofstreamts.cc\n\n\/\/ quarl 2006-05-25 initial version, factored from 2006-05-16 astgen.cc\n\n#include \"ofstreamts.h\"\n#include \"exc.h\"\n\nsize_t getFileSize(istream &i)\n{\n  \/\/ use 'streampos' instead of 'istream::pos_type' for gcc-2.95\n  \/\/ compatibility.\n  if (!i) return 0;\n  streampos save_pos = i.tellg();\n  i.seekg(0, ios::beg);\n  streampos begin_pos = i.tellg();\n  i.seekg(0, ios::end);\n  streampos end_pos = i.tellg();\n  size_t size = end_pos - begin_pos;\n  i.seekg(save_pos);\n  return size;\n}\n\nbool filesIdentical(const char *f1, const char *f2)\n{\n  ifstream i1(f1);\n  if (!i1) return false;\n\n  ifstream i2(f2);\n  if (!i2) {\n    xfatal(stringc << \"I thought I just wrote \" << f2 << \", but it doesn't exist\");\n    return false;\n  }\n\n  if (getFileSize(i1) != getFileSize(i2))\n    return false;\n\n  while (true) {\n    if (i1.bad() || i2.bad()) {\n      return false;\n    }\n\n    if (i1.eof() && i2.eof()) {\n      \/\/ reached EOF and no problem.\n      return true;\n    }\n\n    if (!i1 || !i2) {\n      \/\/ Other error? or for some reason we reached EOF in one file but not\n      \/\/ another even though file sizes are the same\n      return false;\n    }\n\n    if (i1.get() != i2.get()) {\n      \/\/ unidentical character\n      return false;\n    }\n  }\n}\n\nconst char *ofstreamTS::init_fname(string const &destFname0)\n{\n  destFname = destFname0;\n  tmpFname = destFname0 & \".tmp\";\n  return tmpFname.c_str();\n}\n\nvoid ofstreamTS::save() {\n  close();\n  if (filesIdentical(destFname.c_str(), tmpFname.c_str())) {\n    cout << \"  file \" << destFname << \" unchanged, so not overwriting it.\\n\";\n    if (unlink(tmpFname.c_str())) {\n      cerr << \"  unlink \" << tmpFname << \" failed\\n\";\n    }\n    return;\n  }\n  if (rename(tmpFname.c_str(), destFname.c_str())) {\n    xfatal(stringc << \"Rename \" << tmpFname << \" to \" << destFname << \" failed\");\n  }\n}\n\nvoid ofstreamTS::deleteTmp() {\n  close();\n  if (unlink(tmpFname.c_str())) {\n    cerr << \"  unlink \" << tmpFname << \" failed\\n\";\n  }\n}\n<commit_msg>Extra #includes, guess they are needed on some compilers.  From Leo Savernik <l.savernik@aon.at>.<commit_after>\/\/ ofstreamts.cc\n\n\/\/ quarl 2006-05-25 initial version, factored from 2006-05-16 astgen.cc\n\n#include \"ofstreamts.h\"\n#include \"exc.h\"\n\n#include <stdio.h>\n#include <unistd.h>\n\nsize_t getFileSize(istream &i)\n{\n  \/\/ use 'streampos' instead of 'istream::pos_type' for gcc-2.95\n  \/\/ compatibility.\n  if (!i) return 0;\n  streampos save_pos = i.tellg();\n  i.seekg(0, ios::beg);\n  streampos begin_pos = i.tellg();\n  i.seekg(0, ios::end);\n  streampos end_pos = i.tellg();\n  size_t size = end_pos - begin_pos;\n  i.seekg(save_pos);\n  return size;\n}\n\nbool filesIdentical(const char *f1, const char *f2)\n{\n  ifstream i1(f1);\n  if (!i1) return false;\n\n  ifstream i2(f2);\n  if (!i2) {\n    xfatal(stringc << \"I thought I just wrote \" << f2 << \", but it doesn't exist\");\n    return false;\n  }\n\n  if (getFileSize(i1) != getFileSize(i2))\n    return false;\n\n  while (true) {\n    if (i1.bad() || i2.bad()) {\n      return false;\n    }\n\n    if (i1.eof() && i2.eof()) {\n      \/\/ reached EOF and no problem.\n      return true;\n    }\n\n    if (!i1 || !i2) {\n      \/\/ Other error? or for some reason we reached EOF in one file but not\n      \/\/ another even though file sizes are the same\n      return false;\n    }\n\n    if (i1.get() != i2.get()) {\n      \/\/ unidentical character\n      return false;\n    }\n  }\n}\n\nconst char *ofstreamTS::init_fname(string const &destFname0)\n{\n  destFname = destFname0;\n  tmpFname = destFname0 & \".tmp\";\n  return tmpFname.c_str();\n}\n\nvoid ofstreamTS::save() {\n  close();\n  if (filesIdentical(destFname.c_str(), tmpFname.c_str())) {\n    cout << \"  file \" << destFname << \" unchanged, so not overwriting it.\\n\";\n    if (unlink(tmpFname.c_str())) {\n      cerr << \"  unlink \" << tmpFname << \" failed\\n\";\n    }\n    return;\n  }\n  if (rename(tmpFname.c_str(), destFname.c_str())) {\n    xfatal(stringc << \"Rename \" << tmpFname << \" to \" << destFname << \" failed\");\n  }\n}\n\nvoid ofstreamTS::deleteTmp() {\n  close();\n  if (unlink(tmpFname.c_str())) {\n    cerr << \"  unlink \" << tmpFname << \" failed\\n\";\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\nCopyright (c) 2003, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n    * Redistributions of source code must retain the above copyright\n      notice, this list of conditions and the following disclaimer.\n    * Redistributions in binary form must reproduce the above copyright\n      notice, this list of conditions and the following disclaimer in\n      the documentation and\/or other materials provided with the distribution.\n    * Neither the name of the author nor the names of its\n      contributors may be used to endorse or promote products derived\n      from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/pch.hpp\"\n\n#include <string>\n#include <stdexcept>\n#include <sstream>\n#include <iomanip>\n#include <cctype>\n#include <algorithm>\n#include <iostream>\n\n#include <boost\/optional.hpp>\n\n#include \"libtorrent\/assert.hpp\"\n\nnamespace libtorrent\n{\n\tstd::string unescape_string(std::string const& s)\n\t{\n\t\tstd::string ret;\n\t\tfor (std::string::const_iterator i = s.begin(); i != s.end(); ++i)\n\t\t{\n\t\t\tif(*i == '+')\n\t\t\t{\n\t\t\t\tret += ' ';\n\t\t\t}\n\t\t\telse if (*i != '%')\n\t\t\t{\n\t\t\t\tret += *i;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t++i;\n\t\t\t\tif (i == s.end())\n\t\t\t\t\tthrow std::runtime_error(\"invalid escaped string\");\n\n\t\t\t\tint high;\n\t\t\t\tif(*i >= '0' && *i <= '9') high = *i - '0';\n\t\t\t\telse if(*i >= 'A' && *i <= 'F') high = *i + 10 - 'A';\n\t\t\t\telse if(*i >= 'a' && *i <= 'f') high = *i + 10 - 'a';\n\t\t\t\telse throw std::runtime_error(\"invalid escaped string\");\n\n\t\t\t\t++i;\n\t\t\t\tif (i == s.end())\n\t\t\t\t\tthrow std::runtime_error(\"invalid escaped string\");\n\n\t\t\t\tint low;\n\t\t\t\tif(*i >= '0' && *i <= '9') low = *i - '0';\n\t\t\t\telse if(*i >= 'A' && *i <= 'F') low = *i + 10 - 'A';\n\t\t\t\telse if(*i >= 'a' && *i <= 'f') low = *i + 10 - 'a';\n\t\t\t\telse throw std::runtime_error(\"invalid escaped string\");\n\n\t\t\t\tret += char(high * 16 + low);\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n\n\tstd::string escape_string(const char* str, int len)\n\t{\n\t\tTORRENT_ASSERT(str != 0);\n\t\tTORRENT_ASSERT(len >= 0);\n\t\t\/\/ http:\/\/www.ietf.org\/rfc\/rfc2396.txt\n\t\t\/\/ section 2.3\n\t\t\/\/ some trackers seems to require that ' is escaped\n\/\/\t\tstatic const char unreserved_chars[] = \"-_.!~*'()\";\n\t\tstatic const char unreserved_chars[] = \"-_.!~*()\"\n\t\t\t\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\"\n\t\t\t\"0123456789\";\n\n\t\tstd::stringstream ret;\n\t\tret << std::hex << std::setfill('0');\n\t\tfor (int i = 0; i < len; ++i)\n\t\t{\n\t\t\tif (std::count(\n\t\t\t\t\tunreserved_chars\n\t\t\t\t\t, unreserved_chars+sizeof(unreserved_chars)-1\n\t\t\t\t\t, *str))\n\t\t\t{\n\t\t\t\tret << *str;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tret << '%'\n\t\t\t\t\t<< std::setw(2)\n\t\t\t\t\t<< (int)static_cast<unsigned char>(*str);\n\t\t\t}\n\t\t\t++str;\n\t\t}\n\t\treturn ret.str();\n\t}\n\t\n\tstd::string escape_path(const char* str, int len)\n\t{\n\t\tTORRENT_ASSERT(str != 0);\n\t\tTORRENT_ASSERT(len >= 0);\n\t\tstatic const char unreserved_chars[] = \"\/-_.!~*()\"\n\t\t\t\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\"\n\t\t\t\"0123456789\";\n\n\t\tstd::stringstream ret;\n\t\tret << std::hex << std::setfill('0');\n\t\tfor (int i = 0; i < len; ++i)\n\t\t{\n\t\t\tif (std::count(\n\t\t\t\t\tunreserved_chars\n\t\t\t\t\t, unreserved_chars+sizeof(unreserved_chars)-1\n\t\t\t\t\t, *str))\n\t\t\t{\n\t\t\t\tret << *str;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tret << '%'\n\t\t\t\t\t<< std::setw(2)\n\t\t\t\t\t<< (int)static_cast<unsigned char>(*str);\n\t\t\t}\n\t\t\t++str;\n\t\t}\n\t\treturn ret.str();\n\t}\n\n\tstd::string base64encode(const std::string& s)\n\t{\n\t\tstatic const char base64_table[] =\n\t\t{\n\t\t\t'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H',\n\t\t\t'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P',\n\t\t\t'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X',\n\t\t\t'Y', 'Z', 'a', 'b', 'c', 'd', 'e', 'f',\n\t\t\t'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n',\n\t\t\t'o', 'p', 'q', 'r', 's', 't', 'u', 'v',\n\t\t\t'w', 'x', 'y', 'z', '0', '1', '2', '3',\n\t\t\t'4', '5', '6', '7', '8', '9', '+', '\/'\n\t\t};\n\n\t\tunsigned char inbuf[3];\n\t\tunsigned char outbuf[4];\n\t\n\t\tstd::string ret;\n\t\tfor (std::string::const_iterator i = s.begin(); i != s.end();)\n\t\t{\n\t\t\t\/\/ available input is 1,2 or 3 bytes\n\t\t\t\/\/ since we read 3 bytes at a time at most\n\t\t\tint available_input = (std::min)(3, (int)std::distance(i, s.end()));\n\n\t\t\t\/\/ clear input buffer\n\t\t\tstd::fill(inbuf, inbuf+3, 0);\n\n\t\t\t\/\/ read a chunk of input into inbuf\n\t\t\tstd::copy(i, i + available_input, inbuf);\n\t\t\ti += available_input;\n\n\t\t\t\/\/ encode inbuf to outbuf\n\t\t\toutbuf[0] = (inbuf[0] & 0xfc) >> 2;\n\t\t\toutbuf[1] = ((inbuf[0] & 0x03) << 4) | ((inbuf [1] & 0xf0) >> 4);\n\t\t\toutbuf[2] = ((inbuf[1] & 0x0f) << 2) | ((inbuf [2] & 0xc0) >> 6);\n\t\t\toutbuf[3] = inbuf[2] & 0x3f;\n\n\t\t\t\/\/ write output\n\t\t\tfor (int j = 0; j < available_input+1; ++j)\n\t\t\t{\n\t\t\t\tret += base64_table[outbuf[j]];\n\t\t\t}\n\n\t\t\t\/\/ write pad\n\t\t\tfor (int j = 0; j < 3 - available_input; ++j)\n\t\t\t{\n\t\t\t\tret += '=';\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n\n\tstd::string base32encode(std::string const& s)\n\t{\n\t\tstatic const char base32_table[] =\n\t\t{\n\t\t\t'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H',\n\t\t\t'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P',\n\t\t\t'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X',\n\t\t\t'Y', 'Z', '2', '3', '4', '5', '6', '7'\n\t\t};\n\n\t\tint input_output_mapping[] = {0, 2, 4, 5, 7, 8};\n\t\t\n\t\tunsigned char inbuf[5];\n\t\tunsigned char outbuf[8];\n\t\n\t\tstd::string ret;\n\t\tfor (std::string::const_iterator i = s.begin(); i != s.end();)\n\t\t{\n\t\t\tint available_input = (std::min)(5, (int)std::distance(i, s.end()));\n\n\t\t\t\/\/ clear input buffer\n\t\t\tstd::fill(inbuf, inbuf+5, 0);\n\n\t\t\t\/\/ read a chunk of input into inbuf\n\t\t\tstd::copy(i, i + available_input, inbuf);\n\t\t\ti += available_input;\n\n\t\t\t\/\/ encode inbuf to outbuf\n\t\t\toutbuf[0] = (inbuf[0] & 0xf8) >> 3;\n\t\t\toutbuf[1] = ((inbuf[0] & 0x07) << 2) | ((inbuf[1] & 0xc0) >> 6);\n\t\t\toutbuf[2] = ((inbuf[1] & 0x3e) >> 1);\n\t\t\toutbuf[3] = ((inbuf[1] & 0x01) << 4) | ((inbuf[2] & 0xf0) >> 4);\n\t\t\toutbuf[4] = ((inbuf[2] & 0x0f) << 1) | ((inbuf[3] & 0x80) >> 7);\n\t\t\toutbuf[5] = ((inbuf[3] & 0x7c) >> 2);\n\t\t\toutbuf[6] = ((inbuf[3] & 0x03) << 3) | ((inbuf[4] & 0xe0) >> 5);\n\t\t\toutbuf[7] = inbuf[4] & 0x1f;\n\n\t\t\t\/\/ write output\n\t\t\tint num_out = input_output_mapping[available_input];\n\t\t\tfor (int j = 0; j < num_out; ++j)\n\t\t\t{\n\t\t\t\tret += base32_table[outbuf[j]];\n\t\t\t}\n\n\t\t\t\/\/ write pad\n\t\t\tfor (int j = 0; j < 8 - num_out; ++j)\n\t\t\t{\n\t\t\t\tret += '=';\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n\n\tstd::string base32decode(std::string const& s)\n\t{\n\t\tunsigned char inbuf[8];\n\t\tunsigned char outbuf[5];\n\t\n\t\tstd::string ret;\n\t\tfor (std::string::const_iterator i = s.begin(); i != s.end();)\n\t\t{\n\t\t\tint available_input = (std::min)(8, (int)std::distance(i, s.end()));\n\n\t\t\tint pad_start = 0;\n\t\t\tif (available_input < 8) pad_start = available_input;\n\n\t\t\t\/\/ clear input buffer\n\t\t\tstd::fill(inbuf, inbuf+8, 0);\n\t\t\tfor (int j = 0; j < available_input; ++j)\n\t\t\t{\n\t\t\t\tchar in = std::toupper(*i++);\n\t\t\t\tif (in >= 'A' && in <= 'Z')\n\t\t\t\t\tinbuf[j] = in - 'A';\n\t\t\t\telse if (in >= '2' && in <= '7')\n\t\t\t\t\tinbuf[j] = in - '2' + ('Z' - 'A') + 1;\n\t\t\t\telse if (in == '=')\n\t\t\t\t{\n\t\t\t\t\tinbuf[j] = 0;\n\t\t\t\t\tif (pad_start == 0) pad_start = j;\n\t\t\t\t}\n\t\t\t\telse if (in == '1')\n\t\t\t\t\tinbuf[j] = 'I' - 'A';\n\t\t\t\telse\n\t\t\t\t\treturn std::string();\n\t\t\t\tTORRENT_ASSERT(inbuf[j] == (inbuf[j] & 0x1f));\n\t\t\t}\n\n\t\t\t\/\/ decode inbuf to outbuf\n\t\t\toutbuf[0] = inbuf[0] << 3;\n\t\t\toutbuf[0] |= inbuf[1] >> 2;\n\t\t\toutbuf[1] = (inbuf[1] & 0x3) << 6;\n\t\t\toutbuf[1] |= inbuf[2] << 1;\n\t\t\toutbuf[1] |= (inbuf[3] & 0x10) >> 4;\n\t\t\toutbuf[2] = (inbuf[3] & 0x0f) << 4;\n\t\t\toutbuf[2] |= (inbuf[4] & 0x1e) >> 1;\n\t\t\toutbuf[3] = (inbuf[4] & 0x01) << 7;\n\t\t\toutbuf[3] |= (inbuf[5] & 0x1f) << 2;\n\t\t\toutbuf[3] |= (inbuf[6] & 0x18) >> 3;\n\t\t\toutbuf[4] = (inbuf[6] & 0x07) << 5;\n\t\t\toutbuf[4] |= inbuf[7];\n\n\t\t\tint input_output_mapping[] = {5, 1, 1, 2, 2, 3, 4, 4, 5};\n\t\t\tint num_out = input_output_mapping[pad_start];\n\n\t\t\t\/\/ write output\n\t\t\tstd::copy(outbuf, outbuf + num_out, std::back_inserter(ret));\n\t\t}\n\t\tstd::cerr << \" base32decode(): \" << ret << std::endl;\n\t\treturn ret;\n\t}\n\n\tboost::optional<std::string> url_has_argument(\n\t\tstd::string const& url, std::string argument)\n\t{\n\t\tsize_t i = url.find('?');\n\t\tif (i == std::string::npos) return boost::optional<std::string>();\n\t\t++i;\n\n\t\targument += '=';\n\n\t\tif (url.compare(i, argument.size(), argument) == 0)\n\t\t{\n\t\t\tsize_t pos = i + argument.size();\n\t\t\treturn url.substr(pos, url.find('&', pos) - pos);\n\t\t}\n\t\targument.insert(0, \"&\");\n\t\ti = url.find(argument, i);\n\t\tif (i == std::string::npos) return boost::optional<std::string>();\n\t\tsize_t pos = i + argument.size();\n\t\treturn url.substr(pos, url.find('&', pos) - pos);\n\t}\n\n}\n\n<commit_msg>removed debug output<commit_after>\/*\n\nCopyright (c) 2003, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n    * Redistributions of source code must retain the above copyright\n      notice, this list of conditions and the following disclaimer.\n    * Redistributions in binary form must reproduce the above copyright\n      notice, this list of conditions and the following disclaimer in\n      the documentation and\/or other materials provided with the distribution.\n    * Neither the name of the author nor the names of its\n      contributors may be used to endorse or promote products derived\n      from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/pch.hpp\"\n\n#include <string>\n#include <stdexcept>\n#include <sstream>\n#include <iomanip>\n#include <cctype>\n#include <algorithm>\n#include <iostream>\n\n#include <boost\/optional.hpp>\n\n#include \"libtorrent\/assert.hpp\"\n\nnamespace libtorrent\n{\n\tstd::string unescape_string(std::string const& s)\n\t{\n\t\tstd::string ret;\n\t\tfor (std::string::const_iterator i = s.begin(); i != s.end(); ++i)\n\t\t{\n\t\t\tif(*i == '+')\n\t\t\t{\n\t\t\t\tret += ' ';\n\t\t\t}\n\t\t\telse if (*i != '%')\n\t\t\t{\n\t\t\t\tret += *i;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t++i;\n\t\t\t\tif (i == s.end())\n\t\t\t\t\tthrow std::runtime_error(\"invalid escaped string\");\n\n\t\t\t\tint high;\n\t\t\t\tif(*i >= '0' && *i <= '9') high = *i - '0';\n\t\t\t\telse if(*i >= 'A' && *i <= 'F') high = *i + 10 - 'A';\n\t\t\t\telse if(*i >= 'a' && *i <= 'f') high = *i + 10 - 'a';\n\t\t\t\telse throw std::runtime_error(\"invalid escaped string\");\n\n\t\t\t\t++i;\n\t\t\t\tif (i == s.end())\n\t\t\t\t\tthrow std::runtime_error(\"invalid escaped string\");\n\n\t\t\t\tint low;\n\t\t\t\tif(*i >= '0' && *i <= '9') low = *i - '0';\n\t\t\t\telse if(*i >= 'A' && *i <= 'F') low = *i + 10 - 'A';\n\t\t\t\telse if(*i >= 'a' && *i <= 'f') low = *i + 10 - 'a';\n\t\t\t\telse throw std::runtime_error(\"invalid escaped string\");\n\n\t\t\t\tret += char(high * 16 + low);\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n\n\tstd::string escape_string(const char* str, int len)\n\t{\n\t\tTORRENT_ASSERT(str != 0);\n\t\tTORRENT_ASSERT(len >= 0);\n\t\t\/\/ http:\/\/www.ietf.org\/rfc\/rfc2396.txt\n\t\t\/\/ section 2.3\n\t\t\/\/ some trackers seems to require that ' is escaped\n\/\/\t\tstatic const char unreserved_chars[] = \"-_.!~*'()\";\n\t\tstatic const char unreserved_chars[] = \"-_.!~*()\"\n\t\t\t\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\"\n\t\t\t\"0123456789\";\n\n\t\tstd::stringstream ret;\n\t\tret << std::hex << std::setfill('0');\n\t\tfor (int i = 0; i < len; ++i)\n\t\t{\n\t\t\tif (std::count(\n\t\t\t\t\tunreserved_chars\n\t\t\t\t\t, unreserved_chars+sizeof(unreserved_chars)-1\n\t\t\t\t\t, *str))\n\t\t\t{\n\t\t\t\tret << *str;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tret << '%'\n\t\t\t\t\t<< std::setw(2)\n\t\t\t\t\t<< (int)static_cast<unsigned char>(*str);\n\t\t\t}\n\t\t\t++str;\n\t\t}\n\t\treturn ret.str();\n\t}\n\t\n\tstd::string escape_path(const char* str, int len)\n\t{\n\t\tTORRENT_ASSERT(str != 0);\n\t\tTORRENT_ASSERT(len >= 0);\n\t\tstatic const char unreserved_chars[] = \"\/-_.!~*()\"\n\t\t\t\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\"\n\t\t\t\"0123456789\";\n\n\t\tstd::stringstream ret;\n\t\tret << std::hex << std::setfill('0');\n\t\tfor (int i = 0; i < len; ++i)\n\t\t{\n\t\t\tif (std::count(\n\t\t\t\t\tunreserved_chars\n\t\t\t\t\t, unreserved_chars+sizeof(unreserved_chars)-1\n\t\t\t\t\t, *str))\n\t\t\t{\n\t\t\t\tret << *str;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tret << '%'\n\t\t\t\t\t<< std::setw(2)\n\t\t\t\t\t<< (int)static_cast<unsigned char>(*str);\n\t\t\t}\n\t\t\t++str;\n\t\t}\n\t\treturn ret.str();\n\t}\n\n\tstd::string base64encode(const std::string& s)\n\t{\n\t\tstatic const char base64_table[] =\n\t\t{\n\t\t\t'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H',\n\t\t\t'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P',\n\t\t\t'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X',\n\t\t\t'Y', 'Z', 'a', 'b', 'c', 'd', 'e', 'f',\n\t\t\t'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n',\n\t\t\t'o', 'p', 'q', 'r', 's', 't', 'u', 'v',\n\t\t\t'w', 'x', 'y', 'z', '0', '1', '2', '3',\n\t\t\t'4', '5', '6', '7', '8', '9', '+', '\/'\n\t\t};\n\n\t\tunsigned char inbuf[3];\n\t\tunsigned char outbuf[4];\n\t\n\t\tstd::string ret;\n\t\tfor (std::string::const_iterator i = s.begin(); i != s.end();)\n\t\t{\n\t\t\t\/\/ available input is 1,2 or 3 bytes\n\t\t\t\/\/ since we read 3 bytes at a time at most\n\t\t\tint available_input = (std::min)(3, (int)std::distance(i, s.end()));\n\n\t\t\t\/\/ clear input buffer\n\t\t\tstd::fill(inbuf, inbuf+3, 0);\n\n\t\t\t\/\/ read a chunk of input into inbuf\n\t\t\tstd::copy(i, i + available_input, inbuf);\n\t\t\ti += available_input;\n\n\t\t\t\/\/ encode inbuf to outbuf\n\t\t\toutbuf[0] = (inbuf[0] & 0xfc) >> 2;\n\t\t\toutbuf[1] = ((inbuf[0] & 0x03) << 4) | ((inbuf [1] & 0xf0) >> 4);\n\t\t\toutbuf[2] = ((inbuf[1] & 0x0f) << 2) | ((inbuf [2] & 0xc0) >> 6);\n\t\t\toutbuf[3] = inbuf[2] & 0x3f;\n\n\t\t\t\/\/ write output\n\t\t\tfor (int j = 0; j < available_input+1; ++j)\n\t\t\t{\n\t\t\t\tret += base64_table[outbuf[j]];\n\t\t\t}\n\n\t\t\t\/\/ write pad\n\t\t\tfor (int j = 0; j < 3 - available_input; ++j)\n\t\t\t{\n\t\t\t\tret += '=';\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n\n\tstd::string base32encode(std::string const& s)\n\t{\n\t\tstatic const char base32_table[] =\n\t\t{\n\t\t\t'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H',\n\t\t\t'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P',\n\t\t\t'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X',\n\t\t\t'Y', 'Z', '2', '3', '4', '5', '6', '7'\n\t\t};\n\n\t\tint input_output_mapping[] = {0, 2, 4, 5, 7, 8};\n\t\t\n\t\tunsigned char inbuf[5];\n\t\tunsigned char outbuf[8];\n\t\n\t\tstd::string ret;\n\t\tfor (std::string::const_iterator i = s.begin(); i != s.end();)\n\t\t{\n\t\t\tint available_input = (std::min)(5, (int)std::distance(i, s.end()));\n\n\t\t\t\/\/ clear input buffer\n\t\t\tstd::fill(inbuf, inbuf+5, 0);\n\n\t\t\t\/\/ read a chunk of input into inbuf\n\t\t\tstd::copy(i, i + available_input, inbuf);\n\t\t\ti += available_input;\n\n\t\t\t\/\/ encode inbuf to outbuf\n\t\t\toutbuf[0] = (inbuf[0] & 0xf8) >> 3;\n\t\t\toutbuf[1] = ((inbuf[0] & 0x07) << 2) | ((inbuf[1] & 0xc0) >> 6);\n\t\t\toutbuf[2] = ((inbuf[1] & 0x3e) >> 1);\n\t\t\toutbuf[3] = ((inbuf[1] & 0x01) << 4) | ((inbuf[2] & 0xf0) >> 4);\n\t\t\toutbuf[4] = ((inbuf[2] & 0x0f) << 1) | ((inbuf[3] & 0x80) >> 7);\n\t\t\toutbuf[5] = ((inbuf[3] & 0x7c) >> 2);\n\t\t\toutbuf[6] = ((inbuf[3] & 0x03) << 3) | ((inbuf[4] & 0xe0) >> 5);\n\t\t\toutbuf[7] = inbuf[4] & 0x1f;\n\n\t\t\t\/\/ write output\n\t\t\tint num_out = input_output_mapping[available_input];\n\t\t\tfor (int j = 0; j < num_out; ++j)\n\t\t\t{\n\t\t\t\tret += base32_table[outbuf[j]];\n\t\t\t}\n\n\t\t\t\/\/ write pad\n\t\t\tfor (int j = 0; j < 8 - num_out; ++j)\n\t\t\t{\n\t\t\t\tret += '=';\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n\n\tstd::string base32decode(std::string const& s)\n\t{\n\t\tunsigned char inbuf[8];\n\t\tunsigned char outbuf[5];\n\t\n\t\tstd::string ret;\n\t\tfor (std::string::const_iterator i = s.begin(); i != s.end();)\n\t\t{\n\t\t\tint available_input = (std::min)(8, (int)std::distance(i, s.end()));\n\n\t\t\tint pad_start = 0;\n\t\t\tif (available_input < 8) pad_start = available_input;\n\n\t\t\t\/\/ clear input buffer\n\t\t\tstd::fill(inbuf, inbuf+8, 0);\n\t\t\tfor (int j = 0; j < available_input; ++j)\n\t\t\t{\n\t\t\t\tchar in = std::toupper(*i++);\n\t\t\t\tif (in >= 'A' && in <= 'Z')\n\t\t\t\t\tinbuf[j] = in - 'A';\n\t\t\t\telse if (in >= '2' && in <= '7')\n\t\t\t\t\tinbuf[j] = in - '2' + ('Z' - 'A') + 1;\n\t\t\t\telse if (in == '=')\n\t\t\t\t{\n\t\t\t\t\tinbuf[j] = 0;\n\t\t\t\t\tif (pad_start == 0) pad_start = j;\n\t\t\t\t}\n\t\t\t\telse if (in == '1')\n\t\t\t\t\tinbuf[j] = 'I' - 'A';\n\t\t\t\telse\n\t\t\t\t\treturn std::string();\n\t\t\t\tTORRENT_ASSERT(inbuf[j] == (inbuf[j] & 0x1f));\n\t\t\t}\n\n\t\t\t\/\/ decode inbuf to outbuf\n\t\t\toutbuf[0] = inbuf[0] << 3;\n\t\t\toutbuf[0] |= inbuf[1] >> 2;\n\t\t\toutbuf[1] = (inbuf[1] & 0x3) << 6;\n\t\t\toutbuf[1] |= inbuf[2] << 1;\n\t\t\toutbuf[1] |= (inbuf[3] & 0x10) >> 4;\n\t\t\toutbuf[2] = (inbuf[3] & 0x0f) << 4;\n\t\t\toutbuf[2] |= (inbuf[4] & 0x1e) >> 1;\n\t\t\toutbuf[3] = (inbuf[4] & 0x01) << 7;\n\t\t\toutbuf[3] |= (inbuf[5] & 0x1f) << 2;\n\t\t\toutbuf[3] |= (inbuf[6] & 0x18) >> 3;\n\t\t\toutbuf[4] = (inbuf[6] & 0x07) << 5;\n\t\t\toutbuf[4] |= inbuf[7];\n\n\t\t\tint input_output_mapping[] = {5, 1, 1, 2, 2, 3, 4, 4, 5};\n\t\t\tint num_out = input_output_mapping[pad_start];\n\n\t\t\t\/\/ write output\n\t\t\tstd::copy(outbuf, outbuf + num_out, std::back_inserter(ret));\n\t\t}\n\t\treturn ret;\n\t}\n\n\tboost::optional<std::string> url_has_argument(\n\t\tstd::string const& url, std::string argument)\n\t{\n\t\tsize_t i = url.find('?');\n\t\tif (i == std::string::npos) return boost::optional<std::string>();\n\t\t++i;\n\n\t\targument += '=';\n\n\t\tif (url.compare(i, argument.size(), argument) == 0)\n\t\t{\n\t\t\tsize_t pos = i + argument.size();\n\t\t\treturn url.substr(pos, url.find('&', pos) - pos);\n\t\t}\n\t\targument.insert(0, \"&\");\n\t\ti = url.find(argument, i);\n\t\tif (i == std::string::npos) return boost::optional<std::string>();\n\t\tsize_t pos = i + argument.size();\n\t\treturn url.substr(pos, url.find('&', pos) - pos);\n\t}\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * Copyright (c) 2011-2015 libbitcoin developers (see AUTHORS)\n * Copyright (c) 2016-2018 metaverse core developers (see MVS-AUTHORS)\n *\n * This file is part of metaverse.\n *\n * metaverse 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#include <metaverse\/bitcoin\/chain\/transaction.hpp>\n\n#include <numeric>\n#include <sstream>\n#include <utility>\n#include <boost\/iostreams\/stream.hpp>\n#include <metaverse\/bitcoin\/chain\/input.hpp>\n#include <metaverse\/bitcoin\/chain\/output.hpp>\n#include <metaverse\/bitcoin\/constants.hpp>\n#include <metaverse\/bitcoin\/utility\/container_sink.hpp>\n#include <metaverse\/bitcoin\/utility\/container_source.hpp>\n#include <metaverse\/bitcoin\/utility\/istream_reader.hpp>\n#include <metaverse\/bitcoin\/utility\/ostream_writer.hpp>\n\nnamespace libbitcoin {\nnamespace chain {\n\ntransaction transaction::factory_from_data(const data_chunk& data)\n{\n    transaction instance;\n    instance.from_data(data);\n    return instance;\n}\n\ntransaction transaction::factory_from_data(std::istream& stream)\n{\n    transaction instance;\n    instance.from_data(stream);\n    return instance;\n}\n\ntransaction transaction::factory_from_data(reader& source)\n{\n    transaction instance;\n    instance.from_data(source);\n    return instance;\n}\n\n\/\/ default constructors\n\ntransaction::transaction()\n  : version(0), locktime(0), hash_(nullptr)\n{\n}\n\ntransaction::transaction(const transaction& other)\n  : transaction(other.version, other.locktime, other.inputs, other.outputs)\n{\n}\n\ntransaction::transaction(uint32_t version, uint32_t locktime,\n    const input::list& inputs, const output::list& outputs)\n  : version(version),\n    locktime(locktime),\n    inputs(inputs),\n    outputs(outputs),\n    hash_(nullptr)\n{\n}\n\ntransaction::transaction(transaction&& other)\n  : transaction(other.version, other.locktime,\n        std::forward<input::list>(other.inputs),\n        std::forward<output::list>(other.outputs))\n{\n}\n\ntransaction::transaction(uint32_t version, uint32_t locktime,\n    input::list&& inputs, output::list&& outputs)\n  : version(version),\n    locktime(locktime),\n    inputs(std::forward<input::list>(inputs)),\n    outputs(std::forward<output::list>(outputs)),\n    hash_(nullptr)\n{\n}\n\ntransaction& transaction::operator=(transaction&& other)\n{\n    version = other.version;\n    locktime = other.locktime;\n    inputs = std::move(other.inputs);\n    outputs = std::move(other.outputs);\n    return *this;\n}\n\n\/\/ TODO: eliminate blockchain transaction copies and then delete this.\ntransaction& transaction::operator=(const transaction& other)\n{\n    version = other.version;\n    locktime = other.locktime;\n    inputs = other.inputs;\n    outputs = other.outputs;\n    return *this;\n}\n\nbool transaction::is_valid() const\n{\n    return (version != 0) || (locktime != 0) || !inputs.empty() ||\n        !outputs.empty();\n}\n\nvoid transaction::reset()\n{\n    version = 0;\n    locktime = 0;\n    inputs.clear();\n    inputs.shrink_to_fit();\n    outputs.clear();\n    outputs.shrink_to_fit();\n\n    mutex_.lock();\n    hash_.reset();\n    mutex_.unlock();\n}\n\nbool transaction::from_data(const data_chunk& data)\n{\n    data_source istream(data);\n    return from_data(istream);\n}\n\nbool transaction::from_data(std::istream& stream)\n{\n    istream_reader source(stream);\n    return from_data(source);\n}\n\nbool transaction::from_data(reader& source)\n{\n    reset();\n    version = source.read_4_bytes_little_endian();\n    auto result = static_cast<bool>(source);\n\n    if (result)\n    {\n        const auto tx_in_count = source.read_variable_uint_little_endian();\n        result = source;\n\n        if (result)\n        {\n            inputs.resize(tx_in_count);\n\n            for (auto& input: inputs)\n            {\n                result = input.from_data(source);\n\n                if (!result)\n                    break;\n            }\n        }\n    }\n\n    if (result)\n    {\n        const auto tx_out_count = source.read_variable_uint_little_endian();\n        result = source;\n\n        if (result)\n        {\n            outputs.resize(tx_out_count);\n\n            for (auto& output: outputs)\n            {\n                result = output.from_data(source);\n\n                if (!result)\n                    break;\n            }\n        }\n    }\n\n    if (result)\n    {\n        locktime = source.read_4_bytes_little_endian();\n        result = source;\n    }\n\n    if (!result)\n        reset();\n\n    return result;\n}\n\ndata_chunk transaction::to_data() const\n{\n    data_chunk data;\n    data_sink ostream(data);\n    to_data(ostream);\n    ostream.flush();\n\n    BITCOIN_ASSERT(data.size() == serialized_size());\n\n    return data;\n}\n\nvoid transaction::to_data(std::ostream& stream) const\n{\n    ostream_writer sink(stream);\n    to_data(sink);\n}\n\nvoid transaction::to_data(writer& sink) const\n{\n    sink.write_4_bytes_little_endian(version);\n    sink.write_variable_uint_little_endian(inputs.size());\n\n    for (const auto& input: inputs)\n        input.to_data(sink);\n\n    sink.write_variable_uint_little_endian(outputs.size());\n\n    for (const auto& output: outputs)\n        output.to_data(sink);\n\n    sink.write_4_bytes_little_endian(locktime);\n}\n\nuint64_t transaction::serialized_size() const\n{\n    uint64_t tx_size = 8;\n    tx_size += variable_uint_size(inputs.size());\n    for (const auto& input: inputs)\n        tx_size += input.serialized_size();\n\n    tx_size += variable_uint_size(outputs.size());\n    for (const auto& output: outputs)\n        tx_size += output.serialized_size();\n\n    return tx_size;\n}\n\nstd::string transaction::to_string(uint32_t flags) const\n{\n    std::ostringstream value;\n    value << \"Transaction:\\n\"\n        << \"\\tversion = \" << version << \"\\n\"\n        << \"\\tlocktime = \" << locktime << \"\\n\"\n        << \"Inputs:\\n\";\n\n    for (const auto input: inputs)\n        value << input.to_string(flags);\n\n    value << \"Outputs:\\n\";\n    for (const auto output: outputs)\n        value << output.to_string(flags);\n\n    value << \"\\n\";\n    return value.str();\n}\n\nhash_digest transaction::hash() const\n{\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ Critical Section\n    mutex_.lock_upgrade();\n\n    if (!hash_)\n    {\n        \/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n        mutex_.unlock_upgrade_and_lock();\n        hash_.reset(new hash_digest(bitcoin_hash(to_data())));\n        mutex_.unlock_and_lock_upgrade();\n        \/\/---------------------------------------------------------------------\n    }\n\n    hash_digest hash = *hash_;\n    mutex_.unlock_upgrade();\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n    return hash;\n}\n\nhash_digest transaction::hash(uint32_t sighash_type) const\n{\n    auto serialized = to_data();\n    extend_data(serialized, to_little_endian(sighash_type));\n    return bitcoin_hash(serialized);\n}\n\nbool transaction::is_coinbase() const\n{\n    return (inputs.size() == 1) && inputs[0].previous_output.is_null();\n}\n\nbool transaction::is_final(uint64_t block_height, uint32_t block_time) const\n{\n    if (locktime == 0)\n        return true;\n\n    auto max_locktime = block_time;\n\n    if (locktime < locktime_threshold)\n        max_locktime = static_cast<uint32_t>(block_height);\n\n    if (locktime < max_locktime)\n        return true;\n\n    for (const auto& tx_input: inputs)\n        if (!tx_input.is_final())\n            return false;\n\n    return true;\n}\n\nbool transaction::is_locktime_conflict() const\n{\n    auto locktime_set = locktime != 0;\n\n    if (locktime_set)\n        for (const auto& input: inputs)\n            if (input.sequence < max_input_sequence)\n                return false;\n\n    return locktime_set;\n}\n\nuint64_t transaction::total_output_value() const\n{\n    const auto value = [](uint64_t total, const output& output)\n    {\n        return total + output.value;\n    };\n\n    return std::accumulate(outputs.begin(), outputs.end(), uint64_t(0), value);\n}\n\nuint64_t transaction::total_output_transfer_amount() const\n{\n    const auto value = [](uint64_t total, const output& output)\n    {\n        \/\/ asset issue and asset transfer can not co-exist in one transaction outputs.\n        \/\/ asset secondary issue is from air, so not add its amount to pass amount check.\n        if (output.is_asset_secondaryissue()) {\n            return total;\n        }\n        return total + output.get_asset_amount();\n    };\n    return std::accumulate(outputs.begin(), outputs.end(), uint64_t(0), value);\n}\n\nbool transaction::has_asset_issue() const\n{\n    for (auto& elem: outputs) {\n        if(elem.is_asset_issue())\n            return true;\n    }\n    return false;\n}\n\nbool transaction::has_asset_secondary_issue() const\n{\n    for (auto& elem: outputs) {\n        if(elem.is_asset_secondaryissue())\n            return true;\n    }\n    return false;\n}\n\n\nbool transaction::has_asset_transfer() const\n{\n    for (auto& elem: outputs) {\n        if(elem.is_asset_transfer())\n            return true;\n    }\n    return false;\n}\n\nbool transaction::has_asset_cert() const\n{\n    for (auto& elem: outputs) {\n        if(elem.is_asset_cert())\n            return true;\n    }\n    return false;\n}\n\nbool transaction::has_asset_mit_transfer() const\n{\n    for (auto& elem: outputs) {\n        if(elem.is_asset_mit_transfer())\n            return true;\n    }\n    return false;\n}\n\nbool transaction::has_did_register() const\n{\n    for (auto& elem: outputs) {\n        if(elem.is_did_register())\n            return true;\n    }\n    return false;\n}\n\nbool transaction::has_did_transfer() const\n{\n\tfor (auto& elem: outputs) {\n\t\tif(elem.is_did_transfer())\n\t\t\treturn true;\n\t}\n\treturn false;\n}\n\nstd::string transaction::get_did_transfer_old_address() const\n{\n    std::string newdidstr = \"\";\n\tfor (auto& elem: outputs) {\n\t\tif(elem.is_did_transfer()) {\n            newdidstr = elem.get_script_address();\n        }\n\n\t}\n\n    if (newdidstr.empty()){\n        return newdidstr;\n    }\n\n    for (auto& elem: inputs) {\n\t\tif(elem.get_script_address()!=newdidstr) {\n            newdidstr = elem.get_script_address();\n            return newdidstr;\n        }\n\n\t}\n\n\n    return newdidstr;\n}\n\n} \/\/ namspace chain\n} \/\/ namspace libbitcoin\n<commit_msg>fix sync block #810376, has 0 amount asset transfer.<commit_after>\/**\n * Copyright (c) 2011-2015 libbitcoin developers (see AUTHORS)\n * Copyright (c) 2016-2018 metaverse core developers (see MVS-AUTHORS)\n *\n * This file is part of metaverse.\n *\n * metaverse 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#include <metaverse\/bitcoin\/chain\/transaction.hpp>\n\n#include <numeric>\n#include <sstream>\n#include <utility>\n#include <boost\/iostreams\/stream.hpp>\n#include <metaverse\/bitcoin\/chain\/input.hpp>\n#include <metaverse\/bitcoin\/chain\/output.hpp>\n#include <metaverse\/bitcoin\/constants.hpp>\n#include <metaverse\/bitcoin\/utility\/container_sink.hpp>\n#include <metaverse\/bitcoin\/utility\/container_source.hpp>\n#include <metaverse\/bitcoin\/utility\/istream_reader.hpp>\n#include <metaverse\/bitcoin\/utility\/ostream_writer.hpp>\n\nnamespace libbitcoin {\nnamespace chain {\n\ntransaction transaction::factory_from_data(const data_chunk& data)\n{\n    transaction instance;\n    instance.from_data(data);\n    return instance;\n}\n\ntransaction transaction::factory_from_data(std::istream& stream)\n{\n    transaction instance;\n    instance.from_data(stream);\n    return instance;\n}\n\ntransaction transaction::factory_from_data(reader& source)\n{\n    transaction instance;\n    instance.from_data(source);\n    return instance;\n}\n\n\/\/ default constructors\n\ntransaction::transaction()\n  : version(0), locktime(0), hash_(nullptr)\n{\n}\n\ntransaction::transaction(const transaction& other)\n  : transaction(other.version, other.locktime, other.inputs, other.outputs)\n{\n}\n\ntransaction::transaction(uint32_t version, uint32_t locktime,\n    const input::list& inputs, const output::list& outputs)\n  : version(version),\n    locktime(locktime),\n    inputs(inputs),\n    outputs(outputs),\n    hash_(nullptr)\n{\n}\n\ntransaction::transaction(transaction&& other)\n  : transaction(other.version, other.locktime,\n        std::forward<input::list>(other.inputs),\n        std::forward<output::list>(other.outputs))\n{\n}\n\ntransaction::transaction(uint32_t version, uint32_t locktime,\n    input::list&& inputs, output::list&& outputs)\n  : version(version),\n    locktime(locktime),\n    inputs(std::forward<input::list>(inputs)),\n    outputs(std::forward<output::list>(outputs)),\n    hash_(nullptr)\n{\n}\n\ntransaction& transaction::operator=(transaction&& other)\n{\n    version = other.version;\n    locktime = other.locktime;\n    inputs = std::move(other.inputs);\n    outputs = std::move(other.outputs);\n    return *this;\n}\n\n\/\/ TODO: eliminate blockchain transaction copies and then delete this.\ntransaction& transaction::operator=(const transaction& other)\n{\n    version = other.version;\n    locktime = other.locktime;\n    inputs = other.inputs;\n    outputs = other.outputs;\n    return *this;\n}\n\nbool transaction::is_valid() const\n{\n    return (version != 0) || (locktime != 0) || !inputs.empty() ||\n        !outputs.empty();\n}\n\nvoid transaction::reset()\n{\n    version = 0;\n    locktime = 0;\n    inputs.clear();\n    inputs.shrink_to_fit();\n    outputs.clear();\n    outputs.shrink_to_fit();\n\n    mutex_.lock();\n    hash_.reset();\n    mutex_.unlock();\n}\n\nbool transaction::from_data(const data_chunk& data)\n{\n    data_source istream(data);\n    return from_data(istream);\n}\n\nbool transaction::from_data(std::istream& stream)\n{\n    istream_reader source(stream);\n    return from_data(source);\n}\n\nbool transaction::from_data(reader& source)\n{\n    reset();\n    version = source.read_4_bytes_little_endian();\n    auto result = static_cast<bool>(source);\n\n    if (result)\n    {\n        const auto tx_in_count = source.read_variable_uint_little_endian();\n        result = source;\n\n        if (result)\n        {\n            inputs.resize(tx_in_count);\n\n            for (auto& input: inputs)\n            {\n                result = input.from_data(source);\n\n                if (!result)\n                    break;\n            }\n        }\n    }\n\n    if (result)\n    {\n        const auto tx_out_count = source.read_variable_uint_little_endian();\n        result = source;\n\n        if (result)\n        {\n            outputs.resize(tx_out_count);\n\n            for (auto& output: outputs)\n            {\n                result = output.from_data(source);\n\n                if (!result)\n                    break;\n            }\n        }\n    }\n\n    if (result)\n    {\n        locktime = source.read_4_bytes_little_endian();\n        result = source;\n    }\n\n    if (!result)\n        reset();\n\n    return result;\n}\n\ndata_chunk transaction::to_data() const\n{\n    data_chunk data;\n    data_sink ostream(data);\n    to_data(ostream);\n    ostream.flush();\n\n    BITCOIN_ASSERT(data.size() == serialized_size());\n\n    return data;\n}\n\nvoid transaction::to_data(std::ostream& stream) const\n{\n    ostream_writer sink(stream);\n    to_data(sink);\n}\n\nvoid transaction::to_data(writer& sink) const\n{\n    sink.write_4_bytes_little_endian(version);\n    sink.write_variable_uint_little_endian(inputs.size());\n\n    for (const auto& input: inputs)\n        input.to_data(sink);\n\n    sink.write_variable_uint_little_endian(outputs.size());\n\n    for (const auto& output: outputs)\n        output.to_data(sink);\n\n    sink.write_4_bytes_little_endian(locktime);\n}\n\nuint64_t transaction::serialized_size() const\n{\n    uint64_t tx_size = 8;\n    tx_size += variable_uint_size(inputs.size());\n    for (const auto& input: inputs)\n        tx_size += input.serialized_size();\n\n    tx_size += variable_uint_size(outputs.size());\n    for (const auto& output: outputs)\n        tx_size += output.serialized_size();\n\n    return tx_size;\n}\n\nstd::string transaction::to_string(uint32_t flags) const\n{\n    std::ostringstream value;\n    value << \"Transaction:\\n\"\n        << \"\\tversion = \" << version << \"\\n\"\n        << \"\\tlocktime = \" << locktime << \"\\n\"\n        << \"Inputs:\\n\";\n\n    for (const auto input: inputs)\n        value << input.to_string(flags);\n\n    value << \"Outputs:\\n\";\n    for (const auto output: outputs)\n        value << output.to_string(flags);\n\n    value << \"\\n\";\n    return value.str();\n}\n\nhash_digest transaction::hash() const\n{\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ Critical Section\n    mutex_.lock_upgrade();\n\n    if (!hash_)\n    {\n        \/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n        mutex_.unlock_upgrade_and_lock();\n        hash_.reset(new hash_digest(bitcoin_hash(to_data())));\n        mutex_.unlock_and_lock_upgrade();\n        \/\/---------------------------------------------------------------------\n    }\n\n    hash_digest hash = *hash_;\n    mutex_.unlock_upgrade();\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n    return hash;\n}\n\nhash_digest transaction::hash(uint32_t sighash_type) const\n{\n    auto serialized = to_data();\n    extend_data(serialized, to_little_endian(sighash_type));\n    return bitcoin_hash(serialized);\n}\n\nbool transaction::is_coinbase() const\n{\n    return (inputs.size() == 1) && inputs[0].previous_output.is_null();\n}\n\nbool transaction::is_final(uint64_t block_height, uint32_t block_time) const\n{\n    if (locktime == 0)\n        return true;\n\n    auto max_locktime = block_time;\n\n    if (locktime < locktime_threshold)\n        max_locktime = static_cast<uint32_t>(block_height);\n\n    if (locktime < max_locktime)\n        return true;\n\n    for (const auto& tx_input: inputs)\n        if (!tx_input.is_final())\n            return false;\n\n    return true;\n}\n\nbool transaction::is_locktime_conflict() const\n{\n    auto locktime_set = locktime != 0;\n\n    if (locktime_set)\n        for (const auto& input: inputs)\n            if (input.sequence < max_input_sequence)\n                return false;\n\n    return locktime_set;\n}\n\nuint64_t transaction::total_output_value() const\n{\n    const auto value = [](uint64_t total, const output& output)\n    {\n        return total + output.value;\n    };\n\n    return std::accumulate(outputs.begin(), outputs.end(), uint64_t(0), value);\n}\n\nuint64_t transaction::total_output_transfer_amount() const\n{\n    const auto value = [](uint64_t total, const output& output)\n    {\n        \/\/ asset issue and asset transfer can not co-exist in one transaction outputs.\n        \/\/ asset secondary issue is from air, so not add its amount to pass amount check.\n        if (output.is_asset_secondaryissue()) {\n            return total;\n        }\n        return total + output.get_asset_amount();\n    };\n    return std::accumulate(outputs.begin(), outputs.end(), uint64_t(0), value);\n}\n\nbool transaction::has_asset_issue() const\n{\n    for (auto& elem: outputs) {\n        if(elem.is_asset_issue())\n            return true;\n    }\n    return false;\n}\n\nbool transaction::has_asset_secondary_issue() const\n{\n    for (auto& elem: outputs) {\n        if(elem.is_asset_secondaryissue())\n            return true;\n    }\n    return false;\n}\n\n\nbool transaction::has_asset_transfer() const\n{\n    for (auto& elem: outputs) {\n        if(elem.is_asset_transfer()\n            && elem.get_asset_amount()) \/\/ block #810376 has 0 asset transfer without input\n            return true;\n    }\n    return false;\n}\n\nbool transaction::has_asset_cert() const\n{\n    for (auto& elem: outputs) {\n        if(elem.is_asset_cert())\n            return true;\n    }\n    return false;\n}\n\nbool transaction::has_asset_mit_transfer() const\n{\n    for (auto& elem: outputs) {\n        if(elem.is_asset_mit_transfer())\n            return true;\n    }\n    return false;\n}\n\nbool transaction::has_did_register() const\n{\n    for (auto& elem: outputs) {\n        if(elem.is_did_register())\n            return true;\n    }\n    return false;\n}\n\nbool transaction::has_did_transfer() const\n{\n\tfor (auto& elem: outputs) {\n\t\tif(elem.is_did_transfer())\n\t\t\treturn true;\n\t}\n\treturn false;\n}\n\nstd::string transaction::get_did_transfer_old_address() const\n{\n    std::string newdidstr = \"\";\n\tfor (auto& elem: outputs) {\n\t\tif(elem.is_did_transfer()) {\n            newdidstr = elem.get_script_address();\n        }\n\n\t}\n\n    if (newdidstr.empty()){\n        return newdidstr;\n    }\n\n    for (auto& elem: inputs) {\n\t\tif(elem.get_script_address()!=newdidstr) {\n            newdidstr = elem.get_script_address();\n            return newdidstr;\n        }\n\n\t}\n\n\n    return newdidstr;\n}\n\n} \/\/ namspace chain\n} \/\/ namspace libbitcoin\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *\n *    Copyright (c) 2020 Project CHIP 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 \"Server.h\"\n\n#include <errno.h>\n#include <utility>\n\n#include <lib\/dnssd\/minimal_mdns\/core\/DnsHeader.h>\n\nnamespace mdns {\nnamespace Minimal {\nnamespace {\n\nclass ShutdownOnError\n{\npublic:\n    ShutdownOnError(ServerBase * s) : mServer(s) {}\n    ~ShutdownOnError()\n    {\n        if (mServer != nullptr)\n        {\n            mServer->Shutdown();\n        }\n    }\n\n    CHIP_ERROR ReturnSuccess()\n    {\n        mServer = nullptr;\n        return CHIP_NO_ERROR;\n    }\n\nprivate:\n    ServerBase * mServer;\n};\n\n\/**\n * Extracts the Listening UDP Endpoint from an underlying ServerBase::EndpointInfo\n *\/\nclass ListenSocketPickerDelegate : public ServerBase::BroadcastSendDelegate\n{\npublic:\n    chip::Inet::UDPEndPoint * Accept(ServerBase::EndpointInfo * info) override { return info->mListenUdp; }\n};\n\n#if CHIP_MINMDNS_USE_EPHEMERAL_UNICAST_PORT\n\n\/**\n * Extracts the Querying UDP Endpoint from an underlying ServerBase::EndpointInfo\n *\/\nclass QuerySocketPickerDelegate : public ServerBase::BroadcastSendDelegate\n{\npublic:\n    chip::Inet::UDPEndPoint * Accept(ServerBase::EndpointInfo * info) override { return info->mUnicastQueryUdp; }\n};\n\n#else\n\nusing QuerySocketPickerDelegate = ListenSocketPickerDelegate;\n\n#endif\n\n\/**\n * Validates that an endpoint belongs to a specific interface\/ip address type before forwarding the\n * endpoint accept logic to another BroadcastSendDelegate.\n *\n * Usage like:\n *\n * SomeDelegate *child = ....;\n * InterfaceTypeFilterDelegate filter(interfaceId, IPAddressType::IPv6, child);\n *\n * UDPEndPoint *udp = filter.Accept(endpointInfo);\n *\/\nclass InterfaceTypeFilterDelegate : public ServerBase::BroadcastSendDelegate\n{\npublic:\n    InterfaceTypeFilterDelegate(chip::Inet::InterfaceId interface, chip::Inet::IPAddressType type,\n                                ServerBase::BroadcastSendDelegate * child) :\n        mInterface(interface),\n        mAddressType(type), mChild(child)\n    {}\n\n    chip::Inet::UDPEndPoint * Accept(ServerBase::EndpointInfo * info) override\n    {\n        if ((info->mInterfaceId != mInterface) && (info->mInterfaceId != chip::Inet::InterfaceId::Null()))\n        {\n            return nullptr;\n        }\n\n        if ((mAddressType != chip::Inet::IPAddressType::kAny) && (info->mAddressType != mAddressType))\n        {\n            return nullptr;\n        }\n\n        return mChild->Accept(info);\n    }\n\nprivate:\n    chip::Inet::InterfaceId mInterface;\n    chip::Inet::IPAddressType mAddressType;\n    ServerBase::BroadcastSendDelegate * mChild = nullptr;\n};\n\n} \/\/ namespace\n\nnamespace BroadcastIpAddresses {\n\n\/\/ Get standard mDNS Broadcast addresses\n\nvoid GetIpv6Into(chip::Inet::IPAddress & dest)\n{\n    if (!chip::Inet::IPAddress::FromString(\"FF02::FB\", dest))\n    {\n        ChipLogError(Discovery, \"Failed to parse standard IPv6 broadcast address\");\n    }\n}\n\nvoid GetIpv4Into(chip::Inet::IPAddress & dest)\n{\n    if (!chip::Inet::IPAddress::FromString(\"224.0.0.251\", dest))\n    {\n        ChipLogError(Discovery, \"Failed to parse standard IPv4 broadcast address\");\n    }\n}\n\n} \/\/ namespace BroadcastIpAddresses\n\nnamespace {\n\nCHIP_ERROR JoinMulticastGroup(chip::Inet::InterfaceId interfaceId, chip::Inet::UDPEndPoint * endpoint,\n                              chip::Inet::IPAddressType addressType)\n{\n\n    chip::Inet::IPAddress address;\n\n    if (addressType == chip::Inet::IPAddressType::kIPv6)\n    {\n        BroadcastIpAddresses::GetIpv6Into(address);\n#if INET_CONFIG_ENABLE_IPV4\n    }\n    else if (addressType == chip::Inet::IPAddressType::kIPv4)\n    {\n        BroadcastIpAddresses::GetIpv4Into(address);\n#endif \/\/ INET_CONFIG_ENABLE_IPV4\n    }\n    else\n    {\n        return CHIP_ERROR_INVALID_ARGUMENT;\n    }\n\n    return endpoint->JoinMulticastGroup(interfaceId, address);\n}\n\n#if CHIP_ERROR_LOGGING\nconst char * AddressTypeStr(chip::Inet::IPAddressType addressType)\n{\n    switch (addressType)\n    {\n    case chip::Inet::IPAddressType::kIPv6:\n        return \"IPv6\";\n#if INET_CONFIG_ENABLE_IPV4\n    case chip::Inet::IPAddressType::kIPv4:\n        return \"IPv4\";\n#endif \/\/ INET_CONFIG_ENABLE_IPV4\n    default:\n        return \"UNKNOWN\";\n    }\n}\n#endif\n\n} \/\/ namespace\n\nServerBase::~ServerBase()\n{\n    Shutdown();\n}\n\nvoid ServerBase::Shutdown()\n{\n    mEndpoints.ReleaseAll();\n}\n\nvoid ServerBase::ShutdownEndpoint(EndpointInfo & aEndpoint)\n{\n    mEndpoints.ReleaseObject(&aEndpoint);\n}\n\nbool ServerBase::IsListening() const\n{\n    bool listening = false;\n    mEndpoints.ForEachActiveObject([&](auto * endpoint) {\n        if (endpoint->mListenUdp != nullptr)\n        {\n            listening = true;\n            return chip::Loop::Break;\n        }\n        return chip::Loop::Continue;\n    });\n    return listening;\n}\n\nCHIP_ERROR ServerBase::Listen(chip::Inet::EndPointManager<chip::Inet::UDPEndPoint> * udpEndPointManager, ListenIterator * it,\n                              uint16_t port)\n{\n    Shutdown(); \/\/ ensure everything starts fresh\n\n    chip::Inet::InterfaceId interfaceId = chip::Inet::InterfaceId::Null();\n    chip::Inet::IPAddressType addressType;\n\n    ShutdownOnError autoShutdown(this);\n\n    while (it->Next(&interfaceId, &addressType))\n    {\n        chip::Inet::UDPEndPoint * listenUdp;\n        ReturnErrorOnFailure(udpEndPointManager->NewEndPoint(&listenUdp));\n        std::unique_ptr<chip::Inet::UDPEndPoint, EndpointInfo::EndPointDeletor> endPointHolder(listenUdp, {});\n\n        ReturnErrorOnFailure(listenUdp->Bind(addressType, chip::Inet::IPAddress::Any, port, interfaceId));\n\n        ReturnErrorOnFailure(listenUdp->Listen(OnUdpPacketReceived, nullptr \/*OnReceiveError*\/, this));\n\n        CHIP_ERROR err = JoinMulticastGroup(interfaceId, listenUdp, addressType);\n        if (err != CHIP_NO_ERROR)\n        {\n            char interfaceName[chip::Inet::InterfaceId::kMaxIfNameLength];\n            interfaceId.GetInterfaceName(interfaceName, sizeof(interfaceName));\n\n            \/\/ Log only as non-fatal error. Failure to join will mean we reply to unicast queries only.\n            ChipLogError(DeviceLayer, \"MDNS failed to join multicast group on %s for address type %s: %s\", interfaceName,\n                         AddressTypeStr(addressType), chip::ErrorStr(err));\n\n            endPointHolder.reset();\n        }\n\n#if CHIP_MINMDNS_USE_EPHEMERAL_UNICAST_PORT\n        \/\/ Separate UDP endpoint for unicast queries, bound to 0 (i.e. pick random ephemeral port)\n        \/\/   - helps in not having conflicts on port 5353, will receive unicast replies directly\n        \/\/   - has a *DRAWBACK* of unicast queries being considered LEGACY by mdns since they do\n        \/\/     not originate from 5353 and the answers will include a query section.\n        chip::Inet::UDPEndPoint * unicastQueryUdp;\n        ReturnErrorOnFailure(udpEndPointManager->NewEndPoint(&unicastQueryUdp));\n        std::unique_ptr<chip::Inet::UDPEndPoint, EndpointInfo::EndPointDeletor> endPointHolderUnicast(unicastQueryUdp, {});\n        ReturnErrorOnFailure(unicastQueryUdp->Bind(addressType, chip::Inet::IPAddress::Any, 0, interfaceId));\n        ReturnErrorOnFailure(unicastQueryUdp->Listen(OnUdpPacketReceived, nullptr \/*OnReceiveError*\/, this));\n#endif\n\n#if CHIP_MINMDNS_USE_EPHEMERAL_UNICAST_PORT\n        if (endPointHolder || endPointHolderUnicast)\n        {\n            \/\/ If allocation fails, the rref will not be consumed, so that the endpoint will also be freed correctly\n            mEndpoints.CreateObject(interfaceId, addressType, std::move(endPointHolder), std::move(endPointHolderUnicast));\n        }\n#else\n        if (endPointHolder)\n        {\n            \/\/ If allocation fails, the rref will not be consumed, so that the endpoint will also be freed correctly\n            mEndpoints.CreateObject(interfaceId, addressType, std::move(endPointHolder));\n        }\n#endif\n    }\n\n    return autoShutdown.ReturnSuccess();\n}\n\nCHIP_ERROR ServerBase::DirectSend(chip::System::PacketBufferHandle && data, const chip::Inet::IPAddress & addr, uint16_t port,\n                                  chip::Inet::InterfaceId interface)\n{\n    CHIP_ERROR err = CHIP_ERROR_NOT_CONNECTED;\n    mEndpoints.ForEachActiveObject([&](auto * info) {\n        if (info->mListenUdp == nullptr)\n        {\n            return chip::Loop::Continue;\n        }\n\n        if (info->mAddressType != addr.Type())\n        {\n            return chip::Loop::Continue;\n        }\n\n        chip::Inet::InterfaceId boundIf = info->mListenUdp->GetBoundInterface();\n\n        if ((boundIf.IsPresent()) && (boundIf != interface))\n        {\n            return chip::Loop::Continue;\n        }\n\n        err = info->mListenUdp->SendTo(addr, port, std::move(data));\n        return chip::Loop::Break;\n    });\n\n    return err;\n}\n\nCHIP_ERROR ServerBase::BroadcastUnicastQuery(chip::System::PacketBufferHandle && data, uint16_t port)\n{\n    QuerySocketPickerDelegate socketPicker;\n    return BroadcastImpl(std::move(data), port, &socketPicker);\n}\n\nCHIP_ERROR ServerBase::BroadcastUnicastQuery(chip::System::PacketBufferHandle && data, uint16_t port,\n                                             chip::Inet::InterfaceId interface, chip::Inet::IPAddressType addressType)\n{\n    QuerySocketPickerDelegate socketPicker;\n    InterfaceTypeFilterDelegate filter(interface, addressType, &socketPicker);\n\n    return BroadcastImpl(std::move(data), port, &filter);\n}\n\nCHIP_ERROR ServerBase::BroadcastSend(chip::System::PacketBufferHandle && data, uint16_t port, chip::Inet::InterfaceId interface,\n                                     chip::Inet::IPAddressType addressType)\n{\n    ListenSocketPickerDelegate socketPicker;\n    InterfaceTypeFilterDelegate filter(interface, addressType, &socketPicker);\n\n    return BroadcastImpl(std::move(data), port, &filter);\n}\n\nCHIP_ERROR ServerBase::BroadcastSend(chip::System::PacketBufferHandle && data, uint16_t port)\n{\n    ListenSocketPickerDelegate socketPicker;\n    return BroadcastImpl(std::move(data), port, &socketPicker);\n}\n\nCHIP_ERROR ServerBase::BroadcastImpl(chip::System::PacketBufferHandle && data, uint16_t port, BroadcastSendDelegate * delegate)\n{\n    \/\/ Broadcast requires sending data multiple times, each of which may error\n    \/\/ out, yet broadcast only has a single error code.\n    \/\/\n    \/\/ The general logic of error handling is:\n    \/\/   - if no send done at all, return error\n    \/\/   - if at least one broadcast succeeds, assume success overall\n    \/\/   + some internal consistency validations for state error.\n\n    bool hadSuccesfulSend = false;\n    CHIP_ERROR lastError  = CHIP_ERROR_NO_ENDPOINT;\n\n    if (chip::Loop::Break == mEndpoints.ForEachActiveObject([&](auto * info) {\n            chip::Inet::UDPEndPoint * udp = delegate->Accept(info);\n\n            if (udp == nullptr)\n            {\n                return chip::Loop::Continue;\n            }\n\n            CHIP_ERROR err = CHIP_NO_ERROR;\n\n            \/\/\/ The same packet needs to be sent over potentially multiple interfaces.\n            \/\/\/ LWIP does not like having a pbuf sent over serparate interfaces, hence we create a copy\n            \/\/\/ for sending via `CloneData`\n            \/\/\/\n            \/\/\/ TODO: this wastes one copy of the data and that could be optimized away\n            if (info->mAddressType == chip::Inet::IPAddressType::kIPv6)\n            {\n                err = udp->SendTo(mIpv6BroadcastAddress, port, data.CloneData(), udp->GetBoundInterface());\n            }\n#if INET_CONFIG_ENABLE_IPV4\n            else if (info->mAddressType == chip::Inet::IPAddressType::kIPv4)\n            {\n                err = udp->SendTo(mIpv4BroadcastAddress, port, data.CloneData(), udp->GetBoundInterface());\n            }\n#endif\n            else\n            {\n                \/\/ This is a general error of internal consistency: every address has a known type. Fail completely otherwise.\n                lastError = CHIP_ERROR_INCORRECT_STATE;\n                return chip::Loop::Break;\n            }\n\n            if (err == CHIP_NO_ERROR)\n            {\n                hadSuccesfulSend = true;\n            }\n            else\n            {\n                lastError = err;\n#if CHIP_DETAIL_LOGGING\n                char ifaceName[chip::Inet::InterfaceId::kMaxIfNameLength];\n                err = info->mInterfaceId.GetInterfaceName(ifaceName, sizeof(ifaceName));\n                if (err != CHIP_NO_ERROR)\n                    strcpy(ifaceName, \"???\");\n                ChipLogDetail(Discovery, \"Warning: Attempt to mDNS broadcast failed on %s:  %s\", ifaceName, lastError.AsString());\n#endif\n            }\n            return chip::Loop::Continue;\n        }))\n    {\n        return lastError;\n    }\n\n    if (!hadSuccesfulSend)\n    {\n        return lastError;\n    }\n\n    return CHIP_NO_ERROR;\n}\n\nvoid ServerBase::OnUdpPacketReceived(chip::Inet::UDPEndPoint * endPoint, chip::System::PacketBufferHandle && buffer,\n                                     const chip::Inet::IPPacketInfo * info)\n{\n    ServerBase * srv = static_cast<ServerBase *>(endPoint->mAppState);\n    if (!srv->mDelegate)\n    {\n        return;\n    }\n\n    mdns::Minimal::BytesRange data(buffer->Start(), buffer->Start() + buffer->DataLength());\n    if (data.Size() < HeaderRef::kSizeBytes)\n    {\n        ChipLogError(Discovery, \"Packet to small for mDNS data: %d bytes\", static_cast<int>(data.Size()));\n        return;\n    }\n\n    if (HeaderRef(const_cast<uint8_t *>(data.Start())).GetFlags().IsQuery())\n    {\n        srv->mDelegate->OnQuery(data, info);\n    }\n    else\n    {\n        srv->mDelegate->OnResponse(data, info);\n    }\n}\n\n} \/\/ namespace Minimal\n} \/\/ namespace mdns\n<commit_msg>Report success and fail rate if minmdns has any broadcast failures (#17329)<commit_after>\/*\n *\n *    Copyright (c) 2020 Project CHIP 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 \"Server.h\"\n\n#include <errno.h>\n#include <utility>\n\n#include <lib\/dnssd\/minimal_mdns\/core\/DnsHeader.h>\n\nnamespace mdns {\nnamespace Minimal {\nnamespace {\n\nclass ShutdownOnError\n{\npublic:\n    ShutdownOnError(ServerBase * s) : mServer(s) {}\n    ~ShutdownOnError()\n    {\n        if (mServer != nullptr)\n        {\n            mServer->Shutdown();\n        }\n    }\n\n    CHIP_ERROR ReturnSuccess()\n    {\n        mServer = nullptr;\n        return CHIP_NO_ERROR;\n    }\n\nprivate:\n    ServerBase * mServer;\n};\n\n\/**\n * Extracts the Listening UDP Endpoint from an underlying ServerBase::EndpointInfo\n *\/\nclass ListenSocketPickerDelegate : public ServerBase::BroadcastSendDelegate\n{\npublic:\n    chip::Inet::UDPEndPoint * Accept(ServerBase::EndpointInfo * info) override { return info->mListenUdp; }\n};\n\n#if CHIP_MINMDNS_USE_EPHEMERAL_UNICAST_PORT\n\n\/**\n * Extracts the Querying UDP Endpoint from an underlying ServerBase::EndpointInfo\n *\/\nclass QuerySocketPickerDelegate : public ServerBase::BroadcastSendDelegate\n{\npublic:\n    chip::Inet::UDPEndPoint * Accept(ServerBase::EndpointInfo * info) override { return info->mUnicastQueryUdp; }\n};\n\n#else\n\nusing QuerySocketPickerDelegate = ListenSocketPickerDelegate;\n\n#endif\n\n\/**\n * Validates that an endpoint belongs to a specific interface\/ip address type before forwarding the\n * endpoint accept logic to another BroadcastSendDelegate.\n *\n * Usage like:\n *\n * SomeDelegate *child = ....;\n * InterfaceTypeFilterDelegate filter(interfaceId, IPAddressType::IPv6, child);\n *\n * UDPEndPoint *udp = filter.Accept(endpointInfo);\n *\/\nclass InterfaceTypeFilterDelegate : public ServerBase::BroadcastSendDelegate\n{\npublic:\n    InterfaceTypeFilterDelegate(chip::Inet::InterfaceId interface, chip::Inet::IPAddressType type,\n                                ServerBase::BroadcastSendDelegate * child) :\n        mInterface(interface),\n        mAddressType(type), mChild(child)\n    {}\n\n    chip::Inet::UDPEndPoint * Accept(ServerBase::EndpointInfo * info) override\n    {\n        if ((info->mInterfaceId != mInterface) && (info->mInterfaceId != chip::Inet::InterfaceId::Null()))\n        {\n            return nullptr;\n        }\n\n        if ((mAddressType != chip::Inet::IPAddressType::kAny) && (info->mAddressType != mAddressType))\n        {\n            return nullptr;\n        }\n\n        return mChild->Accept(info);\n    }\n\nprivate:\n    chip::Inet::InterfaceId mInterface;\n    chip::Inet::IPAddressType mAddressType;\n    ServerBase::BroadcastSendDelegate * mChild = nullptr;\n};\n\n} \/\/ namespace\n\nnamespace BroadcastIpAddresses {\n\n\/\/ Get standard mDNS Broadcast addresses\n\nvoid GetIpv6Into(chip::Inet::IPAddress & dest)\n{\n    if (!chip::Inet::IPAddress::FromString(\"FF02::FB\", dest))\n    {\n        ChipLogError(Discovery, \"Failed to parse standard IPv6 broadcast address\");\n    }\n}\n\nvoid GetIpv4Into(chip::Inet::IPAddress & dest)\n{\n    if (!chip::Inet::IPAddress::FromString(\"224.0.0.251\", dest))\n    {\n        ChipLogError(Discovery, \"Failed to parse standard IPv4 broadcast address\");\n    }\n}\n\n} \/\/ namespace BroadcastIpAddresses\n\nnamespace {\n\nCHIP_ERROR JoinMulticastGroup(chip::Inet::InterfaceId interfaceId, chip::Inet::UDPEndPoint * endpoint,\n                              chip::Inet::IPAddressType addressType)\n{\n\n    chip::Inet::IPAddress address;\n\n    if (addressType == chip::Inet::IPAddressType::kIPv6)\n    {\n        BroadcastIpAddresses::GetIpv6Into(address);\n#if INET_CONFIG_ENABLE_IPV4\n    }\n    else if (addressType == chip::Inet::IPAddressType::kIPv4)\n    {\n        BroadcastIpAddresses::GetIpv4Into(address);\n#endif \/\/ INET_CONFIG_ENABLE_IPV4\n    }\n    else\n    {\n        return CHIP_ERROR_INVALID_ARGUMENT;\n    }\n\n    return endpoint->JoinMulticastGroup(interfaceId, address);\n}\n\n#if CHIP_ERROR_LOGGING\nconst char * AddressTypeStr(chip::Inet::IPAddressType addressType)\n{\n    switch (addressType)\n    {\n    case chip::Inet::IPAddressType::kIPv6:\n        return \"IPv6\";\n#if INET_CONFIG_ENABLE_IPV4\n    case chip::Inet::IPAddressType::kIPv4:\n        return \"IPv4\";\n#endif \/\/ INET_CONFIG_ENABLE_IPV4\n    default:\n        return \"UNKNOWN\";\n    }\n}\n#endif\n\n} \/\/ namespace\n\nServerBase::~ServerBase()\n{\n    Shutdown();\n}\n\nvoid ServerBase::Shutdown()\n{\n    mEndpoints.ReleaseAll();\n}\n\nvoid ServerBase::ShutdownEndpoint(EndpointInfo & aEndpoint)\n{\n    mEndpoints.ReleaseObject(&aEndpoint);\n}\n\nbool ServerBase::IsListening() const\n{\n    bool listening = false;\n    mEndpoints.ForEachActiveObject([&](auto * endpoint) {\n        if (endpoint->mListenUdp != nullptr)\n        {\n            listening = true;\n            return chip::Loop::Break;\n        }\n        return chip::Loop::Continue;\n    });\n    return listening;\n}\n\nCHIP_ERROR ServerBase::Listen(chip::Inet::EndPointManager<chip::Inet::UDPEndPoint> * udpEndPointManager, ListenIterator * it,\n                              uint16_t port)\n{\n    Shutdown(); \/\/ ensure everything starts fresh\n\n    chip::Inet::InterfaceId interfaceId = chip::Inet::InterfaceId::Null();\n    chip::Inet::IPAddressType addressType;\n\n    ShutdownOnError autoShutdown(this);\n\n    while (it->Next(&interfaceId, &addressType))\n    {\n        chip::Inet::UDPEndPoint * listenUdp;\n        ReturnErrorOnFailure(udpEndPointManager->NewEndPoint(&listenUdp));\n        std::unique_ptr<chip::Inet::UDPEndPoint, EndpointInfo::EndPointDeletor> endPointHolder(listenUdp, {});\n\n        ReturnErrorOnFailure(listenUdp->Bind(addressType, chip::Inet::IPAddress::Any, port, interfaceId));\n\n        ReturnErrorOnFailure(listenUdp->Listen(OnUdpPacketReceived, nullptr \/*OnReceiveError*\/, this));\n\n        CHIP_ERROR err = JoinMulticastGroup(interfaceId, listenUdp, addressType);\n        if (err != CHIP_NO_ERROR)\n        {\n            char interfaceName[chip::Inet::InterfaceId::kMaxIfNameLength];\n            interfaceId.GetInterfaceName(interfaceName, sizeof(interfaceName));\n\n            \/\/ Log only as non-fatal error. Failure to join will mean we reply to unicast queries only.\n            ChipLogError(DeviceLayer, \"MDNS failed to join multicast group on %s for address type %s: %s\", interfaceName,\n                         AddressTypeStr(addressType), chip::ErrorStr(err));\n\n            endPointHolder.reset();\n        }\n\n#if CHIP_MINMDNS_USE_EPHEMERAL_UNICAST_PORT\n        \/\/ Separate UDP endpoint for unicast queries, bound to 0 (i.e. pick random ephemeral port)\n        \/\/   - helps in not having conflicts on port 5353, will receive unicast replies directly\n        \/\/   - has a *DRAWBACK* of unicast queries being considered LEGACY by mdns since they do\n        \/\/     not originate from 5353 and the answers will include a query section.\n        chip::Inet::UDPEndPoint * unicastQueryUdp;\n        ReturnErrorOnFailure(udpEndPointManager->NewEndPoint(&unicastQueryUdp));\n        std::unique_ptr<chip::Inet::UDPEndPoint, EndpointInfo::EndPointDeletor> endPointHolderUnicast(unicastQueryUdp, {});\n        ReturnErrorOnFailure(unicastQueryUdp->Bind(addressType, chip::Inet::IPAddress::Any, 0, interfaceId));\n        ReturnErrorOnFailure(unicastQueryUdp->Listen(OnUdpPacketReceived, nullptr \/*OnReceiveError*\/, this));\n#endif\n\n#if CHIP_MINMDNS_USE_EPHEMERAL_UNICAST_PORT\n        if (endPointHolder || endPointHolderUnicast)\n        {\n            \/\/ If allocation fails, the rref will not be consumed, so that the endpoint will also be freed correctly\n            mEndpoints.CreateObject(interfaceId, addressType, std::move(endPointHolder), std::move(endPointHolderUnicast));\n        }\n#else\n        if (endPointHolder)\n        {\n            \/\/ If allocation fails, the rref will not be consumed, so that the endpoint will also be freed correctly\n            mEndpoints.CreateObject(interfaceId, addressType, std::move(endPointHolder));\n        }\n#endif\n    }\n\n    return autoShutdown.ReturnSuccess();\n}\n\nCHIP_ERROR ServerBase::DirectSend(chip::System::PacketBufferHandle && data, const chip::Inet::IPAddress & addr, uint16_t port,\n                                  chip::Inet::InterfaceId interface)\n{\n    CHIP_ERROR err = CHIP_ERROR_NOT_CONNECTED;\n    mEndpoints.ForEachActiveObject([&](auto * info) {\n        if (info->mListenUdp == nullptr)\n        {\n            return chip::Loop::Continue;\n        }\n\n        if (info->mAddressType != addr.Type())\n        {\n            return chip::Loop::Continue;\n        }\n\n        chip::Inet::InterfaceId boundIf = info->mListenUdp->GetBoundInterface();\n\n        if ((boundIf.IsPresent()) && (boundIf != interface))\n        {\n            return chip::Loop::Continue;\n        }\n\n        err = info->mListenUdp->SendTo(addr, port, std::move(data));\n        return chip::Loop::Break;\n    });\n\n    return err;\n}\n\nCHIP_ERROR ServerBase::BroadcastUnicastQuery(chip::System::PacketBufferHandle && data, uint16_t port)\n{\n    QuerySocketPickerDelegate socketPicker;\n    return BroadcastImpl(std::move(data), port, &socketPicker);\n}\n\nCHIP_ERROR ServerBase::BroadcastUnicastQuery(chip::System::PacketBufferHandle && data, uint16_t port,\n                                             chip::Inet::InterfaceId interface, chip::Inet::IPAddressType addressType)\n{\n    QuerySocketPickerDelegate socketPicker;\n    InterfaceTypeFilterDelegate filter(interface, addressType, &socketPicker);\n\n    return BroadcastImpl(std::move(data), port, &filter);\n}\n\nCHIP_ERROR ServerBase::BroadcastSend(chip::System::PacketBufferHandle && data, uint16_t port, chip::Inet::InterfaceId interface,\n                                     chip::Inet::IPAddressType addressType)\n{\n    ListenSocketPickerDelegate socketPicker;\n    InterfaceTypeFilterDelegate filter(interface, addressType, &socketPicker);\n\n    return BroadcastImpl(std::move(data), port, &filter);\n}\n\nCHIP_ERROR ServerBase::BroadcastSend(chip::System::PacketBufferHandle && data, uint16_t port)\n{\n    ListenSocketPickerDelegate socketPicker;\n    return BroadcastImpl(std::move(data), port, &socketPicker);\n}\n\nCHIP_ERROR ServerBase::BroadcastImpl(chip::System::PacketBufferHandle && data, uint16_t port, BroadcastSendDelegate * delegate)\n{\n    \/\/ Broadcast requires sending data multiple times, each of which may error\n    \/\/ out, yet broadcast only has a single error code.\n    \/\/\n    \/\/ The general logic of error handling is:\n    \/\/   - if no send done at all, return error\n    \/\/   - if at least one broadcast succeeds, assume success overall\n    \/\/   + some internal consistency validations for state error.\n\n    unsigned successes   = 0;\n    unsigned failures    = 0;\n    CHIP_ERROR lastError = CHIP_ERROR_NO_ENDPOINT;\n\n    if (chip::Loop::Break == mEndpoints.ForEachActiveObject([&](auto * info) {\n            chip::Inet::UDPEndPoint * udp = delegate->Accept(info);\n\n            if (udp == nullptr)\n            {\n                return chip::Loop::Continue;\n            }\n\n            CHIP_ERROR err = CHIP_NO_ERROR;\n\n            \/\/\/ The same packet needs to be sent over potentially multiple interfaces.\n            \/\/\/ LWIP does not like having a pbuf sent over serparate interfaces, hence we create a copy\n            \/\/\/ for sending via `CloneData`\n            \/\/\/\n            \/\/\/ TODO: this wastes one copy of the data and that could be optimized away\n            if (info->mAddressType == chip::Inet::IPAddressType::kIPv6)\n            {\n                err = udp->SendTo(mIpv6BroadcastAddress, port, data.CloneData(), udp->GetBoundInterface());\n            }\n#if INET_CONFIG_ENABLE_IPV4\n            else if (info->mAddressType == chip::Inet::IPAddressType::kIPv4)\n            {\n                err = udp->SendTo(mIpv4BroadcastAddress, port, data.CloneData(), udp->GetBoundInterface());\n            }\n#endif\n            else\n            {\n                \/\/ This is a general error of internal consistency: every address has a known type. Fail completely otherwise.\n                lastError = CHIP_ERROR_INCORRECT_STATE;\n                return chip::Loop::Break;\n            }\n\n            if (err == CHIP_NO_ERROR)\n            {\n                successes++;\n            }\n            else\n            {\n                failures++;\n                lastError = err;\n#if CHIP_DETAIL_LOGGING\n                char ifaceName[chip::Inet::InterfaceId::kMaxIfNameLength];\n                err = info->mInterfaceId.GetInterfaceName(ifaceName, sizeof(ifaceName));\n                if (err != CHIP_NO_ERROR)\n                    strcpy(ifaceName, \"???\");\n                ChipLogDetail(Discovery, \"Warning: Attempt to mDNS broadcast failed on %s:  %s\", ifaceName, lastError.AsString());\n#endif\n            }\n            return chip::Loop::Continue;\n        }))\n    {\n        return lastError;\n    }\n\n    if (failures != 0)\n    {\n        \/\/ if we had failures, log if the final status was success or failure, to make log reading\n        \/\/ easier. Some mDNS failures may be expected (e.g. for interfaces unavailable)\n        if (successes != 0)\n        {\n            ChipLogDetail(Discovery, \"mDNS broadcast had only partial success: %u successes and %u failures.\", successes, failures);\n        }\n        else\n        {\n            ChipLogProgress(Discovery, \"mDNS broadcast full failed in %u separate send attempts.\", failures);\n        }\n    }\n\n    if (!successes)\n    {\n        return lastError;\n    }\n\n    return CHIP_NO_ERROR;\n}\n\nvoid ServerBase::OnUdpPacketReceived(chip::Inet::UDPEndPoint * endPoint, chip::System::PacketBufferHandle && buffer,\n                                     const chip::Inet::IPPacketInfo * info)\n{\n    ServerBase * srv = static_cast<ServerBase *>(endPoint->mAppState);\n    if (!srv->mDelegate)\n    {\n        return;\n    }\n\n    mdns::Minimal::BytesRange data(buffer->Start(), buffer->Start() + buffer->DataLength());\n    if (data.Size() < HeaderRef::kSizeBytes)\n    {\n        ChipLogError(Discovery, \"Packet to small for mDNS data: %d bytes\", static_cast<int>(data.Size()));\n        return;\n    }\n\n    if (HeaderRef(const_cast<uint8_t *>(data.Start())).GetFlags().IsQuery())\n    {\n        srv->mDelegate->OnQuery(data, info);\n    }\n    else\n    {\n        srv->mDelegate->OnResponse(data, info);\n    }\n}\n\n} \/\/ namespace Minimal\n} \/\/ namespace mdns\n<|endoftext|>"}
{"text":"<commit_before>\/* \n * Copyright 2009 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 <vector>\n#include <boost\/lexical_cast.hpp>\n#include \"lammpsreader.h\"\n\nnamespace votca { namespace csg {\n    using namespace boost;\nusing namespace std;\n\nbool LAMMPSReader::ReadTopology(string file,  Topology &top)\n{\n   _topology = true;\n   top.Cleanup();\n\n   _fl.open(file.c_str());\n    if(!_fl.is_open())\n        throw std::ios_base::failure(\"Error on open topologyl file: \" + file);\n\n   NextFrame(top);\n\n    _fl.close();\n\n}\n\nbool LAMMPSReader::Open(const string &file)\n{\n    _fl.open(file.c_str());\n    if(!_fl.is_open())\n        throw std::ios_base::failure(\"Error on open topologyl file: \" + file);\n}\n\nvoid LAMMPSReader::Close()\n{\n    _fl.close();\n}\n\nbool LAMMPSReader::FirstFrame(Topology &top)\n{\n    _topology = false;\n    NextFrame(top);\n    return true;\n}\n\nbool LAMMPSReader::NextFrame(Topology &top)\n{\n    string line;\n    getline(_fl, line);\n    while(!_fl.eof()) {\n        if(line.substr(0, 5) != \"ITEM:\")\n            throw std::ios_base::failure(\"unexpected line in lammps file:\\n\"+line);\n        if(line.substr(6) == \"TIMESTEP\") {\n                ReadTimestep(top, line);\n        }\n        else if(line.substr(6) == \"NUMBER OF ATOMS\") {\n                ReadNumAtoms(top, line);\n        }\n        else if(line.substr(6) == \"BOX BOUNDS\") {\n                ReadBox(top, line);\n        }\n        else if(line.substr(6, 5) == \"ATOMS\") {\n                ReadAtoms(top, line);\n                break;\n        }\n\n        else {\n            throw std::ios_base::failure(\"unknown item lammps file : \" + line.substr(6));\n        }\n        getline(_fl, line);\n    }\n    return !_fl.eof();;\n}\n\nvoid LAMMPSReader::ReadTimestep(Topology &top, string itemline)\n{\n    string s;\n    getline(_fl, s);\n    top.setStep(boost::lexical_cast<int>(s));\n    cout << \"Reading frame, timestep \" << top.getStep() << endl;\n}\n\nvoid LAMMPSReader::ReadBox(Topology &top, string itemline)\n{\n    string s;\n\n    matrix m;\n    m.ZeroMatrix();\n        \n    for(int i=0; i<3; ++i) {\n        getline(_fl, s);\n        Tokenizer tok(s, \" \");\n        vector<double> v;\n        tok.ConvertToVector(v);\n        if(v.size()!=2)\n            throw std::ios_base::failure(\"invalid box format\");\n        m[i][i] = v[1] - v[0];\n    }\n    top.setBox(m );\n}\n\nvoid LAMMPSReader::ReadNumAtoms(Topology &top, string itemline)\n{\n    string s;\n    getline(_fl, s);\n    _natoms = boost::lexical_cast<int>(s);\n    if(!_topology && _natoms !=top.BeadCount())\n        std::runtime_error(\"number of beads in topology and trajectory difffer\");\n}\n\nvoid LAMMPSReader::ReadAtoms(Topology &top, string itemline) {\n    top.CreateResidue(\"dum\");\n    bool pos=false;\n    bool force=false;\n\n    vector<string> fields;\n\n    {\n        Tokenizer tok(itemline.substr(12), \" \");\n        tok.ToVector(fields);\n        for(Tokenizer::iterator i=tok.begin(); i!=tok.end(); ++i) {\n            if(*i == \"x\" || *i == \"y\" || *i == \"z\")\n                pos =true;\n            else if(*i == \"fx\" || *i == \"fy\" || *i == \"fz\")\n                force=true;\n        }\n    }\n    for(int i=0; i<_natoms; ++i) {\n        string s;\n        getline(_fl, s);\n        Bead *b;\n        if(_topology)\n            b = top.CreateBead(1, \"\", top.GetOrCreateBeadType(\"no\"), 0, 0, 0);\n        else\n            b = top.getBead(i);\n\n        b->HasPos(pos);\n        b->HasF(force);\n\n        Tokenizer tok(s, \" \");\n        Tokenizer::iterator itok= tok.begin();\n        for(int j=0; itok!=tok.end(); ++itok, ++j) {\n            if(j == fields.size())\n                throw std::runtime_error(\"error, wrong number of columns in atoms section\");\n            else if(fields[j] == \"x\")\n                b->Pos().x() = lexical_cast<double>(*itok);\n            else if(fields[j] == \"y\")\n                b->Pos().y() = lexical_cast<double>(*itok);\n            else if(fields[j] == \"z\")\n                b->Pos().z() = lexical_cast<double>(*itok);\n            \n        }\n    }\n}\n\n}}\n\n<commit_msg>forces in lammps reader, csg_fmatch seems to work with lammps now<commit_after>\/* \n * Copyright 2009 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 <vector>\n#include <boost\/lexical_cast.hpp>\n#include \"lammpsreader.h\"\n\nnamespace votca { namespace csg {\n    using namespace boost;\nusing namespace std;\n\nbool LAMMPSReader::ReadTopology(string file,  Topology &top)\n{\n   _topology = true;\n   top.Cleanup();\n\n   _fl.open(file.c_str());\n    if(!_fl.is_open())\n        throw std::ios_base::failure(\"Error on open topologyl file: \" + file);\n\n   NextFrame(top);\n\n    _fl.close();\n\n}\n\nbool LAMMPSReader::Open(const string &file)\n{\n    _fl.open(file.c_str());\n    if(!_fl.is_open())\n        throw std::ios_base::failure(\"Error on open topologyl file: \" + file);\n}\n\nvoid LAMMPSReader::Close()\n{\n    _fl.close();\n}\n\nbool LAMMPSReader::FirstFrame(Topology &top)\n{\n    _topology = false;\n    NextFrame(top);\n    return true;\n}\n\nbool LAMMPSReader::NextFrame(Topology &top)\n{\n    string line;\n    getline(_fl, line);\n    while(!_fl.eof()) {\n        if(line.substr(0, 5) != \"ITEM:\")\n            throw std::ios_base::failure(\"unexpected line in lammps file:\\n\"+line);\n        if(line.substr(6) == \"TIMESTEP\") {\n                ReadTimestep(top, line);\n        }\n        else if(line.substr(6) == \"NUMBER OF ATOMS\") {\n                ReadNumAtoms(top, line);\n        }\n        else if(line.substr(6) == \"BOX BOUNDS\") {\n                ReadBox(top, line);\n        }\n        else if(line.substr(6, 5) == \"ATOMS\") {\n                ReadAtoms(top, line);\n                break;\n        }\n\n        else {\n            throw std::ios_base::failure(\"unknown item lammps file : \" + line.substr(6));\n        }\n        getline(_fl, line);\n    }\n    return !_fl.eof();;\n}\n\nvoid LAMMPSReader::ReadTimestep(Topology &top, string itemline)\n{\n    string s;\n    getline(_fl, s);\n    top.setStep(boost::lexical_cast<int>(s));\n    cout << \"Reading frame, timestep \" << top.getStep() << endl;\n}\n\nvoid LAMMPSReader::ReadBox(Topology &top, string itemline)\n{\n    string s;\n\n    matrix m;\n    m.ZeroMatrix();\n        \n    for(int i=0; i<3; ++i) {\n        getline(_fl, s);\n        Tokenizer tok(s, \" \");\n        vector<double> v;\n        tok.ConvertToVector(v);\n        if(v.size()!=2)\n            throw std::ios_base::failure(\"invalid box format\");\n        m[i][i] = v[1] - v[0];\n    }\n    top.setBox(m );\n}\n\nvoid LAMMPSReader::ReadNumAtoms(Topology &top, string itemline)\n{\n    string s;\n    getline(_fl, s);\n    _natoms = boost::lexical_cast<int>(s);\n    if(!_topology && _natoms !=top.BeadCount())\n        std::runtime_error(\"number of beads in topology and trajectory difffer\");\n}\n\nvoid LAMMPSReader::ReadAtoms(Topology &top, string itemline) {\n    top.CreateResidue(\"dum\");\n    bool pos=false;\n    bool force=false;\n\n    vector<string> fields;\n\n    {\n        Tokenizer tok(itemline.substr(12), \" \");\n        tok.ToVector(fields);\n        for(Tokenizer::iterator i=tok.begin(); i!=tok.end(); ++i) {\n            if(*i == \"x\" || *i == \"y\" || *i == \"z\")\n                pos =true;\n            else if(*i == \"fx\" || *i == \"fy\" || *i == \"fz\")\n                force=true;\n        }\n    }\n    for(int i=0; i<_natoms; ++i) {\n        string s;\n        getline(_fl, s);\n        Bead *b;\n        if(_topology)\n            b = top.CreateBead(1, \"\", top.GetOrCreateBeadType(\"no\"), 0, 0, 0);\n        else\n            b = top.getBead(i);\n\n        b->HasPos(pos);\n        b->HasF(force);\n\n        Tokenizer tok(s, \" \");\n        Tokenizer::iterator itok= tok.begin();\n        for(int j=0; itok!=tok.end(); ++itok, ++j) {\n            if(j == fields.size())\n                throw std::runtime_error(\"error, wrong number of columns in atoms section\");\n            else if(fields[j] == \"x\")\n                b->Pos().x() = lexical_cast<double>(*itok);\n            else if(fields[j] == \"y\")\n                b->Pos().y() = lexical_cast<double>(*itok);\n            else if(fields[j] == \"z\")\n                b->Pos().z() = lexical_cast<double>(*itok);\n            else if(fields[j] == \"fx\")\n                b->F().x() = lexical_cast<double>(*itok);\n            else if(fields[j] == \"fy\")\n                b->F().y() = lexical_cast<double>(*itok);\n            else if(fields[j] == \"fz\")\n                b->F().z() = lexical_cast<double>(*itok);\n            \n        }\n    }\n}\n\n}}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n** File Name:\tstr_const.hpp\n** Author:\tAditya Ramesh\n** Date:\t07\/03\/2013\n** Contact:\t_@adityaramesh.com\n**\n** # Introduction\n**\n** The `str_const` class provides a representation of a character array that can\n** be queried and manipulated during compile time. It is based on Scott Schur's\n** implementation of `str_const` given [here][new_tools].\n**\n** [new_tools]:\n** https:\/\/github.com\/boostcon\/cppnow_presentations_2012\/blob\/master\/wed\/schurr_cpp11_tools_for_class_authors.pdf?raw=true\n** \"New Tools for Class and Library Authors\"\n*\/\n\n#ifndef Z6DB5E6FF_6826_4328_96A2_4798F500077A\n#define Z6DB5E6FF_6826_4328_96A2_4798F500077A\n\n#include <stdexcept>\n\nclass str_const\n{\nprivate:\n\tconst char* const p_;\n\tconst std::size_t s_;\npublic:\n\ttemplate <std::size_t N>\n\tconstexpr str_const(const char(&a)[N]) :\n\tp_{a}, s_{N - 1} {}\n\n\tconstexpr char operator[](std::size_t n)\n\t{\n\t\treturn n < s_ ? p_[n] : throw std::out_of_range{\"\"};\n\t}\n\n\tconstexpr std::size_t length()\n\t{\n\t\treturn s_;\n\t}\n\n\tconstexpr std::size_t size()\n\t{\n\t\treturn s_;\n\t}\n\n\tconstexpr operator const char*()\n\t{\n\t\treturn p_;\n\t}\n};\n\n#endif\n<commit_msg>Added str_const to namespace cc.<commit_after>\/*\n** File Name:\tstr_const.hpp\n** Author:\tAditya Ramesh\n** Date:\t07\/03\/2013\n** Contact:\t_@adityaramesh.com\n**\n** # Introduction\n**\n** The `str_const` class provides a representation of a character array that can\n** be queried and manipulated during compile time. It is based on Scott Schur's\n** implementation of `str_const` given [here][new_tools].\n**\n** [new_tools]:\n** https:\/\/github.com\/boostcon\/cppnow_presentations_2012\/blob\/master\/wed\/schurr_cpp11_tools_for_class_authors.pdf?raw=true\n** \"New Tools for Class and Library Authors\"\n*\/\n\n#ifndef Z6DB5E6FF_6826_4328_96A2_4798F500077A\n#define Z6DB5E6FF_6826_4328_96A2_4798F500077A\n\n#include <stdexcept>\n\nnamespace cc\n{\n\nclass str_const\n{\nprivate:\n\tconst char* const p_;\n\tconst std::size_t s_;\npublic:\n\ttemplate <std::size_t N>\n\tconstexpr str_const(const char(&a)[N]) :\n\tp_{a}, s_{N - 1} {}\n\n\tconstexpr char operator[](std::size_t n)\n\t{\n\t\treturn n < s_ ? p_[n] : throw std::out_of_range{\"\"};\n\t}\n\n\tconstexpr std::size_t length()\n\t{\n\t\treturn s_;\n\t}\n\n\tconstexpr std::size_t size()\n\t{\n\t\treturn s_;\n\t}\n\n\tconstexpr operator const char*()\n\t{\n\t\treturn p_;\n\t}\n};\n\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/ cedar_persistence.cc\n\n\/\/ 2004 Copyright University Corporation for Atmospheric Research\n\n#include <iostream>\n\nusing std::endl ;\n\n#include \"DODSInitList.h\"\n#include \"DODSInitOrder.h\"\n#include \"DODSContainerPersistenceCedar.h\"\n#include \"ThePersistenceList.h\"\n#include \"TheDODSLog.h\"\n\nstatic bool\nCedarPersistenceInit(int, char**) {\n    if( TheDODSLog->is_verbose() )\n\t(*TheDODSLog) << \"Adding Cedar Persistence\" << endl;\n    DODSContainerPersistenceCedar *cpf =\n\t    new DODSContainerPersistenceCedar( \"Cedar\" ) ;\n    ThePersistenceList->add_persistence( cpf ) ;\n    return true;\n}\n\nstatic bool\nCedarPersistenceTerm(void) {\n    if( TheDODSLog->is_verbose() )\n\t(*TheDODSLog) << \"Removing Cedar Persistence\" << endl;\n    ThePersistenceList->rem_persistence( \"Cedar\" ) ;\n    return true ;\n}\n\nFUNINITQUIT( CedarPersistenceInit, CedarPersistenceTerm, FILEPERSISTENCE_INIT ) ;\n\n\/\/ $Log: cedar_persistence.cc,v $\n\/\/ Revision 1.2  2004\/12\/15 17:44:12  pwest\n\/\/ added copyright, updated container persistence method look_for\n\/\/\n\/\/ Revision 1.1  2004\/06\/30 21:04:03  pwest\n\/\/ cedar_handler uses the new dispatch code and can also be built for normal\n\/\/ cgi scripting (except the cgi needs to be updated to not check for\n\/\/ extensions but allow the handler to do that) The cgi handler also needs the\n\/\/ dispatch code.\n\/\/\n<commit_msg>macro changed to just one PERSISTENCE_INIT macro<commit_after>\/\/ cedar_persistence.cc\n\n\/\/ 2004 Copyright University Corporation for Atmospheric Research\n\n#include <iostream>\n\nusing std::endl ;\n\n#include \"DODSInitList.h\"\n#include \"DODSInitOrder.h\"\n#include \"DODSContainerPersistenceCedar.h\"\n#include \"ThePersistenceList.h\"\n#include \"TheDODSLog.h\"\n\nstatic bool\nCedarPersistenceInit(int, char**) {\n    if( TheDODSLog->is_verbose() )\n\t(*TheDODSLog) << \"Adding Cedar Persistence\" << endl;\n    DODSContainerPersistenceCedar *cpf =\n\t    new DODSContainerPersistenceCedar( \"Cedar\" ) ;\n    ThePersistenceList->add_persistence( cpf ) ;\n    return true;\n}\n\nstatic bool\nCedarPersistenceTerm(void) {\n    if( TheDODSLog->is_verbose() )\n\t(*TheDODSLog) << \"Removing Cedar Persistence\" << endl;\n    ThePersistenceList->rem_persistence( \"Cedar\" ) ;\n    return true ;\n}\n\nFUNINITQUIT( CedarPersistenceInit, CedarPersistenceTerm, PERSISTENCE_INIT ) ;\n\n\/\/ $Log: cedar_persistence.cc,v $\n\/\/ Revision 1.2  2004\/12\/15 17:44:12  pwest\n\/\/ added copyright, updated container persistence method look_for\n\/\/\n\/\/ Revision 1.1  2004\/06\/30 21:04:03  pwest\n\/\/ cedar_handler uses the new dispatch code and can also be built for normal\n\/\/ cgi scripting (except the cgi needs to be updated to not check for\n\/\/ extensions but allow the handler to do that) The cgi handler also needs the\n\/\/ dispatch code.\n\/\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"WardMaterial.h\"\n#include \"ray\/Ray.h\"\n#include \"geometry\/FacePoint.h\"\n\n#include \"math\/Projection.h\"\n#include \"math\/Reflection.h\"\n#include \"math\/Fresnel.h\"\n\nnamespace PR\n{\n\tWardMaterial::WardMaterial() :\n\t\tMaterial(), mAlbedo(nullptr), mSpecularity(nullptr), mRoughnessX(nullptr), mRoughnessY(nullptr)\n\t{\n\t}\n\n\tTexture2D* WardMaterial::albedo() const\n\t{\n\t\treturn mAlbedo;\n\t}\n\n\tvoid WardMaterial::setAlbedo(Texture2D* diffSpec)\n\t{\n\t\tmAlbedo = diffSpec;\n\t}\n\n\tTexture2D* WardMaterial::specularity() const\n\t{\n\t\treturn mSpecularity;\n\t}\n\n\tvoid WardMaterial::setSpecularity(Texture2D* spec)\n\t{\n\t\tmSpecularity = spec;\n\t}\n\n\tData2D* WardMaterial::roughnessX() const\n\t{\n\t\treturn mRoughnessX;\n\t}\n\n\tvoid WardMaterial::setRoughnessX(Data2D* d)\n\t{\n\t\tmRoughnessX = d;\n\t}\n\n\tData2D* WardMaterial::roughnessY() const\n\t{\n\t\treturn mRoughnessY;\n\t}\n\n\tvoid WardMaterial::setRoughnessY(Data2D* d)\n\t{\n\t\tmRoughnessY = d;\n\t}\n\n\tconstexpr float MinRoughness = 0.001f;\n\tSpectrum WardMaterial::apply(const FacePoint& point, const PM::vec3& V, const PM::vec3& L)\n\t{\n\t\tconst float NdotV = std::abs(PM::pm_Dot3D(point.normal(), V));\n\t\tconst float NdotL = std::abs(PM::pm_Dot3D(point.normal(), L));\n\n\t\tSpectrum albedo;\n\t\tif (mAlbedo)\n\t\t{\n\t\t\talbedo = mAlbedo->eval(point.uv()) * PM_INV_PI_F;\n\t\t}\n\n\t\tSpectrum spec;\n\t\tif (mSpecularity && mRoughnessX && mRoughnessY &&\n\t\t\tNdotV >= PM_EPSILON && NdotL >= PM_EPSILON)\n\t\t{\n\t\t\tconst float m1 = PM::pm_MaxT(MinRoughness, mRoughnessX ? mRoughnessX->eval(point.uv()) : 0);\n\t\t\tconst float m2 = PM::pm_MaxT(MinRoughness, mRoughnessY ? mRoughnessY->eval(point.uv()) : 0);\n\n\t\t\t\/\/ Since H appears to equal powers in both the numerator and denominator of the exponent, no normalization is needed.\n\t\t\tconst PM::vec3 H = PM::pm_Normalize3D(PM::pm_Subtract(L, V));\n\t\t\tconst float NdotH = std::abs(PM::pm_Dot3D(point.normal(), H));\n\n\t\t\tconst float HdotX = PM::pm_Dot3D(H, point.tangent());\n\t\t\tconst float HdotY = PM::pm_Dot3D(H, point.binormal());\n\t\t\t\n\t\t\tconst float NdotH2 = NdotH * NdotH;\n\t\t\tconst float fx = HdotX \/ m1;\n\t\t\tconst float fy = HdotY \/ m2;\n\t\t\tconst float r = std::exp(-(fx*fx + fy*fy) \/ NdotH2) * PM_INV_PI_F \/ (4 * m1 * m2 * NdotH2 * NdotH2);\n\n\t\t\tPR_ASSERT(!std::isnan(r) && !std::isinf(r)\/* && r >= 0 && r <= 1*\/);\n\n\t\t\tspec = mSpecularity->eval(point.uv()) * r;\n\t\t}\n\n\t\treturn albedo + spec;\n\t}\n\n\tfloat WardMaterial::pdf(const FacePoint& point, const PM::vec3& V, const PM::vec3& L)\n\t{\n\t\tconst float NdotV = std::abs(PM::pm_Dot3D(point.normal(), V));\n\t\tconst float NdotL = std::abs(PM::pm_Dot3D(point.normal(), L));\n\n\t\tif (NdotL <= PM_EPSILON || NdotV <= PM_EPSILON)\n\t\t{\n\t\t\treturn 0;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tconst float m1 = PM::pm_MaxT(MinRoughness, mRoughnessX ? mRoughnessX->eval(point.uv()) : 0);\n\t\t\tconst float m2 = PM::pm_MaxT(MinRoughness, mRoughnessY ? mRoughnessY->eval(point.uv()) : 0);\n\n\t\t\tconst PM::vec3 H = PM::pm_Normalize3D(PM::pm_Subtract(L, V));\n\n\t\t\tconst float NdotH = PM::pm_Dot3D(point.normal(), H);\n\n\t\t\tconst float HdotX = PM::pm_Dot3D(H, point.tangent());\n\t\t\tconst float HdotY = PM::pm_Dot3D(H, point.binormal());\n\n\t\t\tconst float NdotH2 = NdotH * NdotH;\n\t\t\tconst float fx = HdotX \/ m1;\n\t\t\tconst float fy = HdotY \/ m2;\n\n\t\t\tconst float r = std::exp(-(fx*fx + fy*fy) \/ NdotH2) * PM_INV_PI_F \/ (4 * m1 * m2 * NdotH2 * NdotH2);\n\t\t\tPR_ASSERT(!std::isnan(r) && !std::isinf(r));\n\t\t\treturn r;\n\t\t}\n\t}\n\n\tPM::vec3 WardMaterial::sample(const FacePoint& point, const PM::vec3& rnd, const PM::vec3& V, float& pdf)\n\t{\n\t\tconst float m1 = PM::pm_MaxT(MinRoughness, mRoughnessX ? mRoughnessX->eval(point.uv()) : 0);\n\t\tconst float m2 = PM::pm_MaxT(MinRoughness, mRoughnessY ? mRoughnessY->eval(point.uv()) : 0);\n\n\t\tfloat px, py;\n\t\tif (m1 == m2)\/\/ Isotropic\n\t\t{\n\t\t\tpx = std::atan(m1 * std::sqrt(-std::log(1 - PM::pm_GetX(rnd))));\n\t\t\tpy = PM_2_PI_F * PM::pm_GetY(rnd);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfloat s, c;\n\t\t\tPM::pm_SinCosT(PM_2_PI_F * PM::pm_GetY(rnd), s, c);\n\t\t\tconst float s2 = s*s;\n\n\t\t\tpx = std::atan(std::sqrt(-std::log(1 - PM::pm_GetX(rnd)) * (m2*m2*s2 - m1*m1*s2 + m1*m1)));\n\t\t\tpy = std::atan2(m2*s, m1*c);\n\t\t}\n\n\t\tauto H = Projection::tangent_align(point.normal(), point.tangent(), point.binormal(),\n\t\t\tProjection::sphereRAD(px, py));\n\t\tauto dir = Reflection::reflect(PM::pm_Dot3D(H, V), H, V);\n\t\tpdf = WardMaterial::pdf(point, V, dir);\n\t\treturn dir;\n\t}\n}<commit_msg>Improved ward material, still somewhat incomplete in specific scenes.<commit_after>#include \"WardMaterial.h\"\n#include \"ray\/Ray.h\"\n#include \"geometry\/FacePoint.h\"\n\n#include \"math\/Projection.h\"\n#include \"math\/Reflection.h\"\n#include \"math\/Fresnel.h\"\n\nnamespace PR\n{\n\tWardMaterial::WardMaterial() :\n\t\tMaterial(), mAlbedo(nullptr), mSpecularity(nullptr), mRoughnessX(nullptr), mRoughnessY(nullptr)\n\t{\n\t}\n\n\tTexture2D* WardMaterial::albedo() const\n\t{\n\t\treturn mAlbedo;\n\t}\n\n\tvoid WardMaterial::setAlbedo(Texture2D* diffSpec)\n\t{\n\t\tmAlbedo = diffSpec;\n\t}\n\n\tTexture2D* WardMaterial::specularity() const\n\t{\n\t\treturn mSpecularity;\n\t}\n\n\tvoid WardMaterial::setSpecularity(Texture2D* spec)\n\t{\n\t\tmSpecularity = spec;\n\t}\n\n\tData2D* WardMaterial::roughnessX() const\n\t{\n\t\treturn mRoughnessX;\n\t}\n\n\tvoid WardMaterial::setRoughnessX(Data2D* d)\n\t{\n\t\tmRoughnessX = d;\n\t}\n\n\tData2D* WardMaterial::roughnessY() const\n\t{\n\t\treturn mRoughnessY;\n\t}\n\n\tvoid WardMaterial::setRoughnessY(Data2D* d)\n\t{\n\t\tmRoughnessY = d;\n\t}\n\n\tconstexpr float MinRoughness = 0.001f;\n\tSpectrum WardMaterial::apply(const FacePoint& point, const PM::vec3& V, const PM::vec3& L)\n\t{\n\t\tSpectrum albedo;\n\t\tif (mAlbedo)\n\t\t{\n\t\t\talbedo = mAlbedo->eval(point.uv()) * PM_INV_PI_F;\n\t\t}\n\n\t\tSpectrum spec;\n\t\tif (mSpecularity && mRoughnessX && mRoughnessY)\n\t\t{\n\t\t\tconst float m1 = PM::pm_MaxT(MinRoughness, mRoughnessX ? mRoughnessX->eval(point.uv()) : 0);\n\t\t\tconst float m2 = PM::pm_MaxT(MinRoughness, mRoughnessY ? mRoughnessY->eval(point.uv()) : 0);\n\n\t\t\tconst float NdotV = std::abs(PM::pm_Dot3D(point.normal(), V));\n\t\t\tconst float NdotL = std::abs(PM::pm_Dot3D(point.normal(), L));\n\n\t\t\t\/\/ Since H appears to equal powers in both the numerator and denominator of the exponent, no normalization is needed.\n\t\t\tconst PM::vec3 H = PM::pm_Subtract(L, V);\n\t\t\tconst float NdotH = PM::pm_Dot3D(point.normal(), H);\n\n\t\t\tif (NdotV > PM_EPSILON && NdotL > PM_EPSILON && NdotH > PM_EPSILON)\n\t\t\t{\n\t\t\t\tconst float HdotX = PM::pm_Dot3D(H, point.tangent());\n\t\t\t\tconst float HdotY = PM::pm_Dot3D(H, point.binormal());\n\n\t\t\t\tconst float NdotH2 = 0.5f + 0.5f * NdotH;\n\t\t\t\tconst float fx = HdotX \/ m1;\n\t\t\t\tconst float fy = HdotY \/ m2;\n\t\t\t\tfloat r = PM::pm_MagnitudeSqr3D(H) * std::exp(-(fx*fx + fy*fy) \/ NdotH2) * PM_INV_PI_F \/ (m1 * m2 * std::sqrt(NdotL*NdotV));\n\n\t\t\t\tPR_ASSERT(!std::isnan(r)\/* && r >= 0 && r <= 1*\/);\n\n\t\t\t\tif (std::isinf(r))\n\t\t\t\t\tr = 1;\n\n\t\t\t\tspec = mSpecularity->eval(point.uv()) * r;\n\t\t\t}\n\t\t}\n\n\t\treturn albedo + spec;\n\t}\n\n\tfloat WardMaterial::pdf(const FacePoint& point, const PM::vec3& V, const PM::vec3& L)\n\t{\n\t\tconst float m1 = PM::pm_MaxT(MinRoughness, mRoughnessX ? mRoughnessX->eval(point.uv()) : 0);\n\t\tconst float m2 = PM::pm_MaxT(MinRoughness, mRoughnessY ? mRoughnessY->eval(point.uv()) : 0);\n\n\t\tconst float NdotV = std::abs(PM::pm_Dot3D(point.normal(), V));\n\t\tconst float NdotL = std::abs(PM::pm_Dot3D(point.normal(), L));\n\n\t\tif (NdotV <= PM_EPSILON || NdotL <= PM_EPSILON)\n\t\t\treturn PM_INV_PI_F;\n\n\t\tconst PM::vec3 H = PM::pm_Subtract(L, V);\n\n\t\tconst float NdotH = std::abs(PM::pm_Dot3D(point.normal(), H));\n\n\t\tif (NdotH <= PM_EPSILON)\n\t\t\treturn PM_INV_PI_F;\n\n\t\tconst float HdotX = PM::pm_Dot3D(H, point.tangent());\n\t\tconst float HdotY = PM::pm_Dot3D(H, point.binormal());\n\n\t\tconst float NdotH2 = 0.5f + 0.5f * NdotH;\n\t\tconst float fx = HdotX \/ m1;\n\t\tconst float fy = HdotY \/ m2;\n\n\t\tconst float r = PM::pm_MagnitudeSqr3D(H) * std::exp(-(fx*fx + fy*fy) \/ NdotH2) * PM_INV_PI_F \/ (m1 * m2 * std::sqrt(NdotL*NdotV));\n\n\t\tPR_ASSERT(!std::isnan(r));\n\t\tif (std::isinf(r))\n\t\t\treturn PM_INV_PI_F;\n\t\telse\n\t\t\treturn PM::pm_MaxT(PM_INV_PI_F, r);\n\t}\n\n\tPM::vec3 WardMaterial::sample(const FacePoint& point, const PM::vec3& rnd, const PM::vec3& V, float& pdf)\n\t{\n\t\tconst float m1 = PM::pm_MaxT(MinRoughness, mRoughnessX ? mRoughnessX->eval(point.uv()) : 0);\n\t\tconst float m2 = PM::pm_MaxT(MinRoughness, mRoughnessY ? mRoughnessY->eval(point.uv()) : 0);\n\n\t\tfloat px, py;\n\t\tif (m1 == m2)\/\/ Isotropic\n\t\t{\n\t\t\tpx = std::atan(m1 * std::sqrt(-std::log(1 - PM::pm_GetX(rnd))));\n\t\t\tpy = PM_2_PI_F * PM::pm_GetY(rnd);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfloat s, c;\n\t\t\tPM::pm_SinCosT(PM_2_PI_F * PM::pm_GetY(rnd), s, c);\n\t\t\tconst float s2 = s*s;\n\n\t\t\tpx = std::atan(std::sqrt(-std::log(1 - PM::pm_GetX(rnd)) * (m2*m2*s2 - m1*m1*s2 + m1*m1)));\n\t\t\tpy = std::atan2(m2*s, m1*c);\n\t\t}\n\n\t\tauto H = Projection::tangent_align(point.normal(), point.tangent(), point.binormal(),\n\t\t\tProjection::sphereRAD(px, py));\n\t\tauto dir = Reflection::reflect(PM::pm_Dot3D(H, V), H, V);\n\t\tpdf = WardMaterial::pdf(point, V, dir);\n\t\treturn dir;\n\t}\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n    RawSpeed - RAW file decoder.\n\n    Copyright (C) 2009-2014 Klaus Post\n    Copyright (C) 2017 Axel Waggershauser\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 \"common\/DngOpcodes.h\"\n#include \"common\/Common.h\"                \/\/ for uint32, ushort16, clampBits\n#include \"common\/Mutex.h\"                 \/\/ for MutexLocker\n#include \"common\/Point.h\"                 \/\/ for iPoint2D, iRectangle2D\n#include \"common\/RawImage.h\"              \/\/ for RawImage, RawImageData\n#include \"decoders\/RawDecoderException.h\" \/\/ for RawDecoderException (ptr o...\n#include \"io\/ByteStream.h\"                \/\/ for ByteStream\n#include \"io\/Endianness.h\"                \/\/ for getHostEndianness, Endiann...\n#include \"tiff\/TiffEntry.h\"               \/\/ for TiffEntry\n#include <algorithm>                      \/\/ for fill_n\n#include <cassert>                        \/\/ for assert\n#include <cmath>                          \/\/ for pow\n#include <stdexcept>                      \/\/ for out_of_range\n#include <tuple>                          \/\/ for tie, tuple\n\nusing std::vector;\nusing std::fill_n;\nusing std::make_pair;\n\nnamespace rawspeed {\n\nclass DngOpcodes::DngOpcode {\npublic:\n  virtual ~DngOpcode() = default;\n\n  \/\/ Will be called once before processing.\n  \/\/ Can be used for preparing pre-calculated values, etc.\n  virtual void setup(const RawImage& ri) {\n    \/\/ NOP by default. child class shall override this if needed.\n  }\n\n  \/\/ Will be called for actual processing.\n  virtual void apply(const RawImage& ri) = 0;\n};\n\n\/\/ ****************************************************************************\n\nclass DngOpcodes::FixBadPixelsConstant final : public DngOpcodes::DngOpcode {\n  uint32 value;\n\npublic:\n  explicit FixBadPixelsConstant(ByteStream* bs) {\n    value = bs->getU32();\n    bs->getU32(); \/\/ Bayer Phase not used\n  }\n\n  void setup(const RawImage& ri) override {\n    \/\/ These limitations are present within the DNG SDK as well.\n    if (ri->getDataType() != TYPE_USHORT16)\n      ThrowRDE(\"Only 16 bit images supported\");\n\n    if (ri->getCpp() > 1)\n      ThrowRDE(\"Only 1 component images supported\");\n  }\n\n  void apply(const RawImage& ri) override {\n    MutexLocker guard(&ri->mBadPixelMutex);\n    iPoint2D crop = ri->getCropOffset();\n    uint32 offset = crop.x | (crop.y << 16);\n    for (auto y = 0; y < ri->dim.y; ++y) {\n      auto* src = reinterpret_cast<ushort16*>(ri->getData(0, y));\n      for (auto x = 0; x < ri->dim.x; ++x) {\n        if (src[x] == value)\n          ri->mBadPixelPositions.push_back(offset + (y << 16 | x));\n      }\n    }\n  }\n};\n\n\/\/ ****************************************************************************\n\nclass DngOpcodes::FixBadPixelsList final : public DngOpcodes::DngOpcode {\n  std::vector<uint32> badPixels;\n\npublic:\n  explicit FixBadPixelsList(ByteStream* bs) {\n    bs->getU32(); \/\/ Skip phase - we don't care\n    auto badPointCount = bs->getU32();\n    auto badRectCount = bs->getU32();\n\n    \/\/ Read points\n    for (auto i = 0U; i < badPointCount; ++i) {\n      auto y = bs->getU32();\n      auto x = bs->getU32();\n      badPixels.push_back(y << 16 | x);\n    }\n\n    \/\/ Read rects\n    for (auto i = 0U; i < badRectCount; ++i) {\n      auto top = bs->getU32();\n      auto left = bs->getU32();\n      auto bottom = bs->getU32();\n      auto right = bs->getU32();\n      for (auto y = top; y <= bottom; ++y) {\n        for (auto x = left; x <= right; ++x) {\n          badPixels.push_back(y << 16 | x);\n        }\n      }\n    }\n  }\n\n  void apply(const RawImage& ri) override {\n    MutexLocker guard(&ri->mBadPixelMutex);\n    ri->mBadPixelPositions.insert(ri->mBadPixelPositions.begin(),\n                                  badPixels.begin(), badPixels.end());\n  }\n};\n\n\/\/ ****************************************************************************\n\nclass DngOpcodes::ROIOpcode : public DngOpcodes::DngOpcode {\n  iRectangle2D roi;\n\nprotected:\n  explicit ROIOpcode(ByteStream* bs) {\n    uint32 top = bs->getU32();\n    uint32 left = bs->getU32();\n    uint32 bottom = bs->getU32();\n    uint32 right = bs->getU32();\n\n    roi = iRectangle2D(left, top, right - left, bottom - top);\n  }\n\n  const iRectangle2D& __attribute__((pure)) getRoi() const { return roi; }\n\n  void setup(const RawImage& ri) override {\n    iRectangle2D fullImage(0, 0, ri->dim.x, ri->dim.y);\n\n    if (!roi.isThisInside(fullImage))\n      ThrowRDE(\"Area of interest not inside image.\");\n  }\n};\n\n\/\/ ****************************************************************************\n\nclass DngOpcodes::TrimBounds final : public ROIOpcode {\npublic:\n  explicit TrimBounds(ByteStream* bs) : ROIOpcode(bs) {}\n\n  void apply(const RawImage& ri) override { ri->subFrame(getRoi()); }\n};\n\n\/\/ ****************************************************************************\n\nclass DngOpcodes::PixelOpcode : public ROIOpcode {\n  uint32 firstPlane;\n  uint32 planes;\n  uint32 rowPitch;\n  uint32 colPitch;\n\nprotected:\n  explicit PixelOpcode(ByteStream* bs) : ROIOpcode(bs) {\n    firstPlane = bs->getU32();\n    planes = bs->getU32();\n    rowPitch = bs->getU32();\n    colPitch = bs->getU32();\n\n    if (planes == 0)\n      ThrowRDE(\"Zero planes\");\n    if (rowPitch == 0 || colPitch == 0)\n      ThrowRDE(\"Invalid pitch\");\n  }\n\n  void setup(const RawImage& ri) override {\n    ROIOpcode::setup(ri);\n    if (firstPlane + planes > ri->getCpp())\n      ThrowRDE(\"Not that many planes in actual image\");\n  }\n\n  \/\/ traverses the current ROI and applies the operation OP to each pixel,\n  \/\/ i.e. each pixel value v is replaced by op(x, y, v), where x\/y are the\n  \/\/ coordinates of the pixel value v.\n  template <typename T, typename OP> void applyOP(const RawImage& ri, OP op) {\n    int cpp = ri->getCpp();\n    const iRectangle2D& ROI = getRoi();\n    for (auto y = ROI.getTop(); y < ROI.getBottom(); y += rowPitch) {\n      auto* src = reinterpret_cast<T*>(ri->getData(0, y));\n      \/\/ Add offset, so this is always first plane\n      src += firstPlane;\n      for (auto x = ROI.getLeft(); x < ROI.getRight(); x += colPitch) {\n        for (auto p = 0U; p < planes; ++p)\n          src[x * cpp + p] = op(x, y, src[x * cpp + p]);\n      }\n    }\n  }\n};\n\n\/\/ ****************************************************************************\n\nclass DngOpcodes::LookupOpcode : public PixelOpcode {\nprotected:\n  vector<ushort16> lookup;\n\n  explicit LookupOpcode(ByteStream* bs) : PixelOpcode(bs), lookup(65536) {}\n\n  void setup(const RawImage& ri) override {\n    PixelOpcode::setup(ri);\n    if (ri->getDataType() != TYPE_USHORT16)\n      ThrowRDE(\"Only 16 bit images supported\");\n  }\n\n  void apply(const RawImage& ri) override {\n    applyOP<ushort16>(\n        ri, [this](uint32 x, uint32 y, ushort16 v) { return lookup[v]; });\n  }\n};\n\n\/\/ ****************************************************************************\n\nclass DngOpcodes::TableMap final : public LookupOpcode {\npublic:\n  explicit TableMap(ByteStream* bs) : LookupOpcode(bs) {\n    auto count = bs->getU32();\n\n    if (count == 0 || count > 65536)\n      ThrowRDE(\"Invalid size of lookup table\");\n\n    for (auto i = 0U; i < count; ++i)\n      lookup[i] = bs->getU16();\n\n    if (count < lookup.size())\n      fill_n(&lookup[count], lookup.size() - count, lookup[count - 1]);\n  }\n};\n\n\/\/ ****************************************************************************\n\nclass DngOpcodes::PolynomialMap final : public LookupOpcode {\npublic:\n  explicit PolynomialMap(ByteStream* bs) : LookupOpcode(bs) {\n    vector<double> polynomial;\n\n    polynomial.resize(bs->getU32() + 1UL);\n\n    if (polynomial.size() > 9)\n      ThrowRDE(\"A polynomial with more than 8 degrees not allowed\");\n\n    for (auto& coeff : polynomial)\n      coeff = bs->get<double>();\n\n    \/\/ Create lookup\n    lookup.resize(65536);\n    for (auto i = 0U; i < lookup.size(); ++i) {\n      double val = polynomial[0];\n      for (auto j = 1U; j < polynomial.size(); ++j)\n        val += polynomial[j] * pow(i \/ 65536.0, j);\n      lookup[i] = (clampBits(static_cast<int>(val * 65535.5), 16));\n    }\n  }\n};\n\n\/\/ ****************************************************************************\n\nclass DngOpcodes::DeltaRowOrColBase : public PixelOpcode {\npublic:\n  struct SelectX {\n    static inline uint32 select(uint32 x, uint32 \/*y*\/) { return x; }\n  };\n\n  struct SelectY {\n    static inline uint32 select(uint32 \/*x*\/, uint32 y) { return y; }\n  };\n\nprotected:\n  vector<float> deltaF;\n  vector<int> deltaI;\n\n  DeltaRowOrColBase(ByteStream* bs, float f2iScale) : PixelOpcode(bs) {\n    deltaF.resize(bs->getU32());\n\n    for (auto& f : deltaF)\n      f = bs->get<float>();\n\n    deltaI.reserve(deltaF.size());\n    for (auto f : deltaF)\n      deltaI.emplace_back(static_cast<int>(f2iScale * f));\n  }\n};\n\n\/\/ ****************************************************************************\n\ntemplate <typename S>\nclass DngOpcodes::OffsetPerRowOrCol final : public DeltaRowOrColBase {\npublic:\n  explicit OffsetPerRowOrCol(ByteStream* bs)\n      : DeltaRowOrColBase(bs, 65535.0F) {}\n\n  void apply(const RawImage& ri) override {\n    if (ri->getDataType() == TYPE_USHORT16) {\n      applyOP<ushort16>(ri, [this](uint32 x, uint32 y, ushort16 v) {\n        return clampBits(deltaI[S::select(x, y)] + v, 16);\n      });\n    } else {\n      applyOP<float>(ri, [this](uint32 x, uint32 y, float v) {\n        return deltaF[S::select(x, y)] + v;\n      });\n    }\n  }\n};\n\ntemplate <typename S>\nclass DngOpcodes::ScalePerRowOrCol final : public DeltaRowOrColBase {\npublic:\n  explicit ScalePerRowOrCol(ByteStream* bs) : DeltaRowOrColBase(bs, 1024.0F) {}\n\n  void apply(const RawImage& ri) override {\n    if (ri->getDataType() == TYPE_USHORT16) {\n      applyOP<ushort16>(ri, [this](uint32 x, uint32 y, ushort16 v) {\n        return clampBits((deltaI[S::select(x, y)] * v + 512) >> 10, 16);\n      });\n    } else {\n      applyOP<float>(ri, [this](uint32 x, uint32 y, float v) {\n        return deltaF[S::select(x, y)] * v;\n      });\n    }\n  }\n};\n\n\/\/ ****************************************************************************\n\nDngOpcodes::DngOpcodes(TiffEntry* entry) {\n  ByteStream bs = entry->getData();\n  \/\/ DNG opcodes are always stored in big-endian byte order.\n  bs.setByteOrder(Endianness::big);\n\n  const auto opcode_count = bs.getU32();\n  opcodes.reserve(opcode_count);\n\n  for (auto i = 0U; i < opcode_count; i++) {\n    auto code = bs.getU32();\n    bs.getU32(); \/\/ ignore version\n#ifdef DEBUG\n    bs.getU32(); \/\/ ignore flags\n#else\n    auto flags = bs.getU32();\n#endif\n    auto expected_pos = bs.getU32() + bs.getPosition();\n\n    const char* opName = nullptr;\n    constructor_t opConstructor = nullptr;\n    try {\n      std::tie(opName, opConstructor) = Map.at(code);\n    } catch (std::out_of_range&) {\n      ThrowRDE(\"Unknown unhandled Opcode: %d\", code);\n    }\n\n    if (opConstructor != nullptr)\n      opcodes.emplace_back(opConstructor(&bs));\n    else {\n#ifndef DEBUG\n      \/\/ Throw Error if not marked as optional\n      if (!(flags & 1))\n#endif\n        ThrowRDE(\"Unsupported Opcode: %d (%s)\", code, opName);\n    }\n\n    if (bs.getPosition() != expected_pos)\n      ThrowRDE(\"Inconsistent length of opcode\");\n  }\n\n  assert(opcodes.size() == opcode_count);\n}\n\n\/\/ defined here as empty destrutor, otherwise we'd need a complete definition\n\/\/ of the the DngOpcode type in DngOpcodes.h\nDngOpcodes::~DngOpcodes() = default;\n\nvoid DngOpcodes::applyOpCodes(const RawImage& ri) {\n  for (const auto& code : opcodes) {\n    code->setup(ri);\n    code->apply(ri);\n  }\n}\n\ntemplate <class Opcode>\nstd::unique_ptr<DngOpcodes::DngOpcode> DngOpcodes::constructor(ByteStream* bs) {\n  return std::make_unique<Opcode>(bs);\n}\n\n\/\/ ALL opcodes specified in DNG Specification MUST be listed here.\n\/\/ however, some of them might not be implemented.\nconst std::map<uint32, std::pair<const char*, DngOpcodes::constructor_t>>\n    DngOpcodes::Map = {\n        {1U, make_pair(\"WarpRectilinear\", nullptr)},\n        {2U, make_pair(\"WarpFisheye\", nullptr)},\n        {3U, make_pair(\"FixVignetteRadial\", nullptr)},\n        {4U,\n         make_pair(\"FixBadPixelsConstant\",\n                   &DngOpcodes::constructor<DngOpcodes::FixBadPixelsConstant>)},\n        {5U, make_pair(\"FixBadPixelsList\",\n                       &DngOpcodes::constructor<DngOpcodes::FixBadPixelsList>)},\n        {6U, make_pair(\"TrimBounds\",\n                       &DngOpcodes::constructor<DngOpcodes::TrimBounds>)},\n        {7U,\n         make_pair(\"MapTable\", &DngOpcodes::constructor<DngOpcodes::TableMap>)},\n        {8U, make_pair(\"MapPolynomial\",\n                       &DngOpcodes::constructor<DngOpcodes::PolynomialMap>)},\n        {9U, make_pair(\"GainMap\", nullptr)},\n        {10U,\n         make_pair(\n             \"DeltaPerRow\",\n             &DngOpcodes::constructor<\n                 DngOpcodes::OffsetPerRowOrCol<DeltaRowOrColBase::SelectY>>)},\n        {11U,\n         make_pair(\n             \"DeltaPerColumn\",\n             &DngOpcodes::constructor<\n                 DngOpcodes::OffsetPerRowOrCol<DeltaRowOrColBase::SelectX>>)},\n        {12U,\n         make_pair(\n             \"ScalePerRow\",\n             &DngOpcodes::constructor<\n                 DngOpcodes::ScalePerRowOrCol<DeltaRowOrColBase::SelectY>>)},\n        {13U,\n         make_pair(\n             \"ScalePerColumn\",\n             &DngOpcodes::constructor<\n                 DngOpcodes::ScalePerRowOrCol<DeltaRowOrColBase::SelectX>>)},\n\n};\n\n} \/\/ namespace rawspeed\n<commit_msg>DngOpcodes::DngOpcodes(): fixup assert: only vaid in DEBUG<commit_after>\/*\n    RawSpeed - RAW file decoder.\n\n    Copyright (C) 2009-2014 Klaus Post\n    Copyright (C) 2017 Axel Waggershauser\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 \"common\/DngOpcodes.h\"\n#include \"common\/Common.h\"                \/\/ for uint32, ushort16, clampBits\n#include \"common\/Mutex.h\"                 \/\/ for MutexLocker\n#include \"common\/Point.h\"                 \/\/ for iPoint2D, iRectangle2D\n#include \"common\/RawImage.h\"              \/\/ for RawImage, RawImageData\n#include \"decoders\/RawDecoderException.h\" \/\/ for RawDecoderException (ptr o...\n#include \"io\/ByteStream.h\"                \/\/ for ByteStream\n#include \"io\/Endianness.h\"                \/\/ for getHostEndianness, Endiann...\n#include \"tiff\/TiffEntry.h\"               \/\/ for TiffEntry\n#include <algorithm>                      \/\/ for fill_n\n#include <cassert>                        \/\/ for assert\n#include <cmath>                          \/\/ for pow\n#include <stdexcept>                      \/\/ for out_of_range\n#include <tuple>                          \/\/ for tie, tuple\n\nusing std::vector;\nusing std::fill_n;\nusing std::make_pair;\n\nnamespace rawspeed {\n\nclass DngOpcodes::DngOpcode {\npublic:\n  virtual ~DngOpcode() = default;\n\n  \/\/ Will be called once before processing.\n  \/\/ Can be used for preparing pre-calculated values, etc.\n  virtual void setup(const RawImage& ri) {\n    \/\/ NOP by default. child class shall override this if needed.\n  }\n\n  \/\/ Will be called for actual processing.\n  virtual void apply(const RawImage& ri) = 0;\n};\n\n\/\/ ****************************************************************************\n\nclass DngOpcodes::FixBadPixelsConstant final : public DngOpcodes::DngOpcode {\n  uint32 value;\n\npublic:\n  explicit FixBadPixelsConstant(ByteStream* bs) {\n    value = bs->getU32();\n    bs->getU32(); \/\/ Bayer Phase not used\n  }\n\n  void setup(const RawImage& ri) override {\n    \/\/ These limitations are present within the DNG SDK as well.\n    if (ri->getDataType() != TYPE_USHORT16)\n      ThrowRDE(\"Only 16 bit images supported\");\n\n    if (ri->getCpp() > 1)\n      ThrowRDE(\"Only 1 component images supported\");\n  }\n\n  void apply(const RawImage& ri) override {\n    MutexLocker guard(&ri->mBadPixelMutex);\n    iPoint2D crop = ri->getCropOffset();\n    uint32 offset = crop.x | (crop.y << 16);\n    for (auto y = 0; y < ri->dim.y; ++y) {\n      auto* src = reinterpret_cast<ushort16*>(ri->getData(0, y));\n      for (auto x = 0; x < ri->dim.x; ++x) {\n        if (src[x] == value)\n          ri->mBadPixelPositions.push_back(offset + (y << 16 | x));\n      }\n    }\n  }\n};\n\n\/\/ ****************************************************************************\n\nclass DngOpcodes::FixBadPixelsList final : public DngOpcodes::DngOpcode {\n  std::vector<uint32> badPixels;\n\npublic:\n  explicit FixBadPixelsList(ByteStream* bs) {\n    bs->getU32(); \/\/ Skip phase - we don't care\n    auto badPointCount = bs->getU32();\n    auto badRectCount = bs->getU32();\n\n    \/\/ Read points\n    for (auto i = 0U; i < badPointCount; ++i) {\n      auto y = bs->getU32();\n      auto x = bs->getU32();\n      badPixels.push_back(y << 16 | x);\n    }\n\n    \/\/ Read rects\n    for (auto i = 0U; i < badRectCount; ++i) {\n      auto top = bs->getU32();\n      auto left = bs->getU32();\n      auto bottom = bs->getU32();\n      auto right = bs->getU32();\n      for (auto y = top; y <= bottom; ++y) {\n        for (auto x = left; x <= right; ++x) {\n          badPixels.push_back(y << 16 | x);\n        }\n      }\n    }\n  }\n\n  void apply(const RawImage& ri) override {\n    MutexLocker guard(&ri->mBadPixelMutex);\n    ri->mBadPixelPositions.insert(ri->mBadPixelPositions.begin(),\n                                  badPixels.begin(), badPixels.end());\n  }\n};\n\n\/\/ ****************************************************************************\n\nclass DngOpcodes::ROIOpcode : public DngOpcodes::DngOpcode {\n  iRectangle2D roi;\n\nprotected:\n  explicit ROIOpcode(ByteStream* bs) {\n    uint32 top = bs->getU32();\n    uint32 left = bs->getU32();\n    uint32 bottom = bs->getU32();\n    uint32 right = bs->getU32();\n\n    roi = iRectangle2D(left, top, right - left, bottom - top);\n  }\n\n  const iRectangle2D& __attribute__((pure)) getRoi() const { return roi; }\n\n  void setup(const RawImage& ri) override {\n    iRectangle2D fullImage(0, 0, ri->dim.x, ri->dim.y);\n\n    if (!roi.isThisInside(fullImage))\n      ThrowRDE(\"Area of interest not inside image.\");\n  }\n};\n\n\/\/ ****************************************************************************\n\nclass DngOpcodes::TrimBounds final : public ROIOpcode {\npublic:\n  explicit TrimBounds(ByteStream* bs) : ROIOpcode(bs) {}\n\n  void apply(const RawImage& ri) override { ri->subFrame(getRoi()); }\n};\n\n\/\/ ****************************************************************************\n\nclass DngOpcodes::PixelOpcode : public ROIOpcode {\n  uint32 firstPlane;\n  uint32 planes;\n  uint32 rowPitch;\n  uint32 colPitch;\n\nprotected:\n  explicit PixelOpcode(ByteStream* bs) : ROIOpcode(bs) {\n    firstPlane = bs->getU32();\n    planes = bs->getU32();\n    rowPitch = bs->getU32();\n    colPitch = bs->getU32();\n\n    if (planes == 0)\n      ThrowRDE(\"Zero planes\");\n    if (rowPitch == 0 || colPitch == 0)\n      ThrowRDE(\"Invalid pitch\");\n  }\n\n  void setup(const RawImage& ri) override {\n    ROIOpcode::setup(ri);\n    if (firstPlane + planes > ri->getCpp())\n      ThrowRDE(\"Not that many planes in actual image\");\n  }\n\n  \/\/ traverses the current ROI and applies the operation OP to each pixel,\n  \/\/ i.e. each pixel value v is replaced by op(x, y, v), where x\/y are the\n  \/\/ coordinates of the pixel value v.\n  template <typename T, typename OP> void applyOP(const RawImage& ri, OP op) {\n    int cpp = ri->getCpp();\n    const iRectangle2D& ROI = getRoi();\n    for (auto y = ROI.getTop(); y < ROI.getBottom(); y += rowPitch) {\n      auto* src = reinterpret_cast<T*>(ri->getData(0, y));\n      \/\/ Add offset, so this is always first plane\n      src += firstPlane;\n      for (auto x = ROI.getLeft(); x < ROI.getRight(); x += colPitch) {\n        for (auto p = 0U; p < planes; ++p)\n          src[x * cpp + p] = op(x, y, src[x * cpp + p]);\n      }\n    }\n  }\n};\n\n\/\/ ****************************************************************************\n\nclass DngOpcodes::LookupOpcode : public PixelOpcode {\nprotected:\n  vector<ushort16> lookup;\n\n  explicit LookupOpcode(ByteStream* bs) : PixelOpcode(bs), lookup(65536) {}\n\n  void setup(const RawImage& ri) override {\n    PixelOpcode::setup(ri);\n    if (ri->getDataType() != TYPE_USHORT16)\n      ThrowRDE(\"Only 16 bit images supported\");\n  }\n\n  void apply(const RawImage& ri) override {\n    applyOP<ushort16>(\n        ri, [this](uint32 x, uint32 y, ushort16 v) { return lookup[v]; });\n  }\n};\n\n\/\/ ****************************************************************************\n\nclass DngOpcodes::TableMap final : public LookupOpcode {\npublic:\n  explicit TableMap(ByteStream* bs) : LookupOpcode(bs) {\n    auto count = bs->getU32();\n\n    if (count == 0 || count > 65536)\n      ThrowRDE(\"Invalid size of lookup table\");\n\n    for (auto i = 0U; i < count; ++i)\n      lookup[i] = bs->getU16();\n\n    if (count < lookup.size())\n      fill_n(&lookup[count], lookup.size() - count, lookup[count - 1]);\n  }\n};\n\n\/\/ ****************************************************************************\n\nclass DngOpcodes::PolynomialMap final : public LookupOpcode {\npublic:\n  explicit PolynomialMap(ByteStream* bs) : LookupOpcode(bs) {\n    vector<double> polynomial;\n\n    polynomial.resize(bs->getU32() + 1UL);\n\n    if (polynomial.size() > 9)\n      ThrowRDE(\"A polynomial with more than 8 degrees not allowed\");\n\n    for (auto& coeff : polynomial)\n      coeff = bs->get<double>();\n\n    \/\/ Create lookup\n    lookup.resize(65536);\n    for (auto i = 0U; i < lookup.size(); ++i) {\n      double val = polynomial[0];\n      for (auto j = 1U; j < polynomial.size(); ++j)\n        val += polynomial[j] * pow(i \/ 65536.0, j);\n      lookup[i] = (clampBits(static_cast<int>(val * 65535.5), 16));\n    }\n  }\n};\n\n\/\/ ****************************************************************************\n\nclass DngOpcodes::DeltaRowOrColBase : public PixelOpcode {\npublic:\n  struct SelectX {\n    static inline uint32 select(uint32 x, uint32 \/*y*\/) { return x; }\n  };\n\n  struct SelectY {\n    static inline uint32 select(uint32 \/*x*\/, uint32 y) { return y; }\n  };\n\nprotected:\n  vector<float> deltaF;\n  vector<int> deltaI;\n\n  DeltaRowOrColBase(ByteStream* bs, float f2iScale) : PixelOpcode(bs) {\n    deltaF.resize(bs->getU32());\n\n    for (auto& f : deltaF)\n      f = bs->get<float>();\n\n    deltaI.reserve(deltaF.size());\n    for (auto f : deltaF)\n      deltaI.emplace_back(static_cast<int>(f2iScale * f));\n  }\n};\n\n\/\/ ****************************************************************************\n\ntemplate <typename S>\nclass DngOpcodes::OffsetPerRowOrCol final : public DeltaRowOrColBase {\npublic:\n  explicit OffsetPerRowOrCol(ByteStream* bs)\n      : DeltaRowOrColBase(bs, 65535.0F) {}\n\n  void apply(const RawImage& ri) override {\n    if (ri->getDataType() == TYPE_USHORT16) {\n      applyOP<ushort16>(ri, [this](uint32 x, uint32 y, ushort16 v) {\n        return clampBits(deltaI[S::select(x, y)] + v, 16);\n      });\n    } else {\n      applyOP<float>(ri, [this](uint32 x, uint32 y, float v) {\n        return deltaF[S::select(x, y)] + v;\n      });\n    }\n  }\n};\n\ntemplate <typename S>\nclass DngOpcodes::ScalePerRowOrCol final : public DeltaRowOrColBase {\npublic:\n  explicit ScalePerRowOrCol(ByteStream* bs) : DeltaRowOrColBase(bs, 1024.0F) {}\n\n  void apply(const RawImage& ri) override {\n    if (ri->getDataType() == TYPE_USHORT16) {\n      applyOP<ushort16>(ri, [this](uint32 x, uint32 y, ushort16 v) {\n        return clampBits((deltaI[S::select(x, y)] * v + 512) >> 10, 16);\n      });\n    } else {\n      applyOP<float>(ri, [this](uint32 x, uint32 y, float v) {\n        return deltaF[S::select(x, y)] * v;\n      });\n    }\n  }\n};\n\n\/\/ ****************************************************************************\n\nDngOpcodes::DngOpcodes(TiffEntry* entry) {\n  ByteStream bs = entry->getData();\n  \/\/ DNG opcodes are always stored in big-endian byte order.\n  bs.setByteOrder(Endianness::big);\n\n  const auto opcode_count = bs.getU32();\n  opcodes.reserve(opcode_count);\n\n  for (auto i = 0U; i < opcode_count; i++) {\n    auto code = bs.getU32();\n    bs.getU32(); \/\/ ignore version\n#ifdef DEBUG\n    bs.getU32(); \/\/ ignore flags\n#else\n    auto flags = bs.getU32();\n#endif\n    auto expected_pos = bs.getU32() + bs.getPosition();\n\n    const char* opName = nullptr;\n    constructor_t opConstructor = nullptr;\n    try {\n      std::tie(opName, opConstructor) = Map.at(code);\n    } catch (std::out_of_range&) {\n      ThrowRDE(\"Unknown unhandled Opcode: %d\", code);\n    }\n\n    if (opConstructor != nullptr)\n      opcodes.emplace_back(opConstructor(&bs));\n    else {\n#ifndef DEBUG\n      \/\/ Throw Error if not marked as optional\n      if (!(flags & 1))\n#endif\n        ThrowRDE(\"Unsupported Opcode: %d (%s)\", code, opName);\n    }\n\n    if (bs.getPosition() != expected_pos)\n      ThrowRDE(\"Inconsistent length of opcode\");\n  }\n\n#ifdef DEBUG\n  assert(opcodes.size() == opcode_count);\n#endif\n}\n\n\/\/ defined here as empty destrutor, otherwise we'd need a complete definition\n\/\/ of the the DngOpcode type in DngOpcodes.h\nDngOpcodes::~DngOpcodes() = default;\n\nvoid DngOpcodes::applyOpCodes(const RawImage& ri) {\n  for (const auto& code : opcodes) {\n    code->setup(ri);\n    code->apply(ri);\n  }\n}\n\ntemplate <class Opcode>\nstd::unique_ptr<DngOpcodes::DngOpcode> DngOpcodes::constructor(ByteStream* bs) {\n  return std::make_unique<Opcode>(bs);\n}\n\n\/\/ ALL opcodes specified in DNG Specification MUST be listed here.\n\/\/ however, some of them might not be implemented.\nconst std::map<uint32, std::pair<const char*, DngOpcodes::constructor_t>>\n    DngOpcodes::Map = {\n        {1U, make_pair(\"WarpRectilinear\", nullptr)},\n        {2U, make_pair(\"WarpFisheye\", nullptr)},\n        {3U, make_pair(\"FixVignetteRadial\", nullptr)},\n        {4U,\n         make_pair(\"FixBadPixelsConstant\",\n                   &DngOpcodes::constructor<DngOpcodes::FixBadPixelsConstant>)},\n        {5U, make_pair(\"FixBadPixelsList\",\n                       &DngOpcodes::constructor<DngOpcodes::FixBadPixelsList>)},\n        {6U, make_pair(\"TrimBounds\",\n                       &DngOpcodes::constructor<DngOpcodes::TrimBounds>)},\n        {7U,\n         make_pair(\"MapTable\", &DngOpcodes::constructor<DngOpcodes::TableMap>)},\n        {8U, make_pair(\"MapPolynomial\",\n                       &DngOpcodes::constructor<DngOpcodes::PolynomialMap>)},\n        {9U, make_pair(\"GainMap\", nullptr)},\n        {10U,\n         make_pair(\n             \"DeltaPerRow\",\n             &DngOpcodes::constructor<\n                 DngOpcodes::OffsetPerRowOrCol<DeltaRowOrColBase::SelectY>>)},\n        {11U,\n         make_pair(\n             \"DeltaPerColumn\",\n             &DngOpcodes::constructor<\n                 DngOpcodes::OffsetPerRowOrCol<DeltaRowOrColBase::SelectX>>)},\n        {12U,\n         make_pair(\n             \"ScalePerRow\",\n             &DngOpcodes::constructor<\n                 DngOpcodes::ScalePerRowOrCol<DeltaRowOrColBase::SelectY>>)},\n        {13U,\n         make_pair(\n             \"ScalePerColumn\",\n             &DngOpcodes::constructor<\n                 DngOpcodes::ScalePerRowOrCol<DeltaRowOrColBase::SelectX>>)},\n\n};\n\n} \/\/ namespace rawspeed\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    This program is free software; you can redistribute it and\/or modify\n    it under the terms of the GNU General Public License as published by\n    the Free Software Foundation; either version 2 of the License, or\n    (at your option) any later version.\n\n    This program is distributed in the hope that it will be useful,\n    but WITHOUT ANY WARRANTY; without even the implied warranty of\n    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n    GNU General Public License for more details.\n\n    You should have received a copy of the GNU General Public License 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 \"World.h\"\n#include \"MetaRoom.h\"\n#include \"openc2eview.h\"\n#include <QtGui>\n#include \"QtBackend.h\"\n\n#ifdef _WIN32\n#include <windows.h>\n#endif\n\n\/*\n * TODO:\n *\n * provide input to the game engine\n * non-X11 support\n * provide a resize event to the engine as needed\n *\n *\/\n\nopenc2eView::openc2eView(QWidget *parent, boost::shared_ptr<QtBackend> b) : QAbstractScrollArea(parent) {\n\tbackend = b;\n\n\tviewport()->setAttribute(Qt::WA_PaintOnScreen); \/\/ disable double-buffering\n\tviewport()->setAttribute(Qt::WA_OpaquePaintEvent); \/\/ no need for Qt to draw a background\n\n\t\/\/ keyboard focus. needed? better way?\n\tsetFocusPolicy(Qt::StrongFocus);\n\n\t\/\/ we need the mouse move events\n\tsetMouseTracking(true);\n\n\t\/\/ TODO: sane? do we really need relx\/rely, anyway?\n\tlastmousex = mapFromGlobal(QCursor::pos()).x();\n\tlastmousey = mapFromGlobal(QCursor::pos()).y();\n\n\tlastMetaroom = NULL;\n}\n\nopenc2eView::~openc2eView() {\n}\n\nboost::shared_ptr<class Backend> openc2eView::getBackend() {\n\treturn boost::dynamic_pointer_cast<class Backend, class QtBackend>(backend);\n}\n\nvoid openc2eView::resizescrollbars() {\n\tif (world.camera.getMetaRoom()) {\n\t\tif (world.camera.getMetaRoom()->wraparound()) {\n\t\t\thorizontalScrollBar()->setRange(0,world.camera.getMetaRoom()->width());\n\t\t} else {\n\t\t\thorizontalScrollBar()->setRange(0,world.camera.getMetaRoom()->width() - viewport()->width());\n\t\t}\n\t\tverticalScrollBar()->setRange(0,world.camera.getMetaRoom()->height() - viewport()->height());\n\t}\n}\n\nbool firsttime = true;\nint currentwidth, currentheight;\n\nvoid openc2eView::resizeEvent(QResizeEvent *) {\n\tif (firsttime) {\n\t\tbackend->setup(viewport());\n\t\tfirsttime = false;\n\t}\n\n\tbackend->resized(viewport()->width(), viewport()->height());\n\tcurrentwidth = viewport()->width();\n\tcurrentheight = viewport()->height();\n\n\tresizescrollbars();\n\n\thorizontalScrollBar()->setPageStep(width());\n\tverticalScrollBar()->setPageStep(height());\n}\n\nvoid openc2eView::paintEvent(QPaintEvent *) {\n\t((QApplication *)QApplication::instance())->syncX();\n\n\tif (!firsttime) {\n\t\t\/\/ TODO: mad hax\n\t\tif (currentwidth == viewport()->width() && currentheight == viewport()->height()) {\n\t\t\tworld.drawWorld();\n\t\t\tbackend->renderDone();\n\t\t}\n\t}\n}\n\nvoid openc2eView::mouseMoveEvent(QMouseEvent *m) {\n\t\/\/ add mouse move event to backend queue\n\tSomeEvent e;\n\te.type = eventmousemove;\n\te.xrel = m->x() - lastmousex;\n\te.yrel = m->y() - lastmousey;\n\tlastmousex = e.x = m->x();\n\tlastmousey = e.y = m->y();\n\te.button = 0;\n\tif (m->buttons() && Qt::LeftButton) e.button |= buttonleft;\n\tif (m->buttons() && Qt::MidButton) e.button |= buttonmiddle;\n\tif (m->buttons() && Qt::RightButton) e.button |= buttonright;\n\tbackend->pushEvent(e);\n}\n\n\/\/ helper function\nvoid openc2eView::mouseEvent(QMouseEvent *m, eventtype t) {\n\tSomeEvent e;\n\te.type = t;\n\te.x = m->x();\n\te.y = m->y();\n\tswitch (m->button()) {\n\t\tcase Qt::LeftButton: e.button = buttonleft; break;\n\t\tcase Qt::MidButton: e.button = buttonmiddle; break;\n\t\tcase Qt::RightButton: e.button = buttonright; break;\n\t\tdefault: return;\n\t}\n\tbackend->pushEvent(e);\n}\n\nvoid openc2eView::mousePressEvent(QMouseEvent *m) {\n\tmouseEvent(m, eventmousebuttondown);\n}\n\nvoid openc2eView::mouseReleaseEvent(QMouseEvent *m) {\n\tmouseEvent(m, eventmousebuttonup);\n}\n\nvoid openc2eView::wheelEvent(QWheelEvent *w) {\n\tSomeEvent e;\n\te.type = eventmousebuttondown;\n\te.x = w->x();\n\te.y = w->y();\t\n\t\/\/ TODO: qt combines events, we should generate one event for every 120 delta, maybe\n\tif (w->delta() < 0)\n\t\te.button = buttonwheelup;\n\telse\n\t\te.button = buttonwheeldown;\n\tbackend->pushEvent(e);\n}\n\nvoid openc2eView::keyPressEvent(QKeyEvent *k) {\n\tbackend->keyEvent(k, true);\n}\n\nvoid openc2eView::keyReleaseEvent(QKeyEvent *k) {\n\tbackend->keyEvent(k, false);\n}\n\nvoid openc2eView::scrollContentsBy(int dx, int dy) {\n\t(void)dx;\n\t(void)dy;\n\tif (lastMetaroom)\n\t\tworld.camera.moveTo(horizontalScrollBar()->value() + lastMetaroom->x(), verticalScrollBar()->value() + lastMetaroom->y());\n}\n\nvoid openc2eView::tick() {\n\tif (lastMetaroom != world.camera.getMetaRoom()) {\n\t\tlastMetaroom = world.camera.getMetaRoom();\n\t\tresizescrollbars();\n\t}\n}\n\nbool openc2eView::needsRender() {\n\treturn backend->needsRender();\n}\n\n<commit_msg>Actually differentiate between the buttons held during mouse movement.<commit_after>\/*\n    This program is free software; you can redistribute it and\/or modify\n    it under the terms of the GNU General Public License as published by\n    the Free Software Foundation; either version 2 of the License, or\n    (at your option) any later version.\n\n    This program is distributed in the hope that it will be useful,\n    but WITHOUT ANY WARRANTY; without even the implied warranty of\n    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n    GNU General Public License for more details.\n\n    You should have received a copy of the GNU General Public License 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 \"World.h\"\n#include \"MetaRoom.h\"\n#include \"openc2eview.h\"\n#include <QtGui>\n#include \"QtBackend.h\"\n\n#ifdef _WIN32\n#include <windows.h>\n#endif\n\n\/*\n * TODO:\n *\n * provide input to the game engine\n * non-X11 support\n * provide a resize event to the engine as needed\n *\n *\/\n\nopenc2eView::openc2eView(QWidget *parent, boost::shared_ptr<QtBackend> b) : QAbstractScrollArea(parent) {\n\tbackend = b;\n\n\tviewport()->setAttribute(Qt::WA_PaintOnScreen); \/\/ disable double-buffering\n\tviewport()->setAttribute(Qt::WA_OpaquePaintEvent); \/\/ no need for Qt to draw a background\n\n\t\/\/ keyboard focus. needed? better way?\n\tsetFocusPolicy(Qt::StrongFocus);\n\n\t\/\/ we need the mouse move events\n\tsetMouseTracking(true);\n\n\t\/\/ TODO: sane? do we really need relx\/rely, anyway?\n\tlastmousex = mapFromGlobal(QCursor::pos()).x();\n\tlastmousey = mapFromGlobal(QCursor::pos()).y();\n\n\tlastMetaroom = NULL;\n}\n\nopenc2eView::~openc2eView() {\n}\n\nboost::shared_ptr<class Backend> openc2eView::getBackend() {\n\treturn boost::dynamic_pointer_cast<class Backend, class QtBackend>(backend);\n}\n\nvoid openc2eView::resizescrollbars() {\n\tif (world.camera.getMetaRoom()) {\n\t\tif (world.camera.getMetaRoom()->wraparound()) {\n\t\t\thorizontalScrollBar()->setRange(0,world.camera.getMetaRoom()->width());\n\t\t} else {\n\t\t\thorizontalScrollBar()->setRange(0,world.camera.getMetaRoom()->width() - viewport()->width());\n\t\t}\n\t\tverticalScrollBar()->setRange(0,world.camera.getMetaRoom()->height() - viewport()->height());\n\t}\n}\n\nbool firsttime = true;\nint currentwidth, currentheight;\n\nvoid openc2eView::resizeEvent(QResizeEvent *) {\n\tif (firsttime) {\n\t\tbackend->setup(viewport());\n\t\tfirsttime = false;\n\t}\n\n\tbackend->resized(viewport()->width(), viewport()->height());\n\tcurrentwidth = viewport()->width();\n\tcurrentheight = viewport()->height();\n\n\tresizescrollbars();\n\n\thorizontalScrollBar()->setPageStep(width());\n\tverticalScrollBar()->setPageStep(height());\n}\n\nvoid openc2eView::paintEvent(QPaintEvent *) {\n\t((QApplication *)QApplication::instance())->syncX();\n\n\tif (!firsttime) {\n\t\t\/\/ TODO: mad hax\n\t\tif (currentwidth == viewport()->width() && currentheight == viewport()->height()) {\n\t\t\tworld.drawWorld();\n\t\t\tbackend->renderDone();\n\t\t}\n\t}\n}\n\nvoid openc2eView::mouseMoveEvent(QMouseEvent *m) {\n\t\/\/ add mouse move event to backend queue\n\tSomeEvent e;\n\te.type = eventmousemove;\n\te.xrel = m->x() - lastmousex;\n\te.yrel = m->y() - lastmousey;\n\tlastmousex = e.x = m->x();\n\tlastmousey = e.y = m->y();\n\te.button = 0;\n\tif (m->buttons() & Qt::LeftButton) e.button |= buttonleft;\n\tif (m->buttons() & Qt::MidButton) e.button |= buttonmiddle;\n\tif (m->buttons() & Qt::RightButton) e.button |= buttonright;\n\tbackend->pushEvent(e);\n}\n\n\/\/ helper function\nvoid openc2eView::mouseEvent(QMouseEvent *m, eventtype t) {\n\tSomeEvent e;\n\te.type = t;\n\te.x = m->x();\n\te.y = m->y();\n\tswitch (m->button()) {\n\t\tcase Qt::LeftButton: e.button = buttonleft; break;\n\t\tcase Qt::MidButton: e.button = buttonmiddle; break;\n\t\tcase Qt::RightButton: e.button = buttonright; break;\n\t\tdefault: return;\n\t}\n\tbackend->pushEvent(e);\n}\n\nvoid openc2eView::mousePressEvent(QMouseEvent *m) {\n\tmouseEvent(m, eventmousebuttondown);\n}\n\nvoid openc2eView::mouseReleaseEvent(QMouseEvent *m) {\n\tmouseEvent(m, eventmousebuttonup);\n}\n\nvoid openc2eView::wheelEvent(QWheelEvent *w) {\n\tSomeEvent e;\n\te.type = eventmousebuttondown;\n\te.x = w->x();\n\te.y = w->y();\t\n\t\/\/ TODO: qt combines events, we should generate one event for every 120 delta, maybe\n\tif (w->delta() < 0)\n\t\te.button = buttonwheelup;\n\telse\n\t\te.button = buttonwheeldown;\n\tbackend->pushEvent(e);\n}\n\nvoid openc2eView::keyPressEvent(QKeyEvent *k) {\n\tbackend->keyEvent(k, true);\n}\n\nvoid openc2eView::keyReleaseEvent(QKeyEvent *k) {\n\tbackend->keyEvent(k, false);\n}\n\nvoid openc2eView::scrollContentsBy(int dx, int dy) {\n\t(void)dx;\n\t(void)dy;\n\tif (lastMetaroom)\n\t\tworld.camera.moveTo(horizontalScrollBar()->value() + lastMetaroom->x(), verticalScrollBar()->value() + lastMetaroom->y());\n}\n\nvoid openc2eView::tick() {\n\tif (lastMetaroom != world.camera.getMetaRoom()) {\n\t\tlastMetaroom = world.camera.getMetaRoom();\n\t\tresizescrollbars();\n\t}\n}\n\nbool openc2eView::needsRender() {\n\treturn backend->needsRender();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\n *\n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2014 Artem Pavlenko\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA\n *\n *****************************************************************************\/\n\n#include <mapnik\/function_call.hpp>\n\nnamespace mapnik {\n\n\n\/\/ functions\n\/\/ exp\n\/\/template <typename T>\nstruct exp_impl\n{\n    \/\/using type = T;\n    value_type operator() (value_type const& val) const\n    {\n        return std::exp(val.to_double());\n    }\n\n};\n\n\/\/ sin\nstruct sin_impl\n{\n    value_type operator() (value_type const& val) const\n    {\n        return std::sin(val.to_double());\n    }\n};\n\n\/\/ cos\nstruct cos_impl\n{\n    value_type operator() (value_type const& val) const\n    {\n        return std::cos(val.to_double());\n    }\n};\n\n\/\/ tan\nstruct tan_impl\n{\n    value_type operator() (value_type const& val) const\n    {\n        return std::tan(val.to_double());\n    }\n};\n\n\/\/ atan\nstruct atan_impl\n{\n    static constexpr char const* name = \"atan\";\n    value_type operator()(value_type const& val) const\n    {\n        return std::atan(val.to_double());\n    }\n};\n\n\/\/ abs\nstruct abs_impl\n{\n    value_type operator() (value_type const& val) const\n    {\n        return std::fabs(val.to_double());\n    }\n};\n\nunary_function_types::unary_function_types()\n{\n    add\n        (\"sin\",  sin_impl())\n        (\"cos\",  cos_impl())\n        (\"tan\",  tan_impl())\n        (\"atan\", atan_impl())\n        (\"exp\",  exp_impl())\n        (\"abs\",  abs_impl())\n        ;\n}\n\nchar const* unary_function_name(unary_function_impl const& fun)\n{\n    if (fun.target<sin_impl>()) return \"sin\";\n    else if (fun.target<cos_impl>()) return \"cos\";\n    else if (fun.target<tan_impl>()) return \"tan\";\n    else if (fun.target<atan_impl>()) return \"atan\";\n    else if (fun.target<exp_impl>()) return \"exp\";\n    else if (fun.target<abs_impl>()) return \"abs\";\n    else return \"unknown\";\n}\n\n\/\/ binary functions\n\/\/ min\ninline value_type min_impl(value_type const& arg1, value_type const& arg2)\n{\n    return std::min(arg1.to_double(), arg2.to_double());\n}\n\/\/ max\ninline value_type max_impl(value_type const& arg1, value_type const& arg2)\n{\n    return std::max(arg1.to_double(), arg2.to_double());\n}\n\/\/ pow\ninline value_type pow_impl(value_type const& arg1, value_type const& arg2)\n{\n    return std::pow(arg1.to_double(), arg2.to_double());\n}\n\nbinary_function_types::binary_function_types()\n{\n    add\n        (\"min\", binary_function_impl(min_impl))\n        (\"max\", binary_function_impl(max_impl))\n        (\"pow\", binary_function_impl(pow_impl))\n        ;\n}\n\nchar const* binary_function_name(binary_function_impl const& fun)\n{\n    value_type(*const* f_ptr)(value_type const&, value_type const&) =\n        fun.target<value_type(*)\n                   (value_type const&, value_type const&)>();\n    if (f_ptr)\n    {\n        if (*f_ptr == min_impl) return \"min\";\n        else if(*f_ptr == max_impl) return \"max\";\n        else if(*f_ptr == pow_impl) return \"pow\";\n    }\n    return \"unknown\";\n}\n\n}\n<commit_msg>remove one more unused function::name that does not compile with msvs 2013 - refs #2396<commit_after>\/*****************************************************************************\n *\n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2014 Artem Pavlenko\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA\n *\n *****************************************************************************\/\n\n#include <mapnik\/function_call.hpp>\n\nnamespace mapnik {\n\n\n\/\/ functions\n\/\/ exp\n\/\/template <typename T>\nstruct exp_impl\n{\n    \/\/using type = T;\n    value_type operator() (value_type const& val) const\n    {\n        return std::exp(val.to_double());\n    }\n\n};\n\n\/\/ sin\nstruct sin_impl\n{\n    value_type operator() (value_type const& val) const\n    {\n        return std::sin(val.to_double());\n    }\n};\n\n\/\/ cos\nstruct cos_impl\n{\n    value_type operator() (value_type const& val) const\n    {\n        return std::cos(val.to_double());\n    }\n};\n\n\/\/ tan\nstruct tan_impl\n{\n    value_type operator() (value_type const& val) const\n    {\n        return std::tan(val.to_double());\n    }\n};\n\n\/\/ atan\nstruct atan_impl\n{\n    value_type operator()(value_type const& val) const\n    {\n        return std::atan(val.to_double());\n    }\n};\n\n\/\/ abs\nstruct abs_impl\n{\n    value_type operator() (value_type const& val) const\n    {\n        return std::fabs(val.to_double());\n    }\n};\n\nunary_function_types::unary_function_types()\n{\n    add\n        (\"sin\",  sin_impl())\n        (\"cos\",  cos_impl())\n        (\"tan\",  tan_impl())\n        (\"atan\", atan_impl())\n        (\"exp\",  exp_impl())\n        (\"abs\",  abs_impl())\n        ;\n}\n\nchar const* unary_function_name(unary_function_impl const& fun)\n{\n    if (fun.target<sin_impl>()) return \"sin\";\n    else if (fun.target<cos_impl>()) return \"cos\";\n    else if (fun.target<tan_impl>()) return \"tan\";\n    else if (fun.target<atan_impl>()) return \"atan\";\n    else if (fun.target<exp_impl>()) return \"exp\";\n    else if (fun.target<abs_impl>()) return \"abs\";\n    else return \"unknown\";\n}\n\n\/\/ binary functions\n\/\/ min\ninline value_type min_impl(value_type const& arg1, value_type const& arg2)\n{\n    return std::min(arg1.to_double(), arg2.to_double());\n}\n\/\/ max\ninline value_type max_impl(value_type const& arg1, value_type const& arg2)\n{\n    return std::max(arg1.to_double(), arg2.to_double());\n}\n\/\/ pow\ninline value_type pow_impl(value_type const& arg1, value_type const& arg2)\n{\n    return std::pow(arg1.to_double(), arg2.to_double());\n}\n\nbinary_function_types::binary_function_types()\n{\n    add\n        (\"min\", binary_function_impl(min_impl))\n        (\"max\", binary_function_impl(max_impl))\n        (\"pow\", binary_function_impl(pow_impl))\n        ;\n}\n\nchar const* binary_function_name(binary_function_impl const& fun)\n{\n    value_type(*const* f_ptr)(value_type const&, value_type const&) =\n        fun.target<value_type(*)\n                   (value_type const&, value_type const&)>();\n    if (f_ptr)\n    {\n        if (*f_ptr == min_impl) return \"min\";\n        else if(*f_ptr == max_impl) return \"max\";\n        else if(*f_ptr == pow_impl) return \"pow\";\n    }\n    return \"unknown\";\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2014 Alessio Sclocco <a.sclocco@vu.nl>\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include <iostream>\n#include <fstream>\n#include <string>\n#include <vector>\n#include <exception>\n#include <fstream>\n#include <iomanip>\n#include <limits>\n\n#include <ArgumentList.hpp>\n#include <Observation.hpp>\n#include <Shifts.hpp>\n#include <Dedispersion.hpp>\n#include <utils.hpp>\n#include <Exceptions.hpp>\n\ntypedef float dataType;\nstring typeName(\"float\");\n\n\nint main(int argc, char * argv[]) {\n  bool avx = false;\n  bool phi = false;\n\tunsigned int maxItemsPerThread = 0;\n  std::string headerFilename;\n  std::string implementationFilename;\n  AstroData::Observation< dataType > observation(\"DedispersionTuning\", typeName);\n\n\ttry {\n    isa::utils::ArgumentList args(argc, argv);\n\n\t\tobservation.setPadding(args.getSwitchArgument< unsigned int >(\"-padding\"));\n    headerFilename = args.getSwitchArgument< std::string >(\"-header\");\n    implementationFilename = args.getSwitchArgument< std::string >(\"-implementation\");\n    avx = args.getSwitch(\"-avx\");\n    phi = args.getSwitch(\"-phi\");\n    if ( !(avx ^ phi) ) {\n      throw isa::Exceptions::EmptyCommandLine();\n    }\n\t\tmaxItemsPerThread = args.getSwitchArgument< unsigned int >(\"-max_items\");\n\t\tobservation.setMinFreq(args.getSwitchArgument< float >(\"-min_freq\"));\n\t\tobservation.setChannelBandwidth(args.getSwitchArgument< float >(\"-channel_bandwidth\"));\n\t\tobservation.setNrSamplesPerSecond(args.getSwitchArgument< unsigned int >(\"-samples\"));\n\t\tobservation.setNrChannels(args.getSwitchArgument< unsigned int >(\"-channels\"));\n\t\tobservation.setNrDMs(args.getSwitchArgument< unsigned int >(\"-dms\"));\n\t\tobservation.setFirstDM(args.getSwitchArgument< float >(\"-dm_first\"));\n\t\tobservation.setDMStep(args.getSwitchArgument< float >(\"-dm_step\"));\n\t\tobservation.setMaxFreq(observation.getMinFreq() + (observation.getChannelBandwidth() * (observation.getNrChannels() - 1)));\n\t} catch ( isa::Exceptions::EmptyCommandLine &err ) {\n\t\tstd::cerr << argv[0] << \" -padding ... -header ... -implementation ... [-avx] [-phi] -max_items ... -min_freq ... -channel_bandwidth ... -samples ... -channels ... -dms ... -dm_first ... -dm_step ...\" << std::endl;\n\t\treturn 1;\n\t} catch ( std::exception &err ) {\n\t\tstd::cerr << err.what() << std::endl;\n\t\treturn 1;\n\t}\n  std::vector< unsigned int > * shifts = PulsarSearch::getShifts(observation);\n  observation.setNrSamplesPerDispersedChannel(observation.getNrSamplesPerSecond() + (*shifts)[((observation.getNrDMs() - 1) * observation.getNrPaddedChannels())]);\n  delete shifts;\n\n  std::string underscore(\"_\");\n  std::string * defineName = isa::utils::replace(&headerFilename, \".\", underscore);\n  std::ofstream headerFile(headerFilename);\n  std::ofstream implementationFile(implementationFilename);\n\n  headerFile << \"#ifndef \" + *defineName + \"\\n#define \" + *defineName << std::endl;\n  implementationFile << \"#include <\" + headerFilename + \">\\n#include <Dedispersion.hpp>\" << std::endl;\n  implementationFile << \"namespace PulsarSearch {\\ntemplate< typename T > std::map< std::string, dedispersionFunc< T > > * getDedispersionPointers() {\" << std::endl;\n  implementationFile << \"std::map< std::string, dedispersionFunc< T > > functionPointers = new std::map< std::string, dedispersionFunc< T > >();\" << std::endl;\n\n  for ( unsigned int samplesPerThread = 1; samplesPerThread <= maxItemsPerThread; samplesPerThread++ ) {\n    if ( (observation.getNrSamplesPerPaddedSecond() % samplesPerThread) != 0 ) {\n      continue;\n    }\n    for ( unsigned int DMsPerThread = 1; DMsPerThread <= maxItemsPerThread; DMsPerThread++ ) {\n      if ( (observation.getNrDMs() % DMsPerThread) != 0 ) {\n        continue;\n      }\n      if ( ( samplesPerThread * DMsPerThread ) > maxItemsPerThread ) {\n        break;\n      }\n\n      \/\/ Generate kernel\n      std::string * code = 0;\n      \n      if ( avx ) {\n        code = PulsarSearch::getDedispersionAVX(samplesPerThread, DMsPerThread, observation);\n        implementationFile << \"functionPointers->insert(std::make_pair(\\\"dedispersionAVX\" + isa::utils::toString< unsigned int >(samplesPerThread) + \"x\" + isa::utils::toString< unsigned int >(DMsPerThread) + \"\\\", dedispersionAVX\" + isa::utils::toString< unsigned int >(samplesPerThread) + \"x\" + isa::utils::toString< unsigned int >(DMsPerThread) + \"));\" << std::endl;\n      } else if ( phi ) {\n        code = PulsarSearch::getDedispersionPhi(samplesPerThread, DMsPerThread, observation);\n        implementationFile << \"functionPointers->insert(std::make_pair(\\\"dedispersionPhi\" + isa::utils::toString< unsigned int >(samplesPerThread) + \"x\" + isa::utils::toString< unsigned int >(DMsPerThread) + \"\\\", dedispersionPhi\" + isa::utils::toString< unsigned int >(samplesPerThread) + \"x\" + isa::utils::toString< unsigned int >(DMsPerThread) + \"));\" << std::endl;\n      }\n      headerFile << *code << std::endl;\n      delete code;\n    }\n  }\n\n  implementationFile << \"return functionPointers;\\n}\" << std::endl;\n  headerFile << \"#endif\" << std::endl;\n\n\treturn 0;\n}\n\n<commit_msg>Fixing a typo in the generated code.<commit_after>\/\/ Copyright 2014 Alessio Sclocco <a.sclocco@vu.nl>\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include <iostream>\n#include <fstream>\n#include <string>\n#include <vector>\n#include <exception>\n#include <fstream>\n#include <iomanip>\n#include <limits>\n\n#include <ArgumentList.hpp>\n#include <Observation.hpp>\n#include <Shifts.hpp>\n#include <Dedispersion.hpp>\n#include <utils.hpp>\n#include <Exceptions.hpp>\n\ntypedef float dataType;\nstring typeName(\"float\");\n\n\nint main(int argc, char * argv[]) {\n  bool avx = false;\n  bool phi = false;\n\tunsigned int maxItemsPerThread = 0;\n  std::string headerFilename;\n  std::string implementationFilename;\n  AstroData::Observation< dataType > observation(\"DedispersionTuning\", typeName);\n\n\ttry {\n    isa::utils::ArgumentList args(argc, argv);\n\n\t\tobservation.setPadding(args.getSwitchArgument< unsigned int >(\"-padding\"));\n    headerFilename = args.getSwitchArgument< std::string >(\"-header\");\n    implementationFilename = args.getSwitchArgument< std::string >(\"-implementation\");\n    avx = args.getSwitch(\"-avx\");\n    phi = args.getSwitch(\"-phi\");\n    if ( !(avx ^ phi) ) {\n      throw isa::Exceptions::EmptyCommandLine();\n    }\n\t\tmaxItemsPerThread = args.getSwitchArgument< unsigned int >(\"-max_items\");\n\t\tobservation.setMinFreq(args.getSwitchArgument< float >(\"-min_freq\"));\n\t\tobservation.setChannelBandwidth(args.getSwitchArgument< float >(\"-channel_bandwidth\"));\n\t\tobservation.setNrSamplesPerSecond(args.getSwitchArgument< unsigned int >(\"-samples\"));\n\t\tobservation.setNrChannels(args.getSwitchArgument< unsigned int >(\"-channels\"));\n\t\tobservation.setNrDMs(args.getSwitchArgument< unsigned int >(\"-dms\"));\n\t\tobservation.setFirstDM(args.getSwitchArgument< float >(\"-dm_first\"));\n\t\tobservation.setDMStep(args.getSwitchArgument< float >(\"-dm_step\"));\n\t\tobservation.setMaxFreq(observation.getMinFreq() + (observation.getChannelBandwidth() * (observation.getNrChannels() - 1)));\n\t} catch ( isa::Exceptions::EmptyCommandLine &err ) {\n\t\tstd::cerr << argv[0] << \" -padding ... -header ... -implementation ... [-avx] [-phi] -max_items ... -min_freq ... -channel_bandwidth ... -samples ... -channels ... -dms ... -dm_first ... -dm_step ...\" << std::endl;\n\t\treturn 1;\n\t} catch ( std::exception &err ) {\n\t\tstd::cerr << err.what() << std::endl;\n\t\treturn 1;\n\t}\n  std::vector< unsigned int > * shifts = PulsarSearch::getShifts(observation);\n  observation.setNrSamplesPerDispersedChannel(observation.getNrSamplesPerSecond() + (*shifts)[((observation.getNrDMs() - 1) * observation.getNrPaddedChannels())]);\n  delete shifts;\n\n  std::string underscore(\"_\");\n  std::string * defineName = isa::utils::replace(&headerFilename, \".\", underscore);\n  std::ofstream headerFile(headerFilename);\n  std::ofstream implementationFile(implementationFilename);\n\n  headerFile << \"#ifndef \" + *defineName + \"\\n#define \" + *defineName << std::endl;\n  implementationFile << \"#include <\" + headerFilename + \">\\n#include <Dedispersion.hpp>\" << std::endl;\n  implementationFile << \"namespace PulsarSearch {\\ntemplate< typename T > std::map< std::string, dedispersionFunc< T > > * getDedispersionPointers() {\" << std::endl;\n  implementationFile << \"std::map< std::string, dedispersionFunc< T > > functionPointers = new std::map< std::string, dedispersionFunc< T > >();\" << std::endl;\n\n  for ( unsigned int samplesPerThread = 1; samplesPerThread <= maxItemsPerThread; samplesPerThread++ ) {\n    if ( (observation.getNrSamplesPerPaddedSecond() % samplesPerThread) != 0 ) {\n      continue;\n    }\n    for ( unsigned int DMsPerThread = 1; DMsPerThread <= maxItemsPerThread; DMsPerThread++ ) {\n      if ( (observation.getNrDMs() % DMsPerThread) != 0 ) {\n        continue;\n      }\n      if ( ( samplesPerThread * DMsPerThread ) > maxItemsPerThread ) {\n        break;\n      }\n\n      \/\/ Generate kernel\n      std::string * code = 0;\n      \n      if ( avx ) {\n        code = PulsarSearch::getDedispersionAVX(samplesPerThread, DMsPerThread, observation);\n        implementationFile << \"functionPointers->insert(std::make_pair(\\\"dedispersionAVX\" + isa::utils::toString< unsigned int >(samplesPerThread) + \"x\" + isa::utils::toString< unsigned int >(DMsPerThread) + \"\\\", dedispersionAVX\" + isa::utils::toString< unsigned int >(samplesPerThread) + \"x\" + isa::utils::toString< unsigned int >(DMsPerThread) + \"));\" << std::endl;\n      } else if ( phi ) {\n        code = PulsarSearch::getDedispersionPhi(samplesPerThread, DMsPerThread, observation);\n        implementationFile << \"functionPointers->insert(std::make_pair(\\\"dedispersionPhi\" + isa::utils::toString< unsigned int >(samplesPerThread) + \"x\" + isa::utils::toString< unsigned int >(DMsPerThread) + \"\\\", dedispersionPhi\" + isa::utils::toString< unsigned int >(samplesPerThread) + \"x\" + isa::utils::toString< unsigned int >(DMsPerThread) + \"));\" << std::endl;\n      }\n      headerFile << *code << std::endl;\n      delete code;\n    }\n  }\n\n  implementationFile << \"return functionPointers;\\n}\\n}\" << std::endl;\n  headerFile << \"#endif\" << std::endl;\n\n\treturn 0;\n}\n\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\/client.hpp\"\n#include \"iceoryx_posh\/popo\/listener.hpp\"\n#include \"iceoryx_posh\/popo\/server.hpp\"\n#include \"iceoryx_posh\/popo\/subscriber.hpp\"\n#include \"iceoryx_posh\/popo\/untyped_client.hpp\"\n#include \"iceoryx_posh\/popo\/untyped_server.hpp\"\n#include \"iceoryx_posh\/popo\/untyped_subscriber.hpp\"\n#include \"iceoryx_posh\/testing\/mocks\/posh_runtime_mock.hpp\"\n\n#include \"test.hpp\"\nnamespace\n{\nusing namespace ::testing;\nusing namespace ::iox::popo;\nusing namespace ::iox::cxx;\nusing namespace ::iox::capro;\nusing namespace ::iox::mepoo;\n\nconstexpr const char RUNTIME_NAME[] = \"torben_dallas\";\nconstexpr const char SERVICE[] = \"respect_to_the_man_in_the_icecream_van\";\nconstexpr const char INSTANCE[] = \"Lakierski materialski\";\nconstexpr const char EVENT[] = \"boom boom boomerang\";\n\n\/\/\/ Those tests verify that the destructor of the attachables is correct. When we\n\/\/\/ use inheritance it is possible that the trigger is a member of the base class\n\/\/\/ and destroyed in the base class constructor as well.\n\/\/\/ But the listener and waitset require the child class for cleanup. If the child\n\/\/\/ class destructor does not call reset on all the triggers the base class will\n\/\/\/ and the listener and waitset will call a method on the original class which is\n\/\/\/ already deleted. This causes undefined behavior which the sanitizer will catch.\n\/\/\/\n\/\/\/ The following tests should be run for all classes which can be attached to a\n\/\/\/ listener or a waitset to ensure that trigger.reset() is called in the child destructor\n\/\/\/ when we work with inheritance.\n\/\/\/\n\/\/\/ When no inheritance is used we shouldn't encounter any problems.\n\/\/\/\n\/\/\/ It suffices to call all tests on the listener since the listener and the waitset\n\/\/\/ are using the same trigger concept\nclass ListenerWaitsetAttachments_test : public Test\n{\n  public:\n    void SetUp()\n    {\n        EXPECT_CALL(*this->runtimeMock, getMiddlewareConditionVariable())\n            .WillOnce(Return(&this->conditionVariableData));\n        listener.emplace();\n    }\n\n    template <typename T>\n    static void genericTriggerCallback(T* const)\n    {\n    }\n\n    std::unique_ptr<PoshRuntimeMock> runtimeMock = PoshRuntimeMock::create(RUNTIME_NAME);\n    ConditionVariableData conditionVariableData{RUNTIME_NAME};\n    optional<Listener> listener;\n\n    MemoryManager memoryManager;\n};\n\n\nTEST_F(ListenerWaitsetAttachments_test, SubscriberAttachesToListener)\n{\n  ::testing::Test::RecordProperty(\"TEST_ID\",\"f1d163e0-4479-47b4-b4e8-01b0ee6a71b0\");\n    SubscriberPortData subscriberData({SERVICE, INSTANCE, EVENT},\n                                      RUNTIME_NAME,\n                                      VariantQueueTypes::SoFi_MultiProducerSingleConsumer,\n                                      SubscriberOptions());\n    EXPECT_CALL(*this->runtimeMock, getMiddlewareSubscriber(_, _, _)).WillOnce(Return(&subscriberData));\n\n    optional<Subscriber<int>> subscriber;\n    subscriber.emplace(ServiceDescription(SERVICE, INSTANCE, EVENT));\n\n    ASSERT_FALSE(listener\n                     ->attachEvent(*subscriber,\n                                   SubscriberEvent::DATA_RECEIVED,\n                                   createNotificationCallback(\n                                       ListenerWaitsetAttachments_test::genericTriggerCallback<Subscriber<int>>))\n                     .has_error());\n\n    EXPECT_THAT(listener->size(), Eq(1));\n    subscriber.reset();\n    EXPECT_THAT(listener->size(), Eq(0));\n}\n\nTEST_F(ListenerWaitsetAttachments_test, UntypedSubscriberAttachesToListener)\n{\n  ::testing::Test::RecordProperty(\"TEST_ID\",\"a78a7016-46b6-4223-b7b1-e30344bb208f\");\n    SubscriberPortData subscriberData({SERVICE, INSTANCE, EVENT},\n                                      RUNTIME_NAME,\n                                      VariantQueueTypes::SoFi_MultiProducerSingleConsumer,\n                                      SubscriberOptions());\n    EXPECT_CALL(*this->runtimeMock, getMiddlewareSubscriber(_, _, _)).WillOnce(Return(&subscriberData));\n\n    optional<UntypedSubscriber> subscriber;\n    subscriber.emplace(ServiceDescription(SERVICE, INSTANCE, EVENT));\n\n    ASSERT_FALSE(listener\n                     ->attachEvent(*subscriber,\n                                   SubscriberEvent::DATA_RECEIVED,\n                                   createNotificationCallback(\n                                       ListenerWaitsetAttachments_test::genericTriggerCallback<UntypedSubscriber>))\n                     .has_error());\n\n    EXPECT_THAT(listener->size(), Eq(1));\n    subscriber.reset();\n    EXPECT_THAT(listener->size(), Eq(0));\n}\n\nTEST_F(ListenerWaitsetAttachments_test, ClientAttachesToListener)\n{\n  ::testing::Test::RecordProperty(\"TEST_ID\",\"e21d98b9-9d24-4c85-90b9-0e7acd24a242\");\n    ClientPortData clientData({SERVICE, INSTANCE, EVENT}, RUNTIME_NAME, ClientOptions(), &memoryManager);\n    EXPECT_CALL(*this->runtimeMock, getMiddlewareClient(_, _, _)).WillOnce(Return(&clientData));\n\n    optional<Client<int, int>> client;\n    client.emplace(ServiceDescription(SERVICE, INSTANCE, EVENT));\n\n    ASSERT_FALSE(listener\n                     ->attachEvent(*client,\n                                   ClientEvent::RESPONSE_RECEIVED,\n                                   createNotificationCallback(\n                                       ListenerWaitsetAttachments_test::genericTriggerCallback<Client<int, int>>))\n                     .has_error());\n\n    EXPECT_THAT(listener->size(), Eq(1));\n    client.reset();\n    EXPECT_THAT(listener->size(), Eq(0));\n}\n\nTEST_F(ListenerWaitsetAttachments_test, UntypedClientAttachesToListener)\n{\n  ::testing::Test::RecordProperty(\"TEST_ID\",\"07934dd2-93aa-4aab-a216-eb86e842088b\");\n    ClientPortData clientData({SERVICE, INSTANCE, EVENT}, RUNTIME_NAME, ClientOptions(), &memoryManager);\n    EXPECT_CALL(*this->runtimeMock, getMiddlewareClient(_, _, _)).WillOnce(Return(&clientData));\n\n    optional<UntypedClient> client;\n    client.emplace(ServiceDescription(SERVICE, INSTANCE, EVENT));\n\n    ASSERT_FALSE(listener\n                     ->attachEvent(*client,\n                                   ClientEvent::RESPONSE_RECEIVED,\n                                   createNotificationCallback(\n                                       ListenerWaitsetAttachments_test::genericTriggerCallback<UntypedClient>))\n                     .has_error());\n\n    EXPECT_THAT(listener->size(), Eq(1));\n    client.reset();\n    EXPECT_THAT(listener->size(), Eq(0));\n}\n\nTEST_F(ListenerWaitsetAttachments_test, ServerAttachesToListener)\n{\n  ::testing::Test::RecordProperty(\"TEST_ID\",\"306d7ef9-1fb1-4ce8-8b58-e5a7cb5fff69\");\n    ServerPortData serverData({SERVICE, INSTANCE, EVENT}, RUNTIME_NAME, ServerOptions(), &memoryManager);\n    EXPECT_CALL(*this->runtimeMock, getMiddlewareServer(_, _, _)).WillOnce(Return(&serverData));\n\n    optional<Server<int, int>> server;\n    server.emplace(ServiceDescription(SERVICE, INSTANCE, EVENT));\n\n    ASSERT_FALSE(listener\n                     ->attachEvent(*server,\n                                   ServerEvent::REQUEST_RECEIVED,\n                                   createNotificationCallback(\n                                       ListenerWaitsetAttachments_test::genericTriggerCallback<Server<int, int>>))\n                     .has_error());\n\n    EXPECT_THAT(listener->size(), Eq(1));\n    server.reset();\n    EXPECT_THAT(listener->size(), Eq(0));\n}\n\nTEST_F(ListenerWaitsetAttachments_test, UntypedServerAttachesToListener)\n{\n  ::testing::Test::RecordProperty(\"TEST_ID\",\"3d074e8f-eab6-475d-a884-de8b4d2596ea\");\n    ServerPortData serverData({SERVICE, INSTANCE, EVENT}, RUNTIME_NAME, ServerOptions(), &memoryManager);\n    EXPECT_CALL(*this->runtimeMock, getMiddlewareServer(_, _, _)).WillOnce(Return(&serverData));\n\n    optional<UntypedServer> server;\n    server.emplace(ServiceDescription(SERVICE, INSTANCE, EVENT));\n\n    ASSERT_FALSE(listener\n                     ->attachEvent(*server,\n                                   ServerEvent::REQUEST_RECEIVED,\n                                   createNotificationCallback(\n                                       ListenerWaitsetAttachments_test::genericTriggerCallback<UntypedServer>))\n                     .has_error());\n\n    EXPECT_THAT(listener->size(), Eq(1));\n    server.reset();\n    EXPECT_THAT(listener->size(), Eq(0));\n}\n} \/\/ namespace\n<commit_msg>iox-#1173 clang-format<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\/client.hpp\"\n#include \"iceoryx_posh\/popo\/listener.hpp\"\n#include \"iceoryx_posh\/popo\/server.hpp\"\n#include \"iceoryx_posh\/popo\/subscriber.hpp\"\n#include \"iceoryx_posh\/popo\/untyped_client.hpp\"\n#include \"iceoryx_posh\/popo\/untyped_server.hpp\"\n#include \"iceoryx_posh\/popo\/untyped_subscriber.hpp\"\n#include \"iceoryx_posh\/testing\/mocks\/posh_runtime_mock.hpp\"\n\n#include \"test.hpp\"\nnamespace\n{\nusing namespace ::testing;\nusing namespace ::iox::popo;\nusing namespace ::iox::cxx;\nusing namespace ::iox::capro;\nusing namespace ::iox::mepoo;\n\nconstexpr const char RUNTIME_NAME[] = \"torben_dallas\";\nconstexpr const char SERVICE[] = \"respect_to_the_man_in_the_icecream_van\";\nconstexpr const char INSTANCE[] = \"Lakierski materialski\";\nconstexpr const char EVENT[] = \"boom boom boomerang\";\n\n\/\/\/ Those tests verify that the destructor of the attachables is correct. When we\n\/\/\/ use inheritance it is possible that the trigger is a member of the base class\n\/\/\/ and destroyed in the base class constructor as well.\n\/\/\/ But the listener and waitset require the child class for cleanup. If the child\n\/\/\/ class destructor does not call reset on all the triggers the base class will\n\/\/\/ and the listener and waitset will call a method on the original class which is\n\/\/\/ already deleted. This causes undefined behavior which the sanitizer will catch.\n\/\/\/\n\/\/\/ The following tests should be run for all classes which can be attached to a\n\/\/\/ listener or a waitset to ensure that trigger.reset() is called in the child destructor\n\/\/\/ when we work with inheritance.\n\/\/\/\n\/\/\/ When no inheritance is used we shouldn't encounter any problems.\n\/\/\/\n\/\/\/ It suffices to call all tests on the listener since the listener and the waitset\n\/\/\/ are using the same trigger concept\nclass ListenerWaitsetAttachments_test : public Test\n{\n  public:\n    void SetUp()\n    {\n        EXPECT_CALL(*this->runtimeMock, getMiddlewareConditionVariable())\n            .WillOnce(Return(&this->conditionVariableData));\n        listener.emplace();\n    }\n\n    template <typename T>\n    static void genericTriggerCallback(T* const)\n    {\n    }\n\n    std::unique_ptr<PoshRuntimeMock> runtimeMock = PoshRuntimeMock::create(RUNTIME_NAME);\n    ConditionVariableData conditionVariableData{RUNTIME_NAME};\n    optional<Listener> listener;\n\n    MemoryManager memoryManager;\n};\n\n\nTEST_F(ListenerWaitsetAttachments_test, SubscriberAttachesToListener)\n{\n    ::testing::Test::RecordProperty(\"TEST_ID\", \"f1d163e0-4479-47b4-b4e8-01b0ee6a71b0\");\n    SubscriberPortData subscriberData({SERVICE, INSTANCE, EVENT},\n                                      RUNTIME_NAME,\n                                      VariantQueueTypes::SoFi_MultiProducerSingleConsumer,\n                                      SubscriberOptions());\n    EXPECT_CALL(*this->runtimeMock, getMiddlewareSubscriber(_, _, _)).WillOnce(Return(&subscriberData));\n\n    optional<Subscriber<int>> subscriber;\n    subscriber.emplace(ServiceDescription(SERVICE, INSTANCE, EVENT));\n\n    ASSERT_FALSE(listener\n                     ->attachEvent(*subscriber,\n                                   SubscriberEvent::DATA_RECEIVED,\n                                   createNotificationCallback(\n                                       ListenerWaitsetAttachments_test::genericTriggerCallback<Subscriber<int>>))\n                     .has_error());\n\n    EXPECT_THAT(listener->size(), Eq(1));\n    subscriber.reset();\n    EXPECT_THAT(listener->size(), Eq(0));\n}\n\nTEST_F(ListenerWaitsetAttachments_test, UntypedSubscriberAttachesToListener)\n{\n    ::testing::Test::RecordProperty(\"TEST_ID\", \"a78a7016-46b6-4223-b7b1-e30344bb208f\");\n    SubscriberPortData subscriberData({SERVICE, INSTANCE, EVENT},\n                                      RUNTIME_NAME,\n                                      VariantQueueTypes::SoFi_MultiProducerSingleConsumer,\n                                      SubscriberOptions());\n    EXPECT_CALL(*this->runtimeMock, getMiddlewareSubscriber(_, _, _)).WillOnce(Return(&subscriberData));\n\n    optional<UntypedSubscriber> subscriber;\n    subscriber.emplace(ServiceDescription(SERVICE, INSTANCE, EVENT));\n\n    ASSERT_FALSE(listener\n                     ->attachEvent(*subscriber,\n                                   SubscriberEvent::DATA_RECEIVED,\n                                   createNotificationCallback(\n                                       ListenerWaitsetAttachments_test::genericTriggerCallback<UntypedSubscriber>))\n                     .has_error());\n\n    EXPECT_THAT(listener->size(), Eq(1));\n    subscriber.reset();\n    EXPECT_THAT(listener->size(), Eq(0));\n}\n\nTEST_F(ListenerWaitsetAttachments_test, ClientAttachesToListener)\n{\n    ::testing::Test::RecordProperty(\"TEST_ID\", \"e21d98b9-9d24-4c85-90b9-0e7acd24a242\");\n    ClientPortData clientData({SERVICE, INSTANCE, EVENT}, RUNTIME_NAME, ClientOptions(), &memoryManager);\n    EXPECT_CALL(*this->runtimeMock, getMiddlewareClient(_, _, _)).WillOnce(Return(&clientData));\n\n    optional<Client<int, int>> client;\n    client.emplace(ServiceDescription(SERVICE, INSTANCE, EVENT));\n\n    ASSERT_FALSE(listener\n                     ->attachEvent(*client,\n                                   ClientEvent::RESPONSE_RECEIVED,\n                                   createNotificationCallback(\n                                       ListenerWaitsetAttachments_test::genericTriggerCallback<Client<int, int>>))\n                     .has_error());\n\n    EXPECT_THAT(listener->size(), Eq(1));\n    client.reset();\n    EXPECT_THAT(listener->size(), Eq(0));\n}\n\nTEST_F(ListenerWaitsetAttachments_test, UntypedClientAttachesToListener)\n{\n    ::testing::Test::RecordProperty(\"TEST_ID\", \"07934dd2-93aa-4aab-a216-eb86e842088b\");\n    ClientPortData clientData({SERVICE, INSTANCE, EVENT}, RUNTIME_NAME, ClientOptions(), &memoryManager);\n    EXPECT_CALL(*this->runtimeMock, getMiddlewareClient(_, _, _)).WillOnce(Return(&clientData));\n\n    optional<UntypedClient> client;\n    client.emplace(ServiceDescription(SERVICE, INSTANCE, EVENT));\n\n    ASSERT_FALSE(listener\n                     ->attachEvent(*client,\n                                   ClientEvent::RESPONSE_RECEIVED,\n                                   createNotificationCallback(\n                                       ListenerWaitsetAttachments_test::genericTriggerCallback<UntypedClient>))\n                     .has_error());\n\n    EXPECT_THAT(listener->size(), Eq(1));\n    client.reset();\n    EXPECT_THAT(listener->size(), Eq(0));\n}\n\nTEST_F(ListenerWaitsetAttachments_test, ServerAttachesToListener)\n{\n    ::testing::Test::RecordProperty(\"TEST_ID\", \"306d7ef9-1fb1-4ce8-8b58-e5a7cb5fff69\");\n    ServerPortData serverData({SERVICE, INSTANCE, EVENT}, RUNTIME_NAME, ServerOptions(), &memoryManager);\n    EXPECT_CALL(*this->runtimeMock, getMiddlewareServer(_, _, _)).WillOnce(Return(&serverData));\n\n    optional<Server<int, int>> server;\n    server.emplace(ServiceDescription(SERVICE, INSTANCE, EVENT));\n\n    ASSERT_FALSE(listener\n                     ->attachEvent(*server,\n                                   ServerEvent::REQUEST_RECEIVED,\n                                   createNotificationCallback(\n                                       ListenerWaitsetAttachments_test::genericTriggerCallback<Server<int, int>>))\n                     .has_error());\n\n    EXPECT_THAT(listener->size(), Eq(1));\n    server.reset();\n    EXPECT_THAT(listener->size(), Eq(0));\n}\n\nTEST_F(ListenerWaitsetAttachments_test, UntypedServerAttachesToListener)\n{\n    ::testing::Test::RecordProperty(\"TEST_ID\", \"3d074e8f-eab6-475d-a884-de8b4d2596ea\");\n    ServerPortData serverData({SERVICE, INSTANCE, EVENT}, RUNTIME_NAME, ServerOptions(), &memoryManager);\n    EXPECT_CALL(*this->runtimeMock, getMiddlewareServer(_, _, _)).WillOnce(Return(&serverData));\n\n    optional<UntypedServer> server;\n    server.emplace(ServiceDescription(SERVICE, INSTANCE, EVENT));\n\n    ASSERT_FALSE(listener\n                     ->attachEvent(*server,\n                                   ServerEvent::REQUEST_RECEIVED,\n                                   createNotificationCallback(\n                                       ListenerWaitsetAttachments_test::genericTriggerCallback<UntypedServer>))\n                     .has_error());\n\n    EXPECT_THAT(listener->size(), Eq(1));\n    server.reset();\n    EXPECT_THAT(listener->size(), Eq(0));\n}\n} \/\/ namespace\n<|endoftext|>"}
{"text":"<commit_before>\/\/ action_ridge.C\n\n#include \"action.h\"\n#include \"daisy.h\"\n#include \"field.h\"\n#include \"ridge.h\"\n\nstruct ActionRidge : public Action\n{\n  const AttributeList& ridge;\n\n  void doIt (Daisy& daisy)\n    { \n      COUT << \" [Ridging]\\n\";      \n      daisy.field.ridge (ridge); \n    }\n\n  ActionRidge (const AttributeList& al)\n    : Action (al),\n      ridge (al.alist (\"ridge\"))\n    { }\n};\n\n\/\/ Add the ActionRidge syntax to the syntax table.\nstatic struct ActionRidgeSyntax\n{\n  static Action& make (const AttributeList& al)\n  { return *new ActionRidge (al); }\n\n  ActionRidgeSyntax ()\n  { \n    Syntax& syntax = *new Syntax ();\n    AttributeList& alist = *new AttributeList ();\n    alist.add (\"description\", \"Ridge a ridge on the field.\");\n    add_submodule<Ridge> (\"ridge\", syntax, alist, Syntax::Const,\n\t\t\t  \"Ridge parameters\");\n    syntax.order (\"ridge\");\n    Librarian<Action>::add_type (\"ridge\", alist, syntax, &make);\n  }\n} ActionRidge_syntax;\n\n<commit_msg>Borland templates.<commit_after>\/\/ action_ridge.C\n\n#include \"action.h\"\n#include \"daisy.h\"\n#include \"field.h\"\n#include \"ridge.h\"\n\nstruct ActionRidge : public Action\n{\n  const AttributeList& ridge;\n\n  void doIt (Daisy& daisy)\n    { \n      COUT << \" [Ridging]\\n\";      \n      daisy.field.ridge (ridge); \n    }\n\n  ActionRidge (const AttributeList& al)\n    : Action (al),\n      ridge (al.alist (\"ridge\"))\n    { }\n};\n\n#ifdef BORLAND_TEMPLATES\ntemplate class add_submodule_sequence<Ridge>;\n#endif\n\n\/\/ Add the ActionRidge syntax to the syntax table.\nstatic struct ActionRidgeSyntax\n{\n  static Action& make (const AttributeList& al)\n  { return *new ActionRidge (al); }\n\n  ActionRidgeSyntax ()\n  { \n    Syntax& syntax = *new Syntax ();\n    AttributeList& alist = *new AttributeList ();\n    alist.add (\"description\", \"Ridge a ridge on the field.\");\n    add_submodule<Ridge> (\"ridge\", syntax, alist, Syntax::Const,\n\t\t\t  \"Ridge parameters\");\n    syntax.order (\"ridge\");\n    Librarian<Action>::add_type (\"ridge\", alist, syntax, &make);\n  }\n} ActionRidge_syntax;\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: sorgitm.cxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: hr $ $Date: 2007-06-27 23:07:56 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sfx2.hxx\"\n\n#include <sfx2\/sfxsids.hrc>\n#include \"sorgitm.hxx\"\n\/\/ STATIC DATA -----------------------------------------------------------\n\nTYPEINIT1_AUTOFACTORY(SfxScriptOrganizerItem, SfxStringItem);\n\n\/\/------------------------------------------------------------------------\n\nSfxScriptOrganizerItem::SfxScriptOrganizerItem() :\n\n    SfxStringItem()\n\n{\n}\n\n\/\/------------------------------------------------------------------------\n\nSfxScriptOrganizerItem::SfxScriptOrganizerItem( const String& rLanguage ) :\n\n     SfxStringItem( SID_SCRIPTORGANIZER, rLanguage ),\n\n     aLanguage( rLanguage )\n\n{\n}\n\n\/\/------------------------------------------------------------------------\n\nSfxScriptOrganizerItem::SfxScriptOrganizerItem( const SfxScriptOrganizerItem& rItem ) :\n\n    SfxStringItem( rItem ),\n\n    aLanguage( rItem.aLanguage )\n\n{\n}\n\n\/\/------------------------------------------------------------------------\n\nSfxScriptOrganizerItem::~SfxScriptOrganizerItem()\n{\n}\n\n\/\/------------------------------------------------------------------------\n\nSfxPoolItem* SfxScriptOrganizerItem::Clone( SfxItemPool * ) const\n{\n    return new SfxScriptOrganizerItem( *this );\n}\n\n\/\/------------------------------------------------------------------------\n\nint SfxScriptOrganizerItem::operator==( const SfxPoolItem& rItem) const\n{\n     return rItem.Type() == Type() &&\n         SfxStringItem::operator==(rItem) &&\n         aLanguage == ((const SfxScriptOrganizerItem &)rItem).aLanguage;\n}\n\n\nsal_Bool SfxScriptOrganizerItem::QueryValue( com::sun::star::uno::Any& rVal, BYTE nMemberId ) const\n{\n    String aValue;\n    BOOL bIsString = FALSE;\n    sal_Bool bValue = sal_False;\n    nMemberId &= ~CONVERT_TWIPS;\n    switch ( nMemberId )\n    {\n        case 0:\n        case MID_SCRIPT_ORGANIZER_LANGUAGE:\n            bIsString = TRUE;\n            aValue = aLanguage;\n            break;\n        default:\n            DBG_ERROR(\"Wrong MemberId!\");\n               return sal_False;\n     }\n\n    if ( bIsString )\n        rVal <<= ::rtl::OUString( aValue );\n    else\n        rVal <<= bValue;\n    return sal_True;\n}\n\nsal_Bool SfxScriptOrganizerItem::PutValue( const com::sun::star::uno::Any& rVal, BYTE nMemberId )\n{\n    ::rtl::OUString aValue;\n    sal_Bool bRet = sal_False;\n    nMemberId &= ~CONVERT_TWIPS;\n    switch ( nMemberId )\n    {\n        case 0:\n        case MID_SCRIPT_ORGANIZER_LANGUAGE:\n            bRet = (rVal >>= aValue);\n            if ( bRet )\n                aLanguage = aValue;\n            break;\n        default:\n            DBG_ERROR(\"Wrong MemberId!\");\n            return sal_False;\n    }\n\n    return bRet;\n}\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.7.216); FILE MERGED 2008\/03\/31 13:38:11 rt 1.7.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: sorgitm.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_sfx2.hxx\"\n\n#include <sfx2\/sfxsids.hrc>\n#include \"sorgitm.hxx\"\n\/\/ STATIC DATA -----------------------------------------------------------\n\nTYPEINIT1_AUTOFACTORY(SfxScriptOrganizerItem, SfxStringItem);\n\n\/\/------------------------------------------------------------------------\n\nSfxScriptOrganizerItem::SfxScriptOrganizerItem() :\n\n    SfxStringItem()\n\n{\n}\n\n\/\/------------------------------------------------------------------------\n\nSfxScriptOrganizerItem::SfxScriptOrganizerItem( const String& rLanguage ) :\n\n     SfxStringItem( SID_SCRIPTORGANIZER, rLanguage ),\n\n     aLanguage( rLanguage )\n\n{\n}\n\n\/\/------------------------------------------------------------------------\n\nSfxScriptOrganizerItem::SfxScriptOrganizerItem( const SfxScriptOrganizerItem& rItem ) :\n\n    SfxStringItem( rItem ),\n\n    aLanguage( rItem.aLanguage )\n\n{\n}\n\n\/\/------------------------------------------------------------------------\n\nSfxScriptOrganizerItem::~SfxScriptOrganizerItem()\n{\n}\n\n\/\/------------------------------------------------------------------------\n\nSfxPoolItem* SfxScriptOrganizerItem::Clone( SfxItemPool * ) const\n{\n    return new SfxScriptOrganizerItem( *this );\n}\n\n\/\/------------------------------------------------------------------------\n\nint SfxScriptOrganizerItem::operator==( const SfxPoolItem& rItem) const\n{\n     return rItem.Type() == Type() &&\n         SfxStringItem::operator==(rItem) &&\n         aLanguage == ((const SfxScriptOrganizerItem &)rItem).aLanguage;\n}\n\n\nsal_Bool SfxScriptOrganizerItem::QueryValue( com::sun::star::uno::Any& rVal, BYTE nMemberId ) const\n{\n    String aValue;\n    BOOL bIsString = FALSE;\n    sal_Bool bValue = sal_False;\n    nMemberId &= ~CONVERT_TWIPS;\n    switch ( nMemberId )\n    {\n        case 0:\n        case MID_SCRIPT_ORGANIZER_LANGUAGE:\n            bIsString = TRUE;\n            aValue = aLanguage;\n            break;\n        default:\n            DBG_ERROR(\"Wrong MemberId!\");\n               return sal_False;\n     }\n\n    if ( bIsString )\n        rVal <<= ::rtl::OUString( aValue );\n    else\n        rVal <<= bValue;\n    return sal_True;\n}\n\nsal_Bool SfxScriptOrganizerItem::PutValue( const com::sun::star::uno::Any& rVal, BYTE nMemberId )\n{\n    ::rtl::OUString aValue;\n    sal_Bool bRet = sal_False;\n    nMemberId &= ~CONVERT_TWIPS;\n    switch ( nMemberId )\n    {\n        case 0:\n        case MID_SCRIPT_ORGANIZER_LANGUAGE:\n            bRet = (rVal >>= aValue);\n            if ( bRet )\n                aLanguage = aValue;\n            break;\n        default:\n            DBG_ERROR(\"Wrong MemberId!\");\n            return sal_False;\n    }\n\n    return bRet;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/------------------------------------------------------------------------------\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\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 \"BackendPasses.h\"\n\n#include \"llvm\/Analysis\/InlineCost.h\"\n#include \"llvm\/Analysis\/TargetLibraryInfo.h\"\n#include \"llvm\/Analysis\/TargetTransformInfo.h\"\n#include \"llvm\/IR\/LegacyPassManager.h\"\n#include \"llvm\/IR\/Module.h\"\n#include \"llvm\/IR\/Verifier.h\"\n#include \"llvm\/Target\/TargetMachine.h\"\n#include \"llvm\/Transforms\/IPO.h\"\n#include \"llvm\/Transforms\/IPO\/AlwaysInliner.h\"\n#include \"llvm\/Transforms\/IPO\/Inliner.h\"\n#include \"llvm\/Transforms\/IPO\/PassManagerBuilder.h\"\n#include \"llvm\/Transforms\/Scalar.h\"\n\n\/\/#include \"clang\/Basic\/LangOptions.h\"\n\/\/#include \"clang\/Basic\/TargetOptions.h\"\n#include \"clang\/Frontend\/CodeGenOptions.h\"\n\nusing namespace cling;\nusing namespace clang;\nusing namespace llvm;\nusing namespace llvm::legacy;\n\nnamespace {\n  class KeepLocalGVPass: public ModulePass {\n    static char ID;\n\n    bool runOnGlobal(GlobalValue& GV) {\n      if (GV.isDeclaration())\n        return false; \/\/ no change.\n\n      \/\/ GV is a definition.\n\n      llvm::GlobalValue::LinkageTypes LT = GV.getLinkage();\n      if (!GV.isDiscardableIfUnused(LT))\n        return false;\n\n      if (LT == llvm::GlobalValue::InternalLinkage\n          || LT == llvm::GlobalValue::PrivateLinkage) {\n        GV.setLinkage(llvm::GlobalValue::ExternalLinkage);\n        return true; \/\/ a change!\n      }\n      return false;\n    }\n\n  public:\n    KeepLocalGVPass() : ModulePass(ID) {}\n\n    bool runOnModule(Module &M) override {\n      bool ret = false;\n      for (auto &&F: M)\n        ret |= runOnGlobal(F);\n      for (auto &&G: M.globals())\n        ret |= runOnGlobal(G);\n      return ret;\n    }\n  };\n}\n\nchar KeepLocalGVPass::ID = 0;\n\n\nBackendPasses::~BackendPasses() {\n  \/\/delete m_PMBuilder->Inliner;\n}\n\nvoid BackendPasses::CreatePasses(llvm::Module& M, int OptLevel)\n{\n  \/\/ From BackEndUtil's clang::EmitAssemblyHelper::CreatePasses().\n\n#if 0\n  CodeGenOptions::InliningMethod Inlining = m_CGOpts.getInlining();\n  CodeGenOptions& CGOpts_ = const_cast<CodeGenOptions&>(m_CGOpts);\n  \/\/ DON'T: we will not find our symbols...\n  \/\/CGOpts_.CXXCtorDtorAliases = 1;\n\n  \/\/ Default clang -O2 on Linux 64bit also has the following, but see\n  \/\/ CIFactory.cpp.\n  CGOpts_.DisableFPElim = 0;\n  CGOpts_.DiscardValueNames = 1;\n  CGOpts_.OmitLeafFramePointer = 1;\n  CGOpts_.OptimizationLevel = 2;\n  CGOpts_.RelaxAll = 0;\n  CGOpts_.UnrollLoops = 1;\n  CGOpts_.VectorizeLoop = 1;\n  CGOpts_.VectorizeSLP = 1;\n#endif\n\n#if 0 \/\/ def __GNUC__\n  \/\/ Better inlining is pending https:\/\/bugs.llvm.org\/\/show_bug.cgi?id=19668\n  \/\/ and its consequence https:\/\/sft.its.cern.ch\/jira\/browse\/ROOT-7111\n  \/\/ shown e.g. by roottest\/cling\/stl\/map\/badstringMap\n  if (Inlining > CodeGenOptions::NormalInlining)\n    Inlining = CodeGenOptions::NormalInlining;\n#endif\n\n  \/\/ Handle disabling of LLVM optimization, where we want to preserve the\n  \/\/ internal module before any optimization.\n  if (m_CGOpts.DisableLLVMPasses) {\n    OptLevel = 0;\n    \/\/ Always keep at least ForceInline - NoInlining is deadly for libc++.\n    \/\/ Inlining = CGOpts.NoInlining;\n  }\n\n  llvm::PassManagerBuilder PMBuilder;\n  PMBuilder.OptLevel = OptLevel;\n  PMBuilder.SizeLevel = m_CGOpts.OptimizeSize;\n  PMBuilder.BBVectorize = 0; \/\/ m_CGOpts.VectorizeBB;\n  PMBuilder.SLPVectorize = OptLevel > 1 ? 1 : 0; \/\/ m_CGOpts.VectorizeSLP\n  PMBuilder.LoopVectorize = OptLevel > 1 ? 1 : 0; \/\/ m_CGOpts.VectorizeLoop\n\n  PMBuilder.DisableTailCalls = m_CGOpts.DisableTailCalls;\n  PMBuilder.DisableUnrollLoops = !m_CGOpts.UnrollLoops;\n  PMBuilder.MergeFunctions = m_CGOpts.MergeFunctions;\n  PMBuilder.RerollLoops = m_CGOpts.RerollLoops;\n\n  PMBuilder.LibraryInfo = new TargetLibraryInfoImpl(m_TM.getTargetTriple());\n\n  \/\/ At O0 and O1 we only run the always inliner which is more efficient. At\n  \/\/ higher optimization levels we run the normal inliner.\n  if (m_CGOpts.OptimizationLevel <= 1) {\n    bool InsertLifetimeIntrinsics = m_CGOpts.OptimizationLevel != 0;\n    PMBuilder.Inliner = createAlwaysInlinerLegacyPass(InsertLifetimeIntrinsics);\n  } else {\n    PMBuilder.Inliner = createFunctionInliningPass(m_CGOpts.OptimizationLevel,\n                                                   m_CGOpts.OptimizeSize,\n            (!m_CGOpts.SampleProfileFile.empty() && m_CGOpts.EmitSummaryIndex));\n  }\n\n  \/\/ Set up the per-module pass manager.\n  m_MPM[OptLevel].reset(new legacy::PassManager());\n\n  m_MPM[OptLevel]->add(new KeepLocalGVPass());\n  m_MPM[OptLevel]->add(createTargetTransformInfoWrapperPass(\n                                                   m_TM.getTargetIRAnalysis()));\n\n  m_TM.adjustPassManager(PMBuilder);\n\n  PMBuilder.addExtension(PassManagerBuilder::EP_EarlyAsPossible,\n                         [&](const PassManagerBuilder &,\n                             legacy::PassManagerBase &PM) {\n                              PM.add(createAddDiscriminatorsPass());\n                            });\n\n  \/\/if (!CGOpts.RewriteMapFiles.empty())\n  \/\/  addSymbolRewriterPass(CGOpts, m_MPM);\n\n  PMBuilder.populateModulePassManager(*m_MPM[OptLevel]);\n\n  m_FPM[OptLevel].reset(new legacy::FunctionPassManager(&M));\n  m_FPM[OptLevel]->add(createTargetTransformInfoWrapperPass(\n                                                   m_TM.getTargetIRAnalysis()));\n  if (m_CGOpts.VerifyModule)\n      m_FPM[OptLevel]->add(createVerifierPass());\n  PMBuilder.populateFunctionPassManager(*m_FPM[OptLevel]);\n}\n\nvoid BackendPasses::runOnModule(Module& M, int OptLevel) {\n\n  if (OptLevel < 0)\n    OptLevel = 0;\n  if (OptLevel > 3)\n    OptLevel = 3;\n\n  if (!m_MPM[OptLevel])\n    CreatePasses(M, OptLevel);\n\n  static constexpr std::array<llvm::CodeGenOpt::Level, 4> CGOptLevel {\n    llvm::CodeGenOpt::None,\n    llvm::CodeGenOpt::Less,\n    llvm::CodeGenOpt::Default,\n    llvm::CodeGenOpt::Aggressive\n  };\n  \/\/ TM's OptLevel is used to build orc::SimpleCompiler passes for every Module.\n  m_TM.setOptLevel(CGOptLevel[OptLevel]);\n\n  \/\/ Run the per-function passes on the module.\n  m_FPM[OptLevel]->doInitialization();\n  for (auto&& I: M.functions())\n    if (!I.isDeclaration())\n      m_FPM[OptLevel]->run(I);\n  m_FPM[OptLevel]->doFinalization();\n\n  m_MPM[OptLevel]->run(M);\n}\n<commit_msg>Fix clang warning \"suggest braces around init of subobject\".<commit_after>\/\/------------------------------------------------------------------------------\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\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 \"BackendPasses.h\"\n\n#include \"llvm\/Analysis\/InlineCost.h\"\n#include \"llvm\/Analysis\/TargetLibraryInfo.h\"\n#include \"llvm\/Analysis\/TargetTransformInfo.h\"\n#include \"llvm\/IR\/LegacyPassManager.h\"\n#include \"llvm\/IR\/Module.h\"\n#include \"llvm\/IR\/Verifier.h\"\n#include \"llvm\/Target\/TargetMachine.h\"\n#include \"llvm\/Transforms\/IPO.h\"\n#include \"llvm\/Transforms\/IPO\/AlwaysInliner.h\"\n#include \"llvm\/Transforms\/IPO\/Inliner.h\"\n#include \"llvm\/Transforms\/IPO\/PassManagerBuilder.h\"\n#include \"llvm\/Transforms\/Scalar.h\"\n\n\/\/#include \"clang\/Basic\/LangOptions.h\"\n\/\/#include \"clang\/Basic\/TargetOptions.h\"\n#include \"clang\/Frontend\/CodeGenOptions.h\"\n\nusing namespace cling;\nusing namespace clang;\nusing namespace llvm;\nusing namespace llvm::legacy;\n\nnamespace {\n  class KeepLocalGVPass: public ModulePass {\n    static char ID;\n\n    bool runOnGlobal(GlobalValue& GV) {\n      if (GV.isDeclaration())\n        return false; \/\/ no change.\n\n      \/\/ GV is a definition.\n\n      llvm::GlobalValue::LinkageTypes LT = GV.getLinkage();\n      if (!GV.isDiscardableIfUnused(LT))\n        return false;\n\n      if (LT == llvm::GlobalValue::InternalLinkage\n          || LT == llvm::GlobalValue::PrivateLinkage) {\n        GV.setLinkage(llvm::GlobalValue::ExternalLinkage);\n        return true; \/\/ a change!\n      }\n      return false;\n    }\n\n  public:\n    KeepLocalGVPass() : ModulePass(ID) {}\n\n    bool runOnModule(Module &M) override {\n      bool ret = false;\n      for (auto &&F: M)\n        ret |= runOnGlobal(F);\n      for (auto &&G: M.globals())\n        ret |= runOnGlobal(G);\n      return ret;\n    }\n  };\n}\n\nchar KeepLocalGVPass::ID = 0;\n\n\nBackendPasses::~BackendPasses() {\n  \/\/delete m_PMBuilder->Inliner;\n}\n\nvoid BackendPasses::CreatePasses(llvm::Module& M, int OptLevel)\n{\n  \/\/ From BackEndUtil's clang::EmitAssemblyHelper::CreatePasses().\n\n#if 0\n  CodeGenOptions::InliningMethod Inlining = m_CGOpts.getInlining();\n  CodeGenOptions& CGOpts_ = const_cast<CodeGenOptions&>(m_CGOpts);\n  \/\/ DON'T: we will not find our symbols...\n  \/\/CGOpts_.CXXCtorDtorAliases = 1;\n\n  \/\/ Default clang -O2 on Linux 64bit also has the following, but see\n  \/\/ CIFactory.cpp.\n  CGOpts_.DisableFPElim = 0;\n  CGOpts_.DiscardValueNames = 1;\n  CGOpts_.OmitLeafFramePointer = 1;\n  CGOpts_.OptimizationLevel = 2;\n  CGOpts_.RelaxAll = 0;\n  CGOpts_.UnrollLoops = 1;\n  CGOpts_.VectorizeLoop = 1;\n  CGOpts_.VectorizeSLP = 1;\n#endif\n\n#if 0 \/\/ def __GNUC__\n  \/\/ Better inlining is pending https:\/\/bugs.llvm.org\/\/show_bug.cgi?id=19668\n  \/\/ and its consequence https:\/\/sft.its.cern.ch\/jira\/browse\/ROOT-7111\n  \/\/ shown e.g. by roottest\/cling\/stl\/map\/badstringMap\n  if (Inlining > CodeGenOptions::NormalInlining)\n    Inlining = CodeGenOptions::NormalInlining;\n#endif\n\n  \/\/ Handle disabling of LLVM optimization, where we want to preserve the\n  \/\/ internal module before any optimization.\n  if (m_CGOpts.DisableLLVMPasses) {\n    OptLevel = 0;\n    \/\/ Always keep at least ForceInline - NoInlining is deadly for libc++.\n    \/\/ Inlining = CGOpts.NoInlining;\n  }\n\n  llvm::PassManagerBuilder PMBuilder;\n  PMBuilder.OptLevel = OptLevel;\n  PMBuilder.SizeLevel = m_CGOpts.OptimizeSize;\n  PMBuilder.BBVectorize = 0; \/\/ m_CGOpts.VectorizeBB;\n  PMBuilder.SLPVectorize = OptLevel > 1 ? 1 : 0; \/\/ m_CGOpts.VectorizeSLP\n  PMBuilder.LoopVectorize = OptLevel > 1 ? 1 : 0; \/\/ m_CGOpts.VectorizeLoop\n\n  PMBuilder.DisableTailCalls = m_CGOpts.DisableTailCalls;\n  PMBuilder.DisableUnrollLoops = !m_CGOpts.UnrollLoops;\n  PMBuilder.MergeFunctions = m_CGOpts.MergeFunctions;\n  PMBuilder.RerollLoops = m_CGOpts.RerollLoops;\n\n  PMBuilder.LibraryInfo = new TargetLibraryInfoImpl(m_TM.getTargetTriple());\n\n  \/\/ At O0 and O1 we only run the always inliner which is more efficient. At\n  \/\/ higher optimization levels we run the normal inliner.\n  if (m_CGOpts.OptimizationLevel <= 1) {\n    bool InsertLifetimeIntrinsics = m_CGOpts.OptimizationLevel != 0;\n    PMBuilder.Inliner = createAlwaysInlinerLegacyPass(InsertLifetimeIntrinsics);\n  } else {\n    PMBuilder.Inliner = createFunctionInliningPass(m_CGOpts.OptimizationLevel,\n                                                   m_CGOpts.OptimizeSize,\n            (!m_CGOpts.SampleProfileFile.empty() && m_CGOpts.EmitSummaryIndex));\n  }\n\n  \/\/ Set up the per-module pass manager.\n  m_MPM[OptLevel].reset(new legacy::PassManager());\n\n  m_MPM[OptLevel]->add(new KeepLocalGVPass());\n  m_MPM[OptLevel]->add(createTargetTransformInfoWrapperPass(\n                                                   m_TM.getTargetIRAnalysis()));\n\n  m_TM.adjustPassManager(PMBuilder);\n\n  PMBuilder.addExtension(PassManagerBuilder::EP_EarlyAsPossible,\n                         [&](const PassManagerBuilder &,\n                             legacy::PassManagerBase &PM) {\n                              PM.add(createAddDiscriminatorsPass());\n                            });\n\n  \/\/if (!CGOpts.RewriteMapFiles.empty())\n  \/\/  addSymbolRewriterPass(CGOpts, m_MPM);\n\n  PMBuilder.populateModulePassManager(*m_MPM[OptLevel]);\n\n  m_FPM[OptLevel].reset(new legacy::FunctionPassManager(&M));\n  m_FPM[OptLevel]->add(createTargetTransformInfoWrapperPass(\n                                                   m_TM.getTargetIRAnalysis()));\n  if (m_CGOpts.VerifyModule)\n      m_FPM[OptLevel]->add(createVerifierPass());\n  PMBuilder.populateFunctionPassManager(*m_FPM[OptLevel]);\n}\n\nvoid BackendPasses::runOnModule(Module& M, int OptLevel) {\n\n  if (OptLevel < 0)\n    OptLevel = 0;\n  if (OptLevel > 3)\n    OptLevel = 3;\n\n  if (!m_MPM[OptLevel])\n    CreatePasses(M, OptLevel);\n\n  static constexpr std::array<llvm::CodeGenOpt::Level, 4> CGOptLevel {{\n    llvm::CodeGenOpt::None,\n    llvm::CodeGenOpt::Less,\n    llvm::CodeGenOpt::Default,\n    llvm::CodeGenOpt::Aggressive\n  }};\n  \/\/ TM's OptLevel is used to build orc::SimpleCompiler passes for every Module.\n  m_TM.setOptLevel(CGOptLevel[OptLevel]);\n\n  \/\/ Run the per-function passes on the module.\n  m_FPM[OptLevel]->doInitialization();\n  for (auto&& I: M.functions())\n    if (!I.isDeclaration())\n      m_FPM[OptLevel]->run(I);\n  m_FPM[OptLevel]->doFinalization();\n\n  m_MPM[OptLevel]->run(M);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"additional.h\"\n\n#include \"BN.h\"\n#include \"BNsign.h\"\n\n#include <algorithm>\n#include <cstdio>\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nbt2s Abs(bt2s x) {\n    return x<0?-x:x;\n}\n\nBN gcdEuclidean(BN a,BN b)\n{\n    while(!b.is0()) {\n        a = a % b;\n        a.swap(b);\n    }\n    return a;\n}\n\nBN gcdInverseEuclidean(BN a, BN mod)\n{\n    BN start_mod = mod;\n    a = a % mod;\n    BN bn_1 = 1;\n    BN bn_0 = 0;\n\n    if(a.is0())\n        return bn_0;\n\n    BNsign x0;\n    BNsign x1 = bn_0;\n    BNsign x2 = bn_1;\n    while (true) {\n        BN Div;\n        BN Mod;\n        mod.divmod(a, Div, Mod);\n        if (Mod.is0())\n            break;\n        x0 = move(x1);\n        x1 = move(x2);\n\n        x2 = x0 - x1 * (BNsign)Div;\n\n        mod = move(a);\n        a = move(Mod);\n    }\n\n    if(a != bn_1)\n        return bn_0;\n    if(x2.value.is0())\n        x2.sign = false;\n    if(!x2.sign)\n        return x2.value;\n    else\n        return start_mod - x2.value;\n}\n\nBN gcdBinary(BN a,BN b)\n{\n    if(a.is0())\n        return b;\n\n    if(b.is0())\n        return a;\n\n    int acount = a.countzeroright();\n    int bcount = b.countzeroright();\n\n    a = a >> acount;\n    b = b >> bcount;\n\n    \/\/ TODO why swap(a, b) is faster than a.swap(b) ?\n    if(a < b)\n        swap(a, b);\n\n    while(!a.is0()) {\n        if(a >= b) {\n            a.subappr(b);\n            a = a >> a.countzeroright();\n        } else {\n            b.subappr(a);\n            b = b >> b.countzeroright();\n        }\n    }\n    return b << min(acount,bcount);\n}\n\nBN gcdExtendedEuclideanBinary(BN xx, BN yy)\n{\n    BN bn_1(1);\n    BN bn_0(1,0);\n    BN g=bn_1;\n    int xcount=xx.countzeroright();\n    int ycount=yy.countzeroright();\n    g=g<<min(xcount,ycount);\n    xx=xx>>min(xcount,ycount);\n    yy=yy>>min(xcount,ycount);\n\n    BN u=xx;\n    BN v=yy;\n    BNsign x=xx;\n    BNsign y=yy;\n\n    BNsign a=bn_1;\n    BNsign b=bn_0;\n    BNsign c=bn_0;\n    BNsign d=bn_1;\n\n    do {\n        while(u.isEven())\n        {\n            u=u>>1;\n            if(a.value.isEven() && b.value.isEven()) {\n                a.value=a.value>>1;\n                b.value=b.value>>1;\n            } else {\n                a=(a+y);\n                a.value=a.value>>1;\n                b=(b-x);\n                b.value=b.value>>1;\n            }\n        }\n        while(v.isEven())\n        {\n            v=v>>1;\n            if(c.value.isEven()&&d.value.isEven()) {\n                c.value=c.value>>1;\n                d.value=d.value>>1;\n            } else {\n                c=(c+y);\n                c.value=c.value>>1;\n                d=(d-x);\n                d.value=d.value>>1;\n            }\n        }\n        if(u>=v) {\n            u=u-v;\n            a=a-c;\n            b=b-d;\n        } else {\n            v=v-u;\n            c=c-a;\n            d=d-b;\n        }\n    }\n    while(!u.is0());\n    \/\/u.is0() == true;\n    BNsign A=c;\n    BNsign B=d;\n    A.PrintSign();\n    B.PrintSign();\n    (g*v).PrintDec();\n    return g*v;\n    \/\/ A*x + B*y == v\n}\n\nBN gcdInverseEuclideanBinary(BN xx, BN mod)\n{\n    BN bn_1(1);\n    BN bn_0(1,0);\n    if(mod.is0())\n        return bn_0;\n\/\/    if(mod.is0()||gcdEuclidean(xx,mod)!=bn_1)\n\/\/        return bn_0;\n\n    BN g=bn_1;\n    int xcount=xx.countzeroright();\n    int ycount=mod.countzeroright();\n    if(min(xcount,ycount))\n        return bn_0;\n    \/\/min(xcount,ycount) = 0!\n\/\/    g=g<<min(xcount,ycount);\n\/\/    xx=xx>>min(xcount,ycount);\n\/\/    mod=mod>>min(xcount,ycount);\n\n    BN u=xx;\n    BN v=mod;\n    BNsign x=xx;\n    BNsign y=mod;\n\n    BNsign a=bn_1;\n    BNsign b=bn_0;\n    BNsign c=bn_0;\n    BNsign d=bn_1;\n    if(mod.isEven())\n        do\n        {\n            int ucount=u.countzeroright();\n            u=u>>ucount;\n            while(ucount)\n            {\n                int abcount=min(a.value.countzeroright(),b.value.countzeroright());\n                if(abcount>ucount)\n                {\n                    a.value=a.value>>ucount;\n                    b.value=b.value>>ucount;\n                    ucount=0;\n                }\n                else if(abcount)\n                {\n                    a.value=a.value>>abcount;\n                    b.value=b.value>>abcount;\n                    ucount-=abcount;\n                }\n                else\n                {\n                    a=(a+y);\n                    a.value=a.value>>1;\n                    b=(b-x);\n                    b.value=b.value>>1;\n                    ucount--;\n                }\n            }\n            int vcount=v.countzeroright();\n            v=v>>vcount;\n            while(vcount)\n            {\n                int cdcount=min(c.value.countzeroright(),d.value.countzeroright());\n                if(cdcount>vcount) {\n                    c.value=c.value>>vcount;\n                    d.value=d.value>>vcount;\n                    vcount=0;\n                } else if(cdcount) {\n                    c.value=c.value>>cdcount;\n                    d.value=d.value>>cdcount;\n                    vcount-=cdcount;\n                } else {\n                    c=(c+y);\n                    c.value=c.value>>1;\n                    d=(d-x);\n                    d.value=d.value>>1;\n                    vcount--;\n                }\n            }\n            if(u>=v) {\n                u=u-v;\n                a=a-c;\n                b=b-d;\n            } else {\n                v=v-u;\n                c=c-a;\n                d=d-b;\n            }\n        }\n        while(!u.is0());\n    else\n        do\n        {\n            int ucount=u.countzeroright();\n            u=u>>ucount;\n            while(ucount)\n            {\n                int acount = a.value.countzeroright();\n                if(acount) {\n                    a.value=a.value>>min(acount,ucount);\n                    ucount-=min(acount,ucount);\n                } else {\n                    a=(a+y);\n                    a.value=a.value>>1;\n                    ucount--;\n                }\n            }\n            int vcount=v.countzeroright();\n            v=v>>vcount;\n            while(vcount) {\n                int ccount = c.value.countzeroright();\n                if(ccount) {\n                    c.value=c.value>>min(ccount,vcount);\n                    vcount-=min(ccount,vcount);\n                } else {\n                    c=(c+y);\n                    c.value=c.value>>1;\n                    vcount--;\n                }\n            }\n            if(u>=v) {\n                u=u-v;\n                a=a-c;\n            } else {\n                v=v-u;\n                c=c-a;\n            }\n        }\n        while(!u.is0());\n\n    if(v!=bn_1)\n        return bn_0;\n\n    if(c.value.is0())\n        c.sign=false;\n    if(c.sign)\n        return mod-(c.value)%mod;\n    else\n        return c.value%mod;\n}\n\nvector <BN> multi_inverse(const vector <BN> &x, const BN &mod)\n{\n    int count=x.size();\n    vector <BN> a;\n    vector <BN> x_inverse;\n\n    a.reserve(count);\n    x_inverse.reserve(count);\n\n    a.push_back(x[0]);\n\n    for(    vector<BN>::const_iterator xi=x.begin()+1;\n        xi!=x.end();\n        xi++)\n        a.push_back(a.back() * (*xi) % mod);\n\n    BN curr = gcdInverseEuclideanBinary(a[0],mod);\n    for(int i=x.size()-1;i>0;i--)\n    {\n        x_inverse.push_back(a[i-1] * curr % mod);    \/\/index = i\n        curr = x[i] * curr % mod;\n        \/\/x_inverse.push_back( (a[i-1] * curr).reduction_special(mod));\n        \/\/curr = (x[i] * curr).reduction_special(mod);\n    }\n    x_inverse.push_back(curr);                \/\/index = 0\n    reverse(x_inverse.begin(),x_inverse.end());\n    return x_inverse;\n}\n\n\/\/#define DEBUG_LEHMER\nBN gcdLehmer(BN x,BN y)\n{\n    if(x<y)\n        x.swap(y);\n\n    while(y.digitCount()>1)\n    {\n        bt2s xp = x[x.digitCount()-1];\n        bt2s yp = y[y.digitCount()-1];\n        bt2s A = 1;\n        bt2s B = 0;\n        bt2s C = 0;\n        bt2s D = 1;\n        if(x.digitCount()==y.digitCount())\n            while( (yp+C)!=0 && (yp+D)!=0 )\n            {\n                bt2s q = (xp+A)\/(yp+C);\n                bt2s qp= (xp+B)\/(yp+D);\n                if(q!=qp)\n                    break;\n                bt2s t;\n                t = A - q*C;    A = C;    C = t;\n                t = B - q*D;    B = D;    D = t;\n                t = xp- q*yp;    xp= yp;    yp= t;\n            }\n        if(B == 0) {\n            x = x % y;\n            x.swap(y);\n        } else {\n            BN T = (B<0 ? x.mulbase(Abs(A)) - y.mulbase(Abs(B)) : y.mulbase(Abs(B)) - x.mulbase(Abs(A)));\n            BN U = (D<0 ? x.mulbase(Abs(C)) - y.mulbase(Abs(D)) : y.mulbase(Abs(D)) - x.mulbase(Abs(C)));\n            x=T;\n            y=U;\n        }\n    }\n    return gcdBinary(x,y);\n}\n\nBN Garner(const std::vector <BN>& m, const std::vector <BN>& v)\n{\n    if(m.size()!=v.size())\n        throw \"Garner: size's M and V are different!\";\n    int t = m.size();\n    vector<BN> C(t);\n    BN u;\n    for(int i=1;i<t;i++)\n    {\n        C[i] = 1;\n        for(int j=0; j<i; j++)\n        {\n            u = gcdInverseEuclideanBinary(m[j],m[i]);\n            C[i] = u * C[i] % m[i];\n        }\n    }\n    u = v[0];\n    BN x = u;\n    BN Pm=1;\n    for(int i=1;i<t;i++)\n    {\n        BN xmi = x%m[i];\n        BN vix = (v[i] >= xmi ? v[i] - xmi : m[i] + v[i] - xmi);\n        \/\/u = (v[i] - x) * C[i] % m[i];\n        u = vix * C[i] % m[i];\n        Pm = Pm * m[i-1];\n        x = x + u * Pm;\n    }\n    return x;\n}\n\nBN CTO(const std::vector <BN>& m, const std::vector <BN>& v)\n{\n    if(m.size()!=v.size())\n        throw \"CTO: size's M and V are different!\";\n\n    int t = m.size();\n    BN M = m[0];\n    for (int i=1;i<t;i++)\n        M = M * m[i];\n    BN x(1,0);\n    for (int i=0;i<t;i++)\n    {\n        BN Mi = M\/m[i];\n        x = x + v[i] * (M\/m[i]) * gcdInverseEuclideanBinary(M\/m[i],m[i]) % M;\n    }\n    return x%M;\n}\n<commit_msg>Fixed inversion by mod, if it is 1.<commit_after>#include \"additional.h\"\n\n#include \"BN.h\"\n#include \"BNsign.h\"\n\n#include <algorithm>\n#include <cstdio>\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nbt2s Abs(bt2s x) {\n    return x<0?-x:x;\n}\n\nBN gcdEuclidean(BN a,BN b)\n{\n    while(!b.is0()) {\n        a = a % b;\n        a.swap(b);\n    }\n    return a;\n}\n\nBN gcdInverseEuclidean(BN a, BN mod)\n{\n    BN start_mod = mod;\n    a = a % mod;\n    BN bn_1 = 1;\n    BN bn_0 = 0;\n\n    if(a.is0())\n        return bn_0;\n\n    BNsign x0;\n    BNsign x1 = bn_0;\n    BNsign x2 = bn_1;\n    while (true) {\n        BN Div;\n        BN Mod;\n        mod.divmod(a, Div, Mod);\n        if (Mod.is0())\n            break;\n        x0 = move(x1);\n        x1 = move(x2);\n\n        x2 = x0 - x1 * (BNsign)Div;\n\n        mod = move(a);\n        a = move(Mod);\n    }\n\n    if(a != bn_1)\n        return bn_0;\n    if(x2.value.is0())\n        x2.sign = false;\n    if(!x2.sign)\n        return x2.value;\n    else\n        return start_mod - x2.value;\n}\n\nBN gcdBinary(BN a,BN b)\n{\n    if(a.is0())\n        return b;\n\n    if(b.is0())\n        return a;\n\n    int acount = a.countzeroright();\n    int bcount = b.countzeroright();\n\n    a = a >> acount;\n    b = b >> bcount;\n\n    \/\/ TODO why swap(a, b) is faster than a.swap(b) ?\n    if(a < b)\n        swap(a, b);\n\n    while(!a.is0()) {\n        if(a >= b) {\n            a.subappr(b);\n            a = a >> a.countzeroright();\n        } else {\n            b.subappr(a);\n            b = b >> b.countzeroright();\n        }\n    }\n    return b << min(acount,bcount);\n}\n\nBN gcdExtendedEuclideanBinary(BN xx, BN yy)\n{\n    BN bn_1(1);\n    BN bn_0(1,0);\n    BN g=bn_1;\n    int xcount=xx.countzeroright();\n    int ycount=yy.countzeroright();\n    g=g<<min(xcount,ycount);\n    xx=xx>>min(xcount,ycount);\n    yy=yy>>min(xcount,ycount);\n\n    BN u=xx;\n    BN v=yy;\n    BNsign x=xx;\n    BNsign y=yy;\n\n    BNsign a=bn_1;\n    BNsign b=bn_0;\n    BNsign c=bn_0;\n    BNsign d=bn_1;\n\n    do {\n        while(u.isEven())\n        {\n            u=u>>1;\n            if(a.value.isEven() && b.value.isEven()) {\n                a.value=a.value>>1;\n                b.value=b.value>>1;\n            } else {\n                a=(a+y);\n                a.value=a.value>>1;\n                b=(b-x);\n                b.value=b.value>>1;\n            }\n        }\n        while(v.isEven())\n        {\n            v=v>>1;\n            if(c.value.isEven()&&d.value.isEven()) {\n                c.value=c.value>>1;\n                d.value=d.value>>1;\n            } else {\n                c=(c+y);\n                c.value=c.value>>1;\n                d=(d-x);\n                d.value=d.value>>1;\n            }\n        }\n        if(u>=v) {\n            u=u-v;\n            a=a-c;\n            b=b-d;\n        } else {\n            v=v-u;\n            c=c-a;\n            d=d-b;\n        }\n    }\n    while(!u.is0());\n    \/\/u.is0() == true;\n    BNsign A=c;\n    BNsign B=d;\n    A.PrintSign();\n    B.PrintSign();\n    (g*v).PrintDec();\n    return g*v;\n    \/\/ A*x + B*y == v\n}\n\nBN gcdInverseEuclideanBinary(BN xx, BN mod)\n{\n    BN bn_1(1);\n    BN bn_0(1,0);\n    if(mod.is0())\n        return bn_0;\n    if (xx == bn_1)\n        return bn_1;\n\n\/\/    if(mod.is0()||gcdEuclidean(xx,mod)!=bn_1)\n\/\/        return bn_0;\n\n    BN g=bn_1;\n    int xcount=xx.countzeroright();\n    int ycount=mod.countzeroright();\n    if(min(xcount,ycount))\n        return bn_0;\n    \/\/min(xcount,ycount) = 0!\n\/\/    g=g<<min(xcount,ycount);\n\/\/    xx=xx>>min(xcount,ycount);\n\/\/    mod=mod>>min(xcount,ycount);\n\n    BN u=xx;\n    BN v=mod;\n    BNsign x=xx;\n    BNsign y=mod;\n\n    BNsign a=bn_1;\n    BNsign b=bn_0;\n    BNsign c=bn_0;\n    BNsign d=bn_1;\n    if(mod.isEven())\n        do\n        {\n            int ucount=u.countzeroright();\n            u=u>>ucount;\n            while(ucount)\n            {\n                int abcount=min(a.value.countzeroright(),b.value.countzeroright());\n                if(abcount>ucount)\n                {\n                    a.value=a.value>>ucount;\n                    b.value=b.value>>ucount;\n                    ucount=0;\n                }\n                else if(abcount)\n                {\n                    a.value=a.value>>abcount;\n                    b.value=b.value>>abcount;\n                    ucount-=abcount;\n                }\n                else\n                {\n                    a=(a+y);\n                    a.value=a.value>>1;\n                    b=(b-x);\n                    b.value=b.value>>1;\n                    ucount--;\n                }\n            }\n            int vcount=v.countzeroright();\n            v=v>>vcount;\n            while(vcount)\n            {\n                int cdcount=min(c.value.countzeroright(),d.value.countzeroright());\n                if(cdcount>vcount) {\n                    c.value=c.value>>vcount;\n                    d.value=d.value>>vcount;\n                    vcount=0;\n                } else if(cdcount) {\n                    c.value=c.value>>cdcount;\n                    d.value=d.value>>cdcount;\n                    vcount-=cdcount;\n                } else {\n                    c=(c+y);\n                    c.value=c.value>>1;\n                    d=(d-x);\n                    d.value=d.value>>1;\n                    vcount--;\n                }\n            }\n            if(u>=v) {\n                u=u-v;\n                a=a-c;\n                b=b-d;\n            } else {\n                v=v-u;\n                c=c-a;\n                d=d-b;\n            }\n        }\n        while(!u.is0());\n    else\n        do\n        {\n            int ucount=u.countzeroright();\n            u=u>>ucount;\n            while(ucount)\n            {\n                int acount = a.value.countzeroright();\n                if(acount) {\n                    a.value=a.value>>min(acount,ucount);\n                    ucount-=min(acount,ucount);\n                } else {\n                    a=(a+y);\n                    a.value=a.value>>1;\n                    ucount--;\n                }\n            }\n            int vcount=v.countzeroright();\n            v=v>>vcount;\n            while(vcount) {\n                int ccount = c.value.countzeroright();\n                if(ccount) {\n                    c.value=c.value>>min(ccount,vcount);\n                    vcount-=min(ccount,vcount);\n                } else {\n                    c=(c+y);\n                    c.value=c.value>>1;\n                    vcount--;\n                }\n            }\n            if(u>=v) {\n                u=u-v;\n                a=a-c;\n            } else {\n                v=v-u;\n                c=c-a;\n            }\n        }\n        while(!u.is0());\n\n    if(v!=bn_1)\n        return bn_0;\n\n    if(c.value.is0())\n        c.sign=false;\n    if(c.sign)\n        return mod-(c.value)%mod;\n    else\n        return c.value%mod;\n}\n\nvector <BN> multi_inverse(const vector <BN> &x, const BN &mod)\n{\n    int count=x.size();\n    vector <BN> a;\n    vector <BN> x_inverse;\n\n    a.reserve(count);\n    x_inverse.reserve(count);\n\n    a.push_back(x[0]);\n\n    for(    vector<BN>::const_iterator xi=x.begin()+1;\n        xi!=x.end();\n        xi++)\n        a.push_back(a.back() * (*xi) % mod);\n\n    BN curr = gcdInverseEuclideanBinary(a[0],mod);\n    for(int i=x.size()-1;i>0;i--)\n    {\n        x_inverse.push_back(a[i-1] * curr % mod);    \/\/index = i\n        curr = x[i] * curr % mod;\n        \/\/x_inverse.push_back( (a[i-1] * curr).reduction_special(mod));\n        \/\/curr = (x[i] * curr).reduction_special(mod);\n    }\n    x_inverse.push_back(curr);                \/\/index = 0\n    reverse(x_inverse.begin(),x_inverse.end());\n    return x_inverse;\n}\n\n\/\/#define DEBUG_LEHMER\nBN gcdLehmer(BN x,BN y)\n{\n    if(x<y)\n        x.swap(y);\n\n    while(y.digitCount()>1)\n    {\n        bt2s xp = x[x.digitCount()-1];\n        bt2s yp = y[y.digitCount()-1];\n        bt2s A = 1;\n        bt2s B = 0;\n        bt2s C = 0;\n        bt2s D = 1;\n        if(x.digitCount()==y.digitCount())\n            while( (yp+C)!=0 && (yp+D)!=0 )\n            {\n                bt2s q = (xp+A)\/(yp+C);\n                bt2s qp= (xp+B)\/(yp+D);\n                if(q!=qp)\n                    break;\n                bt2s t;\n                t = A - q*C;    A = C;    C = t;\n                t = B - q*D;    B = D;    D = t;\n                t = xp- q*yp;    xp= yp;    yp= t;\n            }\n        if(B == 0) {\n            x = x % y;\n            x.swap(y);\n        } else {\n            BN T = (B<0 ? x.mulbase(Abs(A)) - y.mulbase(Abs(B)) : y.mulbase(Abs(B)) - x.mulbase(Abs(A)));\n            BN U = (D<0 ? x.mulbase(Abs(C)) - y.mulbase(Abs(D)) : y.mulbase(Abs(D)) - x.mulbase(Abs(C)));\n            x=T;\n            y=U;\n        }\n    }\n    return gcdBinary(x,y);\n}\n\nBN Garner(const std::vector <BN>& m, const std::vector <BN>& v)\n{\n    if(m.size()!=v.size())\n        throw \"Garner: size's M and V are different!\";\n    int t = m.size();\n    vector<BN> C(t);\n    BN u;\n    for(int i=1;i<t;i++)\n    {\n        C[i] = 1;\n        for(int j=0; j<i; j++)\n        {\n            u = gcdInverseEuclideanBinary(m[j],m[i]);\n            C[i] = u * C[i] % m[i];\n        }\n    }\n    u = v[0];\n    BN x = u;\n    BN Pm=1;\n    for(int i=1;i<t;i++)\n    {\n        BN xmi = x%m[i];\n        BN vix = (v[i] >= xmi ? v[i] - xmi : m[i] + v[i] - xmi);\n        \/\/u = (v[i] - x) * C[i] % m[i];\n        u = vix * C[i] % m[i];\n        Pm = Pm * m[i-1];\n        x = x + u * Pm;\n    }\n    return x;\n}\n\nBN CTO(const std::vector <BN>& m, const std::vector <BN>& v)\n{\n    if(m.size()!=v.size())\n        throw \"CTO: size's M and V are different!\";\n\n    int t = m.size();\n    BN M = m[0];\n    for (int i=1;i<t;i++)\n        M = M * m[i];\n    BN x(1,0);\n    for (int i=0;i<t;i++)\n    {\n        BN Mi = M\/m[i];\n        x = x + v[i] * (M\/m[i]) * gcdInverseEuclideanBinary(M\/m[i],m[i]) % M;\n    }\n    return x%M;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <Script\/NativeScriptApi.h>\n#include \"..\/ScriptObject.h\"\n#include <Actor\/Player.h>\n\nclass ActionSprint3 : public ActionScript\n{\npublic:\n   ActionSprint3() : ActionScript( 3 )\n   {}\n\n   void onCastFinish( Core::Entity::Player& player, Core::Entity::Chara& targetActor ) override\n   {\n      player.returnToHomepoint();\n   }\n};<commit_msg>Failed save...<commit_after>#include <Script\/NativeScriptApi.h>\n#include \"..\/ScriptObject.h\"\n#include <Actor\/Player.h>\n\nclass ActionReturn6 : public ActionScript\n{\npublic:\n   ActionReturn6() : ActionScript( 6 )\n   {}\n\n   void onCastFinish( Core::Entity::Player& player, Core::Entity::Chara& targetActor ) override\n   {\n      player.returnToHomepoint();\n   }\n};<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2009, 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 met:\n\/\/\n\/\/  1. Redistributions of source code must retain the above copyright notice,\n\/\/     this list of conditions and the following disclaimer.\n\/\/  2. Redistributions in binary form must reproduce the above copyright notice,\n\/\/     this list of conditions and the following disclaimer in the documentation\n\/\/     and\/or other materials provided with the distribution.\n\/\/  3. Neither the name of Google Inc. nor the names of its contributors may be\n\/\/     used to endorse or promote products derived from this software without\n\/\/     specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED\n\/\/ WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\n\/\/ MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO\n\/\/ EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/ PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;\n\/\/ OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n\/\/ WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR\n\/\/ OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF\n\/\/ ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n\/\/ This file contains the implementation of the GoogleDocList class.\n\n#include \"kml\/convenience\/google_doc_list.h\"\n\n#include \"kml\/convenience\/atom_util.h\"\n#include \"kml\/convenience\/http_client.h\"\n\nnamespace kmlconvenience {\n\nstatic const char* kServiceName = \"writely\";\n\nstatic const char* kScope = \"http:\/\/docs.google.com\";\n\nstatic const char* kDocListMetaFeedUri = \"\/feeds\/default\/private\/full\";\n\n\/\/ static\nGoogleDocList* GoogleDocList::Create(\n    HttpClient* http_client) {\n  \/\/ The HttpClient must exist.\n  if (!http_client) {\n    return NULL;\n  }\n  GoogleDocList* gs = new GoogleDocList;\n  http_client->AddHeader(\"GData-Version\", \"3.0\");\n  gs->http_client_.reset(http_client);\n  return gs;\n}\n\n\/\/ static\nconst char* GoogleDocList::get_service_name() {\n  return kServiceName;\n}\n\n\/\/ static\nconst char* GoogleDocList::get_metafeed_uri() {\n  return kDocListMetaFeedUri;\n}\n\nstatic string GetScope() {\n#ifdef _WIN32\n  DWORD bufferSize = 65535; \/\/Limit according to http:\/\/msdn.microsoft.com\/en-us\/library\/ms683188.aspx\n  std::wstring buff;\n  buff.resize(bufferSize);\n  bufferSize = GetEnvironmentVariableW(L\"GOOGLE_DOC_LIST_SCOPE\", &buff[0], bufferSize);\n  if (!bufferSize) {\n    \/\/error getting env variable\n    return \"\";\n  }\n  else {\n    buff.resize(bufferSize);\n    size_t s = buff.size();\n    string str(static_cast<int>(s+1), 0);\n    WideCharToMultiByte(CP_ACP, 0, buff.c_str(), static_cast<int>(s), &str[0],\n\t\t\tstatic_cast<int>(s), NULL, NULL);\n    return str.c_str();\n  }\n#else  \n  if (const char* scope = getenv(\"GOOGLE_DOC_LIST_SCOPE\")) {\n    return scope;\n  }\n#endif\n  return kScope;\n}\n\nGoogleDocList::GoogleDocList()\n  : scope_(GetScope()) {\n}\n\n\/\/ Keep POI of scoped_ptr<GoogleHttpClient>'s dtor out of .h\nGoogleDocList::~GoogleDocList() {\n}\n\nbool GoogleDocList::GetMetaFeedXml(string* atom_feed) const {\n  return http_client_->SendRequest(HTTP_GET, scope_ + kDocListMetaFeedUri,\n                                   NULL, NULL, atom_feed);\n}\n\nkmldom::AtomFeedPtr GoogleDocList::GetMetaFeed() const {\n  string meta_feed;\n  if (GetMetaFeedXml(&meta_feed)) {\n    return kmldom::AsAtomFeed(kmldom::ParseAtom(meta_feed, NULL));\n  }\n  return NULL;\n}\n\nbool GoogleDocList::UploadSpreadsheet(const string& spreadsheet,\n                                      const string& mimetype,\n                                      string* atom_entry) {\n  StringPairVector request_headers;\n  HttpClient::PushHeader(\"Content-Type\", mimetype, &request_headers);\n  return http_client_->SendRequest(HTTP_POST, scope_ + kDocListMetaFeedUri,\n                                   &request_headers, &spreadsheet, atom_entry);\n}\n\n\n}  \/\/ end namespace kmlconvenience\n<commit_msg>missing windows.h header<commit_after>\/\/ Copyright 2009, 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 met:\n\/\/\n\/\/  1. Redistributions of source code must retain the above copyright notice,\n\/\/     this list of conditions and the following disclaimer.\n\/\/  2. Redistributions in binary form must reproduce the above copyright notice,\n\/\/     this list of conditions and the following disclaimer in the documentation\n\/\/     and\/or other materials provided with the distribution.\n\/\/  3. Neither the name of Google Inc. nor the names of its contributors may be\n\/\/     used to endorse or promote products derived from this software without\n\/\/     specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED\n\/\/ WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\n\/\/ MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO\n\/\/ EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/ PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;\n\/\/ OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n\/\/ WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR\n\/\/ OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF\n\/\/ ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n\/\/ This file contains the implementation of the GoogleDocList class.\n\n#include \"kml\/convenience\/google_doc_list.h\"\n\n#include \"kml\/convenience\/atom_util.h\"\n#include \"kml\/convenience\/http_client.h\"\n\n#ifdef _WIN32\n#include <windows.h>\n#endif\n\nnamespace kmlconvenience {\n\nstatic const char* kServiceName = \"writely\";\n\nstatic const char* kScope = \"http:\/\/docs.google.com\";\n\nstatic const char* kDocListMetaFeedUri = \"\/feeds\/default\/private\/full\";\n\n\/\/ static\nGoogleDocList* GoogleDocList::Create(\n    HttpClient* http_client) {\n  \/\/ The HttpClient must exist.\n  if (!http_client) {\n    return NULL;\n  }\n  GoogleDocList* gs = new GoogleDocList;\n  http_client->AddHeader(\"GData-Version\", \"3.0\");\n  gs->http_client_.reset(http_client);\n  return gs;\n}\n\n\/\/ static\nconst char* GoogleDocList::get_service_name() {\n  return kServiceName;\n}\n\n\/\/ static\nconst char* GoogleDocList::get_metafeed_uri() {\n  return kDocListMetaFeedUri;\n}\n\nstatic string GetScope() {\n#ifdef _WIN32\n  DWORD bufferSize = 65535; \/\/Limit according to http:\/\/msdn.microsoft.com\/en-us\/library\/ms683188.aspx\n  std::wstring buff;\n  buff.resize(bufferSize);\n  bufferSize = GetEnvironmentVariableW(L\"GOOGLE_DOC_LIST_SCOPE\", &buff[0], bufferSize);\n  if (!bufferSize) {\n    \/\/error getting env variable\n    return \"\";\n  }\n  else {\n    buff.resize(bufferSize);\n    size_t s = buff.size();\n    string str(static_cast<int>(s+1), 0);\n    WideCharToMultiByte(CP_ACP, 0, buff.c_str(), static_cast<int>(s), &str[0],\n\t\t\tstatic_cast<int>(s), NULL, NULL);\n    return str.c_str();\n  }\n#else  \n  if (const char* scope = getenv(\"GOOGLE_DOC_LIST_SCOPE\")) {\n    return scope;\n  }\n#endif\n  return kScope;\n}\n\nGoogleDocList::GoogleDocList()\n  : scope_(GetScope()) {\n}\n\n\/\/ Keep POI of scoped_ptr<GoogleHttpClient>'s dtor out of .h\nGoogleDocList::~GoogleDocList() {\n}\n\nbool GoogleDocList::GetMetaFeedXml(string* atom_feed) const {\n  return http_client_->SendRequest(HTTP_GET, scope_ + kDocListMetaFeedUri,\n                                   NULL, NULL, atom_feed);\n}\n\nkmldom::AtomFeedPtr GoogleDocList::GetMetaFeed() const {\n  string meta_feed;\n  if (GetMetaFeedXml(&meta_feed)) {\n    return kmldom::AsAtomFeed(kmldom::ParseAtom(meta_feed, NULL));\n  }\n  return NULL;\n}\n\nbool GoogleDocList::UploadSpreadsheet(const string& spreadsheet,\n                                      const string& mimetype,\n                                      string* atom_entry) {\n  StringPairVector request_headers;\n  HttpClient::PushHeader(\"Content-Type\", mimetype, &request_headers);\n  return http_client_->SendRequest(HTTP_POST, scope_ + kDocListMetaFeedUri,\n                                   &request_headers, &spreadsheet, atom_entry);\n}\n\n\n}  \/\/ end namespace kmlconvenience\n<|endoftext|>"}
{"text":"<commit_before>\/*\nThis file is part of Bohrium and copyright (c) 2012 the Bohrium\nteam <http:\/\/www.bh107.org>.\n\nBohrium is free software: you can redistribute it and\/or modify\nit under the terms of the GNU Lesser General Public License as\npublished by the Free Software Foundation, either version 3\nof the License, or (at your option) any later version.\n\nBohrium is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\nGNU General Public License for more details.\n\nYou should have received a copy of the\nGNU Lesser General Public License along with Bohrium.\n\nIf not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <string>\n#include <cstring>\n#include <bh.h>\n#include \"bh_fuse.h\"\n#include \"bh_fuse_cache.h\"\n#include <fstream>\n#include <boost\/archive\/text_oarchive.hpp>\n#include <boost\/archive\/text_iarchive.hpp>\n#include <boost\/serialization\/vector.hpp>\n#include <boost\/filesystem.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/version.hpp>\n#include <boost\/algorithm\/string\/predicate.hpp> \/\/For iequals()\n\nusing namespace std;\nusing namespace boost;\nusing namespace boost::filesystem;\n\nnamespace bohrium {\n\n    \/\/Constructor of the InstrHash class\n    InstrHash::InstrHash(BatchHash &batch, const bh_instruction &instr)\n    {\n        BOOST_FOREACH(const bh_view &view, instr.operand)\n        {\n            if(bh_is_constant(&view))\/\/We ignore constants\n                continue;\n\n            \/\/Hash the base array pointer\n            uint64_t base_id;\n            map<const bh_base*, uint64_t>::iterator it = batch.base2id.find(view.base);\n            if(it != batch.base2id.end())\n            {\n                base_id = it->second;\n            }\n            else\n            {\n                base_id = batch.base_id_count++;\n                batch.base2id.insert(make_pair(view.base, base_id));\n            }\n            this->append((char*)&base_id, sizeof(base_id));\n\n            \/\/Hash ndim and start\n            this->append((char*)&view.ndim, sizeof(view.ndim));\n            this->append((char*)&view.start, sizeof(view.start));\n\n            \/\/Hash shape and stride\n            this->append((char*)view.shape, sizeof(bh_index)*view.ndim);\n            this->append((char*)view.stride, sizeof(bh_index)*view.ndim);\n        }\n    }\n\n    \/\/Constructor of the BatchHash class\n    BatchHash::BatchHash(const vector<bh_instruction> &instr_list):base_id_count(0)\n    {\n        string data;\n        BOOST_FOREACH(const bh_instruction &instr, instr_list)\n        {\n            data.append(InstrHash(*this, instr));\n        }\n        boost::hash<string> hasher;\n        _hash = hasher(data);\n    }\n\n    void FuseCache::insert(const BatchHash &batch,\n                           const vector<bh_ir_kernel> &kernel_list)\n    {\n        cache[batch.hash()] = InstrIndexesList(kernel_list, batch.hash(), fuser_name);\n    }\n\n    bool FuseCache::lookup(const BatchHash &batch,\n                           bh_ir &bhir,\n                           vector<bh_ir_kernel> &kernel_list) const\n    {\n\/\/        cout << \"looking up \" << batch.hash() << \": \";\n\n        assert(kernel_list.size() == 0);\n        CacheMap::const_iterator it = cache.find(batch.hash());\n        if(it == cache.end())\n        {\n\/\/            cout << \"cache miss!\" << endl;\n            return false;\n        }\n        else\n        {\n            it->second.fill_kernel_list(bhir, kernel_list);\n\/\/          cout << \"cache hit!\" << endl;\n          return true;\n        }\n    }\n\n    void FuseCache::write_to_files() const\n    {\n        if(dir_path == NULL)\n        {\n            cout << \"[FUSE-CACHE] Couldn't find the 'cache_path' key in \"\\\n            \"the configure file thus no cache files are written to disk!\" << endl;\n            return;\n        }\n        path cache_dir(dir_path);\n        if(create_directories(cache_dir))\n        {\n            cout << \"[FUSE-CACHE] Creating cache diretory \" << cache_dir << endl;\n        #if BOOST_VERSION > 104900\n            permissions(cache_dir, all_all);\n        #endif\n        }\n\n        path tmp_dir = cache_dir \/ unique_path();\n        create_directories(tmp_dir);\n        for(CacheMap::const_iterator it=cache.begin(); it != cache.end(); ++it)\n        {\n            string name;\n            it->second.get_filename(name);\n            path filename = tmp_dir \/ name;\n            ofstream ofs(filename.string());\n            boost::archive::text_oarchive oa(ofs);\n            oa << it->second;\n            ofs.close();\n        #if BOOST_VERSION > 104900\n            permissions(filename, all_all);\n        #endif\n            rename(filename, cache_dir \/ name);\n        }\n        remove(tmp_dir);\n    }\n\n    void FuseCache::load_from_files()\n    {\n        if(dir_path == NULL)\n        {\n            cout << \"[FUSE-CACHE] Couldn't find the 'cache_path' key in \"\\\n            \"the configure file thus no cache files are loaded from disk!\" << endl;\n            return;\n        }\n        path p(dir_path);\n        if(not (exists(p) and is_directory(p)))\n            return;\n\n        string fuse_model_name;\n        fuse_model_text(fuse_get_selected_model(), fuse_model_name);\n\n        \/\/Iterate the 'dir_path' diretory and load each file\n        directory_iterator it(p), eod;\n        BOOST_FOREACH(const path &f, make_pair(it, eod))\n        {\n            if(is_regular_file(f))\n            {\n                ifstream ifs(f.string());\n                boost::archive::text_iarchive ia(ifs);\n                InstrIndexesList t;\n                ia >> t;\n                if(iequals(t.fuser_name(), fuser_name) and\n                   iequals(t.fuse_model(), fuse_model_name))\n                {\n                    cache[t.hash()] = t;\n                }\n                ifs.close();\n            }\n        }\n    }\n} \/\/namespace bohrium\n<commit_msg>fuse-cache: fixed the nfs bug<commit_after>\/*\nThis file is part of Bohrium and copyright (c) 2012 the Bohrium\nteam <http:\/\/www.bh107.org>.\n\nBohrium is free software: you can redistribute it and\/or modify\nit under the terms of the GNU Lesser General Public License as\npublished by the Free Software Foundation, either version 3\nof the License, or (at your option) any later version.\n\nBohrium is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\nGNU General Public License for more details.\n\nYou should have received a copy of the\nGNU Lesser General Public License along with Bohrium.\n\nIf not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <string>\n#include <cstring>\n#include <bh.h>\n#include \"bh_fuse.h\"\n#include \"bh_fuse_cache.h\"\n#include <fstream>\n#include <exception>\n#include <boost\/archive\/text_oarchive.hpp>\n#include <boost\/archive\/text_iarchive.hpp>\n#include <boost\/serialization\/vector.hpp>\n#include <boost\/filesystem.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/version.hpp>\n#include <boost\/algorithm\/string\/predicate.hpp> \/\/For iequals()\n\nusing namespace std;\nusing namespace boost;\nusing namespace boost::filesystem;\n\nnamespace bohrium {\n\n    \/\/Constructor of the InstrHash class\n    InstrHash::InstrHash(BatchHash &batch, const bh_instruction &instr)\n    {\n        BOOST_FOREACH(const bh_view &view, instr.operand)\n        {\n            if(bh_is_constant(&view))\/\/We ignore constants\n                continue;\n\n            \/\/Hash the base array pointer\n            uint64_t base_id;\n            map<const bh_base*, uint64_t>::iterator it = batch.base2id.find(view.base);\n            if(it != batch.base2id.end())\n            {\n                base_id = it->second;\n            }\n            else\n            {\n                base_id = batch.base_id_count++;\n                batch.base2id.insert(make_pair(view.base, base_id));\n            }\n            this->append((char*)&base_id, sizeof(base_id));\n\n            \/\/Hash ndim and start\n            this->append((char*)&view.ndim, sizeof(view.ndim));\n            this->append((char*)&view.start, sizeof(view.start));\n\n            \/\/Hash shape and stride\n            this->append((char*)view.shape, sizeof(bh_index)*view.ndim);\n            this->append((char*)view.stride, sizeof(bh_index)*view.ndim);\n        }\n    }\n\n    \/\/Constructor of the BatchHash class\n    BatchHash::BatchHash(const vector<bh_instruction> &instr_list):base_id_count(0)\n    {\n        string data;\n        BOOST_FOREACH(const bh_instruction &instr, instr_list)\n        {\n            data.append(InstrHash(*this, instr));\n        }\n        boost::hash<string> hasher;\n        _hash = hasher(data);\n    }\n\n    void FuseCache::insert(const BatchHash &batch,\n                           const vector<bh_ir_kernel> &kernel_list)\n    {\n        cache[batch.hash()] = InstrIndexesList(kernel_list, batch.hash(), fuser_name);\n    }\n\n    bool FuseCache::lookup(const BatchHash &batch,\n                           bh_ir &bhir,\n                           vector<bh_ir_kernel> &kernel_list) const\n    {\n\/\/        cout << \"looking up \" << batch.hash() << \": \";\n\n        assert(kernel_list.size() == 0);\n        CacheMap::const_iterator it = cache.find(batch.hash());\n        if(it == cache.end())\n        {\n\/\/            cout << \"cache miss!\" << endl;\n            return false;\n        }\n        else\n        {\n            it->second.fill_kernel_list(bhir, kernel_list);\n\/\/          cout << \"cache hit!\" << endl;\n          return true;\n        }\n    }\n\n    void FuseCache::write_to_files() const\n    {\n        if(dir_path == NULL)\n        {\n            cout << \"[FUSE-CACHE] Couldn't find the 'cache_path' key in \"\\\n            \"the configure file thus no cache files are written to disk!\" << endl;\n            return;\n        }\n        path cache_dir(dir_path);\n        if(create_directories(cache_dir))\n        {\n            cout << \"[FUSE-CACHE] Creating cache diretory \" << cache_dir << endl;\n        #if BOOST_VERSION > 104900\n            permissions(cache_dir, all_all);\n        #endif\n        }\n\n        path tmp_dir = cache_dir \/ unique_path();\n        create_directories(tmp_dir);\n        for(CacheMap::const_iterator it=cache.begin(); it != cache.end(); ++it)\n        {\n            string name;\n            it->second.get_filename(name);\n            path shared_name = cache_dir \/ name;\n\n            if(exists(shared_name))\n                continue;\/\/No need to overwrite an existing file\n\n            path unique_name = tmp_dir \/ name;\n            ofstream ofs(unique_name.string());\n            boost::archive::text_oarchive oa(ofs);\n            oa << it->second;\n            ofs.close();\n        #if BOOST_VERSION > 104900\n            permissions(unique_name, all_all);\n        #endif\n            rename(unique_name, shared_name);\n        }\n        remove(tmp_dir);\n    }\n\n    void FuseCache::load_from_files()\n    {\n        if(dir_path == NULL)\n        {\n            cout << \"[FUSE-CACHE] Couldn't find the 'cache_path' key in \"\\\n            \"the configure file thus no cache files are loaded from disk!\" << endl;\n            return;\n        }\n        path p(dir_path);\n        if(not (exists(p) and is_directory(p)))\n            return;\n\n        string fuse_model_name;\n        fuse_model_text(fuse_get_selected_model(), fuse_model_name);\n\n        \/\/Iterate the 'dir_path' diretory and load each file\n        directory_iterator it(p), eod;\n        BOOST_FOREACH(const path &f, make_pair(it, eod))\n        {\n            if(is_regular_file(f))\n            {\n                int tries = 0;\n                while(1)\n                {\n                    try\n                    {\n                        ifstream ifs(f.string());\n                        boost::archive::text_iarchive ia(ifs);\n                        InstrIndexesList t;\n                        ia >> t;\n                        if(iequals(t.fuser_name(), fuser_name) and\n                           iequals(t.fuse_model(), fuse_model_name))\n                        {\n                            cache[t.hash()] = t;\n                        }\n                    }\n                    catch(const std::exception &e)\n                    {\n                        if(++tries >= 10)\n                        {\n                            cerr << \"[FUSE-CACHE] failed to open file '\" << f.string();\n                            cerr << \"' (\" << tries << \" tries): \" << e.what() << endl;\n                        }\n                        else\n                            continue;\n                    }\n                    break;\n                }\n            }\n        }\n    }\n} \/\/namespace bohrium\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <cstdint>\n#include <iostream>\n#include <pqrs\/osx\/iokit_types.hpp>\n#include <type_safe\/strong_typedef.hpp>\n#include <unordered_set>\n\nnamespace krbn {\nstruct product_id : type_safe::strong_typedef<product_id, uint32_t>,\n                    type_safe::strong_typedef_op::equality_comparison<product_id>,\n                    type_safe::strong_typedef_op::relational_comparison<product_id> {\n  using strong_typedef::strong_typedef;\n};\n\ninline std::ostream& operator<<(std::ostream& stream, const product_id& value) {\n  return stream << type_safe::get(value);\n}\n\ninline product_id make_product_id(const pqrs::osx::iokit_hid_product_id& value) {\n  return product_id(type_safe::get(value));\n}\n} \/\/ namespace krbn\n\nnamespace std {\ntemplate <>\nstruct hash<krbn::product_id> : type_safe::hashable<krbn::product_id> {\n};\n} \/\/ namespace std\n<commit_msg>add product_id_karabiner_virtual_hid_*<commit_after>#pragma once\n\n#include <cstdint>\n#include <iostream>\n#include <pqrs\/osx\/iokit_types.hpp>\n#include <type_safe\/strong_typedef.hpp>\n#include <unordered_set>\n\nnamespace krbn {\nstruct product_id : type_safe::strong_typedef<product_id, uint32_t>,\n                    type_safe::strong_typedef_op::equality_comparison<product_id>,\n                    type_safe::strong_typedef_op::relational_comparison<product_id> {\n  using strong_typedef::strong_typedef;\n};\n\ninline std::ostream& operator<<(std::ostream& stream, const product_id& value) {\n  return stream << type_safe::get(value);\n}\n\ninline product_id make_product_id(const pqrs::osx::iokit_hid_product_id& value) {\n  return product_id(type_safe::get(value));\n}\n\nconstexpr product_id product_id_karabiner_virtual_hid_keyboard(0x27db);\nconstexpr product_id product_id_karabiner_virtual_hid_pointing(0x27da);\n} \/\/ namespace krbn\n\nnamespace std {\ntemplate <>\nstruct hash<krbn::product_id> : type_safe::hashable<krbn::product_id> {\n};\n} \/\/ namespace std\n<|endoftext|>"}
{"text":"<commit_before>\/*\nThis file is part of Bohrium and copyright (c) 2012 the Bohrium\nteam <http:\/\/www.bh107.org>.\n\nBohrium is free software: you can redistribute it and\/or modify\nit under the terms of the GNU Lesser General Public License as\npublished by the Free Software Foundation, either version 3\nof the License, or (at your option) any later version.\n\nBohrium is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\nGNU General Public License for more details.\n\nYou should have received a copy of the\nGNU Lesser General Public License along with Bohrium.\n\nIf not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <string>\n#include <stdexcept>\n#include <boost\/algorithm\/string\/predicate.hpp> \/\/For iequals()\n#include <bh.h>\n#include \"bh_fuse_price.h\"\n\nusing namespace std;\n\nnamespace bohrium {\n\n\/* The default fuse model *\/\nstatic const FusePriceModel default_price_model = UNIQUE_VIEWS;\n\n\/* The current selected fuse model *\/\nstatic FusePriceModel selected_price_model = NUM_OF_PRICE_MODELS;\n\n\n\/************************************************************************\/\n\/*************** Specific fuse model implementations ********************\/\n\/************************************************************************\/\n\n\/* Returns the bytes in a bh_view *\/\ninline static uint64_t bytes_in_view(const bh_view &v)\n{\n    assert (!bh_is_constant(&v));\n    return bh_nelements_nbcast(&v) * bh_type_size(v.base->type);\n}\n\n\/* The cost of a kernel is the sum of unique views read and written *\/\nstatic uint64_t cost_unique(const bh_ir_kernel &k)\n{\n    uint64_t sum = 0;\n    for(const bh_view &v: k.get_input_set())\n    {\n        sum += bytes_in_view(v);\n    }\n    for(const bh_view &v: k.get_output_set())\n    {\n        sum += bytes_in_view(v);\n    }\n    return sum;\n}\nstatic uint64_t savings_unique(const bh_ir_kernel &a, const bh_ir_kernel &b)\n{\n    int64_t price_drop = 0;\n    \/\/Subtract inputs in 'a' that comes from 'b' or is already an input in 'b'\n    for(const bh_view &i: a.get_input_set())\n    {\n        for(const bh_view &o: b.get_output_set())\n        {\n            if(bh_view_aligned(&i, &o))\n                price_drop += bytes_in_view(i);\n        }\n        for(const bh_view &o: b.get_input_set())\n        {\n            if(bh_view_aligned(&i, &o))\n                price_drop += bytes_in_view(i);\n        }\n    }\n    \/\/Subtract outputs from 'b' that are discared in 'a'\n    for(const bh_view &o: b.get_output_set())\n    {\n        for(uint64_t a_instr_idx: a.instr_indexes)\n        {\n            const bh_instruction &a_instr = a.bhir->instr_list[a_instr_idx];\n            if(a_instr.opcode == BH_DISCARD and a_instr.operand[0].base == o.base)\n            {\n                price_drop += bytes_in_view(o);\n                break;\n            }\n        }\n    }\n    return price_drop;\n}\n\n\/* The cost of a kernel is 'number of instruction' * 3 - 'number of temp arrays' *\/\nstatic uint64_t cost_temp_elemination(const bh_ir_kernel &k)\n{\n    return k.instr_indexes.size() * 3 - k.get_temps().size();\n}\nstatic uint64_t savings_temp_elemination(const bh_ir_kernel &k1, const bh_ir_kernel &k2)\n{\n    bh_ir_kernel tmp = k1;\n    for(uint64_t instr_idx: k2.instr_indexes)\n    {\n        tmp.add_instr(instr_idx);\n    }\n    return cost_temp_elemination(k1) + cost_temp_elemination(k1) - cost_temp_elemination(tmp);\n}\n\n\/************************************************************************\/\n\/*************** The public interface implementation ********************\/\n\/************************************************************************\/\n\nFusePriceModel fuse_get_selected_price_model()\n{\n    using namespace boost;\n\n    if(selected_price_model != NUM_OF_PRICE_MODELS)\n        return selected_price_model;\n\n    string default_model;\n    fuse_price_model_text(default_price_model, default_model);\n\n    \/\/Check enviroment variable\n    const char *env = getenv(\"BH_PRICE_MODEL\");\n    if(env != NULL)\n    {\n        string e(env);\n        \/\/Iterate through the 'FusePriceModel' enum and find the enum that matches\n        \/\/the enviroment variable string 'e'\n        for(FusePriceModel m = UNIQUE_VIEWS; m < NUM_OF_PRICE_MODELS; m = FusePriceModel(m + 1))\n        {\n            string model;\n            fuse_price_model_text(m, model);\n            if(iequals(e, model))\n            {\n                cout << \"[FUSE] info: selected price model: '\" << model << \"'\" << endl;\n                return m;\n            }\n        }\n        cerr << \"[FUSE] WARNING: unknown price model: '\" << e;\n        cerr << \"', using the default model '\" << default_model << \"' instead\" << endl;\n        setenv(\"BH_PRICE_MODEL\", default_model.c_str(), 1);\n    }\n    cout << \"[FUSE] info: selected price model: '\" << default_model << \"'\" << endl;\n    return default_price_model;\n}\n\nvoid fuse_price_model_text(FusePriceModel price_model, string &output)\n{\n    switch(price_model)\n    {\n    case UNIQUE_VIEWS:\n        output = \"unique_views\";\n        break;\n    case TEMP_ELEMINATION:\n        output = \"temp_elemination\";\n        break;\n    default:\n        output = \"unknown\";\n    }\n}\n\nuint64_t kernel_cost(const bh_ir_kernel &kernel)\n{\n    switch(selected_price_model)\n    {\n    case NUM_OF_PRICE_MODELS:\n        selected_price_model = fuse_get_selected_price_model();\n        return kernel_cost(kernel);\n    case UNIQUE_VIEWS:\n        return cost_unique(kernel);\n    case TEMP_ELEMINATION:\n        return cost_temp_elemination(kernel);\n    default:\n        throw runtime_error(\"No price module is selected!\");\n    }\n}\n\nuint64_t cost_savings(const bh_ir_kernel &k1, const bh_ir_kernel &k2)\n{\n    switch(selected_price_model)\n    {\n    case NUM_OF_PRICE_MODELS:\n        selected_price_model = fuse_get_selected_price_model();\n        return cost_savings(k1, k2);\n    case UNIQUE_VIEWS:\n        return savings_unique(k1, k2);\n    case TEMP_ELEMINATION:\n        return savings_temp_elemination(k1, k2);\n    default:\n        throw runtime_error(\"No price module is selected!\");\n    }\n}\n\n} \/\/namespace bohrium\n<commit_msg>fuse-price: fixed calculation of savings_temp_elemination<commit_after>\/*\nThis file is part of Bohrium and copyright (c) 2012 the Bohrium\nteam <http:\/\/www.bh107.org>.\n\nBohrium is free software: you can redistribute it and\/or modify\nit under the terms of the GNU Lesser General Public License as\npublished by the Free Software Foundation, either version 3\nof the License, or (at your option) any later version.\n\nBohrium is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\nGNU General Public License for more details.\n\nYou should have received a copy of the\nGNU Lesser General Public License along with Bohrium.\n\nIf not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <string>\n#include <stdexcept>\n#include <boost\/algorithm\/string\/predicate.hpp> \/\/For iequals()\n#include <bh.h>\n#include \"bh_fuse_price.h\"\n\nusing namespace std;\n\nnamespace bohrium {\n\n\/* The default fuse model *\/\nstatic const FusePriceModel default_price_model = UNIQUE_VIEWS;\n\n\/* The current selected fuse model *\/\nstatic FusePriceModel selected_price_model = NUM_OF_PRICE_MODELS;\n\n\n\/************************************************************************\/\n\/*************** Specific fuse model implementations ********************\/\n\/************************************************************************\/\n\n\/* Returns the bytes in a bh_view *\/\ninline static uint64_t bytes_in_view(const bh_view &v)\n{\n    assert (!bh_is_constant(&v));\n    return bh_nelements_nbcast(&v) * bh_type_size(v.base->type);\n}\n\n\/* The cost of a kernel is the sum of unique views read and written *\/\nstatic uint64_t cost_unique(const bh_ir_kernel &k)\n{\n    uint64_t sum = 0;\n    for(const bh_view &v: k.get_input_set())\n    {\n        sum += bytes_in_view(v);\n    }\n    for(const bh_view &v: k.get_output_set())\n    {\n        sum += bytes_in_view(v);\n    }\n    return sum;\n}\nstatic uint64_t savings_unique(const bh_ir_kernel &a, const bh_ir_kernel &b)\n{\n    int64_t price_drop = 0;\n    \/\/Subtract inputs in 'a' that comes from 'b' or is already an input in 'b'\n    for(const bh_view &i: a.get_input_set())\n    {\n        for(const bh_view &o: b.get_output_set())\n        {\n            if(bh_view_aligned(&i, &o))\n                price_drop += bytes_in_view(i);\n        }\n        for(const bh_view &o: b.get_input_set())\n        {\n            if(bh_view_aligned(&i, &o))\n                price_drop += bytes_in_view(i);\n        }\n    }\n    \/\/Subtract outputs from 'b' that are discared in 'a'\n    for(const bh_view &o: b.get_output_set())\n    {\n        for(uint64_t a_instr_idx: a.instr_indexes)\n        {\n            const bh_instruction &a_instr = a.bhir->instr_list[a_instr_idx];\n            if(a_instr.opcode == BH_DISCARD and a_instr.operand[0].base == o.base)\n            {\n                price_drop += bytes_in_view(o);\n                break;\n            }\n        }\n    }\n    return price_drop;\n}\n\n\/* The cost of a kernel is 'number of instruction' * 3 - 'number of temp arrays' *\/\nstatic uint64_t cost_temp_elemination(const bh_ir_kernel &k)\n{\n    return k.instr_indexes.size() * 3 - k.get_temps().size();\n}\nstatic uint64_t savings_temp_elemination(const bh_ir_kernel &k1, const bh_ir_kernel &k2)\n{\n    bh_ir_kernel tmp = k1;\n    for(uint64_t instr_idx: k2.instr_indexes)\n    {\n        tmp.add_instr(instr_idx);\n    }\n    uint64_t old_cost = cost_temp_elemination(k1) + cost_temp_elemination(k2);\n    uint64_t new_cost = cost_temp_elemination(tmp);\n    assert(old_cost >= new_cost);\n    return old_cost - new_cost;\n}\n\n\/************************************************************************\/\n\/*************** The public interface implementation ********************\/\n\/************************************************************************\/\n\nFusePriceModel fuse_get_selected_price_model()\n{\n    using namespace boost;\n\n    if(selected_price_model != NUM_OF_PRICE_MODELS)\n        return selected_price_model;\n\n    string default_model;\n    fuse_price_model_text(default_price_model, default_model);\n\n    \/\/Check enviroment variable\n    const char *env = getenv(\"BH_PRICE_MODEL\");\n    if(env != NULL)\n    {\n        string e(env);\n        \/\/Iterate through the 'FusePriceModel' enum and find the enum that matches\n        \/\/the enviroment variable string 'e'\n        for(FusePriceModel m = UNIQUE_VIEWS; m < NUM_OF_PRICE_MODELS; m = FusePriceModel(m + 1))\n        {\n            string model;\n            fuse_price_model_text(m, model);\n            if(iequals(e, model))\n            {\n                cout << \"[FUSE] info: selected price model: '\" << model << \"'\" << endl;\n                return m;\n            }\n        }\n        cerr << \"[FUSE] WARNING: unknown price model: '\" << e;\n        cerr << \"', using the default model '\" << default_model << \"' instead\" << endl;\n        setenv(\"BH_PRICE_MODEL\", default_model.c_str(), 1);\n    }\n    cout << \"[FUSE] info: selected price model: '\" << default_model << \"'\" << endl;\n    return default_price_model;\n}\n\nvoid fuse_price_model_text(FusePriceModel price_model, string &output)\n{\n    switch(price_model)\n    {\n    case UNIQUE_VIEWS:\n        output = \"unique_views\";\n        break;\n    case TEMP_ELEMINATION:\n        output = \"temp_elemination\";\n        break;\n    default:\n        output = \"unknown\";\n    }\n}\n\nuint64_t kernel_cost(const bh_ir_kernel &kernel)\n{\n    switch(selected_price_model)\n    {\n    case NUM_OF_PRICE_MODELS:\n        selected_price_model = fuse_get_selected_price_model();\n        return kernel_cost(kernel);\n    case UNIQUE_VIEWS:\n        return cost_unique(kernel);\n    case TEMP_ELEMINATION:\n        return cost_temp_elemination(kernel);\n    default:\n        throw runtime_error(\"No price module is selected!\");\n    }\n}\n\nuint64_t cost_savings(const bh_ir_kernel &k1, const bh_ir_kernel &k2)\n{\n    switch(selected_price_model)\n    {\n    case NUM_OF_PRICE_MODELS:\n        selected_price_model = fuse_get_selected_price_model();\n        return cost_savings(k1, k2);\n    case UNIQUE_VIEWS:\n        return savings_unique(k1, k2);\n    case TEMP_ELEMINATION:\n        return savings_temp_elemination(k1, k2);\n    default:\n        throw runtime_error(\"No price module is selected!\");\n    }\n}\n\n} \/\/namespace bohrium\n<|endoftext|>"}
{"text":"<commit_before>#include \"rtkTest.h\"\n#include \"rtkMacro.h\"\n#include \"rtkLUTbasedVariableI0RawToAttImageFilter.h\"\n#include <itkTimeProbe.h>\n#include <itkImageRegionIterator.h>\n\n\/**\n * \\file rtklutbasedvarI0rawtoatttest.cxx\n *\n * \\brief Test rtk::LUTbasedVariableI0RawToAttImageFilter\n *\n * \\author Sebastien Brousmiche\n *\/\n\ntypedef itk::Image<unsigned short, 2> ShortImageType;\ntypedef itk::Image<float, 2> FloatImageType;\n\nvoid fillImageWithRawData(ShortImageType::Pointer image, unsigned short imageId)\n{\n  itk::ImageRegionIterator<ShortImageType> it(image, image->GetLargestPossibleRegion());\n  it.GoToBegin();\n  while (!it.IsAtEnd()){\n    it.Set(imageId);\n  }\n}\n\nint main(int, char** )\n{\n  itk::TimeProbe clock;\n\n  typedef rtk::LUTbasedVariableI0RawToAttImageFilter ConvertFilterType;\n  ConvertFilterType::Pointer convert = ConvertFilterType::New();\n  \n  \/\/ Constant image sources\n  ShortImageType::SizeType size;\n  size[0] = 2;\n  size[1] = 2;\n  size[2] = 1;\n  ShortImageType::IndexType start;\n  start.Fill(0);\n  ShortImageType::RegionType region;\n  region.SetIndex(start);\n  region.SetSize(size);\n  ShortImageType::SpacingType spacings;\n  spacings[0] = 1.0;\n  spacings[1] = 1.0;\n  spacings[2] = 1.0;\n\n  ShortImageType::Pointer rawImage = ShortImageType::New();\n  rawImage->SetRegions(region);\n  rawImage->SetSpacing(spacings);\n  rawImage->Allocate();\n\n  convert->SetInput(rawImage);\n\n  for (unsigned short i = 0; i < 10; ++i)  \n  {\n    fillImageWithRawData(rawImage, i);\n\n    convert->SetI0(i);\n\n    clock.Start();\n\n    convert->Update();\n\n    clock.Stop();\n  }\n\n  \/\/ If all succeed\n  std::cout << \"\\n\\nTest PASSED! \" << std::endl;\n\n  return EXIT_SUCCESS;\n}\n<commit_msg>update imagx lut test<commit_after>#include \"rtkTest.h\"\n#include \"rtkMacro.h\"\n#include \"rtkLUTbasedVariableI0RawToAttImageFilter.h\"\n#include <itkTimeProbe.h>\n#include <itkImageRegionIterator.h>\n\n\/**\n * \\file rtklutbasedvarI0rawtoatttest.cxx\n *\n * \\brief Test rtk::LUTbasedVariableI0RawToAttImageFilter\n *\n * \\author Sebastien Brousmiche\n *\/\n\ntypedef itk::Image<unsigned short, 2> ShortImageType;\ntypedef itk::Image<float, 2> FloatImageType;\n\nvoid fillImageWithRawData(ShortImageType::Pointer image, unsigned short I0)\n{\n  itk::ImageRegionIterator<itk::Image<unsigned short, 2>> it(image, image->GetLargestPossibleRegion());\n  it.GoToBegin();\n  unsigned short i = 0;\n  while (!it.IsAtEnd()){\n    unsigned short I = (i%I0)+1;\n    it.Set(I);\n    ++it;\n    ++i;\n  }\n}\n\nint main(int, char** )\n{\n  itk::TimeProbe clock;\n  \n  typedef rtk::LUTbasedVariableI0RawToAttImageFilter ConvertFilterType;\n  ConvertFilterType::Pointer convert = ConvertFilterType::New();\n  \n  \/\/ Constant image sources\n  ShortImageType::SizeType size;\n  size[0] = 10;\n  size[1] = 10;\n  ShortImageType::IndexType start;\n  start.Fill(0);\n  ShortImageType::RegionType region;\n  region.SetIndex(start);\n  region.SetSize(size);\n  ShortImageType::SpacingType spacings;\n  spacings[0] = 1.0;\n  spacings[1] = 1.0;\n  \n  ShortImageType::Pointer rawImage = ShortImageType::New();\n  rawImage->SetRegions(region);\n  rawImage->SetSpacing(spacings);\n  rawImage->Allocate();\n\n  convert->SetInput(rawImage);\n\n  for (unsigned short i = 0; i < 10; ++i)  \n  {\n    unsigned short I0 = 10 * i + 1;\n\n    fillImageWithRawData(rawImage, I0);\n\n    convert->SetI0(I0\/2);\n\n    clock.Start();\n\n    convert->Update();\n\n    clock.Stop();\n  }\n\n  \/\/ If all succeed\n  std::cout << \"\\n\\nTest PASSED! \" << std::endl;\n\n  return EXIT_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <TestCommon.h>\n\n\/\/ With CreateProcess's default inheritance, the GetCurrentProcess()\n\/\/ psuedo-handle (i.e. INVALID_HANDLE_VALUE) is translated to a real handle\n\/\/ value for the child process.  It is a handle to the parent process.\n\/\/ Naturally, this was unintended behavior, and as of Windows 8.1, the handle\n\/\/ is instead translated to NULL.\n\nREGISTER(Test_CreateProcess_Duplicate_PseudoHandleBug, always);\nstatic void Test_CreateProcess_Duplicate_PseudoHandleBug() {\n    Worker p;\n    Handle::invent(GetCurrentProcess(), p).setStdout();\n    auto c = p.child({ false });\n    if (isAtLeastWin8_1()) {\n        CHECK(c.getStdout().value() == nullptr);\n    } else {\n        CHECK(c.getStdout().value() != GetCurrentProcess());\n        auto handleToPInP = Handle::dup(p.processHandle(), p);\n        CHECK(compareObjectHandles(c.getStdout(), handleToPInP));\n    }\n}\n\nREGISTER(Test_CreateProcess_Duplicate_PseudoHandleBug_IL, always);\nstatic void Test_CreateProcess_Duplicate_PseudoHandleBug_IL() {\n    \/\/ As above, but use an inherit list.  With an inherit list, standard\n    \/\/ handles are duplicated, but only with Windows 8 and up.\n    for (int useDummyPipe = 0; useDummyPipe <= 1; ++useDummyPipe) {\n        Worker p;\n        Handle::invent(INVALID_HANDLE_VALUE, p).setStdout();\n        auto c = childWithDummyInheritList(p, {}, useDummyPipe != 0);\n        if (isAtLeastWin8_1()) {\n            CHECK(c.getStdout().value() == nullptr);\n        } else if (isAtLeastWin8()) {\n            CHECK(c.getStdout().value() != GetCurrentProcess());\n            auto handleToPInP = Handle::dup(p.processHandle(), p);\n            CHECK(compareObjectHandles(c.getStdout(), handleToPInP));\n        } else {\n            CHECK(c.getStdout().value() == INVALID_HANDLE_VALUE);\n        }\n    }\n}\n<commit_msg>Fixes and comments to Test_CreateProcess_Duplicate_PseudoHandleBug<commit_after>#include <TestCommon.h>\n\n\/\/ With CreateProcess's default inheritance, the GetCurrentProcess()\n\/\/ psuedo-handle (i.e. INVALID_HANDLE_VALUE) is translated to a real handle\n\/\/ value for the child process.  It is a handle to the parent process.\n\/\/ Naturally, this was unintended behavior, and as of Windows 8.1, the handle\n\/\/ is instead translated to NULL.\n\nREGISTER(Test_CreateProcess_Duplicate_PseudoHandleBug, always);\nstatic void Test_CreateProcess_Duplicate_PseudoHandleBug() {\n    \/\/ This form of the bug occurs on these server OSs:\n    \/\/  - Server 2003 R2 SP2 64bit (64-bit and WOW64)\n    \/\/  - Server 2008 SP2 64bit (64-bit)\n    \/\/  - Server 2008 R2 SP1 64bit (WOW64)\n    \/\/ This form of the bug is fixed on these server OSs:\n    \/\/  - Server 2008 SP2 64bit (WOW64)\n    \/\/  - Server 2008 R2 SP1 64bit (WOW64)\n    Worker p;\n    Handle::invent(GetCurrentProcess(), p).setStdout();\n    auto c = p.child({ false });\n    if (isAtLeastWin8_1()) {\n        CHECK(c.getStdout().value() == nullptr);\n    } else {\n        CHECK(c.getStdout().value() != GetCurrentProcess());\n        auto handleToPInP = Handle::dup(p.processHandle(), p);\n        CHECK(compareObjectHandles(c.getStdout(), handleToPInP));\n    }\n}\n\nREGISTER(Test_CreateProcess_Duplicate_PseudoHandleBug_IL, isAtLeastVista);\nstatic void Test_CreateProcess_Duplicate_PseudoHandleBug_IL() {\n    \/\/ As above, but use an inherit list.  With an inherit list, standard\n    \/\/ handles are duplicated, but only with Windows 8 and up.\n    for (int useDummyPipe = 0; useDummyPipe <= 1; ++useDummyPipe) {\n        Worker p;\n        Handle::invent(INVALID_HANDLE_VALUE, p).setStdout();\n        auto c = childWithDummyInheritList(p, {}, useDummyPipe != 0);\n        if (isAtLeastWin8_1()) {\n            CHECK(c.getStdout().value() == nullptr);\n        } else if (isAtLeastWin8()) {\n            CHECK(c.getStdout().value() != GetCurrentProcess());\n            auto handleToPInP = Handle::dup(p.processHandle(), p);\n            CHECK(compareObjectHandles(c.getStdout(), handleToPInP));\n        } else {\n            \/\/ Prior to Windows 8, duplication doesn't occur, so the bug isn't\n            \/\/ relevant.  We run the test anyway, but it's less interesting.\n            CHECK(c.getStdout().value() == INVALID_HANDLE_VALUE);\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"testing_utilities\/almost_equals.hpp\"\n\n#include <float.h>\n#include <math.h>\n#include <stdint.h>\n\n#include <algorithm>\n#include <string>\n\n#include \"geometry\/grassmann.hpp\"\n#include \"geometry\/r3_element.hpp\"\n#include \"gmock\/gmock.h\"\n#include \"testing_utilities\/numerics.hpp\"\n\nnamespace principia {\nnamespace testing_utilities {\n\ntemplate<typename T>\ntesting::PolymorphicMatcher<AlmostEqualsMatcher<T>> AlmostEquals(\n    T const& expected,\n    std::int64_t const max_ulps) {\n  return testing::MakePolymorphicMatcher(\n      AlmostEqualsMatcher<T>(expected, max_ulps, max_ulps));\n}\n\ntemplate<typename T>\ntesting::PolymorphicMatcher<AlmostEqualsMatcher<T>> AlmostEquals(\n    T const& expected,\n    std::int64_t const min_ulps,\n    std::int64_t const max_ulps) {\n  CHECK_LE(min_ulps, max_ulps);\n  return testing::MakePolymorphicMatcher(\n      AlmostEqualsMatcher<T>(expected, min_ulps, max_ulps));\n}\n\ntemplate<typename T>\nAlmostEqualsMatcher<T>::AlmostEqualsMatcher(T const& expected,\n                                            std::int64_t const min_ulps,\n                                            std::int64_t const max_ulps)\n    : expected_(expected),\n      min_ulps_(min_ulps),\n      max_ulps_(max_ulps) {}\n\ntemplate<typename T>\ntemplate<typename Dimensions>\nbool AlmostEqualsMatcher<T>::MatchAndExplain(\n    quantities::Quantity<Dimensions> const& actual,\n    testing::MatchResultListener* listener) const {\n  \/\/ Check that the types are equality-comparable up to implicit casts.\n  if (actual == expected_) {\n    return MatchAndExplainIdentical(listener);\n  }\n  std::int64_t const distance = ULPDistance(DoubleValue(actual),\n                                            DoubleValue(expected_));\n  bool const match =  min_ulps_ <= distance && distance <= max_ulps_;\n  if (!match) {\n    *listener << \"the numbers are separated by \" << distance << \" ULPs\";\n  }\n  return match;\n}\n\ntemplate<typename T>\nbool AlmostEqualsMatcher<T>::MatchAndExplain(\n    double const actual,\n    testing::MatchResultListener* listener) const {\n  \/\/ Check that the types are equality-comparable up to implicit casts.\n  if (actual == expected_) {\n    return MatchAndExplainIdentical(listener);\n  }\n  std::int64_t const distance = ULPDistance(actual, expected_);\n  bool const match =  min_ulps_ <= distance && distance <= max_ulps_;\n  if (!match) {\n    *listener << \"the numbers are separated by \" << distance << \" ULPs\";\n  }\n  return match;\n}\n\ntemplate<typename T>\ntemplate<typename Scalar>\nbool AlmostEqualsMatcher<T>::MatchAndExplain(\n    geometry::R3Element<Scalar> const& actual,\n    testing::MatchResultListener* listener) const {\n  \/\/ Check that the types are equality-comparable up to implicit casts.\n  if (actual == expected_) {\n    return MatchAndExplainIdentical(listener);\n  }\n  std::int64_t const x_distance = ULPDistance(DoubleValue(actual.x),\n                                              DoubleValue(expected_.x));\n  std::int64_t const y_distance = ULPDistance(DoubleValue(actual.y),\n                                              DoubleValue(expected_.y));\n  std::int64_t const z_distance = ULPDistance(DoubleValue(actual.z),\n                                              DoubleValue(expected_.z));\n  std::int64_t const max_distance =\n      std::max({x_distance, y_distance, z_distance});\n  bool const x_is_max = x_distance == max_distance;\n  bool const y_is_max = y_distance == max_distance;\n  bool const z_is_max = z_distance == max_distance;\n  bool const matches = min_ulps_ <= max_distance && max_distance <= max_ulps_;\n  if (!matches) {\n    *listener << \"the following components are not within \"\n              << min_ulps_ << \" to \" << max_ulps_ << \" ULPs: \"\n              << (x_is_max ? \"\" : \"x, \") << (y_is_max ? \"\" : \"y, \")\n              << (z_is_max ? \"\" : \"z, \");\n    *listener << \"the components differ by the following numbers of ULPs: x: \"\n              << x_distance << \", y: \" << y_distance << \", z: \" << z_distance;\n  }\n  return matches;\n}\n\ntemplate<typename T>\nbool AlmostEqualsMatcher<T>::MatchAndExplain(\n    geometry::Quaternion const& actual,\n    testing::MatchResultListener* listener) const {\n  \/\/ Check that the types are equality-comparable up to implicit casts.\n  if (actual == expected_) {\n    return MatchAndExplainIdentical(listener);\n  }\n  std::int64_t const w_distance = ULPDistance(\n      DoubleValue(actual.real_part()),\n      DoubleValue(expected_.real_part()));\n  std::int64_t const x_distance = ULPDistance(\n      DoubleValue(actual.imaginary_part().x),\n      DoubleValue(expected_.imaginary_part().x));\n  std::int64_t const y_distance = ULPDistance(\n      DoubleValue(actual.imaginary_part().y),\n      DoubleValue(expected_.imaginary_part().y));\n  std::int64_t const z_distance = ULPDistance(\n      DoubleValue(actual.imaginary_part().z),\n      DoubleValue(expected_.imaginary_part().z));\n  bool const w_matches = w_distance <= max_ulps_;\n  bool const x_matches = x_distance <= max_ulps_;\n  bool const y_matches = y_distance <= max_ulps_;\n  bool const z_matches = z_distance <= max_ulps_;\n  bool const matches = w_matches && x_matches && y_matches && z_matches;\n  if (!matches) {\n    *listener << \"the following components differ by more than \" << max_ulps_\n              << \" ULPs: \"\n              << (w_matches ? \"\" : \"w, \") << (x_matches ? \"\" : \"x, \")\n              << (y_matches ? \"\" : \"y, \") << (z_matches ? \"\" : \"z, \");\n    *listener << \"the components differ by the following numbers of ULPs: w: \"\n              << w_distance << \", x: \" << x_distance\n              << \", y: \" << y_distance << \", z: \" << z_distance;\n  }\n  return matches;\n}\n\ntemplate<typename T>\ntemplate<typename Scalar, typename Frame>\nbool AlmostEqualsMatcher<T>::MatchAndExplain(\n    geometry::Vector<Scalar, Frame> const& actual,\n    testing::MatchResultListener* listener) const {\n  \/\/ Check that the types are equality-comparable up to implicit casts.\n  if (actual == expected_) {\n    return MatchAndExplainIdentical(listener);\n  }\n  return AlmostEqualsMatcher<geometry::R3Element<Scalar>>(\n      expected_.coordinates(),\n      min_ulps_,\n      max_ulps_).MatchAndExplain(actual.coordinates(), listener);\n}\n\ntemplate<typename T>\ntemplate<typename Scalar, typename Frame>\nbool AlmostEqualsMatcher<T>::MatchAndExplain(\n    geometry::Bivector<Scalar, Frame> const& actual,\n    testing::MatchResultListener* listener) const {\n  \/\/ Check that the types are equality-comparable up to implicit casts.\n  if (actual == expected_) {\n    return MatchAndExplainIdentical(listener);\n  }\n  return AlmostEqualsMatcher<geometry::R3Element<Scalar>>(\n      expected_.coordinates(),\n      min_ulps_,\n      max_ulps_).MatchAndExplain(actual.coordinates(), listener);\n}\n\ntemplate<typename T>\ntemplate<typename Scalar, typename Frame>\nbool AlmostEqualsMatcher<T>::MatchAndExplain(\n    geometry::Trivector<Scalar, Frame> const& actual,\n    testing::MatchResultListener* listener) const {\n  \/\/ Check that the types are equality-comparable up to implicit casts.\n  if (actual == expected_) {\n    return MatchAndExplainIdentical(listener);\n  }\n  return AlmostEqualsMatcher<Scalar>(expected_.coordinates(),\n                                     min_ulps_,\n                                     max_ulps_).MatchAndExplain(\n                                         actual.coordinates(),\n                                         listener);\n}\n\ntemplate<typename T>\ntemplate<typename Vector>\nbool AlmostEqualsMatcher<T>::MatchAndExplain(\n    geometry::Point<Vector> const& actual,\n    testing::MatchResultListener* listener) const {\n  \/\/ Check that the types are equality-comparable up to implicit casts.\n  if (actual == expected_) {\n    return MatchAndExplainIdentical(listener);\n  }\n  geometry::Point<Vector> const origin;\n  return AlmostEqualsMatcher<Vector>(expected_ - origin,\n                                     min_ulps_,\n                                     max_ulps_).MatchAndExplain(\n                                         actual - origin,\n                                         listener);\n}\n\n\ntemplate<typename T>\nvoid AlmostEqualsMatcher<T>::DescribeTo(std::ostream* out) const {\n  *out << \"is within \"<< min_ulps_\n       << \" to \" << max_ulps_ << \" ULPs of \" << expected_;\n}\n\ntemplate<typename T>\nvoid AlmostEqualsMatcher<T>::DescribeNegationTo(std::ostream* out) const {\n  *out << \"is not within \" << min_ulps_\n       << \" to \" << max_ulps_ << \" ULPs of \" << expected_;\n}\n\ntemplate<typename T>\nbool AlmostEqualsMatcher<T>::MatchAndExplainIdentical(\n    testing::MatchResultListener* listener) const {\n  if (min_ulps_ == 0) {\n    return true;\n  } else {\n    *listener << \"the numbers are identical\";\n    return false;\n  }\n}\n\n}  \/\/ namespace testing_utilities\n}  \/\/ namespace principia\n<commit_msg>Cleanup.<commit_after>#pragma once\n\n#include \"testing_utilities\/almost_equals.hpp\"\n\n#include <float.h>\n#include <math.h>\n#include <stdint.h>\n\n#include <algorithm>\n#include <string>\n\n#include \"geometry\/grassmann.hpp\"\n#include \"geometry\/r3_element.hpp\"\n#include \"gmock\/gmock.h\"\n#include \"testing_utilities\/numerics.hpp\"\n\nnamespace principia {\nnamespace testing_utilities {\n\ntemplate<typename T>\ntesting::PolymorphicMatcher<AlmostEqualsMatcher<T>> AlmostEquals(\n    T const& expected,\n    std::int64_t const max_ulps) {\n  return testing::MakePolymorphicMatcher(\n      AlmostEqualsMatcher<T>(expected, max_ulps, max_ulps));\n}\n\ntemplate<typename T>\ntesting::PolymorphicMatcher<AlmostEqualsMatcher<T>> AlmostEquals(\n    T const& expected,\n    std::int64_t const min_ulps,\n    std::int64_t const max_ulps) {\n  CHECK_LE(min_ulps, max_ulps);\n  return testing::MakePolymorphicMatcher(\n      AlmostEqualsMatcher<T>(expected, min_ulps, max_ulps));\n}\n\ntemplate<typename T>\nAlmostEqualsMatcher<T>::AlmostEqualsMatcher(T const& expected,\n                                            std::int64_t const min_ulps,\n                                            std::int64_t const max_ulps)\n    : expected_(expected),\n      min_ulps_(min_ulps),\n      max_ulps_(max_ulps) {}\n\ntemplate<typename T>\ntemplate<typename Dimensions>\nbool AlmostEqualsMatcher<T>::MatchAndExplain(\n    quantities::Quantity<Dimensions> const& actual,\n    testing::MatchResultListener* listener) const {\n  \/\/ Check that the types are equality-comparable up to implicit casts.\n  if (actual == expected_) {\n    return MatchAndExplainIdentical(listener);\n  }\n  std::int64_t const distance = ULPDistance(DoubleValue(actual),\n                                            DoubleValue(expected_));\n  bool const match =  min_ulps_ <= distance && distance <= max_ulps_;\n  if (!match) {\n    *listener << \"the numbers are separated by \" << distance << \" ULPs\";\n  }\n  return match;\n}\n\ntemplate<typename T>\nbool AlmostEqualsMatcher<T>::MatchAndExplain(\n    double const actual,\n    testing::MatchResultListener* listener) const {\n  \/\/ Check that the types are equality-comparable up to implicit casts.\n  if (actual == expected_) {\n    return MatchAndExplainIdentical(listener);\n  }\n  std::int64_t const distance = ULPDistance(actual, expected_);\n  bool const match =  min_ulps_ <= distance && distance <= max_ulps_;\n  if (!match) {\n    *listener << \"the numbers are separated by \" << distance << \" ULPs\";\n  }\n  return match;\n}\n\ntemplate<typename T>\ntemplate<typename Scalar>\nbool AlmostEqualsMatcher<T>::MatchAndExplain(\n    geometry::R3Element<Scalar> const& actual,\n    testing::MatchResultListener* listener) const {\n  \/\/ Check that the types are equality-comparable up to implicit casts.\n  if (actual == expected_) {\n    return MatchAndExplainIdentical(listener);\n  }\n  std::int64_t const x_distance = ULPDistance(DoubleValue(actual.x),\n                                              DoubleValue(expected_.x));\n  std::int64_t const y_distance = ULPDistance(DoubleValue(actual.y),\n                                              DoubleValue(expected_.y));\n  std::int64_t const z_distance = ULPDistance(DoubleValue(actual.z),\n                                              DoubleValue(expected_.z));\n  std::int64_t const max_distance =\n      std::max({x_distance, y_distance, z_distance});\n  bool const x_is_max = x_distance == max_distance;\n  bool const y_is_max = y_distance == max_distance;\n  bool const z_is_max = z_distance == max_distance;\n  bool const matches = min_ulps_ <= max_distance && max_distance <= max_ulps_;\n  if (!matches) {\n    *listener << \"the following components are not within \"\n              << min_ulps_ << \" to \" << max_ulps_ << \" ULPs: \"\n              << (x_is_max ? \"\" : \"x, \") << (y_is_max ? \"\" : \"y, \")\n              << (z_is_max ? \"\" : \"z, \");\n    *listener << \"the components differ by the following numbers of ULPs: x: \"\n              << x_distance << \", y: \" << y_distance << \", z: \" << z_distance;\n  }\n  return matches;\n}\n\ntemplate<typename T>\nbool AlmostEqualsMatcher<T>::MatchAndExplain(\n    geometry::Quaternion const& actual,\n    testing::MatchResultListener* listener) const {\n  \/\/ Check that the types are equality-comparable up to implicit casts.\n  if (actual == expected_) {\n    return MatchAndExplainIdentical(listener);\n  }\n  std::int64_t const w_distance = ULPDistance(\n      DoubleValue(actual.real_part()),\n      DoubleValue(expected_.real_part()));\n  std::int64_t const x_distance = ULPDistance(\n      DoubleValue(actual.imaginary_part().x),\n      DoubleValue(expected_.imaginary_part().x));\n  std::int64_t const y_distance = ULPDistance(\n      DoubleValue(actual.imaginary_part().y),\n      DoubleValue(expected_.imaginary_part().y));\n  std::int64_t const z_distance = ULPDistance(\n      DoubleValue(actual.imaginary_part().z),\n      DoubleValue(expected_.imaginary_part().z));\n  bool const w_matches = w_distance <= max_ulps_;\n  bool const x_matches = x_distance <= max_ulps_;\n  bool const y_matches = y_distance <= max_ulps_;\n  bool const z_matches = z_distance <= max_ulps_;\n  bool const matches = w_matches && x_matches && y_matches && z_matches;\n  if (!matches) {\n    *listener << \"the following components differ by more than \" << max_ulps_\n              << \" ULPs: \"\n              << (w_matches ? \"\" : \"w, \") << (x_matches ? \"\" : \"x, \")\n              << (y_matches ? \"\" : \"y, \") << (z_matches ? \"\" : \"z, \");\n    *listener << \"the components differ by the following numbers of ULPs: w: \"\n              << w_distance << \", x: \" << x_distance\n              << \", y: \" << y_distance << \", z: \" << z_distance;\n  }\n  return matches;\n}\n\ntemplate<typename T>\ntemplate<typename Scalar, typename Frame>\nbool AlmostEqualsMatcher<T>::MatchAndExplain(\n    geometry::Vector<Scalar, Frame> const& actual,\n    testing::MatchResultListener* listener) const {\n  \/\/ Check that the types are equality-comparable up to implicit casts.\n  if (actual == expected_) {\n    return MatchAndExplainIdentical(listener);\n  }\n  return AlmostEqualsMatcher<geometry::R3Element<Scalar>>(\n      expected_.coordinates(),\n      min_ulps_,\n      max_ulps_).MatchAndExplain(actual.coordinates(), listener);\n}\n\ntemplate<typename T>\ntemplate<typename Scalar, typename Frame>\nbool AlmostEqualsMatcher<T>::MatchAndExplain(\n    geometry::Bivector<Scalar, Frame> const& actual,\n    testing::MatchResultListener* listener) const {\n  \/\/ Check that the types are equality-comparable up to implicit casts.\n  if (actual == expected_) {\n    return MatchAndExplainIdentical(listener);\n  }\n  return AlmostEqualsMatcher<geometry::R3Element<Scalar>>(\n      expected_.coordinates(),\n      min_ulps_,\n      max_ulps_).MatchAndExplain(actual.coordinates(), listener);\n}\n\ntemplate<typename T>\ntemplate<typename Scalar, typename Frame>\nbool AlmostEqualsMatcher<T>::MatchAndExplain(\n    geometry::Trivector<Scalar, Frame> const& actual,\n    testing::MatchResultListener* listener) const {\n  \/\/ Check that the types are equality-comparable up to implicit casts.\n  if (actual == expected_) {\n    return MatchAndExplainIdentical(listener);\n  }\n  return AlmostEqualsMatcher<Scalar>(expected_.coordinates(),\n                                     min_ulps_,\n                                     max_ulps_).MatchAndExplain(\n                                         actual.coordinates(),\n                                         listener);\n}\n\ntemplate<typename T>\ntemplate<typename Vector>\nbool AlmostEqualsMatcher<T>::MatchAndExplain(\n    geometry::Point<Vector> const& actual,\n    testing::MatchResultListener* listener) const {\n  \/\/ Check that the types are equality-comparable up to implicit casts.\n  if (actual == expected_) {\n    return MatchAndExplainIdentical(listener);\n  }\n  geometry::Point<Vector> const origin;\n  return AlmostEqualsMatcher<Vector>(expected_ - origin,\n                                     min_ulps_,\n                                     max_ulps_).MatchAndExplain(\n                                         actual - origin,\n                                         listener);\n}\n\ntemplate<typename T>\nvoid AlmostEqualsMatcher<T>::DescribeTo(std::ostream* out) const {\n  *out << \"is within \"<< min_ulps_\n       << \" to \" << max_ulps_ << \" ULPs of \" << expected_;\n}\n\ntemplate<typename T>\nvoid AlmostEqualsMatcher<T>::DescribeNegationTo(std::ostream* out) const {\n  *out << \"is not within \" << min_ulps_\n       << \" to \" << max_ulps_ << \" ULPs of \" << expected_;\n}\n\ntemplate<typename T>\nbool AlmostEqualsMatcher<T>::MatchAndExplainIdentical(\n    testing::MatchResultListener* listener) const {\n  if (min_ulps_ == 0) {\n    return true;\n  } else {\n    *listener << \"the numbers are identical\";\n    return false;\n  }\n}\n\n}  \/\/ namespace testing_utilities\n}  \/\/ namespace principia\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Copyright(c) Microsoft Open Technologies, Inc. All rights reserved.\n\n    The MIT License(MIT)\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 \"pch.h\"\n#include \"BleSerial.h\"\n\n#include <bitset>\n\nusing namespace Concurrency;\nusing namespace Windows::Devices::Bluetooth;\nusing namespace Windows::Devices::Bluetooth::GenericAttributeProfile;\nusing namespace Windows::Devices::Enumeration;\nusing namespace Windows::Storage::Streams;\n\nusing namespace Microsoft::Maker::Serial;\n\n\/\/******************************************************************************\n\/\/* Constructors\n\/\/******************************************************************************\n\nBleSerial::BleSerial(\n    Platform::String ^device_name_,\n    Platform::Guid BLE_SERVICE_UUID,\n    Platform::Guid BLE_SERIAL_RX_CHARACTERISTIC_UUID,\n    Platform::Guid BLE_SERIAL_TX_CHARACTERISTIC_UUID\n    ) :\n    BLE_SERVICE_UUID( BLE_SERVICE_UUID),\n    BLE_SERIAL_RX_CHARACTERISTIC_UUID(BLE_SERIAL_RX_CHARACTERISTIC_UUID),\n    BLE_SERIAL_TX_CHARACTERISTIC_UUID(BLE_SERIAL_TX_CHARACTERISTIC_UUID),\n    _connection_ready(ATOMIC_VAR_INIT(false)),\n    _ble_lock(_mutex, std::defer_lock),\n    _device(nullptr),\n    _device_collection(nullptr),\n    _device_name(device_name_),\n    _gatt_rx_characteristic(nullptr),\n    _gatt_tx_characteristic(nullptr),\n    _gatt_device(nullptr),\n    _gatt_service(nullptr),\n    _tx(nullptr)\n{\n}\n\nBleSerial::BleSerial(\n    DeviceInformation ^device_,\n    Platform::Guid BLE_SERVICE_UUID,\n    Platform::Guid BLE_SERIAL_RX_CHARACTERISTIC_UUID,\n    Platform::Guid BLE_SERIAL_TX_CHARACTERISTIC_UUID\n    ) :\n    BLE_SERVICE_UUID(BLE_SERVICE_UUID),\n    BLE_SERIAL_RX_CHARACTERISTIC_UUID(BLE_SERIAL_RX_CHARACTERISTIC_UUID),\n    BLE_SERIAL_TX_CHARACTERISTIC_UUID(BLE_SERIAL_TX_CHARACTERISTIC_UUID),\n    _connection_ready(ATOMIC_VAR_INIT(false)),\n    _ble_lock(_mutex, std::defer_lock),\n    _device(device_),\n    _device_name(nullptr),\n    _device_collection(nullptr),\n    _gatt_rx_characteristic(nullptr),\n    _gatt_tx_characteristic(nullptr),\n    _gatt_device(nullptr),\n    _gatt_service(nullptr),\n    _tx(nullptr)\n{\n}\n\n\/\/******************************************************************************\n\/\/* Destructors\n\/\/******************************************************************************\n\nBleSerial::~BleSerial(\n    void\n    )\n{\n    \/\/we will fire the ConnectionLost event in the case that this object is unexpectedly destructed while the connection is established.\n    if( connectionReady() )\n    {\n        ConnectionLost( L\"Your connection has been terminated. The Microsoft::Maker::Serial::BleSerial destructor was called unexpectedly.\" );\n    }\n    end();\n}\n\n\/\/******************************************************************************\n\/\/* Public Methods\n\/\/******************************************************************************\n\nuint16_t\nBleSerial::available(\n    void\n    )\n{\n    \/\/ Check to see if connection is ready\n    if (!connectionReady()) {\n        return 0;\n    }\n    else {\n        std::lock_guard<std::mutex> lock(_q_lock);\n\t\tif (_rx.size() > 0xFFFF) { return 0xFFFF; }\n\t\treturn static_cast<uint16_t>(_rx.size());\n\n    }\n}\n\n\/\/\/ \\details Immediately discards the incoming parameters, because they are used for standard serial connections and will have no bearing on a bluetooth connection.\n\/\/\/ \\warning Must be called from the UI thread\nvoid\nBleSerial::begin(\n    uint32_t baud_,\n    SerialConfig config_\n    )\n{\n    \/\/ Discard incoming parameters inherited from IStream interface.\n    UNREFERENCED_PARAMETER(baud_);\n    UNREFERENCED_PARAMETER(config_);\n\n    \/\/ Ensure known good state\n    end();\n\n    \/\/ Although this path is not optimal, the behavior (the calls must be made from the UI thread) is mandated by the bluetooth API. The algorithm is a compromise to provide the succint, maintainable code.\n    Concurrency::create_task(listAvailableDevicesAsync())\n        .then([this](Windows::Devices::Enumeration::DeviceInformationCollection ^device_collection_)\n    {\n        \/\/ If a friendly name was specified, then identify the associated device\n        if (_device_name) {\n            \/\/ Store parameter as a member to ensure the duration of object allocation\n            _device_collection = device_collection_;\n            if (!_device_collection->Size)\n            {\n                throw ref new Platform::Exception(E_UNEXPECTED, L\"No Bluetooth LE devices found or Bluetooth is disabled.\");\n            }\n\n            _device = identifyDeviceFromCollection(_device_collection);\n        }\n\n        if (!_device) {\n            throw ref new Platform::Exception(E_UNEXPECTED, L\"ERROR! Hacking too much time!\");\n        }\n\n        return connectToDeviceAsync(_device);\n    }).then([this](Concurrency::task<void> t)\n    {\n        try\n        {\n            t.get();\n        }\n        catch (Platform::Exception ^e)\n        {\n            ConnectionFailed(L\"BleSerial::connectToDeviceAsync failed with a Platform::Exception type. (message: \" + e->Message + L\")\");\n        }\n        catch (...)\n        {\n            ConnectionFailed(L\"BleSerial::connectToDeviceAsync failed with a non-Platform::Exception type. (name: \" + _device_name + L\")\");\n        }\n    });\n}\n\nbool\nBleSerial::connectionReady(\n    void\n    )\n{\n    return _connection_ready;\n}\n\n\/\/\/ \\ref https:\/\/social.msdn.microsoft.com\/Forums\/windowsapps\/en-US\/961c9d61-99ad-4a1b-82dc-22b6bd81aa2e\/error-c2039-close-is-not-a-member-of-windowsstoragestreamsdatawriter?forum=winappswithnativecode\nvoid\nBleSerial::end(\n    void\n    )\n{\n    std::lock_guard<std::mutex> lock(_q_lock);\n    _connection_ready =  false;\n    if (_gatt_rx_characteristic) _gatt_rx_characteristic->WriteClientCharacteristicConfigurationDescriptorAsync(GattClientCharacteristicConfigurationDescriptorValue::None);\n    if (_gatt_tx_characteristic) _gatt_tx_characteristic->WriteClientCharacteristicConfigurationDescriptorAsync(GattClientCharacteristicConfigurationDescriptorValue::None);\n\n    \/\/ Reset with respect to dependencies\n    _rx = std::queue<byte>();\n    delete(_tx); \/\/_tx->Close();\n    _tx = nullptr;\n    _gatt_rx_characteristic = nullptr;\n    _gatt_tx_characteristic = nullptr;\n    _gatt_service = nullptr;\n    _gatt_device = nullptr;\n    _device_collection = nullptr;\n}\n\nvoid\nBleSerial::flush(\n    void\n    )\n{\n    if ( !connectionReady() )\n    {\n        return;\n    }\n\n    create_task(_gatt_tx_characteristic->WriteValueAsync(_tx->DetachBuffer(), GattWriteOption::WriteWithResponse))\n    .then([this](GattCommunicationStatus status_)\n    {\n        switch (status_) {\n        case GattCommunicationStatus::Success:\n            break;\n        case GattCommunicationStatus::Unreachable:\n            ConnectionLost( L\"Your connection has been lost. The device is no longer available.\" );\n            break;\n        default:\n            break;\n        }\n    });\n}\n\n\/\/\/ \\details An Advanced Query String is constructed based upon paired bluetooth GATT devices. Then a collection is returned of all devices matching the query.\n\/\/\/ \\ref https:\/\/msdn.microsoft.com\/en-us\/library\/aa965711(VS.85).aspx\n\/\/\/ \\warning Must be called from UI thread\nWindows::Foundation::IAsyncOperation<Windows::Devices::Enumeration::DeviceInformationCollection ^> ^\nBleSerial::listAvailableDevicesAsync(\n    void\n    )\n{\n    \/\/ Construct AQS String for Bluetooth LE devices\n    Platform::String ^device_aqs = Windows::Devices::Bluetooth::GenericAttributeProfile::GattDeviceService::GetDeviceSelectorFromUuid(Windows::Devices::Bluetooth::GenericAttributeProfile::GattServiceUuids::GenericAccess);\n\n    \/\/ Identify all paired devices satisfying query\n    return Windows::Devices::Enumeration::DeviceInformation::FindAllAsync(device_aqs);\n}\n\nvoid\nBleSerial::lock(\n    void\n    )\n{\n    _ble_lock.lock();\n}\n\nuint16_t\nBleSerial::print(\n    uint8_t c_\n    )\n{\n    return write(c_);\n}\n\nuint16_t\nBleSerial::print(\n    int32_t value_\n    )\n{\n    return print(value_, Radix::DEC);\n}\n\nuint16_t\nBleSerial::print(\n    int32_t value_,\n    Radix base_\n    )\n{\n    constexpr int bit_size = (sizeof(int) * 8);\n    std::bitset<bit_size> bits(value_);\n    char text_value[bit_size + 1];\n\n    switch (base_) {\n    case Radix::BIN:\n        sprintf_s(text_value, \"%s\", bits.to_string().c_str());\n        break;\n    case Radix::DEC:\n        sprintf_s(text_value, \"%i\", value_);\n        break;\n    case Radix::HEX:\n        sprintf_s(text_value, \"%x\", value_);\n        break;\n    case Radix::OCT:\n        sprintf_s(text_value, \"%o\", value_);\n        break;\n    default:\n        return static_cast<uint16_t>(-1);\n    }\n\n    return write(Platform::ArrayReference<uint8_t>(reinterpret_cast<uint8_t *>(const_cast<char *>(text_value)), strnlen(text_value, bit_size + 1)));\n}\n\nuint16_t\nBleSerial::print(\n    uint32_t value_\n    )\n{\n    return print(value_, Radix::DEC);\n}\n\nuint16_t\nBleSerial::print(\n    uint32_t value_,\n    Radix base_\n    )\n{\n    constexpr int bit_size = (sizeof(unsigned int) * 8);\n    std::bitset<bit_size> bits(value_);\n    char text_value[bit_size + 1];\n\n    switch (base_) {\n    case Radix::BIN:\n        sprintf_s(text_value, \"%s\", bits.to_string().c_str());\n        break;\n    case Radix::DEC:\n        sprintf_s(text_value, \"%u\", value_);\n        break;\n    case Radix::HEX:\n        sprintf_s(text_value, \"%x\", value_);\n        break;\n    case Radix::OCT:\n        sprintf_s(text_value, \"%o\", value_);\n        break;\n    default:\n        return static_cast<uint16_t>(-1);\n    }\n\n    return write(Platform::ArrayReference<uint8_t>(reinterpret_cast<uint8_t *>(const_cast<char *>(text_value)), strnlen(text_value, bit_size + 1)));\n}\n\nuint16_t\nBleSerial::print(\n    double value_\n    )\n{\n    return print(value_, 2);\n}\n\nuint16_t\nBleSerial::print(\n    double value_,\n    int16_t decimal_places_\n    )\n{\n    constexpr int max_double_size = (sizeof(double) * 8);\n    constexpr int max_int_size = (sizeof(int16_t) * 8);\n    char format_string[max_int_size + 5];\n    char text_value[max_double_size + 1];\n\n    sprintf_s(format_string, \"%%.%ilf\", decimal_places_);\n    sprintf_s(text_value, format_string, value_);\n\n    return write(Platform::ArrayReference<uint8_t>(reinterpret_cast<uint8_t *>(const_cast<char *>(text_value)), strnlen(text_value, max_double_size + 1)));\n}\n\nuint16_t\nBleSerial::print(\n    const Platform::Array<uint8_t> ^buffer_\n    )\n{\n    return write(buffer_);\n}\n\nuint16_t\nBleSerial::read(\n    void\n    )\n{\n    uint16_t c = static_cast<uint16_t>(-1);\n\n    if (available()) {\n        std::lock_guard<std::mutex> lock(_q_lock);\n        c = _rx.front();\n        _rx.pop();\n    }\n\n    return c;\n}\n\nvoid\nBleSerial::unlock(\n    void\n    )\n{\n    _ble_lock.unlock();\n}\n\nuint16_t\nBleSerial::write(\n    uint8_t c_\n    )\n{\n    \/\/ Check to see if connection is ready\n    if (!connectionReady()) { return 0; }\n\n    _tx->WriteByte(c_);\n    return 1;\n}\n\nuint16_t\nBleSerial::write(\n    const Platform::Array<uint8_t> ^buffer_\n    )\n{\n    \/\/ Check to see if connection is ready\n    if (!connectionReady()) { return 0; }\n\n    _tx->WriteBytes(buffer_);\n    return buffer_->Length;\n}\n\n\/\/******************************************************************************\n\/\/* Private Methods\n\/\/******************************************************************************\n\nConcurrency::task<void>\nBleSerial::connectToDeviceAsync(\n    Windows::Devices::Enumeration::DeviceInformation ^device_\n    )\n{\n    _device_name = device_->Name;  \/\/ Update name in case device was specified directly\n    return Concurrency::create_task(Windows::Devices::Bluetooth::BluetoothLEDevice::FromIdAsync(device_->Id))\n        .then([this](Windows::Devices::Bluetooth::BluetoothLEDevice ^gatt_device_)\n    {\n        if( gatt_device_ == nullptr )\n        {\n            throw ref new Platform::Exception( E_UNEXPECTED, ref new Platform::String( L\"Unable to initialize the device. BluetoothLEDevice::FromIdAsync returned null.\" ) );\n        }\n\n        \/\/ Store parameter as a member to ensure the duration of object allocation\n        _gatt_device = gatt_device_;\n\n        \/\/ Enable TX\n        _tx = ref new DataWriter();\n        _gatt_service = _gatt_device->GetGattService(BLE_SERVICE_UUID);\n        _gatt_tx_characteristic = _gatt_service->GetCharacteristics(BLE_SERIAL_TX_CHARACTERISTIC_UUID)->GetAt(0);\n\n        \/\/ Enable RX\n        _gatt_rx_characteristic = _gatt_service->GetCharacteristics(BLE_SERIAL_RX_CHARACTERISTIC_UUID)->GetAt(0);\n        _gatt_rx_characteristic->ValueChanged += ref new Windows::Foundation::TypedEventHandler<GattCharacteristic ^, GattValueChangedEventArgs ^>(this, &BleSerial::rxCallback);\n        _gatt_rx_characteristic->WriteClientCharacteristicConfigurationDescriptorAsync(GattClientCharacteristicConfigurationDescriptorValue::Notify);\n\n        \/\/ Set connection ready flag and fire connection established event\n        _connection_ready = true;\n        ConnectionEstablished();\n    });\n}\n\nWindows::Devices::Enumeration::DeviceInformation ^\nBleSerial::identifyDeviceFromCollection(\n    Windows::Devices::Enumeration::DeviceInformationCollection ^devices_\n    )\n{\n    for(auto &&device : devices_)\n    {\n        if (device->Id->Equals(_device_name) || device->Name->Equals(_device_name))\n        {\n            return device;\n        }\n    }\n\n    \/\/ If we searched and found nothing that matches the identifier, we've failed to connect and cannot recover.\n    throw ref new Platform::Exception(E_INVALIDARG, L\"No Bluetooth LE devices found matching the specified identifier.\");\n}\n\nvoid\nBleSerial::rxCallback(\n    GattCharacteristic ^sender,\n    GattValueChangedEventArgs ^args\n    )\n{\n    \/\/ Extract data into workable form from parameters\n    Platform::Array<byte> ^rx_data = ref new Platform::Array<byte>(args->CharacteristicValue->Length);\n    DataReader::FromBuffer(args->CharacteristicValue)->ReadBytes(rx_data);\n\n    {\n        std::lock_guard<std::mutex> lock(_q_lock);\n        std::for_each(rx_data->Data, rx_data->Data + rx_data->Length, [this](byte data_) {\n            _rx.push(data_);\n        });\n    }\n}\n<commit_msg>update BleSerial to enumerate BLE devices instead of BLE services<commit_after>\/*\n    Copyright(c) Microsoft Open Technologies, Inc. All rights reserved.\n\n    The MIT License(MIT)\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 \"pch.h\"\n#include \"BleSerial.h\"\n\n#include <bitset>\n\nusing namespace Concurrency;\nusing namespace Windows::Devices::Bluetooth;\nusing namespace Windows::Devices::Bluetooth::GenericAttributeProfile;\nusing namespace Windows::Devices::Enumeration;\nusing namespace Windows::Storage::Streams;\n\nusing namespace Microsoft::Maker::Serial;\n\n\/\/******************************************************************************\n\/\/* Constructors\n\/\/******************************************************************************\n\nBleSerial::BleSerial(\n    Platform::String ^device_name_,\n    Platform::Guid BLE_SERVICE_UUID,\n    Platform::Guid BLE_SERIAL_RX_CHARACTERISTIC_UUID,\n    Platform::Guid BLE_SERIAL_TX_CHARACTERISTIC_UUID\n    ) :\n    BLE_SERVICE_UUID( BLE_SERVICE_UUID),\n    BLE_SERIAL_RX_CHARACTERISTIC_UUID(BLE_SERIAL_RX_CHARACTERISTIC_UUID),\n    BLE_SERIAL_TX_CHARACTERISTIC_UUID(BLE_SERIAL_TX_CHARACTERISTIC_UUID),\n    _connection_ready(ATOMIC_VAR_INIT(false)),\n    _ble_lock(_mutex, std::defer_lock),\n    _device(nullptr),\n    _device_collection(nullptr),\n    _device_name(device_name_),\n    _gatt_rx_characteristic(nullptr),\n    _gatt_tx_characteristic(nullptr),\n    _gatt_device(nullptr),\n    _gatt_service(nullptr),\n    _tx(nullptr)\n{\n}\n\nBleSerial::BleSerial(\n    DeviceInformation ^device_,\n    Platform::Guid BLE_SERVICE_UUID,\n    Platform::Guid BLE_SERIAL_RX_CHARACTERISTIC_UUID,\n    Platform::Guid BLE_SERIAL_TX_CHARACTERISTIC_UUID\n    ) :\n    BLE_SERVICE_UUID(BLE_SERVICE_UUID),\n    BLE_SERIAL_RX_CHARACTERISTIC_UUID(BLE_SERIAL_RX_CHARACTERISTIC_UUID),\n    BLE_SERIAL_TX_CHARACTERISTIC_UUID(BLE_SERIAL_TX_CHARACTERISTIC_UUID),\n    _connection_ready(ATOMIC_VAR_INIT(false)),\n    _ble_lock(_mutex, std::defer_lock),\n    _device(device_),\n    _device_name(nullptr),\n    _device_collection(nullptr),\n    _gatt_rx_characteristic(nullptr),\n    _gatt_tx_characteristic(nullptr),\n    _gatt_device(nullptr),\n    _gatt_service(nullptr),\n    _tx(nullptr)\n{\n}\n\n\/\/******************************************************************************\n\/\/* Destructors\n\/\/******************************************************************************\n\nBleSerial::~BleSerial(\n    void\n    )\n{\n    \/\/we will fire the ConnectionLost event in the case that this object is unexpectedly destructed while the connection is established.\n    if( connectionReady() )\n    {\n        ConnectionLost( L\"Your connection has been terminated. The Microsoft::Maker::Serial::BleSerial destructor was called unexpectedly.\" );\n    }\n    end();\n}\n\n\/\/******************************************************************************\n\/\/* Public Methods\n\/\/******************************************************************************\n\nuint16_t\nBleSerial::available(\n    void\n    )\n{\n    \/\/ Check to see if connection is ready\n    if (!connectionReady()) {\n        return 0;\n    }\n    else {\n        std::lock_guard<std::mutex> lock(_q_lock);\n\t\tif (_rx.size() > 0xFFFF) { return 0xFFFF; }\n\t\treturn static_cast<uint16_t>(_rx.size());\n\n    }\n}\n\n\/\/\/ \\details Immediately discards the incoming parameters, because they are used for standard serial connections and will have no bearing on a bluetooth connection.\n\/\/\/ \\warning Must be called from the UI thread\nvoid\nBleSerial::begin(\n    uint32_t baud_,\n    SerialConfig config_\n    )\n{\n    \/\/ Discard incoming parameters inherited from IStream interface.\n    UNREFERENCED_PARAMETER(baud_);\n    UNREFERENCED_PARAMETER(config_);\n\n    \/\/ Ensure known good state\n    end();\n\n    \/\/ Although this path is not optimal, the behavior (the calls must be made from the UI thread) is mandated by the bluetooth API. The algorithm is a compromise to provide the succint, maintainable code.\n    Concurrency::create_task(listAvailableDevicesAsync())\n        .then([this](Windows::Devices::Enumeration::DeviceInformationCollection ^device_collection_)\n    {\n        \/\/ If a friendly name was specified, then identify the associated device\n        if (_device_name) {\n            \/\/ Store parameter as a member to ensure the duration of object allocation\n            _device_collection = device_collection_;\n            if (!_device_collection->Size)\n            {\n                throw ref new Platform::Exception(E_UNEXPECTED, L\"No Bluetooth LE devices found or Bluetooth is disabled.\");\n            }\n\n            _device = identifyDeviceFromCollection(_device_collection);\n        }\n\n        if (!_device) {\n            throw ref new Platform::Exception(E_UNEXPECTED, L\"ERROR! Hacking too much time!\");\n        }\n\n        return connectToDeviceAsync(_device);\n    }).then([this](Concurrency::task<void> t)\n    {\n        try\n        {\n            t.get();\n        }\n        catch (Platform::Exception ^e)\n        {\n            ConnectionFailed(L\"BleSerial::connectToDeviceAsync failed with a Platform::Exception type. (message: \" + e->Message + L\")\");\n        }\n        catch (...)\n        {\n            ConnectionFailed(L\"BleSerial::connectToDeviceAsync failed with a non-Platform::Exception type. (name: \" + _device_name + L\")\");\n        }\n    });\n}\n\nbool\nBleSerial::connectionReady(\n    void\n    )\n{\n    return _connection_ready;\n}\n\n\/\/\/ \\ref https:\/\/social.msdn.microsoft.com\/Forums\/windowsapps\/en-US\/961c9d61-99ad-4a1b-82dc-22b6bd81aa2e\/error-c2039-close-is-not-a-member-of-windowsstoragestreamsdatawriter?forum=winappswithnativecode\nvoid\nBleSerial::end(\n    void\n    )\n{\n    std::lock_guard<std::mutex> lock(_q_lock);\n    _connection_ready =  false;\n    if (_gatt_rx_characteristic) _gatt_rx_characteristic->WriteClientCharacteristicConfigurationDescriptorAsync(GattClientCharacteristicConfigurationDescriptorValue::None);\n    if (_gatt_tx_characteristic) _gatt_tx_characteristic->WriteClientCharacteristicConfigurationDescriptorAsync(GattClientCharacteristicConfigurationDescriptorValue::None);\n\n    \/\/ Reset with respect to dependencies\n    _rx = std::queue<byte>();\n    delete(_tx); \/\/_tx->Close();\n    _tx = nullptr;\n    _gatt_rx_characteristic = nullptr;\n    _gatt_tx_characteristic = nullptr;\n    _gatt_service = nullptr;\n    _gatt_device = nullptr;\n    _device_collection = nullptr;\n}\n\nvoid\nBleSerial::flush(\n    void\n    )\n{\n    if ( !connectionReady() )\n    {\n        return;\n    }\n\n    create_task(_gatt_tx_characteristic->WriteValueAsync(_tx->DetachBuffer(), GattWriteOption::WriteWithResponse))\n    .then([this](GattCommunicationStatus status_)\n    {\n        switch (status_) {\n        case GattCommunicationStatus::Success:\n            break;\n        case GattCommunicationStatus::Unreachable:\n            ConnectionLost( L\"Your connection has been lost. The device is no longer available.\" );\n            break;\n        default:\n            break;\n        }\n    });\n}\n\n\/\/\/ \\details An Advanced Query String is constructed based upon paired bluetooth GATT devices. Then a collection is returned of all devices matching the query.\n\/\/\/ \\ref https:\/\/msdn.microsoft.com\/en-us\/library\/aa965711(VS.85).aspx\n\/\/\/ \\warning Must be called from UI thread\nWindows::Foundation::IAsyncOperation<Windows::Devices::Enumeration::DeviceInformationCollection ^> ^\nBleSerial::listAvailableDevicesAsync(\n    void\n    )\n{\n    \/\/ Construct AQS String for Bluetooth LE devices\n    Platform::String ^device_aqs = Windows::Devices::Bluetooth::BluetoothLEDevice::GetDeviceSelector();\n\n    \/\/ Identify all paired devices satisfying query\n    return Windows::Devices::Enumeration::DeviceInformation::FindAllAsync(device_aqs);\n}\n\nvoid\nBleSerial::lock(\n    void\n    )\n{\n    _ble_lock.lock();\n}\n\nuint16_t\nBleSerial::print(\n    uint8_t c_\n    )\n{\n    return write(c_);\n}\n\nuint16_t\nBleSerial::print(\n    int32_t value_\n    )\n{\n    return print(value_, Radix::DEC);\n}\n\nuint16_t\nBleSerial::print(\n    int32_t value_,\n    Radix base_\n    )\n{\n    constexpr int bit_size = (sizeof(int) * 8);\n    std::bitset<bit_size> bits(value_);\n    char text_value[bit_size + 1];\n\n    switch (base_) {\n    case Radix::BIN:\n        sprintf_s(text_value, \"%s\", bits.to_string().c_str());\n        break;\n    case Radix::DEC:\n        sprintf_s(text_value, \"%i\", value_);\n        break;\n    case Radix::HEX:\n        sprintf_s(text_value, \"%x\", value_);\n        break;\n    case Radix::OCT:\n        sprintf_s(text_value, \"%o\", value_);\n        break;\n    default:\n        return static_cast<uint16_t>(-1);\n    }\n\n    return write(Platform::ArrayReference<uint8_t>(reinterpret_cast<uint8_t *>(const_cast<char *>(text_value)), strnlen(text_value, bit_size + 1)));\n}\n\nuint16_t\nBleSerial::print(\n    uint32_t value_\n    )\n{\n    return print(value_, Radix::DEC);\n}\n\nuint16_t\nBleSerial::print(\n    uint32_t value_,\n    Radix base_\n    )\n{\n    constexpr int bit_size = (sizeof(unsigned int) * 8);\n    std::bitset<bit_size> bits(value_);\n    char text_value[bit_size + 1];\n\n    switch (base_) {\n    case Radix::BIN:\n        sprintf_s(text_value, \"%s\", bits.to_string().c_str());\n        break;\n    case Radix::DEC:\n        sprintf_s(text_value, \"%u\", value_);\n        break;\n    case Radix::HEX:\n        sprintf_s(text_value, \"%x\", value_);\n        break;\n    case Radix::OCT:\n        sprintf_s(text_value, \"%o\", value_);\n        break;\n    default:\n        return static_cast<uint16_t>(-1);\n    }\n\n    return write(Platform::ArrayReference<uint8_t>(reinterpret_cast<uint8_t *>(const_cast<char *>(text_value)), strnlen(text_value, bit_size + 1)));\n}\n\nuint16_t\nBleSerial::print(\n    double value_\n    )\n{\n    return print(value_, 2);\n}\n\nuint16_t\nBleSerial::print(\n    double value_,\n    int16_t decimal_places_\n    )\n{\n    constexpr int max_double_size = (sizeof(double) * 8);\n    constexpr int max_int_size = (sizeof(int16_t) * 8);\n    char format_string[max_int_size + 5];\n    char text_value[max_double_size + 1];\n\n    sprintf_s(format_string, \"%%.%ilf\", decimal_places_);\n    sprintf_s(text_value, format_string, value_);\n\n    return write(Platform::ArrayReference<uint8_t>(reinterpret_cast<uint8_t *>(const_cast<char *>(text_value)), strnlen(text_value, max_double_size + 1)));\n}\n\nuint16_t\nBleSerial::print(\n    const Platform::Array<uint8_t> ^buffer_\n    )\n{\n    return write(buffer_);\n}\n\nuint16_t\nBleSerial::read(\n    void\n    )\n{\n    uint16_t c = static_cast<uint16_t>(-1);\n\n    if (available()) {\n        std::lock_guard<std::mutex> lock(_q_lock);\n        c = _rx.front();\n        _rx.pop();\n    }\n\n    return c;\n}\n\nvoid\nBleSerial::unlock(\n    void\n    )\n{\n    _ble_lock.unlock();\n}\n\nuint16_t\nBleSerial::write(\n    uint8_t c_\n    )\n{\n    \/\/ Check to see if connection is ready\n    if (!connectionReady()) { return 0; }\n\n    _tx->WriteByte(c_);\n    return 1;\n}\n\nuint16_t\nBleSerial::write(\n    const Platform::Array<uint8_t> ^buffer_\n    )\n{\n    \/\/ Check to see if connection is ready\n    if (!connectionReady()) { return 0; }\n\n    _tx->WriteBytes(buffer_);\n    return buffer_->Length;\n}\n\n\/\/******************************************************************************\n\/\/* Private Methods\n\/\/******************************************************************************\n\nConcurrency::task<void>\nBleSerial::connectToDeviceAsync(\n    Windows::Devices::Enumeration::DeviceInformation ^device_\n    )\n{\n    _device_name = device_->Name;  \/\/ Update name in case device was specified directly\n    return Concurrency::create_task(Windows::Devices::Bluetooth::BluetoothLEDevice::FromIdAsync(device_->Id))\n        .then([this](Windows::Devices::Bluetooth::BluetoothLEDevice ^gatt_device_)\n    {\n        if( gatt_device_ == nullptr )\n        {\n            throw ref new Platform::Exception( E_UNEXPECTED, ref new Platform::String( L\"Unable to initialize the device. BluetoothLEDevice::FromIdAsync returned null.\" ) );\n        }\n\n        \/\/ Store parameter as a member to ensure the duration of object allocation\n        _gatt_device = gatt_device_;\n\n        \/\/ Enable TX\n        _tx = ref new DataWriter();\n        _gatt_service = _gatt_device->GetGattService(BLE_SERVICE_UUID);\n        _gatt_tx_characteristic = _gatt_service->GetCharacteristics(BLE_SERIAL_TX_CHARACTERISTIC_UUID)->GetAt(0);\n\n        \/\/ Enable RX\n        _gatt_rx_characteristic = _gatt_service->GetCharacteristics(BLE_SERIAL_RX_CHARACTERISTIC_UUID)->GetAt(0);\n        _gatt_rx_characteristic->ValueChanged += ref new Windows::Foundation::TypedEventHandler<GattCharacteristic ^, GattValueChangedEventArgs ^>(this, &BleSerial::rxCallback);\n        _gatt_rx_characteristic->WriteClientCharacteristicConfigurationDescriptorAsync(GattClientCharacteristicConfigurationDescriptorValue::Notify);\n\n        \/\/ Set connection ready flag and fire connection established event\n        _connection_ready = true;\n        ConnectionEstablished();\n    });\n}\n\nWindows::Devices::Enumeration::DeviceInformation ^\nBleSerial::identifyDeviceFromCollection(\n    Windows::Devices::Enumeration::DeviceInformationCollection ^devices_\n    )\n{\n    for(auto &&device : devices_)\n    {\n        if (device->Id->Equals(_device_name) || device->Name->Equals(_device_name))\n        {\n            return device;\n        }\n    }\n\n    \/\/ If we searched and found nothing that matches the identifier, we've failed to connect and cannot recover.\n    throw ref new Platform::Exception(E_INVALIDARG, L\"No Bluetooth LE devices found matching the specified identifier.\");\n}\n\nvoid\nBleSerial::rxCallback(\n    GattCharacteristic ^sender,\n    GattValueChangedEventArgs ^args\n    )\n{\n    \/\/ Extract data into workable form from parameters\n    Platform::Array<byte> ^rx_data = ref new Platform::Array<byte>(args->CharacteristicValue->Length);\n    DataReader::FromBuffer(args->CharacteristicValue)->ReadBytes(rx_data);\n\n    {\n        std::lock_guard<std::mutex> lock(_q_lock);\n        std::for_each(rx_data->Data, rx_data->Data + rx_data->Length, [this](byte data_) {\n            _rx.push(data_);\n        });\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>BTS-501 (#15603)<commit_after><|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 \"velodyne_pointcloud\/velodyne_parser.h\"\n\n#include <pcl\/common\/time.h>\n#include <ros\/package.h>\n#include <ros\/ros.h>\n\n#include \"velodyne_pointcloud\/util.h\"\n\nnamespace apollo {\nnamespace drivers {\nnamespace velodyne {\n\ndouble VelodyneParser::get_gps_stamp(double current_packet_stamp,\n                                     double &previous_packet_stamp,\n                                     uint64_t &gps_base_usec) {\n  if (current_packet_stamp < previous_packet_stamp) {\n    \/\/ plus 3600 when large jump back, discard little jump back for wrong time\n    \/\/ in lidar\n    if (std::abs(previous_packet_stamp - current_packet_stamp) > 3599000000) {\n      gps_base_usec += 3600 * 1e6;\n      ROS_INFO_STREAM(\"Base time plus 3600s. Model: \"\n                      << config_.model << std::fixed\n                      << \". current:\" << current_packet_stamp\n                      << \", last time:\" << previous_packet_stamp);\n    } else {\n      ROS_WARN_STREAM(\"Currrnt stamp:\" << std::fixed << current_packet_stamp\n                                       << \" less than previous stamp:\"\n                                       << previous_packet_stamp\n                                       << \". GPS time stamp maybe incorrect!\");\n    }\n  } else if (previous_packet_stamp != 0 &&\n             current_packet_stamp - previous_packet_stamp > 100000) {  \/\/ 100ms\n    ROS_ERROR_STREAM(\"Current stamp:\"\n                     << std::fixed << current_packet_stamp\n                     << \" ahead previous stamp:\" << previous_packet_stamp\n                     << \" over 100ms. GPS time stamp incorrect!\");\n  }\n\n  previous_packet_stamp = current_packet_stamp;\n  double gps_stamp = gps_base_usec + current_packet_stamp;\n\n  gps_stamp \/= 1e6;\n  return gps_stamp;\n}\n\nVPoint VelodyneParser::get_nan_point(double timestamp) {\n  VPoint nan_point;\n  nan_point.timestamp = timestamp;\n  nan_point.x = nan;\n  nan_point.y = nan;\n  nan_point.z = nan;\n  nan_point.intensity = 0;\n  return nan_point;\n}\n\nVelodyneParser::VelodyneParser(Config config)\n    : last_time_stamp_(0), config_(config), mode_(STRONGEST) {}\n\nvoid VelodyneParser::init_angle_params(double view_direction,\n                                       double view_width) {\n  \/\/ converting angle parameters into the velodyne reference (rad)\n  double tmp_min_angle = view_direction + view_width \/ 2;\n  double tmp_max_angle = view_direction - view_width \/ 2;\n\n  \/\/ computing positive modulo to keep theses angles into [0;2*M_PI]\n  tmp_min_angle = fmod(fmod(tmp_min_angle, 2 * M_PI) + 2 * M_PI, 2 * M_PI);\n  tmp_max_angle = fmod(fmod(tmp_max_angle, 2 * M_PI) + 2 * M_PI, 2 * M_PI);\n\n  \/\/ converting into the hardware velodyne ref (negative yaml and degrees)\n  \/\/ adding 0.5 perfomrs a centered double to int conversion\n  config_.min_angle = 100 * (2 * M_PI - tmp_min_angle) * 180 \/ M_PI + 0.5;\n  config_.max_angle = 100 * (2 * M_PI - tmp_max_angle) * 180 \/ M_PI + 0.5;\n  if (config_.min_angle == config_.max_angle) {\n    \/\/ avoid returning empty cloud if min_angle = max_angle\n    config_.min_angle = 0;\n    config_.max_angle = 36000;\n  }\n}\n\n\/** Set up for on-line operation. *\/\nvoid VelodyneParser::setup() {\n  if (!config_.calibration_online) {\n    calibration_.read(config_.calibration_file);\n\n    if (!calibration_.initialized_) {\n      ROS_FATAL_STREAM(\n          \"Unable to open calibration file: \" << config_.calibration_file);\n      ROS_BREAK();\n    }\n  }\n\n  \/\/ setup angle parameters.\n  init_angle_params(config_.view_direction, config_.view_width);\n  init_sin_cos_rot_table(sin_rot_table_, cos_rot_table_, ROTATION_MAX_UNITS,\n                         ROTATION_RESOLUTION);\n}\n\nbool VelodyneParser::is_scan_valid(int rotation, float range) {\n  \/\/ check range first\n  if (range < config_.min_range || range > config_.max_range) {\n    return false;\n  }\n  \/\/ condition added to avoid calculating points which are not\n  \/\/ in the interesting defined area (min_angle < area < max_angle)\n  \/\/ not used now\n  \/\/ if ((config_.min_angle > config_.max_angle && (rotation <=\n  \/\/ config_.max_angle || rotation >= config_.min_angle))\n  \/\/     || (config_.min_angle < config_.max_angle && rotation >=\n  \/\/     config_.min_angle\n  \/\/         && rotation <= config_.max_angle)) {\n  \/\/     return true;\n  \/\/ }\n  return true;\n}\n\nvoid VelodyneParser::compute_coords(const union RawDistance &raw_distance,\n                                    const LaserCorrection &corrections,\n                                    const uint16_t &rotation, VPoint &point) {\n  double x = 0.0;\n  double y = 0.0;\n  double z = 0.0;\n\n  double distance1 = raw_distance.raw_distance * DISTANCE_RESOLUTION;\n  double distance = distance1 + corrections.dist_correction;\n\n  \/\/ cos(a-b) = cos(a)*cos(b) + sin(a)*sin(b)\n  \/\/ sin(a-b) = sin(a)*cos(b) - cos(a)*sin(b)\n  double cos_rot_angle =\n      cos_rot_table_[rotation] * corrections.cos_rot_correction +\n      sin_rot_table_[rotation] * corrections.sin_rot_correction;\n  double sin_rot_angle =\n      sin_rot_table_[rotation] * corrections.cos_rot_correction -\n      cos_rot_table_[rotation] * corrections.sin_rot_correction;\n\n  double vert_offset = corrections.vert_offset_correction;\n\n  \/\/ Compute the distance in the xy plane (w\/o accounting for rotation)\n  double xy_distance = distance * corrections.cos_vert_correction;\n\n  \/\/ Calculate temporal X, use absolute value.\n  double xx = fabs(xy_distance * sin_rot_angle -\n                   corrections.horiz_offset_correction * cos_rot_angle);\n  \/\/ Calculate temporal Y, use absolute value\n  double yy = fabs(xy_distance * cos_rot_angle +\n                   corrections.horiz_offset_correction * sin_rot_angle);\n\n  \/\/ Get 2points calibration values,Linear interpolation to get distance\n  \/\/ correction for X and Y, that means distance correction use\n  \/\/ different value at different distance\n  double distance_corr_x = 0;\n  double distance_corr_y = 0;\n\n  if (need_two_pt_correction_ && distance1 <= 2500) {\n    distance_corr_x =\n        (corrections.dist_correction - corrections.dist_correction_x) *\n            (xx - 2.4) \/ 22.64 +\n        corrections.dist_correction_x;  \/\/ 22.64 = 25.04 - 2.4\n    distance_corr_y =\n        (corrections.dist_correction - corrections.dist_correction_y) *\n            (yy - 1.93) \/ 23.11 +\n        corrections.dist_correction_y;  \/\/ 23.11 = 25.04 - 1.93\n  } else {\n    distance_corr_x = distance_corr_y = corrections.dist_correction;\n  }\n\n  double distance_x = distance1 + distance_corr_x;\n\n  xy_distance = distance_x * corrections.cos_vert_correction;\n  \/\/ xy_distance = distance_x * cos_vert_correction - vert_offset *\n  \/\/ sin_vert_correction;\n\n  x = xy_distance * sin_rot_angle -\n      corrections.horiz_offset_correction * cos_rot_angle;\n\n  double distance_y = distance1 + distance_corr_y;\n  xy_distance = distance_y * corrections.cos_vert_correction;\n  \/\/ xy_distance = distance_y * cos_vert_correction - vert_offset *\n  \/\/ sin_vert_correction;\n  y = xy_distance * cos_rot_angle +\n      corrections.horiz_offset_correction * sin_rot_angle;\n\n  z = distance * corrections.sin_vert_correction +\n      corrections.vert_offset_correction;\n  \/\/ z = distance * sin_vert_correction + vert_offset * cos_vert_correction;\n\n  \/** Use standard ROS coordinate system (right-hand rule) *\/\n  point.x = float(y);\n  point.y = float(-x);\n  point.z = float(z);\n}\n\nVelodyneParser *VelodyneParserFactory::create_parser(Config config) {\n  if (config.model == \"VLP16\") {\n    config.calibration_online = false;\n    return new Velodyne16Parser(config);\n  } else if (config.model == \"64E_S2\" || config.model == \"64E_S3S\" ||\n             config.model == \"64E_S3D_STRONGEST\" ||\n             config.model == \"64E_S3D_LAST\" || config.model == \"64E_S3D_DUAL\") {\n    return new Velodyne64Parser(config);\n  } else {\n    ROS_ERROR_STREAM(\"invalid model, must be 64E_S2|64E_S3S\"\n                     << \"|64E_S3D_STRONGEST|64E_S3D_LAST|64E_S3D_DUAL\");\n    return nullptr;\n  }\n}\n\n}  \/\/ namespace velodyne\n}  \/\/ namespace drivers\n}  \/\/ namespace apollo\n<commit_msg>fix sercurity issues in driver<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 \"velodyne_pointcloud\/velodyne_parser.h\"\n\n#include <pcl\/common\/time.h>\n#include <ros\/package.h>\n#include <ros\/ros.h>\n\n#include \"velodyne_pointcloud\/util.h\"\n\nnamespace apollo {\nnamespace drivers {\nnamespace velodyne {\n\ndouble VelodyneParser::get_gps_stamp(double current_packet_stamp,\n                                     double &previous_packet_stamp,\n                                     uint64_t &gps_base_usec) {\n  if (current_packet_stamp < previous_packet_stamp) {\n    \/\/ plus 3600 when large jump back, discard little jump back for wrong time\n    \/\/ in lidar\n    if (std::abs(previous_packet_stamp - current_packet_stamp) > 3599000000) {\n      gps_base_usec += 3600 * 1e6;\n      ROS_INFO_STREAM(\"Base time plus 3600s. Model: \"\n                      << config_.model << std::fixed\n                      << \". current:\" << current_packet_stamp\n                      << \", last time:\" << previous_packet_stamp);\n    } else {\n      ROS_WARN_STREAM(\"Currrnt stamp:\" << std::fixed << current_packet_stamp\n                                       << \" less than previous stamp:\"\n                                       << previous_packet_stamp\n                                       << \". GPS time stamp maybe incorrect!\");\n    }\n  } else if (previous_packet_stamp != 0 &&\n             current_packet_stamp - previous_packet_stamp > 100000) {  \/\/ 100ms\n    ROS_ERROR_STREAM(\"Current stamp:\"\n                     << std::fixed << current_packet_stamp\n                     << \" ahead previous stamp:\" << previous_packet_stamp\n                     << \" over 100ms. GPS time stamp incorrect!\");\n  }\n\n  previous_packet_stamp = current_packet_stamp;\n  double gps_stamp = gps_base_usec + current_packet_stamp;\n\n  gps_stamp \/= 1e6;\n  return gps_stamp;\n}\n\nVPoint VelodyneParser::get_nan_point(double timestamp) {\n  VPoint nan_point;\n  nan_point.timestamp = timestamp;\n  nan_point.x = nan;\n  nan_point.y = nan;\n  nan_point.z = nan;\n  nan_point.intensity = 0;\n  return nan_point;\n}\n\nVelodyneParser::VelodyneParser(Config config)\n    : last_time_stamp_(0), config_(config), mode_(STRONGEST) {}\n\nvoid VelodyneParser::init_angle_params(double view_direction,\n                                       double view_width) {\n  \/\/ converting angle parameters into the velodyne reference (rad)\n  double tmp_min_angle = view_direction + view_width \/ 2;\n  double tmp_max_angle = view_direction - view_width \/ 2;\n\n  \/\/ computing positive modulo to keep theses angles into [0;2*M_PI]\n  tmp_min_angle = fmod(fmod(tmp_min_angle, 2 * M_PI) + 2 * M_PI, 2 * M_PI);\n  tmp_max_angle = fmod(fmod(tmp_max_angle, 2 * M_PI) + 2 * M_PI, 2 * M_PI);\n\n  \/\/ converting into the hardware velodyne ref (negative yaml and degrees)\n  \/\/ adding 0.5 perfomrs a centered double to int conversion\n  config_.min_angle = 100 * (2 * M_PI - tmp_min_angle) * 180 \/ M_PI + 0.5;\n  config_.max_angle = 100 * (2 * M_PI - tmp_max_angle) * 180 \/ M_PI + 0.5;\n  if (config_.min_angle == config_.max_angle) {\n    \/\/ avoid returning empty cloud if min_angle = max_angle\n    config_.min_angle = 0;\n    config_.max_angle = 36000;\n  }\n}\n\n\/** Set up for on-line operation. *\/\nvoid VelodyneParser::setup() {\n  if (!config_.calibration_online) {\n    calibration_.read(config_.calibration_file);\n\n    if (!calibration_.initialized_) {\n      ROS_FATAL_STREAM(\n          \"Unable to open calibration file: \" << config_.calibration_file);\n      ROS_BREAK();\n    }\n  }\n\n  \/\/ setup angle parameters.\n  init_angle_params(config_.view_direction, config_.view_width);\n  init_sin_cos_rot_table(sin_rot_table_, cos_rot_table_, ROTATION_MAX_UNITS,\n                         ROTATION_RESOLUTION);\n}\n\nbool VelodyneParser::is_scan_valid(int rotation, float range) {\n  \/\/ check range first\n  if (range < config_.min_range || range > config_.max_range) {\n    return false;\n  }\n  \/\/ condition added to avoid calculating points which are not\n  \/\/ in the interesting defined area (min_angle < area < max_angle)\n  \/\/ not used now\n  \/\/ if ((config_.min_angle > config_.max_angle && (rotation <=\n  \/\/ config_.max_angle || rotation >= config_.min_angle))\n  \/\/     || (config_.min_angle < config_.max_angle && rotation >=\n  \/\/     config_.min_angle\n  \/\/         && rotation <= config_.max_angle)) {\n  \/\/     return true;\n  \/\/ }\n  return true;\n}\n\nvoid VelodyneParser::compute_coords(const union RawDistance &raw_distance,\n                                    const LaserCorrection &corrections,\n                                    const uint16_t &rotation, VPoint &point) {\n  ROS_ASSERT_MSG(rotation < 36000, \"rotation must between 0 and 35999\");\n  double x = 0.0;\n  double y = 0.0;\n  double z = 0.0;\n\n  double distance1 = raw_distance.raw_distance * DISTANCE_RESOLUTION;\n  double distance = distance1 + corrections.dist_correction;\n\n  \/\/ cos(a-b) = cos(a)*cos(b) + sin(a)*sin(b)\n  \/\/ sin(a-b) = sin(a)*cos(b) - cos(a)*sin(b)\n  double cos_rot_angle =\n      cos_rot_table_[rotation] * corrections.cos_rot_correction +\n      sin_rot_table_[rotation] * corrections.sin_rot_correction;\n  double sin_rot_angle =\n      sin_rot_table_[rotation] * corrections.cos_rot_correction -\n      cos_rot_table_[rotation] * corrections.sin_rot_correction;\n\n  double vert_offset = corrections.vert_offset_correction;\n\n  \/\/ Compute the distance in the xy plane (w\/o accounting for rotation)\n  double xy_distance = distance * corrections.cos_vert_correction;\n\n  \/\/ Calculate temporal X, use absolute value.\n  double xx = fabs(xy_distance * sin_rot_angle -\n                   corrections.horiz_offset_correction * cos_rot_angle);\n  \/\/ Calculate temporal Y, use absolute value\n  double yy = fabs(xy_distance * cos_rot_angle +\n                   corrections.horiz_offset_correction * sin_rot_angle);\n\n  \/\/ Get 2points calibration values,Linear interpolation to get distance\n  \/\/ correction for X and Y, that means distance correction use\n  \/\/ different value at different distance\n  double distance_corr_x = 0;\n  double distance_corr_y = 0;\n\n  if (need_two_pt_correction_ && distance1 <= 2500) {\n    distance_corr_x =\n        (corrections.dist_correction - corrections.dist_correction_x) *\n            (xx - 2.4) \/ 22.64 +\n        corrections.dist_correction_x;  \/\/ 22.64 = 25.04 - 2.4\n    distance_corr_y =\n        (corrections.dist_correction - corrections.dist_correction_y) *\n            (yy - 1.93) \/ 23.11 +\n        corrections.dist_correction_y;  \/\/ 23.11 = 25.04 - 1.93\n  } else {\n    distance_corr_x = distance_corr_y = corrections.dist_correction;\n  }\n\n  double distance_x = distance1 + distance_corr_x;\n\n  xy_distance = distance_x * corrections.cos_vert_correction;\n  \/\/ xy_distance = distance_x * cos_vert_correction - vert_offset *\n  \/\/ sin_vert_correction;\n\n  x = xy_distance * sin_rot_angle -\n      corrections.horiz_offset_correction * cos_rot_angle;\n\n  double distance_y = distance1 + distance_corr_y;\n  xy_distance = distance_y * corrections.cos_vert_correction;\n  \/\/ xy_distance = distance_y * cos_vert_correction - vert_offset *\n  \/\/ sin_vert_correction;\n  y = xy_distance * cos_rot_angle +\n      corrections.horiz_offset_correction * sin_rot_angle;\n\n  z = distance * corrections.sin_vert_correction +\n      corrections.vert_offset_correction;\n  \/\/ z = distance * sin_vert_correction + vert_offset * cos_vert_correction;\n\n  \/** Use standard ROS coordinate system (right-hand rule) *\/\n  point.x = float(y);\n  point.y = float(-x);\n  point.z = float(z);\n}\n\nVelodyneParser *VelodyneParserFactory::create_parser(Config config) {\n  if (config.model == \"VLP16\") {\n    config.calibration_online = false;\n    return new Velodyne16Parser(config);\n  } else if (config.model == \"64E_S2\" || config.model == \"64E_S3S\" ||\n             config.model == \"64E_S3D_STRONGEST\" ||\n             config.model == \"64E_S3D_LAST\" || config.model == \"64E_S3D_DUAL\") {\n    return new Velodyne64Parser(config);\n  } else {\n    ROS_ERROR_STREAM(\"invalid model, must be 64E_S2|64E_S3S\"\n                     << \"|64E_S3D_STRONGEST|64E_S3D_LAST|64E_S3D_DUAL\");\n    return nullptr;\n  }\n}\n\n}  \/\/ namespace velodyne\n}  \/\/ namespace drivers\n}  \/\/ namespace apollo\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Fixed a small problem with our graph panel.<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>convert svtools\/source\/urlobj\/* from String to OUString<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: inetimg.cxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 16:57: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#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n\n#ifndef _SOT_FORMATS_HXX\n#include <sot\/formats.hxx>\n#endif\n#ifndef _STREAM_HXX\n#include <tools\/stream.hxx>\n#endif\n\n#ifndef GCC\n#pragma hdrstop\n#endif\n\n#include \"inetimg.hxx\"\n\n#define TOKEN_SEPARATOR '\\001'\n\nsal_Bool INetImage::Write( SvStream& rOStm, ULONG nFormat ) const\n{\n    sal_Bool bRet = sal_False;\n    switch( nFormat )\n    {\n    case SOT_FORMATSTR_ID_INET_IMAGE:\n        {\n            String sString;\n            (sString += aImageURL ) += TOKEN_SEPARATOR;\n            (sString += aTargetURL ) += TOKEN_SEPARATOR;\n            (sString += aTargetFrame ) += TOKEN_SEPARATOR;\n            (sString += aAlternateText ) += TOKEN_SEPARATOR;\n            sString += String::CreateFromInt32( aSizePixel.Width() );\n            sString += TOKEN_SEPARATOR;\n            sString += String::CreateFromInt32( aSizePixel.Height() );\n            ByteString sOut( sString, RTL_TEXTENCODING_UTF8 );\n\n            rOStm.Write( sOut.GetBuffer(), sOut.Len() );\n            static const sal_Char aEndChar[2] = { 0 };\n            rOStm.Write( aEndChar, sizeof( aEndChar ));\n            bRet = 0 == rOStm.GetError();\n        }\n        break;\n\n    case SOT_FORMATSTR_ID_NETSCAPE_IMAGE:\n        break;\n    }\n    return bRet;\n}\n\nsal_Bool INetImage::Read( SvStream& rIStm, ULONG nFormat )\n{\n    sal_Bool bRet = sal_False;\n    switch( nFormat )\n    {\n    case SOT_FORMATSTR_ID_INET_IMAGE:\n        {\n            String sINetImg;\n            rIStm.ReadCString( sINetImg, RTL_TEXTENCODING_UTF8 );\n            xub_StrLen nStart = 0;\n            aImageURL = sINetImg.GetToken( 0, TOKEN_SEPARATOR, nStart );\n            aTargetURL = sINetImg.GetToken( 0, TOKEN_SEPARATOR, nStart );\n            aTargetFrame = sINetImg.GetToken( 0, TOKEN_SEPARATOR, nStart );\n            aAlternateText = sINetImg.GetToken( 0, TOKEN_SEPARATOR, nStart );\n            aSizePixel.Width() = sINetImg.GetToken( 0, TOKEN_SEPARATOR,\n                                                    nStart ).ToInt32();\n            aSizePixel.Height() = sINetImg.GetToken( 0, TOKEN_SEPARATOR,\n                                                    nStart ).ToInt32();\n            bRet = 0 != sINetImg.Len();\n        }\n        break;\n\n    case SOT_FORMATSTR_ID_NETSCAPE_IMAGE:\n        {\n\/*\n    --> structure size  MUST - alignment of 4!\n    int     iSize;              \/\/ size of all data, including variable length strings\n    BOOL    bIsMap;             \/\/ For server side maps\n    INT32   iWidth;             \/\/ Fixed size data correspond to fields in LO_ImageDataStruct\n    INT32   iHeight;            \/\/   and EDT_ImageData\n    INT32   iHSpace;\n    INT32   iVSpace;\n    INT32   iBorder;\n    int     iLowResOffset;      \/\/ Offsets into string_data. If 0, string is NULL (not used)\n    int     iAltOffset;         \/\/ (alternate text?)\n    int     iAnchorOffset;      \/\/ HREF in image\n    int     iExtraHTML_Offset;  \/\/ Extra HTML (stored in CImageElement)\n    sal_Char pImageURL[1];      \/\/ Append all variable-length strings starting here\n*\/\n            rtl_TextEncoding eSysCSet = gsl_getSystemTextEncoding();\n            sal_Int32 nVal, nAnchorOffset, nAltOffset, nFilePos;\n            ByteString sData;\n\n            nFilePos = rIStm.Tell();\n            \/\/ skip over iSize (int), bIsMao ( BOOL ) alignment of 4 !!!!\n            rIStm.SeekRel( 8 );\n            rIStm >> nVal;  aSizePixel.Width() = nVal;\n            rIStm >> nVal;  aSizePixel.Height() = nVal;\n            \/\/ skip over iHSpace, iVSpace, iBorder, iLowResOffset\n            rIStm.SeekRel( 3 * sizeof( INT32 ) + sizeof( int ) );\n            rIStm >> nAltOffset;\n            rIStm >> nAnchorOffset;\n            \/\/ skip over iExtraHTML_Offset\n            rIStm.SeekRel( sizeof( int ) );\n\n            rIStm.ReadCString( aImageURL, eSysCSet );\n            if( nAltOffset )\n            {\n                rIStm.Seek( nFilePos + nAltOffset );\n                rIStm.ReadCString( aAlternateText, eSysCSet );\n            }\n            else if( aAlternateText.Len() )\n                aAlternateText.Erase();\n\n            if( nAnchorOffset )\n            {\n                rIStm.Seek( nFilePos + nAnchorOffset );\n                rIStm.ReadCString( aTargetURL, eSysCSet );\n            }\n            else if( aTargetURL.Len() )\n                aTargetURL.Erase();\n\n            bRet = 0 == rIStm.GetError();\n        }\n        break;\n    }\n    return bRet;\n}\n\n<commit_msg>INTEGRATION: CWS pchfix02 (1.9.326); FILE MERGED 2006\/09\/01 17:43:34 kaib 1.9.326.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: inetimg.cxx,v $\n *\n *  $Revision: 1.10 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 15: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_svtools.hxx\"\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n\n#ifndef _SOT_FORMATS_HXX\n#include <sot\/formats.hxx>\n#endif\n#ifndef _STREAM_HXX\n#include <tools\/stream.hxx>\n#endif\n\n#ifndef GCC\n#endif\n\n#include \"inetimg.hxx\"\n\n#define TOKEN_SEPARATOR '\\001'\n\nsal_Bool INetImage::Write( SvStream& rOStm, ULONG nFormat ) const\n{\n    sal_Bool bRet = sal_False;\n    switch( nFormat )\n    {\n    case SOT_FORMATSTR_ID_INET_IMAGE:\n        {\n            String sString;\n            (sString += aImageURL ) += TOKEN_SEPARATOR;\n            (sString += aTargetURL ) += TOKEN_SEPARATOR;\n            (sString += aTargetFrame ) += TOKEN_SEPARATOR;\n            (sString += aAlternateText ) += TOKEN_SEPARATOR;\n            sString += String::CreateFromInt32( aSizePixel.Width() );\n            sString += TOKEN_SEPARATOR;\n            sString += String::CreateFromInt32( aSizePixel.Height() );\n            ByteString sOut( sString, RTL_TEXTENCODING_UTF8 );\n\n            rOStm.Write( sOut.GetBuffer(), sOut.Len() );\n            static const sal_Char aEndChar[2] = { 0 };\n            rOStm.Write( aEndChar, sizeof( aEndChar ));\n            bRet = 0 == rOStm.GetError();\n        }\n        break;\n\n    case SOT_FORMATSTR_ID_NETSCAPE_IMAGE:\n        break;\n    }\n    return bRet;\n}\n\nsal_Bool INetImage::Read( SvStream& rIStm, ULONG nFormat )\n{\n    sal_Bool bRet = sal_False;\n    switch( nFormat )\n    {\n    case SOT_FORMATSTR_ID_INET_IMAGE:\n        {\n            String sINetImg;\n            rIStm.ReadCString( sINetImg, RTL_TEXTENCODING_UTF8 );\n            xub_StrLen nStart = 0;\n            aImageURL = sINetImg.GetToken( 0, TOKEN_SEPARATOR, nStart );\n            aTargetURL = sINetImg.GetToken( 0, TOKEN_SEPARATOR, nStart );\n            aTargetFrame = sINetImg.GetToken( 0, TOKEN_SEPARATOR, nStart );\n            aAlternateText = sINetImg.GetToken( 0, TOKEN_SEPARATOR, nStart );\n            aSizePixel.Width() = sINetImg.GetToken( 0, TOKEN_SEPARATOR,\n                                                    nStart ).ToInt32();\n            aSizePixel.Height() = sINetImg.GetToken( 0, TOKEN_SEPARATOR,\n                                                    nStart ).ToInt32();\n            bRet = 0 != sINetImg.Len();\n        }\n        break;\n\n    case SOT_FORMATSTR_ID_NETSCAPE_IMAGE:\n        {\n\/*\n    --> structure size  MUST - alignment of 4!\n    int     iSize;              \/\/ size of all data, including variable length strings\n    BOOL    bIsMap;             \/\/ For server side maps\n    INT32   iWidth;             \/\/ Fixed size data correspond to fields in LO_ImageDataStruct\n    INT32   iHeight;            \/\/   and EDT_ImageData\n    INT32   iHSpace;\n    INT32   iVSpace;\n    INT32   iBorder;\n    int     iLowResOffset;      \/\/ Offsets into string_data. If 0, string is NULL (not used)\n    int     iAltOffset;         \/\/ (alternate text?)\n    int     iAnchorOffset;      \/\/ HREF in image\n    int     iExtraHTML_Offset;  \/\/ Extra HTML (stored in CImageElement)\n    sal_Char pImageURL[1];      \/\/ Append all variable-length strings starting here\n*\/\n            rtl_TextEncoding eSysCSet = gsl_getSystemTextEncoding();\n            sal_Int32 nVal, nAnchorOffset, nAltOffset, nFilePos;\n            ByteString sData;\n\n            nFilePos = rIStm.Tell();\n            \/\/ skip over iSize (int), bIsMao ( BOOL ) alignment of 4 !!!!\n            rIStm.SeekRel( 8 );\n            rIStm >> nVal;  aSizePixel.Width() = nVal;\n            rIStm >> nVal;  aSizePixel.Height() = nVal;\n            \/\/ skip over iHSpace, iVSpace, iBorder, iLowResOffset\n            rIStm.SeekRel( 3 * sizeof( INT32 ) + sizeof( int ) );\n            rIStm >> nAltOffset;\n            rIStm >> nAnchorOffset;\n            \/\/ skip over iExtraHTML_Offset\n            rIStm.SeekRel( sizeof( int ) );\n\n            rIStm.ReadCString( aImageURL, eSysCSet );\n            if( nAltOffset )\n            {\n                rIStm.Seek( nFilePos + nAltOffset );\n                rIStm.ReadCString( aAlternateText, eSysCSet );\n            }\n            else if( aAlternateText.Len() )\n                aAlternateText.Erase();\n\n            if( nAnchorOffset )\n            {\n                rIStm.Seek( nFilePos + nAnchorOffset );\n                rIStm.ReadCString( aTargetURL, eSysCSet );\n            }\n            else if( aTargetURL.Len() )\n                aTargetURL.Erase();\n\n            bRet = 0 == rIStm.GetError();\n        }\n        break;\n    }\n    return bRet;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: recoveryui.cxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: ihi $ $Date: 2007-04-19 09:18: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_svx.hxx\"\n\n\/\/===============================================\n\/\/ includes\n\n#ifndef _RECOVERYUI_HXX\n#include \"recoveryui.hxx\"\n#endif\n\n#ifndef _SVX_DOCRECOVERY_HXX\n#include \"docrecovery.hxx\"\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_XINITIALIZATION_HPP_\n#include <com\/sun\/star\/lang\/XInitialization.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_FRAME_XFRAMESSUPPLIER_HPP_\n#include <com\/sun\/star\/frame\/XFramesSupplier.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 _OSL_FILE_HXX_\n#include <osl\/file.hxx>\n#endif\n\n#ifndef _RTL_BOOTSTRAP_HXX_\n#include <rtl\/bootstrap.hxx>\n#endif\n\n#ifndef _COMPHELPER_CONFIGURATIONHELPER_HXX_\n#include <comphelper\/configurationhelper.hxx>\n#endif\n\n#include <vcl\/svapp.hxx>\n\n\/\/===============================================\n\/\/ const\n\n#define IMPLEMENTATIONNAME_RECOVERYUI       ::rtl::OUString::createFromAscii(\"com.sun.star.comp.svx.RecoveryUI\")\n#define SERVICENAME_RECOVERYUI              ::rtl::OUString::createFromAscii(\"com.sun.star.dialog.RecoveryUI\")\n\n\/\/===============================================\n\/\/ namespace\n\nnamespace svx\n{\n\nnamespace css   = ::com::sun::star;\nnamespace svxdr = ::svx::DocRecovery;\n\nusing namespace ::rtl;\nusing namespace ::osl;\n\n\/\/===============================================\nRecoveryUI::RecoveryUI(const css::uno::Reference< css::lang::XMultiServiceFactory >& xSMGR)\n    : m_xSMGR        (xSMGR                    )\n    , m_pParentWindow(0                        )\n    , m_eJob         (RecoveryUI::E_JOB_UNKNOWN)\n{\n}\n\n\/\/===============================================\nRecoveryUI::~RecoveryUI()\n{\n}\n\n\/\/===============================================\n::rtl::OUString SAL_CALL RecoveryUI::getImplementationName()\n    throw(css::uno::RuntimeException)\n{\n    return RecoveryUI::st_getImplementationName();\n}\n\n\/\/===============================================\nsal_Bool SAL_CALL RecoveryUI::supportsService(const ::rtl::OUString& sServiceName)\n    throw(css::uno::RuntimeException)\n{\n    const css::uno::Sequence< ::rtl::OUString > lServices = RecoveryUI::st_getSupportedServiceNames();\n          sal_Int32                             c         = lServices.getLength();\n          sal_Int32                             i         = 0;\n    for (i=0; i<c; ++i)\n    {\n        const ::rtl::OUString& sSupportedService = lServices[i];\n        if (sSupportedService.equals(sServiceName))\n            return sal_True;\n    }\n    return sal_False;\n}\n\n\/\/===============================================\ncss::uno::Sequence< ::rtl::OUString > SAL_CALL RecoveryUI::getSupportedServiceNames()\n    throw(css::uno::RuntimeException)\n{\n    return RecoveryUI::st_getSupportedServiceNames();\n}\n\n\/\/===============================================\ncss::uno::Any SAL_CALL RecoveryUI::dispatchWithReturnValue(const css::util::URL& aURL,\n                                                   const css::uno::Sequence< css::beans::PropertyValue >& )\n    throw(css::uno::RuntimeException)\n{\n    \/\/ Internaly we use VCL ... every call into vcl based code must\n    \/\/ be guarded by locking the global solar mutex.\n    ::vos::OGuard aSolarLock(&Application::GetSolarMutex());\n\n    css::uno::Any aRet;\n    RecoveryUI::EJob eJob = impl_classifyJob(aURL);\n    \/\/ TODO think about outside arguments\n\n    switch(eJob)\n    {\n        case RecoveryUI::E_DO_EMERGENCY_SAVE :\n        {\n            sal_Bool bRet = impl_doEmergencySave();\n            aRet <<= bRet;\n            break;\n        }\n\n        case RecoveryUI::E_DO_RECOVERY :\n            impl_doRecovery();\n            break;\n\n        case RecoveryUI::E_DO_CRASHREPORT :\n            impl_doCrashReport();\n            break;\n\n        default :\n            break;\n    }\n\n    return aRet;\n}\n\n\/\/===============================================\nvoid SAL_CALL RecoveryUI::dispatch(const css::util::URL&                                  aURL      ,\n                                   const css::uno::Sequence< css::beans::PropertyValue >& lArguments)\n    throw(css::uno::RuntimeException)\n{\n    \/\/ recycle this method :-)\n    dispatchWithReturnValue(aURL, lArguments);\n}\n\n\/\/===============================================\nvoid SAL_CALL RecoveryUI::addStatusListener(const css::uno::Reference< css::frame::XStatusListener >&, const css::util::URL& ) throw(css::uno::RuntimeException)\n{\n    \/\/ TODO\n    OSL_ENSURE(sal_False, \"RecoveryUI::addStatusListener()\\nNot implemented yet!\");\n}\n\n\/\/===============================================\nvoid SAL_CALL RecoveryUI::removeStatusListener(const css::uno::Reference< css::frame::XStatusListener >&, const css::util::URL& )\n    throw(css::uno::RuntimeException)\n{\n    \/\/ TODO\n    OSL_ENSURE(sal_False, \"RecoveryUI::removeStatusListener()\\nNot implemented yet!\");\n}\n\n\/\/===============================================\n::rtl::OUString RecoveryUI::st_getImplementationName()\n{\n    static ::rtl::OUString IMPLEMENTATIONNAME = IMPLEMENTATIONNAME_RECOVERYUI;\n    return IMPLEMENTATIONNAME;\n}\n\n\/\/===============================================\ncss::uno::Sequence< ::rtl::OUString > RecoveryUI::st_getSupportedServiceNames()\n{\n    css::uno::Sequence< ::rtl::OUString > lServiceNames(1);    lServiceNames.getArray() [0] = SERVICENAME_RECOVERYUI;\n    return lServiceNames;\n}\n\n\/\/===============================================\ncss::uno::Reference< css::uno::XInterface > SAL_CALL RecoveryUI::st_createInstance(const css::uno::Reference< css::lang::XMultiServiceFactory >& xSMGR)\n{\n    RecoveryUI* pNew = new RecoveryUI(xSMGR);\n    return css::uno::Reference< css::uno::XInterface >(static_cast< css::lang::XServiceInfo* >(pNew));\n}\n\n\/\/===============================================\n\nstatic OUString GetCrashConfigDir()\n{\n\n#ifdef WNT\n    OUString    ustrValue = OUString::createFromAscii(\"${$SYSBINDIR\/bootstrap.ini:UserInstallation}\");\n#else\n    OUString    ustrValue = OUString::createFromAscii(\"$SYSUSERCONFIG\");\n#endif\n    Bootstrap::expandMacros( ustrValue );\n\n#ifdef WNT\n    ustrValue += OUString::createFromAscii(\"\/user\/crashdata\");\n#endif\n    return ustrValue;\n}\n\n\/\/===============================================\n\n#ifdef WNT\n#define LCKFILE \"crashdat.lck\"\n#else\n#define LCKFILE \".crash_report_unsent\"\n#endif\n\n\nstatic OUString GetUnsentURL()\n{\n    OUString    aURL = GetCrashConfigDir();\n\n    aURL += OUString( RTL_CONSTASCII_USTRINGPARAM( \"\/\" ) );\n    aURL += OUString( RTL_CONSTASCII_USTRINGPARAM( LCKFILE ) );\n\n    return aURL;\n}\n\n\/\/===============================================\n\nstatic bool new_crash_pending()\n{\n    OUString    aUnsentURL = GetUnsentURL();\n    File    aFile( aUnsentURL );\n\n    if ( FileBase::E_None == aFile.open( OpenFlag_Read ) )\n    {\n        aFile.close();\n        return true;\n    }\n\n    return false;\n}\n\/\/===============================================\n\nstatic bool delete_pending_crash()\n{\n    OUString    aUnsentURL = GetUnsentURL();\n    return ( FileBase::E_None == File::remove( aUnsentURL ) );\n}\n\nRecoveryUI::EJob RecoveryUI::impl_classifyJob(const css::util::URL& aURL)\n{\n    m_eJob = RecoveryUI::E_JOB_UNKNOWN;\n    if (aURL.Protocol.equals(RECOVERY_CMDPART_PROTOCOL))\n    {\n        if (aURL.Path.equals(RECOVERY_CMDPART_DO_EMERGENCY_SAVE))\n            m_eJob = RecoveryUI::E_DO_EMERGENCY_SAVE;\n        else\n        if (aURL.Path.equals(RECOVERY_CMDPART_DO_RECOVERY))\n            m_eJob = RecoveryUI::E_DO_RECOVERY;\n        else\n        if (aURL.Path.equals(RECOVERY_CMDPART_DO_CRASHREPORT))\n            m_eJob = RecoveryUI::E_DO_CRASHREPORT;\n    }\n\n    return m_eJob;\n}\n\n\/\/===============================================\nsal_Bool RecoveryUI::impl_doEmergencySave()\n{\n    \/\/ create core service, which implements the real \"emergency save\" algorithm.\n    svxdr::RecoveryCore* pCore = new svxdr::RecoveryCore(m_xSMGR, sal_True);\n    css::uno::Reference< css::frame::XStatusListener > xCore(pCore);\n\n    \/\/ create all needed dialogs for this operation\n    \/\/ and bind it to the used core service\n    svxdr::TabDialog4Recovery* pWizard = new svxdr::TabDialog4Recovery(m_pParentWindow);\n    svxdr::IExtendedTabPage*   pPage1  = new svxdr::SaveDialog        (pWizard, pCore );\n    pWizard->addTabPage(pPage1);\n\n    \/\/ start the wizard\n    short nRet = pWizard->Execute();\n\n    delete pPage1 ;\n    delete pWizard;\n\n    return (nRet==DLG_RET_OK_AUTOLUNCH);\n}\n\n\/\/===============================================\nvoid RecoveryUI::impl_doRecovery()\n{\n    sal_Bool bRecoveryOnly( sal_False );\n\n    ::rtl::OUString CFG_PACKAGE_RECOVERY( RTL_CONSTASCII_USTRINGPARAM  ( \"org.openoffice.Office.Recovery\/\" ));\n    ::rtl::OUString CFG_PATH_CRASHREPORTER( RTL_CONSTASCII_USTRINGPARAM( \"CrashReporter\"                 ));\n    ::rtl::OUString CFG_ENTRY_ENABLED( RTL_CONSTASCII_USTRINGPARAM     ( \"Enabled\"                       ));\n\n    sal_Bool bCrashRepEnabled( sal_True );\n    css::uno::Any aVal = ::comphelper::ConfigurationHelper::readDirectKey(\n                                m_xSMGR,\n                                CFG_PACKAGE_RECOVERY,\n                                CFG_PATH_CRASHREPORTER,\n                                CFG_ENTRY_ENABLED,\n                                ::comphelper::ConfigurationHelper::E_READONLY);\n    aVal >>= bCrashRepEnabled;\n    bRecoveryOnly = !bCrashRepEnabled;\n\n    \/\/ create core service, which implements the real \"emergency save\" algorithm.\n    svxdr::RecoveryCore* pCore = new svxdr::RecoveryCore(m_xSMGR, sal_False);\n    css::uno::Reference< css::frame::XStatusListener > xCore(pCore);\n\n    \/\/ create all needed dialogs for this operation\n    \/\/ and bind it to the used core service\n    svxdr::TabDialog4Recovery* pWizard = new svxdr::TabDialog4Recovery   (m_pParentWindow);\n    svxdr::IExtendedTabPage*   pPage1  = new svxdr::RecoveryDialog       (pWizard, pCore );\n    svxdr::IExtendedTabPage*   pPage2  = 0;\n    svxdr::IExtendedTabPage*   pPage3  = 0;\n\n    pWizard->addTabPage(pPage1);\n    if ( !bRecoveryOnly && new_crash_pending() )\n    {\n        pPage2 = new svxdr::ErrorRepWelcomeDialog(pWizard        );\n        pPage3 = new svxdr::ErrorRepSendDialog   (pWizard        );\n        pWizard->addTabPage(pPage2);\n        pWizard->addTabPage(pPage3);\n    }\n\n    \/\/ start the wizard\n    pWizard->Execute();\n\n    impl_showAllRecoveredDocs();\n\n    delete pPage3 ;\n    delete pPage2 ;\n    delete pPage1 ;\n    delete pWizard;\n\n    delete_pending_crash();\n}\n\n\/\/===============================================\n\nvoid RecoveryUI::impl_doCrashReport()\n{\n    if ( new_crash_pending() )\n    {\n        svxdr::TabDialog4Recovery* pWizard = new svxdr::TabDialog4Recovery   (m_pParentWindow   );\n        svxdr::IExtendedTabPage*   pPage1  = new svxdr::ErrorRepWelcomeDialog(pWizard, sal_False);\n        svxdr::IExtendedTabPage*   pPage2  = new svxdr::ErrorRepSendDialog   (pWizard           );\n        pWizard->addTabPage(pPage1);\n        pWizard->addTabPage(pPage2);\n\n        \/\/ start the wizard\n        pWizard->Execute();\n\n        delete pPage2 ;\n        delete pPage1 ;\n        delete pWizard;\n\n        delete_pending_crash();\n    }\n}\n\n\/\/===============================================\nvoid RecoveryUI::impl_showAllRecoveredDocs()\n{\n    css::uno::Reference< css::frame::XFramesSupplier > xDesktop(\n        m_xSMGR->createInstance(SERVICENAME_DESKTOP),\n        css::uno::UNO_QUERY_THROW);\n\n    css::uno::Reference< css::container::XIndexAccess > xTaskContainer(\n        xDesktop->getFrames(),\n        css::uno::UNO_QUERY_THROW);\n\n    sal_Int32 c = xTaskContainer->getCount();\n    sal_Int32 i = 0;\n    for (i=0; i<c; ++i)\n    {\n        try\n        {\n            css::uno::Reference< css::frame::XFrame > xTask;\n            xTaskContainer->getByIndex(i) >>= xTask;\n            if (!xTask.is())\n                continue;\n\n            css::uno::Reference< css::awt::XWindow > xWindow = xTask->getContainerWindow();\n            if (!xWindow.is())\n                continue;\n\n            xWindow->setVisible(sal_True);\n        }\n        catch(const css::uno::RuntimeException& exRun)\n            { throw exRun; }\n        catch(const css::uno::Exception&)\n            { continue; }\n    }\n}\n\n} \/\/ namespace svx\n<commit_msg>INTEGRATION: CWS os2port02 (1.9.232); FILE MERGED 2007\/10\/04 19:44:53 ydario 1.9.232.1: Issue number: i82034 Submitted by: ydario Reviewed by:  ydario Commit of changes for OS\/2 CWS source code integration.<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: recoveryui.cxx,v $\n *\n *  $Revision: 1.10 $\n *\n *  last change: $Author: hr $ $Date: 2007-11-02 12:20:22 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_svx.hxx\"\n\n\/\/===============================================\n\/\/ includes\n\n#ifndef _RECOVERYUI_HXX\n#include \"recoveryui.hxx\"\n#endif\n\n#ifndef _SVX_DOCRECOVERY_HXX\n#include \"docrecovery.hxx\"\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_XINITIALIZATION_HPP_\n#include <com\/sun\/star\/lang\/XInitialization.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_FRAME_XFRAMESSUPPLIER_HPP_\n#include <com\/sun\/star\/frame\/XFramesSupplier.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 _OSL_FILE_HXX_\n#include <osl\/file.hxx>\n#endif\n\n#ifndef _RTL_BOOTSTRAP_HXX_\n#include <rtl\/bootstrap.hxx>\n#endif\n\n#ifndef _COMPHELPER_CONFIGURATIONHELPER_HXX_\n#include <comphelper\/configurationhelper.hxx>\n#endif\n\n#include <vcl\/svapp.hxx>\n\n\/\/===============================================\n\/\/ const\n\n#define IMPLEMENTATIONNAME_RECOVERYUI       ::rtl::OUString::createFromAscii(\"com.sun.star.comp.svx.RecoveryUI\")\n#define SERVICENAME_RECOVERYUI              ::rtl::OUString::createFromAscii(\"com.sun.star.dialog.RecoveryUI\")\n\n\/\/===============================================\n\/\/ namespace\n\nnamespace svx\n{\n\nnamespace css   = ::com::sun::star;\nnamespace svxdr = ::svx::DocRecovery;\n\nusing namespace ::rtl;\nusing namespace ::osl;\n\n\/\/===============================================\nRecoveryUI::RecoveryUI(const css::uno::Reference< css::lang::XMultiServiceFactory >& xSMGR)\n    : m_xSMGR        (xSMGR                    )\n    , m_pParentWindow(0                        )\n    , m_eJob         (RecoveryUI::E_JOB_UNKNOWN)\n{\n}\n\n\/\/===============================================\nRecoveryUI::~RecoveryUI()\n{\n}\n\n\/\/===============================================\n::rtl::OUString SAL_CALL RecoveryUI::getImplementationName()\n    throw(css::uno::RuntimeException)\n{\n    return RecoveryUI::st_getImplementationName();\n}\n\n\/\/===============================================\nsal_Bool SAL_CALL RecoveryUI::supportsService(const ::rtl::OUString& sServiceName)\n    throw(css::uno::RuntimeException)\n{\n    const css::uno::Sequence< ::rtl::OUString > lServices = RecoveryUI::st_getSupportedServiceNames();\n          sal_Int32                             c         = lServices.getLength();\n          sal_Int32                             i         = 0;\n    for (i=0; i<c; ++i)\n    {\n        const ::rtl::OUString& sSupportedService = lServices[i];\n        if (sSupportedService.equals(sServiceName))\n            return sal_True;\n    }\n    return sal_False;\n}\n\n\/\/===============================================\ncss::uno::Sequence< ::rtl::OUString > SAL_CALL RecoveryUI::getSupportedServiceNames()\n    throw(css::uno::RuntimeException)\n{\n    return RecoveryUI::st_getSupportedServiceNames();\n}\n\n\/\/===============================================\ncss::uno::Any SAL_CALL RecoveryUI::dispatchWithReturnValue(const css::util::URL& aURL,\n                                                   const css::uno::Sequence< css::beans::PropertyValue >& )\n    throw(css::uno::RuntimeException)\n{\n    \/\/ Internaly we use VCL ... every call into vcl based code must\n    \/\/ be guarded by locking the global solar mutex.\n    ::vos::OGuard aSolarLock(&Application::GetSolarMutex());\n\n    css::uno::Any aRet;\n    RecoveryUI::EJob eJob = impl_classifyJob(aURL);\n    \/\/ TODO think about outside arguments\n\n    switch(eJob)\n    {\n        case RecoveryUI::E_DO_EMERGENCY_SAVE :\n        {\n            sal_Bool bRet = impl_doEmergencySave();\n            aRet <<= bRet;\n            break;\n        }\n\n        case RecoveryUI::E_DO_RECOVERY :\n            impl_doRecovery();\n            break;\n\n        case RecoveryUI::E_DO_CRASHREPORT :\n            impl_doCrashReport();\n            break;\n\n        default :\n            break;\n    }\n\n    return aRet;\n}\n\n\/\/===============================================\nvoid SAL_CALL RecoveryUI::dispatch(const css::util::URL&                                  aURL      ,\n                                   const css::uno::Sequence< css::beans::PropertyValue >& lArguments)\n    throw(css::uno::RuntimeException)\n{\n    \/\/ recycle this method :-)\n    dispatchWithReturnValue(aURL, lArguments);\n}\n\n\/\/===============================================\nvoid SAL_CALL RecoveryUI::addStatusListener(const css::uno::Reference< css::frame::XStatusListener >&, const css::util::URL& ) throw(css::uno::RuntimeException)\n{\n    \/\/ TODO\n    OSL_ENSURE(sal_False, \"RecoveryUI::addStatusListener()\\nNot implemented yet!\");\n}\n\n\/\/===============================================\nvoid SAL_CALL RecoveryUI::removeStatusListener(const css::uno::Reference< css::frame::XStatusListener >&, const css::util::URL& )\n    throw(css::uno::RuntimeException)\n{\n    \/\/ TODO\n    OSL_ENSURE(sal_False, \"RecoveryUI::removeStatusListener()\\nNot implemented yet!\");\n}\n\n\/\/===============================================\n::rtl::OUString RecoveryUI::st_getImplementationName()\n{\n    static ::rtl::OUString IMPLEMENTATIONNAME = IMPLEMENTATIONNAME_RECOVERYUI;\n    return IMPLEMENTATIONNAME;\n}\n\n\/\/===============================================\ncss::uno::Sequence< ::rtl::OUString > RecoveryUI::st_getSupportedServiceNames()\n{\n    css::uno::Sequence< ::rtl::OUString > lServiceNames(1);    lServiceNames.getArray() [0] = SERVICENAME_RECOVERYUI;\n    return lServiceNames;\n}\n\n\/\/===============================================\ncss::uno::Reference< css::uno::XInterface > SAL_CALL RecoveryUI::st_createInstance(const css::uno::Reference< css::lang::XMultiServiceFactory >& xSMGR)\n{\n    RecoveryUI* pNew = new RecoveryUI(xSMGR);\n    return css::uno::Reference< css::uno::XInterface >(static_cast< css::lang::XServiceInfo* >(pNew));\n}\n\n\/\/===============================================\n\nstatic OUString GetCrashConfigDir()\n{\n\n#if defined(WNT) || !defined(OS2)\n    OUString    ustrValue = OUString::createFromAscii(\"${$SYSBINDIR\/bootstrap.ini:UserInstallation}\");\n#else\n    OUString    ustrValue = OUString::createFromAscii(\"$SYSUSERCONFIG\");\n#endif\n    Bootstrap::expandMacros( ustrValue );\n\n#if defined(WNT) || !defined(OS2)\n    ustrValue += OUString::createFromAscii(\"\/user\/crashdata\");\n#endif\n    return ustrValue;\n}\n\n\/\/===============================================\n\n#if defined(WNT) || !defined(OS2)\n#define LCKFILE \"crashdat.lck\"\n#else\n#define LCKFILE \".crash_report_unsent\"\n#endif\n\n\nstatic OUString GetUnsentURL()\n{\n    OUString    aURL = GetCrashConfigDir();\n\n    aURL += OUString( RTL_CONSTASCII_USTRINGPARAM( \"\/\" ) );\n    aURL += OUString( RTL_CONSTASCII_USTRINGPARAM( LCKFILE ) );\n\n    return aURL;\n}\n\n\/\/===============================================\n\nstatic bool new_crash_pending()\n{\n    OUString    aUnsentURL = GetUnsentURL();\n    File    aFile( aUnsentURL );\n\n    if ( FileBase::E_None == aFile.open( OpenFlag_Read ) )\n    {\n        aFile.close();\n        return true;\n    }\n\n    return false;\n}\n\/\/===============================================\n\nstatic bool delete_pending_crash()\n{\n    OUString    aUnsentURL = GetUnsentURL();\n    return ( FileBase::E_None == File::remove( aUnsentURL ) );\n}\n\nRecoveryUI::EJob RecoveryUI::impl_classifyJob(const css::util::URL& aURL)\n{\n    m_eJob = RecoveryUI::E_JOB_UNKNOWN;\n    if (aURL.Protocol.equals(RECOVERY_CMDPART_PROTOCOL))\n    {\n        if (aURL.Path.equals(RECOVERY_CMDPART_DO_EMERGENCY_SAVE))\n            m_eJob = RecoveryUI::E_DO_EMERGENCY_SAVE;\n        else\n        if (aURL.Path.equals(RECOVERY_CMDPART_DO_RECOVERY))\n            m_eJob = RecoveryUI::E_DO_RECOVERY;\n        else\n        if (aURL.Path.equals(RECOVERY_CMDPART_DO_CRASHREPORT))\n            m_eJob = RecoveryUI::E_DO_CRASHREPORT;\n    }\n\n    return m_eJob;\n}\n\n\/\/===============================================\nsal_Bool RecoveryUI::impl_doEmergencySave()\n{\n    \/\/ create core service, which implements the real \"emergency save\" algorithm.\n    svxdr::RecoveryCore* pCore = new svxdr::RecoveryCore(m_xSMGR, sal_True);\n    css::uno::Reference< css::frame::XStatusListener > xCore(pCore);\n\n    \/\/ create all needed dialogs for this operation\n    \/\/ and bind it to the used core service\n    svxdr::TabDialog4Recovery* pWizard = new svxdr::TabDialog4Recovery(m_pParentWindow);\n    svxdr::IExtendedTabPage*   pPage1  = new svxdr::SaveDialog        (pWizard, pCore );\n    pWizard->addTabPage(pPage1);\n\n    \/\/ start the wizard\n    short nRet = pWizard->Execute();\n\n    delete pPage1 ;\n    delete pWizard;\n\n    return (nRet==DLG_RET_OK_AUTOLUNCH);\n}\n\n\/\/===============================================\nvoid RecoveryUI::impl_doRecovery()\n{\n    sal_Bool bRecoveryOnly( sal_False );\n\n    ::rtl::OUString CFG_PACKAGE_RECOVERY( RTL_CONSTASCII_USTRINGPARAM  ( \"org.openoffice.Office.Recovery\/\" ));\n    ::rtl::OUString CFG_PATH_CRASHREPORTER( RTL_CONSTASCII_USTRINGPARAM( \"CrashReporter\"                 ));\n    ::rtl::OUString CFG_ENTRY_ENABLED( RTL_CONSTASCII_USTRINGPARAM     ( \"Enabled\"                       ));\n\n    sal_Bool bCrashRepEnabled( sal_True );\n    css::uno::Any aVal = ::comphelper::ConfigurationHelper::readDirectKey(\n                                m_xSMGR,\n                                CFG_PACKAGE_RECOVERY,\n                                CFG_PATH_CRASHREPORTER,\n                                CFG_ENTRY_ENABLED,\n                                ::comphelper::ConfigurationHelper::E_READONLY);\n    aVal >>= bCrashRepEnabled;\n    bRecoveryOnly = !bCrashRepEnabled;\n\n    \/\/ create core service, which implements the real \"emergency save\" algorithm.\n    svxdr::RecoveryCore* pCore = new svxdr::RecoveryCore(m_xSMGR, sal_False);\n    css::uno::Reference< css::frame::XStatusListener > xCore(pCore);\n\n    \/\/ create all needed dialogs for this operation\n    \/\/ and bind it to the used core service\n    svxdr::TabDialog4Recovery* pWizard = new svxdr::TabDialog4Recovery   (m_pParentWindow);\n    svxdr::IExtendedTabPage*   pPage1  = new svxdr::RecoveryDialog       (pWizard, pCore );\n    svxdr::IExtendedTabPage*   pPage2  = 0;\n    svxdr::IExtendedTabPage*   pPage3  = 0;\n\n    pWizard->addTabPage(pPage1);\n    if ( !bRecoveryOnly && new_crash_pending() )\n    {\n        pPage2 = new svxdr::ErrorRepWelcomeDialog(pWizard        );\n        pPage3 = new svxdr::ErrorRepSendDialog   (pWizard        );\n        pWizard->addTabPage(pPage2);\n        pWizard->addTabPage(pPage3);\n    }\n\n    \/\/ start the wizard\n    pWizard->Execute();\n\n    impl_showAllRecoveredDocs();\n\n    delete pPage3 ;\n    delete pPage2 ;\n    delete pPage1 ;\n    delete pWizard;\n\n    delete_pending_crash();\n}\n\n\/\/===============================================\n\nvoid RecoveryUI::impl_doCrashReport()\n{\n    if ( new_crash_pending() )\n    {\n        svxdr::TabDialog4Recovery* pWizard = new svxdr::TabDialog4Recovery   (m_pParentWindow   );\n        svxdr::IExtendedTabPage*   pPage1  = new svxdr::ErrorRepWelcomeDialog(pWizard, sal_False);\n        svxdr::IExtendedTabPage*   pPage2  = new svxdr::ErrorRepSendDialog   (pWizard           );\n        pWizard->addTabPage(pPage1);\n        pWizard->addTabPage(pPage2);\n\n        \/\/ start the wizard\n        pWizard->Execute();\n\n        delete pPage2 ;\n        delete pPage1 ;\n        delete pWizard;\n\n        delete_pending_crash();\n    }\n}\n\n\/\/===============================================\nvoid RecoveryUI::impl_showAllRecoveredDocs()\n{\n    css::uno::Reference< css::frame::XFramesSupplier > xDesktop(\n        m_xSMGR->createInstance(SERVICENAME_DESKTOP),\n        css::uno::UNO_QUERY_THROW);\n\n    css::uno::Reference< css::container::XIndexAccess > xTaskContainer(\n        xDesktop->getFrames(),\n        css::uno::UNO_QUERY_THROW);\n\n    sal_Int32 c = xTaskContainer->getCount();\n    sal_Int32 i = 0;\n    for (i=0; i<c; ++i)\n    {\n        try\n        {\n            css::uno::Reference< css::frame::XFrame > xTask;\n            xTaskContainer->getByIndex(i) >>= xTask;\n            if (!xTask.is())\n                continue;\n\n            css::uno::Reference< css::awt::XWindow > xWindow = xTask->getContainerWindow();\n            if (!xWindow.is())\n                continue;\n\n            xWindow->setVisible(sal_True);\n        }\n        catch(const css::uno::RuntimeException& exRun)\n            { throw exRun; }\n        catch(const css::uno::Exception&)\n            { continue; }\n    }\n}\n\n} \/\/ namespace svx\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>coverity#1267646 coverity#1267641: sw: logically dead code<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>Maintain the sorting in sorted_vector after modifying the elements.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/** \\brief Utility for displaying various bits of info about a collection of MARC records.\n *  \\author Dr. Johannes Ruscheinski (johannes.ruscheinski@uni-tuebingen.de)\n *\n *  \\copyright 2015 Universitätsbiblothek 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 <map>\n#include <memory>\n#include <stdexcept>\n#include <unordered_set>\n#include <vector>\n#include <cstdio>\n#include <cstdlib>\n#include \"Leader.h\"\n#include \"MarcUtil.h\"\n#include \"MediaTypeUtil.h\"\n#include \"util.h\"\n\n\nstatic void Usage() __attribute__((noreturn));\n\n\nstatic void Usage() {\n    std::cerr << \"Usage: \" << progname << \" marc_data\\n\";\n    std::exit(EXIT_FAILURE);\n}\n\n\nvoid ProcessRecords(const bool input_is_xml, File * const input) {\n    std::string raw_record;\n    unsigned record_count(0), max_record_length(0), max_local_block_count(0);\n    std::unordered_set<std::string> control_numbers;\n    std::map<MarcUtil::Record::RecordType, unsigned> record_types_and_counts;\n\n    while (const MarcUtil::Record record =\n           input_is_xml ? MarcUtil::Record::XmlFactory(input) : MarcUtil::Record::BinaryFactory(input))\n    {\n        ++record_count;\n        ++record_types_and_counts[record.getRecordType()];\n\n        std::string err_msg;\n        if (not input_is_xml and not record.recordSeemsCorrect(&err_msg))\n            Error(\"record #\" + std::to_string(record_count) + \" is malformed: \" + err_msg);\n\n        const std::vector<std::string> &fields(record.getFields());\n        if (unlikely(fields.empty()))\n          Error(\"record #\" + std::to_string(record_count) + \" has zero fields!\");\n        const std::string &control_number(fields[0]);\n        if (control_numbers.find(control_number) != control_numbers.end())\n            Error(\"found at least one duplicate control number: \" + control_number);\n        control_numbers.insert(control_number);\n\n        const Leader &leader(record.getLeader());\n        const unsigned record_length(leader.getRecordLength());\n        if (record_length > max_record_length)\n            max_record_length = record_length;\n\n        std::vector<std::pair<size_t, size_t>> local_block_boundaries;\n        const size_t local_block_count(record.findAllLocalDataBlocks(&local_block_boundaries));\n        if (local_block_count > max_local_block_count)\n            max_local_block_count = local_block_count;\n    }\n\n    std::cout << \"Data set contains \" << record_count << \" MARC record(s).\\n\";\n    std::cout << \"Largest record contains \" << max_record_length << \" bytes.\\n\";\n    std::cout << \"The record with the largest number of \\\"local\\\" blocks has \" << max_local_block_count\n              << \" local blocks.\\n\";\n    std::cout << \"Counted \" << record_types_and_counts[MarcUtil::Record::BIBLIOGRAPHIC]\n              << \" bibliographic record(s), \" << record_types_and_counts[MarcUtil::Record::AUTHORITY]\n              << \" authority record(s), and \" << record_types_and_counts[MarcUtil::Record::UNKNOWN]\n              << \" record(s) of unknown record type.\\n\";\n}\n\n\nint main(int argc, char *argv[]) {\n    progname = argv[0];\n\n    if (argc != 2)\n        Usage();\n\n    const std::string marc_input_filename(argv[1]);\n    const std::string media_type(MediaTypeUtil::GetFileMediaType(marc_input_filename));\n    if (unlikely(media_type.empty()))\n        Error(\"can't determine media type of \\\"\" + marc_input_filename + \"\\\"!\");\n    if (media_type != \"application\/xml\" and media_type != \"application\/marc\")\n        Error(\"\\\"input_filename\\\" is neither XML nor MARC-21 data!\");\n    const bool input_is_xml(media_type == \"application\/xml\");\n\n    File marc_input(marc_input_filename, input_is_xml ? \"r\" : \"rb\");\n    if (not marc_input)\n        Error(\"can't open \\\"\" + marc_input_filename + \"\\\" for reading!\");\n\n    try {\n        ProcessRecords(input_is_xml, &marc_input);\n    } catch (const std::exception &e) {\n        Error(\"Caught exception: \" + std::string(e.what()));\n    }\n}\n<commit_msg>Added a --verbose optional flag.<commit_after>\/** \\brief Utility for displaying various bits of info about a collection of MARC records.\n *  \\author Dr. Johannes Ruscheinski (johannes.ruscheinski@uni-tuebingen.de)\n *\n *  \\copyright 2015,2016 Universitätsbiblothek 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 <map>\n#include <memory>\n#include <stdexcept>\n#include <unordered_set>\n#include <vector>\n#include <cstdio>\n#include <cstdlib>\n#include \"Leader.h\"\n#include \"MarcUtil.h\"\n#include \"MediaTypeUtil.h\"\n#include \"util.h\"\n\n\nstatic void Usage() __attribute__((noreturn));\n\n\nstatic void Usage() {\n    std::cerr << \"Usage: \" << progname << \" [--verbose] marc_data\\n\";\n    std::exit(EXIT_FAILURE);\n}\n\n\nvoid ProcessRecords(const bool verbose, const bool input_is_xml, File * const input) {\n    std::string raw_record;\n    unsigned record_count(0), max_record_length(0), max_local_block_count(0);\n    std::unordered_set<std::string> control_numbers;\n    std::map<MarcUtil::Record::RecordType, unsigned> record_types_and_counts;\n\n    while (const MarcUtil::Record record =\n           input_is_xml ? MarcUtil::Record::XmlFactory(input) : MarcUtil::Record::BinaryFactory(input))\n    {\n        ++record_count;\n\n        const std::vector<std::string> &fields(record.getFields());\n        if (unlikely(fields.empty()))\n          Error(\"record #\" + std::to_string(record_count) + \" has zero fields!\");\n        const std::string &control_number(fields[0]);\n\n        const MarcUtil::Record::RecordType record_type(record.getRecordType());\n        ++record_types_and_counts[record_type];\n        if (verbose and record_type == MarcUtil::Record::UNKNOWN)\n            std::cerr << \"Unknown record type '\" << record.getLeader()[6] << \"' for PPN \" << control_number << \".\\n\";\n\n        std::string err_msg;\n        if (not input_is_xml and not record.recordSeemsCorrect(&err_msg))\n            Error(\"record #\" + std::to_string(record_count) + \" is malformed: \" + err_msg);\n\n        if (control_numbers.find(control_number) != control_numbers.end())\n            Error(\"found at least one duplicate control number: \" + control_number);\n        control_numbers.insert(control_number);\n\n        const Leader &leader(record.getLeader());\n        const unsigned record_length(leader.getRecordLength());\n        if (record_length > max_record_length)\n            max_record_length = record_length;\n\n        std::vector<std::pair<size_t, size_t>> local_block_boundaries;\n        const size_t local_block_count(record.findAllLocalDataBlocks(&local_block_boundaries));\n        if (local_block_count > max_local_block_count)\n            max_local_block_count = local_block_count;\n    }\n\n    std::cout << \"Data set contains \" << record_count << \" MARC record(s).\\n\";\n    std::cout << \"Largest record contains \" << max_record_length << \" bytes.\\n\";\n    std::cout << \"The record with the largest number of \\\"local\\\" blocks has \" << max_local_block_count\n              << \" local blocks.\\n\";\n    std::cout << \"Counted \" << record_types_and_counts[MarcUtil::Record::BIBLIOGRAPHIC]\n              << \" bibliographic record(s), \" << record_types_and_counts[MarcUtil::Record::AUTHORITY]\n              << \" authority record(s), and \" << record_types_and_counts[MarcUtil::Record::UNKNOWN]\n              << \" record(s) of unknown record type.\\n\";\n}\n\n\nint main(int argc, char *argv[]) {\n    progname = argv[0];\n\n    if (argc < 2)\n        Usage();\n\n    const bool verbose(std::strcmp(argv[1], \"--verbose\") == 0);\n    if (verbose)\n        --argc, ++argv;\n\n    if (argc != 2)\n        Usage();\n\n    const std::string marc_input_filename(argv[1]);\n    const std::string media_type(MediaTypeUtil::GetFileMediaType(marc_input_filename));\n    if (unlikely(media_type.empty()))\n        Error(\"can't determine media type of \\\"\" + marc_input_filename + \"\\\"!\");\n    if (media_type != \"application\/xml\" and media_type != \"application\/marc\")\n        Error(\"\\\"input_filename\\\" is neither XML nor MARC-21 data!\");\n    const bool input_is_xml(media_type == \"application\/xml\");\n\n    File marc_input(marc_input_filename, input_is_xml ? \"r\" : \"rb\");\n    if (not marc_input)\n        Error(\"can't open \\\"\" + marc_input_filename + \"\\\" for reading!\");\n\n    try {\n        ProcessRecords(verbose, input_is_xml, &marc_input);\n    } catch (const std::exception &e) {\n        Error(\"Caught exception: \" + std::string(e.what()));\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>coverity#704978 Unchecked dynamic_cast<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>simplify<commit_after><|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\/\/ FramebufferAttachment.cpp: the gl::FramebufferAttachment class and its derived classes\n\/\/ objects and related functionality. [OpenGL ES 2.0.24] section 4.4.3 page 108.\n\n#include \"libANGLE\/FramebufferAttachment.h\"\n\n#include \"common\/utilities.h\"\n#include \"libANGLE\/Config.h\"\n#include \"libANGLE\/Context.h\"\n#include \"libANGLE\/Renderbuffer.h\"\n#include \"libANGLE\/Surface.h\"\n#include \"libANGLE\/Texture.h\"\n#include \"libANGLE\/formatutils.h\"\n#include \"libANGLE\/renderer\/FramebufferAttachmentObjectImpl.h\"\n#include \"libANGLE\/renderer\/FramebufferImpl.h\"\n\nnamespace gl\n{\n\n\/\/\/\/\/\/ FramebufferAttachment::Target Implementation \/\/\/\/\/\/\n\nconst GLsizei FramebufferAttachment::kDefaultNumViews             = 1;\nconst GLint FramebufferAttachment::kDefaultBaseViewIndex          = 0;\nconst GLint FramebufferAttachment::kDefaultRenderToTextureSamples = 0;\n\nFramebufferAttachment::Target::Target() : mBinding(GL_NONE), mTextureIndex() {}\n\nFramebufferAttachment::Target::Target(GLenum binding, const ImageIndex &imageIndex)\n    : mBinding(binding), mTextureIndex(imageIndex)\n{}\n\nFramebufferAttachment::Target::Target(const Target &other)\n    : mBinding(other.mBinding), mTextureIndex(other.mTextureIndex)\n{}\n\nFramebufferAttachment::Target &FramebufferAttachment::Target::operator=(const Target &other)\n{\n    this->mBinding      = other.mBinding;\n    this->mTextureIndex = other.mTextureIndex;\n    return *this;\n}\n\n\/\/\/\/\/\/ FramebufferAttachment Implementation \/\/\/\/\/\/\n\nFramebufferAttachment::FramebufferAttachment()\n    : mType(GL_NONE),\n      mResource(nullptr),\n      mNumViews(kDefaultNumViews),\n      mIsMultiview(false),\n      mBaseViewIndex(kDefaultBaseViewIndex),\n      mRenderToTextureSamples(kDefaultRenderToTextureSamples)\n{}\n\nFramebufferAttachment::FramebufferAttachment(const Context *context,\n                                             GLenum type,\n                                             GLenum binding,\n                                             const ImageIndex &textureIndex,\n                                             FramebufferAttachmentObject *resource)\n    : mResource(nullptr)\n{\n    attach(context, type, binding, textureIndex, resource, kDefaultNumViews, kDefaultBaseViewIndex,\n           false, kDefaultRenderToTextureSamples);\n}\n\nFramebufferAttachment::FramebufferAttachment(FramebufferAttachment &&other)\n    : FramebufferAttachment()\n{\n    *this = std::move(other);\n}\n\nFramebufferAttachment &FramebufferAttachment::operator=(FramebufferAttachment &&other)\n{\n    std::swap(mType, other.mType);\n    std::swap(mTarget, other.mTarget);\n    std::swap(mResource, other.mResource);\n    std::swap(mNumViews, other.mNumViews);\n    std::swap(mIsMultiview, other.mIsMultiview);\n    std::swap(mBaseViewIndex, other.mBaseViewIndex);\n    std::swap(mRenderToTextureSamples, other.mRenderToTextureSamples);\n    return *this;\n}\n\nFramebufferAttachment::~FramebufferAttachment()\n{\n    ASSERT(!isAttached());\n}\n\nvoid FramebufferAttachment::detach(const Context *context)\n{\n    mType = GL_NONE;\n    if (mResource != nullptr)\n    {\n        mResource->onDetach(context);\n        mResource = nullptr;\n    }\n    mNumViews      = kDefaultNumViews;\n    mIsMultiview   = false;\n    mBaseViewIndex = kDefaultBaseViewIndex;\n\n    \/\/ not technically necessary, could omit for performance\n    mTarget = Target();\n}\n\nvoid FramebufferAttachment::attach(const Context *context,\n                                   GLenum type,\n                                   GLenum binding,\n                                   const ImageIndex &textureIndex,\n                                   FramebufferAttachmentObject *resource,\n                                   GLsizei numViews,\n                                   GLuint baseViewIndex,\n                                   bool isMultiview,\n                                   GLsizei samples)\n{\n    if (resource == nullptr)\n    {\n        detach(context);\n        return;\n    }\n\n    mType                   = type;\n    mTarget                 = Target(binding, textureIndex);\n    mNumViews               = numViews;\n    mBaseViewIndex          = baseViewIndex;\n    mIsMultiview            = isMultiview;\n    mRenderToTextureSamples = samples;\n    resource->onAttach(context);\n\n    if (mResource != nullptr)\n    {\n        mResource->onDetach(context);\n    }\n\n    mResource = resource;\n}\n\nGLuint FramebufferAttachment::getRedSize() const\n{\n    return getSize().empty() ? 0 : getFormat().info->redBits;\n}\n\nGLuint FramebufferAttachment::getGreenSize() const\n{\n    return getSize().empty() ? 0 : getFormat().info->greenBits;\n}\n\nGLuint FramebufferAttachment::getBlueSize() const\n{\n    return getSize().empty() ? 0 : getFormat().info->blueBits;\n}\n\nGLuint FramebufferAttachment::getAlphaSize() const\n{\n    return getSize().empty() ? 0 : getFormat().info->alphaBits;\n}\n\nGLuint FramebufferAttachment::getDepthSize() const\n{\n    return getSize().empty() ? 0 : getFormat().info->depthBits;\n}\n\nGLuint FramebufferAttachment::getStencilSize() const\n{\n    return getSize().empty() ? 0 : getFormat().info->stencilBits;\n}\n\nGLenum FramebufferAttachment::getComponentType() const\n{\n    return getFormat().info->componentType;\n}\n\nGLenum FramebufferAttachment::getColorEncoding() const\n{\n    return getFormat().info->colorEncoding;\n}\n\nGLuint FramebufferAttachment::id() const\n{\n    return mResource->getId();\n}\n\nTextureTarget FramebufferAttachment::cubeMapFace() const\n{\n    ASSERT(mType == GL_TEXTURE);\n\n    const auto &index = mTarget.textureIndex();\n    return index.getType() == TextureType::CubeMap ? index.getTarget() : TextureTarget::InvalidEnum;\n}\n\nGLint FramebufferAttachment::mipLevel() const\n{\n    ASSERT(type() == GL_TEXTURE);\n    return mTarget.textureIndex().getLevelIndex();\n}\n\nGLint FramebufferAttachment::layer() const\n{\n    ASSERT(mType == GL_TEXTURE);\n\n    const gl::ImageIndex &index = mTarget.textureIndex();\n    return (index.has3DLayer() ? index.getLayerIndex() : 0);\n}\n\nbool FramebufferAttachment::isLayered() const\n{\n    return mTarget.textureIndex().isLayered();\n}\n\nbool FramebufferAttachment::isMultiview() const\n{\n    return mIsMultiview;\n}\n\nGLint FramebufferAttachment::getBaseViewIndex() const\n{\n    return mBaseViewIndex;\n}\n\nTexture *FramebufferAttachment::getTexture() const\n{\n    return rx::GetAs<Texture>(mResource);\n}\n\nRenderbuffer *FramebufferAttachment::getRenderbuffer() const\n{\n    return rx::GetAs<Renderbuffer>(mResource);\n}\n\nconst egl::Surface *FramebufferAttachment::getSurface() const\n{\n    return rx::GetAs<egl::Surface>(mResource);\n}\n\nFramebufferAttachmentObject *FramebufferAttachment::getResource() const\n{\n    return mResource;\n}\n\nbool FramebufferAttachment::operator==(const FramebufferAttachment &other) const\n{\n    if (mResource != other.mResource || mType != other.mType || mNumViews != other.mNumViews ||\n        mIsMultiview != other.mIsMultiview || mBaseViewIndex != other.mBaseViewIndex ||\n        mRenderToTextureSamples != other.mRenderToTextureSamples)\n    {\n        return false;\n    }\n\n    if (mType == GL_TEXTURE && getTextureImageIndex() != other.getTextureImageIndex())\n    {\n        return false;\n    }\n\n    return true;\n}\n\nbool FramebufferAttachment::operator!=(const FramebufferAttachment &other) const\n{\n    return !(*this == other);\n}\n\nInitState FramebufferAttachment::initState() const\n{\n    return mResource ? mResource->initState(mTarget.textureIndex()) : InitState::Initialized;\n}\n\nangle::Result FramebufferAttachment::initializeContents(const Context *context)\n{\n    ASSERT(mResource);\n    ANGLE_TRY(mResource->initializeContents(context, mTarget.textureIndex()));\n    setInitState(InitState::Initialized);\n    return angle::Result::Continue;\n}\n\nvoid FramebufferAttachment::setInitState(InitState initState) const\n{\n    ASSERT(mResource);\n    mResource->setInitState(mTarget.textureIndex(), initState);\n}\n\nbool FramebufferAttachment::isBoundAsSamplerOrImage() const\n{\n    if (mType != GL_TEXTURE)\n    {\n        return false;\n    }\n\n    const gl::TextureState &textureState = getTexture()->getTextureState();\n    return textureState.isBoundAsImageTexture() || textureState.isBoundAsSamplerTexture();\n}\n\n\/\/\/\/\/\/ FramebufferAttachmentObject Implementation \/\/\/\/\/\/\n\nFramebufferAttachmentObject::FramebufferAttachmentObject() {}\n\nFramebufferAttachmentObject::~FramebufferAttachmentObject() {}\n\nangle::Result FramebufferAttachmentObject::getAttachmentRenderTarget(\n    const Context *context,\n    GLenum binding,\n    const ImageIndex &imageIndex,\n    GLsizei samples,\n    rx::FramebufferAttachmentRenderTarget **rtOut) const\n{\n    return getAttachmentImpl()->getAttachmentRenderTarget(context, binding, imageIndex, samples,\n                                                          rtOut);\n}\n\nangle::Result FramebufferAttachmentObject::initializeContents(const Context *context,\n                                                              const ImageIndex &imageIndex)\n{\n    ASSERT(context->isRobustResourceInitEnabled());\n\n    \/\/ Because gl::Texture cannot support tracking individual layer dirtiness, we only handle\n    \/\/ initializing entire mip levels for 2D array textures.\n    if (imageIndex.getType() == TextureType::_2DArray && imageIndex.hasLayer())\n    {\n        ImageIndex fullMipIndex =\n            ImageIndex::Make2DArray(imageIndex.getLevelIndex(), ImageIndex::kEntireLevel);\n        return getAttachmentImpl()->initializeContents(context, fullMipIndex);\n    }\n    else if (imageIndex.getType() == TextureType::_2DMultisampleArray && imageIndex.hasLayer())\n    {\n        ImageIndex fullMipIndex = ImageIndex::Make2DMultisampleArray(ImageIndex::kEntireLevel);\n        return getAttachmentImpl()->initializeContents(context, fullMipIndex);\n    }\n    else\n    {\n        return getAttachmentImpl()->initializeContents(context, imageIndex);\n    }\n}\n\n}  \/\/ namespace gl\n<commit_msg>Pass layer count to robust 2D array texure init.<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\/\/ FramebufferAttachment.cpp: the gl::FramebufferAttachment class and its derived classes\n\/\/ objects and related functionality. [OpenGL ES 2.0.24] section 4.4.3 page 108.\n\n#include \"libANGLE\/FramebufferAttachment.h\"\n\n#include \"common\/utilities.h\"\n#include \"libANGLE\/Config.h\"\n#include \"libANGLE\/Context.h\"\n#include \"libANGLE\/Renderbuffer.h\"\n#include \"libANGLE\/Surface.h\"\n#include \"libANGLE\/Texture.h\"\n#include \"libANGLE\/formatutils.h\"\n#include \"libANGLE\/renderer\/FramebufferAttachmentObjectImpl.h\"\n#include \"libANGLE\/renderer\/FramebufferImpl.h\"\n\nnamespace gl\n{\n\n\/\/\/\/\/\/ FramebufferAttachment::Target Implementation \/\/\/\/\/\/\n\nconst GLsizei FramebufferAttachment::kDefaultNumViews             = 1;\nconst GLint FramebufferAttachment::kDefaultBaseViewIndex          = 0;\nconst GLint FramebufferAttachment::kDefaultRenderToTextureSamples = 0;\n\nFramebufferAttachment::Target::Target() : mBinding(GL_NONE), mTextureIndex() {}\n\nFramebufferAttachment::Target::Target(GLenum binding, const ImageIndex &imageIndex)\n    : mBinding(binding), mTextureIndex(imageIndex)\n{}\n\nFramebufferAttachment::Target::Target(const Target &other)\n    : mBinding(other.mBinding), mTextureIndex(other.mTextureIndex)\n{}\n\nFramebufferAttachment::Target &FramebufferAttachment::Target::operator=(const Target &other)\n{\n    this->mBinding      = other.mBinding;\n    this->mTextureIndex = other.mTextureIndex;\n    return *this;\n}\n\n\/\/\/\/\/\/ FramebufferAttachment Implementation \/\/\/\/\/\/\n\nFramebufferAttachment::FramebufferAttachment()\n    : mType(GL_NONE),\n      mResource(nullptr),\n      mNumViews(kDefaultNumViews),\n      mIsMultiview(false),\n      mBaseViewIndex(kDefaultBaseViewIndex),\n      mRenderToTextureSamples(kDefaultRenderToTextureSamples)\n{}\n\nFramebufferAttachment::FramebufferAttachment(const Context *context,\n                                             GLenum type,\n                                             GLenum binding,\n                                             const ImageIndex &textureIndex,\n                                             FramebufferAttachmentObject *resource)\n    : mResource(nullptr)\n{\n    attach(context, type, binding, textureIndex, resource, kDefaultNumViews, kDefaultBaseViewIndex,\n           false, kDefaultRenderToTextureSamples);\n}\n\nFramebufferAttachment::FramebufferAttachment(FramebufferAttachment &&other)\n    : FramebufferAttachment()\n{\n    *this = std::move(other);\n}\n\nFramebufferAttachment &FramebufferAttachment::operator=(FramebufferAttachment &&other)\n{\n    std::swap(mType, other.mType);\n    std::swap(mTarget, other.mTarget);\n    std::swap(mResource, other.mResource);\n    std::swap(mNumViews, other.mNumViews);\n    std::swap(mIsMultiview, other.mIsMultiview);\n    std::swap(mBaseViewIndex, other.mBaseViewIndex);\n    std::swap(mRenderToTextureSamples, other.mRenderToTextureSamples);\n    return *this;\n}\n\nFramebufferAttachment::~FramebufferAttachment()\n{\n    ASSERT(!isAttached());\n}\n\nvoid FramebufferAttachment::detach(const Context *context)\n{\n    mType = GL_NONE;\n    if (mResource != nullptr)\n    {\n        mResource->onDetach(context);\n        mResource = nullptr;\n    }\n    mNumViews      = kDefaultNumViews;\n    mIsMultiview   = false;\n    mBaseViewIndex = kDefaultBaseViewIndex;\n\n    \/\/ not technically necessary, could omit for performance\n    mTarget = Target();\n}\n\nvoid FramebufferAttachment::attach(const Context *context,\n                                   GLenum type,\n                                   GLenum binding,\n                                   const ImageIndex &textureIndex,\n                                   FramebufferAttachmentObject *resource,\n                                   GLsizei numViews,\n                                   GLuint baseViewIndex,\n                                   bool isMultiview,\n                                   GLsizei samples)\n{\n    if (resource == nullptr)\n    {\n        detach(context);\n        return;\n    }\n\n    mType                   = type;\n    mTarget                 = Target(binding, textureIndex);\n    mNumViews               = numViews;\n    mBaseViewIndex          = baseViewIndex;\n    mIsMultiview            = isMultiview;\n    mRenderToTextureSamples = samples;\n    resource->onAttach(context);\n\n    if (mResource != nullptr)\n    {\n        mResource->onDetach(context);\n    }\n\n    mResource = resource;\n}\n\nGLuint FramebufferAttachment::getRedSize() const\n{\n    return getSize().empty() ? 0 : getFormat().info->redBits;\n}\n\nGLuint FramebufferAttachment::getGreenSize() const\n{\n    return getSize().empty() ? 0 : getFormat().info->greenBits;\n}\n\nGLuint FramebufferAttachment::getBlueSize() const\n{\n    return getSize().empty() ? 0 : getFormat().info->blueBits;\n}\n\nGLuint FramebufferAttachment::getAlphaSize() const\n{\n    return getSize().empty() ? 0 : getFormat().info->alphaBits;\n}\n\nGLuint FramebufferAttachment::getDepthSize() const\n{\n    return getSize().empty() ? 0 : getFormat().info->depthBits;\n}\n\nGLuint FramebufferAttachment::getStencilSize() const\n{\n    return getSize().empty() ? 0 : getFormat().info->stencilBits;\n}\n\nGLenum FramebufferAttachment::getComponentType() const\n{\n    return getFormat().info->componentType;\n}\n\nGLenum FramebufferAttachment::getColorEncoding() const\n{\n    return getFormat().info->colorEncoding;\n}\n\nGLuint FramebufferAttachment::id() const\n{\n    return mResource->getId();\n}\n\nTextureTarget FramebufferAttachment::cubeMapFace() const\n{\n    ASSERT(mType == GL_TEXTURE);\n\n    const auto &index = mTarget.textureIndex();\n    return index.getType() == TextureType::CubeMap ? index.getTarget() : TextureTarget::InvalidEnum;\n}\n\nGLint FramebufferAttachment::mipLevel() const\n{\n    ASSERT(type() == GL_TEXTURE);\n    return mTarget.textureIndex().getLevelIndex();\n}\n\nGLint FramebufferAttachment::layer() const\n{\n    ASSERT(mType == GL_TEXTURE);\n\n    const gl::ImageIndex &index = mTarget.textureIndex();\n    return (index.has3DLayer() ? index.getLayerIndex() : 0);\n}\n\nbool FramebufferAttachment::isLayered() const\n{\n    return mTarget.textureIndex().isLayered();\n}\n\nbool FramebufferAttachment::isMultiview() const\n{\n    return mIsMultiview;\n}\n\nGLint FramebufferAttachment::getBaseViewIndex() const\n{\n    return mBaseViewIndex;\n}\n\nTexture *FramebufferAttachment::getTexture() const\n{\n    return rx::GetAs<Texture>(mResource);\n}\n\nRenderbuffer *FramebufferAttachment::getRenderbuffer() const\n{\n    return rx::GetAs<Renderbuffer>(mResource);\n}\n\nconst egl::Surface *FramebufferAttachment::getSurface() const\n{\n    return rx::GetAs<egl::Surface>(mResource);\n}\n\nFramebufferAttachmentObject *FramebufferAttachment::getResource() const\n{\n    return mResource;\n}\n\nbool FramebufferAttachment::operator==(const FramebufferAttachment &other) const\n{\n    if (mResource != other.mResource || mType != other.mType || mNumViews != other.mNumViews ||\n        mIsMultiview != other.mIsMultiview || mBaseViewIndex != other.mBaseViewIndex ||\n        mRenderToTextureSamples != other.mRenderToTextureSamples)\n    {\n        return false;\n    }\n\n    if (mType == GL_TEXTURE && getTextureImageIndex() != other.getTextureImageIndex())\n    {\n        return false;\n    }\n\n    return true;\n}\n\nbool FramebufferAttachment::operator!=(const FramebufferAttachment &other) const\n{\n    return !(*this == other);\n}\n\nInitState FramebufferAttachment::initState() const\n{\n    return mResource ? mResource->initState(mTarget.textureIndex()) : InitState::Initialized;\n}\n\nangle::Result FramebufferAttachment::initializeContents(const Context *context)\n{\n    ASSERT(mResource);\n    ANGLE_TRY(mResource->initializeContents(context, mTarget.textureIndex()));\n    setInitState(InitState::Initialized);\n    return angle::Result::Continue;\n}\n\nvoid FramebufferAttachment::setInitState(InitState initState) const\n{\n    ASSERT(mResource);\n    mResource->setInitState(mTarget.textureIndex(), initState);\n}\n\nbool FramebufferAttachment::isBoundAsSamplerOrImage() const\n{\n    if (mType != GL_TEXTURE)\n    {\n        return false;\n    }\n\n    const gl::TextureState &textureState = getTexture()->getTextureState();\n    return textureState.isBoundAsImageTexture() || textureState.isBoundAsSamplerTexture();\n}\n\n\/\/\/\/\/\/ FramebufferAttachmentObject Implementation \/\/\/\/\/\/\n\nFramebufferAttachmentObject::FramebufferAttachmentObject() {}\n\nFramebufferAttachmentObject::~FramebufferAttachmentObject() {}\n\nangle::Result FramebufferAttachmentObject::getAttachmentRenderTarget(\n    const Context *context,\n    GLenum binding,\n    const ImageIndex &imageIndex,\n    GLsizei samples,\n    rx::FramebufferAttachmentRenderTarget **rtOut) const\n{\n    return getAttachmentImpl()->getAttachmentRenderTarget(context, binding, imageIndex, samples,\n                                                          rtOut);\n}\n\nangle::Result FramebufferAttachmentObject::initializeContents(const Context *context,\n                                                              const ImageIndex &imageIndex)\n{\n    ASSERT(context->isRobustResourceInitEnabled());\n\n    \/\/ Because gl::Texture cannot support tracking individual layer dirtiness, we only handle\n    \/\/ initializing entire mip levels for 2D array textures.\n    if (imageIndex.getType() == TextureType::_2DArray && imageIndex.hasLayer())\n    {\n        \/\/ Compute the layer count so we get a correct 2D array index.\n        const gl::Extents &size = getAttachmentSize(imageIndex);\n\n        ImageIndex fullMipIndex = ImageIndex::Make2DArrayRange(\n            imageIndex.getLevelIndex(), ImageIndex::kEntireLevel, size.depth);\n        return getAttachmentImpl()->initializeContents(context, fullMipIndex);\n    }\n    else if (imageIndex.getType() == TextureType::_2DMultisampleArray && imageIndex.hasLayer())\n    {\n        ImageIndex fullMipIndex = ImageIndex::Make2DMultisampleArray(ImageIndex::kEntireLevel);\n        return getAttachmentImpl()->initializeContents(context, fullMipIndex);\n    }\n    else\n    {\n        return getAttachmentImpl()->initializeContents(context, imageIndex);\n    }\n}\n\n}  \/\/ namespace gl\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>fix compilation of doc (broken by changeset d48a7c25e052 - General tightening\/testing of vectorwise ops)<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n * ethernet.cpp\n *\n *  Created on: Jan 11, 2020\n *      Author: devel\n *\/\n\n#include \"ethernet.hpp\"\n\n#include <bits\/stdint-uintn.h>\n#include <array>\n#include <vector>\n\n#include \"..\/..\/..\/include\/licensecc\/datatypes.h\"\n#include \"..\/..\/..\/projects\/DEFAULT\/include\/licensecc\/DEFAULT\/licensecc_properties.h\"\n#include \"..\/base\/base.h\"\n#include \"..\/os\/network.hpp\"\n#include \"pc_identifier.hpp\"\n\nnamespace license {\nnamespace pc_identifier {\nusing namespace std;\n\nstatic FUNCTION_RETURN generate_ethernet_pc_id(vector<array<uint8_t, PC_IDENTIFIER_PROPRIETARY_DATA>> &data,\n\t\t\t\t\t\t\t\t\t\t\t   const bool use_ip) {\n\tvector<os::OsAdapterInfo> adapters;\n\n\tFUNCTION_RETURN result_adapterInfos = getAdapterInfos(adapters);\n\tif (result_adapterInfos != FUNC_RET_OK) {\n\t\treturn result_adapterInfos;\n\t}\n\tif (adapters.size() == 0) {\n\t\treturn FUNC_RET_NOT_AVAIL;\n\t}\n\n\tfor (auto &it : adapters) {\n\t\tunsigned int k, data_len, data_byte;\n\t\tarray<uint8_t, PC_IDENTIFIER_PROPRIETARY_DATA> identifier;\n\t\tdata_len = use_ip ? sizeof(os::OsAdapterInfo::ipv4_address) : sizeof(os::OsAdapterInfo::mac_address);\n\n\t\tfor (k = 0; k < PC_IDENTIFIER_PROPRIETARY_DATA; k++) {\n\t\t\tif (k < data_len) {\n\t\t\t\tidentifier[k] = use_ip ? it.ipv4_address[k] : it.mac_address[k];\n\t\t\t} else {\n\t\t\t\tidentifier[k] = 42;\n\t\t\t}\n\t\t}\n\t\tidentifier[0] = identifier[0] & 0x1F;\n\t\tdata.push_back(identifier);\n\t\t}\n\n\treturn result_adapterInfos;\n}\n\nEthernet::Ethernet(bool useIp) : use_ip(useIp) {}\n\nEthernet::~Ethernet() {}\n\nLCC_API_IDENTIFICATION_STRATEGY Ethernet::identification_strategy() const { return STRATEGY_ETHERNET; }\n\nFUNCTION_RETURN Ethernet::identify_pc(PcIdentifier &pc_id) const {\n\tvector<array<uint8_t, PC_IDENTIFIER_PROPRIETARY_DATA>> data;\n\tFUNCTION_RETURN result = generate_ethernet_pc_id(data, use_ip);\n\tif (result == FUNC_RET_OK) {\n\t\tpc_id.set_data(data[0]);\n\t}\n\treturn result;\n}\n\nstd::vector<PcIdentifier> Ethernet::alternative_ids() const {\n\tvector<array<uint8_t, PC_IDENTIFIER_PROPRIETARY_DATA>> data;\n\tFUNCTION_RETURN result = generate_ethernet_pc_id(data, use_ip);\n\tvector<PcIdentifier> identifiers;\n\tif (result == FUNC_RET_OK) {\n\t\tidentifiers.resize(data.size());\n\t\tfor (auto &it : data) {\n\t\t\tPcIdentifier pc_id;\n\t\t\tpc_id.set_identification_strategy(identification_strategy());\n\t\t\tpc_id.set_data(it);\n\t\t\tidentifiers.push_back(pc_id);\n\t\t}\n\t}\n\treturn identifiers;\n}\n\nLCC_EVENT_TYPE Ethernet::validate_identifier(const PcIdentifier &identifier) const {\n\tvector<array<uint8_t, PC_IDENTIFIER_PROPRIETARY_DATA>> data;\n\tFUNCTION_RETURN generate_ethernet = generate_ethernet_pc_id(data, use_ip);\n\tLCC_EVENT_TYPE result = IDENTIFIERS_MISMATCH;\n\tif (generate_ethernet == FUNC_RET_OK) {\n\t\tresult = validate_identifier(identifier, data);\n\t}\n\treturn result;\n}\n\n}  \/\/ namespace pc_identifier\n} \/* namespace license *\/\n<commit_msg>fix include<commit_after>\/*\n * ethernet.cpp\n *\n *  Created on: Jan 11, 2020\n *      Author: devel\n *\/\n\n\n#include <array>\n#include <vector>\n\n#include \"..\/..\/..\/include\/licensecc\/datatypes.h\"\n#include \"..\/..\/..\/projects\/DEFAULT\/include\/licensecc\/DEFAULT\/licensecc_properties.h\"\n#include \"..\/base\/base.h\"\n#include \"..\/os\/network.hpp\"\n#include \"pc_identifier.hpp\"\n#include \"ethernet.hpp\"\n\nnamespace license {\nnamespace pc_identifier {\nusing namespace std;\n\nstatic FUNCTION_RETURN generate_ethernet_pc_id(vector<array<uint8_t, PC_IDENTIFIER_PROPRIETARY_DATA>> &data,\n\t\t\t\t\t\t\t\t\t\t\t   const bool use_ip) {\n\tvector<os::OsAdapterInfo> adapters;\n\n\tFUNCTION_RETURN result_adapterInfos = getAdapterInfos(adapters);\n\tif (result_adapterInfos != FUNC_RET_OK) {\n\t\treturn result_adapterInfos;\n\t}\n\tif (adapters.size() == 0) {\n\t\treturn FUNC_RET_NOT_AVAIL;\n\t}\n\n\tfor (auto &it : adapters) {\n\t\tunsigned int k, data_len, data_byte;\n\t\tarray<uint8_t, PC_IDENTIFIER_PROPRIETARY_DATA> identifier;\n\t\tdata_len = use_ip ? sizeof(os::OsAdapterInfo::ipv4_address) : sizeof(os::OsAdapterInfo::mac_address);\n\n\t\tfor (k = 0; k < PC_IDENTIFIER_PROPRIETARY_DATA; k++) {\n\t\t\tif (k < data_len) {\n\t\t\t\tidentifier[k] = use_ip ? it.ipv4_address[k] : it.mac_address[k];\n\t\t\t} else {\n\t\t\t\tidentifier[k] = 42;\n\t\t\t}\n\t\t}\n\t\tidentifier[0] = identifier[0] & 0x1F;\n\t\tdata.push_back(identifier);\n\t\t}\n\n\treturn result_adapterInfos;\n}\n\nEthernet::Ethernet(bool useIp) : use_ip(useIp) {}\n\nEthernet::~Ethernet() {}\n\nLCC_API_IDENTIFICATION_STRATEGY Ethernet::identification_strategy() const { return STRATEGY_ETHERNET; }\n\nFUNCTION_RETURN Ethernet::identify_pc(PcIdentifier &pc_id) const {\n\tvector<array<uint8_t, PC_IDENTIFIER_PROPRIETARY_DATA>> data;\n\tFUNCTION_RETURN result = generate_ethernet_pc_id(data, use_ip);\n\tif (result == FUNC_RET_OK) {\n\t\tpc_id.set_data(data[0]);\n\t}\n\treturn result;\n}\n\nstd::vector<PcIdentifier> Ethernet::alternative_ids() const {\n\tvector<array<uint8_t, PC_IDENTIFIER_PROPRIETARY_DATA>> data;\n\tFUNCTION_RETURN result = generate_ethernet_pc_id(data, use_ip);\n\tvector<PcIdentifier> identifiers;\n\tif (result == FUNC_RET_OK) {\n\t\tidentifiers.resize(data.size());\n\t\tfor (auto &it : data) {\n\t\t\tPcIdentifier pc_id;\n\t\t\tpc_id.set_identification_strategy(identification_strategy());\n\t\t\tpc_id.set_data(it);\n\t\t\tidentifiers.push_back(pc_id);\n\t\t}\n\t}\n\treturn identifiers;\n}\n\nLCC_EVENT_TYPE Ethernet::validate_identifier(const PcIdentifier &identifier) const {\n\tvector<array<uint8_t, PC_IDENTIFIER_PROPRIETARY_DATA>> data;\n\tFUNCTION_RETURN generate_ethernet = generate_ethernet_pc_id(data, use_ip);\n\tLCC_EVENT_TYPE result = IDENTIFIERS_MISMATCH;\n\tif (generate_ethernet == FUNC_RET_OK) {\n\t\tresult = validate_identifier(identifier, data);\n\t}\n\treturn result;\n}\n\n}  \/\/ namespace pc_identifier\n} \/* namespace license *\/\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 <cstdlib>\n#include <cstdio>\n#include <string>\n#include \"types.hpp\"\n#include <raul\/SharedPtr.hpp>\n#include <raul\/AtomLiblo.hpp>\n#include \"interface\/ClientInterface.hpp\"\n#include \"module\/Module.hpp\"\n#include \"serialisation\/serialisation.hpp\"\n#include \"serialisation\/Serialiser.hpp\"\n#include \"serialisation\/Parser.hpp\"\n#include \"engine\/ThreadManager.hpp\"\n#include \"HTTPEngineReceiver.hpp\"\n#include \"QueuedEventSource.hpp\"\n#include \"ClientBroadcaster.hpp\"\n#include \"EngineStore.hpp\"\n\nusing namespace std;\nusing namespace Ingen::Shared;\n\nnamespace Ingen {\n\n\nHTTPEngineReceiver::HTTPEngineReceiver(Engine& engine, uint16_t port)\n\t: QueuedEngineInterface(engine, 2, 2)\n\t, _server(soup_server_new(SOUP_SERVER_PORT, port, NULL))\n{\n\t_receive_thread = new ReceiveThread(*this);\n\n\tsoup_server_add_handler(_server, NULL, message_callback, this, NULL);\n\n\tcout << \"Started HTTP server on port \" << soup_server_get_port(_server) << endl;\n\tThread::set_name(\"HTTP receiver\");\n\t\n\tif (!engine.world()->serialisation_module)\n\t\tengine.world()->serialisation_module = Ingen::Shared::load_module(\"ingen_serialisation\");\n\n\tif (engine.world()->serialisation_module) {\n\t\tif (!engine.world()->serialiser)\n\t\t\tengine.world()->serialiser = SharedPtr<Serialiser>(\n\t\t\t\t\tIngen::Serialisation::new_serialiser(engine.world(), engine.engine_store()));\n\t\t\n\t\tif (!engine.world()->parser)\n\t\t\tengine.world()->parser = SharedPtr<Parser>(\n\t\t\t\t\tIngen::Serialisation::new_parser());\n\t} else {\n\t\tcerr << \"WARNING: Failed to load ingen_serialisation module, HTTP disabled.\" << endl;\n\t}\n}\n\n\nHTTPEngineReceiver::~HTTPEngineReceiver()\n{\n\tdeactivate();\n\n\tif (_server != NULL)  {\n\t\tsoup_server_quit(_server);\n\t\t_server = NULL;\n\t}\n}\n\n\nvoid\nHTTPEngineReceiver::activate()\n{\n\tQueuedEventSource::activate();\n\t_receive_thread->set_name(\"HTTP Receiver\");\n\t_receive_thread->start();\n}\n\n\nvoid\nHTTPEngineReceiver::deactivate()\n{\n\tcout << \"[HTTPEngineReceiver] Stopped HTTP listening thread\" << endl;\n\t_receive_thread->stop();\n\tQueuedEventSource::deactivate();\n}\n\n\nvoid\nHTTPEngineReceiver::message_callback(SoupServer* server, SoupMessage* msg, const char* path,\n\t\t\tGHashTable *query, SoupClientContext* client, void* data)\n{\n\tHTTPEngineReceiver* me = (HTTPEngineReceiver*)data;\n\n\tSharedPtr<Store> store = me->_engine.world()->store;\n\tif (!store) {\n\t\tsoup_message_set_status (msg, SOUP_STATUS_INTERNAL_SERVER_ERROR);\n\t\treturn;\n\t}\n\n\tif (!Path::is_valid(path)) {\n\t\tsoup_message_set_status (msg, SOUP_STATUS_BAD_REQUEST);\n\t\treturn;\n\t}\n\n\tif (msg->method == SOUP_METHOD_GET) {\n\t\tGlib::RWLock::ReaderLock lock(store->lock());\n\t\t\n\t\t\/\/ Find object\n\t\tStore::const_iterator start = store->find(path);\n\t\tif (start == store->end()) {\n\t\t\tsoup_message_set_status (msg, SOUP_STATUS_NOT_FOUND);\n\t\t\treturn;\n\t\t}\n\t\t\n\t\t\/\/ Get serialiser\n\t\tSharedPtr<Serialiser> serialiser = me->_engine.world()->serialiser;\n\t\tif (!serialiser) {\n\t\t\tsoup_message_set_status (msg, SOUP_STATUS_INTERNAL_SERVER_ERROR);\n\t\t\treturn;\n\t\t}\n\n#if 0\n\t\tSoupMessageHeaders* in_head = msg->request_headers;\n\t\tconst char* str = soup_message_headers_get(in_head, \"Accept\");\n\t\tcout << \"Accept: \" << str << endl;\n#endif\n\n\t\t\/\/ Serialise object\n\t\tconst string response = serialiser->to_string(start->second, \"http:\/\/example.org\",\n\t\t\t\tGraphObject::Variables());\n\n#if 0\n\t\tFILE* xhtml_file = fopen(\"\/home\/dave\/ingen_ui.xhtml\", \"r\");\n\t\tstring response;\n\t\twhile (!feof(xhtml_file)) {\n\t\t\tint c = fgetc(xhtml_file);\n\t\t\tif (c != EOF)\n\t\t\t\tresponse += (char)c;\n\t\t}\n\t\tfclose(xhtml_file);\n#endif\n\t\t\n\t\tsoup_message_set_status (msg, SOUP_STATUS_OK);\n\t\tsoup_message_set_response (msg, \"text\/plain\", SOUP_MEMORY_COPY,\n\t\t\t\tresponse.c_str(), response.length());\n\t\n\t} else if (msg->method == SOUP_METHOD_PUT) {\n\t\tGlib::RWLock::WriterLock lock(store->lock());\n\t\t\n\t\t\/\/ Be sure object doesn't exist\n\t\tStore::const_iterator start = store->find(path);\n\t\tif (start != store->end()) {\n\t\t\tsoup_message_set_status (msg, SOUP_STATUS_CONFLICT);\n\t\t\treturn;\n\t\t}\n\t\t\n\t\t\/\/ Get parser\n\t\tSharedPtr<Parser> parser = me->_engine.world()->parser;\n\t\tif (!parser) {\n\t\t\tsoup_message_set_status (msg, SOUP_STATUS_INTERNAL_SERVER_ERROR);\n\t\t\treturn;\n\t\t}\n\t\t\n\t\t\/\/cout << \"POST: \" << msg->request_body->data << endl;\n\n\t\t\/\/ Load object\n\t\tsoup_message_set_status (msg, SOUP_STATUS_NOT_IMPLEMENTED);\n\t} else if (msg->method == SOUP_METHOD_POST) {\n\t\t\/\/cout << \"PUT: \" << msg->request_body->data << endl;\n\t\tsoup_message_set_status (msg, SOUP_STATUS_NOT_IMPLEMENTED);\n\t} else {\n\t\tsoup_message_set_status (msg, SOUP_STATUS_NOT_IMPLEMENTED);\n\t}\n}\n\n\n\/** Override the semaphore driven _run method of QueuedEngineInterface\n * to wait on HTTP requests and process them immediately in this thread.\n *\/\nvoid\nHTTPEngineReceiver::ReceiveThread::_run()\n{\n\tsoup_server_run(_receiver._server);\n}\n\n\n} \/\/ namespace Ingen\n<commit_msg>Return human-readable error messages in content of error responses.<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 <cstdlib>\n#include <cstdio>\n#include <string>\n#include <boost\/format.hpp>\n#include \"types.hpp\"\n#include <raul\/SharedPtr.hpp>\n#include <raul\/AtomLiblo.hpp>\n#include \"interface\/ClientInterface.hpp\"\n#include \"module\/Module.hpp\"\n#include \"serialisation\/serialisation.hpp\"\n#include \"serialisation\/Serialiser.hpp\"\n#include \"serialisation\/Parser.hpp\"\n#include \"engine\/ThreadManager.hpp\"\n#include \"HTTPEngineReceiver.hpp\"\n#include \"QueuedEventSource.hpp\"\n#include \"ClientBroadcaster.hpp\"\n#include \"EngineStore.hpp\"\n\nusing namespace std;\nusing namespace Ingen::Shared;\n\nnamespace Ingen {\n\n\nHTTPEngineReceiver::HTTPEngineReceiver(Engine& engine, uint16_t port)\n\t: QueuedEngineInterface(engine, 2, 2)\n\t, _server(soup_server_new(SOUP_SERVER_PORT, port, NULL))\n{\n\t_receive_thread = new ReceiveThread(*this);\n\n\tsoup_server_add_handler(_server, NULL, message_callback, this, NULL);\n\n\tcout << \"Started HTTP server on port \" << soup_server_get_port(_server) << endl;\n\tThread::set_name(\"HTTP receiver\");\n\t\n\tif (!engine.world()->serialisation_module)\n\t\tengine.world()->serialisation_module = Ingen::Shared::load_module(\"ingen_serialisation\");\n\n\tif (engine.world()->serialisation_module) {\n\t\tif (!engine.world()->serialiser)\n\t\t\tengine.world()->serialiser = SharedPtr<Serialiser>(\n\t\t\t\t\tIngen::Serialisation::new_serialiser(engine.world(), engine.engine_store()));\n\t\t\n\t\tif (!engine.world()->parser)\n\t\t\tengine.world()->parser = SharedPtr<Parser>(\n\t\t\t\t\tIngen::Serialisation::new_parser());\n\t} else {\n\t\tcerr << \"WARNING: Failed to load ingen_serialisation module, HTTP disabled.\" << endl;\n\t}\n}\n\n\nHTTPEngineReceiver::~HTTPEngineReceiver()\n{\n\tdeactivate();\n\n\tif (_server != NULL)  {\n\t\tsoup_server_quit(_server);\n\t\t_server = NULL;\n\t}\n}\n\n\nvoid\nHTTPEngineReceiver::activate()\n{\n\tQueuedEventSource::activate();\n\t_receive_thread->set_name(\"HTTP Receiver\");\n\t_receive_thread->start();\n}\n\n\nvoid\nHTTPEngineReceiver::deactivate()\n{\n\tcout << \"[HTTPEngineReceiver] Stopped HTTP listening thread\" << endl;\n\t_receive_thread->stop();\n\tQueuedEventSource::deactivate();\n}\n\n\nvoid\nHTTPEngineReceiver::message_callback(SoupServer* server, SoupMessage* msg, const char* path,\n\t\t\tGHashTable *query, SoupClientContext* client, void* data)\n{\n\tHTTPEngineReceiver* me = (HTTPEngineReceiver*)data;\n\n\tSharedPtr<Store> store = me->_engine.world()->store;\n\tif (!store) {\n\t\tsoup_message_set_status (msg, SOUP_STATUS_INTERNAL_SERVER_ERROR);\n\t\treturn;\n\t}\n\n\tif (!Path::is_valid(path)) {\n\t\tsoup_message_set_status (msg, SOUP_STATUS_BAD_REQUEST);\n\t\tconst string& err = (boost::format(\"Bad path: %1%\") % path).str();\n\t\tsoup_message_set_response (msg, \"text\/plain\", SOUP_MEMORY_COPY,\n\t\t\t\terr.c_str(), err.length());\n\t\treturn;\n\t}\n\n\tif (msg->method == SOUP_METHOD_GET) {\n\t\tGlib::RWLock::ReaderLock lock(store->lock());\n\t\t\n\t\t\/\/ Find object\n\t\tStore::const_iterator start = store->find(path);\n\t\tif (start == store->end()) {\n\t\t\tsoup_message_set_status (msg, SOUP_STATUS_NOT_FOUND);\n\t\t\tconst string& err = (boost::format(\"No such object: %1%\") % path).str();\n\t\t\tsoup_message_set_response (msg, \"text\/plain\", SOUP_MEMORY_COPY,\n\t\t\t\t\terr.c_str(), err.length());\n\t\t\treturn;\n\t\t}\n\t\t\n\t\t\/\/ Get serialiser\n\t\tSharedPtr<Serialiser> serialiser = me->_engine.world()->serialiser;\n\t\tif (!serialiser) {\n\t\t\tsoup_message_set_status (msg, SOUP_STATUS_INTERNAL_SERVER_ERROR);\n\t\t\tsoup_message_set_response (msg, \"text\/plain\", SOUP_MEMORY_STATIC,\n\t\t\t\t\t\"No serialiser available\\n\", 24);\n\t\t\treturn;\n\t\t}\n\n#if 0\n\t\tSoupMessageHeaders* in_head = msg->request_headers;\n\t\tconst char* str = soup_message_headers_get(in_head, \"Accept\");\n\t\tcout << \"Accept: \" << str << endl;\n#endif\n\n\t\t\/\/ Serialise object\n\t\tconst string response = serialiser->to_string(start->second,\n\t\t\t\t\"http:\/\/example.org\", GraphObject::Variables());\n\n#if 0\n\t\tFILE* xhtml_file = fopen(\"\/home\/dave\/ingen_ui.xhtml\", \"r\");\n\t\tstring response;\n\t\twhile (!feof(xhtml_file)) {\n\t\t\tint c = fgetc(xhtml_file);\n\t\t\tif (c != EOF)\n\t\t\t\tresponse += (char)c;\n\t\t}\n\t\tfclose(xhtml_file);\n#endif\n\t\t\n\t\tsoup_message_set_status (msg, SOUP_STATUS_OK);\n\t\tsoup_message_set_response (msg, \"text\/plain\", SOUP_MEMORY_COPY,\n\t\t\t\tresponse.c_str(), response.length());\n\t\n\t} else if (msg->method == SOUP_METHOD_PUT) {\n\t\tGlib::RWLock::WriterLock lock(store->lock());\n\t\t\n\t\t\/\/ Be sure object doesn't exist\n\t\tStore::const_iterator start = store->find(path);\n\t\tif (start != store->end()) {\n\t\t\tsoup_message_set_status (msg, SOUP_STATUS_CONFLICT);\n\t\t\treturn;\n\t\t}\n\t\t\n\t\t\/\/ Get parser\n\t\tSharedPtr<Parser> parser = me->_engine.world()->parser;\n\t\tif (!parser) {\n\t\t\tsoup_message_set_status (msg, SOUP_STATUS_INTERNAL_SERVER_ERROR);\n\t\t\treturn;\n\t\t}\n\t\t\n\t\t\/\/cout << \"POST: \" << msg->request_body->data << endl;\n\n\t\t\/\/ Load object\n\t\tsoup_message_set_status (msg, SOUP_STATUS_NOT_IMPLEMENTED);\n\t} else if (msg->method == SOUP_METHOD_POST) {\n\t\t\/\/cout << \"PUT: \" << msg->request_body->data << endl;\n\t\tsoup_message_set_status (msg, SOUP_STATUS_NOT_IMPLEMENTED);\n\t} else {\n\t\tsoup_message_set_status (msg, SOUP_STATUS_NOT_IMPLEMENTED);\n\t}\n}\n\n\n\/** Override the semaphore driven _run method of QueuedEngineInterface\n * to wait on HTTP requests and process them immediately in this thread.\n *\/\nvoid\nHTTPEngineReceiver::ReceiveThread::_run()\n{\n\tsoup_server_run(_receiver._server);\n}\n\n\n} \/\/ namespace Ingen\n<|endoftext|>"}
{"text":"<commit_before>#ifdef __cplusplus\n\n#include <malc\/libexport.h>\n#include <malc\/malc.h>\n#include <malc\/destinations\/array.h>\n#include <malc\/destinations\/file.h>\n#include <malc\/destinations\/stdouterr.h>\n#include <malc\/malc.hpp>\n#include <malc\/destinations.hpp>\n\nnamespace malcpp {\n\n\/* Implementation note: there are unorthodox castings because I wanted to remove\nthe malc C types from the global namespace when a user includes \"malc.hpp\".\n\nThe casts are done between the same datatypes. Creating explicit conversions\nwould require converting POD types to classes, which is ugly and tedious too,\nand I would be telling the compiler the same but in a different way. I find that\nthis solution keeps the castings localized and under control.\n*\/\n\/*----------------------------------------------------------------------------*\/\n\/* definitions on destinations.hpp *\/\n\/*----------------------------------------------------------------------------*\/\nbl_err file_dst::set_cfg (file_dst_cfg const& cfg) noexcept\n{\n  return malc_file_set_cfg ((malc_file_dst*) this, (::malc_file_cfg*) &cfg);\n}\n\/*----------------------------------------------------------------------------*\/\nbl_err file_dst::get_cfg (file_dst_cfg& cfg) const noexcept\n{\n  return malc_file_get_cfg ((malc_file_dst*) this, (::malc_file_cfg*) &cfg);\n}\n\/*----------------------------------------------------------------------------*\/\nmalc_dst file_dst::get_dst_tbl()\n{\n  return *((::malcpp::malc_dst*) &malc_file_dst_tbl);\n}\n\/*----------------------------------------------------------------------------*\/\n\/*----------------------------------------------------------------------------*\/\nvoid array_dst::set_array(\n  char* mem, bl_uword mem_entries, bl_uword entry_chars\n  ) noexcept\n{\n  malc_array_dst_set_array(\n    (malc_array_dst*) this, mem, mem_entries, entry_chars\n    );\n}\n\/*----------------------------------------------------------------------------*\/\nbl_uword array_dst::size() const noexcept\n{\n  return malc_array_dst_size ((malc_array_dst const*) this);\n}\n\/*----------------------------------------------------------------------------*\/\nbl_uword array_dst::capacity() const noexcept\n{\n  return malc_array_dst_capacity ((malc_array_dst const*) this);\n}\n\/*----------------------------------------------------------------------------*\/\nchar const* array_dst::get_entry (bl_uword idx) const noexcept\n{\n  return malc_array_dst_get_entry ((malc_array_dst const*) this, idx);\n}\n\/*----------------------------------------------------------------------------*\/\nmalc_dst array_dst::get_dst_tbl()\n{\n  return *((::malcpp::malc_dst*) &malc_array_dst_tbl);\n}\n\/*----------------------------------------------------------------------------*\/\n\/*----------------------------------------------------------------------------*\/\nbl_err stdouterr_dst::set_stderr_severity (bl_uword sev) noexcept\n{\n  return malc_stdouterr_set_stderr_severity ((malc_stdouterr_dst*) this, sev);\n}\n\/*----------------------------------------------------------------------------*\/\nmalc_dst stdouterr_dst::get_dst_tbl()\n{\n  return *((::malcpp::malc_dst*) &malc_stdouterr_dst_tbl);\n}\n\/*----------------------------------------------------------------------------*\/\n\/* definitions on malc.hpp *\/\n\/*----------------------------------------------------------------------------*\/\nnamespace detail {\n\/*----------------------------------------------------------------------------*\/\ndst_access_untyped::dst_access_untyped() noexcept\n{\n  m_owner = nullptr;\n  m_id    = (bl_u32) -1ll;\n}\n\/*----------------------------------------------------------------------------*\/\nbl_err dst_access_untyped::get_cfg (dst_cfg& c) const noexcept\n{\n  if (!is_valid()) {\n    return bl_mkerr (bl_invalid);\n  }\n  return malc_get_destination_cfg (owner(), (::malc_dst_cfg*) &c, id());\n}\n\/*----------------------------------------------------------------------------*\/\nbl_err dst_access_untyped::set_cfg (dst_cfg const& c) const noexcept\n{\n  if (!is_valid()) {\n    return bl_mkerr (bl_invalid);\n  }\n  return malc_set_destination_cfg (owner(), (::malc_dst_cfg*) &c, id());\n}\n\/*----------------------------------------------------------------------------*\/\nbl_err dst_access_untyped::untyped_try_get (void*& instance) const noexcept\n{\n  if (!is_valid()) {\n    return bl_mkerr (bl_invalid);\n  }\n  bl_err e = malc_get_destination_instance (owner(), &instance, id());\n  return e;\n}\n\/*----------------------------------------------------------------------------*\/\nbool dst_access_untyped::is_valid() const noexcept\n{\n  return m_owner != nullptr;\n}\n\/*----------------------------------------------------------------------------*\/\nmalc* dst_access_untyped::owner() const noexcept\n{\n  return m_owner;\n}\n\/*----------------------------------------------------------------------------*\/\nbl_u32 dst_access_untyped::id() const noexcept\n{\n  return m_id;\n}\n\/*----------------------------------------------------------------------------*\/\n} \/\/ namespace detail\n\n} \/\/ namespace malcpp {\n\n#endif \/* __cplusplus *\/<commit_msg>destinations: c++: avoid type punning warnings.<commit_after>#ifdef __cplusplus\n\n#include <cstring>\n#include <malc\/libexport.h>\n#include <malc\/malc.h>\n#include <malc\/destinations\/array.h>\n#include <malc\/destinations\/file.h>\n#include <malc\/destinations\/stdouterr.h>\n#include <malc\/malc.hpp>\n#include <malc\/destinations.hpp>\n\nnamespace malcpp {\n\n\/* Implementation note: there are unorthodox castings because I wanted to remove\nthe malc C types from the global namespace when a user includes \"malc.hpp\".\n\nThe casts are done between the same datatypes. Creating explicit conversions\nwould require converting POD types to classes, which is ugly and tedious too,\nand I would be telling the compiler the same but in a different way. I find that\nthis solution keeps the castings localized and under control.\n*\/\n\/*----------------------------------------------------------------------------*\/\n\/* definitions on destinations.hpp *\/\n\/*----------------------------------------------------------------------------*\/\nbl_err file_dst::set_cfg (file_dst_cfg const& cfg) noexcept\n{\n  return malc_file_set_cfg ((malc_file_dst*) this, (::malc_file_cfg*) &cfg);\n}\n\/*----------------------------------------------------------------------------*\/\nbl_err file_dst::get_cfg (file_dst_cfg& cfg) const noexcept\n{\n  return malc_file_get_cfg ((malc_file_dst*) this, (::malc_file_cfg*) &cfg);\n}\n\/*----------------------------------------------------------------------------*\/\nmalc_dst file_dst::get_dst_tbl()\n{\n  \/\/ these types are actually the same and come from the same header file\n  \/\/ included twice, one of the inclusion is made inside the \"malcpp\" namespace.\n  \/\/ This is done to C++ify the C library as much as possible, hence all the\n  \/\/ non-conventional things are doing here under the hood.\n  \/\/ memcpy is used to avoid type punning warnings.\n  ::malcpp::malc_dst dst;\n  static_assert (sizeof malc_file_dst_tbl == sizeof dst, \"\");\n  memcpy (&dst, &malc_file_dst_tbl, sizeof dst);\n  return dst;\n}\n\/*----------------------------------------------------------------------------*\/\n\/*----------------------------------------------------------------------------*\/\nvoid array_dst::set_array(\n  char* mem, bl_uword mem_entries, bl_uword entry_chars\n  ) noexcept\n{\n  malc_array_dst_set_array(\n    (malc_array_dst*) this, mem, mem_entries, entry_chars\n    );\n}\n\/*----------------------------------------------------------------------------*\/\nbl_uword array_dst::size() const noexcept\n{\n  return malc_array_dst_size ((malc_array_dst const*) this);\n}\n\/*----------------------------------------------------------------------------*\/\nbl_uword array_dst::capacity() const noexcept\n{\n  return malc_array_dst_capacity ((malc_array_dst const*) this);\n}\n\/*----------------------------------------------------------------------------*\/\nchar const* array_dst::get_entry (bl_uword idx) const noexcept\n{\n  return malc_array_dst_get_entry ((malc_array_dst const*) this, idx);\n}\n\/*----------------------------------------------------------------------------*\/\nmalc_dst array_dst::get_dst_tbl()\n{\n  \/\/ these types are actually the same and come from the same header file\n  \/\/ included twice, one of the inclusion is made inside the \"malcpp\" namespace.\n  \/\/ This is done to C++ify the C library as much as possible, hence all the\n  \/\/ non-conventional things are doing here under the hood.\n  \/\/ memcpy is used to avoid type punning warnings.\n  ::malcpp::malc_dst dst;\n  static_assert (sizeof malc_array_dst_tbl == sizeof dst, \"\");\n  memcpy (&dst, &malc_array_dst_tbl, sizeof dst);\n  return dst;\n}\n\/*----------------------------------------------------------------------------*\/\nbl_err stdouterr_dst::set_stderr_severity (bl_uword sev) noexcept\n{\n  return malc_stdouterr_set_stderr_severity ((malc_stdouterr_dst*) this, sev);\n}\n\/*----------------------------------------------------------------------------*\/\nmalc_dst stdouterr_dst::get_dst_tbl()\n{\n    \/\/ these types are actually the same and come from the same header file\n  \/\/ included twice, one of the inclusion is made inside the \"malcpp\" namespace.\n  \/\/ This is done to C++ify the C library as much as possible, hence all the\n  \/\/ non-conventional things are doing here under the hood.\n  \/\/ memcpy is used to avoid type punning warnings.\n  ::malcpp::malc_dst dst;\n  static_assert (sizeof malc_stdouterr_dst_tbl == sizeof dst, \"\");\n  memcpy (&dst, &malc_stdouterr_dst_tbl, sizeof dst);\n  return dst;\n}\n\/*----------------------------------------------------------------------------*\/\n\/* definitions on malc.hpp *\/\n\/*----------------------------------------------------------------------------*\/\nnamespace detail {\n\/*----------------------------------------------------------------------------*\/\ndst_access_untyped::dst_access_untyped() noexcept\n{\n  m_owner = nullptr;\n  m_id    = (bl_u32) -1ll;\n}\n\/*----------------------------------------------------------------------------*\/\nbl_err dst_access_untyped::get_cfg (dst_cfg& c) const noexcept\n{\n  if (!is_valid()) {\n    return bl_mkerr (bl_invalid);\n  }\n  return malc_get_destination_cfg (owner(), (::malc_dst_cfg*) &c, id());\n}\n\/*----------------------------------------------------------------------------*\/\nbl_err dst_access_untyped::set_cfg (dst_cfg const& c) const noexcept\n{\n  if (!is_valid()) {\n    return bl_mkerr (bl_invalid);\n  }\n  return malc_set_destination_cfg (owner(), (::malc_dst_cfg*) &c, id());\n}\n\/*----------------------------------------------------------------------------*\/\nbl_err dst_access_untyped::untyped_try_get (void*& instance) const noexcept\n{\n  if (!is_valid()) {\n    return bl_mkerr (bl_invalid);\n  }\n  bl_err e = malc_get_destination_instance (owner(), &instance, id());\n  return e;\n}\n\/*----------------------------------------------------------------------------*\/\nbool dst_access_untyped::is_valid() const noexcept\n{\n  return m_owner != nullptr;\n}\n\/*----------------------------------------------------------------------------*\/\nmalc* dst_access_untyped::owner() const noexcept\n{\n  return m_owner;\n}\n\/*----------------------------------------------------------------------------*\/\nbl_u32 dst_access_untyped::id() const noexcept\n{\n  return m_id;\n}\n\/*----------------------------------------------------------------------------*\/\n} \/\/ namespace detail\n\n} \/\/ namespace malcpp {\n\n#endif \/* __cplusplus *\/<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: mmconfigitem.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: obo $ $Date: 2004-11-16 17:00: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#ifndef _MMCONFIGITEM_HXX\n#define _MMCONFIGITEM_HXX\n\n#ifndef _COM_SUN_STAR_UNO_SEQUENCE_H_\n#include <com\/sun\/star\/uno\/Sequence.h>\n#endif\n#ifndef _COM_SUN_STAR_UNO_REFERENCE_H_\n#include <com\/sun\/star\/uno\/Reference.h>\n#endif\n#ifndef _TOOLS_RESARY_HXX\n#include <tools\/resary.hxx>\n#endif\n#ifndef _SWDBDATA_HXX\n#include <swdbdata.hxx>\n#endif\n#ifndef INCLUDED_SWDLLAPI_H\n#include \"swdllapi.h\"\n#endif\n\nnamespace com{namespace sun{namespace star{\n    namespace sdbc{\n        class XDataSource;\n        class XConnection;\n        class XResultSet;\n    }\n    namespace sdbcx{\n        class XColumnsSupplier;\n    }\n}}}\nclass SwMailMergeConfigItem_Impl;\nclass SwView;\n\/*-- 06.04.2004 10:43:35---------------------------------------------------\n\n  -----------------------------------------------------------------------*\/\nstruct SwDocMergeInfo\n{\n    long    nStartPageInTarget;\n    long    nEndPageInTarget;\n    long    nDBRow;\n};\nclass SW_DLLPUBLIC SwMailMergeConfigItem\n{\n\/\/    com::sun::star::uno::Sequence< ::rtl::OUString>     m_aSavedDocuments;\n    SwMailMergeConfigItem_Impl*                                 m_pImpl;\n    \/\/session information - not stored in configuration\n    bool                                                        m_bAddressInserted;\n    bool                                                        m_bMergeDone;\n    bool                                                        m_bGreetingInserted;\n    sal_Int32                                                   m_nGreetingMoves;\n    ::rtl::OUString                                             m_rAddressBlockFrame;\n    ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any> m_aSelection;\n\n    USHORT                                                      m_nStartPrint;\n    USHORT                                                      m_nEndPrint;\n\n    ::rtl::OUString                                             m_sSelectedPrinter;\n\n    SwView*                                                     m_pSourceView;\n    SwView*                                                     m_pTargetView;\npublic:\n    SwMailMergeConfigItem();\n    ~SwMailMergeConfigItem();\n\n    enum Gender\n    {\n        FEMALE,\n        MALE,\n        NEUTRAL\n    };\n\n    void                Commit();\n\n    const ResStringArray&   GetDefaultAddressHeaders() const;\n\n    void                SetCurrentConnection(\n                            ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XDataSource>          xSource,\n                            ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection>          xConnection,\n                            ::com::sun::star::uno::Reference< ::com::sun::star::sdbcx::XColumnsSupplier>    xColumnsSupplier,\n                            const SwDBData& rDBData);\n\n    ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XDataSource>\n                        GetSource();\n\n    ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection>\n                        GetConnection();\n\n    ::com::sun::star::uno::Reference< ::com::sun::star::sdbcx::XColumnsSupplier>\n                        GetColumnsSupplier();\n\n    ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XResultSet>\n                        GetResultSet();\n\n    void                DisposeResultSet();\n\n    ::rtl::OUString&    GetFilter() const;\n    void                SetFilter(::rtl::OUString&);\n\n    ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any>\n                        GetSelection()const;\n    void                SetSelection(::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any > rSelection);\n\n    void                SetCurrentDBData( const SwDBData& rDBData);\n    const SwDBData&     GetCurrentDBData() const;\n\n    \/\/ move absolute, nTarget == -1 -> goto last record\n    sal_Int32           MoveResultSet(sal_Int32 nTarget);\n    sal_Int32           GetResultSetPosition()const;\n    bool                IsResultSetFirstLast(bool& bIsFirst, bool& bIsLast);\n\n    bool                IsRecordExcluded(sal_Int32 nRecord);\n    void                ExcludeRecord(sal_Int32 nRecord, bool bExclude);\n\n    const com::sun::star::uno::Sequence< ::rtl::OUString>&\n                        GetSavedDocuments() const;\n    void                AddSavedDocument(::rtl::OUString rName);\n\n    sal_Bool            IsOutputToLetter()const;\n    void                SetOutputToLetter(sal_Bool bSet);\n\n    sal_Bool            IsAddressBlock()const;\n    void                SetAddressBlock(sal_Bool bSet);\n\n    const com::sun::star::uno::Sequence< ::rtl::OUString>\n                        GetAddressBlocks() const;\n    void                SetAddressBlocks(const com::sun::star::uno::Sequence< ::rtl::OUString>& rBlocks);\n\n\n    sal_Bool            IsIncludeCountry() const;\n    rtl::OUString&      GetExcludeCountry() const;\n    void                SetCountrySettings(sal_Bool bSet, const rtl::OUString& sCountry);\n\n    sal_Bool            IsIndividualGreeting(sal_Bool bInEMail) const;\n    void                SetIndividualGreeting(sal_Bool bSet, sal_Bool bInEMail);\n\n    sal_Bool            IsGreetingLine(sal_Bool bInEMail) const;\n    void                SetGreetingLine(sal_Bool bSet, sal_Bool bInEMail);\n\n    const com::sun::star::uno::Sequence< ::rtl::OUString>\n                        GetGreetings(Gender eType) const;\n    void                SetGreetings(Gender eType, const com::sun::star::uno::Sequence< ::rtl::OUString>& rBlocks);\n\n    sal_Int32           GetCurrentGreeting(Gender eType) const;\n    void                SetCurrentGreeting(Gender eType, sal_Int32 nIndex);\n\n    \/\/the content of the gender column that marks it as female\n    const ::rtl::OUString& GetFemaleGenderValue() const;\n    void                   SetFemaleGenderValue(const ::rtl::OUString rValue);\n\n    \/\/returns the assignment in the order of the default headers (GetDefaultAddressHeaders())\n    com::sun::star::uno::Sequence< ::rtl::OUString >\n                        GetColumnAssignment( const SwDBData& rDBData ) const;\n    void                SetColumnAssignment(\n                            const SwDBData& rDBData,\n                            const com::sun::star::uno::Sequence< ::rtl::OUString>& );\n\n    \/\/e-Mail settings:\n    ::rtl::OUString     GetMailDisplayName() const;\n    void                SetMailDisplayName(const ::rtl::OUString& rName);\n\n    ::rtl::OUString     GetMailAddress() const;\n    void                SetMailAddress(const ::rtl::OUString& rAddress);\n\n    sal_Bool            IsMailReplyTo() const;\n    void                SetMailReplyTo(sal_Bool bSet);\n\n    ::rtl::OUString     GetMailReplyTo() const;\n    void                SetMailReplyTo(const ::rtl::OUString& rReplyTo);\n\n    ::rtl::OUString     GetMailServer() const;\n    void                SetMailServer(const ::rtl::OUString& rAddress);\n\n    sal_Int16           GetMailPort() const;\n    void                SetMailPort(sal_Int16 nSet);\n\n    sal_Bool            IsDefaultPort() const;\n    void                SetPortToDefault();\n\n    sal_Bool            IsSecureConnection() const;\n    void                SetSecureConnection(sal_Bool bSet);\n\n    sal_Bool            IsAuthentication() const;\n    void                SetAuthentication(sal_Bool bSet);\n\n    ::rtl::OUString     GetMailUserName() const;\n    void                SetMailUserName(const ::rtl::OUString& rName);\n\n    ::rtl::OUString     GetMailPassword() const;\n    void                SetMailPassword(const ::rtl::OUString& rPassword);\n\n    sal_Bool            IsSMTPAfterPOP() const;\n    void                SetSMTPAfterPOP(sal_Bool bSet);\n\n    ::rtl::OUString     GetInServerName() const;\n    void                SetInServerName(const ::rtl::OUString& rServer);\n\n    sal_Int16           GetInServerPort() const;\n    void                SetInServerPort(sal_Int16 nSet);\n\n    sal_Bool            IsInServerPOP() const;\n    void                SetInServerPOP(sal_Bool bSet);\n\n    ::rtl::OUString     GetInServerUserName() const;\n    void                SetInServerUserName(const ::rtl::OUString& rName);\n\n    ::rtl::OUString     GetInServerPassword() const;\n    void                SetInServerPassword(const ::rtl::OUString& rPassword);\n\n    \/\/session information\n    bool                IsAddressInserted() const { return m_bAddressInserted; }\n    void                SetAddressInserted(const ::rtl::OUString& rFrameName)\n                            { m_bAddressInserted = true;\n                              m_rAddressBlockFrame = rFrameName;\n                            }\n\n    bool                IsGreetingInserted() const { return m_bGreetingInserted; }\n    void                SetGreetingInserted()\n                            { m_bGreetingInserted = true; }\n\n    \/\/ counts the moves in the layout page\n    void                MoveGreeting( sal_Int32 nMove) { m_nGreetingMoves += nMove;}\n    sal_Int32           GetGreetingMoves() const { return m_nGreetingMoves;}\n\n    bool                IsMergeDone() const { return m_bMergeDone;}\n    void                SetMergeDone(  ) { m_bMergeDone = true; }\n\n    \/\/ new source document - reset some flags\n    void                DocumentReloaded();\n\n    bool                IsMailAvailable() const;\n\n    \/\/ notify a completed merge, provid the appropriate e-Mail address if available\n    void                AddMergedDocument(SwDocMergeInfo& rInfo);\n    \/\/returns the page and database cursor information of each merged document\n    SwDocMergeInfo&     GetDocumentMergeInfo(sal_uInt32 nDocument);\n    sal_uInt32          GetMergedDocumentCount() const;\n\n    void                SetPrintRange( USHORT nStartDocument, USHORT nEndDocument)\n                            {m_nStartPrint = nStartDocument; m_nEndPrint = nEndDocument;}\n    USHORT              GetPrintRangeStart() const  {return m_nStartPrint;}\n    USHORT              GetPrintRangeEnd() const {return m_nEndPrint;}\n\n    const ::rtl::OUString&  GetSelectedPrinter() const {return m_sSelectedPrinter;}\n    void                    SetSelectedPrinter(const ::rtl::OUString& rSet )\n                                    {m_sSelectedPrinter = rSet;}\n\n\n    SwView*             GetTargetView();\n    void                SetTargetView(SwView* pView);\n\n    SwView*             GetSourceView();\n    void                SetSourceView(SwView* pView);\n\n    \/\/helper methods\n    ::rtl::OUString     GetAssignedColumn(sal_uInt32 nColumn)const;\n};\n#endif\n\n<commit_msg>INTEGRATION: CWS dba20blocker (1.4.366); FILE MERGED 2005\/06\/23 13:48:39 fs 1.4.366.1: copying fix for #i50905# into this CWS<commit_after>\/*************************************************************************\n *\n *  $RCSfile: mmconfigitem.hxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: obo $ $Date: 2005-07-08 10:30:59 $\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 _MMCONFIGITEM_HXX\n#define _MMCONFIGITEM_HXX\n\n#ifndef _COM_SUN_STAR_UNO_SEQUENCE_HXX_\n#include <com\/sun\/star\/uno\/Sequence.hxx>\n#endif\n#ifndef _COM_SUN_STAR_UNO_REFERENCE_HXX_\n#include <com\/sun\/star\/uno\/Reference.hxx>\n#endif\n#ifndef _TOOLS_RESARY_HXX\n#include <tools\/resary.hxx>\n#endif\n#ifndef _SWDBDATA_HXX\n#include <swdbdata.hxx>\n#endif\n#ifndef INCLUDED_SWDLLAPI_H\n#include \"swdllapi.h\"\n#endif\n#ifndef SW_SHARED_UNO_COMPONENT_HXX\n#include \"sharedunocomponent.hxx\"\n#endif\n\nnamespace com{namespace sun{namespace star{\n    namespace sdbc{\n        class XDataSource;\n        class XConnection;\n        class XResultSet;\n    }\n    namespace sdbcx{\n        class XColumnsSupplier;\n    }\n}}}\nclass SwMailMergeConfigItem_Impl;\nclass SwView;\n\n\/*-- 06.04.2004 10:43:35---------------------------------------------------\n\n  -----------------------------------------------------------------------*\/\nstruct SwDocMergeInfo\n{\n    long    nStartPageInTarget;\n    long    nEndPageInTarget;\n    long    nDBRow;\n};\nclass SW_DLLPUBLIC SwMailMergeConfigItem\n{\n\/\/    com::sun::star::uno::Sequence< ::rtl::OUString>     m_aSavedDocuments;\n    SwMailMergeConfigItem_Impl*                                 m_pImpl;\n    \/\/session information - not stored in configuration\n    bool                                                        m_bAddressInserted;\n    bool                                                        m_bMergeDone;\n    bool                                                        m_bGreetingInserted;\n    sal_Int32                                                   m_nGreetingMoves;\n    ::rtl::OUString                                             m_rAddressBlockFrame;\n    ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any> m_aSelection;\n\n    USHORT                                                      m_nStartPrint;\n    USHORT                                                      m_nEndPrint;\n\n    ::rtl::OUString                                             m_sSelectedPrinter;\n\n    SwView*                                                     m_pSourceView;\n    SwView*                                                     m_pTargetView;\npublic:\n    SwMailMergeConfigItem();\n    ~SwMailMergeConfigItem();\n\n    enum Gender\n    {\n        FEMALE,\n        MALE,\n        NEUTRAL\n    };\n\n    void                Commit();\n\n    const ResStringArray&   GetDefaultAddressHeaders() const;\n\n    void                SetCurrentConnection(\n                            ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XDataSource>          xSource,\n                            SharedConnection                                                                xConnection,\n                            ::com::sun::star::uno::Reference< ::com::sun::star::sdbcx::XColumnsSupplier>    xColumnsSupplier,\n                            const SwDBData& rDBData);\n\n    ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XDataSource>\n                        GetSource();\n\n    SharedConnection    GetConnection();\n\n    ::com::sun::star::uno::Reference< ::com::sun::star::sdbcx::XColumnsSupplier>\n                        GetColumnsSupplier();\n\n    ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XResultSet>\n                        GetResultSet();\n\n    void                DisposeResultSet();\n\n    ::rtl::OUString&    GetFilter() const;\n    void                SetFilter(::rtl::OUString&);\n\n    ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any>\n                        GetSelection()const;\n    void                SetSelection(::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any > rSelection);\n\n    void                SetCurrentDBData( const SwDBData& rDBData);\n    const SwDBData&     GetCurrentDBData() const;\n\n    \/\/ move absolute, nTarget == -1 -> goto last record\n    sal_Int32           MoveResultSet(sal_Int32 nTarget);\n    sal_Int32           GetResultSetPosition()const;\n    bool                IsResultSetFirstLast(bool& bIsFirst, bool& bIsLast);\n\n    bool                IsRecordExcluded(sal_Int32 nRecord);\n    void                ExcludeRecord(sal_Int32 nRecord, bool bExclude);\n\n    const com::sun::star::uno::Sequence< ::rtl::OUString>&\n                        GetSavedDocuments() const;\n    void                AddSavedDocument(::rtl::OUString rName);\n\n    sal_Bool            IsOutputToLetter()const;\n    void                SetOutputToLetter(sal_Bool bSet);\n\n    sal_Bool            IsAddressBlock()const;\n    void                SetAddressBlock(sal_Bool bSet);\n\n    const com::sun::star::uno::Sequence< ::rtl::OUString>\n                        GetAddressBlocks() const;\n    void                SetAddressBlocks(const com::sun::star::uno::Sequence< ::rtl::OUString>& rBlocks);\n\n\n    sal_Bool            IsIncludeCountry() const;\n    rtl::OUString&      GetExcludeCountry() const;\n    void                SetCountrySettings(sal_Bool bSet, const rtl::OUString& sCountry);\n\n    sal_Bool            IsIndividualGreeting(sal_Bool bInEMail) const;\n    void                SetIndividualGreeting(sal_Bool bSet, sal_Bool bInEMail);\n\n    sal_Bool            IsGreetingLine(sal_Bool bInEMail) const;\n    void                SetGreetingLine(sal_Bool bSet, sal_Bool bInEMail);\n\n    const com::sun::star::uno::Sequence< ::rtl::OUString>\n                        GetGreetings(Gender eType) const;\n    void                SetGreetings(Gender eType, const com::sun::star::uno::Sequence< ::rtl::OUString>& rBlocks);\n\n    sal_Int32           GetCurrentGreeting(Gender eType) const;\n    void                SetCurrentGreeting(Gender eType, sal_Int32 nIndex);\n\n    \/\/the content of the gender column that marks it as female\n    const ::rtl::OUString& GetFemaleGenderValue() const;\n    void                   SetFemaleGenderValue(const ::rtl::OUString rValue);\n\n    \/\/returns the assignment in the order of the default headers (GetDefaultAddressHeaders())\n    com::sun::star::uno::Sequence< ::rtl::OUString >\n                        GetColumnAssignment( const SwDBData& rDBData ) const;\n    void                SetColumnAssignment(\n                            const SwDBData& rDBData,\n                            const com::sun::star::uno::Sequence< ::rtl::OUString>& );\n\n    \/\/e-Mail settings:\n    ::rtl::OUString     GetMailDisplayName() const;\n    void                SetMailDisplayName(const ::rtl::OUString& rName);\n\n    ::rtl::OUString     GetMailAddress() const;\n    void                SetMailAddress(const ::rtl::OUString& rAddress);\n\n    sal_Bool            IsMailReplyTo() const;\n    void                SetMailReplyTo(sal_Bool bSet);\n\n    ::rtl::OUString     GetMailReplyTo() const;\n    void                SetMailReplyTo(const ::rtl::OUString& rReplyTo);\n\n    ::rtl::OUString     GetMailServer() const;\n    void                SetMailServer(const ::rtl::OUString& rAddress);\n\n    sal_Int16           GetMailPort() const;\n    void                SetMailPort(sal_Int16 nSet);\n\n    sal_Bool            IsDefaultPort() const;\n    void                SetPortToDefault();\n\n    sal_Bool            IsSecureConnection() const;\n    void                SetSecureConnection(sal_Bool bSet);\n\n    sal_Bool            IsAuthentication() const;\n    void                SetAuthentication(sal_Bool bSet);\n\n    ::rtl::OUString     GetMailUserName() const;\n    void                SetMailUserName(const ::rtl::OUString& rName);\n\n    ::rtl::OUString     GetMailPassword() const;\n    void                SetMailPassword(const ::rtl::OUString& rPassword);\n\n    sal_Bool            IsSMTPAfterPOP() const;\n    void                SetSMTPAfterPOP(sal_Bool bSet);\n\n    ::rtl::OUString     GetInServerName() const;\n    void                SetInServerName(const ::rtl::OUString& rServer);\n\n    sal_Int16           GetInServerPort() const;\n    void                SetInServerPort(sal_Int16 nSet);\n\n    sal_Bool            IsInServerPOP() const;\n    void                SetInServerPOP(sal_Bool bSet);\n\n    ::rtl::OUString     GetInServerUserName() const;\n    void                SetInServerUserName(const ::rtl::OUString& rName);\n\n    ::rtl::OUString     GetInServerPassword() const;\n    void                SetInServerPassword(const ::rtl::OUString& rPassword);\n\n    \/\/session information\n    bool                IsAddressInserted() const { return m_bAddressInserted; }\n    void                SetAddressInserted(const ::rtl::OUString& rFrameName)\n                            { m_bAddressInserted = true;\n                              m_rAddressBlockFrame = rFrameName;\n                            }\n\n    bool                IsGreetingInserted() const { return m_bGreetingInserted; }\n    void                SetGreetingInserted()\n                            { m_bGreetingInserted = true; }\n\n    \/\/ counts the moves in the layout page\n    void                MoveGreeting( sal_Int32 nMove) { m_nGreetingMoves += nMove;}\n    sal_Int32           GetGreetingMoves() const { return m_nGreetingMoves;}\n\n    bool                IsMergeDone() const { return m_bMergeDone;}\n    void                SetMergeDone(  ) { m_bMergeDone = true; }\n\n    \/\/ new source document - reset some flags\n    void                DocumentReloaded();\n\n    bool                IsMailAvailable() const;\n\n    \/\/ notify a completed merge, provid the appropriate e-Mail address if available\n    void                AddMergedDocument(SwDocMergeInfo& rInfo);\n    \/\/returns the page and database cursor information of each merged document\n    SwDocMergeInfo&     GetDocumentMergeInfo(sal_uInt32 nDocument);\n    sal_uInt32          GetMergedDocumentCount() const;\n\n    void                SetPrintRange( USHORT nStartDocument, USHORT nEndDocument)\n                            {m_nStartPrint = nStartDocument; m_nEndPrint = nEndDocument;}\n    USHORT              GetPrintRangeStart() const  {return m_nStartPrint;}\n    USHORT              GetPrintRangeEnd() const {return m_nEndPrint;}\n\n    const ::rtl::OUString&  GetSelectedPrinter() const {return m_sSelectedPrinter;}\n    void                    SetSelectedPrinter(const ::rtl::OUString& rSet )\n                                    {m_sSelectedPrinter = rSet;}\n\n\n    SwView*             GetTargetView();\n    void                SetTargetView(SwView* pView);\n\n    SwView*             GetSourceView();\n    void                SetSourceView(SwView* pView);\n\n    \/\/helper methods\n    ::rtl::OUString     GetAssignedColumn(sal_uInt32 nColumn)const;\n};\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/* medViewContainerCustom.cpp --- \n * \n * Author: Julien Wintz\n * Copyright (C) 2008 - Julien Wintz, Inria.\n * Created: Wed Mar 17 11:01:46 2010 (+0100)\n * Version: $Id$\n * Last-Updated: Tue Jun 15 16:28:13 2010 (+0200)\n *           By: Julien Wintz\n *     Update #: 67\n *\/\n\n\/* Commentary: \n * \n *\/\n\n\/* Change log:\n * \n *\/\n\n#include \"medViewContainer_p.h\"\n#include \"medViewContainerCustom.h\"\n#include \"medViewPool.h\"\n\n#include <dtkCore\/dtkAbstractView.h>\n\n#include <medCore\/medAbstractView.h>\n#include <medCore\/medViewManager.h>\n\nclass medViewContainerCustomPrivate\n{\npublic:\n    QList<medViewContainerCustom*> children;\n    int rowMax;\n    int columnMax;\n};\n\nmedViewContainerCustom::medViewContainerCustom (QWidget *parent) : medViewContainer(parent), d2 (new medViewContainerCustomPrivate)\n{\n    d2->rowMax    = 5;\n    d2->columnMax = 5;\n}\n\nmedViewContainerCustom::~medViewContainerCustom()\n{\n    delete d2;\n    d2 = NULL;\n}\n\nmedViewContainer::Type medViewContainerCustom::type(void)\n{\n    return medViewContainer::Custom;\n}\n\nvoid medViewContainerCustom::split(int rows, int cols)\n{\n    if (d->view)\n        return;\n\n    this->clear();\n    \n    for(int i = 0 ; i < rows ; i++) {\n        d->layout->setRowStretch(i, 1);\n        for(int j = 0 ; j < cols ; j++) {\n\t    medViewContainerCustom *container = new medViewContainerCustom(this);\n\t    d2->children.append (container);\n            d->layout->addWidget(container, i, j);\n\t    d->layout->setColumnStretch(j, 1);\n\t}\n    }\n\n    this->setCurrent(NULL);\n}\n\nvoid medViewContainerCustom::setPreset(int preset)\n{\n    this->clear();\n    \n    medViewContainerCustom *custom1;\n    medViewContainerCustom *custom2;\n    medViewContainerCustom *custom3;\n    medViewContainerCustom *custom4;\n\n    switch(preset) {\n    case A:\n        custom1 = new medViewContainerCustom(this);\n        custom2 = new medViewContainerCustom(this);\n\td2->children.append (custom1);\n\td2->children.append (custom2);\n        d->layout->addWidget(custom1, 0, 0);\n        d->layout->addWidget(custom2, 0, 1);\n\td->layout->setColumnStretch(0, 1);\n\td->layout->setColumnStretch(1, 1);\t\t\t\n        break;\n    case B:\n        custom1 = new medViewContainerCustom(this);\n\tcustom2 = new medViewContainerCustom(this);\n\td2->children.append (custom1);\n\td2->children.append (custom2);\n        d->layout->addWidget(custom1, 0, 0);\n        d->layout->addWidget(custom2, 1, 0);\n\td->layout->setRowStretch(0, 1);\n\td->layout->setRowStretch(1, 1);\t\t\t\t\t\t\n        break;\n    case C:\n        custom1 = new medViewContainerCustom(this);\n        custom1->split(2, 1);\n        custom2 = new medViewContainerCustom(this);\n\td2->children.append (custom1);\n\td2->children.append (custom2);\n        d->layout->addWidget(custom1, 0, 0);\n        d->layout->addWidget(custom2, 0, 1);\n        d->layout->setColumnStretch(0, 1);\n        d->layout->setColumnStretch(1, 2);\n        break;\n    case D:\n        custom1 = new medViewContainerCustom(this);\n        custom1->split(3, 1);\n        custom2 = new medViewContainerCustom(this);\n\td2->children.append (custom1);\n\td2->children.append (custom2);\n        d->layout->addWidget(custom1, 0, 0);\n        d->layout->addWidget(custom2, 0, 1);\n        d->layout->setColumnStretch(0, 1);\n        d->layout->setColumnStretch(1, 2);\n        break;\n    case E:\n        custom1 = new medViewContainerCustom(this);\n\tcustom2 = new medViewContainerCustom(this);\n\tcustom3 = new medViewContainerCustom(this);\n\tcustom4 = new medViewContainerCustom(this);\n\n\tcustom1->setViewProperty (\"Orientation\", \"Axial\");\n\tcustom2->setViewProperty (\"Orientation\", \"Sagittal\");\n\tcustom3->setViewProperty (\"Orientation\", \"Coronal\");\n\tcustom4->setViewProperty (\"Orientation\", \"3D\");\n\n\td2->children.append (custom1);\n\td2->children.append (custom2);\n\td2->children.append (custom3);\n\td2->children.append (custom4);\n\n\td->layout->addWidget(custom1, 0, 0);\n\td->layout->addWidget(custom2, 0, 1);\n\td->layout->addWidget(custom3, 1, 0);\n\td->layout->addWidget(custom4, 1, 1);\n\td->layout->setColumnStretch(0, 1);\n\td->layout->setColumnStretch(1, 1);\t\t\t\n\td->layout->setRowStretch(0, 1);\n\td->layout->setRowStretch(1, 1);\n        break;\n    };\n\n    this->setCurrent(NULL);\n}\n\nvoid medViewContainerCustom::setView(dtkAbstractView *view)\n{\n    if (view==d->view)\n        return;\n    \n    if (d->layout->count())\n        d->layout->removeItem(d->layout->itemAt(0));\n\n    if (d->view)\n        this->onViewClosing();\n\n    medViewContainer::setView (view);\n    \n    d->layout->setContentsMargins(1, 1, 1, 1);    \n    d->layout->addWidget(view->widget(), 0, 0);\n\n    d->view = view;\n    \/\/ d->view->reset();\n    \n    this->synchronize_2 (view);\n\n    connect (view, SIGNAL (closing()), this, SLOT (onViewClosing()));\n}\n\nvoid medViewContainerCustom::synchronize_2 (dtkAbstractView *view)\n{\n    if (medViewContainerCustom *parent = dynamic_cast<medViewContainerCustom*>(this->parent())) {\n        parent->synchronize_2(view);\n    }\n    else { \/\/ top level medViewContainerCustom\n        if (medAbstractView *medView = dynamic_cast<medAbstractView*> (view) )\n            d->pool->appendView (medView);\n\tconnect (view, SIGNAL (becomeDaddy(bool)), this, SLOT (repaint()));\n    }\n}\n\nvoid medViewContainerCustom::desynchronize_2 (dtkAbstractView *view)\n{\n    if (medViewContainerCustom *parent = dynamic_cast<medViewContainerCustom*>(this->parent())) {\n        parent->desynchronize_2(view);\n    }\n    else { \/\/ top level medViewContainerCustom\n        if (medAbstractView *medView = dynamic_cast<medAbstractView*> (view) )\n            d->pool->removeView (medView);\n\tdisconnect (view, SIGNAL (becomeDaddy(bool)), this, SLOT (repaint()));\n    }\n}\n\nvoid medViewContainerCustom::onViewClosing (void)\n{\n    if (d->view) {\n        d->layout->removeWidget (d->view->widget());\n        this->desynchronize_2 (d->view);\n        disconnect (d->view, SIGNAL (closing()), this, SLOT (onViewClosing()));\n                \n        d->view->close();\n        \n        d->view = NULL;\n    }\n}\n\nvoid medViewContainerCustom::dragEnterEvent(QDragEnterEvent *event)\n{\n    this->setAttribute(Qt::WA_UpdatesDisabled, true);\n\n    medViewContainer::dragEnterEvent(event);\n}\n\nvoid medViewContainerCustom::dragMoveEvent(QDragMoveEvent *event)\n{\n    medViewContainer::dragMoveEvent(event);\n}\n\nvoid medViewContainerCustom::dragLeaveEvent(QDragLeaveEvent *event)\n{\n    this->setAttribute(Qt::WA_UpdatesDisabled, false);\n\n    medViewContainer::dragLeaveEvent(event);\n}\n\nvoid medViewContainerCustom::dropEvent(QDropEvent *event)\n{\n    this->setCurrent(this);\n\n    this->setAttribute(Qt::WA_UpdatesDisabled, false);\n\n    medViewContainer::dropEvent(event);\n}\n\nvoid medViewContainerCustom::focusInEvent(QFocusEvent *event)\n{\n    medViewContainer::focusInEvent(event);\n}\n\nvoid medViewContainerCustom::focusOutEvent(QFocusEvent *event)\n{\n    medViewContainer::focusOutEvent(event);\n}\n\nvoid medViewContainerCustom::clear (void)\n{\n    if (d->view)\n        this->onViewClosing();\n  \n    foreach (medViewContainerCustom *custom, d2->children) {\n        custom->clear();\n\tdelete custom;\n\td->layout->removeWidget (custom);\n    }\n    d2->children.clear();\n\n    for(int i=0; i<d2->rowMax; i++)\n        d->layout->setRowStretch (i, 0);\n    \n    for(int i=0; i<d2->columnMax; i++)\n        d->layout->setColumnStretch (i, 0);\n}\n<commit_msg>Cache preset value<commit_after>\/* medViewContainerCustom.cpp --- \n * \n * Author: Julien Wintz\n * Copyright (C) 2008 - Julien Wintz, Inria.\n * Created: Wed Mar 17 11:01:46 2010 (+0100)\n * Version: $Id$\n * Last-Updated: Tue Jun 15 16:28:13 2010 (+0200)\n *           By: Julien Wintz\n *     Update #: 67\n *\/\n\n\/* Commentary: \n * \n *\/\n\n\/* Change log:\n * \n *\/\n\n#include \"medViewContainer_p.h\"\n#include \"medViewContainerCustom.h\"\n#include \"medViewPool.h\"\n\n#include <dtkCore\/dtkAbstractView.h>\n\n#include <medCore\/medAbstractView.h>\n#include <medCore\/medViewManager.h>\n\nclass medViewContainerCustomPrivate\n{\npublic:\n    QList<medViewContainerCustom*> children;\n    int rowMax;\n    int columnMax;\n    int preset;\n};\n\nmedViewContainerCustom::medViewContainerCustom (QWidget *parent) : medViewContainer(parent), d2 (new medViewContainerCustomPrivate)\n{\n    d2->rowMax    = 5;\n    d2->columnMax = 5;\n    d2->preset = medViewContainerCustom::A;\n}\n\nmedViewContainerCustom::~medViewContainerCustom()\n{\n    delete d2;\n    d2 = NULL;\n}\n\nmedViewContainer::Type medViewContainerCustom::type(void)\n{\n    return medViewContainer::Custom;\n}\n\nvoid medViewContainerCustom::split(int rows, int cols)\n{\n    if (d->view)\n        return;\n\n    this->clear();\n    \n    for(int i = 0 ; i < rows ; i++) {\n        d->layout->setRowStretch(i, 1);\n        for(int j = 0 ; j < cols ; j++) {\n\t    medViewContainerCustom *container = new medViewContainerCustom(this);\n\t    d2->children.append (container);\n            d->layout->addWidget(container, i, j);\n\t    d->layout->setColumnStretch(j, 1);\n\t}\n    }\n\n    this->setCurrent(NULL);\n}\n\nvoid medViewContainerCustom::setPreset(int preset)\n{\n    if (d2->preset == preset)\n        return;\n\n    d2->preset = preset;\n  \n    this->clear();\n    \n    medViewContainerCustom *custom1;\n    medViewContainerCustom *custom2;\n    medViewContainerCustom *custom3;\n    medViewContainerCustom *custom4;\n\n    switch(preset) {\n    case B:\n        custom1 = new medViewContainerCustom(this);\n\tcustom2 = new medViewContainerCustom(this);\n\td2->children.append (custom1);\n\td2->children.append (custom2);\n        d->layout->addWidget(custom1, 0, 0);\n        d->layout->addWidget(custom2, 1, 0);\n\td->layout->setRowStretch(0, 1);\n\td->layout->setRowStretch(1, 1);\t\t\t\t\t\t\n        break;\n    case C:\n        custom1 = new medViewContainerCustom(this);\n        custom1->split(2, 1);\n        custom2 = new medViewContainerCustom(this);\n\td2->children.append (custom1);\n\td2->children.append (custom2);\n        d->layout->addWidget(custom1, 0, 0);\n        d->layout->addWidget(custom2, 0, 1);\n        d->layout->setColumnStretch(0, 1);\n        d->layout->setColumnStretch(1, 2);\n        break;\n    case D:\n        custom1 = new medViewContainerCustom(this);\n        custom1->split(3, 1);\n        custom2 = new medViewContainerCustom(this);\n\td2->children.append (custom1);\n\td2->children.append (custom2);\n        d->layout->addWidget(custom1, 0, 0);\n        d->layout->addWidget(custom2, 0, 1);\n        d->layout->setColumnStretch(0, 1);\n        d->layout->setColumnStretch(1, 2);\n        break;\n    case E:\n        custom1 = new medViewContainerCustom(this);\n\tcustom2 = new medViewContainerCustom(this);\n\tcustom3 = new medViewContainerCustom(this);\n\tcustom4 = new medViewContainerCustom(this);\n\n\tcustom1->setViewProperty (\"Orientation\", \"Axial\");\n\tcustom2->setViewProperty (\"Orientation\", \"Sagittal\");\n\tcustom3->setViewProperty (\"Orientation\", \"Coronal\");\n\tcustom4->setViewProperty (\"Orientation\", \"3D\");\n\n\td2->children.append (custom1);\n\td2->children.append (custom2);\n\td2->children.append (custom3);\n\td2->children.append (custom4);\n\n\td->layout->addWidget(custom1, 0, 0);\n\td->layout->addWidget(custom2, 0, 1);\n\td->layout->addWidget(custom3, 1, 0);\n\td->layout->addWidget(custom4, 1, 1);\n\td->layout->setColumnStretch(0, 1);\n\td->layout->setColumnStretch(1, 1);\t\t\t\n\td->layout->setRowStretch(0, 1);\n\td->layout->setRowStretch(1, 1);\n        break;\n\t\n    case A:\n\tdefault:\n        custom1 = new medViewContainerCustom(this);\n        custom2 = new medViewContainerCustom(this);\n\td2->children.append (custom1);\n\td2->children.append (custom2);\n        d->layout->addWidget(custom1, 0, 0);\n        d->layout->addWidget(custom2, 0, 1);\n\td->layout->setColumnStretch(0, 1);\n\td->layout->setColumnStretch(1, 1);\t\t\t\n        break;\n\n    };\n\n    this->setCurrent(NULL);\n}\n\nvoid medViewContainerCustom::setView(dtkAbstractView *view)\n{\n    if (view==d->view)\n        return;\n    \n    if (d->layout->count())\n        d->layout->removeItem(d->layout->itemAt(0));\n\n    if (d->view)\n        this->onViewClosing();\n\n    medViewContainer::setView (view);\n    \n    d->layout->setContentsMargins(1, 1, 1, 1);    \n    d->layout->addWidget(view->widget(), 0, 0);\n\n    d->view = view;\n    \/\/ d->view->reset();\n    \n    this->synchronize_2 (view);\n\n    connect (view, SIGNAL (closing()), this, SLOT (onViewClosing()));\n}\n\nvoid medViewContainerCustom::synchronize_2 (dtkAbstractView *view)\n{\n    if (medViewContainerCustom *parent = dynamic_cast<medViewContainerCustom*>(this->parent())) {\n        parent->synchronize_2(view);\n    }\n    else { \/\/ top level medViewContainerCustom\n        if (medAbstractView *medView = dynamic_cast<medAbstractView*> (view) )\n            d->pool->appendView (medView);\n\tconnect (view, SIGNAL (becomeDaddy(bool)), this, SLOT (repaint()));\n    }\n}\n\nvoid medViewContainerCustom::desynchronize_2 (dtkAbstractView *view)\n{\n    if (medViewContainerCustom *parent = dynamic_cast<medViewContainerCustom*>(this->parent())) {\n        parent->desynchronize_2(view);\n    }\n    else { \/\/ top level medViewContainerCustom\n        if (medAbstractView *medView = dynamic_cast<medAbstractView*> (view) )\n            d->pool->removeView (medView);\n\tdisconnect (view, SIGNAL (becomeDaddy(bool)), this, SLOT (repaint()));\n    }\n}\n\nvoid medViewContainerCustom::onViewClosing (void)\n{\n    if (d->view) {\n        d->layout->removeWidget (d->view->widget());\n        this->desynchronize_2 (d->view);\n        disconnect (d->view, SIGNAL (closing()), this, SLOT (onViewClosing()));\n                \n        d->view->close();\n        \n        d->view = NULL;\n    }\n}\n\nvoid medViewContainerCustom::dragEnterEvent(QDragEnterEvent *event)\n{\n    this->setAttribute(Qt::WA_UpdatesDisabled, true);\n\n    medViewContainer::dragEnterEvent(event);\n}\n\nvoid medViewContainerCustom::dragMoveEvent(QDragMoveEvent *event)\n{\n    medViewContainer::dragMoveEvent(event);\n}\n\nvoid medViewContainerCustom::dragLeaveEvent(QDragLeaveEvent *event)\n{\n    this->setAttribute(Qt::WA_UpdatesDisabled, false);\n\n    medViewContainer::dragLeaveEvent(event);\n}\n\nvoid medViewContainerCustom::dropEvent(QDropEvent *event)\n{\n    this->setCurrent(this);\n\n    this->setAttribute(Qt::WA_UpdatesDisabled, false);\n\n    medViewContainer::dropEvent(event);\n}\n\nvoid medViewContainerCustom::focusInEvent(QFocusEvent *event)\n{\n    medViewContainer::focusInEvent(event);\n}\n\nvoid medViewContainerCustom::focusOutEvent(QFocusEvent *event)\n{\n    medViewContainer::focusOutEvent(event);\n}\n\nvoid medViewContainerCustom::clear (void)\n{\n    if (d->view)\n        this->onViewClosing();\n  \n    foreach (medViewContainerCustom *custom, d2->children) {\n        custom->clear();\n\tdelete custom;\n\td->layout->removeWidget (custom);\n    }\n    d2->children.clear();\n\n    for(int i=0; i<d2->rowMax; i++)\n        d->layout->setRowStretch (i, 0);\n    \n    for(int i=0; i<d2->columnMax; i++)\n        d->layout->setColumnStretch (i, 0);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- WebAssemblyFrameLowering.cpp - WebAssembly Frame Lowering ----------==\/\/\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 contains the WebAssembly implementation of\n\/\/\/ TargetFrameLowering class.\n\/\/\/\n\/\/\/ On WebAssembly, there aren't a lot of things to do here. There are no\n\/\/\/ callee-saved registers to save, and no spill slots.\n\/\/\/\n\/\/\/ The stack grows downward.\n\/\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"WebAssemblyFrameLowering.h\"\n#include \"MCTargetDesc\/WebAssemblyMCTargetDesc.h\"\n#include \"WebAssemblyInstrInfo.h\"\n#include \"WebAssemblyMachineFunctionInfo.h\"\n#include \"WebAssemblySubtarget.h\"\n#include \"WebAssemblyTargetMachine.h\"\n#include \"llvm\/CodeGen\/MachineFrameInfo.h\"\n#include \"llvm\/CodeGen\/MachineFunction.h\"\n#include \"llvm\/CodeGen\/MachineInstrBuilder.h\"\n#include \"llvm\/CodeGen\/MachineModuleInfo.h\"\n#include \"llvm\/CodeGen\/MachineRegisterInfo.h\"\n#include \"llvm\/Support\/Debug.h\"\nusing namespace llvm;\n\n#define DEBUG_TYPE \"wasm-frame-info\"\n\n\/\/ TODO: wasm64\n\/\/ TODO: Emit TargetOpcode::CFI_INSTRUCTION instructions\n\n\/\/\/ Return true if the specified function should have a dedicated frame pointer\n\/\/\/ register.\nbool WebAssemblyFrameLowering::hasFP(const MachineFunction &MF) const {\n  const MachineFrameInfo &MFI = MF.getFrameInfo();\n  const auto *RegInfo =\n      MF.getSubtarget<WebAssemblySubtarget>().getRegisterInfo();\n  return MFI.isFrameAddressTaken() || MFI.hasVarSizedObjects() ||\n         MFI.hasStackMap() || MFI.hasPatchPoint() ||\n         RegInfo->needsStackRealignment(MF);\n}\n\n\/\/\/ Under normal circumstances, when a frame pointer is not required, we reserve\n\/\/\/ argument space for call sites in the function immediately on entry to the\n\/\/\/ current function. This eliminates the need for add\/sub sp brackets around\n\/\/\/ call sites. Returns true if the call frame is included as part of the stack\n\/\/\/ frame.\nbool WebAssemblyFrameLowering::hasReservedCallFrame(\n    const MachineFunction &MF) const {\n  return !MF.getFrameInfo().hasVarSizedObjects();\n}\n\n\n\/\/\/ Returns true if this function needs a local user-space stack pointer.\n\/\/\/ Unlike a machine stack pointer, the wasm user stack pointer is a global\n\/\/\/ variable, so it is loaded into a register in the prolog.\nbool WebAssemblyFrameLowering::needsSP(const MachineFunction &MF,\n                                       const MachineFrameInfo &MFI) const {\n  return MFI.getStackSize() || MFI.adjustsStack() || hasFP(MF);\n}\n\n\/\/\/ Returns true if the local user-space stack pointer needs to be written back\n\/\/\/ to memory by this function (this is not meaningful if needsSP is false). If\n\/\/\/ false, the stack red zone can be used and only a local SP is needed.\nbool WebAssemblyFrameLowering::needsSPWriteback(\n    const MachineFunction &MF, const MachineFrameInfo &MFI) const {\n  assert(needsSP(MF, MFI));\n  return MFI.getStackSize() > RedZoneSize || MFI.hasCalls() ||\n         MF.getFunction()->hasFnAttribute(Attribute::NoRedZone);\n}\n\nstatic void writeSPToMemory(unsigned SrcReg, MachineFunction &MF,\n                            MachineBasicBlock &MBB,\n                            MachineBasicBlock::iterator &InsertAddr,\n                            MachineBasicBlock::iterator &InsertStore,\n                            const DebugLoc &DL) {\n  const char *ES = \"__stack_pointer\";\n  auto *SPSymbol = MF.createExternalSymbolName(ES);\n  MachineRegisterInfo &MRI = MF.getRegInfo();\n  const TargetRegisterClass *PtrRC =\n      MRI.getTargetRegisterInfo()->getPointerRegClass(MF);\n  unsigned Zero = MRI.createVirtualRegister(PtrRC);\n  unsigned Drop = MRI.createVirtualRegister(PtrRC);\n  const auto *TII = MF.getSubtarget<WebAssemblySubtarget>().getInstrInfo();\n\n  BuildMI(MBB, InsertAddr, DL, TII->get(WebAssembly::CONST_I32), Zero)\n      .addImm(0);\n  auto *MMO = new MachineMemOperand(MachinePointerInfo(MF.getPSVManager()\n                                        .getExternalSymbolCallEntry(ES)),\n                                    MachineMemOperand::MOStore, 4, 4);\n  BuildMI(MBB, InsertStore, DL, TII->get(WebAssembly::STORE_I32), Drop)\n      .addExternalSymbol(SPSymbol)\n      .addReg(Zero)\n      .addImm(2)  \/\/ p2align\n      .addReg(SrcReg)\n      .addMemOperand(MMO);\n}\n\nMachineBasicBlock::iterator\nWebAssemblyFrameLowering::eliminateCallFramePseudoInstr(\n    MachineFunction &MF, MachineBasicBlock &MBB,\n    MachineBasicBlock::iterator I) const {\n  assert(!I->getOperand(0).getImm() && hasFP(MF) &&\n         \"Call frame pseudos should only be used for dynamic stack adjustment\");\n  const auto *TII = MF.getSubtarget<WebAssemblySubtarget>().getInstrInfo();\n  if (I->getOpcode() == TII->getCallFrameDestroyOpcode() &&\n      needsSPWriteback(MF, MF.getFrameInfo())) {\n    DebugLoc DL = I->getDebugLoc();\n    writeSPToMemory(WebAssembly::SP32, MF, MBB, I, I, DL);\n  }\n  return MBB.erase(I);\n}\n\nvoid WebAssemblyFrameLowering::emitPrologue(MachineFunction &MF,\n                                            MachineBasicBlock &MBB) const {\n  \/\/ TODO: Do \".setMIFlag(MachineInstr::FrameSetup)\" on emitted instructions\n  auto &MFI = MF.getFrameInfo();\n  assert(MFI.getCalleeSavedInfo().empty() &&\n         \"WebAssembly should not have callee-saved registers\");\n\n  if (!needsSP(MF, MFI)) return;\n  uint64_t StackSize = MFI.getStackSize();\n\n  const auto *TII = MF.getSubtarget<WebAssemblySubtarget>().getInstrInfo();\n  auto &MRI = MF.getRegInfo();\n\n  auto InsertPt = MBB.begin();\n  DebugLoc DL;\n\n  const TargetRegisterClass *PtrRC =\n      MRI.getTargetRegisterInfo()->getPointerRegClass(MF);\n  unsigned Zero = MRI.createVirtualRegister(PtrRC);\n  unsigned SPReg = MRI.createVirtualRegister(PtrRC);\n  const char *ES = \"__stack_pointer\";\n  auto *SPSymbol = MF.createExternalSymbolName(ES);\n  BuildMI(MBB, InsertPt, DL, TII->get(WebAssembly::CONST_I32), Zero)\n      .addImm(0);\n  auto *LoadMMO = new MachineMemOperand(MachinePointerInfo(MF.getPSVManager()\n                                            .getExternalSymbolCallEntry(ES)),\n                                        MachineMemOperand::MOLoad, 4, 4);\n  \/\/ Load the SP value.\n  BuildMI(MBB, InsertPt, DL, TII->get(WebAssembly::LOAD_I32),\n          StackSize ? SPReg : (unsigned)WebAssembly::SP32)\n      .addExternalSymbol(SPSymbol)\n      .addReg(Zero)    \/\/ addr\n      .addImm(2)       \/\/ p2align\n      .addMemOperand(LoadMMO);\n\n  if (StackSize) {\n    \/\/ Subtract the frame size\n    unsigned OffsetReg = MRI.createVirtualRegister(PtrRC);\n    BuildMI(MBB, InsertPt, DL, TII->get(WebAssembly::CONST_I32), OffsetReg)\n        .addImm(StackSize);\n    BuildMI(MBB, InsertPt, DL, TII->get(WebAssembly::SUB_I32),\n            WebAssembly::SP32)\n        .addReg(SPReg)\n        .addReg(OffsetReg);\n  }\n  if (hasFP(MF)) {\n    \/\/ Unlike most conventional targets (where FP points to the saved FP),\n    \/\/ FP points to the bottom of the fixed-size locals, so we can use positive\n    \/\/ offsets in load\/store instructions.\n    BuildMI(MBB, InsertPt, DL, TII->get(WebAssembly::COPY),\n            WebAssembly::FP32)\n        .addReg(WebAssembly::SP32);\n  }\n  if (StackSize && needsSPWriteback(MF, MFI)) {\n    writeSPToMemory(WebAssembly::SP32, MF, MBB, InsertPt, InsertPt, DL);\n  }\n}\n\nvoid WebAssemblyFrameLowering::emitEpilogue(MachineFunction &MF,\n                                            MachineBasicBlock &MBB) const {\n  auto &MFI = MF.getFrameInfo();\n  uint64_t StackSize = MFI.getStackSize();\n  if (!needsSP(MF, MFI) || !needsSPWriteback(MF, MFI)) return;\n  const auto *TII = MF.getSubtarget<WebAssemblySubtarget>().getInstrInfo();\n  auto &MRI = MF.getRegInfo();\n  auto InsertPt = MBB.getFirstTerminator();\n  DebugLoc DL;\n\n  if (InsertPt != MBB.end())\n    DL = InsertPt->getDebugLoc();\n\n  \/\/ Restore the stack pointer. If we had fixed-size locals, add the offset\n  \/\/ subtracted in the prolog.\n  unsigned SPReg = 0;\n  MachineBasicBlock::iterator InsertAddr = InsertPt;\n  if (StackSize) {\n    const TargetRegisterClass *PtrRC =\n        MRI.getTargetRegisterInfo()->getPointerRegClass(MF);\n    unsigned OffsetReg = MRI.createVirtualRegister(PtrRC);\n    InsertAddr =\n        BuildMI(MBB, InsertPt, DL, TII->get(WebAssembly::CONST_I32), OffsetReg)\n            .addImm(StackSize);\n    \/\/ In the epilog we don't need to write the result back to the SP32 physreg\n    \/\/ because it won't be used again. We can use a stackified register instead.\n    SPReg = MRI.createVirtualRegister(PtrRC);\n    BuildMI(MBB, InsertPt, DL, TII->get(WebAssembly::ADD_I32), SPReg)\n        .addReg(hasFP(MF) ? WebAssembly::FP32 : WebAssembly::SP32)\n        .addReg(OffsetReg);\n  } else {\n    SPReg = hasFP(MF) ? WebAssembly::FP32 : WebAssembly::SP32;\n  }\n\n  writeSPToMemory(SPReg, MF, MBB, InsertAddr, InsertPt, DL);\n}\n<commit_msg>[WebAssembly] Plug MachineMemOperand leaks.<commit_after>\/\/===-- WebAssemblyFrameLowering.cpp - WebAssembly Frame Lowering ----------==\/\/\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 contains the WebAssembly implementation of\n\/\/\/ TargetFrameLowering class.\n\/\/\/\n\/\/\/ On WebAssembly, there aren't a lot of things to do here. There are no\n\/\/\/ callee-saved registers to save, and no spill slots.\n\/\/\/\n\/\/\/ The stack grows downward.\n\/\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"WebAssemblyFrameLowering.h\"\n#include \"MCTargetDesc\/WebAssemblyMCTargetDesc.h\"\n#include \"WebAssemblyInstrInfo.h\"\n#include \"WebAssemblyMachineFunctionInfo.h\"\n#include \"WebAssemblySubtarget.h\"\n#include \"WebAssemblyTargetMachine.h\"\n#include \"llvm\/CodeGen\/MachineFrameInfo.h\"\n#include \"llvm\/CodeGen\/MachineFunction.h\"\n#include \"llvm\/CodeGen\/MachineInstrBuilder.h\"\n#include \"llvm\/CodeGen\/MachineModuleInfo.h\"\n#include \"llvm\/CodeGen\/MachineRegisterInfo.h\"\n#include \"llvm\/Support\/Debug.h\"\nusing namespace llvm;\n\n#define DEBUG_TYPE \"wasm-frame-info\"\n\n\/\/ TODO: wasm64\n\/\/ TODO: Emit TargetOpcode::CFI_INSTRUCTION instructions\n\n\/\/\/ Return true if the specified function should have a dedicated frame pointer\n\/\/\/ register.\nbool WebAssemblyFrameLowering::hasFP(const MachineFunction &MF) const {\n  const MachineFrameInfo &MFI = MF.getFrameInfo();\n  const auto *RegInfo =\n      MF.getSubtarget<WebAssemblySubtarget>().getRegisterInfo();\n  return MFI.isFrameAddressTaken() || MFI.hasVarSizedObjects() ||\n         MFI.hasStackMap() || MFI.hasPatchPoint() ||\n         RegInfo->needsStackRealignment(MF);\n}\n\n\/\/\/ Under normal circumstances, when a frame pointer is not required, we reserve\n\/\/\/ argument space for call sites in the function immediately on entry to the\n\/\/\/ current function. This eliminates the need for add\/sub sp brackets around\n\/\/\/ call sites. Returns true if the call frame is included as part of the stack\n\/\/\/ frame.\nbool WebAssemblyFrameLowering::hasReservedCallFrame(\n    const MachineFunction &MF) const {\n  return !MF.getFrameInfo().hasVarSizedObjects();\n}\n\n\n\/\/\/ Returns true if this function needs a local user-space stack pointer.\n\/\/\/ Unlike a machine stack pointer, the wasm user stack pointer is a global\n\/\/\/ variable, so it is loaded into a register in the prolog.\nbool WebAssemblyFrameLowering::needsSP(const MachineFunction &MF,\n                                       const MachineFrameInfo &MFI) const {\n  return MFI.getStackSize() || MFI.adjustsStack() || hasFP(MF);\n}\n\n\/\/\/ Returns true if the local user-space stack pointer needs to be written back\n\/\/\/ to memory by this function (this is not meaningful if needsSP is false). If\n\/\/\/ false, the stack red zone can be used and only a local SP is needed.\nbool WebAssemblyFrameLowering::needsSPWriteback(\n    const MachineFunction &MF, const MachineFrameInfo &MFI) const {\n  assert(needsSP(MF, MFI));\n  return MFI.getStackSize() > RedZoneSize || MFI.hasCalls() ||\n         MF.getFunction()->hasFnAttribute(Attribute::NoRedZone);\n}\n\nstatic void writeSPToMemory(unsigned SrcReg, MachineFunction &MF,\n                            MachineBasicBlock &MBB,\n                            MachineBasicBlock::iterator &InsertAddr,\n                            MachineBasicBlock::iterator &InsertStore,\n                            const DebugLoc &DL) {\n  const char *ES = \"__stack_pointer\";\n  auto *SPSymbol = MF.createExternalSymbolName(ES);\n  MachineRegisterInfo &MRI = MF.getRegInfo();\n  const TargetRegisterClass *PtrRC =\n      MRI.getTargetRegisterInfo()->getPointerRegClass(MF);\n  unsigned Zero = MRI.createVirtualRegister(PtrRC);\n  unsigned Drop = MRI.createVirtualRegister(PtrRC);\n  const auto *TII = MF.getSubtarget<WebAssemblySubtarget>().getInstrInfo();\n\n  BuildMI(MBB, InsertAddr, DL, TII->get(WebAssembly::CONST_I32), Zero)\n      .addImm(0);\n  MachineMemOperand *MMO = MF.getMachineMemOperand(\n      MachinePointerInfo(MF.getPSVManager().getExternalSymbolCallEntry(ES)),\n      MachineMemOperand::MOStore, 4, 4);\n  BuildMI(MBB, InsertStore, DL, TII->get(WebAssembly::STORE_I32), Drop)\n      .addExternalSymbol(SPSymbol)\n      .addReg(Zero)\n      .addImm(2)  \/\/ p2align\n      .addReg(SrcReg)\n      .addMemOperand(MMO);\n}\n\nMachineBasicBlock::iterator\nWebAssemblyFrameLowering::eliminateCallFramePseudoInstr(\n    MachineFunction &MF, MachineBasicBlock &MBB,\n    MachineBasicBlock::iterator I) const {\n  assert(!I->getOperand(0).getImm() && hasFP(MF) &&\n         \"Call frame pseudos should only be used for dynamic stack adjustment\");\n  const auto *TII = MF.getSubtarget<WebAssemblySubtarget>().getInstrInfo();\n  if (I->getOpcode() == TII->getCallFrameDestroyOpcode() &&\n      needsSPWriteback(MF, MF.getFrameInfo())) {\n    DebugLoc DL = I->getDebugLoc();\n    writeSPToMemory(WebAssembly::SP32, MF, MBB, I, I, DL);\n  }\n  return MBB.erase(I);\n}\n\nvoid WebAssemblyFrameLowering::emitPrologue(MachineFunction &MF,\n                                            MachineBasicBlock &MBB) const {\n  \/\/ TODO: Do \".setMIFlag(MachineInstr::FrameSetup)\" on emitted instructions\n  auto &MFI = MF.getFrameInfo();\n  assert(MFI.getCalleeSavedInfo().empty() &&\n         \"WebAssembly should not have callee-saved registers\");\n\n  if (!needsSP(MF, MFI)) return;\n  uint64_t StackSize = MFI.getStackSize();\n\n  const auto *TII = MF.getSubtarget<WebAssemblySubtarget>().getInstrInfo();\n  auto &MRI = MF.getRegInfo();\n\n  auto InsertPt = MBB.begin();\n  DebugLoc DL;\n\n  const TargetRegisterClass *PtrRC =\n      MRI.getTargetRegisterInfo()->getPointerRegClass(MF);\n  unsigned Zero = MRI.createVirtualRegister(PtrRC);\n  unsigned SPReg = MRI.createVirtualRegister(PtrRC);\n  const char *ES = \"__stack_pointer\";\n  auto *SPSymbol = MF.createExternalSymbolName(ES);\n  BuildMI(MBB, InsertPt, DL, TII->get(WebAssembly::CONST_I32), Zero)\n      .addImm(0);\n  MachineMemOperand *LoadMMO = MF.getMachineMemOperand(\n      MachinePointerInfo(MF.getPSVManager().getExternalSymbolCallEntry(ES)),\n      MachineMemOperand::MOLoad, 4, 4);\n  \/\/ Load the SP value.\n  BuildMI(MBB, InsertPt, DL, TII->get(WebAssembly::LOAD_I32),\n          StackSize ? SPReg : (unsigned)WebAssembly::SP32)\n      .addExternalSymbol(SPSymbol)\n      .addReg(Zero)    \/\/ addr\n      .addImm(2)       \/\/ p2align\n      .addMemOperand(LoadMMO);\n\n  if (StackSize) {\n    \/\/ Subtract the frame size\n    unsigned OffsetReg = MRI.createVirtualRegister(PtrRC);\n    BuildMI(MBB, InsertPt, DL, TII->get(WebAssembly::CONST_I32), OffsetReg)\n        .addImm(StackSize);\n    BuildMI(MBB, InsertPt, DL, TII->get(WebAssembly::SUB_I32),\n            WebAssembly::SP32)\n        .addReg(SPReg)\n        .addReg(OffsetReg);\n  }\n  if (hasFP(MF)) {\n    \/\/ Unlike most conventional targets (where FP points to the saved FP),\n    \/\/ FP points to the bottom of the fixed-size locals, so we can use positive\n    \/\/ offsets in load\/store instructions.\n    BuildMI(MBB, InsertPt, DL, TII->get(WebAssembly::COPY),\n            WebAssembly::FP32)\n        .addReg(WebAssembly::SP32);\n  }\n  if (StackSize && needsSPWriteback(MF, MFI)) {\n    writeSPToMemory(WebAssembly::SP32, MF, MBB, InsertPt, InsertPt, DL);\n  }\n}\n\nvoid WebAssemblyFrameLowering::emitEpilogue(MachineFunction &MF,\n                                            MachineBasicBlock &MBB) const {\n  auto &MFI = MF.getFrameInfo();\n  uint64_t StackSize = MFI.getStackSize();\n  if (!needsSP(MF, MFI) || !needsSPWriteback(MF, MFI)) return;\n  const auto *TII = MF.getSubtarget<WebAssemblySubtarget>().getInstrInfo();\n  auto &MRI = MF.getRegInfo();\n  auto InsertPt = MBB.getFirstTerminator();\n  DebugLoc DL;\n\n  if (InsertPt != MBB.end())\n    DL = InsertPt->getDebugLoc();\n\n  \/\/ Restore the stack pointer. If we had fixed-size locals, add the offset\n  \/\/ subtracted in the prolog.\n  unsigned SPReg = 0;\n  MachineBasicBlock::iterator InsertAddr = InsertPt;\n  if (StackSize) {\n    const TargetRegisterClass *PtrRC =\n        MRI.getTargetRegisterInfo()->getPointerRegClass(MF);\n    unsigned OffsetReg = MRI.createVirtualRegister(PtrRC);\n    InsertAddr =\n        BuildMI(MBB, InsertPt, DL, TII->get(WebAssembly::CONST_I32), OffsetReg)\n            .addImm(StackSize);\n    \/\/ In the epilog we don't need to write the result back to the SP32 physreg\n    \/\/ because it won't be used again. We can use a stackified register instead.\n    SPReg = MRI.createVirtualRegister(PtrRC);\n    BuildMI(MBB, InsertPt, DL, TII->get(WebAssembly::ADD_I32), SPReg)\n        .addReg(hasFP(MF) ? WebAssembly::FP32 : WebAssembly::SP32)\n        .addReg(OffsetReg);\n  } else {\n    SPReg = hasFP(MF) ? WebAssembly::FP32 : WebAssembly::SP32;\n  }\n\n  writeSPToMemory(SPReg, MF, MBB, InsertAddr, InsertPt, DL);\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>IsoLangEntry to IsoLanguageCountryEntry<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/\/ @author Andrew Hundt <athundt@gmail.com>\n\n#ifndef _VREP_VF_CONTROLLER_\n#define _VREP_VF_CONTROLLER_\n\n#include <string>\n#include <tuple>\n#include <boost\/format.hpp>\n#include <Eigen\/Core>\n#include <Eigen\/Geometry>\n\n#include <sawConstraintController\/mtsVFController.h>\n\n#include \"grl\/cisst\/GrlVFController.hpp\"\n#include \"grl\/vrep\/Vrep.hpp\"\n#include \"grl\/vrep\/VrepRobotArmDriver.hpp\"\n#include \"grl\/vrep\/Eigen.hpp\"\n\n#include <boost\/lexical_cast.hpp>\n\nnamespace grl {\n\n\/\/\/ This handles a whole vrep path object\nclass DesiredKinematicsPath {\n  \n    enum  VrepVFControllerParamsIndex {\n        DesiredKinematicsObjectName\n    };\n    \n    typedef std::tuple<\n            std::string \/\/ DesiredKinematicsObjectName\n        > VrepVFControllerParams;\n    \n    \n    void construct()\n    {\n        \n    }\n    \n    Eigen::Affine3d getDesiredPose(){\n        \n    }\n};\n\n\/\/\/ This handles a specific vrep pose\nclass DesiredKinematicsObject {\n  \n    enum  VrepVFControllerParamsIndex {\n        DesiredKinematicsObjectName\n    };\n    \n    std::tuple<\n            std::string \/\/ DesiredKinematicsObjectName\n        > Params;\n    \n    void construct()\n    {\n        \n    }\n    \n    \n    Eigen::Affine3d getDesiredPose(){\n        \n    }\n};\n\n\/\/\/ @todo verify Robotiiwa is the correct base, and RobotMillTipTarget is the right target, because if the transform doesn't match the one in the jacobian the algorithm will break\n\/\/template<typename DesiredKinematics = DesiredKinematicsObject>\nclass VrepInverseKinematicsController : public grl::InverseKinematicsController\n{\npublic:\n    typedef InverseKinematicsController parent_type;\n    \n    \/\/using parent_type::currentKinematicsStateP_;\n    \/\/using parent_type::parent_type::InitializeKinematicsState;\n  \n    enum  VrepVFControllerParamsIndex {\n        DesiredKinematicsObjectName,\n        IKGroupName\n    };\n    \n    typedef std::tuple<\n             std::string \/\/ DesiredKinematicsObjectName\n            ,std::string \/\/ IKGroupName\n        > Params;\n    \n    static Params defaultParams()\n    {\n       return std::make_tuple(\"RobotMillTipTarget\",\"IK_Group1_iiwa\");\n    }\n    \n    \/\/\/ @todo need to call parent constructor:\n        \/*! Constructor\n    *\/\n    VrepInverseKinematicsController(size_t num_joints = 7, mtsVFBase::CONTROLLERMODE cm = mtsVFBase::CONTROLLERMODE::JPOS):\n     InverseKinematicsController(num_joints,cm)\n    {\n    }\n    \n    void construct(Params params = defaultParams()){\n        \/\/ get kinematics group name\n        \/\/ get number of joints\n        VrepRobotArmDriverP_ = std::make_shared<vrep::VrepRobotArmDriver>();\n        VrepRobotArmDriverP_->construct();\n        \n        ikGroupHandle_ = simGetIkGroupHandle(std::get<IKGroupName>(params).c_str());\n        simSetExplicitHandling(ikGroupHandle_,1); \/\/ enable explicit handling for the ik\n\n        this->currentKinematicsStateP_->Name = std::get<IKGroupName>(params);\n        \n        this->desiredKinematicsStateP_->Name = std::get<DesiredKinematicsObjectName>(params);\n        \n        \/\/\/ @todo set desiredKinematicsStateP name, INITIALIZE ALL MEMBER OBJECTS, & SET NAMES\n        \/\/\n        positionLimitsName = std::get<IKGroupName>(params)+\"_PositionLimits\";\n        this->jointPositionLimitsVFP_->Name = positionLimitsName;\n        \n        velocityLimitsName = std::get<IKGroupName>(params)+\"_VelocityLimits\";\n        this->jointVelocityLimitsVFP_->Name = velocityLimitsName;\n        \n\/\/            \/\/\/ This will hold the Jacobian\n\/\/    std::unique_ptr<prmKinematicsState> currentKinematicsStateP_;\n\/\/    \n\/\/    \/\/\/ This will hold the xyz position and the rotation of where I want to go\n\/\/    std::unique_ptr<prmKinematicsState> desiredKinematicsStateP_;\n\/\/    \n\/\/    \/\/ want to follow a goal position\n\/\/    \/\/\/ @todo will want to use an addVFFollow member function once it is added in\n\/\/    std::unique_ptr<mtsVFDataBase> followVFP_;\n\/\/    \n\/\/    \/\/\/ need velocity limits for the joints\n\/\/    std::unique_ptr<mtsVFDataJointLimits> jointVelocityLimitsVFP_;\n\/\/    \/\/\/ joints cannot go to certain position\n\/\/    std::unique_ptr<mtsVFDataJointLimits> jointPositionLimitsVFP_;\n        \n        \/\/\/ @todo verify object lifetimes\n        \/\/parent_type::parent_type::InitializeKinematicsState(this->currentKinematicsStateP_)\n        \n            \/\/ for each virtual fixture need names and number of rows\n        \n        \n        \/\/\/ @todo read objective rows from vrep\n        \n        \/\/ Initialize Variables for update\n        \/\/jointHandles_ = VrepRobotArmDriverP_->getJointHandles();\n        \/\/int numJoints =jointHandles_.size();\n        \n        \/\/\/ @todo objectiveRows seems to currently be a 3 vector, may eventually want a rotation and translation, perhaps with quaternion rotation\n        followVFP_->ObjectiveRows = 3;\n        \/\/ set the names once for each object, only once\n        followVFP_->KinNames.push_back(currentKinematicsStateP_->Name);\n        followVFP_->KinNames.push_back(desiredKinematicsStateP_->Name);\n        \n        AddVFFollowPath(*followVFP_);\n        \n        \/\/\/ @todo set vrep explicit handling of IK here, plus unset in destructor of this object\n    }\n    \n    \/\/\/ check out sawConstraintController\n    void updateKinematics(){\n    \n        \/\/ Initialize Variables for update\n        jointHandles_ = VrepRobotArmDriverP_->getJointHandles();\n        int numJoints =jointHandles_.size();\n        std::vector<float> ikCalculatedJointValues(numJoints,0);\n        VrepRobotArmDriverP_->getState(currentArmState_);\n        \n        \/\/\/ Run inverse kinematics, but all we really want is the jacobian\n        \/\/\/ @todo find version that only returns jacobian\n        \/\/\/ @see http:\/\/www.coppeliarobotics.com\/helpFiles\/en\/apiFunctions.htm#simCheckIkGroup\n        auto ikcalcResult =\n        simCheckIkGroup(ikGroupHandle_\n                       ,numJoints\n                       ,&jointHandles_[0]\n                       ,&ikCalculatedJointValues[0]\n                       ,NULL \/\/\/ @todo do we need to use these options?\n                       );\n        \/\/\/ @see http:\/\/www.coppeliarobotics.com\/helpFiles\/en\/apiConstants.htm#ikCalculationResults\n        if(ikcalcResult!=sim_ikresult_success && ikcalcResult != sim_ikresult_not_performed)\n        {\n            BOOST_LOG_TRIVIAL(error) << \"VrepInverseKinematicsController: didn't run inverse kinematics\";\n            return;\n        }\n        \n        \/\/ Get the Jacobian\n        int jacobianSize[2];\n        float* jacobian=simGetIkGroupMatrix(ikGroupHandle_,0,jacobianSize);\n        \/\/\/ @todo FIX HACK jacobianSize include orientation component, should be 7x6 instead of 7x3\n        jacobianSize[1] = 3;\n        \n        \/\/\/ The row\/column major order is swapped between cisst and VREP!\n        this->currentKinematicsStateP_->Jacobian.SetSize(jacobianSize[1],jacobianSize[0]);\n        \n        \n        \/\/ Transfer the Jacobian to cisst\n\n        \/\/ jacobianSize[0] represents the row count of the Jacobian \n        \/\/ (i.e. the number of equations or the number of joints involved\n        \/\/ in the IK resolution of the given kinematic chain)\n        \/\/ Joints appear from tip to base.\n\n        \/\/ jacobianSize[1] represents the column count of the Jacobian \n        \/\/ (i.e. the number of constraints, e.g. x,y,z,alpha,beta,gamma,jointDependency)\n\n        \/\/ The Jacobian data is ordered row-wise, i.e.:\n        \/\/ [row0,col0],[row1,col0],..,[rowN,col0],[row0,col1],[row1,col1],etc.\n\n        std::string str;\n        str+=\"\\n\";\n        for (int i=0;i<jacobianSize[0];i++)\n        {\n            for (int j=0;j<jacobianSize[1];j++)\n            {\n                str+=boost::str(boost::format(\"%.1e\") % jacobian[static_cast<int>(j*jacobianSize[0]+i)]);\n                if (j<jacobianSize[1]-1)\n                    str+=\", \";\n                float currentValue = jacobian[static_cast<int>(j*jacobianSize[0]+i)];\n            \n                \/\/\/ The row\/column major order is swapped between cisst and VREP!\n                this->currentKinematicsStateP_->Jacobian[j][jacobianSize[0]-i-1] = currentValue;\n            }\n            str+=\"\\n\";\n        }\n        BOOST_LOG_TRIVIAL(trace) << str;\n        \n        \n        \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n        \/\/\/ @todo Set Current Joint State\n        \n        \/\/ currentKinematicsStateP_->JointState = ...\n        \/\/ prmJointState* JointState;\n        \n        \n        \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n        \/\/ Copy Joint Interval, the range of motion for each joint\n        \n        \n        \/\/ lower limits\n        auto & llim = std::get<vrep::VrepRobotArmDriver::JointLowerPositionLimit>(currentArmState_);\n        std::vector<double> llimits(llim.begin(),llim.end());\n        jointPositionLimitsVFP_->LowerLimits = vctDoubleVec(llimits.size(),&llimits[0]);\n        \n        \/\/ upper limits\n        auto & ulim = std::get<vrep::VrepRobotArmDriver::JointUpperPositionLimit>(currentArmState_);\n        std::vector<double> ulimits(ulim.begin(),ulim.end());\n        jointPositionLimitsVFP_->UpperLimits = vctDoubleVec(ulimits.size(),&ulimits[0]);\n        \n        \/\/\/ @todo get target position, probably relative to base\n        const auto& handleParams = VrepRobotArmDriverP_->getVrepHandleParams();\n        \n        \n        Eigen::Affine3d currentEndEffectorPose =\n        getObjectTransform(\n                             std::get<vrep::VrepRobotArmDriver::RobotTipName>(handleParams)\n                            ,std::get<vrep::VrepRobotArmDriver::RobotTargetBaseName>(handleParams)\n                          );\n        auto  currentEigenT = currentEndEffectorPose.translation();\n        auto& currentCisstT = currentKinematicsStateP_->Frame.Translation();\n        currentCisstT[0] = currentEigenT(0);\n        currentCisstT[1] = currentEigenT(1);\n        currentCisstT[2] = currentEigenT(2);\n        \/\/\/ @todo set rotation component of desired position\n        \n        \n        Eigen::Affine3d desiredEndEffectorPose =\n        getObjectTransform(\n                             std::get<vrep::VrepRobotArmDriver::RobotTargetName>(handleParams)\n                            ,std::get<vrep::VrepRobotArmDriver::RobotTargetBaseName>(handleParams)\n                          );\n        auto  desiredEigenT = desiredEndEffectorPose.translation();\n        auto& desiredCisstT = desiredKinematicsStateP_->Frame.Translation();\n        desiredCisstT[0] = desiredEigenT(0);\n        desiredCisstT[1] = desiredEigenT(1);\n        desiredCisstT[2] = desiredEigenT(2);\n        \/\/\/ @todo set rotation component of desired position\n        \n        \/\/ for debugging, the translation between the current and desired position in cartesian coordinates\n        auto inputDesired_dx = desiredCisstT - currentCisstT;\n        \n        SetKinematics(*currentKinematicsStateP_);  \/\/ replaced by name of object\n        \/\/ fill these out in the desiredKinematicsStateP_\n        \/\/RotationType RotationMember; \/\/ vcRot3\n        \/\/TranslationType TranslationMember; \/\/ vct3\n    \n        SetKinematics(*desiredKinematicsStateP_); \/\/ replaced by name of object\n        \/\/ call setKinematics with the new kinematics\n        \/\/ sawconstraintcontroller has kinematicsState\n        \/\/ set the jacobian here\n        \n        \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n        \/\/\/ @todo move code below here back under run_one updateKinematics() call\n        \n       \/\/\/ @todo need to provide tick time in double seconds and get from vrep API call\n       UpdateOptimizer(0.01);\n       \n       vctDoubleVec jointAngles_dt;\n       auto returncode = Solve(jointAngles_dt);\n       \n       \n       \/\/\/ @todo check the return code, if it doesn't have a result, use the VREP version as a fallback and report an error.\n       if(returncode != nmrConstraintOptimizer::NMR_OK) BOOST_THROW_EXCEPTION(std::runtime_error(\"VrepInverseKinematicsController: constrained optimization error, please investigate\"));\n       \n       \n       \/\/\/ @todo: rethink where\/when\/how to send command for the joint angles. Return to LUA? Set Directly? Distribute via vrep send message command?\n        \/\/std::string str;\n        str = \"\";\n       for (int i=0 ; i < jointHandles_.size() ; i++)\n       {\n          float currentAngle;\n          auto ret = simGetJointPosition(jointHandles_[i],&currentAngle);\n          BOOST_VERIFY(ret!=-1);\n          float futureAngle = currentAngle + jointAngles_dt[i];\n          \/\/simSetJointTargetPosition(jointHandles_[i],jointAngles_dt[i]);\n          simSetJointPosition(jointHandles_[i],futureAngle);\n                str+=boost::lexical_cast<std::string>(jointAngles_dt[i]);\n                if (i<jointHandles_.size()-1)\n                    str+=\", \";\n       }\n        BOOST_LOG_TRIVIAL(trace) << \"jointAngles_dt: \"<< str;\n        \n        auto optimizerCalculated_dx = this->currentKinematicsStateP_->Jacobian * jointAngles_dt;\n       \n        BOOST_LOG_TRIVIAL(trace) << \"desired dx: \" << inputDesired_dx << \" optimizer Calculated dx: \" << optimizerCalculated_dx;\n    }\n    \n    \/\/\/ may not need this it is in the base class\n    \/\/\/ blocking call, call in separate thread, just allocates memory\n    void run_one(){\n       updateKinematics();\n       \n    }\n    \n    \n    \/\/\/ may not need this it is in the base class\n    \/\/\/ this will have output\n    \/\/\/ blocking call, call in separate thread, just allocates memory\n    \/\/\/ this runs the actual optimization algorithm\n    void solve(){\n        \n    }\n    \n    std::vector<int> jointHandles_; \/\/\/< @todo move this item back into VrepRobotArmDriver\n    int ikGroupHandle_;\n    std::shared_ptr<vrep::VrepRobotArmDriver> VrepRobotArmDriverP_;\n    vrep::VrepRobotArmDriver::State currentArmState_;\n    std::string positionLimitsName;\n    std::string velocityLimitsName;\n};\n\n} \/\/ namespace grl\n\n#endif<commit_msg>added ifdef to test solving for rotation component of robot motion<commit_after>\/\/\/ @author Andrew Hundt <athundt@gmail.com>\n\n#ifndef _VREP_VF_CONTROLLER_\n#define _VREP_VF_CONTROLLER_\n\n#include <string>\n#include <tuple>\n#include <boost\/format.hpp>\n#include <Eigen\/Core>\n#include <Eigen\/Geometry>\n\n#include <sawConstraintController\/mtsVFController.h>\n\n#include \"grl\/cisst\/GrlVFController.hpp\"\n#include \"grl\/vrep\/Vrep.hpp\"\n#include \"grl\/vrep\/VrepRobotArmDriver.hpp\"\n#include \"grl\/vrep\/Eigen.hpp\"\n\n#include <boost\/lexical_cast.hpp>\n#include <boost\/range\/algorithm\/copy.hpp>\n\nnamespace grl {\n\n\/\/\/ This handles a whole vrep path object\nclass DesiredKinematicsPath {\n  \n    enum  VrepVFControllerParamsIndex {\n        DesiredKinematicsObjectName\n    };\n    \n    typedef std::tuple<\n            std::string \/\/ DesiredKinematicsObjectName\n        > VrepVFControllerParams;\n    \n    \n    void construct()\n    {\n        \n    }\n    \n    Eigen::Affine3d getDesiredPose(){\n        \n    }\n};\n\n\/\/\/ This handles a specific vrep pose\nclass DesiredKinematicsObject {\n  \n    enum  VrepVFControllerParamsIndex {\n        DesiredKinematicsObjectName\n    };\n    \n    std::tuple<\n            std::string \/\/ DesiredKinematicsObjectName\n        > Params;\n    \n    void construct()\n    {\n        \n    }\n    \n    \n    Eigen::Affine3d getDesiredPose(){\n        \n    }\n};\n\n\/\/\/ @todo verify Robotiiwa is the correct base, and RobotMillTipTarget is the right target, because if the transform doesn't match the one in the jacobian the algorithm will break\n\/\/template<typename DesiredKinematics = DesiredKinematicsObject>\nclass VrepInverseKinematicsController : public grl::InverseKinematicsController\n{\npublic:\n    typedef InverseKinematicsController parent_type;\n    \n    \/\/using parent_type::currentKinematicsStateP_;\n    \/\/using parent_type::parent_type::InitializeKinematicsState;\n  \n    enum  VrepVFControllerParamsIndex {\n        DesiredKinematicsObjectName,\n        IKGroupName\n    };\n    \n    typedef std::tuple<\n             std::string \/\/ DesiredKinematicsObjectName\n            ,std::string \/\/ IKGroupName\n        > Params;\n    \n    static Params defaultParams()\n    {\n       return std::make_tuple(\"RobotMillTipTarget\",\"IK_Group1_iiwa\");\n    }\n    \n    \/\/\/ @todo need to call parent constructor:\n        \/*! Constructor\n    *\/\n    VrepInverseKinematicsController(size_t num_joints = 7, mtsVFBase::CONTROLLERMODE cm = mtsVFBase::CONTROLLERMODE::JPOS):\n     InverseKinematicsController(num_joints,cm)\n    {\n    }\n    \n    void construct(Params params = defaultParams()){\n        \/\/ get kinematics group name\n        \/\/ get number of joints\n        VrepRobotArmDriverP_ = std::make_shared<vrep::VrepRobotArmDriver>();\n        VrepRobotArmDriverP_->construct();\n        \n        ikGroupHandle_ = simGetIkGroupHandle(std::get<IKGroupName>(params).c_str());\n        simSetExplicitHandling(ikGroupHandle_,1); \/\/ enable explicit handling for the ik\n\n        this->currentKinematicsStateP_->Name = std::get<IKGroupName>(params);\n        \n        this->desiredKinematicsStateP_->Name = std::get<DesiredKinematicsObjectName>(params);\n        \n        \/\/\/ @todo set desiredKinematicsStateP name, INITIALIZE ALL MEMBER OBJECTS, & SET NAMES\n        \/\/\n        positionLimitsName = std::get<IKGroupName>(params)+\"_PositionLimits\";\n        this->jointPositionLimitsVFP_->Name = positionLimitsName;\n        \n        velocityLimitsName = std::get<IKGroupName>(params)+\"_VelocityLimits\";\n        this->jointVelocityLimitsVFP_->Name = velocityLimitsName;\n        \n\/\/            \/\/\/ This will hold the Jacobian\n\/\/    std::unique_ptr<prmKinematicsState> currentKinematicsStateP_;\n\/\/    \n\/\/    \/\/\/ This will hold the xyz position and the rotation of where I want to go\n\/\/    std::unique_ptr<prmKinematicsState> desiredKinematicsStateP_;\n\/\/    \n\/\/    \/\/ want to follow a goal position\n\/\/    \/\/\/ @todo will want to use an addVFFollow member function once it is added in\n\/\/    std::unique_ptr<mtsVFDataBase> followVFP_;\n\/\/    \n\/\/    \/\/\/ need velocity limits for the joints\n\/\/    std::unique_ptr<mtsVFDataJointLimits> jointVelocityLimitsVFP_;\n\/\/    \/\/\/ joints cannot go to certain position\n\/\/    std::unique_ptr<mtsVFDataJointLimits> jointPositionLimitsVFP_;\n        \n        \/\/\/ @todo verify object lifetimes\n        \/\/parent_type::parent_type::InitializeKinematicsState(this->currentKinematicsStateP_)\n        \n            \/\/ for each virtual fixture need names and number of rows\n        \n        \n        \/\/\/ @todo read objective rows from vrep\n        \n        \/\/ Initialize Variables for update\n        \/\/jointHandles_ = VrepRobotArmDriverP_->getJointHandles();\n        \/\/int numJoints =jointHandles_.size();\n        \n#ifdef HANDLE_ROTATION\n        \/\/\/ @todo objectiveRows seems to currently be a 3 vector, may eventually want a rotation and translation, perhaps with quaternion rotation\n        followVFP_->ObjectiveRows = 6;\n#else\n        followVFP_->ObjectiveRows = 3;\n#endif\n        \/\/ set the names once for each object, only once\n        followVFP_->KinNames.push_back(currentKinematicsStateP_->Name);\n        followVFP_->KinNames.push_back(desiredKinematicsStateP_->Name);\n        \n        AddVFFollowPath(*followVFP_);\n        \n        \/\/\/ @todo set vrep explicit handling of IK here, plus unset in destructor of this object\n    }\n    \n    \/\/\/ check out sawConstraintController\n    void updateKinematics(){\n    \n        \/\/ Initialize Variables for update\n        jointHandles_ = VrepRobotArmDriverP_->getJointHandles();\n        int numJoints =jointHandles_.size();\n        std::vector<float> ikCalculatedJointValues(numJoints,0);\n        VrepRobotArmDriverP_->getState(currentArmState_);\n        \n        \/\/\/ Run inverse kinematics, but all we really want is the jacobian\n        \/\/\/ @todo find version that only returns jacobian\n        \/\/\/ @see http:\/\/www.coppeliarobotics.com\/helpFiles\/en\/apiFunctions.htm#simCheckIkGroup\n        auto ikcalcResult =\n        simCheckIkGroup(ikGroupHandle_\n                       ,numJoints\n                       ,&jointHandles_[0]\n                       ,&ikCalculatedJointValues[0]\n                       ,NULL \/\/\/ @todo do we need to use these options?\n                       );\n        \/\/\/ @see http:\/\/www.coppeliarobotics.com\/helpFiles\/en\/apiConstants.htm#ikCalculationResults\n        if(ikcalcResult!=sim_ikresult_success && ikcalcResult != sim_ikresult_not_performed)\n        {\n            BOOST_LOG_TRIVIAL(error) << \"VrepInverseKinematicsController: didn't run inverse kinematics\";\n            return;\n        }\n        \n        \/\/ Get the Jacobian\n        int jacobianSize[2];\n        float* jacobian=simGetIkGroupMatrix(ikGroupHandle_,0,jacobianSize);\n        \/\/\/ @todo FIX HACK jacobianSize include orientation component, should be 7x6 instead of 7x3\n        \n#ifndef HANDLE_ROTATION\n        jacobianSize[1] = 3;\n#endif\n        \n        \/\/\/ The row\/column major order is swapped between cisst and VREP!\n        this->currentKinematicsStateP_->Jacobian.SetSize(jacobianSize[1],jacobianSize[0]);\n        \n        \n        \/\/ Transfer the Jacobian to cisst\n\n        \/\/ jacobianSize[0] represents the row count of the Jacobian \n        \/\/ (i.e. the number of equations or the number of joints involved\n        \/\/ in the IK resolution of the given kinematic chain)\n        \/\/ Joints appear from tip to base.\n\n        \/\/ jacobianSize[1] represents the column count of the Jacobian \n        \/\/ (i.e. the number of constraints, e.g. x,y,z,alpha,beta,gamma,jointDependency)\n\n        \/\/ The Jacobian data is ordered row-wise, i.e.:\n        \/\/ [row0,col0],[row1,col0],..,[rowN,col0],[row0,col1],[row1,col1],etc.\n\n        std::string str;\n        str+=\"\\n\";\n        for (int i=0;i<jacobianSize[0];i++)\n        {\n            for (int j=0;j<jacobianSize[1];j++)\n            {\n                str+=boost::str(boost::format(\"%.1e\") % jacobian[static_cast<int>(j*jacobianSize[0]+i)]);\n                if (j<jacobianSize[1]-1)\n                    str+=\", \";\n                float currentValue = jacobian[static_cast<int>(j*jacobianSize[0]+i)];\n            \n                \/\/\/ The row\/column major order is swapped between cisst and VREP!\n                this->currentKinematicsStateP_->Jacobian[j][jacobianSize[0]-i-1] = currentValue;\n            }\n            str+=\"\\n\";\n        }\n        BOOST_LOG_TRIVIAL(trace) << str;\n        \n        \n        \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n        \/\/\/ @todo Set Current Joint State\n        \n        \/\/ currentKinematicsStateP_->JointState = ...\n        \/\/ prmJointState* JointState;\n        \n        \n        \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n        \/\/ Copy Joint Interval, the range of motion for each joint\n        \n        \n        \/\/ lower limits\n        auto & llim = std::get<vrep::VrepRobotArmDriver::JointLowerPositionLimit>(currentArmState_);\n        std::vector<double> llimits(llim.begin(),llim.end());\n        jointPositionLimitsVFP_->LowerLimits = vctDoubleVec(llimits.size(),&llimits[0]);\n        \n        \/\/ upper limits\n        auto & ulim = std::get<vrep::VrepRobotArmDriver::JointUpperPositionLimit>(currentArmState_);\n        std::vector<double> ulimits(ulim.begin(),ulim.end());\n        jointPositionLimitsVFP_->UpperLimits = vctDoubleVec(ulimits.size(),&ulimits[0]);\n        \n        \/\/\/ @todo get target position, probably relative to base\n        const auto& handleParams = VrepRobotArmDriverP_->getVrepHandleParams();\n        \n        \n        Eigen::Affine3d currentEndEffectorPose =\n        getObjectTransform(\n                             std::get<vrep::VrepRobotArmDriver::RobotTipName>(handleParams)\n                            ,std::get<vrep::VrepRobotArmDriver::RobotTargetBaseName>(handleParams)\n                          );\n        auto  currentEigenT = currentEndEffectorPose.translation();\n        auto& currentCisstT = currentKinematicsStateP_->Frame.Translation();\n        currentCisstT[0] = currentEigenT(0);\n        currentCisstT[1] = currentEigenT(1);\n        currentCisstT[2] = currentEigenT(2);\n#ifdef HANDLE_ROTATION\n        Eigen::Map<Eigen::Matrix<double,3,3,Eigen::RowMajor>> ccr(currentKinematicsStateP_->Frame.Rotation().Pointer());\n        ccr = currentEndEffectorPose.rotation();\n#endif \/\/ HANDLE_ROTATION\n        \/\/\/ @todo set rotation component of current position\n        \n        \n        Eigen::Affine3d desiredEndEffectorPose =\n        getObjectTransform(\n                             std::get<vrep::VrepRobotArmDriver::RobotTargetName>(handleParams)\n                            ,std::get<vrep::VrepRobotArmDriver::RobotTargetBaseName>(handleParams)\n                          );\n        auto  desiredEigenT = desiredEndEffectorPose.translation();\n        auto& desiredCisstT = desiredKinematicsStateP_->Frame.Translation();\n        desiredCisstT[0] = desiredEigenT(0);\n        desiredCisstT[1] = desiredEigenT(1);\n        desiredCisstT[2] = desiredEigenT(2);\n#ifdef HANDLE_ROTATION\n        Eigen::Map<Eigen::Matrix<double,3,3,Eigen::RowMajor>> dcr(desiredKinematicsStateP_->Frame.Rotation().Pointer());\n        dcr = desiredEndEffectorPose.rotation();\n#endif \/\/ HANDLE_ROTATION\n        \/\/\/ @todo set rotation component of desired position\n        \n        \/\/ for debugging, the translation between the current and desired position in cartesian coordinates\n        auto inputDesired_dx = desiredCisstT - currentCisstT;\n        \n        SetKinematics(*currentKinematicsStateP_);  \/\/ replaced by name of object\n        \/\/ fill these out in the desiredKinematicsStateP_\n        \/\/RotationType RotationMember; \/\/ vcRot3\n        \/\/TranslationType TranslationMember; \/\/ vct3\n    \n        SetKinematics(*desiredKinematicsStateP_); \/\/ replaced by name of object\n        \/\/ call setKinematics with the new kinematics\n        \/\/ sawconstraintcontroller has kinematicsState\n        \/\/ set the jacobian here\n        \n        \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n        \/\/\/ @todo move code below here back under run_one updateKinematics() call\n        \n       \/\/\/ @todo need to provide tick time in double seconds and get from vrep API call\n       UpdateOptimizer(0.01);\n       \n       vctDoubleVec jointAngles_dt;\n       auto returncode = Solve(jointAngles_dt);\n       \n       \n       \/\/\/ @todo check the return code, if it doesn't have a result, use the VREP version as a fallback and report an error.\n       if(returncode != nmrConstraintOptimizer::NMR_OK) BOOST_THROW_EXCEPTION(std::runtime_error(\"VrepInverseKinematicsController: constrained optimization error, please investigate\"));\n       \n       \n       \/\/\/ @todo: rethink where\/when\/how to send command for the joint angles. Return to LUA? Set Directly? Distribute via vrep send message command?\n        \/\/std::string str;\n        str = \"\";\n       for (int i=0 ; i < jointHandles_.size() ; i++)\n       {\n          float currentAngle;\n          auto ret = simGetJointPosition(jointHandles_[i],&currentAngle);\n          BOOST_VERIFY(ret!=-1);\n          float futureAngle = currentAngle + jointAngles_dt[i];\n          \/\/simSetJointTargetPosition(jointHandles_[i],jointAngles_dt[i]);\n          simSetJointPosition(jointHandles_[i],futureAngle);\n                str+=boost::lexical_cast<std::string>(jointAngles_dt[i]);\n                if (i<jointHandles_.size()-1)\n                    str+=\", \";\n       }\n        BOOST_LOG_TRIVIAL(trace) << \"jointAngles_dt: \"<< str;\n        \n        auto optimizerCalculated_dx = this->currentKinematicsStateP_->Jacobian * jointAngles_dt;\n       \n        BOOST_LOG_TRIVIAL(trace) << \"desired dx: \" << inputDesired_dx << \" optimizer Calculated dx: \" << optimizerCalculated_dx;\n    }\n    \n    \/\/\/ may not need this it is in the base class\n    \/\/\/ blocking call, call in separate thread, just allocates memory\n    void run_one(){\n       updateKinematics();\n       \n    }\n    \n    \n    \/\/\/ may not need this it is in the base class\n    \/\/\/ this will have output\n    \/\/\/ blocking call, call in separate thread, just allocates memory\n    \/\/\/ this runs the actual optimization algorithm\n    void solve(){\n        \n    }\n    \n    std::vector<int> jointHandles_; \/\/\/< @todo move this item back into VrepRobotArmDriver\n    int ikGroupHandle_;\n    std::shared_ptr<vrep::VrepRobotArmDriver> VrepRobotArmDriverP_;\n    vrep::VrepRobotArmDriver::State currentArmState_;\n    std::string positionLimitsName;\n    std::string velocityLimitsName;\n};\n\n} \/\/ namespace grl\n\n#endif<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************************\n *                                                                                       *\n * OpenSpace                                                                             *\n *                                                                                       *\n * Copyright (c) 2014-2021                                                               *\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 <ghoul\/fmt.h>\n#include <ghoul\/glm.h>\n#include <ghoul\/misc\/dictionaryjsonformatter.h>\n#include <type_traits>\n\nnamespace openspace {\n\nnamespace internal {\n\ntemplate <class T, class... Ts>\nstruct is_any : std::disjunction<std::is_same<T, Ts>...> {};\n\ntemplate <typename T>\nconstexpr bool isGlmMatrix() {\n    return is_any<T,\n        glm::mat2x2, glm::mat2x3, glm::mat2x4,\n        glm::mat3x2, glm::mat3x3, glm::mat3x4,\n        glm::mat4x2, glm::mat4x3, glm::mat4x4,\n        glm::dmat2x2, glm::dmat2x3, glm::dmat2x4,\n        glm::dmat3x2, glm::dmat3x3, glm::dmat3x4,\n        glm::dmat4x2, glm::dmat4x3, glm::dmat4x4>::value;\n}\n\ntemplate <typename T>\nconstexpr bool isGlmVector() {\n    return is_any<T,\n        glm::vec2, glm::vec3, glm::vec4,\n        glm::ivec2, glm::ivec3, glm::ivec4,\n        glm::dvec2, glm::dvec3, glm::dvec4,\n        glm::uvec2, glm::uvec3, glm::uvec4>::value;\n}\n\n} \/\/ namespace internal\n\ntemplate <typename T>\nstd::string formatJson(T value) {\n    if constexpr (std::is_same_v<T, bool>) {\n        return value ? \"true\" : \"false\";\n    }\n    else if constexpr (std::is_arithmetic_v<T>) {\n        return formatJsonNumber(static_cast<double>(value));\n    }\n    else if constexpr (std::is_same_v<T, std::string>) {\n        return escapedJson(value);\n    }\n    else if constexpr (std::is_same_v<T, ghoul::Dictionary>) {\n        return return ghoul::formatJson(value);\n    }\n    else if constexpr (internal::isGlmVector<T>()) {\n        std::string values;\n        for (glm::length_t i = 0; i < ghoul::glm_components<T>::value; ++i) {\n            values += std::to_string(value[i]) + ',';\n        }\n        values.pop_back();\n        return fmt::format(\"[{}]\", values);\n    }\n    else if constexpr (internal::isGlmMatrix<T>()) {\n        std::string values;\n        for (glm::length_t i = 0; i < T::type::row_type::length(); ++i) {\n            for (glm::length_t j = 0; j < T::type::col_type::length(); ++j) {\n                values += std::to_string(value[i][j]) + ',';\n            }\n        }\n        values.pop_back();\n        return fmt::format(\"[{}]\", values);\n    }\n    else {\n        static_assert(sizeof(T) == 0, \"JSON formatting of type T not implemented\");\n    }\n}\n\n}  \/\/ namespace openspace\n<commit_msg>Fixed a typo which caused a build error<commit_after>\/*****************************************************************************************\n *                                                                                       *\n * OpenSpace                                                                             *\n *                                                                                       *\n * Copyright (c) 2014-2021                                                               *\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 <ghoul\/fmt.h>\n#include <ghoul\/glm.h>\n#include <ghoul\/misc\/dictionaryjsonformatter.h>\n#include <type_traits>\n\nnamespace openspace {\n\nnamespace internal {\n\ntemplate <class T, class... Ts>\nstruct is_any : std::disjunction<std::is_same<T, Ts>...> {};\n\ntemplate <typename T>\nconstexpr bool isGlmMatrix() {\n    return is_any<T,\n        glm::mat2x2, glm::mat2x3, glm::mat2x4,\n        glm::mat3x2, glm::mat3x3, glm::mat3x4,\n        glm::mat4x2, glm::mat4x3, glm::mat4x4,\n        glm::dmat2x2, glm::dmat2x3, glm::dmat2x4,\n        glm::dmat3x2, glm::dmat3x3, glm::dmat3x4,\n        glm::dmat4x2, glm::dmat4x3, glm::dmat4x4>::value;\n}\n\ntemplate <typename T>\nconstexpr bool isGlmVector() {\n    return is_any<T,\n        glm::vec2, glm::vec3, glm::vec4,\n        glm::ivec2, glm::ivec3, glm::ivec4,\n        glm::dvec2, glm::dvec3, glm::dvec4,\n        glm::uvec2, glm::uvec3, glm::uvec4>::value;\n}\n\n} \/\/ namespace internal\n\ntemplate <typename T>\nstd::string formatJson(T value) {\n    if constexpr (std::is_same_v<T, bool>) {\n        return value ? \"true\" : \"false\";\n    }\n    else if constexpr (std::is_arithmetic_v<T>) {\n        return formatJsonNumber(static_cast<double>(value));\n    }\n    else if constexpr (std::is_same_v<T, std::string>) {\n        return escapedJson(value);\n    }\n    else if constexpr (std::is_same_v<T, ghoul::Dictionary>) {\n        return ghoul::formatJson(value);\n    }\n    else if constexpr (internal::isGlmVector<T>()) {\n        std::string values;\n        for (glm::length_t i = 0; i < ghoul::glm_components<T>::value; ++i) {\n            values += std::to_string(value[i]) + ',';\n        }\n        values.pop_back();\n        return fmt::format(\"[{}]\", values);\n    }\n    else if constexpr (internal::isGlmMatrix<T>()) {\n        std::string values;\n        for (glm::length_t i = 0; i < T::type::row_type::length(); ++i) {\n            for (glm::length_t j = 0; j < T::type::col_type::length(); ++j) {\n                values += std::to_string(value[i][j]) + ',';\n            }\n        }\n        values.pop_back();\n        return fmt::format(\"[{}]\", values);\n    }\n    else {\n        static_assert(sizeof(T) == 0, \"JSON formatting of type T not implemented\");\n    }\n}\n\n}  \/\/ namespace openspace\n<|endoftext|>"}
{"text":"<commit_before>#ifndef SIGMA_TOOLS_TEXTURE_LOADER_HPP\n#define SIGMA_TOOLS_TEXTURE_LOADER_HPP\n\n#include <sigma\/graphics\/texture.hpp>\n#include <sigma\/tools\/hdr_io.hpp>\n#include <sigma\/tools\/json_conversion.hpp>\n#include <sigma\/tools\/packager.hpp>\n#include <sigma\/tools\/texturing.hpp>\n\n#include <boost\/gil\/extension\/io\/jpeg_io.hpp>\n#include <boost\/gil\/extension\/io\/png_io.hpp>\n#include <boost\/gil\/extension\/io\/tiff_io.hpp>\n\n#include <string>\n#include <unordered_map>\n\nnamespace sigma {\nnamespace tools {\n    enum class texture_source_type : unsigned int {\n        tiff,\n        jpeg,\n        png,\n        hdr\n    };\n\n    template <class Image>\n    void load_texture(const boost::filesystem::path& source_file, texture_source_type source_type, Image& image)\n    {\n        auto file_path_string = source_file.string();\n\n        switch (source_type) {\n        case texture_source_type::tiff: {\n            boost::gil::tiff_read_and_convert_image(file_path_string, image);\n            break;\n        }\n        case texture_source_type::jpeg: {\n            boost::gil::jpeg_read_and_convert_image(file_path_string, image);\n            break;\n        }\n        case texture_source_type::png: {\n            boost::gil::png_read_and_convert_image(file_path_string, image);\n            break;\n        }\n        case texture_source_type::hdr: {\n            hdr_read_and_convert_image(file_path_string, image);\n            break;\n        }\n        }\n    }\n\n    template <class PackageSettings, class ContextType>\n    class texture_loader : public resource_loader<PackageSettings, ContextType> {\n    public:\n        texture_loader(ContextType& ctx)\n            : context_{ ctx }\n        {\n        }\n\n        virtual ~texture_loader() = default;\n\n        virtual bool supports_filetype(const std::string& ext) const override\n        {\n            static const std::set<std::string> supported_extensions = {\n                \".tiff\",\n                \".tif\",\n                \".jpg\",\n                \".jpeg\",\n                \".jpe\",\n                \".jif\",\n                \".jfif\",\n                \".jfi\",\n                \".png\",\n                \".hdr\"\n            };\n            return supported_extensions.count(ext) > 0;\n        }\n\n        virtual void load(const PackageSettings& package_settings, const boost::filesystem::path& source_directory, const std::string& ext, const boost::filesystem::path& source_file) override\n        {\n            static const std::unordered_map<std::string, texture_source_type> type_map = {\n                { \".tiff\", texture_source_type::tiff },\n                { \".tif\", texture_source_type::tiff },\n                { \".jpg\", texture_source_type::jpeg },\n                { \".jpeg\", texture_source_type::jpeg },\n                { \".jpe\", texture_source_type::jpeg },\n                { \".jif\", texture_source_type::jpeg },\n                { \".jfif\", texture_source_type::jpeg },\n                { \".jfi\", texture_source_type::jpeg },\n                { \".png\", texture_source_type::png },\n                { \".hdr\", texture_source_type::hdr }\n            };\n\n            auto source_type = type_map.at(ext);\n\n            auto settings_path = source_file.parent_path() \/ (source_file.stem().string() + \".stex\");\n\n            auto rid = resource_shortname(graphics::texture) \/ filesystem::make_relative(source_directory, source_file).replace_extension(\"\");\n\n            auto& texture_cache = context_.template get_cache<graphics::texture>();\n            if (texture_cache.contains({ rid })) {\n                auto h = texture_cache.handle_for({ rid });\n\n                auto source_file_time = boost::filesystem::last_write_time(source_file);\n                auto settings_time = source_file_time;\n                if (boost::filesystem::exists(settings_path))\n                    settings_time = boost::filesystem::last_write_time(settings_path);\n\n                auto resource_time = texture_cache.last_modification_time(h);\n                if (source_file_time <= resource_time && settings_time <= resource_time)\n                    return;\n            }\n\n            std::cout << \"packaging: \" << rid << \"\\n\";\n\n            \/\/ TODO use json conversion\n            Json::Value settings(Json::objectValue);\n            settings[\"format\"] = \"rgb8\";\n            settings[\"filter\"][\"minification\"] = \"linear\";\n            settings[\"filter\"][\"magnification\"] = \"linear\";\n            settings[\"filter\"][\"mipmap\"] = \"linear\";\n\n            if (boost::filesystem::exists(settings_path)) {\n                std::ifstream file(settings_path.string());\n                file >> settings;\n            }\n\n            graphics::texture_filter minification_filter = graphics::texture_filter::LINEAR;\n            graphics::texture_filter magnification_filter = graphics::texture_filter::LINEAR;\n            graphics::texture_filter mipmap_filter = graphics::texture_filter::LINEAR;\n            graphics::texture_format format = graphics::texture_format::RGB8;\n            json::from_json(context_, settings[\"filter\"][\"minification\"], minification_filter);\n            json::from_json(context_, settings[\"filter\"][\"magnification\"], magnification_filter);\n            json::from_json(context_, settings[\"filter\"][\"mipmap\"], mipmap_filter);\n            json::from_json(context_, settings[\"format\"], format);\n\n            switch (format) {\n            case graphics::texture_format::RGB8: {\n                boost::gil::rgb8_image_t image;\n                load_texture(source_file, source_type, image);\n\n                graphics::texture texture(boost::gil::const_view(image), minification_filter, magnification_filter, mipmap_filter);\n                texture_cache.insert({ rid }, texture, true);\n                break;\n            }\n            case graphics::texture_format::RGBA8: {\n                boost::gil::rgba8_image_t image;\n                load_texture(source_file, source_type, image);\n\n                graphics::texture texture(boost::gil::const_view(image), minification_filter, magnification_filter, mipmap_filter);\n                texture_cache.insert({ rid }, texture, true);\n                break;\n            }\n            case graphics::texture_format::RGB32F: {\n                boost::gil::rgb32f_image_t image;\n                load_texture(source_file, source_type, image);\n\n                if (settings.isMember(\"cubemap\")) {\n                    auto source_view = boost::gil::const_view(image);\n                    graphics::cubemap cubemap;\n\n                    int SIZE = 1024;\n                    if (settings[\"cubemap\"].isMember(\"size\"))\n                        SIZE = settings[\"cubemap\"][\"size\"].asUInt();\n\n                    for (auto face : { graphics::cubemap::face::POSITIVE_X,\n                             graphics::cubemap::face::NEGATIVE_X,\n                             graphics::cubemap::face::POSITIVE_Y,\n                             graphics::cubemap::face::NEGATIVE_Y,\n                             graphics::cubemap::face::POSITIVE_Z,\n                             graphics::cubemap::face::NEGATIVE_Z }) {\n\n                        graphics::texture face_texture({ SIZE, SIZE }, format, minification_filter, magnification_filter, mipmap_filter);\n                        auto face_view = face_texture.as_view<boost::gil::rgb32f_pixel_t>(0);\n                        equirectangular_to_cubemap_face(face, source_view, face_view);\n\n                        auto face_number = static_cast<unsigned int>(face);\n                        cubemap.faces[face_number] = texture_cache.insert({ rid \/ std::to_string(face_number) }, face_texture, true);\n                    }\n\n                    auto cubemap_rid = resource_shortname(graphics::cubemap) \/ filesystem::make_relative(source_directory, source_file).replace_extension(\"\");\n                    context_.template get_cache<graphics::cubemap>().insert({ cubemap_rid }, cubemap, true);\n                }\n\n                \/\/ TODO do not convert and export texture if cubemap is generated?\n                graphics::texture texture(boost::gil::const_view(image), minification_filter, magnification_filter, mipmap_filter);\n                texture_cache.insert({ rid }, texture, true);\n                break;\n            }\n            }\n        }\n\n    private:\n        ContextType& context_;\n    };\n}\n}\n\n#endif \/\/ SIGMA_TOOLS_TEXTURE_LOADER_HPP\n<commit_msg>Add defines boost gil is missing.<commit_after>#ifndef SIGMA_TOOLS_TEXTURE_LOADER_HPP\n#define SIGMA_TOOLS_TEXTURE_LOADER_HPP\n\n#include <sigma\/graphics\/texture.hpp>\n#include <sigma\/tools\/hdr_io.hpp>\n#include <sigma\/tools\/json_conversion.hpp>\n#include <sigma\/tools\/packager.hpp>\n#include <sigma\/tools\/texturing.hpp>\n\n#define png_infopp_NULL (png_infopp)NULL\n#define int_p_NULL (int*)NULL\n#define png_bytep_NULL (png_bytep)NULL\n\n#include <boost\/gil\/extension\/io\/jpeg_io.hpp>\n#include <boost\/gil\/extension\/io\/png_io.hpp>\n#include <boost\/gil\/extension\/io\/tiff_io.hpp>\n\n#include <string>\n#include <unordered_map>\n\nnamespace sigma {\nnamespace tools {\n    enum class texture_source_type : unsigned int {\n        tiff,\n        jpeg,\n        png,\n        hdr\n    };\n\n    template <class Image>\n    void load_texture(const boost::filesystem::path& source_file, texture_source_type source_type, Image& image)\n    {\n        auto file_path_string = source_file.string();\n\n        switch (source_type) {\n        case texture_source_type::tiff: {\n            boost::gil::tiff_read_and_convert_image(file_path_string, image);\n            break;\n        }\n        case texture_source_type::jpeg: {\n            boost::gil::jpeg_read_and_convert_image(file_path_string, image);\n            break;\n        }\n        case texture_source_type::png: {\n            boost::gil::png_read_and_convert_image(file_path_string, image);\n            break;\n        }\n        case texture_source_type::hdr: {\n            hdr_read_and_convert_image(file_path_string, image);\n            break;\n        }\n        }\n    }\n\n    template <class PackageSettings, class ContextType>\n    class texture_loader : public resource_loader<PackageSettings, ContextType> {\n    public:\n        texture_loader(ContextType& ctx)\n            : context_{ ctx }\n        {\n        }\n\n        virtual ~texture_loader() = default;\n\n        virtual bool supports_filetype(const std::string& ext) const override\n        {\n            static const std::set<std::string> supported_extensions = {\n                \".tiff\",\n                \".tif\",\n                \".jpg\",\n                \".jpeg\",\n                \".jpe\",\n                \".jif\",\n                \".jfif\",\n                \".jfi\",\n                \".png\",\n                \".hdr\"\n            };\n            return supported_extensions.count(ext) > 0;\n        }\n\n        virtual void load(const PackageSettings& package_settings, const boost::filesystem::path& source_directory, const std::string& ext, const boost::filesystem::path& source_file) override\n        {\n            static const std::unordered_map<std::string, texture_source_type> type_map = {\n                { \".tiff\", texture_source_type::tiff },\n                { \".tif\", texture_source_type::tiff },\n                { \".jpg\", texture_source_type::jpeg },\n                { \".jpeg\", texture_source_type::jpeg },\n                { \".jpe\", texture_source_type::jpeg },\n                { \".jif\", texture_source_type::jpeg },\n                { \".jfif\", texture_source_type::jpeg },\n                { \".jfi\", texture_source_type::jpeg },\n                { \".png\", texture_source_type::png },\n                { \".hdr\", texture_source_type::hdr }\n            };\n\n            auto source_type = type_map.at(ext);\n\n            auto settings_path = source_file.parent_path() \/ (source_file.stem().string() + \".stex\");\n\n            auto rid = resource_shortname(graphics::texture) \/ filesystem::make_relative(source_directory, source_file).replace_extension(\"\");\n\n            auto& texture_cache = context_.template get_cache<graphics::texture>();\n            if (texture_cache.contains({ rid })) {\n                auto h = texture_cache.handle_for({ rid });\n\n                auto source_file_time = boost::filesystem::last_write_time(source_file);\n                auto settings_time = source_file_time;\n                if (boost::filesystem::exists(settings_path))\n                    settings_time = boost::filesystem::last_write_time(settings_path);\n\n                auto resource_time = texture_cache.last_modification_time(h);\n                if (source_file_time <= resource_time && settings_time <= resource_time)\n                    return;\n            }\n\n            std::cout << \"packaging: \" << rid << \"\\n\";\n\n            \/\/ TODO use json conversion\n            Json::Value settings(Json::objectValue);\n            settings[\"format\"] = \"rgb8\";\n            settings[\"filter\"][\"minification\"] = \"linear\";\n            settings[\"filter\"][\"magnification\"] = \"linear\";\n            settings[\"filter\"][\"mipmap\"] = \"linear\";\n\n            if (boost::filesystem::exists(settings_path)) {\n                std::ifstream file(settings_path.string());\n                file >> settings;\n            }\n\n            graphics::texture_filter minification_filter = graphics::texture_filter::LINEAR;\n            graphics::texture_filter magnification_filter = graphics::texture_filter::LINEAR;\n            graphics::texture_filter mipmap_filter = graphics::texture_filter::LINEAR;\n            graphics::texture_format format = graphics::texture_format::RGB8;\n            json::from_json(context_, settings[\"filter\"][\"minification\"], minification_filter);\n            json::from_json(context_, settings[\"filter\"][\"magnification\"], magnification_filter);\n            json::from_json(context_, settings[\"filter\"][\"mipmap\"], mipmap_filter);\n            json::from_json(context_, settings[\"format\"], format);\n\n            switch (format) {\n            case graphics::texture_format::RGB8: {\n                boost::gil::rgb8_image_t image;\n                load_texture(source_file, source_type, image);\n\n                graphics::texture texture(boost::gil::const_view(image), minification_filter, magnification_filter, mipmap_filter);\n                texture_cache.insert({ rid }, texture, true);\n                break;\n            }\n            case graphics::texture_format::RGBA8: {\n                boost::gil::rgba8_image_t image;\n                load_texture(source_file, source_type, image);\n\n                graphics::texture texture(boost::gil::const_view(image), minification_filter, magnification_filter, mipmap_filter);\n                texture_cache.insert({ rid }, texture, true);\n                break;\n            }\n            case graphics::texture_format::RGB32F: {\n                boost::gil::rgb32f_image_t image;\n                load_texture(source_file, source_type, image);\n\n                if (settings.isMember(\"cubemap\")) {\n                    auto source_view = boost::gil::const_view(image);\n                    graphics::cubemap cubemap;\n\n                    int SIZE = 1024;\n                    if (settings[\"cubemap\"].isMember(\"size\"))\n                        SIZE = settings[\"cubemap\"][\"size\"].asUInt();\n\n                    for (auto face : { graphics::cubemap::face::POSITIVE_X,\n                             graphics::cubemap::face::NEGATIVE_X,\n                             graphics::cubemap::face::POSITIVE_Y,\n                             graphics::cubemap::face::NEGATIVE_Y,\n                             graphics::cubemap::face::POSITIVE_Z,\n                             graphics::cubemap::face::NEGATIVE_Z }) {\n\n                        graphics::texture face_texture({ SIZE, SIZE }, format, minification_filter, magnification_filter, mipmap_filter);\n                        auto face_view = face_texture.as_view<boost::gil::rgb32f_pixel_t>(0);\n                        equirectangular_to_cubemap_face(face, source_view, face_view);\n\n                        auto face_number = static_cast<unsigned int>(face);\n                        cubemap.faces[face_number] = texture_cache.insert({ rid \/ std::to_string(face_number) }, face_texture, true);\n                    }\n\n                    auto cubemap_rid = resource_shortname(graphics::cubemap) \/ filesystem::make_relative(source_directory, source_file).replace_extension(\"\");\n                    context_.template get_cache<graphics::cubemap>().insert({ cubemap_rid }, cubemap, true);\n                }\n\n                \/\/ TODO do not convert and export texture if cubemap is generated?\n                graphics::texture texture(boost::gil::const_view(image), minification_filter, magnification_filter, mipmap_filter);\n                texture_cache.insert({ rid }, texture, true);\n                break;\n            }\n            }\n        }\n\n    private:\n        ContextType& context_;\n    };\n}\n}\n\n#endif \/\/ SIGMA_TOOLS_TEXTURE_LOADER_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (C) 2016 Jonathan Müller <jonathanmueller.dev@gmail.com>\n\/\/ This file is subject to the license terms in the LICENSE file\n\/\/ found in the top-level directory of this distribution.\n\n#ifndef TYPE_SAFE_CONSTRAINED_TYPE_HPP_INCLUDED\n#define TYPE_SAFE_CONSTRAINED_TYPE_HPP_INCLUDED\n\n#include <type_traits>\n#include <utility>\n\n#include <type_safe\/detail\/assert.hpp>\n#include <type_safe\/detail\/is_nothrow_swappable.hpp>\n#include <type_safe\/config.hpp>\n\nnamespace type_safe\n{\n    \/\/\/ A `Verifier` for [type_safe::constrained_type<T, Constraint, Verifier]() that `DEBUG_ASSERT`s the constraint.\n    struct assertion_verifier\n    {\n        template <typename Value, typename Predicate>\n        static void verify(const Value& val, const Predicate& p)\n        {\n            DEBUG_ASSERT(p(val), detail::assert_handler{}, \"value does not fulfill constraint\");\n        }\n    };\n\n    \/\/\/ \\exclude\n    namespace detail\n    {\n        template <class Constraint, typename T>\n        auto verify_static_constrained(int) -> typename Constraint::template is_valid<T>;\n\n        template <class Constraint, typename T>\n        auto verify_static_constrained(char) -> std::true_type;\n\n        template <class Constraint, typename T>\n        struct is_valid : decltype(verify_static_constrained<Constraint, T>(0))\n        {\n        };\n    } \/\/ namespace detail\n\n    \/\/\/ A value of type `T` that always fulfills the predicate `Constraint`.\n    \/\/\/ The `Constraint` is checked by the `Verifier`.\n    \/\/\/ The `Constraint` can also provide a nested template `is_valid<T>` to statically check types.\n    \/\/\/ Those will be checked regardless of the `Verifier`.\n    \/\/\/ \\requires `T` must not be a reference, `Constraint` must be a moveable, non-final class where no operation throws,\n    \/\/\/ and `Verifier` must provide a `static` function `void verify([const] T&, const Predicate&)`.\n    \/\/\/ \\notes Additional requirements of the `Constraint` depend on the `Verifier` used.\n    \/\/\/ If not stated otherwise, a `Verifier` in this library requires\n    \/\/\/ that the `Constraint` is a `Predicate` for `T`.\n    template <typename T, typename Constraint, typename Verifier = assertion_verifier>\n    class constrained_type : Constraint\n    {\n        static_assert(!std::is_reference<T>::value, \"T must not be a reference\");\n\n        using nothrow_verifier =\n            std::integral_constant<bool, noexcept(Verifier::verify(std::declval<T&>(),\n                                                                   std::declval<Constraint&>()))>;\n\n    public:\n        using value_type           = typename std::remove_cv<T>::type;\n        using constraint_predicate = Constraint;\n\n        \/\/\/ \\effects Creates it giving it a valid `value` and a `predicate`.\n        \/\/\/ The `value` will be copied and verified.\n        \/\/\/ \\throws Anything thrown by the copy constructor of `value_type`\n        \/\/\/ or the `Verifier` if the `value` is invalid.\n        explicit constrained_type(const value_type& value, constraint_predicate predicate = {})\n        : Constraint(std::move(predicate)), value_(value)\n        {\n            verify();\n        }\n\n        \/\/\/ \\effects Creates it giving it a valid `value` and a `predicate`.\n        \/\/\/ The `value` will be moved and verified.\n        \/\/\/ \\throws Anything thrown by the the move constructor of `value_type`\n        \/\/\/ or the `Verifier` if the `value` is invalid.\n        explicit constrained_type(value_type&& value, constraint_predicate predicate = {}) noexcept(\n            std::is_nothrow_constructible<value_type>::value&& nothrow_verifier::value)\n        : Constraint(std::move(predicate)), value_(std::move(value))\n        {\n            verify();\n        }\n\n        template <typename U,\n                  typename = typename std::enable_if<!detail::is_valid<constraint_predicate,\n                                                                       U>::value>::type>\n        constrained_type(U) = delete;\n\n        \/\/\/ \\effects Copies the value and predicate of `other`.\n        \/\/\/ \\throws Anything thrown by the copy constructor of `value_type`.\n        constrained_type(const constrained_type& other) : Constraint(other), value_(other.value_)\n        {\n            debug_verify();\n        }\n\n        \/\/\/ \\effects Destroys the value.\n        ~constrained_type() noexcept = default;\n\n        \/\/\/ \\effects Copy assigns the stored value to the valid value `other`.\n        \/\/\/ It will also verify the new value prior to assigning.\n        \/\/\/ \\throws Anything thrown by the copy assignment operator of `value_type`,\n        \/\/\/ or the `Verifier` if the `value` is invalid.\n        constrained_type& operator=(const value_type& other)\n        {\n            Verifier::verify(other, get_constraint());\n            value_ = other;\n            return *this;\n        }\n\n        \/\/\/ \\effects Move assigns the stored value to the valid value `other`.\n        \/\/\/ It will also verify the new value prior to assigning.\n        \/\/\/ \\throws Anything thrown by the move assignment operator of `value_type`\n        \/\/\/ or the `Verifier` if the `value` is invalid.\n        constrained_type& operator=(value_type&& other) noexcept(\n            std::is_nothrow_move_assignable<value_type>::value&& nothrow_verifier::value)\n        {\n            Verifier::verify(other, get_constraint());\n            value_ = std::move(other);\n            return *this;\n        }\n\n        template <typename U,\n                  typename = typename std::enable_if<!detail::is_valid<constraint_predicate,\n                                                                       U>::value>::type>\n        constrained_type& operator=(U) = delete;\n\n        \/\/\/ \\effects Copies the value and predicate from `other`.\n        \/\/\/ \\throws Anything thrown by the copy assignment operator of `value_type`.\n        \/\/\/ \\requires `Constraint` must be copyable.\n        constrained_type& operator=(const constrained_type& other)\n        {\n            constrained_type tmp(other);\n            swap(*this, tmp);\n            return *this;\n        }\n\n        \/\/\/ \\effects Swaps the value and predicate of a `a` and `b`.\n        \/\/\/ \\throws Anything thrown by the swap function of `value_type`.\n        \/\/\/ \\requires `Constraint` must be swappable.\n        friend void swap(constrained_type& a, constrained_type& b) noexcept(\n            detail::is_nothrow_swappable<value_type>::value)\n        {\n            a.debug_verify();\n            b.debug_verify();\n\n            using std::swap;\n            swap(a.value_, b.value_);\n            swap(static_cast<Constraint&>(a), static_cast<Constraint&>(b));\n        }\n\n        \/\/\/ A proxy class to provide write access to the stored value.\n        \/\/\/ The destructor will verify the value again.\n        class modifier\n        {\n        public:\n            \/\/\/ \\effects Move constructs it.\n            \/\/\/ `other` will not verify any value afterwards.\n            modifier(modifier&& other) noexcept : value_(other.value_)\n            {\n                other.value_ = nullptr;\n            }\n\n            \/\/\/ \\effects Verifies the value, if there is any.\n            ~modifier() noexcept(false)\n            {\n                if (value_)\n                    value_->verify();\n            }\n\n            \/\/\/ \\effects Move assigns it.\n            \/\/\/ `other` will not verify any value afterwards.\n            modifier& operator=(modifier&& other) noexcept\n            {\n                value_       = other.value_;\n                other.value_ = nullptr;\n                return *this;\n            }\n\n            \/\/\/ \\returns A reference to the stored value.\n            \/\/\/ \\requires It must not be in the moved-from state.\n            value_type& get() noexcept\n            {\n                DEBUG_ASSERT(value_, detail::assert_handler{});\n                return value_->value_;\n            }\n\n        private:\n            modifier(constrained_type& value) noexcept : value_(&value)\n            {\n            }\n\n            constrained_type* value_;\n            friend constrained_type;\n        };\n\n        \/\/\/ \\returns A proxy object to provide verified write-access to the stored value.\n        modifier modify() noexcept\n        {\n            debug_verify();\n            return modifier(*this);\n        }\n\n        \/\/\/ \\effects Moves the stored value out of the `constrained_type`,\n        \/\/\/ it will not be checked further.\n        \/\/\/ \\returns An rvalue reference to the stored value.\n        \/\/\/ \\notes After this function is called, the object must not be used anymore\n        \/\/\/ except as target for assignment or in the destructor.\n        value_type&& release() TYPE_SAFE_RVALUE_REF noexcept\n        {\n            debug_verify();\n            return std::move(value_);\n        }\n\n        \/\/\/ \\returns A `const` reference to the stored value.\n        \/\/\/ \\requires Any `const` operations on the `value_type` must not affect the validity of the value.\n        const value_type& get_value() const noexcept\n        {\n            return value_;\n        }\n\n        \/\/\/ \\returns The predicate that determines validity.\n        const constraint_predicate& get_constraint() const noexcept\n        {\n            return *this;\n        }\n\n    private:\n        void verify() noexcept(nothrow_verifier::value)\n        {\n            Verifier::verify(value_, get_constraint());\n        }\n\n        void debug_verify() noexcept\n        {\n#if TYPE_SAFE_ENABLE_ASSERTIONS\n            verify();\n#endif\n        }\n\n        value_type value_;\n    };\n\n    \/\/\/ \\returns A [type_safe::constrained_type<T, Constraint, Verifier>]() with the given `value` and `Constraint`.\n    template <typename T, typename Constraint>\n    auto constrain(T&& value, Constraint c)\n        -> constrained_type<typename std::decay<T>::type, Constraint>\n    {\n        return constrained_type<typename std::decay<T>::type, Constraint>(std::forward<T>(value),\n                                                                          std::move(c));\n    }\n\n    \/\/\/ \\returns A [type_safe::constrained_type<T, Constraint, Verifier>]() with the given `value`,  `Constraint` and `Verifier`.\n    template <class Verifier, typename T, typename Constraint>\n    auto constrain(T&& value, Constraint c)\n        -> constrained_type<typename std::decay<T>::type, Constraint, Verifier>\n    {\n        return constrained_type<typename std::decay<T>::type, Constraint, Verifier>(std::forward<T>(\n                                                                                        value),\n                                                                                    std::move(c));\n    }\n\n    \/\/\/ \\effects Calls `f` with a non-`const` reference to the stored value of the [type_safe::constrained_type<T, Constraint, Verifier>]().\n    \/\/\/ It checks that `f` does not change the validity of the object.\n    \/\/\/ \\notes The same behavior can be accomplished by using the `modify()` member function.\n    template <typename T, typename Constraint, class Verifier, typename Func>\n    void with(constrained_type<T, Constraint, Verifier>& value, Func&& f)\n    {\n        auto modifier = value.modify();\n        std::forward<Func>(f)(modifier.get());\n    }\n\n    \/\/\/ A `Verifier` for [type_safe::constrained_type<T, Constraint, Verifier]() that doesn't check the constraint.\n    \/\/\/ \\notes It does not impose any additional requirements on the `Predicate`.\n    struct null_verifier\n    {\n        template <typename Value, typename Predicate>\n        static void verify(const Value&, const Predicate&)\n        {\n        }\n    };\n\n    \/\/\/ An alias for [type_safe::constrained_type<T, Constraint, Verifier>]() that never checks the constraint.\n    \/\/\/ It is useful for creating tagged types:\n    \/\/\/ The `Constraint` - which does not need to be a predicate anymore - is a \"tag\" to differentiate a type in different states.\n    \/\/\/ For example, you could have a \"sanitized\" value and a \"non-sanitized\" value\n    \/\/\/ that have different types, so you cannot accidentally mix them.\n    \/\/\/ \\notes It is only intended if the `Constrained` cannot be formalized easily and\/or is expensive.\n    \/\/\/ Otherwise [type_safe::constrained_type<T, Constrained, Verifier>]() is recommended\n    \/\/\/ as it does additional runtime checks in debug mode.\n    template <typename T, typename Constraint>\n    using tagged_type = constrained_type<T, Constraint, null_verifier>;\n\n    \/\/\/ \\returns A [type_safe::tagged_type<T, Constraint>]() with the given `value` and `Constraint`.\n    template <typename T, typename Constraint>\n    auto tag(T&& value, Constraint c) -> tagged_type<typename std::decay<T>::type, Constraint>\n    {\n        return tagged_type<typename std::decay<T>::type, Constraint>(std::forward<T>(value),\n                                                                     std::move(c));\n    }\n\n    namespace constraints\n    {\n        \/\/\/ A `Constraint` for the [type_safe::constrained_type<T, Constraint, Verifier>]().\n        \/\/\/ A value of a pointer type is valid if it is not equal to `nullptr`.\n        \/\/\/ This is borrowed from GSL's [non_null](http:\/\/isocpp.github.io\/CppCoreGuidelines\/CppCoreGuidelines#a-namess-viewsagslview-views).\n        struct non_null\n        {\n            template <typename T>\n            struct is_valid : std::true_type\n            {\n            };\n\n            template <typename T>\n            bool operator()(const T& ptr) const noexcept\n            {\n                return ptr != nullptr;\n            }\n        };\n\n        template <>\n        struct non_null::is_valid<std::nullptr_t> : std::false_type\n        {\n        };\n\n        \/\/\/ A `Constraint` for the [type_safe::constrained_type<T, Constraint, Verifier>]().\n        \/\/\/ A value of a container type is valid if it is not empty.\n        \/\/\/ Empty-ness is determined with either a member or non-member function.\n        class non_empty\n        {\n            template <typename T>\n            auto is_empty(int, const T& t) const noexcept(noexcept(t.empty()))\n                -> decltype(t.empty())\n            {\n                return !t.empty();\n            }\n\n            template <typename T>\n            bool is_empty(short, const T& t) const\n            {\n                return !empty(t);\n            }\n\n        public:\n            template <typename T>\n            bool operator()(const T& t) const\n            {\n                return is_empty(0, t);\n            }\n        };\n\n        \/\/\/ A `Constraint` for the [type_safe::constrained_type<T, Constraint, Verifier>]().\n        \/\/\/ A value is valid if it not equal to the default constructed value.\n        struct non_default\n        {\n            template <typename T>\n            bool operator()(const T& t) const noexcept(noexcept(t == T()))\n            {\n                return !(t == T());\n            }\n        };\n\n        \/\/\/ A `Constraint` for the [type_safe::constrained_type<T, Constraint, Verifier>]().\n        \/\/\/ A value of a pointer-like type is valid if the expression `!value` is `false`.\n        struct non_invalid\n        {\n            template <typename T>\n            bool operator()(const T& t) const noexcept(noexcept(!!t))\n            {\n                return !!t;\n            }\n        };\n\n        \/\/\/ A `Constraint` for the [type_safe::tagged_type<T, Constraint>]().\n        \/\/\/ It marks an owning pointer.\n        \/\/\/ It is borrowed from GSL's [non_null](http:\/\/isocpp.github.io\/CppCoreGuidelines\/CppCoreGuidelines#a-namess-viewsagslview-views).\n        \/\/\/ \\notes This is not actually a predicate.\n        struct owner\n        {\n        };\n    } \/\/ namespace constraints\n} \/\/ namespace type_safe\n\n#endif \/\/ TYPE_SAFE_CONSTRAINED_TYPE_HPP_INCLUDED\n<commit_msg>Add comparison functions to constrained_type<commit_after>\/\/ Copyright (C) 2016 Jonathan Müller <jonathanmueller.dev@gmail.com>\n\/\/ This file is subject to the license terms in the LICENSE file\n\/\/ found in the top-level directory of this distribution.\n\n#ifndef TYPE_SAFE_CONSTRAINED_TYPE_HPP_INCLUDED\n#define TYPE_SAFE_CONSTRAINED_TYPE_HPP_INCLUDED\n\n#include <type_traits>\n#include <utility>\n\n#include <type_safe\/detail\/assert.hpp>\n#include <type_safe\/detail\/is_nothrow_swappable.hpp>\n#include <type_safe\/config.hpp>\n\nnamespace type_safe\n{\n    \/\/=== verifiers ===\/\/\n    \/\/\/ A `Verifier` for [type_safe::constrained_type<T, Constraint, Verifier]() that `DEBUG_ASSERT`s the constraint.\n    struct assertion_verifier\n    {\n        template <typename Value, typename Predicate>\n        static void verify(const Value& val, const Predicate& p)\n        {\n            DEBUG_ASSERT(p(val), detail::assert_handler{}, \"value does not fulfill constraint\");\n        }\n    };\n\n    \/\/=== constrained_type ===\/\/\n    \/\/\/ \\exclude\n    namespace detail\n    {\n        template <class Constraint, typename T>\n        auto verify_static_constrained(int) -> typename Constraint::template is_valid<T>;\n\n        template <class Constraint, typename T>\n        auto verify_static_constrained(char) -> std::true_type;\n\n        template <class Constraint, typename T>\n        struct is_valid : decltype(verify_static_constrained<Constraint, T>(0))\n        {\n        };\n    } \/\/ namespace detail\n\n    \/\/\/ A value of type `T` that always fulfills the predicate `Constraint`.\n    \/\/\/ The `Constraint` is checked by the `Verifier`.\n    \/\/\/ The `Constraint` can also provide a nested template `is_valid<T>` to statically check types.\n    \/\/\/ Those will be checked regardless of the `Verifier`.\n    \/\/\/ \\requires `T` must not be a reference, `Constraint` must be a moveable, non-final class where no operation throws,\n    \/\/\/ and `Verifier` must provide a `static` function `void verify([const] T&, const Predicate&)`.\n    \/\/\/ \\notes Additional requirements of the `Constraint` depend on the `Verifier` used.\n    \/\/\/ If not stated otherwise, a `Verifier` in this library requires\n    \/\/\/ that the `Constraint` is a `Predicate` for `T`.\n    template <typename T, typename Constraint, typename Verifier = assertion_verifier>\n    class constrained_type : Constraint\n    {\n        static_assert(!std::is_reference<T>::value, \"T must not be a reference\");\n\n        using nothrow_verifier =\n            std::integral_constant<bool, noexcept(Verifier::verify(std::declval<T&>(),\n                                                                   std::declval<Constraint&>()))>;\n\n    public:\n        using value_type           = typename std::remove_cv<T>::type;\n        using constraint_predicate = Constraint;\n\n        \/\/\/ \\effects Creates it giving it a valid `value` and a `predicate`.\n        \/\/\/ The `value` will be copied and verified.\n        \/\/\/ \\throws Anything thrown by the copy constructor of `value_type`\n        \/\/\/ or the `Verifier` if the `value` is invalid.\n        explicit constrained_type(const value_type& value, constraint_predicate predicate = {})\n        : Constraint(std::move(predicate)), value_(value)\n        {\n            verify();\n        }\n\n        \/\/\/ \\effects Creates it giving it a valid `value` and a `predicate`.\n        \/\/\/ The `value` will be moved and verified.\n        \/\/\/ \\throws Anything thrown by the the move constructor of `value_type`\n        \/\/\/ or the `Verifier` if the `value` is invalid.\n        explicit constrained_type(value_type&& value, constraint_predicate predicate = {}) noexcept(\n            std::is_nothrow_constructible<value_type>::value&& nothrow_verifier::value)\n        : Constraint(std::move(predicate)), value_(std::move(value))\n        {\n            verify();\n        }\n\n        template <typename U,\n                  typename = typename std::enable_if<!detail::is_valid<constraint_predicate,\n                                                                       U>::value>::type>\n        constrained_type(U) = delete;\n\n        \/\/\/ \\effects Copies the value and predicate of `other`.\n        \/\/\/ \\throws Anything thrown by the copy constructor of `value_type`.\n        constrained_type(const constrained_type& other) : Constraint(other), value_(other.value_)\n        {\n            debug_verify();\n        }\n\n        \/\/\/ \\effects Destroys the value.\n        ~constrained_type() noexcept = default;\n\n        \/\/\/ \\effects Copy assigns the stored value to the valid value `other`.\n        \/\/\/ It will also verify the new value prior to assigning.\n        \/\/\/ \\throws Anything thrown by the copy assignment operator of `value_type`,\n        \/\/\/ or the `Verifier` if the `value` is invalid.\n        constrained_type& operator=(const value_type& other)\n        {\n            Verifier::verify(other, get_constraint());\n            value_ = other;\n            return *this;\n        }\n\n        \/\/\/ \\effects Move assigns the stored value to the valid value `other`.\n        \/\/\/ It will also verify the new value prior to assigning.\n        \/\/\/ \\throws Anything thrown by the move assignment operator of `value_type`\n        \/\/\/ or the `Verifier` if the `value` is invalid.\n        constrained_type& operator=(value_type&& other) noexcept(\n            std::is_nothrow_move_assignable<value_type>::value&& nothrow_verifier::value)\n        {\n            Verifier::verify(other, get_constraint());\n            value_ = std::move(other);\n            return *this;\n        }\n\n        template <typename U,\n                  typename = typename std::enable_if<!detail::is_valid<constraint_predicate,\n                                                                       U>::value>::type>\n        constrained_type& operator=(U) = delete;\n\n        \/\/\/ \\effects Copies the value and predicate from `other`.\n        \/\/\/ \\throws Anything thrown by the copy assignment operator of `value_type`.\n        \/\/\/ \\requires `Constraint` must be copyable.\n        constrained_type& operator=(const constrained_type& other)\n        {\n            constrained_type tmp(other);\n            swap(*this, tmp);\n            return *this;\n        }\n\n        \/\/\/ \\effects Swaps the value and predicate of a `a` and `b`.\n        \/\/\/ \\throws Anything thrown by the swap function of `value_type`.\n        \/\/\/ \\requires `Constraint` must be swappable.\n        friend void swap(constrained_type& a, constrained_type& b) noexcept(\n            detail::is_nothrow_swappable<value_type>::value)\n        {\n            a.debug_verify();\n            b.debug_verify();\n\n            using std::swap;\n            swap(a.value_, b.value_);\n            swap(static_cast<Constraint&>(a), static_cast<Constraint&>(b));\n        }\n\n        \/\/\/ A proxy class to provide write access to the stored value.\n        \/\/\/ The destructor will verify the value again.\n        class modifier\n        {\n        public:\n            \/\/\/ \\effects Move constructs it.\n            \/\/\/ `other` will not verify any value afterwards.\n            modifier(modifier&& other) noexcept : value_(other.value_)\n            {\n                other.value_ = nullptr;\n            }\n\n            \/\/\/ \\effects Verifies the value, if there is any.\n            ~modifier() noexcept(false)\n            {\n                if (value_)\n                    value_->verify();\n            }\n\n            \/\/\/ \\effects Move assigns it.\n            \/\/\/ `other` will not verify any value afterwards.\n            modifier& operator=(modifier&& other) noexcept\n            {\n                value_       = other.value_;\n                other.value_ = nullptr;\n                return *this;\n            }\n\n            \/\/\/ \\returns A reference to the stored value.\n            \/\/\/ \\requires It must not be in the moved-from state.\n            value_type& get() noexcept\n            {\n                DEBUG_ASSERT(value_, detail::assert_handler{});\n                return value_->value_;\n            }\n\n        private:\n            modifier(constrained_type& value) noexcept : value_(&value)\n            {\n            }\n\n            constrained_type* value_;\n            friend constrained_type;\n        };\n\n        \/\/\/ \\returns A proxy object to provide verified write-access to the stored value.\n        modifier modify() noexcept\n        {\n            debug_verify();\n            return modifier(*this);\n        }\n\n        \/\/\/ \\effects Moves the stored value out of the `constrained_type`,\n        \/\/\/ it will not be checked further.\n        \/\/\/ \\returns An rvalue reference to the stored value.\n        \/\/\/ \\notes After this function is called, the object must not be used anymore\n        \/\/\/ except as target for assignment or in the destructor.\n        value_type&& release() TYPE_SAFE_RVALUE_REF noexcept\n        {\n            debug_verify();\n            return std::move(value_);\n        }\n\n        \/\/\/ \\returns A `const` reference to the stored value.\n        \/\/\/ \\requires Any `const` operations on the `value_type` must not affect the validity of the value.\n        const value_type& get_value() const noexcept\n        {\n            return value_;\n        }\n\n        \/\/\/ \\returns The predicate that determines validity.\n        const constraint_predicate& get_constraint() const noexcept\n        {\n            return *this;\n        }\n\n    private:\n        void verify() noexcept(nothrow_verifier::value)\n        {\n            Verifier::verify(value_, get_constraint());\n        }\n\n        void debug_verify() noexcept\n        {\n#if TYPE_SAFE_ENABLE_ASSERTIONS\n            verify();\n#endif\n        }\n\n        value_type value_;\n    };\n\n\/\/\/ \\exclude\n#define TYPE_SAFE_DETAIL_MAKE_OP(Op)                                                               \\\n    template <typename T, typename Constraint, class Verifier>                                     \\\n    auto operator Op(const constrained_type<T, Constraint, Verifier>& lhs,                         \\\n                     const constrained_type<T, Constraint, Verifier>&                              \\\n                         rhs) noexcept(noexcept(lhs.get_value() < rhs.get_value()))                \\\n        ->decltype(lhs.get_value() < rhs.get_value())                                              \\\n    {                                                                                              \\\n        return lhs.get_value() Op rhs.get_value();                                                 \\\n    }\n\n    \/\/\/ \\returns The result of the comparison of the underlying value.\n    \/\/\/ \\group constrained_comp\n    TYPE_SAFE_DETAIL_MAKE_OP(==)\n    \/\/\/ \\group constrained_comp\n    TYPE_SAFE_DETAIL_MAKE_OP(!=)\n    \/\/\/ \\group constrained_comp\n    TYPE_SAFE_DETAIL_MAKE_OP(<)\n    \/\/\/ \\group constrained_comp\n    TYPE_SAFE_DETAIL_MAKE_OP(<=)\n    \/\/\/ \\group constrained_comp\n    TYPE_SAFE_DETAIL_MAKE_OP(>)\n    \/\/\/ \\group constrained_comp\n    TYPE_SAFE_DETAIL_MAKE_OP(>=)\n\n#undef TYPE_SAFE_DETAIL_MAKE_OP\n\n    \/\/\/ \\returns A [type_safe::constrained_type<T, Constraint, Verifier>]() with the given `value` and `Constraint`.\n    template <typename T, typename Constraint>\n    auto constrain(T&& value, Constraint c)\n        -> constrained_type<typename std::decay<T>::type, Constraint>\n    {\n        return constrained_type<typename std::decay<T>::type, Constraint>(std::forward<T>(value),\n                                                                          std::move(c));\n    }\n\n    \/\/\/ \\returns A [type_safe::constrained_type<T, Constraint, Verifier>]() with the given `value`,  `Constraint` and `Verifier`.\n    template <class Verifier, typename T, typename Constraint>\n    auto constrain(T&& value, Constraint c)\n        -> constrained_type<typename std::decay<T>::type, Constraint, Verifier>\n    {\n        return constrained_type<typename std::decay<T>::type, Constraint, Verifier>(std::forward<T>(\n                                                                                        value),\n                                                                                    std::move(c));\n    }\n\n    \/\/\/ \\effects Calls `f` with a non-`const` reference to the stored value of the [type_safe::constrained_type<T, Constraint, Verifier>]().\n    \/\/\/ It checks that `f` does not change the validity of the object.\n    \/\/\/ \\notes The same behavior can be accomplished by using the `modify()` member function.\n    template <typename T, typename Constraint, class Verifier, typename Func>\n    void with(constrained_type<T, Constraint, Verifier>& value, Func&& f)\n    {\n        auto modifier = value.modify();\n        std::forward<Func>(f)(modifier.get());\n    }\n\n    \/\/=== tagged_type ===\/\/\n    \/\/\/ A `Verifier` for [type_safe::constrained_type<T, Constraint, Verifier]() that doesn't check the constraint.\n    \/\/\/ \\notes It does not impose any additional requirements on the `Predicate`.\n    struct null_verifier\n    {\n        template <typename Value, typename Predicate>\n        static void verify(const Value&, const Predicate&)\n        {\n        }\n    };\n\n    \/\/\/ An alias for [type_safe::constrained_type<T, Constraint, Verifier>]() that never checks the constraint.\n    \/\/\/ It is useful for creating tagged types:\n    \/\/\/ The `Constraint` - which does not need to be a predicate anymore - is a \"tag\" to differentiate a type in different states.\n    \/\/\/ For example, you could have a \"sanitized\" value and a \"non-sanitized\" value\n    \/\/\/ that have different types, so you cannot accidentally mix them.\n    \/\/\/ \\notes It is only intended if the `Constrained` cannot be formalized easily and\/or is expensive.\n    \/\/\/ Otherwise [type_safe::constrained_type<T, Constrained, Verifier>]() is recommended\n    \/\/\/ as it does additional runtime checks in debug mode.\n    template <typename T, typename Constraint>\n    using tagged_type = constrained_type<T, Constraint, null_verifier>;\n\n    \/\/\/ \\returns A [type_safe::tagged_type<T, Constraint>]() with the given `value` and `Constraint`.\n    template <typename T, typename Constraint>\n    auto tag(T&& value, Constraint c) -> tagged_type<typename std::decay<T>::type, Constraint>\n    {\n        return tagged_type<typename std::decay<T>::type, Constraint>(std::forward<T>(value),\n                                                                     std::move(c));\n    }\n\n    \/\/=== constraints ===\/\/\n    namespace constraints\n    {\n        \/\/\/ A `Constraint` for the [type_safe::constrained_type<T, Constraint, Verifier>]().\n        \/\/\/ A value of a pointer type is valid if it is not equal to `nullptr`.\n        \/\/\/ This is borrowed from GSL's [non_null](http:\/\/isocpp.github.io\/CppCoreGuidelines\/CppCoreGuidelines#a-namess-viewsagslview-views).\n        struct non_null\n        {\n            template <typename T>\n            struct is_valid : std::true_type\n            {\n            };\n\n            template <typename T>\n            bool operator()(const T& ptr) const noexcept\n            {\n                return ptr != nullptr;\n            }\n        };\n\n        template <>\n        struct non_null::is_valid<std::nullptr_t> : std::false_type\n        {\n        };\n\n        \/\/\/ A `Constraint` for the [type_safe::constrained_type<T, Constraint, Verifier>]().\n        \/\/\/ A value of a container type is valid if it is not empty.\n        \/\/\/ Empty-ness is determined with either a member or non-member function.\n        class non_empty\n        {\n            template <typename T>\n            auto is_empty(int, const T& t) const noexcept(noexcept(t.empty()))\n                -> decltype(t.empty())\n            {\n                return !t.empty();\n            }\n\n            template <typename T>\n            bool is_empty(short, const T& t) const\n            {\n                return !empty(t);\n            }\n\n        public:\n            template <typename T>\n            bool operator()(const T& t) const\n            {\n                return is_empty(0, t);\n            }\n        };\n\n        \/\/\/ A `Constraint` for the [type_safe::constrained_type<T, Constraint, Verifier>]().\n        \/\/\/ A value is valid if it not equal to the default constructed value.\n        struct non_default\n        {\n            template <typename T>\n            bool operator()(const T& t) const noexcept(noexcept(t == T()))\n            {\n                return !(t == T());\n            }\n        };\n\n        \/\/\/ A `Constraint` for the [type_safe::constrained_type<T, Constraint, Verifier>]().\n        \/\/\/ A value of a pointer-like type is valid if the expression `!value` is `false`.\n        struct non_invalid\n        {\n            template <typename T>\n            bool operator()(const T& t) const noexcept(noexcept(!!t))\n            {\n                return !!t;\n            }\n        };\n\n        \/\/\/ A `Constraint` for the [type_safe::tagged_type<T, Constraint>]().\n        \/\/\/ It marks an owning pointer.\n        \/\/\/ It is borrowed from GSL's [non_null](http:\/\/isocpp.github.io\/CppCoreGuidelines\/CppCoreGuidelines#a-namess-viewsagslview-views).\n        \/\/\/ \\notes This is not actually a predicate.\n        struct owner\n        {\n        };\n    } \/\/ namespace constraints\n} \/\/ namespace type_safe\n\n#endif \/\/ TYPE_SAFE_CONSTRAINED_TYPE_HPP_INCLUDED\n<|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/reflex:$Name:  $:$Id: Scope.cxx,v 1.21 2006\/10\/26 17:49:22 axel Exp $\n\/\/ Author: Stefan Roiser 2004\n\n\/\/ Copyright CERN, CH-1211 Geneva 23, 2004-2006, All rights reserved.\n\/\/\n\/\/ Permission to use, copy, modify, and distribute this software for any\n\/\/ purpose is hereby granted without fee, provided that this copyright and\n\/\/ permissions notice appear in all copies and derivatives.\n\/\/\n\/\/ This software is provided \"as is\" without express or implied warranty.\n\n#ifndef REFLEX_BUILD\n#define REFLEX_BUILD\n#endif\n\n#include \"Reflex\/Scope.h\"\n\n#include \"Reflex\/internal\/ScopeBase.h\"\n#include \"Reflex\/Member.h\"\n#include \"Reflex\/Type.h\"\n#include \"Reflex\/TypeTemplate.h\"\n#include \"Reflex\/MemberTemplate.h\"\n#include \"Reflex\/Base.h\"\n\n#include \"Reflex\/Tools.h\"\n#include \"Class.h\"\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Scope & ROOT::Reflex::Scope::__NIRVANA__() {\n\/\/-------------------------------------------------------------------------------\n\/\/ static wraper around NIRVANA, the base of the top scope.\n   static Scope s = Scope( new ScopeName( \"@N@I@R@V@A@N@A@\", 0 ));\n   return s;\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Scope::operator ROOT::Reflex::Type () const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Conversion operator to Type. If this scope is not a Type, returns the empty type.\n   if ( * this ) return *(fScopeName->fScopeBase);\n   return Dummy::Type();\n}\n\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Base ROOT::Reflex::Scope::BaseAt( size_t nth ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return nth base class info.\n   if ( * this ) return fScopeName->fScopeBase->BaseAt( nth );\n   return Dummy::Base();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nsize_t ROOT::Reflex::Scope::BaseSize() const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return number of base classes.\n   if ( * this ) return fScopeName->fScopeBase->BaseSize();\n   return 0;\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Scope ROOT::Reflex::Scope::ByName( const std::string & name ) {\n\/\/-------------------------------------------------------------------------------\n\/\/ Lookup a Scope by it's fully qualified name.\n   return ScopeName::ByName( name );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Member ROOT::Reflex::Scope::DataMemberAt( size_t nth ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the nth data member of this scope.\n   if ( * this ) return fScopeName->fScopeBase->DataMemberAt( nth ); \n   return Dummy::Member();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Member ROOT::Reflex::Scope::DataMemberByName( const std::string & name ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return a data member by it's name.\n   if ( * this ) return fScopeName->fScopeBase->DataMemberByName( name ); \n   return Dummy::Member();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nsize_t ROOT::Reflex::Scope::DataMemberSize() const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return number of data mebers of this scope.\n   if ( * this ) return fScopeName->fScopeBase->DataMemberSize(); \n   return 0;\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Member ROOT::Reflex::Scope::FunctionMemberAt( size_t nth ) const {\n\/\/------------------------------------------------------------------------------- \n\/\/ Return nth function member of this socpe.\n   if ( * this ) return fScopeName->fScopeBase->FunctionMemberAt(nth); \n   return Dummy::Member();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Member ROOT::Reflex::Scope::FunctionMemberByName( const std::string & name ) const {\n\/\/------------------------------------------------------------------------------- \n\/\/ Return a function member by it's name.\n   if ( * this ) return fScopeName->fScopeBase->FunctionMemberByName( name, Type() ); \n   return Dummy::Member();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Member ROOT::Reflex::Scope::FunctionMemberByName( const std::string & name,\n                                                                const Type & signature ) const {\n\/\/------------------------------------------------------------------------------- \n\/\/ Return a function member by it's name, qualified by it's signature type.\n   if ( * this ) return fScopeName->fScopeBase->FunctionMemberByName( name, signature ); \n   return Dummy::Member();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nsize_t ROOT::Reflex::Scope::FunctionMemberSize() const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return number of function members of this scope.\n   if ( * this ) return fScopeName->fScopeBase->FunctionMemberSize(); \n   return 0;\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Member \nROOT::Reflex::Scope::LookupMember( const std::string & nam ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Lookup a member from this scope.\n   if ( * this ) return fScopeName->fScopeBase->LookupMember( nam, *this );\n   return Dummy::Member();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Type\nROOT::Reflex::Scope::LookupType( const std::string & nam ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Lookup a type from this scope.\n   if ( * this ) return fScopeName->fScopeBase->LookupType( nam, *this );\n   return Dummy::Type();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Scope\nROOT::Reflex::Scope::LookupScope( const std::string & nam ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Lookup a scope from this scope.\n   if ( * this ) return fScopeName->fScopeBase->LookupScope( nam, *this );\n   return Dummy::Scope();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Member \nROOT::Reflex::Scope::MemberByName( const std::string & name ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return a member from this scope, by name.\n   if ( * this ) return fScopeName->fScopeBase->MemberByName(name, Type()); \n   return Dummy::Member();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Member \nROOT::Reflex::Scope::MemberByName( const std::string & name,\n                                   const Type & signature ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return a member in this scope, looked up by name and signature (for functions)\n   if ( * this ) return fScopeName->fScopeBase->MemberByName(name, signature); \n   return Dummy::Member();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Member_Iterator ROOT::Reflex::Scope::Member_Begin() const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the begin iterator of member container.\n   if ( * this ) return fScopeName->fScopeBase->Member_Begin();\n   return Dummy::MemberCont().begin();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Member_Iterator ROOT::Reflex::Scope::Member_End() const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the end iterator of member container.\n   if ( * this ) return fScopeName->fScopeBase->Member_End();\n   return Dummy::MemberCont().end();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Reverse_Member_Iterator ROOT::Reflex::Scope::Member_RBegin() const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the rbegin iterator of member container.\n   if ( * this ) return fScopeName->fScopeBase->Member_RBegin();\n   return Dummy::MemberCont().rbegin();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Reverse_Member_Iterator ROOT::Reflex::Scope::Member_REnd() const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the rend iterator of member container.\n   if ( * this ) return fScopeName->fScopeBase->Member_REnd();\n   return Dummy::MemberCont().rend();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Member ROOT::Reflex::Scope::MemberAt( size_t nth ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the nth member of this scope.\n   if ( * this ) return fScopeName->fScopeBase->MemberAt(nth); \n   return Dummy::Member();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::MemberTemplate ROOT::Reflex::Scope::MemberTemplateAt( size_t nth ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the nth memer template in this scope.\n   if ( * this ) return fScopeName->fScopeBase->MemberTemplateAt( nth );\n   return Dummy::MemberTemplate();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nsize_t ROOT::Reflex::Scope::MemberTemplateSize() const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the number of member templates in this scope.\n   if ( * this ) return fScopeName->fScopeBase->MemberTemplateSize();\n   return 0;\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::MemberTemplate ROOT::Reflex::Scope::MemberTemplateByName( const std::string & nam ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Look up a member template in this scope by name and return it.\n   if ( * this ) return fScopeName->fScopeBase->MemberTemplateByName( nam );\n   return Dummy::MemberTemplate();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nstd::string ROOT::Reflex::Scope::Name( unsigned int mod ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the name of this scope, scoped if requested.\n   if ( * this ) return fScopeName->fScopeBase->Name( mod );\n   else if ( fScopeName ) {\n      if ( 0 != ( mod & ( SCOPED | S ))) return fScopeName->Name();\n      else                               return Tools::GetBaseName( fScopeName->Name());\n   }\n   else {\n      return \"\";\n   }\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Scope ROOT::Reflex::Scope::ScopeAt( size_t nth ) {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the nth scope in the Reflex database.\n   return ScopeName::ScopeAt( nth );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nsize_t ROOT::Reflex::Scope::ScopeSize() {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the number of scopes defined.\n   return ScopeName::ScopeSize();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Type ROOT::Reflex::Scope::SubTypeAt( size_t nth ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the nth sub type of this scope.\n   if ( * this ) return fScopeName->fScopeBase->SubTypeAt( nth ); \n   return Dummy::Type();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nsize_t ROOT::Reflex::Scope::SubTypeSize() const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the number of sub types.\n   if ( * this ) return fScopeName->fScopeBase->SubTypeSize(); \n   return 0;\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Type ROOT::Reflex::Scope::SubTypeByName( const std::string & nam ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Look up a sub type by name and return it.\n   if ( * this ) return fScopeName->fScopeBase->SubTypeByName( nam );\n   return Dummy::Type();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Type ROOT::Reflex::Scope::TemplateArgumentAt( size_t nth ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the nth template argument of this scope (ie. class).\n   if ( * this ) return fScopeName->fScopeBase->TemplateArgumentAt( nth );\n   return Dummy::Type();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::TypeTemplate ROOT::Reflex::Scope::TemplateFamily() const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the template family related to this scope.\n   if ( * this ) return fScopeName->fScopeBase->TemplateFamily();\n   return Dummy::TypeTemplate();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::TypeTemplate ROOT::Reflex::Scope::SubTypeTemplateAt( size_t nth ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the nth sub type template.\n   if ( * this ) return fScopeName->fScopeBase->SubTypeTemplateAt( nth ); \n   return Dummy::TypeTemplate();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nsize_t ROOT::Reflex::Scope::SubTypeTemplateSize() const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the number of type templates in this scope.\n   if ( * this ) return fScopeName->fScopeBase->SubTypeTemplateSize();\n   return 0;\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::TypeTemplate ROOT::Reflex::Scope::SubTypeTemplateByName( const std::string & nam ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Lookup a sub type template by string and return it.\n   if ( * this ) return fScopeName->fScopeBase->SubTypeTemplateByName( nam );\n   return Dummy::TypeTemplate();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nvoid ROOT::Reflex::Scope::AddDataMember( const Member & dm ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Add data member dm to this scope.\n   if ( * this) fScopeName->fScopeBase->AddDataMember( dm );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nvoid ROOT::Reflex::Scope::AddDataMember( const char * name,\n                                         const Type & type,\n                                         size_t offset,\n                                         unsigned int modifiers ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Add data member to this scope.\n   if ( * this ) fScopeName->fScopeBase->AddDataMember( name, \n                                                        type, \n                                                        offset, \n                                                        modifiers );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nvoid ROOT::Reflex::Scope::RemoveDataMember( const Member & dm ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Remove data member dm from this scope.\n   if ( * this) fScopeName->fScopeBase->RemoveDataMember( dm );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nvoid ROOT::Reflex::Scope::AddFunctionMember( const Member & fm ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Add function member fm to this scope.\n   if ( * this) fScopeName->fScopeBase->AddFunctionMember( fm );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nvoid ROOT::Reflex::Scope::AddFunctionMember( const char * nam,\n                                             const Type & typ,\n                                             StubFunction stubFP,\n                                             void * stubCtx,\n                                             const char * params,\n                                             unsigned int modifiers ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Add function member to this scope.\n   if ( * this ) fScopeName->fScopeBase->AddFunctionMember( nam, \n                                                            typ, \n                                                            stubFP, \n                                                            stubCtx, \n                                                            params, \n                                                            modifiers );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nvoid ROOT::Reflex::Scope::RemoveFunctionMember( const Member & fm ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Remove function member fm from this scope.\n   if ( * this) fScopeName->fScopeBase->RemoveFunctionMember( fm );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nvoid ROOT::Reflex::Scope::AddSubType( const Type & ty ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Add sub type ty to this scope.\n   if ( * this) fScopeName->fScopeBase->AddSubType( ty );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nvoid ROOT::Reflex::Scope::AddSubType( const char * type,\n                                      size_t size,\n                                      TYPE typeType,\n                                      const std::type_info & typeInfo,\n                                      unsigned int modifiers ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Add sub type to this scope.\n   if ( * this ) fScopeName->fScopeBase->AddSubType( type, \n                                                     size, \n                                                     typeType, \n                                                     typeInfo, \n                                                     modifiers );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nvoid ROOT::Reflex::Scope::RemoveSubType( const Type & ty ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Remove sub type ty from this scope.\n   if ( * this) fScopeName->fScopeBase->RemoveSubType( ty );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nvoid ROOT::Reflex::Scope::AddMemberTemplate( const MemberTemplate & mt ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Add member template mt to this scope.\n   if ( * this ) fScopeName->fScopeBase->AddMemberTemplate( mt );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nvoid ROOT::Reflex::Scope::RemoveMemberTemplate( const MemberTemplate & mt ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Remove member template mt from this scope.\n   if ( * this ) fScopeName->fScopeBase->RemoveMemberTemplate( mt );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nvoid ROOT::Reflex::Scope::AddSubTypeTemplate( const TypeTemplate & tt ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Add type template tt to this scope.\n   if ( * this ) fScopeName->fScopeBase->AddSubTypeTemplate( tt );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nvoid ROOT::Reflex::Scope::RemoveSubTypeTemplate( const TypeTemplate & tt ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Remove type template tt from this scope.\n   if ( * this ) fScopeName->fScopeBase->RemoveSubTypeTemplate( tt );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nvoid ROOT::Reflex::Scope::GenerateDict( DictionaryGenerator & generator) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Generate Dictionary information about itself.\n   if ( * this ) fScopeName->fScopeBase->GenerateDict(generator);\n}\n\n#ifdef REFLEX_CINT_MERGE\nbool ROOT::Reflex::Scope::operator&&(const Scope &right) const\n{ return operator bool() && (bool)right; }\nbool ROOT::Reflex::Scope::operator&&(const Type &right) const \n{ return operator bool() && (bool)right; }\nbool ROOT::Reflex::Scope::operator&&(const Member &right) const \n{ return operator bool() && (bool)right; }\nbool ROOT::Reflex::Scope::operator||(const Scope &right) const \n{ return operator bool() && (bool)right; }\nbool ROOT::Reflex::Scope::operator||(const Type &right) const \n{ return operator bool() && (bool)right; }\nbool ROOT::Reflex::Scope::operator&||(const Member &right) const \n{ return operator bool() || (bool)right; }\n#endif\n<commit_msg>fix typo in operator overload for cint merge<commit_after>\/\/ @(#)root\/reflex:$Name:  $:$Id: Scope.cxx,v 1.22 2006\/10\/30 12:51:33 roiser Exp $\n\/\/ Author: Stefan Roiser 2004\n\n\/\/ Copyright CERN, CH-1211 Geneva 23, 2004-2006, All rights reserved.\n\/\/\n\/\/ Permission to use, copy, modify, and distribute this software for any\n\/\/ purpose is hereby granted without fee, provided that this copyright and\n\/\/ permissions notice appear in all copies and derivatives.\n\/\/\n\/\/ This software is provided \"as is\" without express or implied warranty.\n\n#ifndef REFLEX_BUILD\n#define REFLEX_BUILD\n#endif\n\n#include \"Reflex\/Scope.h\"\n\n#include \"Reflex\/internal\/ScopeBase.h\"\n#include \"Reflex\/Member.h\"\n#include \"Reflex\/Type.h\"\n#include \"Reflex\/TypeTemplate.h\"\n#include \"Reflex\/MemberTemplate.h\"\n#include \"Reflex\/Base.h\"\n\n#include \"Reflex\/Tools.h\"\n#include \"Class.h\"\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Scope & ROOT::Reflex::Scope::__NIRVANA__() {\n\/\/-------------------------------------------------------------------------------\n\/\/ static wraper around NIRVANA, the base of the top scope.\n   static Scope s = Scope( new ScopeName( \"@N@I@R@V@A@N@A@\", 0 ));\n   return s;\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Scope::operator ROOT::Reflex::Type () const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Conversion operator to Type. If this scope is not a Type, returns the empty type.\n   if ( * this ) return *(fScopeName->fScopeBase);\n   return Dummy::Type();\n}\n\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Base ROOT::Reflex::Scope::BaseAt( size_t nth ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return nth base class info.\n   if ( * this ) return fScopeName->fScopeBase->BaseAt( nth );\n   return Dummy::Base();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nsize_t ROOT::Reflex::Scope::BaseSize() const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return number of base classes.\n   if ( * this ) return fScopeName->fScopeBase->BaseSize();\n   return 0;\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Scope ROOT::Reflex::Scope::ByName( const std::string & name ) {\n\/\/-------------------------------------------------------------------------------\n\/\/ Lookup a Scope by it's fully qualified name.\n   return ScopeName::ByName( name );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Member ROOT::Reflex::Scope::DataMemberAt( size_t nth ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the nth data member of this scope.\n   if ( * this ) return fScopeName->fScopeBase->DataMemberAt( nth ); \n   return Dummy::Member();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Member ROOT::Reflex::Scope::DataMemberByName( const std::string & name ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return a data member by it's name.\n   if ( * this ) return fScopeName->fScopeBase->DataMemberByName( name ); \n   return Dummy::Member();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nsize_t ROOT::Reflex::Scope::DataMemberSize() const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return number of data mebers of this scope.\n   if ( * this ) return fScopeName->fScopeBase->DataMemberSize(); \n   return 0;\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Member ROOT::Reflex::Scope::FunctionMemberAt( size_t nth ) const {\n\/\/------------------------------------------------------------------------------- \n\/\/ Return nth function member of this socpe.\n   if ( * this ) return fScopeName->fScopeBase->FunctionMemberAt(nth); \n   return Dummy::Member();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Member ROOT::Reflex::Scope::FunctionMemberByName( const std::string & name ) const {\n\/\/------------------------------------------------------------------------------- \n\/\/ Return a function member by it's name.\n   if ( * this ) return fScopeName->fScopeBase->FunctionMemberByName( name, Type() ); \n   return Dummy::Member();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Member ROOT::Reflex::Scope::FunctionMemberByName( const std::string & name,\n                                                                const Type & signature ) const {\n\/\/------------------------------------------------------------------------------- \n\/\/ Return a function member by it's name, qualified by it's signature type.\n   if ( * this ) return fScopeName->fScopeBase->FunctionMemberByName( name, signature ); \n   return Dummy::Member();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nsize_t ROOT::Reflex::Scope::FunctionMemberSize() const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return number of function members of this scope.\n   if ( * this ) return fScopeName->fScopeBase->FunctionMemberSize(); \n   return 0;\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Member \nROOT::Reflex::Scope::LookupMember( const std::string & nam ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Lookup a member from this scope.\n   if ( * this ) return fScopeName->fScopeBase->LookupMember( nam, *this );\n   return Dummy::Member();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Type\nROOT::Reflex::Scope::LookupType( const std::string & nam ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Lookup a type from this scope.\n   if ( * this ) return fScopeName->fScopeBase->LookupType( nam, *this );\n   return Dummy::Type();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Scope\nROOT::Reflex::Scope::LookupScope( const std::string & nam ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Lookup a scope from this scope.\n   if ( * this ) return fScopeName->fScopeBase->LookupScope( nam, *this );\n   return Dummy::Scope();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Member \nROOT::Reflex::Scope::MemberByName( const std::string & name ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return a member from this scope, by name.\n   if ( * this ) return fScopeName->fScopeBase->MemberByName(name, Type()); \n   return Dummy::Member();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Member \nROOT::Reflex::Scope::MemberByName( const std::string & name,\n                                   const Type & signature ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return a member in this scope, looked up by name and signature (for functions)\n   if ( * this ) return fScopeName->fScopeBase->MemberByName(name, signature); \n   return Dummy::Member();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Member_Iterator ROOT::Reflex::Scope::Member_Begin() const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the begin iterator of member container.\n   if ( * this ) return fScopeName->fScopeBase->Member_Begin();\n   return Dummy::MemberCont().begin();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Member_Iterator ROOT::Reflex::Scope::Member_End() const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the end iterator of member container.\n   if ( * this ) return fScopeName->fScopeBase->Member_End();\n   return Dummy::MemberCont().end();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Reverse_Member_Iterator ROOT::Reflex::Scope::Member_RBegin() const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the rbegin iterator of member container.\n   if ( * this ) return fScopeName->fScopeBase->Member_RBegin();\n   return Dummy::MemberCont().rbegin();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Reverse_Member_Iterator ROOT::Reflex::Scope::Member_REnd() const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the rend iterator of member container.\n   if ( * this ) return fScopeName->fScopeBase->Member_REnd();\n   return Dummy::MemberCont().rend();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Member ROOT::Reflex::Scope::MemberAt( size_t nth ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the nth member of this scope.\n   if ( * this ) return fScopeName->fScopeBase->MemberAt(nth); \n   return Dummy::Member();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::MemberTemplate ROOT::Reflex::Scope::MemberTemplateAt( size_t nth ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the nth memer template in this scope.\n   if ( * this ) return fScopeName->fScopeBase->MemberTemplateAt( nth );\n   return Dummy::MemberTemplate();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nsize_t ROOT::Reflex::Scope::MemberTemplateSize() const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the number of member templates in this scope.\n   if ( * this ) return fScopeName->fScopeBase->MemberTemplateSize();\n   return 0;\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::MemberTemplate ROOT::Reflex::Scope::MemberTemplateByName( const std::string & nam ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Look up a member template in this scope by name and return it.\n   if ( * this ) return fScopeName->fScopeBase->MemberTemplateByName( nam );\n   return Dummy::MemberTemplate();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nstd::string ROOT::Reflex::Scope::Name( unsigned int mod ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the name of this scope, scoped if requested.\n   if ( * this ) return fScopeName->fScopeBase->Name( mod );\n   else if ( fScopeName ) {\n      if ( 0 != ( mod & ( SCOPED | S ))) return fScopeName->Name();\n      else                               return Tools::GetBaseName( fScopeName->Name());\n   }\n   else {\n      return \"\";\n   }\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Scope ROOT::Reflex::Scope::ScopeAt( size_t nth ) {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the nth scope in the Reflex database.\n   return ScopeName::ScopeAt( nth );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nsize_t ROOT::Reflex::Scope::ScopeSize() {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the number of scopes defined.\n   return ScopeName::ScopeSize();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Type ROOT::Reflex::Scope::SubTypeAt( size_t nth ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the nth sub type of this scope.\n   if ( * this ) return fScopeName->fScopeBase->SubTypeAt( nth ); \n   return Dummy::Type();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nsize_t ROOT::Reflex::Scope::SubTypeSize() const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the number of sub types.\n   if ( * this ) return fScopeName->fScopeBase->SubTypeSize(); \n   return 0;\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Type ROOT::Reflex::Scope::SubTypeByName( const std::string & nam ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Look up a sub type by name and return it.\n   if ( * this ) return fScopeName->fScopeBase->SubTypeByName( nam );\n   return Dummy::Type();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::Type ROOT::Reflex::Scope::TemplateArgumentAt( size_t nth ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the nth template argument of this scope (ie. class).\n   if ( * this ) return fScopeName->fScopeBase->TemplateArgumentAt( nth );\n   return Dummy::Type();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::TypeTemplate ROOT::Reflex::Scope::TemplateFamily() const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the template family related to this scope.\n   if ( * this ) return fScopeName->fScopeBase->TemplateFamily();\n   return Dummy::TypeTemplate();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::TypeTemplate ROOT::Reflex::Scope::SubTypeTemplateAt( size_t nth ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the nth sub type template.\n   if ( * this ) return fScopeName->fScopeBase->SubTypeTemplateAt( nth ); \n   return Dummy::TypeTemplate();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nsize_t ROOT::Reflex::Scope::SubTypeTemplateSize() const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Return the number of type templates in this scope.\n   if ( * this ) return fScopeName->fScopeBase->SubTypeTemplateSize();\n   return 0;\n}\n\n\n\/\/-------------------------------------------------------------------------------\nROOT::Reflex::TypeTemplate ROOT::Reflex::Scope::SubTypeTemplateByName( const std::string & nam ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Lookup a sub type template by string and return it.\n   if ( * this ) return fScopeName->fScopeBase->SubTypeTemplateByName( nam );\n   return Dummy::TypeTemplate();\n}\n\n\n\/\/-------------------------------------------------------------------------------\nvoid ROOT::Reflex::Scope::AddDataMember( const Member & dm ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Add data member dm to this scope.\n   if ( * this) fScopeName->fScopeBase->AddDataMember( dm );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nvoid ROOT::Reflex::Scope::AddDataMember( const char * name,\n                                         const Type & type,\n                                         size_t offset,\n                                         unsigned int modifiers ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Add data member to this scope.\n   if ( * this ) fScopeName->fScopeBase->AddDataMember( name, \n                                                        type, \n                                                        offset, \n                                                        modifiers );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nvoid ROOT::Reflex::Scope::RemoveDataMember( const Member & dm ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Remove data member dm from this scope.\n   if ( * this) fScopeName->fScopeBase->RemoveDataMember( dm );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nvoid ROOT::Reflex::Scope::AddFunctionMember( const Member & fm ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Add function member fm to this scope.\n   if ( * this) fScopeName->fScopeBase->AddFunctionMember( fm );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nvoid ROOT::Reflex::Scope::AddFunctionMember( const char * nam,\n                                             const Type & typ,\n                                             StubFunction stubFP,\n                                             void * stubCtx,\n                                             const char * params,\n                                             unsigned int modifiers ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Add function member to this scope.\n   if ( * this ) fScopeName->fScopeBase->AddFunctionMember( nam, \n                                                            typ, \n                                                            stubFP, \n                                                            stubCtx, \n                                                            params, \n                                                            modifiers );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nvoid ROOT::Reflex::Scope::RemoveFunctionMember( const Member & fm ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Remove function member fm from this scope.\n   if ( * this) fScopeName->fScopeBase->RemoveFunctionMember( fm );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nvoid ROOT::Reflex::Scope::AddSubType( const Type & ty ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Add sub type ty to this scope.\n   if ( * this) fScopeName->fScopeBase->AddSubType( ty );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nvoid ROOT::Reflex::Scope::AddSubType( const char * type,\n                                      size_t size,\n                                      TYPE typeType,\n                                      const std::type_info & typeInfo,\n                                      unsigned int modifiers ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Add sub type to this scope.\n   if ( * this ) fScopeName->fScopeBase->AddSubType( type, \n                                                     size, \n                                                     typeType, \n                                                     typeInfo, \n                                                     modifiers );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nvoid ROOT::Reflex::Scope::RemoveSubType( const Type & ty ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Remove sub type ty from this scope.\n   if ( * this) fScopeName->fScopeBase->RemoveSubType( ty );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nvoid ROOT::Reflex::Scope::AddMemberTemplate( const MemberTemplate & mt ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Add member template mt to this scope.\n   if ( * this ) fScopeName->fScopeBase->AddMemberTemplate( mt );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nvoid ROOT::Reflex::Scope::RemoveMemberTemplate( const MemberTemplate & mt ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Remove member template mt from this scope.\n   if ( * this ) fScopeName->fScopeBase->RemoveMemberTemplate( mt );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nvoid ROOT::Reflex::Scope::AddSubTypeTemplate( const TypeTemplate & tt ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Add type template tt to this scope.\n   if ( * this ) fScopeName->fScopeBase->AddSubTypeTemplate( tt );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nvoid ROOT::Reflex::Scope::RemoveSubTypeTemplate( const TypeTemplate & tt ) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Remove type template tt from this scope.\n   if ( * this ) fScopeName->fScopeBase->RemoveSubTypeTemplate( tt );\n}\n\n\n\/\/-------------------------------------------------------------------------------\nvoid ROOT::Reflex::Scope::GenerateDict( DictionaryGenerator & generator) const {\n\/\/-------------------------------------------------------------------------------\n\/\/ Generate Dictionary information about itself.\n   if ( * this ) fScopeName->fScopeBase->GenerateDict(generator);\n}\n\n#ifdef REFLEX_CINT_MERGE\nbool ROOT::Reflex::Scope::operator&&(const Scope &right) const\n{ return operator bool() && (bool)right; }\nbool ROOT::Reflex::Scope::operator&&(const Type &right) const \n{ return operator bool() && (bool)right; }\nbool ROOT::Reflex::Scope::operator&&(const Member &right) const \n{ return operator bool() && (bool)right; }\nbool ROOT::Reflex::Scope::operator||(const Scope &right) const \n{ return operator bool() && (bool)right; }\nbool ROOT::Reflex::Scope::operator||(const Type &right) const \n{ return operator bool() && (bool)right; }\nbool ROOT::Reflex::Scope::operator||(const Member &right) const \n{ return operator bool() || (bool)right; }\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file restclient.cpp\n * @brief implementation of the restclient class\n *\n * This just provides static wrappers around the Connection class REST\n * methods. However since I didn't want to have to pull in a whole URI parsing\n * library just now, the Connection constructor is passed an empty string and\n * the full URL is passed to the REST methods. All those methods to is\n * concatenate them anyways. So this should do for now.\n *\n * @author Daniel Schauenberg <d@unwiredcouch.com>\n *\/\n\n#include \"restclient-cpp\/restclient.h\"\n#include \"restclient-cpp\/version.h\"\n\n#include \"restclient-cpp\/connection.h\"\n\n\/**\n * @brief HTTP GET method\n *\n * @param url to query\n *\n * @return response struct\n *\/\nRestClient::Response RestClient::get(const std::string& url) {\n  RestClient::Connection *conn = new RestClient::Connection(\"\");\n  return conn->get(url);\n}\n\n\/**\n * @brief HTTP POST method\n *\n * @param url to query\n * @param ctype content type as string\n * @param data HTTP POST body\n *\n * @return response struct\n *\/\nRestClient::Response RestClient::post(const std::string& url,\n                                      const std::string& ctype,\n                                      const std::string& data) {\n  RestClient::Connection *conn = new RestClient::Connection(\"\");\n  conn->AppendHeader(\"Content-Type\", ctype);\n  return conn->post(url, data);\n}\n\n\/**\n * @brief HTTP PUT method\n *\n * @param url to query\n * @param ctype content type as string\n * @param data HTTP PUT body\n *\n * @return response struct\n *\/\nRestClient::Response RestClient::put(const std::string& url,\n                                     const std::string& ctype,\n                                     const std::string& data) {\n  RestClient::Connection *conn = new RestClient::Connection(\"\");\n  conn->AppendHeader(\"Content-Type\", ctype);\n  return conn->put(url, data);\n}\n\n\/**\n * @brief HTTP DELETE method\n *\n * @param url to query\n *\n * @return response struct\n *\/\nRestClient::Response RestClient::del(const std::string& url) {\n  RestClient::Connection *conn = new RestClient::Connection(\"\");\n  return conn->del(url);\n}\n\n<commit_msg>properly delete the connection object<commit_after>\/**\n * @file restclient.cpp\n * @brief implementation of the restclient class\n *\n * This just provides static wrappers around the Connection class REST\n * methods. However since I didn't want to have to pull in a whole URI parsing\n * library just now, the Connection constructor is passed an empty string and\n * the full URL is passed to the REST methods. All those methods to is\n * concatenate them anyways. So this should do for now.\n *\n * @author Daniel Schauenberg <d@unwiredcouch.com>\n *\/\n\n#include \"restclient-cpp\/restclient.h\"\n#include \"restclient-cpp\/version.h\"\n\n#include \"restclient-cpp\/connection.h\"\n\n\/**\n * @brief HTTP GET method\n *\n * @param url to query\n *\n * @return response struct\n *\/\nRestClient::Response RestClient::get(const std::string& url) {\n  RestClient::Response ret;\n  RestClient::Connection *conn = new RestClient::Connection(\"\");\n  ret = conn->get(url);\n  delete conn;\n  return ret;\n}\n\n\/**\n * @brief HTTP POST method\n *\n * @param url to query\n * @param ctype content type as string\n * @param data HTTP POST body\n *\n * @return response struct\n *\/\nRestClient::Response RestClient::post(const std::string& url,\n                                      const std::string& ctype,\n                                      const std::string& data) {\n  RestClient::Response ret;\n  RestClient::Connection *conn = new RestClient::Connection(\"\");\n  conn->AppendHeader(\"Content-Type\", ctype);\n  ret = conn->post(url, data);\n  delete conn;\n  return ret;\n}\n\n\/**\n * @brief HTTP PUT method\n *\n * @param url to query\n * @param ctype content type as string\n * @param data HTTP PUT body\n *\n * @return response struct\n *\/\nRestClient::Response RestClient::put(const std::string& url,\n                                     const std::string& ctype,\n                                     const std::string& data) {\n  RestClient::Response ret;\n  RestClient::Connection *conn = new RestClient::Connection(\"\");\n  conn->AppendHeader(\"Content-Type\", ctype);\n  ret = conn->put(url, data);\n  delete conn;\n  return ret;\n}\n\n\/**\n * @brief HTTP DELETE method\n *\n * @param url to query\n *\n * @return response struct\n *\/\nRestClient::Response RestClient::del(const std::string& url) {\n  RestClient::Response ret;\n  RestClient::Connection *conn = new RestClient::Connection(\"\");\n  ret = conn->del(url);\n  delete conn;\n  return ret;\n}\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Remove repetitive namespace close \/ open \/ close etc & unindent.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: databaseregistrationui.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: hr $ $Date: 2006-08-15 10:37: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\/\/ === includes (declaration) ============================================\n#ifndef SVX_DATABASE_REGISTRATION_UI_HXX\n#include \"databaseregistrationui.hxx\"\n#endif\n\n\/\/ === includes (UNO) ====================================================\n\/\/ === \/includes (UNO) ===================================================\n\n\/\/ === includes (project) ================================================\n#ifndef _SVX_DIALOG_HXX\n#include \"svxdlg.hxx\"\n#endif\n#ifndef _SVX_DIALOGS_HRC\n#include \"dialogs.hrc\"\n#endif\n#ifndef _OFFAPP_CONNPOOLOPTIONS_HXX_\n#include \"connpooloptions.hxx\"\n#endif\n\/\/ === \/includes (project) ===============================================\n\n\/\/ === includes (global) =================================================\n#ifndef _SFXAPP_HXX\n#include <sfx2\/app.hxx>\n#endif\n#ifndef _SFXITEMSET_HXX\n#include <svtools\/itemset.hxx>\n#endif\n#ifndef _SV_MSGBOX_HXX\n#include <vcl\/msgbox.hxx>\n#endif\n\/\/ === \/includes (global) ================================================\n\nnamespace svx\n{\n    USHORT administrateDatabaseRegistration( Window* _parentWindow )\n    {\n        USHORT nResult = RET_CANCEL;\n\n        SfxItemSet aRegistrationItems( SFX_APP()->GetPool(), SID_SB_DB_REGISTER, SID_SB_DB_REGISTER, 0 );\n\n        SvxAbstractDialogFactory* pDialogFactory = SvxAbstractDialogFactory::Create();\n        ::std::auto_ptr< AbstractSfxSingleTabDialog > pDialog;\n        if ( pDialogFactory )\n            pDialog.reset( pDialogFactory->CreateSfxSingleTabDialog( _parentWindow, aRegistrationItems, NULL, RID_SFXPAGE_DBREGISTER ) );\n        if ( pDialog.get() )\n            nResult = pDialog->Execute();\n\n        return nResult;\n    }\n\n}   \/\/ namespace svx\n<commit_msg>INTEGRATION: CWS pchfix02 (1.2.4); FILE MERGED 2006\/09\/01 17:46:08 kaib 1.2.4.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: databaseregistrationui.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 04:15:56 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_svx.hxx\"\n\n\/\/ === includes (declaration) ============================================\n#ifndef SVX_DATABASE_REGISTRATION_UI_HXX\n#include \"databaseregistrationui.hxx\"\n#endif\n\n\/\/ === includes (UNO) ====================================================\n\/\/ === \/includes (UNO) ===================================================\n\n\/\/ === includes (project) ================================================\n#ifndef _SVX_DIALOG_HXX\n#include \"svxdlg.hxx\"\n#endif\n#ifndef _SVX_DIALOGS_HRC\n#include \"dialogs.hrc\"\n#endif\n#ifndef _OFFAPP_CONNPOOLOPTIONS_HXX_\n#include \"connpooloptions.hxx\"\n#endif\n\/\/ === \/includes (project) ===============================================\n\n\/\/ === includes (global) =================================================\n#ifndef _SFXAPP_HXX\n#include <sfx2\/app.hxx>\n#endif\n#ifndef _SFXITEMSET_HXX\n#include <svtools\/itemset.hxx>\n#endif\n#ifndef _SV_MSGBOX_HXX\n#include <vcl\/msgbox.hxx>\n#endif\n\/\/ === \/includes (global) ================================================\n\nnamespace svx\n{\n    USHORT administrateDatabaseRegistration( Window* _parentWindow )\n    {\n        USHORT nResult = RET_CANCEL;\n\n        SfxItemSet aRegistrationItems( SFX_APP()->GetPool(), SID_SB_DB_REGISTER, SID_SB_DB_REGISTER, 0 );\n\n        SvxAbstractDialogFactory* pDialogFactory = SvxAbstractDialogFactory::Create();\n        ::std::auto_ptr< AbstractSfxSingleTabDialog > pDialog;\n        if ( pDialogFactory )\n            pDialog.reset( pDialogFactory->CreateSfxSingleTabDialog( _parentWindow, aRegistrationItems, NULL, RID_SFXPAGE_DBREGISTER ) );\n        if ( pDialog.get() )\n            nResult = pDialog->Execute();\n\n        return nResult;\n    }\n\n}   \/\/ namespace svx\n<|endoftext|>"}
{"text":"<commit_before>#include \"CRenderable.h\"\r\n\r\n#include \"CSceneObject.h\"\r\n#include \"SUniform.h\"\r\n#include \"SAttribute.h\"\r\n#include \"CShaderContext.h\"\r\n#include \"IScene.h\"\r\n\r\n\r\nvoid CRenderable::draw(IScene const * const Scene, ERenderPass const Pass, CShaderContext & ShaderContext)\r\n{\t\r\n\t\/\/ If the ibo loaded hasn't been synced as an index buffer object, we can't draw anything\r\n\tif (IndexBufferObject && ! IndexBufferObject->isIndexBuffer())\r\n\t{\r\n\t\tstd::cout << \"Failed to draw object, IBO is not index buffer.\" << std::endl;\r\n\t\treturn;\r\n\t}\r\n\r\n\t\/\/ Set up transform matrices\r\n\tModelMatrix = Transformation() * ParentObject->getAbsoluteTransformation();\r\n\tNormalMatrix = glm::transpose(glm::inverse(ModelMatrix));\r\n\r\n\t\/\/ Pass local values to shader\r\n\tfor (std::map<std::pair<GLuint, std::string>, boost::shared_ptr<IAttribute const> >::iterator it = ShaderContexts[Pass].LoadedAttributes.begin(); it != ShaderContexts[Pass].LoadedAttributes.end(); ++ it)\r\n\t\tit->second->bind(it->first.first);\r\n\tfor (std::map<std::pair<GLuint, std::string>, boost::shared_ptr<IUniform const> >::iterator it = ShaderContexts[Pass].LoadedUniforms.begin(); it != ShaderContexts[Pass].LoadedUniforms.end(); ++ it)\r\n\t\tit->second->bind(it->first.first);\r\n\r\n\t\/\/ Set up texturing if a texture was supplied\r\n\tif (Material.Textures.size())\r\n\t{\r\n\t\tglEnable(GL_TEXTURE_2D);\r\n\r\n\t\tfor (unsigned int i = 0; i < Material.Textures.size(); ++ i)\r\n\t\t{\r\n\t\t\tglActiveTexture(GL_TEXTURE0 + i);\r\n\t\t\tglBindTexture(GL_TEXTURE_2D, Material.Textures[i]->getTextureHandle());\r\n\t\t}\r\n\t}\r\n\r\n\tGLenum ElementType;\r\n\r\n\tswitch (DrawElementType)\r\n\t{\r\n\tcase EDrawElementType::Lines:\r\n\t\tElementType = GL_LINES;\r\n\t\t\/\/printf(\"Drawing Lines.\\n\");\r\n\t\tbreak;\r\n\tcase EDrawElementType::Points:\r\n\t\tElementType = GL_POINTS;\r\n\t\t\/\/printf(\"Drawing Points.\\n\");\r\n\t\tbreak;\r\n\tcase EDrawElementType::Triangles:\r\n\t\tElementType = GL_TRIANGLES;\r\n\t\t\/\/printf(\"Drawing Triangles.\\n\");\r\n\t\tbreak;\r\n\tcase EDrawElementType::Quads:\r\n\t\tElementType = GL_QUADS;\r\n\t\t\/\/printf(\"Drawing Quads.\\n\");\r\n\t\tbreak;\r\n\tdefault:\r\n\t\tprintf(\"Error! Unknown Draw Type Specified.\\n\");\r\n\t\tbreak;\r\n\t};\r\n\r\n\tif (ParentObject->isDebugDataEnabled(EDebugData::Wireframe))\r\n\t{\r\n\t\tglPolygonMode(GL_FRONT_AND_BACK, GL_LINE);\r\n\t}\r\n\r\n\tif (IndexBufferObject)\r\n\t{\r\n\t\t\/\/ If the ibo is dirty, sync it!\r\n\t\tif (IndexBufferObject->isDirty())\r\n\t\t\tIndexBufferObject->syncData();\r\n\r\n\t\t\/\/ And bind the synced buffer object to shader...\r\n\t\tShaderContext.bindIndexBufferObject(IndexBufferObject->getHandle());\r\n\r\n\t\tglDrawElements(ElementType, IndexBufferObject->getElements().size(), GL_UNSIGNED_SHORT, 0);\r\n\t}\r\n\telse\r\n\t{\r\n\t\tglDrawArrays(ElementType, 0, ElementCount);\r\n\t}\r\n\r\n\tif (ParentObject->isDebugDataEnabled(EDebugData::Wireframe))\r\n\t{\r\n\t\tglPolygonMode(GL_FRONT_AND_BACK, GL_FILL);\r\n\t}\r\n\r\n\t\/\/ Draw the normal object if it is enabled\r\n\tif (ParentObject->isDebugDataEnabled(EDebugData::Normals) && NormalObject)\r\n\t{\r\n\t\tNormalObject->Transformation = Transformation;\r\n\t\tNormalObject->draw(Scene, Pass, ShaderContext);\r\n\t}\r\n\r\n\t\/\/ Cleanup shader variables\r\n\tfor (std::map<std::pair<GLuint, std::string>, boost::shared_ptr<IAttribute const> >::iterator it = ShaderContexts[Pass].LoadedAttributes.begin(); it != ShaderContexts[Pass].LoadedAttributes.end(); ++ it)\r\n\t\tit->second->unbind(it->first.first);\r\n\r\n\t\/\/ Cleanup the texture if it was used\r\n\tif (Material.Textures.size())\r\n\t{\r\n\t\tglDisable(GL_TEXTURE_2D);\r\n\r\n\t\tfor (unsigned int i = 0; i < Material.Textures.size(); ++ i)\r\n\t\t{\r\n\t\t\tglActiveTexture(GL_TEXTURE0 + i);\r\n\t\t\tglBindTexture(GL_TEXTURE_2D, 0);\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid CRenderable::load(IScene const * const Scene, ERenderPass const Pass)\r\n{\r\n\tif (IndexBufferObject && IndexBufferObject->isDirty())\r\n\t\tIndexBufferObject->syncData();\r\n\r\n\tif (! ShaderContexts[Pass].Loaded)\r\n\t{\r\n\t\tShaderContexts[Pass].unload();\r\n\r\n\t\tCShader * Shader = ParentObject->getShader(Pass);\r\n\t\tif (! Shader)\r\n\t\t\treturn;\r\n\r\n\t\tfor (std::map<std::string, SShaderVariable>::const_iterator it = Shader->getAttributeHandles().begin(); it != Shader->getAttributeHandles().end(); ++ it)\r\n\t\t{\r\n\t\t\tstd::string const & Label = it->first;\r\n\r\n\t\t\tboost::shared_ptr<IAttribute const> Attribute = getAttribute(Label);\r\n\r\n\t\t\tif (! Attribute)\r\n\t\t\t\tAttribute = ParentObject->getAttribute(Label);\r\n\r\n\t\t\tif (! Attribute)\r\n\t\t\t\tAttribute = Scene->getAttribute(Label);\r\n\r\n\t\t\tif (! Attribute)\r\n\t\t\t\tstd::cout << \"Shader-required attribute '\" << Label << \"' was not provided for object \" << this << \".\" << std::endl;\r\n\t\t\telse\r\n\t\t\t\tShaderContexts[Pass].LoadedAttributes[std::pair<GLuint, std::string>(it->second.Handle, Label)] = Attribute;\r\n\t\t}\r\n\r\n\t\tfor (std::map<std::string, SShaderVariable>::const_iterator it = Shader->getUniformHandles().begin(); it != Shader->getUniformHandles().end(); ++ it)\r\n\t\t{\r\n\t\t\tstd::string const & Label = it->first;\r\n\r\n\t\t\tboost::shared_ptr<IUniform const> Uniform = getUniform(Label);\r\n\r\n\t\t\tif (! Uniform)\r\n\t\t\t\tUniform = ParentObject->getUniform(Label);\r\n\r\n\t\t\tif (! Uniform)\r\n\t\t\t\tUniform = Scene->getUniform(Label);\r\n\r\n\t\t\tif (! Uniform)\r\n\t\t\t\tstd::cout << \"Shader-required uniform '\" << Label << \"' was not provided for object \" << this << \".\" << std::endl;\r\n\t\t\telse\r\n\t\t\t\tShaderContexts[Pass].LoadedUniforms[std::pair<GLuint, std::string>(it->second.Handle, Label)] = Uniform;\r\n\t\t}\r\n\r\n\t\tShaderContexts[Pass].Loaded = true;\r\n\t}\r\n}\r\n<commit_msg>+ Some texture load safety<commit_after>#include \"CRenderable.h\"\r\n\r\n#include \"CSceneObject.h\"\r\n#include \"SUniform.h\"\r\n#include \"SAttribute.h\"\r\n#include \"CShaderContext.h\"\r\n#include \"IScene.h\"\r\n\r\n\r\nvoid CRenderable::draw(IScene const * const Scene, ERenderPass const Pass, CShaderContext & ShaderContext)\r\n{\t\r\n\t\/\/ If the ibo loaded hasn't been synced as an index buffer object, we can't draw anything\r\n\tif (IndexBufferObject && ! IndexBufferObject->isIndexBuffer())\r\n\t{\r\n\t\tstd::cout << \"Failed to draw object, IBO is not index buffer.\" << std::endl;\r\n\t\treturn;\r\n\t}\r\n\r\n\t\/\/ Set up transform matrices\r\n\tModelMatrix = Transformation() * ParentObject->getAbsoluteTransformation();\r\n\tNormalMatrix = glm::transpose(glm::inverse(ModelMatrix));\r\n\r\n\t\/\/ Pass local values to shader\r\n\tfor (std::map<std::pair<GLuint, std::string>, boost::shared_ptr<IAttribute const> >::iterator it = ShaderContexts[Pass].LoadedAttributes.begin(); it != ShaderContexts[Pass].LoadedAttributes.end(); ++ it)\r\n\t\tit->second->bind(it->first.first);\r\n\tfor (std::map<std::pair<GLuint, std::string>, boost::shared_ptr<IUniform const> >::iterator it = ShaderContexts[Pass].LoadedUniforms.begin(); it != ShaderContexts[Pass].LoadedUniforms.end(); ++ it)\r\n\t\tit->second->bind(it->first.first);\r\n\r\n\t\/\/ Set up texturing if a texture was supplied\r\n\tif (Material.Textures.size())\r\n\t{\r\n\t\tglEnable(GL_TEXTURE_2D);\r\n\r\n\t\tfor (unsigned int i = 0; i < Material.Textures.size(); ++ i)\r\n\t\t{\r\n\t\t\tglActiveTexture(GL_TEXTURE0 + i);\r\n\t\t\tif (Material.Textures[i])\r\n\t\t\t\tglBindTexture(GL_TEXTURE_2D, Material.Textures[i]->getTextureHandle());\r\n\t\t}\r\n\t}\r\n\r\n\tGLenum ElementType;\r\n\r\n\tswitch (DrawElementType)\r\n\t{\r\n\tcase EDrawElementType::Lines:\r\n\t\tElementType = GL_LINES;\r\n\t\t\/\/printf(\"Drawing Lines.\\n\");\r\n\t\tbreak;\r\n\tcase EDrawElementType::Points:\r\n\t\tElementType = GL_POINTS;\r\n\t\t\/\/printf(\"Drawing Points.\\n\");\r\n\t\tbreak;\r\n\tcase EDrawElementType::Triangles:\r\n\t\tElementType = GL_TRIANGLES;\r\n\t\t\/\/printf(\"Drawing Triangles.\\n\");\r\n\t\tbreak;\r\n\tcase EDrawElementType::Quads:\r\n\t\tElementType = GL_QUADS;\r\n\t\t\/\/printf(\"Drawing Quads.\\n\");\r\n\t\tbreak;\r\n\tdefault:\r\n\t\tprintf(\"Error! Unknown Draw Type Specified.\\n\");\r\n\t\tbreak;\r\n\t};\r\n\r\n\tif (ParentObject->isDebugDataEnabled(EDebugData::Wireframe))\r\n\t{\r\n\t\tglPolygonMode(GL_FRONT_AND_BACK, GL_LINE);\r\n\t}\r\n\r\n\tif (IndexBufferObject)\r\n\t{\r\n\t\t\/\/ If the ibo is dirty, sync it!\r\n\t\tif (IndexBufferObject->isDirty())\r\n\t\t\tIndexBufferObject->syncData();\r\n\r\n\t\t\/\/ And bind the synced buffer object to shader...\r\n\t\tShaderContext.bindIndexBufferObject(IndexBufferObject->getHandle());\r\n\r\n\t\tglDrawElements(ElementType, IndexBufferObject->getElements().size(), GL_UNSIGNED_SHORT, 0);\r\n\t}\r\n\telse\r\n\t{\r\n\t\tglDrawArrays(ElementType, 0, ElementCount);\r\n\t}\r\n\r\n\tif (ParentObject->isDebugDataEnabled(EDebugData::Wireframe))\r\n\t{\r\n\t\tglPolygonMode(GL_FRONT_AND_BACK, GL_FILL);\r\n\t}\r\n\r\n\t\/\/ Draw the normal object if it is enabled\r\n\tif (ParentObject->isDebugDataEnabled(EDebugData::Normals) && NormalObject)\r\n\t{\r\n\t\tNormalObject->Transformation = Transformation;\r\n\t\tNormalObject->draw(Scene, Pass, ShaderContext);\r\n\t}\r\n\r\n\t\/\/ Cleanup shader variables\r\n\tfor (std::map<std::pair<GLuint, std::string>, boost::shared_ptr<IAttribute const> >::iterator it = ShaderContexts[Pass].LoadedAttributes.begin(); it != ShaderContexts[Pass].LoadedAttributes.end(); ++ it)\r\n\t\tit->second->unbind(it->first.first);\r\n\r\n\t\/\/ Cleanup the texture if it was used\r\n\tif (Material.Textures.size())\r\n\t{\r\n\t\tglDisable(GL_TEXTURE_2D);\r\n\r\n\t\tfor (unsigned int i = 0; i < Material.Textures.size(); ++ i)\r\n\t\t{\r\n\t\t\tglActiveTexture(GL_TEXTURE0 + i);\r\n\t\t\tglBindTexture(GL_TEXTURE_2D, 0);\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid CRenderable::load(IScene const * const Scene, ERenderPass const Pass)\r\n{\r\n\tif (IndexBufferObject && IndexBufferObject->isDirty())\r\n\t\tIndexBufferObject->syncData();\r\n\r\n\tif (! ShaderContexts[Pass].Loaded)\r\n\t{\r\n\t\tShaderContexts[Pass].unload();\r\n\r\n\t\tCShader * Shader = ParentObject->getShader(Pass);\r\n\t\tif (! Shader)\r\n\t\t\treturn;\r\n\r\n\t\tfor (std::map<std::string, SShaderVariable>::const_iterator it = Shader->getAttributeHandles().begin(); it != Shader->getAttributeHandles().end(); ++ it)\r\n\t\t{\r\n\t\t\tstd::string const & Label = it->first;\r\n\r\n\t\t\tboost::shared_ptr<IAttribute const> Attribute = getAttribute(Label);\r\n\r\n\t\t\tif (! Attribute)\r\n\t\t\t\tAttribute = ParentObject->getAttribute(Label);\r\n\r\n\t\t\tif (! Attribute)\r\n\t\t\t\tAttribute = Scene->getAttribute(Label);\r\n\r\n\t\t\tif (! Attribute)\r\n\t\t\t\tstd::cout << \"Shader-required attribute '\" << Label << \"' was not provided for object \" << this << \".\" << std::endl;\r\n\t\t\telse\r\n\t\t\t\tShaderContexts[Pass].LoadedAttributes[std::pair<GLuint, std::string>(it->second.Handle, Label)] = Attribute;\r\n\t\t}\r\n\r\n\t\tfor (std::map<std::string, SShaderVariable>::const_iterator it = Shader->getUniformHandles().begin(); it != Shader->getUniformHandles().end(); ++ it)\r\n\t\t{\r\n\t\t\tstd::string const & Label = it->first;\r\n\r\n\t\t\tboost::shared_ptr<IUniform const> Uniform = getUniform(Label);\r\n\r\n\t\t\tif (! Uniform)\r\n\t\t\t\tUniform = ParentObject->getUniform(Label);\r\n\r\n\t\t\tif (! Uniform)\r\n\t\t\t\tUniform = Scene->getUniform(Label);\r\n\r\n\t\t\tif (! Uniform)\r\n\t\t\t\tstd::cout << \"Shader-required uniform '\" << Label << \"' was not provided for object \" << this << \".\" << std::endl;\r\n\t\t\telse\r\n\t\t\t\tShaderContexts[Pass].LoadedUniforms[std::pair<GLuint, std::string>(it->second.Handle, Label)] = Uniform;\r\n\t\t}\r\n\r\n\t\tShaderContexts[Pass].Loaded = true;\r\n\t}\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2016 Yahoo Inc. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n#include <vespa\/searchcorespi\/index\/warmupindexcollection.h>\n#include <vespa\/searchcorespi\/index\/idiskindex.h>\n#include <vespa\/vespalib\/util\/closuretask.h>\n#include <vespa\/searchlib\/fef\/matchdatalayout.h>\n#include <vespa\/searchlib\/query\/tree\/termnodes.h>\n#include <vespa\/log\/log.h>\n\nLOG_SETUP(\".searchcorespi.index.warmupindexcollection\");\n\nnamespace searchcorespi {\n\nusing search::query::StringBase;\nusing search::queryeval::Blueprint;\nusing search::fef::MatchDataLayout;\nusing search::queryeval::SearchIterator;\nusing search::queryeval::ISourceSelector;\nusing vespalib::makeTask;\nusing vespalib::makeClosure;\nusing index::IDiskIndex;\nusing fastos::TimeStamp;\nusing fastos::ClockSystem;\n\nWarmupIndexCollection::WarmupIndexCollection(const WarmupConfig & warmupConfig,\n                                             ISearchableIndexCollection::SP prev,\n                                             ISearchableIndexCollection::SP next,\n                                             IndexSearchable & warmup,\n                                             vespalib::ThreadExecutor & executor,\n                                             IWarmupDone & warmupDone) :\n    _warmupConfig(warmupConfig),\n    _prev(prev),\n    _next(next),\n    _warmup(warmup),\n    _executor(executor),\n    _warmupDone(warmupDone),\n    _warmupEndTime(ClockSystem::now() + TimeStamp::Seconds(warmupConfig.getDuration())),\n    _handledTerms()\n{\n    if (next->valid()) {\n        setCurrentIndex(next->getCurrentIndex());\n    } else {\n        LOG(warning, \"Next index is not valid, Dangerous !! : %s\", next->toString().c_str());\n    }\n    LOG(debug, \"For %g seconds I will warm up %s.\", warmupConfig.getDuration(), typeid(_warmup).name());\n    LOG(debug, \"%s\", toString().c_str());\n}\n\nvoid\nWarmupIndexCollection::setSource(uint32_t docId)\n{\n    assert(_prev->valid());\n    assert(_next->valid());\n    _prev->setSource(docId);\n    _next->setSource(docId);\n}\n\nvespalib::string\nWarmupIndexCollection::toString() const\n{\n    vespalib::asciistream os;\n    os << \"warmup : \";\n    if (dynamic_cast<const IDiskIndex *>(&_warmup) != NULL) {\n        os << static_cast<const IDiskIndex &>(_warmup).getIndexDir();\n    } else {\n        os << typeid(_warmup).name();\n    }\n    os << \"\\n\";\n    os << \"next   : \" << _next->toString() << \"\\n\";\n    os << \"prev   : \" << _prev->toString() << \"\\n\";\n    return os.str();\n}\n\nWarmupIndexCollection::~WarmupIndexCollection()\n{\n    if (_warmupEndTime != 0) {\n        LOG(info, \"Warmup aborted due to new state change or application shutdown\");\n    }\n   _executor.sync();\n}\n\nconst ISourceSelector &\nWarmupIndexCollection::getSourceSelector() const\n{\n    return _next->getSourceSelector();\n}\n\nsize_t\nWarmupIndexCollection::getSourceCount() const\n{\n    return _next->getSourceCount();\n}\n\nIndexSearchable &\nWarmupIndexCollection::getSearchable(uint32_t i) const\n{\n    return _next->getSearchable(i);\n}\n\nuint32_t\nWarmupIndexCollection::getSourceId(uint32_t i) const\n{\n    return _next->getSourceId(i);\n}\n\nvoid\nWarmupIndexCollection::fireWarmup(Task::UP task)\n{\n    fastos::TimeStamp now(fastos::ClockSystem::now());\n    if (now < _warmupEndTime) {\n        _executor.execute(std::move(task));\n    } else {\n        vespalib::LockGuard guard(_lock);\n        if (_warmupEndTime != 0) {\n            _warmupEndTime = 0;\n            guard.unlock();\n            LOG(info, \"Done warming up. Posting WarmupDoneTask\");\n            _warmupDone.warmupDone(shared_from_this());\n        }\n    }\n}\n\nbool\nWarmupIndexCollection::handledBefore(uint32_t fieldId, const Node &term)\n{\n    const StringBase * sb(dynamic_cast<const StringBase *>(&term));\n    if (sb != NULL) {\n        const vespalib::string & s = sb->getTerm();\n        vespalib::LockGuard guard(_lock);\n        TermMap::insert_result found = _handledTerms[fieldId].insert(s);\n        return ! found.second;\n    }\n    return true;\n}\nBlueprint::UP\nWarmupIndexCollection::createBlueprint(const IRequestContext & requestContext,\n                                       const FieldSpec &field,\n                                       const Node &term,\n                                       const IAttributeContext &attrCtx)\n{\n    if ( _warmupEndTime == 0) {\n        \/\/ warmup done\n        return _next->createBlueprint(requestContext, field, term, attrCtx);\n    }\n    if ( ! handledBefore(field.getFieldId(), term) ) {\n        MatchDataLayout mdl;\n        FieldSpec fs(field.getName(), field.getFieldId(), mdl.allocTermField(field.getFieldId()), field.isFilter());\n        Task::UP task(new WarmupTask(mdl.createMatchData(), *this));\n        static_cast<WarmupTask &>(*task).createBlueprint(fs, term, attrCtx);\n        fireWarmup(std::move(task));\n    }\n    return _prev->createBlueprint(requestContext, field, term, attrCtx);\n}\n\nBlueprint::UP\nWarmupIndexCollection::createBlueprint(const IRequestContext & requestContext,\n                                       const FieldSpecList &fields,\n                                       const Node &term,\n                                       const IAttributeContext &attrCtx)\n{\n    if ( _warmupEndTime == 0) {\n        \/\/ warmup done\n        return _next->createBlueprint(requestContext, fields, term, attrCtx);\n    }\n    MatchDataLayout mdl;\n    FieldSpecList fsl;\n    bool needWarmUp(false);\n    for(size_t i(0); i < fields.size(); i++) {\n        const FieldSpec & f(fields[i]);\n        FieldSpec fs(f.getName(), f.getFieldId(), mdl.allocTermField(f.getFieldId()), f.isFilter());\n        fsl.add(fs);\n        needWarmUp = needWarmUp || ! handledBefore(fs.getFieldId(), term);\n    }\n    if (needWarmUp) {\n        Task::UP task(new WarmupTask(mdl.createMatchData(), *this));\n        static_cast<WarmupTask &>(*task).createBlueprint(fsl, term, attrCtx);\n        fireWarmup(std::move(task));\n    }\n    return _prev->createBlueprint(requestContext, fields, term, attrCtx);\n}\n\nsearch::SearchableStats\nWarmupIndexCollection::getSearchableStats() const\n{\n    return _prev->getSearchableStats();\n}\n\nvoid\nWarmupIndexCollection::append(uint32_t id, const IndexSearchable::SP &source)\n{\n    _next->append(id, source);\n}\n\nvoid\nWarmupIndexCollection::replace(uint32_t id, const IndexSearchable::SP &source)\n{\n    _next->replace(id, source);\n}\n\nIndexSearchable::SP\nWarmupIndexCollection::getSearchableSP(uint32_t i) const\n{\n    return _next->getSearchableSP(i);\n}\n\nvoid\nWarmupIndexCollection::WarmupTask::run()\n{\n    if (_warmup._warmupEndTime != 0) {\n        LOG(debug, \"Warming up %s\", _bluePrint->asString().c_str());\n        _bluePrint->fetchPostings(true);\n        SearchIterator::UP it(_bluePrint->createSearch(*_matchData, true));\n        it->initFullRange();\n        for (uint32_t docId = it->seekFirst(1); !it->isAtEnd(); docId = it->seekNext(docId+1)) {\n            if (_warmup.doUnpack()) {\n                it->unpack(docId);\n            }\n        }\n    } else {\n        LOG(debug, \"Warmup has finished, ignoring task.\");\n    }\n}\n\n}\n<commit_msg>Tell if you are unpacking or not.<commit_after>\/\/ Copyright 2016 Yahoo Inc. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n#include <vespa\/searchcorespi\/index\/warmupindexcollection.h>\n#include <vespa\/searchcorespi\/index\/idiskindex.h>\n#include <vespa\/vespalib\/util\/closuretask.h>\n#include <vespa\/searchlib\/fef\/matchdatalayout.h>\n#include <vespa\/searchlib\/query\/tree\/termnodes.h>\n#include <vespa\/log\/log.h>\n\nLOG_SETUP(\".searchcorespi.index.warmupindexcollection\");\n\nnamespace searchcorespi {\n\nusing search::query::StringBase;\nusing search::queryeval::Blueprint;\nusing search::fef::MatchDataLayout;\nusing search::queryeval::SearchIterator;\nusing search::queryeval::ISourceSelector;\nusing vespalib::makeTask;\nusing vespalib::makeClosure;\nusing index::IDiskIndex;\nusing fastos::TimeStamp;\nusing fastos::ClockSystem;\n\nWarmupIndexCollection::WarmupIndexCollection(const WarmupConfig & warmupConfig,\n                                             ISearchableIndexCollection::SP prev,\n                                             ISearchableIndexCollection::SP next,\n                                             IndexSearchable & warmup,\n                                             vespalib::ThreadExecutor & executor,\n                                             IWarmupDone & warmupDone) :\n    _warmupConfig(warmupConfig),\n    _prev(prev),\n    _next(next),\n    _warmup(warmup),\n    _executor(executor),\n    _warmupDone(warmupDone),\n    _warmupEndTime(ClockSystem::now() + TimeStamp::Seconds(warmupConfig.getDuration())),\n    _handledTerms()\n{\n    if (next->valid()) {\n        setCurrentIndex(next->getCurrentIndex());\n    } else {\n        LOG(warning, \"Next index is not valid, Dangerous !! : %s\", next->toString().c_str());\n    }\n    LOG(debug, \"For %g seconds I will warm up '%s' %s unpack.\", warmupConfig.getDuration(), typeid(_warmup).name(), warmupConfig.getUnpack() ? \"with\" : \"without\");\n    LOG(debug, \"%s\", toString().c_str());\n}\n\nvoid\nWarmupIndexCollection::setSource(uint32_t docId)\n{\n    assert(_prev->valid());\n    assert(_next->valid());\n    _prev->setSource(docId);\n    _next->setSource(docId);\n}\n\nvespalib::string\nWarmupIndexCollection::toString() const\n{\n    vespalib::asciistream os;\n    os << \"warmup : \";\n    if (dynamic_cast<const IDiskIndex *>(&_warmup) != NULL) {\n        os << static_cast<const IDiskIndex &>(_warmup).getIndexDir();\n    } else {\n        os << typeid(_warmup).name();\n    }\n    os << \"\\n\";\n    os << \"next   : \" << _next->toString() << \"\\n\";\n    os << \"prev   : \" << _prev->toString() << \"\\n\";\n    return os.str();\n}\n\nWarmupIndexCollection::~WarmupIndexCollection()\n{\n    if (_warmupEndTime != 0) {\n        LOG(info, \"Warmup aborted due to new state change or application shutdown\");\n    }\n   _executor.sync();\n}\n\nconst ISourceSelector &\nWarmupIndexCollection::getSourceSelector() const\n{\n    return _next->getSourceSelector();\n}\n\nsize_t\nWarmupIndexCollection::getSourceCount() const\n{\n    return _next->getSourceCount();\n}\n\nIndexSearchable &\nWarmupIndexCollection::getSearchable(uint32_t i) const\n{\n    return _next->getSearchable(i);\n}\n\nuint32_t\nWarmupIndexCollection::getSourceId(uint32_t i) const\n{\n    return _next->getSourceId(i);\n}\n\nvoid\nWarmupIndexCollection::fireWarmup(Task::UP task)\n{\n    fastos::TimeStamp now(fastos::ClockSystem::now());\n    if (now < _warmupEndTime) {\n        _executor.execute(std::move(task));\n    } else {\n        vespalib::LockGuard guard(_lock);\n        if (_warmupEndTime != 0) {\n            _warmupEndTime = 0;\n            guard.unlock();\n            LOG(info, \"Done warming up. Posting WarmupDoneTask\");\n            _warmupDone.warmupDone(shared_from_this());\n        }\n    }\n}\n\nbool\nWarmupIndexCollection::handledBefore(uint32_t fieldId, const Node &term)\n{\n    const StringBase * sb(dynamic_cast<const StringBase *>(&term));\n    if (sb != NULL) {\n        const vespalib::string & s = sb->getTerm();\n        vespalib::LockGuard guard(_lock);\n        TermMap::insert_result found = _handledTerms[fieldId].insert(s);\n        return ! found.second;\n    }\n    return true;\n}\nBlueprint::UP\nWarmupIndexCollection::createBlueprint(const IRequestContext & requestContext,\n                                       const FieldSpec &field,\n                                       const Node &term,\n                                       const IAttributeContext &attrCtx)\n{\n    if ( _warmupEndTime == 0) {\n        \/\/ warmup done\n        return _next->createBlueprint(requestContext, field, term, attrCtx);\n    }\n    if ( ! handledBefore(field.getFieldId(), term) ) {\n        MatchDataLayout mdl;\n        FieldSpec fs(field.getName(), field.getFieldId(), mdl.allocTermField(field.getFieldId()), field.isFilter());\n        Task::UP task(new WarmupTask(mdl.createMatchData(), *this));\n        static_cast<WarmupTask &>(*task).createBlueprint(fs, term, attrCtx);\n        fireWarmup(std::move(task));\n    }\n    return _prev->createBlueprint(requestContext, field, term, attrCtx);\n}\n\nBlueprint::UP\nWarmupIndexCollection::createBlueprint(const IRequestContext & requestContext,\n                                       const FieldSpecList &fields,\n                                       const Node &term,\n                                       const IAttributeContext &attrCtx)\n{\n    if ( _warmupEndTime == 0) {\n        \/\/ warmup done\n        return _next->createBlueprint(requestContext, fields, term, attrCtx);\n    }\n    MatchDataLayout mdl;\n    FieldSpecList fsl;\n    bool needWarmUp(false);\n    for(size_t i(0); i < fields.size(); i++) {\n        const FieldSpec & f(fields[i]);\n        FieldSpec fs(f.getName(), f.getFieldId(), mdl.allocTermField(f.getFieldId()), f.isFilter());\n        fsl.add(fs);\n        needWarmUp = needWarmUp || ! handledBefore(fs.getFieldId(), term);\n    }\n    if (needWarmUp) {\n        Task::UP task(new WarmupTask(mdl.createMatchData(), *this));\n        static_cast<WarmupTask &>(*task).createBlueprint(fsl, term, attrCtx);\n        fireWarmup(std::move(task));\n    }\n    return _prev->createBlueprint(requestContext, fields, term, attrCtx);\n}\n\nsearch::SearchableStats\nWarmupIndexCollection::getSearchableStats() const\n{\n    return _prev->getSearchableStats();\n}\n\nvoid\nWarmupIndexCollection::append(uint32_t id, const IndexSearchable::SP &source)\n{\n    _next->append(id, source);\n}\n\nvoid\nWarmupIndexCollection::replace(uint32_t id, const IndexSearchable::SP &source)\n{\n    _next->replace(id, source);\n}\n\nIndexSearchable::SP\nWarmupIndexCollection::getSearchableSP(uint32_t i) const\n{\n    return _next->getSearchableSP(i);\n}\n\nvoid\nWarmupIndexCollection::WarmupTask::run()\n{\n    if (_warmup._warmupEndTime != 0) {\n        LOG(debug, \"Warming up %s\", _bluePrint->asString().c_str());\n        _bluePrint->fetchPostings(true);\n        SearchIterator::UP it(_bluePrint->createSearch(*_matchData, true));\n        it->initFullRange();\n        for (uint32_t docId = it->seekFirst(1); !it->isAtEnd(); docId = it->seekNext(docId+1)) {\n            if (_warmup.doUnpack()) {\n                it->unpack(docId);\n            }\n        }\n    } else {\n        LOG(debug, \"Warmup has finished, ignoring task.\");\n    }\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\r\n\/\/ PROJECT:         Aspia Remote Desktop\r\n\/\/ FILE:            crypto\/sha512.cc\r\n\/\/ LICENSE:         See top-level directory\r\n\/\/ PROGRAMMERS:     Dmitry Chapyshev (dmitry@aspia.ru)\r\n\/\/\r\n\r\n#include \"crypto\/sha512.h\"\r\n#include \"base\/logging.h\"\r\n#include \"base\/macros.h\"\r\n\r\n#include <wincrypt.h>\r\n\r\nnamespace aspia {\r\n\r\nstatic const DWORD kExpectedHashSize = 64;\r\n\r\nclass ScopedCryptoProvider\r\n{\r\npublic:\r\n    ScopedCryptoProvider() : prov_(NULL) { }\r\n    ~ScopedCryptoProvider() { CryptReleaseContext(prov_, 0); }\r\n\r\n    HCRYPTPROV* Recieve() { return &prov_; }\r\n    operator HCRYPTPROV() { return prov_; }\r\n\r\nprivate:\r\n    HCRYPTPROV prov_;\r\n\r\n    DISALLOW_COPY_AND_ASSIGN(ScopedCryptoProvider);\r\n};\r\n\r\nclass ScopedCryptoHash\r\n{\r\npublic:\r\n    ScopedCryptoHash() : hash_(NULL) { }\r\n    ~ScopedCryptoHash() { CryptDestroyHash(hash_); }\r\n\r\n    HCRYPTHASH* Recieve() { return &hash_; }\r\n    operator HCRYPTHASH() { return hash_; }\r\n\r\nprivate:\r\n    HCRYPTHASH hash_;\r\n\r\n    DISALLOW_COPY_AND_ASSIGN(ScopedCryptoHash);\r\n};\r\n\r\nbool CreateSHA512(const std::string& data, std::string& data_hash)\r\n{\r\n    ScopedCryptoProvider prov;\r\n\r\n    if (!CryptAcquireContextW(prov.Recieve(),\r\n                              NULL,\r\n                              MS_ENH_RSA_AES_PROV_W,\r\n                              PROV_RSA_AES,\r\n                              CRYPT_VERIFYCONTEXT))\r\n    {\r\n        LOG(ERROR) << \"CryptAcquireContextW() failed: \" << GetLastError();\r\n        return false;\r\n    }\r\n\r\n    {\r\n        ScopedCryptoHash hash;\r\n\r\n        if (!CryptCreateHash(prov, CALG_SHA_512, NULL, 0, hash.Recieve()))\r\n        {\r\n            LOG(ERROR) << \"CryptCreateHash() failed: \" << GetLastError();\r\n            return false;\r\n        }\r\n\r\n        if (!CryptHashData(hash,\r\n                           reinterpret_cast<const BYTE*>(data.c_str()),\r\n                           data.length(),\r\n                           0))\r\n        {\r\n            LOG(ERROR) << \"CryptHashData() failed: \" << GetLastError();\r\n            return false;\r\n        }\r\n\r\n        DWORD size = 0;\r\n\r\n        if (!CryptGetHashParam(hash, HP_HASHVAL, NULL, &size, 0))\r\n        {\r\n            LOG(ERROR) << \"CryptGetHashParam() failed: \" << GetLastError();\r\n            return false;\r\n        }\r\n\r\n        if (size != kExpectedHashSize)\r\n        {\r\n            LOG(ERROR) << \"Wrong hash size: \" << size;\r\n            return false;\r\n        }\r\n\r\n        data_hash.resize(size);\r\n\r\n        if (!CryptGetHashParam(hash,\r\n                               HP_HASHVAL,\r\n                               reinterpret_cast<BYTE*>(&data_hash[0]),\r\n                               &size,\r\n                               0))\r\n        {\r\n            LOG(ERROR) << \"CryptGetHashParam() failed: \" << GetLastError();\r\n            return false;\r\n        }\r\n    }\r\n\r\n    return true;\r\n}\r\n\r\n} \/\/ namespace aspia\r\n<commit_msg>- Add XP support for SHA512<commit_after>\/\/\r\n\/\/ PROJECT:         Aspia Remote Desktop\r\n\/\/ FILE:            crypto\/sha512.cc\r\n\/\/ LICENSE:         See top-level directory\r\n\/\/ PROGRAMMERS:     Dmitry Chapyshev (dmitry@aspia.ru)\r\n\/\/\r\n\r\n#include \"crypto\/sha512.h\"\r\n#include \"base\/logging.h\"\r\n#include \"base\/macros.h\"\r\n\r\n#include <wincrypt.h>\r\n\r\nnamespace aspia {\r\n\r\nstatic const DWORD kExpectedHashSize = 64;\r\n\r\nclass ScopedCryptoProvider\r\n{\r\npublic:\r\n    ScopedCryptoProvider() : prov_(NULL) { }\r\n    ~ScopedCryptoProvider() { CryptReleaseContext(prov_, 0); }\r\n\r\n    HCRYPTPROV* Recieve() { return &prov_; }\r\n    operator HCRYPTPROV() { return prov_; }\r\n\r\nprivate:\r\n    HCRYPTPROV prov_;\r\n\r\n    DISALLOW_COPY_AND_ASSIGN(ScopedCryptoProvider);\r\n};\r\n\r\nclass ScopedCryptoHash\r\n{\r\npublic:\r\n    ScopedCryptoHash() : hash_(NULL) { }\r\n    ~ScopedCryptoHash() { CryptDestroyHash(hash_); }\r\n\r\n    HCRYPTHASH* Recieve() { return &hash_; }\r\n    operator HCRYPTHASH() { return hash_; }\r\n\r\nprivate:\r\n    HCRYPTHASH hash_;\r\n\r\n    DISALLOW_COPY_AND_ASSIGN(ScopedCryptoHash);\r\n};\r\n\r\nbool CreateSHA512(const std::string& data, std::string& data_hash)\r\n{\r\n    ScopedCryptoProvider prov;\r\n\r\n    if (!CryptAcquireContextW(prov.Recieve(),\r\n                              NULL,\r\n                              MS_ENH_RSA_AES_PROV_W,\r\n                              PROV_RSA_AES,\r\n                              CRYPT_VERIFYCONTEXT))\r\n    {\r\n        if (!CryptAcquireContextW(prov.Recieve(),\r\n                                  NULL,\r\n                                  MS_ENH_RSA_AES_PROV_XP_W,\r\n                                  PROV_RSA_AES,\r\n                                  CRYPT_VERIFYCONTEXT))\r\n        {\r\n            LOG(ERROR) << \"CryptAcquireContextW() failed: \" << GetLastError();\r\n            return nullptr;\r\n        }\r\n    }\r\n\r\n    {\r\n        ScopedCryptoHash hash;\r\n\r\n        if (!CryptCreateHash(prov, CALG_SHA_512, NULL, 0, hash.Recieve()))\r\n        {\r\n            LOG(ERROR) << \"CryptCreateHash() failed: \" << GetLastError();\r\n            return false;\r\n        }\r\n\r\n        if (!CryptHashData(hash,\r\n                           reinterpret_cast<const BYTE*>(data.c_str()),\r\n                           data.length(),\r\n                           0))\r\n        {\r\n            LOG(ERROR) << \"CryptHashData() failed: \" << GetLastError();\r\n            return false;\r\n        }\r\n\r\n        DWORD size = 0;\r\n\r\n        if (!CryptGetHashParam(hash, HP_HASHVAL, NULL, &size, 0))\r\n        {\r\n            LOG(ERROR) << \"CryptGetHashParam() failed: \" << GetLastError();\r\n            return false;\r\n        }\r\n\r\n        if (size != kExpectedHashSize)\r\n        {\r\n            LOG(ERROR) << \"Wrong hash size: \" << size;\r\n            return false;\r\n        }\r\n\r\n        data_hash.resize(size);\r\n\r\n        if (!CryptGetHashParam(hash,\r\n                               HP_HASHVAL,\r\n                               reinterpret_cast<BYTE*>(&data_hash[0]),\r\n                               &size,\r\n                               0))\r\n        {\r\n            LOG(ERROR) << \"CryptGetHashParam() failed: \" << GetLastError();\r\n            return false;\r\n        }\r\n    }\r\n\r\n    return true;\r\n}\r\n\r\n} \/\/ namespace aspia\r\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2019 Oath Inc. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n\n#include <vespa\/vespalib\/testkit\/test_kit.h>\n#include <vespa\/vespalib\/util\/stringfmt.h>\n\n#include <vespa\/eval\/tensor\/default_tensor_engine.h>\n#include <vespa\/eval\/tensor\/dense\/dense_tensor.h>\n#include <vespa\/eval\/tensor\/tensor.h>\n#include <vespa\/searchlib\/common\/feature.h>\n#include <vespa\/searchlib\/fef\/matchdata.h>\n#include <vespa\/searchlib\/queryeval\/nearest_neighbor_iterator.h>\n#include <vespa\/searchlib\/queryeval\/simpleresult.h>\n#include <vespa\/searchlib\/tensor\/dense_tensor_attribute.h>\n#include <vespa\/vespalib\/test\/insertion_operators.h>\n\n#include <vespa\/log\/log.h>\nLOG_SETUP(\"nearest_neighbor_test\");\n\nusing search::feature_t;\nusing search::tensor::DenseTensorAttribute;\nusing search::AttributeVector;\nusing vespalib::eval::ValueType;\nusing vespalib::eval::TensorSpec;\nusing vespalib::tensor::Tensor;\nusing vespalib::tensor::DenseTensorView;\nusing vespalib::tensor::DefaultTensorEngine;\n\nusing namespace search::fef;\nusing namespace search::queryeval;\n\nvespalib::string denseSpecDouble(\"tensor(x[2])\");\nvespalib::string denseSpecFloat(\"tensor<float>(x[2])\");\n\nstd::unique_ptr<DenseTensorView> createTensor(const TensorSpec &spec) {\n    auto value = DefaultTensorEngine::ref().from_spec(spec);\n    DenseTensorView *tensor = dynamic_cast<DenseTensorView*>(value.get());\n    ASSERT_TRUE(tensor != nullptr);\n    value.release();\n    return std::unique_ptr<DenseTensorView>(tensor);\n}\n\nstd::unique_ptr<DenseTensorView> createTensor(const vespalib::string& type_spec, double v1, double v2) {\n    return createTensor(TensorSpec(type_spec).add({{\"x\", 0}}, v1)\n                                             .add({{\"x\", 1}}, v2));\n}\n\nstruct Fixture\n{\n    using BasicType = search::attribute::BasicType;\n    using CollectionType = search::attribute::CollectionType;\n    using Config = search::attribute::Config;\n\n    Config _cfg;\n    vespalib::string _name;\n    vespalib::string _typeSpec;\n    std::shared_ptr<DenseTensorAttribute> _tensorAttr;\n    std::shared_ptr<AttributeVector> _attr;\n\n    Fixture(const vespalib::string &typeSpec)\n        : _cfg(BasicType::TENSOR, CollectionType::SINGLE),\n          _name(\"test\"),\n          _typeSpec(typeSpec),\n          _tensorAttr(),\n          _attr()\n    {\n        _cfg.setTensorType(ValueType::from_spec(typeSpec));\n        _tensorAttr = makeAttr();\n        _attr = _tensorAttr;\n        _attr->addReservedDoc();\n    }\n\n    ~Fixture() {}\n\n    std::shared_ptr<DenseTensorAttribute> makeAttr() {\n        return std::make_shared<DenseTensorAttribute>(_name, _cfg);\n    }\n\n    void ensureSpace(uint32_t docId) {\n        while (_attr->getNumDocs() <= docId) {\n            uint32_t newDocId = 0u;\n            _attr->addDoc(newDocId);\n            _attr->commit();\n        }\n    }\n\n    void setTensor(uint32_t docId, const Tensor &tensor) {\n        ensureSpace(docId);\n        _tensorAttr->setTensor(docId, tensor);\n        _attr->commit();\n    }\n\n    void setTensor(uint32_t docId, double v1, double v2) {\n        auto t = createTensor(_typeSpec, v1, v2);\n        setTensor(docId, *t);\n    }\n};\n\ntemplate <bool strict>\nSimpleResult find_matches(Fixture &env, const DenseTensorView &qtv) {\n    auto md = MatchData::makeTestInstance(2, 2);\n    auto &tfmd = *(md->resolveTermField(0));\n    auto &attr = *(env._tensorAttr);\n    NearestNeighborDistanceHeap dh(2);\n    auto search = NearestNeighborIterator::create(strict, tfmd, qtv, attr, dh);\n    if (strict) {\n        return SimpleResult().searchStrict(*search, attr.getNumDocs());\n    } else {\n        return SimpleResult().search(*search, attr.getNumDocs());\n    }\n}\n\nvoid\nverify_iterator_returns_expected_results(const vespalib::string& attribute_tensor_type_spec,\n                                         const vespalib::string& query_tensor_type_spec)\n{\n    Fixture fixture(attribute_tensor_type_spec);\n    fixture.ensureSpace(6);\n    fixture.setTensor(1, 3.0, 4.0);\n    fixture.setTensor(2, 6.0, 8.0);\n    fixture.setTensor(3, 5.0, 12.0);\n    fixture.setTensor(4, 4.0, 3.0);\n    fixture.setTensor(5, 8.0, 6.0);\n    fixture.setTensor(6, 4.0, 3.0);\n    auto nullTensor = createTensor(query_tensor_type_spec, 0.0, 0.0);\n    SimpleResult result = find_matches<true>(fixture, *nullTensor);\n    SimpleResult nullExpect({1,2,4,6});\n    EXPECT_EQUAL(result, nullExpect);\n    result = find_matches<false>(fixture, *nullTensor);\n    EXPECT_EQUAL(result, nullExpect);\n    auto farTensor = createTensor(query_tensor_type_spec, 9.0, 9.0);\n    SimpleResult farExpect({1,2,3,5});\n    result = find_matches<true>(fixture, *farTensor);\n    EXPECT_EQUAL(result, farExpect);\n    result = find_matches<false>(fixture, *farTensor);\n    EXPECT_EQUAL(result, farExpect);\n}\n\nTEST(\"require that NearestNeighborIterator returns expected results\") {\n    TEST_DO(verify_iterator_returns_expected_results(denseSpecDouble, denseSpecDouble));\n    TEST_DO(verify_iterator_returns_expected_results(denseSpecFloat, denseSpecFloat));\n    TEST_DO(verify_iterator_returns_expected_results(denseSpecDouble, denseSpecFloat));\n    TEST_DO(verify_iterator_returns_expected_results(denseSpecFloat, denseSpecDouble));\n}\n\ntemplate <bool strict>\nstd::vector<feature_t> get_rawscores(Fixture &env, const DenseTensorView &qtv) {\n    auto md = MatchData::makeTestInstance(2, 2);\n    auto &tfmd = *(md->resolveTermField(0));\n    auto &attr = *(env._tensorAttr);\n    NearestNeighborDistanceHeap dh(2);\n    auto search = NearestNeighborIterator::create(strict, tfmd, qtv, attr, dh);\n    uint32_t limit = attr.getNumDocs();\n    uint32_t docid = 1;\n    search->initRange(docid, limit);\n    std::vector<feature_t> rv;\n    while (docid < limit) {\n        if (search->seek(docid)) {\n            search->unpack(docid);\n            rv.push_back(tfmd.getRawScore());\n        }\n        docid = std::max(search->getDocId(), docid + 1);\n    }\n    return rv;\n}\n\nvoid\nverify_iterator_sets_expected_rawscore(const vespalib::string& attribute_tensor_type_spec,\n                                       const vespalib::string& query_tensor_type_spec)\n{\n    Fixture fixture(attribute_tensor_type_spec);\n    fixture.ensureSpace(6);\n    fixture.setTensor(1, 3.0, 4.0);\n    fixture.setTensor(2, 5.0, 12.0);\n    fixture.setTensor(3, 6.0, 8.0);\n    fixture.setTensor(4, 5.0, 12.0);\n    fixture.setTensor(5, 8.0, 6.0);\n    fixture.setTensor(6, 4.0, 3.0);\n    auto nullTensor = createTensor(query_tensor_type_spec, 0.0, 0.0);\n    std::vector<feature_t> got = get_rawscores<true>(fixture, *nullTensor);\n    std::vector<feature_t> expected{5.0, 13.0, 10.0, 10.0, 5.0};\n    EXPECT_EQUAL(got, expected);\n    got = get_rawscores<false>(fixture, *nullTensor);\n    EXPECT_EQUAL(got, expected);\n}\n\nTEST(\"require that NearestNeighborIterator sets expected rawscore\") {\n    TEST_DO(verify_iterator_sets_expected_rawscore(denseSpecDouble, denseSpecDouble));\n    TEST_DO(verify_iterator_sets_expected_rawscore(denseSpecFloat, denseSpecFloat));\n    TEST_DO(verify_iterator_sets_expected_rawscore(denseSpecDouble, denseSpecFloat));\n    TEST_DO(verify_iterator_sets_expected_rawscore(denseSpecFloat, denseSpecDouble));\n}\n\nTEST_MAIN() { TEST_RUN_ALL(); }\n<commit_msg>unit test vector iterator<commit_after>\/\/ Copyright 2019 Oath Inc. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n\n#include <vespa\/vespalib\/testkit\/test_kit.h>\n#include <vespa\/vespalib\/util\/stringfmt.h>\n\n#include <vespa\/eval\/tensor\/default_tensor_engine.h>\n#include <vespa\/eval\/tensor\/dense\/dense_tensor.h>\n#include <vespa\/eval\/tensor\/tensor.h>\n#include <vespa\/searchlib\/common\/feature.h>\n#include <vespa\/searchlib\/fef\/matchdata.h>\n#include <vespa\/searchlib\/queryeval\/nearest_neighbor_iterator.h>\n#include <vespa\/searchlib\/queryeval\/simpleresult.h>\n#include <vespa\/searchlib\/tensor\/dense_tensor_attribute.h>\n#include <vespa\/vespalib\/test\/insertion_operators.h>\n#include <vespa\/searchlib\/queryeval\/nns_index_iterator.h>\n\n#include <vespa\/log\/log.h>\nLOG_SETUP(\"nearest_neighbor_test\");\n\nusing search::feature_t;\nusing search::tensor::DenseTensorAttribute;\nusing search::AttributeVector;\nusing vespalib::eval::ValueType;\nusing vespalib::eval::TensorSpec;\nusing vespalib::tensor::Tensor;\nusing vespalib::tensor::DenseTensorView;\nusing vespalib::tensor::DefaultTensorEngine;\n\nusing namespace search::fef;\nusing namespace search::queryeval;\n\nvespalib::string denseSpecDouble(\"tensor(x[2])\");\nvespalib::string denseSpecFloat(\"tensor<float>(x[2])\");\n\nstd::unique_ptr<DenseTensorView> createTensor(const TensorSpec &spec) {\n    auto value = DefaultTensorEngine::ref().from_spec(spec);\n    DenseTensorView *tensor = dynamic_cast<DenseTensorView*>(value.get());\n    ASSERT_TRUE(tensor != nullptr);\n    value.release();\n    return std::unique_ptr<DenseTensorView>(tensor);\n}\n\nstd::unique_ptr<DenseTensorView> createTensor(const vespalib::string& type_spec, double v1, double v2) {\n    return createTensor(TensorSpec(type_spec).add({{\"x\", 0}}, v1)\n                                             .add({{\"x\", 1}}, v2));\n}\n\nstruct Fixture\n{\n    using BasicType = search::attribute::BasicType;\n    using CollectionType = search::attribute::CollectionType;\n    using Config = search::attribute::Config;\n\n    Config _cfg;\n    vespalib::string _name;\n    vespalib::string _typeSpec;\n    std::shared_ptr<DenseTensorAttribute> _tensorAttr;\n    std::shared_ptr<AttributeVector> _attr;\n\n    Fixture(const vespalib::string &typeSpec)\n        : _cfg(BasicType::TENSOR, CollectionType::SINGLE),\n          _name(\"test\"),\n          _typeSpec(typeSpec),\n          _tensorAttr(),\n          _attr()\n    {\n        _cfg.setTensorType(ValueType::from_spec(typeSpec));\n        _tensorAttr = makeAttr();\n        _attr = _tensorAttr;\n        _attr->addReservedDoc();\n    }\n\n    ~Fixture() {}\n\n    std::shared_ptr<DenseTensorAttribute> makeAttr() {\n        return std::make_shared<DenseTensorAttribute>(_name, _cfg);\n    }\n\n    void ensureSpace(uint32_t docId) {\n        while (_attr->getNumDocs() <= docId) {\n            uint32_t newDocId = 0u;\n            _attr->addDoc(newDocId);\n            _attr->commit();\n        }\n    }\n\n    void setTensor(uint32_t docId, const Tensor &tensor) {\n        ensureSpace(docId);\n        _tensorAttr->setTensor(docId, tensor);\n        _attr->commit();\n    }\n\n    void setTensor(uint32_t docId, double v1, double v2) {\n        auto t = createTensor(_typeSpec, v1, v2);\n        setTensor(docId, *t);\n    }\n};\n\ntemplate <bool strict>\nSimpleResult find_matches(Fixture &env, const DenseTensorView &qtv) {\n    auto md = MatchData::makeTestInstance(2, 2);\n    auto &tfmd = *(md->resolveTermField(0));\n    auto &attr = *(env._tensorAttr);\n    NearestNeighborDistanceHeap dh(2);\n    auto search = NearestNeighborIterator::create(strict, tfmd, qtv, attr, dh);\n    if (strict) {\n        return SimpleResult().searchStrict(*search, attr.getNumDocs());\n    } else {\n        return SimpleResult().search(*search, attr.getNumDocs());\n    }\n}\n\nvoid\nverify_iterator_returns_expected_results(const vespalib::string& attribute_tensor_type_spec,\n                                         const vespalib::string& query_tensor_type_spec)\n{\n    Fixture fixture(attribute_tensor_type_spec);\n    fixture.ensureSpace(6);\n    fixture.setTensor(1, 3.0, 4.0);\n    fixture.setTensor(2, 6.0, 8.0);\n    fixture.setTensor(3, 5.0, 12.0);\n    fixture.setTensor(4, 4.0, 3.0);\n    fixture.setTensor(5, 8.0, 6.0);\n    fixture.setTensor(6, 4.0, 3.0);\n    auto nullTensor = createTensor(query_tensor_type_spec, 0.0, 0.0);\n    SimpleResult result = find_matches<true>(fixture, *nullTensor);\n    SimpleResult nullExpect({1,2,4,6});\n    EXPECT_EQUAL(result, nullExpect);\n    result = find_matches<false>(fixture, *nullTensor);\n    EXPECT_EQUAL(result, nullExpect);\n    auto farTensor = createTensor(query_tensor_type_spec, 9.0, 9.0);\n    SimpleResult farExpect({1,2,3,5});\n    result = find_matches<true>(fixture, *farTensor);\n    EXPECT_EQUAL(result, farExpect);\n    result = find_matches<false>(fixture, *farTensor);\n    EXPECT_EQUAL(result, farExpect);\n}\n\nTEST(\"require that NearestNeighborIterator returns expected results\") {\n    TEST_DO(verify_iterator_returns_expected_results(denseSpecDouble, denseSpecDouble));\n    TEST_DO(verify_iterator_returns_expected_results(denseSpecFloat, denseSpecFloat));\n    TEST_DO(verify_iterator_returns_expected_results(denseSpecDouble, denseSpecFloat));\n    TEST_DO(verify_iterator_returns_expected_results(denseSpecFloat, denseSpecDouble));\n}\n\ntemplate <bool strict>\nstd::vector<feature_t> get_rawscores(Fixture &env, const DenseTensorView &qtv) {\n    auto md = MatchData::makeTestInstance(2, 2);\n    auto &tfmd = *(md->resolveTermField(0));\n    auto &attr = *(env._tensorAttr);\n    NearestNeighborDistanceHeap dh(2);\n    auto search = NearestNeighborIterator::create(strict, tfmd, qtv, attr, dh);\n    uint32_t limit = attr.getNumDocs();\n    uint32_t docid = 1;\n    search->initRange(docid, limit);\n    std::vector<feature_t> rv;\n    while (docid < limit) {\n        if (search->seek(docid)) {\n            search->unpack(docid);\n            rv.push_back(tfmd.getRawScore());\n        }\n        docid = std::max(search->getDocId(), docid + 1);\n    }\n    return rv;\n}\n\nvoid\nverify_iterator_sets_expected_rawscore(const vespalib::string& attribute_tensor_type_spec,\n                                       const vespalib::string& query_tensor_type_spec)\n{\n    Fixture fixture(attribute_tensor_type_spec);\n    fixture.ensureSpace(6);\n    fixture.setTensor(1, 3.0, 4.0);\n    fixture.setTensor(2, 5.0, 12.0);\n    fixture.setTensor(3, 6.0, 8.0);\n    fixture.setTensor(4, 5.0, 12.0);\n    fixture.setTensor(5, 8.0, 6.0);\n    fixture.setTensor(6, 4.0, 3.0);\n    auto nullTensor = createTensor(query_tensor_type_spec, 0.0, 0.0);\n    std::vector<feature_t> got = get_rawscores<true>(fixture, *nullTensor);\n    std::vector<feature_t> expected{5.0, 13.0, 10.0, 10.0, 5.0};\n    EXPECT_EQUAL(got, expected);\n    got = get_rawscores<false>(fixture, *nullTensor);\n    EXPECT_EQUAL(got, expected);\n}\n\nTEST(\"require that NearestNeighborIterator sets expected rawscore\") {\n    TEST_DO(verify_iterator_sets_expected_rawscore(denseSpecDouble, denseSpecDouble));\n    TEST_DO(verify_iterator_sets_expected_rawscore(denseSpecFloat, denseSpecFloat));\n    TEST_DO(verify_iterator_sets_expected_rawscore(denseSpecDouble, denseSpecFloat));\n    TEST_DO(verify_iterator_sets_expected_rawscore(denseSpecFloat, denseSpecDouble));\n}\n\nTEST(\"require that NnsIndexIterator works as expected\") {\n    std::vector<NnsIndexIterator::Hit> hits{{2,4.0}, {3,9.0}, {5,1.0}, {8,16.0}, {9,36.0}};\n    auto md = MatchData::makeTestInstance(2, 2);\n    auto &tfmd = *(md->resolveTermField(0));\n    auto search = NnsIndexIterator::create(true, tfmd, hits);\n    uint32_t docid = 1;\n    search->initFullRange();\n    bool match = search->seek(docid);\n    EXPECT_FALSE(match);\n    EXPECT_FALSE(search->isAtEnd());\n    EXPECT_EQUAL(2u, search->getDocId());\n    docid = 2;\n    match = search->seek(docid);\n    EXPECT_TRUE(match);\n    EXPECT_FALSE(search->isAtEnd());\n    EXPECT_EQUAL(docid, search->getDocId());\n    search->unpack(docid);\n    EXPECT_EQUAL(2.0, tfmd.getRawScore());\n\n    docid = 3;\n    match = search->seek(docid);\n    EXPECT_TRUE(match);\n    EXPECT_FALSE(search->isAtEnd());\n    EXPECT_EQUAL(docid, search->getDocId());\n    search->unpack(docid);\n    EXPECT_EQUAL(3.0, tfmd.getRawScore());\n\n    docid = 4;\n    match = search->seek(docid);\n    EXPECT_FALSE(match);\n    EXPECT_FALSE(search->isAtEnd());\n    EXPECT_EQUAL(5u, search->getDocId());\n\n    docid = 6;\n    match = search->seek(docid);\n    EXPECT_FALSE(match);\n    EXPECT_FALSE(search->isAtEnd());\n    EXPECT_EQUAL(8u, search->getDocId());\n    docid = 8;\n    search->unpack(docid);\n    EXPECT_EQUAL(4.0, tfmd.getRawScore());\n    docid = 9;\n    match = search->seek(docid);\n    EXPECT_TRUE(match);\n    EXPECT_FALSE(search->isAtEnd());\n    docid = 10;\n    match = search->seek(docid);\n    EXPECT_FALSE(match);\n    EXPECT_TRUE(search->isAtEnd());\n\n    docid = 4;\n    search->initRange(docid, 7);\n    match = search->seek(docid);\n    EXPECT_FALSE(match);\n    EXPECT_FALSE(search->isAtEnd());\n    EXPECT_EQUAL(5u, search->getDocId());\n    docid = 5;\n    search->unpack(docid);\n    EXPECT_EQUAL(1.0, tfmd.getRawScore());\n    EXPECT_FALSE(search->isAtEnd());\n    docid = 6;\n    match = search->seek(docid);\n    EXPECT_FALSE(match);\n    EXPECT_TRUE(search->isAtEnd());\n}\n\nTEST_MAIN() { TEST_RUN_ALL(); }\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Use ATTR_SKIP_WAKEUP to determine what we do for PM reset<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 \"condor_common.h\"\n#include \"shadow_mgr.h\"\n#include \"simplelist.h\"\n#include \"string_list.h\"\n#include \"condor_attributes.h\"\n#include \"condor_string.h\"\n#include \"classad_merge.h\"\n#include \"my_popen.h\"\n\n\/*\n\n  ! ! ! BEWARE ! ! !\n\n  These two objects are based pretty heavily on the Starter and\n  StarterMgr objects in the startd.  There was no easy way to share\n  the code via common base classes, and the Starter and Shadow objects\n  are very different from each other.  However, most of the code in\n  here was lifted from condor_startd.V6\/Starter.C and\n  condor_startd.V6\/starter_mgr.C.  If you change anything in here, you\n  should check in those two files, too, and make sure you don't need\n  to make the same change on that side.  \n\n  ! ! ! BEWARE ! ! !\n\n*\/\n\n\n\/\/--------------------------------------------------\n\/\/ Shadow object\n\/\/--------------------------------------------------\n\n\nShadow::Shadow( const char* path_arg, ClassAd* ad )\n{\n\ts_path = strnewp( path_arg );\n\ts_ad = ad;\n\ts_is_dc = false;\n\tm_version_info = NULL;\n\n\tif ( s_ad ) {\n\t\ts_ad->LookupBool( ATTR_IS_DAEMON_CORE, s_is_dc );\n\n\t\tchar* version_string = NULL;\n\t\tif (s_ad->LookupString(ATTR_VERSION, &version_string)) {\n\t\t\tm_version_info = new CondorVersionInfo(version_string, \"SHADOW\", NULL);\n\t\t\tfree(version_string);\n\t\t}\n\t}\n}\n\n\nShadow::Shadow( const Shadow& s )\n{\n\tif( s.s_path ) {\n\t\ts_path = strnewp( s.s_path );\n\t} else {\n\t\ts_path = NULL;\n\t}\n\n\tif( s.s_ad ) {\n\t\ts_ad = new ClassAd( *(s.s_ad) );\n\t} else {\n\t\ts_ad = NULL;\n\t}\n\n\ts_is_dc = s.s_is_dc;\n\n\tchar* version_string = NULL;\n\tif (s_ad && s_ad->LookupString(ATTR_VERSION, &version_string)) {\n\t\tm_version_info = new CondorVersionInfo(version_string, \"SHADOW\", NULL);\n\t\tfree(version_string);\n\t} else {\n\t\tm_version_info = NULL;\n\t}\n}\n\n\nShadow::~Shadow()\n{\n\tif( s_path ) {\n\t\tdelete [] s_path;\n\t}\n\tif( s_ad ) {\n\t\tdelete( s_ad );\n\t}\n\tif (m_version_info) {\n\t\tdelete(m_version_info);\n\t}\n}\n\n\nbool\nShadow::provides( const char* ability )\n{\n\tint has_it = 0;\n\tif( ! s_ad ) {\n\t\treturn false;\n\t}\n\tif( ! s_ad->EvalBool(ability, NULL, has_it) ) { \n\t\thas_it = 0;\n\t}\n\treturn (bool)has_it;\n}\n\n\nvoid\nShadow::printInfo( int debug_level )\n{\n\tdprintf( debug_level, \"Info for \\\"%s\\\":\\n\", s_path );\n\tdprintf( debug_level | D_NOHEADER, \"IsDaemonCore: %s\\n\", \n\t\t\t s_is_dc ? \"True\" : \"False\" );\n\tif( ! s_ad ) {\n\t\tdprintf( debug_level | D_NOHEADER, \n\t\t\t\t \"No ClassAd available!\\n\" ); \n\t} else {\n\t\ts_ad->dPrint( debug_level );\n\t}\n\tdprintf( debug_level | D_NOHEADER, \"*** End of shadow info ***\\n\" ); \n}\n\n\nbool\nShadow::builtSinceVersion(int major, int minor, int sub_minor) {\n\tif (m_version_info) {\n\t\treturn m_version_info->built_since_version(major, minor, sub_minor);\n\t}\n\t\t\/*\n\t\t  It doesn't even have a version string, we should return\n\t\t  false and assume it's older than whatever we care about\n\t\t  (e.g. this functionality was added for 6.8.5, and we *know*\n\t\t  the shadow is returning a version string there).\n\t\t*\/\n\tdprintf(D_ALWAYS, \"ERROR: shadow classad does not contain version \"\n\t\t\t\"information, it must be REALLY OLD.  \"\n\t\t\t\"Please upgrade your shadow immediately.\");\n\treturn false;\n}\n\n\nbool\nShadow::builtSinceDate(int month, int day, int year) {\n\tif (m_version_info) {\n\t\treturn m_version_info->built_since_date(month, day, year);\n\t}\n\t\t\/*\n\t\t  It doesn't even have a version string, we should return\n\t\t  false and assume it's older than whatever we care about\n\t\t  (e.g. this functionality was added for 6.8.5, and we *know*\n\t\t  the shadow is returning a version string there).\n\t\t*\/\n\tdprintf(D_ALWAYS, \"ERROR: shadow classad does not contain version \"\n\t\t\t\"information, it must be REALLY OLD.  \"\n\t\t\t\"Please upgrade your shadow immediately.\");\n\treturn false;\n}\n\n\n\/\/--------------------------------------------------\n\/\/ ShadowMgr:: object\n\/\/--------------------------------------------------\n\n\nShadowMgr::ShadowMgr()\n{\n}\n\n\nShadowMgr::~ShadowMgr()\n{\n\tShadow* tmp_shadow;\n\tshadows.Rewind();\n\twhile( shadows.Next(tmp_shadow) ) {\n\t\tdelete( tmp_shadow );\n\t\tshadows.DeleteCurrent();\n\t}\n\n}\n\n\nvoid\nShadowMgr::init( void )\n{\n\tStringList shadow_list;\n\tStringList checked_shadow_list;\n\tShadow* tmp_shadow;\n\tshadows.Rewind();\n\twhile( shadows.Next(tmp_shadow) ) {\n\t\tdelete( tmp_shadow );\n\t\tshadows.DeleteCurrent();\n\t}\n\tbool new_config = true;\n\n\tchar *tmp, *shadow_path;\n\ttmp = param( \"SHADOW_LIST\" );\n\tif( ! tmp ) {\n\t\t\t\/\/ Not defined, give them a default\n\t\tnew_config = false;\n\t\ttmp = strdup( \"SHADOW, SHADOW_STANDARD\" );\n\t}\n\tshadow_list.initializeFromString( tmp );\n\tfree( tmp );\n\n\tshadow_list.rewind();\n\twhile( (tmp = shadow_list.next()) ) {\n\t\tshadow_path = param( tmp );\n\t\tif( ! shadow_path ) {\n\t\t\tif( new_config ) {\n\t\t\t\tdprintf( D_ALWAYS, \"Shadow specified in SHADOW_LIST \"\n\t\t\t\t\t\t \"\\\"%s\\\" not found in config file, ignoring.\\n\",\n\t\t\t\t\t\t tmp ); \n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\t\tif( checked_shadow_list.contains(shadow_path) ) {\n\t\t\tif( new_config ) {\n\t\t\t\tdprintf( D_ALWAYS, \"Shadow pointed to by \\\"%s\\\" (%s) is \"\n\t\t\t\t\t\t \"in SHADOW_LIST more than once, ignoring.\\n\", \n\t\t\t\t\t\t tmp, shadow_path );\n\t\t\t}\n\t\t\tfree( shadow_path );\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\t\t\/\/ now, we've got a path to a binary we want to use as a\n\t\t\t\/\/ shadow.  try to run it with a -classad option and grab\n\t\t\t\/\/ the output (which should be a classad), and construct\n\t\t\t\/\/ the appropriate Shadow object for it.\n\t\ttmp_shadow = makeShadow( shadow_path );\n\t\tif( tmp_shadow ) {\n\t\t\tshadows.Append( tmp_shadow );\n\t\t}\n\t\t\t\/\/ record the fact that we've already considered this\n\t\t\t\/\/ shadow, even if it failed to give us a classad. \n\t\tchecked_shadow_list.append( shadow_path );\n\t\tfree( shadow_path );\n\t}\n\tif( ! new_config ) {\n\t\t\t\/\/ if we're reading an old config file, we've got to check\n\t\t\t\/\/ for one more thing.  none of their old settings are\n\t\t\t\/\/ going to reference \"condor_shadow.std\", which is the\n\t\t\t\/\/ new name for the non-dc standard universe shadow.  So,\n\t\t\t\/\/ try to find that ourselves.\n\t\tchar* sbin = param( \"SBIN\" );\n\t\tif( sbin ) {\n\t\t\tMyString std_path;\n\t\t\tstd_path += sbin;\n\t\t\tfree( sbin );\n\t\t\tstd_path += \"\/condor_shadow.std\";\n\t\t\ttmp_shadow = makeShadow( std_path.Value() );\n\t\t\tif( tmp_shadow ) {\n\t\t\t\tshadows.Append( tmp_shadow );\n\t\t\t}\n\t\t}\n\t}\n}\n\n\nShadow*\nShadowMgr::findShadow( const char* ability )\n{\n\tShadow *new_shadow, *tmp_shadow;\n\n\tshadows.Rewind();\n\twhile( shadows.Next(tmp_shadow) ) {\n\t\tif( tmp_shadow->provides(ability) ) {\n\t\t\tnew_shadow = new Shadow( *tmp_shadow );\n\t\t\treturn new_shadow;\n\t\t}\n\t}\n\treturn NULL;\n}\n\n\nvoid\nShadowMgr::printShadowInfo( int debug_level )\n{\n\tShadow *tmp_shadow;\n\tshadows.Rewind();\n\twhile( shadows.Next(tmp_shadow) ) {\n\t\ttmp_shadow->printInfo( debug_level );\n\t}\n}\n\n\nShadow*\nShadowMgr::makeShadow( const char* path )\n{\n\tShadow* new_shadow;\n\tFILE* fp;\r\n\tchar *args[] = {const_cast<char*>(path), \"-classad\", NULL};\n\tchar buf[1024];\n\n\t\t\/\/ first, try to execute the given path with a \"-classad\"\n\t\t\/\/ option, and grab the output as a ClassAd\n\tfp = my_popenv( args, \"r\", FALSE );\n\n\tif( ! fp ) {\n\t\tdprintf( D_ALWAYS, \"Failed to execute %s, ignoring\\n\", path );\n\t\treturn NULL;\n\t}\n\tClassAd* ad = new ClassAd;\n\tbool read_something = false;\n\twhile( fgets(buf, 1024, fp) ) {\n\t\tread_something = true;\n\t\tif( ! ad->Insert(buf) ) {\n\t\t\tdprintf( D_ALWAYS, \"Failed to insert \\\"%s\\\" into ClassAd, \"\n\t\t\t\t\t \"ignoring invalid shadow\\n\", buf );\n\t\t\tdelete( ad );\n\t\t\tmy_pclose( fp );\n\t\t\treturn NULL;\n\t\t}\n\t}\n\tmy_pclose( fp );\n\tif( ! read_something ) {\n\t\tdprintf( D_ALWAYS, \"\\\"%s -classad\\\" did not produce any output, \"\n\t\t\t\t \"ignoring\\n\", path ); \n\t\tdelete( ad );\n\t\treturn NULL;\n\t}\n\tnew_shadow = new Shadow( path, ad );\n\treturn new_shadow;\n}\n\n<commit_msg>Removed param for SBIN and fixed up code for config files that include SHADOW_LIST (true since 2002) (#1408)<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 \"shadow_mgr.h\"\n#include \"simplelist.h\"\n#include \"string_list.h\"\n#include \"condor_attributes.h\"\n#include \"condor_string.h\"\n#include \"classad_merge.h\"\n#include \"my_popen.h\"\n\n\/*\n\n  ! ! ! BEWARE ! ! !\n\n  These two objects are based pretty heavily on the Starter and\n  StarterMgr objects in the startd.  There was no easy way to share\n  the code via common base classes, and the Starter and Shadow objects\n  are very different from each other.  However, most of the code in\n  here was lifted from condor_startd.V6\/Starter.C and\n  condor_startd.V6\/starter_mgr.C.  If you change anything in here, you\n  should check in those two files, too, and make sure you don't need\n  to make the same change on that side.  \n\n  ! ! ! BEWARE ! ! !\n\n*\/\n\n\n\/\/--------------------------------------------------\n\/\/ Shadow object\n\/\/--------------------------------------------------\n\n\nShadow::Shadow( const char* path_arg, ClassAd* ad )\n{\n\ts_path = strnewp( path_arg );\n\ts_ad = ad;\n\ts_is_dc = false;\n\tm_version_info = NULL;\n\n\tif ( s_ad ) {\n\t\ts_ad->LookupBool( ATTR_IS_DAEMON_CORE, s_is_dc );\n\n\t\tchar* version_string = NULL;\n\t\tif (s_ad->LookupString(ATTR_VERSION, &version_string)) {\n\t\t\tm_version_info = new CondorVersionInfo(version_string, \"SHADOW\", NULL);\n\t\t\tfree(version_string);\n\t\t}\n\t}\n}\n\n\nShadow::Shadow( const Shadow& s )\n{\n\tif( s.s_path ) {\n\t\ts_path = strnewp( s.s_path );\n\t} else {\n\t\ts_path = NULL;\n\t}\n\n\tif( s.s_ad ) {\n\t\ts_ad = new ClassAd( *(s.s_ad) );\n\t} else {\n\t\ts_ad = NULL;\n\t}\n\n\ts_is_dc = s.s_is_dc;\n\n\tchar* version_string = NULL;\n\tif (s_ad && s_ad->LookupString(ATTR_VERSION, &version_string)) {\n\t\tm_version_info = new CondorVersionInfo(version_string, \"SHADOW\", NULL);\n\t\tfree(version_string);\n\t} else {\n\t\tm_version_info = NULL;\n\t}\n}\n\n\nShadow::~Shadow()\n{\n\tif( s_path ) {\n\t\tdelete [] s_path;\n\t}\n\tif( s_ad ) {\n\t\tdelete( s_ad );\n\t}\n\tif (m_version_info) {\n\t\tdelete(m_version_info);\n\t}\n}\n\n\nbool\nShadow::provides( const char* ability )\n{\n\tint has_it = 0;\n\tif( ! s_ad ) {\n\t\treturn false;\n\t}\n\tif( ! s_ad->EvalBool(ability, NULL, has_it) ) { \n\t\thas_it = 0;\n\t}\n\treturn (bool)has_it;\n}\n\n\nvoid\nShadow::printInfo( int debug_level )\n{\n\tdprintf( debug_level, \"Info for \\\"%s\\\":\\n\", s_path );\n\tdprintf( debug_level | D_NOHEADER, \"IsDaemonCore: %s\\n\", \n\t\t\t s_is_dc ? \"True\" : \"False\" );\n\tif( ! s_ad ) {\n\t\tdprintf( debug_level | D_NOHEADER, \n\t\t\t\t \"No ClassAd available!\\n\" ); \n\t} else {\n\t\ts_ad->dPrint( debug_level );\n\t}\n\tdprintf( debug_level | D_NOHEADER, \"*** End of shadow info ***\\n\" ); \n}\n\n\nbool\nShadow::builtSinceVersion(int major, int minor, int sub_minor) {\n\tif (m_version_info) {\n\t\treturn m_version_info->built_since_version(major, minor, sub_minor);\n\t}\n\t\t\/*\n\t\t  It doesn't even have a version string, we should return\n\t\t  false and assume it's older than whatever we care about\n\t\t  (e.g. this functionality was added for 6.8.5, and we *know*\n\t\t  the shadow is returning a version string there).\n\t\t*\/\n\tdprintf(D_ALWAYS, \"ERROR: shadow classad does not contain version \"\n\t\t\t\"information, it must be REALLY OLD.  \"\n\t\t\t\"Please upgrade your shadow immediately.\");\n\treturn false;\n}\n\n\nbool\nShadow::builtSinceDate(int month, int day, int year) {\n\tif (m_version_info) {\n\t\treturn m_version_info->built_since_date(month, day, year);\n\t}\n\t\t\/*\n\t\t  It doesn't even have a version string, we should return\n\t\t  false and assume it's older than whatever we care about\n\t\t  (e.g. this functionality was added for 6.8.5, and we *know*\n\t\t  the shadow is returning a version string there).\n\t\t*\/\n\tdprintf(D_ALWAYS, \"ERROR: shadow classad does not contain version \"\n\t\t\t\"information, it must be REALLY OLD.  \"\n\t\t\t\"Please upgrade your shadow immediately.\");\n\treturn false;\n}\n\n\n\/\/--------------------------------------------------\n\/\/ ShadowMgr:: object\n\/\/--------------------------------------------------\n\n\nShadowMgr::ShadowMgr()\n{\n}\n\n\nShadowMgr::~ShadowMgr()\n{\n\tShadow* tmp_shadow;\n\tshadows.Rewind();\n\twhile( shadows.Next(tmp_shadow) ) {\n\t\tdelete( tmp_shadow );\n\t\tshadows.DeleteCurrent();\n\t}\n\n}\n\n\nvoid\nShadowMgr::init( void )\n{\n\tStringList shadow_list;\n\tStringList checked_shadow_list;\n\tShadow* tmp_shadow;\n\tshadows.Rewind();\n\twhile( shadows.Next(tmp_shadow) ) {\n\t\tdelete( tmp_shadow );\n\t\tshadows.DeleteCurrent();\n\t}\n\n\tchar *tmp, *shadow_path;\n\ttmp = param( \"SHADOW_LIST\" );\n\tif( ! tmp ) {\n\t\t\t\/\/ Not defined, give them a default\n\t\ttmp = strdup( \"SHADOW, SHADOW_STANDARD\" );\n\t\tdprintf(D_ALWAYS,\n\t\t\t\t\"WARNING: SHADOW_LIST not defined in config file, \"\n\t\t\t\t\"using default: %s\\n\", tmp);\n\t}\n\tshadow_list.initializeFromString( tmp );\n\tfree( tmp );\n\n\tshadow_list.rewind();\n\twhile( (tmp = shadow_list.next()) ) {\n\t\tshadow_path = param( tmp );\n\t\tif( ! shadow_path ) {\n\t\t\tdprintf( D_ALWAYS, \"Shadow specified in SHADOW_LIST \"\n\t\t\t\t\t \"\\\"%s\\\" not found in config file, ignoring.\\n\",\n\t\t\t\t\t tmp ); \n\t\t\tcontinue;\n\t\t}\n\t\tif( checked_shadow_list.contains(shadow_path) ) {\n\t\t\tdprintf( D_ALWAYS, \"Shadow pointed to by \\\"%s\\\" (%s) is \"\n\t\t\t\t\t \"in SHADOW_LIST more than once, ignoring.\\n\", \n\t\t\t\t\t tmp, shadow_path );\n\t\t\tfree( shadow_path );\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\t\t\/\/ now, we've got a path to a binary we want to use as a\n\t\t\t\/\/ shadow.  try to run it with a -classad option and grab\n\t\t\t\/\/ the output (which should be a classad), and construct\n\t\t\t\/\/ the appropriate Shadow object for it.\n\t\ttmp_shadow = makeShadow( shadow_path );\n\t\tif( tmp_shadow ) {\n\t\t\tshadows.Append( tmp_shadow );\n\t\t}\n\t\t\t\/\/ record the fact that we've already considered this\n\t\t\t\/\/ shadow, even if it failed to give us a classad. \n\t\tchecked_shadow_list.append( shadow_path );\n\t\tfree( shadow_path );\n\t}\n}\n\n\nShadow*\nShadowMgr::findShadow( const char* ability )\n{\n\tShadow *new_shadow, *tmp_shadow;\n\n\tshadows.Rewind();\n\twhile( shadows.Next(tmp_shadow) ) {\n\t\tif( tmp_shadow->provides(ability) ) {\n\t\t\tnew_shadow = new Shadow( *tmp_shadow );\n\t\t\treturn new_shadow;\n\t\t}\n\t}\n\treturn NULL;\n}\n\n\nvoid\nShadowMgr::printShadowInfo( int debug_level )\n{\n\tShadow *tmp_shadow;\n\tshadows.Rewind();\n\twhile( shadows.Next(tmp_shadow) ) {\n\t\ttmp_shadow->printInfo( debug_level );\n\t}\n}\n\n\nShadow*\nShadowMgr::makeShadow( const char* path )\n{\n\tShadow* new_shadow;\n\tFILE* fp;\r\n\tchar *args[] = {const_cast<char*>(path), \"-classad\", NULL};\n\tchar buf[1024];\n\n\t\t\/\/ first, try to execute the given path with a \"-classad\"\n\t\t\/\/ option, and grab the output as a ClassAd\n\tfp = my_popenv( args, \"r\", FALSE );\n\n\tif( ! fp ) {\n\t\tdprintf( D_ALWAYS, \"Failed to execute %s, ignoring\\n\", path );\n\t\treturn NULL;\n\t}\n\tClassAd* ad = new ClassAd;\n\tbool read_something = false;\n\twhile( fgets(buf, 1024, fp) ) {\n\t\tread_something = true;\n\t\tif( ! ad->Insert(buf) ) {\n\t\t\tdprintf( D_ALWAYS, \"Failed to insert \\\"%s\\\" into ClassAd, \"\n\t\t\t\t\t \"ignoring invalid shadow\\n\", buf );\n\t\t\tdelete( ad );\n\t\t\tmy_pclose( fp );\n\t\t\treturn NULL;\n\t\t}\n\t}\n\tmy_pclose( fp );\n\tif( ! read_something ) {\n\t\tdprintf( D_ALWAYS, \"\\\"%s -classad\\\" did not produce any output, \"\n\t\t\t\t \"ignoring\\n\", path ); \n\t\tdelete( ad );\n\t\treturn NULL;\n\t}\n\tnew_shadow = new Shadow( path, ad );\n\treturn new_shadow;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"rsys\/common.h\"\n#include \"rsys\/host.h\"\n#include \"rsys\/vdriver.h\"\n#include \"rsys\/cquick.h\" \/* for ROMlib_log2 *\/\n#include \"rsys\/adb.h\"\n#include \"rsys\/osevent.h\"\n#include \"rsys\/scrap.h\"\n#include \"rsys\/keyboard.h\"\n#include \"OSEvent.h\"\n#include \"ToolboxEvent.h\"\n#include \"SegmentLdr.h\"\n#include \"ScrapMgr.h\"\n\n#include \"keycode_map.h\"\n\n#include <SDL.h>\n\nnamespace Executor\n{\n\/* These variables are required by the vdriver interface. *\/\nuint8_t *vdriver_fbuf;\nint vdriver_row_bytes;\nint vdriver_width = 1024;\nint vdriver_height = 768;\nint vdriver_bpp = 8, vdriver_log2_bpp;\nint vdriver_max_bpp, vdriver_log2_max_bpp;\nvdriver_modes_t *vdriver_mode_list;\n\nint host_cursor_depth = 1;\n}\n\nusing namespace Executor;\n\nnamespace\n{\nvdriver_modes_t sdl_impotent_modes = { 0, 0 };\nSDL_Window *sdlWindow;\nSDL_Renderer *sdlRenderer;\nSDL_Texture *sdlTexture;\nSDL_Surface *sdlSurface;\n}\n\nvoid Executor::vdriver_opt_register(void)\n{\n}\nbool Executor::vdriver_init(int _max_width, int _max_height, int _max_bpp,\n                            bool fixed_p, int *argc, char *argv[])\n{\n    if(SDL_Init(SDL_INIT_VIDEO | SDL_INIT_EVENTS) != 0)\n    {\n        SDL_Log(\"Failed to initialize SDL: %s\", SDL_GetError());\n        return false;\n    }\n    return true;\n}\n\nbool Executor::vdriver_acceptable_mode_p(int width, int height, int bpp,\n                                         bool grayscale_p, bool exact_match_p)\n{\n    if(bpp == 1 || bpp == 4 || bpp == 8 || bpp == 16 || bpp == 32)\n        return true;\n    else\n        return false;\n}\n\nbool Executor::vdriver_set_mode(int width, int height, int bpp, bool grayscale_p)\n{\n    printf(\"set_mode: %d %d %d\", width, height, bpp);\n    if(vdriver_fbuf)\n        delete[] vdriver_fbuf;\n\n    if(width)\n        vdriver_width = width;\n    if(height)\n        vdriver_height = height;\n    if(bpp)\n        vdriver_bpp = bpp;\n    vdriver_row_bytes = vdriver_width * vdriver_bpp \/ 8;\n    vdriver_log2_bpp = ROMlib_log2[vdriver_bpp];\n    vdriver_mode_list = &sdl_impotent_modes;\n\n    vdriver_max_bpp = 8; \/\/32;\n    vdriver_log2_max_bpp = 3; \/\/5;\n\n    sdlWindow = SDL_CreateWindow(\"Window\",\n                                 SDL_WINDOWPOS_UNDEFINED,\n                                 SDL_WINDOWPOS_UNDEFINED,\n                                 vdriver_width, vdriver_height,\n                                 0);\n    \/\/SDL_WINDOW_FULLSCREEN_DESKTOP);\n\n    \/*sdlRenderer = SDL_CreateRenderer(sdlWindow, -1, 0);\n\n    SDL_RenderSetLogicalSize(sdlRenderer, vdriver_width, vdriver_height);\n    SDL_SetRenderDrawColor(sdlRenderer, 128, 128, 128, 255);\n    SDL_RenderClear(sdlRenderer);\n    SDL_RenderPresent(sdlRenderer);*\/\n\n    uint32_t pixelFormat;\n\n    switch(vdriver_bpp)\n    {\n        case 1:\n            pixelFormat = SDL_PIXELFORMAT_INDEX1LSB;\n            break;\n        case 4:\n            pixelFormat = SDL_PIXELFORMAT_INDEX4LSB;\n            break;\n        case 8:\n            pixelFormat = SDL_PIXELFORMAT_INDEX8;\n            break;\n        case 16:\n            pixelFormat = SDL_PIXELFORMAT_RGB555;\n            break;\n        case 32:\n            pixelFormat = SDL_PIXELFORMAT_BGRX8888;\n            break;\n    }\n    \/*\n    sdlTexture = SDL_CreateTexture(sdlRenderer,\n                                   \/\/SDL_PIXELTYPE_INDEX8,\n                                   \/\/SDL_PIXELFORMAT_ARGB8888,\n                                   SDL_PIXELFORMAT_BGRA8888,\n                                   SDL_TEXTUREACCESS_STREAMING,\n                                   vdriver_width, vdriver_height);\n*\/\n    vdriver_fbuf = new uint8_t[vdriver_width * vdriver_height * 4];\n\n    sdlSurface = SDL_CreateRGBSurfaceWithFormatFrom(\n        vdriver_fbuf,\n        vdriver_width, vdriver_height,\n        vdriver_bpp,\n        vdriver_row_bytes,\n        pixelFormat);\n\n    return true;\n}\nvoid Executor::vdriver_set_colors(int first_color, int num_colors, const ColorSpec *colors)\n{\n    SDL_Color *sdlColors = (SDL_Color *)alloca(sizeof(SDL_Color) * num_colors);\n    for(int i = 0; i < num_colors; i++)\n    {\n        sdlColors[i].a = 255;\n        sdlColors[i].r = CW(colors[i].rgb.red) >> 8;\n        sdlColors[i].g = CW(colors[i].rgb.green) >> 8;\n        sdlColors[i].b = CW(colors[i].rgb.blue) >> 8;\n    }\n\n    SDL_SetPaletteColors(sdlSurface->format->palette, sdlColors, first_color, num_colors);\n}\n\nvoid Executor::vdriver_get_colors(int first_color, int num_colors, ColorSpec *colors)\n{\n    SDL_Color *sdlColors = sdlSurface->format->palette->colors;\n    for(int i = 0; i < num_colors; i++)\n    {\n        SDL_Color &c = sdlColors[first_color + i];\n\n        colors[i].value = CW(first_color + i);\n        colors[i].rgb.red = CW(c.r << 8 | c.r);\n        colors[i].rgb.green = CW(c.g << 8 | c.g);\n        colors[i].rgb.blue = CW(c.b << 8 | c.b);\n    }\n}\nint Executor::vdriver_update_screen_rects(int num_rects, const vdriver_rect_t *r,\n                                          bool cursor_p)\n{\n    \/*SDL_UpdateTexture(sdlTexture, NULL, vdriver_fbuf, vdriver_row_bytes);\n    SDL_RenderCopy(sdlRenderer, sdlTexture, NULL, NULL);\n    SDL_RenderPresent(sdlRenderer);*\/\n    SDL_BlitSurface(sdlSurface, NULL, SDL_GetWindowSurface(sdlWindow), NULL);\n    SDL_UpdateWindowSurface(sdlWindow);\n}\n\nint Executor::vdriver_update_screen(int top, int left, int bottom, int right,\n                                    bool cursor_p)\n{\n    \/*SDL_UpdateTexture(sdlTexture, NULL, vdriver_fbuf, vdriver_row_bytes);\n    SDL_RenderCopy(sdlRenderer, sdlTexture, NULL, NULL);\n    SDL_RenderPresent(sdlRenderer);*\/\n    SDL_BlitSurface(sdlSurface, NULL, SDL_GetWindowSurface(sdlWindow), NULL);\n    SDL_UpdateWindowSurface(sdlWindow);\n}\n\nvoid Executor::vdriver_flush_display(void)\n{\n}\n\nvoid Executor::vdriver_shutdown(void)\n{\n}\n\nvoid Executor::host_flush_shadow_screen(void)\n{\n}\n\nstatic bool ConfirmQuit()\n{\n    const SDL_MessageBoxButtonData buttons[] = {\n        { SDL_MESSAGEBOX_BUTTON_ESCAPEKEY_DEFAULT, 2, \"Cancel\" },\n        { SDL_MESSAGEBOX_BUTTON_RETURNKEY_DEFAULT, 1, \"Force Quit\" },\n    };\n    const SDL_MessageBoxData messageboxdata = {\n        SDL_MESSAGEBOX_INFORMATION, \/* .flags *\/\n        sdlWindow, \/* .window *\/\n        \"Quit\", \/* .title *\/\n        \"Do you want to quit Executor?\", \/* .message *\/\n        SDL_arraysize(buttons), \/* .numbuttons *\/\n        buttons, \/* .buttons *\/\n        NULL \/* .colorScheme *\/\n    };\n    int buttonid;\n    SDL_ShowMessageBox(&messageboxdata, &buttonid);\n    return buttonid == 1;\n}\n\nstatic bool isModifier(unsigned char virt, uint16 *modstore)\n{\n    \/* Note: shift and control can be cleared if right* and left* are pressed *\/\n    switch(virt)\n    {\n        case MKV_LEFTSHIFT:\n        case MKV_RIGHTSHIFT:\n            *modstore = shiftKey;\n            break;\n        case MKV_CAPS:\n            *modstore = alphaLock;\n            break;\n        case MKV_LEFTCNTL:\n        case MKV_RIGHTCNTL:\n            *modstore = ControlKey;\n            break;\n        case MKV_CLOVER:\n            *modstore = cmdKey;\n            break;\n        case MKV_LEFTOPTION:\n        case MKV_RIGHTOPTION:\n            *modstore = optionKey;\n            break;\n        default:\n            *modstore = 0;\n            return false;\n    }\n    return true;\n}\n\n\n\nvoid Executor::vdriver_pump_events()\n{\n    SDL_Event event;\n    static uint16_t keymod = 0;\n\n    while(SDL_PollEvent(&event))\n    {\n        switch(event.type)\n        {\n            case SDL_MOUSEMOTION:\n                MouseLocation.h = CW(event.motion.x);\n                MouseLocation.v = CW(event.motion.y);\n\n                adb_apeiron_hack(false);\n                break;\n            case SDL_MOUSEBUTTONDOWN:\n            case SDL_MOUSEBUTTONUP:\n            {\n                bool down_p;\n                int32 when;\n                Point where;\n\n                down_p = (event.button.state == SDL_PRESSED);\n                if(down_p)\n                    keymod &= ~btnState;\n                else\n                    keymod |= btnState;\n                when = TickCount();\n                where.h = event.button.x;\n                where.v = event.button.y;\n                ROMlib_PPostEvent(down_p ? mouseDown : mouseUp,\n                                  0, (GUEST<EvQElPtr> *)0, when, where,\n                                  keymod);\n                adb_apeiron_hack(false);\n            }\n            break;\n            case SDL_KEYDOWN:\n            case SDL_KEYUP:\n            {\n                bool down_p;\n                unsigned char mkvkey;\n                uint16 mod;\n                LONGINT keywhat;\n                int32 when;\n                Point where;\n\n                init_sdlk_to_mkv();\n                down_p = (event.key.state == SDL_PRESSED);\n\n                \/*if(use_scan_codes)\n                    mkvkey = ibm_virt_to_mac_virt[event.key.keysym.scancode];\n                else*\/\n                {\n                    auto p = sdlk_to_mkv.find(event.key.keysym.sym);\n                    if(p == sdlk_to_mkv.end())\n                        mkvkey = NOTAKEY;\n                    else\n                        mkvkey = p->second;\n                }\n                mkvkey = ROMlib_right_to_left_key_map(mkvkey);\n                if(isModifier(mkvkey, &mod))\n                {\n                    if(down_p)\n                        keymod |= mod;\n                    else\n                        keymod &= ~mod;\n                }\n                when = TickCount();\n                where.h = CW(MouseLocation.h);\n                where.v = CW(MouseLocation.v);\n                keywhat = ROMlib_xlate(mkvkey, keymod, down_p);\n                post_keytrans_key_events(down_p ? keyDown : keyUp,\n                                         keywhat, when, where,\n                                         keymod, mkvkey);\n            }\n            break;\n            case SDL_WINDOWEVENT_FOCUS_GAINED:\n                \/\/if(!we_lost_clipboard())\n                    sendresumeevent(false);\n                \/\/else\n                \/\/{\n                \/\/    ZeroScrap();\n                \/\/    sendresumeevent(true);\n                \/\/}\n                break;\n            case SDL_WINDOWEVENT_FOCUS_LOST:\n                sendsuspendevent();\n                break;\n            case SDL_QUIT:\n                if(ConfirmQuit())\n                    ExitToShell();\n                break;\n        }\n    }\n}\n\nextern \"C\" void\nROMlib_SetTitle(char *title)\n{\n}\n\nextern \"C\" char *\nROMlib_GetTitle(void)\n{\n    static char str[] = \"Foo\";\n    return str;\n}\n\nextern \"C\" void\nROMlib_FreeTitle(char *title)\n{\n}\n\n\/* This is really inefficient.  We should hash the cursors *\/\nvoid Executor::host_set_cursor(char *cursor_data,\n                               unsigned short cursor_mask[16],\n                               int hotspot_x, int hotspot_y)\n{\n    SDL_Cursor *old_cursor, *new_cursor;\n\n    old_cursor = SDL_GetCursor();\n    new_cursor = SDL_CreateCursor((unsigned char *)cursor_data,\n                                  (unsigned char *)cursor_mask,\n                                  16, 16, hotspot_x, hotspot_y);\n    if(new_cursor != NULL)\n    {\n        SDL_SetCursor(new_cursor);\n        SDL_FreeCursor(old_cursor);\n    }\n}\n\nint Executor::host_set_cursor_visible(int show_p)\n{\n    return (SDL_ShowCursor(show_p));\n}\n<commit_msg>sdl2: there are no other bit depths<commit_after>#include \"rsys\/common.h\"\n#include \"rsys\/host.h\"\n#include \"rsys\/vdriver.h\"\n#include \"rsys\/cquick.h\" \/* for ROMlib_log2 *\/\n#include \"rsys\/adb.h\"\n#include \"rsys\/osevent.h\"\n#include \"rsys\/scrap.h\"\n#include \"rsys\/keyboard.h\"\n#include \"OSEvent.h\"\n#include \"ToolboxEvent.h\"\n#include \"SegmentLdr.h\"\n#include \"ScrapMgr.h\"\n\n#include \"keycode_map.h\"\n\n#include <SDL.h>\n\nnamespace Executor\n{\n\/* These variables are required by the vdriver interface. *\/\nuint8_t *vdriver_fbuf;\nint vdriver_row_bytes;\nint vdriver_width = 1024;\nint vdriver_height = 768;\nint vdriver_bpp = 8, vdriver_log2_bpp;\nint vdriver_max_bpp, vdriver_log2_max_bpp;\nvdriver_modes_t *vdriver_mode_list;\n\nint host_cursor_depth = 1;\n}\n\nusing namespace Executor;\n\nnamespace\n{\nvdriver_modes_t sdl_impotent_modes = { 0, 0 };\nSDL_Window *sdlWindow;\nSDL_Renderer *sdlRenderer;\nSDL_Texture *sdlTexture;\nSDL_Surface *sdlSurface;\n}\n\nvoid Executor::vdriver_opt_register(void)\n{\n}\nbool Executor::vdriver_init(int _max_width, int _max_height, int _max_bpp,\n                            bool fixed_p, int *argc, char *argv[])\n{\n    if(SDL_Init(SDL_INIT_VIDEO | SDL_INIT_EVENTS) != 0)\n    {\n        SDL_Log(\"Failed to initialize SDL: %s\", SDL_GetError());\n        return false;\n    }\n    return true;\n}\n\nbool Executor::vdriver_acceptable_mode_p(int width, int height, int bpp,\n                                         bool grayscale_p, bool exact_match_p)\n{\n    if(bpp == 1 || bpp == 4 || bpp == 8 || bpp == 16 || bpp == 32)\n        return true;\n    else\n        return false;\n}\n\nbool Executor::vdriver_set_mode(int width, int height, int bpp, bool grayscale_p)\n{\n    printf(\"set_mode: %d %d %d\", width, height, bpp);\n    if(vdriver_fbuf)\n        delete[] vdriver_fbuf;\n\n    if(width)\n        vdriver_width = width;\n    if(height)\n        vdriver_height = height;\n    if(bpp)\n        vdriver_bpp = bpp;\n    vdriver_row_bytes = vdriver_width * vdriver_bpp \/ 8;\n    vdriver_log2_bpp = ROMlib_log2[vdriver_bpp];\n    vdriver_mode_list = &sdl_impotent_modes;\n\n    vdriver_max_bpp = 8; \/\/32;\n    vdriver_log2_max_bpp = 3; \/\/5;\n\n    sdlWindow = SDL_CreateWindow(\"Window\",\n                                 SDL_WINDOWPOS_UNDEFINED,\n                                 SDL_WINDOWPOS_UNDEFINED,\n                                 vdriver_width, vdriver_height,\n                                 0);\n    \/\/SDL_WINDOW_FULLSCREEN_DESKTOP);\n\n    \/*sdlRenderer = SDL_CreateRenderer(sdlWindow, -1, 0);\n\n    SDL_RenderSetLogicalSize(sdlRenderer, vdriver_width, vdriver_height);\n    SDL_SetRenderDrawColor(sdlRenderer, 128, 128, 128, 255);\n    SDL_RenderClear(sdlRenderer);\n    SDL_RenderPresent(sdlRenderer);*\/\n\n    uint32_t pixelFormat;\n\n    switch(vdriver_bpp)\n    {\n        case 1:\n            pixelFormat = SDL_PIXELFORMAT_INDEX1LSB;\n            break;\n        case 4:\n            pixelFormat = SDL_PIXELFORMAT_INDEX4LSB;\n            break;\n        case 8:\n            pixelFormat = SDL_PIXELFORMAT_INDEX8;\n            break;\n        case 16:\n            pixelFormat = SDL_PIXELFORMAT_RGB555;\n            break;\n        case 32:\n            pixelFormat = SDL_PIXELFORMAT_BGRX8888;\n            break;\n        default:\n            std::abort();\n    }\n    \n    vdriver_fbuf = new uint8_t[vdriver_width * vdriver_height * 4];\n\n    sdlSurface = SDL_CreateRGBSurfaceWithFormatFrom(\n        vdriver_fbuf,\n        vdriver_width, vdriver_height,\n        vdriver_bpp,\n        vdriver_row_bytes,\n        pixelFormat);\n\n    return true;\n}\nvoid Executor::vdriver_set_colors(int first_color, int num_colors, const ColorSpec *colors)\n{\n    SDL_Color *sdlColors = (SDL_Color *)alloca(sizeof(SDL_Color) * num_colors);\n    for(int i = 0; i < num_colors; i++)\n    {\n        sdlColors[i].a = 255;\n        sdlColors[i].r = CW(colors[i].rgb.red) >> 8;\n        sdlColors[i].g = CW(colors[i].rgb.green) >> 8;\n        sdlColors[i].b = CW(colors[i].rgb.blue) >> 8;\n    }\n\n    SDL_SetPaletteColors(sdlSurface->format->palette, sdlColors, first_color, num_colors);\n}\n\nvoid Executor::vdriver_get_colors(int first_color, int num_colors, ColorSpec *colors)\n{\n    SDL_Color *sdlColors = sdlSurface->format->palette->colors;\n    for(int i = 0; i < num_colors; i++)\n    {\n        SDL_Color &c = sdlColors[first_color + i];\n\n        colors[i].value = CW(first_color + i);\n        colors[i].rgb.red = CW(c.r << 8 | c.r);\n        colors[i].rgb.green = CW(c.g << 8 | c.g);\n        colors[i].rgb.blue = CW(c.b << 8 | c.b);\n    }\n}\nint Executor::vdriver_update_screen_rects(int num_rects, const vdriver_rect_t *r,\n                                          bool cursor_p)\n{\n    \/*SDL_UpdateTexture(sdlTexture, NULL, vdriver_fbuf, vdriver_row_bytes);\n    SDL_RenderCopy(sdlRenderer, sdlTexture, NULL, NULL);\n    SDL_RenderPresent(sdlRenderer);*\/\n    SDL_BlitSurface(sdlSurface, NULL, SDL_GetWindowSurface(sdlWindow), NULL);\n    SDL_UpdateWindowSurface(sdlWindow);\n}\n\nint Executor::vdriver_update_screen(int top, int left, int bottom, int right,\n                                    bool cursor_p)\n{\n    \/*SDL_UpdateTexture(sdlTexture, NULL, vdriver_fbuf, vdriver_row_bytes);\n    SDL_RenderCopy(sdlRenderer, sdlTexture, NULL, NULL);\n    SDL_RenderPresent(sdlRenderer);*\/\n    SDL_BlitSurface(sdlSurface, NULL, SDL_GetWindowSurface(sdlWindow), NULL);\n    SDL_UpdateWindowSurface(sdlWindow);\n}\n\nvoid Executor::vdriver_flush_display(void)\n{\n}\n\nvoid Executor::vdriver_shutdown(void)\n{\n}\n\nvoid Executor::host_flush_shadow_screen(void)\n{\n}\n\nstatic bool ConfirmQuit()\n{\n    const SDL_MessageBoxButtonData buttons[] = {\n        { SDL_MESSAGEBOX_BUTTON_ESCAPEKEY_DEFAULT, 2, \"Cancel\" },\n        { SDL_MESSAGEBOX_BUTTON_RETURNKEY_DEFAULT, 1, \"Force Quit\" },\n    };\n    const SDL_MessageBoxData messageboxdata = {\n        SDL_MESSAGEBOX_INFORMATION, \/* .flags *\/\n        sdlWindow, \/* .window *\/\n        \"Quit\", \/* .title *\/\n        \"Do you want to quit Executor?\", \/* .message *\/\n        SDL_arraysize(buttons), \/* .numbuttons *\/\n        buttons, \/* .buttons *\/\n        NULL \/* .colorScheme *\/\n    };\n    int buttonid;\n    SDL_ShowMessageBox(&messageboxdata, &buttonid);\n    return buttonid == 1;\n}\n\nstatic bool isModifier(unsigned char virt, uint16 *modstore)\n{\n    \/* Note: shift and control can be cleared if right* and left* are pressed *\/\n    switch(virt)\n    {\n        case MKV_LEFTSHIFT:\n        case MKV_RIGHTSHIFT:\n            *modstore = shiftKey;\n            break;\n        case MKV_CAPS:\n            *modstore = alphaLock;\n            break;\n        case MKV_LEFTCNTL:\n        case MKV_RIGHTCNTL:\n            *modstore = ControlKey;\n            break;\n        case MKV_CLOVER:\n            *modstore = cmdKey;\n            break;\n        case MKV_LEFTOPTION:\n        case MKV_RIGHTOPTION:\n            *modstore = optionKey;\n            break;\n        default:\n            *modstore = 0;\n            return false;\n    }\n    return true;\n}\n\n\n\nvoid Executor::vdriver_pump_events()\n{\n    SDL_Event event;\n    static uint16_t keymod = 0;\n\n    while(SDL_PollEvent(&event))\n    {\n        switch(event.type)\n        {\n            case SDL_MOUSEMOTION:\n                MouseLocation.h = CW(event.motion.x);\n                MouseLocation.v = CW(event.motion.y);\n\n                adb_apeiron_hack(false);\n                break;\n            case SDL_MOUSEBUTTONDOWN:\n            case SDL_MOUSEBUTTONUP:\n            {\n                bool down_p;\n                int32 when;\n                Point where;\n\n                down_p = (event.button.state == SDL_PRESSED);\n                if(down_p)\n                    keymod &= ~btnState;\n                else\n                    keymod |= btnState;\n                when = TickCount();\n                where.h = event.button.x;\n                where.v = event.button.y;\n                ROMlib_PPostEvent(down_p ? mouseDown : mouseUp,\n                                  0, (GUEST<EvQElPtr> *)0, when, where,\n                                  keymod);\n                adb_apeiron_hack(false);\n            }\n            break;\n            case SDL_KEYDOWN:\n            case SDL_KEYUP:\n            {\n                bool down_p;\n                unsigned char mkvkey;\n                uint16 mod;\n                LONGINT keywhat;\n                int32 when;\n                Point where;\n\n                init_sdlk_to_mkv();\n                down_p = (event.key.state == SDL_PRESSED);\n\n                \/*if(use_scan_codes)\n                    mkvkey = ibm_virt_to_mac_virt[event.key.keysym.scancode];\n                else*\/\n                {\n                    auto p = sdlk_to_mkv.find(event.key.keysym.sym);\n                    if(p == sdlk_to_mkv.end())\n                        mkvkey = NOTAKEY;\n                    else\n                        mkvkey = p->second;\n                }\n                mkvkey = ROMlib_right_to_left_key_map(mkvkey);\n                if(isModifier(mkvkey, &mod))\n                {\n                    if(down_p)\n                        keymod |= mod;\n                    else\n                        keymod &= ~mod;\n                }\n                when = TickCount();\n                where.h = CW(MouseLocation.h);\n                where.v = CW(MouseLocation.v);\n                keywhat = ROMlib_xlate(mkvkey, keymod, down_p);\n                post_keytrans_key_events(down_p ? keyDown : keyUp,\n                                         keywhat, when, where,\n                                         keymod, mkvkey);\n            }\n            break;\n            case SDL_WINDOWEVENT_FOCUS_GAINED:\n                \/\/if(!we_lost_clipboard())\n                    sendresumeevent(false);\n                \/\/else\n                \/\/{\n                \/\/    ZeroScrap();\n                \/\/    sendresumeevent(true);\n                \/\/}\n                break;\n            case SDL_WINDOWEVENT_FOCUS_LOST:\n                sendsuspendevent();\n                break;\n            case SDL_QUIT:\n                if(ConfirmQuit())\n                    ExitToShell();\n                break;\n        }\n    }\n}\n\nextern \"C\" void\nROMlib_SetTitle(char *title)\n{\n}\n\nextern \"C\" char *\nROMlib_GetTitle(void)\n{\n    static char str[] = \"Foo\";\n    return str;\n}\n\nextern \"C\" void\nROMlib_FreeTitle(char *title)\n{\n}\n\n\/* This is really inefficient.  We should hash the cursors *\/\nvoid Executor::host_set_cursor(char *cursor_data,\n                               unsigned short cursor_mask[16],\n                               int hotspot_x, int hotspot_y)\n{\n    SDL_Cursor *old_cursor, *new_cursor;\n\n    old_cursor = SDL_GetCursor();\n    new_cursor = SDL_CreateCursor((unsigned char *)cursor_data,\n                                  (unsigned char *)cursor_mask,\n                                  16, 16, hotspot_x, hotspot_y);\n    if(new_cursor != NULL)\n    {\n        SDL_SetCursor(new_cursor);\n        SDL_FreeCursor(old_cursor);\n    }\n}\n\nint Executor::host_set_cursor_visible(int show_p)\n{\n    return (SDL_ShowCursor(show_p));\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * TemplateComponent.hpp\n *\n *  Created on: Jan 23, 2014\n *      Author: gwue\n *\/\n\n#ifndef TEMPLATECOMPONENT_HPP_\n#define TEMPLATECOMPONENT_HPP_\n\n#include <sstream>\n#include <climits>\n\/\/ necessary includes\n#include <Synthesizer.h>\n#include <SoundComponentImpl.h>\n#include <SoundPort.h>\n#include <ControlPort.h>\n\n\/\/ Implementation independant base class for some sound component\nclass TemplateSoundComponent: public SoundComponentImpl\n{\n\npublic:\n\tfloat val;\n\n\t\/\/ REQUIRED: This macro creates a name field.\n\tDECLARE_COMPONENTNAME\n\n\t\/\/ Add ports like this:\n\t\/\/ DECLARE_PORT3(<Type>, <Name>, <Portnumber>)\n\t\/\/ DECLARE_PORT, and DECLARE_PORT2 exist as well, but you shouldn't use them (legacy format)\n\t\/\/ <Type> = SoundPort or ControlPort\n\t\/\/ <Name> = Can be chosen arbitrarily\n\t\/\/ <Portnumber> = \tShould start at 1 and have no gaps ( 1,2,3,...,n)\n\t\/\/\t\t\t\t\tIn- and Outports have seperate numberings, but Control and Sound Ports share it\n\t\/\/\t\t\t\t\ti.e.: One input sound, one input control and one output sound could look like this:\n\t\/\/\t\t\t\t\t(SoundPort, SoundIn, 1), (ControlPort, ControlIn, 2), (SoundPort, SoundOut, 1)\n\t\/\/\n\t\/\/ The actual instantiation will happen in the .cpp file, you need the values you specify here there again.\n\t\/\/\n\t\/\/ The declared port will be called: m_<name>_<Portnumber>_Port\n\tDECLARE_PORT3(ControlPort, TemplateControlIn, 1);\n\tDECLARE_PORT3(ControlPort, TemplateControlOut, 1);\n\tDECLARE_PORT3(SoundPort, TemplateSoundIn, 2);\n\tDECLARE_PORT3(SoundPort, TemplateSoundOut, 2);\n\n\t\/\/ Constructor that has a parameter vector (also use this if the component has no parameters -> empty vector)\n\tTemplateSoundComponent(std::vector<std::string> params);\n\tvirtual ~TemplateSoundComponent();\n\n\t\/\/ Initialization that is common regardless of SW\/HW\n\tvirtual void init(void);\n\n\t\/\/ Were the actual processing happens\n\t\/\/ Will usually be implemented in the SW\/HW subclasses\n\tvirtual void process(void) = 0;\n\n};\n\n\/\/ This class implements a callback function that is called when a control value changes.\n\/\/ Needs to be registered in the init() method.\nclass OnChange : public ICallbackFunctor {\nprivate:\n    TemplateSoundComponent& m_ObjRef;\npublic:\n    OnChange(TemplateSoundComponent& ref ) : m_ObjRef(ref){ }\n\n    void operator()(){\n    \t\/\/ The first new control value can be accessed like this.\n    \tfloat val = m_ObjRef.m_TemplateControlIn_1_Port->pop();\n        m_ObjRef.val = val;\n    }\n};\n\n#endif \/* TEMPLATECOMPONENT_HPP_ *\/\n<commit_msg>Extended template description<commit_after>\/*\n * TemplateComponent.hpp\n *\n *  Created on: Jan 23, 2014\n *      Author: gwue\n *\/\n\n#ifndef TEMPLATECOMPONENT_HPP_\n#define TEMPLATECOMPONENT_HPP_\n\n#include <sstream>\n#include <climits>\n\/\/ necessary includes\n#include <Synthesizer.h>\n#include <SoundComponentImpl.h>\n#include <SoundPort.h>\n#include <ControlPort.h>\n\n\/\/ Implementation independant base class for some sound component\nclass TemplateSoundComponent: public SoundComponentImpl\n{\n\npublic:\n\tfloat val;\n\n\t\/\/ REQUIRED: This macro creates a name field.\n\tDECLARE_COMPONENTNAME\n\n\t\/\/ Add ports like this:\n\t\/\/ DECLARE_PORT3(<Type>, <Name>, <Portnumber>)\n\t\/\/ DECLARE_PORT, and DECLARE_PORT2 exist as well, but you shouldn't use them (legacy format)\n\t\/\/ <Type> = SoundPort or ControlPort\n\t\/\/ <Name> = Can be chosen arbitrarily\n\t\/\/ <Portnumber> = \tShould start at 1 and have no gaps ( 1,2,3,...,n)\n\t\/\/\t\t\t\t\tIn- and Outports have seperate numberings, but Control and Sound Ports share it\n\t\/\/\t\t\t\t\ti.e.: One input sound, one input control and one output sound could look like this:\n\t\/\/\t\t\t\t\t(SoundPort, SoundIn, 1), (ControlPort, ControlIn, 2), (SoundPort, SoundOut, 1)\n\t\/\/\n\t\/\/ The actual instantiation will happen in the .cpp file, you need the values you specify here there again.\n\t\/\/\n\t\/\/ The declared port will be called: m_<name>_<Portnumber>_Port\n\tDECLARE_PORT3(ControlPort, TemplateControlIn, 1);\n\tDECLARE_PORT3(ControlPort, TemplateControlOut, 1);\n\tDECLARE_PORT3(SoundPort, TemplateSoundIn, 2);\n\tDECLARE_PORT3(SoundPort, TemplateSoundOut, 2);\n\n\t\/\/ Constructor that has a parameter vector (also use this if the component has no parameters -> empty vector)\n\tTemplateSoundComponent(std::vector<std::string> params);\n\tvirtual ~TemplateSoundComponent();\n\n\t\/\/ Initialization that is common regardless of SW\/HW\n\tvirtual void init(void);\n\n\t\/\/ Were the actual processing happens\n\t\/\/ Will usually be implemented in the SW\/HW subclasses\n\tvirtual void process(void) = 0;\n\n};\n\n\/\/ This class implements a callback function that is called when a control value changes.\n\/\/ Always access control values like this (i.e. only when they change) and cache them inside the component if needed.\n\/\/ Never access them periodically in the process method.\n\/\/\n\/\/ This handler needs to be registered in the init() method.\nclass OnChange : public ICallbackFunctor {\nprivate:\n    TemplateSoundComponent& m_ObjRef;\npublic:\n    OnChange(TemplateSoundComponent& ref ) : m_ObjRef(ref){ }\n\n    void operator()(){\n    \t\/\/ The first new control value can be accessed like this.\n    \tfloat val = m_ObjRef.m_TemplateControlIn_1_Port->pop();\n        m_ObjRef.val = val;\n    }\n};\n\n#endif \/* TEMPLATECOMPONENT_HPP_ *\/\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 \"SkBitmap.h\"\n#include \"SkErrorInternals.h\"\n#include \"SkValidatingReadBuffer.h\"\n#include \"SkStream.h\"\n#include \"SkTypeface.h\"\n\nSkValidatingReadBuffer::SkValidatingReadBuffer(const void* data, size_t size) :\n    fError(false) {\n    this->setMemory(data, size);\n    this->setFlags(SkFlattenableReadBuffer::kValidation_Flag);\n}\n\nSkValidatingReadBuffer::~SkValidatingReadBuffer() {\n}\n\nbool SkValidatingReadBuffer::validate(bool isValid) {\n    if (!fError && !isValid) {\n        \/\/ When an error is found, send the read cursor to the end of the stream\n        fReader.skip(fReader.available());\n        fError = true;\n    }\n    return !fError;\n}\n\nvoid SkValidatingReadBuffer::setMemory(const void* data, size_t size) {\n    this->validate(IsPtrAlign4(data) && (SkAlign4(size) == size));\n    if (!fError) {\n        fReader.setMemory(data, size);\n    }\n}\n\nconst void* SkValidatingReadBuffer::skip(size_t size) {\n    size_t inc = SkAlign4(size);\n    const void* addr = fReader.peek();\n    this->validate(IsPtrAlign4(addr) && fReader.isAvailable(inc));\n    if (!fError) {\n        fReader.skip(size);\n    }\n    return addr;\n}\n\n\/\/ All the methods in this file funnel down into either readInt(), readScalar() or skip(),\n\/\/ followed by a memcpy. So we've got all our validation in readInt(), readScalar() and skip();\n\/\/ if they fail they'll return a zero value or skip nothing, respectively, and set fError to\n\/\/ true, which the caller should check to see if an error occurred during the read operation.\n\nbool SkValidatingReadBuffer::readBool() {\n    uint32_t value = this->readInt();\n    \/\/ Boolean value should be either 0 or 1\n    this->validate(!(value & ~1));\n    return value != 0;\n}\n\nSkColor SkValidatingReadBuffer::readColor() {\n    return this->readInt();\n}\n\nSkFixed SkValidatingReadBuffer::readFixed() {\n    return this->readInt();\n}\n\nint32_t SkValidatingReadBuffer::readInt() {\n    const size_t inc = sizeof(int32_t);\n    this->validate(IsPtrAlign4(fReader.peek()) && fReader.isAvailable(inc));\n    return fError ? 0 : fReader.readInt();\n}\n\nSkScalar SkValidatingReadBuffer::readScalar() {\n    const size_t inc = sizeof(SkScalar);\n    this->validate(IsPtrAlign4(fReader.peek()) && fReader.isAvailable(inc));\n    return fError ? 0 : fReader.readScalar();\n}\n\nuint32_t SkValidatingReadBuffer::readUInt() {\n    return this->readInt();\n}\n\nint32_t SkValidatingReadBuffer::read32() {\n    return this->readInt();\n}\n\nvoid SkValidatingReadBuffer::readString(SkString* string) {\n    const size_t len = this->readInt();\n    const void* ptr = fReader.peek();\n    const char* cptr = (const char*)ptr;\n\n    \/\/ skip over the string + '\\0' and then pad to a multiple of 4\n    const size_t alignedSize = SkAlign4(len + 1);\n    this->skip(alignedSize);\n    this->validate(cptr[len] == '\\0');\n    if (!fError) {\n        string->set(cptr, len);\n    }\n}\n\nvoid* SkValidatingReadBuffer::readEncodedString(size_t* length, SkPaint::TextEncoding encoding) {\n    const int32_t encodingType = fReader.readInt();\n    this->validate(encodingType == encoding);\n    *length = this->readInt();\n    const void* ptr = this->skip(SkAlign4(*length));\n    void* data = NULL;\n    if (!fError) {\n        data = sk_malloc_throw(*length);\n        memcpy(data, ptr, *length);\n    }\n    return data;\n}\n\nvoid SkValidatingReadBuffer::readPoint(SkPoint* point) {\n    point->fX = fReader.readScalar();\n    point->fY = fReader.readScalar();\n}\n\nvoid SkValidatingReadBuffer::readMatrix(SkMatrix* matrix) {\n    size_t size = 0;\n    if (!fError) {\n        size = matrix->readFromMemory(fReader.peek(), fReader.available());\n        this->validate((SkAlign4(size) == size) && (0 != size));\n    }\n    if (!fError) {\n        (void)this->skip(size);\n    }\n}\n\nvoid SkValidatingReadBuffer::readIRect(SkIRect* rect) {\n    const void* ptr = this->skip(sizeof(SkIRect));\n    if (!fError) {\n        memcpy(rect, ptr, sizeof(SkIRect));\n    }\n}\n\nvoid SkValidatingReadBuffer::readRect(SkRect* rect) {\n    const void* ptr = this->skip(sizeof(SkRect));\n    if (!fError) {\n        memcpy(rect, ptr, sizeof(SkRect));\n    }\n}\n\nvoid SkValidatingReadBuffer::readRegion(SkRegion* region) {\n    size_t size = 0;\n    if (!fError) {\n        size = region->readFromMemory(fReader.peek(), fReader.available());\n        this->validate((SkAlign4(size) == size) && (0 != size));\n    }\n    if (!fError) {\n        (void)this->skip(size);\n    }\n}\n\nvoid SkValidatingReadBuffer::readPath(SkPath* path) {\n    size_t size = 0;\n    if (!fError) {\n        size = path->readFromMemory(fReader.peek(), fReader.available());\n        this->validate((SkAlign4(size) == size) && (0 != size));\n    }\n    if (!fError) {\n        (void)this->skip(size);\n    }\n}\n\nbool SkValidatingReadBuffer::readArray(void* value, size_t size, size_t elementSize) {\n    const uint32_t count = this->getArrayCount();\n    this->validate(size == count);\n    (void)this->skip(sizeof(uint32_t)); \/\/ Skip array count\n    const size_t byteLength = count * elementSize;\n    const void* ptr = this->skip(SkAlign4(byteLength));\n    if (!fError) {\n        memcpy(value, ptr, byteLength);\n        return true;\n    }\n    return false;\n}\n\nbool SkValidatingReadBuffer::readByteArray(void* value, size_t size) {\n    return readArray(static_cast<unsigned char*>(value), size, sizeof(unsigned char));\n}\n\nbool SkValidatingReadBuffer::readColorArray(SkColor* colors, size_t size) {\n    return readArray(colors, size, sizeof(SkColor));\n}\n\nbool SkValidatingReadBuffer::readIntArray(int32_t* values, size_t size) {\n    return readArray(values, size, sizeof(int32_t));\n}\n\nbool SkValidatingReadBuffer::readPointArray(SkPoint* points, size_t size) {\n    return readArray(points, size, sizeof(SkPoint));\n}\n\nbool SkValidatingReadBuffer::readScalarArray(SkScalar* values, size_t size) {\n    return readArray(values, size, sizeof(SkScalar));\n}\n\nuint32_t SkValidatingReadBuffer::getArrayCount() {\n    const size_t inc = sizeof(uint32_t);\n    fError = fError || !IsPtrAlign4(fReader.peek()) || !fReader.isAvailable(inc);\n    return *(uint32_t*)fReader.peek();\n}\n\nvoid SkValidatingReadBuffer::readBitmap(SkBitmap* bitmap) {\n    const int width = this->readInt();\n    const int height = this->readInt();\n    const size_t length = this->readUInt();\n    \/\/ A size of zero means the SkBitmap was simply flattened.\n    this->validate(length == 0);\n    if (fError) {\n        return;\n    }\n    bitmap->unflatten(*this);\n    this->validate((bitmap->width() == width) && (bitmap->height() == height));\n}\n\nSkTypeface* SkValidatingReadBuffer::readTypeface() {\n    \/\/ TODO: Implement this (securely) when needed\n    return NULL;\n}\n\nSkFlattenable* SkValidatingReadBuffer::readFlattenable(SkFlattenable::Type type) {\n    SkString name;\n    this->readString(&name);\n    if (fError) {\n        return NULL;\n    }\n\n    \/\/ Is this the type we wanted ?\n    const char* cname = name.c_str();\n    SkFlattenable::Type baseType;\n    if (!SkFlattenable::NameToType(cname, &baseType) || (baseType != type)) {\n        return NULL;\n    }\n\n    SkFlattenable::Factory factory = SkFlattenable::NameToFactory(cname);\n    if (NULL == factory) {\n        return NULL; \/\/ writer failed to give us the flattenable\n    }\n\n    \/\/ if we get here, factory may still be null, but if that is the case, the\n    \/\/ failure was ours, not the writer.\n    SkFlattenable* obj = NULL;\n    uint32_t sizeRecorded = this->readUInt();\n    if (factory) {\n        uint32_t offset = fReader.offset();\n        obj = (*factory)(*this);\n        \/\/ check that we read the amount we expected\n        uint32_t sizeRead = fReader.offset() - offset;\n        this->validate(sizeRecorded == sizeRead);\n        if (fError) {\n            \/\/ we could try to fix up the offset...\n            delete obj;\n            obj = NULL;\n        }\n    } else {\n        \/\/ we must skip the remaining data\n        this->skip(sizeRecorded);\n        SkASSERT(false);\n    }\n    return obj;\n}\n<commit_msg>Fixing issues found by fuzzer<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 \"SkBitmap.h\"\n#include \"SkErrorInternals.h\"\n#include \"SkValidatingReadBuffer.h\"\n#include \"SkStream.h\"\n#include \"SkTypeface.h\"\n\nSkValidatingReadBuffer::SkValidatingReadBuffer(const void* data, size_t size) :\n    fError(false) {\n    this->setMemory(data, size);\n    this->setFlags(SkFlattenableReadBuffer::kValidation_Flag);\n}\n\nSkValidatingReadBuffer::~SkValidatingReadBuffer() {\n}\n\nbool SkValidatingReadBuffer::validate(bool isValid) {\n    if (!fError && !isValid) {\n        \/\/ When an error is found, send the read cursor to the end of the stream\n        fReader.skip(fReader.available());\n        fError = true;\n    }\n    return !fError;\n}\n\nvoid SkValidatingReadBuffer::setMemory(const void* data, size_t size) {\n    this->validate(IsPtrAlign4(data) && (SkAlign4(size) == size));\n    if (!fError) {\n        fReader.setMemory(data, size);\n    }\n}\n\nconst void* SkValidatingReadBuffer::skip(size_t size) {\n    size_t inc = SkAlign4(size);\n    const void* addr = fReader.peek();\n    this->validate(IsPtrAlign4(addr) && fReader.isAvailable(inc));\n    if (!fError) {\n        fReader.skip(size);\n    }\n    return addr;\n}\n\n\/\/ All the methods in this file funnel down into either readInt(), readScalar() or skip(),\n\/\/ followed by a memcpy. So we've got all our validation in readInt(), readScalar() and skip();\n\/\/ if they fail they'll return a zero value or skip nothing, respectively, and set fError to\n\/\/ true, which the caller should check to see if an error occurred during the read operation.\n\nbool SkValidatingReadBuffer::readBool() {\n    uint32_t value = this->readInt();\n    \/\/ Boolean value should be either 0 or 1\n    this->validate(!(value & ~1));\n    return value != 0;\n}\n\nSkColor SkValidatingReadBuffer::readColor() {\n    return this->readInt();\n}\n\nSkFixed SkValidatingReadBuffer::readFixed() {\n    return this->readInt();\n}\n\nint32_t SkValidatingReadBuffer::readInt() {\n    const size_t inc = sizeof(int32_t);\n    this->validate(IsPtrAlign4(fReader.peek()) && fReader.isAvailable(inc));\n    return fError ? 0 : fReader.readInt();\n}\n\nSkScalar SkValidatingReadBuffer::readScalar() {\n    const size_t inc = sizeof(SkScalar);\n    this->validate(IsPtrAlign4(fReader.peek()) && fReader.isAvailable(inc));\n    return fError ? 0 : fReader.readScalar();\n}\n\nuint32_t SkValidatingReadBuffer::readUInt() {\n    return this->readInt();\n}\n\nint32_t SkValidatingReadBuffer::read32() {\n    return this->readInt();\n}\n\nvoid SkValidatingReadBuffer::readString(SkString* string) {\n    const size_t len = this->readInt();\n    const void* ptr = fReader.peek();\n    const char* cptr = (const char*)ptr;\n\n    \/\/ skip over the string + '\\0' and then pad to a multiple of 4\n    const size_t alignedSize = SkAlign4(len + 1);\n    this->skip(alignedSize);\n    if (!fError) {\n        this->validate(cptr[len] == '\\0');\n    }\n    if (!fError) {\n        string->set(cptr, len);\n    }\n}\n\nvoid* SkValidatingReadBuffer::readEncodedString(size_t* length, SkPaint::TextEncoding encoding) {\n    const int32_t encodingType = this->readInt();\n    this->validate(encodingType == encoding);\n    *length = this->readInt();\n    const void* ptr = this->skip(SkAlign4(*length));\n    void* data = NULL;\n    if (!fError) {\n        data = sk_malloc_throw(*length);\n        memcpy(data, ptr, *length);\n    }\n    return data;\n}\n\nvoid SkValidatingReadBuffer::readPoint(SkPoint* point) {\n    point->fX = this->readScalar();\n    point->fY = this->readScalar();\n}\n\nvoid SkValidatingReadBuffer::readMatrix(SkMatrix* matrix) {\n    size_t size = 0;\n    if (!fError) {\n        size = matrix->readFromMemory(fReader.peek(), fReader.available());\n        this->validate((SkAlign4(size) == size) && (0 != size));\n    }\n    if (!fError) {\n        (void)this->skip(size);\n    }\n}\n\nvoid SkValidatingReadBuffer::readIRect(SkIRect* rect) {\n    const void* ptr = this->skip(sizeof(SkIRect));\n    if (!fError) {\n        memcpy(rect, ptr, sizeof(SkIRect));\n    }\n}\n\nvoid SkValidatingReadBuffer::readRect(SkRect* rect) {\n    const void* ptr = this->skip(sizeof(SkRect));\n    if (!fError) {\n        memcpy(rect, ptr, sizeof(SkRect));\n    }\n}\n\nvoid SkValidatingReadBuffer::readRegion(SkRegion* region) {\n    size_t size = 0;\n    if (!fError) {\n        size = region->readFromMemory(fReader.peek(), fReader.available());\n        this->validate((SkAlign4(size) == size) && (0 != size));\n    }\n    if (!fError) {\n        (void)this->skip(size);\n    }\n}\n\nvoid SkValidatingReadBuffer::readPath(SkPath* path) {\n    size_t size = 0;\n    if (!fError) {\n        size = path->readFromMemory(fReader.peek(), fReader.available());\n        this->validate((SkAlign4(size) == size) && (0 != size));\n    }\n    if (!fError) {\n        (void)this->skip(size);\n    }\n}\n\nbool SkValidatingReadBuffer::readArray(void* value, size_t size, size_t elementSize) {\n    const uint32_t count = this->getArrayCount();\n    this->validate(size == count);\n    (void)this->skip(sizeof(uint32_t)); \/\/ Skip array count\n    const size_t byteLength = count * elementSize;\n    const void* ptr = this->skip(SkAlign4(byteLength));\n    if (!fError) {\n        memcpy(value, ptr, byteLength);\n        return true;\n    }\n    return false;\n}\n\nbool SkValidatingReadBuffer::readByteArray(void* value, size_t size) {\n    return readArray(static_cast<unsigned char*>(value), size, sizeof(unsigned char));\n}\n\nbool SkValidatingReadBuffer::readColorArray(SkColor* colors, size_t size) {\n    return readArray(colors, size, sizeof(SkColor));\n}\n\nbool SkValidatingReadBuffer::readIntArray(int32_t* values, size_t size) {\n    return readArray(values, size, sizeof(int32_t));\n}\n\nbool SkValidatingReadBuffer::readPointArray(SkPoint* points, size_t size) {\n    return readArray(points, size, sizeof(SkPoint));\n}\n\nbool SkValidatingReadBuffer::readScalarArray(SkScalar* values, size_t size) {\n    return readArray(values, size, sizeof(SkScalar));\n}\n\nuint32_t SkValidatingReadBuffer::getArrayCount() {\n    const size_t inc = sizeof(uint32_t);\n    fError = fError || !IsPtrAlign4(fReader.peek()) || !fReader.isAvailable(inc);\n    return *(uint32_t*)fReader.peek();\n}\n\nvoid SkValidatingReadBuffer::readBitmap(SkBitmap* bitmap) {\n    const int width = this->readInt();\n    const int height = this->readInt();\n    const size_t length = this->readUInt();\n    \/\/ A size of zero means the SkBitmap was simply flattened.\n    this->validate(length == 0);\n    if (fError) {\n        return;\n    }\n    bitmap->unflatten(*this);\n    this->validate((bitmap->width() == width) && (bitmap->height() == height));\n}\n\nSkTypeface* SkValidatingReadBuffer::readTypeface() {\n    \/\/ TODO: Implement this (securely) when needed\n    return NULL;\n}\n\nSkFlattenable* SkValidatingReadBuffer::readFlattenable(SkFlattenable::Type type) {\n    SkString name;\n    this->readString(&name);\n    if (fError) {\n        return NULL;\n    }\n\n    \/\/ Is this the type we wanted ?\n    const char* cname = name.c_str();\n    SkFlattenable::Type baseType;\n    if (!SkFlattenable::NameToType(cname, &baseType) || (baseType != type)) {\n        return NULL;\n    }\n\n    SkFlattenable::Factory factory = SkFlattenable::NameToFactory(cname);\n    if (NULL == factory) {\n        return NULL; \/\/ writer failed to give us the flattenable\n    }\n\n    \/\/ if we get here, factory may still be null, but if that is the case, the\n    \/\/ failure was ours, not the writer.\n    SkFlattenable* obj = NULL;\n    uint32_t sizeRecorded = this->readUInt();\n    if (factory) {\n        uint32_t offset = fReader.offset();\n        obj = (*factory)(*this);\n        \/\/ check that we read the amount we expected\n        uint32_t sizeRead = fReader.offset() - offset;\n        this->validate(sizeRecorded == sizeRead);\n        if (fError) {\n            \/\/ we could try to fix up the offset...\n            delete obj;\n            obj = NULL;\n        }\n    } else {\n        \/\/ we must skip the remaining data\n        this->skip(sizeRecorded);\n        SkASSERT(false);\n    }\n    return obj;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  HTMLCleaner.cpp\n\/\/  mailcore2\n\/\/\n\/\/  Created by DINH Viêt Hoà on 2\/3\/13.\n\/\/  Copyright (c) 2013 MailCore. All rights reserved.\n\/\/\n\n#include \"MCHTMLCleaner.h\"\n\n#include \"MCString.h\"\n#include \"MCData.h\"\n\n#include <tidy.h>\n#include <buffio.h>\n\n#include \"MCUtils.h\"\n#include \"MCLog.h\"\n\nusing namespace mailcore;\n\nString * HTMLCleaner::cleanHTML(String * input)\n{\n    TidyBuffer output;\n    TidyBuffer errbuf;\n    TidyBuffer docbuf;\n    int rc;\n    \n    TidyDoc tdoc = tidyCreate();\n    tidyBufInit(&output);\n    tidyBufInit(&errbuf);\n    tidyBufInit(&docbuf);\n    \n    Data * data = input->dataUsingEncoding(\"utf-8\");\n    tidyBufAppend(&docbuf, data->bytes(), data->length());\n    \n    tidyOptSetBool(tdoc, TidyDropEmptyElems, no);\n    tidyOptSetBool(tdoc, TidyXhtmlOut, yes);\n    tidySetCharEncoding(tdoc, \"utf8\");\n    tidyOptSetBool(tdoc, TidyForceOutput, yes);\n    \/\/tidyOptSetValue(tdoc, TidyErrFile, \"\/dev\/null\");\n    \/\/tidyOptSetValue(tdoc, TidyOutFile, \"\/dev\/null\");\n    tidyOptSetBool(tdoc, TidyShowWarnings, no);\n    tidyOptSetInt(tdoc, TidyShowErrors, 0);\n    rc = tidySetErrorBuffer(tdoc, &errbuf);\n    if ((rc > 1) || (rc < 0)) {\n        \/\/fprintf(stderr, \"error tidySetErrorBuffer: %i\\n\", rc);\n        \/\/fprintf(stderr, \"1:%s\", errbuf.bp);\n        \/\/return NULL;\n    }\n    rc = tidyParseBuffer(tdoc, &docbuf);\n    \/\/MCLog(\"%s\", MCUTF8(input));\n    if ((rc > 1) || (rc < 0)) {\n        \/\/fprintf(stderr, \"error tidyParseBuffer: %i\\n\", rc);\n        \/\/fprintf(stderr, \"1:%s\", errbuf.bp);\n        \/\/return NULL;\n    }\n    rc = tidyCleanAndRepair(tdoc);\n    if ((rc > 1) || (rc < 0)) {\n        \/\/fprintf(stderr, \"error tidyCleanAndRepair: %i\\n\", rc);\n        \/\/fprintf(stderr, \"1:%s\", errbuf.bp);\n        \/\/return NULL;\n    }\n    rc = tidySaveBuffer(tdoc, &output);\n    if ((rc > 1) || (rc < 0)) {\n        \/\/fprintf(stderr, \"error tidySaveBuffer: %i\\n\", rc);\n        \/\/fprintf(stderr, \"1:%s\", errbuf.bp);\n    }\n    \n    String * result = String::stringWithUTF8Characters((const char *) output.bp);\n    \n    tidyBufFree(&docbuf);\n    tidyBufFree(&output);\n    tidyBufFree(&errbuf);\n    tidyRelease(tdoc);\n    \n    return result;\n    \n    \/*\n    if ( ok ) {\n        rc = tidySetErrorBuffer( tdoc, &errbuf );      \/\/ Capture diagnostics\n    }\n    if ( rc &gt;= 0 ) {\n        rc = tidyParseString( tdoc, input );           \/\/ Parse the input\n    }\n    if ( rc &gt;= 0 ) {\n        rc = tidyCleanAndRepair( tdoc );               \/\/ Tidy it up!\n    }\n    if ( rc &gt;= 0 ) {\n        rc = tidyRunDiagnostics( tdoc );               \/\/ Kvetch\n    }\n    if ( rc &gt; 1 ) {                                    \/\/ If error, force output.\n        rc = ( tidyOptSetBool(tdoc, TidyForceOutput, yes) ? rc : -1 );\n    }\n    if ( rc &gt;= 0 ) {\n        rc = tidySaveBuffer( tdoc, &output );          \/\/ Pretty Print\n    }\n     *\/\n    \n    \/*\n    if ( rc &gt;= 0 )\n    {\n        if ( rc &gt; 0 )\n            printf( \"\\\\nDiagnostics:\\\\n\\\\n\\%s\", errbuf.bp );\n            printf( \"\\\\nAnd here is the result:\\\\n\\\\n\\%s\", output.bp );\n            }\n    else\n        printf( \"A severe error (\\%d) occurred.\\\\n\", rc );\n        \n        tidyBufFree( &amp;output );\n        tidyBufFree( &amp;errbuf );\n        tidyRelease( tdoc );\n        return rc;\n     *\/\n}\n<commit_msg>Fixed build<commit_after>\/\/\n\/\/  HTMLCleaner.cpp\n\/\/  mailcore2\n\/\/\n\/\/  Created by DINH Viêt Hoà on 2\/3\/13.\n\/\/  Copyright (c) 2013 MailCore. All rights reserved.\n\/\/\n\n#include \"MCHTMLCleaner.h\"\n\n#include \"MCString.h\"\n#include \"MCData.h\"\n\n#include <tidy.h>\n#include <buffio.h>\n\n#include \"MCUtils.h\"\n#include \"MCLog.h\"\n\n#if __APPLE__\n#include <TargetConditionals.h>\n#endif\n\nusing namespace mailcore;\n\nString * HTMLCleaner::cleanHTML(String * input)\n{\n    TidyBuffer output;\n    TidyBuffer errbuf;\n    TidyBuffer docbuf;\n    int rc;\n    \n    TidyDoc tdoc = tidyCreate();\n    tidyBufInit(&output);\n    tidyBufInit(&errbuf);\n    tidyBufInit(&docbuf);\n    \n    Data * data = input->dataUsingEncoding(\"utf-8\");\n    tidyBufAppend(&docbuf, data->bytes(), data->length());\n    \n#if TARGET_IPHONE_SIMULATOR || TARGET_OS_IPHONE\n    \/\/ This option is not available on the Mac.\n    tidyOptSetBool(tdoc, TidyDropEmptyElems, no);\n#endif\n    tidyOptSetBool(tdoc, TidyXhtmlOut, yes);\n    tidySetCharEncoding(tdoc, \"utf8\");\n    tidyOptSetBool(tdoc, TidyForceOutput, yes);\n    \/\/tidyOptSetValue(tdoc, TidyErrFile, \"\/dev\/null\");\n    \/\/tidyOptSetValue(tdoc, TidyOutFile, \"\/dev\/null\");\n    tidyOptSetBool(tdoc, TidyShowWarnings, no);\n    tidyOptSetInt(tdoc, TidyShowErrors, 0);\n    rc = tidySetErrorBuffer(tdoc, &errbuf);\n    if ((rc > 1) || (rc < 0)) {\n        \/\/fprintf(stderr, \"error tidySetErrorBuffer: %i\\n\", rc);\n        \/\/fprintf(stderr, \"1:%s\", errbuf.bp);\n        \/\/return NULL;\n    }\n    rc = tidyParseBuffer(tdoc, &docbuf);\n    \/\/MCLog(\"%s\", MCUTF8(input));\n    if ((rc > 1) || (rc < 0)) {\n        \/\/fprintf(stderr, \"error tidyParseBuffer: %i\\n\", rc);\n        \/\/fprintf(stderr, \"1:%s\", errbuf.bp);\n        \/\/return NULL;\n    }\n    rc = tidyCleanAndRepair(tdoc);\n    if ((rc > 1) || (rc < 0)) {\n        \/\/fprintf(stderr, \"error tidyCleanAndRepair: %i\\n\", rc);\n        \/\/fprintf(stderr, \"1:%s\", errbuf.bp);\n        \/\/return NULL;\n    }\n    rc = tidySaveBuffer(tdoc, &output);\n    if ((rc > 1) || (rc < 0)) {\n        \/\/fprintf(stderr, \"error tidySaveBuffer: %i\\n\", rc);\n        \/\/fprintf(stderr, \"1:%s\", errbuf.bp);\n    }\n    \n    String * result = String::stringWithUTF8Characters((const char *) output.bp);\n    \n    tidyBufFree(&docbuf);\n    tidyBufFree(&output);\n    tidyBufFree(&errbuf);\n    tidyRelease(tdoc);\n    \n    return result;\n    \n    \/*\n    if ( ok ) {\n        rc = tidySetErrorBuffer( tdoc, &errbuf );      \/\/ Capture diagnostics\n    }\n    if ( rc &gt;= 0 ) {\n        rc = tidyParseString( tdoc, input );           \/\/ Parse the input\n    }\n    if ( rc &gt;= 0 ) {\n        rc = tidyCleanAndRepair( tdoc );               \/\/ Tidy it up!\n    }\n    if ( rc &gt;= 0 ) {\n        rc = tidyRunDiagnostics( tdoc );               \/\/ Kvetch\n    }\n    if ( rc &gt; 1 ) {                                    \/\/ If error, force output.\n        rc = ( tidyOptSetBool(tdoc, TidyForceOutput, yes) ? rc : -1 );\n    }\n    if ( rc &gt;= 0 ) {\n        rc = tidySaveBuffer( tdoc, &output );          \/\/ Pretty Print\n    }\n     *\/\n    \n    \/*\n    if ( rc &gt;= 0 )\n    {\n        if ( rc &gt; 0 )\n            printf( \"\\\\nDiagnostics:\\\\n\\\\n\\%s\", errbuf.bp );\n            printf( \"\\\\nAnd here is the result:\\\\n\\\\n\\%s\", output.bp );\n            }\n    else\n        printf( \"A severe error (\\%d) occurred.\\\\n\", rc );\n        \n        tidyBufFree( &amp;output );\n        tidyBufFree( &amp;errbuf );\n        tidyRelease( tdoc );\n        return rc;\n     *\/\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file\n * @brief Base of detector models\n *\n * @copyright Copyright (c) 2017 CERN and the Allpix Squared authors.\n * This software is distributed under the terms of the MIT License, copied verbatim in the file \"LICENSE.md\".\n * In applying this license, CERN does not waive the privileges and immunities granted to it by virtue of its status as an\n * Intergovernmental Organization or submit itself to any jurisdiction.\n *\/\n\n\/**\n * @defgroup DetectorModels Detector models\n * @brief Collection of detector models supported by the framework\n *\/\n\n#ifndef ALLPIX_DETECTOR_MODEL_H\n#define ALLPIX_DETECTOR_MODEL_H\n\n#include <array>\n#include <string>\n#include <utility>\n\n#include <Math\/Point2D.h>\n#include <Math\/Point3D.h>\n#include <Math\/Vector2D.h>\n#include <Math\/Vector3D.h>\n\n#include \"core\/config\/ConfigReader.hpp\"\n#include \"core\/config\/exceptions.h\"\n#include \"core\/utils\/log.h\"\n#include \"tools\/ROOT.h\"\n\nnamespace allpix {\n    \/**\n     * @ingroup DetectorModels\n     * @brief Base of all detector models\n     *\n     * Implements the minimum required for a detector model. A model always has a pixel grid with a specific pixel size. The\n     * pixel grid defines the base size of the sensor, chip and support. Excess length can be specified. Every part of the\n     * detector model has a defined center and size which can be overloaded by specialized detector models. The basic\n     * detector model also defines the rotation center in the local coordinate system.\n     *\/\n    class DetectorModel {\n    public:\n        \/**\n         * @brief Helper class to hold support layers for a detector model\n         *\/\n        class SupportLayer {\n            friend class DetectorModel;\n            \/\/ FIXME Friending this class is broken\n            friend class HybridPixelDetectorModel;\n\n        public:\n            \/**\n             * @brief Get the center of the support layer\n             * @return Center of the support layer\n             *\/\n            ROOT::Math::XYZPoint getCenter() const { return center_; }\n            \/**\n             * @brief Get the size of the support layer\n             * @return Size of the support layer\n             *\/\n            ROOT::Math::XYZVector getSize() const { return size_; }\n            \/**\n             * @brief Get the material of the support layer\n             * @return Support material\n             *\/\n            std::string getMaterial() const { return material_; }\n            \/**\n             * @brief Return if the support layer contains a hole\n             * @return True if the support layer has a hole, false otherwise\n             *\/\n            bool hasHole() { return hole_size_.x() > 1e-9 && hole_size_.y() > 1e-9; }\n            \/**\n             * @brief Get the center of the hole in the support layer\n             * @return Center of the hole\n             *\/\n            ROOT::Math::XYZPoint getHoleCenter() const {\n                return center_ + ROOT::Math::XYZVector(hole_offset_.x(), hole_offset_.y(), 0);\n            }\n            \/**\n             * @brief Get the full size of the hole in the support layer\n             * @return Size of the hole\n             *\/\n            ROOT::Math::XYZVector getHoleSize() const { return hole_size_; }\n            \/**\n             * @brief Get the location of the support layer\n             *\/\n            std::string getLocation() const { return location_; }\n\n        private:\n            \/**\n             * @brief Constructs a support layer, used in \\ref DetectorModel::addSupportLayer\n             * @param size Size of the support layer\n             * @param offset Offset of the support layer from the center\n             * @param material Material of the support layer\n             * @param location Location of the support material\n             * @param hole_size Size of an optional hole (zero vector if no hole)\n             * @param hole_offset Offset of the optional hole from the center of the support layer\n             *\/\n            SupportLayer(ROOT::Math::XYZVector size,\n                         ROOT::Math::XYZVector offset,\n                         std::string material,\n                         std::string location,\n                         ROOT::Math::XYZVector hole_size,\n                         ROOT::Math::XYVector hole_offset)\n                : size_(std::move(size)), material_(std::move(material)), hole_size_(std::move(hole_size)),\n                  offset_(std::move(offset)), hole_offset_(std::move(hole_offset)), location_(std::move(location)) {}\n\n            \/\/ Actual parameters returned\n            ROOT::Math::XYZPoint center_;\n            ROOT::Math::XYZVector size_;\n            std::string material_;\n            ROOT::Math::XYZVector hole_size_;\n\n            \/\/ Internal parameters to calculate return parameters\n            ROOT::Math::XYZVector offset_;\n            ROOT::Math::XYVector hole_offset_;\n            std::string location_;\n        };\n\n        \/**\n         * @brief Constructs the base detector model\n         * @param type Name of the model type\n         * @param reader Configuration reader with description of the model\n         *\/\n        explicit DetectorModel(std::string type, ConfigReader reader);\n\n        \/**\n         * @brief Essential virtual destructor\n         *\/\n        virtual ~DetectorModel() = default;\n\n        \/\/\/@{\n        \/**\n         * @brief Use default copy and move behaviour\n         *\/\n        DetectorModel(const DetectorModel&) = default;\n        DetectorModel& operator=(const DetectorModel&) = default;\n\n        DetectorModel(DetectorModel&&) = default;\n        DetectorModel& operator=(DetectorModel&&) = default;\n        \/\/\/@}\n\n        \/**\n         * @brief Get the configuration associated with this model\n         * @return Configuration used to construct the model\n         *\/\n        std::vector<Configuration> getConfigurations() const;\n\n        \/**\n         * @brief Get the type of the model\n         * @return Model type\n         *\/\n        std::string getType() const { return type_; }\n\n        \/**\n         * @brief Get local coordinate of the position and rotation center in global frame\n         * @note It can be a counter intuitive that this is not usually the origin, neither the geometric center of the model\n         *\n         * The center coordinate corresponds to the \\ref Detector::getPosition \"position\" in the global frame.\n         *\/\n        virtual ROOT::Math::XYZPoint getCenter() const {\n            return ROOT::Math::XYZPoint(\n                getGridSize().x() \/ 2.0 - getPixelSize().x() \/ 2.0, getGridSize().y() \/ 2.0 - getPixelSize().y() \/ 2.0, 0);\n        }\n\n        \/**\n         * @brief Get local coordinate of the geometric center of the model\n         *\/\n        virtual ROOT::Math::XYZPoint getGeometricalCenter() const {\n            \/\/ Get the distance, on the z axis, between the sensor center and the detector (box) geometrical center\n            double detector_thickness = getSize().z();\n            double min_support_center =\n                -getSensorSize().Z() \/ 2; \/\/ center (on the z axis) of the support (sensor side) with smallest z coordinate\n            double min_support_size = 0.; \/\/ z size of the support (sensor side) with smallest z coordinate\n            for(auto& support_layer : getSupportLayers()) {\n                double centers_zDistance = (support_layer.getCenter()).z() - getSensorCenter().z();\n                if(centers_zDistance < min_support_center) { \/\/ selects supports on the sensor side only\n                    min_support_center = centers_zDistance;\n                    min_support_size = (support_layer.getSize()).z();\n                }\n            }\n            double support_sensorSide_thickness =\n                std::abs(min_support_center) + min_support_size \/ 2 -\n                getSensorSize().Z() \/ 2; \/\/ total thickness of support layers (including empty spaces) on the sensor side\n            double zDistanceToGeoCenter = detector_thickness \/ 2 - support_sensorSide_thickness - getSensorSize().Z() \/ 2;\n\n            return ROOT::Math::XYZPoint(getCenter().x(), getCenter().y(), zDistanceToGeoCenter);\n        }\n\n        \/**\n         * @brief Get size of the box around the model that contains all elements\n         * @return Size of the detector model\n         *\n         * All elements should be covered by a box with \\ref DetectorModel::getCenter as center. This means that the size\n         * returned by this method is likely larger than the minimum possible size of a box around all elements. It will only\n         * return the minimum size if \\ref DetectorModel::getCenter corresponds to the geometric center of the model.\n         *\/\n        virtual ROOT::Math::XYZVector getSize() const;\n\n        \/* PIXEL GRID *\/\n        \/**\n         * @brief Get number of pixel (replicated blocks in generic sensors)\n         * @return Number of two dimensional pixels\n         *\/\n        virtual ROOT::Math::DisplacementVector2D<ROOT::Math::Cartesian2D<int>> getNPixels() const {\n            return number_of_pixels_;\n        }\n        \/**\n         * @brief Set number of pixels (replicated blocks in generic sensors)\n         * @param val Number of two dimensional pixels\n         *\/\n        void setNPixels(ROOT::Math::DisplacementVector2D<ROOT::Math::Cartesian2D<int>> val) {\n            number_of_pixels_ = std::move(val);\n        }\n        \/**\n         * @brief Get size of a single pixel\n         * @return Size of a pixel\n         *\/\n        virtual ROOT::Math::XYVector getPixelSize() const { return pixel_size_; }\n        \/**\n         * @brief Set the size of a pixel\n         * @param val Size of a pixel\n         *\/\n        void setPixelSize(ROOT::Math::XYVector val) { pixel_size_ = std::move(val); }\n        \/**\n         * @brief Get size of the collection diode\n         * @return Size of the collection diode implant\n         *\/\n        virtual ROOT::Math::XYVector getImplantSize() const { return implant_size_; }\n        \/**\n         * @brief Set the size of the implant (collection diode) within a pixel\n         * @param val Size of the collection diode implant\n         *\/\n        void setImplantSize(ROOT::Math::XYVector val) { implant_size_ = std::move(val); }\n        \/**\n         * @brief Get total size of the pixel grid\n         * @return Size of the pixel grid\n         *\n         * @warning The grid has zero thickness\n         * @note This is basically a 2D method, but provided in 3D because it is primarily used there\n         *\/\n        ROOT::Math::XYZVector getGridSize() const {\n            return ROOT::Math::XYZVector(getNPixels().x() * getPixelSize().x(), getNPixels().y() * getPixelSize().y(), 0);\n        }\n\n        \/* SENSOR *\/\n        \/**\n         * @brief Get size of the sensor\n         * @return Size of the sensor\n         *\n         * Calculated from \\ref DetectorModel::getGridSize \"pixel grid size\", sensor excess and sensor thickness\n         *\/\n        virtual ROOT::Math::XYZVector getSensorSize() const {\n            ROOT::Math::XYZVector excess_thickness((sensor_excess_.at(1) + sensor_excess_.at(3)),\n                                                   (sensor_excess_.at(0) + sensor_excess_.at(2)),\n                                                   sensor_thickness_);\n            return getGridSize() + excess_thickness;\n        }\n        \/**\n         * @brief Get center of the sensor in local coordinates\n         * @return Center of the sensor\n         *\n         * Center of the sensor with excess taken into account\n         *\/\n        virtual ROOT::Math::XYZPoint getSensorCenter() const {\n            ROOT::Math::XYZVector offset(\n                (sensor_excess_.at(1) - sensor_excess_.at(3)) \/ 2.0, (sensor_excess_.at(0) - sensor_excess_.at(2)) \/ 2.0, 0);\n            return getCenter() + offset;\n        }\n        \/**\n         * @brief Set the thickness of the sensor\n         * @param val Thickness of the sensor\n         *\/\n        void setSensorThickness(double val) { sensor_thickness_ = val; }\n        \/**\n         * @brief Set the excess at the top of the sensor (positive y-coordinate)\n         * @param val Sensor top excess\n         *\/\n        void setSensorExcessTop(double val) { sensor_excess_.at(0) = val; }\n        \/**\n         * @brief Set the excess at the right of the sensor (positive x-coordinate)\n         * @param val Sensor right excess\n         *\/\n        void setSensorExcessRight(double val) { sensor_excess_.at(1) = val; }\n        \/**\n         * @brief Set the excess at the bottom of the sensor (negative y-coordinate)\n         * @param val Sensor bottom excess\n         *\/\n        void setSensorExcessBottom(double val) { sensor_excess_.at(2) = val; }\n        \/**\n         * @brief Set the excess at the left of the sensor (negative x-coordinate)\n         * @param val Sensor right excess\n         *\/\n        void setSensorExcessLeft(double val) { sensor_excess_.at(3) = val; }\n\n        \/* CHIP *\/\n        \/**\n         * @brief Get size of the chip\n         * @return Size of the chip\n         *\n         * Calculated from \\ref DetectorModel::getGridSize \"pixel grid size\", sensor excess and chip thickness\n         *\/\n        virtual ROOT::Math::XYZVector getChipSize() const {\n            ROOT::Math::XYZVector excess_thickness((sensor_excess_.at(1) + sensor_excess_.at(3)),\n                                                   (sensor_excess_.at(0) + sensor_excess_.at(2)),\n                                                   chip_thickness_);\n            return getGridSize() + excess_thickness;\n        }\n        \/**\n         * @brief Get center of the chip in local coordinates\n         * @return Center of the chip\n         *\n         * Center of the chip calculcated from chip excess and sensor offset\n         *\/\n        virtual ROOT::Math::XYZPoint getChipCenter() const {\n            ROOT::Math::XYZVector offset((sensor_excess_.at(1) - sensor_excess_.at(3)) \/ 2.0,\n                                         (sensor_excess_.at(0) - sensor_excess_.at(2)) \/ 2.0,\n                                         getSensorSize().z() \/ 2.0 + getChipSize().z() \/ 2.0);\n            return getCenter() + offset;\n        }\n        \/**\n         * @brief Set the thickness of the sensor\n         * @param val Thickness of the sensor\n         *\/\n        void setChipThickness(double val) { chip_thickness_ = val; }\n\n        \/* SUPPORT *\/\n        \/**\n         * @brief Return all layers of support\n         * @return List of all the support layers\n         *\n         * This method internally computes the correct center of all the supports by stacking them in linear order on both\n         * the chip and the sensor side.\n         *\/\n        virtual std::vector<SupportLayer> getSupportLayers() const;\n\n        \/**\n         * @brief Add a new layer of support\n         * @param size Size of the support in the x,y-plane\n         * @param thickness Thickness of the support\n         * @param offset Offset of the support in the x,y-plane\n         * @param material Material of the support\n         * @param location Location of the support (either 'sensor' or 'chip')\n         * @param hole_size Size of the optional hole in the support\n         * @param hole_offset Offset of the hole from its default position\n         *\/\n        \/\/ FIXME: Location (and material) should probably be an enum instead\n        void addSupportLayer(const ROOT::Math::XYVector& size,\n                             double thickness,\n                             ROOT::Math::XYZVector offset,\n                             std::string material,\n                             std::string location,\n                             const ROOT::Math::XYVector& hole_size,\n                             ROOT::Math::XYVector hole_offset) {\n            ROOT::Math::XYZVector full_size(size.x(), size.y(), thickness);\n            ROOT::Math::XYZVector full_hole_size(hole_size.x(), hole_size.y(), thickness);\n            support_layers_.push_back(SupportLayer(full_size,\n                                                   std::move(offset),\n                                                   std::move(material),\n                                                   std::move(location),\n                                                   full_hole_size,\n                                                   std::move(hole_offset)));\n        }\n\n    protected:\n        std::string type_;\n\n        ROOT::Math::DisplacementVector2D<ROOT::Math::Cartesian2D<int>> number_of_pixels_;\n        ROOT::Math::XYVector pixel_size_;\n        ROOT::Math::XYVector implant_size_;\n\n        double sensor_thickness_{};\n        std::array<double, 4> sensor_excess_{};\n\n        double chip_thickness_{};\n\n        std::vector<SupportLayer> support_layers_;\n\n    private:\n        ConfigReader reader_;\n    };\n} \/\/ namespace allpix\n\n#endif \/\/ ALLPIX_DETECTOR_MODEL_H\n<commit_msg>DetectorModel: update Doxygen documentation<commit_after>\/**\n * @file\n * @brief Base of detector models\n *\n * @copyright Copyright (c) 2017 CERN and the Allpix Squared authors.\n * This software is distributed under the terms of the MIT License, copied verbatim in the file \"LICENSE.md\".\n * In applying this license, CERN does not waive the privileges and immunities granted to it by virtue of its status as an\n * Intergovernmental Organization or submit itself to any jurisdiction.\n *\/\n\n\/**\n * @defgroup DetectorModels Detector models\n * @brief Collection of detector models supported by the framework\n *\/\n\n#ifndef ALLPIX_DETECTOR_MODEL_H\n#define ALLPIX_DETECTOR_MODEL_H\n\n#include <array>\n#include <string>\n#include <utility>\n\n#include <Math\/Point2D.h>\n#include <Math\/Point3D.h>\n#include <Math\/Vector2D.h>\n#include <Math\/Vector3D.h>\n\n#include \"core\/config\/ConfigReader.hpp\"\n#include \"core\/config\/exceptions.h\"\n#include \"core\/utils\/log.h\"\n#include \"tools\/ROOT.h\"\n\nnamespace allpix {\n    \/**\n     * @ingroup DetectorModels\n     * @brief Base of all detector models\n     *\n     * Implements the minimum required for a detector model. A model always has a pixel grid with a specific pixel size. The\n     * pixel grid defines the base size of the sensor, chip and support. Excess length can be specified. Every part of the\n     * detector model has a defined center and size which can be overloaded by specialized detector models. The basic\n     * detector model also defines the rotation center in the local coordinate system.\n     *\/\n    class DetectorModel {\n    public:\n        \/**\n         * @brief Helper class to hold support layers for a detector model\n         *\/\n        class SupportLayer {\n            friend class DetectorModel;\n            \/\/ FIXME Friending this class is broken\n            friend class HybridPixelDetectorModel;\n\n        public:\n            \/**\n             * @brief Get the center of the support layer\n             * @return Center of the support layer\n             *\/\n            ROOT::Math::XYZPoint getCenter() const { return center_; }\n            \/**\n             * @brief Get the size of the support layer\n             * @return Size of the support layer\n             *\/\n            ROOT::Math::XYZVector getSize() const { return size_; }\n            \/**\n             * @brief Get the material of the support layer\n             * @return Support material\n             *\/\n            std::string getMaterial() const { return material_; }\n            \/**\n             * @brief Return if the support layer contains a hole\n             * @return True if the support layer has a hole, false otherwise\n             *\/\n            bool hasHole() { return hole_size_.x() > 1e-9 && hole_size_.y() > 1e-9; }\n            \/**\n             * @brief Get the center of the hole in the support layer\n             * @return Center of the hole\n             *\/\n            ROOT::Math::XYZPoint getHoleCenter() const {\n                return center_ + ROOT::Math::XYZVector(hole_offset_.x(), hole_offset_.y(), 0);\n            }\n            \/**\n             * @brief Get the full size of the hole in the support layer\n             * @return Size of the hole\n             *\/\n            ROOT::Math::XYZVector getHoleSize() const { return hole_size_; }\n            \/**\n             * @brief Get the location of the support layer\n             *\/\n            std::string getLocation() const { return location_; }\n\n        private:\n            \/**\n             * @brief Constructs a support layer, used in \\ref DetectorModel::addSupportLayer\n             * @param size Size of the support layer\n             * @param offset Offset of the support layer from the center\n             * @param material Material of the support layer\n             * @param location Location of the support material\n             * @param hole_size Size of an optional hole (zero vector if no hole)\n             * @param hole_offset Offset of the optional hole from the center of the support layer\n             *\/\n            SupportLayer(ROOT::Math::XYZVector size,\n                         ROOT::Math::XYZVector offset,\n                         std::string material,\n                         std::string location,\n                         ROOT::Math::XYZVector hole_size,\n                         ROOT::Math::XYVector hole_offset)\n                : size_(std::move(size)), material_(std::move(material)), hole_size_(std::move(hole_size)),\n                  offset_(std::move(offset)), hole_offset_(std::move(hole_offset)), location_(std::move(location)) {}\n\n            \/\/ Actual parameters returned\n            ROOT::Math::XYZPoint center_;\n            ROOT::Math::XYZVector size_;\n            std::string material_;\n            ROOT::Math::XYZVector hole_size_;\n\n            \/\/ Internal parameters to calculate return parameters\n            ROOT::Math::XYZVector offset_;\n            ROOT::Math::XYVector hole_offset_;\n            std::string location_;\n        };\n\n        \/**\n         * @brief Constructs the base detector model\n         * @param type Name of the model type\n         * @param reader Configuration reader with description of the model\n         *\/\n        explicit DetectorModel(std::string type, ConfigReader reader);\n\n        \/**\n         * @brief Essential virtual destructor\n         *\/\n        virtual ~DetectorModel() = default;\n\n        \/\/\/@{\n        \/**\n         * @brief Use default copy and move behaviour\n         *\/\n        DetectorModel(const DetectorModel&) = default;\n        DetectorModel& operator=(const DetectorModel&) = default;\n\n        DetectorModel(DetectorModel&&) = default;\n        DetectorModel& operator=(DetectorModel&&) = default;\n        \/\/\/@}\n\n        \/**\n         * @brief Get the configuration associated with this model\n         * @return Configuration used to construct the model\n         *\/\n        std::vector<Configuration> getConfigurations() const;\n\n        \/**\n         * @brief Get the type of the model\n         * @return Model type\n         *\/\n        std::string getType() const { return type_; }\n\n        \/**\n         * @brief Get local coordinate of the position and rotation center in global frame\n         * @note It can be a bit counter intuitive that this is not usually the origin, neither the geometric center of the\n         * model, but the geometric center of the sensitive part. This way, the position of the sensing element is invariant\n         * under rotations\n         *\n         * The center coordinate corresponds to the \\ref Detector::getPosition \"position\" in the global frame.\n         *\/\n        virtual ROOT::Math::XYZPoint getCenter() const {\n            return ROOT::Math::XYZPoint(\n                getGridSize().x() \/ 2.0 - getPixelSize().x() \/ 2.0, getGridSize().y() \/ 2.0 - getPixelSize().y() \/ 2.0, 0);\n        }\n\n        \/**\n         * @brief Get local coordinate of the geometric center of the model\n         * @note This returns the center of the geometry model, i.e. including all support layers, passive readout chips et\n         * cetera.\n         *\/\n        virtual ROOT::Math::XYZPoint getGeometricalCenter() const {\n            \/\/ Get the distance, on the z axis, between the sensor center and the detector (box) geometrical center\n            double detector_thickness = getSize().z();\n            double min_support_center =\n                -getSensorSize().Z() \/ 2; \/\/ center (on the z axis) of the support (sensor side) with smallest z coordinate\n            double min_support_size = 0.; \/\/ z size of the support (sensor side) with smallest z coordinate\n            for(auto& support_layer : getSupportLayers()) {\n                double centers_zDistance = (support_layer.getCenter()).z() - getSensorCenter().z();\n                if(centers_zDistance < min_support_center) { \/\/ selects supports on the sensor side only\n                    min_support_center = centers_zDistance;\n                    min_support_size = (support_layer.getSize()).z();\n                }\n            }\n            double support_sensorSide_thickness =\n                std::abs(min_support_center) + min_support_size \/ 2 -\n                getSensorSize().Z() \/ 2; \/\/ total thickness of support layers (including empty spaces) on the sensor side\n            double zDistanceToGeoCenter = detector_thickness \/ 2 - support_sensorSide_thickness - getSensorSize().Z() \/ 2;\n\n            return ROOT::Math::XYZPoint(getCenter().x(), getCenter().y(), zDistanceToGeoCenter);\n        }\n\n        \/**\n         * @brief Get size of the wrapper box around the model that contains all elements\n         * @return Size of the detector model\n         *\n         * All elements of the model are covered by a box centered around \\ref DetectorModel::getGeometricalCenter. This\n         * means that the extend of the model should be calculated using the geometrical center as reference, not the positon\n         * returned by \\ref DetectorModel::getCenter.\n         *\/\n        virtual ROOT::Math::XYZVector getSize() const;\n\n        \/* PIXEL GRID *\/\n        \/**\n         * @brief Get number of pixel (replicated blocks in generic sensors)\n         * @return Number of two dimensional pixels\n         *\/\n        virtual ROOT::Math::DisplacementVector2D<ROOT::Math::Cartesian2D<int>> getNPixels() const {\n            return number_of_pixels_;\n        }\n        \/**\n         * @brief Set number of pixels (replicated blocks in generic sensors)\n         * @param val Number of two dimensional pixels\n         *\/\n        void setNPixels(ROOT::Math::DisplacementVector2D<ROOT::Math::Cartesian2D<int>> val) {\n            number_of_pixels_ = std::move(val);\n        }\n        \/**\n         * @brief Get size of a single pixel\n         * @return Size of a pixel\n         *\/\n        virtual ROOT::Math::XYVector getPixelSize() const { return pixel_size_; }\n        \/**\n         * @brief Set the size of a pixel\n         * @param val Size of a pixel\n         *\/\n        void setPixelSize(ROOT::Math::XYVector val) { pixel_size_ = std::move(val); }\n        \/**\n         * @brief Get size of the collection diode\n         * @return Size of the collection diode implant\n         *\/\n        virtual ROOT::Math::XYVector getImplantSize() const { return implant_size_; }\n        \/**\n         * @brief Set the size of the implant (collection diode) within a pixel\n         * @param val Size of the collection diode implant\n         *\/\n        void setImplantSize(ROOT::Math::XYVector val) { implant_size_ = std::move(val); }\n        \/**\n         * @brief Get total size of the pixel grid\n         * @return Size of the pixel grid\n         *\n         * @warning The grid has zero thickness\n         * @note This is basically a 2D method, but provided in 3D because it is primarily used there\n         *\/\n        ROOT::Math::XYZVector getGridSize() const {\n            return ROOT::Math::XYZVector(getNPixels().x() * getPixelSize().x(), getNPixels().y() * getPixelSize().y(), 0);\n        }\n\n        \/* SENSOR *\/\n        \/**\n         * @brief Get size of the sensor\n         * @return Size of the sensor\n         *\n         * Calculated from \\ref DetectorModel::getGridSize \"pixel grid size\", sensor excess and sensor thickness\n         *\/\n        virtual ROOT::Math::XYZVector getSensorSize() const {\n            ROOT::Math::XYZVector excess_thickness((sensor_excess_.at(1) + sensor_excess_.at(3)),\n                                                   (sensor_excess_.at(0) + sensor_excess_.at(2)),\n                                                   sensor_thickness_);\n            return getGridSize() + excess_thickness;\n        }\n        \/**\n         * @brief Get center of the sensor in local coordinates\n         * @return Center of the sensor\n         *\n         * Center of the sensor with excess taken into account\n         *\/\n        virtual ROOT::Math::XYZPoint getSensorCenter() const {\n            ROOT::Math::XYZVector offset(\n                (sensor_excess_.at(1) - sensor_excess_.at(3)) \/ 2.0, (sensor_excess_.at(0) - sensor_excess_.at(2)) \/ 2.0, 0);\n            return getCenter() + offset;\n        }\n        \/**\n         * @brief Set the thickness of the sensor\n         * @param val Thickness of the sensor\n         *\/\n        void setSensorThickness(double val) { sensor_thickness_ = val; }\n        \/**\n         * @brief Set the excess at the top of the sensor (positive y-coordinate)\n         * @param val Sensor top excess\n         *\/\n        void setSensorExcessTop(double val) { sensor_excess_.at(0) = val; }\n        \/**\n         * @brief Set the excess at the right of the sensor (positive x-coordinate)\n         * @param val Sensor right excess\n         *\/\n        void setSensorExcessRight(double val) { sensor_excess_.at(1) = val; }\n        \/**\n         * @brief Set the excess at the bottom of the sensor (negative y-coordinate)\n         * @param val Sensor bottom excess\n         *\/\n        void setSensorExcessBottom(double val) { sensor_excess_.at(2) = val; }\n        \/**\n         * @brief Set the excess at the left of the sensor (negative x-coordinate)\n         * @param val Sensor right excess\n         *\/\n        void setSensorExcessLeft(double val) { sensor_excess_.at(3) = val; }\n\n        \/* CHIP *\/\n        \/**\n         * @brief Get size of the chip\n         * @return Size of the chip\n         *\n         * Calculated from \\ref DetectorModel::getGridSize \"pixel grid size\", sensor excess and chip thickness\n         *\/\n        virtual ROOT::Math::XYZVector getChipSize() const {\n            ROOT::Math::XYZVector excess_thickness((sensor_excess_.at(1) + sensor_excess_.at(3)),\n                                                   (sensor_excess_.at(0) + sensor_excess_.at(2)),\n                                                   chip_thickness_);\n            return getGridSize() + excess_thickness;\n        }\n        \/**\n         * @brief Get center of the chip in local coordinates\n         * @return Center of the chip\n         *\n         * Center of the chip calculcated from chip excess and sensor offset\n         *\/\n        virtual ROOT::Math::XYZPoint getChipCenter() const {\n            ROOT::Math::XYZVector offset((sensor_excess_.at(1) - sensor_excess_.at(3)) \/ 2.0,\n                                         (sensor_excess_.at(0) - sensor_excess_.at(2)) \/ 2.0,\n                                         getSensorSize().z() \/ 2.0 + getChipSize().z() \/ 2.0);\n            return getCenter() + offset;\n        }\n        \/**\n         * @brief Set the thickness of the sensor\n         * @param val Thickness of the sensor\n         *\/\n        void setChipThickness(double val) { chip_thickness_ = val; }\n\n        \/* SUPPORT *\/\n        \/**\n         * @brief Return all layers of support\n         * @return List of all the support layers\n         *\n         * This method internally computes the correct center of all the supports by stacking them in linear order on both\n         * the chip and the sensor side.\n         *\/\n        virtual std::vector<SupportLayer> getSupportLayers() const;\n\n        \/**\n         * @brief Add a new layer of support\n         * @param size Size of the support in the x,y-plane\n         * @param thickness Thickness of the support\n         * @param offset Offset of the support in the x,y-plane\n         * @param material Material of the support\n         * @param location Location of the support (either 'sensor' or 'chip')\n         * @param hole_size Size of the optional hole in the support\n         * @param hole_offset Offset of the hole from its default position\n         *\/\n        \/\/ FIXME: Location (and material) should probably be an enum instead\n        void addSupportLayer(const ROOT::Math::XYVector& size,\n                             double thickness,\n                             ROOT::Math::XYZVector offset,\n                             std::string material,\n                             std::string location,\n                             const ROOT::Math::XYVector& hole_size,\n                             ROOT::Math::XYVector hole_offset) {\n            ROOT::Math::XYZVector full_size(size.x(), size.y(), thickness);\n            ROOT::Math::XYZVector full_hole_size(hole_size.x(), hole_size.y(), thickness);\n            support_layers_.push_back(SupportLayer(full_size,\n                                                   std::move(offset),\n                                                   std::move(material),\n                                                   std::move(location),\n                                                   full_hole_size,\n                                                   std::move(hole_offset)));\n        }\n\n    protected:\n        std::string type_;\n\n        ROOT::Math::DisplacementVector2D<ROOT::Math::Cartesian2D<int>> number_of_pixels_;\n        ROOT::Math::XYVector pixel_size_;\n        ROOT::Math::XYVector implant_size_;\n\n        double sensor_thickness_{};\n        std::array<double, 4> sensor_excess_{};\n\n        double chip_thickness_{};\n\n        std::vector<SupportLayer> support_layers_;\n\n    private:\n        ConfigReader reader_;\n    };\n} \/\/ namespace allpix\n\n#endif \/\/ ALLPIX_DETECTOR_MODEL_H\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 <grpc\/support\/port_platform.h>\n\n#include <inttypes.h>\n\n#include <grpc\/support\/alloc.h>\n#include <grpc\/support\/log.h>\n\n#include \"src\/core\/lib\/debug\/trace.h\"\n#include \"src\/core\/lib\/gprpp\/thd.h\"\n#include \"src\/core\/lib\/iomgr\/timer.h\"\n#include \"src\/core\/lib\/iomgr\/timer_manager.h\"\n\nstruct completed_thread {\n  grpc_core::Thread thd;\n  completed_thread* next;\n};\n\nextern grpc_core::TraceFlag grpc_timer_check_trace;\n\n\/\/ global mutex\nstatic gpr_mu g_mu;\n\/\/ are we multi-threaded\nstatic bool g_threaded;\n\/\/ cv to wait until a thread is needed\nstatic gpr_cv g_cv_wait;\n\/\/ cv for notification when threading ends\nstatic gpr_cv g_cv_shutdown;\n\/\/ number of threads in the system\nstatic int g_thread_count;\n\/\/ number of threads sitting around waiting\nstatic int g_waiter_count;\n\/\/ linked list of threads that have completed (and need joining)\nstatic completed_thread* g_completed_threads;\n\/\/ was the manager kicked by the timer system\nstatic bool g_kicked;\n\/\/ is there a thread waiting until the next timer should fire?\nstatic bool g_has_timed_waiter;\n\/\/ the deadline of the current timed waiter thread (only relevant if\n\/\/ g_has_timed_waiter is true)\nstatic grpc_millis g_timed_waiter_deadline;\n\/\/ generation counter to track which thread is waiting for the next timer\nstatic uint64_t g_timed_waiter_generation;\n\nstatic void timer_thread(void* completed_thread_ptr);\n\n\/\/ For debug of the timer manager crash only.\n\/\/ TODO (mxyan): remove after bug is fixed.\n#ifdef GRPC_DEBUG_TIMER_MANAGER\nextern int64_t g_timer_manager_init_count;\nextern int64_t g_timer_manager_shutdown_count;\nextern int64_t g_fork_count;\nextern int64_t g_timer_wait_err;\n#endif  \/\/ GRPC_DEBUG_TIMER_MANAGER\n\nstatic void gc_completed_threads(void) {\n  if (g_completed_threads != nullptr) {\n    completed_thread* to_gc = g_completed_threads;\n    g_completed_threads = nullptr;\n    gpr_mu_unlock(&g_mu);\n    while (to_gc != nullptr) {\n      to_gc->thd.Join();\n      completed_thread* next = to_gc->next;\n      gpr_free(to_gc);\n      to_gc = next;\n    }\n    gpr_mu_lock(&g_mu);\n  }\n}\n\nstatic void start_timer_thread_and_unlock(void) {\n  GPR_ASSERT(g_threaded);\n  ++g_waiter_count;\n  ++g_thread_count;\n  gpr_mu_unlock(&g_mu);\n  if (grpc_timer_check_trace.enabled()) {\n    gpr_log(GPR_INFO, \"Spawn timer thread\");\n  }\n  completed_thread* ct =\n      static_cast<completed_thread*>(gpr_malloc(sizeof(*ct)));\n  ct->thd = grpc_core::Thread(\"grpc_global_timer\", timer_thread, ct);\n  ct->thd.Start();\n}\n\nvoid grpc_timer_manager_tick() {\n  grpc_core::ExecCtx exec_ctx;\n  grpc_millis next = GRPC_MILLIS_INF_FUTURE;\n  grpc_timer_check(&next);\n}\n\nstatic void run_some_timers() {\n  \/\/ if there's something to execute...\n  gpr_mu_lock(&g_mu);\n  \/\/ remove a waiter from the pool, and start another thread if necessary\n  --g_waiter_count;\n  if (g_waiter_count == 0 && g_threaded) {\n    start_timer_thread_and_unlock();\n  } else {\n    \/\/ if there's no thread waiting with a timeout, kick an existing\n    \/\/ waiter so that the next deadline is not missed\n    if (!g_has_timed_waiter) {\n      if (grpc_timer_check_trace.enabled()) {\n        gpr_log(GPR_INFO, \"kick untimed waiter\");\n      }\n      gpr_cv_signal(&g_cv_wait);\n    }\n    gpr_mu_unlock(&g_mu);\n  }\n  \/\/ without our lock, flush the exec_ctx\n  if (grpc_timer_check_trace.enabled()) {\n    gpr_log(GPR_INFO, \"flush exec_ctx\");\n  }\n  grpc_core::ExecCtx::Get()->Flush();\n  gpr_mu_lock(&g_mu);\n  \/\/ garbage collect any threads hanging out that are dead\n  gc_completed_threads();\n  \/\/ get ready to wait again\n  ++g_waiter_count;\n  gpr_mu_unlock(&g_mu);\n}\n\n\/\/ wait until 'next' (or forever if there is already a timed waiter in the pool)\n\/\/ returns true if the thread should continue executing (false if it should\n\/\/ shutdown)\nstatic bool wait_until(grpc_millis next) {\n  gpr_mu_lock(&g_mu);\n  \/\/ if we're not threaded anymore, leave\n  if (!g_threaded) {\n    gpr_mu_unlock(&g_mu);\n    return false;\n  }\n\n  \/\/ If g_kicked is true at this point, it means there was a kick from the timer\n  \/\/ system that the timer-manager threads here missed. We cannot trust 'next'\n  \/\/ here any longer (since there might be an earlier deadline). So if g_kicked\n  \/\/ is true at this point, we should quickly exit this and get the next\n  \/\/ deadline from the timer system\n\n  if (!g_kicked) {\n    \/\/ if there's no timed waiter, we should become one: that waiter waits\n    \/\/ only until the next timer should expire. All other timers wait forever\n    \/\/\n    \/\/ 'g_timed_waiter_generation' is a global generation counter. The idea here\n    \/\/ is that the thread becoming a timed-waiter increments and stores this\n    \/\/ global counter locally in 'my_timed_waiter_generation' before going to\n    \/\/ sleep. After waking up, if my_timed_waiter_generation ==\n    \/\/ g_timed_waiter_generation, it can be sure that it was the timed_waiter\n    \/\/ thread (and that no other thread took over while this was asleep)\n    \/\/\n    \/\/ Initialize my_timed_waiter_generation to some value that is NOT equal to\n    \/\/ g_timed_waiter_generation\n    uint64_t my_timed_waiter_generation = g_timed_waiter_generation - 1;\n\n    \/* If there's no timed waiter, we should become one: that waiter waits only\n       until the next timer should expire. All other timer threads wait forever\n       unless their 'next' is earlier than the current timed-waiter's deadline\n       (in which case the thread with earlier 'next' takes over as the new timed\n       waiter) *\/\n    if (next != GRPC_MILLIS_INF_FUTURE) {\n      if (!g_has_timed_waiter || (next < g_timed_waiter_deadline)) {\n        my_timed_waiter_generation = ++g_timed_waiter_generation;\n        g_has_timed_waiter = true;\n        g_timed_waiter_deadline = next;\n\n        if (grpc_timer_check_trace.enabled()) {\n          grpc_millis wait_time = next - grpc_core::ExecCtx::Get()->Now();\n          gpr_log(GPR_INFO, \"sleep for a %\" PRId64 \" milliseconds\", wait_time);\n        }\n      } else {  \/\/ g_timed_waiter == true && next >= g_timed_waiter_deadline\n        next = GRPC_MILLIS_INF_FUTURE;\n      }\n    }\n\n    if (grpc_timer_check_trace.enabled() && next == GRPC_MILLIS_INF_FUTURE) {\n      gpr_log(GPR_INFO, \"sleep until kicked\");\n    }\n\n    gpr_cv_wait(&g_cv_wait, &g_mu,\n                grpc_millis_to_timespec(next, GPR_CLOCK_MONOTONIC));\n\n    if (grpc_timer_check_trace.enabled()) {\n      gpr_log(GPR_INFO, \"wait ended: was_timed:%d kicked:%d\",\n              my_timed_waiter_generation == g_timed_waiter_generation,\n              g_kicked);\n    }\n    \/\/ if this was the timed waiter, then we need to check timers, and flag\n    \/\/ that there's now no timed waiter... we'll look for a replacement if\n    \/\/ there's work to do after checking timers (code above)\n    if (my_timed_waiter_generation == g_timed_waiter_generation) {\n      g_has_timed_waiter = false;\n      g_timed_waiter_deadline = GRPC_MILLIS_INF_FUTURE;\n    }\n  }\n\n  \/\/ if this was a kick from the timer system, consume it (and don't stop\n  \/\/ this thread yet)\n  if (g_kicked) {\n    grpc_timer_consume_kick();\n    g_kicked = false;\n  }\n\n  gpr_mu_unlock(&g_mu);\n  return true;\n}\n\nstatic void timer_main_loop() {\n  for (;;) {\n    grpc_millis next = GRPC_MILLIS_INF_FUTURE;\n    grpc_core::ExecCtx::Get()->InvalidateNow();\n\n    \/\/ check timer state, updates next to the next time to run a check\n    switch (grpc_timer_check(&next)) {\n      case GRPC_TIMERS_FIRED:\n        run_some_timers();\n        break;\n      case GRPC_TIMERS_NOT_CHECKED:\n        \/* This case only happens under contention, meaning more than one timer\n           manager thread checked timers concurrently.\n\n           If that happens, we're guaranteed that some other thread has just\n           checked timers, and this will avalanche into some other thread seeing\n           empty timers and doing a timed sleep.\n\n           Consequently, we can just sleep forever here and be happy at some\n           saved wakeup cycles. *\/\n        if (grpc_timer_check_trace.enabled()) {\n          gpr_log(GPR_INFO, \"timers not checked: expect another thread to\");\n        }\n        next = GRPC_MILLIS_INF_FUTURE;\n      \/* fall through *\/\n      case GRPC_TIMERS_CHECKED_AND_EMPTY:\n        if (!wait_until(next)) {\n          return;\n        }\n        break;\n    }\n  }\n}\n\nstatic void timer_thread_cleanup(completed_thread* ct) {\n  gpr_mu_lock(&g_mu);\n  \/\/ terminate the thread: drop the waiter count, thread count, and let whomever\n  \/\/ stopped the threading stuff know that we're done\n  --g_waiter_count;\n  --g_thread_count;\n  if (0 == g_thread_count) {\n    gpr_cv_signal(&g_cv_shutdown);\n  }\n  ct->next = g_completed_threads;\n  g_completed_threads = ct;\n  gpr_mu_unlock(&g_mu);\n  if (grpc_timer_check_trace.enabled()) {\n    gpr_log(GPR_INFO, \"End timer thread\");\n  }\n}\n\nstatic void timer_thread(void* completed_thread_ptr) {\n  \/\/ this threads exec_ctx: we try to run things through to completion here\n  \/\/ since it's easy to spin up new threads\n  grpc_core::ExecCtx exec_ctx(GRPC_EXEC_CTX_FLAG_IS_INTERNAL_THREAD);\n  timer_main_loop();\n\n  timer_thread_cleanup(static_cast<completed_thread*>(completed_thread_ptr));\n}\n\nstatic void start_threads(void) {\n  gpr_mu_lock(&g_mu);\n  if (!g_threaded) {\n    g_threaded = true;\n    start_timer_thread_and_unlock();\n  } else {\n    gpr_mu_unlock(&g_mu);\n  }\n}\n\nvoid grpc_timer_manager_init(void) {\n#ifdef GRPC_DEBUG_TIMER_MANAGER\n  \/\/ For debug of the timer manager crash only.\n  \/\/ TODO (mxyan): remove after bug is fixed.\n  g_timer_manager_init_count++;\n#endif\n  gpr_mu_init(&g_mu);\n  gpr_cv_init(&g_cv_wait);\n  gpr_cv_init(&g_cv_shutdown);\n  g_threaded = false;\n  g_thread_count = 0;\n  g_waiter_count = 0;\n  g_completed_threads = nullptr;\n\n  g_has_timed_waiter = false;\n  g_timed_waiter_deadline = GRPC_MILLIS_INF_FUTURE;\n\n  start_threads();\n}\n\nstatic void stop_threads(void) {\n  gpr_mu_lock(&g_mu);\n  if (grpc_timer_check_trace.enabled()) {\n    gpr_log(GPR_INFO, \"stop timer threads: threaded=%d\", g_threaded);\n  }\n  if (g_threaded) {\n    g_threaded = false;\n    gpr_cv_broadcast(&g_cv_wait);\n    if (grpc_timer_check_trace.enabled()) {\n      gpr_log(GPR_INFO, \"num timer threads: %d\", g_thread_count);\n    }\n    while (g_thread_count > 0) {\n      gpr_cv_wait(&g_cv_shutdown, &g_mu, gpr_inf_future(GPR_CLOCK_MONOTONIC));\n      if (grpc_timer_check_trace.enabled()) {\n        gpr_log(GPR_INFO, \"num timer threads: %d\", g_thread_count);\n      }\n      gc_completed_threads();\n    }\n  }\n  gpr_mu_unlock(&g_mu);\n}\n\nvoid grpc_timer_manager_shutdown(void) {\n#ifdef GRPC_DEBUG_TIMER_MANAGER\n  \/\/ For debug of the timer manager crash only.\n  \/\/ TODO (mxyan): remove after bug is fixed.\n  g_timer_manager_shutdown_count++;\n#endif\n  stop_threads();\n\n  gpr_mu_destroy(&g_mu);\n  gpr_cv_destroy(&g_cv_wait);\n  gpr_cv_destroy(&g_cv_shutdown);\n}\n\nvoid grpc_timer_manager_set_threading(bool threaded) {\n#ifdef GRPC_DEBUG_TIMER_MANAGER\n  \/\/ For debug of the timer manager crash only.\n  \/\/ TODO (mxyan): remove after bug is fixed.\n  g_fork_count++;\n#endif\n  if (threaded) {\n    start_threads();\n  } else {\n    stop_threads();\n  }\n}\n\nvoid grpc_kick_poller(void) {\n  gpr_mu_lock(&g_mu);\n  g_kicked = true;\n  g_has_timed_waiter = false;\n  g_timed_waiter_deadline = GRPC_MILLIS_INF_FUTURE;\n  ++g_timed_waiter_generation;\n  gpr_cv_signal(&g_cv_wait);\n  gpr_mu_unlock(&g_mu);\n}\n<commit_msg>Log init counter after the cv is initialized<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 <grpc\/support\/port_platform.h>\n\n#include <inttypes.h>\n\n#include <grpc\/support\/alloc.h>\n#include <grpc\/support\/log.h>\n\n#include \"src\/core\/lib\/debug\/trace.h\"\n#include \"src\/core\/lib\/gprpp\/thd.h\"\n#include \"src\/core\/lib\/iomgr\/timer.h\"\n#include \"src\/core\/lib\/iomgr\/timer_manager.h\"\n\nstruct completed_thread {\n  grpc_core::Thread thd;\n  completed_thread* next;\n};\n\nextern grpc_core::TraceFlag grpc_timer_check_trace;\n\n\/\/ global mutex\nstatic gpr_mu g_mu;\n\/\/ are we multi-threaded\nstatic bool g_threaded;\n\/\/ cv to wait until a thread is needed\nstatic gpr_cv g_cv_wait;\n\/\/ cv for notification when threading ends\nstatic gpr_cv g_cv_shutdown;\n\/\/ number of threads in the system\nstatic int g_thread_count;\n\/\/ number of threads sitting around waiting\nstatic int g_waiter_count;\n\/\/ linked list of threads that have completed (and need joining)\nstatic completed_thread* g_completed_threads;\n\/\/ was the manager kicked by the timer system\nstatic bool g_kicked;\n\/\/ is there a thread waiting until the next timer should fire?\nstatic bool g_has_timed_waiter;\n\/\/ the deadline of the current timed waiter thread (only relevant if\n\/\/ g_has_timed_waiter is true)\nstatic grpc_millis g_timed_waiter_deadline;\n\/\/ generation counter to track which thread is waiting for the next timer\nstatic uint64_t g_timed_waiter_generation;\n\nstatic void timer_thread(void* completed_thread_ptr);\n\n\/\/ For debug of the timer manager crash only.\n\/\/ TODO (mxyan): remove after bug is fixed.\n#ifdef GRPC_DEBUG_TIMER_MANAGER\nextern int64_t g_timer_manager_init_count;\nextern int64_t g_timer_manager_shutdown_count;\nextern int64_t g_fork_count;\nextern int64_t g_timer_wait_err;\n#endif  \/\/ GRPC_DEBUG_TIMER_MANAGER\n\nstatic void gc_completed_threads(void) {\n  if (g_completed_threads != nullptr) {\n    completed_thread* to_gc = g_completed_threads;\n    g_completed_threads = nullptr;\n    gpr_mu_unlock(&g_mu);\n    while (to_gc != nullptr) {\n      to_gc->thd.Join();\n      completed_thread* next = to_gc->next;\n      gpr_free(to_gc);\n      to_gc = next;\n    }\n    gpr_mu_lock(&g_mu);\n  }\n}\n\nstatic void start_timer_thread_and_unlock(void) {\n  GPR_ASSERT(g_threaded);\n  ++g_waiter_count;\n  ++g_thread_count;\n  gpr_mu_unlock(&g_mu);\n  if (grpc_timer_check_trace.enabled()) {\n    gpr_log(GPR_INFO, \"Spawn timer thread\");\n  }\n  completed_thread* ct =\n      static_cast<completed_thread*>(gpr_malloc(sizeof(*ct)));\n  ct->thd = grpc_core::Thread(\"grpc_global_timer\", timer_thread, ct);\n  ct->thd.Start();\n}\n\nvoid grpc_timer_manager_tick() {\n  grpc_core::ExecCtx exec_ctx;\n  grpc_millis next = GRPC_MILLIS_INF_FUTURE;\n  grpc_timer_check(&next);\n}\n\nstatic void run_some_timers() {\n  \/\/ if there's something to execute...\n  gpr_mu_lock(&g_mu);\n  \/\/ remove a waiter from the pool, and start another thread if necessary\n  --g_waiter_count;\n  if (g_waiter_count == 0 && g_threaded) {\n    start_timer_thread_and_unlock();\n  } else {\n    \/\/ if there's no thread waiting with a timeout, kick an existing\n    \/\/ waiter so that the next deadline is not missed\n    if (!g_has_timed_waiter) {\n      if (grpc_timer_check_trace.enabled()) {\n        gpr_log(GPR_INFO, \"kick untimed waiter\");\n      }\n      gpr_cv_signal(&g_cv_wait);\n    }\n    gpr_mu_unlock(&g_mu);\n  }\n  \/\/ without our lock, flush the exec_ctx\n  if (grpc_timer_check_trace.enabled()) {\n    gpr_log(GPR_INFO, \"flush exec_ctx\");\n  }\n  grpc_core::ExecCtx::Get()->Flush();\n  gpr_mu_lock(&g_mu);\n  \/\/ garbage collect any threads hanging out that are dead\n  gc_completed_threads();\n  \/\/ get ready to wait again\n  ++g_waiter_count;\n  gpr_mu_unlock(&g_mu);\n}\n\n\/\/ wait until 'next' (or forever if there is already a timed waiter in the pool)\n\/\/ returns true if the thread should continue executing (false if it should\n\/\/ shutdown)\nstatic bool wait_until(grpc_millis next) {\n  gpr_mu_lock(&g_mu);\n  \/\/ if we're not threaded anymore, leave\n  if (!g_threaded) {\n    gpr_mu_unlock(&g_mu);\n    return false;\n  }\n\n  \/\/ If g_kicked is true at this point, it means there was a kick from the timer\n  \/\/ system that the timer-manager threads here missed. We cannot trust 'next'\n  \/\/ here any longer (since there might be an earlier deadline). So if g_kicked\n  \/\/ is true at this point, we should quickly exit this and get the next\n  \/\/ deadline from the timer system\n\n  if (!g_kicked) {\n    \/\/ if there's no timed waiter, we should become one: that waiter waits\n    \/\/ only until the next timer should expire. All other timers wait forever\n    \/\/\n    \/\/ 'g_timed_waiter_generation' is a global generation counter. The idea here\n    \/\/ is that the thread becoming a timed-waiter increments and stores this\n    \/\/ global counter locally in 'my_timed_waiter_generation' before going to\n    \/\/ sleep. After waking up, if my_timed_waiter_generation ==\n    \/\/ g_timed_waiter_generation, it can be sure that it was the timed_waiter\n    \/\/ thread (and that no other thread took over while this was asleep)\n    \/\/\n    \/\/ Initialize my_timed_waiter_generation to some value that is NOT equal to\n    \/\/ g_timed_waiter_generation\n    uint64_t my_timed_waiter_generation = g_timed_waiter_generation - 1;\n\n    \/* If there's no timed waiter, we should become one: that waiter waits only\n       until the next timer should expire. All other timer threads wait forever\n       unless their 'next' is earlier than the current timed-waiter's deadline\n       (in which case the thread with earlier 'next' takes over as the new timed\n       waiter) *\/\n    if (next != GRPC_MILLIS_INF_FUTURE) {\n      if (!g_has_timed_waiter || (next < g_timed_waiter_deadline)) {\n        my_timed_waiter_generation = ++g_timed_waiter_generation;\n        g_has_timed_waiter = true;\n        g_timed_waiter_deadline = next;\n\n        if (grpc_timer_check_trace.enabled()) {\n          grpc_millis wait_time = next - grpc_core::ExecCtx::Get()->Now();\n          gpr_log(GPR_INFO, \"sleep for a %\" PRId64 \" milliseconds\", wait_time);\n        }\n      } else {  \/\/ g_timed_waiter == true && next >= g_timed_waiter_deadline\n        next = GRPC_MILLIS_INF_FUTURE;\n      }\n    }\n\n    if (grpc_timer_check_trace.enabled() && next == GRPC_MILLIS_INF_FUTURE) {\n      gpr_log(GPR_INFO, \"sleep until kicked\");\n    }\n\n    gpr_cv_wait(&g_cv_wait, &g_mu,\n                grpc_millis_to_timespec(next, GPR_CLOCK_MONOTONIC));\n\n    if (grpc_timer_check_trace.enabled()) {\n      gpr_log(GPR_INFO, \"wait ended: was_timed:%d kicked:%d\",\n              my_timed_waiter_generation == g_timed_waiter_generation,\n              g_kicked);\n    }\n    \/\/ if this was the timed waiter, then we need to check timers, and flag\n    \/\/ that there's now no timed waiter... we'll look for a replacement if\n    \/\/ there's work to do after checking timers (code above)\n    if (my_timed_waiter_generation == g_timed_waiter_generation) {\n      g_has_timed_waiter = false;\n      g_timed_waiter_deadline = GRPC_MILLIS_INF_FUTURE;\n    }\n  }\n\n  \/\/ if this was a kick from the timer system, consume it (and don't stop\n  \/\/ this thread yet)\n  if (g_kicked) {\n    grpc_timer_consume_kick();\n    g_kicked = false;\n  }\n\n  gpr_mu_unlock(&g_mu);\n  return true;\n}\n\nstatic void timer_main_loop() {\n  for (;;) {\n    grpc_millis next = GRPC_MILLIS_INF_FUTURE;\n    grpc_core::ExecCtx::Get()->InvalidateNow();\n\n    \/\/ check timer state, updates next to the next time to run a check\n    switch (grpc_timer_check(&next)) {\n      case GRPC_TIMERS_FIRED:\n        run_some_timers();\n        break;\n      case GRPC_TIMERS_NOT_CHECKED:\n        \/* This case only happens under contention, meaning more than one timer\n           manager thread checked timers concurrently.\n\n           If that happens, we're guaranteed that some other thread has just\n           checked timers, and this will avalanche into some other thread seeing\n           empty timers and doing a timed sleep.\n\n           Consequently, we can just sleep forever here and be happy at some\n           saved wakeup cycles. *\/\n        if (grpc_timer_check_trace.enabled()) {\n          gpr_log(GPR_INFO, \"timers not checked: expect another thread to\");\n        }\n        next = GRPC_MILLIS_INF_FUTURE;\n      \/* fall through *\/\n      case GRPC_TIMERS_CHECKED_AND_EMPTY:\n        if (!wait_until(next)) {\n          return;\n        }\n        break;\n    }\n  }\n}\n\nstatic void timer_thread_cleanup(completed_thread* ct) {\n  gpr_mu_lock(&g_mu);\n  \/\/ terminate the thread: drop the waiter count, thread count, and let whomever\n  \/\/ stopped the threading stuff know that we're done\n  --g_waiter_count;\n  --g_thread_count;\n  if (0 == g_thread_count) {\n    gpr_cv_signal(&g_cv_shutdown);\n  }\n  ct->next = g_completed_threads;\n  g_completed_threads = ct;\n  gpr_mu_unlock(&g_mu);\n  if (grpc_timer_check_trace.enabled()) {\n    gpr_log(GPR_INFO, \"End timer thread\");\n  }\n}\n\nstatic void timer_thread(void* completed_thread_ptr) {\n  \/\/ this threads exec_ctx: we try to run things through to completion here\n  \/\/ since it's easy to spin up new threads\n  grpc_core::ExecCtx exec_ctx(GRPC_EXEC_CTX_FLAG_IS_INTERNAL_THREAD);\n  timer_main_loop();\n\n  timer_thread_cleanup(static_cast<completed_thread*>(completed_thread_ptr));\n}\n\nstatic void start_threads(void) {\n  gpr_mu_lock(&g_mu);\n  if (!g_threaded) {\n    g_threaded = true;\n    start_timer_thread_and_unlock();\n  } else {\n    gpr_mu_unlock(&g_mu);\n  }\n}\n\nvoid grpc_timer_manager_init(void) {\n  gpr_mu_init(&g_mu);\n  gpr_cv_init(&g_cv_wait);\n#ifdef GRPC_DEBUG_TIMER_MANAGER\n  \/\/ For debug of the timer manager crash only.\n  \/\/ TODO (mxyan): remove after bug is fixed.\n  g_timer_manager_init_count++;\n#endif\n  gpr_cv_init(&g_cv_shutdown);\n  g_threaded = false;\n  g_thread_count = 0;\n  g_waiter_count = 0;\n  g_completed_threads = nullptr;\n\n  g_has_timed_waiter = false;\n  g_timed_waiter_deadline = GRPC_MILLIS_INF_FUTURE;\n\n  start_threads();\n}\n\nstatic void stop_threads(void) {\n  gpr_mu_lock(&g_mu);\n  if (grpc_timer_check_trace.enabled()) {\n    gpr_log(GPR_INFO, \"stop timer threads: threaded=%d\", g_threaded);\n  }\n  if (g_threaded) {\n    g_threaded = false;\n    gpr_cv_broadcast(&g_cv_wait);\n    if (grpc_timer_check_trace.enabled()) {\n      gpr_log(GPR_INFO, \"num timer threads: %d\", g_thread_count);\n    }\n    while (g_thread_count > 0) {\n      gpr_cv_wait(&g_cv_shutdown, &g_mu, gpr_inf_future(GPR_CLOCK_MONOTONIC));\n      if (grpc_timer_check_trace.enabled()) {\n        gpr_log(GPR_INFO, \"num timer threads: %d\", g_thread_count);\n      }\n      gc_completed_threads();\n    }\n  }\n  gpr_mu_unlock(&g_mu);\n}\n\nvoid grpc_timer_manager_shutdown(void) {\n#ifdef GRPC_DEBUG_TIMER_MANAGER\n  \/\/ For debug of the timer manager crash only.\n  \/\/ TODO (mxyan): remove after bug is fixed.\n  g_timer_manager_shutdown_count++;\n#endif\n  stop_threads();\n\n  gpr_mu_destroy(&g_mu);\n  gpr_cv_destroy(&g_cv_wait);\n  gpr_cv_destroy(&g_cv_shutdown);\n}\n\nvoid grpc_timer_manager_set_threading(bool threaded) {\n#ifdef GRPC_DEBUG_TIMER_MANAGER\n  \/\/ For debug of the timer manager crash only.\n  \/\/ TODO (mxyan): remove after bug is fixed.\n  g_fork_count++;\n#endif\n  if (threaded) {\n    start_threads();\n  } else {\n    stop_threads();\n  }\n}\n\nvoid grpc_kick_poller(void) {\n  gpr_mu_lock(&g_mu);\n  g_kicked = true;\n  g_has_timed_waiter = false;\n  g_timed_waiter_deadline = GRPC_MILLIS_INF_FUTURE;\n  ++g_timed_waiter_generation;\n  gpr_cv_signal(&g_cv_wait);\n  gpr_mu_unlock(&g_mu);\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n#include <boost\/container\/flat_map.hpp>\n#include <boost\/filesystem\/path.hpp>\n#include <boost\/iostreams\/device\/mapped_file.hpp>\n#include <fc\/io\/cfile.hpp>\n#include <fc\/io\/datastream.hpp>\n#include <regex>\n\nnamespace eosio {\nnamespace chain {\n\nnamespace bfs = bfs;\n\ntemplate <typename Lambda>\nvoid for_each_file_in_dir_matches(const bfs::path& dir, std::string pattern, Lambda&& lambda) {\n   const std::regex        my_filter(pattern);\n   std::smatch             what;\n   bfs::directory_iterator end_itr; \/\/ Default ctor yields past-the-end\n   for (bfs::directory_iterator p(dir); p != end_itr; ++p) {\n      \/\/ Skip if not a file\n      if (!bfs::is_regular_file(p->status()))\n         continue;\n      \/\/ skip if it's not match blocks-*-*.log\n      if (!std::regex_match(p->path().filename().string(), what, my_filter))\n         continue;\n      lambda(p->path());\n   }\n}\n\nstruct null_verifier {\n   template <typename LogData>\n   void verify(const LogData&, const bfs::path&) {}\n};\n\ntemplate <typename LogData, typename LogIndex, typename LogVerifier = null_verifier>\nstruct log_catalog {\n   using block_num_t = uint32_t;\n\n   struct mapped_type {\n      block_num_t last_block_num;\n      bfs::path   filename_base;\n   };\n   using collection_t              = boost::container::flat_map<block_num_t, mapped_type>;\n   using size_type                 = typename collection_t::size_type;\n   static constexpr size_type npos = std::numeric_limits<size_type>::max();\n\n   using mapmode = boost::iostreams::mapped_file::mapmode;\n\n   bfs::path    archive_dir;\n   size_type    max_retained_files = 10;\n   collection_t collection;\n   size_type    active_index = npos;\n   LogData      log_data;\n   LogIndex     log_index;\n   LogVerifier  verifier;\n\n   bool empty() const { return collection.empty(); }\n\n   uint32_t first_block_num() const {\n      if (empty())\n         return 0;\n      return collection.begin()->first;\n   }\n\n   void open(const bfs::path& log_dir, const bfs::path& archive_dir, const char* name,\n             const char* suffix_pattern = R\"(-\\d+-\\d+\\.log)\") {\n\n      if (!archive_dir.empty()) {\n         if (archive_dir.is_relative())\n            this->archive_dir = log_dir \/ archive_dir;\n         else\n            this->archive_dir = archive_dir;\n\n         if (!bfs::is_directory(this->archive_dir))\n            bfs::create_directories(this->archive_dir);\n      }\n\n      for_each_file_in_dir_matches(log_dir, std::string(name) + suffix_pattern, [this](bfs::path path) {\n         auto log_path               = path;\n         auto index_path             = path.replace_extension(\"index\");\n         auto path_without_extension = log_path.parent_path() \/ log_path.stem().string();\n\n         LogData log(log_path);\n\n         verifier.verify(log, log_path);\n\n         \/\/ check if index file matches the log file\n         if (!index_matches_data(index_path, log))\n            log.construct_index(index_path);\n\n         auto existing_itr = collection.find(log.first_block_num());\n         if (existing_itr != collection.end()) {\n            if (log.last_block_num() <= existing_itr->second.last_block_num) {\n               wlog(\"${log_path} contains the overlapping range with ${existing_path}.log, droping ${log_path} \"\n                    \"from catelog\",\n                    (\"log_path\", log_path.string())(\"existing_path\", existing_itr->second.filename_base.string()));\n               return;\n            } else {\n               wlog(\n                   \"${log_path} contains the overlapping range with ${existing_path}.log, droping ${existing_path}.log \"\n                   \"from catelog\",\n                   (\"log_path\", log_path.string())(\"existing_path\", existing_itr->second.filename_base.string()));\n            }\n         }\n\n         collection.insert_or_assign(log.first_block_num(), mapped_type{log.last_block_num(), path_without_extension});\n      });\n   }\n\n   bool index_matches_data(const bfs::path& index_path, const LogData& log) const {\n      if (bfs::exists(index_path) && bfs::file_size(index_path) \/ sizeof(uint64_t) != log.num_blocks()) {\n         \/\/ make sure the last 8 bytes of index and log matches\n\n         fc::cfile index_file;\n         index_file.set_file_path(index_path);\n         index_file.open(\"r\");\n         index_file.seek_end(-sizeof(uint64_t));\n         uint64_t pos;\n         index_file.read(reinterpret_cast<char*>(&pos), sizeof(pos));\n         return pos == log.last_block_position();\n      }\n      return false;\n   }\n\n   std::string filebase_for_block(uint32_t block_num) {\n      if (collection.empty() || block_num < collection.begin()->first)\n         return \"\";\n      auto it = --collection.upper_bound(block_num);\n\n      if (block_num <= it->second.last_block_num)\n         return it->second.filename_base;\n      return \"\";\n   }\n\n   bool set_active_item(uint32_t block_num, mapmode mode = mapmode::readonly) {\n      try {\n         if (active_index != npos) {\n            auto active_item = collection.nth(active_index);\n            if (active_item->first <= block_num && block_num <= active_item->second.last_block_num &&\n                log_data.flags() == mode) {\n               return true;\n            }\n         }\n         if (collection.empty() || block_num < collection.begin()->first)\n            return false;\n\n         auto it = --collection.upper_bound(block_num);\n\n         if (block_num <= it->second.last_block_num) {\n            auto name = it->second.filename_base;\n            log_data.open(name.replace_extension(\"log\"), mode);\n            log_index.open(name.replace_extension(\"index\"));\n            this->active_index = collection.index_of(it);\n            return true;\n         }\n         return false;\n      } catch (...) {\n         this->active_index = npos;\n         return false;\n      }\n   }\n\n   std::pair<fc::datastream<const char*>, uint32_t> ro_stream_for_block(uint32_t block_num) {\n      if (set_active_item(block_num, mapmode::readonly)) {\n         auto pos = log_index.nth_block_position(block_num - log_data.first_block_num());\n         return std::make_pair(log_data.ro_stream_at(pos), log_data.version());\n      }\n      return {fc::datastream<const char*>(nullptr, 0), static_cast<uint32_t>(0)};\n   }\n\n   std::pair<fc::datastream<char*>, uint32_t> rw_stream_for_block(uint32_t block_num) {\n      if (set_active_item(block_num, mapmode::readwrite)) {\n         auto pos = log_index.nth_block_position(block_num - log_data.first_block_num());\n         return std::make_pair(log_data.rw_stream_at(pos), log_data.version());\n      }\n      return {fc::datastream<char*>(nullptr, 0), static_cast<uint32_t>(0)};\n   }\n\n   std::optional<block_id_type> id_for_block(uint32_t block_num) {\n      if (set_active_item(block_num, mapmode::readonly)) {\n         auto pos = log_index.nth_block_position(block_num - log_data.first_block_num());\n         return log_data.block_id_at(pos);\n      }\n      return {};\n   }\n\n   static void rename_bundle(bfs::path orig_path, bfs::path new_path) {\n      bfs::rename(orig_path.replace_extension(\".log\"), new_path.replace_extension(\".log\"));\n      bfs::rename(orig_path.replace_extension(\".index\"), new_path.replace_extension(\".index\"));\n   }\n\n   \/\/\/ Add a new entry into the catalog.\n   \/\/\/\n   \/\/\/ Notice that \\c start_block_num must be monotonically increasing between the invocations of this function\n   \/\/\/ so that the new entry would be inserted at the end of the flat_map; otherwise, \\c active_index would be\n   \/\/\/ invalidated and the mapping between the log data their block range would be wrong. This function is only used\n   \/\/\/ during the splitting of block log. Using this function for other purpose should make sure if the monotonically\n   \/\/\/ increasing block num guarantee can be met.\n   void add(uint32_t start_block_num, uint32_t end_block_num, const bfs::path& dir, const char* name) {\n\n      const int bufsize = 64;\n      char      buf[bufsize];\n      snprintf(buf, bufsize, \"%s-%d-%d\", name, start_block_num, end_block_num);\n      bfs::path new_path = dir \/ buf;\n      rename_bundle(dir \/ name, new_path);\n\n      if (this->collection.size() >= max_retained_files) {\n         auto items_to_erase =\n             max_retained_files > 0 ? this->collection.size() - max_retained_files + 1 : this->collection.size();\n         for (auto it = this->collection.begin(); it < this->collection.begin() + items_to_erase; ++it) {\n            auto orig_name = it->second.filename_base;\n            if (archive_dir.empty()) {\n               \/\/ delete the old files when no backup dir is specified\n               bfs::remove(orig_name.replace_extension(\"log\"));\n               bfs::remove(orig_name.replace_extension(\"index\"));\n            } else {\n               \/\/ move the the archive dir\n               rename_bundle(orig_name, archive_dir\/orig_name.filename() );\n            }\n         }\n         this->collection.erase(this->collection.begin(), this->collection.begin() + items_to_erase);\n         this->active_index = this->active_index == npos || this->active_index < items_to_erase\n                                  ? npos\n                                  : this->active_index - items_to_erase;\n      }\n      if (max_retained_files > 0)\n         this->collection.emplace(start_block_num, mapped_type{end_block_num, new_path});\n   }\n};\n\n} \/\/ namespace chain\n} \/\/ namespace eosio<commit_msg>fix namespace problem<commit_after>#pragma once\n#include <boost\/container\/flat_map.hpp>\n#include <boost\/filesystem\/path.hpp>\n#include <boost\/iostreams\/device\/mapped_file.hpp>\n#include <fc\/io\/cfile.hpp>\n#include <fc\/io\/datastream.hpp>\n#include <regex>\n\nnamespace eosio {\nnamespace chain {\n\nnamespace bfs = boost::filesystem;\n\ntemplate <typename Lambda>\nvoid for_each_file_in_dir_matches(const bfs::path& dir, std::string pattern, Lambda&& lambda) {\n   const std::regex        my_filter(pattern);\n   std::smatch             what;\n   bfs::directory_iterator end_itr; \/\/ Default ctor yields past-the-end\n   for (bfs::directory_iterator p(dir); p != end_itr; ++p) {\n      \/\/ Skip if not a file\n      if (!bfs::is_regular_file(p->status()))\n         continue;\n      \/\/ skip if it's not match blocks-*-*.log\n      if (!std::regex_match(p->path().filename().string(), what, my_filter))\n         continue;\n      lambda(p->path());\n   }\n}\n\nstruct null_verifier {\n   template <typename LogData>\n   void verify(const LogData&, const bfs::path&) {}\n};\n\ntemplate <typename LogData, typename LogIndex, typename LogVerifier = null_verifier>\nstruct log_catalog {\n   using block_num_t = uint32_t;\n\n   struct mapped_type {\n      block_num_t last_block_num;\n      bfs::path   filename_base;\n   };\n   using collection_t              = boost::container::flat_map<block_num_t, mapped_type>;\n   using size_type                 = typename collection_t::size_type;\n   static constexpr size_type npos = std::numeric_limits<size_type>::max();\n\n   using mapmode = boost::iostreams::mapped_file::mapmode;\n\n   bfs::path    archive_dir;\n   size_type    max_retained_files = 10;\n   collection_t collection;\n   size_type    active_index = npos;\n   LogData      log_data;\n   LogIndex     log_index;\n   LogVerifier  verifier;\n\n   bool empty() const { return collection.empty(); }\n\n   uint32_t first_block_num() const {\n      if (empty())\n         return 0;\n      return collection.begin()->first;\n   }\n\n   void open(const bfs::path& log_dir, const bfs::path& archive_dir, const char* name,\n             const char* suffix_pattern = R\"(-\\d+-\\d+\\.log)\") {\n\n      if (!archive_dir.empty()) {\n         if (archive_dir.is_relative())\n            this->archive_dir = log_dir \/ archive_dir;\n         else\n            this->archive_dir = archive_dir;\n\n         if (!bfs::is_directory(this->archive_dir))\n            bfs::create_directories(this->archive_dir);\n      }\n\n      for_each_file_in_dir_matches(log_dir, std::string(name) + suffix_pattern, [this](bfs::path path) {\n         auto log_path               = path;\n         auto index_path             = path.replace_extension(\"index\");\n         auto path_without_extension = log_path.parent_path() \/ log_path.stem().string();\n\n         LogData log(log_path);\n\n         verifier.verify(log, log_path);\n\n         \/\/ check if index file matches the log file\n         if (!index_matches_data(index_path, log))\n            log.construct_index(index_path);\n\n         auto existing_itr = collection.find(log.first_block_num());\n         if (existing_itr != collection.end()) {\n            if (log.last_block_num() <= existing_itr->second.last_block_num) {\n               wlog(\"${log_path} contains the overlapping range with ${existing_path}.log, droping ${log_path} \"\n                    \"from catelog\",\n                    (\"log_path\", log_path.string())(\"existing_path\", existing_itr->second.filename_base.string()));\n               return;\n            } else {\n               wlog(\n                   \"${log_path} contains the overlapping range with ${existing_path}.log, droping ${existing_path}.log \"\n                   \"from catelog\",\n                   (\"log_path\", log_path.string())(\"existing_path\", existing_itr->second.filename_base.string()));\n            }\n         }\n\n         collection.insert_or_assign(log.first_block_num(), mapped_type{log.last_block_num(), path_without_extension});\n      });\n   }\n\n   bool index_matches_data(const bfs::path& index_path, const LogData& log) const {\n      if (bfs::exists(index_path) && bfs::file_size(index_path) \/ sizeof(uint64_t) != log.num_blocks()) {\n         \/\/ make sure the last 8 bytes of index and log matches\n\n         fc::cfile index_file;\n         index_file.set_file_path(index_path);\n         index_file.open(\"r\");\n         index_file.seek_end(-sizeof(uint64_t));\n         uint64_t pos;\n         index_file.read(reinterpret_cast<char*>(&pos), sizeof(pos));\n         return pos == log.last_block_position();\n      }\n      return false;\n   }\n\n   std::string filebase_for_block(uint32_t block_num) {\n      if (collection.empty() || block_num < collection.begin()->first)\n         return \"\";\n      auto it = --collection.upper_bound(block_num);\n\n      if (block_num <= it->second.last_block_num)\n         return it->second.filename_base;\n      return \"\";\n   }\n\n   bool set_active_item(uint32_t block_num, mapmode mode = mapmode::readonly) {\n      try {\n         if (active_index != npos) {\n            auto active_item = collection.nth(active_index);\n            if (active_item->first <= block_num && block_num <= active_item->second.last_block_num &&\n                log_data.flags() == mode) {\n               return true;\n            }\n         }\n         if (collection.empty() || block_num < collection.begin()->first)\n            return false;\n\n         auto it = --collection.upper_bound(block_num);\n\n         if (block_num <= it->second.last_block_num) {\n            auto name = it->second.filename_base;\n            log_data.open(name.replace_extension(\"log\"), mode);\n            log_index.open(name.replace_extension(\"index\"));\n            this->active_index = collection.index_of(it);\n            return true;\n         }\n         return false;\n      } catch (...) {\n         this->active_index = npos;\n         return false;\n      }\n   }\n\n   std::pair<fc::datastream<const char*>, uint32_t> ro_stream_for_block(uint32_t block_num) {\n      if (set_active_item(block_num, mapmode::readonly)) {\n         auto pos = log_index.nth_block_position(block_num - log_data.first_block_num());\n         return std::make_pair(log_data.ro_stream_at(pos), log_data.version());\n      }\n      return {fc::datastream<const char*>(nullptr, 0), static_cast<uint32_t>(0)};\n   }\n\n   std::pair<fc::datastream<char*>, uint32_t> rw_stream_for_block(uint32_t block_num) {\n      if (set_active_item(block_num, mapmode::readwrite)) {\n         auto pos = log_index.nth_block_position(block_num - log_data.first_block_num());\n         return std::make_pair(log_data.rw_stream_at(pos), log_data.version());\n      }\n      return {fc::datastream<char*>(nullptr, 0), static_cast<uint32_t>(0)};\n   }\n\n   std::optional<block_id_type> id_for_block(uint32_t block_num) {\n      if (set_active_item(block_num, mapmode::readonly)) {\n         auto pos = log_index.nth_block_position(block_num - log_data.first_block_num());\n         return log_data.block_id_at(pos);\n      }\n      return {};\n   }\n\n   static void rename_bundle(bfs::path orig_path, bfs::path new_path) {\n      bfs::rename(orig_path.replace_extension(\".log\"), new_path.replace_extension(\".log\"));\n      bfs::rename(orig_path.replace_extension(\".index\"), new_path.replace_extension(\".index\"));\n   }\n\n   \/\/\/ Add a new entry into the catalog.\n   \/\/\/\n   \/\/\/ Notice that \\c start_block_num must be monotonically increasing between the invocations of this function\n   \/\/\/ so that the new entry would be inserted at the end of the flat_map; otherwise, \\c active_index would be\n   \/\/\/ invalidated and the mapping between the log data their block range would be wrong. This function is only used\n   \/\/\/ during the splitting of block log. Using this function for other purpose should make sure if the monotonically\n   \/\/\/ increasing block num guarantee can be met.\n   void add(uint32_t start_block_num, uint32_t end_block_num, const bfs::path& dir, const char* name) {\n\n      const int bufsize = 64;\n      char      buf[bufsize];\n      snprintf(buf, bufsize, \"%s-%d-%d\", name, start_block_num, end_block_num);\n      bfs::path new_path = dir \/ buf;\n      rename_bundle(dir \/ name, new_path);\n\n      if (this->collection.size() >= max_retained_files) {\n         auto items_to_erase =\n             max_retained_files > 0 ? this->collection.size() - max_retained_files + 1 : this->collection.size();\n         for (auto it = this->collection.begin(); it < this->collection.begin() + items_to_erase; ++it) {\n            auto orig_name = it->second.filename_base;\n            if (archive_dir.empty()) {\n               \/\/ delete the old files when no backup dir is specified\n               bfs::remove(orig_name.replace_extension(\"log\"));\n               bfs::remove(orig_name.replace_extension(\"index\"));\n            } else {\n               \/\/ move the the archive dir\n               rename_bundle(orig_name, archive_dir\/orig_name.filename() );\n            }\n         }\n         this->collection.erase(this->collection.begin(), this->collection.begin() + items_to_erase);\n         this->active_index = this->active_index == npos || this->active_index < items_to_erase\n                                  ? npos\n                                  : this->active_index - items_to_erase;\n      }\n      if (max_retained_files > 0)\n         this->collection.emplace(start_block_num, mapped_type{end_block_num, new_path});\n   }\n};\n\n} \/\/ namespace chain\n} \/\/ namespace eosio<|endoftext|>"}
{"text":"<commit_before>#include <gtest\/gtest.h>\n\n#ifdef __APPLE__\n#  include <libkern\/OSByteOrder.h>\n#  define htobe32(x) OSSwapHostToBigInt32(x)\n#  define htobe64(x) OSSwapHostToBigInt64(x)\n#else\n#  include <endian.h>\n#endif\n\n#include \"receiver.h\"\n#include \"stream.h\"\n\n#include <cstdio>\n#include <inttypes.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Test utility functions.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic struct Receiver* create_test_receiver()\n{\n    const int num_buffers_max = 1;\n    const int num_times_in_buffer = 4;\n    const int num_threads_recv = 1;\n    const int num_threads_write = 1;\n    const int num_streams = 1;\n    const unsigned short int port_start = 41000;\n    const int num_channels_per_file = 1;\n    const char* output_root = \"\";\n    struct Receiver* receiver = receiver_create(num_buffers_max,\n            num_times_in_buffer, num_threads_recv, num_threads_write,\n            num_streams, port_start, num_channels_per_file, output_root);\n    return receiver;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Tests.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nTEST(Receiver, test_create)\n{\n    struct Receiver* receiver = create_test_receiver();\n    ASSERT_TRUE(receiver != NULL);\n    receiver_free(receiver);\n}\n\nTEST(Stream, test_stream_decode)\n{\n    \/\/ Verify stream_decode() function can handle a simple SPEAD packet.\n\n    \/\/ SPEAD packet item IDs.\n    const unsigned int item_ids[] = {\n        0x1,    \/\/ Heap counter.\n        0x2,    \/\/ Heap size.\n        0x3     \/\/ Heap offset.\n    };\n\n    \/\/ Dummy values for items.\n    const int item_val[] = {\n        4,\n        10,\n        55\n    };\n    const unsigned int num_items = sizeof(item_ids) \/ sizeof(unsigned int);\n\n    \/\/ Allocate memory for a SPEAD packet.\n    unsigned char* buf = (unsigned char*) malloc(8 + num_items * 8);\n    ASSERT_TRUE(buf != NULL);\n\n    \/\/ Define SPEAD flavour.\n    const unsigned char heap_address_bits = 48;\n    const unsigned char item_id_bits = 64 - heap_address_bits - 1;\n\n    \/\/ Construct SPEAD packet header.\n    buf[0] = 'S';\n    buf[1] = 4;\n    buf[2] = (item_id_bits + 1) \/ 8;\n    buf[3] = heap_address_bits \/ 8;\n    buf[4] = 0;\n    buf[5] = 0;\n    buf[6] = 0;\n    buf[7] = (unsigned char) num_items;\n\n    \/\/ Construct SPEAD packet payload containing items in\n    \/\/ \"immediate addressing mode\".\n    uint64_t* items = (uint64_t*) &buf[8];\n    for (unsigned int i = 0; i < num_items; i++)\n    {\n        const uint64_t item_id = (uint64_t) item_ids[i];\n        const uint64_t item_addr_or_val = (uint64_t) item_val[i];\n        const uint64_t item =\n                (1ull << 63) |\n                (item_id << heap_address_bits) |\n                item_addr_or_val;\n        items[i] = htobe64(item);\n    }\n\n    \/\/ Create a test receiver.\n    struct Receiver* receiver = create_test_receiver();\n    ASSERT_TRUE(receiver != NULL);\n\n    \/\/ Call stream_decode().\n    stream_decode(receiver->streams[0], buf, 0);\n\n    \/\/ Clean up.\n    receiver_free(receiver);\n    free(buf);\n}\n\n\/\/ TEST(Stream, test_stream_receive)\n\/\/ {\n\/\/     \/* Verify stream_decode() function and verify if correct\n\/\/     data is received *\/\n\n\/\/     \/\/ ADD DESCRIPTOR AND OTHER IDS\n\/\/     \/\/ SPEAD packet item IDs.\n\/\/     const unsigned int item_ids[] = {\n\/\/         0x1,    \/\/ Heap counter.\n\/\/         0x2,    \/\/ Heap size.\n\/\/         0x3,    \/\/ Heap offset.\n\/\/         0x4,    \/\/ packet payload length\n\/\/         0x5,    \/\/ item descriptor\n\/\/         0x6,    \/\/ stream control\n\/\/         \/\/ 0x10,   \/\/ item descriptor: name\n\/\/         \/\/ 0x11,   \/\/ item descriptor: description\n\/\/         \/\/ 0x12,   \/\/ item descriptor: shape\n\/\/         \/\/ 0x13,   \/\/ item descriptor: type\n\/\/         \/\/ 0x14,   \/\/ item descriptor: ID\n\/\/         \/\/ 0x15,   \/\/ item descriptor: dtype  \n\/\/         0x6000, \/\/ Visibility timestamp count\n\/\/         0x6001, \/\/ Visibility timestamp fraction\n\/\/         0x6005, \/\/ Visibility baseline count\n\/\/         0x6008, \/\/ Scan ID \n\/\/         0x600A  \/\/ Visibility data \n\n\/\/     };\n\n\/\/     \/\/ NEED TO FIGURE OUT HOW TO DO FLOOR IN C\n\/\/     \/\/ ADD DESCRIPTOR AND OTHER VALUES\n\/\/     \/\/ int num_baselines = (512 * 513) \/\/ 2\n\/\/     \/\/ Dummy values for items.\n\n\/\/     \/\/ # Update values in the heap.\n\/\/     \/\/ item_group['visibility_timestamp_count'].value = 1\n\/\/     \/\/ item_group['visibility_timestamp_fraction'].value = 0\n\/\/     \/\/ item_group['visibility_baseline_count'].value = num_baselines\n\/\/     \/\/ item_group['scan_id'].value = 100000000\n\/\/     \/\/ item_group['correlator_output_data'].value = vis\n\n\/\/     \/\/ Alternative to this in C\n\/\/     \/\/ vis = numpy.zeros(shape=(num_baselines,), dtype=dtype)\n\n\/\/     const int item_val[] = {\n\/\/         4,\n\/\/         10,\n\/\/         55,\n\/\/         55,\n\/\/         0,\n\/\/         1,              \/\/ Visibility timestamp count\n\/\/         0,              \/\/ Visibility timestamp fraction    \n\/\/         \/\/ num_baselines,  \/\/ Visibility baseline count\n\/\/         100000000,      \/\/ Scan ID \n\/\/         \/\/ vis             \/\/ Visibility data \n\n\/\/         \/\/ 1,\n\/\/         \/\/ 0\n        \n\/\/     };\n\/\/     const unsigned int num_items = sizeof(item_ids) \/ sizeof(unsigned int);\n\n\/\/     \/\/ Allocate memory for a SPEAD packet.\n\/\/     unsigned char* buf = (unsigned char*) malloc(8 + num_items * 8);\n\/\/     ASSERT_TRUE(buf != NULL);\n\n\/\/     \/\/ Define SPEAD flavour.\n\/\/     const unsigned char heap_address_bits = 48;\n\/\/     const unsigned char item_id_bits = 64 - heap_address_bits - 1;\n\n\/\/     \/\/ Construct SPEAD packet header.\n\/\/     buf[0] = 'S';\n\/\/     buf[1] = 4;\n\/\/     buf[2] = (item_id_bits + 1) \/ 8;\n\/\/     buf[3] = heap_address_bits \/ 8;\n\/\/     buf[4] = 0;\n\/\/     buf[5] = 0;\n\/\/     buf[6] = 0;\n\/\/     buf[7] = (unsigned char) num_items;\n\n\/\/     \/\/ Construct SPEAD packet payload containing items in\n\/\/     \/\/ \"immediate addressing mode\".\n\/\/     uint64_t* items = (uint64_t*) &buf[8];\n\/\/     for (unsigned int i = 0; i < num_items; i++)\n\/\/     {\n\/\/         const uint64_t item_id = (uint64_t) item_ids[i];\n\/\/         const uint64_t item_addr_or_val = (uint64_t) item_val[i];\n\/\/         \/\/printf(\"Item Value: %i\\n\", item_val[i]);\n\/\/         const uint64_t item =\n\/\/                 (1ull << 63) |\n\/\/                 (item_id << heap_address_bits) |\n\/\/                 item_addr_or_val;\n\/\/         items[i] = htobe64(item);\n\/\/     }\n\n\/\/     \/\/ Create a test receiver.\n\/\/     struct Receiver* receiver = create_test_receiver();\n\/\/     ASSERT_TRUE(receiver != NULL);\n\n\/\/     \/\/ Call stream_decode().\n\/\/     stream_decode(receiver->streams[0], buf, 0);\n\/\/     printf(\"Heap count - %i\\n\", receiver->streams[0]->heap_count);\n\/\/     printf(\"BUffer Len - %i\\n\", receiver->streams[0]->buffer_len);\n\/\/     printf(\"Num buffers - %i\\n\", receiver->num_buffers);\n\/\/     printf(\"completed_streams - %i\\n\", receiver->completed_streams);\n\/\/     printf(\"max_num_buffers - %i\\n\", receiver->max_num_buffers);\n\/\/     printf(\"num_baselines - %i\\n\", receiver->num_baselines);\n\/\/     \/\/ printf(\"buffer_id - %i\\n\", receiver->buffers[0]->buffer_id);\n\/\/     \/\/ struct Buffer* buff = receiver->buffers[0];\n\/\/     \/\/ printf(\"Buf %i\", buff->buffer_id);\n\n\/\/     \/\/ Clean up.\n\/\/     receiver_free(receiver);\n\/\/     free(buf);\n\/\/ }<commit_msg>Changes to the test_stream_receive<commit_after>#include <gtest\/gtest.h>\n\n#ifdef __APPLE__\n#  include <libkern\/OSByteOrder.h>\n#  define htobe32(x) OSSwapHostToBigInt32(x)\n#  define htobe64(x) OSSwapHostToBigInt64(x)\n#else\n#  include <endian.h>\n#endif\n\n#include \"receiver.h\"\n#include \"stream.h\"\n\n#include <cstdio>\n#include <inttypes.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Test utility functions.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic struct Receiver* create_test_receiver()\n{\n    const int num_buffers_max = 1;\n    const int num_times_in_buffer = 4;\n    const int num_threads_recv = 1;\n    const int num_threads_write = 1;\n    const int num_streams = 1;\n    const unsigned short int port_start = 41000;\n    const int num_channels_per_file = 1;\n    const char* output_root = \"\";\n    struct Receiver* receiver = receiver_create(num_buffers_max,\n            num_times_in_buffer, num_threads_recv, num_threads_write,\n            num_streams, port_start, num_channels_per_file, output_root);\n    return receiver;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Tests.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nTEST(Receiver, test_create)\n{\n    struct Receiver* receiver = create_test_receiver();\n    ASSERT_TRUE(receiver != NULL);\n    receiver_free(receiver);\n}\n\nTEST(Stream, test_stream_decode)\n{\n    \/\/ Verify stream_decode() function can handle a simple SPEAD packet.\n\n    \/\/ SPEAD packet item IDs.\n    const unsigned int item_ids[] = {\n        0x1,    \/\/ Heap counter.\n        0x2,    \/\/ Heap size.\n        0x3     \/\/ Heap offset.\n    };\n\n    \/\/ Dummy values for items.\n    const int item_val[] = {\n        4,\n        10,\n        55\n    };\n    const unsigned int num_items = sizeof(item_ids) \/ sizeof(unsigned int);\n\n    \/\/ Allocate memory for a SPEAD packet.\n    unsigned char* buf = (unsigned char*) malloc(8 + num_items * 8);\n    ASSERT_TRUE(buf != NULL);\n\n    \/\/ Define SPEAD flavour.\n    const unsigned char heap_address_bits = 48;\n    const unsigned char item_id_bits = 64 - heap_address_bits - 1;\n\n    \/\/ Construct SPEAD packet header.\n    buf[0] = 'S';\n    buf[1] = 4;\n    buf[2] = (item_id_bits + 1) \/ 8;\n    buf[3] = heap_address_bits \/ 8;\n    buf[4] = 0;\n    buf[5] = 0;\n    buf[6] = 0;\n    buf[7] = (unsigned char) num_items;\n\n    \/\/ Construct SPEAD packet payload containing items in\n    \/\/ \"immediate addressing mode\".\n    uint64_t* items = (uint64_t*) &buf[8];\n    for (unsigned int i = 0; i < num_items; i++)\n    {\n        const uint64_t item_id = (uint64_t) item_ids[i];\n        const uint64_t item_addr_or_val = (uint64_t) item_val[i];\n        const uint64_t item =\n                (1ull << 63) |\n                (item_id << heap_address_bits) |\n                item_addr_or_val;\n        items[i] = htobe64(item);\n    }\n\n    \/\/ Create a test receiver.\n    struct Receiver* receiver = create_test_receiver();\n    ASSERT_TRUE(receiver != NULL);\n\n    \/\/ Call stream_decode().\n    stream_decode(receiver->streams[0], buf, 0);\n\n    \/\/ Clean up.\n    receiver_free(receiver);\n    free(buf);\n}\n\ntypedef enum _item_ids {\n    heap_counter=0x01,\n    heap_size,\n    heap_offset,\n    packet_payload_length,\n    item_descriptor,\n    stream_control,\n    item_desc_name=0x10,\n    item_des_description,\n    item_desc_shape,\n    item_desc_type,\n    item_desc_ID,\n    item_desc_dtype,\n    visibility_timestamp_count=0x6000,\n    visibility_timestamp_fraction,\n    visibility_baseline_count_0x6005,\n    scan_ID=0x6008,\n    visibility_data=0x600A\n} item_id;\n\ntypedef struct _item_block {\n    item_id id;\n    uint64_t val;\n    uint64_t imm;\n} item_block;\n\nTEST(Stream, test_stream_receive)\n{\n    \/* Verify stream_decode() function and verify if correct\n    data is received *\/\n\n    \/\/ ADD DESCRIPTOR AND OTHER IDS\n    \/\/ SPEAD packet item IDs.\n    \/\/ *** APM: No longer required?\n    \/\/~ const unsigned int item_ids[] = {\n        \/\/~ 0x1,    \/\/ Heap counter.\n        \/\/~ 0x2,    \/\/ Heap size.\n        \/\/~ 0x3,    \/\/ Heap offset.\n        \/\/~ 0x4,    \/\/ packet payload length\n        \/\/~ 0x5,    \/\/ item descriptor\n        \/\/~ 0x6,    \/\/ stream control\n        \/\/~ \/\/ 0x10,   \/\/ item descriptor: name\n        \/\/~ \/\/ 0x11,   \/\/ item descriptor: description\n        \/\/~ \/\/ 0x12,   \/\/ item descriptor: shape\n        \/\/~ \/\/ 0x13,   \/\/ item descriptor: type\n        \/\/~ \/\/ 0x14,   \/\/ item descriptor: ID\n        \/\/~ \/\/ 0x15,   \/\/ item descriptor: dtype  \n        \/\/~ 0x6000, \/\/ Visibility timestamp count\n        \/\/~ 0x6001, \/\/ Visibility timestamp fraction\n        \/\/~ 0x6005, \/\/ Visibility baseline count\n        \/\/~ 0x6008, \/\/ Scan ID \n        \/\/~ 0x600A  \/\/ Visibility data \n\n    \/\/~ };\n\n    \/\/ NEED TO FIGURE OUT HOW TO DO FLOOR IN C\n    \/\/ ADD DESCRIPTOR AND OTHER VALUES\n    \/\/ int num_baselines = (512 * 513) \/\/ 2\n    \/\/ Dummy values for items.\n\n    \/\/ # Update values in the heap.\n    \/\/ item_group['visibility_timestamp_count'].value = 1\n    \/\/ item_group['visibility_timestamp_fraction'].value = 0\n    \/\/ item_group['visibility_baseline_count'].value = num_baselines\n    \/\/ item_group['scan_id'].value = 100000000\n    \/\/ item_group['correlator_output_data'].value = vis\n\n    \/\/ Alternative to this in C\n    \/\/ vis = numpy.zeros(shape=(num_baselines,), dtype=dtype)\n\n    \/\/ *** APM: No longer required?\n    \/\/~ const int item_val[] = {\n        \/\/~ 4,\n        \/\/~ 10,\n        \/\/~ 55,\n        \/\/~ 55,\n        \/\/~ 0,\n        \/\/~ 1,              \/\/ Visibility timestamp count\n        \/\/~ 0,              \/\/ Visibility timestamp fraction    \n        \/\/~ \/\/ num_baselines,  \/\/ Visibility baseline count\n        \/\/~ 100000000,      \/\/ Scan ID \n        \/\/~ \/\/ vis             \/\/ Visibility data \n\n        \/\/~ \/\/ 1,\n        \/\/~ \/\/ 0\n        \n    \/\/~ };\n\n\n    \/\/ *** APM: This const array contains item-id, \n    \/\/          item value and immediate flag.\n    const item_block p_items[] = { \n\t{heap_counter, 4, 1}, \n\t{heap_size, 10, 1},\n\t{heap_offset, 55, 1}, \n\t{packet_payload_length, 55, 1},\n\t{item_descriptor, 0, 0}, \n\t{stream_control, 1, 1},\n\t{visibility_timestamp_count, 1, 1}, \n\t{visibility_timestamp_fraction, 0, 1},\n\t{scan_ID, 100000000, 0}\n    };\n    const unsigned int num_items = sizeof(p_items) \/ sizeof(item_block);\n    \n    uint64_t heap_count;\n\n    \/\/ Allocate memory for a SPEAD packet.\n    unsigned char* buf = (unsigned char*) malloc(8 + num_items * 8);\n    ASSERT_TRUE(buf != NULL);\n\n    \/\/ Define SPEAD flavour.\n    const unsigned char heap_address_bits = 48;\n    const unsigned char item_id_bits = 64 - heap_address_bits - 1;\n\n    \/\/ Construct SPEAD packet header.\n    buf[0] = 'S';\n    buf[1] = 4;\n    buf[2] = (item_id_bits + 1) \/ 8;\n    buf[3] = heap_address_bits \/ 8;\n    buf[4] = 0;\n    buf[5] = 0;\n    buf[6] = 0;\n    buf[7] = (unsigned char) num_items;  \/\/ Luckily < 256 items :-)\n\n    \/\/ Construct SPEAD packet payload containing items in\n    \/\/ \"immediate addressing mode\".\n    uint64_t* items = (uint64_t*) &buf[8];\n    for (unsigned int i = 0; i < num_items; i++)\n    {\n        const uint64_t item_id = (uint64_t) p_items[i].id;\n        const uint64_t item_addr_or_val = (uint64_t) p_items[i].val;\n\tconst uint64_t imm_or_abs = p_items[i].imm << 63;\n        \/\/printf(\"Item Value: %i\\n\", item_val[i]);\n        const uint64_t item =\n                imm_or_abs |\n                (item_id << heap_address_bits) |\n                item_addr_or_val;\n        items[i] = htobe64(item);\n\tswitch (p_items[i].id)\n\t{\n\t    case heap_counter : heap_count = p_items[i].val; break;\n\t}\n    }\n\n    \/\/ Create a test receiver.\n    struct Receiver* receiver = create_test_receiver();\n    ASSERT_TRUE(receiver != NULL);\n\n    \/\/ Call stream_decode().\n    stream_decode(receiver->streams[0], buf, 0);\n    printf(\"Heap count - %i\\n\", receiver->streams[0]->heap_count); \/\/ could assert heap count value here\n    printf(\"Buffer Len - %i\\n\", receiver->streams[0]->buffer_len); \/\/ could assert default values here\n    printf(\"Num buffers - %i\\n\", receiver->num_buffers);\n    printf(\"completed_streams - %i\\n\", receiver->completed_streams);\n    printf(\"max_num_buffers - %i\\n\", receiver->max_num_buffers);\n    printf(\"num_baselines - %i\\n\", receiver->num_baselines);\n    \/\/ printf(\"buffer_id - %i\\n\", receiver->buffers[0]->buffer_id);\n    \/\/ struct Buffer* buff = receiver->buffers[0];\n    \/\/ printf(\"Buf %i\", buff->buffer_id);\n\n    \/\/ Clean up.\n    receiver_free(receiver);\n    free(buf);\n}\n<|endoftext|>"}
{"text":"<commit_before>#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();\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.load_enable.jpg ? IMG_INIT_JPG : 0;\n\t\tflags |= m_settings.load_enable.png ? IMG_INIT_PNG : 0;\n\t\tflags |= m_settings.load_enable.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();\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();\n\t}\n\tif (::SDL_RenderClear(m_renderer.get()) < 0) {\n\t\tThrowLastSdlError();\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\nvoid GraphicsManager::DrawStringUtf8(\n\tconst CharTextureMap &ctex, const char *str, int x, int y)\n{\n\tauto p = static_cast<const uint8_t *>(static_cast<const void *>(str));\n\twhile (*p != '\\0') {\n\t\tuint32_t c = 0;\n\t\tif ((*p & 0b1'0000000) == 0b0'0000000) {\n\t\t\tc = *p++;\n\t\t}\n\t\telse if ((*p & 0b111'00000) == 0b110'11111) {\n\t\t\tuint8_t c1 = *p++;\n\t\t\tuint8_t c2 = *p++;\n\t\t\tif ((c2 & 0b11'000000) != 0b10'000000) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tc = ((c1 & 0b000'11111) << 6) | (c2 & 0b00'111111);\n\t\t\tif (c < 0x80) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\telse if ((*p & 0b1111'0000) == 0b1110'0000) {\n\t\t\tuint8_t c1 = *p++;\n\t\t\tuint8_t c2 = *p++;\n\t\t\tif ((c2 & 0b11'000000) != 0b10'000000) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tuint8_t c3 = *p++;\n\t\t\tif ((c3 & 0b11'000000) != 0b10'000000) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tc = ((c1 & 0b0000'1111) << 12) |\n\t\t\t\t((c2 & 0b000'11111) << 6) |\n\t\t\t\t(c3 & 0b00'111111);\n\t\t\tif (c < 0x800) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\t\/\/ >16bit codepoint seems not to be supported...\n\t\t\tbreak;\n\t\t}\n\t\t\/\/ might throw std::out_of_range\n\t\tconst auto &tex = ctex.at(c);\n\t\tDrawTexture(tex, x, y);\n\t\tx += GetTextureSize(tex).first;\n\t}\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();\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();\n\t}\n\treturn texture;\n}\n\nstd::pair<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();\n\t}\n\treturn std::make_pair(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();\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();\n\t}\n\treturn surface;\n}\n\nCharTextureMap GraphicsManager::CreateFontTextureMap(const SdlFontPtr &font,\n\tstd::initializer_list<std::pair<char32_t, char32_t>> ranges)\n{\n\tCharTextureMap result;\n\tfor (const auto &range : ranges) {\n\t\tchar32_t start = range.first;\n\t\tchar32_t end = range.second;\n\t\tif (start > end) {\n\t\t\tthrow std::invalid_argument(\"start > end\");\n\t\t}\n\t\tfor (char32_t c = start; c <= end; c++) {\n\t\t\tSdlTexturePtr tex = CreateTexture(\n\t\t\t\tCreateFontImage(font, c));\n\t\t\tresult.emplace(c, std::move(tex));\n\t\t}\n\t}\n\treturn result;\n}\n\n}\n}\n<commit_msg>Don't throw exception from DrawString<commit_after>#include <graphics.hpp>\n#include <exceptions.hpp>\n#include <array>\n\nnamespace appbase {\nnamespace graph {\n\nusing namespace appbase::error;\n\nnamespace {\n\tconst uint8_t UnknownChar = '?';\n}\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();\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.load_enable.jpg ? IMG_INIT_JPG : 0;\n\t\tflags |= m_settings.load_enable.png ? IMG_INIT_PNG : 0;\n\t\tflags |= m_settings.load_enable.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();\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();\n\t}\n\tif (::SDL_RenderClear(m_renderer.get()) < 0) {\n\t\tThrowLastSdlError();\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\nvoid GraphicsManager::DrawStringUtf8(\n\tconst CharTextureMap &ctex, const char *str, int x, int y)\n{\n\tauto p = static_cast<const uint8_t *>(static_cast<const void *>(str));\n\twhile (*p != '\\0') {\n\t\tuint32_t c = 0;\n\t\tif ((*p & 0b1'0000000) == 0b0'0000000) {\n\t\t\tc = *p++;\n\t\t}\n\t\telse if ((*p & 0b111'00000) == 0b110'11111) {\n\t\t\tuint8_t c1 = *p++;\n\t\t\tuint8_t c2 = *p++;\n\t\t\tif ((c2 & 0b11'000000) != 0b10'000000) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tc = ((c1 & 0b000'11111) << 6) | (c2 & 0b00'111111);\n\t\t\tif (c < 0x80) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\telse if ((*p & 0b1111'0000) == 0b1110'0000) {\n\t\t\tuint8_t c1 = *p++;\n\t\t\tuint8_t c2 = *p++;\n\t\t\tif ((c2 & 0b11'000000) != 0b10'000000) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tuint8_t c3 = *p++;\n\t\t\tif ((c3 & 0b11'000000) != 0b10'000000) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tc = ((c1 & 0b0000'1111) << 12) |\n\t\t\t\t((c2 & 0b000'11111) << 6) |\n\t\t\t\t(c3 & 0b00'111111);\n\t\t\tif (c < 0x800) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\t\/\/ >16bit codepoint seems not to be supported...\n\t\t\tbreak;\n\t\t}\n\t\t\/\/ try to find c, try to find UnknownChar, give up\n\t\tauto it = ctex.find(c);\n\t\tif (it == ctex.end()) {\n\t\t\tit = ctex.find(UnknownChar);\n\t\t}\n\t\tif (it != ctex.end()) {\n\t\t\tconst auto &tex = it->second;\n\t\t\tDrawTexture(tex, x, y);\n\t\t\tx += GetTextureSize(tex).first;\n\t\t}\n\t}\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();\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();\n\t}\n\treturn texture;\n}\n\nstd::pair<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();\n\t}\n\treturn std::make_pair(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();\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] = UnknownChar;\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();\n\t}\n\treturn surface;\n}\n\nCharTextureMap GraphicsManager::CreateFontTextureMap(const SdlFontPtr &font,\n\tstd::initializer_list<std::pair<char32_t, char32_t>> ranges)\n{\n\tCharTextureMap result;\n\t\/\/ Add unknown character\n\t{\n\t\tSdlTexturePtr tex = CreateTexture(\n\t\t\tCreateFontImage(font, UnknownChar));\n\t\tresult.emplace(UnknownChar, std::move(tex));\n\t}\n\tfor (const auto &range : ranges) {\n\t\tchar32_t start = range.first;\n\t\tchar32_t end = range.second;\n\t\tif (start > end) {\n\t\t\tthrow std::invalid_argument(\"start > end\");\n\t\t}\n\t\tfor (char32_t c = start; c <= end; c++) {\n\t\t\tSdlTexturePtr tex = CreateTexture(\n\t\t\t\tCreateFontImage(font, c));\n\t\t\tresult.emplace(c, std::move(tex));\n\t\t}\n\t}\n\treturn result;\n}\n\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * $Id: sample.h,v 1.6 2006\/09\/18 06:23:39 nathanst Exp $\n *\n *  Driver.h\n *  hog\n *\n *  Created by Thayne Walker on 3\/17\/17.\n *  Copyright 2017 Thayne Walker, University of Denver. All rights reserved.\n *\n * This file is part of HOG.\n *\n * HOG 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 * HOG is distributed in the hope that it will be 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 HOG; 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 <memory>\n#include <iostream>\n#include <unordered_set>\n#include <unordered_map>\n#include \"Map2DEnvironment.h\"\n\nint maxDepth;\n\nstruct Hashable{\n  virtual uint64_t Hash()const=0;\n};\n\nstruct NodePtrComp\n{\n  bool operator()(const Hashable* lhs, const Hashable* rhs) const  { return lhs->Hash()<rhs->Hash(); }\n};\n\nnamespace std\n{\n    template <>\n    struct hash<Hashable>\n    {\n        size_t operator()(Hashable* const & x) const noexcept\n        {\n            return x->Hash();\n        }\n    };\n}\n\nstruct Node : public Hashable{\n\tstatic MapEnvironment* env;\n\tNode(){}\n\tNode(xyLoc a, int d):n(a),depth(d),optimal(false){}\n\txyLoc n;\n\tuint16_t depth;\n        bool optimal;\n        bool connected()const{return parents.size()+successors.size();}\n\tstd::unordered_set<Node*> parents;\n\tstd::unordered_set<Node*> successors;\n\tvirtual uint64_t Hash()const{return (env->GetStateHash(n)<<16) | depth;}\n};\n\ntypedef std::vector<std::unordered_set<Node*>> MDD;\ntypedef std::unordered_map<uint64_t,Node> DAG;\n\nstd::ostream& operator << (std::ostream& ss, Node const& n){\n  ss << std::string(n.depth,' ')<<n.n;\n  return ss;\n}\n\nstd::ostream& operator << (std::ostream& ss, Node const* n){\n  ss << std::string(n->depth,' ')<<n->n << n->successors.size()<< \"\\n\";\n  for(auto const m: n->successors)\n    ss << m;\n  return ss;\n}\n\nMapEnvironment* Node::env=nullptr;\n\nbool LimitedDFS(xyLoc const& start, xyLoc const& end, DAG& dag, MDD& mdd, int depth, int maxDepth){\n  \/\/std::cout << start << \" g:\" << (maxDepth-depth) << \" h:\" << Node::env->HCost(start,end) << \" f:\" << ((maxDepth-depth)+Node::env->HCost(start,end)) << \"\\n\";\n  if(depth<0 ||\n      (maxDepth-depth)+Node::env->HCost(start,end)>maxDepth){ \/\/ Note - this only works for a perfect heuristic.\n    \/\/std::cout << \"pruned\\n\";\n    return false;\n  }\n\n  if(Node::env->GoalTest(end,start)){\n    Node n(start,depth);\n    uint64_t hash(n.Hash());\n    dag[hash]=n;\n    std::unordered_set<Node*>& s=mdd[maxDepth-(depth)];\n    s.insert(&dag[hash]);\n    \/\/std::cout << \"found \" << start << \"\\n\";\n    return true;\n  }\n\n  std::vector<xyLoc> successors;\n  Node::env->GetSuccessors(start,successors);\n  bool result(false);\n  for(auto const& node: successors){\n    if(LimitedDFS(node,end,dag,mdd,depth-1,maxDepth)){\n      Node n(start,depth);\n      uint64_t hash(n.Hash());\n      if(dag.find(hash)==dag.end()){\n        dag[hash]=n;\n        std::unordered_set<Node*>& s=mdd[maxDepth-(depth)];\n        s.insert(&dag[hash]);\n      }else if(dag[hash].optimal){\n        return true; \/\/ Already found a solution from search at this depth\n      }\n\n      Node* parent(&dag[hash]);\n\n      \/\/std::cout << \"found \" << start << \"\\n\";\n      std::unique_ptr<Node> c(new Node(node,depth-1));\n      Node* current(dag.find(c->Hash())==dag.end()?c.release():&dag[c->Hash()]);\n      current->optimal = result = true;\n      \/\/std::cout << *parent << \" parent of \" << *current << \"\\n\";\n      dag[current->Hash()].parents.insert(parent);\n      \/\/std::cout << *current << \" child of \" << *parent << \"\\n\";\n      dag[parent->Hash()].successors.insert(current);\n    }\n  }\n  return result;\n}\n\nvoid GetMDD(xyLoc const& start, xyLoc const& end, MDD& mdd, int depth){\n  \/\/ TODO: make this contain pointers or maybe combine into a structure with MDD.\n  \/\/       as-is, memory will be deallocated when this function exits.\n  DAG* dag=new DAG();\n  mdd.resize(depth+1);\n  LimitedDFS(start,end,*dag,mdd,depth,depth);\n  for(auto const& a: mdd){\n    for(auto const& n: a){\n      std::cout << *n;\n    }\n    std::cout << \"\\n\";\n  }\n}\n\nvoid eraseDown(Node* n){\n  \/\/ If no parent points here, then we must disconnect this node\n  if(n->parents.empty()){\n    \/\/ Erase children's parent pointers terminating at this node\n    for(auto& m: n->successors){\n      auto p(m->parents.find(n));\n      if(p!=m->parents.end()){\n        m->parents.erase(p);\n      }\n      \/\/ recurse\n      eraseDown(m);\n    }\n    n->successors.clear();\n  }\n}\n\nvoid eraseUp(Node* n){\n  \/\/ If this node has no successors, it cannot connect us to the goal\n  if(n->successors.empty()){\n    \/\/ Erase parent's successor pointers terminating at this node\n    for(auto& m: n->parents){\n      auto p(m->successors.find(n));\n      if(p!=m->successors.end()){\n        m->successors.erase(p);\n      }\n      \/\/ recurse\n      eraseUp(m);\n    }\n    n->parents.clear();\n  }\n}\n\nvoid disconnect(Node* n){\n  \/\/ Erase edges pointing to parents, and their edges pointing at me.\n  for(auto& m: n->parents){\n    auto p(m->successors.find(n));\n    if(p!=m->successors.end()){\n      m->successors.erase(p);\n    }\n    eraseUp(m);\n  }\n  n->parents.clear();\n\n  \/\/ Erase edges to\/from successors\n  for(auto& m: n->successors){\n    auto p(m->parents.find(n));\n    if(p!=m->parents.end()){\n      m->parents.erase(p);\n    }\n    \/\/ recurse\n    eraseDown(m);\n  }\n  n->successors.clear();\n}\n\nstruct ICTSNode{\n  ICTSNode(int agents):mdd(agents){}\n  std::vector<MDD> mdd;\n  \/\/ Returns true and sets a1, a2 on conflict\n  bool CheckConflicts(int& a1, int& a2){\n    std::vector<MDD> temp(mdd);\n    \/\/ Check all pairs\n    for(int i(0); i<temp.size(); ++i){\n      for(int j(i+1); j<temp.size(); ++j){\n        \/\/ Check all times\n        for(int t(0); t<std::min(temp[i].size(),temp[j].size()); ++t){\n          \/\/ Check for node and edge conflicts\n          for(auto const m: temp[i][t]){\n            if(!m->connected()) continue; \/\/ Can't get here\n            for(auto const n: temp[j][t]){\n              if(!n->connected()) continue; \/\/ Can't get here\n              if(m->Hash() == n->Hash()){\n                disconnect(m);\n                disconnect(n);\n                continue;\n              }\n              if(t!=0){ \/\/ Check edges\n                for(auto mp(m->parents.begin()); mp!=m->parents.end();\/*++mp*\/){\n                  bool conflict(false);\n                  for(auto np(n->parents.begin()); np!=n->parents.end();\/*++np*\/){\n                    if((*mp)->n==n->n && (*np)->n==m->n){ \/\/ Same edge traversal\n                      \/\/ Remove edge\n                      \/\/ 1. Erase my pointer to parent\n                      n->parents.erase(np);\n                      \/\/ 2. Erase parent's pointer to me\n                      auto p((*np)->successors.find(n));\n                      if(p!=(*np)->successors.end()){\n                        (*np)->successors.erase(p);\n                      }\n                      eraseUp(*np); \/\/ If severed, propagate\n                      eraseDown(n);\n                      conflict=true;\n                      break;\n                    }else{\n                      ++np;\n                    }\n                  }\n                  if(conflict){\n                      m->parents.erase(mp);\n                      auto p((*mp)->successors.find(m));\n                      if(p!=(*mp)->successors.end()){\n                        (*mp)->successors.erase(p);\n                      }\n                      \/\/ recurse\n                      eraseUp(*mp); \/\/ If severed, propagate\n                      eraseDown(m);\n                  }else{\n                    ++mp;\n                  }\n                }\n              }\n            }\n          }\n          \/\/ Finally, check for severed connectivity by checking across this time slice.\n          \/\/ If all nodes have no parents or children, then this ICTS node is rendered infeasible\n          bool connected(false);\n          for(auto const& m: temp[i][t]){\n            connected|=m->connected();\n          }\n          if(!connected){\n            a1=i;\n            a2=j;\n            return false;\n          }\n          connected=false;\n          for(auto const& n: temp[j][t]){\n            connected|=n->connected();\n          }\n          if(!connected){\n            a1=i;\n            a2=j;\n            return false;\n          }\n        }\n      }\n    }\n    a1=-1;\n    a2=-1;\n    return true;\n  }\n};\n\nvoid testErasers(){\n  Node a(xyLoc(1,1),1);\n  Node b(xyLoc(2,1),2);\n  Node c(xyLoc(3,1),2);\n  Node d(xyLoc(4,1),2);\n  Node b1(xyLoc(5,1),3);\n  Node c1(xyLoc(6,1),3);\n  Node d1(xyLoc(7,1),3);\n  Node e(xyLoc(8,1),4);\n\n  a.successors.insert(&b);\n  a.successors.insert(&c);\n  a.successors.insert(&d);\n  b.parents.insert(&a);\n  c.parents.insert(&a);\n  d.parents.insert(&a);\n  b.successors.insert(&b1);\n  c.successors.insert(&c1);\n  d.successors.insert(&d1);\n  b1.parents.insert(&b);\n  c1.parents.insert(&c);\n  d1.parents.insert(&d);\n  b1.successors.insert(&e);\n  c1.successors.insert(&e);\n  d1.successors.insert(&e);\n  e.parents.insert(&b1);\n  e.parents.insert(&c1);\n  e.parents.insert(&d1);\n\n  std::cout << &a << \"\\n\";\n\n  \/\/ Disconnect b\n  disconnect(&b);\n  std::cout << &a << \"\\n\";\n\n  std::cout << \"b \" << b.connected() << \"\\n\";\n  std::cout << \"b1 \" << b1.connected() << \"\\n\";\n  \n}\n\nint main(){\n  MapEnvironment env(new Map(8,8));\n  env.SetFiveConnected();\n  Node::env=&env;\n\n  \/\/testErasers();\n\n  xyLoc s1(1,1);\n  xyLoc e1(1,4);\n  xyLoc s2(1,4);\n  xyLoc e2(3,1);\n  int agents(2);\n  ICTSNode n(agents);\n  GetMDD(s1,e1,n.mdd[0],Node::env->HCost(s1,e1));\n  GetMDD(s2,e2,n.mdd[1],Node::env->HCost(s2,e2));\n  \/\/std::cout << &(n.mdd[0][0]) << \"\\n\"; \n  \/\/std::cout << &(n.mdd[1][0]) << \"\\n\"; \n  int a1(-1);\n  int a2(-1);\n  std::cout << \"satisfiable=\" << (n.CheckConflicts(a1,a2)?\"true\":\"false\") << \"\\n\";\n  return 0;\n}\n<commit_msg>ICTS almost working.<commit_after>\/*\n * $Id: sample.h,v 1.6 2006\/09\/18 06:23:39 nathanst Exp $\n *\n *  Driver.h\n *  hog\n *\n *  Created by Thayne Walker on 3\/17\/17.\n *  Copyright 2017 Thayne Walker, University of Denver. All rights reserved.\n *\n * This file is part of HOG.\n *\n * HOG 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 * HOG is distributed in the hope that it will be 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 HOG; 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 <memory>\n#include <iostream>\n#include <unordered_set>\n#include <unordered_map>\n#include \"Map2DEnvironment.h\"\n\nint maxDepth;\n\nstruct Hashable{\n  virtual uint64_t Hash()const=0;\n};\n\nstruct NodePtrComp\n{\n  bool operator()(const Hashable* lhs, const Hashable* rhs) const  { return lhs->Hash()<rhs->Hash(); }\n};\n\nnamespace std\n{\n    template <>\n    struct hash<Hashable>\n    {\n        size_t operator()(Hashable* const & x) const noexcept\n        {\n            return x->Hash();\n        }\n    };\n}\n\nstruct Node : public Hashable{\n\tstatic MapEnvironment* env;\n\tNode(){}\n\tNode(xyLoc a, int d):n(a),depth(d),optimal(false){}\n\txyLoc n;\n\tuint16_t depth;\n        bool optimal;\n        bool connected()const{return parents.size()+successors.size();}\n\tstd::unordered_set<Node*> parents;\n\tstd::unordered_set<Node*> successors;\n\tvirtual uint64_t Hash()const{return (env->GetStateHash(n)<<16) | depth;}\n};\n\ntypedef std::vector<Node*> KNode;\ntypedef std::vector<std::unordered_set<Node*>> MDD;\ntypedef std::vector<Node*> MultiState; \/\/ rank=agent num\ntypedef std::vector<std::vector<KNode>> KMDD;\ntypedef std::unordered_map<uint64_t,Node> DAG;\n\nstd::ostream& operator << (std::ostream& ss, MultiState const& n){\n  for(auto const& a: n)\n    ss << \" \" << a->n;\n  return ss;\n}\n\nstd::ostream& operator << (std::ostream& ss, Node const& n){\n  ss << std::string(n.depth,' ')<<n.n;\n  return ss;\n}\n\nstd::ostream& operator << (std::ostream& ss, Node const* n){\n  ss << std::string(n->depth,' ')<<n->n << n->successors.size()<< \"\\n\";\n  for(auto const m: n->successors)\n    ss << m;\n  return ss;\n}\n\nMapEnvironment* Node::env=nullptr;\n\nbool LimitedDFS(xyLoc const& start, xyLoc const& end, DAG& dag, MDD& mdd, int depth, int maxDepth){\n  \/\/std::cout << start << \" g:\" << (maxDepth-depth) << \" h:\" << Node::env->HCost(start,end) << \" f:\" << ((maxDepth-depth)+Node::env->HCost(start,end)) << \"\\n\";\n  if(depth<0 ||\n      (maxDepth-depth)+Node::env->HCost(start,end)>maxDepth){ \/\/ Note - this only works for a perfect heuristic.\n    \/\/std::cout << \"pruned\\n\";\n    return false;\n  }\n\n  if(Node::env->GoalTest(end,start)){\n    Node n(start,depth);\n    uint64_t hash(n.Hash());\n    dag[hash]=n;\n    std::unordered_set<Node*>& s=mdd[maxDepth-(depth)];\n    s.insert(&dag[hash]);\n    \/\/std::cout << \"found \" << start << \"\\n\";\n    return true;\n  }\n\n  std::vector<xyLoc> successors;\n  Node::env->GetSuccessors(start,successors);\n  bool result(false);\n  for(auto const& node: successors){\n    if(LimitedDFS(node,end,dag,mdd,depth-1,maxDepth)){\n      Node n(start,depth);\n      uint64_t hash(n.Hash());\n      if(dag.find(hash)==dag.end()){\n        dag[hash]=n;\n        std::unordered_set<Node*>& s=mdd[maxDepth-(depth)];\n        s.insert(&dag[hash]);\n      }else if(dag[hash].optimal){\n        return true; \/\/ Already found a solution from search at this depth\n      }\n\n      Node* parent(&dag[hash]);\n\n      \/\/std::cout << \"found \" << start << \"\\n\";\n      std::unique_ptr<Node> c(new Node(node,depth-1));\n      Node* current(dag.find(c->Hash())==dag.end()?c.release():&dag[c->Hash()]);\n      current->optimal = result = true;\n      \/\/std::cout << *parent << \" parent of \" << *current << \"\\n\";\n      dag[current->Hash()].parents.insert(parent);\n      \/\/std::cout << *current << \" child of \" << *parent << \"\\n\";\n      dag[parent->Hash()].successors.insert(current);\n    }\n  }\n  return result;\n}\n\nvoid GetMDD(xyLoc const& start, xyLoc const& end, MDD& mdd, int depth){\n  \/\/ TODO: make this contain pointers or maybe combine into a structure with MDD.\n  \/\/       as-is, memory will be deallocated when this function exits.\n  DAG* dag=new DAG();\n  mdd.resize(depth+1);\n  LimitedDFS(start,end,*dag,mdd,depth,depth);\n  for(auto const& a: mdd){\n    for(auto const& n: a){\n      std::cout << *n;\n    }\n    std::cout << \"\\n\";\n  }\n}\n\nvoid eraseDown(Node* n){\n  \/\/ If no parent points here, then we must disconnect this node\n  if(n->parents.empty()){\n    \/\/ Erase children's parent pointers terminating at this node\n    for(auto& m: n->successors){\n      auto p(m->parents.find(n));\n      if(p!=m->parents.end()){\n        m->parents.erase(p);\n      }\n      \/\/ recurse\n      eraseDown(m);\n    }\n    n->successors.clear();\n  }\n}\n\nvoid eraseUp(Node* n){\n  \/\/ If this node has no successors, it cannot connect us to the goal\n  if(n->successors.empty()){\n    \/\/ Erase parent's successor pointers terminating at this node\n    for(auto& m: n->parents){\n      auto p(m->successors.find(n));\n      if(p!=m->successors.end()){\n        m->successors.erase(p);\n      }\n      \/\/ recurse\n      eraseUp(m);\n    }\n    n->parents.clear();\n  }\n}\n\nvoid disconnect(Node* n){\n  \/\/ Erase edges pointing to parents, and their edges pointing at me.\n  for(auto& m: n->parents){\n    auto p(m->successors.find(n));\n    if(p!=m->successors.end()){\n      m->successors.erase(p);\n    }\n    eraseUp(m);\n  }\n  n->parents.clear();\n\n  \/\/ Erase edges to\/from successors\n  for(auto& m: n->successors){\n    auto p(m->parents.find(n));\n    if(p!=m->parents.end()){\n      m->parents.erase(p);\n    }\n    \/\/ recurse\n    eraseDown(m);\n  }\n  n->successors.clear();\n}\n\nvoid generatePermutations(std::vector<MultiState>& positions, std::vector<MultiState>& result, int depth, MultiState const& parent, MultiState const& current) {\n    if(depth == positions.size()) {\n       for(int i(1); i<current.size(); ++i){\n         if(current[i-1]->n.x==parent[i]->n.x and parent[i-1]->n.y==current[i]->n.y\n         && current[i-1]->n.x==parent[i]->n.x and parent[i-1]->n.y==current[i]->n.y)\n           return; \/\/ This is an edge collision\n       }\n       result.push_back(current);\n       return;\n     }\n\n    for(int i = 0; i < positions[depth].size(); ++i) {\n        MultiState copy(current);\n        bool found(false);\n        for(auto const& p: current){\n          if(positions[depth][i]->n.x==p->n.x && positions[depth][i]->n.y==p->n.y){\n            found=true;\n            break;\n          }\n        }\n        if(found) continue;\n        copy.push_back(positions[depth][i]);\n        generatePermutations(positions, result, depth + 1, parent, copy);\n    }\n}\n\n\/\/ Return true if we get to the desired depth\nbool jointDFS(MultiState const& s, int d, int term){\n  std::cout << std::string(d,' ')<< \" s \" << s << \"\\n\";\n  if(d==term){\n    return true;\n  }\n  \/\/Get successors into a vector\n  std::vector<MultiState> successors;\n  for(auto const& a: s){\n    MultiState output(a->successors.begin(), a->successors.end()); \n    successors.push_back(output);\n  }\n  std::vector<MultiState> crossProduct;\n  generatePermutations(successors,crossProduct,0,s,MultiState());\n  for(auto const& a: crossProduct){\n    return jointDFS(a,d+1,term);\n  }\n  return false;\n}\n\nstruct ICTSNode{\n  ICTSNode(int agents):mdd(agents){}\n  ICTSNode(std::vector<int> sizes):mdd(starts.size()){\n    for(int i(0); i<starts.size(); ++i){\n      GetMDD(starts[i],ends[i],mdd[i],Node::env->HCost(starts[i],ends[i])+sizes[i]);\n    }\n  }\n  std::vector<MDD> mdd;\n  static std::vector<xyLoc> starts;\n  static std::vector<xyLoc> ends;\n\n  bool isValid(){\n    \/\/ Extend all goal nodes out to the same depth by adding wait actions.\n    int maxmdd(INT_MIN);\n    MultiState root;\n    for(auto const& m: mdd){\n      maxmdd=max(maxmdd,m.size());\n      root.push_back(*m[0].begin());\n    }\n    std::cout << \"root \" << root << \"\\n\";\n    for(auto & m: mdd){\n      while(m.size()<maxmdd){\n        std::unordered_set<Node*> b;\n        Node* n(new Node((*m.back().begin())->n,(*m.back().begin())->depth+1));\n        (*m.back().begin())->successors.insert(n);\n        n->parents.insert(*m.back().begin());\n        b.insert(n);\n        m.push_back(b);\n      }\n    }\n    \/\/ Do a depth-first search; if the search terminates at a goal, its valid.\n    return jointDFS(root,1,maxmdd);\n  }\n\n  \/\/ Returns true and sets a1, a2 on conflict\n  bool CheckConflicts(int& a1, int& a2){\n    std::vector<MDD> temp(mdd);\n    \/\/ Check all pairs\n    for(int i(0); i<temp.size(); ++i){\n      for(int j(i+1); j<temp.size(); ++j){\n        \/\/ Check all times\n        for(int t(0); t<std::min(temp[i].size(),temp[j].size()); ++t){\n          \/\/ Check for node and edge conflicts\n          for(auto const m: temp[i][t]){\n            if(!m->connected()) continue; \/\/ Can't get here\n            for(auto const n: temp[j][t]){\n              if(!n->connected()) continue; \/\/ Can't get here\n              if(m->Hash() == n->Hash()){\n                disconnect(m);\n                disconnect(n);\n                continue;\n              }\n              if(t!=0){ \/\/ Check edges\n                for(auto mp(m->parents.begin()); mp!=m->parents.end();\/*++mp*\/){\n                  bool conflict(false);\n                  for(auto np(n->parents.begin()); np!=n->parents.end();\/*++np*\/){\n                    if((*mp)->n==n->n && (*np)->n==m->n){ \/\/ Same edge traversal\n                      \/\/ Remove edge\n                      \/\/ 1. Erase my pointer to parent\n                      n->parents.erase(np);\n                      \/\/ 2. Erase parent's pointer to me\n                      auto p((*np)->successors.find(n));\n                      if(p!=(*np)->successors.end()){\n                        (*np)->successors.erase(p);\n                      }\n                      eraseUp(*np); \/\/ If severed, propagate\n                      eraseDown(n);\n                      conflict=true;\n                      break;\n                    }else{\n                      ++np;\n                    }\n                  }\n                  if(conflict){\n                      m->parents.erase(mp);\n                      auto p((*mp)->successors.find(m));\n                      if(p!=(*mp)->successors.end()){\n                        (*mp)->successors.erase(p);\n                      }\n                      \/\/ recurse\n                      eraseUp(*mp); \/\/ If severed, propagate\n                      eraseDown(m);\n                  }else{\n                    ++mp;\n                  }\n                }\n              }\n            }\n          }\n          \/\/ Finally, check for severed connectivity by checking across this time slice.\n          \/\/ If all nodes have no parents or children, then this ICTS node is rendered infeasible\n          bool aconnected(false);\n          for(auto const& m: temp[i][t]){\n            aconnected|=m->connected();\n          }\n          bool bconnected(false);\n          for(auto const& n: temp[j][t]){\n            bconnected|=n->connected();\n          }\n          if(!aconnected && !bconnected){\n            a1=i;\n            a2=j;\n            return false;\n          }\n        }\n      }\n    }\n    \/\/ If we got this far, it means that at least one of the graphs was not\n    \/\/ disconnected, meaning at least one non-conflicting path is available\n    \n    a1=-1;\n    a2=-1;\n    return true;\n  }\n};\n\nvoid testErasers(){\n  Node a(xyLoc(1,1),1);\n  Node b(xyLoc(2,1),2);\n  Node c(xyLoc(3,1),2);\n  Node d(xyLoc(4,1),2);\n  Node b1(xyLoc(5,1),3);\n  Node c1(xyLoc(6,1),3);\n  Node d1(xyLoc(7,1),3);\n  Node e(xyLoc(8,1),4);\n\n  a.successors.insert(&b);\n  a.successors.insert(&c);\n  a.successors.insert(&d);\n  b.parents.insert(&a);\n  c.parents.insert(&a);\n  d.parents.insert(&a);\n  b.successors.insert(&b1);\n  c.successors.insert(&c1);\n  d.successors.insert(&d1);\n  b1.parents.insert(&b);\n  c1.parents.insert(&c);\n  d1.parents.insert(&d);\n  b1.successors.insert(&e);\n  c1.successors.insert(&e);\n  d1.successors.insert(&e);\n  e.parents.insert(&b1);\n  e.parents.insert(&c1);\n  e.parents.insert(&d1);\n\n  std::cout << &a << \"\\n\";\n\n  \/\/ Disconnect b\n  disconnect(&b);\n  std::cout << &a << \"\\n\";\n\n  std::cout << \"b \" << b.connected() << \"\\n\";\n  std::cout << \"b1 \" << b1.connected() << \"\\n\";\n  \n}\n\nstd::vector<xyLoc> ICTSNode::starts;\nstd::vector<xyLoc> ICTSNode::ends;\n\nint main(){\n  MapEnvironment env(new Map(8,8));\n  env.SetFiveConnected();\n  Node::env=&env;\n  ICTSNode::starts.emplace_back(1,1);\n  ICTSNode::starts.emplace_back(1,4);\n  ICTSNode::ends.emplace_back(1,4);\n  ICTSNode::ends.emplace_back(1,1);\n  std::vector<int> sizes = {0, 0};\n\n  int current(0);\n  ICTSNode* n(new ICTSNode(sizes));\n  while(!n->isValid()){\n    sizes[current]++;\n    for(auto const& s: sizes)\n      std::cout << s << \" \";\n    std::cout << \"\\n\";\n    n = new ICTSNode(sizes);\n    current=(current+1)%sizes.size();\n  }\n  \/\/std::cout << \"satisfiable=\" << n.isValid()<<\"\\n\";\n  \/\/sizes[0]=1;\n  \/\/ICTSNode n1(sizes);\n  \/\/std::cout << \"satisfiable=\" << n1.isValid()<<\"\\n\";\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef ARBITER_IS_AMALGAMATION\n#include <arbiter\/endpoint.hpp>\n\n#include <arbiter\/arbiter.hpp>\n#include <arbiter\/driver.hpp>\n#include <arbiter\/drivers\/fs.hpp>\n#include <arbiter\/util\/sha256.hpp>\n#include <arbiter\/util\/transforms.hpp>\n#include <arbiter\/util\/util.hpp>\n#endif\n#include<fstream>\n\n#ifdef ARBITER_CUSTOM_NAMESPACE\nnamespace ARBITER_CUSTOM_NAMESPACE\n{\n#endif\n\nnamespace arbiter\n{\n\nnamespace\n{\n    std::string postfixSlash(std::string path)\n    {\n        if (path.empty()) throw ArbiterError(\"Invalid root path\");\n        if (path.back() != '\/') path.push_back('\/');\n        return path;\n    }\n}\n\nEndpoint::Endpoint(const Driver& driver, const std::string root)\n    : m_driver(driver)\n    , m_root(expandTilde(postfixSlash(root)))\n{ }\n\nstd::string Endpoint::root() const\n{\n    return m_root;\n}\n\nstd::string Endpoint::prefixedRoot() const\n{\n    return softPrefix() + root();\n}\n\nstd::string Endpoint::type() const\n{\n    return m_driver.type();\n}\n\nbool Endpoint::isRemote() const\n{\n    return m_driver.isRemote();\n}\n\nbool Endpoint::isLocal() const\n{\n    return !isRemote();\n}\n\nbool Endpoint::isHttpDerived() const\n{\n    return tryGetHttpDriver() != nullptr;\n}\n\nstd::unique_ptr<LocalHandle> Endpoint::getLocalHandle(\n        const std::string subpath) const\n{\n    std::unique_ptr<LocalHandle> handle;\n\n    if (isRemote())\n    {\n        const std::string tmp(getTempPath());\n        const auto ext(Arbiter::getExtension(subpath));\n        const std::string basename(\n                                std::to_string(randomNumber()) +\n                                (ext.size() ? \".\" + ext : \"\"));\n\n        const std::string local(tmp + basename);\n        if (isHttpDerived())\n        {\n            std::size_t fileSize = getSize(subpath);\n            uint32_t chunkSize = 100 * 1000 * 1000; \/\/ 100mb\n            uint32_t numChunks = ((fileSize % chunkSize) == 0)\n                                     ? (fileSize \/ chunkSize)\n                                     : (fileSize \/ chunkSize) + 1;\n            std::size_t start;\n            std::ofstream stream(local, std::ofstream::binary |\n                                        std::ofstream::out |\n                                        std::ofstream::app);\n            stream.good()\n                ? start = -1\n                : throw ArbiterError(\"Unable to create local handle.\");\n            while (numChunks > 0)\n            {\n                http::Headers headers;\n                std::string range(\"bytes=\" + std::to_string(start + 1) + \"-\" +\n                                  std::to_string((start + chunkSize)>fileSize?fileSize:(start + chunkSize)));\n                headers.insert(std::pair<std::string, std::string>(\"Range\", range));\n                std::vector<char> data =getBinary(subpath, headers, http::Query());\n                stream.write(data.data(), data.size());\n                stream.good()\n                    ? start += chunkSize\n                    : throw ArbiterError(\"Unable to write to local handle.\");\n                --numChunks;\n            }\n            stream.close();\n        }\n        else\n        {\n            drivers::Fs fs;\n            fs.put(local, getBinary(subpath));\n        }\n        handle.reset(new LocalHandle(local, true));\n    }\n    else\n    {\n        handle.reset(new LocalHandle(expandTilde(fullPath(subpath)), false));\n    }\n\n    return handle;\n}\n\nstd::string Endpoint::get(const std::string subpath) const\n{\n    return m_driver.get(fullPath(subpath));\n}\n\nstd::unique_ptr<std::string> Endpoint::tryGet(const std::string subpath)\n    const\n{\n    return m_driver.tryGet(fullPath(subpath));\n}\n\nstd::vector<char> Endpoint::getBinary(const std::string subpath) const\n{\n    return m_driver.getBinary(fullPath(subpath));\n}\n\nstd::unique_ptr<std::vector<char>> Endpoint::tryGetBinary(\n        const std::string subpath) const\n{\n    return m_driver.tryGetBinary(fullPath(subpath));\n}\n\nstd::size_t Endpoint::getSize(const std::string subpath) const\n{\n    return m_driver.getSize(fullPath(subpath));\n}\n\nstd::unique_ptr<std::size_t> Endpoint::tryGetSize(\n        const std::string subpath) const\n{\n    return m_driver.tryGetSize(fullPath(subpath));\n}\n\nvoid Endpoint::put(const std::string subpath, const std::string& data) const\n{\n    m_driver.put(fullPath(subpath), data);\n}\n\nvoid Endpoint::put(\n        const std::string subpath,\n        const std::vector<char>& data) const\n{\n    m_driver.put(fullPath(subpath), data);\n}\n\nstd::string Endpoint::get(\n        const std::string subpath,\n        const http::Headers headers,\n        const http::Query query) const\n{\n    return getHttpDriver().get(fullPath(subpath), headers, query);\n}\n\nstd::unique_ptr<std::string> Endpoint::tryGet(\n        const std::string subpath,\n        const http::Headers headers,\n        const http::Query query) const\n{\n    return getHttpDriver().tryGet(fullPath(subpath), headers, query);\n}\n\nstd::vector<char> Endpoint::getBinary(\n        const std::string subpath,\n        const http::Headers headers,\n        const http::Query query) const\n{\n    return getHttpDriver().getBinary(fullPath(subpath), headers, query);\n}\n\nstd::unique_ptr<std::vector<char>> Endpoint::tryGetBinary(\n        const std::string subpath,\n        const http::Headers headers,\n        const http::Query query) const\n{\n    return getHttpDriver().tryGetBinary(fullPath(subpath), headers, query);\n}\n\nvoid Endpoint::put(\n        const std::string path,\n        const std::string& data,\n        const http::Headers headers,\n        const http::Query query) const\n{\n    getHttpDriver().put(path, data, headers, query);\n}\n\nvoid Endpoint::put(\n        const std::string path,\n        const std::vector<char>& data,\n        const http::Headers headers,\n        const http::Query query) const\n{\n    getHttpDriver().put(path, data, headers, query);\n}\n\nhttp::Response Endpoint::httpGet(\n        std::string path,\n        http::Headers headers,\n        http::Query query,\n        const std::size_t reserve) const\n{\n    return getHttpDriver().internalGet(fullPath(path), headers, query, reserve);\n}\n\nhttp::Response Endpoint::httpPut(\n        std::string path,\n        const std::vector<char>& data,\n        http::Headers headers,\n        http::Query query) const\n{\n    return getHttpDriver().internalPut(fullPath(path), data, headers, query);\n}\n\nhttp::Response Endpoint::httpHead(\n        std::string path,\n        http::Headers headers,\n        http::Query query) const\n{\n    return getHttpDriver().internalHead(fullPath(path), headers, query);\n}\n\nhttp::Response Endpoint::httpPost(\n        std::string path,\n        const std::vector<char>& data,\n        http::Headers headers,\n        http::Query query) const\n{\n    return getHttpDriver().internalPost(fullPath(path), data, headers, query);\n}\n\nstd::string Endpoint::fullPath(const std::string& subpath) const\n{\n    return m_root + subpath;\n}\n\nstd::string Endpoint::prefixedFullPath(const std::string& subpath) const\n{\n     return softPrefix() + fullPath(subpath);\n}\n\nEndpoint Endpoint::getSubEndpoint(std::string subpath) const\n{\n    return Endpoint(m_driver, m_root + subpath);\n}\n\nstd::string Endpoint::softPrefix() const\n{\n    return isRemote() ? type() + \":\/\/\" : \"\";\n}\n\nconst drivers::Http* Endpoint::tryGetHttpDriver() const\n{\n    return dynamic_cast<const drivers::Http*>(&m_driver);\n}\n\nconst drivers::Http& Endpoint::getHttpDriver() const\n{\n    if (auto d = tryGetHttpDriver()) return *d;\n    else throw ArbiterError(\"Cannot get driver of type \" + type() + \" as HTTP\");\n}\n\n} \/\/ namespace arbiter\n\n#ifdef ARBITER_CUSTOM_NAMESPACE\n}\n#endif\n\n<commit_msg>fixed indents<commit_after>#ifndef ARBITER_IS_AMALGAMATION\n#include <arbiter\/endpoint.hpp>\n\n#include <arbiter\/arbiter.hpp>\n#include <arbiter\/driver.hpp>\n#include <arbiter\/drivers\/fs.hpp>\n#include <arbiter\/util\/sha256.hpp>\n#include <arbiter\/util\/transforms.hpp>\n#include <arbiter\/util\/util.hpp>\n#endif\n#include<fstream>\n\n#ifdef ARBITER_CUSTOM_NAMESPACE\nnamespace ARBITER_CUSTOM_NAMESPACE\n{\n#endif\n\nnamespace arbiter\n{\n\nnamespace\n{\n    std::string postfixSlash(std::string path)\n    {\n        if (path.empty()) throw ArbiterError(\"Invalid root path\");\n        if (path.back() != '\/') path.push_back('\/');\n        return path;\n    }\n}\n\nEndpoint::Endpoint(const Driver& driver, const std::string root)\n    : m_driver(driver)\n    , m_root(expandTilde(postfixSlash(root)))\n{ }\n\nstd::string Endpoint::root() const\n{\n    return m_root;\n}\n\nstd::string Endpoint::prefixedRoot() const\n{\n    return softPrefix() + root();\n}\n\nstd::string Endpoint::type() const\n{\n    return m_driver.type();\n}\n\nbool Endpoint::isRemote() const\n{\n    return m_driver.isRemote();\n}\n\nbool Endpoint::isLocal() const\n{\n    return !isRemote();\n}\n\nbool Endpoint::isHttpDerived() const\n{\n    return tryGetHttpDriver() != nullptr;\n}\n\nstd::unique_ptr<LocalHandle> Endpoint::getLocalHandle(\n        const std::string subpath) const\n{\n    std::unique_ptr<LocalHandle> handle;\n\n    if (isRemote())\n    {\n        const std::string tmp(getTempPath());\n        const auto ext(Arbiter::getExtension(subpath));\n        const std::string basename(\n                std::to_string(randomNumber()) +\n                (ext.size() ? \".\" + ext : \"\"));\n\n        const std::string local(tmp + basename);\n        if (isHttpDerived())\n        {\n            std::size_t fileSize = getSize(subpath);\n            uint32_t chunkSize = 100 * 1000 * 1000; \/\/ 100mb\n            uint32_t numChunks = ((fileSize % chunkSize) == 0)\n                                     ? (fileSize \/ chunkSize)\n                                     : (fileSize \/ chunkSize) + 1;\n            std::size_t start;\n            std::ofstream stream(local, std::ofstream::binary |\n                                        std::ofstream::out |\n                                        std::ofstream::app);\n            stream.good()\n                ? start = -1\n                : throw ArbiterError(\"Unable to create local handle.\");\n            while (numChunks > 0)\n            {\n                http::Headers headers;\n                std::string range(\"bytes=\" + std::to_string(start + 1) + \"-\" +\n                                  std::to_string((start + chunkSize)>fileSize?fileSize:(start + chunkSize)));\n                headers.insert(std::pair<std::string, std::string>(\"Range\", range));\n                std::vector<char> data =getBinary(subpath, headers, http::Query());\n                stream.write(data.data(), data.size());\n                stream.good()\n                    ? start += chunkSize\n                    : throw ArbiterError(\"Unable to write to local handle.\");\n                --numChunks;\n            }\n            stream.close();\n        }\n        else\n        {\n            drivers::Fs fs;\n            fs.put(local, getBinary(subpath));\n        }\n        handle.reset(new LocalHandle(local, true));\n    }\n    else\n    {\n        handle.reset(new LocalHandle(expandTilde(fullPath(subpath)), false));\n    }\n\n    return handle;\n}\n\nstd::string Endpoint::get(const std::string subpath) const\n{\n    return m_driver.get(fullPath(subpath));\n}\n\nstd::unique_ptr<std::string> Endpoint::tryGet(const std::string subpath)\n    const\n{\n    return m_driver.tryGet(fullPath(subpath));\n}\n\nstd::vector<char> Endpoint::getBinary(const std::string subpath) const\n{\n    return m_driver.getBinary(fullPath(subpath));\n}\n\nstd::unique_ptr<std::vector<char>> Endpoint::tryGetBinary(\n        const std::string subpath) const\n{\n    return m_driver.tryGetBinary(fullPath(subpath));\n}\n\nstd::size_t Endpoint::getSize(const std::string subpath) const\n{\n    return m_driver.getSize(fullPath(subpath));\n}\n\nstd::unique_ptr<std::size_t> Endpoint::tryGetSize(\n        const std::string subpath) const\n{\n    return m_driver.tryGetSize(fullPath(subpath));\n}\n\nvoid Endpoint::put(const std::string subpath, const std::string& data) const\n{\n    m_driver.put(fullPath(subpath), data);\n}\n\nvoid Endpoint::put(\n        const std::string subpath,\n        const std::vector<char>& data) const\n{\n    m_driver.put(fullPath(subpath), data);\n}\n\nstd::string Endpoint::get(\n        const std::string subpath,\n        const http::Headers headers,\n        const http::Query query) const\n{\n    return getHttpDriver().get(fullPath(subpath), headers, query);\n}\n\nstd::unique_ptr<std::string> Endpoint::tryGet(\n        const std::string subpath,\n        const http::Headers headers,\n        const http::Query query) const\n{\n    return getHttpDriver().tryGet(fullPath(subpath), headers, query);\n}\n\nstd::vector<char> Endpoint::getBinary(\n        const std::string subpath,\n        const http::Headers headers,\n        const http::Query query) const\n{\n    return getHttpDriver().getBinary(fullPath(subpath), headers, query);\n}\n\nstd::unique_ptr<std::vector<char>> Endpoint::tryGetBinary(\n        const std::string subpath,\n        const http::Headers headers,\n        const http::Query query) const\n{\n    return getHttpDriver().tryGetBinary(fullPath(subpath), headers, query);\n}\n\nvoid Endpoint::put(\n        const std::string path,\n        const std::string& data,\n        const http::Headers headers,\n        const http::Query query) const\n{\n    getHttpDriver().put(path, data, headers, query);\n}\n\nvoid Endpoint::put(\n        const std::string path,\n        const std::vector<char>& data,\n        const http::Headers headers,\n        const http::Query query) const\n{\n    getHttpDriver().put(path, data, headers, query);\n}\n\nhttp::Response Endpoint::httpGet(\n        std::string path,\n        http::Headers headers,\n        http::Query query,\n        const std::size_t reserve) const\n{\n    return getHttpDriver().internalGet(fullPath(path), headers, query, reserve);\n}\n\nhttp::Response Endpoint::httpPut(\n        std::string path,\n        const std::vector<char>& data,\n        http::Headers headers,\n        http::Query query) const\n{\n    return getHttpDriver().internalPut(fullPath(path), data, headers, query);\n}\n\nhttp::Response Endpoint::httpHead(\n        std::string path,\n        http::Headers headers,\n        http::Query query) const\n{\n    return getHttpDriver().internalHead(fullPath(path), headers, query);\n}\n\nhttp::Response Endpoint::httpPost(\n        std::string path,\n        const std::vector<char>& data,\n        http::Headers headers,\n        http::Query query) const\n{\n    return getHttpDriver().internalPost(fullPath(path), data, headers, query);\n}\n\nstd::string Endpoint::fullPath(const std::string& subpath) const\n{\n    return m_root + subpath;\n}\n\nstd::string Endpoint::prefixedFullPath(const std::string& subpath) const\n{\n     return softPrefix() + fullPath(subpath);\n}\n\nEndpoint Endpoint::getSubEndpoint(std::string subpath) const\n{\n    return Endpoint(m_driver, m_root + subpath);\n}\n\nstd::string Endpoint::softPrefix() const\n{\n    return isRemote() ? type() + \":\/\/\" : \"\";\n}\n\nconst drivers::Http* Endpoint::tryGetHttpDriver() const\n{\n    return dynamic_cast<const drivers::Http*>(&m_driver);\n}\n\nconst drivers::Http& Endpoint::getHttpDriver() const\n{\n    if (auto d = tryGetHttpDriver()) return *d;\n    else throw ArbiterError(\"Cannot get driver of type \" + type() + \" as HTTP\");\n}\n\n} \/\/ namespace arbiter\n\n#ifdef ARBITER_CUSTOM_NAMESPACE\n}\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\n\/\/\n\/\/ This source file is part of appleseed.\n\/\/ Visit http:\/\/appleseedhq.net\/ for additional information and resources.\n\/\/\n\/\/ This software is released under the MIT license.\n\/\/\n\/\/ Copyright (c) 2010-2013 Francois Beaune, Jupiter Jazz Limited\n\/\/ Copyright (c) 2014-2017 Francois Beaune, The appleseedhq Organization\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\/\/\n\n\/\/ Interface header.\n#include \"materialfactoryregistrar.h\"\n\n\/\/ appleseed.renderer headers.\n#include \"renderer\/modeling\/material\/genericmaterial.h\"\n#include \"renderer\/modeling\/material\/material.h\"\n#include \"renderer\/modeling\/material\/oslmaterial.h\"\n#ifdef APPLESEED_WITH_DISNEY_MATERIAL\n#include \"renderer\/modeling\/material\/disneymaterial.h\"\n#endif\n\n\/\/ appleseed.foundation headers.\n#include \"foundation\/utility\/foreach.h\"\n#include \"foundation\/utility\/registrar.h\"\n\n\/\/ Standard headers.\n#include <cassert>\n#include <string>\n\nusing namespace foundation;\nusing namespace std;\n\nnamespace renderer\n{\n\nAPPLESEED_DEFINE_APIARRAY(MaterialFactoryArray);\n\nstruct MaterialFactoryRegistrar::Impl\n{\n    Registrar<IMaterialFactory> m_registrar;\n};\n\nMaterialFactoryRegistrar::MaterialFactoryRegistrar()\n  : impl(new Impl())\n{\n    register_factory(auto_ptr<FactoryType>(new GenericMaterialFactory()));\n\n    register_factory(auto_ptr<FactoryType>(new OSLMaterialFactory()));\n\n#ifdef APPLESEED_WITH_DISNEY_MATERIAL\n    register_factory(auto_ptr<FactoryType>(new DisneyMaterialFactory()));\n#endif\n}\n\nMaterialFactoryRegistrar::~MaterialFactoryRegistrar()\n{\n    delete impl;\n}\n\nvoid MaterialFactoryRegistrar::register_factory(auto_ptr<FactoryType> factory)\n{\n    const string model = factory->get_model();\n    impl->m_registrar.insert(model, factory);\n}\n\nMaterialFactoryArray MaterialFactoryRegistrar::get_factories() const\n{\n    FactoryArrayType factories;\n\n    for (const_each<Registrar<FactoryType>::Items> i = impl->m_registrar.items(); i; ++i)\n        factories.push_back(i->second);\n\n    return factories;\n}\n\nconst MaterialFactoryRegistrar::FactoryType* MaterialFactoryRegistrar::lookup(const char* name) const\n{\n    assert(name);\n\n    return impl->m_registrar.lookup(name);\n}\n\n}   \/\/ namespace renderer\n<commit_msg>Cosmetics<commit_after>\n\/\/\n\/\/ This source file is part of appleseed.\n\/\/ Visit http:\/\/appleseedhq.net\/ for additional information and resources.\n\/\/\n\/\/ This software is released under the MIT license.\n\/\/\n\/\/ Copyright (c) 2010-2013 Francois Beaune, Jupiter Jazz Limited\n\/\/ Copyright (c) 2014-2017 Francois Beaune, The appleseedhq Organization\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\/\/\n\n\/\/ Interface header.\n#include \"materialfactoryregistrar.h\"\n\n\/\/ appleseed.renderer headers.\n#ifdef APPLESEED_WITH_DISNEY_MATERIAL\n#include \"renderer\/modeling\/material\/disneymaterial.h\"\n#endif\n#include \"renderer\/modeling\/material\/genericmaterial.h\"\n#include \"renderer\/modeling\/material\/material.h\"\n#include \"renderer\/modeling\/material\/oslmaterial.h\"\n\n\/\/ appleseed.foundation headers.\n#include \"foundation\/utility\/foreach.h\"\n#include \"foundation\/utility\/registrar.h\"\n\n\/\/ Standard headers.\n#include <cassert>\n#include <string>\n\nusing namespace foundation;\nusing namespace std;\n\nnamespace renderer\n{\n\nAPPLESEED_DEFINE_APIARRAY(MaterialFactoryArray);\n\nstruct MaterialFactoryRegistrar::Impl\n{\n    Registrar<IMaterialFactory> m_registrar;\n};\n\nMaterialFactoryRegistrar::MaterialFactoryRegistrar()\n  : impl(new Impl())\n{\n#ifdef APPLESEED_WITH_DISNEY_MATERIAL\n    register_factory(auto_ptr<FactoryType>(new DisneyMaterialFactory()));\n#endif\n    register_factory(auto_ptr<FactoryType>(new GenericMaterialFactory()));\n    register_factory(auto_ptr<FactoryType>(new OSLMaterialFactory()));\n}\n\nMaterialFactoryRegistrar::~MaterialFactoryRegistrar()\n{\n    delete impl;\n}\n\nvoid MaterialFactoryRegistrar::register_factory(auto_ptr<FactoryType> factory)\n{\n    const string model = factory->get_model();\n    impl->m_registrar.insert(model, factory);\n}\n\nMaterialFactoryArray MaterialFactoryRegistrar::get_factories() const\n{\n    FactoryArrayType factories;\n\n    for (const_each<Registrar<FactoryType>::Items> i = impl->m_registrar.items(); i; ++i)\n        factories.push_back(i->second);\n\n    return factories;\n}\n\nconst MaterialFactoryRegistrar::FactoryType* MaterialFactoryRegistrar::lookup(const char* name) const\n{\n    assert(name);\n\n    return impl->m_registrar.lookup(name);\n}\n\n}   \/\/ namespace renderer\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\/kernels\/linalg_ops_common.h\"\n\n#include <utility>\n\n#include \"third_party\/eigen3\/Eigen\/Core\"\n#include \"tensorflow\/core\/framework\/device_base.h\"\n#include \"tensorflow\/core\/framework\/kernel_def_builder.h\"\n#include \"tensorflow\/core\/framework\/op_kernel.h\"\n#include \"tensorflow\/core\/framework\/tensor_shape.h\"\n#include \"tensorflow\/core\/lib\/core\/errors.h\"\n#include \"tensorflow\/core\/platform\/logging.h\"\n#include \"tensorflow\/core\/platform\/types.h\"\n\nnamespace tensorflow {\n\n\/\/ static\ntemplate <class InputScalar, class OutputScalar>\nvoid LinearAlgebraOp<InputScalar, OutputScalar>::ValidateSingleMatrix(\n    OpKernelContext* context, const TensorShapes& input_matrix_shapes) {\n  OP_REQUIRES(context, input_matrix_shapes.size() == 1,\n              errors::InvalidArgument(\"Expected a single input matrix, got %d.\",\n                                      input_matrix_shapes.size()));\n  OP_REQUIRES(context, TensorShapeUtils::IsMatrix(input_matrix_shapes[0]),\n              errors::InvalidArgument(\"Input must be a matrix.\"));\n}\n\n\/\/ static\ntemplate <class InputScalar, class OutputScalar>\nvoid LinearAlgebraOp<InputScalar, OutputScalar>::ValidateSingleSquareMatrix(\n    OpKernelContext* context, const TensorShapes& input_matrix_shapes) {\n  OP_REQUIRES(context, input_matrix_shapes.size() == 1,\n              errors::InvalidArgument(\"Expected a single input matrix, got %d.\",\n                                      input_matrix_shapes.size()));\n  OP_REQUIRES(context, TensorShapeUtils::IsSquareMatrix(input_matrix_shapes[0]),\n              errors::InvalidArgument(\"Input matrix must be square.\"));\n}\n\n\/\/ static\ntemplate <class InputScalar, class OutputScalar>\nvoid LinearAlgebraOp<InputScalar, OutputScalar>::ValidateSolver(\n    OpKernelContext* context, const TensorShapes& input_matrix_shapes) {\n  OP_REQUIRES(context, input_matrix_shapes.size() == 2,\n              errors::InvalidArgument(\"Expected two input matrices, got %d.\",\n                                      input_matrix_shapes.size()));\n  OP_REQUIRES(context, TensorShapeUtils::IsMatrix(input_matrix_shapes[0]),\n              errors::InvalidArgument(\"First input (lhs) must be a matrix.\"));\n  OP_REQUIRES(context, TensorShapeUtils::IsMatrix(input_matrix_shapes[1]),\n              errors::InvalidArgument(\"Second input (rhs) must be a matrix.\"));\n  OP_REQUIRES(\n      context,\n      input_matrix_shapes[0].dim_size(0) == input_matrix_shapes[1].dim_size(0),\n      errors::InvalidArgument(\"Input matrix and rhs are incompatible.\"));\n}\n\n\/\/ static\ntemplate <class InputScalar, class OutputScalar>\nvoid LinearAlgebraOp<InputScalar, OutputScalar>::ValidateSquareSolver(\n    OpKernelContext* context, const TensorShapes& input_matrix_shapes) {\n  OP_REQUIRES(context, input_matrix_shapes.size() == 2,\n              errors::InvalidArgument(\"Expected two input matrices, got %d.\",\n                                      input_matrix_shapes.size()));\n  OP_REQUIRES(\n      context, TensorShapeUtils::IsSquareMatrix(input_matrix_shapes[0]),\n      errors::InvalidArgument(\"First input (lhs) must be a square matrix.\"));\n  OP_REQUIRES(context, TensorShapeUtils::IsMatrix(input_matrix_shapes[1]),\n              errors::InvalidArgument(\"Second input (rhs) must be a matrix.\"));\n  OP_REQUIRES(\n      context,\n      input_matrix_shapes[0].dim_size(0) == input_matrix_shapes[1].dim_size(0),\n      errors::InvalidArgument(\"Input matrix and rhs are incompatible.\"));\n}\n\ntemplate <class InputScalar, class OutputScalar>\nvoid LinearAlgebraOp<InputScalar, OutputScalar>::Compute(\n    OpKernelContext* context) {\n  TensorInputs inputs;\n  TensorShapes input_matrix_shapes;\n  TensorShape batch_shape;\n  AnalyzeInputs(context, &inputs, &input_matrix_shapes, &batch_shape);\n\n  TensorShapes output_matrix_shapes;\n  TensorOutputs outputs;\n  PrepareOutputs(context, input_matrix_shapes, batch_shape, &outputs,\n                 &output_matrix_shapes);\n\n  \/\/ Process the individual matrix problems in parallel using a threadpool.\n  auto shard = [this, &inputs, &input_matrix_shapes, &outputs,\n                &output_matrix_shapes, context](int64 begin, int64 end) {\n    for (int64 i = begin; i < end; ++i) {\n      ComputeTensorSlice(context, i, inputs, input_matrix_shapes, outputs,\n                         output_matrix_shapes);\n    }\n  };\n  auto worker_threads = *(context->device()->tensorflow_cpu_worker_threads());\n  Shard(worker_threads.num_threads, worker_threads.workers,\n        batch_shape.num_elements(), GetCostPerUnit(input_matrix_shapes), shard);\n}\n\ntemplate <class InputScalar, class OutputScalar>\nvoid LinearAlgebraOp<InputScalar, OutputScalar>::AnalyzeInputs(\n    OpKernelContext* context, TensorInputs* inputs,\n    TensorShapes* input_matrix_shapes, TensorShape* batch_shape) {\n  int input_rank = -1;\n  for (int i = 0; i < NumMatrixInputs(context); ++i) {\n    const Tensor& in = context->input(i);\n    if (i == 0) {\n      input_rank = in.dims();\n      OP_REQUIRES(\n          context, input_rank >= 2,\n          errors::InvalidArgument(\"Input tensor \", i,\n                                  \" must have rank >= 2, got \", input_rank));\n      \/\/ If the tensor rank is greater than 2, we consider the inner-most\n      \/\/ dimensions as matrices, and loop over all the other outer (\"batch\")\n      \/\/ dimensions to compute the results.\n      for (int dim = 0; dim < input_rank - 2; ++dim) {\n        batch_shape->AddDim(in.dim_size(dim));\n      }\n    } else {\n      \/\/ Make sure that all inputs have the same rank and outer dimensions.\n      OP_REQUIRES(context, input_rank == in.dims(),\n                  errors::InvalidArgument(\n                      \"All input tensors must have the same rank.\"));\n      for (int dim = 0; dim < input_rank - 2; ++dim) {\n        OP_REQUIRES(\n            context, in.dim_size(dim) == batch_shape->dim_size(dim),\n            errors::InvalidArgument(\n                \"All input tensors must have the same outer dimensions.\"));\n      }\n    }\n\n    const int row_dimension = input_rank - 2;\n    const int col_dimension = input_rank - 1;\n    const int64 num_rows = in.dim_size(row_dimension);\n    const int64 num_cols = in.dim_size(col_dimension);\n    input_matrix_shapes->emplace_back(\n        std::initializer_list<int64>({num_rows, num_cols}));\n    inputs->emplace_back(&in);\n  }\n  \/\/ Have the derived class validate that the inputs are as expected.\n  ValidateInputMatrixShapes(context, *input_matrix_shapes);\n}\n\ntemplate <class InputScalar, class OutputScalar>\nvoid LinearAlgebraOp<InputScalar, OutputScalar>::PrepareOutputs(\n    OpKernelContext* context, const TensorShapes& input_matrix_shapes,\n    const TensorShape& batch_shape, TensorOutputs* outputs,\n    TensorShapes* output_matrix_shapes) {\n  \/\/ Get shape for each of the matrix outputs produced by the derived class.\n  *output_matrix_shapes = GetOutputMatrixShapes(input_matrix_shapes);\n  const int num_outputs = output_matrix_shapes->size();\n\n  \/\/ Make sure the number of op outputs is what the derived class expects.\n  OP_REQUIRES(\n      context, num_outputs <= context->num_outputs(),\n      errors::Internal(\n          \"Derived class expected more outputs (%d) that the op has (%d).\",\n          num_outputs, context->num_outputs()));\n\n  \/\/ Allocate outputs.\n  std::set<int> unused_inputs;\n  for (int input_idx = 0; input_idx < context->num_inputs(); ++input_idx) {\n    unused_inputs.insert(input_idx);\n  }\n  for (int output_idx = 0; output_idx < context->num_outputs(); ++output_idx) {\n    TensorShape output_tensor_shape({});\n    if (output_idx < num_outputs) {\n      \/\/ This output is used, set up output shape and allocate it.\n      const TensorShape& output_matrix_shape =\n          output_matrix_shapes->at(output_idx);\n      OP_REQUIRES(context, output_matrix_shape.dims() <= 2,\n                  errors::InvalidArgument(\n                      \"Rank of matrix output no. %d must be 0, 1 or 2, got %d.\",\n                      output_idx, output_matrix_shape.dims()));\n\n      \/\/ The final output has the shape of the outer batch dimensions\n      \/\/ concatenated with the output_matrix_shape (if the output is not\n      \/\/ scalar).\n      output_tensor_shape = batch_shape;\n      output_tensor_shape.AppendShape(output_matrix_shape);\n    }\n    Tensor* out = nullptr;\n    \/\/ See if there is an input buffer we can reuse for this output.\n    bool reused_input = false;\n    if (EnableInputForwarding()) {\n      for (int input_idx : unused_inputs) {\n        if (context->forward_input_to_output_with_shape(\n                input_idx, output_idx, output_tensor_shape, &out)) {\n          reused_input = true;\n          unused_inputs.erase(input_idx);\n          break;\n        }\n      }\n    }\n    if (!reused_input) {\n      OP_REQUIRES_OK(context, context->allocate_output(\n                                  output_idx, output_tensor_shape, &out));\n    }\n    outputs->emplace_back(out);\n  }\n}\n\ntemplate <class InputScalar, class OutputScalar>\nvoid LinearAlgebraOp<InputScalar, OutputScalar>::ComputeTensorSlice(\n    OpKernelContext* context, int64 matrix_index, const TensorInputs& inputs,\n    const TensorShapes& input_matrix_shapes, const TensorOutputs& outputs,\n    const TensorShapes& output_matrix_shapes) {\n  InputConstMatrixMaps matrix_inputs;\n  for (size_t i = 0; i < inputs.size(); ++i) {\n    \/\/ TODO(kalakris): Handle alignment if possible. Eigen::Map is\n    \/\/ unaligned by default.\n    matrix_inputs.emplace_back(\n        inputs[i]->flat<InputScalar>().data() +\n            matrix_index * input_matrix_shapes[i].num_elements(),\n        input_matrix_shapes[i].dim_size(0), input_matrix_shapes[i].dim_size(1));\n  }\n\n  OutputMatrixMaps matrix_outputs;\n  for (size_t i = 0; i < output_matrix_shapes.size(); ++i) {\n    \/\/ The output matrix shape may not be a matrix.\n    int num_output_rows = output_matrix_shapes[i].dims() >= 1\n                              ? output_matrix_shapes[i].dim_size(0)\n                              : 1;\n    int num_output_cols = output_matrix_shapes[i].dims() == 2\n                              ? output_matrix_shapes[i].dim_size(1)\n                              : 1;\n    matrix_outputs.emplace_back(\n        outputs[i]->flat<OutputScalar>().data() +\n            matrix_index * output_matrix_shapes[i].num_elements(),\n        num_output_rows, num_output_cols);\n  }\n  ComputeMatrix(context, matrix_inputs, &matrix_outputs);\n}\n\n\/\/ Explicitly instantiate LinearAlgebraOp for the scalar types we expect to use.\ntemplate class LinearAlgebraOp<float>;\ntemplate class LinearAlgebraOp<double>;\ntemplate class LinearAlgebraOp<complex64>;\ntemplate class LinearAlgebraOp<complex128>;\ntemplate class LinearAlgebraOp<float, complex64>;\ntemplate class LinearAlgebraOp<double, complex128>;\n\n}  \/\/ namespace tensorflow\n<commit_msg>Return if an error status was set in LinearAlgebraOp::AnalyzeInput() or LinearAlgebraOp::PrepareOutputs(), instead of potentially crashing.<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\/kernels\/linalg_ops_common.h\"\n\n#include <utility>\n\n#include \"third_party\/eigen3\/Eigen\/Core\"\n#include \"tensorflow\/core\/framework\/device_base.h\"\n#include \"tensorflow\/core\/framework\/kernel_def_builder.h\"\n#include \"tensorflow\/core\/framework\/op_kernel.h\"\n#include \"tensorflow\/core\/framework\/tensor_shape.h\"\n#include \"tensorflow\/core\/lib\/core\/errors.h\"\n#include \"tensorflow\/core\/platform\/logging.h\"\n#include \"tensorflow\/core\/platform\/types.h\"\n\nnamespace tensorflow {\n\n\/\/ static\ntemplate <class InputScalar, class OutputScalar>\nvoid LinearAlgebraOp<InputScalar, OutputScalar>::ValidateSingleMatrix(\n    OpKernelContext* context, const TensorShapes& input_matrix_shapes) {\n  OP_REQUIRES(context, input_matrix_shapes.size() == 1,\n              errors::InvalidArgument(\"Expected a single input matrix, got %d.\",\n                                      input_matrix_shapes.size()));\n  OP_REQUIRES(context, TensorShapeUtils::IsMatrix(input_matrix_shapes[0]),\n              errors::InvalidArgument(\"Input must be a matrix.\"));\n}\n\n\/\/ static\ntemplate <class InputScalar, class OutputScalar>\nvoid LinearAlgebraOp<InputScalar, OutputScalar>::ValidateSingleSquareMatrix(\n    OpKernelContext* context, const TensorShapes& input_matrix_shapes) {\n  OP_REQUIRES(context, input_matrix_shapes.size() == 1,\n              errors::InvalidArgument(\"Expected a single input matrix, got %d.\",\n                                      input_matrix_shapes.size()));\n  OP_REQUIRES(context, TensorShapeUtils::IsSquareMatrix(input_matrix_shapes[0]),\n              errors::InvalidArgument(\"Input matrix must be square.\"));\n}\n\n\/\/ static\ntemplate <class InputScalar, class OutputScalar>\nvoid LinearAlgebraOp<InputScalar, OutputScalar>::ValidateSolver(\n    OpKernelContext* context, const TensorShapes& input_matrix_shapes) {\n  OP_REQUIRES(context, input_matrix_shapes.size() == 2,\n              errors::InvalidArgument(\"Expected two input matrices, got %d.\",\n                                      input_matrix_shapes.size()));\n  OP_REQUIRES(context, TensorShapeUtils::IsMatrix(input_matrix_shapes[0]),\n              errors::InvalidArgument(\"First input (lhs) must be a matrix.\"));\n  OP_REQUIRES(context, TensorShapeUtils::IsMatrix(input_matrix_shapes[1]),\n              errors::InvalidArgument(\"Second input (rhs) must be a matrix.\"));\n  OP_REQUIRES(\n      context,\n      input_matrix_shapes[0].dim_size(0) == input_matrix_shapes[1].dim_size(0),\n      errors::InvalidArgument(\"Input matrix and rhs are incompatible.\"));\n}\n\n\/\/ static\ntemplate <class InputScalar, class OutputScalar>\nvoid LinearAlgebraOp<InputScalar, OutputScalar>::ValidateSquareSolver(\n    OpKernelContext* context, const TensorShapes& input_matrix_shapes) {\n  OP_REQUIRES(context, input_matrix_shapes.size() == 2,\n              errors::InvalidArgument(\"Expected two input matrices, got %d.\",\n                                      input_matrix_shapes.size()));\n  OP_REQUIRES(\n      context, TensorShapeUtils::IsSquareMatrix(input_matrix_shapes[0]),\n      errors::InvalidArgument(\"First input (lhs) must be a square matrix.\"));\n  OP_REQUIRES(context, TensorShapeUtils::IsMatrix(input_matrix_shapes[1]),\n              errors::InvalidArgument(\"Second input (rhs) must be a matrix.\"));\n  OP_REQUIRES(\n      context,\n      input_matrix_shapes[0].dim_size(0) == input_matrix_shapes[1].dim_size(0),\n      errors::InvalidArgument(\"Input matrix and rhs are incompatible.\"));\n}\n\ntemplate <class InputScalar, class OutputScalar>\nvoid LinearAlgebraOp<InputScalar, OutputScalar>::Compute(\n    OpKernelContext* context) {\n  TensorInputs inputs;\n  TensorShapes input_matrix_shapes;\n  TensorShape batch_shape;\n  AnalyzeInputs(context, &inputs, &input_matrix_shapes, &batch_shape);\n  if (!context->status().ok()) return;\n\n  TensorShapes output_matrix_shapes;\n  TensorOutputs outputs;\n  PrepareOutputs(context, input_matrix_shapes, batch_shape, &outputs,\n                 &output_matrix_shapes);\n  if (!context->status().ok()) return;\n\n  \/\/ Process the individual matrix problems in parallel using a threadpool.\n  auto shard = [this, &inputs, &input_matrix_shapes, &outputs,\n                &output_matrix_shapes, context](int64 begin, int64 end) {\n    for (int64 i = begin; i < end; ++i) {\n      ComputeTensorSlice(context, i, inputs, input_matrix_shapes, outputs,\n                         output_matrix_shapes);\n    }\n  };\n  auto worker_threads = *(context->device()->tensorflow_cpu_worker_threads());\n  Shard(worker_threads.num_threads, worker_threads.workers,\n        batch_shape.num_elements(), GetCostPerUnit(input_matrix_shapes), shard);\n}\n\ntemplate <class InputScalar, class OutputScalar>\nvoid LinearAlgebraOp<InputScalar, OutputScalar>::AnalyzeInputs(\n    OpKernelContext* context, TensorInputs* inputs,\n    TensorShapes* input_matrix_shapes, TensorShape* batch_shape) {\n  int input_rank = -1;\n  for (int i = 0; i < NumMatrixInputs(context); ++i) {\n    const Tensor& in = context->input(i);\n    if (i == 0) {\n      input_rank = in.dims();\n      OP_REQUIRES(\n          context, input_rank >= 2,\n          errors::InvalidArgument(\"Input tensor \", i,\n                                  \" must have rank >= 2, got \", input_rank));\n      \/\/ If the tensor rank is greater than 2, we consider the inner-most\n      \/\/ dimensions as matrices, and loop over all the other outer (\"batch\")\n      \/\/ dimensions to compute the results.\n      for (int dim = 0; dim < input_rank - 2; ++dim) {\n        batch_shape->AddDim(in.dim_size(dim));\n      }\n    } else {\n      \/\/ Make sure that all inputs have the same rank and outer dimensions.\n      OP_REQUIRES(context, input_rank == in.dims(),\n                  errors::InvalidArgument(\n                      \"All input tensors must have the same rank.\"));\n      for (int dim = 0; dim < input_rank - 2; ++dim) {\n        OP_REQUIRES(\n            context, in.dim_size(dim) == batch_shape->dim_size(dim),\n            errors::InvalidArgument(\n                \"All input tensors must have the same outer dimensions.\"));\n      }\n    }\n\n    const int row_dimension = input_rank - 2;\n    const int col_dimension = input_rank - 1;\n    const int64 num_rows = in.dim_size(row_dimension);\n    const int64 num_cols = in.dim_size(col_dimension);\n    input_matrix_shapes->emplace_back(\n        std::initializer_list<int64>({num_rows, num_cols}));\n    inputs->emplace_back(&in);\n  }\n  \/\/ Have the derived class validate that the inputs are as expected.\n  ValidateInputMatrixShapes(context, *input_matrix_shapes);\n}\n\ntemplate <class InputScalar, class OutputScalar>\nvoid LinearAlgebraOp<InputScalar, OutputScalar>::PrepareOutputs(\n    OpKernelContext* context, const TensorShapes& input_matrix_shapes,\n    const TensorShape& batch_shape, TensorOutputs* outputs,\n    TensorShapes* output_matrix_shapes) {\n  \/\/ Get shape for each of the matrix outputs produced by the derived class.\n  *output_matrix_shapes = GetOutputMatrixShapes(input_matrix_shapes);\n  const int num_outputs = output_matrix_shapes->size();\n\n  \/\/ Make sure the number of op outputs is what the derived class expects.\n  OP_REQUIRES(\n      context, num_outputs <= context->num_outputs(),\n      errors::Internal(\n          \"Derived class expected more outputs (%d) that the op has (%d).\",\n          num_outputs, context->num_outputs()));\n\n  \/\/ Allocate outputs.\n  std::set<int> unused_inputs;\n  for (int input_idx = 0; input_idx < context->num_inputs(); ++input_idx) {\n    unused_inputs.insert(input_idx);\n  }\n  for (int output_idx = 0; output_idx < context->num_outputs(); ++output_idx) {\n    TensorShape output_tensor_shape({});\n    if (output_idx < num_outputs) {\n      \/\/ This output is used, set up output shape and allocate it.\n      const TensorShape& output_matrix_shape =\n          output_matrix_shapes->at(output_idx);\n      OP_REQUIRES(context, output_matrix_shape.dims() <= 2,\n                  errors::InvalidArgument(\n                      \"Rank of matrix output no. %d must be 0, 1 or 2, got %d.\",\n                      output_idx, output_matrix_shape.dims()));\n\n      \/\/ The final output has the shape of the outer batch dimensions\n      \/\/ concatenated with the output_matrix_shape (if the output is not\n      \/\/ scalar).\n      output_tensor_shape = batch_shape;\n      output_tensor_shape.AppendShape(output_matrix_shape);\n    }\n    Tensor* out = nullptr;\n    \/\/ See if there is an input buffer we can reuse for this output.\n    bool reused_input = false;\n    if (EnableInputForwarding()) {\n      for (int input_idx : unused_inputs) {\n        if (context->forward_input_to_output_with_shape(\n                input_idx, output_idx, output_tensor_shape, &out)) {\n          reused_input = true;\n          unused_inputs.erase(input_idx);\n          break;\n        }\n      }\n    }\n    if (!reused_input) {\n      OP_REQUIRES_OK(context, context->allocate_output(\n                                  output_idx, output_tensor_shape, &out));\n    }\n    outputs->emplace_back(out);\n  }\n}\n\ntemplate <class InputScalar, class OutputScalar>\nvoid LinearAlgebraOp<InputScalar, OutputScalar>::ComputeTensorSlice(\n    OpKernelContext* context, int64 matrix_index, const TensorInputs& inputs,\n    const TensorShapes& input_matrix_shapes, const TensorOutputs& outputs,\n    const TensorShapes& output_matrix_shapes) {\n  InputConstMatrixMaps matrix_inputs;\n  for (size_t i = 0; i < inputs.size(); ++i) {\n    \/\/ TODO(kalakris): Handle alignment if possible. Eigen::Map is\n    \/\/ unaligned by default.\n    matrix_inputs.emplace_back(\n        inputs[i]->flat<InputScalar>().data() +\n            matrix_index * input_matrix_shapes[i].num_elements(),\n        input_matrix_shapes[i].dim_size(0), input_matrix_shapes[i].dim_size(1));\n  }\n\n  OutputMatrixMaps matrix_outputs;\n  for (size_t i = 0; i < output_matrix_shapes.size(); ++i) {\n    \/\/ The output matrix shape may not be a matrix.\n    int num_output_rows = output_matrix_shapes[i].dims() >= 1\n                              ? output_matrix_shapes[i].dim_size(0)\n                              : 1;\n    int num_output_cols = output_matrix_shapes[i].dims() == 2\n                              ? output_matrix_shapes[i].dim_size(1)\n                              : 1;\n    matrix_outputs.emplace_back(\n        outputs[i]->flat<OutputScalar>().data() +\n            matrix_index * output_matrix_shapes[i].num_elements(),\n        num_output_rows, num_output_cols);\n  }\n  ComputeMatrix(context, matrix_inputs, &matrix_outputs);\n}\n\n\/\/ Explicitly instantiate LinearAlgebraOp for the scalar types we expect to use.\ntemplate class LinearAlgebraOp<float>;\ntemplate class LinearAlgebraOp<double>;\ntemplate class LinearAlgebraOp<complex64>;\ntemplate class LinearAlgebraOp<complex128>;\ntemplate class LinearAlgebraOp<float, complex64>;\ntemplate class LinearAlgebraOp<double, complex128>;\n\n}  \/\/ namespace tensorflow\n<|endoftext|>"}
{"text":"<commit_before>\/*-----------------------------------------------------------------------------------------------\nThe MIT License (MIT)\n\nCopyright (c) 2015 OSRE ( Open Source Render Engine ) by Kim Kulling\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#include <gtest\/gtest.h>\n#include <osre\/App\/AssetRegistry.h>\n#include <osre\/IO\/Uri.h>\n\nnamespace OSRE {\nnamespace UnitTest {\n\nusing namespace ::OSRE::App;\n\nclass AssetRegistryTest : public ::testing::Test {\nprotected:\n    void SetUp() override{\n        AssetRegistry *reg( AssetRegistry::create() );\n        EXPECT_NE( nullptr, reg );\n#ifdef OSRE_WINDOWS\n        AssetRegistry::registerAssetPath( \"assets\", \"..\/..\/assets\" );\n#else\n        AssetRegistry::registerAssetPath( \"assets\", \"..\/assets\" );\n#endif \n    }\n\n    void TearDown() override {\n        AssetRegistry::destroy();\n    }\n};\n\nTEST_F( AssetRegistryTest, createTest ) {\n    bool ok( true );\n    try {\n        AssetRegistry *reg( AssetRegistry::create() );\n        EXPECT_NE( nullptr, reg );\n\n        AssetRegistry::destroy();\n    } catch ( ... ) {\n        ok = false;\n    }\n    EXPECT_TRUE( ok );\n}\n\nTEST_F( AssetRegistryTest, resolve_uri_from_mount_Test ) {\n    static const String ModelPath = \"file:\/\/assets\/Models\/Obj\/spider.obj\";\n    IO::Uri fileUri( ModelPath );\n    String loc = AssetRegistry::resolvePathFromUri( fileUri );\n#ifdef OSRE_WINDOWS\n    static const String expRes = \"..\/..\/media\/Models\/Obj\/spider.obj\";\n#else\n    static const String expRes = \"..\/media\/Models\/Obj\/spider.obj\";\n#endif\n    EXPECT_EQ( expRes, loc );\n}\n\n}\n}\n<commit_msg>Fix result of unittest<commit_after>\/*-----------------------------------------------------------------------------------------------\nThe MIT License (MIT)\n\nCopyright (c) 2015 OSRE ( Open Source Render Engine ) by Kim Kulling\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#include <gtest\/gtest.h>\n#include <osre\/App\/AssetRegistry.h>\n#include <osre\/IO\/Uri.h>\n\nnamespace OSRE {\nnamespace UnitTest {\n\nusing namespace ::OSRE::App;\n\nclass AssetRegistryTest : public ::testing::Test {\nprotected:\n    void SetUp() override{\n        AssetRegistry *reg( AssetRegistry::create() );\n        EXPECT_NE( nullptr, reg );\n#ifdef OSRE_WINDOWS\n        AssetRegistry::registerAssetPath( \"assets\", \"..\/..\/assets\" );\n#else\n        AssetRegistry::registerAssetPath( \"assets\", \"..\/assets\" );\n#endif \n    }\n\n    void TearDown() override {\n        AssetRegistry::destroy();\n    }\n};\n\nTEST_F( AssetRegistryTest, createTest ) {\n    bool ok( true );\n    try {\n        AssetRegistry *reg( AssetRegistry::create() );\n        EXPECT_NE( nullptr, reg );\n\n        AssetRegistry::destroy();\n    } catch ( ... ) {\n        ok = false;\n    }\n    EXPECT_TRUE( ok );\n}\n\nTEST_F( AssetRegistryTest, resolve_uri_from_mount_Test ) {\n    static const String ModelPath = \"file:\/\/assets\/Models\/Obj\/spider.obj\";\n    IO::Uri fileUri( ModelPath );\n    String loc = AssetRegistry::resolvePathFromUri( fileUri );\n#ifdef OSRE_WINDOWS\n    static const String expRes = \"..\/..\/assets\/Models\/Obj\/spider.obj\";\n#else\n    static const String expRes = \"..\/assets\/Models\/Obj\/spider.obj\";\n#endif\n    EXPECT_EQ( expRes, loc );\n}\n\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ RUN: %clangxx_asan %stdcxx11 -O0 -fsanitize-address-use-after-scope %s -o %t\n\/\/ RUN: not %run %t 0 2>&1 | FileCheck %s\n\/\/ RUN: not %run %t 1 2>&1 | FileCheck %s\n\/\/ RUN: not %run %t 2 2>&1 | FileCheck %s\n\/\/ RUN: not %run %t 3 2>&1 | FileCheck %s\n\/\/ RUN: not %run %t 4 2>&1 | FileCheck %s\n\/\/ RUN: not %run %t 5 2>&1 | FileCheck %s\n\/\/ RUN: not %run %t 6 2>&1 | FileCheck %s\n\/\/ RUN: not %run %t 7 2>&1 | FileCheck %s\n\/\/ RUN: not %run %t 8 2>&1 | FileCheck %s\n\/\/ RUN: not %run %t 9 2>&1 | FileCheck %s\n\/\/ RUN: not %run %t 10 2>&1 | FileCheck %s\n\n#include <stdlib.h>\n#include <string>\n#include <vector>\n\ntemplate <class T> struct Ptr {\n  void Store(T *ptr) { t = ptr; }\n\n  void Access() { *t = {}; }\n\n  T *t;\n};\n\ntemplate <class T, size_t N> struct Ptr<T[N]> {\n  using Type = T[N];\n  void Store(Type *ptr) { t = *ptr; }\n\n  void Access() { *t = {}; }\n\n  T *t;\n};\n\ntemplate <class T> __attribute__((noinline)) void test() {\n  Ptr<T> ptr;\n  {\n    T x;\n    ptr.Store(&x);\n  }\n\n  ptr.Access();\n  \/\/ CHECK: ERROR: AddressSanitizer: stack-use-after-scope\n  \/\/ CHECK:  #{{[0-9]+}} 0x{{.*}} in {{(void )?test.*\\((void)?\\) .*}}use-after-scope-types.cc\n  \/\/ CHECK: Address 0x{{.*}} is located in stack of thread T{{.*}} at offset [[OFFSET:[^ ]+]] in frame\n  \/\/ {{\\[}}[[OFFSET]], {{[0-9]+}}) 'x'\n}\n\nint main(int argc, char **argv) {\n  using Tests = void (*)();\n  Tests tests[] = {\n    &test<bool>,\n    &test<char>,\n    &test<int>,\n    &test<double>,\n    &test<float>,\n    &test<void*>,\n    &test<std::vector<std::string>>,\n    &test<int[3]>,\n    &test<int[1000]>,\n    &test<char[3]>,\n    &test<char[1000]>,\n  };\n\n  int n = atoi(argv[1]);\n  if (n == sizeof(tests) \/ sizeof(tests[0])) {\n    for (auto te : tests)\n      te();\n  } else {\n    tests[n]();\n  }\n\n  return 0;\n}\n<commit_msg>[asan] Disable test on darwin bot<commit_after>\/\/ RUN: %clangxx_asan %stdcxx11 -O0 -fsanitize-address-use-after-scope %s -o %t\n\/\/ RUN: not %run %t 0 2>&1 | FileCheck %s\n\/\/ RUN: not %run %t 1 2>&1 | FileCheck %s\n\/\/ RUN: not %run %t 2 2>&1 | FileCheck %s\n\/\/ RUN: not %run %t 3 2>&1 | FileCheck %s\n\/\/ RUN: not %run %t 4 2>&1 | FileCheck %s\n\/\/ RUN: not %run %t 5 2>&1 | FileCheck %s\n\/\/ RUN: not %run %t 6 2>&1 | FileCheck %s\n\/\/ RUN: not %run %t 7 2>&1 | FileCheck %s\n\/\/ RUN: not %run %t 8 2>&1 | FileCheck %s\n\/\/ RUN: not %run %t 9 2>&1 | FileCheck %s\n\/\/ RUN: not %run %t 10 2>&1 | FileCheck %s\n\n\/\/ Temporarily disable to fix the bot.\n\/\/ XFAIL: darwin\n\n#include <stdlib.h>\n#include <string>\n#include <vector>\n\ntemplate <class T> struct Ptr {\n  void Store(T *ptr) { t = ptr; }\n\n  void Access() { *t = {}; }\n\n  T *t;\n};\n\ntemplate <class T, size_t N> struct Ptr<T[N]> {\n  using Type = T[N];\n  void Store(Type *ptr) { t = *ptr; }\n\n  void Access() { *t = {}; }\n\n  T *t;\n};\n\ntemplate <class T> __attribute__((noinline)) void test() {\n  Ptr<T> ptr;\n  {\n    T x;\n    ptr.Store(&x);\n  }\n\n  ptr.Access();\n  \/\/ CHECK: ERROR: AddressSanitizer: stack-use-after-scope\n  \/\/ CHECK:  #{{[0-9]+}} 0x{{.*}} in {{(void )?test.*\\((void)?\\) .*}}use-after-scope-types.cc\n  \/\/ CHECK: Address 0x{{.*}} is located in stack of thread T{{.*}} at offset [[OFFSET:[^ ]+]] in frame\n  \/\/ {{\\[}}[[OFFSET]], {{[0-9]+}}) 'x'\n}\n\nint main(int argc, char **argv) {\n  using Tests = void (*)();\n  Tests tests[] = {\n    &test<bool>,\n    &test<char>,\n    &test<int>,\n    &test<double>,\n    &test<float>,\n    &test<void*>,\n    &test<std::vector<std::string>>,\n    &test<int[3]>,\n    &test<int[1000]>,\n    &test<char[3]>,\n    &test<char[1000]>,\n  };\n\n  int n = atoi(argv[1]);\n  if (n == sizeof(tests) \/ sizeof(tests[0])) {\n    for (auto te : tests)\n      te();\n  } else {\n    tests[n]();\n  }\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"CssTokenizer.h\"\n\nCssTokenizer::CssTokenizer(istream* in){\n  this->in = in;\n  lineNum = 1;\n  position = 0;\n  readChar();\n}\n\nCssTokenizer::~CssTokenizer(){\n}\n\nvoid CssTokenizer::readChar(){\n  if (in != NULL) {\n    in->get(lastRead);\n\n    \/\/ check for end of file or escape key\n    if(in->eof() || lastRead == 27) {\n      in = NULL;\n      lastRead = -1;\n    } else if (in->fail() || in->bad())\n      throw new IOException(\"Error reading input\");\n    \n    position++;\n    if (lastRead == '\\n') {\n      lineNum++;\n      position = 1;\n    }\n  }\n}\n\nToken::Type CssTokenizer::readNextToken(){\n  if (in == NULL) {\n    currentToken.type = Token::EOS;\n    return Token::EOS;\n  }\n\n  currentToken.clear();\n  \n  if (lastRead == '@') {\n    currentToken.type = Token::ATKEYWORD;\n    currentToken.add(lastRead);\n    readChar();\n    if (!readIdent()) {\n      currentToken.type = Token::OTHER;\n    }\n  } else if (lastRead == '#') {\n    currentToken.type = Token::HASH;\n    currentToken.add(lastRead);\n    readChar();\n    if (!readName()) {\n      throw new ParseException(&lastRead,\n                               \"name following '#'\");\n    }\n  } else if (readString()) {\n    currentToken.type = Token::STRING;\n  } else if (readNum()) {\n    currentToken.type = Token::NUMBER;\n    if (lastRead == '%') {\n      currentToken.type = Token::PERCENTAGE;\n      currentToken.add(lastRead);\n      readChar();\n    } else if (readIdent()) {\n      currentToken.type = Token::DIMENSION;\n    }\n  } else if (readIdent()) {\n    currentToken.type = Token::IDENTIFIER;\n\n    if (currentToken.str == \"url\" && readUrl())\n      currentToken.type = Token::URL;\n    else if (currentToken.str == \"u\" && lastRead == '+') {\n      currentToken.add(lastRead);\n      readChar();\n      currentToken.type = Token::UNICODE_RANGE;\n      readUnicodeRange();\n    } else if (lastRead == '(') {\n      currentToken.add(lastRead);\n      readChar();\n      currentToken.type = Token::FUNCTION;\n    }\n  } else if (readWhitespace()) {\n    currentToken.type = Token::WHITESPACE;\n    while (readWhitespace()) {};\n  } else if (lastRead == '~') {\n    currentToken.add(lastRead);\n    readChar();\n    if (lastRead == '=') {\n      currentToken.add(lastRead);\n      readChar();\n      currentToken.type = Token::INCLUDES;\n    } else\n      currentToken.type = Token::OTHER;\n  } else if (lastRead == '|') {\n    currentToken.add(lastRead);\n    readChar();\n    if (lastRead == '=') {\n      currentToken.add(lastRead);\n      readChar();\n      currentToken.type = Token::DASHMATCH;\n    } else\n      currentToken.type = Token::OTHER;\n  } else if (lastRead == '\/') {\n    currentToken.add(lastRead);\n    readChar();\n    if (readComment()) \n      currentToken.type = Token::COMMENT;\n    else\n      currentToken.type = Token::OTHER;\n  } else {\n    switch (lastRead) {\n    case ';':\n      currentToken.type = Token::DELIMITER;\n      break;\n    case ':':\n      currentToken.type = Token::COLON;\n      break;\n    case '{':\n      currentToken.type = Token::BRACKET_OPEN;\n      break;\n    case '}':\n      currentToken.type = Token::BRACKET_CLOSED;\n      break;\n    case '(':\n      currentToken.type = Token::PAREN_OPEN;\n      break;\n    case ')':\n      currentToken.type = Token::PAREN_CLOSED;\n      break;\n    case '[':\n      currentToken.type = Token::BRACE_OPEN;\n      break;\n    case ']':\n      currentToken.type = Token::BRACE_CLOSED;\n      break;\n    }\n    currentToken.add(lastRead);\n    readChar();\n  }\n  return currentToken.type;\n}\n\n\nbool CssTokenizer::readIdent () {\n  if (lastRead == '-') {\n    currentToken.add(lastRead);\n    readChar();\n  }\n  if (!readNMStart())\n    return false;\n  else\n    while (readNMChar()) {}\n  return true;\n}\n\nbool CssTokenizer::readName () {\n  if (!readNMChar())\n    return false;\n  while (readNMChar()) {}\n  return true;\n}\n\nbool CssTokenizer::readNMStart () {\n  if (lastRead == '_' ||\n      (lastRead >= 'a' && lastRead <= 'z') ||\n      (lastRead >= 'F' && lastRead <= 'Z')) {\n    currentToken.add(lastRead);\n    readChar();\n    return true;\n  } else\n    return (readNonAscii() || readEscape());\n}\nbool CssTokenizer::readNonAscii () {\n  if (lastRead > 237) {\n    currentToken.add(lastRead);\n    readChar();\n    return true;\n  } else\n    return false;\n}\nbool CssTokenizer::readEscape () {\n  if (lastRead != '\\\\')\n    return false;\n  currentToken.add(lastRead);\n  readChar();\n  \n  if (readUnicode()) \n    return true;    \n  else if (lastRead != '\\n' ||\n           lastRead != '\\r' ||\n           lastRead != '\\f') {\n    currentToken.add(lastRead);\n    readChar();\n    return true;\n  } else\n    return false;\n}\nbool CssTokenizer::readUnicode () {\n  if (!isHex(lastRead))\n    return false;\n\n  \/\/ [0-9a-f]{1,6}(\\r\\n|[ \\n\\r\\t\\f])?\n  for (int i=0; i < 6; i++) {\n    if (readWhitespace())\n      break;\n    currentToken.add(lastRead);\n    readChar();\n    if (!isHex(lastRead)) {\n      \/*throw new ParseException(&lastRead,\n        \"hex code(0-9a-f) in unicode character\");*\/\n      \/* Just ignore and assume the unicode stops here  *\/\n      break;\n    }\n  }\n  return true;\n}\n\nbool CssTokenizer::readNMChar () {\n  if (lastRead == '_' ||\n      (lastRead >= 'a' && lastRead <= 'z') ||\n      (lastRead >= 'A' && lastRead <= 'Z') ||\n      isdigit(lastRead) ||\n      lastRead == '-') {\n    currentToken.add(lastRead);\n    readChar();\n    return true;\n  } else\n    return (readNonAscii() || readEscape());\n}\n\nbool CssTokenizer::readNum () {\n  if (!isdigit(lastRead) && lastRead != '.')\n    return false;\n  while (isdigit(lastRead)) {\n    currentToken.add(lastRead);\n    readChar();\n  }\n  if (lastRead == '.') {\n    currentToken.add(lastRead);\n    readChar();\n\n    while (isdigit(lastRead)) {\n      currentToken.add(lastRead);\n      readChar();\n    }\n  }\n  return true;\n}\n\nbool CssTokenizer::readString() {\n  if (lastRead != '\"' && lastRead != '\\'')\n    return false;\n  char delim = lastRead;\n\n  currentToken.add(lastRead);\n  readChar();\n  while (lastRead != -1) {\n    if (lastRead == delim) {\n      currentToken.add(lastRead);\n      readChar();\n      return true;\n    } else if (lastRead == '\\n' ||\n        lastRead == '\\r' ||\n        lastRead == '\\f') {\n      throw new ParseException(\"end of line\",\n                               \"end of string\");\n    } else if (lastRead == '\\\\') \n      readEscape() || readNewline();\n    else {\n      currentToken.add(lastRead);\n      readChar();\n    }\n  }\n  throw new ParseException(&lastRead,\n                           \"end of string\");\n  return true;\n}\n\nbool CssTokenizer::readNewline () {\n  if (lastRead == '\\r') {\n    currentToken.add(lastRead);\n    readChar();\n    if (lastRead == '\\n') {\n      currentToken.add(lastRead);\n      readChar();\n    }\n    return true;\n  } else if (lastRead == '\\n' ||\n             lastRead == '\\f') {\n    currentToken.add(lastRead);\n    readChar();\n    return true;\n  } else\n    return false;\n}\n\nbool CssTokenizer::readWhitespace () {\n  if (lastRead != ' ' &&\n      lastRead != '\\t' &&\n      lastRead != '\\r' &&\n      lastRead != '\\n' &&\n      lastRead != '\\f')\n    return false;\n  \n  currentToken.add(lastRead);\n  readChar();\n  return true;\n}\n\nbool CssTokenizer::readUrl() {\n  string urlchars = \"!#$%&*-[]-~\";\n  \n  if (lastRead != '(') \n    return false;\n  currentToken.add(lastRead);\n  readChar();\n  while(readWhitespace()) {};\n    \n  if (readString()) {\n    if (lastRead == ')') {\n      currentToken.add(lastRead);\n      readChar();\n      return true;\n    } else {\n      throw new ParseException(&lastRead,\n                               \"end of url (')')\");\n    }\n  }\n\n  while (lastRead != -1) {\n    if (readWhitespace() || lastRead == ')') {\n      while (readWhitespace()) {};\n      if (lastRead == ')') {\n        currentToken.add(lastRead);\n        readChar();\n        return true;\n      } else {\n        throw new ParseException(&lastRead,\n                                 \"end of url (')')\");\n      }\n    } else if (urlchars.find(lastRead)) {\n      currentToken.add(lastRead);\n      readChar();\n    } else if (!readNonAscii() &&\n               !readEscape()) {\n      throw new ParseException(&lastRead,\n                               \"end of url (')')\");\n    }\n  }\n  throw new ParseException(&lastRead,\n                           \"end of url (')')\");\n  return true;\n}\n\n\nbool CssTokenizer::isHex(char c) {\n  return isdigit(c) ||\n    (c >= 'a' && c <= 'f') ||\n    (c >= 'A' && c <= 'F');\n}\n\n\nbool CssTokenizer::readComment () {\n  if (lastRead != '*')\n    return false;\n  currentToken.add(lastRead);\n  readChar();\n  while (in != NULL) {\n    if (lastRead == '*') {\n      currentToken.add(lastRead);\n      readChar();\n      \n      if (lastRead == '\/') {\n        currentToken.add(lastRead);\n        readChar();\n        return true;\n      }\n    }\n    currentToken.add(lastRead);\n    readChar();\n  }\n  throw new ParseException(&lastRead,\n                           \"end of comment (*\/)\");\n  return true;\n}\n\nbool CssTokenizer::readUnicodeRange () {\n  for (int i=0; i < 6; i++) {\n    if (isHex(lastRead))\n      break;\n    currentToken.add(lastRead);\n    readChar();\n  }\n  if (lastRead != '-')\n    return true;\n  \n  for (int i=0; i < 6; i++) {\n    if (isHex(lastRead))\n      break;\n    currentToken.add(lastRead);\n    readChar();\n  }\n  return true;\n}\n\nToken* CssTokenizer::getToken(){\n  return &currentToken;\n}\nToken::Type CssTokenizer::getTokenType() {\n  return currentToken.type;\n}\n\nint CssTokenizer::getLineNumber(){\n  return lineNum;\n}\nint CssTokenizer::getPosition(){\n  return position;\n}\n<commit_msg>Added support for negative numbers to CssTokenizer.<commit_after>#include \"CssTokenizer.h\"\n\nCssTokenizer::CssTokenizer(istream* in){\n  this->in = in;\n  lineNum = 1;\n  position = 0;\n  readChar();\n}\n\nCssTokenizer::~CssTokenizer(){\n}\n\nvoid CssTokenizer::readChar(){\n  if (in != NULL) {\n    in->get(lastRead);\n\n    \/\/ check for end of file or escape key\n    if(in->eof() || lastRead == 27) {\n      in = NULL;\n      lastRead = -1;\n    } else if (in->fail() || in->bad())\n      throw new IOException(\"Error reading input\");\n    \n    position++;\n    if (lastRead == '\\n') {\n      lineNum++;\n      position = 1;\n    }\n  }\n}\n\nToken::Type CssTokenizer::readNextToken(){\n  if (in == NULL) {\n    currentToken.type = Token::EOS;\n    return Token::EOS;\n  }\n\n  currentToken.clear();\n  \n  if (lastRead == '@') {\n    currentToken.type = Token::ATKEYWORD;\n    currentToken.add(lastRead);\n    readChar();\n    if (!readIdent()) {\n      currentToken.type = Token::OTHER;\n    }\n  } else if (lastRead == '#') {\n    currentToken.type = Token::HASH;\n    currentToken.add(lastRead);\n    readChar();\n    if (!readName()) {\n      throw new ParseException(&lastRead,\n                               \"name following '#'\");\n    }\n  } else if (readString()) {\n    currentToken.type = Token::STRING;\n  } else if (lastRead == '-') {\n    currentToken.add(lastRead);\n    readChar();\n    if (readNum()) {\n      currentToken.type = Token::NUMBER;\n      if (lastRead == '%') {\n        currentToken.type = Token::PERCENTAGE;\n        currentToken.add(lastRead);\n        readChar();\n      } else if (readIdent()) \n        currentToken.type = Token::DIMENSION;\n    } else if (readIdent()) {\n      currentToken.type = Token::IDENTIFIER;\n      if (lastRead == '(') {\n        currentToken.add(lastRead);\n        readChar();\n        currentToken.type = Token::FUNCTION;\n      }\n    } else\n      currentToken.type = Token::OTHER;\n  } else if (readNum()) {\n    currentToken.type = Token::NUMBER;\n    if (lastRead == '%') {\n      currentToken.type = Token::PERCENTAGE;\n      currentToken.add(lastRead);\n      readChar();\n    } else if (readIdent()) \n      currentToken.type = Token::DIMENSION;\n    \n  } else if (readIdent()) {\n    currentToken.type = Token::IDENTIFIER;\n\n    if (currentToken.str == \"url\" && readUrl())\n      currentToken.type = Token::URL;\n    else if (currentToken.str == \"u\" && lastRead == '+') {\n      currentToken.add(lastRead);\n      readChar();\n      currentToken.type = Token::UNICODE_RANGE;\n      readUnicodeRange();\n    } else if (lastRead == '(') {\n      currentToken.add(lastRead);\n      readChar();\n      currentToken.type = Token::FUNCTION;\n    }\n  } else if (readWhitespace()) {\n    currentToken.type = Token::WHITESPACE;\n    while (readWhitespace()) {};\n  } else if (lastRead == '~') {\n    currentToken.add(lastRead);\n    readChar();\n    if (lastRead == '=') {\n      currentToken.add(lastRead);\n      readChar();\n      currentToken.type = Token::INCLUDES;\n    } else\n      currentToken.type = Token::OTHER;\n  } else if (lastRead == '|') {\n    currentToken.add(lastRead);\n    readChar();\n    if (lastRead == '=') {\n      currentToken.add(lastRead);\n      readChar();\n      currentToken.type = Token::DASHMATCH;\n    } else\n      currentToken.type = Token::OTHER;\n  } else if (lastRead == '\/') {\n    currentToken.add(lastRead);\n    readChar();\n    if (readComment()) \n      currentToken.type = Token::COMMENT;\n    else\n      currentToken.type = Token::OTHER;\n  } else {\n    switch (lastRead) {\n    case ';':\n      currentToken.type = Token::DELIMITER;\n      break;\n    case ':':\n      currentToken.type = Token::COLON;\n      break;\n    case '{':\n      currentToken.type = Token::BRACKET_OPEN;\n      break;\n    case '}':\n      currentToken.type = Token::BRACKET_CLOSED;\n      break;\n    case '(':\n      currentToken.type = Token::PAREN_OPEN;\n      break;\n    case ')':\n      currentToken.type = Token::PAREN_CLOSED;\n      break;\n    case '[':\n      currentToken.type = Token::BRACE_OPEN;\n      break;\n    case ']':\n      currentToken.type = Token::BRACE_CLOSED;\n      break;\n    }\n    currentToken.add(lastRead);\n    readChar();\n  }\n  return currentToken.type;\n}\n\n\nbool CssTokenizer::readIdent () {\n  if (lastRead == '-') {\n    currentToken.add(lastRead);\n    readChar();\n  }\n  if (!readNMStart())\n    return false;\n  else\n    while (readNMChar()) {}\n  return true;\n}\n\nbool CssTokenizer::readName () {\n  if (!readNMChar())\n    return false;\n  while (readNMChar()) {}\n  return true;\n}\n\nbool CssTokenizer::readNMStart () {\n  if (lastRead == '_' ||\n      (lastRead >= 'a' && lastRead <= 'z') ||\n      (lastRead >= 'F' && lastRead <= 'Z')) {\n    currentToken.add(lastRead);\n    readChar();\n    return true;\n  } else\n    return (readNonAscii() || readEscape());\n}\nbool CssTokenizer::readNonAscii () {\n  if (lastRead > 237) {\n    currentToken.add(lastRead);\n    readChar();\n    return true;\n  } else\n    return false;\n}\nbool CssTokenizer::readEscape () {\n  if (lastRead != '\\\\')\n    return false;\n  currentToken.add(lastRead);\n  readChar();\n  \n  if (readUnicode()) \n    return true;    \n  else if (lastRead != '\\n' ||\n           lastRead != '\\r' ||\n           lastRead != '\\f') {\n    currentToken.add(lastRead);\n    readChar();\n    return true;\n  } else\n    return false;\n}\nbool CssTokenizer::readUnicode () {\n  if (!isHex(lastRead))\n    return false;\n\n  \/\/ [0-9a-f]{1,6}(\\r\\n|[ \\n\\r\\t\\f])?\n  for (int i=0; i < 6; i++) {\n    if (readWhitespace())\n      break;\n    currentToken.add(lastRead);\n    readChar();\n    if (!isHex(lastRead)) {\n      \/*throw new ParseException(&lastRead,\n        \"hex code(0-9a-f) in unicode character\");*\/\n      \/* Just ignore and assume the unicode stops here  *\/\n      break;\n    }\n  }\n  return true;\n}\n\nbool CssTokenizer::readNMChar () {\n  if (lastRead == '_' ||\n      (lastRead >= 'a' && lastRead <= 'z') ||\n      (lastRead >= 'A' && lastRead <= 'Z') ||\n      isdigit(lastRead) ||\n      lastRead == '-') {\n    currentToken.add(lastRead);\n    readChar();\n    return true;\n  } else\n    return (readNonAscii() || readEscape());\n}\n\nbool CssTokenizer::readNum () {\n  if (!isdigit(lastRead) && lastRead != '.')\n    return false;\n  while (isdigit(lastRead)) {\n    currentToken.add(lastRead);\n    readChar();\n  }\n  if (lastRead == '.') {\n    currentToken.add(lastRead);\n    readChar();\n\n    while (isdigit(lastRead)) {\n      currentToken.add(lastRead);\n      readChar();\n    }\n  }\n  return true;\n}\n\nbool CssTokenizer::readString() {\n  if (lastRead != '\"' && lastRead != '\\'')\n    return false;\n  char delim = lastRead;\n\n  currentToken.add(lastRead);\n  readChar();\n  while (lastRead != -1) {\n    if (lastRead == delim) {\n      currentToken.add(lastRead);\n      readChar();\n      return true;\n    } else if (lastRead == '\\n' ||\n        lastRead == '\\r' ||\n        lastRead == '\\f') {\n      throw new ParseException(\"end of line\",\n                               \"end of string\");\n    } else if (lastRead == '\\\\') \n      readEscape() || readNewline();\n    else {\n      currentToken.add(lastRead);\n      readChar();\n    }\n  }\n  throw new ParseException(&lastRead,\n                           \"end of string\");\n  return true;\n}\n\nbool CssTokenizer::readNewline () {\n  if (lastRead == '\\r') {\n    currentToken.add(lastRead);\n    readChar();\n    if (lastRead == '\\n') {\n      currentToken.add(lastRead);\n      readChar();\n    }\n    return true;\n  } else if (lastRead == '\\n' ||\n             lastRead == '\\f') {\n    currentToken.add(lastRead);\n    readChar();\n    return true;\n  } else\n    return false;\n}\n\nbool CssTokenizer::readWhitespace () {\n  if (lastRead != ' ' &&\n      lastRead != '\\t' &&\n      lastRead != '\\r' &&\n      lastRead != '\\n' &&\n      lastRead != '\\f')\n    return false;\n  \n  currentToken.add(lastRead);\n  readChar();\n  return true;\n}\n\nbool CssTokenizer::readUrl() {\n  string urlchars = \"!#$%&*-[]-~\";\n  \n  if (lastRead != '(') \n    return false;\n  currentToken.add(lastRead);\n  readChar();\n  while(readWhitespace()) {};\n    \n  if (readString()) {\n    if (lastRead == ')') {\n      currentToken.add(lastRead);\n      readChar();\n      return true;\n    } else {\n      throw new ParseException(&lastRead,\n                               \"end of url (')')\");\n    }\n  }\n\n  while (lastRead != -1) {\n    if (readWhitespace() || lastRead == ')') {\n      while (readWhitespace()) {};\n      if (lastRead == ')') {\n        currentToken.add(lastRead);\n        readChar();\n        return true;\n      } else {\n        throw new ParseException(&lastRead,\n                                 \"end of url (')')\");\n      }\n    } else if (urlchars.find(lastRead)) {\n      currentToken.add(lastRead);\n      readChar();\n    } else if (!readNonAscii() &&\n               !readEscape()) {\n      throw new ParseException(&lastRead,\n                               \"end of url (')')\");\n    }\n  }\n  throw new ParseException(&lastRead,\n                           \"end of url (')')\");\n  return true;\n}\n\n\nbool CssTokenizer::isHex(char c) {\n  return isdigit(c) ||\n    (c >= 'a' && c <= 'f') ||\n    (c >= 'A' && c <= 'F');\n}\n\n\nbool CssTokenizer::readComment () {\n  if (lastRead != '*')\n    return false;\n  currentToken.add(lastRead);\n  readChar();\n  while (in != NULL) {\n    if (lastRead == '*') {\n      currentToken.add(lastRead);\n      readChar();\n      \n      if (lastRead == '\/') {\n        currentToken.add(lastRead);\n        readChar();\n        return true;\n      }\n    }\n    currentToken.add(lastRead);\n    readChar();\n  }\n  throw new ParseException(&lastRead,\n                           \"end of comment (*\/)\");\n  return true;\n}\n\nbool CssTokenizer::readUnicodeRange () {\n  for (int i=0; i < 6; i++) {\n    if (isHex(lastRead))\n      break;\n    currentToken.add(lastRead);\n    readChar();\n  }\n  if (lastRead != '-')\n    return true;\n  \n  for (int i=0; i < 6; i++) {\n    if (isHex(lastRead))\n      break;\n    currentToken.add(lastRead);\n    readChar();\n  }\n  return true;\n}\n\nToken* CssTokenizer::getToken(){\n  return &currentToken;\n}\nToken::Type CssTokenizer::getTokenType() {\n  return currentToken.type;\n}\n\nint CssTokenizer::getLineNumber(){\n  return lineNum;\n}\nint CssTokenizer::getPosition(){\n  return position;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <iomanip>\n#include \"..\/Global.h\"\n#include \"..\/Options.h\"\n#include \"..\/Data.h\"\n#include \"..\/Scheme.h\"\n#include \"..\/Inputs\/Input.h\"\n#include \"..\/Loggers\/Logger.h\"\n#include \"..\/Loggers\/Default.h\"\n#include \"..\/Location.h\"\n#include \"..\/Member.h\"\n#include <cstring>\nbool mShowAll;\nbool mShowSpecific;\nvoid showLocations(Input* input);\nvoid showOffsets(Input* input);\nvoid showDates(Input* input);\nvoid showMembers(Input* input);\nvoid showVariables(Input* input);\n\nint main(int argc, const char *argv[]) {\n   Global::setLogger(new LoggerDefault(Logger::message));\n\n   if(argc != 2 && argc != 3 && argc != 4) {\n      std::cout << \"Show information about a COMPS dataset\" << std::endl;\n      std::cout << std::endl;\n      std::cout << \"usage: info.exe dataset [--show-all]    show information about dataset\" << std::endl;\n      std::cout << \"   or: info.exe dataset date            show detailed information for a specific date\" << std::endl;\n      std::cout << std::endl;\n      std::cout << \"Arguments:\" << std::endl;\n      std::cout << \"   dataset         Tag of dataset from namelist\" << std::endl;\n      std::cout << \"   date            Date in YYYYMMDD format\" << std::endl;\n      std::cout << \"   --show-all      Do not limit variables\/dates\/offsets to the first 100\" << std::endl;\n\n      return 0;\n   }\n\n   mShowAll = false;\n   mShowSpecific = false;\n   int date = 0;\n\n   std::string dataset(argv[1]);\n   if(argc >= 3) {\n      if(!std::strcmp(argv[2], \"--show-all\")) {\n         mShowAll = true;\n      }\n      else {\n         std::stringstream ss;\n         ss<< std::string(argv[2]);\n         ss >> date;\n         mShowSpecific = true;\n      }\n   }\n\n   InputContainer inputContainer(Options(\"\"));\n   Input* input = inputContainer.getInput(dataset);\n\n   if(mShowSpecific) {\n      \/\/ Show results for one specific date\n      std::vector<float> offsets = input->getOffsets();\n      std::vector<std::string> variables = input->getVariables();\n      std::vector<Location> locations = input->getLocations();\n      std::vector<Member> members = input->getMembers();\n\n      std::vector<float> mean;\n      mean.resize(variables.size(), 0);\n      std::vector<int> num;\n      num.resize(variables.size(), 0);\n\n      std::cout << \"Variable     mean       count (max \"\n                << offsets.size()*locations.size()*members.size() << \")\" << std::endl;\n      for(int v = 0; v < variables.size(); v++) {\n         for(int i = 0; i < offsets.size(); i++) {\n            for(int k = 0; k < locations.size(); k++) {\n               for(int m = 0; m < members.size(); m++) {\n                  float value = input->getValue(date, 0, offsets[i], locations[k].getId(), members[m].getId(), variables[v]);\n                  if(Global::isValid(value)) {\n                     mean[v] += value;\n                     num[v]++;\n                  }\n               }\n            }\n         }\n         if(num[v] > 0)\n            mean[v] \/= num[v];\n         else\n            mean[v] = Global::MV;\n         std::cout << std::left << std::setfill(' ') << std::setw(12) << variables[v] << \" \" << std::setprecision(3) << std::setw(10) << mean[v] << \" \" << num[v] << std::endl;\n      }\n   }\n   else {\n      \/\/ Show general statistics\n      showLocations(input);\n      showOffsets(input);\n      showDates(input);\n      showVariables(input);\n   }\n}\nvoid showLocations(Input* input) {\n   std::cout << \"Locations:\" << std::endl;\n   const std::vector<Location>& locations = input->getLocations();\n   std::cout << \"Id       code   lat   lon\" << std::endl;\n   for(int i = 0; i < locations.size(); i++) {\n      if(mShowAll || locations.size() < 100 || i < 5 || i >= locations.size()-5) {\n         std::cout << std::setw(6) << locations[i].getId() << \" \"\n                   << std::setw(6) << locations[i].getCode() << \" \" \n                   << std::setw(6) << std::fixed << std::setprecision(1) << locations[i].getLat() << \" \"\n                   << std::setw(6) << locations[i].getLon() << std::endl;\n      }\n      else if(i == 5) {\n         std::cout << \"...\" << std::endl;\n      }\n   }\n   std::cout << std::endl;\n}\nvoid showOffsets(Input* input) {\n   std::cout << \"Offsets:\" << std::endl;\n   std::vector<float> offsets = input->getOffsets();\n   std::cout << \"Id       offset (h)\" << std::endl;\n   for(int i = 0; i < offsets.size(); i++) {\n      if(mShowAll || offsets.size() < 100 || i < 5 || i >= offsets.size()-5) {\n         std::cout << std::setw(6) << i << \" \"\n                   << std::setw(6) << offsets[i] << std::endl;\n      }\n      else if(i == 5) {\n         std::cout << \"...\" << std::endl;\n      }\n   }\n   std::cout << std::endl;\n}\nvoid showDates(Input* input) {\n   std::cout << \"Dates:\" << std::endl;\n   std::vector<int> dates;\n   input->getDates(dates);\n   std::cout << \"Id        dates\" << std::endl;\n   for(int i = 0; i < dates.size(); i++) {\n      if(mShowAll || dates.size() < 100 || i < 5 || i >= dates.size()-5) {\n         std::cout << std::setw(6) << i\n                   << std::setw(9) << dates[i] << std::endl;\n      }\n      else if(i == 5) {\n         std::cout << \"...\" << std::endl;\n      }\n   }\n   std::cout << std::endl;\n}\nvoid showVariables(Input* input) {\n   std::cout << \"Variables:\" << std::endl;\n   std::vector<std::string> variables = input->getVariables();\n   std::cout << \"   Id      variable\" << std::endl;\n   for(int i = 0; i < variables.size(); i++) {\n      if(mShowAll || variables.size() < 100 || i < 5 || i >= variables.size()-5) {\n         std::cout << std::setw(6) << i << \" \"\n                   << std::setw(12) << variables[i] << std::endl;\n      }\n      else if(i == 5) {\n         std::cout << \"...\" << std::endl;\n      }\n   }\n}\n<commit_msg>Show elevation in Info driver<commit_after>#include <iostream>\n#include <iomanip>\n#include \"..\/Global.h\"\n#include \"..\/Options.h\"\n#include \"..\/Data.h\"\n#include \"..\/Scheme.h\"\n#include \"..\/Inputs\/Input.h\"\n#include \"..\/Loggers\/Logger.h\"\n#include \"..\/Loggers\/Default.h\"\n#include \"..\/Location.h\"\n#include \"..\/Member.h\"\n#include <cstring>\nbool mShowAll;\nbool mShowSpecific;\nvoid showLocations(Input* input);\nvoid showOffsets(Input* input);\nvoid showDates(Input* input);\nvoid showMembers(Input* input);\nvoid showVariables(Input* input);\n\nint main(int argc, const char *argv[]) {\n   Global::setLogger(new LoggerDefault(Logger::message));\n\n   if(argc != 2 && argc != 3 && argc != 4) {\n      std::cout << \"Show information about a COMPS dataset\" << std::endl;\n      std::cout << std::endl;\n      std::cout << \"usage: info.exe dataset [--show-all]    show information about dataset\" << std::endl;\n      std::cout << \"   or: info.exe dataset date            show detailed information for a specific date\" << std::endl;\n      std::cout << std::endl;\n      std::cout << \"Arguments:\" << std::endl;\n      std::cout << \"   dataset         Tag of dataset from namelist\" << std::endl;\n      std::cout << \"   date            Date in YYYYMMDD format\" << std::endl;\n      std::cout << \"   --show-all      Do not limit variables\/dates\/offsets to the first 100\" << std::endl;\n\n      return 0;\n   }\n\n   mShowAll = false;\n   mShowSpecific = false;\n   int date = 0;\n\n   std::string dataset(argv[1]);\n   if(argc >= 3) {\n      if(!std::strcmp(argv[2], \"--show-all\")) {\n         mShowAll = true;\n      }\n      else {\n         std::stringstream ss;\n         ss<< std::string(argv[2]);\n         ss >> date;\n         mShowSpecific = true;\n      }\n   }\n\n   InputContainer inputContainer(Options(\"\"));\n   Input* input = inputContainer.getInput(dataset);\n\n   if(mShowSpecific) {\n      \/\/ Show results for one specific date\n      std::vector<float> offsets = input->getOffsets();\n      std::vector<std::string> variables = input->getVariables();\n      std::vector<Location> locations = input->getLocations();\n      std::vector<Member> members = input->getMembers();\n\n      std::vector<float> mean;\n      mean.resize(variables.size(), 0);\n      std::vector<int> num;\n      num.resize(variables.size(), 0);\n\n      std::cout << \"Variable     mean       count (max \"\n                << offsets.size()*locations.size()*members.size() << \")\" << std::endl;\n      for(int v = 0; v < variables.size(); v++) {\n         for(int i = 0; i < offsets.size(); i++) {\n            for(int k = 0; k < locations.size(); k++) {\n               for(int m = 0; m < members.size(); m++) {\n                  float value = input->getValue(date, 0, offsets[i], locations[k].getId(), members[m].getId(), variables[v]);\n                  if(Global::isValid(value)) {\n                     mean[v] += value;\n                     num[v]++;\n                  }\n               }\n            }\n         }\n         if(num[v] > 0)\n            mean[v] \/= num[v];\n         else\n            mean[v] = Global::MV;\n         std::cout << std::left << std::setfill(' ') << std::setw(12) << variables[v] << \" \" << std::setprecision(3) << std::setw(10) << mean[v] << \" \" << num[v] << std::endl;\n      }\n   }\n   else {\n      \/\/ Show general statistics\n      showLocations(input);\n      showOffsets(input);\n      showDates(input);\n      showVariables(input);\n   }\n}\nvoid showLocations(Input* input) {\n   std::cout << \"Locations:\" << std::endl;\n   const std::vector<Location>& locations = input->getLocations();\n   std::cout << \"Id       code   lat   lon   elev\" << std::endl;\n   for(int i = 0; i < locations.size(); i++) {\n      if(mShowAll || locations.size() < 100 || i < 5 || i >= locations.size()-5) {\n         std::cout << std::setw(6) << locations[i].getId() << \" \"\n                   << std::setw(6) << locations[i].getCode() << \" \" \n                   << std::setw(6) << std::fixed << std::setprecision(1) << locations[i].getLat() << \" \"\n                   << std::setw(6) << locations[i].getLon() << \" \"\n                   << std::setw(6) << std::fixed << std::setprecision(1) << locations[i].getElev() << std::endl;\n      }\n      else if(i == 5) {\n         std::cout << \"...\" << std::endl;\n      }\n   }\n   std::cout << std::endl;\n}\nvoid showOffsets(Input* input) {\n   std::cout << \"Offsets:\" << std::endl;\n   std::vector<float> offsets = input->getOffsets();\n   std::cout << \"Id       offset (h)\" << std::endl;\n   for(int i = 0; i < offsets.size(); i++) {\n      if(mShowAll || offsets.size() < 100 || i < 5 || i >= offsets.size()-5) {\n         std::cout << std::setw(6) << i << \" \"\n                   << std::setw(6) << offsets[i] << std::endl;\n      }\n      else if(i == 5) {\n         std::cout << \"...\" << std::endl;\n      }\n   }\n   std::cout << std::endl;\n}\nvoid showDates(Input* input) {\n   std::cout << \"Dates:\" << std::endl;\n   std::vector<int> dates;\n   input->getDates(dates);\n   std::cout << \"Id        dates\" << std::endl;\n   for(int i = 0; i < dates.size(); i++) {\n      if(mShowAll || dates.size() < 100 || i < 5 || i >= dates.size()-5) {\n         std::cout << std::setw(6) << i\n                   << std::setw(9) << dates[i] << std::endl;\n      }\n      else if(i == 5) {\n         std::cout << \"...\" << std::endl;\n      }\n   }\n   std::cout << std::endl;\n}\nvoid showVariables(Input* input) {\n   std::cout << \"Variables:\" << std::endl;\n   std::vector<std::string> variables = input->getVariables();\n   std::cout << \"   Id      variable\" << std::endl;\n   for(int i = 0; i < variables.size(); i++) {\n      if(mShowAll || variables.size() < 100 || i < 5 || i >= variables.size()-5) {\n         std::cout << std::setw(6) << i << \" \"\n                   << std::setw(12) << variables[i] << std::endl;\n      }\n      else if(i == 5) {\n         std::cout << \"...\" << std::endl;\n      }\n   }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"LedController.hpp\"\n\n#include <algorithm>\n#include <bitset>\n\nLedController::LedController(std::ostream& stream) : out{stream}\n{\n    instructionsFromLabel.reserve(maxInstructions);\n}\n\nvoid LedController::runProgram(const Instructions& instructions)\n{\n    for (const auto& instruction : instructions)\n    {\n        instructionsFromLabel.push_back(instruction);\n        if (instructionsFromLabel.size() > maxInstructions)\n        {\n            throw std::runtime_error{\"To much instructions\"};\n        }\n        if (instruction.type == InstructionType::Label)\n        {\n            labelMapping[instruction.value] = instructionsFromLabel.end() - 1;\n        }\n        else\n        {\n            runInstruction(instruction);\n        }\n    }\n}\n\nvoid LedController::runInstruction(const Instruction& instruction)\n{\n    if (storeInstruction)\n    {\n        if (storeLabel)\n        {\n            storeLabel = false;\n        }\n    }\n    switch (instruction.type)\n    {\n    case InstructionType::OutA: out << ledState.to_string(); break;\n    case InstructionType::LdA: ledState = instruction.value; break;\n    case InstructionType::Rlca: ledState.rlca(); break;\n    case InstructionType::Rrca: ledState.rrca(); break;\n    case InstructionType::LdB: b = instruction.value; break;\n    case InstructionType::Djnz: doDjnz(instruction.value); break;\n    case InstructionType::Label: break;\n    }\n}\n\nvoid LedController::doDjnz(unsigned char label)\n{\n    try\n    {\n        storeInstruction = false;\n        if (--b)\n        {\n            std::for_each(labelMapping.at(label), instructionsFromLabel.cend(),\n                          [&](const auto& instructionFromLabel) {\n                              runInstruction(instructionFromLabel);\n                          });\n        }\n        storeInstruction = true;\n    }\n    catch (const std::out_of_range&)\n    {\n        throw std::runtime_error{\"Invalid label: \" + std::to_string(label)};\n    }\n}\n\nstd::string LedController::LedState::to_string() const\n{\n    return *this;\n}\n\nconst LedController::LedState& LedController::LedState::\noperator=(unsigned char value)\n{\n    ledState = value;\n    return *this;\n}\n\nLedController::LedState::operator std::string() const\n{\n    const std::bitset<8> bitValue{ledState};\n    constexpr auto ledOnChar = '*';\n    constexpr auto ledOffChar = '.';\n    constexpr auto lineEnding = '\\n';\n    return bitValue.to_string(ledOffChar, ledOnChar) + lineEnding;\n}\n\nvoid LedController::LedState::rlca()\n{\n    ledState =\n        static_cast<char>((ledState << 1)) | ((ledState & 0b10000000) != 0);\n}\n\nvoid LedController::LedState::rrca()\n{\n    ledState = static_cast<char>((ledState >> 1) |\n                                 (((ledState & 0b00000001) != 0) << 7));\n}\n<commit_msg>Add tests from page, which are passing<commit_after>#include \"LedController.hpp\"\n\n#include <algorithm>\n#include <bitset>\n\nLedController::LedController(std::ostream& stream) : out{stream}\n{\n    instructionsFromLabel.reserve(maxInstructions);\n}\n\nvoid LedController::runProgram(const Instructions& instructions)\n{\n    for (const auto& instruction : instructions)\n    {\n        instructionsFromLabel.push_back(instruction);\n        if (instructionsFromLabel.size() > maxInstructions)\n        {\n            throw std::runtime_error{\"To much instructions\"};\n        }\n        if (instruction.type == InstructionType::Label)\n        {\n            labelMapping[instruction.value] = instructionsFromLabel.end() - 1;\n        }\n        else\n        {\n            runInstruction(instruction);\n        }\n    }\n}\n\nvoid LedController::runInstruction(const Instruction& instruction)\n{\n    {\n        if (storeLabel)\n        {\n            storeLabel = false;\n        }\n    }\n    switch (instruction.type)\n    {\n    case InstructionType::OutA: out << ledState.to_string(); break;\n    case InstructionType::LdA: ledState = instruction.value; break;\n    case InstructionType::Rlca: ledState.rlca(); break;\n    case InstructionType::Rrca: ledState.rrca(); break;\n    case InstructionType::LdB: b = instruction.value; break;\n    case InstructionType::Djnz: doDjnz(instruction.value); break;\n    case InstructionType::Label: break;\n    }\n}\n\nvoid LedController::doDjnz(unsigned char label)\n{\n    try\n    {\n        if (--b)\n        {\n            std::for_each(labelMapping.at(label), instructionsFromLabel.cend(),\n                          [&](const auto& instructionFromLabel) {\n                              runInstruction(instructionFromLabel);\n                          });\n        }\n    }\n    catch (const std::out_of_range&)\n    {\n        throw std::runtime_error{\"Invalid label: \" + std::to_string(label)};\n    }\n}\n\nstd::string LedController::LedState::to_string() const\n{\n    return *this;\n}\n\nconst LedController::LedState& LedController::LedState::\noperator=(unsigned char value)\n{\n    ledState = value;\n    return *this;\n}\n\nLedController::LedState::operator std::string() const\n{\n    const std::bitset<8> bitValue{ledState};\n    constexpr auto ledOnChar = '*';\n    constexpr auto ledOffChar = '.';\n    constexpr auto lineEnding = '\\n';\n    return bitValue.to_string(ledOffChar, ledOnChar) + lineEnding;\n}\n\nvoid LedController::LedState::rlca()\n{\n    ledState =\n        static_cast<char>((ledState << 1)) | ((ledState & 0b10000000) != 0);\n}\n\nvoid LedController::LedState::rrca()\n{\n    ledState = static_cast<char>((ledState >> 1) |\n                                 (((ledState & 0b00000001) != 0) << 7));\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Module:    $RCSfile: itkReadITKImageShowVTK.cxx,v $\n  Language:  C++\n  Date:      $Date: 2006-06-16 18:29:01 $\n  Version:   $Revision: 1.5 $\n\n  Copyright (c) 2002 Insight Consortium. All rights reserved.\n  See ITKCopyright.txt or http:\/\/www.itk.org\/HTML\/Copyright.htm for details.\n\n     This software is distributed WITHOUT ANY WARRANTY; without even \n     the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR \n     PURPOSE.  See the above copyright notices for more information.\n\n=========================================================================*\/\n\n#include \"itkCommand.h\"\n#include \"itkImage.h\"\n#include \"itkVTKImageExport.h\"\n#include \"itkVTKImageImport.h\"\n#include \"itkCurvatureFlowImageFilter.h\"\n#include \"itkCastImageFilter.h\"\n#include \"itkRGBPixel.h\"\n#include \"itkImageFileReader.h\"\n#include \"itkImageFileWriter.h\"\n#include \"vtkImageData.h\"\n\n#include \"vtkImageImport.h\"\n#include \"vtkImageExport.h\"\n#include \"vtkImageActor.h\"\n#include \"vtkRenderer.h\"\n#include \"vtkRenderWindow.h\"\n#include \"vtkRenderWindowInteractor.h\"\n#include \"vtkInteractorStyleImage.h\" \n\n\/**\n * This will be setup as a callback for a progress event on an ITK\n * filter.\n *\/\nstruct ProgressDisplay\n{\n  ProgressDisplay(itk::ProcessObject* process): m_Process(process) {}\n  \n  void Display()\n    {\n    float progress = m_Process->GetProgress()*100.0;\n    std::cout << \"Progress \" << progress << \" percent.\" << std::endl;\n    }\n  \n  itk::ProcessObject::Pointer m_Process;\n};\n\n\n\/**\n * This function will connect the given itk::VTKImageExport filter to\n * the given vtkImageImport filter.\n *\/\ntemplate <typename ITK_Exporter, typename VTK_Importer>\nvoid ConnectPipelines(ITK_Exporter exporter, VTK_Importer* importer)\n{\n  importer->SetUpdateInformationCallback(exporter->GetUpdateInformationCallback());\n  importer->SetPipelineModifiedCallback(exporter->GetPipelineModifiedCallback());\n  importer->SetWholeExtentCallback(exporter->GetWholeExtentCallback());\n  importer->SetSpacingCallback(exporter->GetSpacingCallback());\n  importer->SetOriginCallback(exporter->GetOriginCallback());\n  importer->SetScalarTypeCallback(exporter->GetScalarTypeCallback());\n  importer->SetNumberOfComponentsCallback(exporter->GetNumberOfComponentsCallback());\n  importer->SetPropagateUpdateExtentCallback(exporter->GetPropagateUpdateExtentCallback());\n  importer->SetUpdateDataCallback(exporter->GetUpdateDataCallback());\n  importer->SetDataExtentCallback(exporter->GetDataExtentCallback());\n  importer->SetBufferPointerCallback(exporter->GetBufferPointerCallback());\n  importer->SetCallbackUserData(exporter->GetCallbackUserData());\n}\n\n\/**\n * This function will connect the given vtkImageExport filter to\n * the given itk::VTKImageImport filter.\n *\/\ntemplate <typename VTK_Exporter, typename ITK_Importer>\nvoid ConnectPipelines(VTK_Exporter* exporter, ITK_Importer importer)\n{\n  importer->SetUpdateInformationCallback(exporter->GetUpdateInformationCallback());\n  importer->SetPipelineModifiedCallback(exporter->GetPipelineModifiedCallback());\n  importer->SetWholeExtentCallback(exporter->GetWholeExtentCallback());\n  importer->SetSpacingCallback(exporter->GetSpacingCallback());\n  importer->SetOriginCallback(exporter->GetOriginCallback());\n  importer->SetScalarTypeCallback(exporter->GetScalarTypeCallback());\n  importer->SetNumberOfComponentsCallback(exporter->GetNumberOfComponentsCallback());\n  importer->SetPropagateUpdateExtentCallback(exporter->GetPropagateUpdateExtentCallback());\n  importer->SetUpdateDataCallback(exporter->GetUpdateDataCallback());\n  importer->SetDataExtentCallback(exporter->GetDataExtentCallback());\n  importer->SetBufferPointerCallback(exporter->GetBufferPointerCallback());\n  importer->SetCallbackUserData(exporter->GetCallbackUserData());\n}\n\n\n\/**\n * This program implements an example connection between ITK and VTK\n * pipelines.  The combined pipeline flows as follows:\n *\n * itkImageFileReader ==> itkVTKImageExport ==>\n *    vtkImageImport ==> vtkImageActor\n *\n * The resulting vtkImageActor is displayed in a vtkRenderWindow.\n * Whenever the VTK pipeline executes, information is propagated\n * through the ITK pipeline.  If the ITK pipeline is out of date, it\n * will re-execute and cause the VTK pipeline to update properly as\n * well.\n *\/\nint main(int argc, char * argv [] )\n{  \n\n  \/\/ Load a color image using ITK and display it with VTK\n\n  if( argc < 2 )\n    {\n    std::cerr << \"Missing parameters\" << std::endl;\n    std::cerr << \"Usage: \" << argv[0] << \" inputImageFilename \" << std::endl;\n    return 1;\n    }\n  \n  try\n    {\n    typedef itk::RGBPixel< unsigned char > PixelType;\n    typedef itk::Image< PixelType, 2 > ImageType;\n    \n    typedef itk::ImageFileReader< ImageType > ReaderType;\n\n    ReaderType::Pointer reader  = ReaderType::New();\n    reader->SetFileName( argv[1] );\n    reader->Update();\n\n    typedef itk::VTKImageExport< ImageType > ExportFilterType;\n    ExportFilterType::Pointer itkExporter = ExportFilterType::New();\n\n    itkExporter->SetInput( reader->GetOutput() );\n\n    \/\/ Create the vtkImageImport and connect it to the\n    \/\/ itk::VTKImageExport instance.\n    vtkImageImport* vtkImporter = vtkImageImport::New();  \n    ConnectPipelines(itkExporter, vtkImporter);\n    \n\n    \/\/ Just for double checking export it from VTK back into ITK \n    \/\/ and save it into a file.\n    typedef itk::VTKImageImport< ImageType > ImportFilterType;\n    ImportFilterType::Pointer itkImporter = ImportFilterType::New();\n\n\n    vtkImageExport* vtkExporter = vtkImageExport::New();  \n    ConnectPipelines(vtkExporter, itkImporter);\n    \n    vtkExporter->SetInput( vtkImporter->GetOutput() );\n    \n    typedef itk::ImageFileWriter< ImageType > WriterType;\n    WriterType::Pointer itkWriter = WriterType::New();\n    itkWriter->SetInput( itkImporter->GetOutput() );\n    \n    if( argc > 2 )\n      {\n      const char * filename = argv[2];\n      std::cout << \"Writing file \" << filename << std::endl;\n      itkWriter->SetFileName( filename );\n      itkWriter->Update();\n      }\n\n    \/\/------------------------------------------------------------------------\n    \/\/ VTK pipeline.\n    \/\/------------------------------------------------------------------------\n    \n    \/\/ Create a vtkImageActor to help render the image.  Connect it to\n    \/\/ the vtkImporter instance.\n    vtkImageActor* actor = vtkImageActor::New();\n    actor->SetInput(vtkImporter->GetOutput());\n    \n    vtkInteractorStyleImage * interactorStyle = vtkInteractorStyleImage::New();\n\n    \/\/ Create a renderer, render window, and render window interactor to\n    \/\/ display the results.\n    vtkRenderer* renderer = vtkRenderer::New();\n    vtkRenderWindow* renWin = vtkRenderWindow::New();\n    vtkRenderWindowInteractor* iren = vtkRenderWindowInteractor::New();\n    \n    renWin->SetSize(500, 500);\n    renWin->AddRenderer(renderer);\n    iren->SetRenderWindow(renWin);\n    iren->SetInteractorStyle( interactorStyle );\n    \n    \/\/ Add the vtkImageActor to the renderer for display.\n    renderer->AddActor(actor);\n    renderer->SetBackground(0.4392, 0.5020, 0.5647);\n\n    \/\/ Bring up the render window and begin interaction.\n    renWin->Render();\n    iren->Start();\n\n    \/\/ Release all VTK components\n    actor->Delete();\n    interactorStyle->Delete(); \n    vtkImporter->Delete();\n    vtkExporter->Delete();\n    renWin->Delete();\n    renderer->Delete();\n    iren->Delete();\n\n    }\n  catch( itk::ExceptionObject & e )\n    {\n    std::cerr << \"Exception catched !! \" << e << std::endl;\n    }\n\n\n  \n  return 0;\n}\n<commit_msg>ENH: Code clean up and watcher added.<commit_after>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Module:    $RCSfile: itkReadITKImageShowVTK.cxx,v $\n  Language:  C++\n  Date:      $Date: 2006-06-16 18:29:01 $\n  Version:   $Revision: 1.5 $\n\n  Copyright (c) 2002 Insight Consortium. All rights reserved.\n  See ITKCopyright.txt or http:\/\/www.itk.org\/HTML\/Copyright.htm for details.\n\n     This software is distributed WITHOUT ANY WARRANTY; without even\n     the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n     PURPOSE.  See the above copyright notices for more information.\n\n=========================================================================*\/\n\n#include \"itkImage.h\"\n#include \"itkVTKImageExport.h\"\n#include \"itkVTKImageImport.h\"\n#include \"itkImageFileReader.h\"\n\n#include \"vtkImageData.h\"\n#include \"vtkImageImport.h\"\n#include \"vtkImageExport.h\"\n#include \"vtkImageActor.h\"\n#include \"vtkRenderer.h\"\n#include \"vtkRenderWindow.h\"\n#include \"vtkRenderWindowInteractor.h\"\n#include \"vtkInteractorStyleImage.h\"\n\n#include \"itkFilterStreamingWatcher.h\"\n\n\/**\n * This function will connect the given itk::VTKImageExport filter to\n * the given vtkImageImport filter.\n *\/\ntemplate <typename ITK_Exporter, typename VTK_Importer>\nvoid ConnectPipelines(ITK_Exporter exporter, VTK_Importer* importer)\n{\n  importer->SetUpdateInformationCallback(exporter->GetUpdateInformationCallback());\n  importer->SetPipelineModifiedCallback(exporter->GetPipelineModifiedCallback());\n  importer->SetWholeExtentCallback(exporter->GetWholeExtentCallback());\n  importer->SetSpacingCallback(exporter->GetSpacingCallback());\n  importer->SetOriginCallback(exporter->GetOriginCallback());\n  importer->SetScalarTypeCallback(exporter->GetScalarTypeCallback());\n  importer->SetNumberOfComponentsCallback(exporter->GetNumberOfComponentsCallback());\n  importer->SetPropagateUpdateExtentCallback(exporter->GetPropagateUpdateExtentCallback());\n  importer->SetUpdateDataCallback(exporter->GetUpdateDataCallback());\n  importer->SetDataExtentCallback(exporter->GetDataExtentCallback());\n  importer->SetBufferPointerCallback(exporter->GetBufferPointerCallback());\n  importer->SetCallbackUserData(exporter->GetCallbackUserData());\n}\n\n\/**\n * This function will connect the given vtkImageExport filter to\n * the given itk::VTKImageImport filter.\n *\/\ntemplate <typename VTK_Exporter, typename ITK_Importer>\nvoid ConnectPipelines(VTK_Exporter* exporter, ITK_Importer importer)\n{\n  importer->SetUpdateInformationCallback(exporter->GetUpdateInformationCallback());\n  importer->SetPipelineModifiedCallback(exporter->GetPipelineModifiedCallback());\n  importer->SetWholeExtentCallback(exporter->GetWholeExtentCallback());\n  importer->SetSpacingCallback(exporter->GetSpacingCallback());\n  importer->SetOriginCallback(exporter->GetOriginCallback());\n  importer->SetScalarTypeCallback(exporter->GetScalarTypeCallback());\n  importer->SetNumberOfComponentsCallback(exporter->GetNumberOfComponentsCallback());\n  importer->SetPropagateUpdateExtentCallback(exporter->GetPropagateUpdateExtentCallback());\n  importer->SetUpdateDataCallback(exporter->GetUpdateDataCallback());\n  importer->SetDataExtentCallback(exporter->GetDataExtentCallback());\n  importer->SetBufferPointerCallback(exporter->GetBufferPointerCallback());\n  importer->SetCallbackUserData(exporter->GetCallbackUserData());\n}\n\n\n\/**\n * This program implements an example connection between ITK and VTK\n * pipelines.  The combined pipeline flows as follows:\n *\n * itkImageFileReader ==> itkVTKImageExport ==>\n *    vtkImageImport ==> vtkImageActor\n *\n * The resulting vtkImageActor is displayed in a vtkRenderWindow.\n * Whenever the VTK pipeline executes, information is propagated\n * through the ITK pipeline.  If the ITK pipeline is out of date, it\n * will re-execute and cause the VTK pipeline to update properly as\n * well.\n *\/\nint main(int argc, char * argv [] )\n{\n\n  \/\/ Load a scalar image using ITK and display it with VTK\n\n  if( argc < 2 )\n    {\n    std::cerr << \"Missing parameters\" << std::endl;\n    std::cerr << \"Usage: \" << argv[0] << \" inputImageFilename \" << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  try\n    {\n    typedef unsigned char PixelType;\n\n    typedef itk::Image< PixelType, 3 > ImageType;\n\n    typedef itk::ImageFileReader< ImageType > ReaderType;\n\n    ReaderType::Pointer reader  = ReaderType::New();\n\n    reader->SetFileName( argv[1] );\n\n    typedef itk::VTKImageExport< ImageType > ExportFilterType;\n    ExportFilterType::Pointer itkExporter = ExportFilterType::New();\n\n    itkExporter->SetInput( reader->GetOutput() );\n\n    itk::FilterStreamingWatcher watcher( reader, \"monitor reading\");\n\n    vtkImageImport* vtkImporter = vtkImageImport::New();\n    ConnectPipelines(itkExporter, vtkImporter);\n\n\n    \/\/------------------------------------------------------------------------\n    \/\/ VTK visualization pipeline\n    \/\/------------------------------------------------------------------------\n\n    \/\/ Create a vtkImageActor to help render the image.  Connect it to\n    \/\/ the vtkImporter instance.\n    vtkImageActor* actor = vtkImageActor::New();\n    actor->SetInput(vtkImporter->GetOutput());\n\n    vtkInteractorStyleImage * interactorStyle = vtkInteractorStyleImage::New();\n\n    \/\/ Create a renderer, render window, and render window interactor to\n    \/\/ display the results.\n    vtkRenderer* renderer = vtkRenderer::New();\n    vtkRenderWindow* renWin = vtkRenderWindow::New();\n    vtkRenderWindowInteractor* iren = vtkRenderWindowInteractor::New();\n\n    renWin->SetSize(500, 500);\n    renWin->AddRenderer(renderer);\n    iren->SetRenderWindow(renWin);\n    iren->SetInteractorStyle( interactorStyle );\n\n    \/\/ Add the vtkImageActor to the renderer for display.\n    renderer->AddActor(actor);\n    renderer->SetBackground(0.4392, 0.5020, 0.5647);\n\n    \/\/ Bring up the render window and begin interaction.\n    renWin->Render();\n    iren->Start();\n\n    \/\/ Release all VTK components\n    actor->Delete();\n    interactorStyle->Delete();\n    vtkImporter->Delete();\n    renWin->Delete();\n    renderer->Delete();\n    iren->Delete();\n\n    }\n  catch( itk::ExceptionObject & e )\n    {\n    std::cerr << \"Exception catched !! \" << e << std::endl;\n    }\n\n  return EXIT_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>\n\/**\n * @file LICSDetector.hpp\n * This is a class to detect cycle slips using LI observables.\n *\/\n\n#ifndef LICSDETECTOR_GPSTK\n#define LICSDETECTOR_GPSTK\n\n\/\/============================================================================\n\/\/\n\/\/  This file is part of GPSTk, the GPS Toolkit.\n\/\/\n\/\/  The GPSTk is free software; you can redistribute it and\/or modify\n\/\/  it under the terms of the GNU Lesser General Public License as published\n\/\/  by the Free Software Foundation; either version 2.1 of the License, or\n\/\/  any later version.\n\/\/\n\/\/  The GPSTk is distributed in the hope that it will be useful,\n\/\/  but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n\/\/  GNU Lesser General Public License for more details.\n\/\/\n\/\/  You should have received a copy of the GNU Lesser General Public\n\/\/  License along with GPSTk; if not, write to the Free Software Foundation,\n\/\/  Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA\n\/\/  \n\/\/  Dagoberto Salazar - gAGE ( http:\/\/www.gage.es ). 2007\n\/\/\n\/\/============================================================================\n\n\n\n#include \"DataStructures.hpp\"\n\n\n\nnamespace gpstk\n{\n\n    \/** @addtogroup GPSsolutions *\/\n    \/\/@{\n\n\n    \/** This is a class to detect cycle slips using LI observables.\n     * This class is meant to be used with the GNSS data structures objects\n     * found in \"DataStructures\" class.\n     *\n     * A typical way to use this class follows:\n     *\n     * @code\n     *   RinexObsStream rin(\"ebre0300.02o\");\n     *\n     *   gnssRinex gRin;\n     *   ComputeLI getLI;\n     *   LICSDetector markCSLI;\n     *\n     *   while(rin >> gRin) {\n     *      gRin >> getLI >> markCSLI;\n     *   }\n     * @endcode\n     *\n     * The \"LICSDetector\" object will visit every satellite in the GNSS data\n     * structure that is \"gRin\" and will decide if a cycle slip has happened in the\n     * given observable.\n     *\n     * The algorithm will use LI observables, and the LLI1 and LLI2 indexes.\n     * The result (a 0 if a cycle slip is found, 1 otherwise) will be stored in the\n     * data structure both as the CSL1 and CSL2 indexes.\n     *\n     * This algorithm will use some values as maximum interval of time between\n     * two successive epochs, minimum threshold for declaring cycle slip and LI\n     * combination limit drift.\n     * \n     * The default values are usually fine, but nevertheless you may change them \n     * with the appropriate methods. The former is of special importance for the\n     * maximum interval time, that should be adjusted to your sampling rate. By\n     * default it is 61 seconds, adapted to 30 seconds per sample RINEX files.\n     *\n     * When used with the \">>\" operator, this class returns the same incoming\n     * data structure with the cycle slip indexes inserted along their corresponding\n     * satellites. Be warned that if a given satellite does not have the \n     * observations required, it will be summarily deleted from the data\n     * structure.\n     *\n     *\/    \n    class LICSDetector\n    {\n    public:\n\n        \/\/\/ Default constructor, setting default parameters.\n        LICSDetector() : obsType(TypeID::LI), lliType1(TypeID::LLI1), lliType2(TypeID::LLI2), resultType1(TypeID::CSL1), resultType2(TypeID::CSL2), deltaTMax(61.0), minThreshold(0.04), LIDrift(0.002), useLLI(true) {};\n\n\n        \/** Common constructor\n         *\n         * @param mThr          Minimum threshold for declaring cycle slip, in meters.\n         * @param drift         LI combination limit drift, in meters\/second.\n         * @param dtMax         Maximum interval of time allowed between two successive epochs, in seconds.\n         *\/\n        LICSDetector(const double& mThr, const double& drift, const double& dtMax = 61.0, const bool& use = true) : obsType(TypeID::LI), lliType1(TypeID::LLI1), lliType2(TypeID::LLI2), resultType1(TypeID::CSL1), resultType2(TypeID::CSL2), useLLI(use)\n        {\n            setDeltaTMax(dtMax);\n            setMinThreshold(mThr);\n            setLIDrift(drift);\n        };\n\n\n        \/** Returns a satTypeValueMap object, adding the new data generated when calling this object.\n         *\n         * @param epoch     Time of observations.\n         * @param gData     Data object holding the data.\n         * @param epochflag Epoch flag.\n         *\/\n        virtual satTypeValueMap& Detect(const DayTime& epoch, satTypeValueMap& gData, const short& epochflag=0)\n        {\n            double value1(0.0);\n            double lli1(0.0);\n            double lli2(0.0);\n\n            SatIDSet satRejectedSet;\n\n            \/\/ Loop through all the satellites\n            satTypeValueMap::iterator it;\n            for (it = gData.begin(); it != gData.end(); ++it) \n            {\n                try\n                {\n                    \/\/ Try to extract the values\n                    value1 = (*it).second(obsType);\n                }\n                catch(...)\n                {\n                    \/\/ If some value is missing, then schedule this satellite for removal\n                    satRejectedSet.insert( (*it).first );\n                    continue;\n                }\n                if (useLLI)\n                {\n                    try\n                    {\n                        \/\/ Try to get the LLI1 index\n                        lli1  = (*it).second(lliType1);\n                    }\n                    catch(...)\n                    {\n                        \/\/ If LLI #1 is not found, set it to zero\n                        \/\/ You REALLY want to have BOTH LLI indexes properly set\n                        lli1 = 0.0;\n                    }\n                    try\n                    {\n                        \/\/ Try to get the LLI2 index\n                        lli2  = (*it).second(lliType2);\n                    }\n                    catch(...)\n                    {\n                        \/\/ If LLI #2 is not found, set it to zero\n                        \/\/ You REALLY want to have BOTH LLI indexes properly set\n                        lli2 = 0.0;\n                    }\n                }\n                \/\/ If everything is OK, then get the new values inside the structure\n                \/\/ This way of doing it allows concatenation of several different cycle slip detectors\n                (*it).second[resultType1] += getDetection(epoch, (*it).first, (*it).second, epochflag, value1, lli1, lli2);\n                if ( (*it).second[resultType1] > 1.0 ) (*it).second[resultType1] = 1.0;\n                \/\/ We will mark both cycle slip flags\n                (*it).second[resultType2] = (*it).second[resultType1];\n            }\n            \/\/ Remove satellites with missing data\n            gData.removeSatID(satRejectedSet);\n\n            return gData;\n        };\n\n\n        \/** Method to set the maximum interval of time allowed between two successive epochs.\n         * @param maxDelta      Maximum interval of time, in seconds\n         *\/\n        virtual void setDeltaTMax(const double& maxDelta)\n        {\n            \/\/ Don't allow delta times less than or equal to 0\n            if (maxDelta > 0.0) deltaTMax = maxDelta; else deltaTMax = 61.0;\n        };\n\n\n        \/\/\/ Method to get the maximum interval of time allowed between two successive epochs, in seconds.\n        virtual double getDeltaTMax() const\n        {\n           return deltaTMax;\n        };\n\n\n        \/** Method to set the minimum threshold for cycle slip detection, in meters.\n         * @param mThr      Minimum threshold for cycle slip detection, in meters.\n         *\/\n        virtual void setMinThreshold(const double& mThr)\n        {\n            \/\/ Don't allow thresholds less than 0\n            if (mThr < 0.0) minThreshold = 0.04; else minThreshold = mThr;\n        };\n\n\n        \/\/\/ Method to get the minimum threshold for cycle slip detection, in meters.\n        virtual double getMinThreshold() const\n        {\n           return minThreshold;\n        };\n\n\n        \/** Method to set the LI combination limit drift, in meters\/second\n         * @param drift     LI combination limit drift, in meters\/second.\n         *\/\n        virtual void setLIDrift(const double& drift)\n        {\n            \/\/ Don't allow drift less than or equal to 0\n            if (drift > 0.0) LIDrift = drift; else LIDrift = 0.002;\n        };\n\n\n        \/\/\/ Method to get the minimum threshold for cycle slip detection, in meters.\n        virtual double getLIDrift() const\n        {\n           return LIDrift;\n        };\n\n\n        \/** Method to set whether the LLI indexes will be used as an aid or not.\n         * @param use   Boolean value enabling\/disabling LLI check\n         *\/\n        virtual void setUseLLI(const bool& use)\n        {\n            useLLI = use;\n        };\n\n\n        \/\/\/ Method to know if the LLI check is enabled or disabled.\n        virtual bool getUseLLI() const\n        {\n           return useLLI;\n        };\n\n\n        \/** Returns a gnnsSatTypeValue object, adding the new data generated when calling this object.\n         *\n         * @param gData    Data object holding the data.\n         *\/\n        virtual gnssSatTypeValue& Detect(gnssSatTypeValue& gData)\n        {\n            (*this).Detect(gData.header.epoch, gData.body);\n            return gData;\n        };\n\n\n        \/** Returns a gnnsRinex object, adding the new data generated when calling this object.\n         *\n         * @param gData    Data object holding the data.\n         *\/\n        virtual gnssRinex& Detect(gnssRinex& gData)\n        {\n            (*this).Detect(gData.header.epoch, gData.body, gData.header.epochFlag);\n            return gData;\n        };\n\n\n        \/\/\/ Destructor\n        virtual ~LICSDetector() {};\n\n\n    private:\n\n        \/\/\/ Type of code.\n        TypeID obsType;\n\n        \/\/\/ Type of LLI1 record.\n        TypeID lliType1;\n\n        \/\/\/ Type of LLI2 record.\n        TypeID lliType2;\n\n        \/\/\/ Type of result #1.\n        TypeID resultType1;\n\n        \/\/\/ Type of result #2.\n        TypeID resultType2;\n\n\n        \/\/\/ Maximum interval of time allowed between two successive epochs, in seconds.\n        double deltaTMax;\n\n\n        \/\/\/ Minimum threshold for declaring cycle slip, in meters.\n        double minThreshold;\n\n\n        \/\/\/ LI combination limit drift, in meters\/second.\n        double LIDrift;\n\n\n        \/\/\/ This field tells whether to use or ignore the LLI indexes as an aid. \n        bool useLLI;\n\n        \/\/\/ A structure used to store filter data for a SV.\n        struct filterData\n        {\n            \/\/ Default constructor initializing the data in the structure\n            filterData() : formerEpoch(DayTime::BEGINNING_OF_TIME), windowSize(0), formerLI(0.0), formerBias(0.0), formerDeltaT(1.0) {};\n\n            DayTime formerEpoch;    \/\/\/< The previous epoch time stamp.\n            int windowSize;         \/\/\/< Size of current window, in samples.\n            double formerLI;        \/\/\/< Value of the previous LI observable.\n            double formerBias;      \/\/\/< Previous bias (LI_1 - LI_0).\n            double formerDeltaT;    \/\/\/< Previous time difference, in seconds.\n        };\n\n\n        \/\/\/ Map holding the information regarding every satellite\n        std::map<SatID, filterData> LIData;\n\n\n        \/** Returns a satTypeValueMap object, adding the new data generated when calling this object.\n         *\n         * @param epoch     Time of observations.\n         * @param sat       SatID.\n         * @param tvMap     Data structure of TypeID and values.\n         * @param epochflag Epoch flag.\n         * @param li        Current LI observation value.\n         * @param lli1      LLI1 index.\n         * @param lli2      LLI2 index.\n         *\/\n        virtual double getDetection(const DayTime& epoch, const SatID& sat, typeValueMap& tvMap, const short& epochflag, const double& li, const double& lli1, const double& lli2)\n        {\n            bool reportCS(false);\n            double currentDeltaT(0.0); \/\/ Difference between current and former epochs, in sec\n            double currentBias(0.0);   \/\/ Difference between current and former LI values\n            double deltaLimit(0.0);    \/\/ Limit to declare cycle slip\n            double delta(0.0);\n            double tempLLI1(0.0);\n            double tempLLI2(0.0);\n\n\n            \/\/ Get the difference between current epoch and former epoch, in seconds\n            currentDeltaT = ( epoch.MJDdate() - LIData[sat].formerEpoch.MJDdate() ) * DayTime::SEC_DAY;\n\n            \/\/ Store current epoch as former epoch\n            LIData[sat].formerEpoch = epoch;\n\n            currentBias = li - LIData[sat].formerLI;   \/\/ Current value of LI difference\n\n            \/\/ Increment size of window and check if first time here\n            ++LIData[sat].windowSize;\n\n            \/\/ Check if receiver already declared cycle slip or too much time has elapsed\n            \/\/ Note: If tvMap(lliType1) or tvMap(lliType2) don't exist, then 0 will be returned and those tests will pass\n            if ( (tvMap(lliType1)==1.0) || (tvMap(lliType1)==3.0) || (tvMap(lliType1)==5.0) || (tvMap(lliType1)==7.0) ) tempLLI1 = 1.0;\n\n            if ( (tvMap(lliType2)==1.0) || (tvMap(lliType2)==3.0) || (tvMap(lliType2)==5.0) || (tvMap(lliType2)==7.0) ) tempLLI2 = 1.0;\n\n            if ( (epochflag==1) || (epochflag==6) || (tempLLI1==1.0) || (tempLLI2==1.0) || (currentDeltaT > deltaTMax) )\n            {\n                LIData[sat].windowSize = 0;      \/\/ We reset the filter with this\n                reportCS = true;\n            }\n\n            if (LIData[sat].windowSize > 1)\n            {\n                deltaLimit = minThreshold + std::abs(LIDrift*currentDeltaT);\n                \/\/ Compute a linear interpolation and compute LI_predicted - LI_current\n                delta = std::abs(currentBias - LIData[sat].formerBias*currentDeltaT\/LIData[sat].formerDeltaT);\n\n                if (delta > deltaLimit)\n                {\n                    LIData[sat].windowSize = 0;      \/\/ We reset the filter with this\n                    reportCS = true;\n                }\n            }\n\n            \/\/ Let's prepare for the next time\n            LIData[sat].formerLI = li;\n            LIData[sat].formerBias = currentBias;\n            LIData[sat].formerDeltaT = currentDeltaT;               \n\n            if (reportCS) return 1.0; else return 0.0;\n        };\n\n   }; \/\/ end class LICSDetector\n   \n\n    \/\/\/ Input operator from gnssSatTypeValue to LICSDetector.\n    inline gnssSatTypeValue& operator>>(gnssSatTypeValue& gData, LICSDetector& liD)\n    {\n            liD.Detect(gData);\n            return gData;\n    }\n\n\n    \/\/\/ Input operator from gnssRinex to LICSDetector.\n    inline gnssRinex& operator>>(gnssRinex& gData, LICSDetector& liD)\n    {\n            liD.Detect(gData);\n            return gData;\n    }\n\n   \n\n\n\n   \/\/@}\n   \n}\n\n#endif\n<commit_msg>Changes in documentation, warning about false negatives.<commit_after>\n\/**\n * @file LICSDetector.hpp\n * This is a class to detect cycle slips using LI observables.\n *\/\n\n#ifndef LICSDETECTOR_GPSTK\n#define LICSDETECTOR_GPSTK\n\n\/\/============================================================================\n\/\/\n\/\/  This file is part of GPSTk, the GPS Toolkit.\n\/\/\n\/\/  The GPSTk is free software; you can redistribute it and\/or modify\n\/\/  it under the terms of the GNU Lesser General Public License as published\n\/\/  by the Free Software Foundation; either version 2.1 of the License, or\n\/\/  any later version.\n\/\/\n\/\/  The GPSTk is distributed in the hope that it will be useful,\n\/\/  but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n\/\/  GNU Lesser General Public License for more details.\n\/\/\n\/\/  You should have received a copy of the GNU Lesser General Public\n\/\/  License along with GPSTk; if not, write to the Free Software Foundation,\n\/\/  Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA\n\/\/  \n\/\/  Dagoberto Salazar - gAGE ( http:\/\/www.gage.es ). 2007\n\/\/\n\/\/============================================================================\n\n\n\n#include \"DataStructures.hpp\"\n\n\n\nnamespace gpstk\n{\n\n    \/** @addtogroup GPSsolutions *\/\n    \/\/@{\n\n\n    \/** This is a class to detect cycle slips using LI observables.\n     * This class is meant to be used with the GNSS data structures objects\n     * found in \"DataStructures\" class.\n     *\n     * A typical way to use this class follows:\n     *\n     * @code\n     *   RinexObsStream rin(\"ebre0300.02o\");\n     *\n     *   gnssRinex gRin;\n     *   ComputeLI getLI;\n     *   LICSDetector markCSLI;\n     *\n     *   while(rin >> gRin) {\n     *      gRin >> getLI >> markCSLI;\n     *   }\n     * @endcode\n     *\n     * The \"LICSDetector\" object will visit every satellite in the GNSS data\n     * structure that is \"gRin\" and will decide if a cycle slip has happened in the\n     * given observable.\n     *\n     * The algorithm will use LI observables, and the LLI1 and LLI2 indexes.\n     * The result (a 0 if a cycle slip is found, 1 otherwise) will be stored in the\n     * data structure both as the CSL1 and CSL2 indexes.\n     *\n     * This algorithm will use some values as maximum interval of time between\n     * two successive epochs, minimum threshold for declaring cycle slip and LI\n     * combination limit drift.\n     * \n     * The default values are usually fine, but nevertheless you may change them \n     * with the appropriate methods. The former is of special importance for the\n     * maximum interval time, that should be adjusted to your sampling rate. By\n     * default it is 61 seconds, adapted to 30 seconds per sample RINEX files.\n     *\n     * When used with the \">>\" operator, this class returns the same incoming\n     * data structure with the cycle slip indexes inserted along their corresponding\n     * satellites. Be warned that if a given satellite does not have the \n     * observations required, it will be summarily deleted from the data\n     * structure.\n     *\n     * Be aware that some combinations of cycle slips in L1 and L2 may result in\n     * a false negative when using a cycle slip detector based on LI. Therefore,\n     * to be on the safe side you should complement this with another kind of\n     * detector, such as one based on the Melbourne-Wubbena combination.\n     *\n     *\/    \n    class LICSDetector\n    {\n    public:\n\n        \/\/\/ Default constructor, setting default parameters.\n        LICSDetector() : obsType(TypeID::LI), lliType1(TypeID::LLI1), lliType2(TypeID::LLI2), resultType1(TypeID::CSL1), resultType2(TypeID::CSL2), deltaTMax(61.0), minThreshold(0.04), LIDrift(0.002), useLLI(true) {};\n\n\n        \/** Common constructor\n         *\n         * @param mThr          Minimum threshold for declaring cycle slip, in meters.\n         * @param drift         LI combination limit drift, in meters\/second.\n         * @param dtMax         Maximum interval of time allowed between two successive epochs, in seconds.\n         *\/\n        LICSDetector(const double& mThr, const double& drift, const double& dtMax = 61.0, const bool& use = true) : obsType(TypeID::LI), lliType1(TypeID::LLI1), lliType2(TypeID::LLI2), resultType1(TypeID::CSL1), resultType2(TypeID::CSL2), useLLI(use)\n        {\n            setDeltaTMax(dtMax);\n            setMinThreshold(mThr);\n            setLIDrift(drift);\n        };\n\n\n        \/** Returns a satTypeValueMap object, adding the new data generated when calling this object.\n         *\n         * @param epoch     Time of observations.\n         * @param gData     Data object holding the data.\n         * @param epochflag Epoch flag.\n         *\/\n        virtual satTypeValueMap& Detect(const DayTime& epoch, satTypeValueMap& gData, const short& epochflag=0)\n        {\n            double value1(0.0);\n            double lli1(0.0);\n            double lli2(0.0);\n\n            SatIDSet satRejectedSet;\n\n            \/\/ Loop through all the satellites\n            satTypeValueMap::iterator it;\n            for (it = gData.begin(); it != gData.end(); ++it) \n            {\n                try\n                {\n                    \/\/ Try to extract the values\n                    value1 = (*it).second(obsType);\n                }\n                catch(...)\n                {\n                    \/\/ If some value is missing, then schedule this satellite for removal\n                    satRejectedSet.insert( (*it).first );\n                    continue;\n                }\n                if (useLLI)\n                {\n                    try\n                    {\n                        \/\/ Try to get the LLI1 index\n                        lli1  = (*it).second(lliType1);\n                    }\n                    catch(...)\n                    {\n                        \/\/ If LLI #1 is not found, set it to zero\n                        \/\/ You REALLY want to have BOTH LLI indexes properly set\n                        lli1 = 0.0;\n                    }\n                    try\n                    {\n                        \/\/ Try to get the LLI2 index\n                        lli2  = (*it).second(lliType2);\n                    }\n                    catch(...)\n                    {\n                        \/\/ If LLI #2 is not found, set it to zero\n                        \/\/ You REALLY want to have BOTH LLI indexes properly set\n                        lli2 = 0.0;\n                    }\n                }\n                \/\/ If everything is OK, then get the new values inside the structure\n                \/\/ This way of doing it allows concatenation of several different cycle slip detectors\n                (*it).second[resultType1] += getDetection(epoch, (*it).first, (*it).second, epochflag, value1, lli1, lli2);\n                if ( (*it).second[resultType1] > 1.0 ) (*it).second[resultType1] = 1.0;\n                \/\/ We will mark both cycle slip flags\n                (*it).second[resultType2] = (*it).second[resultType1];\n            }\n            \/\/ Remove satellites with missing data\n            gData.removeSatID(satRejectedSet);\n\n            return gData;\n        };\n\n\n        \/** Method to set the maximum interval of time allowed between two successive epochs.\n         * @param maxDelta      Maximum interval of time, in seconds\n         *\/\n        virtual void setDeltaTMax(const double& maxDelta)\n        {\n            \/\/ Don't allow delta times less than or equal to 0\n            if (maxDelta > 0.0) deltaTMax = maxDelta; else deltaTMax = 61.0;\n        };\n\n\n        \/\/\/ Method to get the maximum interval of time allowed between two successive epochs, in seconds.\n        virtual double getDeltaTMax() const\n        {\n           return deltaTMax;\n        };\n\n\n        \/** Method to set the minimum threshold for cycle slip detection, in meters.\n         * @param mThr      Minimum threshold for cycle slip detection, in meters.\n         *\/\n        virtual void setMinThreshold(const double& mThr)\n        {\n            \/\/ Don't allow thresholds less than 0\n            if (mThr < 0.0) minThreshold = 0.04; else minThreshold = mThr;\n        };\n\n\n        \/\/\/ Method to get the minimum threshold for cycle slip detection, in meters.\n        virtual double getMinThreshold() const\n        {\n           return minThreshold;\n        };\n\n\n        \/** Method to set the LI combination limit drift, in meters\/second\n         * @param drift     LI combination limit drift, in meters\/second.\n         *\/\n        virtual void setLIDrift(const double& drift)\n        {\n            \/\/ Don't allow drift less than or equal to 0\n            if (drift > 0.0) LIDrift = drift; else LIDrift = 0.002;\n        };\n\n\n        \/\/\/ Method to get the minimum threshold for cycle slip detection, in meters.\n        virtual double getLIDrift() const\n        {\n           return LIDrift;\n        };\n\n\n        \/** Method to set whether the LLI indexes will be used as an aid or not.\n         * @param use   Boolean value enabling\/disabling LLI check\n         *\/\n        virtual void setUseLLI(const bool& use)\n        {\n            useLLI = use;\n        };\n\n\n        \/\/\/ Method to know if the LLI check is enabled or disabled.\n        virtual bool getUseLLI() const\n        {\n           return useLLI;\n        };\n\n\n        \/** Returns a gnnsSatTypeValue object, adding the new data generated when calling this object.\n         *\n         * @param gData    Data object holding the data.\n         *\/\n        virtual gnssSatTypeValue& Detect(gnssSatTypeValue& gData)\n        {\n            (*this).Detect(gData.header.epoch, gData.body);\n            return gData;\n        };\n\n\n        \/** Returns a gnnsRinex object, adding the new data generated when calling this object.\n         *\n         * @param gData    Data object holding the data.\n         *\/\n        virtual gnssRinex& Detect(gnssRinex& gData)\n        {\n            (*this).Detect(gData.header.epoch, gData.body, gData.header.epochFlag);\n            return gData;\n        };\n\n\n        \/\/\/ Destructor\n        virtual ~LICSDetector() {};\n\n\n    private:\n\n        \/\/\/ Type of code.\n        TypeID obsType;\n\n        \/\/\/ Type of LLI1 record.\n        TypeID lliType1;\n\n        \/\/\/ Type of LLI2 record.\n        TypeID lliType2;\n\n        \/\/\/ Type of result #1.\n        TypeID resultType1;\n\n        \/\/\/ Type of result #2.\n        TypeID resultType2;\n\n\n        \/\/\/ Maximum interval of time allowed between two successive epochs, in seconds.\n        double deltaTMax;\n\n\n        \/\/\/ Minimum threshold for declaring cycle slip, in meters.\n        double minThreshold;\n\n\n        \/\/\/ LI combination limit drift, in meters\/second.\n        double LIDrift;\n\n\n        \/\/\/ This field tells whether to use or ignore the LLI indexes as an aid. \n        bool useLLI;\n\n        \/\/\/ A structure used to store filter data for a SV.\n        struct filterData\n        {\n            \/\/ Default constructor initializing the data in the structure\n            filterData() : formerEpoch(DayTime::BEGINNING_OF_TIME), windowSize(0), formerLI(0.0), formerBias(0.0), formerDeltaT(1.0) {};\n\n            DayTime formerEpoch;    \/\/\/< The previous epoch time stamp.\n            int windowSize;         \/\/\/< Size of current window, in samples.\n            double formerLI;        \/\/\/< Value of the previous LI observable.\n            double formerBias;      \/\/\/< Previous bias (LI_1 - LI_0).\n            double formerDeltaT;    \/\/\/< Previous time difference, in seconds.\n        };\n\n\n        \/\/\/ Map holding the information regarding every satellite\n        std::map<SatID, filterData> LIData;\n\n\n        \/** Returns a satTypeValueMap object, adding the new data generated when calling this object.\n         *\n         * @param epoch     Time of observations.\n         * @param sat       SatID.\n         * @param tvMap     Data structure of TypeID and values.\n         * @param epochflag Epoch flag.\n         * @param li        Current LI observation value.\n         * @param lli1      LLI1 index.\n         * @param lli2      LLI2 index.\n         *\/\n        virtual double getDetection(const DayTime& epoch, const SatID& sat, typeValueMap& tvMap, const short& epochflag, const double& li, const double& lli1, const double& lli2)\n        {\n            bool reportCS(false);\n            double currentDeltaT(0.0); \/\/ Difference between current and former epochs, in sec\n            double currentBias(0.0);   \/\/ Difference between current and former LI values\n            double deltaLimit(0.0);    \/\/ Limit to declare cycle slip\n            double delta(0.0);\n            double tempLLI1(0.0);\n            double tempLLI2(0.0);\n\n\n            \/\/ Get the difference between current epoch and former epoch, in seconds\n            currentDeltaT = ( epoch.MJDdate() - LIData[sat].formerEpoch.MJDdate() ) * DayTime::SEC_DAY;\n\n            \/\/ Store current epoch as former epoch\n            LIData[sat].formerEpoch = epoch;\n\n            currentBias = li - LIData[sat].formerLI;   \/\/ Current value of LI difference\n\n            \/\/ Increment size of window\n            ++LIData[sat].windowSize;\n\n            \/\/ Check if receiver already declared cycle slip or too much time has elapsed\n            \/\/ Note: If tvMap(lliType1) or tvMap(lliType2) don't exist, then 0 will be returned and those tests will pass\n            if ( (tvMap(lliType1)==1.0) || (tvMap(lliType1)==3.0) || (tvMap(lliType1)==5.0) || (tvMap(lliType1)==7.0) ) tempLLI1 = 1.0;\n\n            if ( (tvMap(lliType2)==1.0) || (tvMap(lliType2)==3.0) || (tvMap(lliType2)==5.0) || (tvMap(lliType2)==7.0) ) tempLLI2 = 1.0;\n\n            if ( (epochflag==1) || (epochflag==6) || (tempLLI1==1.0) || (tempLLI2==1.0) || (currentDeltaT > deltaTMax) )\n            {\n                LIData[sat].windowSize = 0;      \/\/ We reset the filter with this\n                reportCS = true;\n            }\n\n            if (LIData[sat].windowSize > 1)\n            {\n                deltaLimit = minThreshold + std::abs(LIDrift*currentDeltaT);\n                \/\/ Compute a linear interpolation and compute LI_predicted - LI_current\n                delta = std::abs(currentBias - LIData[sat].formerBias*currentDeltaT\/LIData[sat].formerDeltaT);\n\n                if (delta > deltaLimit)\n                {\n                    LIData[sat].windowSize = 0;      \/\/ We reset the filter with this\n                    reportCS = true;\n                }\n            }\n\n            \/\/ Let's prepare for the next time\n            LIData[sat].formerLI = li;\n            LIData[sat].formerBias = currentBias;\n            LIData[sat].formerDeltaT = currentDeltaT;               \n\n            if (reportCS) return 1.0; else return 0.0;\n        };\n\n   }; \/\/ end class LICSDetector\n   \n\n    \/\/\/ Input operator from gnssSatTypeValue to LICSDetector.\n    inline gnssSatTypeValue& operator>>(gnssSatTypeValue& gData, LICSDetector& liD)\n    {\n            liD.Detect(gData);\n            return gData;\n    }\n\n\n    \/\/\/ Input operator from gnssRinex to LICSDetector.\n    inline gnssRinex& operator>>(gnssRinex& gData, LICSDetector& liD)\n    {\n            liD.Detect(gData);\n            return gData;\n    }\n\n   \n\n\n\n   \/\/@}\n   \n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include <PrecompiledHeader.h>\r\n#include \"MacroProject.h\"\r\n#include \"Utils\/Util.h\"\r\n#include \"Macro\/BWSAL.h\"\r\n#include <set>\r\n\r\nusing namespace BWAPI;\r\nusing namespace std;\r\n\r\n\/\/ TODO TODO TODO: work with accessibility while making it false when onUnitEvade\r\n\r\nBattleBroodAI::BattleBroodAI()\r\n{\r\n}\r\n\r\nBattleBroodAI::~BattleBroodAI()\r\n{\r\n}\r\n\r\nvoid BattleBroodAI::onStart()\r\n{\r\n    \/\/Broodwar->printf(\"The map is %s, a %d player map\",Broodwar->mapName().c_str(),Broodwar->getStartLocations().size());\r\n#ifdef __DEBUG__\r\n    Broodwar->enableFlag(Flag::UserInput);\r\n    \/\/Broodwar->setLocalSpeed(0);\r\n#endif\r\n\tBroodwar->setLatCom(false);\r\n\tBroodwar->setCommandOptimizationLevel(1);\r\n\r\n    BWTA::readMap();\r\n    BWTA::analyze();\r\n    this->analyzed=true;\r\n   \r\n\tthis->intelligence = & Intelligence::Instance();\r\n\tthis->macro = & Macro::Instance();\r\n\tthis->macro->init();\r\n\tthis->micro = & Micro::Instance();\r\n    this->timeManager = & TimeManager::Instance();\r\n}\r\n\r\nvoid BattleBroodAI::onEnd(bool isWinner)\r\n{\r\n\tIntelligence::Destroy();\r\n\tMacro::Destroy();\r\n\tMicro::Destroy();\r\n    TimeManager::Destroy();\r\n\r\n    if (isWinner)\r\n    {\r\n        \/\/log win to file\r\n    }\r\n}\r\n\r\nvoid BattleBroodAI::onFrame()\r\n{\r\n#ifdef __DEBUG__\r\n\tfor(std::set<BWTA::Region*>::const_iterator r=BWTA::getRegions().begin();r!=BWTA::getRegions().end();r++)\r\n\t{\r\n\t\tBWTA::Polygon p=(*r)->getPolygon();\r\n\t\tfor(int j=0;j<(int)p.size();j++)\r\n\t\t{\r\n\t\t\tPosition point1=p[j];\r\n\t\t\tPosition point2=p[(j+1) % p.size()];\r\n\t\t\tBroodwar->drawLine(CoordinateType::Map,point1.x(),point1.y(),point2.x(),point2.y(),Colors::Green);\r\n\t\t}\r\n\t}\r\n\tBroodwar->drawTextScreen(300, 20, \"APM %d\", Broodwar->getAPM());\r\n    clock_t start = clock();\r\n\r\n    if (Broodwar->getLastError() != BWAPI::Errors::None)\r\n        Broodwar->printf(\"LAST ERROR: %s\", Broodwar->getLastError().toString().c_str());\r\n#endif\r\n    if (Broodwar->isReplay()) return;\r\n    if (!this->analyzed) return;\r\n\r\n#ifdef BW_POS_MOUSE\r\n    char mousePos[100];\r\n\tsprintf_s(mousePos, \"%d, %d\", \r\n\t\tBroodwar->getScreenPosition().x() + Broodwar->getMousePosition().x(), \r\n\t\tBroodwar->getScreenPosition().y() + Broodwar->getMousePosition().y());\r\n    Broodwar->drawTextMouse(12, 0, mousePos);\r\n\tchar mouseTilePos[100];\r\n\tsprintf_s(mouseTilePos, \"%d, %d\", \r\n\t\t(Broodwar->getScreenPosition().x() + Broodwar->getMousePosition().x())\/32, \r\n\t\t(Broodwar->getScreenPosition().y() + Broodwar->getMousePosition().y())\/32);\r\n    Broodwar->drawTextMouse(12, 16, mouseTilePos);\r\n#endif\r\n\r\n    \/\/timeManager->update();\r\n    clock_t time1 = clock();\r\n\tintelligence->update(); \/\/ Intelligence update\r\n    clock_t time2 = clock();\r\n\tdouble interval = (double)(time2 - time1)\/CLOCKS_PER_SEC;\r\n\tif (interval > 0.040)\r\n\t\tBroodwar->printf(\"INTELLIGENCE took %2.5f seconds\", interval);\r\n\tmicro->update(); \/\/ Micro update\r\n\ttime1 = clock();\r\n\tinterval = (double)(time1 - time2)\/CLOCKS_PER_SEC;\r\n\tif (interval > 0.040)\r\n\t\tBroodwar->printf(\"MICRO took %2.5f seconds\", interval);\r\n\tmacro->update(); \/\/ Macro update\r\n\ttime2 = clock();\r\n\tinterval = (double)(time2 - time1)\/CLOCKS_PER_SEC;\r\n\tif (interval > 0.040)\r\n\t\tBroodwar->printf(\"MACRO took %2.5f seconds\", interval);\r\n\r\n#ifdef __DEBUG__\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 (TheArbitrator->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=TheArbitrator->getAllBidders(*i);\r\n\t\t\t\tif (bids.empty())\r\n\t\t\t\t\tcontinue;\r\n                int y_off=0;\r\n                bool first = false;\r\n                const char activeColor = '\\x07', inactiveColor = '\\x16';\r\n                char color = activeColor;\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->drawTextMap(x,y+y_off,\"%c%s: %d\",color,j->first->getShortName().c_str(),(int)j->second);\r\n                    y_off+=15;\r\n                    color = inactiveColor;\r\n                }\r\n            }\r\n        }\r\n    }\r\n#endif\r\n\r\n#ifdef __DEBUG__\r\n\tclock_t end = clock();\r\n    double duration = (double)(end - start) \/ CLOCKS_PER_SEC;\r\n    if (duration > 0.040) \r\n        Broodwar->printf(\"onFrame() took: %2.5f seconds\\n\", duration);\r\n#endif\r\n}\r\n\r\nvoid BattleBroodAI::onUnitCreate(BWAPI::Unit* unit)\r\n{\r\n\tintelligence->onUnitCreate(unit);\r\n\tmacro->onUnitCreate(unit);\r\n\tmicro->onUnitCreate(unit);\r\n}\r\n\r\nvoid BattleBroodAI::onUnitDestroy(BWAPI::Unit* unit)\r\n{\r\n\tintelligence->onUnitDestroy(unit);\r\n\tmacro->onUnitDestroy(unit);\r\n\tmicro->onUnitDestroy(unit);\r\n}\r\n\r\nvoid BattleBroodAI::onUnitShow(BWAPI::Unit* unit)\r\n{\r\n\tintelligence->onUnitShow(unit);\r\n\tmicro->onUnitShow(unit);\r\n}\r\n\r\nvoid BattleBroodAI::onUnitHide(BWAPI::Unit* unit)\r\n{\r\n\tintelligence->onUnitHide(unit);\r\n}\r\n\r\nvoid BattleBroodAI::onUnitDiscover(BWAPI::Unit* unit)\r\n{\r\n\tmacro->onUnitDiscover(unit);\r\n}\r\n\r\nvoid BattleBroodAI::onUnitEvade(BWAPI::Unit* unit)\r\n{\r\n\tmacro->onUnitEvade(unit);\r\n}\r\n\r\nvoid BattleBroodAI::onUnitMorph(BWAPI::Unit* unit)\r\n{\r\n\tintelligence->onUnitMorph(unit);\r\n\tmacro->onUnitMorph(unit);\r\n}\r\n\r\nvoid BattleBroodAI::onUnitRenegade(BWAPI::Unit* unit)\r\n{\r\n\tintelligence->onUnitRenegade(unit);\r\n\tmacro->onUnitRenegade(unit);\r\n\tmicro->onUnitRenegade(unit);\r\n}\r\n\r\nvoid BattleBroodAI::onPlayerLeft(BWAPI::Player* player)\r\n{\r\n    \/\/Broodwar->sendText(\"%s left the game.\",player->getName().c_str());\r\n}\r\n\r\nvoid BattleBroodAI::onNukeDetect(BWAPI::Position target)\r\n{\r\n\tmicro->onNukeDetect(target);\r\n    if (target!=Positions::Unknown)\r\n    \tBroodwar->printf(\"Nuclear Launch Detected at (%d,%d)\",target.x(),target.y());\r\n    else\r\n    \tBroodwar->printf(\"Nuclear Launch Detected\");\r\n}\r\n\r\nvoid BattleBroodAI::onSendText(std::string text)\r\n{\r\n    if (text==\"\/show players\")\r\n    {\r\n        showPlayers();\r\n        return;\r\n    } else if (text==\"\/show forces\")\r\n    {\r\n        showForces();\r\n        return;\r\n    } else if (text==\"\/show visibility\")\r\n    {\r\n        show_visibility_data=true;\r\n    } else if (text==\"\/analyze\")\r\n    {\r\n        if (analyzed == false)\r\n        {\r\n            \/\/ Broodwar->printf(\"Analyzing map... this may take a minute\");\r\n            CreateThread(NULL, 0, (LPTHREAD_START_ROUTINE)AnalyzeThread, NULL, 0, NULL);\r\n        }\r\n        return;\r\n    }\r\n    else if (text.substr(0,9) == \"\/setspeed\")\r\n    {\r\n        int x = 0;\r\n        if (text[9] != ' ')\r\n            Broodwar->printf(\"Usage: \/setspeed SPEEDVALUE\");\r\n        std::string xx = text.substr(10);\r\n        x = atoi(xx.c_str());\r\n        \/\/  Broodwar->printf(\"Set Speed %i\", x);\r\n        Broodwar->setLocalSpeed(x);\r\n    }\r\n    if (text==\"debug\")\r\n    {\r\n        showManagerAssignments = !showManagerAssignments;\r\n        return;\r\n    }\r\n    \/*if (type!=UnitTypes::Unknown)\r\n    {\r\n\t\tmacro->buildOrderAdd(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\t\t\tmacro->techAdd(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\t\t\t\tmacro->upgradeAdd(type);\r\n            }\r\n            else\r\n                Broodwar->printf(\"You typed '%s'!\",text.c_str());\r\n        }\r\n    }*\/\r\n    return;\r\n}\r\n\r\nvoid BattleBroodAI::onReceiveText(BWAPI::Player* player, std::string text)\r\n{\r\n\treturn;\r\n}\r\n\r\nvoid BattleBroodAI::onSaveGame(std::stringbuf gameName)\r\n{\r\n\treturn;\r\n}\r\n\r\nDWORD WINAPI AnalyzeThread()\r\n{\r\n    BWTA::analyze();\r\n    analyzed   = true;\r\n    analysis_just_finished = true;\r\n\r\n    \/\/self start location only available if the map has base locations\r\n    if (BWTA::getStartLocation(BWAPI::Broodwar->self())!=NULL)\r\n    {\r\n        home = BWTA::getStartLocation(BWAPI::Broodwar->self())->getRegion();\r\n    }\r\n    \/\/enemy start location only available if Complete Map Information is enabled.\r\n    if (BWTA::getStartLocation(BWAPI::Broodwar->enemy())!=NULL)\r\n    {\r\n        enemy_base = BWTA::getStartLocation(BWAPI::Broodwar->enemy())->getRegion();\r\n    }\r\n    return 0;\r\n}\r\n\r\nvoid BattleBroodAI::drawStats()\r\n{\r\n    std::set<Unit*> myUnits = Broodwar->self()->getUnits();\r\n    Broodwar->drawTextScreen(5,0,\"I have %d units:\",myUnits.size());\r\n    std::map<UnitType, int> unitTypeCounts;\r\n    for(std::set<Unit*>::iterator i=myUnits.begin();i!=myUnits.end();i++)\r\n    {\r\n        if (unitTypeCounts.find((*i)->getType())==unitTypeCounts.end())\r\n        {\r\n            unitTypeCounts.insert(std::make_pair((*i)->getType(),0));\r\n        }\r\n        unitTypeCounts.find((*i)->getType())->second++;\r\n    }\r\n    int line=1;\r\n    for(std::map<UnitType,int>::iterator i=unitTypeCounts.begin();i!=unitTypeCounts.end();i++)\r\n    {\r\n        Broodwar->drawTextScreen(5,16*line,\"- %d %ss\",(*i).second, (*i).first.getName().c_str());\r\n        line++;\r\n    }\r\n}\r\n\r\nvoid BattleBroodAI::showPlayers()\r\n{\r\n    std::set<Player*> players=Broodwar->getPlayers();\r\n    for(std::set<Player*>::iterator i=players.begin();i!=players.end();i++)\r\n    {\r\n        \/\/   Broodwar->printf(\"Player [%d]: %s is in force: %s\",(*i)->getID(),(*i)->getName().c_str(), (*i)->getForce()->getName().c_str());\r\n    }\r\n}\r\nvoid BattleBroodAI::showForces()\r\n{\r\n    std::set<Force*> forces=Broodwar->getForces();\r\n    for(std::set<Force*>::iterator i=forces.begin();i!=forces.end();i++)\r\n    {\r\n        std::set<Player*> players=(*i)->getPlayers();\r\n        \/\/  Broodwar->printf(\"Force %s has the following players:\",(*i)->getName().c_str());\r\n        for(std::set<Player*>::iterator j=players.begin();j!=players.end();j++)\r\n        {\r\n            \/\/      Broodwar->printf(\"  - Player [%d]: %s\",(*j)->getID(),(*j)->getName().c_str());\r\n        }\r\n    }\r\n}<commit_msg>correct a crash with TheArbitrator freed too early onEnd()<commit_after>#include <PrecompiledHeader.h>\r\n#include \"MacroProject.h\"\r\n#include \"Utils\/Util.h\"\r\n#include \"Macro\/BWSAL.h\"\r\n#include <set>\r\n\r\nusing namespace BWAPI;\r\nusing namespace std;\r\n\r\n\/\/ TODO TODO TODO: work with accessibility while making it false when onUnitEvade\r\n\r\nBattleBroodAI::BattleBroodAI()\r\n{\r\n}\r\n\r\nBattleBroodAI::~BattleBroodAI()\r\n{\r\n}\r\n\r\nvoid BattleBroodAI::onStart()\r\n{\r\n    \/\/Broodwar->printf(\"The map is %s, a %d player map\",Broodwar->mapName().c_str(),Broodwar->getStartLocations().size());\r\n#ifdef __DEBUG__\r\n    Broodwar->enableFlag(Flag::UserInput);\r\n    \/\/Broodwar->setLocalSpeed(0);\r\n#endif\r\n\tBroodwar->setLatCom(false);\r\n\tBroodwar->setCommandOptimizationLevel(1);\r\n\r\n    BWTA::readMap();\r\n    BWTA::analyze();\r\n    this->analyzed=true;\r\n   \r\n\tthis->intelligence = & Intelligence::Instance();\r\n\tthis->macro = & Macro::Instance();\r\n\tthis->macro->init();\r\n\tthis->micro = & Micro::Instance();\r\n    this->timeManager = & TimeManager::Instance();\r\n}\r\n\r\nvoid BattleBroodAI::onEnd(bool isWinner)\r\n{\r\n\tIntelligence::Destroy();\r\n\tMicro::Destroy();\r\n\tMacro::Destroy();\r\n    TimeManager::Destroy();\r\n\r\n    if (isWinner)\r\n    {\r\n        \/\/log win to file\r\n    }\r\n}\r\n\r\nvoid BattleBroodAI::onFrame()\r\n{\r\n#ifdef __DEBUG__\r\n\tfor(std::set<BWTA::Region*>::const_iterator r=BWTA::getRegions().begin();r!=BWTA::getRegions().end();r++)\r\n\t{\r\n\t\tBWTA::Polygon p=(*r)->getPolygon();\r\n\t\tfor(int j=0;j<(int)p.size();j++)\r\n\t\t{\r\n\t\t\tPosition point1=p[j];\r\n\t\t\tPosition point2=p[(j+1) % p.size()];\r\n\t\t\tBroodwar->drawLine(CoordinateType::Map,point1.x(),point1.y(),point2.x(),point2.y(),Colors::Green);\r\n\t\t}\r\n\t}\r\n\tBroodwar->drawTextScreen(300, 20, \"APM %d\", Broodwar->getAPM());\r\n    clock_t start = clock();\r\n\r\n    if (Broodwar->getLastError() != BWAPI::Errors::None)\r\n        Broodwar->printf(\"LAST ERROR: %s\", Broodwar->getLastError().toString().c_str());\r\n#endif\r\n    if (Broodwar->isReplay()) return;\r\n    if (!this->analyzed) return;\r\n\r\n#ifdef BW_POS_MOUSE\r\n    char mousePos[100];\r\n\tsprintf_s(mousePos, \"%d, %d\", \r\n\t\tBroodwar->getScreenPosition().x() + Broodwar->getMousePosition().x(), \r\n\t\tBroodwar->getScreenPosition().y() + Broodwar->getMousePosition().y());\r\n    Broodwar->drawTextMouse(12, 0, mousePos);\r\n\tchar mouseTilePos[100];\r\n\tsprintf_s(mouseTilePos, \"%d, %d\", \r\n\t\t(Broodwar->getScreenPosition().x() + Broodwar->getMousePosition().x())\/32, \r\n\t\t(Broodwar->getScreenPosition().y() + Broodwar->getMousePosition().y())\/32);\r\n    Broodwar->drawTextMouse(12, 16, mouseTilePos);\r\n#endif\r\n\r\n    \/\/timeManager->update();\r\n    clock_t time1 = clock();\r\n\tintelligence->update(); \/\/ Intelligence update\r\n    clock_t time2 = clock();\r\n\tdouble interval = (double)(time2 - time1)\/CLOCKS_PER_SEC;\r\n\tif (interval > 0.040)\r\n\t\tBroodwar->printf(\"INTELLIGENCE took %2.5f seconds\", interval);\r\n\tmicro->update(); \/\/ Micro update\r\n\ttime1 = clock();\r\n\tinterval = (double)(time1 - time2)\/CLOCKS_PER_SEC;\r\n\tif (interval > 0.040)\r\n\t\tBroodwar->printf(\"MICRO took %2.5f seconds\", interval);\r\n\tmacro->update(); \/\/ Macro update\r\n\ttime2 = clock();\r\n\tinterval = (double)(time2 - time1)\/CLOCKS_PER_SEC;\r\n\tif (interval > 0.040)\r\n\t\tBroodwar->printf(\"MACRO took %2.5f seconds\", interval);\r\n\r\n#ifdef __DEBUG__\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 (TheArbitrator->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=TheArbitrator->getAllBidders(*i);\r\n\t\t\t\tif (bids.empty())\r\n\t\t\t\t\tcontinue;\r\n                int y_off=0;\r\n                bool first = false;\r\n                const char activeColor = '\\x07', inactiveColor = '\\x16';\r\n                char color = activeColor;\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->drawTextMap(x,y+y_off,\"%c%s: %d\",color,j->first->getShortName().c_str(),(int)j->second);\r\n                    y_off+=15;\r\n                    color = inactiveColor;\r\n                }\r\n            }\r\n        }\r\n    }\r\n#endif\r\n\r\n#ifdef __DEBUG__\r\n\tclock_t end = clock();\r\n    double duration = (double)(end - start) \/ CLOCKS_PER_SEC;\r\n    if (duration > 0.040) \r\n        Broodwar->printf(\"onFrame() took: %2.5f seconds\\n\", duration);\r\n#endif\r\n}\r\n\r\nvoid BattleBroodAI::onUnitCreate(BWAPI::Unit* unit)\r\n{\r\n\tintelligence->onUnitCreate(unit);\r\n\tmacro->onUnitCreate(unit);\r\n\tmicro->onUnitCreate(unit);\r\n}\r\n\r\nvoid BattleBroodAI::onUnitDestroy(BWAPI::Unit* unit)\r\n{\r\n\tintelligence->onUnitDestroy(unit);\r\n\tmacro->onUnitDestroy(unit);\r\n\tmicro->onUnitDestroy(unit);\r\n}\r\n\r\nvoid BattleBroodAI::onUnitShow(BWAPI::Unit* unit)\r\n{\r\n\tintelligence->onUnitShow(unit);\r\n\tmicro->onUnitShow(unit);\r\n}\r\n\r\nvoid BattleBroodAI::onUnitHide(BWAPI::Unit* unit)\r\n{\r\n\tintelligence->onUnitHide(unit);\r\n}\r\n\r\nvoid BattleBroodAI::onUnitDiscover(BWAPI::Unit* unit)\r\n{\r\n\tmacro->onUnitDiscover(unit);\r\n}\r\n\r\nvoid BattleBroodAI::onUnitEvade(BWAPI::Unit* unit)\r\n{\r\n\tmacro->onUnitEvade(unit);\r\n}\r\n\r\nvoid BattleBroodAI::onUnitMorph(BWAPI::Unit* unit)\r\n{\r\n\tintelligence->onUnitMorph(unit);\r\n\tmacro->onUnitMorph(unit);\r\n}\r\n\r\nvoid BattleBroodAI::onUnitRenegade(BWAPI::Unit* unit)\r\n{\r\n\tintelligence->onUnitRenegade(unit);\r\n\tmacro->onUnitRenegade(unit);\r\n\tmicro->onUnitRenegade(unit);\r\n}\r\n\r\nvoid BattleBroodAI::onPlayerLeft(BWAPI::Player* player)\r\n{\r\n    \/\/Broodwar->sendText(\"%s left the game.\",player->getName().c_str());\r\n}\r\n\r\nvoid BattleBroodAI::onNukeDetect(BWAPI::Position target)\r\n{\r\n\tmicro->onNukeDetect(target);\r\n    if (target!=Positions::Unknown)\r\n    \tBroodwar->printf(\"Nuclear Launch Detected at (%d,%d)\",target.x(),target.y());\r\n    else\r\n    \tBroodwar->printf(\"Nuclear Launch Detected\");\r\n}\r\n\r\nvoid BattleBroodAI::onSendText(std::string text)\r\n{\r\n    if (text==\"\/show players\")\r\n    {\r\n        showPlayers();\r\n        return;\r\n    } else if (text==\"\/show forces\")\r\n    {\r\n        showForces();\r\n        return;\r\n    } else if (text==\"\/show visibility\")\r\n    {\r\n        show_visibility_data=true;\r\n    } else if (text==\"\/analyze\")\r\n    {\r\n        if (analyzed == false)\r\n        {\r\n            \/\/ Broodwar->printf(\"Analyzing map... this may take a minute\");\r\n            CreateThread(NULL, 0, (LPTHREAD_START_ROUTINE)AnalyzeThread, NULL, 0, NULL);\r\n        }\r\n        return;\r\n    }\r\n    else if (text.substr(0,9) == \"\/setspeed\")\r\n    {\r\n        int x = 0;\r\n        if (text[9] != ' ')\r\n            Broodwar->printf(\"Usage: \/setspeed SPEEDVALUE\");\r\n        std::string xx = text.substr(10);\r\n        x = atoi(xx.c_str());\r\n        \/\/  Broodwar->printf(\"Set Speed %i\", x);\r\n        Broodwar->setLocalSpeed(x);\r\n    }\r\n    if (text==\"debug\")\r\n    {\r\n        showManagerAssignments = !showManagerAssignments;\r\n        return;\r\n    }\r\n    \/*if (type!=UnitTypes::Unknown)\r\n    {\r\n\t\tmacro->buildOrderAdd(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\t\t\tmacro->techAdd(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\t\t\t\tmacro->upgradeAdd(type);\r\n            }\r\n            else\r\n                Broodwar->printf(\"You typed '%s'!\",text.c_str());\r\n        }\r\n    }*\/\r\n    return;\r\n}\r\n\r\nvoid BattleBroodAI::onReceiveText(BWAPI::Player* player, std::string text)\r\n{\r\n\treturn;\r\n}\r\n\r\nvoid BattleBroodAI::onSaveGame(std::stringbuf gameName)\r\n{\r\n\treturn;\r\n}\r\n\r\nDWORD WINAPI AnalyzeThread()\r\n{\r\n    BWTA::analyze();\r\n    analyzed   = true;\r\n    analysis_just_finished = true;\r\n\r\n    \/\/self start location only available if the map has base locations\r\n    if (BWTA::getStartLocation(BWAPI::Broodwar->self())!=NULL)\r\n    {\r\n        home = BWTA::getStartLocation(BWAPI::Broodwar->self())->getRegion();\r\n    }\r\n    \/\/enemy start location only available if Complete Map Information is enabled.\r\n    if (BWTA::getStartLocation(BWAPI::Broodwar->enemy())!=NULL)\r\n    {\r\n        enemy_base = BWTA::getStartLocation(BWAPI::Broodwar->enemy())->getRegion();\r\n    }\r\n    return 0;\r\n}\r\n\r\nvoid BattleBroodAI::drawStats()\r\n{\r\n    std::set<Unit*> myUnits = Broodwar->self()->getUnits();\r\n    Broodwar->drawTextScreen(5,0,\"I have %d units:\",myUnits.size());\r\n    std::map<UnitType, int> unitTypeCounts;\r\n    for(std::set<Unit*>::iterator i=myUnits.begin();i!=myUnits.end();i++)\r\n    {\r\n        if (unitTypeCounts.find((*i)->getType())==unitTypeCounts.end())\r\n        {\r\n            unitTypeCounts.insert(std::make_pair((*i)->getType(),0));\r\n        }\r\n        unitTypeCounts.find((*i)->getType())->second++;\r\n    }\r\n    int line=1;\r\n    for(std::map<UnitType,int>::iterator i=unitTypeCounts.begin();i!=unitTypeCounts.end();i++)\r\n    {\r\n        Broodwar->drawTextScreen(5,16*line,\"- %d %ss\",(*i).second, (*i).first.getName().c_str());\r\n        line++;\r\n    }\r\n}\r\n\r\nvoid BattleBroodAI::showPlayers()\r\n{\r\n    std::set<Player*> players=Broodwar->getPlayers();\r\n    for(std::set<Player*>::iterator i=players.begin();i!=players.end();i++)\r\n    {\r\n        \/\/   Broodwar->printf(\"Player [%d]: %s is in force: %s\",(*i)->getID(),(*i)->getName().c_str(), (*i)->getForce()->getName().c_str());\r\n    }\r\n}\r\nvoid BattleBroodAI::showForces()\r\n{\r\n    std::set<Force*> forces=Broodwar->getForces();\r\n    for(std::set<Force*>::iterator i=forces.begin();i!=forces.end();i++)\r\n    {\r\n        std::set<Player*> players=(*i)->getPlayers();\r\n        \/\/  Broodwar->printf(\"Force %s has the following players:\",(*i)->getName().c_str());\r\n        for(std::set<Player*>::iterator j=players.begin();j!=players.end();j++)\r\n        {\r\n            \/\/      Broodwar->printf(\"  - Player [%d]: %s\",(*j)->getID(),(*j)->getName().c_str());\r\n        }\r\n    }\r\n}<|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/cont:$Id$\n\/\/ Author: Fons Rademakers   13\/08\/95\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\/\/ Collection abstract base class. This class describes the base        \/\/\n\/\/ protocol all collection classes have to implement. The ROOT          \/\/\n\/\/ collection classes always store pointers to objects that inherit     \/\/\n\/\/ from TObject. They never adopt the objects. Therefore, it is the     \/\/\n\/\/ user's responsability to take care of deleting the actual objects    \/\/\n\/\/ once they are not needed anymore. In exceptional cases, when the     \/\/\n\/\/ user is 100% sure nothing else is referencing the objects in the     \/\/\n\/\/ collection, one can delete all objects and the collection at the     \/\/\n\/\/ same time using the Delete() function.                               \/\/\n\/\/                                                                      \/\/\n\/\/ Collections can be iterated using an iterator object (see            \/\/\n\/\/ TIterator). Depending on the concrete collection class there may be  \/\/\n\/\/ some additional methods of iterating. See the repective classes.     \/\/\n\/\/                                                                      \/\/\n\/\/ TCollection inherits from TObject since we want to be able to have   \/\/\n\/\/ collections of collections.                                          \/\/\n\/\/                                                                      \/\/\n\/\/ In a later release the collections may become templatized.           \/\/\n\/\/                                                                      \/\/\n\/\/Begin_Html\n\/*\n<img src=\"gif\/tcollection_classtree.gif\">\n*\/\n\/\/End_Html\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"TCollection.h\"\n#include \"Varargs.h\"\n#include \"TClass.h\"\n#include \"TROOT.h\"\n#include \"TBrowser.h\"\n#include \"TObjectTable.h\"\n#include \"TRegexp.h\"\n#include \"TVirtualMutex.h\"\n\nTVirtualMutex *gCollectionMutex = 0;\n\nTCollection   *TCollection::fgCurrentCollection = 0;\nTObjectTable  *TCollection::fgGarbageCollection = 0;\nBool_t         TCollection::fgEmptyingGarbage   = kFALSE;\nInt_t          TCollection::fgGarbageStack      = 0;\n\nClassImp(TCollection)\nClassImp(TIter)\n\n\/\/______________________________________________________________________________\nvoid TCollection::AddAll(const TCollection *col)\n{\n   \/\/ Add all objects from collection col to this collection.\n\n   TIter next(col);\n   TObject *obj;\n\n   while ((obj = next()))\n      Add(obj);\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::AddVector(TObject *va_(obj1), ...)\n{\n   \/\/ Add all arguments to the collection. The list of objects must be\n   \/\/ temrinated by 0, e.g.: l.AddVector(o1, o2, o3, o4, 0);\n\n   va_list ap;\n   va_start(ap, va_(obj1));\n   TObject *obj;\n\n   Add(va_(obj1));\n   while ((obj = va_arg(ap, TObject *)))\n      Add(obj);\n   va_end(ap);\n}\n\n\/\/______________________________________________________________________________\nBool_t TCollection::AssertClass(TClass *cl) const\n{\n   \/\/ Make sure all objects in this collection inherit from class cl.\n\n   TObject *obj;\n   TIter    next(this);\n   Bool_t   error = kFALSE;\n\n   if (!cl) {\n      Error(\"AssertClass\", \"class == 0\");\n      return kTRUE;\n   }\n\n   for (int i = 0; (obj = next()); i++)\n      if (!obj->InheritsFrom(cl)) {\n         Error(\"AssertClass\", \"element %d is not an instance of class %s (%s)\",\n               i, cl->GetName(), obj->ClassName());\n         error = kTRUE;\n      }\n   return error;\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::Browse(TBrowser *b)\n{\n   \/\/ Browse this collection (called by TBrowser).\n   \/\/ If b=0, there is no Browse call TObject::Browse(0) instead.\n   \/\/         This means TObject::Inspect() will be invoked indirectly\n\n   TIter next(this);\n   TObject *obj;\n\n   if (b)\n      while ((obj = next())) b->Add(obj);\n   else\n      TObject::Browse(b);\n}\n\n\/\/______________________________________________________________________________\nInt_t TCollection::Compare(const TObject *obj) const\n{\n   \/\/ Compare two TCollection objects. Returns 0 when equal, -1 when this is\n   \/\/ smaller and +1 when bigger (like strcmp()).\n\n   if (this == obj) return 0;\n   return fName.CompareTo(obj->GetName());\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::Draw(Option_t *option)\n{\n   \/\/ Draw all objects in this collection.\n   \/\/ wildcarding supported, eg option=\"xxx*\" draws only objects\n   \/\/ with names xxx*\n\n   TRegexp re(option,kTRUE);\n   TIter next(this);\n   TObject *object;\n   Int_t nch = (option ? strlen(option) : 0);\n\n   while ((object = next())) {\n      TString s = object->GetName();\n      if (nch && strcmp(option,object->GetName()) && s.Index(re) == kNPOS) continue;\n      object->Draw(option);\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::Dump() const\n{\n   \/\/ Dump all objects in this collection.\n\n   TIter next(this);\n   TObject *object;\n\n   while ((object = next())) {\n      object->Dump();\n   }\n}\n\n\/\/______________________________________________________________________________\nTObject *TCollection::FindObject(const char *name) const\n{\n   \/\/ Find an object in this collection using its name. Requires a sequential\n   \/\/ scan till the object has been found. Returns 0 if object with specified\n   \/\/ name is not found.\n\n   TIter next(this);\n   TObject *obj;\n\n   while ((obj = next()))\n      if (!strcmp(name, obj->GetName())) return obj;\n   return 0;\n}\n\n\/\/______________________________________________________________________________\nTObject *TCollection::operator()(const char *name) const\n{\n  \/\/ Find an object in this collection by name.\n\n   return FindObject(name);\n}\n\n\/\/______________________________________________________________________________\nTObject *TCollection::FindObject(const TObject *obj) const\n{\n   \/\/ Find an object in this collection using the object's IsEqual()\n   \/\/ member function. Requires a sequential scan till the object has\n   \/\/ been found. Returns 0 if object is not found.\n   \/\/ Typically this function is overridden by a more efficient version\n   \/\/ in concrete collection classes (e.g. THashTable).\n\n   TIter next(this);\n   TObject *ob;\n\n   while ((ob = next()))\n      if (ob->IsEqual(obj)) return ob;\n   return 0;\n}\n\n\/\/______________________________________________________________________________\nconst char *TCollection::GetName() const\n{\n  \/\/ Return name of this collection.\n  \/\/ if no name, return the collection class name.\n\n   if (fName.Length() > 0) return fName.Data();\n   return ClassName();\n}\n\n\/\/______________________________________________________________________________\nInt_t TCollection::GrowBy(Int_t delta) const\n{\n  \/\/ Increase the collection's capacity by delta slots.\n\n   if (delta < 0) {\n      Error(\"GrowBy\", \"delta < 0\");\n      delta = Capacity();\n   }\n   return Capacity() + TMath::Range(2, kMaxInt - Capacity(), delta);\n}\n\n\/\/______________________________________________________________________________\nBool_t  TCollection::IsArgNull(const char *where, const TObject *obj) const\n{\n   \/\/ Returns true if object is a null pointer.\n\n   return obj ? kFALSE : (Error(where, \"argument is a null pointer\"), kTRUE);\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::ls(Option_t *option) const\n{\n   \/\/ List (ls) all objects in this collection.\n   \/\/ Wildcarding supported, eg option=\"xxx*\" lists only objects\n   \/\/ with names xxx*.\n\n   TRegexp re(option,kTRUE);\n   TIter next(this);\n   TObject *object;\n   char *star = 0;\n   if (option) star = (char*)strchr(option,'*');\n\n   while ((object = next())) {\n      if (star) {\n         TString s = object->GetName();\n         if (s != option && s.Index(re) == kNPOS) continue;\n      }\n      object->ls(option);\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::Paint(Option_t *option)\n{\n   \/\/ Paint all objects in this collection.\n\n   this->R__FOR_EACH(TObject,Paint)(option);\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::Print(Option_t *wildcard) const\n{\n   \/\/ Print all objects in this collection.\n   \/\/ Wildcarding is supported, e.g. wildcard=\"xxx*\" prints only objects\n   \/\/ with names matching xxx*.\n\n   if (!wildcard) wildcard = \"\";\n   TRegexp re(wildcard, kTRUE);\n   Int_t nch = strlen(wildcard);\n   TIter next(this);\n   TObject *object;\n\n   while ((object = next())) {\n      TString s = object->GetName();\n      if (nch && s != wildcard && s.Index(re) == kNPOS) continue;\n      object->Print();\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::Print(Option_t *wildcard, Option_t *option) const\n{\n   \/\/ Print all objects in this collection, passing option to the\n   \/\/ objects Print() method.\n   \/\/ Wildcarding is supported, e.g. wildcard=\"xxx*\" prints only objects\n   \/\/ with names matching xxx*.\n\n   if (!wildcard) wildcard = \"\";\n   TRegexp re(wildcard, kTRUE);\n   Int_t nch = strlen(wildcard);\n   TIter next(this);\n   TObject *object;\n\n   while ((object = next())) {\n      TString s = object->GetName();\n      if (nch && s != wildcard && s.Index(re) == kNPOS) continue;\n      object->Print(option);\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::RecursiveRemove(TObject *obj)\n{\n   \/\/ Remove object from this collection and recursively remove the object\n   \/\/ from all other objects (and collections).\n\n   if (!obj) return;\n\n   \/\/ Scan list and remove obj in the list itself\n   while (Remove(obj))\n      ;\n\n   \/\/ Scan again the list and invoke RecursiveRemove for all objects\n   TIter next(this);\n   TObject *object;\n\n   while ((object = next())) {\n      if (object->TestBit(kNotDeleted)) object->RecursiveRemove(obj);\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::RemoveAll(TCollection *col)\n{\n   \/\/ Remove all objects in collection col from this collection.\n\n   TIter next(col);\n   TObject *obj;\n\n   while ((obj = next()))\n      Remove(obj);\n}\n\n\/\/_______________________________________________________________________\nvoid TCollection::Streamer(TBuffer &b)\n{\n   \/\/ Stream all objects in the collection to or from the I\/O buffer.\n\n   Int_t nobjects;\n   TObject *obj;\n   UInt_t R__s, R__c;\n\n   if (b.IsReading()) {\n      Version_t v = b.ReadVersion(&R__s, &R__c);\n      if (v > 2)\n         TObject::Streamer(b);\n      if (v > 1)\n         fName.Streamer(b);\n      b >> nobjects;\n      for (Int_t i = 0; i < nobjects; i++) {\n         b >> obj;\n         Add(obj);\n      }\n      b.CheckByteCount(R__s, R__c,TCollection::IsA());\n   } else {\n      R__c = b.WriteVersion(TCollection::IsA(), kTRUE);\n      TObject::Streamer(b);\n      fName.Streamer(b);\n      nobjects = GetSize();\n      b << nobjects;\n\n      TIter next(this);\n\n      while ((obj = next())) {\n         b << obj;\n      }\n      b.SetByteCount(R__c, kTRUE);\n   }\n}\n\n\/\/______________________________________________________________________________\nInt_t TCollection::Write(const char *name, Int_t option, Int_t bsize) const\n{\n   \/\/ Write all objects in this collection. By default all objects in\n   \/\/ the collection are written individually (each object gets its\n   \/\/ own key). Note, this is recursive, i.e. objects in collections\n   \/\/ in the collection are also written individually. To write all\n   \/\/ objects using a single key specify a name and set option to\n   \/\/ TObject::kSingleKey (i.e. 1).\n\n   if ((option & kSingleKey)) {\n      return TObject::Write(name, option, bsize);\n   } else {\n      option &= ~kSingleKey;\n      Int_t nbytes = 0;\n      TIter next(this);\n      TObject *obj;\n      while ((obj = next())) {\n         nbytes += obj->Write(name, option, bsize);\n      }\n      return nbytes;\n   }\n}\n\n\/\/______________________________________________________________________________\nInt_t TCollection::Write(const char *name, Int_t option, Int_t bsize)\n{\n   \/\/ Write all objects in this collection. By default all objects in\n   \/\/ the collection are written individually (each object gets its\n   \/\/ own key). Note, this is recursive, i.e. objects in collections\n   \/\/ in the collection are also written individually. To write all\n   \/\/ objects using a single key specify a name and set option to\n   \/\/ TObject::kSingleKey (i.e. 1).\n\n   return ((const TCollection*)this)->Write(name,option,bsize);\n}\n\n\/\/ -------------------- Static data members access -----------------------------\n\/\/______________________________________________________________________________\nTCollection *TCollection::GetCurrentCollection()\n{\n   \/\/ Return the globally accessible collection.\n\n   return fgCurrentCollection;\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::SetCurrentCollection()\n{\n   \/\/ Set this collection to be the globally accesible collection.\n\n   fgCurrentCollection = this;\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::StartGarbageCollection()\n{\n   \/\/ Set up for garbage collection.\n\n   R__LOCKGUARD2(gCollectionMutex);\n   if (!fgGarbageCollection) {\n      fgGarbageCollection = new TObjectTable;\n      fgEmptyingGarbage   = kFALSE;\n      fgGarbageStack      = 0;\n   }\n   fgGarbageStack++;\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::EmptyGarbageCollection()\n{\n   \/\/ Do the garbage collection.\n\n   R__LOCKGUARD2(gCollectionMutex);\n   if (fgGarbageStack > 0) fgGarbageStack--;\n   if (fgGarbageCollection && fgGarbageStack == 0 && fgEmptyingGarbage == kFALSE) {\n      fgEmptyingGarbage = kTRUE;\n      fgGarbageCollection->Delete();\n      fgEmptyingGarbage = kFALSE;\n      SafeDelete(fgGarbageCollection);\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::GarbageCollect(TObject *obj)\n{\n   \/\/ Add to the list of things to be cleaned up.\n\n   R__LOCKGUARD2(gCollectionMutex);\n   if (fgGarbageCollection) {\n      if (!fgEmptyingGarbage) {\n         fgGarbageCollection->Add(obj);\n      } else\n         delete obj;\n   } else\n      delete obj;\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::SetOwner(Bool_t enable)\n{\n   \/\/ Set whether this collection is the owner (enable==true)\n   \/\/ of its content.  If it is the owner of its contents,\n   \/\/ these objects will be deleted whenever the collection itself\n   \/\/ is delete.   The objects might also be deleted or destructed when Clear\n   \/\/ is called (depending on the collection).\n\n   if (enable)\n      SetBit(kIsOwner);\n   else\n      ResetBit(kIsOwner);\n}\n\n\/\/______________________________________________________________________________\nTIter::TIter(const TIter &iter)\n{\n   \/\/ Copy a TIter. This involves allocating a new TIterator of the right\n   \/\/ sub class and assigning it with the original.\n\n   if (iter.fIterator) {\n      fIterator = iter.GetCollection()->MakeIterator();\n      fIterator->operator=(*iter.fIterator);\n   } else\n      fIterator = 0;\n}\n\n\/\/______________________________________________________________________________\nTIter &TIter::operator=(const TIter &rhs)\n{\n   \/\/ Assigning an TIter to another. This involves allocatiing a new TIterator\n   \/\/ of the right sub class and assigning it with the original.\n\n   if (this != &rhs) {\n      if (rhs.fIterator) {\n         delete fIterator;\n         fIterator = rhs.GetCollection()->MakeIterator();\n         fIterator->operator=(*rhs.fIterator);\n      }\n   }\n   return *this;\n}\n<commit_msg>From Matevz: I put the self-printing and indent control to TCollection::ls().<commit_after>\/\/ @(#)root\/cont:$Id$\n\/\/ Author: Fons Rademakers   13\/08\/95\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\/\/ Collection abstract base class. This class describes the base        \/\/\n\/\/ protocol all collection classes have to implement. The ROOT          \/\/\n\/\/ collection classes always store pointers to objects that inherit     \/\/\n\/\/ from TObject. They never adopt the objects. Therefore, it is the     \/\/\n\/\/ user's responsability to take care of deleting the actual objects    \/\/\n\/\/ once they are not needed anymore. In exceptional cases, when the     \/\/\n\/\/ user is 100% sure nothing else is referencing the objects in the     \/\/\n\/\/ collection, one can delete all objects and the collection at the     \/\/\n\/\/ same time using the Delete() function.                               \/\/\n\/\/                                                                      \/\/\n\/\/ Collections can be iterated using an iterator object (see            \/\/\n\/\/ TIterator). Depending on the concrete collection class there may be  \/\/\n\/\/ some additional methods of iterating. See the repective classes.     \/\/\n\/\/                                                                      \/\/\n\/\/ TCollection inherits from TObject since we want to be able to have   \/\/\n\/\/ collections of collections.                                          \/\/\n\/\/                                                                      \/\/\n\/\/ In a later release the collections may become templatized.           \/\/\n\/\/                                                                      \/\/\n\/\/Begin_Html\n\/*\n<img src=\"gif\/tcollection_classtree.gif\">\n*\/\n\/\/End_Html\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"TCollection.h\"\n#include \"Varargs.h\"\n#include \"TClass.h\"\n#include \"TROOT.h\"\n#include \"TBrowser.h\"\n#include \"TObjectTable.h\"\n#include \"TRegexp.h\"\n#include \"TVirtualMutex.h\"\n\nTVirtualMutex *gCollectionMutex = 0;\n\nTCollection   *TCollection::fgCurrentCollection = 0;\nTObjectTable  *TCollection::fgGarbageCollection = 0;\nBool_t         TCollection::fgEmptyingGarbage   = kFALSE;\nInt_t          TCollection::fgGarbageStack      = 0;\n\nClassImp(TCollection)\nClassImp(TIter)\n\n\/\/______________________________________________________________________________\nvoid TCollection::AddAll(const TCollection *col)\n{\n   \/\/ Add all objects from collection col to this collection.\n\n   TIter next(col);\n   TObject *obj;\n\n   while ((obj = next()))\n      Add(obj);\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::AddVector(TObject *va_(obj1), ...)\n{\n   \/\/ Add all arguments to the collection. The list of objects must be\n   \/\/ temrinated by 0, e.g.: l.AddVector(o1, o2, o3, o4, 0);\n\n   va_list ap;\n   va_start(ap, va_(obj1));\n   TObject *obj;\n\n   Add(va_(obj1));\n   while ((obj = va_arg(ap, TObject *)))\n      Add(obj);\n   va_end(ap);\n}\n\n\/\/______________________________________________________________________________\nBool_t TCollection::AssertClass(TClass *cl) const\n{\n   \/\/ Make sure all objects in this collection inherit from class cl.\n\n   TObject *obj;\n   TIter    next(this);\n   Bool_t   error = kFALSE;\n\n   if (!cl) {\n      Error(\"AssertClass\", \"class == 0\");\n      return kTRUE;\n   }\n\n   for (int i = 0; (obj = next()); i++)\n      if (!obj->InheritsFrom(cl)) {\n         Error(\"AssertClass\", \"element %d is not an instance of class %s (%s)\",\n               i, cl->GetName(), obj->ClassName());\n         error = kTRUE;\n      }\n   return error;\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::Browse(TBrowser *b)\n{\n   \/\/ Browse this collection (called by TBrowser).\n   \/\/ If b=0, there is no Browse call TObject::Browse(0) instead.\n   \/\/         This means TObject::Inspect() will be invoked indirectly\n\n   TIter next(this);\n   TObject *obj;\n\n   if (b)\n      while ((obj = next())) b->Add(obj);\n   else\n      TObject::Browse(b);\n}\n\n\/\/______________________________________________________________________________\nInt_t TCollection::Compare(const TObject *obj) const\n{\n   \/\/ Compare two TCollection objects. Returns 0 when equal, -1 when this is\n   \/\/ smaller and +1 when bigger (like strcmp()).\n\n   if (this == obj) return 0;\n   return fName.CompareTo(obj->GetName());\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::Draw(Option_t *option)\n{\n   \/\/ Draw all objects in this collection.\n   \/\/ wildcarding supported, eg option=\"xxx*\" draws only objects\n   \/\/ with names xxx*\n\n   TRegexp re(option,kTRUE);\n   TIter next(this);\n   TObject *object;\n   Int_t nch = (option ? strlen(option) : 0);\n\n   while ((object = next())) {\n      TString s = object->GetName();\n      if (nch && strcmp(option,object->GetName()) && s.Index(re) == kNPOS) continue;\n      object->Draw(option);\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::Dump() const\n{\n   \/\/ Dump all objects in this collection.\n\n   TIter next(this);\n   TObject *object;\n\n   while ((object = next())) {\n      object->Dump();\n   }\n}\n\n\/\/______________________________________________________________________________\nTObject *TCollection::FindObject(const char *name) const\n{\n   \/\/ Find an object in this collection using its name. Requires a sequential\n   \/\/ scan till the object has been found. Returns 0 if object with specified\n   \/\/ name is not found.\n\n   TIter next(this);\n   TObject *obj;\n\n   while ((obj = next()))\n      if (!strcmp(name, obj->GetName())) return obj;\n   return 0;\n}\n\n\/\/______________________________________________________________________________\nTObject *TCollection::operator()(const char *name) const\n{\n  \/\/ Find an object in this collection by name.\n\n   return FindObject(name);\n}\n\n\/\/______________________________________________________________________________\nTObject *TCollection::FindObject(const TObject *obj) const\n{\n   \/\/ Find an object in this collection using the object's IsEqual()\n   \/\/ member function. Requires a sequential scan till the object has\n   \/\/ been found. Returns 0 if object is not found.\n   \/\/ Typically this function is overridden by a more efficient version\n   \/\/ in concrete collection classes (e.g. THashTable).\n\n   TIter next(this);\n   TObject *ob;\n\n   while ((ob = next()))\n      if (ob->IsEqual(obj)) return ob;\n   return 0;\n}\n\n\/\/______________________________________________________________________________\nconst char *TCollection::GetName() const\n{\n  \/\/ Return name of this collection.\n  \/\/ if no name, return the collection class name.\n\n   if (fName.Length() > 0) return fName.Data();\n   return ClassName();\n}\n\n\/\/______________________________________________________________________________\nInt_t TCollection::GrowBy(Int_t delta) const\n{\n  \/\/ Increase the collection's capacity by delta slots.\n\n   if (delta < 0) {\n      Error(\"GrowBy\", \"delta < 0\");\n      delta = Capacity();\n   }\n   return Capacity() + TMath::Range(2, kMaxInt - Capacity(), delta);\n}\n\n\/\/______________________________________________________________________________\nBool_t  TCollection::IsArgNull(const char *where, const TObject *obj) const\n{\n   \/\/ Returns true if object is a null pointer.\n\n   return obj ? kFALSE : (Error(where, \"argument is a null pointer\"), kTRUE);\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::ls(Option_t *option) const\n{\n   \/\/ List (ls) all objects in this collection.\n   \/\/ Wildcarding supported, eg option=\"xxx*\" lists only objects\n   \/\/ with names xxx*.\n\n   TObject::ls(option);\n\n   TRegexp re(option,kTRUE);\n   TIter next(this);\n   TObject *object;\n   char *star = 0;\n   if (option) star = (char*)strchr(option,'*');\n\n   TROOT::IncreaseDirLevel();\n   while ((object = next())) {\n      if (star) {\n         TString s = object->GetName();\n         if (s != option && s.Index(re) == kNPOS) continue;\n      }\n      object->ls(option);\n   }\n   TROOT::DecreaseDirLevel();\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::Paint(Option_t *option)\n{\n   \/\/ Paint all objects in this collection.\n\n   this->R__FOR_EACH(TObject,Paint)(option);\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::Print(Option_t *wildcard) const\n{\n   \/\/ Print all objects in this collection.\n   \/\/ Wildcarding is supported, e.g. wildcard=\"xxx*\" prints only objects\n   \/\/ with names matching xxx*.\n\n   TObject::Print(wildcard);\n\n   if (!wildcard) wildcard = \"\";\n   TRegexp re(wildcard, kTRUE);\n   Int_t nch = strlen(wildcard);\n   TIter next(this);\n   TObject *object;\n\n   while ((object = next())) {\n      TString s = object->GetName();\n      if (nch && s != wildcard && s.Index(re) == kNPOS) continue;\n      object->Print(wildcard);\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::Print(Option_t *wildcard, Option_t *option) const\n{\n   \/\/ Print all objects in this collection, passing option to the\n   \/\/ objects Print() method.\n   \/\/ Wildcarding is supported, e.g. wildcard=\"xxx*\" prints only objects\n   \/\/ with names matching xxx*.\n\n   if (!wildcard) wildcard = \"\";\n   TRegexp re(wildcard, kTRUE);\n   Int_t nch = strlen(wildcard);\n   TIter next(this);\n   TObject *object;\n\n   while ((object = next())) {\n      TString s = object->GetName();\n      if (nch && s != wildcard && s.Index(re) == kNPOS) continue;\n      object->Print(option);\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::RecursiveRemove(TObject *obj)\n{\n   \/\/ Remove object from this collection and recursively remove the object\n   \/\/ from all other objects (and collections).\n\n   if (!obj) return;\n\n   \/\/ Scan list and remove obj in the list itself\n   while (Remove(obj))\n      ;\n\n   \/\/ Scan again the list and invoke RecursiveRemove for all objects\n   TIter next(this);\n   TObject *object;\n\n   while ((object = next())) {\n      if (object->TestBit(kNotDeleted)) object->RecursiveRemove(obj);\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::RemoveAll(TCollection *col)\n{\n   \/\/ Remove all objects in collection col from this collection.\n\n   TIter next(col);\n   TObject *obj;\n\n   while ((obj = next()))\n      Remove(obj);\n}\n\n\/\/_______________________________________________________________________\nvoid TCollection::Streamer(TBuffer &b)\n{\n   \/\/ Stream all objects in the collection to or from the I\/O buffer.\n\n   Int_t nobjects;\n   TObject *obj;\n   UInt_t R__s, R__c;\n\n   if (b.IsReading()) {\n      Version_t v = b.ReadVersion(&R__s, &R__c);\n      if (v > 2)\n         TObject::Streamer(b);\n      if (v > 1)\n         fName.Streamer(b);\n      b >> nobjects;\n      for (Int_t i = 0; i < nobjects; i++) {\n         b >> obj;\n         Add(obj);\n      }\n      b.CheckByteCount(R__s, R__c,TCollection::IsA());\n   } else {\n      R__c = b.WriteVersion(TCollection::IsA(), kTRUE);\n      TObject::Streamer(b);\n      fName.Streamer(b);\n      nobjects = GetSize();\n      b << nobjects;\n\n      TIter next(this);\n\n      while ((obj = next())) {\n         b << obj;\n      }\n      b.SetByteCount(R__c, kTRUE);\n   }\n}\n\n\/\/______________________________________________________________________________\nInt_t TCollection::Write(const char *name, Int_t option, Int_t bsize) const\n{\n   \/\/ Write all objects in this collection. By default all objects in\n   \/\/ the collection are written individually (each object gets its\n   \/\/ own key). Note, this is recursive, i.e. objects in collections\n   \/\/ in the collection are also written individually. To write all\n   \/\/ objects using a single key specify a name and set option to\n   \/\/ TObject::kSingleKey (i.e. 1).\n\n   if ((option & kSingleKey)) {\n      return TObject::Write(name, option, bsize);\n   } else {\n      option &= ~kSingleKey;\n      Int_t nbytes = 0;\n      TIter next(this);\n      TObject *obj;\n      while ((obj = next())) {\n         nbytes += obj->Write(name, option, bsize);\n      }\n      return nbytes;\n   }\n}\n\n\/\/______________________________________________________________________________\nInt_t TCollection::Write(const char *name, Int_t option, Int_t bsize)\n{\n   \/\/ Write all objects in this collection. By default all objects in\n   \/\/ the collection are written individually (each object gets its\n   \/\/ own key). Note, this is recursive, i.e. objects in collections\n   \/\/ in the collection are also written individually. To write all\n   \/\/ objects using a single key specify a name and set option to\n   \/\/ TObject::kSingleKey (i.e. 1).\n\n   return ((const TCollection*)this)->Write(name,option,bsize);\n}\n\n\/\/ -------------------- Static data members access -----------------------------\n\/\/______________________________________________________________________________\nTCollection *TCollection::GetCurrentCollection()\n{\n   \/\/ Return the globally accessible collection.\n\n   return fgCurrentCollection;\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::SetCurrentCollection()\n{\n   \/\/ Set this collection to be the globally accesible collection.\n\n   fgCurrentCollection = this;\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::StartGarbageCollection()\n{\n   \/\/ Set up for garbage collection.\n\n   R__LOCKGUARD2(gCollectionMutex);\n   if (!fgGarbageCollection) {\n      fgGarbageCollection = new TObjectTable;\n      fgEmptyingGarbage   = kFALSE;\n      fgGarbageStack      = 0;\n   }\n   fgGarbageStack++;\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::EmptyGarbageCollection()\n{\n   \/\/ Do the garbage collection.\n\n   R__LOCKGUARD2(gCollectionMutex);\n   if (fgGarbageStack > 0) fgGarbageStack--;\n   if (fgGarbageCollection && fgGarbageStack == 0 && fgEmptyingGarbage == kFALSE) {\n      fgEmptyingGarbage = kTRUE;\n      fgGarbageCollection->Delete();\n      fgEmptyingGarbage = kFALSE;\n      SafeDelete(fgGarbageCollection);\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::GarbageCollect(TObject *obj)\n{\n   \/\/ Add to the list of things to be cleaned up.\n\n   R__LOCKGUARD2(gCollectionMutex);\n   if (fgGarbageCollection) {\n      if (!fgEmptyingGarbage) {\n         fgGarbageCollection->Add(obj);\n      } else\n         delete obj;\n   } else\n      delete obj;\n}\n\n\/\/______________________________________________________________________________\nvoid TCollection::SetOwner(Bool_t enable)\n{\n   \/\/ Set whether this collection is the owner (enable==true)\n   \/\/ of its content.  If it is the owner of its contents,\n   \/\/ these objects will be deleted whenever the collection itself\n   \/\/ is delete.   The objects might also be deleted or destructed when Clear\n   \/\/ is called (depending on the collection).\n\n   if (enable)\n      SetBit(kIsOwner);\n   else\n      ResetBit(kIsOwner);\n}\n\n\/\/______________________________________________________________________________\nTIter::TIter(const TIter &iter)\n{\n   \/\/ Copy a TIter. This involves allocating a new TIterator of the right\n   \/\/ sub class and assigning it with the original.\n\n   if (iter.fIterator) {\n      fIterator = iter.GetCollection()->MakeIterator();\n      fIterator->operator=(*iter.fIterator);\n   } else\n      fIterator = 0;\n}\n\n\/\/______________________________________________________________________________\nTIter &TIter::operator=(const TIter &rhs)\n{\n   \/\/ Assigning an TIter to another. This involves allocatiing a new TIterator\n   \/\/ of the right sub class and assigning it with the original.\n\n   if (this != &rhs) {\n      if (rhs.fIterator) {\n         delete fIterator;\n         fIterator = rhs.GetCollection()->MakeIterator();\n         fIterator->operator=(*rhs.fIterator);\n      }\n   }\n   return *this;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2017 Sony 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#ifndef __NBLA_COMPUTATION_GRAPH_HPP__\n#define __NBLA_COMPUTATION_GRAPH_HPP__\n\n#include <nbla\/computation_graph\/function.hpp>\n#include <nbla\/computation_graph\/variable.hpp>\n#include <nbla\/nd_array.hpp>\n\nnamespace nbla {\n\n\/** Create CgVariable outputs.\n\n    Created CGVariables are held as weak_ptr by cg_f. The `need_grad`\n    flags are automatically applied to created outputs.\n\n*\/\nNBLA_API vector<CgVariablePtr> create_function_outputs(CgFunctionPtr cg_f,\n                                                       int n_outputs = -1);\n\n\/** Connect function to network.\n\n    Create outputs on-demand.\n *\/\nNBLA_API vector<CgVariablePtr> connect(CgFunctionPtr cg_f,\n                                       const vector<CgVariablePtr> &inputs,\n                                       int n_outputs = 1,\n                                       vector<NdArrayPtr> inplace_outputs = {},\n                                       bool execute = false);\n\n\/** Steal some variable properties from `from` CgVariable to `to` in order to\n   rewire previously constructed graphs.\n\n    It takes parent, need_grad flags, inplace flags, and the variable contents.\n\n    @param[in] from Its parent function is stolen by 'to'.\n    @param[in,out] to A variable 'from''s parent stolen to.\n*\/\nNBLA_API void steal_variable_from_to(CgVariablePtr from, CgVariablePtr to);\n\n\/** Forward given variables in single inference\n * Forward all given variables with shared fclosed flags.\n *\/\nNBLA_API void forward_all(const vector<CgVariablePtr> variables,\n                          bool clear_buffer = false,\n                          bool clear_no_need_grad = false);\n}\n#endif\n<commit_msg>Remove clear_buffer flag from forward_all header<commit_after>\/\/ Copyright (c) 2017 Sony 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#ifndef __NBLA_COMPUTATION_GRAPH_HPP__\n#define __NBLA_COMPUTATION_GRAPH_HPP__\n\n#include <nbla\/computation_graph\/function.hpp>\n#include <nbla\/computation_graph\/variable.hpp>\n#include <nbla\/nd_array.hpp>\n\nnamespace nbla {\n\n\/** Create CgVariable outputs.\n\n    Created CGVariables are held as weak_ptr by cg_f. The `need_grad`\n    flags are automatically applied to created outputs.\n\n*\/\nNBLA_API vector<CgVariablePtr> create_function_outputs(CgFunctionPtr cg_f,\n                                                       int n_outputs = -1);\n\n\/** Connect function to network.\n\n    Create outputs on-demand.\n *\/\nNBLA_API vector<CgVariablePtr> connect(CgFunctionPtr cg_f,\n                                       const vector<CgVariablePtr> &inputs,\n                                       int n_outputs = 1,\n                                       vector<NdArrayPtr> inplace_outputs = {},\n                                       bool execute = false);\n\n\/** Steal some variable properties from `from` CgVariable to `to` in order to\n   rewire previously constructed graphs.\n\n    It takes parent, need_grad flags, inplace flags, and the variable contents.\n\n    @param[in] from Its parent function is stolen by 'to'.\n    @param[in,out] to A variable 'from''s parent stolen to.\n*\/\nNBLA_API void steal_variable_from_to(CgVariablePtr from, CgVariablePtr to);\n\n\/** Forward given variables in single inference\n * Forward all given variables with shared fclosed flags.\n *\/\nNBLA_API void forward_all(const vector<CgVariablePtr> variables,\n                          bool clear_no_need_grad = false);\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- Printer.cpp - Code for printing data structure graphs nicely -------===\/\/\n\/\/\n\/\/ This file implements the 'dot' graph printer.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Analysis\/DataStructure.h\"\n#include \"llvm\/Analysis\/DSGraph.h\"\n#include \"llvm\/Analysis\/DSGraphTraits.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/Constants.h\"\n#include \"llvm\/Assembly\/Writer.h\"\n#include \"Support\/CommandLine.h\"\n#include \"Support\/GraphWriter.h\"\n#include \"Support\/Statistic.h\"\n#include <fstream>\n#include <sstream>\n\n\/\/ OnlyPrintMain - The DataStructure printer exposes this option to allow\n\/\/ printing of only the graph for \"main\".\n\/\/\nnamespace {\n  cl::opt<bool> OnlyPrintMain(\"only-print-main-ds\", cl::ReallyHidden);\n  Statistic<> MaxGraphSize   (\"dsnode\", \"Maximum graph size\");\n  Statistic<> NumFoldedNodes (\"dsnode\", \"Number of folded nodes (in final graph)\");\n}\n\n\nvoid DSNode::dump() const { print(std::cerr, 0); }\n\nstatic std::string getCaption(const DSNode *N, const DSGraph *G) {\n  std::stringstream OS;\n  Module *M = 0;\n  \/\/ Get the module from ONE of the functions in the graph it is available.\n  if (G && !G->getReturnNodes().empty())\n    M = G->getReturnNodes().begin()->first->getParent();\n\n  if (N->isNodeCompletelyFolded())\n    OS << \"FOLDED\";\n  else {\n    WriteTypeSymbolic(OS, N->getType(), M);\n    if (N->isArray())\n      OS << \" array\";\n  }\n  if (unsigned NodeType = N->getNodeFlags()) {\n    OS << \": \";\n    if (NodeType & DSNode::AllocaNode ) OS << \"S\";\n    if (NodeType & DSNode::HeapNode   ) OS << \"H\";\n    if (NodeType & DSNode::GlobalNode ) OS << \"G\";\n    if (NodeType & DSNode::UnknownNode) OS << \"U\";\n    if (NodeType & DSNode::Incomplete ) OS << \"I\";\n    if (NodeType & DSNode::Modified   ) OS << \"M\";\n    if (NodeType & DSNode::Read       ) OS << \"R\";\n#ifndef NDEBUG\n    if (NodeType & DSNode::DEAD       ) OS << \"<dead>\";\n#endif\n    OS << \"\\n\";\n  }\n\n  for (unsigned i = 0, e = N->getGlobals().size(); i != e; ++i) {\n    WriteAsOperand(OS, N->getGlobals()[i], false, true, M);\n    OS << \"\\n\";\n  }\n\n  return OS.str();\n}\n\ntemplate<>\nstruct DOTGraphTraits<const DSGraph*> : public DefaultDOTGraphTraits {\n  static std::string getGraphName(const DSGraph *G) {\n    switch (G->getReturnNodes().size()) {\n    case 0: return G->getFunctionNames();\n    case 1: return \"Function \" + G->getFunctionNames();\n    default: return \"Functions: \" + G->getFunctionNames();\n    }\n  }\n\n  static const char *getGraphProperties(const DSGraph *G) {\n    return \"\\tsize=\\\"10,7.5\\\";\\n\"\n           \"\\trotate=\\\"90\\\";\\n\";\n  }\n\n  static std::string getNodeLabel(const DSNode *Node, const DSGraph *Graph) {\n    return getCaption(Node, Graph);\n  }\n\n  static std::string getNodeAttributes(const DSNode *N) {\n    return \"shape=Mrecord\";\/\/fontname=Courier\";\n  }\n  \n  \/\/\/ addCustomGraphFeatures - Use this graph writing hook to emit call nodes\n  \/\/\/ and the return node.\n  \/\/\/\n  static void addCustomGraphFeatures(const DSGraph *G,\n                                     GraphWriter<const DSGraph*> &GW) {\n    Module *CurMod = 0;\n    if (!G->getReturnNodes().empty())\n      CurMod = G->getReturnNodes().begin()->first->getParent();\n\n    \/\/ Add scalar nodes to the graph...\n    const DSGraph::ScalarMapTy &VM = G->getScalarMap();\n    for (DSGraph::ScalarMapTy::const_iterator I = VM.begin(); I != VM.end();++I)\n      if (!isa<GlobalValue>(I->first) && !isa<ConstantPointerRef>(I->first)) {\n        std::stringstream OS;\n        WriteAsOperand(OS, I->first, false, true, CurMod);\n        GW.emitSimpleNode(I->first, \"\", OS.str());\n        \n        \/\/ Add edge from return node to real destination\n        int EdgeDest = I->second.getOffset() >> DS::PointerShift;\n        if (EdgeDest == 0) EdgeDest = -1;\n        GW.emitEdge(I->first, -1, I->second.getNode(),\n                    EdgeDest, \"arrowtail=tee,color=gray63\");\n      }\n\n\n    \/\/ Output the returned value pointer...\n    const DSGraph::ReturnNodesTy &RetNodes = G->getReturnNodes();\n    for (DSGraph::ReturnNodesTy::const_iterator I = RetNodes.begin(),\n           E = RetNodes.end(); I != E; ++I)\n      if (I->second.getNode()) {\n        std::string Label;\n        if (RetNodes.size() == 1)\n          Label = \"returning\";\n        else\n          Label = I->first->getName() + \" ret node\";\n        \/\/ Output the return node...\n        GW.emitSimpleNode((void*)1, \"plaintext=circle\", Label);\n\n        \/\/ Add edge from return node to real destination\n        int RetEdgeDest = I->second.getOffset() >> DS::PointerShift;;\n        if (RetEdgeDest == 0) RetEdgeDest = -1;\n        GW.emitEdge((void*)1, -1, I->second.getNode(),\n                    RetEdgeDest, \"arrowtail=tee,color=gray63\");\n      }\n\n    \/\/ Output all of the call nodes...\n    const std::vector<DSCallSite> &FCs =\n      G->shouldPrintAuxCalls() ? G->getAuxFunctionCalls()\n      : G->getFunctionCalls();\n    for (unsigned i = 0, e = FCs.size(); i != e; ++i) {\n      const DSCallSite &Call = FCs[i];\n      std::vector<std::string> EdgeSourceCaptions(Call.getNumPtrArgs()+2);\n      EdgeSourceCaptions[0] = \"r\";\n      if (Call.isDirectCall())\n        EdgeSourceCaptions[1] = Call.getCalleeFunc()->getName();\n      else\n        EdgeSourceCaptions[1] = \"f\";\n\n      GW.emitSimpleNode(&Call, \"shape=record\", \"call\", Call.getNumPtrArgs()+2,\n                        &EdgeSourceCaptions);\n\n      if (DSNode *N = Call.getRetVal().getNode()) {\n        int EdgeDest = Call.getRetVal().getOffset() >> DS::PointerShift;\n        if (EdgeDest == 0) EdgeDest = -1;\n        GW.emitEdge(&Call, 0, N, EdgeDest, \"color=gray63,tailclip=false\");\n      }\n\n      \/\/ Print out the callee...\n      if (Call.isIndirectCall()) {\n        DSNode *N = Call.getCalleeNode();\n        assert(N && \"Null call site callee node!\");\n        GW.emitEdge(&Call, 1, N, -1, \"color=gray63,tailclip=false\");\n      }\n\n      for (unsigned j = 0, e = Call.getNumPtrArgs(); j != e; ++j)\n        if (DSNode *N = Call.getPtrArg(j).getNode()) {\n          int EdgeDest = Call.getPtrArg(j).getOffset() >> DS::PointerShift;\n          if (EdgeDest == 0) EdgeDest = -1;\n          GW.emitEdge(&Call, j+2, N, EdgeDest, \"color=gray63,tailclip=false\");\n        }\n    }\n  }\n};\n\nvoid DSNode::print(std::ostream &O, const DSGraph *G) const {\n  GraphWriter<const DSGraph *> W(O, G);\n  W.writeNode(this);\n}\n\nvoid DSGraph::print(std::ostream &O) const {\n  WriteGraph(O, this, \"DataStructures\");\n}\n\nvoid DSGraph::writeGraphToFile(std::ostream &O,\n                               const std::string &GraphName) const {\n  std::string Filename = GraphName + \".dot\";\n  O << \"Writing '\" << Filename << \"'...\";\n  std::ofstream F(Filename.c_str());\n  \n  if (F.good()) {\n    print(F);\n    unsigned NumCalls = shouldPrintAuxCalls() ?\n      getAuxFunctionCalls().size() : getFunctionCalls().size();\n    O << \" [\" << getGraphSize() << \"+\" << NumCalls << \"]\\n\";\n  } else {\n    O << \"  error opening file for writing!\\n\";\n  }\n}\n\n\/\/\/ viewGraph - Emit a dot graph, run 'dot', run gv on the postscript file,\n\/\/\/ then cleanup.  For use from the debugger.\n\/\/\/\nvoid DSGraph::viewGraph() const {\n  std::ofstream F(\"\/tmp\/tempgraph.dot\");\n  if (!F.good()) {\n    std::cerr << \"Error opening '\/tmp\/tempgraph.dot' for temporary graph!\\n\";\n    return;\n  }\n  print(F);\n  F.close();\n  if (system(\"dot -Tps \/tmp\/tempgraph.dot > \/tmp\/tempgraph.ps\"))\n    std::cerr << \"Error running dot: 'dot' not in path?\\n\";\n  system(\"gv \/tmp\/tempgraph.ps\");\n  system(\"rm \/tmp\/tempgraph.dot \/tmp\/tempgraph.ps\");\n}\n\n\ntemplate <typename Collection>\nstatic void printCollection(const Collection &C, std::ostream &O,\n                            const Module *M, const std::string &Prefix) {\n  if (M == 0) {\n    O << \"Null Module pointer, cannot continue!\\n\";\n    return;\n  }\n\n  unsigned TotalNumNodes = 0, TotalCallNodes = 0;\n  for (Module::const_iterator I = M->begin(), E = M->end(); I != E; ++I)\n    if (C.hasGraph(*I)) {\n      DSGraph &Gr = C.getDSGraph((Function&)*I);\n      TotalNumNodes += Gr.getGraphSize();\n      unsigned NumCalls = Gr.shouldPrintAuxCalls() ?\n        Gr.getAuxFunctionCalls().size() : Gr.getFunctionCalls().size();\n\n      TotalCallNodes += NumCalls;\n      if (I->getName() == \"main\" || !OnlyPrintMain)\n        Gr.writeGraphToFile(O, Prefix+I->getName());\n      else {\n        O << \"Skipped Writing '\" << Prefix+I->getName() << \".dot'... [\"\n          << Gr.getGraphSize() << \"+\" << NumCalls << \"]\\n\";\n      }\n\n      if (MaxGraphSize < Gr.getNodes().size())\n        MaxGraphSize = Gr.getNodes().size();\n      for (unsigned i = 0, e = Gr.getNodes().size(); i != e; ++i)\n        if (Gr.getNodes()[i]->isNodeCompletelyFolded())\n          ++NumFoldedNodes;\n    }\n\n  DSGraph &GG = C.getGlobalsGraph();\n  TotalNumNodes  += GG.getGraphSize();\n  TotalCallNodes += GG.getFunctionCalls().size();\n  if (!OnlyPrintMain) {\n    GG.writeGraphToFile(O, Prefix+\"GlobalsGraph\");\n  } else {\n    O << \"Skipped Writing '\" << Prefix << \"GlobalsGraph.dot'... [\"\n      << GG.getGraphSize() << \"+\" << GG.getFunctionCalls().size() << \"]\\n\";\n  }\n\n  O << \"\\nGraphs contain [\" << TotalNumNodes << \"+\" << TotalCallNodes \n    << \"] nodes total\" << std::endl;\n}\n\n\n\/\/ print - Print out the analysis results...\nvoid LocalDataStructures::print(std::ostream &O, const Module *M) const {\n  printCollection(*this, O, M, \"ds.\");\n}\n\nvoid BUDataStructures::print(std::ostream &O, const Module *M) const {\n  printCollection(*this, O, M, \"bu.\");\n}\n\nvoid TDDataStructures::print(std::ostream &O, const Module *M) const {\n  printCollection(*this, O, M, \"td.\");\n}\n<commit_msg>Print collapsed to match the paper<commit_after>\/\/===- Printer.cpp - Code for printing data structure graphs nicely -------===\/\/\n\/\/\n\/\/ This file implements the 'dot' graph printer.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Analysis\/DataStructure.h\"\n#include \"llvm\/Analysis\/DSGraph.h\"\n#include \"llvm\/Analysis\/DSGraphTraits.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/Constants.h\"\n#include \"llvm\/Assembly\/Writer.h\"\n#include \"Support\/CommandLine.h\"\n#include \"Support\/GraphWriter.h\"\n#include \"Support\/Statistic.h\"\n#include <fstream>\n#include <sstream>\n\n\/\/ OnlyPrintMain - The DataStructure printer exposes this option to allow\n\/\/ printing of only the graph for \"main\".\n\/\/\nnamespace {\n  cl::opt<bool> OnlyPrintMain(\"only-print-main-ds\", cl::ReallyHidden);\n  Statistic<> MaxGraphSize   (\"dsnode\", \"Maximum graph size\");\n  Statistic<> NumFoldedNodes (\"dsnode\", \"Number of folded nodes (in final graph)\");\n}\n\n\nvoid DSNode::dump() const { print(std::cerr, 0); }\n\nstatic std::string getCaption(const DSNode *N, const DSGraph *G) {\n  std::stringstream OS;\n  Module *M = 0;\n  \/\/ Get the module from ONE of the functions in the graph it is available.\n  if (G && !G->getReturnNodes().empty())\n    M = G->getReturnNodes().begin()->first->getParent();\n\n  if (N->isNodeCompletelyFolded())\n    OS << \"COLLAPSED\";\n  else {\n    WriteTypeSymbolic(OS, N->getType(), M);\n    if (N->isArray())\n      OS << \" array\";\n  }\n  if (unsigned NodeType = N->getNodeFlags()) {\n    OS << \": \";\n    if (NodeType & DSNode::AllocaNode ) OS << \"S\";\n    if (NodeType & DSNode::HeapNode   ) OS << \"H\";\n    if (NodeType & DSNode::GlobalNode ) OS << \"G\";\n    if (NodeType & DSNode::UnknownNode) OS << \"U\";\n    if (NodeType & DSNode::Incomplete ) OS << \"I\";\n    if (NodeType & DSNode::Modified   ) OS << \"M\";\n    if (NodeType & DSNode::Read       ) OS << \"R\";\n#ifndef NDEBUG\n    if (NodeType & DSNode::DEAD       ) OS << \"<dead>\";\n#endif\n    OS << \"\\n\";\n  }\n\n  for (unsigned i = 0, e = N->getGlobals().size(); i != e; ++i) {\n    WriteAsOperand(OS, N->getGlobals()[i], false, true, M);\n    OS << \"\\n\";\n  }\n\n  return OS.str();\n}\n\ntemplate<>\nstruct DOTGraphTraits<const DSGraph*> : public DefaultDOTGraphTraits {\n  static std::string getGraphName(const DSGraph *G) {\n    switch (G->getReturnNodes().size()) {\n    case 0: return G->getFunctionNames();\n    case 1: return \"Function \" + G->getFunctionNames();\n    default: return \"Functions: \" + G->getFunctionNames();\n    }\n  }\n\n  static const char *getGraphProperties(const DSGraph *G) {\n    return \"\\tsize=\\\"10,7.5\\\";\\n\"\n           \"\\trotate=\\\"90\\\";\\n\";\n  }\n\n  static std::string getNodeLabel(const DSNode *Node, const DSGraph *Graph) {\n    return getCaption(Node, Graph);\n  }\n\n  static std::string getNodeAttributes(const DSNode *N) {\n    return \"shape=Mrecord\";\/\/fontname=Courier\";\n  }\n  \n  \/\/\/ addCustomGraphFeatures - Use this graph writing hook to emit call nodes\n  \/\/\/ and the return node.\n  \/\/\/\n  static void addCustomGraphFeatures(const DSGraph *G,\n                                     GraphWriter<const DSGraph*> &GW) {\n    Module *CurMod = 0;\n    if (!G->getReturnNodes().empty())\n      CurMod = G->getReturnNodes().begin()->first->getParent();\n\n    \/\/ Add scalar nodes to the graph...\n    const DSGraph::ScalarMapTy &VM = G->getScalarMap();\n    for (DSGraph::ScalarMapTy::const_iterator I = VM.begin(); I != VM.end();++I)\n      if (!isa<GlobalValue>(I->first) && !isa<ConstantPointerRef>(I->first)) {\n        std::stringstream OS;\n        WriteAsOperand(OS, I->first, false, true, CurMod);\n        GW.emitSimpleNode(I->first, \"\", OS.str());\n        \n        \/\/ Add edge from return node to real destination\n        int EdgeDest = I->second.getOffset() >> DS::PointerShift;\n        if (EdgeDest == 0) EdgeDest = -1;\n        GW.emitEdge(I->first, -1, I->second.getNode(),\n                    EdgeDest, \"arrowtail=tee,color=gray63\");\n      }\n\n\n    \/\/ Output the returned value pointer...\n    const DSGraph::ReturnNodesTy &RetNodes = G->getReturnNodes();\n    for (DSGraph::ReturnNodesTy::const_iterator I = RetNodes.begin(),\n           E = RetNodes.end(); I != E; ++I)\n      if (I->second.getNode()) {\n        std::string Label;\n        if (RetNodes.size() == 1)\n          Label = \"returning\";\n        else\n          Label = I->first->getName() + \" ret node\";\n        \/\/ Output the return node...\n        GW.emitSimpleNode((void*)1, \"plaintext=circle\", Label);\n\n        \/\/ Add edge from return node to real destination\n        int RetEdgeDest = I->second.getOffset() >> DS::PointerShift;;\n        if (RetEdgeDest == 0) RetEdgeDest = -1;\n        GW.emitEdge((void*)1, -1, I->second.getNode(),\n                    RetEdgeDest, \"arrowtail=tee,color=gray63\");\n      }\n\n    \/\/ Output all of the call nodes...\n    const std::vector<DSCallSite> &FCs =\n      G->shouldPrintAuxCalls() ? G->getAuxFunctionCalls()\n      : G->getFunctionCalls();\n    for (unsigned i = 0, e = FCs.size(); i != e; ++i) {\n      const DSCallSite &Call = FCs[i];\n      std::vector<std::string> EdgeSourceCaptions(Call.getNumPtrArgs()+2);\n      EdgeSourceCaptions[0] = \"r\";\n      if (Call.isDirectCall())\n        EdgeSourceCaptions[1] = Call.getCalleeFunc()->getName();\n      else\n        EdgeSourceCaptions[1] = \"f\";\n\n      GW.emitSimpleNode(&Call, \"shape=record\", \"call\", Call.getNumPtrArgs()+2,\n                        &EdgeSourceCaptions);\n\n      if (DSNode *N = Call.getRetVal().getNode()) {\n        int EdgeDest = Call.getRetVal().getOffset() >> DS::PointerShift;\n        if (EdgeDest == 0) EdgeDest = -1;\n        GW.emitEdge(&Call, 0, N, EdgeDest, \"color=gray63,tailclip=false\");\n      }\n\n      \/\/ Print out the callee...\n      if (Call.isIndirectCall()) {\n        DSNode *N = Call.getCalleeNode();\n        assert(N && \"Null call site callee node!\");\n        GW.emitEdge(&Call, 1, N, -1, \"color=gray63,tailclip=false\");\n      }\n\n      for (unsigned j = 0, e = Call.getNumPtrArgs(); j != e; ++j)\n        if (DSNode *N = Call.getPtrArg(j).getNode()) {\n          int EdgeDest = Call.getPtrArg(j).getOffset() >> DS::PointerShift;\n          if (EdgeDest == 0) EdgeDest = -1;\n          GW.emitEdge(&Call, j+2, N, EdgeDest, \"color=gray63,tailclip=false\");\n        }\n    }\n  }\n};\n\nvoid DSNode::print(std::ostream &O, const DSGraph *G) const {\n  GraphWriter<const DSGraph *> W(O, G);\n  W.writeNode(this);\n}\n\nvoid DSGraph::print(std::ostream &O) const {\n  WriteGraph(O, this, \"DataStructures\");\n}\n\nvoid DSGraph::writeGraphToFile(std::ostream &O,\n                               const std::string &GraphName) const {\n  std::string Filename = GraphName + \".dot\";\n  O << \"Writing '\" << Filename << \"'...\";\n  std::ofstream F(Filename.c_str());\n  \n  if (F.good()) {\n    print(F);\n    unsigned NumCalls = shouldPrintAuxCalls() ?\n      getAuxFunctionCalls().size() : getFunctionCalls().size();\n    O << \" [\" << getGraphSize() << \"+\" << NumCalls << \"]\\n\";\n  } else {\n    O << \"  error opening file for writing!\\n\";\n  }\n}\n\n\/\/\/ viewGraph - Emit a dot graph, run 'dot', run gv on the postscript file,\n\/\/\/ then cleanup.  For use from the debugger.\n\/\/\/\nvoid DSGraph::viewGraph() const {\n  std::ofstream F(\"\/tmp\/tempgraph.dot\");\n  if (!F.good()) {\n    std::cerr << \"Error opening '\/tmp\/tempgraph.dot' for temporary graph!\\n\";\n    return;\n  }\n  print(F);\n  F.close();\n  if (system(\"dot -Tps \/tmp\/tempgraph.dot > \/tmp\/tempgraph.ps\"))\n    std::cerr << \"Error running dot: 'dot' not in path?\\n\";\n  system(\"gv \/tmp\/tempgraph.ps\");\n  system(\"rm \/tmp\/tempgraph.dot \/tmp\/tempgraph.ps\");\n}\n\n\ntemplate <typename Collection>\nstatic void printCollection(const Collection &C, std::ostream &O,\n                            const Module *M, const std::string &Prefix) {\n  if (M == 0) {\n    O << \"Null Module pointer, cannot continue!\\n\";\n    return;\n  }\n\n  unsigned TotalNumNodes = 0, TotalCallNodes = 0;\n  for (Module::const_iterator I = M->begin(), E = M->end(); I != E; ++I)\n    if (C.hasGraph(*I)) {\n      DSGraph &Gr = C.getDSGraph((Function&)*I);\n      TotalNumNodes += Gr.getGraphSize();\n      unsigned NumCalls = Gr.shouldPrintAuxCalls() ?\n        Gr.getAuxFunctionCalls().size() : Gr.getFunctionCalls().size();\n\n      TotalCallNodes += NumCalls;\n      if (I->getName() == \"main\" || !OnlyPrintMain)\n        Gr.writeGraphToFile(O, Prefix+I->getName());\n      else {\n        O << \"Skipped Writing '\" << Prefix+I->getName() << \".dot'... [\"\n          << Gr.getGraphSize() << \"+\" << NumCalls << \"]\\n\";\n      }\n\n      if (MaxGraphSize < Gr.getNodes().size())\n        MaxGraphSize = Gr.getNodes().size();\n      for (unsigned i = 0, e = Gr.getNodes().size(); i != e; ++i)\n        if (Gr.getNodes()[i]->isNodeCompletelyFolded())\n          ++NumFoldedNodes;\n    }\n\n  DSGraph &GG = C.getGlobalsGraph();\n  TotalNumNodes  += GG.getGraphSize();\n  TotalCallNodes += GG.getFunctionCalls().size();\n  if (!OnlyPrintMain) {\n    GG.writeGraphToFile(O, Prefix+\"GlobalsGraph\");\n  } else {\n    O << \"Skipped Writing '\" << Prefix << \"GlobalsGraph.dot'... [\"\n      << GG.getGraphSize() << \"+\" << GG.getFunctionCalls().size() << \"]\\n\";\n  }\n\n  O << \"\\nGraphs contain [\" << TotalNumNodes << \"+\" << TotalCallNodes \n    << \"] nodes total\" << std::endl;\n}\n\n\n\/\/ print - Print out the analysis results...\nvoid LocalDataStructures::print(std::ostream &O, const Module *M) const {\n  printCollection(*this, O, M, \"ds.\");\n}\n\nvoid BUDataStructures::print(std::ostream &O, const Module *M) const {\n  printCollection(*this, O, M, \"bu.\");\n}\n\nvoid TDDataStructures::print(std::ostream &O, const Module *M) const {\n  printCollection(*this, O, M, \"td.\");\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <cstdio>\n#include <iostream>\n#include <sstream>\n#include <libHierGA\/HierGA.hpp>\n#include \"LongestFragmentFitness.hpp\"\n\nusing namespace std;\n\nint main(void) {\n\tHierarchicalEA ea(100);\n\tvector<Locus*> baseLoci(8, new IntLocus(0, 1));\n\tvector<PopulationNode*> bottomNodes;\n\tvector<Locus*> populationLoci;\n\n\tfor (int i = 0; i < 4; i++) {\n\t\tstringstream name;\n\t\tname << \"P\" << 5 - i;\n\t\tbottomNodes.push_back(new EANode(\n\t\t\t16,\n\t\t\tbaseLoci,\n\t\t\tvector<ObjectiveFunction*>(),\n\t\t\tnew LongestFragmentToString(),\n\t\t\tvector<EndCondition*>({new IterationCountEnd(100)}),\n\t\t\tname.str(),\n\t\t\tnew GA(2, false, new TournamentSelection(0.95, 4)),\n\t\t\tnew NPointCrossover(2),\n\t\t\tnew UniformMutation(0.2)\n\t\t));\n\t\tpopulationLoci.push_back(new PopulationLocus(bottomNodes[i]));\n\t}\n\n\tea.addNodes(bottomNodes, vector<bool>(4, true), vector<bool>(4, false));\n\tea.addNode(\n\t\tnew EANode(\n\t\t\t8,\n\t\t\tpopulationLoci,\n\t\t\tvector<ObjectiveFunction*>(\n\t\t\t\t{new LongestFragmentFitness()}\n\t\t\t),\n\t\t\tnew LongestFragmentToString(),\n\t\t\tvector<EndCondition*>({new IterationCountEnd(100)}),\n\t\t\t\"P1\",\n\t\t\tnew GA(2, false, new TournamentSelection(0.95, 4)),\n\t\t\tnew NPointCrossover(2),\n\t\t\tnew UniformMutation(0.2)\n\t\t),\n\t\ttrue,\n\t\ttrue\n\t);\n\n\tvector<string> names({\"P5\", \"P4\", \"P3\", \"P2\"});\n\tfor (int i = 0; i < names.size(); i++)\n\t\tea.getNodeByName(names[i])->setObjective(new BestOfApportionment(\n\t\t\tea.getNodeByName(\"P1\"),\n\t\t\tnew LongestFragmentApportionment()\n\t\t));\n\n\tea.setEvolutionOrder({\"P5\", \"P4\", \"P3\", \"P2\", \"P1\"});\n\tea.run(true);\n\tea.deleteAllNodes();\n}\n\n<commit_msg>[Apportionment Example]: Changed node order<commit_after>#include <cstdio>\n#include <iostream>\n#include <sstream>\n#include <libHierGA\/HierGA.hpp>\n#include \"LongestFragmentFitness.hpp\"\n\nusing namespace std;\n\nint main(void) {\n\tHierarchicalEA ea(100);\n\tvector<Locus*> baseLoci(8, new IntLocus(0, 1));\n\tvector<PopulationNode*> bottomNodes;\n\tvector<Locus*> populationLoci;\n\n\tfor (int i = 0; i < 4; i++) {\n\t\tstringstream name;\n\t\tname << \"P\" << 2 + i;\n\t\tbottomNodes.push_back(new EANode(\n\t\t\t16,\n\t\t\tbaseLoci,\n\t\t\tvector<ObjectiveFunction*>(),\n\t\t\tnew LongestFragmentToString(),\n\t\t\tvector<EndCondition*>({new IterationCountEnd(100)}),\n\t\t\tname.str(),\n\t\t\tnew GA(2, false, new TournamentSelection(0.95, 4)),\n\t\t\tnew NPointCrossover(2),\n\t\t\tnew UniformMutation(0.2)\n\t\t));\n\t\tpopulationLoci.push_back(new PopulationLocus(bottomNodes[i]));\n\t}\n\n\tea.addNodes(bottomNodes, vector<bool>(4, true), vector<bool>(4, false));\n\tea.addNode(\n\t\tnew EANode(\n\t\t\t8,\n\t\t\tpopulationLoci,\n\t\t\tvector<ObjectiveFunction*>(\n\t\t\t\t{new LongestFragmentFitness()}\n\t\t\t),\n\t\t\tnew LongestFragmentToString(),\n\t\t\tvector<EndCondition*>({new IterationCountEnd(100)}),\n\t\t\t\"P1\",\n\t\t\tnew GA(2, false, new TournamentSelection(0.95, 4)),\n\t\t\tnew NPointCrossover(2),\n\t\t\tnew UniformMutation(0.2)\n\t\t),\n\t\ttrue,\n\t\ttrue\n\t);\n\n\tvector<string> names({\"P5\", \"P4\", \"P3\", \"P2\"});\n\tfor (int i = 0; i < names.size(); i++)\n\t\tea.getNodeByName(names[i])->setObjective(new BestOfApportionment(\n\t\t\tea.getNodeByName(\"P1\"),\n\t\t\tnew LongestFragmentApportionment()\n\t\t));\n\n\tea.setEvolutionOrder({\"P5\", \"P4\", \"P3\", \"P2\", \"P1\"});\n\tea.setNodesToPrint({\"P1\", \"P2\", \"P3\", \"P4\", \"P5\"});\n\tea.run(true);\n\tea.deleteAllNodes();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- ProfileInfoLoaderPass.cpp - LLVM Pass to load profile info ---------===\/\/\n\/\/ \n\/\/                     The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file was developed by the LLVM research group and is distributed under\n\/\/ the University of Illinois Open Source License. See LICENSE.TXT for details.\n\/\/ \n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file implements a concrete implementation of profiling information that\n\/\/ loads the information from a profile dump file.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Pass.h\"\n#include \"llvm\/Analysis\/ProfileInfo.h\"\n#include \"llvm\/Analysis\/ProfileInfoLoader.h\"\n#include \"Support\/CommandLine.h\"\nusing namespace llvm;\n\nnamespace {\n  cl::opt<std::string>\n  ProfileInfoFilename(\"profile-info-file\", cl::init(\"llvmprof.out\"),\n                      cl::desc(\"\"));\n\n  class LoaderPass : public Pass, public ProfileInfo {\n    std::string Filename;\n    std::map<BasicBlock*, unsigned> ExecutionCounts;\n  public:\n    LoaderPass(const std::string &filename = \"\")\n      : Filename(filename) {\n      if (filename.empty()) Filename = ProfileInfoFilename;\n    }\n\n    virtual void getAnalysisUsage(AnalysisUsage &AU) const {\n      AU.setPreservesAll();\n    }\n\n    virtual const char *getPassName() const {\n      return \"Profiling information loader\";\n    }\n\n    \/\/\/ run - Load the profile information from the specified file.\n    virtual bool run(Module &M);\n\n    virtual unsigned getExecutionCount(BasicBlock *BB) {\n      std::map<BasicBlock*, unsigned>::iterator I = ExecutionCounts.find(BB);\n      return I != ExecutionCounts.end() ? I->second : 0;\n    }\n  };\n \n  RegisterOpt<LoaderPass>\n  X(\"profile-loader\", \"Load profile information from llvmprof.out\");\n\n  RegisterAnalysisGroup<ProfileInfo, LoaderPass> Y;\n}  \/\/ End of anonymous namespace\n\n\n\/\/\/ createProfileLoaderPass - This function returns a Pass that loads the\n\/\/\/ profiling information for the module from the specified filename, making it\n\/\/\/ available to the optimizers.\nPass *llvm::createProfileLoaderPass(const std::string &Filename) {\n  return new LoaderPass(Filename);\n}\n\nbool LoaderPass::run(Module &M) {\n  ProfileInfoLoader PIL(\"opt\", Filename, M);\n  if (PIL.hasAccurateBlockCounts()) {\n    std::vector<std::pair<BasicBlock*, unsigned> > Counts;\n    PIL.getBlockCounts(Counts);\n    ExecutionCounts.insert(Counts.begin(), Counts.end());\n  }\n  return false;\n}\n<commit_msg>Cosmetic improvements to this option.<commit_after>\/\/===- ProfileInfoLoaderPass.cpp - LLVM Pass to load profile info ---------===\/\/\n\/\/ \n\/\/                     The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file was developed by the LLVM research group and is distributed under\n\/\/ the University of Illinois Open Source License. See LICENSE.TXT for details.\n\/\/ \n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file implements a concrete implementation of profiling information that\n\/\/ loads the information from a profile dump file.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Pass.h\"\n#include \"llvm\/Analysis\/ProfileInfo.h\"\n#include \"llvm\/Analysis\/ProfileInfoLoader.h\"\n#include \"Support\/CommandLine.h\"\nusing namespace llvm;\n\nnamespace {\n  cl::opt<std::string>\n  ProfileInfoFilename(\"profile-info-file\", cl::init(\"llvmprof.out\"),\n                      cl::value_desc(\"filename\"),\n                      cl::desc(\"Profile file loaded by -profile-loader\"));\n\n  class LoaderPass : public Pass, public ProfileInfo {\n    std::string Filename;\n    std::map<BasicBlock*, unsigned> ExecutionCounts;\n  public:\n    LoaderPass(const std::string &filename = \"\")\n      : Filename(filename) {\n      if (filename.empty()) Filename = ProfileInfoFilename;\n    }\n\n    virtual void getAnalysisUsage(AnalysisUsage &AU) const {\n      AU.setPreservesAll();\n    }\n\n    virtual const char *getPassName() const {\n      return \"Profiling information loader\";\n    }\n\n    \/\/\/ run - Load the profile information from the specified file.\n    virtual bool run(Module &M);\n\n    virtual unsigned getExecutionCount(BasicBlock *BB) {\n      std::map<BasicBlock*, unsigned>::iterator I = ExecutionCounts.find(BB);\n      return I != ExecutionCounts.end() ? I->second : 0;\n    }\n  };\n \n  RegisterOpt<LoaderPass>\n  X(\"profile-loader\", \"Load profile information from llvmprof.out\");\n\n  RegisterAnalysisGroup<ProfileInfo, LoaderPass> Y;\n}  \/\/ End of anonymous namespace\n\n\n\/\/\/ createProfileLoaderPass - This function returns a Pass that loads the\n\/\/\/ profiling information for the module from the specified filename, making it\n\/\/\/ available to the optimizers.\nPass *llvm::createProfileLoaderPass(const std::string &Filename) {\n  return new LoaderPass(Filename);\n}\n\nbool LoaderPass::run(Module &M) {\n  ProfileInfoLoader PIL(\"opt\", Filename, M);\n  if (PIL.hasAccurateBlockCounts()) {\n    std::vector<std::pair<BasicBlock*, unsigned> > Counts;\n    PIL.getBlockCounts(Counts);\n    ExecutionCounts.insert(Counts.begin(), Counts.end());\n  }\n  return false;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- ReadConst.cpp - Code to constants and constant pools ---------------===\/\/\n\/\/ \n\/\/                     The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file was developed by the LLVM research group and is distributed under\n\/\/ the University of Illinois Open Source License. See LICENSE.TXT for details.\n\/\/ \n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file implements functionality to deserialize constants and entire \n\/\/ constant pools.\n\/\/ \n\/\/ Note that this library should be as fast as possible, reentrant, and \n\/\/ thread-safe!!\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"ReaderInternals.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/Constants.h\"\n#include <algorithm>\nusing namespace llvm;\n\nconst Type *BytecodeParser::parseTypeConstant(const unsigned char *&Buf,\n\t\t\t\t\t      const unsigned char *EndBuf) {\n  unsigned PrimType = read_vbr_uint(Buf, EndBuf);\n\n  const Type *Val = 0;\n  if ((Val = Type::getPrimitiveType((Type::PrimitiveID)PrimType)))\n    return Val;\n  \n  switch (PrimType) {\n  case Type::FunctionTyID: {\n    const Type *RetType = getType(read_vbr_uint(Buf, EndBuf));\n\n    unsigned NumParams = read_vbr_uint(Buf, EndBuf);\n\n    std::vector<const Type*> Params;\n    while (NumParams--)\n      Params.push_back(getType(read_vbr_uint(Buf, EndBuf)));\n\n    bool isVarArg = Params.size() && Params.back() == Type::VoidTy;\n    if (isVarArg) Params.pop_back();\n\n    return FunctionType::get(RetType, Params, isVarArg);\n  }\n  case Type::ArrayTyID: {\n    unsigned ElTyp = read_vbr_uint(Buf, EndBuf);\n    const Type *ElementType = getType(ElTyp);\n\n    unsigned NumElements = read_vbr_uint(Buf, EndBuf);\n\n    BCR_TRACE(5, \"Array Type Constant #\" << ElTyp << \" size=\" \n              << NumElements << \"\\n\");\n    return ArrayType::get(ElementType, NumElements);\n  }\n  case Type::StructTyID: {\n    std::vector<const Type*> Elements;\n    unsigned Typ = read_vbr_uint(Buf, EndBuf);\n    while (Typ) {         \/\/ List is terminated by void\/0 typeid\n      Elements.push_back(getType(Typ));\n      Typ = read_vbr_uint(Buf, EndBuf);\n    }\n\n    return StructType::get(Elements);\n  }\n  case Type::PointerTyID: {\n    unsigned ElTyp = read_vbr_uint(Buf, EndBuf);\n    BCR_TRACE(5, \"Pointer Type Constant #\" << ElTyp << \"\\n\");\n    return PointerType::get(getType(ElTyp));\n  }\n\n  case Type::OpaqueTyID: {\n    return OpaqueType::get();\n  }\n\n  default:\n    std::cerr << __FILE__ << \":\" << __LINE__\n              << \": Don't know how to deserialize\"\n              << \" primitive Type \" << PrimType << \"\\n\";\n    return Val;\n  }\n}\n\n\/\/ parseTypeConstants - We have to use this weird code to handle recursive\n\/\/ types.  We know that recursive types will only reference the current slab of\n\/\/ values in the type plane, but they can forward reference types before they\n\/\/ have been read.  For example, Type #0 might be '{ Ty#1 }' and Type #1 might\n\/\/ be 'Ty#0*'.  When reading Type #0, type number one doesn't exist.  To fix\n\/\/ this ugly problem, we pessimistically insert an opaque type for each type we\n\/\/ are about to read.  This means that forward references will resolve to\n\/\/ something and when we reread the type later, we can replace the opaque type\n\/\/ with a new resolved concrete type.\n\/\/\nnamespace llvm { void debug_type_tables(); }\nvoid BytecodeParser::parseTypeConstants(const unsigned char *&Buf,\n                                        const unsigned char *EndBuf,\n\t\t\t\t\tTypeValuesListTy &Tab,\n\t\t\t\t\tunsigned NumEntries) {\n  assert(Tab.size() == 0 && \"should not have read type constants in before!\");\n\n  \/\/ Insert a bunch of opaque types to be resolved later...\n  Tab.reserve(NumEntries);\n  for (unsigned i = 0; i != NumEntries; ++i)\n    Tab.push_back(OpaqueType::get());\n\n  \/\/ Loop through reading all of the types.  Forward types will make use of the\n  \/\/ opaque types just inserted.\n  \/\/\n  for (unsigned i = 0; i != NumEntries; ++i) {\n    const Type *NewTy = parseTypeConstant(Buf, EndBuf), *OldTy = Tab[i].get();\n    if (NewTy == 0) throw std::string(\"Couldn't parse type!\");\n    BCR_TRACE(4, \"#\" << i << \": Read Type Constant: '\" << NewTy <<\n              \"' Replacing: \" << OldTy << \"\\n\");\n\n    \/\/ Don't insertValue the new type... instead we want to replace the opaque\n    \/\/ type with the new concrete value...\n    \/\/\n\n    \/\/ Refine the abstract type to the new type.  This causes all uses of the\n    \/\/ abstract type to use NewTy.  This also will cause the opaque type to be\n    \/\/ deleted...\n    \/\/\n    cast<DerivedType>(const_cast<Type*>(OldTy))->refineAbstractTypeTo(NewTy);\n\n    \/\/ This should have replace the old opaque type with the new type in the\n    \/\/ value table... or with a preexisting type that was already in the system\n    assert(Tab[i] != OldTy && \"refineAbstractType didn't work!\");\n  }\n\n  BCR_TRACE(5, \"Resulting types:\\n\");\n  for (unsigned i = 0; i < NumEntries; ++i) {\n    BCR_TRACE(5, (void*)Tab[i].get() << \" - \" << Tab[i].get() << \"\\n\");\n  }\n  debug_type_tables();\n}\n\n\nConstant *BytecodeParser::parseConstantValue(const unsigned char *&Buf,\n                                             const unsigned char *EndBuf,\n                                             unsigned TypeID) {\n\n  \/\/ We must check for a ConstantExpr before switching by type because\n  \/\/ a ConstantExpr can be of any type, and has no explicit value.\n  \/\/ \n  \/\/ 0 if not expr; numArgs if is expr\n  unsigned isExprNumArgs = read_vbr_uint(Buf, EndBuf);\n  \n  if (isExprNumArgs) {\n    \/\/ FIXME: Encoding of constant exprs could be much more compact!\n    std::vector<Constant*> ArgVec;\n    ArgVec.reserve(isExprNumArgs);\n    unsigned Opcode = read_vbr_uint(Buf, EndBuf);\n    \n    \/\/ Read the slot number and types of each of the arguments\n    for (unsigned i = 0; i != isExprNumArgs; ++i) {\n      unsigned ArgValSlot = read_vbr_uint(Buf, EndBuf);\n      unsigned ArgTypeSlot = read_vbr_uint(Buf, EndBuf);\n      BCR_TRACE(4, \"CE Arg \" << i << \": Type: '\" << *getType(ArgTypeSlot)\n                << \"'  slot: \" << ArgValSlot << \"\\n\");\n      \n      \/\/ Get the arg value from its slot if it exists, otherwise a placeholder\n      ArgVec.push_back(getConstantValue(ArgTypeSlot, ArgValSlot));\n    }\n    \n    \/\/ Construct a ConstantExpr of the appropriate kind\n    if (isExprNumArgs == 1) {           \/\/ All one-operand expressions\n      assert(Opcode == Instruction::Cast);\n      return ConstantExpr::getCast(ArgVec[0], getType(TypeID));\n    } else if (Opcode == Instruction::GetElementPtr) { \/\/ GetElementPtr\n      std::vector<Constant*> IdxList(ArgVec.begin()+1, ArgVec.end());\n      return ConstantExpr::getGetElementPtr(ArgVec[0], IdxList);\n    } else {                            \/\/ All other 2-operand expressions\n      return ConstantExpr::get(Opcode, ArgVec[0], ArgVec[1]);\n    }\n  }\n  \n  \/\/ Ok, not an ConstantExpr.  We now know how to read the given type...\n  const Type *Ty = getType(TypeID);\n  switch (Ty->getPrimitiveID()) {\n  case Type::BoolTyID: {\n    unsigned Val = read_vbr_uint(Buf, EndBuf);\n    if (Val != 0 && Val != 1) throw std::string(\"Invalid boolean value read.\");\n    return ConstantBool::get(Val == 1);\n  }\n\n  case Type::UByteTyID:   \/\/ Unsigned integer types...\n  case Type::UShortTyID:\n  case Type::UIntTyID: {\n    unsigned Val = read_vbr_uint(Buf, EndBuf);\n    if (!ConstantUInt::isValueValidForType(Ty, Val)) \n      throw std::string(\"Invalid unsigned byte\/short\/int read.\");\n    return ConstantUInt::get(Ty, Val);\n  }\n\n  case Type::ULongTyID: {\n    return ConstantUInt::get(Ty, read_vbr_uint64(Buf, EndBuf));\n  }\n\n  case Type::SByteTyID:   \/\/ Signed integer types...\n  case Type::ShortTyID:\n  case Type::IntTyID: {\n  case Type::LongTyID:\n    int64_t Val = read_vbr_int64(Buf, EndBuf);\n    if (!ConstantSInt::isValueValidForType(Ty, Val)) \n      throw std::string(\"Invalid signed byte\/short\/int\/long read.\");\n    return ConstantSInt::get(Ty, Val);\n  }\n\n  case Type::FloatTyID: {\n    float F;\n    input_data(Buf, EndBuf, &F, &F+1);\n    return ConstantFP::get(Ty, F);\n  }\n\n  case Type::DoubleTyID: {\n    double Val;\n    input_data(Buf, EndBuf, &Val, &Val+1);\n    return ConstantFP::get(Ty, Val);\n  }\n\n  case Type::TypeTyID:\n    throw std::string(\"Type constants shouldn't live in constant table!\");\n\n  case Type::ArrayTyID: {\n    const ArrayType *AT = cast<ArrayType>(Ty);\n    unsigned NumElements = AT->getNumElements();\n    unsigned TypeSlot = getTypeSlot(AT->getElementType());\n    std::vector<Constant*> Elements;\n    Elements.reserve(NumElements);\n    while (NumElements--)     \/\/ Read all of the elements of the constant.\n      Elements.push_back(getConstantValue(TypeSlot,\n                                          read_vbr_uint(Buf, EndBuf)));\n    return ConstantArray::get(AT, Elements);\n  }\n\n  case Type::StructTyID: {\n    const StructType *ST = cast<StructType>(Ty);\n    const StructType::ElementTypes &ET = ST->getElementTypes();\n\n    std::vector<Constant *> Elements;\n    Elements.reserve(ET.size());\n    for (unsigned i = 0; i != ET.size(); ++i)\n      Elements.push_back(getConstantValue(ET[i], read_vbr_uint(Buf, EndBuf)));\n\n    return ConstantStruct::get(ST, Elements);\n  }    \n\n  case Type::PointerTyID: {  \/\/ ConstantPointerRef value...\n    const PointerType *PT = cast<PointerType>(Ty);\n    unsigned Slot = read_vbr_uint(Buf, EndBuf);\n    BCR_TRACE(4, \"CPR: Type: '\" << Ty << \"'  slot: \" << Slot << \"\\n\");\n    \n    \/\/ Check to see if we have already read this global variable...\n    Value *Val = getValue(TypeID, Slot, false);\n    GlobalValue *GV;\n    if (Val) {\n      if (!(GV = dyn_cast<GlobalValue>(Val))) \n        throw std::string(\"Value of ConstantPointerRef not in ValueTable!\");\n      BCR_TRACE(5, \"Value Found in ValueTable!\\n\");\n    } else {\n      throw std::string(\"Forward references are not allowed here.\");\n    }\n    \n    return ConstantPointerRef::get(GV);\n  }\n\n  default:\n    throw std::string(\"Don't know how to deserialize constant value of type '\"+\n                      Ty->getDescription());\n  }\n}\n\nvoid BytecodeParser::ParseGlobalTypes(const unsigned char *&Buf,\n                                      const unsigned char *EndBuf) {\n  ValueTable T;\n  ParseConstantPool(Buf, EndBuf, T, ModuleTypeValues);\n}\n\nvoid BytecodeParser::parseStringConstants(const unsigned char *&Buf,\n                                          const unsigned char *EndBuf,\n                                          unsigned NumEntries, ValueTable &Tab){\n  for (; NumEntries; --NumEntries) {\n    unsigned Typ = read_vbr_uint(Buf, EndBuf);\n    const Type *Ty = getType(Typ);\n    if (!isa<ArrayType>(Ty))\n      throw std::string(\"String constant data invalid!\");\n    \n    const ArrayType *ATy = cast<ArrayType>(Ty);\n    if (ATy->getElementType() != Type::SByteTy &&\n        ATy->getElementType() != Type::UByteTy)\n      throw std::string(\"String constant data invalid!\");\n    \n    \/\/ Read character data.  The type tells us how long the string is.\n    char Data[ATy->getNumElements()];\n    input_data(Buf, EndBuf, Data, Data+ATy->getNumElements());\n\n    std::vector<Constant*> Elements(ATy->getNumElements());\n    if (ATy->getElementType() == Type::SByteTy)\n      for (unsigned i = 0, e = ATy->getNumElements(); i != e; ++i)\n        Elements[i] = ConstantSInt::get(Type::SByteTy, Data[i]);\n    else\n      for (unsigned i = 0, e = ATy->getNumElements(); i != e; ++i)\n        Elements[i] = ConstantUInt::get(Type::UByteTy, Data[i]);\n\n    \/\/ Create the constant, inserting it as needed.\n    Constant *C = ConstantArray::get(ATy, Elements);\n    unsigned Slot = insertValue(C, Typ, Tab);\n    ResolveReferencesToConstant(C, Slot);\n  }\n}\n\n\nvoid BytecodeParser::ParseConstantPool(const unsigned char *&Buf,\n                                       const unsigned char *EndBuf,\n                                       ValueTable &Tab, \n                                       TypeValuesListTy &TypeTab) {\n  while (Buf < EndBuf) {\n    unsigned NumEntries = read_vbr_uint(Buf, EndBuf);\n    unsigned Typ = read_vbr_uint(Buf, EndBuf);\n    if (Typ == Type::TypeTyID) {\n      BCR_TRACE(3, \"Type: 'type'  NumEntries: \" << NumEntries << \"\\n\");\n      parseTypeConstants(Buf, EndBuf, TypeTab, NumEntries);\n    } else if (Typ == Type::VoidTyID) {\n      assert(&Tab == &ModuleValues && \"Cannot read strings in functions!\");\n      parseStringConstants(Buf, EndBuf, NumEntries, Tab);\n    } else {\n      BCR_TRACE(3, \"Type: '\" << *getType(Typ) << \"'  NumEntries: \"\n                << NumEntries << \"\\n\");\n\n      for (unsigned i = 0; i < NumEntries; ++i) {\n        Constant *C = parseConstantValue(Buf, EndBuf, Typ);\n        assert(C && \"parseConstantValue returned NULL!\");\n        BCR_TRACE(4, \"Read Constant: '\" << *C << \"'\\n\");\n        unsigned Slot = insertValue(C, Typ, Tab);\n\n        \/\/ If we are reading a function constant table, make sure that we adjust\n        \/\/ the slot number to be the real global constant number.\n        \/\/\n        if (&Tab != &ModuleValues && Typ < ModuleValues.size() &&\n            ModuleValues[Typ])\n          Slot += ModuleValues[Typ]->size();\n        ResolveReferencesToConstant(C, Slot);\n      }\n    }\n  }\n  \n  if (Buf > EndBuf) throw std::string(\"Read past end of buffer.\");\n}\n<commit_msg>Fix more breakage with string change.<commit_after>\/\/===- ReadConst.cpp - Code to constants and constant pools ---------------===\/\/\n\/\/ \n\/\/                     The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file was developed by the LLVM research group and is distributed under\n\/\/ the University of Illinois Open Source License. See LICENSE.TXT for details.\n\/\/ \n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file implements functionality to deserialize constants and entire \n\/\/ constant pools.\n\/\/ \n\/\/ Note that this library should be as fast as possible, reentrant, and \n\/\/ thread-safe!!\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"ReaderInternals.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/Constants.h\"\n#include <algorithm>\nusing namespace llvm;\n\nconst Type *BytecodeParser::parseTypeConstant(const unsigned char *&Buf,\n\t\t\t\t\t      const unsigned char *EndBuf) {\n  unsigned PrimType = read_vbr_uint(Buf, EndBuf);\n\n  const Type *Val = 0;\n  if ((Val = Type::getPrimitiveType((Type::PrimitiveID)PrimType)))\n    return Val;\n  \n  switch (PrimType) {\n  case Type::FunctionTyID: {\n    const Type *RetType = getType(read_vbr_uint(Buf, EndBuf));\n\n    unsigned NumParams = read_vbr_uint(Buf, EndBuf);\n\n    std::vector<const Type*> Params;\n    while (NumParams--)\n      Params.push_back(getType(read_vbr_uint(Buf, EndBuf)));\n\n    bool isVarArg = Params.size() && Params.back() == Type::VoidTy;\n    if (isVarArg) Params.pop_back();\n\n    return FunctionType::get(RetType, Params, isVarArg);\n  }\n  case Type::ArrayTyID: {\n    unsigned ElTyp = read_vbr_uint(Buf, EndBuf);\n    const Type *ElementType = getType(ElTyp);\n\n    unsigned NumElements = read_vbr_uint(Buf, EndBuf);\n\n    BCR_TRACE(5, \"Array Type Constant #\" << ElTyp << \" size=\" \n              << NumElements << \"\\n\");\n    return ArrayType::get(ElementType, NumElements);\n  }\n  case Type::StructTyID: {\n    std::vector<const Type*> Elements;\n    unsigned Typ = read_vbr_uint(Buf, EndBuf);\n    while (Typ) {         \/\/ List is terminated by void\/0 typeid\n      Elements.push_back(getType(Typ));\n      Typ = read_vbr_uint(Buf, EndBuf);\n    }\n\n    return StructType::get(Elements);\n  }\n  case Type::PointerTyID: {\n    unsigned ElTyp = read_vbr_uint(Buf, EndBuf);\n    BCR_TRACE(5, \"Pointer Type Constant #\" << ElTyp << \"\\n\");\n    return PointerType::get(getType(ElTyp));\n  }\n\n  case Type::OpaqueTyID: {\n    return OpaqueType::get();\n  }\n\n  default:\n    std::cerr << __FILE__ << \":\" << __LINE__\n              << \": Don't know how to deserialize\"\n              << \" primitive Type \" << PrimType << \"\\n\";\n    return Val;\n  }\n}\n\n\/\/ parseTypeConstants - We have to use this weird code to handle recursive\n\/\/ types.  We know that recursive types will only reference the current slab of\n\/\/ values in the type plane, but they can forward reference types before they\n\/\/ have been read.  For example, Type #0 might be '{ Ty#1 }' and Type #1 might\n\/\/ be 'Ty#0*'.  When reading Type #0, type number one doesn't exist.  To fix\n\/\/ this ugly problem, we pessimistically insert an opaque type for each type we\n\/\/ are about to read.  This means that forward references will resolve to\n\/\/ something and when we reread the type later, we can replace the opaque type\n\/\/ with a new resolved concrete type.\n\/\/\nnamespace llvm { void debug_type_tables(); }\nvoid BytecodeParser::parseTypeConstants(const unsigned char *&Buf,\n                                        const unsigned char *EndBuf,\n\t\t\t\t\tTypeValuesListTy &Tab,\n\t\t\t\t\tunsigned NumEntries) {\n  assert(Tab.size() == 0 && \"should not have read type constants in before!\");\n\n  \/\/ Insert a bunch of opaque types to be resolved later...\n  Tab.reserve(NumEntries);\n  for (unsigned i = 0; i != NumEntries; ++i)\n    Tab.push_back(OpaqueType::get());\n\n  \/\/ Loop through reading all of the types.  Forward types will make use of the\n  \/\/ opaque types just inserted.\n  \/\/\n  for (unsigned i = 0; i != NumEntries; ++i) {\n    const Type *NewTy = parseTypeConstant(Buf, EndBuf), *OldTy = Tab[i].get();\n    if (NewTy == 0) throw std::string(\"Couldn't parse type!\");\n    BCR_TRACE(4, \"#\" << i << \": Read Type Constant: '\" << NewTy <<\n              \"' Replacing: \" << OldTy << \"\\n\");\n\n    \/\/ Don't insertValue the new type... instead we want to replace the opaque\n    \/\/ type with the new concrete value...\n    \/\/\n\n    \/\/ Refine the abstract type to the new type.  This causes all uses of the\n    \/\/ abstract type to use NewTy.  This also will cause the opaque type to be\n    \/\/ deleted...\n    \/\/\n    cast<DerivedType>(const_cast<Type*>(OldTy))->refineAbstractTypeTo(NewTy);\n\n    \/\/ This should have replace the old opaque type with the new type in the\n    \/\/ value table... or with a preexisting type that was already in the system\n    assert(Tab[i] != OldTy && \"refineAbstractType didn't work!\");\n  }\n\n  BCR_TRACE(5, \"Resulting types:\\n\");\n  for (unsigned i = 0; i < NumEntries; ++i) {\n    BCR_TRACE(5, (void*)Tab[i].get() << \" - \" << Tab[i].get() << \"\\n\");\n  }\n  debug_type_tables();\n}\n\n\nConstant *BytecodeParser::parseConstantValue(const unsigned char *&Buf,\n                                             const unsigned char *EndBuf,\n                                             unsigned TypeID) {\n\n  \/\/ We must check for a ConstantExpr before switching by type because\n  \/\/ a ConstantExpr can be of any type, and has no explicit value.\n  \/\/ \n  \/\/ 0 if not expr; numArgs if is expr\n  unsigned isExprNumArgs = read_vbr_uint(Buf, EndBuf);\n  \n  if (isExprNumArgs) {\n    \/\/ FIXME: Encoding of constant exprs could be much more compact!\n    std::vector<Constant*> ArgVec;\n    ArgVec.reserve(isExprNumArgs);\n    unsigned Opcode = read_vbr_uint(Buf, EndBuf);\n    \n    \/\/ Read the slot number and types of each of the arguments\n    for (unsigned i = 0; i != isExprNumArgs; ++i) {\n      unsigned ArgValSlot = read_vbr_uint(Buf, EndBuf);\n      unsigned ArgTypeSlot = read_vbr_uint(Buf, EndBuf);\n      BCR_TRACE(4, \"CE Arg \" << i << \": Type: '\" << *getType(ArgTypeSlot)\n                << \"'  slot: \" << ArgValSlot << \"\\n\");\n      \n      \/\/ Get the arg value from its slot if it exists, otherwise a placeholder\n      ArgVec.push_back(getConstantValue(ArgTypeSlot, ArgValSlot));\n    }\n    \n    \/\/ Construct a ConstantExpr of the appropriate kind\n    if (isExprNumArgs == 1) {           \/\/ All one-operand expressions\n      assert(Opcode == Instruction::Cast);\n      return ConstantExpr::getCast(ArgVec[0], getType(TypeID));\n    } else if (Opcode == Instruction::GetElementPtr) { \/\/ GetElementPtr\n      std::vector<Constant*> IdxList(ArgVec.begin()+1, ArgVec.end());\n      return ConstantExpr::getGetElementPtr(ArgVec[0], IdxList);\n    } else {                            \/\/ All other 2-operand expressions\n      return ConstantExpr::get(Opcode, ArgVec[0], ArgVec[1]);\n    }\n  }\n  \n  \/\/ Ok, not an ConstantExpr.  We now know how to read the given type...\n  const Type *Ty = getType(TypeID);\n  switch (Ty->getPrimitiveID()) {\n  case Type::BoolTyID: {\n    unsigned Val = read_vbr_uint(Buf, EndBuf);\n    if (Val != 0 && Val != 1) throw std::string(\"Invalid boolean value read.\");\n    return ConstantBool::get(Val == 1);\n  }\n\n  case Type::UByteTyID:   \/\/ Unsigned integer types...\n  case Type::UShortTyID:\n  case Type::UIntTyID: {\n    unsigned Val = read_vbr_uint(Buf, EndBuf);\n    if (!ConstantUInt::isValueValidForType(Ty, Val)) \n      throw std::string(\"Invalid unsigned byte\/short\/int read.\");\n    return ConstantUInt::get(Ty, Val);\n  }\n\n  case Type::ULongTyID: {\n    return ConstantUInt::get(Ty, read_vbr_uint64(Buf, EndBuf));\n  }\n\n  case Type::SByteTyID:   \/\/ Signed integer types...\n  case Type::ShortTyID:\n  case Type::IntTyID: {\n  case Type::LongTyID:\n    int64_t Val = read_vbr_int64(Buf, EndBuf);\n    if (!ConstantSInt::isValueValidForType(Ty, Val)) \n      throw std::string(\"Invalid signed byte\/short\/int\/long read.\");\n    return ConstantSInt::get(Ty, Val);\n  }\n\n  case Type::FloatTyID: {\n    float F;\n    input_data(Buf, EndBuf, &F, &F+1);\n    return ConstantFP::get(Ty, F);\n  }\n\n  case Type::DoubleTyID: {\n    double Val;\n    input_data(Buf, EndBuf, &Val, &Val+1);\n    return ConstantFP::get(Ty, Val);\n  }\n\n  case Type::TypeTyID:\n    throw std::string(\"Type constants shouldn't live in constant table!\");\n\n  case Type::ArrayTyID: {\n    const ArrayType *AT = cast<ArrayType>(Ty);\n    unsigned NumElements = AT->getNumElements();\n    unsigned TypeSlot = getTypeSlot(AT->getElementType());\n    std::vector<Constant*> Elements;\n    Elements.reserve(NumElements);\n    while (NumElements--)     \/\/ Read all of the elements of the constant.\n      Elements.push_back(getConstantValue(TypeSlot,\n                                          read_vbr_uint(Buf, EndBuf)));\n    return ConstantArray::get(AT, Elements);\n  }\n\n  case Type::StructTyID: {\n    const StructType *ST = cast<StructType>(Ty);\n    const StructType::ElementTypes &ET = ST->getElementTypes();\n\n    std::vector<Constant *> Elements;\n    Elements.reserve(ET.size());\n    for (unsigned i = 0; i != ET.size(); ++i)\n      Elements.push_back(getConstantValue(ET[i], read_vbr_uint(Buf, EndBuf)));\n\n    return ConstantStruct::get(ST, Elements);\n  }    \n\n  case Type::PointerTyID: {  \/\/ ConstantPointerRef value...\n    const PointerType *PT = cast<PointerType>(Ty);\n    unsigned Slot = read_vbr_uint(Buf, EndBuf);\n    BCR_TRACE(4, \"CPR: Type: '\" << Ty << \"'  slot: \" << Slot << \"\\n\");\n    \n    \/\/ Check to see if we have already read this global variable...\n    Value *Val = getValue(TypeID, Slot, false);\n    GlobalValue *GV;\n    if (Val) {\n      if (!(GV = dyn_cast<GlobalValue>(Val))) \n        throw std::string(\"Value of ConstantPointerRef not in ValueTable!\");\n      BCR_TRACE(5, \"Value Found in ValueTable!\\n\");\n    } else {\n      throw std::string(\"Forward references are not allowed here.\");\n    }\n    \n    return ConstantPointerRef::get(GV);\n  }\n\n  default:\n    throw std::string(\"Don't know how to deserialize constant value of type '\"+\n                      Ty->getDescription());\n  }\n}\n\nvoid BytecodeParser::ParseGlobalTypes(const unsigned char *&Buf,\n                                      const unsigned char *EndBuf) {\n  ValueTable T;\n  ParseConstantPool(Buf, EndBuf, T, ModuleTypeValues);\n}\n\nvoid BytecodeParser::parseStringConstants(const unsigned char *&Buf,\n                                          const unsigned char *EndBuf,\n                                          unsigned NumEntries, ValueTable &Tab){\n  for (; NumEntries; --NumEntries) {\n    unsigned Typ = read_vbr_uint(Buf, EndBuf);\n    const Type *Ty = getType(Typ);\n    if (!isa<ArrayType>(Ty))\n      throw std::string(\"String constant data invalid!\");\n    \n    const ArrayType *ATy = cast<ArrayType>(Ty);\n    if (ATy->getElementType() != Type::SByteTy &&\n        ATy->getElementType() != Type::UByteTy)\n      throw std::string(\"String constant data invalid!\");\n    \n    \/\/ Read character data.  The type tells us how long the string is.\n    char Data[ATy->getNumElements()];\n    input_data(Buf, EndBuf, Data, Data+ATy->getNumElements());\n\n    std::vector<Constant*> Elements(ATy->getNumElements());\n    if (ATy->getElementType() == Type::SByteTy)\n      for (unsigned i = 0, e = ATy->getNumElements(); i != e; ++i)\n        Elements[i] = ConstantSInt::get(Type::SByteTy, (signed char)Data[i]);\n    else\n      for (unsigned i = 0, e = ATy->getNumElements(); i != e; ++i)\n        Elements[i] = ConstantUInt::get(Type::UByteTy, (unsigned char)Data[i]);\n\n    \/\/ Create the constant, inserting it as needed.\n    Constant *C = ConstantArray::get(ATy, Elements);\n    unsigned Slot = insertValue(C, Typ, Tab);\n    ResolveReferencesToConstant(C, Slot);\n  }\n}\n\n\nvoid BytecodeParser::ParseConstantPool(const unsigned char *&Buf,\n                                       const unsigned char *EndBuf,\n                                       ValueTable &Tab, \n                                       TypeValuesListTy &TypeTab) {\n  while (Buf < EndBuf) {\n    unsigned NumEntries = read_vbr_uint(Buf, EndBuf);\n    unsigned Typ = read_vbr_uint(Buf, EndBuf);\n    if (Typ == Type::TypeTyID) {\n      BCR_TRACE(3, \"Type: 'type'  NumEntries: \" << NumEntries << \"\\n\");\n      parseTypeConstants(Buf, EndBuf, TypeTab, NumEntries);\n    } else if (Typ == Type::VoidTyID) {\n      assert(&Tab == &ModuleValues && \"Cannot read strings in functions!\");\n      parseStringConstants(Buf, EndBuf, NumEntries, Tab);\n    } else {\n      BCR_TRACE(3, \"Type: '\" << *getType(Typ) << \"'  NumEntries: \"\n                << NumEntries << \"\\n\");\n\n      for (unsigned i = 0; i < NumEntries; ++i) {\n        Constant *C = parseConstantValue(Buf, EndBuf, Typ);\n        assert(C && \"parseConstantValue returned NULL!\");\n        BCR_TRACE(4, \"Read Constant: '\" << *C << \"'\\n\");\n        unsigned Slot = insertValue(C, Typ, Tab);\n\n        \/\/ If we are reading a function constant table, make sure that we adjust\n        \/\/ the slot number to be the real global constant number.\n        \/\/\n        if (&Tab != &ModuleValues && Typ < ModuleValues.size() &&\n            ModuleValues[Typ])\n          Slot += ModuleValues[Typ]->size();\n        ResolveReferencesToConstant(C, Slot);\n      }\n    }\n  }\n  \n  if (Buf > EndBuf) throw std::string(\"Read past end of buffer.\");\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/ @author Michał Orynicz\n\n#include \"VisualOdometer.hpp\"\n#include \"BirdsEyeTranslationReader.hpp\"\n#include \"TangentRotationReader.hpp\"\n#include \"SmoothFilter.hpp\"\n#include \"TrimHistoryFilter.hpp\"\n#include \"LucasCandaePyramidTracker.hpp\"\n#include \"ShiThomasFeatureExtractor.hpp\"\n#include \"PreparationFunctions.hpp\"\n#include \"ConvenienceFunctions.hpp\"\n#include \"ErrorCodes.hpp\"\n#include \"DrawingFunctions.hpp\"\n\n#include \"opencv2\/core\/core.hpp\"\n#include \"opencv2\/imgproc\/imgproc.hpp\"\n#include \"opencv2\/highgui\/highgui.hpp\"\n#include \"opencv2\/calib3d\/calib3d.hpp\"\n\n#include <string>\n#include <vector>\n\nusing std::cerr;\nusing std::endl;\n\nint main() {\n\n    double qualityLevel = 0.01;\n    double minDistance = 10;\n    int blockSize = 5;\n    cv::Size winSizeShi(5, 5);\n    cv::Size zeroZone(-1, -1);\n    cv::TermCriteria termCritShi(CV_TERMCRIT_EPS + CV_TERMCRIT_ITER,\n            40, 0.0001);\n\n    cv::Size winSizeLuc(21, 21);\n    unsigned int maxLevel = 4;\n    int flagsLuc = 0;\n    cv::TermCriteria termCritLuc(CV_TERMCRIT_EPS + CV_TERMCRIT_ITER,\n            40, 0.0001);\n    double minEigThr = 1e-4;\n    double maxErrVal = 500;\n\n    cv::Mat homography;\n\n    cv::Size boardSize(9, 6);\n    cv::VideoCapture capture(1);\n\n    ShiThomasFeatureExtractor extractor(qualityLevel, minDistance,\n            blockSize, winSizeShi, zeroZone, termCritShi);\n    LucasCandaePyramidTracker tracker(winSizeLuc, maxLevel, flagsLuc,\n            termCritLuc, minEigThr, maxErrVal);\n\n    unsigned int maxFeatures = 500;\n    int maxHistoryLength = 9;\n    double maxDeviation = CV_PI \/ 16;\n    double maxDeviants = maxFeatures \/ 4;\n    double minLength = 10;\n    std::list<FeatureFilter*> filters;\n\n    filters.push_back(new TrimHistoryFilter(maxHistoryLength));\n    filters.push_back(\n            new SmoothFilter(maxDeviation, maxDeviants, minLength));\n\n    int horizon;\n    int deadZone;\n    int featuresNumber;\n\n    std::vector<cv::Mat> rectifyMaps;\n    cv::Size imageSize;\n\n    cv::Size winSizeHom(5, 5);\n    cv::Size zeroZoneHom(-1, -1);\n    cv::TermCriteria termCritHom(CV_TERMCRIT_EPS + CV_TERMCRIT_ITER,\n            40, 0.001);\n    float squareSize = 25;\n    std::list<cv::Point3f> positions;\n    cv::Point2f rotationCenter;\n    cv::Mat rtMatrix;\n    cv::Point3f currentPosition(0, 0, 0);\n    double margin = 5;\n\n    positions.push_back(currentPosition);\n    try {\n        cv::Mat cameraMatrix, distortionCoefficients;\n        getCameraParameters(\"..\/sphereAF.yml\", rectifyMaps,\n                cameraMatrix, distortionCoefficients, imageSize);\n        capture.set(CV_CAP_PROP_FRAME_WIDTH, imageSize.width);\n        capture.set(CV_CAP_PROP_FRAME_HEIGHT, imageSize.height);\n        horizon = imageSize.height \/ 2;\n        deadZone = 0;\n        calibrateParameters(capture, rectifyMaps, horizon, deadZone,\n                imageSize);\n        std::vector<cv::Point2f> corners = getChessboardCorners(\n                capture, rectifyMaps, horizon, deadZone, boardSize,\n                imageSize, winSizeHom, zeroZoneHom, termCritHom);\n        cerr << \"got corners\" << endl;\n        getHomographyRtMatrixAndRotationCenter(corners, imageSize,\n                boardSize, squareSize, horizon, deadZone,\n                cameraMatrix, distortionCoefficients,\n                chessboardHeight, homography, rotationCenter,\n                rtMatrix);\n\n        cerr << \"got transform and rt\" << endl;\n        printMatrix(cameraMatrix, true);\n        TangentRotationReader rotationReader(tracker, extractor,\n                filters, maxFeatures, cameraMatrix.at<double>(0, 0),\n                cv::Size(imageSize.width, horizon - deadZone),\n                margin);\n        BirdsEyeTranslationReader transReader(homography, extractor,\n                tracker, maxFeatures, filters, rotationCenter,\n                cv::Size(imageSize.width,\n                        imageSize.height - horizon - deadZone),\n                margin);\n        cerr << \"got birdy\" << endl;\n        VisualOdometer odo(rotationReader, transReader, horizon,\n                deadZone, featuresNumber);\n        cerr << \"got VO\" << endl;\n        char control = ' ';\n        cv::Mat input;\n        cv::Mat undistorted;\n        cv::Mat grey;\n        cv::namedWindow(\"main\", CV_WINDOW_KEEPRATIO);\n        cv::namedWindow(\"map\", CV_WINDOW_KEEPRATIO);\n        std::vector<std::list<cv::Point2f> > featuresRot;\n        std::vector<std::list<cv::Point2f> > featuresGround;\n\n        do {\n            cv::Point3f displacement;\n            capture >> input;\n            if (input.empty()) {\n                continue;\n            }\n\n            cv::remap(input, undistorted, rectifyMaps[0],\n                    rectifyMaps[1], cv::INTER_LINEAR);\n            cv::cvtColor(undistorted, grey, CV_RGB2GRAY);\n            displacement = odo.calculateDisplacement(grey);\n            currentPosition = currentPosition + displacement;\n            positions.push_front(currentPosition);\n            cv::Mat map = drawTraveledRoute(positions);\n\n            featuresRot = odo.getRotationFeatures();\n            featuresGround = odo.getTranslationFeatures();\n\n            drawFeaturesUpperAndLower(undistorted, featuresRot,\n                    cv::Mat(), featuresGround, homography, horizon,\n                    deadZone);\n            cv::imshow(\"map\", map);\n            cv::imshow(\"main\", input);\n            control = cv::waitKey(1);\n        } while ('q' != control);\n        cv::waitKey(0);\n        for (std::list<cv::Point3f>::iterator it = positions.begin();\n                positions.end() != it; ++it) {\n            std::cerr << *it << std::endl;\n        }\n    } catch (cv::Exception &ex) {\n        if (USER_TRIGGERED_EXIT == ex.code) {\n            return 0;\n        } else {\n            std::cerr << \"EXCEPTION!!!!!!!!!!!\" << std::endl\n                    << ex.what() << std::endl;\n            return 1;\n        }\n    }\n    return 0;\n}\n\nvoid checkPnPMethodStats(cv::VideoCapture &capture,\n        const std::vector<cv::Mat> &rectifyMaps, const int &horizon,\n        const int &deadZone, const cv::Size &boardSize,\n        const cv::Size &imageSize, const cv::Size &winSize,\n        const cv::Size &zeroZone, const cv::TermCriteria &termCrit,\n        const double &squareSize, const cv::Mat &cameraMatrix,\n        const cv::Mat & distortionCoefficients,\n        const double &chessboardHeight, const int & iterations,\n        cv::Point3d & mean, cv::Point3d & variance,\n        cv::Point3d & median, cv::Point3d &stdDev) {\n    std::vector<cv::Point3d> coords(iterations);\n    cv::Mat homography, rtMatrix;\n    cv::Point2d rotationCenter;\n    for (unsigned int i = 0; i < coords.size(); ++i) {\n        std::vector<cv::Point2f> corners = getChessboardCorners(\n                capture, rectifyMaps, horizon, deadZone, boardSize,\n                imageSize, winSize, zeroZone, termCrit);\n        getHomographyRtMatrixAndRotationCenter(corners, imageSize,\n                boardSize, squareSize, horizon, deadZone,\n                cameraMatrix, distortionCoefficients,\n                chessboardHeight, homography, rotationCenter,\n                rtMatrix);\n\n        coords[i] = cv::Point3d(rtMatrix.at<double>(0, 3),\n                rtMatrix.at<double>(1, 3), rtMatrix.at<double>(2, 3));\n    }\n    pointMeanAndVariance(coords, mean, variance);\n    stdDev = cv::Point3d(sqrt(variance.x), sqrt(variance.y),\n            sqrt(variance.y));\n\n}\n<commit_msg>Added a vertical line to displayed image in odoMain<commit_after>\/\/\/ @author Michał Orynicz\n\n#include \"VisualOdometer.hpp\"\n#include \"BirdsEyeTranslationReader.hpp\"\n#include \"TangentRotationReader.hpp\"\n#include \"SmoothFilter.hpp\"\n#include \"TrimHistoryFilter.hpp\"\n#include \"LucasCandaePyramidTracker.hpp\"\n#include \"ShiThomasFeatureExtractor.hpp\"\n#include \"PreparationFunctions.hpp\"\n#include \"ConvenienceFunctions.hpp\"\n#include \"ErrorCodes.hpp\"\n#include \"DrawingFunctions.hpp\"\n\n#include \"opencv2\/core\/core.hpp\"\n#include \"opencv2\/imgproc\/imgproc.hpp\"\n#include \"opencv2\/highgui\/highgui.hpp\"\n#include \"opencv2\/calib3d\/calib3d.hpp\"\n\n#include <string>\n#include <vector>\n\nusing std::cerr;\nusing std::endl;\n\nint main() {\n\n    double qualityLevel = 0.01;\n    double minDistance = 10;\n    int blockSize = 5;\n    cv::Size winSizeShi(5, 5);\n    cv::Size zeroZone(-1, -1);\n    cv::TermCriteria termCritShi(CV_TERMCRIT_EPS + CV_TERMCRIT_ITER,\n            40, 0.0001);\n\n    cv::Size winSizeLuc(21, 21);\n    unsigned int maxLevel = 4;\n    int flagsLuc = 0;\n    cv::TermCriteria termCritLuc(CV_TERMCRIT_EPS + CV_TERMCRIT_ITER,\n            40, 0.0001);\n    double minEigThr = 1e-4;\n    double maxErrVal = 500;\n\n    cv::Mat homography;\n\n    cv::Size boardSize(9, 6);\n    cv::VideoCapture capture(1);\n\n    ShiThomasFeatureExtractor extractor(qualityLevel, minDistance,\n            blockSize, winSizeShi, zeroZone, termCritShi);\n    LucasCandaePyramidTracker tracker(winSizeLuc, maxLevel, flagsLuc,\n            termCritLuc, minEigThr, maxErrVal);\n\n    unsigned int maxFeatures = 500;\n    int maxHistoryLength = 9;\n    double maxDeviation = CV_PI \/ 16;\n    double maxDeviants = maxFeatures \/ 4;\n    double minLength = 10;\n    std::list<FeatureFilter*> filters;\n\n    filters.push_back(new TrimHistoryFilter(maxHistoryLength));\n    filters.push_back(\n            new SmoothFilter(maxDeviation, maxDeviants, minLength));\n\n    int horizon;\n    int deadZone;\n    int featuresNumber;\n\n    std::vector<cv::Mat> rectifyMaps;\n    cv::Size imageSize;\n\n    cv::Size winSizeHom(5, 5);\n    cv::Size zeroZoneHom(-1, -1);\n    cv::TermCriteria termCritHom(CV_TERMCRIT_EPS + CV_TERMCRIT_ITER,\n            40, 0.001);\n    float squareSize = 25;\n    std::list<cv::Point3f> positions;\n    cv::Point2f rotationCenter;\n    cv::Mat rtMatrix;\n    cv::Point3f currentPosition(0, 0, 0);\n    double margin = 5;\n\n    positions.push_back(currentPosition);\n    try {\n        cv::Mat cameraMatrix, distortionCoefficients;\n        getCameraParameters(\"..\/sphereAF.yml\", rectifyMaps,\n                cameraMatrix, distortionCoefficients, imageSize);\n        capture.set(CV_CAP_PROP_FRAME_WIDTH, imageSize.width);\n        capture.set(CV_CAP_PROP_FRAME_HEIGHT, imageSize.height);\n        horizon = imageSize.height \/ 2;\n        deadZone = 0;\n        calibrateParameters(capture, rectifyMaps, horizon, deadZone,\n                imageSize);\n        std::vector<cv::Point2f> corners = getChessboardCorners(\n                capture, rectifyMaps, horizon, deadZone, boardSize,\n                imageSize, winSizeHom, zeroZoneHom, termCritHom);\n        cerr << \"got corners\" << endl;\n        getHomographyRtMatrixAndRotationCenter(corners, imageSize,\n                boardSize, squareSize, horizon, deadZone,\n                cameraMatrix, distortionCoefficients,\n                chessboardHeight, homography, rotationCenter,\n                rtMatrix);\n\n        cerr << \"got transform and rt\" << endl;\n        printMatrix(cameraMatrix, true);\n        TangentRotationReader rotationReader(tracker, extractor,\n                filters, maxFeatures, cameraMatrix.at<double>(0, 0),\n                cv::Size(imageSize.width, horizon - deadZone),\n                margin);\n        BirdsEyeTranslationReader transReader(homography, extractor,\n                tracker, maxFeatures, filters, rotationCenter,\n                cv::Size(imageSize.width,\n                        imageSize.height - horizon - deadZone),\n                margin);\n        cerr << \"got birdy\" << endl;\n        VisualOdometer odo(rotationReader, transReader, horizon,\n                deadZone, featuresNumber);\n        cerr << \"got VO\" << endl;\n        char control = ' ';\n        cv::Mat input;\n        cv::Mat undistorted;\n        cv::Mat grey;\n        cv::namedWindow(\"main\", CV_WINDOW_KEEPRATIO);\n        cv::namedWindow(\"map\", CV_WINDOW_KEEPRATIO);\n        std::vector<std::list<cv::Point2f> > featuresRot;\n        std::vector<std::list<cv::Point2f> > featuresGround;\n\n        do {\n            cv::Point3f displacement;\n            capture >> input;\n            if (input.empty()) {\n                continue;\n            }\n\n            cv::remap(input, undistorted, rectifyMaps[0],\n                    rectifyMaps[1], cv::INTER_LINEAR);\n            cv::cvtColor(undistorted, grey, CV_RGB2GRAY);\n            displacement = odo.calculateDisplacement(grey);\n            currentPosition = currentPosition + displacement;\n            positions.push_front(currentPosition);\n            cv::Mat map = drawTraveledRoute(positions);\n\n            featuresRot = odo.getRotationFeatures();\n            featuresGround = odo.getTranslationFeatures();\n\n            drawFeaturesUpperAndLower(undistorted, featuresRot,\n                    cv::Mat(), featuresGround, homography, horizon,\n                    deadZone);\n            cv::line(input, cv::Point(imageSize.width \/ 2, 0),\n                    cv::Point(imageSize.width \/ 2, imageSize.height),\n                    CV_RGB(255,0,0), 1, 8, 0);\n            cv::imshow(\"map\", map);\n            cv::imshow(\"main\", undistorted);\n            control = cv::waitKey(1);\n        } while ('q' != control);\n        cv::waitKey(0);\n        for (std::list<cv::Point3f>::iterator it = positions.begin();\n                positions.end() != it; ++it) {\n            std::cerr << *it << std::endl;\n        }\n    } catch (cv::Exception &ex) {\n        if (USER_TRIGGERED_EXIT == ex.code) {\n            return 0;\n        } else {\n            std::cerr << \"EXCEPTION!!!!!!!!!!!\" << std::endl\n                    << ex.what() << std::endl;\n            return 1;\n        }\n    }\n    return 0;\n}\n\nvoid checkPnPMethodStats(cv::VideoCapture &capture,\n        const std::vector<cv::Mat> &rectifyMaps, const int &horizon,\n        const int &deadZone, const cv::Size &boardSize,\n        const cv::Size &imageSize, const cv::Size &winSize,\n        const cv::Size &zeroZone, const cv::TermCriteria &termCrit,\n        const double &squareSize, const cv::Mat &cameraMatrix,\n        const cv::Mat & distortionCoefficients,\n        const double &chessboardHeight, const int & iterations,\n        cv::Point3d & mean, cv::Point3d & variance,\n        cv::Point3d & median, cv::Point3d &stdDev) {\n    std::vector<cv::Point3d> coords(iterations);\n    cv::Mat homography, rtMatrix;\n    cv::Point2d rotationCenter;\n    for (unsigned int i = 0; i < coords.size(); ++i) {\n        std::vector<cv::Point2f> corners = getChessboardCorners(\n                capture, rectifyMaps, horizon, deadZone, boardSize,\n                imageSize, winSize, zeroZone, termCrit);\n        getHomographyRtMatrixAndRotationCenter(corners, imageSize,\n                boardSize, squareSize, horizon, deadZone,\n                cameraMatrix, distortionCoefficients,\n                chessboardHeight, homography, rotationCenter,\n                rtMatrix);\n\n        coords[i] = cv::Point3d(rtMatrix.at<double>(0, 3),\n                rtMatrix.at<double>(1, 3), rtMatrix.at<double>(2, 3));\n    }\n    pointMeanAndVariance(coords, mean, variance);\n    stdDev = cv::Point3d(sqrt(variance.x), sqrt(variance.y),\n            sqrt(variance.y));\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- MachineCopyPropagation.cpp - Machine Copy Propagation Pass ---------===\/\/\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 an extremely simple MachineInstr-level copy propagation pass.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#define DEBUG_TYPE \"codegen-cp\"\n#include \"llvm\/CodeGen\/Passes.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/CodeGen\/MachineFunction.h\"\n#include \"llvm\/CodeGen\/MachineFunctionPass.h\"\n#include \"llvm\/Target\/TargetRegisterInfo.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/ErrorHandling.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/ADT\/BitVector.h\"\n#include \"llvm\/ADT\/DenseMap.h\"\n#include \"llvm\/ADT\/DenseSet.h\"\n#include \"llvm\/ADT\/SetVector.h\"\n#include \"llvm\/ADT\/SmallVector.h\"\n#include \"llvm\/ADT\/Statistic.h\"\nusing namespace llvm;\n\nSTATISTIC(NumDeletes, \"Number of dead copies deleted\");\n\nnamespace {\n  class MachineCopyPropagation : public MachineFunctionPass {\n    const TargetRegisterInfo *TRI;\n    BitVector ReservedRegs;\n\n  public:\n    static char ID; \/\/ Pass identification, replacement for typeid\n    MachineCopyPropagation() : MachineFunctionPass(ID) {\n     initializeMachineCopyPropagationPass(*PassRegistry::getPassRegistry());\n    }\n\n    virtual bool runOnMachineFunction(MachineFunction &MF);\n\n  private:\n    void SourceNoLongerAvailable(unsigned Reg,\n                                 DenseMap<unsigned, DenseSet<unsigned> > &SrcMap,\n                               DenseMap<unsigned, MachineInstr*> &AvailCopyMap);\n    bool CopyPropagateBlock(MachineBasicBlock &MBB);\n  };\n}\nchar MachineCopyPropagation::ID = 0;\nchar &llvm::MachineCopyPropagationID = MachineCopyPropagation::ID;\n\nINITIALIZE_PASS(MachineCopyPropagation, \"machine-cp\",\n                \"Machine Copy Propagation Pass\", false, false)\n\nvoid\nMachineCopyPropagation::SourceNoLongerAvailable(unsigned Reg,\n                              DenseMap<unsigned, DenseSet<unsigned> > &SrcMap,\n                              DenseMap<unsigned, MachineInstr*> &AvailCopyMap) {\n  DenseMap<unsigned, DenseSet<unsigned> >::iterator SI = SrcMap.find(Reg);\n  if (SI != SrcMap.end()) {\n    const DenseSet<unsigned>& Defs = SI->second;\n    for (DenseSet<unsigned>::const_iterator I = Defs.begin(), E = Defs.end();\n         I != E; ++I) {\n      unsigned MappedDef = *I;\n      \/\/ Source of copy is no longer available for propagation.\n      if (AvailCopyMap.erase(MappedDef)) {\n        for (const uint16_t *SR = TRI->getSubRegisters(MappedDef); *SR; ++SR)\n          AvailCopyMap.erase(*SR);\n      }\n    }\n  }\n  for (const uint16_t *AS = TRI->getAliasSet(Reg); *AS; ++AS) {\n    SI = SrcMap.find(*AS);\n    if (SI != SrcMap.end()) {\n      const DenseSet<unsigned>& Defs = SI->second;\n      for (DenseSet<unsigned>::const_iterator I = Defs.begin(), E = Defs.end();\n           I != E; ++I) {\n        unsigned MappedDef = *I;\n        if (AvailCopyMap.erase(MappedDef)) {\n          for (const uint16_t *SR = TRI->getSubRegisters(MappedDef); *SR; ++SR)\n            AvailCopyMap.erase(*SR);\n        }\n      }\n    }\n  }\n}\n\nstatic bool NoInterveningSideEffect(const MachineInstr *CopyMI,\n                                    const MachineInstr *MI) {\n  const MachineBasicBlock *MBB = CopyMI->getParent();\n  if (MI->getParent() != MBB)\n    return false;\n  MachineBasicBlock::const_iterator I = CopyMI;\n  MachineBasicBlock::const_iterator E = MBB->end();\n  MachineBasicBlock::const_iterator E2 = MI;\n\n  ++I;\n  while (I != E && I != E2) {\n    if (I->hasUnmodeledSideEffects() || I->isCall() ||\n        I->isTerminator())\n      return false;\n    ++I;\n  }\n  return true;\n}\n\n\/\/\/ isNopCopy - Return true if the specified copy is really a nop. That is\n\/\/\/ if the source of the copy is the same of the definition of the copy that\n\/\/\/ supplied the source. If the source of the copy is a sub-register than it\n\/\/\/ must check the sub-indices match. e.g.\n\/\/\/ ecx = mov eax\n\/\/\/ al  = mov cl\n\/\/\/ But not\n\/\/\/ ecx = mov eax\n\/\/\/ al  = mov ch\nstatic bool isNopCopy(MachineInstr *CopyMI, unsigned Def, unsigned Src,\n                      const TargetRegisterInfo *TRI) {\n  unsigned SrcSrc = CopyMI->getOperand(1).getReg();\n  if (Def == SrcSrc)\n    return true;\n  if (TRI->isSubRegister(SrcSrc, Def)) {\n    unsigned SrcDef = CopyMI->getOperand(0).getReg();\n    unsigned SubIdx = TRI->getSubRegIndex(SrcSrc, Def);\n    if (!SubIdx)\n      return false;\n    return SubIdx == TRI->getSubRegIndex(SrcDef, Src);\n  }\n\n  return false;\n}\n\nbool MachineCopyPropagation::CopyPropagateBlock(MachineBasicBlock &MBB) {\n  SmallSetVector<MachineInstr*, 8> MaybeDeadCopies;  \/\/ Candidates for deletion\n  DenseMap<unsigned, MachineInstr*> AvailCopyMap;    \/\/ Def -> available copies map\n  DenseMap<unsigned, MachineInstr*> CopyMap;         \/\/ Def -> copies map\n  DenseMap<unsigned, DenseSet<unsigned> > SrcMap; \/\/ Src -> Def map\n\n  bool Changed = false;\n  for (MachineBasicBlock::iterator I = MBB.begin(), E = MBB.end(); I != E; ) {\n    MachineInstr *MI = &*I;\n    ++I;\n\n    if (MI->isCopy()) {\n      unsigned Def = MI->getOperand(0).getReg();\n      unsigned Src = MI->getOperand(1).getReg();\n\n      if (TargetRegisterInfo::isVirtualRegister(Def) ||\n          TargetRegisterInfo::isVirtualRegister(Src))\n        report_fatal_error(\"MachineCopyPropagation should be run after\"\n                           \" register allocation!\");\n\n      DenseMap<unsigned, MachineInstr*>::iterator CI = AvailCopyMap.find(Src);\n      if (CI != AvailCopyMap.end()) {\n        MachineInstr *CopyMI = CI->second;\n        if (!ReservedRegs.test(Def) &&\n            (!ReservedRegs.test(Src) || NoInterveningSideEffect(CopyMI, MI)) &&\n            isNopCopy(CopyMI, Def, Src, TRI)) {\n          \/\/ The two copies cancel out and the source of the first copy\n          \/\/ hasn't been overridden, eliminate the second one. e.g.\n          \/\/  %ECX<def> = COPY %EAX<kill>\n          \/\/  ... nothing clobbered EAX.\n          \/\/  %EAX<def> = COPY %ECX\n          \/\/ =>\n          \/\/  %ECX<def> = COPY %EAX\n          \/\/\n          \/\/ Also avoid eliminating a copy from reserved registers unless the\n          \/\/ definition is proven not clobbered. e.g.\n          \/\/ %RSP<def> = COPY %RAX\n          \/\/ CALL\n          \/\/ %RAX<def> = COPY %RSP\n\n          \/\/ Clear any kills of Def between CopyMI and MI. This extends the\n          \/\/ live range.\n          for (MachineBasicBlock::iterator I = CopyMI, E = MI; I != E; ++I)\n            I->clearRegisterKills(Def, TRI);\n\n          MI->eraseFromParent();\n          Changed = true;\n          ++NumDeletes;\n          continue;\n        }\n      }\n\n      \/\/ If Src is defined by a previous copy, it cannot be eliminated.\n      CI = CopyMap.find(Src);\n      if (CI != CopyMap.end())\n        MaybeDeadCopies.remove(CI->second);\n      for (const uint16_t *AS = TRI->getAliasSet(Src); *AS; ++AS) {\n        CI = CopyMap.find(*AS);\n        if (CI != CopyMap.end())\n          MaybeDeadCopies.remove(CI->second);\n      }\n\n      \/\/ Copy is now a candidate for deletion.\n      MaybeDeadCopies.insert(MI);\n\n      \/\/ If 'Src' is previously source of another copy, then this earlier copy's\n      \/\/ source is no longer available. e.g.\n      \/\/ %xmm9<def> = copy %xmm2\n      \/\/ ...\n      \/\/ %xmm2<def> = copy %xmm0\n      \/\/ ...\n      \/\/ %xmm2<def> = copy %xmm9\n      SourceNoLongerAvailable(Def, SrcMap, AvailCopyMap);\n\n      \/\/ Remember Def is defined by the copy.\n      \/\/ ... Make sure to clear the def maps of aliases first.\n      for (const uint16_t *AS = TRI->getAliasSet(Def); *AS; ++AS) {\n        CopyMap.erase(*AS);\n        AvailCopyMap.erase(*AS);\n      }\n      CopyMap[Def] = MI;\n      AvailCopyMap[Def] = MI;\n      for (const uint16_t *SR = TRI->getSubRegisters(Def); *SR; ++SR) {\n        CopyMap[*SR] = MI;\n        AvailCopyMap[*SR] = MI;\n      }\n\n      \/\/ Remember source that's copied to Def. Once it's clobbered, then\n      \/\/ it's no longer available for copy propagation.\n      SrcMap[Src].insert(Def);\n\n      continue;\n    }\n\n    \/\/ Not a copy.\n    SmallVector<unsigned, 2> Defs;\n    int RegMaskOpNum = -1;\n    for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {\n      MachineOperand &MO = MI->getOperand(i);\n      if (MO.isRegMask())\n        RegMaskOpNum = i;\n      if (!MO.isReg())\n        continue;\n      unsigned Reg = MO.getReg();\n      if (!Reg)\n        continue;\n\n      if (TargetRegisterInfo::isVirtualRegister(Reg))\n        report_fatal_error(\"MachineCopyPropagation should be run after\"\n                           \" register allocation!\");\n\n      if (MO.isDef()) {\n        Defs.push_back(Reg);\n        continue;\n      }\n\n      \/\/ If 'Reg' is defined by a copy, the copy is no longer a candidate\n      \/\/ for elimination.\n      DenseMap<unsigned, MachineInstr*>::iterator CI = CopyMap.find(Reg);\n      if (CI != CopyMap.end())\n        MaybeDeadCopies.remove(CI->second);\n      for (const uint16_t *AS = TRI->getAliasSet(Reg); *AS; ++AS) {\n        CI = CopyMap.find(*AS);\n        if (CI != CopyMap.end())\n          MaybeDeadCopies.remove(CI->second);\n      }\n    }\n\n    \/\/ The instruction has a register mask operand which means that it clobbers\n    \/\/ a large set of registers.  It is possible to use the register mask to\n    \/\/ prune the available copies, but treat it like a basic block boundary for\n    \/\/ now.\n    if (RegMaskOpNum >= 0) {\n      \/\/ Erase any MaybeDeadCopies whose destination register is clobbered.\n      const MachineOperand &MaskMO = MI->getOperand(RegMaskOpNum);\n      for (SmallSetVector<MachineInstr*, 8>::iterator\n           DI = MaybeDeadCopies.begin(), DE = MaybeDeadCopies.end();\n           DI != DE; ++DI) {\n        unsigned Reg = (*DI)->getOperand(0).getReg();\n        if (ReservedRegs.test(Reg) || !MaskMO.clobbersPhysReg(Reg))\n          continue;\n        (*DI)->eraseFromParent();\n        Changed = true;\n        ++NumDeletes;\n      }\n\n      \/\/ Clear all data structures as if we were beginning a new basic block.\n      MaybeDeadCopies.clear();\n      AvailCopyMap.clear();\n      CopyMap.clear();\n      SrcMap.clear();\n      continue;\n    }\n\n    for (unsigned i = 0, e = Defs.size(); i != e; ++i) {\n      unsigned Reg = Defs[i];\n\n      \/\/ No longer defined by a copy.\n      CopyMap.erase(Reg);\n      AvailCopyMap.erase(Reg);\n      for (const uint16_t *AS = TRI->getAliasSet(Reg); *AS; ++AS) {\n        CopyMap.erase(*AS);\n        AvailCopyMap.erase(*AS);\n      }\n\n      \/\/ If 'Reg' is previously source of a copy, it is no longer available for\n      \/\/ copy propagation.\n      SourceNoLongerAvailable(Reg, SrcMap, AvailCopyMap);\n    }\n  }\n\n  \/\/ If MBB doesn't have successors, delete the copies whose defs are not used.\n  \/\/ If MBB does have successors, then conservative assume the defs are live-out\n  \/\/ since we don't want to trust live-in lists.\n  if (MBB.succ_empty()) {\n    for (SmallSetVector<MachineInstr*, 8>::iterator\n           DI = MaybeDeadCopies.begin(), DE = MaybeDeadCopies.end();\n         DI != DE; ++DI) {\n      if (!ReservedRegs.test((*DI)->getOperand(0).getReg())) {\n        (*DI)->eraseFromParent();\n        Changed = true;\n        ++NumDeletes;\n      }\n    }\n  }\n\n  return Changed;\n}\n\nbool MachineCopyPropagation::runOnMachineFunction(MachineFunction &MF) {\n  bool Changed = false;\n\n  TRI = MF.getTarget().getRegisterInfo();\n  ReservedRegs = TRI->getReservedRegs(MF);\n\n  for (MachineFunction::iterator I = MF.begin(), E = MF.end(); I != E; ++I)\n    Changed |= CopyPropagateBlock(*I);\n\n  return Changed;\n}\n<commit_msg>Use a SmallVector and linear lookup instead of a DenseSet - SourceMap values will always be tiny sets, so DenseSet is overkill (SmallSet won't work as we need iteration support). <commit_after>\/\/===- MachineCopyPropagation.cpp - Machine Copy Propagation Pass ---------===\/\/\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 an extremely simple MachineInstr-level copy propagation pass.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#define DEBUG_TYPE \"codegen-cp\"\n#include \"llvm\/CodeGen\/Passes.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/CodeGen\/MachineFunction.h\"\n#include \"llvm\/CodeGen\/MachineFunctionPass.h\"\n#include \"llvm\/Target\/TargetRegisterInfo.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/ErrorHandling.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/ADT\/BitVector.h\"\n#include \"llvm\/ADT\/DenseMap.h\"\n#include \"llvm\/ADT\/SetVector.h\"\n#include \"llvm\/ADT\/SmallVector.h\"\n#include \"llvm\/ADT\/Statistic.h\"\nusing namespace llvm;\n\nSTATISTIC(NumDeletes, \"Number of dead copies deleted\");\n\nnamespace {\n  class MachineCopyPropagation : public MachineFunctionPass {\n    const TargetRegisterInfo *TRI;\n    BitVector ReservedRegs;\n\n  public:\n    static char ID; \/\/ Pass identification, replacement for typeid\n    MachineCopyPropagation() : MachineFunctionPass(ID) {\n     initializeMachineCopyPropagationPass(*PassRegistry::getPassRegistry());\n    }\n\n    virtual bool runOnMachineFunction(MachineFunction &MF);\n\n  private:\n    typedef SmallVector<unsigned, 4> DestList;\n    typedef DenseMap<unsigned, DestList> SourceMap;\n\n    void SourceNoLongerAvailable(unsigned Reg,\n                                 SourceMap &SrcMap,\n                                 DenseMap<unsigned, MachineInstr*> &AvailCopyMap);\n    bool CopyPropagateBlock(MachineBasicBlock &MBB);\n  };\n}\nchar MachineCopyPropagation::ID = 0;\nchar &llvm::MachineCopyPropagationID = MachineCopyPropagation::ID;\n\nINITIALIZE_PASS(MachineCopyPropagation, \"machine-cp\",\n                \"Machine Copy Propagation Pass\", false, false)\n\nvoid\nMachineCopyPropagation::SourceNoLongerAvailable(unsigned Reg,\n                              SourceMap &SrcMap,\n                              DenseMap<unsigned, MachineInstr*> &AvailCopyMap) {\n  SourceMap::iterator SI = SrcMap.find(Reg);\n  if (SI != SrcMap.end()) {\n    const DestList& Defs = SI->second;\n    for (DestList::const_iterator I = Defs.begin(), E = Defs.end();\n         I != E; ++I) {\n      unsigned MappedDef = *I;\n      \/\/ Source of copy is no longer available for propagation.\n      if (AvailCopyMap.erase(MappedDef)) {\n        for (const uint16_t *SR = TRI->getSubRegisters(MappedDef); *SR; ++SR)\n          AvailCopyMap.erase(*SR);\n      }\n    }\n  }\n  for (const uint16_t *AS = TRI->getAliasSet(Reg); *AS; ++AS) {\n    SI = SrcMap.find(*AS);\n    if (SI != SrcMap.end()) {\n      const DestList& Defs = SI->second;\n      for (DestList::const_iterator I = Defs.begin(), E = Defs.end();\n           I != E; ++I) {\n        unsigned MappedDef = *I;\n        if (AvailCopyMap.erase(MappedDef)) {\n          for (const uint16_t *SR = TRI->getSubRegisters(MappedDef); *SR; ++SR)\n            AvailCopyMap.erase(*SR);\n        }\n      }\n    }\n  }\n}\n\nstatic bool NoInterveningSideEffect(const MachineInstr *CopyMI,\n                                    const MachineInstr *MI) {\n  const MachineBasicBlock *MBB = CopyMI->getParent();\n  if (MI->getParent() != MBB)\n    return false;\n  MachineBasicBlock::const_iterator I = CopyMI;\n  MachineBasicBlock::const_iterator E = MBB->end();\n  MachineBasicBlock::const_iterator E2 = MI;\n\n  ++I;\n  while (I != E && I != E2) {\n    if (I->hasUnmodeledSideEffects() || I->isCall() ||\n        I->isTerminator())\n      return false;\n    ++I;\n  }\n  return true;\n}\n\n\/\/\/ isNopCopy - Return true if the specified copy is really a nop. That is\n\/\/\/ if the source of the copy is the same of the definition of the copy that\n\/\/\/ supplied the source. If the source of the copy is a sub-register than it\n\/\/\/ must check the sub-indices match. e.g.\n\/\/\/ ecx = mov eax\n\/\/\/ al  = mov cl\n\/\/\/ But not\n\/\/\/ ecx = mov eax\n\/\/\/ al  = mov ch\nstatic bool isNopCopy(MachineInstr *CopyMI, unsigned Def, unsigned Src,\n                      const TargetRegisterInfo *TRI) {\n  unsigned SrcSrc = CopyMI->getOperand(1).getReg();\n  if (Def == SrcSrc)\n    return true;\n  if (TRI->isSubRegister(SrcSrc, Def)) {\n    unsigned SrcDef = CopyMI->getOperand(0).getReg();\n    unsigned SubIdx = TRI->getSubRegIndex(SrcSrc, Def);\n    if (!SubIdx)\n      return false;\n    return SubIdx == TRI->getSubRegIndex(SrcDef, Src);\n  }\n\n  return false;\n}\n\nbool MachineCopyPropagation::CopyPropagateBlock(MachineBasicBlock &MBB) {\n  SmallSetVector<MachineInstr*, 8> MaybeDeadCopies;  \/\/ Candidates for deletion\n  DenseMap<unsigned, MachineInstr*> AvailCopyMap;    \/\/ Def -> available copies map\n  DenseMap<unsigned, MachineInstr*> CopyMap;         \/\/ Def -> copies map\n  SourceMap SrcMap; \/\/ Src -> Def map\n\n  bool Changed = false;\n  for (MachineBasicBlock::iterator I = MBB.begin(), E = MBB.end(); I != E; ) {\n    MachineInstr *MI = &*I;\n    ++I;\n\n    if (MI->isCopy()) {\n      unsigned Def = MI->getOperand(0).getReg();\n      unsigned Src = MI->getOperand(1).getReg();\n\n      if (TargetRegisterInfo::isVirtualRegister(Def) ||\n          TargetRegisterInfo::isVirtualRegister(Src))\n        report_fatal_error(\"MachineCopyPropagation should be run after\"\n                           \" register allocation!\");\n\n      DenseMap<unsigned, MachineInstr*>::iterator CI = AvailCopyMap.find(Src);\n      if (CI != AvailCopyMap.end()) {\n        MachineInstr *CopyMI = CI->second;\n        if (!ReservedRegs.test(Def) &&\n            (!ReservedRegs.test(Src) || NoInterveningSideEffect(CopyMI, MI)) &&\n            isNopCopy(CopyMI, Def, Src, TRI)) {\n          \/\/ The two copies cancel out and the source of the first copy\n          \/\/ hasn't been overridden, eliminate the second one. e.g.\n          \/\/  %ECX<def> = COPY %EAX<kill>\n          \/\/  ... nothing clobbered EAX.\n          \/\/  %EAX<def> = COPY %ECX\n          \/\/ =>\n          \/\/  %ECX<def> = COPY %EAX\n          \/\/\n          \/\/ Also avoid eliminating a copy from reserved registers unless the\n          \/\/ definition is proven not clobbered. e.g.\n          \/\/ %RSP<def> = COPY %RAX\n          \/\/ CALL\n          \/\/ %RAX<def> = COPY %RSP\n\n          \/\/ Clear any kills of Def between CopyMI and MI. This extends the\n          \/\/ live range.\n          for (MachineBasicBlock::iterator I = CopyMI, E = MI; I != E; ++I)\n            I->clearRegisterKills(Def, TRI);\n\n          MI->eraseFromParent();\n          Changed = true;\n          ++NumDeletes;\n          continue;\n        }\n      }\n\n      \/\/ If Src is defined by a previous copy, it cannot be eliminated.\n      CI = CopyMap.find(Src);\n      if (CI != CopyMap.end())\n        MaybeDeadCopies.remove(CI->second);\n      for (const uint16_t *AS = TRI->getAliasSet(Src); *AS; ++AS) {\n        CI = CopyMap.find(*AS);\n        if (CI != CopyMap.end())\n          MaybeDeadCopies.remove(CI->second);\n      }\n\n      \/\/ Copy is now a candidate for deletion.\n      MaybeDeadCopies.insert(MI);\n\n      \/\/ If 'Src' is previously source of another copy, then this earlier copy's\n      \/\/ source is no longer available. e.g.\n      \/\/ %xmm9<def> = copy %xmm2\n      \/\/ ...\n      \/\/ %xmm2<def> = copy %xmm0\n      \/\/ ...\n      \/\/ %xmm2<def> = copy %xmm9\n      SourceNoLongerAvailable(Def, SrcMap, AvailCopyMap);\n\n      \/\/ Remember Def is defined by the copy.\n      \/\/ ... Make sure to clear the def maps of aliases first.\n      for (const uint16_t *AS = TRI->getAliasSet(Def); *AS; ++AS) {\n        CopyMap.erase(*AS);\n        AvailCopyMap.erase(*AS);\n      }\n      CopyMap[Def] = MI;\n      AvailCopyMap[Def] = MI;\n      for (const uint16_t *SR = TRI->getSubRegisters(Def); *SR; ++SR) {\n        CopyMap[*SR] = MI;\n        AvailCopyMap[*SR] = MI;\n      }\n\n      \/\/ Remember source that's copied to Def. Once it's clobbered, then\n      \/\/ it's no longer available for copy propagation.\n      if (std::find(SrcMap[Src].begin(), SrcMap[Src].end(), Def) ==\n          SrcMap[Src].end()) {\n        SrcMap[Src].push_back(Def);\n      }\n\n      continue;\n    }\n\n    \/\/ Not a copy.\n    SmallVector<unsigned, 2> Defs;\n    int RegMaskOpNum = -1;\n    for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {\n      MachineOperand &MO = MI->getOperand(i);\n      if (MO.isRegMask())\n        RegMaskOpNum = i;\n      if (!MO.isReg())\n        continue;\n      unsigned Reg = MO.getReg();\n      if (!Reg)\n        continue;\n\n      if (TargetRegisterInfo::isVirtualRegister(Reg))\n        report_fatal_error(\"MachineCopyPropagation should be run after\"\n                           \" register allocation!\");\n\n      if (MO.isDef()) {\n        Defs.push_back(Reg);\n        continue;\n      }\n\n      \/\/ If 'Reg' is defined by a copy, the copy is no longer a candidate\n      \/\/ for elimination.\n      DenseMap<unsigned, MachineInstr*>::iterator CI = CopyMap.find(Reg);\n      if (CI != CopyMap.end())\n        MaybeDeadCopies.remove(CI->second);\n      for (const uint16_t *AS = TRI->getAliasSet(Reg); *AS; ++AS) {\n        CI = CopyMap.find(*AS);\n        if (CI != CopyMap.end())\n          MaybeDeadCopies.remove(CI->second);\n      }\n    }\n\n    \/\/ The instruction has a register mask operand which means that it clobbers\n    \/\/ a large set of registers.  It is possible to use the register mask to\n    \/\/ prune the available copies, but treat it like a basic block boundary for\n    \/\/ now.\n    if (RegMaskOpNum >= 0) {\n      \/\/ Erase any MaybeDeadCopies whose destination register is clobbered.\n      const MachineOperand &MaskMO = MI->getOperand(RegMaskOpNum);\n      for (SmallSetVector<MachineInstr*, 8>::iterator\n           DI = MaybeDeadCopies.begin(), DE = MaybeDeadCopies.end();\n           DI != DE; ++DI) {\n        unsigned Reg = (*DI)->getOperand(0).getReg();\n        if (ReservedRegs.test(Reg) || !MaskMO.clobbersPhysReg(Reg))\n          continue;\n        (*DI)->eraseFromParent();\n        Changed = true;\n        ++NumDeletes;\n      }\n\n      \/\/ Clear all data structures as if we were beginning a new basic block.\n      MaybeDeadCopies.clear();\n      AvailCopyMap.clear();\n      CopyMap.clear();\n      SrcMap.clear();\n      continue;\n    }\n\n    for (unsigned i = 0, e = Defs.size(); i != e; ++i) {\n      unsigned Reg = Defs[i];\n\n      \/\/ No longer defined by a copy.\n      CopyMap.erase(Reg);\n      AvailCopyMap.erase(Reg);\n      for (const uint16_t *AS = TRI->getAliasSet(Reg); *AS; ++AS) {\n        CopyMap.erase(*AS);\n        AvailCopyMap.erase(*AS);\n      }\n\n      \/\/ If 'Reg' is previously source of a copy, it is no longer available for\n      \/\/ copy propagation.\n      SourceNoLongerAvailable(Reg, SrcMap, AvailCopyMap);\n    }\n  }\n\n  \/\/ If MBB doesn't have successors, delete the copies whose defs are not used.\n  \/\/ If MBB does have successors, then conservative assume the defs are live-out\n  \/\/ since we don't want to trust live-in lists.\n  if (MBB.succ_empty()) {\n    for (SmallSetVector<MachineInstr*, 8>::iterator\n           DI = MaybeDeadCopies.begin(), DE = MaybeDeadCopies.end();\n         DI != DE; ++DI) {\n      if (!ReservedRegs.test((*DI)->getOperand(0).getReg())) {\n        (*DI)->eraseFromParent();\n        Changed = true;\n        ++NumDeletes;\n      }\n    }\n  }\n\n  return Changed;\n}\n\nbool MachineCopyPropagation::runOnMachineFunction(MachineFunction &MF) {\n  bool Changed = false;\n\n  TRI = MF.getTarget().getRegisterInfo();\n  ReservedRegs = TRI->getReservedRegs(MF);\n\n  for (MachineFunction::iterator I = MF.begin(), E = MF.end(); I != E; ++I)\n    Changed |= CopyPropagateBlock(*I);\n\n  return Changed;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**************************************************************************\n *\n * Copyright 2014 Valve Software. 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 *************************************************************************\/\nextern \"C\" {\n#include \"glv_trace_packet_utils.h\"\n#include \"glvtrace_xgl_packet_id.h\"\n}\n\n#include \"glvdebug_xgl_settings.h\"\n#include \"glvdebug_xgl_qcontroller.h\"\n\n#include <assert.h>\n#include <QFileInfo>\n#include <QWidget>\n#include <QToolButton>\n#include <QCoreApplication>\n#include <QProcess>\n\n#include \"glvdebug_view.h\"\n#include \"glvreplay_seq.h\"\n\nglvdebug_xgl_QController::glvdebug_xgl_QController()\n    : m_pView(NULL),\n      m_pTraceFileInfo(NULL),\n      m_pDrawStateDiagram(NULL),\n      m_pCommandBuffersDiagram(NULL),\n      m_pReplayWidget(NULL),\n      m_pTraceFileModel(NULL)\n{\n    initialize_default_settings();\n    glv_SettingGroup_reset_defaults(&g_xglDebugSettingGroup);\n}\n\nglvdebug_xgl_QController::~glvdebug_xgl_QController()\n{\n}\n\nglv_trace_packet_header* glvdebug_xgl_QController::InterpretTracePacket(glv_trace_packet_header* pHeader)\n{\n    \/\/ Attempt to interpret the packet as an XGL packet\n    glv_trace_packet_header* pInterpretedHeader = interpret_trace_packet_xgl(pHeader);\n    if (pInterpretedHeader == NULL)\n    {\n        glv_LogWarn(\"Unrecognized XGL packet_id: %u\\n\", pHeader->packet_id);\n    }\n\n    return pInterpretedHeader;\n}\n\nbool glvdebug_xgl_QController::LoadTraceFile(glvdebug_trace_file_info* pTraceFileInfo, glvdebug_view* pView)\n{\n    assert(pTraceFileInfo != NULL);\n    assert(pView != NULL);\n    setView(pView);\n    m_pTraceFileInfo = pTraceFileInfo;\n\n    assert(m_pReplayWidget == NULL);\n    m_pReplayWidget = new glvdebug_QReplayWidget(&m_replayWorker);\n    if (m_pReplayWidget != NULL)\n    {\n        \/\/ load available replayers\n        if (!m_replayWorker.load_replayers(pTraceFileInfo, m_pReplayWidget->GetReplayWindow(),\n            g_xglDebugSettings.replay_window_width,\n            g_xglDebugSettings.replay_window_height,\n            g_xglDebugSettings.separate_replay_window))\n        {\n            m_pView->output_error(\"Failed to load necessary replayers.\");\n            delete m_pReplayWidget;\n            m_pReplayWidget = NULL;\n        }\n        else\n        {\n            m_pView->add_custom_state_viewer(m_pReplayWidget, \"Replayer\", true);\n            m_pReplayWidget->setEnabled(true);\n            connect(m_pReplayWidget, SIGNAL(ReplayStarted()), this, SLOT(onReplayStarted()));\n            connect(m_pReplayWidget, SIGNAL(ReplayPaused(uint64_t)), this, SLOT(onReplayPaused(uint64_t)));\n            connect(m_pReplayWidget, SIGNAL(ReplayContinued()), this, SLOT(onReplayContinued()));\n            connect(m_pReplayWidget, SIGNAL(ReplayStopped(uint64_t)), this, SLOT(onReplayStopped(uint64_t)));\n            connect(m_pReplayWidget, SIGNAL(ReplayFinished(uint64_t)), this, SLOT(onReplayFinished(uint64_t)));\n\n            connect(m_pReplayWidget, SIGNAL(OutputMessage(const QString&)), this, SLOT(OnOutputMessage(const QString&)));\n            connect(m_pReplayWidget, SIGNAL(OutputError(const QString&)), this, SLOT(OnOutputError(const QString&)));\n            connect(m_pReplayWidget, SIGNAL(OutputWarning(const QString&)), this, SLOT(OnOutputWarning(const QString&)));\n        }\n    }\n\n    assert(m_pTraceFileModel == NULL);\n    m_pTraceFileModel = new glvdebug_xgl_QFileModel(NULL, pTraceFileInfo);\n    updateCallTreeBasedOnSettings();\n\n    deleteStateDumps();\n\n    return true;\n}\n\nvoid glvdebug_xgl_QController::updateCallTreeBasedOnSettings()\n{\n    if (m_pTraceFileModel == NULL)\n    {\n        return;\n    }\n\n    if (g_xglDebugSettings.groupByFrame)\n    {\n        if (m_groupByFramesProxy.sourceModel() != m_pTraceFileModel)\n        {\n            m_groupByFramesProxy.setSourceModel(m_pTraceFileModel);\n        }\n        m_pView->set_calltree_model(m_pTraceFileModel, &m_groupByFramesProxy);\n    }\n    else if (g_xglDebugSettings.groupByThread)\n    {\n        if (m_groupByThreadsProxy.sourceModel() != m_pTraceFileModel)\n        {\n            m_groupByThreadsProxy.setSourceModel(m_pTraceFileModel);\n        }\n        m_pView->set_calltree_model(m_pTraceFileModel, &m_groupByThreadsProxy);\n    }\n    else\n    {\n        m_pView->set_calltree_model(m_pTraceFileModel, NULL);\n    }\n}\n\nvoid glvdebug_xgl_QController::deleteStateDumps() const\n{\n    QFile::remove(\"pipeline_dump.dot\");\n    QFile::remove(\"pipeline_dump.svg\");\n    QFile::remove(\"cb_dump.dot\");\n    QFile::remove(\"cb_dump.svg\");\n}\n\nvoid glvdebug_xgl_QController::setStateWidgetsEnabled(bool bEnabled)\n{\n    if(m_pDrawStateDiagram != NULL)\n    {\n        m_pView->enable_custom_state_viewer(m_pDrawStateDiagram, bEnabled);\n    }\n\n    if(m_pCommandBuffersDiagram != NULL)\n    {\n        m_pView->enable_custom_state_viewer(m_pCommandBuffersDiagram, bEnabled);\n    }\n}\n\nvoid glvdebug_xgl_QController::onReplayStarted()\n{\n    m_pView->output_message(QString(\"Replay Started\"));\n    deleteStateDumps();\n    setStateWidgetsEnabled(false);\n    m_pView->on_replay_state_changed(true);\n}\n\nvoid glvdebug_xgl_QController::onReplayPaused(uint64_t packetIndex)\n{\n    m_pView->output_message(QString(\"Replay Paused at packet index %1\").arg(packetIndex));\n    m_pView->on_replay_state_changed(false);\n\n    \/\/ When paused, the replay will 'continue' from the last packet,\n    \/\/ so select that call to indicate to the user where the pause occured.\n    m_pView->select_call_at_packet_index(packetIndex);\n\n    \/\/ Dump state data from the replayer\n    glv_replay::glv_trace_packet_replay_library* pXglReplayer = m_replayWorker.getReplayer(GLV_TID_XGL);\n    if (pXglReplayer != NULL)\n    {\n        int err;\n        err = pXglReplayer->Dump();\n        if (err)\n        {\n            m_pView->output_warning(\"Replayer couldn't output state data.\");\n        }\n    }\n\n    \/\/ Now try to load known state data.\n\n    \/\/ Convert dot files to svg format\n#if defined(PLATFORM_LINUX)\n    if (QFile::exists(\"\/usr\/bin\/dot\"))\n    {\n        QProcess process;\n        process.start(\"\/usr\/bin\/dot pipeline_dump.dot -Tsvg -o pipeline_dump.svg\");\n        process.waitForFinished(-1);\n        process.start(\"\/usr\/bin\/dot cb_dump.dot -Tsvg -o cb_dump.svg\");\n        process.waitForFinished(-1);\n    }\n    else\n    {\n        m_pView->output_error(\"DOT not found, unable to generate state diagrams.\");\n    }\n#else\n    assert(!\"DOT State Diagrams not supported on this platform\");\n#endif\n\n    if (QFile::exists(\"pipeline_dump.svg\"))\n    {\n        if (m_pDrawStateDiagram == NULL)\n        {\n            m_pDrawStateDiagram = new glvdebug_qsvgviewer();\n            m_pView->add_custom_state_viewer(m_pDrawStateDiagram, tr(\"Draw State\"), false);\n            m_pView->enable_custom_state_viewer(m_pDrawStateDiagram, false);\n        }\n\n        if (m_pDrawStateDiagram != NULL && m_pDrawStateDiagram->load(tr(\"pipeline_dump.svg\")))\n        {\n            m_pView->enable_custom_state_viewer(m_pDrawStateDiagram, true);\n        }\n\n    }\n\n    if (QFile::exists(\"cb_dump.svg\"))\n    {\n        if (m_pCommandBuffersDiagram == NULL)\n        {\n            m_pCommandBuffersDiagram = new glvdebug_qsvgviewer();\n            m_pView->add_custom_state_viewer(m_pCommandBuffersDiagram, tr(\"Command Buffers\"), false);\n            m_pView->enable_custom_state_viewer(m_pCommandBuffersDiagram, false);\n        }\n\n        if (m_pCommandBuffersDiagram != NULL && m_pCommandBuffersDiagram->load(tr(\"cb_dump.svg\")))\n        {\n            m_pView->enable_custom_state_viewer(m_pCommandBuffersDiagram, true);\n        }\n    }\n}\n\nvoid glvdebug_xgl_QController::onReplayContinued()\n{\n    m_pView->output_message(QString(\"Replay Continued\"));\n    deleteStateDumps();\n    setStateWidgetsEnabled(false);\n    m_pView->on_replay_state_changed(true);\n}\n\nvoid glvdebug_xgl_QController::onReplayStopped(uint64_t packetIndex)\n{\n    m_pView->output_message(QString(\"Replay Stopped at packet index %1\").arg(packetIndex));\n    m_pView->on_replay_state_changed(false);\n    setStateWidgetsEnabled(false);\n\n    \/\/ Stopping the replay means that it will 'play' or 'step' from the beginning,\n    \/\/ so select the first packet index to indicate to the user what stopping replay does.\n    m_pView->select_call_at_packet_index(0);\n}\n\nvoid glvdebug_xgl_QController::onReplayFinished(uint64_t packetIndex)\n{\n    m_pView->output_message(QString(\"Replay Finished\"));\n    m_pView->on_replay_state_changed(false);\n    setStateWidgetsEnabled(false);\n\n    \/\/ The replay has completed, so highlight the final packet index.\n    m_pView->select_call_at_packet_index(packetIndex);\n}\n\nvoid glvdebug_xgl_QController::OnOutputMessage(const QString& msg)\n{\n    m_pView->output_message(msg);\n}\n\nvoid glvdebug_xgl_QController::OnOutputError(const QString& msg)\n{\n    m_pView->output_error(msg);\n}\n\nvoid glvdebug_xgl_QController::OnOutputWarning(const QString& msg)\n{\n    m_pView->output_warning(msg);\n}\n\nvoid glvdebug_xgl_QController::onSettingsUpdated(glv_SettingGroup *pGroups, unsigned int numGroups)\n{\n    glv_SettingGroup_Apply_Overrides(&g_xglDebugSettingGroup, pGroups, numGroups);\n\n    m_replayWorker.setPrintReplayMessages(g_xglDebugSettings.printReplayInfoMsgs,\n                                          g_xglDebugSettings.printReplayWarningMsgs,\n                                          g_xglDebugSettings.printReplayErrorMsgs);\n\n    m_replayWorker.setPauseOnReplayMessages(g_xglDebugSettings.pauseOnReplayInfo,\n                                            g_xglDebugSettings.pauseOnReplayWarning,\n                                            g_xglDebugSettings.pauseOnReplayError);\n\n    updateCallTreeBasedOnSettings();\n}\n\nvoid glvdebug_xgl_QController::UnloadTraceFile(void)\n{\n    if (m_pView != NULL)\n    {\n        m_pView->set_calltree_model(NULL, NULL);\n        m_pView = NULL;\n    }\n\n    if (m_pTraceFileModel != NULL)\n    {\n        delete m_pTraceFileModel;\n        m_pTraceFileModel = NULL;\n    }\n\n    if (m_pReplayWidget != NULL)\n    {\n        delete m_pReplayWidget;\n        m_pReplayWidget = NULL;\n    }\n\n    if (m_pDrawStateDiagram != NULL)\n    {\n        delete m_pDrawStateDiagram;\n        m_pDrawStateDiagram = NULL;\n    }\n\n    if (m_pCommandBuffersDiagram != NULL)\n    {\n        delete m_pCommandBuffersDiagram;\n        m_pCommandBuffersDiagram = NULL;\n    }\n\n    m_replayWorker.unloadReplayers();\n}\n\n<commit_msg>Win\/glvdebug: Remove assert for lack of dot on Windows.<commit_after>\/**************************************************************************\n *\n * Copyright 2014 Valve Software. 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 *************************************************************************\/\nextern \"C\" {\n#include \"glv_trace_packet_utils.h\"\n#include \"glvtrace_xgl_packet_id.h\"\n}\n\n#include \"glvdebug_xgl_settings.h\"\n#include \"glvdebug_xgl_qcontroller.h\"\n\n#include <assert.h>\n#include <QFileInfo>\n#include <QWidget>\n#include <QToolButton>\n#include <QCoreApplication>\n#include <QProcess>\n\n#include \"glvdebug_view.h\"\n#include \"glvreplay_seq.h\"\n\nglvdebug_xgl_QController::glvdebug_xgl_QController()\n    : m_pView(NULL),\n      m_pTraceFileInfo(NULL),\n      m_pDrawStateDiagram(NULL),\n      m_pCommandBuffersDiagram(NULL),\n      m_pReplayWidget(NULL),\n      m_pTraceFileModel(NULL)\n{\n    initialize_default_settings();\n    glv_SettingGroup_reset_defaults(&g_xglDebugSettingGroup);\n}\n\nglvdebug_xgl_QController::~glvdebug_xgl_QController()\n{\n}\n\nglv_trace_packet_header* glvdebug_xgl_QController::InterpretTracePacket(glv_trace_packet_header* pHeader)\n{\n    \/\/ Attempt to interpret the packet as an XGL packet\n    glv_trace_packet_header* pInterpretedHeader = interpret_trace_packet_xgl(pHeader);\n    if (pInterpretedHeader == NULL)\n    {\n        glv_LogWarn(\"Unrecognized XGL packet_id: %u\\n\", pHeader->packet_id);\n    }\n\n    return pInterpretedHeader;\n}\n\nbool glvdebug_xgl_QController::LoadTraceFile(glvdebug_trace_file_info* pTraceFileInfo, glvdebug_view* pView)\n{\n    assert(pTraceFileInfo != NULL);\n    assert(pView != NULL);\n    setView(pView);\n    m_pTraceFileInfo = pTraceFileInfo;\n\n    assert(m_pReplayWidget == NULL);\n    m_pReplayWidget = new glvdebug_QReplayWidget(&m_replayWorker);\n    if (m_pReplayWidget != NULL)\n    {\n        \/\/ load available replayers\n        if (!m_replayWorker.load_replayers(pTraceFileInfo, m_pReplayWidget->GetReplayWindow(),\n            g_xglDebugSettings.replay_window_width,\n            g_xglDebugSettings.replay_window_height,\n            g_xglDebugSettings.separate_replay_window))\n        {\n            m_pView->output_error(\"Failed to load necessary replayers.\");\n            delete m_pReplayWidget;\n            m_pReplayWidget = NULL;\n        }\n        else\n        {\n            m_pView->add_custom_state_viewer(m_pReplayWidget, \"Replayer\", true);\n            m_pReplayWidget->setEnabled(true);\n            connect(m_pReplayWidget, SIGNAL(ReplayStarted()), this, SLOT(onReplayStarted()));\n            connect(m_pReplayWidget, SIGNAL(ReplayPaused(uint64_t)), this, SLOT(onReplayPaused(uint64_t)));\n            connect(m_pReplayWidget, SIGNAL(ReplayContinued()), this, SLOT(onReplayContinued()));\n            connect(m_pReplayWidget, SIGNAL(ReplayStopped(uint64_t)), this, SLOT(onReplayStopped(uint64_t)));\n            connect(m_pReplayWidget, SIGNAL(ReplayFinished(uint64_t)), this, SLOT(onReplayFinished(uint64_t)));\n\n            connect(m_pReplayWidget, SIGNAL(OutputMessage(const QString&)), this, SLOT(OnOutputMessage(const QString&)));\n            connect(m_pReplayWidget, SIGNAL(OutputError(const QString&)), this, SLOT(OnOutputError(const QString&)));\n            connect(m_pReplayWidget, SIGNAL(OutputWarning(const QString&)), this, SLOT(OnOutputWarning(const QString&)));\n        }\n    }\n\n    assert(m_pTraceFileModel == NULL);\n    m_pTraceFileModel = new glvdebug_xgl_QFileModel(NULL, pTraceFileInfo);\n    updateCallTreeBasedOnSettings();\n\n    deleteStateDumps();\n\n    return true;\n}\n\nvoid glvdebug_xgl_QController::updateCallTreeBasedOnSettings()\n{\n    if (m_pTraceFileModel == NULL)\n    {\n        return;\n    }\n\n    if (g_xglDebugSettings.groupByFrame)\n    {\n        if (m_groupByFramesProxy.sourceModel() != m_pTraceFileModel)\n        {\n            m_groupByFramesProxy.setSourceModel(m_pTraceFileModel);\n        }\n        m_pView->set_calltree_model(m_pTraceFileModel, &m_groupByFramesProxy);\n    }\n    else if (g_xglDebugSettings.groupByThread)\n    {\n        if (m_groupByThreadsProxy.sourceModel() != m_pTraceFileModel)\n        {\n            m_groupByThreadsProxy.setSourceModel(m_pTraceFileModel);\n        }\n        m_pView->set_calltree_model(m_pTraceFileModel, &m_groupByThreadsProxy);\n    }\n    else\n    {\n        m_pView->set_calltree_model(m_pTraceFileModel, NULL);\n    }\n}\n\nvoid glvdebug_xgl_QController::deleteStateDumps() const\n{\n    QFile::remove(\"pipeline_dump.dot\");\n    QFile::remove(\"pipeline_dump.svg\");\n    QFile::remove(\"cb_dump.dot\");\n    QFile::remove(\"cb_dump.svg\");\n}\n\nvoid glvdebug_xgl_QController::setStateWidgetsEnabled(bool bEnabled)\n{\n    if(m_pDrawStateDiagram != NULL)\n    {\n        m_pView->enable_custom_state_viewer(m_pDrawStateDiagram, bEnabled);\n    }\n\n    if(m_pCommandBuffersDiagram != NULL)\n    {\n        m_pView->enable_custom_state_viewer(m_pCommandBuffersDiagram, bEnabled);\n    }\n}\n\nvoid glvdebug_xgl_QController::onReplayStarted()\n{\n    m_pView->output_message(QString(\"Replay Started\"));\n    deleteStateDumps();\n    setStateWidgetsEnabled(false);\n    m_pView->on_replay_state_changed(true);\n}\n\nvoid glvdebug_xgl_QController::onReplayPaused(uint64_t packetIndex)\n{\n    m_pView->output_message(QString(\"Replay Paused at packet index %1\").arg(packetIndex));\n    m_pView->on_replay_state_changed(false);\n\n    \/\/ When paused, the replay will 'continue' from the last packet,\n    \/\/ so select that call to indicate to the user where the pause occured.\n    m_pView->select_call_at_packet_index(packetIndex);\n\n    \/\/ Dump state data from the replayer\n    glv_replay::glv_trace_packet_replay_library* pXglReplayer = m_replayWorker.getReplayer(GLV_TID_XGL);\n    if (pXglReplayer != NULL)\n    {\n        int err;\n        err = pXglReplayer->Dump();\n        if (err)\n        {\n            m_pView->output_warning(\"Replayer couldn't output state data.\");\n        }\n    }\n\n    \/\/ Now try to load known state data.\n\n    \/\/ Convert dot files to svg format\n#if defined(PLATFORM_LINUX)\n    if (QFile::exists(\"\/usr\/bin\/dot\"))\n    {\n        QProcess process;\n        process.start(\"\/usr\/bin\/dot pipeline_dump.dot -Tsvg -o pipeline_dump.svg\");\n        process.waitForFinished(-1);\n        process.start(\"\/usr\/bin\/dot cb_dump.dot -Tsvg -o cb_dump.svg\");\n        process.waitForFinished(-1);\n    }\n    else\n    {\n        m_pView->output_error(\"DOT not found, unable to generate state diagrams.\");\n    }\n#else\n    m_pView->output_error(\"DOT not found, unable to generate state diagrams.\");\n#endif\n\n    if (QFile::exists(\"pipeline_dump.svg\"))\n    {\n        if (m_pDrawStateDiagram == NULL)\n        {\n            m_pDrawStateDiagram = new glvdebug_qsvgviewer();\n            m_pView->add_custom_state_viewer(m_pDrawStateDiagram, tr(\"Draw State\"), false);\n            m_pView->enable_custom_state_viewer(m_pDrawStateDiagram, false);\n        }\n\n        if (m_pDrawStateDiagram != NULL && m_pDrawStateDiagram->load(tr(\"pipeline_dump.svg\")))\n        {\n            m_pView->enable_custom_state_viewer(m_pDrawStateDiagram, true);\n        }\n\n    }\n\n    if (QFile::exists(\"cb_dump.svg\"))\n    {\n        if (m_pCommandBuffersDiagram == NULL)\n        {\n            m_pCommandBuffersDiagram = new glvdebug_qsvgviewer();\n            m_pView->add_custom_state_viewer(m_pCommandBuffersDiagram, tr(\"Command Buffers\"), false);\n            m_pView->enable_custom_state_viewer(m_pCommandBuffersDiagram, false);\n        }\n\n        if (m_pCommandBuffersDiagram != NULL && m_pCommandBuffersDiagram->load(tr(\"cb_dump.svg\")))\n        {\n            m_pView->enable_custom_state_viewer(m_pCommandBuffersDiagram, true);\n        }\n    }\n}\n\nvoid glvdebug_xgl_QController::onReplayContinued()\n{\n    m_pView->output_message(QString(\"Replay Continued\"));\n    deleteStateDumps();\n    setStateWidgetsEnabled(false);\n    m_pView->on_replay_state_changed(true);\n}\n\nvoid glvdebug_xgl_QController::onReplayStopped(uint64_t packetIndex)\n{\n    m_pView->output_message(QString(\"Replay Stopped at packet index %1\").arg(packetIndex));\n    m_pView->on_replay_state_changed(false);\n    setStateWidgetsEnabled(false);\n\n    \/\/ Stopping the replay means that it will 'play' or 'step' from the beginning,\n    \/\/ so select the first packet index to indicate to the user what stopping replay does.\n    m_pView->select_call_at_packet_index(0);\n}\n\nvoid glvdebug_xgl_QController::onReplayFinished(uint64_t packetIndex)\n{\n    m_pView->output_message(QString(\"Replay Finished\"));\n    m_pView->on_replay_state_changed(false);\n    setStateWidgetsEnabled(false);\n\n    \/\/ The replay has completed, so highlight the final packet index.\n    m_pView->select_call_at_packet_index(packetIndex);\n}\n\nvoid glvdebug_xgl_QController::OnOutputMessage(const QString& msg)\n{\n    m_pView->output_message(msg);\n}\n\nvoid glvdebug_xgl_QController::OnOutputError(const QString& msg)\n{\n    m_pView->output_error(msg);\n}\n\nvoid glvdebug_xgl_QController::OnOutputWarning(const QString& msg)\n{\n    m_pView->output_warning(msg);\n}\n\nvoid glvdebug_xgl_QController::onSettingsUpdated(glv_SettingGroup *pGroups, unsigned int numGroups)\n{\n    glv_SettingGroup_Apply_Overrides(&g_xglDebugSettingGroup, pGroups, numGroups);\n\n    m_replayWorker.setPrintReplayMessages(g_xglDebugSettings.printReplayInfoMsgs,\n                                          g_xglDebugSettings.printReplayWarningMsgs,\n                                          g_xglDebugSettings.printReplayErrorMsgs);\n\n    m_replayWorker.setPauseOnReplayMessages(g_xglDebugSettings.pauseOnReplayInfo,\n                                            g_xglDebugSettings.pauseOnReplayWarning,\n                                            g_xglDebugSettings.pauseOnReplayError);\n\n    updateCallTreeBasedOnSettings();\n}\n\nvoid glvdebug_xgl_QController::UnloadTraceFile(void)\n{\n    if (m_pView != NULL)\n    {\n        m_pView->set_calltree_model(NULL, NULL);\n        m_pView = NULL;\n    }\n\n    if (m_pTraceFileModel != NULL)\n    {\n        delete m_pTraceFileModel;\n        m_pTraceFileModel = NULL;\n    }\n\n    if (m_pReplayWidget != NULL)\n    {\n        delete m_pReplayWidget;\n        m_pReplayWidget = NULL;\n    }\n\n    if (m_pDrawStateDiagram != NULL)\n    {\n        delete m_pDrawStateDiagram;\n        m_pDrawStateDiagram = NULL;\n    }\n\n    if (m_pCommandBuffersDiagram != NULL)\n    {\n        delete m_pCommandBuffersDiagram;\n        m_pCommandBuffersDiagram = NULL;\n    }\n\n    m_replayWorker.unloadReplayers();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <osg\/Image>\n#include \"osg\/Notify\"\n#include <osg\/Geode>\n#include <osg\/GL>\n\n#include <osgDB\/Registry>\n#include <osgDB\/FileNameUtils>\n\nusing namespace osg;\n\nextern \"C\"\n{\n    #include <png.h>\n}\n\n\n\/* Transparency parameters *\/\n#define PNG_ALPHA     -2         \/* Use alpha channel in PNG file, if there is one *\/\n#define PNG_SOLID     -1         \/* No transparency                                *\/\n#define PNG_STENCIL    0         \/* Sets alpha to 0 for r=g=b=0, 1 otherwise       *\/\n\ntypedef struct\n{\n    unsigned int Width;\n    unsigned int Height;\n    unsigned int Depth;\n    unsigned int Alpha;\n} pngInfo;\n\nclass ReaderWriterPNG : public osgDB::ReaderWriter\n{\n    public:\n        virtual const char* className() { return \"PNG Image Reader\/Writer\"; }\n        virtual bool acceptsExtension(const std::string& extension) { return osgDB::equalCaseInsensitive(extension,\"png\"); }\n\n        virtual ReadResult readImage(const std::string& fileName, const osgDB::ReaderWriter::Options*)\n        {\n\n            if( !acceptsExtension(osgDB::getFileExtension(fileName) ))\n                return ReadResult::FILE_NOT_HANDLED;\n\n            int trans = PNG_ALPHA;\n            FILE *fp = NULL;\n            pngInfo pInfo;\n            pngInfo *pinfo = &pInfo;\n\n            unsigned char header[8];\n            png_structp png;\n            png_infop   info;\n            png_infop   endinfo;\n            png_bytep   data;    \/\/, data2;\n            png_bytep  *row_p;\n            double  fileGamma;\n\n            png_uint_32 width, height;\n            int depth, color;\n\n            png_uint_32 i;\n            png = png_create_read_struct(PNG_LIBPNG_VER_STRING, NULL, NULL, NULL);\n            info = png_create_info_struct(png);\n            endinfo = png_create_info_struct(png);\n\n            fp = fopen(fileName.c_str(), \"rb\");\n            if (fp && fread(header, 1, 8, fp) && png_check_sig(header, 8))\n                png_init_io(png, fp);\n            else\n            {\n                png_destroy_read_struct(&png, &info, &endinfo);\n                return ReadResult::FILE_NOT_HANDLED;\n            }\n            png_set_sig_bytes(png, 8);\n\n            png_read_info(png, info);\n            png_get_IHDR(png, info, &width, &height, &depth, &color, NULL, NULL, NULL);\n\n            if (pinfo != NULL)\n            {\n                pinfo->Width  = width;\n                pinfo->Height = height;\n                pinfo->Depth  = depth;\n            }\n\n            if (color == PNG_COLOR_TYPE_GRAY || color == PNG_COLOR_TYPE_GRAY_ALPHA)\n                png_set_gray_to_rgb(png);\n\n            if (color&PNG_COLOR_MASK_ALPHA && trans != PNG_ALPHA)\n            {\n                png_set_strip_alpha(png);\n                color &= ~PNG_COLOR_MASK_ALPHA;\n            }\n\n            \/\/\tif (!(PalettedTextures && mipmap >= 0 && trans == PNG_SOLID))\n            if (color == PNG_COLOR_TYPE_PALETTE)\n                png_set_expand(png);\n\n            \/*--GAMMA--*\/\n            \/\/\tcheckForGammaEnv();\n            double screenGamma = 2.2 \/ 1.0;\n            if (png_get_gAMA(png, info, &fileGamma))\n                png_set_gamma(png, screenGamma, fileGamma);\n            else\n                png_set_gamma(png, screenGamma, 1.0\/2.2);\n\n            png_read_update_info(png, info);\n\n            data = (png_bytep) new unsigned char [png_get_rowbytes(png, info)*height];\n            row_p = new png_bytep [height];\n\n            bool StandardOrientation = true;\n            for (i = 0; i < height; i++)\n            {\n                if (StandardOrientation)\n                    row_p[height - 1 - i] = &data[png_get_rowbytes(png, info)*i];\n                else\n                    row_p[i] = &data[png_get_rowbytes(png, info)*i];\n            }\n\n            png_read_image(png, row_p);\n            delete [] row_p;\n\n            int iBitCount=0;\n\n            if (trans == PNG_SOLID || trans == PNG_ALPHA || color == PNG_COLOR_TYPE_RGB_ALPHA || color == PNG_COLOR_TYPE_GRAY_ALPHA)\n            {\n                switch (color)\n                {\n                    case PNG_COLOR_TYPE_GRAY:\n                    case PNG_COLOR_TYPE_RGB:\n                    case PNG_COLOR_TYPE_PALETTE:\n                        iBitCount = 24;\n                        if (pinfo != NULL) pinfo->Alpha = 0;\n                        break;\n\n                    case PNG_COLOR_TYPE_GRAY_ALPHA:\n                    case PNG_COLOR_TYPE_RGB_ALPHA:\n                        iBitCount = 32;\n                        if (pinfo != NULL) pinfo->Alpha = 8;\n                        break;\n\n                    default:\n                        \/\/ error, will force return of ReadResult::FILE_NOT_HANDLED\n                        \/\/ see below.\n                        iBitCount = 0;\n                }\n            }\n\n            png_read_end(png, endinfo);\n            png_destroy_read_struct(&png, &info, &endinfo);\n\n            \/\/\tdelete [] data;\n\n            if (fp)\n                fclose(fp);\n\n            if (iBitCount==0) \n                return ReadResult::FILE_NOT_HANDLED;\n\n            osg::Image* pOsgImage = new osg::Image();\n\n            pOsgImage->setFileName(fileName.c_str());\n            if (iBitCount == 24)\n                pOsgImage->setImage(width, height, 1,\n                    iBitCount \/ 8,\/\/ int internalFormat,\n                    GL_RGB,      \/\/ unsigned int pixelFormat\n                    GL_UNSIGNED_BYTE,\/\/ unsigned int dataType\n                    data,\n                    osg::Image::USE_NEW_DELETE);\n            else\n                pOsgImage->setImage(width, height, 1,\n                    iBitCount \/ 8,\/\/ int internalFormat,\n                    GL_RGBA,     \/\/ unsigned int pixelFormat\n                    GL_UNSIGNED_BYTE,\/\/ unsigned int dataType\n                    data,\n                    osg::Image::USE_NEW_DELETE);\n            return pOsgImage;\n        }\n};\n\n\/\/ now register with Registry to instantiate the above\n\/\/ reader\/writer.\nosgDB::RegisterReaderWriterProxy<ReaderWriterPNG> g_readerWriter_PNG_Proxy;\n<commit_msg>Fix for compile oddities on an Octane with old zlib headers hanging around, change is non intrusive.<commit_after>#include <osg\/Image>\n#include \"osg\/Notify\"\n#include <osg\/Geode>\n#include <osg\/GL>\n\n#include <osgDB\/Registry>\n#include <osgDB\/FileNameUtils>\n\nusing namespace osg;\n\nextern \"C\"\n{\n    #include <zlib.h>\n    #include <png.h>\n}\n\n\n\/* Transparency parameters *\/\n#define PNG_ALPHA     -2         \/* Use alpha channel in PNG file, if there is one *\/\n#define PNG_SOLID     -1         \/* No transparency                                *\/\n#define PNG_STENCIL    0         \/* Sets alpha to 0 for r=g=b=0, 1 otherwise       *\/\n\ntypedef struct\n{\n    unsigned int Width;\n    unsigned int Height;\n    unsigned int Depth;\n    unsigned int Alpha;\n} pngInfo;\n\nclass ReaderWriterPNG : public osgDB::ReaderWriter\n{\n    public:\n        virtual const char* className() { return \"PNG Image Reader\/Writer\"; }\n        virtual bool acceptsExtension(const std::string& extension) { return osgDB::equalCaseInsensitive(extension,\"png\"); }\n\n        virtual ReadResult readImage(const std::string& fileName, const osgDB::ReaderWriter::Options*)\n        {\n\n            if( !acceptsExtension(osgDB::getFileExtension(fileName) ))\n                return ReadResult::FILE_NOT_HANDLED;\n\n            int trans = PNG_ALPHA;\n            FILE *fp = NULL;\n            pngInfo pInfo;\n            pngInfo *pinfo = &pInfo;\n\n            unsigned char header[8];\n            png_structp png;\n            png_infop   info;\n            png_infop   endinfo;\n            png_bytep   data;    \/\/, data2;\n            png_bytep  *row_p;\n            double  fileGamma;\n\n            png_uint_32 width, height;\n            int depth, color;\n\n            png_uint_32 i;\n            png = png_create_read_struct(PNG_LIBPNG_VER_STRING, NULL, NULL, NULL);\n            info = png_create_info_struct(png);\n            endinfo = png_create_info_struct(png);\n\n            fp = fopen(fileName.c_str(), \"rb\");\n            if (fp && fread(header, 1, 8, fp) && png_check_sig(header, 8))\n                png_init_io(png, fp);\n            else\n            {\n                png_destroy_read_struct(&png, &info, &endinfo);\n                return ReadResult::FILE_NOT_HANDLED;\n            }\n            png_set_sig_bytes(png, 8);\n\n            png_read_info(png, info);\n            png_get_IHDR(png, info, &width, &height, &depth, &color, NULL, NULL, NULL);\n\n            if (pinfo != NULL)\n            {\n                pinfo->Width  = width;\n                pinfo->Height = height;\n                pinfo->Depth  = depth;\n            }\n\n            if (color == PNG_COLOR_TYPE_GRAY || color == PNG_COLOR_TYPE_GRAY_ALPHA)\n                png_set_gray_to_rgb(png);\n\n            if (color&PNG_COLOR_MASK_ALPHA && trans != PNG_ALPHA)\n            {\n                png_set_strip_alpha(png);\n                color &= ~PNG_COLOR_MASK_ALPHA;\n            }\n\n            \/\/\tif (!(PalettedTextures && mipmap >= 0 && trans == PNG_SOLID))\n            if (color == PNG_COLOR_TYPE_PALETTE)\n                png_set_expand(png);\n\n            \/*--GAMMA--*\/\n            \/\/\tcheckForGammaEnv();\n            double screenGamma = 2.2 \/ 1.0;\n            if (png_get_gAMA(png, info, &fileGamma))\n                png_set_gamma(png, screenGamma, fileGamma);\n            else\n                png_set_gamma(png, screenGamma, 1.0\/2.2);\n\n            png_read_update_info(png, info);\n\n            data = (png_bytep) new unsigned char [png_get_rowbytes(png, info)*height];\n            row_p = new png_bytep [height];\n\n            bool StandardOrientation = true;\n            for (i = 0; i < height; i++)\n            {\n                if (StandardOrientation)\n                    row_p[height - 1 - i] = &data[png_get_rowbytes(png, info)*i];\n                else\n                    row_p[i] = &data[png_get_rowbytes(png, info)*i];\n            }\n\n            png_read_image(png, row_p);\n            delete [] row_p;\n\n            int iBitCount=0;\n\n            if (trans == PNG_SOLID || trans == PNG_ALPHA || color == PNG_COLOR_TYPE_RGB_ALPHA || color == PNG_COLOR_TYPE_GRAY_ALPHA)\n            {\n                switch (color)\n                {\n                    case PNG_COLOR_TYPE_GRAY:\n                    case PNG_COLOR_TYPE_RGB:\n                    case PNG_COLOR_TYPE_PALETTE:\n                        iBitCount = 24;\n                        if (pinfo != NULL) pinfo->Alpha = 0;\n                        break;\n\n                    case PNG_COLOR_TYPE_GRAY_ALPHA:\n                    case PNG_COLOR_TYPE_RGB_ALPHA:\n                        iBitCount = 32;\n                        if (pinfo != NULL) pinfo->Alpha = 8;\n                        break;\n\n                    default:\n                        \/\/ error, will force return of ReadResult::FILE_NOT_HANDLED\n                        \/\/ see below.\n                        iBitCount = 0;\n                }\n            }\n\n            png_read_end(png, endinfo);\n            png_destroy_read_struct(&png, &info, &endinfo);\n\n            \/\/\tdelete [] data;\n\n            if (fp)\n                fclose(fp);\n\n            if (iBitCount==0) \n                return ReadResult::FILE_NOT_HANDLED;\n\n            osg::Image* pOsgImage = new osg::Image();\n\n            pOsgImage->setFileName(fileName.c_str());\n            if (iBitCount == 24)\n                pOsgImage->setImage(width, height, 1,\n                    iBitCount \/ 8,\/\/ int internalFormat,\n                    GL_RGB,      \/\/ unsigned int pixelFormat\n                    GL_UNSIGNED_BYTE,\/\/ unsigned int dataType\n                    data,\n                    osg::Image::USE_NEW_DELETE);\n            else\n                pOsgImage->setImage(width, height, 1,\n                    iBitCount \/ 8,\/\/ int internalFormat,\n                    GL_RGBA,     \/\/ unsigned int pixelFormat\n                    GL_UNSIGNED_BYTE,\/\/ unsigned int dataType\n                    data,\n                    osg::Image::USE_NEW_DELETE);\n            return pOsgImage;\n        }\n};\n\n\/\/ now register with Registry to instantiate the above\n\/\/ reader\/writer.\nosgDB::RegisterReaderWriterProxy<ReaderWriterPNG> g_readerWriter_PNG_Proxy;\n<|endoftext|>"}
{"text":"<commit_before>\/**********************************************************************\nThis source file is a part of Demi3D\n   __  ___  __  __  __\n  |  \\|_ |\\\/||   _)|  \\ \n  |__\/|__|  ||  __)|__\/ \n\nCopyright (c) 2013-2014 Demi team\nhttps:\/\/github.com\/wangyanxing\/Demi3D\n\nReleased under the MIT License\nhttps:\/\/github.com\/wangyanxing\/Demi3D\/blob\/master\/License.txt\n***********************************************************************\/\n\n#include \"ArenaPch.h\"\n#include \"ArenaFxProperty.h\"\n#include \"K2Terrain.h\"\n#include \"K2World.h\"\n#include \"ArenaGameApp.h\"\n#include \"ArenaGameEntity.h\"\n#include \"ArenaDynEntity.h\"\n#include \"ArenaAttribute.h\"\n#include \"ArenaEntityManager.h\"\n#include \"ArenaEntityConfig.h\"\n#include \"K2RenderObjects.h\"\n#include \"EffectManager.h\"\n#include \"ParticleSystem.h\"\n\nnamespace Demi\n{\n    ArFxProperty::ArFxProperty()\n    {\n\n    }\n\n    ArFxProperty::~ArFxProperty()\n    {\n\n    }\n\n    void ArFxProperty::Update(float dt)\n    {\n        for (auto& pj : mProjectiles)\n        {\n            auto entityPtr = ArGameApp::Get()->GetEntityManager()->FindEntity(pj->targetID);\n            if(entityPtr)\n            {\n                if(pj->trailFx->GetState() == DiParticleSystem::PSS_STOPPED)\n                {\n                    continue;\n                }\n                auto targetPos = entityPtr->GetImpactPosition();\n                \n                \/\/reach\n                if(DiMath::Abs(pj->curPos.distance(targetPos)) < 2)\n                {\n                    pj->trailFx->Stop();\n                    pj->node->DetachObject(pj->trailFx);\n                    continue;\n                }\n                \n                auto dir = (targetPos - pj->curPos).normalisedCopy();\n                pj->curPos += dir * (dt * pj->speed);\n                pj->node->SetPosition(pj->curPos);\n            }\n        }\n    }\n    \n    DiParticleSystemPtr ArFxProperty::PlayParticleSystem(const DiString& templateName)\n    {\n        DiString name;\n        name.Format(\"EtFx_%d_%d\", mEntity->GetID(), mFxCount++);\n        \n        DiParticleSystemPtr ret = DiEffectManager::GetInstance().CreateParticleSystem(name, templateName);\n        DiCullNode* node = Driver->GetSceneManager()->GetRootNode()->CreateChild();\n        node->AttachObject(ret);\n        ret->AttachModel(mEntity->GetRenderObj()->GetModel());\n        ret->AddParticleSystemListener(this);\n        ret->Start();\n\n        mEffects.insert(ret);\n        return ret;\n    }\n    \n    void ArFxProperty::PlayProjectile(uint32 entityID)\n    {\n        auto entity = GetEntity<ArDynEntity>();\n        auto entityConfig = entity->GetAttribute()->GetEntityConfig();\n        if(entityConfig->attackprojectile.empty())\n        {\n            return;\n        }\n        \n        DiString pjName = entityConfig->attackprojectile[0];\n        ArFxProjectileConfig* pjConfig = entityConfig->GetProjectile(pjName);\n        if(!pjConfig)\n        {\n            DI_WARNING(\"Failed to get the projectile config\");\n            return;\n        }\n        \n        auto pos = entity->GetRenderObj()->GetWorldPosition();\n        auto rot = entity->GetRenderObj()->GetNode()->GetDerivedOrientation();\n        \n        DiString fxName = entityConfig->path + \"projectile\/\" + pjConfig->traileffect;\n        DiString impactFxName = entityConfig->path + \"projectile\/\" + pjConfig->impacteffect;\n        \n        DiString name;\n        name.Format(\"EtFx_%d_%d\", mEntity->GetID(), mFxCount++);\n        \n        DiParticleSystemPtr trailFx = DiEffectManager::GetInstancePtr()->CreateParticleSystem(name, fxName);\n        DiCullNode* node = Driver->GetSceneManager()->GetRootNode()->CreateChild();\n        node->AttachObject(trailFx);\n        node->SetPosition(pos);\n        trailFx->AttachModel(mEntity->GetRenderObj()->GetModel());\n        trailFx->AddParticleSystemListener(this);\n        trailFx->Start();\n        \n        Projectile* pj = DI_NEW Projectile();\n        pj->speed = pjConfig->speed;\n        pj->curPos = pos + rot * (entityConfig->attackoffset * entityConfig->GetMaxPreGlobalScale());\n        pj->trailFx = trailFx;\n        pj->impactFx = nullptr;\n        pj->node = node;\n        pj->targetID = entityID;\n        node->SetPosition(pj->curPos);\n        \n        mProjectiles.push_back(pj);\n    }\n\n    void ArFxProperty::Init()\n    {\n        auto entity = GetEntity<ArDynEntity>();\n        auto entityConfig = entity->GetAttribute()->GetEntityConfig();\n        if(entityConfig)\n        {\n            \/\/mProjectiles = entityConfig->attackprojectile;\n        }\n        else\n        {\n            DI_WARNING(\"No valid entity config!\");\n        }\n    }\n    \n    void ArFxProperty::HandleParticleSystemEvent(DiParticleSystemPtr particleSystem, DiFxEvent& event)\n    {\n        if (event.eventType == PU_EVT_SYSTEM_STOPPED)\n        {\n            auto it = mEffects.find(particleSystem);\n            if (it != mEffects.end())\n            {\n                DiParticleSystemPtr ps = *it;\n                auto node = ps->GetParentCullNode();\n                Driver->GetSceneManager()->DestroyNode(node);\n                \n                mEffects.erase(it);\n            }\n        }\n    }\n}<commit_msg>trivial changes<commit_after>\/**********************************************************************\nThis source file is a part of Demi3D\n   __  ___  __  __  __\n  |  \\|_ |\\\/||   _)|  \\ \n  |__\/|__|  ||  __)|__\/ \n\nCopyright (c) 2013-2014 Demi team\nhttps:\/\/github.com\/wangyanxing\/Demi3D\n\nReleased under the MIT License\nhttps:\/\/github.com\/wangyanxing\/Demi3D\/blob\/master\/License.txt\n***********************************************************************\/\n\n#include \"ArenaPch.h\"\n#include \"ArenaFxProperty.h\"\n#include \"K2Terrain.h\"\n#include \"K2World.h\"\n#include \"ArenaGameApp.h\"\n#include \"ArenaGameEntity.h\"\n#include \"ArenaDynEntity.h\"\n#include \"ArenaAttribute.h\"\n#include \"ArenaEntityManager.h\"\n#include \"ArenaEntityConfig.h\"\n#include \"K2RenderObjects.h\"\n#include \"EffectManager.h\"\n#include \"ParticleSystem.h\"\n\nnamespace Demi\n{\n    ArFxProperty::ArFxProperty()\n    {\n\n    }\n\n    ArFxProperty::~ArFxProperty()\n    {\n\n    }\n\n    void ArFxProperty::Update(float dt)\n    {\n        for (auto& pj : mProjectiles)\n        {\n            auto entityPtr = ArGameApp::Get()->GetEntityManager()->FindEntity(pj->targetID);\n            if(entityPtr)\n            {\n                if(pj->trailFx->GetState() == DiParticleSystem::PSS_STOPPED)\n                {\n                    continue;\n                }\n                auto targetPos = entityPtr->GetImpactPosition();\n                \n                \/\/reach\n                if(DiMath::Abs(pj->curPos.distance(targetPos)) < 2)\n                {\n                    pj->trailFx->Stop();\n                    pj->node->DetachObject(pj->trailFx);\n                    \n                    if(pj->impactFx)\n                    {\n                        pj->impactFx->Start();\n                        pj->node->AttachObject(pj->impactFx);\n                    }\n                    continue;\n                }\n                \n                auto dir = (targetPos - pj->curPos).normalisedCopy();\n                pj->curPos += dir * (dt * pj->speed);\n                pj->node->SetPosition(pj->curPos);\n            }\n        }\n    }\n    \n    DiParticleSystemPtr ArFxProperty::PlayParticleSystem(const DiString& templateName)\n    {\n        DiString name;\n        name.Format(\"EtFx_%d_%d\", mEntity->GetID(), mFxCount++);\n        \n        DiParticleSystemPtr ret = DiEffectManager::GetInstance().CreateParticleSystem(name, templateName);\n        DiCullNode* node = Driver->GetSceneManager()->GetRootNode()->CreateChild();\n        node->AttachObject(ret);\n        ret->AttachModel(mEntity->GetRenderObj()->GetModel());\n        ret->AddParticleSystemListener(this);\n        ret->Start();\n\n        mEffects.insert(ret);\n        return ret;\n    }\n    \n    void ArFxProperty::PlayProjectile(uint32 entityID)\n    {\n        auto entity = GetEntity<ArDynEntity>();\n        auto entityConfig = entity->GetAttribute()->GetEntityConfig();\n        if(entityConfig->attackprojectile.empty())\n        {\n            return;\n        }\n        \n        DiString pjName = entityConfig->attackprojectile[0];\n        ArFxProjectileConfig* pjConfig = entityConfig->GetProjectile(pjName);\n        if(!pjConfig)\n        {\n            DI_WARNING(\"Failed to get the projectile config\");\n            return;\n        }\n        \n        auto pos = entity->GetRenderObj()->GetWorldPosition();\n        auto rot = entity->GetRenderObj()->GetNode()->GetDerivedOrientation();\n        \n        DiString fxName = entityConfig->path + \"projectile\/\" + pjConfig->traileffect;\n        DiString impactFxName = entityConfig->path + \"projectile\/\" + pjConfig->impacteffect;\n        \n        DiString name;\n        name.Format(\"EtFx_%d_%d\", mEntity->GetID(), mFxCount++);\n        \n        DiParticleSystemPtr trailFx = DiEffectManager::GetInstancePtr()->CreateParticleSystem(name, fxName);\n        DiCullNode* node = Driver->GetSceneManager()->GetRootNode()->CreateChild();\n        node->AttachObject(trailFx);\n        node->SetPosition(pos);\n        trailFx->AttachModel(mEntity->GetRenderObj()->GetModel());\n        trailFx->AddParticleSystemListener(this);\n        trailFx->Start();\n        \n        Projectile* pj = DI_NEW Projectile();\n        pj->speed      = pjConfig->speed;\n        pj->curPos     = pos + rot * (entityConfig->attackoffset * entityConfig->GetMaxPreGlobalScale());\n        pj->trailFx    = trailFx;\n        pj->impactFx   = nullptr;\n        pj->node       = node;\n        pj->targetID   = entityID;\n        \n        node->SetPosition(pj->curPos);\n        \n        mProjectiles.push_back(pj);\n    }\n\n    void ArFxProperty::Init()\n    {\n        auto entity = GetEntity<ArDynEntity>();\n        auto entityConfig = entity->GetAttribute()->GetEntityConfig();\n        if(entityConfig)\n        {\n            \/\/mProjectiles = entityConfig->attackprojectile;\n        }\n        else\n        {\n            DI_WARNING(\"No valid entity config!\");\n        }\n    }\n    \n    void ArFxProperty::HandleParticleSystemEvent(DiParticleSystemPtr particleSystem, DiFxEvent& event)\n    {\n        if (event.eventType == PU_EVT_SYSTEM_STOPPED)\n        {\n            auto it = mEffects.find(particleSystem);\n            if (it != mEffects.end())\n            {\n                DiParticleSystemPtr ps = *it;\n                auto node = ps->GetParentCullNode();\n                Driver->GetSceneManager()->DestroyNode(node);\n                \n                mEffects.erase(it);\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 \"Moose.h\"\n#include \"FalconApp.h\"\n#include \"AppFactory.h\"\n#include \"ActionFactory.h\"\n#include \"Syntax.h\"\n\n\/\/kernels\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/      solid mechanics                                      \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#include \"SolidMechXFalcon.h\"\n#include \"SolidMechYFalcon.h\"\n#include \"SolidMechZFalcon.h\"\n#include \"SolidMechImplicitEuler.h\"\n\n#include \"SolidMechTempCoupleXFalcon.h\"\n\n#include \"SolidMechTempCoupleYFalcon.h\"\n#include \"SolidMechTempCoupleZFalcon.h\"\n\n#include \"SolidMechPoroCoupleX.h\"\n#include \"SolidMechPoroCoupleY.h\"\n#include \"SolidMechPoroCoupleZ.h\"\n#include \"Gravity.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/      Single phase formulation: pressure & temperature     \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#include \"TemperatureTimeDerivative.h\"\n#include \"TemperatureTimeDerivativeFluid.h\"\n#include \"TemperatureTimeDerivativeSolid.h\"\n#include \"TemperatureDiffusion.h\"\n#include \"TemperatureConvection.h\"\n\n#include \"MassFluxTimeDerivative_PT.h\"\n#include \"MassFluxTimeDerivative_PT_comp.h\"\n#include \"WaterMassFluxPressure_PT.h\"\n#include \"WaterMassFluxElevation_PT.h\"\n#include \"PressureTimeDerivative.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Miscellaneous                                        \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#include \"InjectionSourceSink.h\"\n\n\n\/\/auxkernels\n#include \"CoupledTemperatureAux.h\"         \/\/ T as functon of (P,H) -two phase formulation\n#include \"DarcyFluxAux.h\"\n#include \"VelocityAux.h\"\n#include \"StressStrainDamageComputeAux.h\"\n#include \"FracManMapAux.h\"\n#include \"FracTipLocationAux.h\"\n#include \"StochasticFieldAux.h\"\n\n\/\/BCs\n#include \"PressureNeumannBC2.h\"\n#include \"GravityNeumannBC.h\"\n#include \"OutFlowBC.h\"\n#include \"OutFlowBC_PH.h\"\n#include \"StepDirichletBC.h\"\n#include \"StepPressureBCFunc.h\"\n\n\/\/functions\n#include \"WellFunction.h\"\n\n\/\/ICs\n#include \"LinearDisEnthalpyIC.h\"\n\n\/\/materials\n#include \"Constant.h\"\n#include \"PorousMedia.h\"\n#include \"FluidFlow.h\"\n#include \"HeatTransport.h\"\n#include \"SolidMechanics.h\"\n#include \"ChemicalReactions.h\"\n#include \"Geothermal.h\"\n\n#include \"FracturesPorousMedia.h\"\n#include \"FracturesFluidFlow.h\"\n#include \"FracturesHeatTransport.h\"\n#include \"FracturesSolidMechanics.h\"\n#include \"FracturesChemicalReactions.h\"\n#include \"FracturesGeothermal.h\"\n\n#include \"StochasticMaterial.h\"\n#include \"StochasticPorousMedia.h\"\n#include \"StochasticFluidFlow.h\"\n#include \"StochasticHeatTransport.h\"\n#include \"StochasticSolidMechanics.h\"\n#include \"StochasticChemicalReactions.h\"\n#include \"StochasticGeothermal.h\"\n\n#include \"FracManPorousMedia.h\"\n#include \"FracManFluidFlow.h\"\n#include \"FracManHeatTransport.h\"\n#include \"FracManSolidMechanics.h\"\n#include \"FracManChemicalReactions.h\"\n#include \"FracManGeothermal.h\"\n\n\/\/userobjects\n#include \"WaterSteamEOS.h\"\n\n\/\/postprocessors\n#include \"EOSWaterAndSteamPTFuncPPS.h\"\n#include \"EOSPhaseDetermineFuncPPS.h\"\n#include \"EOSViscosityFuncPPS.h\"\n\n\/\/actions\n#include \"GeothermalMaterialAction.h\"\n#include \"StochasticGeothermalMaterialAction.h\"\n#include \"FracManGeothermalMaterialAction.h\"\n#include \"FracturesGeothermalMaterialAction.h\"\n\n#include \"FluidMassEnergyBalanceApp.h\"\n#include \"ChemicalReactionsApp.h\"\n\n\ntemplate<>\nInputParameters validParams<FalconApp>()\n{\n  InputParameters params = validParams<MooseApp>();\n  return params;\n}\n\nFalconApp::FalconApp(const std::string & name, InputParameters parameters) :\n    MooseApp(name, parameters)\n{\n  srand(processor_id());\n\n  Moose::registerObjects(_factory);\n  FluidMassEnergyBalanceApp::registerObjects(_factory);\n  ChemicalReactionsApp::registerObjects(_factory);\n  FalconApp::registerObjects(_factory);\n\n  Moose::associateSyntax(_syntax, _action_factory);\n  FluidMassEnergyBalanceApp::associateSyntax(_syntax, _action_factory);\n  ChemicalReactionsApp::associateSyntax(_syntax, _action_factory);\n  FalconApp::associateSyntax(_syntax, _action_factory);\n}\n\n\nvoid\nFalconApp::registerApps()\n{\n  registerApp(FalconApp);\n}\n\nvoid\nFalconApp::registerObjects(Factory & factory)\n{\n  \/\/mechanics\n  registerNamedKernel(SolidMechXFalcon, \"SolidMechXFalcon\");\n  registerNamedKernel(SolidMechYFalcon, \"SolidMechYFalcon\");\n  registerNamedKernel(SolidMechZFalcon, \"SolidMechZFalcon\");\n  registerKernel(SolidMechImplicitEuler);\n\n  registerKernel(SolidMechTempCoupleXFalcon);\n  registerKernel(SolidMechTempCoupleYFalcon);\n  registerKernel(SolidMechTempCoupleZFalcon);\n\n  registerKernel(SolidMechPoroCoupleX);\n  registerKernel(SolidMechPoroCoupleY);\n  registerKernel(SolidMechPoroCoupleZ);\n  registerKernel(Gravity);\n\n  \/\/isothermal flow for pressure field\n  registerKernel(PressureTimeDerivative);\n  \/\/heat transport-PT formulation, single phase only\n  registerKernel(TemperatureTimeDerivative);\n  registerKernel(TemperatureTimeDerivativeFluid);\n  registerKernel(TemperatureTimeDerivativeSolid);\n  registerKernel(TemperatureDiffusion);\n  registerKernel(TemperatureConvection);\n  \/\/fluid-mass flow-single phase formulation\n  registerKernel(MassFluxTimeDerivative_PT);\n  registerKernel(MassFluxTimeDerivative_PT_comp);\n  registerKernel(WaterMassFluxPressure_PT);\n  registerKernel(WaterMassFluxElevation_PT);\n\n  \/\/miscellaneous kernels\n  registerKernel(InjectionSourceSink);\n\n  \/\/auxkernels\n  registerAux(CoupledTemperatureAux);\n  registerAux(DarcyFluxAux);\n  registerAux(VelocityAux);\n  registerAux(StressStrainDamageComputeAux);\n  registerAux(StochasticFieldAux);\n  registerAux(FracManMapAux);\n  registerAux(FracTipLocationAux);\n  \n\n  \/\/BCs\n  registerNamedBoundaryCondition(PressureNeumannBC2, \"PressureNeumannBC\");\n  registerBoundaryCondition(GravityNeumannBC);\n  registerBoundaryCondition(OutFlowBC);\n  registerBoundaryCondition(OutFlowBC_PH);\n  registerBoundaryCondition(StepDirichletBC);\n  registerBoundaryCondition(StepPressureBCFunc);\n\n  \/\/functions\n  registerFunction(WellFunction);\n\n  \/\/ ICs\n  registerInitialCondition(LinearDisEnthalpyIC);\n\n  \/\/materials\n  registerMaterial(Constant);\n  registerMaterial(PorousMedia);\n  registerMaterial(FluidFlow);\n  registerMaterial(HeatTransport);\n  registerMaterial(SolidMechanics);\n  registerMaterial(ChemicalReactions);\n  registerMaterial(Geothermal);\n\n  registerMaterial(FracturesPorousMedia);\n  registerMaterial(FracturesFluidFlow);\n  registerMaterial(FracturesHeatTransport);\n  registerMaterial(FracturesSolidMechanics);\n  registerMaterial(FracturesChemicalReactions);\n  registerMaterial(FracturesGeothermal);\n\n  registerMaterial(StochasticMaterial);\n  registerMaterial(StochasticPorousMedia);\n  registerMaterial(StochasticFluidFlow);\n  registerMaterial(StochasticHeatTransport);\n  registerMaterial(StochasticSolidMechanics);\n  registerMaterial(StochasticChemicalReactions);\n  registerMaterial(StochasticGeothermal);\n\n  registerMaterial(FracManPorousMedia);\n  registerMaterial(FracManFluidFlow);\n  registerMaterial(FracManHeatTransport);\n  registerMaterial(FracManSolidMechanics);\n  registerMaterial(FracManChemicalReactions);\n  registerMaterial(FracManGeothermal);\n\n  \/\/userobjects\n  registerUserObject(WaterSteamEOS);\n\n  \/\/postprocessors\n  registerPostprocessor(EOSWaterAndSteamPTFuncPPS);\n  registerPostprocessor(EOSPhaseDetermineFuncPPS);\n  registerPostprocessor(EOSViscosityFuncPPS);\n}\n\n\n\nvoid\nFalconApp::associateSyntax(Syntax & syntax, ActionFactory & action_factory)\n{\n  registerAction(GeothermalMaterialAction, \"add_material\");\n  registerAction(StochasticGeothermalMaterialAction, \"add_material\");\n  registerAction(FracManGeothermalMaterialAction, \"add_material\");\n  registerAction(FracturesGeothermalMaterialAction, \"add_material\");\n\n  syntax.registerActionSyntax(\"GeothermalMaterialAction\", \"Materials\/GeothermalMaterial\");\n  syntax.registerActionSyntax(\"StochasticGeothermalMaterialAction\", \"Materials\/StochasticGeothermalMaterial\");\n  syntax.registerActionSyntax(\"FracManGeothermalMaterialAction\", \"Materials\/FracManGeothermalMaterial\");\n  syntax.registerActionSyntax(\"FracturesGeothermalMaterialAction\", \"Materials\/FracturesGeothermalMaterial\");\n}\n<commit_msg>fixing error in FalconApp.C<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 \"Moose.h\"\n#include \"FalconApp.h\"\n#include \"AppFactory.h\"\n#include \"ActionFactory.h\"\n#include \"Syntax.h\"\n\n\/\/kernels\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/      solid mechanics                                      \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#include \"SolidMechXFalcon.h\"\n#include \"SolidMechYFalcon.h\"\n#include \"SolidMechZFalcon.h\"\n#include \"SolidMechImplicitEuler.h\"\n\n#include \"SolidMechTempCoupleXFalcon.h\"\n\n#include \"SolidMechTempCoupleYFalcon.h\"\n#include \"SolidMechTempCoupleZFalcon.h\"\n\n#include \"SolidMechPoroCoupleX.h\"\n#include \"SolidMechPoroCoupleY.h\"\n#include \"SolidMechPoroCoupleZ.h\"\n#include \"Gravity.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/      Single phase formulation: pressure & temperature     \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#include \"TemperatureTimeDerivative.h\"\n#include \"TemperatureTimeDerivativeFluid.h\"\n#include \"TemperatureTimeDerivativeSolid.h\"\n#include \"TemperatureDiffusion.h\"\n#include \"TemperatureConvection.h\"\n\n#include \"MassFluxTimeDerivative_PT.h\"\n#include \"MassFluxTimeDerivative_PT_comp.h\"\n#include \"WaterMassFluxPressure_PT.h\"\n#include \"WaterMassFluxElevation_PT.h\"\n#include \"PressureTimeDerivative.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Miscellaneous                                        \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#include \"InjectionSourceSink.h\"\n\n\n\/\/auxkernels\n#include \"CoupledTemperatureAux.h\"         \/\/ T as functon of (P,H) -two phase formulation\n#include \"DarcyFluxAux.h\"\n#include \"VelocityAux.h\"\n#include \"StressStrainDamageComputeAux.h\"\n#include \"FracManMapAux.h\"\n#include \"FracTipLocationAux.h\"\n#include \"StochasticFieldAux.h\"\n\n\/\/BCs\n#include \"PressureNeumannBC2.h\"\n#include \"GravityNeumannBC.h\"\n#include \"OutFlowBC.h\"\n#include \"OutFlowBC_PH.h\"\n#include \"StepDirichletBC.h\"\n#include \"StepPressureBCFunc.h\"\n\n\/\/ICs\n#include \"LinearDisEnthalpyIC.h\"\n\n\/\/materials\n#include \"Constant.h\"\n#include \"PorousMedia.h\"\n#include \"FluidFlow.h\"\n#include \"HeatTransport.h\"\n#include \"SolidMechanics.h\"\n#include \"ChemicalReactions.h\"\n#include \"Geothermal.h\"\n\n#include \"FracturesPorousMedia.h\"\n#include \"FracturesFluidFlow.h\"\n#include \"FracturesHeatTransport.h\"\n#include \"FracturesSolidMechanics.h\"\n#include \"FracturesChemicalReactions.h\"\n#include \"FracturesGeothermal.h\"\n\n#include \"StochasticMaterial.h\"\n#include \"StochasticPorousMedia.h\"\n#include \"StochasticFluidFlow.h\"\n#include \"StochasticHeatTransport.h\"\n#include \"StochasticSolidMechanics.h\"\n#include \"StochasticChemicalReactions.h\"\n#include \"StochasticGeothermal.h\"\n\n#include \"FracManPorousMedia.h\"\n#include \"FracManFluidFlow.h\"\n#include \"FracManHeatTransport.h\"\n#include \"FracManSolidMechanics.h\"\n#include \"FracManChemicalReactions.h\"\n#include \"FracManGeothermal.h\"\n\n\/\/userobjects\n#include \"WaterSteamEOS.h\"\n\n\/\/postprocessors\n#include \"EOSWaterAndSteamPTFuncPPS.h\"\n#include \"EOSPhaseDetermineFuncPPS.h\"\n#include \"EOSViscosityFuncPPS.h\"\n\n\/\/actions\n#include \"GeothermalMaterialAction.h\"\n#include \"StochasticGeothermalMaterialAction.h\"\n#include \"FracManGeothermalMaterialAction.h\"\n#include \"FracturesGeothermalMaterialAction.h\"\n\n#include \"FluidMassEnergyBalanceApp.h\"\n#include \"ChemicalReactionsApp.h\"\n\n\ntemplate<>\nInputParameters validParams<FalconApp>()\n{\n  InputParameters params = validParams<MooseApp>();\n  return params;\n}\n\nFalconApp::FalconApp(const std::string & name, InputParameters parameters) :\n    MooseApp(name, parameters)\n{\n  srand(processor_id());\n\n  Moose::registerObjects(_factory);\n  FluidMassEnergyBalanceApp::registerObjects(_factory);\n  ChemicalReactionsApp::registerObjects(_factory);\n  FalconApp::registerObjects(_factory);\n\n  Moose::associateSyntax(_syntax, _action_factory);\n  FluidMassEnergyBalanceApp::associateSyntax(_syntax, _action_factory);\n  ChemicalReactionsApp::associateSyntax(_syntax, _action_factory);\n  FalconApp::associateSyntax(_syntax, _action_factory);\n}\n\n\nvoid\nFalconApp::registerApps()\n{\n  registerApp(FalconApp);\n}\n\nvoid\nFalconApp::registerObjects(Factory & factory)\n{\n  \/\/mechanics\n  registerNamedKernel(SolidMechXFalcon, \"SolidMechXFalcon\");\n  registerNamedKernel(SolidMechYFalcon, \"SolidMechYFalcon\");\n  registerNamedKernel(SolidMechZFalcon, \"SolidMechZFalcon\");\n  registerKernel(SolidMechImplicitEuler);\n\n  registerKernel(SolidMechTempCoupleXFalcon);\n  registerKernel(SolidMechTempCoupleYFalcon);\n  registerKernel(SolidMechTempCoupleZFalcon);\n\n  registerKernel(SolidMechPoroCoupleX);\n  registerKernel(SolidMechPoroCoupleY);\n  registerKernel(SolidMechPoroCoupleZ);\n  registerKernel(Gravity);\n\n  \/\/isothermal flow for pressure field\n  registerKernel(PressureTimeDerivative);\n  \/\/heat transport-PT formulation, single phase only\n  registerKernel(TemperatureTimeDerivative);\n  registerKernel(TemperatureTimeDerivativeFluid);\n  registerKernel(TemperatureTimeDerivativeSolid);\n  registerKernel(TemperatureDiffusion);\n  registerKernel(TemperatureConvection);\n  \/\/fluid-mass flow-single phase formulation\n  registerKernel(MassFluxTimeDerivative_PT);\n  registerKernel(MassFluxTimeDerivative_PT_comp);\n  registerKernel(WaterMassFluxPressure_PT);\n  registerKernel(WaterMassFluxElevation_PT);\n\n  \/\/miscellaneous kernels\n  registerKernel(InjectionSourceSink);\n\n  \/\/auxkernels\n  registerAux(CoupledTemperatureAux);\n  registerAux(DarcyFluxAux);\n  registerAux(VelocityAux);\n  registerAux(StressStrainDamageComputeAux);\n  registerAux(StochasticFieldAux);\n  registerAux(FracManMapAux);\n  registerAux(FracTipLocationAux);\n  \n\n  \/\/BCs\n  registerNamedBoundaryCondition(PressureNeumannBC2, \"PressureNeumannBC\");\n  registerBoundaryCondition(GravityNeumannBC);\n  registerBoundaryCondition(OutFlowBC);\n  registerBoundaryCondition(OutFlowBC_PH);\n  registerBoundaryCondition(StepDirichletBC);\n  registerBoundaryCondition(StepPressureBCFunc);\n\n  \/\/ ICs\n  registerInitialCondition(LinearDisEnthalpyIC);\n\n  \/\/materials\n  registerMaterial(Constant);\n  registerMaterial(PorousMedia);\n  registerMaterial(FluidFlow);\n  registerMaterial(HeatTransport);\n  registerMaterial(SolidMechanics);\n  registerMaterial(ChemicalReactions);\n  registerMaterial(Geothermal);\n\n  registerMaterial(FracturesPorousMedia);\n  registerMaterial(FracturesFluidFlow);\n  registerMaterial(FracturesHeatTransport);\n  registerMaterial(FracturesSolidMechanics);\n  registerMaterial(FracturesChemicalReactions);\n  registerMaterial(FracturesGeothermal);\n\n  registerMaterial(StochasticMaterial);\n  registerMaterial(StochasticPorousMedia);\n  registerMaterial(StochasticFluidFlow);\n  registerMaterial(StochasticHeatTransport);\n  registerMaterial(StochasticSolidMechanics);\n  registerMaterial(StochasticChemicalReactions);\n  registerMaterial(StochasticGeothermal);\n\n  registerMaterial(FracManPorousMedia);\n  registerMaterial(FracManFluidFlow);\n  registerMaterial(FracManHeatTransport);\n  registerMaterial(FracManSolidMechanics);\n  registerMaterial(FracManChemicalReactions);\n  registerMaterial(FracManGeothermal);\n\n  \/\/userobjects\n  registerUserObject(WaterSteamEOS);\n\n  \/\/postprocessors\n  registerPostprocessor(EOSWaterAndSteamPTFuncPPS);\n  registerPostprocessor(EOSPhaseDetermineFuncPPS);\n  registerPostprocessor(EOSViscosityFuncPPS);\n}\n\n\n\nvoid\nFalconApp::associateSyntax(Syntax & syntax, ActionFactory & action_factory)\n{\n  registerAction(GeothermalMaterialAction, \"add_material\");\n  registerAction(StochasticGeothermalMaterialAction, \"add_material\");\n  registerAction(FracManGeothermalMaterialAction, \"add_material\");\n  registerAction(FracturesGeothermalMaterialAction, \"add_material\");\n\n  syntax.registerActionSyntax(\"GeothermalMaterialAction\", \"Materials\/GeothermalMaterial\");\n  syntax.registerActionSyntax(\"StochasticGeothermalMaterialAction\", \"Materials\/StochasticGeothermalMaterial\");\n  syntax.registerActionSyntax(\"FracManGeothermalMaterialAction\", \"Materials\/FracManGeothermalMaterial\");\n  syntax.registerActionSyntax(\"FracturesGeothermalMaterialAction\", \"Materials\/FracturesGeothermalMaterial\");\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ tenh\/conceptual\/exteriorpower.hpp by Victor Dods, created 2013\/08\/15\n\/\/ Copyright Leap Motion Inc.\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#ifndef TENH_CONCEPTUAL_EXTERIORPOWER_HPP_\n#define TENH_CONCEPTUAL_EXTERIORPOWER_HPP_\n\n#include \"tenh\/core.hpp\"\n\n#include \"tenh\/conceptual\/embeddableintensorproduct.hpp\"\n#include \"tenh\/conceptual\/tensorpower.hpp\" \/\/ for TypeListWithMultiplicity_t and probably nothing else\n#include \"tenh\/conceptual\/vectorspace.hpp\"\n\nnamespace Tenh {\n\n\/\/ exterior power of formal symbols (e.g. identifiers, builtin C++ types, etc)\ntemplate <typename Factor_, Uint32 ORDER_>\nstruct ExteriorPower_c\n{\n    static Uint32 const ORDER = ORDER_;\n    typedef Factor_ Factor;\n    typedef typename TypeListWithMultiplicity_t<Factor,ORDER>::T FactorTypeList;\n    typedef typename DualOf_c<ExteriorPower_c>::T Dual; \/\/ the dual is not the exterior power of Factor::Dual\n\n    static std::string type_as_string ()\n    {\n        return \"ExteriorPower_c<\" + TypeStringOf_t<Factor>::eval() + ',' + AS_STRING(ORDER) + '>';\n    }\n};\n\ntemplate <typename T> struct IsAnExteriorPower_c { static bool const V = false; };\ntemplate <typename Factor, Uint32 ORDER> struct IsAnExteriorPower_c<ExteriorPower_c<Factor,ORDER> > { static bool const V = true; };\n\n\n\n\n\/\/ FactorTypeList_ must be a TypeList_t of VectorSpace_c types\n\/\/ TODO: real dimension calculation\ntemplate <typename Factor_, Uint32 ORDER_>\nstruct ExteriorPowerOfVectorSpaces_c\n{\n    typedef ExteriorPower_c<Factor_,ORDER_> As_ExteriorPower;\n    typedef VectorSpace_c<typename Factor_::Field,42,ExteriorPower_c<typename Factor_::Id,ORDER_> > As_VectorSpace;\n\n    enum\n    {\n        STATIC_ASSERT_IN_ENUM(IsAVectorSpace_c<Factor_>::V, MUST_BE_VECTOR_SPACE),\n    };\n\n    typedef typename As_ExteriorPower::FactorTypeList FactorTypeList;\n    static Uint32 const ORDER = As_ExteriorPower::ORDER;\n    typedef typename As_VectorSpace::Field Field;\n    static Uint32 const DIM = As_VectorSpace::DIM;\n    typedef typename As_VectorSpace::Id Id;\n    typedef typename DualOf_c<ExteriorPowerOfVectorSpaces_c>::T Dual; \/\/ the dual is not the exterior power of Factor::Dual\n    typedef Factor_ Factor;\n\n    static std::string type_as_string ()\n    {\n        return \"ExteriorPowerOfVectorSpaces_c<\" + TypeStringOf_t<Factor>::eval() + ',' + AS_STRING(ORDER) + '>';\n    }\n};\n\ntemplate <typename Factor, Uint32 ORDER> struct IsAnExteriorPower_c<ExteriorPowerOfVectorSpaces_c<Factor,ORDER> > { static bool const V = true; };\ntemplate <typename Factor, Uint32 ORDER> struct IsAVectorSpace_c<ExteriorPowerOfVectorSpaces_c<Factor,ORDER> > { static bool const V = true; };\n\ntemplate <typename T> struct IsAnExteriorPowerOfVectorSpaces_c { static bool const V = false; };\ntemplate <typename Factor, Uint32 ORDER> struct IsAnExteriorPowerOfVectorSpaces_c<ExteriorPowerOfVectorSpaces_c<Factor,ORDER> > { static bool const V = true; };\n\n\n\/\/ Factor_ must be a Basis_c type\ntemplate <typename Factor_, Uint32 ORDER_>\nstruct ExteriorPowerOfBases_c\n{\n    typedef ExteriorPower_c<Factor_,ORDER_> As_ExteriorPower;\n    typedef Basis_c<ExteriorPower_c<Factor_,ORDER_> > As_Basis;\n\n    enum\n    {\n        STATIC_ASSERT_IN_ENUM(IsABasis_c<Factor_>::V, MUST_BE_BASIS)\n    };\n\n    \/\/typedef typename As_ExteriorPower::FactorTypeList FactorTypeList;\n    static Uint32 const ORDER = As_ExteriorPower::ORDER;\n    typedef typename As_Basis::Id Id;\n    typedef typename DualOf_c<ExteriorPowerOfBases_c>::T Dual; \/\/ the dual is not the exterior power of Factor::Dual\n    typedef Factor_ Factor;\n\n    static std::string type_as_string ()\n    {\n        return \"ExteriorPowerOfBases_c<\" + TypeStringOf_t<Factor>::eval() + ',' + AS_STRING(ORDER) + '>';\n    }\n};\n\ntemplate <typename Factor, Uint32 ORDER> struct IsAnExteriorPower_c<ExteriorPowerOfBases_c<Factor,ORDER> > { static bool const V = true; };\ntemplate <typename Factor, Uint32 ORDER> struct IsABasis_c<ExteriorPowerOfBases_c<Factor,ORDER> > { static bool const V = true; };\n\ntemplate <typename T> struct IsAnExteriorPowerOfBases_c { static bool const V = false; };\ntemplate <typename Factor, Uint32 ORDER> struct IsAnExteriorPowerOfBases_c<ExteriorPowerOfBases_c<Factor,ORDER> > { static bool const V = true; };\n\n\ntemplate <typename ExteriorPowerOfVectorSpaces, typename Basis_>\nstruct BasedExteriorPowerOfVectorSpaces_c\n{\n    typedef ExteriorPowerOfVectorSpaces As_ExteriorPowerOfVectorSpaces;\n    typedef BasedVectorSpace_c<ExteriorPowerOfVectorSpaces,Basis_> As_BasedVectorSpace;\n\/\/     typedef BasedExteriorProductOfVectorSpaces_c<ExteriorPowerOfVectorSpaces,Basis_> As_BasedExteriorProductOfVectorSpaces;\n\n    enum\n    {\n        STATIC_ASSERT_IN_ENUM(IsAnExteriorPowerOfVectorSpaces_c<ExteriorPowerOfVectorSpaces>::V, MUST_BE_EXTERIOR_POWER_OF_VECTOR_SPACES),\n        STATIC_ASSERT_IN_ENUM(IsABasis_c<Basis_>::V, MUST_BE_BASIS),\n    };\n\n    \/\/typedef typename As_ExteriorPowerOfVectorSpaces::FactorTypeList FactorTypeList;\n    static Uint32 const ORDER = As_ExteriorPowerOfVectorSpaces::ORDER;\n    typedef typename As_BasedVectorSpace::Field Field;\n    static Uint32 const DIM = As_BasedVectorSpace::DIM;\n    typedef typename As_BasedVectorSpace::Id Id;\n    typedef typename As_BasedVectorSpace::Basis Basis;\n    typedef typename DualOf_c<BasedExteriorPowerOfVectorSpaces_c>::T Dual; \/\/ relies on the template specialization below\n\n    static std::string type_as_string ()\n    {\n        return \"BasedExteriorPowerOfVectorSpaces_c<\" + TypeStringOf_t<ExteriorPowerOfVectorSpaces>::eval() + ','\n                                                     + TypeStringOf_t<Basis>::eval() + '>';\n    }\n};\n\ntemplate <typename ExteriorPowerOfVectorSpaces, typename Basis> struct IsAVectorSpace_c<BasedExteriorPowerOfVectorSpaces_c<ExteriorPowerOfVectorSpaces,Basis> > { static bool const V = true; };\ntemplate <typename ExteriorPowerOfVectorSpaces, typename Basis> struct IsABasedVectorSpace_c<BasedExteriorPowerOfVectorSpaces_c<ExteriorPowerOfVectorSpaces,Basis> > { static bool const V = true; };\ntemplate <typename ExteriorPowerOfVectorSpaces, typename Basis> struct IsAnExteriorPowerOfVectorSpaces_c<BasedExteriorPowerOfVectorSpaces_c<ExteriorPowerOfVectorSpaces,Basis> > { static bool const V = true; };\n\ntemplate <typename T> struct IsABasedExteriorPowerOfVectorSpaces_c { static bool const V = false; };\ntemplate <typename ExteriorPowerOfVectorSpaces, typename Basis> struct IsABasedExteriorPowerOfVectorSpaces_c<BasedExteriorPowerOfVectorSpaces_c<ExteriorPowerOfVectorSpaces,Basis> > { static bool const V = true; };\n\ntemplate <typename ExteriorPowerOfVectorSpaces, typename Basis>\nstruct DualOf_c<BasedExteriorPowerOfVectorSpaces_c<ExteriorPowerOfVectorSpaces,Basis> >\n{\n    typedef BasedExteriorPowerOfVectorSpaces_c<typename DualOf_c<ExteriorPowerOfVectorSpaces>::T,typename DualOf_c<Basis>::T> T;\n};\n\n\n\n\/\/ Factor_ must be a BasedVectorSpace_c type\ntemplate <typename Factor_, Uint32 ORDER_>\nstruct ExteriorPowerOfBasedVectorSpaces_c\n{\n    enum { STATIC_ASSERT_IN_ENUM(IsABasedVectorSpace_c<Factor_>::V, MUST_BE_BASED_VECTOR_SPACE), };\n\n    typedef ExteriorPowerOfVectorSpaces_c<typename Factor_::As_VectorSpace,ORDER_> As_ExteriorPowerOfVectorSpaces;\n    typedef BasedVectorSpace_c<ExteriorPowerOfVectorSpaces_c<typename Factor_::As_VectorSpace,ORDER_>,\n                               ExteriorPowerOfBases_c<typename Factor_::Basis,ORDER_> > As_BasedVectorSpace;\n    typedef EmbeddableInTensorProductOfBasedVectorSpaces_c<TensorPowerOfBasedVectorSpaces_c<Factor_,ORDER_> > As_EmbeddableInTensorProductOfBasedVectorSpaces;\n\n    typedef typename As_EmbeddableInTensorProductOfBasedVectorSpaces::FactorTypeList FactorTypeList;\n\n    enum { STATIC_ASSERT_IN_ENUM(AllFactorsAreBasedVectorSpaces_t<FactorTypeList>::V, ALL_FACTORS_MUST_BE_BASED_VECTOR_SPACES) };\n\n    typedef TensorProductOfBasedVectorSpaces_c<FactorTypeList> TensorProductOfBasedVectorSpaces;\n    static Uint32 const ORDER = As_ExteriorPowerOfVectorSpaces::ORDER;\n    typedef typename As_BasedVectorSpace::Field Field;\n    static Uint32 const DIM = As_BasedVectorSpace::DIM;\n    typedef typename As_BasedVectorSpace::Id Id;\n    typedef typename As_BasedVectorSpace::Basis Basis;\n    typedef typename DualOf_c<ExteriorPowerOfBasedVectorSpaces_c>::T Dual; \/\/ relies on the template specialization below\n    typedef Factor_ Factor;\n\n    static std::string type_as_string ()\n    {\n        return \"ExteriorProductOfBasedVectorSpaces_c<\" + TypeStringOf_t<Factor>::eval() + ',' + AS_STRING(ORDER) + '>';\n    }\n};\n\ntemplate <typename Factor, Uint32 ORDER> struct IsAVectorSpace_c<ExteriorPowerOfBasedVectorSpaces_c<Factor,ORDER> > { static bool const V = true; };\ntemplate <typename Factor, Uint32 ORDER> struct IsAnExteriorPower_c<ExteriorPowerOfBasedVectorSpaces_c<Factor,ORDER> > { static bool const V = true; };\ntemplate <typename Factor, Uint32 ORDER> struct IsAnExteriorPowerOfVectorSpaces_c<ExteriorPowerOfBasedVectorSpaces_c<Factor,ORDER> > { static bool const V = true; };\ntemplate <typename Factor, Uint32 ORDER> struct IsABasedVectorSpace_c<ExteriorPowerOfBasedVectorSpaces_c<Factor,ORDER> > { static bool const V = true; };\ntemplate <typename Factor, Uint32 ORDER> struct IsEmbeddableInTensorProductOfBasedVectorSpaces_c<ExteriorPowerOfBasedVectorSpaces_c<Factor,ORDER> > { static bool const V = true; };\n\ntemplate <typename T> struct IsAnExteriorPowerOfBasedVectorSpaces_c { static bool const V = false; };\ntemplate <typename Factor, Uint32 ORDER> struct IsAnExteriorPowerOfBasedVectorSpaces_c<ExteriorPowerOfBasedVectorSpaces_c<Factor,ORDER> > { static bool const V = true; };\n\ntemplate <typename Factor, Uint32 ORDER>\nstruct DualOf_c<ExteriorPowerOfBasedVectorSpaces_c<Factor,ORDER> >\n{\n    typedef BasedExteriorPowerOfVectorSpaces_c<typename DualOf_c<ExteriorPowerOfVectorSpaces_c<typename Factor::As_VectorSpace,ORDER> >::T,\n                                               typename DualOf_c<typename ExteriorPowerOfBasedVectorSpaces_c<Factor,ORDER>::Basis>::T> T;\n};\n\n} \/\/ end of namespace Tenh\n\n#endif \/\/ TENH_CONCEPTUAL_EXTERIORPOWER_HPP_\n<commit_msg>Add correct dimension calculation to ExteriorPowerOfVectorSpaces_c.<commit_after>\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ tenh\/conceptual\/exteriorpower.hpp by Victor Dods, created 2013\/08\/15\n\/\/ Copyright Leap Motion Inc.\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#ifndef TENH_CONCEPTUAL_EXTERIORPOWER_HPP_\n#define TENH_CONCEPTUAL_EXTERIORPOWER_HPP_\n\n#include \"tenh\/core.hpp\"\n\n#include \"tenh\/conceptual\/embeddableintensorproduct.hpp\"\n#include \"tenh\/conceptual\/tensorpower.hpp\" \/\/ for TypeListWithMultiplicity_t and probably nothing else\n#include \"tenh\/conceptual\/vectorspace.hpp\"\n#include \"tenh\/mathutil.hpp\"\n\nnamespace Tenh {\n\n\/\/ exterior power of formal symbols (e.g. identifiers, builtin C++ types, etc)\ntemplate <typename Factor_, Uint32 ORDER_>\nstruct ExteriorPower_c\n{\n    static Uint32 const ORDER = ORDER_;\n    typedef Factor_ Factor;\n    typedef typename TypeListWithMultiplicity_t<Factor,ORDER>::T FactorTypeList;\n    typedef typename DualOf_c<ExteriorPower_c>::T Dual; \/\/ the dual is not the exterior power of Factor::Dual\n\n    static std::string type_as_string ()\n    {\n        return \"ExteriorPower_c<\" + TypeStringOf_t<Factor>::eval() + ',' + AS_STRING(ORDER) + '>';\n    }\n};\n\ntemplate <typename T> struct IsAnExteriorPower_c { static bool const V = false; };\ntemplate <typename Factor, Uint32 ORDER> struct IsAnExteriorPower_c<ExteriorPower_c<Factor,ORDER> > { static bool const V = true; };\n\n\n\n\n\/\/ FactorTypeList_ must be a TypeList_t of VectorSpace_c types\ntemplate <typename Factor_, Uint32 ORDER_>\nstruct ExteriorPowerOfVectorSpaces_c\n{\n    typedef ExteriorPower_c<Factor_,ORDER_> As_ExteriorPower;\n    typedef VectorSpace_c<typename Factor_::Field,BinomialCoefficient_t<Factor_::DIM, ORDER_>::V,ExteriorPower_c<typename Factor_::Id,ORDER_> > As_VectorSpace;\n\n    enum\n    {\n        STATIC_ASSERT_IN_ENUM(IsAVectorSpace_c<Factor_>::V, MUST_BE_VECTOR_SPACE),\n    };\n\n    typedef typename As_ExteriorPower::FactorTypeList FactorTypeList;\n    static Uint32 const ORDER = As_ExteriorPower::ORDER;\n    typedef typename As_VectorSpace::Field Field;\n    static Uint32 const DIM = As_VectorSpace::DIM;\n    typedef typename As_VectorSpace::Id Id;\n    typedef typename DualOf_c<ExteriorPowerOfVectorSpaces_c>::T Dual; \/\/ the dual is not the exterior power of Factor::Dual\n    typedef Factor_ Factor;\n\n    static std::string type_as_string ()\n    {\n        return \"ExteriorPowerOfVectorSpaces_c<\" + TypeStringOf_t<Factor>::eval() + ',' + AS_STRING(ORDER) + '>';\n    }\n};\n\ntemplate <typename Factor, Uint32 ORDER> struct IsAnExteriorPower_c<ExteriorPowerOfVectorSpaces_c<Factor,ORDER> > { static bool const V = true; };\ntemplate <typename Factor, Uint32 ORDER> struct IsAVectorSpace_c<ExteriorPowerOfVectorSpaces_c<Factor,ORDER> > { static bool const V = true; };\n\ntemplate <typename T> struct IsAnExteriorPowerOfVectorSpaces_c { static bool const V = false; };\ntemplate <typename Factor, Uint32 ORDER> struct IsAnExteriorPowerOfVectorSpaces_c<ExteriorPowerOfVectorSpaces_c<Factor,ORDER> > { static bool const V = true; };\n\n\n\/\/ Factor_ must be a Basis_c type\ntemplate <typename Factor_, Uint32 ORDER_>\nstruct ExteriorPowerOfBases_c\n{\n    typedef ExteriorPower_c<Factor_,ORDER_> As_ExteriorPower;\n    typedef Basis_c<ExteriorPower_c<Factor_,ORDER_> > As_Basis;\n\n    enum\n    {\n        STATIC_ASSERT_IN_ENUM(IsABasis_c<Factor_>::V, MUST_BE_BASIS)\n    };\n\n    \/\/typedef typename As_ExteriorPower::FactorTypeList FactorTypeList;\n    static Uint32 const ORDER = As_ExteriorPower::ORDER;\n    typedef typename As_Basis::Id Id;\n    typedef typename DualOf_c<ExteriorPowerOfBases_c>::T Dual; \/\/ the dual is not the exterior power of Factor::Dual\n    typedef Factor_ Factor;\n\n    static std::string type_as_string ()\n    {\n        return \"ExteriorPowerOfBases_c<\" + TypeStringOf_t<Factor>::eval() + ',' + AS_STRING(ORDER) + '>';\n    }\n};\n\ntemplate <typename Factor, Uint32 ORDER> struct IsAnExteriorPower_c<ExteriorPowerOfBases_c<Factor,ORDER> > { static bool const V = true; };\ntemplate <typename Factor, Uint32 ORDER> struct IsABasis_c<ExteriorPowerOfBases_c<Factor,ORDER> > { static bool const V = true; };\n\ntemplate <typename T> struct IsAnExteriorPowerOfBases_c { static bool const V = false; };\ntemplate <typename Factor, Uint32 ORDER> struct IsAnExteriorPowerOfBases_c<ExteriorPowerOfBases_c<Factor,ORDER> > { static bool const V = true; };\n\n\ntemplate <typename ExteriorPowerOfVectorSpaces, typename Basis_>\nstruct BasedExteriorPowerOfVectorSpaces_c\n{\n    typedef ExteriorPowerOfVectorSpaces As_ExteriorPowerOfVectorSpaces;\n    typedef BasedVectorSpace_c<ExteriorPowerOfVectorSpaces,Basis_> As_BasedVectorSpace;\n\/\/     typedef BasedExteriorProductOfVectorSpaces_c<ExteriorPowerOfVectorSpaces,Basis_> As_BasedExteriorProductOfVectorSpaces;\n\n    enum\n    {\n        STATIC_ASSERT_IN_ENUM(IsAnExteriorPowerOfVectorSpaces_c<ExteriorPowerOfVectorSpaces>::V, MUST_BE_EXTERIOR_POWER_OF_VECTOR_SPACES),\n        STATIC_ASSERT_IN_ENUM(IsABasis_c<Basis_>::V, MUST_BE_BASIS),\n    };\n\n    \/\/typedef typename As_ExteriorPowerOfVectorSpaces::FactorTypeList FactorTypeList;\n    static Uint32 const ORDER = As_ExteriorPowerOfVectorSpaces::ORDER;\n    typedef typename As_BasedVectorSpace::Field Field;\n    static Uint32 const DIM = As_BasedVectorSpace::DIM;\n    typedef typename As_BasedVectorSpace::Id Id;\n    typedef typename As_BasedVectorSpace::Basis Basis;\n    typedef typename DualOf_c<BasedExteriorPowerOfVectorSpaces_c>::T Dual; \/\/ relies on the template specialization below\n\n    static std::string type_as_string ()\n    {\n        return \"BasedExteriorPowerOfVectorSpaces_c<\" + TypeStringOf_t<ExteriorPowerOfVectorSpaces>::eval() + ','\n                                                     + TypeStringOf_t<Basis>::eval() + '>';\n    }\n};\n\ntemplate <typename ExteriorPowerOfVectorSpaces, typename Basis> struct IsAVectorSpace_c<BasedExteriorPowerOfVectorSpaces_c<ExteriorPowerOfVectorSpaces,Basis> > { static bool const V = true; };\ntemplate <typename ExteriorPowerOfVectorSpaces, typename Basis> struct IsABasedVectorSpace_c<BasedExteriorPowerOfVectorSpaces_c<ExteriorPowerOfVectorSpaces,Basis> > { static bool const V = true; };\ntemplate <typename ExteriorPowerOfVectorSpaces, typename Basis> struct IsAnExteriorPowerOfVectorSpaces_c<BasedExteriorPowerOfVectorSpaces_c<ExteriorPowerOfVectorSpaces,Basis> > { static bool const V = true; };\n\ntemplate <typename T> struct IsABasedExteriorPowerOfVectorSpaces_c { static bool const V = false; };\ntemplate <typename ExteriorPowerOfVectorSpaces, typename Basis> struct IsABasedExteriorPowerOfVectorSpaces_c<BasedExteriorPowerOfVectorSpaces_c<ExteriorPowerOfVectorSpaces,Basis> > { static bool const V = true; };\n\ntemplate <typename ExteriorPowerOfVectorSpaces, typename Basis>\nstruct DualOf_c<BasedExteriorPowerOfVectorSpaces_c<ExteriorPowerOfVectorSpaces,Basis> >\n{\n    typedef BasedExteriorPowerOfVectorSpaces_c<typename DualOf_c<ExteriorPowerOfVectorSpaces>::T,typename DualOf_c<Basis>::T> T;\n};\n\n\n\n\/\/ Factor_ must be a BasedVectorSpace_c type\ntemplate <typename Factor_, Uint32 ORDER_>\nstruct ExteriorPowerOfBasedVectorSpaces_c\n{\n    enum { STATIC_ASSERT_IN_ENUM(IsABasedVectorSpace_c<Factor_>::V, MUST_BE_BASED_VECTOR_SPACE), };\n\n    typedef ExteriorPowerOfVectorSpaces_c<typename Factor_::As_VectorSpace,ORDER_> As_ExteriorPowerOfVectorSpaces;\n    typedef BasedVectorSpace_c<ExteriorPowerOfVectorSpaces_c<typename Factor_::As_VectorSpace,ORDER_>,\n                               ExteriorPowerOfBases_c<typename Factor_::Basis,ORDER_> > As_BasedVectorSpace;\n    typedef EmbeddableInTensorProductOfBasedVectorSpaces_c<TensorPowerOfBasedVectorSpaces_c<Factor_,ORDER_> > As_EmbeddableInTensorProductOfBasedVectorSpaces;\n\n    typedef typename As_EmbeddableInTensorProductOfBasedVectorSpaces::FactorTypeList FactorTypeList;\n\n    enum { STATIC_ASSERT_IN_ENUM(AllFactorsAreBasedVectorSpaces_t<FactorTypeList>::V, ALL_FACTORS_MUST_BE_BASED_VECTOR_SPACES) };\n\n    typedef TensorProductOfBasedVectorSpaces_c<FactorTypeList> TensorProductOfBasedVectorSpaces;\n    static Uint32 const ORDER = As_ExteriorPowerOfVectorSpaces::ORDER;\n    typedef typename As_BasedVectorSpace::Field Field;\n    static Uint32 const DIM = As_BasedVectorSpace::DIM;\n    typedef typename As_BasedVectorSpace::Id Id;\n    typedef typename As_BasedVectorSpace::Basis Basis;\n    typedef typename DualOf_c<ExteriorPowerOfBasedVectorSpaces_c>::T Dual; \/\/ relies on the template specialization below\n    typedef Factor_ Factor;\n\n    static std::string type_as_string ()\n    {\n        return \"ExteriorProductOfBasedVectorSpaces_c<\" + TypeStringOf_t<Factor>::eval() + ',' + AS_STRING(ORDER) + '>';\n    }\n};\n\ntemplate <typename Factor, Uint32 ORDER> struct IsAVectorSpace_c<ExteriorPowerOfBasedVectorSpaces_c<Factor,ORDER> > { static bool const V = true; };\ntemplate <typename Factor, Uint32 ORDER> struct IsAnExteriorPower_c<ExteriorPowerOfBasedVectorSpaces_c<Factor,ORDER> > { static bool const V = true; };\ntemplate <typename Factor, Uint32 ORDER> struct IsAnExteriorPowerOfVectorSpaces_c<ExteriorPowerOfBasedVectorSpaces_c<Factor,ORDER> > { static bool const V = true; };\ntemplate <typename Factor, Uint32 ORDER> struct IsABasedVectorSpace_c<ExteriorPowerOfBasedVectorSpaces_c<Factor,ORDER> > { static bool const V = true; };\ntemplate <typename Factor, Uint32 ORDER> struct IsEmbeddableInTensorProductOfBasedVectorSpaces_c<ExteriorPowerOfBasedVectorSpaces_c<Factor,ORDER> > { static bool const V = true; };\n\ntemplate <typename T> struct IsAnExteriorPowerOfBasedVectorSpaces_c { static bool const V = false; };\ntemplate <typename Factor, Uint32 ORDER> struct IsAnExteriorPowerOfBasedVectorSpaces_c<ExteriorPowerOfBasedVectorSpaces_c<Factor,ORDER> > { static bool const V = true; };\n\ntemplate <typename Factor, Uint32 ORDER>\nstruct DualOf_c<ExteriorPowerOfBasedVectorSpaces_c<Factor,ORDER> >\n{\n    typedef BasedExteriorPowerOfVectorSpaces_c<typename DualOf_c<ExteriorPowerOfVectorSpaces_c<typename Factor::As_VectorSpace,ORDER> >::T,\n                                               typename DualOf_c<typename ExteriorPowerOfBasedVectorSpaces_c<Factor,ORDER>::Basis>::T> T;\n};\n\n} \/\/ end of namespace Tenh\n\n#endif \/\/ TENH_CONCEPTUAL_EXTERIORPOWER_HPP_\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright 2015 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\/\/ This approach to arenas overcomes many of the limitations described\n\/\/ in the \"Specialized allocators\" section of\n\/\/     http:\/\/www.pdos.lcs.mit.edu\/~dm\/c++-new.html\n\/\/\n\/\/ A somewhat similar approach to Gladiator, but for heap-detection, was\n\/\/ suggested by Ron van der Wal and Scott Meyers at\n\/\/     http:\/\/www.aristeia.com\/BookErrata\/M27Comments_frames.html\n\n#include \"tensorflow\/core\/lib\/core\/arena.h\"\n\n#include <assert.h>\n#include <unistd.h>\n\n#include <vector>\n\n#include \"tensorflow\/core\/platform\/logging.h\"\n#include \"tensorflow\/core\/platform\/macros.h\"\n#include \"tensorflow\/core\/platform\/mem.h\"\n\nnamespace tensorflow {\nnamespace core {\n\nstatic const int kPageSize = getpagesize();\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Arena::Arena()\n\/\/ Arena::~Arena()\n\/\/    Destroying the arena automatically calls Reset()\n\/\/ ----------------------------------------------------------------------\n\nArena::Arena(const size_t block_size)\n    : remaining_(0),\n      block_size_(block_size),\n      freestart_(NULL),  \/\/ set for real in Reset()\n      blocks_alloced_(1),\n      overflow_blocks_(NULL) {\n  assert(block_size > kDefaultAlignment);\n\n  first_blocks_[0].mem = reinterpret_cast<char*>(malloc(block_size_));\n\n  first_blocks_[0].size = block_size_;\n\n  Reset();\n}\n\nArena::~Arena() {\n  FreeBlocks();\n  assert(overflow_blocks_ == NULL);  \/\/ FreeBlocks() should do that\n  \/\/ The first X blocks stay allocated always by default.  Delete them now.\n  for (size_t i = 0; i < blocks_alloced_; ++i) free(first_blocks_[i].mem);\n}\n\n\/\/ Returns true iff it advances freestart_ to the first position\n\/\/ satisfying alignment without exhausting the current block.\nbool Arena::SatisfyAlignment(size_t alignment) {\n  const size_t overage = reinterpret_cast<size_t>(freestart_) & (alignment - 1);\n  if (overage > 0) {\n    const size_t waste = alignment - overage;\n    if (waste >= remaining_) {\n      return false;\n    }\n    freestart_ += waste;\n    remaining_ -= waste;\n  }\n  DCHECK_EQ(size_t{0}, reinterpret_cast<size_t>(freestart_) & (alignment - 1));\n  return true;\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Arena::Reset()\n\/\/    Clears all the memory an arena is using.\n\/\/ ----------------------------------------------------------------------\n\nvoid Arena::Reset() {\n  FreeBlocks();\n  freestart_ = first_blocks_[0].mem;\n  remaining_ = first_blocks_[0].size;\n\n  \/\/ There is no guarantee the first block is properly aligned, so\n  \/\/ enforce that now.\n  CHECK(SatisfyAlignment(kDefaultAlignment));\n\n  freestart_when_empty_ = freestart_;\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Arena::MakeNewBlock()\n\/\/    Our sbrk() equivalent.  We always make blocks of the same size\n\/\/    (though GetMemory() can also make a new block for really big\n\/\/    data.\n\/\/ ----------------------------------------------------------------------\n\nvoid Arena::MakeNewBlock(const uint32 alignment) {\n  AllocatedBlock* block = AllocNewBlock(block_size_, alignment);\n  freestart_ = block->mem;\n  remaining_ = block->size;\n  CHECK(SatisfyAlignment(alignment));\n}\n\n\/\/ The following simple numeric routines also exist in util\/math\/mathutil.h\n\/\/ but we don't want to depend on that library.\n\n\/\/ Euclid's algorithm for Greatest Common Denominator.\nstatic uint32 GCD(uint32 x, uint32 y) {\n  while (y != 0) {\n    uint32 r = x % y;\n    x = y;\n    y = r;\n  }\n  return x;\n}\n\nstatic uint32 LeastCommonMultiple(uint32 a, uint32 b) {\n  if (a > b) {\n    return (a \/ GCD(a, b)) * b;\n  } else if (a < b) {\n    return (b \/ GCD(b, a)) * a;\n  } else {\n    return a;\n  }\n}\n\n\/\/ -------------------------------------------------------------\n\/\/ Arena::AllocNewBlock()\n\/\/    Adds and returns an AllocatedBlock.\n\/\/    The returned AllocatedBlock* is valid until the next call\n\/\/    to AllocNewBlock or Reset.  (i.e. anything that might\n\/\/    affect overflow_blocks_).\n\/\/ -------------------------------------------------------------\n\nArena::AllocatedBlock* Arena::AllocNewBlock(const size_t block_size,\n                                            const uint32 alignment) {\n  AllocatedBlock* block;\n  \/\/ Find the next block.\n  if (blocks_alloced_ < TF_ARRAYSIZE(first_blocks_)) {\n    \/\/ Use one of the pre-allocated blocks\n    block = &first_blocks_[blocks_alloced_++];\n  } else {  \/\/ oops, out of space, move to the vector\n    if (overflow_blocks_ == NULL)\n      overflow_blocks_ = new std::vector<AllocatedBlock>;\n    \/\/ Adds another block to the vector.\n    overflow_blocks_->resize(overflow_blocks_->size() + 1);\n    \/\/ block points to the last block of the vector.\n    block = &overflow_blocks_->back();\n  }\n\n  \/\/ NOTE(tucker): this utility is made slightly more complex by\n  \/\/ not disallowing the case where alignment > block_size.\n  \/\/ Can we, without breaking existing code?\n\n  \/\/ Must be a multiple of kDefaultAlignment, unless requested\n  \/\/ alignment is 1, in which case we don't care at all.\n  const uint32 adjusted_alignment =\n      (alignment > 1 ? LeastCommonMultiple(alignment, kDefaultAlignment) : 1);\n\n  CHECK_LE(adjusted_alignment, static_cast<uint32>(1 << 20))\n      << \"Alignment on boundaries greater than 1MB not supported.\";\n\n  \/\/ If block_size > alignment we force block_size to be a multiple\n  \/\/ of alignment; if block_size < alignment we make no adjustment.\n  size_t adjusted_block_size = block_size;\n  if (adjusted_alignment > 1) {\n    if (adjusted_block_size > adjusted_alignment) {\n      const uint32 excess = adjusted_block_size % adjusted_alignment;\n      adjusted_block_size += (excess > 0 ? adjusted_alignment - excess : 0);\n    }\n    block->mem = reinterpret_cast<char*>(\n        port::aligned_malloc(adjusted_block_size, adjusted_alignment));\n  } else {\n    block->mem = reinterpret_cast<char*>(malloc(adjusted_block_size));\n  }\n  block->size = adjusted_block_size;\n  CHECK(NULL != block->mem) << \"block_size=\" << block_size\n                            << \" adjusted_block_size=\" << adjusted_block_size\n                            << \" alignment=\" << alignment\n                            << \" adjusted_alignment=\" << adjusted_alignment;\n\n  return block;\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Arena::GetMemoryFallback()\n\/\/    We take memory out of our pool, aligned on the byte boundary\n\/\/    requested.  If we don't have space in our current pool, we\n\/\/    allocate a new block (wasting the remaining space in the\n\/\/    current block) and give you that.  If your memory needs are\n\/\/    too big for a single block, we make a special your-memory-only\n\/\/    allocation -- this is equivalent to not using the arena at all.\n\/\/ ----------------------------------------------------------------------\n\nvoid* Arena::GetMemoryFallback(const size_t size, const int alignment) {\n  if (0 == size) {\n    return NULL;  \/\/ stl\/stl_alloc.h says this is okay\n  }\n\n  \/\/ alignment must be a positive power of 2.\n  CHECK(alignment > 0 && 0 == (alignment & (alignment - 1)));\n\n  \/\/ If the object is more than a quarter of the block size, allocate\n  \/\/ it separately to avoid wasting too much space in leftover bytes.\n  if (block_size_ == 0 || size > block_size_ \/ 4) {\n    return AllocNewBlock(size, alignment)->mem;\n  }\n\n  \/\/ Enforce alignment on freestart_ then check for adequate space,\n  \/\/ which may require starting a new block.\n  if (!SatisfyAlignment(alignment) || size > remaining_) {\n    MakeNewBlock(alignment);\n  }\n  CHECK_LE(size, remaining_);\n\n  remaining_ -= size;\n  void* result = freestart_;\n  freestart_ += size;\n\n  return result;\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Arena::ReturnMemoryFallback()\n\/\/ Arena::FreeBlocks()\n\/\/    Unlike GetMemory(), which does actual work, ReturnMemory() is a\n\/\/    no-op: we don't \"free\" memory until Reset() is called.  We do\n\/\/    update some stats, though.  Note we do no checking that the\n\/\/    pointer you pass in was actually allocated by us, or that it\n\/\/    was allocated for the size you say, so be careful here!\n\/\/       FreeBlocks() does the work for Reset(), actually freeing all\n\/\/    memory allocated in one fell swoop.\n\/\/ ----------------------------------------------------------------------\n\nvoid Arena::FreeBlocks() {\n  for (size_t i = 1; i < blocks_alloced_; ++i) {  \/\/ keep first block alloced\n    free(first_blocks_[i].mem);\n    first_blocks_[i].mem = NULL;\n    first_blocks_[i].size = 0;\n  }\n  blocks_alloced_ = 1;\n  if (overflow_blocks_ != NULL) {\n    std::vector<AllocatedBlock>::iterator it;\n    for (it = overflow_blocks_->begin(); it != overflow_blocks_->end(); ++it) {\n      free(it->mem);\n    }\n    delete overflow_blocks_;  \/\/ These should be used very rarely\n    overflow_blocks_ = NULL;\n  }\n}\n\n}  \/\/ namespace core\n}  \/\/ namespace tensorflow\n<commit_msg>remove unused variable kPageSize<commit_after>\/* Copyright 2015 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\/\/ This approach to arenas overcomes many of the limitations described\n\/\/ in the \"Specialized allocators\" section of\n\/\/     http:\/\/www.pdos.lcs.mit.edu\/~dm\/c++-new.html\n\/\/\n\/\/ A somewhat similar approach to Gladiator, but for heap-detection, was\n\/\/ suggested by Ron van der Wal and Scott Meyers at\n\/\/     http:\/\/www.aristeia.com\/BookErrata\/M27Comments_frames.html\n\n#include \"tensorflow\/core\/lib\/core\/arena.h\"\n\n#include <assert.h>\n#include <unistd.h>\n\n#include <vector>\n\n#include \"tensorflow\/core\/platform\/logging.h\"\n#include \"tensorflow\/core\/platform\/macros.h\"\n#include \"tensorflow\/core\/platform\/mem.h\"\n\nnamespace tensorflow {\nnamespace core {\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Arena::Arena()\n\/\/ Arena::~Arena()\n\/\/    Destroying the arena automatically calls Reset()\n\/\/ ----------------------------------------------------------------------\n\nArena::Arena(const size_t block_size)\n    : remaining_(0),\n      block_size_(block_size),\n      freestart_(NULL),  \/\/ set for real in Reset()\n      blocks_alloced_(1),\n      overflow_blocks_(NULL) {\n  assert(block_size > kDefaultAlignment);\n\n  first_blocks_[0].mem = reinterpret_cast<char*>(malloc(block_size_));\n\n  first_blocks_[0].size = block_size_;\n\n  Reset();\n}\n\nArena::~Arena() {\n  FreeBlocks();\n  assert(overflow_blocks_ == NULL);  \/\/ FreeBlocks() should do that\n  \/\/ The first X blocks stay allocated always by default.  Delete them now.\n  for (size_t i = 0; i < blocks_alloced_; ++i) free(first_blocks_[i].mem);\n}\n\n\/\/ Returns true iff it advances freestart_ to the first position\n\/\/ satisfying alignment without exhausting the current block.\nbool Arena::SatisfyAlignment(size_t alignment) {\n  const size_t overage = reinterpret_cast<size_t>(freestart_) & (alignment - 1);\n  if (overage > 0) {\n    const size_t waste = alignment - overage;\n    if (waste >= remaining_) {\n      return false;\n    }\n    freestart_ += waste;\n    remaining_ -= waste;\n  }\n  DCHECK_EQ(size_t{0}, reinterpret_cast<size_t>(freestart_) & (alignment - 1));\n  return true;\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Arena::Reset()\n\/\/    Clears all the memory an arena is using.\n\/\/ ----------------------------------------------------------------------\n\nvoid Arena::Reset() {\n  FreeBlocks();\n  freestart_ = first_blocks_[0].mem;\n  remaining_ = first_blocks_[0].size;\n\n  \/\/ There is no guarantee the first block is properly aligned, so\n  \/\/ enforce that now.\n  CHECK(SatisfyAlignment(kDefaultAlignment));\n\n  freestart_when_empty_ = freestart_;\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Arena::MakeNewBlock()\n\/\/    Our sbrk() equivalent.  We always make blocks of the same size\n\/\/    (though GetMemory() can also make a new block for really big\n\/\/    data.\n\/\/ ----------------------------------------------------------------------\n\nvoid Arena::MakeNewBlock(const uint32 alignment) {\n  AllocatedBlock* block = AllocNewBlock(block_size_, alignment);\n  freestart_ = block->mem;\n  remaining_ = block->size;\n  CHECK(SatisfyAlignment(alignment));\n}\n\n\/\/ The following simple numeric routines also exist in util\/math\/mathutil.h\n\/\/ but we don't want to depend on that library.\n\n\/\/ Euclid's algorithm for Greatest Common Denominator.\nstatic uint32 GCD(uint32 x, uint32 y) {\n  while (y != 0) {\n    uint32 r = x % y;\n    x = y;\n    y = r;\n  }\n  return x;\n}\n\nstatic uint32 LeastCommonMultiple(uint32 a, uint32 b) {\n  if (a > b) {\n    return (a \/ GCD(a, b)) * b;\n  } else if (a < b) {\n    return (b \/ GCD(b, a)) * a;\n  } else {\n    return a;\n  }\n}\n\n\/\/ -------------------------------------------------------------\n\/\/ Arena::AllocNewBlock()\n\/\/    Adds and returns an AllocatedBlock.\n\/\/    The returned AllocatedBlock* is valid until the next call\n\/\/    to AllocNewBlock or Reset.  (i.e. anything that might\n\/\/    affect overflow_blocks_).\n\/\/ -------------------------------------------------------------\n\nArena::AllocatedBlock* Arena::AllocNewBlock(const size_t block_size,\n                                            const uint32 alignment) {\n  AllocatedBlock* block;\n  \/\/ Find the next block.\n  if (blocks_alloced_ < TF_ARRAYSIZE(first_blocks_)) {\n    \/\/ Use one of the pre-allocated blocks\n    block = &first_blocks_[blocks_alloced_++];\n  } else {  \/\/ oops, out of space, move to the vector\n    if (overflow_blocks_ == NULL)\n      overflow_blocks_ = new std::vector<AllocatedBlock>;\n    \/\/ Adds another block to the vector.\n    overflow_blocks_->resize(overflow_blocks_->size() + 1);\n    \/\/ block points to the last block of the vector.\n    block = &overflow_blocks_->back();\n  }\n\n  \/\/ NOTE(tucker): this utility is made slightly more complex by\n  \/\/ not disallowing the case where alignment > block_size.\n  \/\/ Can we, without breaking existing code?\n\n  \/\/ Must be a multiple of kDefaultAlignment, unless requested\n  \/\/ alignment is 1, in which case we don't care at all.\n  const uint32 adjusted_alignment =\n      (alignment > 1 ? LeastCommonMultiple(alignment, kDefaultAlignment) : 1);\n\n  CHECK_LE(adjusted_alignment, static_cast<uint32>(1 << 20))\n      << \"Alignment on boundaries greater than 1MB not supported.\";\n\n  \/\/ If block_size > alignment we force block_size to be a multiple\n  \/\/ of alignment; if block_size < alignment we make no adjustment.\n  size_t adjusted_block_size = block_size;\n  if (adjusted_alignment > 1) {\n    if (adjusted_block_size > adjusted_alignment) {\n      const uint32 excess = adjusted_block_size % adjusted_alignment;\n      adjusted_block_size += (excess > 0 ? adjusted_alignment - excess : 0);\n    }\n    block->mem = reinterpret_cast<char*>(\n        port::aligned_malloc(adjusted_block_size, adjusted_alignment));\n  } else {\n    block->mem = reinterpret_cast<char*>(malloc(adjusted_block_size));\n  }\n  block->size = adjusted_block_size;\n  CHECK(NULL != block->mem) << \"block_size=\" << block_size\n                            << \" adjusted_block_size=\" << adjusted_block_size\n                            << \" alignment=\" << alignment\n                            << \" adjusted_alignment=\" << adjusted_alignment;\n\n  return block;\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Arena::GetMemoryFallback()\n\/\/    We take memory out of our pool, aligned on the byte boundary\n\/\/    requested.  If we don't have space in our current pool, we\n\/\/    allocate a new block (wasting the remaining space in the\n\/\/    current block) and give you that.  If your memory needs are\n\/\/    too big for a single block, we make a special your-memory-only\n\/\/    allocation -- this is equivalent to not using the arena at all.\n\/\/ ----------------------------------------------------------------------\n\nvoid* Arena::GetMemoryFallback(const size_t size, const int alignment) {\n  if (0 == size) {\n    return NULL;  \/\/ stl\/stl_alloc.h says this is okay\n  }\n\n  \/\/ alignment must be a positive power of 2.\n  CHECK(alignment > 0 && 0 == (alignment & (alignment - 1)));\n\n  \/\/ If the object is more than a quarter of the block size, allocate\n  \/\/ it separately to avoid wasting too much space in leftover bytes.\n  if (block_size_ == 0 || size > block_size_ \/ 4) {\n    return AllocNewBlock(size, alignment)->mem;\n  }\n\n  \/\/ Enforce alignment on freestart_ then check for adequate space,\n  \/\/ which may require starting a new block.\n  if (!SatisfyAlignment(alignment) || size > remaining_) {\n    MakeNewBlock(alignment);\n  }\n  CHECK_LE(size, remaining_);\n\n  remaining_ -= size;\n  void* result = freestart_;\n  freestart_ += size;\n\n  return result;\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Arena::ReturnMemoryFallback()\n\/\/ Arena::FreeBlocks()\n\/\/    Unlike GetMemory(), which does actual work, ReturnMemory() is a\n\/\/    no-op: we don't \"free\" memory until Reset() is called.  We do\n\/\/    update some stats, though.  Note we do no checking that the\n\/\/    pointer you pass in was actually allocated by us, or that it\n\/\/    was allocated for the size you say, so be careful here!\n\/\/       FreeBlocks() does the work for Reset(), actually freeing all\n\/\/    memory allocated in one fell swoop.\n\/\/ ----------------------------------------------------------------------\n\nvoid Arena::FreeBlocks() {\n  for (size_t i = 1; i < blocks_alloced_; ++i) {  \/\/ keep first block alloced\n    free(first_blocks_[i].mem);\n    first_blocks_[i].mem = NULL;\n    first_blocks_[i].size = 0;\n  }\n  blocks_alloced_ = 1;\n  if (overflow_blocks_ != NULL) {\n    std::vector<AllocatedBlock>::iterator it;\n    for (it = overflow_blocks_->begin(); it != overflow_blocks_->end(); ++it) {\n      free(it->mem);\n    }\n    delete overflow_blocks_;  \/\/ These should be used very rarely\n    overflow_blocks_ = NULL;\n  }\n}\n\n}  \/\/ namespace core\n}  \/\/ namespace tensorflow\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- ARMLowOverheadLoops.cpp - CodeGen Low-overhead Loops ---*- 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\/\/\/ \\file\n\/\/\/ Finalize v8.1-m low-overhead loops by converting the associated pseudo\n\/\/\/ instructions into machine operations.\n\/\/\/ The expectation is that the loop contains three pseudo instructions:\n\/\/\/ - t2*LoopStart - placed in the preheader or pre-preheader. The do-loop\n\/\/\/   form should be in the preheader, whereas the while form should be in the\n\/\/\/   preheaders only predecessor. TODO: Could DoLoopStart get moved into the\n\/\/\/   pre-preheader?\n\/\/\/ - t2LoopDec - placed within in the loop body.\n\/\/\/ - t2LoopEnd - the loop latch terminator.\n\/\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"ARM.h\"\n#include \"ARMBaseInstrInfo.h\"\n#include \"ARMBaseRegisterInfo.h\"\n#include \"ARMBasicBlockInfo.h\"\n#include \"ARMSubtarget.h\"\n#include \"llvm\/CodeGen\/MachineFunctionPass.h\"\n#include \"llvm\/CodeGen\/MachineLoopInfo.h\"\n#include \"llvm\/CodeGen\/MachineRegisterInfo.h\"\n\nusing namespace llvm;\n\n#define DEBUG_TYPE \"arm-low-overhead-loops\"\n#define ARM_LOW_OVERHEAD_LOOPS_NAME \"ARM Low Overhead Loops pass\"\n\nnamespace {\n\n  class ARMLowOverheadLoops : public MachineFunctionPass {\n    const ARMBaseInstrInfo    *TII = nullptr;\n    MachineRegisterInfo       *MRI = nullptr;\n    std::unique_ptr<ARMBasicBlockUtils> BBUtils = nullptr;\n\n  public:\n    static char ID;\n\n    ARMLowOverheadLoops() : MachineFunctionPass(ID) { }\n\n    void getAnalysisUsage(AnalysisUsage &AU) const override {\n      AU.setPreservesCFG();\n      AU.addRequired<MachineLoopInfo>();\n      MachineFunctionPass::getAnalysisUsage(AU);\n    }\n\n    bool runOnMachineFunction(MachineFunction &MF) override;\n\n    bool ProcessLoop(MachineLoop *ML);\n\n    void Expand(MachineLoop *ML, MachineInstr *Start,\n                MachineInstr *Dec, MachineInstr *End, bool Revert);\n\n    MachineFunctionProperties getRequiredProperties() const override {\n      return MachineFunctionProperties().set(\n          MachineFunctionProperties::Property::NoVRegs);\n    }\n\n    StringRef getPassName() const override {\n      return ARM_LOW_OVERHEAD_LOOPS_NAME;\n    }\n  };\n}\n  \nchar ARMLowOverheadLoops::ID = 0;\n\nINITIALIZE_PASS(ARMLowOverheadLoops, DEBUG_TYPE, ARM_LOW_OVERHEAD_LOOPS_NAME,\n                false, false)\n\nbool ARMLowOverheadLoops::runOnMachineFunction(MachineFunction &MF) {\n  if (!static_cast<const ARMSubtarget&>(MF.getSubtarget()).hasLOB())\n    return false;\n\n  LLVM_DEBUG(dbgs() << \"ARM Loops on \" << MF.getName() << \" ------------- \\n\");\n\n  auto &MLI = getAnalysis<MachineLoopInfo>();\n  MRI = &MF.getRegInfo();\n  TII = static_cast<const ARMBaseInstrInfo*>(\n    MF.getSubtarget().getInstrInfo());\n  BBUtils = std::unique_ptr<ARMBasicBlockUtils>(new ARMBasicBlockUtils(MF));\n  BBUtils->computeAllBlockSizes();\n\n  bool Changed = false;\n  for (auto ML : MLI) {\n    if (!ML->getParentLoop())\n      Changed |= ProcessLoop(ML);\n  }\n  return Changed;\n}\n\nbool ARMLowOverheadLoops::ProcessLoop(MachineLoop *ML) {\n\n  bool Changed = false;\n\n  \/\/ Process inner loops first.\n  for (auto I = ML->begin(), E = ML->end(); I != E; ++I)\n    Changed |= ProcessLoop(*I);\n\n  LLVM_DEBUG(dbgs() << \"ARM Loops: Processing \" << *ML);\n\n  auto IsLoopStart = [](MachineInstr &MI) {\n    return MI.getOpcode() == ARM::t2DoLoopStart ||\n           MI.getOpcode() == ARM::t2WhileLoopStart;\n  };\n\n  \/\/ Search the given block for a loop start instruction. If one isn't found,\n  \/\/ and there's only one predecessor block, search that one too.\n  std::function<MachineInstr*(MachineBasicBlock*)> SearchForStart =\n    [&IsLoopStart, &SearchForStart](MachineBasicBlock *MBB) -> MachineInstr* {\n    for (auto &MI : *MBB) {\n      if (IsLoopStart(MI))\n        return &MI;\n    }\n    if (MBB->pred_size() == 1)\n      return SearchForStart(*MBB->pred_begin());\n    return nullptr;\n  };\n\n  MachineInstr *Start = nullptr;\n  MachineInstr *Dec = nullptr;\n  MachineInstr *End = nullptr;\n  bool Revert = false;\n\n  \/\/ Search the preheader for the start intrinsic, or look through the\n  \/\/ predecessors of the header to find exactly one set.iterations intrinsic.\n  \/\/ FIXME: I don't see why we shouldn't be supporting multiple predecessors\n  \/\/ with potentially multiple set.loop.iterations, so we need to enable this.\n  if (auto *Preheader = ML->getLoopPreheader()) {\n    Start = SearchForStart(Preheader);\n  } else {\n    LLVM_DEBUG(dbgs() << \"ARM Loops: Failed to find loop preheader!\\n\"\n               << \" - Performing manual predecessor search.\\n\");\n    MachineBasicBlock *Pred = nullptr;\n    for (auto *MBB : ML->getHeader()->predecessors()) {\n      if (!ML->contains(MBB)) {\n        if (Pred) {\n          LLVM_DEBUG(dbgs() << \" - Found multiple out-of-loop preds.\\n\");\n          Start = nullptr;\n          break;\n        }\n        Pred = MBB;\n        Start = SearchForStart(MBB);\n      }\n    }\n  }\n\n  \/\/ Find the low-overhead loop components and decide whether or not to fall\n  \/\/ back to a normal loop.\n  for (auto *MBB : reverse(ML->getBlocks())) {\n    for (auto &MI : *MBB) {\n      if (MI.getOpcode() == ARM::t2LoopDec)\n        Dec = &MI;\n      else if (MI.getOpcode() == ARM::t2LoopEnd)\n        End = &MI;\n      else if (MI.getDesc().isCall())\n        \/\/ TODO: Though the call will require LE to execute again, does this\n        \/\/ mean we should revert? Always executing LE hopefully should be\n        \/\/ faster than performing a sub,cmp,br or even subs,br.\n        Revert = true;\n\n      if (!Dec)\n        continue;\n\n      \/\/ If we find that we load\/store LR between LoopDec and LoopEnd, expect\n      \/\/ that the decremented value has been spilled to the stack. Because\n      \/\/ this value isn't actually going to be produced until the latch, by LE,\n      \/\/ we would need to generate a real sub. The value is also likely to be\n      \/\/ reloaded for use of LoopEnd - in which in case we'd need to perform\n      \/\/ an add because it gets negated again by LE! The other option is to\n      \/\/ then generate the other form of LE which doesn't perform the sub.\n      if (MI.mayLoad() || MI.mayStore())\n        Revert =\n          MI.getOperand(0).isReg() && MI.getOperand(0).getReg() == ARM::LR;\n    }\n\n    if (Dec && End && Revert)\n      break;\n  }\n\n  if (!Start && !Dec && !End) {\n    LLVM_DEBUG(dbgs() << \"ARM Loops: Not a low-overhead loop.\\n\");\n    return Changed;\n  } if (!(Start && Dec && End)) {\n    report_fatal_error(\"Failed to find all loop components\");\n  }\n\n  if (!End->getOperand(1).isMBB() ||\n      End->getOperand(1).getMBB() != ML->getHeader())\n    report_fatal_error(\"Expected LoopEnd to target Loop Header\");\n\n  \/\/ The LE instructions has 12-bits for the label offset.\n  if (!BBUtils->isBBInRange(End, ML->getHeader(), 4096)) {\n    LLVM_DEBUG(dbgs() << \"ARM Loops: Too large for a low-overhead loop!\\n\");\n    Revert = true;\n  }\n\n  LLVM_DEBUG(dbgs() << \"ARM Loops:\\n - Found Loop Start: \" << *Start\n                    << \" - Found Loop Dec: \" << *Dec\n                    << \" - Found Loop End: \" << *End);\n\n  Expand(ML, Start, Dec, End, Revert);\n  return true;\n}\n\nvoid ARMLowOverheadLoops::Expand(MachineLoop *ML, MachineInstr *Start,\n                                 MachineInstr *Dec, MachineInstr *End,\n                                 bool Revert) {\n\n  auto ExpandLoopStart = [this](MachineLoop *ML, MachineInstr *Start) {\n    \/\/ The trip count should already been held in LR since the instructions\n    \/\/ within the loop can only read and write to LR. So, there should be a\n    \/\/ mov to setup the count. WLS\/DLS perform this move, so find the original\n    \/\/ and delete it - inserting WLS\/DLS in its place.\n    MachineBasicBlock *MBB = Start->getParent();\n    MachineInstr *InsertPt = Start;\n    for (auto &I : MRI->def_instructions(ARM::LR)) {\n      if (I.getParent() != MBB)\n        continue;\n\n      \/\/ Always execute.\n      if (!I.getOperand(2).isImm() || I.getOperand(2).getImm() != ARMCC::AL)\n        continue;\n\n      \/\/ Only handle move reg, if the trip count it will need moving into a reg\n      \/\/ before the setup instruction anyway.\n      if (!I.getDesc().isMoveReg() ||\n          !I.getOperand(1).isIdenticalTo(Start->getOperand(0)))\n        continue;\n      InsertPt = &I;\n      break;\n    }\n\n    unsigned Opc = Start->getOpcode() == ARM::t2DoLoopStart ?\n      ARM::t2DLS : ARM::t2WLS;\n    MachineInstrBuilder MIB =\n      BuildMI(*MBB, InsertPt, InsertPt->getDebugLoc(), TII->get(Opc));\n\n    MIB.addDef(ARM::LR);\n    MIB.add(Start->getOperand(0));\n    if (Opc == ARM::t2WLS)\n      MIB.add(Start->getOperand(1));\n\n    if (InsertPt != Start)\n      InsertPt->eraseFromParent();\n    Start->eraseFromParent();\n    LLVM_DEBUG(dbgs() << \"ARM Loops: Inserted start: \" << *MIB);\n    return &*MIB;\n  };\n\n  \/\/ Combine the LoopDec and LoopEnd instructions into LE(TP).\n  auto ExpandLoopEnd = [this](MachineLoop *ML, MachineInstr *Dec,\n                              MachineInstr *End) {\n    MachineBasicBlock *MBB = End->getParent();\n    MachineInstrBuilder MIB = BuildMI(*MBB, End, End->getDebugLoc(),\n                                      TII->get(ARM::t2LEUpdate));\n    MIB.addDef(ARM::LR);\n    MIB.add(End->getOperand(0));\n    MIB.add(End->getOperand(1));\n    LLVM_DEBUG(dbgs() << \"ARM Loops: Inserted LE: \" << *MIB);\n\n    End->eraseFromParent();\n    Dec->eraseFromParent();\n    return &*MIB;\n  };\n\n  \/\/ Generate a subs, or sub and cmp, and a branch instead of an LE.\n  \/\/ TODO: Check flags so that we can possibly generate a subs.\n  \/\/ FIXME: Need to check that we're not trashing the CPSR when generating\n  \/\/ the cmp.\n  auto ExpandBranch = [this](MachineInstr *Dec, MachineInstr *End) {\n    LLVM_DEBUG(dbgs() << \"ARM Loops: Reverting to sub, cmp, br.\\n\");\n    \/\/ Create sub\n    MachineBasicBlock *MBB = Dec->getParent();\n    MachineInstrBuilder MIB = BuildMI(*MBB, Dec, Dec->getDebugLoc(),\n                                      TII->get(ARM::t2SUBri));\n    MIB.addDef(ARM::LR);\n    MIB.add(Dec->getOperand(1));\n    MIB.add(Dec->getOperand(2));\n    MIB.addImm(ARMCC::AL);\n    MIB.addReg(0);\n    MIB.addReg(0);\n\n    \/\/ Create cmp\n    MBB = End->getParent();\n    MIB = BuildMI(*MBB, End, End->getDebugLoc(), TII->get(ARM::t2CMPri));\n    MIB.addReg(ARM::LR);\n    MIB.addImm(0);\n    MIB.addImm(ARMCC::AL);\n    MIB.addReg(ARM::CPSR);\n\n    \/\/ Create bne\n    MIB = BuildMI(*MBB, End, End->getDebugLoc(), TII->get(ARM::t2Bcc));\n    MIB.add(End->getOperand(1));  \/\/ branch target\n    MIB.addImm(ARMCC::NE);        \/\/ condition code\n    MIB.addReg(ARM::CPSR);\n    End->eraseFromParent();\n    Dec->eraseFromParent();\n  };\n\n  \/\/ WhileLoopStart holds the exit block, so produce a cmp lr, 0 and then a\n  \/\/ beq that branches to the exit branch.\n  \/\/ FIXME: Need to check that we're not trashing the CPSR when generating the\n  \/\/ cmp. We could also try to generate a cbz if the value in LR is also in\n  \/\/ another low register.\n  auto ExpandStart = [this](MachineInstr *MI) {\n    MachineBasicBlock *MBB = MI->getParent();\n    MachineInstrBuilder MIB = BuildMI(*MBB, MI, MI->getDebugLoc(),\n                                      TII->get(ARM::t2CMPri));\n    MIB.addReg(ARM::LR);\n    MIB.addImm(0);\n    MIB.addImm(ARMCC::AL);\n    MIB.addReg(ARM::CPSR);\n\n    MIB = BuildMI(*MBB, MI, MI->getDebugLoc(), TII->get(ARM::t2Bcc));\n    MIB.add(MI->getOperand(1));   \/\/ branch target\n    MIB.addImm(ARMCC::EQ);        \/\/ condition code\n    MIB.addReg(ARM::CPSR);\n  };\n\n  \/\/ TODO: We should be able to automatically remove these branches before we\n  \/\/ get here - probably by teaching analyzeBranch about the pseudo\n  \/\/ instructions.\n  \/\/ If there is an unconditional branch, after I, that just branches to the\n  \/\/ next block, remove it.\n  auto RemoveDeadBranch = [](MachineInstr *I) {\n    MachineBasicBlock *BB = I->getParent();\n    MachineInstr *Terminator = &BB->instr_back();\n    if (Terminator->isUnconditionalBranch() && I != Terminator) {\n      MachineBasicBlock *Succ = Terminator->getOperand(0).getMBB();\n      if (BB->isLayoutSuccessor(Succ)) {\n        LLVM_DEBUG(dbgs() << \"ARM Loops: Removing branch: \" << *Terminator);\n        Terminator->eraseFromParent();\n      }\n    }\n  };\n\n  if (Revert) {\n    if (Start->getOpcode() == ARM::t2WhileLoopStart)\n      ExpandStart(Start);\n    ExpandBranch(Dec, End);\n    Start->eraseFromParent();\n  } else {\n    Start = ExpandLoopStart(ML, Start);\n    RemoveDeadBranch(Start);\n    End = ExpandLoopEnd(ML, Dec, End);\n    RemoveDeadBranch(End);\n  }\n}\n\nFunctionPass *llvm::createARMLowOverheadLoopsPass() {\n  return new ARMLowOverheadLoops();\n}\n<commit_msg>[NFC][ARM] Convert lambdas to static helpers<commit_after>\/\/===-- ARMLowOverheadLoops.cpp - CodeGen Low-overhead Loops ---*- 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\/\/\/ \\file\n\/\/\/ Finalize v8.1-m low-overhead loops by converting the associated pseudo\n\/\/\/ instructions into machine operations.\n\/\/\/ The expectation is that the loop contains three pseudo instructions:\n\/\/\/ - t2*LoopStart - placed in the preheader or pre-preheader. The do-loop\n\/\/\/   form should be in the preheader, whereas the while form should be in the\n\/\/\/   preheaders only predecessor. TODO: Could DoLoopStart get moved into the\n\/\/\/   pre-preheader?\n\/\/\/ - t2LoopDec - placed within in the loop body.\n\/\/\/ - t2LoopEnd - the loop latch terminator.\n\/\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"ARM.h\"\n#include \"ARMBaseInstrInfo.h\"\n#include \"ARMBaseRegisterInfo.h\"\n#include \"ARMBasicBlockInfo.h\"\n#include \"ARMSubtarget.h\"\n#include \"llvm\/CodeGen\/MachineFunctionPass.h\"\n#include \"llvm\/CodeGen\/MachineLoopInfo.h\"\n#include \"llvm\/CodeGen\/MachineRegisterInfo.h\"\n\nusing namespace llvm;\n\n#define DEBUG_TYPE \"arm-low-overhead-loops\"\n#define ARM_LOW_OVERHEAD_LOOPS_NAME \"ARM Low Overhead Loops pass\"\n\nnamespace {\n\n  class ARMLowOverheadLoops : public MachineFunctionPass {\n    const ARMBaseInstrInfo    *TII = nullptr;\n    MachineRegisterInfo       *MRI = nullptr;\n    std::unique_ptr<ARMBasicBlockUtils> BBUtils = nullptr;\n\n  public:\n    static char ID;\n\n    ARMLowOverheadLoops() : MachineFunctionPass(ID) { }\n\n    void getAnalysisUsage(AnalysisUsage &AU) const override {\n      AU.setPreservesCFG();\n      AU.addRequired<MachineLoopInfo>();\n      MachineFunctionPass::getAnalysisUsage(AU);\n    }\n\n    bool runOnMachineFunction(MachineFunction &MF) override;\n\n    bool ProcessLoop(MachineLoop *ML);\n\n    void RevertWhile(MachineInstr *MI) const;\n\n    void RevertLoopDec(MachineInstr *MI) const;\n\n    void RevertLoopEnd(MachineInstr *MI) const;\n\n    void Expand(MachineLoop *ML, MachineInstr *Start,\n                MachineInstr *Dec, MachineInstr *End, bool Revert);\n\n    MachineFunctionProperties getRequiredProperties() const override {\n      return MachineFunctionProperties().set(\n          MachineFunctionProperties::Property::NoVRegs);\n    }\n\n    StringRef getPassName() const override {\n      return ARM_LOW_OVERHEAD_LOOPS_NAME;\n    }\n  };\n}\n  \nchar ARMLowOverheadLoops::ID = 0;\n\nINITIALIZE_PASS(ARMLowOverheadLoops, DEBUG_TYPE, ARM_LOW_OVERHEAD_LOOPS_NAME,\n                false, false)\n\nbool ARMLowOverheadLoops::runOnMachineFunction(MachineFunction &MF) {\n  if (!static_cast<const ARMSubtarget&>(MF.getSubtarget()).hasLOB())\n    return false;\n\n  LLVM_DEBUG(dbgs() << \"ARM Loops on \" << MF.getName() << \" ------------- \\n\");\n\n  auto &MLI = getAnalysis<MachineLoopInfo>();\n  MRI = &MF.getRegInfo();\n  TII = static_cast<const ARMBaseInstrInfo*>(\n    MF.getSubtarget().getInstrInfo());\n  BBUtils = std::unique_ptr<ARMBasicBlockUtils>(new ARMBasicBlockUtils(MF));\n  BBUtils->computeAllBlockSizes();\n\n  bool Changed = false;\n  for (auto ML : MLI) {\n    if (!ML->getParentLoop())\n      Changed |= ProcessLoop(ML);\n  }\n  return Changed;\n}\n\nbool ARMLowOverheadLoops::ProcessLoop(MachineLoop *ML) {\n\n  bool Changed = false;\n\n  \/\/ Process inner loops first.\n  for (auto I = ML->begin(), E = ML->end(); I != E; ++I)\n    Changed |= ProcessLoop(*I);\n\n  LLVM_DEBUG(dbgs() << \"ARM Loops: Processing \" << *ML);\n\n  auto IsLoopStart = [](MachineInstr &MI) {\n    return MI.getOpcode() == ARM::t2DoLoopStart ||\n           MI.getOpcode() == ARM::t2WhileLoopStart;\n  };\n\n  \/\/ Search the given block for a loop start instruction. If one isn't found,\n  \/\/ and there's only one predecessor block, search that one too.\n  std::function<MachineInstr*(MachineBasicBlock*)> SearchForStart =\n    [&IsLoopStart, &SearchForStart](MachineBasicBlock *MBB) -> MachineInstr* {\n    for (auto &MI : *MBB) {\n      if (IsLoopStart(MI))\n        return &MI;\n    }\n    if (MBB->pred_size() == 1)\n      return SearchForStart(*MBB->pred_begin());\n    return nullptr;\n  };\n\n  MachineInstr *Start = nullptr;\n  MachineInstr *Dec = nullptr;\n  MachineInstr *End = nullptr;\n  bool Revert = false;\n\n  \/\/ Search the preheader for the start intrinsic, or look through the\n  \/\/ predecessors of the header to find exactly one set.iterations intrinsic.\n  \/\/ FIXME: I don't see why we shouldn't be supporting multiple predecessors\n  \/\/ with potentially multiple set.loop.iterations, so we need to enable this.\n  if (auto *Preheader = ML->getLoopPreheader()) {\n    Start = SearchForStart(Preheader);\n  } else {\n    LLVM_DEBUG(dbgs() << \"ARM Loops: Failed to find loop preheader!\\n\"\n               << \" - Performing manual predecessor search.\\n\");\n    MachineBasicBlock *Pred = nullptr;\n    for (auto *MBB : ML->getHeader()->predecessors()) {\n      if (!ML->contains(MBB)) {\n        if (Pred) {\n          LLVM_DEBUG(dbgs() << \" - Found multiple out-of-loop preds.\\n\");\n          Start = nullptr;\n          break;\n        }\n        Pred = MBB;\n        Start = SearchForStart(MBB);\n      }\n    }\n  }\n\n  \/\/ Find the low-overhead loop components and decide whether or not to fall\n  \/\/ back to a normal loop.\n  for (auto *MBB : reverse(ML->getBlocks())) {\n    for (auto &MI : *MBB) {\n      if (MI.getOpcode() == ARM::t2LoopDec)\n        Dec = &MI;\n      else if (MI.getOpcode() == ARM::t2LoopEnd)\n        End = &MI;\n      else if (MI.getDesc().isCall())\n        \/\/ TODO: Though the call will require LE to execute again, does this\n        \/\/ mean we should revert? Always executing LE hopefully should be\n        \/\/ faster than performing a sub,cmp,br or even subs,br.\n        Revert = true;\n\n      if (!Dec)\n        continue;\n\n      \/\/ If we find that we load\/store LR between LoopDec and LoopEnd, expect\n      \/\/ that the decremented value has been spilled to the stack. Because\n      \/\/ this value isn't actually going to be produced until the latch, by LE,\n      \/\/ we would need to generate a real sub. The value is also likely to be\n      \/\/ reloaded for use of LoopEnd - in which in case we'd need to perform\n      \/\/ an add because it gets negated again by LE! The other option is to\n      \/\/ then generate the other form of LE which doesn't perform the sub.\n      if (MI.mayLoad() || MI.mayStore())\n        Revert =\n          MI.getOperand(0).isReg() && MI.getOperand(0).getReg() == ARM::LR;\n    }\n\n    if (Dec && End && Revert)\n      break;\n  }\n\n  if (!Start && !Dec && !End) {\n    LLVM_DEBUG(dbgs() << \"ARM Loops: Not a low-overhead loop.\\n\");\n    return Changed;\n  } if (!(Start && Dec && End)) {\n    report_fatal_error(\"Failed to find all loop components\");\n  }\n\n  if (!End->getOperand(1).isMBB() ||\n      End->getOperand(1).getMBB() != ML->getHeader())\n    report_fatal_error(\"Expected LoopEnd to target Loop Header\");\n\n  \/\/ The LE instructions has 12-bits for the label offset.\n  if (!BBUtils->isBBInRange(End, ML->getHeader(), 4096)) {\n    LLVM_DEBUG(dbgs() << \"ARM Loops: Too large for a low-overhead loop!\\n\");\n    Revert = true;\n  }\n\n  LLVM_DEBUG(dbgs() << \"ARM Loops:\\n - Found Loop Start: \" << *Start\n                    << \" - Found Loop Dec: \" << *Dec\n                    << \" - Found Loop End: \" << *End);\n\n  Expand(ML, Start, Dec, End, Revert);\n  return true;\n}\n\n\/\/ WhileLoopStart holds the exit block, so produce a cmp lr, 0 and then a\n\/\/ beq that branches to the exit branch.\n\/\/ FIXME: Need to check that we're not trashing the CPSR when generating the\n\/\/ cmp. We could also try to generate a cbz if the value in LR is also in\n\/\/ another low register.\nvoid ARMLowOverheadLoops::RevertWhile(MachineInstr *MI) const {\n  LLVM_DEBUG(dbgs() << \"ARM Loops: Reverting to cmp: \" << *MI);\n  MachineBasicBlock *MBB = MI->getParent();\n  MachineInstrBuilder MIB = BuildMI(*MBB, MI, MI->getDebugLoc(),\n                                    TII->get(ARM::t2CMPri));\n  MIB.addReg(ARM::LR);\n  MIB.addImm(0);\n  MIB.addImm(ARMCC::AL);\n  MIB.addReg(ARM::CPSR);\n\n  \/\/ TODO: Try to use tBcc instead\n  MIB = BuildMI(*MBB, MI, MI->getDebugLoc(), TII->get(ARM::t2Bcc));\n  MIB.add(MI->getOperand(1));   \/\/ branch target\n  MIB.addImm(ARMCC::EQ);        \/\/ condition code\n  MIB.addReg(ARM::CPSR);\n  MI->eraseFromParent();\n}\n\n\/\/ TODO: Check flags so that we can possibly generate a tSubs or tSub.\nvoid ARMLowOverheadLoops::RevertLoopDec(MachineInstr *MI) const {\n  LLVM_DEBUG(dbgs() << \"ARM Loops: Reverting to sub: \" << *MI);\n  MachineBasicBlock *MBB = MI->getParent();\n  MachineInstrBuilder MIB = BuildMI(*MBB, MI, MI->getDebugLoc(),\n                                    TII->get(ARM::t2SUBri));\n  MIB.addDef(ARM::LR);\n  MIB.add(MI->getOperand(1));\n  MIB.add(MI->getOperand(2));\n  MIB.addImm(ARMCC::AL);\n  MIB.addReg(0);\n  MIB.addReg(0);\n  MI->eraseFromParent();\n}\n\n\/\/ Generate a subs, or sub and cmp, and a branch instead of an LE.\n\/\/ FIXME: Need to check that we're not trashing the CPSR when generating\n\/\/ the cmp.\nvoid ARMLowOverheadLoops::RevertLoopEnd(MachineInstr *MI) const {\n  LLVM_DEBUG(dbgs() << \"ARM Loops: Reverting to cmp, br: \" << *MI);\n\n  \/\/ Create cmp\n  MachineBasicBlock *MBB = MI->getParent();\n  MachineInstrBuilder MIB = BuildMI(*MBB, MI, MI->getDebugLoc(),\n                                    TII->get(ARM::t2CMPri));\n  MIB.addReg(ARM::LR);\n  MIB.addImm(0);\n  MIB.addImm(ARMCC::AL);\n  MIB.addReg(ARM::CPSR);\n\n  \/\/ TODO Try to use tBcc instead.\n  \/\/ Create bne\n  MIB = BuildMI(*MBB, MI, MI->getDebugLoc(), TII->get(ARM::t2Bcc));\n  MIB.add(MI->getOperand(1));   \/\/ branch target\n  MIB.addImm(ARMCC::NE);        \/\/ condition code\n  MIB.addReg(ARM::CPSR);\n  MI->eraseFromParent();\n}\n\nvoid ARMLowOverheadLoops::Expand(MachineLoop *ML, MachineInstr *Start,\n                                 MachineInstr *Dec, MachineInstr *End,\n                                 bool Revert) {\n\n  auto ExpandLoopStart = [this](MachineLoop *ML, MachineInstr *Start) {\n    \/\/ The trip count should already been held in LR since the instructions\n    \/\/ within the loop can only read and write to LR. So, there should be a\n    \/\/ mov to setup the count. WLS\/DLS perform this move, so find the original\n    \/\/ and delete it - inserting WLS\/DLS in its place.\n    MachineBasicBlock *MBB = Start->getParent();\n    MachineInstr *InsertPt = Start;\n    for (auto &I : MRI->def_instructions(ARM::LR)) {\n      if (I.getParent() != MBB)\n        continue;\n\n      \/\/ Always execute.\n      if (!I.getOperand(2).isImm() || I.getOperand(2).getImm() != ARMCC::AL)\n        continue;\n\n      \/\/ Only handle move reg, if the trip count it will need moving into a reg\n      \/\/ before the setup instruction anyway.\n      if (!I.getDesc().isMoveReg() ||\n          !I.getOperand(1).isIdenticalTo(Start->getOperand(0)))\n        continue;\n      InsertPt = &I;\n      break;\n    }\n\n    unsigned Opc = Start->getOpcode() == ARM::t2DoLoopStart ?\n      ARM::t2DLS : ARM::t2WLS;\n    MachineInstrBuilder MIB =\n      BuildMI(*MBB, InsertPt, InsertPt->getDebugLoc(), TII->get(Opc));\n\n    MIB.addDef(ARM::LR);\n    MIB.add(Start->getOperand(0));\n    if (Opc == ARM::t2WLS)\n      MIB.add(Start->getOperand(1));\n\n    if (InsertPt != Start)\n      InsertPt->eraseFromParent();\n    Start->eraseFromParent();\n    LLVM_DEBUG(dbgs() << \"ARM Loops: Inserted start: \" << *MIB);\n    return &*MIB;\n  };\n\n  \/\/ Combine the LoopDec and LoopEnd instructions into LE(TP).\n  auto ExpandLoopEnd = [this](MachineLoop *ML, MachineInstr *Dec,\n                              MachineInstr *End) {\n    MachineBasicBlock *MBB = End->getParent();\n    MachineInstrBuilder MIB = BuildMI(*MBB, End, End->getDebugLoc(),\n                                      TII->get(ARM::t2LEUpdate));\n    MIB.addDef(ARM::LR);\n    MIB.add(End->getOperand(0));\n    MIB.add(End->getOperand(1));\n    LLVM_DEBUG(dbgs() << \"ARM Loops: Inserted LE: \" << *MIB);\n\n    End->eraseFromParent();\n    Dec->eraseFromParent();\n    return &*MIB;\n  };\n\n  \/\/ TODO: We should be able to automatically remove these branches before we\n  \/\/ get here - probably by teaching analyzeBranch about the pseudo\n  \/\/ instructions.\n  \/\/ If there is an unconditional branch, after I, that just branches to the\n  \/\/ next block, remove it.\n  auto RemoveDeadBranch = [](MachineInstr *I) {\n    MachineBasicBlock *BB = I->getParent();\n    MachineInstr *Terminator = &BB->instr_back();\n    if (Terminator->isUnconditionalBranch() && I != Terminator) {\n      MachineBasicBlock *Succ = Terminator->getOperand(0).getMBB();\n      if (BB->isLayoutSuccessor(Succ)) {\n        LLVM_DEBUG(dbgs() << \"ARM Loops: Removing branch: \" << *Terminator);\n        Terminator->eraseFromParent();\n      }\n    }\n  };\n\n  if (Revert) {\n    if (Start->getOpcode() == ARM::t2WhileLoopStart)\n      RevertWhile(Start);\n    else\n      Start->eraseFromParent();\n    RevertLoopDec(Dec);\n    RevertLoopEnd(End);\n  } else {\n    Start = ExpandLoopStart(ML, Start);\n    RemoveDeadBranch(Start);\n    End = ExpandLoopEnd(ML, Dec, End);\n    RemoveDeadBranch(End);\n  }\n}\n\nFunctionPass *llvm::createARMLowOverheadLoopsPass() {\n  return new ARMLowOverheadLoops();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2016 Yahoo Inc. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n#include <vespa\/vespalib\/testkit\/test_kit.h>\n#include <vespa\/vespalib\/eval\/test\/tensor_conformance.h>\n#include <vespa\/vespalib\/eval\/simple_tensor_engine.h>\n#include <vespa\/vespalib\/tensor\/default_tensor_engine.h>\n\nusing vespalib::eval::SimpleTensorEngine;\nusing vespalib::eval::test::TensorConformance;\nusing vespalib::tensor::DefaultTensorEngine;\n\nTEST(\"require that reference tensor implementation passes all conformance tests\") {\n    TEST_DO(TensorConformance::run_tests(SimpleTensorEngine::ref(), true));\n}\n\nIGNORE_TEST(\"require that production tensor implementation passes non-mixed conformance tests\") {\n    TEST_DO(TensorConformance::run_tests(DefaultTensorEngine::ref(), false));\n}\n\nIGNORE_TEST(\"require that production tensor implementation passes all conformance tests\") {\n    TEST_DO(TensorConformance::run_tests(DefaultTensorEngine::ref(), true));\n}\n\nTEST_MAIN() { TEST_RUN_ALL(); }\n<commit_msg>skip running mixed tests for now, as it produces too much output<commit_after>\/\/ Copyright 2016 Yahoo Inc. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n#include <vespa\/vespalib\/testkit\/test_kit.h>\n#include <vespa\/vespalib\/eval\/test\/tensor_conformance.h>\n#include <vespa\/vespalib\/eval\/simple_tensor_engine.h>\n#include <vespa\/vespalib\/tensor\/default_tensor_engine.h>\n\nusing vespalib::eval::SimpleTensorEngine;\nusing vespalib::eval::test::TensorConformance;\nusing vespalib::tensor::DefaultTensorEngine;\n\nTEST(\"require that reference tensor implementation passes all conformance tests\") {\n    TEST_DO(TensorConformance::run_tests(SimpleTensorEngine::ref(), true));\n}\n\nIGNORE_TEST(\"require that production tensor implementation passes non-mixed conformance tests\") {\n    TEST_DO(TensorConformance::run_tests(DefaultTensorEngine::ref(), false));\n}\n\nTEST_MAIN() { TEST_RUN_ALL(); }\n<|endoftext|>"}
{"text":"<commit_before>\/**************************************************************************\n *\n * Copyright 2011 Jose Fonseca\n * All Rights Reserved.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *\n **************************************************************************\/\n\n#include <assert.h>\n#include <stdlib.h>\n\n#include <iostream>\n\n#include \"glproc.hpp\"\n#include \"glws.hpp\"\n#include \"glws_xlib.hpp\"\n\n\nnamespace glws {\n\n\nstatic unsigned glxVersion = 0;\nstatic const char *extensions = 0;\nstatic bool has_GLX_ARB_create_context = false;\n\n\nclass GlxVisual : public Visual\n{\npublic:\n    GLXFBConfig fbconfig;\n    XVisualInfo *visinfo;\n\n    GlxVisual(Profile prof) :\n        Visual(prof),\n        fbconfig(0),\n        visinfo(0)\n    {}\n\n    ~GlxVisual() {\n        XFree(visinfo);\n    }\n};\n\n\nclass GlxDrawable : public Drawable\n{\npublic:\n    Window window;\n    bool ever_current;\n\n    GlxDrawable(const Visual *vis, int w, int h, bool pbuffer) :\n        Drawable(vis, w, h, pbuffer),\n        ever_current(false)\n    {\n        XVisualInfo *visinfo = static_cast<const GlxVisual *>(visual)->visinfo;\n\n        const char *name = \"glretrace\";\n        window = createWindow(visinfo, name, width, height);\n\n        glXWaitX();\n    }\n\n    ~GlxDrawable() {\n        XDestroyWindow(display, window);\n    }\n\n    void\n    resize(int w, int h) {\n        if (w == width && h == height) {\n            return;\n        }\n\n        glXWaitGL();\n\n        \/\/ We need to ensure that pending events are processed here, and XSync\n        \/\/ with discard = True guarantees that, but it appears the limited\n        \/\/ event processing we do so far is sufficient\n        \/\/XSync(display, True);\n\n        Drawable::resize(w, h);\n\n        resizeWindow(window, w, h);\n\n        glXWaitX();\n    }\n\n    void show(void) {\n        if (visible) {\n            return;\n        }\n\n        glXWaitGL();\n\n        showWindow(window);\n\n        glXWaitX();\n\n        Drawable::show();\n    }\n\n    void copySubBuffer(int x, int y, int width, int height) {\n        glXCopySubBufferMESA(display, window, x, y, width, height);\n\n        processKeys(window);\n    }\n\n    void swapBuffers(void) {\n        if (ever_current) {\n            \/\/ The window has been bound to a context at least once\n            glXSwapBuffers(display, window);\n        } else {\n            \/\/ Don't call glXSwapBuffers on this window to avoid an\n            \/\/ (untrappable) X protocol error with NVIDIA's driver.\n            std::cerr << \"warning: attempt to issue SwapBuffers on unbound window \"\n                         \" - skipping.\\n\";\n        }\n        processKeys(window);\n    }\n};\n\n\nclass GlxContext : public Context\n{\npublic:\n    GLXContext context;\n\n    GlxContext(const Visual *vis, GLXContext ctx) :\n        Context(vis),\n        context(ctx)\n    {}\n\n    ~GlxContext() {\n        glXDestroyContext(display, context);\n    }\n};\n\nvoid\ninit(void) {\n    initX();\n\n    int major = 0, minor = 0;\n    glXQueryVersion(display, &major, &minor);\n    glxVersion = (major << 8) | minor;\n\n    extensions = glXQueryExtensionsString(display, screen);\n    has_GLX_ARB_create_context = checkExtension(\"GLX_ARB_create_context\", extensions);\n}\n\nvoid\ncleanup(void) {\n    cleanupX();\n}\n\nVisual *\ncreateVisual(bool doubleBuffer, unsigned samples, Profile profile) {\n    GlxVisual *visual = new GlxVisual(profile);\n\n    if (glxVersion >= 0x0103) {\n        Attributes<int> attribs;\n        attribs.add(GLX_DRAWABLE_TYPE, GLX_WINDOW_BIT);\n        attribs.add(GLX_RENDER_TYPE, GLX_RGBA_BIT);\n        attribs.add(GLX_RED_SIZE, 1);\n        attribs.add(GLX_GREEN_SIZE, 1);\n        attribs.add(GLX_BLUE_SIZE, 1);\n        attribs.add(GLX_ALPHA_SIZE, 1);\n        attribs.add(GLX_DOUBLEBUFFER, doubleBuffer ? GL_TRUE : GL_FALSE);\n        attribs.add(GLX_DEPTH_SIZE, 1);\n        attribs.add(GLX_STENCIL_SIZE, 1);\n        if (samples > 1) {\n            attribs.add(GLX_SAMPLE_BUFFERS, 1);\n            attribs.add(GLX_SAMPLES_ARB, samples);\n        }\n        attribs.end();\n\n        int num_configs = 0;\n        GLXFBConfig * fbconfigs;\n        fbconfigs = glXChooseFBConfig(display, screen, attribs, &num_configs);\n        if (!num_configs || !fbconfigs) {\n            return NULL;\n        }\n        visual->fbconfig = fbconfigs[0];\n        assert(visual->fbconfig);\n        visual->visinfo = glXGetVisualFromFBConfig(display, visual->fbconfig);\n        assert(visual->visinfo);\n    } else {\n        Attributes<int> attribs;\n        attribs.add(GLX_RGBA);\n        attribs.add(GLX_RED_SIZE, 1);\n        attribs.add(GLX_GREEN_SIZE, 1);\n        attribs.add(GLX_BLUE_SIZE, 1);\n        attribs.add(GLX_ALPHA_SIZE, 1);\n        if (doubleBuffer) {\n            attribs.add(GLX_DOUBLEBUFFER);\n        }\n        attribs.add(GLX_DEPTH_SIZE, 1);\n        attribs.add(GLX_STENCIL_SIZE, 1);\n        if (samples > 1) {\n            attribs.add(GLX_SAMPLE_BUFFERS, 1);\n            attribs.add(GLX_SAMPLES_ARB, samples);\n        }\n        attribs.end();\n\n        visual->visinfo = glXChooseVisual(display, screen, attribs);\n    }\n\n    return visual;\n}\n\nDrawable *\ncreateDrawable(const Visual *visual, int width, int height, bool pbuffer)\n{\n    return new GlxDrawable(visual, width, height, pbuffer);\n}\n\nbool\nbindApi(Api api)\n{\n    return true;\n}\n\nContext *\ncreateContext(const Visual *_visual, Context *shareContext, bool debug)\n{\n    const GlxVisual *visual = static_cast<const GlxVisual *>(_visual);\n    Profile profile = visual->profile;\n    GLXContext share_context = NULL;\n    GLXContext context;\n\n    if (shareContext) {\n        share_context = static_cast<GlxContext*>(shareContext)->context;\n    }\n\n    if (glxVersion >= 0x0104 && has_GLX_ARB_create_context) {\n        Attributes<int> attribs;\n        \n        attribs.add(GLX_RENDER_TYPE, GLX_RGBA_TYPE);\n        if (debug) {\n            attribs.add(GLX_CONTEXT_FLAGS_ARB, GLX_CONTEXT_DEBUG_BIT_ARB);\n        }\n\n        ProfileDesc desc;\n        getProfileDesc(profile, desc);\n\n        switch (profile) {\n        case PROFILE_COMPAT:\n            break;\n        case PROFILE_ES1:\n            return NULL;\n        case PROFILE_ES2:\n            attribs.add(GLX_CONTEXT_PROFILE_MASK_ARB, GLX_CONTEXT_ES2_PROFILE_BIT_EXT);\n            break;\n        default:\n            {\n                attribs.add(GLX_CONTEXT_MAJOR_VERSION_ARB, desc.major);\n                attribs.add(GLX_CONTEXT_MINOR_VERSION_ARB, desc.minor);\n                if (desc.core) {\n                    attribs.add(GLX_CONTEXT_PROFILE_MASK_ARB, GLX_CONTEXT_CORE_PROFILE_BIT_ARB);\n                }\n                break;\n            }\n        }\n        \n        attribs.end();\n\n        context = glXCreateContextAttribsARB(display, visual->fbconfig, share_context, True, attribs);\n    } else {\n        if (profile != PROFILE_COMPAT) {\n            return NULL;\n        }\n\n        if (glxVersion >= 0x103) {\n            context = glXCreateNewContext(display, visual->fbconfig, GLX_RGBA_TYPE, share_context, True);\n        } else {\n            context = glXCreateContext(display, visual->visinfo, share_context, True);\n        }\n    }\n\n    if (!context) {\n        return NULL;\n    }\n\n    return new GlxContext(visual, context);\n}\n\nbool\nmakeCurrent(Drawable *drawable, Context *context)\n{\n    if (!drawable || !context) {\n        return glXMakeCurrent(display, None, NULL);\n    } else {\n        GlxDrawable *glxDrawable = static_cast<GlxDrawable *>(drawable);\n        GlxContext *glxContext = static_cast<GlxContext *>(context);\n\n        glxDrawable->ever_current = true;\n\n        return glXMakeCurrent(display, glxDrawable->window, glxContext->context);\n    }\n}\n\n\n} \/* namespace glws *\/\n<commit_msg>glretrace: Allow to create GLES1 GLX contexts.<commit_after>\/**************************************************************************\n *\n * Copyright 2011 Jose Fonseca\n * All Rights Reserved.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *\n **************************************************************************\/\n\n#include <assert.h>\n#include <stdlib.h>\n\n#include <iostream>\n\n#include \"glproc.hpp\"\n#include \"glws.hpp\"\n#include \"glws_xlib.hpp\"\n\n\nnamespace glws {\n\n\nstatic unsigned glxVersion = 0;\nstatic const char *extensions = 0;\nstatic bool has_GLX_ARB_create_context = false;\nstatic bool has_GLX_ARB_create_context_profile = false;\nstatic bool has_GLX_EXT_create_context_es_profile = false;\nstatic bool has_GLX_EXT_create_context_es2_profile = false;\n\n\nclass GlxVisual : public Visual\n{\npublic:\n    GLXFBConfig fbconfig;\n    XVisualInfo *visinfo;\n\n    GlxVisual(Profile prof) :\n        Visual(prof),\n        fbconfig(0),\n        visinfo(0)\n    {}\n\n    ~GlxVisual() {\n        XFree(visinfo);\n    }\n};\n\n\nclass GlxDrawable : public Drawable\n{\npublic:\n    Window window;\n    bool ever_current;\n\n    GlxDrawable(const Visual *vis, int w, int h, bool pbuffer) :\n        Drawable(vis, w, h, pbuffer),\n        ever_current(false)\n    {\n        XVisualInfo *visinfo = static_cast<const GlxVisual *>(visual)->visinfo;\n\n        const char *name = \"glretrace\";\n        window = createWindow(visinfo, name, width, height);\n\n        glXWaitX();\n    }\n\n    ~GlxDrawable() {\n        XDestroyWindow(display, window);\n    }\n\n    void\n    resize(int w, int h) {\n        if (w == width && h == height) {\n            return;\n        }\n\n        glXWaitGL();\n\n        \/\/ We need to ensure that pending events are processed here, and XSync\n        \/\/ with discard = True guarantees that, but it appears the limited\n        \/\/ event processing we do so far is sufficient\n        \/\/XSync(display, True);\n\n        Drawable::resize(w, h);\n\n        resizeWindow(window, w, h);\n\n        glXWaitX();\n    }\n\n    void show(void) {\n        if (visible) {\n            return;\n        }\n\n        glXWaitGL();\n\n        showWindow(window);\n\n        glXWaitX();\n\n        Drawable::show();\n    }\n\n    void copySubBuffer(int x, int y, int width, int height) {\n        glXCopySubBufferMESA(display, window, x, y, width, height);\n\n        processKeys(window);\n    }\n\n    void swapBuffers(void) {\n        if (ever_current) {\n            \/\/ The window has been bound to a context at least once\n            glXSwapBuffers(display, window);\n        } else {\n            \/\/ Don't call glXSwapBuffers on this window to avoid an\n            \/\/ (untrappable) X protocol error with NVIDIA's driver.\n            std::cerr << \"warning: attempt to issue SwapBuffers on unbound window \"\n                         \" - skipping.\\n\";\n        }\n        processKeys(window);\n    }\n};\n\n\nclass GlxContext : public Context\n{\npublic:\n    GLXContext context;\n\n    GlxContext(const Visual *vis, GLXContext ctx) :\n        Context(vis),\n        context(ctx)\n    {}\n\n    ~GlxContext() {\n        glXDestroyContext(display, context);\n    }\n};\n\nvoid\ninit(void) {\n    initX();\n\n    int major = 0, minor = 0;\n    glXQueryVersion(display, &major, &minor);\n    glxVersion = (major << 8) | minor;\n\n    extensions = glXQueryExtensionsString(display, screen);\n\n#define CHECK_EXTENSION(name) \\\n    has_##name = checkExtension(#name, extensions)\n\n    CHECK_EXTENSION(GLX_ARB_create_context);\n    CHECK_EXTENSION(GLX_ARB_create_context_profile);\n    CHECK_EXTENSION(GLX_EXT_create_context_es_profile);\n    CHECK_EXTENSION(GLX_EXT_create_context_es2_profile);\n\n#undef CHECK_EXTENSION\n}\n\nvoid\ncleanup(void) {\n    cleanupX();\n}\n\nVisual *\ncreateVisual(bool doubleBuffer, unsigned samples, Profile profile) {\n    GlxVisual *visual = new GlxVisual(profile);\n\n    if (glxVersion >= 0x0103) {\n        Attributes<int> attribs;\n        attribs.add(GLX_DRAWABLE_TYPE, GLX_WINDOW_BIT);\n        attribs.add(GLX_RENDER_TYPE, GLX_RGBA_BIT);\n        attribs.add(GLX_RED_SIZE, 1);\n        attribs.add(GLX_GREEN_SIZE, 1);\n        attribs.add(GLX_BLUE_SIZE, 1);\n        attribs.add(GLX_ALPHA_SIZE, 1);\n        attribs.add(GLX_DOUBLEBUFFER, doubleBuffer ? GL_TRUE : GL_FALSE);\n        attribs.add(GLX_DEPTH_SIZE, 1);\n        attribs.add(GLX_STENCIL_SIZE, 1);\n        if (samples > 1) {\n            attribs.add(GLX_SAMPLE_BUFFERS, 1);\n            attribs.add(GLX_SAMPLES_ARB, samples);\n        }\n        attribs.end();\n\n        int num_configs = 0;\n        GLXFBConfig * fbconfigs;\n        fbconfigs = glXChooseFBConfig(display, screen, attribs, &num_configs);\n        if (!num_configs || !fbconfigs) {\n            return NULL;\n        }\n        visual->fbconfig = fbconfigs[0];\n        assert(visual->fbconfig);\n        visual->visinfo = glXGetVisualFromFBConfig(display, visual->fbconfig);\n        assert(visual->visinfo);\n    } else {\n        Attributes<int> attribs;\n        attribs.add(GLX_RGBA);\n        attribs.add(GLX_RED_SIZE, 1);\n        attribs.add(GLX_GREEN_SIZE, 1);\n        attribs.add(GLX_BLUE_SIZE, 1);\n        attribs.add(GLX_ALPHA_SIZE, 1);\n        if (doubleBuffer) {\n            attribs.add(GLX_DOUBLEBUFFER);\n        }\n        attribs.add(GLX_DEPTH_SIZE, 1);\n        attribs.add(GLX_STENCIL_SIZE, 1);\n        if (samples > 1) {\n            attribs.add(GLX_SAMPLE_BUFFERS, 1);\n            attribs.add(GLX_SAMPLES_ARB, samples);\n        }\n        attribs.end();\n\n        visual->visinfo = glXChooseVisual(display, screen, attribs);\n    }\n\n    return visual;\n}\n\nDrawable *\ncreateDrawable(const Visual *visual, int width, int height, bool pbuffer)\n{\n    return new GlxDrawable(visual, width, height, pbuffer);\n}\n\nbool\nbindApi(Api api)\n{\n    return true;\n}\n\nContext *\ncreateContext(const Visual *_visual, Context *shareContext, bool debug)\n{\n    const GlxVisual *visual = static_cast<const GlxVisual *>(_visual);\n    Profile profile = visual->profile;\n    GLXContext share_context = NULL;\n    GLXContext context;\n\n    if (shareContext) {\n        share_context = static_cast<GlxContext*>(shareContext)->context;\n    }\n\n    if (glxVersion >= 0x0104 && has_GLX_ARB_create_context) {\n        Attributes<int> attribs;\n        \n        attribs.add(GLX_RENDER_TYPE, GLX_RGBA_TYPE);\n        if (debug) {\n            attribs.add(GLX_CONTEXT_FLAGS_ARB, GLX_CONTEXT_DEBUG_BIT_ARB);\n        }\n\n        ProfileDesc desc;\n        getProfileDesc(profile, desc);\n\n        switch (profile) {\n        case PROFILE_COMPAT:\n            break;\n        case PROFILE_ES1:\n            if (!has_GLX_EXT_create_context_es_profile) {\n                return NULL;\n            }\n            attribs.add(GLX_CONTEXT_PROFILE_MASK_ARB, GLX_CONTEXT_ES_PROFILE_BIT_EXT);\n            attribs.add(GLX_CONTEXT_MAJOR_VERSION_ARB, 1);\n            break;\n        case PROFILE_ES2:\n            if (!has_GLX_EXT_create_context_es2_profile) {\n                return NULL;\n            }\n            attribs.add(GLX_CONTEXT_PROFILE_MASK_ARB, GLX_CONTEXT_ES2_PROFILE_BIT_EXT);\n            attribs.add(GLX_CONTEXT_MAJOR_VERSION_ARB, 2);\n            break;\n        default:\n            {\n                attribs.add(GLX_CONTEXT_MAJOR_VERSION_ARB, desc.major);\n                attribs.add(GLX_CONTEXT_MINOR_VERSION_ARB, desc.minor);\n                if (desc.core) {\n                    if (!has_GLX_ARB_create_context_profile) {\n                        return NULL;\n                    }\n                    attribs.add(GLX_CONTEXT_PROFILE_MASK_ARB, GLX_CONTEXT_CORE_PROFILE_BIT_ARB);\n                }\n                break;\n            }\n        }\n        \n        attribs.end();\n\n        context = glXCreateContextAttribsARB(display, visual->fbconfig, share_context, True, attribs);\n    } else {\n        if (profile != PROFILE_COMPAT) {\n            return NULL;\n        }\n\n        if (glxVersion >= 0x103) {\n            context = glXCreateNewContext(display, visual->fbconfig, GLX_RGBA_TYPE, share_context, True);\n        } else {\n            context = glXCreateContext(display, visual->visinfo, share_context, True);\n        }\n    }\n\n    if (!context) {\n        return NULL;\n    }\n\n    return new GlxContext(visual, context);\n}\n\nbool\nmakeCurrent(Drawable *drawable, Context *context)\n{\n    if (!drawable || !context) {\n        return glXMakeCurrent(display, None, NULL);\n    } else {\n        GlxDrawable *glxDrawable = static_cast<GlxDrawable *>(drawable);\n        GlxContext *glxContext = static_cast<GlxContext *>(context);\n\n        glxDrawable->ever_current = true;\n\n        return glXMakeCurrent(display, glxDrawable->window, glxContext->context);\n    }\n}\n\n\n} \/* namespace glws *\/\n<|endoftext|>"}
{"text":"<commit_before>\/**************************************************************************\n *\n * Copyright 2011 Jose Fonseca\n * All Rights Reserved.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *\n **************************************************************************\/\n\n\n\/*\n * WGL bindings.\n *\/\n\n\n#include <iostream>\n\n#include \"glproc.hpp\"\n#include \"glws.hpp\"\n\n\nnamespace glws {\n\n\n\/*\n * Several WGL functions come in two flavors:\n * - GDI (ChoosePixelFormat, SetPixelFormat, SwapBuffers, etc)\n * - WGL (wglChoosePixelFormat, wglSetPixelFormat, wglSwapBuffers, etc)\n *\n * The GDI entrypoints will inevitably dispatch to the first module named\n * \"OPENGL32\", loading \"C:\\Windows\\System32\\opengl32.dll\" if none was loaded so\n * far.\n *\n * In order to use a implementation other than the one installed in the system\n * (when specified via the TRACE_LIBGL environment variable), we need to use\n * WGL entrypoints.\n *\n * See also:\n * - http:\/\/www.opengl.org\/archives\/resources\/faq\/technical\/mswindows.htm\n *\/\nstatic PFN_WGLCHOOSEPIXELFORMAT pfnChoosePixelFormat = &ChoosePixelFormat;\nstatic PFN_WGLSETPIXELFORMAT pfnSetPixelFormat = &SetPixelFormat;\nstatic PFN_WGLSWAPBUFFERS pfnSwapBuffers = &SwapBuffers;\n\n\nstatic LRESULT CALLBACK\nWndProc(HWND hWnd, UINT uMsg, WPARAM wParam, LPARAM lParam)\n{\n    MINMAXINFO *pMMI;\n    switch (uMsg) {\n    case WM_KEYDOWN:\n        switch (wParam) {\n        case VK_ESCAPE:\n            PostMessage(hWnd, WM_CLOSE, 0, 0);\n            break;\n        }\n        break;\n    case WM_GETMINMAXINFO:\n        \/\/ Allow to create a window bigger than the desktop\n        pMMI = (MINMAXINFO *)lParam;\n        pMMI->ptMaxSize.x = 60000;\n        pMMI->ptMaxSize.y = 60000;\n        pMMI->ptMaxTrackSize.x = 60000;\n        pMMI->ptMaxTrackSize.y = 60000;\n        break;\n    case WM_CLOSE:\n        exit(0);\n        break;\n    default:\n        break;\n    }\n\n    return DefWindowProc(hWnd, uMsg, wParam, lParam);\n}\n\n\nstatic const DWORD dwExStyle = 0;\nstatic const DWORD dwStyle = WS_CLIPSIBLINGS | WS_CLIPCHILDREN | WS_OVERLAPPEDWINDOW;\n\n\nstruct WindowThreadParam\n{\n    int nWidth;\n    int nHeight;\n\n    HANDLE hEvent;\n\n    HWND hWnd;\n};\n\n\nstatic DWORD WINAPI\nwindowThreadFunction( LPVOID _lpParam )\n{\n    WindowThreadParam *lpParam = (WindowThreadParam *)_lpParam;\n\n    \/\/ Actually create the window\n    lpParam->hWnd = CreateWindowEx(dwExStyle,\n                                   \"glretrace\", \/* wc.lpszClassName *\/\n                                   NULL,\n                                   dwStyle,\n                                   0, \/* x *\/\n                                   0, \/* y *\/\n                                   lpParam->nWidth,\n                                   lpParam->nHeight,\n                                   NULL,\n                                   NULL,\n                                   NULL,\n                                   NULL);\n\n    \/\/ Notify parent thread that window has been created\n    SetEvent(lpParam->hEvent);\n\n    BOOL bRet;\n    MSG msg;\n    while ((bRet = GetMessage(&msg, NULL, 0, 0 )) != FALSE) {\n        if (bRet == -1) {\n            \/\/ handle the error and possibly exit\n        } else {\n            TranslateMessage(&msg);\n            DispatchMessage(&msg);\n        }\n    }\n\n    \/\/ Return the exit code\n    return msg.wParam;\n}\n\n\n\/**\n * Create a window on a separate thread.\n *\n * Each window is associated with one thread, which must process its events,\n * and certain operations like SetWindowPos will block until the message is\n * process, so the only way to guarantee that the window messages are processed\n * timely is by dedicating a thread to processing window events.\n *\n * TODO: Handle multiple windows on a single thread, instead of creating one\n * thread per each window.\n *\/\nstatic HWND\ncreateWindow(int nWidth, int nHeight)\n{\n    \/\/ Create window class\n    static bool first = TRUE;\n    if (first) {\n        WNDCLASS wc;\n        memset(&wc, 0, sizeof wc);\n        wc.hbrBackground = (HBRUSH) (COLOR_BTNFACE + 1);\n        wc.hCursor = LoadCursor(NULL, IDC_ARROW);\n        wc.hIcon = LoadIcon(NULL, IDI_APPLICATION);\n        wc.lpfnWndProc = WndProc;\n        wc.lpszClassName = \"glretrace\";\n        wc.style = CS_OWNDC | CS_HREDRAW | CS_VREDRAW;\n        RegisterClass(&wc);\n        first = FALSE;\n    }\n\n    \/\/ Spawn window thread\n    WindowThreadParam param;\n    param.nWidth = nWidth;\n    param.nHeight = nHeight;\n    param.hEvent = CreateEvent(NULL, FALSE, FALSE, NULL);\n    DWORD dwThreadId = 0;\n    CreateThread(NULL, 0, &windowThreadFunction, (LPVOID)&param, 0, &dwThreadId);\n\n    \/\/ Wait for window creation event\n    WaitForSingleObject(param.hEvent, INFINITE);\n    CloseHandle(param.hEvent);\n\n    return param.hWnd;\n}\n\n\nclass WglDrawable : public Drawable\n{\npublic:\n    HWND hWnd;\n    HDC hDC;\n    PIXELFORMATDESCRIPTOR pfd;\n    int iPixelFormat;\n\n    WglDrawable(const Visual *vis, int width, int height, bool pbuffer) :\n        Drawable(vis, width, height, pbuffer)\n    {\n        int x = 0, y = 0;\n        RECT rect;\n        BOOL bRet;\n\n        rect.left = x;\n        rect.top = y;\n        rect.right = rect.left + width;\n        rect.bottom = rect.top + height;\n\n        AdjustWindowRectEx(&rect, dwStyle, FALSE, dwExStyle);\n\n        hWnd = createWindow(rect.right  - rect.left,\n                            rect.bottom - rect.top);\n\n        hDC = GetDC(hWnd);\n   \n        memset(&pfd, 0, sizeof pfd);\n        pfd.cColorBits = 4;\n        pfd.cRedBits = 1;\n        pfd.cGreenBits = 1;\n        pfd.cBlueBits = 1;\n        pfd.cAlphaBits = 1;\n        pfd.cDepthBits = 1;\n        pfd.cStencilBits = 1;\n        pfd.dwFlags = PFD_DRAW_TO_WINDOW | PFD_SUPPORT_OPENGL;\n        pfd.iLayerType = PFD_MAIN_PLANE;\n        pfd.iPixelType = PFD_TYPE_RGBA;\n        pfd.nSize = sizeof(pfd);\n        pfd.nVersion = 1;\n\n        if (visual->doubleBuffer) {\n           pfd.dwFlags |= PFD_DOUBLEBUFFER;\n        }\n\n        iPixelFormat = pfnChoosePixelFormat(hDC, &pfd);\n        if (iPixelFormat <= 0) {\n            std::cerr << \"error: ChoosePixelFormat failed\\n\";\n            exit(1);\n        }\n\n        bRet = pfnSetPixelFormat(hDC, iPixelFormat, &pfd);\n        if (!bRet) {\n            std::cerr << \"error: SetPixelFormat failed\\n\";\n            exit(1);\n        }\n    }\n\n    ~WglDrawable() {\n        ReleaseDC(hWnd, hDC);\n        DestroyWindow(hWnd);\n    }\n    \n    void\n    resize(int w, int h) {\n        if (w == width && h == height) {\n            return;\n        }\n\n        Drawable::resize(w, h);\n\n        RECT rClient, rWindow;\n        GetClientRect(hWnd, &rClient);\n        GetWindowRect(hWnd, &rWindow);\n        w += (rWindow.right  - rWindow.left) - rClient.right;\n        h += (rWindow.bottom - rWindow.top)  - rClient.bottom;\n\n        UINT uFlags = SWP_NOMOVE\n                    | SWP_NOZORDER\n                    | SWP_NOACTIVATE\n                    | SWP_NOOWNERZORDER;\n\n        SetWindowPos(hWnd, NULL, rWindow.left, rWindow.top, w, h, uFlags);\n    }\n\n    void show(void) {\n        if (visible) {\n            return;\n        }\n\n        ShowWindow(hWnd, SW_SHOW);\n\n        Drawable::show();\n    }\n\n    void swapBuffers(void) {\n        BOOL bRet;\n        bRet = pfnSwapBuffers(hDC);\n        if (!bRet) {\n            std::cerr << \"warning: SwapBuffers failed\\n\";\n        }\n    }\n};\n\n\nclass WglContext : public Context\n{\npublic:\n    HGLRC hglrc;\n    WglContext *shareContext;\n    bool debug;\n\n    WglContext(const Visual *vis, WglContext *share, bool _debug) :\n        Context(vis),\n        hglrc(0),\n        shareContext(share),\n        debug(_debug)\n    {}\n\n    ~WglContext() {\n        if (hglrc) {\n            wglDeleteContext(hglrc);\n        }\n    }\n\n    bool\n    create(WglDrawable *wglDrawable) {\n        if (!hglrc) {\n            HDC hDC = wglDrawable->hDC;\n\n            hglrc = wglCreateContext(hDC);\n            if (!hglrc) {\n                std::cerr << \"error: wglCreateContext failed\\n\";\n                exit(1);\n            }\n\n            if (shareContext) {\n                shareContext->create(wglDrawable);\n            }\n\n            ProfileDesc desc;\n            getProfileDesc(profile, desc);\n\n            if (desc.major >= 3 || desc.core) {\n                \/\/ We need to create context through WGL_ARB_create_context.  This\n                \/\/ implies binding a temporary context to get the extensions strings\n                \/\/ and function pointers.\n\n                \/\/ This function is only called inside makeCurrent, so we don't need\n                \/\/ to save and restore the previous current context\/drawable.\n                BOOL bRet = wglMakeCurrent(hDC, hglrc);\n                if (!bRet) {\n                    std::cerr << \"error: wglMakeCurrent failed\\n\";\n                    exit(1);\n                }\n\n                PFNWGLGETEXTENSIONSSTRINGARBPROC pfnWglGetExtensionsStringARB =\n                    (PFNWGLGETEXTENSIONSSTRINGARBPROC) wglGetProcAddress(\"wglGetExtensionsStringARB\");\n                if (!pfnWglGetExtensionsStringARB) {\n                    std::cerr << \"error: WGL_ARB_extensions_string not supported\\n\";\n                    exit(1);\n                }\n                const char * extensionsString = pfnWglGetExtensionsStringARB(hDC);\n                if (!checkExtension(\"WGL_ARB_create_context\", extensionsString)) {\n                    std::cerr << \"error: WGL_ARB_create_context not supported\\n\";\n                    exit(1);\n                }\n\n                PFNWGLCREATECONTEXTATTRIBSARBPROC pfnWglCreateContextAttribsARB =\n                    (PFNWGLCREATECONTEXTATTRIBSARBPROC) wglGetProcAddress(\"wglCreateContextAttribsARB\");\n                if (!pfnWglCreateContextAttribsARB) {\n                    std::cerr << \"error: failed to get pointer to wglCreateContextAttribsARB\\n\";\n                    exit(1);\n                }\n\n                wglMakeCurrent(hDC, NULL);\n                wglDeleteContext(hglrc);\n\n                Attributes<int> attribs;\n                attribs.add(WGL_CONTEXT_MAJOR_VERSION_ARB, desc.major);\n                attribs.add(WGL_CONTEXT_MINOR_VERSION_ARB, desc.minor);\n                if (desc.core) {\n                    attribs.add(WGL_CONTEXT_PROFILE_MASK_ARB, WGL_CONTEXT_CORE_PROFILE_BIT_ARB);\n                }\n                if (debug) {\n                    attribs.add(WGL_CONTEXT_FLAGS_ARB, WGL_CONTEXT_DEBUG_BIT_ARB);\n                }\n                attribs.end();\n\n                hglrc = pfnWglCreateContextAttribsARB(hDC,\n                                                      shareContext ? shareContext->hglrc : 0,\n                                                      attribs);\n                if (!hglrc) {\n                    std::cerr << \"error: wglCreateContextAttribsARB failed\\n\";\n                    exit(1);\n                }\n            } else {\n                if (shareContext) {\n                    BOOL bRet;\n                    bRet = wglShareLists(shareContext->hglrc,\n                                         hglrc);\n                    if (!bRet) {\n                        std::cerr\n                            << \"warning: wglShareLists failed: \"\n                            << std::hex << GetLastError() << std::dec\n                            << \"\\n\";\n                    }\n                }\n            }\n        }\n\n        return true;\n    }\n\n};\n\n\nvoid\ninit(void) {\n    \/*\n     * OpenGL library must be loaded by the time we call GDI.\n     *\/\n\n    const char * libgl_filename = getenv(\"TRACE_LIBGL\");\n\n    if (libgl_filename) {\n        _libGlHandle = LoadLibraryA(libgl_filename);\n        if (_libGlHandle) {\n            pfnChoosePixelFormat = (PFN_WGLCHOOSEPIXELFORMAT)GetProcAddress(_libGlHandle, \"wglChoosePixelFormat\");\n            pfnSetPixelFormat = (PFN_WGLSETPIXELFORMAT)GetProcAddress(_libGlHandle, \"&wglSetPixelFormat\");\n            pfnSwapBuffers = (PFN_WGLSWAPBUFFERS)GetProcAddress(_libGlHandle, \"wglSwapBuffers\");\n        }\n    } else {\n        libgl_filename = \"OPENGL32\";\n        _libGlHandle = LoadLibraryA(libgl_filename);\n    }\n\n    if (!_libGlHandle) {\n        std::cerr << \"error: unable to open \" << libgl_filename << \"\\n\";\n        exit(1);\n    }\n}\n\nvoid\ncleanup(void) {\n}\n\nVisual *\ncreateVisual(bool doubleBuffer, unsigned samples, Profile profile) {\n    switch (profile) {\n    case PROFILE_COMPAT:\n        break;\n    case PROFILE_ES1:\n        return NULL;\n    case PROFILE_ES2:\n        std::cerr << \"warning: ignoring OpenGL ES 2.0 profile request\\n\";\n        break;\n    default:\n        break;\n    }\n\n    Visual *visual = new Visual(profile);\n\n    visual->doubleBuffer = doubleBuffer;\n\n    return visual;\n}\n\nDrawable *\ncreateDrawable(const Visual *visual, int width, int height, bool pbuffer)\n{\n    return new WglDrawable(visual, width, height, pbuffer);\n}\n\nbool\nbindApi(Api api)\n{\n    return true;\n}\n\nContext *\ncreateContext(const Visual *visual, Context *shareContext, bool debug)\n{\n    return new WglContext(visual, static_cast<WglContext *>(shareContext), debug);\n}\n\nbool\nmakeCurrent(Drawable *drawable, Context *context)\n{\n    if (!drawable || !context) {\n        return wglMakeCurrent(NULL, NULL);\n    } else {\n        WglDrawable *wglDrawable = static_cast<WglDrawable *>(drawable);\n        WglContext *wglContext = static_cast<WglContext *>(context);\n\n        wglContext->create(wglDrawable);\n\n        return wglMakeCurrent(wglDrawable->hDC, wglContext->hglrc);\n    }\n}\n\nbool\nprocessEvents(void) {\n    MSG uMsg;\n    while (PeekMessage(&uMsg, NULL, 0, 0, PM_REMOVE)) {\n        if (uMsg.message == WM_QUIT) {\n            return false;\n        }\n\n        if (!TranslateAccelerator(uMsg.hwnd, NULL, &uMsg)) {\n            TranslateMessage(&uMsg);\n            DispatchMessage(&uMsg);\n        }\n    }\n    return true;\n}\n\n\n} \/* namespace glws *\/\n<commit_msg>glretrace: Leverage WGL_EXT_create_context_es2_profile.<commit_after>\/**************************************************************************\n *\n * Copyright 2011 Jose Fonseca\n * All Rights Reserved.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *\n **************************************************************************\/\n\n\n\/*\n * WGL bindings.\n *\/\n\n\n#include <iostream>\n\n#include \"glproc.hpp\"\n#include \"glws.hpp\"\n\n\nnamespace glws {\n\n\n\/*\n * Several WGL functions come in two flavors:\n * - GDI (ChoosePixelFormat, SetPixelFormat, SwapBuffers, etc)\n * - WGL (wglChoosePixelFormat, wglSetPixelFormat, wglSwapBuffers, etc)\n *\n * The GDI entrypoints will inevitably dispatch to the first module named\n * \"OPENGL32\", loading \"C:\\Windows\\System32\\opengl32.dll\" if none was loaded so\n * far.\n *\n * In order to use a implementation other than the one installed in the system\n * (when specified via the TRACE_LIBGL environment variable), we need to use\n * WGL entrypoints.\n *\n * See also:\n * - http:\/\/www.opengl.org\/archives\/resources\/faq\/technical\/mswindows.htm\n *\/\nstatic PFN_WGLCHOOSEPIXELFORMAT pfnChoosePixelFormat = &ChoosePixelFormat;\nstatic PFN_WGLSETPIXELFORMAT pfnSetPixelFormat = &SetPixelFormat;\nstatic PFN_WGLSWAPBUFFERS pfnSwapBuffers = &SwapBuffers;\n\n\nstatic LRESULT CALLBACK\nWndProc(HWND hWnd, UINT uMsg, WPARAM wParam, LPARAM lParam)\n{\n    MINMAXINFO *pMMI;\n    switch (uMsg) {\n    case WM_KEYDOWN:\n        switch (wParam) {\n        case VK_ESCAPE:\n            PostMessage(hWnd, WM_CLOSE, 0, 0);\n            break;\n        }\n        break;\n    case WM_GETMINMAXINFO:\n        \/\/ Allow to create a window bigger than the desktop\n        pMMI = (MINMAXINFO *)lParam;\n        pMMI->ptMaxSize.x = 60000;\n        pMMI->ptMaxSize.y = 60000;\n        pMMI->ptMaxTrackSize.x = 60000;\n        pMMI->ptMaxTrackSize.y = 60000;\n        break;\n    case WM_CLOSE:\n        exit(0);\n        break;\n    default:\n        break;\n    }\n\n    return DefWindowProc(hWnd, uMsg, wParam, lParam);\n}\n\n\nstatic const DWORD dwExStyle = 0;\nstatic const DWORD dwStyle = WS_CLIPSIBLINGS | WS_CLIPCHILDREN | WS_OVERLAPPEDWINDOW;\n\n\nstruct WindowThreadParam\n{\n    int nWidth;\n    int nHeight;\n\n    HANDLE hEvent;\n\n    HWND hWnd;\n};\n\n\nstatic DWORD WINAPI\nwindowThreadFunction( LPVOID _lpParam )\n{\n    WindowThreadParam *lpParam = (WindowThreadParam *)_lpParam;\n\n    \/\/ Actually create the window\n    lpParam->hWnd = CreateWindowEx(dwExStyle,\n                                   \"glretrace\", \/* wc.lpszClassName *\/\n                                   NULL,\n                                   dwStyle,\n                                   0, \/* x *\/\n                                   0, \/* y *\/\n                                   lpParam->nWidth,\n                                   lpParam->nHeight,\n                                   NULL,\n                                   NULL,\n                                   NULL,\n                                   NULL);\n\n    \/\/ Notify parent thread that window has been created\n    SetEvent(lpParam->hEvent);\n\n    BOOL bRet;\n    MSG msg;\n    while ((bRet = GetMessage(&msg, NULL, 0, 0 )) != FALSE) {\n        if (bRet == -1) {\n            \/\/ handle the error and possibly exit\n        } else {\n            TranslateMessage(&msg);\n            DispatchMessage(&msg);\n        }\n    }\n\n    \/\/ Return the exit code\n    return msg.wParam;\n}\n\n\n\/**\n * Create a window on a separate thread.\n *\n * Each window is associated with one thread, which must process its events,\n * and certain operations like SetWindowPos will block until the message is\n * process, so the only way to guarantee that the window messages are processed\n * timely is by dedicating a thread to processing window events.\n *\n * TODO: Handle multiple windows on a single thread, instead of creating one\n * thread per each window.\n *\/\nstatic HWND\ncreateWindow(int nWidth, int nHeight)\n{\n    \/\/ Create window class\n    static bool first = TRUE;\n    if (first) {\n        WNDCLASS wc;\n        memset(&wc, 0, sizeof wc);\n        wc.hbrBackground = (HBRUSH) (COLOR_BTNFACE + 1);\n        wc.hCursor = LoadCursor(NULL, IDC_ARROW);\n        wc.hIcon = LoadIcon(NULL, IDI_APPLICATION);\n        wc.lpfnWndProc = WndProc;\n        wc.lpszClassName = \"glretrace\";\n        wc.style = CS_OWNDC | CS_HREDRAW | CS_VREDRAW;\n        RegisterClass(&wc);\n        first = FALSE;\n    }\n\n    \/\/ Spawn window thread\n    WindowThreadParam param;\n    param.nWidth = nWidth;\n    param.nHeight = nHeight;\n    param.hEvent = CreateEvent(NULL, FALSE, FALSE, NULL);\n    DWORD dwThreadId = 0;\n    CreateThread(NULL, 0, &windowThreadFunction, (LPVOID)&param, 0, &dwThreadId);\n\n    \/\/ Wait for window creation event\n    WaitForSingleObject(param.hEvent, INFINITE);\n    CloseHandle(param.hEvent);\n\n    return param.hWnd;\n}\n\n\nclass WglDrawable : public Drawable\n{\npublic:\n    HWND hWnd;\n    HDC hDC;\n    PIXELFORMATDESCRIPTOR pfd;\n    int iPixelFormat;\n\n    WglDrawable(const Visual *vis, int width, int height, bool pbuffer) :\n        Drawable(vis, width, height, pbuffer)\n    {\n        int x = 0, y = 0;\n        RECT rect;\n        BOOL bRet;\n\n        rect.left = x;\n        rect.top = y;\n        rect.right = rect.left + width;\n        rect.bottom = rect.top + height;\n\n        AdjustWindowRectEx(&rect, dwStyle, FALSE, dwExStyle);\n\n        hWnd = createWindow(rect.right  - rect.left,\n                            rect.bottom - rect.top);\n\n        hDC = GetDC(hWnd);\n   \n        memset(&pfd, 0, sizeof pfd);\n        pfd.cColorBits = 4;\n        pfd.cRedBits = 1;\n        pfd.cGreenBits = 1;\n        pfd.cBlueBits = 1;\n        pfd.cAlphaBits = 1;\n        pfd.cDepthBits = 1;\n        pfd.cStencilBits = 1;\n        pfd.dwFlags = PFD_DRAW_TO_WINDOW | PFD_SUPPORT_OPENGL;\n        pfd.iLayerType = PFD_MAIN_PLANE;\n        pfd.iPixelType = PFD_TYPE_RGBA;\n        pfd.nSize = sizeof(pfd);\n        pfd.nVersion = 1;\n\n        if (visual->doubleBuffer) {\n           pfd.dwFlags |= PFD_DOUBLEBUFFER;\n        }\n\n        iPixelFormat = pfnChoosePixelFormat(hDC, &pfd);\n        if (iPixelFormat <= 0) {\n            std::cerr << \"error: ChoosePixelFormat failed\\n\";\n            exit(1);\n        }\n\n        bRet = pfnSetPixelFormat(hDC, iPixelFormat, &pfd);\n        if (!bRet) {\n            std::cerr << \"error: SetPixelFormat failed\\n\";\n            exit(1);\n        }\n    }\n\n    ~WglDrawable() {\n        ReleaseDC(hWnd, hDC);\n        DestroyWindow(hWnd);\n    }\n    \n    void\n    resize(int w, int h) {\n        if (w == width && h == height) {\n            return;\n        }\n\n        Drawable::resize(w, h);\n\n        RECT rClient, rWindow;\n        GetClientRect(hWnd, &rClient);\n        GetWindowRect(hWnd, &rWindow);\n        w += (rWindow.right  - rWindow.left) - rClient.right;\n        h += (rWindow.bottom - rWindow.top)  - rClient.bottom;\n\n        UINT uFlags = SWP_NOMOVE\n                    | SWP_NOZORDER\n                    | SWP_NOACTIVATE\n                    | SWP_NOOWNERZORDER;\n\n        SetWindowPos(hWnd, NULL, rWindow.left, rWindow.top, w, h, uFlags);\n    }\n\n    void show(void) {\n        if (visible) {\n            return;\n        }\n\n        ShowWindow(hWnd, SW_SHOW);\n\n        Drawable::show();\n    }\n\n    void swapBuffers(void) {\n        BOOL bRet;\n        bRet = pfnSwapBuffers(hDC);\n        if (!bRet) {\n            std::cerr << \"warning: SwapBuffers failed\\n\";\n        }\n    }\n};\n\n\nclass WglContext : public Context\n{\npublic:\n    HGLRC hglrc;\n    WglContext *shareContext;\n    bool debug;\n\n    WglContext(const Visual *vis, WglContext *share, bool _debug) :\n        Context(vis),\n        hglrc(0),\n        shareContext(share),\n        debug(_debug)\n    {}\n\n    ~WglContext() {\n        if (hglrc) {\n            wglDeleteContext(hglrc);\n        }\n    }\n\n    bool\n    create(WglDrawable *wglDrawable) {\n        if (!hglrc) {\n            HDC hDC = wglDrawable->hDC;\n\n            hglrc = wglCreateContext(hDC);\n            if (!hglrc) {\n                std::cerr << \"error: wglCreateContext failed\\n\";\n                exit(1);\n            }\n\n            if (shareContext) {\n                shareContext->create(wglDrawable);\n            }\n\n            ProfileDesc desc;\n            getProfileDesc(profile, desc);\n\n            if (desc.api != API_GL ||\n                desc.major > 3 ||\n                (desc.major == 3 && desc.minor > 0)) {\n                \/\/ We need to create context through WGL_ARB_create_context.  This\n                \/\/ implies binding a temporary context to get the extensions strings\n                \/\/ and function pointers.\n\n                \/\/ This function is only called inside makeCurrent, so we don't need\n                \/\/ to save and restore the previous current context\/drawable.\n                BOOL bRet = wglMakeCurrent(hDC, hglrc);\n                if (!bRet) {\n                    std::cerr << \"error: wglMakeCurrent failed\\n\";\n                    exit(1);\n                }\n\n                PFNWGLGETEXTENSIONSSTRINGARBPROC pfnWglGetExtensionsStringARB =\n                    (PFNWGLGETEXTENSIONSSTRINGARBPROC) wglGetProcAddress(\"wglGetExtensionsStringARB\");\n                if (!pfnWglGetExtensionsStringARB) {\n                    std::cerr << \"error: WGL_ARB_extensions_string not supported\\n\";\n                    exit(1);\n                }\n                const char * extensionsString = pfnWglGetExtensionsStringARB(hDC);\n                if (!checkExtension(\"WGL_ARB_create_context\", extensionsString)) {\n                    std::cerr << \"error: WGL_ARB_create_context not supported\\n\";\n                    exit(1);\n                }\n\n                PFNWGLCREATECONTEXTATTRIBSARBPROC pfnWglCreateContextAttribsARB =\n                    (PFNWGLCREATECONTEXTATTRIBSARBPROC) wglGetProcAddress(\"wglCreateContextAttribsARB\");\n                if (!pfnWglCreateContextAttribsARB) {\n                    std::cerr << \"error: failed to get pointer to wglCreateContextAttribsARB\\n\";\n                    exit(1);\n                }\n\n                wglMakeCurrent(hDC, NULL);\n                wglDeleteContext(hglrc);\n\n                Attributes<int> attribs;\n                if (desc.api == API_GL) {\n                    attribs.add(WGL_CONTEXT_MAJOR_VERSION_ARB, desc.major);\n                    attribs.add(WGL_CONTEXT_MINOR_VERSION_ARB, desc.minor);\n                    if (desc.core) {\n                        attribs.add(WGL_CONTEXT_PROFILE_MASK_ARB, WGL_CONTEXT_CORE_PROFILE_BIT_ARB);\n                    }\n                } else if (desc.api == API_GLES) {\n                    if (checkExtension(\"WGL_EXT_create_context_es2_profile\", extensionsString)) {\n                        attribs.add(WGL_CONTEXT_PROFILE_MASK_ARB, WGL_CONTEXT_ES_PROFILE_BIT_EXT);\n                        attribs.add(WGL_CONTEXT_MAJOR_VERSION_ARB, desc.major);\n                        attribs.add(WGL_CONTEXT_MINOR_VERSION_ARB, desc.minor);\n                    } else if (desc.major >= 2) {\n                        std::cerr << \"warning: OpenGL ES \" << desc.major << \" requested but WGL_EXT_create_context_es2_profile not supported\\\\n\";\n                    } else if (checkExtension(\"WGL_EXT_create_context_es_profile\", extensionsString)) {\n                        attribs.add(WGL_CONTEXT_PROFILE_MASK_ARB, WGL_CONTEXT_ES_PROFILE_BIT_EXT);\n                        \/* version implied *\/\n                    } else {\n                        std::cerr << \"warning: OpenGL ES \" << desc.major << \" requested but WGL_EXT_create_context_es_profile not supported\\\\n\";\n                    }\n                } else {\n                    assert(0);\n                }\n                if (debug) {\n                    attribs.add(WGL_CONTEXT_FLAGS_ARB, WGL_CONTEXT_DEBUG_BIT_ARB);\n                }\n                attribs.end();\n\n                hglrc = pfnWglCreateContextAttribsARB(hDC,\n                                                      shareContext ? shareContext->hglrc : 0,\n                                                      attribs);\n                if (!hglrc) {\n                    std::cerr << \"error: wglCreateContextAttribsARB failed\\n\";\n                    exit(1);\n                }\n            } else {\n                if (shareContext) {\n                    BOOL bRet;\n                    bRet = wglShareLists(shareContext->hglrc,\n                                         hglrc);\n                    if (!bRet) {\n                        std::cerr\n                            << \"warning: wglShareLists failed: \"\n                            << std::hex << GetLastError() << std::dec\n                            << \"\\n\";\n                    }\n                }\n            }\n        }\n\n        return true;\n    }\n\n};\n\n\nvoid\ninit(void) {\n    \/*\n     * OpenGL library must be loaded by the time we call GDI.\n     *\/\n\n    const char * libgl_filename = getenv(\"TRACE_LIBGL\");\n\n    if (libgl_filename) {\n        _libGlHandle = LoadLibraryA(libgl_filename);\n        if (_libGlHandle) {\n            pfnChoosePixelFormat = (PFN_WGLCHOOSEPIXELFORMAT)GetProcAddress(_libGlHandle, \"wglChoosePixelFormat\");\n            pfnSetPixelFormat = (PFN_WGLSETPIXELFORMAT)GetProcAddress(_libGlHandle, \"&wglSetPixelFormat\");\n            pfnSwapBuffers = (PFN_WGLSWAPBUFFERS)GetProcAddress(_libGlHandle, \"wglSwapBuffers\");\n        }\n    } else {\n        libgl_filename = \"OPENGL32\";\n        _libGlHandle = LoadLibraryA(libgl_filename);\n    }\n\n    if (!_libGlHandle) {\n        std::cerr << \"error: unable to open \" << libgl_filename << \"\\n\";\n        exit(1);\n    }\n}\n\nvoid\ncleanup(void) {\n}\n\nVisual *\ncreateVisual(bool doubleBuffer, unsigned samples, Profile profile) {\n    Visual *visual = new Visual(profile);\n\n    visual->doubleBuffer = doubleBuffer;\n\n    return visual;\n}\n\nDrawable *\ncreateDrawable(const Visual *visual, int width, int height, bool pbuffer)\n{\n    return new WglDrawable(visual, width, height, pbuffer);\n}\n\nbool\nbindApi(Api api)\n{\n    return true;\n}\n\nContext *\ncreateContext(const Visual *visual, Context *shareContext, bool debug)\n{\n    return new WglContext(visual, static_cast<WglContext *>(shareContext), debug);\n}\n\nbool\nmakeCurrent(Drawable *drawable, Context *context)\n{\n    if (!drawable || !context) {\n        return wglMakeCurrent(NULL, NULL);\n    } else {\n        WglDrawable *wglDrawable = static_cast<WglDrawable *>(drawable);\n        WglContext *wglContext = static_cast<WglContext *>(context);\n\n        wglContext->create(wglDrawable);\n\n        return wglMakeCurrent(wglDrawable->hDC, wglContext->hglrc);\n    }\n}\n\nbool\nprocessEvents(void) {\n    MSG uMsg;\n    while (PeekMessage(&uMsg, NULL, 0, 0, PM_REMOVE)) {\n        if (uMsg.message == WM_QUIT) {\n            return false;\n        }\n\n        if (!TranslateAccelerator(uMsg.hwnd, NULL, &uMsg)) {\n            TranslateMessage(&uMsg);\n            DispatchMessage(&uMsg);\n        }\n    }\n    return true;\n}\n\n\n} \/* namespace glws *\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"ride\/wx.h\"\n#include \"ride\/settingsdlg.h\"\n#include \"ride\/mainwindow.h\"\n#include <wx\/fontenum.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#define RETURN_COMBOBOX_VALUE(TYPE, VALUE) assert(ride::TYPE##_IsValid(VALUE)); return static_cast<ride::TYPE>(VALUE)\n#define DIALOG_DATA(ROOT, FUN, UI, SETNAME) do { if( togui ) { ToGui(ROOT.FUN(), UI); } else { ROOT.set_##FUN(ToData##SETNAME(UI)); } } while(false)\n#define DIALOG_DATAX(ROOT, FUN, UI) do { if( togui ) { ToGui(ROOT.FUN(), UI); } else { ROOT.set_allocated_##FUN(Allocate(ToData(UI))); } } while(false)\n\ntemplate<typename T>\nT* Allocate(const T& t) {\n  return new T(t);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid ToGui(bool data, wxCheckBox* gui)  {\n  gui->SetValue(data);\n}\nbool ToData(wxCheckBox* gui)  {\n  return gui->GetValue();\n}\n\nvoid ToGui(ride::Color data, wxColourPickerCtrl* gui)  {\n  gui->SetColour(C(data));\n}\nride::Color ToData(wxColourPickerCtrl* gui)  {\n  return C(gui->GetColour());\n}\n\nvoid ToGui(ride::ViewWhitespace data, wxComboBox* gui)  {\n  gui->SetSelection(static_cast<int>(data));\n}\nride::ViewWhitespace ToData_VW(wxComboBox* gui)  {\n  RETURN_COMBOBOX_VALUE(ViewWhitespace, gui->GetSelection());\n}\n\nvoid ToGui(ride::WrapMode data, wxComboBox* gui)  {\n  gui->SetSelection(static_cast<int>(data));\n}\nride::WrapMode ToData_WM(wxComboBox* gui)  {\n  RETURN_COMBOBOX_VALUE(WrapMode, gui->GetSelection());\n}\n\nvoid ToGui(ride::EdgeStyle data, wxComboBox* gui)  {\n  gui->SetSelection(static_cast<int>(data));\n}\nride::EdgeStyle ToData_ES(wxComboBox* gui)  {\n  RETURN_COMBOBOX_VALUE(EdgeStyle, gui->GetSelection());\n}\n\nvoid ToGui(google::protobuf::int32 data, wxTextCtrl* gui)  {\n  wxString value = wxString::FromDouble(data, 0);\n  gui->SetValue(value);\n}\ngoogle::protobuf::int32 ToData(wxTextCtrl* gui)  {\n  const wxString value = gui->GetValue();\n  long ret = 0;\n  if (true == value.ToLong(&ret)) {\n    return ret;\n  }\n  if (value.length() == 0) return -1;\n  assert(false && \"Unable to get integer value\");\n  return -1;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass StyleLink {\npublic:\n  StyleLink(const wxString& name)\n    : name_(name)\n  { }\n\n  virtual ~StyleLink() {\n  };\n\n  const wxString& name() const {\n    assert(this);\n    return name_;\n  }\n\n  virtual const ride::Style get(const ride::FontsAndColors& color) = 0;\n\n  virtual void set(ride::FontsAndColors& color, const ride::Style& style) = 0;\n\n  \/\/ todo: add some form of group so we can easily group styles in the gui\n\nprivate:\n  wxString name_;\n};\n\nstd::vector<StyleLink*> BuildStyleLinks() {\n  std::vector<StyleLink*> ret;\n#define DEF_STYLE(NAME, STYLE) \\\n  struct StyleLink##STYLE : public StyleLink { \\\n  StyleLink##STYLE() : StyleLink(NAME) {} \\\n  const ride::Style get(const ride::FontsAndColors& co){return co.has_ ## STYLE() ? co.STYLE() : ride::Style();}\\\n  void set(ride::FontsAndColors& co, const ride::Style& style){co.set_allocated_ ## STYLE(Allocate(style));} \\\n  };\\\n  static StyleLink##STYLE styleLink##STYLE;\\\n  ret.push_back(&styleLink##STYLE)\n\n  DEF_STYLE(\"Default\", default_style);\n  DEF_STYLE(\"Brace light\", bracelight_style);\n  DEF_STYLE(\"Brace bad\", bracebad_style);\n  DEF_STYLE(\"Control char\", controlchar_style);\n  DEF_STYLE(\"Indent guide\", indentguide_style);\n  DEF_STYLE(\"Calltip stype\", calltip_style);\n#undef DEF_STYLE\n  return ret;\n}\n\nconst std::vector<StyleLink*>& StyleLinks() {\n  static std::vector<StyleLink*> links = BuildStyleLinks();\n  return links;\n}\n\nclass FontLister : public wxFontEnumerator {\npublic:\n  std::vector<wxString> fonts;\n  virtual bool OnFacename(const wxString& font) {\n    \/\/ The version of the font with the '@' is a version optimized for writing in the vertical direction.\n    \/\/ https:\/\/groups.google.com\/forum\/#!topic\/wx-users\/3hjrhPlSULI\n    if (font.StartsWith(\"@\") == false) {\n      fonts.push_back(font);\n    }\n    return true;\n  }\n};\n\nvoid SettingsDlg::OnOnlyFixedSysChanged(wxCommandEvent& event) {\n  updateFonts();\n}\n\nvoid SettingsDlg::updateFonts() {\n  FontLister allfonts;\n\n  const bool fixedSize = uiStyleOnlyFixedSize->GetValue();\n\n  allfonts.EnumerateFacenames(wxFONTENCODING_SYSTEM, fixedSize);\n  uiStyleTypeface->Clear();\n  for (auto name : allfonts.fonts) {\n    uiStyleTypeface->AppendString(name);\n  }\n}\n\nvoid SettingsDlg::OnSelectedStyleChanged(wxCommandEvent& event) {\n  allowStyleChange = false;\n  styleToGui(true);\n  allowStyleChange = true;\n}\n\nvoid SettingsDlg::OnStyleFontChanged(wxCommandEvent& event) {\n  updateFontDisplay();\n  styleChanged();\n}\n\nvoid SettingsDlg::OnStyleCheckChanged(wxCommandEvent& event) {\n  styleChanged();\n}\n\nvoid SettingsDlg::OnStyleComboboxChanged(wxCommandEvent& event) {\n  styleChanged();\n}\n\nvoid SettingsDlg::OnStyleColorChanged(wxColourPickerEvent& event) {\n  styleChanged();\n}\n\nvoid SettingsDlg::styleChanged() {\n  if (allowStyleChange == false) return;\n  styleToGui(false);\n  main->setSettings(edit);\n  main->setSettings(edit); \/\/ update seems to lag behind one setSettings, this seems to fix that, weird... I should investigate this...\n}\n\nvoid SettingsDlg::styleToGui(bool togui) {\n  const int selection = uiFontStyles->GetSelection();\n  if (selection == wxNOT_FOUND) return;\n  StyleLink* link = reinterpret_cast<StyleLink*>(uiFontStyles->GetClientData(selection));\n  assert(link);\n  if (link == NULL) return;\n\n  ride::Style style;\n  \n  \/*if (togui) {\n    if (edit.has_fonts_and_colors()) {*\/\n      style = link->get( edit.fonts_and_colors() );\n    \/*}\n  }*\/\n\n  DIALOG_DATA(style, use_foreground, uiStyleUseForeground,);\n  DIALOG_DATA(style, use_background, uiStyleUseBackground,);\n  DIALOG_DATAX(style, foreground, uiStyleForeground);\n  DIALOG_DATAX(style, background, uiStyleBackground);\n\n  if (togui == false) {\n    ride::FontsAndColors color;\n    if (edit.has_fonts_and_colors()) {\n      color = edit.fonts_and_colors();\n    }\n    link->set(color, style);\n\n    edit.set_allocated_fonts_and_colors(Allocate(color));\n  }\n}\n\nvoid SettingsDlg::updateFontDisplay() {\n  int selectedId = uiStyleTypeface->GetSelection();\n  wxString faceName = selectedId > 0 ? uiStyleTypeface->GetString(selectedId) : \"\";\n  wxFont font( wxFontInfo(12).FaceName(faceName) );\n  uiStyleExample->SetFont(font);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSettingsDlg::SettingsDlg(wxWindow* parent, MainWindow* mainwindow) :\n::ui::Settings(parent, wxID_ANY), main(mainwindow), allowApply(false), allowStyleChange(false)\n{\n  global = main->getSettings();\n  edit = global;\n  editToGui(true);\n  allowApply = true;\n\n  for (auto link: StyleLinks()) {\n    uiFontStyles->Append(link->name(), link);\n  }\n  updateFonts();\n}\n\nvoid SettingsDlg::OnApply( wxCommandEvent& event )\n{\n  apply();\n}\n\nvoid SettingsDlg::OnCancel( wxCommandEvent& event )\n{\n  main->setSettings(global);\n  EndModal(wxCANCEL);\n}\n\nvoid SettingsDlg::OnOk( wxCommandEvent& event )\n{\n  editToGui(false);\n  main->setSettings(edit);\n  if (false == SaveSettings(edit)) {\n    wxMessageBox(\"Failed to save settings\", \"Failed!\", wxOK | wxICON_ERROR);\n  }\n  EndModal(wxOK);\n}\n\nvoid SettingsDlg::OnCheckboxChanged(wxCommandEvent& event)\n{\n  assert(this);\n  apply();\n}\n\nvoid SettingsDlg::OnComboboxChanged(wxCommandEvent& event)\n{\n  assert(this);\n  apply();\n}\n\nvoid SettingsDlg::OnColorChanged(wxColourPickerEvent& event)\n{\n  assert(this);\n  apply();\n}\n\nvoid SettingsDlg::OnEditChanged(wxCommandEvent& event)\n{\n  assert(this);\n  apply();\n}\n\nvoid SettingsDlg::apply()\n{\n  if (allowApply == false) { return; }\n  editToGui(false);\n  main->setSettings(edit);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid SettingsDlg::editToGui(bool togui) {\n  ride::FontsAndColors fonts_and_colors = edit.fonts_and_colors();\n  ride::FoldFlags foldflags = edit.foldflags();\n\n  DIALOG_DATA(edit, displayeolenable, uiDisplayEOL,);\n  DIALOG_DATA(edit, linenumberenable, uiShowLineNumbers,);\n  DIALOG_DATA(edit, indentguideenable, uiIndentGuide,);\n\n  DIALOG_DATA(edit, tabwidth, uiTabWidth, );\n  DIALOG_DATA(edit, edgecolumn, uiEdgeColumn, );\n\n  DIALOG_DATA(edit, whitespace, uiViewWhitespace, _VW);\n  DIALOG_DATA(edit, wordwrap, uiWordwrap, _WM);\n  DIALOG_DATA(edit, edgestyle, uiEdgeStyle, _ES);\n\n  DIALOG_DATA(edit, tabindents, uiTabIndents, );\n  DIALOG_DATA(edit, usetabs, uiUseTabs, );\n  DIALOG_DATA(edit, backspaceunindents, uiBackspaceUnindents, );\n\n  DIALOG_DATA(edit, foldenable, uiAllowFolding, );\n  \n  DIALOG_DATA(foldflags, levelnumbers, uiFoldLevelNumbers, );\n  DIALOG_DATA(foldflags, linebefore_expanded, uiFoldLineBeforeExpanded, );\n  DIALOG_DATA(foldflags, linebefore_contracted, uiFoldLineBeforeContracted, );\n  DIALOG_DATA(foldflags, lineafter_expanded, uiFoldLineAfterExpanded, );\n  DIALOG_DATA(foldflags, lineafter_contracted, uiFoldLineAfterContracted, );\n\n  DIALOG_DATAX(fonts_and_colors, edgecolor, uiEdgeColor);\n\n  if (togui == false) {\n    edit.set_allocated_fonts_and_colors(Allocate(fonts_and_colors));\n    edit.set_allocated_foldflags(Allocate(foldflags));\n  }\n}\n\n<commit_msg>cleanup<commit_after>#include \"ride\/wx.h\"\n#include \"ride\/settingsdlg.h\"\n#include \"ride\/mainwindow.h\"\n#include <wx\/fontenum.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#define RETURN_COMBOBOX_VALUE(TYPE, VALUE) assert(ride::TYPE##_IsValid(VALUE)); return static_cast<ride::TYPE>(VALUE)\n#define DIALOG_DATA(ROOT, FUN, UI, SETNAME) do { if( togui ) { ToGui(ROOT.FUN(), UI); } else { ROOT.set_##FUN(ToData##SETNAME(UI)); } } while(false)\n#define DIALOG_DATAX(ROOT, FUN, UI) do { if( togui ) { ToGui(ROOT.FUN(), UI); } else { ROOT.set_allocated_##FUN(Allocate(ToData(UI))); } } while(false)\n\ntemplate<typename T>\nT* Allocate(const T& t) {\n  return new T(t);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid ToGui(bool data, wxCheckBox* gui)  {\n  gui->SetValue(data);\n}\nbool ToData(wxCheckBox* gui)  {\n  return gui->GetValue();\n}\n\nvoid ToGui(ride::Color data, wxColourPickerCtrl* gui)  {\n  gui->SetColour(C(data));\n}\nride::Color ToData(wxColourPickerCtrl* gui)  {\n  return C(gui->GetColour());\n}\n\nvoid ToGui(ride::ViewWhitespace data, wxComboBox* gui)  {\n  gui->SetSelection(static_cast<int>(data));\n}\nride::ViewWhitespace ToData_VW(wxComboBox* gui)  {\n  RETURN_COMBOBOX_VALUE(ViewWhitespace, gui->GetSelection());\n}\n\nvoid ToGui(ride::WrapMode data, wxComboBox* gui)  {\n  gui->SetSelection(static_cast<int>(data));\n}\nride::WrapMode ToData_WM(wxComboBox* gui)  {\n  RETURN_COMBOBOX_VALUE(WrapMode, gui->GetSelection());\n}\n\nvoid ToGui(ride::EdgeStyle data, wxComboBox* gui)  {\n  gui->SetSelection(static_cast<int>(data));\n}\nride::EdgeStyle ToData_ES(wxComboBox* gui)  {\n  RETURN_COMBOBOX_VALUE(EdgeStyle, gui->GetSelection());\n}\n\nvoid ToGui(google::protobuf::int32 data, wxTextCtrl* gui)  {\n  wxString value = wxString::FromDouble(data, 0);\n  gui->SetValue(value);\n}\ngoogle::protobuf::int32 ToData(wxTextCtrl* gui)  {\n  const wxString value = gui->GetValue();\n  long ret = 0;\n  if (true == value.ToLong(&ret)) {\n    return ret;\n  }\n  if (value.length() == 0) return -1;\n  assert(false && \"Unable to get integer value\");\n  return -1;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass StyleLink {\npublic:\n  StyleLink(const wxString& name)\n    : name_(name)\n  { }\n\n  virtual ~StyleLink() {\n  };\n\n  const wxString& name() const {\n    assert(this);\n    return name_;\n  }\n\n  virtual const ride::Style get(const ride::FontsAndColors& color) = 0;\n\n  virtual void set(ride::FontsAndColors& color, const ride::Style& style) = 0;\n\n  \/\/ todo: add some form of group so we can easily group styles in the gui\n\nprivate:\n  wxString name_;\n};\n\nstd::vector<StyleLink*> BuildStyleLinks() {\n  std::vector<StyleLink*> ret;\n#define DEF_STYLE(NAME, STYLE) \\\n  struct StyleLink##STYLE : public StyleLink { \\\n  StyleLink##STYLE() : StyleLink(NAME) {} \\\n  const ride::Style get(const ride::FontsAndColors& co){return co.has_ ## STYLE() ? co.STYLE() : ride::Style();}\\\n  void set(ride::FontsAndColors& co, const ride::Style& style){co.set_allocated_ ## STYLE(Allocate(style));} \\\n  };\\\n  static StyleLink##STYLE styleLink##STYLE;\\\n  ret.push_back(&styleLink##STYLE)\n\n  DEF_STYLE(\"Default\", default_style);\n  DEF_STYLE(\"Brace light\", bracelight_style);\n  DEF_STYLE(\"Brace bad\", bracebad_style);\n  DEF_STYLE(\"Control char\", controlchar_style);\n  DEF_STYLE(\"Indent guide\", indentguide_style);\n  DEF_STYLE(\"Calltip stype\", calltip_style);\n#undef DEF_STYLE\n  return ret;\n}\n\nconst std::vector<StyleLink*>& StyleLinks() {\n  static std::vector<StyleLink*> links = BuildStyleLinks();\n  return links;\n}\n\nclass FontLister : public wxFontEnumerator {\npublic:\n  std::vector<wxString> fonts;\n  virtual bool OnFacename(const wxString& font) {\n    \/\/ The version of the font with the '@' is a version optimized for writing in the vertical direction.\n    \/\/ https:\/\/groups.google.com\/forum\/#!topic\/wx-users\/3hjrhPlSULI\n    if (font.StartsWith(\"@\") == false) {\n      fonts.push_back(font);\n    }\n    return true;\n  }\n};\n\nvoid SettingsDlg::OnOnlyFixedSysChanged(wxCommandEvent& event) {\n  updateFonts();\n}\n\nvoid SettingsDlg::updateFonts() {\n  FontLister allfonts;\n\n  const bool fixedSize = uiStyleOnlyFixedSize->GetValue();\n\n  allfonts.EnumerateFacenames(wxFONTENCODING_SYSTEM, fixedSize);\n  uiStyleTypeface->Clear();\n  for (auto name : allfonts.fonts) {\n    uiStyleTypeface->AppendString(name);\n  }\n}\n\nvoid SettingsDlg::OnSelectedStyleChanged(wxCommandEvent& event) {\n  allowStyleChange = false;\n  styleToGui(true);\n  allowStyleChange = true;\n}\n\nvoid SettingsDlg::OnStyleFontChanged(wxCommandEvent& event) {\n  updateFontDisplay();\n  styleChanged();\n}\n\nvoid SettingsDlg::OnStyleCheckChanged(wxCommandEvent& event) {\n  styleChanged();\n}\n\nvoid SettingsDlg::OnStyleComboboxChanged(wxCommandEvent& event) {\n  styleChanged();\n}\n\nvoid SettingsDlg::OnStyleColorChanged(wxColourPickerEvent& event) {\n  styleChanged();\n}\n\nvoid SettingsDlg::styleChanged() {\n  if (allowStyleChange == false) return;\n  styleToGui(false);\n  main->setSettings(edit);\n  main->setSettings(edit); \/\/ update seems to lag behind one setSettings, this seems to fix that, weird... I should investigate this...\n}\n\nvoid SettingsDlg::styleToGui(bool togui) {\n  const int selection = uiFontStyles->GetSelection();\n  if (selection == wxNOT_FOUND) return;\n  StyleLink* link = reinterpret_cast<StyleLink*>(uiFontStyles->GetClientData(selection));\n  assert(link);\n  if (link == NULL) return;\n\n  ride::Style style = link->get( edit.fonts_and_colors() );\n\n  DIALOG_DATA(style, use_foreground, uiStyleUseForeground,);\n  DIALOG_DATA(style, use_background, uiStyleUseBackground,);\n  DIALOG_DATAX(style, foreground, uiStyleForeground);\n  DIALOG_DATAX(style, background, uiStyleBackground);\n\n  if (togui == false) {\n    ride::FontsAndColors color = edit.fonts_and_colors();\n    link->set(color, style);\n\n    edit.set_allocated_fonts_and_colors(Allocate(color));\n  }\n}\n\nvoid SettingsDlg::updateFontDisplay() {\n  int selectedId = uiStyleTypeface->GetSelection();\n  wxString faceName = selectedId > 0 ? uiStyleTypeface->GetString(selectedId) : \"\";\n  wxFont font( wxFontInfo(12).FaceName(faceName) );\n  uiStyleExample->SetFont(font);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSettingsDlg::SettingsDlg(wxWindow* parent, MainWindow* mainwindow) :\n::ui::Settings(parent, wxID_ANY), main(mainwindow), allowApply(false), allowStyleChange(false)\n{\n  global = main->getSettings();\n  edit = global;\n  editToGui(true);\n  allowApply = true;\n\n  for (auto link: StyleLinks()) {\n    uiFontStyles->Append(link->name(), link);\n  }\n  updateFonts();\n}\n\nvoid SettingsDlg::OnApply( wxCommandEvent& event )\n{\n  apply();\n}\n\nvoid SettingsDlg::OnCancel( wxCommandEvent& event )\n{\n  main->setSettings(global);\n  EndModal(wxCANCEL);\n}\n\nvoid SettingsDlg::OnOk( wxCommandEvent& event )\n{\n  editToGui(false);\n  main->setSettings(edit);\n  if (false == SaveSettings(edit)) {\n    wxMessageBox(\"Failed to save settings\", \"Failed!\", wxOK | wxICON_ERROR);\n  }\n  EndModal(wxOK);\n}\n\nvoid SettingsDlg::OnCheckboxChanged(wxCommandEvent& event)\n{\n  assert(this);\n  apply();\n}\n\nvoid SettingsDlg::OnComboboxChanged(wxCommandEvent& event)\n{\n  assert(this);\n  apply();\n}\n\nvoid SettingsDlg::OnColorChanged(wxColourPickerEvent& event)\n{\n  assert(this);\n  apply();\n}\n\nvoid SettingsDlg::OnEditChanged(wxCommandEvent& event)\n{\n  assert(this);\n  apply();\n}\n\nvoid SettingsDlg::apply()\n{\n  if (allowApply == false) { return; }\n  editToGui(false);\n  main->setSettings(edit);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid SettingsDlg::editToGui(bool togui) {\n  ride::FontsAndColors fonts_and_colors = edit.fonts_and_colors();\n  ride::FoldFlags foldflags = edit.foldflags();\n\n  DIALOG_DATA(edit, displayeolenable, uiDisplayEOL,);\n  DIALOG_DATA(edit, linenumberenable, uiShowLineNumbers,);\n  DIALOG_DATA(edit, indentguideenable, uiIndentGuide,);\n\n  DIALOG_DATA(edit, tabwidth, uiTabWidth, );\n  DIALOG_DATA(edit, edgecolumn, uiEdgeColumn, );\n\n  DIALOG_DATA(edit, whitespace, uiViewWhitespace, _VW);\n  DIALOG_DATA(edit, wordwrap, uiWordwrap, _WM);\n  DIALOG_DATA(edit, edgestyle, uiEdgeStyle, _ES);\n\n  DIALOG_DATA(edit, tabindents, uiTabIndents, );\n  DIALOG_DATA(edit, usetabs, uiUseTabs, );\n  DIALOG_DATA(edit, backspaceunindents, uiBackspaceUnindents, );\n\n  DIALOG_DATA(edit, foldenable, uiAllowFolding, );\n  \n  DIALOG_DATA(foldflags, levelnumbers, uiFoldLevelNumbers, );\n  DIALOG_DATA(foldflags, linebefore_expanded, uiFoldLineBeforeExpanded, );\n  DIALOG_DATA(foldflags, linebefore_contracted, uiFoldLineBeforeContracted, );\n  DIALOG_DATA(foldflags, lineafter_expanded, uiFoldLineAfterExpanded, );\n  DIALOG_DATA(foldflags, lineafter_contracted, uiFoldLineAfterContracted, );\n\n  DIALOG_DATAX(fonts_and_colors, edgecolor, uiEdgeColor);\n\n  if (togui == false) {\n    edit.set_allocated_fonts_and_colors(Allocate(fonts_and_colors));\n    edit.set_allocated_foldflags(Allocate(foldflags));\n  }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: ConnectionLineData.cxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 07:19: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_dbaccess.hxx\"\n#ifndef DBAUI_CONNECTIONLINEDATA_HXX\n#include \"ConnectionLineData.hxx\"\n#endif\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n\n\nusing namespace dbaui;\nDBG_NAME(OConnectionLineData)\n\/\/==================================================================\n\/\/class OConnectionLineData\n\/\/==================================================================\n\/\/------------------------------------------------------------------------\nOConnectionLineData::OConnectionLineData()\n{\n    DBG_CTOR(OConnectionLineData,NULL);\n}\n\n\/\/------------------------------------------------------------------------\nOConnectionLineData::OConnectionLineData( const ::rtl::OUString& rSourceFieldName, const ::rtl::OUString& rDestFieldName )\n    :m_aSourceFieldName( rSourceFieldName )\n    ,m_aDestFieldName( rDestFieldName )\n{\n    DBG_CTOR(OConnectionLineData,NULL);\n}\n\n\/\/------------------------------------------------------------------------\nOConnectionLineData::OConnectionLineData( const OConnectionLineData& rConnLineData )\n    : ::vos::OReference()\n{\n    DBG_CTOR(OConnectionLineData,NULL);\n    *this = rConnLineData;\n}\n\n\/\/------------------------------------------------------------------------\nOConnectionLineData::~OConnectionLineData()\n{\n    DBG_DTOR(OConnectionLineData,NULL);\n}\n\n\/\/------------------------------------------------------------------------\nvoid OConnectionLineData::CopyFrom(const OConnectionLineData& rSource)\n{\n    *this = rSource;\n    \/\/ hier ziehe ich mich auf das (nicht-virtuelle) operator= zurueck, das nur meine Members kopiert\n}\n\n\/\/------------------------------------------------------------------------\nbool OConnectionLineData::IsValid() const\n{\n    return (GetSourceFieldName().getLength() && GetDestFieldName().getLength());\n}\n\n\/\/------------------------------------------------------------------------\nOConnectionLineData& OConnectionLineData::operator=( const OConnectionLineData& rConnLineData )\n{\n    if (&rConnLineData == this)\n        return *this;\n\n    m_aSourceFieldName = rConnLineData.GetSourceFieldName();\n    m_aDestFieldName = rConnLineData.GetDestFieldName();\n\n    return *this;\n}\n\n\/\/------------------------------------------------------------------------\nbool OConnectionLineData::Reset()\n{\n    m_aDestFieldName = m_aSourceFieldName = ::rtl::OUString();\n    return true;\n}\n\/\/ -----------------------------------------------------------------------------\n\n\n<commit_msg>INTEGRATION: CWS dba24a (1.7.120); FILE MERGED 2007\/09\/25 11:24:07 oj 1.7.120.1: #i81922# new method to compare relation data<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: ConnectionLineData.cxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: hr $ $Date: 2007-09-26 14:52: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_dbaccess.hxx\"\n#ifndef DBAUI_CONNECTIONLINEDATA_HXX\n#include \"ConnectionLineData.hxx\"\n#endif\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n\n\nusing namespace dbaui;\nDBG_NAME(OConnectionLineData)\n\/\/==================================================================\n\/\/class OConnectionLineData\n\/\/==================================================================\n\/\/------------------------------------------------------------------------\nOConnectionLineData::OConnectionLineData()\n{\n    DBG_CTOR(OConnectionLineData,NULL);\n}\n\n\/\/------------------------------------------------------------------------\nOConnectionLineData::OConnectionLineData( const ::rtl::OUString& rSourceFieldName, const ::rtl::OUString& rDestFieldName )\n    :m_aSourceFieldName( rSourceFieldName )\n    ,m_aDestFieldName( rDestFieldName )\n{\n    DBG_CTOR(OConnectionLineData,NULL);\n}\n\n\/\/------------------------------------------------------------------------\nOConnectionLineData::OConnectionLineData( const OConnectionLineData& rConnLineData )\n    : ::vos::OReference()\n{\n    DBG_CTOR(OConnectionLineData,NULL);\n    *this = rConnLineData;\n}\n\n\/\/------------------------------------------------------------------------\nOConnectionLineData::~OConnectionLineData()\n{\n    DBG_DTOR(OConnectionLineData,NULL);\n}\n\n\/\/------------------------------------------------------------------------\nvoid OConnectionLineData::CopyFrom(const OConnectionLineData& rSource)\n{\n    *this = rSource;\n    \/\/ hier ziehe ich mich auf das (nicht-virtuelle) operator= zurueck, das nur meine Members kopiert\n}\n\n\/\/------------------------------------------------------------------------\nbool OConnectionLineData::IsValid() const\n{\n    return (GetSourceFieldName().getLength() && GetDestFieldName().getLength());\n}\n\n\/\/------------------------------------------------------------------------\nOConnectionLineData& OConnectionLineData::operator=( const OConnectionLineData& rConnLineData )\n{\n    if (&rConnLineData == this)\n        return *this;\n\n    m_aSourceFieldName = rConnLineData.GetSourceFieldName();\n    m_aDestFieldName = rConnLineData.GetDestFieldName();\n\n    return *this;\n}\n\n\/\/------------------------------------------------------------------------\nbool OConnectionLineData::Reset()\n{\n    m_aDestFieldName = m_aSourceFieldName = ::rtl::OUString();\n    return true;\n}\n\/\/ -----------------------------------------------------------------------------\nnamespace dbaui\n{\n\/\/-------------------------------------------------------------------------\nbool operator==(const OConnectionLineData& lhs, const OConnectionLineData& rhs)\n{\n    return (lhs.m_aSourceFieldName == rhs.m_aSourceFieldName)\n        && (lhs.m_aDestFieldName == rhs.m_aDestFieldName);\n}\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/* \n * Welch Window Function Unit 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 \"TTWelchWindow.h\"\n\n#define thisTTClass\t\t\tWelchWindow\n#define thisTTClassName\t\t\"welch\"\n#define thisTTClassTags\t\t\"audio, processor, function, window\"\n\n\nTT_AUDIO_CONSTRUCTOR\n{\n\tsetProcessMethod(processAudio);\n\tsetCalculateMethod(calculateValue);\n}\n\n\nWelchWindow::~WelchWindow()\n{\n\t;\n}\n\n\n\/\/ welch(i) = 1.0 - ((i-n\/2)\/(n\/2)) * ((i-n\/2)\/(n\/2))\nTTErr WelchWindow::calculateValue(const TTFloat64& x, TTFloat64& y, TTPtrSizedInt data)\n{\n\tTTFloat64\tw;\n\t\n\t\/\/w = ((x-1.0\/2.0)\/(1.0\/2.0)); \n\tw = (x-0.5)\/0.5; \n\ty = 1.0 - (w * w);\n\treturn kTTErrNone;\n}\n\n\nTTErr WelchWindow::processAudio(TTAudioSignalArrayPtr inputs, TTAudioSignalArrayPtr outputs)\n{\n\tTT_WRAP_CALCULATE_METHOD(calculateValue);\n}\n\n<commit_msg>optimized code for Welch window function<commit_after>\/* \n * Welch Window Function Unit 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 \"TTWelchWindow.h\"\n\n#define thisTTClass\t\t\tWelchWindow\n#define thisTTClassName\t\t\"welch\"\n#define thisTTClassTags\t\t\"audio, processor, function, window\"\n\n\nTT_AUDIO_CONSTRUCTOR\n{\n\tsetProcessMethod(processAudio);\n\tsetCalculateMethod(calculateValue);\n}\n\n\nWelchWindow::~WelchWindow()\n{\n\t;\n}\n\n\n\/\/ welch(i) = 1.0 - ((i-n\/2)\/(n\/2)) * ((i-n\/2)\/(n\/2))\nTTErr WelchWindow::calculateValue(const TTFloat64& x, TTFloat64& y, TTPtrSizedInt data)\n{\n\t\/\/w = ((x-1.0\/2.0)\/(1.0\/2.0)); \n\t\n\t\/\/TTFloat64\tw;\n\t\/\/w = (x-0.5)\/0.5; \t\n\t\/\/y = 1.0 - (w * w);\n\t\/\/ [NP]: since we assume that n=1, we can simplified to:\n\ty = 4.0 * (-x*x + x);\n\treturn kTTErrNone;\n}\n\n\nTTErr WelchWindow::processAudio(TTAudioSignalArrayPtr inputs, TTAudioSignalArrayPtr outputs)\n{\n\tTT_WRAP_CALCULATE_METHOD(calculateValue);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (C) 2012-2015 Leap Motion, Inc. All rights reserved.\n#include \"stdafx.h\"\n#include \"FilterStreamBase.h\"\n#include <algorithm>\n#include <memory.h>\n#include <zlib\/zlib.h>\n\nusing namespace leap;\n\nInputFilterStreamBase::InputFilterStreamBase(IInputStream& is) :\n  is(is),\n  buffer(1024, 0),\n  inputChunk(1024, 0)\n{}\n\nbool InputFilterStreamBase::IsEof(void) const {\n  return is.IsEof() && buffer.empty();\n}\n\nstd::streamsize InputFilterStreamBase::Read(void* pBuf, std::streamsize ncb) {\n  if (fail)\n    throw std::runtime_error(\"Cannot read, stream corrupt\");\n\n  std::streamsize total = 0;\n  while (ncb)\n    \/\/ If there are any data bytes available in holding, prefer to return those:\n    if (ncbAvail) {\n      \/\/ Decide on how many bytes to move, then move those over\n      size_t ncbCopy = std::min(ncbAvail, static_cast<size_t>(ncb));\n      memcpy(pBuf, &*(buffer.end() - ncbAvail), ncbCopy);\n      total += ncbCopy;\n\n      \/\/ Reduce by the number of bytes we moved\n      reinterpret_cast<uint8_t*&>(pBuf) += ncbCopy;\n      ncbAvail -= ncbCopy;\n      ncb -= ncbCopy;\n    } else {\n      \/\/ Pump in from the underlying stream\n      auto nRead = is.Read(inputChunk.data() + inChunkRemain, inputChunk.size() - inChunkRemain) + inChunkRemain;\n      if (nRead < 0) {\n        fail = true;\n        throw std::runtime_error(\"Unexpected end of file reached\");\n      }\n      if (nRead == 0)\n        \/\/ Maybe EOF, short-circuit\n        return total;\n\n      \/\/ Handoff to transform behavior:\n      size_t ncbIn = static_cast<size_t>(nRead);\n      ncbAvail = buffer.size();\n      if(!Transform(inputChunk.data(), ncbIn, buffer.data(), ncbAvail))\n        return -1;\n\n      \/\/ Shift over what we didn't consume under decompression\n      buffer.resize(ncbAvail);\n      inChunkRemain = nRead - ncbIn;\n      memmove(inputChunk.data(), inputChunk.data() + nRead - inChunkRemain, inChunkRemain);\n    }\n\n  return total;\n}\n\nstd::streamsize InputFilterStreamBase::Skip(std::streamsize ncb) {\n  return 0;\n}\n\nOutputFilterStreamBase::OutputFilterStreamBase(IOutputStream& os) :\n  os(os),\n  buffer(1024, 0)\n{\n}\n\nOutputFilterStreamBase::~OutputFilterStreamBase(void) {}\n\nbool OutputFilterStreamBase::Write(const void* pBuf, std::streamsize ncb, bool flush) {\n  if (fail)\n    throw std::runtime_error(\"Cannot write if compression stream is in a failed state\");\n\n  \/\/ Trivial return check:\n  if (!ncb && !flush)\n    return true;\n\n  do {\n    size_t ncbOut = buffer.size();\n    size_t ncbIn = static_cast<size_t>(ncb);\n    fail = !Transform(pBuf, ncbIn, buffer.data(), ncbOut, flush);\n    if(fail)\n      return false;\n\n    ncb -= ncbIn;\n    reinterpret_cast<const uint8_t*&>(pBuf) += ncbIn;\n    fail = !os.Write(buffer.data(), static_cast<std::streamsize>(ncbOut));\n    if (fail)\n      return false;\n  } while(ncb);\n  return true;\n}\n\nbool OutputFilterStreamBase::Write(const void* pBuf, std::streamsize ncb) {\n  return Write(pBuf, ncb, false);\n}\n\nvoid OutputFilterStreamBase::Flush(void) {\n  Write(nullptr, 0, true);\n}\n<commit_msg>Fix initializer ordering<commit_after>\/\/ Copyright (C) 2012-2015 Leap Motion, Inc. All rights reserved.\n#include \"stdafx.h\"\n#include \"FilterStreamBase.h\"\n#include <algorithm>\n#include <memory.h>\n#include <zlib\/zlib.h>\n\nusing namespace leap;\n\nInputFilterStreamBase::InputFilterStreamBase(IInputStream& is) :\n  is(is),\n  inputChunk(1024, 0),\n  buffer(1024, 0)\n{}\n\nbool InputFilterStreamBase::IsEof(void) const {\n  return is.IsEof() && buffer.empty();\n}\n\nstd::streamsize InputFilterStreamBase::Read(void* pBuf, std::streamsize ncb) {\n  if (fail)\n    throw std::runtime_error(\"Cannot read, stream corrupt\");\n\n  std::streamsize total = 0;\n  while (ncb)\n    \/\/ If there are any data bytes available in holding, prefer to return those:\n    if (ncbAvail) {\n      \/\/ Decide on how many bytes to move, then move those over\n      size_t ncbCopy = std::min(ncbAvail, static_cast<size_t>(ncb));\n      memcpy(pBuf, &*(buffer.end() - ncbAvail), ncbCopy);\n      total += ncbCopy;\n\n      \/\/ Reduce by the number of bytes we moved\n      reinterpret_cast<uint8_t*&>(pBuf) += ncbCopy;\n      ncbAvail -= ncbCopy;\n      ncb -= ncbCopy;\n    } else {\n      \/\/ Pump in from the underlying stream\n      auto nRead = is.Read(inputChunk.data() + inChunkRemain, inputChunk.size() - inChunkRemain) + inChunkRemain;\n      if (nRead < 0) {\n        fail = true;\n        throw std::runtime_error(\"Unexpected end of file reached\");\n      }\n      if (nRead == 0)\n        \/\/ Maybe EOF, short-circuit\n        return total;\n\n      \/\/ Handoff to transform behavior:\n      size_t ncbIn = static_cast<size_t>(nRead);\n      ncbAvail = buffer.size();\n      if(!Transform(inputChunk.data(), ncbIn, buffer.data(), ncbAvail))\n        return -1;\n\n      \/\/ Shift over what we didn't consume under decompression\n      buffer.resize(ncbAvail);\n      inChunkRemain = nRead - ncbIn;\n      memmove(inputChunk.data(), inputChunk.data() + nRead - inChunkRemain, inChunkRemain);\n    }\n\n  return total;\n}\n\nstd::streamsize InputFilterStreamBase::Skip(std::streamsize ncb) {\n  return 0;\n}\n\nOutputFilterStreamBase::OutputFilterStreamBase(IOutputStream& os) :\n  os(os),\n  buffer(1024, 0)\n{\n}\n\nOutputFilterStreamBase::~OutputFilterStreamBase(void) {}\n\nbool OutputFilterStreamBase::Write(const void* pBuf, std::streamsize ncb, bool flush) {\n  if (fail)\n    throw std::runtime_error(\"Cannot write if compression stream is in a failed state\");\n\n  \/\/ Trivial return check:\n  if (!ncb && !flush)\n    return true;\n\n  do {\n    size_t ncbOut = buffer.size();\n    size_t ncbIn = static_cast<size_t>(ncb);\n    fail = !Transform(pBuf, ncbIn, buffer.data(), ncbOut, flush);\n    if(fail)\n      return false;\n\n    ncb -= ncbIn;\n    reinterpret_cast<const uint8_t*&>(pBuf) += ncbIn;\n    fail = !os.Write(buffer.data(), static_cast<std::streamsize>(ncbOut));\n    if (fail)\n      return false;\n  } while(ncb);\n  return true;\n}\n\nbool OutputFilterStreamBase::Write(const void* pBuf, std::streamsize ncb) {\n  return Write(pBuf, ncb, false);\n}\n\nvoid OutputFilterStreamBase::Flush(void) {\n  Write(nullptr, 0, true);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <sys\/time.h>\n#include <sys\/resource.h>\n#include <err.h>\n#include <errno.h>\n#include <fcntl.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <set>\n\n\n#include <CodeSource.h>\n#include <CodeObject.h>\n#include <CFGFactory.h>\n\n\n#include <lib\/binutils\/VMAInterval.hpp>\n\n\n#include \"CudaCFGFactory.hpp\"\n#include \"CudaFunction.hpp\"\n#include \"CudaBlock.hpp\"\n#include \"CudaCodeSource.hpp\"\n#include \"CFGParser.hpp\"\n#include \"GraphReader.hpp\"\n#include \"ReadCubinCFG.hpp\"\n\nusing namespace Dyninst;\nusing namespace ParseAPI;\nusing namespace SymtabAPI;\nusing namespace InstructionAPI;\n\n#define DEBUG_CFG_PARSE  0\n\n\nstatic bool\ntest_nvdisasm() \n{\n  \/\/ check whether nvdisasm works\n  int retval = system(\"nvdisasm > \/dev\/null\") == 0;\n  if (!retval) {\n    std::cout << \"WARNING: nvdisasm is not available on your path to analyze control flow in NVIDIA CUBINs\" << std::endl;\n  }\n  return retval;\n}\n\n\nstatic bool\ndumpCubin\n(\n const std::string &cubin, \n ElfFile *elfFile \n) \n{\n  int retval = false;\n  int fd = open(cubin.c_str(), O_CREAT|O_WRONLY|O_TRUNC, S_IRWXU);\n  if (fd != -1) {\n    int len = elfFile->getLength();\n    retval = write(fd, elfFile->getMemoryOriginal(), len) == len; \n    close(fd);\n  }\n  return retval;\n}\n\n\n\/\/ Iterate all the functions in the symbol table.\n\/\/ Parse the ones that can be dumped by nvdisasm in sequence;\n\/\/ construct a dummy block for others\nstatic void\nparseDotCFG\n(\n const std::string &dot_filename, \n const std::string &cubin,\n int cuda_arch,\n Dyninst::SymtabAPI::Symtab *the_symtab,\n std::vector<CudaParse::Function *> &functions\n) \n{\n  CudaParse::CFGParser cfg_parser;\n  \/\/ Step 1: parse all function symbols\n  std::vector<Symbol *> symbols;\n  the_symtab->getAllSymbols(symbols);\n\n  if (DEBUG_CFG_PARSE) {\n    std::cout << \"Debug symbols: \" << std::endl;\n    for (auto *symbol : symbols) {\n      if (symbol->getType() == Dyninst::SymtabAPI::Symbol::ST_FUNCTION) {\n        std::cout << \"Function: \" << symbol->getMangledName() << \" offset: \" <<\n          symbol->getOffset() << \" size: \" << symbol->getSize() << std::endl;\n      }\n    }\n  }\n\n  \/\/ Store functions that are not parsed by nvdisasm\n  std::vector<Symbol *> unparsable_function_symbols;\n  \/\/ Remove functions that share the same names\n  std::map<std::string, CudaParse::Function *> function_map;\n  \/\/ Test valid symbols\n  for (auto *symbol : symbols) {\n    if (symbol->getType() == Dyninst::SymtabAPI::Symbol::ST_FUNCTION) {\n      auto index = symbol->getIndex();\n      const std::string cmd = \"nvdisasm -fun \" +\n        std::to_string(index) + \" -cfg -poff \" + cubin + \" > \" + dot_filename;\n      if (system(cmd.c_str()) == 0) {\n        \/\/ Only parse valid symbols\n        CudaParse::GraphReader graph_reader(dot_filename);\n        CudaParse::Graph graph;\n        std::vector<CudaParse::Function *> funcs;\n        graph_reader.read(graph);\n        cfg_parser.parse(graph, funcs);\n        \/\/ Local functions inside a global function cannot be independently parsed\n        for (auto *func : funcs) {\n          if (function_map.find(func->name) == function_map.end()) {\n            function_map[func->name] = func;\n          }\n        }\n      } else {\n        unparsable_function_symbols.push_back(symbol);\n        std::cout << \"WARNING: unable to parse function: \" << symbol->getMangledName() << std::endl;\n      }\n    }\n  }\n\n  for (auto &iter : function_map) {\n    functions.push_back(iter.second);\n  }\n\n  \/\/ Step 2: Relocate functions\n  for (auto *symbol : symbols) {\n    for (auto *function : functions) {\n      if (function->name == symbol->getMangledName() &&\n        symbol->getType() == Dyninst::SymtabAPI::Symbol::ST_FUNCTION) {\n        auto begin_offset = function->blocks[0]->begin_offset;\n        for (auto *block : function->blocks) {\n          for (auto *inst : block->insts) {\n            inst->offset = (inst->offset - begin_offset) + symbol->getOffset();\n          }\n          block->address = block->insts[0]->offset;\n        }\n        \/\/ Allow gaps between a function begining and the first block?\n        \/\/function->blocks[0]->address = symbol->getOffset();\n        function->address = symbol->getOffset();\n      }\n    }\n  }\n\n  if (DEBUG_CFG_PARSE) {\n    std::cout << \"Debug functions before adding unparsable\" << std::endl;\n    for (auto *function : functions) {\n      std::cout << \"Function: \" << function->name << std::endl;\n      for (auto *block : function->blocks) {\n        std::cout << \"Block: \" << block->name << \" address: 0x\" << std::hex << block->address << std::dec << std::endl;;\n      }\n      std::cout << std::endl;\n    }\n  }\n\n  \/\/ Step 3: add unparsable functions\n  \/\/ Rename function and block ids\n  size_t max_block_id = 0;\n  size_t max_function_id = 0;\n  for (auto *function : functions) {\n    function->id = max_function_id++;\n    for (auto *block : function->blocks) {\n      block->id = max_block_id++;\n    }\n  }\n\n  \/\/ For functions that cannot be parsed\n  for (auto *symbol : unparsable_function_symbols) {\n    auto function_name = symbol->getMangledName();\n    auto *function = new CudaParse::Function(max_function_id++, std::move(function_name));\n    function->address = symbol->getOffset();\n    auto block_name = symbol->getMangledName() + \"_0\";\n    auto *block = new CudaParse::Block(max_block_id++, std::move(block_name));\n    block->begin_offset = cuda_arch >= 70 ? 0 : 8;\n    block->address = symbol->getOffset() + block->begin_offset;\n    int len = cuda_arch >= 70 ? 16 : 8;\n    \/\/ Add dummy insts\n    for (size_t i = block->address; i < block->address + symbol->getSize(); i += len) {\n      block->insts.push_back(new CudaParse::Inst(i));\n    }\n    function->blocks.push_back(block);\n    functions.push_back(function);\n  }\n\n  \/\/ Step4: add compensate blocks that only contains nop instructions\n  for (auto *symbol : symbols) {\n    for (auto *function : functions) {\n      if (function->name == symbol->getMangledName() && symbol->getSize() > 0 &&\n        symbol->getType() == Dyninst::SymtabAPI::Symbol::ST_FUNCTION) {\n        int len = cuda_arch >= 70 ? 16 : 8;\n        int function_size = function->blocks.back()->insts.back()->offset + len - function->address;\n        int symbol_size = symbol->getSize();\n        if (function_size < symbol_size) {\n          if (DEBUG_CFG_PARSE) {\n            std::cout << function->name << \" append nop instructions\" << std::endl;\n            std::cout << \"function_size: \" << function_size << \" < \" << \"symbol_size: \" << symbol_size << std::endl;\n          }\n          auto *block = new CudaParse::Block(max_block_id, \".L_\" + std::to_string(max_block_id));\n          block->address = function_size + function->address;\n          block->begin_offset = cuda_arch >= 70 ? 16 : 8;\n          max_block_id++;\n          while (function_size < symbol_size) {\n            block->insts.push_back(new CudaParse::Inst(function_size + function->address));\n            function_size += len;\n          } \n          if (function->blocks.size() > 0) {\n            auto *last_block = function->blocks.back();\n            last_block->targets.push_back(\n              new CudaParse::Target(last_block->insts.back(), block, CudaParse::TargetType::DIRECT));\n          }\n          function->blocks.push_back(block);\n        }\n      }\n    }\n  }\n\n  \/\/ Parse function calls\n  cfg_parser.parse_calls(functions);\n\n  \/\/ Debug final functions and blocks\n  if (DEBUG_CFG_PARSE) {\n    std::cout << \"Debug functions after adding unparsable\" << std::endl;\n    for (auto *function : functions) {\n      std::cout << \"Function: \" << function->name << std::endl;\n      for (auto *block : function->blocks) {\n        std::cout << \"Block: \" << block->name << \" address: 0x\" << std::hex << block->address << std::dec << std::endl;;\n      }\n      std::cout << std::endl;\n    }\n  }\n}\n\n\nbool\nreadCubinCFG\n(\n ElfFile *elfFile,\n Dyninst::SymtabAPI::Symtab *the_symtab, \n Dyninst::ParseAPI::CodeSource **code_src, \n Dyninst::ParseAPI::CodeObject **code_obj\n) \n{\n  static bool nvdisasm_usable = test_nvdisasm();\n  bool dump_cubin_success = false;\n\n  if (nvdisasm_usable) {\n    std::string filename = \"tmp\";\n    std::string cubin = filename;\n    std::string dot = filename + \".dot\";\n\n    dump_cubin_success = dumpCubin(cubin, elfFile);\n    if (!dump_cubin_success) {\n      std::cout << \"WARNING: unable to write a cubin to the file system to analyze its CFG\" << std::endl; \n    } else {\n      std::vector<CudaParse::Function *> functions;\n      parseDotCFG(dot, cubin, elfFile->getArch(), the_symtab, functions);\n      CFGFactory *cfg_fact = new CudaCFGFactory(functions);\n      *code_src = new CudaCodeSource(functions, the_symtab); \n      *code_obj = new CodeObject(*code_src, cfg_fact);\n      (*code_obj)->parse();\n      return true;\n    }\n  }\n\n  *code_src = new SymtabCodeSource(the_symtab);\n  *code_obj = new CodeObject(*code_src);\n\n  return false;\n}\n<commit_msg>prepare for process-level parallel analysis of cubins<commit_after>#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <sys\/time.h>\n#include <sys\/resource.h>\n#include <err.h>\n#include <errno.h>\n#include <fcntl.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n\n#include <set>\n#include <sstream>\n\n\n#include <CodeSource.h>\n#include <CodeObject.h>\n#include <CFGFactory.h>\n\n\n#include <lib\/binutils\/VMAInterval.hpp>\n\n\n#include \"CudaCFGFactory.hpp\"\n#include \"CudaFunction.hpp\"\n#include \"CudaBlock.hpp\"\n#include \"CudaCodeSource.hpp\"\n#include \"CFGParser.hpp\"\n#include \"GraphReader.hpp\"\n#include \"ReadCubinCFG.hpp\"\n\nusing namespace Dyninst;\nusing namespace ParseAPI;\nusing namespace SymtabAPI;\nusing namespace InstructionAPI;\n\n#define DEBUG_CFG_PARSE  0\n\n\nstatic bool\ntest_nvdisasm() \n{\n  \/\/ check whether nvdisasm works\n  int retval = system(\"nvdisasm > \/dev\/null\") == 0;\n  if (!retval) {\n    std::cout << \"WARNING: nvdisasm is not available on your path to analyze control flow in NVIDIA CUBINs\" << std::endl;\n  }\n  return retval;\n}\n\n\nstatic bool\ndumpCubin\n(\n const std::string &cubin, \n ElfFile *elfFile \n) \n{\n  int retval = false;\n  int fd = open(cubin.c_str(), O_CREAT|O_WRONLY|O_TRUNC, S_IRWXU);\n  if (fd != -1) {\n    int len = elfFile->getLength();\n    retval = write(fd, elfFile->getMemoryOriginal(), len) == len; \n    close(fd);\n  }\n  return retval;\n}\n\n\n\/\/ Iterate all the functions in the symbol table.\n\/\/ Parse the ones that can be dumped by nvdisasm in sequence;\n\/\/ construct a dummy block for others\nstatic void\nparseDotCFG\n(\n const std::string &dot_filename, \n const std::string &cubin,\n int cuda_arch,\n Dyninst::SymtabAPI::Symtab *the_symtab,\n std::vector<CudaParse::Function *> &functions\n) \n{\n  CudaParse::CFGParser cfg_parser;\n  \/\/ Step 1: parse all function symbols\n  std::vector<Symbol *> symbols;\n  the_symtab->getAllSymbols(symbols);\n\n  if (DEBUG_CFG_PARSE) {\n    std::cout << \"Debug symbols: \" << std::endl;\n    for (auto *symbol : symbols) {\n      if (symbol->getType() == Dyninst::SymtabAPI::Symbol::ST_FUNCTION) {\n        std::cout << \"Function: \" << symbol->getMangledName() << \" offset: \" <<\n          symbol->getOffset() << \" size: \" << symbol->getSize() << std::endl;\n      }\n    }\n  }\n\n  \/\/ Store functions that are not parsed by nvdisasm\n  std::vector<Symbol *> unparsable_function_symbols;\n  \/\/ Remove functions that share the same names\n  std::map<std::string, CudaParse::Function *> function_map;\n  \/\/ Test valid symbols\n  for (auto *symbol : symbols) {\n    if (symbol->getType() == Dyninst::SymtabAPI::Symbol::ST_FUNCTION) {\n      auto index = symbol->getIndex();\n      const std::string cmd = \"nvdisasm -fun \" +\n        std::to_string(index) + \" -cfg -poff \" + cubin + \" > \" + dot_filename;\n      if (system(cmd.c_str()) == 0) {\n        \/\/ Only parse valid symbols\n        CudaParse::GraphReader graph_reader(dot_filename);\n        CudaParse::Graph graph;\n        std::vector<CudaParse::Function *> funcs;\n        graph_reader.read(graph);\n        cfg_parser.parse(graph, funcs);\n        \/\/ Local functions inside a global function cannot be independently parsed\n        for (auto *func : funcs) {\n          if (function_map.find(func->name) == function_map.end()) {\n            function_map[func->name] = func;\n          }\n        }\n      } else {\n        unparsable_function_symbols.push_back(symbol);\n        std::cout << \"WARNING: unable to parse function: \" << symbol->getMangledName() << std::endl;\n      }\n    }\n  }\n\n  for (auto &iter : function_map) {\n    functions.push_back(iter.second);\n  }\n\n  \/\/ Step 2: Relocate functions\n  for (auto *symbol : symbols) {\n    for (auto *function : functions) {\n      if (function->name == symbol->getMangledName() &&\n        symbol->getType() == Dyninst::SymtabAPI::Symbol::ST_FUNCTION) {\n        auto begin_offset = function->blocks[0]->begin_offset;\n        for (auto *block : function->blocks) {\n          for (auto *inst : block->insts) {\n            inst->offset = (inst->offset - begin_offset) + symbol->getOffset();\n          }\n          block->address = block->insts[0]->offset;\n        }\n        \/\/ Allow gaps between a function begining and the first block?\n        \/\/function->blocks[0]->address = symbol->getOffset();\n        function->address = symbol->getOffset();\n      }\n    }\n  }\n\n  if (DEBUG_CFG_PARSE) {\n    std::cout << \"Debug functions before adding unparsable\" << std::endl;\n    for (auto *function : functions) {\n      std::cout << \"Function: \" << function->name << std::endl;\n      for (auto *block : function->blocks) {\n        std::cout << \"Block: \" << block->name << \" address: 0x\" << std::hex << block->address << std::dec << std::endl;;\n      }\n      std::cout << std::endl;\n    }\n  }\n\n  \/\/ Step 3: add unparsable functions\n  \/\/ Rename function and block ids\n  size_t max_block_id = 0;\n  size_t max_function_id = 0;\n  for (auto *function : functions) {\n    function->id = max_function_id++;\n    for (auto *block : function->blocks) {\n      block->id = max_block_id++;\n    }\n  }\n\n  \/\/ For functions that cannot be parsed\n  for (auto *symbol : unparsable_function_symbols) {\n    auto function_name = symbol->getMangledName();\n    auto *function = new CudaParse::Function(max_function_id++, std::move(function_name));\n    function->address = symbol->getOffset();\n    auto block_name = symbol->getMangledName() + \"_0\";\n    auto *block = new CudaParse::Block(max_block_id++, std::move(block_name));\n    block->begin_offset = cuda_arch >= 70 ? 0 : 8;\n    block->address = symbol->getOffset() + block->begin_offset;\n    int len = cuda_arch >= 70 ? 16 : 8;\n    \/\/ Add dummy insts\n    for (size_t i = block->address; i < block->address + symbol->getSize(); i += len) {\n      block->insts.push_back(new CudaParse::Inst(i));\n    }\n    function->blocks.push_back(block);\n    functions.push_back(function);\n  }\n\n  \/\/ Step4: add compensate blocks that only contains nop instructions\n  for (auto *symbol : symbols) {\n    for (auto *function : functions) {\n      if (function->name == symbol->getMangledName() && symbol->getSize() > 0 &&\n        symbol->getType() == Dyninst::SymtabAPI::Symbol::ST_FUNCTION) {\n        int len = cuda_arch >= 70 ? 16 : 8;\n        int function_size = function->blocks.back()->insts.back()->offset + len - function->address;\n        int symbol_size = symbol->getSize();\n        if (function_size < symbol_size) {\n          if (DEBUG_CFG_PARSE) {\n            std::cout << function->name << \" append nop instructions\" << std::endl;\n            std::cout << \"function_size: \" << function_size << \" < \" << \"symbol_size: \" << symbol_size << std::endl;\n          }\n          auto *block = new CudaParse::Block(max_block_id, \".L_\" + std::to_string(max_block_id));\n          block->address = function_size + function->address;\n          block->begin_offset = cuda_arch >= 70 ? 16 : 8;\n          max_block_id++;\n          while (function_size < symbol_size) {\n            block->insts.push_back(new CudaParse::Inst(function_size + function->address));\n            function_size += len;\n          } \n          if (function->blocks.size() > 0) {\n            auto *last_block = function->blocks.back();\n            last_block->targets.push_back(\n              new CudaParse::Target(last_block->insts.back(), block, CudaParse::TargetType::DIRECT));\n          }\n          function->blocks.push_back(block);\n        }\n      }\n    }\n  }\n\n  \/\/ Parse function calls\n  cfg_parser.parse_calls(functions);\n\n  \/\/ Debug final functions and blocks\n  if (DEBUG_CFG_PARSE) {\n    std::cout << \"Debug functions after adding unparsable\" << std::endl;\n    for (auto *function : functions) {\n      std::cout << \"Function: \" << function->name << std::endl;\n      for (auto *block : function->blocks) {\n        std::cout << \"Block: \" << block->name << \" address: 0x\" << std::hex << block->address << std::dec << std::endl;;\n      }\n      std::cout << std::endl;\n    }\n  }\n}\n\n\nstd::string\ngetFilename\n(\n  void\n)\n{\n  pid_t self = getpid();\n  std::stringstream ss;\n  ss << self;\n  return ss.str();\n}\n\n\nbool\nreadCubinCFG\n(\n ElfFile *elfFile,\n Dyninst::SymtabAPI::Symtab *the_symtab, \n Dyninst::ParseAPI::CodeSource **code_src, \n Dyninst::ParseAPI::CodeObject **code_obj\n) \n{\n  static bool nvdisasm_usable = test_nvdisasm();\n  bool dump_cubin_success = false;\n\n  if (nvdisasm_usable) {\n    std::string filename = getFilename();\n    std::string cubin = filename;\n    std::string dot = filename + \".dot\";\n\n    dump_cubin_success = dumpCubin(cubin, elfFile);\n    if (!dump_cubin_success) {\n      std::cout << \"WARNING: unable to write a cubin to the file system to analyze its CFG\" << std::endl; \n    } else {\n      std::vector<CudaParse::Function *> functions;\n      parseDotCFG(dot, cubin, elfFile->getArch(), the_symtab, functions);\n      CFGFactory *cfg_fact = new CudaCFGFactory(functions);\n      *code_src = new CudaCodeSource(functions, the_symtab); \n      *code_obj = new CodeObject(*code_src, cfg_fact);\n      (*code_obj)->parse();\n      unlink(dot.c_str());\n      unlink(cubin.c_str());\n      return true;\n    }\n  }\n\n  *code_src = new SymtabCodeSource(the_symtab);\n  *code_obj = new CodeObject(*code_src);\n\n  return false;\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\/desktop_capture\/mouse_cursor_monitor.h\"\n\n#include <X11\/extensions\/Xfixes.h>\n#include <X11\/Xlib.h>\n#include <X11\/Xutil.h>\n\n#include \"webrtc\/modules\/desktop_capture\/desktop_capture_options.h\"\n#include \"webrtc\/modules\/desktop_capture\/desktop_frame.h\"\n#include \"webrtc\/modules\/desktop_capture\/mouse_cursor.h\"\n#include \"webrtc\/modules\/desktop_capture\/x11\/x_error_trap.h\"\n#include \"webrtc\/system_wrappers\/interface\/logging.h\"\n#include \"webrtc\/system_wrappers\/interface\/scoped_ptr.h\"\n\nnamespace {\n\n\/\/ WindowCapturer returns window IDs of X11 windows with WM_STATE attribute.\n\/\/ These windows may not be immediate children of the root window, because\n\/\/ window managers may re-parent them to add decorations. However,\n\/\/ XQueryPointer() expects to be passed children of the root. This function\n\/\/ searches up the list of the windows to find the root child that corresponds\n\/\/ to |window|.\nWindow GetTopLevelWindow(Display* display, Window window) {\n  while (true) {\n    \/\/ If the window is in WithdrawnState then look at all of its children.\n    ::Window root, parent;\n    ::Window *children;\n    unsigned int num_children;\n    if (!XQueryTree(display, window, &root, &parent, &children,\n                    &num_children)) {\n      LOG(LS_ERROR) << \"Failed to query for child windows although window\"\n                    << \"does not have a valid WM_STATE.\";\n      return None;\n    }\n    if (children)\n      XFree(children);\n\n    if (parent == root)\n      break;\n\n    window = parent;\n  }\n\n  return window;\n}\n\n}  \/\/ namespace\n\nnamespace webrtc {\n\nclass MouseCursorMonitorX11 : public MouseCursorMonitor,\n                              public SharedXDisplay::XEventHandler {\n public:\n  MouseCursorMonitorX11(const DesktopCaptureOptions& options, Window window);\n  virtual ~MouseCursorMonitorX11();\n\n  virtual void Init(Callback* callback, Mode mode) OVERRIDE;\n  virtual void Capture() OVERRIDE;\n\n private:\n  \/\/ SharedXDisplay::XEventHandler interface.\n  virtual bool HandleXEvent(const XEvent& event) OVERRIDE;\n\n  Display* display() { return x_display_->display(); }\n\n  \/\/ Captures current cursor shape and stores it in |cursor_shape_|.\n  void CaptureCursor();\n\n  scoped_refptr<SharedXDisplay> x_display_;\n  Callback* callback_;\n  Mode mode_;\n  Window window_;\n\n  bool have_xfixes_;\n  int xfixes_event_base_;\n  int xfixes_error_base_;\n\n  scoped_ptr<MouseCursor> cursor_shape_;\n};\n\nMouseCursorMonitorX11::MouseCursorMonitorX11(\n    const DesktopCaptureOptions& options,\n    Window window)\n    : x_display_(options.x_display()),\n      callback_(NULL),\n      mode_(SHAPE_AND_POSITION),\n      window_(window),\n      have_xfixes_(false),\n      xfixes_event_base_(-1),\n      xfixes_error_base_(-1) {}\n\nMouseCursorMonitorX11::~MouseCursorMonitorX11() {\n  if (have_xfixes_) {\n    x_display_->RemoveEventHandler(xfixes_event_base_ + XFixesCursorNotify,\n                                   this);\n  }\n}\n\nvoid MouseCursorMonitorX11::Init(Callback* callback, Mode mode) {\n  \/\/ Init can be called only once per instance of MouseCursorMonitor.\n  assert(!callback_);\n  assert(callback);\n\n  callback_ = callback;\n  mode_ = mode;\n\n  have_xfixes_ =\n      XFixesQueryExtension(display(), &xfixes_event_base_, &xfixes_error_base_);\n\n  if (have_xfixes_) {\n    \/\/ Register for changes to the cursor shape.\n    XFixesSelectCursorInput(display(), window_, XFixesDisplayCursorNotifyMask);\n    x_display_->AddEventHandler(xfixes_event_base_ + XFixesCursorNotify, this);\n\n    CaptureCursor();\n  } else {\n    LOG(LS_INFO) << \"X server does not support XFixes.\";\n  }\n}\n\nvoid MouseCursorMonitorX11::Capture() {\n  assert(callback_);\n\n  \/\/ Process X11 events in case XFixes has sent cursor notification.\n  x_display_->ProcessPendingXEvents();\n\n  \/\/ cursor_shape_| is set only if we were notified of a cursor shape change.\n  if (cursor_shape_.get())\n    callback_->OnMouseCursor(cursor_shape_.release());\n\n  \/\/ Get cursor position if necessary.\n  if (mode_ == SHAPE_AND_POSITION) {\n    int root_x;\n    int root_y;\n    int win_x;\n    int win_y;\n    Window root_window;\n    Window child_window;\n    unsigned int mask;\n\n    XErrorTrap error_trap(display());\n    Bool result = XQueryPointer(display(), window_, &root_window, &child_window,\n                                &root_x, &root_y, &win_x, &win_y, &mask);\n    CursorState state;\n    if (!result || error_trap.GetLastErrorAndDisable() != 0) {\n      state = OUTSIDE;\n    } else {\n      \/\/ In screen mode (window_ == root_window) the mouse is always inside.\n      \/\/ XQueryPointer() sets |child_window| to None if the cursor is outside\n      \/\/ |window_|.\n      state =\n          (window_ == root_window || child_window != None) ? INSIDE : OUTSIDE;\n    }\n\n    callback_->OnMouseCursorPosition(state,\n                                     webrtc::DesktopVector(win_x, win_y));\n  }\n}\n\nbool MouseCursorMonitorX11::HandleXEvent(const XEvent& event) {\n  if (have_xfixes_ && event.type == xfixes_event_base_ + XFixesCursorNotify) {\n    const XFixesCursorNotifyEvent* cursor_event =\n        reinterpret_cast<const XFixesCursorNotifyEvent*>(&event);\n    if (cursor_event->subtype == XFixesDisplayCursorNotify) {\n      CaptureCursor();\n    }\n    \/\/ Return false, even if the event has been handled, because there might be\n    \/\/ other listeners for cursor notifications.\n  }\n  return false;\n}\n\nvoid MouseCursorMonitorX11::CaptureCursor() {\n  assert(have_xfixes_);\n\n  XFixesCursorImage* img = XFixesGetCursorImage(display());\n  if (!img)\n     return;\n\n  scoped_ptr<DesktopFrame> image(\n      new BasicDesktopFrame(DesktopSize(img->width, img->height)));\n\n  \/\/ Xlib stores 32-bit data in longs, even if longs are 64-bits long.\n  unsigned long* src = img->pixels;\n  uint32_t* dst = reinterpret_cast<uint32_t*>(image->data());\n  uint32_t* dst_end = dst + (img->width * img->height);\n  while (dst < dst_end) {\n    *dst++ = static_cast<uint32_t>(*src++);\n  }\n\n  DesktopVector hotspot(std::min(img->width, img->xhot),\n                        std::min(img->height, img->yhot));\n\n  XFree(img);\n\n  cursor_shape_.reset(new MouseCursor(image.release(), hotspot));\n}\n\n\/\/ static\nMouseCursorMonitor* MouseCursorMonitor::CreateForWindow(\n    const DesktopCaptureOptions& options, WindowId window) {\n  if (!options.x_display())\n    return NULL;\n  window = GetTopLevelWindow(options.x_display()->display(), window);\n  if (window == None)\n    return NULL;\n  return new MouseCursorMonitorX11(options, window);\n}\n\nMouseCursorMonitor* MouseCursorMonitor::CreateForScreen(\n    const DesktopCaptureOptions& options,\n    ScreenId screen) {\n  if (!options.x_display())\n    return NULL;\n  return new MouseCursorMonitorX11(\n      options, DefaultRootWindow(options.x_display()->display()));\n}\n\n}  \/\/ namespace webrtc\n<commit_msg>Add error trap for XFixesGetCursorImage()<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\/mouse_cursor_monitor.h\"\n\n#include <X11\/extensions\/Xfixes.h>\n#include <X11\/Xlib.h>\n#include <X11\/Xutil.h>\n\n#include \"webrtc\/modules\/desktop_capture\/desktop_capture_options.h\"\n#include \"webrtc\/modules\/desktop_capture\/desktop_frame.h\"\n#include \"webrtc\/modules\/desktop_capture\/mouse_cursor.h\"\n#include \"webrtc\/modules\/desktop_capture\/x11\/x_error_trap.h\"\n#include \"webrtc\/system_wrappers\/interface\/logging.h\"\n#include \"webrtc\/system_wrappers\/interface\/scoped_ptr.h\"\n\nnamespace {\n\n\/\/ WindowCapturer returns window IDs of X11 windows with WM_STATE attribute.\n\/\/ These windows may not be immediate children of the root window, because\n\/\/ window managers may re-parent them to add decorations. However,\n\/\/ XQueryPointer() expects to be passed children of the root. This function\n\/\/ searches up the list of the windows to find the root child that corresponds\n\/\/ to |window|.\nWindow GetTopLevelWindow(Display* display, Window window) {\n  while (true) {\n    \/\/ If the window is in WithdrawnState then look at all of its children.\n    ::Window root, parent;\n    ::Window *children;\n    unsigned int num_children;\n    if (!XQueryTree(display, window, &root, &parent, &children,\n                    &num_children)) {\n      LOG(LS_ERROR) << \"Failed to query for child windows although window\"\n                    << \"does not have a valid WM_STATE.\";\n      return None;\n    }\n    if (children)\n      XFree(children);\n\n    if (parent == root)\n      break;\n\n    window = parent;\n  }\n\n  return window;\n}\n\n}  \/\/ namespace\n\nnamespace webrtc {\n\nclass MouseCursorMonitorX11 : public MouseCursorMonitor,\n                              public SharedXDisplay::XEventHandler {\n public:\n  MouseCursorMonitorX11(const DesktopCaptureOptions& options, Window window);\n  virtual ~MouseCursorMonitorX11();\n\n  virtual void Init(Callback* callback, Mode mode) OVERRIDE;\n  virtual void Capture() OVERRIDE;\n\n private:\n  \/\/ SharedXDisplay::XEventHandler interface.\n  virtual bool HandleXEvent(const XEvent& event) OVERRIDE;\n\n  Display* display() { return x_display_->display(); }\n\n  \/\/ Captures current cursor shape and stores it in |cursor_shape_|.\n  void CaptureCursor();\n\n  scoped_refptr<SharedXDisplay> x_display_;\n  Callback* callback_;\n  Mode mode_;\n  Window window_;\n\n  bool have_xfixes_;\n  int xfixes_event_base_;\n  int xfixes_error_base_;\n\n  scoped_ptr<MouseCursor> cursor_shape_;\n};\n\nMouseCursorMonitorX11::MouseCursorMonitorX11(\n    const DesktopCaptureOptions& options,\n    Window window)\n    : x_display_(options.x_display()),\n      callback_(NULL),\n      mode_(SHAPE_AND_POSITION),\n      window_(window),\n      have_xfixes_(false),\n      xfixes_event_base_(-1),\n      xfixes_error_base_(-1) {}\n\nMouseCursorMonitorX11::~MouseCursorMonitorX11() {\n  if (have_xfixes_) {\n    x_display_->RemoveEventHandler(xfixes_event_base_ + XFixesCursorNotify,\n                                   this);\n  }\n}\n\nvoid MouseCursorMonitorX11::Init(Callback* callback, Mode mode) {\n  \/\/ Init can be called only once per instance of MouseCursorMonitor.\n  assert(!callback_);\n  assert(callback);\n\n  callback_ = callback;\n  mode_ = mode;\n\n  have_xfixes_ =\n      XFixesQueryExtension(display(), &xfixes_event_base_, &xfixes_error_base_);\n\n  if (have_xfixes_) {\n    \/\/ Register for changes to the cursor shape.\n    XFixesSelectCursorInput(display(), window_, XFixesDisplayCursorNotifyMask);\n    x_display_->AddEventHandler(xfixes_event_base_ + XFixesCursorNotify, this);\n\n    CaptureCursor();\n  } else {\n    LOG(LS_INFO) << \"X server does not support XFixes.\";\n  }\n}\n\nvoid MouseCursorMonitorX11::Capture() {\n  assert(callback_);\n\n  \/\/ Process X11 events in case XFixes has sent cursor notification.\n  x_display_->ProcessPendingXEvents();\n\n  \/\/ cursor_shape_| is set only if we were notified of a cursor shape change.\n  if (cursor_shape_.get())\n    callback_->OnMouseCursor(cursor_shape_.release());\n\n  \/\/ Get cursor position if necessary.\n  if (mode_ == SHAPE_AND_POSITION) {\n    int root_x;\n    int root_y;\n    int win_x;\n    int win_y;\n    Window root_window;\n    Window child_window;\n    unsigned int mask;\n\n    XErrorTrap error_trap(display());\n    Bool result = XQueryPointer(display(), window_, &root_window, &child_window,\n                                &root_x, &root_y, &win_x, &win_y, &mask);\n    CursorState state;\n    if (!result || error_trap.GetLastErrorAndDisable() != 0) {\n      state = OUTSIDE;\n    } else {\n      \/\/ In screen mode (window_ == root_window) the mouse is always inside.\n      \/\/ XQueryPointer() sets |child_window| to None if the cursor is outside\n      \/\/ |window_|.\n      state =\n          (window_ == root_window || child_window != None) ? INSIDE : OUTSIDE;\n    }\n\n    callback_->OnMouseCursorPosition(state,\n                                     webrtc::DesktopVector(win_x, win_y));\n  }\n}\n\nbool MouseCursorMonitorX11::HandleXEvent(const XEvent& event) {\n  if (have_xfixes_ && event.type == xfixes_event_base_ + XFixesCursorNotify) {\n    const XFixesCursorNotifyEvent* cursor_event =\n        reinterpret_cast<const XFixesCursorNotifyEvent*>(&event);\n    if (cursor_event->subtype == XFixesDisplayCursorNotify) {\n      CaptureCursor();\n    }\n    \/\/ Return false, even if the event has been handled, because there might be\n    \/\/ other listeners for cursor notifications.\n  }\n  return false;\n}\n\nvoid MouseCursorMonitorX11::CaptureCursor() {\n  assert(have_xfixes_);\n\n  XFixesCursorImage* img;\n  {\n    XErrorTrap error_trap(display());\n    img = XFixesGetCursorImage(display());\n    if (!img || error_trap.GetLastErrorAndDisable() != 0)\n       return;\n   }\n\n  scoped_ptr<DesktopFrame> image(\n      new BasicDesktopFrame(DesktopSize(img->width, img->height)));\n\n  \/\/ Xlib stores 32-bit data in longs, even if longs are 64-bits long.\n  unsigned long* src = img->pixels;\n  uint32_t* dst = reinterpret_cast<uint32_t*>(image->data());\n  uint32_t* dst_end = dst + (img->width * img->height);\n  while (dst < dst_end) {\n    *dst++ = static_cast<uint32_t>(*src++);\n  }\n\n  DesktopVector hotspot(std::min(img->width, img->xhot),\n                        std::min(img->height, img->yhot));\n\n  XFree(img);\n\n  cursor_shape_.reset(new MouseCursor(image.release(), hotspot));\n}\n\n\/\/ static\nMouseCursorMonitor* MouseCursorMonitor::CreateForWindow(\n    const DesktopCaptureOptions& options, WindowId window) {\n  if (!options.x_display())\n    return NULL;\n  window = GetTopLevelWindow(options.x_display()->display(), window);\n  if (window == None)\n    return NULL;\n  return new MouseCursorMonitorX11(options, window);\n}\n\nMouseCursorMonitor* MouseCursorMonitor::CreateForScreen(\n    const DesktopCaptureOptions& options,\n    ScreenId screen) {\n  if (!options.x_display())\n    return NULL;\n  return new MouseCursorMonitorX11(\n      options, DefaultRootWindow(options.x_display()->display()));\n}\n\n}  \/\/ namespace webrtc\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 \"library\/constants.h\"\n#include \"library\/type_context.h\"\n#include \"library\/pp_options.h\"\n#include \"library\/trace.h\"\n#include \"library\/vm\/vm_environment.h\"\n#include \"library\/vm\/vm_exceptional.h\"\n#include \"library\/vm\/vm_format.h\"\n#include \"library\/vm\/vm_name.h\"\n#include \"library\/vm\/vm_expr.h\"\n#include \"library\/tactic\/tactic_state.h\"\n\nnamespace lean {\nvoid tactic_state_cell::dealloc() {\n    this->~tactic_state_cell();\n    get_vm_allocator().deallocate(sizeof(tactic_state_cell), this);\n}\n\ntactic_state::tactic_state(environment const & env, options const & o, metavar_context const & ctx,\n                           list<expr> const & gs, expr const & main) {\n    m_ptr = new (get_vm_allocator().allocate(sizeof(tactic_state_cell))) tactic_state_cell(env, o, ctx, gs, main);\n    m_ptr->inc_ref();\n}\n\noptional<expr> tactic_state::get_main_goal() const {\n    if (empty(goals())) return none_expr();\n    return some_expr(head(goals()));\n}\n\noptional<metavar_decl> tactic_state::get_main_goal_decl() const {\n    if (empty(goals())) return optional<metavar_decl>();\n    return mctx().get_metavar_decl(head(goals()));\n}\n\ntactic_state mk_tactic_state_for(environment const & env, options const & o, local_context const & lctx, expr const & type) {\n    metavar_context mctx;\n    expr main = mctx.mk_metavar_decl(lctx, type);\n    return tactic_state(env, o, mctx, list<expr>(main), main);\n}\n\ntactic_state set_options(tactic_state const & s, options const & o) {\n    return tactic_state(s.env(), o, s.mctx(), s.goals(), s.main());\n}\n\ntactic_state set_env(tactic_state const & s, environment const & env) {\n    return tactic_state(env, s.get_options(), s.mctx(), s.goals(), s.main());\n}\n\ntactic_state set_mctx(tactic_state const & s, metavar_context const & mctx) {\n    return tactic_state(s.env(), s.get_options(), mctx, s.goals(), s.main());\n}\n\ntactic_state set_goals(tactic_state const & s, list<expr> const & gs) {\n    return tactic_state(s.env(), s.get_options(), s.mctx(), gs, s.main());\n}\n\ntactic_state set_mctx_goals(tactic_state const & s, metavar_context const & mctx, list<expr> const & gs) {\n    return tactic_state(s.env(), s.get_options(), mctx, gs, s.main());\n}\n\nformat tactic_state::pp_expr(formatter_factory const & fmtf, expr const & e) const {\n    metavar_context mctx_tmp   = mctx();\n    type_context ctx = mk_type_context_for(*this, mctx_tmp, transparency_mode::All);\n    formatter fmt = fmtf(env(), get_options(), ctx);\n    return fmt(e);\n}\n\nformat tactic_state::pp_goal(formatter_factory const & fmtf, expr const & g) const {\n    metavar_decl decl          = *mctx().get_metavar_decl(g);\n    local_context const & lctx = decl.get_context();\n    metavar_context mctx_tmp   = mctx();\n    type_context ctx(env(), get_options(), mctx_tmp, lctx, transparency_mode::All);\n    formatter fmt              = fmtf(env(), get_options(), ctx);\n    format r                   = lctx.pp(fmt);\n    unsigned indent            = get_pp_indent(get_options());\n    bool unicode               = get_pp_unicode(get_options());\n    if (!lctx.empty())\n        r += line();\n    format turnstile           = unicode ? format(\"\\u22A2\") \/* ⊢ *\/ : format(\"|-\");\n    r += turnstile + space() + nest(indent, fmt(decl.get_type()));\n    if (get_pp_goal_compact(get_options()))\n        r = group(r);\n    return r;\n}\n\nformat tactic_state::pp(formatter_factory const & fmtf) const {\n    format r;\n    bool first = true;\n    for (auto const & g : goals()) {\n        if (first) first = false; else r += line() + line();\n        r += pp_goal(fmtf, g);\n    }\n    if (first) r = format(\"no goals\");\n    return r;\n}\n\nstruct vm_tactic_state : public vm_external {\n    tactic_state m_val;\n    vm_tactic_state(tactic_state const & v):m_val(v) {}\n    virtual void dealloc() override {\n        this->~vm_tactic_state(); get_vm_allocator().deallocate(sizeof(vm_tactic_state), this);\n    }\n};\n\ntactic_state const & to_tactic_state(vm_obj const & o) {\n    lean_assert(is_external(o));\n    lean_assert(dynamic_cast<vm_tactic_state*>(to_external(o)));\n    return static_cast<vm_tactic_state*>(to_external(o))->m_val;\n}\n\nvm_obj to_obj(tactic_state const & s) {\n    return mk_vm_external(new (get_vm_allocator().allocate(sizeof(vm_tactic_state))) vm_tactic_state(s));\n}\n\ntransparency_mode to_transparency_mode(vm_obj const & o) {\n    return static_cast<transparency_mode>(cidx(o));\n}\n\nvm_obj to_obj(transparency_mode m) {\n    return mk_vm_simple(static_cast<unsigned>(m));\n}\n\n\nvm_obj tactic_state_env(vm_obj const & s) {\n    return to_obj(to_tactic_state(s).env());\n}\n\nvm_obj tactic_state_to_format(vm_obj const & s) {\n    formatter_factory const & fmtf = get_global_ios().get_formatter_factory();\n    return to_obj(to_tactic_state(s).pp(fmtf));\n}\n\nvm_obj tactic_state_format_expr(vm_obj const & s, vm_obj const & e) {\n    formatter_factory const & fmtf = get_global_ios().get_formatter_factory();\n    return to_obj(to_tactic_state(s).pp_expr(fmtf, to_expr(e)));\n}\n\nvm_obj mk_tactic_success(vm_obj const & a, tactic_state const & s) {\n    return mk_vm_constructor(0, a, to_obj(s));\n}\n\nvm_obj mk_tactic_success(tactic_state const & s) {\n    return mk_tactic_success(mk_vm_unit(), s);\n}\n\nvm_obj mk_tactic_exception(vm_obj const & fn) {\n    return mk_vm_constructor(1, fn);\n}\n\nvm_obj mk_tactic_exception(throwable const & ex) {\n    vm_obj _ex = to_obj(ex);\n    vm_obj fn  = mk_vm_closure(get_throwable_to_format_fun_idx(), 1, &_ex);\n    return mk_tactic_exception(fn);\n}\n\nvm_obj mk_tactic_exception(format const & fmt) {\n    vm_state const & s = get_vm_state();\n    vm_decl K = *s.get_decl(get_combinator_K_name());\n    return mk_tactic_exception(mk_vm_closure(K.get_idx(), mk_vm_unit(), mk_vm_unit(), to_obj(fmt)));\n}\n\nvm_obj mk_tactic_exception(char const * msg) {\n    return mk_tactic_exception(format(msg));\n}\n\nvm_obj mk_tactic_exception(sstream const & s) {\n    return mk_tactic_exception(s.str().c_str());\n}\n\nvm_obj mk_no_goals_exception() {\n    return mk_tactic_exception(\"tactic failed, there are no goals to be solved\");\n}\n\nvm_obj tactic_result(vm_obj const & o) {\n    tactic_state const & s = to_tactic_state(o);\n    metavar_context mctx = s.mctx();\n    expr r = mctx.instantiate(s.main());\n    return mk_tactic_success(to_obj(r), set_mctx(s, mctx));\n}\n\nvm_obj tactic_main_type(vm_obj const & o) {\n    tactic_state const & s = to_tactic_state(o);\n    optional<metavar_decl> g = s.get_main_goal_decl();\n    if (!g) return mk_no_goals_exception();\n    return mk_tactic_success(to_obj(g->get_type()), s);\n}\n\nstruct type_context_cache_helper {\n    typedef std::unique_ptr<type_context_cache> cache_ptr;\n    cache_ptr m_cache_ptr;\n\n    void reset(environment const & env, options const & o) {\n        m_cache_ptr.reset(new type_context_cache(env, o));\n    }\n\n    bool compatible_env(environment const & env) {\n        environment const & curr_env = m_cache_ptr->env();\n        return env.is_descendant(curr_env) && curr_env.is_descendant(env);\n    }\n\n    void ensure_compatible(environment const & env, options const & o) {\n        if (!m_cache_ptr || !compatible_env(env) || !is_eqp(o, m_cache_ptr->get_options()))\n            reset(env, o);\n    }\n};\n\nMK_THREAD_LOCAL_GET_DEF(type_context_cache_helper, get_tch);\n\ntype_context_cache & get_type_context_cache_for(environment const & env, options const & o) {\n    get_tch().ensure_compatible(env, o);\n    return *get_tch().m_cache_ptr.get();\n}\n\ntype_context_cache & get_type_context_cache_for(tactic_state const & s) {\n    return get_type_context_cache_for(s.env(), s.get_options());\n}\n\nvm_obj tactic_infer_type(vm_obj const & e, vm_obj const & s0) {\n    tactic_state const & s = to_tactic_state(s0);\n    metavar_context mctx   = s.mctx();\n    type_context ctx       = mk_type_context_for(s, mctx);\n    try {\n        return mk_tactic_success(to_obj(ctx.infer(to_expr(e))), s);\n    } catch (exception & ex) {\n        return mk_tactic_exception(ex);\n    }\n}\n\nvm_obj tactic_whnf(vm_obj const & e, vm_obj const & s0) {\n    tactic_state const & s = to_tactic_state(s0);\n    metavar_context mctx   = s.mctx();\n    type_context ctx       = mk_type_context_for(s, mctx);\n    try {\n        return mk_tactic_success(to_obj(ctx.whnf(to_expr(e))), s);\n    } catch (exception & ex) {\n        return mk_tactic_exception(ex);\n    }\n}\n\nvm_obj tactic_unify_core(vm_obj const & e1, vm_obj const & e2, vm_obj const & t, vm_obj const & s0) {\n    tactic_state const & s = to_tactic_state(s0);\n    metavar_context mctx   = s.mctx();\n    type_context ctx       = mk_type_context_for(s, mctx, to_transparency_mode(t));\n    try {\n        bool r = ctx.is_def_eq(to_expr(e1), to_expr(e2));\n        return mk_tactic_success(mk_vm_bool(r), set_mctx(s, mctx));\n    } catch (exception & ex) {\n        return mk_tactic_exception(ex);\n    }\n}\n\nvm_obj tactic_get_local(vm_obj const & n, vm_obj const & s0) {\n    tactic_state const & s   = to_tactic_state(s0);\n    optional<metavar_decl> g = s.get_main_goal_decl();\n    if (!g) return mk_no_goals_exception();\n    local_context lctx       = g->get_context();\n    optional<local_decl> d   = lctx.get_local_decl_from_user_name(to_name(n));\n    if (!d) mk_tactic_exception(sstream() << \"get_local tactic failed, unknown '\" << to_name(n) << \"' local\");\n    return mk_tactic_success(to_obj(d->mk_ref()), s);\n}\n\nvoid initialize_tactic_state() {\n    DECLARE_VM_BUILTIN(name({\"tactic_state\", \"env\"}),         tactic_state_env);\n    DECLARE_VM_BUILTIN(name({\"tactic_state\", \"format_expr\"}), tactic_state_format_expr);\n    DECLARE_VM_BUILTIN(name({\"tactic_state\", \"to_format\"}),   tactic_state_to_format);\n    DECLARE_VM_BUILTIN(name({\"tactic\", \"main_type\"}),         tactic_main_type);\n    DECLARE_VM_BUILTIN(name({\"tactic\", \"result\"}),            tactic_result);\n    DECLARE_VM_BUILTIN(name({\"tactic\", \"infer_type\"}),        tactic_infer_type);\n    DECLARE_VM_BUILTIN(name({\"tactic\", \"unify_core\"}),        tactic_unify_core);\n    DECLARE_VM_BUILTIN(name({\"tactic\", \"get_local\"}),         tactic_get_local);\n}\n\nvoid finalize_tactic_state() {\n}\n}\n<commit_msg>fix(library\/tactic\/tactic_state): missing return<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 \"library\/constants.h\"\n#include \"library\/type_context.h\"\n#include \"library\/pp_options.h\"\n#include \"library\/trace.h\"\n#include \"library\/vm\/vm_environment.h\"\n#include \"library\/vm\/vm_exceptional.h\"\n#include \"library\/vm\/vm_format.h\"\n#include \"library\/vm\/vm_name.h\"\n#include \"library\/vm\/vm_expr.h\"\n#include \"library\/tactic\/tactic_state.h\"\n\nnamespace lean {\nvoid tactic_state_cell::dealloc() {\n    this->~tactic_state_cell();\n    get_vm_allocator().deallocate(sizeof(tactic_state_cell), this);\n}\n\ntactic_state::tactic_state(environment const & env, options const & o, metavar_context const & ctx,\n                           list<expr> const & gs, expr const & main) {\n    m_ptr = new (get_vm_allocator().allocate(sizeof(tactic_state_cell))) tactic_state_cell(env, o, ctx, gs, main);\n    m_ptr->inc_ref();\n}\n\noptional<expr> tactic_state::get_main_goal() const {\n    if (empty(goals())) return none_expr();\n    return some_expr(head(goals()));\n}\n\noptional<metavar_decl> tactic_state::get_main_goal_decl() const {\n    if (empty(goals())) return optional<metavar_decl>();\n    return mctx().get_metavar_decl(head(goals()));\n}\n\ntactic_state mk_tactic_state_for(environment const & env, options const & o, local_context const & lctx, expr const & type) {\n    metavar_context mctx;\n    expr main = mctx.mk_metavar_decl(lctx, type);\n    return tactic_state(env, o, mctx, list<expr>(main), main);\n}\n\ntactic_state set_options(tactic_state const & s, options const & o) {\n    return tactic_state(s.env(), o, s.mctx(), s.goals(), s.main());\n}\n\ntactic_state set_env(tactic_state const & s, environment const & env) {\n    return tactic_state(env, s.get_options(), s.mctx(), s.goals(), s.main());\n}\n\ntactic_state set_mctx(tactic_state const & s, metavar_context const & mctx) {\n    return tactic_state(s.env(), s.get_options(), mctx, s.goals(), s.main());\n}\n\ntactic_state set_goals(tactic_state const & s, list<expr> const & gs) {\n    return tactic_state(s.env(), s.get_options(), s.mctx(), gs, s.main());\n}\n\ntactic_state set_mctx_goals(tactic_state const & s, metavar_context const & mctx, list<expr> const & gs) {\n    return tactic_state(s.env(), s.get_options(), mctx, gs, s.main());\n}\n\nformat tactic_state::pp_expr(formatter_factory const & fmtf, expr const & e) const {\n    metavar_context mctx_tmp   = mctx();\n    type_context ctx = mk_type_context_for(*this, mctx_tmp, transparency_mode::All);\n    formatter fmt = fmtf(env(), get_options(), ctx);\n    return fmt(e);\n}\n\nformat tactic_state::pp_goal(formatter_factory const & fmtf, expr const & g) const {\n    metavar_decl decl          = *mctx().get_metavar_decl(g);\n    local_context const & lctx = decl.get_context();\n    metavar_context mctx_tmp   = mctx();\n    type_context ctx(env(), get_options(), mctx_tmp, lctx, transparency_mode::All);\n    formatter fmt              = fmtf(env(), get_options(), ctx);\n    format r                   = lctx.pp(fmt);\n    unsigned indent            = get_pp_indent(get_options());\n    bool unicode               = get_pp_unicode(get_options());\n    if (!lctx.empty())\n        r += line();\n    format turnstile           = unicode ? format(\"\\u22A2\") \/* ⊢ *\/ : format(\"|-\");\n    r += turnstile + space() + nest(indent, fmt(decl.get_type()));\n    if (get_pp_goal_compact(get_options()))\n        r = group(r);\n    return r;\n}\n\nformat tactic_state::pp(formatter_factory const & fmtf) const {\n    format r;\n    bool first = true;\n    for (auto const & g : goals()) {\n        if (first) first = false; else r += line() + line();\n        r += pp_goal(fmtf, g);\n    }\n    if (first) r = format(\"no goals\");\n    return r;\n}\n\nstruct vm_tactic_state : public vm_external {\n    tactic_state m_val;\n    vm_tactic_state(tactic_state const & v):m_val(v) {}\n    virtual void dealloc() override {\n        this->~vm_tactic_state(); get_vm_allocator().deallocate(sizeof(vm_tactic_state), this);\n    }\n};\n\ntactic_state const & to_tactic_state(vm_obj const & o) {\n    lean_assert(is_external(o));\n    lean_assert(dynamic_cast<vm_tactic_state*>(to_external(o)));\n    return static_cast<vm_tactic_state*>(to_external(o))->m_val;\n}\n\nvm_obj to_obj(tactic_state const & s) {\n    return mk_vm_external(new (get_vm_allocator().allocate(sizeof(vm_tactic_state))) vm_tactic_state(s));\n}\n\ntransparency_mode to_transparency_mode(vm_obj const & o) {\n    return static_cast<transparency_mode>(cidx(o));\n}\n\nvm_obj to_obj(transparency_mode m) {\n    return mk_vm_simple(static_cast<unsigned>(m));\n}\n\n\nvm_obj tactic_state_env(vm_obj const & s) {\n    return to_obj(to_tactic_state(s).env());\n}\n\nvm_obj tactic_state_to_format(vm_obj const & s) {\n    formatter_factory const & fmtf = get_global_ios().get_formatter_factory();\n    return to_obj(to_tactic_state(s).pp(fmtf));\n}\n\nvm_obj tactic_state_format_expr(vm_obj const & s, vm_obj const & e) {\n    formatter_factory const & fmtf = get_global_ios().get_formatter_factory();\n    return to_obj(to_tactic_state(s).pp_expr(fmtf, to_expr(e)));\n}\n\nvm_obj mk_tactic_success(vm_obj const & a, tactic_state const & s) {\n    return mk_vm_constructor(0, a, to_obj(s));\n}\n\nvm_obj mk_tactic_success(tactic_state const & s) {\n    return mk_tactic_success(mk_vm_unit(), s);\n}\n\nvm_obj mk_tactic_exception(vm_obj const & fn) {\n    return mk_vm_constructor(1, fn);\n}\n\nvm_obj mk_tactic_exception(throwable const & ex) {\n    vm_obj _ex = to_obj(ex);\n    vm_obj fn  = mk_vm_closure(get_throwable_to_format_fun_idx(), 1, &_ex);\n    return mk_tactic_exception(fn);\n}\n\nvm_obj mk_tactic_exception(format const & fmt) {\n    vm_state const & s = get_vm_state();\n    vm_decl K = *s.get_decl(get_combinator_K_name());\n    return mk_tactic_exception(mk_vm_closure(K.get_idx(), mk_vm_unit(), mk_vm_unit(), to_obj(fmt)));\n}\n\nvm_obj mk_tactic_exception(char const * msg) {\n    return mk_tactic_exception(format(msg));\n}\n\nvm_obj mk_tactic_exception(sstream const & s) {\n    return mk_tactic_exception(s.str().c_str());\n}\n\nvm_obj mk_no_goals_exception() {\n    return mk_tactic_exception(\"tactic failed, there are no goals to be solved\");\n}\n\nvm_obj tactic_result(vm_obj const & o) {\n    tactic_state const & s = to_tactic_state(o);\n    metavar_context mctx = s.mctx();\n    expr r = mctx.instantiate(s.main());\n    return mk_tactic_success(to_obj(r), set_mctx(s, mctx));\n}\n\nvm_obj tactic_main_type(vm_obj const & o) {\n    tactic_state const & s = to_tactic_state(o);\n    optional<metavar_decl> g = s.get_main_goal_decl();\n    if (!g) return mk_no_goals_exception();\n    return mk_tactic_success(to_obj(g->get_type()), s);\n}\n\nstruct type_context_cache_helper {\n    typedef std::unique_ptr<type_context_cache> cache_ptr;\n    cache_ptr m_cache_ptr;\n\n    void reset(environment const & env, options const & o) {\n        m_cache_ptr.reset(new type_context_cache(env, o));\n    }\n\n    bool compatible_env(environment const & env) {\n        environment const & curr_env = m_cache_ptr->env();\n        return env.is_descendant(curr_env) && curr_env.is_descendant(env);\n    }\n\n    void ensure_compatible(environment const & env, options const & o) {\n        if (!m_cache_ptr || !compatible_env(env) || !is_eqp(o, m_cache_ptr->get_options()))\n            reset(env, o);\n    }\n};\n\nMK_THREAD_LOCAL_GET_DEF(type_context_cache_helper, get_tch);\n\ntype_context_cache & get_type_context_cache_for(environment const & env, options const & o) {\n    get_tch().ensure_compatible(env, o);\n    return *get_tch().m_cache_ptr.get();\n}\n\ntype_context_cache & get_type_context_cache_for(tactic_state const & s) {\n    return get_type_context_cache_for(s.env(), s.get_options());\n}\n\nvm_obj tactic_infer_type(vm_obj const & e, vm_obj const & s0) {\n    tactic_state const & s = to_tactic_state(s0);\n    metavar_context mctx   = s.mctx();\n    type_context ctx       = mk_type_context_for(s, mctx);\n    try {\n        return mk_tactic_success(to_obj(ctx.infer(to_expr(e))), s);\n    } catch (exception & ex) {\n        return mk_tactic_exception(ex);\n    }\n}\n\nvm_obj tactic_whnf(vm_obj const & e, vm_obj const & s0) {\n    tactic_state const & s = to_tactic_state(s0);\n    metavar_context mctx   = s.mctx();\n    type_context ctx       = mk_type_context_for(s, mctx);\n    try {\n        return mk_tactic_success(to_obj(ctx.whnf(to_expr(e))), s);\n    } catch (exception & ex) {\n        return mk_tactic_exception(ex);\n    }\n}\n\nvm_obj tactic_unify_core(vm_obj const & e1, vm_obj const & e2, vm_obj const & t, vm_obj const & s0) {\n    tactic_state const & s = to_tactic_state(s0);\n    metavar_context mctx   = s.mctx();\n    type_context ctx       = mk_type_context_for(s, mctx, to_transparency_mode(t));\n    try {\n        bool r = ctx.is_def_eq(to_expr(e1), to_expr(e2));\n        return mk_tactic_success(mk_vm_bool(r), set_mctx(s, mctx));\n    } catch (exception & ex) {\n        return mk_tactic_exception(ex);\n    }\n}\n\nvm_obj tactic_get_local(vm_obj const & n, vm_obj const & s0) {\n    tactic_state const & s   = to_tactic_state(s0);\n    optional<metavar_decl> g = s.get_main_goal_decl();\n    if (!g) return mk_no_goals_exception();\n    local_context lctx       = g->get_context();\n    optional<local_decl> d   = lctx.get_local_decl_from_user_name(to_name(n));\n    if (!d) return mk_tactic_exception(sstream() << \"get_local tactic failed, unknown '\" << to_name(n) << \"' local\");\n    return mk_tactic_success(to_obj(d->mk_ref()), s);\n}\n\nvoid initialize_tactic_state() {\n    DECLARE_VM_BUILTIN(name({\"tactic_state\", \"env\"}),         tactic_state_env);\n    DECLARE_VM_BUILTIN(name({\"tactic_state\", \"format_expr\"}), tactic_state_format_expr);\n    DECLARE_VM_BUILTIN(name({\"tactic_state\", \"to_format\"}),   tactic_state_to_format);\n    DECLARE_VM_BUILTIN(name({\"tactic\", \"main_type\"}),         tactic_main_type);\n    DECLARE_VM_BUILTIN(name({\"tactic\", \"result\"}),            tactic_result);\n    DECLARE_VM_BUILTIN(name({\"tactic\", \"infer_type\"}),        tactic_infer_type);\n    DECLARE_VM_BUILTIN(name({\"tactic\", \"unify_core\"}),        tactic_unify_core);\n    DECLARE_VM_BUILTIN(name({\"tactic\", \"get_local\"}),         tactic_get_local);\n}\n\nvoid finalize_tactic_state() {\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\n*\/\n\n#include \"lineFollowing.h\"\n\n\nusing namespace std;\nusing namespace cv;\n\nvoid detect_lines(Mat &original_frame, double scale_factor);\n\n\nvoid line_main() {\n\/\/  printf(\"Hello, this is Caleb\\n\");\n\/\/  no this is patric\n\n  VideoCapture cap(\"..\/..\/tests\/videos\/top_down_1.m4v\");\n  if (!cap.isOpened())  \/\/ check if we succeeded\n    return;\n\n\/\/  Mat edges;\n  for (; ;) {\n    Mat frame;\n    cap >> frame; \/\/ get a new frame from camera\n\n    detect_lines(frame, .2);\n\n\n    if (waitKey(30) >= 0) break;\n\n  }\n  \/\/ the camera will be deinitialized automatically in VideoCapture destructor\n\n  return;\n}\n\nvoid detect_lines(Mat &original_frame, double scale_factor) {\n  Mat hsv;\n  Mat mask;\n  Mat image;\n\n  resize(original_frame, image, Size(), scale_factor, scale_factor); \/\/Potentially scale down the frame\n\n  cvtColor(image, image, CV_BGR2HSV); \/\/ Image is now HSV\n\n  double minH = 30;\n  double minS = 0;\n  double minV = 240;\n  double maxH = 80;\n  double maxS = 70;\n  double maxV = 255;\n\n\n  Scalar lower(minH, minS, minV);\n  Scalar upper(maxH, maxS, maxV);\n  inRange(hsv, lower, upper, mask); \/\/ Create a mask of only the desired color\n\n\n  vector<Vec4i> lines;\n  HoughLinesP(mask, lines, 1, CV_PI \/ 180.0, 10, 50, 10); \/\/ Find all lines in the image\n\n  printf(\"Adding in %d lines\\n\", (int) lines.size());\n  for (size_t i = 0; i < lines.size(); i++) {\n    Vec4i l = lines[i];\n    line(image, Point(l[0], l[1]), Point(l[2], l[3]), Scalar(0, 0, 255), 1, CV_AA);\n    \/\/ break;\n  }\n\/\/    if (lines.size() < 1) continue;\n\n  imshow(\"line_window\", original_frame);\n}\n\nvoid LineFollowing::initialize() {\n  namedWindow(\"line_window\", CV_WINDOW_NORMAL);\n  return;\n}\n\nvoid LineFollowing::close() {\n  return;\n}\n\nControlMovements LineFollowing::fly(cv::Mat *image) {\n  ControlMovements velocities;\n\n  velocities.vx = 0;\n  velocities.vy = 0;\n  velocities.vz = 0;\n  velocities.vr = 0;\n\n  detect_lines(*image, 1);\n\n  return velocities;\n}\n<commit_msg>don't worry about unused main thing for now<commit_after>\/*\n\n*\/\n\n#include \"lineFollowing.h\"\n\n\nusing namespace std;\nusing namespace cv;\n\nvoid detect_lines(Mat &original_frame, double scale_factor);\n\n\n#pragma clang diagnostic push\n#pragma ide diagnostic ignored \"OCUnusedGlobalDeclarationInspection\"\nvoid line_main() {\n\/\/  printf(\"Hello, this is Caleb\\n\");\n\/\/  no this is patric\n\n  VideoCapture cap(\"..\/..\/tests\/videos\/top_down_1.m4v\");\n  if (!cap.isOpened())  \/\/ check if we succeeded\n    return;\n\n\/\/  Mat edges;\n  for (; ;) {\n    Mat frame;\n    cap >> frame; \/\/ get a new frame from camera\n\n    detect_lines(frame, .2);\n\n\n    if (waitKey(30) >= 0) break;\n\n  }\n  \/\/ the camera will be deinitialized automatically in VideoCapture destructor\n\n  return;\n}\n#pragma clang diagnostic pop\n\nvoid detect_lines(Mat &original_frame, double scale_factor) {\n  Mat hsv;\n  Mat mask;\n  Mat image;\n\n  resize(original_frame, image, Size(), scale_factor, scale_factor); \/\/Potentially scale down the frame\n\n  cvtColor(image, image, CV_BGR2HSV); \/\/ Image is now HSV\n\n  double minH = 30;\n  double minS = 0;\n  double minV = 240;\n  double maxH = 80;\n  double maxS = 70;\n  double maxV = 255;\n\n\n  Scalar lower(minH, minS, minV);\n  Scalar upper(maxH, maxS, maxV);\n  inRange(hsv, lower, upper, mask); \/\/ Create a mask of only the desired color\n\n\n  vector<Vec4i> lines;\n  HoughLinesP(mask, lines, 1, CV_PI \/ 180.0, 10, 50, 10); \/\/ Find all lines in the image\n\n  printf(\"Adding in %d lines\\n\", (int) lines.size());\n  for (size_t i = 0; i < lines.size(); i++) {\n    Vec4i l = lines[i];\n    line(image, Point(l[0], l[1]), Point(l[2], l[3]), Scalar(0, 0, 255), 1, CV_AA);\n    \/\/ break;\n  }\n\/\/    if (lines.size() < 1) continue;\n\n  imshow(\"line_window\", original_frame);\n}\n\nvoid LineFollowing::initialize() {\n  namedWindow(\"line_window\", CV_WINDOW_NORMAL);\n  return;\n}\n\nvoid LineFollowing::close() {\n  return;\n}\n\nControlMovements LineFollowing::fly(cv::Mat *image) {\n  ControlMovements velocities;\n\n  velocities.vx = 0;\n  velocities.vy = 0;\n  velocities.vz = 0;\n  velocities.vr = 0;\n\n  detect_lines(*image, 1);\n\n  return velocities;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\n*\/\n\n#include \"lineFollowing.h\"\n\nusing namespace std;\nusing namespace cv;\n\nControlMovements lineFollowingControl() {\n\n  line_main();\n\n  return ControlMovements();\n}\n\nvoid line_main() {\n\/\/  printf(\"Hello, this is Caleb\\n\");\n\n  VideoCapture cap(\"videos\/top_down_4.m4v\");\n  if (!cap.isOpened())  \/\/ check if we succeeded\n    return;\n\n  namedWindow(\"linesH\", CV_WINDOW_NORMAL);\n  Mat edges;\n  for(;;)\n  {\n    Mat frame;\n    cap >> frame; \/\/ get a new frame from camera\n    cvtColor(frame, edges, CV_BGR2GRAY);\n    GaussianBlur(edges, edges, Size(7,7), 1.5, 1.5);\n    Canny(edges, edges, 0, 30, 3);\n    imshow(\"edges\", edges);\n    if(waitKey(30) >= 0) break;\n  }\n  \/\/ the camera will be deinitialized automatically in VideoCapture destructor\n  return;\n}\n<commit_msg>test code<commit_after>\/*\n\n*\/\n\n#include \"lineFollowing.h\"\n\nusing namespace std;\nusing namespace cv;\n\nControlMovements lineFollowingControl() {\n\n  line_main();\n\n  return ControlMovements();\n}\n\nvoid line_main() {\n\/\/  printf(\"Hello, this is Caleb\\n\");\n\n  VideoCapture cap(\"videos\/top_down_4.m4v\");\n  if (!cap.isOpened())  \/\/ check if we succeeded\n    return;\n\n  namedWindow(\"edges\", CV_WINDOW_NORMAL);\n  Mat edges;\n  for (; ;) {\n    Mat frame;\n    cap >> frame; \/\/ get a new frame from camera\n    cvtColor(frame, edges, CV_BGR2GRAY);\n    GaussianBlur(edges, edges, Size(7, 7), 1.5, 1.5);\n    Canny(edges, edges, 0, 30, 3);\n    imshow(\"edges\", edges);\n    if (waitKey(30) >= 0) break;\n  }\n  \/\/ the camera will be deinitialized automatically in VideoCapture destructor\n  return;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>fix vkCmdClearAttachments validation<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>#i117341# let getAvailableServiceNames include css.awt.tab.UnoControlTabPageModel<commit_after><|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 \"DLight.h\"\n\nusing namespace Ogre;\n\n\/\/CG\nclass LightMaterialGeneratorCG : public MaterialGenerator::Impl\n{\npublic:\n\ttypedef MaterialGenerator::Perm Perm;\n\tLightMaterialGeneratorCG(const String &baseName):\n\t    mBaseName(baseName) \n\t{\n\n\t}\n\tvirtual ~LightMaterialGeneratorCG()\n\t{\n\n\t}\n\n\tvirtual GpuProgramPtr generateVertexShader(Perm permutation)\n\t{\n        String programName = \"DeferredShading\/post\/\";\n\n\t\tif (permutation & LightMaterialGenerator::MI_DIRECTIONAL)\n\t\t{\n\t\t\tprogramName += \"vs\";\n\t\t}\n\t\telse\n\t\t{\n\t\t\tprogramName += \"LightMaterial_vs\";\n\t\t}\n\n\t\tGpuProgramPtr ptr = HighLevelGpuProgramManager::getSingleton().getByName(programName);\n\t\tassert(ptr->getLanguage()==\"cg\");\n\t\treturn ptr;\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\/LightMaterial_ps.cg\"\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\"cg\", GPT_FRAGMENT_PROGRAM);\n\t\tptrProgram->setSource(mMasterSource);\n\t\tptrProgram->setParameter(\"entry_point\",\"main\");\n\t    ptrProgram->setParameter(\"profiles\",\"ps_2_x arbfp1\");\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(\"compile_arguments\", getPPDefines(permutation));\n\n\t\tsetUpBaseParameters(ptrProgram->getDefaultParameters());\n\n\t\treturn GpuProgramPtr(ptrProgram);\n\t}\n\n\tvirtual MaterialPtr generateTemplateMaterial(Perm permutation)\n\t{\n\t\tString materialName = mBaseName;\n\t\n        if(permutation & LightMaterialGenerator::MI_DIRECTIONAL)\n\t\t{   \n\t\t\tmaterialName += \"Quad\";\n\t\t}\n\t\telse\n\t\t{\n\t\t\tmaterialName += \"Geometry\";\n\t\t}\n\n\t\tif(permutation & LightMaterialGenerator::MI_SHADOW_CASTER)\n\t\t{\n\t\t\tmaterialName += \"Shadow\";\n\t\t}\n\t\treturn MaterialManager::getSingleton().getByName(materialName);\n\t}\n\n\tprotected:\n\t\tString mBaseName;\n        String mMasterSource;\n\t\t\/\/ Utility method\n\t\tString getPPDefines(Perm permutation)\n\t\t{\n\t\t\tString strPPD;\n\n\t\t\t\/\/Get the type of light\n\t\t\tString lightType;\n\t\t\tif (permutation & LightMaterialGenerator::MI_POINT)\n\t\t\t{\n\t\t\t\tlightType = \"POINT\";\n\t\t\t}\n\t\t\telse if (permutation & LightMaterialGenerator::MI_SPOTLIGHT)\n\t\t\t{\n\t\t\t\tlightType = \"SPOT\";\n\t\t\t}\n\t\t\telse if (permutation & LightMaterialGenerator::MI_DIRECTIONAL)\n\t\t\t{\n\t\t\t\tlightType = \"DIRECTIONAL\";\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tassert(false && \"Permutation must have a light type\");\n\t\t\t}\n\t\t\tstrPPD += \"-DLIGHT_TYPE=LIGHT_\" + lightType + \" \";\n\n\t\t\t\/\/Optional parameters\n            if (permutation & LightMaterialGenerator::MI_SPECULAR)\n\t\t\t{\n\t\t\t\tstrPPD += \"-DIS_SPECULAR \";\n\t\t\t}\n\t\t\tif (permutation & LightMaterialGenerator::MI_ATTENUATED)\n\t\t\t{\n\t\t\t\tstrPPD += \"-DIS_ATTENUATED \";\n\t\t\t}\n\t\t\tif (permutation & LightMaterialGenerator::MI_SHADOW_CASTER)\n\t\t\t{\n\t\t\t\tstrPPD += \"-DIS_SHADOW_CASTER \";\n\t\t\t}\n\t\t\treturn strPPD;\n\t\t}\n\n\t\tvoid setUpBaseParameters(const GpuProgramParametersSharedPtr& params)\n\t\t{\n\t\t\tassert(params.isNull()==false);\n\n\t\t\tstruct AutoParamPair { String name; GpuProgramParameters::AutoConstantType type; };\t\n\n\t\t\t\/\/A list of auto params that might be present in the shaders generated\n\t\t\tstatic const AutoParamPair AUTO_PARAMS[] = {\n\t\t\t\t{ \"vpWidth\",\t\t\tGpuProgramParameters::ACT_VIEWPORT_WIDTH },\n\t\t\t\t{ \"vpHeight\",\t\t\tGpuProgramParameters::ACT_VIEWPORT_HEIGHT },\n\t\t\t\t{ \"worldView\",\t\t\tGpuProgramParameters::ACT_WORLDVIEW_MATRIX },\n\t\t\t\t{ \"invProj\",\t\t\tGpuProgramParameters::ACT_INVERSE_PROJECTION_MATRIX },\n\t\t\t\t{ \"invView\",\t\t\tGpuProgramParameters::ACT_INVERSE_VIEW_MATRIX },\n\t\t\t\t{ \"flip\",\t\t\t\tGpuProgramParameters::ACT_RENDER_TARGET_FLIPPING },\n\t\t\t\t{ \"lightDiffuseColor\",\tGpuProgramParameters::ACT_LIGHT_DIFFUSE_COLOUR },\n\t\t\t\t{ \"lightSpecularColor\", GpuProgramParameters::ACT_LIGHT_SPECULAR_COLOUR },\n\t\t\t\t{ \"lightFalloff\",\t\tGpuProgramParameters::ACT_LIGHT_ATTENUATION },\n\t\t\t\t{ \"lightPos\",\t\t\tGpuProgramParameters::ACT_LIGHT_POSITION_VIEW_SPACE },\n\t\t\t\t{ \"lightDir\",\t\t\tGpuProgramParameters::ACT_LIGHT_DIRECTION_VIEW_SPACE },\n\t\t\t\t{ \"spotParams\",\t\t\tGpuProgramParameters::ACT_SPOTLIGHT_PARAMS },\n\t\t\t\t{ \"farClipDistance\",\tGpuProgramParameters::ACT_FAR_CLIP_DISTANCE },\n\t\t\t\t{ \"shadowViewProjMat\",\tGpuProgramParameters::ACT_TEXTURE_VIEWPROJ_MATRIX }\n\t\t\t};\n\t\t\tint numParams = sizeof(AUTO_PARAMS) \/ sizeof(AutoParamPair);\n\n\t\t\tfor (int i=0; i<numParams; i++)\n\t\t\t{\n\t\t\t\tif (params->_findNamedConstantDefinition(AUTO_PARAMS[i].name))\n\t\t\t\t{\n\t\t\t\t\tparams->setNamedAutoConstant(AUTO_PARAMS[i].name, AUTO_PARAMS[i].type);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n};\n\nLightMaterialGenerator::LightMaterialGenerator()\n{\n\tvsMask = 0x00000004;\n\tfsMask = 0x0000003F;\n\tmatMask =\tLightMaterialGenerator::MI_DIRECTIONAL | \n\t\t\t\tLightMaterialGenerator::MI_SHADOW_CASTER;\n\t\n\tmaterialBaseName = \"DeferredShading\/LightMaterial\/\";\n    mImpl = new LightMaterialGeneratorCG(\"DeferredShading\/LightMaterial\/\");\n}\n\nLightMaterialGenerator::~LightMaterialGenerator()\n{\n\n}\n<commit_msg>DeferredShading : Modified assert to allow any type of program, rather than just cg.<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 \"DLight.h\"\n\nusing namespace Ogre;\n\n\/\/CG\nclass LightMaterialGeneratorCG : public MaterialGenerator::Impl\n{\npublic:\n\ttypedef MaterialGenerator::Perm Perm;\n\tLightMaterialGeneratorCG(const String &baseName):\n\t    mBaseName(baseName) \n\t{\n\n\t}\n\tvirtual ~LightMaterialGeneratorCG()\n\t{\n\n\t}\n\n\tvirtual GpuProgramPtr generateVertexShader(Perm permutation)\n\t{\n        String programName = \"DeferredShading\/post\/\";\n\n\t\tif (permutation & LightMaterialGenerator::MI_DIRECTIONAL)\n\t\t{\n\t\t\tprogramName += \"vs\";\n\t\t}\n\t\telse\n\t\t{\n\t\t\tprogramName += \"LightMaterial_vs\";\n\t\t}\n\n\t\tGpuProgramPtr ptr = HighLevelGpuProgramManager::getSingleton().getByName(programName);\n\t\tassert(!ptr.isNull());\n\t\treturn ptr;\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\/LightMaterial_ps.cg\"\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\"cg\", GPT_FRAGMENT_PROGRAM);\n\t\tptrProgram->setSource(mMasterSource);\n\t\tptrProgram->setParameter(\"entry_point\",\"main\");\n\t    ptrProgram->setParameter(\"profiles\",\"ps_2_x arbfp1\");\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(\"compile_arguments\", getPPDefines(permutation));\n\n\t\tsetUpBaseParameters(ptrProgram->getDefaultParameters());\n\n\t\treturn GpuProgramPtr(ptrProgram);\n\t}\n\n\tvirtual MaterialPtr generateTemplateMaterial(Perm permutation)\n\t{\n\t\tString materialName = mBaseName;\n\t\n        if(permutation & LightMaterialGenerator::MI_DIRECTIONAL)\n\t\t{   \n\t\t\tmaterialName += \"Quad\";\n\t\t}\n\t\telse\n\t\t{\n\t\t\tmaterialName += \"Geometry\";\n\t\t}\n\n\t\tif(permutation & LightMaterialGenerator::MI_SHADOW_CASTER)\n\t\t{\n\t\t\tmaterialName += \"Shadow\";\n\t\t}\n\t\treturn MaterialManager::getSingleton().getByName(materialName);\n\t}\n\n\tprotected:\n\t\tString mBaseName;\n        String mMasterSource;\n\t\t\/\/ Utility method\n\t\tString getPPDefines(Perm permutation)\n\t\t{\n\t\t\tString strPPD;\n\n\t\t\t\/\/Get the type of light\n\t\t\tString lightType;\n\t\t\tif (permutation & LightMaterialGenerator::MI_POINT)\n\t\t\t{\n\t\t\t\tlightType = \"POINT\";\n\t\t\t}\n\t\t\telse if (permutation & LightMaterialGenerator::MI_SPOTLIGHT)\n\t\t\t{\n\t\t\t\tlightType = \"SPOT\";\n\t\t\t}\n\t\t\telse if (permutation & LightMaterialGenerator::MI_DIRECTIONAL)\n\t\t\t{\n\t\t\t\tlightType = \"DIRECTIONAL\";\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tassert(false && \"Permutation must have a light type\");\n\t\t\t}\n\t\t\tstrPPD += \"-DLIGHT_TYPE=LIGHT_\" + lightType + \" \";\n\n\t\t\t\/\/Optional parameters\n            if (permutation & LightMaterialGenerator::MI_SPECULAR)\n\t\t\t{\n\t\t\t\tstrPPD += \"-DIS_SPECULAR \";\n\t\t\t}\n\t\t\tif (permutation & LightMaterialGenerator::MI_ATTENUATED)\n\t\t\t{\n\t\t\t\tstrPPD += \"-DIS_ATTENUATED \";\n\t\t\t}\n\t\t\tif (permutation & LightMaterialGenerator::MI_SHADOW_CASTER)\n\t\t\t{\n\t\t\t\tstrPPD += \"-DIS_SHADOW_CASTER \";\n\t\t\t}\n\t\t\treturn strPPD;\n\t\t}\n\n\t\tvoid setUpBaseParameters(const GpuProgramParametersSharedPtr& params)\n\t\t{\n\t\t\tassert(params.isNull()==false);\n\n\t\t\tstruct AutoParamPair { String name; GpuProgramParameters::AutoConstantType type; };\t\n\n\t\t\t\/\/A list of auto params that might be present in the shaders generated\n\t\t\tstatic const AutoParamPair AUTO_PARAMS[] = {\n\t\t\t\t{ \"vpWidth\",\t\t\tGpuProgramParameters::ACT_VIEWPORT_WIDTH },\n\t\t\t\t{ \"vpHeight\",\t\t\tGpuProgramParameters::ACT_VIEWPORT_HEIGHT },\n\t\t\t\t{ \"worldView\",\t\t\tGpuProgramParameters::ACT_WORLDVIEW_MATRIX },\n\t\t\t\t{ \"invProj\",\t\t\tGpuProgramParameters::ACT_INVERSE_PROJECTION_MATRIX },\n\t\t\t\t{ \"invView\",\t\t\tGpuProgramParameters::ACT_INVERSE_VIEW_MATRIX },\n\t\t\t\t{ \"flip\",\t\t\t\tGpuProgramParameters::ACT_RENDER_TARGET_FLIPPING },\n\t\t\t\t{ \"lightDiffuseColor\",\tGpuProgramParameters::ACT_LIGHT_DIFFUSE_COLOUR },\n\t\t\t\t{ \"lightSpecularColor\", GpuProgramParameters::ACT_LIGHT_SPECULAR_COLOUR },\n\t\t\t\t{ \"lightFalloff\",\t\tGpuProgramParameters::ACT_LIGHT_ATTENUATION },\n\t\t\t\t{ \"lightPos\",\t\t\tGpuProgramParameters::ACT_LIGHT_POSITION_VIEW_SPACE },\n\t\t\t\t{ \"lightDir\",\t\t\tGpuProgramParameters::ACT_LIGHT_DIRECTION_VIEW_SPACE },\n\t\t\t\t{ \"spotParams\",\t\t\tGpuProgramParameters::ACT_SPOTLIGHT_PARAMS },\n\t\t\t\t{ \"farClipDistance\",\tGpuProgramParameters::ACT_FAR_CLIP_DISTANCE },\n\t\t\t\t{ \"shadowViewProjMat\",\tGpuProgramParameters::ACT_TEXTURE_VIEWPROJ_MATRIX }\n\t\t\t};\n\t\t\tint numParams = sizeof(AUTO_PARAMS) \/ sizeof(AutoParamPair);\n\n\t\t\tfor (int i=0; i<numParams; i++)\n\t\t\t{\n\t\t\t\tif (params->_findNamedConstantDefinition(AUTO_PARAMS[i].name))\n\t\t\t\t{\n\t\t\t\t\tparams->setNamedAutoConstant(AUTO_PARAMS[i].name, AUTO_PARAMS[i].type);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n};\n\nLightMaterialGenerator::LightMaterialGenerator()\n{\n\tvsMask = 0x00000004;\n\tfsMask = 0x0000003F;\n\tmatMask =\tLightMaterialGenerator::MI_DIRECTIONAL | \n\t\t\t\tLightMaterialGenerator::MI_SHADOW_CASTER;\n\t\n\tmaterialBaseName = \"DeferredShading\/LightMaterial\/\";\n    mImpl = new LightMaterialGeneratorCG(\"DeferredShading\/LightMaterial\/\");\n}\n\nLightMaterialGenerator::~LightMaterialGenerator()\n{\n\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.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\/\/ Qt includes\n#include <QApplication>\n#include <QTimer>\n\n\/\/ CTK includes\n#include \"ctkVTKScalarBarWidget.h\"\n\n\/\/ VTK includes\n#include <vtkScalarBarActor.h>\n#include <vtkScalarBarWidget.h>\n#include <vtkSmartPointer.h>\n\n\/\/ STD includes\n#include <iostream>\n\n\/\/-----------------------------------------------------------------------------\nint ctkVTKScalarBarWidgetTest1(int argc, char * argv [] )\n{\n  QApplication app(argc, argv);\n\n  vtkSmartPointer<vtkScalarBarWidget> scalarBar =\n    vtkSmartPointer<vtkScalarBarWidget>::New();\n  vtkScalarBarActor* actor = scalarBar->GetScalarBarActor();\n\n  ctkVTKScalarBarWidget widget;\n  widget.setScalarBarWidget(scalarBar);\n  widget.setScalarBarWidget(0);\n  widget.setScalarBarWidget(scalarBar);\n\n  \/\/ display\n  widget.setDisplay(false);\n  if (scalarBar->GetEnabled() != false)\n    {\n    std::cerr << \"ctkVTKScalarBarWidget::setDisplay() failed\"\n              << std::endl;\n    return EXIT_FAILURE;\n    }\n  \/\/ it will fail as there is no interactor set to the widget\n  scalarBar->SetEnabled(true);\n  if (widget.display() != scalarBar->GetEnabled())\n    {\n    std::cerr << \"ctkVTKScalarBarWidget::setDisplay() failed\"\n              << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  \/\/ max number of colors\n  widget.setMaxNumberOfColors(20);\n  if (actor->GetMaximumNumberOfColors() != 20)\n    {\n    std::cerr << \"ctkVTKScalarBarWidget::setMaxNumberOfColors() failed\"\n              << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  actor->SetMaximumNumberOfColors(30);\n  if (widget.maxNumberOfColors() != 30)\n    {\n    std::cerr << \"ctkVTKScalarBarWidget::setMaxNumberOfColors() failed\"\n              << std::endl;\n    return EXIT_FAILURE;\n    }\n  \n  \/\/ number of labels\n  widget.setNumberOfLabels(5);\n  if (actor->GetNumberOfLabels() != 5)\n    {\n    std::cerr << \"ctkVTKScalarBarWidget::setNumberOfLabels() failed\"\n              << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  actor->SetNumberOfLabels(10);\n  if (widget.numberOfLabels() != 10)\n    {\n    std::cerr << \"ctkVTKScalarBarWidget::setNumberOfLabels() failed\"\n              << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  \/\/ title\n  widget.setTitle(\"title\");\n  if (QString(actor->GetTitle()) != \"title\")\n    {\n    std::cerr << \"ctkVTKScalarBarWidget::setTitle() failed\"\n              << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  actor->SetTitle(\"title 2\");\n  if (widget.title() != \"title 2\")\n    {\n    std::cerr << \"ctkVTKScalarBarWidget::setTitle() failed\"\n              << std::endl;\n    return EXIT_FAILURE;\n    }\n    \n  \/\/ labels format\n  widget.setLabelsFormat(\"@#$%^&*\");\n  if (QString(actor->GetLabelFormat()) != \"@#$%^&*\")\n    {\n    std::cerr << \"ctkVTKScalarBarWidget::setLabelsFormat() failed\"\n              << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  actor->SetLabelFormat(\"@#$%^&*@#$%^&*\");\n  if (widget.labelsFormat() != \"@#$%^&*@#$%^&*\")\n    {\n    std::cerr << \"ctkVTKScalarBarWidget::setLabelsFormat() failed\"\n              << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  widget.show();\n  \n  if (argc < 2 || QString(argv[1]) != \"-I\")\n    {\n    QTimer::singleShot(200, &app, SLOT(quit()));\n    }\n  return app.exec();\n}\n<commit_msg>Fix comparison warning between int and bool<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.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\/\/ Qt includes\n#include <QApplication>\n#include <QTimer>\n\n\/\/ CTK includes\n#include \"ctkVTKScalarBarWidget.h\"\n\n\/\/ VTK includes\n#include <vtkScalarBarActor.h>\n#include <vtkScalarBarWidget.h>\n#include <vtkSmartPointer.h>\n\n\/\/ STD includes\n#include <iostream>\n\n\/\/-----------------------------------------------------------------------------\nint ctkVTKScalarBarWidgetTest1(int argc, char * argv [] )\n{\n  QApplication app(argc, argv);\n\n  vtkSmartPointer<vtkScalarBarWidget> scalarBar =\n    vtkSmartPointer<vtkScalarBarWidget>::New();\n  vtkScalarBarActor* actor = scalarBar->GetScalarBarActor();\n\n  ctkVTKScalarBarWidget widget;\n  widget.setScalarBarWidget(scalarBar);\n  widget.setScalarBarWidget(0);\n  widget.setScalarBarWidget(scalarBar);\n\n  \/\/ display\n  widget.setDisplay(false);\n  if (scalarBar->GetEnabled() != false)\n    {\n    std::cerr << \"ctkVTKScalarBarWidget::setDisplay() failed\"\n              << std::endl;\n    return EXIT_FAILURE;\n    }\n  \/\/ it will fail as there is no interactor set to the widget\n  scalarBar->SetEnabled(true);\n  if (widget.display() != (scalarBar->GetEnabled() == 1))\n    {\n    std::cerr << \"ctkVTKScalarBarWidget::setDisplay() failed\"\n              << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  \/\/ max number of colors\n  widget.setMaxNumberOfColors(20);\n  if (actor->GetMaximumNumberOfColors() != 20)\n    {\n    std::cerr << \"ctkVTKScalarBarWidget::setMaxNumberOfColors() failed\"\n              << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  actor->SetMaximumNumberOfColors(30);\n  if (widget.maxNumberOfColors() != 30)\n    {\n    std::cerr << \"ctkVTKScalarBarWidget::setMaxNumberOfColors() failed\"\n              << std::endl;\n    return EXIT_FAILURE;\n    }\n  \n  \/\/ number of labels\n  widget.setNumberOfLabels(5);\n  if (actor->GetNumberOfLabels() != 5)\n    {\n    std::cerr << \"ctkVTKScalarBarWidget::setNumberOfLabels() failed\"\n              << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  actor->SetNumberOfLabels(10);\n  if (widget.numberOfLabels() != 10)\n    {\n    std::cerr << \"ctkVTKScalarBarWidget::setNumberOfLabels() failed\"\n              << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  \/\/ title\n  widget.setTitle(\"title\");\n  if (QString(actor->GetTitle()) != \"title\")\n    {\n    std::cerr << \"ctkVTKScalarBarWidget::setTitle() failed\"\n              << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  actor->SetTitle(\"title 2\");\n  if (widget.title() != \"title 2\")\n    {\n    std::cerr << \"ctkVTKScalarBarWidget::setTitle() failed\"\n              << std::endl;\n    return EXIT_FAILURE;\n    }\n    \n  \/\/ labels format\n  widget.setLabelsFormat(\"@#$%^&*\");\n  if (QString(actor->GetLabelFormat()) != \"@#$%^&*\")\n    {\n    std::cerr << \"ctkVTKScalarBarWidget::setLabelsFormat() failed\"\n              << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  actor->SetLabelFormat(\"@#$%^&*@#$%^&*\");\n  if (widget.labelsFormat() != \"@#$%^&*@#$%^&*\")\n    {\n    std::cerr << \"ctkVTKScalarBarWidget::setLabelsFormat() failed\"\n              << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  widget.show();\n  \n  if (argc < 2 || QString(argv[1]) != \"-I\")\n    {\n    QTimer::singleShot(200, &app, SLOT(quit()));\n    }\n  return app.exec();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"LotsOfLines\/CollocatedPairedCoordinatesVisualizationMethod.hpp\"\n#include <algorithm>\n\nusing namespace LotsOfLines;\n\nbool CollocatedPairedCoordinatesVisualizationMethod::generateVBO(std::shared_ptr<DataSet> dataSet, std::vector<Vertex>& verticesOut, std::vector<unsigned int>& indicesOut)\n{\n\tunsigned int numVectors = 0;\n\tunsigned int vectorSize = 0;\n\n\t\/\/Iterate over each data class and generate lines\n\tunsigned int classIdx = 0;\n\n\tfloat colors[][3] = {\n\t\t{ 1.0f, 0.0f, 0.0f },\n\t\t{ 0.0f, 1.0f, 0.0f },\n\t\t{ 0.0f, 0.0f, 1.0f }\n\t};\n\n\t\/\/ Get boundaries based off of first vector\n\tconst Vector& firstVec = dataSet->getVectors(*dataSet->getClasses().begin())[0];\n\tauto max = std::max_element(firstVec.begin(), firstVec.end());\n\tauto min = std::min_element(firstVec.begin(), firstVec.end());\n\tfloat diff = *max - *min;\n\tfloat width = 2.0f;\n\n\t\/\/ Scaling\n\tfloat interval = width \/ (diff - 1);\n\t\/\/ Shifting\n\tfloat shift[2] = {\n\t\tfirstVec[0] * interval * -1,\n\t\tfirstVec[1] ? firstVec[1] * interval * -1 : 0\n\t};\n\n\t\/\/Generate vertices for each data class\n\tfor (auto dataClass : dataSet->getClasses())\n\t{\n\t\tVectorClass vectors = dataSet->getVectors(dataClass);\n\t\tnumVectors += vectors.size();\n\n\t\tfor (unsigned int i = 0; i < vectors.size(); ++i)\n\t\t{\n\t\t\t\/\/Generate vertices to draw vector as line\n\t\t\tconst Vector& vec = vectors[i];\n\t\t\tvectorSize = vec.size();\n\n\t\t\tfor (unsigned int x = 1; x < vec.size(); x += 2)\n\t\t\t{\n\t\t\t\tVertex v(vec[x - 1] * interval + shift[0], vec[x] * interval + shift[1]);\n\t\t\t\tv.r = colors[classIdx][0];\n\t\t\t\tv.g = colors[classIdx][1];\n\t\t\t\tv.b = colors[classIdx][2];\n\t\t\t\tverticesOut.push_back(v);\n\t\t\t}\n\t\t}\n\n\t\tclassIdx++;\n\t}\n\n\t\/\/Generate indices for lines\n\tfor (unsigned int baseIndex = 0; baseIndex < numVectors; ++baseIndex)\n\t{\n\t\tfor (unsigned int i = 1; i < vectorSize; ++i)\n\t\t{\n\t\t\tindicesOut.push_back(i + (baseIndex * vectorSize) - 1);\n\t\t\tindicesOut.push_back(i + (baseIndex * vectorSize));\n\t\t}\n\t}\n\n\treturn true;\n}<commit_msg>Initial fix of indices<commit_after>#include \"LotsOfLines\/CollocatedPairedCoordinatesVisualizationMethod.hpp\"\n#include <algorithm>\n\nusing namespace LotsOfLines;\n\nbool CollocatedPairedCoordinatesVisualizationMethod::generateVBO(std::shared_ptr<DataSet> dataSet, std::vector<Vertex>& verticesOut, std::vector<unsigned int>& indicesOut)\n{\n\tunsigned int numVectors = 0;\n\tunsigned int vectorSize = 0;\n\n\t\/\/Iterate over each data class and generate lines\n\tunsigned int classIdx = 0;\n\n\tfloat colors[][3] = {\n\t\t{ 1.0f, 0.0f, 0.0f },\n\t\t{ 0.0f, 1.0f, 0.0f },\n\t\t{ 0.0f, 0.0f, 1.0f }\n\t};\n\n\t\/\/ Get boundaries based off of first vector\n\tconst Vector& firstVec = dataSet->getVectors(*dataSet->getClasses().begin())[0];\n\tauto max = std::max_element(firstVec.begin(), firstVec.end());\n\tauto min = std::min_element(firstVec.begin(), firstVec.end());\n\tfloat diff = *max - *min;\n\tfloat width = 2.0f;\n\n\t\/\/ Scaling\n\tfloat interval = width \/ (diff - 1);\n\t\/\/ Shifting\n\tfloat shift[2] = {\n\t\tfirstVec[0] * interval * -1,\n\t\tfirstVec[1] ? firstVec[1] * interval * -1 : 0\n\t};\n\n\t\/\/Generate vertices for each data class\n\tfor (auto dataClass : dataSet->getClasses())\n\t{\n\t\tVectorClass vectors = dataSet->getVectors(dataClass);\n\t\tnumVectors += vectors.size();\n\n\t\tfor (unsigned int i = 0; i < vectors.size(); ++i)\n\t\t{\n\t\t\t\/\/Generate vertices to draw vector as line\n\t\t\tconst Vector& vec = vectors[i];\n\t\t\tvectorSize = vec.size();\n\n\t\t\tfor (unsigned int x = 1; x < vec.size(); x += 2)\n\t\t\t{\n\t\t\t\tVertex v(vec[x - 1] * interval + shift[0], vec[x] * interval + shift[1]);\n\t\t\t\tv.r = colors[classIdx][0];\n\t\t\t\tv.g = colors[classIdx][1];\n\t\t\t\tv.b = colors[classIdx][2];\n\t\t\t\tverticesOut.push_back(v);\n\t\t\t}\n\t\t}\n\n\t\tclassIdx++;\n\t}\n\n\t\/\/Generate indices for lines\n\tfor (unsigned int baseIndex = 0; baseIndex < numVectors; ++baseIndex)\n\t{\n\t\tfor (unsigned int i = 1; i < vectorSize; ++i)\n\t\t{\n\t\t\tif ((i + (baseIndex * vectorSize)) % (vectorSize \/ 2) != 0) {\n\t\t\t\tindicesOut.push_back(i + (baseIndex * vectorSize) - 1);\n\t\t\t\tindicesOut.push_back(i + (baseIndex * vectorSize));\n\t\t\t}\n\t\t}\n\t}\n\n\treturn true;\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 \"content\/browser\/android\/in_process\/synchronous_compositor_factory_impl.h\"\n\n#include \"content\/browser\/android\/in_process\/synchronous_compositor_output_surface.h\"\n#include \"content\/public\/browser\/browser_thread.h\"\n#include \"content\/renderer\/gpu\/frame_swap_message_queue.h\"\n#include \"gpu\/command_buffer\/client\/gl_in_process_context.h\"\n#include \"gpu\/command_buffer\/common\/gles2_cmd_utils.h\"\n#include \"ui\/gl\/android\/surface_texture.h\"\n#include \"ui\/gl\/gl_surface.h\"\n#include \"ui\/gl\/gl_surface_stub.h\"\n#include \"webkit\/common\/gpu\/context_provider_in_process.h\"\n#include \"webkit\/common\/gpu\/webgraphicscontext3d_in_process_command_buffer_impl.h\"\n\nusing webkit::gpu::ContextProviderWebContext;\n\nnamespace content {\n\nnamespace {\n\nblink::WebGraphicsContext3D::Attributes GetDefaultAttribs() {\n  blink::WebGraphicsContext3D::Attributes attributes;\n  attributes.antialias = false;\n  attributes.depth = false;\n  attributes.stencil = false;\n  attributes.shareResources = true;\n  attributes.noAutomaticFlushes = true;\n\n  return attributes;\n}\n\nusing webkit::gpu::WebGraphicsContext3DInProcessCommandBufferImpl;\nusing webkit::gpu::WebGraphicsContext3DImpl;\n\nscoped_ptr<gpu::GLInProcessContext> CreateOffscreenContext(\n    const blink::WebGraphicsContext3D::Attributes& attributes) {\n  const gfx::GpuPreference gpu_preference = gfx::PreferDiscreteGpu;\n\n  gpu::gles2::ContextCreationAttribHelper in_process_attribs;\n  WebGraphicsContext3DImpl::ConvertAttributes(\n      attributes, &in_process_attribs);\n  in_process_attribs.lose_context_when_out_of_memory = true;\n\n  scoped_ptr<gpu::GLInProcessContext> context(\n      gpu::GLInProcessContext::Create(NULL \/* service *\/,\n                                      NULL \/* surface *\/,\n                                      true \/* is_offscreen *\/,\n                                      gfx::kNullAcceleratedWidget,\n                                      gfx::Size(1, 1),\n                                      NULL \/* share_context *\/,\n                                      false \/* share_resources *\/,\n                                      in_process_attribs,\n                                      gpu_preference));\n  return context.Pass();\n}\n\nscoped_ptr<gpu::GLInProcessContext> CreateContext(\n    scoped_refptr<gpu::InProcessCommandBuffer::Service> service,\n    gpu::GLInProcessContext* share_context) {\n  const gfx::GpuPreference gpu_preference = gfx::PreferDiscreteGpu;\n  gpu::gles2::ContextCreationAttribHelper in_process_attribs;\n  WebGraphicsContext3DImpl::ConvertAttributes(\n      GetDefaultAttribs(), &in_process_attribs);\n  in_process_attribs.lose_context_when_out_of_memory = true;\n\n  scoped_ptr<gpu::GLInProcessContext> context(\n      gpu::GLInProcessContext::Create(service,\n                                      NULL \/* surface *\/,\n                                      false \/* is_offscreen *\/,\n                                      gfx::kNullAcceleratedWidget,\n                                      gfx::Size(1, 1),\n                                      share_context,\n                                      false \/* share_resources *\/,\n                                      in_process_attribs,\n                                      gpu_preference));\n  return context.Pass();\n}\n\nscoped_ptr<WebGraphicsContext3DInProcessCommandBufferImpl> WrapContext(\n    scoped_ptr<gpu::GLInProcessContext> context) {\n  if (!context.get())\n    return scoped_ptr<WebGraphicsContext3DInProcessCommandBufferImpl>();\n\n  return scoped_ptr<WebGraphicsContext3DInProcessCommandBufferImpl>(\n      WebGraphicsContext3DInProcessCommandBufferImpl::WrapContext(\n          context.Pass(), GetDefaultAttribs()));\n}\n\nscoped_ptr<WebGraphicsContext3DInProcessCommandBufferImpl>\nWrapContextWithAttributes(\n    scoped_ptr<gpu::GLInProcessContext> context,\n    const blink::WebGraphicsContext3D::Attributes& attributes) {\n  if (!context.get())\n    return scoped_ptr<WebGraphicsContext3DInProcessCommandBufferImpl>();\n\n  return scoped_ptr<WebGraphicsContext3DInProcessCommandBufferImpl>(\n      WebGraphicsContext3DInProcessCommandBufferImpl::WrapContext(\n          context.Pass(), attributes));\n}\n\nclass VideoContextProvider\n    : public StreamTextureFactorySynchronousImpl::ContextProvider {\n public:\n  VideoContextProvider(\n      scoped_ptr<gpu::GLInProcessContext> gl_in_process_context)\n      : gl_in_process_context_(gl_in_process_context.get()) {\n\n    context_provider_ = webkit::gpu::ContextProviderInProcess::Create(\n        WrapContext(gl_in_process_context.Pass()),\n        \"Video-Offscreen-main-thread\");\n    context_provider_->BindToCurrentThread();\n  }\n\n  virtual scoped_refptr<gfx::SurfaceTexture> GetSurfaceTexture(\n      uint32 stream_id) OVERRIDE {\n    return gl_in_process_context_->GetSurfaceTexture(stream_id);\n  }\n\n  virtual gpu::gles2::GLES2Interface* ContextGL() OVERRIDE {\n    return context_provider_->ContextGL();\n  }\n\n private:\n  friend class base::RefCountedThreadSafe<VideoContextProvider>;\n  virtual ~VideoContextProvider() {}\n\n  scoped_refptr<cc::ContextProvider> context_provider_;\n  gpu::GLInProcessContext* gl_in_process_context_;\n\n  DISALLOW_COPY_AND_ASSIGN(VideoContextProvider);\n};\n\n}  \/\/ namespace\n\nusing webkit::gpu::WebGraphicsContext3DInProcessCommandBufferImpl;\n\nSynchronousCompositorFactoryImpl::SynchronousCompositorFactoryImpl()\n    : record_full_layer_(true),\n      num_hardware_compositors_(0) {\n  SynchronousCompositorFactory::SetInstance(this);\n}\n\nSynchronousCompositorFactoryImpl::~SynchronousCompositorFactoryImpl() {}\n\nscoped_refptr<base::MessageLoopProxy>\nSynchronousCompositorFactoryImpl::GetCompositorMessageLoop() {\n  return BrowserThread::GetMessageLoopProxyForThread(BrowserThread::UI);\n}\n\nbool\nSynchronousCompositorFactoryImpl::RecordFullLayer() {\n  return record_full_layer_;\n}\n\nscoped_ptr<cc::OutputSurface>\nSynchronousCompositorFactoryImpl::CreateOutputSurface(\n    int routing_id,\n    scoped_refptr<content::FrameSwapMessageQueue> frame_swap_message_queue) {\n  scoped_ptr<SynchronousCompositorOutputSurface> output_surface(\n      new SynchronousCompositorOutputSurface(routing_id,\n                                             frame_swap_message_queue));\n  return output_surface.PassAs<cc::OutputSurface>();\n}\n\nInputHandlerManagerClient*\nSynchronousCompositorFactoryImpl::GetInputHandlerManagerClient() {\n  return synchronous_input_event_filter();\n}\n\nscoped_refptr<ContextProviderWebContext>\nSynchronousCompositorFactoryImpl::CreateOffscreenContextProvider(\n    const blink::WebGraphicsContext3D::Attributes& attributes,\n    const std::string& debug_name) {\n  scoped_ptr<gpu::GLInProcessContext> context =\n      CreateOffscreenContext(attributes);\n  return webkit::gpu::ContextProviderInProcess::Create(\n      WrapContext(context.Pass()), debug_name);\n}\n\nscoped_refptr<cc::ContextProvider> SynchronousCompositorFactoryImpl::\n    CreateOnscreenContextProviderForCompositorThread() {\n  DCHECK(service_);\n\n  if (!share_context_.get())\n    share_context_ = CreateContext(service_, NULL);\n  return webkit::gpu::ContextProviderInProcess::Create(\n      WrapContext(CreateContext(service_, share_context_.get())),\n      \"Child-Compositor\");\n}\n\ngpu::GLInProcessContext* SynchronousCompositorFactoryImpl::GetShareContext() {\n  DCHECK(share_context_.get());\n  return share_context_.get();\n}\n\nscoped_refptr<StreamTextureFactory>\nSynchronousCompositorFactoryImpl::CreateStreamTextureFactory(int frame_id) {\n  scoped_refptr<StreamTextureFactorySynchronousImpl> factory(\n      StreamTextureFactorySynchronousImpl::Create(\n          base::Bind(\n              &SynchronousCompositorFactoryImpl::TryCreateStreamTextureFactory,\n              base::Unretained(this)),\n          frame_id));\n  return factory;\n}\n\nblink::WebGraphicsContext3D*\nSynchronousCompositorFactoryImpl::CreateOffscreenGraphicsContext3D(\n    const blink::WebGraphicsContext3D::Attributes& attributes) {\n  return WrapContextWithAttributes(CreateOffscreenContext(attributes),\n                                   attributes).release();\n}\n\nvoid SynchronousCompositorFactoryImpl::CompositorInitializedHardwareDraw() {\n  base::AutoLock lock(num_hardware_compositor_lock_);\n  num_hardware_compositors_++;\n}\n\nvoid SynchronousCompositorFactoryImpl::CompositorReleasedHardwareDraw() {\n  base::AutoLock lock(num_hardware_compositor_lock_);\n  DCHECK_GT(num_hardware_compositors_, 0u);\n  num_hardware_compositors_--;\n}\n\nbool SynchronousCompositorFactoryImpl::CanCreateMainThreadContext() {\n  base::AutoLock lock(num_hardware_compositor_lock_);\n  return num_hardware_compositors_ > 0;\n}\n\nscoped_refptr<StreamTextureFactorySynchronousImpl::ContextProvider>\nSynchronousCompositorFactoryImpl::TryCreateStreamTextureFactory() {\n  scoped_refptr<StreamTextureFactorySynchronousImpl::ContextProvider>\n      context_provider;\n  \/\/ This check only guarantees the main thread context is created after\n  \/\/ a compositor did successfully initialize hardware draw in the past.\n  \/\/ In particular this does not guarantee that the main thread context\n  \/\/ will fail creation when all compositors release hardware draw.\n  if (CanCreateMainThreadContext() && !video_context_provider_) {\n    DCHECK(service_);\n    DCHECK(share_context_.get());\n\n    video_context_provider_ = new VideoContextProvider(\n        CreateContext(service_, share_context_.get()));\n  }\n  return video_context_provider_;\n}\n\nvoid SynchronousCompositorFactoryImpl::SetDeferredGpuService(\n    scoped_refptr<gpu::InProcessCommandBuffer::Service> service) {\n  DCHECK(!service_);\n  service_ = service;\n}\n\nvoid SynchronousCompositorFactoryImpl::SetRecordFullDocument(\n    bool record_full_document) {\n  record_full_layer_ = record_full_document;\n}\n\n}  \/\/ namespace content\n<commit_msg>Nullify video context provider when there is no harware compositor.<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 \"content\/browser\/android\/in_process\/synchronous_compositor_factory_impl.h\"\n\n#include \"content\/browser\/android\/in_process\/synchronous_compositor_output_surface.h\"\n#include \"content\/public\/browser\/browser_thread.h\"\n#include \"content\/renderer\/gpu\/frame_swap_message_queue.h\"\n#include \"gpu\/command_buffer\/client\/gl_in_process_context.h\"\n#include \"gpu\/command_buffer\/common\/gles2_cmd_utils.h\"\n#include \"ui\/gl\/android\/surface_texture.h\"\n#include \"ui\/gl\/gl_surface.h\"\n#include \"ui\/gl\/gl_surface_stub.h\"\n#include \"webkit\/common\/gpu\/context_provider_in_process.h\"\n#include \"webkit\/common\/gpu\/webgraphicscontext3d_in_process_command_buffer_impl.h\"\n\nusing webkit::gpu::ContextProviderWebContext;\n\nnamespace content {\n\nnamespace {\n\nblink::WebGraphicsContext3D::Attributes GetDefaultAttribs() {\n  blink::WebGraphicsContext3D::Attributes attributes;\n  attributes.antialias = false;\n  attributes.depth = false;\n  attributes.stencil = false;\n  attributes.shareResources = true;\n  attributes.noAutomaticFlushes = true;\n\n  return attributes;\n}\n\nusing webkit::gpu::WebGraphicsContext3DInProcessCommandBufferImpl;\nusing webkit::gpu::WebGraphicsContext3DImpl;\n\nscoped_ptr<gpu::GLInProcessContext> CreateOffscreenContext(\n    const blink::WebGraphicsContext3D::Attributes& attributes) {\n  const gfx::GpuPreference gpu_preference = gfx::PreferDiscreteGpu;\n\n  gpu::gles2::ContextCreationAttribHelper in_process_attribs;\n  WebGraphicsContext3DImpl::ConvertAttributes(\n      attributes, &in_process_attribs);\n  in_process_attribs.lose_context_when_out_of_memory = true;\n\n  scoped_ptr<gpu::GLInProcessContext> context(\n      gpu::GLInProcessContext::Create(NULL \/* service *\/,\n                                      NULL \/* surface *\/,\n                                      true \/* is_offscreen *\/,\n                                      gfx::kNullAcceleratedWidget,\n                                      gfx::Size(1, 1),\n                                      NULL \/* share_context *\/,\n                                      false \/* share_resources *\/,\n                                      in_process_attribs,\n                                      gpu_preference));\n  return context.Pass();\n}\n\nscoped_ptr<gpu::GLInProcessContext> CreateContext(\n    scoped_refptr<gpu::InProcessCommandBuffer::Service> service,\n    gpu::GLInProcessContext* share_context) {\n  const gfx::GpuPreference gpu_preference = gfx::PreferDiscreteGpu;\n  gpu::gles2::ContextCreationAttribHelper in_process_attribs;\n  WebGraphicsContext3DImpl::ConvertAttributes(\n      GetDefaultAttribs(), &in_process_attribs);\n  in_process_attribs.lose_context_when_out_of_memory = true;\n\n  scoped_ptr<gpu::GLInProcessContext> context(\n      gpu::GLInProcessContext::Create(service,\n                                      NULL \/* surface *\/,\n                                      false \/* is_offscreen *\/,\n                                      gfx::kNullAcceleratedWidget,\n                                      gfx::Size(1, 1),\n                                      share_context,\n                                      false \/* share_resources *\/,\n                                      in_process_attribs,\n                                      gpu_preference));\n  return context.Pass();\n}\n\nscoped_ptr<WebGraphicsContext3DInProcessCommandBufferImpl> WrapContext(\n    scoped_ptr<gpu::GLInProcessContext> context) {\n  if (!context.get())\n    return scoped_ptr<WebGraphicsContext3DInProcessCommandBufferImpl>();\n\n  return scoped_ptr<WebGraphicsContext3DInProcessCommandBufferImpl>(\n      WebGraphicsContext3DInProcessCommandBufferImpl::WrapContext(\n          context.Pass(), GetDefaultAttribs()));\n}\n\nscoped_ptr<WebGraphicsContext3DInProcessCommandBufferImpl>\nWrapContextWithAttributes(\n    scoped_ptr<gpu::GLInProcessContext> context,\n    const blink::WebGraphicsContext3D::Attributes& attributes) {\n  if (!context.get())\n    return scoped_ptr<WebGraphicsContext3DInProcessCommandBufferImpl>();\n\n  return scoped_ptr<WebGraphicsContext3DInProcessCommandBufferImpl>(\n      WebGraphicsContext3DInProcessCommandBufferImpl::WrapContext(\n          context.Pass(), attributes));\n}\n\nclass VideoContextProvider\n    : public StreamTextureFactorySynchronousImpl::ContextProvider {\n public:\n  VideoContextProvider(\n      scoped_ptr<gpu::GLInProcessContext> gl_in_process_context)\n      : gl_in_process_context_(gl_in_process_context.get()) {\n\n    context_provider_ = webkit::gpu::ContextProviderInProcess::Create(\n        WrapContext(gl_in_process_context.Pass()),\n        \"Video-Offscreen-main-thread\");\n    context_provider_->BindToCurrentThread();\n  }\n\n  virtual scoped_refptr<gfx::SurfaceTexture> GetSurfaceTexture(\n      uint32 stream_id) OVERRIDE {\n    return gl_in_process_context_->GetSurfaceTexture(stream_id);\n  }\n\n  virtual gpu::gles2::GLES2Interface* ContextGL() OVERRIDE {\n    return context_provider_->ContextGL();\n  }\n\n private:\n  friend class base::RefCountedThreadSafe<VideoContextProvider>;\n  virtual ~VideoContextProvider() {}\n\n  scoped_refptr<cc::ContextProvider> context_provider_;\n  gpu::GLInProcessContext* gl_in_process_context_;\n\n  DISALLOW_COPY_AND_ASSIGN(VideoContextProvider);\n};\n\n}  \/\/ namespace\n\nusing webkit::gpu::WebGraphicsContext3DInProcessCommandBufferImpl;\n\nSynchronousCompositorFactoryImpl::SynchronousCompositorFactoryImpl()\n    : record_full_layer_(true),\n      num_hardware_compositors_(0) {\n  SynchronousCompositorFactory::SetInstance(this);\n}\n\nSynchronousCompositorFactoryImpl::~SynchronousCompositorFactoryImpl() {}\n\nscoped_refptr<base::MessageLoopProxy>\nSynchronousCompositorFactoryImpl::GetCompositorMessageLoop() {\n  return BrowserThread::GetMessageLoopProxyForThread(BrowserThread::UI);\n}\n\nbool\nSynchronousCompositorFactoryImpl::RecordFullLayer() {\n  return record_full_layer_;\n}\n\nscoped_ptr<cc::OutputSurface>\nSynchronousCompositorFactoryImpl::CreateOutputSurface(\n    int routing_id,\n    scoped_refptr<content::FrameSwapMessageQueue> frame_swap_message_queue) {\n  scoped_ptr<SynchronousCompositorOutputSurface> output_surface(\n      new SynchronousCompositorOutputSurface(routing_id,\n                                             frame_swap_message_queue));\n  return output_surface.PassAs<cc::OutputSurface>();\n}\n\nInputHandlerManagerClient*\nSynchronousCompositorFactoryImpl::GetInputHandlerManagerClient() {\n  return synchronous_input_event_filter();\n}\n\nscoped_refptr<ContextProviderWebContext>\nSynchronousCompositorFactoryImpl::CreateOffscreenContextProvider(\n    const blink::WebGraphicsContext3D::Attributes& attributes,\n    const std::string& debug_name) {\n  scoped_ptr<gpu::GLInProcessContext> context =\n      CreateOffscreenContext(attributes);\n  return webkit::gpu::ContextProviderInProcess::Create(\n      WrapContext(context.Pass()), debug_name);\n}\n\nscoped_refptr<cc::ContextProvider> SynchronousCompositorFactoryImpl::\n    CreateOnscreenContextProviderForCompositorThread() {\n  DCHECK(service_);\n\n  if (!share_context_.get())\n    share_context_ = CreateContext(service_, NULL);\n  return webkit::gpu::ContextProviderInProcess::Create(\n      WrapContext(CreateContext(service_, share_context_.get())),\n      \"Child-Compositor\");\n}\n\ngpu::GLInProcessContext* SynchronousCompositorFactoryImpl::GetShareContext() {\n  DCHECK(share_context_.get());\n  return share_context_.get();\n}\n\nscoped_refptr<StreamTextureFactory>\nSynchronousCompositorFactoryImpl::CreateStreamTextureFactory(int frame_id) {\n  scoped_refptr<StreamTextureFactorySynchronousImpl> factory(\n      StreamTextureFactorySynchronousImpl::Create(\n          base::Bind(\n              &SynchronousCompositorFactoryImpl::TryCreateStreamTextureFactory,\n              base::Unretained(this)),\n          frame_id));\n  return factory;\n}\n\nblink::WebGraphicsContext3D*\nSynchronousCompositorFactoryImpl::CreateOffscreenGraphicsContext3D(\n    const blink::WebGraphicsContext3D::Attributes& attributes) {\n  return WrapContextWithAttributes(CreateOffscreenContext(attributes),\n                                   attributes).release();\n}\n\nvoid SynchronousCompositorFactoryImpl::CompositorInitializedHardwareDraw() {\n  base::AutoLock lock(num_hardware_compositor_lock_);\n  num_hardware_compositors_++;\n}\n\nvoid SynchronousCompositorFactoryImpl::CompositorReleasedHardwareDraw() {\n  base::AutoLock lock(num_hardware_compositor_lock_);\n  DCHECK_GT(num_hardware_compositors_, 0u);\n  num_hardware_compositors_--;\n  if (num_hardware_compositors_ == 0) {\n    \/\/ Nullify the video_context_provider_ now so that it is not null only if\n    \/\/ there is at least 1 hardware compositor\n    video_context_provider_ = NULL;\n  }\n}\n\nbool SynchronousCompositorFactoryImpl::CanCreateMainThreadContext() {\n  base::AutoLock lock(num_hardware_compositor_lock_);\n  return num_hardware_compositors_ > 0;\n}\n\nscoped_refptr<StreamTextureFactorySynchronousImpl::ContextProvider>\nSynchronousCompositorFactoryImpl::TryCreateStreamTextureFactory() {\n  scoped_refptr<StreamTextureFactorySynchronousImpl::ContextProvider>\n      context_provider;\n  \/\/ This check only guarantees the main thread context is created after\n  \/\/ a compositor did successfully initialize hardware draw in the past.\n  \/\/ When all compositors have released hardware draw, main thread context\n  \/\/ creation is guaranteed to fail.\n  if (CanCreateMainThreadContext() && !video_context_provider_) {\n    DCHECK(service_);\n    DCHECK(share_context_.get());\n\n    video_context_provider_ = new VideoContextProvider(\n        CreateContext(service_, share_context_.get()));\n  }\n  return video_context_provider_;\n}\n\nvoid SynchronousCompositorFactoryImpl::SetDeferredGpuService(\n    scoped_refptr<gpu::InProcessCommandBuffer::Service> service) {\n  DCHECK(!service_);\n  service_ = service;\n}\n\nvoid SynchronousCompositorFactoryImpl::SetRecordFullDocument(\n    bool record_full_document) {\n  record_full_layer_ = record_full_document;\n}\n\n}  \/\/ namespace content\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Write back some info during GenerateProblem<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>fixed Scheimpflug typo<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>AFP_GTK: fix some parameter typos<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\nMIT License\n\nCopyright (c) 2017 Chris McArthur, prince.chrismc(at)gmail(dot)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 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 <string>\n#include <iostream>\n#include <vector>\n#include <cmath>\n#include <sstream>\n\n#include \"glm\/gtc\/matrix_transform.hpp\" \/\/glm::lookAt, scale, etc...\n#include \"GL\/glew.h\"                    \/\/ include GL Extension Wrangler\n#include \"CImg.h\"\n\n#include \"GlfwWindow.h\"\n#include \"Shader.h\"\n#include \"Camera.h\"\n#include \"Cursor.h\"\n\nusing cimg_library::CImg;\nusing cimg_library::CImgDisplay;\n\n\/\/enums\nenum class RenderMode { POINTS = GL_POINTS, LINES = GL_LINES, TRIANGLES = GL_TRIANGLES };\n\n\/\/ Function Declaration\nconst unsigned int GetUserInputMultiple(const unsigned int& lower, const unsigned int& upper, const unsigned int& multiple);\nvoid key_callback(GLFWwindow* window, int key, int scancode, int action, int mode);\nvoid mouse_callback(GLFWwindow* window, int button, int action, int mods);\nvoid cursor_callback(GLFWwindow* window, double xpos, double ypos);\n\n\/\/ Globals\nCamera g_Camera;\nCursor g_Cursor;\nRenderMode g_RenderMode;\n\nint main()\n{\n   std::cout << \"Welcome to Image Height Map Generator!\" << std::endl;\n\n   std::cout << std::endl << \"Please Select a skip size: (multiple of 5) recommended: 20\" << std::endl;\n   unsigned int skip_size = GetUserInputMultiple(0, 65, 5);\n\n   \/\/ Create a GLFWwindow\n   GlfwWindow window(\"Image Height Map by Christopher McArthur\", GlfwWindow::DEFAULT_WIDTH, GlfwWindow::DEFAULT_HEIGHT);\n   if (!window()) \/\/ Make sure it exists\n   {\n      return -1;\n   }\n\n   \/\/ Set the required callback functions\n   window.SetKeyCallback(key_callback);\n   window.SetMouseButtonCallback(mouse_callback);\n   window.SetCursorPosCallback(cursor_callback);\n\n   \/\/glEnable(GL_DEPTH_TEST);\n   \/\/glDepthFunc(GL_LESS);\n\n   \/\/ Set this to true so GLEW knows to use a modern approach to retrieving function pointers and extensions\n   glewExperimental = GL_TRUE;\n   \/\/ Initialize GLEW to setup the OpenGL Function pointers\n   if (glewInit() != GLEW_OK)\n   {\n      std::cout << \"Failed to initialize GLEW\" << std::endl;\n      return -1;\n   }\n\n   \/\/glEnable(GL_DEPTH_TEST);\n   \/\/glDepthFunc(GL_GEQUAL);\n\n   \/\/ Build and compile our shader program\n   VertexShader vertexShader(\"shaders\/vertex.shader\");\n   FragmentShader fragmentShader(\"shaders\/fragment.shader\");\n   if (!vertexShader() || !fragmentShader()) \/\/ make sure they are ready to use\n   {\n      return -1;\n   }\n\n   ShaderLinker* shaderProgram = &ShaderLinker::GetInstance();\n   if (!shaderProgram->Link(&vertexShader, &fragmentShader))\n   {\n      return -1;\n   }\n\n   GLuint PositonIndex = shaderProgram->GetAttributeLocation(\"position\");\n   GLuint ColorIndex = shaderProgram->GetAttributeLocation(\"color\");\n\n   \/\/ Constant vectors\n   const glm::vec3 center(0.0f, 0.0f, 0.0f);\n   const glm::vec3 up(0.0f, 1.0f, 0.0f);\n   const glm::vec3 eye(0.0f, 35.0f, 35.0f);\n\n   \/\/ Setup global camera\n   g_Camera = Camera(center, up, eye);\n\n\n   \/\/ ---------------------------------------------------------------------------------------------\n   std::cout << \"Processing image....\";\n   CImg<float> image(\"assets\/depth.bmp\");         \/\/ load the image\n   CImgDisplay display(image, \"Image\");           \/\/ create window displaying image\n\n   std::vector<glm::vec3> verticies_all;\n   std::vector<glm::vec3> colors_all;\n\n   std::vector<glm::vec3> verticies_skip;\n   std::vector<glm::vec3> colors_skip;\n   std::vector<GLuint> indinces_skip;\n\n   int img_half_width = image.width() \/ 2;\n   int img_half_heigth = image.height() \/ 2;\n\n   for (int x = (0 - img_half_width); x < img_half_width; x += 1)\n   {\n      for (int z = (0 - img_half_heigth); z < img_half_heigth; z += 1)\n      {\n         double pixel_value = static_cast<double>(*image.data(x + img_half_width, z + img_half_heigth));\n         verticies_all.emplace_back(glm::vec3(x, pixel_value, z));\n         if(x % skip_size == 0) { verticies_skip.emplace_back(glm::vec3(x, pixel_value, z)); indinces_skip.emplace_back((GLuint)verticies_skip.size()-1); }\n\n         unsigned long colorValue = static_cast<unsigned long>(std::floor(std::pow(pixel_value, 2.0))); \/\/ blue to green\n         colors_all.emplace_back(glm::vec3(((colorValue & 0xff0000) >> 16)\/255.0, ((colorValue & 0x00ff00) >> 8)\/255.0, (colorValue & 0x0000ff)\/255.0));\n         if (x % skip_size == 0) colors_skip.emplace_back(glm::vec3(((colorValue & 0xff0000) >> 16) \/ 255.0, ((colorValue & 0x00ff00) >> 8) \/ 255.0, (colorValue & 0x0000ff) \/ 255.0));\n      }\n   }\n   std::cout << \"  Completed!\" << std::endl;\n\n   \/*GLuint VAO_all_pts, VBO_all_pts, VBO_all_color;\n   glGenVertexArrays(1, &VAO_all_pts);\n   glBindVertexArray(VAO_all_pts);\n\n   glGenBuffers(1, &VBO_all_pts);\n   glBindBuffer(GL_ARRAY_BUFFER, VBO_all_pts);\n   glBufferData(GL_ARRAY_BUFFER, verticies_all.size() * sizeof(glm::vec3), &verticies_all.front(), GL_STATIC_DRAW);\n   glVertexAttribPointer(PositonIndex, 3, GL_FLOAT, GL_FALSE, 3 * sizeof(GLfloat), (GLvoid*)0);\n   glEnableVertexAttribArray(PositonIndex);\n   glBindBuffer(GL_ARRAY_BUFFER, 0);\n\n   glGenBuffers(1, &VBO_all_color);\n   glBindBuffer(GL_ARRAY_BUFFER, VBO_all_color);\n   glBufferData(GL_ARRAY_BUFFER, colors_all.size() * sizeof(glm::vec3), &colors_all.front(), GL_STATIC_DRAW);\n   glVertexAttribPointer(ColorIndex, 3, GL_FLOAT, GL_FALSE, 3 * sizeof(GLfloat), (GLvoid*)0);\n   glEnableVertexAttribArray(ColorIndex);\n   glBindBuffer(GL_ARRAY_BUFFER, 0);\n\n   glBindVertexArray(0);*\/\n\n   GLuint VAO_skip_pts, VBO_skip_pts, VBO_skip_color, IBO_skip;\n   glGenVertexArrays(1, &VAO_skip_pts);\n   glBindVertexArray(VAO_skip_pts);\n\n   glGenBuffers(1, &VBO_skip_pts);\n   glBindBuffer(GL_ARRAY_BUFFER, VBO_skip_pts);\n   glBufferData(GL_ARRAY_BUFFER, verticies_skip.size() * sizeof(glm::vec3), &verticies_skip.front(), GL_STATIC_DRAW);\n   glVertexAttribPointer(PositonIndex, 3, GL_FLOAT, GL_FALSE, 3 * sizeof(GLfloat), (GLvoid*)0);\n   glEnableVertexAttribArray(PositonIndex);\n   glBindBuffer(GL_ARRAY_BUFFER, 0);\n\n   glGenBuffers(1, &VBO_skip_color);\n   glBindBuffer(GL_ARRAY_BUFFER, VBO_skip_color);\n   glBufferData(GL_ARRAY_BUFFER, colors_skip.size() * sizeof(glm::vec3), &colors_skip.front(), GL_STATIC_DRAW);\n   glVertexAttribPointer(ColorIndex, 3, GL_FLOAT, GL_FALSE, 3 * sizeof(GLfloat), (GLvoid*)0);\n   glEnableVertexAttribArray(ColorIndex);\n   glBindBuffer(GL_ARRAY_BUFFER, 0);\n\n   glGenBuffers(1, &IBO_skip);\n   glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, IBO_skip);\n   glBufferData(GL_ELEMENT_ARRAY_BUFFER, indinces_skip.size() * sizeof(GLuint), &indinces_skip.front(), GL_STATIC_DRAW);\n   glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, 0);\n\n   glBindVertexArray(0);\n   \/\/ ---------------------------------------------------------------------------------------------\n\n\n   \/\/ Game loop\n   while (! ~window)\n   {\n      \/\/ Check if any events have been activiated (key pressed, mouse moved etc.) and call corresponding response functions\n      glfwPollEvents();\n\n      \/\/ Render\n      \/\/ Clear the colorbuffer\n      glClearColor(0.05f, 0.075f, 0.075f, 1.0f); \/\/ near black teal\n      glClear(GL_COLOR_BUFFER_BIT \/*| GL_DEPTH_BUFFER_BIT*\/);\n\n      shaderProgram->SetShaderMat4(\"view_matrix\", g_Camera.GetViewMatrix());\n\n      shaderProgram->SetShaderMat4(\"projection_matrix\", window.GetProjectionMatrix());\n\n      glm::mat4 model_matrix = glm::scale(glm::mat4(), glm::vec3(0.05f));\n      shaderProgram->SetShaderMat4(\"model_matrix\", model_matrix);\n\n      glBindVertexArray(VAO_skip_pts);\n      glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, IBO_skip);\n      \/\/glDrawArrays((GLuint)g_RenderMode, 0, (GLsizei)verticies_skip.size());\n      glDrawElements(GL_TRIANGLES, indinces_skip.size(), GL_UNSIGNED_INT, NULL);\n      glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, 0);\n      glBindVertexArray(0);\n\n      ++window; \/\/ swap buffers\n   }\n\n   return 0;\n}\n\n\/\/ ------------------------------------------------------------------------------------------------ \/\/\n\/\/                                          UTILITY CODE                                          - \/\/\n\/\/ ------------------------------------------------------------------------------------------------ \/\/\n\n\/\/\/ copied from another project https:\/\/github.com\/prince-chrismc\/Pandemic\/blob\/master\/Pandemic\/Sources\/GameEngine.cpp small modifications\nconst unsigned int GetUserInputMultiple(const unsigned int& lower, const unsigned int& upper, const unsigned int& multiple)\n{\n   uint16_t selection = 0;\n   do\n   {\n      std::cout << \"Selcetion: \";\n      std::string input;\n      std::getline(std::cin, input);\n      std::stringstream ss(input);\n      ss >> selection;\n\n      if (selection < lower || selection > upper || selection % multiple != 0)\n         std::cout << \"Invalid option. Please Try again...\" << std::endl;\n\n   } while (selection < lower || selection > upper || selection % multiple != 0);\n\n   return selection;\n}\n\n\/\/ ------------------------------------------------------------------------------------------------ \/\/\n\/\/                                      CALLBACK FUNCTIONS                                        - \/\/\n\/\/ ------------------------------------------------------------------------------------------------ \/\/\n\n\/\/ Is called whenever a key is pressed\/released via GLFW\nvoid key_callback(GLFWwindow* window, int key, int scancode, int action, int mode)\n{\n   \/\/ we are only concerned about key presses not releases\n   if (action != GLFW_PRESS)\n      return;\n\n   \/\/ lets print the key in human readable if possible\n   const char* keyname = glfwGetKeyName(key, scancode); \/\/ function found at https:\/\/github.com\/glfw\/glfw\/pull\/117\n   if (keyname)\n      std::cout << keyname << std::endl;\n   else\n      std::cout << key << std::endl;\n\n   switch (key)\n   {\n      \/\/ windows close\n   case GLFW_KEY_ESCAPE:\n      glfwSetWindowShouldClose(window, GLFW_TRUE);\n      break;\n\n      \/\/ move camera\n   case GLFW_KEY_UP:\n      g_Camera.AdjustRotateXAxis(5.0);\n      break;\n   case GLFW_KEY_DOWN:\n      g_Camera.AdjustRotateXAxis(-5.0);\n      break;\n   case GLFW_KEY_LEFT:\n      g_Camera.AdjustRotateZAxis(5.0);\n      break;\n   case GLFW_KEY_RIGHT:\n      g_Camera.AdjustRotateZAxis(-5.0);\n      break;\n   case GLFW_KEY_W:\n      g_Camera.AdjustTranslateZAxis(5.0);\n      break;\n   case GLFW_KEY_S:\n      g_Camera.AdjustTranslateZAxis(-5.0);\n      break;\n   case GLFW_KEY_D:\n      g_Camera.AdjustTranslateXAxis(-5.0);\n      break;\n   case GLFW_KEY_A:\n      g_Camera.AdjustTranslateXAxis(5.0);\n      break;\n\n      \/\/ reset everything\n   case GLFW_KEY_HOME:\n   case GLFW_KEY_BACKSPACE:\n      g_Camera.ResetCameraPos();\n      break;\n\n      \/\/ render mode\n   case GLFW_KEY_P:\n      g_RenderMode = RenderMode::POINTS;\n      break;\n   case GLFW_KEY_T:\n      g_RenderMode = RenderMode::TRIANGLES;\n      break;\n\n   default:\n      return;\n   };\n}\n\n\/\/ inspiration https:\/\/stackoverflow.com\/questions\/37194845\/using-glfw-to-capture-mouse-dragging-c for below\nvoid mouse_callback(GLFWwindow* window, int button, int action, int mods)\n{\n   double lastX, lastY;\n   if (button == GLFW_MOUSE_BUTTON_LEFT) {\n      if (action == GLFW_PRESS)\n      {\n         std::cout << \"allow zooming\" << std::endl;\n         glfwGetCursorPos(window, &lastX, &lastY);\n         g_Cursor.SetLastY((float)lastY);\n         g_Cursor.ToggleLeftButton();\n      }\n      else\n      {\n         std::cout << \"disable zooming\" << std::endl;\n         g_Cursor.ToggleLeftButton();\n\n      }\n   }\n   else if (button == GLFW_MOUSE_BUTTON_RIGHT) {\n      if (action == GLFW_PRESS)\n      {\n         std::cout << \"allow rotate y\" << std::endl;\n         glfwGetCursorPos(window, &lastX, &lastY);\n         g_Cursor.SetLastY((float)lastY);\n         g_Cursor.ToggleRightButton();\n      }\n      else\n      {\n         std::cout << \"disable rotate y\" << std::endl;\n         g_Cursor.ToggleRightButton();\n\n      }\n   }\n}\n\n\/\/ inspiration https:\/\/learnopengl.com\/#!Getting-started\/Camera\nvoid cursor_callback(GLFWwindow* window, double xpos, double ypos)\n{\n   if (g_Cursor.IsLeftActive())\n   {\n      float yoffset = static_cast<float>(g_Cursor.GetLastY() - ypos);\n      g_Cursor.SetLastY((float)ypos);\n      yoffset *= Cursor::Sensitivity;\n\n      g_Camera.AdjustScalar(yoffset);\n   }\n   if (g_Cursor.IsRightActive())\n   {\n      float yoffset = static_cast<float>(g_Cursor.GetLastY() - ypos);\n      g_Cursor.SetLastY((float)ypos);\n      yoffset *= Cursor::Sensitivity;\n\n      g_Camera.AdjustRotateYAxis(yoffset);\n   }\n}\n<commit_msg>adding more triangles to draw<commit_after>\/*\nMIT License\n\nCopyright (c) 2017 Chris McArthur, prince.chrismc(at)gmail(dot)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 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 <string>\n#include <iostream>\n#include <vector>\n#include <cmath>\n#include <sstream>\n\n#include \"glm\/gtc\/matrix_transform.hpp\" \/\/glm::lookAt, scale, etc...\n#include \"GL\/glew.h\"                    \/\/ include GL Extension Wrangler\n#include \"CImg.h\"\n\n#include \"GlfwWindow.h\"\n#include \"Shader.h\"\n#include \"Camera.h\"\n#include \"Cursor.h\"\n\nusing cimg_library::CImg;\nusing cimg_library::CImgDisplay;\n\n\/\/enums\nenum class RenderMode { POINTS = GL_POINTS, LINES = GL_LINES, TRIANGLES = GL_TRIANGLES };\n\n\/\/ Function Declaration\nconst unsigned int GetUserInputMultiple(const unsigned int& lower, const unsigned int& upper, const unsigned int& multiple);\nvoid key_callback(GLFWwindow* window, int key, int scancode, int action, int mode);\nvoid mouse_callback(GLFWwindow* window, int button, int action, int mods);\nvoid cursor_callback(GLFWwindow* window, double xpos, double ypos);\n\n\/\/ Globals\nCamera g_Camera;\nCursor g_Cursor;\nRenderMode g_RenderMode;\n\nint main()\n{\n   std::cout << \"Welcome to Image Height Map Generator!\" << std::endl;\n\n   std::cout << std::endl << \"Please Select a skip size: (multiple of 5) recommended: 20\" << std::endl;\n   unsigned int skip_size = GetUserInputMultiple(0, 65, 5);\n\n   \/\/ Create a GLFWwindow\n   GlfwWindow window(\"Image Height Map by Christopher McArthur\", GlfwWindow::DEFAULT_WIDTH, GlfwWindow::DEFAULT_HEIGHT);\n   if (!window()) \/\/ Make sure it exists\n   {\n      return -1;\n   }\n\n   \/\/ Set the required callback functions\n   window.SetKeyCallback(key_callback);\n   window.SetMouseButtonCallback(mouse_callback);\n   window.SetCursorPosCallback(cursor_callback);\n\n   \/\/glEnable(GL_DEPTH_TEST);\n   \/\/glDepthFunc(GL_LESS);\n\n   \/\/ Set this to true so GLEW knows to use a modern approach to retrieving function pointers and extensions\n   glewExperimental = GL_TRUE;\n   \/\/ Initialize GLEW to setup the OpenGL Function pointers\n   if (glewInit() != GLEW_OK)\n   {\n      std::cout << \"Failed to initialize GLEW\" << std::endl;\n      return -1;\n   }\n\n   \/\/glEnable(GL_DEPTH_TEST);\n   \/\/glDepthFunc(GL_GEQUAL);\n\n   \/\/ Build and compile our shader program\n   VertexShader vertexShader(\"shaders\/vertex.shader\");\n   FragmentShader fragmentShader(\"shaders\/fragment.shader\");\n   if (!vertexShader() || !fragmentShader()) \/\/ make sure they are ready to use\n   {\n      return -1;\n   }\n\n   ShaderLinker* shaderProgram = &ShaderLinker::GetInstance();\n   if (!shaderProgram->Link(&vertexShader, &fragmentShader))\n   {\n      return -1;\n   }\n\n   GLuint PositonIndex = shaderProgram->GetAttributeLocation(\"position\");\n   GLuint ColorIndex = shaderProgram->GetAttributeLocation(\"color\");\n\n   \/\/ Constant vectors\n   const glm::vec3 center(0.0f, 0.0f, 0.0f);\n   const glm::vec3 up(0.0f, 1.0f, 0.0f);\n   const glm::vec3 eye(0.0f, 35.0f, 35.0f);\n\n   \/\/ Setup global camera\n   g_Camera = Camera(center, up, eye);\n\n\n   \/\/ ---------------------------------------------------------------------------------------------\n   std::cout << \"Processing image....\";\n   CImg<float> image(\"assets\/depth.bmp\");         \/\/ load the image\n   CImgDisplay display(image, \"Image\");           \/\/ create window displaying image\n\n   std::vector<glm::vec3> verticies_all;\n   std::vector<glm::vec3> colors_all;\n\n   std::vector<glm::vec3> verticies_skip;\n   std::vector<glm::vec3> colors_skip;\n   std::vector<GLuint> indinces_skip;\n\n   int img_half_width = image.width() \/ 2;\n   int img_half_heigth = image.height() \/ 2;\n\n   for (int x = (0 - img_half_width); x < img_half_width; x += 1)\n   {\n      for (int z = (0 - img_half_heigth); z < img_half_heigth; z += 1)\n      {\n         double pixel_value = static_cast<double>(*image.data(x + img_half_width, z + img_half_heigth));\n         verticies_all.emplace_back(glm::vec3(x, pixel_value, z));\n         if(x % skip_size == 0)\n         {\n            verticies_skip.emplace_back(glm::vec3(x, pixel_value, z));\n\n            indinces_skip.emplace_back((GLuint)verticies_skip.size() - 1); \/\/ itself\n            indinces_skip.emplace_back((GLuint)verticies_skip.size());     \/\/ next one\n            indinces_skip.emplace_back((GLuint)verticies_skip.size() + image.height() - 1); \/\/ next row\n         }\n\n         unsigned long colorValue = static_cast<unsigned long>(std::floor(std::pow(pixel_value, 2.0))); \/\/ blue to green\n         colors_all.emplace_back(glm::vec3(((colorValue & 0xff0000) >> 16)\/255.0, ((colorValue & 0x00ff00) >> 8)\/255.0, (colorValue & 0x0000ff)\/255.0));\n         if (x % skip_size == 0) colors_skip.emplace_back(glm::vec3(((colorValue & 0xff0000) >> 16) \/ 255.0, ((colorValue & 0x00ff00) >> 8) \/ 255.0, (colorValue & 0x0000ff) \/ 255.0));\n      }\n   }\n   std::cout << \"  Completed!\" << std::endl;\n\n   \/*GLuint VAO_all_pts, VBO_all_pts, VBO_all_color;\n   glGenVertexArrays(1, &VAO_all_pts);\n   glBindVertexArray(VAO_all_pts);\n\n   glGenBuffers(1, &VBO_all_pts);\n   glBindBuffer(GL_ARRAY_BUFFER, VBO_all_pts);\n   glBufferData(GL_ARRAY_BUFFER, verticies_all.size() * sizeof(glm::vec3), &verticies_all.front(), GL_STATIC_DRAW);\n   glVertexAttribPointer(PositonIndex, 3, GL_FLOAT, GL_FALSE, 3 * sizeof(GLfloat), (GLvoid*)0);\n   glEnableVertexAttribArray(PositonIndex);\n   glBindBuffer(GL_ARRAY_BUFFER, 0);\n\n   glGenBuffers(1, &VBO_all_color);\n   glBindBuffer(GL_ARRAY_BUFFER, VBO_all_color);\n   glBufferData(GL_ARRAY_BUFFER, colors_all.size() * sizeof(glm::vec3), &colors_all.front(), GL_STATIC_DRAW);\n   glVertexAttribPointer(ColorIndex, 3, GL_FLOAT, GL_FALSE, 3 * sizeof(GLfloat), (GLvoid*)0);\n   glEnableVertexAttribArray(ColorIndex);\n   glBindBuffer(GL_ARRAY_BUFFER, 0);\n\n   glBindVertexArray(0);*\/\n\n   GLuint VAO_skip_pts, VBO_skip_pts, VBO_skip_color, IBO_skip;\n   glGenVertexArrays(1, &VAO_skip_pts);\n   glBindVertexArray(VAO_skip_pts);\n\n   glGenBuffers(1, &VBO_skip_pts);\n   glBindBuffer(GL_ARRAY_BUFFER, VBO_skip_pts);\n   glBufferData(GL_ARRAY_BUFFER, verticies_skip.size() * sizeof(glm::vec3), &verticies_skip.front(), GL_STATIC_DRAW);\n   glVertexAttribPointer(PositonIndex, 3, GL_FLOAT, GL_FALSE, 3 * sizeof(GLfloat), (GLvoid*)0);\n   glEnableVertexAttribArray(PositonIndex);\n   glBindBuffer(GL_ARRAY_BUFFER, 0);\n\n   glGenBuffers(1, &VBO_skip_color);\n   glBindBuffer(GL_ARRAY_BUFFER, VBO_skip_color);\n   glBufferData(GL_ARRAY_BUFFER, colors_skip.size() * sizeof(glm::vec3), &colors_skip.front(), GL_STATIC_DRAW);\n   glVertexAttribPointer(ColorIndex, 3, GL_FLOAT, GL_FALSE, 3 * sizeof(GLfloat), (GLvoid*)0);\n   glEnableVertexAttribArray(ColorIndex);\n   glBindBuffer(GL_ARRAY_BUFFER, 0);\n\n   glGenBuffers(1, &IBO_skip);\n   glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, IBO_skip);\n   glBufferData(GL_ELEMENT_ARRAY_BUFFER, indinces_skip.size() * sizeof(GLuint), &indinces_skip.front(), GL_STATIC_DRAW);\n   glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, 0);\n\n   glBindVertexArray(0);\n   \/\/ ---------------------------------------------------------------------------------------------\n\n\n   \/\/ Game loop\n   while (! ~window)\n   {\n      \/\/ Check if any events have been activiated (key pressed, mouse moved etc.) and call corresponding response functions\n      glfwPollEvents();\n\n      \/\/ Render\n      \/\/ Clear the colorbuffer\n      glClearColor(0.05f, 0.075f, 0.075f, 1.0f); \/\/ near black teal\n      glClear(GL_COLOR_BUFFER_BIT \/*| GL_DEPTH_BUFFER_BIT*\/);\n\n      shaderProgram->SetShaderMat4(\"view_matrix\", g_Camera.GetViewMatrix());\n\n      shaderProgram->SetShaderMat4(\"projection_matrix\", window.GetProjectionMatrix());\n\n      glm::mat4 model_matrix = glm::scale(glm::mat4(), glm::vec3(0.05f));\n      shaderProgram->SetShaderMat4(\"model_matrix\", model_matrix);\n\n      glBindVertexArray(VAO_skip_pts);\n      glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, IBO_skip);\n      \/\/glDrawArrays((GLuint)g_RenderMode, 0, (GLsizei)verticies_skip.size());\n      glDrawElements(GL_TRIANGLES, indinces_skip.size(), GL_UNSIGNED_INT, NULL);\n      glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, 0);\n      glBindVertexArray(0);\n\n      ++window; \/\/ swap buffers\n   }\n\n   return 0;\n}\n\n\/\/ ------------------------------------------------------------------------------------------------ \/\/\n\/\/                                          UTILITY CODE                                          - \/\/\n\/\/ ------------------------------------------------------------------------------------------------ \/\/\n\n\/\/\/ copied from another project https:\/\/github.com\/prince-chrismc\/Pandemic\/blob\/master\/Pandemic\/Sources\/GameEngine.cpp small modifications\nconst unsigned int GetUserInputMultiple(const unsigned int& lower, const unsigned int& upper, const unsigned int& multiple)\n{\n   uint16_t selection = 0;\n   do\n   {\n      std::cout << \"Selcetion: \";\n      std::string input;\n      std::getline(std::cin, input);\n      std::stringstream ss(input);\n      ss >> selection;\n\n      if (selection < lower || selection > upper || selection % multiple != 0)\n         std::cout << \"Invalid option. Please Try again...\" << std::endl;\n\n   } while (selection < lower || selection > upper || selection % multiple != 0);\n\n   return selection;\n}\n\n\/\/ ------------------------------------------------------------------------------------------------ \/\/\n\/\/                                      CALLBACK FUNCTIONS                                        - \/\/\n\/\/ ------------------------------------------------------------------------------------------------ \/\/\n\n\/\/ Is called whenever a key is pressed\/released via GLFW\nvoid key_callback(GLFWwindow* window, int key, int scancode, int action, int mode)\n{\n   \/\/ we are only concerned about key presses not releases\n   if (action != GLFW_PRESS)\n      return;\n\n   \/\/ lets print the key in human readable if possible\n   const char* keyname = glfwGetKeyName(key, scancode); \/\/ function found at https:\/\/github.com\/glfw\/glfw\/pull\/117\n   if (keyname)\n      std::cout << keyname << std::endl;\n   else\n      std::cout << key << std::endl;\n\n   switch (key)\n   {\n      \/\/ windows close\n   case GLFW_KEY_ESCAPE:\n      glfwSetWindowShouldClose(window, GLFW_TRUE);\n      break;\n\n      \/\/ move camera\n   case GLFW_KEY_UP:\n      g_Camera.AdjustRotateXAxis(5.0);\n      break;\n   case GLFW_KEY_DOWN:\n      g_Camera.AdjustRotateXAxis(-5.0);\n      break;\n   case GLFW_KEY_LEFT:\n      g_Camera.AdjustRotateZAxis(5.0);\n      break;\n   case GLFW_KEY_RIGHT:\n      g_Camera.AdjustRotateZAxis(-5.0);\n      break;\n   case GLFW_KEY_W:\n      g_Camera.AdjustTranslateZAxis(5.0);\n      break;\n   case GLFW_KEY_S:\n      g_Camera.AdjustTranslateZAxis(-5.0);\n      break;\n   case GLFW_KEY_D:\n      g_Camera.AdjustTranslateXAxis(-5.0);\n      break;\n   case GLFW_KEY_A:\n      g_Camera.AdjustTranslateXAxis(5.0);\n      break;\n\n      \/\/ reset everything\n   case GLFW_KEY_HOME:\n   case GLFW_KEY_BACKSPACE:\n      g_Camera.ResetCameraPos();\n      break;\n\n      \/\/ render mode\n   case GLFW_KEY_P:\n      g_RenderMode = RenderMode::POINTS;\n      break;\n   case GLFW_KEY_T:\n      g_RenderMode = RenderMode::TRIANGLES;\n      break;\n\n   default:\n      return;\n   };\n}\n\n\/\/ inspiration https:\/\/stackoverflow.com\/questions\/37194845\/using-glfw-to-capture-mouse-dragging-c for below\nvoid mouse_callback(GLFWwindow* window, int button, int action, int mods)\n{\n   double lastX, lastY;\n   if (button == GLFW_MOUSE_BUTTON_LEFT) {\n      if (action == GLFW_PRESS)\n      {\n         std::cout << \"allow zooming\" << std::endl;\n         glfwGetCursorPos(window, &lastX, &lastY);\n         g_Cursor.SetLastY((float)lastY);\n         g_Cursor.ToggleLeftButton();\n      }\n      else\n      {\n         std::cout << \"disable zooming\" << std::endl;\n         g_Cursor.ToggleLeftButton();\n\n      }\n   }\n   else if (button == GLFW_MOUSE_BUTTON_RIGHT) {\n      if (action == GLFW_PRESS)\n      {\n         std::cout << \"allow rotate y\" << std::endl;\n         glfwGetCursorPos(window, &lastX, &lastY);\n         g_Cursor.SetLastY((float)lastY);\n         g_Cursor.ToggleRightButton();\n      }\n      else\n      {\n         std::cout << \"disable rotate y\" << std::endl;\n         g_Cursor.ToggleRightButton();\n\n      }\n   }\n}\n\n\/\/ inspiration https:\/\/learnopengl.com\/#!Getting-started\/Camera\nvoid cursor_callback(GLFWwindow* window, double xpos, double ypos)\n{\n   if (g_Cursor.IsLeftActive())\n   {\n      float yoffset = static_cast<float>(g_Cursor.GetLastY() - ypos);\n      g_Cursor.SetLastY((float)ypos);\n      yoffset *= Cursor::Sensitivity;\n\n      g_Camera.AdjustScalar(yoffset);\n   }\n   if (g_Cursor.IsRightActive())\n   {\n      float yoffset = static_cast<float>(g_Cursor.GetLastY() - ypos);\n      g_Cursor.SetLastY((float)ypos);\n      yoffset *= Cursor::Sensitivity;\n\n      g_Camera.AdjustRotateYAxis(yoffset);\n   }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * Copyright 2012 FAU (Friedrich Alexander University of Erlangen-Nuremberg)\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 \"i6engine\/modules\/graphics\/components\/CameraComponent.h\"\n\n#include \"i6engine\/modules\/graphics\/GraphicsManager.h\"\n#include \"i6engine\/modules\/graphics\/GraphicsNode.h\"\n\n#include \"OGRE\/OgreCompositorManager.h\"\n#include \"OGRE\/OgreRenderWindow.h\"\n#include \"OGRE\/OgreRoot.h\"\n#include \"OGRE\/OgreSceneManager.h\"\n\nnamespace i6engine {\nnamespace modules {\n\n\tCameraComponent::CameraComponent(GraphicsManager * manager, GraphicsNode * parent, const int64_t goid, const int64_t coid, const Vec3 & position, const Vec3 & lookAt, const double nC, double aspect, const double fov) : _manager(manager), _parent(parent), _sceneNode(nullptr), _zOrder(INT_MAX) {\n\t\tASSERT_THREAD_SAFETY_CONSTRUCTOR\n\t\tOgre::SceneManager * sm = _manager->getSceneManager();\n\n\t\tstd::string name = \"SN_\" + std::to_string(goid) + \"_\" + std::to_string(coid);\n\n\t\t_sceneNode = _parent->getSceneNode()->createChildSceneNode(name, position.toOgre());\n\t\tOgre::Camera * camera = sm->createCamera(\"camera\" + std::to_string(goid) + \"_\" + std::to_string(coid));\n\t\t_sceneNode->attachObject(camera);\n\t\tcamera->setPosition(position.toOgre());\n\t\tcamera->lookAt(lookAt.toOgre());\n\t\tcamera->setNearClipDistance(nC);\n\t\tcamera->setFOVy(Ogre::Radian(fov));\n\t\tcamera->setAspectRatio(aspect);\n\t}\n\n\tCameraComponent::~CameraComponent() {\n\t\tASSERT_THREAD_SAFETY_FUNCTION\n\t\tOgre::SceneManager * sm = _manager->getSceneManager();\n\t\tOgre::Camera * camera = dynamic_cast<Ogre::Camera *>(_sceneNode->getAttachedObject(0));\n\t\tOgre::Viewport * vp = camera->getViewport();\n\n\t\tOgre::CompositorManager::ResourceMapIterator resourceIterator = Ogre::CompositorManager::getSingleton().getResourceIterator();\n\n\t\t\/\/ add all compositor resources to the view container\n\t\twhile (resourceIterator.hasMoreElements()) {\n\t\t\tOgre::ResourcePtr resource = resourceIterator.getNext();\n\t\t\tconst Ogre::String & compositorName = resource->getName();\n\t\t\ttry {\n\t\t\t\tOgre::CompositorManager::getSingleton().setCompositorEnabled(vp, compositorName, false);\n\t\t\t\tOgre::CompositorManager::getSingleton().removeCompositor(vp, compositorName);\n\t\t\t} catch (...) {\n\t\t\t\t\/\/\/ Warn user\n\t\t\t\tOgre::LogManager::getSingleton().logMessage(\"Could not load compositor \" + compositorName);\n\t\t\t}\n\t\t}\n\n\t\tif (_zOrder != INT_MAX) {\n\t\t\t_manager->getRenderWindow()->removeViewport(_zOrder);\n\t\t}\n\n\t\t_sceneNode->detachObject(camera);\n\t\tsm->destroyCamera(camera);\n\n\t\t_parent->getSceneNode()->removeAndDestroyChild(_sceneNode->getName());\n\t}\n\n\tvoid CameraComponent::updateCameraComponent(const Vec3 & position, const Vec3 & lookAt, const double nC, double aspect, const double fov) {\n\t\tASSERT_THREAD_SAFETY_FUNCTION\n\t\tOgre::Camera * camera = dynamic_cast<Ogre::Camera *>(_sceneNode->getAttachedObject(0));\n\t\tcamera->setPosition(position.toOgre());\n\t\tcamera->lookAt(lookAt.toOgre());\n\t\tcamera->setNearClipDistance(nC);\n\t\tcamera->setFOVy(Ogre::Radian(fov));\n\t\tcamera->setAspectRatio(aspect);\n\t}\n\n\tvoid CameraComponent::updateCameraFrustumComponent(const double left, const double right, const double top, const double bottom) {\n\t\tASSERT_THREAD_SAFETY_FUNCTION\n\t\tOgre::Camera * camera = dynamic_cast<Ogre::Camera *>(_sceneNode->getAttachedObject(0));\n\t\tcamera->setFrustumExtents(left, right, top, bottom);\n\t}\n\n\tvoid CameraComponent::enableCompositor(const std::string & compositor, bool enabled) {\n\t\tASSERT_THREAD_SAFETY_FUNCTION\n\t\tOgre::Camera * camera = dynamic_cast<Ogre::Camera *>(_sceneNode->getAttachedObject(0));\n\t\tOgre::Viewport * vp = camera->getViewport();\n\t\tOgre::CompositorManager::getSingleton().setCompositorEnabled(vp, compositor, enabled);\n\t}\n\n\tvoid CameraComponent::createOrUpdateViewport(int zOrder, const double left, const double top, const double width, const double height, const double red, const double green, const double blue, const double alpha) {\n\t\tASSERT_THREAD_SAFETY_FUNCTION\n\t\tOgre::Viewport * vp = nullptr;\n\t\tOgre::Camera * camera = dynamic_cast<Ogre::Camera *>(_sceneNode->getAttachedObject(0));\n\t\tif (camera->getViewport() == nullptr) {\n\t\t\t_zOrder = zOrder;\n\t\t\tvp = _manager->getRenderWindow()->addViewport(camera, zOrder, float(left), float(top), float(width), float(height));\n\t\t} else {\n\t\t\tvp = camera->getViewport();\n\t\t\tvp->setDimensions(left, top, width, height);\n\t\t}\n\n\t\tvp->setBackgroundColour(Ogre::ColourValue(float(red), float(green), float(blue), float(alpha)));\n\n\t\tOgre::CompositorManager::ResourceMapIterator resourceIterator = Ogre::CompositorManager::getSingleton().getResourceIterator();\n\n\t\t\/\/ add all compositor resources to the view container\n\t\twhile (resourceIterator.hasMoreElements()) {\n\t\t\tOgre::ResourcePtr resource = resourceIterator.getNext();\n\t\t\tconst Ogre::String & compositorName = resource->getName();\n\n\t\t\tint addPosition = -1;\n\t\t\tif (compositorName == \"HDR\") {\n\t\t\t\t\/\/ HDR must be first in the chain\n\t\t\t\taddPosition = 0;\n\t\t\t}\n\t\t\ttry {\n\t\t\t\tOgre::CompositorManager::getSingleton().addCompositor(vp, compositorName, addPosition);\n\t\t\t\tOgre::CompositorManager::getSingleton().setCompositorEnabled(vp, compositorName, false);\n\t\t\t} catch (...) {\n\t\t\t\t\/\/\/ Warn user\n\t\t\t\tOgre::LogManager::getSingleton().logMessage(\"Could not load compositor \" + compositorName);\n\t\t\t}\n\t\t}\n\t}\n\n} \/* namespace modules *\/\n} \/* namespace i6engine *\/\n<commit_msg>ISIXE-1699 fixed camera lookAt not being relative to node position when initialized with a start position of scene node unequal to 0 0 0<commit_after>\/**\n * Copyright 2012 FAU (Friedrich Alexander University of Erlangen-Nuremberg)\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 \"i6engine\/modules\/graphics\/components\/CameraComponent.h\"\n\n#include \"i6engine\/math\/i6eMath.h\"\n\n#include \"i6engine\/modules\/graphics\/GraphicsManager.h\"\n#include \"i6engine\/modules\/graphics\/GraphicsNode.h\"\n\n#include \"OGRE\/OgreCompositorManager.h\"\n#include \"OGRE\/OgreRenderWindow.h\"\n#include \"OGRE\/OgreRoot.h\"\n#include \"OGRE\/OgreSceneManager.h\"\n\nnamespace i6engine {\nnamespace modules {\n\n\tCameraComponent::CameraComponent(GraphicsManager * manager, GraphicsNode * parent, const int64_t goid, const int64_t coid, const Vec3 & position, const Vec3 & lookAt, const double nC, double aspect, const double fov) : _manager(manager), _parent(parent), _sceneNode(nullptr), _zOrder(INT_MAX) {\n\t\tASSERT_THREAD_SAFETY_CONSTRUCTOR\n\t\tOgre::SceneManager * sm = _manager->getSceneManager();\n\n\t\tstd::string name = \"SN_\" + std::to_string(goid) + \"_\" + std::to_string(coid);\n\n\t\t_sceneNode = _parent->getSceneNode()->createChildSceneNode(name, position.toOgre());\n\t\tOgre::Camera * camera = sm->createCamera(\"camera\" + std::to_string(goid) + \"_\" + std::to_string(coid));\n\t\t_sceneNode->attachObject(camera);\n\t\tcamera->setPosition(position.toOgre());\n\t\tcamera->lookAt(_parent->getSceneNode()->getPosition() + math::rotateVector(lookAt, Quaternion(_parent->getSceneNode()->getOrientation())).toOgre());\n\t\tcamera->setNearClipDistance(nC);\n\t\tcamera->setFOVy(Ogre::Radian(fov));\n\t\tcamera->setAspectRatio(aspect);\n\t}\n\n\tCameraComponent::~CameraComponent() {\n\t\tASSERT_THREAD_SAFETY_FUNCTION\n\t\tOgre::SceneManager * sm = _manager->getSceneManager();\n\t\tOgre::Camera * camera = dynamic_cast<Ogre::Camera *>(_sceneNode->getAttachedObject(0));\n\t\tOgre::Viewport * vp = camera->getViewport();\n\n\t\tOgre::CompositorManager::ResourceMapIterator resourceIterator = Ogre::CompositorManager::getSingleton().getResourceIterator();\n\n\t\t\/\/ add all compositor resources to the view container\n\t\twhile (resourceIterator.hasMoreElements()) {\n\t\t\tOgre::ResourcePtr resource = resourceIterator.getNext();\n\t\t\tconst Ogre::String & compositorName = resource->getName();\n\t\t\ttry {\n\t\t\t\tOgre::CompositorManager::getSingleton().setCompositorEnabled(vp, compositorName, false);\n\t\t\t\tOgre::CompositorManager::getSingleton().removeCompositor(vp, compositorName);\n\t\t\t} catch (...) {\n\t\t\t\t\/\/\/ Warn user\n\t\t\t\tOgre::LogManager::getSingleton().logMessage(\"Could not load compositor \" + compositorName);\n\t\t\t}\n\t\t}\n\n\t\tif (_zOrder != INT_MAX) {\n\t\t\t_manager->getRenderWindow()->removeViewport(_zOrder);\n\t\t}\n\n\t\t_sceneNode->detachObject(camera);\n\t\tsm->destroyCamera(camera);\n\n\t\t_parent->getSceneNode()->removeAndDestroyChild(_sceneNode->getName());\n\t}\n\n\tvoid CameraComponent::updateCameraComponent(const Vec3 & position, const Vec3 & lookAt, const double nC, double aspect, const double fov) {\n\t\tASSERT_THREAD_SAFETY_FUNCTION\n\t\tOgre::Camera * camera = dynamic_cast<Ogre::Camera *>(_sceneNode->getAttachedObject(0));\n\t\tcamera->setPosition(position.toOgre());\n\t\tcamera->lookAt(lookAt.toOgre());\n\t\tcamera->setNearClipDistance(nC);\n\t\tcamera->setFOVy(Ogre::Radian(fov));\n\t\tcamera->setAspectRatio(aspect);\n\t}\n\n\tvoid CameraComponent::updateCameraFrustumComponent(const double left, const double right, const double top, const double bottom) {\n\t\tASSERT_THREAD_SAFETY_FUNCTION\n\t\tOgre::Camera * camera = dynamic_cast<Ogre::Camera *>(_sceneNode->getAttachedObject(0));\n\t\tcamera->setFrustumExtents(left, right, top, bottom);\n\t}\n\n\tvoid CameraComponent::enableCompositor(const std::string & compositor, bool enabled) {\n\t\tASSERT_THREAD_SAFETY_FUNCTION\n\t\tOgre::Camera * camera = dynamic_cast<Ogre::Camera *>(_sceneNode->getAttachedObject(0));\n\t\tOgre::Viewport * vp = camera->getViewport();\n\t\tOgre::CompositorManager::getSingleton().setCompositorEnabled(vp, compositor, enabled);\n\t}\n\n\tvoid CameraComponent::createOrUpdateViewport(int zOrder, const double left, const double top, const double width, const double height, const double red, const double green, const double blue, const double alpha) {\n\t\tASSERT_THREAD_SAFETY_FUNCTION\n\t\tOgre::Viewport * vp = nullptr;\n\t\tOgre::Camera * camera = dynamic_cast<Ogre::Camera *>(_sceneNode->getAttachedObject(0));\n\t\tif (camera->getViewport() == nullptr) {\n\t\t\t_zOrder = zOrder;\n\t\t\tvp = _manager->getRenderWindow()->addViewport(camera, zOrder, float(left), float(top), float(width), float(height));\n\t\t} else {\n\t\t\tvp = camera->getViewport();\n\t\t\tvp->setDimensions(left, top, width, height);\n\t\t}\n\n\t\tvp->setBackgroundColour(Ogre::ColourValue(float(red), float(green), float(blue), float(alpha)));\n\n\t\tOgre::CompositorManager::ResourceMapIterator resourceIterator = Ogre::CompositorManager::getSingleton().getResourceIterator();\n\n\t\t\/\/ add all compositor resources to the view container\n\t\twhile (resourceIterator.hasMoreElements()) {\n\t\t\tOgre::ResourcePtr resource = resourceIterator.getNext();\n\t\t\tconst Ogre::String & compositorName = resource->getName();\n\n\t\t\tint addPosition = -1;\n\t\t\tif (compositorName == \"HDR\") {\n\t\t\t\t\/\/ HDR must be first in the chain\n\t\t\t\taddPosition = 0;\n\t\t\t}\n\t\t\ttry {\n\t\t\t\tOgre::CompositorManager::getSingleton().addCompositor(vp, compositorName, addPosition);\n\t\t\t\tOgre::CompositorManager::getSingleton().setCompositorEnabled(vp, compositorName, false);\n\t\t\t} catch (...) {\n\t\t\t\t\/\/\/ Warn user\n\t\t\t\tOgre::LogManager::getSingleton().logMessage(\"Could not load compositor \" + compositorName);\n\t\t\t}\n\t\t}\n\t}\n\n} \/* namespace modules *\/\n} \/* namespace i6engine *\/\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2015 Pavel Kirienko <pavel.kirienko@gmail.com>,\n *                    Ilia  Sheremet <illia.sheremet@gmail.com>\n *\/\n\n#ifndef UAVCAN_TRANSPORT_CAN_ACCEPTANCE_FILTER_CONFIGURATOR_HPP_INCLUDED\n#define UAVCAN_TRANSPORT_CAN_ACCEPTANCE_FILTER_CONFIGURATOR_HPP_INCLUDED\n\n#include <cassert>\n#include <uavcan\/data_type.hpp>\n#include <uavcan\/error.hpp>\n#include <uavcan\/transport\/dispatcher.hpp>\n#include <uavcan\/node\/abstract_node.hpp>\n#include <uavcan\/build_config.hpp>\n#include <uavcan\/util\/multiset.hpp>\n\nnamespace uavcan\n{\n\/**\n * This class configures hardware acceptance filters (if this feature is present on the particular CAN driver) to\n * preclude reception of irrelevant CAN frames on the hardware level.\n *\n * Configuration starts by creating an object of class @ref CanAcceptanceFilterConfigurator on the stack.\n * By means of computeConfiguration() method the class determines the number of available HW filters and the number\n * of listeners. In case if custom configuration required, it is possible to add it through addFilterConfig().\n * Subsequently obtained configurations are then loaded into the CAN driver by calling the applyConfiguration() method.\n * If the cumulative number of configurations obtained by computeConfiguration() and addFilterConfig() is higher than\n * the number of available HW filters, configurations will be merged automatically in the most efficient way.\n *\n * Note that if the application adds additional server or subscriber objects after the filters have been configured,\n * the configuration procedure will have to be performed again.\n *\n * The maximum number of CAN acceptance filters is predefined in uavcan\/build_config.hpp through a constant\n * @ref MaxCanAcceptanceFilters. The algorithm doesn't allow to have higher number of HW filters configurations than\n * defined by MaxCanAcceptanceFilters. You can change this value according to the number specified in your CAN driver\n * datasheet.\n *\/\nclass CanAcceptanceFilterConfigurator\n{\npublic:\n    \/**\n     * These arguments defines whether acceptance filter configuration has anonymous messages or not\n     *\/\n    enum AnonymousMessages\n    {\n        AcceptAnonymousMessages,\n        IgnoreAnonymousMessages\n    };\n\nprivate:\n    \/**\n     * Below constants based on UAVCAN transport layer specification. Masks and ID's depends on message\n     * TypeID, TransferID (RequestNotResponse - for service types, ServiceNotMessage - for all types of messages).\n     * For more details refer to uavcan.org\/CAN_bus_transport_layer_specification.\n     * For clarity let's represent \"i\" as Data Type ID and \"d\" as Destination Node Id\n     * DefaultFilterMsgMask = 00000 11111111 11111111 10000000\n     * DefaultFilterMsgID   = 00000 iiiiiiii iiiiiiii 00000000, no need to explicitly define, since MsgID initialized\n     * as 0.\n     * DefaultFilterServiceMask = 00000 00000000 01111111 10000000\n     * DefaultFilterServiceID   = 00000 00000000 0ddddddd 10000000, all Service Response Frames are accepted by\n     * HW filters.\n     * DefaultAnonMsgMask = 00000 00000000 00000000 11111111\n     * DefaultAnonMsgID   = 00000 00000000 00000000 00000000, by default the config is added to accept all anonymous\n     * frames. In case there are no anonymous messages, invoke computeConfiguration(IgnoreAnonymousMessages).\n     *\/\n    static const unsigned DefaultFilterMsgMask = 0xFFFF80;\n    static const unsigned DefaultFilterServiceMask = 0x7F80;\n    static const unsigned DefaultFilterServiceID = 0x80;\n    static const unsigned DefaultAnonMsgMask = 0xFF;\n    static const unsigned DefaultAnonMsgID = 0x0;\n\n    typedef uavcan::Multiset<CanFilterConfig> MultisetConfigContainer;\n\n    static CanFilterConfig mergeFilters(CanFilterConfig& a_, CanFilterConfig& b_);\n    static uint8_t countBits(uint32_t n_);\n    uint16_t getNumFilters() const;\n\n    \/**\n     * Fills the multiset_configs_ to proceed it with mergeConfigurations()\n     *\/\n    int16_t loadInputConfiguration(AnonymousMessages load_mode);\n\n    \/**\n     * This method merges several listeners's filter configurations by predetermined algorithm\n     * if number of available hardware acceptance filters less than number of listeners\n     *\/\n    int16_t mergeConfigurations();\n\n    INode& node_;               \/\/< Node reference is needed for access to ICanDriver and Dispatcher\n    MultisetConfigContainer multiset_configs_;\n    uint16_t filters_number_;\n\npublic:\n    \/**\n     * @param node              Libuavcan node whose subscribers\/servers\/etc will be used to configure the filters.\n     *\n     * @param filters_number    Allows to override the maximum number of hardware filters to use.\n     *                          If set to zero (which is default), the class will obtain the number of available\n     *                          filters from the CAN driver via @ref ICanIface::getNumFilters().\n     *\/\n    explicit CanAcceptanceFilterConfigurator(INode& node, uint16_t filters_number = 0)\n        : node_(node)\n        , multiset_configs_(node.getAllocator())\n        , filters_number_(filters_number)\n    { }\n\n    \/**\n     * This method invokes loadInputConfiguration() and mergeConfigurations() consequently\n     * in order to comute optimal filter configurations for the current hardware.\n     *\n     * It can only be invoked when all of the subscriber and server objects are initialized.\n     * If new subscriber or server objects are added later, the filters will have to be reconfigured again.\n     *\n     * @param mode Either: AcceptAnonymousMessages - the filters will accept all anonymous messages (this is default)\n     *                     IgnoreAnonymousMessages - anonymous messages will be ignored\n     * @return 0 = success, negative for error.\n     *\/\n    int computeConfiguration(AnonymousMessages mode = AcceptAnonymousMessages);\n\n    \/**\n     * Add an additional filter configuration.\n     * This method must not be invoked after @ref computeConfiguration().\n     * @return 0 = success, negative for error.\n     *\/\n    int addFilterConfig(const CanFilterConfig& config);\n\n    \/**\n     * This method loads the configuration computed with mergeConfigurations() or explicitly added by addFilterConfig()\n     * to the CAN driver. Must be called after computeConfiguration() and addFilterConfig().\n     * @return 0 = success, negative for error.\n     *\/\n    int applyConfiguration();\n\n    \/**\n     * Returns the configuration computed with mergeConfigurations() or added by addFilterConfig().\n     * If mergeConfigurations() or addFilterConfig() have not been called yet, an empty configuration will be returned.\n     *\/\n    const MultisetConfigContainer& getConfiguration() const\n    {\n        return multiset_configs_;\n    }\n};\n\n}\n\n#endif\n<commit_msg>configureCanAcceptanceFilters()<commit_after>\/*\n * Copyright (C) 2015 Pavel Kirienko <pavel.kirienko@gmail.com>,\n *                    Ilia  Sheremet <illia.sheremet@gmail.com>\n *\/\n\n#ifndef UAVCAN_TRANSPORT_CAN_ACCEPTANCE_FILTER_CONFIGURATOR_HPP_INCLUDED\n#define UAVCAN_TRANSPORT_CAN_ACCEPTANCE_FILTER_CONFIGURATOR_HPP_INCLUDED\n\n#include <cassert>\n#include <uavcan\/data_type.hpp>\n#include <uavcan\/error.hpp>\n#include <uavcan\/transport\/dispatcher.hpp>\n#include <uavcan\/node\/abstract_node.hpp>\n#include <uavcan\/build_config.hpp>\n#include <uavcan\/util\/multiset.hpp>\n\nnamespace uavcan\n{\n\/**\n * This class configures hardware acceptance filters (if this feature is present on the particular CAN driver) to\n * preclude reception of irrelevant CAN frames on the hardware level.\n *\n * Configuration starts by creating an object of class @ref CanAcceptanceFilterConfigurator on the stack.\n * By means of computeConfiguration() method the class determines the number of available HW filters and the number\n * of listeners. In case if custom configuration required, it is possible to add it through addFilterConfig().\n * Subsequently obtained configurations are then loaded into the CAN driver by calling the applyConfiguration() method.\n * If the cumulative number of configurations obtained by computeConfiguration() and addFilterConfig() is higher than\n * the number of available HW filters, configurations will be merged automatically in the most efficient way.\n *\n * Note that if the application adds additional server or subscriber objects after the filters have been configured,\n * the configuration procedure will have to be performed again.\n *\n * The maximum number of CAN acceptance filters is predefined in uavcan\/build_config.hpp through a constant\n * @ref MaxCanAcceptanceFilters. The algorithm doesn't allow to have higher number of HW filters configurations than\n * defined by MaxCanAcceptanceFilters. You can change this value according to the number specified in your CAN driver\n * datasheet.\n *\/\nclass CanAcceptanceFilterConfigurator\n{\npublic:\n    \/**\n     * These arguments defines whether acceptance filter configuration has anonymous messages or not\n     *\/\n    enum AnonymousMessages\n    {\n        AcceptAnonymousMessages,\n        IgnoreAnonymousMessages\n    };\n\nprivate:\n    \/**\n     * Below constants based on UAVCAN transport layer specification. Masks and ID's depends on message\n     * TypeID, TransferID (RequestNotResponse - for service types, ServiceNotMessage - for all types of messages).\n     * For more details refer to uavcan.org\/CAN_bus_transport_layer_specification.\n     * For clarity let's represent \"i\" as Data Type ID and \"d\" as Destination Node Id\n     * DefaultFilterMsgMask = 00000 11111111 11111111 10000000\n     * DefaultFilterMsgID   = 00000 iiiiiiii iiiiiiii 00000000, no need to explicitly define, since MsgID initialized\n     * as 0.\n     * DefaultFilterServiceMask = 00000 00000000 01111111 10000000\n     * DefaultFilterServiceID   = 00000 00000000 0ddddddd 10000000, all Service Response Frames are accepted by\n     * HW filters.\n     * DefaultAnonMsgMask = 00000 00000000 00000000 11111111\n     * DefaultAnonMsgID   = 00000 00000000 00000000 00000000, by default the config is added to accept all anonymous\n     * frames. In case there are no anonymous messages, invoke computeConfiguration(IgnoreAnonymousMessages).\n     *\/\n    static const unsigned DefaultFilterMsgMask = 0xFFFF80;\n    static const unsigned DefaultFilterServiceMask = 0x7F80;\n    static const unsigned DefaultFilterServiceID = 0x80;\n    static const unsigned DefaultAnonMsgMask = 0xFF;\n    static const unsigned DefaultAnonMsgID = 0x0;\n\n    typedef uavcan::Multiset<CanFilterConfig> MultisetConfigContainer;\n\n    static CanFilterConfig mergeFilters(CanFilterConfig& a_, CanFilterConfig& b_);\n    static uint8_t countBits(uint32_t n_);\n    uint16_t getNumFilters() const;\n\n    \/**\n     * Fills the multiset_configs_ to proceed it with mergeConfigurations()\n     *\/\n    int16_t loadInputConfiguration(AnonymousMessages load_mode);\n\n    \/**\n     * This method merges several listeners's filter configurations by predetermined algorithm\n     * if number of available hardware acceptance filters less than number of listeners\n     *\/\n    int16_t mergeConfigurations();\n\n    INode& node_;               \/\/< Node reference is needed for access to ICanDriver and Dispatcher\n    MultisetConfigContainer multiset_configs_;\n    uint16_t filters_number_;\n\npublic:\n    \/**\n     * @param node              Libuavcan node whose subscribers\/servers\/etc will be used to configure the filters.\n     *\n     * @param filters_number    Allows to override the maximum number of hardware filters to use.\n     *                          If set to zero (which is default), the class will obtain the number of available\n     *                          filters from the CAN driver via @ref ICanIface::getNumFilters().\n     *\/\n    explicit CanAcceptanceFilterConfigurator(INode& node, uint16_t filters_number = 0)\n        : node_(node)\n        , multiset_configs_(node.getAllocator())\n        , filters_number_(filters_number)\n    { }\n\n    \/**\n     * This method invokes loadInputConfiguration() and mergeConfigurations() consequently\n     * in order to comute optimal filter configurations for the current hardware.\n     *\n     * It can only be invoked when all of the subscriber and server objects are initialized.\n     * If new subscriber or server objects are added later, the filters will have to be reconfigured again.\n     *\n     * @param mode Either: AcceptAnonymousMessages - the filters will accept all anonymous messages (this is default)\n     *                     IgnoreAnonymousMessages - anonymous messages will be ignored\n     * @return 0 = success, negative for error.\n     *\/\n    int computeConfiguration(AnonymousMessages mode = AcceptAnonymousMessages);\n\n    \/**\n     * Add an additional filter configuration.\n     * This method must not be invoked after @ref computeConfiguration().\n     * @return 0 = success, negative for error.\n     *\/\n    int addFilterConfig(const CanFilterConfig& config);\n\n    \/**\n     * This method loads the configuration computed with mergeConfigurations() or explicitly added by addFilterConfig()\n     * to the CAN driver. Must be called after computeConfiguration() and addFilterConfig().\n     * @return 0 = success, negative for error.\n     *\/\n    int applyConfiguration();\n\n    \/**\n     * Returns the configuration computed with mergeConfigurations() or added by addFilterConfig().\n     * If mergeConfigurations() or addFilterConfig() have not been called yet, an empty configuration will be returned.\n     *\/\n    const MultisetConfigContainer& getConfiguration() const\n    {\n        return multiset_configs_;\n    }\n};\n\n\/**\n * This function is a shortcut for @ref CanAcceptanceFilterConfigurator.\n * It allows to compute filter configuration and then apply it in just one step.\n * It implements only the most common use case; if you have special requirements,\n * use @ref CanAcceptanceFilterConfigurator directly.\n *\n * @param node  Refer to @ref CanAcceptanceFilterConfigurator constructor for explanation.\n * @param mode  Refer to @ref CanAcceptanceFilterConfigurator::computeConfiguration() for explanation.\n * @return non-negative on success, negative error code on error.\n *\/\nstatic inline int configureCanAcceptanceFilters(INode& node,\n                                                CanAcceptanceFilterConfigurator::AnonymousMessages mode\n                                                    = CanAcceptanceFilterConfigurator::AcceptAnonymousMessages)\n{\n    CanAcceptanceFilterConfigurator cfger(node);\n\n    const int compute_res = cfger.computeConfiguration(mode);\n    if (compute_res < 0)\n    {\n        return compute_res;\n    }\n\n    return cfger.applyConfiguration();\n}\n\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/**\n *  @file GibbsExcessVPSSTP.cpp\n *   Definitions for intermediate ThermoPhase object for phases which\n *   employ excess gibbs free energy formulations\n *  (see \\ref thermoprops \n * and class \\link Cantera::GibbsExcessVPSSTP GibbsExcessVPSSTP\\endlink).\n *\n * Header file for a derived class of ThermoPhase that handles\n * variable pressure standard state methods for calculating\n * thermodynamic properties that are further based upon expressions\n * for the excess gibbs free energy expressed as a function of\n * the mole fractions.\n *\/\n\/*\n * Copywrite (2009) 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\/*\n *  $Date$\n *  $Revision$\n *\/\n\n\n#include \"GibbsExcessVPSSTP.h\"\nusing namespace std;\n\nnamespace Cantera {\n\n  \/*\n   * Default constructor.\n   *\n   *\/\n  GibbsExcessVPSSTP::GibbsExcessVPSSTP() :\n    VPStandardStateTP()\n  {\n  }\n\n  \/*\n   * Copy Constructor:\n   *\n   *  Note this stuff will not work until the underlying phase\n   *  has a working copy constructor\n   *\/\n  GibbsExcessVPSSTP::GibbsExcessVPSSTP(const GibbsExcessVPSSTP &b) :\n    VPStandardStateTP()\n  {\n    GibbsExcessVPSSTP::operator=(b);\n  }\n\n  \/*\n   * operator=()\n   *\n   *  Note this stuff will not work until the underlying phase\n   *  has a working assignment operator\n   *\/\n  GibbsExcessVPSSTP& GibbsExcessVPSSTP::\n  operator=(const GibbsExcessVPSSTP &b) {\n    if (&b == this) {\n      return *this;\n    }\n\n    VPStandardStateTP::operator=(b);\n\n    moleFractions_       = b.moleFractions_;\n    lnActCoeff_Scaled_   = b.lnActCoeff_Scaled_;\n    dlnActCoeffdT_Scaled_   = b.dlnActCoeffdT_Scaled_;\n    dlnActCoeffdlnC_Scaled_ = b.dlnActCoeffdlnC_Scaled_;\n    m_pp                 = b.m_pp;\n\n    return *this;\n  }\n\n  \/**\n   *\n   * ~GibbsExcessVPSSTP():   (virtual)\n   *\n   * Destructor: does nothing:\n   *\n   *\/\n  GibbsExcessVPSSTP::~GibbsExcessVPSSTP() {\n  }\n\n  \/*\n   * This routine duplicates the current object and returns\n   * a pointer to ThermoPhase.\n   *\/\n  ThermoPhase* \n  GibbsExcessVPSSTP::duplMyselfAsThermoPhase() const {\n    GibbsExcessVPSSTP* mtp = new GibbsExcessVPSSTP(*this);\n    return (ThermoPhase *) mtp;\n  }\n\n  \/*\n   *  -------------- Utilities -------------------------------\n   *\/\n\n  void GibbsExcessVPSSTP::setMassFractions(const doublereal* const y) {\n#if DEBUG_MODE\n    checkMFSum(y);\n#endif\n    State::setMassFractions(y);\n    getMoleFractions(DATA_PTR(moleFractions_));\n  }\n\n  void GibbsExcessVPSSTP::setMassFractions_NoNorm(const doublereal* const y) {\n#if DEBUG_MODE\n    checkMFSum(y);\n#endif\n    State::setMassFractions_NoNorm(y);\n    getMoleFractions(DATA_PTR(moleFractions_));\n  }\n\n void GibbsExcessVPSSTP::setMoleFractions(const doublereal* const x) {\n#if DEBUG_MODE\n    checkMFSum(x);\n#endif\n    State::setMoleFractions(x);\n    getMoleFractions(DATA_PTR(moleFractions_));\n  }\n\n  void GibbsExcessVPSSTP::setMoleFractions_NoNorm(const doublereal* const x) {\n#if DEBUG_MODE\n    checkMFSum(x);\n#endif\n    State::setMoleFractions_NoNorm(x);\n    getMoleFractions(DATA_PTR(moleFractions_));\n  }\n\n\n  void GibbsExcessVPSSTP::setConcentrations(const doublereal* const c) {\n    State::setConcentrations(c);\n    getMoleFractions(DATA_PTR(moleFractions_));\n  }\n\n\n  \/\/ Equation of state type flag.\n  \/*\n   * The ThermoPhase base class returns\n   * zero. Subclasses should define this to return a unique\n   * non-zero value. Known constants defined for this purpose are\n   * listed in mix_defs.h. The GibbsExcessVPSSTP class also returns\n   * zero, as it is a non-complete class.\n   *\/\n  int GibbsExcessVPSSTP::eosType() const { \n    return 0;\n  }\n\n \n\n  \/*\n   * ------------ Molar Thermodynamic Properties ----------------------\n   *\/\n\n  \/*\n   *\n   * ------------ Mechanical Properties ------------------------------\n   *\n   *\/\n\n  \/*\n   * Set the pressure at constant temperature. Units: Pa.\n   * This method sets a constant within the object.\n   * The mass density is not a function of pressure.\n   *\/\n  void GibbsExcessVPSSTP::setPressure(doublereal p) {\n    setState_TP(temperature(), p);\n  }\n\n  void GibbsExcessVPSSTP::calcDensity() {\n    double *vbar = &m_pp[0];\n    getPartialMolarVolumes(vbar);\n   \n    doublereal vtotal = 0.0;\n    for (int i = 0; i < m_kk; i++) {\n      vtotal += vbar[i] * moleFractions_[i];\n    }\n    doublereal dd = meanMolecularWeight() \/ vtotal;\n    State::setDensity(dd);\n  }\n\n  void GibbsExcessVPSSTP::setState_TP(doublereal t, doublereal p) {\n    State::setTemperature(t);\n    \/*\n     * Store the current pressure\n     *\/\n    m_Pcurrent = p;\n    \/*\n     * update the standard state thermo\n     * -> This involves calling the water function and setting the pressure\n     *\/\n    updateStandardStateThermo();\n  \n    \/*\n     * Calculate the partial molar volumes, and then the density of the fluid\n     *\/\n    calcDensity();\n  }\n \n\n\n  \/*\n   * - Activities, Standard States, Activity Concentrations -----------\n   *\/\n\n\n  doublereal GibbsExcessVPSSTP::standardConcentration(int k) const {\n    err(\"standardConcentration\");\n    return -1.0;\n  }\n\n  doublereal GibbsExcessVPSSTP::logStandardConc(int k) const {\n    err(\"logStandardConc\");\n    return -1.0;\n  }\n\n  void GibbsExcessVPSSTP::getActivities(doublereal* ac) const {\n    getActivityCoefficients(ac);\n    getMoleFractions(DATA_PTR(moleFractions_));\n    for (int k = 0; k < m_kk; k++) {\n      ac[k] *= moleFractions_[k];\n    }\n  }\n\n\n  void GibbsExcessVPSSTP::getElectrochemPotentials(doublereal* mu) const {\n    getChemPotentials(mu);\n    double ve = Faraday * electricPotential();\n    for (int k = 0; k < m_kk; k++) {\n      mu[k] += ve*charge(k);\n    }\n  }\n  \n  \/*\n   * ------------ Partial Molar Properties of the Solution ------------\n   *\/\n\n  \/\/ Return an array of partial molar volumes for the\n  \/\/ species in the mixture. Units: m^3\/kmol.\n  \/*\n   *  Frequently, for this class of thermodynamics representations,\n   *  the excess Volume due to mixing is zero. Here, we set it as\n   *  a default. It may be overriden in derived classes.\n   *\n   *  @param vbar   Output vector of speciar partial molar volumes.\n   *                Length = m_kk. units are m^3\/kmol.\n   *\/\n  void GibbsExcessVPSSTP::getPartialMolarVolumes(doublereal* vbar) const {\n    \/*\n     * Get the standard state values in m^3 kmol-1\n     *\/\n    getStandardVolumes(vbar);\n  }\n  \n\n\n  doublereal GibbsExcessVPSSTP::err(std::string msg) const {\n    throw CanteraError(\"GibbsExcessVPSSTP\",\"Base class method \"\n\t\t       +msg+\" called. Equation of state type: \"+int2str(eosType()));\n    return 0;\n  }\n\n \n\n  double GibbsExcessVPSSTP::checkMFSum(const doublereal * const x) const {\n    doublereal norm = accumulate(x, x + m_kk, 0.0);\n    if (fabs(norm - 1.0) > 1.0E-9) {\n      throw CanteraError(\"GibbsExcessVPSSTP::checkMFSun\",\n\t\t\t \"MF sum exceeded tolerance of 1.0E-9:\" + fp2str(norm));\n    }\n    return norm;\n  }\n\n  \/*\n   * Returns the units of the standard and general concentrations\n   * Note they have the same units, as their divisor is \n   * defined to be equal to the activity of the kth species\n   * in the solution, which is unitless.\n   *\n   * This routine is used in print out applications where the\n   * units are needed. Usually, MKS units are assumed throughout\n   * the program and in the XML input files. \n   *\n   * On return uA contains the powers of the units (MKS assumed)\n   * of the standard concentrations and generalized concentrations\n   * for the kth species.\n   *\n   *  uA[0] = kmol units - default  = 1\n   *  uA[1] = m    units - default  = -nDim(), the number of spatial\n   *                                dimensions in the Phase class.\n   *  uA[2] = kg   units - default  = 0;\n   *  uA[3] = Pa(pressure) units - default = 0;\n   *  uA[4] = Temperature units - default = 0;\n   *  uA[5] = time units - default = 0\n   *\/\n  void GibbsExcessVPSSTP::getUnitsStandardConc(double *uA, int k, int sizeUA) const {\n    for (int i = 0; i < sizeUA; i++) {\n      if (i == 0) uA[0] = 1.0;\n      if (i == 1) uA[1] = -nDim();\n      if (i == 2) uA[2] = 0.0;\n      if (i == 3) uA[3] = 0.0;\n      if (i == 4) uA[4] = 0.0;\n      if (i == 5) uA[5] = 0.0;\n    }\n  }\n\n\n  \/*\n   * @internal Initialize. This method is provided to allow\n   * subclasses to perform any initialization required after all\n   * species have been added. For example, it might be used to\n   * resize internal work arrays that must have an entry for\n   * each species.  The base class implementation does nothing,\n   * and subclasses that do not require initialization do not\n   * need to overload this method.  When importing a CTML phase\n   * description, this method is called just prior to returning\n   * from function importPhase.\n   *\n   * @see importCTML.cpp\n   *\/\n  void GibbsExcessVPSSTP::initThermo() {\n    initLengths();\n    VPStandardStateTP::initThermo();\n\n  }\n\n\n  \/\/   Initialize lengths of local variables after all species have\n  \/\/   been identified.\n  void  GibbsExcessVPSSTP::initLengths() {\n    m_kk = nSpecies();\n    moleFractions_.resize(m_kk);\n    lnActCoeff_Scaled_.resize(m_kk);\n    dlnActCoeffdT_Scaled_.resize(m_kk);\n    dlnActCoeffdlnC_Scaled_.resize(m_kk);\n    m_pp.resize(m_kk);\n  }\n\n  \/*\n   * initThermoXML()                (virtual from ThermoPhase)\n   *   Import and initialize a ThermoPhase object\n   *\n   * @param phaseNode This object must be the phase node of a\n   *             complete XML tree\n   *             description of the phase, including all of the\n   *             species data. In other words while \"phase\" must\n   *             point to an XML phase object, it must have\n   *             sibling nodes \"speciesData\" that describe\n   *             the species in the phase.\n   * @param id   ID of the phase. If nonnull, a check is done\n   *             to see if phaseNode is pointing to the phase\n   *             with the correct id. \n   *\/\n  void GibbsExcessVPSSTP::initThermoXML(XML_Node& phaseNode, std::string id) {\n\n\n    VPStandardStateTP::initThermoXML(phaseNode, id);\n  }\n  \n \/**\n   * Format a summary of the mixture state for output.\n   *\/           \n  std::string GibbsExcessVPSSTP::report(bool show_thermo) const {\n\n\n    char p[800];\n    string s = \"\";\n    try {\n      if (name() != \"\") {\n\tsprintf(p, \" \\n  %s:\\n\", name().c_str());\n\ts += p;\n      }\n      sprintf(p, \" \\n       temperature    %12.6g  K\\n\", temperature());\n      s += p;\n      sprintf(p, \"          pressure    %12.6g  Pa\\n\", pressure());\n      s += p;\n      sprintf(p, \"           density    %12.6g  kg\/m^3\\n\", density());\n      s += p;\n      sprintf(p, \"  mean mol. weight    %12.6g  amu\\n\", meanMolecularWeight());\n      s += p;\n\n      doublereal phi = electricPotential();\n      sprintf(p, \"         potential    %12.6g  V\\n\", phi);\n      s += p;\n\n      int kk = nSpecies();\n      array_fp x(kk);\n      array_fp molal(kk);\n      array_fp mu(kk);\n      array_fp muss(kk);\n      array_fp acMolal(kk);\n      array_fp actMolal(kk);\n      getMoleFractions(&x[0]);\n   \n      getChemPotentials(&mu[0]);\n      getStandardChemPotentials(&muss[0]);\n      getActivities(&actMolal[0]);\n \n\n      if (show_thermo) {\n        sprintf(p, \" \\n\");\n        s += p;\n        sprintf(p, \"                          1 kg            1 kmol\\n\");\n        s += p;\n        sprintf(p, \"                       -----------      ------------\\n\");\n        s += p;\n        sprintf(p, \"          enthalpy    %12.6g     %12.4g     J\\n\", \n\t\tenthalpy_mass(), enthalpy_mole());\n        s += p;\n        sprintf(p, \"   internal energy    %12.6g     %12.4g     J\\n\", \n\t\tintEnergy_mass(), intEnergy_mole());\n        s += p;\n        sprintf(p, \"           entropy    %12.6g     %12.4g     J\/K\\n\", \n\t\tentropy_mass(), entropy_mole());\n        s += p;\n        sprintf(p, \"    Gibbs function    %12.6g     %12.4g     J\\n\", \n\t\tgibbs_mass(), gibbs_mole());\n        s += p;\n        sprintf(p, \" heat capacity c_p    %12.6g     %12.4g     J\/K\\n\", \n\t\tcp_mass(), cp_mole());\n        s += p;\n        try {\n\t  sprintf(p, \" heat capacity c_v    %12.6g     %12.4g     J\/K\\n\", \n\t\t  cv_mass(), cv_mole());\n\t  s += p;\n        }\n        catch(CanteraError) {\n\t  sprintf(p, \" heat capacity c_v    <not implemented>       \\n\");\n\t  s += p;\n        }\n      }\n  \n    } catch (CanteraError) {\n      ;\n    }\n    return s;\n  }\n\n \n}\n\n<commit_msg>took out checkMFSum() which is inappropriate in that context.<commit_after>\/**\n *  @file GibbsExcessVPSSTP.cpp\n *   Definitions for intermediate ThermoPhase object for phases which\n *   employ excess gibbs free energy formulations\n *  (see \\ref thermoprops \n * and class \\link Cantera::GibbsExcessVPSSTP GibbsExcessVPSSTP\\endlink).\n *\n * Header file for a derived class of ThermoPhase that handles\n * variable pressure standard state methods for calculating\n * thermodynamic properties that are further based upon expressions\n * for the excess gibbs free energy expressed as a function of\n * the mole fractions.\n *\/\n\/*\n * Copywrite (2009) 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\/*\n *  $Date$\n *  $Revision$\n *\/\n\n\n#include \"GibbsExcessVPSSTP.h\"\nusing namespace std;\n\nnamespace Cantera {\n\n  \/*\n   * Default constructor.\n   *\n   *\/\n  GibbsExcessVPSSTP::GibbsExcessVPSSTP() :\n    VPStandardStateTP()\n  {\n  }\n\n  \/*\n   * Copy Constructor:\n   *\n   *  Note this stuff will not work until the underlying phase\n   *  has a working copy constructor\n   *\/\n  GibbsExcessVPSSTP::GibbsExcessVPSSTP(const GibbsExcessVPSSTP &b) :\n    VPStandardStateTP()\n  {\n    GibbsExcessVPSSTP::operator=(b);\n  }\n\n  \/*\n   * operator=()\n   *\n   *  Note this stuff will not work until the underlying phase\n   *  has a working assignment operator\n   *\/\n  GibbsExcessVPSSTP& GibbsExcessVPSSTP::\n  operator=(const GibbsExcessVPSSTP &b) {\n    if (&b == this) {\n      return *this;\n    }\n\n    VPStandardStateTP::operator=(b);\n\n    moleFractions_       = b.moleFractions_;\n    lnActCoeff_Scaled_   = b.lnActCoeff_Scaled_;\n    dlnActCoeffdT_Scaled_   = b.dlnActCoeffdT_Scaled_;\n    dlnActCoeffdlnC_Scaled_ = b.dlnActCoeffdlnC_Scaled_;\n    m_pp                 = b.m_pp;\n\n    return *this;\n  }\n\n  \/**\n   *\n   * ~GibbsExcessVPSSTP():   (virtual)\n   *\n   * Destructor: does nothing:\n   *\n   *\/\n  GibbsExcessVPSSTP::~GibbsExcessVPSSTP() {\n  }\n\n  \/*\n   * This routine duplicates the current object and returns\n   * a pointer to ThermoPhase.\n   *\/\n  ThermoPhase* \n  GibbsExcessVPSSTP::duplMyselfAsThermoPhase() const {\n    GibbsExcessVPSSTP* mtp = new GibbsExcessVPSSTP(*this);\n    return (ThermoPhase *) mtp;\n  }\n\n  \/*\n   *  -------------- Utilities -------------------------------\n   *\/\n\n  void GibbsExcessVPSSTP::setMassFractions(const doublereal* const y) {\n    State::setMassFractions(y);\n    getMoleFractions(DATA_PTR(moleFractions_));\n  }\n\n  void GibbsExcessVPSSTP::setMassFractions_NoNorm(const doublereal* const y) {\n    State::setMassFractions_NoNorm(y);\n    getMoleFractions(DATA_PTR(moleFractions_));\n  }\n\n void GibbsExcessVPSSTP::setMoleFractions(const doublereal* const x) {\n    State::setMoleFractions(x);\n    getMoleFractions(DATA_PTR(moleFractions_));\n  }\n\n  void GibbsExcessVPSSTP::setMoleFractions_NoNorm(const doublereal* const x) {\n    State::setMoleFractions_NoNorm(x);\n    getMoleFractions(DATA_PTR(moleFractions_));\n  }\n\n\n  void GibbsExcessVPSSTP::setConcentrations(const doublereal* const c) {\n    State::setConcentrations(c);\n    getMoleFractions(DATA_PTR(moleFractions_));\n  }\n\n\n  \/\/ Equation of state type flag.\n  \/*\n   * The ThermoPhase base class returns\n   * zero. Subclasses should define this to return a unique\n   * non-zero value. Known constants defined for this purpose are\n   * listed in mix_defs.h. The GibbsExcessVPSSTP class also returns\n   * zero, as it is a non-complete class.\n   *\/\n  int GibbsExcessVPSSTP::eosType() const { \n    return 0;\n  }\n\n \n\n  \/*\n   * ------------ Molar Thermodynamic Properties ----------------------\n   *\/\n\n  \/*\n   *\n   * ------------ Mechanical Properties ------------------------------\n   *\n   *\/\n\n  \/*\n   * Set the pressure at constant temperature. Units: Pa.\n   * This method sets a constant within the object.\n   * The mass density is not a function of pressure.\n   *\/\n  void GibbsExcessVPSSTP::setPressure(doublereal p) {\n    setState_TP(temperature(), p);\n  }\n\n  void GibbsExcessVPSSTP::calcDensity() {\n    double *vbar = &m_pp[0];\n    getPartialMolarVolumes(vbar);\n   \n    doublereal vtotal = 0.0;\n    for (int i = 0; i < m_kk; i++) {\n      vtotal += vbar[i] * moleFractions_[i];\n    }\n    doublereal dd = meanMolecularWeight() \/ vtotal;\n    State::setDensity(dd);\n  }\n\n  void GibbsExcessVPSSTP::setState_TP(doublereal t, doublereal p) {\n    State::setTemperature(t);\n    \/*\n     * Store the current pressure\n     *\/\n    m_Pcurrent = p;\n    \/*\n     * update the standard state thermo\n     * -> This involves calling the water function and setting the pressure\n     *\/\n    updateStandardStateThermo();\n  \n    \/*\n     * Calculate the partial molar volumes, and then the density of the fluid\n     *\/\n    calcDensity();\n  }\n \n\n\n  \/*\n   * - Activities, Standard States, Activity Concentrations -----------\n   *\/\n\n\n  doublereal GibbsExcessVPSSTP::standardConcentration(int k) const {\n    err(\"standardConcentration\");\n    return -1.0;\n  }\n\n  doublereal GibbsExcessVPSSTP::logStandardConc(int k) const {\n    err(\"logStandardConc\");\n    return -1.0;\n  }\n\n  void GibbsExcessVPSSTP::getActivities(doublereal* ac) const {\n    getActivityCoefficients(ac);\n    getMoleFractions(DATA_PTR(moleFractions_));\n    for (int k = 0; k < m_kk; k++) {\n      ac[k] *= moleFractions_[k];\n    }\n  }\n\n\n  void GibbsExcessVPSSTP::getElectrochemPotentials(doublereal* mu) const {\n    getChemPotentials(mu);\n    double ve = Faraday * electricPotential();\n    for (int k = 0; k < m_kk; k++) {\n      mu[k] += ve*charge(k);\n    }\n  }\n  \n  \/*\n   * ------------ Partial Molar Properties of the Solution ------------\n   *\/\n\n  \/\/ Return an array of partial molar volumes for the\n  \/\/ species in the mixture. Units: m^3\/kmol.\n  \/*\n   *  Frequently, for this class of thermodynamics representations,\n   *  the excess Volume due to mixing is zero. Here, we set it as\n   *  a default. It may be overriden in derived classes.\n   *\n   *  @param vbar   Output vector of speciar partial molar volumes.\n   *                Length = m_kk. units are m^3\/kmol.\n   *\/\n  void GibbsExcessVPSSTP::getPartialMolarVolumes(doublereal* vbar) const {\n    \/*\n     * Get the standard state values in m^3 kmol-1\n     *\/\n    getStandardVolumes(vbar);\n  }\n  \n\n\n  doublereal GibbsExcessVPSSTP::err(std::string msg) const {\n    throw CanteraError(\"GibbsExcessVPSSTP\",\"Base class method \"\n\t\t       +msg+\" called. Equation of state type: \"+int2str(eosType()));\n    return 0;\n  }\n\n \n\n  double GibbsExcessVPSSTP::checkMFSum(const doublereal * const x) const {\n    doublereal norm = accumulate(x, x + m_kk, 0.0);\n    if (fabs(norm - 1.0) > 1.0E-9) {\n      throw CanteraError(\"GibbsExcessVPSSTP::checkMFSum\",\n\t\t\t \"(MF sum - 1) exceeded tolerance of 1.0E-9:\" + fp2str(norm));\n    }\n    return norm;\n  }\n\n  \/*\n   * Returns the units of the standard and general concentrations\n   * Note they have the same units, as their divisor is \n   * defined to be equal to the activity of the kth species\n   * in the solution, which is unitless.\n   *\n   * This routine is used in print out applications where the\n   * units are needed. Usually, MKS units are assumed throughout\n   * the program and in the XML input files. \n   *\n   * On return uA contains the powers of the units (MKS assumed)\n   * of the standard concentrations and generalized concentrations\n   * for the kth species.\n   *\n   *  uA[0] = kmol units - default  = 1\n   *  uA[1] = m    units - default  = -nDim(), the number of spatial\n   *                                dimensions in the Phase class.\n   *  uA[2] = kg   units - default  = 0;\n   *  uA[3] = Pa(pressure) units - default = 0;\n   *  uA[4] = Temperature units - default = 0;\n   *  uA[5] = time units - default = 0\n   *\/\n  void GibbsExcessVPSSTP::getUnitsStandardConc(double *uA, int k, int sizeUA) const {\n    for (int i = 0; i < sizeUA; i++) {\n      if (i == 0) uA[0] = 1.0;\n      if (i == 1) uA[1] = -nDim();\n      if (i == 2) uA[2] = 0.0;\n      if (i == 3) uA[3] = 0.0;\n      if (i == 4) uA[4] = 0.0;\n      if (i == 5) uA[5] = 0.0;\n    }\n  }\n\n\n  \/*\n   * @internal Initialize. This method is provided to allow\n   * subclasses to perform any initialization required after all\n   * species have been added. For example, it might be used to\n   * resize internal work arrays that must have an entry for\n   * each species.  The base class implementation does nothing,\n   * and subclasses that do not require initialization do not\n   * need to overload this method.  When importing a CTML phase\n   * description, this method is called just prior to returning\n   * from function importPhase.\n   *\n   * @see importCTML.cpp\n   *\/\n  void GibbsExcessVPSSTP::initThermo() {\n    initLengths();\n    VPStandardStateTP::initThermo();\n\n  }\n\n\n  \/\/   Initialize lengths of local variables after all species have\n  \/\/   been identified.\n  void  GibbsExcessVPSSTP::initLengths() {\n    m_kk = nSpecies();\n    moleFractions_.resize(m_kk);\n    lnActCoeff_Scaled_.resize(m_kk);\n    dlnActCoeffdT_Scaled_.resize(m_kk);\n    dlnActCoeffdlnC_Scaled_.resize(m_kk);\n    m_pp.resize(m_kk);\n  }\n\n  \/*\n   * initThermoXML()                (virtual from ThermoPhase)\n   *   Import and initialize a ThermoPhase object\n   *\n   * @param phaseNode This object must be the phase node of a\n   *             complete XML tree\n   *             description of the phase, including all of the\n   *             species data. In other words while \"phase\" must\n   *             point to an XML phase object, it must have\n   *             sibling nodes \"speciesData\" that describe\n   *             the species in the phase.\n   * @param id   ID of the phase. If nonnull, a check is done\n   *             to see if phaseNode is pointing to the phase\n   *             with the correct id. \n   *\/\n  void GibbsExcessVPSSTP::initThermoXML(XML_Node& phaseNode, std::string id) {\n\n\n    VPStandardStateTP::initThermoXML(phaseNode, id);\n  }\n  \n \/**\n   * Format a summary of the mixture state for output.\n   *\/           \n  std::string GibbsExcessVPSSTP::report(bool show_thermo) const {\n\n\n    char p[800];\n    string s = \"\";\n    try {\n      if (name() != \"\") {\n\tsprintf(p, \" \\n  %s:\\n\", name().c_str());\n\ts += p;\n      }\n      sprintf(p, \" \\n       temperature    %12.6g  K\\n\", temperature());\n      s += p;\n      sprintf(p, \"          pressure    %12.6g  Pa\\n\", pressure());\n      s += p;\n      sprintf(p, \"           density    %12.6g  kg\/m^3\\n\", density());\n      s += p;\n      sprintf(p, \"  mean mol. weight    %12.6g  amu\\n\", meanMolecularWeight());\n      s += p;\n\n      doublereal phi = electricPotential();\n      sprintf(p, \"         potential    %12.6g  V\\n\", phi);\n      s += p;\n\n      int kk = nSpecies();\n      array_fp x(kk);\n      array_fp molal(kk);\n      array_fp mu(kk);\n      array_fp muss(kk);\n      array_fp acMolal(kk);\n      array_fp actMolal(kk);\n      getMoleFractions(&x[0]);\n   \n      getChemPotentials(&mu[0]);\n      getStandardChemPotentials(&muss[0]);\n      getActivities(&actMolal[0]);\n \n\n      if (show_thermo) {\n        sprintf(p, \" \\n\");\n        s += p;\n        sprintf(p, \"                          1 kg            1 kmol\\n\");\n        s += p;\n        sprintf(p, \"                       -----------      ------------\\n\");\n        s += p;\n        sprintf(p, \"          enthalpy    %12.6g     %12.4g     J\\n\", \n\t\tenthalpy_mass(), enthalpy_mole());\n        s += p;\n        sprintf(p, \"   internal energy    %12.6g     %12.4g     J\\n\", \n\t\tintEnergy_mass(), intEnergy_mole());\n        s += p;\n        sprintf(p, \"           entropy    %12.6g     %12.4g     J\/K\\n\", \n\t\tentropy_mass(), entropy_mole());\n        s += p;\n        sprintf(p, \"    Gibbs function    %12.6g     %12.4g     J\\n\", \n\t\tgibbs_mass(), gibbs_mole());\n        s += p;\n        sprintf(p, \" heat capacity c_p    %12.6g     %12.4g     J\/K\\n\", \n\t\tcp_mass(), cp_mole());\n        s += p;\n        try {\n\t  sprintf(p, \" heat capacity c_v    %12.6g     %12.4g     J\/K\\n\", \n\t\t  cv_mass(), cv_mole());\n\t  s += p;\n        }\n        catch(CanteraError) {\n\t  sprintf(p, \" heat capacity c_v    <not implemented>       \\n\");\n\t  s += p;\n        }\n      }\n  \n    } catch (CanteraError) {\n      ;\n    }\n    return s;\n  }\n\n \n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\r\n\/\/ Created by redra on 19.04.2017.\r\n\/\/\r\n\r\n#ifndef BUFFERS_HEAPPACKBUFFER_HPP\r\n#define BUFFERS_HEAPPACKBUFFER_HPP\r\n\r\n#include <cstdint>\r\n#include \"PackBuffer.hpp\"\r\n\r\nnamespace Buffers {\r\n\/*!\r\n * Pack buffer class based on stack buffer\r\n * @tparam _Size Size of stack buffer\r\n *\/\r\nclass HeapPackBuffer\r\n    : public PackBuffer {\r\n public:\r\n  HeapPackBuffer(const size_t size)\r\n      : PackBuffer(new uint8_t[size]{0}, size) {\r\n  }\r\n\r\n  ~HeapPackBuffer() {\r\n    delete [] p_msg_;\r\n  }\r\n};\r\n}\r\n\r\n#endif \/\/BUFFERS_HEAPPACKBUFFER_HPP<commit_msg>Fixed comments<commit_after>\/\/\r\n\/\/ Created by redra on 19.04.2017.\r\n\/\/\r\n\r\n#ifndef BUFFERS_HEAPPACKBUFFER_HPP\r\n#define BUFFERS_HEAPPACKBUFFER_HPP\r\n\r\n#include <cstdint>\r\n#include \"PackBuffer.hpp\"\r\n\r\nnamespace Buffers {\r\n\/*!\r\n * Pack buffer class based on heap buffer\r\n * @tparam _Size Size of heap buffer\r\n *\/\r\nclass HeapPackBuffer\r\n    : public PackBuffer {\r\n public:\r\n  HeapPackBuffer(const size_t size)\r\n      : PackBuffer(new uint8_t[size]{0}, size) {\r\n  }\r\n\r\n  ~HeapPackBuffer() {\r\n    delete [] p_msg_;\r\n  }\r\n};\r\n}\r\n\r\n#endif \/\/BUFFERS_HEAPPACKBUFFER_HPP<|endoftext|>"}
{"text":"<commit_before>\/\/ Time:  O(n)\n\/\/ Space: O(1)\n\n\/\/ DP with rolling window.\nclass Solution {\npublic:\n    \/**\n     * @param values: a vector of integers\n     * @return: a boolean which equals to true if the first player will win\n     *\/\n    bool firstWillWin(vector<int> &values) {\n        \/\/ For boundary case.\n        if (values.size() < 2) {\n            return values.size() % 2 == 1;\n        }\n        \n        vector<int> P(5, 0);\n        int sum = 0;\n        \/\/ P[i] = max(values[i] + min(P[i + 2], P[i + 3]),\n        \/\/            values[i] + values[i + 1] + min(P[i + 3], P[i + 4]))\n        for (int i = values.size() - 1; i >= 0; --i) {\n            sum += values[i];\n            int values_i_plus_1 = i + 1 < values.size() ? values[i + 1]: 0;\n            int a = i + 2 < values.size() ? P[(i + 2) % 5] : 0;\n            int b = i + 3 < values.size() ? P[(i + 3) % 5] : 0;\n            int c = i + 4 < values.size() ? P[(i + 4) % 5] : 0;\n            \n            P[i % 5] = max(values[i] + min(a, b), \n                           values[i] + values_i_plus_1 + min(b, c));\n        }\n        \n        return P[0] > sum - P[0];\n    }\n};\n\n\n\/\/ Time:  O(n)\n\/\/ Space: O(n)\nclass Solution2 {\npublic:\n    \/**\n     * @param values: a vector of integers\n     * @return: a boolean which equals to true if the first player will win\n     *\/\n    bool firstWillWin(vector<int> &values) {\n        \/\/ For boundary case.\n        if (values.size() < 2) {\n            return values.size() % 2 == 1;\n        }\n        \n        vector<int> P(values.size(), 0);\n        int sum = 0;\n        \/\/ P[i] = max(values[i] + min(P[i + 2], P[i + 3]),\n        \/\/            values[i] + values[i + 1] + min(P[i + 3], P[i + 4]))\n        for (int i = values.size() - 1; i >= 0; --i) {\n            sum += values[i];\n            int values_i_plus_1 = i + 1 < values.size() ? values[i + 1]: 0;\n            int a = i + 2 < values.size() ? P[i + 2] : 0;\n            int b = i + 3 < values.size() ? P[i + 3] : 0;\n            int c = i + 4 < values.size() ? P[i + 4] : 0;\n            P[i] = max(values[i] + min(a, b), \n                       values[i] + values_i_plus_1 + min(b, c));\n        }\n        \n        return P[0] > sum - P[0];\n    }\n};\n<commit_msg>Update coins-in-a-line-ii.cpp<commit_after>\/\/ Time:  O(n)\n\/\/ Space: O(1)\n\n\/\/ DP with rolling window.\nclass Solution {\npublic:\n    \/**\n     * @param values: a vector of integers\n     * @return: a boolean which equals to true if the first player will win\n     *\/\n    bool firstWillWin(vector<int> &values) {\n        \/\/ For boundary case.\n        if (values.size() < 2) {\n            return values.size() % 2 == 1;\n        }\n        \n        vector<int> P(5, 0);\n        int sum = 0;\n        \/\/ P[i] = max(values[i] + min(P[i + 2], P[i + 3]),\n        \/\/            values[i] + values[i + 1] + min(P[i + 3], P[i + 4]))\n        for (int i = values.size() - 1; i >= 0; --i) {\n            sum += values[i];\n            int values_i_plus_1 = i + 1 < values.size() ? values[i + 1]: 0;\n            int a = i + 2 < values.size() ? P[(i + 2) % 5] : 0;\n            int b = i + 3 < values.size() ? P[(i + 3) % 5] : 0;\n            int c = i + 4 < values.size() ? P[(i + 4) % 5] : 0;\n            P[i % 5] = max(values[i] + min(a, b), \n                           values[i] + values_i_plus_1 + min(b, c));\n        }\n        \n        return P[0] > sum - P[0];\n    }\n};\n\n\n\/\/ Time:  O(n)\n\/\/ Space: O(n)\nclass Solution2 {\npublic:\n    \/**\n     * @param values: a vector of integers\n     * @return: a boolean which equals to true if the first player will win\n     *\/\n    bool firstWillWin(vector<int> &values) {\n        \/\/ For boundary case.\n        if (values.size() < 2) {\n            return values.size() % 2 == 1;\n        }\n        \n        vector<int> P(values.size(), 0);\n        int sum = 0;\n        \/\/ P[i] = max(values[i] + min(P[i + 2], P[i + 3]),\n        \/\/            values[i] + values[i + 1] + min(P[i + 3], P[i + 4]))\n        for (int i = values.size() - 1; i >= 0; --i) {\n            sum += values[i];\n            int values_i_plus_1 = i + 1 < values.size() ? values[i + 1]: 0;\n            int a = i + 2 < values.size() ? P[i + 2] : 0;\n            int b = i + 3 < values.size() ? P[i + 3] : 0;\n            int c = i + 4 < values.size() ? P[i + 4] : 0;\n            P[i] = max(values[i] + min(a, b), \n                       values[i] + values_i_plus_1 + min(b, c));\n        }\n        \n        return P[0] > sum - P[0];\n    }\n};\n<|endoftext|>"}
{"text":"<commit_before>\/*******************************************************************************\n*    ALMA - Atacama Large Millimiter Array\n*    (c) Associated Universities Inc., 2002 \n*    (c) European Southern Observatory, 2002\n*    Copyright by ESO (in the framework of the ALMA collaboration)\n*    and Cosylab 2002, 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: acsncRTSupplierImpl.cpp,v 1.13 2007\/02\/13 08:56:12 bjeram Exp $\"\n*\n* who       when      what\n* --------  --------  ----------------------------------------------\n* david  20\/09\/02  created \n*\/\n\/\/-----------------------------------------------------------------------------\n#include \"acsncRTSupplier.h\"\nnamespace nc {\n\/\/-----------------------------------------------------------------------------\nRTSupplier::RTSupplier(const char* channelName, \n\t\t       acscomponent::ACSComponentImpl* component) : \n    Supplier(channelName, component),\n    threadManager_mp(0)\n{\n    ACS_TRACE(\"RTSupplier::RTSupplier\");\n    \n    \/\/spawn the thread that ends up publishing events\n    threadManager_mp = new BACIThreadManager();\n    threadManager_mp->create(\"worker\", \n\t\t\t      (void*)RTSupplier::worker, \n\t\t\t      static_cast<void *>(this));\n    threadManager_mp->resume(\"worker\");\n}\n\/\/-----------------------------------------------------------------------------\nvoid \nRTSupplier::disconnect()\n{\n    ACS_TRACE(\"RTSupplier::~RTSupplier\");\n\n    \/\/Delete the thread manager\n    if(threadManager_mp != 0)\n\t{\n\tthreadManager_mp->stop(\"worker\");\n\tdelete threadManager_mp;\n\tthreadManager_mp=0;\n\t}\n\t\t    \n    \/\/Now we rush through and publish any events still left in the queue\n    \/\/must use a mutex for any STL write operation\n    eventQueueMutex_m.acquire();\n    while(unpublishedEvents_m.empty() != true)\n\t{\n\ttry\n\t    {\n\t    \/\/publish the event.\n\t    publishEvent(unpublishedEvents_m.front());\n\n\t    \/\/remove the last event\n\t    unpublishedEvents_m.pop();\n\t    }\n\tcatch(...)\n\t    {\n\t    ACS_SHORT_LOG((LM_ERROR,\n\t\t\t   \"RTSupplier::disconnect() %s channel - problem publishing a saved event!\",\n\t\t\t   channelName_mp));\n\t    }\n\t}\n    \/\/do NOT release mutex to ensure events can no longer be published\n    \/\/eventQueueMutex_m.release();\n\n    \/\/just call superclass disconnect\n    Supplier::disconnect();\n}\n\/\/-----------------------------------------------------------------------------\nvoid \nRTSupplier::worker(void* param_p)\n{\n    \/\/sanity check\n    if (param_p == 0) \n\t{\n\treturn;\n\t}\n    \n    \/\/get access to ourself...\n    BACIThreadParameter *baciParameter_p = static_cast<BACIThreadParameter *>(param_p);\n    BACIThread *myself_p = baciParameter_p->getBACIThread();\n    \n    \/\/ Variables have to be passed explicitly\n    RTSupplier *supplier_p = static_cast<RTSupplier *>(const_cast<void *>(baciParameter_p->getParameter()));\n    \n    if (BACIThread::InitThread != 0) \n\t{\n\tBACIThread::InitThread(\"worker\");\n\t}\n    \n    \/\/ Control loop\n    while(myself_p->check() == true)\n\t{\n\t\/\/there are unpublished events\n\tif((myself_p->isSuspended() == false) && (supplier_p->unpublishedEvents_m.empty() != true))\n\t    {\t\n\t    \/\/Now we rush through and publish any events in the queue\n\t    while(supplier_p->unpublishedEvents_m.empty() != true)\n\t\t{\n\t\ttry\n\t\t    {\n\t\t    \/\/no need for the mutex here (reads are thread safe)\n\t\t    supplier_p->publishEvent(supplier_p->unpublishedEvents_m.front());\n\n\t\t    \/\/must use a mutex for any STL write operation\n\t\t    ACE_Guard<ACE_Thread_Mutex> guard(supplier_p->eventQueueMutex_m);\/\/.acquire();\n\t\t    supplier_p->unpublishedEvents_m.pop();\n\/\/\t\t    supplier_p->eventQueueMutex_m.release();\n\t\t    }\n\t\tcatch(CORBAProblemEx &_ex)\n\t\t    {\n\t\t    ACS_SHORT_LOG((LM_ERROR,\"RTSupplier::worker() %s channel - problem publishing a saved event!\",\n\t\t\t\t   supplier_p->channelName_mp));\n\t\t    CORBAProblemExImpl ex(_ex);\n\t\t    ex.log();\n\t\t    }\n\t\tcatch(...)\n\t\t    {\n\t\t    ACS_SHORT_LOG((LM_ERROR,\"RTSupplier::worker() %s channel - problem publishing a saved event!\",\n\t\t\t\t   supplier_p->channelName_mp));\n\t\t    }\n\t\t}\n\t    }\n\tmyself_p->sleep();\n\t}\n    \n    if (BACIThread::DoneThread != 0) \n\t{\n\tBACIThread::DoneThread();\n\t}\n    delete baciParameter_p;\n    myself_p->setStopped();\n}\n\/\/-----------------------------------------------------------------------------\nRTSupplier::~RTSupplier(){;}\n\/\/----------------------------------------------------------------------\n }; \n\n\n\n\n\n\n<commit_msg>imporved error handling: we catch CORBA::SystemException<commit_after>\/*******************************************************************************\n*    ALMA - Atacama Large Millimiter Array\n*    (c) Associated Universities Inc., 2002 \n*    (c) European Southern Observatory, 2002\n*    Copyright by ESO (in the framework of the ALMA collaboration)\n*    and Cosylab 2002, 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: acsncRTSupplierImpl.cpp,v 1.14 2007\/03\/01 14:01:14 bjeram Exp $\"\n*\n* who       when      what\n* --------  --------  ----------------------------------------------\n* david  20\/09\/02  created \n*\/\n\/\/-----------------------------------------------------------------------------\n#include \"acsncRTSupplier.h\"\nnamespace nc {\n\/\/-----------------------------------------------------------------------------\nRTSupplier::RTSupplier(const char* channelName, \n\t\t       acscomponent::ACSComponentImpl* component) : \n    Supplier(channelName, component),\n    threadManager_mp(0)\n{\n    ACS_TRACE(\"RTSupplier::RTSupplier\");\n    \n    \/\/spawn the thread that ends up publishing events\n    threadManager_mp = new BACIThreadManager();\n    threadManager_mp->create(\"worker\", \n\t\t\t      (void*)RTSupplier::worker, \n\t\t\t      static_cast<void *>(this));\n    threadManager_mp->resume(\"worker\");\n}\n\/\/-----------------------------------------------------------------------------\nvoid \nRTSupplier::disconnect()\n{\n    ACS_TRACE(\"RTSupplier::~RTSupplier\");\n\n    \/\/Delete the thread manager\n    if(threadManager_mp != 0)\n\t{\n\tthreadManager_mp->stop(\"worker\");\n\tdelete threadManager_mp;\n\tthreadManager_mp=0;\n\t}\n\t\t    \n    \/\/Now we rush through and publish any events still left in the queue\n    \/\/must use a mutex for any STL write operation\n    eventQueueMutex_m.acquire();\n    while(unpublishedEvents_m.empty() != true)\n\t{\n\ttry\n\t    {\n\t    \/\/publish the event.\n\t    publishEvent(unpublishedEvents_m.front());\n\n\t    \/\/remove the last event\n\t    unpublishedEvents_m.pop();\n\t    }\n\tcatch(...)\n\t    {\n\t    ACS_SHORT_LOG((LM_ERROR,\n\t\t\t   \"RTSupplier::disconnect() %s channel - problem publishing a saved event!\",\n\t\t\t   channelName_mp));\n\t    }\n\t}\n    \/\/do NOT release mutex to ensure events can no longer be published\n    \/\/eventQueueMutex_m.release();\n\n    \/\/just call superclass disconnect\n    Supplier::disconnect();\n}\n\/\/-----------------------------------------------------------------------------\nvoid \nRTSupplier::worker(void* param_p)\n{\n    \/\/sanity check\n    if (param_p == 0) \n\t{\n\treturn;\n\t}\n    \n    \/\/get access to ourself...\n    BACIThreadParameter *baciParameter_p = static_cast<BACIThreadParameter *>(param_p);\n    BACIThread *myself_p = baciParameter_p->getBACIThread();\n    \n    \/\/ Variables have to be passed explicitly\n    RTSupplier *supplier_p = static_cast<RTSupplier *>(const_cast<void *>(baciParameter_p->getParameter()));\n    \n    if (BACIThread::InitThread != 0) \n\t{\n\tBACIThread::InitThread(\"worker\");\n\t}\n    \n    \/\/ Control loop\n    while(myself_p->check() == true)\n\t{\n\t\/\/there are unpublished events\n\tif((myself_p->isSuspended() == false) && (supplier_p->unpublishedEvents_m.empty() != true))\n\t    {\t\n\t    \/\/Now we rush through and publish any events in the queue\n\t    while(supplier_p->unpublishedEvents_m.empty() != true)\n\t\t{\n\t\ttry\n\t\t    {\n\t\t    \/\/no need for the mutex here (reads are thread safe)\n\t\t    supplier_p->publishEvent(supplier_p->unpublishedEvents_m.front());\n\n\t\t    \/\/must use a mutex for any STL write operation\n\t\t    ACE_Guard<ACE_Thread_Mutex> guard(supplier_p->eventQueueMutex_m);\/\/.acquire();\n\t\t    supplier_p->unpublishedEvents_m.pop();\n\/\/\t\t    supplier_p->eventQueueMutex_m.release();\n\t\t    }\n\t\tcatch(CORBAProblemEx &_ex)\n\t\t    {\n\t\t    ACS_SHORT_LOG((LM_ERROR,\"RTSupplier::worker() %s channel - problem publishing a saved event!\",\n\t\t\t\t   supplier_p->channelName_mp));\n\t\t    CORBAProblemExImpl ex(_ex);\n\t\t    ex.log();\n\t\t    }\n\t\tcatch(CORBA::SystemException &ex)\n\t\t    {\n\/\/tbd: we have to improve here the erro handling. Now we print out more that is necessary\n\t\t    ACS_SHORT_LOG((LM_ERROR,\"RTSupplier::worker() %s channel - problem publishing a saved event!\",\n\t\t\t\t   supplier_p->channelName_mp));\n\t\t    ACSErrTypeCommon::CORBAProblemExImpl corbaProblemEx(__FILE__, __LINE__,\n\t\t\t\t\t\t\t    \"MACIContainerServices::getCORBAComponentNonSticky\");\n\t\t    corbaProblemEx.setMinor(ex.minor());\n\t\t    corbaProblemEx.setCompletionStatus(ex.completed());\n\t\t    corbaProblemEx.setInfo(ex._info().c_str());\n\t\t    corbaProblemEx.log();\n\t\t    }\n\t\tcatch(...)\n\t\t    {\n\t\t    ACS_SHORT_LOG((LM_ERROR,\"RTSupplier::worker() %s channel - problem publishing a saved event!\",\n\t\t\t\t   supplier_p->channelName_mp));\n\t\t    }\n\t\t}\n\t    }\n\tmyself_p->sleep();\n\t}\n    \n    if (BACIThread::DoneThread != 0) \n\t{\n\tBACIThread::DoneThread();\n\t}\n    delete baciParameter_p;\n    myself_p->setStopped();\n}\n\/\/-----------------------------------------------------------------------------\nRTSupplier::~RTSupplier(){;}\n\/\/----------------------------------------------------------------------\n }; \n\n\n\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2014.  All rights reserved\n *\/\n#include    \"..\/StroikaPreComp.h\"\n\n#include    \"..\/Characters\/String.h\"\n#include    \"..\/Containers\/Mapping.h\"\n#include    \"..\/Containers\/Sequence.h\"\n#include    \"..\/Execution\/Common.h\"\n\n#include    \"Atom.h\"\n\n\n\nusing   namespace   Stroika::Foundation;\nusing   namespace   Stroika::Foundation::Containers;\nusing   namespace   Stroika::Foundation::DataExchange;\n\n\nnamespace {\n    \/\/ VERY CRUDDY (but close to what we use in HF) impl - to get started...\n    mutex   sCritSec_;  \/\/ lock needed here to keep map and sequence in sync\n    Mapping<String, AtomManager_Default::AtomInternalType>*   sMap_;\n    Sequence<String>*                                         sSeq_;\n}\n\n\n\n\n\n\n\/*\n ********************************************************************************\n *************** DataExchange::Private_::AtomModuleData *************************\n ********************************************************************************\n *\/\nDataExchange::Private_::AtomModuleData::AtomModuleData ()\n{\n    Assert (sMap_ == nullptr);\n    Assert (sSeq_ == nullptr);\n    sMap_ = new Mapping<String, AtomManager_Default::AtomInternalType> ();\n    sSeq_ = new Sequence<String> ();\n}\n\nDataExchange::Private_::AtomModuleData::~AtomModuleData ()\n{\n    delete sMap_;\n    sMap_ = nullptr;\n    delete sSeq_;\n    sSeq_ = nullptr;\n}\n\n\n\n\n\n\/*\n ********************************************************************************\n ******************** DataExchange::AtomManager_Default *************************\n ********************************************************************************\n *\/\nAtomManager_Default::AtomInternalType   AtomManager_Default::Intern (const String& s)\n{\n#if     qCompilerAndStdLib_make_unique_lock_IsSlow\n    MACRO_LOCK_GUARD_CONTEXT (sCritSec_);\n#else\n    auto    critSec { Execution::make_unique_lock (sCritSec_) };\n#endif\n    auto i = sMap_->Lookup (s);\n    if (i.IsPresent ()) {\n        return *i;\n    }\n    AtomManager_Default::AtomInternalType v = sSeq_->GetLength ();\n    sSeq_->Append (s);\n    sMap_->Add (s, v);\n    Ensure (Extract (v) == s);\n    return v;\n}\n\nString  AtomManager_Default::Extract (AtomInternalType atomI)\n{\n    Require (atomI != kEmpty);\n    return (*sSeq_)[atomI];\n}\n<commit_msg>use SpinLock in atom code instead of mutex since not held long, and speed helps. Plus lock before access to sequnce in Intern() since soon will not have Sequence<> safe by itself (threadsafe)<commit_after>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2014.  All rights reserved\n *\/\n#include    \"..\/StroikaPreComp.h\"\n\n#include    \"..\/Characters\/String.h\"\n#include    \"..\/Containers\/Mapping.h\"\n#include    \"..\/Containers\/Sequence.h\"\n#include    \"..\/Execution\/Common.h\"\n#include    \"..\/Execution\/SpinLock.h\"\n\n#include    \"Atom.h\"\n\n\n\nusing   namespace   Stroika::Foundation;\nusing   namespace   Stroika::Foundation::Containers;\nusing   namespace   Stroika::Foundation::DataExchange;\n\n\n\/\/ @todo Consider using Synchonized<> for Sequence<>\n\nnamespace {\n    \/\/ VERY CRUDDY (but close to what we use in HF) impl - to get started...\n    Execution::SpinLock   sCritSec_;  \/\/ lock needed here to keep map and sequence in sync\n    Mapping<String, AtomManager_Default::AtomInternalType>*   sMap_;\n    Sequence<String>*                                         sSeq_;\n}\n\n\n\n\n\n\n\/*\n ********************************************************************************\n *************** DataExchange::Private_::AtomModuleData *************************\n ********************************************************************************\n *\/\nDataExchange::Private_::AtomModuleData::AtomModuleData ()\n{\n    Assert (sMap_ == nullptr);\n    Assert (sSeq_ == nullptr);\n    sMap_ = new Mapping<String, AtomManager_Default::AtomInternalType> ();\n    sSeq_ = new Sequence<String> ();\n}\n\nDataExchange::Private_::AtomModuleData::~AtomModuleData ()\n{\n    delete sMap_;\n    sMap_ = nullptr;\n    delete sSeq_;\n    sSeq_ = nullptr;\n}\n\n\n\n\n\n\/*\n ********************************************************************************\n ******************** DataExchange::AtomManager_Default *************************\n ********************************************************************************\n *\/\nAtomManager_Default::AtomInternalType   AtomManager_Default::Intern (const String& s)\n{\n    AtomManager_Default::AtomInternalType   v;\n    {\n#if     qCompilerAndStdLib_make_unique_lock_IsSlow\n        MACRO_LOCK_GUARD_CONTEXT (sCritSec_);\n#else\n        auto    critSec { Execution::make_unique_lock (sCritSec_) };\n#endif\n        auto i = sMap_->Lookup (s);\n        if (i.IsPresent ()) {\n            return *i;\n        }\n        v = sSeq_->GetLength ();\n        sSeq_->Append (s);\n        sMap_->Add (s, v);\n    }\n    Ensure (Extract (v) == s);\n    return v;\n}\n\nString  AtomManager_Default::Extract (AtomInternalType atomI)\n{\n    Require (atomI != kEmpty);\n#if     qCompilerAndStdLib_make_unique_lock_IsSlow\n    MACRO_LOCK_GUARD_CONTEXT (sCritSec_);\n#else\n    auto    critSec { Execution::make_unique_lock (sCritSec_) };\n#endif\n    return (*sSeq_)[atomI];\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/ \\file AddTaskNucleiYield.C\n\/\/\/ \\brief Simple macro to add the task to a grid job\n\/\/\/\n\/\/\/ The task is here added several times to analyse different particle species and to investigate\n\/\/\/ different set of cuts in only one run.\n\/\/\/\n\/\/\/ \\author Maximiliano Puccio <maximiliano.puccio@cern.ch>, University and INFN Torino\n\/\/\/ \\date Feb 19th, 2015\n\n#if !defined(__CINT__) || defined(__MAKECINT__)\n#include <Rtypes.h>\n#include <TString.h>\n#include \"AliAnalysisTaskNucleiYield.h\"\n#include \"AliAnalysisManager.h\"\n#include \"AliAnalysisDataContainer.h\"\n#include \"AliPID.h\"\n#endif\n\nAliAnalysisTaskNucleiYield* AddTaskNucleiYield_ppHM(Bool_t isMC = kFALSE,\n    AliPID::EParticleType part = AliPID::kDeuteron,\n    Int_t pdgCode = 1000010020,\n    TString tskname = \"deuteron\",\n    TString suffix = \"\") {\n\n  \/\/ Get the current analysis manager\n  AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n  if (!mgr) {\n    Error(\"AddTaskNucleiYield\", \"No analysis manager found.\");\n    return 0x0;\n  }\n\n  \/\/ Check the analysis type using the event handlers connected to the analysis manager.\n  if (!mgr->GetInputEventHandler()) {\n    ::Error(\"AddTaskNucleiYield\", \"This task requires an input event handler\");\n    return 0x0;\n  }\n\n  tskname.Append(Form(\"%s\",suffix.Data()));\n\n  AliAnalysisTaskNucleiYield *deu = new AliAnalysisTaskNucleiYield(tskname);\n  deu->fEventCut.OverrideAutomaticTriggerSelection(AliVEvent::kHighMultV0 | AliVEvent::kINT7);\n\n  deu->SetParticleType(part);\n  deu->SetPDG(pdgCode);\n  deu->SetIsMC(isMC);\n  deu->SetDCABins(80,-0.5,0.5);\n\n  deu->SetRequireTPCpidSigmas(3.f);\n  float cent[17] = {-5.f,0.f,0.01f,0.07f,0.1f,1.f,5.f,10.f,20.f,30.f,40.f,50.f,60.f,70.f,80.f,90.f,100.f};\n  deu->SetCentBins(16, cent);\n  deu->SetUseFlattening(false);\n  float pt[20] = {\n    0.5f,0.6f,0.7f,0.8f,0.9f,1.0f,1.1f,1.2f,1.4f,1.6f,\n    1.8f,2.0f,2.2f,2.6f,3.0f,3.4f,3.8f,4.4f,5.0f,6.0f\n  };\n  deu->SetPtBins(19,pt);\n\n  float dcabins[53] = {\n    -1.30,-1.20,-1.10,-1.00,-0.90,-0.80,-0.70,-0.60,-0.50,-0.40,\n    -0.35,-0.30,-0.25,-0.20,-0.15,-0.12,-0.10,-0.09,-0.08,-0.07,\n    -0.06,-0.05,-0.04,-0.03,-0.02,-0.01, 0.00, 0.01, 0.02, 0.03,\n     0.04, 0.05, 0.06, 0.07, 0.08, 0.09, 0.10, 0.12, 0.15, 0.20,\n     0.25, 0.30, 0.35, 0.40, 0.50, 0.60, 0.70, 0.80, 0.90, 1.00,\n     1.10, 1.20, 1.30\n  };\n  deu->SetDCABins(52,dcabins);\n\n  mgr->AddTask(deu);\n\n  TString output = \"AnalysisResults.root\";\n  AliAnalysisDataContainer *deuCont = mgr->CreateContainer(Form(\"nuclei_%s\",tskname.Data()),\n      TList::Class(),\n      AliAnalysisManager::kOutputContainer,\n      output.Data());\n  mgr->ConnectInput  (deu,  0, mgr->GetCommonInputContainer());\n  mgr->ConnectOutput (deu,  1, deuCont);\n  return deu;\n}\n<commit_msg>Fix binning in HM addTask<commit_after>\/\/\/ \\file AddTaskNucleiYield.C\n\/\/\/ \\brief Simple macro to add the task to a grid job\n\/\/\/\n\/\/\/ The task is here added several times to analyse different particle species and to investigate\n\/\/\/ different set of cuts in only one run.\n\/\/\/\n\/\/\/ \\author Maximiliano Puccio <maximiliano.puccio@cern.ch>, University and INFN Torino\n\/\/\/ \\date Feb 19th, 2015\n\n#if !defined(__CINT__) || defined(__MAKECINT__)\n#include <Rtypes.h>\n#include <TString.h>\n#include \"AliAnalysisTaskNucleiYield.h\"\n#include \"AliAnalysisManager.h\"\n#include \"AliAnalysisDataContainer.h\"\n#include \"AliPID.h\"\n#endif\n\nAliAnalysisTaskNucleiYield* AddTaskNucleiYield_ppHM(Bool_t isMC = kFALSE,\n    AliPID::EParticleType part = AliPID::kDeuteron,\n    Int_t pdgCode = 1000010020,\n    TString tskname = \"deuteron\",\n    TString suffix = \"\") {\n\n  \/\/ Get the current analysis manager\n  AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n  if (!mgr) {\n    Error(\"AddTaskNucleiYield\", \"No analysis manager found.\");\n    return 0x0;\n  }\n\n  \/\/ Check the analysis type using the event handlers connected to the analysis manager.\n  if (!mgr->GetInputEventHandler()) {\n    ::Error(\"AddTaskNucleiYield\", \"This task requires an input event handler\");\n    return 0x0;\n  }\n\n  tskname.Append(Form(\"%s\",suffix.Data()));\n\n  AliAnalysisTaskNucleiYield *deu = new AliAnalysisTaskNucleiYield(tskname);\n  deu->fEventCut.OverrideAutomaticTriggerSelection(AliVEvent::kHighMultV0 | AliVEvent::kINT7);\n\n  deu->SetParticleType(part);\n  deu->SetPDG(pdgCode);\n  deu->SetIsMC(isMC);\n  deu->SetDCABins(80,-0.5,0.5);\n\n  deu->SetRequireTPCpidSigmas(3.f);\n\n  Float_t lDesiredBoundaries[1000];\n  Long_t   lNDesiredBoundaries=0;\n  lDesiredBoundaries[0] = 0.0;\n  \/\/From High To Low Multiplicity\n  for( Int_t ib = 1; ib < 101; ib++) { \/\/ 100 bins  ] 0.0 , 0.1 ]\n    lNDesiredBoundaries++;\n    lDesiredBoundaries[lNDesiredBoundaries] = lDesiredBoundaries[lNDesiredBoundaries-1] + 0.001;\n  }\n  for( Int_t ib = 1; ib < 91; ib++) { \/\/ 90 bins  ] 0.1 , 1.0 ]\n    lNDesiredBoundaries++;\n    lDesiredBoundaries[lNDesiredBoundaries] = lDesiredBoundaries[lNDesiredBoundaries-1] + 0.01;\n  }\n  for( Int_t ib = 1; ib < 91; ib++) { \/\/ 90 bins ] 1.0 , 10. ]\n    lNDesiredBoundaries++;\n    lDesiredBoundaries[lNDesiredBoundaries] = lDesiredBoundaries[lNDesiredBoundaries-1] + 0.1;\n  }\n  for( Int_t ib = 1; ib < 96; ib++) { \/\/ 95 bins ] 10.0 , 105.0 ]\n    lNDesiredBoundaries++;\n    lDesiredBoundaries[lNDesiredBoundaries] = lDesiredBoundaries[lNDesiredBoundaries-1] + 1.0;\n  }\n  deu->SetCentBins(lNDesiredBoundaries, lDesiredBoundaries);\n  deu->SetUseFlattening(false);\n  float pt[20] = {\n    0.5f,0.6f,0.7f,0.8f,0.9f,1.0f,1.1f,1.2f,1.4f,1.6f,\n    1.8f,2.0f,2.2f,2.6f,3.0f,3.4f,3.8f,4.4f,5.0f,6.0f\n  };\n  deu->SetPtBins(19,pt);\n\n  float dcabins[53] = {\n    -1.30,-1.20,-1.10,-1.00,-0.90,-0.80,-0.70,-0.60,-0.50,-0.40,\n    -0.35,-0.30,-0.25,-0.20,-0.15,-0.12,-0.10,-0.09,-0.08,-0.07,\n    -0.06,-0.05,-0.04,-0.03,-0.02,-0.01, 0.00, 0.01, 0.02, 0.03,\n     0.04, 0.05, 0.06, 0.07, 0.08, 0.09, 0.10, 0.12, 0.15, 0.20,\n     0.25, 0.30, 0.35, 0.40, 0.50, 0.60, 0.70, 0.80, 0.90, 1.00,\n     1.10, 1.20, 1.30\n  };\n  deu->SetDCABins(52,dcabins);\n\n  mgr->AddTask(deu);\n\n  TString output = \"AnalysisResults.root\";\n  AliAnalysisDataContainer *deuCont = mgr->CreateContainer(Form(\"nuclei_%s\",tskname.Data()),\n      TList::Class(),\n      AliAnalysisManager::kOutputContainer,\n      output.Data());\n  mgr->ConnectInput  (deu,  0, mgr->GetCommonInputContainer());\n  mgr->ConnectOutput (deu,  1, deuCont);\n  return deu;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>[turbofan] Fix register allocator verifier to allow 1-input phis.<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>[test.OS2014_parametric...] add optimal_but_not_offline_online_decomposable<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>TEST: display one pixel value (output of ossim DEM test)<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>creating bufer - new, not used everywhere<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>INTEGRATION: CWS warnings01 (1.3.12); FILE MERGED 2006\/03\/08 15:34:40 gh 1.3.12.1: remove wntmsci warnings<commit_after><|endoftext|>"}
{"text":"<commit_before>\r\n\/*!\r\n\t\\file\r\n\r\n\t\\author Igor Mironchik (igor.mironchik at gmail dot com).\r\n\r\n\tCopyright (c) 2014 Igor Mironchik\r\n\r\n\tPermission is hereby granted, free of charge, to any person\r\n\tobtaining a copy of this software and associated documentation\r\n\tfiles (the \"Software\"), to deal in the Software without\r\n\trestriction, including without limitation the rights to use,\r\n\tcopy, modify, merge, publish, distribute, sublicense, and\/or sell\r\n\tcopies of the Software, and to permit persons to whom the\r\n\tSoftware is furnished to do so, subject to the following\r\n\tconditions:\r\n\r\n\tThe above copyright notice and this permission notice shall be\r\n\tincluded in all copies or substantial portions of the Software.\r\n\r\n\tTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\r\n\tEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\r\n\tOF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\r\n\tNONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\r\n\tHOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\r\n\tWHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\r\n\tFROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\r\n\tOTHER DEALINGS IN THE SOFTWARE.\r\n*\/\r\n\r\n#ifdef COMO_BOOST_PROTOBUF\r\n\r\n\/\/ Como include.\r\n#include <Como\/boost_protobuf\/bp_client_socket.hpp>\r\n#include <Como\/boost_protobuf\/bp_source.hpp>\r\n#include <Como\/boost_protobuf\/bp_server_socket.hpp>\r\n\r\n\/\/ C++ include.\r\n#include <cstdint>\r\n#include <cstring>\r\n#include <vector>\r\n\r\n\/\/ boost include.\r\n#include <boost\/asio.hpp>\r\n\r\n\r\nnamespace Como {\r\n\r\nnamespace BoostProtobuf {\r\n\r\n\/\/! Magic number for the Como protocol #1.\r\nstatic const char c_magicNumber1[] =\r\n\t{ 0x43u, 0x4Fu, 0x4Du, 0x4Fu, 0x50u, 0x52u, 0x4Fu, 0x31u };\r\n\r\n\/*!\r\n\tMessage's header size. 12 bytes.\r\n\r\n\t8 bytes of magic number +\r\n\t2 bytes of message type +\r\n\t2 bytes of message length.\r\n*\/\r\nstatic const std::uint8_t c_headerSize = 12;\r\n\r\n\/\/! Type of the GetListOfSourcesMessage message.\r\nstatic const std::uint16_t c_getListOfSourcesMessageType = 0x0001;\r\n\r\n\r\n\/\/\r\n\/\/ ClientSocketPrivate\r\n\/\/\r\n\r\nclass ClientSocketPrivate {\r\npublic:\r\n\tClientSocketPrivate( ClientSocket * parent,\r\n\t\tboost::asio::io_service & io,\r\n\t\tServerSocket * server )\r\n\t\t:\tm_parent( parent )\r\n\t\t,\tm_socket( io )\r\n\t\t,\tm_server( server )\r\n\t{\r\n\t}\r\n\r\n\t\/\/! \\return Parsed digit.\r\n\tinline std::uint16_t parseDigit( const char * str )\r\n\t{\r\n\t\treturn ( std::uint16_t ) str[ 0 ] * 256 + ( std::uint16_t ) str[ 1 ];\r\n\t}\r\n\r\n\t\/\/! Parse message's header and notify server.\r\n\tvoid parseHeaderAndNotifyServer( const char * header )\r\n\t{\r\n\t\tif( std::strncmp( c_magicNumber1, header, 8 ) == 0 )\r\n\t\t{\r\n\t\t\tconst std::uint16_t type = parseDigit( header + 8 );\r\n\t\t\tconst std::uint16_t length = parseDigit( header + 10 );\r\n\r\n\t\t\tif( c_getListOfSourcesMessageType == type )\r\n\t\t\t\tm_server->sendListOfSources( m_parent );\r\n\r\n\t\t\tif( length > 0 )\r\n\t\t\t\treadMessage( length );\r\n\t\t}\r\n\t\telse\r\n\t\t\tm_server->disconnection( m_parent );\r\n\t}\r\n\r\n\t\/\/! Read message.\r\n\tvoid readMessage( std::size_t length )\r\n\t{\r\n\t\tstd::vector< char > message( length );\r\n\r\n\t\tboost::asio::async_read( m_socket,\r\n\t\t\tboost::asio::buffer( message.data(), length ),\r\n\t\t\t[ this ] ( boost::system::error_code error, std::size_t \/*length*\/ )\r\n\t\t\t\t{\r\n\t\t\t\t\tif( error )\r\n\t\t\t\t\t\tm_server->disconnection( m_parent );\r\n\t\t\t\t} );\r\n\t}\r\n\r\n\t\/\/! Parent.\r\n\tClientSocket * m_parent;\r\n\t\/\/! Socket.\r\n\ttcp::socket m_socket;\r\n\t\/\/! Server socket.\r\n\tServerSocket * m_server;\r\n}; \/\/ class ClientSocketPrivate;\r\n\r\n\r\n\/\/\r\n\/\/ ClientSocket\r\n\/\/\r\n\r\nClientSocket::ClientSocket( boost::asio::io_service & io,\r\n\tServerSocket * server )\r\n\t:\td( new ClientSocketPrivate( this, io, server ) )\r\n{\r\n}\r\n\r\nClientSocket::~ClientSocket()\r\n{\r\n}\r\n\r\ntcp::socket &\r\nClientSocket::socket() const\r\n{\r\n\treturn d->m_socket;\r\n}\r\n\r\nvoid\r\nClientSocket::start()\r\n{\r\n\tchar header[ c_headerSize ];\r\n\r\n\tboost::asio::async_read( d->m_socket,\r\n\t\tboost::asio::buffer( header, c_headerSize ),\r\n\t\t[ this, &header ] ( boost::system::error_code error, std::size_t \/*length*\/ )\r\n\t\t\t{\r\n\t\t\t\tif( error )\r\n\t\t\t\t\td->m_server->disconnection( this );\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\td->parseHeaderAndNotifyServer( header );\r\n\r\n\t\t\t\t\tstart();\r\n\t\t\t\t}\r\n\t\t\t} );\r\n}\r\n\r\nvoid\r\nClientSocket::sendSourceMessage( const Source & source )\r\n{\r\n\r\n}\r\n\r\nvoid\r\nClientSocket::sendDeinitSourceMessage( const Source & source )\r\n{\r\n\r\n}\r\n\r\n} \/* namespace BoostProtobuf *\/\r\n\r\n} \/* namespace Como *\/\r\n\r\n#endif \/\/ COMO_BOOST_PROTOBUF\r\n<commit_msg>Work on Boost\/Protobuf implementation of Como.<commit_after>\r\n\/*!\r\n\t\\file\r\n\r\n\t\\author Igor Mironchik (igor.mironchik at gmail dot com).\r\n\r\n\tCopyright (c) 2014 Igor Mironchik\r\n\r\n\tPermission is hereby granted, free of charge, to any person\r\n\tobtaining a copy of this software and associated documentation\r\n\tfiles (the \"Software\"), to deal in the Software without\r\n\trestriction, including without limitation the rights to use,\r\n\tcopy, modify, merge, publish, distribute, sublicense, and\/or sell\r\n\tcopies of the Software, and to permit persons to whom the\r\n\tSoftware is furnished to do so, subject to the following\r\n\tconditions:\r\n\r\n\tThe above copyright notice and this permission notice shall be\r\n\tincluded in all copies or substantial portions of the Software.\r\n\r\n\tTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\r\n\tEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\r\n\tOF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\r\n\tNONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\r\n\tHOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\r\n\tWHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\r\n\tFROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\r\n\tOTHER DEALINGS IN THE SOFTWARE.\r\n*\/\r\n\r\n#ifdef COMO_BOOST_PROTOBUF\r\n\r\n\/\/ Como include.\r\n#include <Como\/boost_protobuf\/bp_client_socket.hpp>\r\n#include <Como\/boost_protobuf\/bp_source.hpp>\r\n#include <Como\/boost_protobuf\/bp_server_socket.hpp>\r\n#include <Como\/boost_protobuf\/messages.pb.h>\r\n\r\n\/\/ C++ include.\r\n#include <cstdint>\r\n#include <cstring>\r\n#include <vector>\r\n#include <sstream>\r\n\r\n\/\/ boost include.\r\n#include <boost\/asio.hpp>\r\n#include <boost\/date_time.hpp>\r\n\r\n\r\nnamespace Como {\r\n\r\nnamespace BoostProtobuf {\r\n\r\n\/\/! Magic number for the Como protocol #1.\r\nstatic const char c_magicNumber1[] =\r\n\t{ 0x43u, 0x4Fu, 0x4Du, 0x4Fu, 0x50u, 0x52u, 0x4Fu, 0x31u };\r\n\r\n\/\/! Magic number for the Como protocol #2.\r\nstatic const char c_magicNumber2[] =\r\n\t{ 0x43u, 0x4Fu, 0x4Du, 0x4Fu, 0x50u, 0x52u, 0x4Fu, 0x32u };\r\n\r\n\/*!\r\n\tMessage's header size. 12 bytes.\r\n\r\n\t8 bytes of magic number +\r\n\t2 bytes of message type +\r\n\t2 bytes of message length.\r\n*\/\r\nstatic const std::uint8_t c_headerSize = 12;\r\n\r\n\/\/! Type of the GetListOfSourcesMessage message.\r\nstatic const std::uint16_t c_getListOfSourcesMessageType = 0x0001;\r\n\r\n\/\/! Type of the SourceMessage message.\r\nstatic const std::uint16_t c_sourceMessageType = 0x0002;\r\n\r\n\/\/! Type of the DeinitSourceMessage message.\r\nstatic const std::uint16_t c_deinitSourceMessageType = 0x0003;\r\n\r\n\r\n\/\/\r\n\/\/ ClientSocketPrivate\r\n\/\/\r\n\r\nclass ClientSocketPrivate {\r\npublic:\r\n\tClientSocketPrivate( ClientSocket * parent,\r\n\t\tboost::asio::io_service & io,\r\n\t\tServerSocket * server )\r\n\t\t:\tm_parent( parent )\r\n\t\t,\tm_socket( io )\r\n\t\t,\tm_server( server )\r\n\t{\r\n\t}\r\n\r\n\t\/\/! \\return Parsed digit.\r\n\tinline std::uint16_t parseDigit( const char * str )\r\n\t{\r\n\t\treturn ( std::uint16_t ) str[ 0 ] * 256 + ( std::uint16_t ) str[ 1 ];\r\n\t}\r\n\r\n\t\/\/! Parse message's header and notify server.\r\n\tvoid parseHeaderAndNotifyServer( const char * header )\r\n\t{\r\n\t\tif( std::strncmp( c_magicNumber1, header, 8 ) == 0 )\r\n\t\t{\r\n\t\t\tconst std::uint16_t type = parseDigit( header + 8 );\r\n\t\t\tconst std::uint16_t length = parseDigit( header + 10 );\r\n\r\n\t\t\tif( c_getListOfSourcesMessageType == type )\r\n\t\t\t\tm_server->sendListOfSources( m_parent );\r\n\r\n\t\t\tif( length > 0 )\r\n\t\t\t\treadMessage( length );\r\n\t\t}\r\n\t\telse\r\n\t\t\tm_server->disconnection( m_parent );\r\n\t}\r\n\r\n\t\/\/! Read message.\r\n\tvoid readMessage( std::size_t length )\r\n\t{\r\n\t\tstd::vector< char > message( length );\r\n\r\n\t\tboost::asio::async_read( m_socket,\r\n\t\t\tboost::asio::buffer( message.data(), length ),\r\n\t\t\t[ this ] ( boost::system::error_code error, std::size_t \/*length*\/ )\r\n\t\t\t\t{\r\n\t\t\t\t\tif( error )\r\n\t\t\t\t\t\tm_server->disconnection( m_parent );\r\n\t\t\t\t} );\r\n\t}\r\n\r\n\t\/\/! Parent.\r\n\tClientSocket * m_parent;\r\n\t\/\/! Socket.\r\n\ttcp::socket m_socket;\r\n\t\/\/! Server socket.\r\n\tServerSocket * m_server;\r\n}; \/\/ class ClientSocketPrivate;\r\n\r\n\r\n\/\/\r\n\/\/ ClientSocket\r\n\/\/\r\n\r\nClientSocket::ClientSocket( boost::asio::io_service & io,\r\n\tServerSocket * server )\r\n\t:\td( new ClientSocketPrivate( this, io, server ) )\r\n{\r\n}\r\n\r\nClientSocket::~ClientSocket()\r\n{\r\n}\r\n\r\ntcp::socket &\r\nClientSocket::socket() const\r\n{\r\n\treturn d->m_socket;\r\n}\r\n\r\nvoid\r\nClientSocket::start()\r\n{\r\n\tchar header[ c_headerSize ];\r\n\r\n\tboost::asio::async_read( d->m_socket,\r\n\t\tboost::asio::buffer( header, c_headerSize ),\r\n\t\t[ this, &header ] ( boost::system::error_code error, std::size_t \/*length*\/ )\r\n\t\t\t{\r\n\t\t\t\tif( error )\r\n\t\t\t\t\td->m_server->disconnection( this );\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\td->parseHeaderAndNotifyServer( header );\r\n\r\n\t\t\t\t\tstart();\r\n\t\t\t\t}\r\n\t\t\t} );\r\n}\r\n\r\nstatic inline std::string anyToString( const boost::any & value,\r\n\tSource::Type type )\r\n{\r\n\ttry {\r\n\t\tswitch( type )\r\n\t\t{\r\n\t\t\tcase Source::String :\r\n\t\t\t\treturn boost::any_cast< std::string > ( value );\r\n\r\n\t\t\tcase Source::Int :\r\n\t\t\t{\r\n\t\t\t\tstd::ostringstream stream;\r\n\t\t\t\tstream << boost::any_cast< int > ( value );\r\n\r\n\t\t\t\treturn stream.str();\r\n\t\t\t}\r\n\r\n\t\t\tcase Source::UInt :\r\n\t\t\t{\r\n\t\t\t\tstd::ostringstream stream;\r\n\t\t\t\tstream << boost::any_cast< unsigned int > ( value );\r\n\r\n\t\t\t\treturn stream.str();\r\n\t\t\t}\r\n\r\n\t\t\tcase Source::LongLong :\r\n\t\t\t{\r\n\t\t\t\tstd::ostringstream stream;\r\n\t\t\t\tstream << boost::any_cast< long long > ( value );\r\n\r\n\t\t\t\treturn stream.str();\r\n\t\t\t}\r\n\r\n\t\t\tcase Source::ULongLong :\r\n\t\t\t{\r\n\t\t\t\tstd::ostringstream stream;\r\n\t\t\t\tstream << boost::any_cast< unsigned long long > ( value );\r\n\r\n\t\t\t\treturn stream.str();\r\n\t\t\t}\r\n\r\n\t\t\tcase Source::Double :\r\n\t\t\t{\r\n\t\t\t\tstd::ostringstream stream;\r\n\t\t\t\tstream << boost::any_cast< double > ( value );\r\n\r\n\t\t\t\treturn stream.str();\r\n\t\t\t}\r\n\r\n\t\t\tcase Source::DateTime :\r\n\t\t\tcase Source::Time :\r\n\t\t\t\treturn boost::posix_time::to_iso_extended_string(\r\n\t\t\t\t\tboost::any_cast< boost::posix_time::ptime > ( value ) );\r\n\t\t}\r\n\t}\r\n\tcatch( const boost::bad_any_cast & )\r\n\t{\r\n\t\treturn std::string();\r\n\t}\r\n}\r\n\r\nstatic inline void write16BitNumber( std::ostringstream & stream,\r\n\tstd::uint16_t number )\r\n{\r\n\tstream << std::right << std::setfill( '0' ) << std::setw( 4 ) << std::hex\r\n\t\t<< number;\r\n}\r\n\r\nstatic inline void writeMessage( const Source & source,\r\n\tstd::uint16_t type,\r\n\ttcp::socket & socket,\r\n\tServerSocket * server,\r\n\tClientSocket * client )\r\n{\r\n\tComoMessage msg;\r\n\tmsg.set_type( source.type() );\r\n\tmsg.set_name( source.name() );\r\n\tmsg.set_typename_( source.typeName() );\r\n\tmsg.set_datetime( boost::posix_time::to_iso_extended_string(\r\n\t\tsource.dateTime() ) );\r\n\tmsg.set_description( source.description() );\r\n\tmsg.set_value( anyToString( source.value(), source.type() ) );\r\n\r\n\tconst std::string strMessage = msg.SerializeAsString();\r\n\r\n\tstd::ostringstream stream;\r\n\tstream.write( c_magicNumber2, 8 );\r\n\twrite16BitNumber( stream, type );\r\n\twrite16BitNumber( stream, ( std::uint16_t ) strMessage.length() );\r\n\r\n\tconst std::string data = stream.str() + strMessage;\r\n\r\n\tboost::asio::async_write( socket,\r\n\t\tboost::asio::buffer( data.data(), data.length() ),\r\n\t\t[ server, client ] ( boost::system::error_code error, std::size_t \/*length*\/ )\r\n\t\t\t{\r\n\t\t\t\tif( error )\r\n\t\t\t\t\tserver->disconnection( client );\r\n\t\t\t}\r\n\t);\r\n}\r\n\r\nvoid\r\nClientSocket::sendSourceMessage( const Source & source )\r\n{\r\n\twriteMessage( source, c_sourceMessageType,\r\n\t\td->m_socket, d->m_server, this );\r\n}\r\n\r\nvoid\r\nClientSocket::sendDeinitSourceMessage( const Source & source )\r\n{\r\n\twriteMessage( source, c_deinitSourceMessageType,\r\n\t\td->m_socket, d->m_server, this );\r\n}\r\n\r\n} \/* namespace BoostProtobuf *\/\r\n\r\n} \/* namespace Como *\/\r\n\r\n#endif \/\/ COMO_BOOST_PROTOBUF\r\n<|endoftext|>"}
{"text":"<commit_before>\/*!\r\n  \\copyright (c) RDO-Team, 2011\r\n  \\file      main.cpp\r\n  \\authors     (rdo@rk9.bmstu.ru)\r\n  \\authors     (lord.tiran@gmail.com)\r\n  \\date      10.05.2009\r\n  \\brief       \r\n  \\indent    4T\r\n*\/\r\n\r\n\/\/ ---------------------------------------------------------------------------- PCH\r\n\/\/ ----------------------------------------------------------------------- INCLUDES\r\n#include <iostream>\r\n#define BOOST_TEST_MODULE RDORuntime_Fuzzy_Test\r\n#include <boost\/test\/included\/unit_test.hpp>\r\n\/\/ ----------------------------------------------------------------------- SYNOPSIS\r\n#include \"simulator\/runtime\/rdo_runtime.h\"\r\n#include \"simulator\/runtime\/rdo_fuzzy.h\"\r\n\/\/ --------------------------------------------------------------------------------\r\n\r\nOPEN_RDO_RUNTIME_NAMESPACE\r\n\r\nBOOST_AUTO_TEST_SUITE(RDORuntime_Fuzzy_Test)\r\n\r\nBOOST_AUTO_TEST_CASE(DefineAreaTest)\r\n{\r\n\tLPRDORuntime pRuntime = rdo::Factory<RDORuntime>::create();\r\n\tBOOST_CHECK(pRuntime);\r\n\r\n\tLPDefineArea pDefineAreaEmpty = rdo::Factory<DefineArea>::create();\r\n\tBOOST_CHECK(pDefineAreaEmpty);\r\n\r\n\tLPDefineArea pDefineArea = rdo::Factory<DefineArea>::create(1.0, 5.0);\r\n\tBOOST_CHECK(pDefineArea);\r\n}\r\nBOOST_AUTO_TEST_CASE(FuzzySetTest)\r\n{\r\n\tLPRDORuntime pRuntime = rdo::Factory<RDORuntime>::create();\r\n\tBOOST_CHECK(pRuntime);\r\n\r\n\tLPRDOFuzzyType pType = rdo::Factory<RDOFuzzyType>::create();\r\n\tBOOST_CHECK(pType);\r\n\r\n\tLPFuzzySet pInfinityFuzzySet = rdo::Factory<FuzzySet>::create(pType);\r\n\tBOOST_CHECK(pInfinityFuzzySet);\r\n\r\n\tLPFuzzySet pCopyFuzzySet = rdo::Factory<FuzzySet>::create(pInfinityFuzzySet);\r\n\tBOOST_CHECK(pCopyFuzzySet);\r\n\r\n\tLPDefineArea pDefineArea = rdo::Factory<DefineArea>::create(0.0, 100.0);\r\n\tBOOST_CHECK(pDefineArea);\r\n\r\n\tLPFuzzySet pFuzzySet = rdo::Factory<FuzzySet>::create(pType, *pDefineArea);\r\n\tBOOST_CHECK(pFuzzySet);\r\n\r\n\tFuzzySet::FuzzySetDefinition pSetDefinition;\r\n\ttypedef FuzzySet::FuzzySetDefinition::iterator It;\r\n\ttypedef std::pair<It,rbool> Ins;\r\n\r\n\tIns insVal1 = pSetDefinition.insert(std::pair<RDOValue,double>(5,0.5));\r\n\tBOOST_CHECK(insVal1.second);\r\n\r\n\tIns insVal2 = pSetDefinition.insert(std::pair<RDOValue,double>(1,0.1));\r\n\tBOOST_CHECK(insVal2.second);\r\n\r\n\tIns insVal3 = pSetDefinition.insert(std::pair<RDOValue,double>(2,0.2));\r\n\tBOOST_CHECK(insVal3.second);\r\n\r\n\tIns insVal4 = pSetDefinition.insert(std::pair<RDOValue,double>(3,1.0));\r\n\tBOOST_CHECK(insVal4.second);\r\n\r\n\tIns insVal5 = pSetDefinition.insert(std::pair<RDOValue,double>(6,0.4));\r\n\tBOOST_CHECK(insVal5.second);\r\n\r\n\tIns insVal6 = pSetDefinition.insert(std::pair<RDOValue,double>(7,0.2));\r\n\tBOOST_CHECK(insVal6.second);\r\n\r\n\tIns insVal7 = pSetDefinition.insert(std::pair<RDOValue,double>(9,0.1));\r\n\tBOOST_CHECK(insVal7.second);\r\n\r\n\tIns insVal8 = pSetDefinition.insert(std::pair<RDOValue,double>(9,0.5));\r\n\tBOOST_CHECK(!insVal8.second);\r\n\r\n\tLPFuzzySet pSet = rdo::Factory<FuzzySet>::create(pSetDefinition);\r\n\r\n\ttstring stringPresentation = pSet->getAsString();\r\n\tstd::cout << stringPresentation << std::endl;\r\n\tBOOST_CHECK(stringPresentation == _T(\"<1\/0.10> <2\/0.20> <3\/1.00> <5\/0.50> <6\/0.40> <7\/0.20> <9\/0.10>\"));\r\n\r\n\tRDOValue repeatValue = 3.0;\r\n\tpSet->append(repeatValue, 0.3);\r\n\tBOOST_CHECK(pSet);\r\n\tBOOST_CHECK(pSet->getAsString() == _T(\"<1\/0.10> <2\/0.20> <3\/1.00> <5\/0.50> <6\/0.40> <7\/0.20> <9\/0.10>\"));\r\n\r\n\tpSet->operator[](repeatValue) = 0.3;\r\n\tBOOST_CHECK(pSet->getAsString() == _T(\"<1\/0.10> <2\/0.20> <3\/0.30> <5\/0.50> <6\/0.40> <7\/0.20> <9\/0.10>\"));\r\n\r\n\tLPFuzzySet pConSet = MemberFunctionProperties::a_con(pSet);\r\n\ttstring stringPresentation1 = pConSet->getAsString();\r\n\tstd::cout << stringPresentation1 << std::endl;\r\n\t\r\n\tLPFuzzySet pDilSet = MemberFunctionProperties::a_dil(pSet);\r\n\ttstring stringPresentation2 = pDilSet->getAsString();\r\n\tstd::cout << stringPresentation2 << std::endl;\r\n\r\n\tLPFuzzySet pUnaryMinusSet = MemberFunctionProperties::u_minus(pSet);\r\n\ttstring stringPresentation3 = pUnaryMinusSet->getAsString();\r\n\tstd::cout << stringPresentation3 << std::endl;\r\n\r\n\tLPFuzzySet pScaleSet = MemberFunctionProperties::u_scale(pSet, 4.0);\r\n\ttstring stringPresentation4 = pScaleSet->getAsString();\r\n\tstd::cout << stringPresentation4 << std::endl;\r\n\r\n\tLPFuzzySet pSupplement = MemberFunctionProperties::supplement(pSet);\r\n\ttstring stringPresentation5 = pSupplement->getAsString();\r\n\tstd::cout << stringPresentation5 << std::endl;\r\n\r\n\r\n}\r\n\r\nBOOST_AUTO_TEST_CASE(TermTest)\r\n{\r\n\tLPRDOFuzzyTerm pTerm = rdo::Factory<RDOFuzzyTerm>::create();\r\n\ttstring name = pTerm->getName();\r\n\tstd::cout << name << std::endl;\r\n\tBOOST_CHECK(pTerm);\r\n\r\n\tLPRDORuntime pRuntime = rdo::Factory<RDORuntime>::create();\r\n\tBOOST_CHECK(pRuntime);\r\n\r\n\tLPRDOFuzzyType pType = rdo::Factory<RDOFuzzyType>::create();\r\n\tBOOST_CHECK(pType);\r\n\r\n\tLPDefineArea pDefineArea = rdo::Factory<DefineArea>::create(0.0, 100.0);\r\n\tBOOST_CHECK(pDefineArea);\r\n\r\n\tLPFuzzySet pFuzzySet = rdo::Factory<FuzzySet>::create(pType, *pDefineArea);\r\n\tBOOST_CHECK(pFuzzySet);\r\n\r\n\tLPRDOFuzzyTerm pTerm1 = rdo::Factory<RDOFuzzyTerm>::create(_T(\"term1\"), pFuzzySet);\r\n\tBOOST_CHECK(pTerm1);\r\n\ttstring name1 = pTerm1->getName();\r\n\tstd::cout << name1 << std::endl;\r\n}\r\n\r\nBOOST_AUTO_TEST_CASE(VariableTest)\r\n{\r\n\tLPRDOLingvoVariable pVariable = rdo::Factory<RDOLingvoVariable>::create();\r\n\tBOOST_CHECK(pVariable);\r\n\r\n\tLPRDORuntime pRuntime = rdo::Factory<RDORuntime>::create();\r\n\tBOOST_CHECK(pRuntime);\r\n\r\n\tLPRDOFuzzyType pType = rdo::Factory<RDOFuzzyType>::create();\r\n\tBOOST_CHECK(pType);\r\n\r\n\tLPDefineArea pDefineArea = rdo::Factory<DefineArea>::create(0.0, 100.0);\r\n\tBOOST_CHECK(pDefineArea);\r\n\r\n\tLPFuzzySet pFuzzySet = rdo::Factory<FuzzySet>::create(pType, *pDefineArea);\r\n\tBOOST_CHECK(pFuzzySet);\r\n\r\n\tpFuzzySet->append(5,0.5);\r\n\tBOOST_CHECK(pFuzzySet);\r\n\r\n\tpFuzzySet->append(1,0.1);\r\n\tBOOST_CHECK(pFuzzySet);\r\n\r\n\tpFuzzySet->append(2,0.2);\r\n\tBOOST_CHECK(pFuzzySet);\r\n\r\n\tpFuzzySet->append(3,1.0);\r\n\tBOOST_CHECK(pFuzzySet);\r\n\r\n\tpFuzzySet->append(6,0.4);\r\n\tBOOST_CHECK(pFuzzySet);\r\n\r\n\tpFuzzySet->append(7,0.2);\r\n\tBOOST_CHECK(pFuzzySet);\r\n\r\n\tpFuzzySet->append(9,0.1);\r\n\tBOOST_CHECK(pFuzzySet);\r\n\r\n\tLPRDOFuzzyTerm pTerm1 = rdo::Factory<RDOFuzzyTerm>::create(_T(\"term1\"), pFuzzySet);\r\n\tBOOST_CHECK(pTerm1);\r\n\r\n\tpVariable->append(pTerm1->getName(), pTerm1->getFuzzySetDefinition());\r\n\tpVariable->setName(_T(\"testName\"));\r\n\r\n\tRDOValue value = 1.0;\r\n\tLPRDOLingvoVariable pVariable2 = rdo::Factory<RDOLingvoVariable>::create(value, *pVariable);\r\n\tBOOST_CHECK(pVariable2);\r\n\r\n\tRDOValue valueTrueOn0_2 = 7.0;\r\n\tLPRDOLingvoVariable fuzzyVariable1 = MemberFunctionProperties::fuzzyfication(valueTrueOn0_2, *pVariable);\r\n\tBOOST_CHECK(fuzzyVariable1);\r\n\r\n\tRDOValue valueTrueOn0_0 = 10.0;\r\n\tLPRDOLingvoVariable fuzzyVariable2 = MemberFunctionProperties::fuzzyfication(valueTrueOn0_0, *pVariable);\r\n\tBOOST_CHECK(fuzzyVariable2);\r\n}\r\nBOOST_AUTO_TEST_CASE(MemberFunctionProperties)\r\n{\r\n\t\r\n}\r\n\r\n\t\r\n\r\nBOOST_AUTO_TEST_SUITE_END() \/\/ RDORuntime_Fuzzy_Test\r\nCLOSE_RDO_RUNTIME_NAMESPACE<commit_msg> - тест не проходит<commit_after>\/*!\r\n  \\copyright (c) RDO-Team, 2011\r\n  \\file      main.cpp\r\n  \\authors     (rdo@rk9.bmstu.ru)\r\n  \\authors     (lord.tiran@gmail.com)\r\n  \\date      10.05.2009\r\n  \\brief       \r\n  \\indent    4T\r\n*\/\r\n\r\n\/\/ ---------------------------------------------------------------------------- PCH\r\n\/\/ ----------------------------------------------------------------------- INCLUDES\r\n#include <iostream>\r\n#define BOOST_TEST_MODULE RDORuntime_Fuzzy_Test\r\n#include <boost\/test\/included\/unit_test.hpp>\r\n\/\/ ----------------------------------------------------------------------- SYNOPSIS\r\n#include \"simulator\/runtime\/rdo_runtime.h\"\r\n#include \"simulator\/runtime\/rdo_fuzzy.h\"\r\n\/\/ --------------------------------------------------------------------------------\r\n\r\nOPEN_RDO_RUNTIME_NAMESPACE\r\n\r\nBOOST_AUTO_TEST_SUITE(RDORuntime_Fuzzy_Test)\r\n\r\nBOOST_AUTO_TEST_CASE(DefineAreaTest)\r\n{\r\n\tLPRDORuntime pRuntime = rdo::Factory<RDORuntime>::create();\r\n\tBOOST_CHECK(pRuntime);\r\n\r\n\tLPDefineArea pDefineAreaEmpty = rdo::Factory<DefineArea>::create();\r\n\tBOOST_CHECK(pDefineAreaEmpty);\r\n\r\n\tLPDefineArea pDefineArea = rdo::Factory<DefineArea>::create(1.0, 5.0);\r\n\tBOOST_CHECK(pDefineArea);\r\n}\r\nBOOST_AUTO_TEST_CASE(FuzzySetTest)\r\n{\r\n\tLPRDORuntime pRuntime = rdo::Factory<RDORuntime>::create();\r\n\tBOOST_CHECK(pRuntime);\r\n\r\n\tLPRDOFuzzyType pType = rdo::Factory<RDOFuzzyType>::create();\r\n\tBOOST_CHECK(pType);\r\n\r\n\tLPFuzzySet pInfinityFuzzySet = rdo::Factory<FuzzySet>::create(pType);\r\n\tBOOST_CHECK(pInfinityFuzzySet);\r\n\r\n\tLPFuzzySet pCopyFuzzySet = rdo::Factory<FuzzySet>::create(pInfinityFuzzySet);\r\n\tBOOST_CHECK(pCopyFuzzySet);\r\n\r\n\tLPDefineArea pDefineArea = rdo::Factory<DefineArea>::create(0.0, 100.0);\r\n\tBOOST_CHECK(pDefineArea);\r\n\r\n\tLPFuzzySet pFuzzySet = rdo::Factory<FuzzySet>::create(pType, *pDefineArea);\r\n\tBOOST_CHECK(pFuzzySet);\r\n\r\n\tFuzzySet::FuzzySetDefinition pSetDefinition;\r\n\ttypedef FuzzySet::FuzzySetDefinition::iterator It;\r\n\ttypedef std::pair<It,rbool> Ins;\r\n\r\n\tIns insVal1 = pSetDefinition.insert(std::pair<RDOValue,double>(5,0.5));\r\n\tBOOST_CHECK(insVal1.second);\r\n\r\n\tIns insVal2 = pSetDefinition.insert(std::pair<RDOValue,double>(1,0.1));\r\n\tBOOST_CHECK(insVal2.second);\r\n\r\n\tIns insVal3 = pSetDefinition.insert(std::pair<RDOValue,double>(2,0.2));\r\n\tBOOST_CHECK(insVal3.second);\r\n\r\n\tIns insVal4 = pSetDefinition.insert(std::pair<RDOValue,double>(3,1.0));\r\n\tBOOST_CHECK(insVal4.second);\r\n\r\n\tIns insVal5 = pSetDefinition.insert(std::pair<RDOValue,double>(6,0.4));\r\n\tBOOST_CHECK(insVal5.second);\r\n\r\n\tIns insVal6 = pSetDefinition.insert(std::pair<RDOValue,double>(7,0.2));\r\n\tBOOST_CHECK(insVal6.second);\r\n\r\n\tIns insVal7 = pSetDefinition.insert(std::pair<RDOValue,double>(9,0.1));\r\n\tBOOST_CHECK(insVal7.second);\r\n\r\n\tIns insVal8 = pSetDefinition.insert(std::pair<RDOValue,double>(9,0.5));\r\n\tBOOST_CHECK(!insVal8.second);\r\n\r\n\tLPFuzzySet pSet = rdo::Factory<FuzzySet>::create(pSetDefinition);\r\n\r\n\ttstring stringPresentation = pSet->getAsString();\r\n\tstd::cout << stringPresentation << std::endl;\r\n\tBOOST_CHECK(stringPresentation == _T(\"<1\/0.10> <2\/0.20> <3\/1.00> <5\/0.50> <6\/0.40> <7\/0.20> <9\/0.10>\"));\r\n\r\n\tRDOValue repeatValue = 3.0;\r\n\tpSet->append(repeatValue, 0.3);\r\n\tBOOST_CHECK(pSet);\r\n\tBOOST_CHECK(pSet->getAsString() == _T(\"<1\/0.10> <2\/0.20> <3\/1.00> <5\/0.50> <6\/0.40> <7\/0.20> <9\/0.10>\"));\r\n\r\n\tpSet->operator[](repeatValue) = 0.3;\r\n\tBOOST_CHECK(pSet->getAsString() == _T(\"<1\/0.10> <2\/0.20> <3\/0.30> <5\/0.50> <6\/0.40> <7\/0.20> <9\/0.10>\"));\r\n\r\n\tLPFuzzySet pConSet = MemberFunctionProperties::a_con(pSet);\r\n\ttstring stringPresentation1 = pConSet->getAsString();\r\n\tstd::cout << stringPresentation1 << std::endl;\r\n\t\r\n\tLPFuzzySet pDilSet = MemberFunctionProperties::a_dil(pSet);\r\n\ttstring stringPresentation2 = pDilSet->getAsString();\r\n\tstd::cout << stringPresentation2 << std::endl;\r\n\r\n\tLPFuzzySet pUnaryMinusSet = MemberFunctionProperties::u_minus(pSet);\r\n\ttstring stringPresentation3 = pUnaryMinusSet->getAsString();\r\n\tstd::cout << stringPresentation3 << std::endl;\r\n\r\n\tLPFuzzySet pScaleSet = MemberFunctionProperties::u_scale(pSet, 4.0);\r\n\ttstring stringPresentation4 = pScaleSet->getAsString();\r\n\tstd::cout << stringPresentation4 << std::endl;\r\n\r\n\tLPFuzzySet pSupplement = MemberFunctionProperties::supplement(pSet);\r\n\ttstring stringPresentation5 = pSupplement->getAsString();\r\n\tstd::cout << stringPresentation5 << std::endl;\r\n\r\n\tLPFuzzySet pMultTest = MemberFunctionProperties::a_mult(pSet, pScaleSet);\r\n\tBOOST_CHECK(pMultTest);\r\n}\r\n\r\nBOOST_AUTO_TEST_CASE(TermTest)\r\n{\r\n\tLPRDOFuzzyTerm pTerm = rdo::Factory<RDOFuzzyTerm>::create();\r\n\ttstring name = pTerm->getName();\r\n\tstd::cout << name << std::endl;\r\n\tBOOST_CHECK(pTerm);\r\n\r\n\tLPRDORuntime pRuntime = rdo::Factory<RDORuntime>::create();\r\n\tBOOST_CHECK(pRuntime);\r\n\r\n\tLPRDOFuzzyType pType = rdo::Factory<RDOFuzzyType>::create();\r\n\tBOOST_CHECK(pType);\r\n\r\n\tLPDefineArea pDefineArea = rdo::Factory<DefineArea>::create(0.0, 100.0);\r\n\tBOOST_CHECK(pDefineArea);\r\n\r\n\tLPFuzzySet pFuzzySet = rdo::Factory<FuzzySet>::create(pType, *pDefineArea);\r\n\tBOOST_CHECK(pFuzzySet);\r\n\r\n\tLPRDOFuzzyTerm pTerm1 = rdo::Factory<RDOFuzzyTerm>::create(_T(\"term1\"), pFuzzySet);\r\n\tBOOST_CHECK(pTerm1);\r\n\ttstring name1 = pTerm1->getName();\r\n\tstd::cout << name1 << std::endl;\r\n}\r\n\r\nBOOST_AUTO_TEST_CASE(VariableTest)\r\n{\r\n\tLPRDOLingvoVariable pVariable = rdo::Factory<RDOLingvoVariable>::create();\r\n\tBOOST_CHECK(pVariable);\r\n\r\n\tLPRDORuntime pRuntime = rdo::Factory<RDORuntime>::create();\r\n\tBOOST_CHECK(pRuntime);\r\n\r\n\tLPRDOFuzzyType pType = rdo::Factory<RDOFuzzyType>::create();\r\n\tBOOST_CHECK(pType);\r\n\r\n\tLPDefineArea pDefineArea = rdo::Factory<DefineArea>::create(0.0, 100.0);\r\n\tBOOST_CHECK(pDefineArea);\r\n\r\n\tLPFuzzySet pFuzzySet = rdo::Factory<FuzzySet>::create(pType, *pDefineArea);\r\n\tBOOST_CHECK(pFuzzySet);\r\n\r\n\tpFuzzySet->append(5,0.5);\r\n\tBOOST_CHECK(pFuzzySet);\r\n\r\n\tpFuzzySet->append(1,0.1);\r\n\tBOOST_CHECK(pFuzzySet);\r\n\r\n\tpFuzzySet->append(2,0.2);\r\n\tBOOST_CHECK(pFuzzySet);\r\n\r\n\tpFuzzySet->append(3,1.0);\r\n\tBOOST_CHECK(pFuzzySet);\r\n\r\n\tpFuzzySet->append(6,0.4);\r\n\tBOOST_CHECK(pFuzzySet);\r\n\r\n\tpFuzzySet->append(7,0.2);\r\n\tBOOST_CHECK(pFuzzySet);\r\n\r\n\tpFuzzySet->append(9,0.1);\r\n\tBOOST_CHECK(pFuzzySet);\r\n\r\n\tLPRDOFuzzyTerm pTerm1 = rdo::Factory<RDOFuzzyTerm>::create(_T(\"term1\"), pFuzzySet);\r\n\tBOOST_CHECK(pTerm1);\r\n\r\n\tpVariable->append(pTerm1->getName(), pTerm1->getFuzzySetDefinition());\r\n\tpVariable->setName(_T(\"testName\"));\r\n\r\n\tRDOValue value = 1.0;\r\n\tLPRDOLingvoVariable pVariable2 = rdo::Factory<RDOLingvoVariable>::create(value, *pVariable);\r\n\tBOOST_CHECK(pVariable2);\r\n\r\n\tRDOValue valueTrueOn0_2 = 7.0;\r\n\tLPRDOLingvoVariable fuzzyVariable1 = MemberFunctionProperties::fuzzyfication(valueTrueOn0_2, *pVariable);\r\n\tBOOST_CHECK(fuzzyVariable1);\r\n\r\n\tRDOValue valueTrueOn0_0 = 10.0;\r\n\tLPRDOLingvoVariable fuzzyVariable2 = MemberFunctionProperties::fuzzyfication(valueTrueOn0_0, *pVariable);\r\n\tBOOST_CHECK(fuzzyVariable2);\r\n}\r\nBOOST_AUTO_TEST_CASE(MemberFunctionProperties)\r\n{\r\n\t\r\n}\r\n\r\n\t\r\n\r\nBOOST_AUTO_TEST_SUITE_END() \/\/ RDORuntime_Fuzzy_Test\r\nCLOSE_RDO_RUNTIME_NAMESPACE<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: startmenuicon.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: vg $ $Date: 2005-03-23 09:40: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#define WIN32_LEAN_AND_MEAN\n#include <windows.h>\n#include <msiquery.h>\n#include <malloc.h>\n\n#ifdef UNICODE\n#define _UNICODE\n#define _tstring    wstring\n#else\n#define _tstring    string\n#endif\n#include <tchar.h>\n#include <string>\n\n#ifdef _WIN32_WINNT\n#error YES\n#endif\n\nstd::_tstring GetMsiProperty( MSIHANDLE handle, const std::_tstring& sProperty )\n{\n    std::_tstring   result;\n    TCHAR   szDummy[1] = TEXT(\"\");\n    DWORD   nChars = 0;\n\n    if ( MsiGetProperty( handle, sProperty.c_str(), szDummy, &nChars ) == ERROR_MORE_DATA )\n    {\n        DWORD nBytes = ++nChars * sizeof(TCHAR);\n        LPTSTR buffer = reinterpret_cast<LPTSTR>(_alloca(nBytes));\n        ZeroMemory( buffer, nBytes );\n        MsiGetProperty(handle, sProperty.c_str(), buffer, &nChars);\n        result = buffer;\n    }\n\n    return  result;\n}\n\n\/*\n    Called during installation to customize the start menu folder icon.\n    See: http:\/\/msdn.microsoft.com\/library\/en-us\/shellcc\/platform\/shell\/programmersguide\/shell_basics\/shell_basics_extending\/custom.asp\n*\/\nextern \"C\" UINT __stdcall InstallStartmenuFolderIcon( MSIHANDLE handle )\n{\n    std::_tstring   sOfficeMenuFolder = GetMsiProperty( handle, TEXT(\"OfficeMenuFolder\") );\n    std::_tstring sDesktopFile = sOfficeMenuFolder + TEXT(\"Desktop.ini\");\n\n\/\/    MessageBox(NULL, sDesktopFile.c_str(), TEXT(\"OfficeMenuFolder\"), MB_OK | MB_ICONINFORMATION);\n\n    std::_tstring   sIconFile = GetMsiProperty( handle, TEXT(\"INSTALLLOCATION\") ) + TEXT(\"program\\\\soffice.exe\");\n\n    WritePrivateProfileString(\n        TEXT(\".ShellClassInfo\"),\n        TEXT(\"IconFile\"),\n        sIconFile.c_str(),\n        sDesktopFile.c_str() );\n\n    WritePrivateProfileString(\n        TEXT(\".ShellClassInfo\"),\n        TEXT(\"IconIndex\"),\n        TEXT(\"18\"),\n        sDesktopFile.c_str() );\n\n    WritePrivateProfileString(\n        TEXT(\".ShellClassInfo\"),\n        TEXT(\"ConfirmFileOp\"),\n        TEXT(\"0\"),\n        sDesktopFile.c_str() );\n\n    \/*\n    WritePrivateProfileString(\n        TEXT(\".ShellClassInfo\"),\n        TEXT(\"InfoTip\"),\n        TEXT(\"StarOffice Productivity Suite\"),\n        sDesktopFile.c_str() );\n        *\/\n\n    SetFileAttributes( sDesktopFile.c_str(), FILE_ATTRIBUTE_HIDDEN );\n    SetFileAttributes( sOfficeMenuFolder.c_str(), FILE_ATTRIBUTE_SYSTEM );\n\n    return ERROR_SUCCESS;\n}\n\nextern \"C\" UINT __stdcall DeinstallStartmenuFolderIcon(MSIHANDLE handle)\n{\n    std::_tstring   sOfficeMenuFolder = GetMsiProperty( handle, TEXT(\"OfficeMenuFolder\") );\n    std::_tstring sDesktopFile = sOfficeMenuFolder + TEXT(\"Desktop.ini\");\n\n    SetFileAttributes( sDesktopFile.c_str(), FILE_ATTRIBUTE_NORMAL );\n    DeleteFile( sDesktopFile.c_str() );\n\n    SetFileAttributes( sOfficeMenuFolder.c_str(), FILE_ATTRIBUTE_NORMAL );\n\n    return ERROR_SUCCESS;\n}\n<commit_msg>INTEGRATION: CWS ooo19126 (1.3.50); FILE MERGED 2005\/09\/05 17:36:46 rt 1.3.50.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: startmenuicon.cxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-07 16:41:09 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n#define WIN32_LEAN_AND_MEAN\n#include <windows.h>\n#include <msiquery.h>\n#include <malloc.h>\n\n#ifdef UNICODE\n#define _UNICODE\n#define _tstring    wstring\n#else\n#define _tstring    string\n#endif\n#include <tchar.h>\n#include <string>\n\n#ifdef _WIN32_WINNT\n#error YES\n#endif\n\nstd::_tstring GetMsiProperty( MSIHANDLE handle, const std::_tstring& sProperty )\n{\n    std::_tstring   result;\n    TCHAR   szDummy[1] = TEXT(\"\");\n    DWORD   nChars = 0;\n\n    if ( MsiGetProperty( handle, sProperty.c_str(), szDummy, &nChars ) == ERROR_MORE_DATA )\n    {\n        DWORD nBytes = ++nChars * sizeof(TCHAR);\n        LPTSTR buffer = reinterpret_cast<LPTSTR>(_alloca(nBytes));\n        ZeroMemory( buffer, nBytes );\n        MsiGetProperty(handle, sProperty.c_str(), buffer, &nChars);\n        result = buffer;\n    }\n\n    return  result;\n}\n\n\/*\n    Called during installation to customize the start menu folder icon.\n    See: http:\/\/msdn.microsoft.com\/library\/en-us\/shellcc\/platform\/shell\/programmersguide\/shell_basics\/shell_basics_extending\/custom.asp\n*\/\nextern \"C\" UINT __stdcall InstallStartmenuFolderIcon( MSIHANDLE handle )\n{\n    std::_tstring   sOfficeMenuFolder = GetMsiProperty( handle, TEXT(\"OfficeMenuFolder\") );\n    std::_tstring sDesktopFile = sOfficeMenuFolder + TEXT(\"Desktop.ini\");\n\n\/\/    MessageBox(NULL, sDesktopFile.c_str(), TEXT(\"OfficeMenuFolder\"), MB_OK | MB_ICONINFORMATION);\n\n    std::_tstring   sIconFile = GetMsiProperty( handle, TEXT(\"INSTALLLOCATION\") ) + TEXT(\"program\\\\soffice.exe\");\n\n    WritePrivateProfileString(\n        TEXT(\".ShellClassInfo\"),\n        TEXT(\"IconFile\"),\n        sIconFile.c_str(),\n        sDesktopFile.c_str() );\n\n    WritePrivateProfileString(\n        TEXT(\".ShellClassInfo\"),\n        TEXT(\"IconIndex\"),\n        TEXT(\"18\"),\n        sDesktopFile.c_str() );\n\n    WritePrivateProfileString(\n        TEXT(\".ShellClassInfo\"),\n        TEXT(\"ConfirmFileOp\"),\n        TEXT(\"0\"),\n        sDesktopFile.c_str() );\n\n    \/*\n    WritePrivateProfileString(\n        TEXT(\".ShellClassInfo\"),\n        TEXT(\"InfoTip\"),\n        TEXT(\"StarOffice Productivity Suite\"),\n        sDesktopFile.c_str() );\n        *\/\n\n    SetFileAttributes( sDesktopFile.c_str(), FILE_ATTRIBUTE_HIDDEN );\n    SetFileAttributes( sOfficeMenuFolder.c_str(), FILE_ATTRIBUTE_SYSTEM );\n\n    return ERROR_SUCCESS;\n}\n\nextern \"C\" UINT __stdcall DeinstallStartmenuFolderIcon(MSIHANDLE handle)\n{\n    std::_tstring   sOfficeMenuFolder = GetMsiProperty( handle, TEXT(\"OfficeMenuFolder\") );\n    std::_tstring sDesktopFile = sOfficeMenuFolder + TEXT(\"Desktop.ini\");\n\n    SetFileAttributes( sDesktopFile.c_str(), FILE_ATTRIBUTE_NORMAL );\n    DeleteFile( sDesktopFile.c_str() );\n\n    SetFileAttributes( sOfficeMenuFolder.c_str(), FILE_ATTRIBUTE_NORMAL );\n\n    return ERROR_SUCCESS;\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 * @file df_hmc5883_wrapper.cpp\n * Lightweight driver to access the HMC5883 of the DriverFramework.\n *\n * @author Julian Oes <julian@oes.ch>\n *\/\n\n#include <px4_config.h>\n\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <stdint.h>\n#include <stddef.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <unistd.h>\n#include <px4_getopt.h>\n#include <errno.h>\n\n#include <systemlib\/perf_counter.h>\n#include <systemlib\/err.h>\n\n#include <drivers\/drv_mag.h>\n\n#include <uORB\/topics\/parameter_update.h>\n\n#include <board_config.h>\n\/\/#include <mathlib\/math\/filter\/LowPassFilter2p.hpp>\n\/\/#include <lib\/conversion\/rotation.h>\n\n#include <hmc5883\/HMC5883.hpp>\n#include <DevMgr.hpp>\n\n\nextern \"C\" { __EXPORT int df_hmc5883_wrapper_main(int argc, char *argv[]); }\n\nusing namespace DriverFramework;\n\n\nclass DfHmc9250Wrapper : public HMC5883\n{\npublic:\n\tDfHmc9250Wrapper(\/*enum Rotation rotation*\/);\n\t~DfHmc9250Wrapper();\n\n\n\t\/**\n\t * Start automatic measurement.\n\t *\n\t * @return 0 on success\n\t *\/\n\tint\t\tstart();\n\n\t\/**\n\t * Stop automatic measurement.\n\t *\n\t * @return 0 on success\n\t *\/\n\tint\t\tstop();\n\nprivate:\n\tint _publish(struct mag_sensor_data &data);\n\n\tvoid _update_mag_calibration();\n\n\t\/\/enum Rotation\t\t_rotation;\n\n\torb_advert_t\t\t_mag_topic;\n\n\tint\t\t\t_param_update_sub;\n\n\tstruct mag_calibration_s {\n\t\tfloat x_offset;\n\t\tfloat x_scale;\n\t\tfloat y_offset;\n\t\tfloat y_scale;\n\t\tfloat z_offset;\n\t\tfloat z_scale;\n\t} _mag_calibration;\n\n\tint\t\t\t_mag_orb_class_instance;\n\n\tperf_counter_t\t\t_mag_sample_perf;\n\n};\n\nDfHmc9250Wrapper::DfHmc9250Wrapper(\/*enum Rotation rotation*\/) :\n\tHMC5883(MAG_DEVICE_PATH),\n\t_mag_topic(nullptr),\n\t_param_update_sub(-1),\n\t_mag_calibration{},\n\t_mag_orb_class_instance(-1),\n\t_mag_sample_perf(perf_alloc(PC_ELAPSED, \"df_mag_read\"))\n\t\/*_rotation(rotation)*\/\n{\n\t\/\/ Set sane default calibration values\n\t_mag_calibration.x_scale = 1.0f;\n\t_mag_calibration.y_scale = 1.0f;\n\t_mag_calibration.z_scale = 1.0f;\n\t_mag_calibration.x_offset = 0.0f;\n\t_mag_calibration.y_offset = 0.0f;\n\t_mag_calibration.z_offset = 0.0f;\n}\n\nDfHmc9250Wrapper::~DfHmc9250Wrapper()\n{\n\tperf_free(_mag_sample_perf);\n}\n\nint DfHmc9250Wrapper::start()\n{\n\t\/* Subscribe to param update topic. *\/\n\tif (_param_update_sub < 0) {\n\t\t_param_update_sub = orb_subscribe(ORB_ID(parameter_update));\n\t}\n\n\t\/* Init device and start sensor. *\/\n\tint ret = init();\n\n\tif (ret != 0) {\n\t\tPX4_ERR(\"HMC5883 init fail: %d\", ret);\n\t\treturn ret;\n\t}\n\n\tret = HMC5883::start();\n\n\tif (ret != 0) {\n\t\tPX4_ERR(\"HMC5883 start fail: %d\", ret);\n\t\treturn ret;\n\t}\n\n\t\/* Force getting the calibration values. *\/\n\t_update_mag_calibration();\n\n\treturn 0;\n}\n\nint DfHmc9250Wrapper::stop()\n{\n\t\/* Stop sensor. *\/\n\tint ret = HMC5883::stop();\n\n\tif (ret != 0) {\n\t\tPX4_ERR(\"HMC5883 stop fail: %d\", ret);\n\t\treturn ret;\n\t}\n\n\treturn 0;\n}\n\nvoid DfHmc9250Wrapper::_update_mag_calibration()\n{\n\t\/\/ TODO: replace magic number\n\tfor (unsigned i = 0; i < 3; ++i) {\n\n\t\t\/\/ TODO: remove printfs and add error counter\n\n\t\tchar str[30];\n\t\t(void)sprintf(str, \"CAL_MAG%u_ID\", i);\n\t\tint32_t device_id;\n\t\tint res = param_get(param_find(str), &device_id);\n\n\t\tif (res != OK) {\n\t\t\tPX4_ERR(\"Could not access param %s\", str);\n\t\t\tcontinue;\n\t\t}\n\n\t\tif ((uint32_t)device_id != m_id.dev_id) {\n\t\t\tcontinue;\n\t\t}\n\n\t\t(void)sprintf(str, \"CAL_MAG%u_XSCALE\", i);\n\t\tres = param_get(param_find(str), &_mag_calibration.x_scale);\n\n\t\tif (res != OK) {\n\t\t\tPX4_ERR(\"Could not access param %s\", str);\n\t\t}\n\n\t\t(void)sprintf(str, \"CAL_MAG%u_YSCALE\", i);\n\t\tres = param_get(param_find(str), &_mag_calibration.y_scale);\n\n\t\tif (res != OK) {\n\t\t\tPX4_ERR(\"Could not access param %s\", str);\n\t\t}\n\n\t\t(void)sprintf(str, \"CAL_MAG%u_ZSCALE\", i);\n\t\tres = param_get(param_find(str), &_mag_calibration.z_scale);\n\n\t\tif (res != OK) {\n\t\t\tPX4_ERR(\"Could not access param %s\", str);\n\t\t}\n\n\t\t(void)sprintf(str, \"CAL_MAG%u_XOFF\", i);\n\t\tres = param_get(param_find(str), &_mag_calibration.x_offset);\n\n\t\tif (res != OK) {\n\t\t\tPX4_ERR(\"Could not access param %s\", str);\n\t\t}\n\n\t\t(void)sprintf(str, \"CAL_MAG%u_YOFF\", i);\n\t\tres = param_get(param_find(str), &_mag_calibration.y_offset);\n\n\t\tif (res != OK) {\n\t\t\tPX4_ERR(\"Could not access param %s\", str);\n\t\t}\n\n\t\t(void)sprintf(str, \"CAL_MAG%u_ZOFF\", i);\n\t\tres = param_get(param_find(str), &_mag_calibration.z_offset);\n\n\t\tif (res != OK) {\n\t\t\tPX4_ERR(\"Could not access param %s\", str);\n\t\t}\n\t}\n}\n\n\nint DfHmc9250Wrapper::_publish(struct mag_sensor_data &data)\n{\n\t\/* Check if calibration values are still up-to-date. *\/\n\tbool updated;\n\torb_check(_param_update_sub, &updated);\n\n\tif (updated) {\n\t\tparameter_update_s parameter_update;\n\t\torb_copy(ORB_ID(parameter_update), _param_update_sub, &parameter_update);\n\n\t\t_update_mag_calibration();\n\t}\n\n\t\/* Publish mag first. *\/\n\tperf_begin(_mag_sample_perf);\n\n\tmag_report mag_report = {};\n\tmag_report.timestamp = hrt_absolute_time();\n\n\t\/* The standard external mag by 3DR has x pointing to the\n\t * right, y pointing backwards, and z down, therefore switch x\n\t * and y and invert y. *\/\n\tconst float tmp = data.field_x_ga;\n\tdata.field_x_ga = -data.field_y_ga;\n\tdata.field_y_ga = tmp;\n\n\t\/\/ TODO: remove these (or get the values)\n\tmag_report.x_raw = NAN;\n\tmag_report.y_raw = NAN;\n\tmag_report.z_raw = NAN;\n\tmag_report.x = (data.field_x_ga - _mag_calibration.x_offset) * _mag_calibration.x_scale;\n\tmag_report.y = (data.field_y_ga - _mag_calibration.y_offset) * _mag_calibration.y_scale;\n\tmag_report.z = (data.field_z_ga - _mag_calibration.z_offset) * _mag_calibration.z_scale;\n\n\t\/\/ TODO: get these right\n\t\/\/mag_report.scaling = -1.0f;\n\t\/\/mag_report.range_m_s2 = -1.0f;\n\n\tmag_report.device_id = m_id.dev_id;\n\n\t\/\/ TODO: when is this ever blocked?\n\tif (!(m_pub_blocked)) {\n\n\t\tif (_mag_topic == nullptr) {\n\t\t\t_mag_topic = orb_advertise_multi(ORB_ID(sensor_mag), &mag_report,\n\t\t\t\t\t\t\t &_mag_orb_class_instance, ORB_PRIO_HIGH);\n\n\t\t} else {\n\t\t\torb_publish(ORB_ID(sensor_mag), _mag_topic, &mag_report);\n\t\t}\n\n\t}\n\n\tperf_end(_mag_sample_perf);\n\n\t\/* Notify anyone waiting for data. *\/\n\tDevMgr::updateNotify(*this);\n\n\treturn 0;\n};\n\n\nnamespace df_hmc5883_wrapper\n{\n\nDfHmc9250Wrapper *g_dev = nullptr;\n\nint start(\/* enum Rotation rotation *\/);\nint stop();\nint info();\nvoid usage();\n\nint start(\/*enum Rotation rotation*\/)\n{\n\tg_dev = new DfHmc9250Wrapper(\/*rotation*\/);\n\n\tif (g_dev == nullptr) {\n\t\tPX4_ERR(\"failed instantiating DfHmc9250Wrapper object\");\n\t\treturn -1;\n\t}\n\n\tint ret = g_dev->start();\n\n\tif (ret != 0) {\n\t\tPX4_ERR(\"DfHmc9250Wrapper start failed\");\n\t\treturn ret;\n\t}\n\n\t\/\/ Open the MAG sensor\n\tDevHandle h;\n\tDevMgr::getHandle(MAG_DEVICE_PATH, h);\n\n\tif (!h.isValid()) {\n\t\tDF_LOG_INFO(\"Error: unable to obtain a valid handle for the receiver at: %s (%d)\",\n\t\t\t    MAG_DEVICE_PATH, h.getError());\n\t\treturn -1;\n\t}\n\n\tDevMgr::releaseHandle(h);\n\n\treturn 0;\n}\n\nint stop()\n{\n\tif (g_dev == nullptr) {\n\t\tPX4_ERR(\"driver not running\");\n\t\treturn 1;\n\t}\n\n\tint ret = g_dev->stop();\n\n\tif (ret != 0) {\n\t\tPX4_ERR(\"driver could not be stopped\");\n\t\treturn ret;\n\t}\n\n\tdelete g_dev;\n\tg_dev = nullptr;\n\treturn 0;\n}\n\n\/**\n * Print a little info about the driver.\n *\/\nint\ninfo()\n{\n\tif (g_dev == nullptr) {\n\t\tPX4_ERR(\"driver not running\");\n\t\treturn 1;\n\t}\n\n\tPX4_DEBUG(\"state @ %p\", g_dev);\n\n\treturn 0;\n}\n\nvoid\nusage()\n{\n\tPX4_WARN(\"Usage: df_hmc5883_wrapper 'start', 'info', 'stop'\");\n\tPX4_WARN(\"options:\");\n\t\/\/PX4_WARN(\"    -R rotation\");\n}\n\n} \/\/ namespace df_hmc5883_wrapper\n\n\nint\ndf_hmc5883_wrapper_main(int argc, char *argv[])\n{\n\tint ch;\n\t\/\/ enum Rotation rotation = ROTATION_NONE;\n\tint ret = 0;\n\tint myoptind = 1;\n\tconst char *myoptarg = NULL;\n\n\t\/* jump over start\/off\/etc and look at options first *\/\n\twhile ((ch = px4_getopt(argc, argv, \"R:\", &myoptind, &myoptarg)) != EOF) {\n\t\tswitch (ch) {\n\t\t\/\/case 'R':\n\t\t\/\/\trotation = (enum Rotation)atoi(myoptarg);\n\t\t\/\/\tbreak;\n\n\t\tdefault:\n\t\t\tdf_hmc5883_wrapper::usage();\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\tif (argc <= 1) {\n\t\tdf_hmc5883_wrapper::usage();\n\t\treturn 1;\n\t}\n\n\tconst char *verb = argv[myoptind];\n\n\n\tif (!strcmp(verb, \"start\")) {\n\t\tret = df_hmc5883_wrapper::start(\/*rotation*\/);\n\t}\n\n\telse if (!strcmp(verb, \"stop\")) {\n\t\tret = df_hmc5883_wrapper::stop();\n\t}\n\n\telse if (!strcmp(verb, \"info\")) {\n\t\tret = df_hmc5883_wrapper::info();\n\t}\n\n\telse {\n\t\tdf_hmc5883_wrapper::usage();\n\t\treturn 1;\n\t}\n\n\treturn ret;\n}\n<commit_msg>df_hmc5883_wrapper: rotation on driver level<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 * @file df_hmc5883_wrapper.cpp\n * Lightweight driver to access the HMC5883 of the DriverFramework.\n *\n * @author Julian Oes <julian@oes.ch>\n *\/\n\n#include <px4_config.h>\n\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <stdint.h>\n#include <stddef.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <unistd.h>\n#include <px4_getopt.h>\n#include <errno.h>\n\n#include <systemlib\/perf_counter.h>\n#include <systemlib\/err.h>\n\n#include <drivers\/drv_mag.h>\n\n#include <uORB\/topics\/parameter_update.h>\n\n#include <board_config.h>\n\n#include <lib\/conversion\/rotation.h>\n\n#include <hmc5883\/HMC5883.hpp>\n#include <DevMgr.hpp>\n\n\nextern \"C\" { __EXPORT int df_hmc5883_wrapper_main(int argc, char *argv[]); }\n\nusing namespace DriverFramework;\n\n\nclass DfHmc9250Wrapper : public HMC5883\n{\npublic:\n\tDfHmc9250Wrapper(enum Rotation rotation);\n\t~DfHmc9250Wrapper();\n\n\n\t\/**\n\t * Start automatic measurement.\n\t *\n\t * @return 0 on success\n\t *\/\n\tint\t\tstart();\n\n\t\/**\n\t * Stop automatic measurement.\n\t *\n\t * @return 0 on success\n\t *\/\n\tint\t\tstop();\n\nprivate:\n\tint _publish(struct mag_sensor_data &data);\n\n\tvoid _update_mag_calibration();\n\n\torb_advert_t\t\t_mag_topic;\n\n\tint\t\t\t_param_update_sub;\n\n\tstruct mag_calibration_s {\n\t\tfloat x_offset;\n\t\tfloat x_scale;\n\t\tfloat y_offset;\n\t\tfloat y_scale;\n\t\tfloat z_offset;\n\t\tfloat z_scale;\n\t} _mag_calibration;\n\n\tmath::Matrix<3, 3>      _rotation_matrix;\n\n\tint\t\t\t_mag_orb_class_instance;\n\n\tperf_counter_t\t\t_mag_sample_perf;\n\n};\n\nDfHmc9250Wrapper::DfHmc9250Wrapper(enum Rotation rotation) :\n\tHMC5883(MAG_DEVICE_PATH),\n\t_mag_topic(nullptr),\n\t_param_update_sub(-1),\n\t_mag_calibration{},\n\t_mag_orb_class_instance(-1),\n\t_mag_sample_perf(perf_alloc(PC_ELAPSED, \"df_mag_read\"))\n{\n\t\/\/ Set sane default calibration values\n\t_mag_calibration.x_scale = 1.0f;\n\t_mag_calibration.y_scale = 1.0f;\n\t_mag_calibration.z_scale = 1.0f;\n\t_mag_calibration.x_offset = 0.0f;\n\t_mag_calibration.y_offset = 0.0f;\n\t_mag_calibration.z_offset = 0.0f;\n\n\t\/\/ Get sensor rotation matrix\n\tget_rot_matrix(rotation, &_rotation_matrix);\n}\n\nDfHmc9250Wrapper::~DfHmc9250Wrapper()\n{\n\tperf_free(_mag_sample_perf);\n}\n\nint DfHmc9250Wrapper::start()\n{\n\t\/* Subscribe to param update topic. *\/\n\tif (_param_update_sub < 0) {\n\t\t_param_update_sub = orb_subscribe(ORB_ID(parameter_update));\n\t}\n\n\t\/* Init device and start sensor. *\/\n\tint ret = init();\n\n\tif (ret != 0) {\n\t\tPX4_ERR(\"HMC5883 init fail: %d\", ret);\n\t\treturn ret;\n\t}\n\n\tret = HMC5883::start();\n\n\tif (ret != 0) {\n\t\tPX4_ERR(\"HMC5883 start fail: %d\", ret);\n\t\treturn ret;\n\t}\n\n\t\/* Force getting the calibration values. *\/\n\t_update_mag_calibration();\n\n\treturn 0;\n}\n\nint DfHmc9250Wrapper::stop()\n{\n\t\/* Stop sensor. *\/\n\tint ret = HMC5883::stop();\n\n\tif (ret != 0) {\n\t\tPX4_ERR(\"HMC5883 stop fail: %d\", ret);\n\t\treturn ret;\n\t}\n\n\treturn 0;\n}\n\nvoid DfHmc9250Wrapper::_update_mag_calibration()\n{\n\t\/\/ TODO: replace magic number\n\tfor (unsigned i = 0; i < 3; ++i) {\n\n\t\t\/\/ TODO: remove printfs and add error counter\n\n\t\tchar str[30];\n\t\t(void)sprintf(str, \"CAL_MAG%u_ID\", i);\n\t\tint32_t device_id;\n\t\tint res = param_get(param_find(str), &device_id);\n\n\t\tif (res != OK) {\n\t\t\tPX4_ERR(\"Could not access param %s\", str);\n\t\t\tcontinue;\n\t\t}\n\n\t\tif ((uint32_t)device_id != m_id.dev_id) {\n\t\t\tcontinue;\n\t\t}\n\n\t\t(void)sprintf(str, \"CAL_MAG%u_XSCALE\", i);\n\t\tres = param_get(param_find(str), &_mag_calibration.x_scale);\n\n\t\tif (res != OK) {\n\t\t\tPX4_ERR(\"Could not access param %s\", str);\n\t\t}\n\n\t\t(void)sprintf(str, \"CAL_MAG%u_YSCALE\", i);\n\t\tres = param_get(param_find(str), &_mag_calibration.y_scale);\n\n\t\tif (res != OK) {\n\t\t\tPX4_ERR(\"Could not access param %s\", str);\n\t\t}\n\n\t\t(void)sprintf(str, \"CAL_MAG%u_ZSCALE\", i);\n\t\tres = param_get(param_find(str), &_mag_calibration.z_scale);\n\n\t\tif (res != OK) {\n\t\t\tPX4_ERR(\"Could not access param %s\", str);\n\t\t}\n\n\t\t(void)sprintf(str, \"CAL_MAG%u_XOFF\", i);\n\t\tres = param_get(param_find(str), &_mag_calibration.x_offset);\n\n\t\tif (res != OK) {\n\t\t\tPX4_ERR(\"Could not access param %s\", str);\n\t\t}\n\n\t\t(void)sprintf(str, \"CAL_MAG%u_YOFF\", i);\n\t\tres = param_get(param_find(str), &_mag_calibration.y_offset);\n\n\t\tif (res != OK) {\n\t\t\tPX4_ERR(\"Could not access param %s\", str);\n\t\t}\n\n\t\t(void)sprintf(str, \"CAL_MAG%u_ZOFF\", i);\n\t\tres = param_get(param_find(str), &_mag_calibration.z_offset);\n\n\t\tif (res != OK) {\n\t\t\tPX4_ERR(\"Could not access param %s\", str);\n\t\t}\n\t}\n}\n\n\nint DfHmc9250Wrapper::_publish(struct mag_sensor_data &data)\n{\n\t\/* Check if calibration values are still up-to-date. *\/\n\tbool updated;\n\torb_check(_param_update_sub, &updated);\n\n\tif (updated) {\n\t\tparameter_update_s parameter_update;\n\t\torb_copy(ORB_ID(parameter_update), _param_update_sub, &parameter_update);\n\n\t\t_update_mag_calibration();\n\t}\n\n\t\/* Publish mag first. *\/\n\tperf_begin(_mag_sample_perf);\n\n\tmag_report mag_report = {};\n\tmag_report.timestamp = hrt_absolute_time();\n\n\t\/* The standard external mag by 3DR has x pointing to the\n\t * right, y pointing backwards, and z down, therefore switch x\n\t * and y and invert y. *\/\n\tconst float tmp = data.field_x_ga;\n\tdata.field_x_ga = -data.field_y_ga;\n\tdata.field_y_ga = tmp;\n\n\t\/\/ TODO: remove these (or get the values)\n\tmag_report.x_raw = NAN;\n\tmag_report.y_raw = NAN;\n\tmag_report.z_raw = NAN;\n\n\n\tmath::Vector<3> mag_val((data.mag_ga_x - _mag_calibration.x_offset) * _mag_calibration.x_scale,\n\t\t\t\t(data.mag_ga_y - _mag_calibration.y_offset) * _mag_calibration.y_scale,\n\t\t\t\t(data.mag_ga_z - _mag_calibration.z_offset) * _mag_calibration.z_scale);\n\n\t\/\/ apply sensor rotation on the accel measurement\n\tmag_val = _rotation_matrix * mag_val;\n\n\tmag_report.x = mag_val(0);\n\tmag_report.y = mag_val(1);\n\tmag_report.z = mag_val(2);\n\n\n\t\/\/ TODO: get these right\n\t\/\/mag_report.scaling = -1.0f;\n\t\/\/mag_report.range_m_s2 = -1.0f;\n\n\tmag_report.device_id = m_id.dev_id;\n\n\t\/\/ TODO: when is this ever blocked?\n\tif (!(m_pub_blocked)) {\n\n\t\tif (_mag_topic == nullptr) {\n\t\t\t_mag_topic = orb_advertise_multi(ORB_ID(sensor_mag), &mag_report,\n\t\t\t\t\t\t\t &_mag_orb_class_instance, ORB_PRIO_HIGH);\n\n\t\t} else {\n\t\t\torb_publish(ORB_ID(sensor_mag), _mag_topic, &mag_report);\n\t\t}\n\n\t}\n\n\tperf_end(_mag_sample_perf);\n\n\t\/* Notify anyone waiting for data. *\/\n\tDevMgr::updateNotify(*this);\n\n\treturn 0;\n};\n\n\nnamespace df_hmc5883_wrapper\n{\n\nDfHmc9250Wrapper *g_dev = nullptr;\n\nint start(enum Rotation rotation);\nint stop();\nint info();\nvoid usage();\n\nint start(enum Rotation rotation)\n{\n\tg_dev = new DfHmc9250Wrapper(rotation);\n\n\tif (g_dev == nullptr) {\n\t\tPX4_ERR(\"failed instantiating DfHmc9250Wrapper object\");\n\t\treturn -1;\n\t}\n\n\tint ret = g_dev->start();\n\n\tif (ret != 0) {\n\t\tPX4_ERR(\"DfHmc9250Wrapper start failed\");\n\t\treturn ret;\n\t}\n\n\t\/\/ Open the MAG sensor\n\tDevHandle h;\n\tDevMgr::getHandle(MAG_DEVICE_PATH, h);\n\n\tif (!h.isValid()) {\n\t\tDF_LOG_INFO(\"Error: unable to obtain a valid handle for the receiver at: %s (%d)\",\n\t\t\t    MAG_DEVICE_PATH, h.getError());\n\t\treturn -1;\n\t}\n\n\tDevMgr::releaseHandle(h);\n\n\treturn 0;\n}\n\nint stop()\n{\n\tif (g_dev == nullptr) {\n\t\tPX4_ERR(\"driver not running\");\n\t\treturn 1;\n\t}\n\n\tint ret = g_dev->stop();\n\n\tif (ret != 0) {\n\t\tPX4_ERR(\"driver could not be stopped\");\n\t\treturn ret;\n\t}\n\n\tdelete g_dev;\n\tg_dev = nullptr;\n\treturn 0;\n}\n\n\/**\n * Print a little info about the driver.\n *\/\nint\ninfo()\n{\n\tif (g_dev == nullptr) {\n\t\tPX4_ERR(\"driver not running\");\n\t\treturn 1;\n\t}\n\n\tPX4_DEBUG(\"state @ %p\", g_dev);\n\n\treturn 0;\n}\n\nvoid\nusage()\n{\n\tPX4_INFO(\"Usage: df_hmc5883_wrapper 'start', 'info', 'stop'\");\n\tPX4_INFO(\"options:\");\n\tPX4_INFO(\"    -R rotation\");\n}\n\n} \/\/ namespace df_hmc5883_wrapper\n\n\nint\ndf_hmc5883_wrapper_main(int argc, char *argv[])\n{\n\tint ch;\n\tenum Rotation rotation = ROTATION_NONE;\n\tint ret = 0;\n\tint myoptind = 1;\n\tconst char *myoptarg = NULL;\n\n\t\/* jump over start\/off\/etc and look at options first *\/\n\twhile ((ch = px4_getopt(argc, argv, \"R:\", &myoptind, &myoptarg)) != EOF) {\n\t\tswitch (ch) {\n\t\tcase 'R':\n\t\t\trotation = (enum Rotation)atoi(myoptarg);\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tdf_hmc5883_wrapper::usage();\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\tif (argc <= 1) {\n\t\tdf_hmc5883_wrapper::usage();\n\t\treturn 1;\n\t}\n\n\tconst char *verb = argv[myoptind];\n\n\n\tif (!strcmp(verb, \"start\")) {\n\t\tret = df_hmc5883_wrapper::start(rotation);\n\t}\n\n\telse if (!strcmp(verb, \"stop\")) {\n\t\tret = df_hmc5883_wrapper::stop();\n\t}\n\n\telse if (!strcmp(verb, \"info\")) {\n\t\tret = df_hmc5883_wrapper::info();\n\t}\n\n\telse {\n\t\tdf_hmc5883_wrapper::usage();\n\t\treturn 1;\n\t}\n\n\treturn ret;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"View.h\"\n\n#include <Frame\/NodeAttrCamera.h>\n#include <Frame\/NodeAttrAmbientLight.h>\n#include <Frame\/NodeAttrLight.h>\n#include <Frame\/RenderPath.h>\n#include <Events\/Subscription.h>\n#include <Scene\/SPS.h>\n#include <Render\/RenderTarget.h>\n#include <Render\/ShaderConstant.h>\n#include <Render\/ConstantBuffer.h>\n#include <Render\/GPUDriver.h>\n#include <Render\/DepthStencilBuffer.h>\n#include <Render\/Sampler.h>\n#include <Render\/SamplerDesc.h>\n#include <UI\/UIContext.h>\n\nnamespace Frame\n{\nCView::CView() {}\n\nCView::~CView()\n{\n\tGlobals.UnbindAndClear();\n}\n\/\/---------------------------------------------------------------------\n\nbool CView::SetRenderPath(CRenderPath* pNewRenderPath)\n{\n\t\/\/ GPU must be valid in order to create global shader params and buffers\n\tif (GPU.IsNullPtr()) FAIL;\n\n\tif (RenderPath.Get() == pNewRenderPath) OK;\n\n\tGlobals.UnbindAndClear();\n\tGlobals.SetGPU(GPU);\n\n\tif (!pNewRenderPath)\n\t{\n\t\tRTs.SetSize(0);\n\t\tRenderPath = NULL;\n\t\tOK;\n\t}\n\n\t\/\/ Allocate RT and DS slots\n\t\/\/!!!may fill with default RTs and DSs if descs are provided in RP!\n\n\tRTs.SetSize(pNewRenderPath->GetRenderTargetCount());\n\tDSBuffers.SetSize(pNewRenderPath->GetDepthStencilBufferCount());\n\n\t\/\/ Allocate storage for global shader params\n\n\tconst CFixedArray<Render::CEffectConstant>& GlobalConsts = pNewRenderPath->GetGlobalConstants();\n\tfor (UPTR i = 0; i < GlobalConsts.GetCount(); ++i)\n\t{\n\t\tconst Render::CEffectConstant& Const = GlobalConsts[i];\n\n\t\tconst Render::HConstBuffer hCB = Const.Const->GetConstantBufferHandle();\n\t\tif (!Globals.IsBufferRegistered(hCB))\n\t\t{\n\t\t\tRender::PConstantBuffer CB = GPU->CreateConstantBuffer(hCB, Render::Access_CPU_Write | Render::Access_GPU_Read);\n\t\t\tif (CB.IsNullPtr())\n\t\t\t{\n\t\t\t\tGlobals.UnbindAndClear();\n\t\t\t\tFAIL;\n\t\t\t}\n\t\t\tGlobals.RegisterPermanentBuffer(hCB, *CB.Get());\n\t\t}\n\t}\n\n\t\/\/ Create linear cube sampler for image-based lighting\n\n\tRender::CSamplerDesc SamplerDesc;\n\tSamplerDesc.SetDefaults();\n\tSamplerDesc.AddressU = Render::TexAddr_Clamp;\n\tSamplerDesc.AddressV = Render::TexAddr_Clamp;\n\tSamplerDesc.AddressW = Render::TexAddr_Clamp;\n\tSamplerDesc.Filter = Render::TexFilter_MinMagMip_Linear;\n\tTrilinearCubeSampler = GPU->CreateSampler(SamplerDesc);\n\n\tRenderPath = pNewRenderPath;\n\tOK;\n}\n\/\/---------------------------------------------------------------------\n\nbool CView::SetCamera(CNodeAttrCamera* pNewCamera)\n{\n\tif (pCamera == pNewCamera) OK;\n\tif (!pNewCamera)\n\t{\n\t\tpCamera = NULL;\n\t\tOK;\n\t}\n\n\tScene::CSceneNode* pNode = pNewCamera->GetNode();\n\tif (!pNode) FAIL;\n\n\t\/\/!!!if scene node specified, test here if camera belongs to the same scene!\n\n\tpCamera = pNewCamera;\n\tVisibilityCacheDirty = true;\n\tOK;\n}\n\/\/---------------------------------------------------------------------\n\nvoid CView::UpdateVisibilityCache()\n{\n\tif (!VisibilityCacheDirty) return;\n\n\tif (pSPS && pCamera)\n\t{\n\t\tpSPS->QueryObjectsInsideFrustum(pCamera->GetViewProjMatrix(), VisibilityCache);\n\n\t\tfor (UPTR i = 0; i < VisibilityCache.GetCount();)\n\t\t{\n\t\t\tScene::CNodeAttribute* pAttr = VisibilityCache[i];\n\t\t\tif (pAttr->IsA<CNodeAttrLight>())\n\t\t\t{\n\t\t\t\tRender::CLightRecord& Rec = *LightCache.Add();\n\t\t\t\tRec.pLight = &((CNodeAttrLight*)pAttr)->GetLight();\n\t\t\t\tRec.Transform = pAttr->GetNode()->GetWorldMatrix();\n\t\t\t\tRec.UseCount = 0;\n\t\t\t\tRec.GPULightIndex = INVALID_INDEX;\n\n\t\t\t\tVisibilityCache.RemoveAt(i);\n\t\t\t}\n\t\t\telse if (pAttr->IsA<CNodeAttrAmbientLight>())\n\t\t\t{\n\t\t\t\tEnvironmentCache.Add(pAttr->As<CNodeAttrAmbientLight>());\n\t\t\t\tVisibilityCache.RemoveAt(i);\n\t\t\t}\n\t\t\telse ++i;\n\t\t}\n\t}\n\telse\n\t{\n\t\tVisibilityCache.Clear();\n\t\tLightCache.Clear();\n\t\tEnvironmentCache.Clear();\n\t}\n\n\tVisibilityCacheDirty = false;\n}\n\/\/---------------------------------------------------------------------\n\nUPTR CView::GetMeshLOD(float SqDistanceToCamera, float ScreenSpaceOccupiedRel) const\n{\n\tswitch (MeshLODType)\n\t{\n\t\tcase LOD_None:\n\t\t{\n\t\t\treturn 0;\n\t\t}\n\t\tcase LOD_Distance:\n\t\t{\n\t\t\tfor (UPTR i = 0; i < MeshLODScale.GetCount(); ++i)\n\t\t\t\tif (SqDistanceToCamera < MeshLODScale[i]) return i;\n\t\t\treturn MeshLODScale.GetCount();\n\t\t}\n\t\tcase LOD_ScreenSizeRelative:\n\t\t{\n\t\t\tfor (UPTR i = 0; i < MeshLODScale.GetCount(); ++i)\n\t\t\t\tif (ScreenSpaceOccupiedRel > MeshLODScale[i]) return i;\n\t\t\treturn MeshLODScale.GetCount();\n\t\t}\n\t\tcase LOD_ScreenSizeAbsolute:\n\t\t{\n\t\t\tif (RTs[0].IsNullPtr()) return 0;\n\t\t\tconst Render::CRenderTargetDesc& RTDesc = RTs[0]->GetDesc();\n\t\t\tfloat ScreenSpaceOccupiedAbs = SqDistanceToCamera * RTDesc.Width * RTDesc.Height; \/\/!!!may cache float WMulH, on each RT set!\n\t\t\tfor (UPTR i = 0; i < MeshLODScale.GetCount(); ++i)\n\t\t\t\tif (ScreenSpaceOccupiedAbs > MeshLODScale[i]) return i;\n\t\t\treturn MeshLODScale.GetCount();\n\t\t}\n\t}\n\n\treturn 0;\n}\n\/\/---------------------------------------------------------------------\n\nUPTR CView::GetMaterialLOD(float SqDistanceToCamera, float ScreenSpaceOccupiedRel) const\n{\n\tswitch (MaterialLODType)\n\t{\n\t\tcase LOD_None:\n\t\t{\n\t\t\treturn 0;\n\t\t}\n\t\tcase LOD_Distance:\n\t\t{\n\t\t\tfor (UPTR i = 0; i < MaterialLODScale.GetCount(); ++i)\n\t\t\t\tif (SqDistanceToCamera < MaterialLODScale[i]) return i;\n\t\t\treturn MaterialLODScale.GetCount();\n\t\t}\n\t\tcase LOD_ScreenSizeRelative:\n\t\t{\n\t\t\tfor (UPTR i = 0; i < MaterialLODScale.GetCount(); ++i)\n\t\t\t\tif (ScreenSpaceOccupiedRel > MaterialLODScale[i]) return i;\n\t\t\treturn MaterialLODScale.GetCount();\n\t\t}\n\t\tcase LOD_ScreenSizeAbsolute:\n\t\t{\n\t\t\tif (RTs[0].IsNullPtr()) return 0;\n\t\t\tconst Render::CRenderTargetDesc& RTDesc = RTs[0]->GetDesc();\n\t\t\tfloat ScreenSpaceOccupiedAbs = SqDistanceToCamera * RTDesc.Width * RTDesc.Height; \/\/!!!may cache float WMulH, on each RT set!\n\t\t\tfor (UPTR i = 0; i < MaterialLODScale.GetCount(); ++i)\n\t\t\t\tif (ScreenSpaceOccupiedAbs > MaterialLODScale[i]) return i;\n\t\t\treturn MaterialLODScale.GetCount();\n\t\t}\n\t}\n\n\treturn 0;\n}\n\/\/---------------------------------------------------------------------\n\nbool CView::Render()\n{\n\tVisibilityCache.Clear();\n\tLightCache.Clear();\n\tEnvironmentCache.Clear();\n\tVisibilityCacheDirty = true;\n\tif (!GPU->BeginFrame() || !RenderPath->Render(*this)) FAIL;\n\tGPU->EndFrame();\n\tOK;\n}\n\/\/---------------------------------------------------------------------\n\n}\n<commit_msg>Frame view rendering fix<commit_after>#include \"View.h\"\n\n#include <Frame\/NodeAttrCamera.h>\n#include <Frame\/NodeAttrAmbientLight.h>\n#include <Frame\/NodeAttrLight.h>\n#include <Frame\/RenderPath.h>\n#include <Events\/Subscription.h>\n#include <Scene\/SPS.h>\n#include <Render\/RenderTarget.h>\n#include <Render\/ShaderConstant.h>\n#include <Render\/ConstantBuffer.h>\n#include <Render\/GPUDriver.h>\n#include <Render\/DepthStencilBuffer.h>\n#include <Render\/Sampler.h>\n#include <Render\/SamplerDesc.h>\n#include <UI\/UIContext.h>\n\nnamespace Frame\n{\nCView::CView() {}\n\nCView::~CView()\n{\n\tGlobals.UnbindAndClear();\n}\n\/\/---------------------------------------------------------------------\n\nbool CView::SetRenderPath(CRenderPath* pNewRenderPath)\n{\n\t\/\/ GPU must be valid in order to create global shader params and buffers\n\tif (GPU.IsNullPtr()) FAIL;\n\n\tif (RenderPath.Get() == pNewRenderPath) OK;\n\n\tGlobals.UnbindAndClear();\n\tGlobals.SetGPU(GPU);\n\n\tif (!pNewRenderPath)\n\t{\n\t\tRTs.SetSize(0);\n\t\tRenderPath = NULL;\n\t\tOK;\n\t}\n\n\t\/\/ Allocate RT and DS slots\n\t\/\/!!!may fill with default RTs and DSs if descs are provided in RP!\n\n\tRTs.SetSize(pNewRenderPath->GetRenderTargetCount());\n\tDSBuffers.SetSize(pNewRenderPath->GetDepthStencilBufferCount());\n\n\t\/\/ Allocate storage for global shader params\n\n\tconst CFixedArray<Render::CEffectConstant>& GlobalConsts = pNewRenderPath->GetGlobalConstants();\n\tfor (UPTR i = 0; i < GlobalConsts.GetCount(); ++i)\n\t{\n\t\tconst Render::CEffectConstant& Const = GlobalConsts[i];\n\n\t\tconst Render::HConstBuffer hCB = Const.Const->GetConstantBufferHandle();\n\t\tif (!Globals.IsBufferRegistered(hCB))\n\t\t{\n\t\t\tRender::PConstantBuffer CB = GPU->CreateConstantBuffer(hCB, Render::Access_CPU_Write | Render::Access_GPU_Read);\n\t\t\tif (CB.IsNullPtr())\n\t\t\t{\n\t\t\t\tGlobals.UnbindAndClear();\n\t\t\t\tFAIL;\n\t\t\t}\n\t\t\tGlobals.RegisterPermanentBuffer(hCB, *CB.Get());\n\t\t}\n\t}\n\n\t\/\/ Create linear cube sampler for image-based lighting\n\n\tRender::CSamplerDesc SamplerDesc;\n\tSamplerDesc.SetDefaults();\n\tSamplerDesc.AddressU = Render::TexAddr_Clamp;\n\tSamplerDesc.AddressV = Render::TexAddr_Clamp;\n\tSamplerDesc.AddressW = Render::TexAddr_Clamp;\n\tSamplerDesc.Filter = Render::TexFilter_MinMagMip_Linear;\n\tTrilinearCubeSampler = GPU->CreateSampler(SamplerDesc);\n\n\tRenderPath = pNewRenderPath;\n\tOK;\n}\n\/\/---------------------------------------------------------------------\n\nbool CView::SetCamera(CNodeAttrCamera* pNewCamera)\n{\n\tif (pCamera == pNewCamera) OK;\n\tif (!pNewCamera)\n\t{\n\t\tpCamera = NULL;\n\t\tOK;\n\t}\n\n\tScene::CSceneNode* pNode = pNewCamera->GetNode();\n\tif (!pNode) FAIL;\n\n\t\/\/!!!if scene node specified, test here if camera belongs to the same scene!\n\n\tpCamera = pNewCamera;\n\tVisibilityCacheDirty = true;\n\tOK;\n}\n\/\/---------------------------------------------------------------------\n\nvoid CView::UpdateVisibilityCache()\n{\n\tif (!VisibilityCacheDirty) return;\n\n\tif (pSPS && pCamera)\n\t{\n\t\tpSPS->QueryObjectsInsideFrustum(pCamera->GetViewProjMatrix(), VisibilityCache);\n\n\t\tfor (UPTR i = 0; i < VisibilityCache.GetCount();)\n\t\t{\n\t\t\tScene::CNodeAttribute* pAttr = VisibilityCache[i];\n\t\t\tif (pAttr->IsA<CNodeAttrLight>())\n\t\t\t{\n\t\t\t\tRender::CLightRecord& Rec = *LightCache.Add();\n\t\t\t\tRec.pLight = &((CNodeAttrLight*)pAttr)->GetLight();\n\t\t\t\tRec.Transform = pAttr->GetNode()->GetWorldMatrix();\n\t\t\t\tRec.UseCount = 0;\n\t\t\t\tRec.GPULightIndex = INVALID_INDEX;\n\n\t\t\t\tVisibilityCache.RemoveAt(i);\n\t\t\t}\n\t\t\telse if (pAttr->IsA<CNodeAttrAmbientLight>())\n\t\t\t{\n\t\t\t\tEnvironmentCache.Add(pAttr->As<CNodeAttrAmbientLight>());\n\t\t\t\tVisibilityCache.RemoveAt(i);\n\t\t\t}\n\t\t\telse ++i;\n\t\t}\n\t}\n\telse\n\t{\n\t\tVisibilityCache.Clear();\n\t\tLightCache.Clear();\n\t\tEnvironmentCache.Clear();\n\t}\n\n\tVisibilityCacheDirty = false;\n}\n\/\/---------------------------------------------------------------------\n\nUPTR CView::GetMeshLOD(float SqDistanceToCamera, float ScreenSpaceOccupiedRel) const\n{\n\tswitch (MeshLODType)\n\t{\n\t\tcase LOD_None:\n\t\t{\n\t\t\treturn 0;\n\t\t}\n\t\tcase LOD_Distance:\n\t\t{\n\t\t\tfor (UPTR i = 0; i < MeshLODScale.GetCount(); ++i)\n\t\t\t\tif (SqDistanceToCamera < MeshLODScale[i]) return i;\n\t\t\treturn MeshLODScale.GetCount();\n\t\t}\n\t\tcase LOD_ScreenSizeRelative:\n\t\t{\n\t\t\tfor (UPTR i = 0; i < MeshLODScale.GetCount(); ++i)\n\t\t\t\tif (ScreenSpaceOccupiedRel > MeshLODScale[i]) return i;\n\t\t\treturn MeshLODScale.GetCount();\n\t\t}\n\t\tcase LOD_ScreenSizeAbsolute:\n\t\t{\n\t\t\tif (RTs[0].IsNullPtr()) return 0;\n\t\t\tconst Render::CRenderTargetDesc& RTDesc = RTs[0]->GetDesc();\n\t\t\tfloat ScreenSpaceOccupiedAbs = SqDistanceToCamera * RTDesc.Width * RTDesc.Height; \/\/!!!may cache float WMulH, on each RT set!\n\t\t\tfor (UPTR i = 0; i < MeshLODScale.GetCount(); ++i)\n\t\t\t\tif (ScreenSpaceOccupiedAbs > MeshLODScale[i]) return i;\n\t\t\treturn MeshLODScale.GetCount();\n\t\t}\n\t}\n\n\treturn 0;\n}\n\/\/---------------------------------------------------------------------\n\nUPTR CView::GetMaterialLOD(float SqDistanceToCamera, float ScreenSpaceOccupiedRel) const\n{\n\tswitch (MaterialLODType)\n\t{\n\t\tcase LOD_None:\n\t\t{\n\t\t\treturn 0;\n\t\t}\n\t\tcase LOD_Distance:\n\t\t{\n\t\t\tfor (UPTR i = 0; i < MaterialLODScale.GetCount(); ++i)\n\t\t\t\tif (SqDistanceToCamera < MaterialLODScale[i]) return i;\n\t\t\treturn MaterialLODScale.GetCount();\n\t\t}\n\t\tcase LOD_ScreenSizeRelative:\n\t\t{\n\t\t\tfor (UPTR i = 0; i < MaterialLODScale.GetCount(); ++i)\n\t\t\t\tif (ScreenSpaceOccupiedRel > MaterialLODScale[i]) return i;\n\t\t\treturn MaterialLODScale.GetCount();\n\t\t}\n\t\tcase LOD_ScreenSizeAbsolute:\n\t\t{\n\t\t\tif (RTs[0].IsNullPtr()) return 0;\n\t\t\tconst Render::CRenderTargetDesc& RTDesc = RTs[0]->GetDesc();\n\t\t\tfloat ScreenSpaceOccupiedAbs = SqDistanceToCamera * RTDesc.Width * RTDesc.Height; \/\/!!!may cache float WMulH, on each RT set!\n\t\t\tfor (UPTR i = 0; i < MaterialLODScale.GetCount(); ++i)\n\t\t\t\tif (ScreenSpaceOccupiedAbs > MaterialLODScale[i]) return i;\n\t\t\treturn MaterialLODScale.GetCount();\n\t\t}\n\t}\n\n\treturn 0;\n}\n\/\/---------------------------------------------------------------------\n\nbool CView::Render()\n{\n\tif (!RenderPath) FAIL;\n\n\tVisibilityCache.Clear();\n\tLightCache.Clear();\n\tEnvironmentCache.Clear();\n\tVisibilityCacheDirty = true;\n\n\treturn RenderPath->Render(*this);\n}\n\/\/---------------------------------------------------------------------\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ std includes\n#include <iostream>\n\n\/\/ Qt includes\n#include <QDebug>\n#include <QTreeView>\n#include <QTabBar>\n#include <QSettings>\n#include <QAction>\n#include <QModelIndex>\n#include <QCheckBox>\n\n\/\/ ctkDICOMCore includes\n#include \"ctkDICOMDatabase.h\"\n#include \"ctkDICOMIndexer.h\"\n\n\/\/ ctkDICOMWidgets includes\n#include \"ctkDICOMModel.h\"\n#include \"ctkDICOMAppWidget.h\"\n#include \"ctkDICOMQueryResultsTabWidget.h\"\n#include \"ui_ctkDICOMAppWidget.h\"\n#include \"ctkDirectoryButton.h\"\n#include \"ctkFileDialog.h\"\n\n#include \"ctkDICOMQueryRetrieveWidget.h\"\n#include \"ctkDICOMImportWidget.h\"\n\n\/\/logger\n#include <ctkLogger.h>\nstatic ctkLogger logger(\"org.commontk.DICOM.Widgets.ctkDICOMAppWidget\");\n\n\/\/----------------------------------------------------------------------------\nclass ctkDICOMAppWidgetPrivate: public Ui_ctkDICOMAppWidget\n{\npublic:\n  ctkDICOMAppWidgetPrivate();\n\n  ctkFileDialog* ImportDialog;\n  ctkDICOMQueryRetrieveWidget* QueryRetrieveWidget;\n\n  QSharedPointer<ctkDICOMDatabase> DICOMDatabase;\n  ctkDICOMModel DICOMModel;\n  QSharedPointer<ctkDICOMIndexer> DICOMIndexer;\n\n};\n\n\/\/----------------------------------------------------------------------------\n\/\/ ctkDICOMAppWidgetPrivate methods\n\nctkDICOMAppWidgetPrivate::ctkDICOMAppWidgetPrivate(){\n  \n  DICOMDatabase = QSharedPointer<ctkDICOMDatabase> (new ctkDICOMDatabase);\n  DICOMIndexer = QSharedPointer<ctkDICOMIndexer> (new ctkDICOMIndexer);\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ ctkDICOMAppWidget methods\n\n\/\/----------------------------------------------------------------------------\nctkDICOMAppWidget::ctkDICOMAppWidget(QWidget* _parent):Superclass(_parent), \n  d_ptr(new ctkDICOMAppWidgetPrivate)\n{\n  Q_D(ctkDICOMAppWidget);  \n\n  d->setupUi(this);\n  \n  \/\/Set toolbar button style\n  d->toolBar->setToolButtonStyle(Qt::ToolButtonTextUnderIcon);\n\n  \/\/Initialize Q\/R widget\n  d->QueryRetrieveWidget = new ctkDICOMQueryRetrieveWidget();\n  d->QueryRetrieveWidget->setWindowModality ( Qt::ApplicationModal );\n  connect(d->directoryButton, SIGNAL(directoryChanged(const QString&)), this, SLOT(setDatabaseDirectory(const QString&)));\n\n  \/\/Initialize import widget\n  d->ImportDialog = new ctkFileDialog();\n  QCheckBox* importCheckbox = new QCheckBox(\"Copy on import\", d->ImportDialog);\n  d->ImportDialog->setBottomWidget(importCheckbox);\n  d->ImportDialog->setFileMode(QFileDialog::Directory);\n  d->ImportDialog->setLabelText(QFileDialog::Accept,\"Import\");\n  d->ImportDialog->setWindowTitle(\"Import DICOM files from directory ...\");\n  d->ImportDialog->setWindowModality(Qt::ApplicationModal);\n\n\n  \/\/Set thumbnails width in thumbnail widget\n  \/\/d->thumbnailsWidget->setThumbnailWidth(128);\n  \/\/Test add thumbnails\n  \/\/d->thumbnailsWidget->addTestThumbnail();\n\n  \/\/connect signal and slots\n  connect(d->treeView, SIGNAL(clicked(const QModelIndex&)), this, SLOT(onDICOMModelSelected(const QModelIndex &)));\n  connect(d->thumbnailsWidget, SIGNAL(selected(const ctkDICOMThumbnailWidget&)), this, SLOT(onThumbnailSelected(const ctkDICOMThumbnailWidget&)));\n  connect(d->ImportDialog, SIGNAL(fileSelected(QString)),this,SLOT(onImportDirectory(QString)));\n\n  connect(d->DICOMDatabase.data(), SIGNAL( databaseChanged() ), &(d->DICOMModel), SLOT( reset() ) );\n\n}\n\n\/\/----------------------------------------------------------------------------\nctkDICOMAppWidget::~ctkDICOMAppWidget()\n{\n  Q_D(ctkDICOMAppWidget);  \n\n  d->QueryRetrieveWidget->deleteLater();\n  d->ImportDialog->deleteLater();\n}\n\n\/\/----------------------------------------------------------------------------\nvoid ctkDICOMAppWidget::setDatabaseDirectory(const QString& directory)\n{\n  Q_D(ctkDICOMAppWidget);  \n\n  QSettings settings;\n  settings.setValue(\"DatabaseDirectory\", directory);\n  settings.sync();\n\n  \/\/close the active DICOM database\n  d->DICOMDatabase->closeDatabase();\n  \n  \/\/open DICOM database on the directory\n  QString databaseFileName = directory + QString(\"\/ctkDICOM.sql\");\n  try { d->DICOMDatabase->openDatabase( databaseFileName ); }\n  catch (std::exception e)\n  {\n    std::cerr << \"Database error: \" << qPrintable(d->DICOMDatabase->lastError()) << \"\\n\";\n    d->DICOMDatabase->closeDatabase();\n    return;\n  }\n  \n  d->DICOMModel.setDatabase(d->DICOMDatabase->database());\n  d->treeView->setModel(&d->DICOMModel);\n\n  \/\/pass DICOM database instance to Import widget\n  \/\/ d->ImportDialog->setDICOMDatabase(d->DICOMDatabase);\n  d->QueryRetrieveWidget->setRetrieveDatabase(d->DICOMDatabase);\n}\n\nvoid ctkDICOMAppWidget::onAddToDatabase()\n{\n  \/\/Q_D(ctkDICOMAppWidget);\n\n  \/\/d->\n}\n\n\/\/----------------------------------------------------------------------------\nvoid ctkDICOMAppWidget::onImport(){\n  Q_D(ctkDICOMAppWidget);\n  \n  d->ImportDialog->show();\n  d->ImportDialog->raise();\n}\n\nvoid ctkDICOMAppWidget::onExport(){\n\n}\n\nvoid ctkDICOMAppWidget::onQuery(){\n  Q_D(ctkDICOMAppWidget);\n\n  d->QueryRetrieveWidget->show();\n  d->QueryRetrieveWidget->raise();\n}\n\nvoid ctkDICOMAppWidget::onDICOMModelSelected(const QModelIndex& index)\n{\n  Q_D(ctkDICOMAppWidget);\n\n  if ( d->DICOMModel.data(index,ctkDICOMModel::TypeRole) == ctkDICOMModel::SeriesType )\n  {\n    qDebug() << \"Clicked on series\";\n    QStringList thumbnails;\n    QString thumbnailPath = d->DICOMDatabase->databaseDirectory() +\n                            \"\/thumbs\/\" + d->DICOMModel.data(index.parent() ,ctkDICOMModel::UIDRole).toString() + \"\/\" +\n                            d->DICOMModel.data(index ,ctkDICOMModel::UIDRole).toString() + \"\/\";\n\n    QModelIndex studyIndex = index.parent();\n    QModelIndex seriesIndex = index;\n    int imageCount = d->DICOMModel.rowCount(index);\n    for (int i = 0 ; i < imageCount ; i++ )\n    {\n      QModelIndex imageIndex = index.child(i,0);\n      QString thumbnail = thumbnailPath + d->DICOMModel.data(imageIndex, ctkDICOMModel::UIDRole).toString() + \".png\";\n      qDebug() << \"Thumb: \" << thumbnail;\n      if (QFile(thumbnail).exists())\n      {\n        thumbnails << thumbnail;\n      }\n      d->thumbnailsWidget->setThumbnailFiles(thumbnails);\n    }\n\n    \/\/  thumbnailPath.append(\"\/thumbs\/\").append(d->DICOMModel.data( studyIndex,ctkDICOMModel::UIDRole).toString() );\n    \/\/  thumbnailPath.append(d->DICOMModel.data( seriesIndex,ctkDICOMModel::UIDRole).toString() );\n  }\n\n\n  \/\/ TODO: this could check the type of the model entries\n  QString thumbnailPath = d->DICOMDatabase->databaseDirectory();\n  thumbnailPath.append(\"\/thumbs\/\").append(d->DICOMModel.data(index.parent().parent() ,ctkDICOMModel::UIDRole).toString());\n  thumbnailPath.append(\"\/\").append(d->DICOMModel.data(index.parent() ,ctkDICOMModel::UIDRole).toString());\n  thumbnailPath.append(\"\/\").append(d->DICOMModel.data(index ,ctkDICOMModel::UIDRole).toString());\n  thumbnailPath.append(\".png\");\n  if (QFile(thumbnailPath).exists())\n  {\n    d->imagePreview->setPixmap(QPixmap(thumbnailPath));\n  }\n  else\n  {\n    d->imagePreview->setText(\"No preview\");\n  }\n\n\n}\n\nvoid ctkDICOMAppWidget::onThumbnailSelected(const ctkDICOMThumbnailWidget& widget){\n  \/\/TODO: update previewer\n}\n\nvoid ctkDICOMAppWidget::onImportDirectory(QString directory)\n{\n  Q_D(ctkDICOMAppWidget);\n  if (QDir(directory).exists())\n  {\n    QCheckBox* copyOnImport = qobject_cast<QCheckBox*>(d->ImportDialog->bottomWidget());\n    QString targetDirectory;\n    if (copyOnImport->isEnabled())\n    {\n       targetDirectory = d->DICOMDatabase->databaseDirectory();\n    }\n    d->DICOMIndexer->addDirectory(*d->DICOMDatabase,directory,targetDirectory);\n    d->DICOMModel.reset();\n  }\n}\n<commit_msg>Work for debugging thumbnails<commit_after>\/\/ std includes\n#include <iostream>\n\n\/\/ Qt includes\n#include <QDebug>\n#include <QTreeView>\n#include <QTabBar>\n#include <QSettings>\n#include <QAction>\n#include <QModelIndex>\n#include <QCheckBox>\n\n\/\/ ctkDICOMCore includes\n#include \"ctkDICOMDatabase.h\"\n#include \"ctkDICOMIndexer.h\"\n\n\/\/ ctkDICOMWidgets includes\n#include \"ctkDICOMModel.h\"\n#include \"ctkDICOMAppWidget.h\"\n#include \"ctkDICOMQueryResultsTabWidget.h\"\n#include \"ui_ctkDICOMAppWidget.h\"\n#include \"ctkDirectoryButton.h\"\n#include \"ctkFileDialog.h\"\n\n#include \"ctkDICOMQueryRetrieveWidget.h\"\n#include \"ctkDICOMImportWidget.h\"\n\n\/\/logger\n#include <ctkLogger.h>\nstatic ctkLogger logger(\"org.commontk.DICOM.Widgets.ctkDICOMAppWidget\");\n\n\/\/----------------------------------------------------------------------------\nclass ctkDICOMAppWidgetPrivate: public Ui_ctkDICOMAppWidget\n{\npublic:\n  ctkDICOMAppWidgetPrivate();\n\n  ctkFileDialog* ImportDialog;\n  ctkDICOMQueryRetrieveWidget* QueryRetrieveWidget;\n\n  QSharedPointer<ctkDICOMDatabase> DICOMDatabase;\n  ctkDICOMModel DICOMModel;\n  QSharedPointer<ctkDICOMIndexer> DICOMIndexer;\n\n};\n\n\/\/----------------------------------------------------------------------------\n\/\/ ctkDICOMAppWidgetPrivate methods\n\nctkDICOMAppWidgetPrivate::ctkDICOMAppWidgetPrivate(){\n  \n  DICOMDatabase = QSharedPointer<ctkDICOMDatabase> (new ctkDICOMDatabase);\n  DICOMIndexer = QSharedPointer<ctkDICOMIndexer> (new ctkDICOMIndexer);\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ ctkDICOMAppWidget methods\n\n\/\/----------------------------------------------------------------------------\nctkDICOMAppWidget::ctkDICOMAppWidget(QWidget* _parent):Superclass(_parent), \n  d_ptr(new ctkDICOMAppWidgetPrivate)\n{\n  Q_D(ctkDICOMAppWidget);  \n\n  d->setupUi(this);\n  \n  \/\/Set toolbar button style\n  d->toolBar->setToolButtonStyle(Qt::ToolButtonTextUnderIcon);\n\n  \/\/Initialize Q\/R widget\n  d->QueryRetrieveWidget = new ctkDICOMQueryRetrieveWidget();\n  d->QueryRetrieveWidget->setWindowModality ( Qt::ApplicationModal );\n  connect(d->directoryButton, SIGNAL(directoryChanged(const QString&)), this, SLOT(setDatabaseDirectory(const QString&)));\n\n  \/\/Initialize import widget\n  d->ImportDialog = new ctkFileDialog();\n  QCheckBox* importCheckbox = new QCheckBox(\"Copy on import\", d->ImportDialog);\n  d->ImportDialog->setBottomWidget(importCheckbox);\n  d->ImportDialog->setFileMode(QFileDialog::Directory);\n  d->ImportDialog->setLabelText(QFileDialog::Accept,\"Import\");\n  d->ImportDialog->setWindowTitle(\"Import DICOM files from directory ...\");\n  d->ImportDialog->setWindowModality(Qt::ApplicationModal);\n\n\n  \/\/Set thumbnails width in thumbnail widget\n  \/\/d->thumbnailsWidget->setThumbnailWidth(128);\n  \/\/Test add thumbnails\n  \/\/d->thumbnailsWidget->addTestThumbnail();\n\n  \/\/connect signal and slots\n  connect(d->treeView, SIGNAL(clicked(const QModelIndex&)), this, SLOT(onDICOMModelSelected(const QModelIndex &)));\n  connect(d->thumbnailsWidget, SIGNAL(selected(const ctkDICOMThumbnailWidget&)), this, SLOT(onThumbnailSelected(const ctkDICOMThumbnailWidget&)));\n  connect(d->ImportDialog, SIGNAL(fileSelected(QString)),this,SLOT(onImportDirectory(QString)));\n\n  connect(d->DICOMDatabase.data(), SIGNAL( databaseChanged() ), &(d->DICOMModel), SLOT( reset() ) );\n\n}\n\n\/\/----------------------------------------------------------------------------\nctkDICOMAppWidget::~ctkDICOMAppWidget()\n{\n  Q_D(ctkDICOMAppWidget);  \n\n  d->QueryRetrieveWidget->deleteLater();\n  d->ImportDialog->deleteLater();\n}\n\n\/\/----------------------------------------------------------------------------\nvoid ctkDICOMAppWidget::setDatabaseDirectory(const QString& directory)\n{\n  Q_D(ctkDICOMAppWidget);  \n\n  QSettings settings;\n  settings.setValue(\"DatabaseDirectory\", directory);\n  settings.sync();\n\n  \/\/close the active DICOM database\n  d->DICOMDatabase->closeDatabase();\n  \n  \/\/open DICOM database on the directory\n  QString databaseFileName = directory + QString(\"\/ctkDICOM.sql\");\n  try { d->DICOMDatabase->openDatabase( databaseFileName ); }\n  catch (std::exception e)\n  {\n    std::cerr << \"Database error: \" << qPrintable(d->DICOMDatabase->lastError()) << \"\\n\";\n    d->DICOMDatabase->closeDatabase();\n    return;\n  }\n  \n  d->DICOMModel.setDatabase(d->DICOMDatabase->database());\n  d->treeView->setModel(&d->DICOMModel);\n\n  \/\/pass DICOM database instance to Import widget\n  \/\/ d->ImportDialog->setDICOMDatabase(d->DICOMDatabase);\n  d->QueryRetrieveWidget->setRetrieveDatabase(d->DICOMDatabase);\n}\n\nvoid ctkDICOMAppWidget::onAddToDatabase()\n{\n  \/\/Q_D(ctkDICOMAppWidget);\n\n  \/\/d->\n}\n\n\/\/----------------------------------------------------------------------------\nvoid ctkDICOMAppWidget::onImport(){\n  Q_D(ctkDICOMAppWidget);\n  \n  d->ImportDialog->show();\n  d->ImportDialog->raise();\n}\n\nvoid ctkDICOMAppWidget::onExport(){\n\n}\n\nvoid ctkDICOMAppWidget::onQuery(){\n  Q_D(ctkDICOMAppWidget);\n\n  d->QueryRetrieveWidget->show();\n  d->QueryRetrieveWidget->raise();\n}\n\nvoid ctkDICOMAppWidget::onDICOMModelSelected(const QModelIndex& index)\n{\n  Q_D(ctkDICOMAppWidget);\n\n  if ( d->DICOMModel.data(index,ctkDICOMModel::TypeRole) == ctkDICOMModel::SeriesType )\n  {\n    qDebug() << \"Clicked on series\";\n    QStringList thumbnails;\n    QString thumbnailPath = d->DICOMDatabase->databaseDirectory() +\n                            \"\/thumbs\/\" + d->DICOMModel.data(index.parent() ,ctkDICOMModel::UIDRole).toString() + \"\/\" +\n                            d->DICOMModel.data(index ,ctkDICOMModel::UIDRole).toString() + \"\/\";\n\n    QModelIndex studyIndex = index.parent();\n    QModelIndex seriesIndex = index;\n    int imageCount = d->DICOMModel.rowCount(index);\n    logger.debug(QString(\"Thumbs: %1\").arg(imageCount));\n    for (int i = 0 ; i < imageCount ; i++ )\n    {\n      QModelIndex imageIndex = index.child(i,0);\n      QString thumbnail = thumbnailPath + d->DICOMModel.data(imageIndex, ctkDICOMModel::UIDRole).toString() + \".png\";\n      qDebug() << \"Thumb: \" << thumbnail;\n      if (QFile(thumbnail).exists())\n      {\n        thumbnails << thumbnail;\n      }\n      else\n      {\n      logger.error(\"No thumbnail file \" + thumbnail);\n      }\n    }\n    d->thumbnailsWidget->setThumbnailFiles(thumbnails);\n\n    \/\/  thumbnailPath.append(\"\/thumbs\/\").append(d->DICOMModel.data( studyIndex,ctkDICOMModel::UIDRole).toString() );\n    \/\/  thumbnailPath.append(d->DICOMModel.data( seriesIndex,ctkDICOMModel::UIDRole).toString() );\n  }\n\n\n  \/\/ TODO: this could check the type of the model entries\n  QString thumbnailPath = d->DICOMDatabase->databaseDirectory();\n  thumbnailPath.append(\"\/thumbs\/\").append(d->DICOMModel.data(index.parent().parent() ,ctkDICOMModel::UIDRole).toString());\n  thumbnailPath.append(\"\/\").append(d->DICOMModel.data(index.parent() ,ctkDICOMModel::UIDRole).toString());\n  thumbnailPath.append(\"\/\").append(d->DICOMModel.data(index ,ctkDICOMModel::UIDRole).toString());\n  thumbnailPath.append(\".png\");\n  if (QFile(thumbnailPath).exists())\n  {\n    d->imagePreview->setPixmap(QPixmap(thumbnailPath));\n  }\n  else\n  {\n    d->imagePreview->setText(\"No preview\");\n  }\n\n\n}\n\nvoid ctkDICOMAppWidget::onThumbnailSelected(const ctkDICOMThumbnailWidget& widget){\n  \/\/TODO: update previewer\n}\n\nvoid ctkDICOMAppWidget::onImportDirectory(QString directory)\n{\n  Q_D(ctkDICOMAppWidget);\n  if (QDir(directory).exists())\n  {\n    QCheckBox* copyOnImport = qobject_cast<QCheckBox*>(d->ImportDialog->bottomWidget());\n    QString targetDirectory;\n    if (copyOnImport->isEnabled())\n    {\n       targetDirectory = d->DICOMDatabase->databaseDirectory();\n    }\n    d->DICOMIndexer->addDirectory(*d->DICOMDatabase,directory,targetDirectory);\n    d->DICOMModel.reset();\n  }\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.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\/\/ ctkDICOMWidget includes\n#include \"ctkDICOMTableView.h\"\n#include \"ui_ctkDICOMTableView.h\"\n\n\/\/ Qt includes\n#include <QSqlQueryModel>\n#include <QSortFilterProxyModel>\n\nclass ctkDICOMTableViewPrivate : public Ui_ctkDICOMTableView\n{\n  Q_DECLARE_PUBLIC (ctkDICOMTableView)\n\nprotected:\n  ctkDICOMTableView* const q_ptr;\n\npublic:\n  ctkDICOMTableViewPrivate(ctkDICOMTableView& obj);\n  ctkDICOMTableViewPrivate(ctkDICOMTableView& obj, QSharedPointer<ctkDICOMDatabase> db);\n  ~ctkDICOMTableViewPrivate();\n  \/\/ Initialize UI\n  void init();\n  \/\/ Setup tableview with tablemodel if database is available\n  void setUpTableView();\n  \/\/Temporay solution to hide UID columns\n  void hideUIDColumns();\n\n  QSharedPointer<ctkDICOMDatabase> DICOMDatabase;\n  QSqlQueryModel DICOMSQLModel;\n  QSortFilterProxyModel* DICOMSQLFilterModel;\n  QString queryTableName;\n  QString queryForeignKey;\n  QString queryPrimaryKey;\n\n};\n\nctkDICOMTableViewPrivate::ctkDICOMTableViewPrivate(ctkDICOMTableView &obj)\n  : q_ptr(&obj)\n{\n  this->DICOMSQLFilterModel = new QSortFilterProxyModel();\n}\n\nctkDICOMTableViewPrivate::ctkDICOMTableViewPrivate(ctkDICOMTableView &obj, QSharedPointer<ctkDICOMDatabase> db)\n  : q_ptr(&obj)\n  , DICOMDatabase(db)\n{\n  this->DICOMSQLFilterModel = new QSortFilterProxyModel();\n}\n\nctkDICOMTableViewPrivate::~ctkDICOMTableViewPrivate()\n{\n  delete this->DICOMSQLFilterModel;\n}\n\nvoid ctkDICOMTableViewPrivate::init()\n{\n  Q_Q(ctkDICOMTableView);\n  this->setupUi(q);\n\n  this->tblDicomDatabaseView->setSelectionBehavior(QAbstractItemView::SelectRows);\n  this->tblDicomDatabaseView->setSelectionMode(QAbstractItemView::ExtendedSelection);\n  this->tblDicomDatabaseView->verticalHeader()->setHidden(true);\n  this->tblDicomDatabaseView->horizontalHeader()->setResizeMode(QHeaderView::ResizeToContents);\n  this->tblDicomDatabaseView->horizontalHeader()->setStretchLastSection(true);\n\n  if (this->DICOMDatabase)\n  {\n    this->setUpTableView();\n  }\n}\n\nvoid ctkDICOMTableViewPrivate::setUpTableView()\n{\n  Q_Q(ctkDICOMTableView);\n  if (this->DICOMDatabase)\n  {\n    QString query = \"select * from \"+this->queryTableName;\n    this->DICOMSQLModel.setQuery(query, this->DICOMDatabase->database());\n    this->DICOMSQLFilterModel->setSourceModel(&this->DICOMSQLModel);\n    this->DICOMSQLFilterModel->setFilterKeyColumn(-1);\n    this->DICOMSQLFilterModel->setFilterCaseSensitivity(Qt::CaseInsensitive);\n    this->tblDicomDatabaseView->setModel(this->DICOMSQLFilterModel);\n    this->tblDicomDatabaseView->setColumnHidden(0, true);\n    this->tblDicomDatabaseView->setSortingEnabled(true);\n    this->hideUIDColumns();\n\n    QObject::connect(this->tblDicomDatabaseView->selectionModel(), SIGNAL(selectionChanged(QItemSelection,QItemSelection)),\n                     q, SLOT(onSelectionChanged()));\n    QObject::connect(this->tblDicomDatabaseView->selectionModel(), SIGNAL(selectionChanged(const QItemSelection&,const QItemSelection&)),\n                     q, SIGNAL(signalSelectionChanged(const QItemSelection&,const QItemSelection&)));\n    QObject::connect(this->leSearchBox, SIGNAL(textChanged(QString)), this->DICOMSQLFilterModel, SLOT(setFilterWildcard(QString)));\n    QObject::connect(this->leSearchBox, SIGNAL(textChanged(QString)), q, SLOT(onFilterChanged()));\n    QObject::connect(this->DICOMDatabase.data(), SIGNAL(schemaUpdated()), q, SLOT(onDatabaseChanged()));\n    QObject::connect(this->DICOMDatabase.data(), SIGNAL(databaseChanged()), q, SLOT(onDatabaseChanged()));\n  }\n}\n\n\/\/Temporay solution to hide UID columns\nvoid ctkDICOMTableViewPrivate::hideUIDColumns()\n{\n  int numberOfColumns = this->tblDicomDatabaseView->horizontalHeader()->count();\n  QString columnName = \" \";\n  for (int i = 0; i < numberOfColumns; ++i)\n  {\n    columnName = this->tblDicomDatabaseView->model()->headerData(i, Qt::Horizontal).toString();\n    if (columnName.contains(\"UID\"))\n    {\n      this->tblDicomDatabaseView->hideColumn(i);\n    }\n  }\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ ctkDICOMTableView methods\n\n\/\/----------------------------------------------------------------------------\nctkDICOMTableView::ctkDICOMTableView(QWidget *parent, QString queryTableName)\n  :Superclass(parent)\n  , d_ptr(new ctkDICOMTableViewPrivate(*this))\n{\n  Q_D(ctkDICOMTableView);\n  d->queryTableName = queryTableName;\n  d->init();\n  d->lblTableName->setText(queryTableName);\n}\n\nctkDICOMTableView::ctkDICOMTableView(QSharedPointer<ctkDICOMDatabase> ctkDicomDataBase, QWidget *parent, QString queryTableName)\n  : Superclass(parent)\n  , d_ptr(new ctkDICOMTableViewPrivate(*this))\n{\n  this->setCTKDicomDataBase(ctkDicomDataBase);\n  Q_D(ctkDICOMTableView);\n  d->queryTableName = queryTableName;\n  d->init();\n  d->lblTableName->setText(queryTableName);\n}\n\nctkDICOMTableView::~ctkDICOMTableView()\n{\n}\n\nvoid ctkDICOMTableView::setCTKDicomDataBase(QSharedPointer<ctkDICOMDatabase> dicomDataBase)\n{\n  Q_D(ctkDICOMTableView);\n  d->DICOMDatabase = dicomDataBase;\n  d->setUpTableView();\n}\n\nvoid ctkDICOMTableView::setQueryTableName(const QString &tableName)\n{\n  Q_D(ctkDICOMTableView);\n  d->queryTableName = tableName;\n}\n\nvoid ctkDICOMTableView::setQueryForeignKey(const QString &foreignKey)\n{\n  Q_D(ctkDICOMTableView);\n  d->queryForeignKey = foreignKey;\n}\n\nvoid ctkDICOMTableView::setQueryPrimaryKey(const QString &primaryKey)\n{\n  Q_D(ctkDICOMTableView);\n  d->queryPrimaryKey = primaryKey;\n}\n\nvoid ctkDICOMTableView::onSelectionChanged()\n{\n  Q_D(ctkDICOMTableView);\n\n  QModelIndexList currentSelection = d->tblDicomDatabaseView->selectionModel()->selectedRows(0);\n  QStringList uids;\n  if (currentSelection.empty())\n  {\n    emit signalSelectionChanged(uids);\n  }\n  else\n  {\n    foreach(QModelIndex i, currentSelection)\n    {\n      uids << (QString(\"'\") + i.data().toString() +\"'\");\n    }\n    emit signalSelectionChanged(uids);\n  }\n}\n\nvoid ctkDICOMTableView::onDatabaseChanged()\n{\n  Q_D(ctkDICOMTableView);\n  QString query = \"select * from \" + d->queryTableName;\n  d->DICOMSQLModel.setQuery(query, d->DICOMDatabase->database());\n}\n\nvoid ctkDICOMTableView::onUpdateQuery(const QStringList& uids)\n{\n  Q_D(ctkDICOMTableView);\n  QString query;\n\n  if (uids.empty() || d->queryForeignKey.length() == 0)\n  {\n    query = \"select * from \" + d->queryTableName;\n  }\n  else\n  {\n    query = \"select * from \"+d->queryTableName+\" where \"+d->queryForeignKey+\" in ( \";\n    query.append(uids.join(\",\")).append(\");\");\n  }\n  d->DICOMSQLModel.setQuery(query, d->DICOMDatabase->database());\n  QStringList newUIDS = this->getUIDsForAllRows();\n  emit signalQueryChanged(newUIDS);\n}\n\nvoid ctkDICOMTableView::onFilterChanged()\n{\n  Q_D(ctkDICOMTableView);\n\n  QStringList uids = this->getUIDsForAllRows();\n  emit signalFilterChanged(uids);\n}\n\nQStringList ctkDICOMTableView::getUIDsForAllRows()\n{\n  Q_D(ctkDICOMTableView);\n  QAbstractItemModel* tableModel = d->tblDicomDatabaseView->model();\n  int numberOfRows = tableModel->rowCount();\n  QStringList uids;\n  if (numberOfRows == 0)\n  {\n    \/\/Return invalid UID if there are no rows\n    uids << QString(\"'#'\");\n  }\n  else\n  {\n    for(int i = 0; i < numberOfRows; ++i)\n    {\n      uids << (QString(\"'\") + tableModel->index(i,0).data().toString() +\"'\");\n    }\n  }\n  return uids;\n}\n\n<commit_msg>Changed signal parameters to const refs<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.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\/\/ ctkDICOMWidget includes\n#include \"ctkDICOMTableView.h\"\n#include \"ui_ctkDICOMTableView.h\"\n\n\/\/ Qt includes\n#include <QSqlQueryModel>\n#include <QSortFilterProxyModel>\n\nclass ctkDICOMTableViewPrivate : public Ui_ctkDICOMTableView\n{\n  Q_DECLARE_PUBLIC (ctkDICOMTableView)\n\nprotected:\n  ctkDICOMTableView* const q_ptr;\n\npublic:\n  ctkDICOMTableViewPrivate(ctkDICOMTableView& obj);\n  ctkDICOMTableViewPrivate(ctkDICOMTableView& obj, QSharedPointer<ctkDICOMDatabase> db);\n  ~ctkDICOMTableViewPrivate();\n  \/\/ Initialize UI\n  void init();\n  \/\/ Setup tableview with tablemodel if database is available\n  void setUpTableView();\n  \/\/Temporay solution to hide UID columns\n  void hideUIDColumns();\n\n  QSharedPointer<ctkDICOMDatabase> DICOMDatabase;\n  QSqlQueryModel DICOMSQLModel;\n  QSortFilterProxyModel* DICOMSQLFilterModel;\n  QString queryTableName;\n  QString queryForeignKey;\n  QString queryPrimaryKey;\n\n};\n\nctkDICOMTableViewPrivate::ctkDICOMTableViewPrivate(ctkDICOMTableView &obj)\n  : q_ptr(&obj)\n{\n  this->DICOMSQLFilterModel = new QSortFilterProxyModel();\n}\n\nctkDICOMTableViewPrivate::ctkDICOMTableViewPrivate(ctkDICOMTableView &obj, QSharedPointer<ctkDICOMDatabase> db)\n  : q_ptr(&obj)\n  , DICOMDatabase(db)\n{\n  this->DICOMSQLFilterModel = new QSortFilterProxyModel();\n}\n\nctkDICOMTableViewPrivate::~ctkDICOMTableViewPrivate()\n{\n  delete this->DICOMSQLFilterModel;\n}\n\nvoid ctkDICOMTableViewPrivate::init()\n{\n  Q_Q(ctkDICOMTableView);\n  this->setupUi(q);\n\n  this->tblDicomDatabaseView->setSelectionBehavior(QAbstractItemView::SelectRows);\n  this->tblDicomDatabaseView->setSelectionMode(QAbstractItemView::ExtendedSelection);\n  this->tblDicomDatabaseView->verticalHeader()->setHidden(true);\n  this->tblDicomDatabaseView->horizontalHeader()->setResizeMode(QHeaderView::ResizeToContents);\n  this->tblDicomDatabaseView->horizontalHeader()->setStretchLastSection(true);\n\n  if (this->DICOMDatabase)\n  {\n    this->setUpTableView();\n  }\n}\n\nvoid ctkDICOMTableViewPrivate::setUpTableView()\n{\n  Q_Q(ctkDICOMTableView);\n  if (this->DICOMDatabase)\n  {\n    QString query = \"select * from \"+this->queryTableName;\n    this->DICOMSQLModel.setQuery(query, this->DICOMDatabase->database());\n    this->DICOMSQLFilterModel->setSourceModel(&this->DICOMSQLModel);\n    this->DICOMSQLFilterModel->setFilterKeyColumn(-1);\n    this->DICOMSQLFilterModel->setFilterCaseSensitivity(Qt::CaseInsensitive);\n    this->tblDicomDatabaseView->setModel(this->DICOMSQLFilterModel);\n    this->tblDicomDatabaseView->setColumnHidden(0, true);\n    this->tblDicomDatabaseView->setSortingEnabled(true);\n    this->hideUIDColumns();\n\n    QObject::connect(this->tblDicomDatabaseView->selectionModel(), SIGNAL(selectionChanged(const QItemSelection&,const QItemSelection&)),\n                     q, SLOT(onSelectionChanged()));\n    QObject::connect(this->tblDicomDatabaseView->selectionModel(), SIGNAL(selectionChanged(const QItemSelection&,const QItemSelection&)),\n                     q, SIGNAL(signalSelectionChanged(const QItemSelection&,const QItemSelection&)));\n    QObject::connect(this->leSearchBox, SIGNAL(textChanged(QString)), this->DICOMSQLFilterModel, SLOT(setFilterWildcard(QString)));\n    QObject::connect(this->leSearchBox, SIGNAL(textChanged(QString)), q, SLOT(onFilterChanged()));\n    QObject::connect(this->DICOMDatabase.data(), SIGNAL(schemaUpdated()), q, SLOT(onDatabaseChanged()));\n    QObject::connect(this->DICOMDatabase.data(), SIGNAL(databaseChanged()), q, SLOT(onDatabaseChanged()));\n  }\n}\n\n\/\/Temporay solution to hide UID columns\nvoid ctkDICOMTableViewPrivate::hideUIDColumns()\n{\n  int numberOfColumns = this->tblDicomDatabaseView->horizontalHeader()->count();\n  QString columnName = \" \";\n  for (int i = 0; i < numberOfColumns; ++i)\n  {\n    columnName = this->tblDicomDatabaseView->model()->headerData(i, Qt::Horizontal).toString();\n    if (columnName.contains(\"UID\"))\n    {\n      this->tblDicomDatabaseView->hideColumn(i);\n    }\n  }\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ ctkDICOMTableView methods\n\n\/\/----------------------------------------------------------------------------\nctkDICOMTableView::ctkDICOMTableView(QWidget *parent, QString queryTableName)\n  :Superclass(parent)\n  , d_ptr(new ctkDICOMTableViewPrivate(*this))\n{\n  Q_D(ctkDICOMTableView);\n  d->queryTableName = queryTableName;\n  d->init();\n  d->lblTableName->setText(queryTableName);\n}\n\nctkDICOMTableView::ctkDICOMTableView(QSharedPointer<ctkDICOMDatabase> ctkDicomDataBase, QWidget *parent, QString queryTableName)\n  : Superclass(parent)\n  , d_ptr(new ctkDICOMTableViewPrivate(*this))\n{\n  this->setCTKDicomDataBase(ctkDicomDataBase);\n  Q_D(ctkDICOMTableView);\n  d->queryTableName = queryTableName;\n  d->init();\n  d->lblTableName->setText(queryTableName);\n}\n\nctkDICOMTableView::~ctkDICOMTableView()\n{\n}\n\nvoid ctkDICOMTableView::setCTKDicomDataBase(QSharedPointer<ctkDICOMDatabase> dicomDataBase)\n{\n  Q_D(ctkDICOMTableView);\n  d->DICOMDatabase = dicomDataBase;\n  d->setUpTableView();\n}\n\nvoid ctkDICOMTableView::setQueryTableName(const QString &tableName)\n{\n  Q_D(ctkDICOMTableView);\n  d->queryTableName = tableName;\n}\n\nvoid ctkDICOMTableView::setQueryForeignKey(const QString &foreignKey)\n{\n  Q_D(ctkDICOMTableView);\n  d->queryForeignKey = foreignKey;\n}\n\nvoid ctkDICOMTableView::setQueryPrimaryKey(const QString &primaryKey)\n{\n  Q_D(ctkDICOMTableView);\n  d->queryPrimaryKey = primaryKey;\n}\n\nvoid ctkDICOMTableView::onSelectionChanged()\n{\n  Q_D(ctkDICOMTableView);\n\n  QModelIndexList currentSelection = d->tblDicomDatabaseView->selectionModel()->selectedRows(0);\n  QStringList uids;\n  if (currentSelection.empty())\n  {\n    emit signalSelectionChanged(uids);\n  }\n  else\n  {\n    foreach(QModelIndex i, currentSelection)\n    {\n      uids << (QString(\"'\") + i.data().toString() +\"'\");\n    }\n    emit signalSelectionChanged(uids);\n  }\n}\n\nvoid ctkDICOMTableView::onDatabaseChanged()\n{\n  Q_D(ctkDICOMTableView);\n  QString query = \"select * from \" + d->queryTableName;\n  d->DICOMSQLModel.setQuery(query, d->DICOMDatabase->database());\n}\n\nvoid ctkDICOMTableView::onUpdateQuery(const QStringList& uids)\n{\n  Q_D(ctkDICOMTableView);\n  QString query;\n\n  if (uids.empty() || d->queryForeignKey.length() == 0)\n  {\n    query = \"select * from \" + d->queryTableName;\n  }\n  else\n  {\n    query = \"select * from \"+d->queryTableName+\" where \"+d->queryForeignKey+\" in ( \";\n    query.append(uids.join(\",\")).append(\");\");\n  }\n  d->DICOMSQLModel.setQuery(query, d->DICOMDatabase->database());\n  QStringList newUIDS = this->getUIDsForAllRows();\n  emit signalQueryChanged(newUIDS);\n}\n\nvoid ctkDICOMTableView::onFilterChanged()\n{\n  Q_D(ctkDICOMTableView);\n\n  QStringList uids = this->getUIDsForAllRows();\n  emit signalFilterChanged(uids);\n}\n\nQStringList ctkDICOMTableView::getUIDsForAllRows()\n{\n  Q_D(ctkDICOMTableView);\n  QAbstractItemModel* tableModel = d->tblDicomDatabaseView->model();\n  int numberOfRows = tableModel->rowCount();\n  QStringList uids;\n  if (numberOfRows == 0)\n  {\n    \/\/Return invalid UID if there are no rows\n    uids << QString(\"'#'\");\n  }\n  else\n  {\n    for(int i = 0; i < numberOfRows; ++i)\n    {\n      uids << (QString(\"'\") + tableModel->index(i,0).data().toString() +\"'\");\n    }\n  }\n  return uids;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*===================================================================\n\n The Medical Imaging Interaction Toolkit (MITK)\n\n Copyright (c) German Cancer Research Center,\n Division of Medical and Biological Informatics.\n All rights reserved.\n\n This software is distributed WITHOUT ANY WARRANTY; without\n even the implied warranty of MERCHANTABILITY or FITNESS FOR\n A PARTICULAR PURPOSE.\n\n See LICENSE.txt or http:\/\/www.mitk.org for details.\n\n ===================================================================*\/\n\n#include \"mitkStandaloneDataStorage.h\"\n#include \"mitkDataNode.h\"\n#include \"mitkDataInteractor.h\"\n#include \"mitkVtkPropRenderer.h\"\n#include \"mitkBaseRenderer.h\"\n#include \"mitkTestingMacros.h\"\n#include \"itkLightObject.h\"\n#include \"mitkDispatcher.h\"\n\nint mitkDispatcherTest(int \/*argc*\/, char* \/*argv*\/[])\n{\n  MITK_TEST_BEGIN(\"Dispatcher\")\n\n  \/*\n   * Tests the process of creating Interactors and assigning DataNodes to them.\n   * Test checks if these Interactors are added to the Dispatcher under different conditions,\n   * and in different call order.\n   *\/\n\n  \/\/ Here BindDispatcherInteractor and Dispatcher should be created automatically\n  vtkRenderWindow* renWin = vtkRenderWindow::New();\n  mitk::VtkPropRenderer::Pointer renderer = mitk::VtkPropRenderer::New( \"ContourRenderer\",renWin, mitk::RenderingManager::GetInstance() );\n\n  mitk::StandaloneDataStorage::Pointer ds = mitk::StandaloneDataStorage::New();\n  mitk::DataNode::Pointer dn = mitk::DataNode::New();\n  mitk::DataNode::Pointer dn2 = mitk::DataNode::New();\n  mitk::DataInteractor::Pointer ei = mitk::DataInteractor::New();\n  mitk::DataInteractor::Pointer ei2 = mitk::DataInteractor::New();\n\n\n  MITK_TEST_CONDITION_REQUIRED(\n      renderer->GetDispatcher()->GetNumberOfInteractors() == 0\n      , \"01 Check Existence of Dispatcher.\" );\n\n  ei->SetDataNode(dn);\n  renderer->SetDataStorage(ds);\n  ds->Add(dn);\n\n  int num = renderer->GetDispatcher()->GetNumberOfInteractors();\n  MITK_TEST_CONDITION_REQUIRED(\n      num == 1\n      , \"02 Number of registered Interactors \" << num << \" , expected 1\" );\n\n  \/\/ This _must not_ result in additionally registered interactors.\n  ei->SetDataNode(dn);\n  ei->SetDataNode(dn);\n\n  num = renderer->GetDispatcher()->GetNumberOfInteractors();\n  MITK_TEST_CONDITION_REQUIRED(\n      num == 1\n      , \"03 Number of registered Interactors \" << num << \" , expected 1\" );\n\n  \/\/ Switching the DataNode of an Interactor also must not result in extra registered Interactors in Dispatcher\n  \/\/ since dn2 is not connected to DataStorage\n  \/\/ ei will be dropped from dispatcher\n  ei->SetDataNode(dn2);\n\n  num = renderer->GetDispatcher()->GetNumberOfInteractors();\n  MITK_TEST_CONDITION_REQUIRED(\n      num == 0\n      , \"04 Number of registered Interactors \" << num << \" , expected 0\" );\n\n  \/\/ DataNode Added to DataStorage, now Interactor entry in Dispatcher should be replaced,\n  \/\/ hence we restore Interactor in the Dispatcher\n  ds->Add(dn2);\n\n  num = renderer->GetDispatcher()->GetNumberOfInteractors();\n  MITK_TEST_CONDITION_REQUIRED(\n      num == 1\n      , \"05 Number of registered Interactors \" << num << \" , expected 1\" );\n\n  \/\/ New DataNode and new interactor, this should result in additional Interactor in the Dispatcher.\n\n  ei2->SetDataNode(dn);\n\n  num = renderer->GetDispatcher()->GetNumberOfInteractors();\n  MITK_TEST_CONDITION_REQUIRED(\n      num == 2\n      , \"06 Number of registered Interactors \" << num << \" , expected 2\" );\n\n  \/\/ Here ei and ei2 point to the same dn2; dn2 now only points to ei2, so ei is abandoned,\n  \/\/ therefore ei1 is expected to be removed\n\n  ei2->SetDataNode(dn2);\n  num = renderer->GetDispatcher()->GetNumberOfInteractors();\n  MITK_TEST_CONDITION_REQUIRED(\n      num == 1\n      , \"07 Number of registered Interactors \" << num << \" , expected 1\" );\n\n  \/\/ Setting DataNode in Interactor to NULL, should remove Interactor from Dispatcher\n  ei2->SetDataNode(NULL);\n  num = renderer->GetDispatcher()->GetNumberOfInteractors();\n  MITK_TEST_CONDITION_REQUIRED(\n      num == 0\n      , \"08 Number of registered Interactors \" << num << \" , expected 0\" );\n\n  renWin->Delete();\n  \/\/ always end with this!\n  MITK_TEST_END()\n\n}\n<commit_msg>extent test to check reference counts of Interactors and DataNodes<commit_after>\/*===================================================================\n\n The Medical Imaging Interaction Toolkit (MITK)\n\n Copyright (c) German Cancer Research Center,\n Division of Medical and Biological Informatics.\n All rights reserved.\n\n This software is distributed WITHOUT ANY WARRANTY; without\n even the implied warranty of MERCHANTABILITY or FITNESS FOR\n A PARTICULAR PURPOSE.\n\n See LICENSE.txt or http:\/\/www.mitk.org for details.\n\n ===================================================================*\/\n\n#include \"mitkStandaloneDataStorage.h\"\n#include \"mitkDataNode.h\"\n#include \"mitkDataInteractor.h\"\n#include \"mitkVtkPropRenderer.h\"\n#include \"mitkBaseRenderer.h\"\n#include \"mitkTestingMacros.h\"\n#include \"itkLightObject.h\"\n#include \"mitkDispatcher.h\"\n\nint mitkDispatcherTest(int \/*argc*\/, char* \/*argv*\/[])\n{\n  MITK_TEST_BEGIN(\"Dispatcher\")\n\n  \/*\n   * Tests the process of creating Interactors and assigning DataNodes to them.\n   * Test checks if these Interactors are added to the Dispatcher under different conditions,\n   * and in different call order.\n   *\/\n\n      \/\/ Here BindDispatcherInteractor and Dispatcher should be created automatically\n      vtkRenderWindow* renWin = vtkRenderWindow::New();\n  mitk::VtkPropRenderer::Pointer renderer = mitk::VtkPropRenderer::New( \"ContourRenderer\",renWin, mitk::RenderingManager::GetInstance() );\n\n  mitk::StandaloneDataStorage::Pointer ds = mitk::StandaloneDataStorage::New();\n  mitk::DataNode::Pointer dn;\n\n  dn = mitk::DataNode::New();\n  mitk::DataNode::Pointer dn2 = mitk::DataNode::New();\n  mitk::DataInteractor::Pointer ei = mitk::DataInteractor::New();\n  mitk::DataInteractor::Pointer ei2 = mitk::DataInteractor::New();\n\n\n  MITK_TEST_CONDITION_REQUIRED(\n        renderer->GetDispatcher()->GetNumberOfInteractors() == 0\n        , \"01 Check Existence of Dispatcher.\" );\n\n  ei->SetDataNode(dn);\n  renderer->SetDataStorage(ds);\n  ds->Add(dn);\n\n  int num = renderer->GetDispatcher()->GetNumberOfInteractors();\n  MITK_TEST_CONDITION_REQUIRED(\n        num == 1\n        , \"02 Number of registered Interactors \" << num << \" , expected 1\" );\n\n  \/\/ This _must not_ result in additionally registered interactors.\n  ei->SetDataNode(dn);\n  ei->SetDataNode(dn);\n\n  num = renderer->GetDispatcher()->GetNumberOfInteractors();\n  MITK_TEST_CONDITION_REQUIRED(\n        num == 1\n        , \"03 Number of registered Interactors \" << num << \" , expected 1\" );\n\n  \/\/ Switching the DataNode of an Interactor also must not result in extra registered Interactors in Dispatcher\n  \/\/ since dn2 is not connected to DataStorage\n  \/\/ ei will be dropped from dispatcher\n  ei->SetDataNode(dn2);\n\n  num = renderer->GetDispatcher()->GetNumberOfInteractors();\n  MITK_TEST_CONDITION_REQUIRED(\n        num == 0\n        , \"04 Number of registered Interactors \" << num << \" , expected 0\" );\n\n  \/\/ DataNode Added to DataStorage, now Interactor entry in Dispatcher should be replaced,\n  \/\/ hence we restore Interactor in the Dispatcher\n  ds->Add(dn2);\n\n  num = renderer->GetDispatcher()->GetNumberOfInteractors();\n  MITK_TEST_CONDITION_REQUIRED(\n        num == 1\n        , \"05 Number of registered Interactors \" << num << \" , expected 1\" );\n\n  \/\/ New DataNode and new interactor, this should result in additional Interactor in the Dispatcher.\n\n  ei2->SetDataNode(dn);\n\n  num = renderer->GetDispatcher()->GetNumberOfInteractors();\n  MITK_TEST_CONDITION_REQUIRED(\n        num == 2\n        , \"06 Number of registered Interactors \" << num << \" , expected 2\" );\n\n  \/\/ Here ei and ei2 point to the same dn2; dn2 now only points to ei2, so ei is abandoned,\n  \/\/ therefore ei1 is expected to be removed\n\n  ei2->SetDataNode(dn2);\n  num = renderer->GetDispatcher()->GetNumberOfInteractors();\n  MITK_TEST_CONDITION_REQUIRED(\n        num == 1\n        , \"07 Number of registered Interactors \" << num << \" , expected 1\" );\n\n  \/\/ Setting DataNode in Interactor to NULL, should remove Interactor from Dispatcher\n  ei2->SetDataNode(NULL);\n  num = renderer->GetDispatcher()->GetNumberOfInteractors();\n  MITK_TEST_CONDITION_REQUIRED(\n        num == 0\n        , \"08 Number of registered Interactors \" << num << \" , expected 0\" );\n\n\n  \/\/ Add DN again check if it is registered\n\n  ei2->SetDataNode(dn);\n\n  num = renderer->GetDispatcher()->GetNumberOfInteractors();\n  MITK_TEST_CONDITION_REQUIRED(\n        num == 1\n        , \"09 Number of registered Interactors \" << num << \" , expected 1\" );\n\n\n  \/\/ If DN is removed Interactors should be too\n  ds->Remove(dn);\n  num = renderer->GetDispatcher()->GetNumberOfInteractors();\n  MITK_TEST_CONDITION_REQUIRED(\n        num == 0\n        , \"10 Number of registered Interactors \" << num << \" , expected 0\" );\n\n\n  \/\/ after DN is removed from DS its reference count must be back to one\n\n  MITK_TEST_CONDITION_REQUIRED(\n        dn->GetReferenceCount() == 1\n        , \"10 Number of references of DataNode \" << num << \" , expected 1\" );\n\n\n  MITK_TEST_CONDITION_REQUIRED(\n        ei->GetReferenceCount() == 1\n        , \"11 Number of references of Interactors \" << num << \" , expected 1\" );\n\n  renWin->Delete();\n  \/\/ always end with this!\n  MITK_TEST_END()\n\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\/\/#define _USE_MATH_DEFINES\n#include <QmitkServiceListWidget.h>\n\n\/\/ STL HEaders\n#include <list>\n\n\/\/QT headers\n#include <QColor>\n\n\/\/microservices\n#include <usGetModuleContext.h>\n#include <mitkModuleContext.h>\n#include <usServiceProperties.h>\n\n#include <mitkCommon.h>\n\n\nconst std::string QmitkServiceListWidget::VIEW_ID = \"org.mitk.views.QmitkServiceListWidget\";\n\nQmitkServiceListWidget::QmitkServiceListWidget(QWidget* parent, Qt::WindowFlags f): QWidget(parent, f)\n{\n  m_Controls = NULL;\n  CreateQtPartControl(this);\n}\n\nQmitkServiceListWidget::~QmitkServiceListWidget()\n{\n  m_Context->RemoveServiceListener(this,  &QmitkServiceListWidget::OnServiceEvent);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ INITIALIZATION \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid QmitkServiceListWidget::CreateQtPartControl(QWidget *parent)\n{\n  if (!m_Controls)\n  {\n    \/\/ create GUI widgets\n    m_Controls = new Ui::QmitkServiceListWidgetControls;\n    m_Controls->setupUi(parent);\n    this->CreateConnections();\n  }\n  m_Context = mitk::GetModuleContext();\n}\n\nvoid QmitkServiceListWidget::CreateConnections()\n{\n  if ( m_Controls )\n  {\n    connect( m_Controls->m_ServiceList, SIGNAL(currentItemChanged( QListWidgetItem *, QListWidgetItem *)), this, SLOT(OnServiceSelectionChanged()) );\n  }\n}\n\nvoid QmitkServiceListWidget::InitPrivate(const std::string& namingProperty, const std::string& filter)\n{\n  if (filter.empty())\n    m_Filter = \"(\" + mitk::ServiceConstants::OBJECTCLASS() + \"=\" + m_Interface + \")\";\n  else\n    m_Filter = filter;\n  m_NamingProperty = namingProperty;\n  m_Context->RemoveServiceListener(this,  &QmitkServiceListWidget::OnServiceEvent);\n  m_Context->AddServiceListener(this, &QmitkServiceListWidget::OnServiceEvent, m_Filter);\n    \/\/ Empty ListWidget\n  this->m_ListContent.clear();\n  m_Controls->m_ServiceList->clear();\n\n  \/\/ get Services\n  std::list<mitk::ServiceReference> services = this->GetAllRegisteredServices();\n  \/\/ Transfer them to the List\n  for(std::list<mitk::ServiceReference>::iterator it = services.begin(); it != services.end(); ++it)\n    AddServiceToList(*it);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/ Methods & Slots Handling Direct Interaction \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nbool QmitkServiceListWidget::GetIsServiceSelected(){\n  return (this->m_Controls->m_ServiceList->currentItem() != 0);\n}\n\nvoid QmitkServiceListWidget::OnServiceSelectionChanged(){\n  mitk::ServiceReference ref = this->GetServiceForListItem(this->m_Controls->m_ServiceList->currentItem());\n  if (! ref){\n    emit (ServiceSelectionChanged(mitk::ServiceReference()));\n    return;\n  }\n\n  emit (ServiceSelectionChanged(ref));\n}\n\nmitk::ServiceReference QmitkServiceListWidget::GetSelectedService(){\n  return this->GetServiceForListItem(this->m_Controls->m_ServiceList->currentItem());\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ Methods & Slots Handling Logic \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid QmitkServiceListWidget::OnServiceEvent(const mitk::ServiceEvent event){\n\n  switch (event.GetType())\n  {\n    case mitk::ServiceEvent::MODIFIED:\n      emit(ServiceModified(event.GetServiceReference()));\n      RemoveServiceFromList(event.GetServiceReference());\n      AddServiceToList(event.GetServiceReference());\n      break;\n    case mitk::ServiceEvent::REGISTERED:\n      emit(ServiceRegistered(event.GetServiceReference()));\n      AddServiceToList(event.GetServiceReference());\n      break;\n    case mitk::ServiceEvent::UNREGISTERING:\n      emit(ServiceUnregistering(event.GetServiceReference()));\n      RemoveServiceFromList(event.GetServiceReference());\n      break;\n    case mitk::ServiceEvent::MODIFIED_ENDMATCH:\n      emit(ServiceModifiedEndMatch(event.GetServiceReference()));\n      RemoveServiceFromList(event.GetServiceReference());\n      break;\n  }\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ HOUSEHOLDING CODE \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nQListWidgetItem* QmitkServiceListWidget::AddServiceToList(mitk::ServiceReference serviceRef){\n  QListWidgetItem *newItem = new QListWidgetItem;\n  std::string caption;\n  \/\/TODO allow more complex formatting\n  if (m_NamingProperty.empty())\n    caption = m_Interface;\n  else \n  {\n    mitk::Any prop = serviceRef.GetProperty(m_NamingProperty);\n    if (prop.Empty())\n    {\n      MITK_WARN << \"QmitkServiceListWidget tried to resolve property '\" + m_NamingProperty + \"' but failed. Resorting to interface name for display.\";\n      caption = m_Interface;\n    }\n    else\n      caption = prop.ToString();\n  }\n\n  newItem->setText(caption.c_str());\n\n  \/\/ Add new item to QListWidget\n  m_Controls->m_ServiceList->addItem(newItem);\n  \/\/ Construct link and add to internal List for reference\n  QmitkServiceListWidget::ServiceListLink link;\n  link.service = serviceRef;\n  link.item = newItem;\n  m_ListContent.push_back(link);\n  return newItem;\n}\n\nbool QmitkServiceListWidget::RemoveServiceFromList(mitk::ServiceReference serviceRef){\n  for(std::vector<QmitkServiceListWidget::ServiceListLink>::iterator it = m_ListContent.begin(); it != m_ListContent.end(); ++it){\n    if ( serviceRef == it->service )\n    {\n      int row = m_Controls->m_ServiceList->row(it->item);\n      QListWidgetItem* oldItem = m_Controls->m_ServiceList->takeItem(row);\n      delete oldItem;\n      this->m_ListContent.erase(it);\n      return true;\n    }\n  }\n  return false;\n}\n\n\nmitk::ServiceReference QmitkServiceListWidget::GetServiceForListItem(QListWidgetItem* item)\n{\n  for(std::vector<QmitkServiceListWidget::ServiceListLink>::iterator it = m_ListContent.begin(); it != m_ListContent.end(); ++it)\n    if (item == it->item) return it->service;\n  \/\/ Return invalid ServiceReference (will evaluate to false in bool expressions)\n  return mitk::ServiceReference();\n}\n\n\nstd::list<mitk::ServiceReference> QmitkServiceListWidget::GetAllRegisteredServices(){\n  \/\/Get Service References\n  return m_Context->GetServiceReferences(m_Interface, m_Filter);\n}<commit_msg>ServiceListWidget now sorts it's entries<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 <QmitkServiceListWidget.h>\n\n\/\/ STL HEaders\n#include <list>\n\n\/\/QT headers\n#include <QColor>\n\n\/\/microservices\n#include <usGetModuleContext.h>\n#include <mitkModuleContext.h>\n#include <usServiceProperties.h>\n\n#include <mitkCommon.h>\n\n\nconst std::string QmitkServiceListWidget::VIEW_ID = \"org.mitk.views.QmitkServiceListWidget\";\n\nQmitkServiceListWidget::QmitkServiceListWidget(QWidget* parent, Qt::WindowFlags f): QWidget(parent, f)\n{\n  m_Controls = NULL;\n  CreateQtPartControl(this);\n}\n\nQmitkServiceListWidget::~QmitkServiceListWidget()\n{\n  m_Context->RemoveServiceListener(this,  &QmitkServiceListWidget::OnServiceEvent);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ INITIALIZATION \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid QmitkServiceListWidget::CreateQtPartControl(QWidget *parent)\n{\n  if (!m_Controls)\n  {\n    \/\/ create GUI widgets\n    m_Controls = new Ui::QmitkServiceListWidgetControls;\n    m_Controls->setupUi(parent);\n    this->CreateConnections();\n  }\n  m_Context = mitk::GetModuleContext();\n}\n\nvoid QmitkServiceListWidget::CreateConnections()\n{\n  if ( m_Controls )\n  {\n    connect( m_Controls->m_ServiceList, SIGNAL(currentItemChanged( QListWidgetItem *, QListWidgetItem *)), this, SLOT(OnServiceSelectionChanged()) );\n  }\n}\n\nvoid QmitkServiceListWidget::InitPrivate(const std::string& namingProperty, const std::string& filter)\n{\n  if (filter.empty())\n    m_Filter = \"(\" + mitk::ServiceConstants::OBJECTCLASS() + \"=\" + m_Interface + \")\";\n  else\n    m_Filter = filter;\n  m_NamingProperty = namingProperty;\n  m_Context->RemoveServiceListener(this,  &QmitkServiceListWidget::OnServiceEvent);\n  m_Context->AddServiceListener(this, &QmitkServiceListWidget::OnServiceEvent, m_Filter);\n    \/\/ Empty ListWidget\n  this->m_ListContent.clear();\n  m_Controls->m_ServiceList->clear();\n\n  \/\/ get Services\n  std::list<mitk::ServiceReference> services = this->GetAllRegisteredServices();\n  \/\/ Transfer them to the List\n  for(std::list<mitk::ServiceReference>::iterator it = services.begin(); it != services.end(); ++it)\n    AddServiceToList(*it);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/ Methods & Slots Handling Direct Interaction \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nbool QmitkServiceListWidget::GetIsServiceSelected(){\n  return (this->m_Controls->m_ServiceList->currentItem() != 0);\n}\n\nvoid QmitkServiceListWidget::OnServiceSelectionChanged(){\n  mitk::ServiceReference ref = this->GetServiceForListItem(this->m_Controls->m_ServiceList->currentItem());\n  if (! ref){\n    emit (ServiceSelectionChanged(mitk::ServiceReference()));\n    return;\n  }\n\n  emit (ServiceSelectionChanged(ref));\n}\n\nmitk::ServiceReference QmitkServiceListWidget::GetSelectedService(){\n  return this->GetServiceForListItem(this->m_Controls->m_ServiceList->currentItem());\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ Methods & Slots Handling Logic \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid QmitkServiceListWidget::OnServiceEvent(const mitk::ServiceEvent event){\n\n  switch (event.GetType())\n  {\n    case mitk::ServiceEvent::MODIFIED:\n      emit(ServiceModified(event.GetServiceReference()));\n      RemoveServiceFromList(event.GetServiceReference());\n      AddServiceToList(event.GetServiceReference());\n      break;\n    case mitk::ServiceEvent::REGISTERED:\n      emit(ServiceRegistered(event.GetServiceReference()));\n      AddServiceToList(event.GetServiceReference());\n      break;\n    case mitk::ServiceEvent::UNREGISTERING:\n      emit(ServiceUnregistering(event.GetServiceReference()));\n      RemoveServiceFromList(event.GetServiceReference());\n      break;\n    case mitk::ServiceEvent::MODIFIED_ENDMATCH:\n      emit(ServiceModifiedEndMatch(event.GetServiceReference()));\n      RemoveServiceFromList(event.GetServiceReference());\n      break;\n  }\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ HOUSEHOLDING CODE \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nQListWidgetItem* QmitkServiceListWidget::AddServiceToList(mitk::ServiceReference serviceRef){\n  QListWidgetItem *newItem = new QListWidgetItem;\n  std::string caption;\n  \/\/TODO allow more complex formatting\n  if (m_NamingProperty.empty())\n    caption = m_Interface;\n  else \n  {\n    mitk::Any prop = serviceRef.GetProperty(m_NamingProperty);\n    if (prop.Empty())\n    {\n      MITK_WARN << \"QmitkServiceListWidget tried to resolve property '\" + m_NamingProperty + \"' but failed. Resorting to interface name for display.\";\n      caption = m_Interface;\n    }\n    else\n      caption = prop.ToString();\n  }\n\n  newItem->setText(caption.c_str());\n\n  \/\/ Add new item to QListWidget\n  m_Controls->m_ServiceList->addItem(newItem);\n  m_Controls->m_ServiceList->sortItems();\n  \/\/ Construct link and add to internal List for reference\n  QmitkServiceListWidget::ServiceListLink link;\n  link.service = serviceRef;\n  link.item = newItem;\n  m_ListContent.push_back(link);\n  return newItem;\n}\n\nbool QmitkServiceListWidget::RemoveServiceFromList(mitk::ServiceReference serviceRef){\n  for(std::vector<QmitkServiceListWidget::ServiceListLink>::iterator it = m_ListContent.begin(); it != m_ListContent.end(); ++it){\n    if ( serviceRef == it->service )\n    {\n      int row = m_Controls->m_ServiceList->row(it->item);\n      QListWidgetItem* oldItem = m_Controls->m_ServiceList->takeItem(row);\n      delete oldItem;\n      this->m_ListContent.erase(it);\n      return true;\n    }\n  }\n  return false;\n}\n\n\nmitk::ServiceReference QmitkServiceListWidget::GetServiceForListItem(QListWidgetItem* item)\n{\n  for(std::vector<QmitkServiceListWidget::ServiceListLink>::iterator it = m_ListContent.begin(); it != m_ListContent.end(); ++it)\n    if (item == it->item) return it->service;\n  \/\/ Return invalid ServiceReference (will evaluate to false in bool expressions)\n  return mitk::ServiceReference();\n}\n\n\nstd::list<mitk::ServiceReference> QmitkServiceListWidget::GetAllRegisteredServices(){\n  \/\/Get Service References\n  return m_Context->GetServiceReferences(m_Interface, m_Filter);\n}<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2013 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\/common\/native_mate_converters\/v8_value_converter.h\"\n\n#include <map>\n#include <string>\n#include <utility>\n\n#include \"base\/logging.h\"\n#include \"base\/memory\/scoped_ptr.h\"\n#include \"base\/values.h\"\n#include \"native_mate\/dictionary.h\"\n#include \"vendor\/node\/src\/node_buffer.h\"\n\nnamespace atom {\n\nnamespace {\n\nconst int kMaxRecursionDepth = 100;\n\n}  \/\/ namespace\n\n\/\/ The state of a call to FromV8Value.\nclass V8ValueConverter::FromV8ValueState {\n public:\n  \/\/ Level scope which updates the current depth of some FromV8ValueState.\n  class Level {\n   public:\n    explicit Level(FromV8ValueState* state) : state_(state) {\n      state_->max_recursion_depth_--;\n    }\n    ~Level() {\n      state_->max_recursion_depth_++;\n    }\n\n   private:\n    FromV8ValueState* state_;\n  };\n\n  FromV8ValueState() : max_recursion_depth_(kMaxRecursionDepth) {}\n\n  \/\/ If |handle| is not in |unique_map_|, then add it to |unique_map_| and\n  \/\/ return true.\n  \/\/\n  \/\/ Otherwise do nothing and return false. Here \"A is unique\" means that no\n  \/\/ other handle B in the map points to the same object as A. Note that A can\n  \/\/ be unique even if there already is another handle with the same identity\n  \/\/ hash (key) in the map, because two objects can have the same hash.\n  bool UpdateAndCheckUniqueness(v8::Local<v8::Object> handle) {\n    typedef HashToHandleMap::const_iterator Iterator;\n    int hash = handle->GetIdentityHash();\n    \/\/ We only compare using == with handles to objects with the same identity\n    \/\/ hash. Different hash obviously means different objects, but two objects\n    \/\/ in a couple of thousands could have the same identity hash.\n    std::pair<Iterator, Iterator> range = unique_map_.equal_range(hash);\n    for (Iterator it = range.first; it != range.second; ++it) {\n      \/\/ Operator == for handles actually compares the underlying objects.\n      if (it->second == handle)\n        return false;\n    }\n    unique_map_.insert(std::make_pair(hash, handle));\n    return true;\n  }\n\n  bool HasReachedMaxRecursionDepth() {\n    return max_recursion_depth_ < 0;\n  }\n\n private:\n  typedef std::multimap<int, v8::Local<v8::Object> > HashToHandleMap;\n  HashToHandleMap unique_map_;\n\n  int max_recursion_depth_;\n};\n\nV8ValueConverter::V8ValueConverter()\n    : reg_exp_allowed_(false),\n      function_allowed_(false),\n      strip_null_from_objects_(false) {}\n\nvoid V8ValueConverter::SetRegExpAllowed(bool val) {\n  reg_exp_allowed_ = val;\n}\n\nvoid V8ValueConverter::SetFunctionAllowed(bool val) {\n  function_allowed_ = val;\n}\n\nvoid V8ValueConverter::SetStripNullFromObjects(bool val) {\n  strip_null_from_objects_ = val;\n}\n\nv8::Local<v8::Value> V8ValueConverter::ToV8Value(\n    const base::Value* value, v8::Local<v8::Context> context) const {\n  v8::Context::Scope context_scope(context);\n  v8::EscapableHandleScope handle_scope(context->GetIsolate());\n  return handle_scope.Escape(ToV8ValueImpl(context->GetIsolate(), value));\n}\n\nbase::Value* V8ValueConverter::FromV8Value(\n    v8::Local<v8::Value> val,\n    v8::Local<v8::Context> context) const {\n  v8::Context::Scope context_scope(context);\n  v8::HandleScope handle_scope(context->GetIsolate());\n  FromV8ValueState state;\n  return FromV8ValueImpl(&state, val, context->GetIsolate());\n}\n\nv8::Local<v8::Value> V8ValueConverter::ToV8ValueImpl(\n     v8::Isolate* isolate, const base::Value* value) const {\n  CHECK(value);\n  switch (value->GetType()) {\n    case base::Value::TYPE_NULL:\n      return v8::Null(isolate);\n\n    case base::Value::TYPE_BOOLEAN: {\n      bool val = false;\n      CHECK(value->GetAsBoolean(&val));\n      return v8::Boolean::New(isolate, val);\n    }\n\n    case base::Value::TYPE_INTEGER: {\n      int val = 0;\n      CHECK(value->GetAsInteger(&val));\n      return v8::Integer::New(isolate, val);\n    }\n\n    case base::Value::TYPE_DOUBLE: {\n      double val = 0.0;\n      CHECK(value->GetAsDouble(&val));\n      return v8::Number::New(isolate, val);\n    }\n\n    case base::Value::TYPE_STRING: {\n      std::string val;\n      CHECK(value->GetAsString(&val));\n      return v8::String::NewFromUtf8(\n          isolate, val.c_str(), v8::String::kNormalString, val.length());\n    }\n\n    case base::Value::TYPE_LIST:\n      return ToV8Array(isolate, static_cast<const base::ListValue*>(value));\n\n    case base::Value::TYPE_DICTIONARY:\n      return ToV8Object(isolate,\n                        static_cast<const base::DictionaryValue*>(value));\n\n    case base::Value::TYPE_BINARY:\n      return ToArrayBuffer(isolate,\n                           static_cast<const base::BinaryValue*>(value));\n\n    default:\n      LOG(ERROR) << \"Unexpected value type: \" << value->GetType();\n      return v8::Null(isolate);\n  }\n}\n\nv8::Local<v8::Value> V8ValueConverter::ToV8Array(\n    v8::Isolate* isolate, const base::ListValue* val) const {\n  v8::Local<v8::Array> result(v8::Array::New(isolate, val->GetSize()));\n\n  for (size_t i = 0; i < val->GetSize(); ++i) {\n    const base::Value* child = NULL;\n    CHECK(val->Get(i, &child));\n\n    v8::Local<v8::Value> child_v8 = ToV8ValueImpl(isolate, child);\n    CHECK(!child_v8.IsEmpty());\n\n    v8::TryCatch try_catch;\n    result->Set(static_cast<uint32>(i), child_v8);\n    if (try_catch.HasCaught())\n      LOG(ERROR) << \"Setter for index \" << i << \" threw an exception.\";\n  }\n\n  return result;\n}\n\nv8::Local<v8::Value> V8ValueConverter::ToV8Object(\n    v8::Isolate* isolate, const base::DictionaryValue* val) const {\n  mate::Dictionary result = mate::Dictionary::CreateEmpty(isolate);\n  result.SetHidden(\"simple\", true);\n\n  for (base::DictionaryValue::Iterator iter(*val);\n       !iter.IsAtEnd(); iter.Advance()) {\n    const std::string& key = iter.key();\n    v8::Local<v8::Value> child_v8 = ToV8ValueImpl(isolate, &iter.value());\n    CHECK(!child_v8.IsEmpty());\n\n    v8::TryCatch try_catch;\n    result.Set(key, child_v8);\n    if (try_catch.HasCaught()) {\n      LOG(ERROR) << \"Setter for property \" << key.c_str() << \" threw an \"\n                 << \"exception.\";\n    }\n  }\n\n  return result.GetHandle();\n}\n\nv8::Local<v8::Value> V8ValueConverter::ToArrayBuffer(\n    v8::Isolate* isolate, const base::BinaryValue* value) const {\n  return node::Buffer::Copy(isolate,\n                            value->GetBuffer(),\n                            value->GetSize()).ToLocalChecked();\n}\n\nbase::Value* V8ValueConverter::FromV8ValueImpl(\n    FromV8ValueState* state,\n    v8::Local<v8::Value> val,\n    v8::Isolate* isolate) const {\n  CHECK(!val.IsEmpty());\n\n  FromV8ValueState::Level state_level(state);\n  if (state->HasReachedMaxRecursionDepth())\n    return NULL;\n\n  if (val->IsNull())\n    return base::Value::CreateNullValue().release();\n\n  if (val->IsBoolean())\n    return new base::FundamentalValue(val->ToBoolean()->Value());\n\n  if (val->IsInt32())\n    return new base::FundamentalValue(val->ToInt32()->Value());\n\n  if (val->IsNumber())\n    return new base::FundamentalValue(val->ToNumber()->Value());\n\n  if (val->IsString()) {\n    v8::String::Utf8Value utf8(val->ToString());\n    return new base::StringValue(std::string(*utf8, utf8.length()));\n  }\n\n  if (val->IsUndefined())\n    \/\/ JSON.stringify ignores undefined.\n    return NULL;\n\n  if (val->IsDate()) {\n    v8::Date* date = v8::Date::Cast(*val);\n    v8::Local<v8::Value> toISOString =\n        date->GetRealNamedPropertyInPrototypeChain(\n            v8::String::NewFromUtf8(isolate, \"toISOString\"));\n    if (toISOString->IsFunction()) {\n      v8::Local<v8::Value> result =\n          toISOString.As<v8::Function>()->Call(val, 0, nullptr);\n      if (!result.IsEmpty()) {\n        v8::String::Utf8Value utf8(result->ToString());\n        return new base::StringValue(std::string(*utf8, utf8.length()));\n      }\n    }\n  }\n\n  if (val->IsRegExp()) {\n    if (!reg_exp_allowed_)\n      \/\/ JSON.stringify converts to an object.\n      return FromV8Object(val->ToObject(), state, isolate);\n    return new base::StringValue(*v8::String::Utf8Value(val->ToString()));\n  }\n\n  \/\/ v8::Value doesn't have a ToArray() method for some reason.\n  if (val->IsArray())\n    return FromV8Array(val.As<v8::Array>(), state, isolate);\n\n  if (val->IsFunction()) {\n    if (!function_allowed_)\n      \/\/ JSON.stringify refuses to convert function(){}.\n      return NULL;\n    return FromV8Object(val->ToObject(), state, isolate);\n  }\n\n  if (node::Buffer::HasInstance(val)) {\n    return FromNodeBuffer(val, state, isolate);\n  }\n\n  if (val->IsObject()) {\n    return FromV8Object(val->ToObject(), state, isolate);\n  }\n\n  LOG(ERROR) << \"Unexpected v8 value type encountered.\";\n  return NULL;\n}\n\nbase::Value* V8ValueConverter::FromV8Array(\n    v8::Local<v8::Array> val,\n    FromV8ValueState* state,\n    v8::Isolate* isolate) const {\n  if (!state->UpdateAndCheckUniqueness(val))\n    return base::Value::CreateNullValue().release();\n\n  scoped_ptr<v8::Context::Scope> scope;\n  \/\/ If val was created in a different context than our current one, change to\n  \/\/ that context, but change back after val is converted.\n  if (!val->CreationContext().IsEmpty() &&\n      val->CreationContext() != isolate->GetCurrentContext())\n    scope.reset(new v8::Context::Scope(val->CreationContext()));\n\n  base::ListValue* result = new base::ListValue();\n\n  \/\/ Only fields with integer keys are carried over to the ListValue.\n  for (uint32 i = 0; i < val->Length(); ++i) {\n    v8::TryCatch try_catch;\n    v8::Local<v8::Value> child_v8 = val->Get(i);\n    if (try_catch.HasCaught()) {\n      LOG(ERROR) << \"Getter for index \" << i << \" threw an exception.\";\n      child_v8 = v8::Null(isolate);\n    }\n\n    if (!val->HasRealIndexedProperty(i))\n      continue;\n\n    base::Value* child = FromV8ValueImpl(state, child_v8, isolate);\n    if (child)\n      result->Append(child);\n    else\n      \/\/ JSON.stringify puts null in places where values don't serialize, for\n      \/\/ example undefined and functions. Emulate that behavior.\n      result->Append(base::Value::CreateNullValue());\n  }\n  return result;\n}\n\nbase::Value* V8ValueConverter::FromNodeBuffer(\n    v8::Local<v8::Value> value,\n    FromV8ValueState* state,\n    v8::Isolate* isolate) const {\n  return base::BinaryValue::CreateWithCopiedBuffer(\n      node::Buffer::Data(value), node::Buffer::Length(value));\n}\n\nbase::Value* V8ValueConverter::FromV8Object(\n    v8::Local<v8::Object> val,\n    FromV8ValueState* state,\n    v8::Isolate* isolate) const {\n  if (!state->UpdateAndCheckUniqueness(val))\n    return base::Value::CreateNullValue().release();\n\n  scoped_ptr<v8::Context::Scope> scope;\n  \/\/ If val was created in a different context than our current one, change to\n  \/\/ that context, but change back after val is converted.\n  if (!val->CreationContext().IsEmpty() &&\n      val->CreationContext() != isolate->GetCurrentContext())\n    scope.reset(new v8::Context::Scope(val->CreationContext()));\n\n  scoped_ptr<base::DictionaryValue> result(new base::DictionaryValue());\n  v8::Local<v8::Array> property_names(val->GetOwnPropertyNames());\n\n  for (uint32 i = 0; i < property_names->Length(); ++i) {\n    v8::Local<v8::Value> key(property_names->Get(i));\n\n    \/\/ Extend this test to cover more types as necessary and if sensible.\n    if (!key->IsString() &&\n        !key->IsNumber()) {\n      NOTREACHED() << \"Key \\\"\" << *v8::String::Utf8Value(key) << \"\\\" \"\n                      \"is neither a string nor a number\";\n      continue;\n    }\n\n    \/\/ Skip all callbacks: crbug.com\/139933\n    if (val->HasRealNamedCallbackProperty(key->ToString()))\n      continue;\n\n    v8::String::Utf8Value name_utf8(key->ToString());\n\n    v8::TryCatch try_catch;\n    v8::Local<v8::Value> child_v8 = val->Get(key);\n\n    if (try_catch.HasCaught()) {\n      LOG(ERROR) << \"Getter for property \" << *name_utf8\n                 << \" threw an exception.\";\n      child_v8 = v8::Null(isolate);\n    }\n\n    scoped_ptr<base::Value> child(FromV8ValueImpl(state, child_v8, isolate));\n    if (!child.get())\n      \/\/ JSON.stringify skips properties whose values don't serialize, for\n      \/\/ example undefined and functions. Emulate that behavior.\n      continue;\n\n    \/\/ Strip null if asked (and since undefined is turned into null, undefined\n    \/\/ too). The use case for supporting this is JSON-schema support,\n    \/\/ specifically for extensions, where \"optional\" JSON properties may be\n    \/\/ represented as null, yet due to buggy legacy code elsewhere isn't\n    \/\/ treated as such (potentially causing crashes). For example, the\n    \/\/ \"tabs.create\" function takes an object as its first argument with an\n    \/\/ optional \"windowId\" property.\n    \/\/\n    \/\/ Given just\n    \/\/\n    \/\/   tabs.create({})\n    \/\/\n    \/\/ this will work as expected on code that only checks for the existence of\n    \/\/ a \"windowId\" property (such as that legacy code). However given\n    \/\/\n    \/\/   tabs.create({windowId: null})\n    \/\/\n    \/\/ there *is* a \"windowId\" property, but since it should be an int, code\n    \/\/ on the browser which doesn't additionally check for null will fail.\n    \/\/ We can avoid all bugs related to this by stripping null.\n    if (strip_null_from_objects_ && child->IsType(base::Value::TYPE_NULL))\n      continue;\n\n    result->SetWithoutPathExpansion(std::string(*name_utf8, name_utf8.length()),\n                                    child.release());\n  }\n\n  return result.release();\n}\n\n}  \/\/ namespace atom\n<commit_msg>use v8::Object::Get<commit_after>\/\/ Copyright (c) 2013 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\/common\/native_mate_converters\/v8_value_converter.h\"\n\n#include <map>\n#include <string>\n#include <utility>\n\n#include \"base\/logging.h\"\n#include \"base\/memory\/scoped_ptr.h\"\n#include \"base\/values.h\"\n#include \"native_mate\/dictionary.h\"\n#include \"vendor\/node\/src\/node_buffer.h\"\n\nnamespace atom {\n\nnamespace {\n\nconst int kMaxRecursionDepth = 100;\n\n}  \/\/ namespace\n\n\/\/ The state of a call to FromV8Value.\nclass V8ValueConverter::FromV8ValueState {\n public:\n  \/\/ Level scope which updates the current depth of some FromV8ValueState.\n  class Level {\n   public:\n    explicit Level(FromV8ValueState* state) : state_(state) {\n      state_->max_recursion_depth_--;\n    }\n    ~Level() {\n      state_->max_recursion_depth_++;\n    }\n\n   private:\n    FromV8ValueState* state_;\n  };\n\n  FromV8ValueState() : max_recursion_depth_(kMaxRecursionDepth) {}\n\n  \/\/ If |handle| is not in |unique_map_|, then add it to |unique_map_| and\n  \/\/ return true.\n  \/\/\n  \/\/ Otherwise do nothing and return false. Here \"A is unique\" means that no\n  \/\/ other handle B in the map points to the same object as A. Note that A can\n  \/\/ be unique even if there already is another handle with the same identity\n  \/\/ hash (key) in the map, because two objects can have the same hash.\n  bool UpdateAndCheckUniqueness(v8::Local<v8::Object> handle) {\n    typedef HashToHandleMap::const_iterator Iterator;\n    int hash = handle->GetIdentityHash();\n    \/\/ We only compare using == with handles to objects with the same identity\n    \/\/ hash. Different hash obviously means different objects, but two objects\n    \/\/ in a couple of thousands could have the same identity hash.\n    std::pair<Iterator, Iterator> range = unique_map_.equal_range(hash);\n    for (Iterator it = range.first; it != range.second; ++it) {\n      \/\/ Operator == for handles actually compares the underlying objects.\n      if (it->second == handle)\n        return false;\n    }\n    unique_map_.insert(std::make_pair(hash, handle));\n    return true;\n  }\n\n  bool HasReachedMaxRecursionDepth() {\n    return max_recursion_depth_ < 0;\n  }\n\n private:\n  typedef std::multimap<int, v8::Local<v8::Object> > HashToHandleMap;\n  HashToHandleMap unique_map_;\n\n  int max_recursion_depth_;\n};\n\nV8ValueConverter::V8ValueConverter()\n    : reg_exp_allowed_(false),\n      function_allowed_(false),\n      strip_null_from_objects_(false) {}\n\nvoid V8ValueConverter::SetRegExpAllowed(bool val) {\n  reg_exp_allowed_ = val;\n}\n\nvoid V8ValueConverter::SetFunctionAllowed(bool val) {\n  function_allowed_ = val;\n}\n\nvoid V8ValueConverter::SetStripNullFromObjects(bool val) {\n  strip_null_from_objects_ = val;\n}\n\nv8::Local<v8::Value> V8ValueConverter::ToV8Value(\n    const base::Value* value, v8::Local<v8::Context> context) const {\n  v8::Context::Scope context_scope(context);\n  v8::EscapableHandleScope handle_scope(context->GetIsolate());\n  return handle_scope.Escape(ToV8ValueImpl(context->GetIsolate(), value));\n}\n\nbase::Value* V8ValueConverter::FromV8Value(\n    v8::Local<v8::Value> val,\n    v8::Local<v8::Context> context) const {\n  v8::Context::Scope context_scope(context);\n  v8::HandleScope handle_scope(context->GetIsolate());\n  FromV8ValueState state;\n  return FromV8ValueImpl(&state, val, context->GetIsolate());\n}\n\nv8::Local<v8::Value> V8ValueConverter::ToV8ValueImpl(\n     v8::Isolate* isolate, const base::Value* value) const {\n  CHECK(value);\n  switch (value->GetType()) {\n    case base::Value::TYPE_NULL:\n      return v8::Null(isolate);\n\n    case base::Value::TYPE_BOOLEAN: {\n      bool val = false;\n      CHECK(value->GetAsBoolean(&val));\n      return v8::Boolean::New(isolate, val);\n    }\n\n    case base::Value::TYPE_INTEGER: {\n      int val = 0;\n      CHECK(value->GetAsInteger(&val));\n      return v8::Integer::New(isolate, val);\n    }\n\n    case base::Value::TYPE_DOUBLE: {\n      double val = 0.0;\n      CHECK(value->GetAsDouble(&val));\n      return v8::Number::New(isolate, val);\n    }\n\n    case base::Value::TYPE_STRING: {\n      std::string val;\n      CHECK(value->GetAsString(&val));\n      return v8::String::NewFromUtf8(\n          isolate, val.c_str(), v8::String::kNormalString, val.length());\n    }\n\n    case base::Value::TYPE_LIST:\n      return ToV8Array(isolate, static_cast<const base::ListValue*>(value));\n\n    case base::Value::TYPE_DICTIONARY:\n      return ToV8Object(isolate,\n                        static_cast<const base::DictionaryValue*>(value));\n\n    case base::Value::TYPE_BINARY:\n      return ToArrayBuffer(isolate,\n                           static_cast<const base::BinaryValue*>(value));\n\n    default:\n      LOG(ERROR) << \"Unexpected value type: \" << value->GetType();\n      return v8::Null(isolate);\n  }\n}\n\nv8::Local<v8::Value> V8ValueConverter::ToV8Array(\n    v8::Isolate* isolate, const base::ListValue* val) const {\n  v8::Local<v8::Array> result(v8::Array::New(isolate, val->GetSize()));\n\n  for (size_t i = 0; i < val->GetSize(); ++i) {\n    const base::Value* child = NULL;\n    CHECK(val->Get(i, &child));\n\n    v8::Local<v8::Value> child_v8 = ToV8ValueImpl(isolate, child);\n    CHECK(!child_v8.IsEmpty());\n\n    v8::TryCatch try_catch;\n    result->Set(static_cast<uint32>(i), child_v8);\n    if (try_catch.HasCaught())\n      LOG(ERROR) << \"Setter for index \" << i << \" threw an exception.\";\n  }\n\n  return result;\n}\n\nv8::Local<v8::Value> V8ValueConverter::ToV8Object(\n    v8::Isolate* isolate, const base::DictionaryValue* val) const {\n  mate::Dictionary result = mate::Dictionary::CreateEmpty(isolate);\n  result.SetHidden(\"simple\", true);\n\n  for (base::DictionaryValue::Iterator iter(*val);\n       !iter.IsAtEnd(); iter.Advance()) {\n    const std::string& key = iter.key();\n    v8::Local<v8::Value> child_v8 = ToV8ValueImpl(isolate, &iter.value());\n    CHECK(!child_v8.IsEmpty());\n\n    v8::TryCatch try_catch;\n    result.Set(key, child_v8);\n    if (try_catch.HasCaught()) {\n      LOG(ERROR) << \"Setter for property \" << key.c_str() << \" threw an \"\n                 << \"exception.\";\n    }\n  }\n\n  return result.GetHandle();\n}\n\nv8::Local<v8::Value> V8ValueConverter::ToArrayBuffer(\n    v8::Isolate* isolate, const base::BinaryValue* value) const {\n  return node::Buffer::Copy(isolate,\n                            value->GetBuffer(),\n                            value->GetSize()).ToLocalChecked();\n}\n\nbase::Value* V8ValueConverter::FromV8ValueImpl(\n    FromV8ValueState* state,\n    v8::Local<v8::Value> val,\n    v8::Isolate* isolate) const {\n  CHECK(!val.IsEmpty());\n\n  FromV8ValueState::Level state_level(state);\n  if (state->HasReachedMaxRecursionDepth())\n    return NULL;\n\n  if (val->IsNull())\n    return base::Value::CreateNullValue().release();\n\n  if (val->IsBoolean())\n    return new base::FundamentalValue(val->ToBoolean()->Value());\n\n  if (val->IsInt32())\n    return new base::FundamentalValue(val->ToInt32()->Value());\n\n  if (val->IsNumber())\n    return new base::FundamentalValue(val->ToNumber()->Value());\n\n  if (val->IsString()) {\n    v8::String::Utf8Value utf8(val->ToString());\n    return new base::StringValue(std::string(*utf8, utf8.length()));\n  }\n\n  if (val->IsUndefined())\n    \/\/ JSON.stringify ignores undefined.\n    return NULL;\n\n  if (val->IsDate()) {\n    v8::Date* date = v8::Date::Cast(*val);\n    v8::Local<v8::Value> toISOString =\n        date->Get(v8::String::NewFromUtf8(isolate, \"toISOString\"));\n    if (toISOString->IsFunction()) {\n      v8::Local<v8::Value> result =\n          toISOString.As<v8::Function>()->Call(val, 0, nullptr);\n      if (!result.IsEmpty()) {\n        v8::String::Utf8Value utf8(result->ToString());\n        return new base::StringValue(std::string(*utf8, utf8.length()));\n      }\n    }\n  }\n\n  if (val->IsRegExp()) {\n    if (!reg_exp_allowed_)\n      \/\/ JSON.stringify converts to an object.\n      return FromV8Object(val->ToObject(), state, isolate);\n    return new base::StringValue(*v8::String::Utf8Value(val->ToString()));\n  }\n\n  \/\/ v8::Value doesn't have a ToArray() method for some reason.\n  if (val->IsArray())\n    return FromV8Array(val.As<v8::Array>(), state, isolate);\n\n  if (val->IsFunction()) {\n    if (!function_allowed_)\n      \/\/ JSON.stringify refuses to convert function(){}.\n      return NULL;\n    return FromV8Object(val->ToObject(), state, isolate);\n  }\n\n  if (node::Buffer::HasInstance(val)) {\n    return FromNodeBuffer(val, state, isolate);\n  }\n\n  if (val->IsObject()) {\n    return FromV8Object(val->ToObject(), state, isolate);\n  }\n\n  LOG(ERROR) << \"Unexpected v8 value type encountered.\";\n  return NULL;\n}\n\nbase::Value* V8ValueConverter::FromV8Array(\n    v8::Local<v8::Array> val,\n    FromV8ValueState* state,\n    v8::Isolate* isolate) const {\n  if (!state->UpdateAndCheckUniqueness(val))\n    return base::Value::CreateNullValue().release();\n\n  scoped_ptr<v8::Context::Scope> scope;\n  \/\/ If val was created in a different context than our current one, change to\n  \/\/ that context, but change back after val is converted.\n  if (!val->CreationContext().IsEmpty() &&\n      val->CreationContext() != isolate->GetCurrentContext())\n    scope.reset(new v8::Context::Scope(val->CreationContext()));\n\n  base::ListValue* result = new base::ListValue();\n\n  \/\/ Only fields with integer keys are carried over to the ListValue.\n  for (uint32 i = 0; i < val->Length(); ++i) {\n    v8::TryCatch try_catch;\n    v8::Local<v8::Value> child_v8 = val->Get(i);\n    if (try_catch.HasCaught()) {\n      LOG(ERROR) << \"Getter for index \" << i << \" threw an exception.\";\n      child_v8 = v8::Null(isolate);\n    }\n\n    if (!val->HasRealIndexedProperty(i))\n      continue;\n\n    base::Value* child = FromV8ValueImpl(state, child_v8, isolate);\n    if (child)\n      result->Append(child);\n    else\n      \/\/ JSON.stringify puts null in places where values don't serialize, for\n      \/\/ example undefined and functions. Emulate that behavior.\n      result->Append(base::Value::CreateNullValue());\n  }\n  return result;\n}\n\nbase::Value* V8ValueConverter::FromNodeBuffer(\n    v8::Local<v8::Value> value,\n    FromV8ValueState* state,\n    v8::Isolate* isolate) const {\n  return base::BinaryValue::CreateWithCopiedBuffer(\n      node::Buffer::Data(value), node::Buffer::Length(value));\n}\n\nbase::Value* V8ValueConverter::FromV8Object(\n    v8::Local<v8::Object> val,\n    FromV8ValueState* state,\n    v8::Isolate* isolate) const {\n  if (!state->UpdateAndCheckUniqueness(val))\n    return base::Value::CreateNullValue().release();\n\n  scoped_ptr<v8::Context::Scope> scope;\n  \/\/ If val was created in a different context than our current one, change to\n  \/\/ that context, but change back after val is converted.\n  if (!val->CreationContext().IsEmpty() &&\n      val->CreationContext() != isolate->GetCurrentContext())\n    scope.reset(new v8::Context::Scope(val->CreationContext()));\n\n  scoped_ptr<base::DictionaryValue> result(new base::DictionaryValue());\n  v8::Local<v8::Array> property_names(val->GetOwnPropertyNames());\n\n  for (uint32 i = 0; i < property_names->Length(); ++i) {\n    v8::Local<v8::Value> key(property_names->Get(i));\n\n    \/\/ Extend this test to cover more types as necessary and if sensible.\n    if (!key->IsString() &&\n        !key->IsNumber()) {\n      NOTREACHED() << \"Key \\\"\" << *v8::String::Utf8Value(key) << \"\\\" \"\n                      \"is neither a string nor a number\";\n      continue;\n    }\n\n    \/\/ Skip all callbacks: crbug.com\/139933\n    if (val->HasRealNamedCallbackProperty(key->ToString()))\n      continue;\n\n    v8::String::Utf8Value name_utf8(key->ToString());\n\n    v8::TryCatch try_catch;\n    v8::Local<v8::Value> child_v8 = val->Get(key);\n\n    if (try_catch.HasCaught()) {\n      LOG(ERROR) << \"Getter for property \" << *name_utf8\n                 << \" threw an exception.\";\n      child_v8 = v8::Null(isolate);\n    }\n\n    scoped_ptr<base::Value> child(FromV8ValueImpl(state, child_v8, isolate));\n    if (!child.get())\n      \/\/ JSON.stringify skips properties whose values don't serialize, for\n      \/\/ example undefined and functions. Emulate that behavior.\n      continue;\n\n    \/\/ Strip null if asked (and since undefined is turned into null, undefined\n    \/\/ too). The use case for supporting this is JSON-schema support,\n    \/\/ specifically for extensions, where \"optional\" JSON properties may be\n    \/\/ represented as null, yet due to buggy legacy code elsewhere isn't\n    \/\/ treated as such (potentially causing crashes). For example, the\n    \/\/ \"tabs.create\" function takes an object as its first argument with an\n    \/\/ optional \"windowId\" property.\n    \/\/\n    \/\/ Given just\n    \/\/\n    \/\/   tabs.create({})\n    \/\/\n    \/\/ this will work as expected on code that only checks for the existence of\n    \/\/ a \"windowId\" property (such as that legacy code). However given\n    \/\/\n    \/\/   tabs.create({windowId: null})\n    \/\/\n    \/\/ there *is* a \"windowId\" property, but since it should be an int, code\n    \/\/ on the browser which doesn't additionally check for null will fail.\n    \/\/ We can avoid all bugs related to this by stripping null.\n    if (strip_null_from_objects_ && child->IsType(base::Value::TYPE_NULL))\n      continue;\n\n    result->SetWithoutPathExpansion(std::string(*name_utf8, name_utf8.length()),\n                                    child.release());\n  }\n\n  return result.release();\n}\n\n}  \/\/ namespace atom\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ This file is part of the Marble Desktop Globe.\n\/\/\n\/\/ This program is free software licensed under the GNU LGPL. You can\n\/\/ find a copy of this license in LICENSE.txt in the top directory of\n\/\/ the source code.\n\/\/\n\/\/ Copyright 2006-2007 Torsten Rahn <tackat@kde.org>\"\n\/\/ Copyright 2007      Inge Wallin  <ingwa@kde.org>\"\n\/\/\n\n#include \"GridMap.h\"\n\n#include <cmath>\n#include <stdlib.h>\n\n#include <QtCore\/QVector>\n#include <QtCore\/QTime>\n#include <QtCore\/QDebug>\n#include <QtGui\/QColor>\n\n#include \"global.h\"\n#include \"MarbleModel.h\"\n#include \"GeoPainter.h\"\n#include \"AbstractProjection.h\"\n#include \"ViewParams.h\"\n#include \"ViewportParams.h\"\n\n#include \"GeoSceneDocument.h\"\n#include \"GeoSceneHead.h\"\n\nusing namespace Marble;\n\n\/\/ Except for the equator the major circles of latitude are defined via \n\/\/ the earth's axial tilt, which currently measures about 23°26'21\".\n \nconst qreal  AXIALTILT = DEG2RAD * ( 23.0\n\t\t\t\t      + 26.0 \/ 60.0\n\t\t\t\t      + 21.0 \/ 3600.0 );\nconst qreal  PIHALF    = M_PI \/ 2.0;\n\n\nGridMap::GridMap( MarbleModel *model )\n    : m_model( model ),\n      m_pen( QPen( QColor( 255, 255, 255, 128) ) ), \n      m_lastVisible( false ),\n      m_currentlyVisible( false )\n{\n}\n\nGridMap::~GridMap()\n{\n}\n\n\nvoid GridMap::createTropics( ViewportParams* viewport )\n{\n    clear();\n    viewport->planetAxis().inverse().toMatrix( m_planetAxisMatrix );\n\n\n    GeoSceneDocument *mapTheme = m_model->mapTheme();\n    QString target = mapTheme->head()->target();\n\n    \/\/ Turn on the major circles of latitude if we've zoomed in far\n    \/\/ enough (radius > 400 pixels)\n    if ( target == \"earth\" && viewport->radius() >  400 ) {\n        int  precision = getPrecision( viewport );\n\n        \/\/ Arctic Circle\n        createCircle( PIHALF - AXIALTILT, Latitude, precision, viewport );\n\n        \/\/ Antarctic Circle\n        createCircle( AXIALTILT - PIHALF, Latitude, precision, viewport );\n\n        \/\/ Tropic of Cancer \n        createCircle( AXIALTILT, Latitude, precision, viewport ); \n\n        \/\/ Tropic of Capricorn\n        createCircle( -AXIALTILT, Latitude, precision, viewport );\n    }\n}\n\nvoid GridMap::createEquator( ViewportParams* viewport ) \n{\n    clear();\n    viewport->planetAxis().inverse().toMatrix( m_planetAxisMatrix );\n\n    int  precision = getPrecision( viewport );\n    createCircle( 0.0 , Latitude, precision, viewport );\n}\n\nvoid GridMap::createGrid( ViewportParams* viewport )\n{\n    clear();\n    viewport->planetAxis().inverse().toMatrix( m_planetAxisMatrix );\n\n    \/\/\tFIXME:\t- Higher precision after optimization \n    \/\/\t\t  ( will keep grid lines from vanishing at high zoom levels ) \n\n    int  radius = viewport->radius();\n    int  precision = getPrecision( viewport );\n    if ( radius > 3200 ) {\n        createCircles( 32, 24, precision, viewport );\n    } \n    else if ( radius > 1600 ) {\n        createCircles( 16, 12, precision, viewport );\n    }\t\n    else if ( radius >  700 ) {\n        createCircles( 8, 6, precision, viewport );\n    }\t\n    else if ( radius >  400 ) {\n        createCircles( 4, 3, precision, viewport );\n    }\t\n    else if ( radius >  100 ) {\n        createCircles( 2, 3, precision, viewport );\n    }\t\n    else {\n        createCircles( 2, 1, precision, viewport );\n    }\n}\n\n\nvoid GridMap::createCircles( const int lonNum, const int latNum,\n                             int precision,\n                             ViewportParams *viewport )\n{\n    \/\/ latNum: number of latitude  circles between lat = 0 deg and lat < 90 deg\n    \/\/ lonNum: number of longitude circles between lon = 0 deg and lon < 90 deg\n\n    if ( latNum > 0 ) {\n\n        \/\/ Circles of latitude:\n        for ( int i = 1; i < latNum; ++i ) {\n            createCircle( +i * PIHALF \/ latNum, Latitude, precision, viewport );\n            createCircle( -i * PIHALF \/ latNum, Latitude, precision, viewport );\n        } \n    } \n\n    if ( lonNum > 0 ) {\n\n        \/\/ Universal prime meridian and its orthogonal great circle:\n        createCircle( +0,      Longitude, precision, viewport );\n        createCircle( +PIHALF, Longitude, precision, viewport );\t\n\n        for ( int i = 1; i < lonNum; ++i ) {\n            qreal cutOff = latNum == 0 ? 0 : PIHALF \/ (qreal)(latNum);\n            createCircle( +i * PIHALF \/ lonNum, Longitude, \n                          precision, viewport, cutOff );\n            createCircle( -i * PIHALF \/ lonNum, Longitude,\n                          precision, viewport, cutOff );\t\n        }\n    }\n}\n\nvoid GridMap::createCircle( qreal angle, SphereDim dim,\n                            int precision,\n                            ViewportParams *viewport, qreal cutOff)\n{\n    switch( viewport->projection() ) {\n        case Spherical:\n            sphericalCreateCircle( angle, dim, precision, viewport, cutOff );\n            break;\n        case Equirectangular:\n        case Mercator:\n\t    flatCreateCircle( angle, dim, precision, viewport, cutOff );\n            break;\n    }\n}\n\nvoid GridMap::sphericalCreateCircle( qreal angle, SphereDim dim,\n                                     int precision,\n                                     ViewportParams *viewport, qreal cutOff )\n{\n    \/\/ cutOff: the amount of each quarter circle that is cut off at\n    \/\/         the pole in radians\n\n    const qreal cutCoeff   = 1.0 - cutOff \/ PIHALF;\n\n    \/\/ We draw each circle in quarters ( or parts of those ).\n    \/\/ This is especially convenient for the great longitude circles which \n    \/\/ are being cut off close to the poles.\n    \/\/ quartSteps: the number of nodes in a \"quarter\" of a circle.\n\n    const qreal quartSteps = (qreal) precision;\n\n    qreal coeff  = 1.0;\n    qreal offset = 0.0;\n\n    \/\/ Some convenience variables\n    int  imgWidth  = viewport->width();\n    int  imgHeight = viewport->height();\n    int  radius    = viewport->radius();\n\n    const int steps = (int) ( cutCoeff * quartSteps );\n    for ( int i = 0; i < 4; ++i ) {\n\n        if ( i > 1 ) \n            coeff = - 1.0;\n        offset = ( i % 2 ) ? 1.0 : 0.0;\n\n        m_polygon.clear();\n        m_polygon.reserve( steps + 1 );\n\n        Quaternion qpos;\n        for ( int j = 0; j < steps + 1; ++j ) {\n\n            qreal itval  = (j != steps) ? (qreal)(j) \/ quartSteps : cutCoeff;\n            qreal dimVal = coeff * ( PIHALF * fabs( offset - itval ) + offset * PIHALF );\n\n            qreal lat = ( dim == Latitude )  ? angle : dimVal;\n            qreal lon = ( dim == Longitude ) ? angle : dimVal;\n\n            qpos.set( lon, -lat );\n            qpos.rotateAroundAxis(m_planetAxisMatrix);\n\n            m_currentPoint = QPointF( (qreal)(imgWidth \/ 2 + radius * qpos.v[Q_X]),\n                                      (qreal)(imgHeight \/ 2 - radius * qpos.v[Q_Y]) );\n            \/\/qDebug() << \"Radius: \" << radius\n            \/\/         << \"QPointF(\" << (qreal)(imgWidth \/ 2 + radius*qpos.v[Q_X])+1\n            \/\/        << \", \" << (qreal)(imgHeight \/ 2 + radius*qpos.v[Q_Y])+1 << \")\";\n\n            \/\/ Take care of horizon crossings if horizon is visible.\n            m_lastVisible = m_currentlyVisible;\n            m_currentlyVisible = (qpos.v[Q_Z] >= 0) ? true : false;\n\n            \/\/ Initialize crossing of the horizon.\n            if ( j == 0 ) {\n\n                m_lastVisible = m_currentlyVisible;\n\n                \/\/ Initially m_lastPoint MUST NOT equal m_currentPoint\n                m_lastPoint = QPointF( m_currentPoint.x(), \n                                       m_currentPoint.y() );\n            }\n\n            if ( m_currentlyVisible != m_lastVisible ) {\n                m_polygon << horizonPoint( viewport );\n\n                if ( m_polygon.size() >= 2 ) {\n                    append( m_polygon );\n                }\n\n                m_polygon.clear();\n\n                if ( m_lastVisible == true )\n                    break;\n            }\n\n            \/\/ Take care of screencrossing crossings if horizon is visible.\n            \/\/ Filter points which aren't on the visible hemisphere.\n            if ( m_currentlyVisible ) {\n                \/\/ most recent addition: m_currentPoint != m_lastPoint\n                \/\/\t\t\tqDebug(\"accepted\");\n                m_polygon << m_currentPoint;\n            }\n\n            m_lastPoint = m_currentPoint;\n        }\n\n        if ( m_polygon.size() >= 2 ) {\n            append( m_polygon );\n        }\n    }\n}\n\n\/\/ This function is used for all projections that are flat.\n\/\/ Currently that means:\n\/\/  - Equirectangular\n\/\/  - Mercator\n\/\/\nvoid GridMap::flatCreateCircle( qreal angle, SphereDim dim,\n\t\t\t\tint precision,\n\t\t\t\tViewportParams *viewport, qreal cutOff )\n{\n    \/\/ Only used in spherical projection.\n    Q_UNUSED( precision );\n    Q_UNUSED( cutOff );\n\n    \/\/ Convenience variables\n    AbstractProjection  *currentProjection = viewport->currentProjection();\n    int                  imgHeight = viewport->height();\n    int                  imgWidth  = viewport->width();\n    int                  radius    = viewport->radius();\n\n    int  dummy;\n\n    m_polygon.clear();\n    if ( dim == Latitude ) {\n        \/\/ FIXME: At some point add a\n        \/\/        AbstractProjection::screenCoordinates() that produce\n        \/\/        qreals, and then make y and x below qreals instead.\n        int  y;\n\n        currentProjection->screenCoordinates( 0.0, angle, viewport, \n                           dummy, y );\n\n        QPointF  startPoint( 0.0f,     (qreal)y );\n        QPointF  endPoint(   imgWidth, (qreal)y );\n        m_polygon << startPoint << endPoint;\n        append( m_polygon );\n    }\n    else {\n        \/\/ dim == Longitude\n\n        int  x;\n        int  yTop;\n        int  yBottom;\n\n        currentProjection->screenCoordinates( angle, 0.0, viewport, \n                            x, dummy );\n\n        \/\/ Get the top and bottom of the map.  Clip it to the screen\n        currentProjection->screenCoordinates( 0.0, currentProjection->maxLat(),\n                            viewport,\n                            dummy, yTop );\n        if ( yTop < 0 )\n            yTop = 0;\n        currentProjection->screenCoordinates( 0.0, -currentProjection->maxLat(),\n                            viewport,\n                            dummy, yBottom );\n        if ( yBottom > imgHeight )\n            yBottom = imgHeight;\n        \n        \/\/ If we are far zoomed out, then there may be repetition in\n        \/\/ the X direction.\n\n        \/\/ Normally we would add 2*PI (4*radius) but in this case a\n        \/\/ circle is shown as a line every half (the front and the\n        \/\/ back).\n\n        while ( x > 2 * radius ) \n            x -= 2 * radius;\n        while ( x < imgWidth ) {\n            QPointF  startPoint( x, yTop );\n            QPointF  endPoint(   x, yBottom );\n\n            m_polygon << startPoint << endPoint;\n            append( m_polygon );\n\n            \/\/ Set up for next pass through the loop\n            x += 2 * radius;\n            m_polygon.clear();\n        }\n    }\n}\n\n\nvoid GridMap::paintGridMap(GeoPainter * painter, bool antialiasing)\n{\n    if ( size() == 0 )\n        return;\n\n    if ( antialiasing == true )\n        painter->setRenderHint(QPainter::Antialiasing, true);\n\n    painter->setPen(m_pen);\n\n    ScreenPolygon::Vector::const_iterator  itEndPolygon = constEnd();\n    for ( ScreenPolygon::Vector::const_iterator itPolygon=constBegin(); \n          itPolygon != itEndPolygon;\n          ++itPolygon )\n    {\n        painter->drawPolyline(*itPolygon);\n    }\n\n    if (antialiasing)\n        painter->setRenderHint( QPainter::Antialiasing, false );\n}\n\n\nint GridMap::getPrecision( ViewportParams *viewport )\n{\n    int  radius = viewport->radius();\n\n    if ( radius > 3200 ) {\n        return 40;\n    } \n    else if ( radius > 1600 ) {\n        return 30;\n    }\t\n    else if ( radius >  700 ) {\n        return 30;\n    }\t\n    else if ( radius >  400 ) {\n        return 20;\n    }\t\n    else if ( radius >  100 ) {\n        return 10;\n    }\n\n    return 10;\n}\n\nconst QPointF GridMap::horizonPoint( ViewportParams *viewport)\n{\n    \/\/ qDebug(\"Interpolating\");\n    qreal  xa = 0;\n    qreal  ya = 0;\n\n    xa = m_currentPoint.x() - ( viewport->width() \/ 2 ) ;\n\n    \/\/ Move the m_currentPoint along the y-axis to match the horizon.\n    qreal  radius   = (qreal)(viewport->radius());\n    qreal  radicant = radius * radius - xa * xa;\n    if ( radicant > 0 )\n        ya = sqrt( radicant );\n\n    if ( ( m_currentPoint.y() - ( viewport->height() \/ 2 ) ) < 0 )\n        ya = -ya; \n\n    return QPointF( (qreal)viewport->width()  \/ 2 + xa,\n                    (qreal)viewport->height() \/ 2 + ya );\n}\n<commit_msg>Simplify bool expressions, do not compare bool values with \"true\", just use the value.<commit_after>\/\/\n\/\/ This file is part of the Marble Desktop Globe.\n\/\/\n\/\/ This program is free software licensed under the GNU LGPL. You can\n\/\/ find a copy of this license in LICENSE.txt in the top directory of\n\/\/ the source code.\n\/\/\n\/\/ Copyright 2006-2007 Torsten Rahn <tackat@kde.org>\"\n\/\/ Copyright 2007      Inge Wallin  <ingwa@kde.org>\"\n\/\/\n\n#include \"GridMap.h\"\n\n#include <cmath>\n#include <stdlib.h>\n\n#include <QtCore\/QVector>\n#include <QtCore\/QTime>\n#include <QtCore\/QDebug>\n#include <QtGui\/QColor>\n\n#include \"global.h\"\n#include \"MarbleModel.h\"\n#include \"GeoPainter.h\"\n#include \"AbstractProjection.h\"\n#include \"ViewParams.h\"\n#include \"ViewportParams.h\"\n\n#include \"GeoSceneDocument.h\"\n#include \"GeoSceneHead.h\"\n\nusing namespace Marble;\n\n\/\/ Except for the equator the major circles of latitude are defined via \n\/\/ the earth's axial tilt, which currently measures about 23°26'21\".\n \nconst qreal  AXIALTILT = DEG2RAD * ( 23.0\n\t\t\t\t      + 26.0 \/ 60.0\n\t\t\t\t      + 21.0 \/ 3600.0 );\nconst qreal  PIHALF    = M_PI \/ 2.0;\n\n\nGridMap::GridMap( MarbleModel *model )\n    : m_model( model ),\n      m_pen( QPen( QColor( 255, 255, 255, 128) ) ), \n      m_lastVisible( false ),\n      m_currentlyVisible( false )\n{\n}\n\nGridMap::~GridMap()\n{\n}\n\n\nvoid GridMap::createTropics( ViewportParams* viewport )\n{\n    clear();\n    viewport->planetAxis().inverse().toMatrix( m_planetAxisMatrix );\n\n\n    GeoSceneDocument *mapTheme = m_model->mapTheme();\n    QString target = mapTheme->head()->target();\n\n    \/\/ Turn on the major circles of latitude if we've zoomed in far\n    \/\/ enough (radius > 400 pixels)\n    if ( target == \"earth\" && viewport->radius() >  400 ) {\n        int  precision = getPrecision( viewport );\n\n        \/\/ Arctic Circle\n        createCircle( PIHALF - AXIALTILT, Latitude, precision, viewport );\n\n        \/\/ Antarctic Circle\n        createCircle( AXIALTILT - PIHALF, Latitude, precision, viewport );\n\n        \/\/ Tropic of Cancer \n        createCircle( AXIALTILT, Latitude, precision, viewport ); \n\n        \/\/ Tropic of Capricorn\n        createCircle( -AXIALTILT, Latitude, precision, viewport );\n    }\n}\n\nvoid GridMap::createEquator( ViewportParams* viewport ) \n{\n    clear();\n    viewport->planetAxis().inverse().toMatrix( m_planetAxisMatrix );\n\n    int  precision = getPrecision( viewport );\n    createCircle( 0.0 , Latitude, precision, viewport );\n}\n\nvoid GridMap::createGrid( ViewportParams* viewport )\n{\n    clear();\n    viewport->planetAxis().inverse().toMatrix( m_planetAxisMatrix );\n\n    \/\/\tFIXME:\t- Higher precision after optimization \n    \/\/\t\t  ( will keep grid lines from vanishing at high zoom levels ) \n\n    int  radius = viewport->radius();\n    int  precision = getPrecision( viewport );\n    if ( radius > 3200 ) {\n        createCircles( 32, 24, precision, viewport );\n    } \n    else if ( radius > 1600 ) {\n        createCircles( 16, 12, precision, viewport );\n    }\t\n    else if ( radius >  700 ) {\n        createCircles( 8, 6, precision, viewport );\n    }\t\n    else if ( radius >  400 ) {\n        createCircles( 4, 3, precision, viewport );\n    }\t\n    else if ( radius >  100 ) {\n        createCircles( 2, 3, precision, viewport );\n    }\t\n    else {\n        createCircles( 2, 1, precision, viewport );\n    }\n}\n\n\nvoid GridMap::createCircles( const int lonNum, const int latNum,\n                             int precision,\n                             ViewportParams *viewport )\n{\n    \/\/ latNum: number of latitude  circles between lat = 0 deg and lat < 90 deg\n    \/\/ lonNum: number of longitude circles between lon = 0 deg and lon < 90 deg\n\n    if ( latNum > 0 ) {\n\n        \/\/ Circles of latitude:\n        for ( int i = 1; i < latNum; ++i ) {\n            createCircle( +i * PIHALF \/ latNum, Latitude, precision, viewport );\n            createCircle( -i * PIHALF \/ latNum, Latitude, precision, viewport );\n        } \n    } \n\n    if ( lonNum > 0 ) {\n\n        \/\/ Universal prime meridian and its orthogonal great circle:\n        createCircle( +0,      Longitude, precision, viewport );\n        createCircle( +PIHALF, Longitude, precision, viewport );\t\n\n        for ( int i = 1; i < lonNum; ++i ) {\n            qreal cutOff = latNum == 0 ? 0 : PIHALF \/ (qreal)(latNum);\n            createCircle( +i * PIHALF \/ lonNum, Longitude, \n                          precision, viewport, cutOff );\n            createCircle( -i * PIHALF \/ lonNum, Longitude,\n                          precision, viewport, cutOff );\t\n        }\n    }\n}\n\nvoid GridMap::createCircle( qreal angle, SphereDim dim,\n                            int precision,\n                            ViewportParams *viewport, qreal cutOff)\n{\n    switch( viewport->projection() ) {\n        case Spherical:\n            sphericalCreateCircle( angle, dim, precision, viewport, cutOff );\n            break;\n        case Equirectangular:\n        case Mercator:\n\t    flatCreateCircle( angle, dim, precision, viewport, cutOff );\n            break;\n    }\n}\n\nvoid GridMap::sphericalCreateCircle( qreal angle, SphereDim dim,\n                                     int precision,\n                                     ViewportParams *viewport, qreal cutOff )\n{\n    \/\/ cutOff: the amount of each quarter circle that is cut off at\n    \/\/         the pole in radians\n\n    const qreal cutCoeff   = 1.0 - cutOff \/ PIHALF;\n\n    \/\/ We draw each circle in quarters ( or parts of those ).\n    \/\/ This is especially convenient for the great longitude circles which \n    \/\/ are being cut off close to the poles.\n    \/\/ quartSteps: the number of nodes in a \"quarter\" of a circle.\n\n    const qreal quartSteps = (qreal) precision;\n\n    qreal coeff  = 1.0;\n    qreal offset = 0.0;\n\n    \/\/ Some convenience variables\n    int  imgWidth  = viewport->width();\n    int  imgHeight = viewport->height();\n    int  radius    = viewport->radius();\n\n    const int steps = (int) ( cutCoeff * quartSteps );\n    for ( int i = 0; i < 4; ++i ) {\n\n        if ( i > 1 ) \n            coeff = - 1.0;\n        offset = ( i % 2 ) ? 1.0 : 0.0;\n\n        m_polygon.clear();\n        m_polygon.reserve( steps + 1 );\n\n        Quaternion qpos;\n        for ( int j = 0; j < steps + 1; ++j ) {\n\n            qreal itval  = (j != steps) ? (qreal)(j) \/ quartSteps : cutCoeff;\n            qreal dimVal = coeff * ( PIHALF * fabs( offset - itval ) + offset * PIHALF );\n\n            qreal lat = ( dim == Latitude )  ? angle : dimVal;\n            qreal lon = ( dim == Longitude ) ? angle : dimVal;\n\n            qpos.set( lon, -lat );\n            qpos.rotateAroundAxis(m_planetAxisMatrix);\n\n            m_currentPoint = QPointF( (qreal)(imgWidth \/ 2 + radius * qpos.v[Q_X]),\n                                      (qreal)(imgHeight \/ 2 - radius * qpos.v[Q_Y]) );\n            \/\/qDebug() << \"Radius: \" << radius\n            \/\/         << \"QPointF(\" << (qreal)(imgWidth \/ 2 + radius*qpos.v[Q_X])+1\n            \/\/        << \", \" << (qreal)(imgHeight \/ 2 + radius*qpos.v[Q_Y])+1 << \")\";\n\n            \/\/ Take care of horizon crossings if horizon is visible.\n            m_lastVisible = m_currentlyVisible;\n            m_currentlyVisible = (qpos.v[Q_Z] >= 0) ? true : false;\n\n            \/\/ Initialize crossing of the horizon.\n            if ( j == 0 ) {\n\n                m_lastVisible = m_currentlyVisible;\n\n                \/\/ Initially m_lastPoint MUST NOT equal m_currentPoint\n                m_lastPoint = QPointF( m_currentPoint.x(), \n                                       m_currentPoint.y() );\n            }\n\n            if ( m_currentlyVisible != m_lastVisible ) {\n                m_polygon << horizonPoint( viewport );\n\n                if ( m_polygon.size() >= 2 ) {\n                    append( m_polygon );\n                }\n\n                m_polygon.clear();\n\n                if ( m_lastVisible )\n                    break;\n            }\n\n            \/\/ Take care of screencrossing crossings if horizon is visible.\n            \/\/ Filter points which aren't on the visible hemisphere.\n            if ( m_currentlyVisible ) {\n                \/\/ most recent addition: m_currentPoint != m_lastPoint\n                \/\/\t\t\tqDebug(\"accepted\");\n                m_polygon << m_currentPoint;\n            }\n\n            m_lastPoint = m_currentPoint;\n        }\n\n        if ( m_polygon.size() >= 2 ) {\n            append( m_polygon );\n        }\n    }\n}\n\n\/\/ This function is used for all projections that are flat.\n\/\/ Currently that means:\n\/\/  - Equirectangular\n\/\/  - Mercator\n\/\/\nvoid GridMap::flatCreateCircle( qreal angle, SphereDim dim,\n\t\t\t\tint precision,\n\t\t\t\tViewportParams *viewport, qreal cutOff )\n{\n    \/\/ Only used in spherical projection.\n    Q_UNUSED( precision );\n    Q_UNUSED( cutOff );\n\n    \/\/ Convenience variables\n    AbstractProjection  *currentProjection = viewport->currentProjection();\n    int                  imgHeight = viewport->height();\n    int                  imgWidth  = viewport->width();\n    int                  radius    = viewport->radius();\n\n    int  dummy;\n\n    m_polygon.clear();\n    if ( dim == Latitude ) {\n        \/\/ FIXME: At some point add a\n        \/\/        AbstractProjection::screenCoordinates() that produce\n        \/\/        qreals, and then make y and x below qreals instead.\n        int  y;\n\n        currentProjection->screenCoordinates( 0.0, angle, viewport, \n                           dummy, y );\n\n        QPointF  startPoint( 0.0f,     (qreal)y );\n        QPointF  endPoint(   imgWidth, (qreal)y );\n        m_polygon << startPoint << endPoint;\n        append( m_polygon );\n    }\n    else {\n        \/\/ dim == Longitude\n\n        int  x;\n        int  yTop;\n        int  yBottom;\n\n        currentProjection->screenCoordinates( angle, 0.0, viewport, \n                            x, dummy );\n\n        \/\/ Get the top and bottom of the map.  Clip it to the screen\n        currentProjection->screenCoordinates( 0.0, currentProjection->maxLat(),\n                            viewport,\n                            dummy, yTop );\n        if ( yTop < 0 )\n            yTop = 0;\n        currentProjection->screenCoordinates( 0.0, -currentProjection->maxLat(),\n                            viewport,\n                            dummy, yBottom );\n        if ( yBottom > imgHeight )\n            yBottom = imgHeight;\n        \n        \/\/ If we are far zoomed out, then there may be repetition in\n        \/\/ the X direction.\n\n        \/\/ Normally we would add 2*PI (4*radius) but in this case a\n        \/\/ circle is shown as a line every half (the front and the\n        \/\/ back).\n\n        while ( x > 2 * radius ) \n            x -= 2 * radius;\n        while ( x < imgWidth ) {\n            QPointF  startPoint( x, yTop );\n            QPointF  endPoint(   x, yBottom );\n\n            m_polygon << startPoint << endPoint;\n            append( m_polygon );\n\n            \/\/ Set up for next pass through the loop\n            x += 2 * radius;\n            m_polygon.clear();\n        }\n    }\n}\n\n\nvoid GridMap::paintGridMap(GeoPainter * painter, bool antialiasing)\n{\n    if ( size() == 0 )\n        return;\n\n    if ( antialiasing )\n        painter->setRenderHint(QPainter::Antialiasing, true);\n\n    painter->setPen(m_pen);\n\n    ScreenPolygon::Vector::const_iterator  itEndPolygon = constEnd();\n    for ( ScreenPolygon::Vector::const_iterator itPolygon=constBegin(); \n          itPolygon != itEndPolygon;\n          ++itPolygon )\n    {\n        painter->drawPolyline(*itPolygon);\n    }\n\n    if (antialiasing)\n        painter->setRenderHint( QPainter::Antialiasing, false );\n}\n\n\nint GridMap::getPrecision( ViewportParams *viewport )\n{\n    int  radius = viewport->radius();\n\n    if ( radius > 3200 ) {\n        return 40;\n    } \n    else if ( radius > 1600 ) {\n        return 30;\n    }\t\n    else if ( radius >  700 ) {\n        return 30;\n    }\t\n    else if ( radius >  400 ) {\n        return 20;\n    }\t\n    else if ( radius >  100 ) {\n        return 10;\n    }\n\n    return 10;\n}\n\nconst QPointF GridMap::horizonPoint( ViewportParams *viewport)\n{\n    \/\/ qDebug(\"Interpolating\");\n    qreal  xa = 0;\n    qreal  ya = 0;\n\n    xa = m_currentPoint.x() - ( viewport->width() \/ 2 ) ;\n\n    \/\/ Move the m_currentPoint along the y-axis to match the horizon.\n    qreal  radius   = (qreal)(viewport->radius());\n    qreal  radicant = radius * radius - xa * xa;\n    if ( radicant > 0 )\n        ya = sqrt( radicant );\n\n    if ( ( m_currentPoint.y() - ( viewport->height() \/ 2 ) ) < 0 )\n        ya = -ya; \n\n    return QPointF( (qreal)viewport->width()  \/ 2 + xa,\n                    (qreal)viewport->height() \/ 2 + ya );\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ $Id$\n\/\/\n\/\/ Task to filter Esd tracks and propagate to Emcal surface.\n\/\/\n\/\/ Author: C.Loizides\n\n#include \"AliEmcalEsdTrackFilterTask.h\"\n#include <TClonesArray.h>\n#include <TGeoGlobalMagField.h>\n#include <AliAnalysisManager.h>\n#include <AliEMCALRecoUtils.h>\n#include <AliESDEvent.h>\n#include <AliESDtrackCuts.h>\n#include <AliMagF.h>\n#include <AliTrackerBase.h>\n\nClassImp(AliEmcalEsdTrackFilterTask)\n\n\/\/________________________________________________________________________\nAliEmcalEsdTrackFilterTask::AliEmcalEsdTrackFilterTask() : \n  AliAnalysisTaskSE(\"AliEmcalEsdTrackFilterTask\"),\n  fEsdTrackCuts(0),\n  fDoSpdVtxCon(0),\n  fHybridTrackCuts(0),\n  fTracksName(),\n  fIncludeNoITS(kTRUE),\n  fDoPropagation(kFALSE),\n  fDist(440),\n  fEsdEv(0),\n  fTracks(0)\n{\n  \/\/ Constructor.\n}\n\n\/\/________________________________________________________________________\nAliEmcalEsdTrackFilterTask::AliEmcalEsdTrackFilterTask(const char *name) : \n  AliAnalysisTaskSE(name),\n  fEsdTrackCuts(0),\n  fDoSpdVtxCon(0),\n  fHybridTrackCuts(0),\n  fTracksName(\"EsdTracksOut\"),\n  fIncludeNoITS(kTRUE),\n  fDoPropagation(kFALSE),\n  fDist(440),\n  fEsdEv(0),\n  fTracks(0)\n{\n  \/\/ Constructor.\n\n  if (!name)\n    return;\n\n  SetName(name);\n\n  fBranchNames = \"ESD:AliESDHeader.,AliESDRun.,SPDVertex.,Tracks\";\n}\n\n\/\/________________________________________________________________________\nAliEmcalEsdTrackFilterTask::~AliEmcalEsdTrackFilterTask()\n{\n  \/\/Destructor\n\n  delete fEsdTrackCuts;\n}\n\n\/\/________________________________________________________________________\nvoid AliEmcalEsdTrackFilterTask::UserCreateOutputObjects()\n{\n  \/\/ Create histograms.\n\n  fTracks = new TClonesArray(\"AliESDtrack\");\n  fTracks->SetName(fTracksName);\n\n  if (fDoSpdVtxCon) {\n    if (!fEsdTrackCuts) {\n      AliInfo(\"No track cuts given, creating default (standard only TPC) cuts\");\n      fEsdTrackCuts = AliESDtrackCuts::GetStandardTPCOnlyTrackCuts();\n      fEsdTrackCuts->SetPtRange(0.15,1e3);\n    } \n  } else {\n    AliWarning(\"No track cuts given, but maybe this is indeed intended?\");\n  }\n}\n\n\/\/________________________________________________________________________\nvoid AliEmcalEsdTrackFilterTask::UserExec(Option_t *) \n{\n  \/\/ Main loop, called for each event.\n\n  fEsdEv = dynamic_cast<AliESDEvent*>(InputEvent());\n  if (!fEsdEv) {\n    AliError(\"Task works only on ESD events, returning\");\n    return;\n  }\n\n  AliAnalysisManager *am = AliAnalysisManager::GetAnalysisManager();\n  if (!am) {\n    AliError(\"Manager zero, returning\");\n    return;\n  }\n\n  \/\/ add tracks to event if not yet there\n  fTracks->Delete();\n  if (!(InputEvent()->FindListObject(fTracksName)))\n    InputEvent()->AddObject(fTracks);\n\n  if (!fHybridTrackCuts) { \/\/ contrain TPC tracks to SPD vertex if fDoSpdVtxCon==kTRUE\n    am->LoadBranch(\"AliESDRun.\");\n    am->LoadBranch(\"AliESDHeader.\");\n    am->LoadBranch(\"Tracks\");\n\n    if (fDoSpdVtxCon) {\n      if (!TGeoGlobalMagField::Instance()->GetField()) { \/\/ construct field map\n        fEsdEv->InitMagneticField();\n      }\n      am->LoadBranch(\"SPDVertex.\");\n      const AliESDVertex *vtxSPD = fEsdEv->GetPrimaryVertexSPD();\n      if (!vtxSPD) {\n        AliError(\"No SPD vertex, returning\");\n        return;\n      }\n      Int_t ntr = fEsdEv->GetNumberOfTracks();\n      for (Int_t i=0, ntrnew=0; i<ntr; ++i) {\n        AliESDtrack *etrack = fEsdEv->GetTrack(i);\n        if (!etrack)\n          continue;\n        if (!fEsdTrackCuts->AcceptTrack(etrack))\n          continue;\n        AliESDtrack *ntrack = AliESDtrackCuts::GetTPCOnlyTrack(fEsdEv,etrack->GetID());\n        if (!ntrack)\n          continue;\n        if (ntrack->Pt()<=0) {\n          delete ntrack;\n          continue;\n        }\n        Double_t bfield[3] = {0,0,0};\n        ntrack->GetBxByBz(bfield);\n        AliExternalTrackParam exParam;\n        Bool_t relate = ntrack->RelateToVertexBxByBz(vtxSPD,bfield,kVeryBig,&exParam);\n        if (!relate) {\n          delete ntrack;\n          continue;\n        }\n        \/\/ set the constraint parameters to the track\n        ntrack->Set(exParam.GetX(),exParam.GetAlpha(),exParam.GetParameter(),exParam.GetCovariance());\n        if (ntrack->Pt()<=0) {\n          delete ntrack;\n          continue;\n        }\n\tif (fDoPropagation) \t\n\t  AliEMCALRecoUtils::ExtrapolateTrackToEMCalSurface(ntrack,fDist);\n        new ((*fTracks)[ntrnew++]) AliESDtrack(*ntrack);\n        delete ntrack;\n      }\n    } else { \/* no spd vtx constraint *\/\n      Int_t ntr = fEsdEv->GetNumberOfTracks();\n      for (Int_t i=0, ntrnew=0; i<ntr; ++i) {\n        AliESDtrack *etrack = fEsdEv->GetTrack(i);\n        if (!etrack)\n          continue;\n\tif ((fEsdTrackCuts!=0) && !fEsdTrackCuts->AcceptTrack(etrack))\n          continue;\n        AliESDtrack *ntrack = new ((*fTracks)[ntrnew++]) AliESDtrack(*etrack);\n\tif (fDoPropagation) \t\n\t  AliEMCALRecoUtils::ExtrapolateTrackToEMCalSurface(ntrack,fDist);\n      }\n    }\n\n  } else { \/\/ use hybrid track cuts\n\n    am->LoadBranch(\"Tracks\");\n    Int_t ntr = fEsdEv->GetNumberOfTracks();\n    for (Int_t i=0, ntrnew=0; i<ntr; ++i) {\n      AliESDtrack *etrack = fEsdEv->GetTrack(i);\n      if (!etrack) \n\tcontinue;\n\n      if (fEsdTrackCuts->AcceptTrack(etrack)) {\n\n        AliESDtrack *newTrack = new ((*fTracks)[ntrnew]) AliESDtrack(*etrack);\n\tif (fDoPropagation) \n\t  AliEMCALRecoUtils::ExtrapolateTrackToEMCalSurface(newTrack,fDist);\n        newTrack->SetBit(BIT(22),0); \n        newTrack->SetBit(BIT(23),0);\n        ++ntrnew;\n      } else if (fHybridTrackCuts->AcceptTrack(etrack)) {\n\n\tUInt_t status = etrack->GetStatus();\n        if (etrack->GetConstrainedParam() && (((status&AliESDtrack::kITSrefit)!=0) || fIncludeNoITS)) {\n          AliESDtrack *newTrack = new ((*fTracks)[ntrnew]) AliESDtrack(*etrack);\n          const AliExternalTrackParam* constrainParam = etrack->GetConstrainedParam();\n          newTrack->Set(constrainParam->GetX(),\n                        constrainParam->GetAlpha(),\n                        constrainParam->GetParameter(),\n                        constrainParam->GetCovariance());\n\t  if ((status&AliESDtrack::kITSrefit)==0) {\n            newTrack->SetBit(BIT(22),0); \/\/type 2\n            newTrack->SetBit(BIT(23),1);\n          } else {\n            newTrack->SetBit(BIT(22),1); \/\/type 1\n            newTrack->SetBit(BIT(23),0);\n          }\n\t  if (fDoPropagation) \t\n\t    AliEMCALRecoUtils::ExtrapolateTrackToEMCalSurface(newTrack,fDist);\n          ++ntrnew;\n\t}\n      }\n    }\n  }\n}\n<commit_msg>Add emcal propagation for track types for which it was forgotton. Effecs <0.1% of tracks in LHC11h.<commit_after>\/\/ $Id$\n\/\/\n\/\/ Task to filter Esd tracks and propagate to Emcal surface.\n\/\/\n\/\/ Author: C.Loizides\n\n#include \"AliEmcalEsdTrackFilterTask.h\"\n#include <TClonesArray.h>\n#include <TGeoGlobalMagField.h>\n#include <AliAnalysisManager.h>\n#include <AliEMCALRecoUtils.h>\n#include <AliESDEvent.h>\n#include <AliESDtrackCuts.h>\n#include <AliMagF.h>\n#include <AliTrackerBase.h>\n\nClassImp(AliEmcalEsdTrackFilterTask)\n\n\/\/________________________________________________________________________\nAliEmcalEsdTrackFilterTask::AliEmcalEsdTrackFilterTask() : \n  AliAnalysisTaskSE(\"AliEmcalEsdTrackFilterTask\"),\n  fEsdTrackCuts(0),\n  fDoSpdVtxCon(0),\n  fHybridTrackCuts(0),\n  fTracksName(),\n  fIncludeNoITS(kTRUE),\n  fDoPropagation(kFALSE),\n  fDist(440),\n  fEsdEv(0),\n  fTracks(0)\n{\n  \/\/ Constructor.\n}\n\n\/\/________________________________________________________________________\nAliEmcalEsdTrackFilterTask::AliEmcalEsdTrackFilterTask(const char *name) : \n  AliAnalysisTaskSE(name),\n  fEsdTrackCuts(0),\n  fDoSpdVtxCon(0),\n  fHybridTrackCuts(0),\n  fTracksName(\"EsdTracksOut\"),\n  fIncludeNoITS(kTRUE),\n  fDoPropagation(kFALSE),\n  fDist(440),\n  fEsdEv(0),\n  fTracks(0)\n{\n  \/\/ Constructor.\n\n  if (!name)\n    return;\n\n  SetName(name);\n\n  fBranchNames = \"ESD:AliESDHeader.,AliESDRun.,SPDVertex.,Tracks\";\n}\n\n\/\/________________________________________________________________________\nAliEmcalEsdTrackFilterTask::~AliEmcalEsdTrackFilterTask()\n{\n  \/\/Destructor\n\n  delete fEsdTrackCuts;\n}\n\n\/\/________________________________________________________________________\nvoid AliEmcalEsdTrackFilterTask::UserCreateOutputObjects()\n{\n  \/\/ Create histograms.\n\n  fTracks = new TClonesArray(\"AliESDtrack\");\n  fTracks->SetName(fTracksName);\n\n  if (fDoSpdVtxCon) {\n    if (!fEsdTrackCuts) {\n      AliInfo(\"No track cuts given, creating default (standard only TPC) cuts\");\n      fEsdTrackCuts = AliESDtrackCuts::GetStandardTPCOnlyTrackCuts();\n      fEsdTrackCuts->SetPtRange(0.15,1e3);\n    } \n  } else {\n    AliWarning(\"No track cuts given, but maybe this is indeed intended?\");\n  }\n}\n\n\/\/________________________________________________________________________\nvoid AliEmcalEsdTrackFilterTask::UserExec(Option_t *) \n{\n  \/\/ Main loop, called for each event.\n\n  fEsdEv = dynamic_cast<AliESDEvent*>(InputEvent());\n  if (!fEsdEv) {\n    AliError(\"Task works only on ESD events, returning\");\n    return;\n  }\n\n  AliAnalysisManager *am = AliAnalysisManager::GetAnalysisManager();\n  if (!am) {\n    AliError(\"Manager zero, returning\");\n    return;\n  }\n\n  \/\/ add tracks to event if not yet there\n  fTracks->Delete();\n  if (!(InputEvent()->FindListObject(fTracksName)))\n    InputEvent()->AddObject(fTracks);\n\n  if (!fHybridTrackCuts) { \/\/ contrain TPC tracks to SPD vertex if fDoSpdVtxCon==kTRUE\n    am->LoadBranch(\"AliESDRun.\");\n    am->LoadBranch(\"AliESDHeader.\");\n    am->LoadBranch(\"Tracks\");\n\n    if (fDoSpdVtxCon) {\n      if (!TGeoGlobalMagField::Instance()->GetField()) { \/\/ construct field map\n        fEsdEv->InitMagneticField();\n      }\n      am->LoadBranch(\"SPDVertex.\");\n      const AliESDVertex *vtxSPD = fEsdEv->GetPrimaryVertexSPD();\n      if (!vtxSPD) {\n        AliError(\"No SPD vertex, returning\");\n        return;\n      }\n      Int_t ntr = fEsdEv->GetNumberOfTracks();\n      for (Int_t i=0, ntrnew=0; i<ntr; ++i) {\n        AliESDtrack *etrack = fEsdEv->GetTrack(i);\n        if (!etrack)\n          continue;\n        if (!fEsdTrackCuts->AcceptTrack(etrack))\n          continue;\n        AliESDtrack *ntrack = AliESDtrackCuts::GetTPCOnlyTrack(fEsdEv,etrack->GetID());\n        if (!ntrack)\n          continue;\n        if (ntrack->Pt()<=0) {\n          delete ntrack;\n          continue;\n        }\n        Double_t bfield[3] = {0,0,0};\n        ntrack->GetBxByBz(bfield);\n        AliExternalTrackParam exParam;\n        Bool_t relate = ntrack->RelateToVertexBxByBz(vtxSPD,bfield,kVeryBig,&exParam);\n        if (!relate) {\n          delete ntrack;\n          continue;\n        }\n        \/\/ set the constraint parameters to the track\n        ntrack->Set(exParam.GetX(),exParam.GetAlpha(),exParam.GetParameter(),exParam.GetCovariance());\n        if (ntrack->Pt()<=0) {\n          delete ntrack;\n          continue;\n        }\n\tif (fDoPropagation) \t\n\t  AliEMCALRecoUtils::ExtrapolateTrackToEMCalSurface(ntrack,fDist);\n        new ((*fTracks)[ntrnew++]) AliESDtrack(*ntrack);\n        delete ntrack;\n      }\n    } else { \/* no spd vtx constraint *\/\n      Int_t ntr = fEsdEv->GetNumberOfTracks();\n      for (Int_t i=0, ntrnew=0; i<ntr; ++i) {\n        AliESDtrack *etrack = fEsdEv->GetTrack(i);\n        if (!etrack)\n          continue;\n\tif ((fEsdTrackCuts!=0) && !fEsdTrackCuts->AcceptTrack(etrack))\n          continue;\n        AliESDtrack *ntrack = new ((*fTracks)[ntrnew++]) AliESDtrack(*etrack);\n\tif (fDoPropagation) \t\n\t  AliEMCALRecoUtils::ExtrapolateTrackToEMCalSurface(ntrack,fDist);\n      }\n    }\n\n  } else { \/\/ use hybrid track cuts\n\n    am->LoadBranch(\"Tracks\");\n    Int_t ntr = fEsdEv->GetNumberOfTracks();\n    for (Int_t i=0, ntrnew=0; i<ntr; ++i) {\n      AliESDtrack *etrack = fEsdEv->GetTrack(i);\n      if (!etrack) \n\tcontinue;\n      if (fEsdTrackCuts->AcceptTrack(etrack)) {\n        AliESDtrack *newTrack = new ((*fTracks)[ntrnew]) AliESDtrack(*etrack);\n\tif (fDoPropagation) \n\t  AliEMCALRecoUtils::ExtrapolateTrackToEMCalSurface(newTrack,fDist);\n        newTrack->SetBit(BIT(22),0); \n        newTrack->SetBit(BIT(23),0);\n        ++ntrnew;\n      } else if (fHybridTrackCuts->AcceptTrack(etrack)) {\n\tif (!etrack->GetConstrainedParam())\n\t  continue;\n\tUInt_t status = etrack->GetStatus();\n\tif (!fIncludeNoITS && ((status&AliESDtrack::kITSrefit)==0))\n\t  continue;\n\tAliESDtrack *newTrack = new ((*fTracks)[ntrnew]) AliESDtrack(*etrack);\n\tif (fDoPropagation) \t\n\t  AliEMCALRecoUtils::ExtrapolateTrackToEMCalSurface(newTrack,fDist);\n\tconst AliExternalTrackParam* constrainParam = etrack->GetConstrainedParam();\n\tnewTrack->Set(constrainParam->GetX(),\n\t\t      constrainParam->GetAlpha(),\n\t\t      constrainParam->GetParameter(),\n\t\t      constrainParam->GetCovariance());\n\tif ((status&AliESDtrack::kITSrefit)==0) {\n\t  newTrack->SetBit(BIT(22),0); \/\/type 2\n\t  newTrack->SetBit(BIT(23),1);\n\t} else {\n\t  newTrack->SetBit(BIT(22),1); \/\/type 1\n\t  newTrack->SetBit(BIT(23),0);\n\t}\n\t++ntrnew;\n      }\n    }\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 \"CxxNativeModule.h\"\n#include \"Instance.h\"\n\n#include <folly\/json.h>\n#include <glog\/logging.h>\n#include <iterator>\n\n#include \"JsArgumentHelpers.h\"\n#include \"MessageQueueThread.h\"\n#include \"SystraceSection.h\"\n\nusing facebook::xplat::module::CxxModule;\nnamespace facebook {\nnamespace react {\n\nstd::function<void(folly::dynamic)> makeCallback(\n    std::weak_ptr<Instance> instance,\n    const folly::dynamic &callbackId) {\n  if (!callbackId.isNumber()) {\n    throw std::invalid_argument(\"Expected callback(s) as final argument\");\n  }\n\n  auto id = callbackId.asInt();\n  return [winstance = std::move(instance), id](folly::dynamic args) {\n    if (auto instance = winstance.lock()) {\n      instance->callJSCallback(id, std::move(args));\n    }\n  };\n}\n\nnamespace {\n\n\/**\n * CxxModule::Callback accepts a vector<dynamic>, makeCallback returns\n * a callback that accepts a dynamic, adapt the second into the first.\n * TODO: Callback types should be made equal (preferably\n * function<void(dynamic)>) to avoid the extra copy and indirect call.\n *\/\nCxxModule::Callback convertCallback(\n    std::function<void(folly::dynamic)> callback) {\n  return [callback = std::move(callback)](std::vector<folly::dynamic> args) {\n    callback(folly::dynamic(\n        std::make_move_iterator(args.begin()),\n        std::make_move_iterator(args.end())));\n  };\n}\n\n} \/\/ namespace\n\nstd::string CxxNativeModule::getName() {\n  return name_;\n}\n\nstd::vector<MethodDescriptor> CxxNativeModule::getMethods() {\n  lazyInit();\n\n  std::vector<MethodDescriptor> descs;\n  for (auto &method : methods_) {\n    descs.emplace_back(method.name, method.getType());\n  }\n  return descs;\n}\n\nfolly::dynamic CxxNativeModule::getConstants() {\n  lazyInit();\n\n  if (!module_) {\n    return nullptr;\n  }\n\n  folly::dynamic constants = folly::dynamic::object();\n  for (auto &pair : module_->getConstants()) {\n    constants.insert(std::move(pair.first), std::move(pair.second));\n  }\n  return constants;\n}\n\nvoid CxxNativeModule::invoke(\n    unsigned int reactMethodId,\n    folly::dynamic &&params,\n    int callId) {\n  if (reactMethodId >= methods_.size()) {\n    throw std::invalid_argument(folly::to<std::string>(\n        \"methodId \",\n        reactMethodId,\n        \" out of range [0..\",\n        methods_.size(),\n        \"]\"));\n  }\n  if (!params.isArray()) {\n    throw std::invalid_argument(folly::to<std::string>(\n        \"method parameters should be array, but are \", params.typeName()));\n  }\n\n  CxxModule::Callback first;\n  CxxModule::Callback second;\n\n  const auto &method = methods_[reactMethodId];\n\n  if (!method.func) {\n    throw std::runtime_error(folly::to<std::string>(\n        \"Method \", method.name, \" is synchronous but invoked asynchronously\"));\n  }\n\n  if (params.size() < method.callbacks) {\n    throw std::invalid_argument(folly::to<std::string>(\n        \"Expected \",\n        method.callbacks,\n        \" callbacks, but only \",\n        params.size(),\n        \" parameters provided\"));\n  }\n\n  if (method.callbacks == 1) {\n    first = convertCallback(makeCallback(instance_, params[params.size() - 1]));\n  } else if (method.callbacks == 2) {\n    first = convertCallback(makeCallback(instance_, params[params.size() - 2]));\n    second =\n        convertCallback(makeCallback(instance_, params[params.size() - 1]));\n  }\n\n  params.resize(params.size() - method.callbacks);\n\n  \/\/ I've got a few flawed options here.  I can let the C++ exception\n  \/\/ propagate, and the registry will log\/convert them to java exceptions.\n  \/\/ This lets all the java and red box handling work ok, but the only info I\n  \/\/ can capture about the C++ exception is the what() string, not the stack.\n  \/\/ I can std::terminate() the app.  This causes the full, accurate C++\n  \/\/ stack trace to be added to logcat by debuggerd.  The java state is lost,\n  \/\/ but in practice, the java stack is always the same in this case since\n  \/\/ the javascript stack is not visible, and the crash is unfriendly to js\n  \/\/ developers, but crucial to C++ developers.  The what() value is also\n  \/\/ lost.  Finally, I can catch, log the java stack, then rethrow the C++\n  \/\/ exception.  In this case I get java and C++ stack data, but the C++\n  \/\/ stack is as of the rethrow, not the original throw, both the C++ and\n  \/\/ java stacks always look the same.\n  \/\/\n  \/\/ I am going with option 2, since that seems like the most useful\n  \/\/ choice.  It would be nice to be able to get what() and the C++\n  \/\/ stack.  I'm told that will be possible in the future.  TODO\n  \/\/ mhorowitz #7128529: convert C++ exceptions to Java\n\n  messageQueueThread_->runOnQueue(\n      [method, params = std::move(params), first, second, callId]() {\n#ifdef WITH_FBSYSTRACE\n        if (callId != -1) {\n          fbsystrace_end_async_flow(TRACE_TAG_REACT_APPS, \"native\", callId);\n        }\n#else\n        (void)(callId);\n#endif\n        SystraceSection s(method.name.c_str());\n        try {\n          method.func(std::move(params), first, second);\n        } catch (const facebook::xplat::JsArgumentException &ex) {\n          throw;\n        } catch (std::exception &e) {\n          LOG(ERROR) << \"std::exception. Method call \" << method.name.c_str()\n                     << \" failed: \" << e.what();\n          std::terminate();\n        } catch (std::string &error) {\n          LOG(ERROR) << \"std::string. Method call \" << method.name.c_str()\n                     << \" failed: \" << error.c_str();\n          std::terminate();\n        } catch (...) {\n          LOG(ERROR) << \"Method call \" << method.name.c_str()\n                     << \" failed. unknown error\";\n          std::terminate();\n        }\n      });\n}\n\nMethodCallResult CxxNativeModule::callSerializableNativeHook(\n    unsigned int hookId,\n    folly::dynamic &&args) {\n  if (hookId >= methods_.size()) {\n    throw std::invalid_argument(folly::to<std::string>(\n        \"methodId \", hookId, \" out of range [0..\", methods_.size(), \"]\"));\n  }\n\n  const auto &method = methods_[hookId];\n\n  if (!method.syncFunc) {\n    throw std::runtime_error(folly::to<std::string>(\n        \"Method \", method.name, \" is asynchronous but invoked synchronously\"));\n  }\n\n  return method.syncFunc(std::move(args));\n}\n\nvoid CxxNativeModule::lazyInit() {\n  if (module_ || !provider_) {\n    return;\n  }\n\n  \/\/ TODO 17216751: providers should never return null modules\n  module_ = provider_();\n  provider_ = nullptr;\n  if (module_) {\n    methods_ = module_->getMethods();\n    module_->setInstance(instance_);\n  }\n}\n\n} \/\/ namespace react\n} \/\/ namespace facebook\n<commit_msg>Make Lambda function called in NativeModule mutable to improve performance (#28297)<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 \"CxxNativeModule.h\"\n#include \"Instance.h\"\n\n#include <folly\/json.h>\n#include <glog\/logging.h>\n#include <iterator>\n\n#include \"JsArgumentHelpers.h\"\n#include \"MessageQueueThread.h\"\n#include \"SystraceSection.h\"\n\nusing facebook::xplat::module::CxxModule;\nnamespace facebook {\nnamespace react {\n\nstd::function<void(folly::dynamic)> makeCallback(\n    std::weak_ptr<Instance> instance,\n    const folly::dynamic &callbackId) {\n  if (!callbackId.isNumber()) {\n    throw std::invalid_argument(\"Expected callback(s) as final argument\");\n  }\n\n  auto id = callbackId.asInt();\n  return [winstance = std::move(instance), id](folly::dynamic args) {\n    if (auto instance = winstance.lock()) {\n      instance->callJSCallback(id, std::move(args));\n    }\n  };\n}\n\nnamespace {\n\n\/**\n * CxxModule::Callback accepts a vector<dynamic>, makeCallback returns\n * a callback that accepts a dynamic, adapt the second into the first.\n * TODO: Callback types should be made equal (preferably\n * function<void(dynamic)>) to avoid the extra copy and indirect call.\n *\/\nCxxModule::Callback convertCallback(\n    std::function<void(folly::dynamic)> callback) {\n  return [callback = std::move(callback)](std::vector<folly::dynamic> args) {\n    callback(folly::dynamic(\n        std::make_move_iterator(args.begin()),\n        std::make_move_iterator(args.end())));\n  };\n}\n\n} \/\/ namespace\n\nstd::string CxxNativeModule::getName() {\n  return name_;\n}\n\nstd::vector<MethodDescriptor> CxxNativeModule::getMethods() {\n  lazyInit();\n\n  std::vector<MethodDescriptor> descs;\n  for (auto &method : methods_) {\n    descs.emplace_back(method.name, method.getType());\n  }\n  return descs;\n}\n\nfolly::dynamic CxxNativeModule::getConstants() {\n  lazyInit();\n\n  if (!module_) {\n    return nullptr;\n  }\n\n  folly::dynamic constants = folly::dynamic::object();\n  for (auto &pair : module_->getConstants()) {\n    constants.insert(std::move(pair.first), std::move(pair.second));\n  }\n  return constants;\n}\n\nvoid CxxNativeModule::invoke(\n    unsigned int reactMethodId,\n    folly::dynamic &&params,\n    int callId) {\n  if (reactMethodId >= methods_.size()) {\n    throw std::invalid_argument(folly::to<std::string>(\n        \"methodId \",\n        reactMethodId,\n        \" out of range [0..\",\n        methods_.size(),\n        \"]\"));\n  }\n  if (!params.isArray()) {\n    throw std::invalid_argument(folly::to<std::string>(\n        \"method parameters should be array, but are \", params.typeName()));\n  }\n\n  CxxModule::Callback first;\n  CxxModule::Callback second;\n\n  const auto &method = methods_[reactMethodId];\n\n  if (!method.func) {\n    throw std::runtime_error(folly::to<std::string>(\n        \"Method \", method.name, \" is synchronous but invoked asynchronously\"));\n  }\n\n  if (params.size() < method.callbacks) {\n    throw std::invalid_argument(folly::to<std::string>(\n        \"Expected \",\n        method.callbacks,\n        \" callbacks, but only \",\n        params.size(),\n        \" parameters provided\"));\n  }\n\n  if (method.callbacks == 1) {\n    first = convertCallback(makeCallback(instance_, params[params.size() - 1]));\n  } else if (method.callbacks == 2) {\n    first = convertCallback(makeCallback(instance_, params[params.size() - 2]));\n    second =\n        convertCallback(makeCallback(instance_, params[params.size() - 1]));\n  }\n\n  params.resize(params.size() - method.callbacks);\n\n  \/\/ I've got a few flawed options here.  I can let the C++ exception\n  \/\/ propagate, and the registry will log\/convert them to java exceptions.\n  \/\/ This lets all the java and red box handling work ok, but the only info I\n  \/\/ can capture about the C++ exception is the what() string, not the stack.\n  \/\/ I can std::terminate() the app.  This causes the full, accurate C++\n  \/\/ stack trace to be added to logcat by debuggerd.  The java state is lost,\n  \/\/ but in practice, the java stack is always the same in this case since\n  \/\/ the javascript stack is not visible, and the crash is unfriendly to js\n  \/\/ developers, but crucial to C++ developers.  The what() value is also\n  \/\/ lost.  Finally, I can catch, log the java stack, then rethrow the C++\n  \/\/ exception.  In this case I get java and C++ stack data, but the C++\n  \/\/ stack is as of the rethrow, not the original throw, both the C++ and\n  \/\/ java stacks always look the same.\n  \/\/\n  \/\/ I am going with option 2, since that seems like the most useful\n  \/\/ choice.  It would be nice to be able to get what() and the C++\n  \/\/ stack.  I'm told that will be possible in the future.  TODO\n  \/\/ mhorowitz #7128529: convert C++ exceptions to Java\n\n  messageQueueThread_->runOnQueue(\n      [method, params = std::move(params), first, second, callId]() mutable {\n#ifdef WITH_FBSYSTRACE\n        if (callId != -1) {\n          fbsystrace_end_async_flow(TRACE_TAG_REACT_APPS, \"native\", callId);\n        }\n#else\n        (void)(callId);\n#endif\n        SystraceSection s(method.name.c_str());\n        try {\n          method.func(std::move(params), first, second);\n        } catch (const facebook::xplat::JsArgumentException &ex) {\n          throw;\n        } catch (std::exception &e) {\n          LOG(ERROR) << \"std::exception. Method call \" << method.name.c_str()\n                     << \" failed: \" << e.what();\n          std::terminate();\n        } catch (std::string &error) {\n          LOG(ERROR) << \"std::string. Method call \" << method.name.c_str()\n                     << \" failed: \" << error.c_str();\n          std::terminate();\n        } catch (...) {\n          LOG(ERROR) << \"Method call \" << method.name.c_str()\n                     << \" failed. unknown error\";\n          std::terminate();\n        }\n      });\n}\n\nMethodCallResult CxxNativeModule::callSerializableNativeHook(\n    unsigned int hookId,\n    folly::dynamic &&args) {\n  if (hookId >= methods_.size()) {\n    throw std::invalid_argument(folly::to<std::string>(\n        \"methodId \", hookId, \" out of range [0..\", methods_.size(), \"]\"));\n  }\n\n  const auto &method = methods_[hookId];\n\n  if (!method.syncFunc) {\n    throw std::runtime_error(folly::to<std::string>(\n        \"Method \", method.name, \" is asynchronous but invoked synchronously\"));\n  }\n\n  return method.syncFunc(std::move(args));\n}\n\nvoid CxxNativeModule::lazyInit() {\n  if (module_ || !provider_) {\n    return;\n  }\n\n  \/\/ TODO 17216751: providers should never return null modules\n  module_ = provider_();\n  provider_ = nullptr;\n  if (module_) {\n    methods_ = module_->getMethods();\n    module_->setInstance(instance_);\n  }\n}\n\n} \/\/ namespace react\n} \/\/ namespace facebook\n<|endoftext|>"}
{"text":"<commit_before>#include \"Scene.h\"\n#include \"Director.h\"\n\n#include \"EngineShaderFactory.hpp\"\n#include \"FontLoader.h\"\n\nusing namespace Core;\nusing namespace std;\nusing namespace Structure;\nusing namespace Rendering;\n\nScene::Scene(void) : \n\t_cameraMgr(nullptr), _shaderMgr(nullptr), _textureMgr(nullptr), \n\t_materialMgr(nullptr), _meshImporter(nullptr), \t_uiManager(nullptr),\n\t_bufferManager(nullptr), _originObjMgr(nullptr), _renderMgr(nullptr),\n\t_uiCamera(nullptr), _backBufferMaker(nullptr)\n{\n\t_state = State::Init;\n}\n\nScene::~Scene(void)\n{\n\tDestroy();\n}\n\nvoid Scene::Initialize()\n{\n\t_shaderMgr\t\t= new Manager::ShaderManager;\n\t_textureMgr\t\t= new Manager::TextureManager;\n\t_materialMgr\t= new Manager::MaterialManager;\n\t_meshImporter\t= new Importer::MeshImporter;\n\t_bufferManager\t= new Manager::BufferManager;\n\t_originObjMgr\t= new Core::ObjectManager;\n\n\t_cameraMgr\t\t= new Manager::CameraManager;\n\t_cameraMgr->InitLightCulling();\n\n\t_renderMgr\t\t= new Manager::RenderManager;\n\t_renderMgr->Init();\n\n\t_uiManager\t\t= new UI::Manager::UIManager;\n\t_uiCamera\t\t= new Camera::UICamera;\n\t_uiCamera->Initialize();\n\n\t_dx\t\t\t\t= Device::Director::GetInstance()->GetDirectX();\n\n\t_backBufferMaker = new PostProcessing::BackBufferMaker;\n\t_backBufferMaker->Initialize();\n\n\tNextState();\n\tOnInitialize();\n}\n\nvoid Scene::Update(float dt)\n{\n\tOnUpdate(dt);\n\n\tauto end = _rootObjects.GetVector().end();\n\tfor(auto iter = _rootObjects.GetVector().begin(); iter != end; ++iter)\n\t\tGET_CONTENT_FROM_ITERATOR(iter)->Update(dt);\n\n\t_uiCamera->Update(dt);\n}\n\nvoid Scene::RenderPreview()\n{\n\tOnRenderPreview();\n\n\tauto CamIteration = [&](Camera::Camera* cam)\n\t{\n\t\tcam->UpdateTransformCBAndCheckRender(_rootObjects);\n\t};\n\n\t_cameraMgr->IterateContent(CamIteration);\n}\n\nvoid Scene::Render()\n{\n#ifndef DEPRECATED_MESH_RENDERER\n\tauto CamIteration = [&](Camera::Camera* cam)\n\t{\n\t\tcam->Render();\n\t};\n\t_cameraMgr->IterateContent(CamIteration);\n\n#endif\n\t\n\tID3D11DeviceContext* context = _dx->GetContext();\n\t\/\/Turn off depth writing\n\tcontext->OMSetDepthStencilState(_dx->GetDepthDisableDepthTestState(), 0);\n\t\n\t_uiCamera->Render();\n\n\tCamera::Camera* mainCam = _cameraMgr->GetMainCamera();\n\t_backBufferMaker->Render(mainCam, _uiCamera);\n\n\t\/\/swap\n\t_dx->GetSwapChain()->Present(0, 0);\n\n\tOnRenderPost();\n}\n\nvoid Scene::Destroy()\n{\n\tUI::FontLoader::GetInstance()->Destroy();\n\n\tSAFE_DELETE(_cameraMgr);\n\tSAFE_DELETE(_shaderMgr);\n\tSAFE_DELETE(_textureMgr);\n\tSAFE_DELETE(_materialMgr);\n\tSAFE_DELETE(_meshImporter);\n\tSAFE_DELETE(_bufferManager);\n\tSAFE_DELETE(_originObjMgr);\n\tSAFE_DELETE(_renderMgr);\n\tSAFE_DELETE(_uiCamera);\n\tSAFE_DELETE(_uiManager);\n\tSAFE_DELETE(_backBufferMaker);\n\n\tOnDestroy();\n}\n\nvoid Scene::NextState()\n{\n\t_state = (State)(((int)_state + 1) % (int)State::Num);\n}\n\nCore::Object* Scene::AddObject(Core::Object* object, bool clone)\n{\n\treturn _rootObjects.Add(object->GetName(), object, clone);\n}\n\nvoid Scene::Input(const Device::Win32::Mouse& mouse, const  Device::Win32::Keyboard& keyboard)\n{\n\tif(_state == State::Loop)\n\t\tOnInput(mouse, keyboard);\n}<commit_msg>Scene - 호출 함수 이름 변경으로  인한 코드 수정 #51<commit_after>#include \"Scene.h\"\n#include \"Director.h\"\n\n#include \"EngineShaderFactory.hpp\"\n#include \"FontLoader.h\"\n\nusing namespace Core;\nusing namespace std;\nusing namespace Structure;\nusing namespace Rendering;\n\nScene::Scene(void) : \n\t_cameraMgr(nullptr), _shaderMgr(nullptr), _textureMgr(nullptr), \n\t_materialMgr(nullptr), _meshImporter(nullptr), \t_uiManager(nullptr),\n\t_bufferManager(nullptr), _originObjMgr(nullptr), _renderMgr(nullptr),\n\t_uiCamera(nullptr), _backBufferMaker(nullptr)\n{\n\t_state = State::Init;\n}\n\nScene::~Scene(void)\n{\n\tDestroy();\n}\n\nvoid Scene::Initialize()\n{\n\t_shaderMgr\t\t= new Manager::ShaderManager;\n\t_textureMgr\t\t= new Manager::TextureManager;\n\t_materialMgr\t= new Manager::MaterialManager;\n\t_meshImporter\t= new Importer::MeshImporter;\n\t_bufferManager\t= new Manager::BufferManager;\n\t_originObjMgr\t= new Core::ObjectManager;\n\n\t_cameraMgr\t\t= new Manager::CameraManager;\n\t_cameraMgr->InitLightCulling();\n\n\t_renderMgr\t\t= new Manager::RenderManager;\n\t_renderMgr->Init();\n\n\t_uiManager\t\t= new UI::Manager::UIManager;\n\t_uiCamera\t\t= new Camera::UICamera;\n\t_uiCamera->Initialize();\n\n\t_dx\t\t\t\t= Device::Director::GetInstance()->GetDirectX();\n\n\t_backBufferMaker = new PostProcessing::BackBufferMaker;\n\t_backBufferMaker->Initialize();\n\n\tNextState();\n\tOnInitialize();\n}\n\nvoid Scene::Update(float dt)\n{\n\tOnUpdate(dt);\n\n\tauto end = _rootObjects.GetVector().end();\n\tfor(auto iter = _rootObjects.GetVector().begin(); iter != end; ++iter)\n\t\tGET_CONTENT_FROM_ITERATOR(iter)->Update(dt);\n\n\t_uiCamera->Update(dt);\n}\n\nvoid Scene::RenderPreview()\n{\n\tOnRenderPreview();\n\n\tauto CamIteration = [&](Camera::Camera* cam)\n\t{\n\t\tcam->RenderPreviewWithUpdateTransformCB(_rootObjects);\n\t};\n\n\t_cameraMgr->IterateContent(CamIteration);\n}\n\nvoid Scene::Render()\n{\n#ifndef DEPRECATED_MESH_RENDERER\n\tauto CamIteration = [&](Camera::Camera* cam)\n\t{\n\t\tcam->Render();\n\t};\n\t_cameraMgr->IterateContent(CamIteration);\n\n#endif\n\t\n\tID3D11DeviceContext* context = _dx->GetContext();\n\t\/\/Turn off depth writing\n\tcontext->OMSetDepthStencilState(_dx->GetDepthDisableDepthTestState(), 0);\n\t\n\t_uiCamera->Render();\n\n\tCamera::Camera* mainCam = _cameraMgr->GetMainCamera();\n\t_backBufferMaker->Render(mainCam, _uiCamera);\n\n\t\/\/swap\n\t_dx->GetSwapChain()->Present(0, 0);\n\n\tOnRenderPost();\n}\n\nvoid Scene::Destroy()\n{\n\tUI::FontLoader::GetInstance()->Destroy();\n\n\tSAFE_DELETE(_cameraMgr);\n\tSAFE_DELETE(_shaderMgr);\n\tSAFE_DELETE(_textureMgr);\n\tSAFE_DELETE(_materialMgr);\n\tSAFE_DELETE(_meshImporter);\n\tSAFE_DELETE(_bufferManager);\n\tSAFE_DELETE(_originObjMgr);\n\tSAFE_DELETE(_renderMgr);\n\tSAFE_DELETE(_uiCamera);\n\tSAFE_DELETE(_uiManager);\n\tSAFE_DELETE(_backBufferMaker);\n\n\tOnDestroy();\n}\n\nvoid Scene::NextState()\n{\n\t_state = (State)(((int)_state + 1) % (int)State::Num);\n}\n\nCore::Object* Scene::AddObject(Core::Object* object, bool clone)\n{\n\treturn _rootObjects.Add(object->GetName(), object, clone);\n}\n\nvoid Scene::Input(const Device::Win32::Mouse& mouse, const  Device::Win32::Keyboard& keyboard)\n{\n\tif(_state == State::Loop)\n\t\tOnInput(mouse, keyboard);\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n *  Copyright (c) 2013-2014, Filippo Basso <bassofil@dei.unipd.it>\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 *     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(s) 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 <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#ifndef IMPL_CALIBRATION_COMMON_CERES_PLANE_FIT_HPP_\n#define IMPL_CALIBRATION_COMMON_CERES_PLANE_FIT_HPP_\n\n#include <calibration_common\/ceres\/plane_fit.h>\n#include <Eigen\/Eigenvalues>\n\n#include <ceres\/ceres.h>\n\nnamespace calibration\n{\n\ntemplate <typename ScalarT_>\n  typename Types<ScalarT_>::Plane PlaneFit<ScalarT_>::fit(const typename Types<ScalarT_>::Cloud3 & points)\n  {\n\n\/\/    typename Types<ScalarT_>::Point3 centroid = points.container().rowwise().mean();\n\/\/    typename Types<ScalarT_>::Cloud3::Container diff = points.container().colwise() - centroid;\n\/\/    Eigen::Matrix<ScalarT_, 3, 3> covariance_matrix = diff * diff.transpose() \/ ScalarT_(points.elements() - 1);\n\n    typename Types<ScalarT_>::Point3 centroid = Types<ScalarT_>::Point3::Zero();\n    typename Types<ScalarT_>::Cloud3::Container diff(3, points.elements());\n    Size1 count = 0;\n    for (Size1 i = 0; i < points.elements(); ++i)\n    {\n      if (points[i].allFinite())\n      {\n        centroid += points[i];\n        diff.col(count++) = points[i];\n      }\n    }\n    centroid \/= count;\n    diff.resize(3, count);\n    diff.colwise() -= centroid;\n    Eigen::Matrix<ScalarT_, 3, 3> covariance_matrix = diff * diff.transpose() \/ ScalarT_(count - 1);\n\n    Eigen::SelfAdjointEigenSolver<Eigen::Matrix<ScalarT_, 3, 3> > solver(covariance_matrix, Eigen::ComputeEigenvectors);\n    typename Types<ScalarT_>::Point3 eigen_vector = solver.eigenvectors().col(0);\n    return typename Types<ScalarT_>::Plane(eigen_vector, -eigen_vector.dot(centroid));\n\n  }\n\ntemplate <typename ScalarT_>\n  typename Types<ScalarT_>::Plane PlaneFit<ScalarT_>::robustFit(const typename Types<ScalarT_>::Plane & initial_plane,\n                                                                const typename Types<ScalarT_>::Cloud3 & points,\n                                                                ScalarT_ scale)\n  {\n    ceres::Problem problem;\n    typename Types<ScalarT_>::Plane plane(initial_plane);\n\n    for (Size1 i = 0; i < points.elements(); ++i)\n    {\n      ceres::CostFunction * cost_function =\n        new ceres::AutoDiffCostFunction<PlaneResidual<ScalarT_>, 1, 4>(new PlaneResidual<ScalarT_>(points[i]));\n      problem.AddResidualBlock(cost_function, new ceres::CauchyLoss(scale), plane.coeffs().data());\n    }\n\n    ceres::Solver::Options options;\n    options.linear_solver_type = ceres::DENSE_QR;\n\/\/    options.minimizer_progress_to_stdout = true;\n\n    ceres::Solver::Summary summary;\n    ceres::Solve(options, &problem, &summary);\n\n    return plane;\n  }\n\n} \/* namespace calibration *\/\n#endif \/* IMPL_CALIBRATION_COMMON_CERES_PLANE_FIT_HPP_ *\/\n<commit_msg>Added assert on minimum number of points.<commit_after>\/*\n *  Copyright (c) 2013-2014, Filippo Basso <bassofil@dei.unipd.it>\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 *     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(s) 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 <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#ifndef IMPL_CALIBRATION_COMMON_CERES_PLANE_FIT_HPP_\n#define IMPL_CALIBRATION_COMMON_CERES_PLANE_FIT_HPP_\n\n#include <calibration_common\/ceres\/plane_fit.h>\n#include <Eigen\/Eigenvalues>\n\n#include <ceres\/ceres.h>\n\nnamespace calibration\n{\n\ntemplate <typename ScalarT_>\n  typename Types<ScalarT_>::Plane PlaneFit<ScalarT_>::fit(const typename Types<ScalarT_>::Cloud3 & points)\n  {\n    assert(points.elements() > 1);\n\/\/    typename Types<ScalarT_>::Point3 centroid = points.container().rowwise().mean();\n\/\/    typename Types<ScalarT_>::Cloud3::Container diff = points.container().colwise() - centroid;\n\/\/    Eigen::Matrix<ScalarT_, 3, 3> covariance_matrix = diff * diff.transpose() \/ ScalarT_(points.elements() - 1);\n\n    typename Types<ScalarT_>::Point3 centroid = Types<ScalarT_>::Point3::Zero();\n    typename Types<ScalarT_>::Cloud3::Container diff(3, points.elements());\n    Size1 count = 0;\n    for (Size1 i = 0; i < points.elements(); ++i)\n    {\n      if (points[i].allFinite())\n      {\n        centroid += points[i];\n        diff.col(count++) = points[i];\n      }\n    }\n    centroid \/= count;\n    diff.resize(3, count);\n    diff.colwise() -= centroid;\n\n    Eigen::Matrix<ScalarT_, 3, 3> covariance_matrix = diff * diff.transpose() \/ ScalarT_(count - 1);\n    Eigen::SelfAdjointEigenSolver<Eigen::Matrix<ScalarT_, 3, 3> > solver(covariance_matrix, Eigen::ComputeEigenvectors);\n\n    typename Types<ScalarT_>::Point3 eigen_vector = solver.eigenvectors().col(0);\n    return typename Types<ScalarT_>::Plane(eigen_vector, -eigen_vector.dot(centroid));\n  }\n\ntemplate <typename ScalarT_>\n  typename Types<ScalarT_>::Plane PlaneFit<ScalarT_>::robustFit(const typename Types<ScalarT_>::Plane & initial_plane,\n                                                                const typename Types<ScalarT_>::Cloud3 & points,\n                                                                ScalarT_ scale)\n  {\n    ceres::Problem problem;\n    typename Types<ScalarT_>::Plane plane(initial_plane);\n\n    for (Size1 i = 0; i < points.elements(); ++i)\n    {\n      ceres::CostFunction * cost_function =\n        new ceres::AutoDiffCostFunction<PlaneResidual<ScalarT_>, 1, 4>(new PlaneResidual<ScalarT_>(points[i]));\n      problem.AddResidualBlock(cost_function, new ceres::CauchyLoss(scale), plane.coeffs().data());\n    }\n\n    ceres::Solver::Options options;\n    options.linear_solver_type = ceres::DENSE_QR;\n\/\/    options.minimizer_progress_to_stdout = true;\n\n    ceres::Solver::Summary summary;\n    ceres::Solve(options, &problem, &summary);\n\n    return plane;\n  }\n\n} \/* namespace calibration *\/\n#endif \/* IMPL_CALIBRATION_COMMON_CERES_PLANE_FIT_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\/extensions\/api\/messaging\/native_message_process_host.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/files\/file_path.h\"\n#include \"base\/logging.h\"\n#include \"base\/process\/kill.h\"\n#include \"base\/threading\/sequenced_worker_pool.h\"\n#include \"chrome\/browser\/extensions\/api\/messaging\/native_messaging_host_manifest.h\"\n#include \"chrome\/browser\/extensions\/api\/messaging\/native_process_launcher.h\"\n#include \"chrome\/common\/chrome_version_info.h\"\n#include \"content\/public\/browser\/browser_thread.h\"\n#include \"extensions\/common\/constants.h\"\n#include \"extensions\/common\/features\/feature.h\"\n#include \"net\/base\/file_stream.h\"\n#include \"net\/base\/io_buffer.h\"\n#include \"net\/base\/net_errors.h\"\n#include \"net\/base\/net_util.h\"\n#include \"url\/gurl.h\"\n\nnamespace {\n\n\/\/ Maximum message size in bytes for messages received from Native Messaging\n\/\/ hosts. Message size is limited mainly to prevent Chrome from crashing when\n\/\/ native application misbehaves (e.g. starts writing garbage to the pipe).\nconst size_t kMaximumMessageSize = 1024 * 1024;\n\n\/\/ Message header contains 4-byte integer size of the message.\nconst size_t kMessageHeaderSize = 4;\n\n\/\/ Size of the buffer to be allocated for each read.\nconst size_t kReadBufferSize = 4096;\n\n}  \/\/ namespace\n\nnamespace extensions {\n\nNativeMessageProcessHost::NativeMessageProcessHost(\n    const std::string& source_extension_id,\n    const std::string& native_host_name,\n    scoped_ptr<NativeProcessLauncher> launcher)\n    : source_extension_id_(source_extension_id),\n      native_host_name_(native_host_name),\n      launcher_(launcher.Pass()),\n      closed_(false),\n      process_handle_(base::kNullProcessHandle),\n#if defined(OS_POSIX)\n      read_file_(-1),\n#endif\n      read_pending_(false),\n      write_pending_(false) {\n  DCHECK_CURRENTLY_ON(content::BrowserThread::UI);\n\n  task_runner_ = content::BrowserThread::GetMessageLoopProxyForThread(\n      content::BrowserThread::IO);\n  \/\/ It's safe to use base::Unretained() here because NativeMessagePort always\n  \/\/ deletes us on the IO thread.\n  task_runner_->PostTask(\n      FROM_HERE,\n      base::Bind(&NativeMessageProcessHost::LaunchHostProcess,\n                 base::Unretained(this)));\n}\n\nNativeMessageProcessHost::~NativeMessageProcessHost() {\n  DCHECK(task_runner_->BelongsToCurrentThread());\n}\n\n\/\/ static\nscoped_ptr<NativeMessageHost> NativeMessageHost::Create(\n    gfx::NativeView native_view,\n    const std::string& source_extension_id,\n    const std::string& native_host_name,\n    bool allow_user_level,\n    std::string* error_message) {\n  return NativeMessageProcessHost::CreateWithLauncher(\n      source_extension_id,\n      native_host_name,\n      NativeProcessLauncher::CreateDefault(allow_user_level, native_view));\n}\n\n\/\/ static\nscoped_ptr<NativeMessageHost> NativeMessageProcessHost::CreateWithLauncher(\n    const std::string& source_extension_id,\n    const std::string& native_host_name,\n    scoped_ptr<NativeProcessLauncher> launcher) {\n  DCHECK_CURRENTLY_ON(content::BrowserThread::UI);\n\n  scoped_ptr<NativeMessageHost> process(\n      new NativeMessageProcessHost(source_extension_id,\n                                   native_host_name,\n                                   launcher.Pass()));\n\n  return process.Pass();\n}\n\nvoid NativeMessageProcessHost::LaunchHostProcess() {\n  DCHECK(task_runner_->BelongsToCurrentThread());\n\n  GURL origin(std::string(kExtensionScheme) + \":\/\/\" + source_extension_id_);\n  launcher_->Launch(origin, native_host_name_,\n                    base::Bind(&NativeMessageProcessHost::OnHostProcessLaunched,\n                               base::Unretained(this)));\n}\n\nvoid NativeMessageProcessHost::OnHostProcessLaunched(\n    NativeProcessLauncher::LaunchResult result,\n    base::ProcessHandle process_handle,\n    base::File read_file,\n    base::File write_file) {\n  DCHECK(task_runner_->BelongsToCurrentThread());\n\n  switch (result) {\n    case NativeProcessLauncher::RESULT_INVALID_NAME:\n      Close(kInvalidNameError);\n      return;\n    case NativeProcessLauncher::RESULT_NOT_FOUND:\n      Close(kNotFoundError);\n      return;\n    case NativeProcessLauncher::RESULT_FORBIDDEN:\n      Close(kForbiddenError);\n      return;\n    case NativeProcessLauncher::RESULT_FAILED_TO_START:\n      Close(kFailedToStartError);\n      return;\n    case NativeProcessLauncher::RESULT_SUCCESS:\n      break;\n  }\n\n  process_handle_ = process_handle;\n#if defined(OS_POSIX)\n  \/\/ This object is not the owner of the file so it should not keep an fd.\n  read_file_ = read_file.GetPlatformFile();\n#endif\n\n  scoped_refptr<base::TaskRunner> task_runner(\n      content::BrowserThread::GetBlockingPool()->\n          GetTaskRunnerWithShutdownBehavior(\n              base::SequencedWorkerPool::SKIP_ON_SHUTDOWN));\n\n  read_stream_.reset(new net::FileStream(read_file.Pass(), task_runner));\n  write_stream_.reset(new net::FileStream(write_file.Pass(), task_runner));\n\n  WaitRead();\n  DoWrite();\n}\n\nvoid NativeMessageProcessHost::OnMessage(const std::string& json) {\n  DCHECK(task_runner_->BelongsToCurrentThread());\n\n  if (closed_)\n    return;\n\n  \/\/ Allocate new buffer for the message.\n  scoped_refptr<net::IOBufferWithSize> buffer =\n      new net::IOBufferWithSize(json.size() + kMessageHeaderSize);\n\n  \/\/ Copy size and content of the message to the buffer.\n  COMPILE_ASSERT(sizeof(uint32) == kMessageHeaderSize, incorrect_header_size);\n  *reinterpret_cast<uint32*>(buffer->data()) = json.size();\n  memcpy(buffer->data() + kMessageHeaderSize, json.data(), json.size());\n\n  \/\/ Push new message to the write queue.\n  write_queue_.push(buffer);\n\n  \/\/ Send() may be called before the host process is started. In that case the\n  \/\/ message will be written when OnHostProcessLaunched() is called. If it's\n  \/\/ already started then write the message now.\n  if (write_stream_)\n    DoWrite();\n}\n\nvoid NativeMessageProcessHost::Start(Client* client) {\n  DCHECK(task_runner_->BelongsToCurrentThread());\n  client_ = client;\n}\n\nscoped_refptr<base::SingleThreadTaskRunner>\nNativeMessageProcessHost::task_runner() const {\n  return task_runner_;\n}\n\n#if defined(OS_POSIX)\nvoid NativeMessageProcessHost::OnFileCanReadWithoutBlocking(int fd) {\n  DCHECK_EQ(fd, read_file_);\n  DoRead();\n}\n\nvoid NativeMessageProcessHost::OnFileCanWriteWithoutBlocking(int fd) {\n  NOTREACHED();\n}\n#endif  \/\/ !defined(OS_POSIX)\n\nvoid NativeMessageProcessHost::ReadNowForTesting() {\n  DoRead();\n}\n\nvoid NativeMessageProcessHost::WaitRead() {\n  if (closed_)\n    return;\n\n  DCHECK(!read_pending_);\n\n  \/\/ On POSIX FileStream::Read() uses blocking thread pool, so it's better to\n  \/\/ wait for the file to become readable before calling DoRead(). Otherwise it\n  \/\/ would always be consuming one thread in the thread pool. On Windows\n  \/\/ FileStream uses overlapped IO, so that optimization isn't necessary there.\n#if defined(OS_POSIX)\n  base::MessageLoopForIO::current()->WatchFileDescriptor(\n    read_file_, false \/* persistent *\/,\n    base::MessageLoopForIO::WATCH_READ, &read_watcher_, this);\n#else  \/\/ defined(OS_POSIX)\n  DoRead();\n#endif  \/\/ defined(!OS_POSIX)\n}\n\nvoid NativeMessageProcessHost::DoRead() {\n  DCHECK(task_runner_->BelongsToCurrentThread());\n\n  while (!closed_ && !read_pending_) {\n    read_buffer_ = new net::IOBuffer(kReadBufferSize);\n    int result = read_stream_->Read(\n        read_buffer_.get(),\n        kReadBufferSize,\n        base::Bind(&NativeMessageProcessHost::OnRead, base::Unretained(this)));\n    HandleReadResult(result);\n  }\n}\n\nvoid NativeMessageProcessHost::OnRead(int result) {\n  DCHECK(task_runner_->BelongsToCurrentThread());\n  DCHECK(read_pending_);\n  read_pending_ = false;\n\n  HandleReadResult(result);\n  WaitRead();\n}\n\nvoid NativeMessageProcessHost::HandleReadResult(int result) {\n  DCHECK(task_runner_->BelongsToCurrentThread());\n\n  if (closed_)\n    return;\n\n  if (result > 0) {\n    ProcessIncomingData(read_buffer_->data(), result);\n  } else if (result == net::ERR_IO_PENDING) {\n    read_pending_ = true;\n  } else if (result == 0 || result == net::ERR_CONNECTION_RESET) {\n    \/\/ On Windows we get net::ERR_CONNECTION_RESET for a broken pipe, while on\n    \/\/ Posix read() returns 0 in that case.\n    Close(kNativeHostExited);\n  } else {\n    LOG(ERROR) << \"Error when reading from Native Messaging host: \" << result;\n    Close(kHostInputOuputError);\n  }\n}\n\nvoid NativeMessageProcessHost::ProcessIncomingData(\n    const char* data, int data_size) {\n  DCHECK(task_runner_->BelongsToCurrentThread());\n\n  incoming_data_.append(data, data_size);\n\n  while (true) {\n    if (incoming_data_.size() < kMessageHeaderSize)\n      return;\n\n    size_t message_size =\n        *reinterpret_cast<const uint32*>(incoming_data_.data());\n\n    if (message_size > kMaximumMessageSize) {\n      LOG(ERROR) << \"Native Messaging host tried sending a message that is \"\n                 << message_size << \" bytes long.\";\n      Close(kHostInputOuputError);\n      return;\n    }\n\n    if (incoming_data_.size() < message_size + kMessageHeaderSize)\n      return;\n\n    client_->PostMessageFromNativeHost(\n        incoming_data_.substr(kMessageHeaderSize, message_size));\n\n    incoming_data_.erase(0, kMessageHeaderSize + message_size);\n  }\n}\n\nvoid NativeMessageProcessHost::DoWrite() {\n  DCHECK(task_runner_->BelongsToCurrentThread());\n\n  while (!write_pending_ && !closed_) {\n    if (!current_write_buffer_.get() ||\n        !current_write_buffer_->BytesRemaining()) {\n      if (write_queue_.empty())\n        return;\n      current_write_buffer_ = new net::DrainableIOBuffer(\n          write_queue_.front().get(), write_queue_.front()->size());\n      write_queue_.pop();\n    }\n\n    int result =\n        write_stream_->Write(current_write_buffer_.get(),\n                             current_write_buffer_->BytesRemaining(),\n                             base::Bind(&NativeMessageProcessHost::OnWritten,\n                                        base::Unretained(this)));\n    HandleWriteResult(result);\n  }\n}\n\nvoid NativeMessageProcessHost::HandleWriteResult(int result) {\n  DCHECK(task_runner_->BelongsToCurrentThread());\n\n  if (result <= 0) {\n    if (result == net::ERR_IO_PENDING) {\n      write_pending_ = true;\n    } else {\n      LOG(ERROR) << \"Error when writing to Native Messaging host: \" << result;\n      Close(kHostInputOuputError);\n    }\n    return;\n  }\n\n  current_write_buffer_->DidConsume(result);\n}\n\nvoid NativeMessageProcessHost::OnWritten(int result) {\n  DCHECK(task_runner_->BelongsToCurrentThread());\n\n  DCHECK(write_pending_);\n  write_pending_ = false;\n\n  HandleWriteResult(result);\n  DoWrite();\n}\n\nvoid NativeMessageProcessHost::Close(const std::string& error_message) {\n  DCHECK(task_runner_->BelongsToCurrentThread());\n\n  if (!closed_) {\n    closed_ = true;\n    read_stream_.reset();\n    write_stream_.reset();\n    client_->CloseChannel(error_message);\n  }\n\n  if (process_handle_ != base::kNullProcessHandle) {\n    \/\/ Kill the host process if necessary to make sure we don't leave zombies.\n    \/\/ On OSX base::EnsureProcessTerminated() may block, so we have to post a\n    \/\/ task on the blocking pool.\n#if defined(OS_MACOSX)\n    content::BrowserThread::PostBlockingPoolTask(\n        FROM_HERE, base::Bind(&base::EnsureProcessTerminated, process_handle_));\n#else\n    base::EnsureProcessTerminated(process_handle_);\n#endif\n    process_handle_ = base::kNullProcessHandle;\n  }\n}\n\n}  \/\/ namespace extensions\n<commit_msg>Fix crash in NativeMessageProcessHost<commit_after>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/extensions\/api\/messaging\/native_message_process_host.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/files\/file_path.h\"\n#include \"base\/logging.h\"\n#include \"base\/process\/kill.h\"\n#include \"base\/threading\/sequenced_worker_pool.h\"\n#include \"chrome\/browser\/extensions\/api\/messaging\/native_messaging_host_manifest.h\"\n#include \"chrome\/browser\/extensions\/api\/messaging\/native_process_launcher.h\"\n#include \"chrome\/common\/chrome_version_info.h\"\n#include \"content\/public\/browser\/browser_thread.h\"\n#include \"extensions\/common\/constants.h\"\n#include \"extensions\/common\/features\/feature.h\"\n#include \"net\/base\/file_stream.h\"\n#include \"net\/base\/io_buffer.h\"\n#include \"net\/base\/net_errors.h\"\n#include \"net\/base\/net_util.h\"\n#include \"url\/gurl.h\"\n\nnamespace {\n\n\/\/ Maximum message size in bytes for messages received from Native Messaging\n\/\/ hosts. Message size is limited mainly to prevent Chrome from crashing when\n\/\/ native application misbehaves (e.g. starts writing garbage to the pipe).\nconst size_t kMaximumMessageSize = 1024 * 1024;\n\n\/\/ Message header contains 4-byte integer size of the message.\nconst size_t kMessageHeaderSize = 4;\n\n\/\/ Size of the buffer to be allocated for each read.\nconst size_t kReadBufferSize = 4096;\n\n}  \/\/ namespace\n\nnamespace extensions {\n\nNativeMessageProcessHost::NativeMessageProcessHost(\n    const std::string& source_extension_id,\n    const std::string& native_host_name,\n    scoped_ptr<NativeProcessLauncher> launcher)\n    : client_(NULL),\n      source_extension_id_(source_extension_id),\n      native_host_name_(native_host_name),\n      launcher_(launcher.Pass()),\n      closed_(false),\n      process_handle_(base::kNullProcessHandle),\n#if defined(OS_POSIX)\n      read_file_(-1),\n#endif\n      read_pending_(false),\n      write_pending_(false) {\n  DCHECK_CURRENTLY_ON(content::BrowserThread::UI);\n\n  task_runner_ = content::BrowserThread::GetMessageLoopProxyForThread(\n      content::BrowserThread::IO);\n}\n\nNativeMessageProcessHost::~NativeMessageProcessHost() {\n  DCHECK(task_runner_->BelongsToCurrentThread());\n}\n\n\/\/ static\nscoped_ptr<NativeMessageHost> NativeMessageHost::Create(\n    gfx::NativeView native_view,\n    const std::string& source_extension_id,\n    const std::string& native_host_name,\n    bool allow_user_level,\n    std::string* error_message) {\n  return NativeMessageProcessHost::CreateWithLauncher(\n      source_extension_id,\n      native_host_name,\n      NativeProcessLauncher::CreateDefault(allow_user_level, native_view));\n}\n\n\/\/ static\nscoped_ptr<NativeMessageHost> NativeMessageProcessHost::CreateWithLauncher(\n    const std::string& source_extension_id,\n    const std::string& native_host_name,\n    scoped_ptr<NativeProcessLauncher> launcher) {\n  DCHECK_CURRENTLY_ON(content::BrowserThread::UI);\n\n  scoped_ptr<NativeMessageHost> process(\n      new NativeMessageProcessHost(source_extension_id,\n                                   native_host_name,\n                                   launcher.Pass()));\n\n  return process.Pass();\n}\n\nvoid NativeMessageProcessHost::LaunchHostProcess() {\n  DCHECK(task_runner_->BelongsToCurrentThread());\n\n  GURL origin(std::string(kExtensionScheme) + \":\/\/\" + source_extension_id_);\n  launcher_->Launch(origin, native_host_name_,\n                    base::Bind(&NativeMessageProcessHost::OnHostProcessLaunched,\n                               base::Unretained(this)));\n}\n\nvoid NativeMessageProcessHost::OnHostProcessLaunched(\n    NativeProcessLauncher::LaunchResult result,\n    base::ProcessHandle process_handle,\n    base::File read_file,\n    base::File write_file) {\n  DCHECK(task_runner_->BelongsToCurrentThread());\n\n  switch (result) {\n    case NativeProcessLauncher::RESULT_INVALID_NAME:\n      Close(kInvalidNameError);\n      return;\n    case NativeProcessLauncher::RESULT_NOT_FOUND:\n      Close(kNotFoundError);\n      return;\n    case NativeProcessLauncher::RESULT_FORBIDDEN:\n      Close(kForbiddenError);\n      return;\n    case NativeProcessLauncher::RESULT_FAILED_TO_START:\n      Close(kFailedToStartError);\n      return;\n    case NativeProcessLauncher::RESULT_SUCCESS:\n      break;\n  }\n\n  process_handle_ = process_handle;\n#if defined(OS_POSIX)\n  \/\/ This object is not the owner of the file so it should not keep an fd.\n  read_file_ = read_file.GetPlatformFile();\n#endif\n\n  scoped_refptr<base::TaskRunner> task_runner(\n      content::BrowserThread::GetBlockingPool()->\n          GetTaskRunnerWithShutdownBehavior(\n              base::SequencedWorkerPool::SKIP_ON_SHUTDOWN));\n\n  read_stream_.reset(new net::FileStream(read_file.Pass(), task_runner));\n  write_stream_.reset(new net::FileStream(write_file.Pass(), task_runner));\n\n  WaitRead();\n  DoWrite();\n}\n\nvoid NativeMessageProcessHost::OnMessage(const std::string& json) {\n  DCHECK(task_runner_->BelongsToCurrentThread());\n\n  if (closed_)\n    return;\n\n  \/\/ Allocate new buffer for the message.\n  scoped_refptr<net::IOBufferWithSize> buffer =\n      new net::IOBufferWithSize(json.size() + kMessageHeaderSize);\n\n  \/\/ Copy size and content of the message to the buffer.\n  COMPILE_ASSERT(sizeof(uint32) == kMessageHeaderSize, incorrect_header_size);\n  *reinterpret_cast<uint32*>(buffer->data()) = json.size();\n  memcpy(buffer->data() + kMessageHeaderSize, json.data(), json.size());\n\n  \/\/ Push new message to the write queue.\n  write_queue_.push(buffer);\n\n  \/\/ Send() may be called before the host process is started. In that case the\n  \/\/ message will be written when OnHostProcessLaunched() is called. If it's\n  \/\/ already started then write the message now.\n  if (write_stream_)\n    DoWrite();\n}\n\nvoid NativeMessageProcessHost::Start(Client* client) {\n  DCHECK(task_runner_->BelongsToCurrentThread());\n  DCHECK(!client_);\n  client_ = client;\n  \/\/ It's safe to use base::Unretained() here because NativeMessagePort always\n  \/\/ deletes us on the IO thread.\n  task_runner_->PostTask(\n      FROM_HERE,\n      base::Bind(&NativeMessageProcessHost::LaunchHostProcess,\n                 base::Unretained(this)));\n}\n\nscoped_refptr<base::SingleThreadTaskRunner>\nNativeMessageProcessHost::task_runner() const {\n  return task_runner_;\n}\n\n#if defined(OS_POSIX)\nvoid NativeMessageProcessHost::OnFileCanReadWithoutBlocking(int fd) {\n  DCHECK_EQ(fd, read_file_);\n  DoRead();\n}\n\nvoid NativeMessageProcessHost::OnFileCanWriteWithoutBlocking(int fd) {\n  NOTREACHED();\n}\n#endif  \/\/ !defined(OS_POSIX)\n\nvoid NativeMessageProcessHost::ReadNowForTesting() {\n  DoRead();\n}\n\nvoid NativeMessageProcessHost::WaitRead() {\n  if (closed_)\n    return;\n\n  DCHECK(!read_pending_);\n\n  \/\/ On POSIX FileStream::Read() uses blocking thread pool, so it's better to\n  \/\/ wait for the file to become readable before calling DoRead(). Otherwise it\n  \/\/ would always be consuming one thread in the thread pool. On Windows\n  \/\/ FileStream uses overlapped IO, so that optimization isn't necessary there.\n#if defined(OS_POSIX)\n  base::MessageLoopForIO::current()->WatchFileDescriptor(\n    read_file_, false \/* persistent *\/,\n    base::MessageLoopForIO::WATCH_READ, &read_watcher_, this);\n#else  \/\/ defined(OS_POSIX)\n  DoRead();\n#endif  \/\/ defined(!OS_POSIX)\n}\n\nvoid NativeMessageProcessHost::DoRead() {\n  DCHECK(task_runner_->BelongsToCurrentThread());\n\n  while (!closed_ && !read_pending_) {\n    read_buffer_ = new net::IOBuffer(kReadBufferSize);\n    int result = read_stream_->Read(\n        read_buffer_.get(),\n        kReadBufferSize,\n        base::Bind(&NativeMessageProcessHost::OnRead, base::Unretained(this)));\n    HandleReadResult(result);\n  }\n}\n\nvoid NativeMessageProcessHost::OnRead(int result) {\n  DCHECK(task_runner_->BelongsToCurrentThread());\n  DCHECK(read_pending_);\n  read_pending_ = false;\n\n  HandleReadResult(result);\n  WaitRead();\n}\n\nvoid NativeMessageProcessHost::HandleReadResult(int result) {\n  DCHECK(task_runner_->BelongsToCurrentThread());\n\n  if (closed_)\n    return;\n\n  if (result > 0) {\n    ProcessIncomingData(read_buffer_->data(), result);\n  } else if (result == net::ERR_IO_PENDING) {\n    read_pending_ = true;\n  } else if (result == 0 || result == net::ERR_CONNECTION_RESET) {\n    \/\/ On Windows we get net::ERR_CONNECTION_RESET for a broken pipe, while on\n    \/\/ Posix read() returns 0 in that case.\n    Close(kNativeHostExited);\n  } else {\n    LOG(ERROR) << \"Error when reading from Native Messaging host: \" << result;\n    Close(kHostInputOuputError);\n  }\n}\n\nvoid NativeMessageProcessHost::ProcessIncomingData(\n    const char* data, int data_size) {\n  DCHECK(task_runner_->BelongsToCurrentThread());\n\n  incoming_data_.append(data, data_size);\n\n  while (true) {\n    if (incoming_data_.size() < kMessageHeaderSize)\n      return;\n\n    size_t message_size =\n        *reinterpret_cast<const uint32*>(incoming_data_.data());\n\n    if (message_size > kMaximumMessageSize) {\n      LOG(ERROR) << \"Native Messaging host tried sending a message that is \"\n                 << message_size << \" bytes long.\";\n      Close(kHostInputOuputError);\n      return;\n    }\n\n    if (incoming_data_.size() < message_size + kMessageHeaderSize)\n      return;\n\n    client_->PostMessageFromNativeHost(\n        incoming_data_.substr(kMessageHeaderSize, message_size));\n\n    incoming_data_.erase(0, kMessageHeaderSize + message_size);\n  }\n}\n\nvoid NativeMessageProcessHost::DoWrite() {\n  DCHECK(task_runner_->BelongsToCurrentThread());\n\n  while (!write_pending_ && !closed_) {\n    if (!current_write_buffer_.get() ||\n        !current_write_buffer_->BytesRemaining()) {\n      if (write_queue_.empty())\n        return;\n      current_write_buffer_ = new net::DrainableIOBuffer(\n          write_queue_.front().get(), write_queue_.front()->size());\n      write_queue_.pop();\n    }\n\n    int result =\n        write_stream_->Write(current_write_buffer_.get(),\n                             current_write_buffer_->BytesRemaining(),\n                             base::Bind(&NativeMessageProcessHost::OnWritten,\n                                        base::Unretained(this)));\n    HandleWriteResult(result);\n  }\n}\n\nvoid NativeMessageProcessHost::HandleWriteResult(int result) {\n  DCHECK(task_runner_->BelongsToCurrentThread());\n\n  if (result <= 0) {\n    if (result == net::ERR_IO_PENDING) {\n      write_pending_ = true;\n    } else {\n      LOG(ERROR) << \"Error when writing to Native Messaging host: \" << result;\n      Close(kHostInputOuputError);\n    }\n    return;\n  }\n\n  current_write_buffer_->DidConsume(result);\n}\n\nvoid NativeMessageProcessHost::OnWritten(int result) {\n  DCHECK(task_runner_->BelongsToCurrentThread());\n\n  DCHECK(write_pending_);\n  write_pending_ = false;\n\n  HandleWriteResult(result);\n  DoWrite();\n}\n\nvoid NativeMessageProcessHost::Close(const std::string& error_message) {\n  DCHECK(task_runner_->BelongsToCurrentThread());\n\n  if (!closed_) {\n    closed_ = true;\n    read_stream_.reset();\n    write_stream_.reset();\n    client_->CloseChannel(error_message);\n  }\n\n  if (process_handle_ != base::kNullProcessHandle) {\n    \/\/ Kill the host process if necessary to make sure we don't leave zombies.\n    \/\/ On OSX base::EnsureProcessTerminated() may block, so we have to post a\n    \/\/ task on the blocking pool.\n#if defined(OS_MACOSX)\n    content::BrowserThread::PostBlockingPoolTask(\n        FROM_HERE, base::Bind(&base::EnsureProcessTerminated, process_handle_));\n#else\n    base::EnsureProcessTerminated(process_handle_);\n#endif\n    process_handle_ = base::kNullProcessHandle;\n  }\n}\n\n}  \/\/ namespace extensions\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\/net\/websocket_experiment\/websocket_experiment_runner.h\"\n\n#include \"base\/compiler_specific.h\"\n#include \"base\/histogram.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/task.h\"\n#include \"chrome\/browser\/chrome_thread.h\"\n#include \"net\/base\/net_errors.h\"\n\nnamespace chrome_browser_net_websocket_experiment {\n\nstatic const char *kExperimentHost = \"websocket-experiment.chromium.org\";\nstatic const int kAlternativePort = 61985;\n\nstatic const int kUrlFetchDeadlineSec = 10;\nstatic const int kWebSocketConnectDeadlineSec = 10;\nstatic const int kWebSocketEchoDeadlineSec = 5;\nstatic const int kWebSocketIdleSec = 1;\nstatic const int kWebSocketPushDeadlineSec = 1;\nstatic const int kWebSocketByeDeadlineSec = 10;\nstatic const int kWebSocketCloseDeadlineSec = 5;\nstatic const int kWebSocketTimeSec = 10;\nstatic const int kTimeBucketCount = 50;\n\n\/\/ TODO(ukai): Use new thread-safe-reference-counted Histograms.\n#define UPDATE_HISTOGRAM(name, sample, min, max, bucket_count) do { \\\n    switch (task_state_) {                                          \\\n      case STATE_RUN_WS:                                            \\\n        {                                                           \\\n          static LinearHistogram counter(                               \\\n              \"WebSocketExperiment.Basic.\" name, min, max, bucket_count); \\\n          counter.SetFlags(kUmaTargetedHistogramFlag);                  \\\n          counter.Add(sample);                                          \\\n        }                                                               \\\n        break;                                                          \\\n      case STATE_RUN_WSS:                                               \\\n        {                                                               \\\n          static LinearHistogram counter(                               \\\n              \"WebSocketExperiment.Secure.\" name, min, max, bucket_count); \\\n          counter.SetFlags(kUmaTargetedHistogramFlag);                  \\\n          counter.Add(sample);                                          \\\n        }                                                               \\\n        break;                                                          \\\n      case STATE_RUN_WS_NODEFAULT_PORT:                                 \\\n        {                                                               \\\n          static LinearHistogram counter(                               \\\n              \"WebSocketExperiment.NoDefaultPort.\" name,                \\\n              min, max, bucket_count);                                  \\\n          counter.SetFlags(kUmaTargetedHistogramFlag);                  \\\n          counter.Add(sample);                                          \\\n        }                                                               \\\n        break;                                                          \\\n      default:                                                          \\\n        NOTREACHED();                                                   \\\n        break;                                                          \\\n    }                                                                   \\\n  } while (0)\n\n#define UPDATE_HISTOGRAM_TIMES(name, sample, min, max, bucket_count) do {    \\\n    switch (task_state_) {                                              \\\n      case STATE_RUN_WS:                                                \\\n        {                                                               \\\n          static Histogram counter(                                     \\\n              \"WebSocketExperiment.Basic.\" name, min, max, bucket_count); \\\n          counter.SetFlags(kUmaTargetedHistogramFlag);                  \\\n          counter.AddTime(sample);                                      \\\n        }                                                               \\\n        break;                                                          \\\n      case STATE_RUN_WSS:                                               \\\n        {                                                               \\\n          static Histogram counter(                                     \\\n              \"WebSocketExperiment.Secure.\" name, min, max, bucket_count); \\\n          counter.SetFlags(kUmaTargetedHistogramFlag);                  \\\n          counter.AddTime(sample);                                      \\\n        }                                                               \\\n        break;                                                          \\\n      case STATE_RUN_WS_NODEFAULT_PORT:                                 \\\n        {                                                               \\\n          static Histogram counter(                                     \\\n              \"WebSocketExperiment.NoDefaultPort.\" name,                \\\n              min, max, bucket_count);                                  \\\n          counter.SetFlags(kUmaTargetedHistogramFlag);                  \\\n          counter.AddTime(sample);                                      \\\n        }                                                               \\\n        break;                                                          \\\n      default:                                                          \\\n        NOTREACHED();                                                   \\\n        break;                                                          \\\n    }                                                                   \\\n  } while (0);\n\n\/\/ Hold reference while experiment is running.\nstatic scoped_refptr<WebSocketExperimentRunner> runner;\n\n\/* static *\/\nvoid WebSocketExperimentRunner::Start() {\n  DCHECK(!runner.get());\n  runner = new WebSocketExperimentRunner;\n  runner->Run();\n}\n\n\/* static *\/\nvoid WebSocketExperimentRunner::Stop() {\n  if (runner.get())\n    runner->Cancel();\n  runner = NULL;\n}\n\nWebSocketExperimentRunner::WebSocketExperimentRunner()\n    : next_state_(STATE_NONE),\n      task_state_(STATE_NONE),\n      ALLOW_THIS_IN_INITIALIZER_LIST(\n          task_callback_(this, &WebSocketExperimentRunner::OnTaskCompleted)) {\n  InitConfig();\n}\n\nWebSocketExperimentRunner::~WebSocketExperimentRunner() {\n  DCHECK(!task_.get());\n}\n\nvoid WebSocketExperimentRunner::Run() {\n  DCHECK_EQ(next_state_, STATE_NONE);\n  next_state_ = STATE_RUN_WS;\n  ChromeThread::PostDelayedTask(\n      ChromeThread::IO,\n      FROM_HERE,\n      NewRunnableMethod(this, &WebSocketExperimentRunner::DoLoop),\n      config_.initial_delay_ms);\n}\n\nvoid WebSocketExperimentRunner::Cancel() {\n  next_state_ = STATE_NONE;\n  ChromeThread::PostTask(\n      ChromeThread::IO,\n      FROM_HERE,\n      NewRunnableMethod(this, &WebSocketExperimentRunner::DoLoop));\n}\n\nvoid WebSocketExperimentRunner::InitConfig() {\n  config_.initial_delay_ms = 5 * 60 * 1000;  \/\/ 5 mins\n  config_.next_delay_ms = 12 * 60 * 60 * 1000;  \/\/ 12 hours\n\n  WebSocketExperimentTask::Config task_config;\n  task_config.ws_protocol = \"google-websocket-liveexperiment\";\n  task_config.ws_origin = \"http:\/\/dev.chromium.org\/\";\n  task_config.url_fetch_deadline_ms = kUrlFetchDeadlineSec * 1000;\n  task_config.websocket_onopen_deadline_ms =\n      kWebSocketConnectDeadlineSec * 1000;\n  task_config.websocket_hello_message = \"Hello\";\n  task_config.websocket_hello_echoback_deadline_ms =\n      kWebSocketEchoDeadlineSec * 1000;\n  \/\/ Note: wait 1.5 sec in websocket_experiment_def.txt\n  task_config.websocket_idle_ms = kWebSocketIdleSec * 1000;\n  task_config.websocket_receive_push_message_deadline_ms =\n      kWebSocketPushDeadlineSec * 1000;\n  task_config.websocket_bye_message = \"Bye\";\n  task_config.websocket_bye_deadline_ms =\n      kWebSocketByeDeadlineSec * 1000;\n  task_config.websocket_close_deadline_ms =\n      kWebSocketCloseDeadlineSec * 1000;\n\n  config_.ws_config = task_config;\n  config_.ws_config.url =\n      GURL(StringPrintf(\"ws:\/\/%s\/live_exp\", kExperimentHost));\n  config_.ws_config.ws_location =\n      StringPrintf(\"ws:\/\/%s\/live_exp\", kExperimentHost);\n  config_.ws_config.http_url =\n      GURL(StringPrintf(\"http:\/\/%s\/\", kExperimentHost));\n\n  config_.wss_config = task_config;\n  config_.wss_config.url =\n      GURL(StringPrintf(\"wss:\/\/%s\/live_exp\", kExperimentHost));\n  config_.wss_config.ws_location =\n      StringPrintf(\"wss:\/\/%s\/live_exp\", kExperimentHost);\n  config_.wss_config.http_url =\n      GURL(StringPrintf(\"https:\/\/%s\/\", kExperimentHost));\n\n  config_.ws_nondefault_config = task_config;\n  config_.ws_nondefault_config.url =\n      GURL(StringPrintf(\"ws:\/\/%s:%d\/live_exp\",\n                        kExperimentHost, kAlternativePort));\n  config_.ws_nondefault_config.ws_location =\n      StringPrintf(\"ws:\/\/%s:%d\/live_exp\",\n                   kExperimentHost, kAlternativePort);\n  config_.ws_nondefault_config.http_url =\n      GURL(StringPrintf(\"http:\/\/%s:%d\/\",\n                        kExperimentHost, kAlternativePort));\n}\n\nvoid WebSocketExperimentRunner::DoLoop() {\n  if (next_state_ == STATE_NONE) {\n    if (task_.get()) {\n      AddRef();  \/\/ Release in OnTaskCompleted.\n      task_->Cancel();\n    }\n    return;\n  }\n\n  State state = next_state_;\n  task_state_ = STATE_NONE;\n  next_state_ = STATE_NONE;\n\n  switch (state) {\n    case STATE_IDLE:\n      task_.reset();\n      next_state_ = STATE_RUN_WS;\n      ChromeThread::PostDelayedTask(\n          ChromeThread::IO,\n          FROM_HERE,\n          NewRunnableMethod(this, &WebSocketExperimentRunner::DoLoop),\n          config_.next_delay_ms);\n      break;\n    case STATE_RUN_WS:\n      task_.reset(new WebSocketExperimentTask(config_.ws_config,\n                                              &task_callback_));\n      task_state_ = STATE_RUN_WS;\n      next_state_ = STATE_RUN_WSS;\n      break;\n    case STATE_RUN_WSS:\n      task_.reset(new WebSocketExperimentTask(config_.wss_config,\n                                              &task_callback_));\n      task_state_ = STATE_RUN_WSS;\n      next_state_ = STATE_RUN_WS_NODEFAULT_PORT;\n      break;\n    case STATE_RUN_WS_NODEFAULT_PORT:\n      task_.reset(new WebSocketExperimentTask(config_.ws_nondefault_config,\n                                              &task_callback_));\n      task_state_ = STATE_RUN_WS_NODEFAULT_PORT;\n      next_state_ = STATE_IDLE;\n      break;\n    default:\n      NOTREACHED();\n      break;\n  }\n  if (task_.get())\n    task_->Run();\n}\n\nvoid WebSocketExperimentRunner::OnTaskCompleted(int result) {\n  if (result == net::ERR_ABORTED) {\n    task_.reset();\n    \/\/ Task is Canceled.\n    DLOG(INFO) << \"WebSocketExperiment Task is canceled.\";\n    Release();\n    return;\n  }\n  UpdateTaskResultHistogram(task_.get());\n  task_.reset();\n\n  DoLoop();\n}\n\nvoid WebSocketExperimentRunner::UpdateTaskResultHistogram(\n    const WebSocketExperimentTask* task) {\n  DCHECK(task);\n  const WebSocketExperimentTask::Result& task_result = task->result();\n\n  UPDATE_HISTOGRAM(\"LastState\", task_result.last_state,\n                   1, WebSocketExperimentTask::NUM_STATES,\n                   WebSocketExperimentTask::NUM_STATES + 1);\n\n  UPDATE_HISTOGRAM_TIMES(\"UrlFetch\", task_result.url_fetch,\n                         base::TimeDelta::FromMilliseconds(1),\n                         base::TimeDelta::FromSeconds(kUrlFetchDeadlineSec),\n                         kTimeBucketCount);\n\n  if (task_result.last_state <\n      WebSocketExperimentTask::STATE_WEBSOCKET_CONNECT_COMPLETE)\n    return;\n\n  UPDATE_HISTOGRAM_TIMES(\"WebSocketConnect\", task_result.websocket_connect,\n                         base::TimeDelta::FromMilliseconds(1),\n                         base::TimeDelta::FromSeconds(\n                             kWebSocketConnectDeadlineSec),\n                         kTimeBucketCount);\n\n  if (task_result.last_state <\n      WebSocketExperimentTask::STATE_WEBSOCKET_RECV_HELLO)\n    return;\n\n  UPDATE_HISTOGRAM_TIMES(\"WebSocketEcho\", task_result.websocket_echo,\n                         base::TimeDelta::FromMilliseconds(1),\n                         base::TimeDelta::FromSeconds(\n                             kWebSocketEchoDeadlineSec),\n                         kTimeBucketCount);\n\n  if (task_result.last_state <\n      WebSocketExperimentTask::STATE_WEBSOCKET_KEEP_IDLE)\n    return;\n\n  UPDATE_HISTOGRAM_TIMES(\"WebSocketIdle\", task_result.websocket_idle,\n                         base::TimeDelta::FromMilliseconds(1),\n                         base::TimeDelta::FromSeconds(\n                             kWebSocketIdleSec + kWebSocketPushDeadlineSec),\n                         kTimeBucketCount);\n\n  if (task_result.last_state <\n      WebSocketExperimentTask::STATE_WEBSOCKET_CLOSE_COMPLETE)\n    return;\n\n  UPDATE_HISTOGRAM_TIMES(\"WebSocketTotal\", task_result.websocket_total,\n                         base::TimeDelta::FromMilliseconds(1),\n                         base::TimeDelta::FromSeconds(kWebSocketTimeSec),\n                         kTimeBucketCount);\n}\n\n}  \/\/ namespace chrome_browser_net_websocket_experiment\n<commit_msg>Throttle websocket live experiment<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\/net\/websocket_experiment\/websocket_experiment_runner.h\"\n\n#include \"base\/compiler_specific.h\"\n#include \"base\/field_trial.h\"\n#include \"base\/histogram.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/task.h\"\n#include \"chrome\/browser\/chrome_thread.h\"\n#include \"net\/base\/net_errors.h\"\n\nnamespace chrome_browser_net_websocket_experiment {\n\nstatic const char *kExperimentHost = \"websocket-experiment.chromium.org\";\nstatic const int kAlternativePort = 61985;\n\nstatic const int kUrlFetchDeadlineSec = 10;\nstatic const int kWebSocketConnectDeadlineSec = 10;\nstatic const int kWebSocketEchoDeadlineSec = 5;\nstatic const int kWebSocketIdleSec = 1;\nstatic const int kWebSocketPushDeadlineSec = 1;\nstatic const int kWebSocketByeDeadlineSec = 10;\nstatic const int kWebSocketCloseDeadlineSec = 5;\nstatic const int kWebSocketTimeSec = 10;\nstatic const int kTimeBucketCount = 50;\n\n\/\/ TODO(ukai): Use new thread-safe-reference-counted Histograms.\n#define UPDATE_HISTOGRAM(name, sample, min, max, bucket_count) do { \\\n    switch (task_state_) {                                          \\\n      case STATE_RUN_WS:                                            \\\n        {                                                           \\\n          static LinearHistogram counter(                               \\\n              \"WebSocketExperiment.Basic.\" name, min, max, bucket_count); \\\n          counter.SetFlags(kUmaTargetedHistogramFlag);                  \\\n          counter.Add(sample);                                          \\\n        }                                                               \\\n        break;                                                          \\\n      case STATE_RUN_WSS:                                               \\\n        {                                                               \\\n          static LinearHistogram counter(                               \\\n              \"WebSocketExperiment.Secure.\" name, min, max, bucket_count); \\\n          counter.SetFlags(kUmaTargetedHistogramFlag);                  \\\n          counter.Add(sample);                                          \\\n        }                                                               \\\n        break;                                                          \\\n      case STATE_RUN_WS_NODEFAULT_PORT:                                 \\\n        {                                                               \\\n          static LinearHistogram counter(                               \\\n              \"WebSocketExperiment.NoDefaultPort.\" name,                \\\n              min, max, bucket_count);                                  \\\n          counter.SetFlags(kUmaTargetedHistogramFlag);                  \\\n          counter.Add(sample);                                          \\\n        }                                                               \\\n        break;                                                          \\\n      default:                                                          \\\n        NOTREACHED();                                                   \\\n        break;                                                          \\\n    }                                                                   \\\n  } while (0)\n\n#define UPDATE_HISTOGRAM_TIMES(name, sample, min, max, bucket_count) do {    \\\n    switch (task_state_) {                                              \\\n      case STATE_RUN_WS:                                                \\\n        {                                                               \\\n          static Histogram counter(                                     \\\n              \"WebSocketExperiment.Basic.\" name, min, max, bucket_count); \\\n          counter.SetFlags(kUmaTargetedHistogramFlag);                  \\\n          counter.AddTime(sample);                                      \\\n        }                                                               \\\n        break;                                                          \\\n      case STATE_RUN_WSS:                                               \\\n        {                                                               \\\n          static Histogram counter(                                     \\\n              \"WebSocketExperiment.Secure.\" name, min, max, bucket_count); \\\n          counter.SetFlags(kUmaTargetedHistogramFlag);                  \\\n          counter.AddTime(sample);                                      \\\n        }                                                               \\\n        break;                                                          \\\n      case STATE_RUN_WS_NODEFAULT_PORT:                                 \\\n        {                                                               \\\n          static Histogram counter(                                     \\\n              \"WebSocketExperiment.NoDefaultPort.\" name,                \\\n              min, max, bucket_count);                                  \\\n          counter.SetFlags(kUmaTargetedHistogramFlag);                  \\\n          counter.AddTime(sample);                                      \\\n        }                                                               \\\n        break;                                                          \\\n      default:                                                          \\\n        NOTREACHED();                                                   \\\n        break;                                                          \\\n    }                                                                   \\\n  } while (0);\n\n\/\/ Hold reference while experiment is running.\nstatic scoped_refptr<WebSocketExperimentRunner> runner;\n\n\/* static *\/\nvoid WebSocketExperimentRunner::Start() {\n  DCHECK(!runner.get());\n\n  scoped_refptr<FieldTrial> trial = new FieldTrial(\"WebSocketExperiment\", 1000);\n  trial->AppendGroup(\"_active\", 5);  \/\/ 0.5% in _active group.\n\n  if (trial->group() == FieldTrial::kNotParticipating)\n    return;\n\n  runner = new WebSocketExperimentRunner;\n  runner->Run();\n}\n\n\/* static *\/\nvoid WebSocketExperimentRunner::Stop() {\n  if (runner.get())\n    runner->Cancel();\n  runner = NULL;\n}\n\nWebSocketExperimentRunner::WebSocketExperimentRunner()\n    : next_state_(STATE_NONE),\n      task_state_(STATE_NONE),\n      ALLOW_THIS_IN_INITIALIZER_LIST(\n          task_callback_(this, &WebSocketExperimentRunner::OnTaskCompleted)) {\n  InitConfig();\n}\n\nWebSocketExperimentRunner::~WebSocketExperimentRunner() {\n  DCHECK(!task_.get());\n}\n\nvoid WebSocketExperimentRunner::Run() {\n  DCHECK_EQ(next_state_, STATE_NONE);\n  next_state_ = STATE_RUN_WS;\n  ChromeThread::PostDelayedTask(\n      ChromeThread::IO,\n      FROM_HERE,\n      NewRunnableMethod(this, &WebSocketExperimentRunner::DoLoop),\n      config_.initial_delay_ms);\n}\n\nvoid WebSocketExperimentRunner::Cancel() {\n  next_state_ = STATE_NONE;\n  ChromeThread::PostTask(\n      ChromeThread::IO,\n      FROM_HERE,\n      NewRunnableMethod(this, &WebSocketExperimentRunner::DoLoop));\n}\n\nvoid WebSocketExperimentRunner::InitConfig() {\n  config_.initial_delay_ms = 5 * 60 * 1000;  \/\/ 5 mins\n  config_.next_delay_ms = 12 * 60 * 60 * 1000;  \/\/ 12 hours\n\n  WebSocketExperimentTask::Config task_config;\n  task_config.ws_protocol = \"google-websocket-liveexperiment\";\n  task_config.ws_origin = \"http:\/\/dev.chromium.org\/\";\n  task_config.url_fetch_deadline_ms = kUrlFetchDeadlineSec * 1000;\n  task_config.websocket_onopen_deadline_ms =\n      kWebSocketConnectDeadlineSec * 1000;\n  task_config.websocket_hello_message = \"Hello\";\n  task_config.websocket_hello_echoback_deadline_ms =\n      kWebSocketEchoDeadlineSec * 1000;\n  \/\/ Note: wait 1.5 sec in websocket_experiment_def.txt\n  task_config.websocket_idle_ms = kWebSocketIdleSec * 1000;\n  task_config.websocket_receive_push_message_deadline_ms =\n      kWebSocketPushDeadlineSec * 1000;\n  task_config.websocket_bye_message = \"Bye\";\n  task_config.websocket_bye_deadline_ms =\n      kWebSocketByeDeadlineSec * 1000;\n  task_config.websocket_close_deadline_ms =\n      kWebSocketCloseDeadlineSec * 1000;\n\n  config_.ws_config = task_config;\n  config_.ws_config.url =\n      GURL(StringPrintf(\"ws:\/\/%s\/live_exp\", kExperimentHost));\n  config_.ws_config.ws_location =\n      StringPrintf(\"ws:\/\/%s\/live_exp\", kExperimentHost);\n  config_.ws_config.http_url =\n      GURL(StringPrintf(\"http:\/\/%s\/\", kExperimentHost));\n\n  config_.wss_config = task_config;\n  config_.wss_config.url =\n      GURL(StringPrintf(\"wss:\/\/%s\/live_exp\", kExperimentHost));\n  config_.wss_config.ws_location =\n      StringPrintf(\"wss:\/\/%s\/live_exp\", kExperimentHost);\n  config_.wss_config.http_url =\n      GURL(StringPrintf(\"https:\/\/%s\/\", kExperimentHost));\n\n  config_.ws_nondefault_config = task_config;\n  config_.ws_nondefault_config.url =\n      GURL(StringPrintf(\"ws:\/\/%s:%d\/live_exp\",\n                        kExperimentHost, kAlternativePort));\n  config_.ws_nondefault_config.ws_location =\n      StringPrintf(\"ws:\/\/%s:%d\/live_exp\",\n                   kExperimentHost, kAlternativePort);\n  config_.ws_nondefault_config.http_url =\n      GURL(StringPrintf(\"http:\/\/%s:%d\/\",\n                        kExperimentHost, kAlternativePort));\n}\n\nvoid WebSocketExperimentRunner::DoLoop() {\n  if (next_state_ == STATE_NONE) {\n    if (task_.get()) {\n      AddRef();  \/\/ Release in OnTaskCompleted.\n      task_->Cancel();\n    }\n    return;\n  }\n\n  State state = next_state_;\n  task_state_ = STATE_NONE;\n  next_state_ = STATE_NONE;\n\n  switch (state) {\n    case STATE_IDLE:\n      task_.reset();\n      next_state_ = STATE_RUN_WS;\n      ChromeThread::PostDelayedTask(\n          ChromeThread::IO,\n          FROM_HERE,\n          NewRunnableMethod(this, &WebSocketExperimentRunner::DoLoop),\n          config_.next_delay_ms);\n      break;\n    case STATE_RUN_WS:\n      task_.reset(new WebSocketExperimentTask(config_.ws_config,\n                                              &task_callback_));\n      task_state_ = STATE_RUN_WS;\n      next_state_ = STATE_RUN_WSS;\n      break;\n    case STATE_RUN_WSS:\n      task_.reset(new WebSocketExperimentTask(config_.wss_config,\n                                              &task_callback_));\n      task_state_ = STATE_RUN_WSS;\n      next_state_ = STATE_RUN_WS_NODEFAULT_PORT;\n      break;\n    case STATE_RUN_WS_NODEFAULT_PORT:\n      task_.reset(new WebSocketExperimentTask(config_.ws_nondefault_config,\n                                              &task_callback_));\n      task_state_ = STATE_RUN_WS_NODEFAULT_PORT;\n      next_state_ = STATE_IDLE;\n      break;\n    default:\n      NOTREACHED();\n      break;\n  }\n  if (task_.get())\n    task_->Run();\n}\n\nvoid WebSocketExperimentRunner::OnTaskCompleted(int result) {\n  if (result == net::ERR_ABORTED) {\n    task_.reset();\n    \/\/ Task is Canceled.\n    DLOG(INFO) << \"WebSocketExperiment Task is canceled.\";\n    Release();\n    return;\n  }\n  UpdateTaskResultHistogram(task_.get());\n  task_.reset();\n\n  DoLoop();\n}\n\nvoid WebSocketExperimentRunner::UpdateTaskResultHistogram(\n    const WebSocketExperimentTask* task) {\n  DCHECK(task);\n  const WebSocketExperimentTask::Result& task_result = task->result();\n\n  UPDATE_HISTOGRAM(\"LastState\", task_result.last_state,\n                   1, WebSocketExperimentTask::NUM_STATES,\n                   WebSocketExperimentTask::NUM_STATES + 1);\n\n  UPDATE_HISTOGRAM_TIMES(\"UrlFetch\", task_result.url_fetch,\n                         base::TimeDelta::FromMilliseconds(1),\n                         base::TimeDelta::FromSeconds(kUrlFetchDeadlineSec),\n                         kTimeBucketCount);\n\n  if (task_result.last_state <\n      WebSocketExperimentTask::STATE_WEBSOCKET_CONNECT_COMPLETE)\n    return;\n\n  UPDATE_HISTOGRAM_TIMES(\"WebSocketConnect\", task_result.websocket_connect,\n                         base::TimeDelta::FromMilliseconds(1),\n                         base::TimeDelta::FromSeconds(\n                             kWebSocketConnectDeadlineSec),\n                         kTimeBucketCount);\n\n  if (task_result.last_state <\n      WebSocketExperimentTask::STATE_WEBSOCKET_RECV_HELLO)\n    return;\n\n  UPDATE_HISTOGRAM_TIMES(\"WebSocketEcho\", task_result.websocket_echo,\n                         base::TimeDelta::FromMilliseconds(1),\n                         base::TimeDelta::FromSeconds(\n                             kWebSocketEchoDeadlineSec),\n                         kTimeBucketCount);\n\n  if (task_result.last_state <\n      WebSocketExperimentTask::STATE_WEBSOCKET_KEEP_IDLE)\n    return;\n\n  UPDATE_HISTOGRAM_TIMES(\"WebSocketIdle\", task_result.websocket_idle,\n                         base::TimeDelta::FromMilliseconds(1),\n                         base::TimeDelta::FromSeconds(\n                             kWebSocketIdleSec + kWebSocketPushDeadlineSec),\n                         kTimeBucketCount);\n\n  if (task_result.last_state <\n      WebSocketExperimentTask::STATE_WEBSOCKET_CLOSE_COMPLETE)\n    return;\n\n  UPDATE_HISTOGRAM_TIMES(\"WebSocketTotal\", task_result.websocket_total,\n                         base::TimeDelta::FromMilliseconds(1),\n                         base::TimeDelta::FromSeconds(kWebSocketTimeSec),\n                         kTimeBucketCount);\n}\n\n}  \/\/ namespace chrome_browser_net_websocket_experiment\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\/utf_string_conversions.h\"\n#include \"chrome\/browser\/sync\/profile_sync_service_harness.h\"\n#include \"chrome\/browser\/sync\/test\/integration\/passwords_helper.h\"\n#include \"chrome\/browser\/sync\/test\/integration\/sync_test.h\"\n#include \"sync\/internal_api\/public\/engine\/model_safe_worker.h\"\n#include \"sync\/internal_api\/public\/sessions\/sync_session_snapshot.h\"\n\nusing passwords_helper::AddLogin;\nusing passwords_helper::AllProfilesContainSamePasswordForms;\nusing passwords_helper::AllProfilesContainSamePasswordFormsAsVerifier;\nusing passwords_helper::CreateTestPasswordForm;\nusing passwords_helper::GetPasswordCount;\nusing passwords_helper::GetPasswordStore;\nusing passwords_helper::GetVerifierPasswordCount;\nusing passwords_helper::GetVerifierPasswordStore;\nusing passwords_helper::ProfileContainsSamePasswordFormsAsVerifier;\nusing passwords_helper::RemoveLogin;\nusing passwords_helper::RemoveLogins;\nusing passwords_helper::SetDecryptionPassphrase;\nusing passwords_helper::SetEncryptionPassphrase;\nusing passwords_helper::UpdateLogin;\n\nusing content::PasswordForm;\n\nstatic const char* kValidPassphrase = \"passphrase!\";\nstatic const char* kAnotherValidPassphrase = \"another passphrase!\";\n\nclass TwoClientPasswordsSyncTest : public SyncTest {\n public:\n  TwoClientPasswordsSyncTest() : SyncTest(TWO_CLIENT) {}\n  virtual ~TwoClientPasswordsSyncTest() {}\n\n private:\n  DISALLOW_COPY_AND_ASSIGN(TwoClientPasswordsSyncTest);\n};\n\n\/\/ TCM ID - 3732277\nIN_PROC_BROWSER_TEST_F(TwoClientPasswordsSyncTest, Add) {\n  ASSERT_TRUE(SetupSync()) << \"SetupSync() failed.\";\n  ASSERT_TRUE(AllProfilesContainSamePasswordFormsAsVerifier());\n\n  PasswordForm form = CreateTestPasswordForm(0);\n  AddLogin(GetVerifierPasswordStore(), form);\n  ASSERT_EQ(1, GetVerifierPasswordCount());\n  AddLogin(GetPasswordStore(0), form);\n  ASSERT_EQ(1, GetPasswordCount(0));\n\n  ASSERT_TRUE(GetClient(0)->AwaitMutualSyncCycleCompletion(GetClient(1)));\n  ASSERT_TRUE(AllProfilesContainSamePasswordFormsAsVerifier());\n}\n\nIN_PROC_BROWSER_TEST_F(TwoClientPasswordsSyncTest, Race) {\n  ASSERT_TRUE(SetupSync()) << \"SetupSync() failed.\";\n  ASSERT_TRUE(AllProfilesContainSamePasswordForms());\n\n  PasswordForm form0 = CreateTestPasswordForm(0);\n  AddLogin(GetPasswordStore(0), form0);\n\n  PasswordForm form1 = form0;\n  form1.password_value = ASCIIToUTF16(\"new_password\");\n  AddLogin(GetPasswordStore(1), form1);\n\n  ASSERT_TRUE(AwaitQuiescence());\n  ASSERT_TRUE(AllProfilesContainSamePasswordForms());\n}\n\n\/\/ TCM ID - 4577932.\nIN_PROC_BROWSER_TEST_F(TwoClientPasswordsSyncTest, DisablePasswords) {\n  ASSERT_TRUE(SetupSync()) << \"SetupSync() failed.\";\n  ASSERT_TRUE(AllProfilesContainSamePasswordFormsAsVerifier());\n\n  ASSERT_TRUE(GetClient(1)->DisableSyncForDatatype(syncer::PASSWORDS));\n  PasswordForm form = CreateTestPasswordForm(0);\n  AddLogin(GetVerifierPasswordStore(), form);\n  ASSERT_EQ(1, GetVerifierPasswordCount());\n  AddLogin(GetPasswordStore(0), form);\n  ASSERT_EQ(1, GetPasswordCount(0));\n\n  ASSERT_TRUE(GetClient(0)->AwaitFullSyncCompletion(\"Added a password.\"));\n  ASSERT_TRUE(ProfileContainsSamePasswordFormsAsVerifier(0));\n  ASSERT_FALSE(ProfileContainsSamePasswordFormsAsVerifier(1));\n\n  ASSERT_TRUE(GetClient(1)->EnableSyncForDatatype(syncer::PASSWORDS));\n  ASSERT_TRUE(AwaitQuiescence());\n  ASSERT_TRUE(AllProfilesContainSamePasswordFormsAsVerifier());\n  ASSERT_EQ(1, GetPasswordCount(1));\n}\n\n\/\/ TCM ID - 4649281.\nIN_PROC_BROWSER_TEST_F(TwoClientPasswordsSyncTest, DisableSync) {\n  ASSERT_TRUE(SetupSync()) << \"SetupSync() failed.\";\n  ASSERT_TRUE(AllProfilesContainSamePasswordFormsAsVerifier());\n\n  ASSERT_TRUE(GetClient(1)->DisableSyncForAllDatatypes());\n  PasswordForm form = CreateTestPasswordForm(0);\n  AddLogin(GetVerifierPasswordStore(), form);\n  ASSERT_EQ(1, GetVerifierPasswordCount());\n  AddLogin(GetPasswordStore(0), form);\n  ASSERT_EQ(1, GetPasswordCount(0));\n\n  ASSERT_TRUE(GetClient(0)->AwaitFullSyncCompletion(\"Added a password.\"));\n  ASSERT_TRUE(ProfileContainsSamePasswordFormsAsVerifier(0));\n  ASSERT_FALSE(ProfileContainsSamePasswordFormsAsVerifier(1));\n\n  ASSERT_TRUE(GetClient(1)->EnableSyncForAllDatatypes());\n  ASSERT_TRUE(AwaitQuiescence());\n  ASSERT_TRUE(AllProfilesContainSamePasswordFormsAsVerifier());\n  ASSERT_EQ(1, GetPasswordCount(1));\n}\n\nIN_PROC_BROWSER_TEST_F(TwoClientPasswordsSyncTest, SetPassphrase) {\n  ASSERT_TRUE(SetupSync()) << \"SetupSync() failed.\";\n\n  SetEncryptionPassphrase(0, kValidPassphrase, ProfileSyncService::EXPLICIT);\n  ASSERT_TRUE(GetClient(0)->AwaitPassphraseAccepted());\n  ASSERT_TRUE(GetClient(0)->AwaitMutualSyncCycleCompletion(GetClient(1)));\n\n  ASSERT_TRUE(GetClient(1)->AwaitPassphraseRequired());\n  ASSERT_TRUE(SetDecryptionPassphrase(1, kValidPassphrase));\n  ASSERT_TRUE(GetClient(1)->AwaitPassphraseAccepted());\n  ASSERT_TRUE(GetClient(1)->AwaitFullSyncCompletion(\"Set passphrase.\"));\n}\n\nIN_PROC_BROWSER_TEST_F(TwoClientPasswordsSyncTest,\n                       SetPassphraseAndAddPassword) {\n  ASSERT_TRUE(SetupSync()) << \"SetupSync() failed.\";\n\n  SetEncryptionPassphrase(0, kValidPassphrase, ProfileSyncService::EXPLICIT);\n  ASSERT_TRUE(GetClient(0)->AwaitPassphraseAccepted());\n  ASSERT_TRUE(GetClient(0)->AwaitMutualSyncCycleCompletion(GetClient(1)));\n\n  ASSERT_TRUE(GetClient(1)->AwaitPassphraseRequired());\n  ASSERT_TRUE(SetDecryptionPassphrase(1, kValidPassphrase));\n  ASSERT_TRUE(GetClient(1)->AwaitPassphraseAccepted());\n\n  PasswordForm form = CreateTestPasswordForm(0);\n  AddLogin(GetPasswordStore(0), form);\n  ASSERT_EQ(1, GetPasswordCount(0));\n\n  ASSERT_TRUE(GetClient(0)->AwaitMutualSyncCycleCompletion(GetClient(1)));\n  ASSERT_EQ(1, GetPasswordCount(1));\n}\n\n\/\/ TCM ID - 4603879\nIN_PROC_BROWSER_TEST_F(TwoClientPasswordsSyncTest, Update) {\n  ASSERT_TRUE(SetupSync()) << \"SetupSync() failed.\";\n  ASSERT_TRUE(AllProfilesContainSamePasswordFormsAsVerifier());\n\n  PasswordForm form = CreateTestPasswordForm(0);\n  AddLogin(GetVerifierPasswordStore(), form);\n  AddLogin(GetPasswordStore(0), form);\n  ASSERT_TRUE(GetClient(0)->AwaitMutualSyncCycleCompletion(GetClient(1)));\n\n  form.password_value = ASCIIToUTF16(\"new_password\");\n  UpdateLogin(GetVerifierPasswordStore(), form);\n  UpdateLogin(GetPasswordStore(1), form);\n  ASSERT_TRUE(AwaitQuiescence());\n\n  ASSERT_EQ(1, GetVerifierPasswordCount());\n  ASSERT_TRUE(AllProfilesContainSamePasswordFormsAsVerifier());\n}\n\n\/\/ TCM ID - 3719309\nIN_PROC_BROWSER_TEST_F(TwoClientPasswordsSyncTest, Delete) {\n  ASSERT_TRUE(SetupSync()) << \"SetupSync() failed.\";\n  ASSERT_TRUE(AllProfilesContainSamePasswordFormsAsVerifier());\n\n  PasswordForm form0 = CreateTestPasswordForm(0);\n  AddLogin(GetVerifierPasswordStore(), form0);\n  AddLogin(GetPasswordStore(0), form0);\n  PasswordForm form1 = CreateTestPasswordForm(1);\n  AddLogin(GetVerifierPasswordStore(), form1);\n  AddLogin(GetPasswordStore(0), form1);\n  ASSERT_TRUE(AwaitQuiescence());\n\n  RemoveLogin(GetPasswordStore(1), form0);\n  RemoveLogin(GetVerifierPasswordStore(), form0);\n  ASSERT_TRUE(AwaitQuiescence());\n\n  ASSERT_EQ(1, GetVerifierPasswordCount());\n  ASSERT_TRUE(AllProfilesContainSamePasswordFormsAsVerifier());\n}\n\n\/\/ TCM ID - 7573511\n\/\/ Flaky on Mac and Windows: http:\/\/crbug.com\/111399\n#if defined(OS_WIN) || defined(OS_MACOSX)\n#define MAYBE_DeleteAll DISABLED_DeleteAll\n#else\n#define MAYBE_DeleteAll DeleteAll\n#endif\nIN_PROC_BROWSER_TEST_F(TwoClientPasswordsSyncTest, MAYBE_DeleteAll) {\n  ASSERT_TRUE(SetupSync()) << \"SetupSync() failed.\";\n  ASSERT_TRUE(AllProfilesContainSamePasswordFormsAsVerifier());\n\n  PasswordForm form0 = CreateTestPasswordForm(0);\n  AddLogin(GetVerifierPasswordStore(), form0);\n  AddLogin(GetPasswordStore(0), form0);\n  PasswordForm form1 = CreateTestPasswordForm(1);\n  AddLogin(GetVerifierPasswordStore(), form1);\n  AddLogin(GetPasswordStore(0), form1);\n  ASSERT_TRUE(AwaitQuiescence());\n\n  RemoveLogins(GetPasswordStore(1));\n  RemoveLogins(GetVerifierPasswordStore());\n  ASSERT_TRUE(AwaitQuiescence());\n\n  ASSERT_EQ(0, GetVerifierPasswordCount());\n  ASSERT_TRUE(AllProfilesContainSamePasswordFormsAsVerifier());\n}\n\n\/\/ TCM ID - 3694311\nIN_PROC_BROWSER_TEST_F(TwoClientPasswordsSyncTest, Merge) {\n  ASSERT_TRUE(SetupSync()) << \"SetupSync() failed.\";\n  ASSERT_TRUE(AllProfilesContainSamePasswordForms());\n\n  PasswordForm form0 = CreateTestPasswordForm(0);\n  AddLogin(GetPasswordStore(0), form0);\n  PasswordForm form1 = CreateTestPasswordForm(1);\n  AddLogin(GetPasswordStore(1), form1);\n  PasswordForm form2 = CreateTestPasswordForm(2);\n  AddLogin(GetPasswordStore(1), form2);\n  ASSERT_TRUE(AwaitQuiescence());\n\n  ASSERT_EQ(3, GetPasswordCount(0));\n  ASSERT_TRUE(AllProfilesContainSamePasswordForms());\n}\n\n\/\/ This test is flaky. See bug http:\/\/crbug.com\/135336\nIN_PROC_BROWSER_TEST_F(TwoClientPasswordsSyncTest,\n                       DISABLED_SetPassphraseAndThenSetupSync) {\n  ASSERT_TRUE(SetupClients()) << \"SetupClients() failed.\";\n\n  ASSERT_TRUE(GetClient(0)->SetupSync());\n  SetEncryptionPassphrase(0, kValidPassphrase, ProfileSyncService::EXPLICIT);\n  ASSERT_TRUE(GetClient(0)->AwaitPassphraseAccepted());\n  ASSERT_TRUE(GetClient(0)->AwaitFullSyncCompletion(\"Initial sync.\"));\n\n  ASSERT_FALSE(GetClient(1)->SetupSync());\n  ASSERT_TRUE(GetClient(1)->AwaitPassphraseRequired());\n  ASSERT_TRUE(SetDecryptionPassphrase(1, kValidPassphrase));\n  ASSERT_TRUE(GetClient(1)->AwaitPassphraseAccepted());\n  ASSERT_TRUE(GetClient(1)->AwaitFullSyncCompletion(\"Initial sync.\"));\n\n  \/\/ Following ensures types are enabled and active (see bug 87572).\n  syncer::ModelSafeRoutingInfo routes;\n  GetClient(0)->service()->GetModelSafeRoutingInfo(&routes);\n  ASSERT_EQ(syncer::GROUP_PASSWORD, routes[syncer::PASSWORDS]);\n  routes.clear();\n  GetClient(1)->service()->GetModelSafeRoutingInfo(&routes);\n  ASSERT_EQ(syncer::GROUP_PASSWORD, routes[syncer::PASSWORDS]);\n}\n\nIN_PROC_BROWSER_TEST_F(TwoClientPasswordsSyncTest,\n                       SetDifferentPassphraseAndThenSetupSync) {\n  ASSERT_TRUE(SetupClients()) << \"SetupClients() failed.\";\n\n  ASSERT_TRUE(GetClient(0)->SetupSync());\n  SetEncryptionPassphrase(0, kValidPassphrase, ProfileSyncService::EXPLICIT);\n  ASSERT_TRUE(GetClient(0)->AwaitPassphraseAccepted());\n  ASSERT_TRUE(GetClient(0)->AwaitFullSyncCompletion(\"Initial sync.\"));\n\n  \/\/ Setup 1 with a different passphrase, so that it fails to sync.\n  ASSERT_FALSE(GetClient(1)->SetupSync());\n  ASSERT_TRUE(GetClient(1)->AwaitPassphraseRequired());\n  ASSERT_FALSE(SetDecryptionPassphrase(1, kAnotherValidPassphrase));\n  ASSERT_TRUE(GetClient(1)->AwaitPassphraseRequired());\n\n  \/\/ Add a password on 0 while clients have different passphrases.\n  PasswordForm form0 = CreateTestPasswordForm(0);\n  AddLogin(GetVerifierPasswordStore(), form0);\n  AddLogin(GetPasswordStore(0), form0);\n\n  ASSERT_TRUE(GetClient(0)->AwaitFullSyncCompletion(\"Added a password.\"));\n\n  \/\/ Password hasn't been synced to 1 yet.\n  ASSERT_FALSE(AllProfilesContainSamePasswordFormsAsVerifier());\n\n  \/\/ Update 1 with the correct passphrase, the password should now sync over.\n  ASSERT_TRUE(GetClient(1)->AwaitPassphraseRequired());\n  ASSERT_TRUE(SetDecryptionPassphrase(1, kValidPassphrase));\n  ASSERT_TRUE(GetClient(1)->AwaitPassphraseAccepted());\n\n  ASSERT_TRUE(GetClient(0)->AwaitMutualSyncCycleCompletion(GetClient(1)));\n  ASSERT_TRUE(AllProfilesContainSamePasswordFormsAsVerifier());\n}\n<commit_msg>[sync] Re-enable TwoClientPasswords.SetPassphraseAndThenSetupSync<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\/utf_string_conversions.h\"\n#include \"chrome\/browser\/sync\/profile_sync_service_harness.h\"\n#include \"chrome\/browser\/sync\/test\/integration\/passwords_helper.h\"\n#include \"chrome\/browser\/sync\/test\/integration\/sync_test.h\"\n#include \"sync\/internal_api\/public\/engine\/model_safe_worker.h\"\n#include \"sync\/internal_api\/public\/sessions\/sync_session_snapshot.h\"\n\nusing passwords_helper::AddLogin;\nusing passwords_helper::AllProfilesContainSamePasswordForms;\nusing passwords_helper::AllProfilesContainSamePasswordFormsAsVerifier;\nusing passwords_helper::CreateTestPasswordForm;\nusing passwords_helper::GetPasswordCount;\nusing passwords_helper::GetPasswordStore;\nusing passwords_helper::GetVerifierPasswordCount;\nusing passwords_helper::GetVerifierPasswordStore;\nusing passwords_helper::ProfileContainsSamePasswordFormsAsVerifier;\nusing passwords_helper::RemoveLogin;\nusing passwords_helper::RemoveLogins;\nusing passwords_helper::SetDecryptionPassphrase;\nusing passwords_helper::SetEncryptionPassphrase;\nusing passwords_helper::UpdateLogin;\n\nusing content::PasswordForm;\n\nstatic const char* kValidPassphrase = \"passphrase!\";\nstatic const char* kAnotherValidPassphrase = \"another passphrase!\";\n\nclass TwoClientPasswordsSyncTest : public SyncTest {\n public:\n  TwoClientPasswordsSyncTest() : SyncTest(TWO_CLIENT) {}\n  virtual ~TwoClientPasswordsSyncTest() {}\n\n private:\n  DISALLOW_COPY_AND_ASSIGN(TwoClientPasswordsSyncTest);\n};\n\n\/\/ TCM ID - 3732277\nIN_PROC_BROWSER_TEST_F(TwoClientPasswordsSyncTest, Add) {\n  ASSERT_TRUE(SetupSync()) << \"SetupSync() failed.\";\n  ASSERT_TRUE(AllProfilesContainSamePasswordFormsAsVerifier());\n\n  PasswordForm form = CreateTestPasswordForm(0);\n  AddLogin(GetVerifierPasswordStore(), form);\n  ASSERT_EQ(1, GetVerifierPasswordCount());\n  AddLogin(GetPasswordStore(0), form);\n  ASSERT_EQ(1, GetPasswordCount(0));\n\n  ASSERT_TRUE(GetClient(0)->AwaitMutualSyncCycleCompletion(GetClient(1)));\n  ASSERT_TRUE(AllProfilesContainSamePasswordFormsAsVerifier());\n}\n\nIN_PROC_BROWSER_TEST_F(TwoClientPasswordsSyncTest, Race) {\n  ASSERT_TRUE(SetupSync()) << \"SetupSync() failed.\";\n  ASSERT_TRUE(AllProfilesContainSamePasswordForms());\n\n  PasswordForm form0 = CreateTestPasswordForm(0);\n  AddLogin(GetPasswordStore(0), form0);\n\n  PasswordForm form1 = form0;\n  form1.password_value = ASCIIToUTF16(\"new_password\");\n  AddLogin(GetPasswordStore(1), form1);\n\n  ASSERT_TRUE(AwaitQuiescence());\n  ASSERT_TRUE(AllProfilesContainSamePasswordForms());\n}\n\n\/\/ TCM ID - 4577932.\nIN_PROC_BROWSER_TEST_F(TwoClientPasswordsSyncTest, DisablePasswords) {\n  ASSERT_TRUE(SetupSync()) << \"SetupSync() failed.\";\n  ASSERT_TRUE(AllProfilesContainSamePasswordFormsAsVerifier());\n\n  ASSERT_TRUE(GetClient(1)->DisableSyncForDatatype(syncer::PASSWORDS));\n  PasswordForm form = CreateTestPasswordForm(0);\n  AddLogin(GetVerifierPasswordStore(), form);\n  ASSERT_EQ(1, GetVerifierPasswordCount());\n  AddLogin(GetPasswordStore(0), form);\n  ASSERT_EQ(1, GetPasswordCount(0));\n\n  ASSERT_TRUE(GetClient(0)->AwaitFullSyncCompletion(\"Added a password.\"));\n  ASSERT_TRUE(ProfileContainsSamePasswordFormsAsVerifier(0));\n  ASSERT_FALSE(ProfileContainsSamePasswordFormsAsVerifier(1));\n\n  ASSERT_TRUE(GetClient(1)->EnableSyncForDatatype(syncer::PASSWORDS));\n  ASSERT_TRUE(AwaitQuiescence());\n  ASSERT_TRUE(AllProfilesContainSamePasswordFormsAsVerifier());\n  ASSERT_EQ(1, GetPasswordCount(1));\n}\n\n\/\/ TCM ID - 4649281.\nIN_PROC_BROWSER_TEST_F(TwoClientPasswordsSyncTest, DisableSync) {\n  ASSERT_TRUE(SetupSync()) << \"SetupSync() failed.\";\n  ASSERT_TRUE(AllProfilesContainSamePasswordFormsAsVerifier());\n\n  ASSERT_TRUE(GetClient(1)->DisableSyncForAllDatatypes());\n  PasswordForm form = CreateTestPasswordForm(0);\n  AddLogin(GetVerifierPasswordStore(), form);\n  ASSERT_EQ(1, GetVerifierPasswordCount());\n  AddLogin(GetPasswordStore(0), form);\n  ASSERT_EQ(1, GetPasswordCount(0));\n\n  ASSERT_TRUE(GetClient(0)->AwaitFullSyncCompletion(\"Added a password.\"));\n  ASSERT_TRUE(ProfileContainsSamePasswordFormsAsVerifier(0));\n  ASSERT_FALSE(ProfileContainsSamePasswordFormsAsVerifier(1));\n\n  ASSERT_TRUE(GetClient(1)->EnableSyncForAllDatatypes());\n  ASSERT_TRUE(AwaitQuiescence());\n  ASSERT_TRUE(AllProfilesContainSamePasswordFormsAsVerifier());\n  ASSERT_EQ(1, GetPasswordCount(1));\n}\n\nIN_PROC_BROWSER_TEST_F(TwoClientPasswordsSyncTest, SetPassphrase) {\n  ASSERT_TRUE(SetupSync()) << \"SetupSync() failed.\";\n\n  SetEncryptionPassphrase(0, kValidPassphrase, ProfileSyncService::EXPLICIT);\n  ASSERT_TRUE(GetClient(0)->AwaitPassphraseAccepted());\n  ASSERT_TRUE(GetClient(0)->AwaitMutualSyncCycleCompletion(GetClient(1)));\n\n  ASSERT_TRUE(GetClient(1)->AwaitPassphraseRequired());\n  ASSERT_TRUE(SetDecryptionPassphrase(1, kValidPassphrase));\n  ASSERT_TRUE(GetClient(1)->AwaitPassphraseAccepted());\n  ASSERT_TRUE(GetClient(1)->AwaitFullSyncCompletion(\"Set passphrase.\"));\n}\n\nIN_PROC_BROWSER_TEST_F(TwoClientPasswordsSyncTest,\n                       SetPassphraseAndAddPassword) {\n  ASSERT_TRUE(SetupSync()) << \"SetupSync() failed.\";\n\n  SetEncryptionPassphrase(0, kValidPassphrase, ProfileSyncService::EXPLICIT);\n  ASSERT_TRUE(GetClient(0)->AwaitPassphraseAccepted());\n  ASSERT_TRUE(GetClient(0)->AwaitMutualSyncCycleCompletion(GetClient(1)));\n\n  ASSERT_TRUE(GetClient(1)->AwaitPassphraseRequired());\n  ASSERT_TRUE(SetDecryptionPassphrase(1, kValidPassphrase));\n  ASSERT_TRUE(GetClient(1)->AwaitPassphraseAccepted());\n\n  PasswordForm form = CreateTestPasswordForm(0);\n  AddLogin(GetPasswordStore(0), form);\n  ASSERT_EQ(1, GetPasswordCount(0));\n\n  ASSERT_TRUE(GetClient(0)->AwaitMutualSyncCycleCompletion(GetClient(1)));\n  ASSERT_EQ(1, GetPasswordCount(1));\n}\n\n\/\/ TCM ID - 4603879\nIN_PROC_BROWSER_TEST_F(TwoClientPasswordsSyncTest, Update) {\n  ASSERT_TRUE(SetupSync()) << \"SetupSync() failed.\";\n  ASSERT_TRUE(AllProfilesContainSamePasswordFormsAsVerifier());\n\n  PasswordForm form = CreateTestPasswordForm(0);\n  AddLogin(GetVerifierPasswordStore(), form);\n  AddLogin(GetPasswordStore(0), form);\n  ASSERT_TRUE(GetClient(0)->AwaitMutualSyncCycleCompletion(GetClient(1)));\n\n  form.password_value = ASCIIToUTF16(\"new_password\");\n  UpdateLogin(GetVerifierPasswordStore(), form);\n  UpdateLogin(GetPasswordStore(1), form);\n  ASSERT_TRUE(AwaitQuiescence());\n\n  ASSERT_EQ(1, GetVerifierPasswordCount());\n  ASSERT_TRUE(AllProfilesContainSamePasswordFormsAsVerifier());\n}\n\n\/\/ TCM ID - 3719309\nIN_PROC_BROWSER_TEST_F(TwoClientPasswordsSyncTest, Delete) {\n  ASSERT_TRUE(SetupSync()) << \"SetupSync() failed.\";\n  ASSERT_TRUE(AllProfilesContainSamePasswordFormsAsVerifier());\n\n  PasswordForm form0 = CreateTestPasswordForm(0);\n  AddLogin(GetVerifierPasswordStore(), form0);\n  AddLogin(GetPasswordStore(0), form0);\n  PasswordForm form1 = CreateTestPasswordForm(1);\n  AddLogin(GetVerifierPasswordStore(), form1);\n  AddLogin(GetPasswordStore(0), form1);\n  ASSERT_TRUE(AwaitQuiescence());\n\n  RemoveLogin(GetPasswordStore(1), form0);\n  RemoveLogin(GetVerifierPasswordStore(), form0);\n  ASSERT_TRUE(AwaitQuiescence());\n\n  ASSERT_EQ(1, GetVerifierPasswordCount());\n  ASSERT_TRUE(AllProfilesContainSamePasswordFormsAsVerifier());\n}\n\n\/\/ TCM ID - 7573511\n\/\/ Flaky on Mac and Windows: http:\/\/crbug.com\/111399\n#if defined(OS_WIN) || defined(OS_MACOSX)\n#define MAYBE_DeleteAll DISABLED_DeleteAll\n#else\n#define MAYBE_DeleteAll DeleteAll\n#endif\nIN_PROC_BROWSER_TEST_F(TwoClientPasswordsSyncTest, MAYBE_DeleteAll) {\n  ASSERT_TRUE(SetupSync()) << \"SetupSync() failed.\";\n  ASSERT_TRUE(AllProfilesContainSamePasswordFormsAsVerifier());\n\n  PasswordForm form0 = CreateTestPasswordForm(0);\n  AddLogin(GetVerifierPasswordStore(), form0);\n  AddLogin(GetPasswordStore(0), form0);\n  PasswordForm form1 = CreateTestPasswordForm(1);\n  AddLogin(GetVerifierPasswordStore(), form1);\n  AddLogin(GetPasswordStore(0), form1);\n  ASSERT_TRUE(AwaitQuiescence());\n\n  RemoveLogins(GetPasswordStore(1));\n  RemoveLogins(GetVerifierPasswordStore());\n  ASSERT_TRUE(AwaitQuiescence());\n\n  ASSERT_EQ(0, GetVerifierPasswordCount());\n  ASSERT_TRUE(AllProfilesContainSamePasswordFormsAsVerifier());\n}\n\n\/\/ TCM ID - 3694311\nIN_PROC_BROWSER_TEST_F(TwoClientPasswordsSyncTest, Merge) {\n  ASSERT_TRUE(SetupSync()) << \"SetupSync() failed.\";\n  ASSERT_TRUE(AllProfilesContainSamePasswordForms());\n\n  PasswordForm form0 = CreateTestPasswordForm(0);\n  AddLogin(GetPasswordStore(0), form0);\n  PasswordForm form1 = CreateTestPasswordForm(1);\n  AddLogin(GetPasswordStore(1), form1);\n  PasswordForm form2 = CreateTestPasswordForm(2);\n  AddLogin(GetPasswordStore(1), form2);\n  ASSERT_TRUE(AwaitQuiescence());\n\n  ASSERT_EQ(3, GetPasswordCount(0));\n  ASSERT_TRUE(AllProfilesContainSamePasswordForms());\n}\n\nIN_PROC_BROWSER_TEST_F(TwoClientPasswordsSyncTest,\n                       SetPassphraseAndThenSetupSync) {\n  ASSERT_TRUE(SetupClients()) << \"SetupClients() failed.\";\n\n  ASSERT_TRUE(GetClient(0)->SetupSync());\n  SetEncryptionPassphrase(0, kValidPassphrase, ProfileSyncService::EXPLICIT);\n  ASSERT_TRUE(GetClient(0)->AwaitPassphraseAccepted());\n  ASSERT_TRUE(GetClient(0)->AwaitFullSyncCompletion(\"Initial sync.\"));\n\n  ASSERT_FALSE(GetClient(1)->SetupSync());\n  ASSERT_TRUE(GetClient(1)->AwaitPassphraseRequired());\n  ASSERT_TRUE(SetDecryptionPassphrase(1, kValidPassphrase));\n  ASSERT_TRUE(GetClient(1)->AwaitPassphraseAccepted());\n  ASSERT_TRUE(GetClient(1)->AwaitFullSyncCompletion(\"Initial sync.\"));\n\n  \/\/ Following ensures types are enabled and active (see bug 87572).\n  syncer::ModelSafeRoutingInfo routes;\n  GetClient(0)->service()->GetModelSafeRoutingInfo(&routes);\n  ASSERT_EQ(syncer::GROUP_PASSWORD, routes[syncer::PASSWORDS]);\n  routes.clear();\n  GetClient(1)->service()->GetModelSafeRoutingInfo(&routes);\n  ASSERT_EQ(syncer::GROUP_PASSWORD, routes[syncer::PASSWORDS]);\n}\n\nIN_PROC_BROWSER_TEST_F(TwoClientPasswordsSyncTest,\n                       SetDifferentPassphraseAndThenSetupSync) {\n  ASSERT_TRUE(SetupClients()) << \"SetupClients() failed.\";\n\n  ASSERT_TRUE(GetClient(0)->SetupSync());\n  SetEncryptionPassphrase(0, kValidPassphrase, ProfileSyncService::EXPLICIT);\n  ASSERT_TRUE(GetClient(0)->AwaitPassphraseAccepted());\n  ASSERT_TRUE(GetClient(0)->AwaitFullSyncCompletion(\"Initial sync.\"));\n\n  \/\/ Setup 1 with a different passphrase, so that it fails to sync.\n  ASSERT_FALSE(GetClient(1)->SetupSync());\n  ASSERT_TRUE(GetClient(1)->AwaitPassphraseRequired());\n  ASSERT_FALSE(SetDecryptionPassphrase(1, kAnotherValidPassphrase));\n  ASSERT_TRUE(GetClient(1)->AwaitPassphraseRequired());\n\n  \/\/ Add a password on 0 while clients have different passphrases.\n  PasswordForm form0 = CreateTestPasswordForm(0);\n  AddLogin(GetVerifierPasswordStore(), form0);\n  AddLogin(GetPasswordStore(0), form0);\n\n  ASSERT_TRUE(GetClient(0)->AwaitFullSyncCompletion(\"Added a password.\"));\n\n  \/\/ Password hasn't been synced to 1 yet.\n  ASSERT_FALSE(AllProfilesContainSamePasswordFormsAsVerifier());\n\n  \/\/ Update 1 with the correct passphrase, the password should now sync over.\n  ASSERT_TRUE(GetClient(1)->AwaitPassphraseRequired());\n  ASSERT_TRUE(SetDecryptionPassphrase(1, kValidPassphrase));\n  ASSERT_TRUE(GetClient(1)->AwaitPassphraseAccepted());\n\n  ASSERT_TRUE(GetClient(0)->AwaitMutualSyncCycleCompletion(GetClient(1)));\n  ASSERT_TRUE(AllProfilesContainSamePasswordFormsAsVerifier());\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ [WriteFile Name=FindRoute, Category=RoutingAndNavigation]\n\/\/ [Legal]\n\/\/ Copyright 2016 Esri.\n\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/ [Legal]\n\n#include \"FindRoute.h\"\n\n#include \"Map.h\"\n#include \"MapQuickView.h\"\n#include \"Basemap.h\"\n#include \"ArcGISVectorTiledLayer.h\"\n#include \"GraphicsOverlay.h\"\n#include \"Viewpoint.h\"\n#include \"Point.h\"\n#include \"SpatialReference.h\"\n#include \"SimpleRenderer.h\"\n#include \"SimpleLineSymbol.h\"\n#include \"PictureMarkerSymbol.h\"\n#include \"RouteTask.h\"\n#include \"RouteParameters.h\"\n#include \"Stop.h\"\n\nusing namespace Esri::ArcGISRuntime;\n\nFindRoute::FindRoute(QQuickItem* parent) :\n    QQuickItem(parent),\n    m_map(nullptr),\n    m_mapView(nullptr),\n    m_routeGraphicsOverlay(nullptr),\n    m_stopsGraphicsOverlay(nullptr),\n    m_routeTask(nullptr),\n    m_routeParameters(),\n    m_directions(nullptr)\n{\n}\n\nFindRoute::~FindRoute()\n{\n}\n\nvoid FindRoute::componentComplete()\n{\n    QQuickItem::componentComplete();\n\n    \/\/ find QML MapView component\n    m_mapView = findChild<MapQuickView*>(\"mapView\");\n\n    \/\/ create a new basemap instance\n    auto navigationLayer = new ArcGISVectorTiledLayer(QUrl(\"http:\/\/www.arcgis.com\/home\/item.html?id=00cd8e843bae49b3a040423e5d65416b\"), this);\n    auto basemap = new Basemap(navigationLayer, this);\n\n    \/\/ create a new map instance\n    m_map = new Map(basemap, this);\n    m_map->setInitialViewpoint(Viewpoint(Point(-13041154, 3858170, SpatialReference(3857)), 1e5));\n\n    \/\/ set map on the map view\n    m_mapView->setMap(m_map);\n\n    \/\/ create initial graphics overlays\n    m_routeGraphicsOverlay = new GraphicsOverlay(this);\n    auto simpleLineSymbol = new SimpleLineSymbol(SimpleLineSymbolStyle::Solid, QColor(\"cyan\"), 4, this);\n    auto simpleRenderer = new SimpleRenderer(simpleLineSymbol, this);\n    m_routeGraphicsOverlay->setRenderer(simpleRenderer);\n    m_stopsGraphicsOverlay = new GraphicsOverlay(this);\n    m_mapView->graphicsOverlays()->append(m_routeGraphicsOverlay);\n    m_mapView->graphicsOverlays()->append(m_stopsGraphicsOverlay);\n\n    \/\/ connect to loadStatusChanged signal\n    connect(m_map, &Map::loadStatusChanged, [this](LoadStatus loadStatus)\n    {\n        if (loadStatus == LoadStatus::Loaded)\n        {\n            addStopGraphics();\n            setupRouteTask();\n        }\n    });\n}\n\nvoid FindRoute::addStopGraphics()\n{\n    \/\/ create the stop graphics' geometry\n    Point stop1Geometry(-13041171, 3860988, SpatialReference(3857));\n    Point stop2Geometry(-13041693, 3856006, SpatialReference(3857));\n\n    \/\/ create the stop graphics' symbols\n    auto stop1Symbol = getPictureMarkerSymbol(QUrl(\"qrc:\/Samples\/Routing and Navigation\/FindRoute\/pinA.png\"));\n    auto stop2Symbol = getPictureMarkerSymbol(QUrl(\"qrc:\/Samples\/Routing and Navigation\/FindRoute\/pinB.png\"));\n\n    \/\/ create the stop graphics\n    auto stop1Graphic = new Graphic(stop1Geometry, stop1Symbol, this);\n    auto stop2Graphic = new Graphic(stop2Geometry, stop2Symbol, this);\n\n    \/\/ add to the overlay\n    m_stopsGraphicsOverlay->graphics()->append(stop1Graphic);\n    m_stopsGraphicsOverlay->graphics()->append(stop2Graphic);\n}\n\n\/\/ Helper function for creating picture marker symbols\nPictureMarkerSymbol* FindRoute::getPictureMarkerSymbol(QUrl imageUrl)\n{\n    auto pictureMarkerSymbol = new PictureMarkerSymbol(imageUrl, this);\n    pictureMarkerSymbol->setWidth(32);\n    pictureMarkerSymbol->setHeight(32);\n    pictureMarkerSymbol->setOffsetY(16);\n    return pictureMarkerSymbol;\n}\n\nvoid FindRoute::setupRouteTask()\n{\n    \/\/ create the route task pointing to an online service\n    m_routeTask = new RouteTask(QUrl(\"http:\/\/sampleserver6.arcgisonline.com\/arcgis\/rest\/services\/NetworkAnalysis\/SanDiego\/NAServer\/Route\"), this);\n\n    \/\/ connect to loadStatusChanged signal\n    connect(m_routeTask, &RouteTask::loadStatusChanged, [this](LoadStatus loadStatus)\n    {\n        if (loadStatus == LoadStatus::Loaded)\n        {\n            \/\/ Request default parameters once the task is loaded\n            m_routeTask->generateDefaultParameters();\n        }\n    });\n\n    \/\/ connect to generateDefaultParametersCompleted signal\n    connect(m_routeTask, &RouteTask::generateDefaultParametersCompleted, [this](QUuid, RouteParameters routeParameters)\n    {\n        \/\/ Store the resulting route parameters\n        m_routeParameters = routeParameters;\n    });\n\n    \/\/ connect to solveRouteCompleted signal\n    connect(m_routeTask, &RouteTask::solveRouteCompleted, [this](QUuid, RouteResult routeResult)\n    {\n        \/\/ Add the route graphic once the solve completes\n        auto generatedRoute = routeResult.routes().at(0);\n        auto routeGraphic = new Graphic(generatedRoute.routeGeometry());\n        m_routeGraphicsOverlay->graphics()->append(routeGraphic);\n\n        \/\/ set the direction maneuver list model\n        m_directions = generatedRoute.directionManeuvers(this);\n        emit directionsChanged();\n\n        \/\/ emit that the route has solved successfully\n        emit solveRouteComplete();\n    });\n\n    \/\/ load the route task\n    m_routeTask->load();\n}\n\nDirectionManeuverListModel* FindRoute::directions()\n{\n    return m_directions;\n}\n\nvoid FindRoute::solveRoute()\n{\n    if (!m_routeParameters.isEmpty())\n    {\n        \/\/ set parameters to return directions\n        m_routeParameters.setReturnDirections(true);\n\n        \/\/ clear previous route graphics\n        m_routeGraphicsOverlay->graphics()->clear();\n\n        \/\/ clear previous stops from the parameters\n        m_routeParameters.clearStops();\n\n        \/\/ set the stops to the parameters\n        Stop stop1(m_stopsGraphicsOverlay->graphics()->at(0)->geometry());\n        stop1.setName(\"Origin\");\n        Stop stop2(m_stopsGraphicsOverlay->graphics()->at(1)->geometry());\n        stop2.setName(\"Destination\");\n        m_routeParameters.setStops(QList<Stop>() << stop1 << stop2);\n\n        \/\/ solve the route with the parameters\n        m_routeTask->solveRoute(m_routeParameters);\n    }\n}\n<commit_msg>Update FindRoute.cpp<commit_after>\/\/ [WriteFile Name=FindRoute, Category=RoutingAndNavigation]\n\/\/ [Legal]\n\/\/ Copyright 2016 Esri.\n\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/ [Legal]\n\n#include \"FindRoute.h\"\n\n#include \"Map.h\"\n#include \"MapQuickView.h\"\n#include \"Basemap.h\"\n#include \"ArcGISVectorTiledLayer.h\"\n#include \"GraphicsOverlay.h\"\n#include \"Viewpoint.h\"\n#include \"Point.h\"\n#include \"SpatialReference.h\"\n#include \"SimpleRenderer.h\"\n#include \"SimpleLineSymbol.h\"\n#include \"PictureMarkerSymbol.h\"\n#include \"RouteTask.h\"\n#include \"RouteParameters.h\"\n#include \"Stop.h\"\n\nusing namespace Esri::ArcGISRuntime;\n\nFindRoute::FindRoute(QQuickItem* parent) :\n    QQuickItem(parent),\n    m_map(nullptr),\n    m_mapView(nullptr),\n    m_routeGraphicsOverlay(nullptr),\n    m_stopsGraphicsOverlay(nullptr),\n    m_routeTask(nullptr),\n    m_routeParameters(),\n    m_directions(nullptr)\n{\n}\n\nFindRoute::~FindRoute()\n{\n}\n\nvoid FindRoute::componentComplete()\n{\n    QQuickItem::componentComplete();\n\n    \/\/ find QML MapView component\n    m_mapView = findChild<MapQuickView*>(\"mapView\");\n\n    \/\/ create a new basemap instance\n    auto navigationLayer = new ArcGISVectorTiledLayer(QUrl(\"http:\/\/www.arcgis.com\/home\/item.html?id=dcbbba0edf094eaa81af19298b9c6247\"), this);\n    auto basemap = new Basemap(navigationLayer, this);\n\n    \/\/ create a new map instance\n    m_map = new Map(basemap, this);\n    m_map->setInitialViewpoint(Viewpoint(Point(-13041154, 3858170, SpatialReference(3857)), 1e5));\n\n    \/\/ set map on the map view\n    m_mapView->setMap(m_map);\n\n    \/\/ create initial graphics overlays\n    m_routeGraphicsOverlay = new GraphicsOverlay(this);\n    auto simpleLineSymbol = new SimpleLineSymbol(SimpleLineSymbolStyle::Solid, QColor(\"cyan\"), 4, this);\n    auto simpleRenderer = new SimpleRenderer(simpleLineSymbol, this);\n    m_routeGraphicsOverlay->setRenderer(simpleRenderer);\n    m_stopsGraphicsOverlay = new GraphicsOverlay(this);\n    m_mapView->graphicsOverlays()->append(m_routeGraphicsOverlay);\n    m_mapView->graphicsOverlays()->append(m_stopsGraphicsOverlay);\n\n    \/\/ connect to loadStatusChanged signal\n    connect(m_map, &Map::loadStatusChanged, [this](LoadStatus loadStatus)\n    {\n        if (loadStatus == LoadStatus::Loaded)\n        {\n            addStopGraphics();\n            setupRouteTask();\n        }\n    });\n}\n\nvoid FindRoute::addStopGraphics()\n{\n    \/\/ create the stop graphics' geometry\n    Point stop1Geometry(-13041171, 3860988, SpatialReference(3857));\n    Point stop2Geometry(-13041693, 3856006, SpatialReference(3857));\n\n    \/\/ create the stop graphics' symbols\n    auto stop1Symbol = getPictureMarkerSymbol(QUrl(\"qrc:\/Samples\/Routing and Navigation\/FindRoute\/pinA.png\"));\n    auto stop2Symbol = getPictureMarkerSymbol(QUrl(\"qrc:\/Samples\/Routing and Navigation\/FindRoute\/pinB.png\"));\n\n    \/\/ create the stop graphics\n    auto stop1Graphic = new Graphic(stop1Geometry, stop1Symbol, this);\n    auto stop2Graphic = new Graphic(stop2Geometry, stop2Symbol, this);\n\n    \/\/ add to the overlay\n    m_stopsGraphicsOverlay->graphics()->append(stop1Graphic);\n    m_stopsGraphicsOverlay->graphics()->append(stop2Graphic);\n}\n\n\/\/ Helper function for creating picture marker symbols\nPictureMarkerSymbol* FindRoute::getPictureMarkerSymbol(QUrl imageUrl)\n{\n    auto pictureMarkerSymbol = new PictureMarkerSymbol(imageUrl, this);\n    pictureMarkerSymbol->setWidth(32);\n    pictureMarkerSymbol->setHeight(32);\n    pictureMarkerSymbol->setOffsetY(16);\n    return pictureMarkerSymbol;\n}\n\nvoid FindRoute::setupRouteTask()\n{\n    \/\/ create the route task pointing to an online service\n    m_routeTask = new RouteTask(QUrl(\"http:\/\/sampleserver6.arcgisonline.com\/arcgis\/rest\/services\/NetworkAnalysis\/SanDiego\/NAServer\/Route\"), this);\n\n    \/\/ connect to loadStatusChanged signal\n    connect(m_routeTask, &RouteTask::loadStatusChanged, [this](LoadStatus loadStatus)\n    {\n        if (loadStatus == LoadStatus::Loaded)\n        {\n            \/\/ Request default parameters once the task is loaded\n            m_routeTask->generateDefaultParameters();\n        }\n    });\n\n    \/\/ connect to generateDefaultParametersCompleted signal\n    connect(m_routeTask, &RouteTask::generateDefaultParametersCompleted, [this](QUuid, RouteParameters routeParameters)\n    {\n        \/\/ Store the resulting route parameters\n        m_routeParameters = routeParameters;\n    });\n\n    \/\/ connect to solveRouteCompleted signal\n    connect(m_routeTask, &RouteTask::solveRouteCompleted, [this](QUuid, RouteResult routeResult)\n    {\n        \/\/ Add the route graphic once the solve completes\n        auto generatedRoute = routeResult.routes().at(0);\n        auto routeGraphic = new Graphic(generatedRoute.routeGeometry());\n        m_routeGraphicsOverlay->graphics()->append(routeGraphic);\n\n        \/\/ set the direction maneuver list model\n        m_directions = generatedRoute.directionManeuvers(this);\n        emit directionsChanged();\n\n        \/\/ emit that the route has solved successfully\n        emit solveRouteComplete();\n    });\n\n    \/\/ load the route task\n    m_routeTask->load();\n}\n\nDirectionManeuverListModel* FindRoute::directions()\n{\n    return m_directions;\n}\n\nvoid FindRoute::solveRoute()\n{\n    if (!m_routeParameters.isEmpty())\n    {\n        \/\/ set parameters to return directions\n        m_routeParameters.setReturnDirections(true);\n\n        \/\/ clear previous route graphics\n        m_routeGraphicsOverlay->graphics()->clear();\n\n        \/\/ clear previous stops from the parameters\n        m_routeParameters.clearStops();\n\n        \/\/ set the stops to the parameters\n        Stop stop1(m_stopsGraphicsOverlay->graphics()->at(0)->geometry());\n        stop1.setName(\"Origin\");\n        Stop stop2(m_stopsGraphicsOverlay->graphics()->at(1)->geometry());\n        stop2.setName(\"Destination\");\n        m_routeParameters.setStops(QList<Stop>() << stop1 << stop2);\n\n        \/\/ solve the route with the parameters\n        m_routeTask->solveRoute(m_routeParameters);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*    Copyright (c) 2010-2012, Delft University of Technology\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 *      - Redistributions of source code must retain the above copyright notice, this list of\n *        conditions and the following disclaimer.\n *      - Redistributions in binary form must reproduce the above copyright notice, this list of\n *        conditions and the following disclaimer in the documentation and\/or other materials\n *        provided with the distribution.\n *      - Neither the name of the Delft University of Technology nor the names of its contributors\n *        may be 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 EXPRESS\n *    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 THE\n *    COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n *    EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE\n *    GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n *    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\n *    OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *    Changelog\n *      YYMMDD    Author            Comment\n *      120701    A. Ronse          Creation of code.\n *\n *    References\n *      Data source for validation figures:\n *                        http:\/\/celestrak.com\/SpaceData\/sw19571001.txt\n *\n *\/\n\n#define BOOST_TEST_MAIN\n\n#include <istream>\n#include <string>\n#include <vector>\n\n#include <boost\/shared_ptr.hpp>\n#include <boost\/test\/unit_test.hpp>\n\n#include <Eigen\/Core>\n\n#include \"Tudat\/InputOutput\/parsedDataVectorUtilities.h\"\n#include \"Tudat\/Astrodynamics\/Radiation\/parseSolarActivityData.h\"\n#include \"Tudat\/Astrodynamics\/Radiation\/extractSolarActivityData.h\"\n#include \"Tudat\/Astrodynamics\/Radiation\/solarActivityData.h\"\n#include \"Tudat\/InputOutput\/basicInputOutput.h\"\n\n#include <TudatCore\/Basics\/testMacros.h>\n\nnamespace tudat\n{\nnamespace unit_tests\n{\n\nBOOST_AUTO_TEST_SUITE( test_Solar_Activity_Parser_Extractor )\n\n\/\/! Test parsing and extraction process of solar dummy activity file\nBOOST_AUTO_TEST_CASE( test_parsing_and_extraction )\n{\ntudat::input_output::parsed_data_vector_utilities::ParsedDataVectorPtr parsedDataVectorPtr;\n\ntudat::radiation::solar_activity::ParseSolarActivityData solarActivityParser;\ntudat::radiation::solar_activity::ExtractSolarActivityData solarActivityExtractor;\n\n\/\/ Parse file\nstd::string fileName = tudat::input_output::getTudatRootPath( ) +\n                       \"Astrodynamics\/Radiation\/UnitTests\/testSolarActivity.txt\";\nstd::ifstream dataFile;\ndataFile.open(fileName.c_str(), std::ifstream::in);\nparsedDataVectorPtr = solarActivityParser.parse( dataFile );\ndataFile.close();\n\n\/\/ Extract data to object of solarActivityData class\nstd::vector< boost::shared_ptr<tudat::radiation::solar_activity::SolarActivityData> >\n        solarActivityData( 6 );\nsolarActivityData[0] = solarActivityExtractor.extract( parsedDataVectorPtr->at( 0 ) );\nsolarActivityData[1] = solarActivityExtractor.extract( parsedDataVectorPtr->at( 3 ) );\nsolarActivityData[2] = solarActivityExtractor.extract( parsedDataVectorPtr->at( 8 ) );\nsolarActivityData[3] = solarActivityExtractor.extract( parsedDataVectorPtr->at( 9 ) );\nsolarActivityData[4] = solarActivityExtractor.extract( parsedDataVectorPtr->at( 12 ) );\nsolarActivityData[5] = solarActivityExtractor.extract( parsedDataVectorPtr->at( 15 ) );\n\n\/\/ Check single parameters\nBOOST_CHECK_EQUAL(  solarActivityData[0]->dataType, 1 );\nBOOST_CHECK_EQUAL(  solarActivityData[1]->planetaryDailyCharacterFigure, 0.0 );\nBOOST_CHECK_EQUAL(  solarActivityData[1]->solarRadioFlux107Adjusted, 103.0 );\nBOOST_CHECK_EQUAL(  solarActivityData[2]->month, 5 );\nBOOST_CHECK_EQUAL(  solarActivityData[2]->internationalSunspotNumber, 0 );\nBOOST_CHECK_EQUAL(  solarActivityData[3]->planetaryRangeIndexSum, 176 );\nBOOST_CHECK_EQUAL(  solarActivityData[3]->planetaryDailyCharacterFigureConverted, 0 );\nBOOST_CHECK_EQUAL(  solarActivityData[4]->bartelsSolarRotationNumber, 2441 );\nBOOST_CHECK_EQUAL(  solarActivityData[5]->last81DaySolarRadioFlux107Observed, 187.8 );\n\n\/\/ Check planetaryEquivalentAmplitudeVectors\nEigen::VectorXd correctPlanetaryEquivalentAmplitudeVector1( 8 );\ncorrectPlanetaryEquivalentAmplitudeVector1 << 32, 27, 15, 7, 22, 9, 32, 22;\nEigen::VectorXd correctPlanetaryEquivalentAmplitudeVector2 = Eigen::VectorXd::Zero( 8 );\n\nTUDAT_CHECK_MATRIX_CLOSE(  solarActivityData[0]->planetaryEquivalentAmplitudeVector,\n                    correctPlanetaryEquivalentAmplitudeVector1, 0 );\nTUDAT_CHECK_MATRIX_CLOSE(  solarActivityData[4]->planetaryEquivalentAmplitudeVector,\n                    correctPlanetaryEquivalentAmplitudeVector2 , 0);\nTUDAT_CHECK_MATRIX_CLOSE(  solarActivityData[5]->planetaryEquivalentAmplitudeVector,\n                    correctPlanetaryEquivalentAmplitudeVector2, 0 );\n}\n\nBOOST_AUTO_TEST_SUITE_END( )\n\n}   \/\/ unit_tests\n}   \/\/ tudat\n<commit_msg>Update current Tudat<commit_after>\/*    Copyright (c) 2010-2016, Delft University of Technology\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 *      - Redistributions of source code must retain the above copyright notice, this list of\n *        conditions and the following disclaimer.\n *      - Redistributions in binary form must reproduce the above copyright notice, this list of\n *        conditions and the following disclaimer in the documentation and\/or other materials\n *        provided with the distribution.\n *      - Neither the name of the Delft University of Technology nor the names of its contributors\n *        may be 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 EXPRESS\n *    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 THE\n *    COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n *    EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE\n *    GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n *    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\n *    OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *    Changelog\n *      YYMMDD    Author            Comment\n *      120701    A. Ronse          Creation of code.\n *      160324    R. Hoogendoorn    Update for use in current version of Tudat\n *\n *    References\n *      Data source for validation figures:\n *                        http:\/\/celestrak.com\/SpaceData\/sw19571001.txt\n *\n *\/\n\n#define BOOST_TEST_MAIN\n\n#include <istream>\n#include <string>\n#include <vector>\n\n#include <boost\/shared_ptr.hpp>\n#include <boost\/test\/unit_test.hpp>\n\n#include <Eigen\/Core>\n\n#include \"Tudat\/InputOutput\/parsedDataVectorUtilities.h\"\n#include \"Tudat\/Astrodynamics\/Radiation\/parseSolarActivityData.h\"\n#include \"Tudat\/Astrodynamics\/Radiation\/extractSolarActivityData.h\"\n#include \"Tudat\/Astrodynamics\/Radiation\/solarActivityData.h\"\n#include \"Tudat\/InputOutput\/basicInputOutput.h\"\n\n#include <tudat\/Basics\/testMacros.h>\n\nnamespace tudat\n{\nnamespace unit_tests\n{\n\nBOOST_AUTO_TEST_SUITE( test_Solar_Activity_Parser_Extractor )\n\n\/\/! Test parsing and extraction process of solar dummy activity file\nBOOST_AUTO_TEST_CASE( test_parsing_and_extraction )\n{\ntudat::input_output::parsed_data_vector_utilities::ParsedDataVectorPtr parsedDataVectorPtr;\n\ntudat::radiation::solar_activity::ParseSolarActivityData solarActivityParser;\ntudat::radiation::solar_activity::ExtractSolarActivityData solarActivityExtractor;\n\n\/\/ Parse file\n\/\/ save path of cpp file\nstd::string cppPath( __FILE__ );\n\n\/\/ Strip filename from temporary string and return root-path string.\nstd::string folder = cppPath.substr( 0, cppPath.find_last_of(\"\/\\\\\")+1);\nstd::string filePath = folder + \"testSolarActivity.txt\" ;\n\/\/std::string fileName = tudat::input_output::getTudatRootPath( ) +\n\/\/                       \"Astrodynamics\/Radiation\/UnitTests\/testSolarActivity.txt\";\n\n\/\/ Open dataFile\nstd::ifstream dataFile;\n\/\/dataFile.open(fileName.c_str(), std::ifstream::in);\ndataFile.open(filePath.c_str(), std::ifstream::in);\nparsedDataVectorPtr = solarActivityParser.parse( dataFile );\ndataFile.close();\n\n\/\/ Extract data to object of solarActivityData class\nstd::vector< boost::shared_ptr<tudat::radiation::solar_activity::SolarActivityData> >\n        solarActivityData( 6 );\nsolarActivityData[0] = solarActivityExtractor.extract( parsedDataVectorPtr->at( 0 ) );\nsolarActivityData[1] = solarActivityExtractor.extract( parsedDataVectorPtr->at( 3 ) );\nsolarActivityData[2] = solarActivityExtractor.extract( parsedDataVectorPtr->at( 8 ) );\nsolarActivityData[3] = solarActivityExtractor.extract( parsedDataVectorPtr->at( 9 ) );\nsolarActivityData[4] = solarActivityExtractor.extract( parsedDataVectorPtr->at( 12 ) );\nsolarActivityData[5] = solarActivityExtractor.extract( parsedDataVectorPtr->at( 15 ) );\n\n\/\/ Check single parameters\nBOOST_CHECK_EQUAL(  solarActivityData[0]->dataType, 1 );\nBOOST_CHECK_EQUAL(  solarActivityData[1]->planetaryDailyCharacterFigure, 0.0 );\nBOOST_CHECK_EQUAL(  solarActivityData[1]->solarRadioFlux107Adjusted, 103.0 );\nBOOST_CHECK_EQUAL(  solarActivityData[2]->month, 5 );\nBOOST_CHECK_EQUAL(  solarActivityData[2]->internationalSunspotNumber, 0 );\nBOOST_CHECK_EQUAL(  solarActivityData[3]->planetaryRangeIndexSum, 176 );\nBOOST_CHECK_EQUAL(  solarActivityData[3]->planetaryDailyCharacterFigureConverted, 0 );\nBOOST_CHECK_EQUAL(  solarActivityData[4]->bartelsSolarRotationNumber, 2441 );\nBOOST_CHECK_EQUAL(  solarActivityData[5]->last81DaySolarRadioFlux107Observed, 187.8 );\n\n\/\/ Check planetaryEquivalentAmplitudeVectors\nEigen::VectorXd correctPlanetaryEquivalentAmplitudeVector1( 8 );\ncorrectPlanetaryEquivalentAmplitudeVector1 << 32, 27, 15, 7, 22, 9, 32, 22;\nEigen::VectorXd correctPlanetaryEquivalentAmplitudeVector2 = Eigen::VectorXd::Zero( 8 );\n\nTUDAT_CHECK_MATRIX_CLOSE(  solarActivityData[0]->planetaryEquivalentAmplitudeVector,\n                    correctPlanetaryEquivalentAmplitudeVector1, 0 );\nTUDAT_CHECK_MATRIX_CLOSE(  solarActivityData[4]->planetaryEquivalentAmplitudeVector,\n                    correctPlanetaryEquivalentAmplitudeVector2 , 0);\nTUDAT_CHECK_MATRIX_CLOSE(  solarActivityData[5]->planetaryEquivalentAmplitudeVector,\n                    correctPlanetaryEquivalentAmplitudeVector2, 0 );\n}\n\nBOOST_AUTO_TEST_SUITE_END( )\n\n}   \/\/ unit_tests\n}   \/\/ tudat\n<|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/base:$Id$\n\/\/ Author: Rene Brun   05\/02\/2007\n\/*************************************************************************\n * Copyright (C) 1995-2007, 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\/\/ TVirtualStreamerInfo   Abstract Interface class                      \/\/\n\/\/                                                                      \/\/\n\/\/ Abstract Interface describing Streamer information for one class.    \/\/\n\/\/                                                                      \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"TROOT.h\"\n#include \"TSystem.h\"\n#include \"TClass.h\"\n#include \"TVirtualStreamerInfo.h\"\n#include \"TPluginManager.h\"\n#include \"TStreamerElement.h\"\n#include \"TError.h\"\n\n\nTVirtualStreamerInfo *TVirtualStreamerInfo::fgInfoFactory    = 0;\n\nBool_t  TVirtualStreamerInfo::fgCanDelete        = kTRUE;\nBool_t  TVirtualStreamerInfo::fgOptimize         = kTRUE;\nBool_t  TVirtualStreamerInfo::fgStreamMemberWise = kTRUE;\n\nClassImp(TVirtualStreamerInfo)\n\n\/\/______________________________________________________________________________\nTVirtualStreamerInfo::TVirtualStreamerInfo() : fOptimized(kFALSE), fIsBuilt(kFALSE)\n{\n   \/\/ Default constructor.\n\n}\n\n\/\/______________________________________________________________________________\nTVirtualStreamerInfo::TVirtualStreamerInfo(TClass *cl)\n   : TNamed(cl->GetName(),\"\"), fOptimized(kFALSE), fIsBuilt(kFALSE)\n{\n   \/\/ Default constructor.\n\n}\n\n\/\/______________________________________________________________________________\nTVirtualStreamerInfo::TVirtualStreamerInfo(const TVirtualStreamerInfo& info)\n  : TNamed(info), fOptimized(kFALSE), fIsBuilt(kFALSE)\n{ \n   \/\/copy constructor\n}\n\n\/\/______________________________________________________________________________\nTVirtualStreamerInfo& TVirtualStreamerInfo::operator=(const TVirtualStreamerInfo& info)\n{\n   \/\/assignment operator\n   if(this!=&info) {\n      TNamed::operator=(info);\n   } \n   return *this;\n}\n\n\/\/______________________________________________________________________________\nTVirtualStreamerInfo::~TVirtualStreamerInfo()\n{\n   \/\/ Destructor\n\n}\n\n\/\/______________________________________________________________________________\nBool_t TVirtualStreamerInfo::CanDelete()\n{\n   \/\/ static function returning true if ReadBuffer can delete object\n   return fgCanDelete;\n}\n\n\/\/______________________________________________________________________________\nBool_t TVirtualStreamerInfo::CanOptimize()\n{\n   \/\/ static function returning true if optimization can be on\n   return fgOptimize;\n}\n\n\/\/______________________________________________________________________________\nTStreamerBasicType *TVirtualStreamerInfo::GetElementCounter(const char *countName, TClass *cl)\n{\n   \/\/ Get pointer to a TStreamerBasicType in TClass *cl\n   \/\/static function\n\n   TObjArray *sinfos = cl->GetStreamerInfos();\n   TVirtualStreamerInfo *info = (TVirtualStreamerInfo *)sinfos->At(cl->GetClassVersion());\n\n   if (!info || !info->IsBuilt()) {\n      \/\/ Even if the streamerInfo exist, it could still need to be 'build'\n      \/\/ It is important to figure this out, because\n      \/\/   a) if it is not build, we need to build\n      \/\/   b) if is build, we should not build it (or we could end up in an\n      \/\/      infinite loop, if the element and its counter are in the same\n      \/\/      class!\n\n      info = cl->GetStreamerInfo();\n   }\n   if (!info) return 0;\n   TStreamerElement *element = (TStreamerElement *)info->GetElements()->FindObject(countName);\n   if (!element) return 0;\n   if (element->IsA() == TStreamerBasicType::Class()) return (TStreamerBasicType*)element;\n   return 0;\n}\n\n\/\/______________________________________________________________________________\nBool_t TVirtualStreamerInfo::GetStreamMemberWise()\n{\n   \/\/ Return whether the TStreamerInfos will save the collections in\n   \/\/ \"member-wise\" order whenever possible.    The default is to store member-wise.\n   \/\/ kTRUE indicates member-wise storing\n   \/\/ kFALSE inddicates object-wise storing\n   \/\/\n   \/\/ A collection can be saved member wise when it contain is guaranteed to be\n   \/\/ homogeneous.  For example std::vector<THit> can be stored member wise,\n   \/\/ while std::vector<THit*> can not (possible use of polymorphism).\n\n   return fgStreamMemberWise;\n}\n\n\/\/______________________________________________________________________________\nvoid TVirtualStreamerInfo::Optimize(Bool_t opt)\n{\n   \/\/  This is a static function.\n   \/\/  Set optimization option.\n   \/\/  When this option is activated (default), consecutive data members\n   \/\/  of the same type are merged into an array (faster).\n   \/\/  Optimization must be off in TTree split mode.\n\n   fgOptimize = opt;\n}\n\n\/\/______________________________________________________________________________\nTVirtualStreamerInfo *TVirtualStreamerInfo::Factory()\n{\n   \/\/ Static function returning a pointer to a new TVirtualStreamerInfo object.\n   \/\/ If the Info factory does not exist, it is created via the plugin manager.\n   \/\/ In reality the factory is an empty TStreamerInfo object.\n\n   if (!fgInfoFactory) {\n      TPluginHandler *h;\n      if ((h = gROOT->GetPluginManager()->FindHandler(\"TVirtualStreamerInfo\",\"TStreamerInfo\"))) {\n         if (h->LoadPlugin() == -1) {\n            ::Fatal(\"TVirtualStreamerInfo::Factory\",\n                    \"The plugin handler for TVirtualStreamerInfo was found but failed to load!\");\n         } else {\n            fgInfoFactory = (TVirtualStreamerInfo*) h->ExecPlugin(0);\n         }\n      } else {\n         TString filename(\"$ROOTSYS\/etc\/plugins\/TVirtualStreamerInfo\");\n         gSystem->ExpandPathName(filename);\n         if (gSystem->AccessPathName(filename)) {            \n            ::Fatal(\"TVirtualStreamerInfo::Factory\",\n                    \"Cannot find the plugin handler for TVirtualStreamerInfo! \"\n                    \"$ROOTSYS\/etc\/plugins\/TVirtualStreamerInfo does not exist \"\n                    \"or is inaccessible.\");\n         } else {\n            ::Fatal(\"TVirtualStreamerInfo::Factory\",\n                    \"Cannot find the plugin handler for TVirtualStreamerInfo! \"\n                    \"However $ROOTSYS\/etc\/plugins\/TVirtualStreamerInfo is accessible, \"\n                    \"Check the content of this directory!\");\n         }\n      }\n   }\n\n   if (fgInfoFactory) return fgInfoFactory;\n   return 0;\n}\n\n\/\/______________________________________________________________________________\nvoid TVirtualStreamerInfo::SetCanDelete(Bool_t opt)\n{\n   \/\/  This is a static function.\n   \/\/  Set object delete option.\n   \/\/  When this option is activated (default), ReadBuffer automatically\n   \/\/  delete objects when a data member is a pointer to an object.\n   \/\/  If your constructor is not presetting pointers to 0, you must\n   \/\/  call this static function TStreamerInfo::SetCanDelete(kFALSE);\n\n   fgCanDelete = opt;\n}\n\n\/\/______________________________________________________________________________\nvoid TVirtualStreamerInfo::SetFactory(TVirtualStreamerInfo *factory)\n{\n   \/\/static function: Set the StreamerInfo factory\n   fgInfoFactory = factory;\n}\n\n\/\/______________________________________________________________________________\nBool_t TVirtualStreamerInfo::SetStreamMemberWise(Bool_t enable)\n{\n   \/\/ Set whether the TStreamerInfos will save the collections in\n   \/\/ \"member-wise\" order whenever possible.  The default is to store member-wise.\n   \/\/ kTRUE indicates member-wise storing\n   \/\/ kFALSE inddicates object-wise storing\n   \/\/ This function returns the previous value of fgStreamMemberWise.\n\n   \/\/ A collection can be saved member wise when it contain is guaranteed to be\n   \/\/ homogeneous.  For example std::vector<THit> can be stored member wise,\n   \/\/ while std::vector<THit*> can not (possible use of polymorphism).\n\n   Bool_t prev = fgStreamMemberWise;\n   fgStreamMemberWise = enable;\n   return prev;\n}\n\n\/\/______________________________________________________________________________\nvoid TVirtualStreamerInfo::Streamer(TBuffer &R__b)\n{\n   \/\/ Stream an object of class TVirtualStreamerInfo.\n\n   TNamed::Streamer(R__b);\n}\n<commit_msg>Addendum to revision 43288: add one more test that the Factory has been properly created and always return the value of the static variable.  This should quiet down coverity<commit_after>\/\/ @(#)root\/base:$Id$\n\/\/ Author: Rene Brun   05\/02\/2007\n\/*************************************************************************\n * Copyright (C) 1995-2007, 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\/\/ TVirtualStreamerInfo   Abstract Interface class                      \/\/\n\/\/                                                                      \/\/\n\/\/ Abstract Interface describing Streamer information for one class.    \/\/\n\/\/                                                                      \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"TROOT.h\"\n#include \"TSystem.h\"\n#include \"TClass.h\"\n#include \"TVirtualStreamerInfo.h\"\n#include \"TPluginManager.h\"\n#include \"TStreamerElement.h\"\n#include \"TError.h\"\n\n\nTVirtualStreamerInfo *TVirtualStreamerInfo::fgInfoFactory    = 0;\n\nBool_t  TVirtualStreamerInfo::fgCanDelete        = kTRUE;\nBool_t  TVirtualStreamerInfo::fgOptimize         = kTRUE;\nBool_t  TVirtualStreamerInfo::fgStreamMemberWise = kTRUE;\n\nClassImp(TVirtualStreamerInfo)\n\n\/\/______________________________________________________________________________\nTVirtualStreamerInfo::TVirtualStreamerInfo() : fOptimized(kFALSE), fIsBuilt(kFALSE)\n{\n   \/\/ Default constructor.\n\n}\n\n\/\/______________________________________________________________________________\nTVirtualStreamerInfo::TVirtualStreamerInfo(TClass *cl)\n   : TNamed(cl->GetName(),\"\"), fOptimized(kFALSE), fIsBuilt(kFALSE)\n{\n   \/\/ Default constructor.\n\n}\n\n\/\/______________________________________________________________________________\nTVirtualStreamerInfo::TVirtualStreamerInfo(const TVirtualStreamerInfo& info)\n  : TNamed(info), fOptimized(kFALSE), fIsBuilt(kFALSE)\n{ \n   \/\/copy constructor\n}\n\n\/\/______________________________________________________________________________\nTVirtualStreamerInfo& TVirtualStreamerInfo::operator=(const TVirtualStreamerInfo& info)\n{\n   \/\/assignment operator\n   if(this!=&info) {\n      TNamed::operator=(info);\n   } \n   return *this;\n}\n\n\/\/______________________________________________________________________________\nTVirtualStreamerInfo::~TVirtualStreamerInfo()\n{\n   \/\/ Destructor\n\n}\n\n\/\/______________________________________________________________________________\nBool_t TVirtualStreamerInfo::CanDelete()\n{\n   \/\/ static function returning true if ReadBuffer can delete object\n   return fgCanDelete;\n}\n\n\/\/______________________________________________________________________________\nBool_t TVirtualStreamerInfo::CanOptimize()\n{\n   \/\/ static function returning true if optimization can be on\n   return fgOptimize;\n}\n\n\/\/______________________________________________________________________________\nTStreamerBasicType *TVirtualStreamerInfo::GetElementCounter(const char *countName, TClass *cl)\n{\n   \/\/ Get pointer to a TStreamerBasicType in TClass *cl\n   \/\/static function\n\n   TObjArray *sinfos = cl->GetStreamerInfos();\n   TVirtualStreamerInfo *info = (TVirtualStreamerInfo *)sinfos->At(cl->GetClassVersion());\n\n   if (!info || !info->IsBuilt()) {\n      \/\/ Even if the streamerInfo exist, it could still need to be 'build'\n      \/\/ It is important to figure this out, because\n      \/\/   a) if it is not build, we need to build\n      \/\/   b) if is build, we should not build it (or we could end up in an\n      \/\/      infinite loop, if the element and its counter are in the same\n      \/\/      class!\n\n      info = cl->GetStreamerInfo();\n   }\n   if (!info) return 0;\n   TStreamerElement *element = (TStreamerElement *)info->GetElements()->FindObject(countName);\n   if (!element) return 0;\n   if (element->IsA() == TStreamerBasicType::Class()) return (TStreamerBasicType*)element;\n   return 0;\n}\n\n\/\/______________________________________________________________________________\nBool_t TVirtualStreamerInfo::GetStreamMemberWise()\n{\n   \/\/ Return whether the TStreamerInfos will save the collections in\n   \/\/ \"member-wise\" order whenever possible.    The default is to store member-wise.\n   \/\/ kTRUE indicates member-wise storing\n   \/\/ kFALSE inddicates object-wise storing\n   \/\/\n   \/\/ A collection can be saved member wise when it contain is guaranteed to be\n   \/\/ homogeneous.  For example std::vector<THit> can be stored member wise,\n   \/\/ while std::vector<THit*> can not (possible use of polymorphism).\n\n   return fgStreamMemberWise;\n}\n\n\/\/______________________________________________________________________________\nvoid TVirtualStreamerInfo::Optimize(Bool_t opt)\n{\n   \/\/  This is a static function.\n   \/\/  Set optimization option.\n   \/\/  When this option is activated (default), consecutive data members\n   \/\/  of the same type are merged into an array (faster).\n   \/\/  Optimization must be off in TTree split mode.\n\n   fgOptimize = opt;\n}\n\n\/\/______________________________________________________________________________\nTVirtualStreamerInfo *TVirtualStreamerInfo::Factory()\n{\n   \/\/ Static function returning a pointer to a new TVirtualStreamerInfo object.\n   \/\/ If the Info factory does not exist, it is created via the plugin manager.\n   \/\/ In reality the factory is an empty TStreamerInfo object.\n\n   if (!fgInfoFactory) {\n      TPluginHandler *h;\n      if ((h = gROOT->GetPluginManager()->FindHandler(\"TVirtualStreamerInfo\",\"TStreamerInfo\"))) {\n         if (h->LoadPlugin() == -1) {\n            ::Fatal(\"TVirtualStreamerInfo::Factory\",\n                    \"The plugin handler for TVirtualStreamerInfo was found but failed to load!\");\n         } \n         fgInfoFactory = (TVirtualStreamerInfo*) h->ExecPlugin(0);\n         if (fgInfoFactory == 0) {\n            ::Fatal(\"TVirtualStreamerInfo::Factory\",\n                    \"The plugin handler for TVirtualStreamerInfo was found but failed to create the factory object!\");\n         }\n      } else {\n         TString filename(\"$ROOTSYS\/etc\/plugins\/TVirtualStreamerInfo\");\n         gSystem->ExpandPathName(filename);\n         if (gSystem->AccessPathName(filename)) {            \n            ::Fatal(\"TVirtualStreamerInfo::Factory\",\n                    \"Cannot find the plugin handler for TVirtualStreamerInfo! \"\n                    \"$ROOTSYS\/etc\/plugins\/TVirtualStreamerInfo does not exist \"\n                    \"or is inaccessible.\");\n         } else {\n            ::Fatal(\"TVirtualStreamerInfo::Factory\",\n                    \"Cannot find the plugin handler for TVirtualStreamerInfo! \"\n                    \"However $ROOTSYS\/etc\/plugins\/TVirtualStreamerInfo is accessible, \"\n                    \"Check the content of this directory!\");\n         }\n      }\n   }\n\n   return fgInfoFactory;\n}\n\n\/\/______________________________________________________________________________\nvoid TVirtualStreamerInfo::SetCanDelete(Bool_t opt)\n{\n   \/\/  This is a static function.\n   \/\/  Set object delete option.\n   \/\/  When this option is activated (default), ReadBuffer automatically\n   \/\/  delete objects when a data member is a pointer to an object.\n   \/\/  If your constructor is not presetting pointers to 0, you must\n   \/\/  call this static function TStreamerInfo::SetCanDelete(kFALSE);\n\n   fgCanDelete = opt;\n}\n\n\/\/______________________________________________________________________________\nvoid TVirtualStreamerInfo::SetFactory(TVirtualStreamerInfo *factory)\n{\n   \/\/static function: Set the StreamerInfo factory\n   fgInfoFactory = factory;\n}\n\n\/\/______________________________________________________________________________\nBool_t TVirtualStreamerInfo::SetStreamMemberWise(Bool_t enable)\n{\n   \/\/ Set whether the TStreamerInfos will save the collections in\n   \/\/ \"member-wise\" order whenever possible.  The default is to store member-wise.\n   \/\/ kTRUE indicates member-wise storing\n   \/\/ kFALSE inddicates object-wise storing\n   \/\/ This function returns the previous value of fgStreamMemberWise.\n\n   \/\/ A collection can be saved member wise when it contain is guaranteed to be\n   \/\/ homogeneous.  For example std::vector<THit> can be stored member wise,\n   \/\/ while std::vector<THit*> can not (possible use of polymorphism).\n\n   Bool_t prev = fgStreamMemberWise;\n   fgStreamMemberWise = enable;\n   return prev;\n}\n\n\/\/______________________________________________________________________________\nvoid TVirtualStreamerInfo::Streamer(TBuffer &R__b)\n{\n   \/\/ Stream an object of class TVirtualStreamerInfo.\n\n   TNamed::Streamer(R__b);\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    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<commit_msg>noncopyable_function: improve support for capturing mutable lambdas<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(const_cast<noncopyable_function*>(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(const_cast<noncopyable_function*>(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>\/*\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#include \"Box.h\"\n\n#include <gif_lib.h>\n#include <jpeglib.h>\n#include <png.h>\n#include <stdio.h>\n\n#include <GL\/gl.h>\n\n#include <boost\/bind.hpp>\n\n#include \"Bmp.h\"\n\n#include \"utf.h\"\n#include \"http\/HTTPRequest.h\"\n\nnamespace org { namespace w3c { namespace dom { namespace bootstrap {\n\n\/\/ image\/png - 89 50 4E 47 0D 0A 1A 0A\n\/\/ image\/gif - \"GIF87a\" or \"GIF89a\"\n\/\/ image\/jpeg - FF D8\n\/\/ image\/bmp - \"BM\"\n\/\/ image\/vnd.microsoft.icon - 00 00 01 00 (.ico), 00 00 02 00 (.cur)\n\nnamespace {\n\nunsigned char* readAsPng(FILE* file, unsigned& width, unsigned& height, unsigned& format)\n{\n    png_byte header[8];\n    if (fread(header, 1, 8, file) != 8 || png_sig_cmp(header, 0, 8))\n        return 0;\n\n    png_structp png_ptr = png_create_read_struct(PNG_LIBPNG_VER_STRING, NULL, NULL, NULL);\n    if (!png_ptr)\n        return 0;\n    png_infop info_ptr = png_create_info_struct(png_ptr);\n    if (!info_ptr) {\n        png_destroy_read_struct(&png_ptr, NULL, NULL);\n        return 0;\n    }\n    png_infop end_info = png_create_info_struct(png_ptr);\n    if (!end_info) {\n        png_destroy_read_struct(&png_ptr, &info_ptr, NULL);\n        return 0;\n    }\n    if (setjmp(png_jmpbuf(png_ptr))) {\n        png_destroy_read_struct(&png_ptr, &info_ptr, &end_info);\n        return 0;\n    }\n\n    png_init_io(png_ptr, file);\n    png_set_sig_bytes(png_ptr, 8);\n\n    png_read_info(png_ptr, info_ptr);\n\n    width = png_get_image_width(png_ptr, info_ptr);\n    height = png_get_image_height(png_ptr, info_ptr);\n    unsigned bit_depth = png_get_bit_depth(png_ptr, info_ptr);\n    unsigned color_type = png_get_color_type(png_ptr, info_ptr);\n\n    if (color_type == PNG_COLOR_TYPE_PALETTE)\n        png_set_palette_to_rgb(png_ptr);\n    if (color_type == PNG_COLOR_TYPE_GRAY && bit_depth < 8)\n        png_set_expand_gray_1_2_4_to_8(png_ptr);\n    if (color_type == PNG_COLOR_TYPE_GRAY || color_type == PNG_COLOR_TYPE_GRAY_ALPHA)\n        png_set_gray_to_rgb(png_ptr);\n    if (png_get_valid(png_ptr, info_ptr, PNG_INFO_tRNS)) {\n        png_set_tRNS_to_alpha(png_ptr);\n        color_type = GL_RGBA;\n    }\n    if (bit_depth == 16)\n        png_set_strip_16(png_ptr);\n    switch (color_type) {\n    case PNG_COLOR_TYPE_RGB:\n    case PNG_COLOR_TYPE_GRAY:\n    case PNG_COLOR_TYPE_PALETTE:\n        format = GL_RGB;\n        break;\n    default:\n        format = GL_RGBA;\n        break;\n    }\n    png_set_interlace_handling(png_ptr);\n\n    png_read_update_info(png_ptr, info_ptr);\n\n    unsigned rowbytes = png_get_rowbytes(png_ptr, info_ptr);\n    png_bytep data = (png_bytep) malloc(rowbytes * height);\n    png_bytep* row_pointers = (png_bytep*) malloc(sizeof(png_bytep) * height);\n    for (unsigned i = 0; i < height; i++)\n        row_pointers[i] = &data[rowbytes * i];\n    png_read_image(png_ptr, row_pointers);\n    free(row_pointers);\n\n    png_read_end(png_ptr, end_info);\n    png_destroy_read_struct(&png_ptr, &info_ptr, &end_info);\n\n    return data;\n}\n\nunsigned char* readAsJpeg(FILE* file, unsigned& width, unsigned& height, unsigned& format)\n{\n    unsigned char sig[2];\n    if (fread(sig, 1, 2, file) != 2 || sig[0] != 0xFF || sig[1] != 0xD8)\n        return 0;\n    rewind(file);\n\n    JSAMPARRAY img;\n    struct jpeg_decompress_struct cinfo;\n    struct jpeg_error_mgr jerr;\n\n    cinfo.err = jpeg_std_error(&jerr);  \/\/ TODO: set our own error handdler\n    jpeg_create_decompress(&cinfo);\n\n    jpeg_stdio_src(&cinfo, file);\n    jpeg_read_header(&cinfo, true);\n    width = cinfo.image_width;\n    height = cinfo.image_height;\n    jpeg_start_decompress(&cinfo);\n\n    unsigned char* data = (unsigned char*) malloc(height * width * cinfo.out_color_components);\n    img = (JSAMPARRAY) malloc(sizeof(JSAMPROW) * height);\n    for (unsigned i = 0; i < height; ++i)\n        img[i] = (JSAMPROW) &data[cinfo.out_color_components * width * i];\n\n    while(cinfo.output_scanline < cinfo.output_height)\n        jpeg_read_scanlines(&cinfo,\n                            img + cinfo.output_scanline,\n                            cinfo.output_height - cinfo.output_scanline);\n    jpeg_finish_decompress(&cinfo);\n    jpeg_destroy_decompress(&cinfo);\n\n    free(img);\n\n    if (cinfo.out_color_components == 1)\n        format = GL_LUMINANCE;\n    else\n        format = GL_RGB;\n    return data;\n}\n\nuint16_t readUint16(const char* p)\n{\n    return static_cast<uint16_t >(p[0]) + (static_cast<uint16_t >(p[1]) << 8);\n}\n\nunsigned char* expandColors(unsigned char* dst, unsigned char* src, unsigned count, int transparentIndex, GifColorType* colors)\n{\n    for (int i = 0; i < count; ++i, ++src) {\n        if (*src == transparentIndex) {\n            *dst++ = 0;\n            *dst++ = 0;\n            *dst++ = 0;\n            *dst++ = 0;\n        } else {\n            GifColorType* color = &colors[*src];\n            *dst++ = color->Red;\n            *dst++ = color->Green;\n            *dst++ = color->Blue;\n            *dst++ = 255;\n        }\n    }\n    return src;\n}\n\nunsigned char* readAsGif(FILE* file, unsigned& width, unsigned& height, unsigned& format, unsigned &frameCount, std::vector<uint16_t>& delays, unsigned& loop)\n{\n    unsigned char sig[6];\n    if (fread(sig, 1, 6, file) != 6)\n        return 0;\n    if (memcmp(sig, GIF87_STAMP, 6) && memcmp(sig, GIF89_STAMP, 6))\n        return 0;\n    rewind(file);\n\n    int fd = dup(fileno(file));\n    lseek(fd, 0, SEEK_SET);\n    GifFileType* gif = DGifOpenFileHandle(fd);\n    if (!gif)\n        return 0;\n    if (DGifSlurp(gif) != GIF_OK || gif->ImageCount < 1) {\n        DGifCloseFile(gif);\n        return 0;\n    }\n\n    width = gif->SWidth;\n    height = gif->SHeight;\n    frameCount = gif->ImageCount;\n    loop = 1;\n    unsigned char* data = (unsigned char*) malloc(width * height * 4 * frameCount);\n    if (!data) {\n        DGifCloseFile(gif);\n        return 0;\n    }\n\n    if (1 < frameCount)\n        delays.resize(frameCount, 10);\n\n    format = GL_RGBA;\n    for (int frame = 0; frame < frameCount; ++frame) {\n        SavedImage* image = &gif->SavedImages[frame];\n        int transparentIndex = -1;\n        int delay = 0;\n        for (int i = 0; i < image->ExtensionBlockCount; ++i) {\n            ExtensionBlock* ext = image->ExtensionBlocks + i;\n            switch (ext->Function) {\n            case GRAPHICS_EXT_FUNC_CODE:\n                if (ext->ByteCount == 4) {\n                    if ((ext->Bytes[0] & 1))    \/\/ transparent?\n                        transparentIndex = ext->Bytes[3];\n                    delays[frame] = readUint16(ext->Bytes + 1);\n                }\n                break;\n            case APPLICATION_EXT_FUNC_CODE:\n                if (ext->ByteCount == 11 && (!memcmp(ext->Bytes, \"NETSCAPE2.0\", 11) || !memcmp(ext->Bytes, \"ANIMEXTS1.0\", 11))) {\n                    ++ext;  \/\/ Move to the sub-block\n                    if (ext->ByteCount == 3) {\n                        loop = readUint16(ext->Bytes + 1);\n                    }\n                }\n                break;\n            default:\n                break;\n            }\n        }\n        unsigned char* p0 = data + frame * width * height * 4;\n        if (!gif->Image.Interlace)\n            expandColors(p0, image->RasterBits, width * height, transparentIndex, gif->SColorMap->Colors);\n        else {\n            unsigned char* index = image->RasterBits;\n            for (int row = 0; row < height; row += 8)\n                index = expandColors(p0 + width * row, index, width, transparentIndex, gif->SColorMap->Colors);\n            for (int row = 4; row < height; row += 8)\n                index = expandColors(p0 + width * row, index, width, transparentIndex, gif->SColorMap->Colors);\n            for (int row = 2; row < height; row += 4)\n                index = expandColors(p0 + width * row, index, width, transparentIndex, gif->SColorMap->Colors);\n            for (int row = 1; row < height; row += 2)\n                index = expandColors(p0 + width * row, index, width, transparentIndex, gif->SColorMap->Colors);\n        }\n    }\n    DGifCloseFile(gif);\n    return data;\n}\n\nunsigned char* readAsBmp(FILE* file, unsigned& width, unsigned& height, unsigned& format)\n{\n    BitmapFileHeader fileHeader;\n    if (!fileHeader.read(file))\n        return 0;\n    BitmapInfoheader header;\n    if (!header.read(file))\n        return 0;\n    RGBQuad colorTable[header.usedColors ? header.usedColors : 1];\n    if (0 < header.usedColors && !header.readColorTable(file, colorTable))\n        return 0;\n    width = header.getWidth();\n    height = header.getHeight();\n    format = GL_RGBA;\n    unsigned char* data = static_cast<unsigned char*>(malloc(width * height * 4));\n    if (!data)\n        return 0;\n    if (std::fseek(file, fileHeader.offset, SEEK_SET) == -1)\n        return false;\n    bool result = header.readPixels(file, colorTable, data);\n    if (!result) {\n        free(data);\n        return 0;\n    }\n    return data;\n}\n\n\/\/ file must points to BitmapInfoheader\nunsigned char* readAsIco(FILE* file, unsigned& width, unsigned& height, unsigned& format)\n{\n    BitmapInfoheader header;\n    if (!header.read(file))\n        return 0;\n    RGBQuad colorTable[header.usedColors ? header.usedColors : 1];\n    if (0 < header.usedColors && !header.readColorTable(file, colorTable))\n        return 0;\n    width = header.getWidth();\n    height = header.getHeight();\n    if (width * 2 == height) {   \/\/ has AND plane?\n        header.height \/= 2;\n        height \/= 2;\n    }\n    format = GL_RGBA;\n    unsigned char* data = static_cast<unsigned char*>(malloc(width * height * 4));\n    if (!data)\n        return 0;\n    \/\/ TODO: Process AND plane.\n    \/\/ TODO: Support JPEG and PNG.\n    bool result = header.readPixels(file, colorTable, data);\n    if (!result) {\n        free(data);\n        return 0;\n    }\n    return data;\n}\n\n}  \/\/ namespace\n\nBoxImage::BoxImage(unsigned repeat) :\n    state(Unavailable),\n    flags(0),\n    pixels(0),\n    naturalWidth(0),\n    naturalHeight(0),\n    repeat(repeat),\n    format(GL_RGBA),\n    frameCount(1),\n    delays(1),\n    total(0.0f)\n{\n}\n\nvoid BoxImage::open(FILE* file)\n{\n    assert(file);\n    pixels = readAsIco(file, naturalWidth, naturalHeight, format);\n    if (!pixels) {\n        rewind(file);\n        pixels = readAsPng(file, naturalWidth, naturalHeight, format);\n    }\n    if (!pixels) {\n        rewind(file);\n        pixels = readAsJpeg(file, naturalWidth, naturalHeight, format);\n    }\n    if (!pixels) {\n        rewind(file);\n        pixels = readAsGif(file, naturalWidth, naturalHeight, format, frameCount, delays, loop);\n    }\n    if (!pixels) {\n        rewind(file);\n        pixels = readAsBmp(file, naturalWidth, naturalHeight, format);\n    }\n    if (!pixels) {\n        state = Broken;\n        return;\n    }\n    state = CompletelyAvailable;\n    total = 0.0f;\n    for (auto i = 0; i < delays.size(); ++i)\n        total += delays[i];\n}\n\nunsigned BoxImage::getCurrentFrame(unsigned t, unsigned& delay, unsigned start)\n{\n    if (frameCount <= 1 || total == 0.0f)\n        return 0;\n    if (loop) {\n        t -= start;\n        if (total * loop <= t)\n            return 0;\n    }\n    t %= total;\n    unsigned d = 0.0f;\n    for (unsigned i = 0; i < delays.size(); ++i) {\n        d += delays[i];\n        if (t < d) {\n            delay = d - t;\n            return i;\n        }\n    }\n    return 0;\n}\n\n\/\/\n\/\/ HttpRequest\n\/\/\n\nBoxImage* HttpRequest::getBoxImage(unsigned repeat)\n{\n    if (!boxImage)\n        boxImage = new(std::nothrow) BoxImage(repeat);\n    if (!boxImage)\n        return 0;\n\n    switch (getReadyState()) {\n    case UNSENT:\n        boxImage->setState(BoxImage::Unavailable);\n        break;\n    case OPENED:\n    case HEADERS_RECEIVED:\n    case LOADING:\n    case COMPLETE:\n        boxImage->setState(BoxImage::Sent);\n        break;\n    case DONE:\n        if (boxImage->getState() < BoxImage::PartiallyAvailable) {\n            if (getError()) {\n                boxImage->setState(BoxImage::Unavailable);\n                break;\n            }\n            if (FILE* file = openFile()) {\n                boxImage->open(file);\n                fclose(file);\n            }\n        }\n        break;\n    default:\n        boxImage->setState(BoxImage::Unavailable);\n        break;\n    }\n    return boxImage;\n}\n\n}}}}  \/\/ org::w3c::dom::bootstrap\n<commit_msg>(BoxImage::open, readAsGif, readAsJpeg) : Revise to support the ICO files that include bitmaps compressed in the PNG format.<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#include \"Box.h\"\n\n#include <gif_lib.h>\n#include <jpeglib.h>\n#include <png.h>\n#include <stdio.h>\n\n#include <GL\/gl.h>\n\n#include <boost\/bind.hpp>\n\n#include \"Bmp.h\"\n\n#include \"utf.h\"\n#include \"http\/HTTPRequest.h\"\n\nnamespace org { namespace w3c { namespace dom { namespace bootstrap {\n\n\/\/ image\/png - 89 50 4E 47 0D 0A 1A 0A\n\/\/ image\/gif - \"GIF87a\" or \"GIF89a\"\n\/\/ image\/jpeg - FF D8\n\/\/ image\/x-bmp - \"BM\"\n\/\/ image\/vnd.microsoft.icon - 00 00 01 00 (.ico), 00 00 02 00 (.cur)\n\nnamespace {\n\nunsigned char* readAsPng(FILE* file, unsigned& width, unsigned& height, unsigned& format)\n{\n    png_byte header[8];\n    if (fread(header, 1, 8, file) != 8 || png_sig_cmp(header, 0, 8))\n        return 0;\n\n    png_structp png_ptr = png_create_read_struct(PNG_LIBPNG_VER_STRING, NULL, NULL, NULL);\n    if (!png_ptr)\n        return 0;\n    png_infop info_ptr = png_create_info_struct(png_ptr);\n    if (!info_ptr) {\n        png_destroy_read_struct(&png_ptr, NULL, NULL);\n        return 0;\n    }\n    png_infop end_info = png_create_info_struct(png_ptr);\n    if (!end_info) {\n        png_destroy_read_struct(&png_ptr, &info_ptr, NULL);\n        return 0;\n    }\n    if (setjmp(png_jmpbuf(png_ptr))) {\n        png_destroy_read_struct(&png_ptr, &info_ptr, &end_info);\n        return 0;\n    }\n\n    png_init_io(png_ptr, file);\n    png_set_sig_bytes(png_ptr, 8);\n\n    png_read_info(png_ptr, info_ptr);\n\n    width = png_get_image_width(png_ptr, info_ptr);\n    height = png_get_image_height(png_ptr, info_ptr);\n    unsigned bit_depth = png_get_bit_depth(png_ptr, info_ptr);\n    unsigned color_type = png_get_color_type(png_ptr, info_ptr);\n\n    if (color_type == PNG_COLOR_TYPE_PALETTE)\n        png_set_palette_to_rgb(png_ptr);\n    if (color_type == PNG_COLOR_TYPE_GRAY && bit_depth < 8)\n        png_set_expand_gray_1_2_4_to_8(png_ptr);\n    if (color_type == PNG_COLOR_TYPE_GRAY || color_type == PNG_COLOR_TYPE_GRAY_ALPHA)\n        png_set_gray_to_rgb(png_ptr);\n    if (png_get_valid(png_ptr, info_ptr, PNG_INFO_tRNS)) {\n        png_set_tRNS_to_alpha(png_ptr);\n        color_type = GL_RGBA;\n    }\n    if (bit_depth == 16)\n        png_set_strip_16(png_ptr);\n    switch (color_type) {\n    case PNG_COLOR_TYPE_RGB:\n    case PNG_COLOR_TYPE_GRAY:\n    case PNG_COLOR_TYPE_PALETTE:\n        format = GL_RGB;\n        break;\n    default:\n        format = GL_RGBA;\n        break;\n    }\n    png_set_interlace_handling(png_ptr);\n\n    png_read_update_info(png_ptr, info_ptr);\n\n    unsigned rowbytes = png_get_rowbytes(png_ptr, info_ptr);\n    png_bytep data = (png_bytep) malloc(rowbytes * height);\n    png_bytep* row_pointers = (png_bytep*) malloc(sizeof(png_bytep) * height);\n    for (unsigned i = 0; i < height; i++)\n        row_pointers[i] = &data[rowbytes * i];\n    png_read_image(png_ptr, row_pointers);\n    free(row_pointers);\n\n    png_read_end(png_ptr, end_info);\n    png_destroy_read_struct(&png_ptr, &info_ptr, &end_info);\n\n    return data;\n}\n\nunsigned char* readAsJpeg(FILE* file, unsigned& width, unsigned& height, unsigned& format)\n{\n    unsigned char sig[2];\n    if (fread(sig, 1, sizeof sig, file) != sizeof sig || sig[0] != 0xFF || sig[1] != 0xD8)\n        return 0;\n    fseek(file, -(sizeof sig), SEEK_CUR);\n\n    JSAMPARRAY img;\n    struct jpeg_decompress_struct cinfo;\n    struct jpeg_error_mgr jerr;\n\n    cinfo.err = jpeg_std_error(&jerr);  \/\/ TODO: set our own error handdler\n    jpeg_create_decompress(&cinfo);\n\n    jpeg_stdio_src(&cinfo, file);\n    jpeg_read_header(&cinfo, true);\n    width = cinfo.image_width;\n    height = cinfo.image_height;\n    jpeg_start_decompress(&cinfo);\n\n    unsigned char* data = (unsigned char*) malloc(height * width * cinfo.out_color_components);\n    img = (JSAMPARRAY) malloc(sizeof(JSAMPROW) * height);\n    for (unsigned i = 0; i < height; ++i)\n        img[i] = (JSAMPROW) &data[cinfo.out_color_components * width * i];\n\n    while(cinfo.output_scanline < cinfo.output_height)\n        jpeg_read_scanlines(&cinfo,\n                            img + cinfo.output_scanline,\n                            cinfo.output_height - cinfo.output_scanline);\n    jpeg_finish_decompress(&cinfo);\n    jpeg_destroy_decompress(&cinfo);\n\n    free(img);\n\n    if (cinfo.out_color_components == 1)\n        format = GL_LUMINANCE;\n    else\n        format = GL_RGB;\n    return data;\n}\n\nuint16_t readUint16(const char* p)\n{\n    return static_cast<uint16_t >(p[0]) + (static_cast<uint16_t >(p[1]) << 8);\n}\n\nunsigned char* expandColors(unsigned char* dst, unsigned char* src, unsigned count, int transparentIndex, GifColorType* colors)\n{\n    for (int i = 0; i < count; ++i, ++src) {\n        if (*src == transparentIndex) {\n            *dst++ = 0;\n            *dst++ = 0;\n            *dst++ = 0;\n            *dst++ = 0;\n        } else {\n            GifColorType* color = &colors[*src];\n            *dst++ = color->Red;\n            *dst++ = color->Green;\n            *dst++ = color->Blue;\n            *dst++ = 255;\n        }\n    }\n    return src;\n}\n\nunsigned char* readAsGif(FILE* file, unsigned& width, unsigned& height, unsigned& format, unsigned &frameCount, std::vector<uint16_t>& delays, unsigned& loop)\n{\n    unsigned char sig[6];\n    if (fread(sig, 1, sizeof sig, file) != sizeof sig)\n        return 0;\n    if (memcmp(sig, GIF87_STAMP, 6) && memcmp(sig, GIF89_STAMP, 6))\n        return 0;\n    fseek(file, -(sizeof sig), SEEK_CUR);\n    long pos = ftell(file);\n\n    int fd = dup(fileno(file));\n    lseek(fd, pos, SEEK_SET);\n    GifFileType* gif = DGifOpenFileHandle(fd);\n    if (!gif)\n        return 0;\n    if (DGifSlurp(gif) != GIF_OK || gif->ImageCount < 1) {\n        DGifCloseFile(gif);\n        return 0;\n    }\n\n    width = gif->SWidth;\n    height = gif->SHeight;\n    frameCount = gif->ImageCount;\n    loop = 1;\n    unsigned char* data = (unsigned char*) malloc(width * height * 4 * frameCount);\n    if (!data) {\n        DGifCloseFile(gif);\n        return 0;\n    }\n\n    if (1 < frameCount)\n        delays.resize(frameCount, 10);\n\n    format = GL_RGBA;\n    for (int frame = 0; frame < frameCount; ++frame) {\n        SavedImage* image = &gif->SavedImages[frame];\n        int transparentIndex = -1;\n        int delay = 0;\n        for (int i = 0; i < image->ExtensionBlockCount; ++i) {\n            ExtensionBlock* ext = image->ExtensionBlocks + i;\n            switch (ext->Function) {\n            case GRAPHICS_EXT_FUNC_CODE:\n                if (ext->ByteCount == 4) {\n                    if ((ext->Bytes[0] & 1))    \/\/ transparent?\n                        transparentIndex = ext->Bytes[3];\n                    delays[frame] = readUint16(ext->Bytes + 1);\n                }\n                break;\n            case APPLICATION_EXT_FUNC_CODE:\n                if (ext->ByteCount == 11 && (!memcmp(ext->Bytes, \"NETSCAPE2.0\", 11) || !memcmp(ext->Bytes, \"ANIMEXTS1.0\", 11))) {\n                    ++ext;  \/\/ Move to the sub-block\n                    if (ext->ByteCount == 3) {\n                        loop = readUint16(ext->Bytes + 1);\n                    }\n                }\n                break;\n            default:\n                break;\n            }\n        }\n        unsigned char* p0 = data + frame * width * height * 4;\n        if (!gif->Image.Interlace)\n            expandColors(p0, image->RasterBits, width * height, transparentIndex, gif->SColorMap->Colors);\n        else {\n            unsigned char* index = image->RasterBits;\n            for (int row = 0; row < height; row += 8)\n                index = expandColors(p0 + width * row, index, width, transparentIndex, gif->SColorMap->Colors);\n            for (int row = 4; row < height; row += 8)\n                index = expandColors(p0 + width * row, index, width, transparentIndex, gif->SColorMap->Colors);\n            for (int row = 2; row < height; row += 4)\n                index = expandColors(p0 + width * row, index, width, transparentIndex, gif->SColorMap->Colors);\n            for (int row = 1; row < height; row += 2)\n                index = expandColors(p0 + width * row, index, width, transparentIndex, gif->SColorMap->Colors);\n        }\n    }\n    DGifCloseFile(gif);\n    return data;\n}\n\nunsigned char* readAsBmp(FILE* file, unsigned& width, unsigned& height, unsigned& format)\n{\n    BitmapFileHeader fileHeader;\n    if (!fileHeader.read(file))\n        return 0;\n    BitmapInfoheader header;\n    if (!header.read(file))\n        return 0;\n    RGBQuad colorTable[header.usedColors ? header.usedColors : 1];\n    if (0 < header.usedColors && !header.readColorTable(file, colorTable))\n        return 0;\n    width = header.getWidth();\n    height = header.getHeight();\n    format = GL_RGBA;\n    unsigned char* data = static_cast<unsigned char*>(malloc(width * height * 4));\n    if (!data)\n        return 0;\n    if (std::fseek(file, fileHeader.offset, SEEK_SET) == -1)\n        return false;\n    bool result = header.readPixels(file, colorTable, data);\n    if (!result) {\n        free(data);\n        return 0;\n    }\n    return data;\n}\n\n\/\/ file must points to BitmapInfoheader\nunsigned char* readAsIco(FILE* file, unsigned& width, unsigned& height, unsigned& format)\n{\n    BitmapInfoheader header;\n    if (!header.read(file))\n        return 0;\n    RGBQuad colorTable[header.usedColors ? header.usedColors : 1];\n    if (0 < header.usedColors && !header.readColorTable(file, colorTable))\n        return 0;\n    width = header.getWidth();\n    height = header.getHeight();\n    if (width * 2 == height) {   \/\/ has AND plane?\n        header.height \/= 2;\n        height \/= 2;\n    }\n    format = GL_RGBA;\n    unsigned char* data = static_cast<unsigned char*>(malloc(width * height * 4));\n    if (!data)\n        return 0;\n    \/\/ TODO: Process AND plane.\n    \/\/ TODO: Support JPEG and PNG.\n    bool result = header.readPixels(file, colorTable, data);\n    if (!result) {\n        free(data);\n        return 0;\n    }\n    return data;\n}\n\n}  \/\/ namespace\n\nBoxImage::BoxImage(unsigned repeat) :\n    state(Unavailable),\n    flags(0),\n    pixels(0),\n    naturalWidth(0),\n    naturalHeight(0),\n    repeat(repeat),\n    format(GL_RGBA),\n    frameCount(1),\n    delays(1),\n    total(0.0f)\n{\n}\n\nvoid BoxImage::open(FILE* file)\n{\n    assert(file);\n    long pos = ftell(file);\n    pixels = readAsIco(file, naturalWidth, naturalHeight, format);\n    if (!pixels) {\n        fseek(file, pos, SEEK_SET);\n        pixels = readAsPng(file, naturalWidth, naturalHeight, format);\n    }\n    if (!pixels) {\n        fseek(file, pos, SEEK_SET);\n        pixels = readAsJpeg(file, naturalWidth, naturalHeight, format);\n    }\n    if (!pixels) {\n        fseek(file, pos, SEEK_SET);\n        pixels = readAsGif(file, naturalWidth, naturalHeight, format, frameCount, delays, loop);\n    }\n    if (!pixels) {\n        fseek(file, pos, SEEK_SET);\n        pixels = readAsBmp(file, naturalWidth, naturalHeight, format);\n    }\n    if (!pixels) {\n        state = Broken;\n        return;\n    }\n    state = CompletelyAvailable;\n    total = 0.0f;\n    for (auto i = 0; i < delays.size(); ++i)\n        total += delays[i];\n}\n\nunsigned BoxImage::getCurrentFrame(unsigned t, unsigned& delay, unsigned start)\n{\n    if (frameCount <= 1 || total == 0.0f)\n        return 0;\n    if (loop) {\n        t -= start;\n        if (total * loop <= t)\n            return 0;\n    }\n    t %= total;\n    unsigned d = 0.0f;\n    for (unsigned i = 0; i < delays.size(); ++i) {\n        d += delays[i];\n        if (t < d) {\n            delay = d - t;\n            return i;\n        }\n    }\n    return 0;\n}\n\n\/\/\n\/\/ HttpRequest\n\/\/\n\nBoxImage* HttpRequest::getBoxImage(unsigned repeat)\n{\n    if (!boxImage)\n        boxImage = new(std::nothrow) BoxImage(repeat);\n    if (!boxImage)\n        return 0;\n\n    switch (getReadyState()) {\n    case UNSENT:\n        boxImage->setState(BoxImage::Unavailable);\n        break;\n    case OPENED:\n    case HEADERS_RECEIVED:\n    case LOADING:\n    case COMPLETE:\n        boxImage->setState(BoxImage::Sent);\n        break;\n    case DONE:\n        if (boxImage->getState() < BoxImage::PartiallyAvailable) {\n            if (getError()) {\n                boxImage->setState(BoxImage::Unavailable);\n                break;\n            }\n            if (FILE* file = openFile()) {\n                boxImage->open(file);\n                fclose(file);\n            }\n        }\n        break;\n    default:\n        boxImage->setState(BoxImage::Unavailable);\n        break;\n    }\n    return boxImage;\n}\n\n}}}}  \/\/ org::w3c::dom::bootstrap\n<|endoftext|>"}
{"text":"<commit_before>#include \"..\/..\/base\/SRC_FIRST.hpp\"\n\n#include \"..\/..\/testing\/testing.hpp\"\n\n#include \"..\/..\/geometry\/rect_intersect.hpp\"\n\n#include \"..\/..\/platform\/platform.hpp\"\n\n#include \"..\/..\/map\/feature_vec_model.hpp\"\n\n#include \"..\/..\/indexer\/data_header.hpp\"\n#include \"..\/..\/indexer\/scales.hpp\"\n#include \"..\/..\/indexer\/feature_visibility.hpp\"\n#include \"..\/..\/indexer\/feature_processor.hpp\"\n#include \"..\/..\/indexer\/classificator.hpp\"\n\n#include \"..\/..\/base\/logging.hpp\"\n\n#include \"..\/..\/std\/string.hpp\"\n#include \"..\/..\/std\/algorithm.hpp\"\n#include \"..\/..\/std\/iostream.hpp\"\n\n#include \"..\/..\/base\/start_mem_debug.hpp\"\n\n\ntypedef vector<pair<FeatureType, string> > feature_cont_t;\n\nclass AccumulatorBase\n{\n  mutable string m_dbgString;\n  feature_cont_t & m_cont;\n\nprotected:\n  int m_scale;\n\n  bool is_drawable(FeatureType const & f) const\n  {\n    m_dbgString = f.DebugString(m_scale);\n    CHECK(m_dbgString == f.DebugString(m_scale), ());\n\n    \/\/ Feature that hasn't any geometry for m_scale returns empty DebugString().\n    return (!f.IsEmptyGeometry(m_scale) && feature::IsDrawableForIndex(f, m_scale));\n  }\n\n  void add(FeatureType const & f) const\n  {\n    m_cont.push_back(make_pair(f, m_dbgString));\n  }\n\npublic:\n  AccumulatorBase(m2::RectD const & r, feature_cont_t & cont)\n    : m_cont(cont)\n  {\n    m_scale = scales::GetScaleLevel(r);\n  }\n\n  void operator() (FeatureType const & f) const\n  {\n    if (is_drawable(f))\n      add(f);\n  }\n};\n\nclass IntersectCheck\n{\n  m2::RectD m_rect;\n\n  m2::PointD m_prev;\n  bool m_isPrev, m_intersect;\n\npublic:\n  IntersectCheck(m2::RectD const & r)\n    : m_rect(r), m_isPrev(false), m_intersect(false)\n  {\n  }\n\n  void operator() (CoordPointT const & p)\n  {\n    if (m_intersect) return;\n\n    m2::PointD pt(p.first, p.second);\n    if (m_isPrev)\n    {\n      m2::PointD d1 = m_prev;\n      m2::PointD d2 = pt;\n      m_intersect = m2::Intersect(m_rect, d1, d2);\n    }\n    else\n      m_isPrev = true;\n\n    m_prev = pt;\n  }\n\n  bool IsIntersect() const { return m_intersect; }\n};\n\nclass AccumulatorEtalon : public AccumulatorBase\n{\n  typedef AccumulatorBase base_type;\n\n  m2::RectD m_rect;\n\n  bool is_intersect(FeatureType const & f) const\n  {\n    IntersectCheck check(m_rect);\n    f.ForEachPointRef(check, m_scale);\n    return check.IsIntersect();\n  }\n\npublic:\n  AccumulatorEtalon(m2::RectD const & r, feature_cont_t & cont)\n    : base_type(r, cont), m_rect(r)\n  {\n  }\n\n  void operator() (FeatureType const & f, uint64_t \/*offset*\/) const\n  {\n    if (is_drawable(f) && is_intersect(f))\n      add(f);\n  }\n};\n\n\/\/ invoke this comparator to ensure that \"sort\" and \"compare_sequence\" use equal criterion\nstruct compare_strings\n{\n  int compare(string const & r1, string const & r2) const\n  {\n    if (r1 < r2)\n      return -1;\n    if (r2 < r1)\n      return 1;\n    return 0;\n  }\n  template <class T>\n  int compare(T const & r1, T const & r2) const\n  {\n    return compare(r1.second, r2.second);\n  }\n  template <class T>\n  bool operator() (T const & r1, T const & r2) const\n  {\n    return (compare(r1, r2) == -1);\n  }\n};\n\ntemplate <class TAccumulator, class TSource>\nvoid for_each_in_rect(TSource & src, feature_cont_t & cont, m2::RectD const & rect)\n{\n  cont.clear();\n  TAccumulator acc(rect, cont);\n  src.ForEachFeature(rect, acc);\n  sort(cont.begin(), cont.end(), compare_strings());\n}\n\nclass file_source_t\n{\n  string m_fDat;\npublic:\n  file_source_t(string const & fDat) : m_fDat(fDat) {}\n\n  template <class ToDo>\n  void ForEachFeature(m2::RectD const & \/*rect*\/, ToDo toDo)\n  {\n    feature::ForEachFromDat(m_fDat, toDo);\n  }\n};\n\n\/\/\/ \"test\" should contain all elements from etalon\ntemplate <class TCont, class TCompare>\nbool compare_sequence(TCont const & etalon, TCont const & test, TCompare comp, size_t & errInd)\n{\n  if (test.size() < etalon.size())\n    return false;\n\n  typedef typename TCont::const_iterator iter_t;\n\n  iter_t i1 = etalon.begin();\n  iter_t i2 = test.begin();\n  while (i1 != etalon.end() && i2 != test.end())\n  {\n    switch (comp.compare(*i1, *i2))\n    {\n    case 0:\n      ++i1;\n      ++i2;\n      break;\n    case -1:\n      {\n        errInd = distance(etalon.begin(), i1);\n        return false;\n      }\n    case 1:\n      ++i2;\n      break;\n    }\n  }\n\n  return true;\n}\n\nnamespace\n{\n  class FindOffset\n  {\n    int m_level;\n    pair<FeatureType, string> const & m_test;\n\n  public:\n    FindOffset(int level, pair<FeatureType, string> const & test)\n      : m_level(level), m_test(test)\n    {}\n\n    void operator() (FeatureType const & f, uint64_t offset)\n    {\n      string const s = f.DebugString(m_level);\n      if (s == m_test.second)\n      {\n        cout << s << endl << \"Feature offset = \" << offset << endl;\n\n        cout << \"Feature classificator types:\\n\";\n\n        FeatureType::GetTypesFn getTypes;\n        f.ForEachTypeRef(getTypes);\n        for (int i = 0; i < getTypes.m_size; ++i)\n          cout << classif().GetFullObjectName(getTypes.m_types[i]) << endl;\n      }\n    }\n  };\n\n  void RunTest(string const & path)\n  {\n    model::FeaturesFetcher src1;\n    src1.InitClassificator();\n    src1.AddMap(path);\n\n    feature::DataHeader mapInfo;\n    mapInfo.Load(FilesContainerR(path).GetReader(HEADER_FILE_TAG));\n\n    vector<m2::RectD> rects;\n    rects.push_back(mapInfo.GetBounds());\n\n    while (!rects.empty())\n    {\n      m2::RectD r = rects.back();\n      rects.pop_back();\n\n      feature_cont_t v1, v2;\n      for_each_in_rect<AccumulatorBase>(src1, v1, r);\n\n      file_source_t src2(path);\n      for_each_in_rect<AccumulatorEtalon>(src2, v2, r);\n\n      int const level = scales::GetScaleLevel(r);\n\n      size_t errInd;\n      if (!compare_sequence(v2, v1, compare_strings(), errInd))\n      {\n        src2.ForEachFeature(r, FindOffset(level, v2[errInd]));\n        TEST(false, (\"Failed for rect: \", r, \"; Scale level = \", level, \". Etalon size = \", v2.size(), \". Index size = \", v1.size()));\n      }\n\n      if (!v2.empty() && (level < scales::GetUpperScale()))\n      {\n        m2::RectD r1, r2;\n        r.DivideByGreaterSize(r1, r2);\n        rects.push_back(r1);\n        rects.push_back(r2);\n      }\n    }\n  }\n\n  void RunTestForChoice(string const & fName)\n  {\n    cout << \"Run \" << fName << \"? (y\/n)\\n\";\n    char c;\n    cin >> c;\n    if (c == 'y')\n      RunTest(GetPlatform().WritablePathForFile(fName + DATA_FILE_EXTENSION));\n  }\n}\n\nUNIT_TEST(IndexForEachTest)\n{\n  RunTestForChoice(\"minsk-pass\");\n  RunTestForChoice(\"london-center\");\n}\n<commit_msg>Fix uninitialized variable.<commit_after>#include \"..\/..\/base\/SRC_FIRST.hpp\"\n\n#include \"..\/..\/testing\/testing.hpp\"\n\n#include \"..\/..\/geometry\/rect_intersect.hpp\"\n\n#include \"..\/..\/platform\/platform.hpp\"\n\n#include \"..\/..\/map\/feature_vec_model.hpp\"\n\n#include \"..\/..\/indexer\/data_header.hpp\"\n#include \"..\/..\/indexer\/scales.hpp\"\n#include \"..\/..\/indexer\/feature_visibility.hpp\"\n#include \"..\/..\/indexer\/feature_processor.hpp\"\n#include \"..\/..\/indexer\/classificator.hpp\"\n\n#include \"..\/..\/base\/logging.hpp\"\n\n#include \"..\/..\/std\/string.hpp\"\n#include \"..\/..\/std\/algorithm.hpp\"\n#include \"..\/..\/std\/iostream.hpp\"\n\n#include \"..\/..\/base\/start_mem_debug.hpp\"\n\n\ntypedef vector<pair<FeatureType, string> > feature_cont_t;\n\nclass AccumulatorBase\n{\n  mutable string m_dbgString;\n  feature_cont_t & m_cont;\n\nprotected:\n  int m_scale;\n\n  bool is_drawable(FeatureType const & f) const\n  {\n    m_dbgString = f.DebugString(m_scale);\n    CHECK(m_dbgString == f.DebugString(m_scale), ());\n\n    \/\/ Feature that hasn't any geometry for m_scale returns empty DebugString().\n    return (!f.IsEmptyGeometry(m_scale) && feature::IsDrawableForIndex(f, m_scale));\n  }\n\n  void add(FeatureType const & f) const\n  {\n    m_cont.push_back(make_pair(f, m_dbgString));\n  }\n\npublic:\n  AccumulatorBase(m2::RectD const & r, feature_cont_t & cont)\n    : m_cont(cont)\n  {\n    m_scale = scales::GetScaleLevel(r);\n  }\n\n  void operator() (FeatureType const & f) const\n  {\n    if (is_drawable(f))\n      add(f);\n  }\n};\n\nclass IntersectCheck\n{\n  m2::RectD m_rect;\n\n  m2::PointD m_prev;\n  bool m_isPrev, m_intersect;\n\npublic:\n  IntersectCheck(m2::RectD const & r)\n    : m_rect(r), m_isPrev(false), m_intersect(false)\n  {\n  }\n\n  void operator() (CoordPointT const & p)\n  {\n    if (m_intersect) return;\n\n    m2::PointD pt(p.first, p.second);\n    if (m_isPrev)\n    {\n      m2::PointD d1 = m_prev;\n      m2::PointD d2 = pt;\n      m_intersect = m2::Intersect(m_rect, d1, d2);\n    }\n    else\n      m_isPrev = true;\n\n    m_prev = pt;\n  }\n\n  bool IsIntersect() const { return m_intersect; }\n};\n\nclass AccumulatorEtalon : public AccumulatorBase\n{\n  typedef AccumulatorBase base_type;\n\n  m2::RectD m_rect;\n\n  bool is_intersect(FeatureType const & f) const\n  {\n    IntersectCheck check(m_rect);\n    f.ForEachPointRef(check, m_scale);\n    return check.IsIntersect();\n  }\n\npublic:\n  AccumulatorEtalon(m2::RectD const & r, feature_cont_t & cont)\n    : base_type(r, cont), m_rect(r)\n  {\n  }\n\n  void operator() (FeatureType const & f, uint64_t \/*offset*\/) const\n  {\n    if (is_drawable(f) && is_intersect(f))\n      add(f);\n  }\n};\n\n\/\/ invoke this comparator to ensure that \"sort\" and \"compare_sequence\" use equal criterion\nstruct compare_strings\n{\n  int compare(string const & r1, string const & r2) const\n  {\n    if (r1 < r2)\n      return -1;\n    if (r2 < r1)\n      return 1;\n    return 0;\n  }\n  template <class T>\n  int compare(T const & r1, T const & r2) const\n  {\n    return compare(r1.second, r2.second);\n  }\n  template <class T>\n  bool operator() (T const & r1, T const & r2) const\n  {\n    return (compare(r1, r2) == -1);\n  }\n};\n\ntemplate <class TAccumulator, class TSource>\nvoid for_each_in_rect(TSource & src, feature_cont_t & cont, m2::RectD const & rect)\n{\n  cont.clear();\n  TAccumulator acc(rect, cont);\n  src.ForEachFeature(rect, acc);\n  sort(cont.begin(), cont.end(), compare_strings());\n}\n\nclass file_source_t\n{\n  string m_fDat;\npublic:\n  file_source_t(string const & fDat) : m_fDat(fDat) {}\n\n  template <class ToDo>\n  void ForEachFeature(m2::RectD const & \/*rect*\/, ToDo toDo)\n  {\n    feature::ForEachFromDat(m_fDat, toDo);\n  }\n};\n\n\/\/\/ \"test\" should contain all elements from etalon\ntemplate <class TCont, class TCompare>\nbool compare_sequence(TCont const & etalon, TCont const & test, TCompare comp, size_t & errInd)\n{\n  if (test.size() < etalon.size())\n    return false;\n\n  typedef typename TCont::const_iterator iter_t;\n\n  iter_t i1 = etalon.begin();\n  iter_t i2 = test.begin();\n  while (i1 != etalon.end() && i2 != test.end())\n  {\n    switch (comp.compare(*i1, *i2))\n    {\n    case 0:\n      ++i1;\n      ++i2;\n      break;\n    case -1:\n      {\n        errInd = distance(etalon.begin(), i1);\n        return false;\n      }\n    case 1:\n      ++i2;\n      break;\n    }\n  }\n\n  return true;\n}\n\nnamespace\n{\n  class FindOffset\n  {\n    int m_level;\n    pair<FeatureType, string> const & m_test;\n\n  public:\n    FindOffset(int level, pair<FeatureType, string> const & test)\n      : m_level(level), m_test(test)\n    {}\n\n    void operator() (FeatureType const & f, uint64_t offset)\n    {\n      string const s = f.DebugString(m_level);\n      if (s == m_test.second)\n      {\n        cout << s << endl << \"Feature offset = \" << offset << endl;\n\n        cout << \"Feature classificator types:\\n\";\n\n        FeatureType::GetTypesFn getTypes;\n        f.ForEachTypeRef(getTypes);\n        for (int i = 0; i < getTypes.m_size; ++i)\n          cout << classif().GetFullObjectName(getTypes.m_types[i]) << endl;\n      }\n    }\n  };\n\n  void RunTest(string const & path)\n  {\n    model::FeaturesFetcher src1;\n    src1.InitClassificator();\n    src1.AddMap(path);\n\n    feature::DataHeader mapInfo;\n    mapInfo.Load(FilesContainerR(path).GetReader(HEADER_FILE_TAG));\n\n    vector<m2::RectD> rects;\n    rects.push_back(mapInfo.GetBounds());\n\n    while (!rects.empty())\n    {\n      m2::RectD r = rects.back();\n      rects.pop_back();\n\n      feature_cont_t v1, v2;\n      for_each_in_rect<AccumulatorBase>(src1, v1, r);\n\n      file_source_t src2(path);\n      for_each_in_rect<AccumulatorEtalon>(src2, v2, r);\n\n      int const level = scales::GetScaleLevel(r);\n\n      size_t const emptyInd = size_t(-1);\n      size_t errInd = emptyInd;\n      if (!compare_sequence(v2, v1, compare_strings(), errInd))\n      {\n        if (errInd != emptyInd)\n          src2.ForEachFeature(r, FindOffset(level, v2[errInd]));\n\n        TEST(false, (\"Failed for rect: \", r, \"; Scale level = \", level, \". Etalon size = \", v2.size(), \". Index size = \", v1.size()));\n      }\n\n      if (!v2.empty() && (level < scales::GetUpperScale()))\n      {\n        m2::RectD r1, r2;\n        r.DivideByGreaterSize(r1, r2);\n        rects.push_back(r1);\n        rects.push_back(r2);\n      }\n    }\n  }\n\n  void RunTestForChoice(string const & fName)\n  {\n    cout << \"Run \" << fName << \"? (y\/n)\\n\";\n    char c;\n    cin >> c;\n    if (c == 'y')\n      RunTest(GetPlatform().WritablePathForFile(fName + DATA_FILE_EXTENSION));\n  }\n}\n\nUNIT_TEST(IndexForEachTest)\n{\n  RunTestForChoice(\"minsk-pass\");\n  RunTestForChoice(\"london-center\");\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\n\/\/\/ @file   main.cpp\n\/\/\/ @brief  primesieve console application.\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\/ParallelPrimeSieve.hpp>\n#include \"calculator.hpp\"\n#include \"cmdoptions.hpp\"\n\n#include <stdint.h>\n#include <cstddef>\n#include <iostream>\n#include <exception>\n#include <iomanip>\n#include <algorithm>\n#include <string>\n\nusing namespace std;\nusing namespace primesieve;\n\nnamespace {\n\nvoid printResults(ParallelPrimeSieve& ps, CmdOptions& opt)\n{\n  cout << left;\n\n  const string text[] =\n  {\n    \"Primes\",\n    \"Twin primes\",\n    \"Prime triplets\",\n    \"Prime quadruplets\",\n    \"Prime quintuplets\",\n    \"Prime sextuplets\"\n  };\n\n  \/\/ largest text size\n  size_t size = 0;\n\n  if (opt.time)\n    size = max(size, string(\"Seconds\").size());\n\n  for (int i = 0; i < 6; i++)\n    if (ps.isCount(i))\n      size = max(size, text[i].size());\n\n  int width = (int) size;\n\n  if (opt.time)\n    cout << setw(width) << \"Seconds\" << \" : \"\n         << fixed << setprecision(3) << ps.getSeconds()\n         << endl;\n\n  \/\/ print results\n  for (int i = 0; i < 6; i++)\n  {\n    if (ps.isCount(i))\n      cout << setw(width) << text[i] << \" : \"\n           << ps.getCount(i) << endl;\n  }\n}\n\n\/\/\/ Used to count and print primes and prime k-tuplets\nvoid sieve(CmdOptions& opt)\n{\n  ParallelPrimeSieve ps;\n  auto& numbers = opt.numbers;\n\n  if (opt.flags)\n    ps.setFlags(opt.flags);\n  if (opt.sieveSize)\n    ps.setSieveSize(opt.sieveSize);\n  if (opt.threads)\n    ps.setNumThreads(opt.threads);\n  if (ps.isPrint())\n    ps.setNumThreads(1);\n\n  if (numbers.size() < 2)\n    numbers.push_front(0);\n\n  ps.setStart(numbers[0]);\n  ps.setStop(numbers[1]);\n\n  if (!opt.quiet)\n  {\n    cout << \"Sieve size = \" << ps.getSieveSize() << \" kilobytes\" << endl;\n    cout << \"Threads = \" << ps.idealNumThreads() << endl;\n  }\n\n  if (opt.status)\n    ps.addFlags(ps.PRINT_STATUS);\n\n  ps.sieve();\n  printResults(ps, opt);\n}\n\nvoid nthPrime(CmdOptions& opt)\n{\n  ParallelPrimeSieve ps;\n  auto& numbers = opt.numbers;\n\n  if (opt.flags)\n    ps.setFlags(opt.flags);\n  if (opt.sieveSize)\n    ps.setSieveSize(opt.sieveSize);\n  if (opt.threads)\n    ps.setNumThreads(opt.threads);\n\n  if (numbers.size() < 2)\n    numbers.push_back(0);\n\n  uint64_t n = numbers[0];\n  uint64_t start = numbers[1];\n  uint64_t nthPrime = ps.nthPrime(n, start);\n\n  if (opt.time)\n    cout << \"Seconds   : \" << fixed << setprecision(3)\n         << ps.getSeconds() << endl;\n\n  cout << \"Nth prime : \" << nthPrime << endl;\n}\n\n} \/\/ namespace\n\nint main(int argc, char* argv[])\n{\n  try\n  {\n    CmdOptions opt = parseOptions(argc, argv);\n\n    if (opt.nthPrime)\n      nthPrime(opt);\n    else\n      sieve(opt);\n  }\n  catch (exception& e)\n  {\n    cerr << \"primesieve: \" << e.what() << endl\n         << \"Try: primesieve --help\"   << endl;\n    return 1;\n  }\n\n  return 0;\n}\n<commit_msg>Remove <calculator.hpp><commit_after>\/\/\/\n\/\/\/ @file   main.cpp\n\/\/\/ @brief  primesieve console application.\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\/ParallelPrimeSieve.hpp>\n#include \"cmdoptions.hpp\"\n\n#include <stdint.h>\n#include <cstddef>\n#include <iostream>\n#include <exception>\n#include <iomanip>\n#include <algorithm>\n#include <string>\n\nusing namespace std;\nusing namespace primesieve;\n\nnamespace {\n\nvoid printResults(ParallelPrimeSieve& ps, CmdOptions& opt)\n{\n  cout << left;\n\n  const string text[] =\n  {\n    \"Primes\",\n    \"Twin primes\",\n    \"Prime triplets\",\n    \"Prime quadruplets\",\n    \"Prime quintuplets\",\n    \"Prime sextuplets\"\n  };\n\n  \/\/ largest text size\n  size_t size = 0;\n\n  if (opt.time)\n    size = max(size, string(\"Seconds\").size());\n\n  for (int i = 0; i < 6; i++)\n    if (ps.isCount(i))\n      size = max(size, text[i].size());\n\n  int width = (int) size;\n\n  if (opt.time)\n    cout << setw(width) << \"Seconds\" << \" : \"\n         << fixed << setprecision(3) << ps.getSeconds()\n         << endl;\n\n  \/\/ print results\n  for (int i = 0; i < 6; i++)\n  {\n    if (ps.isCount(i))\n      cout << setw(width) << text[i] << \" : \"\n           << ps.getCount(i) << endl;\n  }\n}\n\n\/\/\/ Used to count and print primes and prime k-tuplets\nvoid sieve(CmdOptions& opt)\n{\n  ParallelPrimeSieve ps;\n  auto& numbers = opt.numbers;\n\n  if (opt.flags)\n    ps.setFlags(opt.flags);\n  if (opt.sieveSize)\n    ps.setSieveSize(opt.sieveSize);\n  if (opt.threads)\n    ps.setNumThreads(opt.threads);\n  if (ps.isPrint())\n    ps.setNumThreads(1);\n\n  if (numbers.size() < 2)\n    numbers.push_front(0);\n\n  ps.setStart(numbers[0]);\n  ps.setStop(numbers[1]);\n\n  if (!opt.quiet)\n  {\n    cout << \"Sieve size = \" << ps.getSieveSize() << \" kilobytes\" << endl;\n    cout << \"Threads = \" << ps.idealNumThreads() << endl;\n  }\n\n  if (opt.status)\n    ps.addFlags(ps.PRINT_STATUS);\n\n  ps.sieve();\n  printResults(ps, opt);\n}\n\nvoid nthPrime(CmdOptions& opt)\n{\n  ParallelPrimeSieve ps;\n  auto& numbers = opt.numbers;\n\n  if (opt.flags)\n    ps.setFlags(opt.flags);\n  if (opt.sieveSize)\n    ps.setSieveSize(opt.sieveSize);\n  if (opt.threads)\n    ps.setNumThreads(opt.threads);\n\n  if (numbers.size() < 2)\n    numbers.push_back(0);\n\n  uint64_t n = numbers[0];\n  uint64_t start = numbers[1];\n  uint64_t nthPrime = ps.nthPrime(n, start);\n\n  if (opt.time)\n    cout << \"Seconds   : \" << fixed << setprecision(3)\n         << ps.getSeconds() << endl;\n\n  cout << \"Nth prime : \" << nthPrime << endl;\n}\n\n} \/\/ namespace\n\nint main(int argc, char* argv[])\n{\n  try\n  {\n    CmdOptions opt = parseOptions(argc, argv);\n\n    if (opt.nthPrime)\n      nthPrime(opt);\n    else\n      sieve(opt);\n  }\n  catch (exception& e)\n  {\n    cerr << \"primesieve: \" << e.what() << endl\n         << \"Try: primesieve --help\"   << endl;\n    return 1;\n  }\n\n  return 0;\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\/log_writer.h\"\n\n#include <stdint.h>\n#include \"leveldb\/env.h\"\n#include \"util\/coding.h\"\n#include \"util\/crc32c.h\"\n\nnamespace leveldb {\nnamespace log {\n\nWriter::Writer(WritableFile* dest)\n    : dest_(dest),\n      block_offset_(0) {\n  for (int i = 0; i <= kMaxRecordType; i++) {\n    char t = static_cast<char>(i);\n    type_crc_[i] = crc32c::Value(&t, 1);\n  }\n}\n\nWriter::~Writer() {\n}\n\nStatus Writer::AddRecord(const Slice& slice) {\n  const char* ptr = slice.data();\n  size_t left = slice.size();\n\n  \/\/ Fragment the record if necessary and emit it.  Note that if slice\n  \/\/ is empty, we still want to iterate once to emit a single\n  \/\/ zero-length record\n  Status s;\n  bool begin = true;\n  do {\n    const int leftover = kBlockSize - block_offset_;\n    assert(leftover >= 0);\n    if (leftover < kHeaderSize) {\n      \/\/ Switch to a new block\n      if (leftover > 0) {\n        \/\/ Fill the trailer (literal below relies on kHeaderSize being 7)\n        assert(kHeaderSize == 7);\n        dest_->Append(Slice(\"\\x00\\x00\\x00\\x00\\x00\\x00\", leftover));\n      }\n      block_offset_ = 0;\n    }\n\n    \/\/ Invariant: we never leave < kHeaderSize bytes in a block.\n    assert(kBlockSize - block_offset_ - kHeaderSize >= 0);\n\n    const size_t avail = kBlockSize - block_offset_ - kHeaderSize;\n    const size_t fragment_length = (left < avail) ? left : avail;\n\n    RecordType type;\n    const bool end = (left == fragment_length);\n    if (begin && end) {\n      type = kFullType;\n    } else if (begin) {\n      type = kFirstType;\n    } else if (end) {\n      type = kLastType;\n    } else {\n      type = kMiddleType;\n    }\n\n    s = EmitPhysicalRecord(type, ptr, fragment_length);\n    ptr += fragment_length;\n    left -= fragment_length;\n    begin = false;\n  } while (s.ok() && left > 0);\n  return s;\n}\n\nStatus Writer::EmitPhysicalRecord(RecordType t, const char* ptr, size_t n) {\n  assert(n <= 0xffff);  \/\/ Must fit in two bytes\n  assert(block_offset_ + kHeaderSize + n <= kBlockSize);\n\n  \/\/ Format the header\n  char buf[kHeaderSize];\n  buf[4] = static_cast<char>(n & 0xff);\n  buf[5] = static_cast<char>(n >> 8);\n  buf[6] = static_cast<char>(t);\n\n  \/\/ Compute the crc of the record type and the payload.\n  uint32_t crc = crc32c::Extend(type_crc_[t], ptr, n);\n  crc = crc32c::Mask(crc);                 \/\/ Adjust for storage\n  EncodeFixed32(buf, crc);\n\n  \/\/ Write the header and the payload\n  Status s = dest_->Append(Slice(buf, kHeaderSize));\n  if (s.ok()) {\n    s = dest_->Append(Slice(ptr, n));\n    if (s.ok()) {\n      s = dest_->Flush();\n    }\n  }\n  block_offset_ += kHeaderSize + n;\n  return s;\n}\n\n}  \/\/ namespace log\n}  \/\/ namespace leveldb\n<commit_msg>Delete log_writer.cc<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>INTEGRATION: CWS dba30c (1.11.10); FILE MERGED 2008\/05\/05 10:57:50 oj 1.11.10.1: #i87131# collect keys only once, getKeys always refetch the keys<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\r\n*  Copyright 2005 Alt-N Technologies, Ltd. \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*  This code incorporates intellectual property owned by Yahoo! and licensed \r\n*  pursuant to the Yahoo! DomainKeys Patent License Agreement.\r\n*\r\n*  Unless required by applicable law or agreed to in writing, software \r\n*  distributed under the License is distributed on an \"AS IS\" BASIS, \r\n*  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. \r\n*  See the License for the specific language governing permissions and \r\n*  limitations under the License.\r\n*\r\n*****************************************************************************\/\r\n\r\n#ifdef WIN32\r\n#include <windows.h>\r\n#else\r\n#define strnicmp strncasecmp \r\n#endif\r\n\r\n#include <stdio.h>\r\n#include <string.h>\r\n#include <time.h>\r\n#include <stdlib.h>\r\n\r\n#include \"dkim.h\"\r\n#include \"dns.h\"\r\n\r\n\r\n\/\/ change these to your selector name, domain name, etc\r\n#define MYSELECTOR\t\"MDaemon\"\r\n#define MYDOMAIN\t\"bardenhagen.com\"\r\n#define MYIDENTITY\t\"dkimtest@bardenhagen.com\"\r\n\r\n\r\nint DKIM_CALL SignThisHeader(const char* szHeader)\r\n{\r\n\tif( strnicmp( szHeader, \"X-\", 2 ) == 0 )\r\n\t{\r\n\t\treturn 0;\r\n\t}\r\n\r\n\treturn 1;\r\n}\r\n\r\n\r\nint DKIM_CALL SelectorCallback(const char* szFQDN, char* szBuffer, int nBufLen )\r\n{\r\n\treturn 0;\r\n}\r\n\r\n\r\n\r\nint main(int argc, char* argv[])\r\n{\r\n\tint n;\r\n\tconst char* PrivKeyFile = \"test.pem\";\r\n\tconst char* MsgFile = \"test.msg\";\r\n\tconst char* OutFile = \"signed.msg\";\r\n\tint nPrivKeyLen;\r\n\tchar PrivKey[2048];\r\n\tchar Buffer[1024];\r\n\tint BufLen;\r\n\tchar szSignature[10024];\r\n\ttime_t t;\r\n\tDKIMContext ctxt;\r\n\tDKIMSignOptions opts = {0};\r\n\r\n\topts.nHash = DKIM_HASH_SHA1_AND_256;\r\n\r\n\ttime(&t);\r\n\r\n\topts.nCanon = DKIM_SIGN_RELAXED;\r\n\topts.nIncludeBodyLengthTag = 1;\r\n\topts.nIncludeQueryMethod = 0;\r\n\topts.nIncludeTimeStamp = 0;\r\n\topts.expireTime = t + 604800;\t\t\/\/ expires in 1 week\r\n\tstrcpy( opts.szSelector, MYSELECTOR );\r\n\tstrcpy( opts.szDomain, MYDOMAIN );\r\n\tstrcpy( opts.szIdentity, MYIDENTITY );\r\n\topts.pfnHeaderCallback = SignThisHeader;\r\n\tstrcpy( opts.szRequiredHeaders, \"NonExistant\" );\r\n\topts.nIncludeCopiedHeaders = 0;\r\n\topts.nIncludeBodyHash = DKIM_BODYHASH_BOTH;\r\n\r\n\tint nArgParseState = 0;\r\n\tbool bSign = true;\r\n\r\n\tfor( n = 1; n < argc; n++ )\r\n\t{\r\n\t\tif( argv[n][0] == '-' && strlen(argv[n]) > 1 )\r\n\t\t{\r\n\t\t\tswitch( argv[n][1] )\r\n\t\t\t{\r\n\t\t\tcase 'b':\t\t\/\/ allman or ietf draft 1 or both\r\n\t\t\t\topts.nIncludeBodyHash = atoi( &argv[n][2] );\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase 'c':\t\t\/\/ canonicalization\r\n\t\t\t\tif( argv[n][2] == 'r' )\r\n\t\t\t\t{\r\n\t\t\t\t\topts.nCanon = DKIM_SIGN_RELAXED;\r\n\t\t\t\t}\r\n\t\t\t\telse if( argv[n][2] == 's' )\r\n\t\t\t\t{\r\n\t\t\t\t\topts.nCanon = DKIM_SIGN_SIMPLE;\r\n\t\t\t\t}\r\n\t\t\t\telse if( argv[n][2] == 't' )\r\n\t\t\t\t{\r\n\t\t\t\t\topts.nCanon = DKIM_SIGN_RELAXED_SIMPLE;\r\n\t\t\t\t}\r\n\t\t\t\telse if( argv[n][2] == 'u' )\r\n\t\t\t\t{\r\n\t\t\t\t\topts.nCanon = DKIM_SIGN_SIMPLE_RELAXED;\r\n\t\t\t\t}\r\n\t\t\t\tbreak;\r\n\r\n\r\n\t\t\tcase 'l':\t\t\/\/ body length tag\r\n\t\t\t\topts.nIncludeBodyLengthTag = 1;\r\n\t\t\t\tbreak;\r\n\r\n\r\n\t\t\tcase 'h':\r\n\t\t\t\tprintf( \"usage: \\n\" );\r\n\t\t\t\treturn 0;\r\n\r\n\t\t\tcase 'i':\t\t\/\/ identity \r\n\t\t\t\tif( argv[n][2] == '-' )\r\n\t\t\t\t{\r\n\t\t\t\t\topts.szIdentity[0] = '\\0';\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\tstrcpy( opts.szIdentity, argv[n] + 2 );\r\n\t\t\t\t}\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase 'q':\t\t\/\/ query method tag\r\n\t\t\t\topts.nIncludeQueryMethod = 1;\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase 's':\t\t\/\/ sign\r\n\t\t\t\tbSign = true;\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase 't':\t\t\/\/ timestamp tag\r\n\t\t\t\topts.nIncludeTimeStamp = 1;\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase 'v':\t\t\/\/ verify\r\n\t\t\t\tbSign = false;\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase 'x':\t\t\/\/ expire time \r\n\t\t\t\tif( argv[n][2] == '-' )\r\n\t\t\t\t{\r\n\t\t\t\t\topts.expireTime = 0;\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\topts.expireTime = t + atoi( argv[n] + 2  );\r\n\t\t\t\t}\r\n\t\t\t\tbreak;\r\n\r\n\r\n\t\t\tcase 'z':\t\t\/\/ sign w\/ sha1, sha256 or both \r\n\t\t\t\topts.nHash = atoi( &argv[n][2] );\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tswitch( nArgParseState )\r\n\t\t\t{\r\n\t\t\tcase 0:\r\n\t\t\t\tMsgFile = argv[n];\r\n\t\t\t\tbreak;\r\n\t\t\tcase 1:\r\n\t\t\t\tPrivKeyFile = argv[n];\r\n\t\t\t\tbreak;\r\n\t\t\tcase 2:\r\n\t\t\t\tOutFile = argv[n];\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t\tnArgParseState++;\r\n\t\t}\r\n\t}\r\n\r\n\r\n\tif( bSign )\r\n\t{\r\n\t\tFILE* PrivKeyFP = fopen( PrivKeyFile, \"r\" );\r\n\r\n\t\tif ( PrivKeyFP == NULL ) \r\n\t\t{ \r\n\t\t  printf( \"dkimlibtest: can't open private key file %s\\n\", PrivKeyFile );\r\n\t\t  exit(1);\r\n\t\t}\r\n\t\tnPrivKeyLen = fread( PrivKey, 1, sizeof(PrivKey), PrivKeyFP );\r\n\t\tif (nPrivKeyLen == sizeof(PrivKey)) { \/* TC9 *\/\r\n\t\t  printf( \"dkimlibtest: private key buffer isn't big enough, use a smaller private key or recompile.\\n\");\r\n\t\t  exit(1);\r\n\t\t}\r\n\t\tPrivKey[nPrivKeyLen] = '\\0';\r\n\t\tfclose(PrivKeyFP);\r\n\r\n\r\n\t\tFILE* MsgFP = fopen( MsgFile, \"rb\" );\r\n\r\n\t\tif ( MsgFP == NULL ) \r\n\t\t{ \r\n\t\t\tprintf( \"dkimlibtest: can't open msg file %s\\n\", MsgFile );\r\n\t\t\texit(1);\r\n\t\t}\r\n\r\n\t\tn = DKIMSignInit( &ctxt, &opts );\r\n\r\n\t\twhile (1) {\r\n\t\t\t\r\n\t\t\tBufLen = fread( Buffer, 1, sizeof(Buffer), MsgFP );\r\n\r\n\t\t\tif( BufLen > 0 )\r\n\t\t\t{\r\n\t\t\t\tDKIMSignProcess( &ctxt, Buffer, BufLen );\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tfclose( MsgFP );\r\n\t\t\r\n\t\t\/\/n = DKIMSignGetSig( &ctxt, PrivKey, szSignature, sizeof(szSignature) );\r\n\r\n\t\tchar* pSig = NULL;\r\n\r\n\t\tn = DKIMSignGetSig2( &ctxt, PrivKey, &pSig );\r\n\r\n\t\tstrcpy( szSignature, pSig );\r\n\r\n\t\tDKIMSignFree( &ctxt );\r\n\r\n\t\tFILE* in = fopen( MsgFile, \"rb\" );\r\n\t\tFILE* out = fopen( OutFile, \"wb+\" );\r\n\r\n\t\tfwrite( szSignature, 1, strlen(szSignature), out );\r\n\t\tfwrite( \"\\r\\n\", 1, 2, out );\r\n\r\n\t\twhile (1) {\r\n\t\t\t\r\n\t\t\tBufLen = fread( Buffer, 1, sizeof(Buffer), in );\r\n\r\n\t\t\tif( BufLen > 0 )\r\n\t\t\t{\r\n\t\t\t\tfwrite( Buffer, 1, BufLen, out );\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tfclose( in );\r\n\t}\r\n\telse\r\n\t{\r\n\t\tFILE* in = fopen( MsgFile, \"rb\" );\r\n\r\n\t\tDKIMVerifyOptions vopts = {0};\r\n\t\tvopts.pfnSelectorCallback = NULL; \/\/SelectorCallback;\r\n\r\n\t\tn = DKIMVerifyInit( &ctxt, &vopts );\r\n\r\n\t\twhile (1) {\r\n\t\t\t\r\n\t\t\tBufLen = fread( Buffer, 1, sizeof(Buffer), in );\r\n\r\n\t\t\tif( BufLen > 0 )\r\n\t\t\t{\r\n\t\t\t\tDKIMVerifyProcess( &ctxt, Buffer, BufLen );\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tn = DKIMVerifyResults( &ctxt );\r\n\r\n\t\tint nSigCount = 0;\r\n\t\tDKIMVerifyDetails* pDetails;\r\n\t\tchar szPolicy[512];\r\n\r\n\t\tn = DKIMVerifyGetDetails(&ctxt, &nSigCount, &pDetails, szPolicy );\r\n\r\n\t\tfor ( int i = 0; i < nSigCount; i++)\r\n\t\t{\r\n\t\t\tprintf( \"Signature #%d: \", i + 1 );\r\n\r\n\t\t\tif( pDetails[i].nResult >= 0 )\r\n\t\t\t\tprintf( \"Success\\n\" );\r\n\t\t\telse\r\n\t\t\t\tprintf( \"Failure\\n\" );\r\n\t\t}\r\n\r\n\t\tDKIMVerifyFree( &ctxt );\r\n\t}\r\n\r\n\treturn 0;\r\n}\r\n<commit_msg>Added usage info to libdkimtest<commit_after>\/*****************************************************************************\r\n*  Copyright 2005 Alt-N Technologies, Ltd. \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*  This code incorporates intellectual property owned by Yahoo! and licensed \r\n*  pursuant to the Yahoo! DomainKeys Patent License Agreement.\r\n*\r\n*  Unless required by applicable law or agreed to in writing, software \r\n*  distributed under the License is distributed on an \"AS IS\" BASIS, \r\n*  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. \r\n*  See the License for the specific language governing permissions and \r\n*  limitations under the License.\r\n*\r\n*****************************************************************************\/\r\n\r\n#ifdef WIN32\r\n#include <windows.h>\r\n#else\r\n#define strnicmp strncasecmp \r\n#endif\r\n\r\n#include <stdio.h>\r\n#include <string.h>\r\n#include <time.h>\r\n#include <stdlib.h>\r\n\r\n#include \"dkim.h\"\r\n#include \"dns.h\"\r\n\r\n\r\n\/\/ change these to your selector name, domain name, etc\r\n#define MYSELECTOR\t\"MDaemon\"\r\n#define MYDOMAIN\t\"bardenhagen.com\"\r\n#define MYIDENTITY\t\"dkimtest@bardenhagen.com\"\r\n\r\n\r\nint DKIM_CALL SignThisHeader(const char* szHeader)\r\n{\r\n\tif( strnicmp( szHeader, \"X-\", 2 ) == 0 )\r\n\t{\r\n\t\treturn 0;\r\n\t}\r\n\r\n\treturn 1;\r\n}\r\n\r\n\r\nint DKIM_CALL SelectorCallback(const char* szFQDN, char* szBuffer, int nBufLen )\r\n{\r\n\treturn 0;\r\n}\r\n\r\nvoid usage()\r\n{\r\n\r\n\tprintf( \"usage: libdkimtest [-b<allman|ietf|both>] [-c<r|s|t|u>] [-d<domain>] [-l] [-h] [-i<you@yourdomain.com>] [-q] [-s] [-t] [-v] [-x<expire time>] [-z<hash>] <msgfile> <privkeyfile> <outfile>\\n\" );\r\n\tprintf( \"-b<standard> allman , ietf or both\\n\" );\r\n\tprintf( \"-c<canonicalization> r for relaxed [DEFAULT], s - simple, t relaxed\/simple, u - simple\/relaxed\\n\" );\r\n\tprintf( \"-d<domain> the domain tag, if not provided it will be determined from the sender\/from header\\n\" );\r\n\tprintf( \"-l include body length tag\\n\" );\r\n\tprintf( \"-h this help\\n\" );\r\n\tprintf( \"-i<identity> the identity, if not provided it will not be included\\n\" );\r\n\tprintf( \"-s sign the message\\n\" );\r\n\tprintf( \"-t include a timestamp tag\\n\" );\r\n\tprintf( \"-v verify the message\\n\" );\r\n\tprintf( \"-x<expire_time> the expire time in seconds since epoch ( DEFAULT = current time + 604800)\\n\\t if set to - then it will not be included\" );\r\n\tprintf( \"-z<hash>  1 for sha1, 2 for sha256, 3 for both\\n\" );\r\n\tprintf( \"-y<selector> the selector tag DEFAULT=MDaemon\\n\" );\r\n}\r\nint main(int argc, char* argv[])\r\n{\r\n\tint n;\r\n\tconst char* PrivKeyFile = \"test.pem\";\r\n\tconst char* MsgFile = \"test.msg\";\r\n\tconst char* OutFile = \"signed.msg\";\r\n\tint nPrivKeyLen;\r\n\tchar PrivKey[2048];\r\n\tchar Buffer[1024];\r\n\tint BufLen;\r\n\tchar szSignature[10024];\r\n\ttime_t t;\r\n\tDKIMContext ctxt;\r\n\tDKIMSignOptions opts = {0};\r\n\r\n\topts.nHash = DKIM_HASH_SHA1_AND_256;\r\n\r\n\ttime(&t);\r\n\r\n\topts.nCanon = DKIM_SIGN_RELAXED;\r\n\topts.nIncludeBodyLengthTag = 0;\r\n\topts.nIncludeQueryMethod = 0;\r\n\topts.nIncludeTimeStamp = 0;\r\n\topts.expireTime = t + 604800;\t\t\/\/ expires in 1 week\r\n\tstrcpy( opts.szSelector, MYSELECTOR );\r\n\tstrcpy( opts.szDomain, MYDOMAIN );\r\n\tstrcpy( opts.szIdentity, MYIDENTITY );\r\n\topts.pfnHeaderCallback = SignThisHeader;\r\n\tstrcpy( opts.szRequiredHeaders, \"NonExistant\" );\r\n\topts.nIncludeCopiedHeaders = 0;\r\n\topts.nIncludeBodyHash = DKIM_BODYHASH_BOTH;\r\n\r\n\tint nArgParseState = 0;\r\n\tbool bSign = true;\r\n\r\n\tif( argc < 2 )\n\t{\r\n\t\tusage();\r\n\t\treturn 1;\r\n\t}\r\n\r\n\tfor( n = 1; n < argc; n++ )\r\n\t{\r\n\t\tif( argv[n][0] == '-' && strlen(argv[n]) > 1 )\r\n\t\t{\r\n\t\t\tswitch( argv[n][1] )\r\n\t\t\t{\r\n\t\t\tcase 'b':\t\t\/\/ allman or ietf draft 1 or both\r\n\t\t\t\topts.nIncludeBodyHash = atoi( &argv[n][2] );\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase 'c':\t\t\/\/ canonicalization\r\n\t\t\t\tif( argv[n][2] == 'r' )\r\n\t\t\t\t{\r\n\t\t\t\t\topts.nCanon = DKIM_SIGN_RELAXED;\r\n\t\t\t\t}\r\n\t\t\t\telse if( argv[n][2] == 's' )\r\n\t\t\t\t{\r\n\t\t\t\t\topts.nCanon = DKIM_SIGN_SIMPLE;\r\n\t\t\t\t}\r\n\t\t\t\telse if( argv[n][2] == 't' )\r\n\t\t\t\t{\r\n\t\t\t\t\topts.nCanon = DKIM_SIGN_RELAXED_SIMPLE;\r\n\t\t\t\t}\r\n\t\t\t\telse if( argv[n][2] == 'u' )\r\n\t\t\t\t{\r\n\t\t\t\t\topts.nCanon = DKIM_SIGN_SIMPLE_RELAXED;\r\n\t\t\t\t}\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase 'd':\r\n\t\t\t\tstrncpy( opts.szDomain, (const char*) (argv[n] + 2), sizeof(opts.szDomain) - 1 );\r\n\t\t\t\tbreak;\r\n\t\t\tcase 'l':\t\t\/\/ body length tag\r\n\t\t\t\topts.nIncludeBodyLengthTag = 1;\r\n\t\t\t\tbreak;\r\n\r\n\r\n\t\t\tcase 'h':\r\n\t\t\t\tusage();\r\n\t\t\t\treturn 0;\r\n\r\n\t\t\tcase 'i':\t\t\/\/ identity \r\n\t\t\t\tif( argv[n][2] == '-' )\r\n\t\t\t\t{\r\n\t\t\t\t\topts.szIdentity[0] = '\\0';\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\tstrncpy( opts.szIdentity, argv[n] + 2, sizeof(opts.szIdentity) - 1 );\r\n\t\t\t\t}\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase 'q':\t\t\/\/ query method tag\r\n\t\t\t\topts.nIncludeQueryMethod = 1;\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase 's':\t\t\/\/ sign\r\n\t\t\t\tbSign = true;\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase 't':\t\t\/\/ timestamp tag\r\n\t\t\t\topts.nIncludeTimeStamp = 1;\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase 'v':\t\t\/\/ verify\r\n\t\t\t\tbSign = false;\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase 'x':\t\t\/\/ expire time \r\n\t\t\t\tif( argv[n][2] == '-' )\r\n\t\t\t\t{\r\n\t\t\t\t\topts.expireTime = 0;\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\topts.expireTime = t + atoi( argv[n] + 2  );\r\n\t\t\t\t}\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase 'y':\r\n\t\t\t\tstrncpy( opts.szSelector, argv[n] + 2, sizeof(opts.szSelector) - 1 );\r\n\t\t\t\tbreak;\r\n\r\n\t\t\tcase 'z':\t\t\/\/ sign w\/ sha1, sha256 or both \r\n\t\t\t\topts.nHash = atoi( &argv[n][2] );\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tswitch( nArgParseState )\r\n\t\t\t{\r\n\t\t\tcase 0:\r\n\t\t\t\tMsgFile = argv[n];\r\n\t\t\t\tbreak;\r\n\t\t\tcase 1:\r\n\t\t\t\tPrivKeyFile = argv[n];\r\n\t\t\t\tbreak;\r\n\t\t\tcase 2:\r\n\t\t\t\tOutFile = argv[n];\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t\tnArgParseState++;\r\n\t\t}\r\n\t}\r\n\r\n\r\n\tif( bSign )\r\n\t{\r\n\t\tFILE* PrivKeyFP = fopen( PrivKeyFile, \"r\" );\r\n\r\n\t\tif ( PrivKeyFP == NULL ) \r\n\t\t{ \r\n\t\t  printf( \"dkimlibtest: can't open private key file %s\\n\", PrivKeyFile );\r\n\t\t  exit(1);\r\n\t\t}\r\n\t\tnPrivKeyLen = fread( PrivKey, 1, sizeof(PrivKey), PrivKeyFP );\r\n\t\tif (nPrivKeyLen == sizeof(PrivKey)) { \/* TC9 *\/\r\n\t\t  printf( \"dkimlibtest: private key buffer isn't big enough, use a smaller private key or recompile.\\n\");\r\n\t\t  exit(1);\r\n\t\t}\r\n\t\tPrivKey[nPrivKeyLen] = '\\0';\r\n\t\tfclose(PrivKeyFP);\r\n\r\n\r\n\t\tFILE* MsgFP = fopen( MsgFile, \"rb\" );\r\n\r\n\t\tif ( MsgFP == NULL ) \r\n\t\t{ \r\n\t\t\tprintf( \"dkimlibtest: can't open msg file %s\\n\", MsgFile );\r\n\t\t\texit(1);\r\n\t\t}\r\n\r\n\t\tn = DKIMSignInit( &ctxt, &opts );\r\n\r\n\t\twhile (1) {\r\n\t\t\t\r\n\t\t\tBufLen = fread( Buffer, 1, sizeof(Buffer), MsgFP );\r\n\r\n\t\t\tif( BufLen > 0 )\r\n\t\t\t{\r\n\t\t\t\tDKIMSignProcess( &ctxt, Buffer, BufLen );\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tfclose( MsgFP );\r\n\t\t\r\n\t\t\/\/n = DKIMSignGetSig( &ctxt, PrivKey, szSignature, sizeof(szSignature) );\r\n\r\n\t\tchar* pSig = NULL;\r\n\r\n\t\tn = DKIMSignGetSig2( &ctxt, PrivKey, &pSig );\r\n\r\n\t\tstrcpy( szSignature, pSig );\r\n\r\n\t\tDKIMSignFree( &ctxt );\r\n\r\n\t\tFILE* in = fopen( MsgFile, \"rb\" );\r\n\t\tFILE* out = fopen( OutFile, \"wb+\" );\r\n\r\n\t\tfwrite( szSignature, 1, strlen(szSignature), out );\r\n\t\tfwrite( \"\\r\\n\", 1, 2, out );\r\n\r\n\t\twhile (1) {\r\n\t\t\t\r\n\t\t\tBufLen = fread( Buffer, 1, sizeof(Buffer), in );\r\n\r\n\t\t\tif( BufLen > 0 )\r\n\t\t\t{\r\n\t\t\t\tfwrite( Buffer, 1, BufLen, out );\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tfclose( in );\r\n\t}\r\n\telse\r\n\t{\r\n\t\tFILE* in = fopen( MsgFile, \"rb\" );\r\n\r\n\t\tDKIMVerifyOptions vopts = {0};\r\n\t\tvopts.pfnSelectorCallback = NULL; \/\/SelectorCallback;\r\n\r\n\t\tn = DKIMVerifyInit( &ctxt, &vopts );\r\n\r\n\t\twhile (1) {\r\n\t\t\t\r\n\t\t\tBufLen = fread( Buffer, 1, sizeof(Buffer), in );\r\n\r\n\t\t\tif( BufLen > 0 )\r\n\t\t\t{\r\n\t\t\t\tDKIMVerifyProcess( &ctxt, Buffer, BufLen );\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tn = DKIMVerifyResults( &ctxt );\r\n\r\n\t\tint nSigCount = 0;\r\n\t\tDKIMVerifyDetails* pDetails;\r\n\t\tchar szPolicy[512];\r\n\r\n\t\tn = DKIMVerifyGetDetails(&ctxt, &nSigCount, &pDetails, szPolicy );\r\n\r\n\t\tfor ( int i = 0; i < nSigCount; i++)\r\n\t\t{\r\n\t\t\tprintf( \"Signature #%d: \", i + 1 );\r\n\r\n\t\t\tif( pDetails[i].nResult >= 0 )\r\n\t\t\t\tprintf( \"Success\\n\" );\r\n\t\t\telse\r\n\t\t\t\tprintf( \"Failure\\n\" );\r\n\t\t}\r\n\r\n\t\tDKIMVerifyFree( &ctxt );\r\n\t}\r\n\r\n\treturn 0;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>#include <silicium\/single_directory_watcher.hpp>\n#include <silicium\/observable\/consume.hpp>\n#include <silicium\/observable\/spawn_coroutine.hpp>\n#include <silicium\/open.hpp>\n#include <silicium\/sink\/file_sink.hpp>\n#include <boost\/test\/unit_test.hpp>\n#include <boost\/asio\/steady_timer.hpp>\n#include <boost\/thread.hpp>\n#include <boost\/date_time\/posix_time\/posix_time_duration.hpp>\n#include <fstream>\n#include <chrono>\n#if SILICIUM_HAS_SINGLE_DIRECTORY_WATCHER\n#\tinclude <boost\/filesystem\/operations.hpp>\n#endif\n\nnamespace Si\n{\n#if SILICIUM_HAS_SINGLE_DIRECTORY_WATCHER\n\tnamespace\n\t{\n\t\tvoid touch(Si::absolute_path const &name)\n\t\t{\n\t\t\t\/\/remove existing file to reset the attributes\n\t\t\tSi::remove_file(name);\n\n\t\t\tstd::ofstream file(name.c_str());\n\t\t\tBOOST_REQUIRE(file);\n\t\t}\n\n\t\tvoid test_single_event(\n\t\t\tSi::absolute_path const &watched_dir,\n\t\t\tstd::function<void ()> const &provoke_event,\n\t\t\tstd::function<void (file_notification const &)> const &on_event)\n\t\t{\n\t\t\tboost::asio::io_service io;\n\t\t\tsingle_directory_watcher watcher(io, watched_dir);\n\n\t\t\tbool got_event = false;\n\t\t\tauto consumer = consume<file_notification>([&io, &got_event, &on_event](file_notification const &event)\n\t\t\t{\n\t\t\t\tio.stop();\n\t\t\t\ton_event(event);\n\t\t\t\tgot_event = true;\n\t\t\t});\n\t\t\twatcher.async_get_one(Si::observe_by_ref(consumer));\n\n#ifdef _WIN32\n\t\t\t\/\/currently the implementation for Windows needs some time for the background thread to set everything up\n\t\t\tboost::this_thread::sleep(boost::posix_time::seconds(1));\n#endif\n\n\t\t\tprovoke_event();\n\n\t\t\tboost::asio::basic_waitable_timer<std::chrono::steady_clock> timeout(io);\n\t\t\ttimeout.expires_from_now(std::chrono::seconds(1));\n\t\t\ttimeout.async_wait([&io](boost::system::error_code)\n\t\t\t{\n\t\t\t\tio.stop();\n\t\t\t});\n\n\t\t\tio.run();\n\n\t\t\tBOOST_CHECK(got_event);\n\t\t}\n\t}\n\n\tBOOST_AUTO_TEST_CASE(file_system_watcher_add_regular)\n\t{\n\t\tSi::absolute_path const watched_dir = Si::get_current_working_directory();\n\t\tSi::absolute_path const test_file = watched_dir \/ Si::relative_path(\"test.txt\");\n\t\tSi::remove_file(test_file);\n\n\t\ttest_single_event(\n\t\t\twatched_dir,\n\t\t\tstd::bind(touch, test_file),\n\t\t\t[&test_file](file_notification const &event)\n\t\t{\n\t\t\tBOOST_CHECK(file_notification_type::add == event.type);\n\t\t\tBOOST_CHECK(equivalent(test_file.to_boost_path(), event.name.to_boost_path()));\n\t\t});\n\t}\n\n\tBOOST_AUTO_TEST_CASE(file_system_watcher_add_directory)\n\t{\n\t\tSi::absolute_path const watched_dir = Si::get_current_working_directory();\n\t\tSi::absolute_path const test_file = watched_dir \/ \"test\";\n\t\tSi::remove_file(test_file);\n\n\t\ttest_single_event(\n\t\t\twatched_dir,\n\t\t\t[&test_file]\n\t\t{\n\t\t\tboost::filesystem::create_directory(test_file.to_boost_path());\n\t\t},\n\t\t\t[&test_file](file_notification const &event)\n\t\t{\n\t\t\tBOOST_CHECK(file_notification_type::add == event.type);\n\t\t\tBOOST_CHECK(equivalent(test_file.to_boost_path(), event.name.to_boost_path()));\n\t\t});\n\t}\n\n\tBOOST_AUTO_TEST_CASE(file_system_watcher_remove)\n\t{\n\t\tSi::absolute_path const watched_dir = Si::get_current_working_directory();\n\t\tSi::absolute_path const test_file = watched_dir \/ \"test.txt\";\n\n\t\ttouch(test_file);\n\n\t\ttest_single_event(\n\t\t\twatched_dir,\n\t\t\t[&test_file]\n\t\t{\n\t\t\tboost::filesystem::remove(test_file.to_boost_path());\n\t\t},\n\t\t\t[&test_file, &watched_dir](file_notification const &event)\n\t\t{\n\t\t\tBOOST_CHECK(file_notification_type::remove == event.type);\n\t\t\tBOOST_CHECK_EQUAL(test_file, watched_dir \/ event.name);\n\t\t});\n\t}\n\n\tBOOST_AUTO_TEST_CASE(file_system_watcher_remove_directory)\n\t{\n\t\tSi::absolute_path const watched_dir = Si::get_current_working_directory();\n\t\tSi::absolute_path const test_file = watched_dir \/ \"test\";\n\n\t\tboost::filesystem::create_directory(test_file.to_boost_path());\n\n\t\ttest_single_event(\n\t\t\twatched_dir,\n\t\t\t[&test_file]\n\t\t{\n\t\t\tboost::filesystem::remove(test_file.to_boost_path());\n\t\t},\n\t\t\t[&test_file, &watched_dir](file_notification const &event)\n\t\t{\n\t\t\tBOOST_CHECK(file_notification_type::remove == event.type);\n\t\t\tBOOST_CHECK_EQUAL(test_file, watched_dir \/ event.name);\n\t\t});\n\t}\n\n\n\tBOOST_AUTO_TEST_CASE(file_system_watcher_change_on_write)\n\t{\n\t\tSi::absolute_path const watched_dir = Si::get_current_working_directory();\n\t\tSi::absolute_path const test_file = watched_dir \/ \"test.txt\";\n\t\t\n\t\tboost::filesystem::create_directories(watched_dir.to_boost_path());\n\t\tSi::file_handle file = Si::overwrite_file(Si::native_path_string(test_file.c_str())).move_value();\n\n\t\ttest_single_event(\n\t\t\twatched_dir,\n\t\t\t[&file]\n\t\t{\n\t\t\tSi::file_sink sink(file.handle);\n\t\t\tSi::append(sink, Si::file_sink_element(Si::make_c_str_range(\"hello\\n\")));\n\t\t\tSi::append(sink, Si::file_sink_element(Si::flush()));\n\t\t\t\/\/we write to the file without closing it\n\t\t},\n\t\t\t[&test_file, &watched_dir](file_notification const &event)\n\t\t{\n\t\t\tBOOST_CHECK(event.type == file_notification_type::change_content || event.type == file_notification_type::change_content_or_metadata);\n\t\t\tBOOST_CHECK_EQUAL(test_file, watched_dir \/ event.name);\n\t\t});\n\t}\n\n\tBOOST_AUTO_TEST_CASE(file_system_watcher_change_on_close)\n\t{\n\t\tSi::absolute_path const watched_dir = Si::get_current_working_directory();\n\t\tSi::absolute_path const test_file = watched_dir \/ \"test.txt\";\n\n\t\ttouch(test_file);\n\n\t\tstd::ofstream file(test_file.c_str());\n\t\tBOOST_REQUIRE(file);\n\t\tfile << \"hello\\n\";\n\t\tfile.flush();\n\n\t\ttest_single_event(\n\t\t\twatched_dir,\n\t\t\t[&file]\n\t\t{\n\t\t\t\/\/The closing of the file is expected to trigger a change event.\n\t\t\tfile.close();\n\t\t},\n\t\t\t[&test_file, &watched_dir](file_notification const &event)\n\t\t{\n\t\t\tBOOST_CHECK(event.type == file_notification_type::change_content || event.type == file_notification_type::change_content_or_metadata);\n\t\t\tBOOST_CHECK_EQUAL(test_file, watched_dir \/ event.name);\n\t\t});\n\t}\n\n\tBOOST_AUTO_TEST_CASE(file_system_watcher_change_metadata)\n\t{\n\t\tSi::absolute_path const watched_dir = Si::get_current_working_directory();\n\t\tSi::absolute_path const test_file = watched_dir \/ \"test.txt\";\n\n\t\ttouch(test_file);\n\n#ifdef _WIN32\n\t\tBOOST_REQUIRE(SetFileAttributesW(test_file.c_str(), FILE_ATTRIBUTE_NORMAL));\n#else\n\t\tBOOST_REQUIRE(!chmod(test_file.c_str(), 0555));\n#endif\n\n\t\ttest_single_event(\n\t\t\twatched_dir,\n\t\t\t[&test_file]\n\t\t{\n#ifdef _WIN32\n\t\t\tBOOST_REQUIRE(SetFileAttributesW(test_file.c_str(), FILE_ATTRIBUTE_TEMPORARY));\n#else\n\t\t\tBOOST_REQUIRE(!chmod(test_file.c_str(), 0755));\n#endif\n\t\t},\n\t\t\t[&test_file, &watched_dir](file_notification const &event)\n\t\t{\n\t\t\tBOOST_CHECK(file_notification_type::change_content_or_metadata == event.type || file_notification_type::change_metadata == event.type);\n\t\t\tBOOST_CHECK_EQUAL(test_file, watched_dir \/ event.name);\n\t\t});\n\t}\n\n\tBOOST_AUTO_TEST_CASE(file_system_watcher_move_out)\n\t{\n\t\tSi::absolute_path const root_dir = Si::get_current_working_directory();\n\t\tSi::absolute_path const watched_dir = root_dir \/ \"watched\";\n\t\tSi::absolute_path const original_name = watched_dir \/ \"test.txt\";\n\t\tSi::absolute_path const new_name = root_dir \/ \"renamed.txt\";\n\n\t\tboost::filesystem::remove_all(new_name.to_boost_path());\n\t\tboost::filesystem::remove_all(watched_dir.to_boost_path());\n\n\t\tboost::filesystem::create_directories(watched_dir.to_boost_path());\n\t\ttouch(original_name);\n\n\t\ttest_single_event(\n\t\t\twatched_dir,\n\t\t\t[&original_name, &new_name]\n\t\t{\n\t\t\tboost::filesystem::rename(original_name.to_boost_path(), new_name.to_boost_path());\n\t\t},\n\t\t\t[&original_name, &watched_dir](file_notification const &event)\n\t\t{\n\t\t\tBOOST_CHECK(file_notification_type::remove == event.type);\n\t\t\tBOOST_CHECK_EQUAL(original_name, watched_dir \/ event.name);\n\t\t});\n\t}\n\n\tBOOST_AUTO_TEST_CASE(file_system_watcher_move_in)\n\t{\n\t\tSi::absolute_path const root_dir = Si::get_current_working_directory();\n\t\tSi::absolute_path const watched_dir = root_dir \/ \"watched\";\n\t\tSi::absolute_path const original_name = root_dir \/ \"test.txt\";\n\t\tSi::absolute_path const new_name = watched_dir \/ \"renamed.txt\";\n\n\t\tboost::filesystem::remove_all(watched_dir.to_boost_path());\n\n\t\tboost::filesystem::create_directories(watched_dir.to_boost_path());\n\t\ttouch(original_name);\n\n\t\ttest_single_event(\n\t\t\twatched_dir,\n\t\t\t[&original_name, &new_name]\n\t\t{\n\t\t\tboost::filesystem::rename(original_name.to_boost_path(), new_name.to_boost_path());\n\t\t},\n\t\t\t[&new_name, &watched_dir](file_notification const &event)\n\t\t{\n\t\t\tBOOST_CHECK(file_notification_type::add == event.type);\n\t\t\tBOOST_CHECK_EQUAL(new_name, watched_dir \/ event.name);\n\t\t});\n\t}\n\n#ifndef _WIN32\n\t\/\/we cannot yet detect the renaming of the watched directory\n\tBOOST_AUTO_TEST_CASE(file_system_watcher_rename_watched_dir)\n\t{\n\t\tSi::absolute_path const root_dir = Si::get_current_working_directory();\n\t\tSi::absolute_path const watched_dir = root_dir \/ \"watched\";\n\t\tSi::absolute_path const new_name = root_dir \/ \"renamed\";\n\n\t\tboost::filesystem::remove_all(watched_dir.to_boost_path());\n\t\tboost::filesystem::remove_all(new_name.to_boost_path());\n\n\t\tboost::filesystem::create_directories(watched_dir.to_boost_path());\n\n\t\ttest_single_event(\n\t\t\twatched_dir,\n\t\t\t[&watched_dir, &new_name]\n\t\t{\n\t\t\tboost::filesystem::rename(watched_dir.to_boost_path(), new_name.to_boost_path());\n\t\t},\n\t\t\t[&watched_dir](file_notification const &event)\n\t\t{\n\t\t\tBOOST_CHECK(file_notification_type::move_self == event.type);\n\t\t\tBOOST_CHECK_EQUAL(\"\", event.name.underlying());\n\t\t});\n\t}\n#endif\n\n#ifndef _WIN32\n\t\/\/we cannot yet detect the removal of the watched directory\n\tBOOST_AUTO_TEST_CASE(file_system_watcher_remove_watched_dir)\n\t{\n\t\tSi::absolute_path const root_dir = Si::get_current_working_directory();\n\t\tSi::absolute_path const watched_dir = root_dir \/ \"watched\";\n\n\t\tboost::filesystem::remove_all(watched_dir.to_boost_path());\n\n\t\tboost::filesystem::create_directories(watched_dir.to_boost_path());\n\n\t\ttest_single_event(\n\t\t\twatched_dir,\n\t\t\t[&watched_dir]\n\t\t{\n\t\t\tboost::filesystem::remove(watched_dir.to_boost_path());\n\t\t},\n\t\t\t[&watched_dir](file_notification const &event)\n\t\t{\n\t\t\tBOOST_CHECK(file_notification_type::remove_self == event.type);\n\t\t\tBOOST_CHECK_EQUAL(\"\", event.name.underlying());\n\t\t});\n\t}\n#endif\n\n#if SILICIUM_HAS_SPAWN_COROUTINE\n\tBOOST_AUTO_TEST_CASE(file_system_watcher_rename_in_dir)\n\t{\n\t\tSi::absolute_path const watched_dir = Si::get_current_working_directory();\n\t\tSi::absolute_path const test_file_a = watched_dir \/ \"test_a.txt\";\n\t\tSi::absolute_path const test_file_b = watched_dir \/ \"test_b.txt\";\n\n\t\ttouch(test_file_a);\n\t\tboost::filesystem::remove(test_file_b.to_boost_path());\n\n\t\tboost::asio::io_service io;\n\t\tsingle_directory_watcher watcher(io, watched_dir);\n\n\t\tbool got_something = false;\n\n\t\tspawn_coroutine([&watcher, &test_file_a, &test_file_b, &got_something](spawn_context &yield)\n\t\t{\n\t\t\toptional<file_notification> first_event = yield.get_one(Si::ref(watcher));\n\t\t\tBOOST_REQUIRE(first_event);\n\t\t\toptional<file_notification> second_event = yield.get_one(Si::ref(watcher));\n\t\t\tBOOST_REQUIRE(second_event);\n\n\t\t\tgot_something = true;\n\n\t\t\tfile_notification *remove = &*first_event;\n\t\t\tfile_notification *add = &*second_event;\n\t\t\tif (add->type != file_notification_type::add)\n\t\t\t{\n\t\t\t\tusing std::swap;\n\t\t\t\tswap(remove, add);\n\t\t\t}\n\n\t\t\tBOOST_CHECK(file_notification_type::remove == remove->type);\n\t\t\tBOOST_CHECK_EQUAL(leaf(test_file_a), remove->name);\n\n\t\t\tBOOST_CHECK(file_notification_type::add == add->type);\n\t\t\tBOOST_CHECK_EQUAL(leaf(test_file_b), add->name);\n\t\t});\n\n\t\tboost::filesystem::rename(test_file_a.to_boost_path(), test_file_b.to_boost_path());\n\n\t\tboost::asio::basic_waitable_timer<std::chrono::steady_clock> timeout(io);\n\t\ttimeout.expires_from_now(std::chrono::seconds(1));\n\t\ttimeout.async_wait([&io](boost::system::error_code)\n\t\t{\n\t\t\tio.stop();\n\t\t});\n\n\t\tio.run();\n\n\t\tBOOST_CHECK(got_something);\n\t}\n#endif\n#endif\n}\n<commit_msg>artificial sleep in the directory watcher test on Win32 seems to be unnecessary (?)<commit_after>#include <silicium\/single_directory_watcher.hpp>\n#include <silicium\/observable\/consume.hpp>\n#include <silicium\/observable\/spawn_coroutine.hpp>\n#include <silicium\/open.hpp>\n#include <silicium\/sink\/file_sink.hpp>\n#include <boost\/test\/unit_test.hpp>\n#include <boost\/asio\/steady_timer.hpp>\n#include <boost\/thread.hpp>\n#include <boost\/date_time\/posix_time\/posix_time_duration.hpp>\n#include <fstream>\n#include <chrono>\n#if SILICIUM_HAS_SINGLE_DIRECTORY_WATCHER\n#\tinclude <boost\/filesystem\/operations.hpp>\n#endif\n\nnamespace Si\n{\n#if SILICIUM_HAS_SINGLE_DIRECTORY_WATCHER\n\tnamespace\n\t{\n\t\tvoid touch(Si::absolute_path const &name)\n\t\t{\n\t\t\t\/\/remove existing file to reset the attributes\n\t\t\tSi::remove_file(name);\n\n\t\t\tstd::ofstream file(name.c_str());\n\t\t\tBOOST_REQUIRE(file);\n\t\t}\n\n\t\tvoid test_single_event(\n\t\t\tSi::absolute_path const &watched_dir,\n\t\t\tstd::function<void ()> const &provoke_event,\n\t\t\tstd::function<void (file_notification const &)> const &on_event)\n\t\t{\n\t\t\tboost::asio::io_service io;\n\t\t\tsingle_directory_watcher watcher(io, watched_dir);\n\n\t\t\tbool got_event = false;\n\t\t\tauto consumer = consume<file_notification>([&io, &got_event, &on_event](file_notification const &event)\n\t\t\t{\n\t\t\t\tio.stop();\n\t\t\t\ton_event(event);\n\t\t\t\tgot_event = true;\n\t\t\t});\n\t\t\twatcher.async_get_one(Si::observe_by_ref(consumer));\n\n\t\t\tprovoke_event();\n\n\t\t\tboost::asio::basic_waitable_timer<std::chrono::steady_clock> timeout(io);\n\t\t\ttimeout.expires_from_now(std::chrono::seconds(1));\n\t\t\ttimeout.async_wait([&io](boost::system::error_code)\n\t\t\t{\n\t\t\t\tio.stop();\n\t\t\t});\n\n\t\t\tio.run();\n\n\t\t\tBOOST_CHECK(got_event);\n\t\t}\n\t}\n\n\tBOOST_AUTO_TEST_CASE(file_system_watcher_add_regular)\n\t{\n\t\tSi::absolute_path const watched_dir = Si::get_current_working_directory();\n\t\tSi::absolute_path const test_file = watched_dir \/ Si::relative_path(\"test.txt\");\n\t\tSi::remove_file(test_file);\n\n\t\ttest_single_event(\n\t\t\twatched_dir,\n\t\t\tstd::bind(touch, test_file),\n\t\t\t[&test_file](file_notification const &event)\n\t\t{\n\t\t\tBOOST_CHECK(file_notification_type::add == event.type);\n\t\t\tBOOST_CHECK(equivalent(test_file.to_boost_path(), event.name.to_boost_path()));\n\t\t});\n\t}\n\n\tBOOST_AUTO_TEST_CASE(file_system_watcher_add_directory)\n\t{\n\t\tSi::absolute_path const watched_dir = Si::get_current_working_directory();\n\t\tSi::absolute_path const test_file = watched_dir \/ \"test\";\n\t\tSi::remove_file(test_file);\n\n\t\ttest_single_event(\n\t\t\twatched_dir,\n\t\t\t[&test_file]\n\t\t{\n\t\t\tboost::filesystem::create_directory(test_file.to_boost_path());\n\t\t},\n\t\t\t[&test_file](file_notification const &event)\n\t\t{\n\t\t\tBOOST_CHECK(file_notification_type::add == event.type);\n\t\t\tBOOST_CHECK(equivalent(test_file.to_boost_path(), event.name.to_boost_path()));\n\t\t});\n\t}\n\n\tBOOST_AUTO_TEST_CASE(file_system_watcher_remove)\n\t{\n\t\tSi::absolute_path const watched_dir = Si::get_current_working_directory();\n\t\tSi::absolute_path const test_file = watched_dir \/ \"test.txt\";\n\n\t\ttouch(test_file);\n\n\t\ttest_single_event(\n\t\t\twatched_dir,\n\t\t\t[&test_file]\n\t\t{\n\t\t\tboost::filesystem::remove(test_file.to_boost_path());\n\t\t},\n\t\t\t[&test_file, &watched_dir](file_notification const &event)\n\t\t{\n\t\t\tBOOST_CHECK(file_notification_type::remove == event.type);\n\t\t\tBOOST_CHECK_EQUAL(test_file, watched_dir \/ event.name);\n\t\t});\n\t}\n\n\tBOOST_AUTO_TEST_CASE(file_system_watcher_remove_directory)\n\t{\n\t\tSi::absolute_path const watched_dir = Si::get_current_working_directory();\n\t\tSi::absolute_path const test_file = watched_dir \/ \"test\";\n\n\t\tboost::filesystem::create_directory(test_file.to_boost_path());\n\n\t\ttest_single_event(\n\t\t\twatched_dir,\n\t\t\t[&test_file]\n\t\t{\n\t\t\tboost::filesystem::remove(test_file.to_boost_path());\n\t\t},\n\t\t\t[&test_file, &watched_dir](file_notification const &event)\n\t\t{\n\t\t\tBOOST_CHECK(file_notification_type::remove == event.type);\n\t\t\tBOOST_CHECK_EQUAL(test_file, watched_dir \/ event.name);\n\t\t});\n\t}\n\n\n\tBOOST_AUTO_TEST_CASE(file_system_watcher_change_on_write)\n\t{\n\t\tSi::absolute_path const watched_dir = Si::get_current_working_directory();\n\t\tSi::absolute_path const test_file = watched_dir \/ \"test.txt\";\n\t\t\n\t\tboost::filesystem::create_directories(watched_dir.to_boost_path());\n\t\tSi::file_handle file = Si::overwrite_file(Si::native_path_string(test_file.c_str())).move_value();\n\n\t\ttest_single_event(\n\t\t\twatched_dir,\n\t\t\t[&file]\n\t\t{\n\t\t\tSi::file_sink sink(file.handle);\n\t\t\tSi::append(sink, Si::file_sink_element(Si::make_c_str_range(\"hello\\n\")));\n\t\t\tSi::append(sink, Si::file_sink_element(Si::flush()));\n\t\t\t\/\/we write to the file without closing it\n\t\t},\n\t\t\t[&test_file, &watched_dir](file_notification const &event)\n\t\t{\n\t\t\tBOOST_CHECK(event.type == file_notification_type::change_content || event.type == file_notification_type::change_content_or_metadata);\n\t\t\tBOOST_CHECK_EQUAL(test_file, watched_dir \/ event.name);\n\t\t});\n\t}\n\n\tBOOST_AUTO_TEST_CASE(file_system_watcher_change_on_close)\n\t{\n\t\tSi::absolute_path const watched_dir = Si::get_current_working_directory();\n\t\tSi::absolute_path const test_file = watched_dir \/ \"test.txt\";\n\n\t\ttouch(test_file);\n\n\t\tstd::ofstream file(test_file.c_str());\n\t\tBOOST_REQUIRE(file);\n\t\tfile << \"hello\\n\";\n\t\tfile.flush();\n\n\t\ttest_single_event(\n\t\t\twatched_dir,\n\t\t\t[&file]\n\t\t{\n\t\t\t\/\/The closing of the file is expected to trigger a change event.\n\t\t\tfile.close();\n\t\t},\n\t\t\t[&test_file, &watched_dir](file_notification const &event)\n\t\t{\n\t\t\tBOOST_CHECK(event.type == file_notification_type::change_content || event.type == file_notification_type::change_content_or_metadata);\n\t\t\tBOOST_CHECK_EQUAL(test_file, watched_dir \/ event.name);\n\t\t});\n\t}\n\n\tBOOST_AUTO_TEST_CASE(file_system_watcher_change_metadata)\n\t{\n\t\tSi::absolute_path const watched_dir = Si::get_current_working_directory();\n\t\tSi::absolute_path const test_file = watched_dir \/ \"test.txt\";\n\n\t\ttouch(test_file);\n\n#ifdef _WIN32\n\t\tBOOST_REQUIRE(SetFileAttributesW(test_file.c_str(), FILE_ATTRIBUTE_NORMAL));\n#else\n\t\tBOOST_REQUIRE(!chmod(test_file.c_str(), 0555));\n#endif\n\n\t\ttest_single_event(\n\t\t\twatched_dir,\n\t\t\t[&test_file]\n\t\t{\n#ifdef _WIN32\n\t\t\tBOOST_REQUIRE(SetFileAttributesW(test_file.c_str(), FILE_ATTRIBUTE_TEMPORARY));\n#else\n\t\t\tBOOST_REQUIRE(!chmod(test_file.c_str(), 0755));\n#endif\n\t\t},\n\t\t\t[&test_file, &watched_dir](file_notification const &event)\n\t\t{\n\t\t\tBOOST_CHECK(file_notification_type::change_content_or_metadata == event.type || file_notification_type::change_metadata == event.type);\n\t\t\tBOOST_CHECK_EQUAL(test_file, watched_dir \/ event.name);\n\t\t});\n\t}\n\n\tBOOST_AUTO_TEST_CASE(file_system_watcher_move_out)\n\t{\n\t\tSi::absolute_path const root_dir = Si::get_current_working_directory();\n\t\tSi::absolute_path const watched_dir = root_dir \/ \"watched\";\n\t\tSi::absolute_path const original_name = watched_dir \/ \"test.txt\";\n\t\tSi::absolute_path const new_name = root_dir \/ \"renamed.txt\";\n\n\t\tboost::filesystem::remove_all(new_name.to_boost_path());\n\t\tboost::filesystem::remove_all(watched_dir.to_boost_path());\n\n\t\tboost::filesystem::create_directories(watched_dir.to_boost_path());\n\t\ttouch(original_name);\n\n\t\ttest_single_event(\n\t\t\twatched_dir,\n\t\t\t[&original_name, &new_name]\n\t\t{\n\t\t\tboost::filesystem::rename(original_name.to_boost_path(), new_name.to_boost_path());\n\t\t},\n\t\t\t[&original_name, &watched_dir](file_notification const &event)\n\t\t{\n\t\t\tBOOST_CHECK(file_notification_type::remove == event.type);\n\t\t\tBOOST_CHECK_EQUAL(original_name, watched_dir \/ event.name);\n\t\t});\n\t}\n\n\tBOOST_AUTO_TEST_CASE(file_system_watcher_move_in)\n\t{\n\t\tSi::absolute_path const root_dir = Si::get_current_working_directory();\n\t\tSi::absolute_path const watched_dir = root_dir \/ \"watched\";\n\t\tSi::absolute_path const original_name = root_dir \/ \"test.txt\";\n\t\tSi::absolute_path const new_name = watched_dir \/ \"renamed.txt\";\n\n\t\tboost::filesystem::remove_all(watched_dir.to_boost_path());\n\n\t\tboost::filesystem::create_directories(watched_dir.to_boost_path());\n\t\ttouch(original_name);\n\n\t\ttest_single_event(\n\t\t\twatched_dir,\n\t\t\t[&original_name, &new_name]\n\t\t{\n\t\t\tboost::filesystem::rename(original_name.to_boost_path(), new_name.to_boost_path());\n\t\t},\n\t\t\t[&new_name, &watched_dir](file_notification const &event)\n\t\t{\n\t\t\tBOOST_CHECK(file_notification_type::add == event.type);\n\t\t\tBOOST_CHECK_EQUAL(new_name, watched_dir \/ event.name);\n\t\t});\n\t}\n\n#ifndef _WIN32\n\t\/\/we cannot yet detect the renaming of the watched directory\n\tBOOST_AUTO_TEST_CASE(file_system_watcher_rename_watched_dir)\n\t{\n\t\tSi::absolute_path const root_dir = Si::get_current_working_directory();\n\t\tSi::absolute_path const watched_dir = root_dir \/ \"watched\";\n\t\tSi::absolute_path const new_name = root_dir \/ \"renamed\";\n\n\t\tboost::filesystem::remove_all(watched_dir.to_boost_path());\n\t\tboost::filesystem::remove_all(new_name.to_boost_path());\n\n\t\tboost::filesystem::create_directories(watched_dir.to_boost_path());\n\n\t\ttest_single_event(\n\t\t\twatched_dir,\n\t\t\t[&watched_dir, &new_name]\n\t\t{\n\t\t\tboost::filesystem::rename(watched_dir.to_boost_path(), new_name.to_boost_path());\n\t\t},\n\t\t\t[&watched_dir](file_notification const &event)\n\t\t{\n\t\t\tBOOST_CHECK(file_notification_type::move_self == event.type);\n\t\t\tBOOST_CHECK_EQUAL(\"\", event.name.underlying());\n\t\t});\n\t}\n#endif\n\n#ifndef _WIN32\n\t\/\/we cannot yet detect the removal of the watched directory\n\tBOOST_AUTO_TEST_CASE(file_system_watcher_remove_watched_dir)\n\t{\n\t\tSi::absolute_path const root_dir = Si::get_current_working_directory();\n\t\tSi::absolute_path const watched_dir = root_dir \/ \"watched\";\n\n\t\tboost::filesystem::remove_all(watched_dir.to_boost_path());\n\n\t\tboost::filesystem::create_directories(watched_dir.to_boost_path());\n\n\t\ttest_single_event(\n\t\t\twatched_dir,\n\t\t\t[&watched_dir]\n\t\t{\n\t\t\tboost::filesystem::remove(watched_dir.to_boost_path());\n\t\t},\n\t\t\t[&watched_dir](file_notification const &event)\n\t\t{\n\t\t\tBOOST_CHECK(file_notification_type::remove_self == event.type);\n\t\t\tBOOST_CHECK_EQUAL(\"\", event.name.underlying());\n\t\t});\n\t}\n#endif\n\n#if SILICIUM_HAS_SPAWN_COROUTINE\n\tBOOST_AUTO_TEST_CASE(file_system_watcher_rename_in_dir)\n\t{\n\t\tSi::absolute_path const watched_dir = Si::get_current_working_directory();\n\t\tSi::absolute_path const test_file_a = watched_dir \/ \"test_a.txt\";\n\t\tSi::absolute_path const test_file_b = watched_dir \/ \"test_b.txt\";\n\n\t\ttouch(test_file_a);\n\t\tboost::filesystem::remove(test_file_b.to_boost_path());\n\n\t\tboost::asio::io_service io;\n\t\tsingle_directory_watcher watcher(io, watched_dir);\n\n\t\tbool got_something = false;\n\n\t\tspawn_coroutine([&watcher, &test_file_a, &test_file_b, &got_something](spawn_context &yield)\n\t\t{\n\t\t\toptional<file_notification> first_event = yield.get_one(Si::ref(watcher));\n\t\t\tBOOST_REQUIRE(first_event);\n\t\t\toptional<file_notification> second_event = yield.get_one(Si::ref(watcher));\n\t\t\tBOOST_REQUIRE(second_event);\n\n\t\t\tgot_something = true;\n\n\t\t\tfile_notification *remove = &*first_event;\n\t\t\tfile_notification *add = &*second_event;\n\t\t\tif (add->type != file_notification_type::add)\n\t\t\t{\n\t\t\t\tusing std::swap;\n\t\t\t\tswap(remove, add);\n\t\t\t}\n\n\t\t\tBOOST_CHECK(file_notification_type::remove == remove->type);\n\t\t\tBOOST_CHECK_EQUAL(leaf(test_file_a), remove->name);\n\n\t\t\tBOOST_CHECK(file_notification_type::add == add->type);\n\t\t\tBOOST_CHECK_EQUAL(leaf(test_file_b), add->name);\n\t\t});\n\n\t\tboost::filesystem::rename(test_file_a.to_boost_path(), test_file_b.to_boost_path());\n\n\t\tboost::asio::basic_waitable_timer<std::chrono::steady_clock> timeout(io);\n\t\ttimeout.expires_from_now(std::chrono::seconds(1));\n\t\ttimeout.async_wait([&io](boost::system::error_code)\n\t\t{\n\t\t\tio.stop();\n\t\t});\n\n\t\tio.run();\n\n\t\tBOOST_CHECK(got_something);\n\t}\n#endif\n#endif\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright 2010 Thomas McGuire <mcguire@kde.org>\n   Copyright 2011 Alexander Potashev <aspotashev@gmail.com>\n\n   This library is free software; you can redistribute it and\/or modify\n   it under the terms of the GNU Library General Public License as published\n   by the Free Software Foundation; either version 2 of the License or\n   ( at your option ) version 3 or, at the discretion of KDE e.V.\n   ( which shall act as a proxy as in section 14 of the GPLv3 ), 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 \"authenticationdialog.moc\"\n\n#include <KLocalizedString>\n#include <KWebView>\n#include <KMessageBox>\n#include <KDebug>\n#include <QVBoxLayout>\n#include <QTimer>\n#include <QLabel>\n#include <QProgressBar>\n\nnamespace Vkontakte\n{\n\nclass AuthenticationDialog::Private\n{\npublic:\n    QString appId;\n    QStringList permissions;\n    QString displayMode;\n\n    KWebView *webView;\n    QProgressBar *progressBar;\n\n    QString error;\n    QString errorDescription;\n};\n\nAuthenticationDialog::AuthenticationDialog(QWidget *parent)\n    : KDialog(parent)\n    , d(new Private)\n{\n    d->displayMode = \"page\";\n\n    setButtons(KDialog::Cancel);\n    setCaption(i18nc(\"@title:window\", \"Authenticate with VKontakte\"));\n    setAttribute(Qt::WA_DeleteOnClose, true);\n\n    QWidget *widget = new QWidget(this);\n    QVBoxLayout *layout = new QVBoxLayout(widget);\n    QWidget *progressWidget = new QWidget(this);\n    QHBoxLayout *progressLayout = new QHBoxLayout(progressWidget);\n    progressLayout->setMargin(0);\n    layout->setMargin(0);\n    setMainWidget(widget);\n    d->webView = new KWebView(this);\n\n    d->progressBar = new QProgressBar(this);\n    d->progressBar->setRange(0, 100);\n    QLabel *progressLabel = new QLabel(i18n(\"Loading Page:\"), this);\n    progressLayout->addWidget(progressLabel);\n    progressLayout->addWidget(d->progressBar);\n\n    layout->addWidget(progressWidget);\n    layout->addWidget(d->webView);\n\n    connect(this, SIGNAL(cancelClicked()), SIGNAL(canceled()));\n    connect(d->webView, SIGNAL(urlChanged(QUrl)), this, SLOT(urlChanged(QUrl)));\n    connect(d->webView, SIGNAL(loadStarted()), progressWidget, SLOT(show()));\n    connect(d->webView, SIGNAL(loadFinished(bool)), progressWidget, SLOT(hide()));\n    connect(d->webView, SIGNAL(loadProgress(int)), d->progressBar, SLOT(setValue(int)));\n    connect(d->webView, SIGNAL(loadFinished(bool)), this, SLOT(loadFinished(bool)));\n}\n\nAuthenticationDialog::~AuthenticationDialog()\n{\n    delete d;\n}\n\nvoid AuthenticationDialog::setAppId(const QString &appId)\n{\n    d->appId = appId;\n}\n\nvoid AuthenticationDialog::setPermissions(const QStringList &permissions)\n{\n    d->permissions = permissions;\n}\n\n\/\/ display= {page, popup, touch, wap}\nvoid AuthenticationDialog::setDisplayMode(const QString &displayMode)\n{\n    d->displayMode = displayMode;\n}\n\nvoid AuthenticationDialog::start()\n{\n    Q_ASSERT(!d->appId.isEmpty());\n\n    const QString url = QString(\"http:\/\/api.vkontakte.ru\/oauth\/authorize?\"\n                                \"client_id=%1&\"\n                                \"scope=%2&\"\n                                \"redirect_uri=http:\/\/api.vkontakte.ru\/blank.html&\"\n                                \"display=%3&\"\n                                \"response_type=token\")\n                                .arg(d->appId)\n                                .arg(d->permissions.join(\",\"))\n                                .arg(d->displayMode);\n    kDebug() << \"Showing\" << url;\n    d->webView->setUrl(QUrl::fromUserInput(url));\n    show();\n}\n\nvoid AuthenticationDialog::showErrorDialog()\n{\n    hide();\n    const QString details = i18n(\"<b>VKontakte Error Description:<\/b> %1<br>\"\n                                 \"<b>VKontakte Error:<\/b> %2<br>\", d->errorDescription, d->error);\n    KMessageBox::detailedSorry(this, i18n(\"Authentication with VKontakte was not successful.\"),\n                               details, i18nc(\"@title:window\", \"Authentication Problem\"));\n    emit canceled();\n    close();\n}\n\nvoid AuthenticationDialog::urlChanged(const QUrl &url)\n{\n    kDebug() << \"Navigating to\" << url;\n    if (url.host() == \"api.vkontakte.ru\" && url.path() == \"\/blank.html\")\n    {\n        d->error = url.queryItemValue(\"error\");\n        d->errorDescription = url.queryItemValue(\"error_description\").replace('+', ' ');\n        if (!d->error.isEmpty() || !d->errorDescription.isEmpty())\n        {\n            QTimer::singleShot(0, this, SLOT(showErrorDialog()));\n            return;\n        }\n\n        \/\/ The URL comes in the form \"bla#access_token=bla&expires_in=foo\", we need to convert from\n        \/\/ # to ?\n        const QUrl fixedURL = QUrl::fromUserInput(url.toString().replace('#', '?'));\n        const QString accessToken = fixedURL.queryItemValue(\"access_token\");\n        const QString tokenExpiresIn = fixedURL.queryItemValue(\"expires_in\"); \/\/ TODO: use this for something?\n        if (!accessToken.isEmpty())\n        {\n            emit authenticated(accessToken);\n            QTimer::singleShot(0, this, SLOT(close()));\n        }\n    }\n}\n\nvoid AuthenticationDialog::loadFinished(bool ok)\n{\n    if (!ok)\n    {\n        emit canceled();\n        close();\n\n        KMessageBox::error(parentWidget(),\n                           i18n(\"There was a network error when trying to authenticate with VKontakte web service.\"),\n                           i18nc(\"@title:window\", \"Network Error\"));\n    }\n}\n\n} \/* namespace Vkontakte *\/\n<commit_msg>Fix crash when network is unavailable<commit_after>\/* Copyright 2010 Thomas McGuire <mcguire@kde.org>\n   Copyright 2011 Alexander Potashev <aspotashev@gmail.com>\n\n   This library is free software; you can redistribute it and\/or modify\n   it under the terms of the GNU Library General Public License as published\n   by the Free Software Foundation; either version 2 of the License or\n   ( at your option ) version 3 or, at the discretion of KDE e.V.\n   ( which shall act as a proxy as in section 14 of the GPLv3 ), 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 \"authenticationdialog.moc\"\n\n#include <KLocalizedString>\n#include <KWebView>\n#include <KMessageBox>\n#include <KDebug>\n#include <QVBoxLayout>\n#include <QTimer>\n#include <QLabel>\n#include <QProgressBar>\n\nnamespace Vkontakte\n{\n\nclass AuthenticationDialog::Private\n{\npublic:\n    QString appId;\n    QStringList permissions;\n    QString displayMode;\n\n    KWebView *webView;\n    QProgressBar *progressBar;\n\n    QString error;\n    QString errorDescription;\n};\n\nAuthenticationDialog::AuthenticationDialog(QWidget *parent)\n    : KDialog(parent)\n    , d(new Private)\n{\n    d->displayMode = \"page\";\n\n    setButtons(KDialog::Cancel);\n    setCaption(i18nc(\"@title:window\", \"Authenticate with VKontakte\"));\n    setAttribute(Qt::WA_DeleteOnClose, true);\n\n    QWidget *widget = new QWidget(this);\n    QVBoxLayout *layout = new QVBoxLayout(widget);\n    QWidget *progressWidget = new QWidget(this);\n    QHBoxLayout *progressLayout = new QHBoxLayout(progressWidget);\n    progressLayout->setMargin(0);\n    layout->setMargin(0);\n    setMainWidget(widget);\n    d->webView = new KWebView(this);\n\n    d->progressBar = new QProgressBar(this);\n    d->progressBar->setRange(0, 100);\n    QLabel *progressLabel = new QLabel(i18n(\"Loading Page:\"), this);\n    progressLayout->addWidget(progressLabel);\n    progressLayout->addWidget(d->progressBar);\n\n    layout->addWidget(progressWidget);\n    layout->addWidget(d->webView);\n\n    connect(this, SIGNAL(cancelClicked()), SIGNAL(canceled()));\n    connect(d->webView, SIGNAL(urlChanged(QUrl)), this, SLOT(urlChanged(QUrl)));\n    connect(d->webView, SIGNAL(loadStarted()), progressWidget, SLOT(show()));\n    connect(d->webView, SIGNAL(loadFinished(bool)), progressWidget, SLOT(hide()));\n    connect(d->webView, SIGNAL(loadProgress(int)), d->progressBar, SLOT(setValue(int)));\n    connect(d->webView, SIGNAL(loadFinished(bool)), this, SLOT(loadFinished(bool)));\n}\n\nAuthenticationDialog::~AuthenticationDialog()\n{\n    delete d;\n}\n\nvoid AuthenticationDialog::setAppId(const QString &appId)\n{\n    d->appId = appId;\n}\n\nvoid AuthenticationDialog::setPermissions(const QStringList &permissions)\n{\n    d->permissions = permissions;\n}\n\n\/\/ display= {page, popup, touch, wap}\nvoid AuthenticationDialog::setDisplayMode(const QString &displayMode)\n{\n    d->displayMode = displayMode;\n}\n\nvoid AuthenticationDialog::start()\n{\n    Q_ASSERT(!d->appId.isEmpty());\n\n    const QString url = QString(\"http:\/\/api.vkontakte.ru\/oauth\/authorize?\"\n                                \"client_id=%1&\"\n                                \"scope=%2&\"\n                                \"redirect_uri=http:\/\/api.vkontakte.ru\/blank.html&\"\n                                \"display=%3&\"\n                                \"response_type=token\")\n                                .arg(d->appId)\n                                .arg(d->permissions.join(\",\"))\n                                .arg(d->displayMode);\n    kDebug() << \"Showing\" << url;\n    d->webView->setUrl(QUrl::fromUserInput(url));\n    show();\n}\n\nvoid AuthenticationDialog::showErrorDialog()\n{\n    hide();\n    const QString details = i18n(\"<b>VKontakte Error Description:<\/b> %1<br>\"\n                                 \"<b>VKontakte Error:<\/b> %2<br>\", d->errorDescription, d->error);\n    KMessageBox::detailedSorry(this, i18n(\"Authentication with VKontakte was not successful.\"),\n                               details, i18nc(\"@title:window\", \"Authentication Problem\"));\n    emit canceled();\n    close();\n}\n\nvoid AuthenticationDialog::urlChanged(const QUrl &url)\n{\n    kDebug() << \"Navigating to\" << url;\n    if (url.host() == \"api.vkontakte.ru\" && url.path() == \"\/blank.html\")\n    {\n        d->error = url.queryItemValue(\"error\");\n        d->errorDescription = url.queryItemValue(\"error_description\").replace('+', ' ');\n        if (!d->error.isEmpty() || !d->errorDescription.isEmpty())\n        {\n            QTimer::singleShot(0, this, SLOT(showErrorDialog()));\n            return;\n        }\n\n        \/\/ The URL comes in the form \"bla#access_token=bla&expires_in=foo\", we need to convert from\n        \/\/ # to ?\n        const QUrl fixedURL = QUrl::fromUserInput(url.toString().replace('#', '?'));\n        const QString accessToken = fixedURL.queryItemValue(\"access_token\");\n        const QString tokenExpiresIn = fixedURL.queryItemValue(\"expires_in\"); \/\/ TODO: use this for something?\n        if (!accessToken.isEmpty())\n        {\n            emit authenticated(accessToken);\n            QTimer::singleShot(0, this, SLOT(close()));\n        }\n    }\n}\n\nvoid AuthenticationDialog::loadFinished(bool ok)\n{\n    if (!ok)\n    {\n        hide();\n\n        KMessageBox::error(parentWidget(),\n                           i18n(\"There was a network error when trying to authenticate with VKontakte web service.\"),\n                           i18nc(\"@title:window\", \"Network Error\"));\n\n        emit canceled();\n        close();\n    }\n}\n\n} \/* namespace Vkontakte *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/ RUN: %clang_cc1 %s -triple=x86_64-apple-darwin10 -emit-llvm-only -fdump-vtable-layouts 2>&1 | FileCheck %s\nnamespace Test1 {\n\n\/\/ CHECK:      Vtable for 'Test1::A' (3 entries).\n\/\/ CHECK-NEXT:   0 | offset_to_top (0)\n\/\/ CHECK-NEXT:   1 | Test1::A RTTI\n\/\/ CHECK-NEXT:       -- (Test1::A, 0) vtable address --\n\/\/ CHECK-NEXT:   2 | void Test1::A::f()\nstruct A {\n  virtual void f();\n};\n\nvoid A::f() { }\n}\n\nnamespace Test2 {\n\n\/\/ This is a smoke test of the vtable dumper.\n\/\/ CHECK:      Vtable for 'Test2::A' (8 entries).\n\/\/ CHECK-NEXT:   0 | offset_to_top (0)\n\/\/ CHECK-NEXT:   1 | Test2::A RTTI\n\/\/ CHECK-NEXT:       -- (Test2::A, 0) vtable address --\n\/\/ CHECK-NEXT:   2 | void Test2::A::f()\n\/\/ CHECK-NEXT:   3 | void Test2::A::f() const\n\/\/ CHECK-NEXT:   4 | Test2::A *Test2::A::g(int)\n\/\/ CHECK-NEXT:   5 | Test2::A::~A() [complete]\n\/\/ CHECK-NEXT:   6 | Test2::A::~A() [deleting]\n\/\/ CHECK-NEXT:   7 | void Test2::A::h()\nstruct A {\n  virtual void f();\n  virtual void f() const;\n  \n  virtual A* g(int a);\n  virtual ~A();\n  virtual void h();\n};\n\nvoid A::f() { }\n\n}\n<commit_msg>Add virtual operator= example.<commit_after>\/\/ RUN: %clang_cc1 %s -triple=x86_64-apple-darwin10 -emit-llvm-only -fdump-vtable-layouts 2>&1 | FileCheck %s\nnamespace Test1 {\n\n\/\/ CHECK:      Vtable for 'Test1::A' (3 entries).\n\/\/ CHECK-NEXT:   0 | offset_to_top (0)\n\/\/ CHECK-NEXT:   1 | Test1::A RTTI\n\/\/ CHECK-NEXT:       -- (Test1::A, 0) vtable address --\n\/\/ CHECK-NEXT:   2 | void Test1::A::f()\nstruct A {\n  virtual void f();\n};\n\nvoid A::f() { }\n}\n\nnamespace Test2 {\n\n\/\/ This is a smoke test of the vtable dumper.\n\/\/ CHECK:      Vtable for 'Test2::A' (9 entries).\n\/\/ CHECK-NEXT:   0 | offset_to_top (0)\n\/\/ CHECK-NEXT:   1 | Test2::A RTTI\n\/\/ CHECK-NEXT:       -- (Test2::A, 0) vtable address --\n\/\/ CHECK-NEXT:   2 | void Test2::A::f()\n\/\/ CHECK-NEXT:   3 | void Test2::A::f() const\n\/\/ CHECK-NEXT:   4 | Test2::A *Test2::A::g(int)\n\/\/ CHECK-NEXT:   5 | Test2::A::~A() [complete]\n\/\/ CHECK-NEXT:   6 | Test2::A::~A() [deleting]\n\/\/ CHECK-NEXT:   7 | void Test2::A::h()\n\/\/ CHECK-NEXT:   8 | Test2::A &Test2::A::operator=(Test2::A const &)\nstruct A {\n  virtual void f();\n  virtual void f() const;\n  \n  virtual A* g(int a);\n  virtual ~A();\n  virtual void h();\n  virtual A& operator=(const A&);\n};\n\nvoid A::f() { }\n\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>INTEGRATION: CWS dba202a (1.10.36); FILE MERGED 2005\/11\/25 08:34:39 oj 1.10.36.1: #126933# check if char is > 127<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 \"media\/filters\/vpx_video_decoder.h\"\n\n#include <algorithm>\n#include <string>\n\n#include \"base\/bind.h\"\n#include \"base\/callback_helpers.h\"\n#include \"base\/command_line.h\"\n#include \"base\/location.h\"\n#include \"base\/logging.h\"\n#include \"base\/message_loop\/message_loop_proxy.h\"\n#include \"base\/strings\/string_number_conversions.h\"\n#include \"base\/sys_byteorder.h\"\n#include \"media\/base\/bind_to_loop.h\"\n#include \"media\/base\/decoder_buffer.h\"\n#include \"media\/base\/demuxer_stream.h\"\n#include \"media\/base\/media_switches.h\"\n#include \"media\/base\/pipeline.h\"\n#include \"media\/base\/video_decoder_config.h\"\n#include \"media\/base\/video_frame.h\"\n#include \"media\/base\/video_util.h\"\n\n\/\/ Include libvpx header files.\n\/\/ VPX_CODEC_DISABLE_COMPAT excludes parts of the libvpx API that provide\n\/\/ backwards compatibility for legacy applications using the library.\n#define VPX_CODEC_DISABLE_COMPAT 1\nextern \"C\" {\n#include \"third_party\/libvpx\/source\/libvpx\/vpx\/vpx_decoder.h\"\n#include \"third_party\/libvpx\/source\/libvpx\/vpx\/vp8dx.h\"\n}\n\nnamespace media {\n\n\/\/ Always try to use three threads for video decoding.  There is little reason\n\/\/ not to since current day CPUs tend to be multi-core and we measured\n\/\/ performance benefits on older machines such as P4s with hyperthreading.\nstatic const int kDecodeThreads = 2;\nstatic const int kMaxDecodeThreads = 16;\n\n\/\/ Returns the number of threads.\nstatic int GetThreadCount() {\n  \/\/ TODO(scherkus): De-duplicate this function and the one used by\n  \/\/ FFmpegVideoDecoder.\n\n  \/\/ Refer to http:\/\/crbug.com\/93932 for tsan suppressions on decoding.\n  int decode_threads = kDecodeThreads;\n\n  const CommandLine* cmd_line = CommandLine::ForCurrentProcess();\n  std::string threads(cmd_line->GetSwitchValueASCII(switches::kVideoThreads));\n  if (threads.empty() || !base::StringToInt(threads, &decode_threads))\n    return decode_threads;\n\n  decode_threads = std::max(decode_threads, 0);\n  decode_threads = std::min(decode_threads, kMaxDecodeThreads);\n  return decode_threads;\n}\n\nVpxVideoDecoder::VpxVideoDecoder(\n    const scoped_refptr<base::MessageLoopProxy>& message_loop)\n    : message_loop_(message_loop),\n      weak_factory_(this),\n      state_(kUninitialized),\n      vpx_codec_(NULL),\n      vpx_codec_alpha_(NULL) {\n}\n\nVpxVideoDecoder::~VpxVideoDecoder() {\n  DCHECK_EQ(kUninitialized, state_);\n  CloseDecoder();\n}\n\nvoid VpxVideoDecoder::Initialize(const VideoDecoderConfig& config,\n                                 const PipelineStatusCB& status_cb) {\n  DCHECK(message_loop_->BelongsToCurrentThread());\n  DCHECK(config.IsValidConfig());\n  DCHECK(!config.is_encrypted());\n  DCHECK(decode_cb_.is_null());\n  DCHECK(reset_cb_.is_null());\n\n  weak_this_ = weak_factory_.GetWeakPtr();\n\n  if (!ConfigureDecoder(config)) {\n    status_cb.Run(DECODER_ERROR_NOT_SUPPORTED);\n    return;\n  }\n\n  \/\/ Success!\n  config_ = config;\n  state_ = kNormal;\n  status_cb.Run(PIPELINE_OK);\n}\n\nstatic vpx_codec_ctx* InitializeVpxContext(vpx_codec_ctx* context,\n                                           const VideoDecoderConfig& config) {\n  context = new vpx_codec_ctx();\n  vpx_codec_dec_cfg_t vpx_config = {0};\n  vpx_config.w = config.coded_size().width();\n  vpx_config.h = config.coded_size().height();\n  vpx_config.threads = GetThreadCount();\n\n  vpx_codec_err_t status = vpx_codec_dec_init(context,\n                                              config.codec() == kCodecVP9 ?\n                                                  vpx_codec_vp9_dx() :\n                                                  vpx_codec_vp8_dx(),\n                                              &vpx_config,\n                                              0);\n  if (status != VPX_CODEC_OK) {\n    LOG(ERROR) << \"vpx_codec_dec_init failed, status=\" << status;\n    delete context;\n    return NULL;\n  }\n  return context;\n}\n\nbool VpxVideoDecoder::ConfigureDecoder(const VideoDecoderConfig& config) {\n  const CommandLine* cmd_line = CommandLine::ForCurrentProcess();\n  bool can_handle = false;\n  if (config.codec() == kCodecVP9)\n    can_handle = true;\n  if (!cmd_line->HasSwitch(switches::kDisableVp8AlphaPlayback) &&\n      config.codec() == kCodecVP8 && config.format() == VideoFrame::YV12A) {\n    can_handle = true;\n  }\n  if (!can_handle)\n    return false;\n\n  CloseDecoder();\n\n  vpx_codec_ = InitializeVpxContext(vpx_codec_, config);\n  if (!vpx_codec_)\n    return false;\n\n  if (config.format() == VideoFrame::YV12A) {\n    vpx_codec_alpha_ = InitializeVpxContext(vpx_codec_alpha_, config);\n    if (!vpx_codec_alpha_)\n      return false;\n  }\n\n  return true;\n}\n\nvoid VpxVideoDecoder::CloseDecoder() {\n  if (vpx_codec_) {\n    vpx_codec_destroy(vpx_codec_);\n    delete vpx_codec_;\n    vpx_codec_ = NULL;\n  }\n  if (vpx_codec_alpha_) {\n    vpx_codec_destroy(vpx_codec_alpha_);\n    delete vpx_codec_alpha_;\n    vpx_codec_alpha_ = NULL;\n  }\n}\n\nvoid VpxVideoDecoder::Decode(const scoped_refptr<DecoderBuffer>& buffer,\n                             const DecodeCB& decode_cb) {\n  DCHECK(message_loop_->BelongsToCurrentThread());\n  DCHECK(!decode_cb.is_null());\n  CHECK_NE(state_, kUninitialized);\n  CHECK(decode_cb_.is_null()) << \"Overlapping decodes are not supported.\";\n\n  decode_cb_ = BindToCurrentLoop(decode_cb);\n\n  if (state_ == kError) {\n    base::ResetAndReturn(&decode_cb_).Run(kDecodeError, NULL);\n    return;\n  }\n\n  \/\/ Return empty frames if decoding has finished.\n  if (state_ == kDecodeFinished) {\n    base::ResetAndReturn(&decode_cb_).Run(kOk, VideoFrame::CreateEmptyFrame());\n    return;\n  }\n\n  DecodeBuffer(buffer);\n}\n\nvoid VpxVideoDecoder::Reset(const base::Closure& closure) {\n  DCHECK(message_loop_->BelongsToCurrentThread());\n  DCHECK(reset_cb_.is_null());\n  reset_cb_ = BindToCurrentLoop(closure);\n\n  \/\/ Defer the reset if a decode is pending.\n  if (!decode_cb_.is_null())\n    return;\n\n  DoReset();\n}\n\nvoid VpxVideoDecoder::Stop(const base::Closure& closure) {\n  DCHECK(message_loop_->BelongsToCurrentThread());\n  base::ScopedClosureRunner runner(BindToCurrentLoop(closure));\n\n  if (state_ == kUninitialized)\n    return;\n\n  if (!decode_cb_.is_null()) {\n    base::ResetAndReturn(&decode_cb_).Run(kOk, NULL);\n    \/\/ Reset is pending only when decode is pending.\n    if (!reset_cb_.is_null())\n      base::ResetAndReturn(&reset_cb_).Run();\n  }\n\n  state_ = kUninitialized;\n}\n\nbool VpxVideoDecoder::HasAlpha() const {\n  return vpx_codec_alpha_ != NULL;\n}\n\nvoid VpxVideoDecoder::DecodeBuffer(const scoped_refptr<DecoderBuffer>& buffer) {\n  DCHECK(message_loop_->BelongsToCurrentThread());\n  DCHECK_NE(state_, kUninitialized);\n  DCHECK_NE(state_, kDecodeFinished);\n  DCHECK_NE(state_, kError);\n  DCHECK(reset_cb_.is_null());\n  DCHECK(!decode_cb_.is_null());\n  DCHECK(buffer);\n\n  \/\/ Transition to kDecodeFinished on the first end of stream buffer.\n  if (state_ == kNormal && buffer->end_of_stream()) {\n    state_ = kDecodeFinished;\n    base::ResetAndReturn(&decode_cb_).Run(kOk, VideoFrame::CreateEmptyFrame());\n    return;\n  }\n\n  scoped_refptr<VideoFrame> video_frame;\n  if (!VpxDecode(buffer, &video_frame)) {\n    state_ = kError;\n    base::ResetAndReturn(&decode_cb_).Run(kDecodeError, NULL);\n    return;\n  }\n\n  \/\/ If we didn't get a frame we need more data.\n  if (!video_frame.get()) {\n    base::ResetAndReturn(&decode_cb_).Run(kNotEnoughData, NULL);\n    return;\n  }\n\n  base::ResetAndReturn(&decode_cb_).Run(kOk, video_frame);\n}\n\nbool VpxVideoDecoder::VpxDecode(const scoped_refptr<DecoderBuffer>& buffer,\n                                scoped_refptr<VideoFrame>* video_frame) {\n  DCHECK(video_frame);\n  DCHECK(!buffer->end_of_stream());\n\n  \/\/ Pass |buffer| to libvpx.\n  int64 timestamp = buffer->timestamp().InMicroseconds();\n  void* user_priv = reinterpret_cast<void*>(&timestamp);\n  vpx_codec_err_t status = vpx_codec_decode(vpx_codec_,\n                                            buffer->data(),\n                                            buffer->data_size(),\n                                            user_priv,\n                                            0);\n  if (status != VPX_CODEC_OK) {\n    LOG(ERROR) << \"vpx_codec_decode() failed, status=\" << status;\n    return false;\n  }\n\n  \/\/ Gets pointer to decoded data.\n  vpx_codec_iter_t iter = NULL;\n  const vpx_image_t* vpx_image = vpx_codec_get_frame(vpx_codec_, &iter);\n  if (!vpx_image) {\n    *video_frame = NULL;\n    return true;\n  }\n\n  if (vpx_image->user_priv != reinterpret_cast<void*>(&timestamp)) {\n    LOG(ERROR) << \"Invalid output timestamp.\";\n    return false;\n  }\n\n  const vpx_image_t* vpx_image_alpha = NULL;\n  if (vpx_codec_alpha_ && buffer->side_data_size() >= 8) {\n    \/\/ Pass alpha data to libvpx.\n    int64 timestamp_alpha = buffer->timestamp().InMicroseconds();\n    void* user_priv_alpha = reinterpret_cast<void*>(&timestamp_alpha);\n\n    \/\/ First 8 bytes of side data is side_data_id in big endian.\n    const uint64 side_data_id = base::NetToHost64(\n        *(reinterpret_cast<const uint64*>(buffer->side_data())));\n    if (side_data_id == 1) {\n      status = vpx_codec_decode(vpx_codec_alpha_,\n                                buffer->side_data() + 8,\n                                buffer->side_data_size() - 8,\n                                user_priv_alpha,\n                                0);\n\n      if (status != VPX_CODEC_OK) {\n        LOG(ERROR) << \"vpx_codec_decode() failed on alpha, status=\" << status;\n        return false;\n      }\n\n      \/\/ Gets pointer to decoded data.\n      vpx_codec_iter_t iter_alpha = NULL;\n      vpx_image_alpha = vpx_codec_get_frame(vpx_codec_alpha_, &iter_alpha);\n      if (!vpx_image_alpha) {\n        *video_frame = NULL;\n        return true;\n      }\n\n      if (vpx_image_alpha->user_priv !=\n          reinterpret_cast<void*>(&timestamp_alpha)) {\n        LOG(ERROR) << \"Invalid output timestamp on alpha.\";\n        return false;\n      }\n    }\n  }\n\n  CopyVpxImageTo(vpx_image, vpx_image_alpha, video_frame);\n  (*video_frame)->SetTimestamp(base::TimeDelta::FromMicroseconds(timestamp));\n  return true;\n}\n\nvoid VpxVideoDecoder::DoReset() {\n  DCHECK(decode_cb_.is_null());\n\n  state_ = kNormal;\n  reset_cb_.Run();\n  reset_cb_.Reset();\n}\n\nvoid VpxVideoDecoder::CopyVpxImageTo(const vpx_image* vpx_image,\n                                     const struct vpx_image* vpx_image_alpha,\n                                     scoped_refptr<VideoFrame>* video_frame) {\n  CHECK(vpx_image);\n  CHECK_EQ(vpx_image->d_w % 2, 0U);\n  CHECK_EQ(vpx_image->d_h % 2, 0U);\n  CHECK(vpx_image->fmt == VPX_IMG_FMT_I420 ||\n        vpx_image->fmt == VPX_IMG_FMT_YV12);\n\n  gfx::Size size(vpx_image->d_w, vpx_image->d_h);\n\n  *video_frame = VideoFrame::CreateFrame(\n      vpx_codec_alpha_ ? VideoFrame::YV12A : VideoFrame::YV12,\n      size,\n      gfx::Rect(size),\n      config_.natural_size(),\n      kNoTimestamp());\n\n  CopyYPlane(vpx_image->planes[VPX_PLANE_Y],\n             vpx_image->stride[VPX_PLANE_Y],\n             vpx_image->d_h,\n             video_frame->get());\n  CopyUPlane(vpx_image->planes[VPX_PLANE_U],\n             vpx_image->stride[VPX_PLANE_U],\n             vpx_image->d_h \/ 2,\n             video_frame->get());\n  CopyVPlane(vpx_image->planes[VPX_PLANE_V],\n             vpx_image->stride[VPX_PLANE_V],\n             vpx_image->d_h \/ 2,\n             video_frame->get());\n  if (!vpx_codec_alpha_)\n    return;\n  if (!vpx_image_alpha) {\n    MakeOpaqueAPlane(\n        vpx_image->stride[VPX_PLANE_Y], vpx_image->d_h, video_frame->get());\n    return;\n  }\n  CopyAPlane(vpx_image_alpha->planes[VPX_PLANE_Y],\n             vpx_image->stride[VPX_PLANE_Y],\n             vpx_image->d_h,\n             video_frame->get());\n}\n\n}  \/\/ namespace media\n<commit_msg>media: Increase max number of decode threads for VP9 decodes at higher resolutions.<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\/filters\/vpx_video_decoder.h\"\n\n#include <algorithm>\n#include <string>\n\n#include \"base\/bind.h\"\n#include \"base\/callback_helpers.h\"\n#include \"base\/command_line.h\"\n#include \"base\/location.h\"\n#include \"base\/logging.h\"\n#include \"base\/message_loop\/message_loop_proxy.h\"\n#include \"base\/strings\/string_number_conversions.h\"\n#include \"base\/sys_byteorder.h\"\n#include \"media\/base\/bind_to_loop.h\"\n#include \"media\/base\/decoder_buffer.h\"\n#include \"media\/base\/demuxer_stream.h\"\n#include \"media\/base\/media_switches.h\"\n#include \"media\/base\/pipeline.h\"\n#include \"media\/base\/video_decoder_config.h\"\n#include \"media\/base\/video_frame.h\"\n#include \"media\/base\/video_util.h\"\n\n\/\/ Include libvpx header files.\n\/\/ VPX_CODEC_DISABLE_COMPAT excludes parts of the libvpx API that provide\n\/\/ backwards compatibility for legacy applications using the library.\n#define VPX_CODEC_DISABLE_COMPAT 1\nextern \"C\" {\n#include \"third_party\/libvpx\/source\/libvpx\/vpx\/vpx_decoder.h\"\n#include \"third_party\/libvpx\/source\/libvpx\/vpx\/vp8dx.h\"\n}\n\nnamespace media {\n\n\/\/ Always try to use three threads for video decoding.  There is little reason\n\/\/ not to since current day CPUs tend to be multi-core and we measured\n\/\/ performance benefits on older machines such as P4s with hyperthreading.\nstatic const int kDecodeThreads = 2;\nstatic const int kMaxDecodeThreads = 16;\n\n\/\/ Returns the number of threads.\nstatic int GetThreadCount(const VideoDecoderConfig& config) {\n  \/\/ Refer to http:\/\/crbug.com\/93932 for tsan suppressions on decoding.\n  int decode_threads = kDecodeThreads;\n\n  const CommandLine* cmd_line = CommandLine::ForCurrentProcess();\n  std::string threads(cmd_line->GetSwitchValueASCII(switches::kVideoThreads));\n  if (threads.empty() || !base::StringToInt(threads, &decode_threads)) {\n    if (config.codec() == kCodecVP9) {\n      \/\/ For VP9 decode when using the default thread count, increase the number\n      \/\/ of decode threads to equal the maximum number of tiles possible for\n      \/\/ higher resolution streams.\n      if (config.coded_size().width() >= 2048)\n        decode_threads = 8;\n      else if (config.coded_size().width() >= 1024)\n        decode_threads = 4;\n    }\n\n    return decode_threads;\n  }\n\n  decode_threads = std::max(decode_threads, 0);\n  decode_threads = std::min(decode_threads, kMaxDecodeThreads);\n  return decode_threads;\n}\n\nVpxVideoDecoder::VpxVideoDecoder(\n    const scoped_refptr<base::MessageLoopProxy>& message_loop)\n    : message_loop_(message_loop),\n      weak_factory_(this),\n      state_(kUninitialized),\n      vpx_codec_(NULL),\n      vpx_codec_alpha_(NULL) {\n}\n\nVpxVideoDecoder::~VpxVideoDecoder() {\n  DCHECK_EQ(kUninitialized, state_);\n  CloseDecoder();\n}\n\nvoid VpxVideoDecoder::Initialize(const VideoDecoderConfig& config,\n                                 const PipelineStatusCB& status_cb) {\n  DCHECK(message_loop_->BelongsToCurrentThread());\n  DCHECK(config.IsValidConfig());\n  DCHECK(!config.is_encrypted());\n  DCHECK(decode_cb_.is_null());\n  DCHECK(reset_cb_.is_null());\n\n  weak_this_ = weak_factory_.GetWeakPtr();\n\n  if (!ConfigureDecoder(config)) {\n    status_cb.Run(DECODER_ERROR_NOT_SUPPORTED);\n    return;\n  }\n\n  \/\/ Success!\n  config_ = config;\n  state_ = kNormal;\n  status_cb.Run(PIPELINE_OK);\n}\n\nstatic vpx_codec_ctx* InitializeVpxContext(vpx_codec_ctx* context,\n                                           const VideoDecoderConfig& config) {\n  context = new vpx_codec_ctx();\n  vpx_codec_dec_cfg_t vpx_config = {0};\n  vpx_config.w = config.coded_size().width();\n  vpx_config.h = config.coded_size().height();\n  vpx_config.threads = GetThreadCount(config);\n\n  vpx_codec_err_t status = vpx_codec_dec_init(context,\n                                              config.codec() == kCodecVP9 ?\n                                                  vpx_codec_vp9_dx() :\n                                                  vpx_codec_vp8_dx(),\n                                              &vpx_config,\n                                              0);\n  if (status != VPX_CODEC_OK) {\n    LOG(ERROR) << \"vpx_codec_dec_init failed, status=\" << status;\n    delete context;\n    return NULL;\n  }\n  return context;\n}\n\nbool VpxVideoDecoder::ConfigureDecoder(const VideoDecoderConfig& config) {\n  const CommandLine* cmd_line = CommandLine::ForCurrentProcess();\n  bool can_handle = false;\n  if (config.codec() == kCodecVP9)\n    can_handle = true;\n  if (!cmd_line->HasSwitch(switches::kDisableVp8AlphaPlayback) &&\n      config.codec() == kCodecVP8 && config.format() == VideoFrame::YV12A) {\n    can_handle = true;\n  }\n  if (!can_handle)\n    return false;\n\n  CloseDecoder();\n\n  vpx_codec_ = InitializeVpxContext(vpx_codec_, config);\n  if (!vpx_codec_)\n    return false;\n\n  if (config.format() == VideoFrame::YV12A) {\n    vpx_codec_alpha_ = InitializeVpxContext(vpx_codec_alpha_, config);\n    if (!vpx_codec_alpha_)\n      return false;\n  }\n\n  return true;\n}\n\nvoid VpxVideoDecoder::CloseDecoder() {\n  if (vpx_codec_) {\n    vpx_codec_destroy(vpx_codec_);\n    delete vpx_codec_;\n    vpx_codec_ = NULL;\n  }\n  if (vpx_codec_alpha_) {\n    vpx_codec_destroy(vpx_codec_alpha_);\n    delete vpx_codec_alpha_;\n    vpx_codec_alpha_ = NULL;\n  }\n}\n\nvoid VpxVideoDecoder::Decode(const scoped_refptr<DecoderBuffer>& buffer,\n                             const DecodeCB& decode_cb) {\n  DCHECK(message_loop_->BelongsToCurrentThread());\n  DCHECK(!decode_cb.is_null());\n  CHECK_NE(state_, kUninitialized);\n  CHECK(decode_cb_.is_null()) << \"Overlapping decodes are not supported.\";\n\n  decode_cb_ = BindToCurrentLoop(decode_cb);\n\n  if (state_ == kError) {\n    base::ResetAndReturn(&decode_cb_).Run(kDecodeError, NULL);\n    return;\n  }\n\n  \/\/ Return empty frames if decoding has finished.\n  if (state_ == kDecodeFinished) {\n    base::ResetAndReturn(&decode_cb_).Run(kOk, VideoFrame::CreateEmptyFrame());\n    return;\n  }\n\n  DecodeBuffer(buffer);\n}\n\nvoid VpxVideoDecoder::Reset(const base::Closure& closure) {\n  DCHECK(message_loop_->BelongsToCurrentThread());\n  DCHECK(reset_cb_.is_null());\n  reset_cb_ = BindToCurrentLoop(closure);\n\n  \/\/ Defer the reset if a decode is pending.\n  if (!decode_cb_.is_null())\n    return;\n\n  DoReset();\n}\n\nvoid VpxVideoDecoder::Stop(const base::Closure& closure) {\n  DCHECK(message_loop_->BelongsToCurrentThread());\n  base::ScopedClosureRunner runner(BindToCurrentLoop(closure));\n\n  if (state_ == kUninitialized)\n    return;\n\n  if (!decode_cb_.is_null()) {\n    base::ResetAndReturn(&decode_cb_).Run(kOk, NULL);\n    \/\/ Reset is pending only when decode is pending.\n    if (!reset_cb_.is_null())\n      base::ResetAndReturn(&reset_cb_).Run();\n  }\n\n  state_ = kUninitialized;\n}\n\nbool VpxVideoDecoder::HasAlpha() const {\n  return vpx_codec_alpha_ != NULL;\n}\n\nvoid VpxVideoDecoder::DecodeBuffer(const scoped_refptr<DecoderBuffer>& buffer) {\n  DCHECK(message_loop_->BelongsToCurrentThread());\n  DCHECK_NE(state_, kUninitialized);\n  DCHECK_NE(state_, kDecodeFinished);\n  DCHECK_NE(state_, kError);\n  DCHECK(reset_cb_.is_null());\n  DCHECK(!decode_cb_.is_null());\n  DCHECK(buffer);\n\n  \/\/ Transition to kDecodeFinished on the first end of stream buffer.\n  if (state_ == kNormal && buffer->end_of_stream()) {\n    state_ = kDecodeFinished;\n    base::ResetAndReturn(&decode_cb_).Run(kOk, VideoFrame::CreateEmptyFrame());\n    return;\n  }\n\n  scoped_refptr<VideoFrame> video_frame;\n  if (!VpxDecode(buffer, &video_frame)) {\n    state_ = kError;\n    base::ResetAndReturn(&decode_cb_).Run(kDecodeError, NULL);\n    return;\n  }\n\n  \/\/ If we didn't get a frame we need more data.\n  if (!video_frame.get()) {\n    base::ResetAndReturn(&decode_cb_).Run(kNotEnoughData, NULL);\n    return;\n  }\n\n  base::ResetAndReturn(&decode_cb_).Run(kOk, video_frame);\n}\n\nbool VpxVideoDecoder::VpxDecode(const scoped_refptr<DecoderBuffer>& buffer,\n                                scoped_refptr<VideoFrame>* video_frame) {\n  DCHECK(video_frame);\n  DCHECK(!buffer->end_of_stream());\n\n  \/\/ Pass |buffer| to libvpx.\n  int64 timestamp = buffer->timestamp().InMicroseconds();\n  void* user_priv = reinterpret_cast<void*>(&timestamp);\n  vpx_codec_err_t status = vpx_codec_decode(vpx_codec_,\n                                            buffer->data(),\n                                            buffer->data_size(),\n                                            user_priv,\n                                            0);\n  if (status != VPX_CODEC_OK) {\n    LOG(ERROR) << \"vpx_codec_decode() failed, status=\" << status;\n    return false;\n  }\n\n  \/\/ Gets pointer to decoded data.\n  vpx_codec_iter_t iter = NULL;\n  const vpx_image_t* vpx_image = vpx_codec_get_frame(vpx_codec_, &iter);\n  if (!vpx_image) {\n    *video_frame = NULL;\n    return true;\n  }\n\n  if (vpx_image->user_priv != reinterpret_cast<void*>(&timestamp)) {\n    LOG(ERROR) << \"Invalid output timestamp.\";\n    return false;\n  }\n\n  const vpx_image_t* vpx_image_alpha = NULL;\n  if (vpx_codec_alpha_ && buffer->side_data_size() >= 8) {\n    \/\/ Pass alpha data to libvpx.\n    int64 timestamp_alpha = buffer->timestamp().InMicroseconds();\n    void* user_priv_alpha = reinterpret_cast<void*>(&timestamp_alpha);\n\n    \/\/ First 8 bytes of side data is side_data_id in big endian.\n    const uint64 side_data_id = base::NetToHost64(\n        *(reinterpret_cast<const uint64*>(buffer->side_data())));\n    if (side_data_id == 1) {\n      status = vpx_codec_decode(vpx_codec_alpha_,\n                                buffer->side_data() + 8,\n                                buffer->side_data_size() - 8,\n                                user_priv_alpha,\n                                0);\n\n      if (status != VPX_CODEC_OK) {\n        LOG(ERROR) << \"vpx_codec_decode() failed on alpha, status=\" << status;\n        return false;\n      }\n\n      \/\/ Gets pointer to decoded data.\n      vpx_codec_iter_t iter_alpha = NULL;\n      vpx_image_alpha = vpx_codec_get_frame(vpx_codec_alpha_, &iter_alpha);\n      if (!vpx_image_alpha) {\n        *video_frame = NULL;\n        return true;\n      }\n\n      if (vpx_image_alpha->user_priv !=\n          reinterpret_cast<void*>(&timestamp_alpha)) {\n        LOG(ERROR) << \"Invalid output timestamp on alpha.\";\n        return false;\n      }\n    }\n  }\n\n  CopyVpxImageTo(vpx_image, vpx_image_alpha, video_frame);\n  (*video_frame)->SetTimestamp(base::TimeDelta::FromMicroseconds(timestamp));\n  return true;\n}\n\nvoid VpxVideoDecoder::DoReset() {\n  DCHECK(decode_cb_.is_null());\n\n  state_ = kNormal;\n  reset_cb_.Run();\n  reset_cb_.Reset();\n}\n\nvoid VpxVideoDecoder::CopyVpxImageTo(const vpx_image* vpx_image,\n                                     const struct vpx_image* vpx_image_alpha,\n                                     scoped_refptr<VideoFrame>* video_frame) {\n  CHECK(vpx_image);\n  CHECK_EQ(vpx_image->d_w % 2, 0U);\n  CHECK_EQ(vpx_image->d_h % 2, 0U);\n  CHECK(vpx_image->fmt == VPX_IMG_FMT_I420 ||\n        vpx_image->fmt == VPX_IMG_FMT_YV12);\n\n  gfx::Size size(vpx_image->d_w, vpx_image->d_h);\n\n  *video_frame = VideoFrame::CreateFrame(\n      vpx_codec_alpha_ ? VideoFrame::YV12A : VideoFrame::YV12,\n      size,\n      gfx::Rect(size),\n      config_.natural_size(),\n      kNoTimestamp());\n\n  CopyYPlane(vpx_image->planes[VPX_PLANE_Y],\n             vpx_image->stride[VPX_PLANE_Y],\n             vpx_image->d_h,\n             video_frame->get());\n  CopyUPlane(vpx_image->planes[VPX_PLANE_U],\n             vpx_image->stride[VPX_PLANE_U],\n             vpx_image->d_h \/ 2,\n             video_frame->get());\n  CopyVPlane(vpx_image->planes[VPX_PLANE_V],\n             vpx_image->stride[VPX_PLANE_V],\n             vpx_image->d_h \/ 2,\n             video_frame->get());\n  if (!vpx_codec_alpha_)\n    return;\n  if (!vpx_image_alpha) {\n    MakeOpaqueAPlane(\n        vpx_image->stride[VPX_PLANE_Y], vpx_image->d_h, video_frame->get());\n    return;\n  }\n  CopyAPlane(vpx_image_alpha->planes[VPX_PLANE_Y],\n             vpx_image->stride[VPX_PLANE_Y],\n             vpx_image->d_h,\n             video_frame->get());\n}\n\n}  \/\/ namespace media\n<|endoftext|>"}
{"text":"<commit_before>#include \"view.h\"\n\n#include <cmath>\n#include <functional>\n\n#include \"util\/tileID.h\"\n#include \"platform.h\"\n#include \"tangram.h\"\n#include \"glm\/gtc\/matrix_transform.hpp\"\n#include \"glm\/gtx\/rotate_vector.hpp\"\n\nconstexpr float View::s_maxZoom; \/\/ Create a stack reference to the static member variable\n\nView::View(int _width, int _height, ProjectionType _projType) {\n    \n    setMapProjection(_projType);\n    setSize(_width, _height);\n    setZoom(m_initZoom); \/\/ Arbitrary zoom for testing\n\n    setPosition(0.0, 0.0);\n    \n    m_changed = false;\n    m_dirty = true;\n    \n}\n\nvoid View::setMapProjection(ProjectionType _projType) {\n    \n    switch(_projType) {\n        case ProjectionType::mercator:\n            m_projection.reset(new MercatorProjection());\n            break;\n        default:\n            logMsg(\"Error: not a valid map projection specified.\\n Setting map projection to mercator by default\");\n            m_projection.reset(new MercatorProjection());\n            break;\n    }\n    \n    m_dirty = true;\n    \n}\n\nconst MapProjection& View::getMapProjection() const {\n    return *m_projection.get();\n}\n\nvoid View::setPixelScale(float _pixelsPerPoint) {\n    \n    m_pixelScale = _pixelsPerPoint;\n    m_dirty = true;\n    \n}\n\nvoid View::setSize(int _width, int _height) {\n\n    m_vpWidth = _width;\n    m_vpHeight = _height;\n    m_aspect = (float)_width \/ (float)_height;\n    m_dirty = true;\n\n}\n\nvoid View::setPosition(double _x, double _y) {\n\n    m_pos.x = _x;\n    m_pos.y = _y;\n    m_dirty = true;\n\n}\n\nvoid View::setZoom(float _z) {\n    \n    \/\/ ensure zoom value is allowed\n    m_zoom = glm::clamp(_z, 0.0f, s_maxZoom);\n    m_dirty = true;\n    \n}\n\nvoid View::setRoll(float _roll) {\n    \n    m_roll = glm::mod(_roll, (float)TWO_PI);\n    m_dirty = true;\n    \n}\n\nvoid View::setPitch(float _pitch) {\n\n    \/\/ Clamp pitch angle (until LoD tile coverage is implemented)\n    m_pitch = glm::clamp(_pitch, 0.f, 1.f);\n    m_dirty = true;\n\n}\n\nvoid View::translate(double _dx, double _dy) {\n\n    setPosition(m_pos.x + _dx, m_pos.y + _dy);\n\n}\n\nvoid View::zoom(float _dz) {\n    if(_dz > 0.0) {\n        m_isZoomIn = true;\n    }\n    else {\n        m_isZoomIn = false;\n    }\n    setZoom(m_zoom + _dz);\n    \n}\n\nvoid View::roll(float _droll) {\n    \n    setRoll(m_roll + _droll);\n    \n}\n\nvoid View::pitch(float _dpitch) {\n\n    setPitch(m_pitch + _dpitch);\n\n}\n\nvoid View::orbit(float _x, float _y, float _radians) {\n    \n    glm::vec2 radial = { _x, _y };\n    glm::vec2 displacement = glm::rotate(radial, _radians) - radial;\n    translate(-displacement.x, -displacement.y);\n    roll(_radians);\n    \n}\n\nvoid View::update() {\n    \n    if (!m_dirty) {\n        m_changed = false;\n        return;\n    }\n    \n    updateMatrices();\n    \n    if (!Tangram::getDebugFlag(Tangram::DebugFlags::FREEZE_TILES)) {\n        \n        updateTiles();\n        \n    }\n    \n    m_changed = true;\n    \n    m_dirty = false;\n    \n}\n\nglm::dmat2 View::getBoundsRect() const {\n\n    double hw = m_width * 0.5;\n    double hh = m_height * 0.5;\n    return glm::dmat2(m_pos.x - hw, m_pos.y - hh, m_pos.x + hw, m_pos.y + hh);\n\n}\n\nvoid View::screenToGroundPlane(float& _screenX, float& _screenY) const {\n    \n    \/\/ Cast a ray and find its intersection with the z = 0 plane,\n    \/\/ following the technique described here: http:\/\/antongerdelan.net\/opengl\/raycasting.html\n    \n    glm::vec4 ray_clip = { 2.f * _screenX \/ m_vpWidth - 1.f, 1.f - 2.f * _screenY \/ m_vpHeight, -1.f, 1.f }; \/\/ Ray from camera in clip space\n    glm::vec3 ray_world = glm::vec3(m_invViewProj * ray_clip); \/\/ Ray from camera in world space\n    \n    float t; \/\/ Distance along ray to ground plane\n    if (ray_world.z != 0.f) {\n        t = std::abs(m_pos.z \/ ray_world.z);\n    } else {\n        t = 0;\n    }\n    \n    ray_world *= t;\n    _screenX = ray_world.x;\n    _screenY = ray_world.y;\n}\n\nconst std::set<TileID>& View::getVisibleTiles() {\n\n    return m_visibleTiles;\n\n}\n\nvoid View::updateMatrices() {\n    \n    \/\/ find dimensions of tiles in world space at new zoom level\n    float worldTileSize = 2 * MapProjection::HALF_CIRCUMFERENCE * pow(2, -m_zoom);\n    \n    \/\/ viewport height in world space is such that each tile is [m_pixelsPerTile] px square in screen space\n    float screenTileSize = m_pixelsPerTile * m_pixelScale;\n    m_height = (float)m_vpHeight * worldTileSize \/ screenTileSize;\n    m_width = m_height * m_aspect;\n    \n    \/\/ set vertical field-of-view\n    float fovy = PI * 0.5;\n    \n    \/\/ we assume portrait orientation by default, so in landscape\n    \/\/ mode we scale the vertical FOV such that the wider dimension\n    \/\/ gets the intended FOV\n    if (m_width > m_height) {\n        fovy \/= m_aspect;\n    }\n    \n    \/\/ set camera z to produce desired viewable area\n    m_pos.z = m_height * 0.5 \/ tan(fovy * 0.5);\n    \n    \/\/ set near and far clipping distances as a function of camera z\n    \/\/ TODO: this is a simple heuristic that deserves more thought\n    float near = m_pos.z \/ 50.0;\n    float far = 3. * m_pos.z \/ cos(m_pitch) + 1.f;\n    \n    glm::vec3 eye = { 0.f, 0.f, 0.f };\n    glm::vec3 at = glm::rotateZ(glm::rotateX(glm::vec3(0.f, 0.f, -1.f), m_pitch), m_roll);\n    glm::vec3 up = glm::rotateZ(glm::rotateX(glm::vec3(0.f, 1.f, 0.f), m_pitch), m_roll);\n    \n    \/\/ update view and projection matrices\n    m_view = glm::lookAt(eye, at, up);\n    m_proj = glm::perspective(fovy, m_aspect, near, far);\n    m_viewProj = m_proj * m_view;\n    m_invViewProj = glm::inverse(m_viewProj);\n    \n}\n\n\/\/ Triangle rasterization adapted from Polymaps: https:\/\/github.com\/simplegeo\/polymaps\/blob\/master\/src\/Layer.js#L333-L383\n\nstruct edge { \/\/ An edge between two points; oriented such that y is non-decreasing\n    double x0 = 0, y0 = 0;\n    double x1 = 0, y1 = 0;\n    double dx = 0, dy = 0;\n    \n    edge(glm::dvec2 _a, glm::dvec2 _b) {\n        if (_a.y > _b.y) { std::swap(_a, _b); }\n        x0 = _a.x;\n        y0 = _a.y;\n        x1 = _b.x;\n        y1 = _b.y;\n        dx = x1 - x0;\n        dy = y1 - y0;\n    }\n};\n\ntypedef std::function<void (int, int)> Scan;\n\nstatic void scanLine(int _x0, int _x1, int _y, Scan _s) {\n    \n    for (int x = _x0; x < _x1; x++) {\n        _s(x, _y);\n    }\n}\n\nstatic void scanSpan(edge _e0, edge _e1, int _yMin, int _yMax, Scan& _s) {\n    \n    \/\/ _e1 has a shorter y-span, so we'll use it to limit our y coverage\n    int y0 = fmax(_yMin, floor(_e1.y0));\n    int y1 = fmin(_yMax, ceil(_e1.y1));\n    \n    \/\/ sort edges by x-coordinate\n    if (_e0.x0 == _e1.x0 && _e0.y0 == _e1.y0) {\n        if (_e0.x0 + _e1.dy \/ _e0.dy * _e0.dx < _e1.x1) { std::swap(_e0, _e1); }\n    } else {\n        if (_e0.x1 - _e1.dy \/ _e0.dy * _e0.dx < _e1.x0) { std::swap(_e0, _e1); }\n    }\n    \n    \/\/ scan lines!\n    double m0 = _e0.dx \/ _e0.dy;\n    double m1 = _e1.dx \/ _e1.dy;\n    double d0 = _e0.dx > 0 ? 1.0 : 0.0;\n    double d1 = _e1.dx < 0 ? 1.0 : 0.0;\n    for (int y = y0; y < y1; y++) {\n        double x0 = m0 * fmax(0.0, fmin(_e0.dy, y + d0 - _e0.y0)) + _e0.x0;\n        double x1 = m1 * fmax(0.0, fmin(_e1.dy, y + d1 - _e1.y0)) + _e1.x0;\n        scanLine(floor(x1), ceil(x0), y, _s);\n    }\n    \n}\n\nstatic void scanTriangle(glm::dvec2& _a, glm::dvec2& _b, glm::dvec2& _c, int _min, int _max, Scan& _s) {\n    \n    edge ab = edge(_a, _b);\n    edge bc = edge(_b, _c);\n    edge ca = edge(_c, _a);\n    \n    \/\/ place edge with greatest y distance in ca\n    if (ab.dy > ca.dy) { std::swap(ab, ca); }\n    if (bc.dy > ca.dy) { std::swap(bc, ca); }\n    \n    \/\/ scan span! scan span!\n    if (ab.dy > 0) { scanSpan(ca, ab, _min, _max, _s); }\n    if (bc.dy > 0) { scanSpan(ca, bc, _min, _max, _s); }\n    \n}\n\nint lodFunc(int d) {\n    return floor(log2f(std::max(d, 1)));\n}\n\nvoid View::updateTiles() {\n    \n    m_visibleTiles.clear();\n    \n    \/\/ Bounds of view trapezoid in world space (i.e. view frustum projected onto z = 0 plane)\n    glm::vec2 viewBL = { 0.f, m_vpHeight };       \/\/ bottom left\n    glm::vec2 viewBR = { m_vpWidth, m_vpHeight }; \/\/ bottom right\n    glm::vec2 viewTR = { m_vpWidth, 0.f };        \/\/ top right\n    glm::vec2 viewTL = { 0.f, 0.f };              \/\/ top left\n    \n    screenToGroundPlane(viewBL.x, viewBL.y);\n    screenToGroundPlane(viewBR.x, viewBR.y);\n    screenToGroundPlane(viewTR.x, viewTR.y);\n    screenToGroundPlane(viewTL.x, viewTL.y);\n    \n    \/\/ Transformation from world space to tile space\n    double hc = MapProjection::HALF_CIRCUMFERENCE;\n    double invTileSize = double(1 << int(m_zoom)) \/ (hc * 2);\n    glm::dvec2 tileSpaceOrigin(-hc, hc);\n    glm::dvec2 tileSpaceAxes(invTileSize, -invTileSize);\n    \n    \/\/ Bounds of view trapezoid in tile space\n    glm::dvec2 a = (glm::dvec2(viewBL.x + m_pos.x, viewBL.y + m_pos.y) - tileSpaceOrigin) * tileSpaceAxes;\n    glm::dvec2 b = (glm::dvec2(viewBR.x + m_pos.x, viewBR.y + m_pos.y) - tileSpaceOrigin) * tileSpaceAxes;\n    glm::dvec2 c = (glm::dvec2(viewTR.x + m_pos.x, viewTR.y + m_pos.y) - tileSpaceOrigin) * tileSpaceAxes;\n    glm::dvec2 d = (glm::dvec2(viewTL.x + m_pos.x, viewTL.y + m_pos.y) - tileSpaceOrigin) * tileSpaceAxes;\n    \n    \/\/ Determine zoom reduction for tiles far from the center of view\n    int maxTileIndex = 1 << int(m_zoom);\n    double tilesAtFullZoom = ceil(std::max(m_width, m_height) * invTileSize * 0.5);\n    double viewCenterX = (m_pos.x + hc) * invTileSize;\n    double viewCenterY = (m_pos.y - hc) * -invTileSize;\n    \n    Scan s = [&](int x, int y) {\n        \n        int z = int(m_zoom);\n        \n        int dx = std::abs(x - viewCenterX) - tilesAtFullZoom;\n        int dy = std::abs(y - viewCenterY) - tilesAtFullZoom;\n\n        int lod_x = lodFunc(dx);\n        int lod_y = lodFunc(dy);\n        \n        if (x % (1 << lod_x) != (x > viewCenterX ? 0 : 1)) {\n            if (lodFunc(dx - 1) < lod_x) {\n                lod_x = std::max(lod_x - 1, 0);\n            }\n        }\n        \n        if (y % (1 << lod_y) != (y > viewCenterY ? 0 : 1)) {\n            if (lodFunc(dy - 1) < lod_y) {\n                lod_y = std::max(lod_y - 1, 0);\n            }\n        }\n        \n        int lod = std::max(lod_x, lod_y);\n        \n        x >>= lod;\n        y >>= lod;\n        z -= lod;\n        \n        m_visibleTiles.emplace(x, y, z);\n        \n    };\n    \n    \/\/ Rasterize view trapezoid into tiles\n    scanTriangle(a, b, c, 0, maxTileIndex, s);\n    scanTriangle(c, d, a, 0, maxTileIndex, s);\n    \n\n}\n<commit_msg>Correct (but verbose) LOD algorithm<commit_after>#include \"view.h\"\n\n#include <cmath>\n#include <functional>\n\n#include \"util\/tileID.h\"\n#include \"platform.h\"\n#include \"tangram.h\"\n#include \"glm\/gtc\/matrix_transform.hpp\"\n#include \"glm\/gtx\/rotate_vector.hpp\"\n\nconstexpr float View::s_maxZoom; \/\/ Create a stack reference to the static member variable\n\nView::View(int _width, int _height, ProjectionType _projType) {\n    \n    setMapProjection(_projType);\n    setSize(_width, _height);\n    setZoom(m_initZoom); \/\/ Arbitrary zoom for testing\n\n    setPosition(0.0, 0.0);\n    \n    m_changed = false;\n    m_dirty = true;\n    \n}\n\nvoid View::setMapProjection(ProjectionType _projType) {\n    \n    switch(_projType) {\n        case ProjectionType::mercator:\n            m_projection.reset(new MercatorProjection());\n            break;\n        default:\n            logMsg(\"Error: not a valid map projection specified.\\n Setting map projection to mercator by default\");\n            m_projection.reset(new MercatorProjection());\n            break;\n    }\n    \n    m_dirty = true;\n    \n}\n\nconst MapProjection& View::getMapProjection() const {\n    return *m_projection.get();\n}\n\nvoid View::setPixelScale(float _pixelsPerPoint) {\n    \n    m_pixelScale = _pixelsPerPoint;\n    m_dirty = true;\n    \n}\n\nvoid View::setSize(int _width, int _height) {\n\n    m_vpWidth = _width;\n    m_vpHeight = _height;\n    m_aspect = (float)_width \/ (float)_height;\n    m_dirty = true;\n\n}\n\nvoid View::setPosition(double _x, double _y) {\n\n    m_pos.x = _x;\n    m_pos.y = _y;\n    m_dirty = true;\n\n}\n\nvoid View::setZoom(float _z) {\n    \n    \/\/ ensure zoom value is allowed\n    m_zoom = glm::clamp(_z, 0.0f, s_maxZoom);\n    m_dirty = true;\n    \n}\n\nvoid View::setRoll(float _roll) {\n    \n    m_roll = glm::mod(_roll, (float)TWO_PI);\n    m_dirty = true;\n    \n}\n\nvoid View::setPitch(float _pitch) {\n\n    \/\/ Clamp pitch angle (until LoD tile coverage is implemented)\n    m_pitch = glm::clamp(_pitch, 0.f, 1.f);\n    m_dirty = true;\n\n}\n\nvoid View::translate(double _dx, double _dy) {\n\n    setPosition(m_pos.x + _dx, m_pos.y + _dy);\n\n}\n\nvoid View::zoom(float _dz) {\n    if(_dz > 0.0) {\n        m_isZoomIn = true;\n    }\n    else {\n        m_isZoomIn = false;\n    }\n    setZoom(m_zoom + _dz);\n    \n}\n\nvoid View::roll(float _droll) {\n    \n    setRoll(m_roll + _droll);\n    \n}\n\nvoid View::pitch(float _dpitch) {\n\n    setPitch(m_pitch + _dpitch);\n\n}\n\nvoid View::orbit(float _x, float _y, float _radians) {\n    \n    glm::vec2 radial = { _x, _y };\n    glm::vec2 displacement = glm::rotate(radial, _radians) - radial;\n    translate(-displacement.x, -displacement.y);\n    roll(_radians);\n    \n}\n\nvoid View::update() {\n    \n    if (!m_dirty) {\n        m_changed = false;\n        return;\n    }\n    \n    updateMatrices();\n    \n    if (!Tangram::getDebugFlag(Tangram::DebugFlags::FREEZE_TILES)) {\n        \n        updateTiles();\n        \n    }\n    \n    m_changed = true;\n    \n    m_dirty = false;\n    \n}\n\nglm::dmat2 View::getBoundsRect() const {\n\n    double hw = m_width * 0.5;\n    double hh = m_height * 0.5;\n    return glm::dmat2(m_pos.x - hw, m_pos.y - hh, m_pos.x + hw, m_pos.y + hh);\n\n}\n\nvoid View::screenToGroundPlane(float& _screenX, float& _screenY) const {\n    \n    \/\/ Cast a ray and find its intersection with the z = 0 plane,\n    \/\/ following the technique described here: http:\/\/antongerdelan.net\/opengl\/raycasting.html\n    \n    glm::vec4 ray_clip = { 2.f * _screenX \/ m_vpWidth - 1.f, 1.f - 2.f * _screenY \/ m_vpHeight, -1.f, 1.f }; \/\/ Ray from camera in clip space\n    glm::vec3 ray_world = glm::vec3(m_invViewProj * ray_clip); \/\/ Ray from camera in world space\n    \n    float t; \/\/ Distance along ray to ground plane\n    if (ray_world.z != 0.f) {\n        t = std::abs(m_pos.z \/ ray_world.z);\n    } else {\n        t = 0;\n    }\n    \n    ray_world *= t;\n    _screenX = ray_world.x;\n    _screenY = ray_world.y;\n}\n\nconst std::set<TileID>& View::getVisibleTiles() {\n\n    return m_visibleTiles;\n\n}\n\nvoid View::updateMatrices() {\n    \n    \/\/ find dimensions of tiles in world space at new zoom level\n    float worldTileSize = 2 * MapProjection::HALF_CIRCUMFERENCE * pow(2, -m_zoom);\n    \n    \/\/ viewport height in world space is such that each tile is [m_pixelsPerTile] px square in screen space\n    float screenTileSize = m_pixelsPerTile * m_pixelScale;\n    m_height = (float)m_vpHeight * worldTileSize \/ screenTileSize;\n    m_width = m_height * m_aspect;\n    \n    \/\/ set vertical field-of-view\n    float fovy = PI * 0.5;\n    \n    \/\/ we assume portrait orientation by default, so in landscape\n    \/\/ mode we scale the vertical FOV such that the wider dimension\n    \/\/ gets the intended FOV\n    if (m_width > m_height) {\n        fovy \/= m_aspect;\n    }\n    \n    \/\/ set camera z to produce desired viewable area\n    m_pos.z = m_height * 0.5 \/ tan(fovy * 0.5);\n    \n    \/\/ set near and far clipping distances as a function of camera z\n    \/\/ TODO: this is a simple heuristic that deserves more thought\n    float near = m_pos.z \/ 50.0;\n    float far = 3. * m_pos.z \/ cos(m_pitch) + 1.f;\n    \n    glm::vec3 eye = { 0.f, 0.f, 0.f };\n    glm::vec3 at = glm::rotateZ(glm::rotateX(glm::vec3(0.f, 0.f, -1.f), m_pitch), m_roll);\n    glm::vec3 up = glm::rotateZ(glm::rotateX(glm::vec3(0.f, 1.f, 0.f), m_pitch), m_roll);\n    \n    \/\/ update view and projection matrices\n    m_view = glm::lookAt(eye, at, up);\n    m_proj = glm::perspective(fovy, m_aspect, near, far);\n    m_viewProj = m_proj * m_view;\n    m_invViewProj = glm::inverse(m_viewProj);\n    \n}\n\n\/\/ Triangle rasterization adapted from Polymaps: https:\/\/github.com\/simplegeo\/polymaps\/blob\/master\/src\/Layer.js#L333-L383\n\nstruct edge { \/\/ An edge between two points; oriented such that y is non-decreasing\n    double x0 = 0, y0 = 0;\n    double x1 = 0, y1 = 0;\n    double dx = 0, dy = 0;\n    \n    edge(glm::dvec2 _a, glm::dvec2 _b) {\n        if (_a.y > _b.y) { std::swap(_a, _b); }\n        x0 = _a.x;\n        y0 = _a.y;\n        x1 = _b.x;\n        y1 = _b.y;\n        dx = x1 - x0;\n        dy = y1 - y0;\n    }\n};\n\ntypedef std::function<void (int, int)> Scan;\n\nstatic void scanLine(int _x0, int _x1, int _y, Scan _s) {\n    \n    for (int x = _x0; x < _x1; x++) {\n        _s(x, _y);\n    }\n}\n\nstatic void scanSpan(edge _e0, edge _e1, int _yMin, int _yMax, Scan& _s) {\n    \n    \/\/ _e1 has a shorter y-span, so we'll use it to limit our y coverage\n    int y0 = fmax(_yMin, floor(_e1.y0));\n    int y1 = fmin(_yMax, ceil(_e1.y1));\n    \n    \/\/ sort edges by x-coordinate\n    if (_e0.x0 == _e1.x0 && _e0.y0 == _e1.y0) {\n        if (_e0.x0 + _e1.dy \/ _e0.dy * _e0.dx < _e1.x1) { std::swap(_e0, _e1); }\n    } else {\n        if (_e0.x1 - _e1.dy \/ _e0.dy * _e0.dx < _e1.x0) { std::swap(_e0, _e1); }\n    }\n    \n    \/\/ scan lines!\n    double m0 = _e0.dx \/ _e0.dy;\n    double m1 = _e1.dx \/ _e1.dy;\n    double d0 = _e0.dx > 0 ? 1.0 : 0.0;\n    double d1 = _e1.dx < 0 ? 1.0 : 0.0;\n    for (int y = y0; y < y1; y++) {\n        double x0 = m0 * fmax(0.0, fmin(_e0.dy, y + d0 - _e0.y0)) + _e0.x0;\n        double x1 = m1 * fmax(0.0, fmin(_e1.dy, y + d1 - _e1.y0)) + _e1.x0;\n        scanLine(floor(x1), ceil(x0), y, _s);\n    }\n    \n}\n\nstatic void scanTriangle(glm::dvec2& _a, glm::dvec2& _b, glm::dvec2& _c, int _min, int _max, Scan& _s) {\n    \n    edge ab = edge(_a, _b);\n    edge bc = edge(_b, _c);\n    edge ca = edge(_c, _a);\n    \n    \/\/ place edge with greatest y distance in ca\n    if (ab.dy > ca.dy) { std::swap(ab, ca); }\n    if (bc.dy > ca.dy) { std::swap(bc, ca); }\n    \n    \/\/ scan span! scan span!\n    if (ab.dy > 0) { scanSpan(ca, ab, _min, _max, _s); }\n    if (bc.dy > 0) { scanSpan(ca, bc, _min, _max, _s); }\n    \n}\n\nint lodFunc(int d) {\n    return floor(log2f(std::max(d, 1)));\n}\n\ndouble invLodFunc(double d) {\n    return exp2(d);\n}\n\nint odd_ceil(double i) {\n    return (int(i) % 2 == 0) ? (i + 1) : i;\n}\n\nint next_even(int i) {\n    return (i % 2 == 0) ? (i + 2) : (i + 1);\n}\n\nint prev_even(int i) {\n    return (i % 2 == 0) ? (i - 2) : (i - 1);\n}\n\nvoid View::updateTiles() {\n    \n    m_visibleTiles.clear();\n    \n    \/\/ Bounds of view trapezoid in world space (i.e. view frustum projected onto z = 0 plane)\n    glm::vec2 viewBL = { 0.f, m_vpHeight };       \/\/ bottom left\n    glm::vec2 viewBR = { m_vpWidth, m_vpHeight }; \/\/ bottom right\n    glm::vec2 viewTR = { m_vpWidth, 0.f };        \/\/ top right\n    glm::vec2 viewTL = { 0.f, 0.f };              \/\/ top left\n    \n    screenToGroundPlane(viewBL.x, viewBL.y);\n    screenToGroundPlane(viewBR.x, viewBR.y);\n    screenToGroundPlane(viewTR.x, viewTR.y);\n    screenToGroundPlane(viewTL.x, viewTL.y);\n    \n    \/\/ Transformation from world space to tile space\n    double hc = MapProjection::HALF_CIRCUMFERENCE;\n    double invTileSize = double(1 << int(m_zoom)) \/ (hc * 2);\n    glm::dvec2 tileSpaceOrigin(-hc, hc);\n    glm::dvec2 tileSpaceAxes(invTileSize, -invTileSize);\n    \n    \/\/ Bounds of view trapezoid in tile space\n    glm::dvec2 a = (glm::dvec2(viewBL.x + m_pos.x, viewBL.y + m_pos.y) - tileSpaceOrigin) * tileSpaceAxes;\n    glm::dvec2 b = (glm::dvec2(viewBR.x + m_pos.x, viewBR.y + m_pos.y) - tileSpaceOrigin) * tileSpaceAxes;\n    glm::dvec2 c = (glm::dvec2(viewTR.x + m_pos.x, viewTR.y + m_pos.y) - tileSpaceOrigin) * tileSpaceAxes;\n    glm::dvec2 d = (glm::dvec2(viewTL.x + m_pos.x, viewTL.y + m_pos.y) - tileSpaceOrigin) * tileSpaceAxes;\n    \n    \/\/ Determine zoom reduction for tiles far from the center of view\n    \/\/double tilesAtFullZoom = 0; \/\/ceil(std::max(m_width, m_height) * invTileSize * 0.5);\n    double viewCenterX = (m_pos.x + hc) * invTileSize;\n    double viewCenterY = (m_pos.y - hc) * -invTileSize;\n    \n    int x_l_pos[4] = { 0 };\n    int x_l_neg[4] = { 0 };\n    int y_l_neg[4] = { 0 };\n    int y_l_pos[4] = { 0 };\n    \n    for (int i = 0; i < 4; i++) {\n        x_l_pos[i] = (next_even(int(viewCenterX + invLodFunc(i)) >> i)) << i;\n    }\n    \n    for (int i = 0; i < 4; i++) {\n        x_l_neg[i] = (prev_even(int(viewCenterX - invLodFunc(i)) >> i)) << i;\n    }\n    \n    for (int i = 0; i < 4; i++) {\n        y_l_pos[i] = (next_even(int(viewCenterY + invLodFunc(i)) >> i)) << i;\n    }\n    \n    for (int i = 0; i < 4; i++) {\n        y_l_neg[i] = (prev_even(int(viewCenterY - invLodFunc(i)) >> i)) << i;\n    }\n    \n    Scan s = [&](int x, int y) {\n        \n        int z = int(m_zoom);\n\n        int lod = 0;\n        while (lod < 4 && x_l_pos[lod] <= x) { lod++; }\n        while (lod < 4 && x_l_neg[lod] > x) { lod++; }\n        while (lod < 4 && y_l_pos[lod] <= y) { lod++; }\n        while (lod < 4 && y_l_neg[lod] > y) { lod++; }\n        \n        if (x > x_l_pos[3] || x < x_l_neg[3] || y > y_l_pos[3] || y < y_l_neg[3]) {\n            return;\n        }\n        \n        x >>= lod;\n        y >>= lod;\n        z -= lod;\n        \n        m_visibleTiles.emplace(x, y, z);\n        \n    };\n    \n    \/\/ Rasterize view trapezoid into tiles\n    int maxTileIndex = 1 << int(m_zoom);\n    scanTriangle(a, b, c, 0, maxTileIndex, s);\n    scanTriangle(c, d, a, 0, maxTileIndex, s);\n    \n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2017 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\/gm.h\"\n#include \"include\/core\/SkCanvas.h\"\n#include \"include\/core\/SkColor.h\"\n#include \"include\/core\/SkColorFilter.h\"\n#include \"include\/core\/SkFont.h\"\n#include \"include\/core\/SkFontTypes.h\"\n#include \"include\/core\/SkPaint.h\"\n#include \"include\/core\/SkPoint.h\"\n#include \"include\/core\/SkRect.h\"\n#include \"include\/core\/SkRefCnt.h\"\n#include \"include\/core\/SkScalar.h\"\n#include \"include\/core\/SkShader.h\"\n#include \"include\/core\/SkSize.h\"\n#include \"include\/core\/SkString.h\"\n#include \"include\/core\/SkTileMode.h\"\n#include \"include\/core\/SkTypeface.h\"\n#include \"include\/core\/SkTypes.h\"\n#include \"include\/effects\/SkGradientShader.h\"\n#include \"include\/effects\/SkHighContrastFilter.h\"\n#include \"tools\/ToolUtils.h\"\n\n#include <stdio.h>\n#include <string.h>\n\nusing InvertStyle = SkHighContrastConfig::InvertStyle;\n\nstatic SkScalar kSize   = 200;\nstatic SkColor  kColor1 = SkColorSetARGB(0xff, 0xff, 0xff, 0);\nstatic SkColor  kColor2 = SkColorSetARGB(0xff, 0x82, 0xff, 0);\n\nstatic void draw_label(SkCanvas* canvas, const SkHighContrastConfig& config) {\n    char labelBuffer[256];\n    const char* invertStr =\n        (config.fInvertStyle == InvertStyle::kInvertBrightness ?\n             \"InvBrightness\" :\n            (config.fInvertStyle == InvertStyle::kInvertLightness ?\n                 \"InvLightness\" : \"NoInvert\"));\n\n    snprintf(labelBuffer, sizeof(labelBuffer), \"%s%s contrast=%.1f\",\n             config.fGrayscale ? \"Gray \" : \"\",\n             invertStr,\n             config.fContrast);\n\n    SkFont font;\n    font.setTypeface(ToolUtils::create_portable_typeface());\n    font.setSize(0.05f);\n    font.setEdging(SkFont::Edging::kAlias);\n\n    size_t len = strlen(labelBuffer);\n\n    SkScalar width = font.measureText(labelBuffer, len, SkTextEncoding::kUTF8);\n    canvas->drawSimpleText(labelBuffer, len, SkTextEncoding::kUTF8, 0.5f - width \/ 2, 0.16f, font, SkPaint());\n}\n\nstatic void draw_scene(SkCanvas* canvas, const SkHighContrastConfig& config) {\n    SkRect bounds = SkRect::MakeLTRB(0.0f, 0.0f, 1.0f, 1.0f);\n    SkPaint xferPaint;\n    xferPaint.setColorFilter(SkHighContrastFilter::Make(config));\n    canvas->saveLayer(&bounds, &xferPaint);\n\n    SkPaint paint;\n    bounds = SkRect::MakeLTRB(0.1f, 0.2f, 0.9f, 0.4f);\n    paint.setARGB(0xff, 0x66, 0x11, 0x11);\n    canvas->drawRect(bounds, paint);\n\n    SkFont font;\n    font.setSize(0.15f);\n    font.setEdging(SkFont::Edging::kAlias);\n\n    paint.setARGB(0xff, 0xbb, 0x77, 0x77);\n    canvas->drawString(\"A\", 0.15f, 0.35f, font, paint);\n\n    bounds = SkRect::MakeLTRB(0.1f, 0.8f, 0.9f, 1.0f);\n    paint.setARGB(0xff, 0xcc, 0xcc, 0xff);\n    canvas->drawRect(bounds, paint);\n\n    paint.setARGB(0xff, 0x88, 0x88, 0xbb);\n    canvas->drawString(\"Z\", 0.75f, 0.95f, font, paint);\n\n    bounds = SkRect::MakeLTRB(0.1f, 0.4f, 0.9f, 0.6f);\n    SkPoint     pts[] = { { 0, 0 }, { 1, 0 } };\n    SkColor     colors[] = { SK_ColorWHITE, SK_ColorBLACK };\n    SkScalar    pos[] = { 0.2f, 0.8f };\n    paint.setShader(SkGradientShader::MakeLinear(\n        pts, colors, pos,\n        SK_ARRAY_COUNT(colors), SkTileMode::kClamp));\n    canvas->drawRect(bounds, paint);\n\n    bounds = SkRect::MakeLTRB(0.1f, 0.6f, 0.9f, 0.8f);\n    SkColor colors2[] = { SK_ColorGREEN, SK_ColorWHITE };\n    paint.setShader(SkGradientShader::MakeLinear(\n        pts, colors2, pos,\n        SK_ARRAY_COUNT(colors2), SkTileMode::kClamp));\n    canvas->drawRect(bounds, paint);\n\n    canvas->restore();\n}\n\nclass HighContrastFilterGM : public skiagm::GM {\npublic:\n    HighContrastFilterGM() {\n        SkColor  g1Colors[] = { kColor1, SkColorSetA(kColor1, 0x20) };\n        SkColor  g2Colors[] = { kColor2, SkColorSetA(kColor2, 0x20) };\n        SkPoint  g1Points[] = { { 0, 0 }, { 0,     100 } };\n        SkPoint  g2Points[] = { { 0, 0 }, { kSize, 0   } };\n        SkScalar pos[] = { 0.2f, 1.0f };\n\n        SkHighContrastConfig fConfig;\n        fFilter = SkHighContrastFilter::Make(fConfig);\n        fGr1 = SkGradientShader::MakeLinear(\n            g1Points, g1Colors, pos, SK_ARRAY_COUNT(g1Colors),\n            SkTileMode::kClamp);\n        fGr2 = SkGradientShader::MakeLinear(\n            g2Points, g2Colors, pos, SK_ARRAY_COUNT(g2Colors),\n            SkTileMode::kClamp);\n    }\n\nprotected:\n\n    SkString onShortName() override {\n        return SkString(\"highcontrastfilter\");\n    }\n\n    SkISize onISize() override {\n        return SkISize::Make(600, 420);\n    }\n\n    void onDraw(SkCanvas* canvas) override {\n        SkHighContrastConfig configs[] = {\n            { false, InvertStyle::kNoInvert, 0.0f },\n            { false, InvertStyle::kInvertBrightness, 0.0f },\n            { false, InvertStyle::kInvertLightness, 0.0f },\n            { false, InvertStyle::kInvertLightness, 0.2f },\n            { true, InvertStyle::kNoInvert, 0.0f },\n            { true, InvertStyle::kInvertBrightness, 0.0f },\n            { true, InvertStyle::kInvertLightness, 0.0f },\n            { true, InvertStyle::kInvertLightness, 0.2f },\n        };\n\n        for (size_t i = 0; i < SK_ARRAY_COUNT(configs); ++i) {\n            SkScalar x = kSize * (i % 4);\n            SkScalar y = kSize * (i \/ 4);\n            canvas->save();\n            canvas->translate(x, y);\n            canvas->scale(kSize, kSize);\n            draw_scene(canvas, configs[i]);\n            draw_label(canvas, configs[i]);\n            canvas->restore();\n        }\n    }\n\nprivate:\n    sk_sp<SkColorFilter>    fFilter;\n    sk_sp<SkShader>         fGr1, fGr2;\n\n    typedef skiagm::GM INHERITED;\n};\n\nDEF_GM(return new HighContrastFilterGM;)\n<commit_msg>Include all tests, enlarge labels<commit_after>\/*\n * Copyright 2017 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\/gm.h\"\n#include \"include\/core\/SkCanvas.h\"\n#include \"include\/core\/SkColor.h\"\n#include \"include\/core\/SkColorFilter.h\"\n#include \"include\/core\/SkFont.h\"\n#include \"include\/core\/SkFontTypes.h\"\n#include \"include\/core\/SkPaint.h\"\n#include \"include\/core\/SkPoint.h\"\n#include \"include\/core\/SkRect.h\"\n#include \"include\/core\/SkRefCnt.h\"\n#include \"include\/core\/SkScalar.h\"\n#include \"include\/core\/SkShader.h\"\n#include \"include\/core\/SkSize.h\"\n#include \"include\/core\/SkString.h\"\n#include \"include\/core\/SkTileMode.h\"\n#include \"include\/core\/SkTypeface.h\"\n#include \"include\/core\/SkTypes.h\"\n#include \"include\/effects\/SkGradientShader.h\"\n#include \"include\/effects\/SkHighContrastFilter.h\"\n#include \"tools\/ToolUtils.h\"\n\n#include <stdio.h>\n#include <string.h>\n\nusing InvertStyle = SkHighContrastConfig::InvertStyle;\n\nstatic SkScalar kSize   = 200;\nstatic SkColor  kColor1 = SkColorSetARGB(0xff, 0xff, 0xff, 0);\nstatic SkColor  kColor2 = SkColorSetARGB(0xff, 0x82, 0xff, 0);\n\nstatic void draw_label(SkCanvas* canvas, const SkHighContrastConfig& config) {\n    char labelBuffer[256];\n    const char* invertStr =\n        (config.fInvertStyle == InvertStyle::kInvertBrightness ?\n             \"InvBright\" :\n            (config.fInvertStyle == InvertStyle::kInvertLightness ?\n                 \"InvLight\" : \"NoInvert\"));\n\n    snprintf(labelBuffer, sizeof(labelBuffer), \"%s%s contrast=%.1f\",\n             config.fGrayscale ? \"Gray \" : \"\",\n             invertStr,\n             config.fContrast);\n\n    SkFont font;\n    font.setTypeface(ToolUtils::create_portable_typeface());\n    font.setSize(0.075f);\n    font.setEdging(SkFont::Edging::kAntiAlias);\n\n    size_t len = strlen(labelBuffer);\n\n    SkScalar width = font.measureText(labelBuffer, len, SkTextEncoding::kUTF8);\n    canvas->drawSimpleText(labelBuffer, len, SkTextEncoding::kUTF8, 0.5f - width \/ 2, 0.16f, font, SkPaint());\n}\n\nstatic void draw_scene(SkCanvas* canvas, const SkHighContrastConfig& config) {\n    SkRect bounds = SkRect::MakeLTRB(0.0f, 0.0f, 1.0f, 1.0f);\n    SkPaint xferPaint;\n    xferPaint.setColorFilter(SkHighContrastFilter::Make(config));\n    canvas->saveLayer(&bounds, &xferPaint);\n\n    SkPaint paint;\n    bounds = SkRect::MakeLTRB(0.1f, 0.2f, 0.9f, 0.4f);\n    paint.setARGB(0xff, 0x66, 0x11, 0x11);\n    canvas->drawRect(bounds, paint);\n\n    SkFont font;\n    font.setSize(0.15f);\n    font.setEdging(SkFont::Edging::kAlias);\n\n    paint.setARGB(0xff, 0xbb, 0x77, 0x77);\n    canvas->drawString(\"A\", 0.15f, 0.35f, font, paint);\n\n    bounds = SkRect::MakeLTRB(0.1f, 0.8f, 0.9f, 1.0f);\n    paint.setARGB(0xff, 0xcc, 0xcc, 0xff);\n    canvas->drawRect(bounds, paint);\n\n    paint.setARGB(0xff, 0x88, 0x88, 0xbb);\n    canvas->drawString(\"Z\", 0.75f, 0.95f, font, paint);\n\n    bounds = SkRect::MakeLTRB(0.1f, 0.4f, 0.9f, 0.6f);\n    SkPoint     pts[] = { { 0, 0 }, { 1, 0 } };\n    SkColor     colors[] = { SK_ColorWHITE, SK_ColorBLACK };\n    SkScalar    pos[] = { 0.2f, 0.8f };\n    paint.setShader(SkGradientShader::MakeLinear(\n        pts, colors, pos,\n        SK_ARRAY_COUNT(colors), SkTileMode::kClamp));\n    canvas->drawRect(bounds, paint);\n\n    bounds = SkRect::MakeLTRB(0.1f, 0.6f, 0.9f, 0.8f);\n    SkColor colors2[] = { SK_ColorGREEN, SK_ColorWHITE };\n    paint.setShader(SkGradientShader::MakeLinear(\n        pts, colors2, pos,\n        SK_ARRAY_COUNT(colors2), SkTileMode::kClamp));\n    canvas->drawRect(bounds, paint);\n\n    canvas->restore();\n}\n\nclass HighContrastFilterGM : public skiagm::GM {\npublic:\n    HighContrastFilterGM() {\n        SkColor  g1Colors[] = { kColor1, SkColorSetA(kColor1, 0x20) };\n        SkColor  g2Colors[] = { kColor2, SkColorSetA(kColor2, 0x20) };\n        SkPoint  g1Points[] = { { 0, 0 }, { 0,     100 } };\n        SkPoint  g2Points[] = { { 0, 0 }, { kSize, 0   } };\n        SkScalar pos[] = { 0.2f, 1.0f };\n\n        SkHighContrastConfig fConfig;\n        fFilter = SkHighContrastFilter::Make(fConfig);\n        fGr1 = SkGradientShader::MakeLinear(\n            g1Points, g1Colors, pos, SK_ARRAY_COUNT(g1Colors),\n            SkTileMode::kClamp);\n        fGr2 = SkGradientShader::MakeLinear(\n            g2Points, g2Colors, pos, SK_ARRAY_COUNT(g2Colors),\n            SkTileMode::kClamp);\n    }\n\nprotected:\n\n    SkString onShortName() override {\n        return SkString(\"highcontrastfilter\");\n    }\n\n    SkISize onISize() override {\n        return SkISize::Make(800, 420);\n    }\n\n    void onDraw(SkCanvas* canvas) override {\n        SkHighContrastConfig configs[] = {\n            { false, InvertStyle::kNoInvert, 0.0f },\n            { false, InvertStyle::kInvertBrightness, 0.0f },\n            { false, InvertStyle::kInvertLightness, 0.0f },\n            { false, InvertStyle::kInvertLightness, 0.2f },\n            { true, InvertStyle::kNoInvert, 0.0f },\n            { true, InvertStyle::kInvertBrightness, 0.0f },\n            { true, InvertStyle::kInvertLightness, 0.0f },\n            { true, InvertStyle::kInvertLightness, 0.2f },\n        };\n\n        for (size_t i = 0; i < SK_ARRAY_COUNT(configs); ++i) {\n            SkScalar x = kSize * (i % 4);\n            SkScalar y = kSize * (i \/ 4);\n            canvas->save();\n            canvas->translate(x, y);\n            canvas->scale(kSize, kSize);\n            draw_scene(canvas, configs[i]);\n            draw_label(canvas, configs[i]);\n            canvas->restore();\n        }\n    }\n\nprivate:\n    sk_sp<SkColorFilter>    fFilter;\n    sk_sp<SkShader>         fGr1, fGr2;\n\n    typedef skiagm::GM INHERITED;\n};\n\nDEF_GM(return new HighContrastFilterGM;)\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: implbase.hxx,v $\n *\n *  $Revision: 1.12 $\n *\n *  last change: $Author: hjs $ $Date: 2004-06-25 17:34:29 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef _CPPUHELPER_IMPLBASE_HXX_\n#define _CPPUHELPER_IMPLBASE_HXX_\n\n#ifndef _OSL_MUTEX_HXX_\n#include <osl\/mutex.hxx>\n#endif\n#ifndef _CPPUHELPER_WEAK_HXX_\n#include <cppuhelper\/weak.hxx>\n#endif\n#ifndef _CPPUHELPER_WEAKAGG_HXX_\n#include <cppuhelper\/weakagg.hxx>\n#endif\n#ifndef INCLUDED_RTL_INSTANCE_HXX\n#include <rtl\/instance.hxx>\n#endif\n\n#include <com\/sun\/star\/lang\/XTypeProvider.hpp>\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n\n\/* This header should not be used anymore.\n   @deprecated\n*\/\n\nnamespace cppu\n{\n\n\/** Struct used for inline template implementation helpers: type entries.\n    Not for plublic use.\n    @internal\n*\/\nstruct Type_Offset\n{\n    \/** binary offset of vtable pointer from object base\n    *\/\n    sal_Int32 nOffset;\n    \/** interface type description of interface entry\n    *\/\n    typelib_InterfaceTypeDescription * pTD;\n};\n\/** Struct used for inline template implementation helpers: class data of implementation.\n    Not for plublic use.\n    @internal\n*\/\nstruct ClassDataBase\n{\n    \/** determines whether the class data has been statically initialized\n    *\/\n    sal_Bool  bOffsetsInit;\n    \/** length of static array ClassDataN\n    *\/\n    sal_Int32 nType2Offset;\n\n    \/** class code determines which standard types are supported (and returned on\n        com.sun.star.lang.XTypeProvider::getTypes()) by the helper:\n\n        - 1 -- com.sun.star.uno.XWeak\n        - 2 -- com.sun.star.uno.XWeak, com.sun.star.uno.XAggregation\n        - 3 -- com.sun.star.uno.XWeak, com.sun.star.uno.XAggregation, com.sun.star.lang.XComponent\n        - 4 -- com.sun.star.uno.XWeak, com.sun.star.lang.XComponent\n    *\/\n    sal_Int32 nClassCode;\n\n    \/** pointer to types sequence (com.sun.star.lang.XTypeProvider)\n    *\/\n    ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > * pTypes;\n    \/** pointer to class id (com.sun.star.lang.XTypeProvider)\n    *\/\n    ::com::sun::star::uno::Sequence< sal_Int8 > * pId;\n\n    \/** def ctor\n    *\/\n    ClassDataBase() SAL_THROW( () );\n    \/** class code ctor\n\n        @param nClassCode class code, see ClassDataBase::nClassCode\n    *\/\n    ClassDataBase( sal_Int32 nClassCode ) SAL_THROW( () );\n    \/** dtor\n    *\/\n    ~ClassDataBase() SAL_THROW( () );\n};\n\/** Struct used for inline template implementation helpers:\n    There will be versions of this struct with varying arType2Offset[] array sizes, each of which\n    is binary compatible with this one to be casted and used uniform. The size of the varying array\n    is set in ClassDataBase::nType2Offset (base class).\n    Not for plublic use.\n    @internal\n*\/\nstruct ClassData : public ClassDataBase\n{\n    \/** type entries array\n    *\/\n    Type_Offset arType2Offset[1];\n\n    \/** init call for supporting com.sun.star.lang.XTypeProvider\n    *\/\n    void SAL_CALL initTypeProvider() SAL_THROW( () );\n    \/** initial writing type offsets for vtables\n\n        @param rType type of interface\n        @param nOffset offset to vtable entry\n    *\/\n    void SAL_CALL writeTypeOffset( const ::com::sun::star::uno::Type & rType, sal_Int32 nOffset )\n        SAL_THROW( () );\n\n    \/** Queries for an interface.\n\n        @param rType demanded interface type\n        @pBase base this pointer related when writing type offsets (writeTypeOffset())\n        @return demanded interface or empty any\n    *\/\n    ::com::sun::star::uno::Any SAL_CALL query(\n        const ::com::sun::star::uno::Type & rType, ::com::sun::star::lang::XTypeProvider * pBase )\n        SAL_THROW( () );\n    \/** Gets the types for supporting com.sun.star.lang.XTypeProvider\n\n        @return sequence of types supported\n    *\/\n    ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > SAL_CALL getTypes()\n        SAL_THROW( () );\n    \/** Gets the class id of implemtation supporting com.sun.star.lang.XTypeProvider\n\n        @return class identifier (sequence< byte >)\n    *\/\n    ::com::sun::star::uno::Sequence< sal_Int8 > SAL_CALL getImplementationId()\n        SAL_THROW( () );\n};\n\n\/** Shared mutex for implementation helper initialization.\n    Not for public use.\n    @internal\n*\/\n::osl::Mutex & SAL_CALL getImplHelperInitMutex(void) SAL_THROW( () );\n}\n\n\/\/\n\/\/ settle down beavis, here comes the macro template hell :]\n\/\/\n\n\/\/==================================================================================================\n\n\/** Implementation helper macros\n    Not for common use. There are expanded forms of the macro usage in implbaseN.hxx\/compbaseN.hxx.\n    So there is commonly no need to use these macros. Though, you may need to implement more than\n    12 interfaces. Then you have to declare something like the following in your headers\n    (where N is your demanded number of interfaces):\n\n    #define __IFC3 Ifc1, Ifc2, Ifc3, ... up to N\n    #define __CLASS_IFC3 class Ifc1, class Ifc2, class Ifc3, ... up to N\n    #define __PUBLIC_IFC3 public Ifc1, public Ifc2, public Ifc3, ... up to N\n    __DEF_IMPLHELPER_PRE( N )\n    __IFC_WRITEOFFSET( 1 ) __IFC_WRITEOFFSET( 2 ) __IFC_WRITEOFFSET( 3 ), ... up to N\n    __DEF_IMPLHELPER_POST( N )\n\n    @internal\n*\/\n#define __DEF_IMPLHELPER_PRE( N ) \\\nnamespace cppu \\\n{ \\\nstruct ClassData##N : public ClassDataBase \\\n{ \\\n    Type_Offset arType2Offset[ N ]; \\\n    ClassData##N( sal_Int32 nClassCode ) SAL_THROW( () ) \\\n        : ClassDataBase( nClassCode ) \\\n        {} \\\n}; \\\ntemplate< __CLASS_IFC##N > \\\nclass SAL_NO_VTABLE ImplHelperBase##N \\\n    : public ::com::sun::star::lang::XTypeProvider \\\n    , __PUBLIC_IFC##N \\\n{ \\\nprotected: \\\n    ClassData & SAL_CALL getClassData( ClassDataBase & s_aCD ) SAL_THROW( () ) \\\n    { \\\n        ClassData & rCD = * static_cast< ClassData * >( &s_aCD ); \\\n        if (! rCD.bOffsetsInit) \\\n        { \\\n            ::osl::MutexGuard aGuard( getImplHelperInitMutex() ); \\\n            if (! rCD.bOffsetsInit) \\\n            { \\\n                char * pBase = (char *)this;\n\/** Implementation helper macro: have a look at __DEF_IMPLHELPER_PRE\n    @internal\n*\/\n#define __IFC_WRITEOFFSET( N ) \\\n                rCD.writeTypeOffset( ::getCppuType( (const ::com::sun::star::uno::Reference< Ifc##N > *)0 ), \\\n                                     (char *)(Ifc##N *)this - pBase );\n\/** Implementation helper macro: have a look at __DEF_IMPLHELPER_PRE\n    @internal\n*\/\n#define __DEF_IMPLHELPER_POST_A( N ) \\\n                rCD.bOffsetsInit = sal_True; \\\n            } \\\n        } \\\n        return rCD; \\\n    } \\\n}; \\\ntemplate< __CLASS_IFC##N > \\\nclass SAL_NO_VTABLE ImplHelper##N \\\n    : public ImplHelperBase##N< __IFC##N > \\\n{ \\\n    static ClassData##N s_aCD; \\\npublic: \\\n    virtual ::com::sun::star::uno::Any SAL_CALL queryInterface( const ::com::sun::star::uno::Type & rType ) throw (::com::sun::star::uno::RuntimeException) \\\n        { return getClassData( s_aCD ).query( rType, (ImplHelperBase##N< __IFC##N > *)this ); } \\\n    virtual ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > SAL_CALL getTypes() throw (::com::sun::star::uno::RuntimeException) \\\n        { return getClassData( s_aCD ).getTypes(); } \\\n    virtual ::com::sun::star::uno::Sequence< sal_Int8 > SAL_CALL getImplementationId() throw (::com::sun::star::uno::RuntimeException) \\\n        { return getClassData( s_aCD ).getImplementationId(); } \\\n}; \\\ntemplate< __CLASS_IFC##N > \\\nclass SAL_NO_VTABLE WeakImplHelper##N \\\n    : public ::cppu::OWeakObject \\\n    , public ImplHelperBase##N< __IFC##N > \\\n{ \\\n    static ClassData##N s_aCD; \\\npublic: \\\n    virtual ::com::sun::star::uno::Any SAL_CALL queryInterface( const ::com::sun::star::uno::Type & rType ) throw (::com::sun::star::uno::RuntimeException) \\\n    { \\\n        ::com::sun::star::uno::Any aRet( getClassData( s_aCD ).query( rType, (ImplHelperBase##N< __IFC##N > *)this ) ); \\\n        return (aRet.hasValue() ? aRet : OWeakObject::queryInterface( rType )); \\\n    } \\\n    virtual void SAL_CALL acquire() throw () \\\n        { OWeakObject::acquire(); } \\\n    virtual void SAL_CALL release() throw () \\\n        { OWeakObject::release(); } \\\n    virtual ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > SAL_CALL getTypes() throw (::com::sun::star::uno::RuntimeException) \\\n        { return getClassData( s_aCD ).getTypes(); } \\\n    virtual ::com::sun::star::uno::Sequence< sal_Int8 > SAL_CALL getImplementationId() throw (::com::sun::star::uno::RuntimeException) \\\n        { return getClassData( s_aCD ).getImplementationId(); } \\\n}; \\\ntemplate< __CLASS_IFC##N > \\\nclass SAL_NO_VTABLE WeakAggImplHelper##N \\\n    : public ::cppu::OWeakAggObject \\\n    , public ImplHelperBase##N< __IFC##N > \\\n{ \\\n    static ClassData##N s_aCD; \\\npublic: \\\n    virtual ::com::sun::star::uno::Any SAL_CALL queryInterface( const ::com::sun::star::uno::Type & rType ) throw (::com::sun::star::uno::RuntimeException) \\\n        { return OWeakAggObject::queryInterface( rType ); } \\\n    virtual ::com::sun::star::uno::Any SAL_CALL queryAggregation( const ::com::sun::star::uno::Type & rType ) throw (::com::sun::star::uno::RuntimeException) \\\n    { \\\n        ::com::sun::star::uno::Any aRet( getClassData( s_aCD ).query( rType, (ImplHelperBase##N< __IFC##N > *)this ) ); \\\n        return (aRet.hasValue() ? aRet : OWeakAggObject::queryAggregation( rType )); \\\n    } \\\n    virtual void SAL_CALL acquire() throw () \\\n        { OWeakAggObject::acquire(); } \\\n    virtual void SAL_CALL release() throw () \\\n        { OWeakAggObject::release(); } \\\n    virtual ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > SAL_CALL getTypes() throw (::com::sun::star::uno::RuntimeException) \\\n        { return getClassData( s_aCD ).getTypes(); } \\\n    virtual ::com::sun::star::uno::Sequence< sal_Int8 > SAL_CALL getImplementationId() throw (::com::sun::star::uno::RuntimeException) \\\n        { return getClassData( s_aCD ).getImplementationId(); } \\\n};\n\n\/** Implementation helper macro: have a look at __DEF_IMPLHELPER_PRE\n    @internal\n*\/\n#define __DEF_IMPLHELPER_POST_B( N ) \\\ntemplate< __CLASS_IFC##N > \\\nClassData##N ImplHelper##N< __IFC##N >::s_aCD = ClassData##N( 0 ); \\\ntemplate< __CLASS_IFC##N > \\\nClassData##N WeakImplHelper##N< __IFC##N >::s_aCD = ClassData##N( 1 ); \\\ntemplate< __CLASS_IFC##N > \\\nClassData##N WeakAggImplHelper##N< __IFC##N >::s_aCD = ClassData##N( 2 );\n\/** Implementation helper macro: have a look at __DEF_IMPLHELPER_PRE\n    @internal\n*\/\n#define __DEF_IMPLHELPER_POST_C( N ) \\\n}\n\/\/==================================================================================================\n\/** Implementation helper macro: have a look at __DEF_IMPLHELPER_PRE\n    @internal\n*\/\n#define __DEF_IMPLHELPER_POST( N ) \\\n__DEF_IMPLHELPER_POST_A( N ) \\\n__DEF_IMPLHELPER_POST_B( N ) \\\n__DEF_IMPLHELPER_POST_C( N )\n#endif\n\n<commit_msg>INTEGRATION: CWS gcc340fixes01 (1.11.26); FILE MERGED 2004\/07\/15 14:45:58 cmc 1.11.26.1: #i31532# add some thises<commit_after>\/*************************************************************************\n *\n *  $RCSfile: implbase.hxx,v $\n *\n *  $Revision: 1.13 $\n *\n *  last change: $Author: kz $ $Date: 2004-07-30 15:37:40 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef _CPPUHELPER_IMPLBASE_HXX_\n#define _CPPUHELPER_IMPLBASE_HXX_\n\n#ifndef _OSL_MUTEX_HXX_\n#include <osl\/mutex.hxx>\n#endif\n#ifndef _CPPUHELPER_WEAK_HXX_\n#include <cppuhelper\/weak.hxx>\n#endif\n#ifndef _CPPUHELPER_WEAKAGG_HXX_\n#include <cppuhelper\/weakagg.hxx>\n#endif\n#ifndef INCLUDED_RTL_INSTANCE_HXX\n#include <rtl\/instance.hxx>\n#endif\n\n#include <com\/sun\/star\/lang\/XTypeProvider.hpp>\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n\n\/* This header should not be used anymore.\n   @deprecated\n*\/\n\nnamespace cppu\n{\n\n\/** Struct used for inline template implementation helpers: type entries.\n    Not for plublic use.\n    @internal\n*\/\nstruct Type_Offset\n{\n    \/** binary offset of vtable pointer from object base\n    *\/\n    sal_Int32 nOffset;\n    \/** interface type description of interface entry\n    *\/\n    typelib_InterfaceTypeDescription * pTD;\n};\n\/** Struct used for inline template implementation helpers: class data of implementation.\n    Not for plublic use.\n    @internal\n*\/\nstruct ClassDataBase\n{\n    \/** determines whether the class data has been statically initialized\n    *\/\n    sal_Bool  bOffsetsInit;\n    \/** length of static array ClassDataN\n    *\/\n    sal_Int32 nType2Offset;\n\n    \/** class code determines which standard types are supported (and returned on\n        com.sun.star.lang.XTypeProvider::getTypes()) by the helper:\n\n        - 1 -- com.sun.star.uno.XWeak\n        - 2 -- com.sun.star.uno.XWeak, com.sun.star.uno.XAggregation\n        - 3 -- com.sun.star.uno.XWeak, com.sun.star.uno.XAggregation, com.sun.star.lang.XComponent\n        - 4 -- com.sun.star.uno.XWeak, com.sun.star.lang.XComponent\n    *\/\n    sal_Int32 nClassCode;\n\n    \/** pointer to types sequence (com.sun.star.lang.XTypeProvider)\n    *\/\n    ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > * pTypes;\n    \/** pointer to class id (com.sun.star.lang.XTypeProvider)\n    *\/\n    ::com::sun::star::uno::Sequence< sal_Int8 > * pId;\n\n    \/** def ctor\n    *\/\n    ClassDataBase() SAL_THROW( () );\n    \/** class code ctor\n\n        @param nClassCode class code, see ClassDataBase::nClassCode\n    *\/\n    ClassDataBase( sal_Int32 nClassCode ) SAL_THROW( () );\n    \/** dtor\n    *\/\n    ~ClassDataBase() SAL_THROW( () );\n};\n\/** Struct used for inline template implementation helpers:\n    There will be versions of this struct with varying arType2Offset[] array sizes, each of which\n    is binary compatible with this one to be casted and used uniform. The size of the varying array\n    is set in ClassDataBase::nType2Offset (base class).\n    Not for plublic use.\n    @internal\n*\/\nstruct ClassData : public ClassDataBase\n{\n    \/** type entries array\n    *\/\n    Type_Offset arType2Offset[1];\n\n    \/** init call for supporting com.sun.star.lang.XTypeProvider\n    *\/\n    void SAL_CALL initTypeProvider() SAL_THROW( () );\n    \/** initial writing type offsets for vtables\n\n        @param rType type of interface\n        @param nOffset offset to vtable entry\n    *\/\n    void SAL_CALL writeTypeOffset( const ::com::sun::star::uno::Type & rType, sal_Int32 nOffset )\n        SAL_THROW( () );\n\n    \/** Queries for an interface.\n\n        @param rType demanded interface type\n        @pBase base this pointer related when writing type offsets (writeTypeOffset())\n        @return demanded interface or empty any\n    *\/\n    ::com::sun::star::uno::Any SAL_CALL query(\n        const ::com::sun::star::uno::Type & rType, ::com::sun::star::lang::XTypeProvider * pBase )\n        SAL_THROW( () );\n    \/** Gets the types for supporting com.sun.star.lang.XTypeProvider\n\n        @return sequence of types supported\n    *\/\n    ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > SAL_CALL getTypes()\n        SAL_THROW( () );\n    \/** Gets the class id of implemtation supporting com.sun.star.lang.XTypeProvider\n\n        @return class identifier (sequence< byte >)\n    *\/\n    ::com::sun::star::uno::Sequence< sal_Int8 > SAL_CALL getImplementationId()\n        SAL_THROW( () );\n};\n\n\/** Shared mutex for implementation helper initialization.\n    Not for public use.\n    @internal\n*\/\n::osl::Mutex & SAL_CALL getImplHelperInitMutex(void) SAL_THROW( () );\n}\n\n\/\/\n\/\/ settle down beavis, here comes the macro template hell :]\n\/\/\n\n\/\/==================================================================================================\n\n\/** Implementation helper macros\n    Not for common use. There are expanded forms of the macro usage in implbaseN.hxx\/compbaseN.hxx.\n    So there is commonly no need to use these macros. Though, you may need to implement more than\n    12 interfaces. Then you have to declare something like the following in your headers\n    (where N is your demanded number of interfaces):\n\n    #define __IFC3 Ifc1, Ifc2, Ifc3, ... up to N\n    #define __CLASS_IFC3 class Ifc1, class Ifc2, class Ifc3, ... up to N\n    #define __PUBLIC_IFC3 public Ifc1, public Ifc2, public Ifc3, ... up to N\n    __DEF_IMPLHELPER_PRE( N )\n    __IFC_WRITEOFFSET( 1 ) __IFC_WRITEOFFSET( 2 ) __IFC_WRITEOFFSET( 3 ), ... up to N\n    __DEF_IMPLHELPER_POST( N )\n\n    @internal\n*\/\n#define __DEF_IMPLHELPER_PRE( N ) \\\nnamespace cppu \\\n{ \\\nstruct ClassData##N : public ClassDataBase \\\n{ \\\n    Type_Offset arType2Offset[ N ]; \\\n    ClassData##N( sal_Int32 nClassCode ) SAL_THROW( () ) \\\n        : ClassDataBase( nClassCode ) \\\n        {} \\\n}; \\\ntemplate< __CLASS_IFC##N > \\\nclass SAL_NO_VTABLE ImplHelperBase##N \\\n    : public ::com::sun::star::lang::XTypeProvider \\\n    , __PUBLIC_IFC##N \\\n{ \\\nprotected: \\\n    ClassData & SAL_CALL getClassData( ClassDataBase & s_aCD ) SAL_THROW( () ) \\\n    { \\\n        ClassData & rCD = * static_cast< ClassData * >( &s_aCD ); \\\n        if (! rCD.bOffsetsInit) \\\n        { \\\n            ::osl::MutexGuard aGuard( getImplHelperInitMutex() ); \\\n            if (! rCD.bOffsetsInit) \\\n            { \\\n                char * pBase = (char *)this;\n\/** Implementation helper macro: have a look at __DEF_IMPLHELPER_PRE\n    @internal\n*\/\n#define __IFC_WRITEOFFSET( N ) \\\n                rCD.writeTypeOffset( ::getCppuType( (const ::com::sun::star::uno::Reference< Ifc##N > *)0 ), \\\n                                     (char *)(Ifc##N *)this - pBase );\n\/** Implementation helper macro: have a look at __DEF_IMPLHELPER_PRE\n    @internal\n*\/\n#define __DEF_IMPLHELPER_POST_A( N ) \\\n                rCD.bOffsetsInit = sal_True; \\\n            } \\\n        } \\\n        return rCD; \\\n    } \\\n}; \\\ntemplate< __CLASS_IFC##N > \\\nclass SAL_NO_VTABLE ImplHelper##N \\\n    : public ImplHelperBase##N< __IFC##N > \\\n{ \\\n    static ClassData##N s_aCD; \\\npublic: \\\n    virtual ::com::sun::star::uno::Any SAL_CALL queryInterface( const ::com::sun::star::uno::Type & rType ) throw (::com::sun::star::uno::RuntimeException) \\\n        { return this->getClassData( s_aCD ).query( rType, (ImplHelperBase##N< __IFC##N > *)this ); } \\\n    virtual ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > SAL_CALL getTypes() throw (::com::sun::star::uno::RuntimeException) \\\n        { return this->getClassData( s_aCD ).getTypes(); } \\\n    virtual ::com::sun::star::uno::Sequence< sal_Int8 > SAL_CALL getImplementationId() throw (::com::sun::star::uno::RuntimeException) \\\n        { return this->getClassData( s_aCD ).getImplementationId(); } \\\n}; \\\ntemplate< __CLASS_IFC##N > \\\nclass SAL_NO_VTABLE WeakImplHelper##N \\\n    : public ::cppu::OWeakObject \\\n    , public ImplHelperBase##N< __IFC##N > \\\n{ \\\n    static ClassData##N s_aCD; \\\npublic: \\\n    virtual ::com::sun::star::uno::Any SAL_CALL queryInterface( const ::com::sun::star::uno::Type & rType ) throw (::com::sun::star::uno::RuntimeException) \\\n    { \\\n        ::com::sun::star::uno::Any aRet( this->getClassData( s_aCD ).query( rType, (ImplHelperBase##N< __IFC##N > *)this ) ); \\\n        return (aRet.hasValue() ? aRet : OWeakObject::queryInterface( rType )); \\\n    } \\\n    virtual void SAL_CALL acquire() throw () \\\n        { OWeakObject::acquire(); } \\\n    virtual void SAL_CALL release() throw () \\\n        { OWeakObject::release(); } \\\n    virtual ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > SAL_CALL getTypes() throw (::com::sun::star::uno::RuntimeException) \\\n        { return this->getClassData( s_aCD ).getTypes(); } \\\n    virtual ::com::sun::star::uno::Sequence< sal_Int8 > SAL_CALL getImplementationId() throw (::com::sun::star::uno::RuntimeException) \\\n        { return this->getClassData( s_aCD ).getImplementationId(); } \\\n}; \\\ntemplate< __CLASS_IFC##N > \\\nclass SAL_NO_VTABLE WeakAggImplHelper##N \\\n    : public ::cppu::OWeakAggObject \\\n    , public ImplHelperBase##N< __IFC##N > \\\n{ \\\n    static ClassData##N s_aCD; \\\npublic: \\\n    virtual ::com::sun::star::uno::Any SAL_CALL queryInterface( const ::com::sun::star::uno::Type & rType ) throw (::com::sun::star::uno::RuntimeException) \\\n        { return OWeakAggObject::queryInterface( rType ); } \\\n    virtual ::com::sun::star::uno::Any SAL_CALL queryAggregation( const ::com::sun::star::uno::Type & rType ) throw (::com::sun::star::uno::RuntimeException) \\\n    { \\\n        ::com::sun::star::uno::Any aRet( this->getClassData( s_aCD ).query( rType, (ImplHelperBase##N< __IFC##N > *)this ) ); \\\n        return (aRet.hasValue() ? aRet : OWeakAggObject::queryAggregation( rType )); \\\n    } \\\n    virtual void SAL_CALL acquire() throw () \\\n        { OWeakAggObject::acquire(); } \\\n    virtual void SAL_CALL release() throw () \\\n        { OWeakAggObject::release(); } \\\n    virtual ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > SAL_CALL getTypes() throw (::com::sun::star::uno::RuntimeException) \\\n        { return this->getClassData( s_aCD ).getTypes(); } \\\n    virtual ::com::sun::star::uno::Sequence< sal_Int8 > SAL_CALL getImplementationId() throw (::com::sun::star::uno::RuntimeException) \\\n        { return this->getClassData( s_aCD ).getImplementationId(); } \\\n};\n\n\/** Implementation helper macro: have a look at __DEF_IMPLHELPER_PRE\n    @internal\n*\/\n#define __DEF_IMPLHELPER_POST_B( N ) \\\ntemplate< __CLASS_IFC##N > \\\nClassData##N ImplHelper##N< __IFC##N >::s_aCD = ClassData##N( 0 ); \\\ntemplate< __CLASS_IFC##N > \\\nClassData##N WeakImplHelper##N< __IFC##N >::s_aCD = ClassData##N( 1 ); \\\ntemplate< __CLASS_IFC##N > \\\nClassData##N WeakAggImplHelper##N< __IFC##N >::s_aCD = ClassData##N( 2 );\n\/** Implementation helper macro: have a look at __DEF_IMPLHELPER_PRE\n    @internal\n*\/\n#define __DEF_IMPLHELPER_POST_C( N ) \\\n}\n\/\/==================================================================================================\n\/** Implementation helper macro: have a look at __DEF_IMPLHELPER_PRE\n    @internal\n*\/\n#define __DEF_IMPLHELPER_POST( N ) \\\n__DEF_IMPLHELPER_POST_A( N ) \\\n__DEF_IMPLHELPER_POST_B( N ) \\\n__DEF_IMPLHELPER_POST_C( N )\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file Cosa\/IR.cpp\n * @version 1.0\n *\n * @section License\n * Copyright (C) 2013, 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 * 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., 59 Temple Place, Suite 330,\n * Boston, MA  02111-1307  USA\n *\n * This file is part of the Arduino Che Cosa project.\n *\/\n\n#include \"Cosa\/IR.hh\"\n#include \"Cosa\/RTC.hh\"\n#include \"Cosa\/Watchdog.hh\"\n\nvoid \nIR::Receiver::on_interrupt(uint16_t arg) \n{ \n  \/\/ Check if the buffer is full\n  if (m_ix == m_max) return;\n\n  \/\/ Check if the time should be set; i.e. queue for timeout events\n  if (m_ix == 0) Watchdog::attach(this, TIMEOUT);\n\n  \/\/ Measure the sample period\n  uint32_t stop = RTC::micros();\n  uint32_t us = (stop - m_start);\n  m_start = stop;\n  \n  \/\/ Check if samples should be collected\n  if (m_sample != 0) m_sample[m_ix] = us;\n\n  \/\/ Fix: Check for repeat code\n\n  \/\/ And generate binary code. Skip two first and two last samples\n  if (m_ix > 1 && m_ix < m_max - 2)\n    m_code = (m_code << 1) + (us > m_threshold);\n  \n  \/\/ Check if all samples have been received\n  if (++m_ix != m_max) return;\n\n  \/\/ Disable further interrupts and remove from timer queue\n  disable();\n  detach();\n\n  \/\/ Push an event with the received code\n  Event::push(Event::READ_COMPLETED_TYPE, (ExternalInterrupt*) this, m_code);\n}\n\nvoid \nIR::Receiver::reset()\n{\n  \/\/ Remove from any queue\n  detach();\n\n  \/\/ Initial state\n  m_ix = 0;\n  m_code = 0;\n\n  \/\/ Reset start time and enable the interrupt handler\n  m_start = RTC::micros();\n  enable();\n}\n\nint\nIR::Receiver::lookup(uint16_t code)\n{\n  if (m_keymap == 0) return (-1);\n  for (uint8_t i = 0; i < m_keys; i++)\n    if (code == pgm_read_word(&m_keymap[i].code))\n      return (pgm_read_word(&m_keymap[i].key));\n  return (-1);\n}\n\nIOStream& operator<<(IOStream& outs, IR::Receiver& receiver)\n{\n  if (receiver.m_sample == 0) return (outs);\n  for (uint8_t ix = 0; ix < receiver.m_ix; ix++)\n    outs << ix << ':' << receiver.m_sample[ix] << endl;\n  return (outs);\n}\n<commit_msg>Ripple effect of removing Event::Handler from ExternalInterrupt.<commit_after>\/**\n * @file Cosa\/IR.cpp\n * @version 1.0\n *\n * @section License\n * Copyright (C) 2013, 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 * 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., 59 Temple Place, Suite 330,\n * Boston, MA  02111-1307  USA\n *\n * This file is part of the Arduino Che Cosa project.\n *\/\n\n#include \"Cosa\/IR.hh\"\n#include \"Cosa\/RTC.hh\"\n#include \"Cosa\/Watchdog.hh\"\n\nvoid \nIR::Receiver::on_interrupt(uint16_t arg) \n{ \n  \/\/ Check if the buffer is full\n  if (m_ix == m_max) return;\n\n  \/\/ Check if the time should be set; i.e. queue for timeout events\n  if (m_ix == 0) Watchdog::attach(this, TIMEOUT);\n\n  \/\/ Measure the sample period\n  uint32_t stop = RTC::micros();\n  uint32_t us = (stop - m_start);\n  m_start = stop;\n  \n  \/\/ Check if samples should be collected\n  if (m_sample != 0) m_sample[m_ix] = us;\n\n  \/\/ Fix: Check for repeat code\n\n  \/\/ And generate binary code. Skip two first and two last samples\n  if (m_ix > 1 && m_ix < m_max - 2)\n    m_code = (m_code << 1) + (us > m_threshold);\n  \n  \/\/ Check if all samples have been received\n  if (++m_ix != m_max) return;\n\n  \/\/ Disable further interrupts and remove from timer queue\n  disable();\n  detach();\n\n  \/\/ Push an event with the received code\n  Event::push(Event::READ_COMPLETED_TYPE, this, m_code);\n}\n\nvoid \nIR::Receiver::reset()\n{\n  \/\/ Remove from any queue\n  detach();\n\n  \/\/ Initial state\n  m_ix = 0;\n  m_code = 0;\n\n  \/\/ Reset start time and enable the interrupt handler\n  m_start = RTC::micros();\n  enable();\n}\n\nint\nIR::Receiver::lookup(uint16_t code)\n{\n  if (m_keymap == 0) return (-1);\n  for (uint8_t i = 0; i < m_keys; i++)\n    if (code == pgm_read_word(&m_keymap[i].code))\n      return (pgm_read_word(&m_keymap[i].key));\n  return (-1);\n}\n\nIOStream& operator<<(IOStream& outs, IR::Receiver& receiver)\n{\n  if (receiver.m_sample == 0) return (outs);\n  for (uint8_t ix = 0; ix < receiver.m_ix; ix++)\n    outs << ix << ':' << receiver.m_sample[ix] << endl;\n  return (outs);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file Cosa\/TWI.hh\n * @version 1.0\n *\n * @section License\n * Copyright (C) 2012-2013, 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 * 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., 59 Temple Place, Suite 330,\n * Boston, MA  02111-1307  USA\n *\n * This file is part of the Arduino Che Cosa project.\n *\/\n\n#ifndef __COSA_TWI_HH__\n#define __COSA_TWI_HH__\n\n#include \"Cosa\/Types.h\"\n#if defined(__ARDUINO_TINY__)\n#include \"Cosa\/USI\/TWI.hh\"\n#else\n#include \"Cosa\/Event.hh\"\n\n\/**\n * Two wire library. Support for the I2C\/TWI bus Master and Slave\n * device drivers. Single-ton, twi, holds bus interaction state.\n * Supporting classes TWI::Driver for device drivers, TWI::Slave\n * for slave devices. \n *\/\nclass TWI {\n  friend void TWI_vect(void);\npublic:\n  \/**\n   * Device drivers are friends and may have callback\/event handler\n   * for completion events. \n   *\/\n  class Driver : public Event::Handler {\n    friend class TWI;\n    friend void TWI_vect(void);\n  protected:\n    \/** Device bus address *\/\n    uint8_t m_addr;\n\n  public:\n    \/**\n     * Construct TWI driver with given bus address.\n     * @param[in] addr bus address (7-bit LSB).\n     *\/\n    Driver(uint8_t addr) : m_addr(addr << 1) {}\n  };\n\n  \/**\n   * Slave device abstraction. Should set up buffers for request and\n   * response and handle incoming requests. See also USI\/TWI.hh for\n   * definition for ATtiny devices.\n   *\/\n  class Slave : public Driver {\n    friend class TWI;\n    friend void TWI_vect(void);\n  protected:\n    \/**\n     * Internal index in io-vector for read\/write buffers.\n     *\/\n    static const uint8_t WRITE_IX = 0;\n    static const uint8_t READ_IX = 1;\n\n    \/**\n     * @override Event::Handler\n     * Filter Event::WRITE_COMPLETED_TYPE(size) and calls on_request()\n     * with given write block as argument. The device is marked as ready\n     * when the request has been completed and a possible result block\n     * is available.\n     * @param[in] type the event type.\n     * @param[in] value the event value.\n     *\/\n    virtual void on_event(uint8_t type, uint16_t value);\n    \n  public:\n    \/**\n     * Construct slave with given address.\n     * @param[in] addr slave address.\n     *\/\n    Slave(uint8_t addr) : Driver(addr) {}\n\n    \/**\n     * Set read (result) buffer. Must be called before starting TWI.\n     * @param[in] buf buffer pointer.\n     * @param[in] size of buffer.\n     *\/\n    void set_read_buf(void* buf, size_t size);\n\n    \/**\n     * Set write (argument) buffer. Must be called before starting TWI.\n     * @param[in] buf buffer pointer.\n     * @param[in] size of buffer.\n     *\/\n    void set_write_buf(void* buf, size_t size);\n    \n    \/**\n     * Start TWI bus logic for the slave device. Returns true(1) if\n     * successful otherwise false(0). \n     * @return true(1) if successful otherwise false(0).\n     *\/\n    bool begin();\n\n    \/**\n     * @override TWI::Slave\n     * Service request callback when a write has been completed, i.e.,\n     * an argument block as been written. Must be defined by sub-class.\n     * Must handle write-read and write-write sequences. The device will \n     * become ready after the completion of the function. \n     * @param[in] buf buffer pointer.\n     * @param[in] size of buffer.\n     *\/\n    virtual void on_request(void* buf, size_t size) = 0;\n  };\n  \nprivate:\n  \/**\n   * Two Wire state and status codes.\n   *\/\n  enum State {\n    ERROR_STATE,\t\t\/\/ Error state\n    IDLE_STATE,\t\t\t\/\/ Idle state\n    MT_STATE,\t\t\t\/\/ Master transmit state\n    MR_STATE,\t\t\t\/\/ Master receive state\n    ST_STATE,\t\t\t\/\/ Slave transmit state\n    SR_STATE\t\t\t\/\/ Slave receive state\n  } __attribute__((packed));\n\n  \/**\n   * Macro to generate more compact status number sequence.\n   * And improve compiler code generation.\n   *\/\n# define TWI_STATUS(x) ((x) >> 3)\n\n  \/**\n   * Two Wire AVR hardware status codes as presented to the interrupt\n   * service routine.\n   *\/\n  enum {\n    \/** General Status Codes *\/\n    START = TWI_STATUS(0x08),\n    REP_START = TWI_STATUS(0x10),\n    ARB_LOST = TWI_STATUS(0x38),\n\n    \/** Master Tranmitter Mode*\/\n    MT_SLA_ACK = TWI_STATUS(0x18),\n    MT_SLA_NACK = TWI_STATUS(0x20),\n    MT_DATA_ACK = TWI_STATUS(0x28),\n    MT_DATA_NACK = TWI_STATUS(0x30),\n\n    \/** Master Receiver Mode *\/\n    MR_SLA_ACK = TWI_STATUS(0x40),\n    MR_SLA_NACK = TWI_STATUS(0x48),\n    MR_DATA_ACK = TWI_STATUS(0x50),\n    MR_DATA_NACK = TWI_STATUS(0x58),\n\n    \/** Slave Transmitter Mode *\/\n    ST_SLA_ACK = TWI_STATUS(0xA8),\n    ST_ARB_LOST_SLA_ACK = TWI_STATUS(0xB0),\n    ST_DATA_ACK = TWI_STATUS(0xB8),\n    ST_DATA_NACK = TWI_STATUS(0xC0),\n    ST_LAST_DATA = TWI_STATUS(0xC8),\n\n    \/** Slave Receiver Mode *\/\n    SR_SLA_ACK = TWI_STATUS(0x60),\n    SR_ARB_LOST_SLA_ACK = TWI_STATUS(0x68),\n    SR_GCALL_ACK = TWI_STATUS(0x70),\n    SR_ARB_LOST_GCALL_ACK = TWI_STATUS(0x78),\n    SR_DATA_ACK = TWI_STATUS(0x80),\n    SR_DATA_NACK = TWI_STATUS(0x88),\n    SR_GCALL_DATA_ACK = TWI_STATUS(0x90),\n    SR_GCALL_DATA_NACK = TWI_STATUS(0x98),\n    SR_STOP = TWI_STATUS(0xA0),\n\n    \/** Misc *\/\n    NO_INFO = TWI_STATUS(0xF8),\n    BUS_ERROR = TWI_STATUS(0x00)\n  } __attribute__((packed));\n\n  \/**\n   * Address mask and read\/write bit.\n   *\/\n  enum {\n    WRITE_OP = 0x00,\t\t\/\/ Write operation\n    READ_OP = 0x01,\t\t\/\/ Read operation\n    ADDR_MASK = 0xfe\t\t\/\/ Address mask\n  } __attribute__((packed));\n\n  \/**\n   * Default Two-Wire Interface clock: 100 KHz\n   *\/\n  static const uint32_t FREQ = 100000L;\n\n  \/** Default argument for start *\/\n  static const uint8_t NEXT_IX = 255;\n\n  \/**\n   * Commands for TWI hardware.\n   *\/\n  enum Command {\n    NULL_CMD = 0,\n    IDLE_CMD =               _BV(TWEA) |              _BV(TWEN) | _BV(TWIE),\n    START_CMD = _BV(TWINT) | _BV(TWEA) | _BV(TWSTA) | _BV(TWEN) | _BV(TWIE),\n    DATA_CMD =  _BV(TWINT) |                          _BV(TWEN) | _BV(TWIE),\n    ACK_CMD =   _BV(TWINT) | _BV(TWEA) |              _BV(TWEN) | _BV(TWIE),\n    NACK_CMD =  _BV(TWINT) |                          _BV(TWEN) | _BV(TWIE),\n    STOP_CMD =  _BV(TWINT) | _BV(TWEA) | _BV(TWSTO) | _BV(TWEN) | _BV(TWIE)\n  } __attribute__((packed));\n\n  \/**\n   * Device state, data buffers, current device and target.\n   *\/\n  static const uint8_t HEADER_MAX = 4;\n  static const uint8_t VEC_MAX = 4;\n  uint8_t m_header[HEADER_MAX];\n  iovec_t m_vec[VEC_MAX];\n  Event::Handler* m_target;\n  volatile State m_state;\n  volatile uint8_t m_status;\n  volatile uint8_t m_ix;\n  volatile uint8_t* m_next;\n  volatile uint8_t* m_last;\n  volatile int m_count;\n  uint8_t m_addr;\n  Driver* m_dev;\n  \n  \/**\n   * Start block transfer. Setup internal buffer pointers.\n   * Part of the TWI ISR state machine.\n   * @param[in] state next state.\n   * @param[in] ix io vector index.\n   *\/\n  void isr_start(State state, uint8_t ix);\n\n  \/**\n   * Write next byte to hardware device and issue command. Returns\n   * true if byte was written else false. Part of the TWI ISR state machine.\n   * @param[in] cmd command to write with byte.\n   * @return bool\n   *\/\n  bool isr_write(Command cmd);\n\n  \/**\n   * Read next byte from hardware device and store into buffer.\n   * Part of the TWI ISR state machine.\n   * Return true if byte was stored else false.\n   * @param[in] cmd command to write (default is no command, NULL_CMD).\n   * @return bool\n   *\/\n  bool isr_read(Command cmd = NULL_CMD);\n\n  \/**\n   * Stop block transfer and step to given state. If error sets count to\n   * negative error code(-1).  Part of the TWI ISR state machine.\n   * @param[in] state to step to.\n   * @param[in] type of event to push (default no event).\n   *\/\n  void isr_stop(State state, uint8_t type = Event::NULL_TYPE);\n\n  \/**\n   * Initiate a request to the device. Return true(1) if successful\n   * otherwise false(0).  \n   * @param[in] op slave operation.\n   * @return bool\n   *\/\n  bool request(uint8_t op);\n\npublic:\n  \/** \n   * Construct two-wire instance. This is actually a single-ton on\n   * current supported hardware, i.e. there can only be one unit.\n   *\/\n  TWI() :\n    m_target(NULL),\n    m_state(IDLE_STATE),\n    m_status(NO_INFO),\n    m_ix(0),\n    m_next(NULL),\n    m_last(NULL),\n    m_count(0),\n    m_dev(NULL)\n  {\n    for (uint8_t ix = 0; ix < VEC_MAX; ix++) {\n      m_vec[ix].buf = 0;\n      m_vec[ix].size = 0;\n    }\n  }\n\n  \/**\n   * Start TWI logic for a device transaction block. Use given event\n   * handler for completion events. Returns true(1) if successful\n   * otherwise false(0).\n   * @param[in] dev device.\n   * @param[in] target receiver of events on requests (default NULL).\n   * @return true(1) if successful otherwise false(0).\n   *\/\n  bool begin(TWI::Driver* dev, Event::Handler* target = NULL);\n\n  \/**\n   * Stop usage of the TWI bus logic. \n   * @return true(1) if successful otherwise false(0).\n   *\/\n  bool end();\n\n  \/**\n   * Issue a write data request to the current driver. Return\n   * true(1) if successful otherwise(0). \n   * @param[in] buf data to write.\n   * @param[in] size number of bytes to write.\n   * @return bool\n   *\/\n  bool write_request(void* buf, size_t size);\n\n  \/**\n   * Issue a write data request to the current driver with given\n   * byte header\/command. Return true(1) if successful otherwise(0).\n   * @param[in] header to write before buffer.\n   * @param[in] buf data to write.\n   * @param[in] size number of bytes to write.\n   * @return bool\n   *\/\n  bool write_request(uint8_t header, void* buf, size_t size);\n\n  \/**\n   * Issue a write data request to the current driver with given\n   * header\/command. Return true(1) if successful otherwise(0).\n   * @param[in] header to write before buffer.\n   * @param[in] buf data to write.\n   * @param[in] size number of bytes to write.\n   * @return bool\n   *\/\n  bool write_request(uint16_t header, void* buf, size_t size);\n\n  \/**\n   * Issue a read data request to the current driver. Return true(1)\n   * if successful otherwise(0). \n   * @param[in] buf data to read.\n   * @param[in] size number of bytes to read.\n   * @return number of bytes\n   *\/\n  bool read_request(void* buf, size_t size);\n\n  \/**\n   * Write data to the current driver. Returns number of bytes\n   * written or negative error code.\n   * @param[in] buf data to write.\n   * @param[in] size number of bytes to write.\n   * @return number of bytes\n   *\/\n  int write(void* buf, size_t size)\n  {\n    if (!write_request(buf, size)) return (-1);\n    return (await_completed());\n  }\n\n  \/**\n   * Write data to the current driver with given byte header. Returns\n   * number of bytes written or negative error code. \n   * @param[in] header to write before buffer.\n   * @param[in] buf data to write.\n   * @param[in] size number of bytes to write.\n   * @return number of bytes\n   *\/\n  int write(uint8_t header, void* buf = 0, size_t size = 0)\n  {\n    if (!write_request(header, buf, size)) return (-1);\n    return (await_completed());\n  }\n\n  \/**\n   * Write data to the current driver with given header. Returns\n   * number of bytes written or negative error code.\n   * @param[in] header to write before buffer.\n   * @param[in] buf data to write.\n   * @param[in] size number of bytes to write.\n   * @return number of bytes\n   *\/\n  int write(uint16_t header, void* buf = 0, size_t size = 0)\n  {\n    if (!write_request(header, buf, size)) return (-1);\n    return (await_completed());\n  }\n\n  \/**\n   * Read data to the current driver. Returns number of bytes read or\n   * negative error code. \n   * @param[in] buf data to write.\n   * @param[in] size number of bytes to read.\n   * @return number of bytes\n   *\/\n  int read(void* buf, size_t size)\n  {\n    if (!read_request(buf, size)) return (-1);\n    return (await_completed());\n  }\n\n  \/**\n   * Await issued request to complete. Returns number of bytes \n   * or negative error code.\n   *\/\n  int await_completed(uint8_t mode = SLEEP_MODE_IDLE);\n};\n#endif\n\n\/**\n * Two-wire hardware interface module. Singleton on Arduino hardware.\n*\/\nextern TWI twi;\n#endif\n<commit_msg>Adding explicit call of Event::Handler constructor in TWI::Driver.<commit_after>\/**\n * @file Cosa\/TWI.hh\n * @version 1.0\n *\n * @section License\n * Copyright (C) 2012-2013, 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 * 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., 59 Temple Place, Suite 330,\n * Boston, MA  02111-1307  USA\n *\n * This file is part of the Arduino Che Cosa project.\n *\/\n\n#ifndef __COSA_TWI_HH__\n#define __COSA_TWI_HH__\n\n#include \"Cosa\/Types.h\"\n#if defined(__ARDUINO_TINY__)\n#include \"Cosa\/USI\/TWI.hh\"\n#else\n#include \"Cosa\/Event.hh\"\n\n\/**\n * Two wire library. Support for the I2C\/TWI bus Master and Slave\n * device drivers. Single-ton, twi, holds bus interaction state.\n * Supporting classes TWI::Driver for device drivers, TWI::Slave\n * for slave devices. \n *\/\nclass TWI {\n  friend void TWI_vect(void);\npublic:\n  \/**\n   * Device drivers are friends and may have callback\/event handler\n   * for completion events. \n   *\/\n  class Driver : public Event::Handler {\n    friend class TWI;\n    friend void TWI_vect(void);\n  protected:\n    \/** Device bus address *\/\n    uint8_t m_addr;\n\n  public:\n    \/**\n     * Construct TWI driver with given bus address.\n     * @param[in] addr bus address (7-bit LSB).\n     *\/\n    Driver(uint8_t addr) : Event::Handler(), m_addr(addr << 1) {}\n  };\n\n  \/**\n   * Slave device abstraction. Should set up buffers for request and\n   * response and handle incoming requests. See also USI\/TWI.hh for\n   * definition for ATtiny devices.\n   *\/\n  class Slave : public Driver {\n    friend class TWI;\n    friend void TWI_vect(void);\n  protected:\n    \/**\n     * Internal index in io-vector for read\/write buffers.\n     *\/\n    static const uint8_t WRITE_IX = 0;\n    static const uint8_t READ_IX = 1;\n\n    \/**\n     * @override Event::Handler\n     * Filter Event::WRITE_COMPLETED_TYPE(size) and calls on_request()\n     * with given write block as argument. The device is marked as ready\n     * when the request has been completed and a possible result block\n     * is available.\n     * @param[in] type the event type.\n     * @param[in] value the event value.\n     *\/\n    virtual void on_event(uint8_t type, uint16_t value);\n    \n  public:\n    \/**\n     * Construct slave with given address.\n     * @param[in] addr slave address.\n     *\/\n    Slave(uint8_t addr) : Driver(addr) {}\n\n    \/**\n     * Set read (result) buffer. Must be called before starting TWI.\n     * @param[in] buf buffer pointer.\n     * @param[in] size of buffer.\n     *\/\n    void set_read_buf(void* buf, size_t size);\n\n    \/**\n     * Set write (argument) buffer. Must be called before starting TWI.\n     * @param[in] buf buffer pointer.\n     * @param[in] size of buffer.\n     *\/\n    void set_write_buf(void* buf, size_t size);\n    \n    \/**\n     * Start TWI bus logic for the slave device. Returns true(1) if\n     * successful otherwise false(0). \n     * @return true(1) if successful otherwise false(0).\n     *\/\n    bool begin();\n\n    \/**\n     * @override TWI::Slave\n     * Service request callback when a write has been completed, i.e.,\n     * an argument block as been written. Must be defined by sub-class.\n     * Must handle write-read and write-write sequences. The device will \n     * become ready after the completion of the function. \n     * @param[in] buf buffer pointer.\n     * @param[in] size of buffer.\n     *\/\n    virtual void on_request(void* buf, size_t size) = 0;\n  };\n  \nprivate:\n  \/**\n   * Two Wire state and status codes.\n   *\/\n  enum State {\n    ERROR_STATE,\t\t\/\/ Error state\n    IDLE_STATE,\t\t\t\/\/ Idle state\n    MT_STATE,\t\t\t\/\/ Master transmit state\n    MR_STATE,\t\t\t\/\/ Master receive state\n    ST_STATE,\t\t\t\/\/ Slave transmit state\n    SR_STATE\t\t\t\/\/ Slave receive state\n  } __attribute__((packed));\n\n  \/**\n   * Macro to generate more compact status number sequence.\n   * And improve compiler code generation.\n   *\/\n# define TWI_STATUS(x) ((x) >> 3)\n\n  \/**\n   * Two Wire AVR hardware status codes as presented to the interrupt\n   * service routine.\n   *\/\n  enum {\n    \/** General Status Codes *\/\n    START = TWI_STATUS(0x08),\n    REP_START = TWI_STATUS(0x10),\n    ARB_LOST = TWI_STATUS(0x38),\n\n    \/** Master Tranmitter Mode*\/\n    MT_SLA_ACK = TWI_STATUS(0x18),\n    MT_SLA_NACK = TWI_STATUS(0x20),\n    MT_DATA_ACK = TWI_STATUS(0x28),\n    MT_DATA_NACK = TWI_STATUS(0x30),\n\n    \/** Master Receiver Mode *\/\n    MR_SLA_ACK = TWI_STATUS(0x40),\n    MR_SLA_NACK = TWI_STATUS(0x48),\n    MR_DATA_ACK = TWI_STATUS(0x50),\n    MR_DATA_NACK = TWI_STATUS(0x58),\n\n    \/** Slave Transmitter Mode *\/\n    ST_SLA_ACK = TWI_STATUS(0xA8),\n    ST_ARB_LOST_SLA_ACK = TWI_STATUS(0xB0),\n    ST_DATA_ACK = TWI_STATUS(0xB8),\n    ST_DATA_NACK = TWI_STATUS(0xC0),\n    ST_LAST_DATA = TWI_STATUS(0xC8),\n\n    \/** Slave Receiver Mode *\/\n    SR_SLA_ACK = TWI_STATUS(0x60),\n    SR_ARB_LOST_SLA_ACK = TWI_STATUS(0x68),\n    SR_GCALL_ACK = TWI_STATUS(0x70),\n    SR_ARB_LOST_GCALL_ACK = TWI_STATUS(0x78),\n    SR_DATA_ACK = TWI_STATUS(0x80),\n    SR_DATA_NACK = TWI_STATUS(0x88),\n    SR_GCALL_DATA_ACK = TWI_STATUS(0x90),\n    SR_GCALL_DATA_NACK = TWI_STATUS(0x98),\n    SR_STOP = TWI_STATUS(0xA0),\n\n    \/** Misc *\/\n    NO_INFO = TWI_STATUS(0xF8),\n    BUS_ERROR = TWI_STATUS(0x00)\n  } __attribute__((packed));\n\n  \/**\n   * Address mask and read\/write bit.\n   *\/\n  enum {\n    WRITE_OP = 0x00,\t\t\/\/ Write operation\n    READ_OP = 0x01,\t\t\/\/ Read operation\n    ADDR_MASK = 0xfe\t\t\/\/ Address mask\n  } __attribute__((packed));\n\n  \/**\n   * Default Two-Wire Interface clock: 100 KHz\n   *\/\n  static const uint32_t FREQ = 100000L;\n\n  \/** Default argument for start *\/\n  static const uint8_t NEXT_IX = 255;\n\n  \/**\n   * Commands for TWI hardware.\n   *\/\n  enum Command {\n    NULL_CMD = 0,\n    IDLE_CMD =               _BV(TWEA) |              _BV(TWEN) | _BV(TWIE),\n    START_CMD = _BV(TWINT) | _BV(TWEA) | _BV(TWSTA) | _BV(TWEN) | _BV(TWIE),\n    DATA_CMD =  _BV(TWINT) |                          _BV(TWEN) | _BV(TWIE),\n    ACK_CMD =   _BV(TWINT) | _BV(TWEA) |              _BV(TWEN) | _BV(TWIE),\n    NACK_CMD =  _BV(TWINT) |                          _BV(TWEN) | _BV(TWIE),\n    STOP_CMD =  _BV(TWINT) | _BV(TWEA) | _BV(TWSTO) | _BV(TWEN) | _BV(TWIE)\n  } __attribute__((packed));\n\n  \/**\n   * Device state, data buffers, current device and target.\n   *\/\n  static const uint8_t HEADER_MAX = 4;\n  static const uint8_t VEC_MAX = 4;\n  uint8_t m_header[HEADER_MAX];\n  iovec_t m_vec[VEC_MAX];\n  Event::Handler* m_target;\n  volatile State m_state;\n  volatile uint8_t m_status;\n  volatile uint8_t m_ix;\n  volatile uint8_t* m_next;\n  volatile uint8_t* m_last;\n  volatile int m_count;\n  uint8_t m_addr;\n  Driver* m_dev;\n  \n  \/**\n   * Start block transfer. Setup internal buffer pointers.\n   * Part of the TWI ISR state machine.\n   * @param[in] state next state.\n   * @param[in] ix io vector index.\n   *\/\n  void isr_start(State state, uint8_t ix);\n\n  \/**\n   * Write next byte to hardware device and issue command. Returns\n   * true if byte was written else false. Part of the TWI ISR state machine.\n   * @param[in] cmd command to write with byte.\n   * @return bool\n   *\/\n  bool isr_write(Command cmd);\n\n  \/**\n   * Read next byte from hardware device and store into buffer.\n   * Part of the TWI ISR state machine.\n   * Return true if byte was stored else false.\n   * @param[in] cmd command to write (default is no command, NULL_CMD).\n   * @return bool\n   *\/\n  bool isr_read(Command cmd = NULL_CMD);\n\n  \/**\n   * Stop block transfer and step to given state. If error sets count to\n   * negative error code(-1).  Part of the TWI ISR state machine.\n   * @param[in] state to step to.\n   * @param[in] type of event to push (default no event).\n   *\/\n  void isr_stop(State state, uint8_t type = Event::NULL_TYPE);\n\n  \/**\n   * Initiate a request to the device. Return true(1) if successful\n   * otherwise false(0).  \n   * @param[in] op slave operation.\n   * @return bool\n   *\/\n  bool request(uint8_t op);\n\npublic:\n  \/** \n   * Construct two-wire instance. This is actually a single-ton on\n   * current supported hardware, i.e. there can only be one unit.\n   *\/\n  TWI() :\n    m_target(NULL),\n    m_state(IDLE_STATE),\n    m_status(NO_INFO),\n    m_ix(0),\n    m_next(NULL),\n    m_last(NULL),\n    m_count(0),\n    m_dev(NULL)\n  {\n    for (uint8_t ix = 0; ix < VEC_MAX; ix++) {\n      m_vec[ix].buf = 0;\n      m_vec[ix].size = 0;\n    }\n  }\n\n  \/**\n   * Start TWI logic for a device transaction block. Use given event\n   * handler for completion events. Returns true(1) if successful\n   * otherwise false(0).\n   * @param[in] dev device.\n   * @param[in] target receiver of events on requests (default NULL).\n   * @return true(1) if successful otherwise false(0).\n   *\/\n  bool begin(TWI::Driver* dev, Event::Handler* target = NULL);\n\n  \/**\n   * Stop usage of the TWI bus logic. \n   * @return true(1) if successful otherwise false(0).\n   *\/\n  bool end();\n\n  \/**\n   * Issue a write data request to the current driver. Return\n   * true(1) if successful otherwise(0). \n   * @param[in] buf data to write.\n   * @param[in] size number of bytes to write.\n   * @return bool\n   *\/\n  bool write_request(void* buf, size_t size);\n\n  \/**\n   * Issue a write data request to the current driver with given\n   * byte header\/command. Return true(1) if successful otherwise(0).\n   * @param[in] header to write before buffer.\n   * @param[in] buf data to write.\n   * @param[in] size number of bytes to write.\n   * @return bool\n   *\/\n  bool write_request(uint8_t header, void* buf, size_t size);\n\n  \/**\n   * Issue a write data request to the current driver with given\n   * header\/command. Return true(1) if successful otherwise(0).\n   * @param[in] header to write before buffer.\n   * @param[in] buf data to write.\n   * @param[in] size number of bytes to write.\n   * @return bool\n   *\/\n  bool write_request(uint16_t header, void* buf, size_t size);\n\n  \/**\n   * Issue a read data request to the current driver. Return true(1)\n   * if successful otherwise(0). \n   * @param[in] buf data to read.\n   * @param[in] size number of bytes to read.\n   * @return number of bytes\n   *\/\n  bool read_request(void* buf, size_t size);\n\n  \/**\n   * Write data to the current driver. Returns number of bytes\n   * written or negative error code.\n   * @param[in] buf data to write.\n   * @param[in] size number of bytes to write.\n   * @return number of bytes\n   *\/\n  int write(void* buf, size_t size)\n  {\n    if (!write_request(buf, size)) return (-1);\n    return (await_completed());\n  }\n\n  \/**\n   * Write data to the current driver with given byte header. Returns\n   * number of bytes written or negative error code. \n   * @param[in] header to write before buffer.\n   * @param[in] buf data to write.\n   * @param[in] size number of bytes to write.\n   * @return number of bytes\n   *\/\n  int write(uint8_t header, void* buf = 0, size_t size = 0)\n  {\n    if (!write_request(header, buf, size)) return (-1);\n    return (await_completed());\n  }\n\n  \/**\n   * Write data to the current driver with given header. Returns\n   * number of bytes written or negative error code.\n   * @param[in] header to write before buffer.\n   * @param[in] buf data to write.\n   * @param[in] size number of bytes to write.\n   * @return number of bytes\n   *\/\n  int write(uint16_t header, void* buf = 0, size_t size = 0)\n  {\n    if (!write_request(header, buf, size)) return (-1);\n    return (await_completed());\n  }\n\n  \/**\n   * Read data to the current driver. Returns number of bytes read or\n   * negative error code. \n   * @param[in] buf data to write.\n   * @param[in] size number of bytes to read.\n   * @return number of bytes\n   *\/\n  int read(void* buf, size_t size)\n  {\n    if (!read_request(buf, size)) return (-1);\n    return (await_completed());\n  }\n\n  \/**\n   * Await issued request to complete. Returns number of bytes \n   * or negative error code.\n   *\/\n  int await_completed(uint8_t mode = SLEEP_MODE_IDLE);\n};\n#endif\n\n\/**\n * Two-wire hardware interface module. Singleton on Arduino hardware.\n*\/\nextern TWI twi;\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include <nan.h>\n#include \"dvbtee-parser.h\"\n\nTableData::TableData(const uint8_t &tableId, const std::string &decoderName, const std::string &json)\n: tableId(tableId)\n, decoderName(decoderName)\n, json(json)\n{}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nTableReceiver::TableReceiver(dvbteeParser *dvbteeParser)\n: m_dvbteeParser(dvbteeParser)\n{\n  uv_mutex_init(&m_ev_mutex);\n  uv_async_init(uv_default_loop(), &m_async, completeCb);\n  m_async.data = this;\n}\n\nTableReceiver::~TableReceiver()\n{\n  unregisterInterface();\n\n  m_cb.Reset();\n\n  uv_mutex_lock(&m_ev_mutex);\n  while (!m_eq.empty())\n  {\n    TableData *data = m_eq.front();\n    delete data;\n    m_eq.pop();\n  }\n  uv_mutex_unlock(&m_ev_mutex);\n\n  uv_mutex_destroy(&m_ev_mutex);\n}\n\nvoid TableReceiver::subscribe(const v8::Local<v8::Function> &fn)\n{\n  m_cb.SetFunction(fn);\n  registerInterface();\n}\n\nvoid TableReceiver::registerInterface()\n{\n  m_dvbteeParser->m_parser.subscribeTables(this);\n}\n\nvoid TableReceiver::unregisterInterface()\n{\n  m_dvbteeParser->m_parser.subscribeTables(NULL);\n}\n\nvoid TableReceiver::updateTable(uint8_t tId, dvbtee::decode::Table *table)\n{\n  uv_mutex_lock(&m_ev_mutex);\n  m_eq.push(new TableData(table->getTableid(), table->getDecoderName(), table->toJson()));\n  uv_mutex_unlock(&m_ev_mutex);\n\n  uv_async_send(&m_async);\n}\n\n#if defined(NODE_MAJOR_VERSION) && (NODE_MAJOR_VERSION == 0 && \\\n    defined(NODE_MINOR_VERSION) && (NODE_MINOR_VERSION < 12))\n\nclass JSON {\npublic:\n  static v8::Local<v8::Value> Parse(v8::Local<v8::Value> jsonString)\n  {\n    return JSON::instance().call(\"parse\", jsonString);\n  }\n\nprivate:\n  Nan::Persistent<v8::Object> m_persistent;\n  const char *m_objectName;\n\n  static JSON& instance()\n  {\n    static JSON i;\n    return i;\n  }\n\n  JSON()\n   : m_objectName(\"JSON\")\n  {\n    v8::Local<v8::Object> obj = Nan::New<v8::Object>();\n    m_persistent.Reset(obj);\n\n    v8::Local<v8::Value> objectName = Nan::New(m_objectName).ToLocalChecked();\n    v8::Local<v8::Value> globalJSON = Nan::GetCurrentContext()->Global()->Get(objectName);\n\n    if (globalJSON->IsObject()) {\n      obj->Set(objectName, globalJSON);\n    }\n  }\n\n  ~JSON()\n  {\n    m_persistent.Reset();\n  }\n\n  v8::Local<v8::Value> getMethod(v8::Local<v8::Object> &obj, const char *method)\n  {\n    v8::Local<v8::Object> persistent = Nan::New(m_persistent);\n    v8::Local<v8::String> methodName = Nan::New(method).ToLocalChecked();\n\n    if (!persistent->Has(methodName))\n    {\n      v8::Local<v8::Value> thisMethod = obj->Get(methodName);\n\n      if (thisMethod.IsEmpty() || !thisMethod->IsFunction()) {\n        return Nan::Undefined();\n      }\n\n      persistent->Set(methodName, thisMethod);\n\n      return thisMethod;\n    }\n    return persistent->Get(methodName);\n  }\n\n  v8::Local<v8::Value> call(const char *method, v8::Local<v8::Value> arg)\n  {\n    v8::Local<v8::Object> json = Nan::New(m_persistent)->Get(Nan::New(m_objectName).ToLocalChecked())->ToObject();\n\n    v8::Local<v8::Function> methodFunction = v8::Local<v8::Function>::Cast(getMethod(json, method));\n\n    return methodFunction->Call(json, 1, &arg);\n  }\n#if __cplusplus <= 199711L\nprivate:\n  JSON(JSON const&);\n  void operator=(JSON const&);\n#else\npublic:\n  JSON(JSON const&)           = delete;\n  void operator=(JSON const&) = delete;\n#endif\n};\n#define v8_JSON JSON\n#else\n#define v8_JSON v8::JSON\n#endif\n\nvoid TableReceiver::notify()\n{\n  Nan::HandleScope scope;\n  uv_mutex_lock(&m_ev_mutex);\n  while (!m_eq.empty())\n  {\n    TableData *data = m_eq.front();\n    uv_mutex_unlock(&m_ev_mutex);\n\n    if (!m_cb.IsEmpty()) {\n\n      v8::Local<v8::String> jsonStr = Nan::New(data->json).ToLocalChecked();\n      v8::Local<v8::Value> jsonObj = v8_JSON::Parse(jsonStr);\n\n      v8::Local<v8::Value> argv[] = {\n        Nan::New(data->tableId),\n        Nan::New(data->decoderName).ToLocalChecked(),\n        jsonObj\n      };\n\n      m_cb.Call(3, argv);\n    }\n\n    delete data;\n\n    uv_mutex_lock(&m_ev_mutex);\n    m_eq.pop();\n  }\n  uv_mutex_unlock(&m_ev_mutex);\n}\n\nvoid TableReceiver::completeCb(uv_async_t *handle\n#if NODE_MODULE_VERSION<=11\n                              , int status \/*UNUSED*\/\n#endif\n                              )\n{\n  TableReceiver* rcvr = static_cast<TableReceiver*>(handle->data);\n  rcvr->notify();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nNan::Persistent<v8::Function> dvbteeParser::constructor;\n\ndvbteeParser::dvbteeParser()\n: m_tableReceiver(this)\n{\n}\n\ndvbteeParser::~dvbteeParser() {\n}\n\nvoid dvbteeParser::Init(v8::Handle<v8::Object> exports) {\n  Nan::HandleScope scope;\n\n  \/\/ Prepare constructor template\n  v8::Local<v8::FunctionTemplate> tpl = Nan::New<v8::FunctionTemplate>(New);\n  tpl->SetClassName(Nan::New(\"Parser\").ToLocalChecked());\n  tpl->InstanceTemplate()->SetInternalFieldCount(1);\n\n  \/\/ Prototype\n  Nan::SetPrototypeMethod(tpl, \"reset\",        reset);\n  Nan::SetPrototypeMethod(tpl, \"feed\",         feed);\n  Nan::SetPrototypeMethod(tpl, \"push\",         feed); \/\/ deprecated\n  Nan::SetPrototypeMethod(tpl, \"parse\",        feed); \/\/ deprecated\n  Nan::SetPrototypeMethod(tpl, \"listenTables\", listenTables);\n\n  constructor.Reset(tpl->GetFunction());\n  exports->Set(Nan::New(\"Parser\").ToLocalChecked(), tpl->GetFunction());\n}\n\nvoid dvbteeParser::New(const Nan::FunctionCallbackInfo<v8::Value>& info) {\n  if (info.IsConstructCall()) {\n    \/\/ Invoked as constructor: `new dvbteeParser(...)`\n    dvbteeParser* obj = new dvbteeParser();\n    obj->Wrap(info.This());\n    info.GetReturnValue().Set(info.This());\n  } else {\n    \/\/ Invoked as plain function `dvbteeParser(...)`, turn into construct call.\n    const int argc = 0;\n    v8::Local<v8::Value> argv[argc] = { };\n    v8::Local<v8::Function> cons = Nan::New<v8::Function>(constructor);\n    info.GetReturnValue().Set(cons->NewInstance(argc, argv));\n  }\n}\n\nvoid dvbteeParser::listenTables(const Nan::FunctionCallbackInfo<v8::Value>& info) {\n  dvbteeParser* obj = ObjectWrap::Unwrap<dvbteeParser>(info.Holder());\n\n  int lastArg = info.Length() - 1;\n\n  if ((lastArg >= 0) && (info[lastArg]->IsFunction())) {\n    obj->m_tableReceiver.subscribe(info[lastArg].As<v8::Function>());\n  }\n\n  info.GetReturnValue().Set(info.Holder());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass ResetWorker : public Nan::AsyncWorker {\npublic:\n  ResetWorker(Nan::Callback *callback, const Nan::FunctionCallbackInfo<v8::Value>& info)\n    : Nan::AsyncWorker(callback)\n    {\n      m_obj = Nan::ObjectWrap::Unwrap<dvbteeParser>(info.Holder());\n    }\n  ~ResetWorker()\n    {\n    }\n\n  \/\/ Executed inside the worker-thread.\n  \/\/ It is not safe to access V8, or V8 data structures\n  \/\/ here, so everything we need for input and output\n  \/\/ should go on `this`.\n  void Execute () {\n    m_obj->m_parser.cleanup();\n    m_obj->m_parser.reset();\n  }\n\n  \/\/ Executed when the async work is complete\n  \/\/ this function will be run inside the main event loop\n  \/\/ so it is safe to use V8 again\n  void HandleOKCallback () {\n    Nan::HandleScope scope;\n\n    v8::Local<v8::Value> argv[] = {\n        Nan::Null()\n      , Nan::New<v8::Number>(0)\n    };\n\n    callback->Call(2, argv);\n  }\n\nprivate:\n  dvbteeParser* m_obj;\n};\n\nvoid dvbteeParser::reset(const Nan::FunctionCallbackInfo<v8::Value>& info) {\n\n  \/\/ If a callback function is supplied, this method will run async\n  \/\/ otherwise, it will run synchronous\n\n  int lastArg = info.Length() - 1;\n\n  if ((lastArg >= 0) && (info[lastArg]->IsFunction())) {\n\n    Nan::Callback *callback = new Nan::Callback(info[lastArg].As<v8::Function>());\n    Nan::AsyncQueueWorker(new ResetWorker(callback, info));\n\n  } else {\n    dvbteeParser* obj = ObjectWrap::Unwrap<dvbteeParser>(info.Holder());\n\n    obj->m_parser.cleanup();\n    obj->m_parser.reset();\n\n    info.GetReturnValue().Set(info.Holder());\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass FeedWorker : public Nan::AsyncWorker {\npublic:\n  FeedWorker(Nan::Callback *callback, const Nan::FunctionCallbackInfo<v8::Value>& info)\n    : Nan::AsyncWorker(callback)\n    , m_buf(NULL)\n    , m_buf_len(0)\n    , m_ret(-1)\n    {\n      m_obj = Nan::ObjectWrap::Unwrap<dvbteeParser>(info.Holder());\n\n      if ((info[0]->IsObject()) && (info[1]->IsNumber())) {\n\n        const char *key = \"buf\";\n        SaveToPersistent(key, info[0]);\n        m_buf = node::Buffer::Data(GetFromPersistent(key)->ToObject());\n        m_buf_len = info[1]->Uint32Value();\n      }\n    }\n  ~FeedWorker()\n    {\n    }\n\n  \/\/ Executed inside the worker-thread.\n  \/\/ It is not safe to access V8, or V8 data structures\n  \/\/ here, so everything we need for input and output\n  \/\/ should go on `this`.\n  void Execute () {\n    if ((m_buf) && (m_buf_len)) {\n      m_ret = m_obj->m_parser.feed(m_buf_len, (uint8_t*)m_buf);\n    }\n    if (m_ret < 0) {\n      SetErrorMessage(\"invalid buffer \/ length\");\n    }\n  }\n\n  \/\/ Executed when the async work is complete\n  \/\/ this function will be run inside the main event loop\n  \/\/ so it is safe to use V8 again\n  void HandleOKCallback () {\n    Nan::HandleScope scope;\n\n    v8::Local<v8::Value> argv[] = {\n        Nan::Null()\n      , Nan::New<v8::Number>(m_ret)\n    };\n\n    callback->Call(2, argv);\n  }\n\nprivate:\n  dvbteeParser* m_obj;\n  char* m_buf;\n  unsigned int m_buf_len;\n  int m_ret;\n};\n\n\nvoid dvbteeParser::feed(const Nan::FunctionCallbackInfo<v8::Value>& info) {\n\n  \/\/ If a callback function is supplied, this method will run async\n  \/\/ otherwise, it will run synchronous\n  \/\/\n  \/\/ Note: when packets are pushed to the parser, the parser will start\n  \/\/ generating async events containing PSIP table data regardless of\n  \/\/ whether this function was called synchronously or not\n\n  int lastArg = info.Length() - 1;\n\n  if ((lastArg >= 0) && (info[lastArg]->IsFunction())) {\n\n    Nan::Callback *callback = new Nan::Callback(info[lastArg].As<v8::Function>());\n    Nan::AsyncQueueWorker(new FeedWorker(callback, info));\n\n  } else {\n    dvbteeParser* obj = ObjectWrap::Unwrap<dvbteeParser>(info.Holder());\n    int ret = -1;\n\n    if ((info[0]->IsObject()) && (info[1]->IsNumber())) {\n\n      v8::Local<v8::Object> bufferObj = info[0]->ToObject();\n      unsigned int len = info[1]->Uint32Value();\n      const char* buf = node::Buffer::Data(bufferObj);\n\n      ret = obj->m_parser.feed(len, (uint8_t*)buf);\n    }\n\n    info.GetReturnValue().Set(Nan::New(ret));\n  }\n}\n<commit_msg>native-json: simplify code even more by using Nan::Callback<commit_after>#include <nan.h>\n#include \"dvbtee-parser.h\"\n\nTableData::TableData(const uint8_t &tableId, const std::string &decoderName, const std::string &json)\n: tableId(tableId)\n, decoderName(decoderName)\n, json(json)\n{}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nTableReceiver::TableReceiver(dvbteeParser *dvbteeParser)\n: m_dvbteeParser(dvbteeParser)\n{\n  uv_mutex_init(&m_ev_mutex);\n  uv_async_init(uv_default_loop(), &m_async, completeCb);\n  m_async.data = this;\n}\n\nTableReceiver::~TableReceiver()\n{\n  unregisterInterface();\n\n  m_cb.Reset();\n\n  uv_mutex_lock(&m_ev_mutex);\n  while (!m_eq.empty())\n  {\n    TableData *data = m_eq.front();\n    delete data;\n    m_eq.pop();\n  }\n  uv_mutex_unlock(&m_ev_mutex);\n\n  uv_mutex_destroy(&m_ev_mutex);\n}\n\nvoid TableReceiver::subscribe(const v8::Local<v8::Function> &fn)\n{\n  m_cb.SetFunction(fn);\n  registerInterface();\n}\n\nvoid TableReceiver::registerInterface()\n{\n  m_dvbteeParser->m_parser.subscribeTables(this);\n}\n\nvoid TableReceiver::unregisterInterface()\n{\n  m_dvbteeParser->m_parser.subscribeTables(NULL);\n}\n\nvoid TableReceiver::updateTable(uint8_t tId, dvbtee::decode::Table *table)\n{\n  uv_mutex_lock(&m_ev_mutex);\n  m_eq.push(new TableData(table->getTableid(), table->getDecoderName(), table->toJson()));\n  uv_mutex_unlock(&m_ev_mutex);\n\n  uv_async_send(&m_async);\n}\n\n#if defined(NODE_MAJOR_VERSION) && (NODE_MAJOR_VERSION == 0 && \\\n    defined(NODE_MINOR_VERSION) && (NODE_MINOR_VERSION < 12))\n\nclass JSON {\npublic:\n  static v8::Local<v8::Value> Parse(v8::Local<v8::Value> jsonString)\n  {\n    return JSON::instance().call(\"parse\", jsonString);\n  }\n\nprivate:\n  Nan::Callback m_callback;\n\n  static JSON& instance()\n  {\n    static JSON i;\n    return i;\n  }\n\n  JSON()\n  {\n    v8::Local<v8::Value> globalJSON = Nan::GetCurrentContext()->Global()->Get(Nan::New(\"JSON\").ToLocalChecked());\n\n    if (globalJSON->IsObject()) {\n      v8::Local<v8::Value> parseMethod = globalJSON->ToObject()->Get(Nan::New(\"parse\").ToLocalChecked());\n\n      if (!parseMethod.IsEmpty() && parseMethod->IsFunction()) {\n        m_callback.Reset(v8::Local<v8::Function>::Cast(parseMethod));\n      }\n    }\n  }\n\n  ~JSON()\n  {\n    m_callback.Reset();\n  }\n\n  v8::Local<v8::Value> call(const char *method, v8::Local<v8::Value> arg)\n  {\n    return m_callback.Call(1, &arg);\n  }\n#if __cplusplus <= 199711L\nprivate:\n  JSON(JSON const&);\n  void operator=(JSON const&);\n#else\npublic:\n  JSON(JSON const&)           = delete;\n  void operator=(JSON const&) = delete;\n#endif\n};\n#define v8_JSON JSON\n#else\n#define v8_JSON v8::JSON\n#endif\n\nvoid TableReceiver::notify()\n{\n  Nan::HandleScope scope;\n  uv_mutex_lock(&m_ev_mutex);\n  while (!m_eq.empty())\n  {\n    TableData *data = m_eq.front();\n    uv_mutex_unlock(&m_ev_mutex);\n\n    if (!m_cb.IsEmpty()) {\n\n      v8::Local<v8::String> jsonStr = Nan::New(data->json).ToLocalChecked();\n      v8::Local<v8::Value> jsonObj = v8_JSON::Parse(jsonStr);\n\n      v8::Local<v8::Value> argv[] = {\n        Nan::New(data->tableId),\n        Nan::New(data->decoderName).ToLocalChecked(),\n        jsonObj\n      };\n\n      m_cb.Call(3, argv);\n    }\n\n    delete data;\n\n    uv_mutex_lock(&m_ev_mutex);\n    m_eq.pop();\n  }\n  uv_mutex_unlock(&m_ev_mutex);\n}\n\nvoid TableReceiver::completeCb(uv_async_t *handle\n#if NODE_MODULE_VERSION<=11\n                              , int status \/*UNUSED*\/\n#endif\n                              )\n{\n  TableReceiver* rcvr = static_cast<TableReceiver*>(handle->data);\n  rcvr->notify();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nNan::Persistent<v8::Function> dvbteeParser::constructor;\n\ndvbteeParser::dvbteeParser()\n: m_tableReceiver(this)\n{\n}\n\ndvbteeParser::~dvbteeParser() {\n}\n\nvoid dvbteeParser::Init(v8::Handle<v8::Object> exports) {\n  Nan::HandleScope scope;\n\n  \/\/ Prepare constructor template\n  v8::Local<v8::FunctionTemplate> tpl = Nan::New<v8::FunctionTemplate>(New);\n  tpl->SetClassName(Nan::New(\"Parser\").ToLocalChecked());\n  tpl->InstanceTemplate()->SetInternalFieldCount(1);\n\n  \/\/ Prototype\n  Nan::SetPrototypeMethod(tpl, \"reset\",        reset);\n  Nan::SetPrototypeMethod(tpl, \"feed\",         feed);\n  Nan::SetPrototypeMethod(tpl, \"push\",         feed); \/\/ deprecated\n  Nan::SetPrototypeMethod(tpl, \"parse\",        feed); \/\/ deprecated\n  Nan::SetPrototypeMethod(tpl, \"listenTables\", listenTables);\n\n  constructor.Reset(tpl->GetFunction());\n  exports->Set(Nan::New(\"Parser\").ToLocalChecked(), tpl->GetFunction());\n}\n\nvoid dvbteeParser::New(const Nan::FunctionCallbackInfo<v8::Value>& info) {\n  if (info.IsConstructCall()) {\n    \/\/ Invoked as constructor: `new dvbteeParser(...)`\n    dvbteeParser* obj = new dvbteeParser();\n    obj->Wrap(info.This());\n    info.GetReturnValue().Set(info.This());\n  } else {\n    \/\/ Invoked as plain function `dvbteeParser(...)`, turn into construct call.\n    const int argc = 0;\n    v8::Local<v8::Value> argv[argc] = { };\n    v8::Local<v8::Function> cons = Nan::New<v8::Function>(constructor);\n    info.GetReturnValue().Set(cons->NewInstance(argc, argv));\n  }\n}\n\nvoid dvbteeParser::listenTables(const Nan::FunctionCallbackInfo<v8::Value>& info) {\n  dvbteeParser* obj = ObjectWrap::Unwrap<dvbteeParser>(info.Holder());\n\n  int lastArg = info.Length() - 1;\n\n  if ((lastArg >= 0) && (info[lastArg]->IsFunction())) {\n    obj->m_tableReceiver.subscribe(info[lastArg].As<v8::Function>());\n  }\n\n  info.GetReturnValue().Set(info.Holder());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass ResetWorker : public Nan::AsyncWorker {\npublic:\n  ResetWorker(Nan::Callback *callback, const Nan::FunctionCallbackInfo<v8::Value>& info)\n    : Nan::AsyncWorker(callback)\n    {\n      m_obj = Nan::ObjectWrap::Unwrap<dvbteeParser>(info.Holder());\n    }\n  ~ResetWorker()\n    {\n    }\n\n  \/\/ Executed inside the worker-thread.\n  \/\/ It is not safe to access V8, or V8 data structures\n  \/\/ here, so everything we need for input and output\n  \/\/ should go on `this`.\n  void Execute () {\n    m_obj->m_parser.cleanup();\n    m_obj->m_parser.reset();\n  }\n\n  \/\/ Executed when the async work is complete\n  \/\/ this function will be run inside the main event loop\n  \/\/ so it is safe to use V8 again\n  void HandleOKCallback () {\n    Nan::HandleScope scope;\n\n    v8::Local<v8::Value> argv[] = {\n        Nan::Null()\n      , Nan::New<v8::Number>(0)\n    };\n\n    callback->Call(2, argv);\n  }\n\nprivate:\n  dvbteeParser* m_obj;\n};\n\nvoid dvbteeParser::reset(const Nan::FunctionCallbackInfo<v8::Value>& info) {\n\n  \/\/ If a callback function is supplied, this method will run async\n  \/\/ otherwise, it will run synchronous\n\n  int lastArg = info.Length() - 1;\n\n  if ((lastArg >= 0) && (info[lastArg]->IsFunction())) {\n\n    Nan::Callback *callback = new Nan::Callback(info[lastArg].As<v8::Function>());\n    Nan::AsyncQueueWorker(new ResetWorker(callback, info));\n\n  } else {\n    dvbteeParser* obj = ObjectWrap::Unwrap<dvbteeParser>(info.Holder());\n\n    obj->m_parser.cleanup();\n    obj->m_parser.reset();\n\n    info.GetReturnValue().Set(info.Holder());\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass FeedWorker : public Nan::AsyncWorker {\npublic:\n  FeedWorker(Nan::Callback *callback, const Nan::FunctionCallbackInfo<v8::Value>& info)\n    : Nan::AsyncWorker(callback)\n    , m_buf(NULL)\n    , m_buf_len(0)\n    , m_ret(-1)\n    {\n      m_obj = Nan::ObjectWrap::Unwrap<dvbteeParser>(info.Holder());\n\n      if ((info[0]->IsObject()) && (info[1]->IsNumber())) {\n\n        const char *key = \"buf\";\n        SaveToPersistent(key, info[0]);\n        m_buf = node::Buffer::Data(GetFromPersistent(key)->ToObject());\n        m_buf_len = info[1]->Uint32Value();\n      }\n    }\n  ~FeedWorker()\n    {\n    }\n\n  \/\/ Executed inside the worker-thread.\n  \/\/ It is not safe to access V8, or V8 data structures\n  \/\/ here, so everything we need for input and output\n  \/\/ should go on `this`.\n  void Execute () {\n    if ((m_buf) && (m_buf_len)) {\n      m_ret = m_obj->m_parser.feed(m_buf_len, (uint8_t*)m_buf);\n    }\n    if (m_ret < 0) {\n      SetErrorMessage(\"invalid buffer \/ length\");\n    }\n  }\n\n  \/\/ Executed when the async work is complete\n  \/\/ this function will be run inside the main event loop\n  \/\/ so it is safe to use V8 again\n  void HandleOKCallback () {\n    Nan::HandleScope scope;\n\n    v8::Local<v8::Value> argv[] = {\n        Nan::Null()\n      , Nan::New<v8::Number>(m_ret)\n    };\n\n    callback->Call(2, argv);\n  }\n\nprivate:\n  dvbteeParser* m_obj;\n  char* m_buf;\n  unsigned int m_buf_len;\n  int m_ret;\n};\n\n\nvoid dvbteeParser::feed(const Nan::FunctionCallbackInfo<v8::Value>& info) {\n\n  \/\/ If a callback function is supplied, this method will run async\n  \/\/ otherwise, it will run synchronous\n  \/\/\n  \/\/ Note: when packets are pushed to the parser, the parser will start\n  \/\/ generating async events containing PSIP table data regardless of\n  \/\/ whether this function was called synchronously or not\n\n  int lastArg = info.Length() - 1;\n\n  if ((lastArg >= 0) && (info[lastArg]->IsFunction())) {\n\n    Nan::Callback *callback = new Nan::Callback(info[lastArg].As<v8::Function>());\n    Nan::AsyncQueueWorker(new FeedWorker(callback, info));\n\n  } else {\n    dvbteeParser* obj = ObjectWrap::Unwrap<dvbteeParser>(info.Holder());\n    int ret = -1;\n\n    if ((info[0]->IsObject()) && (info[1]->IsNumber())) {\n\n      v8::Local<v8::Object> bufferObj = info[0]->ToObject();\n      unsigned int len = info[1]->Uint32Value();\n      const char* buf = node::Buffer::Data(bufferObj);\n\n      ret = obj->m_parser.feed(len, (uint8_t*)buf);\n    }\n\n    info.GetReturnValue().Set(Nan::New(ret));\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n *\n *   Copyright (c) 2012-2015 PX4 Development Team. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n *    notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n *    notice, this list of conditions and the following disclaimer in\n *    the documentation and\/or other materials provided with the\n *    distribution.\n * 3. Neither the name PX4 nor the names of its contributors may be\n *    used to endorse or promote products derived from this software\n *    without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n ****************************************************************************\/\n\n\/**\n * @file objects_common.cpp\n *\n * Common object definitions without a better home.\n *\/\n\n\/**\n * @defgroup topics List of all uORB topics.\n *\/\n\n#include <px4_config.h>\n\n#include <drivers\/drv_orb_dev.h>\n\n#include <drivers\/drv_mag.h>\nORB_DEFINE(sensor_mag, struct mag_report);\n\n#include <drivers\/drv_accel.h>\nORB_DEFINE(sensor_accel, struct accel_report);\n\n#include <drivers\/drv_gyro.h>\nORB_DEFINE(sensor_gyro, struct gyro_report);\n\n#include <drivers\/drv_baro.h>\nORB_DEFINE(sensor_baro, struct baro_report);\n\n#include <drivers\/drv_pwm_output.h>\nORB_DEFINE(output_pwm, struct pwm_output_values);\n\n#include <drivers\/drv_rc_input.h>\nORB_DEFINE(input_rc, struct rc_input_values);\n\n#include \"topics\/pwm_input.h\"\nORB_DEFINE(pwm_input, struct pwm_input_s);\n\n#include \"topics\/vehicle_attitude.h\"\nORB_DEFINE(vehicle_attitude, struct vehicle_attitude_s);\n\n#include \"topics\/sensor_combined.h\"\nORB_DEFINE(sensor_combined, struct sensor_combined_s);\n\n#include \"topics\/vehicle_gps_position.h\"\nORB_DEFINE(vehicle_gps_position, struct vehicle_gps_position_s);\n\n#include \"topics\/vehicle_land_detected.h\"\nORB_DEFINE(vehicle_land_detected, struct vehicle_land_detected_s);\n\n#include \"topics\/satellite_info.h\"\nORB_DEFINE(satellite_info, struct satellite_info_s);\n\n#include \"topics\/home_position.h\"\nORB_DEFINE(home_position, struct home_position_s);\n\n#include \"topics\/vehicle_status.h\"\nORB_DEFINE(vehicle_status, struct vehicle_status_s);\n\n#include \"topics\/vtol_vehicle_status.h\"\nORB_DEFINE(vtol_vehicle_status, struct vtol_vehicle_status_s);\n\n#include \"topics\/safety.h\"\nORB_DEFINE(safety, struct safety_s);\n\n#include \"topics\/battery_status.h\"\nORB_DEFINE(battery_status, struct battery_status_s);\n\n#include \"topics\/servorail_status.h\"\nORB_DEFINE(servorail_status, struct servorail_status_s);\n\n#include \"topics\/system_power.h\"\nORB_DEFINE(system_power, struct system_power_s);\n\n#include \"topics\/vehicle_global_position.h\"\nORB_DEFINE(vehicle_global_position, struct vehicle_global_position_s);\n\n#include \"topics\/vehicle_local_position.h\"\nORB_DEFINE(vehicle_local_position, struct vehicle_local_position_s);\n\n#include \"topics\/vehicle_vicon_position.h\"\nORB_DEFINE(vehicle_vicon_position, struct vehicle_vicon_position_s);\n\n#include \"topics\/vehicle_rates_setpoint.h\"\nORB_DEFINE(vehicle_rates_setpoint, struct vehicle_rates_setpoint_s);\n#include \"topics\/mc_virtual_rates_setpoint.h\"\nORB_DEFINE(mc_virtual_rates_setpoint, struct mc_virtual_rates_setpoint_s);\n#include \"topics\/fw_virtual_rates_setpoint.h\"\nORB_DEFINE(fw_virtual_rates_setpoint, struct fw_virtual_rates_setpoint_s);\n\n#include \"topics\/rc_channels.h\"\nORB_DEFINE(rc_channels, struct rc_channels_s);\n\n#include \"topics\/vehicle_command.h\"\nORB_DEFINE(vehicle_command, struct vehicle_command_s);\n\n#include \"topics\/vehicle_control_mode.h\"\nORB_DEFINE(vehicle_control_mode, struct vehicle_control_mode_s);\n\n#include \"topics\/vehicle_local_position_setpoint.h\"\nORB_DEFINE(vehicle_local_position_setpoint, struct vehicle_local_position_setpoint_s);\n\n#include \"topics\/position_setpoint_triplet.h\"\nORB_DEFINE(position_setpoint_triplet, struct position_setpoint_triplet_s);\n\n#include \"topics\/vehicle_global_velocity_setpoint.h\"\nORB_DEFINE(vehicle_global_velocity_setpoint, struct vehicle_global_velocity_setpoint_s);\n\n#include \"topics\/mission.h\"\nORB_DEFINE(offboard_mission, struct mission_s);\nORB_DEFINE(onboard_mission, struct mission_s);\n\n#include \"topics\/mission_result.h\"\nORB_DEFINE(mission_result, struct mission_result_s);\n\n#include \"topics\/geofence_result.h\"\nORB_DEFINE(geofence_result, struct geofence_result_s);\n\n#include \"topics\/fence.h\"\nORB_DEFINE(fence, unsigned);\n\n#include \"topics\/vehicle_attitude_setpoint.h\"\nORB_DEFINE(vehicle_attitude_setpoint, struct vehicle_attitude_setpoint_s);\nORB_DEFINE(mc_virtual_attitude_setpoint, struct vehicle_attitude_setpoint_s);\nORB_DEFINE(fw_virtual_attitude_setpoint, struct vehicle_attitude_setpoint_s);\n\n#include \"topics\/manual_control_setpoint.h\"\nORB_DEFINE(manual_control_setpoint, struct manual_control_setpoint_s);\n\n#include \"topics\/offboard_control_mode.h\"\nORB_DEFINE(offboard_control_mode, struct offboard_control_mode_s);\n\n#include \"topics\/optical_flow.h\"\nORB_DEFINE(optical_flow, struct optical_flow_s);\n\n#include \"topics\/filtered_bottom_flow.h\"\nORB_DEFINE(filtered_bottom_flow, struct filtered_bottom_flow_s);\n\n#include \"topics\/airspeed.h\"\nORB_DEFINE(airspeed, struct airspeed_s);\n\n#include \"topics\/differential_pressure.h\"\nORB_DEFINE(differential_pressure, struct differential_pressure_s);\n\n#include \"topics\/subsystem_info.h\"\nORB_DEFINE(subsystem_info, struct subsystem_info_s);\n\n\/* actuator controls, as requested by controller *\/\n#include \"topics\/actuator_controls.h\"\n#include \"topics\/actuator_controls_0.h\"\nORB_DEFINE(actuator_controls_0, struct actuator_controls_0_s);\n#include \"topics\/actuator_controls_1.h\"\nORB_DEFINE(actuator_controls_1, struct actuator_controls_1_s);\n#include \"topics\/actuator_controls_2.h\"\nORB_DEFINE(actuator_controls_2, struct actuator_controls_2_s);\n#include \"topics\/actuator_controls_3.h\"\nORB_DEFINE(actuator_controls_3, struct actuator_controls_3_s);\n\/\/Virtual control groups, used for VTOL operation\n#include \"topics\/actuator_controls_virtual_mc.h\"\nORB_DEFINE(actuator_controls_virtual_mc, struct actuator_controls_virtual_mc_s);\n#include \"topics\/actuator_controls_virtual_fw.h\"\nORB_DEFINE(actuator_controls_virtual_fw, struct actuator_controls_virtual_fw_s);\n\n#include \"topics\/actuator_armed.h\"\nORB_DEFINE(actuator_armed, struct actuator_armed_s);\n\n#include \"topics\/actuator_outputs.h\"\nORB_DEFINE(actuator_outputs, struct actuator_outputs_s);\n\n#include \"topics\/actuator_direct.h\"\nORB_DEFINE(actuator_direct, struct actuator_direct_s);\n\n#include \"topics\/multirotor_motor_limits.h\"\nORB_DEFINE(multirotor_motor_limits, struct multirotor_motor_limits_s);\n\n#include \"topics\/telemetry_status.h\"\nORB_DEFINE(telemetry_status_0, struct telemetry_status_s);\nORB_DEFINE(telemetry_status_1, struct telemetry_status_s);\nORB_DEFINE(telemetry_status_2, struct telemetry_status_s);\nORB_DEFINE(telemetry_status_3, struct telemetry_status_s);\n\n#include \"topics\/test_motor.h\"\nORB_DEFINE(test_motor, struct test_motor_s);\n\n#include \"topics\/debug_key_value.h\"\nORB_DEFINE(debug_key_value, struct debug_key_value_s);\n\n#include \"topics\/navigation_capabilities.h\"\nORB_DEFINE(navigation_capabilities, struct navigation_capabilities_s);\n\n#include \"topics\/esc_status.h\"\nORB_DEFINE(esc_status, struct esc_status_s);\n\n#include \"topics\/encoders.h\"\nORB_DEFINE(encoders, struct encoders_s);\n\n#include \"topics\/estimator_status.h\"\nORB_DEFINE(estimator_status, struct estimator_status_s);\n\n#include \"topics\/vision_position_estimate.h\"\nORB_DEFINE(vision_position_estimate, struct vision_position_estimate_s);\n\n#include \"topics\/vehicle_force_setpoint.h\"\nORB_DEFINE(vehicle_force_setpoint, struct vehicle_force_setpoint_s);\n\n#include \"topics\/tecs_status.h\"\nORB_DEFINE(tecs_status, struct tecs_status_s);\n\n#include \"topics\/wind_estimate.h\"\nORB_DEFINE(wind_estimate, struct wind_estimate_s);\n\n#include \"topics\/rc_parameter_map.h\"\nORB_DEFINE(rc_parameter_map, struct rc_parameter_map_s);\n\n#include \"topics\/time_offset.h\"\nORB_DEFINE(time_offset, struct time_offset_s);\n\n#include \"topics\/mc_att_ctrl_status.h\"\nORB_DEFINE(mc_att_ctrl_status, struct mc_att_ctrl_status_s);\n\n#include \"topics\/distance_sensor.h\"\nORB_DEFINE(distance_sensor, struct distance_sensor_s);\n<commit_msg>uORB: Fix missing objects_common entries<commit_after>\/****************************************************************************\n *\n *   Copyright (c) 2012-2015 PX4 Development Team. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n *    notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n *    notice, this list of conditions and the following disclaimer in\n *    the documentation and\/or other materials provided with the\n *    distribution.\n * 3. Neither the name PX4 nor the names of its contributors may be\n *    used to endorse or promote products derived from this software\n *    without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n ****************************************************************************\/\n\n\/**\n * @file objects_common.cpp\n *\n * Common object definitions without a better home.\n *\/\n\n\/**\n * @defgroup topics List of all uORB topics.\n *\/\n\n#include <px4_config.h>\n\n#include <drivers\/drv_orb_dev.h>\n\n#include <drivers\/drv_mag.h>\nORB_DEFINE(sensor_mag, struct mag_report);\n\n#include <drivers\/drv_accel.h>\nORB_DEFINE(sensor_accel, struct accel_report);\n\n#include <drivers\/drv_gyro.h>\nORB_DEFINE(sensor_gyro, struct gyro_report);\n\n#include <drivers\/drv_baro.h>\nORB_DEFINE(sensor_baro, struct baro_report);\n\n#include <drivers\/drv_pwm_output.h>\nORB_DEFINE(output_pwm, struct pwm_output_values);\n\n#include <drivers\/drv_rc_input.h>\nORB_DEFINE(input_rc, struct rc_input_values);\n\n#include \"topics\/pwm_input.h\"\nORB_DEFINE(pwm_input, struct pwm_input_s);\n\n#include \"topics\/vehicle_attitude.h\"\nORB_DEFINE(vehicle_attitude, struct vehicle_attitude_s);\n\n#include \"topics\/sensor_combined.h\"\nORB_DEFINE(sensor_combined, struct sensor_combined_s);\n\n#include \"topics\/vehicle_gps_position.h\"\nORB_DEFINE(vehicle_gps_position, struct vehicle_gps_position_s);\n\n#include \"topics\/vehicle_land_detected.h\"\nORB_DEFINE(vehicle_land_detected, struct vehicle_land_detected_s);\n\n#include \"topics\/satellite_info.h\"\nORB_DEFINE(satellite_info, struct satellite_info_s);\n\n#include \"topics\/home_position.h\"\nORB_DEFINE(home_position, struct home_position_s);\n\n#include \"topics\/vehicle_status.h\"\nORB_DEFINE(vehicle_status, struct vehicle_status_s);\n\n#include \"topics\/vtol_vehicle_status.h\"\nORB_DEFINE(vtol_vehicle_status, struct vtol_vehicle_status_s);\n\n#include \"topics\/safety.h\"\nORB_DEFINE(safety, struct safety_s);\n\n#include \"topics\/battery_status.h\"\nORB_DEFINE(battery_status, struct battery_status_s);\n\n#include \"topics\/servorail_status.h\"\nORB_DEFINE(servorail_status, struct servorail_status_s);\n\n#include \"topics\/system_power.h\"\nORB_DEFINE(system_power, struct system_power_s);\n\n#include \"topics\/vehicle_global_position.h\"\nORB_DEFINE(vehicle_global_position, struct vehicle_global_position_s);\n\n#include \"topics\/vehicle_local_position.h\"\nORB_DEFINE(vehicle_local_position, struct vehicle_local_position_s);\n\n#include \"topics\/vehicle_vicon_position.h\"\nORB_DEFINE(vehicle_vicon_position, struct vehicle_vicon_position_s);\n\n#include \"topics\/vehicle_rates_setpoint.h\"\nORB_DEFINE(vehicle_rates_setpoint, struct vehicle_rates_setpoint_s);\n#include \"topics\/mc_virtual_rates_setpoint.h\"\nORB_DEFINE(mc_virtual_rates_setpoint, struct mc_virtual_rates_setpoint_s);\n#include \"topics\/fw_virtual_rates_setpoint.h\"\nORB_DEFINE(fw_virtual_rates_setpoint, struct fw_virtual_rates_setpoint_s);\n\n#include \"topics\/rc_channels.h\"\nORB_DEFINE(rc_channels, struct rc_channels_s);\n\n#include \"topics\/vehicle_command.h\"\nORB_DEFINE(vehicle_command, struct vehicle_command_s);\n\n#include \"topics\/vehicle_control_mode.h\"\nORB_DEFINE(vehicle_control_mode, struct vehicle_control_mode_s);\n\n#include \"topics\/vehicle_local_position_setpoint.h\"\nORB_DEFINE(vehicle_local_position_setpoint, struct vehicle_local_position_setpoint_s);\n\n#include \"topics\/position_setpoint_triplet.h\"\nORB_DEFINE(position_setpoint_triplet, struct position_setpoint_triplet_s);\n\n#include \"topics\/vehicle_global_velocity_setpoint.h\"\nORB_DEFINE(vehicle_global_velocity_setpoint, struct vehicle_global_velocity_setpoint_s);\n\n#include \"topics\/mission.h\"\nORB_DEFINE(offboard_mission, struct mission_s);\nORB_DEFINE(onboard_mission, struct mission_s);\n\n#include \"topics\/mission_result.h\"\nORB_DEFINE(mission_result, struct mission_result_s);\n\n#include \"topics\/geofence_result.h\"\nORB_DEFINE(geofence_result, struct geofence_result_s);\n\n#include \"topics\/fence.h\"\nORB_DEFINE(fence, struct fence_s);\n\n#include \"topics\/fence_vertex.h\"\nORB_DEFINE(fence_vertex, struct fence_vertex_s);\n\n#include \"topics\/vehicle_attitude_setpoint.h\"\nORB_DEFINE(vehicle_attitude_setpoint, struct vehicle_attitude_setpoint_s);\nORB_DEFINE(mc_virtual_attitude_setpoint, struct vehicle_attitude_setpoint_s);\nORB_DEFINE(fw_virtual_attitude_setpoint, struct vehicle_attitude_setpoint_s);\n\n#include \"topics\/manual_control_setpoint.h\"\nORB_DEFINE(manual_control_setpoint, struct manual_control_setpoint_s);\n\n#include \"topics\/offboard_control_mode.h\"\nORB_DEFINE(offboard_control_mode, struct offboard_control_mode_s);\n\n#include \"topics\/optical_flow.h\"\nORB_DEFINE(optical_flow, struct optical_flow_s);\n\n#include \"topics\/filtered_bottom_flow.h\"\nORB_DEFINE(filtered_bottom_flow, struct filtered_bottom_flow_s);\n\n#include \"topics\/airspeed.h\"\nORB_DEFINE(airspeed, struct airspeed_s);\n\n#include \"topics\/differential_pressure.h\"\nORB_DEFINE(differential_pressure, struct differential_pressure_s);\n\n#include \"topics\/subsystem_info.h\"\nORB_DEFINE(subsystem_info, struct subsystem_info_s);\n\n\/* actuator controls, as requested by controller *\/\n#include \"topics\/actuator_controls.h\"\n#include \"topics\/actuator_controls_0.h\"\nORB_DEFINE(actuator_controls_0, struct actuator_controls_0_s);\n#include \"topics\/actuator_controls_1.h\"\nORB_DEFINE(actuator_controls_1, struct actuator_controls_1_s);\n#include \"topics\/actuator_controls_2.h\"\nORB_DEFINE(actuator_controls_2, struct actuator_controls_2_s);\n#include \"topics\/actuator_controls_3.h\"\nORB_DEFINE(actuator_controls_3, struct actuator_controls_3_s);\n\/\/Virtual control groups, used for VTOL operation\n#include \"topics\/actuator_controls_virtual_mc.h\"\nORB_DEFINE(actuator_controls_virtual_mc, struct actuator_controls_virtual_mc_s);\n#include \"topics\/actuator_controls_virtual_fw.h\"\nORB_DEFINE(actuator_controls_virtual_fw, struct actuator_controls_virtual_fw_s);\n\n#include \"topics\/actuator_armed.h\"\nORB_DEFINE(actuator_armed, struct actuator_armed_s);\n\n#include \"topics\/actuator_outputs.h\"\nORB_DEFINE(actuator_outputs, struct actuator_outputs_s);\n\n#include \"topics\/actuator_direct.h\"\nORB_DEFINE(actuator_direct, struct actuator_direct_s);\n\n#include \"topics\/multirotor_motor_limits.h\"\nORB_DEFINE(multirotor_motor_limits, struct multirotor_motor_limits_s);\n\n#include \"topics\/telemetry_status.h\"\nORB_DEFINE(telemetry_status_0, struct telemetry_status_s);\nORB_DEFINE(telemetry_status_1, struct telemetry_status_s);\nORB_DEFINE(telemetry_status_2, struct telemetry_status_s);\nORB_DEFINE(telemetry_status_3, struct telemetry_status_s);\n\n#include \"topics\/test_motor.h\"\nORB_DEFINE(test_motor, struct test_motor_s);\n\n#include \"topics\/debug_key_value.h\"\nORB_DEFINE(debug_key_value, struct debug_key_value_s);\n\n#include \"topics\/navigation_capabilities.h\"\nORB_DEFINE(navigation_capabilities, struct navigation_capabilities_s);\n\n#include \"topics\/esc_status.h\"\nORB_DEFINE(esc_status, struct esc_status_s);\n\n#include \"topics\/esc_report.h\"\nORB_DEFINE(esc_report, struct esc_report_s);\n\n#include \"topics\/encoders.h\"\nORB_DEFINE(encoders, struct encoders_s);\n\n#include \"topics\/estimator_status.h\"\nORB_DEFINE(estimator_status, struct estimator_status_s);\n\n#include \"topics\/vision_position_estimate.h\"\nORB_DEFINE(vision_position_estimate, struct vision_position_estimate_s);\n\n#include \"topics\/vehicle_force_setpoint.h\"\nORB_DEFINE(vehicle_force_setpoint, struct vehicle_force_setpoint_s);\n\n#include \"topics\/tecs_status.h\"\nORB_DEFINE(tecs_status, struct tecs_status_s);\n\n#include \"topics\/wind_estimate.h\"\nORB_DEFINE(wind_estimate, struct wind_estimate_s);\n\n#include \"topics\/rc_parameter_map.h\"\nORB_DEFINE(rc_parameter_map, struct rc_parameter_map_s);\n\n#include \"topics\/time_offset.h\"\nORB_DEFINE(time_offset, struct time_offset_s);\n\n#include \"topics\/mc_att_ctrl_status.h\"\nORB_DEFINE(mc_att_ctrl_status, struct mc_att_ctrl_status_s);\n\n#include \"topics\/distance_sensor.h\"\nORB_DEFINE(distance_sensor, struct distance_sensor_s);\n<|endoftext|>"}
{"text":"<commit_before>#include \"config.h\"\n\n#include <iostream>\n#include <cstring>\n\n#include <openssl\/md5.h>\n#include <openssl\/sha.h>\n\n#include \"hash.hh\"\n#include \"archive.hh\"\n#include \"util.hh\"\n\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n\n\nnamespace nix {\n\n\nHash::Hash()\n{\n    type = htUnknown;\n    hashSize = 0;\n    memset(hash, 0, maxHashSize);\n}\n\n\nHash::Hash(HashType type)\n{\n    this->type = type;\n    if (type == htMD5) hashSize = md5HashSize;\n    else if (type == htSHA1) hashSize = sha1HashSize;\n    else if (type == htSHA256) hashSize = sha256HashSize;\n    else if (type == htSHA512) hashSize = sha512HashSize;\n    else abort();\n    assert(hashSize <= maxHashSize);\n    memset(hash, 0, maxHashSize);\n}\n\n\nbool Hash::operator == (const Hash & h2) const\n{\n    if (hashSize != h2.hashSize) return false;\n    for (unsigned int i = 0; i < hashSize; i++)\n        if (hash[i] != h2.hash[i]) return false;\n    return true;\n}\n\n\nbool Hash::operator != (const Hash & h2) const\n{\n    return !(*this == h2);\n}\n\n\nbool Hash::operator < (const Hash & h) const\n{\n    for (unsigned int i = 0; i < hashSize; i++) {\n        if (hash[i] < h.hash[i]) return true;\n        if (hash[i] > h.hash[i]) return false;\n    }\n    return false;\n}\n\n\nstd::string Hash::to_string(bool base32) const\n{\n    return printHashType(type) + \":\" + (base32 ? printHash32(*this) : printHash(*this));\n}\n\n\nconst string base16Chars = \"0123456789abcdef\";\n\n\nstring printHash(const Hash & hash)\n{\n    char buf[hash.hashSize * 2];\n    for (unsigned int i = 0; i < hash.hashSize; i++) {\n        buf[i * 2] = base16Chars[hash.hash[i] >> 4];\n        buf[i * 2 + 1] = base16Chars[hash.hash[i] & 0x0f];\n    }\n    return string(buf, hash.hashSize * 2);\n}\n\n\nHash parseHash(const string & s)\n{\n    string::size_type colon = s.find(':');\n    if (colon == string::npos)\n        throw BadHash(format(\"invalid hash ‘%s’\") % s);\n    string hts = string(s, 0, colon);\n    HashType ht = parseHashType(hts);\n    if (ht == htUnknown)\n        throw BadHash(format(\"unknown hash type ‘%s’\") % hts);\n    return parseHash16or32(ht, string(s, colon + 1));\n}\n\n\nHash parseHash(HashType ht, const string & s)\n{\n    Hash hash(ht);\n    if (s.length() != hash.hashSize * 2)\n        throw BadHash(format(\"invalid hash ‘%1%’\") % s);\n    for (unsigned int i = 0; i < hash.hashSize; i++) {\n        string s2(s, i * 2, 2);\n        if (!isxdigit(s2[0]) || !isxdigit(s2[1]))\n            throw BadHash(format(\"invalid hash ‘%1%’\") % s);\n        std::istringstream str(s2);\n        int n;\n        str >> std::hex >> n;\n        hash.hash[i] = n;\n    }\n    return hash;\n}\n\n\n\/\/ omitted: E O U T\nconst string base32Chars = \"0123456789abcdfghijklmnpqrsvwxyz\";\n\n\nstring printHash32(const Hash & hash)\n{\n    assert(hash.hashSize);\n    size_t len = hash.base32Len();\n    assert(len);\n\n    string s;\n    s.reserve(len);\n\n    for (int n = len - 1; n >= 0; n--) {\n        unsigned int b = n * 5;\n        unsigned int i = b \/ 8;\n        unsigned int j = b % 8;\n        unsigned char c =\n            (hash.hash[i] >> j)\n            | (i >= hash.hashSize - 1 ? 0 : hash.hash[i + 1] << (8 - j));\n        s.push_back(base32Chars[c & 0x1f]);\n    }\n\n    return s;\n}\n\n\nstring printHash16or32(const Hash & hash)\n{\n    return hash.type == htMD5 ? printHash(hash) : printHash32(hash);\n}\n\n\nHash parseHash32(HashType ht, const string & s)\n{\n    Hash hash(ht);\n    size_t len = hash.base32Len();\n    assert(s.size() == len);\n\n    for (unsigned int n = 0; n < len; ++n) {\n        char c = s[len - n - 1];\n        unsigned char digit;\n        for (digit = 0; digit < base32Chars.size(); ++digit) \/* !!! slow *\/\n            if (base32Chars[digit] == c) break;\n        if (digit >= 32)\n            throw BadHash(format(\"invalid base-32 hash ‘%1%’\") % s);\n        unsigned int b = n * 5;\n        unsigned int i = b \/ 8;\n        unsigned int j = b % 8;\n        hash.hash[i] |= digit << j;\n        if (i < hash.hashSize - 1) hash.hash[i + 1] |= digit >> (8 - j);\n    }\n\n    return hash;\n}\n\n\nHash parseHash16or32(HashType ht, const string & s)\n{\n    Hash hash(ht);\n    if (s.size() == hash.hashSize * 2)\n        \/* hexadecimal representation *\/\n        hash = parseHash(ht, s);\n    else if (s.size() == hash.base32Len())\n        \/* base-32 representation *\/\n        hash = parseHash32(ht, s);\n    else\n        throw BadHash(format(\"hash ‘%1%’ has wrong length for hash type ‘%2%’\")\n            % s % printHashType(ht));\n    return hash;\n}\n\n\nbool isHash(const string & s)\n{\n    if (s.length() != 32) return false;\n    for (int i = 0; i < 32; i++) {\n        char c = s[i];\n        if (!((c >= '0' && c <= '9') ||\n              (c >= 'a' && c <= 'f')))\n            return false;\n    }\n    return true;\n}\n\n\nunion Ctx\n{\n    MD5_CTX md5;\n    SHA_CTX sha1;\n    SHA256_CTX sha256;\n    SHA512_CTX sha512;\n};\n\n\nstatic void start(HashType ht, Ctx & ctx)\n{\n    if (ht == htMD5) MD5_Init(&ctx.md5);\n    else if (ht == htSHA1) SHA1_Init(&ctx.sha1);\n    else if (ht == htSHA256) SHA256_Init(&ctx.sha256);\n    else if (ht == htSHA512) SHA512_Init(&ctx.sha512);\n}\n\n\nstatic void update(HashType ht, Ctx & ctx,\n    const unsigned char * bytes, unsigned int len)\n{\n    if (ht == htMD5) MD5_Update(&ctx.md5, bytes, len);\n    else if (ht == htSHA1) SHA1_Update(&ctx.sha1, bytes, len);\n    else if (ht == htSHA256) SHA256_Update(&ctx.sha256, bytes, len);\n    else if (ht == htSHA512) SHA512_Update(&ctx.sha512, bytes, len);\n}\n\n\nstatic void finish(HashType ht, Ctx & ctx, unsigned char * hash)\n{\n    if (ht == htMD5) MD5_Final(hash, &ctx.md5);\n    else if (ht == htSHA1) SHA1_Final(hash, &ctx.sha1);\n    else if (ht == htSHA256) SHA256_Final(hash, &ctx.sha256);\n    else if (ht == htSHA512) SHA512_Final(hash, &ctx.sha512);\n}\n\n\nHash hashString(HashType ht, const string & s)\n{\n    Ctx ctx;\n    Hash hash(ht);\n    start(ht, ctx);\n    update(ht, ctx, (const unsigned char *) s.data(), s.length());\n    finish(ht, ctx, hash.hash);\n    return hash;\n}\n\n\nHash hashFile(HashType ht, const Path & path)\n{\n    Ctx ctx;\n    Hash hash(ht);\n    start(ht, ctx);\n\n    AutoCloseFD fd = open(path.c_str(), O_RDONLY | O_CLOEXEC);\n    if (!fd) throw SysError(format(\"opening file ‘%1%’\") % path);\n\n    unsigned char buf[8192];\n    ssize_t n;\n    while ((n = read(fd.get(), buf, sizeof(buf)))) {\n        checkInterrupt();\n        if (n == -1) throw SysError(format(\"reading file ‘%1%’\") % path);\n        update(ht, ctx, buf, n);\n    }\n\n    finish(ht, ctx, hash.hash);\n    return hash;\n}\n\n\nHashSink::HashSink(HashType ht) : ht(ht)\n{\n    ctx = new Ctx;\n    bytes = 0;\n    start(ht, *ctx);\n}\n\nHashSink::~HashSink()\n{\n    bufPos = 0;\n    delete ctx;\n}\n\nvoid HashSink::write(const unsigned char * data, size_t len)\n{\n    bytes += len;\n    update(ht, *ctx, data, len);\n}\n\nHashResult HashSink::finish()\n{\n    flush();\n    Hash hash(ht);\n    nix::finish(ht, *ctx, hash.hash);\n    return HashResult(hash, bytes);\n}\n\nHashResult HashSink::currentHash()\n{\n    flush();\n    Ctx ctx2 = *ctx;\n    Hash hash(ht);\n    nix::finish(ht, ctx2, hash.hash);\n    return HashResult(hash, bytes);\n}\n\n\nHashResult hashPath(\n    HashType ht, const Path & path, PathFilter & filter)\n{\n    HashSink sink(ht);\n    dumpPath(path, sink, filter);\n    return sink.finish();\n}\n\n\nHash compressHash(const Hash & hash, unsigned int newSize)\n{\n    Hash h;\n    h.hashSize = newSize;\n    for (unsigned int i = 0; i < hash.hashSize; ++i)\n        h.hash[i % newSize] ^= hash.hash[i];\n    return h;\n}\n\n\nHashType parseHashType(const string & s)\n{\n    if (s == \"md5\") return htMD5;\n    else if (s == \"sha1\") return htSHA1;\n    else if (s == \"sha256\") return htSHA256;\n    else if (s == \"sha512\") return htSHA512;\n    else return htUnknown;\n}\n\n\nstring printHashType(HashType ht)\n{\n    if (ht == htMD5) return \"md5\";\n    else if (ht == htSHA1) return \"sha1\";\n    else if (ht == htSHA256) return \"sha256\";\n    else if (ht == htSHA512) return \"sha512\";\n    else abort();\n}\n\n\n}\n<commit_msg>Detect and disallow base32 hash overflow<commit_after>#include \"config.h\"\n\n#include <iostream>\n#include <cstring>\n\n#include <openssl\/md5.h>\n#include <openssl\/sha.h>\n\n#include \"hash.hh\"\n#include \"archive.hh\"\n#include \"util.hh\"\n\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n\n\nnamespace nix {\n\n\nHash::Hash()\n{\n    type = htUnknown;\n    hashSize = 0;\n    memset(hash, 0, maxHashSize);\n}\n\n\nHash::Hash(HashType type)\n{\n    this->type = type;\n    if (type == htMD5) hashSize = md5HashSize;\n    else if (type == htSHA1) hashSize = sha1HashSize;\n    else if (type == htSHA256) hashSize = sha256HashSize;\n    else if (type == htSHA512) hashSize = sha512HashSize;\n    else abort();\n    assert(hashSize <= maxHashSize);\n    memset(hash, 0, maxHashSize);\n}\n\n\nbool Hash::operator == (const Hash & h2) const\n{\n    if (hashSize != h2.hashSize) return false;\n    for (unsigned int i = 0; i < hashSize; i++)\n        if (hash[i] != h2.hash[i]) return false;\n    return true;\n}\n\n\nbool Hash::operator != (const Hash & h2) const\n{\n    return !(*this == h2);\n}\n\n\nbool Hash::operator < (const Hash & h) const\n{\n    for (unsigned int i = 0; i < hashSize; i++) {\n        if (hash[i] < h.hash[i]) return true;\n        if (hash[i] > h.hash[i]) return false;\n    }\n    return false;\n}\n\n\nstd::string Hash::to_string(bool base32) const\n{\n    return printHashType(type) + \":\" + (base32 ? printHash32(*this) : printHash(*this));\n}\n\n\nconst string base16Chars = \"0123456789abcdef\";\n\n\nstring printHash(const Hash & hash)\n{\n    char buf[hash.hashSize * 2];\n    for (unsigned int i = 0; i < hash.hashSize; i++) {\n        buf[i * 2] = base16Chars[hash.hash[i] >> 4];\n        buf[i * 2 + 1] = base16Chars[hash.hash[i] & 0x0f];\n    }\n    return string(buf, hash.hashSize * 2);\n}\n\n\nHash parseHash(const string & s)\n{\n    string::size_type colon = s.find(':');\n    if (colon == string::npos)\n        throw BadHash(format(\"invalid hash ‘%s’\") % s);\n    string hts = string(s, 0, colon);\n    HashType ht = parseHashType(hts);\n    if (ht == htUnknown)\n        throw BadHash(format(\"unknown hash type ‘%s’\") % hts);\n    return parseHash16or32(ht, string(s, colon + 1));\n}\n\n\nHash parseHash(HashType ht, const string & s)\n{\n    Hash hash(ht);\n    if (s.length() != hash.hashSize * 2)\n        throw BadHash(format(\"invalid hash ‘%1%’\") % s);\n    for (unsigned int i = 0; i < hash.hashSize; i++) {\n        string s2(s, i * 2, 2);\n        if (!isxdigit(s2[0]) || !isxdigit(s2[1]))\n            throw BadHash(format(\"invalid hash ‘%1%’\") % s);\n        std::istringstream str(s2);\n        int n;\n        str >> std::hex >> n;\n        hash.hash[i] = n;\n    }\n    return hash;\n}\n\n\n\/\/ omitted: E O U T\nconst string base32Chars = \"0123456789abcdfghijklmnpqrsvwxyz\";\n\n\nstring printHash32(const Hash & hash)\n{\n    assert(hash.hashSize);\n    size_t len = hash.base32Len();\n    assert(len);\n\n    string s;\n    s.reserve(len);\n\n    for (int n = len - 1; n >= 0; n--) {\n        unsigned int b = n * 5;\n        unsigned int i = b \/ 8;\n        unsigned int j = b % 8;\n        unsigned char c =\n            (hash.hash[i] >> j)\n            | (i >= hash.hashSize - 1 ? 0 : hash.hash[i + 1] << (8 - j));\n        s.push_back(base32Chars[c & 0x1f]);\n    }\n\n    return s;\n}\n\n\nstring printHash16or32(const Hash & hash)\n{\n    return hash.type == htMD5 ? printHash(hash) : printHash32(hash);\n}\n\n\nHash parseHash32(HashType ht, const string & s)\n{\n    Hash hash(ht);\n    size_t len = hash.base32Len();\n    assert(s.size() == len);\n\n    for (unsigned int n = 0; n < len; ++n) {\n        char c = s[len - n - 1];\n        unsigned char digit;\n        for (digit = 0; digit < base32Chars.size(); ++digit) \/* !!! slow *\/\n            if (base32Chars[digit] == c) break;\n        if (digit >= 32)\n            throw BadHash(format(\"invalid base-32 hash ‘%1%’\") % s);\n        unsigned int b = n * 5;\n        unsigned int i = b \/ 8;\n        unsigned int j = b % 8;\n        hash.hash[i] |= digit << j;\n\n        if (i < hash.hashSize - 1) {\n            hash.hash[i + 1] |= digit >> (8 - j);\n        } else {\n            if (digit >> (8 - j))\n                throw BadHash(format(\"invalid base-32 hash ‘%1%’\") % s);\n        }\n    }\n\n    return hash;\n}\n\n\nHash parseHash16or32(HashType ht, const string & s)\n{\n    Hash hash(ht);\n    if (s.size() == hash.hashSize * 2)\n        \/* hexadecimal representation *\/\n        hash = parseHash(ht, s);\n    else if (s.size() == hash.base32Len())\n        \/* base-32 representation *\/\n        hash = parseHash32(ht, s);\n    else\n        throw BadHash(format(\"hash ‘%1%’ has wrong length for hash type ‘%2%’\")\n            % s % printHashType(ht));\n    return hash;\n}\n\n\nbool isHash(const string & s)\n{\n    if (s.length() != 32) return false;\n    for (int i = 0; i < 32; i++) {\n        char c = s[i];\n        if (!((c >= '0' && c <= '9') ||\n              (c >= 'a' && c <= 'f')))\n            return false;\n    }\n    return true;\n}\n\n\nunion Ctx\n{\n    MD5_CTX md5;\n    SHA_CTX sha1;\n    SHA256_CTX sha256;\n    SHA512_CTX sha512;\n};\n\n\nstatic void start(HashType ht, Ctx & ctx)\n{\n    if (ht == htMD5) MD5_Init(&ctx.md5);\n    else if (ht == htSHA1) SHA1_Init(&ctx.sha1);\n    else if (ht == htSHA256) SHA256_Init(&ctx.sha256);\n    else if (ht == htSHA512) SHA512_Init(&ctx.sha512);\n}\n\n\nstatic void update(HashType ht, Ctx & ctx,\n    const unsigned char * bytes, unsigned int len)\n{\n    if (ht == htMD5) MD5_Update(&ctx.md5, bytes, len);\n    else if (ht == htSHA1) SHA1_Update(&ctx.sha1, bytes, len);\n    else if (ht == htSHA256) SHA256_Update(&ctx.sha256, bytes, len);\n    else if (ht == htSHA512) SHA512_Update(&ctx.sha512, bytes, len);\n}\n\n\nstatic void finish(HashType ht, Ctx & ctx, unsigned char * hash)\n{\n    if (ht == htMD5) MD5_Final(hash, &ctx.md5);\n    else if (ht == htSHA1) SHA1_Final(hash, &ctx.sha1);\n    else if (ht == htSHA256) SHA256_Final(hash, &ctx.sha256);\n    else if (ht == htSHA512) SHA512_Final(hash, &ctx.sha512);\n}\n\n\nHash hashString(HashType ht, const string & s)\n{\n    Ctx ctx;\n    Hash hash(ht);\n    start(ht, ctx);\n    update(ht, ctx, (const unsigned char *) s.data(), s.length());\n    finish(ht, ctx, hash.hash);\n    return hash;\n}\n\n\nHash hashFile(HashType ht, const Path & path)\n{\n    Ctx ctx;\n    Hash hash(ht);\n    start(ht, ctx);\n\n    AutoCloseFD fd = open(path.c_str(), O_RDONLY | O_CLOEXEC);\n    if (!fd) throw SysError(format(\"opening file ‘%1%’\") % path);\n\n    unsigned char buf[8192];\n    ssize_t n;\n    while ((n = read(fd.get(), buf, sizeof(buf)))) {\n        checkInterrupt();\n        if (n == -1) throw SysError(format(\"reading file ‘%1%’\") % path);\n        update(ht, ctx, buf, n);\n    }\n\n    finish(ht, ctx, hash.hash);\n    return hash;\n}\n\n\nHashSink::HashSink(HashType ht) : ht(ht)\n{\n    ctx = new Ctx;\n    bytes = 0;\n    start(ht, *ctx);\n}\n\nHashSink::~HashSink()\n{\n    bufPos = 0;\n    delete ctx;\n}\n\nvoid HashSink::write(const unsigned char * data, size_t len)\n{\n    bytes += len;\n    update(ht, *ctx, data, len);\n}\n\nHashResult HashSink::finish()\n{\n    flush();\n    Hash hash(ht);\n    nix::finish(ht, *ctx, hash.hash);\n    return HashResult(hash, bytes);\n}\n\nHashResult HashSink::currentHash()\n{\n    flush();\n    Ctx ctx2 = *ctx;\n    Hash hash(ht);\n    nix::finish(ht, ctx2, hash.hash);\n    return HashResult(hash, bytes);\n}\n\n\nHashResult hashPath(\n    HashType ht, const Path & path, PathFilter & filter)\n{\n    HashSink sink(ht);\n    dumpPath(path, sink, filter);\n    return sink.finish();\n}\n\n\nHash compressHash(const Hash & hash, unsigned int newSize)\n{\n    Hash h;\n    h.hashSize = newSize;\n    for (unsigned int i = 0; i < hash.hashSize; ++i)\n        h.hash[i % newSize] ^= hash.hash[i];\n    return h;\n}\n\n\nHashType parseHashType(const string & s)\n{\n    if (s == \"md5\") return htMD5;\n    else if (s == \"sha1\") return htSHA1;\n    else if (s == \"sha256\") return htSHA256;\n    else if (s == \"sha512\") return htSHA512;\n    else return htUnknown;\n}\n\n\nstring printHashType(HashType ht)\n{\n    if (ht == htMD5) return \"md5\";\n    else if (ht == htSHA1) return \"sha1\";\n    else if (ht == htSHA256) return \"sha256\";\n    else if (ht == htSHA512) return \"sha512\";\n    else abort();\n}\n\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"orwell\/callbacks\/ProcessHello.hpp\"\n\n#include \"orwell\/com\/RawMessage.hpp\"\n\n#include \"controller.pb.h\"\n#include \"server-game.pb.h\"\n\n#include \"orwell\/game\/Game.hpp\"\n#include \"orwell\/game\/Player.hpp\"\n#include \"orwell\/game\/Robot.hpp\"\n#include \"orwell\/com\/Sender.hpp\"\n\n#include <unistd.h>\n\n#include <log4cxx\/logger.h>\n#include <log4cxx\/helpers\/exception.h>\n\nusing namespace log4cxx;\nusing namespace log4cxx::helpers;\n\nusing orwell::messages::Hello;\nusing orwell::messages::Welcome;\nusing orwell::messages::Goodbye;\nusing orwell::com::RawMessage;\nusing std::string;\n\nnamespace orwell{\nnamespace callbacks{\n\nProcessHello::ProcessHello(\n\t\tstd::shared_ptr< com::Sender > ioPublisher,\n\t\tgame::Game & ioGame)\n\t: InterfaceProcess(ioPublisher, ioGame)\n{\n}\n\nvoid ProcessHello::execute()\n{\n\tLOG4CXX_INFO(_loggerPtr, \"ProcessHello::execute\");\n\n\torwell::messages::Hello const & anHelloMsg = static_cast<orwell::messages::Hello const & >(*_msg);\n\tstd::string const & aClientID = getArgument(\"RoutingID\").second;\n    \n\tstring aNewPlayerName = anHelloMsg.name();\n\tbool aPlayerAddedSuccess = _game->addPlayer( aNewPlayerName );\n\tstring aRobotForPlayer = _game->getRobotNameForPlayer( aNewPlayerName );\n\tstd::shared_ptr< ::orwell::game::Robot > aAvailableRobot;\n\n\tif ( aRobotForPlayer.empty() )\n\t{\n\t\taAvailableRobot = _game->getAvailableRobot();\n\t}\n\t\n\tif ((aAvailableRobot == nullptr and aRobotForPlayer.empty()) or not aPlayerAddedSuccess)\n\t{\n\t\tLOG4CXX_WARN(_loggerPtr, \"Impossible to process Hello : availableRobot=\" << aAvailableRobot.get() << \"- player added with success :\" << aPlayerAddedSuccess);\n\n\t\tGoodbye aGoodbye;\n\t\tRawMessage aReply(aClientID, \"Goodbye\", aGoodbye.SerializeAsString());\n\t\t_publisher->send( aReply );\n\t}\n\telse\n\t{\n\t\tLOG4CXX_INFO(_loggerPtr, \"Player \" << aNewPlayerName << \" is now linked to robot \" << aAvailableRobot->getName());\n\n\t\tif (aRobotForPlayer.empty())\n\t\t{\n\t\t\t_game->accessPlayer(aNewPlayerName).setRobot( aAvailableRobot->getName() );\n\t\t\t_game->accessRobot(aAvailableRobot->getName())->setPlayerName( aNewPlayerName );\n\t\t}\n\n\t\tWelcome aWelcome;\n\t\taWelcome.set_robot(aRobotForPlayer.empty() ? aAvailableRobot->getName() : aRobotForPlayer);\n\t\taWelcome.set_team( orwell::messages::RED ); \/\/currently stupidly hardoded\n\t\tRawMessage aReply(aClientID, \"Welcome\", aWelcome.SerializeAsString());\n\t\t_publisher->send( aReply );\n\t}\n}\n\n}\n}\n\n<commit_msg>Fix segmentation fault<commit_after>#include \"orwell\/callbacks\/ProcessHello.hpp\"\n\n#include \"orwell\/com\/RawMessage.hpp\"\n\n#include \"controller.pb.h\"\n#include \"server-game.pb.h\"\n\n#include \"orwell\/game\/Game.hpp\"\n#include \"orwell\/game\/Player.hpp\"\n#include \"orwell\/game\/Robot.hpp\"\n#include \"orwell\/com\/Sender.hpp\"\n\n#include <unistd.h>\n\n#include <log4cxx\/logger.h>\n#include <log4cxx\/helpers\/exception.h>\n\nusing namespace log4cxx;\nusing namespace log4cxx::helpers;\n\nusing orwell::messages::Hello;\nusing orwell::messages::Welcome;\nusing orwell::messages::Goodbye;\nusing orwell::com::RawMessage;\nusing std::string;\n\nnamespace orwell{\nnamespace callbacks{\n\nProcessHello::ProcessHello(\n\t\tstd::shared_ptr< com::Sender > ioPublisher,\n\t\tgame::Game & ioGame)\n\t: InterfaceProcess(ioPublisher, ioGame)\n{\n}\n\nvoid ProcessHello::execute()\n{\n\tLOG4CXX_INFO(_loggerPtr, \"ProcessHello::execute\");\n\n\torwell::messages::Hello const & anHelloMsg = static_cast<orwell::messages::Hello const & >(*_msg);\n\tstd::string const & aClientID = getArgument(\"RoutingID\").second;\n    \n\tstring aNewPlayerName = anHelloMsg.name();\n\tbool aPlayerAddedSuccess = _game->addPlayer( aNewPlayerName );\n\tstring aRobotForPlayer = _game->getRobotNameForPlayer( aNewPlayerName );\n\tstd::shared_ptr< ::orwell::game::Robot > aAvailableRobot;\n\n\tif ( aRobotForPlayer.empty() )\n\t{\n\t\taAvailableRobot = _game->getAvailableRobot();\n\t}\n\t\n\tif ((aAvailableRobot == nullptr and aRobotForPlayer.empty()) or not aPlayerAddedSuccess)\n\t{\n\t\tLOG4CXX_WARN(_loggerPtr, \"Impossible to process Hello : availableRobot=\" << aAvailableRobot.get() << \"- player added with success :\" << aPlayerAddedSuccess);\n\n\t\tGoodbye aGoodbye;\n\t\tRawMessage aReply(aClientID, \"Goodbye\", aGoodbye.SerializeAsString());\n\t\t_publisher->send( aReply );\n\t}\n\telse\n\t{\n\t\tLOG4CXX_INFO(_loggerPtr, \"Player \" << aNewPlayerName << \" is now linked to robot \" <<\n\t\t\t\t\t (aAvailableRobot.get() != nullptr? aAvailableRobot->getName() : aRobotForPlayer));\n\n\t\tif (aRobotForPlayer.empty())\n\t\t{\n\t\t\t_game->accessPlayer(aNewPlayerName).setRobot( aAvailableRobot->getName() );\n\t\t\t_game->accessRobot(aAvailableRobot->getName())->setPlayerName( aNewPlayerName );\n\t\t}\n\n\t\tWelcome aWelcome;\n\t\taWelcome.set_robot(aRobotForPlayer.empty() ? aAvailableRobot->getName() : aRobotForPlayer);\n\t\taWelcome.set_team( orwell::messages::RED ); \/\/currently stupidly hardoded\n\t\tRawMessage aReply(aClientID, \"Welcome\", aWelcome.SerializeAsString());\n\t\t_publisher->send( aReply );\n\t}\n}\n\n}\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\n\/\/ Copyright (c) 2013-2014 Quanta Research Cambridge, Inc.\n\n\/\/ Permission is hereby granted, free of charge, to any person\n\/\/ obtaining a copy of this software and associated documentation\n\/\/ files (the \"Software\"), to deal in the Software without\n\/\/ restriction, including without limitation the rights to use, copy,\n\/\/ modify, merge, publish, distribute, sublicense, and\/or sell copies\n\/\/ of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\n\/\/ The above copyright notice and this permission notice shall be\n\/\/ included in all copies or substantial portions of the Software.\n\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n\/\/ EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n\/\/ MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n\/\/ NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS\n\/\/ BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n\/\/ ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n\/\/ CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\/\/ SOFTWARE.\n#include <assert.h>\n#include \"dmaManager.h\"\n#include \"MMURequest.h\"\n#include \"MMUIndication.h\"\n#include \"MemServerRequest.h\"\n#include \"MemServerIndication.h\"\n\n#define PLATFORM_TILE 0\n\nclass PortalPoller;\nint mmu_error_limit = 20;\nint mem_error_limit = 20;\nconst char *dmaErrors[] = {\n\t\t\t\t\"None\",\n\t\t\t\t\"SGL Id out of range for read\",\n\t\t\t\t\"SGL Id out of range for write\",\n\t\t\t\t\"MMU out of range for read\",\n\t\t\t\t\"MMU out of range for write\",\n\t\t\t\t\"Offset out of range\",\n\t\t\t\t\"SGL Id invalid\",\n\t\t\t\t\"Tile tag out of range\"\n\t\t\t\t};\nclass MMUIndication : public MMUIndicationWrapper\n{\n  DmaManager *portalMemory;\n public:\n  MMUIndication(DmaManager *pm, unsigned int  id, int tile=PLATFORM_TILE) : MMUIndicationWrapper(id,tile), portalMemory(pm) {}\n  MMUIndication(DmaManager *pm, unsigned int  id, PortalTransportFunctions *item, void *param) : MMUIndicationWrapper(id, item, param), portalMemory(pm) {}\n  virtual void configResp(uint32_t pointer){\n    portalMemory->confResp(pointer);\n  }\n  virtual void error (uint32_t code, uint32_t pointer, uint64_t offset, uint64_t extra) {\n    fprintf(stderr, \"MMUIndication::error(code=0x%x:%s, pointer=0x%x, offset=0x%\" PRIx64 \" extra=0x%\" PRIx64 \"\\n\", code, dmaErrors[code], pointer, offset, extra);\n    if (--mmu_error_limit < 0)\n        exit(-1);\n  }\n  virtual void idResponse(uint32_t sglId){\n    portalMemory->sglIdResp(sglId);\n  }\n};\n\nclass MemServerIndication : public MemServerIndicationWrapper\n{\n  MemServerRequestProxy *memServerRequestProxy;\n  sem_t mtSem;\n  uint64_t mtCnt;\n  void init(){\n    if (sem_init(&mtSem, 0, 0))\n      PORTAL_PRINTF(\"MemServerIndication::init failed to init mtSem\\n\");\n  }\n public:\n  MemServerIndication(unsigned int  id, int tile=PLATFORM_TILE) : MemServerIndicationWrapper(id,tile), memServerRequestProxy(NULL) {init();}\n  MemServerIndication(MemServerRequestProxy *p, unsigned int  id, int tile=PLATFORM_TILE) : MemServerIndicationWrapper(id,tile), memServerRequestProxy(p) {init();}\n  virtual void addrResponse(uint64_t physAddr){\n    fprintf(stderr, \"DmaIndication::addrResponse(physAddr=%\" PRIx64 \")\\n\", physAddr);\n  }\n  virtual void reportStateDbg(const DmaDbgRec rec){\n    fprintf(stderr, \"MemServerIndication::reportStateDbg: {x:%08x y:%08x z:%08x w:%08x}\\n\", rec.x,rec.y,rec.z,rec.w);\n  }\n  virtual void reportMemoryTraffic(uint64_t words){\n    \/\/fprintf(stderr, \"reportMemoryTraffic: words=%\" PRIx64 \"\\n\", words);\n    mtCnt = words;\n    sem_post(&mtSem);\n  }\n  virtual void error (uint32_t code, uint32_t pointer, uint64_t offset, uint64_t extra) {\n    fprintf(stderr, \"MemServerIndication::error(code=%x, pointer=%x, offset=%\" PRIx64 \" extra=%\" PRIx64 \"\\n\", code, pointer, offset, extra);\n    if (--mem_error_limit < 0)\n      exit(-1);\n  }\n  uint64_t receiveMemoryTraffic(){\n    sem_wait(&mtSem);\n    return mtCnt; \n  }\n  uint64_t getMemoryTraffic(const ChannelType rc){\n    assert(memServerRequestProxy);\n    memServerRequestProxy->memoryTraffic(rc);\n    return receiveMemoryTraffic();\n  }\n};\n\nstatic MemServerRequestProxy *hostMemServerRequest;\nstatic MemServerIndication *hostMemServerIndication;\nstatic MMUIndication *mmuIndication;\nstatic DmaManager *dma;\nstatic pthread_once_t once_control = PTHREAD_ONCE_INIT;\nvoid platformInitOnce(void)\n{\n    hostMemServerRequest = new MemServerRequestProxy(PlatformIfcNames_MemServerRequestS2H, PLATFORM_TILE);\n    MMURequestProxy *dmap = new MMURequestProxy(PlatformIfcNames_MMURequestS2H, PLATFORM_TILE);\n    dma = new DmaManager(dmap);\n    hostMemServerIndication = new MemServerIndication(hostMemServerRequest, PlatformIfcNames_MemServerIndicationH2S, PLATFORM_TILE);\n    mmuIndication = new MMUIndication(dma, PlatformIfcNames_MMUIndicationH2S, PLATFORM_TILE);\n\n#ifdef MainClockPeriod\n    long req_freq = (long)(1e9 \/ MainClockPeriod);\n    long freq = 0;\n    setClockFrequency(0, req_freq, &freq);\n    fprintf(stderr, \"Requested FCLK[0]=%ld actually %ld\\n\", req_freq, freq);\n#endif\n}\nDmaManager *platformInit(void)\n{\n    pthread_once(&once_control, platformInitOnce);\n    return dma;\n}\n\nvoid platformStatistics(void)\n{\n    uint64_t cycles = portalTimerLap(0);\n    hostMemServerRequest->memoryTraffic(ChannelType_Read);\n    uint64_t read_beats = hostMemServerIndication->receiveMemoryTraffic();\n    float read_util = (float)read_beats\/(float)cycles;\n    hostMemServerRequest->memoryTraffic(ChannelType_Write);\n    uint64_t write_beats = hostMemServerIndication->receiveMemoryTraffic();\n    float write_util = (float)write_beats\/(float)cycles;\n    fprintf(stderr, \"   read_beats: %lld\\n\", (long long)read_beats);\n    fprintf(stderr, \"  write_beats: %lld\\n\", (long long)write_beats);\n    fprintf(stderr, \"       cycles: %lld\\n\", (long long)cycles);\n    fprintf(stderr, \"memory utilization (beats\/cycle): read %f write %f\\n\", read_util, write_util);\n}\n<commit_msg>print out error name<commit_after>\n\/\/ Copyright (c) 2013-2014 Quanta Research Cambridge, Inc.\n\n\/\/ Permission is hereby granted, free of charge, to any person\n\/\/ obtaining a copy of this software and associated documentation\n\/\/ files (the \"Software\"), to deal in the Software without\n\/\/ restriction, including without limitation the rights to use, copy,\n\/\/ modify, merge, publish, distribute, sublicense, and\/or sell copies\n\/\/ of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\n\/\/ The above copyright notice and this permission notice shall be\n\/\/ included in all copies or substantial portions of the Software.\n\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n\/\/ EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n\/\/ MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n\/\/ NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS\n\/\/ BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n\/\/ ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n\/\/ CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\/\/ SOFTWARE.\n#include <assert.h>\n#include \"dmaManager.h\"\n#include \"MMURequest.h\"\n#include \"MMUIndication.h\"\n#include \"MemServerRequest.h\"\n#include \"MemServerIndication.h\"\n\n#define PLATFORM_TILE 0\n\nclass PortalPoller;\nint mmu_error_limit = 20;\nint mem_error_limit = 20;\nconst char *dmaErrors[] = {\n\t\t\t\t\"None\",\n\t\t\t\t\"SGL Id out of range for read\",\n\t\t\t\t\"SGL Id out of range for write\",\n\t\t\t\t\"MMU out of range for read\",\n\t\t\t\t\"MMU out of range for write\",\n\t\t\t\t\"Offset out of range\",\n\t\t\t\t\"SGL Id invalid\",\n\t\t\t\t\"Tile tag out of range\"\n\t\t\t\t};\nclass MMUIndication : public MMUIndicationWrapper\n{\n  DmaManager *portalMemory;\n public:\n  MMUIndication(DmaManager *pm, unsigned int  id, int tile=PLATFORM_TILE) : MMUIndicationWrapper(id,tile), portalMemory(pm) {}\n  MMUIndication(DmaManager *pm, unsigned int  id, PortalTransportFunctions *item, void *param) : MMUIndicationWrapper(id, item, param), portalMemory(pm) {}\n  virtual void configResp(uint32_t pointer){\n    portalMemory->confResp(pointer);\n  }\n  virtual void error (uint32_t code, uint32_t pointer, uint64_t offset, uint64_t extra) {\n    fprintf(stderr, \"MMUIndication::error(code=0x%x:%s, pointer=0x%x, offset=0x%\" PRIx64 \" extra=0x%\" PRIx64 \"\\n\", code, dmaErrors[code], pointer, offset, extra);\n    if (--mmu_error_limit < 0)\n        exit(-1);\n  }\n  virtual void idResponse(uint32_t sglId){\n    portalMemory->sglIdResp(sglId);\n  }\n};\n\nclass MemServerIndication : public MemServerIndicationWrapper\n{\n  MemServerRequestProxy *memServerRequestProxy;\n  sem_t mtSem;\n  uint64_t mtCnt;\n  void init(){\n    if (sem_init(&mtSem, 0, 0))\n      PORTAL_PRINTF(\"MemServerIndication::init failed to init mtSem\\n\");\n  }\n public:\n  MemServerIndication(unsigned int  id, int tile=PLATFORM_TILE) : MemServerIndicationWrapper(id,tile), memServerRequestProxy(NULL) {init();}\n  MemServerIndication(MemServerRequestProxy *p, unsigned int  id, int tile=PLATFORM_TILE) : MemServerIndicationWrapper(id,tile), memServerRequestProxy(p) {init();}\n  virtual void addrResponse(uint64_t physAddr){\n    fprintf(stderr, \"DmaIndication::addrResponse(physAddr=%\" PRIx64 \")\\n\", physAddr);\n  }\n  virtual void reportStateDbg(const DmaDbgRec rec){\n    fprintf(stderr, \"MemServerIndication::reportStateDbg: {x:%08x y:%08x z:%08x w:%08x}\\n\", rec.x,rec.y,rec.z,rec.w);\n  }\n  virtual void reportMemoryTraffic(uint64_t words){\n    \/\/fprintf(stderr, \"reportMemoryTraffic: words=%\" PRIx64 \"\\n\", words);\n    mtCnt = words;\n    sem_post(&mtSem);\n  }\n  virtual void error (uint32_t code, uint32_t pointer, uint64_t offset, uint64_t extra) {\n    fprintf(stderr, \"MemServerIndication::error(code=%x:%s, pointer=%x, offset=%\" PRIx64 \" extra=%\" PRIx64 \"\\n\", code, dmaErrors[code], pointer, offset, extra);\n    if (--mem_error_limit < 0)\n      exit(-1);\n  }\n  uint64_t receiveMemoryTraffic(){\n    sem_wait(&mtSem);\n    return mtCnt; \n  }\n  uint64_t getMemoryTraffic(const ChannelType rc){\n    assert(memServerRequestProxy);\n    memServerRequestProxy->memoryTraffic(rc);\n    return receiveMemoryTraffic();\n  }\n};\n\nstatic MemServerRequestProxy *hostMemServerRequest;\nstatic MemServerIndication *hostMemServerIndication;\nstatic MMUIndication *mmuIndication;\nstatic DmaManager *dma;\nstatic pthread_once_t once_control = PTHREAD_ONCE_INIT;\nvoid platformInitOnce(void)\n{\n    hostMemServerRequest = new MemServerRequestProxy(PlatformIfcNames_MemServerRequestS2H, PLATFORM_TILE);\n    MMURequestProxy *dmap = new MMURequestProxy(PlatformIfcNames_MMURequestS2H, PLATFORM_TILE);\n    dma = new DmaManager(dmap);\n    hostMemServerIndication = new MemServerIndication(hostMemServerRequest, PlatformIfcNames_MemServerIndicationH2S, PLATFORM_TILE);\n    mmuIndication = new MMUIndication(dma, PlatformIfcNames_MMUIndicationH2S, PLATFORM_TILE);\n\n#ifdef MainClockPeriod\n    long req_freq = (long)(1e9 \/ MainClockPeriod);\n    long freq = 0;\n    setClockFrequency(0, req_freq, &freq);\n    fprintf(stderr, \"Requested FCLK[0]=%ld actually %ld\\n\", req_freq, freq);\n#endif\n}\nDmaManager *platformInit(void)\n{\n    pthread_once(&once_control, platformInitOnce);\n    return dma;\n}\n\nvoid platformStatistics(void)\n{\n    uint64_t cycles = portalTimerLap(0);\n    hostMemServerRequest->memoryTraffic(ChannelType_Read);\n    uint64_t read_beats = hostMemServerIndication->receiveMemoryTraffic();\n    float read_util = (float)read_beats\/(float)cycles;\n    hostMemServerRequest->memoryTraffic(ChannelType_Write);\n    uint64_t write_beats = hostMemServerIndication->receiveMemoryTraffic();\n    float write_util = (float)write_beats\/(float)cycles;\n    fprintf(stderr, \"   read_beats: %lld\\n\", (long long)read_beats);\n    fprintf(stderr, \"  write_beats: %lld\\n\", (long long)write_beats);\n    fprintf(stderr, \"       cycles: %lld\\n\", (long long)cycles);\n    fprintf(stderr, \"memory utilization (beats\/cycle): read %f write %f\\n\", read_util, write_util);\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\/ash\/launcher\/launcher_updater.h\"\n\n#include \"ash\/launcher\/launcher.h\"\n#include \"ash\/launcher\/launcher_model.h\"\n#include \"ash\/shell.h\"\n#include \"ash\/wm\/window_util.h\"\n#include \"chrome\/browser\/extensions\/extension_service.h\"\n#include \"chrome\/browser\/extensions\/extension_tab_helper.h\"\n#include \"chrome\/browser\/favicon\/favicon_tab_helper.h\"\n#include \"chrome\/browser\/tabs\/tab_strip_model.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/browser\/ui\/browser_window.h\"\n#include \"chrome\/browser\/ui\/tab_contents\/tab_contents_wrapper.h\"\n#include \"chrome\/browser\/ui\/views\/ash\/launcher\/chrome_launcher_delegate.h\"\n#include \"chrome\/browser\/web_applications\/web_app.h\"\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"grit\/ui_resources.h\"\n#include \"ui\/aura\/window.h\"\n#include \"ui\/base\/resource\/resource_bundle.h\"\n\nnamespace {\n\nChromeLauncherDelegate::AppType GetDelegateType(LauncherUpdater::Type type) {\n  switch (type) {\n    case LauncherUpdater::TYPE_APP_PANEL:\n      return ChromeLauncherDelegate::APP_TYPE_APP_PANEL;\n    case LauncherUpdater::TYPE_EXTENSION_PANEL:\n      return ChromeLauncherDelegate::APP_TYPE_EXTENSION_PANEL;\n    case LauncherUpdater::TYPE_TABBED:\n      NOTREACHED();\n  }\n  return ChromeLauncherDelegate::APP_TYPE_WINDOW;\n}\n\n}  \/\/ namespace\n\nLauncherUpdater::LauncherUpdater(aura::Window* window,\n                                 TabStripModel* tab_model,\n                                 ChromeLauncherDelegate* delegate,\n                                 Type type,\n                                 const std::string& app_id)\n    : window_(window),\n      tab_model_(tab_model),\n      launcher_delegate_(delegate),\n      type_(type),\n      app_id_(app_id),\n      is_incognito_(tab_model->profile()->GetOriginalProfile() !=\n                    tab_model->profile()),\n      item_id_(-1) {\n}\n\nLauncherUpdater::~LauncherUpdater() {\n  tab_model_->RemoveObserver(this);\n  if (item_id_ != -1)\n    launcher_delegate_->LauncherItemClosed(item_id_);\n}\n\nvoid LauncherUpdater::Init() {\n  tab_model_->AddObserver(this);\n  ash::LauncherItemStatus app_status =\n      ash::wm::IsActiveWindow(window_) ?\n          ash::STATUS_ACTIVE : ash::STATUS_RUNNING;\n  if (type_ != TYPE_TABBED) {\n    ChromeLauncherDelegate::AppType app_type = GetDelegateType(type_);\n    item_id_ = launcher_delegate_->CreateAppLauncherItem(\n        this, app_id_, app_type, app_status);\n  } else {\n    item_id_ = launcher_delegate_->CreateTabbedLauncherItem(\n        this,\n        is_incognito_ ? ChromeLauncherDelegate::STATE_INCOGNITO :\n                       ChromeLauncherDelegate::STATE_NOT_INCOGNITO,\n        app_status);\n  }\n  \/\/ In testing scenarios we can get tab strips with no active contents.\n  if (tab_model_->GetActiveTabContents())\n    UpdateLauncher(tab_model_->GetActiveTabContents());\n}\n\n\/\/ static\nLauncherUpdater* LauncherUpdater::Create(Browser* browser) {\n  Type type;\n  std::string app_id;\n  if (browser->type() == Browser::TYPE_TABBED) {\n    type = TYPE_TABBED;\n  } else if (browser->is_app()) {\n    if (browser->is_type_panel()) {\n      if (browser->app_type() == Browser::APP_TYPE_CHILD)\n        type = TYPE_EXTENSION_PANEL;\n      else\n        type = TYPE_APP_PANEL;\n    } else {\n      type = TYPE_TABBED;\n    }\n    app_id = web_app::GetExtensionIdFromApplicationName(browser->app_name());\n  } else {\n    return NULL;\n  }\n  LauncherUpdater* icon_updater = new LauncherUpdater(\n      browser->window()->GetNativeHandle(), browser->tabstrip_model(),\n      ChromeLauncherDelegate::instance(), type, app_id);\n  icon_updater->Init();\n  return icon_updater;\n}\n\nvoid LauncherUpdater::BrowserActivationStateChanged() {\n  launcher_delegate_->SetItemStatus(\n      item_id_,\n      ash::wm::IsActiveWindow(window_) ?\n          ash::STATUS_ACTIVE : ash::STATUS_RUNNING);\n}\n\nvoid LauncherUpdater::ActiveTabChanged(TabContentsWrapper* old_contents,\n                                       TabContentsWrapper* new_contents,\n                                       int index,\n                                       bool user_gesture) {\n  \/\/ Update immediately on a tab change.\n  UpdateLauncher(new_contents);\n}\n\nvoid LauncherUpdater::TabChangedAt(\n    TabContentsWrapper* tab,\n    int index,\n    TabStripModelObserver::TabChangeType change_type) {\n  if (index != tab_model_->active_index() ||\n      !(change_type != TabStripModelObserver::LOADING_ONLY &&\n        change_type != TabStripModelObserver::TITLE_NOT_LOADING)) {\n    return;\n  }\n\n  if (tab->favicon_tab_helper()->FaviconIsValid() ||\n      !tab->favicon_tab_helper()->ShouldDisplayFavicon()) {\n    \/\/ We have the favicon, update immediately.\n    UpdateLauncher(tab);\n  } else {\n    \/\/ Let the model know we're waiting. We delay updating as otherwise the user\n    \/\/ sees flicker as we fetch the favicon.\n    int item_index = launcher_model()->ItemIndexByID(item_id_);\n    if (item_index == -1)\n      return;\n    launcher_model()->SetPendingUpdate(item_index);\n  }\n}\n\nvoid LauncherUpdater::FaviconUpdated() {\n  UpdateLauncher(tab_model_->GetActiveTabContents());\n}\n\nvoid LauncherUpdater::UpdateLauncher(TabContentsWrapper* tab) {\n  if (!tab)\n    return;  \/\/ Assume the window is going to be closed if there are no tabs.\n\n  int item_index = launcher_model()->ItemIndexByID(item_id_);\n  if (item_index == -1)\n    return;\n\n  ash::LauncherItem item = launcher_model()->items()[item_index];\n  if (type_ != TYPE_TABBED) {\n    SkBitmap new_image;\n    if (type_ == TYPE_EXTENSION_PANEL) {\n      if (!favicon_loader_.get() ||\n          favicon_loader_->web_contents() != tab->web_contents()) {\n        favicon_loader_.reset(\n            new LauncherFaviconLoader(this, tab->web_contents()));\n      }\n      \/\/ Update the icon for app panels.\n      new_image = favicon_loader_->GetFavicon();\n      if (new_image.empty()) {\n        if (tab->extension_tab_helper()->GetExtensionAppIcon())\n          new_image = *tab->extension_tab_helper()->GetExtensionAppIcon();\n      }\n    } else {\n      \/\/ Use the app icon if we can.\n      if (tab->extension_tab_helper()->GetExtensionAppIcon())\n        new_image = *tab->extension_tab_helper()->GetExtensionAppIcon();\n      else\n        new_image = tab->favicon_tab_helper()->GetFavicon();\n    }\n    \/\/ Only update the icon if we have a new image, or none has been set yet.\n    \/\/ This avoids flickering to an empty image when a pinned app is opened.\n    if (!new_image.empty())\n      item.image = new_image;\n    else if (item.image.empty())\n      item.image = Extension::GetDefaultIcon(true);\n  } else {\n    if (tab->favicon_tab_helper()->ShouldDisplayFavicon()) {\n      item.image = tab->favicon_tab_helper()->GetFavicon();\n      if (item.image.empty()) {\n        item.image = *ResourceBundle::GetSharedInstance().GetBitmapNamed(\n            IDR_DEFAULT_FAVICON);\n      }\n    } else {\n      item.image = *ResourceBundle::GetSharedInstance().GetBitmapNamed(\n          IDR_DEFAULT_FAVICON);\n    }\n  }\n  launcher_model()->Set(item_index, item);\n}\n\nash::LauncherModel* LauncherUpdater::launcher_model() {\n  return launcher_delegate_->model();\n}\n<commit_msg>Treat Browser TYPE_POPUP as TYPE_TABBED in LauncherUpdater<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\/ash\/launcher\/launcher_updater.h\"\n\n#include \"ash\/launcher\/launcher.h\"\n#include \"ash\/launcher\/launcher_model.h\"\n#include \"ash\/shell.h\"\n#include \"ash\/wm\/window_util.h\"\n#include \"chrome\/browser\/extensions\/extension_service.h\"\n#include \"chrome\/browser\/extensions\/extension_tab_helper.h\"\n#include \"chrome\/browser\/favicon\/favicon_tab_helper.h\"\n#include \"chrome\/browser\/tabs\/tab_strip_model.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/browser\/ui\/browser_window.h\"\n#include \"chrome\/browser\/ui\/tab_contents\/tab_contents_wrapper.h\"\n#include \"chrome\/browser\/ui\/views\/ash\/launcher\/chrome_launcher_delegate.h\"\n#include \"chrome\/browser\/web_applications\/web_app.h\"\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"grit\/ui_resources.h\"\n#include \"ui\/aura\/window.h\"\n#include \"ui\/base\/resource\/resource_bundle.h\"\n\nnamespace {\n\nChromeLauncherDelegate::AppType GetDelegateType(LauncherUpdater::Type type) {\n  switch (type) {\n    case LauncherUpdater::TYPE_APP_PANEL:\n      return ChromeLauncherDelegate::APP_TYPE_APP_PANEL;\n    case LauncherUpdater::TYPE_EXTENSION_PANEL:\n      return ChromeLauncherDelegate::APP_TYPE_EXTENSION_PANEL;\n    case LauncherUpdater::TYPE_TABBED:\n      NOTREACHED();\n  }\n  return ChromeLauncherDelegate::APP_TYPE_WINDOW;\n}\n\n}  \/\/ namespace\n\nLauncherUpdater::LauncherUpdater(aura::Window* window,\n                                 TabStripModel* tab_model,\n                                 ChromeLauncherDelegate* delegate,\n                                 Type type,\n                                 const std::string& app_id)\n    : window_(window),\n      tab_model_(tab_model),\n      launcher_delegate_(delegate),\n      type_(type),\n      app_id_(app_id),\n      is_incognito_(tab_model->profile()->GetOriginalProfile() !=\n                    tab_model->profile()),\n      item_id_(-1) {\n}\n\nLauncherUpdater::~LauncherUpdater() {\n  tab_model_->RemoveObserver(this);\n  if (item_id_ != -1)\n    launcher_delegate_->LauncherItemClosed(item_id_);\n}\n\nvoid LauncherUpdater::Init() {\n  tab_model_->AddObserver(this);\n  ash::LauncherItemStatus app_status =\n      ash::wm::IsActiveWindow(window_) ?\n          ash::STATUS_ACTIVE : ash::STATUS_RUNNING;\n  if (type_ != TYPE_TABBED) {\n    ChromeLauncherDelegate::AppType app_type = GetDelegateType(type_);\n    item_id_ = launcher_delegate_->CreateAppLauncherItem(\n        this, app_id_, app_type, app_status);\n  } else {\n    item_id_ = launcher_delegate_->CreateTabbedLauncherItem(\n        this,\n        is_incognito_ ? ChromeLauncherDelegate::STATE_INCOGNITO :\n                       ChromeLauncherDelegate::STATE_NOT_INCOGNITO,\n        app_status);\n  }\n  \/\/ In testing scenarios we can get tab strips with no active contents.\n  if (tab_model_->GetActiveTabContents())\n    UpdateLauncher(tab_model_->GetActiveTabContents());\n}\n\n\/\/ static\nLauncherUpdater* LauncherUpdater::Create(Browser* browser) {\n  Type type;\n  std::string app_id;\n  if (browser->type() == Browser::TYPE_TABBED ||\n      browser->type() == Browser::TYPE_POPUP) {\n    type = TYPE_TABBED;\n  } else if (browser->is_app()) {\n    if (browser->is_type_panel()) {\n      if (browser->app_type() == Browser::APP_TYPE_CHILD)\n        type = TYPE_EXTENSION_PANEL;\n      else\n        type = TYPE_APP_PANEL;\n    } else {\n      type = TYPE_TABBED;\n    }\n    app_id = web_app::GetExtensionIdFromApplicationName(browser->app_name());\n  } else {\n    return NULL;\n  }\n  LauncherUpdater* icon_updater = new LauncherUpdater(\n      browser->window()->GetNativeHandle(), browser->tabstrip_model(),\n      ChromeLauncherDelegate::instance(), type, app_id);\n  icon_updater->Init();\n  return icon_updater;\n}\n\nvoid LauncherUpdater::BrowserActivationStateChanged() {\n  launcher_delegate_->SetItemStatus(\n      item_id_,\n      ash::wm::IsActiveWindow(window_) ?\n          ash::STATUS_ACTIVE : ash::STATUS_RUNNING);\n}\n\nvoid LauncherUpdater::ActiveTabChanged(TabContentsWrapper* old_contents,\n                                       TabContentsWrapper* new_contents,\n                                       int index,\n                                       bool user_gesture) {\n  \/\/ Update immediately on a tab change.\n  UpdateLauncher(new_contents);\n}\n\nvoid LauncherUpdater::TabChangedAt(\n    TabContentsWrapper* tab,\n    int index,\n    TabStripModelObserver::TabChangeType change_type) {\n  if (index != tab_model_->active_index() ||\n      !(change_type != TabStripModelObserver::LOADING_ONLY &&\n        change_type != TabStripModelObserver::TITLE_NOT_LOADING)) {\n    return;\n  }\n\n  if (tab->favicon_tab_helper()->FaviconIsValid() ||\n      !tab->favicon_tab_helper()->ShouldDisplayFavicon()) {\n    \/\/ We have the favicon, update immediately.\n    UpdateLauncher(tab);\n  } else {\n    \/\/ Let the model know we're waiting. We delay updating as otherwise the user\n    \/\/ sees flicker as we fetch the favicon.\n    int item_index = launcher_model()->ItemIndexByID(item_id_);\n    if (item_index == -1)\n      return;\n    launcher_model()->SetPendingUpdate(item_index);\n  }\n}\n\nvoid LauncherUpdater::FaviconUpdated() {\n  UpdateLauncher(tab_model_->GetActiveTabContents());\n}\n\nvoid LauncherUpdater::UpdateLauncher(TabContentsWrapper* tab) {\n  if (!tab)\n    return;  \/\/ Assume the window is going to be closed if there are no tabs.\n\n  int item_index = launcher_model()->ItemIndexByID(item_id_);\n  if (item_index == -1)\n    return;\n\n  ash::LauncherItem item = launcher_model()->items()[item_index];\n  if (type_ != TYPE_TABBED) {\n    SkBitmap new_image;\n    if (type_ == TYPE_EXTENSION_PANEL) {\n      if (!favicon_loader_.get() ||\n          favicon_loader_->web_contents() != tab->web_contents()) {\n        favicon_loader_.reset(\n            new LauncherFaviconLoader(this, tab->web_contents()));\n      }\n      \/\/ Update the icon for app panels.\n      new_image = favicon_loader_->GetFavicon();\n      if (new_image.empty()) {\n        if (tab->extension_tab_helper()->GetExtensionAppIcon())\n          new_image = *tab->extension_tab_helper()->GetExtensionAppIcon();\n      }\n    } else {\n      \/\/ Use the app icon if we can.\n      if (tab->extension_tab_helper()->GetExtensionAppIcon())\n        new_image = *tab->extension_tab_helper()->GetExtensionAppIcon();\n      else\n        new_image = tab->favicon_tab_helper()->GetFavicon();\n    }\n    \/\/ Only update the icon if we have a new image, or none has been set yet.\n    \/\/ This avoids flickering to an empty image when a pinned app is opened.\n    if (!new_image.empty())\n      item.image = new_image;\n    else if (item.image.empty())\n      item.image = Extension::GetDefaultIcon(true);\n  } else {\n    if (tab->favicon_tab_helper()->ShouldDisplayFavicon()) {\n      item.image = tab->favicon_tab_helper()->GetFavicon();\n      if (item.image.empty()) {\n        item.image = *ResourceBundle::GetSharedInstance().GetBitmapNamed(\n            IDR_DEFAULT_FAVICON);\n      }\n    } else {\n      item.image = *ResourceBundle::GetSharedInstance().GetBitmapNamed(\n          IDR_DEFAULT_FAVICON);\n    }\n  }\n  launcher_model()->Set(item_index, item);\n}\n\nash::LauncherModel* LauncherUpdater::launcher_model() {\n  return launcher_delegate_->model();\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 <set>\n#include <string>\n\n#include \"chrome\/browser\/download\/download_extensions.h\"\n\n#include \"base\/string_util.h\"\n#include \"net\/base\/mime_util.h\"\n#include \"net\/base\/net_util.h\"\n\nnamespace download_util {\n\n\/\/ For file extensions taken from mozilla:\n\n\/* ***** BEGIN LICENSE BLOCK *****\n * Version: MPL 1.1\/GPL 2.0\/LGPL 2.1\n *\n * The contents of this file are subject to the Mozilla Public License Version\n * 1.1 (the \"License\"); you may not use this file except in compliance with\n * the License. You may obtain a copy of the License at\n * http:\/\/www.mozilla.org\/MPL\/\n *\n * Software distributed under the License is distributed on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License\n * for the specific language governing rights and limitations under the\n * License.\n *\n * The Original Code is Mozilla Communicator client code, released\n * March 31, 1998.\n *\n * The Initial Developer of the Original Code is\n * Netscape Communications Corporation.\n * Portions created by the Initial Developer are Copyright (C) 1998-1999\n * the Initial Developer. All Rights Reserved.\n *\n * Contributor(s):\n *   Doug Turner <dougt@netscape.com>\n *   Dean Tessman <dean_tessman@hotmail.com>\n *   Brodie Thiesfield <brofield@jellycan.com>\n *   Jungshik Shin <jshin@i18nl10n.com>\n *\n * Alternatively, the contents of this file may be used under the terms of\n * either of the GNU General Public License Version 2 or later (the \"GPL\"),\n * or the GNU Lesser General Public License Version 2.1 or later (the \"LGPL\"),\n * in which case the provisions of the GPL or the LGPL are applicable instead\n * of those above. If you wish to allow use of your version of this file only\n * under the terms of either the GPL or the LGPL, and not to allow others to\n * use your version of this file under the terms of the MPL, indicate your\n * decision by deleting the provisions above and replace them with the notice\n * and other provisions required by the GPL or the LGPL. If you do not delete\n * the provisions above, a recipient may use your version of this file under\n * the terms of any one of the MPL, the GPL or the LGPL.\n *\n * ***** END LICENSE BLOCK ***** *\/\n\nstatic const struct Executables {\n    const char* extension;\n    DownloadDangerLevel level;\n} g_executables[] = {\n  { \"class\", Dangerous },\n  { \"htm\", AllowOnUserGesture },\n  { \"html\", AllowOnUserGesture },\n  { \"jar\", Dangerous },\n  { \"jnlp\", Dangerous },\n  { \"pdf\", AllowOnUserGesture },\n  { \"pdfxml\", AllowOnUserGesture },\n  { \"mars\", AllowOnUserGesture },\n  { \"fdf\", AllowOnUserGesture },\n  { \"xfdf\", AllowOnUserGesture },\n  { \"xdp\", AllowOnUserGesture },\n  { \"xfd\", AllowOnUserGesture },\n  { \"pl\", AllowOnUserGesture },\n  { \"py\", AllowOnUserGesture },\n  { \"pyw\", AllowOnUserGesture },\n  { \"rb\", AllowOnUserGesture },\n  { \"shtm\", AllowOnUserGesture },\n  { \"shtml\", AllowOnUserGesture },\n  { \"svg\", AllowOnUserGesture },\n  { \"swf\", AllowOnUserGesture },\n  { \"xht\", AllowOnUserGesture },\n  { \"xhtm\", AllowOnUserGesture },\n  { \"xhtml\", AllowOnUserGesture },\n  { \"xml\", AllowOnUserGesture },\n  { \"xsl\", AllowOnUserGesture },\n  { \"xslt\", AllowOnUserGesture },\n#if defined(OS_WIN)\n  { \"ad\", AllowOnUserGesture },\n  { \"ade\", AllowOnUserGesture },\n  { \"adp\", AllowOnUserGesture },\n  { \"app\", AllowOnUserGesture },\n  { \"application\", AllowOnUserGesture },\n  { \"asp\", AllowOnUserGesture },\n  { \"asx\", AllowOnUserGesture },\n  { \"bas\", AllowOnUserGesture },\n  { \"bat\", AllowOnUserGesture },\n  { \"cfg\", Dangerous },\n  { \"chi\", AllowOnUserGesture },\n  { \"chm\", AllowOnUserGesture },\n  { \"cmd\", AllowOnUserGesture },\n  { \"com\", AllowOnUserGesture },\n  { \"cpl\", AllowOnUserGesture },\n  { \"crt\", AllowOnUserGesture },\n  { \"dll\", Dangerous },\n  { \"drv\", Dangerous },\n  { \"exe\", AllowOnUserGesture },\n  { \"fxp\", AllowOnUserGesture },\n  { \"grp\", Dangerous },\n  { \"hlp\", AllowOnUserGesture },\n  { \"hta\", AllowOnUserGesture },\n  { \"htt\", AllowOnUserGesture },\n  { \"inf\", AllowOnUserGesture },\n  { \"ini\", Dangerous },\n  { \"ins\", AllowOnUserGesture },\n  { \"isp\", AllowOnUserGesture },\n  { \"js\", AllowOnUserGesture },\n  { \"jse\", AllowOnUserGesture },\n  { \"lnk\", AllowOnUserGesture },\n  { \"local\", Dangerous },\n  { \"mad\", AllowOnUserGesture },\n  { \"maf\", AllowOnUserGesture },\n  { \"mag\", AllowOnUserGesture },\n  { \"mam\", AllowOnUserGesture },\n  { \"manifest\", Dangerous },\n  { \"maq\", AllowOnUserGesture },\n  { \"mar\", AllowOnUserGesture },\n  { \"mas\", AllowOnUserGesture },\n  { \"mat\", AllowOnUserGesture },\n  { \"mau\", AllowOnUserGesture },\n  { \"mav\", AllowOnUserGesture },\n  { \"maw\", AllowOnUserGesture },\n  { \"mda\", AllowOnUserGesture },\n  { \"mdb\", AllowOnUserGesture },\n  { \"mde\", AllowOnUserGesture },\n  { \"mdt\", AllowOnUserGesture },\n  { \"mdw\", AllowOnUserGesture },\n  { \"mdz\", AllowOnUserGesture },\n  { \"mht\", AllowOnUserGesture },\n  { \"mhtml\", AllowOnUserGesture },\n  { \"mmc\", AllowOnUserGesture },\n  { \"msc\", AllowOnUserGesture },\n  { \"msh\", AllowOnUserGesture },\n  { \"mshxml\", AllowOnUserGesture },\n  { \"msi\", AllowOnUserGesture },\n  { \"msp\", AllowOnUserGesture },\n  { \"mst\", AllowOnUserGesture },\n  { \"ocx\", Dangerous },\n  { \"ops\", AllowOnUserGesture },\n  { \"pcd\", AllowOnUserGesture },\n  { \"pif\", AllowOnUserGesture },\n  { \"plg\", AllowOnUserGesture },\n  { \"prf\", AllowOnUserGesture },\n  { \"prg\", AllowOnUserGesture },\n  { \"pst\", AllowOnUserGesture },\n  { \"reg\", AllowOnUserGesture },\n  { \"scf\", AllowOnUserGesture },\n  { \"scr\", AllowOnUserGesture },\n  { \"sct\", AllowOnUserGesture },\n  { \"shb\", AllowOnUserGesture },\n  { \"shs\", AllowOnUserGesture },\n  { \"sys\", Dangerous },\n  { \"url\", AllowOnUserGesture },\n  { \"vb\", AllowOnUserGesture },\n  { \"vbe\", AllowOnUserGesture },\n  { \"vbs\", AllowOnUserGesture },\n  { \"vsd\", AllowOnUserGesture },\n  { \"vsmacros\", AllowOnUserGesture },\n  { \"vss\", AllowOnUserGesture },\n  { \"vst\", AllowOnUserGesture },\n  { \"vsw\", AllowOnUserGesture },\n  { \"ws\", AllowOnUserGesture },\n  { \"wsc\", AllowOnUserGesture },\n  { \"wsf\", AllowOnUserGesture },\n  { \"wsh\", AllowOnUserGesture },\n  { \"xbap\", Dangerous },\n#elif defined(OS_MACOSX)\n  { \"bash\", AllowOnUserGesture },\n  { \"command\", AllowOnUserGesture },\n  { \"csh\", AllowOnUserGesture },\n  { \"ksh\", AllowOnUserGesture },\n  { \"pkg\", AllowOnUserGesture },\n  { \"sh\", AllowOnUserGesture },\n  { \"shar\", AllowOnUserGesture },\n  { \"tcsh\", AllowOnUserGesture },\n#elif defined(OS_POSIX)\n  \/\/ TODO(estade): lengthen this list.\n  { \"bash\", AllowOnUserGesture },\n  { \"csh\", AllowOnUserGesture },\n  { \"deb\", AllowOnUserGesture },\n  { \"exe\", AllowOnUserGesture },\n  { \"ksh\", AllowOnUserGesture },\n  { \"rpm\", AllowOnUserGesture },\n  { \"sh\", AllowOnUserGesture },\n  { \"shar\", AllowOnUserGesture },\n  { \"tcsh\", AllowOnUserGesture },\n#endif\n};\n\nDownloadDangerLevel GetFileDangerLevel(const FilePath& path) {\n  FilePath::StringType extension(path.Extension());\n  if (extension.empty())\n    return NotDangerous;\n  if (!IsStringASCII(extension))\n    return NotDangerous;\n#if defined(OS_WIN)\n  std::string ascii_extension = WideToASCII(extension);\n#elif defined(OS_POSIX)\n  std::string ascii_extension = extension;\n#endif\n\n  \/\/ Strip out leading dot if it's still there\n  if (ascii_extension[0] == FilePath::kExtensionSeparator)\n    ascii_extension.erase(0, 1);\n\n  for (size_t i = 0; i < arraysize(g_executables); ++i) {\n    if (LowerCaseEqualsASCII(ascii_extension, g_executables[i].extension))\n      return g_executables[i].level;\n  }\n  return NotDangerous;\n}\n\nstatic const char* kExecutableWhiteList[] = {\n  \/\/ JavaScript is just as powerful as EXE.\n  \"text\/javascript\",\n  \"text\/javascript;version=*\",\n  \"text\/html\",\n  \/\/ Registry files can cause critical changes to the MS OS behavior.\n  \/\/ Addition of this mimetype also addresses bug 7337.\n  \"text\/x-registry\",\n  \"text\/x-sh\",\n  \/\/ Some sites use binary\/octet-stream to mean application\/octet-stream.\n  \/\/ See http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=1573\n  \"binary\/octet-stream\"\n};\n\nstatic const char* kExecutableBlackList[] = {\n  \/\/ These application types are not executable.\n  \"application\/*+xml\",\n  \"application\/xml\"\n};\n\nbool IsExecutableMimeType(const std::string& mime_type) {\n  for (size_t i = 0; i < arraysize(kExecutableWhiteList); ++i) {\n    if (net::MatchesMimeType(kExecutableWhiteList[i], mime_type))\n      return true;\n  }\n  for (size_t i = 0; i < arraysize(kExecutableBlackList); ++i) {\n    if (net::MatchesMimeType(kExecutableBlackList[i], mime_type))\n      return false;\n  }\n  \/\/ We consider only other application types to be executable.\n  return net::MatchesMimeType(\"application\/*\", mime_type);\n}\n\n\n}  \/\/ namespace download_util\n<commit_msg>Adding mof files to the list of dangerous files for Windows.  See http:\/\/blogs.iss.net\/archive\/papers\/ibm-xforce-an-inside-look-at-stuxnet.pdf for example of attack.<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 <set>\n#include <string>\n\n#include \"chrome\/browser\/download\/download_extensions.h\"\n\n#include \"base\/string_util.h\"\n#include \"net\/base\/mime_util.h\"\n#include \"net\/base\/net_util.h\"\n\nnamespace download_util {\n\n\/\/ For file extensions taken from mozilla:\n\n\/* ***** BEGIN LICENSE BLOCK *****\n * Version: MPL 1.1\/GPL 2.0\/LGPL 2.1\n *\n * The contents of this file are subject to the Mozilla Public License Version\n * 1.1 (the \"License\"); you may not use this file except in compliance with\n * the License. You may obtain a copy of the License at\n * http:\/\/www.mozilla.org\/MPL\/\n *\n * Software distributed under the License is distributed on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License\n * for the specific language governing rights and limitations under the\n * License.\n *\n * The Original Code is Mozilla Communicator client code, released\n * March 31, 1998.\n *\n * The Initial Developer of the Original Code is\n * Netscape Communications Corporation.\n * Portions created by the Initial Developer are Copyright (C) 1998-1999\n * the Initial Developer. All Rights Reserved.\n *\n * Contributor(s):\n *   Doug Turner <dougt@netscape.com>\n *   Dean Tessman <dean_tessman@hotmail.com>\n *   Brodie Thiesfield <brofield@jellycan.com>\n *   Jungshik Shin <jshin@i18nl10n.com>\n *\n * Alternatively, the contents of this file may be used under the terms of\n * either of the GNU General Public License Version 2 or later (the \"GPL\"),\n * or the GNU Lesser General Public License Version 2.1 or later (the \"LGPL\"),\n * in which case the provisions of the GPL or the LGPL are applicable instead\n * of those above. If you wish to allow use of your version of this file only\n * under the terms of either the GPL or the LGPL, and not to allow others to\n * use your version of this file under the terms of the MPL, indicate your\n * decision by deleting the provisions above and replace them with the notice\n * and other provisions required by the GPL or the LGPL. If you do not delete\n * the provisions above, a recipient may use your version of this file under\n * the terms of any one of the MPL, the GPL or the LGPL.\n *\n * ***** END LICENSE BLOCK ***** *\/\n\nstatic const struct Executables {\n    const char* extension;\n    DownloadDangerLevel level;\n} g_executables[] = {\n  { \"class\", Dangerous },\n  { \"htm\", AllowOnUserGesture },\n  { \"html\", AllowOnUserGesture },\n  { \"jar\", Dangerous },\n  { \"jnlp\", Dangerous },\n  { \"pdf\", AllowOnUserGesture },\n  { \"pdfxml\", AllowOnUserGesture },\n  { \"mars\", AllowOnUserGesture },\n  { \"fdf\", AllowOnUserGesture },\n  { \"xfdf\", AllowOnUserGesture },\n  { \"xdp\", AllowOnUserGesture },\n  { \"xfd\", AllowOnUserGesture },\n  { \"pl\", AllowOnUserGesture },\n  { \"py\", AllowOnUserGesture },\n  { \"pyw\", AllowOnUserGesture },\n  { \"rb\", AllowOnUserGesture },\n  { \"shtm\", AllowOnUserGesture },\n  { \"shtml\", AllowOnUserGesture },\n  { \"svg\", AllowOnUserGesture },\n  { \"swf\", AllowOnUserGesture },\n  { \"xht\", AllowOnUserGesture },\n  { \"xhtm\", AllowOnUserGesture },\n  { \"xhtml\", AllowOnUserGesture },\n  { \"xml\", AllowOnUserGesture },\n  { \"xsl\", AllowOnUserGesture },\n  { \"xslt\", AllowOnUserGesture },\n#if defined(OS_WIN)\n  { \"ad\", AllowOnUserGesture },\n  { \"ade\", AllowOnUserGesture },\n  { \"adp\", AllowOnUserGesture },\n  { \"app\", AllowOnUserGesture },\n  { \"application\", AllowOnUserGesture },\n  { \"asp\", AllowOnUserGesture },\n  { \"asx\", AllowOnUserGesture },\n  { \"bas\", AllowOnUserGesture },\n  { \"bat\", AllowOnUserGesture },\n  { \"cfg\", Dangerous },\n  { \"chi\", AllowOnUserGesture },\n  { \"chm\", AllowOnUserGesture },\n  { \"cmd\", AllowOnUserGesture },\n  { \"com\", AllowOnUserGesture },\n  { \"cpl\", AllowOnUserGesture },\n  { \"crt\", AllowOnUserGesture },\n  { \"dll\", Dangerous },\n  { \"drv\", Dangerous },\n  { \"exe\", AllowOnUserGesture },\n  { \"fxp\", AllowOnUserGesture },\n  { \"grp\", Dangerous },\n  { \"hlp\", AllowOnUserGesture },\n  { \"hta\", AllowOnUserGesture },\n  { \"htt\", AllowOnUserGesture },\n  { \"inf\", AllowOnUserGesture },\n  { \"ini\", Dangerous },\n  { \"ins\", AllowOnUserGesture },\n  { \"isp\", AllowOnUserGesture },\n  { \"js\", AllowOnUserGesture },\n  { \"jse\", AllowOnUserGesture },\n  { \"lnk\", AllowOnUserGesture },\n  { \"local\", Dangerous },\n  { \"mad\", AllowOnUserGesture },\n  { \"maf\", AllowOnUserGesture },\n  { \"mag\", AllowOnUserGesture },\n  { \"mam\", AllowOnUserGesture },\n  { \"manifest\", Dangerous },\n  { \"maq\", AllowOnUserGesture },\n  { \"mar\", AllowOnUserGesture },\n  { \"mas\", AllowOnUserGesture },\n  { \"mat\", AllowOnUserGesture },\n  { \"mau\", AllowOnUserGesture },\n  { \"mav\", AllowOnUserGesture },\n  { \"maw\", AllowOnUserGesture },\n  { \"mda\", AllowOnUserGesture },\n  { \"mdb\", AllowOnUserGesture },\n  { \"mde\", AllowOnUserGesture },\n  { \"mdt\", AllowOnUserGesture },\n  { \"mdw\", AllowOnUserGesture },\n  { \"mdz\", AllowOnUserGesture },\n  { \"mht\", AllowOnUserGesture },\n  { \"mhtml\", AllowOnUserGesture },\n  { \"mmc\", AllowOnUserGesture },\n  { \"mof\", Dangerous },\n  { \"msc\", AllowOnUserGesture },\n  { \"msh\", AllowOnUserGesture },\n  { \"mshxml\", AllowOnUserGesture },\n  { \"msi\", AllowOnUserGesture },\n  { \"msp\", AllowOnUserGesture },\n  { \"mst\", AllowOnUserGesture },\n  { \"ocx\", Dangerous },\n  { \"ops\", AllowOnUserGesture },\n  { \"pcd\", AllowOnUserGesture },\n  { \"pif\", AllowOnUserGesture },\n  { \"plg\", AllowOnUserGesture },\n  { \"prf\", AllowOnUserGesture },\n  { \"prg\", AllowOnUserGesture },\n  { \"pst\", AllowOnUserGesture },\n  { \"reg\", AllowOnUserGesture },\n  { \"scf\", AllowOnUserGesture },\n  { \"scr\", AllowOnUserGesture },\n  { \"sct\", AllowOnUserGesture },\n  { \"shb\", AllowOnUserGesture },\n  { \"shs\", AllowOnUserGesture },\n  { \"sys\", Dangerous },\n  { \"url\", AllowOnUserGesture },\n  { \"vb\", AllowOnUserGesture },\n  { \"vbe\", AllowOnUserGesture },\n  { \"vbs\", AllowOnUserGesture },\n  { \"vsd\", AllowOnUserGesture },\n  { \"vsmacros\", AllowOnUserGesture },\n  { \"vss\", AllowOnUserGesture },\n  { \"vst\", AllowOnUserGesture },\n  { \"vsw\", AllowOnUserGesture },\n  { \"ws\", AllowOnUserGesture },\n  { \"wsc\", AllowOnUserGesture },\n  { \"wsf\", AllowOnUserGesture },\n  { \"wsh\", AllowOnUserGesture },\n  { \"xbap\", Dangerous },\n#elif defined(OS_MACOSX)\n  { \"bash\", AllowOnUserGesture },\n  { \"command\", AllowOnUserGesture },\n  { \"csh\", AllowOnUserGesture },\n  { \"ksh\", AllowOnUserGesture },\n  { \"pkg\", AllowOnUserGesture },\n  { \"sh\", AllowOnUserGesture },\n  { \"shar\", AllowOnUserGesture },\n  { \"tcsh\", AllowOnUserGesture },\n#elif defined(OS_POSIX)\n  \/\/ TODO(estade): lengthen this list.\n  { \"bash\", AllowOnUserGesture },\n  { \"csh\", AllowOnUserGesture },\n  { \"deb\", AllowOnUserGesture },\n  { \"exe\", AllowOnUserGesture },\n  { \"ksh\", AllowOnUserGesture },\n  { \"rpm\", AllowOnUserGesture },\n  { \"sh\", AllowOnUserGesture },\n  { \"shar\", AllowOnUserGesture },\n  { \"tcsh\", AllowOnUserGesture },\n#endif\n};\n\nDownloadDangerLevel GetFileDangerLevel(const FilePath& path) {\n  FilePath::StringType extension(path.Extension());\n  if (extension.empty())\n    return NotDangerous;\n  if (!IsStringASCII(extension))\n    return NotDangerous;\n#if defined(OS_WIN)\n  std::string ascii_extension = WideToASCII(extension);\n#elif defined(OS_POSIX)\n  std::string ascii_extension = extension;\n#endif\n\n  \/\/ Strip out leading dot if it's still there\n  if (ascii_extension[0] == FilePath::kExtensionSeparator)\n    ascii_extension.erase(0, 1);\n\n  for (size_t i = 0; i < arraysize(g_executables); ++i) {\n    if (LowerCaseEqualsASCII(ascii_extension, g_executables[i].extension))\n      return g_executables[i].level;\n  }\n  return NotDangerous;\n}\n\nstatic const char* kExecutableWhiteList[] = {\n  \/\/ JavaScript is just as powerful as EXE.\n  \"text\/javascript\",\n  \"text\/javascript;version=*\",\n  \"text\/html\",\n  \/\/ Registry files can cause critical changes to the MS OS behavior.\n  \/\/ Addition of this mimetype also addresses bug 7337.\n  \"text\/x-registry\",\n  \"text\/x-sh\",\n  \/\/ Some sites use binary\/octet-stream to mean application\/octet-stream.\n  \/\/ See http:\/\/code.google.com\/p\/chromium\/issues\/detail?id=1573\n  \"binary\/octet-stream\"\n};\n\nstatic const char* kExecutableBlackList[] = {\n  \/\/ These application types are not executable.\n  \"application\/*+xml\",\n  \"application\/xml\"\n};\n\nbool IsExecutableMimeType(const std::string& mime_type) {\n  for (size_t i = 0; i < arraysize(kExecutableWhiteList); ++i) {\n    if (net::MatchesMimeType(kExecutableWhiteList[i], mime_type))\n      return true;\n  }\n  for (size_t i = 0; i < arraysize(kExecutableBlackList); ++i) {\n    if (net::MatchesMimeType(kExecutableBlackList[i], mime_type))\n      return false;\n  }\n  \/\/ We consider only other application types to be executable.\n  return net::MatchesMimeType(\"application\/*\", mime_type);\n}\n\n\n}  \/\/ namespace download_util\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 \"components\/metrics\/metrics_log.h\"\n\n#include <string>\n\n#include \"base\/base64.h\"\n#include \"base\/basictypes.h\"\n#include \"base\/command_line.h\"\n#include \"base\/port.h\"\n#include \"base\/prefs\/pref_service.h\"\n#include \"base\/prefs\/testing_pref_service.h\"\n#include \"base\/strings\/string_number_conversions.h\"\n#include \"base\/strings\/string_util.h\"\n#include \"base\/strings\/stringprintf.h\"\n#include \"base\/threading\/sequenced_worker_pool.h\"\n#include \"base\/time\/time.h\"\n#include \"chrome\/browser\/google\/google_util.h\"\n#include \"chrome\/browser\/metrics\/metrics_service.h\"\n#include \"chrome\/browser\/prefs\/browser_prefs.h\"\n#include \"chrome\/common\/chrome_version_info.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"components\/metrics\/metrics_hashes.h\"\n#include \"components\/metrics\/metrics_provider.h\"\n#include \"components\/metrics\/proto\/profiler_event.pb.h\"\n#include \"components\/metrics\/proto\/system_profile.pb.h\"\n#include \"components\/metrics\/test_metrics_service_client.h\"\n#include \"components\/variations\/active_field_trials.h\"\n#include \"content\/public\/browser\/browser_thread.h\"\n#include \"content\/public\/test\/test_browser_thread_bundle.h\"\n#include \"content\/public\/test\/test_utils.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n#include \"url\/gurl.h\"\n\n#if defined(OS_CHROMEOS)\n#include \"chromeos\/login\/login_state.h\"\n#endif  \/\/ defined(OS_CHROMEOS)\n\nusing base::TimeDelta;\n\nnamespace {\n\nconst char kClientId[] = \"bogus client ID\";\nconst int64 kInstallDate = 1373051956;\nconst int64 kInstallDateExpected = 1373050800;  \/\/ Computed from kInstallDate.\nconst int64 kEnabledDate = 1373001211;\nconst int64 kEnabledDateExpected = 1373000400;  \/\/ Computed from kEnabledDate.\nconst int kSessionId = 127;\nconst variations::ActiveGroupId kFieldTrialIds[] = {\n  {37, 43},\n  {13, 47},\n  {23, 17}\n};\nconst variations::ActiveGroupId kSyntheticTrials[] = {\n  {55, 15},\n  {66, 16}\n};\n\nclass TestMetricsLog : public MetricsLog {\n public:\n  TestMetricsLog(const std::string& client_id,\n                 int session_id,\n                 LogType log_type,\n                 metrics::MetricsServiceClient* client,\n                 TestingPrefServiceSimple* prefs)\n      : MetricsLog(client_id, session_id, log_type, client, prefs),\n        prefs_(prefs) {\n    InitPrefs();\n  }\n\n  virtual ~TestMetricsLog() {}\n\n  const metrics::ChromeUserMetricsExtension& uma_proto() const {\n    return *MetricsLog::uma_proto();\n  }\n\n  const metrics::SystemProfileProto& system_profile() const {\n    return uma_proto().system_profile();\n  }\n\n private:\n  void InitPrefs() {\n    prefs_->SetString(metrics::prefs::kMetricsReportingEnabledTimestamp,\n                      base::Int64ToString(kEnabledDate));\n  }\n\n  virtual void GetFieldTrialIds(\n      std::vector<variations::ActiveGroupId>* field_trial_ids) const\n      OVERRIDE {\n    ASSERT_TRUE(field_trial_ids->empty());\n\n    for (size_t i = 0; i < arraysize(kFieldTrialIds); ++i) {\n      field_trial_ids->push_back(kFieldTrialIds[i]);\n    }\n  }\n\n  \/\/ Weak pointer to the PrefsService used by this log.\n  TestingPrefServiceSimple* prefs_;\n\n  DISALLOW_COPY_AND_ASSIGN(TestMetricsLog);\n};\n\n}  \/\/ namespace\n\nclass MetricsLogTest : public testing::Test {\n public:\n  MetricsLogTest() {\n    MetricsService::RegisterPrefs(prefs_.registry());\n#if defined(OS_CHROMEOS)\n    \/\/ TODO(blundell): Remove this code once MetricsService no longer creates\n    \/\/ ChromeOSMetricsProvider. Also remove the #include of login_state.h\n    \/\/ (http:\/\/crbug.com\/375776)\n    if (!chromeos::LoginState::IsInitialized())\n      chromeos::LoginState::Initialize();\n#endif  \/\/ defined(OS_CHROMEOS)\n  }\n\n  virtual ~MetricsLogTest() {\n#if defined(OS_CHROMEOS)\n    \/\/ TODO(blundell): Remove this code once MetricsService no longer creates\n    \/\/ ChromeOSMetricsProvider.\n    chromeos::LoginState::Shutdown();\n#endif  \/\/ defined(OS_CHROMEOS)\n  }\n\n protected:\n  \/\/ Check that the values in |system_values| correspond to the test data\n  \/\/ defined at the top of this file.\n  void CheckSystemProfile(const metrics::SystemProfileProto& system_profile) {\n    EXPECT_EQ(kInstallDateExpected, system_profile.install_date());\n    EXPECT_EQ(kEnabledDateExpected, system_profile.uma_enabled_date());\n\n    ASSERT_EQ(arraysize(kFieldTrialIds) + arraysize(kSyntheticTrials),\n              static_cast<size_t>(system_profile.field_trial_size()));\n    for (size_t i = 0; i < arraysize(kFieldTrialIds); ++i) {\n      const metrics::SystemProfileProto::FieldTrial& field_trial =\n          system_profile.field_trial(i);\n      EXPECT_EQ(kFieldTrialIds[i].name, field_trial.name_id());\n      EXPECT_EQ(kFieldTrialIds[i].group, field_trial.group_id());\n    }\n    \/\/ Verify the right data is present for the synthetic trials.\n    for (size_t i = 0; i < arraysize(kSyntheticTrials); ++i) {\n      const metrics::SystemProfileProto::FieldTrial& field_trial =\n          system_profile.field_trial(i + arraysize(kFieldTrialIds));\n      EXPECT_EQ(kSyntheticTrials[i].name, field_trial.name_id());\n      EXPECT_EQ(kSyntheticTrials[i].group, field_trial.group_id());\n    }\n\n    EXPECT_EQ(metrics::TestMetricsServiceClient::kBrandForTesting,\n              system_profile.brand_code());\n\n    const metrics::SystemProfileProto::Hardware& hardware =\n        system_profile.hardware();\n\n    EXPECT_TRUE(hardware.has_cpu());\n    EXPECT_TRUE(hardware.cpu().has_vendor_name());\n    EXPECT_TRUE(hardware.cpu().has_signature());\n\n    \/\/ TODO(isherman): Verify other data written into the protobuf as a result\n    \/\/ of this call.\n  }\n\n protected:\n  TestingPrefServiceSimple prefs_;\n\n private:\n  content::TestBrowserThreadBundle thread_bundle_;\n\n  DISALLOW_COPY_AND_ASSIGN(MetricsLogTest);\n};\n\nTEST_F(MetricsLogTest, RecordEnvironment) {\n  metrics::TestMetricsServiceClient client;\n  client.set_install_date(kInstallDate);\n  TestMetricsLog log(\n      kClientId, kSessionId, MetricsLog::ONGOING_LOG, &client, &prefs_);\n\n  std::vector<variations::ActiveGroupId> synthetic_trials;\n  \/\/ Add two synthetic trials.\n  synthetic_trials.push_back(kSyntheticTrials[0]);\n  synthetic_trials.push_back(kSyntheticTrials[1]);\n\n  log.RecordEnvironment(std::vector<metrics::MetricsProvider*>(),\n                        synthetic_trials);\n  \/\/ Check that the system profile on the log has the correct values set.\n  CheckSystemProfile(log.system_profile());\n\n  \/\/ Check that the system profile has also been written to prefs.\n  const std::string base64_system_profile =\n      prefs_.GetString(metrics::prefs::kStabilitySavedSystemProfile);\n  EXPECT_FALSE(base64_system_profile.empty());\n  std::string serialied_system_profile;\n  EXPECT_TRUE(base::Base64Decode(base64_system_profile,\n                                 &serialied_system_profile));\n  metrics::SystemProfileProto decoded_system_profile;\n  EXPECT_TRUE(decoded_system_profile.ParseFromString(serialied_system_profile));\n  CheckSystemProfile(decoded_system_profile);\n}\n\nTEST_F(MetricsLogTest, LoadSavedEnvironmentFromPrefs) {\n  const char* kSystemProfilePref = metrics::prefs::kStabilitySavedSystemProfile;\n  const char* kSystemProfileHashPref =\n      metrics::prefs::kStabilitySavedSystemProfileHash;\n\n  metrics::TestMetricsServiceClient client;\n  client.set_install_date(kInstallDate);\n\n  \/\/ The pref value is empty, so loading it from prefs should fail.\n  {\n    TestMetricsLog log(\n        kClientId, kSessionId, MetricsLog::ONGOING_LOG, &client, &prefs_);\n    EXPECT_FALSE(log.LoadSavedEnvironmentFromPrefs());\n  }\n\n  \/\/ Do a RecordEnvironment() call and check whether the pref is recorded.\n  {\n    TestMetricsLog log(\n        kClientId, kSessionId, MetricsLog::ONGOING_LOG, &client, &prefs_);\n    log.RecordEnvironment(std::vector<metrics::MetricsProvider*>(),\n                          std::vector<variations::ActiveGroupId>());\n    EXPECT_FALSE(prefs_.GetString(kSystemProfilePref).empty());\n    EXPECT_FALSE(prefs_.GetString(kSystemProfileHashPref).empty());\n  }\n\n  {\n    TestMetricsLog log(\n        kClientId, kSessionId, MetricsLog::ONGOING_LOG, &client, &prefs_);\n    EXPECT_TRUE(log.LoadSavedEnvironmentFromPrefs());\n    \/\/ Check some values in the system profile.\n    EXPECT_EQ(kInstallDateExpected, log.system_profile().install_date());\n    EXPECT_EQ(kEnabledDateExpected, log.system_profile().uma_enabled_date());\n    \/\/ Ensure that the call cleared the prefs.\n    EXPECT_TRUE(prefs_.GetString(kSystemProfilePref).empty());\n    EXPECT_TRUE(prefs_.GetString(kSystemProfileHashPref).empty());\n  }\n\n  \/\/ Ensure that a non-matching hash results in the pref being invalid.\n  {\n    TestMetricsLog log(\n        kClientId, kSessionId, MetricsLog::ONGOING_LOG, &client, &prefs_);\n    \/\/ Call RecordEnvironment() to record the pref again.\n    log.RecordEnvironment(std::vector<metrics::MetricsProvider*>(),\n                          std::vector<variations::ActiveGroupId>());\n  }\n\n  {\n    \/\/ Set the hash to a bad value.\n    prefs_.SetString(kSystemProfileHashPref, \"deadbeef\");\n    TestMetricsLog log(\n        kClientId, kSessionId, MetricsLog::ONGOING_LOG, &client, &prefs_);\n    EXPECT_FALSE(log.LoadSavedEnvironmentFromPrefs());\n    \/\/ Ensure that the prefs are cleared, even if the call failed.\n    EXPECT_TRUE(prefs_.GetString(kSystemProfilePref).empty());\n    EXPECT_TRUE(prefs_.GetString(kSystemProfileHashPref).empty());\n  }\n}\n\nTEST_F(MetricsLogTest, InitialLogStabilityMetrics) {\n  metrics::TestMetricsServiceClient client;\n  TestMetricsLog log(kClientId,\n                     kSessionId,\n                     MetricsLog::INITIAL_STABILITY_LOG,\n                     &client,\n                     &prefs_);\n  std::vector<metrics::MetricsProvider*> metrics_providers;\n  log.RecordEnvironment(metrics_providers,\n                        std::vector<variations::ActiveGroupId>());\n  log.RecordStabilityMetrics(metrics_providers, base::TimeDelta(),\n                             base::TimeDelta());\n  const metrics::SystemProfileProto_Stability& stability =\n      log.system_profile().stability();\n  \/\/ Required metrics:\n  EXPECT_TRUE(stability.has_launch_count());\n  EXPECT_TRUE(stability.has_crash_count());\n  \/\/ Initial log metrics:\n  EXPECT_TRUE(stability.has_incomplete_shutdown_count());\n  EXPECT_TRUE(stability.has_breakpad_registration_success_count());\n  EXPECT_TRUE(stability.has_breakpad_registration_failure_count());\n  EXPECT_TRUE(stability.has_debugger_present_count());\n  EXPECT_TRUE(stability.has_debugger_not_present_count());\n}\n\nTEST_F(MetricsLogTest, OngoingLogStabilityMetrics) {\n  metrics::TestMetricsServiceClient client;\n  TestMetricsLog log(\n      kClientId, kSessionId, MetricsLog::ONGOING_LOG, &client, &prefs_);\n  std::vector<metrics::MetricsProvider*> metrics_providers;\n  log.RecordEnvironment(metrics_providers,\n                        std::vector<variations::ActiveGroupId>());\n  log.RecordStabilityMetrics(metrics_providers, base::TimeDelta(),\n                             base::TimeDelta());\n  const metrics::SystemProfileProto_Stability& stability =\n      log.system_profile().stability();\n  \/\/ Required metrics:\n  EXPECT_TRUE(stability.has_launch_count());\n  EXPECT_TRUE(stability.has_crash_count());\n  \/\/ Initial log metrics:\n  EXPECT_FALSE(stability.has_incomplete_shutdown_count());\n  EXPECT_FALSE(stability.has_breakpad_registration_success_count());\n  EXPECT_FALSE(stability.has_breakpad_registration_failure_count());\n  EXPECT_FALSE(stability.has_debugger_present_count());\n  EXPECT_FALSE(stability.has_debugger_not_present_count());\n}\n\nTEST_F(MetricsLogTest, ChromeChannelWrittenToProtobuf) {\n  metrics::TestMetricsServiceClient client;\n  TestMetricsLog log(\n      \"user@test.com\", kSessionId, MetricsLog::ONGOING_LOG, &client, &prefs_);\n  EXPECT_TRUE(log.uma_proto().system_profile().has_channel());\n}\n<commit_msg>Remove \/\/content and \/\/chrome dependencies from MetricsLog unittest<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 \"components\/metrics\/metrics_log.h\"\n\n#include <string>\n\n#include \"base\/base64.h\"\n#include \"base\/basictypes.h\"\n#include \"base\/command_line.h\"\n#include \"base\/port.h\"\n#include \"base\/prefs\/pref_service.h\"\n#include \"base\/prefs\/testing_pref_service.h\"\n#include \"base\/strings\/string_number_conversions.h\"\n#include \"base\/strings\/string_util.h\"\n#include \"base\/strings\/stringprintf.h\"\n#include \"base\/threading\/sequenced_worker_pool.h\"\n#include \"base\/time\/time.h\"\n#include \"components\/metrics\/metrics_hashes.h\"\n#include \"components\/metrics\/metrics_pref_names.h\"\n#include \"components\/metrics\/metrics_provider.h\"\n#include \"components\/metrics\/metrics_state_manager.h\"\n#include \"components\/metrics\/proto\/profiler_event.pb.h\"\n#include \"components\/metrics\/proto\/system_profile.pb.h\"\n#include \"components\/metrics\/test_metrics_service_client.h\"\n#include \"components\/variations\/active_field_trials.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n#include \"url\/gurl.h\"\n\nusing base::TimeDelta;\n\nnamespace {\n\nconst char kClientId[] = \"bogus client ID\";\nconst int64 kInstallDate = 1373051956;\nconst int64 kInstallDateExpected = 1373050800;  \/\/ Computed from kInstallDate.\nconst int64 kEnabledDate = 1373001211;\nconst int64 kEnabledDateExpected = 1373000400;  \/\/ Computed from kEnabledDate.\nconst int kSessionId = 127;\nconst variations::ActiveGroupId kFieldTrialIds[] = {\n  {37, 43},\n  {13, 47},\n  {23, 17}\n};\nconst variations::ActiveGroupId kSyntheticTrials[] = {\n  {55, 15},\n  {66, 16}\n};\n\nclass TestMetricsLog : public MetricsLog {\n public:\n  TestMetricsLog(const std::string& client_id,\n                 int session_id,\n                 LogType log_type,\n                 metrics::MetricsServiceClient* client,\n                 TestingPrefServiceSimple* prefs)\n      : MetricsLog(client_id, session_id, log_type, client, prefs),\n        prefs_(prefs) {\n    InitPrefs();\n  }\n\n  virtual ~TestMetricsLog() {}\n\n  const metrics::ChromeUserMetricsExtension& uma_proto() const {\n    return *MetricsLog::uma_proto();\n  }\n\n  const metrics::SystemProfileProto& system_profile() const {\n    return uma_proto().system_profile();\n  }\n\n private:\n  void InitPrefs() {\n    prefs_->SetString(metrics::prefs::kMetricsReportingEnabledTimestamp,\n                      base::Int64ToString(kEnabledDate));\n  }\n\n  virtual void GetFieldTrialIds(\n      std::vector<variations::ActiveGroupId>* field_trial_ids) const\n      OVERRIDE {\n    ASSERT_TRUE(field_trial_ids->empty());\n\n    for (size_t i = 0; i < arraysize(kFieldTrialIds); ++i) {\n      field_trial_ids->push_back(kFieldTrialIds[i]);\n    }\n  }\n\n  \/\/ Weak pointer to the PrefsService used by this log.\n  TestingPrefServiceSimple* prefs_;\n\n  DISALLOW_COPY_AND_ASSIGN(TestMetricsLog);\n};\n\n}  \/\/ namespace\n\nclass MetricsLogTest : public testing::Test {\n public:\n  MetricsLogTest() {\n    MetricsLog::RegisterPrefs(prefs_.registry());\n    metrics::MetricsStateManager::RegisterPrefs(prefs_.registry());\n  }\n\n  virtual ~MetricsLogTest() {\n  }\n\n protected:\n  \/\/ Check that the values in |system_values| correspond to the test data\n  \/\/ defined at the top of this file.\n  void CheckSystemProfile(const metrics::SystemProfileProto& system_profile) {\n    EXPECT_EQ(kInstallDateExpected, system_profile.install_date());\n    EXPECT_EQ(kEnabledDateExpected, system_profile.uma_enabled_date());\n\n    ASSERT_EQ(arraysize(kFieldTrialIds) + arraysize(kSyntheticTrials),\n              static_cast<size_t>(system_profile.field_trial_size()));\n    for (size_t i = 0; i < arraysize(kFieldTrialIds); ++i) {\n      const metrics::SystemProfileProto::FieldTrial& field_trial =\n          system_profile.field_trial(i);\n      EXPECT_EQ(kFieldTrialIds[i].name, field_trial.name_id());\n      EXPECT_EQ(kFieldTrialIds[i].group, field_trial.group_id());\n    }\n    \/\/ Verify the right data is present for the synthetic trials.\n    for (size_t i = 0; i < arraysize(kSyntheticTrials); ++i) {\n      const metrics::SystemProfileProto::FieldTrial& field_trial =\n          system_profile.field_trial(i + arraysize(kFieldTrialIds));\n      EXPECT_EQ(kSyntheticTrials[i].name, field_trial.name_id());\n      EXPECT_EQ(kSyntheticTrials[i].group, field_trial.group_id());\n    }\n\n    EXPECT_EQ(metrics::TestMetricsServiceClient::kBrandForTesting,\n              system_profile.brand_code());\n\n    const metrics::SystemProfileProto::Hardware& hardware =\n        system_profile.hardware();\n\n    EXPECT_TRUE(hardware.has_cpu());\n    EXPECT_TRUE(hardware.cpu().has_vendor_name());\n    EXPECT_TRUE(hardware.cpu().has_signature());\n\n    \/\/ TODO(isherman): Verify other data written into the protobuf as a result\n    \/\/ of this call.\n  }\n\n protected:\n  TestingPrefServiceSimple prefs_;\n\n private:\n  DISALLOW_COPY_AND_ASSIGN(MetricsLogTest);\n};\n\nTEST_F(MetricsLogTest, RecordEnvironment) {\n  metrics::TestMetricsServiceClient client;\n  client.set_install_date(kInstallDate);\n  TestMetricsLog log(\n      kClientId, kSessionId, MetricsLog::ONGOING_LOG, &client, &prefs_);\n\n  std::vector<variations::ActiveGroupId> synthetic_trials;\n  \/\/ Add two synthetic trials.\n  synthetic_trials.push_back(kSyntheticTrials[0]);\n  synthetic_trials.push_back(kSyntheticTrials[1]);\n\n  log.RecordEnvironment(std::vector<metrics::MetricsProvider*>(),\n                        synthetic_trials);\n  \/\/ Check that the system profile on the log has the correct values set.\n  CheckSystemProfile(log.system_profile());\n\n  \/\/ Check that the system profile has also been written to prefs.\n  const std::string base64_system_profile =\n      prefs_.GetString(metrics::prefs::kStabilitySavedSystemProfile);\n  EXPECT_FALSE(base64_system_profile.empty());\n  std::string serialied_system_profile;\n  EXPECT_TRUE(base::Base64Decode(base64_system_profile,\n                                 &serialied_system_profile));\n  metrics::SystemProfileProto decoded_system_profile;\n  EXPECT_TRUE(decoded_system_profile.ParseFromString(serialied_system_profile));\n  CheckSystemProfile(decoded_system_profile);\n}\n\nTEST_F(MetricsLogTest, LoadSavedEnvironmentFromPrefs) {\n  const char* kSystemProfilePref = metrics::prefs::kStabilitySavedSystemProfile;\n  const char* kSystemProfileHashPref =\n      metrics::prefs::kStabilitySavedSystemProfileHash;\n\n  metrics::TestMetricsServiceClient client;\n  client.set_install_date(kInstallDate);\n\n  \/\/ The pref value is empty, so loading it from prefs should fail.\n  {\n    TestMetricsLog log(\n        kClientId, kSessionId, MetricsLog::ONGOING_LOG, &client, &prefs_);\n    EXPECT_FALSE(log.LoadSavedEnvironmentFromPrefs());\n  }\n\n  \/\/ Do a RecordEnvironment() call and check whether the pref is recorded.\n  {\n    TestMetricsLog log(\n        kClientId, kSessionId, MetricsLog::ONGOING_LOG, &client, &prefs_);\n    log.RecordEnvironment(std::vector<metrics::MetricsProvider*>(),\n                          std::vector<variations::ActiveGroupId>());\n    EXPECT_FALSE(prefs_.GetString(kSystemProfilePref).empty());\n    EXPECT_FALSE(prefs_.GetString(kSystemProfileHashPref).empty());\n  }\n\n  {\n    TestMetricsLog log(\n        kClientId, kSessionId, MetricsLog::ONGOING_LOG, &client, &prefs_);\n    EXPECT_TRUE(log.LoadSavedEnvironmentFromPrefs());\n    \/\/ Check some values in the system profile.\n    EXPECT_EQ(kInstallDateExpected, log.system_profile().install_date());\n    EXPECT_EQ(kEnabledDateExpected, log.system_profile().uma_enabled_date());\n    \/\/ Ensure that the call cleared the prefs.\n    EXPECT_TRUE(prefs_.GetString(kSystemProfilePref).empty());\n    EXPECT_TRUE(prefs_.GetString(kSystemProfileHashPref).empty());\n  }\n\n  \/\/ Ensure that a non-matching hash results in the pref being invalid.\n  {\n    TestMetricsLog log(\n        kClientId, kSessionId, MetricsLog::ONGOING_LOG, &client, &prefs_);\n    \/\/ Call RecordEnvironment() to record the pref again.\n    log.RecordEnvironment(std::vector<metrics::MetricsProvider*>(),\n                          std::vector<variations::ActiveGroupId>());\n  }\n\n  {\n    \/\/ Set the hash to a bad value.\n    prefs_.SetString(kSystemProfileHashPref, \"deadbeef\");\n    TestMetricsLog log(\n        kClientId, kSessionId, MetricsLog::ONGOING_LOG, &client, &prefs_);\n    EXPECT_FALSE(log.LoadSavedEnvironmentFromPrefs());\n    \/\/ Ensure that the prefs are cleared, even if the call failed.\n    EXPECT_TRUE(prefs_.GetString(kSystemProfilePref).empty());\n    EXPECT_TRUE(prefs_.GetString(kSystemProfileHashPref).empty());\n  }\n}\n\nTEST_F(MetricsLogTest, InitialLogStabilityMetrics) {\n  metrics::TestMetricsServiceClient client;\n  TestMetricsLog log(kClientId,\n                     kSessionId,\n                     MetricsLog::INITIAL_STABILITY_LOG,\n                     &client,\n                     &prefs_);\n  std::vector<metrics::MetricsProvider*> metrics_providers;\n  log.RecordEnvironment(metrics_providers,\n                        std::vector<variations::ActiveGroupId>());\n  log.RecordStabilityMetrics(metrics_providers, base::TimeDelta(),\n                             base::TimeDelta());\n  const metrics::SystemProfileProto_Stability& stability =\n      log.system_profile().stability();\n  \/\/ Required metrics:\n  EXPECT_TRUE(stability.has_launch_count());\n  EXPECT_TRUE(stability.has_crash_count());\n  \/\/ Initial log metrics:\n  EXPECT_TRUE(stability.has_incomplete_shutdown_count());\n  EXPECT_TRUE(stability.has_breakpad_registration_success_count());\n  EXPECT_TRUE(stability.has_breakpad_registration_failure_count());\n  EXPECT_TRUE(stability.has_debugger_present_count());\n  EXPECT_TRUE(stability.has_debugger_not_present_count());\n}\n\nTEST_F(MetricsLogTest, OngoingLogStabilityMetrics) {\n  metrics::TestMetricsServiceClient client;\n  TestMetricsLog log(\n      kClientId, kSessionId, MetricsLog::ONGOING_LOG, &client, &prefs_);\n  std::vector<metrics::MetricsProvider*> metrics_providers;\n  log.RecordEnvironment(metrics_providers,\n                        std::vector<variations::ActiveGroupId>());\n  log.RecordStabilityMetrics(metrics_providers, base::TimeDelta(),\n                             base::TimeDelta());\n  const metrics::SystemProfileProto_Stability& stability =\n      log.system_profile().stability();\n  \/\/ Required metrics:\n  EXPECT_TRUE(stability.has_launch_count());\n  EXPECT_TRUE(stability.has_crash_count());\n  \/\/ Initial log metrics:\n  EXPECT_FALSE(stability.has_incomplete_shutdown_count());\n  EXPECT_FALSE(stability.has_breakpad_registration_success_count());\n  EXPECT_FALSE(stability.has_breakpad_registration_failure_count());\n  EXPECT_FALSE(stability.has_debugger_present_count());\n  EXPECT_FALSE(stability.has_debugger_not_present_count());\n}\n\nTEST_F(MetricsLogTest, ChromeChannelWrittenToProtobuf) {\n  metrics::TestMetricsServiceClient client;\n  TestMetricsLog log(\n      \"user@test.com\", kSessionId, MetricsLog::ONGOING_LOG, &client, &prefs_);\n  EXPECT_TRUE(log.uma_proto().system_profile().has_channel());\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2002-2005 The Regents of The University of Michigan\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met: redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer;\n * redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution;\n * neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n\/\/ FIX ME: make trackBlkAddr use blocksize from actual cache, not hard coded\n\n#include <iomanip>\n#include <set>\n#include <sstream>\n#include <string>\n#include <vector>\n\n#include \"base\/misc.hh\"\n#include \"base\/statistics.hh\"\n#include \"cpu\/exec_context.hh\"\n#include \"cpu\/memtest\/memtest.hh\"\n#include \"mem\/cache\/base_cache.hh\"\n#include \"sim\/builder.hh\"\n#include \"sim\/sim_events.hh\"\n#include \"sim\/stats.hh\"\n\nusing namespace std;\n\nint TESTER_ALLOCATOR=0;\n\nMemTest::MemTest(const string &name,\n                 MemInterface *_cache_interface,\n                 FunctionalMemory *main_mem,\n                 FunctionalMemory *check_mem,\n                 unsigned _memorySize,\n                 unsigned _percentReads,\n                 unsigned _percentCopies,\n                 unsigned _percentUncacheable,\n                 unsigned _progressInterval,\n                 unsigned _percentSourceUnaligned,\n                 unsigned _percentDestUnaligned,\n                 Addr _traceAddr,\n                 Counter _max_loads)\n    : SimObject(name),\n      tickEvent(this),\n      cacheInterface(_cache_interface),\n      mainMem(main_mem),\n      checkMem(check_mem),\n      size(_memorySize),\n      percentReads(_percentReads),\n      percentCopies(_percentCopies),\n      percentUncacheable(_percentUncacheable),\n      progressInterval(_progressInterval),\n      nextProgressMessage(_progressInterval),\n      percentSourceUnaligned(_percentSourceUnaligned),\n      percentDestUnaligned(percentDestUnaligned),\n      maxLoads(_max_loads)\n{\n    vector<string> cmd;\n    cmd.push_back(\"\/bin\/ls\");\n    vector<string> null_vec;\n    xc = new ExecContext(NULL, 0, mainMem, 0);\n\n    blockSize = cacheInterface->getBlockSize();\n    blockAddrMask = blockSize - 1;\n    traceBlockAddr = blockAddr(_traceAddr);\n\n    \/\/setup data storage with interesting values\n    uint8_t *data1 = new uint8_t[size];\n    uint8_t *data2 = new uint8_t[size];\n    uint8_t *data3 = new uint8_t[size];\n    memset(data1, 1, size);\n    memset(data2, 2, size);\n    memset(data3, 3, size);\n    curTick = 0;\n\n    baseAddr1 = 0x100000;\n    baseAddr2 = 0x400000;\n    uncacheAddr = 0x800000;\n\n    \/\/ set up intial memory contents here\n    mainMem->prot_write(baseAddr1, data1, size);\n    checkMem->prot_write(baseAddr1, data1, size);\n    mainMem->prot_write(baseAddr2, data2, size);\n    checkMem->prot_write(baseAddr2, data2, size);\n    mainMem->prot_write(uncacheAddr, data3, size);\n    checkMem->prot_write(uncacheAddr, data3, size);\n\n    delete [] data1;\n    delete [] data2;\n    delete [] data3;\n\n    \/\/ set up counters\n    noResponseCycles = 0;\n    numReads = 0;\n    tickEvent.schedule(0);\n\n    id = TESTER_ALLOCATOR++;\n}\n\nstatic void\nprintData(ostream &os, uint8_t *data, int nbytes)\n{\n    os << hex << setfill('0');\n    \/\/ assume little-endian: print bytes from highest address to lowest\n    for (uint8_t *dp = data + nbytes - 1; dp >= data; --dp) {\n        os << setw(2) << (unsigned)*dp;\n    }\n    os << dec;\n}\n\nvoid\nMemTest::completeRequest(MemReqPtr &req, uint8_t *data)\n{\n    \/\/Remove the address from the list of outstanding\n    std::set<unsigned>::iterator removeAddr = outstandingAddrs.find(req->paddr);\n    assert(removeAddr != outstandingAddrs.end());\n    outstandingAddrs.erase(removeAddr);\n\n    switch (req->cmd) {\n      case Read:\n        if (memcmp(req->data, data, req->size) != 0) {\n            cerr << name() << \": on read of 0x\" << hex << req->paddr\n                 << \" (0x\" << hex << blockAddr(req->paddr) << \")\"\n                 << \"@ cycle \" << dec << curTick\n                 << \", cache returns 0x\";\n            printData(cerr, req->data, req->size);\n            cerr << \", expected 0x\";\n            printData(cerr, data, req->size);\n            cerr << endl;\n            fatal(\"\");\n        }\n\n        numReads++;\n        numReadsStat++;\n\n        if (numReads == nextProgressMessage) {\n            ccprintf(cerr, \"%s: completed %d read accesses @%d\\n\",\n                     name(), numReads, curTick);\n            nextProgressMessage += progressInterval;\n        }\n\n        if (numReads >= maxLoads)\n            SimExit(curTick, \"Maximum number of loads reached!\");\n        break;\n\n      case Write:\n        numWritesStat++;\n        break;\n\n      case Copy:\n        \/\/Also remove dest from outstanding list\n        removeAddr = outstandingAddrs.find(req->dest);\n        assert(removeAddr != outstandingAddrs.end());\n        outstandingAddrs.erase(removeAddr);\n        numCopiesStat++;\n        break;\n\n      default:\n        panic(\"invalid command\");\n    }\n\n    if (blockAddr(req->paddr) == traceBlockAddr) {\n        cerr << name() << \": completed \"\n             << (req->cmd.isWrite() ? \"write\" : \"read\")\n             << \" access of \"\n             << dec << req->size << \" bytes at address 0x\"\n             << hex << req->paddr\n             << \" (0x\" << hex << blockAddr(req->paddr) << \")\"\n             << \", value = 0x\";\n        printData(cerr, req->data, req->size);\n        cerr << \" @ cycle \" << dec << curTick;\n\n        cerr << endl;\n    }\n\n    noResponseCycles = 0;\n    delete [] data;\n}\n\n\nvoid\nMemTest::regStats()\n{\n    using namespace Stats;\n\n\n    numReadsStat\n        .name(name() + \".num_reads\")\n        .desc(\"number of read accesses completed\")\n        ;\n\n    numWritesStat\n        .name(name() + \".num_writes\")\n        .desc(\"number of write accesses completed\")\n        ;\n\n    numCopiesStat\n        .name(name() + \".num_copies\")\n        .desc(\"number of copy accesses completed\")\n        ;\n}\n\nvoid\nMemTest::tick()\n{\n    if (!tickEvent.scheduled())\n        tickEvent.schedule(curTick + cycles(1));\n\n    if (++noResponseCycles >= 500000) {\n        cerr << name() << \": deadlocked at cycle \" << curTick << endl;\n        fatal(\"\");\n    }\n\n    if (cacheInterface->isBlocked()) {\n        return;\n    }\n\n    \/\/make new request\n    unsigned cmd = rand() % 100;\n    unsigned offset1 = random() % size;\n    unsigned offset2 = random() % size;\n    unsigned base = random() % 2;\n    uint64_t data = random();\n    unsigned access_size = random() % 4;\n    unsigned cacheable = rand() % 100;\n    unsigned source_align = rand() % 100;\n    unsigned dest_align = rand() % 100;\n\n    \/\/If we aren't doing copies, use id as offset, and do a false sharing\n    \/\/mem tester\n    if (percentCopies == 0) {\n        \/\/We can eliminate the lower bits of the offset, and then use the id\n        \/\/to offset within the blks\n        offset1 &= ~63; \/\/Not the low order bits\n        offset1 += id;\n        access_size = 0;\n    }\n\n    MemReqPtr req = new MemReq();\n\n    if (cacheable < percentUncacheable) {\n        req->flags |= UNCACHEABLE;\n        req->paddr = uncacheAddr + offset1;\n    } else {\n        req->paddr = ((base) ? baseAddr1 : baseAddr2) + offset1;\n    }\n    bool probe = (rand() % 2 == 1) && !req->isUncacheable();\n    probe = false;\n\n    req->size = 1 << access_size;\n    req->data = new uint8_t[req->size];\n    req->paddr &= ~(req->size - 1);\n    req->time = curTick;\n    req->xc = xc;\n\n    if (cmd < percentReads) {\n        \/\/ read\n\n        \/\/For now we only allow one outstanding request per addreess per tester\n        \/\/This means we assume CPU does write forwarding to reads that alias something\n        \/\/in the cpu store buffer.\n        if (outstandingAddrs.find(req->paddr) != outstandingAddrs.end()) return;\n        else outstandingAddrs.insert(req->paddr);\n\n        req->cmd = Read;\n        uint8_t *result = new uint8_t[8];\n        checkMem->access(Read, req->paddr, result, req->size);\n        if (blockAddr(req->paddr) == traceBlockAddr) {\n            cerr << name()\n                 << \": initiating read \"\n                 << ((probe)?\"probe of \":\"access of \")\n                 << dec << req->size << \" bytes from addr 0x\"\n                 << hex << req->paddr\n                 << \" (0x\" << hex << blockAddr(req->paddr) << \")\"\n                 << \" at cycle \"\n                 << dec << curTick << endl;\n        }\n        if (probe) {\n            cacheInterface->probeAndUpdate(req);\n            completeRequest(req, result);\n        } else {\n            req->completionEvent = new MemCompleteEvent(req, result, this);\n            cacheInterface->access(req);\n        }\n    } else if (cmd < (100 - percentCopies)){\n        \/\/ write\n\n        \/\/For now we only allow one outstanding request per addreess per tester\n        \/\/This means we assume CPU does write forwarding to reads that alias something\n        \/\/in the cpu store buffer.\n        if (outstandingAddrs.find(req->paddr) != outstandingAddrs.end()) return;\n        else outstandingAddrs.insert(req->paddr);\n\n        req->cmd = Write;\n        memcpy(req->data, &data, req->size);\n        checkMem->access(Write, req->paddr, req->data, req->size);\n        if (blockAddr(req->paddr) == traceBlockAddr) {\n            cerr << name() << \": initiating write \"\n                 << ((probe)?\"probe of \":\"access of \")\n                 << dec << req->size << \" bytes (value = 0x\";\n            printData(cerr, req->data, req->size);\n            cerr << \") to addr 0x\"\n                 << hex << req->paddr\n                 << \" (0x\" << hex << blockAddr(req->paddr) << \")\"\n                 << \" at cycle \"\n                 << dec << curTick << endl;\n        }\n        if (probe) {\n            cacheInterface->probeAndUpdate(req);\n            completeRequest(req, NULL);\n        } else {\n            req->completionEvent = new MemCompleteEvent(req, NULL, this);\n            cacheInterface->access(req);\n        }\n    } else {\n        \/\/ copy\n        Addr source = ((base) ? baseAddr1 : baseAddr2) + offset1;\n        Addr dest = ((base) ? baseAddr2 : baseAddr1) + offset2;\n        if (outstandingAddrs.find(source) != outstandingAddrs.end()) return;\n        else outstandingAddrs.insert(source);\n        if (outstandingAddrs.find(dest) != outstandingAddrs.end()) return;\n        else outstandingAddrs.insert(dest);\n\n        if (source_align >= percentSourceUnaligned) {\n            source = blockAddr(source);\n        }\n        if (dest_align >= percentDestUnaligned) {\n            dest = blockAddr(dest);\n        }\n        req->cmd = Copy;\n        req->flags &= ~UNCACHEABLE;\n        req->paddr = source;\n        req->dest = dest;\n        delete [] req->data;\n        req->data = new uint8_t[blockSize];\n        req->size = blockSize;\n        if (source == traceBlockAddr || dest == traceBlockAddr) {\n            cerr << name()\n                 << \": initiating copy of \"\n                 << dec << req->size << \" bytes from addr 0x\"\n                 << hex << source\n                 << \" (0x\" << hex << blockAddr(source) << \")\"\n                 << \" to addr 0x\"\n                 << hex << dest\n                 << \" (0x\" << hex << blockAddr(dest) << \")\"\n                 << \" at cycle \"\n                 << dec << curTick << endl;\n        }\n        cacheInterface->access(req);\n        uint8_t result[blockSize];\n        checkMem->access(Read, source, &result, blockSize);\n        checkMem->access(Write, dest, &result, blockSize);\n    }\n}\n\n\nvoid\nMemCompleteEvent::process()\n{\n    tester->completeRequest(req, data);\n    delete this;\n}\n\n\nconst char *\nMemCompleteEvent::description()\n{\n    return \"memory access completion\";\n}\n\n\nBEGIN_DECLARE_SIM_OBJECT_PARAMS(MemTest)\n\n    SimObjectParam<BaseCache *> cache;\n    SimObjectParam<FunctionalMemory *> main_mem;\n    SimObjectParam<FunctionalMemory *> check_mem;\n    Param<unsigned> memory_size;\n    Param<unsigned> percent_reads;\n    Param<unsigned> percent_copies;\n    Param<unsigned> percent_uncacheable;\n    Param<unsigned> progress_interval;\n    Param<unsigned> percent_source_unaligned;\n    Param<unsigned> percent_dest_unaligned;\n    Param<Addr> trace_addr;\n    Param<Counter> max_loads;\n\nEND_DECLARE_SIM_OBJECT_PARAMS(MemTest)\n\n\nBEGIN_INIT_SIM_OBJECT_PARAMS(MemTest)\n\n    INIT_PARAM(cache, \"L1 cache\"),\n    INIT_PARAM(main_mem, \"hierarchical memory\"),\n    INIT_PARAM(check_mem, \"check memory\"),\n    INIT_PARAM(memory_size, \"memory size\"),\n    INIT_PARAM(percent_reads, \"target read percentage\"),\n    INIT_PARAM(percent_copies, \"target copy percentage\"),\n    INIT_PARAM(percent_uncacheable, \"target uncacheable percentage\"),\n    INIT_PARAM(progress_interval, \"progress report interval (in accesses)\"),\n    INIT_PARAM(percent_source_unaligned,\n               \"percent of copy source address that are unaligned\"),\n    INIT_PARAM(percent_dest_unaligned,\n               \"percent of copy dest address that are unaligned\"),\n    INIT_PARAM(trace_addr, \"address to trace\"),\n    INIT_PARAM(max_loads, \"terminate when we have reached this load count\")\n\nEND_INIT_SIM_OBJECT_PARAMS(MemTest)\n\n\nCREATE_SIM_OBJECT(MemTest)\n{\n    return new MemTest(getInstanceName(), cache->getInterface(), main_mem,\n                       check_mem, memory_size, percent_reads, percent_copies,\n                       percent_uncacheable, progress_interval,\n                       percent_source_unaligned, percent_dest_unaligned,\n                       trace_addr, max_loads);\n}\n\nREGISTER_SIM_OBJECT(\"MemTest\", MemTest)\n<commit_msg>Minor cleanup of memtest.<commit_after>\/*\n * Copyright (c) 2002-2005 The Regents of The University of Michigan\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met: redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer;\n * redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution;\n * neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n\/\/ FIX ME: make trackBlkAddr use blocksize from actual cache, not hard coded\n\n#include <iomanip>\n#include <set>\n#include <sstream>\n#include <string>\n#include <vector>\n\n#include \"base\/misc.hh\"\n#include \"base\/statistics.hh\"\n#include \"cpu\/exec_context.hh\"\n#include \"cpu\/memtest\/memtest.hh\"\n#include \"mem\/cache\/base_cache.hh\"\n#include \"sim\/builder.hh\"\n#include \"sim\/sim_events.hh\"\n#include \"sim\/stats.hh\"\n\nusing namespace std;\n\nint TESTER_ALLOCATOR=0;\n\nMemTest::MemTest(const string &name,\n                 MemInterface *_cache_interface,\n                 FunctionalMemory *main_mem,\n                 FunctionalMemory *check_mem,\n                 unsigned _memorySize,\n                 unsigned _percentReads,\n                 unsigned _percentCopies,\n                 unsigned _percentUncacheable,\n                 unsigned _progressInterval,\n                 unsigned _percentSourceUnaligned,\n                 unsigned _percentDestUnaligned,\n                 Addr _traceAddr,\n                 Counter _max_loads)\n    : SimObject(name),\n      tickEvent(this),\n      cacheInterface(_cache_interface),\n      mainMem(main_mem),\n      checkMem(check_mem),\n      size(_memorySize),\n      percentReads(_percentReads),\n      percentCopies(_percentCopies),\n      percentUncacheable(_percentUncacheable),\n      progressInterval(_progressInterval),\n      nextProgressMessage(_progressInterval),\n      percentSourceUnaligned(_percentSourceUnaligned),\n      percentDestUnaligned(percentDestUnaligned),\n      maxLoads(_max_loads)\n{\n    vector<string> cmd;\n    cmd.push_back(\"\/bin\/ls\");\n    vector<string> null_vec;\n    xc = new ExecContext(NULL, 0, mainMem, 0);\n\n    blockSize = cacheInterface->getBlockSize();\n    blockAddrMask = blockSize - 1;\n    traceBlockAddr = blockAddr(_traceAddr);\n\n    \/\/setup data storage with interesting values\n    uint8_t *data1 = new uint8_t[size];\n    uint8_t *data2 = new uint8_t[size];\n    uint8_t *data3 = new uint8_t[size];\n    memset(data1, 1, size);\n    memset(data2, 2, size);\n    memset(data3, 3, size);\n    curTick = 0;\n\n    baseAddr1 = 0x100000;\n    baseAddr2 = 0x400000;\n    uncacheAddr = 0x800000;\n\n    \/\/ set up intial memory contents here\n    mainMem->prot_write(baseAddr1, data1, size);\n    checkMem->prot_write(baseAddr1, data1, size);\n    mainMem->prot_write(baseAddr2, data2, size);\n    checkMem->prot_write(baseAddr2, data2, size);\n    mainMem->prot_write(uncacheAddr, data3, size);\n    checkMem->prot_write(uncacheAddr, data3, size);\n\n    delete [] data1;\n    delete [] data2;\n    delete [] data3;\n\n    \/\/ set up counters\n    noResponseCycles = 0;\n    numReads = 0;\n    tickEvent.schedule(0);\n\n    id = TESTER_ALLOCATOR++;\n}\n\nstatic void\nprintData(ostream &os, uint8_t *data, int nbytes)\n{\n    os << hex << setfill('0');\n    \/\/ assume little-endian: print bytes from highest address to lowest\n    for (uint8_t *dp = data + nbytes - 1; dp >= data; --dp) {\n        os << setw(2) << (unsigned)*dp;\n    }\n    os << dec;\n}\n\nvoid\nMemTest::completeRequest(MemReqPtr &req, uint8_t *data)\n{\n    \/\/Remove the address from the list of outstanding\n    std::set<unsigned>::iterator removeAddr = outstandingAddrs.find(req->paddr);\n    assert(removeAddr != outstandingAddrs.end());\n    outstandingAddrs.erase(removeAddr);\n\n    switch (req->cmd) {\n      case Read:\n        if (memcmp(req->data, data, req->size) != 0) {\n            cerr << name() << \": on read of 0x\" << hex << req->paddr\n                 << \" (0x\" << hex << blockAddr(req->paddr) << \")\"\n                 << \"@ cycle \" << dec << curTick\n                 << \", cache returns 0x\";\n            printData(cerr, req->data, req->size);\n            cerr << \", expected 0x\";\n            printData(cerr, data, req->size);\n            cerr << endl;\n            fatal(\"\");\n        }\n\n        numReads++;\n        numReadsStat++;\n\n        if (numReads == nextProgressMessage) {\n            ccprintf(cerr, \"%s: completed %d read accesses @%d\\n\",\n                     name(), numReads, curTick);\n            nextProgressMessage += progressInterval;\n        }\n\n        if (numReads >= maxLoads)\n            SimExit(curTick, \"Maximum number of loads reached!\");\n        break;\n\n      case Write:\n        numWritesStat++;\n        break;\n\n      case Copy:\n        \/\/Also remove dest from outstanding list\n        removeAddr = outstandingAddrs.find(req->dest);\n        assert(removeAddr != outstandingAddrs.end());\n        outstandingAddrs.erase(removeAddr);\n        numCopiesStat++;\n        break;\n\n      default:\n        panic(\"invalid command\");\n    }\n\n    if (blockAddr(req->paddr) == traceBlockAddr) {\n        cerr << name() << \": completed \"\n             << (req->cmd.isWrite() ? \"write\" : \"read\")\n             << \" access of \"\n             << dec << req->size << \" bytes at address 0x\"\n             << hex << req->paddr\n             << \" (0x\" << hex << blockAddr(req->paddr) << \")\"\n             << \", value = 0x\";\n        printData(cerr, req->data, req->size);\n        cerr << \" @ cycle \" << dec << curTick;\n\n        cerr << endl;\n    }\n\n    noResponseCycles = 0;\n    delete [] data;\n}\n\n\nvoid\nMemTest::regStats()\n{\n    using namespace Stats;\n\n\n    numReadsStat\n        .name(name() + \".num_reads\")\n        .desc(\"number of read accesses completed\")\n        ;\n\n    numWritesStat\n        .name(name() + \".num_writes\")\n        .desc(\"number of write accesses completed\")\n        ;\n\n    numCopiesStat\n        .name(name() + \".num_copies\")\n        .desc(\"number of copy accesses completed\")\n        ;\n}\n\nvoid\nMemTest::tick()\n{\n    if (!tickEvent.scheduled())\n        tickEvent.schedule(curTick + cycles(1));\n\n    if (++noResponseCycles >= 500000) {\n        cerr << name() << \": deadlocked at cycle \" << curTick << endl;\n        fatal(\"\");\n    }\n\n    if (cacheInterface->isBlocked()) {\n        return;\n    }\n\n    \/\/make new request\n    unsigned cmd = random() % 100;\n    unsigned offset = random() % size;\n    unsigned base = random() % 2;\n    uint64_t data = random();\n    unsigned access_size = random() % 4;\n    unsigned cacheable = random() % 100;\n\n    \/\/If we aren't doing copies, use id as offset, and do a false sharing\n    \/\/mem tester\n    if (percentCopies == 0) {\n        \/\/We can eliminate the lower bits of the offset, and then use the id\n        \/\/to offset within the blks\n        offset &= ~63; \/\/Not the low order bits\n        offset += id;\n        access_size = 0;\n    }\n\n    MemReqPtr req = new MemReq();\n\n    if (cacheable < percentUncacheable) {\n        req->flags |= UNCACHEABLE;\n        req->paddr = uncacheAddr + offset;\n    } else {\n        req->paddr = ((base) ? baseAddr1 : baseAddr2) + offset;\n    }\n    \/\/ bool probe = (random() % 2 == 1) && !req->isUncacheable();\n    bool probe = false;\n\n    req->size = 1 << access_size;\n    req->data = new uint8_t[req->size];\n    req->paddr &= ~(req->size - 1);\n    req->time = curTick;\n    req->xc = xc;\n\n    if (cmd < percentReads) {\n        \/\/ read\n\n        \/\/For now we only allow one outstanding request per addreess per tester\n        \/\/This means we assume CPU does write forwarding to reads that alias something\n        \/\/in the cpu store buffer.\n        if (outstandingAddrs.find(req->paddr) != outstandingAddrs.end()) return;\n        else outstandingAddrs.insert(req->paddr);\n\n        req->cmd = Read;\n        uint8_t *result = new uint8_t[8];\n        checkMem->access(Read, req->paddr, result, req->size);\n        if (blockAddr(req->paddr) == traceBlockAddr) {\n            cerr << name()\n                 << \": initiating read \"\n                 << ((probe) ? \"probe of \" : \"access of \")\n                 << dec << req->size << \" bytes from addr 0x\"\n                 << hex << req->paddr\n                 << \" (0x\" << hex << blockAddr(req->paddr) << \")\"\n                 << \" at cycle \"\n                 << dec << curTick << endl;\n        }\n        if (probe) {\n            cacheInterface->probeAndUpdate(req);\n            completeRequest(req, result);\n        } else {\n            req->completionEvent = new MemCompleteEvent(req, result, this);\n            cacheInterface->access(req);\n        }\n    } else if (cmd < (100 - percentCopies)){\n        \/\/ write\n\n        \/\/For now we only allow one outstanding request per addreess per tester\n        \/\/This means we assume CPU does write forwarding to reads that alias something\n        \/\/in the cpu store buffer.\n        if (outstandingAddrs.find(req->paddr) != outstandingAddrs.end()) return;\n        else outstandingAddrs.insert(req->paddr);\n\n        req->cmd = Write;\n        memcpy(req->data, &data, req->size);\n        checkMem->access(Write, req->paddr, req->data, req->size);\n        if (blockAddr(req->paddr) == traceBlockAddr) {\n            cerr << name() << \": initiating write \"\n                 << ((probe)?\"probe of \":\"access of \")\n                 << dec << req->size << \" bytes (value = 0x\";\n            printData(cerr, req->data, req->size);\n            cerr << \") to addr 0x\"\n                 << hex << req->paddr\n                 << \" (0x\" << hex << blockAddr(req->paddr) << \")\"\n                 << \" at cycle \"\n                 << dec << curTick << endl;\n        }\n        if (probe) {\n            cacheInterface->probeAndUpdate(req);\n            completeRequest(req, NULL);\n        } else {\n            req->completionEvent = new MemCompleteEvent(req, NULL, this);\n            cacheInterface->access(req);\n        }\n    } else {\n        \/\/ copy\n        unsigned source_align = random() % 100;\n        unsigned dest_align = random() % 100;\n        unsigned offset2 = random() % size;\n\n        Addr source = ((base) ? baseAddr1 : baseAddr2) + offset;\n        Addr dest = ((base) ? baseAddr2 : baseAddr1) + offset2;\n        if (outstandingAddrs.find(source) != outstandingAddrs.end()) return;\n        else outstandingAddrs.insert(source);\n        if (outstandingAddrs.find(dest) != outstandingAddrs.end()) return;\n        else outstandingAddrs.insert(dest);\n\n        if (source_align >= percentSourceUnaligned) {\n            source = blockAddr(source);\n        }\n        if (dest_align >= percentDestUnaligned) {\n            dest = blockAddr(dest);\n        }\n        req->cmd = Copy;\n        req->flags &= ~UNCACHEABLE;\n        req->paddr = source;\n        req->dest = dest;\n        delete [] req->data;\n        req->data = new uint8_t[blockSize];\n        req->size = blockSize;\n        if (source == traceBlockAddr || dest == traceBlockAddr) {\n            cerr << name()\n                 << \": initiating copy of \"\n                 << dec << req->size << \" bytes from addr 0x\"\n                 << hex << source\n                 << \" (0x\" << hex << blockAddr(source) << \")\"\n                 << \" to addr 0x\"\n                 << hex << dest\n                 << \" (0x\" << hex << blockAddr(dest) << \")\"\n                 << \" at cycle \"\n                 << dec << curTick << endl;\n        }\n        cacheInterface->access(req);\n        uint8_t result[blockSize];\n        checkMem->access(Read, source, &result, blockSize);\n        checkMem->access(Write, dest, &result, blockSize);\n    }\n}\n\n\nvoid\nMemCompleteEvent::process()\n{\n    tester->completeRequest(req, data);\n    delete this;\n}\n\n\nconst char *\nMemCompleteEvent::description()\n{\n    return \"memory access completion\";\n}\n\n\nBEGIN_DECLARE_SIM_OBJECT_PARAMS(MemTest)\n\n    SimObjectParam<BaseCache *> cache;\n    SimObjectParam<FunctionalMemory *> main_mem;\n    SimObjectParam<FunctionalMemory *> check_mem;\n    Param<unsigned> memory_size;\n    Param<unsigned> percent_reads;\n    Param<unsigned> percent_copies;\n    Param<unsigned> percent_uncacheable;\n    Param<unsigned> progress_interval;\n    Param<unsigned> percent_source_unaligned;\n    Param<unsigned> percent_dest_unaligned;\n    Param<Addr> trace_addr;\n    Param<Counter> max_loads;\n\nEND_DECLARE_SIM_OBJECT_PARAMS(MemTest)\n\n\nBEGIN_INIT_SIM_OBJECT_PARAMS(MemTest)\n\n    INIT_PARAM(cache, \"L1 cache\"),\n    INIT_PARAM(main_mem, \"hierarchical memory\"),\n    INIT_PARAM(check_mem, \"check memory\"),\n    INIT_PARAM(memory_size, \"memory size\"),\n    INIT_PARAM(percent_reads, \"target read percentage\"),\n    INIT_PARAM(percent_copies, \"target copy percentage\"),\n    INIT_PARAM(percent_uncacheable, \"target uncacheable percentage\"),\n    INIT_PARAM(progress_interval, \"progress report interval (in accesses)\"),\n    INIT_PARAM(percent_source_unaligned,\n               \"percent of copy source address that are unaligned\"),\n    INIT_PARAM(percent_dest_unaligned,\n               \"percent of copy dest address that are unaligned\"),\n    INIT_PARAM(trace_addr, \"address to trace\"),\n    INIT_PARAM(max_loads, \"terminate when we have reached this load count\")\n\nEND_INIT_SIM_OBJECT_PARAMS(MemTest)\n\n\nCREATE_SIM_OBJECT(MemTest)\n{\n    return new MemTest(getInstanceName(), cache->getInterface(), main_mem,\n                       check_mem, memory_size, percent_reads, percent_copies,\n                       percent_uncacheable, progress_interval,\n                       percent_source_unaligned, percent_dest_unaligned,\n                       trace_addr, max_loads);\n}\n\nREGISTER_SIM_OBJECT(\"MemTest\", MemTest)\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\nCopyright (c) 2003-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\/pch.hpp\"\n\n#include \"libtorrent\/file_storage.hpp\"\n#include \"libtorrent\/utf8.hpp\"\n#include <boost\/bind.hpp>\n\n\nnamespace libtorrent\n{\n\tfile_storage::file_storage()\n\t\t: m_piece_length(0)\n\t\t, m_total_size(0)\n\t\t, m_num_pieces(0)\n\t{}\n\n\tint file_storage::piece_size(int index) const\n\t{\n\t\tTORRENT_ASSERT(index >= 0 && index < num_pieces());\n\t\tif (index == num_pieces()-1)\n\t\t{\n\t\t\tint size = int(total_size()\n\t\t\t\t- size_type(num_pieces() - 1) * piece_length());\n\t\t\tTORRENT_ASSERT(size > 0);\n\t\t\tTORRENT_ASSERT(size <= piece_length());\n\t\t\treturn int(size);\n\t\t}\n\t\telse\n\t\t\treturn piece_length();\n\t}\n\n#ifndef BOOST_FILESYSTEM_NARROW_ONLY\n\tvoid file_storage::set_name(std::wstring const& n)\n\t{\n\t\tstd::string utf8;\n\t\twchar_utf8(n, utf8);\n\t\tm_name = utf8;\n\t}\n\n\tvoid file_storage::rename_file(int index, std::wstring const& new_filename)\n\t{\n\t\tTORRENT_ASSERT(index >= 0 && index < int(m_files.size()));\n\t\tstd::string utf8;\n\t\twchar_utf8(new_filename, utf8);\n\t\tm_files[index].path = utf8;\n\t}\n\n\tvoid file_storage::add_file(fs::wpath const& file, size_type size, int flags)\n\t{\n\t\tstd::string utf8;\n\t\twchar_utf8(file.string(), utf8);\n\t\tadd_file(utf8, size, flags);\n\t}\n#endif\n\n\tvoid file_storage::rename_file(int index, std::string const& new_filename)\n\t{\n\t\tTORRENT_ASSERT(index >= 0 && index < int(m_files.size()));\n\t\tm_files[index].path = new_filename;\n\t}\n\n\tfile_storage::iterator file_storage::file_at_offset(size_type offset) const\n\t{\n\t\t\/\/ TODO: do a binary search\n\t\tstd::vector<file_entry>::const_iterator i;\n\t\tfor (i = begin(); i != end(); ++i)\n\t\t{\n\t\t\tif (i->offset <= offset && i->offset + i->size > offset)\n\t\t\t\treturn i;\n\t\t}\n\t\treturn i;\n\t}\n\n\tnamespace\n\t{\n\t\tbool compare_file_offset(file_entry const& lhs, file_entry const& rhs)\n\t\t{\n\t\t\treturn lhs.offset < rhs.offset;\n\t\t}\n\t}\n\n\tstd::vector<file_slice> file_storage::map_block(int piece, size_type offset\n\t\t, int size) const\n\t{\n\t\tTORRENT_ASSERT(num_files() > 0);\n\t\tstd::vector<file_slice> ret;\n\n\t\tif (m_files.empty()) return ret;\n\n\t\t\/\/ find the file iterator and file offset\n\t\tfile_entry target;\n\t\ttarget.offset = piece * (size_type)m_piece_length + offset;\n\t\tTORRENT_ASSERT(target.offset + size <= m_total_size);\n\t\tTORRENT_ASSERT(!compare_file_offset(target, m_files.front()));\n\n\t\tstd::vector<file_entry>::const_iterator file_iter = std::upper_bound(\n\t\t\tbegin(), end(), target, compare_file_offset);\n\n\t\tTORRENT_ASSERT(file_iter != begin());\n\t\t--file_iter;\n\n\t\tsize_type file_offset = target.offset - file_iter->offset;\n\t\tfor (; size > 0; file_offset -= file_iter->size, ++file_iter)\n\t\t{\n\t\t\tTORRENT_ASSERT(file_iter != end());\n\t\t\tif (file_offset < file_iter->size)\n\t\t\t{\n\t\t\t\tfile_slice f;\n\t\t\t\tf.file_index = file_iter - begin();\n\t\t\t\tf.offset = file_offset + file_iter->file_base;\n\t\t\t\tf.size = (std::min)(file_iter->size - file_offset, (size_type)size);\n\t\t\t\tsize -= f.size;\n\t\t\t\tfile_offset += f.size;\n\t\t\t\tret.push_back(f);\n\t\t\t}\n\t\t\t\n\t\t\tTORRENT_ASSERT(size >= 0);\n\t\t}\n\t\treturn ret;\n\t}\n\t\n\tpeer_request file_storage::map_file(int file_index, size_type file_offset\n\t\t, int size) const\n\t{\n\t\tTORRENT_ASSERT(file_index < num_files());\n\t\tTORRENT_ASSERT(file_index >= 0);\n\t\tsize_type offset = file_offset + at(file_index).offset;\n\n\t\tpeer_request ret;\n\t\tret.piece = int(offset \/ piece_length());\n\t\tret.start = int(offset - ret.piece * piece_length());\n\t\tret.length = size;\n\t\treturn ret;\n\t}\n\n\tvoid file_storage::add_file(fs::path const& file, size_type size, int flags)\n\t{\n\t\tTORRENT_ASSERT(size >= 0);\n#if BOOST_VERSION < 103600\n\t\tif (!file.has_branch_path())\n#else\n\t\tif (!file.has_parent_path())\n#endif\n\t\t{\n\t\t\t\/\/ you have already added at least one file with a\n\t\t\t\/\/ path to the file (branch_path), which means that\n\t\t\t\/\/ all the other files need to be in the same top\n\t\t\t\/\/ directory as the first file.\n\t\t\tTORRENT_ASSERT(m_files.empty());\n\t\t\tm_name = file.string();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif (m_files.empty())\n\t\t\t\tm_name = *file.begin();\n\t\t}\n\t\tTORRENT_ASSERT(m_name == *file.begin());\n\t\tm_files.push_back(file_entry());\n\t\tfile_entry& e = m_files.back();\n\t\te.size = size;\n\t\te.path = file;\n\t\te.offset = m_total_size;\n\t\te.pad_file = bool(flags & pad_file);\n\t\te.hidden_attribute = bool(flags & attribute_hidden);\n\t\te.executable_attribute = bool(flags & attribute_executable);\n\t\tm_total_size += size;\n\t}\n\n\tvoid file_storage::add_file(file_entry const& ent)\n\t{\n#if BOOST_VERSION < 103600\n\t\tif (!ent.path.has_branch_path())\n#else\n\t\tif (!ent.path.has_parent_path())\n#endif\n\t\t{\n\t\t\t\/\/ you have already added at least one file with a\n\t\t\t\/\/ path to the file (branch_path), which means that\n\t\t\t\/\/ all the other files need to be in the same top\n\t\t\t\/\/ directory as the first file.\n\t\t\tTORRENT_ASSERT(m_files.empty());\n\t\t\tm_name = ent.path.string();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif (m_files.empty())\n\t\t\t\tm_name = *ent.path.begin();\n\t\t}\n\t\tm_files.push_back(ent);\n\t\tfile_entry& e = m_files.back();\n\t\te.offset = m_total_size;\n\t\tm_total_size += ent.size;\n\t}\n\n\tvoid file_storage::optimize(int pad_file_limit)\n\t{\n\t\t\/\/ the main purpuse of padding is to optimize disk\n\t\t\/\/ I\/O. This is a conservative memory page size assumption\n\t\tint alignment = 8*1024;\n\n\t\t\/\/ it doesn't make any sense to pad files that\n\t\t\/\/ are smaller than one piece\n\t\tif (pad_file_limit >= 0 && pad_file_limit < alignment)\n\t\t\tpad_file_limit = alignment;\n\n\t\t\/\/ put the largest file at the front, to make sure\n\t\t\/\/ it's aligned\n\t\tstd::vector<file_entry>::iterator i = std::max_element(m_files.begin(), m_files.end()\n\t\t\t, boost::bind(&file_entry::size, _1) < boost::bind(&file_entry::size, _2));\n\n\t\tusing std::iter_swap;\n\t\titer_swap(i, m_files.begin());\n\n\t\tsize_type off = 0;\n\t\tint padding_file = 0;\n\t\tfor (std::vector<file_entry>::iterator i = m_files.begin();\n\t\t\ti != m_files.end(); ++i)\n\t\t{\n\t\t\tif (pad_file_limit >= 0\n\t\t\t\t&& (off & (alignment-1)) != 0\n\t\t\t\t&& i->size > pad_file_limit\n\t\t\t\t&& i->pad_file == false)\n\t\t\t{\n\t\t\t\t\/\/ if we have pad files enabled, and this file is\n\t\t\t\t\/\/ not piece-aligned and the file size exceeds the\n\t\t\t\t\/\/ limit, and it's not a padding file itself.\n\t\t\t\t\/\/ so add a padding file in front of it\n\t\t\t\tint pad_size = alignment - (off & (alignment-1));\n\t\t\t\t\n\t\t\t\t\/\/ find the largest file that fits in pad_size\n\t\t\t\tstd::vector<file_entry>::iterator best_match = m_files.end();\n\t\t\t\tfor (std::vector<file_entry>::iterator j = i+1; j < m_files.end(); ++j)\n\t\t\t\t{\n\t\t\t\t\tif (j->size > pad_size) continue;\n\t\t\t\t\tif (best_match == m_files.end() || j->size > best_match->size)\n\t\t\t\t\t\tbest_match = j;\n\t\t\t\t}\n\n\t\t\t\tif (best_match != m_files.end())\n\t\t\t\t{\n\t\t\t\t\t\/\/ we found one\n\t\t\t\t\tfile_entry e = *best_match;\n\t\t\t\t\tm_files.erase(best_match);\n\t\t\t\t\ti = m_files.insert(i, e);\n\t\t\t\t\ti->offset = off;\n\t\t\t\t\toff += i->size;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\t\/\/ we could not find a file that fits in pad_size\n\t\t\t\t\/\/ add a padding file\n\n\t\t\t\tfile_entry e;\n\t\t\t\ti = m_files.insert(i, e);\n\t\t\t\ti->size = pad_size;\n\t\t\t\ti->offset = off;\n\t\t\t\ti->file_base = 0;\n\t\t\t\tchar name[10];\n\t\t\t\tstd::sprintf(name, \"%d\", padding_file);\n\t\t\t\ti->path = *(i+1)->path.begin();\n\t\t\t\ti->path \/= \"_____padding_file_\";\n\t\t\t\ti->path \/= name;\n\t\t\t\ti->pad_file = true;\n\t\t\t\toff += pad_size;\n\t\t\t\t++padding_file;\n\t\t\t\t++i;\n\t\t\t}\n\t\t\ti->offset = off;\n\t\t\toff += i->size;\n\t\t}\n\t\tm_total_size = off;\n\t}\n}\n\n<commit_msg>Fix build on GCC 4.4.<commit_after>\/*\n\nCopyright (c) 2003-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\/pch.hpp\"\n\n#include \"libtorrent\/file_storage.hpp\"\n#include \"libtorrent\/utf8.hpp\"\n#include <boost\/bind.hpp>\n#include <cstdio>\n\n\nnamespace libtorrent\n{\n\tfile_storage::file_storage()\n\t\t: m_piece_length(0)\n\t\t, m_total_size(0)\n\t\t, m_num_pieces(0)\n\t{}\n\n\tint file_storage::piece_size(int index) const\n\t{\n\t\tTORRENT_ASSERT(index >= 0 && index < num_pieces());\n\t\tif (index == num_pieces()-1)\n\t\t{\n\t\t\tint size = int(total_size()\n\t\t\t\t- size_type(num_pieces() - 1) * piece_length());\n\t\t\tTORRENT_ASSERT(size > 0);\n\t\t\tTORRENT_ASSERT(size <= piece_length());\n\t\t\treturn int(size);\n\t\t}\n\t\telse\n\t\t\treturn piece_length();\n\t}\n\n#ifndef BOOST_FILESYSTEM_NARROW_ONLY\n\tvoid file_storage::set_name(std::wstring const& n)\n\t{\n\t\tstd::string utf8;\n\t\twchar_utf8(n, utf8);\n\t\tm_name = utf8;\n\t}\n\n\tvoid file_storage::rename_file(int index, std::wstring const& new_filename)\n\t{\n\t\tTORRENT_ASSERT(index >= 0 && index < int(m_files.size()));\n\t\tstd::string utf8;\n\t\twchar_utf8(new_filename, utf8);\n\t\tm_files[index].path = utf8;\n\t}\n\n\tvoid file_storage::add_file(fs::wpath const& file, size_type size, int flags)\n\t{\n\t\tstd::string utf8;\n\t\twchar_utf8(file.string(), utf8);\n\t\tadd_file(utf8, size, flags);\n\t}\n#endif\n\n\tvoid file_storage::rename_file(int index, std::string const& new_filename)\n\t{\n\t\tTORRENT_ASSERT(index >= 0 && index < int(m_files.size()));\n\t\tm_files[index].path = new_filename;\n\t}\n\n\tfile_storage::iterator file_storage::file_at_offset(size_type offset) const\n\t{\n\t\t\/\/ TODO: do a binary search\n\t\tstd::vector<file_entry>::const_iterator i;\n\t\tfor (i = begin(); i != end(); ++i)\n\t\t{\n\t\t\tif (i->offset <= offset && i->offset + i->size > offset)\n\t\t\t\treturn i;\n\t\t}\n\t\treturn i;\n\t}\n\n\tnamespace\n\t{\n\t\tbool compare_file_offset(file_entry const& lhs, file_entry const& rhs)\n\t\t{\n\t\t\treturn lhs.offset < rhs.offset;\n\t\t}\n\t}\n\n\tstd::vector<file_slice> file_storage::map_block(int piece, size_type offset\n\t\t, int size) const\n\t{\n\t\tTORRENT_ASSERT(num_files() > 0);\n\t\tstd::vector<file_slice> ret;\n\n\t\tif (m_files.empty()) return ret;\n\n\t\t\/\/ find the file iterator and file offset\n\t\tfile_entry target;\n\t\ttarget.offset = piece * (size_type)m_piece_length + offset;\n\t\tTORRENT_ASSERT(target.offset + size <= m_total_size);\n\t\tTORRENT_ASSERT(!compare_file_offset(target, m_files.front()));\n\n\t\tstd::vector<file_entry>::const_iterator file_iter = std::upper_bound(\n\t\t\tbegin(), end(), target, compare_file_offset);\n\n\t\tTORRENT_ASSERT(file_iter != begin());\n\t\t--file_iter;\n\n\t\tsize_type file_offset = target.offset - file_iter->offset;\n\t\tfor (; size > 0; file_offset -= file_iter->size, ++file_iter)\n\t\t{\n\t\t\tTORRENT_ASSERT(file_iter != end());\n\t\t\tif (file_offset < file_iter->size)\n\t\t\t{\n\t\t\t\tfile_slice f;\n\t\t\t\tf.file_index = file_iter - begin();\n\t\t\t\tf.offset = file_offset + file_iter->file_base;\n\t\t\t\tf.size = (std::min)(file_iter->size - file_offset, (size_type)size);\n\t\t\t\tsize -= f.size;\n\t\t\t\tfile_offset += f.size;\n\t\t\t\tret.push_back(f);\n\t\t\t}\n\t\t\t\n\t\t\tTORRENT_ASSERT(size >= 0);\n\t\t}\n\t\treturn ret;\n\t}\n\t\n\tpeer_request file_storage::map_file(int file_index, size_type file_offset\n\t\t, int size) const\n\t{\n\t\tTORRENT_ASSERT(file_index < num_files());\n\t\tTORRENT_ASSERT(file_index >= 0);\n\t\tsize_type offset = file_offset + at(file_index).offset;\n\n\t\tpeer_request ret;\n\t\tret.piece = int(offset \/ piece_length());\n\t\tret.start = int(offset - ret.piece * piece_length());\n\t\tret.length = size;\n\t\treturn ret;\n\t}\n\n\tvoid file_storage::add_file(fs::path const& file, size_type size, int flags)\n\t{\n\t\tTORRENT_ASSERT(size >= 0);\n#if BOOST_VERSION < 103600\n\t\tif (!file.has_branch_path())\n#else\n\t\tif (!file.has_parent_path())\n#endif\n\t\t{\n\t\t\t\/\/ you have already added at least one file with a\n\t\t\t\/\/ path to the file (branch_path), which means that\n\t\t\t\/\/ all the other files need to be in the same top\n\t\t\t\/\/ directory as the first file.\n\t\t\tTORRENT_ASSERT(m_files.empty());\n\t\t\tm_name = file.string();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif (m_files.empty())\n\t\t\t\tm_name = *file.begin();\n\t\t}\n\t\tTORRENT_ASSERT(m_name == *file.begin());\n\t\tm_files.push_back(file_entry());\n\t\tfile_entry& e = m_files.back();\n\t\te.size = size;\n\t\te.path = file;\n\t\te.offset = m_total_size;\n\t\te.pad_file = bool(flags & pad_file);\n\t\te.hidden_attribute = bool(flags & attribute_hidden);\n\t\te.executable_attribute = bool(flags & attribute_executable);\n\t\tm_total_size += size;\n\t}\n\n\tvoid file_storage::add_file(file_entry const& ent)\n\t{\n#if BOOST_VERSION < 103600\n\t\tif (!ent.path.has_branch_path())\n#else\n\t\tif (!ent.path.has_parent_path())\n#endif\n\t\t{\n\t\t\t\/\/ you have already added at least one file with a\n\t\t\t\/\/ path to the file (branch_path), which means that\n\t\t\t\/\/ all the other files need to be in the same top\n\t\t\t\/\/ directory as the first file.\n\t\t\tTORRENT_ASSERT(m_files.empty());\n\t\t\tm_name = ent.path.string();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif (m_files.empty())\n\t\t\t\tm_name = *ent.path.begin();\n\t\t}\n\t\tm_files.push_back(ent);\n\t\tfile_entry& e = m_files.back();\n\t\te.offset = m_total_size;\n\t\tm_total_size += ent.size;\n\t}\n\n\tvoid file_storage::optimize(int pad_file_limit)\n\t{\n\t\t\/\/ the main purpuse of padding is to optimize disk\n\t\t\/\/ I\/O. This is a conservative memory page size assumption\n\t\tint alignment = 8*1024;\n\n\t\t\/\/ it doesn't make any sense to pad files that\n\t\t\/\/ are smaller than one piece\n\t\tif (pad_file_limit >= 0 && pad_file_limit < alignment)\n\t\t\tpad_file_limit = alignment;\n\n\t\t\/\/ put the largest file at the front, to make sure\n\t\t\/\/ it's aligned\n\t\tstd::vector<file_entry>::iterator i = std::max_element(m_files.begin(), m_files.end()\n\t\t\t, boost::bind(&file_entry::size, _1) < boost::bind(&file_entry::size, _2));\n\n\t\tusing std::iter_swap;\n\t\titer_swap(i, m_files.begin());\n\n\t\tsize_type off = 0;\n\t\tint padding_file = 0;\n\t\tfor (std::vector<file_entry>::iterator i = m_files.begin();\n\t\t\ti != m_files.end(); ++i)\n\t\t{\n\t\t\tif (pad_file_limit >= 0\n\t\t\t\t&& (off & (alignment-1)) != 0\n\t\t\t\t&& i->size > pad_file_limit\n\t\t\t\t&& i->pad_file == false)\n\t\t\t{\n\t\t\t\t\/\/ if we have pad files enabled, and this file is\n\t\t\t\t\/\/ not piece-aligned and the file size exceeds the\n\t\t\t\t\/\/ limit, and it's not a padding file itself.\n\t\t\t\t\/\/ so add a padding file in front of it\n\t\t\t\tint pad_size = alignment - (off & (alignment-1));\n\t\t\t\t\n\t\t\t\t\/\/ find the largest file that fits in pad_size\n\t\t\t\tstd::vector<file_entry>::iterator best_match = m_files.end();\n\t\t\t\tfor (std::vector<file_entry>::iterator j = i+1; j < m_files.end(); ++j)\n\t\t\t\t{\n\t\t\t\t\tif (j->size > pad_size) continue;\n\t\t\t\t\tif (best_match == m_files.end() || j->size > best_match->size)\n\t\t\t\t\t\tbest_match = j;\n\t\t\t\t}\n\n\t\t\t\tif (best_match != m_files.end())\n\t\t\t\t{\n\t\t\t\t\t\/\/ we found one\n\t\t\t\t\tfile_entry e = *best_match;\n\t\t\t\t\tm_files.erase(best_match);\n\t\t\t\t\ti = m_files.insert(i, e);\n\t\t\t\t\ti->offset = off;\n\t\t\t\t\toff += i->size;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\t\/\/ we could not find a file that fits in pad_size\n\t\t\t\t\/\/ add a padding file\n\n\t\t\t\tfile_entry e;\n\t\t\t\ti = m_files.insert(i, e);\n\t\t\t\ti->size = pad_size;\n\t\t\t\ti->offset = off;\n\t\t\t\ti->file_base = 0;\n\t\t\t\tchar name[10];\n\t\t\t\tstd::sprintf(name, \"%d\", padding_file);\n\t\t\t\ti->path = *(i+1)->path.begin();\n\t\t\t\ti->path \/= \"_____padding_file_\";\n\t\t\t\ti->path \/= name;\n\t\t\t\ti->pad_file = true;\n\t\t\t\toff += pad_size;\n\t\t\t\t++padding_file;\n\t\t\t\t++i;\n\t\t\t}\n\t\t\ti->offset = off;\n\t\t\toff += i->size;\n\t\t}\n\t\tm_total_size = off;\n\t}\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/ui\/views\/browser_bubble.h\"\n\nvoid BrowserBubble::InitPopup(const gfx::Insets& content_margins) {\n  \/\/ TODO(beng):\n  NOTIMPLEMENTED();\n}\n\nvoid BrowserBubble::Show(bool activate) {\n  \/\/ TODO(beng):\n  NOTIMPLEMENTED();\n}\n\nvoid BrowserBubble::Hide() {\n  \/\/ TODO(beng):\n  NOTIMPLEMENTED();\n}\n\nvoid BrowserBubble::ResizeToView() {\n  \/\/ TODO(beng):\n  NOTIMPLEMENTED();\n}\n<commit_msg>Add reference to the bug in browser_bubble_aura.cc<commit_after>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/ui\/views\/browser_bubble.h\"\n\n\/\/ TODO(msw|oshima): This will be replaced with new bubble.\n\/\/ See crbug.com\/97248.\n\nvoid BrowserBubble::InitPopup(const gfx::Insets& content_margins) {\n  NOTIMPLEMENTED();\n}\n\nvoid BrowserBubble::Show(bool activate) {\n  NOTIMPLEMENTED();\n}\n\nvoid BrowserBubble::Hide() {\n  NOTIMPLEMENTED();\n}\n\nvoid BrowserBubble::ResizeToView() {\n  NOTIMPLEMENTED();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/========= Copyright Valve Corporation, All rights reserved. ============\/\/\n\/\/\n\/\/ Purpose: \n\/\/\n\/\/=============================================================================\/\/\n\n#include \"cbase.h\"\n#include \"weapon_hl2mpbasehlmpcombatweapon.h\"\n\n#include \"hl2mp_player_shared.h\"\n\n\/\/ memdbgon must be the last include file in a .cpp file!!!\n#include \"tier0\/memdbgon.h\"\n\nLINK_ENTITY_TO_CLASS( basehl2mpcombatweapon, CBaseHL2MPCombatWeapon );\n\nIMPLEMENT_NETWORKCLASS_ALIASED( BaseHL2MPCombatWeapon , DT_BaseHL2MPCombatWeapon )\n\nBEGIN_NETWORK_TABLE( CBaseHL2MPCombatWeapon , DT_BaseHL2MPCombatWeapon )\n#if !defined( CLIENT_DLL )\n\/\/\tSendPropInt( SENDINFO( m_bReflectViewModelAnimations ), 1, SPROP_UNSIGNED ),\n#else\n\/\/\tRecvPropInt( RECVINFO( m_bReflectViewModelAnimations ) ),\n#endif\nEND_NETWORK_TABLE()\n\n\n#if !defined( CLIENT_DLL )\n\n#include \"globalstate.h\"\n\n\/\/---------------------------------------------------------\n\/\/ Save\/Restore\n\/\/---------------------------------------------------------\nBEGIN_DATADESC( CBaseHL2MPCombatWeapon )\n\n\tDEFINE_FIELD( m_bLowered,\t\t\tFIELD_BOOLEAN ),\n\tDEFINE_FIELD( m_flRaiseTime,\t\tFIELD_TIME ),\n\tDEFINE_FIELD( m_flHolsterTime,\t\tFIELD_TIME ),\n\nEND_DATADESC()\n\n#endif\n\nBEGIN_PREDICTION_DATA( CBaseHL2MPCombatWeapon )\nEND_PREDICTION_DATA()\n\nextern ConVar sk_auto_reload_time;\n\nCBaseHL2MPCombatWeapon::CBaseHL2MPCombatWeapon( void )\n{\n\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Purpose: \n\/\/-----------------------------------------------------------------------------\nvoid CBaseHL2MPCombatWeapon::ItemHolsterFrame( void )\n{\n\tBaseClass::ItemHolsterFrame();\n\n\t\/\/ Must be player held\n\tif ( GetOwner() && GetOwner()->IsPlayer() == false )\n\t\treturn;\n\n\t\/\/ We can't be active\n\tif ( GetOwner()->GetActiveWeapon() == this )\n\t\treturn;\n\n\t\/\/ If it's been longer than three seconds, reload\n\tif ( ( gpGlobals->curtime - m_flHolsterTime ) > sk_auto_reload_time.GetFloat() )\n\t{\n\t\t\/\/ Just load the clip with no animations\n\t\tFinishReload();\n\t\tm_flHolsterTime = gpGlobals->curtime;\n\t}\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Purpose: Drops the weapon into a lowered pose\n\/\/ Output : Returns true on success, false on failure.\n\/\/-----------------------------------------------------------------------------\nbool CBaseHL2MPCombatWeapon::Lower( void )\n{\n\t\/\/Don't bother if we don't have the animation\n\tif ( SelectWeightedSequence( ACT_VM_IDLE_LOWERED ) == ACTIVITY_NOT_AVAILABLE )\n\t\treturn false;\n\n\tm_bLowered = true;\n\treturn true;\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Purpose: Brings the weapon up to the ready position\n\/\/ Output : Returns true on success, false on failure.\n\/\/-----------------------------------------------------------------------------\nbool CBaseHL2MPCombatWeapon::Ready( void )\n{\n\t\/\/Don't bother if we don't have the animation\n\tif ( SelectWeightedSequence( ACT_VM_LOWERED_TO_IDLE ) == ACTIVITY_NOT_AVAILABLE )\n\t\treturn false;\n\n\tm_bLowered = false;\t\n\tm_flRaiseTime = gpGlobals->curtime + 0.5f;\n\treturn true;\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Purpose: \n\/\/ Output : Returns true on success, false on failure.\n\/\/-----------------------------------------------------------------------------\nbool CBaseHL2MPCombatWeapon::Deploy( void )\n{\n\t\/\/ If we should be lowered, deploy in the lowered position\n\t\/\/ We have to ask the player if the last time it checked, the weapon was lowered\n\tif ( GetOwner() && GetOwner()->IsPlayer() )\n\t{\n\t\tCHL2MP_Player *pPlayer = assert_cast<CHL2MP_Player*>( GetOwner() );\n\t\tif ( pPlayer->IsWeaponLowered() )\n\t\t{\n\t\t\tif ( SelectWeightedSequence( ACT_VM_IDLE_LOWERED ) != ACTIVITY_NOT_AVAILABLE )\n\t\t\t{\n\t\t\t\tif ( DefaultDeploy( (char*)GetViewModel(), (char*)GetWorldModel(), ACT_VM_IDLE_LOWERED, (char*)GetAnimPrefix() ) )\n\t\t\t\t{\n\t\t\t\t\tm_bLowered = true;\n\n\t\t\t\t\t\/\/ Stomp the next attack time to fix the fact that the lower idles are long\n\t\t\t\t\tpPlayer->SetNextAttack( gpGlobals->curtime + 1.0 );\n\t\t\t\t\tm_flNextPrimaryAttack = gpGlobals->curtime + 1.0;\n\t\t\t\t\tm_flNextSecondaryAttack\t= gpGlobals->curtime + 1.0;\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tm_bLowered = false;\n\treturn BaseClass::Deploy();\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Purpose: \n\/\/ Output : Returns true on success, false on failure.\n\/\/-----------------------------------------------------------------------------\nbool CBaseHL2MPCombatWeapon::Holster( CBaseCombatWeapon *pSwitchingTo )\n{\n\tif ( BaseClass::Holster( pSwitchingTo ) )\n\t{\n\t\tSetWeaponVisible( false );\n\t\tm_flHolsterTime = gpGlobals->curtime;\n\t\treturn true;\n\t}\n\n\treturn false;\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Purpose: \n\/\/ Output : Returns true on success, false on failure.\n\/\/-----------------------------------------------------------------------------\nbool CBaseHL2MPCombatWeapon::WeaponShouldBeLowered( void )\n{\n\t\/\/ Can't be in the middle of another animation\n  \tif ( GetIdealActivity() != ACT_VM_IDLE_LOWERED && GetIdealActivity() != ACT_VM_IDLE &&\n\t\t GetIdealActivity() != ACT_VM_IDLE_TO_LOWERED && GetIdealActivity() != ACT_VM_LOWERED_TO_IDLE )\n  \t\treturn false;\n\n\tif ( m_bLowered )\n\t\treturn true;\n\t\n#if !defined( CLIENT_DLL )\n\n\tif ( GlobalEntity_GetState( \"friendly_encounter\" ) == GLOBAL_ON )\n\t\treturn true;\n\n#endif\n\n\treturn false;\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Purpose: Allows the weapon to choose proper weapon idle animation\n\/\/-----------------------------------------------------------------------------\nvoid CBaseHL2MPCombatWeapon::WeaponIdle( void )\n{\n\t\/\/See if we should idle high or low\n\tif ( WeaponShouldBeLowered() )\n\t{\n\t\t\/\/ Move to lowered position if we're not there yet\n\t\tif ( GetActivity() != ACT_VM_IDLE_LOWERED && GetActivity() != ACT_VM_IDLE_TO_LOWERED \n\t\t\t && GetActivity() != ACT_TRANSITION )\n\t\t{\n\t\t\tSendWeaponAnim( ACT_VM_IDLE_LOWERED );\n\t\t}\n\t\telse if ( HasWeaponIdleTimeElapsed() )\n\t\t{\n\t\t\t\/\/ Keep idling low\n\t\t\tSendWeaponAnim( ACT_VM_IDLE_LOWERED );\n\t\t}\n\t}\n\telse\n\t{\n\t\t\/\/ See if we need to raise immediately\n\t\tif ( m_flRaiseTime < gpGlobals->curtime && GetActivity() == ACT_VM_IDLE_LOWERED ) \n\t\t{\n\t\t\tSendWeaponAnim( ACT_VM_IDLE );\n\t\t}\n\t\telse if ( HasWeaponIdleTimeElapsed() ) \n\t\t{\n\t\t\tSendWeaponAnim( ACT_VM_IDLE );\n\t\t}\n\t}\n}\n\n#if defined( CLIENT_DLL )\n\n#define\tHL2_BOB_CYCLE_MIN\t1.0f\n#define\tHL2_BOB_CYCLE_MAX\t0.45f\n#define\tHL2_BOB\t\t\t0.002f\n#define\tHL2_BOB_UP\t\t0.5f\n\nextern float\tg_lateralBob;\nextern float\tg_verticalBob;\n\nstatic ConVar\tcl_bobcycle( \"cl_bobcycle\",\"0.8\" );\nstatic ConVar\tcl_bob( \"cl_bob\",\"0.002\" );\nstatic ConVar\tcl_bobup( \"cl_bobup\",\"0.5\" );\n\n\/\/ Register these cvars if needed for easy tweaking\nstatic ConVar\tv_iyaw_cycle( \"v_iyaw_cycle\", \"2\", FCVAR_REPLICATED | FCVAR_CHEAT );\nstatic ConVar\tv_iroll_cycle( \"v_iroll_cycle\", \"0.5\", FCVAR_REPLICATED | FCVAR_CHEAT );\nstatic ConVar\tv_ipitch_cycle( \"v_ipitch_cycle\", \"1\", FCVAR_REPLICATED | FCVAR_CHEAT );\nstatic ConVar\tv_iyaw_level( \"v_iyaw_level\", \"0.3\", FCVAR_REPLICATED | FCVAR_CHEAT );\nstatic ConVar\tv_iroll_level( \"v_iroll_level\", \"0.1\", FCVAR_REPLICATED | FCVAR_CHEAT );\nstatic ConVar\tv_ipitch_level( \"v_ipitch_level\", \"0.3\", FCVAR_REPLICATED | FCVAR_CHEAT );\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Purpose: \n\/\/ Output : float\n\/\/-----------------------------------------------------------------------------\nfloat CBaseHL2MPCombatWeapon::CalcViewmodelBob( void )\n{\n\tstatic\tfloat bobtime;\n\tstatic\tfloat lastbobtime;\n\tfloat\tcycle;\n\t\n\tCBasePlayer *player = ToBasePlayer( GetOwner() );\n\t\/\/Assert( player );\n\n\t\/\/NOTENOTE: For now, let this cycle continue when in the air, because it snaps badly without it\n\n\tif ( ( !gpGlobals->frametime ) || ( player == NULL ) )\n\t{\n\t\t\/\/NOTENOTE: We don't use this return value in our case (need to restructure the calculation function setup!)\n\t\treturn 0.0f;\/\/ just use old value\n\t}\n\n\t\/\/Find the speed of the player\n\tfloat speed = player->GetLocalVelocity().Length2D();\n\n\t\/\/FIXME: This maximum speed value must come from the server.\n\t\/\/\t\t MaxSpeed() is not sufficient for dealing with sprinting - jdw\n\n\tspeed = clamp( speed, -320, 320 );\n\n\tfloat bob_offset = RemapVal( speed, 0, 320, 0.0f, 1.0f );\n\t\n\tbobtime += ( gpGlobals->curtime - lastbobtime ) * bob_offset;\n\tlastbobtime = gpGlobals->curtime;\n\n\t\/\/Calculate the vertical bob\n\tcycle = bobtime - (int)(bobtime\/HL2_BOB_CYCLE_MAX)*HL2_BOB_CYCLE_MAX;\n\tcycle \/= HL2_BOB_CYCLE_MAX;\n\n\tif ( cycle < HL2_BOB_UP )\n\t{\n\t\tcycle = M_PI * cycle \/ HL2_BOB_UP;\n\t}\n\telse\n\t{\n\t\tcycle = M_PI + M_PI*(cycle-HL2_BOB_UP)\/(1.0 - HL2_BOB_UP);\n\t}\n\t\n\tg_verticalBob = speed*0.005f;\n\tg_verticalBob = g_verticalBob*0.3 + g_verticalBob*0.7*sin(cycle);\n\n\tg_verticalBob = clamp( g_verticalBob, -7.0f, 4.0f );\n\n\t\/\/Calculate the lateral bob\n\tcycle = bobtime - (int)(bobtime\/HL2_BOB_CYCLE_MAX*2)*HL2_BOB_CYCLE_MAX*2;\n\tcycle \/= HL2_BOB_CYCLE_MAX*2;\n\n\tif ( cycle < HL2_BOB_UP )\n\t{\n\t\tcycle = M_PI * cycle \/ HL2_BOB_UP;\n\t}\n\telse\n\t{\n\t\tcycle = M_PI + M_PI*(cycle-HL2_BOB_UP)\/(1.0 - HL2_BOB_UP);\n\t}\n\n\tg_lateralBob = speed*0.005f;\n\tg_lateralBob = g_lateralBob*0.3 + g_lateralBob*0.7*sin(cycle);\n\tg_lateralBob = clamp( g_lateralBob, -7.0f, 4.0f );\n\t\n\t\/\/NOTENOTE: We don't use this return value in our case (need to restructure the calculation function setup!)\n\treturn 0.0f;\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Purpose: \n\/\/ Input  : &origin - \n\/\/\t\t\t&angles - \n\/\/\t\t\tviewmodelindex - \n\/\/-----------------------------------------------------------------------------\nvoid CBaseHL2MPCombatWeapon::AddViewmodelBob( CBaseViewModel *viewmodel, Vector &origin, QAngle &angles )\n{\n\tVector\tforward, right;\n\tAngleVectors( angles, &forward, &right, NULL );\n\n\tCalcViewmodelBob();\n\n\t\/\/ Apply bob, but scaled down to 40%\n\tVectorMA( origin, g_verticalBob * 0.1f, forward, origin );\n\t\n\t\/\/ Z bob a bit more\n\torigin[2] += g_verticalBob * 0.1f;\n\t\n\t\/\/ bob the angles\n\tangles[ ROLL ]\t+= g_verticalBob * 0.5f;\n\tangles[ PITCH ]\t-= g_verticalBob * 0.4f;\n\n\tangles[ YAW ]\t-= g_lateralBob  * 0.3f;\n\n\tVectorMA( origin, g_lateralBob * 0.8f, right, origin );\n}\n\n\/\/-----------------------------------------------------------------------------\nVector CBaseHL2MPCombatWeapon::GetBulletSpread( WeaponProficiency_t proficiency )\n{\n\treturn BaseClass::GetBulletSpread( proficiency );\n}\n\n\/\/-----------------------------------------------------------------------------\nfloat CBaseHL2MPCombatWeapon::GetSpreadBias( WeaponProficiency_t proficiency )\n{\n\treturn BaseClass::GetSpreadBias( proficiency );\n}\n\/\/-----------------------------------------------------------------------------\n\nconst WeaponProficiencyInfo_t *CBaseHL2MPCombatWeapon::GetProficiencyValues()\n{\n\treturn NULL;\n}\n\n#else\n\n\/\/ Server stubs\nfloat CBaseHL2MPCombatWeapon::CalcViewmodelBob( void )\n{\n\treturn 0.0f;\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Purpose: \n\/\/ Input  : &origin - \n\/\/\t\t\t&angles - \n\/\/\t\t\tviewmodelindex - \n\/\/-----------------------------------------------------------------------------\nvoid CBaseHL2MPCombatWeapon::AddViewmodelBob( CBaseViewModel *viewmodel, Vector &origin, QAngle &angles )\n{\n}\n\n\n\/\/-----------------------------------------------------------------------------\nVector CBaseHL2MPCombatWeapon::GetBulletSpread( WeaponProficiency_t proficiency )\n{\n\tVector baseSpread = BaseClass::GetBulletSpread( proficiency );\n\n\tconst WeaponProficiencyInfo_t *pProficiencyValues = GetProficiencyValues();\n\tfloat flModifier = (pProficiencyValues)[ proficiency ].spreadscale;\n\treturn ( baseSpread * flModifier );\n}\n\n\/\/-----------------------------------------------------------------------------\nfloat CBaseHL2MPCombatWeapon::GetSpreadBias( WeaponProficiency_t proficiency )\n{\n\tconst WeaponProficiencyInfo_t *pProficiencyValues = GetProficiencyValues();\n\treturn (pProficiencyValues)[ proficiency ].bias;\n}\n\n\/\/-----------------------------------------------------------------------------\nconst WeaponProficiencyInfo_t *CBaseHL2MPCombatWeapon::GetProficiencyValues()\n{\n\treturn GetDefaultProficiencyValues();\n}\n\n\/\/-----------------------------------------------------------------------------\nconst WeaponProficiencyInfo_t *CBaseHL2MPCombatWeapon::GetDefaultProficiencyValues()\n{\n\t\/\/ Weapon proficiency table. Keep this in sync with WeaponProficiency_t enum in the header!!\n\tstatic WeaponProficiencyInfo_t g_BaseWeaponProficiencyTable[] =\n\t{\n\t\t{ 2.50, 1.0\t},\n\t\t{ 2.00, 1.0\t},\n\t\t{ 1.50, 1.0\t},\n\t\t{ 1.25, 1.0 },\n\t\t{ 1.00, 1.0\t},\n\t};\n\n\tCOMPILE_TIME_ASSERT( ARRAYSIZE(g_BaseWeaponProficiencyTable) == WEAPON_PROFICIENCY_PERFECT + 1);\n\n\treturn g_BaseWeaponProficiencyTable;\n}\n\n#endif<commit_msg>Disable sk_auto_reload_time in hl2mp stuff<commit_after>\/\/========= Copyright Valve Corporation, All rights reserved. ============\/\/\n\/\/\n\/\/ Purpose: \n\/\/\n\/\/=============================================================================\/\/\n\n#include \"cbase.h\"\n#include \"weapon_hl2mpbasehlmpcombatweapon.h\"\n\n#include \"hl2mp_player_shared.h\"\n\n\/\/ memdbgon must be the last include file in a .cpp file!!!\n#include \"tier0\/memdbgon.h\"\n\nLINK_ENTITY_TO_CLASS( basehl2mpcombatweapon, CBaseHL2MPCombatWeapon );\n\nIMPLEMENT_NETWORKCLASS_ALIASED( BaseHL2MPCombatWeapon , DT_BaseHL2MPCombatWeapon )\n\nBEGIN_NETWORK_TABLE( CBaseHL2MPCombatWeapon , DT_BaseHL2MPCombatWeapon )\n#if !defined( CLIENT_DLL )\n\/\/\tSendPropInt( SENDINFO( m_bReflectViewModelAnimations ), 1, SPROP_UNSIGNED ),\n#else\n\/\/\tRecvPropInt( RECVINFO( m_bReflectViewModelAnimations ) ),\n#endif\nEND_NETWORK_TABLE()\n\n\n#if !defined( CLIENT_DLL )\n\n#include \"globalstate.h\"\n\n\/\/---------------------------------------------------------\n\/\/ Save\/Restore\n\/\/---------------------------------------------------------\nBEGIN_DATADESC( CBaseHL2MPCombatWeapon )\n\n\tDEFINE_FIELD( m_bLowered,\t\t\tFIELD_BOOLEAN ),\n\tDEFINE_FIELD( m_flRaiseTime,\t\tFIELD_TIME ),\n\tDEFINE_FIELD( m_flHolsterTime,\t\tFIELD_TIME ),\n\nEND_DATADESC()\n\n#endif\n\nBEGIN_PREDICTION_DATA( CBaseHL2MPCombatWeapon )\nEND_PREDICTION_DATA()\n\nextern ConVar sk_auto_reload_time;\n\nCBaseHL2MPCombatWeapon::CBaseHL2MPCombatWeapon( void )\n{\n\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Purpose: \n\/\/-----------------------------------------------------------------------------\nvoid CBaseHL2MPCombatWeapon::ItemHolsterFrame( void )\n{\n\tBaseClass::ItemHolsterFrame();\n\n\t\/\/ Must be player held\n\tif ( GetOwner() && GetOwner()->IsPlayer() == false )\n\t\treturn;\n\n\t\/\/ We can't be active\n\tif ( GetOwner()->GetActiveWeapon() == this )\n\t\treturn;\n\n\t\/\/ If it's been longer than three seconds, reload\n\t\/\/BG2 - VisualMelon - Tjoppen - no autoreload crap\n\t\/*if ( ( gpGlobals->curtime - m_flHolsterTime ) > sk_auto_reload_time.GetFloat() )\n\t{\n\t\t\/\/ Just load the clip with no animations\n\t\tFinishReload();\n\t\tm_flHolsterTime = gpGlobals->curtime;\n\t}*\/\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Purpose: Drops the weapon into a lowered pose\n\/\/ Output : Returns true on success, false on failure.\n\/\/-----------------------------------------------------------------------------\nbool CBaseHL2MPCombatWeapon::Lower( void )\n{\n\t\/\/Don't bother if we don't have the animation\n\tif ( SelectWeightedSequence( ACT_VM_IDLE_LOWERED ) == ACTIVITY_NOT_AVAILABLE )\n\t\treturn false;\n\n\tm_bLowered = true;\n\treturn true;\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Purpose: Brings the weapon up to the ready position\n\/\/ Output : Returns true on success, false on failure.\n\/\/-----------------------------------------------------------------------------\nbool CBaseHL2MPCombatWeapon::Ready( void )\n{\n\t\/\/Don't bother if we don't have the animation\n\tif ( SelectWeightedSequence( ACT_VM_LOWERED_TO_IDLE ) == ACTIVITY_NOT_AVAILABLE )\n\t\treturn false;\n\n\tm_bLowered = false;\t\n\tm_flRaiseTime = gpGlobals->curtime + 0.5f;\n\treturn true;\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Purpose: \n\/\/ Output : Returns true on success, false on failure.\n\/\/-----------------------------------------------------------------------------\nbool CBaseHL2MPCombatWeapon::Deploy( void )\n{\n\t\/\/ If we should be lowered, deploy in the lowered position\n\t\/\/ We have to ask the player if the last time it checked, the weapon was lowered\n\tif ( GetOwner() && GetOwner()->IsPlayer() )\n\t{\n\t\tCHL2MP_Player *pPlayer = assert_cast<CHL2MP_Player*>( GetOwner() );\n\t\tif ( pPlayer->IsWeaponLowered() )\n\t\t{\n\t\t\tif ( SelectWeightedSequence( ACT_VM_IDLE_LOWERED ) != ACTIVITY_NOT_AVAILABLE )\n\t\t\t{\n\t\t\t\tif ( DefaultDeploy( (char*)GetViewModel(), (char*)GetWorldModel(), ACT_VM_IDLE_LOWERED, (char*)GetAnimPrefix() ) )\n\t\t\t\t{\n\t\t\t\t\tm_bLowered = true;\n\n\t\t\t\t\t\/\/ Stomp the next attack time to fix the fact that the lower idles are long\n\t\t\t\t\tpPlayer->SetNextAttack( gpGlobals->curtime + 1.0 );\n\t\t\t\t\tm_flNextPrimaryAttack = gpGlobals->curtime + 1.0;\n\t\t\t\t\tm_flNextSecondaryAttack\t= gpGlobals->curtime + 1.0;\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tm_bLowered = false;\n\treturn BaseClass::Deploy();\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Purpose: \n\/\/ Output : Returns true on success, false on failure.\n\/\/-----------------------------------------------------------------------------\nbool CBaseHL2MPCombatWeapon::Holster( CBaseCombatWeapon *pSwitchingTo )\n{\n\tif ( BaseClass::Holster( pSwitchingTo ) )\n\t{\n\t\tSetWeaponVisible( false );\n\t\tm_flHolsterTime = gpGlobals->curtime;\n\t\treturn true;\n\t}\n\n\treturn false;\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Purpose: \n\/\/ Output : Returns true on success, false on failure.\n\/\/-----------------------------------------------------------------------------\nbool CBaseHL2MPCombatWeapon::WeaponShouldBeLowered( void )\n{\n\t\/\/ Can't be in the middle of another animation\n  \tif ( GetIdealActivity() != ACT_VM_IDLE_LOWERED && GetIdealActivity() != ACT_VM_IDLE &&\n\t\t GetIdealActivity() != ACT_VM_IDLE_TO_LOWERED && GetIdealActivity() != ACT_VM_LOWERED_TO_IDLE )\n  \t\treturn false;\n\n\tif ( m_bLowered )\n\t\treturn true;\n\t\n#if !defined( CLIENT_DLL )\n\n\tif ( GlobalEntity_GetState( \"friendly_encounter\" ) == GLOBAL_ON )\n\t\treturn true;\n\n#endif\n\n\treturn false;\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Purpose: Allows the weapon to choose proper weapon idle animation\n\/\/-----------------------------------------------------------------------------\nvoid CBaseHL2MPCombatWeapon::WeaponIdle( void )\n{\n\t\/\/See if we should idle high or low\n\tif ( WeaponShouldBeLowered() )\n\t{\n\t\t\/\/ Move to lowered position if we're not there yet\n\t\tif ( GetActivity() != ACT_VM_IDLE_LOWERED && GetActivity() != ACT_VM_IDLE_TO_LOWERED \n\t\t\t && GetActivity() != ACT_TRANSITION )\n\t\t{\n\t\t\tSendWeaponAnim( ACT_VM_IDLE_LOWERED );\n\t\t}\n\t\telse if ( HasWeaponIdleTimeElapsed() )\n\t\t{\n\t\t\t\/\/ Keep idling low\n\t\t\tSendWeaponAnim( ACT_VM_IDLE_LOWERED );\n\t\t}\n\t}\n\telse\n\t{\n\t\t\/\/ See if we need to raise immediately\n\t\tif ( m_flRaiseTime < gpGlobals->curtime && GetActivity() == ACT_VM_IDLE_LOWERED ) \n\t\t{\n\t\t\tSendWeaponAnim( ACT_VM_IDLE );\n\t\t}\n\t\telse if ( HasWeaponIdleTimeElapsed() ) \n\t\t{\n\t\t\tSendWeaponAnim( ACT_VM_IDLE );\n\t\t}\n\t}\n}\n\n#if defined( CLIENT_DLL )\n\n#define\tHL2_BOB_CYCLE_MIN\t1.0f\n#define\tHL2_BOB_CYCLE_MAX\t0.45f\n#define\tHL2_BOB\t\t\t0.002f\n#define\tHL2_BOB_UP\t\t0.5f\n\nextern float\tg_lateralBob;\nextern float\tg_verticalBob;\n\nstatic ConVar\tcl_bobcycle( \"cl_bobcycle\",\"0.8\" );\nstatic ConVar\tcl_bob( \"cl_bob\",\"0.002\" );\nstatic ConVar\tcl_bobup( \"cl_bobup\",\"0.5\" );\n\n\/\/ Register these cvars if needed for easy tweaking\nstatic ConVar\tv_iyaw_cycle( \"v_iyaw_cycle\", \"2\", FCVAR_REPLICATED | FCVAR_CHEAT );\nstatic ConVar\tv_iroll_cycle( \"v_iroll_cycle\", \"0.5\", FCVAR_REPLICATED | FCVAR_CHEAT );\nstatic ConVar\tv_ipitch_cycle( \"v_ipitch_cycle\", \"1\", FCVAR_REPLICATED | FCVAR_CHEAT );\nstatic ConVar\tv_iyaw_level( \"v_iyaw_level\", \"0.3\", FCVAR_REPLICATED | FCVAR_CHEAT );\nstatic ConVar\tv_iroll_level( \"v_iroll_level\", \"0.1\", FCVAR_REPLICATED | FCVAR_CHEAT );\nstatic ConVar\tv_ipitch_level( \"v_ipitch_level\", \"0.3\", FCVAR_REPLICATED | FCVAR_CHEAT );\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Purpose: \n\/\/ Output : float\n\/\/-----------------------------------------------------------------------------\nfloat CBaseHL2MPCombatWeapon::CalcViewmodelBob( void )\n{\n\tstatic\tfloat bobtime;\n\tstatic\tfloat lastbobtime;\n\tfloat\tcycle;\n\t\n\tCBasePlayer *player = ToBasePlayer( GetOwner() );\n\t\/\/Assert( player );\n\n\t\/\/NOTENOTE: For now, let this cycle continue when in the air, because it snaps badly without it\n\n\tif ( ( !gpGlobals->frametime ) || ( player == NULL ) )\n\t{\n\t\t\/\/NOTENOTE: We don't use this return value in our case (need to restructure the calculation function setup!)\n\t\treturn 0.0f;\/\/ just use old value\n\t}\n\n\t\/\/Find the speed of the player\n\tfloat speed = player->GetLocalVelocity().Length2D();\n\n\t\/\/FIXME: This maximum speed value must come from the server.\n\t\/\/\t\t MaxSpeed() is not sufficient for dealing with sprinting - jdw\n\n\tspeed = clamp( speed, -320, 320 );\n\n\tfloat bob_offset = RemapVal( speed, 0, 320, 0.0f, 1.0f );\n\t\n\tbobtime += ( gpGlobals->curtime - lastbobtime ) * bob_offset;\n\tlastbobtime = gpGlobals->curtime;\n\n\t\/\/Calculate the vertical bob\n\tcycle = bobtime - (int)(bobtime\/HL2_BOB_CYCLE_MAX)*HL2_BOB_CYCLE_MAX;\n\tcycle \/= HL2_BOB_CYCLE_MAX;\n\n\tif ( cycle < HL2_BOB_UP )\n\t{\n\t\tcycle = M_PI * cycle \/ HL2_BOB_UP;\n\t}\n\telse\n\t{\n\t\tcycle = M_PI + M_PI*(cycle-HL2_BOB_UP)\/(1.0 - HL2_BOB_UP);\n\t}\n\t\n\tg_verticalBob = speed*0.005f;\n\tg_verticalBob = g_verticalBob*0.3 + g_verticalBob*0.7*sin(cycle);\n\n\tg_verticalBob = clamp( g_verticalBob, -7.0f, 4.0f );\n\n\t\/\/Calculate the lateral bob\n\tcycle = bobtime - (int)(bobtime\/HL2_BOB_CYCLE_MAX*2)*HL2_BOB_CYCLE_MAX*2;\n\tcycle \/= HL2_BOB_CYCLE_MAX*2;\n\n\tif ( cycle < HL2_BOB_UP )\n\t{\n\t\tcycle = M_PI * cycle \/ HL2_BOB_UP;\n\t}\n\telse\n\t{\n\t\tcycle = M_PI + M_PI*(cycle-HL2_BOB_UP)\/(1.0 - HL2_BOB_UP);\n\t}\n\n\tg_lateralBob = speed*0.005f;\n\tg_lateralBob = g_lateralBob*0.3 + g_lateralBob*0.7*sin(cycle);\n\tg_lateralBob = clamp( g_lateralBob, -7.0f, 4.0f );\n\t\n\t\/\/NOTENOTE: We don't use this return value in our case (need to restructure the calculation function setup!)\n\treturn 0.0f;\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Purpose: \n\/\/ Input  : &origin - \n\/\/\t\t\t&angles - \n\/\/\t\t\tviewmodelindex - \n\/\/-----------------------------------------------------------------------------\nvoid CBaseHL2MPCombatWeapon::AddViewmodelBob( CBaseViewModel *viewmodel, Vector &origin, QAngle &angles )\n{\n\tVector\tforward, right;\n\tAngleVectors( angles, &forward, &right, NULL );\n\n\tCalcViewmodelBob();\n\n\t\/\/ Apply bob, but scaled down to 40%\n\tVectorMA( origin, g_verticalBob * 0.1f, forward, origin );\n\t\n\t\/\/ Z bob a bit more\n\torigin[2] += g_verticalBob * 0.1f;\n\t\n\t\/\/ bob the angles\n\tangles[ ROLL ]\t+= g_verticalBob * 0.5f;\n\tangles[ PITCH ]\t-= g_verticalBob * 0.4f;\n\n\tangles[ YAW ]\t-= g_lateralBob  * 0.3f;\n\n\tVectorMA( origin, g_lateralBob * 0.8f, right, origin );\n}\n\n\/\/-----------------------------------------------------------------------------\nVector CBaseHL2MPCombatWeapon::GetBulletSpread( WeaponProficiency_t proficiency )\n{\n\treturn BaseClass::GetBulletSpread( proficiency );\n}\n\n\/\/-----------------------------------------------------------------------------\nfloat CBaseHL2MPCombatWeapon::GetSpreadBias( WeaponProficiency_t proficiency )\n{\n\treturn BaseClass::GetSpreadBias( proficiency );\n}\n\/\/-----------------------------------------------------------------------------\n\nconst WeaponProficiencyInfo_t *CBaseHL2MPCombatWeapon::GetProficiencyValues()\n{\n\treturn NULL;\n}\n\n#else\n\n\/\/ Server stubs\nfloat CBaseHL2MPCombatWeapon::CalcViewmodelBob( void )\n{\n\treturn 0.0f;\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Purpose: \n\/\/ Input  : &origin - \n\/\/\t\t\t&angles - \n\/\/\t\t\tviewmodelindex - \n\/\/-----------------------------------------------------------------------------\nvoid CBaseHL2MPCombatWeapon::AddViewmodelBob( CBaseViewModel *viewmodel, Vector &origin, QAngle &angles )\n{\n}\n\n\n\/\/-----------------------------------------------------------------------------\nVector CBaseHL2MPCombatWeapon::GetBulletSpread( WeaponProficiency_t proficiency )\n{\n\tVector baseSpread = BaseClass::GetBulletSpread( proficiency );\n\n\tconst WeaponProficiencyInfo_t *pProficiencyValues = GetProficiencyValues();\n\tfloat flModifier = (pProficiencyValues)[ proficiency ].spreadscale;\n\treturn ( baseSpread * flModifier );\n}\n\n\/\/-----------------------------------------------------------------------------\nfloat CBaseHL2MPCombatWeapon::GetSpreadBias( WeaponProficiency_t proficiency )\n{\n\tconst WeaponProficiencyInfo_t *pProficiencyValues = GetProficiencyValues();\n\treturn (pProficiencyValues)[ proficiency ].bias;\n}\n\n\/\/-----------------------------------------------------------------------------\nconst WeaponProficiencyInfo_t *CBaseHL2MPCombatWeapon::GetProficiencyValues()\n{\n\treturn GetDefaultProficiencyValues();\n}\n\n\/\/-----------------------------------------------------------------------------\nconst WeaponProficiencyInfo_t *CBaseHL2MPCombatWeapon::GetDefaultProficiencyValues()\n{\n\t\/\/ Weapon proficiency table. Keep this in sync with WeaponProficiency_t enum in the header!!\n\tstatic WeaponProficiencyInfo_t g_BaseWeaponProficiencyTable[] =\n\t{\n\t\t{ 2.50, 1.0\t},\n\t\t{ 2.00, 1.0\t},\n\t\t{ 1.50, 1.0\t},\n\t\t{ 1.25, 1.0 },\n\t\t{ 1.00, 1.0\t},\n\t};\n\n\tCOMPILE_TIME_ASSERT( ARRAYSIZE(g_BaseWeaponProficiencyTable) == WEAPON_PROFICIENCY_PERFECT + 1);\n\n\treturn g_BaseWeaponProficiencyTable;\n}\n\n#endif<|endoftext|>"}
{"text":"<commit_before>\/\/\/\n\/\/\/ @file  PrimeSieve-nthPrime.cpp\n\/\/\/\n\/\/\/ Copyright (C) 2015 Kim Walisch, <kim.walisch@gmail.com>\n\/\/\/\n\/\/\/ This file is distributed under the BSD License. See the COPYING\n\/\/\/ file in the top level directory.\n\/\/\/\n\n#include <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 <cmath>\n\nusing namespace std;\nusing namespace primesieve;\n\nnamespace {\n\nvoid checkLimit(uint64_t start, uint64_t dist)\n{\n  if (dist > get_max_stop() - start)\n    throw primesieve_error(\"nth prime is too large > 2^64\");\n}\n\nvoid checkLowerLimit(uint64_t stop)\n{\n  if (stop == 0)\n    throw primesieve_error(\"nth prime < 2 is impossible, negative n is too small\");\n}\n\nvoid checkLowerLimit(uint64_t start, double dist)\n{\n  double s = static_cast<double>(start);\n  s = max(1E4, s);\n  if (s \/ dist < 0.9)\n    throw primesieve_error(\"nth prime < 2 is impossible, negative n is too small\");\n}\n\nint64_t pix(int64_t n)\n{\n  double x = static_cast<double>(n);\n  double logx = log(max(4.0, x));\n  double pix = x \/ logx;\n\n  return static_cast<int64_t>(pix);\n}\n\nbool sieveBackwards(int64_t n, int64_t count, uint64_t stop)\n{\n  return (count >= n) && !(count == n && stop < 2);\n}\n\nuint64_t nthPrimeDistance(int64_t n, int64_t count, uint64_t start, bool bruteForce = false)\n{\n  double x = static_cast<double>(n - count);\n  double s = static_cast<double>(start);\n\n  x = abs(x);\n  x = max(4.0, x);\n  s = max(4.0, s);\n\n  double logx = log(x);\n  double loglogx = log(logx);\n  double pix = x * (logx + loglogx - 1);\n\n  \/\/ Correct start if sieving backwards\n  if (count >= n)\n    s -= pix;\n\n  \/\/ Approximate the nth prime using\n  \/\/ start + n * log(start + pi(n) \/ log log n))\n  double logStartPix = log(max(4.0, s + pix \/ loglogx));\n  double dist = max(pix, x * logStartPix);\n  double maxPrimeGap = logStartPix * logStartPix;\n  double safetyFactor = (count >= n || bruteForce) ? 2 : -2;\n\n  \/\/ Make sure start + dist <= nth prime\n  dist += sqrt(dist) * log(logStartPix) * safetyFactor;\n  dist = max(dist, maxPrimeGap);\n\n  if (count >= n)\n    checkLowerLimit(start, dist);\n\n  return static_cast<uint64_t>(dist);\n}\n\n\/\/\/ This class is used to generate n primes and\n\/\/\/ then stop by throwing an exception.\n\/\/\/\nclass NthPrime : public Callback<uint64_t> {\npublic:\n  NthPrime() : n_(0), nthPrime_(0) { }\n  void findNthPrime(uint64_t, uint64_t, uint64_t);\n  void callback(uint64_t);\n  uint64_t getNthPrime() const;\nprivate:\n  uint64_t n_;\n  uint64_t nthPrime_;\n};\n\nvoid NthPrime::findNthPrime(uint64_t n, uint64_t start, uint64_t stop)\n{\n  n_ = n;\n  PrimeSieve ps;\n  try {\n    ps.callbackPrimes(start, stop, this);\n    ps.callbackPrimes(stop + 1, get_max_stop(), this);\n    throw primesieve_error(\"nth prime is too large > 2^64 - 2^32 * 11\");\n  }\n  catch (cancel_callback&) { }\n}\n\nuint64_t NthPrime::getNthPrime() const\n{\n  return nthPrime_;\n}\n\nvoid NthPrime::callback(uint64_t prime)\n{\n  if (--n_ == 0)\n  {\n    nthPrime_ = prime;\n    throw cancel_callback();\n  }\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  double t1 = getWallTime();\n\n  if (n != 0)\n    \/\/ Find nth prime > start (or < start)\n    start += (n > 0) ? 1 : ((start > 0) ? -1 : 0);\n  else\n    \/\/ Mathematica convention\n    n = 1;\n\n  uint64_t stop = start;\n  uint64_t dist = nthPrimeDistance(n, 0, start);\n  uint64_t nthPrimeGuess = start + dist;\n\n  int64_t pixSqrtNthPrime = pix(isqrt(nthPrimeGuess));\n  int64_t bruteForceMin = 10000;\n  int64_t bruteForceThreshold = max(bruteForceMin, pixSqrtNthPrime);\n  int64_t count = 0;\n\n  while (sieveBackwards(n, count, stop) || (n - count) > bruteForceThreshold)\n  {\n    if (count < n)\n    {\n      dist = nthPrimeDistance(n, count, start);\n      checkLimit(start, dist);\n      stop = start + dist;\n      count += countPrimes(start, stop);\n      start = stop + 1;\n    }\n    if (sieveBackwards(n, count, stop))\n    {\n      checkLowerLimit(stop);\n      dist = nthPrimeDistance(n, count, stop);\n      start = (start > dist) ? start - dist : 1;\n      count -= countPrimes(start, stop);\n      stop = start - 1;\n    }\n  }\n\n  if (n < 0) count--;\n  dist = nthPrimeDistance(n, count, start, true) * 2;\n  checkLimit(start, dist);\n  stop = start + dist;\n  NthPrime np;\n  np.findNthPrime(n - count, start, stop);\n  seconds_ = getWallTime() - t1;\n\n  return np.getNthPrime();\n}\n\n} \/\/ namespace primesieve\n<commit_msg>Fix integer overflows<commit_after>\/\/\/\n\/\/\/ @file  PrimeSieve-nthPrime.cpp\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 <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 <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, negative n is too small\");\n}\n\nvoid checkLowerLimit(uint64_t start, double dist)\n{\n  double s = static_cast<double>(start);\n\n  if (max(1E4, s) \/ dist < 0.9)\n    throw primesieve_error(\"nth prime < 2 is impossible, negative n is too small\");\n}\n\n\/\/ Prime count approximation\nint64_t pix(int64_t n)\n{\n  double x = static_cast<double>(n);\n  double logx = log(max(4.0, x));\n  double pix = x \/ logx;\n\n  return static_cast<int64_t>(pix);\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\nuint64_t nthPrimeDist(int64_t n, int64_t count, uint64_t start)\n{\n  double x = static_cast<double>(n - count);\n  double s = static_cast<double>(start);\n\n  x = abs(x);\n  x = max(4.0, x);\n  s = max(4.0, s);\n\n  double logx = log(x);\n  double loglogx = log(logx);\n  double pix = x * (logx + loglogx - 1);\n\n  \/\/ Correct start if sieving backwards\n  if (count >= n)\n    s -= pix;\n\n  \/\/ Approximate the nth prime using\n  \/\/ start + n * log(start + pi(n) \/ loglog(n))\n  double startPix = s + pix \/ loglogx;\n  double logStartPix = log(max(4.0, startPix));\n  double dist = max(pix, x * logStartPix);\n  double maxPrimeGap = logStartPix * logStartPix;\n  double sign = (count < n) ? -2 : 2;\n\n  \/\/ Make sure start + dist <= nth prime\n  dist += sqrt(dist) * log(logStartPix) * sign;\n  dist = max(dist, maxPrimeGap);\n\n  if (count >= n)\n    checkLowerLimit(start, dist);\n\n  return static_cast<uint64_t>(dist);\n}\n\n\/\/\/ This class is used to generate n primes and\n\/\/\/ then stop by throwing an exception.\n\/\/\/\nclass NthPrime : public Callback<uint64_t> {\npublic:\n  NthPrime() : n_(0), nthPrime_(0) { }\n  void findNthPrime(uint64_t, uint64_t, uint64_t);\n  void callback(uint64_t);\n  uint64_t getNthPrime() const;\nprivate:\n  uint64_t n_;\n  uint64_t nthPrime_;\n};\n\nvoid NthPrime::findNthPrime(uint64_t n, uint64_t start, uint64_t stop)\n{\n  n_ = n;\n  PrimeSieve ps;\n  try\n  {\n    ps.callbackPrimes(start, stop, this);\n    if (stop < get_max_stop())\n      ps.callbackPrimes(stop + 1, get_max_stop(), this);\n\n    throw primesieve_error(\"nth prime > 2^64\");\n  }\n  catch (cancel_callback&) { }\n}\n\nuint64_t NthPrime::getNthPrime() const\n{\n  return nthPrime_;\n}\n\nvoid NthPrime::callback(uint64_t prime)\n{\n  if (--n_ == 0)\n  {\n    nthPrime_ = prime;\n    throw cancel_callback();\n  }\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  double t1 = getWallTime();\n\n  if (n == 0)\n    n = 1; \/\/ Like Mathematica\n  else if (n > 0)\n    start = add_overflow_safe(start, 1);\n  else if (n < 0)\n    start = sub_underflow_safe(start, 1);\n\n  uint64_t stop = start;\n  uint64_t dist = nthPrimeDist(n, 0, start);\n  uint64_t nthPrimeGuess = add_overflow_safe(start, dist);\n\n  int64_t count = 0;\n  int64_t tinyN = 10000;\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 = add_overflow_safe(start, dist);\n      count += countPrimes(start, stop);\n      start = add_overflow_safe(stop, 1);\n    }\n    if (sieveBackwards(n, count, stop))\n    {\n      checkLowerLimit(stop);\n      dist = nthPrimeDist(n, count, stop);\n      start = sub_underflow_safe(start, dist);\n      count -= countPrimes(start, stop);\n      stop = sub_underflow_safe(start, 1);\n    }\n  }\n\n  if (n < 0) count -= 1;\n  checkLimit(start);\n  dist = nthPrimeDist(n, count, start) * 3;\n  stop = add_overflow_safe(start, dist);\n  NthPrime np;\n  np.findNthPrime(n - count, start, stop);\n  seconds_ = getWallTime() - t1;\n\n  return np.getNthPrime();\n}\n\n} \/\/ namespace\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\n\/\/\/ @file   primesieve_iterator.cpp\n\/\/\/ @brief  C port of primesieve::iterator.\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 <primesieve\/config.hpp>\n#include <primesieve\/pmath.hpp>\n#include <primesieve.hpp>\n#include <primesieve.h>\n\n#include <algorithm>\n#include <exception>\n#include <cerrno>\n#include <cmath>\n#include <vector>\n\nusing namespace primesieve;\n\nnamespace {\n\n\/\/\/ Convert pimpl pointer to std::vector\nstd::vector<uint64_t>& to_vector(uint64_t* primes_pimpl)\n{\n  std::vector<uint64_t>* primes = reinterpret_cast<std::vector<uint64_t>*>(primes_pimpl);\n  return *primes;\n}\n\nuint64_t add_overflow_safe(uint64_t a, uint64_t b)\n{\n  uint64_t max_stop = get_max_stop();\n  return (a < max_stop - b) ? a + b : max_stop;\n}\n\nuint64_t subtract_underflow_safe(uint64_t a, uint64_t b)\n{\n  return (a > b) ? a - b : 0;\n}\n\n\/\/\/ Calculate an interval size that ensures a good load balance.\n\/\/\/ @param n  Start or stop number.\n\/\/\/\nuint64_t get_interval_size(uint64_t n, uint64_t& tiny_cache_size)\n{\n  n = (n > 10) ? n : 10;\n  uint64_t cache_size = config::ITERATOR_CACHE_SMALL;\n  if (tiny_cache_size < cache_size)\n  {\n    cache_size = tiny_cache_size;\n    tiny_cache_size *= 2;\n  }\n\n  double x = static_cast<double>(n);\n  double sqrtx = std::sqrt(x);\n  uint64_t sqrtx_primes = static_cast<uint64_t>(sqrtx \/ (std::log(sqrtx) - 1));\n  uint64_t cache_primes = cache_size \/ sizeof(uint64_t);\n  uint64_t cache_max_primes = config::ITERATOR_CACHE_MAX \/ sizeof(uint64_t);\n  uint64_t primes = std::min(std::max(cache_primes, sqrtx_primes), cache_max_primes);\n\n  return static_cast<uint64_t>(primes * std::log(x));\n}\n\n}\n\n\/\/\/ C constructor\nvoid primesieve_init(primesieve_iterator* pi)\n{\n  pi->primes_pimpl_ = reinterpret_cast<uint64_t*>(new std::vector<uint64_t>);\n  primesieve_skipto(pi, 0, primesieve_get_max_stop());\n}\n\n\/\/\/ C destructor\nvoid primesieve_free_iterator(primesieve_iterator* pi)\n{\n  if (pi)\n  {\n    std::vector<uint64_t>* primes = &to_vector(pi->primes_pimpl_);\n    delete primes;\n  }\n}\n\nvoid primesieve_skipto(primesieve_iterator* pi, uint64_t start, uint64_t stop_hint)\n{\n  std::vector<uint64_t>& primes = to_vector(pi->primes_pimpl_);\n  primes.clear();\n  pi->start_ = start;\n  pi->stop_ = start;\n  pi->stop_hint_ = stop_hint;\n  pi->i_ = 0;\n  pi->last_idx_ = 0;\n  pi->tiny_cache_size_ = 1 << 11;\n  pi->is_error_ = false;\n}\n\nvoid primesieve_generate_next_primes(primesieve_iterator* pi)\n{\n  std::vector<uint64_t>& primes = to_vector(pi->primes_pimpl_);\n\n  if (!pi->is_error_)\n  {\n    try\n    {\n      primes.clear();\n\n      while (primes.empty())\n      {\n        pi->start_ = add_overflow_safe(pi->stop_, 1);\n        pi->stop_ = add_overflow_safe(pi->start_, get_interval_size(pi->start_, pi->tiny_cache_size_));\n        if (pi->start_ <= pi->stop_hint_ && pi->stop_ >= pi->stop_hint_)\n          pi->stop_ = add_overflow_safe(pi->stop_hint_, max_prime_gap(pi->stop_hint_));\n        primesieve::generate_primes(pi->start_, pi->stop_, &primes);\n        if (primes.empty() && pi->stop_ >= get_max_stop())\n          throw primesieve_error(\"next_prime() > primesieve_get_max_stop()\");\n      }\n    }\n    catch (std::exception&)\n    {\n      primes.clear();\n      primes.resize(64, PRIMESIEVE_ERROR);\n      pi->is_error_ = true;\n      errno = EDOM;\n    }\n  }\n\n  pi->primes_ = &primes[0];\n  pi->last_idx_ = primes.size() - 1;\n  pi->i_ = 0;\n}\n\nvoid primesieve_generate_previous_primes(primesieve_iterator* pi)\n{\n  std::vector<uint64_t>& primes = to_vector(pi->primes_pimpl_);\n\n  if (!pi->is_error_)\n  {\n    try\n    {\n      primes.clear();\n\n      while (primes.empty())\n      {\n        pi->stop_ = subtract_underflow_safe(pi->start_, 1);\n        pi->start_ = subtract_underflow_safe(pi->stop_, get_interval_size(pi->stop_, pi->tiny_cache_size_));\n        if (pi->start_ <= pi->stop_hint_ && pi->stop_ >= pi->stop_hint_)\n          pi->start_ = subtract_underflow_safe(pi->stop_hint_, max_prime_gap(pi->stop_hint_));\n        primesieve::generate_primes(pi->start_, pi->stop_, &primes);\n        if (primes.empty() && pi->start_ < 2)\n          throw primesieve_error(\"previous_prime(): smallest prime is 2\");\n      }\n    }\n    catch (std::exception&)\n    {\n      primes.clear();\n      primes.resize(64, PRIMESIEVE_ERROR);\n      pi->is_error_ = true;\n      errno = EDOM;\n    }\n  }\n\n  pi->primes_ = &primes[0];\n  pi->last_idx_ = primes.size() - 1;\n  pi->i_ = pi->last_idx_;\n}\n<commit_msg>Refactoring<commit_after>\/\/\/\n\/\/\/ @file   primesieve_iterator.cpp\n\/\/\/ @brief  C port of primesieve::iterator.\n\/\/\/\n\/\/\/ Copyright (C) 2015 Kim Walisch, <kim.walisch@gmail.com>\n\/\/\/\n\/\/\/ This file is distributed under the BSD License. See the COPYING\n\/\/\/ file in the top level directory.\n\/\/\/\n\n#include <primesieve\/config.hpp>\n#include <primesieve\/pmath.hpp>\n#include <primesieve.hpp>\n#include <primesieve.h>\n\n#include <algorithm>\n#include <exception>\n#include <cerrno>\n#include <cmath>\n#include <vector>\n\nusing namespace primesieve;\n\nnamespace {\n\n\/\/\/ Convert pimpl pointer to std::vector\nstd::vector<uint64_t>& to_vector(uint64_t* primes_pimpl)\n{\n  std::vector<uint64_t>* primes = reinterpret_cast<std::vector<uint64_t>*>(primes_pimpl);\n  return *primes;\n}\n\nuint64_t add_overflow_safe(uint64_t a, uint64_t b)\n{\n  uint64_t max_stop = get_max_stop();\n  return (a < max_stop - b) ? a + b : max_stop;\n}\n\nuint64_t subtract_underflow_safe(uint64_t a, uint64_t b)\n{\n  return (a > b) ? a - b : 0;\n}\n\n\/\/\/ Calculate an interval size that ensures a good load balance.\n\/\/\/ @param n  Start or stop number.\n\/\/\/\nuint64_t get_interval_size(uint64_t n, uint64_t& tiny_cache_size)\n{\n  n = (n > 10) ? n : 10;\n\n  uint64_t cache_size = config::ITERATOR_CACHE_SMALL;\n  if (tiny_cache_size < cache_size)\n  {\n    cache_size = tiny_cache_size;\n    tiny_cache_size *= 2;\n  }\n\n  double x = static_cast<double>(n);\n  double sqrtx = std::sqrt(x);\n  uint64_t sqrtx_primes = static_cast<uint64_t>(sqrtx \/ (std::log(sqrtx) - 1));\n  uint64_t cache_primes = cache_size \/ sizeof(uint64_t);\n  uint64_t cache_max_primes = config::ITERATOR_CACHE_MAX \/ sizeof(uint64_t);\n  uint64_t primes = std::min(std::max(cache_primes, sqrtx_primes), cache_max_primes);\n\n  return static_cast<uint64_t>(primes * std::log(x));\n}\n\n}\n\n\/\/\/ C constructor\nvoid primesieve_init(primesieve_iterator* pi)\n{\n  pi->primes_pimpl_ = reinterpret_cast<uint64_t*>(new std::vector<uint64_t>);\n  primesieve_skipto(pi, 0, primesieve_get_max_stop());\n}\n\n\/\/\/ C destructor\nvoid primesieve_free_iterator(primesieve_iterator* pi)\n{\n  if (pi)\n  {\n    std::vector<uint64_t>* primes = &to_vector(pi->primes_pimpl_);\n    delete primes;\n  }\n}\n\nvoid primesieve_skipto(primesieve_iterator* pi, uint64_t start, uint64_t stop_hint)\n{\n  std::vector<uint64_t>& primes = to_vector(pi->primes_pimpl_);\n  primes.clear();\n  pi->start_ = start;\n  pi->stop_ = start;\n  pi->stop_hint_ = stop_hint;\n  pi->i_ = 0;\n  pi->last_idx_ = 0;\n  pi->tiny_cache_size_ = 1 << 11;\n  pi->is_error_ = false;\n}\n\nvoid primesieve_generate_next_primes(primesieve_iterator* pi)\n{\n  std::vector<uint64_t>& primes = to_vector(pi->primes_pimpl_);\n\n  if (!pi->is_error_)\n  {\n    try\n    {\n      primes.clear();\n\n      while (primes.empty())\n      {\n        pi->start_ = add_overflow_safe(pi->stop_, 1);\n        pi->stop_ = add_overflow_safe(pi->start_, get_interval_size(pi->start_, pi->tiny_cache_size_));\n        if (pi->start_ <= pi->stop_hint_ && pi->stop_ >= pi->stop_hint_)\n          pi->stop_ = add_overflow_safe(pi->stop_hint_, max_prime_gap(pi->stop_hint_));\n        generate_primes(pi->start_, pi->stop_, &primes);\n        if (primes.empty() && pi->stop_ >= get_max_stop())\n          throw primesieve_error(\"next_prime() > primesieve_get_max_stop()\");\n      }\n    }\n    catch (std::exception&)\n    {\n      primes.clear();\n      primes.resize(64, PRIMESIEVE_ERROR);\n      pi->is_error_ = true;\n      errno = EDOM;\n    }\n  }\n\n  pi->primes_ = &primes[0];\n  pi->last_idx_ = primes.size() - 1;\n  pi->i_ = 0;\n}\n\nvoid primesieve_generate_previous_primes(primesieve_iterator* pi)\n{\n  std::vector<uint64_t>& primes = to_vector(pi->primes_pimpl_);\n\n  if (!pi->is_error_)\n  {\n    try\n    {\n      primes.clear();\n\n      while (primes.empty())\n      {\n        pi->stop_ = subtract_underflow_safe(pi->start_, 1);\n        pi->start_ = subtract_underflow_safe(pi->stop_, get_interval_size(pi->stop_, pi->tiny_cache_size_));\n        if (pi->start_ <= pi->stop_hint_ && pi->stop_ >= pi->stop_hint_)\n          pi->start_ = subtract_underflow_safe(pi->stop_hint_, max_prime_gap(pi->stop_hint_));\n        generate_primes(pi->start_, pi->stop_, &primes);\n        if (primes.empty() && pi->start_ < 2)\n          throw primesieve_error(\"previous_prime(): smallest prime is 2\");\n      }\n    }\n    catch (std::exception&)\n    {\n      primes.clear();\n      primes.resize(64, PRIMESIEVE_ERROR);\n      pi->is_error_ = true;\n      errno = EDOM;\n    }\n  }\n\n  pi->primes_ = &primes[0];\n  pi->last_idx_ = primes.size() - 1;\n  pi->i_ = pi->last_idx_;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2011 Google Inc. All Rights Reserved.\n\/\/ \n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/ \n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/ \n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\/\/ Author: nadavs@google.com <Nadav Samet>\n\/\/         Jin Qing (http:\/\/blog.csdn.net\/jq0123)\n\n#ifndef RPCZ_CONNECTION_MANAGER_THREAD_H\n#define RPCZ_CONNECTION_MANAGER_THREAD_H\n\n#include \"client_request_callback.hpp\"\n#include \"event_id_generator.hpp\"\n#include \"reactor.hpp\"\n#include \"server_function.hpp\"\n\nnamespace rpcz {\n\nclass sync_event;\n\nclass connection_manager_thread {\n public:\n  connection_manager_thread(\n      zmq::context_t & context,\n      int nthreads,\n      sync_event* ready_event,\n      zmq::socket_t* frontend_socket);\n\n  void wait_for_workers_ready_reply(int nthreads);\n\n  static void run(zmq::context_t & context,\n                  int nthreads,\n                  sync_event* ready_event,\n                  zmq::socket_t* frontend_socket);\n\n  void handle_frontend_socket(zmq::socket_t* frontend_socket);\n\n  inline void begin_worker_command(char command);\n\n  inline void add_closure(closure* closure);\n\n  inline void handle_connect_command(const std::string& sender,\n                                   const std::string& endpoint);\n\n  inline void handle_bind_command(\n      const std::string& sender,\n      const std::string& endpoint,\n      server_function server_function);\n\n  inline void handle_unbind_command(\n      const std::string& sender,\n      const std::string& endpoint);\n\n  void handle_server_socket(uint64 socket_id,\n      server_function server_function);\n\n  inline void send_request(message_iterator& iter);\n\n  void handle_client_socket(zmq::socket_t* socket);\n\n  void handle_timeout(event_id event_id);\n\n  inline void send_reply(message_iterator& iter);\n\n private:\n  typedef std::map<event_id, client_request_callback>\n      remote_response_map;\n  typedef std::map<uint64, event_id> deadline_map;\n  remote_response_map remote_response_map_;\n  deadline_map deadline_map_;\n  detail::event_id_generator event_id_generator_;\n  reactor reactor_;\n  std::vector<zmq::socket_t*> connections_;\n  std::vector<zmq::socket_t*> server_sockets_;\n  zmq::context_t & context_;\n  zmq::socket_t* frontend_socket_;\n  std::vector<std::string> workers_;\n  int current_worker_;\n};\n\n}  \/\/ namespace rpcz\n\n#endif  \/\/ RPCZ_CONNECTION_MANAGER_THREAD_H\n<commit_msg>private member functions<commit_after>\/\/ Copyright 2011 Google Inc. All Rights Reserved.\n\/\/ \n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/ \n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/ \n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\/\/ Author: nadavs@google.com <Nadav Samet>\n\/\/         Jin Qing (http:\/\/blog.csdn.net\/jq0123)\n\n#ifndef RPCZ_CONNECTION_MANAGER_THREAD_H\n#define RPCZ_CONNECTION_MANAGER_THREAD_H\n\n#include \"client_request_callback.hpp\"\n#include \"event_id_generator.hpp\"\n#include \"reactor.hpp\"\n#include \"server_function.hpp\"\n\nnamespace rpcz {\n\nclass sync_event;\n\nclass connection_manager_thread {\n public:\n  connection_manager_thread(\n      zmq::context_t & context,\n      int nthreads,\n      sync_event* ready_event,\n      zmq::socket_t* frontend_socket);\n\n public:\n  static void run(zmq::context_t & context,\n                  int nthreads,\n                  sync_event* ready_event,\n                  zmq::socket_t* frontend_socket);\n\n private:\n  void wait_for_workers_ready_reply(int nthreads);\n\n  void handle_frontend_socket(zmq::socket_t* frontend_socket);\n\n  inline void begin_worker_command(char command);\n\n  inline void add_closure(closure* closure);\n\n  inline void handle_connect_command(const std::string& sender,\n                                   const std::string& endpoint);\n\n  inline void handle_bind_command(\n      const std::string& sender,\n      const std::string& endpoint,\n      server_function server_function);\n\n  inline void handle_unbind_command(\n      const std::string& sender,\n      const std::string& endpoint);\n\n  void handle_server_socket(uint64 socket_id,\n      server_function server_function);\n\n  inline void send_request(message_iterator& iter);\n\n  void handle_client_socket(zmq::socket_t* socket);\n\n  void handle_timeout(event_id event_id);\n\n  inline void send_reply(message_iterator& iter);\n\n private:\n  typedef std::map<event_id, client_request_callback>\n      remote_response_map;\n  typedef std::map<uint64, event_id> deadline_map;\n  remote_response_map remote_response_map_;\n  deadline_map deadline_map_;\n  detail::event_id_generator event_id_generator_;\n  reactor reactor_;\n  std::vector<zmq::socket_t*> connections_;\n  std::vector<zmq::socket_t*> server_sockets_;\n  zmq::context_t & context_;\n  zmq::socket_t* frontend_socket_;\n  std::vector<std::string> workers_;\n  int current_worker_;\n};\n\n}  \/\/ namespace rpcz\n\n#endif  \/\/ RPCZ_CONNECTION_MANAGER_THREAD_H\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 <QtTest\/QtTest>\n\n#include <QtCore\/qtimer.h>\n\n#include <multimedia\/qmediaobject.h>\n#include <multimedia\/qmediaservice.h>\n#include <multimedia\/qmetadataprovidercontrol.h>\n\nclass tst_QMediaObject : public QObject\n{\n    Q_OBJECT\n\nprivate slots:\n    void propertyWatch();\n    void notifySignals_data();\n    void notifySignals();\n    void notifyInterval_data();\n    void notifyInterval();\n\n    void isMetaDataAvailable();\n    void isWritable();\n    void metaDataChanged();\n    void metaData_data();\n    void metaData();\n    void setMetaData_data();\n    void setMetaData();\n    void extendedMetaData_data() { metaData_data(); }\n    void extendedMetaData();\n    void setExtendedMetaData_data() { extendedMetaData_data(); }\n    void setExtendedMetaData();\n\nprivate:\n    void setupNotifyTests();\n};\n\nclass QtTestMetaDataProvider : public QMetaDataProviderControl\n{\n    Q_OBJECT\npublic:\n    QtTestMetaDataProvider(QObject *parent = 0)\n        : QMetaDataProviderControl(parent)\n        , m_available(false)\n        , m_writable(false)\n    {\n    }\n\n    bool isMetaDataAvailable() const { return m_available; }\n    void setMetaDataAvailable(bool available) {\n        if (m_available != available)\n            emit metaDataAvailableChanged(m_available = available);\n    }\n\n    bool isWritable() const { return m_writable; }\n    void setWritable(bool writable) { emit writableChanged(m_writable = writable); }\n\n    QVariant metaData(QMediaObject::MetaData key) const { return m_data.value(key); }\n    void setMetaData(QMediaObject::MetaData key, const QVariant &value) {\n        m_data.insert(key, value); }\n\n    QVariant extendedMetaData(const QString &key) const { return m_extendedData.value(key); }\n    void setExtendedMetaData(const QString &key, const QVariant &value) {\n        m_extendedData.insert(key, value); }\n\n    using QMetaDataProviderControl::metaDataChanged;\n\n    void populateMetaData()\n    {\n        m_available = true;\n    }\n\n    bool m_available;\n    bool m_writable;\n    QMap<QMediaObject::MetaData, QVariant> m_data;\n    QMap<QString, QVariant> m_extendedData;\n};\n\nclass QtTestMetaDataService : public QMediaService\n{\n    Q_OBJECT\npublic:\n    QtTestMetaDataService(QObject *parent = 0):QMediaService(parent)\n    {\n    }\n\n    QMediaControl *control(const char *iid) const\n    {\n        if (qstrcmp(iid, QMetaDataProviderControl_iid) == 0)\n            return const_cast<QtTestMetaDataProvider *>(&metaData);\n        else\n            return 0;\n    }\n\n    QtTestMetaDataProvider metaData;\n};\n\n\nclass QtTestMediaObject : public QMediaObject\n{\n    Q_OBJECT\n    Q_PROPERTY(int a READ a WRITE setA NOTIFY aChanged)\n    Q_PROPERTY(int b READ b WRITE setB NOTIFY bChanged)\n    Q_PROPERTY(int c READ c WRITE setC NOTIFY cChanged)\npublic:\n    QtTestMediaObject(QMediaService *service = 0): QMediaObject(0, service), m_a(0), m_b(0), m_c(0) {}\n\n    using QMediaObject::addPropertyWatch;\n    using QMediaObject::removePropertyWatch;\n\n    int a() const { return m_a; }\n    void setA(int a) { m_a = a; }\n\n    int b() const { return m_b; }\n    void setB(int b) { m_b = b; }\n\n    int c() const { return m_c; }\n    void setC(int c) { m_c = c; }\n\nQ_SIGNALS:\n    void aChanged(int a);\n    void bChanged(int b);\n    void cChanged(int c);\n\nprivate:\n    int m_a;\n    int m_b;\n    int m_c;\n};\n\nvoid tst_QMediaObject::propertyWatch()\n{\n    QtTestMediaObject object;\n    object.setNotifyInterval(0);\n\n    QEventLoop loop;\n    QTimer timer;\n    connect(&timer, SIGNAL(timeout()), &loop, SLOT(quit()));\n    connect(&object, SIGNAL(aChanged(int)), &loop, SLOT(quit()));\n    connect(&object, SIGNAL(bChanged(int)), &loop, SLOT(quit()));\n    connect(&object, SIGNAL(cChanged(int)), &loop, SLOT(quit()));\n\n    QSignalSpy aSpy(&object, SIGNAL(aChanged(int)));\n    QSignalSpy bSpy(&object, SIGNAL(bChanged(int)));\n    QSignalSpy cSpy(&object, SIGNAL(cChanged(int)));\n\n    timer.start(20);\n    loop.exec();\n    timer.stop();\n\n    QCOMPARE(aSpy.count(), 0);\n    QCOMPARE(bSpy.count(), 0);\n    QCOMPARE(cSpy.count(), 0);\n\n    int aCount = 0;\n    int bCount = 0;\n    int cCount = 0;\n\n    object.addPropertyWatch(\"a\");\n\n    timer.start(20);\n    loop.exec();\n    timer.stop();\n\n    QVERIFY(aSpy.count() > aCount);\n    QCOMPARE(bSpy.count(), 0);\n    QCOMPARE(cSpy.count(), 0);\n    QCOMPARE(aSpy.last().value(0).toInt(), 0);\n\n    aCount = aSpy.count();\n\n    object.setA(54);\n    object.setB(342);\n    object.setC(233);\n\n    timer.start(20);\n    loop.exec();\n    timer.stop();\n\n    QVERIFY(aSpy.count() > aCount);\n    QCOMPARE(bSpy.count(), 0);\n    QCOMPARE(cSpy.count(), 0);\n    QCOMPARE(aSpy.last().value(0).toInt(), 54);\n\n    aCount = aSpy.count();\n\n    object.addPropertyWatch(\"b\");\n    object.setA(43);\n    object.setB(235);\n    object.setC(90);\n\n    timer.start(20);\n    loop.exec();\n    timer.stop();\n\n    QVERIFY(aSpy.count() > aCount);\n    QVERIFY(bSpy.count() > bCount);\n    QCOMPARE(cSpy.count(), 0);\n    QCOMPARE(aSpy.last().value(0).toInt(), 43);\n    QCOMPARE(bSpy.last().value(0).toInt(), 235);\n\n    aCount = aSpy.count();\n    bCount = bSpy.count();\n\n    object.removePropertyWatch(\"a\");\n    object.addPropertyWatch(\"c\");\n\n    timer.start(20);\n    loop.exec();\n    timer.stop();\n\n    QCOMPARE(aSpy.count(), aCount);\n    QVERIFY(bSpy.count() > bCount);\n    QVERIFY(cSpy.count() > cCount);\n    QCOMPARE(bSpy.last().value(0).toInt(), 235);\n    QCOMPARE(cSpy.last().value(0).toInt(), 90);\n\n    bCount = bSpy.count();\n    cCount = cSpy.count();\n\n    object.setA(435);\n    object.setC(9845);\n\n    timer.start(20);\n    loop.exec();\n    timer.stop();\n\n    QCOMPARE(aSpy.count(), aCount);\n    QVERIFY(bSpy.count() > bCount);\n    QVERIFY(cSpy.count() > cCount);\n    QCOMPARE(bSpy.last().value(0).toInt(), 235);\n    QCOMPARE(cSpy.last().value(0).toInt(), 9845);\n\n    bCount = bSpy.count();\n    cCount = cSpy.count();\n\n    object.setA(8432);\n    object.setB(324);\n    object.setC(443);\n    object.removePropertyWatch(\"c\");\n\n    timer.start(20);\n    loop.exec();\n    timer.stop();\n\n    QCOMPARE(aSpy.count(), aCount);\n    QVERIFY(bSpy.count() > bCount);\n    QCOMPARE(cSpy.count(), cCount);\n    QCOMPARE(bSpy.last().value(0).toInt(), 324);\n    QCOMPARE(cSpy.last().value(0).toInt(), 9845);\n\n    bCount = bSpy.count();\n\n    object.removePropertyWatch(\"b\");\n\n    timer.start(20);\n    loop.exec();\n    timer.stop();\n\n    QCOMPARE(aSpy.count(), aCount);\n    QCOMPARE(bSpy.count(), bCount);\n    QCOMPARE(cSpy.count(), cCount);\n}\n\nvoid tst_QMediaObject::setupNotifyTests()\n{\n    QTest::addColumn<int>(\"interval\");\n    QTest::addColumn<int>(\"count\");\n    QTest::addColumn<int>(\"wait\");\n\n    QTest::newRow(\"single 50ms\")\n            << 50\n            << 1\n            << 100;\n    QTest::newRow(\"single 100ms\")\n            << 100\n            << 1\n            << 200;\n    QTest::newRow(\"x3 50ms\")\n            << 50\n            << 3\n            << 200;\n    QTest::newRow(\"x3 100ms\")\n            << 100\n            << 3\n            << 400;\n}\n\nvoid tst_QMediaObject::notifySignals_data()\n{\n    setupNotifyTests();\n}\n\nvoid tst_QMediaObject::notifySignals()\n{\n    QFETCH(int, interval);\n    QFETCH(int, count);\n    QFETCH(int, wait);\n\n    QtTestMediaObject object;\n    object.setNotifyInterval(interval);\n    object.addPropertyWatch(\"a\");\n\n    QSignalSpy spy(&object, SIGNAL(aChanged(int)));\n\n    QEventLoop loop;\n    QTimer timer;\n    connect(&timer, SIGNAL(timeout()), &loop, SLOT(quit()));\n\n    timer.start(wait);\n    loop.exec();\n\n    QVERIFY(spy.count() >= count);\n    QVERIFY(spy.count() < count + 2);\n}\n\nvoid tst_QMediaObject::notifyInterval_data()\n{\n    setupNotifyTests();\n}\n\nvoid tst_QMediaObject::notifyInterval()\n{\n    QFETCH(int, interval);\n\n    QtTestMediaObject object;\n    object.setNotifyInterval(interval);\n\n    QCOMPARE(object.notifyInterval(), interval);\n}\n\nvoid tst_QMediaObject::isMetaDataAvailable()\n{\n    QtTestMetaDataService service;\n    service.metaData.setMetaDataAvailable(false);\n\n    QtTestMediaObject object(&service);\n    QCOMPARE(object.isMetaDataAvailable(), false);\n\n    QSignalSpy spy(&object, SIGNAL(metaDataAvailableChanged(bool)));\n    service.metaData.setMetaDataAvailable(true);\n\n    QCOMPARE(object.isMetaDataAvailable(), true);\n    QCOMPARE(spy.count(), 1);\n    QCOMPARE(spy.at(0).at(0).toBool(), true);\n\n    service.metaData.setMetaDataAvailable(false);\n\n    QCOMPARE(object.isMetaDataAvailable(), false);\n    QCOMPARE(spy.count(), 2);\n    QCOMPARE(spy.at(1).at(0).toBool(), false);\n}\n\nvoid tst_QMediaObject::isWritable()\n{\n    QtTestMetaDataService service;\n    service.metaData.setWritable(false);\n\n    QtTestMediaObject object(&service);\n\n    QSignalSpy spy(&object, SIGNAL(metaDataWritableChanged(bool)));\n\n    QCOMPARE(object.isMetaDataWritable(), false);\n\n    service.metaData.setWritable(true);\n\n    QCOMPARE(object.isMetaDataWritable(), true);\n    QCOMPARE(spy.count(), 1);\n    QCOMPARE(spy.at(0).at(0).toBool(), true);\n\n    service.metaData.setWritable(false);\n\n    QCOMPARE(object.isMetaDataWritable(), false);\n    QCOMPARE(spy.count(), 2);\n    QCOMPARE(spy.at(1).at(0).toBool(), false);\n}\n\nvoid tst_QMediaObject::metaDataChanged()\n{\n    QtTestMetaDataService service;\n    QtTestMediaObject object(&service);\n\n    QSignalSpy spy(&object, SIGNAL(metaDataChanged()));\n\n    service.metaData.metaDataChanged();\n    QCOMPARE(spy.count(), 1);\n\n    service.metaData.metaDataChanged();\n    QCOMPARE(spy.count(), 2);\n}\n\nvoid tst_QMediaObject::metaData_data()\n{\n    QTest::addColumn<QString>(\"artist\");\n    QTest::addColumn<QString>(\"title\");\n    QTest::addColumn<QString>(\"genre\");\n\n    QTest::newRow(\"\")\n            << QString::fromLatin1(\"Dead Can Dance\")\n            << QString::fromLatin1(\"Host of Seraphim\")\n            << QString::fromLatin1(\"Awesome\");\n}\n\nvoid tst_QMediaObject::metaData()\n{\n    QFETCH(QString, artist);\n    QFETCH(QString, title);\n    QFETCH(QString, genre);\n\n    QtTestMetaDataService service;\n    service.metaData.populateMetaData();\n\n    service.metaData.m_data.insert(QMediaObject::AlbumArtist, artist);\n    service.metaData.m_data.insert(QMediaObject::Title, title);\n    service.metaData.m_data.insert(QMediaObject::Genre, genre);\n\n    QtTestMediaObject object(&service);\n\n    QCOMPARE(object.metaData(QMediaObject::AlbumArtist).toString(), artist);\n    QCOMPARE(object.metaData(QMediaObject::Title).toString(), title);\n}\n\nvoid tst_QMediaObject::setMetaData_data()\n{\n    QTest::addColumn<QString>(\"title\");\n\n    QTest::newRow(\"\")\n            << QString::fromLatin1(\"In the Kingdom of the Blind the One eyed are Kings\");\n}\n\nvoid tst_QMediaObject::setMetaData()\n{\n    QFETCH(QString, title);\n\n    QtTestMetaDataService service;\n    service.metaData.populateMetaData();\n\n    QtTestMediaObject object(&service);\n\n    object.setMetaData(QMediaObject::Title, title);\n    QCOMPARE(object.metaData(QMediaObject::Title).toString(), title);\n    QCOMPARE(service.metaData.m_data.value(QMediaObject::Title).toString(), title);\n}\n\nvoid tst_QMediaObject::extendedMetaData()\n{\n    QFETCH(QString, artist);\n    QFETCH(QString, title);\n    QFETCH(QString, genre);\n\n    QtTestMetaDataService service;\n    service.metaData.m_extendedData.insert(QLatin1String(\"Artist\"), artist);\n    service.metaData.m_extendedData.insert(QLatin1String(\"Title\"), title);\n    service.metaData.m_extendedData.insert(QLatin1String(\"Genre\"), genre);\n\n    QtTestMediaObject object(&service);\n\n    QCOMPARE(object.extendedMetaData(QLatin1String(\"Artist\")).toString(), artist);\n    QCOMPARE(object.extendedMetaData(QLatin1String(\"Title\")).toString(), title);\n}\n\nvoid tst_QMediaObject::setExtendedMetaData()\n{\n    QtTestMetaDataService service;\n    service.metaData.populateMetaData();\n\n    QtTestMediaObject object(&service);\n\n    QString title(QLatin1String(\"In the Kingdom of the Blind the One eyed are Kings\"));\n\n    object.setExtendedMetaData(QLatin1String(\"Title\"), title);\n    QCOMPARE(object.extendedMetaData(QLatin1String(\"Title\")).toString(), title);\n    QCOMPARE(service.metaData.m_extendedData.value(QLatin1String(\"Title\")).toString(), title);\n}\n\nQTEST_MAIN(tst_QMediaObject)\n\n#include \"tst_qmediaobject.moc\"\n<commit_msg>Use QTestEventLoop to wait rather than a QEventLoop and QTimer.<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 <QtTest\/QtTest>\n\n#include <QtCore\/qtimer.h>\n\n#include <multimedia\/qmediaobject.h>\n#include <multimedia\/qmediaservice.h>\n#include <multimedia\/qmetadataprovidercontrol.h>\n\nclass tst_QMediaObject : public QObject\n{\n    Q_OBJECT\n\nprivate slots:\n    void propertyWatch();\n    void notifySignals_data();\n    void notifySignals();\n    void notifyInterval_data();\n    void notifyInterval();\n\n    void isMetaDataAvailable();\n    void isWritable();\n    void metaDataChanged();\n    void metaData_data();\n    void metaData();\n    void setMetaData_data();\n    void setMetaData();\n    void extendedMetaData_data() { metaData_data(); }\n    void extendedMetaData();\n    void setExtendedMetaData_data() { extendedMetaData_data(); }\n    void setExtendedMetaData();\n\nprivate:\n    void setupNotifyTests();\n};\n\nclass QtTestMetaDataProvider : public QMetaDataProviderControl\n{\n    Q_OBJECT\npublic:\n    QtTestMetaDataProvider(QObject *parent = 0)\n        : QMetaDataProviderControl(parent)\n        , m_available(false)\n        , m_writable(false)\n    {\n    }\n\n    bool isMetaDataAvailable() const { return m_available; }\n    void setMetaDataAvailable(bool available) {\n        if (m_available != available)\n            emit metaDataAvailableChanged(m_available = available);\n    }\n\n    bool isWritable() const { return m_writable; }\n    void setWritable(bool writable) { emit writableChanged(m_writable = writable); }\n\n    QVariant metaData(QMediaObject::MetaData key) const { return m_data.value(key); }\n    void setMetaData(QMediaObject::MetaData key, const QVariant &value) {\n        m_data.insert(key, value); }\n\n    QVariant extendedMetaData(const QString &key) const { return m_extendedData.value(key); }\n    void setExtendedMetaData(const QString &key, const QVariant &value) {\n        m_extendedData.insert(key, value); }\n\n    using QMetaDataProviderControl::metaDataChanged;\n\n    void populateMetaData()\n    {\n        m_available = true;\n    }\n\n    bool m_available;\n    bool m_writable;\n    QMap<QMediaObject::MetaData, QVariant> m_data;\n    QMap<QString, QVariant> m_extendedData;\n};\n\nclass QtTestMetaDataService : public QMediaService\n{\n    Q_OBJECT\npublic:\n    QtTestMetaDataService(QObject *parent = 0):QMediaService(parent)\n    {\n    }\n\n    QMediaControl *control(const char *iid) const\n    {\n        if (qstrcmp(iid, QMetaDataProviderControl_iid) == 0)\n            return const_cast<QtTestMetaDataProvider *>(&metaData);\n        else\n            return 0;\n    }\n\n    QtTestMetaDataProvider metaData;\n};\n\n\nclass QtTestMediaObject : public QMediaObject\n{\n    Q_OBJECT\n    Q_PROPERTY(int a READ a WRITE setA NOTIFY aChanged)\n    Q_PROPERTY(int b READ b WRITE setB NOTIFY bChanged)\n    Q_PROPERTY(int c READ c WRITE setC NOTIFY cChanged)\npublic:\n    QtTestMediaObject(QMediaService *service = 0): QMediaObject(0, service), m_a(0), m_b(0), m_c(0) {}\n\n    using QMediaObject::addPropertyWatch;\n    using QMediaObject::removePropertyWatch;\n\n    int a() const { return m_a; }\n    void setA(int a) { m_a = a; }\n\n    int b() const { return m_b; }\n    void setB(int b) { m_b = b; }\n\n    int c() const { return m_c; }\n    void setC(int c) { m_c = c; }\n\nQ_SIGNALS:\n    void aChanged(int a);\n    void bChanged(int b);\n    void cChanged(int c);\n\nprivate:\n    int m_a;\n    int m_b;\n    int m_c;\n};\n\nvoid tst_QMediaObject::propertyWatch()\n{\n    QtTestMediaObject object;\n    object.setNotifyInterval(0);\n\n    QEventLoop loop;\n    connect(&object, SIGNAL(aChanged(int)), &QTestEventLoop::instance(), SLOT(exitLoop()));\n    connect(&object, SIGNAL(bChanged(int)), &QTestEventLoop::instance(), SLOT(exitLoop()));\n    connect(&object, SIGNAL(cChanged(int)), &QTestEventLoop::instance(), SLOT(exitLoop()));\n\n    QSignalSpy aSpy(&object, SIGNAL(aChanged(int)));\n    QSignalSpy bSpy(&object, SIGNAL(bChanged(int)));\n    QSignalSpy cSpy(&object, SIGNAL(cChanged(int)));\n\n    QTestEventLoop::instance().enterLoop(1);\n\n    QCOMPARE(aSpy.count(), 0);\n    QCOMPARE(bSpy.count(), 0);\n    QCOMPARE(cSpy.count(), 0);\n\n    int aCount = 0;\n    int bCount = 0;\n    int cCount = 0;\n\n    object.addPropertyWatch(\"a\");\n\n    QTestEventLoop::instance().enterLoop(1);\n\n    QVERIFY(aSpy.count() > aCount);\n    QCOMPARE(bSpy.count(), 0);\n    QCOMPARE(cSpy.count(), 0);\n    QCOMPARE(aSpy.last().value(0).toInt(), 0);\n\n    aCount = aSpy.count();\n\n    object.setA(54);\n    object.setB(342);\n    object.setC(233);\n\n    QTestEventLoop::instance().enterLoop(1);\n\n    QVERIFY(aSpy.count() > aCount);\n    QCOMPARE(bSpy.count(), 0);\n    QCOMPARE(cSpy.count(), 0);\n    QCOMPARE(aSpy.last().value(0).toInt(), 54);\n\n    aCount = aSpy.count();\n\n    object.addPropertyWatch(\"b\");\n    object.setA(43);\n    object.setB(235);\n    object.setC(90);\n\n    QTestEventLoop::instance().enterLoop(1);\n\n    QVERIFY(aSpy.count() > aCount);\n    QVERIFY(bSpy.count() > bCount);\n    QCOMPARE(cSpy.count(), 0);\n    QCOMPARE(aSpy.last().value(0).toInt(), 43);\n    QCOMPARE(bSpy.last().value(0).toInt(), 235);\n\n    aCount = aSpy.count();\n    bCount = bSpy.count();\n\n    object.removePropertyWatch(\"a\");\n    object.addPropertyWatch(\"c\");\n\n    QTestEventLoop::instance().enterLoop(1);\n\n    QCOMPARE(aSpy.count(), aCount);\n    QVERIFY(bSpy.count() > bCount);\n    QVERIFY(cSpy.count() > cCount);\n    QCOMPARE(bSpy.last().value(0).toInt(), 235);\n    QCOMPARE(cSpy.last().value(0).toInt(), 90);\n\n    bCount = bSpy.count();\n    cCount = cSpy.count();\n\n    object.setA(435);\n    object.setC(9845);\n\n    QTestEventLoop::instance().enterLoop(1);\n\n    QCOMPARE(aSpy.count(), aCount);\n    QVERIFY(bSpy.count() > bCount);\n    QVERIFY(cSpy.count() > cCount);\n    QCOMPARE(bSpy.last().value(0).toInt(), 235);\n    QCOMPARE(cSpy.last().value(0).toInt(), 9845);\n\n    bCount = bSpy.count();\n    cCount = cSpy.count();\n\n    object.setA(8432);\n    object.setB(324);\n    object.setC(443);\n    object.removePropertyWatch(\"c\");\n\n    QTestEventLoop::instance().enterLoop(1);\n\n    QCOMPARE(aSpy.count(), aCount);\n    QVERIFY(bSpy.count() > bCount);\n    QCOMPARE(cSpy.count(), cCount);\n    QCOMPARE(bSpy.last().value(0).toInt(), 324);\n    QCOMPARE(cSpy.last().value(0).toInt(), 9845);\n\n    bCount = bSpy.count();\n\n    object.removePropertyWatch(\"b\");\n\n    QTestEventLoop::instance().enterLoop(1);\n\n    QCOMPARE(aSpy.count(), aCount);\n    QCOMPARE(bSpy.count(), bCount);\n    QCOMPARE(cSpy.count(), cCount);\n}\n\nvoid tst_QMediaObject::setupNotifyTests()\n{\n    QTest::addColumn<int>(\"interval\");\n    QTest::addColumn<int>(\"count\");\n\n    QTest::newRow(\"single 750ms\")\n            << 750\n            << 1;\n    QTest::newRow(\"single 600ms\")\n            << 600\n            << 1;\n    QTest::newRow(\"x3 300ms\")\n            << 300\n            << 3;\n    QTest::newRow(\"x5 180ms\")\n            << 180\n            << 5;\n}\n\nvoid tst_QMediaObject::notifySignals_data()\n{\n    setupNotifyTests();\n}\n\nvoid tst_QMediaObject::notifySignals()\n{\n    QFETCH(int, interval);\n    QFETCH(int, count);\n\n    QtTestMediaObject object;\n    object.setNotifyInterval(interval);\n    object.addPropertyWatch(\"a\");\n\n    QSignalSpy spy(&object, SIGNAL(aChanged(int)));\n\n    QTestEventLoop::instance().enterLoop(1);\n\n    QCOMPARE(spy.count(), count);\n}\n\nvoid tst_QMediaObject::notifyInterval_data()\n{\n    setupNotifyTests();\n}\n\nvoid tst_QMediaObject::notifyInterval()\n{\n    QFETCH(int, interval);\n\n    QtTestMediaObject object;\n    object.setNotifyInterval(interval);\n\n    QCOMPARE(object.notifyInterval(), interval);\n}\n\nvoid tst_QMediaObject::isMetaDataAvailable()\n{\n    QtTestMetaDataService service;\n    service.metaData.setMetaDataAvailable(false);\n\n    QtTestMediaObject object(&service);\n    QCOMPARE(object.isMetaDataAvailable(), false);\n\n    QSignalSpy spy(&object, SIGNAL(metaDataAvailableChanged(bool)));\n    service.metaData.setMetaDataAvailable(true);\n\n    QCOMPARE(object.isMetaDataAvailable(), true);\n    QCOMPARE(spy.count(), 1);\n    QCOMPARE(spy.at(0).at(0).toBool(), true);\n\n    service.metaData.setMetaDataAvailable(false);\n\n    QCOMPARE(object.isMetaDataAvailable(), false);\n    QCOMPARE(spy.count(), 2);\n    QCOMPARE(spy.at(1).at(0).toBool(), false);\n}\n\nvoid tst_QMediaObject::isWritable()\n{\n    QtTestMetaDataService service;\n    service.metaData.setWritable(false);\n\n    QtTestMediaObject object(&service);\n\n    QSignalSpy spy(&object, SIGNAL(metaDataWritableChanged(bool)));\n\n    QCOMPARE(object.isMetaDataWritable(), false);\n\n    service.metaData.setWritable(true);\n\n    QCOMPARE(object.isMetaDataWritable(), true);\n    QCOMPARE(spy.count(), 1);\n    QCOMPARE(spy.at(0).at(0).toBool(), true);\n\n    service.metaData.setWritable(false);\n\n    QCOMPARE(object.isMetaDataWritable(), false);\n    QCOMPARE(spy.count(), 2);\n    QCOMPARE(spy.at(1).at(0).toBool(), false);\n}\n\nvoid tst_QMediaObject::metaDataChanged()\n{\n    QtTestMetaDataService service;\n    QtTestMediaObject object(&service);\n\n    QSignalSpy spy(&object, SIGNAL(metaDataChanged()));\n\n    service.metaData.metaDataChanged();\n    QCOMPARE(spy.count(), 1);\n\n    service.metaData.metaDataChanged();\n    QCOMPARE(spy.count(), 2);\n}\n\nvoid tst_QMediaObject::metaData_data()\n{\n    QTest::addColumn<QString>(\"artist\");\n    QTest::addColumn<QString>(\"title\");\n    QTest::addColumn<QString>(\"genre\");\n\n    QTest::newRow(\"\")\n            << QString::fromLatin1(\"Dead Can Dance\")\n            << QString::fromLatin1(\"Host of Seraphim\")\n            << QString::fromLatin1(\"Awesome\");\n}\n\nvoid tst_QMediaObject::metaData()\n{\n    QFETCH(QString, artist);\n    QFETCH(QString, title);\n    QFETCH(QString, genre);\n\n    QtTestMetaDataService service;\n    service.metaData.populateMetaData();\n\n    service.metaData.m_data.insert(QMediaObject::AlbumArtist, artist);\n    service.metaData.m_data.insert(QMediaObject::Title, title);\n    service.metaData.m_data.insert(QMediaObject::Genre, genre);\n\n    QtTestMediaObject object(&service);\n\n    QCOMPARE(object.metaData(QMediaObject::AlbumArtist).toString(), artist);\n    QCOMPARE(object.metaData(QMediaObject::Title).toString(), title);\n}\n\nvoid tst_QMediaObject::setMetaData_data()\n{\n    QTest::addColumn<QString>(\"title\");\n\n    QTest::newRow(\"\")\n            << QString::fromLatin1(\"In the Kingdom of the Blind the One eyed are Kings\");\n}\n\nvoid tst_QMediaObject::setMetaData()\n{\n    QFETCH(QString, title);\n\n    QtTestMetaDataService service;\n    service.metaData.populateMetaData();\n\n    QtTestMediaObject object(&service);\n\n    object.setMetaData(QMediaObject::Title, title);\n    QCOMPARE(object.metaData(QMediaObject::Title).toString(), title);\n    QCOMPARE(service.metaData.m_data.value(QMediaObject::Title).toString(), title);\n}\n\nvoid tst_QMediaObject::extendedMetaData()\n{\n    QFETCH(QString, artist);\n    QFETCH(QString, title);\n    QFETCH(QString, genre);\n\n    QtTestMetaDataService service;\n    service.metaData.m_extendedData.insert(QLatin1String(\"Artist\"), artist);\n    service.metaData.m_extendedData.insert(QLatin1String(\"Title\"), title);\n    service.metaData.m_extendedData.insert(QLatin1String(\"Genre\"), genre);\n\n    QtTestMediaObject object(&service);\n\n    QCOMPARE(object.extendedMetaData(QLatin1String(\"Artist\")).toString(), artist);\n    QCOMPARE(object.extendedMetaData(QLatin1String(\"Title\")).toString(), title);\n}\n\nvoid tst_QMediaObject::setExtendedMetaData()\n{\n    QtTestMetaDataService service;\n    service.metaData.populateMetaData();\n\n    QtTestMediaObject object(&service);\n\n    QString title(QLatin1String(\"In the Kingdom of the Blind the One eyed are Kings\"));\n\n    object.setExtendedMetaData(QLatin1String(\"Title\"), title);\n    QCOMPARE(object.extendedMetaData(QLatin1String(\"Title\")).toString(), title);\n    QCOMPARE(service.metaData.m_extendedData.value(QLatin1String(\"Title\")).toString(), title);\n}\n\nQTEST_MAIN(tst_QMediaObject)\n\n#include \"tst_qmediaobject.moc\"\n<|endoftext|>"}
{"text":"<commit_before>\/\/  (C) Copyright Gennadiy Rozental 2001-2005.\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 : included (vs. linked) version of Test Execution Monitor\n\/\/ ***************************************************************************\n\n#ifndef BOOST_INCLUDED_TEST_EXEC_MONITOR_HPP_071894GER\n#define BOOST_INCLUDED_TEST_EXEC_MONITOR_HPP_071894GER\n\n#include <boost\/test\/impl\/compiler_log_formatter.ipp>\n#include <boost\/test\/impl\/execution_monitor.ipp>\n#include <boost\/test\/impl\/framework.ipp>\n#include <boost\/test\/impl\/plain_report_formatter.ipp>\n#include <boost\/test\/impl\/progress_monitor.ipp>\n#include <boost\/test\/impl\/results_collector.ipp>\n#include <boost\/test\/impl\/results_reporter.ipp>\n#include <boost\/test\/impl\/test_main.ipp>\n#include <boost\/test\/impl\/test_tools.ipp>\n#include <boost\/test\/impl\/unit_test_log.ipp>\n#include <boost\/test\/impl\/unit_test_main.ipp>\n#include <boost\/test\/impl\/unit_test_monitor.ipp>\n#include <boost\/test\/impl\/unit_test_parameters.ipp>\n#include <boost\/test\/impl\/unit_test_suite.ipp>\n#include <boost\/test\/impl\/xml_log_formatter.ipp>\n#include <boost\/test\/impl\/xml_report_formatter.ipp>\n\n#define BOOST_TEST_INCLUDED\n#include <boost\/test\/test_exec_monitor.hpp>\n\n\/\/ ***************************************************************************\n\/\/  Revision History :\n\/\/  \n\/\/  $Log$\n\/\/  Revision 1.15  2006\/02\/06 10:01:55  rogeeff\n\/\/  m,ake name similar to the primary header name\n\/\/\n\/\/  Revision 1.14  2006\/02\/01 07:57:49  rogeeff\n\/\/  included components entry points\n\/\/\n\/\/  Revision 1.13  2005\/02\/20 08:27:08  rogeeff\n\/\/  This a major update for Boost.Test framework. See release docs for complete list of fixes\/updates\n\/\/\n\/\/  Revision 1.12  2005\/02\/01 08:59:38  rogeeff\n\/\/  supplied_log_formatters split\n\/\/  change formatters interface to simplify result interface\n\/\/\n\/\/  Revision 1.11  2005\/02\/01 06:40:07  rogeeff\n\/\/  copyright update\n\/\/  old log entries removed\n\/\/  minor stilistic changes\n\/\/  depricated tools removed\n\/\/\n\/\/  Revision 1.10  2005\/01\/22 19:22:13  rogeeff\n\/\/  implementation moved into headers section to eliminate dependency of included\/minimal component on src directory\n\/\/\n\/\/ ***************************************************************************\n\n#endif \/\/ BOOST_INCLUDED_TEST_EXEC_MONITOR_HPP_071894GER\n<commit_msg>missing file included<commit_after>\/\/  (C) Copyright Gennadiy Rozental 2001-2005.\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 : included (vs. linked) version of Test Execution Monitor\n\/\/ ***************************************************************************\n\n#ifndef BOOST_INCLUDED_TEST_EXEC_MONITOR_HPP_071894GER\n#define BOOST_INCLUDED_TEST_EXEC_MONITOR_HPP_071894GER\n\n#include <boost\/test\/impl\/compiler_log_formatter.ipp>\n#include <boost\/test\/impl\/debug.ipp>\n#include <boost\/test\/impl\/execution_monitor.ipp>\n#include <boost\/test\/impl\/framework.ipp>\n#include <boost\/test\/impl\/plain_report_formatter.ipp>\n#include <boost\/test\/impl\/progress_monitor.ipp>\n#include <boost\/test\/impl\/results_collector.ipp>\n#include <boost\/test\/impl\/results_reporter.ipp>\n#include <boost\/test\/impl\/test_main.ipp>\n#include <boost\/test\/impl\/test_tools.ipp>\n#include <boost\/test\/impl\/unit_test_log.ipp>\n#include <boost\/test\/impl\/unit_test_main.ipp>\n#include <boost\/test\/impl\/unit_test_monitor.ipp>\n#include <boost\/test\/impl\/unit_test_parameters.ipp>\n#include <boost\/test\/impl\/unit_test_suite.ipp>\n#include <boost\/test\/impl\/xml_log_formatter.ipp>\n#include <boost\/test\/impl\/xml_report_formatter.ipp>\n\n#define BOOST_TEST_INCLUDED\n#include <boost\/test\/test_exec_monitor.hpp>\n\n\/\/ ***************************************************************************\n\/\/  Revision History :\n\/\/  \n\/\/  $Log$\n\/\/  Revision 1.15  2006\/02\/06 10:01:55  rogeeff\n\/\/  m,ake name similar to the primary header name\n\/\/\n\/\/  Revision 1.14  2006\/02\/01 07:57:49  rogeeff\n\/\/  included components entry points\n\/\/\n\/\/  Revision 1.13  2005\/02\/20 08:27:08  rogeeff\n\/\/  This a major update for Boost.Test framework. See release docs for complete list of fixes\/updates\n\/\/\n\/\/  Revision 1.12  2005\/02\/01 08:59:38  rogeeff\n\/\/  supplied_log_formatters split\n\/\/  change formatters interface to simplify result interface\n\/\/\n\/\/  Revision 1.11  2005\/02\/01 06:40:07  rogeeff\n\/\/  copyright update\n\/\/  old log entries removed\n\/\/  minor stilistic changes\n\/\/  depricated tools removed\n\/\/\n\/\/  Revision 1.10  2005\/01\/22 19:22:13  rogeeff\n\/\/  implementation moved into headers section to eliminate dependency of included\/minimal component on src directory\n\/\/\n\/\/ ***************************************************************************\n\n#endif \/\/ BOOST_INCLUDED_TEST_EXEC_MONITOR_HPP_071894GER\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 \"oox\/drawingml\/textparagraph.hxx\"\n#include \"oox\/drawingml\/drawingmltypes.hxx\"\n#include \"oox\/drawingml\/textcharacterproperties.hxx\"\n\n#include <rtl\/ustring.hxx>\n#include \"oox\/helper\/propertyset.hxx\"\n#include <com\/sun\/star\/text\/XText.hpp>\n#include <com\/sun\/star\/text\/XTextCursor.hpp>\n#include <com\/sun\/star\/text\/ControlCharacter.hpp>\n\nusing ::rtl::OUString;\nusing namespace ::com::sun::star::text;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::beans;\nusing namespace ::com::sun::star::frame;\n\nnamespace oox { namespace drawingml {\n\nTextParagraph::TextParagraph()\n{\n}\n\nTextParagraph::~TextParagraph()\n{\n}\n\nvoid TextParagraph::insertAt(\n        const ::oox::core::XmlFilterBase& rFilterBase,\n        const Reference < XText > &xText,\n        const Reference < XTextCursor > &xAt,\n        const TextCharacterProperties& rTextStyleProperties,\n        const TextListStyle& rTextListStyle, bool bFirst) const\n{\n    try {\n        sal_Int32 nParagraphSize = 0;\n        Reference< XTextRange > xStart( xAt, UNO_QUERY );\n\n        sal_Int16 nLevel = maProperties.getLevel();\n\n        SAL_INFO(\"oox\", \"TextParagraph::insertAt() - level \" << nLevel);\n\n        const TextParagraphPropertiesVector& rListStyle = rTextListStyle.getListStyle();\n        if ( nLevel >= static_cast< sal_Int16 >( rListStyle.size() ) )\n            nLevel = 0;\n        TextParagraphPropertiesPtr pTextParagraphStyle;\n        if ( rListStyle.size() )\n            pTextParagraphStyle = rListStyle[ nLevel ];\n\n        TextCharacterProperties aTextCharacterStyle;\n        if ( pTextParagraphStyle.get() )\n            aTextCharacterStyle.assignUsed( pTextParagraphStyle->getTextCharacterProperties() );\n        aTextCharacterStyle.assignUsed( rTextStyleProperties );\n        aTextCharacterStyle.assignUsed( maProperties.getTextCharacterProperties() );\n\n        if( !bFirst )\n        {\n            xText->insertControlCharacter( xStart, ControlCharacter::APPEND_PARAGRAPH, sal_False );\n            xAt->gotoEnd( sal_True );\n        }\n\n        sal_Int32 nCharHeight = 0;\n        if ( maRuns.begin() == maRuns.end() )\n        {\n            PropertySet aPropSet( xStart );\n\n            TextCharacterProperties aTextCharacterProps( aTextCharacterStyle );\n            aTextCharacterProps.assignUsed( maEndProperties );\n            if ( aTextCharacterProps.moHeight.has() )\n                nCharHeight = aTextCharacterProps.moHeight.get();\n            aTextCharacterProps.pushToPropSet( aPropSet, rFilterBase );\n        }\n        else\n        {\n            for( TextRunVector::const_iterator aIt = maRuns.begin(), aEnd = maRuns.end(); aIt != aEnd; ++aIt )\n            {\n                nCharHeight = std::max< sal_Int32 >( nCharHeight, (*aIt)->insertAt( rFilterBase, xText, xAt, aTextCharacterStyle ) );\n                nParagraphSize += (*aIt)->getText().getLength();\n            }\n        }\n        xAt->gotoEnd( sal_True );\n\n        PropertyMap aioBulletList;\n        Reference< XPropertySet > xProps( xStart, UNO_QUERY);\n        float fCharacterSize = nCharHeight > 0 ? GetFontHeight( nCharHeight ) :  18;\n        if ( pTextParagraphStyle.get() )\n        {\n            pTextParagraphStyle->pushToPropSet( &rFilterBase, xProps, aioBulletList, NULL, sal_True, fCharacterSize, true );\n            fCharacterSize = pTextParagraphStyle->getCharHeightPoints( fCharacterSize );\n\n            \/\/ bullets have same color as following texts by default\n            if( !aioBulletList.hasProperty( PROP_BulletColor ) && maRuns.size() > 0\n                && (*maRuns.begin())->getTextCharacterProperties().maCharColor.isUsed() )\n                aioBulletList[ PROP_BulletColor ] <<= (*maRuns.begin())->getTextCharacterProperties().maCharColor.getColor( rFilterBase.getGraphicHelper() );\n\n            maProperties.pushToPropSet( &rFilterBase, xProps, aioBulletList, &pTextParagraphStyle->getBulletList(), sal_True, fCharacterSize );\n        }\n\n        \/\/ empty paragraphs do not have bullets in ppt\n        if ( !nParagraphSize )\n        {\n            const OUString sNumberingLevel( CREATE_OUSTRING( \"NumberingLevel\" ) );\n            xProps->setPropertyValue( sNumberingLevel, Any( static_cast< sal_Int16 >( -1 ) ) );\n        }\n        else if ( nLevel > 1 )\n        {\n            \/\/ Even more UGLY HACK\n            const OUString sNumberingLevel( CREATE_OUSTRING( \"NumberingLevel\" ) );\n            xProps->setPropertyValue( sNumberingLevel, Any( static_cast< sal_Int16 >( nLevel-1 ) ) );\n        }\n\n\/\/ FIXME this is causing a lot of dispruption (ie does not work). I wonder what to do -- Hub\n\/\/          Reference< XTextRange > xEnd( xAt, UNO_QUERY );\n\/\/      Reference< XPropertySet > xProps2( xEnd, UNO_QUERY );\n\/\/          mpEndProperties->pushToPropSet( xProps2 );\n    }\n    catch( Exception & )\n    {\n        SAL_INFO(\"oox\", \"exception in TextParagraph::insertAt\");\n    }\n}\n\n\n} }\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>n#759180: Override properties with endParaPr.<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 \"oox\/drawingml\/textparagraph.hxx\"\n#include \"oox\/drawingml\/drawingmltypes.hxx\"\n#include \"oox\/drawingml\/textcharacterproperties.hxx\"\n\n#include <rtl\/ustring.hxx>\n#include \"oox\/helper\/propertyset.hxx\"\n#include <com\/sun\/star\/text\/XText.hpp>\n#include <com\/sun\/star\/text\/XTextCursor.hpp>\n#include <com\/sun\/star\/text\/ControlCharacter.hpp>\n\nusing ::rtl::OUString;\nusing namespace ::com::sun::star::text;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::beans;\nusing namespace ::com::sun::star::frame;\n\nnamespace oox { namespace drawingml {\n\nTextParagraph::TextParagraph()\n{\n}\n\nTextParagraph::~TextParagraph()\n{\n}\n\nvoid TextParagraph::insertAt(\n        const ::oox::core::XmlFilterBase& rFilterBase,\n        const Reference < XText > &xText,\n        const Reference < XTextCursor > &xAt,\n        const TextCharacterProperties& rTextStyleProperties,\n        const TextListStyle& rTextListStyle, bool bFirst) const\n{\n    try {\n        sal_Int32 nParagraphSize = 0;\n        Reference< XTextRange > xStart( xAt, UNO_QUERY );\n\n        sal_Int16 nLevel = maProperties.getLevel();\n\n        SAL_INFO(\"oox\", \"TextParagraph::insertAt() - level \" << nLevel);\n\n        const TextParagraphPropertiesVector& rListStyle = rTextListStyle.getListStyle();\n        if ( nLevel >= static_cast< sal_Int16 >( rListStyle.size() ) )\n            nLevel = 0;\n        TextParagraphPropertiesPtr pTextParagraphStyle;\n        if ( rListStyle.size() )\n            pTextParagraphStyle = rListStyle[ nLevel ];\n\n        TextCharacterProperties aTextCharacterStyle;\n        if ( pTextParagraphStyle.get() )\n            aTextCharacterStyle.assignUsed( pTextParagraphStyle->getTextCharacterProperties() );\n        aTextCharacterStyle.assignUsed( rTextStyleProperties );\n        aTextCharacterStyle.assignUsed( maProperties.getTextCharacterProperties() );\n\n        if( !bFirst )\n        {\n            xText->insertControlCharacter( xStart, ControlCharacter::APPEND_PARAGRAPH, sal_False );\n            xAt->gotoEnd( sal_True );\n        }\n\n        sal_Int32 nCharHeight = 0;\n        if ( maRuns.begin() == maRuns.end() )\n        {\n            PropertySet aPropSet( xStart );\n\n            TextCharacterProperties aTextCharacterProps( aTextCharacterStyle );\n            aTextCharacterProps.assignUsed( maEndProperties );\n            if ( aTextCharacterProps.moHeight.has() )\n                nCharHeight = aTextCharacterProps.moHeight.get();\n            aTextCharacterProps.pushToPropSet( aPropSet, rFilterBase );\n        }\n        else\n        {\n            for( TextRunVector::const_iterator aIt = maRuns.begin(), aEnd = maRuns.end(); aIt != aEnd; ++aIt )\n            {\n                sal_Int32 nLen = (*aIt)->getText().getLength();\n                \/\/ n#759180: Force use, maEndProperties for the last segment\n                \/\/ This is currently applied to only empty runs\n                if( !nLen && ( ( aIt + 1 ) == aEnd ) )\n                    (*aIt)->getTextCharacterProperties().assignUsed( maEndProperties );\n                nCharHeight = std::max< sal_Int32 >( nCharHeight, (*aIt)->insertAt( rFilterBase, xText, xAt, aTextCharacterStyle ) );\n                nParagraphSize += nLen;\n            }\n        }\n        xAt->gotoEnd( sal_True );\n\n        PropertyMap aioBulletList;\n        Reference< XPropertySet > xProps( xStart, UNO_QUERY);\n        float fCharacterSize = nCharHeight > 0 ? GetFontHeight( nCharHeight ) :  18;\n        if ( pTextParagraphStyle.get() )\n        {\n            pTextParagraphStyle->pushToPropSet( &rFilterBase, xProps, aioBulletList, NULL, sal_True, fCharacterSize, true );\n            fCharacterSize = pTextParagraphStyle->getCharHeightPoints( fCharacterSize );\n\n            \/\/ bullets have same color as following texts by default\n            if( !aioBulletList.hasProperty( PROP_BulletColor ) && maRuns.size() > 0\n                && (*maRuns.begin())->getTextCharacterProperties().maCharColor.isUsed() )\n                aioBulletList[ PROP_BulletColor ] <<= (*maRuns.begin())->getTextCharacterProperties().maCharColor.getColor( rFilterBase.getGraphicHelper() );\n\n            maProperties.pushToPropSet( &rFilterBase, xProps, aioBulletList, &pTextParagraphStyle->getBulletList(), sal_True, fCharacterSize );\n        }\n\n        \/\/ empty paragraphs do not have bullets in ppt\n        if ( !nParagraphSize )\n        {\n            const OUString sNumberingLevel( CREATE_OUSTRING( \"NumberingLevel\" ) );\n            xProps->setPropertyValue( sNumberingLevel, Any( static_cast< sal_Int16 >( -1 ) ) );\n        }\n        else if ( nLevel > 1 )\n        {\n            \/\/ Even more UGLY HACK\n            const OUString sNumberingLevel( CREATE_OUSTRING( \"NumberingLevel\" ) );\n            xProps->setPropertyValue( sNumberingLevel, Any( static_cast< sal_Int16 >( nLevel-1 ) ) );\n        }\n\n\/\/ FIXME this is causing a lot of dispruption (ie does not work). I wonder what to do -- Hub\n\/\/          Reference< XTextRange > xEnd( xAt, UNO_QUERY );\n\/\/      Reference< XPropertySet > xProps2( xEnd, UNO_QUERY );\n\/\/          mpEndProperties->pushToPropSet( xProps2 );\n    }\n    catch( Exception & )\n    {\n        SAL_INFO(\"oox\", \"exception in TextParagraph::insertAt\");\n    }\n}\n\n\n} }\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <algorithm>\n#include <numeric>\n#include \"glt\/load_models.h\"\n\nglt::ModelInfo::ModelInfo(size_t index_offset, size_t indices, size_t vert_offset)\n\t: index_offset(index_offset), indices(indices), vert_offset(vert_offset)\n{}\nbool glt::load_models(const std::vector<std::string> &model_files, SubBuffer &vert_buf,\n\t\tSubBuffer &elem_buf, BufferAllocator &allocator,\n\t\tstd::unordered_map<std::string, ModelInfo> &elem_offsets)\n{\n\tusing namespace glt;\n\tstd::vector<tinyobj::shape_t> loaded_models;\n\tfor (const auto &file : model_files){\n\t\tstd::vector<tinyobj::shape_t> shapes;\n\t\tstd::vector<tinyobj::material_t> materials;\n\t\tstd::string err = tinyobj::LoadObj(shapes, materials, file.c_str());\n\t\tif (!err.empty()){\n\t\t\tstd::cout << \"Failed to load model \" << file << \" error: \" << err << std::endl;\n\t\t\treturn false;\n\t\t}\n\t\tstd::cout << \"loaded \" << shapes.size() << \" model(s) from \" << file << \", name(s):\\n\";\n\t\tfor (const auto &s : shapes){\n\t\t\tstd::cout << \"\\t\" << s.name << \"\\n\";\n\t\t}\n\t\tstd::copy(shapes.begin(), shapes.end(), std::back_inserter(loaded_models));\n\t}\n\n\tsize_t total_elems = std::accumulate(loaded_models.begin(), loaded_models.end(), 0,\n\t\t\t[](const size_t &cur, const tinyobj::shape_t &s){\n\t\t\t\treturn cur + s.mesh.indices.size();\n\t\t\t});\n\telem_buf = allocator.alloc(total_elems * sizeof(GLuint), sizeof(GLuint));\n\t{\n\t\tunsigned int *elems = static_cast<unsigned int*>(elem_buf.map(GL_ELEMENT_ARRAY_BUFFER,\n\t\t\t\t\tGL_MAP_INVALIDATE_RANGE_BIT | GL_MAP_WRITE_BIT));\n\t\t\/\/ Track our offset in the element count\n\t\tsize_t prev_offset = 0;\n\t\tfor (const auto &s : loaded_models){\n\t\t\telem_offsets[s.name] = ModelInfo{prev_offset, s.mesh.indices.size()};\n\t\t\tstd::copy(s.mesh.indices.begin(), s.mesh.indices.end(), elems + prev_offset);\n\t\t\tprev_offset += s.mesh.indices.size();\n\t\t}\n\t\telem_buf.unmap(GL_ELEMENT_ARRAY_BUFFER);\n\t}\n\n\t\/\/ We store 6 floats per element at the moment\n\t\/\/ Format is vec3 (pos), vec3 (normal), vec2 (texcoord)\n\tvert_buf = allocator.alloc(total_elems * 8 * sizeof(float));\n\t{\n\t\tfloat *verts = static_cast<float*>(vert_buf.map(GL_ARRAY_BUFFER,\n\t\t\t\t\tGL_MAP_INVALIDATE_RANGE_BIT | GL_MAP_WRITE_BIT));\n\t\t\/\/ Track our offset in the vertex buffer\n\t\tsize_t i = 0;\n\t\tfor (const auto &s : loaded_models){\n\t\t\telem_offsets[s.name].vert_offset = i \/ 8;\n\t\t\tfor (auto p = s.mesh.positions.begin(), n = s.mesh.normals.begin(), t = s.mesh.texcoords.begin();\n\t\t\t\t\tp != s.mesh.positions.end();\n\t\t\t\t\ti += 8)\n\t\t\t{\n\t\t\t\tfor (int k = 0; k < 3; ++k, ++p){\n\t\t\t\t\tverts[i + k] = *p;\n\t\t\t\t}\n\t\t\t\tif (n != s.mesh.normals.end()){\n\t\t\t\t\tfor (int k = 3; k < 6; ++k, ++n){\n\t\t\t\t\t\tverts[i + k] = *n;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\/\/ Some models may not have\/need texcoords\n\t\t\t\tif (t != s.mesh.texcoords.end()){\n\t\t\t\t\tfor (int k = 6; k < 8; ++k, ++t){\n\t\t\t\t\t\tverts[i + k] = *t;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tvert_buf.unmap(GL_ARRAY_BUFFER);\n\t}\n\treturn true;\n}\nstd::ostream& operator<<(std::ostream &os, const glt::ModelInfo &m){\n\tos << \"glt::ModelInfo:\"\n\t\t<< \"\\n\\tindex_offset: \" << m.index_offset\n\t\t<< \"\\n\\tindices: \" << m.indices\n\t\t<< \"\\n\\tvert_offset: \" << m.vert_offset\n\t\t<< \"\\n--------\\n\";\n\treturn os;\n}\n\n<commit_msg>Add support for loading materials by passing the base path of the model<commit_after>#include <iostream>\n#include <algorithm>\n#include <numeric>\n#include \"glt\/util.h\"\n#include \"glt\/load_models.h\"\n\nglt::ModelInfo::ModelInfo(size_t index_offset, size_t indices, size_t vert_offset)\n\t: index_offset(index_offset), indices(indices), vert_offset(vert_offset)\n{}\nbool glt::load_models(const std::vector<std::string> &model_files, SubBuffer &vert_buf,\n\t\tSubBuffer &elem_buf, BufferAllocator &allocator,\n\t\tstd::unordered_map<std::string, ModelInfo> &elem_offsets)\n{\n\tusing namespace glt;\n\tstd::vector<tinyobj::shape_t> loaded_models;\n\tfor (const auto &file : model_files){\n\t\tstd::vector<tinyobj::shape_t> shapes;\n\t\tstd::vector<tinyobj::material_t> materials;\n\t\tstd::string base_path;\n\t\tconst auto base_path_end = file.rfind(PATH_SEP);\n\t\tif (base_path_end != std::string::npos){\n\t\t\tbase_path = file.substr(0, base_path_end + 1);\n\t\t}\n\t\tstd::string err = tinyobj::LoadObj(shapes, materials, file.c_str(), base_path.c_str());\n\t\tif (!err.empty()){\n\t\t\tstd::cout << \"Failed to load model \" << file << \" error: \" << err << std::endl;\n\t\t\treturn false;\n\t\t}\n\t\tstd::cout << \"loaded \" << shapes.size() << \" model(s) from \" << file << \", name(s):\\n\";\n\t\tfor (const auto &s : shapes){\n\t\t\tstd::cout << \"\\t\" << s.name << \"\\n\";\n\t\t}\n\t\tstd::cout << \"loaded \" << materials.size() << \" material(s):\\n\";\n\t\tfor (const auto &m : materials){\n\t\t\tstd::cout << \"\\t\" << m.name << \"\\n\";\n\t\t}\n\t\tstd::copy(shapes.begin(), shapes.end(), std::back_inserter(loaded_models));\n\t}\n\n\tsize_t total_elems = std::accumulate(loaded_models.begin(), loaded_models.end(), 0,\n\t\t\t[](const size_t &cur, const tinyobj::shape_t &s){\n\t\t\t\treturn cur + s.mesh.indices.size();\n\t\t\t});\n\telem_buf = allocator.alloc(total_elems * sizeof(GLuint), sizeof(GLuint));\n\t{\n\t\tunsigned int *elems = static_cast<unsigned int*>(elem_buf.map(GL_ELEMENT_ARRAY_BUFFER,\n\t\t\t\t\tGL_MAP_INVALIDATE_RANGE_BIT | GL_MAP_WRITE_BIT));\n\t\t\/\/ Track our offset in the element count\n\t\tsize_t prev_offset = 0;\n\t\tfor (const auto &s : loaded_models){\n\t\t\telem_offsets[s.name] = ModelInfo{prev_offset, s.mesh.indices.size()};\n\t\t\tstd::copy(s.mesh.indices.begin(), s.mesh.indices.end(), elems + prev_offset);\n\t\t\tprev_offset += s.mesh.indices.size();\n\t\t}\n\t\telem_buf.unmap(GL_ELEMENT_ARRAY_BUFFER);\n\t}\n\n\t\/\/ We store 6 floats per element at the moment\n\t\/\/ Format is vec3 (pos), vec3 (normal), vec2 (texcoord)\n\tvert_buf = allocator.alloc(total_elems * 8 * sizeof(float));\n\t{\n\t\tfloat *verts = static_cast<float*>(vert_buf.map(GL_ARRAY_BUFFER,\n\t\t\t\t\tGL_MAP_INVALIDATE_RANGE_BIT | GL_MAP_WRITE_BIT));\n\t\t\/\/ Track our offset in the vertex buffer\n\t\tsize_t i = 0;\n\t\tfor (const auto &s : loaded_models){\n\t\t\telem_offsets[s.name].vert_offset = i \/ 8;\n\t\t\tfor (auto p = s.mesh.positions.begin(), n = s.mesh.normals.begin(), t = s.mesh.texcoords.begin();\n\t\t\t\t\tp != s.mesh.positions.end();\n\t\t\t\t\ti += 8)\n\t\t\t{\n\t\t\t\tfor (int k = 0; k < 3; ++k, ++p){\n\t\t\t\t\tverts[i + k] = *p;\n\t\t\t\t}\n\t\t\t\tif (n != s.mesh.normals.end()){\n\t\t\t\t\tfor (int k = 3; k < 6; ++k, ++n){\n\t\t\t\t\t\tverts[i + k] = *n;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\/\/ Some models may not have\/need texcoords\n\t\t\t\tif (t != s.mesh.texcoords.end()){\n\t\t\t\t\tfor (int k = 6; k < 8; ++k, ++t){\n\t\t\t\t\t\tverts[i + k] = *t;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tvert_buf.unmap(GL_ARRAY_BUFFER);\n\t}\n\treturn true;\n}\nstd::ostream& operator<<(std::ostream &os, const glt::ModelInfo &m){\n\tos << \"glt::ModelInfo:\"\n\t\t<< \"\\n\\tindex_offset: \" << m.index_offset\n\t\t<< \"\\n\\tindices: \" << m.indices\n\t\t<< \"\\n\\tvert_offset: \" << m.vert_offset\n\t\t<< \"\\n--------\\n\";\n\treturn os;\n}\n\n<|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 <assert.h>\n#include <stdio.h>\n#include <math.h>\n#include <string.h>\n#include <stdlib.h>\n#include <iostream>\n#include \"GrayCode.h\"\n\nusing namespace std;\n\nGrayCode::GrayCode(const unsigned iwidth, const unsigned iheight ):\n    width(iwidth), height(iheight), totalGrayCodes(0), codedImages(NULL),stage(0),\n    decodedColumns(iwidth, iheight), decodedRows(iwidth, iheight)\n{\n    \/\/ Work out how many patterns are needed for the\n    \/\/ specified rows and columns. Since we are trying to\n    \/\/ encode a binary sequence, this is: count = log2(x)\n    \/\/ where x is the width or the height - depending if we\n    \/\/ are encoding columns or rows. We also have to cater\n    \/\/ for rounding in c hence we ceil to the next\n    \/\/ highest value then cast the value to get count;\n    this->grayCodeColumnCount = (unsigned)ceil(log2(this->width));\n    this->grayCodeRowCount = (unsigned)ceil(log2(this->height));\n\n    \/\/ When considering the columns and the rows we also have to consider\n    \/\/ that the width\/height is not an exact factor of 2 (ie 800 pixels).\n    \/\/ Hence we may have to shift the phase of a binary image so that\n    \/\/ the binary bands line up correctly.\n    this->grayCodeColumnPhase = (unsigned)floor((pow(2.0,this->grayCodeColumnCount)-this->width)\/2);\n    this->grayCodeRowPhase = (unsigned)floor((pow(2.0,this->grayCodeRowCount)-this->height)\/2);\n\n    \/\/ Record the total amount of patterns required for\n    \/\/ both the columns and the rows, we also cater for the inverts and the\n    \/\/ initial images\n    this->totalGrayCodes = ((this->grayCodeColumnCount + this->grayCodeRowCount) * 2) +4;\n\n    \/\/ Create the data storage for the patterns.\n    this->createStorage();\n\n    \/\/ Build the various images required for graycode displaying\n    this->buildGrayCodes();\n\n    \/\/ zero the decode matrixes\n    this->decodedColumns.storeZeros();\n    this->decodedRows.storeZeros();\n};\n\n\nGrayCode::~GrayCode()\n{\n    if( this->codedImages ){\n\tfor( unsigned i = 0; i <  this->totalGrayCodes; i++ )\n\t    delete this->codedImages[i];\n\n\tdelete this->codedImages;\n    }\n}\n\nbool GrayCode::next()\n{\n    this->stage++;\n    if( this->stage >= this->totalGrayCodes){\n\tthis->stage=0;\n\treturn false;\n    }\n\n    return true;\n}\n\nconst unsigned char *GrayCode::generate()\n{\n    return this->codedImages[this->stage];\n}\n\nvoid GrayCode::buildGrayCodes()\n{\n    \/\/\n    \/\/ Build the required gray code images.\n    \/\/ When building the images we build both the initial image and\n    \/\/ the image invert to aid in detection\n    \/\/\n\n    \/\/ The first two images are the most sigificant bit and full black\/white\n    \/\/ this allows us to work out the region the graycodes are projected onto\n    \/\/ We set the initial pattern here we calculate all inverts below\n    unsigned char **codedColumnImages = this->codedImages;\n    memset( *codedColumnImages, 255, this->width * this->height );\n    codedColumnImages+=2;\n\n    \/\/ We start by building the graycoded columns.\n    for(unsigned column = 0; column < this->width; column++ ) {\n\tfor ( unsigned imageCount = 0; imageCount < this->grayCodeColumnCount; imageCount++ ){\n\n\t    unsigned char *data = codedColumnImages[imageCount*2];\n\n\t    \/\/\n\t    \/\/ Work out the value for this column\n\t    \/\/\n\n\t    \/\/ Binary encoding. Put basically, a particular column over\n\t    \/\/ grayCodeColumnCount images represents a binary number. What\n\t    \/\/ we do here is work out what bit value that number is for this\n\t    \/\/ particular (imageCount) image. Ie the number for column 0 is\n\t    \/\/ always 0..n  where n is grayCodeColumnCount long. Column 1 always\n\t    \/\/ equates to 1 in binary. Hence in image 0 column 1 is black. In\n\t    \/\/ image grayCodeColumnCount column 1 is white.\n\t    \/\/\n\t    \/\/ To work what colour (white\/black) a column should be in this particular image\n\t    \/\/ we need to work out the bit value for this image. Hence if column =10\n\t    \/\/ which is binary n-4..1010 and we're in the second to last image the\n\t    \/\/ column must be white. To calculate colour we bitshift the column\n\t    \/\/ count (ie the value for the column) by the imagecount we are in.\n\t    \/\/ This shifts the bit we care about down to the least significant\n\t    \/\/ bit. We can simply test it using a bit comparison against 1 to\n\t    \/\/ then see if we need to be white or black.\n\t    \/\/ Now the only issue with this is we work from least significant\n\t    \/\/ bit up to most siginificate bit. This makes decoding the number\n\t    \/\/ harder. Hence instead we shift by grayCodeColumnCount-imageCount.\n\t    \/\/ This then works from most significant bit down to least\n\t    \/\/ significant bit which makes deciding easier.\n\t    \/\/\n\t    \/\/ We also take into account that the width and the height of an\n\t    \/\/ image is not a power of two. Hence we offset each column\/row by the\n\t    \/\/ relevant phase shift to align the graycodes correctly.\n\t    \/\/unsigned char value  = (column+this->grayCodeColumnPhase) >> (this->grayCodeColumnCount - imageCount -1) & 1;\n\t    unsigned char value  = ((column) >> (this->grayCodeColumnCount - imageCount -1)) & 1;\n\n\t    \/\/ We now update the value of the column to be in the range 0\n\t    \/\/ (black) or 255 (white). As this is what GL expects for a texture\n\t    value *=255;\n\n\t    \/\/ Store the value in the image\n\t    this->setPixel(data,column,0 \/* y *\/, value);\n\n\t    \/\/ Copy the value down for all rows of the image.\n\t    \/\/ after this the entire column for this image is set\n\t    for( unsigned row = 1; row < this->height; row++ )\n\t\tthis->setPixel(data,column,row, value);\n\t}\n    }\n\n    \/\/\n    \/\/ We now repeat the above setup but focus on the rows not\n    \/\/ the columns\n    \/\/\n    unsigned char **codedRowImages= codedColumnImages+(this->grayCodeColumnCount*2);\n    memset( *codedRowImages, 255, this->width * this->height );\n    codedRowImages+=2;\n\n    for( unsigned row=0; row < this->height; row++){\n\tfor ( unsigned imageCount = 0; imageCount < this->grayCodeRowCount; imageCount++ ){\n\t    unsigned char *data = codedRowImages[imageCount*2];\n\t    \/\/unsigned char value  = (toGrayCode(row+this->grayCodeRowPhase)) >> (this->grayCodeRowCount - imageCount -1) & 1;\n\t    \/\/unsigned char value  = (toGrayCode(row)) >> (this->grayCodeRowCount - imageCount -1) & 1;\n\t    unsigned char value  = (row) >> (this->grayCodeRowCount - imageCount -1) & 1;\n\t    value *=255;\n\t    this->setPixel(data,0 \/* X *\/,row, value);\n\t    for( unsigned column = 1; column < this->width; column++ )\n\t\tthis->setPixel(data,column,row, value);\n\t}\n    }\n\n    \/\/\n    \/\/ Now create the invert images for each pattern\n    \/\/\n    for( unsigned count = 0; count < this->totalGrayCodes; count+=2 ){\n\t    for( unsigned row = 0; row < this->height; row++ ){\n\t\tfor( unsigned column = 0; column < this->width; column++ ){\n\t\tthis->codedImages[count+1][row*this->width+column] =\n\t\t    this->codedImages[count][row*this->width+column] ? 0 : 255;\n\t    }\n\t}\n    }\n}\n\n\/**\n * Create the memory required for all the required gray code images\n *\/\nvoid GrayCode::createStorage()\n{\n    this->codedImages = new unsigned char *[this->totalGrayCodes];\n    for( unsigned i = 0; i < this->totalGrayCodes; i++ )\n\tthis->codedImages[i] = new unsigned char [this->width * this->height];\n}\n\nvoid GrayCode::setPixel(unsigned char *data, const unsigned x, const unsigned y, const unsigned char colour )\n{\n    assert(x < this->width && \"Column out of bounds\" );\n    assert(y < this->height && \"Row out of bounds\");\n\n    data[(y*this->width)+x]= colour;\n}\n\n\/**\n * Given a camera coo\n *\/\nwcl::Vector GrayCode::getRowCol(const wcl::Vector &input) const\n{\n    wcl::Vector v(2);\n\n    int col = input[0];\n    int row = input[1];\n\n    \/\/ Search the row\/column matrixes for the input pixel values\n    v[0] = this->decodedColumns[col][row];\n    v[1] = this->decodedRows[col][row];\n\n    return v;\n}\n\n\nunsigned int GrayCode::fromGrayCode(const unsigned value)\n{\n    unsigned int temp = value ^ (value>>8);\n    temp ^= (temp>>4);\n    temp ^= (temp>>2);\n    temp ^= (temp>>1);\n    return temp;\n}\n\nunsigned int GrayCode::toGrayCode(const unsigned value)\n{\n    return ( value >> 1 ) ^ (value);\n}\n\n\n\/**\n * Given the correct amount of images, decode the structured light sequence.\n * Note the images are expected to be in 8 bit grayscale.\n *\n * @param capturedImages the images captured for each structured light sequence\n *\/\nvoid GrayCode::decode(const unsigned char **capturedImages)\n{\n    \/\/ First we separate the rows from the columns;\n    const unsigned char **columnImages = capturedImages;\n    const unsigned char **rowImages = columnImages+(this->grayCodeColumnCount*2)+2;\n\n    \/\/ We now begin the process of decoding the images back into the relevant\n    \/\/ graycodes. The decoding works as follows. When capturing the graycodes\n    \/\/ we generated both the gray code image and the image invert. By looking\n    \/\/ at the difference between these two images we find what the bit is at\n    \/\/ each pixel of the imagepair. For pixels that are not part of the\n    \/\/ projected image they get assigned a bit value of zero. Ie all undetected\n    \/\/ pixels are 0.\n    columnImages+=2;\n    for(unsigned columnCount = 0; columnCount < this->grayCodeColumnCount; columnCount++, columnImages+=2){\n\n\t\/\/ Obtain pointers to the gray code image and the image invert\n\tconst unsigned char *gray    = columnImages[0];\n\tconst unsigned char *invgray = columnImages[1];\n\n\t\/\/ Now decode each pixel of the image pair.\n\tfor( unsigned y = 0; y < this->height; y++ ){\n\t    for( unsigned x = 0; x < this->width; x++ ){\n\n\t\tunsigned offset = (this->width * y) + x;\n\n\t\t\/\/ Find the bit value for this pixel in the image\n\t\tbool bitvalue = gray[offset] >= invgray[offset];\n\n\t\t\/\/ Store the value of this bit in decoded matrix at the correct\n\t\t\/\/ location. The columnCount indicates the significance of the\n\t\t\/\/ bit in the number.\n\t\tint bit = this->grayCodeColumnCount - columnCount - 1;\n\t\tif( bitvalue ){\n\t\t    int value = (int)this->decodedColumns[x][y];\n\t\t    value |= 1 << bit;\n\t\t    this->decodedColumns[x][y] = value;\n\t\t}\n\t    }\n\t}\n    }\n\n    \/\/ Repeat for rows\n    rowImages+=2;\n    for(unsigned rowCount = 0; rowCount < this->grayCodeRowCount; rowCount++,rowImages+=2){\n\n\t\/\/ Obtain pointers to the gray code image and the image invert\n\tconst unsigned char *gray    = rowImages[0];\n\tconst unsigned char *invgray = rowImages[1];\n\n\t\/\/ Now decode each pixel of the image pair.\n\tfor( unsigned y = 0; y < this->height; y++ ){\n\t    for( unsigned x = 0; x < this->width; x++ ){\n\n\t\tunsigned offset = (this->width * y) + x;\n\t\tbool bitvalue = gray[offset] >= invgray[offset];\n\t\tint bit = this->grayCodeRowCount - rowCount - 1;\n\t\tif( bitvalue ){\n\t\t    int value = (int)this->decodedRows[x][y];\n\t\t    value |= 1 << bit;\n\t\t    this->decodedRows[x][y] = value;\n\t\t}\n\t    }\n\t}\n    }\n    \/\/ Each stored value in the matrixes are gray coded still. We now\n    \/\/ convert the values back to binary. At the same time we filter to make\n    \/\/ sure the values are within range of what they should be (ie width or\n    \/\/ height of the original graycode)\n    for(unsigned y=0; y < this->height; y++ ){\n\tfor(unsigned x=0; x < this->width; x++){\n\t    \/\/this->decodedRows[x][y] = fromGrayCode((unsigned) this->decodedRows[x][y]);\n\t    \/\/this->decodedColumns[x][y] = fromGrayCode((unsigned) this->decodedColumns[x][y]);\n\t    if( this->decodedRows[x][y] > this->height )\n\t\tthis->decodedRows[x][y] = 0.0;\n\t    if( this->decodedColumns[x][y] > this->width )\n\t\tthis->decodedRows[x][y] = 0.0;\n\t}\n    }\n}\n\nunsigned GrayCode::getRequiredImageCount() const\n{\n    return this->totalGrayCodes;\n}\n\n\nvoid GrayCode::reset()\n{\n    this->decodedColumns.storeZeros();\n    this->decodedRows.storeZeros();\n}\n\nconst unsigned char *GrayCode::getDebugImage()\n{\n    static unsigned char *buffer = new unsigned char[this->width*this->height];\n\n\n    \/\/ Display the values of the detection in the rgb image\n    for(unsigned y = 0; y < this->height; y++ ){\n\tfor(unsigned x = 0; x < this->width; x++){\n\t    this->setPixel(buffer, x, y, (int)(((this->decodedColumns[x][y] \/ (float)this->width)) * 255.0));\n\t}\n    }\n\n    return buffer;\n}\n\nconst unsigned char **GrayCode::getCodedImages()\n{\n    return (const unsigned char **)this->codedImages;\n}\n<commit_msg>Reinstate the phase shift now we've fixed the decode loop bug<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 <assert.h>\n#include <stdio.h>\n#include <math.h>\n#include <string.h>\n#include <stdlib.h>\n#include <iostream>\n#include \"GrayCode.h\"\n\nusing namespace std;\n\nGrayCode::GrayCode(const unsigned iwidth, const unsigned iheight ):\n    width(iwidth), height(iheight), totalGrayCodes(0), codedImages(NULL),stage(0),\n    decodedColumns(iwidth, iheight), decodedRows(iwidth, iheight)\n{\n    \/\/ Work out how many patterns are needed for the\n    \/\/ specified rows and columns. Since we are trying to\n    \/\/ encode a binary sequence, this is: count = log2(x)\n    \/\/ where x is the width or the height - depending if we\n    \/\/ are encoding columns or rows. We also have to cater\n    \/\/ for rounding in c hence we ceil to the next\n    \/\/ highest value then cast the value to get count;\n    this->grayCodeColumnCount = (unsigned)ceil(log2(this->width));\n    this->grayCodeRowCount = (unsigned)ceil(log2(this->height));\n\n    \/\/ When considering the columns and the rows we also have to consider\n    \/\/ that the width\/height is not an exact factor of 2 (ie 800 pixels).\n    \/\/ Hence we may have to shift the phase of a binary image so that\n    \/\/ the binary bands line up correctly.\n    this->grayCodeColumnPhase = (unsigned)floor((pow(2.0,this->grayCodeColumnCount)-this->width)\/2);\n    this->grayCodeRowPhase = (unsigned)floor((pow(2.0,this->grayCodeRowCount)-this->height)\/2);\n\n    \/\/ Record the total amount of patterns required for\n    \/\/ both the columns and the rows, we also cater for the inverts and the\n    \/\/ initial images\n    this->totalGrayCodes = ((this->grayCodeColumnCount + this->grayCodeRowCount) * 2) +4;\n\n    \/\/ Create the data storage for the patterns.\n    this->createStorage();\n\n    \/\/ Build the various images required for graycode displaying\n    this->buildGrayCodes();\n\n    \/\/ zero the decode matrixes\n    this->decodedColumns.storeZeros();\n    this->decodedRows.storeZeros();\n};\n\n\nGrayCode::~GrayCode()\n{\n    if( this->codedImages ){\n\tfor( unsigned i = 0; i <  this->totalGrayCodes; i++ )\n\t    delete this->codedImages[i];\n\n\tdelete this->codedImages;\n    }\n}\n\nbool GrayCode::next()\n{\n    this->stage++;\n    if( this->stage >= this->totalGrayCodes){\n\tthis->stage=0;\n\treturn false;\n    }\n\n    return true;\n}\n\nconst unsigned char *GrayCode::generate()\n{\n    return this->codedImages[this->stage];\n}\n\nvoid GrayCode::buildGrayCodes()\n{\n    \/\/\n    \/\/ Build the required gray code images.\n    \/\/ When building the images we build both the initial image and\n    \/\/ the image invert to aid in detection\n    \/\/\n\n    \/\/ The first two images are the most sigificant bit and full black\/white\n    \/\/ this allows us to work out the region the graycodes are projected onto\n    \/\/ We set the initial pattern here we calculate all inverts below\n    unsigned char **codedColumnImages = this->codedImages;\n    memset( *codedColumnImages, 255, this->width * this->height );\n    codedColumnImages+=2;\n\n    \/\/ We start by building the graycoded columns.\n    for(unsigned column = 0; column < this->width; column++ ) {\n\tfor ( unsigned imageCount = 0; imageCount < this->grayCodeColumnCount; imageCount++ ){\n\n\t    unsigned char *data = codedColumnImages[imageCount*2];\n\n\t    \/\/\n\t    \/\/ Work out the value for this column\n\t    \/\/\n\n\t    \/\/ Binary encoding. Put basically, a particular column over\n\t    \/\/ grayCodeColumnCount images represents a binary number. What\n\t    \/\/ we do here is work out what bit value that number is for this\n\t    \/\/ particular (imageCount) image. Ie the number for column 0 is\n\t    \/\/ always 0..n  where n is grayCodeColumnCount long. Column 1 always\n\t    \/\/ equates to 1 in binary. Hence in image 0 column 1 is black. In\n\t    \/\/ image grayCodeColumnCount column 1 is white.\n\t    \/\/\n\t    \/\/ To work what colour (white\/black) a column should be in this particular image\n\t    \/\/ we need to work out the bit value for this image. Hence if column =10\n\t    \/\/ which is binary n-4..1010 and we're in the second to last image the\n\t    \/\/ column must be white. To calculate colour we bitshift the column\n\t    \/\/ count (ie the value for the column) by the imagecount we are in.\n\t    \/\/ This shifts the bit we care about down to the least significant\n\t    \/\/ bit. We can simply test it using a bit comparison against 1 to\n\t    \/\/ then see if we need to be white or black.\n\t    \/\/ Now the only issue with this is we work from least significant\n\t    \/\/ bit up to most siginificate bit. This makes decoding the number\n\t    \/\/ harder. Hence instead we shift by grayCodeColumnCount-imageCount.\n\t    \/\/ This then works from most significant bit down to least\n\t    \/\/ significant bit which makes deciding easier.\n\t    \/\/\n\t    \/\/ We also take into account that the width and the height of an\n\t    \/\/ image is not a power of two. Hence we offset each column\/row by the\n\t    \/\/ relevant phase shift to align the graycodes correctly.\n\t    unsigned char value  = (column+this->grayCodeColumnPhase) >> (this->grayCodeColumnCount - imageCount -1) & 1;\n\n\t    \/\/ We now update the value of the column to be in the range 0\n\t    \/\/ (black) or 255 (white). As this is what GL expects for a texture\n\t    value *=255;\n\n\t    \/\/ Store the value in the image\n\t    this->setPixel(data,column,0 \/* y *\/, value);\n\n\t    \/\/ Copy the value down for all rows of the image.\n\t    \/\/ after this the entire column for this image is set\n\t    for( unsigned row = 1; row < this->height; row++ )\n\t\tthis->setPixel(data,column,row, value);\n\t}\n    }\n\n    \/\/\n    \/\/ We now repeat the above setup but focus on the rows not\n    \/\/ the columns\n    \/\/\n    unsigned char **codedRowImages= codedColumnImages+(this->grayCodeColumnCount*2);\n    memset( *codedRowImages, 255, this->width * this->height );\n    codedRowImages+=2;\n\n    for( unsigned row=0; row < this->height; row++){\n\tfor ( unsigned imageCount = 0; imageCount < this->grayCodeRowCount; imageCount++ ){\n\t    unsigned char *data = codedRowImages[imageCount*2];\n\t    unsigned char value  = (row+this->grayCodeRowPhase) >> (this->grayCodeRowCount - imageCount -1) & 1;\n\t    value *=255;\n\t    this->setPixel(data,0 \/* X *\/,row, value);\n\t    for( unsigned column = 1; column < this->width; column++ )\n\t\tthis->setPixel(data,column,row, value);\n\t}\n    }\n\n    \/\/\n    \/\/ Now create the invert images for each pattern\n    \/\/\n    for( unsigned count = 0; count < this->totalGrayCodes; count+=2 ){\n\t    for( unsigned row = 0; row < this->height; row++ ){\n\t\tfor( unsigned column = 0; column < this->width; column++ ){\n\t\tthis->codedImages[count+1][row*this->width+column] =\n\t\t    this->codedImages[count][row*this->width+column] ? 0 : 255;\n\t    }\n\t}\n    }\n}\n\n\/**\n * Create the memory required for all the required gray code images\n *\/\nvoid GrayCode::createStorage()\n{\n    this->codedImages = new unsigned char *[this->totalGrayCodes];\n    for( unsigned i = 0; i < this->totalGrayCodes; i++ )\n\tthis->codedImages[i] = new unsigned char [this->width * this->height];\n}\n\nvoid GrayCode::setPixel(unsigned char *data, const unsigned x, const unsigned y, const unsigned char colour )\n{\n    assert(x < this->width && \"Column out of bounds\" );\n    assert(y < this->height && \"Row out of bounds\");\n\n    data[(y*this->width)+x]= colour;\n}\n\n\/**\n * Given a camera coo\n *\/\nwcl::Vector GrayCode::getRowCol(const wcl::Vector &input) const\n{\n    wcl::Vector v(2);\n\n    int col = input[0];\n    int row = input[1];\n\n    \/\/ Search the row\/column matrixes for the input pixel values\n    v[0] = this->decodedColumns[col][row];\n    v[1] = this->decodedRows[col][row];\n\n    return v;\n}\n\n\nunsigned int GrayCode::fromGrayCode(const unsigned value)\n{\n    unsigned int temp = value ^ (value>>8);\n    temp ^= (temp>>4);\n    temp ^= (temp>>2);\n    temp ^= (temp>>1);\n    return temp;\n}\n\nunsigned int GrayCode::toGrayCode(const unsigned value)\n{\n    return ( value >> 1 ) ^ (value);\n}\n\n\n\/**\n * Given the correct amount of images, decode the structured light sequence.\n * Note the images are expected to be in 8 bit grayscale.\n *\n * @param capturedImages the images captured for each structured light sequence\n *\/\nvoid GrayCode::decode(const unsigned char **capturedImages)\n{\n    \/\/ First we separate the rows from the columns;\n    const unsigned char **columnImages = capturedImages;\n    const unsigned char **rowImages = columnImages+(this->grayCodeColumnCount*2)+2;\n\n    \/\/ We now begin the process of decoding the images back into the relevant\n    \/\/ graycodes. The decoding works as follows. When capturing the graycodes\n    \/\/ we generated both the gray code image and the image invert. By looking\n    \/\/ at the difference between these two images we find what the bit is at\n    \/\/ each pixel of the imagepair. For pixels that are not part of the\n    \/\/ projected image they get assigned a bit value of zero. Ie all undetected\n    \/\/ pixels are 0.\n    columnImages+=2;\n    for(unsigned columnCount = 0; columnCount < this->grayCodeColumnCount; columnCount++, columnImages+=2){\n\n\t\/\/ Obtain pointers to the gray code image and the image invert\n\tconst unsigned char *gray    = columnImages[0];\n\tconst unsigned char *invgray = columnImages[1];\n\n\t\/\/ Now decode each pixel of the image pair.\n\tfor( unsigned y = 0; y < this->height; y++ ){\n\t    for( unsigned x = 0; x < this->width; x++ ){\n\n\t\tunsigned offset = (this->width * y) + x;\n\n\t\t\/\/ Find the bit value for this pixel in the image\n\t\tbool bitvalue = gray[offset] >= invgray[offset];\n\n\t\t\/\/ Store the value of this bit in decoded matrix at the correct\n\t\t\/\/ location. The columnCount indicates the significance of the\n\t\t\/\/ bit in the number.\n\t\tint bit = this->grayCodeColumnCount - columnCount - 1;\n\t\tif( bitvalue ){\n\t\t    int value = (int)this->decodedColumns[x][y];\n\t\t    value |= 1 << bit;\n\t\t    this->decodedColumns[x][y] = value;\n\t\t}\n\t    }\n\t}\n    }\n\n    \/\/ Repeat for rows\n    rowImages+=2;\n    for(unsigned rowCount = 0; rowCount < this->grayCodeRowCount; rowCount++,rowImages+=2){\n\n\t\/\/ Obtain pointers to the gray code image and the image invert\n\tconst unsigned char *gray    = rowImages[0];\n\tconst unsigned char *invgray = rowImages[1];\n\n\t\/\/ Now decode each pixel of the image pair.\n\tfor( unsigned y = 0; y < this->height; y++ ){\n\t    for( unsigned x = 0; x < this->width; x++ ){\n\n\t\tunsigned offset = (this->width * y) + x;\n\t\tbool bitvalue = gray[offset] >= invgray[offset];\n\t\tint bit = this->grayCodeRowCount - rowCount - 1;\n\t\tif( bitvalue ){\n\t\t    int value = (int)this->decodedRows[x][y];\n\t\t    value |= 1 << bit;\n\t\t    this->decodedRows[x][y] = value;\n\t\t}\n\t    }\n\t}\n    }\n    \/\/ Each stored value in the matrixes are gray coded still. We now\n    \/\/ convert the values back to binary. At the same time we filter to make\n    \/\/ sure the values are within range of what they should be (ie width or\n    \/\/ height of the original graycode)\n    for(unsigned y=0; y < this->height; y++ ){\n\tfor(unsigned x=0; x < this->width; x++){\n\t    this->decodedRows[x][y] -= this->grayCodeRowPhase;\n\t    this->decodedColumns[x][y] -= this->grayCodeColumnPhase;\n\t    \/\/this->decodedRows[x][y] = fromGrayCode((unsigned) this->decodedRows[x][y]);\n\t    \/\/this->decodedColumns[x][y] = fromGrayCode((unsigned) this->decodedColumns[x][y]);\n\t    if( this->decodedRows[x][y] > this->height )\n\t\tthis->decodedRows[x][y] = 0.0;\n\t    if( this->decodedColumns[x][y] > this->width )\n\t\tthis->decodedRows[x][y] = 0.0;\n\t}\n    }\n}\n\nunsigned GrayCode::getRequiredImageCount() const\n{\n    return this->totalGrayCodes;\n}\n\n\nvoid GrayCode::reset()\n{\n    this->decodedColumns.storeZeros();\n    this->decodedRows.storeZeros();\n}\n\nconst unsigned char *GrayCode::getDebugImage()\n{\n    static unsigned char *buffer = new unsigned char[this->width*this->height];\n\n\n    \/\/ Display the values of the detection in the rgb image\n    for(unsigned y = 0; y < this->height; y++ ){\n\tfor(unsigned x = 0; x < this->width; x++){\n\t    this->setPixel(buffer, x, y, (int)(((this->decodedColumns[x][y] \/ (float)this->width)) * 255.0));\n\t}\n    }\n\n    return buffer;\n}\n\nconst unsigned char **GrayCode::getCodedImages()\n{\n    return (const unsigned char **)this->codedImages;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\r\n * \\file\r\n * \\brief RoundRobinQuantum class header\r\n *\r\n * \\author Copyright (C) 2014 Kamil Szczygiel http:\/\/www.distortec.com http:\/\/www.freddiechopin.info\r\n *\r\n * \\par License\r\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\r\n * distributed with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\r\n *\r\n * \\date 2014-09-16\r\n *\/\r\n\r\n#ifndef INCLUDE_DISTORTOS_SCHEDULER_ROUNDROBINQUANTUM_HPP_\r\n#define INCLUDE_DISTORTOS_SCHEDULER_ROUNDROBINQUANTUM_HPP_\r\n\r\n#include \"distortos\/scheduler\/TickClock.hpp\"\r\n\r\nnamespace distortos\r\n{\r\n\r\nnamespace scheduler\r\n{\r\n\r\n\/\/\/ RoundRobinQuantum class is a quantum of time for round-robin scheduling\r\nclass RoundRobinQuantum\r\n{\r\npublic:\r\n\r\n\t\/\/\/ type of quantum counter\r\n\tusing Representation = uint8_t;\r\n\r\n\t\/\/\/ duration type used for quantum\r\n\tusing Duration = std::chrono::duration<Representation, TickClock::period>;\r\n\r\n\t\/**\r\n\t * \\brief RoundRobinQuantum's constructor\r\n\t *\r\n\t * Initializes quantum value to 0.\r\n\t *\/\r\n\r\n\tconstexpr RoundRobinQuantum() :\r\n\t\t\tquantum_{}\r\n\t{}\r\n\r\n\t\/**\r\n\t * \\brief Decrements round-robin's quantum.\r\n\t *\r\n\t * This function should be called from tick interrupt for the currently running thread. Underflow of quantum after\r\n\t * this decrement is not possible.\r\n\t *\r\n\t * \\note this function must be called with enabled interrupt masking\r\n\t *\/\r\n\r\n\tvoid decrement()\r\n\t{\r\n\t\tif (isZero() == false)\r\n\t\t\t--quantum_;\r\n\t}\r\n\r\n\t\/**\r\n\t * \\brief Gets current value of round-robin's quantum.\r\n\t *\r\n\t * \\return current value of round-robin's quantum of the thread\r\n\t *\/\r\n\r\n\tDuration get() const { return quantum_; }\r\n\r\n\t\/**\r\n\t * \\brief Convenience function to test whether the quantum is already at 0.\r\n\t *\r\n\t * \\return true if quantum is zero, false otherwise\r\n\t *\/\r\n\r\n\tbool isZero() const\r\n\t{\r\n\t\treturn quantum_ == Duration{0};\r\n\t}\r\n\r\n\t\/**\r\n\t * \\brief Resets value of round-robin's quantum.\r\n\t *\r\n\t * This function should be called from context switcher after selecting new task that will be run.\r\n\t *\/\r\n\r\n\tvoid reset()\r\n\t{\r\n\t\tquantum_ = Duration{quantumRawInitializer_};\r\n\t}\r\n\r\nprivate:\r\n\r\n\tstatic_assert(CONFIG_TICK_RATE_HZ > 0, \"CONFIG_TICK_RATE_HZ must be positive and non-zero!\");\r\n\tstatic_assert(CONFIG_ROUND_ROBIN_RATE_HZ > 0, \"CONFIG_ROUND_ROBIN_RATE_HZ must be positive and non-zero!\");\r\n\r\n\t\/\/\/ raw initializer value for round-robin quantum, calculated with rounding to nearest\r\n\tconstexpr static auto quantumRawInitializer_ = (CONFIG_TICK_RATE_HZ + CONFIG_ROUND_ROBIN_RATE_HZ \/ 2) \/\r\n\t\t\tCONFIG_ROUND_ROBIN_RATE_HZ;\r\n\r\n\tstatic_assert(quantumRawInitializer_ > 0 || quantumRawInitializer_ <= UINT8_MAX,\r\n\t\t\t\"CONFIG_TICK_RATE_HZ and CONFIG_ROUND_ROBIN_RATE_HZ values produce invalid round-robin quantum!\");\r\n\r\n\t\/\/\/ round-robin quantum\r\n\tDuration quantum_;\r\n};\r\n\r\n}\t\/\/ namespace scheduler\r\n\r\n}\t\/\/ namespace distortos\r\n\r\n#endif\t\/\/ INCLUDE_DISTORTOS_SCHEDULER_ROUNDROBINQUANTUM_HPP_\r\n<commit_msg>RoundRobinQuantum: set initial value of quantum in constructor<commit_after>\/**\r\n * \\file\r\n * \\brief RoundRobinQuantum class header\r\n *\r\n * \\author Copyright (C) 2014 Kamil Szczygiel http:\/\/www.distortec.com http:\/\/www.freddiechopin.info\r\n *\r\n * \\par License\r\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\r\n * distributed with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\r\n *\r\n * \\date 2014-09-16\r\n *\/\r\n\r\n#ifndef INCLUDE_DISTORTOS_SCHEDULER_ROUNDROBINQUANTUM_HPP_\r\n#define INCLUDE_DISTORTOS_SCHEDULER_ROUNDROBINQUANTUM_HPP_\r\n\r\n#include \"distortos\/scheduler\/TickClock.hpp\"\r\n\r\nnamespace distortos\r\n{\r\n\r\nnamespace scheduler\r\n{\r\n\r\n\/\/\/ RoundRobinQuantum class is a quantum of time for round-robin scheduling\r\nclass RoundRobinQuantum\r\n{\r\npublic:\r\n\r\n\t\/\/\/ type of quantum counter\r\n\tusing Representation = uint8_t;\r\n\r\n\t\/\/\/ duration type used for quantum\r\n\tusing Duration = std::chrono::duration<Representation, TickClock::period>;\r\n\r\n\t\/**\r\n\t * \\brief RoundRobinQuantum's constructor\r\n\t *\r\n\t * Initializes quantum value to initial value - just like after call to reset().\r\n\t *\/\r\n\r\n\tconstexpr RoundRobinQuantum() :\r\n\t\t\tquantum_{quantumRawInitializer_}\r\n\t{}\r\n\r\n\t\/**\r\n\t * \\brief Decrements round-robin's quantum.\r\n\t *\r\n\t * This function should be called from tick interrupt for the currently running thread. Underflow of quantum after\r\n\t * this decrement is not possible.\r\n\t *\r\n\t * \\note this function must be called with enabled interrupt masking\r\n\t *\/\r\n\r\n\tvoid decrement()\r\n\t{\r\n\t\tif (isZero() == false)\r\n\t\t\t--quantum_;\r\n\t}\r\n\r\n\t\/**\r\n\t * \\brief Gets current value of round-robin's quantum.\r\n\t *\r\n\t * \\return current value of round-robin's quantum of the thread\r\n\t *\/\r\n\r\n\tDuration get() const { return quantum_; }\r\n\r\n\t\/**\r\n\t * \\brief Convenience function to test whether the quantum is already at 0.\r\n\t *\r\n\t * \\return true if quantum is zero, false otherwise\r\n\t *\/\r\n\r\n\tbool isZero() const\r\n\t{\r\n\t\treturn quantum_ == Duration{0};\r\n\t}\r\n\r\n\t\/**\r\n\t * \\brief Resets value of round-robin's quantum.\r\n\t *\r\n\t * This function should be called from context switcher after selecting new task that will be run.\r\n\t *\/\r\n\r\n\tvoid reset()\r\n\t{\r\n\t\tquantum_ = Duration{quantumRawInitializer_};\r\n\t}\r\n\r\nprivate:\r\n\r\n\tstatic_assert(CONFIG_TICK_RATE_HZ > 0, \"CONFIG_TICK_RATE_HZ must be positive and non-zero!\");\r\n\tstatic_assert(CONFIG_ROUND_ROBIN_RATE_HZ > 0, \"CONFIG_ROUND_ROBIN_RATE_HZ must be positive and non-zero!\");\r\n\r\n\t\/\/\/ raw initializer value for round-robin quantum, calculated with rounding to nearest\r\n\tconstexpr static auto quantumRawInitializer_ = (CONFIG_TICK_RATE_HZ + CONFIG_ROUND_ROBIN_RATE_HZ \/ 2) \/\r\n\t\t\tCONFIG_ROUND_ROBIN_RATE_HZ;\r\n\r\n\tstatic_assert(quantumRawInitializer_ > 0 || quantumRawInitializer_ <= UINT8_MAX,\r\n\t\t\t\"CONFIG_TICK_RATE_HZ and CONFIG_ROUND_ROBIN_RATE_HZ values produce invalid round-robin quantum!\");\r\n\r\n\t\/\/\/ round-robin quantum\r\n\tDuration quantum_;\r\n};\r\n\r\n}\t\/\/ namespace scheduler\r\n\r\n}\t\/\/ namespace distortos\r\n\r\n#endif\t\/\/ INCLUDE_DISTORTOS_SCHEDULER_ROUNDROBINQUANTUM_HPP_\r\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 Moments<typename FirstMomentOf<Variate>::Type>  MomentsInterface;\n    typedef typename MomentsInterface::Variate              Mean;\n    typedef typename MomentsInterface::SecondMoment         Covariance;\n\n    typedef Eigen::Array<Real,    Locations, 1> Function;\n    typedef Eigen::Array<Variate, Locations, 1> LocationArray;\n\n    typedef StandardGaussianMapping<Variate, 1> StdGaussianMapping;\n    typedef typename StdGaussianMapping::StandardVariate StandardVariate;\n\npublic:\n    \/\/\/ constructor and destructor *********************************************\n    explicit\n    DiscreteDistribution(int locations = MaxOf<Locations, 1>::value)\n    {\n        set_uniform(locations);\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 StandardVariate& gaussian_sample,\n                                        int& index) const\n    {\n        StandardVariate scaled_sample = gaussian_sample \/ std::sqrt(2.0);\n        StandardVariate uniform_sample = 0.5 * (1.0 + std::erf(scaled_sample));\n\n        return map_standard_uniform(uniform_sample, index);\n    }\n\n    virtual Variate map_standard_uniform(const StandardVariate& uniform_sample,\n                                         int& index) const\n    {\n        index = 0;\n        for (index = 0; index < cumul_distr_.size(); ++index)\n        {\n            if (cumul_distr_[index] >= uniform_sample) break;\n        }\n\n        return locations_[index];\n    }\n\n    using StdGaussianMapping::sample;\n\n    virtual Variate sample(int& index) const\n    {\n        return map_standard_normal(this->standard_gaussian_.sample(), index);\n    }\n\n    virtual Variate map_standard_normal(const StandardVariate& gaussian_sample) const\n    {\n        int index;\n        return map_standard_normal(gaussian_sample, index);\n    }\n\n    virtual Variate map_standard_uniform(const StandardVariate& uniform_sample) const\n    {\n        int index;\n        return map_standard_uniform(uniform_sample, index);\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 Variate& max() const\n    {\n        int max_index;\n        log_prob_mass_.maxCoeff(&max_index);\n\n        return locations_(max_index);\n    }\n\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    Function cumul_distr_;\n\n    mutable Mean mu_;\n    mutable Covariance cov_;\n};\n\n}\n\n#endif\n<commit_msg>minor<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 Moments<typename FirstMomentOf<Variate>::Type>  MomentsInterface;\n    typedef typename MomentsInterface::Variate              Mean;\n    typedef typename MomentsInterface::SecondMoment         Covariance;\n\n    typedef Eigen::Array<Real,    Locations, 1> Function;\n    typedef Eigen::Array<Variate, Locations, 1> LocationArray;\n\n    typedef StandardGaussianMapping<Variate, 1> StdGaussianMapping;\n    typedef typename StdGaussianMapping::StandardVariate StandardVariate;\n\npublic:\n    \/\/\/ constructor and destructor *********************************************\n    explicit\n    DiscreteDistribution(int size = MaxOf<Locations, 1>::value)\n    {\n        set_uniform(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 StandardVariate& gaussian_sample,\n                                        int& index) const\n    {\n        StandardVariate scaled_sample = gaussian_sample \/ std::sqrt(2.0);\n        StandardVariate uniform_sample = 0.5 * (1.0 + std::erf(scaled_sample));\n\n        return map_standard_uniform(uniform_sample, index);\n    }\n\n    virtual Variate map_standard_uniform(const StandardVariate& uniform_sample,\n                                         int& index) const\n    {\n        index = 0;\n        for (index = 0; index < cumul_distr_.size(); ++index)\n        {\n            if (cumul_distr_[index] >= uniform_sample) break;\n        }\n\n        return locations_[index];\n    }\n\n    using StdGaussianMapping::sample;\n\n    virtual Variate sample(int& index) const\n    {\n        return map_standard_normal(this->standard_gaussian_.sample(), index);\n    }\n\n    virtual Variate map_standard_normal(const StandardVariate& gaussian_sample) const\n    {\n        int index;\n        return map_standard_normal(gaussian_sample, index);\n    }\n\n    virtual Variate map_standard_uniform(const StandardVariate& uniform_sample) const\n    {\n        int index;\n        return map_standard_uniform(uniform_sample, index);\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 Variate& max() const\n    {\n        int max_index;\n        log_prob_mass_.maxCoeff(&max_index);\n\n        return locations_(max_index);\n    }\n\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    Function cumul_distr_;\n\n    mutable Mean mu_;\n    mutable Covariance cov_;\n};\n\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\n#ifndef __SERIALIZER_LOG_LBA_DISK_FORMAT__\n#define __SERIALIZER_LOG_LBA_DISK_FORMAT__\n\n\n\n#include \"serializer\/serializer.hpp\"\n\n\n\n\/\/ An off64_t with the highest bit saying that a block is deleted.\n\/\/ Deleted blocks still have an offset, since there's a zero block\n\/\/ sitting in place for them.  The remaining 63 bits give the offset\n\/\/ to the block (whether it is deleted or not).\nunion flagged_off64_t {\n    off64_t whole_value;\n    struct {\n        \/\/ The actual offset into the file.\n        off64_t value : 63;\n    \n        \/\/ This block id was deleted, and the offset points to a zeroed\n        \/\/ out buffer.\n        int is_delete : 1;\n    } parts;\n\n    static inline flagged_off64_t unused() {\n        flagged_off64_t ret;\n        ret.whole_value = -1;\n        return ret;\n    }\n\n    static inline flagged_off64_t padding() {\n        flagged_off64_t ret;\n        ret.whole_value = -1;\n        return ret;\n    }\n\n    static inline bool is_padding(flagged_off64_t offset) {\n        return offset.whole_value == -1;\n    }\n\n    static inline flagged_off64_t real(off64_t offset) {\n        flagged_off64_t ret;\n        ret.parts.value = offset;\n        ret.parts.is_delete = 0;\n        return ret;\n    }\n\n    static inline flagged_off64_t deleteblock(off64_t offset) {\n        flagged_off64_t ret;\n        ret.parts.value = offset;\n        ret.parts.is_delete = 1;\n        return ret;\n    }\n    \n    static bool has_value(flagged_off64_t offset) {\n        offset.parts.is_delete = 1;\n        return offset.whole_value != off64_t(-1);\n    }\n    \n    static inline bool can_be_gced(flagged_off64_t offset) {\n        return has_value(offset);\n    }\n};\n\n\n\nstruct lba_shard_metablock_t {\n    \/* Reference to the last lba extent (that's currently being\n     * written to). Once the extent is filled, the reference is\n     * moved to the lba superblock, and the next block gets a\n     * reference to the clean extent. *\/\n    off64_t last_lba_extent_offset;\n    int last_lba_extent_entries_count;\n\n    \/* Reference to the LBA superblock and its size *\/\n    off64_t lba_superblock_offset;\n    int lba_superblock_entries_count;\n};\n\nstruct lba_metablock_mixin_t {\n    \n    lba_shard_metablock_t shards[LBA_SHARD_FACTOR];\n};\n\n\n\n\n\/\/ PADDING_BLOCK_ID and flagged_off64_t::padding() indicate that an entry in the LBA list only exists to fill\n\/\/ out a DEVICE_BLOCK_SIZE-sized chunk of the extent.\n\n#define PADDING_BLOCK_ID (ser_block_id_t::make(-1))\n\nstruct lba_entry_t {\n    ser_block_id_t block_id;\n    uint32_t timestamp;  \/\/ reserved\n    \/\/ An offset into the file, with is_delete set appropriately.\n    flagged_off64_t offset;\n\n    static inline lba_entry_t make(ser_block_id_t block_id, flagged_off64_t offset) {\n        lba_entry_t entry;\n        entry.block_id = block_id;\n        entry.timestamp = 0;\n        entry.offset = offset;\n        return entry;\n    }\n\n    static inline bool is_padding(const lba_entry_t* entry) {\n        return entry->block_id == PADDING_BLOCK_ID  && flagged_off64_t::is_padding(entry->offset);\n    }\n\n    static inline lba_entry_t make_padding_entry() {\n        return make(PADDING_BLOCK_ID, flagged_off64_t::padding());\n    }\n} __attribute((__packed__));\n\n    \n    \n\n#define LBA_MAGIC_SIZE 8\nstatic const char lba_magic[LBA_MAGIC_SIZE] = {'l', 'b', 'a', 'm', 'a', 'g', 'i', 'c'};\n\nstruct lba_extent_t {\n    \/\/ Header needs to be padded to a multiple of sizeof(lba_entry_t)\n    struct header_t {\n        char magic[LBA_MAGIC_SIZE];\n        char padding[sizeof(lba_entry_t) - (1 + (sizeof(magic) - 1) % sizeof(lba_entry_t))];\n    } header;\n    lba_entry_t entries[0];\n};\n\n\n\nstruct lba_superblock_entry_t {\n    off64_t offset;\n    int lba_entries_count;\n};\n\n#define LBA_SUPER_MAGIC_SIZE 8\nstatic const char lba_super_magic[LBA_SUPER_MAGIC_SIZE] = {'l', 'b', 'a', 's', 'u', 'p', 'e', 'r'};\n\nstruct lba_superblock_t {\n    \/\/ Header needs to be padded to a multiple of sizeof(lba_superblock_entry_t)\n    char magic[LBA_SUPER_MAGIC_SIZE];\n    char padding[sizeof(lba_superblock_entry_t) - (1 + (sizeof(magic) - 1) % sizeof(lba_superblock_entry_t))];\n\n    \/* The superblock contains references to all the extents\n     * except the last. The reference to the last extent is\n     * maintained in the metablock. This is done in order to be\n     * able to store the number of entries in the last extent as\n     * it's being filled up without rewriting the superblock. *\/\n    lba_superblock_entry_t entries[0];\n\n    static int entry_count_to_file_size(int nentries) {\n        return sizeof(lba_superblock_entry_t) * nentries + offsetof(lba_superblock_t, entries[0]);\n    }\n};\n\n\n\n#endif \/* __SERIALIZER_LOG_LBA_DISK_FORMAT__ *\/\n\n<commit_msg>Used ser_block_id_t::null() for PADDING_BLOCK_ID.<commit_after>\n#ifndef __SERIALIZER_LOG_LBA_DISK_FORMAT__\n#define __SERIALIZER_LOG_LBA_DISK_FORMAT__\n\n\n\n#include \"serializer\/serializer.hpp\"\n\n\n\n\/\/ An off64_t with the highest bit saying that a block is deleted.\n\/\/ Deleted blocks still have an offset, since there's a zero block\n\/\/ sitting in place for them.  The remaining 63 bits give the offset\n\/\/ to the block (whether it is deleted or not).\nunion flagged_off64_t {\n    off64_t whole_value;\n    struct {\n        \/\/ The actual offset into the file.\n        off64_t value : 63;\n    \n        \/\/ This block id was deleted, and the offset points to a zeroed\n        \/\/ out buffer.\n        int is_delete : 1;\n    } parts;\n\n    static inline flagged_off64_t unused() {\n        flagged_off64_t ret;\n        ret.whole_value = -1;\n        return ret;\n    }\n\n    static inline flagged_off64_t padding() {\n        flagged_off64_t ret;\n        ret.whole_value = -1;\n        return ret;\n    }\n\n    static inline bool is_padding(flagged_off64_t offset) {\n        return offset.whole_value == -1;\n    }\n\n    static inline flagged_off64_t real(off64_t offset) {\n        flagged_off64_t ret;\n        ret.parts.value = offset;\n        ret.parts.is_delete = 0;\n        return ret;\n    }\n\n    static inline flagged_off64_t deleteblock(off64_t offset) {\n        flagged_off64_t ret;\n        ret.parts.value = offset;\n        ret.parts.is_delete = 1;\n        return ret;\n    }\n    \n    static bool has_value(flagged_off64_t offset) {\n        offset.parts.is_delete = 1;\n        return offset.whole_value != off64_t(-1);\n    }\n    \n    static inline bool can_be_gced(flagged_off64_t offset) {\n        return has_value(offset);\n    }\n};\n\n\n\nstruct lba_shard_metablock_t {\n    \/* Reference to the last lba extent (that's currently being\n     * written to). Once the extent is filled, the reference is\n     * moved to the lba superblock, and the next block gets a\n     * reference to the clean extent. *\/\n    off64_t last_lba_extent_offset;\n    int last_lba_extent_entries_count;\n\n    \/* Reference to the LBA superblock and its size *\/\n    off64_t lba_superblock_offset;\n    int lba_superblock_entries_count;\n};\n\nstruct lba_metablock_mixin_t {\n    \n    lba_shard_metablock_t shards[LBA_SHARD_FACTOR];\n};\n\n\n\n\n\/\/ PADDING_BLOCK_ID and flagged_off64_t::padding() indicate that an entry in the LBA list only exists to fill\n\/\/ out a DEVICE_BLOCK_SIZE-sized chunk of the extent.\n\nstatic const ser_block_id_t PADDING_BLOCK_ID = ser_block_id_t::null();\n\nstruct lba_entry_t {\n    ser_block_id_t block_id;\n    uint32_t timestamp;  \/\/ reserved\n    \/\/ An offset into the file, with is_delete set appropriately.\n    flagged_off64_t offset;\n\n    static inline lba_entry_t make(ser_block_id_t block_id, flagged_off64_t offset) {\n        lba_entry_t entry;\n        entry.block_id = block_id;\n        entry.timestamp = 0;\n        entry.offset = offset;\n        return entry;\n    }\n\n    static inline bool is_padding(const lba_entry_t* entry) {\n        return entry->block_id == PADDING_BLOCK_ID  && flagged_off64_t::is_padding(entry->offset);\n    }\n\n    static inline lba_entry_t make_padding_entry() {\n        return make(PADDING_BLOCK_ID, flagged_off64_t::padding());\n    }\n} __attribute((__packed__));\n\n    \n    \n\n#define LBA_MAGIC_SIZE 8\nstatic const char lba_magic[LBA_MAGIC_SIZE] = {'l', 'b', 'a', 'm', 'a', 'g', 'i', 'c'};\n\nstruct lba_extent_t {\n    \/\/ Header needs to be padded to a multiple of sizeof(lba_entry_t)\n    struct header_t {\n        char magic[LBA_MAGIC_SIZE];\n        char padding[sizeof(lba_entry_t) - (1 + (sizeof(magic) - 1) % sizeof(lba_entry_t))];\n    } header;\n    lba_entry_t entries[0];\n};\n\n\n\nstruct lba_superblock_entry_t {\n    off64_t offset;\n    int lba_entries_count;\n};\n\n#define LBA_SUPER_MAGIC_SIZE 8\nstatic const char lba_super_magic[LBA_SUPER_MAGIC_SIZE] = {'l', 'b', 'a', 's', 'u', 'p', 'e', 'r'};\n\nstruct lba_superblock_t {\n    \/\/ Header needs to be padded to a multiple of sizeof(lba_superblock_entry_t)\n    char magic[LBA_SUPER_MAGIC_SIZE];\n    char padding[sizeof(lba_superblock_entry_t) - (1 + (sizeof(magic) - 1) % sizeof(lba_superblock_entry_t))];\n\n    \/* The superblock contains references to all the extents\n     * except the last. The reference to the last extent is\n     * maintained in the metablock. This is done in order to be\n     * able to store the number of entries in the last extent as\n     * it's being filled up without rewriting the superblock. *\/\n    lba_superblock_entry_t entries[0];\n\n    static int entry_count_to_file_size(int nentries) {\n        return sizeof(lba_superblock_entry_t) * nentries + offsetof(lba_superblock_t, entries[0]);\n    }\n};\n\n\n\n#endif \/* __SERIALIZER_LOG_LBA_DISK_FORMAT__ *\/\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ -*- Mode:C++; Coding:us-ascii-unix; fill-column:158 -*-\n\/**************************************************************************************************************************************************************\/\n\/**\n @file      mandelbrot_cycles.cpp\n @author    Mitch Richling <https:\/\/www.mitchr.me>\n @brief     Benchmark drawing a mandelbrot set using the C++ complex type and excluding hypocycloids.@EOL\n @std       C++98\n @copyright \n  @parblock\n  Copyright (c) 1988-2015, Mitchell Jay Richling <https:\/\/www.mitchr.me> All rights reserved.\n\n  Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:\n\n  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 in the documentation\n     and\/or other materials provided with the distribution.\n\n  3. Neither the name of the copyright holder nor the names of its contributors 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\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n  LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\n  OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n  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\n  DAMAGE.\n  @endparblock\n @filedetails   \n\n  Color points based on qualitative sequence behavior: Tends to infinity (reds), cyclic (blues), or converges (greens).  The method for detecting cycles and\n  fixed points is not perfect, but makes a nice picture.  The color intensity is the length of time it took to make the behavior determination.\n***************************************************************************************************************************************************************\/\n\n#include \"ramCanvas.hpp\"\n\n#include <iostream>                                                      \/* C++ iostream            C++11    *\/\n#include <complex>                                                       \/* STL algorithm           C++11    *\/\n#include <vector>                                                        \/* STL vector              C++11    *\/ \n#include <algorithm>                                                     \/* STL algorithm           C++11    *\/\n\nint main(void) {\n  mjr::color3c8b aColor;\n\n  const int NUMITR   = 16*16*4*4;\n  const int CSIZE    = 7680\/2;\n  const int LASTSIZE = 16*16*4;\n  mjr::ramCanvas3c8b theRamCanvas(CSIZE, CSIZE, -1.45, 0.5, -1.05, 1.05);\n  \n  for(int y=0;y<theRamCanvas.get_numYpix();y++) { \n    for(int x=0;x<theRamCanvas.get_numXpix();x++) {\n      int count, lastIdx=0;\n      double cr = theRamCanvas.int2realX(x);\n      double ci = theRamCanvas.int2realY(y);\n      std::complex<double> c(cr, ci), z(cr, ci);\n      std::vector<std::complex<double>> lastZs(LASTSIZE, std::complex<double>(cr, ci));\n      for(count=0; ; count++) {\n        z = z * z + c;\n        if(count>=NUMITR) {                                                                                            \/\/ Ran too long\n          theRamCanvas.drawPoint(x, y, \"white\");\n          break;\n        }\n        if(std::norm(z)>2.0) {                                                                                         \/\/ Got too big\n          theRamCanvas.drawPoint(x, y, mjr::color3c8b((2*count+20>255 ? 255 : count+20), 0, 0));\n          break;\n        }\n        if(std::abs(z-lastZs[lastIdx])<0.01) {                                                                         \/\/ Converged\n          theRamCanvas.drawPoint(x, y, mjr::color3c8b(0, (count+20>255 ? 255 : count+20), 0));\n          break;\n        }\n        if(std::any_of(lastZs.begin(), lastZs.end(), [&z](std::complex<double> zl){return std::abs(zl-z)<0.0001;}) ) { \/\/ Cycle\n          theRamCanvas.drawPoint(x, y, mjr::color3c8b(0, 0, (count+50>255 ? 255 : count+50)));\n          break;\n        }\n        lastIdx = (lastIdx+1)%LASTSIZE;\n        lastZs[lastIdx] = z;\n      }\n    }\n    std::cout << CSIZE << \"\/\" << y << std::endl;\n  }      \n  theRamCanvas.writeTIFFfile(\"mandelbrot_cycles.tiff\");\n}\n\n<commit_msg>Fixed CW<commit_after>\/\/ -*- Mode:C++; Coding:us-ascii-unix; fill-column:158 -*-\n\/**************************************************************************************************************************************************************\/\n\/**\n @file      mandelbrot_cycles.cpp\n @author    Mitch Richling <https:\/\/www.mitchr.me>\n @brief     Benchmark drawing a mandelbrot set using the C++ complex type and excluding hypocycloids.@EOL\n @std       C++98\n @copyright \n  @parblock\n  Copyright (c) 1988-2015,2021 Mitchell Jay Richling <https:\/\/www.mitchr.me> All rights reserved.\n\n  Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:\n\n  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 in the documentation\n     and\/or other materials provided with the distribution.\n\n  3. Neither the name of the copyright holder nor the names of its contributors 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\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n  LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\n  OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n  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\n  DAMAGE.\n  @endparblock\n @filedetails   \n\n  Color points based on qualitative sequence behavior: Tends to infinity (reds), cyclic (blues), or converges (greens).  The method for detecting cycles and\n  fixed points is not perfect, but makes a nice picture.  The color intensity is the length of time it took to make the behavior determination.\n***************************************************************************************************************************************************************\/\n\n#include \"ramCanvas.hpp\"\n\n#include <iostream>                                                      \/* C++ iostream            C++11    *\/\n#include <complex>                                                       \/* STL algorithm           C++11    *\/\n#include <vector>                                                        \/* STL vector              C++11    *\/ \n#include <algorithm>                                                     \/* STL algorithm           C++11    *\/\n\nint main(void) {\n  mjr::color3c8b aColor;\n\n  const int NUMITR   = 16*16*4*4;\n  const int CSIZE    = 7680\/2;\n  const int LASTSIZE = 16*16*4;\n  mjr::ramCanvas3c8b theRamCanvas(CSIZE, CSIZE, -1.45, 0.5, -1.05, 1.05);\n  \n  for(int y=0;y<theRamCanvas.get_numYpix();y++) { \n    for(int x=0;x<theRamCanvas.get_numXpix();x++) {\n      int count, lastIdx=0;\n      double cr = theRamCanvas.int2realX(x);\n      double ci = theRamCanvas.int2realY(y);\n      std::complex<double> c(cr, ci), z(cr, ci);\n      std::vector<std::complex<double>> lastZs(LASTSIZE, std::complex<double>(cr, ci));\n      for(count=0; ; count++) {\n        z = z * z + c;\n        if(count>=NUMITR) {                                                                                            \/\/ Ran too long\n          theRamCanvas.drawPoint(x, y, \"white\");\n          break;\n        }\n        if(std::norm(z)>2.0) {                                                                                         \/\/ Got too big\n          theRamCanvas.drawPoint(x, y, mjr::color3c8b((2*count+20>255 ? 255 : count+20), 0, 0));\n          break;\n        }\n        if(std::abs(z-lastZs[lastIdx])<0.01) {                                                                         \/\/ Converged\n          theRamCanvas.drawPoint(x, y, mjr::color3c8b(0, (count+20>255 ? 255 : count+20), 0));\n          break;\n        }\n        if(std::any_of(lastZs.begin(), lastZs.end(), [&z](std::complex<double> zl){return std::abs(zl-z)<0.0001;}) ) { \/\/ Cycle\n          theRamCanvas.drawPoint(x, y, mjr::color3c8b(0, 0, (count+50>255 ? 255 : count+50)));\n          break;\n        }\n        lastIdx = (lastIdx+1)%LASTSIZE;\n        lastZs[lastIdx] = z;\n      }\n    }\n    std::cout << CSIZE << \"\/\" << y << std::endl;\n  }      \n  theRamCanvas.writeTIFFfile(\"mandelbrot_cycles.tiff\");\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <string>\n#include \"PropagateEqualities.h\"\n#include \"simplifier.h\"\n#include \"..\/AST\/ArrayTransformer.h\"\n\nnamespace BEEV\n{\n\n  \/* The search functions look for variables that can be expressed in terms of variables.\n   * The most obvious case it doesn't check for is NOT (OR (.. .. )).\n   * I suspect this could take exponential time in the worst case, but on the benchmarks I've tested,\n   * it finishes in reasonable time.\n   * The obvious ways to speed it up (if required), are to create the RHS lazily.\n   *\/\n\n  \/\/ The old XOR code used to use updateSolverMap instead of UpdateSubstitutionMap, I've no idea why.\n\n  bool\n  PropagateEqualities::searchXOR(const ASTNode& lhs, const ASTNode& rhs)\n  {\n    Kind k = lhs.GetKind();\n\n    if (k == SYMBOL)\n        return simp->UpdateSubstitutionMap(lhs, rhs); \/\/ checks whether it's been solved for or loops.\n\n    if (k == NOT)\n      return searchXOR(lhs[0], nf->CreateNode(NOT, rhs));\n\n    bool result = false;\n    if (k == XOR)\n      for (int i = 0; i < lhs.Degree(); i++)\n        {\n          ASTVec others;\n          for (int j = 0; j < lhs.Degree(); j++)\n            if (j != i)\n              others.push_back(lhs[j]);\n\n          others.push_back(rhs);\n          assert (others.size() > 1);\n          ASTNode new_rhs = nf->CreateNode(XOR, others);\n\n          result =  searchXOR(lhs[i], new_rhs);\n          if (result)\n            return result;\n        }\n\n    if (k == EQ && lhs[0].GetValueWidth() ==1)\n      {\n        bool result =  searchTerm(lhs[0], nf->CreateTerm(ITE, 1,rhs, lhs[1], nf->CreateTerm(BVNEG, 1,lhs[1])));\n\n        if (!result)\n          result =  searchTerm(lhs[1], nf->CreateTerm(ITE, 1,rhs, lhs[0], nf->CreateTerm(BVNEG, 1,lhs[0])));\n      }\n\n    return result;\n  }\n\n  bool\n  PropagateEqualities::searchTerm(const ASTNode& lhs, const ASTNode& rhs)\n  {\n    const int width = lhs.GetValueWidth();\n\n    if (lhs.GetKind() == SYMBOL)\n          return simp->UpdateSubstitutionMap(lhs, rhs); \/\/ checks whether it's been solved for, or if the RHS contains the LHS.\n\n    if (lhs.GetKind() == BVUMINUS)\n      return searchTerm(lhs[0], nf->CreateTerm(BVUMINUS, width, rhs));\n\n    if (lhs.GetKind() == BVNEG)\n      return searchTerm(lhs[0], nf->CreateTerm(BVNEG, width, rhs));\n\n    if (lhs.GetKind() == BVXOR || lhs.GetKind() == BVPLUS)\n      for (int i = 0; i < lhs.Degree(); i++)\n        {\n          ASTVec others;\n          for (int j = 0; j < lhs.Degree(); j++)\n            if (j != i)\n              others.push_back(lhs[j]);\n\n          ASTNode new_rhs;\n          if (lhs.GetKind() == BVXOR)\n            {\n              others.push_back(rhs);\n              assert (others.size() > 1);\n              new_rhs = nf->CreateTerm(lhs.GetKind(), width, others);\n            }\n          else if (lhs.GetKind() == BVPLUS)\n            {\n              if (others.size() >1)\n                new_rhs = nf->CreateTerm(BVPLUS, width, others);\n              else\n                new_rhs = others[0];\n\n              new_rhs = nf->CreateTerm(BVUMINUS,width,new_rhs);\n              new_rhs = nf->CreateTerm(BVPLUS,width,new_rhs, rhs);\n            }\n          else\n            FatalError(\"sdafasfsdf2q3234423\");\n\n          bool result =  searchTerm(lhs[i], new_rhs);\n          if (result)\n            return true;\n        }\n\n    if (lhs.Degree() == 2 && lhs.GetKind() == BVMULT && lhs[0].isConstant() && simp->BVConstIsOdd(lhs[0]))\n      return searchTerm(lhs[1], nf->CreateTerm(BVMULT, width, simp->MultiplicativeInverse(lhs[0]), rhs));\n\n    return false;\n  }\n\n\n    \/\/ This doesn't rewrite changes through properly so needs to have a substitution applied to its output.\n    ASTNode\n    PropagateEqualities::propagate(const ASTNode& a, ArrayTransformer*at)\n    {\n        ASTNode output;\n        \/\/if the variable has been solved for, then simply return it\n        if (simp->CheckSubstitutionMap(a, output))\n            return output;\n\n        if (!alreadyVisited.insert(a.GetNodeNum()).second)\n            {\n                return a;\n            }\n\n        output = a;\n\n        \/\/traverse a and populate the SubstitutionMap\n        const Kind k = a.GetKind();\n        if (SYMBOL == k && BOOLEAN_TYPE == a.GetType())\n            {\n                bool updated = simp->UpdateSubstitutionMap(a, ASTTrue);\n                output = updated ? ASTTrue : a;\n            }\n        else if (NOT == k )\n            {\n                bool updated = searchXOR(a[0], ASTFalse);\n                output = updated ? ASTTrue : a;\n            }\n        else if (IFF == k || EQ == k)\n            {\n                const ASTVec& c = a.GetChildren();\n\n                if (c[0] == c[1])\n                    return ASTTrue;\n\n                bool updated = simp->UpdateSubstitutionMap(c[0], c[1]);\n\n                if (updated)\n                    {\n                        \/\/fill the arrayname readindices vector if e0 is a\n                        \/\/READ(Arr,index) and index is a BVCONST\n                        int to;\n                        if ((to = TermOrder(c[0], c[1])) == 1 && c[0].GetKind() == READ)\n                            at->FillUp_ArrReadIndex_Vec(c[0], c[1]);\n                        else if (to == -1 && c[1].GetKind() == READ)\n                            at->FillUp_ArrReadIndex_Vec(c[1], c[0]);\n                    }\n\n\n                if (!updated)\n                  updated = searchTerm(c[0],c[1]);\n\n                if (!updated)\n                  updated = searchTerm(c[1],c[0]);\n\n                output = updated ? ASTTrue : a;\n\n            }\n        else if (XOR == k)\n            {\n            bool updated = searchXOR(a, ASTTrue);\n            output = updated ? ASTTrue : a;\n\n            if (updated)\n              return output;\n\n            \/\/ The below block should be subsumed by the searchXOR function which generalises it.\n            \/\/ So the below block should never do anything..\n#ifndef NDEBUG\n                if (a.Degree() != 2)\n                    return output;\n\n                int to = TermOrder(a[0], a[1]);\n                if (0 == to)\n                    {\n                        if (a[0].GetKind() == NOT && a[0][0].GetKind() == EQ && a[0][0][0].GetValueWidth() == 1\n                                && a[0][0][1].GetKind() == SYMBOL)\n                            {\n                                \/\/ (XOR (NOT(= (1 v)))  ... )\n                                const ASTNode& symbol = a[0][0][1];\n                                const ASTNode newN = nf->CreateTerm(ITE, 1, a[1], a[0][0][0],\n                                        nf->CreateTerm(BVNEG, 1, a[0][0][0]));\n\n                                if (simp->UpdateSolverMap(symbol, newN))\n                                    {\n                                    assert(false);\n                                    output = ASTTrue;\n                                    }\n                            }\n                        else if (a[1].GetKind() == NOT && a[1][0].GetKind() == EQ && a[1][0][0].GetValueWidth() == 1\n                                && a[1][0][1].GetKind() == SYMBOL)\n                            {\n                                const ASTNode& symbol = a[1][0][1];\n                                const ASTNode newN = nf->CreateTerm(ITE, 1, a[0], a[1][0][0],\n                                        nf->CreateTerm(BVNEG, 1, a[1][0][0]));\n\n                                if (simp->UpdateSolverMap(symbol, newN))\n                                    {\n                                    assert(false);\n                                    output = ASTTrue;\n                                    }\n                            }\n                        else if (a[0].GetKind() == EQ && a[0][0].GetValueWidth() == 1 && a[0][1].GetKind() == SYMBOL)\n                            {\n                                \/\/ XOR ((= 1 v) ... )\n\n                                const ASTNode& symbol = a[0][1];\n                                const ASTNode newN = nf->CreateTerm(ITE, 1, a[1], nf->CreateTerm(BVNEG, 1, a[0][0]),\n                                        a[0][0]);\n\n                                if (simp->UpdateSolverMap(symbol, newN))\n                                    {\n                                    assert(false);\n                                    output = ASTTrue;\n                                    }\n                            }\n                        else if (a[1].GetKind() == EQ && a[1][0].GetValueWidth() == 1 && a[1][1].GetKind() == SYMBOL)\n                            {\n                                const ASTNode& symbol = a[1][1];\n                                const ASTNode newN = nf->CreateTerm(ITE, 1, a[0], nf->CreateTerm(BVNEG, 1, a[1][0]),\n                                        a[1][0]);\n\n                                if (simp->UpdateSolverMap(symbol, newN))\n                                  {\n                                    assert(false);\n                                    output = ASTTrue;\n                                  }\n                            }\n                        else\n                            return output;\n                    }\n                else\n                    {\n                        ASTNode symbol, rhs;\n                        if (to == 1)\n                            {\n                                symbol = a[0];\n                                rhs = a[1];\n                            }\n                        else\n                            {\n                                symbol = a[1];\n                                rhs = a[0];\n                            }\n\n                        assert(symbol.GetKind() == SYMBOL);\n\n                        if (simp->UpdateSolverMap(symbol, nf->CreateNode(NOT, rhs)))\n                            {\n                            assert(false);\n                            output = ASTTrue;\n                            }\n                    }\n#endif\n\n            }\n        else if (AND == k)\n            {\n                const ASTVec& c = a.GetChildren();\n                ASTVec o;\n                o.reserve(c.size());\n\n                for (ASTVec::const_iterator it = c.begin(), itend = c.end(); it != itend; it++)\n                    {\n                        if (always_true)\n                          simp->UpdateAlwaysTrueFormSet(*it);\n                        ASTNode aaa = propagate(*it, at);\n\n                        if (ASTTrue != aaa)\n                            {\n                                if (ASTFalse == aaa)\n                                    return ASTFalse;\n                                else\n                                    o.push_back(aaa);\n                            }\n                    }\n                if (o.size() == 0)\n                    output = ASTTrue;\n                else if (o.size() == 1)\n                    output = o[0];\n                else if (o != c)\n                    output = nf->CreateNode(AND, o);\n                else\n                    output = a;\n            }\n\n        return output;\n    } \/\/end of CreateSubstitutionMap()\n\n}\n;\n<commit_msg>Fix an assertion error.<commit_after>#include <string>\n#include \"PropagateEqualities.h\"\n#include \"simplifier.h\"\n#include \"..\/AST\/ArrayTransformer.h\"\n\nnamespace BEEV\n{\n\n  \/* The search functions look for variables that can be expressed in terms of variables.\n   * The most obvious case it doesn't check for is NOT (OR (.. .. )).\n   * I suspect this could take exponential time in the worst case, but on the benchmarks I've tested,\n   * it finishes in reasonable time.\n   * The obvious ways to speed it up (if required), are to create the RHS lazily.\n   *\/\n\n  \/\/ The old XOR code used to use updateSolverMap instead of UpdateSubstitutionMap, I've no idea why.\n\n  bool\n  PropagateEqualities::searchXOR(const ASTNode& lhs, const ASTNode& rhs)\n  {\n    Kind k = lhs.GetKind();\n\n    if (k == SYMBOL)\n        {\n          if (lhs == rhs)\n            return true;\n          return simp->UpdateSubstitutionMap(lhs, rhs); \/\/ checks whether it's been solved for or loops.\n        }\n\n    if (k == NOT)\n      return searchXOR(lhs[0], nf->CreateNode(NOT, rhs));\n\n    bool result = false;\n    if (k == XOR)\n      for (int i = 0; i < lhs.Degree(); i++)\n        {\n          ASTVec others;\n          for (int j = 0; j < lhs.Degree(); j++)\n            if (j != i)\n              others.push_back(lhs[j]);\n\n          others.push_back(rhs);\n          assert (others.size() > 1);\n          ASTNode new_rhs = nf->CreateNode(XOR, others);\n\n          result =  searchXOR(lhs[i], new_rhs);\n          if (result)\n            return result;\n        }\n\n    if (k == EQ && lhs[0].GetValueWidth() ==1)\n      {\n        bool result =  searchTerm(lhs[0], nf->CreateTerm(ITE, 1,rhs, lhs[1], nf->CreateTerm(BVNEG, 1,lhs[1])));\n\n        if (!result)\n          result =  searchTerm(lhs[1], nf->CreateTerm(ITE, 1,rhs, lhs[0], nf->CreateTerm(BVNEG, 1,lhs[0])));\n      }\n\n    return result;\n  }\n\n  bool\n  PropagateEqualities::searchTerm(const ASTNode& lhs, const ASTNode& rhs)\n  {\n    const int width = lhs.GetValueWidth();\n\n    if (lhs.GetKind() == SYMBOL)\n      {\n        if (lhs == rhs)\n          return true;\n\n        return simp->UpdateSubstitutionMap(lhs, rhs); \/\/ checks whether it's been solved for, or if the RHS contains the LHS.\n      }\n\n    if (lhs.GetKind() == BVUMINUS)\n      return searchTerm(lhs[0], nf->CreateTerm(BVUMINUS, width, rhs));\n\n    if (lhs.GetKind() == BVNEG)\n      return searchTerm(lhs[0], nf->CreateTerm(BVNEG, width, rhs));\n\n    if (lhs.GetKind() == BVXOR || lhs.GetKind() == BVPLUS)\n      for (int i = 0; i < lhs.Degree(); i++)\n        {\n          ASTVec others;\n          for (int j = 0; j < lhs.Degree(); j++)\n            if (j != i)\n              others.push_back(lhs[j]);\n\n          ASTNode new_rhs;\n          if (lhs.GetKind() == BVXOR)\n            {\n              others.push_back(rhs);\n              assert (others.size() > 1);\n              new_rhs = nf->CreateTerm(lhs.GetKind(), width, others);\n            }\n          else if (lhs.GetKind() == BVPLUS)\n            {\n              if (others.size() >1)\n                new_rhs = nf->CreateTerm(BVPLUS, width, others);\n              else\n                new_rhs = others[0];\n\n              new_rhs = nf->CreateTerm(BVUMINUS,width,new_rhs);\n              new_rhs = nf->CreateTerm(BVPLUS,width,new_rhs, rhs);\n            }\n          else\n            FatalError(\"sdafasfsdf2q3234423\");\n\n          bool result =  searchTerm(lhs[i], new_rhs);\n          if (result)\n            return true;\n        }\n\n    if (lhs.Degree() == 2 && lhs.GetKind() == BVMULT && lhs[0].isConstant() && simp->BVConstIsOdd(lhs[0]))\n      return searchTerm(lhs[1], nf->CreateTerm(BVMULT, width, simp->MultiplicativeInverse(lhs[0]), rhs));\n\n    return false;\n  }\n\n\n    \/\/ This doesn't rewrite changes through properly so needs to have a substitution applied to its output.\n    ASTNode\n    PropagateEqualities::propagate(const ASTNode& a, ArrayTransformer*at)\n    {\n        ASTNode output;\n        \/\/if the variable has been solved for, then simply return it\n        if (simp->CheckSubstitutionMap(a, output))\n            return output;\n\n        if (!alreadyVisited.insert(a.GetNodeNum()).second)\n            {\n                return a;\n            }\n\n        output = a;\n\n        \/\/traverse a and populate the SubstitutionMap\n        const Kind k = a.GetKind();\n        if (SYMBOL == k && BOOLEAN_TYPE == a.GetType())\n            {\n                bool updated = simp->UpdateSubstitutionMap(a, ASTTrue);\n                output = updated ? ASTTrue : a;\n            }\n        else if (NOT == k )\n            {\n                bool updated = searchXOR(a[0], ASTFalse);\n                output = updated ? ASTTrue : a;\n            }\n        else if (IFF == k || EQ == k)\n            {\n                const ASTVec& c = a.GetChildren();\n\n                if (c[0] == c[1])\n                    return ASTTrue;\n\n                bool updated = simp->UpdateSubstitutionMap(c[0], c[1]);\n\n                if (updated)\n                    {\n                        \/\/fill the arrayname readindices vector if e0 is a\n                        \/\/READ(Arr,index) and index is a BVCONST\n                        int to;\n                        if ((to = TermOrder(c[0], c[1])) == 1 && c[0].GetKind() == READ)\n                            at->FillUp_ArrReadIndex_Vec(c[0], c[1]);\n                        else if (to == -1 && c[1].GetKind() == READ)\n                            at->FillUp_ArrReadIndex_Vec(c[1], c[0]);\n                    }\n\n\n                if (!updated)\n                  updated = searchTerm(c[0],c[1]);\n\n                if (!updated)\n                  updated = searchTerm(c[1],c[0]);\n\n                output = updated ? ASTTrue : a;\n\n            }\n        else if (XOR == k)\n            {\n            bool updated = searchXOR(a, ASTTrue);\n            output = updated ? ASTTrue : a;\n\n            if (updated)\n              return output;\n\n            \/\/ The below block should be subsumed by the searchXOR function which generalises it.\n            \/\/ So the below block should never do anything..\n#ifndef NDEBUG\n                if (a.Degree() != 2)\n                    return output;\n\n                int to = TermOrder(a[0], a[1]);\n                if (0 == to)\n                    {\n                        if (a[0].GetKind() == NOT && a[0][0].GetKind() == EQ && a[0][0][0].GetValueWidth() == 1\n                                && a[0][0][1].GetKind() == SYMBOL)\n                            {\n                                \/\/ (XOR (NOT(= (1 v)))  ... )\n                                const ASTNode& symbol = a[0][0][1];\n                                const ASTNode newN = nf->CreateTerm(ITE, 1, a[1], a[0][0][0],\n                                        nf->CreateTerm(BVNEG, 1, a[0][0][0]));\n\n                                if (simp->UpdateSolverMap(symbol, newN))\n                                    {\n                                    assert(false);\n                                    output = ASTTrue;\n                                    }\n                            }\n                        else if (a[1].GetKind() == NOT && a[1][0].GetKind() == EQ && a[1][0][0].GetValueWidth() == 1\n                                && a[1][0][1].GetKind() == SYMBOL)\n                            {\n                                const ASTNode& symbol = a[1][0][1];\n                                const ASTNode newN = nf->CreateTerm(ITE, 1, a[0], a[1][0][0],\n                                        nf->CreateTerm(BVNEG, 1, a[1][0][0]));\n\n                                if (simp->UpdateSolverMap(symbol, newN))\n                                    {\n                                    assert(false);\n                                    output = ASTTrue;\n                                    }\n                            }\n                        else if (a[0].GetKind() == EQ && a[0][0].GetValueWidth() == 1 && a[0][1].GetKind() == SYMBOL)\n                            {\n                                \/\/ XOR ((= 1 v) ... )\n\n                                const ASTNode& symbol = a[0][1];\n                                const ASTNode newN = nf->CreateTerm(ITE, 1, a[1], nf->CreateTerm(BVNEG, 1, a[0][0]),\n                                        a[0][0]);\n\n                                if (simp->UpdateSolverMap(symbol, newN))\n                                    {\n                                    assert(false);\n                                    output = ASTTrue;\n                                    }\n                            }\n                        else if (a[1].GetKind() == EQ && a[1][0].GetValueWidth() == 1 && a[1][1].GetKind() == SYMBOL)\n                            {\n                                const ASTNode& symbol = a[1][1];\n                                const ASTNode newN = nf->CreateTerm(ITE, 1, a[0], nf->CreateTerm(BVNEG, 1, a[1][0]),\n                                        a[1][0]);\n\n                                if (simp->UpdateSolverMap(symbol, newN))\n                                  {\n                                    assert(false);\n                                    output = ASTTrue;\n                                  }\n                            }\n                        else\n                            return output;\n                    }\n                else\n                    {\n                        ASTNode symbol, rhs;\n                        if (to == 1)\n                            {\n                                symbol = a[0];\n                                rhs = a[1];\n                            }\n                        else\n                            {\n                                symbol = a[1];\n                                rhs = a[0];\n                            }\n\n                        assert(symbol.GetKind() == SYMBOL);\n\n                        if (simp->UpdateSolverMap(symbol, nf->CreateNode(NOT, rhs)))\n                            {\n                            assert(false);\n                            output = ASTTrue;\n                            }\n                    }\n#endif\n\n            }\n        else if (AND == k)\n            {\n                const ASTVec& c = a.GetChildren();\n                ASTVec o;\n                o.reserve(c.size());\n\n                for (ASTVec::const_iterator it = c.begin(), itend = c.end(); it != itend; it++)\n                    {\n                        if (always_true)\n                          simp->UpdateAlwaysTrueFormSet(*it);\n                        ASTNode aaa = propagate(*it, at);\n\n                        if (ASTTrue != aaa)\n                            {\n                                if (ASTFalse == aaa)\n                                    return ASTFalse;\n                                else\n                                    o.push_back(aaa);\n                            }\n                    }\n                if (o.size() == 0)\n                    output = ASTTrue;\n                else if (o.size() == 1)\n                    output = o[0];\n                else if (o != c)\n                    output = nf->CreateNode(AND, o);\n                else\n                    output = a;\n            }\n\n        return output;\n    } \/\/end of CreateSubstitutionMap()\n\n}\n;\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <vector>\n#include <cstring>\n\nclass Solution {\npublic:\n    using vector = std::vector<int>;\n\n    int strStr(char* T, char* P) {\n        vector overlap;\n        buildOverlapTable(P, overlap);\n\n        const auto length = strlen(T), end = overlap.size() - 1;\n\n        for (int m{}, i{}; m + i < length;) {\n            if (P[i] == T[m + i]) {\n                if (i == end) {\n                    return m;\n                }\n                ++i;\n            } else {\n                if (overlap[i] > -1) {\n                    m += i - overlap[i];\n                    i = overlap[i];\n                } else {\n                    i = 0;\n                    ++m;\n                }\n            }\n        }\n\n        return -1;\n    }\n\nprivate:\n    void buildOverlapTable(char* needle, vector& table) {\n        table.clear();\n\n        if (needle[0] == '\\0') {\n            return;\n        }\n\n        table.push_back(-1);\n\n        if (needle[1] == '\\0') {\n            return;\n        }\n\n        table.push_back(0);\n\n        \/\/ Table constructing magic\n        {\n            int cnd{};\n\n            for (char* str = needle + 2; *str != '\\0';) {\n                if (str[-1] == needle[cnd]) {\n                    ++cnd;\n                    table.push_back(cnd);\n                    ++str;\n                } else if (cnd > 0) {\n                    cnd = table[cnd];\n                } else {\n                    table.push_back(0);\n                    ++str;\n                }\n            }\n        }\n    }\n};\n<commit_msg>handle the case where either strings are empty<commit_after>#pragma once\n\n#include <vector>\n#include <cstring>\n\nclass Solution {\npublic:\n    using vector = std::vector<int>;\n\n    int strStr(char* T, char* P) {\n        if (T[0] == '\\0' || P[0] == '\\0') {\n            return -1;\n        }\n\n        vector overlap;\n        buildOverlapTable(P, overlap);\n\n        const auto length = strlen(T), end = overlap.size() - 1;\n\n        for (int m{}, i{}; m + i < length;) {\n            if (P[i] == T[m + i]) {\n                if (i == end) {\n                    return m;\n                }\n                ++i;\n            } else {\n                if (overlap[i] > -1) {\n                    m += i - overlap[i];\n                    i = overlap[i];\n                } else {\n                    i = 0;\n                    ++m;\n                }\n            }\n        }\n\n        return -1;\n    }\n\nprivate:\n    void buildOverlapTable(char* needle, vector& table) {\n        table.clear();\n\n        if (needle[0] == '\\0') {\n            return;\n        }\n\n        table.push_back(-1);\n\n        if (needle[1] == '\\0') {\n            return;\n        }\n\n        table.push_back(0);\n\n        \/\/ Table constructing magic\n        {\n            int cnd{};\n\n            for (char* str = needle + 2; *str != '\\0';) {\n                if (str[-1] == needle[cnd]) {\n                    ++cnd;\n                    table.push_back(cnd);\n                    ++str;\n                } else if (cnd > 0) {\n                    cnd = table[cnd];\n                } else {\n                    table.push_back(0);\n                    ++str;\n                }\n            }\n        }\n    }\n};\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @cond ___LICENSE___\n *\n * Copyright (c) 2016 Koen Visscher, Paul Visscher and individual contributors.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *\n * @endcond\n *\/\n\n#include \"common\/environment.h\"\n#include \"common\/directory.h\"\n#include \"common\/path.h\"\n\n#include \"preproc\/env.h\"\n\n#include \"api\/console.h\"\n\n#include \"config.h\"\n\n#if OS_IS_WINDOWS\n#   include <windows.h>\n#else\n#   include <unistd.h>\n#endif\n\nnamespace Path\n{\n    std::string Get( const std::string &path, Type type \/*= Type::Game *\/ )\n    {\n        std::string from;\n        bool resolve = true;\n\n        switch ( type )\n        {\n        case Path::Type::Program:\n            from = Path::GetProgramDirectory();\n            break;\n\n        case Path::Type::Data:\n            from = Path::GetProgramDataDirectory();\n            break;\n\n        case Path::Type::SharedData:\n            from = Path::GetProgramSharedDataDirectory();\n            break;\n\n        case Path::Type::Temp:\n            from = Path::GetProgramTempDirectory();\n            break;\n\n        case Path::Type::Editor:\n            from = Path::GetProgramDirectory();\n            break;\n\n        case Path::Type::None:\n            resolve = false;\n            break;\n        }\n\n        return resolve ? Path::ResolveRelative( from, path ) : path;\n    }\n\n    std::string ResolveRelative( const std::string &from, const std::string &to, bool sameRoot \/*= true *\/ )\n    {\n        if ( sameRoot )\n        {\n            \/\/ Just add the relative path to the from path an normalise :)\n            return Canonical( FixStyle( boost::filesystem::path( Canonical( from ) ).parent_path().generic_string() )\n                              + Canonical( to ) );\n        }\n        else\n        {\n            \/\/ Cheers - http:\/\/stackoverflow.com\/questions\/10167382\/boostfilesystem-get-relative-path\n\n            boost::filesystem::path fsFrom, fsTo, result;\n\n            fsFrom  = boost::filesystem::absolute( from ).parent_path();\n            fsTo    = boost::filesystem::absolute( to );\n\n            boost::filesystem::path::const_iterator itrFrom( fsFrom.begin() ), itrTo( fsTo.begin() );\n\n            \/\/ Find common base\n            \/\/\/ @todo itrTo != toEnd always true\n            for ( boost::filesystem::path::const_iterator toEnd( fsTo.end() ), fromEnd( fsFrom.end() ) ;\n                    itrTo != toEnd && itrFrom != fromEnd && *itrFrom == *itrTo; ++itrFrom, ++itrTo );\n\n            \/\/ Navigate backwards in directory to reach previously found base\n            for ( boost::filesystem::path::const_iterator fromEnd( fsFrom.end() ); itrFrom != fromEnd; ++itrFrom )\n            {\n                if ( ( *itrFrom ) != \".\" )\n                {\n                    result \/= \"..\";\n                }\n            }\n\n            \/\/ Now navigate down the directory branch\n            for ( ; itrTo != fsTo.end() ; ++itrTo )\n            {\n                result \/= *itrTo;\n            }\n\n            return Canonical( result.generic_string() );\n        }\n    }\n\n\n    std::string FixStyle( const std::string &filePath )\n    {\n        const boost::filesystem::path path( filePath );\n        std::string newPath = path.generic_string();\n\n        if ( !( path.has_stem() && path.has_extension() ) )\n        {\n            if ( path.empty() || newPath.back() != '\/' )\n            {\n                newPath += '\/';\n            }\n        }\n\n#if !(OS_IS_WINDOWS)\n        newPath = String::Replace( newPath, \"\\\\\", \"\/\" );\n        newPath = String::Replace( newPath, \"\/\/\", \"\/\" );\n#endif\n        return newPath;\n    }\n\n    std::string Canonical( const std::string &path, bool absolute \/*= false *\/ )\n    {\n        if ( ( path == \".\" || path == \".\/\" ) && !absolute )\n        {\n            return path;\n        }\n\n        \/\/ Again Cheers - http:\/\/stackoverflow.com\/questions\/1746136\/how-do-i-normalize-a-pathname-using-boostfilesystem\n        boost::filesystem::path fsPath( path );\n\n        if ( absolute )\n        {\n            fsPath = boost::filesystem::absolute( fsPath );\n        }\n\n        boost::filesystem::path result;\n\n        for ( auto it = fsPath.begin(), end = fsPath.end(); it != end; ++it )\n        {\n            const std::string part = it->generic_string();\n\n            if ( part == \"..\" )\n            {\n                if ( result.filename() == \"..\" )\n                {\n                    result \/= *it;\n                }\n                else\n                {\n                    if ( result != \"\" )\n                    {\n                        result = result.parent_path();\n                    }\n                    else\n                    {\n                        result \/= \"..\";\n                    }\n                }\n            }\n            else if ( part == \".\" )\n            {\n                \/\/ Ignore\n            }\n            else\n            {\n                \/\/ Just cat other path entries\n                result \/= *it;\n            }\n        }\n\n        return FixStyle( result.generic_string() );\n    }\n\n    bool IsParent( const std::string &from, const std::string &to )\n    {\n        const std::string canFrom = Canonical( from, true );\n        const std::string canTo = Canonical( to, true );\n        const std::string relative = Canonical( canFrom + ResolveRelative( canFrom, canTo, false ), true );\n\n        return relative.find( canFrom ) == 0;\n    }\n\n    std::string GetFileName( const std::string &path, const bool stripExtension \/*= false *\/ )\n    {\n        const boost::filesystem::path fsPath( FixStyle( path ) );\n        std::string filename;\n\n        if ( !stripExtension )\n        {\n            filename = fsPath.filename().generic_string();\n        }\n        else\n        {\n            filename = fsPath.stem().generic_string();\n        }\n\n        return filename;\n    }\n\n    std::string GetDirectory( const std::string &path )\n    {\n        return FixStyle( boost::filesystem::path( path ).parent_path().generic_string() );\n    }\n\n    std::string GetExtension( const std::string &filepath, const bool addDot \/*= false *\/ )\n    {\n        const std::string fullExtension = boost::filesystem::path( filepath ).extension().generic_string();\n\n        return addDot || fullExtension == \"\" ? fullExtension : fullExtension.substr( 1 );\n    }\n\n    bool HasExtension( const std::string &filepath )\n    {\n        return boost::filesystem::path( filepath ).has_extension();\n    }\n\n    std::string GetUniqueFileName( const std::string &extension \/*= \".tmp\" *\/ )\n    {\n        return FixStyle( boost::filesystem::unique_path( \"%%%%-%%%%-%%%%-%%%%\" + extension ).generic_string() );\n    }\n\n    std::string GetUniqueDirectory()\n    {\n        return FixStyle( boost::filesystem::unique_path( \"%%%%-%%%%-%%%%\" ).generic_string() );\n    }\n\n    std::string GetTempDirectory()\n    {\n        return FixStyle( boost::filesystem::temp_directory_path().generic_string() );\n    }\n\n    std::string GetExeDirectory()\n    {\n        return FixStyle( boost::filesystem::path( GetExeFile() ).parent_path().generic_string() );\n    }\n\n    std::string GetExeFile()\n    {\n#if OS_IS_WINDOWS\n        char result[ MAX_PATH ];\n        return Canonical( std::string( result, GetModuleFileNameA( nullptr, result, MAX_PATH ) ) );\n#elif OS_IS_LINUX\n        char result[ PATH_MAX ];\n        size_t count = readlink( \"\/proc\/self\/exe\", result, PATH_MAX );\n        return std::string( result, ( count > 0 ) ? count : 0 );\n#else\n#error\n#endif\n    }\n\n    std::string GetDataDirectory()\n    {\n#if OS_IS_WINDOWS\n        return FixStyle( Environment::GetVariable( \"APPDATA\" ) );\n#elif OS_IS_LINUX\n        return FixStyle( \"~\/local\/share\/\" );\n#elif OS_IS_MACOS\n        return \"~\/Library\/Application Support\/\";\n#endif\n    }\n\n    std::string GetSharedDataDirectory()\n    {\n#if OS_IS_WINDOWS\n        return FixStyle( Environment::GetVariable( \"ALLUSERSPROFILE\" ) );\n#elif OS_IS_LINUX\n        return \"\/usr\/local\/\";\n#elif OS_IS_MACOS\n        return \"\/usr\/local\/\";\n#endif\n    }\n\n    std::string GetProgramDirectory()\n    {\n        return GetExeDirectory();\n    }\n\n    std::string GetProgramTempDirectory()\n    {\n        return String::Format( \"%s%s\/%s\/\", GetTempDirectory(), std::string( PROGRAM_COMPANY ), std::string( PROGRAM_NAME ) );\n    }\n\n    std::string GetProgramDataDirectory()\n    {\n        return String::Format( \"%s%s\/%s\/\", GetDataDirectory(), std::string( PROGRAM_COMPANY ), std::string( PROGRAM_NAME ) );\n    }\n\n    std::string GetProgramSharedDataDirectory()\n    {\n        return String::Format( \"%s%s\/%s\/\", GetSharedDataDirectory(),\n                               std::string( PROGRAM_COMPANY ),\n                               std::string( PROGRAM_NAME ) );\n    }\n\n    std::vector< boost::filesystem::path > List( const std::string &directory, bool recursive \/*= false *\/ )\n    {\n        std::vector< boost::filesystem::path > contents;\n\n        if ( !Directory::Exists( directory ) )\n        {\n            return contents;\n        }\n\n        if ( recursive )\n        {\n            boost::filesystem::recursive_directory_iterator it( directory ), end;\n\n            for ( ; it != end; ++it )\n            {\n                contents.push_back( *it );\n            }\n        }\n        else\n        {\n            boost::filesystem::directory_iterator it( directory ), end;\n\n            for ( ; it != end; ++it )\n            {\n                contents.push_back( *it );\n            }\n        }\n\n        return contents;\n    }\n\n    std::vector< std::string > ListContent( const std::string &directory, bool recursive \/*= false *\/ )\n    {\n        const std::vector< boost::filesystem::path > contents = List( directory, recursive );\n        std::vector< std::string > result;\n        result.reserve( contents.size() );\n\n        for ( auto it = contents.begin(), end = contents.end(); it != end; ++it )\n        {\n            result.push_back( FixStyle( it->generic_string() ) );\n        }\n\n        return result;\n    }\n\n    std::string GetWorkingDirectory()\n    {\n        return Path::FixStyle( boost::filesystem::current_path().generic_string() );\n    }\n\n    bool SetWorkingDirectory( const std::string &workingDirectory )\n    {\n        bool success = true;\n\n        try\n        {\n            boost::filesystem::current_path( workingDirectory );\n        }\n        catch ( boost::filesystem::filesystem_error & )\n        {\n            success = false;\n        }\n\n        return success;\n    }\n\n    void DeleteAll( const std::string &path )\n    {\n        boost::filesystem::remove_all( path );\n    }\n\n}<commit_msg>Small backlash fix in Canonical<commit_after>\/**\n * @cond ___LICENSE___\n *\n * Copyright (c) 2016 Koen Visscher, Paul Visscher and individual contributors.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *\n * @endcond\n *\/\n\n#include \"common\/environment.h\"\n#include \"common\/directory.h\"\n#include \"common\/path.h\"\n\n#include \"preproc\/env.h\"\n\n#include \"api\/console.h\"\n\n#include \"config.h\"\n\n#if OS_IS_WINDOWS\n#   include <windows.h>\n#else\n#   include <unistd.h>\n#endif\n\nnamespace Path\n{\n    std::string Get( const std::string &path, Type type \/*= Type::Game *\/ )\n    {\n        std::string from;\n        bool resolve = true;\n\n        switch ( type )\n        {\n        case Path::Type::Program:\n            from = Path::GetProgramDirectory();\n            break;\n\n        case Path::Type::Data:\n            from = Path::GetProgramDataDirectory();\n            break;\n\n        case Path::Type::SharedData:\n            from = Path::GetProgramSharedDataDirectory();\n            break;\n\n        case Path::Type::Temp:\n            from = Path::GetProgramTempDirectory();\n            break;\n\n        case Path::Type::Editor:\n            from = Path::GetProgramDirectory();\n            break;\n\n        case Path::Type::None:\n            resolve = false;\n            break;\n        }\n\n        return resolve ? Path::ResolveRelative( from, path ) : path;\n    }\n\n    std::string ResolveRelative( const std::string &from, const std::string &to, bool sameRoot \/*= true *\/ )\n    {\n        if ( sameRoot )\n        {\n            \/\/ Just add the relative path to the from path an normalise :)\n            return Canonical( FixStyle( boost::filesystem::path( Canonical( from ) ).parent_path().generic_string() )\n                              + Canonical( to ) );\n        }\n        else\n        {\n            \/\/ Cheers - http:\/\/stackoverflow.com\/questions\/10167382\/boostfilesystem-get-relative-path\n\n            boost::filesystem::path fsFrom, fsTo, result;\n\n            fsFrom  = boost::filesystem::absolute( from ).parent_path();\n            fsTo    = boost::filesystem::absolute( to );\n\n            boost::filesystem::path::const_iterator itrFrom( fsFrom.begin() ), itrTo( fsTo.begin() );\n\n            \/\/ Find common base\n            \/\/\/ @todo itrTo != toEnd always true\n            for ( boost::filesystem::path::const_iterator toEnd( fsTo.end() ), fromEnd( fsFrom.end() ) ;\n                    itrTo != toEnd && itrFrom != fromEnd && *itrFrom == *itrTo; ++itrFrom, ++itrTo );\n\n            \/\/ Navigate backwards in directory to reach previously found base\n            for ( boost::filesystem::path::const_iterator fromEnd( fsFrom.end() ); itrFrom != fromEnd; ++itrFrom )\n            {\n                if ( ( *itrFrom ) != \".\" )\n                {\n                    result \/= \"..\";\n                }\n            }\n\n            \/\/ Now navigate down the directory branch\n            for ( ; itrTo != fsTo.end() ; ++itrTo )\n            {\n                result \/= *itrTo;\n            }\n\n            return Canonical( result.generic_string() );\n        }\n    }\n\n\n    std::string FixStyle( const std::string &filePath )\n    {\n        const boost::filesystem::path path( filePath );\n        std::string newPath = path.generic_string();\n\n        if ( !( path.has_stem() && path.has_extension() ) )\n        {\n            if ( path.empty() || newPath.back() != '\/' )\n            {\n                newPath += '\/';\n            }\n        }\n\n#if !(OS_IS_WINDOWS)\n        newPath = String::Replace( newPath, \"\\\\\", \"\/\" );\n        newPath = String::Replace( newPath, \"\/\/\", \"\/\" );\n#endif\n        return newPath;\n    }\n\n    std::string Canonical( const std::string &path, bool absolute \/*= false *\/ )\n    {\n#if !(OS_IS_WINDOWS)\n        newPath = String::Replace( newPath, \"\\\\\", \"\/\" );\n#endif\n\n        if ( ( path == \".\" || path == \".\/\" ) && !absolute )\n        {\n            return path;\n        }\n\n        \/\/ Again Cheers - http:\/\/stackoverflow.com\/questions\/1746136\/how-do-i-normalize-a-pathname-using-boostfilesystem\n        boost::filesystem::path fsPath( path );\n\n        if ( absolute )\n        {\n            fsPath = boost::filesystem::absolute( fsPath );\n        }\n\n        boost::filesystem::path result;\n\n        for ( auto it = fsPath.begin(), end = fsPath.end(); it != end; ++it )\n        {\n            const std::string part = it->generic_string();\n\n            if ( part == \"..\" )\n            {\n                if ( result.filename() == \"..\" )\n                {\n                    result \/= *it;\n                }\n                else\n                {\n                    if ( result != \"\" )\n                    {\n                        result = result.parent_path();\n                    }\n                    else\n                    {\n                        result \/= \"..\";\n                    }\n                }\n            }\n            else if ( part == \".\" )\n            {\n                \/\/ Ignore\n            }\n            else\n            {\n                \/\/ Just cat other path entries\n                result \/= *it;\n            }\n        }\n\n        return FixStyle( result.generic_string() );\n    }\n\n    bool IsParent( const std::string &from, const std::string &to )\n    {\n        const std::string canFrom = Canonical( from, true );\n        const std::string canTo = Canonical( to, true );\n        const std::string relative = Canonical( canFrom + ResolveRelative( canFrom, canTo, false ), true );\n\n        return relative.find( canFrom ) == 0;\n    }\n\n    std::string GetFileName( const std::string &path, const bool stripExtension \/*= false *\/ )\n    {\n        const boost::filesystem::path fsPath( FixStyle( path ) );\n        std::string filename;\n\n        if ( !stripExtension )\n        {\n            filename = fsPath.filename().generic_string();\n        }\n        else\n        {\n            filename = fsPath.stem().generic_string();\n        }\n\n        return filename;\n    }\n\n    std::string GetDirectory( const std::string &path )\n    {\n        return FixStyle( boost::filesystem::path( path ).parent_path().generic_string() );\n    }\n\n    std::string GetExtension( const std::string &filepath, const bool addDot \/*= false *\/ )\n    {\n        const std::string fullExtension = boost::filesystem::path( filepath ).extension().generic_string();\n\n        return addDot || fullExtension == \"\" ? fullExtension : fullExtension.substr( 1 );\n    }\n\n    bool HasExtension( const std::string &filepath )\n    {\n        return boost::filesystem::path( filepath ).has_extension();\n    }\n\n    std::string GetUniqueFileName( const std::string &extension \/*= \".tmp\" *\/ )\n    {\n        return FixStyle( boost::filesystem::unique_path( \"%%%%-%%%%-%%%%-%%%%\" + extension ).generic_string() );\n    }\n\n    std::string GetUniqueDirectory()\n    {\n        return FixStyle( boost::filesystem::unique_path( \"%%%%-%%%%-%%%%\" ).generic_string() );\n    }\n\n    std::string GetTempDirectory()\n    {\n        return FixStyle( boost::filesystem::temp_directory_path().generic_string() );\n    }\n\n    std::string GetExeDirectory()\n    {\n        return FixStyle( boost::filesystem::path( GetExeFile() ).parent_path().generic_string() );\n    }\n\n    std::string GetExeFile()\n    {\n#if OS_IS_WINDOWS\n        char result[ MAX_PATH ];\n        return Canonical( std::string( result, GetModuleFileNameA( nullptr, result, MAX_PATH ) ) );\n#elif OS_IS_LINUX\n        char result[ PATH_MAX ];\n        size_t count = readlink( \"\/proc\/self\/exe\", result, PATH_MAX );\n        return std::string( result, ( count > 0 ) ? count : 0 );\n#else\n#error\n#endif\n    }\n\n    std::string GetDataDirectory()\n    {\n#if OS_IS_WINDOWS\n        return FixStyle( Environment::GetVariable( \"APPDATA\" ) );\n#elif OS_IS_LINUX\n        return FixStyle( \"~\/local\/share\/\" );\n#elif OS_IS_MACOS\n        return \"~\/Library\/Application Support\/\";\n#endif\n    }\n\n    std::string GetSharedDataDirectory()\n    {\n#if OS_IS_WINDOWS\n        return FixStyle( Environment::GetVariable( \"ALLUSERSPROFILE\" ) );\n#elif OS_IS_LINUX\n        return \"\/usr\/local\/\";\n#elif OS_IS_MACOS\n        return \"\/usr\/local\/\";\n#endif\n    }\n\n    std::string GetProgramDirectory()\n    {\n        return GetExeDirectory();\n    }\n\n    std::string GetProgramTempDirectory()\n    {\n        return String::Format( \"%s%s\/%s\/\", GetTempDirectory(), std::string( PROGRAM_COMPANY ), std::string( PROGRAM_NAME ) );\n    }\n\n    std::string GetProgramDataDirectory()\n    {\n        return String::Format( \"%s%s\/%s\/\", GetDataDirectory(), std::string( PROGRAM_COMPANY ), std::string( PROGRAM_NAME ) );\n    }\n\n    std::string GetProgramSharedDataDirectory()\n    {\n        return String::Format( \"%s%s\/%s\/\", GetSharedDataDirectory(),\n                               std::string( PROGRAM_COMPANY ),\n                               std::string( PROGRAM_NAME ) );\n    }\n\n    std::vector< boost::filesystem::path > List( const std::string &directory, bool recursive \/*= false *\/ )\n    {\n        std::vector< boost::filesystem::path > contents;\n\n        if ( !Directory::Exists( directory ) )\n        {\n            return contents;\n        }\n\n        if ( recursive )\n        {\n            boost::filesystem::recursive_directory_iterator it( directory ), end;\n\n            for ( ; it != end; ++it )\n            {\n                contents.push_back( *it );\n            }\n        }\n        else\n        {\n            boost::filesystem::directory_iterator it( directory ), end;\n\n            for ( ; it != end; ++it )\n            {\n                contents.push_back( *it );\n            }\n        }\n\n        return contents;\n    }\n\n    std::vector< std::string > ListContent( const std::string &directory, bool recursive \/*= false *\/ )\n    {\n        const std::vector< boost::filesystem::path > contents = List( directory, recursive );\n        std::vector< std::string > result;\n        result.reserve( contents.size() );\n\n        for ( auto it = contents.begin(), end = contents.end(); it != end; ++it )\n        {\n            result.push_back( FixStyle( it->generic_string() ) );\n        }\n\n        return result;\n    }\n\n    std::string GetWorkingDirectory()\n    {\n        return Path::FixStyle( boost::filesystem::current_path().generic_string() );\n    }\n\n    bool SetWorkingDirectory( const std::string &workingDirectory )\n    {\n        bool success = true;\n\n        try\n        {\n            boost::filesystem::current_path( workingDirectory );\n        }\n        catch ( boost::filesystem::filesystem_error & )\n        {\n            success = false;\n        }\n\n        return success;\n    }\n\n    void DeleteAll( const std::string &path )\n    {\n        boost::filesystem::remove_all( path );\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 <amr_single_step.h>\n#include <fc2d_clawpack46.H>\n#include <fclaw2d_map.h>\n#include <p4est_connectivity.h>\n\n#include <amr_forestclaw.H>\n#include <amr_utils.H>\n#include <fclaw2d_map_query.h>\n\n#include \"filament_user.H\"\n\ntypedef struct user_options\n{\n    int example;\n    double alpha;\n\n    amr_options_t* gparms;   \/* Need to check mx *\/\n\n    int is_registered;\n\n} user_options_t;\n\nstatic void *\noptions_register_user (fclaw_app_t * app, void *package, sc_options_t * opt)\n{\n    user_options_t* user = (user_options_t*) package;\n\n    \/* [user] User options *\/\n    sc_options_add_int (opt, 0, \"example\", &user->example, 0,\n                        \"0 for no mapping, \"           \\\n                        \"1 for Cartesian (with brick), \"        \\\n                        \"2 for pillow disk, \"                   \\\n                        \"3 for squared disk, \"                  \\\n                        \"4 for pillow five patch\");\n\n    sc_options_add_int (opt, 0, \"example\", &user->example, 0,\n                        \"[user] 0 = nomap; 1 = cart; 2 = squared-disk; \" \\\n                        \"3 = annulus; 4 = pillow-disk [2]\");\n\n    sc_options_add_double (opt, 0, \"alpha\", &user->alpha, 0.5,\n                           \"[user] Ratio used for squared- and pillow-disk [0.5]\");\n\n    user->is_registered = 1;\n    return NULL;\n}\n\n\nstatic fclaw_exit_type_t\noptions_check_user (fclaw_app_t * app, void *package, void *registered)\n{\n    user_options_t* user = (user_options_t*) package;\n\n    if (user->example < 0 || user->example > 4) {\n        fclaw_global_essentialf (\"Option --user:example must be 0, 1, 2, 3 or 4\\n\");\n        return FCLAW_EXIT_QUIET;\n    }\n    if (user->example == 3 || user->example == 4)\n    {\n        if (user->gparms->mx*pow_int(2,user->gparms->minlevel) < 32)\n        {\n            fclaw_global_essentialf(\"The squared-disk or the pillowdisk5 \" \\\n                                    \"is inadmissable:  \" \\\n                                    \"mx*2^minlevel must be greater than \" \\\n                                    \"or equal to 32.\\n\");\n            return FCLAW_EXIT_QUIET;\n        }\n    }\n    return FCLAW_NOEXIT;\n}\n\n\nstatic const fclaw_app_options_vtable_t options_vtable_user =\n{\n    options_register_user,\n    NULL,\n    options_check_user,\n    NULL\n};\n\nstatic\nvoid register_user_options (fclaw_app_t * app,\n                            const char *configfile,\n                            user_options_t* user)\n{\n    FCLAW_ASSERT (app != NULL);\n    fclaw_app_options_register (app,\"user\", configfile, &options_vtable_user,\n                                user);\n}\n\n\nvoid run_program(fclaw_app_t* app, amr_options_t* gparms,\n                 fc2d_clawpack46_options_t* clawpack_options,\n                 user_options_t* user)\n{\n    sc_MPI_Comm            mpicomm;\n\n    \/* Mapped, multi-block domain *\/\n    p4est_connectivity_t     *conn = NULL;\n    fclaw2d_domain_t\t     *domain;\n    fclaw2d_map_context_t    *cont = NULL, *brick = NULL;\n\n    mpicomm = fclaw_app_get_mpi_size_rank (app, NULL, NULL);\n\n\n    \/* ---------------------------------------------------------------\n       Domain geometry\n       -------------------------------------------------------------- *\/\n    double pi = M_PI;\n    double rotate[2];\n    int mi, mj, a,b;\n\n    mpicomm = fclaw_app_get_mpi_size_rank (app, NULL, NULL);\n\n    rotate[0] = pi*gparms->theta\/180.0;\n    rotate[1] = pi*gparms->phi\/180.0;\n    mi = gparms->mi;\n    mj = gparms->mj;\n    a = gparms->periodic_x;\n    b = gparms->periodic_y;\n\n    switch (user->example) {\n    case 0:\n        \/* Size is set by [ax,bx] x [ay, by], set in .ini file *\/\n        conn = p4est_connectivity_new_unitsquare();\n        cont = fclaw2d_map_new_nomap();\n        break;\n    case 1:\n        \/* in [-1,1]x[-1,1] *\/\n        conn = p4est_connectivity_new_brick(mi,mj,a,b);\n        brick = fclaw2d_map_new_brick(conn,mi,mj);\n        cont = fclaw2d_map_new_cart(brick,gparms->scale,\n                                    gparms->shift,\n                                    rotate);\n        break;\n    case 2:\n        \/* Map unit square to the pillow disk using mapc2m_pillowdisk.f *\/\n        conn = p4est_connectivity_new_unitsquare();\n        cont = fclaw2d_map_new_pillowdisk(gparms->scale,gparms->shift,rotate);\n        break;\n    case 3:\n        conn = p4est_connectivity_new_disk ();\n        cont = fclaw2d_map_new_squareddisk (gparms->scale,gparms->shift,\n                                            rotate,user->alpha);\n        break;\n    case 4:\n        conn = p4est_connectivity_new_disk ();\n        cont = fclaw2d_map_new_pillowdisk5 (gparms->scale,gparms->shift,\n                                            rotate,user->alpha);\n        break;\n\n    default:\n        SC_ABORT_NOT_REACHED ();\n    }\n\n    domain = fclaw2d_domain_new_conn_map (mpicomm, gparms->minlevel, conn, cont);\n\n    fclaw2d_domain_list_levels(domain, FCLAW_VERBOSITY_ESSENTIAL);\n    fclaw2d_domain_list_neighbors(domain, FCLAW_VERBOSITY_DEBUG);\n\n    \/* ---------------------------------------------------------------\n       Set domain data.\n       --------------------------------------------------------------- *\/\n    init_domain_data(domain);\n\n    set_domain_parms(domain,gparms);\n    fc2d_clawpack46_set_options(domain,clawpack_options);\n\n    link_problem_setup(domain,filament_problem_setup);\n\n    filament_link_solvers(domain);\n\n    link_regrid_functions(domain,\n                          filament_patch_tag4refinement,\n                          filament_patch_tag4coarsening);\n\n    amrinit(&domain);\n    amrrun(&domain);\n    amrreset(&domain);\n\n    fclaw2d_map_destroy(cont);\n}\n\n\n\nint\nmain (int argc, char **argv)\n{\n  fclaw_app_t *app;\n  int first_arg;\n  fclaw_exit_type_t vexit;\n\n  \/* Options *\/\n  sc_options_t              *options;\n  amr_options_t             samr_options, *gparms = &samr_options;\n  fc2d_clawpack46_options_t  sclawpack_options, *clawpack_options = &sclawpack_options;\n  user_options_t                suser_options, *user = &suser_options;\n\n  int retval;\n\n  \/* Initialize application *\/\n  app = fclaw_app_new (&argc, &argv, user);\n  options = fclaw_app_get_options (app);\n\n  fclaw_options_register_general (app, \"fclaw_options.ini\", gparms);\n  fc2d_clawpack46_options_register(app,NULL,clawpack_options);\n\n  \/* User defined options (defined above) *\/\n  user->gparms = gparms;  \/* Needed for checking mx, my for examples 3 and 4 *\/\n  register_user_options (app, \"fclaw_options.ini\", user);\n\n\n  \/* Read configuration file(s) *\/\n  retval = fclaw_options_read_from_file(options);\n  vexit =  fclaw_app_options_parse (app, &first_arg,\"fclaw_options.ini.used\");\n\n  \/* -------------------------------------------------------------\n     - Run program\n     ------------------------------------------------------------- *\/\n  if (!retval & !vexit)\n  {\n      run_program(app, gparms, clawpack_options,user);\n  }\n\n  fclaw_app_destroy (app);\n\n  return 0;\n}\n<commit_msg>(filament) Shortened help message<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_single_step.h>\n#include <fc2d_clawpack46.H>\n#include <fclaw2d_map.h>\n#include <p4est_connectivity.h>\n\n#include <amr_forestclaw.H>\n#include <amr_utils.H>\n#include <fclaw2d_map_query.h>\n\n#include \"filament_user.H\"\n\ntypedef struct user_options\n{\n    int example;\n    double alpha;\n\n    amr_options_t* gparms;   \/* Need to check mx *\/\n\n    int is_registered;\n\n} user_options_t;\n\nstatic void *\noptions_register_user (fclaw_app_t * app, void *package, sc_options_t * opt)\n{\n    user_options_t* user = (user_options_t*) package;\n\n    \/* [user] User options *\/\n    sc_options_add_int (opt, 0, \"example\", &user->example, 0,\n                        \"[user] 0 = nomap; 1 = cart; 2 = pillowdisk; \" \\\n                        \"3 = squareddisk; 4 = pillowdisk5 [2]\");\n\n    sc_options_add_double (opt, 0, \"alpha\", &user->alpha, 0.5,\n                           \"[user] Ratio used for squared- and pillow-disk [0.5]\");\n\n    user->is_registered = 1;\n    return NULL;\n}\n\n\nstatic fclaw_exit_type_t\noptions_check_user (fclaw_app_t * app, void *package, void *registered)\n{\n    user_options_t* user = (user_options_t*) package;\n\n    if (user->example < 0 || user->example > 4) {\n        fclaw_global_essentialf (\"Option --user:example must be 0, 1, 2, 3 or 4\\n\");\n        return FCLAW_EXIT_QUIET;\n    }\n    if (user->example == 3 || user->example == 4)\n    {\n        if (user->gparms->mx*pow_int(2,user->gparms->minlevel) < 32)\n        {\n            fclaw_global_essentialf(\"The squared-disk or the pillowdisk5 \" \\\n                                    \"is inadmissable:  \" \\\n                                    \"mx*2^minlevel must be greater than \" \\\n                                    \"or equal to 32.\\n\");\n            return FCLAW_EXIT_QUIET;\n        }\n    }\n    return FCLAW_NOEXIT;\n}\n\n\nstatic const fclaw_app_options_vtable_t options_vtable_user =\n{\n    options_register_user,\n    NULL,\n    options_check_user,\n    NULL\n};\n\nstatic\nvoid register_user_options (fclaw_app_t * app,\n                            const char *configfile,\n                            user_options_t* user)\n{\n    FCLAW_ASSERT (app != NULL);\n    fclaw_app_options_register (app,\"user\", configfile, &options_vtable_user,\n                                user);\n}\n\n\nvoid run_program(fclaw_app_t* app, amr_options_t* gparms,\n                 fc2d_clawpack46_options_t* clawpack_options,\n                 user_options_t* user)\n{\n    sc_MPI_Comm            mpicomm;\n\n    \/* Mapped, multi-block domain *\/\n    p4est_connectivity_t     *conn = NULL;\n    fclaw2d_domain_t\t     *domain;\n    fclaw2d_map_context_t    *cont = NULL, *brick = NULL;\n\n    mpicomm = fclaw_app_get_mpi_size_rank (app, NULL, NULL);\n\n\n    \/* ---------------------------------------------------------------\n       Domain geometry\n       -------------------------------------------------------------- *\/\n    double pi = M_PI;\n    double rotate[2];\n    int mi, mj, a,b;\n\n    mpicomm = fclaw_app_get_mpi_size_rank (app, NULL, NULL);\n\n    rotate[0] = pi*gparms->theta\/180.0;\n    rotate[1] = pi*gparms->phi\/180.0;\n    mi = gparms->mi;\n    mj = gparms->mj;\n    a = gparms->periodic_x;\n    b = gparms->periodic_y;\n\n    switch (user->example) {\n    case 0:\n        \/* Size is set by [ax,bx] x [ay, by], set in .ini file *\/\n        conn = p4est_connectivity_new_unitsquare();\n        cont = fclaw2d_map_new_nomap();\n        break;\n    case 1:\n        \/* in [-1,1]x[-1,1] *\/\n        conn = p4est_connectivity_new_brick(mi,mj,a,b);\n        brick = fclaw2d_map_new_brick(conn,mi,mj);\n        cont = fclaw2d_map_new_cart(brick,gparms->scale,\n                                    gparms->shift,\n                                    rotate);\n        break;\n    case 2:\n        \/* Map unit square to the pillow disk using mapc2m_pillowdisk.f *\/\n        conn = p4est_connectivity_new_unitsquare();\n        cont = fclaw2d_map_new_pillowdisk(gparms->scale,gparms->shift,rotate);\n        break;\n    case 3:\n        conn = p4est_connectivity_new_disk ();\n        cont = fclaw2d_map_new_squareddisk (gparms->scale,gparms->shift,\n                                            rotate,user->alpha);\n        break;\n    case 4:\n        conn = p4est_connectivity_new_disk ();\n        cont = fclaw2d_map_new_pillowdisk5 (gparms->scale,gparms->shift,\n                                            rotate,user->alpha);\n        break;\n\n    default:\n        SC_ABORT_NOT_REACHED ();\n    }\n\n    domain = fclaw2d_domain_new_conn_map (mpicomm, gparms->minlevel, conn, cont);\n\n    fclaw2d_domain_list_levels(domain, FCLAW_VERBOSITY_ESSENTIAL);\n    fclaw2d_domain_list_neighbors(domain, FCLAW_VERBOSITY_DEBUG);\n\n    \/* ---------------------------------------------------------------\n       Set domain data.\n       --------------------------------------------------------------- *\/\n    init_domain_data(domain);\n\n    set_domain_parms(domain,gparms);\n    fc2d_clawpack46_set_options(domain,clawpack_options);\n\n    link_problem_setup(domain,filament_problem_setup);\n\n    filament_link_solvers(domain);\n\n    link_regrid_functions(domain,\n                          filament_patch_tag4refinement,\n                          filament_patch_tag4coarsening);\n\n    amrinit(&domain);\n    amrrun(&domain);\n    amrreset(&domain);\n\n    fclaw2d_map_destroy(cont);\n}\n\n\n\nint\nmain (int argc, char **argv)\n{\n  fclaw_app_t *app;\n  int first_arg;\n  fclaw_exit_type_t vexit;\n\n  \/* Options *\/\n  sc_options_t              *options;\n  amr_options_t             samr_options, *gparms = &samr_options;\n  fc2d_clawpack46_options_t  sclawpack_options, *clawpack_options = &sclawpack_options;\n  user_options_t                suser_options, *user = &suser_options;\n\n  int retval;\n\n  \/* Initialize application *\/\n  app = fclaw_app_new (&argc, &argv, user);\n  options = fclaw_app_get_options (app);\n\n  fclaw_options_register_general (app, \"fclaw_options.ini\", gparms);\n  fc2d_clawpack46_options_register(app,NULL,clawpack_options);\n\n  \/* User defined options (defined above) *\/\n  user->gparms = gparms;  \/* Needed for checking mx, my for examples 3 and 4 *\/\n  register_user_options (app, \"fclaw_options.ini\", user);\n\n\n  \/* Read configuration file(s) *\/\n  retval = fclaw_options_read_from_file(options);\n  vexit =  fclaw_app_options_parse (app, &first_arg,\"fclaw_options.ini.used\");\n\n  \/* -------------------------------------------------------------\n     - Run program\n     ------------------------------------------------------------- *\/\n  if (!retval & !vexit)\n  {\n      run_program(app, gparms, clawpack_options,user);\n  }\n\n  fclaw_app_destroy (app);\n\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 \"apps\/app_shim\/extension_app_shim_handler_mac.h\"\n\n#include \"apps\/app_lifetime_monitor_factory.h\"\n#include \"apps\/app_shim\/app_shim_host_manager_mac.h\"\n#include \"apps\/app_shim\/app_shim_messages.h\"\n#include \"apps\/native_app_window.h\"\n#include \"apps\/shell_window.h\"\n#include \"base\/files\/file_path.h\"\n#include \"base\/logging.h\"\n#include \"chrome\/browser\/browser_process.h\"\n#include \"chrome\/browser\/chrome_notification_types.h\"\n#include \"chrome\/browser\/extensions\/extension_host.h\"\n#include \"chrome\/browser\/extensions\/extension_service.h\"\n#include \"chrome\/browser\/extensions\/extension_system.h\"\n#include \"chrome\/browser\/extensions\/shell_window_registry.h\"\n#include \"chrome\/browser\/lifetime\/application_lifetime.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/profiles\/profile_manager.h\"\n#include \"chrome\/browser\/ui\/extensions\/application_launch.h\"\n#include \"chrome\/browser\/ui\/web_applications\/web_app_ui.h\"\n#include \"chrome\/browser\/web_applications\/web_app_mac.h\"\n#include \"content\/public\/browser\/notification_details.h\"\n#include \"content\/public\/browser\/notification_service.h\"\n#include \"content\/public\/browser\/notification_source.h\"\n#include \"ui\/base\/cocoa\/focus_window_set.h\"\n\nnamespace {\n\nvoid ProfileLoadedCallback(base::Callback<void(Profile*)> callback,\n                           Profile* profile,\n                           Profile::CreateStatus status) {\n  if (status == Profile::CREATE_STATUS_INITIALIZED) {\n    callback.Run(profile);\n    return;\n  }\n\n  \/\/ This should never get an error since it only loads existing profiles.\n  DCHECK_EQ(Profile::CREATE_STATUS_CREATED, status);\n}\n\nvoid TerminateIfNoShellWindows() {\n  bool shell_windows_left =\n      extensions::ShellWindowRegistry::IsShellWindowRegisteredInAnyProfile(0);\n  if (!shell_windows_left)\n    chrome::AttemptExit();\n}\n\n}  \/\/ namespace\n\nnamespace apps {\n\ntypedef extensions::ShellWindowRegistry::ShellWindowList ShellWindowList;\n\nbool ExtensionAppShimHandler::Delegate::ProfileExistsForPath(\n    const base::FilePath& path) {\n  ProfileManager* profile_manager = g_browser_process->profile_manager();\n  \/\/ Check for the profile name in the profile info cache to ensure that we\n  \/\/ never access any directory that isn't a known profile.\n  base::FilePath full_path = profile_manager->user_data_dir().Append(path);\n  ProfileInfoCache& cache = profile_manager->GetProfileInfoCache();\n  return cache.GetIndexOfProfileWithPath(full_path) != std::string::npos;\n}\n\nProfile* ExtensionAppShimHandler::Delegate::ProfileForPath(\n    const base::FilePath& path) {\n  ProfileManager* profile_manager = g_browser_process->profile_manager();\n  base::FilePath full_path = profile_manager->user_data_dir().Append(path);\n  Profile* profile = profile_manager->GetProfileByPath(full_path);\n\n  \/\/ Use IsValidProfile to check if the profile has been created.\n  return profile && profile_manager->IsValidProfile(profile) ? profile : NULL;\n}\n\nvoid ExtensionAppShimHandler::Delegate::LoadProfileAsync(\n    const base::FilePath& path,\n    base::Callback<void(Profile*)> callback) {\n  ProfileManager* profile_manager = g_browser_process->profile_manager();\n  base::FilePath full_path = profile_manager->user_data_dir().Append(path);\n  profile_manager->CreateProfileAsync(\n      full_path,\n      base::Bind(&ProfileLoadedCallback, callback),\n      string16(), string16(), std::string());\n}\n\nShellWindowList ExtensionAppShimHandler::Delegate::GetWindows(\n    Profile* profile,\n    const std::string& extension_id) {\n  return extensions::ShellWindowRegistry::Get(profile)->\n      GetShellWindowsForApp(extension_id);\n}\n\nconst extensions::Extension*\nExtensionAppShimHandler::Delegate::GetAppExtension(\n    Profile* profile,\n    const std::string& extension_id) {\n  ExtensionService* extension_service =\n      extensions::ExtensionSystem::Get(profile)->extension_service();\n  DCHECK(extension_service);\n  const extensions::Extension* extension =\n      extension_service->GetExtensionById(extension_id, false);\n  return extension && extension->is_platform_app() ? extension : NULL;\n}\n\nvoid ExtensionAppShimHandler::Delegate::LaunchApp(\n    Profile* profile,\n    const extensions::Extension* extension) {\n  chrome::OpenApplication(\n      chrome::AppLaunchParams(profile, extension, NEW_FOREGROUND_TAB));\n}\n\nvoid ExtensionAppShimHandler::Delegate::LaunchShim(\n    Profile* profile,\n    const extensions::Extension* extension) {\n  web_app::MaybeLaunchShortcut(\n      web_app::ShortcutInfoForExtensionAndProfile(extension, profile));\n}\n\nvoid ExtensionAppShimHandler::Delegate::MaybeTerminate() {\n  \/\/ Post this to give ShellWindows a chance to remove themselves from the\n  \/\/ registry.\n  base::MessageLoop::current()->PostTask(\n      FROM_HERE,\n      base::Bind(&TerminateIfNoShellWindows));\n}\n\nExtensionAppShimHandler::ExtensionAppShimHandler()\n    : delegate_(new Delegate),\n      browser_opened_ever_(false),\n      weak_factory_(this) {\n  \/\/ This is instantiated in BrowserProcessImpl::PreMainMessageLoopRun with\n  \/\/ AppShimHostManager. Since PROFILE_CREATED is not fired until\n  \/\/ ProfileManager::GetLastUsedProfile\/GetLastOpenedProfiles, this should catch\n  \/\/ notifications for all profiles.\n  registrar_.Add(this, chrome::NOTIFICATION_PROFILE_CREATED,\n                 content::NotificationService::AllBrowserContextsAndSources());\n  registrar_.Add(this, chrome::NOTIFICATION_PROFILE_DESTROYED,\n                 content::NotificationService::AllBrowserContextsAndSources());\n  registrar_.Add(this, chrome::NOTIFICATION_EXTENSION_UNINSTALLED,\n                 content::NotificationService::AllBrowserContextsAndSources());\n  registrar_.Add(this, chrome::NOTIFICATION_BROWSER_OPENED,\n                 content::NotificationService::AllBrowserContextsAndSources());\n}\n\nExtensionAppShimHandler::~ExtensionAppShimHandler() {}\n\nAppShimHandler::Host* ExtensionAppShimHandler::FindHost(\n    Profile* profile,\n    const std::string& app_id) {\n  HostMap::iterator it = hosts_.find(make_pair(profile, app_id));\n  return it == hosts_.end() ? NULL : it->second;\n}\n\n\/\/ static\nvoid ExtensionAppShimHandler::QuitAppForWindow(ShellWindow* shell_window) {\n  ExtensionAppShimHandler* handler =\n      g_browser_process->platform_part()->app_shim_host_manager()->\n          extension_app_shim_handler();\n  Host* host = handler->FindHost(shell_window->profile(),\n                                 shell_window->extension_id());\n  if (host) {\n    handler->OnShimQuit(host);\n  } else {\n    \/\/ App shims might be disabled or the shim is still starting up.\n    extensions::ShellWindowRegistry::Get(shell_window->profile())->\n        CloseAllShellWindowsForApp(shell_window->extension_id());\n  }\n}\n\nvoid ExtensionAppShimHandler::OnShimLaunch(Host* host,\n                                           AppShimLaunchType launch_type) {\n  const std::string& app_id = host->GetAppId();\n  DCHECK(extensions::Extension::IdIsValid(app_id));\n\n  const base::FilePath& profile_path = host->GetProfilePath();\n  DCHECK(!profile_path.empty());\n\n  if (!delegate_->ProfileExistsForPath(profile_path)) {\n    \/\/ User may have deleted the profile this shim was originally created for.\n    \/\/ TODO(jackhou): Add some UI for this case and remove the LOG.\n    LOG(ERROR) << \"Requested directory is not a known profile '\"\n               << profile_path.value() << \"'.\";\n    host->OnAppLaunchComplete(APP_SHIM_LAUNCH_PROFILE_NOT_FOUND);\n    return;\n  }\n\n  Profile* profile = delegate_->ProfileForPath(profile_path);\n\n  if (profile) {\n    OnProfileLoaded(host, launch_type, profile);\n    return;\n  }\n\n  \/\/ If the profile is not loaded, this must have been a launch by the shim.\n  \/\/ Load the profile asynchronously, the host will be registered in\n  \/\/ OnProfileLoaded.\n  DCHECK_EQ(APP_SHIM_LAUNCH_NORMAL, launch_type);\n  delegate_->LoadProfileAsync(\n      profile_path,\n      base::Bind(&ExtensionAppShimHandler::OnProfileLoaded,\n                 weak_factory_.GetWeakPtr(),\n                 host, launch_type));\n\n  \/\/ Return now. OnAppLaunchComplete will be called when the app is activated.\n}\n\nvoid ExtensionAppShimHandler::OnProfileLoaded(Host* host,\n                                              AppShimLaunchType launch_type,\n                                              Profile* profile) {\n  const std::string& app_id = host->GetAppId();\n  \/\/ TODO(jackhou): Add some UI for this case and remove the LOG.\n  const extensions::Extension* extension =\n      delegate_->GetAppExtension(profile, app_id);\n  if (!extension) {\n    LOG(ERROR) << \"Attempted to launch nonexistent app with id '\"\n               << app_id << \"'.\";\n    host->OnAppLaunchComplete(APP_SHIM_LAUNCH_APP_NOT_FOUND);\n    return;\n  }\n\n  \/\/ The first host to claim this (profile, app_id) becomes the main host.\n  \/\/ For any others, focus or relaunch the app.\n  if (!hosts_.insert(make_pair(make_pair(profile, app_id), host)).second) {\n    OnShimFocus(host,\n                launch_type == APP_SHIM_LAUNCH_NORMAL ?\n                    APP_SHIM_FOCUS_REOPEN : APP_SHIM_FOCUS_NORMAL);\n    host->OnAppLaunchComplete(APP_SHIM_LAUNCH_DUPLICATE_HOST);\n    return;\n  }\n\n  \/\/ TODO(jeremya): Handle the case that launching the app fails. Probably we\n  \/\/ need to watch for 'app successfully launched' or at least 'background page\n  \/\/ exists\/was created' and time out with failure if we don't see that sign of\n  \/\/ life within a certain window.\n  if (launch_type == APP_SHIM_LAUNCH_NORMAL)\n    delegate_->LaunchApp(profile, extension);\n  else\n    host->OnAppLaunchComplete(APP_SHIM_LAUNCH_SUCCESS);\n}\n\nvoid ExtensionAppShimHandler::OnShimClose(Host* host) {\n  \/\/ This might be called when shutting down. Don't try to look up the profile\n  \/\/ since profile_manager might not be around.\n  for (HostMap::iterator it = hosts_.begin(); it != hosts_.end(); ) {\n    HostMap::iterator current = it++;\n    if (current->second == host)\n      hosts_.erase(current);\n  }\n}\n\nvoid ExtensionAppShimHandler::OnShimFocus(Host* host,\n                                          AppShimFocusType focus_type) {\n  DCHECK(delegate_->ProfileExistsForPath(host->GetProfilePath()));\n  Profile* profile = delegate_->ProfileForPath(host->GetProfilePath());\n\n  const ShellWindowList windows =\n      delegate_->GetWindows(profile, host->GetAppId());\n  std::set<gfx::NativeWindow> native_windows;\n  for (ShellWindowList::const_iterator it = windows.begin();\n       it != windows.end(); ++it) {\n    native_windows.insert((*it)->GetNativeWindow());\n  }\n  if (!native_windows.empty()) {\n    ui::FocusWindowSet(native_windows);\n    return;\n  }\n\n  if (focus_type == APP_SHIM_FOCUS_REOPEN) {\n    const extensions::Extension* extension =\n        delegate_->GetAppExtension(profile, host->GetAppId());\n    if (extension) {\n      delegate_->LaunchApp(profile, extension);\n    } else {\n      \/\/ Extensions may have been uninstalled or disabled since the shim\n      \/\/ started.\n      host->OnAppClosed();\n    }\n  }\n}\n\nvoid ExtensionAppShimHandler::OnShimSetHidden(Host* host, bool hidden) {\n  DCHECK(delegate_->ProfileExistsForPath(host->GetProfilePath()));\n  Profile* profile = delegate_->ProfileForPath(host->GetProfilePath());\n\n  const ShellWindowList windows =\n      delegate_->GetWindows(profile, host->GetAppId());\n  for (ShellWindowList::const_reverse_iterator it = windows.rbegin();\n       it != windows.rend(); ++it) {\n    if (hidden)\n      (*it)->GetBaseWindow()->Hide();\n    else\n      (*it)->GetBaseWindow()->ShowInactive();\n  }\n}\n\nvoid ExtensionAppShimHandler::OnShimQuit(Host* host) {\n  DCHECK(delegate_->ProfileExistsForPath(host->GetProfilePath()));\n  Profile* profile = delegate_->ProfileForPath(host->GetProfilePath());\n\n  const std::string& app_id = host->GetAppId();\n  const ShellWindowList windows =\n      delegate_->GetWindows(profile, app_id);\n  for (extensions::ShellWindowRegistry::const_iterator it = windows.begin();\n       it != windows.end(); ++it) {\n    (*it)->GetBaseWindow()->Close();\n  }\n\n  DCHECK_NE(0u, hosts_.count(make_pair(profile, app_id)));\n  host->OnAppClosed();\n\n  if (!browser_opened_ever_ && hosts_.empty())\n    delegate_->MaybeTerminate();\n}\n\nvoid ExtensionAppShimHandler::set_delegate(Delegate* delegate) {\n  delegate_.reset(delegate);\n}\n\nvoid ExtensionAppShimHandler::Observe(\n    int type,\n    const content::NotificationSource& source,\n    const content::NotificationDetails& details) {\n  if (type == chrome::NOTIFICATION_BROWSER_OPENED) {\n    registrar_.Remove(\n        this, chrome::NOTIFICATION_BROWSER_OPENED,\n        content::NotificationService::AllBrowserContextsAndSources());\n    browser_opened_ever_ = true;\n    return;\n  }\n\n  Profile* profile = content::Source<Profile>(source).ptr();\n  if (profile->IsOffTheRecord())\n    return;\n\n  switch (type) {\n    case chrome::NOTIFICATION_PROFILE_CREATED: {\n      AppLifetimeMonitorFactory::GetForProfile(profile)->AddObserver(this);\n      break;\n    }\n    case chrome::NOTIFICATION_PROFILE_DESTROYED: {\n      AppLifetimeMonitorFactory::GetForProfile(profile)->RemoveObserver(this);\n      \/\/ Shut down every shim associated with this profile.\n      for (HostMap::iterator it = hosts_.begin(); it != hosts_.end(); ) {\n        \/\/ Increment the iterator first as OnAppClosed may call back to\n        \/\/ OnShimClose and invalidate the iterator.\n        HostMap::iterator current = it++;\n        if (profile->IsSameProfile(current->first.first))\n          current->second->OnAppClosed();\n      }\n      break;\n    }\n    case chrome::NOTIFICATION_EXTENSION_UNINSTALLED: {\n      const std::string& app_id =\n          content::Details<extensions::Extension>(details).ptr()->id();\n      Host* host = FindHost(profile, app_id);\n      if (host)\n        host->OnAppClosed();\n      break;\n    }\n    default: {\n      NOTREACHED();  \/\/ Unexpected notification.\n      break;\n    }\n  }\n}\n\nvoid ExtensionAppShimHandler::OnAppStart(Profile* profile,\n                                         const std::string& app_id) {}\n\nvoid ExtensionAppShimHandler::OnAppActivated(Profile* profile,\n                                             const std::string& app_id) {\n  const extensions::Extension* extension =\n      delegate_->GetAppExtension(profile, app_id);\n  if (!extension)\n    return;\n\n  Host* host = FindHost(profile, app_id);\n  if (host) {\n    host->OnAppLaunchComplete(APP_SHIM_LAUNCH_SUCCESS);\n    OnShimFocus(host, APP_SHIM_FOCUS_NORMAL);\n    return;\n  }\n\n  delegate_->LaunchShim(profile, extension);\n}\n\nvoid ExtensionAppShimHandler::OnAppDeactivated(Profile* profile,\n                                               const std::string& app_id) {}\n\nvoid ExtensionAppShimHandler::OnAppStop(Profile* profile,\n                                        const std::string& app_id) {}\n\nvoid ExtensionAppShimHandler::OnChromeTerminating() {}\n\n}  \/\/ namespace apps\n<commit_msg>[mac] Close a shim process if an app crashes or is terminated from task manager.<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 \"apps\/app_shim\/extension_app_shim_handler_mac.h\"\n\n#include \"apps\/app_lifetime_monitor_factory.h\"\n#include \"apps\/app_shim\/app_shim_host_manager_mac.h\"\n#include \"apps\/app_shim\/app_shim_messages.h\"\n#include \"apps\/native_app_window.h\"\n#include \"apps\/shell_window.h\"\n#include \"base\/files\/file_path.h\"\n#include \"base\/logging.h\"\n#include \"chrome\/browser\/browser_process.h\"\n#include \"chrome\/browser\/chrome_notification_types.h\"\n#include \"chrome\/browser\/extensions\/extension_host.h\"\n#include \"chrome\/browser\/extensions\/extension_service.h\"\n#include \"chrome\/browser\/extensions\/extension_system.h\"\n#include \"chrome\/browser\/extensions\/shell_window_registry.h\"\n#include \"chrome\/browser\/lifetime\/application_lifetime.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/profiles\/profile_manager.h\"\n#include \"chrome\/browser\/ui\/extensions\/application_launch.h\"\n#include \"chrome\/browser\/ui\/web_applications\/web_app_ui.h\"\n#include \"chrome\/browser\/web_applications\/web_app_mac.h\"\n#include \"content\/public\/browser\/notification_details.h\"\n#include \"content\/public\/browser\/notification_service.h\"\n#include \"content\/public\/browser\/notification_source.h\"\n#include \"ui\/base\/cocoa\/focus_window_set.h\"\n\nnamespace {\n\nvoid ProfileLoadedCallback(base::Callback<void(Profile*)> callback,\n                           Profile* profile,\n                           Profile::CreateStatus status) {\n  if (status == Profile::CREATE_STATUS_INITIALIZED) {\n    callback.Run(profile);\n    return;\n  }\n\n  \/\/ This should never get an error since it only loads existing profiles.\n  DCHECK_EQ(Profile::CREATE_STATUS_CREATED, status);\n}\n\nvoid TerminateIfNoShellWindows() {\n  bool shell_windows_left =\n      extensions::ShellWindowRegistry::IsShellWindowRegisteredInAnyProfile(0);\n  if (!shell_windows_left)\n    chrome::AttemptExit();\n}\n\n}  \/\/ namespace\n\nnamespace apps {\n\ntypedef extensions::ShellWindowRegistry::ShellWindowList ShellWindowList;\n\nbool ExtensionAppShimHandler::Delegate::ProfileExistsForPath(\n    const base::FilePath& path) {\n  ProfileManager* profile_manager = g_browser_process->profile_manager();\n  \/\/ Check for the profile name in the profile info cache to ensure that we\n  \/\/ never access any directory that isn't a known profile.\n  base::FilePath full_path = profile_manager->user_data_dir().Append(path);\n  ProfileInfoCache& cache = profile_manager->GetProfileInfoCache();\n  return cache.GetIndexOfProfileWithPath(full_path) != std::string::npos;\n}\n\nProfile* ExtensionAppShimHandler::Delegate::ProfileForPath(\n    const base::FilePath& path) {\n  ProfileManager* profile_manager = g_browser_process->profile_manager();\n  base::FilePath full_path = profile_manager->user_data_dir().Append(path);\n  Profile* profile = profile_manager->GetProfileByPath(full_path);\n\n  \/\/ Use IsValidProfile to check if the profile has been created.\n  return profile && profile_manager->IsValidProfile(profile) ? profile : NULL;\n}\n\nvoid ExtensionAppShimHandler::Delegate::LoadProfileAsync(\n    const base::FilePath& path,\n    base::Callback<void(Profile*)> callback) {\n  ProfileManager* profile_manager = g_browser_process->profile_manager();\n  base::FilePath full_path = profile_manager->user_data_dir().Append(path);\n  profile_manager->CreateProfileAsync(\n      full_path,\n      base::Bind(&ProfileLoadedCallback, callback),\n      string16(), string16(), std::string());\n}\n\nShellWindowList ExtensionAppShimHandler::Delegate::GetWindows(\n    Profile* profile,\n    const std::string& extension_id) {\n  return extensions::ShellWindowRegistry::Get(profile)->\n      GetShellWindowsForApp(extension_id);\n}\n\nconst extensions::Extension*\nExtensionAppShimHandler::Delegate::GetAppExtension(\n    Profile* profile,\n    const std::string& extension_id) {\n  ExtensionService* extension_service =\n      extensions::ExtensionSystem::Get(profile)->extension_service();\n  DCHECK(extension_service);\n  const extensions::Extension* extension =\n      extension_service->GetExtensionById(extension_id, false);\n  return extension && extension->is_platform_app() ? extension : NULL;\n}\n\nvoid ExtensionAppShimHandler::Delegate::LaunchApp(\n    Profile* profile,\n    const extensions::Extension* extension) {\n  chrome::OpenApplication(\n      chrome::AppLaunchParams(profile, extension, NEW_FOREGROUND_TAB));\n}\n\nvoid ExtensionAppShimHandler::Delegate::LaunchShim(\n    Profile* profile,\n    const extensions::Extension* extension) {\n  web_app::MaybeLaunchShortcut(\n      web_app::ShortcutInfoForExtensionAndProfile(extension, profile));\n}\n\nvoid ExtensionAppShimHandler::Delegate::MaybeTerminate() {\n  \/\/ Post this to give ShellWindows a chance to remove themselves from the\n  \/\/ registry.\n  base::MessageLoop::current()->PostTask(\n      FROM_HERE,\n      base::Bind(&TerminateIfNoShellWindows));\n}\n\nExtensionAppShimHandler::ExtensionAppShimHandler()\n    : delegate_(new Delegate),\n      browser_opened_ever_(false),\n      weak_factory_(this) {\n  \/\/ This is instantiated in BrowserProcessImpl::PreMainMessageLoopRun with\n  \/\/ AppShimHostManager. Since PROFILE_CREATED is not fired until\n  \/\/ ProfileManager::GetLastUsedProfile\/GetLastOpenedProfiles, this should catch\n  \/\/ notifications for all profiles.\n  registrar_.Add(this, chrome::NOTIFICATION_PROFILE_CREATED,\n                 content::NotificationService::AllBrowserContextsAndSources());\n  registrar_.Add(this, chrome::NOTIFICATION_PROFILE_DESTROYED,\n                 content::NotificationService::AllBrowserContextsAndSources());\n  registrar_.Add(this, chrome::NOTIFICATION_EXTENSION_UNINSTALLED,\n                 content::NotificationService::AllBrowserContextsAndSources());\n  registrar_.Add(this, chrome::NOTIFICATION_EXTENSION_PROCESS_TERMINATED,\n                 content::NotificationService::AllBrowserContextsAndSources());\n  registrar_.Add(this, chrome::NOTIFICATION_BROWSER_OPENED,\n                 content::NotificationService::AllBrowserContextsAndSources());\n}\n\nExtensionAppShimHandler::~ExtensionAppShimHandler() {}\n\nAppShimHandler::Host* ExtensionAppShimHandler::FindHost(\n    Profile* profile,\n    const std::string& app_id) {\n  HostMap::iterator it = hosts_.find(make_pair(profile, app_id));\n  return it == hosts_.end() ? NULL : it->second;\n}\n\n\/\/ static\nvoid ExtensionAppShimHandler::QuitAppForWindow(ShellWindow* shell_window) {\n  ExtensionAppShimHandler* handler =\n      g_browser_process->platform_part()->app_shim_host_manager()->\n          extension_app_shim_handler();\n  Host* host = handler->FindHost(shell_window->profile(),\n                                 shell_window->extension_id());\n  if (host) {\n    handler->OnShimQuit(host);\n  } else {\n    \/\/ App shims might be disabled or the shim is still starting up.\n    extensions::ShellWindowRegistry::Get(shell_window->profile())->\n        CloseAllShellWindowsForApp(shell_window->extension_id());\n  }\n}\n\nvoid ExtensionAppShimHandler::OnShimLaunch(Host* host,\n                                           AppShimLaunchType launch_type) {\n  const std::string& app_id = host->GetAppId();\n  DCHECK(extensions::Extension::IdIsValid(app_id));\n\n  const base::FilePath& profile_path = host->GetProfilePath();\n  DCHECK(!profile_path.empty());\n\n  if (!delegate_->ProfileExistsForPath(profile_path)) {\n    \/\/ User may have deleted the profile this shim was originally created for.\n    \/\/ TODO(jackhou): Add some UI for this case and remove the LOG.\n    LOG(ERROR) << \"Requested directory is not a known profile '\"\n               << profile_path.value() << \"'.\";\n    host->OnAppLaunchComplete(APP_SHIM_LAUNCH_PROFILE_NOT_FOUND);\n    return;\n  }\n\n  Profile* profile = delegate_->ProfileForPath(profile_path);\n\n  if (profile) {\n    OnProfileLoaded(host, launch_type, profile);\n    return;\n  }\n\n  \/\/ If the profile is not loaded, this must have been a launch by the shim.\n  \/\/ Load the profile asynchronously, the host will be registered in\n  \/\/ OnProfileLoaded.\n  DCHECK_EQ(APP_SHIM_LAUNCH_NORMAL, launch_type);\n  delegate_->LoadProfileAsync(\n      profile_path,\n      base::Bind(&ExtensionAppShimHandler::OnProfileLoaded,\n                 weak_factory_.GetWeakPtr(),\n                 host, launch_type));\n\n  \/\/ Return now. OnAppLaunchComplete will be called when the app is activated.\n}\n\nvoid ExtensionAppShimHandler::OnProfileLoaded(Host* host,\n                                              AppShimLaunchType launch_type,\n                                              Profile* profile) {\n  const std::string& app_id = host->GetAppId();\n  \/\/ TODO(jackhou): Add some UI for this case and remove the LOG.\n  const extensions::Extension* extension =\n      delegate_->GetAppExtension(profile, app_id);\n  if (!extension) {\n    LOG(ERROR) << \"Attempted to launch nonexistent app with id '\"\n               << app_id << \"'.\";\n    host->OnAppLaunchComplete(APP_SHIM_LAUNCH_APP_NOT_FOUND);\n    return;\n  }\n\n  \/\/ The first host to claim this (profile, app_id) becomes the main host.\n  \/\/ For any others, focus or relaunch the app.\n  if (!hosts_.insert(make_pair(make_pair(profile, app_id), host)).second) {\n    OnShimFocus(host,\n                launch_type == APP_SHIM_LAUNCH_NORMAL ?\n                    APP_SHIM_FOCUS_REOPEN : APP_SHIM_FOCUS_NORMAL);\n    host->OnAppLaunchComplete(APP_SHIM_LAUNCH_DUPLICATE_HOST);\n    return;\n  }\n\n  \/\/ TODO(jeremya): Handle the case that launching the app fails. Probably we\n  \/\/ need to watch for 'app successfully launched' or at least 'background page\n  \/\/ exists\/was created' and time out with failure if we don't see that sign of\n  \/\/ life within a certain window.\n  if (launch_type == APP_SHIM_LAUNCH_NORMAL)\n    delegate_->LaunchApp(profile, extension);\n  else\n    host->OnAppLaunchComplete(APP_SHIM_LAUNCH_SUCCESS);\n}\n\nvoid ExtensionAppShimHandler::OnShimClose(Host* host) {\n  \/\/ This might be called when shutting down. Don't try to look up the profile\n  \/\/ since profile_manager might not be around.\n  for (HostMap::iterator it = hosts_.begin(); it != hosts_.end(); ) {\n    HostMap::iterator current = it++;\n    if (current->second == host)\n      hosts_.erase(current);\n  }\n}\n\nvoid ExtensionAppShimHandler::OnShimFocus(Host* host,\n                                          AppShimFocusType focus_type) {\n  DCHECK(delegate_->ProfileExistsForPath(host->GetProfilePath()));\n  Profile* profile = delegate_->ProfileForPath(host->GetProfilePath());\n\n  const ShellWindowList windows =\n      delegate_->GetWindows(profile, host->GetAppId());\n  std::set<gfx::NativeWindow> native_windows;\n  for (ShellWindowList::const_iterator it = windows.begin();\n       it != windows.end(); ++it) {\n    native_windows.insert((*it)->GetNativeWindow());\n  }\n  if (!native_windows.empty()) {\n    ui::FocusWindowSet(native_windows);\n    return;\n  }\n\n  if (focus_type == APP_SHIM_FOCUS_REOPEN) {\n    const extensions::Extension* extension =\n        delegate_->GetAppExtension(profile, host->GetAppId());\n    if (extension) {\n      delegate_->LaunchApp(profile, extension);\n    } else {\n      \/\/ Extensions may have been uninstalled or disabled since the shim\n      \/\/ started.\n      host->OnAppClosed();\n    }\n  }\n}\n\nvoid ExtensionAppShimHandler::OnShimSetHidden(Host* host, bool hidden) {\n  DCHECK(delegate_->ProfileExistsForPath(host->GetProfilePath()));\n  Profile* profile = delegate_->ProfileForPath(host->GetProfilePath());\n\n  const ShellWindowList windows =\n      delegate_->GetWindows(profile, host->GetAppId());\n  for (ShellWindowList::const_reverse_iterator it = windows.rbegin();\n       it != windows.rend(); ++it) {\n    if (hidden)\n      (*it)->GetBaseWindow()->Hide();\n    else\n      (*it)->GetBaseWindow()->ShowInactive();\n  }\n}\n\nvoid ExtensionAppShimHandler::OnShimQuit(Host* host) {\n  DCHECK(delegate_->ProfileExistsForPath(host->GetProfilePath()));\n  Profile* profile = delegate_->ProfileForPath(host->GetProfilePath());\n\n  const std::string& app_id = host->GetAppId();\n  const ShellWindowList windows =\n      delegate_->GetWindows(profile, app_id);\n  for (extensions::ShellWindowRegistry::const_iterator it = windows.begin();\n       it != windows.end(); ++it) {\n    (*it)->GetBaseWindow()->Close();\n  }\n\n  DCHECK_NE(0u, hosts_.count(make_pair(profile, app_id)));\n  host->OnAppClosed();\n\n  if (!browser_opened_ever_ && hosts_.empty())\n    delegate_->MaybeTerminate();\n}\n\nvoid ExtensionAppShimHandler::set_delegate(Delegate* delegate) {\n  delegate_.reset(delegate);\n}\n\nvoid ExtensionAppShimHandler::Observe(\n    int type,\n    const content::NotificationSource& source,\n    const content::NotificationDetails& details) {\n  if (type == chrome::NOTIFICATION_BROWSER_OPENED) {\n    registrar_.Remove(\n        this, chrome::NOTIFICATION_BROWSER_OPENED,\n        content::NotificationService::AllBrowserContextsAndSources());\n    browser_opened_ever_ = true;\n    return;\n  }\n\n  Profile* profile = content::Source<Profile>(source).ptr();\n  if (profile->IsOffTheRecord())\n    return;\n\n  switch (type) {\n    case chrome::NOTIFICATION_PROFILE_CREATED: {\n      AppLifetimeMonitorFactory::GetForProfile(profile)->AddObserver(this);\n      break;\n    }\n    case chrome::NOTIFICATION_PROFILE_DESTROYED: {\n      AppLifetimeMonitorFactory::GetForProfile(profile)->RemoveObserver(this);\n      \/\/ Shut down every shim associated with this profile.\n      for (HostMap::iterator it = hosts_.begin(); it != hosts_.end(); ) {\n        \/\/ Increment the iterator first as OnAppClosed may call back to\n        \/\/ OnShimClose and invalidate the iterator.\n        HostMap::iterator current = it++;\n        if (profile->IsSameProfile(current->first.first))\n          current->second->OnAppClosed();\n      }\n      break;\n    }\n    case chrome::NOTIFICATION_EXTENSION_PROCESS_TERMINATED:\n    case chrome::NOTIFICATION_EXTENSION_UNINSTALLED: {\n      std::string app_id;\n      if (type == chrome::NOTIFICATION_EXTENSION_PROCESS_TERMINATED) {\n        app_id = content::Details<extensions::ExtensionHost>(details).ptr()\n            ->extension_id();\n      } else {\n        app_id = content::Details<extensions::Extension>(details).ptr()->id();\n      }\n      Host* host = FindHost(profile, app_id);\n      if (host)\n        host->OnAppClosed();\n      break;\n    }\n    default: {\n      NOTREACHED();  \/\/ Unexpected notification.\n      break;\n    }\n  }\n}\n\nvoid ExtensionAppShimHandler::OnAppStart(Profile* profile,\n                                         const std::string& app_id) {}\n\nvoid ExtensionAppShimHandler::OnAppActivated(Profile* profile,\n                                             const std::string& app_id) {\n  const extensions::Extension* extension =\n      delegate_->GetAppExtension(profile, app_id);\n  if (!extension)\n    return;\n\n  Host* host = FindHost(profile, app_id);\n  if (host) {\n    host->OnAppLaunchComplete(APP_SHIM_LAUNCH_SUCCESS);\n    OnShimFocus(host, APP_SHIM_FOCUS_NORMAL);\n    return;\n  }\n\n  delegate_->LaunchShim(profile, extension);\n}\n\nvoid ExtensionAppShimHandler::OnAppDeactivated(Profile* profile,\n                                               const std::string& app_id) {}\n\nvoid ExtensionAppShimHandler::OnAppStop(Profile* profile,\n                                        const std::string& app_id) {}\n\nvoid ExtensionAppShimHandler::OnChromeTerminating() {}\n\n}  \/\/ namespace apps\n<|endoftext|>"}
{"text":"<commit_before>#ifndef RDB_PROTOCOL_TERMS_TYPE_MANIP_HPP_\n#define RDB_PROTOCOL_TERMS_TYPE_MANIP_HPP_\n\n#include <algorithm>\n#include <map>\n#include <string>\n\n#include \"rdb_protocol\/op.hpp\"\n#include \"rdb_protocol\/err.hpp\"\n\nnamespace ql {\n\n\/\/ TODO: Make this whole file not suck.\n\n\/\/ Some Problems:\n\/\/ * The method of constructing a canonical type from supertype * MAX_TYPE +\n\/\/   subtype is brittle.\n\/\/ * Everything is done with nested ifs.  Ideally we'd build some sort of graph\n\/\/   structure and walk it.\n\nstatic const int MAX_TYPE = 10;\n\nstatic const int DB_TYPE = val_t::type_t::DB * MAX_TYPE;\nstatic const int TABLE_TYPE = val_t::type_t::TABLE * MAX_TYPE;\nstatic const int SELECTION_TYPE = val_t::type_t::SELECTION * MAX_TYPE;\nstatic const int SEQUENCE_TYPE = val_t::type_t::SEQUENCE * MAX_TYPE;\nstatic const int SINGLE_SELECTION_TYPE = val_t::type_t::SINGLE_SELECTION * MAX_TYPE;\nstatic const int DATUM_TYPE = val_t::type_t::DATUM * MAX_TYPE;\nstatic const int FUNC_TYPE = val_t::type_t::FUNC * MAX_TYPE;\n\nstatic const int R_NULL_TYPE = val_t::type_t::DATUM * MAX_TYPE + datum_t::R_NULL;\nstatic const int R_BOOL_TYPE = val_t::type_t::DATUM * MAX_TYPE + datum_t::R_BOOL;\nstatic const int R_NUM_TYPE = val_t::type_t::DATUM * MAX_TYPE + datum_t::R_NUM;\nstatic const int R_STR_TYPE = val_t::type_t::DATUM * MAX_TYPE + datum_t::R_STR;\nstatic const int R_ARRAY_TYPE = val_t::type_t::DATUM * MAX_TYPE + datum_t::R_ARRAY;\nstatic const int R_OBJECT_TYPE = val_t::type_t::DATUM * MAX_TYPE + datum_t::R_OBJECT;\n\nclass coerce_map_t {\npublic:\n    coerce_map_t() {\n        map[\"DB\"] = DB_TYPE;\n        map[\"TABLE\"] = TABLE_TYPE;\n        map[\"SELECTION\"] = SELECTION_TYPE;\n        map[\"STREAM\"] = SEQUENCE_TYPE;\n        map[\"SINGLE_SELECTION\"] = SINGLE_SELECTION_TYPE;\n        map[\"DATUM\"] = DATUM_TYPE;\n        map[\"FUNCTION\"] = FUNC_TYPE;\n        CT_ASSERT(val_t::type_t::FUNC < MAX_TYPE);\n\n        map[\"NULL\"] = R_NULL_TYPE;\n        map[\"BOOL\"] = R_BOOL_TYPE;\n        map[\"NUMBER\"] = R_NUM_TYPE;\n        map[\"STRING\"] = R_STR_TYPE;\n        map[\"ARRAY\"] = R_ARRAY_TYPE;\n        map[\"OBJECT\"] = R_OBJECT_TYPE;\n        CT_ASSERT(datum_t::R_OBJECT < MAX_TYPE);\n\n        for (std::map<std::string, int>::iterator\n                 it = map.begin(); it != map.end(); ++it) {\n            rmap[it->second] = it->first;\n        }\n    }\n    int get_type(const std::string &s, const rcheckable_t *caller) const {\n        std::map<std::string, int>::const_iterator it = map.find(s);\n        rcheck_target(caller, it != map.end(), strprintf(\"Unknown Type: %s\", s.c_str()));\n        return it->second;\n    }\n    std::string get_name(int type) const {\n        std::map<int, std::string>::const_iterator it = rmap.find(type);\n        r_sanity_check(it != rmap.end());\n        return it->second;\n    }\nprivate:\n    std::map<std::string, int> map;\n    std::map<int, std::string> rmap;\n\n    \/\/ These functions are here so that if you add a new type you have to update\n    \/\/ this file.\n    \/\/ THINGS TO DO:\n    \/\/ * Update the coerce map\n    \/\/ * Add the various coercions\n    \/\/ * !!! CHECK WHETHER WE HAVE MORE THAN MAX_TYPE TYPES AND INCREASE !!!\n    \/\/   !!! MAX_TYPE IF WE DO                                           !!!\n    void NOCALL_ct_catch_new_types(val_t::type_t::raw_type_t t, datum_t::type_t t2) {\n        switch (t) {\n        case val_t::type_t::DB:\n        case val_t::type_t::TABLE:\n        case val_t::type_t::SELECTION:\n        case val_t::type_t::SEQUENCE:\n        case val_t::type_t::SINGLE_SELECTION:\n        case val_t::type_t::DATUM:\n        case val_t::type_t::FUNC:\n        default: break;\n        }\n        switch (t2) {\n        case datum_t::R_NULL:\n        case datum_t::R_BOOL:\n        case datum_t::R_NUM:\n        case datum_t::R_STR:\n        case datum_t::R_ARRAY:\n        case datum_t::R_OBJECT:\n        default: break;\n        }\n    }\n};\n\nstatic const coerce_map_t _coerce_map;\nstatic int get_type(std::string s, const rcheckable_t *caller) {\n    std::transform(s.begin(), s.end(), s.begin(), ::toupper);\n    return _coerce_map.get_type(s, caller);\n}\nstatic std::string get_name(int type) {\n    return _coerce_map.get_name(type);\n}\n\nstatic val_t::type_t::raw_type_t supertype(int type) {\n    return static_cast<val_t::type_t::raw_type_t>(type \/ MAX_TYPE);\n}\nstatic datum_t::type_t subtype(int type) {\n    return static_cast<datum_t::type_t>(type - supertype(type));\n}\nstatic int merge_types(int supertype, int subtype) {\n    return supertype * MAX_TYPE + subtype;\n}\n\nclass coerce_term_t : public op_term_t {\npublic:\n    coerce_term_t(env_t *env, const Term2 *term) : op_term_t(env, term, argspec_t(2)) { }\nprivate:\n    virtual val_t *eval_impl() {\n        val_t *val = arg(0);\n        val_t::type_t opaque_start_type = val->get_type();\n        int start_supertype = opaque_start_type.raw_type;\n        int start_subtype = 0;\n        if (opaque_start_type.is_convertible(val_t::type_t::DATUM)) {\n            start_supertype = val_t::type_t::DATUM;\n            start_subtype = val->as_datum()->get_type();\n        }\n        int start_type = merge_types(start_supertype, start_subtype);\n\n        std::string end_type_name = arg(1)->as_str();\n        int end_type = get_type(end_type_name, this);\n\n        \/\/ Identity\n        if (!subtype(end_type)\n            && opaque_start_type.is_convertible(supertype(end_type))) {\n            return val;\n        }\n\n        \/\/ DATUM -> *\n        if (opaque_start_type.is_convertible(val_t::type_t::DATUM)) {\n            const datum_t *d = val->as_datum();\n            \/\/ DATUM -> DATUM\n            if (supertype(end_type) == val_t::type_t::DATUM) {\n                \/\/ DATUM -> STR\n                if (end_type == R_STR_TYPE) {\n                    return new_val(new datum_t(d->print()));\n                }\n\n                \/\/ OBJECT -> ARRAY\n                if (start_type == R_OBJECT_TYPE && end_type == R_ARRAY_TYPE) {\n                    datum_t *arr = env->add_ptr(new datum_t(datum_t::R_ARRAY));\n                    const std::map<const std::string, const datum_t *> &obj =\n                        d->as_object();\n                    for (std::map<const std::string, const datum_t *>::const_iterator\n                             it = obj.begin(); it != obj.end(); ++it) {\n                        datum_t *pair = env->add_ptr(new datum_t(datum_t::R_ARRAY));\n                        pair->add(env->add_ptr(new datum_t(it->first)));\n                        pair->add(it->second);\n                        arr->add(pair);\n                    }\n                    return new_val(arr);\n                }\n\n            }\n            \/\/ TODO: Object to sequence?\n        }\n\n        if (opaque_start_type.is_convertible(val_t::type_t::SEQUENCE)) {\n            datum_stream_t *ds;\n            try {\n                ds = val->as_seq();\n            } catch (const exc_t &e) {\n                rfail(\"Cannot coerce %s to %s (failed to produce intermediate stream).\",\n                      get_name(start_type).c_str(), get_name(end_type).c_str());\n                unreachable();\n            }\n            \/\/ SEQUENCE -> ARRAY\n            if (end_type == R_ARRAY_TYPE || end_type == DATUM_TYPE) {\n                datum_t *arr = env->add_ptr(new datum_t(datum_t::R_ARRAY));\n                while (const datum_t *el = ds->next()) arr->add(el);\n                return new_val(arr);\n            }\n\n            \/\/ SEQUENCE -> OBJECT\n            if (end_type == R_OBJECT_TYPE) {\n                if (start_type == R_ARRAY_TYPE && end_type == R_OBJECT_TYPE) {\n                    datum_t *obj = env->add_ptr(new datum_t(datum_t::R_OBJECT));\n                    while (const datum_t *pair = ds->next()) {\n                        std::string key = pair->el(0)->as_str();\n                        const datum_t *keyval = pair->el(1);\n                        bool b = obj->add(key, keyval);\n                        rcheck(!b, strprintf(\"Duplicate key %s in coerced object.  \"\n                                             \"(got %s and %s as values)\",\n                                             key.c_str(),\n                                             obj->el(key)->print().c_str(),\n                                             keyval->print().c_str()));\n                    }\n                    return new_val(obj);\n                }\n            }\n        }\n\n        rfail(\"Cannot coerce %s to %s.\",\n              get_name(start_type).c_str(), get_name(end_type).c_str());\n        unreachable();\n    }\n    RDB_NAME(\"coerce_to\");\n};\n\nclass typeof_term_t : public op_term_t {\npublic:\n    typeof_term_t(env_t *env, const Term2 *term) : op_term_t(env, term, argspec_t(1)) { }\nprivate:\n    virtual val_t *eval_impl() {\n        val_t *v0 = arg(0);\n        int t = v0->get_type().raw_type * MAX_TYPE;\n        if (t == DATUM_TYPE) t += v0->as_datum()->get_type();\n        return new_val(get_name(t));\n    }\n    RDB_NAME(\"typeof\");\n};\n\n} \/\/ namespace ql\n\n#endif \/\/ RDB_PROTOCOL_TERMS_TYPE_MANIP_HPP_\n<commit_msg>fixed coercions<commit_after>#ifndef RDB_PROTOCOL_TERMS_TYPE_MANIP_HPP_\n#define RDB_PROTOCOL_TERMS_TYPE_MANIP_HPP_\n\n#include <algorithm>\n#include <map>\n#include <string>\n\n#include \"rdb_protocol\/op.hpp\"\n#include \"rdb_protocol\/err.hpp\"\n\nnamespace ql {\n\n\/\/ TODO: Make this whole file not suck.\n\n\/\/ Some Problems:\n\/\/ * The method of constructing a canonical type from supertype * MAX_TYPE +\n\/\/   subtype is brittle.\n\/\/ * Everything is done with nested ifs.  Ideally we'd build some sort of graph\n\/\/   structure and walk it.\n\nstatic const int MAX_TYPE = 10;\n\nstatic const int DB_TYPE = val_t::type_t::DB * MAX_TYPE;\nstatic const int TABLE_TYPE = val_t::type_t::TABLE * MAX_TYPE;\nstatic const int SELECTION_TYPE = val_t::type_t::SELECTION * MAX_TYPE;\nstatic const int SEQUENCE_TYPE = val_t::type_t::SEQUENCE * MAX_TYPE;\nstatic const int SINGLE_SELECTION_TYPE = val_t::type_t::SINGLE_SELECTION * MAX_TYPE;\nstatic const int DATUM_TYPE = val_t::type_t::DATUM * MAX_TYPE;\nstatic const int FUNC_TYPE = val_t::type_t::FUNC * MAX_TYPE;\n\nstatic const int R_NULL_TYPE = val_t::type_t::DATUM * MAX_TYPE + datum_t::R_NULL;\nstatic const int R_BOOL_TYPE = val_t::type_t::DATUM * MAX_TYPE + datum_t::R_BOOL;\nstatic const int R_NUM_TYPE = val_t::type_t::DATUM * MAX_TYPE + datum_t::R_NUM;\nstatic const int R_STR_TYPE = val_t::type_t::DATUM * MAX_TYPE + datum_t::R_STR;\nstatic const int R_ARRAY_TYPE = val_t::type_t::DATUM * MAX_TYPE + datum_t::R_ARRAY;\nstatic const int R_OBJECT_TYPE = val_t::type_t::DATUM * MAX_TYPE + datum_t::R_OBJECT;\n\nclass coerce_map_t {\npublic:\n    coerce_map_t() {\n        map[\"DB\"] = DB_TYPE;\n        map[\"TABLE\"] = TABLE_TYPE;\n        map[\"SELECTION\"] = SELECTION_TYPE;\n        map[\"STREAM\"] = SEQUENCE_TYPE;\n        map[\"SINGLE_SELECTION\"] = SINGLE_SELECTION_TYPE;\n        map[\"DATUM\"] = DATUM_TYPE;\n        map[\"FUNCTION\"] = FUNC_TYPE;\n        CT_ASSERT(val_t::type_t::FUNC < MAX_TYPE);\n\n        map[\"NULL\"] = R_NULL_TYPE;\n        map[\"BOOL\"] = R_BOOL_TYPE;\n        map[\"NUMBER\"] = R_NUM_TYPE;\n        map[\"STRING\"] = R_STR_TYPE;\n        map[\"ARRAY\"] = R_ARRAY_TYPE;\n        map[\"OBJECT\"] = R_OBJECT_TYPE;\n        CT_ASSERT(datum_t::R_OBJECT < MAX_TYPE);\n\n        for (std::map<std::string, int>::iterator\n                 it = map.begin(); it != map.end(); ++it) {\n            rmap[it->second] = it->first;\n        }\n    }\n    int get_type(const std::string &s, const rcheckable_t *caller) const {\n        std::map<std::string, int>::const_iterator it = map.find(s);\n        rcheck_target(caller, it != map.end(), strprintf(\"Unknown Type: %s\", s.c_str()));\n        return it->second;\n    }\n    std::string get_name(int type) const {\n        std::map<int, std::string>::const_iterator it = rmap.find(type);\n        r_sanity_check(it != rmap.end());\n        return it->second;\n    }\nprivate:\n    std::map<std::string, int> map;\n    std::map<int, std::string> rmap;\n\n    \/\/ These functions are here so that if you add a new type you have to update\n    \/\/ this file.\n    \/\/ THINGS TO DO:\n    \/\/ * Update the coerce map\n    \/\/ * Add the various coercions\n    \/\/ * !!! CHECK WHETHER WE HAVE MORE THAN MAX_TYPE TYPES AND INCREASE !!!\n    \/\/   !!! MAX_TYPE IF WE DO                                           !!!\n    void NOCALL_ct_catch_new_types(val_t::type_t::raw_type_t t, datum_t::type_t t2) {\n        switch (t) {\n        case val_t::type_t::DB:\n        case val_t::type_t::TABLE:\n        case val_t::type_t::SELECTION:\n        case val_t::type_t::SEQUENCE:\n        case val_t::type_t::SINGLE_SELECTION:\n        case val_t::type_t::DATUM:\n        case val_t::type_t::FUNC:\n        default: break;\n        }\n        switch (t2) {\n        case datum_t::R_NULL:\n        case datum_t::R_BOOL:\n        case datum_t::R_NUM:\n        case datum_t::R_STR:\n        case datum_t::R_ARRAY:\n        case datum_t::R_OBJECT:\n        default: break;\n        }\n    }\n};\n\nstatic const coerce_map_t _coerce_map;\nstatic int get_type(std::string s, const rcheckable_t *caller) {\n    std::transform(s.begin(), s.end(), s.begin(), ::toupper);\n    return _coerce_map.get_type(s, caller);\n}\nstatic std::string get_name(int type) {\n    return _coerce_map.get_name(type);\n}\n\nstatic val_t::type_t::raw_type_t supertype(int type) {\n    return static_cast<val_t::type_t::raw_type_t>(type \/ MAX_TYPE);\n}\nstatic datum_t::type_t subtype(int type) {\n    return static_cast<datum_t::type_t>(type - supertype(type));\n}\nstatic int merge_types(int supertype, int subtype) {\n    return supertype * MAX_TYPE + subtype;\n}\n\nclass coerce_term_t : public op_term_t {\npublic:\n    coerce_term_t(env_t *env, const Term2 *term) : op_term_t(env, term, argspec_t(2)) { }\nprivate:\n    virtual val_t *eval_impl() {\n        val_t *val = arg(0);\n        val_t::type_t opaque_start_type = val->get_type();\n        int start_supertype = opaque_start_type.raw_type;\n        int start_subtype = 0;\n        if (opaque_start_type.is_convertible(val_t::type_t::DATUM)) {\n            start_supertype = val_t::type_t::DATUM;\n            start_subtype = val->as_datum()->get_type();\n        }\n        int start_type = merge_types(start_supertype, start_subtype);\n\n        std::string end_type_name = arg(1)->as_str();\n        int end_type = get_type(end_type_name, this);\n\n        \/\/ Identity\n        if ((!subtype(end_type)\n             && opaque_start_type.is_convertible(supertype(end_type)))\n            || start_type == end_type) {\n            return val;\n        }\n\n        \/\/ DATUM -> *\n        if (opaque_start_type.is_convertible(val_t::type_t::DATUM)) {\n            const datum_t *d = val->as_datum();\n            \/\/ DATUM -> DATUM\n            if (supertype(end_type) == val_t::type_t::DATUM) {\n                \/\/ DATUM -> STR\n                if (end_type == R_STR_TYPE) {\n                    return new_val(new datum_t(d->print()));\n                }\n\n                \/\/ OBJECT -> ARRAY\n                if (start_type == R_OBJECT_TYPE && end_type == R_ARRAY_TYPE) {\n                    datum_t *arr = env->add_ptr(new datum_t(datum_t::R_ARRAY));\n                    const std::map<const std::string, const datum_t *> &obj =\n                        d->as_object();\n                    for (std::map<const std::string, const datum_t *>::const_iterator\n                             it = obj.begin(); it != obj.end(); ++it) {\n                        datum_t *pair = env->add_ptr(new datum_t(datum_t::R_ARRAY));\n                        pair->add(env->add_ptr(new datum_t(it->first)));\n                        pair->add(it->second);\n                        arr->add(pair);\n                    }\n                    return new_val(arr);\n                }\n\n            }\n            \/\/ TODO: Object to sequence?\n        }\n\n        if (opaque_start_type.is_convertible(val_t::type_t::SEQUENCE)\n            && !(start_supertype == val_t::type_t::DATUM\n                 && start_type != R_ARRAY_TYPE)) {\n            datum_stream_t *ds;\n            try {\n                ds = val->as_seq();\n            } catch (const any_ql_exc_t &e) {\n\n                rfail(\"Cannot coerce %s to %s (failed to produce intermediate stream).\",\n                      get_name(start_type).c_str(), get_name(end_type).c_str());\n                unreachable();\n            }\n            \/\/ SEQUENCE -> ARRAY\n            if (end_type == R_ARRAY_TYPE || end_type == DATUM_TYPE) {\n                datum_t *arr = env->add_ptr(new datum_t(datum_t::R_ARRAY));\n                while (const datum_t *el = ds->next()) arr->add(el);\n                return new_val(arr);\n            }\n\n            \/\/ SEQUENCE -> OBJECT\n            if (end_type == R_OBJECT_TYPE) {\n                if (start_type == R_ARRAY_TYPE && end_type == R_OBJECT_TYPE) {\n                    datum_t *obj = env->add_ptr(new datum_t(datum_t::R_OBJECT));\n                    while (const datum_t *pair = ds->next()) {\n                        std::string key = pair->el(0)->as_str();\n                        const datum_t *keyval = pair->el(1);\n                        bool b = obj->add(key, keyval);\n                        rcheck(!b, strprintf(\"Duplicate key %s in coerced object.  \"\n                                             \"(got %s and %s as values)\",\n                                             key.c_str(),\n                                             obj->el(key)->print().c_str(),\n                                             keyval->print().c_str()));\n                    }\n                    return new_val(obj);\n                }\n            }\n        }\n\n        rfail(\"Cannot coerce %s to %s.\",\n              get_name(start_type).c_str(), get_name(end_type).c_str());\n        unreachable();\n    }\n    RDB_NAME(\"coerce_to\");\n};\n\nclass typeof_term_t : public op_term_t {\npublic:\n    typeof_term_t(env_t *env, const Term2 *term) : op_term_t(env, term, argspec_t(1)) { }\nprivate:\n    virtual val_t *eval_impl() {\n        val_t *v0 = arg(0);\n        int t = v0->get_type().raw_type * MAX_TYPE;\n        if (t == DATUM_TYPE) t += v0->as_datum()->get_type();\n        return new_val(get_name(t));\n    }\n    RDB_NAME(\"typeof\");\n};\n\n} \/\/ namespace ql\n\n#endif \/\/ RDB_PROTOCOL_TERMS_TYPE_MANIP_HPP_\n<|endoftext|>"}
{"text":"<commit_before>\/*  \\brief Utility Functions for Lobid API (HBZ) to get title data, norm data (GND) and organisational data\n *  \\copyright 2018 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 \"LobidUtil.h\"\n#include <unordered_map>\n#include \"Downloader.h\"\n#include \"JSON.h\"\n#include \"UrlUtil.h\"\n#include \"util.h\"\n\n\nnamespace LobidUtil {\n\n\nstd::unordered_map<std::string, const std::shared_ptr<const JSON::ObjectNode>> url_to_lookup_result_cache;\n\n\nstatic std::string BASE_URL_GND = \"http:\/\/lobid.org\/gnd\/search?format=json\";\nstatic std::string BASE_URL_ORGANISATIONS = \"http:\/\/lobid.org\/organisations\/search?format=json\";\nstatic std::string BASE_URL_RESOURCES = \"http:\/\/lobid.org\/resources\/search?format=json\";\n\n\nvoid AddUrlParams(std::string * const url, const std::string &key, const std::unordered_map<std::string, std::string> &params) {\n    unsigned i(0);\n    for (const auto &key_and_value : params) {\n        if (i == 0)\n            *url += \"&\" + key + \"=\";\n        else\n            *url += UrlUtil::UrlEncode(\" AND \");\n        *url += UrlUtil::UrlEncode(key_and_value.first + \":\" + key_and_value.second);\n        ++i;\n    }\n}\n\n\nconst std::string BuildUrl(const std::string &base_url, const std::unordered_map<std::string, std::string> &query_params,\n                           const std::unordered_map<std::string, std::string> &filter_params,\n                           const std::string &additional_query_params)\n{\n    std::string url(base_url);\n    AddUrlParams(&url, \"q\", query_params);\n    if (not additional_query_params.empty())\n        url += UrlUtil::UrlEncode(\" AND \" + additional_query_params);\n    AddUrlParams(&url, \"filter\", filter_params);\n    return url;\n}\n\n\nconst std::shared_ptr<const JSON::ObjectNode> Query(const std::string &url, const bool allow_multiple_results) {\n    LOG_DEBUG(url);\n    const auto url_and_lookup_result(url_to_lookup_result_cache.find(url));\n    if (url_and_lookup_result != url_to_lookup_result_cache.end())\n        return url_and_lookup_result->second;\n\n    Downloader downloader(url);\n    if (downloader.anErrorOccurred())\n        LOG_ERROR(\"failed to lookup using Lobid API. downloader error: \" + downloader.getLastErrorMessage());\n\n    JSON::Parser json_parser(downloader.getMessageBody());\n    std::shared_ptr<JSON::JSONNode> root_node;\n    if (not (json_parser.parse(&root_node))) {\n        LOG_DEBUG(\"failed to parse returned JSON: \" + json_parser.getErrorMessage() + \"(input was: \"\n                  + downloader.getMessageBody() + \")\");\n        return nullptr;\n    }\n\n    const std::shared_ptr<const JSON::ObjectNode> root_object(JSON::JSONNode::CastToObjectNodeOrDie(\"root\", root_node));\n    url_to_lookup_result_cache.emplace(url, root_object);\n\n    const unsigned total_items(root_object->getIntegerValue(\"totalItems\"));\n    if (total_items == 0) {\n        LOG_DEBUG(\"empty result for query: \" + url);\n        return nullptr;\n    } else if (not allow_multiple_results and total_items > 1) {\n        LOG_DEBUG(\"multiple results for query: \" + url);\n        return nullptr;\n    }\n\n    return root_object;\n}\n\n\nconst std::string QueryAndLookupString(const std::string &url, const std::string &path, const bool allow_multiple_results) {\n    const auto root_object(Query(url, allow_multiple_results));\n    if (root_object == nullptr)\n        return \"\";\n\n    return JSON::LookupString(path, root_object, \"\");\n}\n\n\nconst std::vector<std::string> QueryAndLookupStrings(const std::string &url, const std::string &path, const bool allow_multiple_results) {\n    const auto root_object(Query(url, allow_multiple_results));\n    if (root_object == nullptr)\n        return std::vector<std::string>{};\n\n    return JSON::LookupStrings(path, root_object);\n}\n\n\nstd::string GetAuthorGNDNumber(const std::string &author, const std::string &additional_query_params) {\n    return QueryAndLookupString(BuildUrl(BASE_URL_GND, { { \"preferredName\", author } }, { { \"type\", \"DifferentiatedPerson\" } }, additional_query_params),\n                                \"\/member\/0\/gndIdentifier\", \/* allow_multiple_results *\/ false);\n}\n\n\nstd::vector<std::string> GetAuthorProfessions(const std::string &author, const std::string &additional_query_params) {\n    return QueryAndLookupStrings(BuildUrl(BASE_URL_GND, { { \"preferredName\", author } }, { { \"type\", \"DifferentiatedPerson\" } }, additional_query_params),\n                                 \"\/member\/*\/professionOrOccupation\/*\/label\", \/* allow_multiple_results *\/ false);\n}\n\n\nstd::string GetOrganisationISIL(const std::string &organisation, const std::string &additional_query_params) {\n    return QueryAndLookupString(BuildUrl(BASE_URL_ORGANISATIONS, { { \"name\", organisation } }, std::unordered_map<std::string, std::string>(), additional_query_params),\n                                \"\/member\/0\/isil\", \/* allow_multiple_results *\/ false);\n}\n\n\nstd::string GetTitleDOI(const std::string &title, const std::string &additional_query_params) {\n    return QueryAndLookupString(BuildUrl(BASE_URL_RESOURCES, { { \"title\", \"\\\"\" + title + \"\\\"\" } }, std::unordered_map<std::string, std::string>(), additional_query_params),\n                                \"\/member\/0\/doi\/0\", \/* allow_multiple_results *\/ false);\n}\n\n\n} \/\/ namespace LobidUtil\n<commit_msg>LobidUtil: update another failure case<commit_after>\/*  \\brief Utility Functions for Lobid API (HBZ) to get title data, norm data (GND) and organisational data\n *  \\copyright 2018 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 \"LobidUtil.h\"\n#include <unordered_map>\n#include \"Downloader.h\"\n#include \"JSON.h\"\n#include \"UrlUtil.h\"\n#include \"util.h\"\n\n\nnamespace LobidUtil {\n\n\nstd::unordered_map<std::string, const std::shared_ptr<const JSON::ObjectNode>> url_to_lookup_result_cache;\n\n\nstatic std::string BASE_URL_GND = \"http:\/\/lobid.org\/gnd\/search?format=json\";\nstatic std::string BASE_URL_ORGANISATIONS = \"http:\/\/lobid.org\/organisations\/search?format=json\";\nstatic std::string BASE_URL_RESOURCES = \"http:\/\/lobid.org\/resources\/search?format=json\";\n\n\nvoid AddUrlParams(std::string * const url, const std::string &key, const std::unordered_map<std::string, std::string> &params) {\n    unsigned i(0);\n    for (const auto &key_and_value : params) {\n        if (i == 0)\n            *url += \"&\" + key + \"=\";\n        else\n            *url += UrlUtil::UrlEncode(\" AND \");\n        *url += UrlUtil::UrlEncode(key_and_value.first + \":\" + key_and_value.second);\n        ++i;\n    }\n}\n\n\nconst std::string BuildUrl(const std::string &base_url, const std::unordered_map<std::string, std::string> &query_params,\n                           const std::unordered_map<std::string, std::string> &filter_params,\n                           const std::string &additional_query_params)\n{\n    std::string url(base_url);\n    AddUrlParams(&url, \"q\", query_params);\n    if (not additional_query_params.empty())\n        url += UrlUtil::UrlEncode(\" AND \" + additional_query_params);\n    AddUrlParams(&url, \"filter\", filter_params);\n    return url;\n}\n\n\nconst std::shared_ptr<const JSON::ObjectNode> Query(const std::string &url, const bool allow_multiple_results) {\n    LOG_DEBUG(url);\n    const auto url_and_lookup_result(url_to_lookup_result_cache.find(url));\n    if (url_and_lookup_result != url_to_lookup_result_cache.end())\n        return url_and_lookup_result->second;\n\n    Downloader downloader(url);\n    if (downloader.anErrorOccurred()) {\n        LOG_WARNING(\"failed to lookup using Lobid API. downloader error: \" + downloader.getLastErrorMessage());\n        return nullptr;\n    }\n\n    JSON::Parser json_parser(downloader.getMessageBody());\n    std::shared_ptr<JSON::JSONNode> root_node;\n    if (not (json_parser.parse(&root_node))) {\n        LOG_WARNING(\"failed to parse returned JSON: \" + json_parser.getErrorMessage() + \"(input was: \"\n                  + downloader.getMessageBody() + \")\");\n        return nullptr;\n    }\n\n    const std::shared_ptr<const JSON::ObjectNode> root_object(JSON::JSONNode::CastToObjectNodeOrDie(\"root\", root_node));\n    url_to_lookup_result_cache.emplace(url, root_object);\n\n    const unsigned total_items(root_object->getIntegerValue(\"totalItems\"));\n    if (total_items == 0) {\n        LOG_DEBUG(\"empty result for query: \" + url);\n        return nullptr;\n    } else if (not allow_multiple_results and total_items > 1) {\n        LOG_DEBUG(\"multiple results for query: \" + url);\n        return nullptr;\n    }\n\n    return root_object;\n}\n\n\nconst std::string QueryAndLookupString(const std::string &url, const std::string &path, const bool allow_multiple_results) {\n    const auto root_object(Query(url, allow_multiple_results));\n    if (root_object == nullptr)\n        return \"\";\n\n    return JSON::LookupString(path, root_object, \"\");\n}\n\n\nconst std::vector<std::string> QueryAndLookupStrings(const std::string &url, const std::string &path, const bool allow_multiple_results) {\n    const auto root_object(Query(url, allow_multiple_results));\n    if (root_object == nullptr)\n        return std::vector<std::string>{};\n\n    return JSON::LookupStrings(path, root_object);\n}\n\n\nstd::string GetAuthorGNDNumber(const std::string &author, const std::string &additional_query_params) {\n    return QueryAndLookupString(BuildUrl(BASE_URL_GND, { { \"preferredName\", author } }, { { \"type\", \"DifferentiatedPerson\" } }, additional_query_params),\n                                \"\/member\/0\/gndIdentifier\", \/* allow_multiple_results *\/ false);\n}\n\n\nstd::vector<std::string> GetAuthorProfessions(const std::string &author, const std::string &additional_query_params) {\n    return QueryAndLookupStrings(BuildUrl(BASE_URL_GND, { { \"preferredName\", author } }, { { \"type\", \"DifferentiatedPerson\" } }, additional_query_params),\n                                 \"\/member\/*\/professionOrOccupation\/*\/label\", \/* allow_multiple_results *\/ false);\n}\n\n\nstd::string GetOrganisationISIL(const std::string &organisation, const std::string &additional_query_params) {\n    return QueryAndLookupString(BuildUrl(BASE_URL_ORGANISATIONS, { { \"name\", organisation } }, std::unordered_map<std::string, std::string>(), additional_query_params),\n                                \"\/member\/0\/isil\", \/* allow_multiple_results *\/ false);\n}\n\n\nstd::string GetTitleDOI(const std::string &title, const std::string &additional_query_params) {\n    return QueryAndLookupString(BuildUrl(BASE_URL_RESOURCES, { { \"title\", \"\\\"\" + title + \"\\\"\" } }, std::unordered_map<std::string, std::string>(), additional_query_params),\n                                \"\/member\/0\/doi\/0\", \/* allow_multiple_results *\/ false);\n}\n\n\n} \/\/ namespace LobidUtil\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Copyright 2019 The ANGLE Project Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\/\/\n\/\/ FormatPrintTest:\n\/\/   Prints all format support info\n\/\/\n\n#include \"test_utils\/ANGLETest.h\"\n#include \"test_utils\/angle_test_instantiate.h\"\n\/\/ 'None' is defined as 'struct None {};' in\n\/\/ third_party\/googletest\/src\/googletest\/include\/gtest\/internal\/gtest-type-util.h.\n\/\/ But 'None' is also defined as a numeric constant 0L in <X11\/X.h>.\n\/\/ So we need to include ANGLETest.h first to avoid this conflict.\n\n#include \"libANGLE\/Context.h\"\n#include \"libANGLE\/formatutils.h\"\n#include \"libANGLE\/gl_enum_utils.h\"\n#include \"util\/EGLWindow.h\"\n\nusing namespace angle;\n\nnamespace\n{\n\nclass FormatPrintTest : public ANGLETest\n{};\n\n\/\/ This test enumerates all sized and unsized GL formats and prints out support information\n\/\/ This test omits unsupported formats\n\/\/ The output is csv parseable and has a header and a new line.\n\/\/ Each row consists of:\n\/\/ (InternalFormat,Type,texturable,filterable,textureAttachmentSupported,renderBufferSupported)\nTEST_P(FormatPrintTest, PrintAllSupportedFormats)\n{\n    \/\/ Hack the angle!\n    gl::Context *context = static_cast<gl::Context *>(getEGLWindow()->getContext());\n    const gl::InternalFormatInfoMap &allSupportedFormats = gl::GetInternalFormatMap();\n\n    std::cout << std::endl\n              << \"InternalFormat,Type,Texturable,Filterable,Texture attachment,Renderbuffer\"\n              << std::endl\n              << std::endl;\n\n    for (const auto &internalFormat : allSupportedFormats)\n    {\n        for (const auto &typeFormatPair : internalFormat.second)\n        {\n            bool textureSupport = typeFormatPair.second.textureSupport(context->getClientVersion(),\n                                                                       context->getExtensions());\n            bool filterSupport  = typeFormatPair.second.filterSupport(context->getClientVersion(),\n                                                                     context->getExtensions());\n            bool textureAttachmentSupport = typeFormatPair.second.textureAttachmentSupport(\n                context->getClientVersion(), context->getExtensions());\n            bool renderbufferSupport = typeFormatPair.second.renderbufferSupport(\n                context->getClientVersion(), context->getExtensions());\n\n            \/\/ Skip if not supported\n            \/\/ A format is not supported if the only feature bit enabled is \"filterSupport\"\n            if (!(textureSupport || textureAttachmentSupport || renderbufferSupport))\n            {\n                continue;\n            }\n\n            \/\/ Lookup enum strings from enum\n            std::stringstream resultStringStream;\n            gl::OutputGLenumString(resultStringStream, gl::GLenumGroup::InternalFormat,\n                                   internalFormat.first);\n            resultStringStream << \",\";\n            gl::OutputGLenumString(resultStringStream, gl::GLenumGroup::PixelType,\n                                   typeFormatPair.first);\n            resultStringStream << \",\";\n\n            \/\/ able to be sampled from, see GLSL sampler variables\n            if (textureSupport)\n            {\n                resultStringStream << \"texturable\";\n            }\n            resultStringStream << \",\";\n\n            \/\/ able to be linearly filtered (GL_LINEAR)\n            if (filterSupport)\n            {\n                resultStringStream << \"filterable\";\n            }\n            resultStringStream << \",\";\n\n            \/\/ a texture with this can be used for glFramebufferTexture2D\n            if (textureAttachmentSupport)\n            {\n                resultStringStream << \"textureAttachmentSupported\";\n            }\n            resultStringStream << \",\";\n\n            \/\/ usable with glFramebufferRenderbuffer, glRenderbufferStorage,\n            \/\/ glNamedRenderbufferStorage\n            if (renderbufferSupport)\n            {\n                resultStringStream << \"renderbufferSupported\";\n            }\n\n            std::cout << resultStringStream.str() << std::endl;\n        }\n    }\n}\n\nANGLE_INSTANTIATE_TEST(FormatPrintTest, ES2_VULKAN(), ES3_VULKAN());\n\n}  \/\/ anonymous namespace\n<commit_msg>Test Runner: Add stub register function to white box tests.<commit_after>\/\/\n\/\/ Copyright 2019 The ANGLE Project Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\/\/\n\/\/ FormatPrintTest:\n\/\/   Prints all format support info\n\/\/\n\n#include \"test_utils\/ANGLETest.h\"\n#include \"test_utils\/angle_test_instantiate.h\"\n\/\/ 'None' is defined as 'struct None {};' in\n\/\/ third_party\/googletest\/src\/googletest\/include\/gtest\/internal\/gtest-type-util.h.\n\/\/ But 'None' is also defined as a numeric constant 0L in <X11\/X.h>.\n\/\/ So we need to include ANGLETest.h first to avoid this conflict.\n\n#include \"libANGLE\/Context.h\"\n#include \"libANGLE\/formatutils.h\"\n#include \"libANGLE\/gl_enum_utils.h\"\n#include \"util\/EGLWindow.h\"\n\nusing namespace angle;\n\nnamespace\n{\n\nclass FormatPrintTest : public ANGLETest\n{};\n\n\/\/ This test enumerates all sized and unsized GL formats and prints out support information\n\/\/ This test omits unsupported formats\n\/\/ The output is csv parseable and has a header and a new line.\n\/\/ Each row consists of:\n\/\/ (InternalFormat,Type,texturable,filterable,textureAttachmentSupported,renderBufferSupported)\nTEST_P(FormatPrintTest, PrintAllSupportedFormats)\n{\n    \/\/ Hack the angle!\n    gl::Context *context = static_cast<gl::Context *>(getEGLWindow()->getContext());\n    const gl::InternalFormatInfoMap &allSupportedFormats = gl::GetInternalFormatMap();\n\n    std::cout << std::endl\n              << \"InternalFormat,Type,Texturable,Filterable,Texture attachment,Renderbuffer\"\n              << std::endl\n              << std::endl;\n\n    for (const auto &internalFormat : allSupportedFormats)\n    {\n        for (const auto &typeFormatPair : internalFormat.second)\n        {\n            bool textureSupport = typeFormatPair.second.textureSupport(context->getClientVersion(),\n                                                                       context->getExtensions());\n            bool filterSupport  = typeFormatPair.second.filterSupport(context->getClientVersion(),\n                                                                     context->getExtensions());\n            bool textureAttachmentSupport = typeFormatPair.second.textureAttachmentSupport(\n                context->getClientVersion(), context->getExtensions());\n            bool renderbufferSupport = typeFormatPair.second.renderbufferSupport(\n                context->getClientVersion(), context->getExtensions());\n\n            \/\/ Skip if not supported\n            \/\/ A format is not supported if the only feature bit enabled is \"filterSupport\"\n            if (!(textureSupport || textureAttachmentSupport || renderbufferSupport))\n            {\n                continue;\n            }\n\n            \/\/ Lookup enum strings from enum\n            std::stringstream resultStringStream;\n            gl::OutputGLenumString(resultStringStream, gl::GLenumGroup::InternalFormat,\n                                   internalFormat.first);\n            resultStringStream << \",\";\n            gl::OutputGLenumString(resultStringStream, gl::GLenumGroup::PixelType,\n                                   typeFormatPair.first);\n            resultStringStream << \",\";\n\n            \/\/ able to be sampled from, see GLSL sampler variables\n            if (textureSupport)\n            {\n                resultStringStream << \"texturable\";\n            }\n            resultStringStream << \",\";\n\n            \/\/ able to be linearly filtered (GL_LINEAR)\n            if (filterSupport)\n            {\n                resultStringStream << \"filterable\";\n            }\n            resultStringStream << \",\";\n\n            \/\/ a texture with this can be used for glFramebufferTexture2D\n            if (textureAttachmentSupport)\n            {\n                resultStringStream << \"textureAttachmentSupported\";\n            }\n            resultStringStream << \",\";\n\n            \/\/ usable with glFramebufferRenderbuffer, glRenderbufferStorage,\n            \/\/ glNamedRenderbufferStorage\n            if (renderbufferSupport)\n            {\n                resultStringStream << \"renderbufferSupported\";\n            }\n\n            std::cout << resultStringStream.str() << std::endl;\n        }\n    }\n}\n\nANGLE_INSTANTIATE_TEST(FormatPrintTest, ES2_VULKAN(), ES3_VULKAN());\n\n}  \/\/ anonymous namespace\n\n\/\/ Included here to fix a compile error due to white box tests using angle_end2end_tests_main.\nvoid RegisterContextCompatibilityTests() {}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: prim.hxx,v $\n *\n *  $Revision: 1.16 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 08:54: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 PRIM_HXX\n#define PRIM_HXX\n\n#ifndef _TYPELIB_TYPEDESCRIPTION_H_\n#include \"typelib\/typedescription.h\"\n#endif\n#ifndef _typelib_TypeClass_H_\n#include \"typelib\/typeclass.h\"\n#endif\n#ifndef _UNO_SEQUENCE2_H_\n#include \"uno\/sequence2.h\"\n#endif\n#ifndef _UNO_ANY2_H_\n#include \"uno\/any2.h\"\n#endif\n#ifndef _UNO_DATA_H_\n#include \"uno\/data.h\"\n#endif\n#ifndef _UNO_MAPPING_H_\n#include \"uno\/mapping.h\"\n#endif\n#ifndef _UNO_DISPATCHER_H_\n#include \"uno\/dispatcher.h\"\n#endif\n\n#ifndef _OSL_INTERLCK_H\n#include \"osl\/interlck.h\"\n#endif\n#ifndef _OSL_DIAGNOSE_H_\n#include \"osl\/diagnose.h\"\n#endif\n#ifndef _RTL_USTRING_HXX\n#include \"rtl\/ustring.hxx\"\n#endif\n#ifndef _RTL_ALLOC_H_\n#include \"rtl\/alloc.h\"\n#endif\n\n#if OSL_DEBUG_LEVEL > 1\n#include \"rtl\/ustrbuf.hxx\"\n#include \"rtl\/string.hxx\"\n#endif\n\n\nnamespace cppu\n{\n\nextern uno_Sequence g_emptySeq;\nextern typelib_TypeDescriptionReference * g_pVoidType;\n\n\/\/--------------------------------------------------------------------------------------------------\ninline void * _map(\n    void * p,\n    typelib_TypeDescriptionReference * pType, typelib_TypeDescription * pTypeDescr,\n    uno_Mapping * mapping )\n    SAL_THROW( () )\n{\n    void * pRet = 0;\n    if (p)\n    {\n        if (pTypeDescr)\n        {\n            (*mapping->mapInterface)(\n                mapping, &pRet, p, (typelib_InterfaceTypeDescription *)pTypeDescr );\n        }\n        else\n        {\n            TYPELIB_DANGER_GET( &pTypeDescr, pType );\n            (*mapping->mapInterface)(\n                mapping, &pRet, p, (typelib_InterfaceTypeDescription *)pTypeDescr );\n            TYPELIB_DANGER_RELEASE( pTypeDescr );\n        }\n    }\n    return pRet;\n}\n\/\/--------------------------------------------------------------------------------------------------\ninline void _acquire( void * p, uno_AcquireFunc acquire ) SAL_THROW( () )\n{\n    if (p)\n    {\n        if (acquire)\n        {\n            (*acquire)( p );\n        }\n        else\n        {\n            (*((uno_Interface *)p)->acquire)( (uno_Interface *)p );\n        }\n    }\n}\n\/\/--------------------------------------------------------------------------------------------------\ninline void _release( void * p, uno_ReleaseFunc release ) SAL_THROW( () )\n{\n    if (p)\n    {\n        if (release)\n        {\n            (*release)( p );\n        }\n        else\n        {\n            (*((uno_Interface *)p)->release)( (uno_Interface *)p );\n        }\n    }\n}\n\n\/\/------------------------------------------------------------------------------\ninline sal_uInt32 calcSeqMemSize(\n    sal_Int32 nElementSize, sal_Int32 nElements )\n{\n    sal_uInt64 nSize =\n        (sal_uInt64) SAL_SEQUENCE_HEADER_SIZE +\n        ((sal_uInt64) nElementSize * (sal_uInt64) nElements);\n    if (nSize > 0xffffffffU)\n        return 0;\n    else\n        return (sal_uInt32) nSize;\n}\n\n\/\/--------------------------------------------------------------------------------------------------\ninline uno_Sequence * createEmptySequence() SAL_THROW( () )\n{\n    ::osl_incrementInterlockedCount( &g_emptySeq.nRefCount );\n    return &g_emptySeq;\n}\n\/\/--------------------------------------------------------------------------------------------------\ninline typelib_TypeDescriptionReference * _getVoidType()\n    SAL_THROW( () )\n{\n    if (! g_pVoidType)\n    {\n        g_pVoidType = * ::typelib_static_type_getByTypeClass( typelib_TypeClass_VOID );\n    }\n    ::typelib_typedescriptionreference_acquire( g_pVoidType );\n    return g_pVoidType;\n}\n\n\/\/--------------------------------------------------------------------------------------------------\n#if OSL_DEBUG_LEVEL > 0\n#define CONSTRUCT_EMPTY_ANY( pAny ) \\\n(pAny)->pType = _getVoidType(); \\\n(pAny)->pData = (void *)0xdeadbeef;\n#else\n#define CONSTRUCT_EMPTY_ANY( pAny ) \\\n(pAny)->pType = _getVoidType(); \\\n(pAny)->pData = (pAny);\n#endif\n\n\/\/--------------------------------------------------------------------------------------------------\n#define TYPE_ACQUIRE( pType ) \\\n    ::osl_incrementInterlockedCount( &(pType)->nRefCount );\n\n\/\/--------------------------------------------------------------------------------------------------\nvoid * binuno_queryInterface( void * pUnoI, typelib_TypeDescriptionReference * pDestType );\n\n\/\/--------------------------------------------------------------------------------------------------\ninline typelib_TypeDescriptionReference * _unionGetSetType(\n    void * pUnion, typelib_TypeDescription * pTD )\n    SAL_THROW( () )\n{\n    typelib_TypeDescriptionReference * pRet = 0;\n    sal_Int32 nPos;\n\n    sal_Int64 * pDiscr = ((typelib_UnionTypeDescription *)pTD)->pDiscriminants;\n    sal_Int64 nDiscr   = *(sal_Int64 *)pUnion;\n    for ( nPos = ((typelib_UnionTypeDescription *)pTD)->nMembers; nPos--; )\n    {\n        if (pDiscr[nPos] == nDiscr)\n        {\n            pRet = ((typelib_UnionTypeDescription *)pTD)->ppTypeRefs[nPos];\n            break;\n        }\n    }\n    if (nPos >= 0)\n    {\n        \/\/ default\n        pRet = ((typelib_UnionTypeDescription *)pTD)->pDefaultTypeRef;\n    }\n    typelib_typedescriptionreference_acquire( pRet );\n    return pRet;\n}\n\/\/--------------------------------------------------------------------------------------------------\ninline sal_Bool _type_equals(\n    typelib_TypeDescriptionReference * pType1, typelib_TypeDescriptionReference * pType2 )\n    SAL_THROW( () )\n{\n    return (pType1 == pType2 ||\n            (pType1->eTypeClass == pType2->eTypeClass &&\n             pType1->pTypeName->length == pType2->pTypeName->length &&\n             ::rtl_ustr_compare( pType1->pTypeName->buffer, pType2->pTypeName->buffer ) == 0));\n}\n\n}\n\n#endif\n<commit_msg>INTEGRATION: CWS warnings01 (1.15.60); FILE MERGED 2005\/09\/22 20:46:28 sb 1.15.60.2: RESYNC: (1.15-1.16); FILE MERGED 2005\/08\/31 13:43:22 sb 1.15.60.1: #i53898# Made code warning-free.<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: prim.hxx,v $\n *\n *  $Revision: 1.17 $\n *\n *  last change: $Author: hr $ $Date: 2006-06-19 13:15: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 PRIM_HXX\n#define PRIM_HXX\n\n#ifndef _TYPELIB_TYPEDESCRIPTION_H_\n#include \"typelib\/typedescription.h\"\n#endif\n#ifndef _typelib_TypeClass_H_\n#include \"typelib\/typeclass.h\"\n#endif\n#ifndef _UNO_SEQUENCE2_H_\n#include \"uno\/sequence2.h\"\n#endif\n#ifndef _UNO_ANY2_H_\n#include \"uno\/any2.h\"\n#endif\n#ifndef _UNO_DATA_H_\n#include \"uno\/data.h\"\n#endif\n#ifndef _UNO_MAPPING_H_\n#include \"uno\/mapping.h\"\n#endif\n#ifndef _UNO_DISPATCHER_H_\n#include \"uno\/dispatcher.h\"\n#endif\n\n#ifndef _OSL_INTERLCK_H\n#include \"osl\/interlck.h\"\n#endif\n#ifndef _OSL_DIAGNOSE_H_\n#include \"osl\/diagnose.h\"\n#endif\n#ifndef _RTL_USTRING_HXX\n#include \"rtl\/ustring.hxx\"\n#endif\n#ifndef _RTL_ALLOC_H_\n#include \"rtl\/alloc.h\"\n#endif\n\n#if OSL_DEBUG_LEVEL > 1\n#include \"rtl\/ustrbuf.hxx\"\n#include \"rtl\/string.hxx\"\n#endif\n\n\nnamespace cppu\n{\n\nextern uno_Sequence g_emptySeq;\nextern typelib_TypeDescriptionReference * g_pVoidType;\n\n\/\/--------------------------------------------------------------------------------------------------\ninline void * _map(\n    void * p,\n    typelib_TypeDescriptionReference * pType, typelib_TypeDescription * pTypeDescr,\n    uno_Mapping * mapping )\n    SAL_THROW( () )\n{\n    void * pRet = 0;\n    if (p)\n    {\n        if (pTypeDescr)\n        {\n            (*mapping->mapInterface)(\n                mapping, &pRet, p, (typelib_InterfaceTypeDescription *)pTypeDescr );\n        }\n        else\n        {\n            TYPELIB_DANGER_GET( &pTypeDescr, pType );\n            (*mapping->mapInterface)(\n                mapping, &pRet, p, (typelib_InterfaceTypeDescription *)pTypeDescr );\n            TYPELIB_DANGER_RELEASE( pTypeDescr );\n        }\n    }\n    return pRet;\n}\n\/\/--------------------------------------------------------------------------------------------------\ninline void _acquire( void * p, uno_AcquireFunc acquire ) SAL_THROW( () )\n{\n    if (p)\n    {\n        if (acquire)\n        {\n            (*acquire)( p );\n        }\n        else\n        {\n            (*((uno_Interface *)p)->acquire)( (uno_Interface *)p );\n        }\n    }\n}\n\/\/--------------------------------------------------------------------------------------------------\ninline void _release( void * p, uno_ReleaseFunc release ) SAL_THROW( () )\n{\n    if (p)\n    {\n        if (release)\n        {\n            (*release)( p );\n        }\n        else\n        {\n            (*((uno_Interface *)p)->release)( (uno_Interface *)p );\n        }\n    }\n}\n\n\/\/------------------------------------------------------------------------------\ninline sal_uInt32 calcSeqMemSize(\n    sal_Int32 nElementSize, sal_Int32 nElements )\n{\n    sal_uInt64 nSize =\n        (sal_uInt64) SAL_SEQUENCE_HEADER_SIZE +\n        ((sal_uInt64) nElementSize * (sal_uInt64) nElements);\n    if (nSize > 0xffffffffU)\n        return 0;\n    else\n        return (sal_uInt32) nSize;\n}\n\n\/\/--------------------------------------------------------------------------------------------------\ninline uno_Sequence * createEmptySequence() SAL_THROW( () )\n{\n    ::osl_incrementInterlockedCount( &g_emptySeq.nRefCount );\n    return &g_emptySeq;\n}\n\/\/--------------------------------------------------------------------------------------------------\ninline typelib_TypeDescriptionReference * _getVoidType()\n    SAL_THROW( () )\n{\n    if (! g_pVoidType)\n    {\n        g_pVoidType = * ::typelib_static_type_getByTypeClass( typelib_TypeClass_VOID );\n    }\n    ::typelib_typedescriptionreference_acquire( g_pVoidType );\n    return g_pVoidType;\n}\n\n\/\/--------------------------------------------------------------------------------------------------\n#if OSL_DEBUG_LEVEL > 0\n#define CONSTRUCT_EMPTY_ANY( pAny ) \\\n(pAny)->pType = _getVoidType(); \\\n(pAny)->pData = (void *)0xdeadbeef;\n#else\n#define CONSTRUCT_EMPTY_ANY( pAny ) \\\n(pAny)->pType = _getVoidType(); \\\n(pAny)->pData = (pAny);\n#endif\n\n\/\/--------------------------------------------------------------------------------------------------\n#define TYPE_ACQUIRE( pType ) \\\n    ::osl_incrementInterlockedCount( &(pType)->nRefCount );\n\n\/\/--------------------------------------------------------------------------------------------------\nextern \"C\" void * binuno_queryInterface(\n    void * pUnoI, typelib_TypeDescriptionReference * pDestType );\n\n\/\/--------------------------------------------------------------------------------------------------\ninline typelib_TypeDescriptionReference * _unionGetSetType(\n    void * pUnion, typelib_TypeDescription * pTD )\n    SAL_THROW( () )\n{\n    typelib_TypeDescriptionReference * pRet = 0;\n    sal_Int32 nPos;\n\n    sal_Int64 * pDiscr = ((typelib_UnionTypeDescription *)pTD)->pDiscriminants;\n    sal_Int64 nDiscr   = *(sal_Int64 *)pUnion;\n    for ( nPos = ((typelib_UnionTypeDescription *)pTD)->nMembers; nPos--; )\n    {\n        if (pDiscr[nPos] == nDiscr)\n        {\n            pRet = ((typelib_UnionTypeDescription *)pTD)->ppTypeRefs[nPos];\n            break;\n        }\n    }\n    if (nPos >= 0)\n    {\n        \/\/ default\n        pRet = ((typelib_UnionTypeDescription *)pTD)->pDefaultTypeRef;\n    }\n    typelib_typedescriptionreference_acquire( pRet );\n    return pRet;\n}\n\/\/--------------------------------------------------------------------------------------------------\ninline sal_Bool _type_equals(\n    typelib_TypeDescriptionReference * pType1, typelib_TypeDescriptionReference * pType2 )\n    SAL_THROW( () )\n{\n    return (pType1 == pType2 ||\n            (pType1->eTypeClass == pType2->eTypeClass &&\n             pType1->pTypeName->length == pType2->pTypeName->length &&\n             ::rtl_ustr_compare( pType1->pTypeName->buffer, pType2->pTypeName->buffer ) == 0));\n}\n\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2012-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 <main.h>\n#include <policy\/policy.h>\n#include <script.h>\n#include <validation.h>\n#include <wallet\/wallet.h>\n\n#include <vector>\n\n#include <boost\/test\/unit_test.hpp>\n\n\/\/ Test routines internal to script.cpp:\nextern uint256 SignatureHash(CScript scriptCode, const CTransaction& txTo, unsigned int nIn, int nHashType);\nextern bool VerifyScript(const CScript& scriptSig, const CScript& scriptPubKey, const CTransaction& txTo, unsigned int nIn, int nHashType);\n\n\/\/ Helpers:\nstatic std::vector<unsigned char>\nSerialize(const CScript& s)\n{\n    std::vector<unsigned char> sSerialized(s.begin(), s.end());\n    return sSerialized;\n}\n\nstatic bool\nVerify(const CScript& scriptSig, const CScript& scriptPubKey)\n{\n    \/\/ Create dummy to\/from transactions:\n    CTransaction txFrom;\n    txFrom.vout.resize(1);\n    txFrom.vout[0].scriptPubKey = scriptPubKey;\n\n    CTransaction txTo;\n    txTo.vin.resize(1);\n    txTo.vout.resize(1);\n    txTo.vin[0].prevout.n = 0;\n    txTo.vin[0].prevout.hash = txFrom.GetHash();\n    txTo.vin[0].scriptSig = scriptSig;\n    txTo.vout[0].nValue = 1;\n\n    return VerifyScript(scriptSig, scriptPubKey, txTo, 0, 0);\n}\n\n\nBOOST_AUTO_TEST_SUITE(script_P2SH_tests)\n\nBOOST_AUTO_TEST_CASE(sign)\n{\n    \/\/ Pay-to-script-hash looks like this:\n    \/\/ scriptSig:    <sig> <sig...> <serialized_script>\n    \/\/ scriptPubKey: HASH160 <hash> EQUAL\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        BOOST_CHECK(keystore.AddKey(key[i]));\n    }\n\n    \/\/ 8 Scripts: checking all combinations of\n    \/\/ different keys, straight\/P2SH, pubkey\/pubkeyhash\n    CScript standardScripts[4];\n    standardScripts[0] << key[0].GetPubKey() << OP_CHECKSIG;\n    standardScripts[1].SetDestination(key[1].GetPubKey().GetID());\n    standardScripts[2] << key[1].GetPubKey() << OP_CHECKSIG;\n    standardScripts[3].SetDestination(key[2].GetPubKey().GetID());\n    CScript evalScripts[4];\n    for (int i = 0; i < 4; i++)\n    {\n        BOOST_CHECK(keystore.AddCScript(standardScripts[i]));\n        evalScripts[i].SetDestination(standardScripts[i].GetID());\n    }\n\n    CTransaction txFrom;  \/\/ Funding transaction:\n    txFrom.vout.resize(8);\n    for (int i = 0; i < 4; i++)\n    {\n        txFrom.vout[i].scriptPubKey = evalScripts[i];\n        txFrom.vout[i+4].scriptPubKey = standardScripts[i];\n    }\n    BOOST_CHECK(IsStandardTx(txFrom));\n\n    CTransaction txTo[8]; \/\/ Spending transactions\n    for (int i = 0; i < 8; 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        BOOST_CHECK_MESSAGE(IsMine(keystore, txFrom.vout[i].scriptPubKey) != ISMINE_NO, strprintf(\"IsMine %d\", i));\n    }\n    for (int i = 0; i < 8; i++)\n    {\n        BOOST_CHECK_MESSAGE(SignSignature(keystore, txFrom, txTo[i], 0), strprintf(\"SignSignature %d\", i));\n    }\n    \/\/ All of the above should be OK, and the txTos have valid signatures\n    \/\/ Check to make sure signature verification fails if we use the wrong ScriptSig:\n    for (int i = 0; i < 8; i++)\n        for (int j = 0; j < 8; j++)\n        {\n            CScript sigSave = txTo[i].vin[0].scriptSig;\n            txTo[i].vin[0].scriptSig = txTo[j].vin[0].scriptSig;\n            bool sigOK = VerifySignature(txFrom, txTo[i], 0, 0);\n            if (i == j)\n                BOOST_CHECK_MESSAGE(sigOK, strprintf(\"VerifySignature %d %d\", i, j));\n            else\n                BOOST_CHECK_MESSAGE(!sigOK, strprintf(\"VerifySignature %d %d\", i, j));\n            txTo[i].vin[0].scriptSig = sigSave;\n        }\n}\n\nBOOST_AUTO_TEST_CASE(norecurse)\n{\n    \/\/ Make sure only the outer pay-to-script-hash does the\n    \/\/ extra-validation thing:\n    CScript invalidAsScript;\n    invalidAsScript << OP_INVALIDOPCODE << OP_INVALIDOPCODE;\n\n    CScript p2sh;\n    p2sh.SetDestination(invalidAsScript.GetID());\n\n    CScript scriptSig;\n    scriptSig << Serialize(invalidAsScript);\n\n    \/\/ Should not verify, because it will try to execute OP_INVALIDOPCODE\n    BOOST_CHECK(!Verify(scriptSig, p2sh));\n\n    \/\/ Try to recur, and verification should succeed because\n    \/\/ the inner HASH160 <> EQUAL should only check the hash:\n    CScript p2sh2;\n    p2sh2.SetDestination(p2sh.GetID());\n    CScript scriptSig2;\n    scriptSig2 << Serialize(invalidAsScript) << Serialize(p2sh);\n\n    BOOST_CHECK(Verify(scriptSig2, p2sh2));\n}\n\nBOOST_AUTO_TEST_CASE(set)\n{\n    \/\/ Test the CScript::Set* methods\n    CBasicKeyStore keystore;\n    CKey key[4];\n    std::vector<CKey> keys;\n    for (int i = 0; i < 4; i++)\n    {\n        key[i].MakeNewKey(true);\n        BOOST_CHECK(keystore.AddKey(key[i]));\n        keys.push_back(key[i]);\n    }\n\n    CScript inner[4];\n    inner[0].SetDestination(key[0].GetPubKey().GetID());\n    inner[1].SetMultisig(2, std::vector<CKey>(keys.begin(), keys.begin()+2));\n    inner[2].SetMultisig(1, std::vector<CKey>(keys.begin(), keys.begin()+2));\n    inner[3].SetMultisig(2, std::vector<CKey>(keys.begin(), keys.begin()+3));\n\n    CScript outer[4];\n    for (int i = 0; i < 4; i++)\n    {\n        outer[i].SetDestination(inner[i].GetID());\n        BOOST_CHECK(keystore.AddCScript(inner[i]));\n    }\n\n    CTransaction txFrom;  \/\/ Funding transaction:\n    txFrom.vout.resize(4);\n    for (int i = 0; i < 4; i++)\n    {\n        txFrom.vout[i].scriptPubKey = outer[i];\n    }\n    BOOST_CHECK(IsStandardTx(txFrom));\n\n    CTransaction txTo[4]; \/\/ Spending transactions\n    for (int i = 0; i < 4; 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        txTo[i].vout[0].scriptPubKey = inner[i];\n        BOOST_CHECK_MESSAGE(IsMine(keystore, txFrom.vout[i].scriptPubKey) != ISMINE_NO, strprintf(\"IsMine %d\", i));\n    }\n    for (int i = 0; i < 4; i++)\n    {\n        BOOST_CHECK_MESSAGE(SignSignature(keystore, txFrom, txTo[i], 0), strprintf(\"SignSignature %d\", i));\n        BOOST_CHECK_MESSAGE(IsStandardTx(txTo[i]), strprintf(\"IsStandardTx(txTo[%d])\", i));\n    }\n}\n\nBOOST_AUTO_TEST_CASE(is)\n{\n    \/\/ Test CScript::IsPayToScriptHash()\n    uint160 dummy;\n    CScript p2sh;\n    p2sh << OP_HASH160 << dummy << OP_EQUAL;\n    BOOST_CHECK(p2sh.IsPayToScriptHash());\n\n    \/\/ Not considered pay-to-script-hash if using one of the OP_PUSHDATA opcodes:\n    std::vector<unsigned char> direct = {OP_HASH160, 20};\n    direct.insert(direct.end(), 20, 0);\n    direct.push_back(OP_EQUAL);\n    BOOST_CHECK(CScript(direct.begin(), direct.end()).IsPayToScriptHash());\n    std::vector<unsigned char> pushdata1 = {OP_HASH160, OP_PUSHDATA1, 20};\n    pushdata1.insert(pushdata1.end(), 20, 0);\n    pushdata1.push_back(OP_EQUAL);\n    BOOST_CHECK(!CScript(pushdata1.begin(), pushdata1.end()).IsPayToScriptHash());\n    std::vector<unsigned char> pushdata2 = {OP_HASH160, 20, 0};\n    pushdata2.insert(pushdata2.end(), 20, 0);\n    pushdata2.push_back(OP_EQUAL);\n    BOOST_CHECK(!CScript(pushdata2.begin(), pushdata2.end()).IsPayToScriptHash());\n    std::vector<unsigned char> pushdata4 = {OP_HASH160, 20, 0, 0, 0};\n    pushdata4.insert(pushdata4.end(), 20, 0);\n    pushdata4.push_back(OP_EQUAL);\n    BOOST_CHECK(!CScript(pushdata4.begin(), pushdata4.end()).IsPayToScriptHash());\n\n    CScript not_p2sh;\n    BOOST_CHECK(!not_p2sh.IsPayToScriptHash());\n\n    not_p2sh.clear(); not_p2sh << OP_HASH160 << dummy << dummy << OP_EQUAL;\n    BOOST_CHECK(!not_p2sh.IsPayToScriptHash());\n\n    not_p2sh.clear(); not_p2sh << OP_NOP << dummy << OP_EQUAL;\n    BOOST_CHECK(!not_p2sh.IsPayToScriptHash());\n\n    not_p2sh.clear(); not_p2sh << OP_HASH160 << dummy << OP_CHECKSIG;\n    BOOST_CHECK(!not_p2sh.IsPayToScriptHash());\n}\n\nBOOST_AUTO_TEST_CASE(switchover)\n{\n    \/\/ Test switch over code\n    CScript notValid;\n    notValid << OP_11 << OP_12 << OP_EQUALVERIFY;\n    CScript scriptSig;\n    scriptSig << Serialize(notValid);\n\n    CScript fund;\n    fund.SetDestination(notValid.GetID());\n\n    \/\/ Validation should fail under new rules:\n    BOOST_CHECK(!Verify(scriptSig, fund));\n}\n\nBOOST_AUTO_TEST_CASE(AreInputsStandard)\n{\n    std::map<uint256, std::pair<CTxIndex, CTransaction> > mapInputs;\n    CBasicKeyStore keystore;\n    CKey key[3];\n    std::vector<CKey> keys;\n    for (int i = 0; i < 3; i++)\n    {\n        key[i].MakeNewKey(true);\n        BOOST_CHECK(keystore.AddKey(key[i]));\n        keys.push_back(key[i]);\n    }\n\n    CTransaction txFrom;\n    txFrom.vout.resize(6);\n\n    \/\/ First three are standard:\n    CScript pay1; pay1.SetDestination(key[0].GetPubKey().GetID());\n    BOOST_CHECK(keystore.AddCScript(pay1));\n    CScript payScriptHash1; payScriptHash1.SetDestination(pay1.GetID());\n    CScript pay1of3; pay1of3.SetMultisig(1, keys);\n\n    txFrom.vout[0].scriptPubKey = payScriptHash1;\n    txFrom.vout[1].scriptPubKey = pay1;\n    txFrom.vout[2].scriptPubKey = pay1of3;\n\n    \/\/ Last three non-standard:\n    CScript empty;\n    keystore.AddCScript(empty);\n    txFrom.vout[3].scriptPubKey = empty;\n    \/\/ Can't use SetPayToScriptHash, it checks for the empty Script. So:\n    txFrom.vout[4].scriptPubKey << OP_HASH160 << Hash160(empty) << OP_EQUAL;\n    CScript oneOfEleven;\n    oneOfEleven << OP_1;\n    for (int i = 0; i < 11; i++)\n        oneOfEleven << key[0].GetPubKey();\n    oneOfEleven << OP_11 << OP_CHECKMULTISIG;\n    txFrom.vout[5].scriptPubKey.SetDestination(oneOfEleven.GetID());\n\n    mapInputs[txFrom.GetHash()] = std::make_pair(CTxIndex(), txFrom);\n\n    CTransaction txTo;\n    txTo.vout.resize(1);\n    txTo.vout[0].scriptPubKey.SetDestination(key[1].GetPubKey().GetID());\n\n    txTo.vin.resize(3);\n    txTo.vin[0].prevout.n = 0;\n    txTo.vin[0].prevout.hash = txFrom.GetHash();\n    BOOST_CHECK(SignSignature(keystore, txFrom, txTo, 0));\n    txTo.vin[1].prevout.n = 1;\n    txTo.vin[1].prevout.hash = txFrom.GetHash();\n    BOOST_CHECK(SignSignature(keystore, txFrom, txTo, 1));\n    txTo.vin[2].prevout.n = 2;\n    txTo.vin[2].prevout.hash = txFrom.GetHash();\n    BOOST_CHECK(SignSignature(keystore, txFrom, txTo, 2));\n\n    BOOST_CHECK(::AreInputsStandard(txTo, mapInputs));\n    BOOST_CHECK_EQUAL(GetP2SHSigOpCount(txTo, mapInputs), (unsigned int) 1);\n\n    \/\/ Make sure adding crap to the scriptSigs makes them non-standard:\n    for (int i = 0; i < 3; i++)\n    {\n        CScript t = txTo.vin[i].scriptSig;\n        txTo.vin[i].scriptSig = (CScript() << 11) + t;\n        BOOST_CHECK(!::AreInputsStandard(txTo, mapInputs));\n        txTo.vin[i].scriptSig = t;\n    }\n\n    CTransaction txToNonStd;\n    txToNonStd.vout.resize(1);\n    txToNonStd.vout[0].scriptPubKey.SetDestination(key[1].GetPubKey().GetID());\n    txToNonStd.vin.resize(2);\n    txToNonStd.vin[0].prevout.n = 4;\n    txToNonStd.vin[0].prevout.hash = txFrom.GetHash();\n    txToNonStd.vin[0].scriptSig << Serialize(empty);\n    txToNonStd.vin[1].prevout.n = 5;\n    txToNonStd.vin[1].prevout.hash = txFrom.GetHash();\n    txToNonStd.vin[1].scriptSig << OP_0 << Serialize(oneOfEleven);\n\n    BOOST_CHECK(!::AreInputsStandard(txToNonStd, mapInputs));\n    BOOST_CHECK_EQUAL(GetP2SHSigOpCount(txToNonStd, mapInputs), (unsigned int) 11);\n\n    txToNonStd.vin[0].scriptSig.clear();\n    BOOST_CHECK(!::AreInputsStandard(txToNonStd, mapInputs));\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<commit_msg>test: fix script_p2sh_tests OP_PUSHBACK2\/4 missing<commit_after>\/\/ Copyright (c) 2012-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 <main.h>\n#include <policy\/policy.h>\n#include <script.h>\n#include <validation.h>\n#include <wallet\/wallet.h>\n\n#include <vector>\n\n#include <boost\/test\/unit_test.hpp>\n\n\/\/ Test routines internal to script.cpp:\nextern uint256 SignatureHash(CScript scriptCode, const CTransaction& txTo, unsigned int nIn, int nHashType);\nextern bool VerifyScript(const CScript& scriptSig, const CScript& scriptPubKey, const CTransaction& txTo, unsigned int nIn, int nHashType);\n\n\/\/ Helpers:\nstatic std::vector<unsigned char>\nSerialize(const CScript& s)\n{\n    std::vector<unsigned char> sSerialized(s.begin(), s.end());\n    return sSerialized;\n}\n\nstatic bool\nVerify(const CScript& scriptSig, const CScript& scriptPubKey)\n{\n    \/\/ Create dummy to\/from transactions:\n    CTransaction txFrom;\n    txFrom.vout.resize(1);\n    txFrom.vout[0].scriptPubKey = scriptPubKey;\n\n    CTransaction txTo;\n    txTo.vin.resize(1);\n    txTo.vout.resize(1);\n    txTo.vin[0].prevout.n = 0;\n    txTo.vin[0].prevout.hash = txFrom.GetHash();\n    txTo.vin[0].scriptSig = scriptSig;\n    txTo.vout[0].nValue = 1;\n\n    return VerifyScript(scriptSig, scriptPubKey, txTo, 0, 0);\n}\n\n\nBOOST_AUTO_TEST_SUITE(script_P2SH_tests)\n\nBOOST_AUTO_TEST_CASE(sign)\n{\n    \/\/ Pay-to-script-hash looks like this:\n    \/\/ scriptSig:    <sig> <sig...> <serialized_script>\n    \/\/ scriptPubKey: HASH160 <hash> EQUAL\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        BOOST_CHECK(keystore.AddKey(key[i]));\n    }\n\n    \/\/ 8 Scripts: checking all combinations of\n    \/\/ different keys, straight\/P2SH, pubkey\/pubkeyhash\n    CScript standardScripts[4];\n    standardScripts[0] << key[0].GetPubKey() << OP_CHECKSIG;\n    standardScripts[1].SetDestination(key[1].GetPubKey().GetID());\n    standardScripts[2] << key[1].GetPubKey() << OP_CHECKSIG;\n    standardScripts[3].SetDestination(key[2].GetPubKey().GetID());\n    CScript evalScripts[4];\n    for (int i = 0; i < 4; i++)\n    {\n        BOOST_CHECK(keystore.AddCScript(standardScripts[i]));\n        evalScripts[i].SetDestination(standardScripts[i].GetID());\n    }\n\n    CTransaction txFrom;  \/\/ Funding transaction:\n    txFrom.vout.resize(8);\n    for (int i = 0; i < 4; i++)\n    {\n        txFrom.vout[i].scriptPubKey = evalScripts[i];\n        txFrom.vout[i+4].scriptPubKey = standardScripts[i];\n    }\n    BOOST_CHECK(IsStandardTx(txFrom));\n\n    CTransaction txTo[8]; \/\/ Spending transactions\n    for (int i = 0; i < 8; 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        BOOST_CHECK_MESSAGE(IsMine(keystore, txFrom.vout[i].scriptPubKey) != ISMINE_NO, strprintf(\"IsMine %d\", i));\n    }\n    for (int i = 0; i < 8; i++)\n    {\n        BOOST_CHECK_MESSAGE(SignSignature(keystore, txFrom, txTo[i], 0), strprintf(\"SignSignature %d\", i));\n    }\n    \/\/ All of the above should be OK, and the txTos have valid signatures\n    \/\/ Check to make sure signature verification fails if we use the wrong ScriptSig:\n    for (int i = 0; i < 8; i++)\n        for (int j = 0; j < 8; j++)\n        {\n            CScript sigSave = txTo[i].vin[0].scriptSig;\n            txTo[i].vin[0].scriptSig = txTo[j].vin[0].scriptSig;\n            bool sigOK = VerifySignature(txFrom, txTo[i], 0, 0);\n            if (i == j)\n                BOOST_CHECK_MESSAGE(sigOK, strprintf(\"VerifySignature %d %d\", i, j));\n            else\n                BOOST_CHECK_MESSAGE(!sigOK, strprintf(\"VerifySignature %d %d\", i, j));\n            txTo[i].vin[0].scriptSig = sigSave;\n        }\n}\n\nBOOST_AUTO_TEST_CASE(norecurse)\n{\n    \/\/ Make sure only the outer pay-to-script-hash does the\n    \/\/ extra-validation thing:\n    CScript invalidAsScript;\n    invalidAsScript << OP_INVALIDOPCODE << OP_INVALIDOPCODE;\n\n    CScript p2sh;\n    p2sh.SetDestination(invalidAsScript.GetID());\n\n    CScript scriptSig;\n    scriptSig << Serialize(invalidAsScript);\n\n    \/\/ Should not verify, because it will try to execute OP_INVALIDOPCODE\n    BOOST_CHECK(!Verify(scriptSig, p2sh));\n\n    \/\/ Try to recur, and verification should succeed because\n    \/\/ the inner HASH160 <> EQUAL should only check the hash:\n    CScript p2sh2;\n    p2sh2.SetDestination(p2sh.GetID());\n    CScript scriptSig2;\n    scriptSig2 << Serialize(invalidAsScript) << Serialize(p2sh);\n\n    BOOST_CHECK(Verify(scriptSig2, p2sh2));\n}\n\nBOOST_AUTO_TEST_CASE(set)\n{\n    \/\/ Test the CScript::Set* methods\n    CBasicKeyStore keystore;\n    CKey key[4];\n    std::vector<CKey> keys;\n    for (int i = 0; i < 4; i++)\n    {\n        key[i].MakeNewKey(true);\n        BOOST_CHECK(keystore.AddKey(key[i]));\n        keys.push_back(key[i]);\n    }\n\n    CScript inner[4];\n    inner[0].SetDestination(key[0].GetPubKey().GetID());\n    inner[1].SetMultisig(2, std::vector<CKey>(keys.begin(), keys.begin()+2));\n    inner[2].SetMultisig(1, std::vector<CKey>(keys.begin(), keys.begin()+2));\n    inner[3].SetMultisig(2, std::vector<CKey>(keys.begin(), keys.begin()+3));\n\n    CScript outer[4];\n    for (int i = 0; i < 4; i++)\n    {\n        outer[i].SetDestination(inner[i].GetID());\n        BOOST_CHECK(keystore.AddCScript(inner[i]));\n    }\n\n    CTransaction txFrom;  \/\/ Funding transaction:\n    txFrom.vout.resize(4);\n    for (int i = 0; i < 4; i++)\n    {\n        txFrom.vout[i].scriptPubKey = outer[i];\n    }\n    BOOST_CHECK(IsStandardTx(txFrom));\n\n    CTransaction txTo[4]; \/\/ Spending transactions\n    for (int i = 0; i < 4; 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        txTo[i].vout[0].scriptPubKey = inner[i];\n        BOOST_CHECK_MESSAGE(IsMine(keystore, txFrom.vout[i].scriptPubKey) != ISMINE_NO, strprintf(\"IsMine %d\", i));\n    }\n    for (int i = 0; i < 4; i++)\n    {\n        BOOST_CHECK_MESSAGE(SignSignature(keystore, txFrom, txTo[i], 0), strprintf(\"SignSignature %d\", i));\n        BOOST_CHECK_MESSAGE(IsStandardTx(txTo[i]), strprintf(\"IsStandardTx(txTo[%d])\", i));\n    }\n}\n\nBOOST_AUTO_TEST_CASE(is)\n{\n    \/\/ Test CScript::IsPayToScriptHash()\n    uint160 dummy;\n    CScript p2sh;\n    p2sh << OP_HASH160 << dummy << OP_EQUAL;\n    BOOST_CHECK(p2sh.IsPayToScriptHash());\n\n    std::vector<unsigned char> direct = {OP_HASH160, 20};\n    direct.insert(direct.end(), 20, 0);\n    direct.push_back(OP_EQUAL);\n    BOOST_CHECK(CScript(direct.begin(), direct.end()).IsPayToScriptHash());\n\n    \/\/ Not considered pay-to-script-hash if using one of the OP_PUSHDATA opcodes:\n    std::vector<unsigned char> pushdata1 = {OP_HASH160, OP_PUSHDATA1, 20};\n    pushdata1.insert(pushdata1.end(), 20, 0);\n    pushdata1.push_back(OP_EQUAL);\n    BOOST_CHECK(!CScript(pushdata1.begin(), pushdata1.end()).IsPayToScriptHash());\n    std::vector<unsigned char> pushdata2 = {OP_HASH160, OP_PUSHDATA2, 20, 0};\n    pushdata2.insert(pushdata2.end(), 20, 0);\n    pushdata2.push_back(OP_EQUAL);\n    BOOST_CHECK(!CScript(pushdata2.begin(), pushdata2.end()).IsPayToScriptHash());\n    std::vector<unsigned char> pushdata4 = {OP_HASH160, OP_PUSHDATA4, 20, 0, 0, 0};\n    pushdata4.insert(pushdata4.end(), 20, 0);\n    pushdata4.push_back(OP_EQUAL);\n    BOOST_CHECK(!CScript(pushdata4.begin(), pushdata4.end()).IsPayToScriptHash());\n\n    CScript not_p2sh;\n    BOOST_CHECK(!not_p2sh.IsPayToScriptHash());\n\n    not_p2sh.clear(); not_p2sh << OP_HASH160 << dummy << dummy << OP_EQUAL;\n    BOOST_CHECK(!not_p2sh.IsPayToScriptHash());\n\n    not_p2sh.clear(); not_p2sh << OP_NOP << dummy << OP_EQUAL;\n    BOOST_CHECK(!not_p2sh.IsPayToScriptHash());\n\n    not_p2sh.clear(); not_p2sh << OP_HASH160 << dummy << OP_CHECKSIG;\n    BOOST_CHECK(!not_p2sh.IsPayToScriptHash());\n}\n\nBOOST_AUTO_TEST_CASE(switchover)\n{\n    \/\/ Test switch over code\n    CScript notValid;\n    notValid << OP_11 << OP_12 << OP_EQUALVERIFY;\n    CScript scriptSig;\n    scriptSig << Serialize(notValid);\n\n    CScript fund;\n    fund.SetDestination(notValid.GetID());\n\n    \/\/ Validation should fail under new rules:\n    BOOST_CHECK(!Verify(scriptSig, fund));\n}\n\nBOOST_AUTO_TEST_CASE(AreInputsStandard)\n{\n    std::map<uint256, std::pair<CTxIndex, CTransaction> > mapInputs;\n    CBasicKeyStore keystore;\n    CKey key[3];\n    std::vector<CKey> keys;\n    for (int i = 0; i < 3; i++)\n    {\n        key[i].MakeNewKey(true);\n        BOOST_CHECK(keystore.AddKey(key[i]));\n        keys.push_back(key[i]);\n    }\n\n    CTransaction txFrom;\n    txFrom.vout.resize(6);\n\n    \/\/ First three are standard:\n    CScript pay1; pay1.SetDestination(key[0].GetPubKey().GetID());\n    BOOST_CHECK(keystore.AddCScript(pay1));\n    CScript payScriptHash1; payScriptHash1.SetDestination(pay1.GetID());\n    CScript pay1of3; pay1of3.SetMultisig(1, keys);\n\n    txFrom.vout[0].scriptPubKey = payScriptHash1;\n    txFrom.vout[1].scriptPubKey = pay1;\n    txFrom.vout[2].scriptPubKey = pay1of3;\n\n    \/\/ Last three non-standard:\n    CScript empty;\n    keystore.AddCScript(empty);\n    txFrom.vout[3].scriptPubKey = empty;\n    \/\/ Can't use SetPayToScriptHash, it checks for the empty Script. So:\n    txFrom.vout[4].scriptPubKey << OP_HASH160 << Hash160(empty) << OP_EQUAL;\n    CScript oneOfEleven;\n    oneOfEleven << OP_1;\n    for (int i = 0; i < 11; i++)\n        oneOfEleven << key[0].GetPubKey();\n    oneOfEleven << OP_11 << OP_CHECKMULTISIG;\n    txFrom.vout[5].scriptPubKey.SetDestination(oneOfEleven.GetID());\n\n    mapInputs[txFrom.GetHash()] = std::make_pair(CTxIndex(), txFrom);\n\n    CTransaction txTo;\n    txTo.vout.resize(1);\n    txTo.vout[0].scriptPubKey.SetDestination(key[1].GetPubKey().GetID());\n\n    txTo.vin.resize(3);\n    txTo.vin[0].prevout.n = 0;\n    txTo.vin[0].prevout.hash = txFrom.GetHash();\n    BOOST_CHECK(SignSignature(keystore, txFrom, txTo, 0));\n    txTo.vin[1].prevout.n = 1;\n    txTo.vin[1].prevout.hash = txFrom.GetHash();\n    BOOST_CHECK(SignSignature(keystore, txFrom, txTo, 1));\n    txTo.vin[2].prevout.n = 2;\n    txTo.vin[2].prevout.hash = txFrom.GetHash();\n    BOOST_CHECK(SignSignature(keystore, txFrom, txTo, 2));\n\n    BOOST_CHECK(::AreInputsStandard(txTo, mapInputs));\n    BOOST_CHECK_EQUAL(GetP2SHSigOpCount(txTo, mapInputs), (unsigned int) 1);\n\n    \/\/ Make sure adding crap to the scriptSigs makes them non-standard:\n    for (int i = 0; i < 3; i++)\n    {\n        CScript t = txTo.vin[i].scriptSig;\n        txTo.vin[i].scriptSig = (CScript() << 11) + t;\n        BOOST_CHECK(!::AreInputsStandard(txTo, mapInputs));\n        txTo.vin[i].scriptSig = t;\n    }\n\n    CTransaction txToNonStd;\n    txToNonStd.vout.resize(1);\n    txToNonStd.vout[0].scriptPubKey.SetDestination(key[1].GetPubKey().GetID());\n    txToNonStd.vin.resize(2);\n    txToNonStd.vin[0].prevout.n = 4;\n    txToNonStd.vin[0].prevout.hash = txFrom.GetHash();\n    txToNonStd.vin[0].scriptSig << Serialize(empty);\n    txToNonStd.vin[1].prevout.n = 5;\n    txToNonStd.vin[1].prevout.hash = txFrom.GetHash();\n    txToNonStd.vin[1].scriptSig << OP_0 << Serialize(oneOfEleven);\n\n    BOOST_CHECK(!::AreInputsStandard(txToNonStd, mapInputs));\n    BOOST_CHECK_EQUAL(GetP2SHSigOpCount(txToNonStd, mapInputs), (unsigned int) 11);\n\n    txToNonStd.vin[0].scriptSig.clear();\n    BOOST_CHECK(!::AreInputsStandard(txToNonStd, mapInputs));\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<|endoftext|>"}
{"text":"<commit_before>#include <string>\n#include <vector>\n#include <unistd.h>\n#include <gtest\/gtest.h>\n#include <scxcorelib\/scxstrencodingconv.h>\n#include \"getusername.h\"\n\nclass GetUserNameTest : public ::testing::Test {\nprotected:\n\tDWORD lpnSize;\n\tstd::vector<WCHAR_T> lpBuffer;\n\tBOOL result;\n\tstd::string expectedUsername;\n\n\tGetUserNameTest(): expectedUsername(std::string(getlogin())) {}\n\n\tvoid TestWithSize(DWORD size) {\n\t\tlpnSize = size;\n\t\t\/\/ allocate a WCHAR_T buffer to receive username\n\t\tlpBuffer.assign(lpnSize, '\\0');\n\t\tresult = GetUserName(&lpBuffer[0], &lpnSize);\n\t}\n\n\tvoid TestSuccess() {\n\t\tSCOPED_TRACE(\"\");\n\t\t\/\/ returns 1 on success\n\t\tEXPECT_EQ(1, result);\n\n\t\t\/\/ sets lpnSize to length of username + null\n\t\tASSERT_EQ(expectedUsername.size()+1, lpnSize);\n\n\t\t\/\/ copy UTF-16 bytes (excluding null) from lpBuffer to vector for conversion\n\t\tunsigned char *begin = reinterpret_cast<unsigned char *>(&lpBuffer[0]);\n\t\t\/\/ -1 to skip null; *2 because UTF-16 encodes two bytes per character\n\t\tunsigned char *end = begin + (lpnSize-1)*2;\n\t\tstd::vector<unsigned char> input(begin, end);\n\t\t\/\/ convert to UTF-8 for comparison\n\t\tstd::string output;\n\t\tSCXCoreLib::Utf16leToUtf8(input, output);\n\n\t\tEXPECT_EQ(expectedUsername, output);\n\t}\n\n\tvoid TestInvalidParameter() {\n\t\tSCOPED_TRACE(\"\");\n\n\t\t\/\/ returns 0 on failure\n\t\tEXPECT_EQ(0, result);\n\n\t\t\/\/ sets errno to ERROR_INVALID_PARAMETER when lpBuffer is null\n\t\t\/\/ (which is the case for an empty vector)\n\t\tEXPECT_EQ(errno, ERROR_INVALID_PARAMETER);\n\t}\n\n\tvoid TestInsufficientBuffer() {\n\t\tSCOPED_TRACE(\"\");\n\n\t\t\/\/ returns 0 on failure\n\t\tEXPECT_EQ(0, result);\n\n\t\t\/\/ sets errno to ERROR_INSUFFICIENT_BUFFER\n\t\tEXPECT_EQ(errno, ERROR_INSUFFICIENT_BUFFER);\n\n\t\t\/\/ sets lpnSize to length of username + null\n\t\tEXPECT_EQ(expectedUsername.size()+1, lpnSize);\n\t}\n};\n\nTEST_F(GetUserNameTest, BufferAsNullButNotBufferSize) {\n\tlpnSize = 1;\n\tresult = GetUserName(NULL, &lpnSize);\n\n\tTestInvalidParameter();\n\t\/\/ does not reset lpnSize\n\tEXPECT_EQ(1, lpnSize);\n}\n\nTEST_F(GetUserNameTest, BufferSizeAsNullButNotBuffer) {\n\tlpBuffer.push_back('\\0');\n\tresult = GetUserName(&lpBuffer[0], NULL);\n\n\tTestInvalidParameter();\n}\n\nTEST_F(GetUserNameTest, BufferSizeAsZero) {\n\tTestWithSize(0);\n\tTestInvalidParameter();\n\t\/\/ does not reset lpnSize\n\tEXPECT_EQ(0, lpnSize);\n}\n\nTEST_F(GetUserNameTest, BufferSizeAsOne) {\n\t\/\/ theoretically this should never fail because any non-empty\n\t\/\/ username length will be >1 with trailing null\n\tTestWithSize(1);\n\tTestInsufficientBuffer();\n}\n\nTEST_F(GetUserNameTest, BufferSizeAsUserName) {\n\t\/\/ the buffer is too small because this does not include null\n\tTestWithSize(expectedUsername.size());\n\tTestInsufficientBuffer();\n}\n\nTEST_F(GetUserNameTest, BufferSizeAsUserNameMinusOne) {\n\t\/\/ the buffer is also too small\n\tTestWithSize(expectedUsername.size()-1);\n\tTestInsufficientBuffer();\n}\n\nTEST_F(GetUserNameTest, BufferSizeAsUserNamePlusOne) {\n\t\/\/ the buffer is exactly big enough will null\n\tTestWithSize(expectedUsername.size()+1);\n\tTestSuccess();\n}\n\nTEST_F(GetUserNameTest, BufferSizeAsLoginNameMax) {\n\t\/\/ LoginNameMax is big enough to hold any username\n\tTestWithSize(LOGIN_NAME_MAX);\n\tTestSuccess();\n}\n<commit_msg>Update GetUserName tests<commit_after>#include <string>\n#include <unistd.h>\n#include <gtest\/gtest.h>\n#include <unicode\/utypes.h>\n#include <unicode\/ucnv.h>\n#include <unicode\/ustring.h>\n#include <unicode\/uchar.h>\n#include \"getusername.h\"\n\nclass GetUserNameTest : public ::testing::Test {\nprotected:\n\tDWORD lpnSize;\n\tstd::vector<WCHAR_T> lpBuffer;\n\tBOOL result;\n\tstd::string expectedUsername;\n\tDWORD expectedSize;\n\n\tGetUserNameTest(): expectedUsername(std::string(getlogin())),\n\t                   expectedSize((expectedUsername.length()+1)*sizeof(char16_t))\n\t{}\n\n\tvoid TestWithSize(DWORD size) {\n\t\tlpnSize = size;\n\t\t\/\/ allocate a WCHAR_T buffer to receive username\n\t\tlpBuffer.assign(lpnSize, '\\0');\n\t\tresult = GetUserName(&lpBuffer[0], &lpnSize);\n\t}\n\n\tvoid TestSuccess() {\n\t\tSCOPED_TRACE(\"\");\n\n\t\t\/\/ returns 1 on success\n\t\tEXPECT_EQ(1, result);\n\n\t\t\/\/ sets lpnSize to number of bytes including null,\n\t\t\/\/ note that this is (length+1)*sizeof(char16_t)\n\t\tASSERT_EQ(expectedSize, lpnSize);\n\n\t\t\/\/ setup for conversion from UTF-16LE\n\t\tconst char *begin = reinterpret_cast<char *>(&lpBuffer[0]);\n\t\ticu::UnicodeString username16(begin, lpnSize, \"UTF-16LE\");\n\t\t\/\/ username16 length includes null and is number of characters\n\t\tASSERT_EQ(expectedUsername.length()+1, username16.length());\n\n\t\t\/\/ convert (minus null) to UTF-8 for comparison\n\t\tstd::string username(lpnSize\/sizeof(char16_t)-1, 0);\n\t\tASSERT_EQ(expectedUsername.length(), username.length());\n\t\tint32_t targetSize = username16.extract(0, username.length(),\n\t\t                                        reinterpret_cast<char *>(&username[0]),\n\t\t                                        \"UTF-8\");\n\n\t\tEXPECT_EQ(expectedUsername, username);\n\t}\n\n\tvoid TestInvalidParameter() {\n\t\tSCOPED_TRACE(\"\");\n\n\t\t\/\/ returns 0 on failure\n\t\tEXPECT_EQ(0, result);\n\n\t\t\/\/ sets errno to ERROR_INVALID_PARAMETER when lpBuffer is null\n\t\t\/\/ (which is the case for an empty vector)\n\t\tEXPECT_EQ(errno, ERROR_INVALID_PARAMETER);\n\t}\n\n\tvoid TestInsufficientBuffer() {\n\t\tSCOPED_TRACE(\"\");\n\n\t\t\/\/ returns 0 on failure\n\t\tEXPECT_EQ(0, result);\n\n\t\t\/\/ sets errno to ERROR_INSUFFICIENT_BUFFER\n\t\tEXPECT_EQ(errno, ERROR_INSUFFICIENT_BUFFER);\n\n\t\t\/\/ sets lpnSize to length of username + null\n\t\tEXPECT_EQ(expectedSize, lpnSize);\n\t}\n};\n\nTEST_F(GetUserNameTest, BufferAsNullButNotBufferSize) {\n\tlpnSize = 1;\n\tresult = GetUserName(NULL, &lpnSize);\n\n\tTestInvalidParameter();\n\t\/\/ does not reset lpnSize\n\tEXPECT_EQ(1, lpnSize);\n}\n\nTEST_F(GetUserNameTest, BufferSizeAsNullButNotBuffer) {\n\tlpBuffer.push_back('\\0');\n\tresult = GetUserName(&lpBuffer[0], NULL);\n\n\tTestInvalidParameter();\n}\n\nTEST_F(GetUserNameTest, BufferSizeAsZero) {\n\tTestWithSize(0);\n\tTestInvalidParameter();\n\t\/\/ does not reset lpnSize\n\tEXPECT_EQ(0, lpnSize);\n}\n\nTEST_F(GetUserNameTest, BufferSizeAsOne) {\n\t\/\/ theoretically this should never fail because any non-empty\n\t\/\/ username length will be >1 with trailing null\n\tTestWithSize(1);\n\tTestInsufficientBuffer();\n}\n\nTEST_F(GetUserNameTest, BufferSizeAsUsername) {\n\t\/\/ the buffer is too small because this is a UTF-8 size\n\tTestWithSize(expectedUsername.size());\n\tTestInsufficientBuffer();\n}\n\nTEST_F(GetUserNameTest, BufferSizeAsUsernamePlusOne) {\n\t\/\/ the buffer is still too small even with null\n\tTestWithSize(expectedUsername.size()+1);\n\tTestInsufficientBuffer();\n}\n\nTEST_F(GetUserNameTest, BufferSizeAsUsernameInUTF16) {\n\t\/\/ the buffer is still too small because it is missing null\n\tTestWithSize(expectedUsername.size()*sizeof(char16_t));\n\tTestInsufficientBuffer();\n}\n\nTEST_F(GetUserNameTest, BufferSizeAsUsernamePlusOneInUTF16) {\n\t\/\/ the buffer is exactly big enough\n\tTestWithSize((expectedUsername.size()+1)*sizeof(char16_t));\n\tTestSuccess();\n}\n\nTEST_F(GetUserNameTest, BufferSizeAsExpectedSize) {\n\t\/\/ expectedSize is the same as username.size()+1 in UTF16\n\tTestWithSize(expectedSize);\n\tTestSuccess();\n}\n\nTEST_F(GetUserNameTest, BufferSizeAsLoginNameMax) {\n\t\/\/ LoginNameMax is big enough to hold any username\n\tTestWithSize(LOGIN_NAME_MAX);\n\tTestSuccess();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n  This is a tool shipped by 'Aleph - A Library for Exploring Persistent\n  Homology'.\n\n  Given an input filename and a radius parameter, the tool first does a\n  Čech complex expansion. Afterwards, a *spine* in the PL sense will be\n  calculated using different methods.\n\n  If desired, all simplicial complexes generated by this method will be\n  rendered as TikZ pictures for LaTeX output.\n\n  Original author: Bastian Rieck\n*\/\n\n#include <iostream>\n#include <string>\n\n#include <aleph\/containers\/PointCloud.hh>\n\n#include <aleph\/geometry\/CechComplex.hh>\n\n#include <aleph\/topology\/Spine.hh>\n\n#include <aleph\/topology\/io\/TikZ.hh>\n\n#include <getopt.h>\n\nusing DataType   = double;\nusing PointCloud = aleph::containers::PointCloud<DataType>;\n\nvoid usage()\n{\n}\n\nint main( int argc, char** argv )\n{\n  std::string method = \"dumb\";\n  DataType radius    = DataType();\n  bool tikzOutput    = false;\n\n  {\n    static option commandLineOptions[] =\n    {\n      { \"radius\"     , required_argument, nullptr, 'r' },\n      { \"spine\"      , required_argument, nullptr, 's' },\n      { \"tikz\"       , no_argument      , nullptr, 't' },\n      { nullptr      , 0                , nullptr,  0  }\n    };\n\n    int option = 0;\n    while( ( option = getopt_long( argc, argv, \"r:st\", commandLineOptions, nullptr ) ) != -1 )\n    {\n      switch( option )\n      {\n      case 'r':\n        radius = static_cast<DataType>( std::stod( optarg ) );\n        break;\n      case 's':\n        method = optarg;\n        break;\n      case 't':\n        tikzOutput = true;\n        break;\n      }\n    }\n  }\n\n  if( ( argc - optind ) < 1 )\n  {\n    usage();\n    return -1;\n  }\n\n  std::string filename = argv[ optind++ ];\n\n  \/\/ 1. Point cloud loading --------------------------------------------\n\n  std::cerr << \"* Loading point cloud from '\" << filename << \"'...\";\n\n  auto pointCloud\n    = aleph::containers::load<DataType>( filename );\n\n  std::cerr << \"finished\\n\"\n            << \"* Point cloud contains \" << pointCloud.size() << \" points of dimensionality \" << pointCloud.dimension() << \"\\n\";\n\n  \/\/ 2. Čech complex calculation ---------------------------------------\n\n  std::cerr << \"* Calculating Čech complex with r=\" << radius << \"...\";\n\n  auto simplicialComplex\n    = aleph::geometry::buildCechComplex(\n        pointCloud,\n        radius\n  );\n\n  std::cerr << \"finished\\n\"\n            << \"* Čech complex contains \" << simplicialComplex.size() << \" simplices\\n\";\n\n  using SimplicialComplex = decltype( simplicialComplex );\n\n  \/\/ 3. Spine calculation ----------------------------------------------\n\n  std::cerr << \"* Calculating spine (\" << method << \" method)...\";\n\n  SimplicialComplex spine;\n  if( method == \"dumb\" )\n    spine = aleph::topology::dumb::spine( simplicialComplex );\n\n  \/\/ Not so many choices here for now, to be honest...\n  else\n    spine = aleph::topology::spine( simplicialComplex );\n\n  std::cerr << \"finished\\n\";\n\n  \/\/ 4. Output ---------------------------------------------------------\n\n  if( tikzOutput )\n  {\n    std::cout << \"\\\\documentclass{standalone}\\n\"\n              << \"\\\\usepackage{tikz}\\n\"\n              << \"\\\\begin{document}\\n\";\n\n    aleph::topology::io::TikZ writer;\n\n    writer.showBalls( true );\n    writer.ballRadius( radius );\n\n    writer( std::cout,\n            simplicialComplex,\n            pointCloud );\n\n    std::cout << \"\\n\\n\";\n\n    writer.showBalls( false );\n    writer( std::cout,\n            spine,\n            pointCloud );\n\n    std::cout << \"\\\\end{document}\\n\";\n  }\n  else\n    std::cout << spine << \"\\n\";\n}\n<commit_msg>Updated output<commit_after>\/*\n  This is a tool shipped by 'Aleph - A Library for Exploring Persistent\n  Homology'.\n\n  Given an input filename and a radius parameter, the tool first does a\n  Čech complex expansion. Afterwards, a *spine* in the PL sense will be\n  calculated using different methods.\n\n  If desired, all simplicial complexes generated by this method will be\n  rendered as TikZ pictures for LaTeX output.\n\n  Original author: Bastian Rieck\n*\/\n\n#include <iostream>\n#include <string>\n\n#include <aleph\/containers\/PointCloud.hh>\n\n#include <aleph\/geometry\/CechComplex.hh>\n\n#include <aleph\/topology\/Spine.hh>\n\n#include <aleph\/topology\/io\/TikZ.hh>\n\n#include <getopt.h>\n\nusing DataType   = double;\nusing PointCloud = aleph::containers::PointCloud<DataType>;\n\nvoid usage()\n{\n}\n\nint main( int argc, char** argv )\n{\n  std::string method = \"dumb\";\n  DataType radius    = DataType();\n  bool tikzOutput    = false;\n\n  {\n    static option commandLineOptions[] =\n    {\n      { \"radius\"     , required_argument, nullptr, 'r' },\n      { \"spine\"      , required_argument, nullptr, 's' },\n      { \"tikz\"       , no_argument      , nullptr, 't' },\n      { nullptr      , 0                , nullptr,  0  }\n    };\n\n    int option = 0;\n    while( ( option = getopt_long( argc, argv, \"r:st\", commandLineOptions, nullptr ) ) != -1 )\n    {\n      switch( option )\n      {\n      case 'r':\n        radius = static_cast<DataType>( std::stod( optarg ) );\n        break;\n      case 's':\n        method = optarg;\n        break;\n      case 't':\n        tikzOutput = true;\n        break;\n      }\n    }\n  }\n\n  if( ( argc - optind ) < 1 )\n  {\n    usage();\n    return -1;\n  }\n\n  std::string filename = argv[ optind++ ];\n\n  \/\/ 1. Point cloud loading --------------------------------------------\n\n  std::cerr << \"* Loading point cloud from '\" << filename << \"'...\";\n\n  auto pointCloud\n    = aleph::containers::load<DataType>( filename );\n\n  std::cerr << \"finished\\n\"\n            << \"* Point cloud contains \" << pointCloud.size() << \" points of dimensionality \" << pointCloud.dimension() << \"\\n\";\n\n  \/\/ 2. Čech complex calculation ---------------------------------------\n\n  std::cerr << \"* Calculating Čech complex with r=\" << radius << \"...\";\n\n  auto simplicialComplex\n    = aleph::geometry::buildCechComplex(\n        pointCloud,\n        radius\n  );\n\n  std::cerr << \"finished\\n\"\n            << \"* Čech complex contains \" << simplicialComplex.size() << \" simplices\\n\";\n\n  using SimplicialComplex = decltype( simplicialComplex );\n\n  \/\/ 3. Spine calculation ----------------------------------------------\n\n  std::cerr << \"* Calculating spine (\" << method << \" method)...\";\n\n  SimplicialComplex spine;\n  if( method == \"dumb\" )\n    spine = aleph::topology::dumb::spine( simplicialComplex );\n\n  \/\/ Not so many choices here for now, to be honest...\n  else\n    spine = aleph::topology::spine( simplicialComplex );\n\n  std::cerr << \"finished\\n\"\n            << \"* Spine contains \" << spine.size() << \" simplices\\n\";\n\n  \/\/ 4. Output ---------------------------------------------------------\n\n  if( tikzOutput )\n  {\n    std::cout << \"\\\\documentclass{standalone}\\n\"\n              << \"\\\\usepackage{tikz}\\n\"\n              << \"\\\\begin{document}\\n\";\n\n    aleph::topology::io::TikZ writer;\n\n    writer.showBalls( true );\n    writer.ballRadius( radius );\n\n    writer( std::cout,\n            simplicialComplex,\n            pointCloud );\n\n    std::cout << \"\\n\\n\";\n\n    writer.showBalls( false );\n    writer( std::cout,\n            spine,\n            pointCloud );\n\n    std::cout << \"\\\\end{document}\\n\";\n  }\n  else\n    std::cout << spine << \"\\n\";\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2014-2015, THUNDERBEAST GAMES LLC All rights reserved\n\/\/ Please see LICENSE.md in repository root for license information\n\/\/ https:\/\/github.com\/AtomicGameEngine\/AtomicGameEngine\n\n\n#include \"Precompiled.h\"\n#include \"..\/Core\/Context.h\"\n#include \"..\/IO\/Log.h\"\n#ifdef ATOMIC_PHYSICS\n#include \"..\/Physics\/PhysicsEvents.h\"\n#include \"..\/Physics\/PhysicsWorld.h\"\n#endif\n#include \"..\/Core\/Profiler.h\"\n#include \"..\/IO\/MemoryBuffer.h\"\n#include \"..\/Resource\/ResourceCache.h\"\n#include \"..\/Resource\/ResourceEvents.h\"\n#include \"..\/Scene\/Scene.h\"\n#include \"..\/Scene\/SceneEvents.h\"\n#include \"..\/Javascript\/Javascript.h\"\n\n#include \"..\/Atomic2D\/PhysicsEvents2D.h\"\n#include \"..\/Atomic2D\/PhysicsWorld2D.h\"\n#include \"..\/Atomic2D\/RigidBody2D.h\"\n\n#include \"..\/Javascript\/JSEvents.h\"\n#include \"..\/Javascript\/JSComponent.h\"\n#include \"..\/Javascript\/JSAPI.h\"\n\n#include \"..\/UI\/UIEvents.h\"\n#include \"..\/UI\/UIElement.h\"\n\nnamespace Atomic\n{\n\nstatic const char* methodDeclarations[] = {\n    \"start\",\n    \"stop\",\n    \"delayedStart\",\n    \"update\",\n    \"postUpdate\",\n    \"fixedUpdate\",\n    \"fixedPostUpdate\",\n    \"load\",\n    \"save\",\n    \"readNetworkUpdate\",\n    \"writeNetworkUpdate\",\n    \"applyAttributes\",\n    \"transformChanged\"\n};\n\n\nextern const char* LOGIC_CATEGORY;\n\nJSComponent::JSComponent(Context* context) :\n    Component(context),\n    script_(GetSubsystem<Javascript>()),\n    scriptObject_(0),\n    subscribed_(false),\n    subscribedPostFixed_(false),\n    started_(false),\n    destroyed_(false)\n{\n    vm_ = JSVM::GetJSVM(NULL);\n    ClearScriptMethods();\n}\n\nJSComponent::~JSComponent()\n{\n}\n\nvoid JSComponent::OnNodeSet(Node *node)\n{\n    Component::OnNodeSet(node);\n\n    if (node)\n    {\n        assert(node->JSGetHeapPtr());\n\n        duk_context* ctx = vm_->GetJSContext();\n        duk_push_global_stash(ctx);\n        duk_get_prop_index(ctx, -1, JS_GLOBALSTASH_INDEX_NODE_REGISTRY);\n        \/\/ can't use instance as key, as this coerces to [Object] for\n        \/\/ string property, pointer will be string representation of\n        \/\/ address, so, unique key\n        duk_push_pointer(ctx, node->JSGetHeapPtr());\n        js_push_class_object_instance(ctx, node);\n        duk_put_prop(ctx, -3);\n        duk_pop_2(ctx);\n    }\n}\n\nvoid JSComponent::RegisterObject(Context* context)\n{\n    context->RegisterFactory<JSComponent>(LOGIC_CATEGORY);\n\n    \/\/ACCESSOR_ATTRIBUTE(JSComponent, VAR_BOOL, \"Is Enabled\", IsEnabled, SetEnabled, bool, true, AM_DEFAULT);\n    \/\/REF_ACCESSOR_ATTRIBUTE(JSComponent, VAR_STRING, \"Class Name\", GetClassName, SetClassName, String, String::EMPTY, AM_DEFAULT);\n\n    \/\/ACCESSOR_ATTRIBUTE(JSComponent, VAR_RESOURCEREF, \"Script File\", GetScriptFileAttr, SetScriptFileAttr, ResourceRef, ResourceRef(JSFile::GetTypeStatic()), AM_DEFAULT);\n    \/\/ACCESSOR_ATTRIBUTE(JSComponent, VAR_BUFFER, \"Delayed Method Calls\", GetDelayedCallsAttr, SetDelayedCallsAttr, PODVector<unsigned char>, Variant::emptyBuffer, AM_FILE | AM_NOEDIT);\n    \/\/ACCESSOR_ATTRIBUTE(JSComponent, VAR_BUFFER, \"Script Data\", GetScriptDataAttr, SetScriptDataAttr, PODVector<unsigned char>, Variant::emptyBuffer, AM_FILE | AM_NOEDIT);\n    \/\/ACCESSOR_ATTRIBUTE(JSComponent, VAR_BUFFER, \"Script Network Data\", GetScriptNetworkDataAttr, SetScriptNetworkDataAttr, PODVector<unsigned char>, Variant::emptyBuffer, AM_NET | AM_NOEDIT);\n}\n\nvoid JSComponent::ClearScriptMethods()\n{\n    for (unsigned i = 0; i < MAX_JSSCRIPT_METHODS; ++i)\n        methods_[i] = 0;\n\n    \/\/delayedCalls_.Clear();\n}\n\nvoid JSComponent::OnSetEnabled()\n{\n    UpdateEventSubscription();\n}\n\nvoid JSComponent::ListenToEvent(Object* sender, StringHash eventType, JS_HEAP_PTR __duk_function)\n{\n    duk_context* ctx = vm_->GetJSContext();\n    duk_push_heapptr(ctx, __duk_function);\n    assert(duk_is_function(ctx, -1));\n    duk_pop(ctx);\n\n    scriptEventFunctions_[eventType] = __duk_function;\n    if (sender)\n        SubscribeToEvent(sender, eventType, HANDLER(JSComponent, HandleScriptEvent));\n    else\n        SubscribeToEvent(eventType, HANDLER(JSComponent, HandleScriptEvent));\n\n}\n\nbool JSComponent::CreateObject(JSFile* scriptFile, const String& className)\n{\n    className_ = String::EMPTY; \/\/ Do not create object during SetScriptFile()\n    SetScriptFile(scriptFile);\n    SetClassName(className);\n    return scriptObject_ != 0;\n}\n\nvoid JSComponent::SetClassName(const String& className)\n{\n    if (className == className_ && scriptObject_)\n        return;\n\n    ReleaseObject();\n\n    className_ = className;\n    CreateObject();\n    MarkNetworkUpdate();\n}\n\n\nvoid JSComponent::ReleaseObject()\n{\n    if (scriptObject_)\n    {\n        \/\/if (methods_[JSMETHOD_STOP])\n        \/\/    scriptFile_->Execute(scriptObject_, methods_[JSMETHOD_STOP]);\n\n        PODVector<StringHash> exceptions;\n        exceptions.Push(E_RELOADSTARTED);\n        exceptions.Push(E_RELOADFINISHED);\n        UnsubscribeFromAllEventsExcept(exceptions, false);\n\n        if (node_)\n            node_->RemoveListener(this);\n\n        subscribed_ = false;\n        subscribedPostFixed_ = false;\n\n        ClearScriptMethods();\n\n        scriptObject_ = 0;\n    }\n}\n\n\nvoid JSComponent::SetScriptFile(JSFile* scriptFile)\n{\n\n    ReleaseObject();\n\n    CreateObject();\n    MarkNetworkUpdate();\n}\n\nvoid JSComponent::CreateObject()\n{\n    if (className_.Empty())\n        return;\n\n    PROFILE(CreateScriptObject);\n\n    duk_context* ctx = vm_->GetJSContext();\n\n    duk_push_global_stash(ctx);\n    duk_get_prop_index(ctx, -1, JS_GLOBALSTASH_INDEX_COMPONENTS);\n    duk_get_prop_string(ctx, -1, className_.CString());\n    assert(duk_is_function(ctx, -1));\n\n    js_push_class_object_instance(ctx, this);\n\n    if (duk_pcall(ctx, 1) != 0)\n    {\n        vm_->SendJSErrorEvent();\n    }\n    else\n    {\n        scriptObject_ = this->JSGetHeapPtr();\n    }\n\n    if (scriptObject_)\n    {\n        GetScriptMethods();\n        UpdateEventSubscription();\n    }\n\n\n    duk_pop_n(ctx, 2);\n}\n\nvoid JSComponent::HandleSceneUpdate(StringHash eventType, VariantMap& eventData)\n{\n    if (!scriptObject_)\n        return;\n\n    assert(!destroyed_);\n\n    assert(JSGetHeapPtr());\n\n    using namespace SceneUpdate;\n\n    float timeStep = eventData[P_TIMESTEP].GetFloat();\n\n    duk_context* ctx = vm_->GetJSContext();\n\n    if (!started_)\n    {\n        started_ = true;\n\n        if (methods_[JSMETHOD_START])\n        {\n            duk_push_heapptr(ctx, methods_[JSMETHOD_START]);\n            if (duk_pcall(ctx, 0) != 0)\n            {\n                vm_->SendJSErrorEvent();\n            }\n\n            duk_pop(ctx);\n        }\n    }\n\n    if (methods_[JSMETHOD_UPDATE])\n    {        \n        duk_push_heapptr(ctx, methods_[JSMETHOD_UPDATE]);\n        duk_push_number(ctx, timeStep);\n\n        if ( duk_pcall(ctx, 1) != DUK_EXEC_SUCCESS)\n        {\n            if (duk_is_object(ctx, -1))\n            {\n                vm_->SendJSErrorEvent();\n            }\n            else\n            {\n                assert(0);\n            }\n        }\n\n        duk_pop(ctx);\n    }\n}\n\nvoid JSComponent::UpdateEventSubscription()\n{\n    Scene* scene = GetScene();\n    if (!scene)\n    {\n        LOGWARNING(\"Node is detached from scene, can not subscribe script object to update events\");\n        return;\n    }\n\n    bool enabled = scriptObject_ && IsEnabledEffective();\n\n    if (enabled)\n    {\n        if (!subscribed_ && (methods_[JSMETHOD_UPDATE] || methods_[JSMETHOD_DELAYEDSTART] ))\n        {\n            SubscribeToEvent(scene, E_SCENEUPDATE, HANDLER(JSComponent, HandleSceneUpdate));\n            subscribed_ = true;\n        }\n\n        if (!subscribedPostFixed_)\n        {\n            if (methods_[JSMETHOD_POSTUPDATE])\n                SubscribeToEvent(scene, E_SCENEPOSTUPDATE, HANDLER(JSComponent, HandleScenePostUpdate));\n\n#ifdef ATOMIC_PHYSICS\n            if (methods_[JSMETHOD_FIXEDUPDATE] || methods_[JSMETHOD_FIXEDPOSTUPDATE])\n            {\n                PhysicsWorld* world = scene->GetOrCreateComponent<PhysicsWorld>();\n                if (world)\n                {\n                    if (methods_[JSMETHOD_FIXEDUPDATE])\n                        SubscribeToEvent(world, E_PHYSICSPRESTEP, HANDLER(JSComponent, HandlePhysicsPreStep));\n                    if (methods_[JSMETHOD_FIXEDPOSTUPDATE])\n                        SubscribeToEvent(world, E_PHYSICSPOSTSTEP, HANDLER(JSComponent, HandlePhysicsPostStep));\n                }\n                else\n                    LOGERROR(\"No physics world, can not subscribe script object to fixed update events\");\n            }\n#endif\n            subscribedPostFixed_ = true;\n        }\n\n        if (methods_[JSMETHOD_TRANSFORMCHANGED])\n            node_->AddListener(this);\n    }\n    else\n    {\n        if (subscribed_)\n        {\n            UnsubscribeFromEvent(scene, E_SCENEUPDATE);\n            subscribed_ = false;\n        }\n\n        if (subscribedPostFixed_)\n        {\n            UnsubscribeFromEvent(scene, E_SCENEPOSTUPDATE);\n#ifdef ATOMIC_PHYSICS\n            PhysicsWorld* world = scene->GetComponent<PhysicsWorld>();\n            if (world)\n            {\n                UnsubscribeFromEvent(world, E_PHYSICSPRESTEP);\n                UnsubscribeFromEvent(world, E_PHYSICSPOSTSTEP);\n            }\n#endif\n\n            subscribedPostFixed_ = false;\n        }\n\n        if (methods_[JSMETHOD_TRANSFORMCHANGED])\n            node_->RemoveListener(this);\n    }\n}\n\n\nvoid JSComponent::HandleScenePostUpdate(StringHash eventType, VariantMap& eventData)\n{\n    if (!scriptObject_)\n        return;\n\n    assert(!destroyed_);\n\n    using namespace ScenePostUpdate;\n\n    if (methods_[JSMETHOD_POSTUPDATE])\n    {\n        duk_context* ctx = vm_->GetJSContext();\n        duk_push_heapptr(ctx, methods_[JSMETHOD_POSTUPDATE]);\n        duk_push_number(ctx, eventData[P_TIMESTEP].GetFloat());\n        duk_pcall(ctx, 1);\n        duk_pop(ctx);\n    }\n}\n\n#ifdef ATOMIC_PHYSICS\nvoid JSComponent::HandlePhysicsPreStep(StringHash eventType, VariantMap& eventData)\n{\n    if (!scriptObject_)\n        return;\n\n    assert(!destroyed_);\n\n    using namespace PhysicsPreStep;\n\n    float timeStep = eventData[P_TIMESTEP].GetFloat();\n\n    if (methods_[JSMETHOD_FIXEDUPDATE])\n    {\n        duk_context* ctx = vm_->GetJSContext();\n        duk_push_heapptr(ctx, methods_[JSMETHOD_FIXEDUPDATE]);\n        duk_push_number(ctx, timeStep);\n        duk_pcall(ctx, 1);\n        duk_pop(ctx);\n    }\n}\n\nvoid JSComponent::HandlePhysicsPostStep(StringHash eventType, VariantMap& eventData)\n{\n    if (!scriptObject_)\n        return;\n\n    assert(!destroyed_);\n\n    using namespace PhysicsPostStep;\n\n    VariantVector parameters;\n    parameters.Push(eventData[P_TIMESTEP]);\n}\n#endif\nvoid JSComponent::HandleScriptEvent(StringHash eventType, VariantMap& eventData)\n{\n    if (!IsEnabledEffective() || !scriptObject_)\n        return;\n\n    assert(!destroyed_);\n\n    if (scriptEventFunctions_.Contains(eventType))\n    {\n\n        duk_context* ctx = vm_->GetJSContext();\n        JS_HEAP_PTR function = scriptEventFunctions_[eventType];\n\n        if (eventType == E_UIMOUSECLICK)\n        {\n            UIElement* clicked = static_cast<UIElement*>(eventData[UIMouseClick::P_ELEMENT].GetPtr());\n            if (clicked)\n            {\n                duk_push_heapptr(ctx, function);\n                js_push_class_object_instance(ctx, clicked);\n\n                if (duk_pcall(ctx, 1) != 0)\n                {\n                    vm_->SendJSErrorEvent();\n                }\n\n                duk_pop(ctx);\n\n            }\n\n        }\n        else if (eventType == E_PHYSICSBEGINCONTACT2D || E_PHYSICSENDCONTACT2D)\n        {\n            using namespace PhysicsBeginContact2D;\n            PhysicsWorld2D* world = static_cast<PhysicsWorld2D*>(eventData[P_WORLD].GetPtr());\n            RigidBody2D* bodyA = static_cast<RigidBody2D*>(eventData[P_BODYA].GetPtr());\n            RigidBody2D* bodyB = static_cast<RigidBody2D*>(eventData[P_BODYB].GetPtr());\n            Node* nodeA = static_cast<Node*>(eventData[P_NODEA].GetPtr());\n            Node* nodeB = static_cast<Node*>(eventData[P_NODEB].GetPtr());\n\n            duk_push_heapptr(ctx, function);\n            js_push_class_object_instance(ctx, world);\n            js_push_class_object_instance(ctx, bodyA);\n            js_push_class_object_instance(ctx, bodyB);\n            js_push_class_object_instance(ctx, nodeA);\n            js_push_class_object_instance(ctx, nodeB);\n\n            if (duk_pcall(ctx, 5) != 0)\n            {\n                vm_->SendJSErrorEvent();\n            }\n\n            duk_pop(ctx);\n\n        }\n        else if (eventType == E_NODECOLLISION)\n        {\n            \/\/ Check collision contacts and see if character is standing on ground (look for a contact that has near vertical normal)\n            using namespace NodeCollision;\n            MemoryBuffer contacts(eventData[P_CONTACTS].GetBuffer());\n\n            while (!contacts.IsEof())\n            {\n                Vector3 contactPosition = contacts.ReadVector3();\n                Vector3 contactNormal = contacts.ReadVector3();\n                float contactDistance = contacts.ReadFloat();\n                float contactImpulse = contacts.ReadFloat();\n\n                duk_push_heapptr(ctx, function);\n\n                duk_push_array(ctx);\n                duk_push_number(ctx, contactPosition.x_);\n                duk_put_prop_index(ctx, -2, 0);\n                duk_push_number(ctx, contactPosition.y_);\n                duk_put_prop_index(ctx, -2, 1);\n                duk_push_number(ctx, contactPosition.z_);\n                duk_put_prop_index(ctx, -2, 2);\n\n                duk_push_array(ctx);\n                duk_push_number(ctx, contactNormal.x_);\n                duk_put_prop_index(ctx, -2, 0);\n                duk_push_number(ctx, contactNormal.y_);\n                duk_put_prop_index(ctx, -2, 1);\n                duk_push_number(ctx, contactNormal.z_);\n                duk_put_prop_index(ctx, -2, 2);\n\n                duk_call(ctx, 2);\n                duk_pop(ctx);\n\n            }\n\n        }\n        else\n        {\n            duk_push_heapptr(ctx, function);\n            if (duk_pcall(ctx, 0) != 0)\n            {\n                vm_->SendJSErrorEvent();\n            }\n\n            duk_pop(ctx);\n\n        }\n    }\n\n}\n\n\nvoid JSComponent::GetScriptMethods()\n{\n    if (!scriptObject_)\n        return;\n\n    duk_context* ctx = vm_->GetJSContext();\n    duk_push_heapptr(ctx, scriptObject_);\n\n    for (unsigned i = 0; i < MAX_JSSCRIPT_METHODS; ++i)\n    {\n        duk_get_prop_string(ctx, -1, methodDeclarations[i]);\n        if (duk_is_function(ctx, -1))\n        {\n            methods_[i] = duk_get_heapptr(ctx, -1);\n        }\n\n        duk_pop(ctx);\n    }\n\n    duk_pop(ctx);\n\n}\n\n\n\n\n}\n<commit_msg>Ensure we get at least one scene update on a JSComponent<commit_after>\/\/ Copyright (c) 2014-2015, THUNDERBEAST GAMES LLC All rights reserved\n\/\/ Please see LICENSE.md in repository root for license information\n\/\/ https:\/\/github.com\/AtomicGameEngine\/AtomicGameEngine\n\n\n#include \"Precompiled.h\"\n#include \"..\/Core\/Context.h\"\n#include \"..\/IO\/Log.h\"\n#ifdef ATOMIC_PHYSICS\n#include \"..\/Physics\/PhysicsEvents.h\"\n#include \"..\/Physics\/PhysicsWorld.h\"\n#endif\n#include \"..\/Core\/Profiler.h\"\n#include \"..\/IO\/MemoryBuffer.h\"\n#include \"..\/Resource\/ResourceCache.h\"\n#include \"..\/Resource\/ResourceEvents.h\"\n#include \"..\/Scene\/Scene.h\"\n#include \"..\/Scene\/SceneEvents.h\"\n#include \"..\/Javascript\/Javascript.h\"\n\n#include \"..\/Atomic2D\/PhysicsEvents2D.h\"\n#include \"..\/Atomic2D\/PhysicsWorld2D.h\"\n#include \"..\/Atomic2D\/RigidBody2D.h\"\n\n#include \"..\/Javascript\/JSEvents.h\"\n#include \"..\/Javascript\/JSComponent.h\"\n#include \"..\/Javascript\/JSAPI.h\"\n\n#include \"..\/UI\/UIEvents.h\"\n#include \"..\/UI\/UIElement.h\"\n\nnamespace Atomic\n{\n\nstatic const char* methodDeclarations[] = {\n    \"start\",\n    \"stop\",\n    \"delayedStart\",\n    \"update\",\n    \"postUpdate\",\n    \"fixedUpdate\",\n    \"fixedPostUpdate\",\n    \"load\",\n    \"save\",\n    \"readNetworkUpdate\",\n    \"writeNetworkUpdate\",\n    \"applyAttributes\",\n    \"transformChanged\"\n};\n\n\nextern const char* LOGIC_CATEGORY;\n\nJSComponent::JSComponent(Context* context) :\n    Component(context),\n    script_(GetSubsystem<Javascript>()),\n    scriptObject_(0),\n    subscribed_(false),\n    subscribedPostFixed_(false),\n    started_(false),\n    destroyed_(false)\n{\n    vm_ = JSVM::GetJSVM(NULL);\n    ClearScriptMethods();\n}\n\nJSComponent::~JSComponent()\n{\n}\n\nvoid JSComponent::OnNodeSet(Node *node)\n{\n    Component::OnNodeSet(node);\n\n    if (node)\n    {\n        assert(node->JSGetHeapPtr());\n\n        duk_context* ctx = vm_->GetJSContext();\n        duk_push_global_stash(ctx);\n        duk_get_prop_index(ctx, -1, JS_GLOBALSTASH_INDEX_NODE_REGISTRY);\n        \/\/ can't use instance as key, as this coerces to [Object] for\n        \/\/ string property, pointer will be string representation of\n        \/\/ address, so, unique key\n        duk_push_pointer(ctx, node->JSGetHeapPtr());\n        js_push_class_object_instance(ctx, node);\n        duk_put_prop(ctx, -3);\n        duk_pop_2(ctx);\n    }\n}\n\nvoid JSComponent::RegisterObject(Context* context)\n{\n    context->RegisterFactory<JSComponent>(LOGIC_CATEGORY);\n\n    \/\/ACCESSOR_ATTRIBUTE(JSComponent, VAR_BOOL, \"Is Enabled\", IsEnabled, SetEnabled, bool, true, AM_DEFAULT);\n    \/\/REF_ACCESSOR_ATTRIBUTE(JSComponent, VAR_STRING, \"Class Name\", GetClassName, SetClassName, String, String::EMPTY, AM_DEFAULT);\n\n    \/\/ACCESSOR_ATTRIBUTE(JSComponent, VAR_RESOURCEREF, \"Script File\", GetScriptFileAttr, SetScriptFileAttr, ResourceRef, ResourceRef(JSFile::GetTypeStatic()), AM_DEFAULT);\n    \/\/ACCESSOR_ATTRIBUTE(JSComponent, VAR_BUFFER, \"Delayed Method Calls\", GetDelayedCallsAttr, SetDelayedCallsAttr, PODVector<unsigned char>, Variant::emptyBuffer, AM_FILE | AM_NOEDIT);\n    \/\/ACCESSOR_ATTRIBUTE(JSComponent, VAR_BUFFER, \"Script Data\", GetScriptDataAttr, SetScriptDataAttr, PODVector<unsigned char>, Variant::emptyBuffer, AM_FILE | AM_NOEDIT);\n    \/\/ACCESSOR_ATTRIBUTE(JSComponent, VAR_BUFFER, \"Script Network Data\", GetScriptNetworkDataAttr, SetScriptNetworkDataAttr, PODVector<unsigned char>, Variant::emptyBuffer, AM_NET | AM_NOEDIT);\n}\n\nvoid JSComponent::ClearScriptMethods()\n{\n    for (unsigned i = 0; i < MAX_JSSCRIPT_METHODS; ++i)\n        methods_[i] = 0;\n\n    \/\/delayedCalls_.Clear();\n}\n\nvoid JSComponent::OnSetEnabled()\n{\n    UpdateEventSubscription();\n}\n\nvoid JSComponent::ListenToEvent(Object* sender, StringHash eventType, JS_HEAP_PTR __duk_function)\n{\n    duk_context* ctx = vm_->GetJSContext();\n    duk_push_heapptr(ctx, __duk_function);\n    assert(duk_is_function(ctx, -1));\n    duk_pop(ctx);\n\n    scriptEventFunctions_[eventType] = __duk_function;\n    if (sender)\n        SubscribeToEvent(sender, eventType, HANDLER(JSComponent, HandleScriptEvent));\n    else\n        SubscribeToEvent(eventType, HANDLER(JSComponent, HandleScriptEvent));\n\n}\n\nbool JSComponent::CreateObject(JSFile* scriptFile, const String& className)\n{\n    className_ = String::EMPTY; \/\/ Do not create object during SetScriptFile()\n    SetScriptFile(scriptFile);\n    SetClassName(className);\n    return scriptObject_ != 0;\n}\n\nvoid JSComponent::SetClassName(const String& className)\n{\n    if (className == className_ && scriptObject_)\n        return;\n\n    ReleaseObject();\n\n    className_ = className;\n    CreateObject();\n    MarkNetworkUpdate();\n}\n\n\nvoid JSComponent::ReleaseObject()\n{\n    if (scriptObject_)\n    {\n        \/\/if (methods_[JSMETHOD_STOP])\n        \/\/    scriptFile_->Execute(scriptObject_, methods_[JSMETHOD_STOP]);\n\n        PODVector<StringHash> exceptions;\n        exceptions.Push(E_RELOADSTARTED);\n        exceptions.Push(E_RELOADFINISHED);\n        UnsubscribeFromAllEventsExcept(exceptions, false);\n\n        if (node_)\n            node_->RemoveListener(this);\n\n        subscribed_ = false;\n        subscribedPostFixed_ = false;\n\n        ClearScriptMethods();\n\n        scriptObject_ = 0;\n    }\n}\n\n\nvoid JSComponent::SetScriptFile(JSFile* scriptFile)\n{\n\n    ReleaseObject();\n\n    CreateObject();\n    MarkNetworkUpdate();\n}\n\nvoid JSComponent::CreateObject()\n{\n    if (className_.Empty())\n        return;\n\n    PROFILE(CreateScriptObject);\n\n    duk_context* ctx = vm_->GetJSContext();\n\n    duk_push_global_stash(ctx);\n    duk_get_prop_index(ctx, -1, JS_GLOBALSTASH_INDEX_COMPONENTS);\n    duk_get_prop_string(ctx, -1, className_.CString());\n    assert(duk_is_function(ctx, -1));\n\n    js_push_class_object_instance(ctx, this);\n\n    if (duk_pcall(ctx, 1) != 0)\n    {\n        vm_->SendJSErrorEvent();\n    }\n    else\n    {\n        scriptObject_ = this->JSGetHeapPtr();\n    }\n\n    if (scriptObject_)\n    {\n        GetScriptMethods();\n        UpdateEventSubscription();\n    }\n\n\n    duk_pop_n(ctx, 2);\n}\n\nvoid JSComponent::HandleSceneUpdate(StringHash eventType, VariantMap& eventData)\n{\n    if (!scriptObject_)\n        return;\n\n    assert(!destroyed_);\n\n    assert(JSGetHeapPtr());\n\n    using namespace SceneUpdate;\n\n    float timeStep = eventData[P_TIMESTEP].GetFloat();\n\n    duk_context* ctx = vm_->GetJSContext();\n\n    if (!started_)\n    {\n        started_ = true;\n\n        if (methods_[JSMETHOD_START])\n        {\n            duk_push_heapptr(ctx, methods_[JSMETHOD_START]);\n            if (duk_pcall(ctx, 0) != 0)\n            {\n                vm_->SendJSErrorEvent();\n            }\n\n            duk_pop(ctx);\n        }\n    }\n\n    if (methods_[JSMETHOD_UPDATE])\n    {        \n        duk_push_heapptr(ctx, methods_[JSMETHOD_UPDATE]);\n        duk_push_number(ctx, timeStep);\n\n        if ( duk_pcall(ctx, 1) != DUK_EXEC_SUCCESS)\n        {\n            if (duk_is_object(ctx, -1))\n            {\n                vm_->SendJSErrorEvent();\n            }\n            else\n            {\n                assert(0);\n            }\n        }\n\n        duk_pop(ctx);\n    }\n    else\n    {\n        Scene* scene = GetScene();\n        if (scene)\n            UnsubscribeFromEvent(scene, E_SCENEUPDATE);\n        subscribed_ = false;\n    }\n}\n\nvoid JSComponent::UpdateEventSubscription()\n{\n    Scene* scene = GetScene();\n    if (!scene)\n    {\n        LOGWARNING(\"Node is detached from scene, can not subscribe script object to update events\");\n        return;\n    }\n\n    bool enabled = scriptObject_ && IsEnabledEffective();\n\n    if (enabled)\n    {\n        \/\/ we get at least one scene update if not started\n        if (!subscribed_ && (!started_ || (methods_[JSMETHOD_UPDATE] || methods_[JSMETHOD_DELAYEDSTART] )))\n        {\n            SubscribeToEvent(scene, E_SCENEUPDATE, HANDLER(JSComponent, HandleSceneUpdate));\n            subscribed_ = true;\n        }\n\n        if (!subscribedPostFixed_)\n        {\n            if (methods_[JSMETHOD_POSTUPDATE])\n                SubscribeToEvent(scene, E_SCENEPOSTUPDATE, HANDLER(JSComponent, HandleScenePostUpdate));\n\n#ifdef ATOMIC_PHYSICS\n            if (methods_[JSMETHOD_FIXEDUPDATE] || methods_[JSMETHOD_FIXEDPOSTUPDATE])\n            {\n                PhysicsWorld* world = scene->GetOrCreateComponent<PhysicsWorld>();\n                if (world)\n                {\n                    if (methods_[JSMETHOD_FIXEDUPDATE])\n                        SubscribeToEvent(world, E_PHYSICSPRESTEP, HANDLER(JSComponent, HandlePhysicsPreStep));\n                    if (methods_[JSMETHOD_FIXEDPOSTUPDATE])\n                        SubscribeToEvent(world, E_PHYSICSPOSTSTEP, HANDLER(JSComponent, HandlePhysicsPostStep));\n                }\n                else\n                    LOGERROR(\"No physics world, can not subscribe script object to fixed update events\");\n            }\n#endif\n            subscribedPostFixed_ = true;\n        }\n\n        if (methods_[JSMETHOD_TRANSFORMCHANGED])\n            node_->AddListener(this);\n    }\n    else\n    {\n        if (subscribed_)\n        {\n            UnsubscribeFromEvent(scene, E_SCENEUPDATE);\n            subscribed_ = false;\n        }\n\n        if (subscribedPostFixed_)\n        {\n            UnsubscribeFromEvent(scene, E_SCENEPOSTUPDATE);\n#ifdef ATOMIC_PHYSICS\n            PhysicsWorld* world = scene->GetComponent<PhysicsWorld>();\n            if (world)\n            {\n                UnsubscribeFromEvent(world, E_PHYSICSPRESTEP);\n                UnsubscribeFromEvent(world, E_PHYSICSPOSTSTEP);\n            }\n#endif\n\n            subscribedPostFixed_ = false;\n        }\n\n        if (methods_[JSMETHOD_TRANSFORMCHANGED])\n            node_->RemoveListener(this);\n    }\n}\n\n\nvoid JSComponent::HandleScenePostUpdate(StringHash eventType, VariantMap& eventData)\n{\n    if (!scriptObject_)\n        return;\n\n    assert(!destroyed_);\n\n    using namespace ScenePostUpdate;\n\n    if (methods_[JSMETHOD_POSTUPDATE])\n    {\n        duk_context* ctx = vm_->GetJSContext();\n        duk_push_heapptr(ctx, methods_[JSMETHOD_POSTUPDATE]);\n        duk_push_number(ctx, eventData[P_TIMESTEP].GetFloat());\n        duk_pcall(ctx, 1);\n        duk_pop(ctx);\n    }\n}\n\n#ifdef ATOMIC_PHYSICS\nvoid JSComponent::HandlePhysicsPreStep(StringHash eventType, VariantMap& eventData)\n{\n    if (!scriptObject_)\n        return;\n\n    assert(!destroyed_);\n\n    using namespace PhysicsPreStep;\n\n    float timeStep = eventData[P_TIMESTEP].GetFloat();\n\n    if (methods_[JSMETHOD_FIXEDUPDATE])\n    {\n        duk_context* ctx = vm_->GetJSContext();\n        duk_push_heapptr(ctx, methods_[JSMETHOD_FIXEDUPDATE]);\n        duk_push_number(ctx, timeStep);\n        duk_pcall(ctx, 1);\n        duk_pop(ctx);\n    }\n}\n\nvoid JSComponent::HandlePhysicsPostStep(StringHash eventType, VariantMap& eventData)\n{\n    if (!scriptObject_)\n        return;\n\n    assert(!destroyed_);\n\n    using namespace PhysicsPostStep;\n\n    VariantVector parameters;\n    parameters.Push(eventData[P_TIMESTEP]);\n}\n#endif\nvoid JSComponent::HandleScriptEvent(StringHash eventType, VariantMap& eventData)\n{\n    if (!IsEnabledEffective() || !scriptObject_)\n        return;\n\n    assert(!destroyed_);\n\n    if (scriptEventFunctions_.Contains(eventType))\n    {\n\n        duk_context* ctx = vm_->GetJSContext();\n        JS_HEAP_PTR function = scriptEventFunctions_[eventType];\n\n        if (eventType == E_UIMOUSECLICK)\n        {\n            UIElement* clicked = static_cast<UIElement*>(eventData[UIMouseClick::P_ELEMENT].GetPtr());\n            if (clicked)\n            {\n                duk_push_heapptr(ctx, function);\n                js_push_class_object_instance(ctx, clicked);\n\n                if (duk_pcall(ctx, 1) != 0)\n                {\n                    vm_->SendJSErrorEvent();\n                }\n\n                duk_pop(ctx);\n\n            }\n\n        }\n        else if (eventType == E_PHYSICSBEGINCONTACT2D || E_PHYSICSENDCONTACT2D)\n        {\n            using namespace PhysicsBeginContact2D;\n            PhysicsWorld2D* world = static_cast<PhysicsWorld2D*>(eventData[P_WORLD].GetPtr());\n            RigidBody2D* bodyA = static_cast<RigidBody2D*>(eventData[P_BODYA].GetPtr());\n            RigidBody2D* bodyB = static_cast<RigidBody2D*>(eventData[P_BODYB].GetPtr());\n            Node* nodeA = static_cast<Node*>(eventData[P_NODEA].GetPtr());\n            Node* nodeB = static_cast<Node*>(eventData[P_NODEB].GetPtr());\n\n            duk_push_heapptr(ctx, function);\n            js_push_class_object_instance(ctx, world);\n            js_push_class_object_instance(ctx, bodyA);\n            js_push_class_object_instance(ctx, bodyB);\n            js_push_class_object_instance(ctx, nodeA);\n            js_push_class_object_instance(ctx, nodeB);\n\n            if (duk_pcall(ctx, 5) != 0)\n            {\n                vm_->SendJSErrorEvent();\n            }\n\n            duk_pop(ctx);\n\n        }\n        else if (eventType == E_NODECOLLISION)\n        {\n            \/\/ Check collision contacts and see if character is standing on ground (look for a contact that has near vertical normal)\n            using namespace NodeCollision;\n            MemoryBuffer contacts(eventData[P_CONTACTS].GetBuffer());\n\n            while (!contacts.IsEof())\n            {\n                Vector3 contactPosition = contacts.ReadVector3();\n                Vector3 contactNormal = contacts.ReadVector3();\n                float contactDistance = contacts.ReadFloat();\n                float contactImpulse = contacts.ReadFloat();\n\n                duk_push_heapptr(ctx, function);\n\n                duk_push_array(ctx);\n                duk_push_number(ctx, contactPosition.x_);\n                duk_put_prop_index(ctx, -2, 0);\n                duk_push_number(ctx, contactPosition.y_);\n                duk_put_prop_index(ctx, -2, 1);\n                duk_push_number(ctx, contactPosition.z_);\n                duk_put_prop_index(ctx, -2, 2);\n\n                duk_push_array(ctx);\n                duk_push_number(ctx, contactNormal.x_);\n                duk_put_prop_index(ctx, -2, 0);\n                duk_push_number(ctx, contactNormal.y_);\n                duk_put_prop_index(ctx, -2, 1);\n                duk_push_number(ctx, contactNormal.z_);\n                duk_put_prop_index(ctx, -2, 2);\n\n                duk_call(ctx, 2);\n                duk_pop(ctx);\n\n            }\n\n        }\n        else\n        {\n            duk_push_heapptr(ctx, function);\n            if (duk_pcall(ctx, 0) != 0)\n            {\n                vm_->SendJSErrorEvent();\n            }\n\n            duk_pop(ctx);\n\n        }\n    }\n\n}\n\n\nvoid JSComponent::GetScriptMethods()\n{\n    if (!scriptObject_)\n        return;\n\n    duk_context* ctx = vm_->GetJSContext();\n    duk_push_heapptr(ctx, scriptObject_);\n\n    for (unsigned i = 0; i < MAX_JSSCRIPT_METHODS; ++i)\n    {\n        duk_get_prop_string(ctx, -1, methodDeclarations[i]);\n        if (duk_is_function(ctx, -1))\n        {\n            methods_[i] = duk_get_heapptr(ctx, -1);\n        }\n\n        duk_pop(ctx);\n    }\n\n    duk_pop(ctx);\n\n}\n\n\n\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/usr\/diag\/prdf\/plat\/mem\/prdfP9Mca.C $                      *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2016,2017                        *\/\n\/* [+] International Business Machines Corp.                              *\/\n\/*                                                                        *\/\n\/*                                                                        *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\");        *\/\n\/* you may not use this file except in compliance with the License.       *\/\n\/* You may obtain a copy of the License at                                *\/\n\/*                                                                        *\/\n\/*     http:\/\/www.apache.org\/licenses\/LICENSE-2.0                         *\/\n\/*                                                                        *\/\n\/* Unless required by applicable law or agreed to in writing, software    *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS,      *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or        *\/\n\/* implied. See the License for the specific language governing           *\/\n\/* permissions and limitations under the License.                         *\/\n\/*                                                                        *\/\n\/* IBM_PROLOG_END_TAG                                                     *\/\n\n\/\/ Framework includes\n#include <iipServiceDataCollector.h>\n#include <prdfExtensibleChip.H>\n#include <prdfPluginMap.H>\n\n\/\/ Platform includes\n#include <prdfMemEccAnalysis.H>\n#include <prdfP9McaDataBundle.H>\n#include <prdfP9McbistDataBundle.H>\n#include <prdfPlatServices.H>\n#ifdef __HOSTBOOT_RUNTIME\n  #include <prdfMemTps.H>\n#endif\n\n\nusing namespace TARGETING;\n\nnamespace PRDF\n{\n\nusing namespace PlatServices;\n\nnamespace p9_mca\n{\n\n\/\/##############################################################################\n\/\/\n\/\/                             Special plugins\n\/\/\n\/\/##############################################################################\n\n\/**\n * @brief  Plugin function called after analysis is complete but before PRD\n *         exits.\n * @param  i_chip An MCA chip.\n * @param  io_sc  The step code data struct.\n * @note   This is especially useful for any analysis that still needs to be\n *         done after the framework clears the FIR bits that were at attention.\n * @return SUCCESS.\n *\/\nint32_t PostAnalysis( ExtensibleChip * i_chip, STEP_CODE_DATA_STRUCT & io_sc )\n{\n    #define PRDF_FUNC \"[p9_mca::PostAnalysis] \"\n\n    #ifdef __HOSTBOOT_RUNTIME\n\n    \/\/ If the IUE threshold in our data bundle has been reached, we trigger\n    \/\/ a port fail. Once we trigger the port fail, the system may crash\n    \/\/ right away. Since PRD is running in the hypervisor, it is possible we\n    \/\/ may not get the error log. To better our chances, we trigger the port\n    \/\/ fail here after the error log has been committed.\n    if ( SUCCESS != MemEcc::iuePortFail<TYPE_MCA>(i_chip, io_sc) )\n    {\n        PRDF_ERR( PRDF_FUNC \"iuePortFail(0x%08x) failed\", i_chip->getHuid() );\n    }\n\n    #endif \/\/ __HOSTBOOT_RUNTIME\n\n    return SUCCESS; \/\/ Always return SUCCESS for this plugin.\n\n    #undef PRDF_FUNC\n}\nPRDF_PLUGIN_DEFINE( p9_mca, PostAnalysis );\n\n\n\/\/##############################################################################\n\/\/\n\/\/                               MCACALFIR\n\/\/\n\/\/##############################################################################\n\n\/**\n * @brief  MCACALFIR[4] - RCD Parity Error.\n * @param  i_mcaChip A P9 MCA chip.\n * @param  io_sc     The step code data struct.\n * @return SUCCESS\n *\/\nint32_t RcdParityError( ExtensibleChip * i_mcaChip,\n                        STEP_CODE_DATA_STRUCT & io_sc )\n{\n    #define PRDF_FUNC \"[p9_mca::RcdParityError] \"\n\n    \/\/ The callouts have already been made in the rule code. All other actions\n    \/\/ documented below.\n\n    \/\/ Nothing more to do if this is a checkstop attention.\n    if ( CHECK_STOP == io_sc.service_data->getPrimaryAttnType() )\n        return SUCCESS;\n\n    ExtensibleChip * mcbChip = getConnectedParent( i_mcaChip, TYPE_MCBIST );\n\n    #ifdef __HOSTBOOT_RUNTIME \/\/ TPS only supported at runtime.\n\n    \/\/ Recovery is always enabled during runtime. If the threshold is reached,\n    \/\/ make the error log predictive and start TPS on all slave ranks behind\n    \/\/ the MCA.\n    if ( getMcaDataBundle(i_mcaChip)->iv_rcdParityTh.inc(io_sc) )\n    {\n        io_sc.service_data->setServiceCall();\n\n        McbistDataBundle * mcbdb = getMcbistDataBundle( mcbChip );\n\n        std::vector<MemRank> list;\n        getSlaveRanks<TYPE_MCA>( i_mcaChip->getTrgt(), list );\n        PRDF_ASSERT( !list.empty() ); \/\/ target configured with no ranks\n\n        for ( auto & r : list )\n        {\n            TdEntry * entry = new TpsEvent<TYPE_MCA>( i_mcaChip, r );\n            uint32_t rc = mcbdb->getTdCtlr()->handleTdEvent( io_sc, entry );\n            if ( SUCCESS != rc )\n            {\n                PRDF_ERR( PRDF_FUNC \"handleTdEvent() failed on 0x%08x\",\n                          i_mcaChip->getHuid() );\n\n                continue; \/\/ Try the other ranks.\n            }\n        }\n    }\n\n    #else \/\/ IPL\n\n    SCAN_COMM_REGISTER_CLASS * farb0 = i_mcaChip->getRegister(\"FARB0\");\n    if ( SUCCESS != farb0->Read() )\n    {\n        PRDF_ERR( PRDF_FUNC \"Read() failed on MCAECCFIR: i_mcaChip=0x%08x\",\n                  i_mcaChip->getHuid() );\n\n        \/\/ Ensure the reg is zero so that we will use the recovery threshold and\n        \/\/ guarantee we don't try to do a reconfig.\n        farb0->clearAllBits();\n    }\n\n    if ( farb0->IsBitSet(54) )\n    {\n        \/\/ Recovery is disabled. Issue a reconfig loop. Make the error log\n        \/\/ predictive if threshold is reached.\n        if ( rcdParityErrorReconfigLoop(i_mcaChip->getTrgt()) )\n            io_sc.service_data->setServiceCall();\n\n        if ( isInMdiaMode() )\n        {\n            uint32_t l_rc = SUCCESS;\n            SCAN_COMM_REGISTER_CLASS * mask = nullptr;\n\n            \/\/ Stop any further commands on this MCBIST to avoid subsequent RCD\n            \/\/ errors or potential AUEs.\n            l_rc = mdiaSendEventMsg( mcbChip->getTrgt(), MDIA::STOP_TESTING );\n            if ( SUCCESS != l_rc )\n            {\n                PRDF_ERR( PRDF_FUNC \"mdiaSendEventMsg(STOP_TESTING) failed\" );\n            }\n\n            \/\/ Mask the maintenance AUE\/IAUE attentions on this MCA because they\n            \/\/ are potential side-effects of the RCD parity errors.\n            mask = i_mcaChip->getRegister( \"MCAECCFIR_MASK_OR\" );\n            mask->SetBit(33); \/\/ maintenance AUE\n            mask->SetBit(36); \/\/ maintenance IAUE\n            l_rc = mask->Write();\n            if ( SUCCESS != l_rc )\n            {\n                PRDF_ERR( PRDF_FUNC \"Write() failed on MCAECCFIR_MASK_OR: \"\n                          \"i_mcaChip=0x%08x\", i_mcaChip->getHuid() );\n            }\n\n            \/\/ Mask the maintenance command complete bits to avoid false\n            \/\/ attentions.\n            mask = mcbChip->getRegister( \"MCBISTFIR_MASK_OR\" );\n            mask->SetBit(10); \/\/ Command complete\n            mask->SetBit(12); \/\/ WAT workaround\n            l_rc = mask->Write();\n            if ( SUCCESS != l_rc )\n            {\n                PRDF_ERR( PRDF_FUNC \"Write() failed on MCBISTFIR_MASK_OR: \"\n                          \"mcbChip=0x%08x\", mcbChip->getHuid() );\n            }\n        }\n    }\n    else\n    {\n        \/\/ Make the error log predictive if the recovery threshold is reached.\n        \/\/ Don't bother with TPS on all ranks because it is too complicated to\n        \/\/ handle during Memory Diagnostics and we don't have time to complete\n        \/\/ the procedures at any other point during the IPL. The DIMMs will be\n        \/\/ deconfigured during the IPL anyways. So not really much benefit\n        \/\/ except for extra FFDC.\n        if ( getMcaDataBundle(i_mcaChip)->iv_rcdParityTh.inc(io_sc) )\n            io_sc.service_data->setServiceCall();\n    }\n\n    #endif\n\n    return SUCCESS;\n\n    #undef PRDF_FUNC\n}\nPRDF_PLUGIN_DEFINE( p9_mca, RcdParityError );\n\n\/\/------------------------------------------------------------------------------\n\n\/**\n * @brief  MCACALFIR[13] - Persistent RCD error, port failed.\n * @param  i_chip MCA chip.\n * @param  io_sc  The step code data struct.\n * @return SUCCESS\n *\/\nint32_t MemPortFailure( ExtensibleChip * i_chip,\n                        STEP_CODE_DATA_STRUCT & io_sc )\n{\n    #define PRDF_FUNC \"[p9_mca::MemPortFailure] \"\n\n    if ( CHECK_STOP != io_sc.service_data->getPrimaryAttnType() )\n    {\n        \/\/ The port is dead. Mask off the entire port.\n        uint32_t l_rc = MemEcc::maskMemPort<TYPE_MCA>( i_chip );\n        if ( SUCCESS != l_rc )\n        {\n            PRDF_ERR( PRDF_FUNC \"MemEcc::maskMemPort<TYPE_MCA>(0x%08x) failed\",\n                      i_chip->getHuid() );\n        }\n    }\n\n    return SUCCESS; \/\/ nothing to return to rule code\n\n    #undef PRDF_FUNC\n}\nPRDF_PLUGIN_DEFINE( p9_mca, MemPortFailure );\n\n} \/\/ end namespace p9_mca\n\n} \/\/ end namespace PRDF\n\n<commit_msg>PRD: Mask RCD parity errors on threshold<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/usr\/diag\/prdf\/plat\/mem\/prdfP9Mca.C $                      *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2016,2017                        *\/\n\/* [+] International Business Machines Corp.                              *\/\n\/*                                                                        *\/\n\/*                                                                        *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\");        *\/\n\/* you may not use this file except in compliance with the License.       *\/\n\/* You may obtain a copy of the License at                                *\/\n\/*                                                                        *\/\n\/*     http:\/\/www.apache.org\/licenses\/LICENSE-2.0                         *\/\n\/*                                                                        *\/\n\/* Unless required by applicable law or agreed to in writing, software    *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS,      *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or        *\/\n\/* implied. See the License for the specific language governing           *\/\n\/* permissions and limitations under the License.                         *\/\n\/*                                                                        *\/\n\/* IBM_PROLOG_END_TAG                                                     *\/\n\n\/\/ Framework includes\n#include <iipServiceDataCollector.h>\n#include <prdfExtensibleChip.H>\n#include <prdfPluginMap.H>\n\n\/\/ Platform includes\n#include <prdfMemEccAnalysis.H>\n#include <prdfP9McaDataBundle.H>\n#include <prdfP9McbistDataBundle.H>\n#include <prdfPlatServices.H>\n#ifdef __HOSTBOOT_RUNTIME\n  #include <prdfMemTps.H>\n#endif\n\n\nusing namespace TARGETING;\n\nnamespace PRDF\n{\n\nusing namespace PlatServices;\n\nnamespace p9_mca\n{\n\n\/\/##############################################################################\n\/\/\n\/\/                             Special plugins\n\/\/\n\/\/##############################################################################\n\n\/**\n * @brief  Plugin function called after analysis is complete but before PRD\n *         exits.\n * @param  i_chip An MCA chip.\n * @param  io_sc  The step code data struct.\n * @note   This is especially useful for any analysis that still needs to be\n *         done after the framework clears the FIR bits that were at attention.\n * @return SUCCESS.\n *\/\nint32_t PostAnalysis( ExtensibleChip * i_chip, STEP_CODE_DATA_STRUCT & io_sc )\n{\n    #define PRDF_FUNC \"[p9_mca::PostAnalysis] \"\n\n    #ifdef __HOSTBOOT_RUNTIME\n\n    \/\/ If the IUE threshold in our data bundle has been reached, we trigger\n    \/\/ a port fail. Once we trigger the port fail, the system may crash\n    \/\/ right away. Since PRD is running in the hypervisor, it is possible we\n    \/\/ may not get the error log. To better our chances, we trigger the port\n    \/\/ fail here after the error log has been committed.\n    if ( SUCCESS != MemEcc::iuePortFail<TYPE_MCA>(i_chip, io_sc) )\n    {\n        PRDF_ERR( PRDF_FUNC \"iuePortFail(0x%08x) failed\", i_chip->getHuid() );\n    }\n\n    #endif \/\/ __HOSTBOOT_RUNTIME\n\n    return SUCCESS; \/\/ Always return SUCCESS for this plugin.\n\n    #undef PRDF_FUNC\n}\nPRDF_PLUGIN_DEFINE( p9_mca, PostAnalysis );\n\n\n\/\/##############################################################################\n\/\/\n\/\/                               MCACALFIR\n\/\/\n\/\/##############################################################################\n\n\/**\n * @brief  MCACALFIR[4] - RCD Parity Error.\n * @param  i_mcaChip A P9 MCA chip.\n * @param  io_sc     The step code data struct.\n * @return SUCCESS\n *\/\nint32_t RcdParityError( ExtensibleChip * i_mcaChip,\n                        STEP_CODE_DATA_STRUCT & io_sc )\n{\n    #define PRDF_FUNC \"[p9_mca::RcdParityError] \"\n\n    \/\/ The callouts have already been made in the rule code. All other actions\n    \/\/ documented below.\n\n    \/\/ Nothing more to do if this is a checkstop attention.\n    if ( CHECK_STOP == io_sc.service_data->getPrimaryAttnType() )\n        return SUCCESS;\n\n    ExtensibleChip * mcbChip = getConnectedParent( i_mcaChip, TYPE_MCBIST );\n\n    #ifdef __HOSTBOOT_RUNTIME \/\/ TPS only supported at runtime.\n\n    \/\/ Recovery is always enabled during runtime. If the threshold is reached,\n    \/\/ make the error log predictive and start TPS on all slave ranks behind\n    \/\/ the MCA.\n    if ( getMcaDataBundle(i_mcaChip)->iv_rcdParityTh.inc(io_sc) )\n    {\n        io_sc.service_data->setServiceCall();\n\n        McbistDataBundle * mcbdb = getMcbistDataBundle( mcbChip );\n\n        std::vector<MemRank> list;\n        getSlaveRanks<TYPE_MCA>( i_mcaChip->getTrgt(), list );\n        PRDF_ASSERT( !list.empty() ); \/\/ target configured with no ranks\n\n        for ( auto & r : list )\n        {\n            TdEntry * entry = new TpsEvent<TYPE_MCA>( i_mcaChip, r );\n            uint32_t rc = mcbdb->getTdCtlr()->handleTdEvent( io_sc, entry );\n            if ( SUCCESS != rc )\n            {\n                PRDF_ERR( PRDF_FUNC \"handleTdEvent() failed on 0x%08x\",\n                          i_mcaChip->getHuid() );\n\n                continue; \/\/ Try the other ranks.\n            }\n        }\n    }\n\n    #else \/\/ IPL\n\n    SCAN_COMM_REGISTER_CLASS * farb0 = i_mcaChip->getRegister(\"FARB0\");\n    if ( SUCCESS != farb0->Read() )\n    {\n        PRDF_ERR( PRDF_FUNC \"Read() failed on MCAECCFIR: i_mcaChip=0x%08x\",\n                  i_mcaChip->getHuid() );\n\n        \/\/ Ensure the reg is zero so that we will use the recovery threshold and\n        \/\/ guarantee we don't try to do a reconfig.\n        farb0->clearAllBits();\n    }\n\n    if ( farb0->IsBitSet(54) )\n    {\n        \/\/ Recovery is disabled. Issue a reconfig loop. Make the error log\n        \/\/ predictive if threshold is reached.\n        if ( rcdParityErrorReconfigLoop(i_mcaChip->getTrgt()) )\n            io_sc.service_data->setServiceCall();\n\n        if ( isInMdiaMode() )\n        {\n            uint32_t l_rc = SUCCESS;\n            SCAN_COMM_REGISTER_CLASS * mask = nullptr;\n\n            \/\/ Stop any further commands on this MCBIST to avoid subsequent RCD\n            \/\/ errors or potential AUEs.\n            l_rc = mdiaSendEventMsg( mcbChip->getTrgt(), MDIA::STOP_TESTING );\n            if ( SUCCESS != l_rc )\n            {\n                PRDF_ERR( PRDF_FUNC \"mdiaSendEventMsg(STOP_TESTING) failed\" );\n            }\n\n            \/\/ Mask the maintenance AUE\/IAUE attentions on this MCA because they\n            \/\/ are potential side-effects of the RCD parity errors.\n            mask = i_mcaChip->getRegister( \"MCAECCFIR_MASK_OR\" );\n            mask->SetBit(33); \/\/ maintenance AUE\n            mask->SetBit(36); \/\/ maintenance IAUE\n            l_rc = mask->Write();\n            if ( SUCCESS != l_rc )\n            {\n                PRDF_ERR( PRDF_FUNC \"Write() failed on MCAECCFIR_MASK_OR: \"\n                          \"i_mcaChip=0x%08x\", i_mcaChip->getHuid() );\n            }\n\n            \/\/ Mask the maintenance command complete bits to avoid false\n            \/\/ attentions.\n            mask = mcbChip->getRegister( \"MCBISTFIR_MASK_OR\" );\n            mask->SetBit(10); \/\/ Command complete\n            mask->SetBit(12); \/\/ WAT workaround\n            l_rc = mask->Write();\n            if ( SUCCESS != l_rc )\n            {\n                PRDF_ERR( PRDF_FUNC \"Write() failed on MCBISTFIR_MASK_OR: \"\n                          \"mcbChip=0x%08x\", mcbChip->getHuid() );\n            }\n        }\n    }\n    else\n    {\n        \/\/ Make the error log predictive if the recovery threshold is reached.\n        \/\/ Don't bother with TPS on all ranks because it is too complicated to\n        \/\/ handle during Memory Diagnostics and we don't have time to complete\n        \/\/ the procedures at any other point during the IPL. The DIMMs will be\n        \/\/ deconfigured during the IPL anyways. So not really much benefit\n        \/\/ except for extra FFDC.\n        if ( getMcaDataBundle(i_mcaChip)->iv_rcdParityTh.inc(io_sc) )\n            io_sc.service_data->setServiceCall();\n    }\n\n    #endif\n\n    if ( io_sc.service_data->queryServiceCall() )\n    {\n        \/\/ Mask both RCD parity error bits to prevent any flooding.\n        SCAN_COMM_REGISTER_CLASS * mask\n                                = i_mcaChip->getRegister( \"MCACALFIR_MASK_OR\" );\n        mask->SetBit( 4);\n        mask->SetBit(14);\n        if ( SUCCESS != mask->Write() )\n        {\n            PRDF_ERR( PRDF_FUNC \"Write() failed on MCACALFIR_MASK_OR: \"\n                      \"i_mcaChip=0x%08x\", i_mcaChip->getHuid() );\n        }\n    }\n\n    return SUCCESS;\n\n    #undef PRDF_FUNC\n}\nPRDF_PLUGIN_DEFINE( p9_mca, RcdParityError );\n\n\/\/------------------------------------------------------------------------------\n\n\/**\n * @brief  MCACALFIR[13] - Persistent RCD error, port failed.\n * @param  i_chip MCA chip.\n * @param  io_sc  The step code data struct.\n * @return SUCCESS\n *\/\nint32_t MemPortFailure( ExtensibleChip * i_chip,\n                        STEP_CODE_DATA_STRUCT & io_sc )\n{\n    #define PRDF_FUNC \"[p9_mca::MemPortFailure] \"\n\n    if ( CHECK_STOP != io_sc.service_data->getPrimaryAttnType() )\n    {\n        \/\/ The port is dead. Mask off the entire port.\n        uint32_t l_rc = MemEcc::maskMemPort<TYPE_MCA>( i_chip );\n        if ( SUCCESS != l_rc )\n        {\n            PRDF_ERR( PRDF_FUNC \"MemEcc::maskMemPort<TYPE_MCA>(0x%08x) failed\",\n                      i_chip->getHuid() );\n        }\n    }\n\n    return SUCCESS; \/\/ nothing to return to rule code\n\n    #undef PRDF_FUNC\n}\nPRDF_PLUGIN_DEFINE( p9_mca, MemPortFailure );\n\n} \/\/ end namespace p9_mca\n\n} \/\/ end namespace PRDF\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    RawSpeed - RAW file decoder.\n\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 \"RawSpeed-API.h\"        \/\/ for RawDecoder, Buffer, FileReader, Raw...\n#include \"common\/ChecksumFile.h\" \/\/ for ParseChecksumFile\n#include <benchmark\/benchmark.h> \/\/ for Counter, State, DoNotOptimize, Init...\n#include <chrono>                \/\/ for duration, high_resolution_clock\n#include <ctime>                 \/\/ for clock, clock_t\n#include <memory>                \/\/ for unique_ptr\n#include <ratio>                 \/\/ for ratio\n#include <string>                \/\/ for string, to_string, operator!=\n#include <sys\/time.h>            \/\/ for CLOCKS_PER_SEC\n\n#ifdef _OPENMP\n#include <omp.h>\n#endif\n\n#define HAVE_STEADY_CLOCK\n\nusing rawspeed::CameraMetaData;\nusing rawspeed::FileReader;\nusing rawspeed::RawImage;\nusing rawspeed::RawParser;\n\nnamespace {\n\nstruct CPUClock {\n  using rep = std::clock_t;\n  using period = std::ratio<1, CLOCKS_PER_SEC>;\n  using duration = std::chrono::duration<rep, period>;\n  using time_point = std::chrono::time_point<CPUClock, duration>;\n\n  \/\/ static constexpr bool is_steady = false;\n\n  static time_point now() noexcept {\n    return time_point{duration{std::clock()}};\n  }\n};\n\n#if defined(HAVE_STEADY_CLOCK)\ntemplate <bool HighResIsSteady = std::chrono::high_resolution_clock::is_steady>\nstruct ChooseSteadyClock {\n  using type = std::chrono::high_resolution_clock;\n};\n\ntemplate <> struct ChooseSteadyClock<false> {\n  using type = std::chrono::steady_clock;\n};\n#endif\n\nstruct ChooseClockType {\n#if defined(HAVE_STEADY_CLOCK)\n  using type = ChooseSteadyClock<>::type;\n#else\n  using type = std::chrono::high_resolution_clock;\n#endif\n};\n\ntemplate <typename Clock, typename period = std::ratio<1, 1>> struct Timer {\n  using rep = double;\n  using duration = std::chrono::duration<rep, period>;\n\n  mutable typename Clock::time_point start = Clock::now();\n\n  duration operator()() const {\n    duration elapsed = Clock::now() - start;\n    start = Clock::now();\n    return elapsed;\n  }\n};\n\n} \/\/ namespace\n\nstatic int currThreadCount;\n\nextern \"C\" int __attribute__((pure)) rawspeed_get_number_of_processor_cores() {\n  return currThreadCount;\n}\n\nstatic inline void BM_RawSpeed(benchmark::State& state, const char* fileName,\n                               int threads) {\n  currThreadCount = threads;\n\n#ifdef HAVE_PUGIXML\n  static const CameraMetaData metadata(CMAKE_SOURCE_DIR \"\/data\/cameras.xml\");\n#else\n  static const CameraMetaData metadata{};\n#endif\n\n  FileReader reader(fileName);\n  const auto map(reader.readFile());\n\n  Timer<ChooseClockType::type> WT;\n  Timer<CPUClock> TT;\n\n  unsigned pixels = 0;\n  for (auto _ : state) {\n    RawParser parser(map.get());\n    auto decoder(parser.getDecoder(&metadata));\n\n    decoder->failOnUnknown = false;\n    decoder->checkSupport(&metadata);\n\n    decoder->decodeRaw();\n    decoder->decodeMetaData(&metadata);\n    RawImage raw = decoder->mRaw;\n\n    benchmark::DoNotOptimize(raw);\n\n    pixels = raw->getUncroppedDim().area();\n  }\n\n  std::string label(\"FileSize,MB=\");\n  label += std::to_string(double(map->getSize()) \/ double(1UL << 20UL));\n  label += \"; MPix=\";\n  label += std::to_string(double(pixels) \/ 1e+06);\n  state.SetLabel(label.c_str());\n\n  const auto WallTime = WT();\n  const auto TotalTime = TT();\n  const auto ThreadingFactor = TotalTime.count() \/ WallTime.count();\n\n  state.counters.insert({\n      {\"Pixels\", benchmark::Counter(state.iterations() * double(pixels),\n                                    benchmark::Counter::kIsRate)},\n      {\"CPUTime,s\", TotalTime.count() \/ state.iterations()},\n      {\"ThreadingFactor\", ThreadingFactor},\n  });\n\n  state.SetItemsProcessed(state.iterations());\n  state.SetBytesProcessed(state.iterations() * map->getSize());\n}\n\nstatic void addBench(const char* fName, std::string tName, int threads) {\n  tName += std::to_string(threads);\n\n  auto* b =\n      benchmark::RegisterBenchmark(tName.c_str(), &BM_RawSpeed, fName, threads);\n  b->Unit(benchmark::kMillisecond);\n  b->UseRealTime();\n}\n\nint main(int argc, char** argv) {\n  benchmark::Initialize(&argc, argv);\n\n  auto hasFlag = [argc, argv](std::string flag) {\n    int found = 0;\n    for (int i = 1; i < argc; ++i) {\n      if (!argv[i] || argv[i] != flag)\n        continue;\n      found = i;\n      argv[i] = nullptr;\n    }\n    return found;\n  };\n\n  bool threading = hasFlag(\"-t\");\n\n#ifdef _OPENMP\n  const auto threadsMax = omp_get_max_threads();\n#else\n  const auto threadsMax = 1;\n#endif\n\n  const auto threadsMin = threading ? 1 : threadsMax;\n\n  \/\/ Were we told to use the repo (i.e. filelist.sha1 in that directory)?\n  int useChecksumFile = hasFlag(\"-r\");\n  std::vector<rawspeed::ChecksumFileEntry> ChecksumFileEntries;\n  if (useChecksumFile && useChecksumFile + 1 < argc) {\n    char*& checksumFileRepo = argv[useChecksumFile + 1];\n    if (checksumFileRepo)\n      ChecksumFileEntries = rawspeed::ReadChecksumFile(checksumFileRepo);\n    checksumFileRepo = nullptr;\n  }\n\n  \/\/ If there are normal filenames, append them.\n  for (int i = 1; i < argc; i++) {\n    if (!argv[i])\n      continue;\n\n    rawspeed::ChecksumFileEntry Entry;\n    const char* fName = argv[i];\n    \/\/ These are supposed to be either absolute paths, or relative the run dir.\n    \/\/ We don't do any beautification.\n    Entry.FullFileName = fName;\n    Entry.RelFileName = fName;\n    ChecksumFileEntries.emplace_back(Entry);\n  }\n\n  \/\/ And finally, actually add the raws to be benchmarked.\n  for (const auto& Entry : ChecksumFileEntries) {\n    const char* fName = Entry.RelFileName.c_str();\n    std::string tName(fName);\n    tName += \"\/threads:\";\n\n    for (auto threads = threadsMin; threads <= threadsMax; threads++)\n      addBench(Entry.FullFileName.c_str(), tName, threads);\n  }\n\n  benchmark::RunSpecifiedBenchmarks();\n}\n<commit_msg>rsbench: revisit custom counters<commit_after>\/*\n    RawSpeed - RAW file decoder.\n\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 \"RawSpeed-API.h\"        \/\/ for RawDecoder, Buffer, FileReader, Raw...\n#include \"common\/ChecksumFile.h\" \/\/ for ParseChecksumFile\n#include <benchmark\/benchmark.h> \/\/ for Counter, State, DoNotOptimize, Init...\n#include <chrono>                \/\/ for duration, high_resolution_clock\n#include <ctime>                 \/\/ for clock, clock_t\n#include <memory>                \/\/ for unique_ptr\n#include <ratio>                 \/\/ for ratio\n#include <string>                \/\/ for string, to_string, operator!=\n#include <sys\/time.h>            \/\/ for CLOCKS_PER_SEC\n\n#ifdef _OPENMP\n#include <omp.h>\n#endif\n\n#define HAVE_STEADY_CLOCK\n\nusing rawspeed::CameraMetaData;\nusing rawspeed::FileReader;\nusing rawspeed::RawImage;\nusing rawspeed::RawParser;\n\nnamespace {\n\nstruct CPUClock {\n  using rep = std::clock_t;\n  using period = std::ratio<1, CLOCKS_PER_SEC>;\n  using duration = std::chrono::duration<rep, period>;\n  using time_point = std::chrono::time_point<CPUClock, duration>;\n\n  \/\/ static constexpr bool is_steady = false;\n\n  static time_point now() noexcept {\n    return time_point{duration{std::clock()}};\n  }\n};\n\n#if defined(HAVE_STEADY_CLOCK)\ntemplate <bool HighResIsSteady = std::chrono::high_resolution_clock::is_steady>\nstruct ChooseSteadyClock {\n  using type = std::chrono::high_resolution_clock;\n};\n\ntemplate <> struct ChooseSteadyClock<false> {\n  using type = std::chrono::steady_clock;\n};\n#endif\n\nstruct ChooseClockType {\n#if defined(HAVE_STEADY_CLOCK)\n  using type = ChooseSteadyClock<>::type;\n#else\n  using type = std::chrono::high_resolution_clock;\n#endif\n};\n\ntemplate <typename Clock, typename period = std::ratio<1, 1>> struct Timer {\n  using rep = double;\n  using duration = std::chrono::duration<rep, period>;\n\n  mutable typename Clock::time_point start = Clock::now();\n\n  duration operator()() const {\n    duration elapsed = Clock::now() - start;\n    start = Clock::now();\n    return elapsed;\n  }\n};\n\n} \/\/ namespace\n\nstatic int currThreadCount;\n\nextern \"C\" int __attribute__((pure)) rawspeed_get_number_of_processor_cores() {\n  return currThreadCount;\n}\n\nstatic inline void BM_RawSpeed(benchmark::State& state, const char* fileName,\n                               int threads) {\n  currThreadCount = threads;\n\n#ifdef HAVE_PUGIXML\n  static const CameraMetaData metadata(CMAKE_SOURCE_DIR \"\/data\/cameras.xml\");\n#else\n  static const CameraMetaData metadata{};\n#endif\n\n  FileReader reader(fileName);\n  const auto map(reader.readFile());\n\n  Timer<ChooseClockType::type> WT;\n  Timer<CPUClock> TT;\n\n  unsigned pixels = 0;\n  for (auto _ : state) {\n    RawParser parser(map.get());\n    auto decoder(parser.getDecoder(&metadata));\n\n    decoder->failOnUnknown = false;\n    decoder->checkSupport(&metadata);\n\n    decoder->decodeRaw();\n    decoder->decodeMetaData(&metadata);\n    RawImage raw = decoder->mRaw;\n\n    benchmark::DoNotOptimize(raw);\n\n    pixels = raw->getUncroppedDim().area();\n  }\n\n  \/\/ These are total over all the `state.iterations()` iterations.\n  const double CPUTime = TT().count();\n  const double WallTime = WT().count();\n\n  \/\/ For each iteration:\n  state.counters.insert({\n      {\"CPUTime,s\", CPUTime \/ state.iterations()},\n      {\"WallTime,s\", WallTime \/ state.iterations()},\n      {\"CPUTime\/WallTime\", CPUTime \/ WallTime}, \/\/ 'Threading factor'\n      {\"Pixels\", pixels},\n      {\"Pixels\/CPUTime\", (state.iterations() * pixels) \/ CPUTime},\n      {\"Pixels\/WallTime\", (state.iterations() * pixels) \/ WallTime},\n      \/* {\"Raws\", 1}, *\/\n      {\"Raws\/CPUTime\", state.iterations() \/ CPUTime},\n      {\"Raws\/WallTime\", state.iterations() \/ WallTime},\n  });\n  \/\/ Could also have counters wrt. the filesize,\n  \/\/ but i'm not sure they are interesting.\n}\n\nstatic void addBench(const char* fName, std::string tName, int threads) {\n  tName += std::to_string(threads);\n\n  auto* b =\n      benchmark::RegisterBenchmark(tName.c_str(), &BM_RawSpeed, fName, threads);\n  b->Unit(benchmark::kMillisecond);\n  b->UseRealTime();\n}\n\nint main(int argc, char** argv) {\n  benchmark::Initialize(&argc, argv);\n\n  auto hasFlag = [argc, argv](std::string flag) {\n    int found = 0;\n    for (int i = 1; i < argc; ++i) {\n      if (!argv[i] || argv[i] != flag)\n        continue;\n      found = i;\n      argv[i] = nullptr;\n    }\n    return found;\n  };\n\n  bool threading = hasFlag(\"-t\");\n\n#ifdef _OPENMP\n  const auto threadsMax = omp_get_max_threads();\n#else\n  const auto threadsMax = 1;\n#endif\n\n  const auto threadsMin = threading ? 1 : threadsMax;\n\n  \/\/ Were we told to use the repo (i.e. filelist.sha1 in that directory)?\n  int useChecksumFile = hasFlag(\"-r\");\n  std::vector<rawspeed::ChecksumFileEntry> ChecksumFileEntries;\n  if (useChecksumFile && useChecksumFile + 1 < argc) {\n    char*& checksumFileRepo = argv[useChecksumFile + 1];\n    if (checksumFileRepo)\n      ChecksumFileEntries = rawspeed::ReadChecksumFile(checksumFileRepo);\n    checksumFileRepo = nullptr;\n  }\n\n  \/\/ If there are normal filenames, append them.\n  for (int i = 1; i < argc; i++) {\n    if (!argv[i])\n      continue;\n\n    rawspeed::ChecksumFileEntry Entry;\n    const char* fName = argv[i];\n    \/\/ These are supposed to be either absolute paths, or relative the run dir.\n    \/\/ We don't do any beautification.\n    Entry.FullFileName = fName;\n    Entry.RelFileName = fName;\n    ChecksumFileEntries.emplace_back(Entry);\n  }\n\n  \/\/ And finally, actually add the raws to be benchmarked.\n  for (const auto& Entry : ChecksumFileEntries) {\n    const char* fName = Entry.RelFileName.c_str();\n    std::string tName(fName);\n    tName += \"\/threads:\";\n\n    for (auto threads = threadsMin; threads <= threadsMax; threads++)\n      addBench(Entry.FullFileName.c_str(), tName, threads);\n  }\n\n  benchmark::RunSpecifiedBenchmarks();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2018 Rokas Kupstys\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 <Urho3D\/Core\/ProcessUtils.h>\n#include <Urho3D\/IO\/FileSystem.h>\n#include <Urho3D\/IO\/Log.h>\n#include <Toolbox\/IO\/ContentUtilities.h>\n#include <Urho3D\/Scene\/Scene.h>\n#include <Urho3D\/IO\/File.h>\n#include \"Project.h\"\n#include \"CookScene.h\"\n\n\nnamespace Urho3D\n{\n\nCookScene::CookScene(Context* context)\n    : ImportAsset(context)\n{\n}\n\nbool CookScene::Accepts(const String& path, ContentType type)\n{\n    if (GetExtension(path) != \".xml\")\n        return false;\n    return type == CTYPE_SCENE;\n}\n\nbool CookScene::RunConverter(const String& path)\n{\n    Scene scene(context_);\n    File file(context_);\n    if (file.Open(path, FILE_READ))\n    {\n        if (scene.LoadXML(file))\n        {\n            auto* project = GetSubsystem<Project>();\n            assert(path.StartsWith(project->GetResourcePath()));\n            auto resourceName = path.Substring(project->GetResourcePath().Length());\n            auto outputFile = project->GetCachePath() + ReplaceExtension(resourceName, \".bin\");\n            GetFileSystem()->CreateDirsRecursive(GetPath(outputFile));\n\n            File output(context_);\n            if (output.Open(outputFile, FILE_WRITE))\n            {\n                if (scene.Save(output))\n                    return true;\n                else\n                    URHO3D_LOGERRORF(\"Could not convert '%s' to binary version.\", path.CString());\n            }\n            else\n                URHO3D_LOGERRORF(\"Could not open '%s' for writing.\", outputFile.CString());\n        }\n        else\n            URHO3D_LOGERRORF(\"Could not open load scene '%s'.\", path.CString());\n    }\n    else\n        URHO3D_LOGERRORF(\"Could not open open '%s' for reading.\", path.CString());\n\n    return false;\n}\n\n}\n<commit_msg>Editor: Remove EditorSceneSettings component from cooked scenes.<commit_after>\/\/\n\/\/ Copyright (c) 2018 Rokas Kupstys\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 <Urho3D\/Core\/ProcessUtils.h>\n#include <Urho3D\/IO\/FileSystem.h>\n#include <Urho3D\/IO\/Log.h>\n#include <Toolbox\/IO\/ContentUtilities.h>\n#include <Urho3D\/Scene\/Scene.h>\n#include <Urho3D\/IO\/File.h>\n#include \"Tabs\/Scene\/EditorSceneSettings.h\"\n#include \"Project.h\"\n#include \"CookScene.h\"\n\n\nnamespace Urho3D\n{\n\nCookScene::CookScene(Context* context)\n    : ImportAsset(context)\n{\n}\n\nbool CookScene::Accepts(const String& path, ContentType type)\n{\n    if (GetExtension(path) != \".xml\")\n        return false;\n    return type == CTYPE_SCENE;\n}\n\nbool CookScene::RunConverter(const String& path)\n{\n    Scene scene(context_);\n    File file(context_);\n    if (file.Open(path, FILE_READ))\n    {\n        if (scene.LoadXML(file))\n        {\n            \/\/ Remove components that should not be shipped in the final product\n            if (auto* component = scene.GetComponent<EditorSceneSettings>())\n                component->Remove();\n\n            \/\/ Cook scene\n            auto* project = GetSubsystem<Project>();\n            assert(path.StartsWith(project->GetResourcePath()));\n            auto resourceName = path.Substring(project->GetResourcePath().Length());\n            auto outputFile = project->GetCachePath() + ReplaceExtension(resourceName, \".bin\");\n            GetFileSystem()->CreateDirsRecursive(GetPath(outputFile));\n\n            File output(context_);\n            if (output.Open(outputFile, FILE_WRITE))\n            {\n                if (scene.Save(output))\n                    return true;\n                else\n                    URHO3D_LOGERRORF(\"Could not convert '%s' to binary version.\", path.CString());\n            }\n            else\n                URHO3D_LOGERRORF(\"Could not open '%s' for writing.\", outputFile.CString());\n        }\n        else\n            URHO3D_LOGERRORF(\"Could not open load scene '%s'.\", path.CString());\n    }\n    else\n        URHO3D_LOGERRORF(\"Could not open open '%s' for reading.\", path.CString());\n\n    return false;\n}\n\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\n\/\/ C++ includes\n\n\/\/ Local Includes\n#include \"mesh_base.h\"\n#include \"elem.h\"\n#include \"tree.h\"\n#include \"point_locator_tree.h\"\n#include \"mesh_tools.h\"\n\nnamespace libMesh\n{\n\n\n\n\/\/------------------------------------------------------------------\n\/\/ PointLocator methods\nPointLocatorTree::PointLocatorTree (const MeshBase& mesh,\n\t\t\t\t    const PointLocatorBase* master) :\n  PointLocatorBase (mesh,master),\n  _tree            (NULL),\n  _element         (NULL),\n  _out_of_mesh_mode(false)\n{\n  this->init(Trees::NODES);\n}\n\n\n\n\nPointLocatorTree::PointLocatorTree (const MeshBase& mesh,\n\t\t\t\t    const Trees::BuildType build_type,\n\t\t\t\t    const PointLocatorBase* master) :\n  PointLocatorBase (mesh,master),\n  _tree            (NULL),\n  _element         (NULL),\n  _out_of_mesh_mode(false)\n{\n  this->init(build_type);\n}\n\n\n\n\nPointLocatorTree::~PointLocatorTree ()\n{\n  this->clear ();\n}\n\n\n\n\nvoid PointLocatorTree::clear ()\n{\n  \/\/ only delete the tree when we are the master\n  if (this->_tree != NULL)\n    {\n      if (this->_master == NULL)\n\t  \/\/ we own the tree\n\t  delete this->_tree;\n      else\n\t  \/\/ someone else owns and therefore deletes the tree\n\t  this->_tree = NULL;\n    }\n}\n\n\n\n\n\nvoid PointLocatorTree::init (const Trees::BuildType build_type)\n{\n  libmesh_assert (this->_tree == NULL); \n\n  if (this->_initialized)\n    {\n      libMesh::err << \"ERROR: Already initialized!  Will ignore this call...\"\n\t\t    << std::endl;\n    }\n\n  else\n\n    {\n\n      if (this->_master == NULL)\n        {\n\t  if (this->_mesh.mesh_dimension() == 3)\n\t    _tree = new Trees::OctTree (this->_mesh, 200, build_type);\t\t\n\t  else\n\t    {\n\t      \/\/ A 1D\/2D mesh in 3D space needs special consideration.\n\t      \/\/ If the mesh is planar XY, we want to build a QuadTree\n\t      \/\/ to search efficiently.  If the mesh is truly a manifold,\n\t      \/\/ then we need an octree\n#if LIBMESH_DIM > 2\n\t      bool is_planar_xy = false;\n\t      \n\t      \/\/ Build the bounding box for the mesh.  If the delta-z bound is\n\t      \/\/ negligibly small then we can use a quadtree.\n\t      {\n\t\tMeshTools::BoundingBox bbox = MeshTools::bounding_box(this->_mesh);\n\t\t\n\t\tconst Real\n\t\t  Dx = bbox.second(0) - bbox.first(0),\n\t\t  Dz = bbox.second(2) - bbox.first(2);\n\t\t\n\t\tif (std::abs(Dz\/(Dx + 1.e-20)) < 1e-10)\n\t\t  is_planar_xy = true;\n\t      }\n\t      \t\t    \n\t      if (is_planar_xy)\n\t\t_tree = new Trees::OctTree (this->_mesh, 200, build_type);\n\t      else\n#endif\n\t\t_tree = new Trees::QuadTree (this->_mesh, 200, build_type);\n\t    }\n\t}\n\n      else\n\t  \n        {\n\t  \/\/ We are _not_ the master.  Let our Tree point to\n\t  \/\/ the master's tree.  But for this we first transform\n\t  \/\/ the master in a state for which we are friends.\n\t  \/\/ And make sure the master @e has a tree!\n\t  const PointLocatorTree* my_master =\n\t    libmesh_cast_ptr<const PointLocatorTree*>(this->_master);\n\n\t  if (my_master->initialized())\n\t    this->_tree = my_master->_tree;\n\t  else\n\t    {\n\t      libMesh::err << \"ERROR: Initialize master first, then servants!\"\n\t\t\t    << std::endl;\n\t      libmesh_error();\n\t    }\n        }\n\n\n      \/\/ Not all PointLocators may own a tree, but all of them\n      \/\/ use their own element pointer.  Let the element pointer\n      \/\/ be unique for every interpolator.\n      \/\/ Suppose the interpolators are used concurrently\n      \/\/ at different locations in the mesh, then it makes quite\n      \/\/ sense to have unique start elements.\n      this->_element = NULL;\n    }\n\n\n  \/\/ ready for take-off\n  this->_initialized = true;\n}\n\n\n\n\n\nconst Elem* PointLocatorTree::operator() (const Point& p) const\n{\n  libmesh_assert (this->_initialized);\n  \n  \/\/ First check the element from last time before asking the tree\n  if (this->_element==NULL || !(this->_element->contains_point(p)))\n    {\n\t\/\/ ask the tree\n\tthis->_element = this->_tree->find_element (p);\n\n\tif (this->_element == NULL)\n\t  {\n\t    \/* No element seems to contain this point.  If out-of-mesh\n\t       mode is enabled, just return NULL.  If not, however, we\n\t       have to perform a linear search before we call \\p\n\t       libmesh_error() since in the case of curved elements, the\n\t       bounding box computed in \\p TreeNode::insert(const\n\t       Elem*) might be slightly inaccurate.  *\/\n\t    if(!_out_of_mesh_mode)\n\t      {\n\t\tMeshBase::const_element_iterator       pos     = this->_mesh.active_elements_begin();\n\t\tconst MeshBase::const_element_iterator end_pos = this->_mesh.active_elements_end();\n\t\t\n\t\tfor ( ; pos != end_pos; ++pos)\n\t\t  if ((*pos)->contains_point(p))\n\t\t    return this->_element = (*pos);\n\n\t\tif (this->_element == NULL)\n\t\t  {\n\t\t    libMesh::err << std::endl\n\t\t\t          << \" ******** Serious Problem.  Could not find an Element \"\n\t\t\t          << \"in the Mesh\" \n\t\t\t          << std:: endl\n\t\t\t          << \" ******** that contains the Point \"\n\t\t\t          << p;\n\t\t    libmesh_error();\n\t\t  }\n\t      }\n\t  }\n    }\n  \n  \/\/ If we found an element, it should be active\n  libmesh_assert (!this->_element || this->_element->active());\n\n  \/\/ return the element\n  return this->_element;\n}\n\nvoid PointLocatorTree::enable_out_of_mesh_mode (void)\n{\n  \/* Out-of-mesh mode is currently only supported if all of the\n     elements have affine mappings.  The reason is that for quadratic\n     mappings, it is not easy to construct a relyable bounding box of\n     the element, and thus, the fallback linear search in \\p\n     operator() is required.  Hence, out-of-mesh mode would be\n     extremely slow.  *\/\n  if(!_out_of_mesh_mode)\n    {\n#ifdef DEBUG\n      MeshBase::const_element_iterator       pos     = this->_mesh.active_elements_begin();\n      const MeshBase::const_element_iterator end_pos = this->_mesh.active_elements_end();\n      for ( ; pos != end_pos; ++pos)\n\tif (!(*pos)->has_affine_map())\n\t  {\n\t    libMesh::err << \"ERROR: Out-of-mesh mode is currently only supported if all elements have affine mappings.\" << std::endl;\n\t    libmesh_error();\n\t  }\n#endif\n      \n      _out_of_mesh_mode = true;\n    }\n}\n\nvoid PointLocatorTree::disable_out_of_mesh_mode (void)\n{\n  _out_of_mesh_mode = false;\n}\n\n} \/\/ namespace libMesh\n\n<commit_msg>Fix for PointLocatorTree application to non-planar 2D meshes<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\n\/\/ C++ includes\n\n\/\/ Local Includes\n#include \"mesh_base.h\"\n#include \"elem.h\"\n#include \"tree.h\"\n#include \"point_locator_tree.h\"\n#include \"mesh_tools.h\"\n\nnamespace libMesh\n{\n\n\n\n\/\/------------------------------------------------------------------\n\/\/ PointLocator methods\nPointLocatorTree::PointLocatorTree (const MeshBase& mesh,\n\t\t\t\t    const PointLocatorBase* master) :\n  PointLocatorBase (mesh,master),\n  _tree            (NULL),\n  _element         (NULL),\n  _out_of_mesh_mode(false)\n{\n  this->init(Trees::NODES);\n}\n\n\n\n\nPointLocatorTree::PointLocatorTree (const MeshBase& mesh,\n\t\t\t\t    const Trees::BuildType build_type,\n\t\t\t\t    const PointLocatorBase* master) :\n  PointLocatorBase (mesh,master),\n  _tree            (NULL),\n  _element         (NULL),\n  _out_of_mesh_mode(false)\n{\n  this->init(build_type);\n}\n\n\n\n\nPointLocatorTree::~PointLocatorTree ()\n{\n  this->clear ();\n}\n\n\n\n\nvoid PointLocatorTree::clear ()\n{\n  \/\/ only delete the tree when we are the master\n  if (this->_tree != NULL)\n    {\n      if (this->_master == NULL)\n\t  \/\/ we own the tree\n\t  delete this->_tree;\n      else\n\t  \/\/ someone else owns and therefore deletes the tree\n\t  this->_tree = NULL;\n    }\n}\n\n\n\n\n\nvoid PointLocatorTree::init (const Trees::BuildType build_type)\n{\n  libmesh_assert (this->_tree == NULL); \n\n  if (this->_initialized)\n    {\n      libMesh::err << \"ERROR: Already initialized!  Will ignore this call...\"\n\t\t    << std::endl;\n    }\n\n  else\n\n    {\n\n      if (this->_master == NULL)\n        {\n\t  if (this->_mesh.mesh_dimension() == 3)\n\t    _tree = new Trees::OctTree (this->_mesh, 200, build_type);\t\t\n\t  else\n\t    {\n\t      \/\/ A 1D\/2D mesh in 3D space needs special consideration.\n\t      \/\/ If the mesh is planar XY, we want to build a QuadTree\n\t      \/\/ to search efficiently.  If the mesh is truly a manifold,\n\t      \/\/ then we need an octree\n#if LIBMESH_DIM > 2\n\t      bool is_planar_xy = false;\n\t      \n\t      \/\/ Build the bounding box for the mesh.  If the delta-z bound is\n\t      \/\/ negligibly small then we can use a quadtree.\n\t      {\n\t\tMeshTools::BoundingBox bbox = MeshTools::bounding_box(this->_mesh);\n\t\t\n\t\tconst Real\n\t\t  Dx = bbox.second(0) - bbox.first(0),\n\t\t  Dz = bbox.second(2) - bbox.first(2);\n\t\t\n\t\tif (std::abs(Dz\/(Dx + 1.e-20)) < 1e-10)\n\t\t  is_planar_xy = true;\n\t      }\n\t      \t\t    \n\t      if (!is_planar_xy)\n\t\t_tree = new Trees::OctTree (this->_mesh, 200, build_type);\n\t      else\n#endif\n\t\t_tree = new Trees::QuadTree (this->_mesh, 200, build_type);\n\t    }\n\t}\n\n      else\n\t  \n        {\n\t  \/\/ We are _not_ the master.  Let our Tree point to\n\t  \/\/ the master's tree.  But for this we first transform\n\t  \/\/ the master in a state for which we are friends.\n\t  \/\/ And make sure the master @e has a tree!\n\t  const PointLocatorTree* my_master =\n\t    libmesh_cast_ptr<const PointLocatorTree*>(this->_master);\n\n\t  if (my_master->initialized())\n\t    this->_tree = my_master->_tree;\n\t  else\n\t    {\n\t      libMesh::err << \"ERROR: Initialize master first, then servants!\"\n\t\t\t    << std::endl;\n\t      libmesh_error();\n\t    }\n        }\n\n\n      \/\/ Not all PointLocators may own a tree, but all of them\n      \/\/ use their own element pointer.  Let the element pointer\n      \/\/ be unique for every interpolator.\n      \/\/ Suppose the interpolators are used concurrently\n      \/\/ at different locations in the mesh, then it makes quite\n      \/\/ sense to have unique start elements.\n      this->_element = NULL;\n    }\n\n\n  \/\/ ready for take-off\n  this->_initialized = true;\n}\n\n\n\n\n\nconst Elem* PointLocatorTree::operator() (const Point& p) const\n{\n  libmesh_assert (this->_initialized);\n  \n  \/\/ First check the element from last time before asking the tree\n  if (this->_element==NULL || !(this->_element->contains_point(p)))\n    {\n\t\/\/ ask the tree\n\tthis->_element = this->_tree->find_element (p);\n\n\tif (this->_element == NULL)\n\t  {\n\t    \/* No element seems to contain this point.  If out-of-mesh\n\t       mode is enabled, just return NULL.  If not, however, we\n\t       have to perform a linear search before we call \\p\n\t       libmesh_error() since in the case of curved elements, the\n\t       bounding box computed in \\p TreeNode::insert(const\n\t       Elem*) might be slightly inaccurate.  *\/\n\t    if(!_out_of_mesh_mode)\n\t      {\n\t\tMeshBase::const_element_iterator       pos     = this->_mesh.active_elements_begin();\n\t\tconst MeshBase::const_element_iterator end_pos = this->_mesh.active_elements_end();\n\t\t\n\t\tfor ( ; pos != end_pos; ++pos)\n\t\t  if ((*pos)->contains_point(p))\n\t\t    return this->_element = (*pos);\n\n\t\tif (this->_element == NULL)\n\t\t  {\n\t\t    libMesh::err << std::endl\n\t\t\t          << \" ******** Serious Problem.  Could not find an Element \"\n\t\t\t          << \"in the Mesh\" \n\t\t\t          << std:: endl\n\t\t\t          << \" ******** that contains the Point \"\n\t\t\t          << p;\n\t\t    libmesh_error();\n\t\t  }\n\t      }\n\t  }\n    }\n  \n  \/\/ If we found an element, it should be active\n  libmesh_assert (!this->_element || this->_element->active());\n\n  \/\/ return the element\n  return this->_element;\n}\n\nvoid PointLocatorTree::enable_out_of_mesh_mode (void)\n{\n  \/* Out-of-mesh mode is currently only supported if all of the\n     elements have affine mappings.  The reason is that for quadratic\n     mappings, it is not easy to construct a relyable bounding box of\n     the element, and thus, the fallback linear search in \\p\n     operator() is required.  Hence, out-of-mesh mode would be\n     extremely slow.  *\/\n  if(!_out_of_mesh_mode)\n    {\n#ifdef DEBUG\n      MeshBase::const_element_iterator       pos     = this->_mesh.active_elements_begin();\n      const MeshBase::const_element_iterator end_pos = this->_mesh.active_elements_end();\n      for ( ; pos != end_pos; ++pos)\n\tif (!(*pos)->has_affine_map())\n\t  {\n\t    libMesh::err << \"ERROR: Out-of-mesh mode is currently only supported if all elements have affine mappings.\" << std::endl;\n\t    libmesh_error();\n\t  }\n#endif\n      \n      _out_of_mesh_mode = true;\n    }\n}\n\nvoid PointLocatorTree::disable_out_of_mesh_mode (void)\n{\n  _out_of_mesh_mode = false;\n}\n\n} \/\/ namespace libMesh\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef __MAPNIK_VECTOR_TILE_DATASOURCE_H__\n#define __MAPNIK_VECTOR_TILE_DATASOURCE_H__\n\n#include \"vector_tile.pb.h\"\n#include \"vector_tile_projection.hpp\"\n\n#include <mapnik\/box2d.hpp>\n#include <mapnik\/coord.hpp>\n#include <mapnik\/feature_layer_desc.hpp>\n#include <mapnik\/geometry.hpp>\n#include <mapnik\/params.hpp>\n#include <mapnik\/query.hpp>\n#include <mapnik\/unicode.hpp>\n#include <mapnik\/version.hpp>\n#include <mapnik\/value_types.hpp>\n#include <mapnik\/well_known_srs.hpp>\n\n#include <mapnik\/vertex.hpp>\n#include <mapnik\/datasource.hpp>\n#include <mapnik\/feature.hpp>\n#include <mapnik\/feature_factory.hpp>\n#include <mapnik\/geom_util.hpp>\n#include <mapnik\/image_reader.hpp>\n\n#include <memory>\n#include <stdexcept>\n#include <string>\n\n#include <boost\/optional.hpp>\n#include <boost\/ptr_container\/ptr_vector.hpp>\n#include <unicode\/unistr.h>\n\n#include \"mapnik3x_compatibility.hpp\"\n#include MAPNIK_MAKE_SHARED_INCLUDE\n#include MAPNIK_SHARED_INCLUDE\n\nnamespace mapnik { namespace vector {\n\n    void add_attributes(mapnik::feature_ptr feature,\n                        mapnik::vector::tile_feature const& f,\n                        mapnik::vector::tile_layer const& layer,\n                        mapnik::transcoder const& tr)\n    {\n        std::size_t num_keys = static_cast<std::size_t>(layer.keys_size());\n        std::size_t num_values = static_cast<std::size_t>(layer.values_size());\n        for (int m = 0; m < f.tags_size(); m += 2)\n        {\n            std::size_t key_name = f.tags(m);\n            std::size_t key_value = f.tags(m + 1);\n            if (key_name < num_keys\n                && key_value < num_values)\n            {\n                std::string const& name = layer.keys(key_name);\n                if (feature->has_key(name))\n                {\n                    mapnik::vector::tile_value const& value = layer.values(key_value);\n                    if (value.has_string_value())\n                    {\n                        std::string str = value.string_value();\n                        feature->put(name, tr.transcode(str.data(), str.length()));\n                    }\n                    else if (value.has_int_value())\n                    {\n                        feature->put(name, static_cast<mapnik::value_integer>(value.int_value()));\n                    }\n                    else if (value.has_double_value())\n                    {\n                        feature->put(name, static_cast<mapnik::value_double>(value.double_value()));\n                    }\n                    else if (value.has_float_value())\n                    {\n                        feature->put(name, static_cast<mapnik::value_double>(value.float_value()));\n                    }\n                    else if (value.has_bool_value())\n                    {\n                        feature->put(name, static_cast<mapnik::value_bool>(value.bool_value()));\n                    }\n                    else if (value.has_sint_value())\n                    {\n                        feature->put(name, static_cast<mapnik::value_integer>(value.sint_value()));\n                    }\n                    else if (value.has_uint_value())\n                    {\n                        feature->put(name, static_cast<mapnik::value_integer>(value.uint_value()));\n                    }\n                }\n            }\n        }\n    }\n\n    template <typename Filter>\n    class tile_featureset : public Featureset\n    {\n    public:\n        tile_featureset(Filter const& filter,\n                        std::set<std::string> const& attribute_names,\n                        mapnik::vector::tile_layer const& layer,\n                        double tile_x,\n                        double tile_y,\n                        double scale)\n            : filter_(filter),\n              layer_(layer),\n              tile_x_(tile_x),\n              tile_y_(tile_y),\n              scale_(scale),\n              itr_(0),\n              end_(layer_.features_size()),\n              tr_(\"utf-8\"),\n              ctx_(MAPNIK_MAKE_SHARED<mapnik::context_type>())\n        {\n            std::set<std::string>::const_iterator pos = attribute_names.begin();\n            std::set<std::string>::const_iterator end = attribute_names.end();\n            for ( ;pos !=end; ++pos)\n            {\n                for (int i = 0; i < layer_.keys_size(); ++i)\n                {\n                    if (layer_.keys(i) == *pos)\n                    {\n                        ctx_->push(*pos);\n                        break;\n                    }\n                }\n            }\n        }\n\n        virtual ~tile_featureset() {}\n\n        feature_ptr next()\n        {\n            while (itr_ < end_)\n            {\n                mapnik::vector::tile_feature const& f = layer_.features(itr_);\n                mapnik::value_integer feature_id = itr_++;\n                if (f.has_raster())\n                {\n                    std::string const& image_buffer = f.raster();\n                    MAPNIK_UNIQUE_PTR<mapnik::image_reader> reader(mapnik::get_image_reader(image_buffer.data(),image_buffer.size()));\n                    if (reader.get())\n                    {\n                        if (f.has_id())\n                        {\n                            feature_id = f.id();\n                        }\n                        mapnik::feature_ptr feature = mapnik::feature_factory::create(ctx_,feature_id);\n                        MAPNIK_SHARED_PTR<mapnik::image_32> image_ptr = MAPNIK_MAKE_SHARED<mapnik::image_32>(reader->width(),reader->height());\n                        mapnik::raster_ptr raster = std::make_shared<mapnik::raster>(filter_.box_,reader->width(),reader->height(),1);\n                        reader->read(0,0,raster->data_);\n                        feature->set_raster(raster);\n                        add_attributes(feature,f,layer_,tr_);\n                        return feature;\n                    }\n                }\n                if (f.geometry_size() <= 0)\n                {\n                    continue;\n                }\n                MAPNIK_UNIQUE_PTR<mapnik::geometry_type> geom(\n                    new mapnik::geometry_type(\n                        MAPNIK_GEOM_TYPE(f.type())));\n                int cmd = -1;\n                const int cmd_bits = 3;\n                unsigned length = 0;\n                double x = tile_x_, y = tile_y_;\n                bool first = true;\n                mapnik::box2d<double> envelope;\n                double first_x=0;\n                double first_y=0;\n                for (int k = 0; k < f.geometry_size();)\n                {\n                    if (!length) {\n                        unsigned cmd_length = f.geometry(k++);\n                        cmd = cmd_length & ((1 << cmd_bits) - 1);\n                        length = cmd_length >> cmd_bits;\n                    }\n                    if (length > 0) {\n                        length--;\n                        if (cmd == mapnik::SEG_MOVETO || cmd == mapnik::SEG_LINETO)\n                        {\n                            int32_t dx = f.geometry(k++);\n                            int32_t dy = f.geometry(k++);\n                            dx = ((dx >> 1) ^ (-(dx & 1)));\n                            dy = ((dy >> 1) ^ (-(dy & 1)));\n                            x += (static_cast<double>(dx) \/ scale_);\n                            y -= (static_cast<double>(dy) \/ scale_);\n                            if (cmd == mapnik::SEG_MOVETO)\n                            {\n                                first_x = x;\n                                first_y = y;\n                            }\n                            if (first)\n                            {\n                                envelope.init(x,y,x,y);\n                                first = false;\n                            }\n                            else\n                            {\n                                envelope.expand_to_include(x,y);\n                            }\n                            geom->push_vertex(x, y, static_cast<mapnik::CommandType>(cmd));\n                        }\n                        else if (cmd == (mapnik::SEG_CLOSE & ((1 << cmd_bits) - 1)))\n                        {\n                            geom->push_vertex(first_x, first_y, mapnik::SEG_LINETO);\n                            geom->push_vertex(0, 0, mapnik::SEG_CLOSE);\n                        }\n                        else\n                        {\n                            std::stringstream msg;\n                            msg << \"Unknown command type (tile_featureset): \"\n                                << cmd;\n                            throw std::runtime_error(msg.str());\n                        }\n                    }\n                }\n                if (!filter_.pass(envelope))\n                {\n                    continue;\n                }\n                if (f.has_id())\n                {\n                    feature_id = f.id();\n                }\n                mapnik::feature_ptr feature = mapnik::feature_factory::create(ctx_,feature_id);\n                feature->paths().push_back(geom.release());\n                add_attributes(feature,f,layer_,tr_);\n                return feature;\n            }\n            return feature_ptr();\n        }\n\n    private:\n        Filter filter_;\n        mapnik::vector::tile_layer const& layer_;\n        double tile_x_;\n        double tile_y_;\n        double scale_;\n        unsigned itr_;\n        unsigned end_;\n        mapnik::transcoder tr_;\n        mapnik::context_ptr ctx_;\n    };\n\n    class tile_datasource : public datasource\n    {\n    public:\n        tile_datasource(mapnik::vector::tile_layer const& layer,\n                        unsigned x,\n                        unsigned y,\n                        unsigned z,\n                        unsigned tile_size);\n        virtual ~tile_datasource();\n        datasource::datasource_t type() const;\n        featureset_ptr features(query const& q) const;\n        featureset_ptr features_at_point(coord2d const& pt, double tol = 0) const;\n        void set_envelope(box2d<double> const& bbox);\n        box2d<double> envelope() const;\n        boost::optional<geometry_t> get_geometry_type() const;\n        layer_descriptor get_descriptor() const;\n    private:\n        mutable mapnik::layer_descriptor desc_;\n        mutable bool attributes_added_;\n        mapnik::vector::tile_layer const& layer_;\n        unsigned x_;\n        unsigned y_;\n        unsigned z_;\n        unsigned tile_size_;\n        mutable bool extent_initialized_;\n        mutable mapnik::box2d<double> extent_;\n        double tile_x_;\n        double tile_y_;\n        double scale_;\n    };\n\n\/\/ tile_datasource impl\n    inline tile_datasource::tile_datasource(mapnik::vector::tile_layer const& layer,\n                                     unsigned x,\n                                     unsigned y,\n                                     unsigned z,\n                                     unsigned tile_size)\n        : datasource(parameters()),\n          desc_(\"in-memory datasource\",\"utf-8\"),\n          attributes_added_(false),\n          layer_(layer),\n          x_(x),\n          y_(y),\n          z_(z),\n          tile_size_(tile_size),\n          extent_initialized_(false) {\n        double resolution = mapnik::EARTH_CIRCUMFERENCE\/(1 << z_);\n        tile_x_ = -0.5 * mapnik::EARTH_CIRCUMFERENCE + x_ * resolution;\n        tile_y_ =  0.5 * mapnik::EARTH_CIRCUMFERENCE - y_ * resolution;\n        scale_ = (static_cast<double>(layer_.extent()) \/ tile_size_) * tile_size_\/resolution;\n    }\n\n    inline tile_datasource::~tile_datasource() {}\n\n    inline datasource::datasource_t tile_datasource::type() const\n    {\n        return datasource::Vector;\n    }\n\n    inline featureset_ptr tile_datasource::features(query const& q) const\n    {\n        mapnik::filter_in_box filter(q.get_bbox());\n        return MAPNIK_MAKE_SHARED<tile_featureset<mapnik::filter_in_box> >\n            (filter, q.property_names(), layer_, tile_x_, tile_y_, scale_);\n    }\n\n    inline featureset_ptr tile_datasource::features_at_point(coord2d const& pt, double tol) const\n    {\n        mapnik::filter_at_point filter(pt,tol);\n        std::set<std::string> names;\n        for (int i = 0; i < layer_.keys_size(); ++i)\n        {\n            names.insert(layer_.keys(i));\n        }\n        return MAPNIK_MAKE_SHARED<tile_featureset<filter_at_point> >\n            (filter, names, layer_, tile_x_, tile_y_, scale_);\n    }\n\n    inline void tile_datasource::set_envelope(box2d<double> const& bbox)\n    {\n        extent_initialized_ = true;\n        extent_ = bbox;\n    }\n\n    inline box2d<double> tile_datasource::envelope() const\n    {\n        if (!extent_initialized_)\n        {\n            mapnik::vector::spherical_mercator merc(tile_size_);\n            double minx,miny,maxx,maxy;\n            merc.xyz(x_,y_,z_,minx,miny,maxx,maxy);\n            extent_.init(minx,miny,maxx,maxy);\n            extent_initialized_ = true;\n        }\n        return extent_;\n    }\n\n    inline boost::optional<datasource::geometry_t> tile_datasource::get_geometry_type() const\n    {\n        return datasource::Collection;\n    }\n\n    inline layer_descriptor tile_datasource::get_descriptor() const\n    {\n        if (!attributes_added_)\n        {\n            for (int i = 0; i < layer_.keys_size(); ++i)\n            {\n                \/\/ Object type here because we don't know the precise value until features are unpacked\n                desc_.add_descriptor(attribute_descriptor(layer_.keys(i), Object));\n            }\n            attributes_added_ = true;\n        }\n        return desc_;\n    }\n\n    }} \/\/ end ns\n\n#endif \/\/ __MAPNIK_VECTOR_TILE_DATASOURCE_H__\n<commit_msg>fix compile with Mapnik 2.3.x<commit_after>#ifndef __MAPNIK_VECTOR_TILE_DATASOURCE_H__\n#define __MAPNIK_VECTOR_TILE_DATASOURCE_H__\n\n#include \"vector_tile.pb.h\"\n#include \"vector_tile_projection.hpp\"\n\n#include <mapnik\/box2d.hpp>\n#include <mapnik\/coord.hpp>\n#include <mapnik\/feature_layer_desc.hpp>\n#include <mapnik\/geometry.hpp>\n#include <mapnik\/params.hpp>\n#include <mapnik\/query.hpp>\n#include <mapnik\/unicode.hpp>\n#include <mapnik\/version.hpp>\n#include <mapnik\/value_types.hpp>\n#include <mapnik\/well_known_srs.hpp>\n\n#include <mapnik\/vertex.hpp>\n#include <mapnik\/datasource.hpp>\n#include <mapnik\/feature.hpp>\n#include <mapnik\/feature_factory.hpp>\n#include <mapnik\/geom_util.hpp>\n#include <mapnik\/image_reader.hpp>\n\n#include <memory>\n#include <stdexcept>\n#include <string>\n\n#include <boost\/optional.hpp>\n#include <boost\/ptr_container\/ptr_vector.hpp>\n#include <unicode\/unistr.h>\n\n#include \"mapnik3x_compatibility.hpp\"\n#include MAPNIK_MAKE_SHARED_INCLUDE\n#include MAPNIK_SHARED_INCLUDE\n\nnamespace mapnik { namespace vector {\n\n    void add_attributes(mapnik::feature_ptr feature,\n                        mapnik::vector::tile_feature const& f,\n                        mapnik::vector::tile_layer const& layer,\n                        mapnik::transcoder const& tr)\n    {\n        std::size_t num_keys = static_cast<std::size_t>(layer.keys_size());\n        std::size_t num_values = static_cast<std::size_t>(layer.values_size());\n        for (int m = 0; m < f.tags_size(); m += 2)\n        {\n            std::size_t key_name = f.tags(m);\n            std::size_t key_value = f.tags(m + 1);\n            if (key_name < num_keys\n                && key_value < num_values)\n            {\n                std::string const& name = layer.keys(key_name);\n                if (feature->has_key(name))\n                {\n                    mapnik::vector::tile_value const& value = layer.values(key_value);\n                    if (value.has_string_value())\n                    {\n                        std::string str = value.string_value();\n                        feature->put(name, tr.transcode(str.data(), str.length()));\n                    }\n                    else if (value.has_int_value())\n                    {\n                        feature->put(name, static_cast<mapnik::value_integer>(value.int_value()));\n                    }\n                    else if (value.has_double_value())\n                    {\n                        feature->put(name, static_cast<mapnik::value_double>(value.double_value()));\n                    }\n                    else if (value.has_float_value())\n                    {\n                        feature->put(name, static_cast<mapnik::value_double>(value.float_value()));\n                    }\n                    else if (value.has_bool_value())\n                    {\n                        feature->put(name, static_cast<mapnik::value_bool>(value.bool_value()));\n                    }\n                    else if (value.has_sint_value())\n                    {\n                        feature->put(name, static_cast<mapnik::value_integer>(value.sint_value()));\n                    }\n                    else if (value.has_uint_value())\n                    {\n                        feature->put(name, static_cast<mapnik::value_integer>(value.uint_value()));\n                    }\n                }\n            }\n        }\n    }\n\n    template <typename Filter>\n    class tile_featureset : public Featureset\n    {\n    public:\n        tile_featureset(Filter const& filter,\n                        std::set<std::string> const& attribute_names,\n                        mapnik::vector::tile_layer const& layer,\n                        double tile_x,\n                        double tile_y,\n                        double scale)\n            : filter_(filter),\n              layer_(layer),\n              tile_x_(tile_x),\n              tile_y_(tile_y),\n              scale_(scale),\n              itr_(0),\n              end_(layer_.features_size()),\n              tr_(\"utf-8\"),\n              ctx_(MAPNIK_MAKE_SHARED<mapnik::context_type>())\n        {\n            std::set<std::string>::const_iterator pos = attribute_names.begin();\n            std::set<std::string>::const_iterator end = attribute_names.end();\n            for ( ;pos !=end; ++pos)\n            {\n                for (int i = 0; i < layer_.keys_size(); ++i)\n                {\n                    if (layer_.keys(i) == *pos)\n                    {\n                        ctx_->push(*pos);\n                        break;\n                    }\n                }\n            }\n        }\n\n        virtual ~tile_featureset() {}\n\n        feature_ptr next()\n        {\n            while (itr_ < end_)\n            {\n                mapnik::vector::tile_feature const& f = layer_.features(itr_);\n                mapnik::value_integer feature_id = itr_++;\n                if (f.has_raster())\n                {\n                    std::string const& image_buffer = f.raster();\n                    MAPNIK_UNIQUE_PTR<mapnik::image_reader> reader(mapnik::get_image_reader(image_buffer.data(),image_buffer.size()));\n                    if (reader.get())\n                    {\n                        if (f.has_id())\n                        {\n                            feature_id = f.id();\n                        }\n                        mapnik::feature_ptr feature = mapnik::feature_factory::create(ctx_,feature_id);\n                        mapnik::raster_ptr raster = MAPNIK_MAKE_SHARED<mapnik::raster>(filter_.box_,reader->width(),reader->height(),1);\n                        reader->read(0,0,raster->data_);\n                        feature->set_raster(raster);\n                        add_attributes(feature,f,layer_,tr_);\n                        return feature;\n                    }\n                }\n                if (f.geometry_size() <= 0)\n                {\n                    continue;\n                }\n                MAPNIK_UNIQUE_PTR<mapnik::geometry_type> geom(\n                    new mapnik::geometry_type(\n                        MAPNIK_GEOM_TYPE(f.type())));\n                int cmd = -1;\n                const int cmd_bits = 3;\n                unsigned length = 0;\n                double x = tile_x_, y = tile_y_;\n                bool first = true;\n                mapnik::box2d<double> envelope;\n                double first_x=0;\n                double first_y=0;\n                for (int k = 0; k < f.geometry_size();)\n                {\n                    if (!length) {\n                        unsigned cmd_length = f.geometry(k++);\n                        cmd = cmd_length & ((1 << cmd_bits) - 1);\n                        length = cmd_length >> cmd_bits;\n                    }\n                    if (length > 0) {\n                        length--;\n                        if (cmd == mapnik::SEG_MOVETO || cmd == mapnik::SEG_LINETO)\n                        {\n                            int32_t dx = f.geometry(k++);\n                            int32_t dy = f.geometry(k++);\n                            dx = ((dx >> 1) ^ (-(dx & 1)));\n                            dy = ((dy >> 1) ^ (-(dy & 1)));\n                            x += (static_cast<double>(dx) \/ scale_);\n                            y -= (static_cast<double>(dy) \/ scale_);\n                            if (cmd == mapnik::SEG_MOVETO)\n                            {\n                                first_x = x;\n                                first_y = y;\n                            }\n                            if (first)\n                            {\n                                envelope.init(x,y,x,y);\n                                first = false;\n                            }\n                            else\n                            {\n                                envelope.expand_to_include(x,y);\n                            }\n                            geom->push_vertex(x, y, static_cast<mapnik::CommandType>(cmd));\n                        }\n                        else if (cmd == (mapnik::SEG_CLOSE & ((1 << cmd_bits) - 1)))\n                        {\n                            geom->push_vertex(first_x, first_y, mapnik::SEG_LINETO);\n                            geom->push_vertex(0, 0, mapnik::SEG_CLOSE);\n                        }\n                        else\n                        {\n                            std::stringstream msg;\n                            msg << \"Unknown command type (tile_featureset): \"\n                                << cmd;\n                            throw std::runtime_error(msg.str());\n                        }\n                    }\n                }\n                if (!filter_.pass(envelope))\n                {\n                    continue;\n                }\n                if (f.has_id())\n                {\n                    feature_id = f.id();\n                }\n                mapnik::feature_ptr feature = mapnik::feature_factory::create(ctx_,feature_id);\n                feature->paths().push_back(geom.release());\n                add_attributes(feature,f,layer_,tr_);\n                return feature;\n            }\n            return feature_ptr();\n        }\n\n    private:\n        Filter filter_;\n        mapnik::vector::tile_layer const& layer_;\n        double tile_x_;\n        double tile_y_;\n        double scale_;\n        unsigned itr_;\n        unsigned end_;\n        mapnik::transcoder tr_;\n        mapnik::context_ptr ctx_;\n    };\n\n    class tile_datasource : public datasource\n    {\n    public:\n        tile_datasource(mapnik::vector::tile_layer const& layer,\n                        unsigned x,\n                        unsigned y,\n                        unsigned z,\n                        unsigned tile_size);\n        virtual ~tile_datasource();\n        datasource::datasource_t type() const;\n        featureset_ptr features(query const& q) const;\n        featureset_ptr features_at_point(coord2d const& pt, double tol = 0) const;\n        void set_envelope(box2d<double> const& bbox);\n        box2d<double> envelope() const;\n        boost::optional<geometry_t> get_geometry_type() const;\n        layer_descriptor get_descriptor() const;\n    private:\n        mutable mapnik::layer_descriptor desc_;\n        mutable bool attributes_added_;\n        mapnik::vector::tile_layer const& layer_;\n        unsigned x_;\n        unsigned y_;\n        unsigned z_;\n        unsigned tile_size_;\n        mutable bool extent_initialized_;\n        mutable mapnik::box2d<double> extent_;\n        double tile_x_;\n        double tile_y_;\n        double scale_;\n    };\n\n\/\/ tile_datasource impl\n    inline tile_datasource::tile_datasource(mapnik::vector::tile_layer const& layer,\n                                     unsigned x,\n                                     unsigned y,\n                                     unsigned z,\n                                     unsigned tile_size)\n        : datasource(parameters()),\n          desc_(\"in-memory datasource\",\"utf-8\"),\n          attributes_added_(false),\n          layer_(layer),\n          x_(x),\n          y_(y),\n          z_(z),\n          tile_size_(tile_size),\n          extent_initialized_(false) {\n        double resolution = mapnik::EARTH_CIRCUMFERENCE\/(1 << z_);\n        tile_x_ = -0.5 * mapnik::EARTH_CIRCUMFERENCE + x_ * resolution;\n        tile_y_ =  0.5 * mapnik::EARTH_CIRCUMFERENCE - y_ * resolution;\n        scale_ = (static_cast<double>(layer_.extent()) \/ tile_size_) * tile_size_\/resolution;\n    }\n\n    inline tile_datasource::~tile_datasource() {}\n\n    inline datasource::datasource_t tile_datasource::type() const\n    {\n        return datasource::Vector;\n    }\n\n    inline featureset_ptr tile_datasource::features(query const& q) const\n    {\n        mapnik::filter_in_box filter(q.get_bbox());\n        return MAPNIK_MAKE_SHARED<tile_featureset<mapnik::filter_in_box> >\n            (filter, q.property_names(), layer_, tile_x_, tile_y_, scale_);\n    }\n\n    inline featureset_ptr tile_datasource::features_at_point(coord2d const& pt, double tol) const\n    {\n        mapnik::filter_at_point filter(pt,tol);\n        std::set<std::string> names;\n        for (int i = 0; i < layer_.keys_size(); ++i)\n        {\n            names.insert(layer_.keys(i));\n        }\n        return MAPNIK_MAKE_SHARED<tile_featureset<filter_at_point> >\n            (filter, names, layer_, tile_x_, tile_y_, scale_);\n    }\n\n    inline void tile_datasource::set_envelope(box2d<double> const& bbox)\n    {\n        extent_initialized_ = true;\n        extent_ = bbox;\n    }\n\n    inline box2d<double> tile_datasource::envelope() const\n    {\n        if (!extent_initialized_)\n        {\n            mapnik::vector::spherical_mercator merc(tile_size_);\n            double minx,miny,maxx,maxy;\n            merc.xyz(x_,y_,z_,minx,miny,maxx,maxy);\n            extent_.init(minx,miny,maxx,maxy);\n            extent_initialized_ = true;\n        }\n        return extent_;\n    }\n\n    inline boost::optional<datasource::geometry_t> tile_datasource::get_geometry_type() const\n    {\n        return datasource::Collection;\n    }\n\n    inline layer_descriptor tile_datasource::get_descriptor() const\n    {\n        if (!attributes_added_)\n        {\n            for (int i = 0; i < layer_.keys_size(); ++i)\n            {\n                \/\/ Object type here because we don't know the precise value until features are unpacked\n                desc_.add_descriptor(attribute_descriptor(layer_.keys(i), Object));\n            }\n            attributes_added_ = true;\n        }\n        return desc_;\n    }\n\n    }} \/\/ end ns\n\n#endif \/\/ __MAPNIK_VECTOR_TILE_DATASOURCE_H__\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2022 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 <policy\/feerate.h>\n#include <primitives\/transaction.h>\n#include <test\/fuzz\/FuzzedDataProvider.h>\n#include <test\/fuzz\/fuzz.h>\n#include <test\/fuzz\/util.h>\n#include <test\/util\/setup_common.h>\n#include <wallet\/coinselection.h>\n\n#include <vector>\n\nnamespace wallet {\n\nstatic void AddCoin(const CAmount& value, int n_input, int n_input_bytes, int locktime, std::vector<COutput>& coins)\n{\n    CMutableTransaction tx;\n    tx.vout.resize(n_input + 1);\n    tx.vout[n_input].nValue = value;\n    tx.nLockTime = locktime; \/\/ all transactions get different hashes\n    coins.emplace_back(COutPoint(tx.GetHash(), n_input), tx.vout.at(n_input), \/*depth=*\/0, n_input_bytes, \/*spendable=*\/true, \/*solvable=*\/true, \/*safe=*\/true, \/*time=*\/0, \/*from_me=*\/true);\n}\n\n\/\/ Randomly distribute coins to instances of OutputGroup\nstatic void GroupCoins(FuzzedDataProvider& fuzzed_data_provider, const std::vector<COutput>& coins, const CoinSelectionParams& coin_params, bool positive_only, std::vector<OutputGroup>& output_groups)\n{\n    auto output_group = OutputGroup(coin_params);\n    bool valid_outputgroup{false};\n    for (auto& coin : coins) {\n        output_group.Insert(coin, \/*ancestors=*\/0, \/*descendants=*\/0, positive_only);\n        \/\/ If positive_only was specified, nothing may have been inserted, leading to an empty outpout group\n        \/\/ that would be invalid for the BnB algorithm\n        valid_outputgroup = !positive_only || output_group.GetSelectionAmount() > 0;\n        if (valid_outputgroup && fuzzed_data_provider.ConsumeBool()) {\n            output_groups.push_back(output_group);\n            output_group = OutputGroup(coin_params);\n            valid_outputgroup = false;\n        }\n    }\n    if (valid_outputgroup) output_groups.push_back(output_group);\n}\n\nFUZZ_TARGET(coinselection)\n{\n    FuzzedDataProvider fuzzed_data_provider{buffer.data(), buffer.size()};\n    std::vector<COutput> utxo_pool;\n\n    const CFeeRate long_term_fee_rate{ConsumeMoney(fuzzed_data_provider, \/*max=*\/COIN)};\n    const CFeeRate effective_fee_rate{ConsumeMoney(fuzzed_data_provider, \/*max=*\/COIN)};\n    const CAmount cost_of_change{ConsumeMoney(fuzzed_data_provider, \/*max=*\/COIN)};\n    const CAmount target{fuzzed_data_provider.ConsumeIntegralInRange<CAmount>(1, MAX_MONEY)};\n    const bool subtract_fee_outputs{fuzzed_data_provider.ConsumeBool()};\n\n    FastRandomContext fast_random_context{ConsumeUInt256(fuzzed_data_provider)};\n    CoinSelectionParams coin_params{fast_random_context};\n    coin_params.m_subtract_fee_outputs = subtract_fee_outputs;\n    coin_params.m_long_term_feerate = long_term_fee_rate;\n    coin_params.m_effective_feerate = effective_fee_rate;\n\n    \/\/ Create some coins\n    CAmount total_balance{0};\n    int next_locktime{0};\n    LIMITED_WHILE(fuzzed_data_provider.ConsumeBool(), 10000)\n    {\n        const int n_input{fuzzed_data_provider.ConsumeIntegralInRange<int>(0, 10)};\n        const int n_input_bytes{fuzzed_data_provider.ConsumeIntegralInRange<int>(100, 10000)};\n        const CAmount amount{fuzzed_data_provider.ConsumeIntegralInRange<CAmount>(1, MAX_MONEY)};\n        if (total_balance + amount >= MAX_MONEY) {\n            break;\n        }\n        AddCoin(amount, n_input, n_input_bytes, ++next_locktime, utxo_pool);\n        total_balance += amount;\n    }\n\n    std::vector<OutputGroup> group_pos;\n    GroupCoins(fuzzed_data_provider, utxo_pool, coin_params, \/*positive_only=*\/true, group_pos);\n    std::vector<OutputGroup> group_all;\n    GroupCoins(fuzzed_data_provider, utxo_pool, coin_params, \/*positive_only=*\/false, group_all);\n\n    \/\/ Run coinselection algorithms\n    const auto result_bnb = SelectCoinsBnB(group_pos, target, cost_of_change);\n\n    auto result_srd = SelectCoinsSRD(group_pos, target, fast_random_context);\n    if (result_srd) result_srd->ComputeAndSetWaste(cost_of_change);\n\n    CAmount change_target{GenerateChangeTarget(target, fast_random_context)};\n    auto result_knapsack = KnapsackSolver(group_all, target, change_target, fast_random_context);\n    if (result_knapsack) result_knapsack->ComputeAndSetWaste(cost_of_change);\n\n    \/\/ If the total balance is sufficient for the target and we are not using\n    \/\/ effective values, Knapsack should always find a solution.\n    if (total_balance >= target && subtract_fee_outputs) {\n        assert(result_knapsack);\n    }\n}\n\n} \/\/ namespace wallet\n<commit_msg>fuzz: coinselection, add missing fee rate.<commit_after>\/\/ Copyright (c) 2022 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 <policy\/feerate.h>\n#include <primitives\/transaction.h>\n#include <test\/fuzz\/FuzzedDataProvider.h>\n#include <test\/fuzz\/fuzz.h>\n#include <test\/fuzz\/util.h>\n#include <test\/util\/setup_common.h>\n#include <wallet\/coinselection.h>\n\n#include <vector>\n\nnamespace wallet {\n\nstatic void AddCoin(const CAmount& value, int n_input, int n_input_bytes, int locktime, std::vector<COutput>& coins, CFeeRate fee_rate)\n{\n    CMutableTransaction tx;\n    tx.vout.resize(n_input + 1);\n    tx.vout[n_input].nValue = value;\n    tx.nLockTime = locktime; \/\/ all transactions get different hashes\n    coins.emplace_back(COutPoint(tx.GetHash(), n_input), tx.vout.at(n_input), \/*depth=*\/0, n_input_bytes, \/*spendable=*\/true, \/*solvable=*\/true, \/*safe=*\/true, \/*time=*\/0, \/*from_me=*\/true, fee_rate);\n}\n\n\/\/ Randomly distribute coins to instances of OutputGroup\nstatic void GroupCoins(FuzzedDataProvider& fuzzed_data_provider, const std::vector<COutput>& coins, const CoinSelectionParams& coin_params, bool positive_only, std::vector<OutputGroup>& output_groups)\n{\n    auto output_group = OutputGroup(coin_params);\n    bool valid_outputgroup{false};\n    for (auto& coin : coins) {\n        output_group.Insert(coin, \/*ancestors=*\/0, \/*descendants=*\/0, positive_only);\n        \/\/ If positive_only was specified, nothing may have been inserted, leading to an empty outpout group\n        \/\/ that would be invalid for the BnB algorithm\n        valid_outputgroup = !positive_only || output_group.GetSelectionAmount() > 0;\n        if (valid_outputgroup && fuzzed_data_provider.ConsumeBool()) {\n            output_groups.push_back(output_group);\n            output_group = OutputGroup(coin_params);\n            valid_outputgroup = false;\n        }\n    }\n    if (valid_outputgroup) output_groups.push_back(output_group);\n}\n\nFUZZ_TARGET(coinselection)\n{\n    FuzzedDataProvider fuzzed_data_provider{buffer.data(), buffer.size()};\n    std::vector<COutput> utxo_pool;\n\n    const CFeeRate long_term_fee_rate{ConsumeMoney(fuzzed_data_provider, \/*max=*\/COIN)};\n    const CFeeRate effective_fee_rate{ConsumeMoney(fuzzed_data_provider, \/*max=*\/COIN)};\n    const CAmount cost_of_change{ConsumeMoney(fuzzed_data_provider, \/*max=*\/COIN)};\n    const CAmount target{fuzzed_data_provider.ConsumeIntegralInRange<CAmount>(1, MAX_MONEY)};\n    const bool subtract_fee_outputs{fuzzed_data_provider.ConsumeBool()};\n\n    FastRandomContext fast_random_context{ConsumeUInt256(fuzzed_data_provider)};\n    CoinSelectionParams coin_params{fast_random_context};\n    coin_params.m_subtract_fee_outputs = subtract_fee_outputs;\n    coin_params.m_long_term_feerate = long_term_fee_rate;\n    coin_params.m_effective_feerate = effective_fee_rate;\n\n    \/\/ Create some coins\n    CAmount total_balance{0};\n    int next_locktime{0};\n    LIMITED_WHILE(fuzzed_data_provider.ConsumeBool(), 10000)\n    {\n        const int n_input{fuzzed_data_provider.ConsumeIntegralInRange<int>(0, 10)};\n        const int n_input_bytes{fuzzed_data_provider.ConsumeIntegralInRange<int>(100, 10000)};\n        const CAmount amount{fuzzed_data_provider.ConsumeIntegralInRange<CAmount>(1, MAX_MONEY)};\n        if (total_balance + amount >= MAX_MONEY) {\n            break;\n        }\n        AddCoin(amount, n_input, n_input_bytes, ++next_locktime, utxo_pool, coin_params.m_effective_feerate);\n        total_balance += amount;\n    }\n\n    std::vector<OutputGroup> group_pos;\n    GroupCoins(fuzzed_data_provider, utxo_pool, coin_params, \/*positive_only=*\/true, group_pos);\n    std::vector<OutputGroup> group_all;\n    GroupCoins(fuzzed_data_provider, utxo_pool, coin_params, \/*positive_only=*\/false, group_all);\n\n    \/\/ Run coinselection algorithms\n    const auto result_bnb = SelectCoinsBnB(group_pos, target, cost_of_change);\n\n    auto result_srd = SelectCoinsSRD(group_pos, target, fast_random_context);\n    if (result_srd) result_srd->ComputeAndSetWaste(cost_of_change);\n\n    CAmount change_target{GenerateChangeTarget(target, fast_random_context)};\n    auto result_knapsack = KnapsackSolver(group_all, target, change_target, fast_random_context);\n    if (result_knapsack) result_knapsack->ComputeAndSetWaste(cost_of_change);\n\n    \/\/ If the total balance is sufficient for the target and we are not using\n    \/\/ effective values, Knapsack should always find a solution.\n    if (total_balance >= target && subtract_fee_outputs) {\n        assert(result_knapsack);\n    }\n}\n\n} \/\/ namespace wallet\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: b2dpolygontools.hxx,v $\n *\n *  $Revision: 1.13 $\n *\n *  last change: $Author: rt $ $Date: 2004-11-26 18:32: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#ifndef _BGFX_POLYGON_B2DPOLYGONTOOLS_HXX\n#define _BGFX_POLYGON_B2DPOLYGONTOOLS_HXX\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_B2DRECTANGLE_HXX\n#include <basegfx\/range\/b2drectangle.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\nnamespace basegfx\n{\n    \/\/ predefinitions\n    class B2DPolygon;\n    class B2DRange;\n\n    namespace tools\n    {\n        \/\/ B2DPolygon tools\n\n        \/** Check if given polygon is closed.\n\n            This is kind of a 'classic' method to support old polygon\n            definitions.  Those old polygon definitions define the\n            closed state of the polygon using identical start and\n            endpoints. This method corrects this (removes double\n            start\/end points) and sets the Closed()-state of the\n            polygon correctly.\n        *\/\n        void checkClosed(B2DPolygon& rCandidate);\n\n        \/\/ Get successor and predecessor indices. Returning the same index means there\n        \/\/ is none. Same for successor.\n        sal_uInt32 getIndexOfPredecessor(sal_uInt32 nIndex, const B2DPolygon& rCandidate);\n        sal_uInt32 getIndexOfSuccessor(sal_uInt32 nIndex, const B2DPolygon& rCandidate);\n\n        \/\/ Get orientation of Polygon\n        B2VectorOrientation getOrientation(const B2DPolygon& rCandidate);\n\n        \/\/ isInside tests for B2dPoint and other B2dPolygon. On border is not inside as long as\n        \/\/ not true is given in bWithBorder flag.\n        bool isInside(const B2DPolygon& rCandidate, const B2DPoint& rPoint, bool bWithBorder = false);\n        bool isInside(const B2DPolygon& rCandidate, const B2DPolygon& rPolygon, bool bWithBorder = false);\n\n        \/\/ get size of polygon. Control vectors are included in that ranges.\n        B2DRange getRange(const B2DPolygon& rCandidate);\n\n        \/\/ get signed area of polygon\n        double getSignedArea(const B2DPolygon& rCandidate);\n\n        \/\/ get area of polygon\n        double getArea(const B2DPolygon& rCandidate);\n\n        \/\/ get length of polygon edge from point nIndex to nIndex + 1\n        double getEdgeLength(const B2DPolygon& rCandidate, sal_uInt32 nIndex);\n\n        \/\/ get length of polygon\n        double getLength(const B2DPolygon& rCandidate);\n\n        \/\/ get position on polygon for absolute given distance. If\n        \/\/ length is given, it is assumed the correct polygon length, if 0.0 it is calculated\n        \/\/ using getLength(...)\n        B2DPoint getPositionAbsolute(const B2DPolygon& rCandidate, double fDistance, double fLength = 0.0);\n\n        \/\/ get position on polygon for relative given distance in range [0.0 .. 1.0]. If\n        \/\/ length is given, it is assumed the correct polygon length, if 0.0 it is calculated\n        \/\/ using getLength(...)\n        B2DPoint getPositionRelative(const B2DPolygon& rCandidate, double fDistance, double fLength = 0.0);\n\n        \/\/ get a snippet from given polygon for absolute distances. The polygon is assumed\n        \/\/ to be opened (not closed). fFrom and fTo need to be in range [0.0 .. fLength], where\n        \/\/ fTo >= fFrom. If length is given, it is assumed the correct polygon length,\n        \/\/ if 0.0 it is calculated using getLength(...)\n        B2DPolygon getSnippetAbsolute(const B2DPolygon& rCandidate, double fFrom, double fTo, double fLength = 0.0);\n\n        \/\/ get a snippet from given polygon for relative distances. The polygon is assumed\n        \/\/ to be opened (not closed). fFrom and fTo need to be in range [0.0 .. 1.0], where\n        \/\/ fTo >= fFrom. If length is given, it is assumed the correct polygon length,\n        \/\/ if 0.0 it is calculated using getLength(...)\n        B2DPolygon getSnippetRelative(const B2DPolygon& rCandidate, double fFrom = 0.0, double fTo = 1.0, double fLength = 0.0);\n\n        \/\/ Continuity check for point with given index\n        B2VectorContinuity getContinuityInPoint(const B2DPolygon& rCandidate, sal_uInt32 nIndex);\n\n        \/\/BFS08\n        B2DPolyPolygon removeIntersections(const B2DPolygon& rCandidate, bool bKeepOrientations = true);\n\n        \/\/ Subdivide all contained curves. Use distanceBound value if given.\n        B2DPolygon adaptiveSubdivideByDistance(const B2DPolygon& rCandidate, double fDistanceBound = 0.0);\n\n        \/\/ Subdivide all contained curves. Use distanceBound value if given.\n        B2DPolygon adaptiveSubdivideByAngle(const B2DPolygon& rCandidate, double fAngleBound = 5.0);\n\n        \/\/ Definitions for the cut flags used from the findCut methods\n        typedef sal_uInt16 CutFlagValue;\n\n        #define CUTFLAG_NONE            (0x0000)\n        #define CUTFLAG_LINE            (0x0001)\n        #define CUTFLAG_START1          (0x0002)\n        #define CUTFLAG_START2          (0x0004)\n        #define CUTFLAG_END1            (0x0008)\n        #define CUTFLAG_END2            (0x0010)\n        #define CUTFLAG_ALL         (CUTFLAG_LINE|CUTFLAG_START1|CUTFLAG_START2|CUTFLAG_END1|CUTFLAG_END2)\n        #define CUTFLAG_DEFAULT     (CUTFLAG_LINE|CUTFLAG_START2|CUTFLAG_END2)\n\n        \/\/ Calculate cut between the points given by the two indices. pCut1\n        \/\/ and pCut2 will contain the cut coordinate on each edge in ]0.0, 1.0]\n        \/\/ (if given) and the return value will contain a cut description.\n        CutFlagValue findCut(\n            const B2DPolygon& rCandidate,\n            sal_uInt32 nIndex1, sal_uInt32 nIndex2,\n            CutFlagValue aCutFlags = CUTFLAG_DEFAULT,\n            double* pCut1 = 0L, double* pCut2 = 0L);\n\n        \/\/ This version is working with two indexed edges from different\n        \/\/ polygons.\n        CutFlagValue findCut(\n            const B2DPolygon& rCandidate1, sal_uInt32 nIndex1,\n            const B2DPolygon& rCandidate2, sal_uInt32 nIndex2,\n            CutFlagValue aCutFlags = CUTFLAG_DEFAULT,\n            double* pCut1 = 0L, double* pCut2 = 0L);\n\n        \/\/ This version works with two points and vectors to define the\n        \/\/ edges for the cut test.\n        CutFlagValue findCut(\n            const B2DPoint& rEdge1Start, const B2DVector& rEdge1Delta,\n            const B2DPoint& rEdge2Start, const B2DVector& rEdge2Delta,\n            CutFlagValue aCutFlags = CUTFLAG_DEFAULT,\n            double* pCut1 = 0L, double* pCut2 = 0L);\n\n        \/\/ test if point is on the given edge in range ]0.0..1.0[ without\n        \/\/ the start\/end points. If so, return true and put the parameter\n        \/\/ value in pCut (if provided)\n        bool isPointOnEdge(\n            const B2DPoint& rPoint,\n            const B2DPoint& rEdgeStart,\n            const B2DVector& rEdgeDelta,\n            double* pCut = 0L);\n\n        \/\/ Apply Line Dashing. This cuts the Polygon into line pieces\n        \/\/ which are inserted as single polygons into the result.\n        \/\/ If fFullDashDotLen is not given it will be calculated from the given\n        \/\/ raDashDotArray.\n        B2DPolyPolygon applyLineDashing(const B2DPolygon& rCandidate, const ::std::vector<double>& raDashDotArray, double fFullDashDotLen = 0.0);\n\n        \/\/ test if point is inside epsilon-range around an edge defined\n        \/\/ by the two given points. Can be used for HitTesting. The epsilon-range\n        \/\/ is defined to be the rectangle centered to the given edge, using height\n        \/\/ 2 x fDistance, and the circle around both points with radius fDistance.\n        bool isInEpsilonRange(const B2DPoint& rEdgeStart, const B2DPoint& rEdgeEnd, const B2DPoint& rTestPosition, double fDistance);\n\n        \/\/ test if point is inside epsilon-range around the given Polygon. Can be used\n        \/\/ for HitTesting. The epsilon-range is defined to be the tube around the polygon\n        \/\/ with distance fDistance and rounded edges (start and end point).\n        bool isInEpsilonRange(const B2DPolygon& rCandidate, const B2DPoint& rTestPosition, double fDistance);\n\n        \/* Still missing:\n        void transform(const Matrix4D& rTfMatrix);\n        Polygon3D getExpandedPolygon(sal_uInt32 nNum);\n        *\/\n\n        \/** Create a polygon from a rectangle.\n         *\/\n        B2DPolygon createPolygonFromRect( const B2DRectangle& rRect );\n\n        \/** Create a circle polygon with given radius.\n\n            This method creates a circle approximation consisting of\n            four cubic bezier segments, which approximate the given\n            circle with an error of less than 0.5 percent. To create\n            ellipses, simply scale the resulting circle\n            anisotrophically.\n\n            @param rCenter\n            Center point of the circle\n\n            @param nRadius\n            Radius of the circle\n         *\/\n        B2DPolygon createPolygonFromCircle( const B2DPoint& rCenter, double nRadius );\n\n    } \/\/ end of namespace tools\n} \/\/ end of namespace basegfx\n\n#endif \/* _BGFX_POLYGON_B2DPOLYGONTOOLS_HXX *\/\n<commit_msg>INTEGRATION: CWS aw022 (1.12.2); FILE MERGED 2004\/11\/25 11:09:18 aw 1.12.2.1: #i37443#<commit_after>\/*************************************************************************\n *\n *  $RCSfile: b2dpolygontools.hxx,v $\n *\n *  $Revision: 1.14 $\n *\n *  last change: $Author: rt $ $Date: 2004-12-13 08: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#ifndef _BGFX_POLYGON_B2DPOLYGONTOOLS_HXX\n#define _BGFX_POLYGON_B2DPOLYGONTOOLS_HXX\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_B2DRECTANGLE_HXX\n#include <basegfx\/range\/b2drectangle.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\nnamespace basegfx\n{\n    \/\/ predefinitions\n    class B2DPolygon;\n    class B2DRange;\n\n    namespace tools\n    {\n        \/\/ B2DPolygon tools\n\n        \/** Check if given polygon is closed.\n\n            This is kind of a 'classic' method to support old polygon\n            definitions.  Those old polygon definitions define the\n            closed state of the polygon using identical start and\n            endpoints. This method corrects this (removes double\n            start\/end points) and sets the Closed()-state of the\n            polygon correctly.\n        *\/\n        void checkClosed(B2DPolygon& rCandidate);\n\n        \/\/ Get successor and predecessor indices. Returning the same index means there\n        \/\/ is none. Same for successor.\n        sal_uInt32 getIndexOfPredecessor(sal_uInt32 nIndex, const B2DPolygon& rCandidate);\n        sal_uInt32 getIndexOfSuccessor(sal_uInt32 nIndex, const B2DPolygon& rCandidate);\n\n        \/\/ Get orientation of Polygon\n        B2VectorOrientation getOrientation(const B2DPolygon& rCandidate);\n\n        \/\/ isInside tests for B2dPoint and other B2dPolygon. On border is not inside as long as\n        \/\/ not true is given in bWithBorder flag.\n        bool isInside(const B2DPolygon& rCandidate, const B2DPoint& rPoint, bool bWithBorder = false);\n        bool isInside(const B2DPolygon& rCandidate, const B2DPolygon& rPolygon, bool bWithBorder = false);\n\n        \/\/ get size of polygon. Control vectors are included in that ranges.\n        B2DRange getRange(const B2DPolygon& rCandidate);\n\n        \/\/ get signed area of polygon\n        double getSignedArea(const B2DPolygon& rCandidate);\n\n        \/\/ get area of polygon\n        double getArea(const B2DPolygon& rCandidate);\n\n        \/\/ get length of polygon edge from point nIndex to nIndex + 1\n        double getEdgeLength(const B2DPolygon& rCandidate, sal_uInt32 nIndex);\n\n        \/\/ get length of polygon\n        double getLength(const B2DPolygon& rCandidate);\n\n        \/\/ get position on polygon for absolute given distance. If\n        \/\/ length is given, it is assumed the correct polygon length, if 0.0 it is calculated\n        \/\/ using getLength(...)\n        B2DPoint getPositionAbsolute(const B2DPolygon& rCandidate, double fDistance, double fLength = 0.0);\n\n        \/\/ get position on polygon for relative given distance in range [0.0 .. 1.0]. If\n        \/\/ length is given, it is assumed the correct polygon length, if 0.0 it is calculated\n        \/\/ using getLength(...)\n        B2DPoint getPositionRelative(const B2DPolygon& rCandidate, double fDistance, double fLength = 0.0);\n\n        \/\/ get a snippet from given polygon for absolute distances. The polygon is assumed\n        \/\/ to be opened (not closed). fFrom and fTo need to be in range [0.0 .. fLength], where\n        \/\/ fTo >= fFrom. If length is given, it is assumed the correct polygon length,\n        \/\/ if 0.0 it is calculated using getLength(...)\n        B2DPolygon getSnippetAbsolute(const B2DPolygon& rCandidate, double fFrom, double fTo, double fLength = 0.0);\n\n        \/\/ get a snippet from given polygon for relative distances. The polygon is assumed\n        \/\/ to be opened (not closed). fFrom and fTo need to be in range [0.0 .. 1.0], where\n        \/\/ fTo >= fFrom. If length is given, it is assumed the correct polygon length,\n        \/\/ if 0.0 it is calculated using getLength(...)\n        B2DPolygon getSnippetRelative(const B2DPolygon& rCandidate, double fFrom = 0.0, double fTo = 1.0, double fLength = 0.0);\n\n        \/\/ Continuity check for point with given index\n        B2VectorContinuity getContinuityInPoint(const B2DPolygon& rCandidate, sal_uInt32 nIndex);\n\n        \/\/BFS08\n        B2DPolyPolygon removeIntersections(const B2DPolygon& rCandidate, bool bKeepOrientations = true);\n\n        \/\/ Subdivide all contained curves. Use distanceBound value if given.\n        B2DPolygon adaptiveSubdivideByDistance(const B2DPolygon& rCandidate, double fDistanceBound = 0.0);\n\n        \/\/ Subdivide all contained curves. Use angleBound value if given.\n        B2DPolygon adaptiveSubdivideByAngle(const B2DPolygon& rCandidate, double fAngleBound = 0.0);\n\n        \/\/ #i37443# Subdivide all contained curves. Use distanceBound value if given.\n        B2DPolygon adaptiveSubdivideByCount(const B2DPolygon& rCandidate, sal_uInt32 nCount = 0L);\n\n        \/\/ Definitions for the cut flags used from the findCut methods\n        typedef sal_uInt16 CutFlagValue;\n\n        #define CUTFLAG_NONE            (0x0000)\n        #define CUTFLAG_LINE            (0x0001)\n        #define CUTFLAG_START1          (0x0002)\n        #define CUTFLAG_START2          (0x0004)\n        #define CUTFLAG_END1            (0x0008)\n        #define CUTFLAG_END2            (0x0010)\n        #define CUTFLAG_ALL         (CUTFLAG_LINE|CUTFLAG_START1|CUTFLAG_START2|CUTFLAG_END1|CUTFLAG_END2)\n        #define CUTFLAG_DEFAULT     (CUTFLAG_LINE|CUTFLAG_START2|CUTFLAG_END2)\n\n        \/\/ Calculate cut between the points given by the two indices. pCut1\n        \/\/ and pCut2 will contain the cut coordinate on each edge in ]0.0, 1.0]\n        \/\/ (if given) and the return value will contain a cut description.\n        CutFlagValue findCut(\n            const B2DPolygon& rCandidate,\n            sal_uInt32 nIndex1, sal_uInt32 nIndex2,\n            CutFlagValue aCutFlags = CUTFLAG_DEFAULT,\n            double* pCut1 = 0L, double* pCut2 = 0L);\n\n        \/\/ This version is working with two indexed edges from different\n        \/\/ polygons.\n        CutFlagValue findCut(\n            const B2DPolygon& rCandidate1, sal_uInt32 nIndex1,\n            const B2DPolygon& rCandidate2, sal_uInt32 nIndex2,\n            CutFlagValue aCutFlags = CUTFLAG_DEFAULT,\n            double* pCut1 = 0L, double* pCut2 = 0L);\n\n        \/\/ This version works with two points and vectors to define the\n        \/\/ edges for the cut test.\n        CutFlagValue findCut(\n            const B2DPoint& rEdge1Start, const B2DVector& rEdge1Delta,\n            const B2DPoint& rEdge2Start, const B2DVector& rEdge2Delta,\n            CutFlagValue aCutFlags = CUTFLAG_DEFAULT,\n            double* pCut1 = 0L, double* pCut2 = 0L);\n\n        \/\/ test if point is on the given edge in range ]0.0..1.0[ without\n        \/\/ the start\/end points. If so, return true and put the parameter\n        \/\/ value in pCut (if provided)\n        bool isPointOnEdge(\n            const B2DPoint& rPoint,\n            const B2DPoint& rEdgeStart,\n            const B2DVector& rEdgeDelta,\n            double* pCut = 0L);\n\n        \/\/ Apply Line Dashing. This cuts the Polygon into line pieces\n        \/\/ which are inserted as single polygons into the result.\n        \/\/ If fFullDashDotLen is not given it will be calculated from the given\n        \/\/ raDashDotArray.\n        B2DPolyPolygon applyLineDashing(const B2DPolygon& rCandidate, const ::std::vector<double>& raDashDotArray, double fFullDashDotLen = 0.0);\n\n        \/\/ test if point is inside epsilon-range around an edge defined\n        \/\/ by the two given points. Can be used for HitTesting. The epsilon-range\n        \/\/ is defined to be the rectangle centered to the given edge, using height\n        \/\/ 2 x fDistance, and the circle around both points with radius fDistance.\n        bool isInEpsilonRange(const B2DPoint& rEdgeStart, const B2DPoint& rEdgeEnd, const B2DPoint& rTestPosition, double fDistance);\n\n        \/\/ test if point is inside epsilon-range around the given Polygon. Can be used\n        \/\/ for HitTesting. The epsilon-range is defined to be the tube around the polygon\n        \/\/ with distance fDistance and rounded edges (start and end point).\n        bool isInEpsilonRange(const B2DPolygon& rCandidate, const B2DPoint& rTestPosition, double fDistance);\n\n        \/* Still missing:\n        void transform(const Matrix4D& rTfMatrix);\n        Polygon3D getExpandedPolygon(sal_uInt32 nNum);\n        *\/\n\n        \/** Create a polygon from a rectangle.\n         *\/\n        B2DPolygon createPolygonFromRect( const B2DRectangle& rRect );\n\n        \/** Create a circle polygon with given radius.\n\n            This method creates a circle approximation consisting of\n            four cubic bezier segments, which approximate the given\n            circle with an error of less than 0.5 percent. To create\n            ellipses, simply scale the resulting circle\n            anisotrophically.\n\n            @param rCenter\n            Center point of the circle\n\n            @param nRadius\n            Radius of the circle\n         *\/\n        B2DPolygon createPolygonFromCircle( const B2DPoint& rCenter, double nRadius );\n\n    } \/\/ end of namespace tools\n} \/\/ end of namespace basegfx\n\n#endif \/* _BGFX_POLYGON_B2DPOLYGONTOOLS_HXX *\/\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- mode:linux -*- *\/\n\/**\n * \\file completion_counter.cc\n *\n *\n *\n * \\author Ethan Burns\n * \\date 2008-10-24\n *\/\n\n#include <pthread.h>\n\n#include \"completion_counter.h\"\n#include <iostream>\n\nusing namespace std;\n\nCompletionCounter::CompletionCounter(unsigned int max)\n\t: counter(0), max(max)\n{\n}\n\nCompletionCounter::CompletionCounter(void)\n\t: counter(0), max(0)\n{\n}\n\n\/**\n * Set the maximum value.\n *\/\nvoid CompletionCounter::set_max(unsigned int max)\n{\n\tthis->max = AtomicInt(max);\n}\n\nunsigned int CompletionCounter::get_count()\n{\n\tunsigned int ret;\n\tret = counter.read();\n        return ret;\n}\n\nbool CompletionCounter::is_complete()\n{\n\tbool ret;\n\tret = counter.read() >= max.read();\n        return ret;\n}\n\nvoid CompletionCounter::complete(void)\n{\n\tcounter.add(1);\n}\n\nvoid CompletionCounter::uncomplete(void)\n{\n\tcounter.sub(1);\n}\n\n\/**\n * Wait for all the completions. (counter == max)\n *\/\nvoid CompletionCounter::wait(void)\n{\n\twhile (counter < max){}\n}\n\n\/**\n * Reset the counter to zero.\n *\/\nvoid CompletionCounter::reset(void)\n{\n\tcounter = AtomicInt(0);\n}\n<commit_msg>fix to busy wait<commit_after>\/* -*- mode:linux -*- *\/\n\/**\n * \\file completion_counter.cc\n *\n *\n *\n * \\author Ethan Burns\n * \\date 2008-10-24\n *\/\n\n#include <pthread.h>\n\n#include \"completion_counter.h\"\n#include <iostream>\n\nusing namespace std;\n\nCompletionCounter::CompletionCounter(unsigned int max)\n\t: counter(0), max(max)\n{\n}\n\nCompletionCounter::CompletionCounter(void)\n\t: counter(0), max(0)\n{\n}\n\n\/**\n * Set the maximum value.\n *\/\nvoid CompletionCounter::set_max(unsigned int max)\n{\n\tthis->max = AtomicInt(max);\n}\n\nunsigned int CompletionCounter::get_count()\n{\n\tunsigned int ret;\n\tret = counter.read();\n        return ret;\n}\n\nbool CompletionCounter::is_complete()\n{\n\tbool ret;\n\tret = counter.read() >= max.read();\n        return ret;\n}\n\nvoid CompletionCounter::complete(void)\n{\n\tcounter.add(1);\n}\n\nvoid CompletionCounter::uncomplete(void)\n{\n\tcounter.sub(1);\n}\n\n\/**\n * Wait for all the completions. (counter == max)\n *\/\nvoid CompletionCounter::wait(void)\n{\n\twhile (counter.read() < max.read()){}\n}\n\n\/**\n * Reset the counter to zero.\n *\/\nvoid CompletionCounter::reset(void)\n{\n\tcounter = AtomicInt(0);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===========================================\n\/\/  PC-BSD source code\n\/\/  Copyright (c) 2015, PC-BSD Software\/iXsystems\n\/\/  Available under the 3-clause BSD license\n\/\/  See the LICENSE file for full details\n\/\/===========================================\n#include \"sysadm-general.h\"\n\/\/PLEASE: Keep the functions in the same order as listed in pcbsd-general.h\n\n#include \"sysadm-global.h\"\n\nusing namespace sysadm;\n\/\/=================\n\/\/ RunCommand() variations\n\/\/=================\n\/\/Note: environment changes should be listed as such: <variable>=<value>\n\n\/\/Return CLI output (and success\/failure)\nQString General::RunCommand(bool &success, QString command, QStringList arguments, QString workdir, QStringList env){\n  QProcess proc;\n    proc.setProcessChannelMode(QProcess::MergedChannels); \/\/need output\n  \/\/First setup the process environment as necessary\n  QProcessEnvironment PE = QProcessEnvironment::systemEnvironment();\n    if(!env.isEmpty()){\n      for(int i=0; i<env.length(); i++){\n    if(!env[i].contains(\"=\")){ continue; }\n        PE.insert(env[i].section(\"=\",0,0), env[i].section(\"=\",1,100));\n      }\n    }\n    proc.setProcessEnvironment(PE);\n  \/\/if a working directory is specified, check it and use it\n  if(!workdir.isEmpty()){\n    proc.setWorkingDirectory(workdir);\n  }\n  \/\/Now run the command (with any optional arguments)\n  if(arguments.isEmpty()){ proc.start(command); }\n  else{ proc.start(command, arguments); }\n  \/\/Wait for the process to finish (but don't block the event loop)\n  while( !proc.waitForFinished(500) ){ QCoreApplication::processEvents(); }\n  success = (proc.exitCode()==0); \/\/return success\/failure\n  return QString(proc.readAllStandardOutput());\n}\n\nQString General::RunCommand(QString command, QStringList arguments, QString workdir, QStringList env){\n  \/\/Overloaded simplification for text-only output\n  bool junk = false;\n  return General::RunCommand(junk,command,arguments,workdir,env);\n}\n\nbool General::RunQuickCommand(QString command, QStringList arguments,QString workdir, QStringList env){\n  \/\/Overloaded simplification for success-only output\n  bool success = false;\n  General::RunCommand(success, command, arguments, workdir, env);\n  return success;\n}\n\n\/\/=================\n\/\/ TEXT FILE INTERACTION\n\/\/=================\nQStringList General::readTextFile(QString filepath){\n  QStringList out;\n  QFile file(filepath);\n  if(file.open(QIODevice::Text | QIODevice::ReadOnly)){\n    QTextStream in(&file);\n    while(!in.atEnd()){\n      out << in.readLine();\n    }\n    file.close();\n  }\n  return out;\n}\n\nbool General::writeTextFile(QString filepath, QStringList contents, bool overwrite){\n  \/\/Simplification for user directory\n  if(filepath.startsWith(\"~\")){ filepath = filepath.replace(0,1,QDir::homePath()); }\n  QFile file(filepath);\n  \/\/Check existance\/validity\n  if(file.exists() && !overwrite){ return false; }\n  if(!file.exists()){\n    \/\/See if we need to create the parent directory as well\n    QDir dir = QFileInfo(filepath).dir(); \/\/get the parent directory\n    if(!dir.exists()){\n      if(!dir.mkpath(dir.absolutePath())){ return false; } \/\/could not create parent directory\n    }\n  }\n  \/\/Make sure that something is there to be written\n  \/\/ - to delete a file, use QFile::remove() instead of this function\n  if(contents.isEmpty()){ contents << \"\\n\"; }\n  else if(contents.last().isEmpty()){ contents << \"\\n\"; }\n  \/\/Now save the contents to the file\n  bool ok = false;\n  if( file.open(QIODevice::WriteOnly | QIODevice::Truncate) ){\n    QTextStream out(&file);\n    out << contents.join(\"\\n\");\n    file.close();\n    ok = true;\n  }\n  return ok;\n}\nQString General::getConfFileValue(QString fileName, QString Key, int occur )\n{\n    int found = 1;\n\n    QFile file( fileName );\n    if ( ! file.open( QIODevice::ReadOnly ) ) {\n        return QString();\n    }\n\n    QTextStream stream( &file );\n    QString line;\n    while ( !stream.atEnd() )\n    {\n        line = stream.readLine(); \/\/ line of text excluding '\\n'\n        line = line.section(\"#\",0,0).trimmed(); \/\/remove any comments\n        if(line.isEmpty()){ continue; }\n        int index = line.indexOf(Key, 0);\n        \/\/qDebug() << \"Line:\" << line << index;\n        \/\/ If the KEY is not found at the start of the line, continue processing\n        if(index!=0)\n            continue;\n\n        if ( found == occur) {\n            line.remove(line.indexOf(Key, 0), Key.length());\n\n            \/\/ Remove any quotes\n            if ( line.indexOf('\"') == 0 )\n                line = line.remove(0, 1);\n\n            if ( line.indexOf('\"') != -1  )\n                line.truncate(line.indexOf('\"'));\n\n            file.close();\n\n            return line;\n        } else {\n           found++;\n        }\n    }\n\n    file.close();\n    return QString();\n}\nbool General::setConfFileValue(QString fileName, QString oldKey, QString newKey, int occur )\n{\n    \/\/ Lets the dev save a value into a specified config file.\n    \/\/ The occur value tells which occurance of \"oldKey\" to replace\n    \/\/ If occur is set to -1, it will remove any duplicates of \"oldKey\"\n\n    \/\/copy the original file to create a temporary file for editing\n    QStringList args;\n    QString oFileTmp = fileName + \".tmp\";\n    args << fileName << oFileTmp;\n    General::RunCommand(\"cp\",args);\n\n    \/\/Continue evaluating the temporary file\n    QStringList SavedFile;\n    int found = 1;\n\n    \/\/ Load the old file, find the oldKey, remove it and replace with newKey\n    QFile file( oFileTmp );\n    if ( ! file.open( QIODevice::ReadOnly ) )\n        return false;\n\n    QTextStream stream( &file );\n    QString line;\n    while ( !stream.atEnd() ) {\n        line = stream.readLine(); \/\/ line of text excluding '\\n'\n\n        \/\/ Key is not found at all\n        if ( line.indexOf(oldKey, 0) == -1 ) {\n            SavedFile << line ;\n            continue;\n        }\n\n        \/\/ Found the key, but it is commented out, so don't worry about this line\n        if ( line.trimmed().indexOf(\"#\", 0) == 0 ) {\n            SavedFile << line ;\n            continue;\n        }\n\n        \/\/ If the KEY is found, and we are just on wrong occurance, save it and continue to search\n        if ( occur != -1 && found != occur ) {\n            SavedFile << line ;\n            found++;\n            continue;\n        }\n\n        \/\/ If the KEY is found in the line and this matches the occurance that must be processed\n        if ( ! newKey.isEmpty() && found == occur )\n        {\n            SavedFile << newKey ;\n            newKey.clear();\n            found++;\n            continue;\n        }\n\n        \/\/ If the KEY is found and we just want one occurance of the key\n        if ( occur == -1 && ! newKey.isEmpty() ) {\n            SavedFile << newKey ;\n            newKey.clear();\n            found++;\n            continue;\n        }\n\n    }\n\n    file.close();\n\n    \/\/ Didn't find the key? Write it!\n    if ( ! newKey.isEmpty() )\n        SavedFile << newKey;\n\n\n    \/\/ Save the new file\n    QFile fileout( oFileTmp );\n    if ( ! fileout.open( QIODevice::WriteOnly ) )\n        return false;\n\n    QTextStream streamout( &fileout );\n    for (int i = 0; i < SavedFile.size(); ++i)\n        streamout << SavedFile.at(i) << \"\\n\";\n\n    fileout.close();\n\n    \/\/Have the temporary file with new changes overwrite the original file\n    args.clear();\n    args << oFileTmp << fileName;\n    General::RunCommand(\"mv\",args);\n    return true;\n}\n\n\/\/===========================\n\/\/     SYSCTL ACCESS (might require root)\n\/\/===========================\n\/\/Retrieve a text-based sysctl\nQString General::sysctl(QString var){\n   char result[1000];\n   size_t len = sizeof(result);\n   sysctlbyname(var.toLocal8Bit(), result, &len, NULL, 0);\n   result[len] = '\\0';\n   return QString(result);\n}\n\n\/\/Retrieve a number-based sysctl\nlong long General::sysctlAsInt(QString var){\n   long long result = 0;\n   size_t len = sizeof(result);\n   sysctlbyname(var.toLocal8Bit(), &result, &len, NULL, 0);\n   return result;\n}\n<commit_msg>Fix a sysctl lookup error checking bug (will return empty\/0 value instead of a random byte array\/value when the sysctl does not exist).<commit_after>\/\/===========================================\n\/\/  PC-BSD source code\n\/\/  Copyright (c) 2015, PC-BSD Software\/iXsystems\n\/\/  Available under the 3-clause BSD license\n\/\/  See the LICENSE file for full details\n\/\/===========================================\n#include \"sysadm-general.h\"\n\/\/PLEASE: Keep the functions in the same order as listed in pcbsd-general.h\n\n#include \"sysadm-global.h\"\n\nusing namespace sysadm;\n\/\/=================\n\/\/ RunCommand() variations\n\/\/=================\n\/\/Note: environment changes should be listed as such: <variable>=<value>\n\n\/\/Return CLI output (and success\/failure)\nQString General::RunCommand(bool &success, QString command, QStringList arguments, QString workdir, QStringList env){\n  QProcess proc;\n    proc.setProcessChannelMode(QProcess::MergedChannels); \/\/need output\n  \/\/First setup the process environment as necessary\n  QProcessEnvironment PE = QProcessEnvironment::systemEnvironment();\n    if(!env.isEmpty()){\n      for(int i=0; i<env.length(); i++){\n    if(!env[i].contains(\"=\")){ continue; }\n        PE.insert(env[i].section(\"=\",0,0), env[i].section(\"=\",1,100));\n      }\n    }\n    proc.setProcessEnvironment(PE);\n  \/\/if a working directory is specified, check it and use it\n  if(!workdir.isEmpty()){\n    proc.setWorkingDirectory(workdir);\n  }\n  \/\/Now run the command (with any optional arguments)\n  if(arguments.isEmpty()){ proc.start(command); }\n  else{ proc.start(command, arguments); }\n  \/\/Wait for the process to finish (but don't block the event loop)\n  while( !proc.waitForFinished(500) ){ QCoreApplication::processEvents(); }\n  success = (proc.exitCode()==0); \/\/return success\/failure\n  return QString(proc.readAllStandardOutput());\n}\n\nQString General::RunCommand(QString command, QStringList arguments, QString workdir, QStringList env){\n  \/\/Overloaded simplification for text-only output\n  bool junk = false;\n  return General::RunCommand(junk,command,arguments,workdir,env);\n}\n\nbool General::RunQuickCommand(QString command, QStringList arguments,QString workdir, QStringList env){\n  \/\/Overloaded simplification for success-only output\n  bool success = false;\n  General::RunCommand(success, command, arguments, workdir, env);\n  return success;\n}\n\n\/\/=================\n\/\/ TEXT FILE INTERACTION\n\/\/=================\nQStringList General::readTextFile(QString filepath){\n  QStringList out;\n  QFile file(filepath);\n  if(file.open(QIODevice::Text | QIODevice::ReadOnly)){\n    QTextStream in(&file);\n    while(!in.atEnd()){\n      out << in.readLine();\n    }\n    file.close();\n  }\n  return out;\n}\n\nbool General::writeTextFile(QString filepath, QStringList contents, bool overwrite){\n  \/\/Simplification for user directory\n  if(filepath.startsWith(\"~\")){ filepath = filepath.replace(0,1,QDir::homePath()); }\n  QFile file(filepath);\n  \/\/Check existance\/validity\n  if(file.exists() && !overwrite){ return false; }\n  if(!file.exists()){\n    \/\/See if we need to create the parent directory as well\n    QDir dir = QFileInfo(filepath).dir(); \/\/get the parent directory\n    if(!dir.exists()){\n      if(!dir.mkpath(dir.absolutePath())){ return false; } \/\/could not create parent directory\n    }\n  }\n  \/\/Make sure that something is there to be written\n  \/\/ - to delete a file, use QFile::remove() instead of this function\n  if(contents.isEmpty()){ contents << \"\\n\"; }\n  else if(contents.last().isEmpty()){ contents << \"\\n\"; }\n  \/\/Now save the contents to the file\n  bool ok = false;\n  if( file.open(QIODevice::WriteOnly | QIODevice::Truncate) ){\n    QTextStream out(&file);\n    out << contents.join(\"\\n\");\n    file.close();\n    ok = true;\n  }\n  return ok;\n}\nQString General::getConfFileValue(QString fileName, QString Key, int occur )\n{\n    int found = 1;\n\n    QFile file( fileName );\n    if ( ! file.open( QIODevice::ReadOnly ) ) {\n        return QString();\n    }\n\n    QTextStream stream( &file );\n    QString line;\n    while ( !stream.atEnd() )\n    {\n        line = stream.readLine(); \/\/ line of text excluding '\\n'\n        line = line.section(\"#\",0,0).trimmed(); \/\/remove any comments\n        if(line.isEmpty()){ continue; }\n        int index = line.indexOf(Key, 0);\n        \/\/qDebug() << \"Line:\" << line << index;\n        \/\/ If the KEY is not found at the start of the line, continue processing\n        if(index!=0)\n            continue;\n\n        if ( found == occur) {\n            line.remove(line.indexOf(Key, 0), Key.length());\n\n            \/\/ Remove any quotes\n            if ( line.indexOf('\"') == 0 )\n                line = line.remove(0, 1);\n\n            if ( line.indexOf('\"') != -1  )\n                line.truncate(line.indexOf('\"'));\n\n            file.close();\n\n            return line;\n        } else {\n           found++;\n        }\n    }\n\n    file.close();\n    return QString();\n}\nbool General::setConfFileValue(QString fileName, QString oldKey, QString newKey, int occur )\n{\n    \/\/ Lets the dev save a value into a specified config file.\n    \/\/ The occur value tells which occurance of \"oldKey\" to replace\n    \/\/ If occur is set to -1, it will remove any duplicates of \"oldKey\"\n\n    \/\/copy the original file to create a temporary file for editing\n    QStringList args;\n    QString oFileTmp = fileName + \".tmp\";\n    args << fileName << oFileTmp;\n    General::RunCommand(\"cp\",args);\n\n    \/\/Continue evaluating the temporary file\n    QStringList SavedFile;\n    int found = 1;\n\n    \/\/ Load the old file, find the oldKey, remove it and replace with newKey\n    QFile file( oFileTmp );\n    if ( ! file.open( QIODevice::ReadOnly ) )\n        return false;\n\n    QTextStream stream( &file );\n    QString line;\n    while ( !stream.atEnd() ) {\n        line = stream.readLine(); \/\/ line of text excluding '\\n'\n\n        \/\/ Key is not found at all\n        if ( line.indexOf(oldKey, 0) == -1 ) {\n            SavedFile << line ;\n            continue;\n        }\n\n        \/\/ Found the key, but it is commented out, so don't worry about this line\n        if ( line.trimmed().indexOf(\"#\", 0) == 0 ) {\n            SavedFile << line ;\n            continue;\n        }\n\n        \/\/ If the KEY is found, and we are just on wrong occurance, save it and continue to search\n        if ( occur != -1 && found != occur ) {\n            SavedFile << line ;\n            found++;\n            continue;\n        }\n\n        \/\/ If the KEY is found in the line and this matches the occurance that must be processed\n        if ( ! newKey.isEmpty() && found == occur )\n        {\n            SavedFile << newKey ;\n            newKey.clear();\n            found++;\n            continue;\n        }\n\n        \/\/ If the KEY is found and we just want one occurance of the key\n        if ( occur == -1 && ! newKey.isEmpty() ) {\n            SavedFile << newKey ;\n            newKey.clear();\n            found++;\n            continue;\n        }\n\n    }\n\n    file.close();\n\n    \/\/ Didn't find the key? Write it!\n    if ( ! newKey.isEmpty() )\n        SavedFile << newKey;\n\n\n    \/\/ Save the new file\n    QFile fileout( oFileTmp );\n    if ( ! fileout.open( QIODevice::WriteOnly ) )\n        return false;\n\n    QTextStream streamout( &fileout );\n    for (int i = 0; i < SavedFile.size(); ++i)\n        streamout << SavedFile.at(i) << \"\\n\";\n\n    fileout.close();\n\n    \/\/Have the temporary file with new changes overwrite the original file\n    args.clear();\n    args << oFileTmp << fileName;\n    General::RunCommand(\"mv\",args);\n    return true;\n}\n\n\/\/===========================\n\/\/     SYSCTL ACCESS (might require root)\n\/\/===========================\n\/\/Retrieve a text-based sysctl\nQString General::sysctl(QString var){\n   char result[1000];\n   size_t len = sizeof(result);\n   if(0!=sysctlbyname(var.toLocal8Bit(), result, &len, NULL, 0)){ return \"\"; }\n   result[len] = '\\0';\n   \/\/qDebug() << \"Sysctl:\" << var << len << result;\n   return QString(QByteArray(result,len));\n}\n\n\/\/Retrieve a number-based sysctl\nlong long General::sysctlAsInt(QString var){\n   long long result = 0;\n   size_t len = sizeof(result);\n   if(0!=sysctlbyname(var.toLocal8Bit(), &result, &len, NULL, 0) ){ return 0; }\n   return result;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"logging_types.h\"\n\n#include \"array2d.h\"\n#include \"global_variables.h\"\n#include \"pic_utils.h\"\n\nLogParticlesAscii::LogParticlesAscii(const int i,\n             const DevMemF2 &eHLoc, const DevMemF3 &eHVel, \n             const DevMemF2 &eCLoc, const DevMemF3 &eCVel, \n             const DevMemF2 &iHLoc, const DevMemF3 &iHVel, \n             const DevMemF2 &iCLoc, const DevMemF3 &iCVel, \n             const int nEleH, const int nEleC,\n             const int nIonH, const int nIonC)\n  :LoggingBase(), m_index(i), \n   m_eleHotLoc(nEleH > 0 ? nEleH : 1), m_eleHotVel(nEleH > 0 ? nEleH : 1),\n   m_eleColdLoc(nEleC > 0 ? nEleC : 1), m_eleColdVel(nEleC > 0 ? nEleC : 1),\n   m_ionHotLoc(nIonH > 0 ? nIonH : 1), m_ionHotVel(nIonH > 0 ? nIonH : 1),\n   m_ionColdLoc(nIonC > 0 ? nIonC : 1), m_ionColdVel(nIonC > 0 ? nIonC : 1),\n   m_numEleHot(nEleH), m_numEleCold(nEleC), \n   m_numIonHot(nIonH), m_numIonCold(nIonC)\n{\n   if(m_numEleHot > 0)\n   {\n      eHLoc.copyArrayToHost(&m_eleHotLoc[0], m_numEleHot);\n      eHVel.copyArrayToHost(&m_eleHotVel[0], m_numEleHot);\n   }\n   if(m_numEleCold > 0)\n   {\n      eCLoc.copyArrayToHost(&m_eleColdLoc[0], m_numEleCold);\n      eCVel.copyArrayToHost(&m_eleColdVel[0], m_numEleCold);\n   }\n   if(m_numIonHot > 0)\n   {\n      iHLoc.copyArrayToHost(&m_ionHotLoc[0], m_numIonHot);\n      iHVel.copyArrayToHost(&m_ionHotVel[0], m_numIonHot);\n   }\n   if(m_numIonCold > 0)\n   {\n      iCLoc.copyArrayToHost(&m_ionColdLoc[0], m_numIonCold);\n      iCVel.copyArrayToHost(&m_ionColdVel[0], m_numIonCold);\n   }\n}\n\nvoid LogParticlesAscii::logParticles(const char *fileName, \n                                     const float2 hotLoc[], const float3 hotVel[],\n                                     const float2 coldLoc[], const float3 coldVel[],\n                                     const int numHot, const int numCold)\n{\n   FILE *f = fopen(fileName, \"w\");\n   for(int i = 0; i < numHot; i++)\n   {\n      fprintf(f, \"%12.3f %12.3f %12.3f %12.3f %12.3f %12.3f\\n\", \n         hotLoc[i].x, hotLoc[i].y, hotVel[i].x, hotVel[i].y, hotVel[i].z, 1.0);\n   }\n   for(int i = 0; i < numCold; i++)\n   {\n      fprintf(f, \"%12.3f %12.3f %12.3f %12.3f %12.3f %12.3f\\n\", \n         coldLoc[i].x, coldLoc[i].y, coldVel[i].x, coldVel[i].y, coldVel[i].z, 0.0);\n   }\n   fclose(f);\n}\n\nvoid LogParticlesAscii::logData()\n{\n   char name[100];\n   assert(m_index < 1000000);\n\n   sprintf(name,\"%s\/%s_%04d\",outputDir.c_str(), \"ele_\", m_index);\n   logParticles(name, &m_eleHotLoc[0], &m_eleHotVel[0], &m_eleColdLoc[0], &m_eleColdVel[0], \n      m_numEleHot, m_numEleCold);\n   sprintf(name,\"%s\/%s_%04d\",outputDir.c_str(), \"ion_\", m_index);\n   logParticles(name, &m_ionHotLoc[0], &m_ionHotVel[0], &m_ionColdLoc[0], &m_ionColdVel[0], \n      m_numIonHot, m_numIonCold);\n}\n\nvoid LogRhoAscii::logData()\n{\n    out2dr(\"rhoi\",m_index,NY,NX1,*m_rhoi, true);\n    out2dr(\"rhoe\",m_index,NY,NX1,*m_rhoe, true);\n    out2dr(\"rho_\",m_index,NY,NX1,*m_rho, true);\n}\n\nvoid LogPhiAscii::logData()\n{\n    out2dr(\"phi_\",m_index,NY,NX1,*m_phi, true);\n}\n\nLogParticlesBinary::LogParticlesBinary(const int i,\n             const DevMemF2 &eHLoc, const DevMemF3 &eHVel, \n             const DevMemF2 &eCLoc, const DevMemF3 &eCVel, \n             const DevMemF2 &iHLoc, const DevMemF3 &iHVel, \n             const DevMemF2 &iCLoc, const DevMemF3 &iCVel, \n             const int nEleH, const int nEleC,\n             const int nIonH, const int nIonC)\n  :LoggingBase(), m_index(i), \n   m_eleHotLoc(nEleH > 0 ? nEleH : 1), m_eleHotVel(nEleH > 0 ? nEleH : 1),\n   m_eleColdLoc(nEleC > 0 ? nEleC : 1), m_eleColdVel(nEleC > 0 ? nEleC : 1),\n   m_ionHotLoc(nIonH > 0 ? nIonH : 1), m_ionHotVel(nIonH > 0 ? nIonH : 1),\n   m_ionColdLoc(nIonC > 0 ? nIonC : 1), m_ionColdVel(nIonC > 0 ? nIonC : 1),\n   m_numEleHot(nEleH), m_numEleCold(nEleC), \n   m_numIonHot(nIonH), m_numIonCold(nIonC)\n{\n   if(m_numEleHot > 0)\n   {\n      eHLoc.copyArrayToHost(&m_eleHotLoc[0], m_numEleHot);\n      eHVel.copyArrayToHost(&m_eleHotVel[0], m_numEleHot);\n   }\n   if(m_numEleCold > 0)\n   {\n      eCLoc.copyArrayToHost(&m_eleColdLoc[0], m_numEleCold);\n      eCVel.copyArrayToHost(&m_eleColdVel[0], m_numEleCold);\n   }\n   if(m_numIonHot > 0)\n   {\n      iHLoc.copyArrayToHost(&m_ionHotLoc[0], m_numIonHot);\n      iHVel.copyArrayToHost(&m_ionHotVel[0], m_numIonHot);\n   }\n   if(m_numIonCold > 0)\n   {\n      iCLoc.copyArrayToHost(&m_ionColdLoc[0], m_numIonCold);\n      iCVel.copyArrayToHost(&m_ionColdVel[0], m_numIonCold);\n   }\n}\n\nvoid LogParticlesBinary::logParticles(const char *fileName, \n                                      const float2 hotLoc[], const float3 hotVel[],\n                                      const float2 coldLoc[], const float3 coldVel[],\n                                      const int numHot, const int numCold)\n{\n   FILE *f = fopen(fileName, \"wb\");\n   int numPart = numHot + numCold;\n   const float hot = 1.0;\n   const float cold = 0.0;\n\n   fwrite(&numPart, sizeof(int), 1, f);\n   for(int i = 0; i < numHot; i++)\n   {\n      fwrite(hotLoc + i, sizeof(float2), 1, f);\n      fwrite(hotVel + i, sizeof(float3), 1, f);\n      fwrite(&hot, sizeof(float), 1, f);\n   }\n   for(int i = 0; i < numCold; i++)\n   {\n      fwrite(coldLoc + i, sizeof(float2), 1, f);\n      fwrite(coldVel + i, sizeof(float3), 1, f);\n      fwrite(&cold, sizeof(float), 1, f);\n   }\n   fclose(f);\n}\n\nvoid LogParticlesBinary::logData()\n{\n   char name[100];\n   assert(m_index < 1000000);\n\n   sprintf(name,\"%s\/%s_%04d\",outputDir.c_str(), \"ele_\", m_index);\n   logParticles(name, &m_eleHotLoc[0], &m_eleHotVel[0], &m_eleColdLoc[0], &m_eleColdVel[0], \n      m_numEleHot, m_numEleCold);\n}\n\nvoid LogRhoBinary::logData()\n{\n    out2drBin(\"rhoi\",m_index,NY,NX1,*m_rhoi, true);\n    out2drBin(\"rhoe\",m_index,NY,NX1,*m_rhoe, true);\n    out2drBin(\"rho_\",m_index,NY,NX1,*m_rho, true);\n}\n\nvoid LogPhiBinary::logData()\n{\n    out2drBin(\"phi_\",m_index,NY,NX1,*m_phi, true);\n}\n\nvoid LogInfo::logData()\n{\n   outinfo(\"info\", index, simTime, numElectrons, numIons);\n}\n\nvoid LogForPerformance::logData()\n{\n   std::string fname = outputDir + \"\/performance.csv\";\n   std::string keyFname = outputDir + \"\/performance_key.csv\";\n   FILE *fp;\n\n   if(first)\n   {\n      first = false;\n      fp = fopen(keyFname.c_str(), \"w\");\n      fprintf(fp, \"Iteration Number,Sim Time,Num Electrons Hot,\"\n              \"NumElectrons Cold,Num Ions Hot,Num IonsCold,\"\n              \"Iteration Time (ms)\");\n      fclose(fp);\n      fp = fopen(fname.c_str(), \"w\");\n   }\n   else\n   {\n      fp = fopen(fname.c_str(), \"a\");\n   }\n   fprintf(fp, \"%u,%f,%u,%u,%u,%u,%u,%u,%u,%u,%u,%u\\n\", iteration, simTime, numEleHot,\n      numEleCold, numIonHot, numIonCold, iterTimeInMs, injectTimeInMs, densTimeInMs,\n      potent2TimeInMs, fieldTimeInMs, movepTimeInMs);\n   fclose(fp);\n}\n\n<commit_msg>Fixed a bug where ion data was not being logged.<commit_after>#include \"logging_types.h\"\n\n#include \"array2d.h\"\n#include \"global_variables.h\"\n#include \"pic_utils.h\"\n\nLogParticlesAscii::LogParticlesAscii(const int i,\n             const DevMemF2 &eHLoc, const DevMemF3 &eHVel, \n             const DevMemF2 &eCLoc, const DevMemF3 &eCVel, \n             const DevMemF2 &iHLoc, const DevMemF3 &iHVel, \n             const DevMemF2 &iCLoc, const DevMemF3 &iCVel, \n             const int nEleH, const int nEleC,\n             const int nIonH, const int nIonC)\n  :LoggingBase(), m_index(i), \n   m_eleHotLoc(nEleH > 0 ? nEleH : 1), m_eleHotVel(nEleH > 0 ? nEleH : 1),\n   m_eleColdLoc(nEleC > 0 ? nEleC : 1), m_eleColdVel(nEleC > 0 ? nEleC : 1),\n   m_ionHotLoc(nIonH > 0 ? nIonH : 1), m_ionHotVel(nIonH > 0 ? nIonH : 1),\n   m_ionColdLoc(nIonC > 0 ? nIonC : 1), m_ionColdVel(nIonC > 0 ? nIonC : 1),\n   m_numEleHot(nEleH), m_numEleCold(nEleC), \n   m_numIonHot(nIonH), m_numIonCold(nIonC)\n{\n   if(m_numEleHot > 0)\n   {\n      eHLoc.copyArrayToHost(&m_eleHotLoc[0], m_numEleHot);\n      eHVel.copyArrayToHost(&m_eleHotVel[0], m_numEleHot);\n   }\n   if(m_numEleCold > 0)\n   {\n      eCLoc.copyArrayToHost(&m_eleColdLoc[0], m_numEleCold);\n      eCVel.copyArrayToHost(&m_eleColdVel[0], m_numEleCold);\n   }\n   if(m_numIonHot > 0)\n   {\n      iHLoc.copyArrayToHost(&m_ionHotLoc[0], m_numIonHot);\n      iHVel.copyArrayToHost(&m_ionHotVel[0], m_numIonHot);\n   }\n   if(m_numIonCold > 0)\n   {\n      iCLoc.copyArrayToHost(&m_ionColdLoc[0], m_numIonCold);\n      iCVel.copyArrayToHost(&m_ionColdVel[0], m_numIonCold);\n   }\n}\n\nvoid LogParticlesAscii::logParticles(const char *fileName, \n                                     const float2 hotLoc[], const float3 hotVel[],\n                                     const float2 coldLoc[], const float3 coldVel[],\n                                     const int numHot, const int numCold)\n{\n   FILE *f = fopen(fileName, \"w\");\n   for(int i = 0; i < numHot; i++)\n   {\n      fprintf(f, \"%12.3f %12.3f %12.3f %12.3f %12.3f %12.3f\\n\", \n         hotLoc[i].x, hotLoc[i].y, hotVel[i].x, hotVel[i].y, hotVel[i].z, 1.0);\n   }\n   for(int i = 0; i < numCold; i++)\n   {\n      fprintf(f, \"%12.3f %12.3f %12.3f %12.3f %12.3f %12.3f\\n\", \n         coldLoc[i].x, coldLoc[i].y, coldVel[i].x, coldVel[i].y, coldVel[i].z, 0.0);\n   }\n   fclose(f);\n}\n\nvoid LogParticlesAscii::logData()\n{\n   char name[100];\n   assert(m_index < 1000000);\n\n   sprintf(name,\"%s\/%s_%04d\",outputDir.c_str(), \"ele_\", m_index);\n   logParticles(name, &m_eleHotLoc[0], &m_eleHotVel[0], &m_eleColdLoc[0], &m_eleColdVel[0], \n      m_numEleHot, m_numEleCold);\n   sprintf(name,\"%s\/%s_%04d\",outputDir.c_str(), \"ion_\", m_index);\n   logParticles(name, &m_ionHotLoc[0], &m_ionHotVel[0], &m_ionColdLoc[0], &m_ionColdVel[0], \n      m_numIonHot, m_numIonCold);\n}\n\nvoid LogRhoAscii::logData()\n{\n    out2dr(\"rhoi\",m_index,NY,NX1,*m_rhoi, true);\n    out2dr(\"rhoe\",m_index,NY,NX1,*m_rhoe, true);\n    out2dr(\"rho_\",m_index,NY,NX1,*m_rho, true);\n}\n\nvoid LogPhiAscii::logData()\n{\n    out2dr(\"phi_\",m_index,NY,NX1,*m_phi, true);\n}\n\nLogParticlesBinary::LogParticlesBinary(const int i,\n             const DevMemF2 &eHLoc, const DevMemF3 &eHVel, \n             const DevMemF2 &eCLoc, const DevMemF3 &eCVel, \n             const DevMemF2 &iHLoc, const DevMemF3 &iHVel, \n             const DevMemF2 &iCLoc, const DevMemF3 &iCVel, \n             const int nEleH, const int nEleC,\n             const int nIonH, const int nIonC)\n  :LoggingBase(), m_index(i), \n   m_eleHotLoc(nEleH > 0 ? nEleH : 1), m_eleHotVel(nEleH > 0 ? nEleH : 1),\n   m_eleColdLoc(nEleC > 0 ? nEleC : 1), m_eleColdVel(nEleC > 0 ? nEleC : 1),\n   m_ionHotLoc(nIonH > 0 ? nIonH : 1), m_ionHotVel(nIonH > 0 ? nIonH : 1),\n   m_ionColdLoc(nIonC > 0 ? nIonC : 1), m_ionColdVel(nIonC > 0 ? nIonC : 1),\n   m_numEleHot(nEleH), m_numEleCold(nEleC), \n   m_numIonHot(nIonH), m_numIonCold(nIonC)\n{\n   if(m_numEleHot > 0)\n   {\n      eHLoc.copyArrayToHost(&m_eleHotLoc[0], m_numEleHot);\n      eHVel.copyArrayToHost(&m_eleHotVel[0], m_numEleHot);\n   }\n   if(m_numEleCold > 0)\n   {\n      eCLoc.copyArrayToHost(&m_eleColdLoc[0], m_numEleCold);\n      eCVel.copyArrayToHost(&m_eleColdVel[0], m_numEleCold);\n   }\n   if(m_numIonHot > 0)\n   {\n      iHLoc.copyArrayToHost(&m_ionHotLoc[0], m_numIonHot);\n      iHVel.copyArrayToHost(&m_ionHotVel[0], m_numIonHot);\n   }\n   if(m_numIonCold > 0)\n   {\n      iCLoc.copyArrayToHost(&m_ionColdLoc[0], m_numIonCold);\n      iCVel.copyArrayToHost(&m_ionColdVel[0], m_numIonCold);\n   }\n}\n\nvoid LogParticlesBinary::logParticles(const char *fileName, \n                                      const float2 hotLoc[], const float3 hotVel[],\n                                      const float2 coldLoc[], const float3 coldVel[],\n                                      const int numHot, const int numCold)\n{\n   FILE *f = fopen(fileName, \"wb\");\n   int numPart = numHot + numCold;\n   const float hot = 1.0;\n   const float cold = 0.0;\n\n   fwrite(&numPart, sizeof(int), 1, f);\n   for(int i = 0; i < numHot; i++)\n   {\n      fwrite(hotLoc + i, sizeof(float2), 1, f);\n      fwrite(hotVel + i, sizeof(float3), 1, f);\n      fwrite(&hot, sizeof(float), 1, f);\n   }\n   for(int i = 0; i < numCold; i++)\n   {\n      fwrite(coldLoc + i, sizeof(float2), 1, f);\n      fwrite(coldVel + i, sizeof(float3), 1, f);\n      fwrite(&cold, sizeof(float), 1, f);\n   }\n   fclose(f);\n}\n\nvoid LogParticlesBinary::logData()\n{\n   char name[100];\n   assert(m_index < 1000000);\n\n   sprintf(name,\"%s\/%s_%04d\",outputDir.c_str(), \"ele_\", m_index);\n   logParticles(name, &m_eleHotLoc[0], &m_eleHotVel[0], &m_eleColdLoc[0], &m_eleColdVel[0], \n      m_numEleHot, m_numEleCold);\n   sprintf(name,\"%s\/%s_%04d\",outputDir.c_str(), \"ion_\", m_index);\n   logParticles(name, &m_ionHotLoc[0], &m_ionHotVel[0], &m_ionColdLoc[0], &m_ionColdVel[0], \n      m_numIonHot, m_numIonCold);\n}\n\nvoid LogRhoBinary::logData()\n{\n    out2drBin(\"rhoi\",m_index,NY,NX1,*m_rhoi, true);\n    out2drBin(\"rhoe\",m_index,NY,NX1,*m_rhoe, true);\n    out2drBin(\"rho_\",m_index,NY,NX1,*m_rho, true);\n}\n\nvoid LogPhiBinary::logData()\n{\n    out2drBin(\"phi_\",m_index,NY,NX1,*m_phi, true);\n}\n\nvoid LogInfo::logData()\n{\n   outinfo(\"info\", index, simTime, numElectrons, numIons);\n}\n\nvoid LogForPerformance::logData()\n{\n   std::string fname = outputDir + \"\/performance.csv\";\n   std::string keyFname = outputDir + \"\/performance_key.csv\";\n   FILE *fp;\n\n   if(first)\n   {\n      first = false;\n      fp = fopen(keyFname.c_str(), \"w\");\n      fprintf(fp, \"Iteration Number,Sim Time,Num Electrons Hot,\"\n              \"NumElectrons Cold,Num Ions Hot,Num IonsCold,\"\n              \"Iteration Time (ms)\");\n      fclose(fp);\n      fp = fopen(fname.c_str(), \"w\");\n   }\n   else\n   {\n      fp = fopen(fname.c_str(), \"a\");\n   }\n   fprintf(fp, \"%u,%f,%u,%u,%u,%u,%u,%u,%u,%u,%u,%u\\n\", iteration, simTime, numEleHot,\n      numEleCold, numIonHot, numIonCold, iterTimeInMs, injectTimeInMs, densTimeInMs,\n      potent2TimeInMs, fieldTimeInMs, movepTimeInMs);\n   fclose(fp);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"game_window.h\"\n#include \"chat.h\"\n\nChat::Chat(GameWindow& owner) :\n\towner(owner),\n\tsize(owner.ancho_pantalla \/ 3, owner.alto_pantalla \/ 3),\n\toffset(0, 0),\n\tmaxMessages(5)\n{\n\ttyping = false;\n}\n\nChat::~Chat() {\n\tmessages.clear();\n}\n\nvoid Chat::draw(SDL_Renderer* renderer, std::string inputText) {\n\t\/\/Dibujo fondo\n\tSDL_Rect destinoFondoChat = { (int)offset.x, (int)offset.y, (int)size.x, (int)size.y };\n\tSDL_SetRenderDrawColor(renderer, 15, 15, 15, 255);\n\tSDL_RenderFillRect(renderer, &destinoFondoChat);\n\n\t\/\/Me quedo con los ultimos mensajes\n\twhile (messages.size() > maxMessages)\n\t\tmessages.erase(messages.begin());\n\n\t\/\/Mensajes anteriores\n\tstd::string textMessages = \"\";\n\tSDL_Color colorBlanco = { 255, 255, 255 };\n\tif (owner.font) {\n\t\tfor (int i = 0; i < maxMessages; i++) {\n\t\t\tif (messages.size() > i) {\n\t\t\t\ttextMessages = textMessages + owner.completeLine(messages[i], size.x);\n\t\t\t}\n\t\t}\n\t}\n\tint access, w, h;\n\tUint32 format;\n\tSDL_Surface * surface = TTF_RenderText_Blended_Wrapped(owner.font, textMessages.c_str(), colorBlanco, (Uint32)size.x);\n\tSDL_Texture * textureChat = SDL_CreateTextureFromSurface(renderer, surface);\n\tSDL_QueryTexture(textureChat, &format, &access, &w, &h);\n\tSDL_Rect panel = { 0, 0, w , h };\n\tSDL_Rect text = { (int)offset.x, (int)offset.y,\n\t\t(int)((w>size.x) ? size.x : w), (int)((h>(maxMessages * size.y \/ (maxMessages + 1))) ? (maxMessages * size.y \/ (maxMessages + 1)) : h) };\n\tSDL_RenderCopy(renderer, textureChat, &panel, &text);\n\tSDL_FreeSurface(surface);\n\tSDL_DestroyTexture(textureChat);\n\n\tif (typing) {\n\t\t\/\/Recuadro\n\t\tSDL_SetRenderDrawColor(renderer, 255, 255, 255, 255);\n\t\tSDL_Point points[] = {\n\t\t\t{ (int)offset.x, (int)(offset.y + maxMessages * size.y \/ (maxMessages + 1)) },\n\t\t\t{ (int)(offset.x + size.x),(int)(offset.y + maxMessages * size.y \/ (maxMessages + 1)) },\n\t\t\t{ (int)(offset.x + size.x) , (int)(offset.y + size.y) },\n\t\t\t{ (int)offset.x,(int)(offset.y + size.y) },\n\t\t\t{ (int)offset.x, (int)(offset.y + maxMessages * size.y \/ (maxMessages + 1)) } };\n\t\tSDL_RenderDrawLines(renderer, points, 5);\n\n\t\t\/\/Nuevo mensaje\n\t\tstd::string inputMessage;\n\t\tif (inputText != \"\")inputMessage = owner.completeLine(inputText, size.x);\n\t\tint inputAccess, inputW, inputH;\n\t\tUint32 inputFormat;\n\t\tSDL_Surface * inputSurface = TTF_RenderText_Blended_Wrapped(owner.font, inputMessage.c_str(), colorBlanco, (Uint32)size.x);\n\t\tSDL_Texture * inputTexture = SDL_CreateTextureFromSurface(renderer, inputSurface);\n\t\tSDL_QueryTexture(inputTexture, &inputFormat, &inputAccess, &inputW, &inputH);\n\t\tSDL_Rect inputPanel = { 0, 0, inputW , inputH };\n\t\tSDL_Rect inputTextRect = { (int)(offset.x), (int)(offset.y + maxMessages * size.y \/ (maxMessages + 1)),\n\t\t\t(int)((inputW>size.x) ? size.x : inputW), (int)((inputH>size.y \/ (maxMessages + 1)) ? size.y \/ (maxMessages + 1) : inputH) };\n\t\tSDL_RenderCopy(renderer, inputTexture, &inputPanel, &inputTextRect);\n\t\tSDL_FreeSurface(inputSurface);\n\t\tSDL_DestroyTexture(inputTexture);\n\t}\n}\n\t\t<commit_msg>Dejo fondo transparente en el chat<commit_after>#include \"game_window.h\"\n#include \"chat.h\"\n\nChat::Chat(GameWindow& owner) :\n\towner(owner),\n\tsize(owner.ancho_pantalla \/ 3, owner.alto_pantalla \/ 3),\n\toffset(0, 0),\n\tmaxMessages(5)\n{\n\ttyping = false;\n}\n\nChat::~Chat() {\n\tmessages.clear();\n}\n\nvoid Chat::draw(SDL_Renderer* renderer, std::string inputText) {\n\t\/\/\/\/Dibujo fondo Descomentar para tener fondo negro en el chat\n\t\/\/SDL_Rect destinoFondoChat = { (int)offset.x, (int)offset.y, (int)size.x, (int)size.y };\n\t\/\/SDL_SetRenderDrawColor(renderer, 15, 15, 15, 255);\n\t\/\/SDL_RenderFillRect(renderer, &destinoFondoChat);\n\n\t\/\/Me quedo con los ultimos mensajes\n\twhile (messages.size() > maxMessages)\n\t\tmessages.erase(messages.begin());\n\n\t\/\/Mensajes anteriores\n\tstd::string textMessages = \"\";\n\tSDL_Color colorBlanco = { 255, 255, 255 };\n\tif (owner.font) {\n\t\tfor (int i = 0; i < maxMessages; i++) {\n\t\t\tif (messages.size() > i) {\n\t\t\t\ttextMessages = textMessages + owner.completeLine(messages[i], size.x);\n\t\t\t}\n\t\t}\n\t}\n\tint access, w, h;\n\tUint32 format;\n\tSDL_Surface * surface = TTF_RenderText_Blended_Wrapped(owner.font, textMessages.c_str(), colorBlanco, (Uint32)size.x);\n\tSDL_Texture * textureChat = SDL_CreateTextureFromSurface(renderer, surface);\n\tSDL_QueryTexture(textureChat, &format, &access, &w, &h);\n\tSDL_Rect panel = { 0, 0, w , h };\n\tSDL_Rect text = { (int)offset.x, (int)offset.y,\n\t\t(int)((w>size.x) ? size.x : w), (int)((h>(maxMessages * size.y \/ (maxMessages + 1))) ? (maxMessages * size.y \/ (maxMessages + 1)) : h) };\n\tSDL_RenderCopy(renderer, textureChat, &panel, &text);\n\tSDL_FreeSurface(surface);\n\tSDL_DestroyTexture(textureChat);\n\n\tif (typing) {\n\t\t\/\/Recuadro\n\t\tSDL_SetRenderDrawColor(renderer, 255, 255, 255, 255);\n\t\tSDL_Point points[] = {\n\t\t\t{ (int)offset.x, (int)(offset.y + maxMessages * size.y \/ (maxMessages + 1)) },\n\t\t\t{ (int)(offset.x + size.x),(int)(offset.y + maxMessages * size.y \/ (maxMessages + 1)) },\n\t\t\t{ (int)(offset.x + size.x) , (int)(offset.y + size.y) },\n\t\t\t{ (int)offset.x,(int)(offset.y + size.y) },\n\t\t\t{ (int)offset.x, (int)(offset.y + maxMessages * size.y \/ (maxMessages + 1)) } };\n\t\tSDL_RenderDrawLines(renderer, points, 5);\n\n\t\t\/\/Nuevo mensaje\n\t\tstd::string inputMessage;\n\t\tif (inputText != \"\")inputMessage = owner.completeLine(inputText, size.x);\n\t\tint inputAccess, inputW, inputH;\n\t\tUint32 inputFormat;\n\t\tSDL_Surface * inputSurface = TTF_RenderText_Blended_Wrapped(owner.font, inputMessage.c_str(), colorBlanco, (Uint32)size.x);\n\t\tSDL_Texture * inputTexture = SDL_CreateTextureFromSurface(renderer, inputSurface);\n\t\tSDL_QueryTexture(inputTexture, &inputFormat, &inputAccess, &inputW, &inputH);\n\t\tSDL_Rect inputPanel = { 0, 0, inputW , inputH };\n\t\tSDL_Rect inputTextRect = { (int)(offset.x), (int)(offset.y + maxMessages * size.y \/ (maxMessages + 1)),\n\t\t\t(int)((inputW>size.x) ? size.x : inputW), (int)((inputH>size.y \/ (maxMessages + 1)) ? size.y \/ (maxMessages + 1) : inputH) };\n\t\tSDL_RenderCopy(renderer, inputTexture, &inputPanel, &inputTextRect);\n\t\tSDL_FreeSurface(inputSurface);\n\t\tSDL_DestroyTexture(inputTexture);\n\t}\n}\n\t\t<|endoftext|>"}
{"text":"<commit_before>\/*\n * original Glib::Dispatcher example -- cross thread signalling\n * by Daniel Elstner  <daniel.elstner@gmx.net>\n *\n * Modified by Stephan Puchegger <stephan.puchegger@ap.univie.ac.at>\n * to contain 2 mainloops in 2 different threads, that communicate\n * via cross thread signalling in both directions. The timer thread\n * sends the UI thread a cross thread signal every second, which in turn\n * updates the label stating how many seconds have passed since the start\n * of the program.\n *\n * Modified by J. Abelardo Gutierrez <jabelardo@cantv.net>\n * to cast all gtkmm out and make it glibmm only\n *\n * Note:  This example is special stuff that's seldomly needed by the\n * vast majority of applications.  Don't bother working out what this\n * code does unless you know for sure you need 2 main loops running in\n * 2 distinct main contexts.\n *\n * Copyright (c) 2002-2003  Free Software Foundation\n *\/\n\n#include <condition_variable>\n#include <glibmm.h>\n#include <iostream>\n#include <mutex>\n#include <sstream>\n#include <thread>\n\nnamespace\n{\nGlib::RefPtr<Glib::MainLoop> main_loop;\n\nclass ThreadTimer : public sigc::trackable\n{\npublic:\n  ThreadTimer();\n  ~ThreadTimer();\n\n  void launch();\n  void signal_finished_emit();\n  void print() const;\n\n  using type_signal_end = sigc::signal<void()>;\n  static type_signal_end& signal_end();\n\nprivate:\n  unsigned int time_;\n  Glib::Dispatcher signal_increment_;\n  Glib::Dispatcher* signal_finished_ptr_;\n\n  std::mutex startup_mutex_;\n  std::condition_variable startup_cond_;\n  std::thread* thread_;\n\n  static type_signal_end signal_end_;\n\n  void timer_increment();\n  bool timeout_handler();\n  static void finished_handler(Glib::RefPtr<Glib::MainLoop> mainloop);\n  void thread_function();\n};\n\nclass ThreadDispatcher : public sigc::trackable\n{\npublic:\n  ThreadDispatcher();\n\n  void launch_thread();\n  void end();\n\nprivate:\n  ThreadTimer* timer_;\n};\n\nThreadTimer::ThreadTimer()\n: time_(0),\n  \/\/ Create a new Glib::Dispatcher that is attached to the default main context,\n  signal_increment_(),\n  \/\/ This pointer will be initialized later by the 2nd thread.\n  signal_finished_ptr_(nullptr),\n  thread_(nullptr)\n{\n  \/\/ Connect the cross-thread signal.\n  signal_increment_.connect(sigc::mem_fun(*this, &ThreadTimer::timer_increment));\n}\n\nThreadTimer::~ThreadTimer()\n{\n}\n\nvoid\nThreadTimer::launch()\n{\n  \/\/ Unfortunately, the thread creation has to be fully synchronized in\n  \/\/ order to access the Glib::Dispatcher object instantiated by the 2nd thread.\n  \/\/ So, let's do some kind of hand-shake using a mutex and a condition\n  \/\/ variable.\n  std::unique_lock<std::mutex> lock(startup_mutex_);\n\n  \/\/ Create a joinable thread -- it needs to be joined, otherwise its destructor will block.\n  thread_ = new std::thread([this]() { thread_function(); });\n\n  \/\/ Wait for the 2nd thread's startup notification.\n  startup_cond_.wait(lock, [this]() -> bool { return signal_finished_ptr_; });\n}\n\nvoid\nThreadTimer::signal_finished_emit()\n{\n  \/\/ Cause the 2nd thread's main loop to quit.\n  signal_finished_ptr_->emit();\n\n  \/\/ wait for the thread to join\n  if (thread_)\n  {\n    thread_->join();\n    delete thread_;\n    thread_ = nullptr;\n  }\n\n  signal_finished_ptr_ = nullptr;\n}\n\nvoid\nThreadTimer::print() const\n{\n  std::cout << time_ << \" seconds since start\" << std::endl;\n}\n\nsigc::signal<void()>&\nThreadTimer::signal_end()\n{\n  return signal_end_;\n}\n\nvoid\nThreadTimer::timer_increment()\n{\n  \/\/ another second has passed since the start of the program\n  ++time_;\n  print();\n\n  if (time_ >= 10)\n    signal_finished_emit();\n}\n\n\/\/ static\nvoid\nThreadTimer::finished_handler(Glib::RefPtr<Glib::MainLoop> mainloop)\n{\n  \/\/ quit the timer thread mainloop\n  mainloop->quit();\n  std::cout << \"timer thread mainloop finished\" << std::endl;\n  ThreadTimer::signal_end().emit();\n}\n\nbool\nThreadTimer::timeout_handler()\n{\n  \/\/ inform the printing thread that another second has passed\n  signal_increment_();\n\n  \/\/ this timer should stay alive\n  return true;\n}\n\nvoid\nThreadTimer::thread_function()\n{\n  \/\/ create a new Main Context\n  auto context = Glib::MainContext::create();\n  \/\/ create a new Main Loop\n  auto mainloop = Glib::MainLoop::create(context, true);\n\n  \/\/ attach a timeout handler, that is called every second, to the\n  \/\/ newly created MainContext\n  context->signal_timeout().connect(sigc::mem_fun(*this, &ThreadTimer::timeout_handler), 1000);\n\n  \/\/ We need to lock while creating the Glib::Dispatcher instance,\n  \/\/ in order to ensure memory visibility.\n  std::unique_lock<std::mutex> lock(startup_mutex_);\n\n  \/\/ create a new dispatcher, that is connected to the newly\n  \/\/ created MainContext\n  Glib::Dispatcher signal_finished(context);\n\n  signal_finished.connect(sigc::bind(sigc::ptr_fun(&ThreadTimer::finished_handler), mainloop));\n\n  signal_finished_ptr_ = &signal_finished;\n\n  \/\/ Tell the launcher thread that everything is in place now.\n  \/\/ We unlock before notifying, because that is what the documentation suggests:\n  \/\/ http:\/\/en.cppreference.com\/w\/cpp\/thread\/condition_variable\n  lock.unlock();\n  startup_cond_.notify_one();\n\n  \/\/ start the mainloop\n  mainloop->run();\n}\n\n\/\/ initialize static member:\nThreadTimer::type_signal_end ThreadTimer::signal_end_;\n\nThreadDispatcher::ThreadDispatcher() : timer_(nullptr)\n{\n  std::cout << \"Thread Dispatcher Example #2\" << std::endl;\n\n  timer_ = new ThreadTimer();\n  timer_->signal_end().connect(sigc::mem_fun(*this, &ThreadDispatcher::end));\n  timer_->print();\n}\n\nvoid\nThreadDispatcher::launch_thread()\n{\n  \/\/ launch the timer thread\n  timer_->launch();\n}\n\nvoid\nThreadDispatcher::end()\n{\n  \/\/ quit the main mainloop\n  main_loop->quit();\n}\n\n} \/\/ anonymous namespace\n\nint\nmain(int, char**)\n{\n  Glib::init();\n  main_loop = Glib::MainLoop::create();\n\n  ThreadDispatcher dispatcher;\n\n  \/\/ Install a one-shot idle handler to launch the threads\n  Glib::signal_idle().connect_once(sigc::mem_fun(dispatcher, &ThreadDispatcher::launch_thread));\n\n  main_loop->run();\n\n  return 0;\n}\n<commit_msg>Examples: Avoid a warning about unused code.<commit_after>\/*\n * original Glib::Dispatcher example -- cross thread signalling\n * by Daniel Elstner  <daniel.elstner@gmx.net>\n *\n * Modified by Stephan Puchegger <stephan.puchegger@ap.univie.ac.at>\n * to contain 2 mainloops in 2 different threads, that communicate\n * via cross thread signalling in both directions. The timer thread\n * sends the UI thread a cross thread signal every second, which in turn\n * updates the label stating how many seconds have passed since the start\n * of the program.\n *\n * Modified by J. Abelardo Gutierrez <jabelardo@cantv.net>\n * to cast all gtkmm out and make it glibmm only\n *\n * Note:  This example is special stuff that's seldomly needed by the\n * vast majority of applications.  Don't bother working out what this\n * code does unless you know for sure you need 2 main loops running in\n * 2 distinct main contexts.\n *\n * Copyright (c) 2002-2003  Free Software Foundation\n *\/\n\n#include <condition_variable>\n#include <glibmm.h>\n#include <iostream>\n#include <mutex>\n#include <sstream>\n#include <thread>\n\nnamespace\n{\nGlib::RefPtr<Glib::MainLoop> main_loop;\n\nclass ThreadTimer : public sigc::trackable\n{\npublic:\n  ThreadTimer();\n  ~ThreadTimer();\n\n  void launch();\n  void signal_finished_emit();\n  void print() const;\n\n  using type_signal_end = sigc::signal<void()>;\n  static type_signal_end& signal_end();\n\nprivate:\n  unsigned int time_;\n  Glib::Dispatcher signal_increment_;\n  Glib::Dispatcher* signal_finished_ptr_;\n\n  std::mutex startup_mutex_;\n  std::condition_variable startup_cond_;\n  std::thread* thread_;\n\n  static type_signal_end signal_end_;\n\n  void timer_increment();\n  bool timeout_handler();\n  static void finished_handler(Glib::RefPtr<Glib::MainLoop> mainloop);\n  void thread_function();\n};\n\nclass ThreadDispatcher : public sigc::trackable\n{\npublic:\n  ThreadDispatcher();\n\n  void launch_thread();\n  void end();\n\nprivate:\n  ThreadTimer* timer_;\n};\n\nThreadTimer::ThreadTimer()\n: time_(0),\n  \/\/ Create a new Glib::Dispatcher that is attached to the default main context,\n  signal_increment_(),\n  \/\/ This pointer will be initialized later by the 2nd thread.\n  signal_finished_ptr_(nullptr),\n  thread_(nullptr)\n{\n  \/\/ Connect the cross-thread signal.\n  signal_increment_.connect(sigc::mem_fun(*this, &ThreadTimer::timer_increment));\n}\n\nvoid\nThreadTimer::launch()\n{\n  \/\/ Unfortunately, the thread creation has to be fully synchronized in\n  \/\/ order to access the Glib::Dispatcher object instantiated by the 2nd thread.\n  \/\/ So, let's do some kind of hand-shake using a mutex and a condition\n  \/\/ variable.\n  std::unique_lock<std::mutex> lock(startup_mutex_);\n\n  \/\/ Create a joinable thread -- it needs to be joined, otherwise its destructor will block.\n  thread_ = new std::thread([this]() { thread_function(); });\n\n  \/\/ Wait for the 2nd thread's startup notification.\n  startup_cond_.wait(lock, [this]() -> bool { return signal_finished_ptr_; });\n}\n\nvoid\nThreadTimer::signal_finished_emit()\n{\n  \/\/ Cause the 2nd thread's main loop to quit.\n  signal_finished_ptr_->emit();\n\n  \/\/ wait for the thread to join\n  if (thread_)\n  {\n    thread_->join();\n    delete thread_;\n    thread_ = nullptr;\n  }\n\n  signal_finished_ptr_ = nullptr;\n}\n\nvoid\nThreadTimer::print() const\n{\n  std::cout << time_ << \" seconds since start\" << std::endl;\n}\n\nsigc::signal<void()>&\nThreadTimer::signal_end()\n{\n  return signal_end_;\n}\n\nvoid\nThreadTimer::timer_increment()\n{\n  \/\/ another second has passed since the start of the program\n  ++time_;\n  print();\n\n  if (time_ >= 10)\n    signal_finished_emit();\n}\n\n\/\/ static\nvoid\nThreadTimer::finished_handler(Glib::RefPtr<Glib::MainLoop> mainloop)\n{\n  \/\/ quit the timer thread mainloop\n  mainloop->quit();\n  std::cout << \"timer thread mainloop finished\" << std::endl;\n  ThreadTimer::signal_end().emit();\n}\n\nbool\nThreadTimer::timeout_handler()\n{\n  \/\/ inform the printing thread that another second has passed\n  signal_increment_();\n\n  \/\/ this timer should stay alive\n  return true;\n}\n\nvoid\nThreadTimer::thread_function()\n{\n  \/\/ create a new Main Context\n  auto context = Glib::MainContext::create();\n  \/\/ create a new Main Loop\n  auto mainloop = Glib::MainLoop::create(context, true);\n\n  \/\/ attach a timeout handler, that is called every second, to the\n  \/\/ newly created MainContext\n  context->signal_timeout().connect(sigc::mem_fun(*this, &ThreadTimer::timeout_handler), 1000);\n\n  \/\/ We need to lock while creating the Glib::Dispatcher instance,\n  \/\/ in order to ensure memory visibility.\n  std::unique_lock<std::mutex> lock(startup_mutex_);\n\n  \/\/ create a new dispatcher, that is connected to the newly\n  \/\/ created MainContext\n  Glib::Dispatcher signal_finished(context);\n\n  signal_finished.connect(sigc::bind(sigc::ptr_fun(&ThreadTimer::finished_handler), mainloop));\n\n  signal_finished_ptr_ = &signal_finished;\n\n  \/\/ Tell the launcher thread that everything is in place now.\n  \/\/ We unlock before notifying, because that is what the documentation suggests:\n  \/\/ http:\/\/en.cppreference.com\/w\/cpp\/thread\/condition_variable\n  lock.unlock();\n  startup_cond_.notify_one();\n\n  \/\/ start the mainloop\n  mainloop->run();\n}\n\n\/\/ initialize static member:\nThreadTimer::type_signal_end ThreadTimer::signal_end_;\n\nThreadDispatcher::ThreadDispatcher() : timer_(nullptr)\n{\n  std::cout << \"Thread Dispatcher Example #2\" << std::endl;\n\n  timer_ = new ThreadTimer();\n  timer_->signal_end().connect(sigc::mem_fun(*this, &ThreadDispatcher::end));\n  timer_->print();\n}\n\nvoid\nThreadDispatcher::launch_thread()\n{\n  \/\/ launch the timer thread\n  timer_->launch();\n}\n\nvoid\nThreadDispatcher::end()\n{\n  \/\/ quit the main mainloop\n  main_loop->quit();\n}\n\n} \/\/ anonymous namespace\n\nint\nmain(int, char**)\n{\n  Glib::init();\n  main_loop = Glib::MainLoop::create();\n\n  ThreadDispatcher dispatcher;\n\n  \/\/ Install a one-shot idle handler to launch the threads\n  Glib::signal_idle().connect_once(sigc::mem_fun(dispatcher, &ThreadDispatcher::launch_thread));\n\n  main_loop->run();\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n*       SOFA, Simulation Open-Framework Architecture, version 1.0 RC 1        *\n*                (c) 2006-2011 INRIA, USTL, UJF, CNRS, MGH                    *\n*                                                                             *\n* This program is free software; you can redistribute it and\/or modify it     *\n* under the terms of the GNU General Public License as published by the Free  *\n* Software Foundation; either version 2 of the License, or (at your option)   *\n* any later version.                                                          *\n*                                                                             *\n* This program is distributed in the hope that it will be useful, but WITHOUT *\n* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or       *\n* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for    *\n* more details.                                                               *\n*                                                                             *\n* You should have received a copy of the GNU General Public License along     *\n* with this program; if not, write to the Free Software Foundation, Inc., 51  *\n* Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.                   *\n*******************************************************************************\n*                            SOFA :: Applications                             *\n*                                                                             *\n* Authors: The SOFA Team and external contributors (see Authors.txt)          *\n*                                                                             *\n* Contact information: contact@sofa-framework.org                             *\n******************************************************************************\/\n#include \"QDisplayDataWidget.h\"\n\n#include <QTableWidget>\n\n#include <QPalette>\n#ifdef SOFA_QT4\n#include <QHBoxLayout>\n#include <QVBoxLayout>\n#include <Q3GroupBox>\n#include <QLabel>\n#include <QValidator>\n#else\n#include <qlayout.h>\n#include <qlabel.h>\n#include <qgroupbox.h>\n#include <qvalidator.h>\n#endif\n\n#define TEXTSIZE_THRESHOLD 45\n\nnamespace sofa\n{\n\nusing namespace core::objectmodel;\nusing namespace sofa::component::misc;\n\nnamespace gui\n{\nnamespace qt\n{\n\nQDisplayDataWidget::QDisplayDataWidget(QWidget* parent,\n        BaseData* data,\n        const ModifyObjectFlags& flags):Q3GroupBox(parent),\n    data_(data),\n    flags_(flags),\n    datainfowidget_(NULL),\n    datawidget_(NULL),\n    numWidgets_(0)\n\n{\n    setAutoFillBackground(true);\n\n    if(data_ == NULL)\n        return;\n\n\tconst std::string label_text = data_->getHelp();\n\n    if (label_text != \"TODO\")\n    {\n        datainfowidget_ = new QDisplayDataInfoWidget(this,label_text,data_,flags.LINKPATH_MODIFIABLE_FLAG, flags_);\n\t\tdatainfowidget_->setContentsMargins(0, 0, 0, 0);\n\t\tdatainfowidget_->setSizePolicy(QSizePolicy::Minimum, QSizePolicy::Minimum);\n\n        numWidgets_ += 1;\n    }\n\n\tsetToolTip(data_->getHelp());\n\n    DataWidget::CreatorArgument dwarg;\n    dwarg.name =  data_->getName();\n    dwarg.data = data_;\n    dwarg.parent = this;\n    dwarg.readOnly = (data_->isReadOnly() && flags.READONLY_FLAG);\n\n    if( dynamic_cast<core::objectmodel::DataFileName*>(data_) != NULL )\n    {\n        \/\/ a bit of a hack for DataFileName widgets.\n        \/\/ A custom widget is used by default if we run this code from the Modeler\n\n        std::string widgetName=data_->getWidget();\n        if( widgetName.empty() && flags.MODELER_FLAG )\n        {\n            data_->setWidget(\"widget_filename\");\n        }\n    }\n\n\tdatawidget_= DataWidget::CreateDataWidget(dwarg);\n\t\n    if (datawidget_ == 0)\n    {\n        datawidget_ = new QDataSimpleEdit(this,dwarg.data->getName().c_str(), dwarg.data);\n        datawidget_->createWidgets();\n        datawidget_->setEnabled( !(dwarg.readOnly) );\n        assert(datawidget_ != NULL);\n    }\n\n\tif(datawidget_->layout())\n\t{\n\t\tdatawidget_->layout()->setAlignment(Qt::AlignCenter);\n\t\tdatawidget_->layout()->setContentsMargins(2, 2, 2, 2);\n\t}\n\n\tdatawidget_->setContentsMargins(0, 0, 0, 0);\n\tdatawidget_->setSizePolicy(QSizePolicy::Expanding, QSizePolicy::Minimum);\n\t\n\tconst std::string valuetype = data_->getValueTypeString();\n\tif (!valuetype.empty())\n\t\tdatawidget_->setToolTip(valuetype.c_str());\n\n    \/\/std::cout << \"WIDGET created for data \" << dwarg.data << \" : \" << dwarg.name << \" : \" << dwarg.data->getValueTypeString() << std::endl;\n    numWidgets_ += datawidget_->sizeWidget();\n    connect(datawidget_,SIGNAL(WidgetDirty(bool)), this, SIGNAL ( WidgetDirty(bool) ) );\n    connect(this, SIGNAL( WidgetUpdate() ), datawidget_, SLOT( updateWidgetValue() ) );\n    connect(this, SIGNAL( DataUpdate() ), datawidget_, SLOT(updateDataValue() ) );\n    connect(datawidget_,SIGNAL(DataOwnerDirty(bool)),this,SIGNAL(DataOwnerDirty(bool)) );\n\n    if(flags.PROPERTY_WIDGET_FLAG)\n    {\n\t\tQWidget* refreshWidget = new QWidget(this);\n\t\trefreshWidget->setFixedSize(QSize(16, 16));\n        QPushButton *refresh = new QPushButton(RefreshIcon(), \"\", refreshWidget);\n        refresh->setHidden(true);\n        refresh->setFixedSize(QSize(16, 16));\n\t\trefresh->setContentsMargins(0, 0, 0, 0);\n\n        ++numWidgets_;\n\n\t\tif(flags.MODELER_FLAG)\n\t\t{\n\t\t\tconnect(datawidget_,SIGNAL(WidgetDirty(bool)), refresh, SLOT ( setVisible(bool) ) );\n\n\t\t\tif(datainfowidget_)\n\t\t\t{\n\t\t\t\tconnect(datainfowidget_,SIGNAL(WidgetDirty()), refresh, SLOT ( show() ) );\n\t\t\t\tconnect(refresh, SIGNAL(clicked()), datainfowidget_, SLOT(linkEdited()));\n\t\t\t}\n\n\t\t\tconnect(refresh, SIGNAL(clicked()), this, SLOT(UpdateData()));\n\t\t\tconnect(refresh, SIGNAL(clicked(bool)), refresh, SLOT(setVisible(bool)));\n\t\t}\n\n\t\tsetStyleSheet(\"QGroupBox{border:0;}\");\n        setContentsMargins(0, 0, 0, 0);\n\t\tsetInsideMargin(0);\n        setInsideSpacing(0);\n\n        setColumns(numWidgets_);\n    }\n    else\n    {\n\t\tsetTitle(data_->getName().c_str());\n        setInsideMargin(4);\n        setInsideSpacing(2);\n\n        setColumns(numWidgets_); \/\/datawidget_->numColumnWidget());\n    }\n}\n\nvoid QDisplayDataWidget::UpdateData()\n{\n    emit DataUpdate();\n}\n\nvoid QDisplayDataWidget::UpdateWidgets()\n{\n    emit WidgetUpdate();\n}\n\nQDataSimpleEdit::QDataSimpleEdit(QWidget* parent, const char* name, BaseData* data):\n    DataWidget(parent,name,data)\n{\n}\nbool QDataSimpleEdit::createWidgets()\n{\n    QString str  = QString( getBaseData()->getValueString().c_str() );\n    QLayout* layout = new QHBoxLayout(this);\n    if( str.length() > TEXTSIZE_THRESHOLD )\n    {\n        innerWidget_.type = TEXTEDIT;\n        innerWidget_.widget.textEdit = new QTextEdit(this); innerWidget_.widget.textEdit->setText(str);\n        connect(innerWidget_.widget.textEdit , SIGNAL( textChanged() ), this, SLOT ( update() ) );\n        layout->add(innerWidget_.widget.textEdit);\n    }\n    else\n    {\n        innerWidget_.type = LINEEDIT;\n        innerWidget_.widget.lineEdit  = new QLineEdit(this);\n        innerWidget_.widget.lineEdit->setText(str);\n        connect( innerWidget_.widget.lineEdit, SIGNAL(textChanged(const QString&)), this, SLOT( update() ) );\n        layout->add(innerWidget_.widget.lineEdit);\n    }\n\n\n\n\n    return true;\n}\n\nvoid QDataSimpleEdit::readFromData()\n{\n    QString str = QString( getBaseData()->getValueString().c_str() );\n    if(innerWidget_.type == TEXTEDIT)\n    {\n        innerWidget_.widget.textEdit->setText(str);\n    }\n    else if(innerWidget_.type == LINEEDIT)\n    {\n        innerWidget_.widget.lineEdit->setText(str);\n    }\n}\n\nvoid QDataSimpleEdit::writeToData()\n{\n    if(getBaseData())\n    {\n        std::string value;\n        if( innerWidget_.type == TEXTEDIT)\n        {\n            value = innerWidget_.widget.textEdit->text().ascii();\n        }\n        else if( innerWidget_.type == LINEEDIT)\n        {\n            value = innerWidget_.widget.lineEdit->text().ascii();\n        }\n        getBaseData()->read(value);\n    }\n}\n\n\/* QPoissonRatioWidget *\/\n\nQPoissonRatioWidget::QPoissonRatioWidget(QWidget * parent, const char * name, sofa::core::objectmodel::Data<double> *data)\n    :TDataWidget<double>(parent,name,data)\n{\n\n}\n\n\nbool QPoissonRatioWidget::createWidgets()\n{\n    QGridLayout* layout = new QGridLayout(this,2,3);\n\n    lineEdit = new QLineEdit(this);\n    lineEdit->setText(QString(\"-1.0\"));\n    lineEdit->setMaximumSize(lineEdit->size());\n    lineEdit->setAlignment(Qt::AlignHCenter);\n\n    lineEdit->setValidator(new QDoubleValidator(0.0,0.5,2,this));\n\n    layout->addWidget(lineEdit,0,1,Qt::AlignHCenter);\n    QLabel* min = new QLabel(this);\n    min->setText(QString(\"0.0\"));\n    min->setMaximumSize( min->sizeHint() );\n    layout->addWidget(min,1,0,Qt::AlignHCenter);\n\n    slider = new QSlider(Qt::Horizontal, this);\n    slider->setRange(0,50); \/\/max times 10 at the power 2 (2 digits after \".\")\n    slider->setTickmarks(QSlider::Below);\n    slider->setTickInterval(5);\n    layout->addWidget(slider,1,1,Qt::AlignHCenter);\n\n    QLabel* max = new QLabel(this);\n    max->setText(QString(\"0.5\"));\n    max->setMaximumSize ( max->sizeHint() );\n\n    layout->addWidget(max,1,2,Qt::AlignHCenter);\n\n    \/\/ synchronization between qslider and qlineedit\n    connect(slider, SIGNAL( valueChanged(int) ), this, SLOT ( changeLineEditValue() ) );\n    connect(slider, SIGNAL( sliderReleased()   ), this, SLOT ( changeLineEditValue() ) );\n    connect(lineEdit, SIGNAL( textChanged(const QString&) ), this, SLOT (changeSliderValue() ) );\n\n    \/\/ synchronization between the widgets and the modify object dialog box\n    connect(lineEdit, SIGNAL( textChanged(const QString&) ), this, SLOT( setWidgetDirty() ) );\n    connect(slider, SIGNAL( sliderReleased()  ), this, SLOT ( setWidgetDirty() ) );\n    connect(slider, SIGNAL( valueChanged(int) ), this, SLOT ( setWidgetDirty() ) );\n\n\n    return true;\n}\n\nvoid QPoissonRatioWidget::readFromData()\n{\n    double value = this->getData()->virtualGetValue();\n    QString str;\n    str.setNum(value);\n    lineEdit->setText(str);\n    changeSliderValue();\n}\n\nvoid QPoissonRatioWidget::writeToData()\n{\n    bool ok;\n    double d = lineEdit->text().toDouble(&ok);\n    if(ok)\n    {\n        this->getData()->virtualSetValue(d);\n    }\n}\n\nvoid QPoissonRatioWidget::changeLineEditValue()\n{\n    int v = slider->value();\n    double db = (double)v \/ 100.;\n    QString str;\n    str.setNum(db);\n    lineEdit->setText(str);\n}\n\nvoid QPoissonRatioWidget::changeSliderValue()\n{\n    bool ok;\n    double v = lineEdit->text().toDouble(&ok);\n    if(ok)\n    {\n        slider->setValue( (int)(v*100.) );\n    }\n}\n\nhelper::Creator<DataWidgetFactory, QPoissonRatioWidget> DWClass_Poissonratio(\"poissonRatio\",false);\n\n} \/\/ qt\n} \/\/gui\n} \/\/sofa\n\n<commit_msg>r10509\/sofa : FIX: data can now be edited in the runSofa property widget<commit_after>\/******************************************************************************\n*       SOFA, Simulation Open-Framework Architecture, version 1.0 RC 1        *\n*                (c) 2006-2011 INRIA, USTL, UJF, CNRS, MGH                    *\n*                                                                             *\n* This program is free software; you can redistribute it and\/or modify it     *\n* under the terms of the GNU General Public License as published by the Free  *\n* Software Foundation; either version 2 of the License, or (at your option)   *\n* any later version.                                                          *\n*                                                                             *\n* This program is distributed in the hope that it will be useful, but WITHOUT *\n* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or       *\n* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for    *\n* more details.                                                               *\n*                                                                             *\n* You should have received a copy of the GNU General Public License along     *\n* with this program; if not, write to the Free Software Foundation, Inc., 51  *\n* Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.                   *\n*******************************************************************************\n*                            SOFA :: Applications                             *\n*                                                                             *\n* Authors: The SOFA Team and external contributors (see Authors.txt)          *\n*                                                                             *\n* Contact information: contact@sofa-framework.org                             *\n******************************************************************************\/\n#include \"QDisplayDataWidget.h\"\n\n#include <QTableWidget>\n\n#include <QPalette>\n#ifdef SOFA_QT4\n#include <QHBoxLayout>\n#include <QVBoxLayout>\n#include <Q3GroupBox>\n#include <QLabel>\n#include <QValidator>\n#else\n#include <qlayout.h>\n#include <qlabel.h>\n#include <qgroupbox.h>\n#include <qvalidator.h>\n#endif\n\n#define TEXTSIZE_THRESHOLD 45\n\nnamespace sofa\n{\n\nusing namespace core::objectmodel;\nusing namespace sofa::component::misc;\n\nnamespace gui\n{\nnamespace qt\n{\n\nQDisplayDataWidget::QDisplayDataWidget(QWidget* parent,\n        BaseData* data,\n        const ModifyObjectFlags& flags):Q3GroupBox(parent),\n    data_(data),\n    flags_(flags),\n    datainfowidget_(NULL),\n    datawidget_(NULL),\n    numWidgets_(0)\n\n{\n    setAutoFillBackground(true);\n\n    if(data_ == NULL)\n        return;\n\n\tconst std::string label_text = data_->getHelp();\n\n    if (label_text != \"TODO\")\n    {\n        datainfowidget_ = new QDisplayDataInfoWidget(this,label_text,data_,flags.LINKPATH_MODIFIABLE_FLAG, flags_);\n\t\tdatainfowidget_->setContentsMargins(0, 0, 0, 0);\n\t\tdatainfowidget_->setSizePolicy(QSizePolicy::Minimum, QSizePolicy::Minimum);\n\n        numWidgets_ += 1;\n    }\n\n\tsetToolTip(data_->getHelp());\n\n    DataWidget::CreatorArgument dwarg;\n    dwarg.name =  data_->getName();\n    dwarg.data = data_;\n    dwarg.parent = this;\n    dwarg.readOnly = (data_->isReadOnly() && flags.READONLY_FLAG);\n\n    if( dynamic_cast<core::objectmodel::DataFileName*>(data_) != NULL )\n    {\n        \/\/ a bit of a hack for DataFileName widgets.\n        \/\/ A custom widget is used by default if we run this code from the Modeler\n\n        std::string widgetName=data_->getWidget();\n        if( widgetName.empty() && flags.MODELER_FLAG )\n        {\n            data_->setWidget(\"widget_filename\");\n        }\n    }\n\n\tdatawidget_= DataWidget::CreateDataWidget(dwarg);\n\t\n    if (datawidget_ == 0)\n    {\n        datawidget_ = new QDataSimpleEdit(this,dwarg.data->getName().c_str(), dwarg.data);\n        datawidget_->createWidgets();\n        datawidget_->setEnabled( !(dwarg.readOnly) );\n        assert(datawidget_ != NULL);\n    }\n\n\tif(datawidget_->layout())\n\t{\n\t\tdatawidget_->layout()->setAlignment(Qt::AlignCenter);\n\t\tdatawidget_->layout()->setContentsMargins(2, 2, 2, 2);\n\t}\n\n\tdatawidget_->setContentsMargins(0, 0, 0, 0);\n\tdatawidget_->setSizePolicy(QSizePolicy::Expanding, QSizePolicy::Minimum);\n\t\n\tconst std::string valuetype = data_->getValueTypeString();\n\tif (!valuetype.empty())\n\t\tdatawidget_->setToolTip(valuetype.c_str());\n\n    \/\/std::cout << \"WIDGET created for data \" << dwarg.data << \" : \" << dwarg.name << \" : \" << dwarg.data->getValueTypeString() << std::endl;\n    numWidgets_ += datawidget_->sizeWidget();\n    connect(datawidget_,SIGNAL(WidgetDirty(bool)), this, SIGNAL ( WidgetDirty(bool) ) );\n    connect(this, SIGNAL( WidgetUpdate() ), datawidget_, SLOT( updateWidgetValue() ) );\n    connect(this, SIGNAL( DataUpdate() ), datawidget_, SLOT(updateDataValue() ) );\n    connect(datawidget_,SIGNAL(DataOwnerDirty(bool)),this,SIGNAL(DataOwnerDirty(bool)) );\n\n    if(flags.PROPERTY_WIDGET_FLAG)\n    {\n\t\tQWidget* refreshWidget = new QWidget(this);\n\t\trefreshWidget->setFixedSize(QSize(16, 16));\n        QPushButton *refresh = new QPushButton(RefreshIcon(), \"\", refreshWidget);\n        refresh->setHidden(true);\n        refresh->setFixedSize(QSize(16, 16));\n\t\trefresh->setContentsMargins(0, 0, 0, 0);\n\n        ++numWidgets_;\n\n\t\t{\n\t\t\tconnect(datawidget_,SIGNAL(WidgetDirty(bool)), refresh, SLOT ( setVisible(bool) ) );\n\n\t\t\tif(datainfowidget_ && flags.LINKPATH_MODIFIABLE_FLAG)\n\t\t\t{\n\t\t\t\tconnect(datainfowidget_,SIGNAL(WidgetDirty()), refresh, SLOT ( show() ) );\n\t\t\t\tconnect(refresh, SIGNAL(clicked()), datainfowidget_, SLOT(linkEdited()));\n\t\t\t}\n\n\t\t\tconnect(refresh, SIGNAL(clicked()), this, SLOT(UpdateData()));\n\t\t\tconnect(refresh, SIGNAL(clicked(bool)), refresh, SLOT(setVisible(bool)));\n\t\t}\n\n\t\tsetStyleSheet(\"QGroupBox{border:0;}\");\n        setContentsMargins(0, 0, 0, 0);\n\t\tsetInsideMargin(0);\n        setInsideSpacing(0);\n\n        setColumns(numWidgets_);\n    }\n    else\n    {\n\t\tsetTitle(data_->getName().c_str());\n        setInsideMargin(4);\n        setInsideSpacing(2);\n\n        setColumns(numWidgets_); \/\/datawidget_->numColumnWidget());\n    }\n}\n\nvoid QDisplayDataWidget::UpdateData()\n{\n    emit DataUpdate();\n}\n\nvoid QDisplayDataWidget::UpdateWidgets()\n{\n    emit WidgetUpdate();\n}\n\nQDataSimpleEdit::QDataSimpleEdit(QWidget* parent, const char* name, BaseData* data):\n    DataWidget(parent,name,data)\n{\n}\nbool QDataSimpleEdit::createWidgets()\n{\n    QString str  = QString( getBaseData()->getValueString().c_str() );\n    QLayout* layout = new QHBoxLayout(this);\n    if( str.length() > TEXTSIZE_THRESHOLD )\n    {\n        innerWidget_.type = TEXTEDIT;\n        innerWidget_.widget.textEdit = new QTextEdit(this); innerWidget_.widget.textEdit->setText(str);\n        connect(innerWidget_.widget.textEdit , SIGNAL( textChanged() ), this, SLOT ( update() ) );\n        layout->add(innerWidget_.widget.textEdit);\n    }\n    else\n    {\n        innerWidget_.type = LINEEDIT;\n        innerWidget_.widget.lineEdit  = new QLineEdit(this);\n        innerWidget_.widget.lineEdit->setText(str);\n        connect( innerWidget_.widget.lineEdit, SIGNAL(textChanged(const QString&)), this, SLOT( update() ) );\n        layout->add(innerWidget_.widget.lineEdit);\n    }\n\n\n\n\n    return true;\n}\n\nvoid QDataSimpleEdit::readFromData()\n{\n    QString str = QString( getBaseData()->getValueString().c_str() );\n    if(innerWidget_.type == TEXTEDIT)\n    {\n        innerWidget_.widget.textEdit->setText(str);\n    }\n    else if(innerWidget_.type == LINEEDIT)\n    {\n        innerWidget_.widget.lineEdit->setText(str);\n    }\n}\n\nvoid QDataSimpleEdit::writeToData()\n{\n    if(getBaseData())\n    {\n        std::string value;\n        if( innerWidget_.type == TEXTEDIT)\n        {\n            value = innerWidget_.widget.textEdit->text().ascii();\n        }\n        else if( innerWidget_.type == LINEEDIT)\n        {\n            value = innerWidget_.widget.lineEdit->text().ascii();\n        }\n        getBaseData()->read(value);\n    }\n}\n\n\/* QPoissonRatioWidget *\/\n\nQPoissonRatioWidget::QPoissonRatioWidget(QWidget * parent, const char * name, sofa::core::objectmodel::Data<double> *data)\n    :TDataWidget<double>(parent,name,data)\n{\n\n}\n\n\nbool QPoissonRatioWidget::createWidgets()\n{\n    QGridLayout* layout = new QGridLayout(this,2,3);\n\n    lineEdit = new QLineEdit(this);\n    lineEdit->setText(QString(\"-1.0\"));\n    lineEdit->setMaximumSize(lineEdit->size());\n    lineEdit->setAlignment(Qt::AlignHCenter);\n\n    lineEdit->setValidator(new QDoubleValidator(0.0,0.5,2,this));\n\n    layout->addWidget(lineEdit,0,1,Qt::AlignHCenter);\n    QLabel* min = new QLabel(this);\n    min->setText(QString(\"0.0\"));\n    min->setMaximumSize( min->sizeHint() );\n    layout->addWidget(min,1,0,Qt::AlignHCenter);\n\n    slider = new QSlider(Qt::Horizontal, this);\n    slider->setRange(0,50); \/\/max times 10 at the power 2 (2 digits after \".\")\n    slider->setTickmarks(QSlider::Below);\n    slider->setTickInterval(5);\n    layout->addWidget(slider,1,1,Qt::AlignHCenter);\n\n    QLabel* max = new QLabel(this);\n    max->setText(QString(\"0.5\"));\n    max->setMaximumSize ( max->sizeHint() );\n\n    layout->addWidget(max,1,2,Qt::AlignHCenter);\n\n    \/\/ synchronization between qslider and qlineedit\n    connect(slider, SIGNAL( valueChanged(int) ), this, SLOT ( changeLineEditValue() ) );\n    connect(slider, SIGNAL( sliderReleased()   ), this, SLOT ( changeLineEditValue() ) );\n    connect(lineEdit, SIGNAL( textChanged(const QString&) ), this, SLOT (changeSliderValue() ) );\n\n    \/\/ synchronization between the widgets and the modify object dialog box\n    connect(lineEdit, SIGNAL( textChanged(const QString&) ), this, SLOT( setWidgetDirty() ) );\n    connect(slider, SIGNAL( sliderReleased()  ), this, SLOT ( setWidgetDirty() ) );\n    connect(slider, SIGNAL( valueChanged(int) ), this, SLOT ( setWidgetDirty() ) );\n\n\n    return true;\n}\n\nvoid QPoissonRatioWidget::readFromData()\n{\n    double value = this->getData()->virtualGetValue();\n    QString str;\n    str.setNum(value);\n    lineEdit->setText(str);\n    changeSliderValue();\n}\n\nvoid QPoissonRatioWidget::writeToData()\n{\n    bool ok;\n    double d = lineEdit->text().toDouble(&ok);\n    if(ok)\n    {\n        this->getData()->virtualSetValue(d);\n    }\n}\n\nvoid QPoissonRatioWidget::changeLineEditValue()\n{\n    int v = slider->value();\n    double db = (double)v \/ 100.;\n    QString str;\n    str.setNum(db);\n    lineEdit->setText(str);\n}\n\nvoid QPoissonRatioWidget::changeSliderValue()\n{\n    bool ok;\n    double v = lineEdit->text().toDouble(&ok);\n    if(ok)\n    {\n        slider->setValue( (int)(v*100.) );\n    }\n}\n\nhelper::Creator<DataWidgetFactory, QPoissonRatioWidget> DWClass_Poissonratio(\"poissonRatio\",false);\n\n} \/\/ qt\n} \/\/gui\n} \/\/sofa\n\n<|endoftext|>"}
{"text":"<commit_before>\/* =======================================================================\n   Copyright (c) 2011-2013, Institute for Microelectronics,\n                            Institute for Analysis and Scientific Computing,\n                            TU Wien.\n\n                            -----------------\n                     ViennaGrid - The Vienna Grid Library\n                            -----------------\n\n   License:      MIT (X11), see file LICENSE in the base directory\n======================================================================= *\/\n\n#ifdef _MSC_VER\n  #pragma warning( disable : 4503 )     \/\/truncated name decoration\n#endif\n\n#include <iostream>\n#include <typeinfo>\n\n#include \"viennagrid\/config\/default_configs.hpp\"\n\n#include \"viennagrid\/accessor.hpp\"\n#include \"viennagrid\/mesh\/mesh.hpp\"\n#include \"viennagrid\/mesh\/segmentation.hpp\"\n#include \"viennagrid\/mesh\/element_creation.hpp\"\n\n\n\nint main()\n{\n  typedef viennagrid::triangular_3d_mesh                        MeshType;\n\n  typedef viennagrid::result_of::vertex_handle< MeshType >::type     VertexHandleType;\n  typedef viennagrid::result_of::vertex< MeshType >::type            VertexType;\n  typedef viennagrid::result_of::triangle_handle< MeshType >::type   TriangleHandleType;\n  typedef viennagrid::result_of::triangle< MeshType >::type          TriangleType;\n\n\n  \/\/ triangular hull segmentation, each triangular face has a segment for its positive orientation and its negative orientation\n  typedef viennagrid::result_of::oriented_3d_hull_segmentation<MeshType>::type SegmentationType;\n\n  \/\/ defining the segment type and segment id type\n  typedef viennagrid::result_of::segment_handle<SegmentationType>::type SegmentHandleType;\n  typedef viennagrid::result_of::segment_id<SegmentationType>::type SegmentIDType;\n\n\n  MeshType mesh;\n  SegmentationType segmentation(mesh);\n\n  \/\/ create some vertices\n  VertexHandleType vh0 = viennagrid::make_vertex( mesh );\n  VertexHandleType vh1 = viennagrid::make_vertex( mesh );\n  VertexHandleType vh2 = viennagrid::make_vertex( mesh );\n  VertexHandleType vh3 = viennagrid::make_vertex( mesh );\n  VertexHandleType vh4 = viennagrid::make_vertex( mesh );\n  VertexHandleType vh5 = viennagrid::make_vertex( mesh );\n\n  \/\/ create some triangles\n  TriangleHandleType th0 = viennagrid::make_triangle( mesh, vh0, vh1, vh2 );\n  TriangleHandleType th1 = viennagrid::make_triangle( mesh, vh1, vh2, vh3 );\n  TriangleHandleType th2 = viennagrid::make_triangle( mesh, vh3, vh4, vh5 );\n  \/*TriangleHandleType th3 =*\/ viennagrid::make_triangle( mesh, vh0, vh4, vh5 );\n\n\n\n  \/\/ create a segment, segment id will be 0 because of first segment\n  SegmentHandleType seg0 = segmentation.make_segment();\n\n  \/\/ create a segment, segment id will be 4 because explicit segment_id\n  SegmentHandleType seg1 = segmentation[ SegmentIDType(4) ];\n\n  \/\/ create a segment, segment id will be 5 because highest segment id was 4\n  SegmentHandleType seg2 = segmentation.make_segment();\n\n  \/\/ create some other segments (ID would be 6, 7, 8)\n  SegmentHandleType seg3 = segmentation.make_segment();\n  SegmentHandleType seg4 = segmentation.make_segment();\n  SegmentHandleType seg5 = segmentation.make_segment();\n\n  \/\/ print the segments\n  std::cout << \"Segments in Segmentation\" << std::endl;\n  for ( SegmentationType::iterator it = segmentation.begin(); it != segmentation.end(); ++it)\n    std::cout << (*it).id() << std::endl;\n  std::cout << std::endl;\n\n\n  TriangleType & tri0 = viennagrid::dereference_handle(mesh, th0);\n  TriangleType & tri1 = viennagrid::dereference_handle(mesh, th1);\n  TriangleType & tri2 = viennagrid::dereference_handle(mesh, th2);\n\n  VertexType & v0 = viennagrid::dereference_handle(mesh, vh0);\n\n  \/\/ add triangle tr0 to seg0\n  std::cout << \"Adding element tri0 to seg0\" << std::endl;\n  viennagrid::add( seg0, tri0 );\n\n  std::cout << \"Adding element tri0 to seg1\" << std::endl;\n  viennagrid::add( seg1, tri0 );\n\n  std::cout << \"Triangle 0 in Segment 0: \" << viennagrid::is_in_segment( seg0, tri0 ) << std::endl;\n  std::cout << \"Vertex 0 in Segment 0: \" << viennagrid::is_in_segment( seg0, v0 ) << std::endl;\n  std::cout << \"Numer of cells in segmentation: \" << viennagrid::cells( segmentation ).size() << std::endl;\n\n  std::cout << \"Erasing element tri0 from seg0\" << std::endl;\n  \/\/ erase triangle tr0 from seg0\n  viennagrid::erase( seg0, tri0 );\n  std::cout << \"Triangle 0 in Segment 0: \" <<  viennagrid::is_in_segment( seg0, tri0 ) << std::endl;\n  std::cout << \"Vertex 0 in Segment 0: \" << viennagrid::is_in_segment( seg0, v0 ) << std::endl;\n  std::cout << \"Numer of cells in segmentation: \" << viennagrid::cells( segmentation ).size() << std::endl;\n\n  std::cout << \"Erasing element tri0 from seg1\" << std::endl;\n  \/\/ erase triangle tr0 from seg0\n  viennagrid::erase( seg1, tri0 );\n  std::cout << \"Triangle 0 in Segment 0: \" <<  viennagrid::is_in_segment( seg0, tri0 ) << std::endl;\n  std::cout << \"Vertex 0 in Segment 0: \" << viennagrid::is_in_segment( seg0, v0 ) << std::endl;\n  std::cout << \"Numer of cells in segmentation: \" << viennagrid::cells( segmentation ).size() << std::endl;\n\n\n  \/\/ add triangle tr0 to seg0, tri1 to seg1, tri2 to seg2\n  viennagrid::add( seg0, tri0 );\n  viennagrid::add( seg1, tri1 );\n  viennagrid::add( seg2, tri2 );\n\n\n  viennagrid::add( seg3, tri0 );\n  viennagrid::add( seg4, tri0 );\n  viennagrid::add( seg5, tri0 );\n\n\n  \/\/ print all cells of the mesh (should be four)\n  typedef viennagrid::result_of::cell_range<MeshType>::type MeshCellRange;\n  typedef viennagrid::result_of::iterator<MeshCellRange>::type MeshCellIterator;\n\n  std::cout << std::endl;\n  std::cout << \"All cells in the mesh:\" << std::endl;\n  MeshCellRange mesh_cells( mesh );\n  for (MeshCellIterator cit = mesh_cells.begin(); cit != mesh_cells.end(); ++cit)\n    std::cout << *cit << std::endl;\n  std::cout << std::endl;\n\n  \/\/ print all cells of the segmentation (should be three)\n  typedef viennagrid::result_of::cell_range<SegmentationType>::type SegmentationCellRange;\n  typedef viennagrid::result_of::iterator<SegmentationCellRange>::type SegmentationCellIterator;\n\n  std::cout << std::endl;\n  std::cout << \"All cells in the segmentation:\" << std::endl;\n  SegmentationCellRange segmentation_cells( segmentation );\n  for (SegmentationCellIterator cit = segmentation_cells.begin(); cit != segmentation_cells.end(); ++cit)\n    std::cout << *cit << std::endl;\n  std::cout << std::endl;\n\n\n\n\n\n  typedef viennagrid::result_of::segment_id_range<SegmentationType, TriangleType>::type SegmentIDRange;\n  SegmentIDRange segment_ids = viennagrid::segment_ids( segmentation, tri0 );\n  std::cout << \"Segments for tr0:\" << std::endl;\n  for (SegmentIDRange::iterator it = segment_ids.begin(); it != segment_ids.end(); ++it)\n    std::cout << *it << std::endl;\n\n\n  \/\/ setting and querying additional segment information for tri0\n  std::cout << \"Triangle 0 in Segment 0: \" <<  *viennagrid::segment_element_info( seg0, tri0 ) << std::endl;\n  *viennagrid::segment_element_info( seg0, tri0 ) = true;\n  std::cout << \"Triangle 0 in Segment 0: \" <<  *viennagrid::segment_element_info( seg0, tri0 ) << std::endl;\n  std::cout << std::endl;\n\n  \/\/ printing all triangles from all segments\n  typedef viennagrid::result_of::element_range< SegmentHandleType, viennagrid::triangle_tag >::type RangeType;\n\n  std::cout << \"Triangles of Segment 0\" << std::endl;\n  RangeType range( seg0 );\n  for (RangeType::iterator it = range.begin(); it != range.end(); ++it)\n    std::cout << *it << std::endl;\n\n  std::cout << \"Triangles of Segment 1\" << std::endl;\n  range = RangeType( seg1 );\n  for (RangeType::iterator it = range.begin(); it != range.end(); ++it)\n    std::cout << *it << std::endl;\n\n  std::cout << \"Triangles of Segment 2\" << std::endl;\n  range = RangeType( seg2 );\n  for (RangeType::iterator it = range.begin(); it != range.end(); ++it)\n    std::cout << *it << std::endl;\n\n  std::cout << std::endl;\n\n  \/\/ Adding additional triangles to seg2 and printing them\n  viennagrid::make_triangle( seg2, vh1, vh4, vh5 );\n  viennagrid::make_triangle( seg2, vh2, vh4, vh5 );\n\n  std::cout << \"Triangles of Segment 2, added 2 additional\" << std::endl;\n  range = RangeType( seg2 );\n  for (RangeType::iterator it = range.begin(); it != range.end(); ++it)\n    std::cout << *it << std::endl;\n  std::cout << std::endl;\n\n  \/\/ Printing vertices from seg2, each vertex should only be printed once\n  typedef viennagrid::result_of::vertex_range<SegmentHandleType>::type vertex_range;\n  std::cout << \"Vertices of Segment 2\" << std::endl;\n  vertex_range vertices( seg2 );\n  for (vertex_range::iterator it = vertices.begin(); it != vertices.end(); ++it)\n    std::cout << *it << std::endl;\n\n  std::cout << \"-----------------------------------------------\" << std::endl;\n  std::cout << \" \\\\o\/    Tutorial finished successfully!    \\\\o\/ \" << std::endl;\n  std::cout << \"-----------------------------------------------\" << std::endl;\n\n  return EXIT_SUCCESS;\n}\n<commit_msg>fixed header<commit_after>\/* =======================================================================\n   Copyright (c) 2011-2013, Institute for Microelectronics,\n                            Institute for Analysis and Scientific Computing,\n                            TU Wien.\n\n                            -----------------\n                     ViennaGrid - The Vienna Grid Library\n                            -----------------\n\n   License:      MIT (X11), see file LICENSE in the base directory\n======================================================================= *\/\n\n#ifdef _MSC_VER\n  #pragma warning( disable : 4503 )     \/\/truncated name decoration\n#endif\n\n#include <iostream>\n#include <typeinfo>\n\n#include \"viennagrid\/config\/default_configs.hpp\"\n\n#include \"viennagrid\/accessor.hpp\"\n#include \"viennagrid\/mesh\/mesh.hpp\"\n#include \"viennagrid\/mesh\/segmentation.hpp\"\n#include \"viennagrid\/mesh\/element_creation.hpp\"\n#include \"viennagrid\/mesh\/element_deletion.hpp\"\n\n\n\nint main()\n{\n  typedef viennagrid::triangular_3d_mesh                        MeshType;\n\n  typedef viennagrid::result_of::vertex_handle< MeshType >::type     VertexHandleType;\n  typedef viennagrid::result_of::vertex< MeshType >::type            VertexType;\n  typedef viennagrid::result_of::triangle_handle< MeshType >::type   TriangleHandleType;\n  typedef viennagrid::result_of::triangle< MeshType >::type          TriangleType;\n\n\n  \/\/ triangular hull segmentation, each triangular face has a segment for its positive orientation and its negative orientation\n  typedef viennagrid::result_of::oriented_3d_hull_segmentation<MeshType>::type SegmentationType;\n\n  \/\/ defining the segment type and segment id type\n  typedef viennagrid::result_of::segment_handle<SegmentationType>::type SegmentHandleType;\n  typedef viennagrid::result_of::segment_id<SegmentationType>::type SegmentIDType;\n\n\n  MeshType mesh;\n  SegmentationType segmentation(mesh);\n\n  \/\/ create some vertices\n  VertexHandleType vh0 = viennagrid::make_vertex( mesh );\n  VertexHandleType vh1 = viennagrid::make_vertex( mesh );\n  VertexHandleType vh2 = viennagrid::make_vertex( mesh );\n  VertexHandleType vh3 = viennagrid::make_vertex( mesh );\n  VertexHandleType vh4 = viennagrid::make_vertex( mesh );\n  VertexHandleType vh5 = viennagrid::make_vertex( mesh );\n\n  \/\/ create some triangles\n  TriangleHandleType th0 = viennagrid::make_triangle( mesh, vh0, vh1, vh2 );\n  TriangleHandleType th1 = viennagrid::make_triangle( mesh, vh1, vh2, vh3 );\n  TriangleHandleType th2 = viennagrid::make_triangle( mesh, vh3, vh4, vh5 );\n  \/*TriangleHandleType th3 =*\/ viennagrid::make_triangle( mesh, vh0, vh4, vh5 );\n\n\n\n  \/\/ create a segment, segment id will be 0 because of first segment\n  SegmentHandleType seg0 = segmentation.make_segment();\n\n  \/\/ create a segment, segment id will be 4 because explicit segment_id\n  SegmentHandleType seg1 = segmentation[ SegmentIDType(4) ];\n\n  \/\/ create a segment, segment id will be 5 because highest segment id was 4\n  SegmentHandleType seg2 = segmentation.make_segment();\n\n  \/\/ create some other segments (ID would be 6, 7, 8)\n  SegmentHandleType seg3 = segmentation.make_segment();\n  SegmentHandleType seg4 = segmentation.make_segment();\n  SegmentHandleType seg5 = segmentation.make_segment();\n\n  \/\/ print the segments\n  std::cout << \"Segments in Segmentation\" << std::endl;\n  for ( SegmentationType::iterator it = segmentation.begin(); it != segmentation.end(); ++it)\n    std::cout << (*it).id() << std::endl;\n  std::cout << std::endl;\n\n\n  TriangleType & tri0 = viennagrid::dereference_handle(mesh, th0);\n  TriangleType & tri1 = viennagrid::dereference_handle(mesh, th1);\n  TriangleType & tri2 = viennagrid::dereference_handle(mesh, th2);\n\n  VertexType & v0 = viennagrid::dereference_handle(mesh, vh0);\n\n  \/\/ add triangle tr0 to seg0\n  std::cout << \"Adding element tri0 to seg0\" << std::endl;\n  viennagrid::add( seg0, tri0 );\n\n  std::cout << \"Adding element tri0 to seg1\" << std::endl;\n  viennagrid::add( seg1, tri0 );\n\n  std::cout << \"Triangle 0 in Segment 0: \" << viennagrid::is_in_segment( seg0, tri0 ) << std::endl;\n  std::cout << \"Vertex 0 in Segment 0: \" << viennagrid::is_in_segment( seg0, v0 ) << std::endl;\n  std::cout << \"Numer of cells in segmentation: \" << viennagrid::cells( segmentation ).size() << std::endl;\n\n  std::cout << \"Erasing element tri0 from seg0\" << std::endl;\n  \/\/ erase triangle tr0 from seg0\n  viennagrid::erase( seg0, tri0 );\n  std::cout << \"Triangle 0 in Segment 0: \" <<  viennagrid::is_in_segment( seg0, tri0 ) << std::endl;\n  std::cout << \"Vertex 0 in Segment 0: \" << viennagrid::is_in_segment( seg0, v0 ) << std::endl;\n  std::cout << \"Numer of cells in segmentation: \" << viennagrid::cells( segmentation ).size() << std::endl;\n\n  std::cout << \"Erasing element tri0 from seg1\" << std::endl;\n  \/\/ erase triangle tr0 from seg0\n  viennagrid::erase( seg1, tri0 );\n  std::cout << \"Triangle 0 in Segment 0: \" <<  viennagrid::is_in_segment( seg0, tri0 ) << std::endl;\n  std::cout << \"Vertex 0 in Segment 0: \" << viennagrid::is_in_segment( seg0, v0 ) << std::endl;\n  std::cout << \"Numer of cells in segmentation: \" << viennagrid::cells( segmentation ).size() << std::endl;\n\n\n  \/\/ add triangle tr0 to seg0, tri1 to seg1, tri2 to seg2\n  viennagrid::add( seg0, tri0 );\n  viennagrid::add( seg1, tri1 );\n  viennagrid::add( seg2, tri2 );\n\n\n  viennagrid::add( seg3, tri0 );\n  viennagrid::add( seg4, tri0 );\n  viennagrid::add( seg5, tri0 );\n\n\n  \/\/ print all cells of the mesh (should be four)\n  typedef viennagrid::result_of::cell_range<MeshType>::type MeshCellRange;\n  typedef viennagrid::result_of::iterator<MeshCellRange>::type MeshCellIterator;\n\n  std::cout << std::endl;\n  std::cout << \"All cells in the mesh:\" << std::endl;\n  MeshCellRange mesh_cells( mesh );\n  for (MeshCellIterator cit = mesh_cells.begin(); cit != mesh_cells.end(); ++cit)\n    std::cout << *cit << std::endl;\n  std::cout << std::endl;\n\n  \/\/ print all cells of the segmentation (should be three)\n  typedef viennagrid::result_of::cell_range<SegmentationType>::type SegmentationCellRange;\n  typedef viennagrid::result_of::iterator<SegmentationCellRange>::type SegmentationCellIterator;\n\n  std::cout << std::endl;\n  std::cout << \"All cells in the segmentation:\" << std::endl;\n  SegmentationCellRange segmentation_cells( segmentation );\n  for (SegmentationCellIterator cit = segmentation_cells.begin(); cit != segmentation_cells.end(); ++cit)\n    std::cout << *cit << std::endl;\n  std::cout << std::endl;\n\n\n\n\n\n  typedef viennagrid::result_of::segment_id_range<SegmentationType, TriangleType>::type SegmentIDRange;\n  SegmentIDRange segment_ids = viennagrid::segment_ids( segmentation, tri0 );\n  std::cout << \"Segments for tr0:\" << std::endl;\n  for (SegmentIDRange::iterator it = segment_ids.begin(); it != segment_ids.end(); ++it)\n    std::cout << *it << std::endl;\n\n\n  \/\/ setting and querying additional segment information for tri0\n  std::cout << \"Triangle 0 in Segment 0: \" <<  *viennagrid::segment_element_info( seg0, tri0 ) << std::endl;\n  *viennagrid::segment_element_info( seg0, tri0 ) = true;\n  std::cout << \"Triangle 0 in Segment 0: \" <<  *viennagrid::segment_element_info( seg0, tri0 ) << std::endl;\n  std::cout << std::endl;\n\n  \/\/ printing all triangles from all segments\n  typedef viennagrid::result_of::element_range< SegmentHandleType, viennagrid::triangle_tag >::type RangeType;\n\n  std::cout << \"Triangles of Segment 0\" << std::endl;\n  RangeType range( seg0 );\n  for (RangeType::iterator it = range.begin(); it != range.end(); ++it)\n    std::cout << *it << std::endl;\n\n  std::cout << \"Triangles of Segment 1\" << std::endl;\n  range = RangeType( seg1 );\n  for (RangeType::iterator it = range.begin(); it != range.end(); ++it)\n    std::cout << *it << std::endl;\n\n  std::cout << \"Triangles of Segment 2\" << std::endl;\n  range = RangeType( seg2 );\n  for (RangeType::iterator it = range.begin(); it != range.end(); ++it)\n    std::cout << *it << std::endl;\n\n  std::cout << std::endl;\n\n  \/\/ Adding additional triangles to seg2 and printing them\n  viennagrid::make_triangle( seg2, vh1, vh4, vh5 );\n  viennagrid::make_triangle( seg2, vh2, vh4, vh5 );\n\n  std::cout << \"Triangles of Segment 2, added 2 additional\" << std::endl;\n  range = RangeType( seg2 );\n  for (RangeType::iterator it = range.begin(); it != range.end(); ++it)\n    std::cout << *it << std::endl;\n  std::cout << std::endl;\n\n  \/\/ Printing vertices from seg2, each vertex should only be printed once\n  typedef viennagrid::result_of::vertex_range<SegmentHandleType>::type vertex_range;\n  std::cout << \"Vertices of Segment 2\" << std::endl;\n  vertex_range vertices( seg2 );\n  for (vertex_range::iterator it = vertices.begin(); it != vertices.end(); ++it)\n    std::cout << *it << std::endl;\n\n  std::cout << \"-----------------------------------------------\" << std::endl;\n  std::cout << \" \\\\o\/    Tutorial finished successfully!    \\\\o\/ \" << std::endl;\n  std::cout << \"-----------------------------------------------\" << std::endl;\n\n  return EXIT_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*M\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\r\n\/\/  IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.\r\n\/\/\r\n\/\/  By downloading, copying, installing or using the software you agree to this license.\r\n\/\/  If you do not agree to this license, do not download, install,\r\n\/\/  copy or use the software.\r\n\/\/\r\n\/\/\r\n\/\/                           License Agreement\r\n\/\/                For Open Source Computer Vision Library\r\n\/\/\r\n\/\/ Copyright (C) 2000-2008, Intel Corporation, all rights reserved.\r\n\/\/ Copyright (C) 2009, Willow Garage Inc., all rights reserved.\r\n\/\/ Third party copyrights are property of their respective owners.\r\n\/\/\r\n\/\/ Redistribution and use in source and binary forms, with or without modification,\r\n\/\/ are permitted provided that the following conditions are met:\r\n\/\/\r\n\/\/   * Redistribution's of source code must retain the above copyright notice,\r\n\/\/     this list of conditions and the following disclaimer.\r\n\/\/\r\n\/\/   * Redistribution's 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\n\/\/   * The name of the copyright holders may not 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 copyright holders and contributors \"as is\" and\r\n\/\/ any express or implied warranties, including, but not limited to, the implied\r\n\/\/ warranties of merchantability and fitness for a particular purpose are disclaimed.\r\n\/\/ In no event shall the Intel Corporation or contributors be liable for any direct,\r\n\/\/ 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\r\n\/\/ and on any theory of liability, whether in contract, strict liability,\r\n\/\/ or tort (including negligence or otherwise) arising in any way out of\r\n\/\/ the use of this software, even if advised of the possibility of such damage.\r\n\/\/\r\n\/\/M*\/\r\n\r\n#include \"precomp.hpp\"\r\n\r\n#if !defined(HAVE_CUDA)\r\n\r\nvoid cv::gpu::meanShiftSegmentation(const GpuMat&, Mat&, int, int, int, TermCriteria) { throw_nogpu(); }\r\n\r\n#else\r\n\r\nusing namespace std;\r\n\r\n\/\/ Auxiliray stuff\r\nnamespace\r\n{\r\n\r\n\/\/\r\n\/\/ Declarations\r\n\/\/\r\n\r\nclass DjSets\r\n{\r\npublic:\r\n    DjSets(int n);\r\n    int find(int elem);\r\n    int merge(int set1, int set2);\r\n\r\n    vector<int> parent;\r\n    vector<int> rank;\r\n    vector<int> size;\r\nprivate:\r\n    DjSets(const DjSets&);\r\n    void operator =(const DjSets&);\r\n};\r\n\r\n\r\ntemplate <typename T>\r\nstruct GraphEdge\r\n{\r\n    GraphEdge() {}\r\n    GraphEdge(int to, int next, const T& val) : to(to), next(next), val(val) {}\r\n    int to;\r\n    int next;\r\n    T val;\r\n};\r\n\r\n\r\ntemplate <typename T>\r\nclass Graph\r\n{\r\npublic:\r\n    typedef GraphEdge<T> Edge;\r\n\r\n    Graph(int numv, int nume_max);\r\n\r\n    void addEdge(int from, int to, const T& val=T());\r\n\r\n    vector<int> start;\r\n    vector<Edge> edges;\r\n\r\n    int numv;\r\n    int nume_max;\r\n    int nume;\r\nprivate:\r\n    Graph(const Graph&) {}\r\n    Graph operator =(const Graph&) {}\r\n};\r\n\r\n\r\nstruct SegmLinkVal\r\n{\r\n    SegmLinkVal() {}\r\n    SegmLinkVal(int dr, int dsp) : dr(dr), dsp(dsp) {}\r\n    bool operator <(const SegmLinkVal& other) const\r\n    {\r\n        return dr + dsp < other.dr + other.dsp;\r\n    }\r\n    int dr;\r\n    int dsp;\r\n};\r\n\r\n\r\nstruct SegmLink\r\n{\r\n    SegmLink() {}\r\n    SegmLink(int from, int to, const SegmLinkVal& val)\r\n        : from(from), to(to), val(val) {}\r\n    bool operator <(const SegmLink& other) const\r\n    {\r\n        return val < other.val;\r\n    }\r\n    int from;\r\n    int to;\r\n    SegmLinkVal val;\r\n};\r\n\r\n\/\/\r\n\/\/ Implementation\r\n\/\/\r\n\r\nDjSets::DjSets(int n) : parent(n), rank(n, 0), size(n, 1)\r\n{\r\n    for (int i = 0; i < n; ++i)\r\n        parent[i] = i;\r\n}\r\n\r\n\r\ninline int DjSets::find(int elem)\r\n{\r\n    int set = elem;\r\n    while (set != parent[set])\r\n        set = parent[set];\r\n    while (elem != parent[elem])\r\n    {\r\n        int next = parent[elem];\r\n        parent[elem] = set;\r\n        elem = next;\r\n    }\r\n    return set;\r\n}\r\n\r\n\r\ninline int DjSets::merge(int set1, int set2)\r\n{\r\n    if (rank[set1] < rank[set2])\r\n    {\r\n        parent[set1] = set2;\r\n        size[set2] += size[set1];\r\n        return set2;\r\n    }\r\n    if (rank[set2] < rank[set1])\r\n    {\r\n        parent[set2] = set1;\r\n        size[set1] += size[set2];\r\n        return set1;\r\n    }\r\n    parent[set1] = set2;\r\n    rank[set2]++;\r\n    size[set2] += size[set1];\r\n    return set2;\r\n}\r\n\r\n\r\ntemplate <typename T>\r\nGraph<T>::Graph(int numv, int nume_max) : start(numv, -1), edges(nume_max)\r\n{\r\n    this->numv = numv;\r\n    this->nume_max = nume_max;\r\n    nume = 0;\r\n}\r\n\r\n\r\ntemplate <typename T>\r\ninline void Graph<T>::addEdge(int from, int to, const T& val)\r\n{\r\n    edges[nume] = Edge(to, start[from], val);\r\n    start[from] = nume;\r\n    nume++;\r\n}\r\n\r\n\r\ninline int pix(int y, int x, int ncols)\r\n{\r\n    return y * ncols + x;\r\n}\r\n\r\n\r\ninline int sqr(int x)\r\n{\r\n    return x * x;\r\n}\r\n\r\n\r\ninline int dist2(const cv::Vec4b& lhs, const cv::Vec4b& rhs)\r\n{\r\n    return sqr(lhs[0] - rhs[0]) + sqr(lhs[1] - rhs[1]) + sqr(lhs[2] - rhs[2]);\r\n}\r\n\r\n\r\ninline int dist2(const cv::Vec2s& lhs, const cv::Vec2s& rhs)\r\n{\r\n    return sqr(lhs[0] - rhs[0]) + sqr(lhs[1] - rhs[1]);\r\n}\r\n\r\n} \/\/ anonymous namespace\r\n\r\n\r\nvoid cv::gpu::meanShiftSegmentation(const GpuMat& src, Mat& dst, int sp, int sr, int minsize, TermCriteria criteria)\r\n{\r\n    CV_Assert(src.type() == CV_8UC4);\r\n    const int nrows = src.rows;\r\n    const int ncols = src.cols;\r\n    const int hr = sr;\r\n    const int hsp = sp;\r\n\r\n    \/\/ Perform mean shift procedure and obtain region and spatial maps\r\n    GpuMat h_rmap, h_spmap;\r\n    meanShiftProc(src, h_rmap, h_spmap, sp, sr, criteria);\r\n    Mat rmap = h_rmap;\r\n    Mat spmap = h_spmap;\r\n\r\n    Graph<SegmLinkVal> g(nrows * ncols, 4 * (nrows - 1) * (ncols - 1)\r\n                                        + (nrows - 1) + (ncols - 1));\r\n\r\n    \/\/ Make region adjacent graph from image\r\n    Vec4b r1;\r\n    Vec4b r2[4];\r\n    Vec2s sp1;\r\n    Vec2s sp2[4];\r\n    int dr[4];\r\n    int dsp[4];\r\n    for (int y = 0; y < nrows - 1; ++y)\r\n    {\r\n        Vec4b* ry = rmap.ptr<Vec4b>(y);\r\n        Vec4b* ryp = rmap.ptr<Vec4b>(y + 1);\r\n        Vec2s* spy = spmap.ptr<Vec2s>(y);\r\n        Vec2s* spyp = spmap.ptr<Vec2s>(y + 1);\r\n        for (int x = 0; x < ncols - 1; ++x)\r\n        {\r\n            r1 = ry[x];\r\n            sp1 = spy[x];\r\n\r\n            r2[0] = ry[x + 1];\r\n            r2[1] = ryp[x];\r\n            r2[2] = ryp[x + 1];\r\n            r2[3] = ryp[x];\r\n\r\n            sp2[0] = spy[x + 1];\r\n            sp2[1] = spyp[x];\r\n            sp2[2] = spyp[x + 1];\r\n            sp2[3] = spyp[x];\r\n\r\n            dr[0] = dist2(r1, r2[0]);\r\n            dr[1] = dist2(r1, r2[1]);\r\n            dr[2] = dist2(r1, r2[2]);\r\n            dsp[0] = dist2(sp1, sp2[0]);\r\n            dsp[1] = dist2(sp1, sp2[1]);\r\n            dsp[2] = dist2(sp1, sp2[2]);\r\n\r\n            r1 = ry[x + 1];\r\n            sp1 = spy[x + 1];\r\n\r\n            dr[3] = dist2(r1, r2[3]);\r\n            dsp[3] = dist2(sp1, sp2[3]);\r\n\r\n            g.addEdge(pix(y, x, ncols), pix(y, x + 1, ncols), SegmLinkVal(dr[0], dsp[0]));\r\n            g.addEdge(pix(y, x, ncols), pix(y + 1, x, ncols), SegmLinkVal(dr[1], dsp[1]));\r\n            g.addEdge(pix(y, x, ncols), pix(y + 1, x + 1, ncols), SegmLinkVal(dr[2], dsp[2]));\r\n            g.addEdge(pix(y, x + 1, ncols), pix(y + 1, x, ncols), SegmLinkVal(dr[3], dsp[3]));\r\n        }\r\n    }\r\n    for (int y = 0; y < nrows - 1; ++y)\r\n    {\r\n        r1 = rmap.at<Vec4b>(y, ncols - 1);\r\n        r2[0] = rmap.at<Vec4b>(y + 1, ncols - 1);\r\n        sp1 = spmap.at<Vec2s>(y, ncols - 1);\r\n        sp2[0] = spmap.at<Vec2s>(y + 1, ncols - 1);\r\n        dr[0] = dist2(r1, r2[0]);\r\n        dsp[0] = dist2(sp1, sp2[0]);\r\n        g.addEdge(pix(y, ncols - 1, ncols), pix(y + 1, ncols - 1, ncols), SegmLinkVal(dr[0], dsp[0]));\r\n    }\r\n    for (int x = 0; x < ncols - 1; ++x)\r\n    {\r\n        r1 = rmap.at<Vec4b>(nrows - 1, x);\r\n        r2[0] = rmap.at<Vec4b>(nrows - 1, x + 1);\r\n        sp1 = spmap.at<Vec2s>(nrows - 1, x);\r\n        sp2[0] = spmap.at<Vec2s>(nrows - 1, x + 1);\r\n        dr[0] = dist2(r1, r2[0]);\r\n        dsp[0] = dist2(sp1, sp2[0]);\r\n        g.addEdge(pix(nrows - 1, x, ncols), pix(nrows - 1, x + 1, ncols), SegmLinkVal(dr[0], dsp[0]));\r\n    }\r\n\r\n    DjSets comps(g.numv);\r\n\r\n    \/\/ Find adjacent components\r\n    for (int v = 0; v < g.numv; ++v)\r\n    {\r\n        for (int e_it = g.start[v]; e_it != -1; e_it = g.edges[e_it].next)\r\n        {\r\n            int c1 = comps.find(v);\r\n            int c2 = comps.find(g.edges[e_it].to);\r\n            if (c1 != c2 && g.edges[e_it].val.dr < hr && g.edges[e_it].val.dsp < hsp)\r\n                comps.merge(c1, c2);\r\n        }\r\n    }\r\n\r\n    vector<SegmLink> edges;\r\n    edges.reserve(g.numv);\r\n\r\n    \/\/ Prepare edges connecting differnet components\r\n    for (int v = 0; v < g.numv; ++v)\r\n    {\r\n        int c1 = comps.find(v);\r\n        for (int e_it = g.start[v]; e_it != -1; e_it = g.edges[e_it].next)\r\n        {\r\n            int c2 = comps.find(g.edges[e_it].to);\r\n            if (c1 != c2)\r\n                edges.push_back(SegmLink(c1, c2, g.edges[e_it].val));\r\n        }\r\n    }\r\n\r\n    \/\/ Sort all graph's edges connecting differnet components (in asceding order)\r\n    sort(edges.begin(), edges.end());\r\n\r\n    \/\/ Exclude small components (starting from the nearest couple)\r\n    for (size_t i = 0; i < edges.size(); ++i)\r\n    {\r\n        int c1 = comps.find(edges[i].from);\r\n        int c2 = comps.find(edges[i].to);\r\n        if (c1 != c2 && (comps.size[c1] < minsize || comps.size[c2] < minsize))\r\n            comps.merge(c1, c2);\r\n    }\r\n\r\n    \/\/ Compute sum of the pixel's colors which are in the same segment\r\n    Mat h_src = src;\r\n    vector<Vec4i> sumcols(nrows * ncols, Vec4i(0, 0, 0, 0));\r\n    for (int y = 0; y < nrows; ++y)\r\n    {\r\n        Vec4b* h_srcy = h_src.ptr<Vec4b>(y);\r\n        for (int x = 0; x < ncols; ++x)\r\n        {\r\n            int parent = comps.find(pix(y, x, ncols));\r\n            Vec4b col = h_srcy[x];\r\n            Vec4i& sumcol = sumcols[parent];\r\n            sumcol[0] += col[0];\r\n            sumcol[1] += col[1];\r\n            sumcol[2] += col[2];\r\n        }\r\n    }\r\n\r\n    \/\/ Create final image, color of each segment is the average color of its pixels\r\n    dst.create(src.size(), src.type());\r\n\r\n    for (int y = 0; y < nrows; ++y)\r\n    {\r\n        Vec4b* dsty = dst.ptr<Vec4b>(y);\r\n        for (int x = 0; x < ncols; ++x)\r\n        {\r\n            int parent = comps.find(pix(y, x, ncols));\r\n            const Vec4i& sumcol = sumcols[parent];\r\n            Vec4b& dstcol = dsty[x];\r\n            dstcol[0] = static_cast<uchar>(sumcol[0] \/ comps.size[parent]);\r\n            dstcol[1] = static_cast<uchar>(sumcol[1] \/ comps.size[parent]);\r\n            dstcol[2] = static_cast<uchar>(sumcol[2] \/ comps.size[parent]);\r\n        }\r\n    }\r\n}\r\n\r\n#endif \/\/ #if !defined (HAVE_CUDA)\r\n<commit_msg>minor warning fixed<commit_after>\/*M\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\r\n\/\/  IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.\r\n\/\/\r\n\/\/  By downloading, copying, installing or using the software you agree to this license.\r\n\/\/  If you do not agree to this license, do not download, install,\r\n\/\/  copy or use the software.\r\n\/\/\r\n\/\/\r\n\/\/                           License Agreement\r\n\/\/                For Open Source Computer Vision Library\r\n\/\/\r\n\/\/ Copyright (C) 2000-2008, Intel Corporation, all rights reserved.\r\n\/\/ Copyright (C) 2009, Willow Garage Inc., all rights reserved.\r\n\/\/ Third party copyrights are property of their respective owners.\r\n\/\/\r\n\/\/ Redistribution and use in source and binary forms, with or without modification,\r\n\/\/ are permitted provided that the following conditions are met:\r\n\/\/\r\n\/\/   * Redistribution's of source code must retain the above copyright notice,\r\n\/\/     this list of conditions and the following disclaimer.\r\n\/\/\r\n\/\/   * Redistribution's 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\n\/\/   * The name of the copyright holders may not 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 copyright holders and contributors \"as is\" and\r\n\/\/ any express or implied warranties, including, but not limited to, the implied\r\n\/\/ warranties of merchantability and fitness for a particular purpose are disclaimed.\r\n\/\/ In no event shall the Intel Corporation or contributors be liable for any direct,\r\n\/\/ 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\r\n\/\/ and on any theory of liability, whether in contract, strict liability,\r\n\/\/ or tort (including negligence or otherwise) arising in any way out of\r\n\/\/ the use of this software, even if advised of the possibility of such damage.\r\n\/\/\r\n\/\/M*\/\r\n\r\n#include \"precomp.hpp\"\r\n\r\n#if !defined(HAVE_CUDA)\r\n\r\nvoid cv::gpu::meanShiftSegmentation(const GpuMat&, Mat&, int, int, int, TermCriteria) { throw_nogpu(); }\r\n\r\n#else\r\n\r\nusing namespace std;\r\n\r\n\/\/ Auxiliray stuff\r\nnamespace\r\n{\r\n\r\n\/\/\r\n\/\/ Declarations\r\n\/\/\r\n\r\nclass DjSets\r\n{\r\npublic:\r\n    DjSets(int n);\r\n    int find(int elem);\r\n    int merge(int set1, int set2);\r\n\r\n    vector<int> parent;\r\n    vector<int> rank;\r\n    vector<int> size;\r\nprivate:\r\n    DjSets(const DjSets&);\r\n    void operator =(const DjSets&);\r\n};\r\n\r\n\r\ntemplate <typename T>\r\nstruct GraphEdge\r\n{\r\n    GraphEdge() {}\r\n    GraphEdge(int to, int next, const T& val) : to(to), next(next), val(val) {}\r\n    int to;\r\n    int next;\r\n    T val;\r\n};\r\n\r\n\r\ntemplate <typename T>\r\nclass Graph\r\n{\r\npublic:\r\n    typedef GraphEdge<T> Edge;\r\n\r\n    Graph(int numv, int nume_max);\r\n\r\n    void addEdge(int from, int to, const T& val=T());\r\n\r\n    vector<int> start;\r\n    vector<Edge> edges;\r\n\r\n    int numv;\r\n    int nume_max;\r\n    int nume;\r\nprivate:\r\n    Graph(const Graph&);\r\n    void operator =(const Graph&);\r\n};\r\n\r\n\r\nstruct SegmLinkVal\r\n{\r\n    SegmLinkVal() {}\r\n    SegmLinkVal(int dr, int dsp) : dr(dr), dsp(dsp) {}\r\n    bool operator <(const SegmLinkVal& other) const\r\n    {\r\n        return dr + dsp < other.dr + other.dsp;\r\n    }\r\n    int dr;\r\n    int dsp;\r\n};\r\n\r\n\r\nstruct SegmLink\r\n{\r\n    SegmLink() {}\r\n    SegmLink(int from, int to, const SegmLinkVal& val)\r\n        : from(from), to(to), val(val) {}\r\n    bool operator <(const SegmLink& other) const\r\n    {\r\n        return val < other.val;\r\n    }\r\n    int from;\r\n    int to;\r\n    SegmLinkVal val;\r\n};\r\n\r\n\/\/\r\n\/\/ Implementation\r\n\/\/\r\n\r\nDjSets::DjSets(int n) : parent(n), rank(n, 0), size(n, 1)\r\n{\r\n    for (int i = 0; i < n; ++i)\r\n        parent[i] = i;\r\n}\r\n\r\n\r\ninline int DjSets::find(int elem)\r\n{\r\n    int set = elem;\r\n    while (set != parent[set])\r\n        set = parent[set];\r\n    while (elem != parent[elem])\r\n    {\r\n        int next = parent[elem];\r\n        parent[elem] = set;\r\n        elem = next;\r\n    }\r\n    return set;\r\n}\r\n\r\n\r\ninline int DjSets::merge(int set1, int set2)\r\n{\r\n    if (rank[set1] < rank[set2])\r\n    {\r\n        parent[set1] = set2;\r\n        size[set2] += size[set1];\r\n        return set2;\r\n    }\r\n    if (rank[set2] < rank[set1])\r\n    {\r\n        parent[set2] = set1;\r\n        size[set1] += size[set2];\r\n        return set1;\r\n    }\r\n    parent[set1] = set2;\r\n    rank[set2]++;\r\n    size[set2] += size[set1];\r\n    return set2;\r\n}\r\n\r\n\r\ntemplate <typename T>\r\nGraph<T>::Graph(int numv, int nume_max) : start(numv, -1), edges(nume_max)\r\n{\r\n    this->numv = numv;\r\n    this->nume_max = nume_max;\r\n    nume = 0;\r\n}\r\n\r\n\r\ntemplate <typename T>\r\ninline void Graph<T>::addEdge(int from, int to, const T& val)\r\n{\r\n    edges[nume] = Edge(to, start[from], val);\r\n    start[from] = nume;\r\n    nume++;\r\n}\r\n\r\n\r\ninline int pix(int y, int x, int ncols)\r\n{\r\n    return y * ncols + x;\r\n}\r\n\r\n\r\ninline int sqr(int x)\r\n{\r\n    return x * x;\r\n}\r\n\r\n\r\ninline int dist2(const cv::Vec4b& lhs, const cv::Vec4b& rhs)\r\n{\r\n    return sqr(lhs[0] - rhs[0]) + sqr(lhs[1] - rhs[1]) + sqr(lhs[2] - rhs[2]);\r\n}\r\n\r\n\r\ninline int dist2(const cv::Vec2s& lhs, const cv::Vec2s& rhs)\r\n{\r\n    return sqr(lhs[0] - rhs[0]) + sqr(lhs[1] - rhs[1]);\r\n}\r\n\r\n} \/\/ anonymous namespace\r\n\r\n\r\nvoid cv::gpu::meanShiftSegmentation(const GpuMat& src, Mat& dst, int sp, int sr, int minsize, TermCriteria criteria)\r\n{\r\n    CV_Assert(src.type() == CV_8UC4);\r\n    const int nrows = src.rows;\r\n    const int ncols = src.cols;\r\n    const int hr = sr;\r\n    const int hsp = sp;\r\n\r\n    \/\/ Perform mean shift procedure and obtain region and spatial maps\r\n    GpuMat h_rmap, h_spmap;\r\n    meanShiftProc(src, h_rmap, h_spmap, sp, sr, criteria);\r\n    Mat rmap = h_rmap;\r\n    Mat spmap = h_spmap;\r\n\r\n    Graph<SegmLinkVal> g(nrows * ncols, 4 * (nrows - 1) * (ncols - 1)\r\n                                        + (nrows - 1) + (ncols - 1));\r\n\r\n    \/\/ Make region adjacent graph from image\r\n    Vec4b r1;\r\n    Vec4b r2[4];\r\n    Vec2s sp1;\r\n    Vec2s sp2[4];\r\n    int dr[4];\r\n    int dsp[4];\r\n    for (int y = 0; y < nrows - 1; ++y)\r\n    {\r\n        Vec4b* ry = rmap.ptr<Vec4b>(y);\r\n        Vec4b* ryp = rmap.ptr<Vec4b>(y + 1);\r\n        Vec2s* spy = spmap.ptr<Vec2s>(y);\r\n        Vec2s* spyp = spmap.ptr<Vec2s>(y + 1);\r\n        for (int x = 0; x < ncols - 1; ++x)\r\n        {\r\n            r1 = ry[x];\r\n            sp1 = spy[x];\r\n\r\n            r2[0] = ry[x + 1];\r\n            r2[1] = ryp[x];\r\n            r2[2] = ryp[x + 1];\r\n            r2[3] = ryp[x];\r\n\r\n            sp2[0] = spy[x + 1];\r\n            sp2[1] = spyp[x];\r\n            sp2[2] = spyp[x + 1];\r\n            sp2[3] = spyp[x];\r\n\r\n            dr[0] = dist2(r1, r2[0]);\r\n            dr[1] = dist2(r1, r2[1]);\r\n            dr[2] = dist2(r1, r2[2]);\r\n            dsp[0] = dist2(sp1, sp2[0]);\r\n            dsp[1] = dist2(sp1, sp2[1]);\r\n            dsp[2] = dist2(sp1, sp2[2]);\r\n\r\n            r1 = ry[x + 1];\r\n            sp1 = spy[x + 1];\r\n\r\n            dr[3] = dist2(r1, r2[3]);\r\n            dsp[3] = dist2(sp1, sp2[3]);\r\n\r\n            g.addEdge(pix(y, x, ncols), pix(y, x + 1, ncols), SegmLinkVal(dr[0], dsp[0]));\r\n            g.addEdge(pix(y, x, ncols), pix(y + 1, x, ncols), SegmLinkVal(dr[1], dsp[1]));\r\n            g.addEdge(pix(y, x, ncols), pix(y + 1, x + 1, ncols), SegmLinkVal(dr[2], dsp[2]));\r\n            g.addEdge(pix(y, x + 1, ncols), pix(y + 1, x, ncols), SegmLinkVal(dr[3], dsp[3]));\r\n        }\r\n    }\r\n    for (int y = 0; y < nrows - 1; ++y)\r\n    {\r\n        r1 = rmap.at<Vec4b>(y, ncols - 1);\r\n        r2[0] = rmap.at<Vec4b>(y + 1, ncols - 1);\r\n        sp1 = spmap.at<Vec2s>(y, ncols - 1);\r\n        sp2[0] = spmap.at<Vec2s>(y + 1, ncols - 1);\r\n        dr[0] = dist2(r1, r2[0]);\r\n        dsp[0] = dist2(sp1, sp2[0]);\r\n        g.addEdge(pix(y, ncols - 1, ncols), pix(y + 1, ncols - 1, ncols), SegmLinkVal(dr[0], dsp[0]));\r\n    }\r\n    for (int x = 0; x < ncols - 1; ++x)\r\n    {\r\n        r1 = rmap.at<Vec4b>(nrows - 1, x);\r\n        r2[0] = rmap.at<Vec4b>(nrows - 1, x + 1);\r\n        sp1 = spmap.at<Vec2s>(nrows - 1, x);\r\n        sp2[0] = spmap.at<Vec2s>(nrows - 1, x + 1);\r\n        dr[0] = dist2(r1, r2[0]);\r\n        dsp[0] = dist2(sp1, sp2[0]);\r\n        g.addEdge(pix(nrows - 1, x, ncols), pix(nrows - 1, x + 1, ncols), SegmLinkVal(dr[0], dsp[0]));\r\n    }\r\n\r\n    DjSets comps(g.numv);\r\n\r\n    \/\/ Find adjacent components\r\n    for (int v = 0; v < g.numv; ++v)\r\n    {\r\n        for (int e_it = g.start[v]; e_it != -1; e_it = g.edges[e_it].next)\r\n        {\r\n            int c1 = comps.find(v);\r\n            int c2 = comps.find(g.edges[e_it].to);\r\n            if (c1 != c2 && g.edges[e_it].val.dr < hr && g.edges[e_it].val.dsp < hsp)\r\n                comps.merge(c1, c2);\r\n        }\r\n    }\r\n\r\n    vector<SegmLink> edges;\r\n    edges.reserve(g.numv);\r\n\r\n    \/\/ Prepare edges connecting differnet components\r\n    for (int v = 0; v < g.numv; ++v)\r\n    {\r\n        int c1 = comps.find(v);\r\n        for (int e_it = g.start[v]; e_it != -1; e_it = g.edges[e_it].next)\r\n        {\r\n            int c2 = comps.find(g.edges[e_it].to);\r\n            if (c1 != c2)\r\n                edges.push_back(SegmLink(c1, c2, g.edges[e_it].val));\r\n        }\r\n    }\r\n\r\n    \/\/ Sort all graph's edges connecting differnet components (in asceding order)\r\n    sort(edges.begin(), edges.end());\r\n\r\n    \/\/ Exclude small components (starting from the nearest couple)\r\n    for (size_t i = 0; i < edges.size(); ++i)\r\n    {\r\n        int c1 = comps.find(edges[i].from);\r\n        int c2 = comps.find(edges[i].to);\r\n        if (c1 != c2 && (comps.size[c1] < minsize || comps.size[c2] < minsize))\r\n            comps.merge(c1, c2);\r\n    }\r\n\r\n    \/\/ Compute sum of the pixel's colors which are in the same segment\r\n    Mat h_src = src;\r\n    vector<Vec4i> sumcols(nrows * ncols, Vec4i(0, 0, 0, 0));\r\n    for (int y = 0; y < nrows; ++y)\r\n    {\r\n        Vec4b* h_srcy = h_src.ptr<Vec4b>(y);\r\n        for (int x = 0; x < ncols; ++x)\r\n        {\r\n            int parent = comps.find(pix(y, x, ncols));\r\n            Vec4b col = h_srcy[x];\r\n            Vec4i& sumcol = sumcols[parent];\r\n            sumcol[0] += col[0];\r\n            sumcol[1] += col[1];\r\n            sumcol[2] += col[2];\r\n        }\r\n    }\r\n\r\n    \/\/ Create final image, color of each segment is the average color of its pixels\r\n    dst.create(src.size(), src.type());\r\n\r\n    for (int y = 0; y < nrows; ++y)\r\n    {\r\n        Vec4b* dsty = dst.ptr<Vec4b>(y);\r\n        for (int x = 0; x < ncols; ++x)\r\n        {\r\n            int parent = comps.find(pix(y, x, ncols));\r\n            const Vec4i& sumcol = sumcols[parent];\r\n            Vec4b& dstcol = dsty[x];\r\n            dstcol[0] = static_cast<uchar>(sumcol[0] \/ comps.size[parent]);\r\n            dstcol[1] = static_cast<uchar>(sumcol[1] \/ comps.size[parent]);\r\n            dstcol[2] = static_cast<uchar>(sumcol[2] \/ comps.size[parent]);\r\n        }\r\n    }\r\n}\r\n\r\n#endif \/\/ #if !defined (HAVE_CUDA)\r\n<|endoftext|>"}
{"text":"<commit_before>#include <yttrium\/memory\/buffer.h>\n\n#include \"pages.h\"\n\n#include <atomic>\n#include <cstring>\n#include <new>\n\n#if Y_IS_DEBUG\n\t#include <iostream>\n#endif\n\nnamespace Yttrium\n{\n\tnamespace\n\t{\n\t\tstruct BufferMemoryStatus\n\t\t{\n\t\t\tstd::atomic<size_t> _allocated{0};\n\t\t\tstd::atomic<size_t> _max_allocated{0};\n\n\t\t\tvoid on_allocated(size_t size)\n\t\t\t{\n\t\t\t\tauto old_allocated = _allocated.fetch_add(size);\n\t\t\t\tconst auto new_allocated = old_allocated + size;\n\t\t\t\twhile (!_max_allocated.compare_exchange_strong(old_allocated, new_allocated))\n\t\t\t\t\tif (old_allocated >= new_allocated)\n\t\t\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tvoid on_deallocated(size_t size)\n\t\t\t{\n\t\t\t\t_allocated.fetch_sub(size);\n\t\t\t}\n\n\t\t#if Y_IS_DEBUG\n\t\t\t~BufferMemoryStatus()\n\t\t\t{\n\t\t\t\tconst auto max_allocated = _max_allocated.load();\n\t\t\t\tstd::cerr << \"(DEBUG) Max buffer memory allocated: \" << max_allocated \/ 1024 << \" KiB\" << std::endl;\n\t\t\t\tconst auto allocated = _allocated.load();\n\t\t\t\tif (allocated > 0)\n\t\t\t\t\tstd::cerr << \"(ERROR) Buffer memory leaked: \" << allocated \/ 1024 << \" KiB\" << std::endl;\n\t\t\t}\n\t\t#endif\n\t\t};\n\n\t\tBufferMemoryStatus _buffer_memory_status;\n\t}\n\n\tBuffer::Buffer(size_t size)\n\t\t: _size(size)\n\t\t, _capacity(pages_size(_size))\n\t\t, _data(pages_allocate(_capacity))\n\t{\n\t\tif (!_data)\n\t\t\tthrow std::bad_alloc();\n\t\t_buffer_memory_status.on_allocated(_capacity);\n\t}\n\n\tvoid Buffer::reset(size_t size)\n\t{\n\t\tif (size > _capacity)\n\t\t{\n\t\t\tconst auto new_capacity = pages_size(size);\n\t\t\tconst auto new_data = _data ? pages_reallocate(_data, _capacity, new_capacity) : pages_allocate(new_capacity);\n\t\t\tif (!new_data)\n\t\t\t\tthrow std::bad_alloc();\n\t\t\t_buffer_memory_status.on_allocated(new_capacity - _capacity);\n\t\t\t_capacity = new_capacity;\n\t\t\t_data = new_data;\n\t\t}\n\t\t_size = size;\n\t}\n\n\tsize_t Buffer::max_memory_allocated() noexcept\n\t{\n\t\treturn _buffer_memory_status._max_allocated;\n\t}\n\n\tsize_t Buffer::memory_granularity() noexcept\n\t{\n\t\treturn pages_size(1);\n\t}\n\n\tBuffer::Buffer(Buffer&& other) noexcept\n\t\t: _size(other._size)\n\t\t, _capacity(other._capacity)\n\t\t, _data(other._data)\n\t{\n\t\tother._data = nullptr;\n\t}\n\n\tBuffer::~Buffer() noexcept\n\t{\n\t\tif (_data)\n\t\t{\n\t\t\tpages_deallocate(_data, _capacity);\n\t\t\t_buffer_memory_status.on_deallocated(_capacity);\n\t\t}\n\t}\n\n\tBuffer& Buffer::operator=(Buffer&& other) noexcept\n\t{\n\t\tif (_data)\n\t\t{\n\t\t\tpages_deallocate(_data, _capacity);\n\t\t\t_buffer_memory_status.on_deallocated(_capacity);\n\t\t}\n\t\t_size = other._size;\n\t\t_capacity = other._capacity;\n\t\t_data = other._data;\n\t\tother._data = nullptr;\n\t\treturn *this;\n\t}\n\n\tbool operator==(const Buffer& lhs, const Buffer& rhs) noexcept\n\t{\n\t\treturn lhs.size() == rhs.size() && (lhs.size() == 0 || !::memcmp(lhs.data(), rhs.data(), lhs.size()));\n\t}\n}\n<commit_msg>Wasted buffer memory tracking.<commit_after>#include <yttrium\/memory\/buffer.h>\n\n#include \"pages.h\"\n\n#include <atomic>\n#include <cstring>\n#include <new>\n\n#if Y_IS_DEBUG\n\t#include <iostream>\n#endif\n\n#define TRACK_WASTED_MEMORY Y_IS_DEBUG\n\nnamespace Yttrium\n{\n\tnamespace\n\t{\n\t\tstruct AtomicPair\n\t\t{\n\t\t\tstd::atomic<size_t> _value{0};\n\t\t\tstd::atomic<size_t> _max_value{0};\n\n\t\t\tvoid add(size_t difference)\n\t\t\t{\n\t\t\t\tauto old_value = _value.fetch_add(difference);\n\t\t\t\tconst auto new_value = old_value + difference;\n\t\t\t\twhile (!_max_value.compare_exchange_strong(old_value, new_value))\n\t\t\t\t\tif (old_value >= new_value)\n\t\t\t\t\t\tbreak;\n\t\t\t}\n\t\t};\n\n\t\tstruct BufferMemoryStatus\n\t\t{\n\t\t\tAtomicPair _allocated;\n\t\t#if TRACK_WASTED_MEMORY\n\t\t\tAtomicPair _wasted;\n\t\t#endif\n\n\t\t#if Y_IS_DEBUG\n\t\t\t~BufferMemoryStatus()\n\t\t\t{\n\t\t\t\tconst auto max_allocated = _allocated._max_value.load();\n\t\t\t\tstd::cerr << \"(DEBUG) Max buffer memory allocated: \" << max_allocated \/ 1024 << \" KiB\" << std::endl;\n\t\t\t#if TRACK_WASTED_MEMORY\n\t\t\t\tconst auto max_wasted = _wasted._max_value.load();\n\t\t\t\tstd::cerr << \"(DEBUG) Max buffer memory wasted: \" << max_wasted << \" B\" << std::endl;\n\t\t\t#endif\n\t\t\t\tconst auto allocated = _allocated._value.load();\n\t\t\t\tif (allocated > 0)\n\t\t\t\t\tstd::cerr << \"(ERROR) Buffer memory leaked: \" << allocated \/ 1024 << \" KiB\" << std::endl;\n\t\t\t}\n\t\t#endif\n\t\t};\n\n\t\tBufferMemoryStatus _buffer_memory_status;\n\t}\n\n\tBuffer::Buffer(size_t size)\n\t\t: _size(size)\n\t\t, _capacity(pages_size(_size))\n\t\t, _data(pages_allocate(_capacity))\n\t{\n\t\tif (!_data)\n\t\t\tthrow std::bad_alloc();\n\t\t_buffer_memory_status._allocated.add(_capacity);\n\t#if TRACK_WASTED_MEMORY\n\t\tif (_capacity > _size)\n\t\t\t_buffer_memory_status._wasted.add(_capacity - _size);\n\t#endif\n\t}\n\n\tvoid Buffer::reset(size_t size)\n\t{\n\t\tif (size > _capacity)\n\t\t{\n\t\t\tconst auto new_capacity = pages_size(size);\n\t\t\tconst auto new_data = _data ? pages_reallocate(_data, _capacity, new_capacity) : pages_allocate(new_capacity);\n\t\t\tif (!new_data)\n\t\t\t\tthrow std::bad_alloc();\n\t\t#if TRACK_WASTED_MEMORY\n\t\t\t_buffer_memory_status._wasted._value.fetch_sub(_capacity - _size);\n\t\t#endif\n\t\t\t_buffer_memory_status._allocated.add(new_capacity - _capacity);\n\t\t#if TRACK_WASTED_MEMORY\n\t\t\t_buffer_memory_status._wasted.add(new_capacity - size);\n\t\t#endif\n\t\t\t_capacity = new_capacity;\n\t\t\t_data = new_data;\n\t\t}\n\t#if TRACK_WASTED_MEMORY\n\t\telse if (size < _size)\n\t\t\t_buffer_memory_status._wasted.add(_size - size);\n\t\telse\n\t\t\t_buffer_memory_status._wasted._value.fetch_sub(size - _size);\n\t#endif\n\t\t_size = size;\n\t}\n\n\tsize_t Buffer::max_memory_allocated() noexcept\n\t{\n\t\treturn _buffer_memory_status._allocated._max_value;\n\t}\n\n\tsize_t Buffer::memory_granularity() noexcept\n\t{\n\t\treturn pages_size(1);\n\t}\n\n\tBuffer::Buffer(Buffer&& other) noexcept\n\t\t: _size(other._size)\n\t\t, _capacity(other._capacity)\n\t\t, _data(other._data)\n\t{\n\t\tother._data = nullptr;\n\t}\n\n\tBuffer::~Buffer() noexcept\n\t{\n\t\tif (_data)\n\t\t{\n\t\t\tpages_deallocate(_data, _capacity);\n\t\t#if TRACK_WASTED_MEMORY\n\t\t\t_buffer_memory_status._wasted._value.fetch_sub(_capacity - _size);\n\t\t#endif\n\t\t\t_buffer_memory_status._allocated._value.fetch_sub(_capacity);\n\t\t}\n\t}\n\n\tBuffer& Buffer::operator=(Buffer&& other) noexcept\n\t{\n\t\tif (_data)\n\t\t{\n\t\t\tpages_deallocate(_data, _capacity);\n\t\t#if TRACK_WASTED_MEMORY\n\t\t\t_buffer_memory_status._wasted._value.fetch_sub(_capacity - _size);\n\t\t#endif\n\t\t\t_buffer_memory_status._allocated._value.fetch_sub(_capacity);\n\t\t}\n\t\t_size = other._size;\n\t\t_capacity = other._capacity;\n\t\t_data = other._data;\n\t\tother._data = nullptr;\n\t\treturn *this;\n\t}\n\n\tbool operator==(const Buffer& lhs, const Buffer& rhs) noexcept\n\t{\n\t\treturn lhs.size() == rhs.size() && (lhs.size() == 0 || !::memcmp(lhs.data(), rhs.data(), lhs.size()));\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* This file is part of Strigi Desktop Search\n *\n * Copyright (C) 2006 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 \"analyzerloader.h\"\n#include \"analyzerplugin.h\"\n#include <string>\n#include <cstdio>\n#include <cstring>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <stgdirent.h>\n\n#ifndef _WIN32\n#include <dlfcn.h>\n#define DLSYM dlsym\n#define DLCLOSE dlclose\n#else\n#define DLSYM GetProcAddress\n#define DLCLOSE FreeLibrary\n#endif\n\n#ifndef _WIN32\ntypedef void* StgModuleType;\n#else\n#include <windows.h>\ntypedef HMODULE StgModuleType;\n#endif\n\nusing namespace std;\nusing namespace Strigi;\n\nclass AnalyzerLoader::Private {\npublic:\n    class Module {\n    private:\n        const StgModuleType mod;\n    public:\n        Module(StgModuleType m, const AnalyzerFactoryFactory* f)\n            :mod(m), factory(f) {}\n        ~Module();\n        const AnalyzerFactoryFactory* factory;\n    };\n    class ModuleList {\n    public:\n        std::map<std::string, Module*> modules;\n\n        ModuleList();\n        ~ModuleList();\n    };\n    static ModuleList modulelist;\n    static void loadModule(const char* lib);\n};\n\nAnalyzerLoader::Private::ModuleList AnalyzerLoader::Private::modulelist;\n\nAnalyzerLoader::Private::ModuleList::ModuleList() {\n}\nAnalyzerLoader::Private::ModuleList::~ModuleList() {\n    map<string, Module*>::iterator i;\n    for (i = modules.begin(); i != modules.end(); ++i) {\n        delete i->second;\n    }\n}\n\nAnalyzerLoader::Private::Module::~Module() {\n    void(*f)(const AnalyzerFactoryFactory*)\n        = (void(*)(const AnalyzerFactoryFactory*))\n        DLSYM(mod, \"deleteStrigiAnalyzerFactory\");\n    if (f) {\n        f(factory);\n    }\n    DLCLOSE(mod);\n}\n\nvoid\nAnalyzerLoader::loadPlugins(const char* d) {\n    DIR *dir = opendir(d);\n    if (dir == 0) {\n        \/\/ TODO handle error\n        return;\n    }\n    struct dirent* ent = readdir(dir);\n    int iOffset = 0;\n#ifdef WIN32\n# ifdef _MSC_VER\n    iOffset = 5;    \/\/ strlen(\"msvc_\")\n# else\n    iOffset = 6;    \/\/ strlen(\"mingw_\")\n# endif\n#endif\n    while(ent) {\n        size_t len = strlen(ent->d_name);\n        if ((strncmp(ent->d_name + iOffset, \"strigita_\", 9) == 0\n                || strncmp(ent->d_name + iOffset, \"strigiea_\", 9) == 0\n                || strncmp(ent->d_name + iOffset, \"strigila_\", 9) == 0)\n#ifdef WIN32\n                && strcmp(ent->d_name+len-4, \".dll\") == 0\n# ifdef _MSC_VER\n                && strncmp(ent->d_name, \"msvc_\", 5) == 0) {\n# else\n                && strncmp(ent->d_name, \"mingw_\", 6) == 0) {\n# endif\n#else\n                && strcmp(ent->d_name+len-3, \".so\") == 0) {\n#endif\n            string plugin = d;\n            if (plugin[plugin.length()-1] != '\/') {\n                plugin.append(\"\/\");\n            }\n            plugin.append(ent->d_name);\n            \/\/ check that the file is a regular file\n            struct stat s;\n            if (stat(plugin.c_str(), &s) == 0 && (S_IFREG & s.st_mode)) {\n                Private::loadModule(plugin.c_str());\n            }\n        }\n        ent = readdir(dir);\n    }\n    closedir(dir);\n}\nvoid\nAnalyzerLoader::Private::loadModule(const char* lib) {\n    \/\/fprintf(stderr, \"load lib %s\\n\", lib);\n    if (modulelist.modules.find(lib) != modulelist.modules.end()) {\n        \/\/ module was already loaded\n        return;\n    }\n    fprintf(stderr, \"%s\\n\", lib);\n    StgModuleType handle;\n#ifdef HAVE_DLFCN_H\n    handle = dlopen(lib, RTLD_LAZY);\n#else\n    handle = LoadLibrary(lib);\n#endif\n    if (!handle) {\n        return;\n    }\n    const AnalyzerFactoryFactory* (*f)() = (const AnalyzerFactoryFactory* (*)())\n        DLSYM(handle, \"strigiAnalyzerFactory\");\n    if (!f) {\n#ifndef WIN32\n        fprintf(stderr, \"%s\\n\", dlerror());\n#else\n        fprintf(stderr, \"GetLastError: %d\\n\", GetLastError());\n#endif\n        DLCLOSE(handle);\n        return;\n    }\n    AnalyzerLoader::Private::modulelist.modules[lib] = new Module(handle, f());\n}\nlist<StreamEndAnalyzerFactory*>\nAnalyzerLoader::streamEndAnalyzerFactories() {\n    list<StreamEndAnalyzerFactory*> l;\n    map<string, Private::Module*>::iterator i;\n    for (i = Private::modulelist.modules.begin();\n            i != Private::modulelist.modules.end(); ++i) {\n        list<StreamEndAnalyzerFactory*> ml\n            = i->second->factory->streamEndAnalyzerFactories();\n        copy(ml.begin(), ml.end(), back_inserter(l));\n    }\n    return l;\n}\nlist<StreamThroughAnalyzerFactory*>\nAnalyzerLoader::streamThroughAnalyzerFactories() {\n    list<StreamThroughAnalyzerFactory*> l;\n    map<string, Private::Module*>::iterator i;\n    for (i = Private::modulelist.modules.begin();\n            i != Private::modulelist.modules.end(); ++i) {\n        list<StreamThroughAnalyzerFactory*> ml\n            = i->second->factory->streamThroughAnalyzerFactories();\n        copy(ml.begin(), ml.end(), back_inserter(l));\n    }\n    return l;\n}\nlist<StreamSaxAnalyzerFactory*>\nAnalyzerLoader::streamSaxAnalyzerFactories() {\n    list<StreamSaxAnalyzerFactory*> l;\n    map<string, Private::Module*>::iterator i;\n    for (i = Private::modulelist.modules.begin();\n            i != Private::modulelist.modules.end(); ++i) {\n        list<StreamSaxAnalyzerFactory*> ml\n            = i->second->factory->streamSaxAnalyzerFactories();\n        copy(ml.begin(), ml.end(), back_inserter(l));\n    }\n    return l;\n}\nlist<StreamLineAnalyzerFactory*>\nAnalyzerLoader::streamLineAnalyzerFactories() {\n    list<StreamLineAnalyzerFactory*> l;\n    map<string, Private::Module*>::iterator i;\n    for (i = Private::modulelist.modules.begin();\n            i != Private::modulelist.modules.end(); ++i) {\n        list<StreamLineAnalyzerFactory*> ml\n            = i->second->factory->streamLineAnalyzerFactories();\n        copy(ml.begin(), ml.end(), back_inserter(l));\n    }\n    return l;\n}\nlist<StreamEventAnalyzerFactory*>\nAnalyzerLoader::streamEventAnalyzerFactories() {\n    list<StreamEventAnalyzerFactory*> l;\n    map<string, Private::Module*>::iterator i;\n    for (i = Private::modulelist.modules.begin();\n            i != Private::modulelist.modules.end(); ++i) {\n        list<StreamEventAnalyzerFactory*> ml\n            = i->second->factory->streamEventAnalyzerFactories();\n        copy(ml.begin(), ml.end(), back_inserter(l));\n    }\n    return l;\n}\n<commit_msg>added RTLD_GLOBAL to dlopen() as was recommended by Geoffrey Hutchison to avoid the problems with loading libopenbabel and its modules<commit_after>\/* This file is part of Strigi Desktop Search\n *\n * Copyright (C) 2006 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 \"analyzerloader.h\"\n#include \"analyzerplugin.h\"\n#include <string>\n#include <cstdio>\n#include <cstring>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <stgdirent.h>\n\n#ifndef _WIN32\n#include <dlfcn.h>\n#define DLSYM dlsym\n#define DLCLOSE dlclose\n#else\n#define DLSYM GetProcAddress\n#define DLCLOSE FreeLibrary\n#endif\n\n#ifndef _WIN32\ntypedef void* StgModuleType;\n#else\n#include <windows.h>\ntypedef HMODULE StgModuleType;\n#endif\n\nusing namespace std;\nusing namespace Strigi;\n\nclass AnalyzerLoader::Private {\npublic:\n    class Module {\n    private:\n        const StgModuleType mod;\n    public:\n        Module(StgModuleType m, const AnalyzerFactoryFactory* f)\n            :mod(m), factory(f) {}\n        ~Module();\n        const AnalyzerFactoryFactory* factory;\n    };\n    class ModuleList {\n    public:\n        std::map<std::string, Module*> modules;\n\n        ModuleList();\n        ~ModuleList();\n    };\n    static ModuleList modulelist;\n    static void loadModule(const char* lib);\n};\n\nAnalyzerLoader::Private::ModuleList AnalyzerLoader::Private::modulelist;\n\nAnalyzerLoader::Private::ModuleList::ModuleList() {\n}\nAnalyzerLoader::Private::ModuleList::~ModuleList() {\n    map<string, Module*>::iterator i;\n    for (i = modules.begin(); i != modules.end(); ++i) {\n        delete i->second;\n    }\n}\n\nAnalyzerLoader::Private::Module::~Module() {\n    void(*f)(const AnalyzerFactoryFactory*)\n        = (void(*)(const AnalyzerFactoryFactory*))\n        DLSYM(mod, \"deleteStrigiAnalyzerFactory\");\n    if (f) {\n        f(factory);\n    }\n    DLCLOSE(mod);\n}\n\nvoid\nAnalyzerLoader::loadPlugins(const char* d) {\n    DIR *dir = opendir(d);\n    if (dir == 0) {\n        \/\/ TODO handle error\n        return;\n    }\n    struct dirent* ent = readdir(dir);\n    int iOffset = 0;\n#ifdef WIN32\n# ifdef _MSC_VER\n    iOffset = 5;    \/\/ strlen(\"msvc_\")\n# else\n    iOffset = 6;    \/\/ strlen(\"mingw_\")\n# endif\n#endif\n    while(ent) {\n        size_t len = strlen(ent->d_name);\n        if ((strncmp(ent->d_name + iOffset, \"strigita_\", 9) == 0\n                || strncmp(ent->d_name + iOffset, \"strigiea_\", 9) == 0\n                || strncmp(ent->d_name + iOffset, \"strigila_\", 9) == 0)\n#ifdef WIN32\n                && strcmp(ent->d_name+len-4, \".dll\") == 0\n# ifdef _MSC_VER\n                && strncmp(ent->d_name, \"msvc_\", 5) == 0) {\n# else\n                && strncmp(ent->d_name, \"mingw_\", 6) == 0) {\n# endif\n#else\n                && strcmp(ent->d_name+len-3, \".so\") == 0) {\n#endif\n            string plugin = d;\n            if (plugin[plugin.length()-1] != '\/') {\n                plugin.append(\"\/\");\n            }\n            plugin.append(ent->d_name);\n            \/\/ check that the file is a regular file\n            struct stat s;\n            if (stat(plugin.c_str(), &s) == 0 && (S_IFREG & s.st_mode)) {\n                Private::loadModule(plugin.c_str());\n            }\n        }\n        ent = readdir(dir);\n    }\n    closedir(dir);\n}\nvoid\nAnalyzerLoader::Private::loadModule(const char* lib) {\n    \/\/fprintf(stderr, \"load lib %s\\n\", lib);\n    if (modulelist.modules.find(lib) != modulelist.modules.end()) {\n        \/\/ module was already loaded\n        return;\n    }\n    fprintf(stderr, \"%s\\n\", lib);\n    StgModuleType handle;\n#ifdef HAVE_DLFCN_H\n    handle = dlopen(lib, RTLD_LAZY | RTLD_GLOBAL);\n#else\n    handle = LoadLibrary(lib);\n#endif\n    if (!handle) {\n        return;\n    }\n    const AnalyzerFactoryFactory* (*f)() = (const AnalyzerFactoryFactory* (*)())\n        DLSYM(handle, \"strigiAnalyzerFactory\");\n    if (!f) {\n#ifndef WIN32\n        fprintf(stderr, \"%s\\n\", dlerror());\n#else\n        fprintf(stderr, \"GetLastError: %d\\n\", GetLastError());\n#endif\n        DLCLOSE(handle);\n        return;\n    }\n    AnalyzerLoader::Private::modulelist.modules[lib] = new Module(handle, f());\n}\nlist<StreamEndAnalyzerFactory*>\nAnalyzerLoader::streamEndAnalyzerFactories() {\n    list<StreamEndAnalyzerFactory*> l;\n    map<string, Private::Module*>::iterator i;\n    for (i = Private::modulelist.modules.begin();\n            i != Private::modulelist.modules.end(); ++i) {\n        list<StreamEndAnalyzerFactory*> ml\n            = i->second->factory->streamEndAnalyzerFactories();\n        copy(ml.begin(), ml.end(), back_inserter(l));\n    }\n    return l;\n}\nlist<StreamThroughAnalyzerFactory*>\nAnalyzerLoader::streamThroughAnalyzerFactories() {\n    list<StreamThroughAnalyzerFactory*> l;\n    map<string, Private::Module*>::iterator i;\n    for (i = Private::modulelist.modules.begin();\n            i != Private::modulelist.modules.end(); ++i) {\n        list<StreamThroughAnalyzerFactory*> ml\n            = i->second->factory->streamThroughAnalyzerFactories();\n        copy(ml.begin(), ml.end(), back_inserter(l));\n    }\n    return l;\n}\nlist<StreamSaxAnalyzerFactory*>\nAnalyzerLoader::streamSaxAnalyzerFactories() {\n    list<StreamSaxAnalyzerFactory*> l;\n    map<string, Private::Module*>::iterator i;\n    for (i = Private::modulelist.modules.begin();\n            i != Private::modulelist.modules.end(); ++i) {\n        list<StreamSaxAnalyzerFactory*> ml\n            = i->second->factory->streamSaxAnalyzerFactories();\n        copy(ml.begin(), ml.end(), back_inserter(l));\n    }\n    return l;\n}\nlist<StreamLineAnalyzerFactory*>\nAnalyzerLoader::streamLineAnalyzerFactories() {\n    list<StreamLineAnalyzerFactory*> l;\n    map<string, Private::Module*>::iterator i;\n    for (i = Private::modulelist.modules.begin();\n            i != Private::modulelist.modules.end(); ++i) {\n        list<StreamLineAnalyzerFactory*> ml\n            = i->second->factory->streamLineAnalyzerFactories();\n        copy(ml.begin(), ml.end(), back_inserter(l));\n    }\n    return l;\n}\nlist<StreamEventAnalyzerFactory*>\nAnalyzerLoader::streamEventAnalyzerFactories() {\n    list<StreamEventAnalyzerFactory*> l;\n    map<string, Private::Module*>::iterator i;\n    for (i = Private::modulelist.modules.begin();\n            i != Private::modulelist.modules.end(); ++i) {\n        list<StreamEventAnalyzerFactory*> ml\n            = i->second->factory->streamEventAnalyzerFactories();\n        copy(ml.begin(), ml.end(), back_inserter(l));\n    }\n    return l;\n}\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 (qt-info@nokia.com)\n**\n** This file is part of the QtSystems module of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the 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 \"qbatteryinfo_linux_p.h\"\n\n#include <QtCore\/qdir.h>\n#include <QtCore\/qfile.h>\n#include <QtCore\/qtimer.h>\n\nQT_BEGIN_NAMESPACE\n\nstatic const QString BATTERY_SYSFS_PATH(QString::fromAscii(\"\/sys\/class\/power_supply\/BAT%1\/\"));\n\nQBatteryInfoPrivate::QBatteryInfoPrivate(QBatteryInfo *parent)\n    : QObject(parent)\n    , q_ptr(parent)\n    , watchBatteryCount(false)\n    , watchChargerType(false)\n    , watchChargingState(false)\n    , watchCurrentFlow(false)\n    , watchRemainingCapacity(false)\n    , watchRemainingChargingTime(false)\n    , watchVoltage(false)\n    , batteryCounts(-1)\n    , timer(0)\n    , currentChargerType(QBatteryInfo::UnknownCharger)\n{\n}\n\nQBatteryInfoPrivate::~QBatteryInfoPrivate()\n{\n    delete timer;\n}\n\nint QBatteryInfoPrivate::batteryCount()\n{\n    if (batteryCounts == -1)\n        return updateBatteryCount();\n\n    return batteryCounts;\n}\n\nint QBatteryInfoPrivate::currentFlow(int battery)\n{\n    if (currentFlows.isEmpty())\n        return updateCurrentFlow(battery);\n\n    return currentFlows.value(battery);\n}\n\nint QBatteryInfoPrivate::maximumCapacity(int battery)\n{\n    QFile maximum(BATTERY_SYSFS_PATH.arg(battery) + QString::fromAscii(\"charge_full\"));\n    if (!maximum.open(QIODevice::ReadOnly))\n        return -1;\n\n    bool ok = false;\n    int capacity = maximum.readAll().simplified().toInt(&ok);\n    if (ok)\n        return capacity \/ 1000;\n    return -1;\n}\n\nint QBatteryInfoPrivate::remainingCapacity(int battery)\n{\n    if (currentRemainingCapacities.isEmpty())\n        return updateRemainingCapacity(battery);\n\n    return currentRemainingCapacities.value(battery);\n}\n\nint QBatteryInfoPrivate::remainingChargingTime(int battery)\n{\n    if (currentRemainingChargingTimes.isEmpty())\n        return updateRemainingChargingTime(battery);\n\n    return currentRemainingCapacities.value(battery);\n}\n\nint QBatteryInfoPrivate::voltage(int battery)\n{\n    if (currentVoltages.isEmpty())\n        return updateVoltage(battery);\n\n    return currentVoltages.value(battery);\n}\n\nQBatteryInfo::ChargerType QBatteryInfoPrivate::chargerType()\n{\n    if (currentChargerType == QBatteryInfo::UnknownCharger)\n        return updateChargerType();\n\n    return currentChargerType;\n}\n\nQBatteryInfo::ChargingState QBatteryInfoPrivate::chargingState(int battery)\n{\n    if (currentChargingStates.isEmpty())\n        return updateChargingState(battery);\n\n    return currentChargingStates.value(battery);\n}\n\nQBatteryInfo::EnergyUnit QBatteryInfoPrivate::energyUnit()\n{\n    return QBatteryInfo::UnitmAh;\n}\n\nvoid QBatteryInfoPrivate::connectNotify(const char *signal)\n{\n    if (timer == 0) {\n        timer = new QTimer;\n        timer->setInterval(2000);\n        connect(timer, SIGNAL(timeout()), this, SLOT(onTimeout()));\n    }\n\n    if (!timer->isActive())\n        timer->start();\n\n    if (strcmp(signal, SIGNAL(batteryCountChanged(int))) == 0)\n        watchBatteryCount = true;\n    else if (strcmp(signal, SIGNAL(currentFlowChanged(int,int))) == 0)\n        watchCurrentFlow = true;\n    else if (strcmp(signal, SIGNAL(voltageChanged(int,int))) == 0)\n        watchVoltage = true;\n    else if (strcmp(signal, SIGNAL(remainingCapacityChanged(int,int))) == 0)\n        watchRemainingCapacity = true;\n    else if (strcmp(signal, SIGNAL(remainingChargingTimeChanged(int,int))) == 0)\n        watchRemainingChargingTime = true;\n    else if (strcmp(signal, SIGNAL(chargerTypeChanged(QBatteryInfo::ChargerType))) == 0)\n        watchChargerType = true;\n    else if (strcmp(signal, SIGNAL(chargingStateChanged(int,QBatteryInfo::ChargingState))) == 0)\n        watchChargingState = true;\n}\n\nvoid QBatteryInfoPrivate::disconnectNotify(const char *signal)\n{\n    if (strcmp(signal, SIGNAL(batteryCountChanged(int))) == 0) {\n        watchBatteryCount = false;\n        batteryCounts = -1;\n    } else if (strcmp(signal, SIGNAL(currentFlowChanged(int,int))) == 0) {\n        watchCurrentFlow = false;\n        currentFlows.clear();\n    } else if (strcmp(signal, SIGNAL(voltageChanged(int,int))) == 0) {\n        watchVoltage = false;\n        currentVoltages.clear();\n    } else if (strcmp(signal, SIGNAL(remainingCapacityChanged(int,int))) == 0) {\n        watchRemainingCapacity = false;\n        currentRemainingCapacities.clear();\n    } else if (strcmp(signal, SIGNAL(remainingChargingTimeChanged(int,int))) == 0) {\n        watchRemainingChargingTime = false;\n        currentRemainingChargingTimes.clear();\n    } else if (strcmp(signal, SIGNAL(chargerTypeChanged(QBatteryInfo::ChargerType))) == 0) {\n        watchChargerType = false;\n        currentChargerType = QBatteryInfo::UnknownCharger;\n    } else if (strcmp(signal, SIGNAL(chargingStateChanged(int,QBatteryInfo::ChargingState))) == 0) {\n        watchChargingState = false;\n        currentChargingStates.clear();\n    }\n\n    if (!watchCurrentFlow && !watchVoltage)\n        timer->stop();\n}\n\nvoid QBatteryInfoPrivate::onTimeout()\n{\n    int count = QDir(QString::fromAscii(\"\/sys\/class\/power_supply\/\")).entryList(QStringList() << QString::fromAscii(\"BAT*\")).size();\n    int value;\n    if (watchBatteryCount) {\n        value = updateBatteryCount();\n        if (batteryCounts != value) {\n            batteryCounts = value;\n            Q_EMIT batteryCountChanged(value);\n        }\n    }\n\n    for (int i = 0; i < count; ++i) {\n        if (watchCurrentFlow) {\n            value = updateCurrentFlow(i);\n            if (currentFlows.value(i) != value) {\n                currentFlows[i] = value;\n                Q_EMIT currentFlowChanged(i, value);\n            }\n        }\n\n        if (watchVoltage) {\n            value = updateVoltage(i);\n            if (currentVoltages.value(i) != value) {\n                currentVoltages[i] = value;\n                Q_EMIT voltageChanged(i, value);\n            }\n        }\n\n        if (watchRemainingCapacity) {\n            value = updateRemainingCapacity(i);\n            if (currentRemainingCapacities.value(i) != value) {\n                currentRemainingCapacities[i] = value;\n                Q_EMIT remainingCapacityChanged(i, value);\n            }\n        }\n\n        if (watchRemainingChargingTime) {\n            value = updateRemainingChargingTime(i);\n            if (currentRemainingChargingTimes.value(i) != value) {\n                currentRemainingChargingTimes[i] = value;\n                Q_EMIT remainingChargingTimeChanged(i, value);\n            }\n        }\n\n        if (watchChargerType) {\n            QBatteryInfo::ChargerType charger = updateChargerType();\n            if (currentChargerType != charger) {\n                currentChargerType = charger;\n                Q_EMIT chargerTypeChanged(charger);\n            }\n        }\n\n        if (watchChargingState) {\n            QBatteryInfo::ChargingState state = updateChargingState(i);\n            if (currentChargingStates.value(i) != state) {\n                currentChargingStates[i] = state;\n                Q_EMIT chargingStateChanged(i, state);\n            }\n        }\n    }\n}\n\nint QBatteryInfoPrivate::updateBatteryCount()\n{\n    return QDir(QString::fromAscii(\"\/sys\/class\/power_supply\/\")).entryList(QStringList() << QString::fromAscii(\"BAT*\")).size();\n}\n\nint QBatteryInfoPrivate::updateCurrentFlow(int battery)\n{\n    QBatteryInfo::ChargingState state = chargingState(battery);\n    if (state == QBatteryInfo::UnknownChargingState)\n        return 0;\n\n    QFile current(BATTERY_SYSFS_PATH.arg(battery) + QString::fromAscii(\"current_now\"));\n    if (!current.open(QIODevice::ReadOnly))\n        return 0;\n\n    bool ok = false;\n    int flow = current.readAll().simplified().toInt(&ok);\n    if (ok) {\n        if (state == QBatteryInfo::Charging)\n            return flow \/ -1000;\n        else if (state == QBatteryInfo::Discharging)\n            return flow \/ 1000;\n    }\n\n    return 0;\n}\n\nint QBatteryInfoPrivate::updateRemainingCapacity(int battery)\n{\n    QFile remaining(BATTERY_SYSFS_PATH.arg(battery) + QString::fromAscii(\"charge_now\"));\n    if (!remaining.open(QIODevice::ReadOnly))\n        return -1;\n\n    bool ok = false;\n    int capacity = remaining.readAll().simplified().toInt(&ok);\n    if (ok)\n        return capacity \/ 1000;\n    return -1;\n}\n\nint QBatteryInfoPrivate::updateRemainingChargingTime(int battery)\n{\n    QBatteryInfo::ChargingState state = chargingState(battery);\n    if (state == QBatteryInfo::UnknownChargingState)\n        return -1;\n    else if (state == QBatteryInfo::NotCharging || state == QBatteryInfo::Discharging)\n        return 0;\n\n    int max = 0;\n    int remaining = 0;\n    int current = 0;\n    if ((max = maximumCapacity(battery)) == -1\n        || (remaining = remainingCapacity(battery)) == -1\n        || (current = currentFlow(battery)) == 0) {\n        return -1;\n    }\n    return (max - remaining) * -3600 \/ current;\n}\n\nint QBatteryInfoPrivate::updateVoltage(int battery)\n{\n    QFile current(BATTERY_SYSFS_PATH.arg(battery) + QString::fromAscii(\"voltage_now\"));\n    if (!current.open(QIODevice::ReadOnly))\n        return -1;\n\n    bool ok = false;\n    int voltage = current.readAll().simplified().toInt(&ok);\n    if (ok)\n        return voltage \/ 1000;\n    return -1;\n}\n\nQBatteryInfo::ChargerType QBatteryInfoPrivate::updateChargerType()\n{\n    QFile charger(QString::fromAscii(\"\/sys\/class\/power_supply\/AC\/online\"));\n    if (charger.open(QIODevice::ReadOnly)) {\n        char online;\n        if (charger.read(&online, 1) == 1 && online == '1')\n            return QBatteryInfo::WallCharger;\n        charger.close();\n    }\n\n    charger.setFileName(QString::fromAscii(\"\/sys\/class\/power_supply\/usb\/present\"));\n    if (charger.open(QIODevice::ReadOnly)) {\n        char present;\n        if (charger.read(&present, 1) == 1 && present == '1') {\n            charger.close();\n            charger.setFileName(QString::fromAscii(\"\/sys\/class\/power_supply\/usb\/type\"));\n            if (charger.open(QIODevice::ReadOnly)) {\n                if (charger.readAll().simplified() == \"USB_DCP\")\n                    return QBatteryInfo::WallCharger;\n                return QBatteryInfo::USBCharger;\n            }\n        }\n        charger.close();\n    }\n\n    return QBatteryInfo::UnknownCharger;\n}\n\nQBatteryInfo::ChargingState QBatteryInfoPrivate::updateChargingState(int battery)\n{\n    QFile state(BATTERY_SYSFS_PATH.arg(battery) + QString::fromAscii(\"status\"));\n    if (!state.open(QIODevice::ReadOnly))\n        return QBatteryInfo::UnknownChargingState;\n\n    QByteArray status = state.readAll().simplified();\n    if (status == \"Charging\")\n        return QBatteryInfo::Charging;\n    else if (status == \"Discharging\")\n        return QBatteryInfo::Discharging;\n    else if (status == \"Full\")\n        return QBatteryInfo::NotCharging;\n\n    return QBatteryInfo::UnknownChargingState;\n}\n\nQT_END_NAMESPACE\n<commit_msg>Immediately update the buffered values when signal gets connected.<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2011 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 QtSystems module of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the 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 \"qbatteryinfo_linux_p.h\"\n\n#include <QtCore\/qdir.h>\n#include <QtCore\/qfile.h>\n#include <QtCore\/qtimer.h>\n\nQT_BEGIN_NAMESPACE\n\nstatic const QString BATTERY_SYSFS_PATH(QString::fromAscii(\"\/sys\/class\/power_supply\/BAT%1\/\"));\n\nQBatteryInfoPrivate::QBatteryInfoPrivate(QBatteryInfo *parent)\n    : QObject(parent)\n    , q_ptr(parent)\n    , watchBatteryCount(false)\n    , watchChargerType(false)\n    , watchChargingState(false)\n    , watchCurrentFlow(false)\n    , watchRemainingCapacity(false)\n    , watchRemainingChargingTime(false)\n    , watchVoltage(false)\n    , batteryCounts(-1)\n    , timer(0)\n    , currentChargerType(QBatteryInfo::UnknownCharger)\n{\n}\n\nQBatteryInfoPrivate::~QBatteryInfoPrivate()\n{\n    delete timer;\n}\n\nint QBatteryInfoPrivate::batteryCount()\n{\n    if (batteryCounts == -1)\n        return updateBatteryCount();\n\n    return batteryCounts;\n}\n\nint QBatteryInfoPrivate::currentFlow(int battery)\n{\n    if (currentFlows.isEmpty())\n        return updateCurrentFlow(battery);\n\n    return currentFlows.value(battery);\n}\n\nint QBatteryInfoPrivate::maximumCapacity(int battery)\n{\n    QFile maximum(BATTERY_SYSFS_PATH.arg(battery) + QString::fromAscii(\"charge_full\"));\n    if (!maximum.open(QIODevice::ReadOnly))\n        return -1;\n\n    bool ok = false;\n    int capacity = maximum.readAll().simplified().toInt(&ok);\n    if (ok)\n        return capacity \/ 1000;\n    return -1;\n}\n\nint QBatteryInfoPrivate::remainingCapacity(int battery)\n{\n    if (currentRemainingCapacities.isEmpty())\n        return updateRemainingCapacity(battery);\n\n    return currentRemainingCapacities.value(battery);\n}\n\nint QBatteryInfoPrivate::remainingChargingTime(int battery)\n{\n    if (currentRemainingChargingTimes.isEmpty())\n        return updateRemainingChargingTime(battery);\n\n    return currentRemainingCapacities.value(battery);\n}\n\nint QBatteryInfoPrivate::voltage(int battery)\n{\n    if (currentVoltages.isEmpty())\n        return updateVoltage(battery);\n\n    return currentVoltages.value(battery);\n}\n\nQBatteryInfo::ChargerType QBatteryInfoPrivate::chargerType()\n{\n    if (currentChargerType == QBatteryInfo::UnknownCharger)\n        return updateChargerType();\n\n    return currentChargerType;\n}\n\nQBatteryInfo::ChargingState QBatteryInfoPrivate::chargingState(int battery)\n{\n    if (currentChargingStates.isEmpty())\n        return updateChargingState(battery);\n\n    return currentChargingStates.value(battery);\n}\n\nQBatteryInfo::EnergyUnit QBatteryInfoPrivate::energyUnit()\n{\n    return QBatteryInfo::UnitmAh;\n}\n\nvoid QBatteryInfoPrivate::connectNotify(const char *signal)\n{\n    if (timer == 0) {\n        timer = new QTimer;\n        timer->setInterval(2000);\n        connect(timer, SIGNAL(timeout()), this, SLOT(onTimeout()));\n    }\n\n    if (!timer->isActive())\n        timer->start();\n\n    if (strcmp(signal, SIGNAL(batteryCountChanged(int))) == 0) {\n        watchBatteryCount = true;\n        batteryCounts = updateBatteryCount();\n    } else if (strcmp(signal, SIGNAL(currentFlowChanged(int,int))) == 0) {\n        watchCurrentFlow = true;\n        int count = batteryCount();\n        for (int i = 0; i < count; ++i)\n            currentFlows[i] = updateCurrentFlow(i);\n    } else if (strcmp(signal, SIGNAL(voltageChanged(int,int))) == 0) {\n        watchVoltage = true;\n        int count = batteryCount();\n        for (int i = 0; i < count; ++i)\n            currentVoltages[i] = updateVoltage(i);\n    } else if (strcmp(signal, SIGNAL(remainingCapacityChanged(int,int))) == 0) {\n        watchRemainingCapacity = true;\n        int count = batteryCount();\n        for (int i = 0; i < count; ++i)\n            currentRemainingCapacities[i] = updateRemainingCapacity(i);\n    } else if (strcmp(signal, SIGNAL(remainingChargingTimeChanged(int,int))) == 0) {\n        watchRemainingChargingTime = true;\n        int count = batteryCount();\n        for (int i = 0; i < count; ++i)\n            currentRemainingChargingTimes[i] = updateRemainingChargingTime(i);\n    } else if (strcmp(signal, SIGNAL(chargerTypeChanged(QBatteryInfo::ChargerType))) == 0) {\n        watchChargerType = true;\n        currentChargerType = updateChargerType();\n    } else if (strcmp(signal, SIGNAL(chargingStateChanged(int,QBatteryInfo::ChargingState))) == 0) {\n        watchChargingState = true;\n        int count = batteryCount();\n        for (int i = 0; i < count; ++i)\n            currentChargingStates[i] = updateChargingState(i);\n    }\n}\n\nvoid QBatteryInfoPrivate::disconnectNotify(const char *signal)\n{\n    if (strcmp(signal, SIGNAL(batteryCountChanged(int))) == 0) {\n        watchBatteryCount = false;\n        batteryCounts = -1;\n    } else if (strcmp(signal, SIGNAL(currentFlowChanged(int,int))) == 0) {\n        watchCurrentFlow = false;\n        currentFlows.clear();\n    } else if (strcmp(signal, SIGNAL(voltageChanged(int,int))) == 0) {\n        watchVoltage = false;\n        currentVoltages.clear();\n    } else if (strcmp(signal, SIGNAL(remainingCapacityChanged(int,int))) == 0) {\n        watchRemainingCapacity = false;\n        currentRemainingCapacities.clear();\n    } else if (strcmp(signal, SIGNAL(remainingChargingTimeChanged(int,int))) == 0) {\n        watchRemainingChargingTime = false;\n        currentRemainingChargingTimes.clear();\n    } else if (strcmp(signal, SIGNAL(chargerTypeChanged(QBatteryInfo::ChargerType))) == 0) {\n        watchChargerType = false;\n        currentChargerType = QBatteryInfo::UnknownCharger;\n    } else if (strcmp(signal, SIGNAL(chargingStateChanged(int,QBatteryInfo::ChargingState))) == 0) {\n        watchChargingState = false;\n        currentChargingStates.clear();\n    }\n\n    if (!watchCurrentFlow && !watchVoltage)\n        timer->stop();\n}\n\nvoid QBatteryInfoPrivate::onTimeout()\n{\n    int count = QDir(QString::fromAscii(\"\/sys\/class\/power_supply\/\")).entryList(QStringList() << QString::fromAscii(\"BAT*\")).size();\n    int value;\n    if (watchBatteryCount) {\n        value = updateBatteryCount();\n        if (batteryCounts != value) {\n            batteryCounts = value;\n            Q_EMIT batteryCountChanged(value);\n        }\n    }\n\n    for (int i = 0; i < count; ++i) {\n        if (watchCurrentFlow) {\n            value = updateCurrentFlow(i);\n            if (currentFlows.value(i) != value) {\n                currentFlows[i] = value;\n                Q_EMIT currentFlowChanged(i, value);\n            }\n        }\n\n        if (watchVoltage) {\n            value = updateVoltage(i);\n            if (currentVoltages.value(i) != value) {\n                currentVoltages[i] = value;\n                Q_EMIT voltageChanged(i, value);\n            }\n        }\n\n        if (watchRemainingCapacity) {\n            value = updateRemainingCapacity(i);\n            if (currentRemainingCapacities.value(i) != value) {\n                currentRemainingCapacities[i] = value;\n                Q_EMIT remainingCapacityChanged(i, value);\n            }\n        }\n\n        if (watchRemainingChargingTime) {\n            value = updateRemainingChargingTime(i);\n            if (currentRemainingChargingTimes.value(i) != value) {\n                currentRemainingChargingTimes[i] = value;\n                Q_EMIT remainingChargingTimeChanged(i, value);\n            }\n        }\n\n        if (watchChargerType) {\n            QBatteryInfo::ChargerType charger = updateChargerType();\n            if (currentChargerType != charger) {\n                currentChargerType = charger;\n                Q_EMIT chargerTypeChanged(charger);\n            }\n        }\n\n        if (watchChargingState) {\n            QBatteryInfo::ChargingState state = updateChargingState(i);\n            if (currentChargingStates.value(i) != state) {\n                currentChargingStates[i] = state;\n                Q_EMIT chargingStateChanged(i, state);\n            }\n        }\n    }\n}\n\nint QBatteryInfoPrivate::updateBatteryCount()\n{\n    return QDir(QString::fromAscii(\"\/sys\/class\/power_supply\/\")).entryList(QStringList() << QString::fromAscii(\"BAT*\")).size();\n}\n\nint QBatteryInfoPrivate::updateCurrentFlow(int battery)\n{\n    QBatteryInfo::ChargingState state = chargingState(battery);\n    if (state == QBatteryInfo::UnknownChargingState)\n        return 0;\n\n    QFile current(BATTERY_SYSFS_PATH.arg(battery) + QString::fromAscii(\"current_now\"));\n    if (!current.open(QIODevice::ReadOnly))\n        return 0;\n\n    bool ok = false;\n    int flow = current.readAll().simplified().toInt(&ok);\n    if (ok) {\n        if (state == QBatteryInfo::Charging)\n            return flow \/ -1000;\n        else if (state == QBatteryInfo::Discharging)\n            return flow \/ 1000;\n    }\n\n    return 0;\n}\n\nint QBatteryInfoPrivate::updateRemainingCapacity(int battery)\n{\n    QFile remaining(BATTERY_SYSFS_PATH.arg(battery) + QString::fromAscii(\"charge_now\"));\n    if (!remaining.open(QIODevice::ReadOnly))\n        return -1;\n\n    bool ok = false;\n    int capacity = remaining.readAll().simplified().toInt(&ok);\n    if (ok)\n        return capacity \/ 1000;\n    return -1;\n}\n\nint QBatteryInfoPrivate::updateRemainingChargingTime(int battery)\n{\n    QBatteryInfo::ChargingState state = chargingState(battery);\n    if (state == QBatteryInfo::UnknownChargingState)\n        return -1;\n    else if (state == QBatteryInfo::NotCharging || state == QBatteryInfo::Discharging)\n        return 0;\n\n    int max = 0;\n    int remaining = 0;\n    int current = 0;\n    if ((max = maximumCapacity(battery)) == -1\n        || (remaining = remainingCapacity(battery)) == -1\n        || (current = currentFlow(battery)) == 0) {\n        return -1;\n    }\n    return (max - remaining) * -3600 \/ current;\n}\n\nint QBatteryInfoPrivate::updateVoltage(int battery)\n{\n    QFile current(BATTERY_SYSFS_PATH.arg(battery) + QString::fromAscii(\"voltage_now\"));\n    if (!current.open(QIODevice::ReadOnly))\n        return -1;\n\n    bool ok = false;\n    int voltage = current.readAll().simplified().toInt(&ok);\n    if (ok)\n        return voltage \/ 1000;\n    return -1;\n}\n\nQBatteryInfo::ChargerType QBatteryInfoPrivate::updateChargerType()\n{\n    QFile charger(QString::fromAscii(\"\/sys\/class\/power_supply\/AC\/online\"));\n    if (charger.open(QIODevice::ReadOnly)) {\n        char online;\n        if (charger.read(&online, 1) == 1 && online == '1')\n            return QBatteryInfo::WallCharger;\n        charger.close();\n    }\n\n    charger.setFileName(QString::fromAscii(\"\/sys\/class\/power_supply\/usb\/present\"));\n    if (charger.open(QIODevice::ReadOnly)) {\n        char present;\n        if (charger.read(&present, 1) == 1 && present == '1') {\n            charger.close();\n            charger.setFileName(QString::fromAscii(\"\/sys\/class\/power_supply\/usb\/type\"));\n            if (charger.open(QIODevice::ReadOnly)) {\n                if (charger.readAll().simplified() == \"USB_DCP\")\n                    return QBatteryInfo::WallCharger;\n                return QBatteryInfo::USBCharger;\n            }\n        }\n        charger.close();\n    }\n\n    return QBatteryInfo::UnknownCharger;\n}\n\nQBatteryInfo::ChargingState QBatteryInfoPrivate::updateChargingState(int battery)\n{\n    QFile state(BATTERY_SYSFS_PATH.arg(battery) + QString::fromAscii(\"status\"));\n    if (!state.open(QIODevice::ReadOnly))\n        return QBatteryInfo::UnknownChargingState;\n\n    QByteArray status = state.readAll().simplified();\n    if (status == \"Charging\")\n        return QBatteryInfo::Charging;\n    else if (status == \"Discharging\")\n        return QBatteryInfo::Discharging;\n    else if (status == \"Full\")\n        return QBatteryInfo::NotCharging;\n\n    return QBatteryInfo::UnknownChargingState;\n}\n\nQT_END_NAMESPACE\n<|endoftext|>"}
{"text":"<commit_before>#include \"Flight.h\"\r\n#include \"List.h\"\r\n\r\nusing namespace std;\r\n\r\nFlight::Flight()\r\n{\r\n\tflightNumber = \"0\";\r\n}\r\n\r\nint Flight::getNumberOfPassangers()\r\n{\r\n\treturn passangerList.getSize();\r\n}\r\n\r\nbool Flight::cancelReservation(string passangerName)\r\n{\r\n\r\n\tif(!passangerList.isEmpty())\r\n\t\t{\r\n\t\t\tpassangerList.remove(passangerName);\r\n\t\t\treturn true;\r\n\t\t}\r\n\treturn false;\r\n}\r\n\r\nbool Flight::reserveSeat(string passangerName)\r\n{\r\n\r\n\tif(passangerList.isFull()) return false;\r\n\r\n\tif(passangerList.IsMember(passangerName)==true) return false;\r\n\r\n\tpassangerList.insert(passangerName);\r\n\r\n\treturn true;\r\n\r\n}\r\n\r\nvoid Flight::printPassangers()\r\n{\r\n\t\tpassangerList.print();\r\n}\r\n\r\nbool Flight::checkReservation(string passangerName)\r\n{\r\n\r\n\t\r\n\tif(passangerList.IsMember(passangerName)==true)\r\n\t\t{\r\n\t\t\treturn true;\r\n\t\t}\r\n\telse return false;\r\n}<commit_msg>.cpp file of the Flight class<commit_after>#include \"Flight.h\"\r\n#include \"List.h\"\r\n\r\nusing namespace std;\r\n\r\nFlight::Flight()\r\n{\r\n\tflightNumber = \"0\";\r\n}\r\n\r\nint Flight::getNumberOfPassangers()\r\n{\r\n\treturn passangerList.getSize();\r\n}\r\n\r\nbool Flight::cancelReservation(string passangerName)\r\n{\r\n\tif(!passangerList.isEmpty())\r\n\t\t{\r\n\t\t\tpassangerList.remove(passangerName);\r\n\t\t\treturn true;\r\n\t\t}\r\n\treturn false;\r\n}\r\n\r\nbool Flight::reserveSeat(string passangerName)\r\n{\r\n\r\n\tif(passangerList.isFull()) return false;\r\n\r\n\tif(passangerList.IsMember(passangerName)==true) return false;\r\n\r\n\tpassangerList.insert(passangerName);\r\n\r\n\treturn true;\r\n\r\n}\r\n\r\nvoid Flight::printPassangers()\r\n{\r\n\t\tpassangerList.print();\r\n}\r\n\r\nbool Flight::checkReservation(string passangerName)\r\n{\r\n\r\n\t\r\n\tif(passangerList.IsMember(passangerName)==true)\r\n\t\t{\r\n\t\t\treturn true;\r\n\t\t}\r\n\telse return false;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>#include \"Fontx2.h\"\n\n#define DBGLOG 0\n\nconst int ANK_DATA_START = 17;\n\nFontx2::Fontx2() :_width(0), _height(0), tnum(0), table(NULL) {\n}\n\nFontx2::~Fontx2() {\n  close();\n}\n\nint Fontx2::open(SdFatBase* sd, const char* filepath) {\n  \/\/ if already open, close and open\n  close();\n  if (!sdfile.open(sd, filepath, O_READ)) {\n    return -1;\n  }\n\n  \/\/ read header\n  \/\/ cf. http:\/\/kanpapa.com\/today\/2011\/11\/mbed-16dotfont-vfd.html\n  uint8_t header[18];\n  if (sdfile.read(header, 18) < 18) {\n    sdfile.close();\n    return -2;\n  }\n  \/\/ XXX: プログラムサイズを減らすためチェックは省略\n  \/\/if (strncmp(header, \"FONTX2\", 6) != 0) { \/\/ 00-05 \"FONTX2\"\n  \/\/  sdfile.close();\n  \/\/  return -2;\n  \/\/}\n  \/\/ XXX: サイズを減らすためfontNameは持たない\n  \/\/ 06-13 Font name\n  _width = header[14];\n  _height = header[15];\n  uint8_t codetype = header[16];\n#if DBGLOG\n  Serial.print(\"width: \"); Serial.println(_width);\n  Serial.print(\"height: \"); Serial.println(_height);\n  Serial.print(\"codetype: \"); Serial.println(codetype);\n#endif\n  if (codetype == 0) { \/\/ ANK font\n    tnum = 0;\n    return 0;\n  }\n  tnum = header[17]; \/\/ Table entry number\n#if DBGLOG\n  Serial.print(\"tnum: \"); Serial.println(tnum);\n#endif\n\n  \/\/ Table read\n  \/\/ XXX: newでなくcalloc()を使用。Arduinoだとnewは単にmalloc()してるだけなので\n  table = (Table*)calloc(tnum, sizeof(Table));\n  if (table == NULL) {\n    close();\n    return -8;\n  }\n  \/\/ assert(sizeof(Table) == sizeof(short) * 2); \/\/ no padding in struct\n  \/\/ assert little endian\n  int len = tnum * sizeof(short) * 2;\n  if (sdfile.read(table, len) < len) {\n    close();\n    return -9;\n  }\n#if DBGLOG\n  for (int a = 0; a < tnum; a++) {\n    Serial.print(\"Table No.\"); Serial.print(a);\n    Serial.print(\" start:\"); Serial.print(table[a].start, HEX);\n    Serial.print(\" end:\"); Serial.println(table[a].end, HEX);\n  }\n#endif\n  return 0;\n}\n\nbool Fontx2::close() {\n  if (table != NULL) {\n    free(table);\n    table = NULL;\n  }\n  return sdfile.close();\n}\n\nint Fontx2::bitmapLen() const {\n  int byteWidth = (_width + 7) \/ 8;\n  return byteWidth * _height;\n}\n\nuint32_t Fontx2::getAnkAddr(uint16_t ank) const {\n  return ANK_DATA_START + ank * bitmapLen();\n}\n\nuint32_t Fontx2::getKanjiAddr(uint16_t sjis) const {\n  int c = 0;\n  uint32_t adrs = 0;\n  while(sjis > table[c].start){\n    if (sjis > table[c].end){\n      adrs += table[c].end - table[c].start + 1;\n    } else {\n      adrs += sjis - table[c].start;\n    }\n    c++;\n  }\n  c--;\n#if DBGLOG\n  Serial.print(\"sjis=\"); Serial.print(sjis, HEX);\n  Serial.print(\",table num=\"); Serial.print(c);\n  Serial.print(\",adrs=\"); Serial.println(adrs, HEX);\n#endif\n  uint32_t kanjiDataStart = ANK_DATA_START + 1 + tnum * sizeof(short) * 2;\n  return kanjiDataStart + bitmapLen() * adrs;\n}\n\nint Fontx2::load(uint16_t sjis, uint8_t* buf, int bufsize) const {\n  if (!sdfile.isOpen()) {\n    return -2;\n  }\n\n  uint32_t adrs;\n  if (tnum == 0) {\n    adrs = getAnkAddr(sjis);\n  } else {\n    adrs = getKanjiAddr(sjis);\n  }\n\n  \/\/ check file size before seek\n  if (adrs < ANK_DATA_START || adrs > sdfile.fileSize()) {\n    return -1; \/\/ 指定された文字コードに対する文字データ無し\n  }\n  if (!sdfile.seekSet(adrs)) {\n    return -1;\n  }\n\n  int len = bitmapLen();\n  if (bufsize < len) {\n    return -3;\n  }\n\n  int ret;\n  if ((ret = sdfile.read(buf, len)) < len) {\n#if DBGLOG\n    Serial.print(\"read error:\");\n    Serial.println(ret);\n#endif\n    return -4;\n  }\n\n#if DBGLOG\n  \/\/ debug dump\n  for (int s = 0; s < len; s++){\n    Serial.print(buf[s], HEX);\n    Serial.print(' ');\n  }\n  Serial.println(); \n#endif\n\n  return 0;\n}\n<commit_msg>getKanjiAddr()処理をwhileからforに変更して少し整理。<commit_after>#include \"Fontx2.h\"\n\n#define DBGLOG 0\n\nconst int ANK_DATA_START = 17;\n\nFontx2::Fontx2() :_width(0), _height(0), tnum(0), table(NULL) {\n}\n\nFontx2::~Fontx2() {\n  close();\n}\n\nint Fontx2::open(SdFatBase* sd, const char* filepath) {\n  \/\/ if already open, close and open\n  close();\n  if (!sdfile.open(sd, filepath, O_READ)) {\n    return -1;\n  }\n\n  \/\/ read header\n  \/\/ cf. http:\/\/kanpapa.com\/today\/2011\/11\/mbed-16dotfont-vfd.html\n  uint8_t header[18];\n  if (sdfile.read(header, 18) < 18) {\n    sdfile.close();\n    return -2;\n  }\n  \/\/ XXX: プログラムサイズを減らすためチェックは省略\n  \/\/if (strncmp(header, \"FONTX2\", 6) != 0) { \/\/ 00-05 \"FONTX2\"\n  \/\/  sdfile.close();\n  \/\/  return -2;\n  \/\/}\n  \/\/ XXX: サイズを減らすためfontNameは持たない\n  \/\/ 06-13 Font name\n  _width = header[14];\n  _height = header[15];\n  uint8_t codetype = header[16];\n#if DBGLOG\n  Serial.print(\"width: \"); Serial.println(_width);\n  Serial.print(\"height: \"); Serial.println(_height);\n  Serial.print(\"codetype: \"); Serial.println(codetype);\n#endif\n  if (codetype == 0) { \/\/ ANK font\n    tnum = 0;\n    return 0;\n  }\n  tnum = header[17]; \/\/ Table entry number\n#if DBGLOG\n  Serial.print(\"tnum: \"); Serial.println(tnum);\n#endif\n\n  \/\/ Table read\n  \/\/ XXX: newでなくcalloc()を使用。Arduinoだとnewは単にmalloc()してるだけなので\n  table = (Table*)calloc(tnum, sizeof(Table));\n  if (table == NULL) {\n    close();\n    return -8;\n  }\n  \/\/ assert(sizeof(Table) == sizeof(short) * 2); \/\/ no padding in struct\n  \/\/ assert little endian\n  int len = tnum * sizeof(short) * 2;\n  if (sdfile.read(table, len) < len) {\n    close();\n    return -9;\n  }\n#if DBGLOG\n  for (int a = 0; a < tnum; a++) {\n    Serial.print(\"Table No.\"); Serial.print(a);\n    Serial.print(\" start:\"); Serial.print(table[a].start, HEX);\n    Serial.print(\" end:\"); Serial.println(table[a].end, HEX);\n  }\n#endif\n  return 0;\n}\n\nbool Fontx2::close() {\n  if (table != NULL) {\n    free(table);\n    table = NULL;\n  }\n  return sdfile.close();\n}\n\nint Fontx2::bitmapLen() const {\n  int byteWidth = (_width + 7) \/ 8;\n  return byteWidth * _height;\n}\n\nuint32_t Fontx2::getAnkAddr(uint16_t ank) const {\n  return ANK_DATA_START + ank * bitmapLen();\n}\n\nuint32_t Fontx2::getKanjiAddr(uint16_t sjis) const {\n  int c;\n  uint32_t adrs = 0;\n  for (c = 0; sjis > table[c].start; c++) {\n    if (sjis > table[c].end) {\n      adrs += table[c].end - table[c].start + 1;\n    } else {\n      adrs += sjis - table[c].start;\n    }\n  }\n#if DBGLOG\n  Serial.print(\"sjis=\"); Serial.print(sjis, HEX);\n  Serial.print(\",table num=\"); Serial.print(c-1);\n  Serial.print(\",adrs=\"); Serial.println(adrs, HEX);\n#endif\n  uint32_t kanjiDataStart = ANK_DATA_START + 1 + tnum * sizeof(short) * 2;\n  return kanjiDataStart + bitmapLen() * adrs;\n}\n\nint Fontx2::load(uint16_t sjis, uint8_t* buf, int bufsize) const {\n  if (!sdfile.isOpen()) {\n    return -2;\n  }\n\n  uint32_t adrs;\n  if (tnum == 0) {\n    adrs = getAnkAddr(sjis);\n  } else {\n    adrs = getKanjiAddr(sjis);\n  }\n\n  \/\/ check file size before seek\n  if (adrs < ANK_DATA_START || adrs > sdfile.fileSize()) {\n    return -1; \/\/ 指定された文字コードに対する文字データ無し\n  }\n  if (!sdfile.seekSet(adrs)) {\n    return -1;\n  }\n\n  int len = bitmapLen();\n  if (bufsize < len) {\n    return -3;\n  }\n\n  int ret;\n  if ((ret = sdfile.read(buf, len)) < len) {\n#if DBGLOG\n    Serial.print(\"read error:\");\n    Serial.println(ret);\n#endif\n    return -4;\n  }\n\n#if DBGLOG\n  \/\/ debug dump\n  for (int s = 0; s < len; s++){\n    Serial.print(buf[s], HEX);\n    Serial.print(' ');\n  }\n  Serial.println(); \n#endif\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ $Id: gnuplot_io.C,v 1.6 2005-06-09 16:57:52 benkirk 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\/\/ C++ includes\n#include <fstream>\n#include <sstream>\n#include <map>\n\n\/\/ Local includes\n#include \"elem.h\"\n#include \"mesh_base.h\"\n#include \"gnuplot_io.h\"\n\nGnuPlotIO::GnuPlotIO(const MeshBase& mesh, const std::string& title, bool grid)\n  :\n  MeshOutput<MeshBase> (mesh),\n  _title(title),\n  _grid(grid)\n{\n}\n\nvoid GnuPlotIO::write(const std::string& fname)\n{\n\n  if(libMesh::processor_id() == 0)\n    this->write_solution(fname);\n\n}\n\nvoid GnuPlotIO::write_nodal_data (const std::string& fname,\n\t\t\t\t  const std::vector<Number>& soln,\n\t\t\t\t  const std::vector<std::string>& names)\n{\n  if(libMesh::processor_id() == 0)\n    this->write_solution(fname, &soln, &names);\n\n}\n\n\n\n\nvoid GnuPlotIO::write_solution(const std::string& fname,\n   \t\t\t       const std::vector<Number>* soln,\n\t\t\t       const std::vector<std::string>* names)\n{\n  assert(libMesh::processor_id() == 0);\n\n  const MeshBase& mesh = MeshOutput<MeshBase>::mesh();\n\n  std::stringstream data_stream_name;\n  data_stream_name << fname << \"_data\";\n  const std::string data_file_name = data_stream_name.str();\n  \n  \/\/ This class is designed only for use with 1D meshes\n  assert (mesh.mesh_dimension() == 1);\n  \n\n  \/\/ Create an output stream for script file\n  std::ofstream out(fname.c_str());\n\n  if (!out.good())\n    {\n      std::cerr << \"ERROR: opening output file \" << fname\n\t\t<< std::endl;\n      error();\n    }\n\n  \/\/ The number of variables in the equation system\n  const unsigned int n_vars = names->size();\n  \n  \/\/ Write header to stream\n  out << \"# This file was generated by gnuplot_io.C\\n\"\n      << \"# Stores 1D solution data in GNUplot format\\n\"\n      << \"# Execute this by loading gnuplot and typing \"\n      << \"\\\"call '\" << fname << \"'\\\"\\n\"\n      << \"reset\\n\"\n      << \"set title \\\"\" << _title << \"\\\"\\n\"\n      << \"set xlabel \\\"x\\\"\\n\"\n      << \"set autoscale\\n\"\n      << \"set xtics nomirror\\n\";\n      \n  if(_grid)\n  {\n    \/\/ construct string for xtic positions at element edges\n    std::string xtics;\n    std::stringstream xtics_stream;\n\n    MeshBase::const_element_iterator it = mesh.active_local_elements_begin();\n    const MeshBase::const_element_iterator end_it =\n      mesh.active_local_elements_end();\n\n    unsigned int count = 0;\n    unsigned int n_active_elem = mesh.n_active_elem();\n\n    for( ; it != end_it; ++it)\n    {\n      Elem* el = *it;\n      \n      \/\/ if el is the left edge of the mesh, print its left node position\n      if(el->neighbor(0) == NULL)\n      {\n        xtics_stream << \"\\\"\\\" \" << (*(el->get_node(0)))(0) << \", \\\\\\n\";\n      }\n      xtics_stream << \"\\\"\\\" \" << (*(el->get_node(1)))(0);\n\n      if(count+1 != n_active_elem)\n      {\n         xtics_stream << \", \\\\\\n\";\n      }\n      count++;\n    }\n    xtics = xtics_stream.str();\n    \n  \n    out << \"set x2tics (\" << xtics << \")\\nset grid noxtics noytics x2tics\\n\";\n  }\n\n  out << \"plot \\\"\" << data_file_name << \"\\\" using 1:2 title \\\"\" << (*names)[0]\n      << \"\\\" with lines\";\n  if(n_vars > 1)\n  {\n    for(unsigned int i=1; i<n_vars; i++)\n    {\n      out << \", \\\\\\n\\\"\" << data_file_name << \"\\\" using 1:\" << i+2 \n          << \" title \\\"\" << (*names)[i] << \"\\\" with lines\";\n    }\n  }\n\n  out.close();\n\n\n  \/\/ Create an output stream for data file\n  std::ofstream data(data_file_name.c_str());\n\n  if (!data.good())\n    {\n      std::cerr << \"ERROR: opening output data file \" << std::endl;\n      error();\n    }\n\n  data << \"# This file contains libMesh solution data \"\n       << \"to be plotted in GNUplot\\n\\n\";\n\n  \/\/ get ordered nodal data using a map\n  typedef std::pair<Real, std::vector<Number> > key_value_pair;\n  typedef std::map<Real, std::vector<Number> > map_type;\n  typedef map_type::iterator map_iterator;\n\n  map_type node_map;\n\n  for(unsigned int i=0; i<mesh.n_nodes(); i++)\n  {\n    std::vector<Number> values;\n\n    if( (names != NULL) && (soln != NULL) )\n    {\n      assert(soln->size() == mesh.n_nodes()*n_vars);\n      for(unsigned int c=0; c<n_vars; c++)\n      {\n        values.push_back( (*soln)[i*n_vars + c] );\n      }\n    }\n\n    node_map.insert(key_value_pair( mesh.point(i)(0) , values ));\n  }\n\n  map_iterator map_it = node_map.begin();\n  const map_iterator end_map_it = node_map.end();\n\n  for( ; map_it != end_map_it; ++map_it)\n  {\n    key_value_pair kvp = *map_it;\n    std::vector<Number> values = kvp.second;\n\n    data << kvp.first << \"\\t\";\n\n    for(unsigned int i=0; i<values.size(); i++)\n    {\n      data << values[i] << \"\\t\";\n    }\n\n    data << \"\\n\";\n  }\n\n  data.close();\n}\n<commit_msg>Fixed bug in plotting coarsened elements.<commit_after>\/\/ $Id: gnuplot_io.C,v 1.7 2005-06-10 18:57:52 knezed01 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\/\/ C++ includes\n#include <fstream>\n#include <sstream>\n#include <map>\n\n\/\/ Local includes\n#include \"elem.h\"\n#include \"mesh_base.h\"\n#include \"gnuplot_io.h\"\n\nGnuPlotIO::GnuPlotIO(const MeshBase& mesh, const std::string& title, bool grid)\n  :\n  MeshOutput<MeshBase> (mesh),\n  _title(title),\n  _grid(grid)\n{\n}\n\nvoid GnuPlotIO::write(const std::string& fname)\n{\n\n  if(libMesh::processor_id() == 0)\n    this->write_solution(fname);\n\n}\n\nvoid GnuPlotIO::write_nodal_data (const std::string& fname,\n\t\t\t\t  const std::vector<Number>& soln,\n\t\t\t\t  const std::vector<std::string>& names)\n{\n  if(libMesh::processor_id() == 0)\n    this->write_solution(fname, &soln, &names);\n\n}\n\n\n\n\nvoid GnuPlotIO::write_solution(const std::string& fname,\n   \t\t\t       const std::vector<Number>* soln,\n\t\t\t       const std::vector<std::string>* names)\n{\n  assert(libMesh::processor_id() == 0);\n\n  const MeshBase& mesh = MeshOutput<MeshBase>::mesh();\n\n  std::stringstream data_stream_name;\n  data_stream_name << fname << \"_data\";\n  const std::string data_file_name = data_stream_name.str();\n  \n  \/\/ This class is designed only for use with 1D meshes\n  assert (mesh.mesh_dimension() == 1);\n\n  \/\/ Make sure we have a solution to plot\n  assert ((names != NULL) && (soln != NULL));\n\n  \/\/ Create an output stream for script file\n  std::ofstream out(fname.c_str());\n\n  if (!out.good())\n    {\n      std::cerr << \"ERROR: opening output file \" << fname\n\t\t<< std::endl;\n      error();\n    }\n\n  \/\/ The number of variables in the equation system\n  const unsigned int n_vars = names->size();\n  \n  \/\/ Write header to stream\n  out << \"# This file was generated by gnuplot_io.C\\n\"\n      << \"# Stores 1D solution data in GNUplot format\\n\"\n      << \"# Execute this by loading gnuplot and typing \"\n      << \"\\\"call '\" << fname << \"'\\\"\\n\"\n      << \"reset\\n\"\n      << \"set title \\\"\" << _title << \"\\\"\\n\"\n      << \"set xlabel \\\"x\\\"\\n\"\n      << \"set autoscale\\n\"\n      << \"set xtics nomirror\\n\";\n      \n  if(_grid)\n  {\n    \/\/ construct string for xtic positions at element edges\n    std::string xtics;\n    std::stringstream xtics_stream;\n\n    MeshBase::const_element_iterator it = mesh.active_local_elements_begin();\n    const MeshBase::const_element_iterator end_it =\n      mesh.active_local_elements_end();\n\n    unsigned int count = 0;\n    unsigned int n_active_elem = mesh.n_active_elem();\n\n    for( ; it != end_it; ++it)\n    {\n      Elem* el = *it;\n      \n      \/\/ if el is the left edge of the mesh, print its left node position\n      if(el->neighbor(0) == NULL)\n      {\n        xtics_stream << \"\\\"\\\" \" << (*(el->get_node(0)))(0) << \", \\\\\\n\";\n      }\n      xtics_stream << \"\\\"\\\" \" << (*(el->get_node(1)))(0);\n\n      if(count+1 != n_active_elem)\n      {\n         xtics_stream << \", \\\\\\n\";\n      }\n      count++;\n    }\n    xtics = xtics_stream.str();\n    \n  \n    out << \"set x2tics (\" << xtics << \")\\nset grid noxtics noytics x2tics\\n\";\n  }\n\n  out << \"plot \\\"\" << data_file_name << \"\\\" using 1:2 title \\\"\" << (*names)[0]\n      << \"\\\" with lines\";\n  if(n_vars > 1)\n  {\n    for(unsigned int i=1; i<n_vars; i++)\n    {\n      out << \", \\\\\\n\\\"\" << data_file_name << \"\\\" using 1:\" << i+2 \n          << \" title \\\"\" << (*names)[i] << \"\\\" with lines\";\n    }\n  }\n\n  out.close();\n\n\n  \/\/ Create an output stream for data file\n  std::ofstream data(data_file_name.c_str());\n\n  if (!data.good())\n    {\n      std::cerr << \"ERROR: opening output data file \" << std::endl;\n      error();\n    }\n\n  data << \"# This file contains libMesh solution data \"\n       << \"to be plotted in GNUplot\\n\\n\";\n\n  \/\/ get ordered nodal data using a map\n  typedef std::pair<Real, std::vector<Number> > key_value_pair;\n  typedef std::map<Real, std::vector<Number> > map_type;\n  typedef map_type::iterator map_iterator;\n\n  map_type node_map;\n\n\n  MeshBase::const_element_iterator       it  = mesh.active_elements_begin();\n  const MeshBase::const_element_iterator end = mesh.active_elements_end(); \n\n  for ( ; it != end; ++it)\n  {\n    const Elem* elem = *it;\n\n    for(unsigned int i=0; i<elem->n_nodes(); i++)\n    {\n      std::vector<Number> values;\n\n      \/\/ Get the global id of the node\n      unsigned int global_id = elem->node(i);\n\n      for(unsigned int c=0; c<n_vars; c++)\n      {\n        values.push_back( (*soln)[global_id*n_vars + c] );\n      }\n\n      node_map[ mesh.point(global_id)(0) ] = values;\n    }\n  }\n\n    \n  map_iterator map_it = node_map.begin();\n  const map_iterator end_map_it = node_map.end();\n\n  for( ; map_it != end_map_it; ++map_it)\n  {\n    key_value_pair kvp = *map_it;\n    std::vector<Number> values = kvp.second;\n\n    data << kvp.first << \"\\t\";\n\n    for(unsigned int i=0; i<values.size(); i++)\n    {\n      data << values[i] << \"\\t\";\n    }\n\n    data << \"\\n\";\n  }\n\n  data.close();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/***************************************************************************\n  file : $URL: file:\/\/\/develop\/SVNrepository\/frepple\/trunk\/src\/model\/buffer.cpp $\n  version : $LastChangedRevision$  $LastChangedBy$\n  date : $LastChangedDate$\n  email : jdetaeye@users.sourceforge.net\n ***************************************************************************\/\n\n\/***************************************************************************\n *                                                                         *\n * Copyright (C) 2006 by Johan De Taeye                                    *\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   *\n * by the Free Software Foundation; either version 2.1 of the License, or  *\n * (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 Lesser *\n * General Public License for more details.                                *\n *                                                                         *\n * You should have received a copy of the GNU Lesser 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 FREPPLE_CORE \n#include \"frepple\/model.h\"\n\nnamespace frepple\n{\n\n\nvoid PeggingIterator::updateStack\n  (short l, double q, double f, const FlowPlan* fl, bool p)\n{\n  if (first)\n  {\n    \/\/ We can update the current top element of the stack\n    state& t = stack.top();\n    t.fl = fl;\n    t.qty = q;\n    t.factor = f;\n    t.level = l;\n    t.pegged = p;\n    first = false; \n  }\n  else\n    \/\/ We need to create a new element on the stack\n    stack.push(state(l, q, f, fl, p));\n}\n\n\nPeggingIterator& PeggingIterator::operator++() \n{\n  \/\/ Validate\n  if (stack.empty()) \n    throw LogicException(\"Incrementing the iterator beyond it's end\");\n  state& st = stack.top();\n  if (st.level > 0) \n    throw LogicException(\"Don't yoyo a pegging iterator\");\n\n  first = true;  \/\/ The next element can overwrite the existing stack top\n  short nextlevel = st.level - 1;\n  const FlowPlan *curflowplan = st.fl;\n  double curfactor = st.factor;\n  double curqty = st.qty;\n  if (!stack.top().pegged) \n  {\n    \/\/ Handle unpegged material entries on the stack\n    stack.pop();\n    return *this;\n  }\n  else if (curflowplan->getQuantity() > ROUNDING_ERROR)\n  {\n    \/\/ CASE 1:\n    \/\/ This is a flowplan producing in a buffer. Navigating downstream means\n    \/\/ finding the flowplans consuming this produced material.\n\n    double peggedQty(0);\n    Buffer::flowplanlist::const_iterator f \n      = st.fl->getFlow()->getBuffer()->getFlowPlans().begin(st.fl);\n    double endQty = f->getCumulativeProduced();\n    double startQty = endQty - f->getQuantity();\n    if (f->getCumulativeConsumed() <= startQty)\n    {\n      \/\/ CASE 1A: Not consumed enough yet: move forward\n      while (f->getCumulativeConsumed() <= startQty) ++f;\n      while (f!=st.fl->getFlow()->getBuffer()->getFlowPlans().end() \n             && ( (f->getQuantity()<=0 \n                   && f->getCumulativeConsumed()+f->getQuantity() < endQty)\n               || (f->getQuantity()>0 && f->getCumulativeConsumed() < endQty))\n            )\n      {\n        if (f->getQuantity() < -ROUNDING_ERROR)\n        {\n          double newqty = - f->getQuantity();\n          if (f->getCumulativeConsumed()+f->getQuantity() < startQty)\n            newqty -= startQty - (f->getCumulativeConsumed()+f->getQuantity());\n          if (f->getCumulativeConsumed() > endQty)\n            newqty -= f->getCumulativeConsumed() - endQty;\n          peggedQty += newqty;\n          const FlowPlan *x = dynamic_cast<const FlowPlan*>(&(*f));\n          updateStack(nextlevel, curqty*newqty\/curflowplan->getQuantity(), -curfactor*newqty\/f->getQuantity(), x);\n        }\n        ++f;\n      }\n    }\n    else\n    {\n      \/\/ CASE 1B: Consumed too much already: move backward\n      while ( (f->getQuantity()<=0 && f->getCumulativeConsumed()+f->getQuantity() < endQty)\n              || (f->getQuantity()>0 && f->getCumulativeConsumed() < endQty)) --f;\n      while (f!=st.fl->getFlow()->getBuffer()->getFlowPlans().end()\n             && f->getCumulativeConsumed() > startQty)\n      {\n        if (f->getQuantity() < -ROUNDING_ERROR)\n        {\n          double newqty = - f->getQuantity();\n          if (f->getCumulativeConsumed()+f->getQuantity() < startQty)\n            newqty -= startQty - (f->getCumulativeConsumed()+f->getQuantity());\n          if (f->getCumulativeConsumed() > endQty)\n            newqty -= f->getCumulativeConsumed() - endQty;\n          peggedQty += newqty;\n          const FlowPlan *x = dynamic_cast<const FlowPlan*>(&(*f));\n          updateStack(nextlevel, curqty*newqty\/curflowplan->getQuantity(), -curfactor*newqty\/f->getQuantity(), x);\n        }\n        --f;\n      }\n    }\n   if (peggedQty < endQty - startQty)\n     \/\/ Unpegged material (i.e. material that is produced but never consumed) \n     \/\/ is handled with a special entry on the stack.\n     updateStack(nextlevel, curqty*(endQty - startQty - peggedQty)\/curflowplan->getQuantity(), st.factor, curflowplan, false);\n  }\n  else if (st.fl->getQuantity() < -ROUNDING_ERROR)\n  {\n    \/\/ CASE 2:\n    \/\/ This is a consuming flowplan. Navigating downstream means taking the \n    \/\/ producing flowplans of the owning operationplan(s).\n    \/\/ @todo handle opplan hierarchies\n    for (OperationPlan::FlowPlanIterator i \n      = st.fl->getOperationPlan()->beginFlowPlans();\n      i != st.fl->getOperationPlan()->endFlowPlans();\n      ++i)\n      if (i->getQuantity()>0)\n        updateStack(nextlevel, st.qty, st.factor, &*i);\n  }\n  \/\/ No matching flow found\n  if (first) stack.pop();\n  return *this;\n}\n\n\nPeggingIterator& PeggingIterator::operator--() \n{\n  \/\/ Validate\n  if (stack.empty()) \n    throw LogicException(\"Incrementing the iterator beyond it's end\");\n  state& st = stack.top();\n  if (st.level < 0) \n    throw LogicException(\"Dont yoyo a pegging iterator\");\n\n  first = true;  \/\/ The next element can overwrite the existing stack top\n  short nextlevel = st.level + 1;\n  const FlowPlan *curflowplan = st.fl;\n  double curfactor = st.factor;\n  double curqty = st.qty;\n  if (!st.pegged) \n  {\n    \/\/ Handle unconsumed material entries on the stack\n    stack.pop();\n    return *this;\n  }\n  else if (curflowplan->getQuantity() < -ROUNDING_ERROR)\n  {\n    \/\/ CASE 3:\n    \/\/ This is a flowplan consuming from a buffer. Navigating upstream means\n    \/\/ finding the flowplans producing this consumed material.\n    double peggedQty(0);\n    Buffer::flowplanlist::const_iterator f \n      = st.fl->getFlow()->getBuffer()->getFlowPlans().begin(st.fl);\n    double endQty = f->getCumulativeConsumed();\n    double startQty = endQty + f->getQuantity();\n    if (f->getCumulativeProduced() <= startQty)\n    {\n      \/\/ CASE 3A: Not produced enough yet: move forward\n      while (f->getCumulativeProduced() <= startQty) ++f;\n      while (f!=st.fl->getFlow()->getBuffer()->getFlowPlans().end() \n             && ( (f->getQuantity()<=0 && f->getCumulativeProduced() < endQty)\n               || (f->getQuantity()>0 \n                   && f->getCumulativeProduced()-f->getQuantity() < endQty))\n            )\n      {\n        if (f->getQuantity() > ROUNDING_ERROR)\n        {\n          double newqty = f->getQuantity();\n          if (f->getCumulativeProduced()-f->getQuantity() < startQty)\n            newqty -= startQty - (f->getCumulativeProduced()-f->getQuantity());\n          if (f->getCumulativeProduced() > endQty)\n            newqty -= f->getCumulativeProduced() - endQty;\n          peggedQty += newqty;\n          const FlowPlan *x = dynamic_cast<const FlowPlan*>(&(*f));\n          updateStack(nextlevel, -curqty*newqty\/curflowplan->getQuantity(), curfactor*newqty\/f->getQuantity(), x);\n        }\n        ++f;\n      }\n    }\n    else\n    {\n      \/\/ CASE 3B: Produced too much already: move backward\n      while ( (f->getQuantity()<=0 && f->getCumulativeProduced() < endQty)\n              || (f->getQuantity()>0 \n                  && f->getCumulativeProduced()-f->getQuantity() < endQty)) --f;\n      while (f!=st.fl->getFlow()->getBuffer()->getFlowPlans().end()\n             && f->getCumulativeProduced() > startQty)\n      {\n        if (f->getQuantity() > ROUNDING_ERROR)\n        {\n          double newqty = f->getQuantity();\n          if (f->getCumulativeProduced()-f->getQuantity() < startQty)\n            newqty -= startQty - (f->getCumulativeProduced()-f->getQuantity());\n          if (f->getCumulativeProduced() > endQty)\n            newqty -= f->getCumulativeProduced() - endQty;\n          peggedQty += newqty;\n          const FlowPlan *x = dynamic_cast<const FlowPlan*>(&(*f));\n          updateStack(nextlevel, -curqty*newqty\/curflowplan->getQuantity(), curfactor*newqty\/f->getQuantity(), x);\n        }\n        --f;\n      }\n    }\n    if (peggedQty < endQty - startQty)\n      \/\/ Unproduced material (i.e. material that is consumed but never \n      \/\/ produced) is handled with a special entry on the stack.\n      updateStack(nextlevel, curqty*(endQty - startQty - peggedQty)\/curflowplan->getQuantity(), st.factor, curflowplan, false);\n  }\n  else if (curflowplan->getQuantity() > ROUNDING_ERROR)\n  {\n    \/\/ CASE 4:\n    \/\/ This is a producing flowplan. Navigating upstream means taking the \n    \/\/ consuming flowplans of the owning operationplan(s).\n    \/\/ @todo handle opplan hierarchies\n    for (OperationPlan::FlowPlanIterator i \n      = st.fl->getOperationPlan()->beginFlowPlans();\n      i != st.fl->getOperationPlan()->endFlowPlans();\n      ++i)\n      if (i->getQuantity()<0)\n        updateStack(nextlevel, st.qty, st.factor, &*i);\n  }\n  \/\/ No matching flow found\n  if (first) stack.pop();\n  return *this;\n}\n\n} \/\/ End namespace\n<commit_msg>- Bug correction in pegging code<commit_after>\/***************************************************************************\n  file : $URL: file:\/\/\/develop\/SVNrepository\/frepple\/trunk\/src\/model\/buffer.cpp $\n  version : $LastChangedRevision$  $LastChangedBy$\n  date : $LastChangedDate$\n  email : jdetaeye@users.sourceforge.net\n ***************************************************************************\/\n\n\/***************************************************************************\n *                                                                         *\n * Copyright (C) 2006 by Johan De Taeye                                    *\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   *\n * by the Free Software Foundation; either version 2.1 of the License, or  *\n * (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 Lesser *\n * General Public License for more details.                                *\n *                                                                         *\n * You should have received a copy of the GNU Lesser 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 FREPPLE_CORE \n#include \"frepple\/model.h\"\n\nnamespace frepple\n{\n\n\nvoid PeggingIterator::updateStack\n  (short l, double q, double f, const FlowPlan* fl, bool p)\n{\n  if (first)\n  {\n    \/\/ We can update the current top element of the stack\n    state& t = stack.top();\n    t.fl = fl;\n    t.qty = q;\n    t.factor = f;\n    t.level = l;\n    t.pegged = p;\n    first = false; \n  }\n  else\n    \/\/ We need to create a new element on the stack\n    stack.push(state(l, q, f, fl, p));\n}\n\n\nPeggingIterator& PeggingIterator::operator++() \n{\n  \/\/ Validate\n  if (stack.empty()) \n    throw LogicException(\"Incrementing the iterator beyond it's end\");\n  state& st = stack.top();\n  if (st.level > 0) \n    throw LogicException(\"Don't yoyo a pegging iterator\");\n\n  first = true;  \/\/ The next element can overwrite the existing stack top\n  short nextlevel = st.level - 1;\n  const FlowPlan *curflowplan = st.fl;\n  double curfactor = st.factor;\n  double curqty = st.qty;\n  if (!stack.top().pegged) \n  {\n    \/\/ Handle unpegged material entries on the stack\n    stack.pop();\n    return *this;\n  }\n  else if (curflowplan->getQuantity() > ROUNDING_ERROR)\n  {\n    \/\/ CASE 1:\n    \/\/ This is a flowplan producing in a buffer. Navigating downstream means\n    \/\/ finding the flowplans consuming this produced material.\n\n    double peggedQty(0);\n    Buffer::flowplanlist::const_iterator f \n      = st.fl->getFlow()->getBuffer()->getFlowPlans().begin(st.fl);\n    double endQty = f->getCumulativeProduced();\n    double startQty = endQty - f->getQuantity();\n    if (f->getCumulativeConsumed() <= startQty)\n    {\n      \/\/ CASE 1A: Not consumed enough yet: move forward\n      while (f!=st.fl->getFlow()->getBuffer()->getFlowPlans().end() \n        && f->getCumulativeConsumed() <= startQty) ++f;\n      while (f!=st.fl->getFlow()->getBuffer()->getFlowPlans().end() \n             && ( (f->getQuantity()<=0 \n                   && f->getCumulativeConsumed()+f->getQuantity() < endQty)\n               || (f->getQuantity()>0 && f->getCumulativeConsumed() < endQty))\n            )\n      {\n        if (f->getQuantity() < -ROUNDING_ERROR)\n        {\n          double newqty = - f->getQuantity();\n          if (f->getCumulativeConsumed()+f->getQuantity() < startQty)\n            newqty -= startQty - (f->getCumulativeConsumed()+f->getQuantity());\n          if (f->getCumulativeConsumed() > endQty)\n            newqty -= f->getCumulativeConsumed() - endQty;\n          peggedQty += newqty;\n          const FlowPlan *x = dynamic_cast<const FlowPlan*>(&(*f));\n          updateStack(nextlevel, curqty*newqty\/curflowplan->getQuantity(), -curfactor*newqty\/f->getQuantity(), x);\n        }\n        ++f;\n      }\n    }\n    else\n    {\n      \/\/ CASE 1B: Consumed too much already: move backward\n      while ( f!=st.fl->getFlow()->getBuffer()->getFlowPlans().end() \n        && ((f->getQuantity()<=0 && f->getCumulativeConsumed()+f->getQuantity() < endQty)\n            || (f->getQuantity()>0 && f->getCumulativeConsumed() < endQty))) --f;\n      while (f!=st.fl->getFlow()->getBuffer()->getFlowPlans().end()\n             && f->getCumulativeConsumed() > startQty)\n      {\n        if (f->getQuantity() < -ROUNDING_ERROR)\n        {\n          double newqty = - f->getQuantity();\n          if (f->getCumulativeConsumed()+f->getQuantity() < startQty)\n            newqty -= startQty - (f->getCumulativeConsumed()+f->getQuantity());\n          if (f->getCumulativeConsumed() > endQty)\n            newqty -= f->getCumulativeConsumed() - endQty;\n          peggedQty += newqty;\n          const FlowPlan *x = dynamic_cast<const FlowPlan*>(&(*f));\n          updateStack(nextlevel, curqty*newqty\/curflowplan->getQuantity(), -curfactor*newqty\/f->getQuantity(), x);\n        }\n        --f;\n      }\n    }\n   if (peggedQty < endQty - startQty)\n     \/\/ Unpegged material (i.e. material that is produced but never consumed) \n     \/\/ is handled with a special entry on the stack.\n     updateStack(nextlevel, curqty*(endQty - startQty - peggedQty)\/curflowplan->getQuantity(), st.factor, curflowplan, false);\n  }\n  else if (st.fl->getQuantity() < -ROUNDING_ERROR)\n  {\n    \/\/ CASE 2:\n    \/\/ This is a consuming flowplan. Navigating downstream means taking the \n    \/\/ producing flowplans of the owning operationplan(s).\n    \/\/ @todo handle opplan hierarchies\n    for (OperationPlan::FlowPlanIterator i \n      = st.fl->getOperationPlan()->beginFlowPlans();\n      i != st.fl->getOperationPlan()->endFlowPlans();\n      ++i)\n      if (i->getQuantity()>0)\n        updateStack(nextlevel, st.qty, st.factor, &*i);\n  }\n  \/\/ No matching flow found\n  if (first) stack.pop();\n  return *this;\n}\n\n\nPeggingIterator& PeggingIterator::operator--() \n{\n  \/\/ Validate\n  if (stack.empty()) \n    throw LogicException(\"Incrementing the iterator beyond it's end\");\n  state& st = stack.top();\n  if (st.level < 0) \n    throw LogicException(\"Dont yoyo a pegging iterator\");\n\n  first = true;  \/\/ The next element can overwrite the existing stack top\n  short nextlevel = st.level + 1;\n  const FlowPlan *curflowplan = st.fl;\n  double curfactor = st.factor;\n  double curqty = st.qty;\n  if (!st.pegged) \n  {\n    \/\/ Handle unconsumed material entries on the stack\n    stack.pop();\n    return *this;\n  }\n  else if (curflowplan->getQuantity() < -ROUNDING_ERROR)\n  {\n    \/\/ CASE 3:\n    \/\/ This is a flowplan consuming from a buffer. Navigating upstream means\n    \/\/ finding the flowplans producing this consumed material.\n    double peggedQty(0);\n    Buffer::flowplanlist::const_iterator f \n      = st.fl->getFlow()->getBuffer()->getFlowPlans().begin(st.fl);\n    double endQty = f->getCumulativeConsumed();\n    double startQty = endQty + f->getQuantity();\n    if (f->getCumulativeProduced() <= startQty)\n    {\n      \/\/ CASE 3A: Not produced enough yet: move forward\n      while (f!=st.fl->getFlow()->getBuffer()->getFlowPlans().end()\n        && f->getCumulativeProduced() <= startQty) ++f;\n      while (f!=st.fl->getFlow()->getBuffer()->getFlowPlans().end() \n             && ( (f->getQuantity()<=0 && f->getCumulativeProduced() < endQty)\n               || (f->getQuantity()>0 \n                   && f->getCumulativeProduced()-f->getQuantity() < endQty))\n            )\n      {\n        if (f->getQuantity() > ROUNDING_ERROR)\n        {\n          double newqty = f->getQuantity();\n          if (f->getCumulativeProduced()-f->getQuantity() < startQty)\n            newqty -= startQty - (f->getCumulativeProduced()-f->getQuantity());\n          if (f->getCumulativeProduced() > endQty)\n            newqty -= f->getCumulativeProduced() - endQty;\n          peggedQty += newqty;\n          const FlowPlan *x = dynamic_cast<const FlowPlan*>(&(*f));\n          updateStack(nextlevel, -curqty*newqty\/curflowplan->getQuantity(), curfactor*newqty\/f->getQuantity(), x);\n        }\n        ++f;\n      }\n    }\n    else\n    {\n      \/\/ CASE 3B: Produced too much already: move backward\n      while ( f!=st.fl->getFlow()->getBuffer()->getFlowPlans().end()\n        && ((f->getQuantity()<=0 && f->getCumulativeProduced() < endQty)\n            || (f->getQuantity()>0 \n                  && f->getCumulativeProduced()-f->getQuantity() < endQty))) --f;\n      while (f!=st.fl->getFlow()->getBuffer()->getFlowPlans().end()\n             && f->getCumulativeProduced() > startQty)\n      {\n        if (f->getQuantity() > ROUNDING_ERROR)\n        {\n          double newqty = f->getQuantity();\n          if (f->getCumulativeProduced()-f->getQuantity() < startQty)\n            newqty -= startQty - (f->getCumulativeProduced()-f->getQuantity());\n          if (f->getCumulativeProduced() > endQty)\n            newqty -= f->getCumulativeProduced() - endQty;\n          peggedQty += newqty;\n          const FlowPlan *x = dynamic_cast<const FlowPlan*>(&(*f));\n          updateStack(nextlevel, -curqty*newqty\/curflowplan->getQuantity(), curfactor*newqty\/f->getQuantity(), x);\n        }\n        --f;\n      }\n    }\n    if (peggedQty < endQty - startQty)\n      \/\/ Unproduced material (i.e. material that is consumed but never \n      \/\/ produced) is handled with a special entry on the stack.\n      updateStack(nextlevel, curqty*(endQty - startQty - peggedQty)\/curflowplan->getQuantity(), st.factor, curflowplan, false);\n  }\n  else if (curflowplan->getQuantity() > ROUNDING_ERROR)\n  {\n    \/\/ CASE 4:\n    \/\/ This is a producing flowplan. Navigating upstream means taking the \n    \/\/ consuming flowplans of the owning operationplan(s).\n    \/\/ @todo handle opplan hierarchies\n    for (OperationPlan::FlowPlanIterator i \n      = st.fl->getOperationPlan()->beginFlowPlans();\n      i != st.fl->getOperationPlan()->endFlowPlans();\n      ++i)\n      if (i->getQuantity()<0)\n        updateStack(nextlevel, st.qty, st.factor, &*i);\n  }\n  \/\/ No matching flow found\n  if (first) stack.pop();\n  return *this;\n}\n\n} \/\/ End namespace\n<|endoftext|>"}
{"text":"<commit_before>\/**\n* @author Olaf Radicke <briefkasten@olaf-rdicke.de>\n* @date 2013\n* @copyright\n* Copyright (C) 2013  Olaf Radicke <briefkasten@olaf-rdicke.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 later\n* 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 \"Config.h\"\n#include \"ConfigImpl.h\"\n#include <cxxtools\/serializationinfo.h>\n#include <cxxtools\/propertiesdeserializer.h>\n#include <cxxtools\/mutex.h>\n#include <cxxtools\/fileinfo.h>\n#include <cxxtools\/log.h>\n#include <fstream>\n\n\n\nnamespace\n{\n    bool configRead = false;\n    ConfigImpl theImpl;\n    cxxtools::Mutex mutex;\n}\n\nconst std::string& Config::appIp() const\n{\n    return impl->appIp();\n}\n\nunsigned short Config::appPort() const\n{\n    return impl->appPort();\n}\n\nconst std::string& Config::dbDriver() const\n{\n    return impl->dbDriver();\n}\n\nunsigned Config::sessionTimeout() const\n{\n    return impl->sessionTimeout();\n}\n\nconst std::string& Config::smtpServer() const\n{\n    return impl->smtpServer();\n}\n\nconst std::string& Config::mailFromAddress() const\n{\n    return impl->mailFromAddress();\n}\n\nstd::string Config::get(const std::string& var) const\n{\n    return impl->get(var);\n}\n\nConfig::Config ()\n    : impl(0)\n{\n    cxxtools::MutexLock lock(mutex);\n    if (!configRead)\n    {\n        try {\n            std::string fname;\n\n            if (cxxtools::FileInfo::exists(\"peruschim_cpp.conf\"))\n            {\n                fname = \"peruschim_cpp.conf\";\n            }\n            else\n            {\n                fname = \"\/etc\/peruschim_cpp.conf\";\n            }\n\n            theImpl.read(fname);\n            configRead = true;\n        } catch (...)\n        {\n\/\/             theImpl.generatingConfigExample( \"peruschim_cpp.conf\" );\n        }\n    }\n\n    impl = &theImpl;\n}\n\n<commit_msg>when reading configuration fails, propagate error to main instead of just ignoring it<commit_after>\/**\n* @author Olaf Radicke <briefkasten@olaf-rdicke.de>\n* @date 2013\n* @copyright\n* Copyright (C) 2013  Olaf Radicke <briefkasten@olaf-rdicke.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 later\n* 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 \"Config.h\"\n#include \"ConfigImpl.h\"\n#include <cxxtools\/serializationinfo.h>\n#include <cxxtools\/propertiesdeserializer.h>\n#include <cxxtools\/mutex.h>\n#include <cxxtools\/fileinfo.h>\n#include <cxxtools\/log.h>\n#include <fstream>\n\n\n\nnamespace\n{\n    bool configRead = false;\n    ConfigImpl theImpl;\n    cxxtools::Mutex mutex;\n}\n\nconst std::string& Config::appIp() const\n{\n    return impl->appIp();\n}\n\nunsigned short Config::appPort() const\n{\n    return impl->appPort();\n}\n\nconst std::string& Config::dbDriver() const\n{\n    return impl->dbDriver();\n}\n\nunsigned Config::sessionTimeout() const\n{\n    return impl->sessionTimeout();\n}\n\nconst std::string& Config::smtpServer() const\n{\n    return impl->smtpServer();\n}\n\nconst std::string& Config::mailFromAddress() const\n{\n    return impl->mailFromAddress();\n}\n\nstd::string Config::get(const std::string& var) const\n{\n    return impl->get(var);\n}\n\nConfig::Config ()\n    : impl(0)\n{\n    cxxtools::MutexLock lock(mutex);\n    if (!configRead)\n    {\n        std::string fname;\n\n        if (cxxtools::FileInfo::exists(\"peruschim_cpp.conf\"))\n        {\n            fname = \"peruschim_cpp.conf\";\n        }\n        else\n        {\n            fname = \"\/etc\/peruschim_cpp.conf\";\n        }\n\n        theImpl.read(fname);\n        configRead = true;\n    }\n\n    impl = &theImpl;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <muduo\/net\/Buffer.h>\n\n\/\/#define BOOST_TEST_MODULE BufferTest\n#define BOOST_TEST_MAIN\n#define BOOST_TEST_DYN_LINK\n#include <boost\/test\/unit_test.hpp>\n\nusing muduo::string;\nusing muduo::net::Buffer;\n\nBOOST_AUTO_TEST_CASE(testBufferAppendRetrieve)\n{\n  Buffer buf;\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 0);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), Buffer::kInitialSize);\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend);\n\n  const string str(200, 'x');\n  buf.append(str);\n  BOOST_CHECK_EQUAL(buf.readableBytes(), str.size());\n  BOOST_CHECK_EQUAL(buf.writableBytes(), Buffer::kInitialSize - str.size());\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend);\n\n  const string str2 =  buf.retrieveAsString(50);\n  BOOST_CHECK_EQUAL(str2.size(), 50);\n  BOOST_CHECK_EQUAL(buf.readableBytes(), str.size() - str2.size());\n  BOOST_CHECK_EQUAL(buf.writableBytes(), Buffer::kInitialSize - str.size());\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend + str2.size());\n\n  buf.append(str);\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 2*str.size() - str2.size());\n  BOOST_CHECK_EQUAL(buf.writableBytes(), Buffer::kInitialSize - 2*str.size());\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend + str2.size());\n\n  const string str3 =  buf.retrieveAllAsString();\n  BOOST_CHECK_EQUAL(str3.size(), 350);\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 0);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), Buffer::kInitialSize);\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend);\n}\n\nBOOST_AUTO_TEST_CASE(testBufferGrow)\n{\n  Buffer buf;\n  buf.append(string(400, 'y'));\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 400);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), Buffer::kInitialSize-400);\n\n  buf.retrieve(50);\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 350);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), Buffer::kInitialSize-400);\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend+50);\n\n  buf.append(string(1000, 'z'));\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 1350);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), 0);\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend+50); \/\/ FIXME\n\n  buf.retrieveAll();\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 0);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), 1400); \/\/ FIXME\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend);\n}\n\nBOOST_AUTO_TEST_CASE(testBufferInsideGrow)\n{\n  Buffer buf;\n  buf.append(string(800, 'y'));\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 800);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), Buffer::kInitialSize-800);\n\n  buf.retrieve(500);\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 300);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), Buffer::kInitialSize-800);\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend+500);\n\n  buf.append(string(300, 'z'));\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 600);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), Buffer::kInitialSize-600);\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend);\n}\n\nBOOST_AUTO_TEST_CASE(testBufferShrink)\n{\n  Buffer buf;\n  buf.append(string(2000, 'y'));\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 2000);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), 0);\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend);\n\n  buf.retrieve(1500);\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 500);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), 0);\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend+1500);\n\n  buf.shrink(0);\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 500);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), Buffer::kInitialSize-500);\n  BOOST_CHECK_EQUAL(buf.retrieveAllAsString(), string(500, 'y'));\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend);\n}\n\nBOOST_AUTO_TEST_CASE(testBufferPrepend)\n{\n  Buffer buf;\n  buf.append(string(200, 'y'));\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 200);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), Buffer::kInitialSize-200);\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend);\n\n  int x = 0;\n  buf.prepend(&x, sizeof x);\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 204);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), Buffer::kInitialSize-200);\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend - 4);\n}\n\nBOOST_AUTO_TEST_CASE(testBufferReadInt)\n{\n  Buffer buf;\n  buf.append(\"HTTP\");\n\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 4);\n  BOOST_CHECK_EQUAL(buf.peekInt8(), 'H');\n  int top16 = buf.peekInt16();\n  BOOST_CHECK_EQUAL(top16, 'H'*256 + 'T');\n  BOOST_CHECK_EQUAL(buf.peekInt32(), top16*65536 + 'T'*256 + 'P');\n\n  BOOST_CHECK_EQUAL(buf.readInt8(), 'H');\n  BOOST_CHECK_EQUAL(buf.readInt16(), 'T'*256 + 'T');\n  BOOST_CHECK_EQUAL(buf.readInt8(), 'P');\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 0);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), Buffer::kInitialSize);\n\n  buf.appendInt8(-1);\n  buf.appendInt16(-1);\n  buf.appendInt32(-1);\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 7);\n  BOOST_CHECK_EQUAL(buf.readInt8(), -1);\n  BOOST_CHECK_EQUAL(buf.readInt32(), -1);\n  BOOST_CHECK_EQUAL(buf.readInt16(), -1);\n}\n\nBOOST_AUTO_TEST_CASE(testBufferFindEOL)\n{\n  Buffer buf;\n  buf.append(string(100000, 'x'));\n  const char* null = NULL;\n  BOOST_CHECK_EQUAL(buf.findEOL(), null);\n  BOOST_CHECK_EQUAL(buf.findEOL(buf.peek()+90000), null);\n}\n\n#ifdef __GXX_EXPERIMENTAL_CXX0X__\nvoid output(Buffer&& buf, const void* inner)\n{\n  Buffer newbuf(std::move(buf));\n  \/\/ printf(\"New Buffer at %p, inner %p\\n\", &newbuf, newbuf.peek());\n  BOOST_CHECK_EQUAL(inner, newbuf.peek());\n}\n\n\/\/ NOTE: This test fails in g++ 4.4, passes in g++ 4.6.\nBOOST_AUTO_TEST_CASE(testMove)\n{\n  Buffer buf;\n  buf.append(\"muduo\", 5);\n  const void* inner = buf.peek();\n  \/\/ printf(\"Buffer at %p, inner %p\\n\", &buf, inner);\n  output(std::move(buf), inner);\n}\n#endif\n<commit_msg>Modify the test cases of Buffer<commit_after>#include <muduo\/net\/Buffer.h>\n\n\/\/#define BOOST_TEST_MODULE BufferTest\n#define BOOST_TEST_MAIN\n#define BOOST_TEST_DYN_LINK\n#include <boost\/test\/unit_test.hpp>\n\nusing muduo::string;\nusing muduo::net::Buffer;\n\nBOOST_AUTO_TEST_CASE(testBufferAppendRetrieve)\n{\n  Buffer buf;\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 0);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), Buffer::kInitialSize);\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend);\n\n  const string str(200, 'x');\n  buf.append(str);\n  BOOST_CHECK_EQUAL(buf.readableBytes(), str.size());\n  BOOST_CHECK_EQUAL(buf.writableBytes(), Buffer::kInitialSize - str.size());\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend);\n\n  const string str2 =  buf.retrieveAsString(50);\n  BOOST_CHECK_EQUAL(str2.size(), 50);\n  BOOST_CHECK_EQUAL(buf.readableBytes(), str.size() - str2.size());\n  BOOST_CHECK_EQUAL(buf.writableBytes(), Buffer::kInitialSize - str.size());\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend + str2.size());\n  BOOST_CHECK_EQUAL(str2, string(50, 'x'));\n\n  buf.append(str);\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 2*str.size() - str2.size());\n  BOOST_CHECK_EQUAL(buf.writableBytes(), Buffer::kInitialSize - 2*str.size());\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend + str2.size());\n\n  const string str3 =  buf.retrieveAllAsString();\n  BOOST_CHECK_EQUAL(str3.size(), 350);\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 0);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), Buffer::kInitialSize);\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend);\n  BOOST_CHECK_EQUAL(str3, string(350, 'x'));\n}\n\nBOOST_AUTO_TEST_CASE(testBufferGrow)\n{\n  Buffer buf;\n  buf.append(string(400, 'y'));\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 400);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), Buffer::kInitialSize-400);\n\n  buf.retrieve(50);\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 350);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), Buffer::kInitialSize-400);\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend+50);\n\n  buf.append(string(1000, 'z'));\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 1350);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), 0);\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend+50); \/\/ FIXME\n\n  buf.retrieveAll();\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 0);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), 1400); \/\/ FIXME\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend);\n}\n\nBOOST_AUTO_TEST_CASE(testBufferInsideGrow)\n{\n  Buffer buf;\n  buf.append(string(800, 'y'));\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 800);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), Buffer::kInitialSize-800);\n\n  buf.retrieve(500);\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 300);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), Buffer::kInitialSize-800);\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend+500);\n\n  buf.append(string(300, 'z'));\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 600);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), Buffer::kInitialSize-600);\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend);\n}\n\nBOOST_AUTO_TEST_CASE(testBufferShrink)\n{\n  Buffer buf;\n  buf.append(string(2000, 'y'));\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 2000);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), 0);\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend);\n\n  buf.retrieve(1500);\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 500);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), 0);\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend+1500);\n\n  buf.shrink(0);\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 500);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), Buffer::kInitialSize-500);\n  BOOST_CHECK_EQUAL(buf.retrieveAllAsString(), string(500, 'y'));\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend);\n}\n\nBOOST_AUTO_TEST_CASE(testBufferPrepend)\n{\n  Buffer buf;\n  buf.append(string(200, 'y'));\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 200);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), Buffer::kInitialSize-200);\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend);\n\n  int x = 0;\n  buf.prepend(&x, sizeof x);\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 204);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), Buffer::kInitialSize-200);\n  BOOST_CHECK_EQUAL(buf.prependableBytes(), Buffer::kCheapPrepend - 4);\n}\n\nBOOST_AUTO_TEST_CASE(testBufferReadInt)\n{\n  Buffer buf;\n  buf.append(\"HTTP\");\n\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 4);\n  BOOST_CHECK_EQUAL(buf.peekInt8(), 'H');\n  int top16 = buf.peekInt16();\n  BOOST_CHECK_EQUAL(top16, 'H'*256 + 'T');\n  BOOST_CHECK_EQUAL(buf.peekInt32(), top16*65536 + 'T'*256 + 'P');\n\n  BOOST_CHECK_EQUAL(buf.readInt8(), 'H');\n  BOOST_CHECK_EQUAL(buf.readInt16(), 'T'*256 + 'T');\n  BOOST_CHECK_EQUAL(buf.readInt8(), 'P');\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 0);\n  BOOST_CHECK_EQUAL(buf.writableBytes(), Buffer::kInitialSize);\n\n  buf.appendInt8(-1);\n  buf.appendInt16(-2);\n  buf.appendInt32(-3);\n  BOOST_CHECK_EQUAL(buf.readableBytes(), 7);\n  BOOST_CHECK_EQUAL(buf.readInt8(), -1);\n  BOOST_CHECK_EQUAL(buf.readInt16(), -2);\n  BOOST_CHECK_EQUAL(buf.readInt32(), -3);\n}\n\nBOOST_AUTO_TEST_CASE(testBufferFindEOL)\n{\n  Buffer buf;\n  buf.append(string(100000, 'x'));\n  const char* null = NULL;\n  BOOST_CHECK_EQUAL(buf.findEOL(), null);\n  BOOST_CHECK_EQUAL(buf.findEOL(buf.peek()+90000), null);\n}\n\n#ifdef __GXX_EXPERIMENTAL_CXX0X__\nvoid output(Buffer&& buf, const void* inner)\n{\n  Buffer newbuf(std::move(buf));\n  \/\/ printf(\"New Buffer at %p, inner %p\\n\", &newbuf, newbuf.peek());\n  BOOST_CHECK_EQUAL(inner, newbuf.peek());\n}\n\n\/\/ NOTE: This test fails in g++ 4.4, passes in g++ 4.6.\nBOOST_AUTO_TEST_CASE(testMove)\n{\n  Buffer buf;\n  buf.append(\"muduo\", 5);\n  const void* inner = buf.peek();\n  \/\/ printf(\"Buffer at %p, inner %p\\n\", &buf, inner);\n  output(std::move(buf), inner);\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 \"net\/disk_cache\/cache_util.h\"\n\n#include \"base\/file_util.h\"\n#include \"base\/logging.h\"\n#include \"base\/string_util.h\"\n\nnamespace disk_cache {\n\nbool MoveCache(const FilePath& from_path, const FilePath& to_path) {\n  \/\/ Just use the version from base.\n  return file_util::Move(from_path, to_path);\n}\n\nvoid DeleteCache(const FilePath& path, bool remove_folder) {\n  file_util::FileEnumerator iter(path,\n                                 \/* recursive *\/ false,\n                                 file_util::FileEnumerator::FILES);\n  for (FilePath file = iter.Next(); !file.value().empty(); file = iter.Next()) {\n    if (!file_util::Delete(file, \/* recursive *\/ false))\n      NOTREACHED();\n  }\n\n  if (remove_folder) {\n    if (!file_util::Delete(path, \/* recursive *\/ false))\n      NOTREACHED();\n  }\n}\n\nbool DeleteCacheFile(const FilePath& name) {\n  return file_util::Delete(name, false);\n}\n\n}  \/\/ namespace disk_cache\n<commit_msg>Change NOTREACHED for a LOG(WARNING) when we can't delete the cache. This should help the unit tests.<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\/disk_cache\/cache_util.h\"\n\n#include \"base\/file_util.h\"\n#include \"base\/logging.h\"\n#include \"base\/string_util.h\"\n\nnamespace disk_cache {\n\nbool MoveCache(const FilePath& from_path, const FilePath& to_path) {\n  \/\/ Just use the version from base.\n  return file_util::Move(from_path, to_path);\n}\n\nvoid DeleteCache(const FilePath& path, bool remove_folder) {\n  file_util::FileEnumerator iter(path,\n                                 \/* recursive *\/ false,\n                                 file_util::FileEnumerator::FILES);\n  for (FilePath file = iter.Next(); !file.value().empty(); file = iter.Next()) {\n    if (!file_util::Delete(file, \/* recursive *\/ false)) {\n      LOG(WARNING) << \"Unable to delete cache.\";\n      return;\n    }\n  }\n\n  if (remove_folder) {\n    if (!file_util::Delete(path, \/* recursive *\/ false)) {\n      LOG(WARNING) << \"Unable to delete cache folder.\";\n      return;\n    }\n  }\n}\n\nbool DeleteCacheFile(const FilePath& name) {\n  return file_util::Delete(name, false);\n}\n\n}  \/\/ namespace disk_cache\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2017 Advanced Micro Devices, Inc. All rights reserved.\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\n#include <iostream>\n#include <vector>\n#include <string>\n#include <chrono>\n#include <array>\n#include <iterator>\n#include <random>\n#include <algorithm>\n\n#include <boost\/program_options.hpp>\n\n#include <hip\/hip_runtime.h>\n#include <rocrand.h>\n#include <file_common.hpp>\n\nextern \"C\" {\n#include \"bbattery.h\"\n}\n\n#define HIP_CHECK(condition)         \\\n  {                                  \\\n    hipError_t error = condition;    \\\n    if(error != hipSuccess){         \\\n        std::cout << error << std::endl; \\\n        exit(error); \\\n    } \\\n  }\n\n#define ROCRAND_CHECK(condition)                 \\\n  {                                              \\\n    rocrand_status status = condition;           \\\n    if(status != ROCRAND_STATUS_SUCCESS) {       \\\n        std::cout << status << std::endl; \\\n        exit(status); \\\n    } \\\n  }\n\n#ifndef DEFAULT_RAND_N\nconst size_t DEFAULT_RAND_N = 1024 * 1024 * 128;\n#endif\n\nvoid run_crush_test(const size_t size, const rocrand_rng_type rng_type)\n{\n    std::string filename = \"rocrand_generate.txt\";\n    char * file = new char[filename.length() + 1];\n    std::strcpy(file, filename.c_str());\n    \n    float * data;\n    float * h_data = new float[size];\n    HIP_CHECK(hipMalloc((void **)&data, size * sizeof(float)));\n\n    rocrand_generator generator;\n    ROCRAND_CHECK(rocrand_create_generator(&generator, rng_type));\n    \/\/ Make sure memory is allocated\n    HIP_CHECK(hipDeviceSynchronize());\n\n    ROCRAND_CHECK(rocrand_generate_uniform(generator, (float *) data, size));\n    HIP_CHECK(hipDeviceSynchronize());\n    \n    HIP_CHECK(hipMemcpy(h_data, data, size * sizeof(float), hipMemcpyDeviceToHost));\n    HIP_CHECK(hipDeviceSynchronize());\n    \n    rocrand_file_write_results(filename, h_data, size);\n    \n    rocrand_destroy_generator(generator);\n    HIP_CHECK(hipFree(data));\n    delete[] h_data;\n    \n    bbattery_SmallCrushFile(file);\n    delete[] file;\n}\n\nint main(int argc, char *argv[])\n{\n    namespace po = boost::program_options;\n    po::options_description options(\"options\");\n    options.add_options()\n        (\"help\", \"show usage instructions\")\n        (\"size\", po::value<size_t>()->default_value(DEFAULT_RAND_N), \"number of values\")\n        (\"engine\", po::value<std::string>()->default_value(\"philox\"), \"random number engine\")\n    ;\n    po::variables_map vm;\n    po::store(po::parse_command_line(argc, argv, options), vm);\n    po::notify(vm);\n\n    if(vm.count(\"help\")) {\n        std::cout << options << std::endl;\n        return 0;\n    }\n\n    const size_t size = vm[\"size\"].as<size_t>();\n    const std::string& engine = vm[\"engine\"].as<std::string>();\n\n    if(engine == \"philox\" || engine == \"all\"){\n        std::cout << \"philox4x32_10:\" << std::endl;\n        run_crush_test(size, ROCRAND_RNG_PSEUDO_PHILOX4_32_10);\n        return 0;\n    }\n    \n    std::cerr << \"Error: unknown random number engine '\" << engine << \"'\" << std::endl;\n    return -1;\n}\n<commit_msg>Use rocrand_generate instead of rocrand_generate_uniform<commit_after>\/\/ Copyright (c) 2017 Advanced Micro Devices, Inc. All rights reserved.\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\n#include <iostream>\n#include <vector>\n#include <string>\n#include <chrono>\n#include <array>\n#include <iterator>\n#include <random>\n#include <algorithm>\n\n#include <boost\/program_options.hpp>\n\n#include <hip\/hip_runtime.h>\n#include <rocrand.h>\n#include <file_common.hpp>\n\nextern \"C\" {\n#include \"bbattery.h\"\n}\n\n#define HIP_CHECK(condition)         \\\n  {                                  \\\n    hipError_t error = condition;    \\\n    if(error != hipSuccess){         \\\n        std::cout << error << std::endl; \\\n        exit(error); \\\n    } \\\n  }\n\n#define ROCRAND_CHECK(condition)                 \\\n  {                                              \\\n    rocrand_status status = condition;           \\\n    if(status != ROCRAND_STATUS_SUCCESS) {       \\\n        std::cout << status << std::endl; \\\n        exit(status); \\\n    } \\\n  }\n\n#ifndef DEFAULT_RAND_N\nconst size_t DEFAULT_RAND_N = 1024 * 1024 * 64;\n#endif\n\nvoid run_crush_test(const size_t size, const rocrand_rng_type rng_type)\n{\n    std::string filename = \"rocrand_generate.txt\";\n    char * file = new char[filename.length() + 1];\n    std::strcpy(file, filename.c_str());\n\n    unsigned int * data;\n    unsigned int * h_data = new unsigned int[size];\n    double * h_data_double = new double[size];\n    HIP_CHECK(hipMalloc((void **)&data, size * sizeof(unsigned int)));\n\n    rocrand_generator generator;\n    ROCRAND_CHECK(rocrand_create_generator(&generator, rng_type));\n    \/\/ Make sure memory is allocated\n    HIP_CHECK(hipDeviceSynchronize());\n\n    ROCRAND_CHECK(rocrand_generate(generator, (unsigned int *) data, size));\n    HIP_CHECK(hipDeviceSynchronize());\n\n    HIP_CHECK(hipMemcpy(h_data, data, size * sizeof(unsigned int), hipMemcpyDeviceToHost));\n    HIP_CHECK(hipDeviceSynchronize());\n\n    for(size_t i = 0; i < size; i++)\n    {\n        h_data_double[i] = static_cast<double>(h_data[i]) \/ (UINT_MAX + 1UL);\n    }\n    delete[] h_data;\n\n    rocrand_file_write_results(filename, h_data_double, size);\n\n    rocrand_destroy_generator(generator);\n    HIP_CHECK(hipFree(data));\n    delete[] h_data_double;\n\n    bbattery_SmallCrushFile(file);\n    delete[] file;\n}\n\nint main(int argc, char *argv[])\n{\n    namespace po = boost::program_options;\n    po::options_description options(\"options\");\n    options.add_options()\n        (\"help\", \"show usage instructions\")\n        (\"size\", po::value<size_t>()->default_value(DEFAULT_RAND_N), \"number of values\")\n        (\"engine\", po::value<std::string>()->default_value(\"philox\"), \"random number engine\")\n    ;\n    po::variables_map vm;\n    po::store(po::parse_command_line(argc, argv, options), vm);\n    po::notify(vm);\n\n    if(vm.count(\"help\")) {\n        std::cout << options << std::endl;\n        return 0;\n    }\n\n    const size_t size = vm[\"size\"].as<size_t>();\n    const std::string& engine = vm[\"engine\"].as<std::string>();\n\n    if(engine == \"philox\" || engine == \"all\"){\n        std::cout << \"philox4x32_10:\" << std::endl;\n        run_crush_test(size, ROCRAND_RNG_PSEUDO_PHILOX4_32_10);\n        return 0;\n    }\n\n    std::cerr << \"Error: unknown random number engine '\" << engine << \"'\" << std::endl;\n    return -1;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*!\n * \\page SimulationTestSuite_cpp Command-Line Test to Demonstrate How To Test DSim\n * \\code\n *\/\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Import section\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ STL\n#include <sstream>\n#include <fstream>\n#include <string>\n\/\/ Boost Unit Test Framework (UTF)\n#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MAIN\n#define BOOST_TEST_MODULE DSimTest\n#include <boost\/test\/unit_test.hpp>\n\/\/ StdAir\n#include <stdair\/stdair_exceptions.hpp>\n#include <stdair\/basic\/BasConst_General.hpp>\n#include <stdair\/basic\/BasLogParams.hpp>\n#include <stdair\/basic\/BasFileMgr.hpp>\n#include <stdair\/basic\/DemandGenerationMethod.hpp>\n#include <stdair\/service\/Logger.hpp>\n\/\/ SimFQT\n#include <simfqt\/SIMFQT_Types.hpp>\n\/\/ Dsim\n#include <dsim\/DSIM_Types.hpp>\n#include <dsim\/DSIM_Service.hpp>\n#include <dsim\/config\/dsim-paths.hpp>\n\nnamespace boost_utf = boost::unit_test;\n\n\/\/ (Boost) Unit Test XML Report\nstd::ofstream utfReportStream (\"SimulationTestSuite_utfresults.xml\");\n\n\/**\n * Configuration for the Boost Unit Test Framework (UTF)\n *\/\nstruct UnitTestConfig {\n  \/** Constructor. *\/\n  UnitTestConfig() {\n    boost_utf::unit_test_log.set_stream (utfReportStream);\n    boost_utf::unit_test_log.set_format (boost_utf::XML);\n    boost_utf::unit_test_log.set_threshold_level (boost_utf::log_test_units);\n    \/\/boost_utf::unit_test_log.set_threshold_level (boost_utf::log_successful_tests);\n  }\n  \/** Destructor. *\/\n  ~UnitTestConfig() {\n  }\n};\n\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ Main: Unit Test Suite \/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ Set the UTF configuration (re-direct the output to a specific file)\nBOOST_GLOBAL_FIXTURE (UnitTestConfig);\n\n\/\/ Start the test suite\nBOOST_AUTO_TEST_SUITE (master_test_suite)\n\n\/**\n * Test a simple simulation\n *\/\nBOOST_AUTO_TEST_CASE (simple_simulation_test) {\n\n  \/\/ Method for the demand generation (here, statistics order)\n  const stdair::DemandGenerationMethod lOrderStatDemandGenMethod =\n    stdair::DemandGenerationMethod::STA_ORD;\n\n  \/\/ Start date\n  const stdair::Date_T lStartDate (2009, boost::gregorian::Jan, 01);\n  \n  \/\/ End date\n  const stdair::Date_T lEndDate (2011, boost::gregorian::Jan, 01);\n\n  \/\/ Random generation seed\n  const stdair::RandomSeed_T lRandomSeed (stdair::DEFAULT_RANDOM_SEED);\n  \n  \/\/ Number of simulation runs to be performed\n  const DSIM::NbOfRuns_T lNbOfRuns (1);\n\n  \/\/ Demand input file name\n  const stdair::Filename_T lDemandInputFilename (STDAIR_SAMPLE_DIR\n                                                 \"\/rds01\/demand.csv\");\n\n  \/\/ Schedule input file name\n  const stdair::Filename_T lScheduleInputFilename (STDAIR_SAMPLE_DIR\n                                                   \"\/rds01\/schedule.csv\");\n    \n  \/\/ O&D input file name\n  const stdair::Filename_T lOnDInputFilename (STDAIR_SAMPLE_DIR \"\/ond01.csv\");\n\n  \/\/ FRAT5 curve input file name\n  const stdair::Filename_T lFRAT5InputFilename (STDAIR_SAMPLE_DIR\n                                               \"\/frat5.csv\");\n\n  \/\/ Fare family disutility curve input file name\n  const stdair::Filename_T lFFDisutilityInputFilename (STDAIR_SAMPLE_DIR\n                                                       \"\/ffDisutility.csv\");\n\n  \/\/ Yield input file name\n  const stdair::Filename_T lYieldInputFilename (STDAIR_SAMPLE_DIR\n                                               \"\/rds01\/yield.csv\");\n    \n  \/\/ Fare input file name\n  const stdair::Filename_T lFareInputFilename (STDAIR_SAMPLE_DIR\n                                               \"\/rds01\/fare.csv\");\n\n  \/\/ Check that the file path given as input corresponds to an actual file\n  bool doesExistAndIsReadable =\n    stdair::BasFileMgr::doesExistAndIsReadable (lScheduleInputFilename);\n  BOOST_CHECK_MESSAGE (doesExistAndIsReadable == true,\n                       \"The '\" << lScheduleInputFilename\n                       << \"' input file can not be open and read\");\n\n  \/\/ Check that the file path given as input corresponds to an actual file\n  doesExistAndIsReadable =\n    stdair::BasFileMgr::doesExistAndIsReadable (lOnDInputFilename);\n  BOOST_CHECK_MESSAGE (doesExistAndIsReadable == true,\n                       \"The '\" << lOnDInputFilename\n                       << \"' input file can not be open and read\");\n  \n  \/\/ Check that the file path given as input corresponds to an actual file\n  doesExistAndIsReadable =\n    stdair::BasFileMgr::doesExistAndIsReadable (lFRAT5InputFilename);\n  BOOST_CHECK_MESSAGE (doesExistAndIsReadable == true,\n                       \"The '\" << lFRAT5InputFilename\n                       << \"' input file can not be open and read\");\n  \n  \/\/ Check that the file path given as input corresponds to an actual file\n  doesExistAndIsReadable =\n    stdair::BasFileMgr::doesExistAndIsReadable (lFFDisutilityInputFilename);\n  BOOST_CHECK_MESSAGE (doesExistAndIsReadable == true,\n                       \"The '\" << lFFDisutilityInputFilename\n                       << \"' input file can not be open and read\");\n\n  \/\/ Check that the file path given as input corresponds to an actual file\n  doesExistAndIsReadable =\n    stdair::BasFileMgr::doesExistAndIsReadable (lDemandInputFilename);\n  BOOST_CHECK_MESSAGE (doesExistAndIsReadable == true,\n                       \"The '\" << lDemandInputFilename\n                       << \"' input file can not be open and read\");\n\n  \/\/ Check that the file path given as input corresponds to an actual file\n  doesExistAndIsReadable =\n    stdair::BasFileMgr::doesExistAndIsReadable (lFareInputFilename);\n  BOOST_CHECK_MESSAGE (doesExistAndIsReadable == true,\n                       \"The '\" << lFareInputFilename\n                       << \"' input file can not be open and read\");\n\n  \/\/ Check that the file path given as input corresponds to an actual file\n  doesExistAndIsReadable =\n    stdair::BasFileMgr::doesExistAndIsReadable (lYieldInputFilename);\n  BOOST_CHECK_MESSAGE (doesExistAndIsReadable == true,\n                       \"The '\" << lYieldInputFilename\n                       << \"' input file can not be open and read\");\n\n  \/\/ Output log File\n  const stdair::Filename_T lLogFilename (\"SimulationTestSuite.log\");\n\n  \/\/ Set the log parameters\n  std::ofstream logOutputFile;\n  \/\/ Open and clean the log outputfile\n  logOutputFile.open (lLogFilename.c_str());\n  logOutputFile.clear();\n  \n  \/\/ Initialise the simulation context\n  const stdair::BasLogParams lLogParams (stdair::LOG::DEBUG, logOutputFile);\n  \n  DSIM::DSIM_Service dsimService (lLogParams, lStartDate, lEndDate,\n                                  lRandomSeed);\n\n  \/\/ Build the BOM tree from parsing input files\n  const stdair::ScheduleFilePath lScheduleFilePath (lScheduleInputFilename);\n  const stdair::ODFilePath lODFilePath (lOnDInputFilename);\n  const stdair::FRAT5FilePath lFRAT5FilePath (lFRAT5InputFilename);\n  const stdair::FFDisutilityFilePath lFFDisutilityFilePath (lFFDisutilityInputFilename);\n  const SIMFQT::FareFilePath lFareFilePath (lFareInputFilename);\n  const AIRRAC::YieldFilePath lYieldFilePath (lYieldInputFilename);\n  const TRADEMGEN::DemandFilePath lDemandFilePath (lDemandInputFilename);\n\n  \/\/ Load the input files\n  BOOST_CHECK_NO_THROW (dsimService.setInputFiles(lScheduleFilePath, \n\t\t\t\t\t\t  lODFilePath, \n\t\t\t\t\t\t  lFRAT5FilePath,\n\t\t\t\t\t\t  lFFDisutilityFilePath, \n\t\t\t\t\t\t  lYieldFilePath,\n\t\t\t\t\t\t  lFareFilePath, \n\t\t\t\t\t\t  lDemandFilePath));\n\t \n  \/\/ Parse the input files \n  BOOST_CHECK_NO_THROW (dsimService.parseAndLoad ());\n\n  \/\/ Initialise the snapshot and RM events\n  BOOST_CHECK_NO_THROW (dsimService.initSnapshotAndRMEvents());\n  \n  \/\/ Perform a simulation\n  \/\/ BOOST_CHECK_THROW (dsimService.simulate(), stdair::EventException);\n  BOOST_CHECK_NO_THROW (dsimService.simulate (lNbOfRuns,\n                                              lOrderStatDemandGenMethod));\n\n  \/\/ Close the log file\n  logOutputFile.close();\n}\n\n\/\/ End the test suite\nBOOST_AUTO_TEST_SUITE_END()\n\n\/*!\n * \\endcode\n *\/\n<commit_msg>[Test] Adapted the test to the new DSim API.<commit_after>\/*!\n * \\page SimulationTestSuite_cpp Command-Line Test to Demonstrate How To Test DSim\n * \\code\n *\/\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Import section\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ STL\n#include <sstream>\n#include <fstream>\n#include <string>\n\/\/ Boost Unit Test Framework (UTF)\n#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MAIN\n#define BOOST_TEST_MODULE DSimTest\n#include <boost\/test\/unit_test.hpp>\n\/\/ StdAir\n#include <stdair\/stdair_exceptions.hpp>\n#include <stdair\/basic\/BasConst_General.hpp>\n#include <stdair\/basic\/BasLogParams.hpp>\n#include <stdair\/basic\/BasFileMgr.hpp>\n#include <stdair\/basic\/DemandGenerationMethod.hpp>\n#include <stdair\/service\/Logger.hpp>\n\/\/ SimFQT\n#include <simfqt\/SIMFQT_Types.hpp>\n\/\/ Dsim\n#include <dsim\/DSIM_Types.hpp>\n#include <dsim\/DSIM_Service.hpp>\n#include <dsim\/config\/dsim-paths.hpp>\n\nnamespace boost_utf = boost::unit_test;\n\n\/\/ (Boost) Unit Test XML Report\nstd::ofstream utfReportStream (\"SimulationTestSuite_utfresults.xml\");\n\n\/**\n * Configuration for the Boost Unit Test Framework (UTF)\n *\/\nstruct UnitTestConfig {\n  \/** Constructor. *\/\n  UnitTestConfig() {\n    boost_utf::unit_test_log.set_stream (utfReportStream);\n    boost_utf::unit_test_log.set_format (boost_utf::XML);\n    boost_utf::unit_test_log.set_threshold_level (boost_utf::log_test_units);\n    \/\/boost_utf::unit_test_log.set_threshold_level (boost_utf::log_successful_tests);\n  }\n  \/** Destructor. *\/\n  ~UnitTestConfig() {\n  }\n};\n\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ Main: Unit Test Suite \/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ Set the UTF configuration (re-direct the output to a specific file)\nBOOST_GLOBAL_FIXTURE (UnitTestConfig);\n\n\/\/ Start the test suite\nBOOST_AUTO_TEST_SUITE (master_test_suite)\n\n\/**\n * Test a simple simulation\n *\/\nBOOST_AUTO_TEST_CASE (simple_simulation_test) {\n\n  \/\/ Method for the demand generation (here, statistics order)\n  const stdair::DemandGenerationMethod lOrderStatDemandGenMethod =\n    stdair::DemandGenerationMethod::STA_ORD;\n\n  \/\/ Start date\n  const stdair::Date_T lStartDate (2009, boost::gregorian::Jan, 01);\n  \n  \/\/ End date\n  const stdair::Date_T lEndDate (2011, boost::gregorian::Jan, 01);\n\n  \/\/ Random generation seed\n  const stdair::RandomSeed_T lRandomSeed (stdair::DEFAULT_RANDOM_SEED);\n  \n  \/\/ Number of simulation runs to be performed\n  const DSIM::NbOfRuns_T lNbOfRuns (1);\n\n  \/\/ Demand input file name\n  const stdair::Filename_T lDemandInputFilename (STDAIR_SAMPLE_DIR\n                                                 \"\/rds01\/demand.csv\");\n\n  \/\/ Schedule input file name\n  const stdair::Filename_T lScheduleInputFilename (STDAIR_SAMPLE_DIR\n                                                   \"\/rds01\/schedule.csv\");\n    \n  \/\/ O&D input file name\n  const stdair::Filename_T lOnDInputFilename (STDAIR_SAMPLE_DIR \"\/ond01.csv\");\n\n  \/\/ FRAT5 curve input file name\n  const stdair::Filename_T lFRAT5InputFilename (STDAIR_SAMPLE_DIR\n                                               \"\/frat5.csv\");\n\n  \/\/ Fare family disutility curve input file name\n  const stdair::Filename_T lFFDisutilityInputFilename (STDAIR_SAMPLE_DIR\n                                                       \"\/ffDisutility.csv\");\n\n  \/\/ Yield input file name\n  const stdair::Filename_T lYieldInputFilename (STDAIR_SAMPLE_DIR\n                                               \"\/rds01\/yield.csv\");\n    \n  \/\/ Fare input file name\n  const stdair::Filename_T lFareInputFilename (STDAIR_SAMPLE_DIR\n                                               \"\/rds01\/fare.csv\");\n\n  \/\/ Check that the file path given as input corresponds to an actual file\n  bool doesExistAndIsReadable =\n    stdair::BasFileMgr::doesExistAndIsReadable (lScheduleInputFilename);\n  BOOST_CHECK_MESSAGE (doesExistAndIsReadable == true,\n                       \"The '\" << lScheduleInputFilename\n                       << \"' input file can not be open and read\");\n\n  \/\/ Check that the file path given as input corresponds to an actual file\n  doesExistAndIsReadable =\n    stdair::BasFileMgr::doesExistAndIsReadable (lOnDInputFilename);\n  BOOST_CHECK_MESSAGE (doesExistAndIsReadable == true,\n                       \"The '\" << lOnDInputFilename\n                       << \"' input file can not be open and read\");\n  \n  \/\/ Check that the file path given as input corresponds to an actual file\n  doesExistAndIsReadable =\n    stdair::BasFileMgr::doesExistAndIsReadable (lFRAT5InputFilename);\n  BOOST_CHECK_MESSAGE (doesExistAndIsReadable == true,\n                       \"The '\" << lFRAT5InputFilename\n                       << \"' input file can not be open and read\");\n  \n  \/\/ Check that the file path given as input corresponds to an actual file\n  doesExistAndIsReadable =\n    stdair::BasFileMgr::doesExistAndIsReadable (lFFDisutilityInputFilename);\n  BOOST_CHECK_MESSAGE (doesExistAndIsReadable == true,\n                       \"The '\" << lFFDisutilityInputFilename\n                       << \"' input file can not be open and read\");\n\n  \/\/ Check that the file path given as input corresponds to an actual file\n  doesExistAndIsReadable =\n    stdair::BasFileMgr::doesExistAndIsReadable (lDemandInputFilename);\n  BOOST_CHECK_MESSAGE (doesExistAndIsReadable == true,\n                       \"The '\" << lDemandInputFilename\n                       << \"' input file can not be open and read\");\n\n  \/\/ Check that the file path given as input corresponds to an actual file\n  doesExistAndIsReadable =\n    stdair::BasFileMgr::doesExistAndIsReadable (lFareInputFilename);\n  BOOST_CHECK_MESSAGE (doesExistAndIsReadable == true,\n                       \"The '\" << lFareInputFilename\n                       << \"' input file can not be open and read\");\n\n  \/\/ Check that the file path given as input corresponds to an actual file\n  doesExistAndIsReadable =\n    stdair::BasFileMgr::doesExistAndIsReadable (lYieldInputFilename);\n  BOOST_CHECK_MESSAGE (doesExistAndIsReadable == true,\n                       \"The '\" << lYieldInputFilename\n                       << \"' input file can not be open and read\");\n\n  \/\/ Output log File\n  const stdair::Filename_T lLogFilename (\"SimulationTestSuite.log\");\n\n  \/\/ Set the log parameters\n  std::ofstream logOutputFile;\n  \/\/ Open and clean the log outputfile\n  logOutputFile.open (lLogFilename.c_str());\n  logOutputFile.clear();\n  \n  \/\/ Initialise the simulation context\n  const stdair::BasLogParams lLogParams (stdair::LOG::DEBUG, logOutputFile);\n  \n  DSIM::DSIM_Service dsimService (lLogParams, lStartDate, lEndDate,\n                                  lRandomSeed, lOrderStatDemandGenMethod,\n\t\t\t\t  lNbOfRuns);\n\n  \/\/ Build the BOM tree from parsing input files\n  const stdair::ScheduleFilePath lScheduleFilePath (lScheduleInputFilename);\n  const stdair::ODFilePath lODFilePath (lOnDInputFilename);\n  const stdair::FRAT5FilePath lFRAT5FilePath (lFRAT5InputFilename);\n  const stdair::FFDisutilityFilePath lFFDisutilityFilePath (lFFDisutilityInputFilename);\n  const SIMFQT::FareFilePath lFareFilePath (lFareInputFilename);\n  const AIRRAC::YieldFilePath lYieldFilePath (lYieldInputFilename);\n  const TRADEMGEN::DemandFilePath lDemandFilePath (lDemandInputFilename);\n\n  \/\/ Load the input files\n  BOOST_CHECK_NO_THROW (dsimService.setInputFiles(lScheduleFilePath, \n\t\t\t\t\t\t  lODFilePath, \n\t\t\t\t\t\t  lFRAT5FilePath,\n\t\t\t\t\t\t  lFFDisutilityFilePath, \n\t\t\t\t\t\t  lYieldFilePath,\n\t\t\t\t\t\t  lFareFilePath, \n\t\t\t\t\t\t  lDemandFilePath));\n\t \n  \/\/ Parse the input files \n  BOOST_CHECK_NO_THROW (dsimService.parseAndLoad ());\n\n  \/\/ Initialise the snapshot and RM events\n  BOOST_CHECK_NO_THROW (dsimService.initSnapshotAndRMEvents());\n  \n  \/\/ Perform a simulation\n  \/\/ BOOST_CHECK_THROW (dsimService.simulate(), stdair::EventException);\n  BOOST_CHECK_NO_THROW (dsimService.simulate ());\n\n  \/\/ Close the log file\n  logOutputFile.close();\n}\n\n\/\/ End the test suite\nBOOST_AUTO_TEST_SUITE_END()\n\n\/*!\n * \\endcode\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 <stdio.h>\n#include <vector>\n\n#include \"NETEQTEST_RTPpacket.h\"\n\n\n\/*********************\/\n\/* Misc. definitions *\/\n\/*********************\/\n\n#define FIRSTLINELEN 40\n\n\nint main(int argc, char* argv[])\n{\n\tFILE *inFile=fopen(argv[1],\"rb\");\n\tif (!inFile)\n    {\n        printf(\"Cannot open input file %s\\n\", argv[1]);\n        return(-1);\n    }\n    printf(\"Input file: %s\\n\",argv[1]);\n\n\tFILE *outFile=fopen(argv[2],\"wt\");\n\tif (!outFile)\n    {\n        printf(\"Cannot open output file %s\\n\", argv[2]);\n        return(-1);\n    }\n\tprintf(\"Output file: %s\\n\\n\",argv[2]);\n\n    \/\/ print file header\n    fprintf(outFile, \"SeqNo  TimeStamp   SendTime  Size    PT\\n\");\n\n\n    \/\/ read file header \n\tchar firstline[FIRSTLINELEN];\n\tfgets(firstline, FIRSTLINELEN, inFile);\n\tfread(firstline, 4+4+4+2+2, 1, inFile); \/\/ start_sec + start_usec\t+ source + port + padding\n\t\n    NETEQTEST_RTPpacket packet;\n\n    while (packet.readFromFile(inFile) >= 0)\n    {\n        \/\/ write packet data to file\n        fprintf(outFile, \"%5u %10u %10u %5i %5i\\n\",\n            packet.sequenceNumber(), packet.timeStamp(), packet.time(),\n            packet.dataLen(), packet.payloadType());\n    }\n\n    fclose(inFile);\n    fclose(outFile);\n\n    return 0;\n}\n<commit_msg>Adding marker bit to RTPanalyze results<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 <stdio.h>\n#include <vector>\n\n#include \"NETEQTEST_RTPpacket.h\"\n\n\n\/*********************\/\n\/* Misc. definitions *\/\n\/*********************\/\n\n#define FIRSTLINELEN 40\n\n\nint main(int argc, char* argv[])\n{\n\tFILE *inFile=fopen(argv[1],\"rb\");\n\tif (!inFile)\n    {\n        printf(\"Cannot open input file %s\\n\", argv[1]);\n        return(-1);\n    }\n    printf(\"Input file: %s\\n\",argv[1]);\n\n\tFILE *outFile=fopen(argv[2],\"wt\");\n\tif (!outFile)\n    {\n        printf(\"Cannot open output file %s\\n\", argv[2]);\n        return(-1);\n    }\n\tprintf(\"Output file: %s\\n\\n\",argv[2]);\n\n    \/\/ print file header\n    fprintf(outFile, \"SeqNo  TimeStamp   SendTime  Size    PT  M\\n\");\n\n\n    \/\/ read file header \n\tchar firstline[FIRSTLINELEN];\n\tfgets(firstline, FIRSTLINELEN, inFile);\n\tfread(firstline, 4+4+4+2+2, 1, inFile); \/\/ start_sec + start_usec\t+ source + port + padding\n\t\n    NETEQTEST_RTPpacket packet;\n\n    while (packet.readFromFile(inFile) >= 0)\n    {\n        \/\/ write packet data to file\n        fprintf(outFile, \"%5u %10u %10u %5i %5i %2i\\n\",\n            packet.sequenceNumber(), packet.timeStamp(), packet.time(),\n            packet.dataLen(), packet.payloadType(), packet.markerBit());\n    }\n\n    fclose(inFile);\n    fclose(outFile);\n\n    return 0;\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\/\/ Performs basic inspection of the disk cache files with minimal disruption\n\/\/ to the actual files (they still may change if an error is detected on the\n\/\/ files).\n\n#include <stdio.h>\n#include <string>\n\n#include \"base\/file_util.h\"\n#include \"base\/message_loop.h\"\n#include \"net\/base\/file_stream.h\"\n#include \"net\/disk_cache\/block_files.h\"\n#include \"net\/disk_cache\/disk_format.h\"\n#include \"net\/disk_cache\/mapped_file.h\"\n#include \"net\/disk_cache\/storage_block.h\"\n\nnamespace {\n\nconst wchar_t kIndexName[] = L\"index\";\nconst wchar_t kDataPrefix[] = L\"data_\";\n\n\/\/ Reads the |header_size| bytes from the beginning of file |name|.\nbool ReadHeader(const std::wstring& name, char* header, int header_size) {\n  net::FileStream file;\n  file.Open(FilePath::FromWStringHack(name),\n      base::PLATFORM_FILE_OPEN | base::PLATFORM_FILE_READ);\n  if (!file.IsOpen()) {\n    printf(\"Unable to open file %ls\\n\", name.c_str());\n    return false;\n  }\n\n  int read = file.Read(header, header_size, NULL);\n  if (read != header_size) {\n    printf(\"Unable to read file %ls\\n\", name.c_str());\n    return false;\n  }\n  return true;\n}\n\nint GetMajorVersionFromFile(const std::wstring& name) {\n  disk_cache::IndexHeader header;\n  if (!ReadHeader(name, reinterpret_cast<char*>(&header), sizeof(header)))\n    return 0;\n\n  return header.version >> 16;\n}\n\n\/\/ Dumps the contents of the Index-file header.\nvoid DumpIndexHeader(const std::wstring& name) {\n  disk_cache::IndexHeader header;\n  if (!ReadHeader(name, reinterpret_cast<char*>(&header), sizeof(header)))\n    return;\n\n  printf(\"Index file:\\n\");\n  printf(\"magic: %x\\n\", header.magic);\n  printf(\"version: %d.%d\\n\", header.version >> 16, header.version & 0xffff);\n  printf(\"entries: %d\\n\", header.num_entries);\n  printf(\"total bytes: %d\\n\", header.num_bytes);\n  printf(\"last file number: %d\\n\", header.last_file);\n  printf(\"current id: %d\\n\", header.this_id);\n  printf(\"table length: %d\\n\", header.table_len);\n  printf(\"last crash: %d\\n\", header.crash);\n  printf(\"experiment: %d\\n\", header.experiment);\n  for (int i = 0; i < 5; i++) {\n    printf(\"head %d: 0x%x\\n\", i, header.lru.heads[i]);\n    printf(\"tail %d: 0x%x\\n\", i, header.lru.tails[i]);\n  }\n  printf(\"transaction: 0x%x\\n\", header.lru.transaction);\n  printf(\"operation: %d\\n\", header.lru.operation);\n  printf(\"operation list: %d\\n\", header.lru.operation_list);\n  printf(\"-------------------------\\n\\n\");\n}\n\n\/\/ Dumps the contents of a block-file header.\nvoid DumpBlockHeader(const std::wstring& name) {\n  disk_cache::BlockFileHeader header;\n  if (!ReadHeader(name, reinterpret_cast<char*>(&header), sizeof(header)))\n    return;\n\n  std::wstring file_name = file_util::GetFilenameFromPath(name);\n\n  printf(\"Block file: %ls\\n\", file_name.c_str());\n  printf(\"magic: %x\\n\", header.magic);\n  printf(\"version: %d.%d\\n\", header.version >> 16, header.version & 0xffff);\n  printf(\"file id: %d\\n\", header.this_file);\n  printf(\"next file id: %d\\n\", header.next_file);\n  printf(\"entry size: %d\\n\", header.entry_size);\n  printf(\"current entries: %d\\n\", header.num_entries);\n  printf(\"max entries: %d\\n\", header.max_entries);\n  printf(\"updating: %d\\n\", header.updating);\n  printf(\"empty sz 1: %d\\n\", header.empty[0]);\n  printf(\"empty sz 2: %d\\n\", header.empty[1]);\n  printf(\"empty sz 3: %d\\n\", header.empty[2]);\n  printf(\"empty sz 4: %d\\n\", header.empty[3]);\n  printf(\"user 0: 0x%x\\n\", header.user[0]);\n  printf(\"user 1: 0x%x\\n\", header.user[1]);\n  printf(\"user 2: 0x%x\\n\", header.user[2]);\n  printf(\"user 3: 0x%x\\n\", header.user[3]);\n  printf(\"-------------------------\\n\\n\");\n}\n\n\/\/ Simple class that interacts with the set of cache files.\nclass CacheDumper {\n public:\n  explicit CacheDumper(const std::wstring& path)\n      : path_(path),\n        block_files_(FilePath::FromWStringHack(path)),\n        index_(NULL) {}\n\n  bool Init();\n\n  \/\/ Reads an entry from disk. Return false when all entries have been already\n  \/\/ returned.\n  bool GetEntry(disk_cache::EntryStore* entry);\n\n  \/\/ Loads a specific block from the block files.\n  bool LoadEntry(disk_cache::CacheAddr addr, disk_cache::EntryStore* entry);\n  bool LoadRankings(disk_cache::CacheAddr addr,\n                    disk_cache::RankingsNode* rankings);\n\n private:\n  std::wstring path_;\n  disk_cache::BlockFiles block_files_;\n  scoped_refptr<disk_cache::MappedFile> index_file_;\n  disk_cache::Index* index_;\n  int current_hash_;\n  disk_cache::CacheAddr next_addr_;\n  DISALLOW_COPY_AND_ASSIGN(CacheDumper);\n};\n\nbool CacheDumper::Init() {\n  if (!block_files_.Init(false)) {\n    printf(\"Unable to init block files\\n\");\n    return false;\n  }\n\n  std::wstring index_name(path_);\n  file_util::AppendToPath(&index_name, kIndexName);\n  index_file_ = new disk_cache::MappedFile;\n  index_ = reinterpret_cast<disk_cache::Index*>(index_file_->Init(\n      FilePath::FromWStringHack(index_name), 0));\n  if (!index_) {\n    printf(\"Unable to map index\\n\");\n    return false;\n  }\n\n  current_hash_ = 0;\n  next_addr_ = 0;\n  return true;\n}\n\nbool CacheDumper::GetEntry(disk_cache::EntryStore* entry) {\n  if (next_addr_) {\n    if (LoadEntry(next_addr_, entry)) {\n      next_addr_ = entry->next;\n      if (!next_addr_)\n        current_hash_++;\n      return true;\n    } else {\n      printf(\"Unable to load entry at address 0x%x\\n\", next_addr_);\n      next_addr_ = 0;\n      current_hash_++;\n    }\n  }\n\n  for (int i = current_hash_; i < index_->header.table_len; i++) {\n    \/\/ Yes, we'll crash if the table is shorter than expected, but only after\n    \/\/ dumping every entry that we can find.\n    if (index_->table[i]) {\n      current_hash_ = i;\n      if (LoadEntry(index_->table[i], entry)) {\n        next_addr_ = entry->next;\n        if (!next_addr_)\n          current_hash_++;\n        return true;\n      } else {\n        printf(\"Unable to load entry at address 0x%x\\n\", index_->table[i]);\n      }\n    }\n  }\n  return false;\n}\n\nbool CacheDumper::LoadEntry(disk_cache::CacheAddr addr,\n                            disk_cache::EntryStore* entry) {\n  disk_cache::Addr address(addr);\n  disk_cache::MappedFile* file = block_files_.GetFile(address);\n  if (!file)\n    return false;\n\n  disk_cache::CacheEntryBlock entry_block(file, address);\n  if (!entry_block.Load())\n    return false;\n\n  memcpy(entry, entry_block.Data(), sizeof(*entry));\n  printf(\"Entry at 0x%x\\n\", addr);\n  return true;\n}\n\nbool CacheDumper::LoadRankings(disk_cache::CacheAddr addr,\n                               disk_cache::RankingsNode* rankings) {\n  disk_cache::Addr address(addr);\n  disk_cache::MappedFile* file = block_files_.GetFile(address);\n  if (!file)\n    return false;\n\n  disk_cache::CacheRankingsBlock rank_block(file, address);\n  if (!rank_block.Load())\n    return false;\n\n  memcpy(rankings, rank_block.Data(), sizeof(*rankings));\n  printf(\"Rankings at 0x%x\\n\", addr);\n  return true;\n}\n\nvoid DumpEntry(const disk_cache::EntryStore& entry) {\n  std::string key;\n  if (!entry.long_key) {\n    key = entry.key;\n    if (key.size() > 50)\n      key.resize(50);\n  }\n\n  printf(\"hash: 0x%x\\n\", entry.hash);\n  printf(\"next entry: 0x%x\\n\", entry.next);\n  printf(\"rankings: 0x%x\\n\", entry.rankings_node);\n  printf(\"key length: %d\\n\", entry.key_len);\n  printf(\"key: \\\"%s\\\"\\n\", key.c_str());\n  printf(\"key addr: 0x%x\\n\", entry.long_key);\n  printf(\"reuse count: %d\\n\", entry.reuse_count);\n  printf(\"refetch count: %d\\n\", entry.refetch_count);\n  printf(\"state: %d\\n\", entry.state);\n  for (int i = 0; i < 4; i++) {\n    printf(\"data size %d: %d\\n\", i, entry.data_size[i]);\n    printf(\"data addr %d: 0x%x\\n\", i, entry.data_addr[i]);\n  }\n  printf(\"----------\\n\\n\");\n}\n\nvoid DumpRankings(const disk_cache::RankingsNode& rankings) {\n  printf(\"next: 0x%x\\n\", rankings.next);\n  printf(\"prev: 0x%x\\n\", rankings.prev);\n  printf(\"entry: 0x%x\\n\", rankings.contents);\n  printf(\"dirty: %d\\n\", rankings.dirty);\n  printf(\"pointer: 0x%x\\n\", rankings.dummy);\n  printf(\"----------\\n\\n\");\n}\n\n}  \/\/ namespace.\n\n\/\/ -----------------------------------------------------------------------\n\nint GetMajorVersion(const std::wstring& input_path) {\n  std::wstring index_name(input_path);\n  file_util::AppendToPath(&index_name, kIndexName);\n\n  int version = GetMajorVersionFromFile(index_name);\n  if (!version)\n    return 0;\n\n  std::wstring data_name(input_path);\n  file_util::AppendToPath(&data_name, L\"data_0\");\n  if (version != GetMajorVersionFromFile(data_name))\n    return 0;\n\n  data_name = input_path;\n  file_util::AppendToPath(&data_name, L\"data_1\");\n  if (version != GetMajorVersionFromFile(data_name))\n    return 0;\n\n  return version;\n}\n\n\/\/ Dumps the headers of all files.\nint DumpHeaders(const std::wstring& input_path) {\n  std::wstring index_name(input_path);\n  file_util::AppendToPath(&index_name, kIndexName);\n  DumpIndexHeader(index_name);\n\n  std::wstring pattern(kDataPrefix);\n  pattern.append(L\"*\");\n  file_util::FileEnumerator iter(FilePath::FromWStringHack(input_path), false,\n                                 file_util::FileEnumerator::FILES, pattern);\n  for (std::wstring file = iter.Next().ToWStringHack(); !file.empty();\n       file = iter.Next().ToWStringHack()) {\n    DumpBlockHeader(file);\n  }\n\n  return 0;\n}\n\n\/\/ Dumps all entries from the cache.\nint DumpContents(const std::wstring& input_path) {\n  DumpHeaders(input_path);\n\n  \/\/ We need a message loop, although we really don't run any task.\n  MessageLoop loop(MessageLoop::TYPE_IO);\n  CacheDumper dumper(input_path);\n  if (!dumper.Init())\n    return -1;\n\n  disk_cache::EntryStore entry;\n  while (dumper.GetEntry(&entry)) {\n    DumpEntry(entry);\n    disk_cache::RankingsNode rankings;\n    if (dumper.LoadRankings(entry.rankings_node, &rankings))\n      DumpRankings(rankings);\n  }\n\n  printf(\"Done.\\n\");\n\n  return 0;\n}\n<commit_msg>Uninitialized member vars in CacheDumper.<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\/\/ Performs basic inspection of the disk cache files with minimal disruption\n\/\/ to the actual files (they still may change if an error is detected on the\n\/\/ files).\n\n#include <stdio.h>\n#include <string>\n\n#include \"base\/file_util.h\"\n#include \"base\/message_loop.h\"\n#include \"net\/base\/file_stream.h\"\n#include \"net\/disk_cache\/block_files.h\"\n#include \"net\/disk_cache\/disk_format.h\"\n#include \"net\/disk_cache\/mapped_file.h\"\n#include \"net\/disk_cache\/storage_block.h\"\n\nnamespace {\n\nconst wchar_t kIndexName[] = L\"index\";\nconst wchar_t kDataPrefix[] = L\"data_\";\n\n\/\/ Reads the |header_size| bytes from the beginning of file |name|.\nbool ReadHeader(const std::wstring& name, char* header, int header_size) {\n  net::FileStream file;\n  file.Open(FilePath::FromWStringHack(name),\n      base::PLATFORM_FILE_OPEN | base::PLATFORM_FILE_READ);\n  if (!file.IsOpen()) {\n    printf(\"Unable to open file %ls\\n\", name.c_str());\n    return false;\n  }\n\n  int read = file.Read(header, header_size, NULL);\n  if (read != header_size) {\n    printf(\"Unable to read file %ls\\n\", name.c_str());\n    return false;\n  }\n  return true;\n}\n\nint GetMajorVersionFromFile(const std::wstring& name) {\n  disk_cache::IndexHeader header;\n  if (!ReadHeader(name, reinterpret_cast<char*>(&header), sizeof(header)))\n    return 0;\n\n  return header.version >> 16;\n}\n\n\/\/ Dumps the contents of the Index-file header.\nvoid DumpIndexHeader(const std::wstring& name) {\n  disk_cache::IndexHeader header;\n  if (!ReadHeader(name, reinterpret_cast<char*>(&header), sizeof(header)))\n    return;\n\n  printf(\"Index file:\\n\");\n  printf(\"magic: %x\\n\", header.magic);\n  printf(\"version: %d.%d\\n\", header.version >> 16, header.version & 0xffff);\n  printf(\"entries: %d\\n\", header.num_entries);\n  printf(\"total bytes: %d\\n\", header.num_bytes);\n  printf(\"last file number: %d\\n\", header.last_file);\n  printf(\"current id: %d\\n\", header.this_id);\n  printf(\"table length: %d\\n\", header.table_len);\n  printf(\"last crash: %d\\n\", header.crash);\n  printf(\"experiment: %d\\n\", header.experiment);\n  for (int i = 0; i < 5; i++) {\n    printf(\"head %d: 0x%x\\n\", i, header.lru.heads[i]);\n    printf(\"tail %d: 0x%x\\n\", i, header.lru.tails[i]);\n  }\n  printf(\"transaction: 0x%x\\n\", header.lru.transaction);\n  printf(\"operation: %d\\n\", header.lru.operation);\n  printf(\"operation list: %d\\n\", header.lru.operation_list);\n  printf(\"-------------------------\\n\\n\");\n}\n\n\/\/ Dumps the contents of a block-file header.\nvoid DumpBlockHeader(const std::wstring& name) {\n  disk_cache::BlockFileHeader header;\n  if (!ReadHeader(name, reinterpret_cast<char*>(&header), sizeof(header)))\n    return;\n\n  std::wstring file_name = file_util::GetFilenameFromPath(name);\n\n  printf(\"Block file: %ls\\n\", file_name.c_str());\n  printf(\"magic: %x\\n\", header.magic);\n  printf(\"version: %d.%d\\n\", header.version >> 16, header.version & 0xffff);\n  printf(\"file id: %d\\n\", header.this_file);\n  printf(\"next file id: %d\\n\", header.next_file);\n  printf(\"entry size: %d\\n\", header.entry_size);\n  printf(\"current entries: %d\\n\", header.num_entries);\n  printf(\"max entries: %d\\n\", header.max_entries);\n  printf(\"updating: %d\\n\", header.updating);\n  printf(\"empty sz 1: %d\\n\", header.empty[0]);\n  printf(\"empty sz 2: %d\\n\", header.empty[1]);\n  printf(\"empty sz 3: %d\\n\", header.empty[2]);\n  printf(\"empty sz 4: %d\\n\", header.empty[3]);\n  printf(\"user 0: 0x%x\\n\", header.user[0]);\n  printf(\"user 1: 0x%x\\n\", header.user[1]);\n  printf(\"user 2: 0x%x\\n\", header.user[2]);\n  printf(\"user 3: 0x%x\\n\", header.user[3]);\n  printf(\"-------------------------\\n\\n\");\n}\n\n\/\/ Simple class that interacts with the set of cache files.\nclass CacheDumper {\n public:\n  explicit CacheDumper(const std::wstring& path)\n      : path_(path),\n        block_files_(FilePath::FromWStringHack(path)),\n        index_(NULL),\n        current_hash_(0),\n        next_addr_(0) {\n  }\n\n  bool Init();\n\n  \/\/ Reads an entry from disk. Return false when all entries have been already\n  \/\/ returned.\n  bool GetEntry(disk_cache::EntryStore* entry);\n\n  \/\/ Loads a specific block from the block files.\n  bool LoadEntry(disk_cache::CacheAddr addr, disk_cache::EntryStore* entry);\n  bool LoadRankings(disk_cache::CacheAddr addr,\n                    disk_cache::RankingsNode* rankings);\n\n private:\n  std::wstring path_;\n  disk_cache::BlockFiles block_files_;\n  scoped_refptr<disk_cache::MappedFile> index_file_;\n  disk_cache::Index* index_;\n  int current_hash_;\n  disk_cache::CacheAddr next_addr_;\n  DISALLOW_COPY_AND_ASSIGN(CacheDumper);\n};\n\nbool CacheDumper::Init() {\n  if (!block_files_.Init(false)) {\n    printf(\"Unable to init block files\\n\");\n    return false;\n  }\n\n  std::wstring index_name(path_);\n  file_util::AppendToPath(&index_name, kIndexName);\n  index_file_ = new disk_cache::MappedFile;\n  index_ = reinterpret_cast<disk_cache::Index*>(index_file_->Init(\n      FilePath::FromWStringHack(index_name), 0));\n  if (!index_) {\n    printf(\"Unable to map index\\n\");\n    return false;\n  }\n\n  return true;\n}\n\nbool CacheDumper::GetEntry(disk_cache::EntryStore* entry) {\n  if (next_addr_) {\n    if (LoadEntry(next_addr_, entry)) {\n      next_addr_ = entry->next;\n      if (!next_addr_)\n        current_hash_++;\n      return true;\n    } else {\n      printf(\"Unable to load entry at address 0x%x\\n\", next_addr_);\n      next_addr_ = 0;\n      current_hash_++;\n    }\n  }\n\n  for (int i = current_hash_; i < index_->header.table_len; i++) {\n    \/\/ Yes, we'll crash if the table is shorter than expected, but only after\n    \/\/ dumping every entry that we can find.\n    if (index_->table[i]) {\n      current_hash_ = i;\n      if (LoadEntry(index_->table[i], entry)) {\n        next_addr_ = entry->next;\n        if (!next_addr_)\n          current_hash_++;\n        return true;\n      } else {\n        printf(\"Unable to load entry at address 0x%x\\n\", index_->table[i]);\n      }\n    }\n  }\n  return false;\n}\n\nbool CacheDumper::LoadEntry(disk_cache::CacheAddr addr,\n                            disk_cache::EntryStore* entry) {\n  disk_cache::Addr address(addr);\n  disk_cache::MappedFile* file = block_files_.GetFile(address);\n  if (!file)\n    return false;\n\n  disk_cache::CacheEntryBlock entry_block(file, address);\n  if (!entry_block.Load())\n    return false;\n\n  memcpy(entry, entry_block.Data(), sizeof(*entry));\n  printf(\"Entry at 0x%x\\n\", addr);\n  return true;\n}\n\nbool CacheDumper::LoadRankings(disk_cache::CacheAddr addr,\n                               disk_cache::RankingsNode* rankings) {\n  disk_cache::Addr address(addr);\n  disk_cache::MappedFile* file = block_files_.GetFile(address);\n  if (!file)\n    return false;\n\n  disk_cache::CacheRankingsBlock rank_block(file, address);\n  if (!rank_block.Load())\n    return false;\n\n  memcpy(rankings, rank_block.Data(), sizeof(*rankings));\n  printf(\"Rankings at 0x%x\\n\", addr);\n  return true;\n}\n\nvoid DumpEntry(const disk_cache::EntryStore& entry) {\n  std::string key;\n  if (!entry.long_key) {\n    key = entry.key;\n    if (key.size() > 50)\n      key.resize(50);\n  }\n\n  printf(\"hash: 0x%x\\n\", entry.hash);\n  printf(\"next entry: 0x%x\\n\", entry.next);\n  printf(\"rankings: 0x%x\\n\", entry.rankings_node);\n  printf(\"key length: %d\\n\", entry.key_len);\n  printf(\"key: \\\"%s\\\"\\n\", key.c_str());\n  printf(\"key addr: 0x%x\\n\", entry.long_key);\n  printf(\"reuse count: %d\\n\", entry.reuse_count);\n  printf(\"refetch count: %d\\n\", entry.refetch_count);\n  printf(\"state: %d\\n\", entry.state);\n  for (int i = 0; i < 4; i++) {\n    printf(\"data size %d: %d\\n\", i, entry.data_size[i]);\n    printf(\"data addr %d: 0x%x\\n\", i, entry.data_addr[i]);\n  }\n  printf(\"----------\\n\\n\");\n}\n\nvoid DumpRankings(const disk_cache::RankingsNode& rankings) {\n  printf(\"next: 0x%x\\n\", rankings.next);\n  printf(\"prev: 0x%x\\n\", rankings.prev);\n  printf(\"entry: 0x%x\\n\", rankings.contents);\n  printf(\"dirty: %d\\n\", rankings.dirty);\n  printf(\"pointer: 0x%x\\n\", rankings.dummy);\n  printf(\"----------\\n\\n\");\n}\n\n}  \/\/ namespace.\n\n\/\/ -----------------------------------------------------------------------\n\nint GetMajorVersion(const std::wstring& input_path) {\n  std::wstring index_name(input_path);\n  file_util::AppendToPath(&index_name, kIndexName);\n\n  int version = GetMajorVersionFromFile(index_name);\n  if (!version)\n    return 0;\n\n  std::wstring data_name(input_path);\n  file_util::AppendToPath(&data_name, L\"data_0\");\n  if (version != GetMajorVersionFromFile(data_name))\n    return 0;\n\n  data_name = input_path;\n  file_util::AppendToPath(&data_name, L\"data_1\");\n  if (version != GetMajorVersionFromFile(data_name))\n    return 0;\n\n  return version;\n}\n\n\/\/ Dumps the headers of all files.\nint DumpHeaders(const std::wstring& input_path) {\n  std::wstring index_name(input_path);\n  file_util::AppendToPath(&index_name, kIndexName);\n  DumpIndexHeader(index_name);\n\n  std::wstring pattern(kDataPrefix);\n  pattern.append(L\"*\");\n  file_util::FileEnumerator iter(FilePath::FromWStringHack(input_path), false,\n                                 file_util::FileEnumerator::FILES, pattern);\n  for (std::wstring file = iter.Next().ToWStringHack(); !file.empty();\n       file = iter.Next().ToWStringHack()) {\n    DumpBlockHeader(file);\n  }\n\n  return 0;\n}\n\n\/\/ Dumps all entries from the cache.\nint DumpContents(const std::wstring& input_path) {\n  DumpHeaders(input_path);\n\n  \/\/ We need a message loop, although we really don't run any task.\n  MessageLoop loop(MessageLoop::TYPE_IO);\n  CacheDumper dumper(input_path);\n  if (!dumper.Init())\n    return -1;\n\n  disk_cache::EntryStore entry;\n  while (dumper.GetEntry(&entry)) {\n    DumpEntry(entry);\n    disk_cache::RankingsNode rankings;\n    if (dumper.LoadRankings(entry.rankings_node, &rankings))\n      DumpRankings(rankings);\n  }\n\n  printf(\"Done.\\n\");\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>INTEGRATION: CWS eforms2 (1.1.2); FILE ADDED 2004\/10\/26 15:43:43 fs 1.1.2.12: spin buttons can also be bound to numeric fields 2004\/08\/04 13:45:56 fs 1.1.2.11: new logical name for a newly created binding \/ also allow de-selecting a binding-list-source 2004\/08\/04 13:00:11 fs 1.1.2.10: #i31958# use the XFormsUIHelper1 when generating UI names for submissions and bindings 2004\/08\/04 11:55:29 fs 1.1.2.9: #i31958# preliminary support for filling list and combo boxes from XML bindings 2004\/08\/04 08:27:03 fs 1.1.2.8: no faking of XForms documents anymore 2004\/08\/02 08:19:26 fs 1.1.2.7: service name of the XForms model changed 2004\/07\/26 10:24:00 fs 1.1.2.6: #i31958# bind controls only to certain supported XSD data types 2004\/07\/22 10:47:38 fs 1.1.2.5: no XFORMS_FAKE anymore - use an env variable for this 2004\/07\/22 10:37:28 fs 1.1.2.4: #i31762# pass the context document of the introspectee to some handlers 2004\/06\/04 14:18:40 dvo 1.1.2.3: #114856# compiler under gcc 2004\/06\/04 13:59:55 dvo 1.1.2.2: #114856# adapt propertycontroller to new API 2004\/04\/26 11:49:10 fs 1.1.2.1: helper for working with controls living in eForms<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>Mask all FPU error interrupts. According to the manual masked errors will end up creating a \"sane\" response to the error instead of throwing a fault.<commit_after><|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 \"ConnectionAudit.h\"\n\n#include <decaf\/util\/LinkedHashMap.h>\n#include <decaf\/util\/StlMap.h>\n\n#include <activemq\/core\/Dispatcher.h>\n#include <activemq\/core\/ActiveMQMessageAudit.h>\n#include <activemq\/commands\/ActiveMQDestination.h>\n\nusing namespace activemq;\nusing namespace activemq::core;\nusing namespace activemq::util;\nusing namespace activemq::commands;\nusing namespace activemq::exceptions;\n\nusing namespace decaf;\nusing namespace decaf::lang;\nusing namespace decaf::lang::exceptions;\nusing namespace decaf::util;\nusing namespace decaf::util::concurrent;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nnamespace activemq {\nnamespace core {\n\n    class ConnectionAuditImpl {\n    private:\n\n        ConnectionAuditImpl(const ConnectionAuditImpl&);\n        ConnectionAuditImpl& operator= (const ConnectionAuditImpl&);\n\n    public:\n\n        Mutex mutex;\n\n        StlMap<Pointer<ActiveMQDestination>, Pointer<ActiveMQMessageAudit>, ActiveMQDestination::COMPARATOR> destinations;\n        LinkedHashMap<Dispatcher*, Pointer<ActiveMQMessageAudit> > dispatchers;\n\n        ConnectionAuditImpl() : mutex(), destinations(), dispatchers(1000) {\n        }\n    };\n}}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nConnectionAudit::ConnectionAudit() : impl(new ConnectionAuditImpl),\n                                     checkForDuplicates(true),\n                                     auditDepth(ActiveMQMessageAudit::DEFAULT_WINDOW_SIZE),\n                                     auditMaximumProducerNumber(ActiveMQMessageAudit::MAXIMUM_PRODUCER_COUNT) {\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nConnectionAudit::ConnectionAudit(int auditDepth, int maxProducers) :\n    impl(new ConnectionAuditImpl),\n    checkForDuplicates(true),\n    auditDepth(auditDepth),\n    auditMaximumProducerNumber(maxProducers) {\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nConnectionAudit::~ConnectionAudit() {\n    try {\n        delete this->impl;\n    }\n    AMQ_CATCHALL_NOTHROW()\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid ConnectionAudit::removeDispatcher(Dispatcher* dispatcher) {\n    synchronized(&this->impl->mutex) {\n        this->impl->dispatchers.remove(dispatcher);\n    }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool ConnectionAudit::isDuplicate(Dispatcher* dispatcher, Pointer<commands::Message> message) {\n\n    if (checkForDuplicates && message != NULL) {\n        Pointer<ActiveMQDestination> destination = message->getDestination();\n        if (destination != NULL) {\n            if (destination->isQueue()) {\n                Pointer<ActiveMQMessageAudit> audit;\n                try {\n                    audit = this->impl->destinations.get(destination);\n                } catch (NoSuchElementException& ex) {\n                    audit.reset(new ActiveMQMessageAudit(auditDepth, auditMaximumProducerNumber));\n                    this->impl->destinations.put(destination, audit);\n                }\n                bool result = audit->isDuplicate(message->getMessageId());\n                return result;\n            }\n            Pointer<ActiveMQMessageAudit> audit;\n            try {\n                audit = this->impl->dispatchers.get(dispatcher);\n            } catch (NoSuchElementException& ex) {\n                audit.reset(new ActiveMQMessageAudit(auditDepth, auditMaximumProducerNumber));\n                this->impl->dispatchers.put(dispatcher, audit);\n            }\n            bool result = audit->isDuplicate(message->getMessageId());\n            return result;\n        }\n    }\n    return false;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid ConnectionAudit::rollbackDuplicate(Dispatcher* dispatcher, Pointer<commands::Message> message) {\n    if (checkForDuplicates && message != NULL) {\n        Pointer<ActiveMQDestination> destination = message->getDestination();\n        if (destination != NULL) {\n            if (destination->isQueue()) {\n                try {\n                    Pointer<ActiveMQMessageAudit> audit = this->impl->destinations.get(destination);\n                    audit->rollback(message->getMessageId());\n                } catch (NoSuchElementException& ex) {}\n            } else {\n                try {\n                    Pointer<ActiveMQMessageAudit> audit = this->impl->dispatchers.get(dispatcher);\n                    audit->rollback(message->getMessageId());\n                } catch (NoSuchElementException& ex) {}\n            }\n        }\n    }\n}\n<commit_msg>https:\/\/issues.apache.org\/jira\/browse\/AMQCPP-546<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 \"ConnectionAudit.h\"\n\n#include <decaf\/util\/LinkedHashMap.h>\n#include <decaf\/util\/StlMap.h>\n\n#include <activemq\/core\/Dispatcher.h>\n#include <activemq\/core\/ActiveMQMessageAudit.h>\n#include <activemq\/commands\/ActiveMQDestination.h>\n\nusing namespace activemq;\nusing namespace activemq::core;\nusing namespace activemq::util;\nusing namespace activemq::commands;\nusing namespace activemq::exceptions;\n\nusing namespace decaf;\nusing namespace decaf::lang;\nusing namespace decaf::lang::exceptions;\nusing namespace decaf::util;\nusing namespace decaf::util::concurrent;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nnamespace activemq {\nnamespace core {\n\n    class ConnectionAuditImpl {\n    private:\n\n        ConnectionAuditImpl(const ConnectionAuditImpl&);\n        ConnectionAuditImpl& operator= (const ConnectionAuditImpl&);\n\n    public:\n\n        Mutex mutex;\n\n        StlMap<Pointer<ActiveMQDestination>, Pointer<ActiveMQMessageAudit>, ActiveMQDestination::COMPARATOR> destinations;\n        LinkedHashMap<Dispatcher*, Pointer<ActiveMQMessageAudit> > dispatchers;\n\n        ConnectionAuditImpl() : mutex(), destinations(), dispatchers(1000) {\n        }\n    };\n}}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nConnectionAudit::ConnectionAudit() : impl(new ConnectionAuditImpl),\n                                     checkForDuplicates(true),\n                                     auditDepth(ActiveMQMessageAudit::DEFAULT_WINDOW_SIZE),\n                                     auditMaximumProducerNumber(ActiveMQMessageAudit::MAXIMUM_PRODUCER_COUNT) {\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nConnectionAudit::ConnectionAudit(int auditDepth, int maxProducers) :\n    impl(new ConnectionAuditImpl),\n    checkForDuplicates(true),\n    auditDepth(auditDepth),\n    auditMaximumProducerNumber(maxProducers) {\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nConnectionAudit::~ConnectionAudit() {\n    try {\n        delete this->impl;\n    }\n    AMQ_CATCHALL_NOTHROW()\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid ConnectionAudit::removeDispatcher(Dispatcher* dispatcher) {\n    synchronized(&this->impl->mutex) {\n        this->impl->dispatchers.remove(dispatcher);\n    }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool ConnectionAudit::isDuplicate(Dispatcher* dispatcher, Pointer<commands::Message> message) {\n    synchronized(&this->impl->mutex) {\n        if (checkForDuplicates && message != NULL) {\n            Pointer<ActiveMQDestination> destination = message->getDestination();\n            if (destination != NULL) {\n                if (destination->isQueue()) {\n                    Pointer<ActiveMQMessageAudit> audit;\n                    try {\n                        audit = this->impl->destinations.get(destination);\n                    } catch (NoSuchElementException& ex) {\n                        audit.reset(new ActiveMQMessageAudit(auditDepth, auditMaximumProducerNumber));\n                        this->impl->destinations.put(destination, audit);\n                    }\n                    bool result = audit->isDuplicate(message->getMessageId());\n                    return result;\n                }\n                Pointer<ActiveMQMessageAudit> audit;\n                try {\n                    audit = this->impl->dispatchers.get(dispatcher);\n                } catch (NoSuchElementException& ex) {\n                    audit.reset(new ActiveMQMessageAudit(auditDepth, auditMaximumProducerNumber));\n                    this->impl->dispatchers.put(dispatcher, audit);\n                }\n                bool result = audit->isDuplicate(message->getMessageId());\n                return result;\n            }\n        }\n    }\n    return false;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid ConnectionAudit::rollbackDuplicate(Dispatcher* dispatcher, Pointer<commands::Message> message) {\n    synchronized(&this->impl->mutex) {\n        if (checkForDuplicates && message != NULL) {\n            Pointer<ActiveMQDestination> destination = message->getDestination();\n            if (destination != NULL) {\n                if (destination->isQueue()) {\n                    try {\n                        Pointer<ActiveMQMessageAudit> audit = this->impl->destinations.get(destination);\n                        audit->rollback(message->getMessageId());\n                    } catch (NoSuchElementException& ex) {}\n                } else {\n                    try {\n                        Pointer<ActiveMQMessageAudit> audit = this->impl->dispatchers.get(dispatcher);\n                        audit->rollback(message->getMessageId());\n                    } catch (NoSuchElementException& ex) {}\n                }\n            }\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>cid#705910 dereference before null check<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Library   : packages\/segmentation\n  Module    : $RCSfile: gmm.cc,v $\n  Authors   : Maria Murgasova and Daniel Rueckert\n  Copyright : Imperial College, Department of Computing\n              Visual Information Processing (VIP), 2006\n  Purpose   :\n  Date      : $Date: 2007\/05\/24 15:22:19 $\n\n=========================================================================*\/\n\n#include <irtkImage.h>\n\nchar *output_name;\nirtkRealImage image;\n\n\nvoid usage()\n{\n  cerr << \"Usage: enlarge_image [image] [output] <-x voxels> <-y voxels> <-z voxels> <-percent> <-value value>\"<<endl;\n  exit(1);\n}\n\nint main(int argc, char **argv)\n{\n\n  if (argc < 3) {\n    usage();\n    exit(1);\n  }\n\n  int ex=0,ey=0,ez=0,percent=0,value=0;\n  int ok;\n\n  image.Read(argv[1]);\n  argc--;\n  argv++;\n\n  output_name=argv[1];\n  argc--;\n  argv++;\n\n  \/\/ Parse remaining parameters\n  while (argc > 1){\n    ok = false;\n    if ((ok == false) && (strcmp(argv[1], \"-x\") == 0)){\n      argc--;\n      argv++;\n      ex = atoi(argv[1]);\n      argc--;\n      argv++;\n      ok = true;\n    }\n    if ((ok == false) && (strcmp(argv[1], \"-y\") == 0)){\n      argc--;\n      argv++;\n      ey = atoi(argv[1]);\n      argc--;\n      argv++;\n      ok = true;\n    }\n    if ((ok == false) && (strcmp(argv[1], \"-z\") == 0)){\n      argc--;\n      argv++;\n      ez = atoi(argv[1]);\n      argc--;\n      argv++;\n      ok = true;\n    }\n\tif ((ok == false) && (strcmp(argv[1], \"-percent\") == 0)){\n      argc--;\n      argv++;\n      percent = 1;\n      ok = true;\n    }\n\tif ((ok == false) && (strcmp(argv[1], \"-value\") == 0)){\n      argc--;\n      argv++;\n      value = atoi(argv[1]);\n      argc--;\n      argv++;\n      ok = true;\n    }\n     if (ok == false){\n      cerr << \"Can not parse argument \" << argv[1] << endl;\n      usage();\n    }\n  } \n\n\n  irtkRealImage new_image; \n  irtkImageAttributes attr = image.GetImageAttributes();\n  if(percent == 1){\n\t  ex = round(double(image.GetX()*ex)\/100.0);\n\t  ey = round(double(image.GetY()*ey)\/100.0);\n\t  ez = round(double(image.GetZ()*ez)\/100.0);\n  }\n  attr._x += 2*ex;\n  attr._y += 2*ey;\n  attr._z += 2*ez;\n  new_image.Initialize(attr);\n  int i,j,k,l;\n  for(l=0;l<new_image.GetT();l++)\n\t  for(i=0; i<new_image.GetX();i++)\n\t\t  for(j=0; j<new_image.GetY();j++)\n\t\t\t  for(k=0; k<new_image.GetZ();k++){\n\t\t\t    new_image.Put(i,j,k,l,value);\n\t\t\t  }\n\n  for(l=0;l<image.GetT();l++)\n\t  for(i=0; i<image.GetX();i++)\n\t\t  for(j=0; j<image.GetY();j++)\n\t\t\t  for(k=0; k<image.GetZ();k++)\n\t\t\t  {\n\t\t\t\tnew_image.Put(i+ex,j+ey,k+ez,l,image.Get(i,j,k,l));\n\t\t\t  }\n  new_image.Write(output_name);\n \n}\n\n\n\n<commit_msg>set properties so header can be automatically generated.<commit_after>\/*=========================================================================\n\n  Library   : packages\/segmentation\n  Module    : $RCSfile: gmm.cc,v $\n  Authors   : Maria Murgasova and Daniel Rueckert\n  Copyright : Imperial College, Department of Computing\n              Visual Information Processing (VIP), 2006\n  Purpose   :\n  Date      : $Date$\n\n=========================================================================*\/\n\n#include <irtkImage.h>\n\nchar *output_name;\nirtkRealImage image;\n\n\nvoid usage()\n{\n  cerr << \"Usage: enlarge_image [image] [output] <-x voxels> <-y voxels> <-z voxels> <-percent> <-value value>\"<<endl;\n  exit(1);\n}\n\nint main(int argc, char **argv)\n{\n\n  if (argc < 3) {\n    usage();\n    exit(1);\n  }\n\n  int ex=0,ey=0,ez=0,percent=0,value=0;\n  int ok;\n\n  image.Read(argv[1]);\n  argc--;\n  argv++;\n\n  output_name=argv[1];\n  argc--;\n  argv++;\n\n  \/\/ Parse remaining parameters\n  while (argc > 1){\n    ok = false;\n    if ((ok == false) && (strcmp(argv[1], \"-x\") == 0)){\n      argc--;\n      argv++;\n      ex = atoi(argv[1]);\n      argc--;\n      argv++;\n      ok = true;\n    }\n    if ((ok == false) && (strcmp(argv[1], \"-y\") == 0)){\n      argc--;\n      argv++;\n      ey = atoi(argv[1]);\n      argc--;\n      argv++;\n      ok = true;\n    }\n    if ((ok == false) && (strcmp(argv[1], \"-z\") == 0)){\n      argc--;\n      argv++;\n      ez = atoi(argv[1]);\n      argc--;\n      argv++;\n      ok = true;\n    }\n\tif ((ok == false) && (strcmp(argv[1], \"-percent\") == 0)){\n      argc--;\n      argv++;\n      percent = 1;\n      ok = true;\n    }\n\tif ((ok == false) && (strcmp(argv[1], \"-value\") == 0)){\n      argc--;\n      argv++;\n      value = atoi(argv[1]);\n      argc--;\n      argv++;\n      ok = true;\n    }\n     if (ok == false){\n      cerr << \"Can not parse argument \" << argv[1] << endl;\n      usage();\n    }\n  } \n\n\n  irtkRealImage new_image; \n  irtkImageAttributes attr = image.GetImageAttributes();\n  if(percent == 1){\n\t  ex = round(double(image.GetX()*ex)\/100.0);\n\t  ey = round(double(image.GetY()*ey)\/100.0);\n\t  ez = round(double(image.GetZ()*ez)\/100.0);\n  }\n  attr._x += 2*ex;\n  attr._y += 2*ey;\n  attr._z += 2*ez;\n  new_image.Initialize(attr);\n  int i,j,k,l;\n  for(l=0;l<new_image.GetT();l++)\n\t  for(i=0; i<new_image.GetX();i++)\n\t\t  for(j=0; j<new_image.GetY();j++)\n\t\t\t  for(k=0; k<new_image.GetZ();k++){\n\t\t\t    new_image.Put(i,j,k,l,value);\n\t\t\t  }\n\n  for(l=0;l<image.GetT();l++)\n\t  for(i=0; i<image.GetX();i++)\n\t\t  for(j=0; j<image.GetY();j++)\n\t\t\t  for(k=0; k<image.GetZ();k++)\n\t\t\t  {\n\t\t\t\tnew_image.Put(i+ex,j+ey,k+ez,l,image.Get(i,j,k,l));\n\t\t\t  }\n  new_image.Write(output_name);\n \n}\n\n\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>[C++] Add reproducer test for ds entry reregistration<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>INTEGRATION: CWS oj07 (1.6.38); FILE MERGED 2003\/08\/21 13:48:04 oj 1.6.38.1: #111118# derive the tableconnection from window to fit into accessiblity tree<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>gripper vel control working, have to fix updates<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"File.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ System-specific file locking\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#ifdef _WIN32\n#include <Windows.h>\n#include <io.h>\n#include <FileAPI.h>\nbool joedb::File::lock_file()\n{\n HANDLE hFile = (HANDLE)_get_osfhandle(_fileno(file));\n return LockFile(hFile, 0, 0, 1, 0) == TRUE;\n}\n#else\n#include <sys\/file.h>\nbool joedb::File::lock_file()\n{\n return flock(fileno(file), LOCK_EX | LOCK_NB) == 0;\n}\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ System-specific sync\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#ifdef WIN32\n#include <io.h>\n#else\n#include <unistd.h>\n#endif\n\nvoid joedb::File::sync()\n{\n#ifdef WIN32\n _commit(_fileno(file));\n#else\n fsync(fileno(file));\n#endif\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid joedb::File::open(const char *file_name, mode_t new_mode)\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n{\n reset();\n\n mode = new_mode;\n static const char *mode_string[3] = {\"rb\", \"r+b\", \"w+b\"};\n file = std::fopen(file_name, mode_string[static_cast<size_t>(mode)]);\n\n if (file)\n {\n  if (lock_file())\n  {\n   std::setvbuf(file, 0, _IONBF, 0);\n   status = status_t::success;\n  }\n  else\n  {\n   std::fclose(file);\n   file = 0;\n   status = status_t::locked;\n  }\n }\n else\n  status = status_t::failure;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nsize_t joedb::File::read_buffer()\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n{\n return std::fread(buffer, 1, buffer_size, file);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid joedb::File::write_buffer()\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n{\n std::fwrite(buffer, 1, write_buffer_index, file);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint joedb::File::seek(size_t offset)\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n{\n return std::fseek(file, long(offset), SEEK_SET);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\njoedb::File::~File()\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n{\n flush();\n if (file)\n  fclose(file);\n}\n<commit_msg>re-arrange system-specific code<commit_after>#include \"File.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ System-specific functions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#ifdef _WIN32\n#include <Windows.h>\n#include <io.h>\n#include <FileAPI.h>\n\nbool joedb::File::lock_file()\n{\n HANDLE hFile = (HANDLE)_get_osfhandle(_fileno(file));\n return LockFile(hFile, 0, 0, 1, 0) == TRUE;\n}\n\nvoid joedb::File::sync()\n{\n _commit(_fileno(file));\n}\n\n#else\n#include <sys\/file.h>\n#include <unistd.h>\n\nbool joedb::File::lock_file()\n{\n return flock(fileno(file), LOCK_EX | LOCK_NB) == 0;\n}\n\nvoid joedb::File::sync()\n{\n fsync(fileno(file));\n}\n\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid joedb::File::open(const char *file_name, mode_t new_mode)\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n{\n reset();\n\n mode = new_mode;\n static const char *mode_string[3] = {\"rb\", \"r+b\", \"w+b\"};\n file = std::fopen(file_name, mode_string[static_cast<size_t>(mode)]);\n\n if (file)\n {\n  if (lock_file())\n  {\n   std::setvbuf(file, 0, _IONBF, 0);\n   status = status_t::success;\n  }\n  else\n  {\n   std::fclose(file);\n   file = 0;\n   status = status_t::locked;\n  }\n }\n else\n  status = status_t::failure;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nsize_t joedb::File::read_buffer()\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n{\n return std::fread(buffer, 1, buffer_size, file);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid joedb::File::write_buffer()\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n{\n std::fwrite(buffer, 1, write_buffer_index, file);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint joedb::File::seek(size_t offset)\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n{\n return std::fseek(file, long(offset), SEEK_SET);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\njoedb::File::~File()\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n{\n flush();\n if (file)\n  fclose(file);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <boost\/lexical_cast.hpp>\n\n#include \"osquery\/core.h\"\n#include \"osquery\/database.h\"\n#include \"osquery\/filesystem.h\"\n\n#include <stdio.h>\n#include <mntent.h>\n#include <sys\/vfs.h>\n\nnamespace osquery {\nnamespace tables {\nQueryData genMounts() {\n  QueryData results;\n  FILE *mounts;\n  struct mntent *ent;\n  char real_path[PATH_MAX];\n  struct statfs st;\n\n  if (mounts = setmntent(\"\/proc\/mounts\", \"r\")) {\n    while (ent = getmntent(mounts)) {\n      Row r;\n\n      r[\"fsname\"] = std::string(ent->mnt_fsname);\n      r[\"fsname_real\"] = std::string(\n          realpath(ent->mnt_fsname, real_path) ? real_path : ent->mnt_fsname);\n      r[\"path\"] = std::string(ent->mnt_dir);\n      r[\"type\"] = std::string(ent->mnt_type);\n      r[\"opts\"] = std::string(ent->mnt_opts);\n      r[\"freq\"] = boost::lexical_cast<std::string>(ent->mnt_freq);\n      r[\"passno\"] = boost::lexical_cast<std::string>(ent->mnt_passno);\n      if (!statfs(ent->mnt_dir, &st)) {\n        r[\"block_size\"] = boost::lexical_cast<std::string>(st.f_bsize);\n        r[\"blocks\"] = boost::lexical_cast<std::string>(st.f_blocks);\n        r[\"blocks_free\"] = boost::lexical_cast<std::string>(st.f_bfree);\n        r[\"blocks_avail\"] = boost::lexical_cast<std::string>(st.f_bavail);\n        r[\"inodes\"] = boost::lexical_cast<std::string>(st.f_files);\n        r[\"inodes_free\"] = boost::lexical_cast<std::string>(st.f_ffree);\n      }\n\n      results.push_back(r);\n    }\n    endmntent(mounts);\n  }\n\n  return results;\n}\n}\n}\n<commit_msg>Silence parentheses warnings in linux\/mounts<commit_after>\n#include <stdio.h>\n#include <mntent.h>\n#include <sys\/vfs.h>\n\n#include <boost\/lexical_cast.hpp>\n\n#include \"osquery\/core.h\"\n#include \"osquery\/database.h\"\n#include \"osquery\/filesystem.h\"\n\nnamespace osquery {\nnamespace tables {\n\nQueryData genMounts() {\n  QueryData results;\n  FILE *mounts;\n  struct mntent *ent;\n  char real_path[PATH_MAX];\n  struct statfs st;\n\n  if ((mounts = setmntent(\"\/proc\/mounts\", \"r\"))) {\n    while ((ent = getmntent(mounts))) {\n      Row r;\n\n      r[\"fsname\"] = std::string(ent->mnt_fsname);\n      r[\"fsname_real\"] = std::string(\n          realpath(ent->mnt_fsname, real_path) ? real_path : ent->mnt_fsname);\n      r[\"path\"] = std::string(ent->mnt_dir);\n      r[\"type\"] = std::string(ent->mnt_type);\n      r[\"opts\"] = std::string(ent->mnt_opts);\n      r[\"freq\"] = boost::lexical_cast<std::string>(ent->mnt_freq);\n      r[\"passno\"] = boost::lexical_cast<std::string>(ent->mnt_passno);\n      if (!statfs(ent->mnt_dir, &st)) {\n        r[\"block_size\"] = boost::lexical_cast<std::string>(st.f_bsize);\n        r[\"blocks\"] = boost::lexical_cast<std::string>(st.f_blocks);\n        r[\"blocks_free\"] = boost::lexical_cast<std::string>(st.f_bfree);\n        r[\"blocks_avail\"] = boost::lexical_cast<std::string>(st.f_bavail);\n        r[\"inodes\"] = boost::lexical_cast<std::string>(st.f_files);\n        r[\"inodes_free\"] = boost::lexical_cast<std::string>(st.f_ffree);\n      }\n\n      results.push_back(r);\n    }\n    endmntent(mounts);\n  }\n\n  return results;\n}\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * KruskalMSF.cpp\n *\n *  Created on: 03.09.2015\n *      Author: Henning\n *\/\n\n#include \"KruskalMSF.h\"\n#include \"SpanningForest.h\"\n#include \"..\/structures\/UnionFind.h\"\n#include \"..\/auxiliary\/Parallel.h\"\n\nnamespace NetworKit {\n\nstruct MyEdge {\n\tnode from;\n\tnode to;\n\tedgeweight weight;\n\n\tMyEdge(node u, node v, edgeweight ew) {\n\t\tfrom = u;\n\t\tto = v;\n\t\tweight = ew;\n\t}\n\n\tMyEdge() {\n\t\tfrom = none;\n\t\tto = none;\n\t\tweight = 0;\n\t}\n\n\tbool operator<(const MyEdge& other) const {\n\t\treturn this->weight > other.weight; \/\/ Note the switch in the operator!\n\t}\n};\n\n\nNetworKit::KruskalMSF::KruskalMSF(const Graph& G): SpanningForest(G) {\n\n}\n\nvoid NetworKit::KruskalMSF::run() {\n\tif (true || G.isWeighted()) { \/\/ FIXME: remove true when SpanningForest is fixed!\n\t\tcount z = G.upperNodeIdBound();\n\t\tforest = G.copyNodes();\n\t\tUnionFind uf(z);\n\n\t\t\/\/ sort edges in decreasing weight order\n\t\tstd::vector<MyEdge> sortedEdges; \/\/ (m);\n\t\tG.forEdges([&](node u, node v, edgeweight ew, edgeid eid) {\n\/\/\t\t\tINFO(\"insert edge (\", u, \", \", v, \") with weight \", ew);\n\t\t\tMyEdge myEdge(u, v, ew);\n\t\t\tsortedEdges.push_back(myEdge);\n\t\t});\n\t\tAux::Parallel::sort(sortedEdges.begin(), sortedEdges.end());\n\n\t\t\/\/ process in decreasing weight order\n\t\tfor (auto e: sortedEdges) {\n\t\t\tnode u = e.from;\n\t\t\tnode v = e.to;\n\/\/\t\t\tINFO(\"process edge (\", u, \", \", v, \") with weight \", e.weight);\n\n\t\t\t\/\/ if edge does not close cycle, add it to tree\n\t\t\tif (uf.find(u) != uf.find(v)) {\n\t\t\t\tforest.addEdge(u, v);\n\t\t\t\tuf.merge(u, v);\n\t\t\t}\n\t\t}\n\t}\n\telse {\n\t\tSpanningForest sf(G);\n\t\tforest = sf.generate();\n\t}\n}\n\n} \/* namespace NetworKit *\/\n<commit_msg>changed operator< in myEdge struct from call by reference to call by value crashed with memory error before<commit_after>\/*\n * KruskalMSF.cpp\n *\n *  Created on: 03.09.2015\n *      Author: Henning\n *\/\n\n#include \"KruskalMSF.h\"\n#include \"SpanningForest.h\"\n#include \"..\/structures\/UnionFind.h\"\n#include \"..\/auxiliary\/Parallel.h\"\n\nnamespace NetworKit {\n\nstruct MyEdge {\n\tnode from;\n\tnode to;\n\tedgeweight weight;\n\n\tMyEdge(node u, node v, edgeweight ew) {\n\t\tfrom = u;\n\t\tto = v;\n\t\tweight = ew;\n\t}\n\n\tMyEdge() {\n\t\tfrom = none;\n\t\tto = none;\n\t\tweight = 0;\n\t}\n\n\tbool operator<(const MyEdge other) const {\n\t\treturn this->weight > other.weight; \/\/ Note the switch in the operator!\n\t}\n};\n\n\nNetworKit::KruskalMSF::KruskalMSF(const Graph& G): SpanningForest(G) {\n\n}\n\nvoid NetworKit::KruskalMSF::run() {\n\tif (true || G.isWeighted()) { \/\/ FIXME: remove true when SpanningForest is fixed!\n\t\tcount z = G.upperNodeIdBound();\n\t\tforest = G.copyNodes();\n\t\tUnionFind uf(z);\n\n\t\t\/\/ sort edges in decreasing weight order\n\t\tstd::vector<MyEdge> sortedEdges; \/\/ (m);\n\t\tG.forEdges([&](node u, node v, edgeweight ew, edgeid eid) {\n\/\/\t\t\tINFO(\"insert edge (\", u, \", \", v, \") with weight \", ew);\n\t\t\tMyEdge myEdge(u, v, ew);\n\t\t\tsortedEdges.push_back(myEdge);\n\t\t});\n\t\tAux::Parallel::sort(sortedEdges.begin(), sortedEdges.end());\n\n\t\t\/\/ process in decreasing weight order\n\t\tfor (auto e: sortedEdges) {\n\t\t\tnode u = e.from;\n\t\t\tnode v = e.to;\n\t\t\tINFO(\"process edge (\", u, \", \", v, \") with weight \", e.weight);\n\t\t\tassert(u < z);\n\t\t\tassert(v < z);\n\t\t\tassert(u >= 0);\n\t\t\tassert(v >= 0);\n\n\t\t\t\/\/ if edge does not close cycle, add it to tree\n\t\t\tif (uf.find(u) != uf.find(v)) {\n\t\t\t\tforest.addEdge(u, v);\n\t\t\t\tuf.merge(u, v);\n\t\t\t}\n\t\t}\n\t}\n\telse {\n\t\tSpanningForest sf(G);\n\t\tforest = sf.generate();\n\t}\n}\n\n} \/* namespace NetworKit *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/ -*- Mode: C++; tab-width: 2; -*-\n\/\/ vi: set ts=2:\n\/\/\n\/\/ $Id: representation.C,v 1.29 2004\/04\/15 12:10:24 amoll Exp $\n\n#include <BALL\/VIEW\/KERNEL\/representation.h>\n#include <BALL\/VIEW\/MODELS\/modelProcessor.h>\n#include <BALL\/VIEW\/MODELS\/colorProcessor.h>\n#include <BALL\/VIEW\/KERNEL\/geometricObject.h>\n\n#include <BALL\/VIEW\/KERNEL\/threads.h>\n#include <BALL\/VIEW\/KERNEL\/mainControl.h>\n#include <BALL\/VIEW\/KERNEL\/message.h>\n\n#include <qapplication.h>\n\nnamespace BALL\n{\n\tnamespace VIEW\n\t{\n\n#ifdef BALL_QT_HAS_THREADS\n\t\tUpdateRepresentationThread* Representation::thread_ = 0;\n#endif\n\n\t\tRepresentation::Representation()\n\t\t\tthrow()\n\t\t\t\t: PropertyManager(),\n\t\t\t\t\tdrawing_mode_(DRAWING_MODE_SOLID),\n\t\t\t\t\tdrawing_precision_(DRAWING_PRECISION_HIGH),\n\t\t\t\t\tsurface_drawing_precision_(-1),\n\t\t\t\t\tmodel_type_(MODEL_UNKNOWN),\n\t\t\t\t\tcoloring_method_(COLORING_UNKNOWN),\n\t\t\t\t\ttransparency_(0),\n\t\t\t\t\tmodel_processor_(0),\n\t\t\t\t\tcolor_processor_(0),\n\t\t\t\t\tgeometric_objects_(),\n\t\t\t\t\tcomposites_()\n\t\t{\n\t\t}\n\n\t\t\t\t\t\n\t\tRepresentation::Representation(const Representation& rp)\n\t\t\tthrow()\n\t\t\t\t: PropertyManager(rp)\n\t\t{\n\t\t\t*this = rp;\n\t\t}\n\n\n\t\tRepresentation::Representation(ModelType model_type,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t DrawingPrecision drawing_precision,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t DrawingMode drawing_mode)\n\t\t\tthrow()\n\t\t\t\t: PropertyManager(),\n\t\t\t\t\tdrawing_mode_(drawing_mode),\n\t\t\t\t\tdrawing_precision_(drawing_precision),\n\t\t\t\t\tsurface_drawing_precision_(-1),\n\t\t\t\t\tmodel_type_(model_type),\n\t\t\t\t\ttransparency_(0),\n\t\t\t\t\tmodel_processor_(0),\n\t\t\t\t\tcolor_processor_(0),\n\t\t\t\t\tgeometric_objects_(),\n\t\t\t\t\tcomposites_()\n\t\t{\n\t\t}\n\n\n\t\tRepresentation::Representation(const HashSet<const Composite*>& composites, \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t ModelProcessor* model_processor)\n\t\t\tthrow()\n\t\t\t:\tPropertyManager(),\n\t\t\t\tdrawing_mode_(DRAWING_MODE_SOLID),\n\t\t\t\tdrawing_precision_(DRAWING_PRECISION_HIGH),\n\t\t\t\tsurface_drawing_precision_(-1),\n\t\t\t\ttransparency_(0),\n\t\t\t\tmodel_processor_(model_processor),\n\t\t\t\tcolor_processor_(0),\n\t\t\t\tgeometric_objects_(),\n\t\t\t\tcomposites_(composites)\n\t\t{\n\t\t}\n\n\t\t\t\t\n\t\tconst Representation& Representation::operator = (const Representation& representation)\n\t\t\tthrow()\n\t\t{\n\t\t\tclear();\n\n\t\t\tdrawing_mode_= representation.drawing_mode_;\n\t\t\tdrawing_precision_= representation.drawing_precision_;\n\t\t\tmodel_type_ = representation.model_type_;\n\t\t\tcoloring_method_ = representation.coloring_method_;\n\t\t\ttransparency_ = representation.transparency_;\n\t\t\tsurface_drawing_precision_ = representation.surface_drawing_precision_;\n\n\t\t\tPropertyManager::operator = (representation);\n\n\t\t\tif (representation.model_processor_ != 0)\n\t\t\t{\n\t\t\t\tmodel_processor_ = new ModelProcessor(*representation.model_processor_);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tmodel_processor_ = 0;\n\t\t\t}\n\n\t\t\tif (representation.color_processor_ != 0)\n\t\t\t{\n\t\t\t\tcolor_processor_ = new ColorProcessor(*representation.color_processor_);\n\t\t\t\tcolor_processor_->setTransparency(transparency_);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tcolor_processor_ = 0;\n\t\t\t}\n\n\t\t\tGeometricObjectList::ConstIterator it = representation.geometric_objects_.begin();\n\t\t\tfor (;it != representation.geometric_objects_.end(); it++)\n\t\t\t{\n\t\t\t\tGeometricObject* object = new GeometricObject(**it);\n\t\t\t\tgeometric_objects_.push_back(object);\n\t\t\t}\n\n\t\t\tcomposites_ = representation.composites_;\n\n\t\t\treturn *this;\n\t\t}\n\n\n\t\tRepresentation::~Representation()\n\t\t\tthrow()\n\t\t{\n\t\t\tclear();\n\t\t}\n\n\t\t\n\t\tvoid Representation::clear()\n\t\t\tthrow()\n\t\t{\n\t\t\tclearGeometricObjects();\n\t\t\tcomposites_.clear();\n\n\t\t\tif (model_processor_  != 0) delete model_processor_;\n\t\t\tif (color_processor_  != 0) delete color_processor_;\n\t\t\tmodel_processor_ \t= 0;\n\t\t\tcolor_processor_ \t= 0;\n\n\t\t\tdrawing_mode_= DRAWING_MODE_SOLID;\n\t\t\tdrawing_precision_= DRAWING_PRECISION_HIGH;\n\t\t\tmodel_type_ = MODEL_UNKNOWN;\n\t\t\tcoloring_method_ = COLORING_UNKNOWN;\n\t\t\ttransparency_ = 0;\n\t\t\tsurface_drawing_precision_ = -1;\n\t\t}\n\n\t\t\n\t\tvoid Representation::clearGeometricObjects()\n\t\t\tthrow()\n\t\t{\n\t\t\tList<GeometricObject*>::Iterator it = geometric_objects_.begin();\n\t\t\tfor (; it != geometric_objects_.end(); it++)\n\t\t\t{\n\t\t\t\tdelete *it;\n\t\t\t}\n\t\t\tgeometric_objects_.clear();\n\n\t\t\tif (model_processor_ != 0)\n\t\t\t{\n\t\t\t\tmodel_processor_->getGeometricObjects().clear();\n\t\t\t}\n\t\t}\n\t\t\t\t\t\n\n\t\tvoid Representation::dump(std::ostream& s, Size depth) const\n\t\t\tthrow()\n\t\t{\n\t\t\tBALL_DUMP_STREAM_PREFIX(s);\n\n\t\t\tBALL_DUMP_DEPTH(s, depth);\n\t\t\tBALL_DUMP_HEADER(s, this, this);\n\n\t\t\tBALL_DUMP_DEPTH(s, depth);\n\t\t\ts << \"drawing mode: \" << drawing_mode_<< std::endl;\n\t\t\tBALL_DUMP_DEPTH(s, depth);\n\t\t\ts << \"drawing precision: \" << drawing_precision_<< std::endl;\n\t\t\tBALL_DUMP_DEPTH(s, depth);\n\t\t\ts << \"model type : \" << model_type_ << std::endl;\n\t\t\tBALL_DUMP_DEPTH(s, depth);\n\t\t\ts << \"coloring type : \" << coloring_method_ << std::endl;\n\t\t\tBALL_DUMP_DEPTH(s, depth);\n\t\t\ts << \"number of primitives: \" << geometric_objects_.size() << std::endl;\n\t\t\tBALL_DUMP_DEPTH(s, depth);\n\t\t\ts << \"number of composites: \" << composites_.size() << std::endl;\n\t\t\tBALL_DUMP_DEPTH(s, depth);\n\t\t\ts << \"model processor: \" << model_processor_ << std::endl;\n\t\t\tBALL_DUMP_DEPTH(s, depth);\n\t\t\ts << \"PropertyManager: \" << std::endl;\n\n\t\t\tPropertyManager::dump(s, depth + 1);\n\n\t\t\tBALL_DUMP_STREAM_SUFFIX(s);     \n\t\t}\n\n\t\t\n\t\tbool Representation::isValid() const\n\t\t\tthrow()\n\t\t{\n\t\t\tif (drawing_precision_  < 0 || drawing_precision_ > BALL_VIEW_MAXIMAL_DRAWING_PRECISION ||\n\t\t\t\t\tdrawing_mode_ \t\t\t< 0 || drawing_mode_ > BALL_VIEW_MAXIMAL_DRAWING_MODE ||\n\t\t\t\t\ttransparency_ \t\t\t> 255)\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\n#ifdef BALL_VIEW_DEBUG\n\t\t\tGeometricObjectList::ConstIterator it = geometric_objects_.begin();\n\t\t\tfor (; it != geometric_objects_.end(); it++)\n\t\t\t{\n\t\t\t\tif (!(*it)->isValid()) return false;\n\t\t\t}\n#endif\n\n\t\t\tif (model_processor_ != 0 && !model_processor_->isValid()) return false; \n\n\t\t\treturn true;\n\t\t}\n\n\t\t\n\t\tvoid Representation::update(bool rebuild) \n\t\t\tthrow()\n\t\t{\n#ifndef BALL_QT_HAS_THREADS\n\t\t\tupdate_(rebuild);\n#else\n\t\t\tMainControl* mc = MainControl::getInstance(0);\n\t\t\t\n\t\t\t\/\/ ????? dirty trick to avoid getInstance problem under windows\n#ifdef BALL_PLATFORM_WINDOWS\n\t\t\tmc = dynamic_cast<MainControl*>(qApp->mainWidget());\n#endif\n\n\t\t\tif (mc == 0)\n\t\t\t{\n\t\t\t\tupdate_(rebuild);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif (thread_ != 0)\n\t\t\t{\n\t\t\t\tthread_->wait();\n\t\t\t\tdelete thread_;\n\t\t\t\tthread_ = 0;\n\t\t\t}\n\t\t\tthread_ = new UpdateRepresentationThread;\n\t\t\tthread_->setRepresentation(*this);\n\t\t\tthread_->setRebuild(rebuild);\n\t\t\tthread_->start();\n\n\t\t\t\/\/bool mc_was_muteable = mc->compositesAreMuteable();\n\t\t\tmc->setCompositesMuteable(false);\n\t\t\t\n\t\t\tPosition pos = 3;\n\t\t\tString dots;\n\t\t\twhile (thread_->running())\n\t\t\t{\n\t\t\t\tqApp->wakeUpGuiThread();\n \t\t\t\tqApp->processEvents();\n\t\t\t\tif (pos < 40) \n\t\t\t\t{\n\t\t\t\t\tpos ++;\n\t\t\t\t\tdots +=\"..\";\n\t\t\t\t}\n\t\t\t\telse \n\t\t\t\t{\n\t\t\t\t\tpos = 3;\n\t\t\t\t\tdots = \"...\";\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tmc->setStatusbarText(\"Creating Model \" + dots);\n\t\t\t\tthread_->wait(500); \n\t\t\t}\n\n\/\/\t\t\tmc->setStatusbarText(\" Drawing...\");\n\t\t\tmc->setCompositesMuteable(true);\n\t\t\t\n \t\t\tif (mc->getPrimitiveManager().has(*this))\n\t\t\t{\n\t\t\t\tRepresentationMessage* msg = new RepresentationMessage(*this, RepresentationMessage::UPDATE);\n\t\t\t\tmc->sendMessage(*msg);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tmc->insert(*this);\n \t\t\tmc->setStatusbarText(\"\");\n\n#endif\n\t\t}\n\n\t\tvoid Representation::update_(bool rebuild) \n\t\t\tthrow()\n\t\t{\n\t\t\t\/\/ if no ModelProcessor was given, there can only exist \n\t\t\t\/\/ handmade GeometricObjects, which dont need to be updated\n\t\t\tif (model_processor_ != 0 && rebuild) \n\t\t\t{\n\t\t\t\tclearGeometricObjects();\n\t\t\t\tmodel_processor_->getGeometricObjects().clear();\n\t\t\t\tmodel_processor_->clearComposites();\n\t\t\t\t\n\t\t\t\tCompositeSet::Iterator it = composites_.begin();\n\t\t\t\tfor (; it!= composites_.end(); it++)\n\t\t\t\t{\n\t\t\t\t\t(const_cast<Composite*>(*it))->apply(*model_processor_);\n\t\t\t\t}\n\t\t\t\tgeometric_objects_ = model_processor_->getGeometricObjects();\n\t\t\t\tmodel_build_time_ = PreciseTime::now();\n\t\t\t}\n\n\t\t\tif (color_processor_ != 0) \n\t\t\t{\n\t\t\t\t\/\/ make sure, that the atom grid is recomputed for meshes\n\t\t\t\tif (rebuild) color_processor_->setComposites(&composites_);\n\t\t\t\tcolor_processor_->setTransparency(transparency_);\n\t\t\t\tcolor_processor_->setModelType(model_type_);\n\t\t\t\tgeometric_objects_.apply(*color_processor_);\n\t\t\t}\n\t\t}\n\t\t\n\n\t\tString Representation::getModelName() const\n\t\t\tthrow()\n\t\t{\n\t\t\treturn VIEW::getModelName(model_type_);\n\t\t}\n\n\t\t\n\t\tString Representation::getColoringName() const\n\t\t\tthrow()\n\t\t{\n\t\t\treturn VIEW::getColoringName(coloring_method_);\n\t\t}\n\n\n\t\tString Representation::getProperties() const\n\t\t\tthrow()\n\t\t{\n\t\t\treturn String(composites_.size()) + \" C, \" + String(geometric_objects_.size()) + \" P\";\n\t\t}\n\n\t\tvoid Representation::setModelProcessor(ModelProcessor* processor)\n\t\t\tthrow() \n\t\t{ \n\t\t\tif (model_processor_ != 0)\n\t\t\t{\n\t\t\t\tdelete model_processor_;\n\t\t\t}\n\t\t\tmodel_processor_ = processor;\n\t\t\t\n\t\t\tif (model_processor_ != 0) \n\t\t\t{\n\t\t\t\tmodel_processor_->setDrawingPrecision(drawing_precision_);\n\t\t\t\tmodel_processor_->setSurfaceDrawingPrecision(surface_drawing_precision_);\n\t\t\t}\n\t\t}\n\n\n\t\tvoid Representation::setColorProcessor(ColorProcessor* processor)\n\t\t\tthrow() \n\t\t{ \n\t\t\tif (color_processor_ != 0)\n\t\t\t{\n\t\t\t\tdelete color_processor_;\n\t\t\t}\n\t\t\tcolor_processor_ = processor;\n\t\t\t\n\t\t\tif (color_processor_ != 0)\n\t\t\t{\n\t\t\t\tcolor_processor_->setComposites(&composites_);\n\t\t\t\tcolor_processor_->setTransparency(transparency_);\n\t\t\t}\n\t\t}\n\n\t\t\n\t\tvoid Representation::setDrawingPrecision(DrawingPrecision precision)\n\t\t\tthrow() \n\t\t{\n\t\t\tdrawing_precision_ = precision;\n\t\t\tif (model_processor_ != 0) model_processor_->setDrawingPrecision(drawing_precision_);\n\t\t}\n\n\t\t\n\t\tvoid Representation::setSurfaceDrawingPrecision(float precision)\n\t\t\tthrow() \n\t\t{\n\t\t\tsurface_drawing_precision_ = precision;\n\t\t\tif (model_processor_ != 0) model_processor_->setSurfaceDrawingPrecision(surface_drawing_precision_);\n\t\t}\n\n\t\t\n\t\tvoid Representation::setTransparency(Size value)\n\t\t\tthrow()\n\t\t{\n\t\t\ttransparency_ = value;\n\t\t\tif (transparency_ > 255)\n\t\t\t{\n\t\t\t\ttransparency_ = 255;\n\t\t\t}\n\n\t\t\tif (color_processor_ != 0)\n\t\t\t{\n\t\t\t\tcolor_processor_->setTransparency(transparency_);\n\t\t\t}\n\t\t}\n\n\t} \/\/ namespace VIEW\n} \/\/ namespace BALL\n<commit_msg>no message<commit_after>\/\/ -*- Mode: C++; tab-width: 2; -*-\n\/\/ vi: set ts=2:\n\/\/\n\/\/ $Id: representation.C,v 1.30 2004\/04\/17 21:45:58 amoll Exp $\n\n#include <BALL\/VIEW\/KERNEL\/representation.h>\n#include <BALL\/VIEW\/MODELS\/modelProcessor.h>\n#include <BALL\/VIEW\/MODELS\/colorProcessor.h>\n#include <BALL\/VIEW\/KERNEL\/geometricObject.h>\n\n#include <BALL\/VIEW\/KERNEL\/threads.h>\n#include <BALL\/VIEW\/KERNEL\/mainControl.h>\n#include <BALL\/VIEW\/KERNEL\/message.h>\n\n#include <qapplication.h>\n\nnamespace BALL\n{\n\tnamespace VIEW\n\t{\n\n#ifdef BALL_QT_HAS_THREADS\n\t\tUpdateRepresentationThread* Representation::thread_ = 0;\n#endif\n\n\t\tRepresentation::Representation()\n\t\t\tthrow()\n\t\t\t\t: PropertyManager(),\n\t\t\t\t\tdrawing_mode_(DRAWING_MODE_SOLID),\n\t\t\t\t\tdrawing_precision_(DRAWING_PRECISION_HIGH),\n\t\t\t\t\tsurface_drawing_precision_(-1),\n\t\t\t\t\tmodel_type_(MODEL_UNKNOWN),\n\t\t\t\t\tcoloring_method_(COLORING_UNKNOWN),\n\t\t\t\t\ttransparency_(0),\n\t\t\t\t\tmodel_processor_(0),\n\t\t\t\t\tcolor_processor_(0),\n\t\t\t\t\tgeometric_objects_(),\n\t\t\t\t\tcomposites_()\n\t\t{\n\t\t}\n\n\t\t\t\t\t\n\t\tRepresentation::Representation(const Representation& rp)\n\t\t\tthrow()\n\t\t\t\t: PropertyManager(rp)\n\t\t{\n\t\t\t*this = rp;\n\t\t}\n\n\n\t\tRepresentation::Representation(ModelType model_type,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t DrawingPrecision drawing_precision,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t DrawingMode drawing_mode)\n\t\t\tthrow()\n\t\t\t\t: PropertyManager(),\n\t\t\t\t\tdrawing_mode_(drawing_mode),\n\t\t\t\t\tdrawing_precision_(drawing_precision),\n\t\t\t\t\tsurface_drawing_precision_(-1),\n\t\t\t\t\tmodel_type_(model_type),\n\t\t\t\t\ttransparency_(0),\n\t\t\t\t\tmodel_processor_(0),\n\t\t\t\t\tcolor_processor_(0),\n\t\t\t\t\tgeometric_objects_(),\n\t\t\t\t\tcomposites_()\n\t\t{\n\t\t}\n\n\n\t\tRepresentation::Representation(const HashSet<const Composite*>& composites, \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t ModelProcessor* model_processor)\n\t\t\tthrow()\n\t\t\t:\tPropertyManager(),\n\t\t\t\tdrawing_mode_(DRAWING_MODE_SOLID),\n\t\t\t\tdrawing_precision_(DRAWING_PRECISION_HIGH),\n\t\t\t\tsurface_drawing_precision_(-1),\n\t\t\t\ttransparency_(0),\n\t\t\t\tmodel_processor_(model_processor),\n\t\t\t\tcolor_processor_(0),\n\t\t\t\tgeometric_objects_(),\n\t\t\t\tcomposites_(composites)\n\t\t{\n\t\t}\n\n\t\t\t\t\n\t\tconst Representation& Representation::operator = (const Representation& representation)\n\t\t\tthrow()\n\t\t{\n\t\t\tclear();\n\n\t\t\tdrawing_mode_= representation.drawing_mode_;\n\t\t\tdrawing_precision_= representation.drawing_precision_;\n\t\t\tmodel_type_ = representation.model_type_;\n\t\t\tcoloring_method_ = representation.coloring_method_;\n\t\t\ttransparency_ = representation.transparency_;\n\t\t\tsurface_drawing_precision_ = representation.surface_drawing_precision_;\n\n\t\t\tPropertyManager::operator = (representation);\n\n\t\t\tif (representation.model_processor_ != 0)\n\t\t\t{\n\t\t\t\tmodel_processor_ = new ModelProcessor(*representation.model_processor_);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tmodel_processor_ = 0;\n\t\t\t}\n\n\t\t\tif (representation.color_processor_ != 0)\n\t\t\t{\n\t\t\t\tcolor_processor_ = new ColorProcessor(*representation.color_processor_);\n\t\t\t\tcolor_processor_->setTransparency(transparency_);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tcolor_processor_ = 0;\n\t\t\t}\n\n\t\t\tGeometricObjectList::ConstIterator it = representation.geometric_objects_.begin();\n\t\t\tfor (;it != representation.geometric_objects_.end(); it++)\n\t\t\t{\n\t\t\t\tGeometricObject* object = new GeometricObject(**it);\n\t\t\t\tgeometric_objects_.push_back(object);\n\t\t\t}\n\n\t\t\tcomposites_ = representation.composites_;\n\n\t\t\treturn *this;\n\t\t}\n\n\n\t\tRepresentation::~Representation()\n\t\t\tthrow()\n\t\t{\n\t\t\tclear();\n\t\t}\n\n\t\t\n\t\tvoid Representation::clear()\n\t\t\tthrow()\n\t\t{\n\t\t\tclearGeometricObjects();\n\t\t\tcomposites_.clear();\n\n\t\t\tif (model_processor_  != 0) delete model_processor_;\n\t\t\tif (color_processor_  != 0) delete color_processor_;\n\t\t\tmodel_processor_ \t= 0;\n\t\t\tcolor_processor_ \t= 0;\n\n\t\t\tdrawing_mode_= DRAWING_MODE_SOLID;\n\t\t\tdrawing_precision_= DRAWING_PRECISION_HIGH;\n\t\t\tmodel_type_ = MODEL_UNKNOWN;\n\t\t\tcoloring_method_ = COLORING_UNKNOWN;\n\t\t\ttransparency_ = 0;\n\t\t\tsurface_drawing_precision_ = -1;\n\t\t}\n\n\t\t\n\t\tvoid Representation::clearGeometricObjects()\n\t\t\tthrow()\n\t\t{\n\t\t\tList<GeometricObject*>::Iterator it = geometric_objects_.begin();\n\t\t\tfor (; it != geometric_objects_.end(); it++)\n\t\t\t{\n\t\t\t\tdelete *it;\n\t\t\t}\n\t\t\tgeometric_objects_.clear();\n\n\t\t\tif (model_processor_ != 0)\n\t\t\t{\n\t\t\t\tmodel_processor_->getGeometricObjects().clear();\n\t\t\t}\n\t\t}\n\t\t\t\t\t\n\n\t\tvoid Representation::dump(std::ostream& s, Size depth) const\n\t\t\tthrow()\n\t\t{\n\t\t\tBALL_DUMP_STREAM_PREFIX(s);\n\n\t\t\tBALL_DUMP_DEPTH(s, depth);\n\t\t\tBALL_DUMP_HEADER(s, this, this);\n\n\t\t\tBALL_DUMP_DEPTH(s, depth);\n\t\t\ts << \"drawing mode: \" << drawing_mode_<< std::endl;\n\t\t\tBALL_DUMP_DEPTH(s, depth);\n\t\t\ts << \"drawing precision: \" << drawing_precision_<< std::endl;\n\t\t\tBALL_DUMP_DEPTH(s, depth);\n\t\t\ts << \"model type : \" << model_type_ << std::endl;\n\t\t\tBALL_DUMP_DEPTH(s, depth);\n\t\t\ts << \"coloring type : \" << coloring_method_ << std::endl;\n\t\t\tBALL_DUMP_DEPTH(s, depth);\n\t\t\ts << \"number of primitives: \" << geometric_objects_.size() << std::endl;\n\t\t\tBALL_DUMP_DEPTH(s, depth);\n\t\t\ts << \"number of composites: \" << composites_.size() << std::endl;\n\t\t\tBALL_DUMP_DEPTH(s, depth);\n\t\t\ts << \"model processor: \" << model_processor_ << std::endl;\n\t\t\tBALL_DUMP_DEPTH(s, depth);\n\t\t\ts << \"PropertyManager: \" << std::endl;\n\n\t\t\tPropertyManager::dump(s, depth + 1);\n\n\t\t\tBALL_DUMP_STREAM_SUFFIX(s);     \n\t\t}\n\n\t\t\n\t\tbool Representation::isValid() const\n\t\t\tthrow()\n\t\t{\n\t\t\tif (drawing_precision_  < 0 || drawing_precision_ > BALL_VIEW_MAXIMAL_DRAWING_PRECISION ||\n\t\t\t\t\tdrawing_mode_ \t\t\t< 0 || drawing_mode_ > BALL_VIEW_MAXIMAL_DRAWING_MODE ||\n\t\t\t\t\ttransparency_ \t\t\t> 255)\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\n#ifdef BALL_VIEW_DEBUG\n\t\t\tGeometricObjectList::ConstIterator it = geometric_objects_.begin();\n\t\t\tfor (; it != geometric_objects_.end(); it++)\n\t\t\t{\n\t\t\t\tif (!(*it)->isValid()) return false;\n\t\t\t}\n#endif\n\n\t\t\tif (model_processor_ != 0 && !model_processor_->isValid()) return false; \n\n\t\t\treturn true;\n\t\t}\n\n\t\t\n\t\tvoid Representation::update(bool rebuild) \n\t\t\tthrow()\n\t\t{\n#ifndef BALL_QT_HAS_THREADS\n\t\t\tupdate_(rebuild);\n#else\n\t\t\tMainControl* mc = MainControl::getInstance(0);\n\t\t\t\n\t\t\t\/\/ ????? dirty trick to avoid getInstance problem under windows\n#ifdef BALL_PLATFORM_WINDOWS\n\t\t\tmc = dynamic_cast<MainControl*>(qApp->mainWidget());\n#endif\n\n\t\t\tif (mc == 0)\n\t\t\t{\n\t\t\t\tupdate_(rebuild);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif (thread_ != 0)\n\t\t\t{\n\t\t\t\tthread_->wait();\n\t\t\t\tdelete thread_;\n\t\t\t\tthread_ = 0;\n\t\t\t}\n\t\t\tthread_ = new UpdateRepresentationThread;\n\t\t\tthread_->setRepresentation(*this);\n\t\t\tthread_->setRebuild(rebuild);\n\t\t\tthread_->start();\n\n\t\t\t\/\/bool mc_was_muteable = mc->compositesAreMuteable();\n\t\t\tmc->setCompositesMuteable(false);\n\t\t\t\n\t\t\tPosition pos = 3;\n\t\t\tString dots;\n\t\t\twhile (thread_->running())\n\t\t\t{\n\t\t\t\tqApp->wakeUpGuiThread();\n \t\t\t\tqApp->processEvents();\n\t\t\t\tif (pos < 40) \n\t\t\t\t{\n\t\t\t\t\tpos ++;\n\t\t\t\t\tdots +=\"..\";\n\t\t\t\t}\n\t\t\t\telse \n\t\t\t\t{\n\t\t\t\t\tpos = 3;\n\t\t\t\t\tdots = \"...\";\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tmc->setStatusbarText(\"Creating \" + getModelName() + \" Model \" + dots);\n\t\t\t\tthread_->wait(500); \n\t\t\t}\n\n\t\t\tmc->setStatusbarText(\"\");\n\t\t\tmc->setCompositesMuteable(true);\n\t\t\t\n \t\t\tif (mc->getPrimitiveManager().has(*this))\n\t\t\t{\n\t\t\t\tRepresentationMessage* msg = new RepresentationMessage(*this, RepresentationMessage::UPDATE);\n\t\t\t\tmc->sendMessage(*msg);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tmc->insert(*this);\n \t\t\tmc->setStatusbarText(\"\");\n\n#endif\n\t\t}\n\n\t\tvoid Representation::update_(bool rebuild) \n\t\t\tthrow()\n\t\t{\n\t\t\t\/\/ if no ModelProcessor was given, there can only exist \n\t\t\t\/\/ handmade GeometricObjects, which dont need to be updated\n\t\t\tif (model_processor_ != 0 && rebuild) \n\t\t\t{\n\t\t\t\tclearGeometricObjects();\n\t\t\t\tmodel_processor_->getGeometricObjects().clear();\n\t\t\t\tmodel_processor_->clearComposites();\n\t\t\t\t\n\t\t\t\tCompositeSet::Iterator it = composites_.begin();\n\t\t\t\tfor (; it!= composites_.end(); it++)\n\t\t\t\t{\n\t\t\t\t\t(const_cast<Composite*>(*it))->apply(*model_processor_);\n\t\t\t\t}\n\t\t\t\tgeometric_objects_ = model_processor_->getGeometricObjects();\n\t\t\t\tmodel_build_time_ = PreciseTime::now();\n\t\t\t}\n\n\t\t\tif (color_processor_ != 0) \n\t\t\t{\n\t\t\t\t\/\/ make sure, that the atom grid is recomputed for meshes\n\t\t\t\tif (rebuild) color_processor_->setComposites(&composites_);\n\t\t\t\tcolor_processor_->setTransparency(transparency_);\n\t\t\t\tcolor_processor_->setModelType(model_type_);\n\t\t\t\tgeometric_objects_.apply(*color_processor_);\n\t\t\t}\n\t\t}\n\t\t\n\n\t\tString Representation::getModelName() const\n\t\t\tthrow()\n\t\t{\n\t\t\treturn VIEW::getModelName(model_type_);\n\t\t}\n\n\t\t\n\t\tString Representation::getColoringName() const\n\t\t\tthrow()\n\t\t{\n\t\t\treturn VIEW::getColoringName(coloring_method_);\n\t\t}\n\n\n\t\tString Representation::getProperties() const\n\t\t\tthrow()\n\t\t{\n\t\t\treturn String(composites_.size()) + \" C, \" + String(geometric_objects_.size()) + \" P\";\n\t\t}\n\n\t\tvoid Representation::setModelProcessor(ModelProcessor* processor)\n\t\t\tthrow() \n\t\t{ \n\t\t\tif (model_processor_ != 0)\n\t\t\t{\n\t\t\t\tdelete model_processor_;\n\t\t\t}\n\t\t\tmodel_processor_ = processor;\n\t\t\t\n\t\t\tif (model_processor_ != 0) \n\t\t\t{\n\t\t\t\tmodel_processor_->setDrawingPrecision(drawing_precision_);\n\t\t\t\tmodel_processor_->setSurfaceDrawingPrecision(surface_drawing_precision_);\n\t\t\t}\n\t\t}\n\n\n\t\tvoid Representation::setColorProcessor(ColorProcessor* processor)\n\t\t\tthrow() \n\t\t{ \n\t\t\tif (color_processor_ != 0)\n\t\t\t{\n\t\t\t\tdelete color_processor_;\n\t\t\t}\n\t\t\tcolor_processor_ = processor;\n\t\t\t\n\t\t\tif (color_processor_ != 0)\n\t\t\t{\n\t\t\t\tcolor_processor_->setComposites(&composites_);\n\t\t\t\tcolor_processor_->setTransparency(transparency_);\n\t\t\t}\n\t\t}\n\n\t\t\n\t\tvoid Representation::setDrawingPrecision(DrawingPrecision precision)\n\t\t\tthrow() \n\t\t{\n\t\t\tdrawing_precision_ = precision;\n\t\t\tif (model_processor_ != 0) model_processor_->setDrawingPrecision(drawing_precision_);\n\t\t}\n\n\t\t\n\t\tvoid Representation::setSurfaceDrawingPrecision(float precision)\n\t\t\tthrow() \n\t\t{\n\t\t\tsurface_drawing_precision_ = precision;\n\t\t\tif (model_processor_ != 0) model_processor_->setSurfaceDrawingPrecision(surface_drawing_precision_);\n\t\t}\n\n\t\t\n\t\tvoid Representation::setTransparency(Size value)\n\t\t\tthrow()\n\t\t{\n\t\t\ttransparency_ = value;\n\t\t\tif (transparency_ > 255)\n\t\t\t{\n\t\t\t\ttransparency_ = 255;\n\t\t\t}\n\n\t\t\tif (color_processor_ != 0)\n\t\t\t{\n\t\t\t\tcolor_processor_->setTransparency(transparency_);\n\t\t\t}\n\t\t}\n\n\t} \/\/ namespace VIEW\n} \/\/ namespace BALL\n<|endoftext|>"}
{"text":"<commit_before>\/\/------------------------------------------------------------------------------\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\n\/\/ version: $Id$\n\/\/ author:  Vassil Vassilev <vvasielv@cern.ch>\n\/\/------------------------------------------------------------------------------\n\n#include \"cling\/Interpreter\/Transaction.h\"\n\n#include \"cling\/Utils\/AST.h\"\n\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/AST\/DeclBase.h\"\n#include \"clang\/AST\/PrettyPrinter.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\nusing namespace clang;\n\nnamespace cling {\n\n  Transaction::Transaction(ASTContext& C) : m_ASTContext(C) {\n    Initialize(C);\n  }\n\n  Transaction::Transaction(const CompilationOptions& Opts, ASTContext& C)\n    : m_ASTContext(C) {\n    Initialize(C);\n    m_Opts = Opts; \/\/ intentional copy.\n  }\n\n  void Transaction::Initialize(ASTContext& C) {\n    m_NestedTransactions.reset(0);\n    m_Parent = 0; \n    m_State = kCollecting;\n    m_IssuedDiags = kNone;\n    m_Opts = CompilationOptions();\n    m_Module = 0; \n    m_WrapperFD = 0;\n    m_CFWrapperFD = 0;\n    m_Next = 0;\n    \/\/m_ASTContext = C;\n  }\n\n  Transaction::~Transaction() {\n    if (hasNestedTransactions())\n      for (size_t i = 0; i < m_NestedTransactions->size(); ++i) {\n        assert((*m_NestedTransactions)[i]->getState() == kCommitted \n               && \"All nested transactions must be committed!\");\n        delete (*m_NestedTransactions)[i];\n      }\n  }\n\n  void Transaction::addNestedTransaction(Transaction* nested) {\n    \/\/ Create lazily the list\n    if (!m_NestedTransactions)\n      m_NestedTransactions.reset(new NestedTransactions());\n\n    nested->setParent(this);\n    \/\/ Leave a marker in the parent transaction, where the nested transaction\n    \/\/ started.\n    DelayCallInfo marker(clang::DeclGroupRef(), Transaction::kCCINone);\n    m_DeclQueue.push_back(marker);\n    m_NestedTransactions->push_back(nested);\n  }\n\n  void Transaction::removeNestedTransaction(Transaction* nested) {\n    assert(hasNestedTransactions() && \"Does not contain nested transactions\");\n    int nestedPos = -1;\n    for (size_t i = 0; i < m_NestedTransactions->size(); ++i)\n      if ((*m_NestedTransactions)[i] == nested) {\n        nestedPos = i;\n        break;\n      }\n    assert(nestedPos > -1 && \"Not found!?\");\n    m_NestedTransactions->erase(m_NestedTransactions->begin() + nestedPos);\n    \/\/ We need to remove the marker too.\n    int markerPos = -1;\n    for (size_t i = 0; i < size(); ++i) {\n      if ((*this)[i].m_DGR.isNull() && (*this)[i].m_Call == kCCINone) {\n        ++markerPos;\n        if (nestedPos == markerPos) {\n          erase(i);\n          break;\n        }\n      }\n    }\n    if (!m_NestedTransactions->size())\n      m_NestedTransactions.reset(0);\n  }\n\n  void Transaction::reset() {\n    assert(empty() && \"The transaction must be empty.\");\n    if (Transaction* parent = getParent())\n      parent->removeNestedTransaction(this);\n    m_Parent = 0;\n    m_State = kCollecting;\n    m_IssuedDiags = kNone;\n    m_Opts = CompilationOptions();\n    m_NestedTransactions.reset(0); \/\/ FIXME: leaks the nested transactions.\n    m_Module = 0;\n    m_WrapperFD = 0;\n    m_CFWrapperFD = 0;\n    m_Next = 0;\n  }\n\n \n  void Transaction::append(DelayCallInfo DCI) {\n    assert(!DCI.m_DGR.isNull() && \"Appending null DGR?!\");\n    assert(getState() == kCollecting\n           && \"Cannot append declarations in current state.\");\n    forceAppend(DCI);\n  }\n\n  void Transaction::forceAppend(DelayCallInfo DCI) {\n    assert(!DCI.m_DGR.isNull() && \"Appending null DGR?!\");\n    assert((getState() == kCollecting || getState() == kCompleted)\n           && \"Must not be\");\n\n#ifndef NDEBUG\n    \/\/ Check for duplicates\n    for (size_t i = 0, e = m_DeclQueue.size(); i < e; ++i) {\n      DelayCallInfo &oldDCI (m_DeclQueue[i]);\n      \/\/ FIXME: This is possible bug in clang, which will instantiate one and \n      \/\/ the same CXXStaticMemberVar several times. This happens when there are\n      \/\/ two dependent expressions and the first uses another declaration from \n      \/\/ the redeclaration chain. This will force Sema in to instantiate the\n      \/\/ definition (usually the most recent decl in the chain) and then the\n      \/\/ second expression might referece the definition (which was already)\n      \/\/ instantiated, but Sema seems not to keep track of these kinds of\n      \/\/ instantiations, even though the points of instantiation are the same!\n      \/\/\n      \/\/ This should be investigated further when we merge with newest clang.\n      \/\/ This is triggered by running the roottest: .\/root\/io\/newstl\n      if (oldDCI.m_Call == kCCIHandleCXXStaticMemberVarInstantiation)\n        continue;\n      \/\/ It is possible to have duplicate calls to HandleVTable with the same\n      \/\/ declaration, because each time Sema believes a vtable is used it emits\n      \/\/ that callback. \n      \/\/ For reference (clang::CodeGen::CodeGenModule::EmitVTable).\n      if (oldDCI.m_Call != kCCIHandleVTable)\n        assert(oldDCI != DCI && \"Duplicates?!\");\n    }\n#endif\n\n    bool checkForWrapper = !m_WrapperFD;\n    bool checkForCFWrapper = !m_CFWrapperFD;\n    \/\/ FIXME: Assignment in assert!!!!\n    assert(checkForWrapper = true && \"Check for wrappers with asserts\");\n    \/\/ register the wrapper if any.\n    if ((checkForWrapper || checkForCFWrapper) && !DCI.m_DGR.isNull() &&\n        DCI.m_DGR.isSingleDecl()) {\n      if (FunctionDecl* FD =\n          dyn_cast<FunctionDecl>(DCI.m_DGR.getSingleDecl())) {\n        if (checkForWrapper && utils::Analyze::IsWrapper(FD)) {\n          assert(!m_WrapperFD && \"Two wrappers in one transaction?\");\n          m_WrapperFD = FD;\n        }\n        if (checkForCFWrapper && utils::Analyze::IsCFWrapper(FD)) {\n          m_CFWrapperFD = FD;\n        }\n      }\n    }\n    \n    if (comesFromASTReader(DCI.m_DGR))\n      m_DeserializedDeclQueue.push_back(DCI);\n    else\n      m_DeclQueue.push_back(DCI);\n  }\n\n  void Transaction::append(clang::DeclGroupRef DGR) {\n    append(DelayCallInfo(DGR, kCCIHandleTopLevelDecl));\n  }\n\n  void Transaction::append(Decl* D) {\n    append(DeclGroupRef(D));\n  }\n\n  void Transaction::forceAppend(Decl* D) {\n    forceAppend(DelayCallInfo(DeclGroupRef(D), kCCIHandleTopLevelDecl));\n  }\n  \n  void Transaction::erase(size_t pos) {\n    assert(!empty() && \"Erasing from an empty transaction.\");\n    m_DeclQueue.erase(decls_begin() + pos);\n  }\n\n  void Transaction::DelayCallInfo::dump() const {\n    PrintingPolicy Policy((LangOptions()));\n    print(llvm::errs(), Policy, \/*Indent*\/0, \/*PrintInstantiation*\/true);\n  }\n\n  void Transaction::DelayCallInfo::print(llvm::raw_ostream& Out, \n                                         const PrintingPolicy& Policy,\n                                         unsigned Indent, \n                                         bool PrintInstantiation, \n                                    llvm::StringRef prependInfo \/*=\"\"*\/) const {\n    static const char* const stateNames[Transaction::kCCINumStates] = {\n      \"kCCINone\",\n      \"kCCIHandleTopLevelDecl\",\n      \"kCCIHandleInterestingDecl\",\n      \"kCCIHandleTagDeclDefinition\",\n      \"kCCIHandleVTable\",\n      \"kCCIHandleCXXImplicitFunctionInstantiation\",\n      \"kCCIHandleCXXStaticMemberVarInstantiation\",\n    };\n    assert((sizeof(stateNames) \/sizeof(void*)) == Transaction::kCCINumStates \n           && \"Missing states?\");\n    if (!prependInfo.empty()) {\n      Out.changeColor(llvm::raw_ostream::RED);\n      Out << prependInfo;\n      Out.resetColor();\n      Out << \", \";\n    }\n    Out.changeColor(llvm::raw_ostream::BLUE);\n    Out << stateNames[m_Call]; \n    Out.changeColor(llvm::raw_ostream::GREEN);\n    Out << \" <- \";\n    Out.resetColor();\n    for (DeclGroupRef::const_iterator I = m_DGR.begin(), E = m_DGR.end(); \n         I != E; ++I)\n        if (*I)\n          (*I)->print(Out, Policy, Indent, PrintInstantiation);\n        else\n          Out << \"<<NULL DECL>>\";\n  }\n\n  void Transaction::dump() const {\n    const ASTContext& C = getASTContext();\n    PrintingPolicy Policy = C.getPrintingPolicy();\n    print(llvm::errs(), Policy, \/*Indent*\/0, \/*PrintInstantiation*\/true);\n  }\n\n  void Transaction::dumpPretty() const {\n    const ASTContext& C = getASTContext();      \n    PrintingPolicy Policy(C.getLangOpts());\n    print(llvm::errs(), Policy, \/*Indent*\/0, \/*PrintInstantiation*\/true);\n  }\n\n  void Transaction::print(llvm::raw_ostream& Out, const PrintingPolicy& Policy,\n                          unsigned Indent, bool PrintInstantiation) const {\n    int nestedT = 0;\n    for (const_iterator I = decls_begin(), E = decls_end(); I != E; ++I) {\n      if (I->m_DGR.isNull()) {\n        assert(hasNestedTransactions() && \"DGR is null even if no nesting?\");\n        \/\/ print the nested decl\n        Out<< \"\\n\";\n        Out<<\"+====================================================+\\n\";\n        Out<<\"        Nested Transaction\" << nestedT << \"           \\n\";\n        Out<<\"+====================================================+\\n\";\n        (*m_NestedTransactions)[nestedT++]->print(Out, Policy, Indent, \n                                                  PrintInstantiation);\n        Out<< \"\\n\";\n        Out<<\"+====================================================+\\n\";\n        Out<<\"          End Transaction\" << nestedT << \"            \\n\";\n        Out<<\"+====================================================+\\n\";\n      }\n      I->print(Out, Policy, Indent, PrintInstantiation);\n    }\n\n    \/\/ Print the deserialized decls if any.\n    for (const_iterator I = deserialized_decls_begin(), \n           E = deserialized_decls_end(); I != E; ++I) {\n      \n      assert(!I->m_DGR.isNull() && \"Must not contain null DGR.\");\n      I->print(Out, Policy, Indent, PrintInstantiation, \"Deserialized\");\n    }\n  }\n\n  void Transaction::printStructure(size_t nindent) const {\n    static const char* const stateNames[kNumStates] = {\n      \"Collecting\",\n      \"kCompleted\",\n      \"RolledBack\",\n      \"RolledBackWithErrors\",\n      \"Committed\"\n    };\n    assert((sizeof(stateNames) \/ sizeof(void*)) == kNumStates \n           && \"Missing a state to print.\");\n    std::string indent(nindent, ' ');\n    llvm::errs() << indent << \"Transaction @\" << this << \": \\n\";\n    for (const_nested_iterator I = nested_begin(), E = nested_end(); \n         I != E; ++I) {\n      (*I)->printStructure(nindent + 3);\n    }\n    llvm::errs() << indent << \" state: \" << stateNames[getState()] << \", \"\n                 << size() << \" decl groups, \";\n    if (hasNestedTransactions())\n      llvm::errs() << m_NestedTransactions->size();\n    else\n      llvm::errs() << \"0\";\n\n    llvm::errs() << \" nested transactions\\n\"\n                 << indent << \" wrapper: \" << m_WrapperFD\n                 << \", parent: \" << m_Parent\n                 << \", next: \" << m_Next << \"\\n\";\n  }\n\n  void Transaction::printStructureBrief(size_t nindent \/*=0*\/) const {\n    std::string indent(nindent, ' ');\n    llvm::errs() << indent << \"<cling::Transaction* \" << this \n                 << \" isEmpty=\" << empty();\n    llvm::errs() << \" isCommitted=\" << (getState() == kCommitted);\n    llvm::errs() <<\"> \\n\";\n\n    for (const_nested_iterator I = nested_begin(), E = nested_end(); \n         I != E; ++I) {\n      llvm::errs() << indent << \"`\";\n      (*I)->printStructureBrief(nindent + 3);\n    }\n  }\n\n  bool Transaction::comesFromASTReader(DeclGroupRef DGR) const {\n    assert(!DGR.isNull() && \"DeclGroupRef is Null!\");\n    if (getCompilationOpts().CodeGenerationForModule)\n      return true;\n\n    \/\/ Take the first\/only decl in the group.\n    Decl* D = *DGR.begin();\n    return D->isFromASTFile();\n  }\n\n} \/\/ end namespace cling\n<commit_msg>Add newline; (some?) fwd decls do not have one.<commit_after>\/\/------------------------------------------------------------------------------\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\n\/\/ version: $Id$\n\/\/ author:  Vassil Vassilev <vvasielv@cern.ch>\n\/\/------------------------------------------------------------------------------\n\n#include \"cling\/Interpreter\/Transaction.h\"\n\n#include \"cling\/Utils\/AST.h\"\n\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/AST\/DeclBase.h\"\n#include \"clang\/AST\/PrettyPrinter.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\nusing namespace clang;\n\nnamespace cling {\n\n  Transaction::Transaction(ASTContext& C) : m_ASTContext(C) {\n    Initialize(C);\n  }\n\n  Transaction::Transaction(const CompilationOptions& Opts, ASTContext& C)\n    : m_ASTContext(C) {\n    Initialize(C);\n    m_Opts = Opts; \/\/ intentional copy.\n  }\n\n  void Transaction::Initialize(ASTContext& C) {\n    m_NestedTransactions.reset(0);\n    m_Parent = 0; \n    m_State = kCollecting;\n    m_IssuedDiags = kNone;\n    m_Opts = CompilationOptions();\n    m_Module = 0; \n    m_WrapperFD = 0;\n    m_CFWrapperFD = 0;\n    m_Next = 0;\n    \/\/m_ASTContext = C;\n  }\n\n  Transaction::~Transaction() {\n    if (hasNestedTransactions())\n      for (size_t i = 0; i < m_NestedTransactions->size(); ++i) {\n        assert((*m_NestedTransactions)[i]->getState() == kCommitted \n               && \"All nested transactions must be committed!\");\n        delete (*m_NestedTransactions)[i];\n      }\n  }\n\n  void Transaction::addNestedTransaction(Transaction* nested) {\n    \/\/ Create lazily the list\n    if (!m_NestedTransactions)\n      m_NestedTransactions.reset(new NestedTransactions());\n\n    nested->setParent(this);\n    \/\/ Leave a marker in the parent transaction, where the nested transaction\n    \/\/ started.\n    DelayCallInfo marker(clang::DeclGroupRef(), Transaction::kCCINone);\n    m_DeclQueue.push_back(marker);\n    m_NestedTransactions->push_back(nested);\n  }\n\n  void Transaction::removeNestedTransaction(Transaction* nested) {\n    assert(hasNestedTransactions() && \"Does not contain nested transactions\");\n    int nestedPos = -1;\n    for (size_t i = 0; i < m_NestedTransactions->size(); ++i)\n      if ((*m_NestedTransactions)[i] == nested) {\n        nestedPos = i;\n        break;\n      }\n    assert(nestedPos > -1 && \"Not found!?\");\n    m_NestedTransactions->erase(m_NestedTransactions->begin() + nestedPos);\n    \/\/ We need to remove the marker too.\n    int markerPos = -1;\n    for (size_t i = 0; i < size(); ++i) {\n      if ((*this)[i].m_DGR.isNull() && (*this)[i].m_Call == kCCINone) {\n        ++markerPos;\n        if (nestedPos == markerPos) {\n          erase(i);\n          break;\n        }\n      }\n    }\n    if (!m_NestedTransactions->size())\n      m_NestedTransactions.reset(0);\n  }\n\n  void Transaction::reset() {\n    assert(empty() && \"The transaction must be empty.\");\n    if (Transaction* parent = getParent())\n      parent->removeNestedTransaction(this);\n    m_Parent = 0;\n    m_State = kCollecting;\n    m_IssuedDiags = kNone;\n    m_Opts = CompilationOptions();\n    m_NestedTransactions.reset(0); \/\/ FIXME: leaks the nested transactions.\n    m_Module = 0;\n    m_WrapperFD = 0;\n    m_CFWrapperFD = 0;\n    m_Next = 0;\n  }\n\n \n  void Transaction::append(DelayCallInfo DCI) {\n    assert(!DCI.m_DGR.isNull() && \"Appending null DGR?!\");\n    assert(getState() == kCollecting\n           && \"Cannot append declarations in current state.\");\n    forceAppend(DCI);\n  }\n\n  void Transaction::forceAppend(DelayCallInfo DCI) {\n    assert(!DCI.m_DGR.isNull() && \"Appending null DGR?!\");\n    assert((getState() == kCollecting || getState() == kCompleted)\n           && \"Must not be\");\n\n#ifndef NDEBUG\n    \/\/ Check for duplicates\n    for (size_t i = 0, e = m_DeclQueue.size(); i < e; ++i) {\n      DelayCallInfo &oldDCI (m_DeclQueue[i]);\n      \/\/ FIXME: This is possible bug in clang, which will instantiate one and \n      \/\/ the same CXXStaticMemberVar several times. This happens when there are\n      \/\/ two dependent expressions and the first uses another declaration from \n      \/\/ the redeclaration chain. This will force Sema in to instantiate the\n      \/\/ definition (usually the most recent decl in the chain) and then the\n      \/\/ second expression might referece the definition (which was already)\n      \/\/ instantiated, but Sema seems not to keep track of these kinds of\n      \/\/ instantiations, even though the points of instantiation are the same!\n      \/\/\n      \/\/ This should be investigated further when we merge with newest clang.\n      \/\/ This is triggered by running the roottest: .\/root\/io\/newstl\n      if (oldDCI.m_Call == kCCIHandleCXXStaticMemberVarInstantiation)\n        continue;\n      \/\/ It is possible to have duplicate calls to HandleVTable with the same\n      \/\/ declaration, because each time Sema believes a vtable is used it emits\n      \/\/ that callback. \n      \/\/ For reference (clang::CodeGen::CodeGenModule::EmitVTable).\n      if (oldDCI.m_Call != kCCIHandleVTable)\n        assert(oldDCI != DCI && \"Duplicates?!\");\n    }\n#endif\n\n    bool checkForWrapper = !m_WrapperFD;\n    bool checkForCFWrapper = !m_CFWrapperFD;\n    \/\/ FIXME: Assignment in assert!!!!\n    assert(checkForWrapper = true && \"Check for wrappers with asserts\");\n    \/\/ register the wrapper if any.\n    if ((checkForWrapper || checkForCFWrapper) && !DCI.m_DGR.isNull() &&\n        DCI.m_DGR.isSingleDecl()) {\n      if (FunctionDecl* FD =\n          dyn_cast<FunctionDecl>(DCI.m_DGR.getSingleDecl())) {\n        if (checkForWrapper && utils::Analyze::IsWrapper(FD)) {\n          assert(!m_WrapperFD && \"Two wrappers in one transaction?\");\n          m_WrapperFD = FD;\n        }\n        if (checkForCFWrapper && utils::Analyze::IsCFWrapper(FD)) {\n          m_CFWrapperFD = FD;\n        }\n      }\n    }\n    \n    if (comesFromASTReader(DCI.m_DGR))\n      m_DeserializedDeclQueue.push_back(DCI);\n    else\n      m_DeclQueue.push_back(DCI);\n  }\n\n  void Transaction::append(clang::DeclGroupRef DGR) {\n    append(DelayCallInfo(DGR, kCCIHandleTopLevelDecl));\n  }\n\n  void Transaction::append(Decl* D) {\n    append(DeclGroupRef(D));\n  }\n\n  void Transaction::forceAppend(Decl* D) {\n    forceAppend(DelayCallInfo(DeclGroupRef(D), kCCIHandleTopLevelDecl));\n  }\n  \n  void Transaction::erase(size_t pos) {\n    assert(!empty() && \"Erasing from an empty transaction.\");\n    m_DeclQueue.erase(decls_begin() + pos);\n  }\n\n  void Transaction::DelayCallInfo::dump() const {\n    PrintingPolicy Policy((LangOptions()));\n    print(llvm::errs(), Policy, \/*Indent*\/0, \/*PrintInstantiation*\/true);\n  }\n\n  void Transaction::DelayCallInfo::print(llvm::raw_ostream& Out, \n                                         const PrintingPolicy& Policy,\n                                         unsigned Indent, \n                                         bool PrintInstantiation, \n                                    llvm::StringRef prependInfo \/*=\"\"*\/) const {\n    static const char* const stateNames[Transaction::kCCINumStates] = {\n      \"kCCINone\",\n      \"kCCIHandleTopLevelDecl\",\n      \"kCCIHandleInterestingDecl\",\n      \"kCCIHandleTagDeclDefinition\",\n      \"kCCIHandleVTable\",\n      \"kCCIHandleCXXImplicitFunctionInstantiation\",\n      \"kCCIHandleCXXStaticMemberVarInstantiation\",\n    };\n    assert((sizeof(stateNames) \/sizeof(void*)) == Transaction::kCCINumStates \n           && \"Missing states?\");\n    if (!prependInfo.empty()) {\n      Out.changeColor(llvm::raw_ostream::RED);\n      Out << prependInfo;\n      Out.resetColor();\n      Out << \", \";\n    }\n    Out.changeColor(llvm::raw_ostream::BLUE);\n    Out << stateNames[m_Call]; \n    Out.changeColor(llvm::raw_ostream::GREEN);\n    Out << \" <- \";\n    Out.resetColor();\n    for (DeclGroupRef::const_iterator I = m_DGR.begin(), E = m_DGR.end(); \n         I != E; ++I) {\n        if (*I)\n          (*I)->print(Out, Policy, Indent, PrintInstantiation);\n        else\n          Out << \"<<NULL DECL>>\";\n        Out << '\\n';\n    }\n  }\n\n  void Transaction::dump() const {\n    const ASTContext& C = getASTContext();\n    PrintingPolicy Policy = C.getPrintingPolicy();\n    print(llvm::errs(), Policy, \/*Indent*\/0, \/*PrintInstantiation*\/true);\n  }\n\n  void Transaction::dumpPretty() const {\n    const ASTContext& C = getASTContext();      \n    PrintingPolicy Policy(C.getLangOpts());\n    print(llvm::errs(), Policy, \/*Indent*\/0, \/*PrintInstantiation*\/true);\n  }\n\n  void Transaction::print(llvm::raw_ostream& Out, const PrintingPolicy& Policy,\n                          unsigned Indent, bool PrintInstantiation) const {\n    int nestedT = 0;\n    for (const_iterator I = decls_begin(), E = decls_end(); I != E; ++I) {\n      if (I->m_DGR.isNull()) {\n        assert(hasNestedTransactions() && \"DGR is null even if no nesting?\");\n        \/\/ print the nested decl\n        Out<< \"\\n\";\n        Out<<\"+====================================================+\\n\";\n        Out<<\"        Nested Transaction\" << nestedT << \"           \\n\";\n        Out<<\"+====================================================+\\n\";\n        (*m_NestedTransactions)[nestedT++]->print(Out, Policy, Indent, \n                                                  PrintInstantiation);\n        Out<< \"\\n\";\n        Out<<\"+====================================================+\\n\";\n        Out<<\"          End Transaction\" << nestedT << \"            \\n\";\n        Out<<\"+====================================================+\\n\";\n      }\n      I->print(Out, Policy, Indent, PrintInstantiation);\n    }\n\n    \/\/ Print the deserialized decls if any.\n    for (const_iterator I = deserialized_decls_begin(), \n           E = deserialized_decls_end(); I != E; ++I) {\n      \n      assert(!I->m_DGR.isNull() && \"Must not contain null DGR.\");\n      I->print(Out, Policy, Indent, PrintInstantiation, \"Deserialized\");\n    }\n  }\n\n  void Transaction::printStructure(size_t nindent) const {\n    static const char* const stateNames[kNumStates] = {\n      \"Collecting\",\n      \"kCompleted\",\n      \"RolledBack\",\n      \"RolledBackWithErrors\",\n      \"Committed\"\n    };\n    assert((sizeof(stateNames) \/ sizeof(void*)) == kNumStates \n           && \"Missing a state to print.\");\n    std::string indent(nindent, ' ');\n    llvm::errs() << indent << \"Transaction @\" << this << \": \\n\";\n    for (const_nested_iterator I = nested_begin(), E = nested_end(); \n         I != E; ++I) {\n      (*I)->printStructure(nindent + 3);\n    }\n    llvm::errs() << indent << \" state: \" << stateNames[getState()] << \", \"\n                 << size() << \" decl groups, \";\n    if (hasNestedTransactions())\n      llvm::errs() << m_NestedTransactions->size();\n    else\n      llvm::errs() << \"0\";\n\n    llvm::errs() << \" nested transactions\\n\"\n                 << indent << \" wrapper: \" << m_WrapperFD\n                 << \", parent: \" << m_Parent\n                 << \", next: \" << m_Next << \"\\n\";\n  }\n\n  void Transaction::printStructureBrief(size_t nindent \/*=0*\/) const {\n    std::string indent(nindent, ' ');\n    llvm::errs() << indent << \"<cling::Transaction* \" << this \n                 << \" isEmpty=\" << empty();\n    llvm::errs() << \" isCommitted=\" << (getState() == kCommitted);\n    llvm::errs() <<\"> \\n\";\n\n    for (const_nested_iterator I = nested_begin(), E = nested_end(); \n         I != E; ++I) {\n      llvm::errs() << indent << \"`\";\n      (*I)->printStructureBrief(nindent + 3);\n    }\n  }\n\n  bool Transaction::comesFromASTReader(DeclGroupRef DGR) const {\n    assert(!DGR.isNull() && \"DeclGroupRef is Null!\");\n    if (getCompilationOpts().CodeGenerationForModule)\n      return true;\n\n    \/\/ Take the first\/only decl in the group.\n    Decl* D = *DGR.begin();\n    return D->isFromASTFile();\n  }\n\n} \/\/ end namespace cling\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 <algorithm>\n#include <cmath>\n#include <deque>\n\n#include <boost\/math\/constants\/constants.hpp>\n\n#include <libetonyek\/KEYPresentationInterface.h>\n\n#include \"KEYOutput.h\"\n#include \"KEYPath.h\"\n#include \"KEYShape.h\"\n#include \"KEYText.h\"\n#include \"KEYTransformation.h\"\n#include \"KEYTypes.h\"\n\nnamespace m = boost::math::double_constants;\n\nusing std::deque;\n\nnamespace libetonyek\n{\n\nKEYShape::KEYShape()\n  : geometry()\n  , style()\n  , path()\n  , text()\n{\n}\n\nnamespace\n{\n\nclass ShapeObject : public KEYObject\n{\npublic:\n  ShapeObject(const KEYShapePtr_t &shape);\n  virtual ~ShapeObject();\n\nprivate:\n  virtual void draw(const KEYOutput &output);\n\nprivate:\n  const KEYShapePtr_t m_shape;\n};\n\nShapeObject::ShapeObject(const KEYShapePtr_t &shape)\n  : m_shape(shape)\n{\n}\n\nShapeObject::~ShapeObject()\n{\n}\n\nvoid ShapeObject::draw(const KEYOutput &output)\n{\n  if (bool(m_shape) && bool(m_shape->path))\n  {\n    \/\/ TODO: make style\n\n    const KEYTransformation tr = bool(m_shape->geometry) ? makeTransformation(*m_shape->geometry) : KEYTransformation();\n    KEYOutput newOutput(output, tr, m_shape->style);\n    const KEYPath path = *m_shape->path * newOutput.getTransformation();\n\n    KEYPresentationInterface *const painter = output.getPainter();\n\n    painter->setStyle(WPXPropertyList(), WPXPropertyListVector());\n    painter->drawPath(path.toWPG());\n\n    if (bool(m_shape->text))\n      makeObject(m_shape->text)->draw(newOutput);\n  }\n}\n\n}\n\nKEYObjectPtr_t makeObject(const KEYShapePtr_t &shape)\n{\n  const KEYObjectPtr_t object(new ShapeObject(shape));\n  return object;\n}\n\nnamespace\n{\n\nstruct Point\n{\n  double x;\n  double y;\n\n  Point();\n  Point(double x_, double y_);\n};\n\nPoint::Point()\n  : x(0)\n  , y(0)\n{\n}\n\nPoint::Point(const double x_, const double y_)\n  : x(x_)\n  , y(y_)\n{\n}\n\nbool approxEqual(const Point &left, const Point &right, const double eps = KEY_EPSILON)\n{\n  using libetonyek::approxEqual;\n  return approxEqual(left.x, right.x, eps) && approxEqual(left.y, right.y, eps);\n}\n\nbool operator==(const Point &left, const Point &right)\n{\n  return approxEqual(left, right);\n}\n\nbool operator!=(const Point &left, const Point &right)\n{\n  return !(left == right);\n}\n\n}\n\nnamespace\n{\n\nusing namespace transformations;\n\ndeque<Point> rotatePoint(const Point &point, const unsigned n)\n{\n  deque<Point> points;\n\n\n  const double angle = m::two_pi \/ n;\n\n  points.push_back(point);\n  for (unsigned i = 1; i < n; ++i)\n  {\n    Point pt(point);\n    const KEYTransformation rot(rotate(i * angle));\n    rot(pt.x, pt.y);\n    points.push_back(pt);\n  }\n\n  return points;\n}\n\ndeque<Point> drawArrowHalf(const double headWidth, const double stemThickness)\n{\n  \/\/ user space canvas: [0:1] x [0:1]\n\n  deque<Point> points;\n  points.push_back(Point(0, stemThickness));\n  points.push_back(Point(1 - headWidth, stemThickness));\n  points.push_back(Point(1 - headWidth, 1));\n  points.push_back(Point(1, 0));\n\n  return points;\n}\n\nKEYPathPtr_t makePolyLine(const deque<Point> inputPoints, bool close = true)\n{\n  KEYPathPtr_t path;\n\n  \/\/ need at least 2 points to make a polyline\n  if (inputPoints.size() < 2)\n    return path;\n\n  \/\/ remove multiple points\n  deque<Point> points;\n  std::unique_copy(inputPoints.begin(), inputPoints.end(), back_inserter(points));\n\n  \/\/ close path if the first and last points are equal\n  if (points.front() == points.back())\n  {\n    points.pop_back();\n    close = true;\n  }\n\n  \/\/ ... but there must be at least 3 points to make a closed path\n  if (points.size() < 3)\n    close = false;\n\n  \/\/ need at least 2 points to make a polyline\n  if (points.size() < 2)\n    return path;\n\n  path.reset(new KEYPath());\n\n  deque<Point>::const_iterator it = points.begin();\n  path->appendMoveTo(it->x, it->y);\n  ++it;\n  for (; it != points.end(); ++it)\n    path->appendLineTo(it->x, it->y);\n\n  if (close)\n    path->appendClose();\n\n  return path;\n}\n\nstruct TransformPoint\n{\n  TransformPoint(const KEYTransformation &tr)\n    : m_tr(tr)\n  {\n  }\n\n  void operator()(Point &point) const\n  {\n    m_tr(point.x, point.y);\n  }\n\nprivate:\n  const KEYTransformation &m_tr;\n};\n\nvoid transform(deque<Point> &points, const KEYTransformation &tr)\n{\n  for_each(points.begin(), points.end(), TransformPoint(tr));\n}\n\n}\n\nKEYPathPtr_t makePolygonPath(const KEYSize &size, const unsigned edges)\n{\n  \/\/ user space canvas: [-1:1] x [-1:1]\n\n  deque<Point> points = rotatePoint(Point(0, -1), edges);\n\n  \/\/ FIXME: the shape should probably be scaled to whole width\/height.\n  \/\/ Check.\n  transform(points, translate(1, 1) * scale(0.5, 0.5) * scale(size.width, size.height));\n  const KEYPathPtr_t path = makePolyLine(points);\n\n  return path;\n}\n\nKEYPathPtr_t makeRoundedRectanglePath(const KEYSize &size, const double radius)\n{\n  \/\/ TODO: implement me\n  (void) size;\n  (void) radius;\n  return KEYPathPtr_t();\n}\n\nKEYPathPtr_t makeArrowPath(const KEYSize &size, const double headWidth, const double stemThickness)\n{\n  deque<Point> points = drawArrowHalf(headWidth \/ size.width, stemThickness);\n\n  \/\/ mirror around the x axis\n  deque<Point> mirroredPoints = points;\n  transform(mirroredPoints, flip(false, true));\n\n  \/\/ join the two point sets\n  copy(mirroredPoints.rbegin(), mirroredPoints.rend(), back_inserter(points));\n\n  \/\/ transform and create path\n  transform(points, translate(0, 1) * scale(1, 0.5) * scale(size.width, size.height));\n  const KEYPathPtr_t path = makePolyLine(points);\n  return path;\n}\n\nKEYPathPtr_t makeDoubleArrowPath(const KEYSize &size, const double headWidth, const double stemThickness)\n{\n  deque<Point> points = drawArrowHalf(2 * headWidth \/ size.width, 1 - 2 * stemThickness);\n\n  {\n    \/\/ mirror around the y axis\n    deque<Point> mirroredPoints = points;\n    transform(mirroredPoints, flip(true, false));\n\n    copy(mirroredPoints.begin(), mirroredPoints.end(), front_inserter(points));\n  }\n\n  {\n    \/\/ mirror around the x axis\n    deque<Point> mirroredPoints = points;\n    transform(mirroredPoints, flip(false, true));\n\n    copy(mirroredPoints.rbegin(), mirroredPoints.rend(), back_inserter(points));\n  }\n\n  transform(points, translate(1, 1) * scale(0.5, 0.5) * scale(size.width, size.height));\n  const KEYPathPtr_t path = makePolyLine(points);\n  return path;\n}\n\nKEYPathPtr_t makeStarPath(const KEYSize &size, const unsigned points, const double innerRadius)\n{\n  \/\/ user space canvas: [-1:1] x [-1:1]\n\n  \/\/ create outer points\n  const deque<Point> outerPoints = rotatePoint(Point(0, -1), points);\n\n  \/\/ create inner points\n  const double angle = m::two_pi \/ points;\n  deque<Point> innerPoints(outerPoints);\n  transform(innerPoints, rotate(angle \/ 2) * scale(innerRadius, innerRadius));\n\n  \/\/ merge them together\n  deque<Point> pathPoints;\n  assert(outerPoints.size() == innerPoints.size());\n  for (deque<Point>::const_iterator itO = outerPoints.begin(), itI = innerPoints.begin();\n       (itO != outerPoints.end()) && (itI != innerPoints.end());\n       ++itO, ++itI)\n  {\n    pathPoints.push_back(*itO);\n    pathPoints.push_back(*itI);\n  }\n\n  \/\/ create the path\n  transform(pathPoints, translate(1, 1) * scale(0.5, 0.5) * scale(size.width, size.height));\n  const KEYPathPtr_t path = makePolyLine(pathPoints);\n\n  return path;\n}\n\nKEYPathPtr_t makeConnectionPath(const KEYSize &size, const double middleX, const double middleY)\n{\n  \/\/ TODO: implement me\n  (void) size;\n  (void) middleX;\n  (void) middleY;\n  return KEYPathPtr_t();\n}\n\nKEYPathPtr_t makeCalloutPath(const KEYSize &size, const double radius, const double tailSize, const double tailX, const double tailY)\n{\n  \/\/ TODO: implement me\n  (void) size;\n  (void) radius;\n  (void) tailSize;\n  (void) tailX;\n  (void) tailY;\n  return KEYPathPtr_t();\n}\n\nKEYPathPtr_t makeQuoteBubblePath(const KEYSize &size, const double radius, const double tailSize, const double tailX, const double tailY)\n{\n  \/\/ TODO: implement me\n  (void) size;\n  (void) radius;\n  (void) tailSize;\n  (void) tailX;\n  (void) tailY;\n  return KEYPathPtr_t();\n}\n\n}\n\n\/* vim:set shiftwidth=2 softtabstop=2 expandtab: *\/\n<commit_msg>fix drawing of arrow<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 <algorithm>\n#include <cmath>\n#include <deque>\n\n#include <boost\/math\/constants\/constants.hpp>\n\n#include <libetonyek\/KEYPresentationInterface.h>\n\n#include \"KEYOutput.h\"\n#include \"KEYPath.h\"\n#include \"KEYShape.h\"\n#include \"KEYText.h\"\n#include \"KEYTransformation.h\"\n#include \"KEYTypes.h\"\n\nnamespace m = boost::math::double_constants;\n\nusing std::deque;\n\nnamespace libetonyek\n{\n\nKEYShape::KEYShape()\n  : geometry()\n  , style()\n  , path()\n  , text()\n{\n}\n\nnamespace\n{\n\nclass ShapeObject : public KEYObject\n{\npublic:\n  ShapeObject(const KEYShapePtr_t &shape);\n  virtual ~ShapeObject();\n\nprivate:\n  virtual void draw(const KEYOutput &output);\n\nprivate:\n  const KEYShapePtr_t m_shape;\n};\n\nShapeObject::ShapeObject(const KEYShapePtr_t &shape)\n  : m_shape(shape)\n{\n}\n\nShapeObject::~ShapeObject()\n{\n}\n\nvoid ShapeObject::draw(const KEYOutput &output)\n{\n  if (bool(m_shape) && bool(m_shape->path))\n  {\n    \/\/ TODO: make style\n\n    const KEYTransformation tr = bool(m_shape->geometry) ? makeTransformation(*m_shape->geometry) : KEYTransformation();\n    KEYOutput newOutput(output, tr, m_shape->style);\n    const KEYPath path = *m_shape->path * newOutput.getTransformation();\n\n    KEYPresentationInterface *const painter = output.getPainter();\n\n    painter->setStyle(WPXPropertyList(), WPXPropertyListVector());\n    painter->drawPath(path.toWPG());\n\n    if (bool(m_shape->text))\n      makeObject(m_shape->text)->draw(newOutput);\n  }\n}\n\n}\n\nKEYObjectPtr_t makeObject(const KEYShapePtr_t &shape)\n{\n  const KEYObjectPtr_t object(new ShapeObject(shape));\n  return object;\n}\n\nnamespace\n{\n\nstruct Point\n{\n  double x;\n  double y;\n\n  Point();\n  Point(double x_, double y_);\n};\n\nPoint::Point()\n  : x(0)\n  , y(0)\n{\n}\n\nPoint::Point(const double x_, const double y_)\n  : x(x_)\n  , y(y_)\n{\n}\n\nbool approxEqual(const Point &left, const Point &right, const double eps = KEY_EPSILON)\n{\n  using libetonyek::approxEqual;\n  return approxEqual(left.x, right.x, eps) && approxEqual(left.y, right.y, eps);\n}\n\nbool operator==(const Point &left, const Point &right)\n{\n  return approxEqual(left, right);\n}\n\nbool operator!=(const Point &left, const Point &right)\n{\n  return !(left == right);\n}\n\n}\n\nnamespace\n{\n\nusing namespace transformations;\n\ndeque<Point> rotatePoint(const Point &point, const unsigned n)\n{\n  deque<Point> points;\n\n\n  const double angle = m::two_pi \/ n;\n\n  points.push_back(point);\n  for (unsigned i = 1; i < n; ++i)\n  {\n    Point pt(point);\n    const KEYTransformation rot(rotate(i * angle));\n    rot(pt.x, pt.y);\n    points.push_back(pt);\n  }\n\n  return points;\n}\n\ndeque<Point> drawArrowHalf(const double headWidth, const double stemThickness)\n{\n  \/\/ user space canvas: [0:1] x [0:1]\n\n  deque<Point> points;\n  points.push_back(Point(0, stemThickness));\n  points.push_back(Point(1 - headWidth, stemThickness));\n  points.push_back(Point(1 - headWidth, 1));\n  points.push_back(Point(1, 0));\n\n  return points;\n}\n\nKEYPathPtr_t makePolyLine(const deque<Point> inputPoints, bool close = true)\n{\n  KEYPathPtr_t path;\n\n  \/\/ need at least 2 points to make a polyline\n  if (inputPoints.size() < 2)\n    return path;\n\n  \/\/ remove multiple points\n  deque<Point> points;\n  std::unique_copy(inputPoints.begin(), inputPoints.end(), back_inserter(points));\n\n  \/\/ close path if the first and last points are equal\n  if (points.front() == points.back())\n  {\n    points.pop_back();\n    close = true;\n  }\n\n  \/\/ ... but there must be at least 3 points to make a closed path\n  if (points.size() < 3)\n    close = false;\n\n  \/\/ need at least 2 points to make a polyline\n  if (points.size() < 2)\n    return path;\n\n  path.reset(new KEYPath());\n\n  deque<Point>::const_iterator it = points.begin();\n  path->appendMoveTo(it->x, it->y);\n  ++it;\n  for (; it != points.end(); ++it)\n    path->appendLineTo(it->x, it->y);\n\n  if (close)\n    path->appendClose();\n\n  return path;\n}\n\nstruct TransformPoint\n{\n  TransformPoint(const KEYTransformation &tr)\n    : m_tr(tr)\n  {\n  }\n\n  void operator()(Point &point) const\n  {\n    m_tr(point.x, point.y);\n  }\n\nprivate:\n  const KEYTransformation &m_tr;\n};\n\nvoid transform(deque<Point> &points, const KEYTransformation &tr)\n{\n  for_each(points.begin(), points.end(), TransformPoint(tr));\n}\n\n}\n\nKEYPathPtr_t makePolygonPath(const KEYSize &size, const unsigned edges)\n{\n  \/\/ user space canvas: [-1:1] x [-1:1]\n\n  deque<Point> points = rotatePoint(Point(0, -1), edges);\n\n  \/\/ FIXME: the shape should probably be scaled to whole width\/height.\n  \/\/ Check.\n  transform(points, translate(1, 1) * scale(0.5, 0.5) * scale(size.width, size.height));\n  const KEYPathPtr_t path = makePolyLine(points);\n\n  return path;\n}\n\nKEYPathPtr_t makeRoundedRectanglePath(const KEYSize &size, const double radius)\n{\n  \/\/ TODO: implement me\n  (void) size;\n  (void) radius;\n  return KEYPathPtr_t();\n}\n\nKEYPathPtr_t makeArrowPath(const KEYSize &size, const double headWidth, const double stemThickness)\n{\n  deque<Point> points = drawArrowHalf(headWidth \/ size.width, 1 - 2 * stemThickness);\n\n  \/\/ mirror around the x axis\n  deque<Point> mirroredPoints = points;\n  transform(mirroredPoints, flip(false, true));\n\n  \/\/ join the two point sets\n  copy(mirroredPoints.rbegin(), mirroredPoints.rend(), back_inserter(points));\n\n  \/\/ transform and create path\n  transform(points, translate(0, 1) * scale(1, 0.5) * scale(size.width, size.height));\n  const KEYPathPtr_t path = makePolyLine(points);\n  return path;\n}\n\nKEYPathPtr_t makeDoubleArrowPath(const KEYSize &size, const double headWidth, const double stemThickness)\n{\n  deque<Point> points = drawArrowHalf(2 * headWidth \/ size.width, 1 - 2 * stemThickness);\n\n  {\n    \/\/ mirror around the y axis\n    deque<Point> mirroredPoints = points;\n    transform(mirroredPoints, flip(true, false));\n\n    copy(mirroredPoints.begin(), mirroredPoints.end(), front_inserter(points));\n  }\n\n  {\n    \/\/ mirror around the x axis\n    deque<Point> mirroredPoints = points;\n    transform(mirroredPoints, flip(false, true));\n\n    copy(mirroredPoints.rbegin(), mirroredPoints.rend(), back_inserter(points));\n  }\n\n  transform(points, translate(1, 1) * scale(0.5, 0.5) * scale(size.width, size.height));\n  const KEYPathPtr_t path = makePolyLine(points);\n  return path;\n}\n\nKEYPathPtr_t makeStarPath(const KEYSize &size, const unsigned points, const double innerRadius)\n{\n  \/\/ user space canvas: [-1:1] x [-1:1]\n\n  \/\/ create outer points\n  const deque<Point> outerPoints = rotatePoint(Point(0, -1), points);\n\n  \/\/ create inner points\n  const double angle = m::two_pi \/ points;\n  deque<Point> innerPoints(outerPoints);\n  transform(innerPoints, rotate(angle \/ 2) * scale(innerRadius, innerRadius));\n\n  \/\/ merge them together\n  deque<Point> pathPoints;\n  assert(outerPoints.size() == innerPoints.size());\n  for (deque<Point>::const_iterator itO = outerPoints.begin(), itI = innerPoints.begin();\n       (itO != outerPoints.end()) && (itI != innerPoints.end());\n       ++itO, ++itI)\n  {\n    pathPoints.push_back(*itO);\n    pathPoints.push_back(*itI);\n  }\n\n  \/\/ create the path\n  transform(pathPoints, translate(1, 1) * scale(0.5, 0.5) * scale(size.width, size.height));\n  const KEYPathPtr_t path = makePolyLine(pathPoints);\n\n  return path;\n}\n\nKEYPathPtr_t makeConnectionPath(const KEYSize &size, const double middleX, const double middleY)\n{\n  \/\/ TODO: implement me\n  (void) size;\n  (void) middleX;\n  (void) middleY;\n  return KEYPathPtr_t();\n}\n\nKEYPathPtr_t makeCalloutPath(const KEYSize &size, const double radius, const double tailSize, const double tailX, const double tailY)\n{\n  \/\/ TODO: implement me\n  (void) size;\n  (void) radius;\n  (void) tailSize;\n  (void) tailX;\n  (void) tailY;\n  return KEYPathPtr_t();\n}\n\nKEYPathPtr_t makeQuoteBubblePath(const KEYSize &size, const double radius, const double tailSize, const double tailX, const double tailY)\n{\n  \/\/ TODO: implement me\n  (void) size;\n  (void) radius;\n  (void) tailSize;\n  (void) tailX;\n  (void) tailY;\n  return KEYPathPtr_t();\n}\n\n}\n\n\/* vim:set shiftwidth=2 softtabstop=2 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*************************************************************************\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: IBM Corporation\n *\n *  Copyright: 2008 by IBM Corporation\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef TOCREAD_H\n#define TOCREAD_H\nnamespace OpenStormBento\n{\n\nclass CBenTOCReader\n{\npublic: \/\/ Methods\n    CBenTOCReader(pLtcBenContainer pContainer)\n      { cpContainer = pContainer; cpTOC = NULL; cCurr = 0; }\n    ~CBenTOCReader() { delete cpTOC; }\n    BenError ReadLabelAndTOC();\n\nprivate: \/\/ Methods\n    BenError ReadLabel(unsigned long * pTOCOffset, unsigned long * pTOCSize);\n    BenError SearchForLabel(BenByte * pLabel);\n    BenError ReadTOC();\n    BenError ReadSegments(pCBenValue pValue, BenByte * pLookAhead);\n    BenError ReadSegment(pCBenValue pValue, BenByte * pLookAhead);\n    UtBool CanGetData(unsigned long Amt);\n    BenError GetByte(BenByte * pByte);\n    BenError GetWord(BenWord * pWord);\n    BenError GetDWord(BenDWord * pDWord);\n    BenByte GetCode();\n    BenError GetData(BenDataPtr pBuffer, unsigned long Amt);\n\nprivate: \/\/ Data\n    pLtcBenContainer cpContainer;\n    BenByteDataPtr cpTOC;\n    unsigned long cBlockSize;\n    unsigned long cCurr;\n    unsigned long cTOCSize;\n};\n}\/\/end namespace OpenStormBento\n#endif\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>fix operator delete mismatch<commit_after>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*************************************************************************\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: IBM Corporation\n *\n *  Copyright: 2008 by IBM Corporation\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef TOCREAD_H\n#define TOCREAD_H\nnamespace OpenStormBento\n{\n\nclass CBenTOCReader\n{\npublic: \/\/ Methods\n    CBenTOCReader(pLtcBenContainer pContainer)\n      { cpContainer = pContainer; cpTOC = NULL; cCurr = 0; }\n    ~CBenTOCReader() { delete[] cpTOC; }\n    BenError ReadLabelAndTOC();\n\nprivate: \/\/ Methods\n    BenError ReadLabel(unsigned long * pTOCOffset, unsigned long * pTOCSize);\n    BenError SearchForLabel(BenByte * pLabel);\n    BenError ReadTOC();\n    BenError ReadSegments(pCBenValue pValue, BenByte * pLookAhead);\n    BenError ReadSegment(pCBenValue pValue, BenByte * pLookAhead);\n    UtBool CanGetData(unsigned long Amt);\n    BenError GetByte(BenByte * pByte);\n    BenError GetWord(BenWord * pWord);\n    BenError GetDWord(BenDWord * pDWord);\n    BenByte GetCode();\n    BenError GetData(BenDataPtr pBuffer, unsigned long Amt);\n\nprivate: \/\/ Data\n    pLtcBenContainer cpContainer;\n    BenByteDataPtr cpTOC;\n    unsigned long cBlockSize;\n    unsigned long cCurr;\n    unsigned long cTOCSize;\n};\n}\/\/end namespace OpenStormBento\n#endif\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/ TODO(pbos): Remove this file when it's no longer built in Chromium.\n<commit_msg>Remove webrtcvideoengine.cc.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: detailpages.hxx,v $\n *\n *  $Revision: 1.24 $\n *\n *  last change: $Author: hr $ $Date: 2006-06-20 03:06: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 _DBAUI_DETAILPAGES_HXX_\n#define _DBAUI_DETAILPAGES_HXX_\n\n#ifndef _DBAUI_ADMINPAGES_HXX_\n#include \"adminpages.hxx\"\n#endif\n#ifndef _DBAUI_CHARSETS_HXX_\n#include \"charsets.hxx\"\n#endif\n#ifndef _SV_FIELD_HXX\n#include <vcl\/field.hxx>\n#endif\n#ifndef _SV_FIXED_HXX\n#include <vcl\/fixed.hxx>\n#endif\n#ifndef _SV_LSTBOX_HXX\n#include <vcl\/lstbox.hxx>\n#endif\n#ifndef _SV_EDIT_HXX\n#include <vcl\/edit.hxx>\n#endif\n#ifndef _SV_BUTTON_HXX\n#include <vcl\/button.hxx>\n#endif\n#ifndef DBAUI_TEXTCONNECTIONHELPER_HXX\n#include \"TextConnectionHelper.hxx\"\n#endif\n\n\n\/\/.........................................................................\nnamespace dbaui\n{\n\/\/.........................................................................\n    \/\/=========================================================================\n    \/\/= OCommonBehaviourTabPage\n    \/\/=========================================================================\n    #define     CBTP_NONE                           0x00000000\n    #define     CBTP_USE_APPENDTABLEALIAS           0x00000001\n    #define     CBTP_USE_CHARSET                    0x00000002\n    #define     CBTP_USE_OPTIONS                    0x00000004\n    #define     CBTP_USE_SQL92CHECK                 0x00000010\n    #define     CBTP_USE_AUTOINCREMENT              0x00000020\n    #define     CBTP_USE_PARAMETERNAMESUBST         0x00000040\n    #define     CBTP_USE_IGNOREDRIVER_PRIV          0x00000100\n    #define     CBTP_USE_SUPPRESS_VERSION_COLUMN    0x00000200\n    #define     CBTP_USE_BOOLEANCOMPARISON          0x00000400\n    #define     CBTP_USE_ENABLEOUTERJOIN            0x00001000\n    #define     CBTP_USE_CATALOG                    0x00002000\n    #define     CBTP_USE_SCHEMA                     0x00004000\n    #define     CBTP_USE_INDEXAPPENDIX              0x00010000\n    #define     CBTP_USE_DOSLINEENDS                0x00020000\n\n    \/** eases the implementation of tab pages handling user\/password and\/or character\n        set and\/or generic options input\n        <BR>\n        The controls to be used habe to be defined within the resource, as usual, but\n        this class does all the handling necessary.\n    *\/\n    class OCommonBehaviourTabPage : public OGenericAdministrationPage\n    {\n    protected:\n\n        FixedText*          m_pOptionsLabel;\n        Edit*               m_pOptions;\n\n        FixedLine*          m_pDataConvertFixedLine;\n        FixedText*          m_pCharsetLabel;\n        ListBox*            m_pCharset;\n\n        FixedLine*          m_pDSFixedLine;\n        CheckBox*           m_pIsSQL92Check;\n        CheckBox*           m_pAppendTableAlias;\n        CheckBox*           m_pParameterSubstitution;\n        CheckBox*           m_pIgnoreDriverPrivileges;\n        CheckBox*           m_pSuppressVersionColumn;\n        CheckBox*           m_pEnableOuterJoin;\n        CheckBox*           m_pCatalog;\n        CheckBox*           m_pSchema;\n        CheckBox*           m_pIndexAppendix;\n        CheckBox*           m_pDosLineEnds;\n\n        FixedText*          m_pBooleanComprisonModeLabel;\n        ListBox*            m_pBooleanComprisonMode;\n\n        FixedLine*          m_pAutoFixedLine;\n        CheckBox*           m_pAutoRetrievingEnabled;\n        FixedText*          m_pAutoIncrementLabel;\n        Edit*               m_pAutoIncrement;\n        FixedText*          m_pAutoRetrievingLabel;\n        Edit*               m_pAutoRetrieving;\n\n        OCharsetDisplay     m_aCharsets;\n\n        sal_uInt32          m_nControlFlags;\n\n        DECL_LINK( OnCheckBoxClick, CheckBox * );\n\n    public:\n        virtual BOOL        FillItemSet (SfxItemSet& _rCoreAttrs);\n\n        OCommonBehaviourTabPage(Window* pParent, USHORT nResId, const SfxItemSet& _rCoreAttrs, sal_uInt32 nControlFlags,bool _bFreeResource = true);\n    protected:\n\n            \/\/ nControlFlags ist eine Kombination der CBTP_xxx-Konstanten\n        virtual ~OCommonBehaviourTabPage();\n\n        \/\/ must be overloaded by subclasses, but it isn't pure virtual\n        virtual void        implInitControls(const SfxItemSet& _rSet, sal_Bool _bSaveValue);\n\n        \/\/ <method>OGenericAdministrationPage::fillControls<\/method>\n        virtual void fillControls(::std::vector< ISaveValueWrapper* >& _rControlList);\n\n        \/\/ <method>OGenericAdministrationPage::fillWindows<\/method>\n        virtual void fillWindows(::std::vector< ISaveValueWrapper* >& _rControlList);\n    private:\n        \/\/\/ creates the fixed line before the autoincrement controls\n        void createBehaviourFixedLine();\n    };\n\n    \/\/========================================================================\n    \/\/= ODbaseDetailsPage\n    \/\/========================================================================\n    class ODbaseDetailsPage : public OCommonBehaviourTabPage\n    {\n    public:\n        virtual BOOL        FillItemSet ( SfxItemSet& _rCoreAttrs );\n\n        ODbaseDetailsPage(Window* pParent, const SfxItemSet& _rCoreAttrs);\n    private:\n        \/\/ please add new controls also to <method>fillControls<\/method> or <method>fillWindows<\/method>\n        CheckBox            m_aShowDeleted;\n        FixedLine           m_aFL_1;\n        FixedText           m_aFT_Message;\n        PushButton          m_aIndexes;\n\n        String              m_sDsn;\n\n    protected:\n\n        virtual ~ODbaseDetailsPage();\n\n    protected:\n        virtual void implInitControls(const SfxItemSet& _rSet, sal_Bool _bSaveValue);\n        virtual void fillControls(::std::vector< ISaveValueWrapper* >& _rControlList);\n        virtual void fillWindows(::std::vector< ISaveValueWrapper* >& _rControlList);\n\n    private:\n        DECL_LINK( OnButtonClicked, Button * );\n    };\n\n    \/\/========================================================================\n    \/\/= OAdoDetailsPage\n    \/\/========================================================================\n    class OAdoDetailsPage : public OCommonBehaviourTabPage\n    {\n    protected:\n        virtual ~OAdoDetailsPage();\n    public:\n\n        OAdoDetailsPage( Window* pParent, const SfxItemSet& _rCoreAttrs );\n    };\n\n    \/\/========================================================================\n    \/\/= OOdbcDetailsPage\n    \/\/========================================================================\n    class OOdbcDetailsPage : public OCommonBehaviourTabPage\n    {\n    public:\n        virtual BOOL        FillItemSet ( SfxItemSet& _rCoreAttrs );\n\n        OOdbcDetailsPage( Window* pParent, const SfxItemSet& _rCoreAttrs );\n    protected:\n        virtual void implInitControls(const SfxItemSet& _rSet, sal_Bool _bSaveValue);\n        virtual void fillControls(::std::vector< ISaveValueWrapper* >& _rControlList);\n        virtual void fillWindows(::std::vector< ISaveValueWrapper* >& _rControlList);\n    private:\n        FixedLine           m_aFL_1;\n        CheckBox            m_aUseCatalog;\n    };\n\n\n    \/\/========================================================================\n    \/\/= OUserDriverDetailsPage\n    \/\/========================================================================\n    class OUserDriverDetailsPage : public OCommonBehaviourTabPage\n    {\n    public:\n        virtual BOOL        FillItemSet ( SfxItemSet& _rCoreAttrs );\n\n        OUserDriverDetailsPage( Window* pParent, const SfxItemSet& _rCoreAttrs );\n    protected:\n        virtual void implInitControls(const SfxItemSet& _rSet, sal_Bool _bSaveValue);\n        virtual void fillControls(::std::vector< ISaveValueWrapper* >& _rControlList);\n        virtual void fillWindows(::std::vector< ISaveValueWrapper* >& _rControlList);\n    private:\n        FixedText           m_aFTHostname;\n        Edit                m_aEDHostname;\n        FixedText           m_aPortNumber;\n        NumericField        m_aNFPortNumber;\n        FixedLine           m_aSeparator2;\n        CheckBox            m_aUseCatalog;\n    };\n\n    \/\/========================================================================\n    \/\/= OMySQLODBCDetailsPage\n    \/\/========================================================================\n    class OMySQLODBCDetailsPage : public OCommonBehaviourTabPage\n    {\n    public:\n        OMySQLODBCDetailsPage( Window* pParent, const SfxItemSet& _rCoreAttrs );\n    };\n\n    \/\/========================================================================\n    \/\/= OGeneralSpecialJDBCDetailsPage\n    \/\/========================================================================\n    class OGeneralSpecialJDBCDetailsPage : public OCommonBehaviourTabPage\n    {\n    public:\n        OGeneralSpecialJDBCDetailsPage(   Window* pParent\n                                        , USHORT _nResId\n                                        , const SfxItemSet& _rCoreAttrs\n                                        , USHORT _nPortId\n                                        , const char* _pDriverName);\n\n    protected:\n\n\n        virtual BOOL FillItemSet( SfxItemSet& _rCoreAttrs );\n        virtual void implInitControls(const SfxItemSet& _rSet, sal_Bool _bSaveValue);\n        virtual void fillControls(::std::vector< ISaveValueWrapper* >& _rControlList);\n        virtual void fillWindows(::std::vector< ISaveValueWrapper* >& _rControlList);\n\n        DECL_LINK(OnTestJavaClickHdl,PushButton*);\n        DECL_LINK(OnEditModified,Edit*);\n\n        FixedLine           m_aFL_1;\n        FixedText           m_aFTHostname;\n        Edit                m_aEDHostname;\n        FixedText           m_aPortNumber;\n        NumericField        m_aNFPortNumber;\n\n        FixedText           m_aFTDriverClass;\n        Edit                m_aEDDriverClass;\n        PushButton          m_aTestJavaDriver;\n\n        String              m_sDefaultJdbcDriverName;\n        USHORT              m_nPortId;\n    };\n\n    \/\/========================================================================\n    \/\/= OAdabasDetailsPage\n    \/\/========================================================================\n    class OAdabasDetailsPage : public OCommonBehaviourTabPage\n    {\n    public:\n        virtual BOOL        FillItemSet (SfxItemSet& _rCoreAttrs);\n\n        OAdabasDetailsPage( Window* pParent, const SfxItemSet& _rCoreAttrs );\n    protected:\n        virtual void implInitControls(const SfxItemSet& _rSet, sal_Bool _bSaveValue);\n        virtual void fillControls(::std::vector< ISaveValueWrapper* >& _rControlList);\n        virtual void fillWindows(::std::vector< ISaveValueWrapper* >& _rControlList);\n\n    private:\n        FixedText           m_aFTHostname;\n        Edit                m_aEDHostname;\n        FixedLine           m_aFL_1;\n        FixedText           m_FT_CACHE_SIZE;\n        NumericField        m_NF_CACHE_SIZE;\n\n        FixedText           m_FT_DATA_INCREMENT;\n        NumericField        m_NF_DATA_INCREMENT;\n\n        FixedLine           m_aFL_2;\n        FixedText           m_FT_CTRLUSERNAME;\n        Edit                m_ET_CTRLUSERNAME;\n        FixedText           m_FT_CTRLPASSWORD;\n        Edit                m_ET_CTRLPASSWORD;\n\n        CheckBox            m_CB_SHUTDB;\n        PushButton          m_PB_STAT;\n        String              m_sUser;\n        BOOL                bAttrsChanged;\n\n        DECL_LINK( AttributesChangedHdl,    void * );\n        DECL_LINK( UserSettingsHdl,         void * );\n        DECL_LINK( LoseFocusHdl,            Edit * );\n        DECL_LINK( PBClickHdl,              Button *);\n    };\n\n    \/\/========================================================================\n    \/\/= OOdbcDetailsPage\n    \/\/========================================================================\n    class OLDAPDetailsPage : public OCommonBehaviourTabPage\n    {\n    public:\n        virtual BOOL        FillItemSet ( SfxItemSet& _rCoreAttrs );\n\n        OLDAPDetailsPage( Window* pParent, const SfxItemSet& _rCoreAttrs );\n    protected:\n        virtual void implInitControls(const SfxItemSet& _rSet, sal_Bool _bSaveValue);\n        virtual void fillControls(::std::vector< ISaveValueWrapper* >& _rControlList);\n        virtual void fillWindows(::std::vector< ISaveValueWrapper* >& _rControlList);\n    private:\n        FixedLine           m_aFL_1;\n        FixedText           m_aBaseDN;\n        Edit                m_aETBaseDN;\n        CheckBox            m_aCBUseSSL;\n        FixedText           m_aPortNumber;\n        NumericField        m_aNFPortNumber;\n        FixedText           m_aFTRowCount;\n        NumericField        m_aNFRowCount;\n\n        sal_Int32           m_iSSLPort;\n        sal_Int32           m_iNormalPort;\n        DECL_LINK( OnCheckBoxClick, CheckBox * );\n    };\n\n    \/\/========================================================================\n    \/\/= OMozillaDetailsPage Detail page for Mozilla and Thunderbird addressbook\n    \/\/========================================================================\n    class OMozillaDetailsPage : public OCommonBehaviourTabPage\n    {\n    protected:\n        virtual ~OMozillaDetailsPage();\n    public:\n\n        OMozillaDetailsPage( Window* pParent, const SfxItemSet& _rCoreAttrs );\n    };\n\n    \/\/========================================================================\n    \/\/= OTextDetailsPage\n    \/\/========================================================================\n    class OTextDetailsPage : public OCommonBehaviourTabPage\n    {\n    public:\n        virtual BOOL        FillItemSet ( SfxItemSet& _rCoreAttrs );\n\n        OTextDetailsPage( Window* pParent, const SfxItemSet& _rCoreAttrs );\n        OTextConnectionHelper*  m_pTextConnectionHelper;\n\n    private:\n\n        String      m_aFieldSeparatorList;\n        String      m_aTextSeparatorList;\n        String      m_aTextNone;\n    protected:\n        virtual ~OTextDetailsPage();\n        virtual sal_Bool checkItems();\n\n        virtual void implInitControls(const SfxItemSet& _rSet, sal_Bool _bSaveValue);\n        virtual void fillControls(::std::vector< ISaveValueWrapper* >& _rControlList);\n        virtual void fillWindows(::std::vector< ISaveValueWrapper* >& _rControlList);\n\n    private:\n    };\n\n\/\/.........................................................................\n}   \/\/ namespace dbaui\n\/\/.........................................................................\n\n#endif \/\/ _DBAUI_DETAILPAGES_HXX_\n<commit_msg>INTEGRATION: CWS dba22ui (1.24.72); FILE MERGED 2006\/12\/05 15:50:15 fs 1.24.72.2: copying the fix for #i72252# from CWS dba22b to dba22ui - intended for the latter, but wrongly checked in into the former 2006\/12\/05 09:47:55 fs 1.24.72.1: copying the fix for #i72252# from CWS dba22b to dba22ui - intended for the latter, but wrongly checked in into the former<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: detailpages.hxx,v $\n *\n *  $Revision: 1.25 $\n *\n *  last change: $Author: kz $ $Date: 2006-12-13 16:50: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 _DBAUI_DETAILPAGES_HXX_\n#define _DBAUI_DETAILPAGES_HXX_\n\n#ifndef _DBAUI_ADMINPAGES_HXX_\n#include \"adminpages.hxx\"\n#endif\n#ifndef _DBAUI_CHARSETS_HXX_\n#include \"charsets.hxx\"\n#endif\n#ifndef _SV_FIELD_HXX\n#include <vcl\/field.hxx>\n#endif\n#ifndef _SV_FIXED_HXX\n#include <vcl\/fixed.hxx>\n#endif\n#ifndef _SV_LSTBOX_HXX\n#include <vcl\/lstbox.hxx>\n#endif\n#ifndef _SV_EDIT_HXX\n#include <vcl\/edit.hxx>\n#endif\n#ifndef _SV_BUTTON_HXX\n#include <vcl\/button.hxx>\n#endif\n#ifndef DBAUI_TEXTCONNECTIONHELPER_HXX\n#include \"TextConnectionHelper.hxx\"\n#endif\n\n#include <svtools\/dialogcontrolling.hxx>\n\n\n\/\/.........................................................................\nnamespace dbaui\n{\n\/\/.........................................................................\n    \/\/=========================================================================\n    \/\/= OCommonBehaviourTabPage\n    \/\/=========================================================================\n    #define     CBTP_NONE                           0x00000000\n    #define     CBTP_USE_APPENDTABLEALIAS           0x00000001\n    #define     CBTP_USE_CHARSET                    0x00000002\n    #define     CBTP_USE_OPTIONS                    0x00000004\n    #define     CBTP_USE_SQL92CHECK                 0x00000010\n    #define     CBTP_USE_AUTOINCREMENT              0x00000020\n    #define     CBTP_USE_PARAMETERNAMESUBST         0x00000040\n    #define     CBTP_USE_IGNOREDRIVER_PRIV          0x00000100\n    #define     CBTP_USE_SUPPRESS_VERSION_COLUMN    0x00000200\n    #define     CBTP_USE_BOOLEANCOMPARISON          0x00000400\n    #define     CBTP_USE_ENABLEOUTERJOIN            0x00001000\n    #define     CBTP_USE_CATALOG                    0x00002000\n    #define     CBTP_USE_SCHEMA                     0x00004000\n    #define     CBTP_USE_INDEXAPPENDIX              0x00010000\n    #define     CBTP_USE_DOSLINEENDS                0x00020000\n    #define     CBTP_AS_BEFORE_CORRELATION_NAME     0x00040000\n\n    \/** eases the implementation of tab pages handling user\/password and\/or character\n        set and\/or generic options input\n        <BR>\n        The controls to be used habe to be defined within the resource, as usual, but\n        this class does all the handling necessary.\n    *\/\n    class OCommonBehaviourTabPage : public OGenericAdministrationPage\n    {\n    protected:\n\n        FixedText*          m_pOptionsLabel;\n        Edit*               m_pOptions;\n\n        FixedLine*          m_pDataConvertFixedLine;\n        FixedText*          m_pCharsetLabel;\n        ListBox*            m_pCharset;\n\n        FixedLine*          m_pDSFixedLine;\n        CheckBox*           m_pIsSQL92Check;\n        CheckBox*           m_pAppendTableAlias;\n        CheckBox*           m_pAsBeforeCorrelationName;\n        CheckBox*           m_pParameterSubstitution;\n        CheckBox*           m_pIgnoreDriverPrivileges;\n        CheckBox*           m_pSuppressVersionColumn;\n        CheckBox*           m_pEnableOuterJoin;\n        CheckBox*           m_pCatalog;\n        CheckBox*           m_pSchema;\n        CheckBox*           m_pIndexAppendix;\n        CheckBox*           m_pDosLineEnds;\n\n        FixedText*          m_pBooleanComprisonModeLabel;\n        ListBox*            m_pBooleanComprisonMode;\n\n        FixedLine*          m_pAutoFixedLine;\n        CheckBox*           m_pAutoRetrievingEnabled;\n        FixedText*          m_pAutoIncrementLabel;\n        Edit*               m_pAutoIncrement;\n        FixedText*          m_pAutoRetrievingLabel;\n        Edit*               m_pAutoRetrieving;\n\n        OCharsetDisplay     m_aCharsets;\n\n        sal_uInt32          m_nControlFlags;\n        ::svt::ControlDependencyManager\n                            m_aControlDependencies;\n\n        DECL_LINK( OnCheckBoxClick, CheckBox * );\n\n    public:\n        virtual BOOL        FillItemSet (SfxItemSet& _rCoreAttrs);\n\n        OCommonBehaviourTabPage(Window* pParent, USHORT nResId, const SfxItemSet& _rCoreAttrs, sal_uInt32 nControlFlags,bool _bFreeResource = true);\n    protected:\n\n            \/\/ nControlFlags ist eine Kombination der CBTP_xxx-Konstanten\n        virtual ~OCommonBehaviourTabPage();\n\n        \/\/ must be overloaded by subclasses, but it isn't pure virtual\n        virtual void        implInitControls(const SfxItemSet& _rSet, sal_Bool _bSaveValue);\n\n        \/\/ <method>OGenericAdministrationPage::fillControls<\/method>\n        virtual void fillControls(::std::vector< ISaveValueWrapper* >& _rControlList);\n\n        \/\/ <method>OGenericAdministrationPage::fillWindows<\/method>\n        virtual void fillWindows(::std::vector< ISaveValueWrapper* >& _rControlList);\n    private:\n        \/\/\/ creates the fixed line before the autoincrement controls\n        void createBehaviourFixedLine();\n    };\n\n    \/\/========================================================================\n    \/\/= ODbaseDetailsPage\n    \/\/========================================================================\n    class ODbaseDetailsPage : public OCommonBehaviourTabPage\n    {\n    public:\n        virtual BOOL        FillItemSet ( SfxItemSet& _rCoreAttrs );\n\n        ODbaseDetailsPage(Window* pParent, const SfxItemSet& _rCoreAttrs);\n    private:\n        \/\/ please add new controls also to <method>fillControls<\/method> or <method>fillWindows<\/method>\n        CheckBox            m_aShowDeleted;\n        FixedLine           m_aFL_1;\n        FixedText           m_aFT_Message;\n        PushButton          m_aIndexes;\n\n        String              m_sDsn;\n\n    protected:\n\n        virtual ~ODbaseDetailsPage();\n\n    protected:\n        virtual void implInitControls(const SfxItemSet& _rSet, sal_Bool _bSaveValue);\n        virtual void fillControls(::std::vector< ISaveValueWrapper* >& _rControlList);\n        virtual void fillWindows(::std::vector< ISaveValueWrapper* >& _rControlList);\n\n    private:\n        DECL_LINK( OnButtonClicked, Button * );\n    };\n\n    \/\/========================================================================\n    \/\/= OAdoDetailsPage\n    \/\/========================================================================\n    class OAdoDetailsPage : public OCommonBehaviourTabPage\n    {\n    protected:\n        virtual ~OAdoDetailsPage();\n    public:\n\n        OAdoDetailsPage( Window* pParent, const SfxItemSet& _rCoreAttrs );\n    };\n\n    \/\/========================================================================\n    \/\/= OOdbcDetailsPage\n    \/\/========================================================================\n    class OOdbcDetailsPage : public OCommonBehaviourTabPage\n    {\n    public:\n        virtual BOOL        FillItemSet ( SfxItemSet& _rCoreAttrs );\n\n        OOdbcDetailsPage( Window* pParent, const SfxItemSet& _rCoreAttrs );\n    protected:\n        virtual void implInitControls(const SfxItemSet& _rSet, sal_Bool _bSaveValue);\n        virtual void fillControls(::std::vector< ISaveValueWrapper* >& _rControlList);\n        virtual void fillWindows(::std::vector< ISaveValueWrapper* >& _rControlList);\n    private:\n        FixedLine           m_aFL_1;\n        CheckBox            m_aUseCatalog;\n    };\n\n\n    \/\/========================================================================\n    \/\/= OUserDriverDetailsPage\n    \/\/========================================================================\n    class OUserDriverDetailsPage : public OCommonBehaviourTabPage\n    {\n    public:\n        virtual BOOL        FillItemSet ( SfxItemSet& _rCoreAttrs );\n\n        OUserDriverDetailsPage( Window* pParent, const SfxItemSet& _rCoreAttrs );\n    protected:\n        virtual void implInitControls(const SfxItemSet& _rSet, sal_Bool _bSaveValue);\n        virtual void fillControls(::std::vector< ISaveValueWrapper* >& _rControlList);\n        virtual void fillWindows(::std::vector< ISaveValueWrapper* >& _rControlList);\n    private:\n        FixedText           m_aFTHostname;\n        Edit                m_aEDHostname;\n        FixedText           m_aPortNumber;\n        NumericField        m_aNFPortNumber;\n        FixedLine           m_aSeparator2;\n        CheckBox            m_aUseCatalog;\n    };\n\n    \/\/========================================================================\n    \/\/= OMySQLODBCDetailsPage\n    \/\/========================================================================\n    class OMySQLODBCDetailsPage : public OCommonBehaviourTabPage\n    {\n    public:\n        OMySQLODBCDetailsPage( Window* pParent, const SfxItemSet& _rCoreAttrs );\n    };\n\n    \/\/========================================================================\n    \/\/= OGeneralSpecialJDBCDetailsPage\n    \/\/========================================================================\n    class OGeneralSpecialJDBCDetailsPage : public OCommonBehaviourTabPage\n    {\n    public:\n        OGeneralSpecialJDBCDetailsPage(   Window* pParent\n                                        , USHORT _nResId\n                                        , const SfxItemSet& _rCoreAttrs\n                                        , USHORT _nPortId\n                                        , const char* _pDriverName);\n\n    protected:\n\n\n        virtual BOOL FillItemSet( SfxItemSet& _rCoreAttrs );\n        virtual void implInitControls(const SfxItemSet& _rSet, sal_Bool _bSaveValue);\n        virtual void fillControls(::std::vector< ISaveValueWrapper* >& _rControlList);\n        virtual void fillWindows(::std::vector< ISaveValueWrapper* >& _rControlList);\n\n        DECL_LINK(OnTestJavaClickHdl,PushButton*);\n        DECL_LINK(OnEditModified,Edit*);\n\n        FixedLine           m_aFL_1;\n        FixedText           m_aFTHostname;\n        Edit                m_aEDHostname;\n        FixedText           m_aPortNumber;\n        NumericField        m_aNFPortNumber;\n\n        FixedText           m_aFTDriverClass;\n        Edit                m_aEDDriverClass;\n        PushButton          m_aTestJavaDriver;\n\n        String              m_sDefaultJdbcDriverName;\n        USHORT              m_nPortId;\n    };\n\n    \/\/========================================================================\n    \/\/= OAdabasDetailsPage\n    \/\/========================================================================\n    class OAdabasDetailsPage : public OCommonBehaviourTabPage\n    {\n    public:\n        virtual BOOL        FillItemSet (SfxItemSet& _rCoreAttrs);\n\n        OAdabasDetailsPage( Window* pParent, const SfxItemSet& _rCoreAttrs );\n    protected:\n        virtual void implInitControls(const SfxItemSet& _rSet, sal_Bool _bSaveValue);\n        virtual void fillControls(::std::vector< ISaveValueWrapper* >& _rControlList);\n        virtual void fillWindows(::std::vector< ISaveValueWrapper* >& _rControlList);\n\n    private:\n        FixedText           m_aFTHostname;\n        Edit                m_aEDHostname;\n        FixedLine           m_aFL_1;\n        FixedText           m_FT_CACHE_SIZE;\n        NumericField        m_NF_CACHE_SIZE;\n\n        FixedText           m_FT_DATA_INCREMENT;\n        NumericField        m_NF_DATA_INCREMENT;\n\n        FixedLine           m_aFL_2;\n        FixedText           m_FT_CTRLUSERNAME;\n        Edit                m_ET_CTRLUSERNAME;\n        FixedText           m_FT_CTRLPASSWORD;\n        Edit                m_ET_CTRLPASSWORD;\n\n        CheckBox            m_CB_SHUTDB;\n        PushButton          m_PB_STAT;\n        String              m_sUser;\n        BOOL                bAttrsChanged;\n\n        DECL_LINK( AttributesChangedHdl,    void * );\n        DECL_LINK( UserSettingsHdl,         void * );\n        DECL_LINK( LoseFocusHdl,            Edit * );\n        DECL_LINK( PBClickHdl,              Button *);\n    };\n\n    \/\/========================================================================\n    \/\/= OOdbcDetailsPage\n    \/\/========================================================================\n    class OLDAPDetailsPage : public OCommonBehaviourTabPage\n    {\n    public:\n        virtual BOOL        FillItemSet ( SfxItemSet& _rCoreAttrs );\n\n        OLDAPDetailsPage( Window* pParent, const SfxItemSet& _rCoreAttrs );\n    protected:\n        virtual void implInitControls(const SfxItemSet& _rSet, sal_Bool _bSaveValue);\n        virtual void fillControls(::std::vector< ISaveValueWrapper* >& _rControlList);\n        virtual void fillWindows(::std::vector< ISaveValueWrapper* >& _rControlList);\n    private:\n        FixedLine           m_aFL_1;\n        FixedText           m_aBaseDN;\n        Edit                m_aETBaseDN;\n        CheckBox            m_aCBUseSSL;\n        FixedText           m_aPortNumber;\n        NumericField        m_aNFPortNumber;\n        FixedText           m_aFTRowCount;\n        NumericField        m_aNFRowCount;\n\n        sal_Int32           m_iSSLPort;\n        sal_Int32           m_iNormalPort;\n        DECL_LINK( OnCheckBoxClick, CheckBox * );\n    };\n\n    \/\/========================================================================\n    \/\/= OMozillaDetailsPage Detail page for Mozilla and Thunderbird addressbook\n    \/\/========================================================================\n    class OMozillaDetailsPage : public OCommonBehaviourTabPage\n    {\n    protected:\n        virtual ~OMozillaDetailsPage();\n    public:\n\n        OMozillaDetailsPage( Window* pParent, const SfxItemSet& _rCoreAttrs );\n    };\n\n    \/\/========================================================================\n    \/\/= OTextDetailsPage\n    \/\/========================================================================\n    class OTextDetailsPage : public OCommonBehaviourTabPage\n    {\n    public:\n        virtual BOOL        FillItemSet ( SfxItemSet& _rCoreAttrs );\n\n        OTextDetailsPage( Window* pParent, const SfxItemSet& _rCoreAttrs );\n        OTextConnectionHelper*  m_pTextConnectionHelper;\n\n    private:\n\n        String      m_aFieldSeparatorList;\n        String      m_aTextSeparatorList;\n        String      m_aTextNone;\n    protected:\n        virtual ~OTextDetailsPage();\n        virtual sal_Bool checkItems();\n\n        virtual void implInitControls(const SfxItemSet& _rSet, sal_Bool _bSaveValue);\n        virtual void fillControls(::std::vector< ISaveValueWrapper* >& _rControlList);\n        virtual void fillWindows(::std::vector< ISaveValueWrapper* >& _rControlList);\n\n    private:\n    };\n\n\/\/.........................................................................\n}   \/\/ namespace dbaui\n\/\/.........................................................................\n\n#endif \/\/ _DBAUI_DETAILPAGES_HXX_\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: TokenWriter.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: oj $ $Date: 2001-02-28 10:10:01 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the License); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an AS IS basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef DBAUI_TOKENWRITER_HXX\n#define DBAUI_TOKENWRITER_HXX\n\n#ifndef DBAUI_DATABASEEXPORT_HXX\n#include \"DExport.hxx\"\n#endif\n#ifndef _STREAM_HXX \/\/autogen\n#include <tools\/stream.hxx>\n#endif\n#ifndef _COM_SUN_STAR_AWT_FONTDESCRIPTOR_HPP_\n#include <com\/sun\/star\/awt\/FontDescriptor.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XRESULTSET_HPP_\n#include <com\/sun\/star\/sdbc\/XResultSet.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_LANG_XMULTISERVICEFACTORY_HPP_\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XEVENTLISTENER_HPP_\n#include <com\/sun\/star\/lang\/XEventListener.hpp>\n#endif\n#ifndef _CPPUHELPER_IMPLBASE1_HXX_\n#include <cppuhelper\/implbase1.hxx>\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_SDB_COMMANDTYPE_HPP_\n#include <com\/sun\/star\/sdb\/CommandType.hpp>\n#endif\n\nnamespace dbaui\n{\n    \/\/ =========================================================================\n    \/\/ ODatabaseImportExport Basisklasse f\"ur Import\/Export\n    \/\/ =========================================================================\n    class ODatabaseExport;\n    class ODatabaseImportExport : public ::cppu::WeakImplHelper1< ::com::sun::star::lang::XEventListener>\n    {\n        void initialize();\n        void disposing();\n    protected:\n        SvStream*                               m_pStream;\n        ::com::sun::star::awt::FontDescriptor   m_aFont;\n        ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >       m_xObject;      \/\/ table\/query\n        ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection >         m_xConnection;  \/\/\n        ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XResultSet >          m_xResultSet;   \/\/\n        ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XRow >                m_xRow; \/\/\n        ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XResultSetMetaData >  m_xResultSetMetaData;   \/\/\n        ::com::sun::star::uno::Reference< ::com::sun::star::util::XNumberFormatter >    m_xFormatter;   \/\/ a number formatter working with the connection's NumberFormatsSupplier\n        ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory> m_xFactory;\n\n        ::rtl::OUString m_sName;\n        ::rtl::OUString m_sDataSourceName;\n        sal_Int32       m_nCommandType;\n        sal_Bool        m_bDisposeConnection;\n\n#if defined UNX || defined MAC\n        static const char __FAR_DATA sNewLine;\n#else\n        static const char __FAR_DATA sNewLine[];\n#endif\n        ODatabaseExport*    m_pReader;\n        sal_Int32*          m_pRowMarker; \/\/ wenn gesetzt, dann nur diese Rows kopieren\n\n        \/\/ export data\n        ODatabaseImportExport(  const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& _aSeq,\n                                const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rM,\n                                const ::com::sun::star::uno::Reference< ::com::sun::star::util::XNumberFormatter >& _rxNumberF,\n                                const String& rExchange = String());\n\n        \/\/ import data\n        ODatabaseImportExport(  const ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection >& _rxConnection,\n                                const ::com::sun::star::uno::Reference< ::com::sun::star::util::XNumberFormatter >& _rxNumberF,\n                                const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rM)\n                                :m_xConnection(_rxConnection)\n        ,m_pReader(NULL)\n        ,m_pRowMarker(NULL)\n        ,m_xFormatter(_rxNumberF)\n        ,m_xFactory(_rM)\n        ,m_nCommandType(::com::sun::star::sdb::CommandType::TABLE)\n        ,m_bDisposeConnection(sal_False)\n        {}\n\n        virtual ~ODatabaseImportExport();\n    public:\n        void setStream(SvStream* _pStream){  m_pStream = _pStream; }\n\n        virtual BOOL Write()    = 0; \/\/ Export\n        virtual BOOL Read()     = 0; \/\/ Import\n\n        virtual void SAL_CALL disposing( const ::com::sun::star::lang::EventObject& Source ) throw(::com::sun::star::uno::RuntimeException);\n    };\n\n    \/\/ =========================================================================\n    \/\/ RTF Im- und Export\n    \/\/ =========================================================================\n\n    class ORTFImportExport : public ODatabaseImportExport\n    {\n\n    public:\n        \/\/ export data\n        ORTFImportExport(   const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& _aSeq,\n                            const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rM,\n                            const ::com::sun::star::uno::Reference< ::com::sun::star::util::XNumberFormatter >& _rxNumberF,\n                            const String& rExchange = String())\n                            : ODatabaseImportExport(_aSeq,_rM,_rxNumberF,rExchange) {};\n\n        \/\/ import data\n        ORTFImportExport(   const ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection >& _rxConnection,\n                            const ::com::sun::star::uno::Reference< ::com::sun::star::util::XNumberFormatter >& _rxNumberF,\n                            const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rM)\n                        : ODatabaseImportExport(_rxConnection,_rxNumberF,_rM)\n        {}\n\n        virtual BOOL Write();\n        virtual BOOL Read();\n    };\n    \/\/ =========================================================================\n    \/\/ HTML Im- und Export\n    \/\/ =========================================================================\n    #define SBA_HTML_FONTSIZES 7\n    const sal_Int16 nIndentMax = 23;\n    class OHTMLImportExport : public ODatabaseImportExport\n    {\n        \/\/ default HtmlFontSz[1-7]\n        static const sal_Int16  nDefaultFontSize[SBA_HTML_FONTSIZES];\n        \/\/ HtmlFontSz[1-7] in s*3.ini [user]\n        static sal_Int16        nFontSize[SBA_HTML_FONTSIZES];\n        static const sal_Int16  nCellSpacing;\n        static const char __FAR_DATA sIndentSource[];\n        char                    sIndent[nIndentMax+1];\n        sal_Int16               m_nIndent;\n    #if DBG_UTIL\n        BOOL                    m_bCheckFont;\n    #endif\n\n        void WriteHeader();\n        void WriteBody();\n        void WriteTables();\n        void WriteCell( sal_Int32 nFormat,sal_Int32 nWidthPixel,sal_Int32 nHeightPixel,const char* pChar,const String& rValue,const char* pHtmlTag);\n        void IncIndent( sal_Int16 nVal );\n        const char*         GetIndentStr() { return sIndent; }\n        void FontOn();\n        inline void FontOff();\n\n    public:\n        \/\/ export data\n        OHTMLImportExport(  const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& _aSeq,\n                            const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rM,\n                            const ::com::sun::star::uno::Reference< ::com::sun::star::util::XNumberFormatter >& _rxNumberF,\n                            const String& rExchange = String());\n        \/\/ import data\n        OHTMLImportExport(  const ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection >& _rxConnection,\n                            const ::com::sun::star::uno::Reference< ::com::sun::star::util::XNumberFormatter >& _rxNumberF,\n                            const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rM)\n                        : ODatabaseImportExport(_rxConnection,_rxNumberF,_rM)\n        {}\n\n        virtual BOOL Write();\n        virtual BOOL Read();\n\n    };\n\n}\n#endif \/\/ DBAUI_TOKENWRITER_HXX\n\n\n\n<commit_msg>make initialize public<commit_after>\/*************************************************************************\n *\n *  $RCSfile: TokenWriter.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: oj $ $Date: 2001-03-27 06:57:57 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the License); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an AS IS basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef DBAUI_TOKENWRITER_HXX\n#define DBAUI_TOKENWRITER_HXX\n\n#ifndef DBAUI_DATABASEEXPORT_HXX\n#include \"DExport.hxx\"\n#endif\n#ifndef _STREAM_HXX \/\/autogen\n#include <tools\/stream.hxx>\n#endif\n#ifndef _COM_SUN_STAR_AWT_FONTDESCRIPTOR_HPP_\n#include <com\/sun\/star\/awt\/FontDescriptor.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XRESULTSET_HPP_\n#include <com\/sun\/star\/sdbc\/XResultSet.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_LANG_XMULTISERVICEFACTORY_HPP_\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XEVENTLISTENER_HPP_\n#include <com\/sun\/star\/lang\/XEventListener.hpp>\n#endif\n#ifndef _CPPUHELPER_IMPLBASE1_HXX_\n#include <cppuhelper\/implbase1.hxx>\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_SDB_COMMANDTYPE_HPP_\n#include <com\/sun\/star\/sdb\/CommandType.hpp>\n#endif\n\nnamespace dbaui\n{\n    \/\/ =========================================================================\n    \/\/ ODatabaseImportExport Basisklasse f\"ur Import\/Export\n    \/\/ =========================================================================\n    class ODatabaseExport;\n    class ODatabaseImportExport : public ::cppu::WeakImplHelper1< ::com::sun::star::lang::XEventListener>\n    {\n        void disposing();\n    protected:\n        SvStream*                               m_pStream;\n        ::com::sun::star::awt::FontDescriptor   m_aFont;\n        ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >       m_xObject;      \/\/ table\/query\n        ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection >         m_xConnection;  \/\/\n        ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XResultSet >          m_xResultSet;   \/\/\n        ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XRow >                m_xRow; \/\/\n        ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XResultSetMetaData >  m_xResultSetMetaData;   \/\/\n        ::com::sun::star::uno::Reference< ::com::sun::star::util::XNumberFormatter >    m_xFormatter;   \/\/ a number formatter working with the connection's NumberFormatsSupplier\n        ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory> m_xFactory;\n\n        ::rtl::OUString m_sName;\n        ::rtl::OUString m_sDataSourceName;\n        sal_Int32       m_nCommandType;\n        sal_Bool        m_bDisposeConnection;\n\n#if defined UNX || defined MAC\n        static const char __FAR_DATA sNewLine;\n#else\n        static const char __FAR_DATA sNewLine[];\n#endif\n        ODatabaseExport*    m_pReader;\n        sal_Int32*          m_pRowMarker; \/\/ wenn gesetzt, dann nur diese Rows kopieren\n\n        \/\/ export data\n        ODatabaseImportExport(  const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& _aSeq,\n                                const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rM,\n                                const ::com::sun::star::uno::Reference< ::com::sun::star::util::XNumberFormatter >& _rxNumberF,\n                                const String& rExchange = String());\n\n        \/\/ import data\n        ODatabaseImportExport(  const ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection >& _rxConnection,\n                                const ::com::sun::star::uno::Reference< ::com::sun::star::util::XNumberFormatter >& _rxNumberF,\n                                const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rM)\n                                :m_xConnection(_rxConnection)\n        ,m_pReader(NULL)\n        ,m_pRowMarker(NULL)\n        ,m_xFormatter(_rxNumberF)\n        ,m_xFactory(_rM)\n        ,m_nCommandType(::com::sun::star::sdb::CommandType::TABLE)\n        ,m_bDisposeConnection(sal_False)\n        {}\n\n        virtual ~ODatabaseImportExport();\n    public:\n        void setStream(SvStream* _pStream){  m_pStream = _pStream; }\n\n        virtual BOOL Write()    = 0; \/\/ Export\n        virtual BOOL Read()     = 0; \/\/ Import\n\n        void initialize();;\n        virtual void SAL_CALL disposing( const ::com::sun::star::lang::EventObject& Source ) throw(::com::sun::star::uno::RuntimeException);\n    };\n\n    \/\/ =========================================================================\n    \/\/ RTF Im- und Export\n    \/\/ =========================================================================\n\n    class ORTFImportExport : public ODatabaseImportExport\n    {\n\n    public:\n        \/\/ export data\n        ORTFImportExport(   const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& _aSeq,\n                            const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rM,\n                            const ::com::sun::star::uno::Reference< ::com::sun::star::util::XNumberFormatter >& _rxNumberF,\n                            const String& rExchange = String())\n                            : ODatabaseImportExport(_aSeq,_rM,_rxNumberF,rExchange) {};\n\n        \/\/ import data\n        ORTFImportExport(   const ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection >& _rxConnection,\n                            const ::com::sun::star::uno::Reference< ::com::sun::star::util::XNumberFormatter >& _rxNumberF,\n                            const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rM)\n                        : ODatabaseImportExport(_rxConnection,_rxNumberF,_rM)\n        {}\n\n        virtual BOOL Write();\n        virtual BOOL Read();\n    };\n    \/\/ =========================================================================\n    \/\/ HTML Im- und Export\n    \/\/ =========================================================================\n    #define SBA_HTML_FONTSIZES 7\n    const sal_Int16 nIndentMax = 23;\n    class OHTMLImportExport : public ODatabaseImportExport\n    {\n        \/\/ default HtmlFontSz[1-7]\n        static const sal_Int16  nDefaultFontSize[SBA_HTML_FONTSIZES];\n        \/\/ HtmlFontSz[1-7] in s*3.ini [user]\n        static sal_Int16        nFontSize[SBA_HTML_FONTSIZES];\n        static const sal_Int16  nCellSpacing;\n        static const char __FAR_DATA sIndentSource[];\n        char                    sIndent[nIndentMax+1];\n        sal_Int16               m_nIndent;\n    #if DBG_UTIL\n        BOOL                    m_bCheckFont;\n    #endif\n\n        void WriteHeader();\n        void WriteBody();\n        void WriteTables();\n        void WriteCell( sal_Int32 nFormat,sal_Int32 nWidthPixel,sal_Int32 nHeightPixel,const char* pChar,const String& rValue,const char* pHtmlTag);\n        void IncIndent( sal_Int16 nVal );\n        const char*         GetIndentStr() { return sIndent; }\n        void FontOn();\n        inline void FontOff();\n\n    public:\n        \/\/ export data\n        OHTMLImportExport(  const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& _aSeq,\n                            const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rM,\n                            const ::com::sun::star::uno::Reference< ::com::sun::star::util::XNumberFormatter >& _rxNumberF,\n                            const String& rExchange = String());\n        \/\/ import data\n        OHTMLImportExport(  const ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection >& _rxConnection,\n                            const ::com::sun::star::uno::Reference< ::com::sun::star::util::XNumberFormatter >& _rxNumberF,\n                            const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rM)\n                        : ODatabaseImportExport(_rxConnection,_rxNumberF,_rM)\n        {}\n\n        virtual BOOL Write();\n        virtual BOOL Read();\n\n    };\n\n}\n#endif \/\/ DBAUI_TOKENWRITER_HXX\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/* $Id$Revision: *\/\n\/* vim:set shiftwidth=4 ts=8: *\/\n\n\/*************************************************************************\n * Copyright (c) 2011 AT&T Intellectual Property\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: See CVS logs. Details at http:\/\/www.graphviz.org\/\n *************************************************************************\/\n\n\n#ifdef WIN32_DLL\n#include \"windows.h\"\n#endif\n#include <QApplication>\n#include \"mainwindow.h\"\n\n#ifdef HAVE_GETOPT_H\n#include <getopt.h>\n#else\n#include \"compat_getopt.h\"\n#endif\n\n\n#ifdef WIN32_DLL\n__declspec(dllimport) boolean MemTest;\n\/*gvc.lib cgraph.lib*\/\n#ifdef WITH_CGRAPH\n    #pragma comment( lib, \"cgraph.lib\" )\n#else\n    #pragma comment( lib, \"graph.lib\" )\n    #pragma comment( lib, \"ingraphs.lib\" )\n\n#endif\n    #pragma comment( lib, \"gvc.lib\" )\n#endif\n\nstatic char* cmd;\n\nint Verbose;\n\nstatic char *useString =\n    \"Usage: gvedit [-v?] <files>\\n\\\n  -v - verbose\\n\\\n  -? - print usage\\n\";\n\nstatic void usage(int v)\n{\n    printf(useString);\n    exit(v);\n}\n\nstatic char **parseArgs(int argc, char *argv[])\n{\n    int c;\n\n    cmd = argv[0];\n    while ((c = getopt(argc, argv, \":v?\")) != -1) {\n\tswitch (c) {\n\tcase 'v':\n\t    Verbose = 1;\n\t    break;\n\tcase '?':\n\t    if (optopt == '?')\n\t\tusage(0);\n\t    else\n\t\tfprintf(stderr,\n\t\t\t\"%s : option -%c unrecognized - ignored\\n\",\n\t\t\tcmd, optopt);\n\t    break;\n\t}\n    }\n\n    argv += optind;\n    argc -= optind;\n\n    if (argc)\n\treturn argv;\n    else\n\treturn NULL;\n}\n\nint main(int argc, char *argv[])\n{\n\n    Q_INIT_RESOURCE(mdi);\n\n    QApplication app(argc, argv);\n    char** files = parseArgs (argc, argv);\n    CMainWindow mainWin;\n    if (files)\n\twhile (*files) {\n\t    mainWin.addFile (QString(*files));\n\t    files++;\n\t}\n    mainWin.show();\n    return app.exec();\n}\n<commit_msg>Use config.h<commit_after>\/* $Id$Revision: *\/\n\/* vim:set shiftwidth=4 ts=8: *\/\n\n\/*************************************************************************\n * Copyright (c) 2011 AT&T Intellectual Property\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: See CVS logs. Details at http:\/\/www.graphviz.org\/\n *************************************************************************\/\n\n#ifdef HAVE_CONFIG_H\n#include \"config.h\"\n#endif\n\n#ifdef WIN32_DLL\n#include \"windows.h\"\n#endif\n#include <QApplication>\n#include \"mainwindow.h\"\n\n#ifdef HAVE_GETOPT_H\n#include <getopt.h>\n#else\n#include \"compat_getopt.h\"\n#endif\n\n\n#ifdef WIN32_DLL\n__declspec(dllimport) boolean MemTest;\n\/*gvc.lib cgraph.lib*\/\n#ifdef WITH_CGRAPH\n    #pragma comment( lib, \"cgraph.lib\" )\n#else\n    #pragma comment( lib, \"graph.lib\" )\n    #pragma comment( lib, \"ingraphs.lib\" )\n\n#endif\n    #pragma comment( lib, \"gvc.lib\" )\n#endif\n\nstatic char* cmd;\n\nint Verbose;\n\nstatic char *useString =\n    \"Usage: gvedit [-v?] <files>\\n\\\n  -v - verbose\\n\\\n  -? - print usage\\n\";\n\nstatic void usage(int v)\n{\n    printf(useString);\n    exit(v);\n}\n\nstatic char **parseArgs(int argc, char *argv[])\n{\n    int c;\n\n    cmd = argv[0];\n    while ((c = getopt(argc, argv, \":v?\")) != -1) {\n\tswitch (c) {\n\tcase 'v':\n\t    Verbose = 1;\n\t    break;\n\tcase '?':\n\t    if (optopt == '?')\n\t\tusage(0);\n\t    else\n\t\tfprintf(stderr,\n\t\t\t\"%s : option -%c unrecognized - ignored\\n\",\n\t\t\tcmd, optopt);\n\t    break;\n\t}\n    }\n\n    argv += optind;\n    argc -= optind;\n\n    if (argc)\n\treturn argv;\n    else\n\treturn NULL;\n}\n\nint main(int argc, char *argv[])\n{\n\n    Q_INIT_RESOURCE(mdi);\n\n    QApplication app(argc, argv);\n    char** files = parseArgs (argc, argv);\n    CMainWindow mainWin;\n    if (files)\n\twhile (*files) {\n\t    mainWin.addFile (QString(*files));\n\t    files++;\n\t}\n    mainWin.show();\n    return app.exec();\n}\n<|endoftext|>"}
{"text":"<commit_before>#define BOOST_TEST_MODULE tcp_resolver\n\n#include <iostream>\n#include <string>\n#include <atomic>\n\n#include <nx\/unit_test.hpp>\n\n#include <nx\/nx.hpp>\n#include <nx\/resolver.hpp>\n\nBOOST_AUTO_TEST_CASE(tcp_resolver)\n{\n    using namespace nx::tags;\n\n    nx::timer deadline;\n    nx::cond_var cv;\n\n    deadline(5) = [&](nx::timer& t) {\n        t.stop();\n        cv.notify();\n    };\n\n    deadline.start();\n\n    std::atomic_bool got_new_connection{ false };\n\n    nx::serve<nx::tcp>(\n        nx::make_endpoint(\"127.0.0.1\", 54321),\n        [&](nx::tcp& t) {\n            got_new_connection = true;\n            t.stop();\n        },\n        [&](nx::tcp& t) {}\n    );\n\n    std::atomic_bool connected{ false };\n    std::atomic_bool disconnected{ false };\n\n    auto& c = nx::connect<nx::tcp>(\n        \"localhost\", \"54321\",\n        [&](nx::tcp& t) {\n            connected = true;\n\n            t[on_close] = [&](nx::tcp& t) {\n                disconnected = true;\n                deadline.stop();\n                cv.notify();\n            };\n        }\n    );\n\n    cv.wait();\n\n    auto ep = nx::resolve_endpoint(\"localhost\", 80);\n    BOOST_CHECK_EQUAL(ep, nx::make_endpoint(\"::1\", 80));\n\n    nx::stop();\n\n    BOOST_CHECK_MESSAGE(got_new_connection, \"server got a connection\");\n    BOOST_CHECK_MESSAGE(connected, \"client connected to server\");\n    BOOST_CHECK_MESSAGE(disconnected, \"client was disconnected\");\n}\n<commit_msg>feat: improve UT<commit_after>#define BOOST_TEST_MODULE tcp_resolver\n\n#include <iostream>\n#include <string>\n#include <atomic>\n\n#include <nx\/unit_test.hpp>\n\n#include <nx\/nx.hpp>\n#include <nx\/resolver.hpp>\n\nBOOST_AUTO_TEST_CASE(tcp_resolver)\n{\n    using namespace nx::tags;\n\n    nx::timer deadline;\n    nx::cond_var cv;\n\n    deadline(5) = [&](nx::timer& t) {\n        t.stop();\n        cv.notify();\n    };\n\n    deadline.start();\n\n    std::atomic_bool got_new_connection{ false };\n\n    nx::serve<nx::tcp>(\n        nx::make_endpoint(\"127.0.0.1\", 54321),\n        [&](nx::tcp& t) {\n            got_new_connection = true;\n            t.stop();\n        },\n        [&](nx::tcp& t) {}\n    );\n\n    std::atomic_bool connected{ false };\n    std::atomic_bool disconnected{ false };\n\n    auto& c = nx::connect<nx::tcp>(\n        \"localhost\", \"54321\",\n        [&](nx::tcp& t) {\n            connected = true;\n\n            t[on_close] = [&](nx::tcp& t) {\n                disconnected = true;\n                deadline.stop();\n                cv.notify();\n            };\n        }\n    );\n\n    cv.wait();\n\n    auto ep = nx::resolve_endpoint(\"localhost\", 80);\n    BOOST_CHECK_EQUAL(ep, nx::make_endpoint(\"::1\", 80));\n\n    auto ep2 = nx::resolve_endpoint(\"127.0.0.1\", 80);\n    BOOST_CHECK_EQUAL(ep2, nx::make_endpoint(\"127.0.0.1\", 80));\n\n    nx::stop();\n\n    BOOST_CHECK_MESSAGE(got_new_connection, \"server got a connection\");\n    BOOST_CHECK_MESSAGE(connected, \"client connected to server\");\n    BOOST_CHECK_MESSAGE(disconnected, \"client was disconnected\");\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Software License Agreement (BSD License)\n *\n *  Copyright (c) 2010, Willow Garage, Inc.\n *  All rights reserved.\n *\n *  Redistribution and use in source and binary forms, with or without\n *  modification, are permitted provided that the following conditions\n *  are met:\n *\n *   * Redistributions of source code must retain the above copyright\n *     notice, this list of conditions and the following disclaimer.\n *   * Redistributions in binary form must reproduce the above\n *     copyright notice, this list of conditions and the following\n *     disclaimer in the documentation and\/or other materials provided\n *     with the distribution.\n *   * Neither the name of Willow Garage, Inc. nor the names of its\n *     contributors may be used to endorse or promote products derived\n *     from this software without specific prior written permission.\n *\n *  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n *  \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n *  LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n *  FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n *  COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n *  INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n *  BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n *  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n *  CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n *  LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n *  ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n *  POSSIBILITY OF SUCH DAMAGE.\n *\n * $Id$\n *\n *\/\n\n#ifndef PCL_PCL_HISTOGRAM_VISUALIZER_IMPL_H_\n#define PCL_PCL_HISTOGRAM_VISUALIZER_IMPL_H_\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> bool\npcl::visualization::PCLHistogramVisualizer::addFeatureHistogram (\n    const pcl::PointCloud<PointT> &cloud, int hsize, \n    const std::string &id, int win_width, int win_height)\n{\n  RenWinInteractMap::iterator am_it = wins_.find (id);\n  if (am_it != wins_.end ())\n  {\n    PCL_WARN (\"[addFeatureHistogram] A window with id <%s> already exists! Please choose a different id and retry.\\n\", id.c_str ());\n    return (false);\n  }\n\n  vtkSmartPointer<vtkDoubleArray> xy_array = vtkSmartPointer<vtkDoubleArray>::New ();\n  xy_array->SetNumberOfComponents (2);\n  xy_array->SetNumberOfTuples (hsize);\n\n  \/\/ Parse the cloud data and store it in the array\n  double xy[2];\n  for (int d = 0; d < hsize; ++d)\n  {\n    xy[0] = d;\n    xy[1] = cloud.points[0].histogram[d];\n    xy_array->SetTuple (d, xy);\n  }\n  RenWinInteract renwinint;\n  createActor (xy_array, renwinint, id, win_width, win_height);\n\n  \/\/ Save the pointer\/ID pair to the global window map\n  wins_[id] = renwinint;\n\n  resetStoppedFlag ();\n  return (true);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> bool\npcl::visualization::PCLHistogramVisualizer::addFeatureHistogram (\n    const pcl::PointCloud<PointT> &cloud, \n    const std::string &field_name,\n    const int index, \n    const std::string &id, int win_width, int win_height)\n{\n  if (index < 0 || index >= cloud.points.size ())\n  {\n    PCL_ERROR (\"[addFeatureHistogram] Invalid point index (%d) given!\\n\", index);\n    return (false);\n  }\n\n  \/\/ Get the fields present in this cloud\n  std::vector<sensor_msgs::PointField> fields;\n  pcl::getFields (cloud, fields);\n  \/\/ Check if our field exists\n  int field_idx = pcl::getFieldIndex (cloud, field_name);\n  if (field_idx == -1)\n  {\n    PCL_ERROR (\"[addFeatureHistogram] The specified field <%s> does not exist!\\n\", field_name.c_str ());\n    return (false);\n  }\n\n  RenWinInteractMap::iterator am_it = wins_.find (id);\n  if (am_it != wins_.end ())\n  {\n    PCL_WARN (\"[addFeatureHistogram] A window with id <%s> already exists! Please choose a different id and retry.\\n\", id.c_str ());\n    return (false);\n  }\n\n  vtkSmartPointer<vtkDoubleArray> xy_array = vtkSmartPointer<vtkDoubleArray>::New ();\n  xy_array->SetNumberOfComponents (2);\n  xy_array->SetNumberOfTuples (fields[field_idx].count);\n\n  \/\/ Parse the cloud data and store it in the array\n  double xy[2];\n  for (int d = 0; d < fields[field_idx].count; ++d)\n  {\n    xy[0] = d;\n    \/\/xy[1] = cloud.points[index].histogram[d];\n    float data;\n    memcpy (&data, (const char*)&cloud.points[index] + fields[field_idx].offset + d * sizeof (float), sizeof (float));\n    xy[1] = data;\n    xy_array->SetTuple (d, xy);\n  }\n  RenWinInteract renwinint;\n  createActor (xy_array, renwinint, id, win_width, win_height);\n\n  \/\/ Save the pointer\/ID pair to the global window map\n  wins_[id] = renwinint;\n\n  resetStoppedFlag ();\n  return (true);\n}\n\n#endif\n\n<commit_msg>fixed compile error<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_PCL_HISTOGRAM_VISUALIZER_IMPL_H_\n#define PCL_PCL_HISTOGRAM_VISUALIZER_IMPL_H_\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> bool\npcl::visualization::PCLHistogramVisualizer::addFeatureHistogram (\n    const pcl::PointCloud<PointT> &cloud, int hsize, \n    const std::string &id, int win_width, int win_height)\n{\n  RenWinInteractMap::iterator am_it = wins_.find (id);\n  if (am_it != wins_.end ())\n  {\n    PCL_WARN (\"[addFeatureHistogram] A window with id <%s> already exists! Please choose a different id and retry.\\n\", id.c_str ());\n    return (false);\n  }\n\n  vtkSmartPointer<vtkDoubleArray> xy_array = vtkSmartPointer<vtkDoubleArray>::New ();\n  xy_array->SetNumberOfComponents (2);\n  xy_array->SetNumberOfTuples (hsize);\n\n  \/\/ Parse the cloud data and store it in the array\n  double xy[2];\n  for (int d = 0; d < hsize; ++d)\n  {\n    xy[0] = d;\n    xy[1] = cloud.points[0].histogram[d];\n    xy_array->SetTuple (d, xy);\n  }\n  RenWinInteract renwinint;\n  createActor (xy_array, renwinint, id, win_width, win_height);\n\n  \/\/ Save the pointer\/ID pair to the global window map\n  wins_[id] = renwinint;\n\n  resetStoppedFlag ();\n  return (true);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointT> bool\npcl::visualization::PCLHistogramVisualizer::addFeatureHistogram (\n    const pcl::PointCloud<PointT> &cloud, \n    const std::string &field_name,\n    const int index, \n    const std::string &id, int win_width, int win_height)\n{\n  if (index < 0 || index >= cloud.points.size ())\n  {\n    PCL_ERROR (\"[addFeatureHistogram] Invalid point index (%d) given!\\n\", index);\n    return (false);\n  }\n\n  \/\/ Get the fields present in this cloud\n  std::vector<sensor_msgs::PointField> fields;\n  \/\/ Check if our field exists\n  int field_idx = pcl::getFieldIndex<PointT> (cloud, field_name, fields);\n  if (field_idx == -1)\n  {\n    PCL_ERROR (\"[addFeatureHistogram] The specified field <%s> does not exist!\\n\", field_name.c_str ());\n    return (false);\n  }\n\n  RenWinInteractMap::iterator am_it = wins_.find (id);\n  if (am_it != wins_.end ())\n  {\n    PCL_WARN (\"[addFeatureHistogram] A window with id <%s> already exists! Please choose a different id and retry.\\n\", id.c_str ());\n    return (false);\n  }\n\n  vtkSmartPointer<vtkDoubleArray> xy_array = vtkSmartPointer<vtkDoubleArray>::New ();\n  xy_array->SetNumberOfComponents (2);\n  xy_array->SetNumberOfTuples (fields[field_idx].count);\n\n  \/\/ Parse the cloud data and store it in the array\n  double xy[2];\n  for (int d = 0; d < fields[field_idx].count; ++d)\n  {\n    xy[0] = d;\n    \/\/xy[1] = cloud.points[index].histogram[d];\n    float data;\n    memcpy (&data, (const char*)&cloud.points[index] + fields[field_idx].offset + d * sizeof (float), sizeof (float));\n    xy[1] = data;\n    xy_array->SetTuple (d, xy);\n  }\n  RenWinInteract renwinint;\n  createActor (xy_array, renwinint, id, win_width, win_height);\n\n  \/\/ Save the pointer\/ID pair to the global window map\n  wins_[id] = renwinint;\n\n  resetStoppedFlag ();\n  return (true);\n}\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\n\/*\n * CS252: Shell project\n *\n * Template file.\n * You will need to add more code here to execute the command table.\n *\n * NOTE: You are responsible for fixing any bugs this code may have!\n *\n *\/\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <string.h>\n#include <signal.h>\n\n#include \"command.h\"\n\nSimpleCommand::SimpleCommand()\n{\n\t\/\/ Creat available space for 5 arguments\n\t_numberOfAvailableArguments = 5;\n\t_numberOfArguments = 0;\n\t_arguments = (char **) malloc( _numberOfAvailableArguments * sizeof( char * ) );\n}\n\nvoid\nSimpleCommand::insertArgument( char * argument )\n{\n\tif ( _numberOfAvailableArguments == _numberOfArguments  + 1 ) {\n\t\t\/\/ Double the available space\n\t\t_numberOfAvailableArguments *= 2;\n\t\t_arguments = (char **) realloc( _arguments,\n\t\t\t\t  _numberOfAvailableArguments * sizeof( char * ) );\n\t}\n\t\n\t_arguments[ _numberOfArguments ] = argument;\n\n\t\/\/ Add NULL argument at the end\n\t_arguments[ _numberOfArguments + 1] = NULL;\n\t\n\t_numberOfArguments++;\n}\n\nCommand::Command()\n{\n\t\/\/ Create available space for one simple command\n\t_numberOfAvailableSimpleCommands = 1;\n\t_simpleCommands = (SimpleCommand **)\n\t\tmalloc( _numberOfAvailableSimpleCommands * sizeof( SimpleCommand * ) );\n\n\t_numberOfSimpleCommands = 0;\n\t_outFile = 0;\n\t_inputFile = 0;\n\t_errFile = 0;\n\t_background = 0;\n\t_append = false;\n}\n\nvoid\nCommand::insertSimpleCommand( SimpleCommand * simpleCommand )\n{\n\tif ( _numberOfAvailableSimpleCommands == _numberOfSimpleCommands ) {\n\t\t_numberOfAvailableSimpleCommands *= 2;\n\t\t_simpleCommands = (SimpleCommand **) realloc( _simpleCommands,\n\t\t\t _numberOfAvailableSimpleCommands * sizeof( SimpleCommand * ) );\n\t}\n\t\n\t_simpleCommands[ _numberOfSimpleCommands ] = simpleCommand;\n\t_numberOfSimpleCommands++;\n}\n\nvoid\nCommand:: clear()\n{\n\tfor ( int i = 0; i < _numberOfSimpleCommands; i++ ) {\n\t\tfor ( int j = 0; j < _simpleCommands[ i ]->_numberOfArguments; j ++ ) {\n\t\t\tfree ( _simpleCommands[ i ]->_arguments[ j ] );\n\t\t}\n\t\t\n\t\tfree ( _simpleCommands[ i ]->_arguments );\n\t\tdelete  _simpleCommands[ i ]; \/\/ This is a class, so we must delete it. Don't mix free\/delete.\n\t}\n\n\tif ( _outFile ) {\n\t\tfree( _outFile );\n\t}\n\n\tif ( _inputFile ) {\n\t\tfree( _inputFile );\n\t}\n\n\tif ( _errFile && _errFile != _outFile ) {\n\t\tfree( _errFile );\n\t}\n\n\t_numberOfSimpleCommands = 0;\n\t_outFile = 0;\n\t_inputFile = 0;\n\t_errFile = 0;\n\t_background = 0;\n}\n\nvoid\nCommand::print()\n{\n\tprintf(\"\\n\\n\");\n\tprintf(\"              COMMAND TABLE                \\n\");\n\tprintf(\"\\n\");\n\tprintf(\"  #   Simple Commands\\n\");\n\tprintf(\"  --- ----------------------------------------------------------\\n\");\n\t\n\tfor ( int i = 0; i < _numberOfSimpleCommands; i++ ) {\n\t\tprintf(\"  %-3d \", i );\n\t\tfor ( int j = 0; j < _simpleCommands[i]->_numberOfArguments; j++ ) {\n\t\t\tprintf(\"\\\"%s\\\" \\t\", _simpleCommands[i]->_arguments[ j ] );\n\t\t}\n\t}\n\n\tprintf( \"\\n\\n\" );\n\tprintf( \"  Output       Input        Error        Background\\n\" );\n\tprintf( \"  ------------ ------------ ------------ ------------\\n\" );\n\tprintf( \"  %-12s %-12s %-12s %-12s\\n\", _outFile?_outFile:\"default\",\n\t\t_inputFile?_inputFile:\"default\", _errFile?_errFile:\"default\",\n\t\t_background?\"YES\":\"NO\");\n\tprintf( \"\\n\\n\" );\n\t\n}\n\nvoid\nCommand::execute()\n{\n\t\/\/ Don't do anything if there are no simple commands\n\tif ( _numberOfSimpleCommands == 0 ) {\n\t\tprompt();\n\t\treturn;\n\t}\n\n\t\/\/ Print contents of Command data structure\n\tprint();\n\n\t\/\/ Add execution here\n\t\/\/ For every simple command fork a new process\n\t\/\/ Setup i\/o redirection\n\t\/\/ and call exec\n\n\t\/\/ Clear to prepare for next command\n\tclear();\n\t\n\t\/\/ Print new prompt\n\tprompt();\n}\n\n\/\/ Shell implementation\n\nvoid\nCommand::prompt()\n{\n\tprintf(\"myshell>\");\n\tfflush(stdout);\n}\n\nCommand Command::_currentCommand;\nSimpleCommand * Command::_currentSimpleCommand;\n\nint yyparse(void);\n\nint main(int argc, char **argv)\n{\n\tCommand::_currentCommand.prompt();\n\tyyparse();\n\n    return 0;\n}\n\n<commit_msg>Part1 done<commit_after>\n\/*\n * CS252: Shell project\n *\n * Template file.\n * You will need to add more code here to execute the command table.\n *\n * NOTE: You are responsible for fixing any bugs this code may have!\n *\n *\/\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <string.h>\n#include <signal.h>\n\n#include \"command.h\"\n\nSimpleCommand::SimpleCommand()\n{\n\t\/\/ Creat available space for 5 arguments\n\t_numberOfAvailableArguments = 5;\n\t_numberOfArguments = 0;\n\t_arguments = (char **) malloc( _numberOfAvailableArguments * sizeof( char * ) );\n}\n\nvoid\nSimpleCommand::insertArgument( char * argument )\n{\n\tif ( _numberOfAvailableArguments == _numberOfArguments  + 1 ) {\n\t\t\/\/ Double the available space\n\t\t_numberOfAvailableArguments *= 2;\n\t\t_arguments = (char **) realloc( _arguments,\n\t\t\t\t  _numberOfAvailableArguments * sizeof( char * ) );\n\t}\n\t\n\t_arguments[ _numberOfArguments ] = argument;\n\n\t\/\/ Add NULL argument at the end\n\t_arguments[ _numberOfArguments + 1] = NULL;\n\t\n\t_numberOfArguments++;\n}\n\nCommand::Command()\n{\n\t\/\/ Create available space for one simple command\n\t_numberOfAvailableSimpleCommands = 1;\n\t_simpleCommands = (SimpleCommand **)\n\t\tmalloc( _numberOfAvailableSimpleCommands * sizeof( SimpleCommand * ) );\n\n\t_numberOfSimpleCommands = 0;\n\t_outFile = 0;\n\t_inputFile = 0;\n\t_errFile = 0;\n\t_background = 0;\n\t_append = false;\n}\n\nvoid\nCommand::insertSimpleCommand( SimpleCommand * simpleCommand )\n{\n\tif ( _numberOfAvailableSimpleCommands == _numberOfSimpleCommands ) {\n\t\t_numberOfAvailableSimpleCommands *= 2;\n\t\t_simpleCommands = (SimpleCommand **) realloc( _simpleCommands,\n\t\t\t _numberOfAvailableSimpleCommands * sizeof( SimpleCommand * ) );\n\t}\n\t\n\t_simpleCommands[ _numberOfSimpleCommands ] = simpleCommand;\n\t_numberOfSimpleCommands++;\n}\n\nvoid\nCommand:: clear()\n{\n\tfor ( int i = 0; i < _numberOfSimpleCommands; i++ ) {\n\t\tfor ( int j = 0; j < _simpleCommands[ i ]->_numberOfArguments; j ++ ) {\n\t\t\tfree ( _simpleCommands[ i ]->_arguments[ j ] );\n\t\t}\n\t\t\n\t\tfree ( _simpleCommands[ i ]->_arguments );\n\t\tdelete  _simpleCommands[ i ]; \/\/ This is a class, so we must delete it. Don't mix free\/delete.\n\t}\n\n\tif ( _outFile ) {\n\t\tfree( _outFile );\n\t}\n\n\tif ( _inputFile ) {\n\t\tfree( _inputFile );\n\t}\n\n\tif ( _errFile && _errFile != _outFile ) {\n\t\tfree( _errFile );\n\t}\n\n\t_numberOfSimpleCommands = 0;\n\t_outFile = 0;\n\t_inputFile = 0;\n\t_errFile = 0;\n\t_background = 0;\n}\n\nvoid\nCommand::print()\n{\n\tprintf(\"\\n\\n\");\n\tprintf(\"              COMMAND TABLE                \\n\");\n\tprintf(\"\\n\");\n\tprintf(\"  #   Simple Commands\\n\");\n\tprintf(\"  --- ----------------------------------------------------------\\n\");\n\t\n\tfor ( int i = 0; i < _numberOfSimpleCommands; i++ ) {\n\t\tprintf(\"  %-3d \", i );\n\t\tfor ( int j = 0; j < _simpleCommands[i]->_numberOfArguments; j++ ) {\n\t\t\tprintf(\"\\\"%s\\\" \\t\", _simpleCommands[i]->_arguments[ j ] );\n\t\t}\n\t\tprintf(\"\\n\");\n\t}\n\n\tprintf( \"\\n\\n\" );\n\tprintf( \"  Output       Input        Error        Background\\n\" );\n\tprintf( \"  ------------ ------------ ------------ ------------\\n\" );\n\tprintf( \"  %-12s %-12s %-12s %-12s\\n\", _outFile?_outFile:\"default\",\n\t\t_inputFile?_inputFile:\"default\", _errFile?_errFile:\"default\",\n\t\t_background?\"YES\":\"NO\");\n\tprintf( \"\\n\\n\" );\n\t\n}\n\nvoid\nCommand::execute()\n{\n\t\/\/ Don't do anything if there are no simple commands\n\tif ( _numberOfSimpleCommands == 0 ) {\n\t\tprompt();\n\t\treturn;\n\t}\n\n\t\/\/ Print contents of Command data structure\n\tprint();\n\n\t\/\/ Add execution here\n\t\/\/ For every simple command fork a new process\n\t\/\/ Setup i\/o redirection\n\t\/\/ and call exec\n\n\t\/\/ Clear to prepare for next command\n\tclear();\n\t\n\t\/\/ Print new prompt\n\tprompt();\n}\n\n\/\/ Shell implementation\n\nvoid\nCommand::prompt()\n{\n\tprintf(\"myshell>\");\n\tfflush(stdout);\n}\n\nCommand Command::_currentCommand;\nSimpleCommand * Command::_currentSimpleCommand;\n\nint yyparse(void);\n\nint main(int argc, char **argv)\n{\n\tCommand::_currentCommand.prompt();\n\tyyparse();\n\n    return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\n#include <iostream>\n#include <vector>\n#include <iostream>\nusing std::vector;\nusing std::endl;\nusing std::cout;\n\n#include <opencv2\/core.hpp>\n#include <opencv2\/features2d.hpp>\nusing namespace cv;\n\n#include <rice\/Module.hpp>\nusing namespace Rice;\n\n#include \"dmatch.h\"\n\n#include <opencv_rice\/core\/keypoint.h>\n#include <opencv_rice\/calib3d\/reproj.h>\n\n\nnamespace CVRiceMatchers {\n  \n  using namespace CVRice;\n\n  Mat dmatches_to_mat( const DMatchVector dmatches, const KeyPointVector kps, int which )\n  {\n    if( (which != 0) and (which != 1) )\n      rb_raise( rb_eArgError, \"dmatches_to_mat takes 0 or 1\" );\n\n    Mat out( dmatches.size(), 2, CV_64F );\n    double *dbl = out.ptr<double>(0);\n    int count = 0;\n    for( DMatchVector::const_iterator itr = dmatches.begin(); itr != dmatches.end(); ++itr, count+=2 ) {\n      int idx = (which==0 ? (*itr).queryIdx : (*itr).trainIdx );\n\n      dbl[count]   = kps[idx].pt.x;\n      dbl[count+1] = kps[idx].pt.y;\n    }\n    return out;\n  }\n\n  DMatchVector dmatches_select_inliers_by_h( const DMatchVector dmatches, \n      const KeyPointVector query, \n      const KeyPointVector train, \n      const Mat &h, const double threshold )\n  {\n    if( dmatches.size() == 0 ) return DMatchVector();\n\n    DMatchVector out;\n\n    Mat query_mat = dmatches_to_mat( dmatches, query, 0 ),\n        train_mat = dmatches_to_mat( dmatches, train, 1 );\n    Mat reproj_error = CVRice::cvHMaxReprojError( query_mat, train_mat, h );\n\n    for( unsigned int i = 0; i < dmatches.size(); ++i ) {\n      if( reproj_error.at<double>(i,0) < threshold*threshold ) \n        out.push_back( dmatches[i] );\n    }\n\n    return out;\n  }\n\n  DMatchVector dmatches_select_inliers_by_mask( const DMatchVector dmatches, const Mat &mask )\n  {\n    if( dmatches.size() == 0 ) return DMatchVector();\n    if( dmatches.size() == 4 ) return dmatches;\n    \n    \/\/ If there's no solution, findHomography will return mask unchanged...\n    if( mask.rows == 0 && mask.cols == 0 ) return DMatchVector();\n\n    Mat mask8u;\n    mask.convertTo( mask8u, CV_8U );\n    if( mask.type() != CV_8U ) rb_raise( rb_eArgError, \"Inlier mask not correct type (%d).\", mask.type() );\n\n    DMatchVector out;\n    for( unsigned int i = 0; i < dmatches.size(); ++i ) {\n      if( mask8u.at<unsigned char>(i,0) != 0 ) \n        out.push_back( dmatches[i] );\n    }\n\n    return out;\n  }\n\n  void init_dmatch_functions( Module &rb_module ) {\n    rb_module.define_module_function( \"dmatches_to_mat\", &dmatches_to_mat )\n      .define_module_function( \"dmatches_select_by_h\", &dmatches_select_inliers_by_h )\n      .define_module_function( \"dmatches_select_inliers_by_h\", &dmatches_select_inliers_by_h )\n      .define_module_function( \"dmatches_select_by_mask\", &dmatches_select_inliers_by_mask )\n      .define_module_function( \"dmatches_select_inliers_by_mask\", &dmatches_select_inliers_by_mask );\n }\n\n};\n<commit_msg>Added function to find DMatch outliers by homography.<commit_after>\n#include <iostream>\n#include <vector>\n#include <iostream>\nusing std::vector;\nusing std::endl;\nusing std::cout;\n\n#include <opencv2\/core.hpp>\n#include <opencv2\/features2d.hpp>\nusing namespace cv;\n\n#include <rice\/Module.hpp>\nusing namespace Rice;\n\n#include \"dmatch.h\"\n\n#include <opencv_rice\/core\/keypoint.h>\n#include <opencv_rice\/calib3d\/reproj.h>\n\n\nnamespace CVRiceMatchers {\n  \n  using namespace CVRice;\n\n  Mat dmatches_to_mat( const DMatchVector dmatches, const KeyPointVector kps, int which )\n  {\n    if( (which != 0) and (which != 1) )\n      rb_raise( rb_eArgError, \"dmatches_to_mat takes 0 or 1\" );\n\n    Mat out( dmatches.size(), 2, CV_64F );\n    double *dbl = out.ptr<double>(0);\n    int count = 0;\n    for( DMatchVector::const_iterator itr = dmatches.begin(); itr != dmatches.end(); ++itr, count+=2 ) {\n      int idx = (which==0 ? (*itr).queryIdx : (*itr).trainIdx );\n\n      dbl[count]   = kps[idx].pt.x;\n      dbl[count+1] = kps[idx].pt.y;\n    }\n    return out;\n  }\n\n  DMatchVector dmatches_select_inliers_by_h( const DMatchVector dmatches, \n      const KeyPointVector query, \n      const KeyPointVector train, \n      const Mat &h, const double threshold )\n  {\n    if( dmatches.size() == 0 ) return DMatchVector();\n\n    DMatchVector out;\n\n    Mat query_mat = dmatches_to_mat( dmatches, query, 0 ),\n        train_mat = dmatches_to_mat( dmatches, train, 1 );\n    Mat reproj_error = CVRice::cvHMaxReprojError( query_mat, train_mat, h );\n\n    for( unsigned int i = 0; i < dmatches.size(); ++i ) {\n      if( reproj_error.at<double>(i,0) < threshold*threshold ) \n        out.push_back( dmatches[i] );\n    }\nl\n    return out;\n  }\n\n  \/\/ TODO.  Fix this DRY failure...\n  DMatchVector dmatches_reject_inliers_by_h( const DMatchVector dmatches, \n      const KeyPointVector query, \n      const KeyPointVector train, \n      const Mat &h, const double threshold )\n  {\n    if( dmatches.size() == 0 ) return DMatchVector();\n\n    DMatchVector out;\n\n    Mat query_mat = dmatches_to_mat( dmatches, query, 0 ),\n        train_mat = dmatches_to_mat( dmatches, train, 1 );\n    Mat reproj_error = CVRice::cvHMaxReprojError( query_mat, train_mat, h );\n\n    for( unsigned int i = 0; i < dmatches.size(); ++i ) {\n      if( reproj_error.at<double>(i,0) >= threshold*threshold ) \n        out.push_back( dmatches[i] );\n    }\n\n    return out;\n  }\n\n\n  DMatchVector dmatches_select_inliers_by_mask( const DMatchVector dmatches, const Mat &mask )\n  {\n    if( dmatches.size() == 0 ) return DMatchVector();\n    if( dmatches.size() == 4 ) return dmatches;\n    \n    \/\/ If there's no solution, findHomography will return mask unchanged...\n    if( mask.rows == 0 && mask.cols == 0 ) return DMatchVector();\n\n    Mat mask8u;\n    mask.convertTo( mask8u, CV_8U );\n    if( mask.type() != CV_8U ) rb_raise( rb_eArgError, \"Inlier mask not correct type (%d).\", mask.type() );\n\n    DMatchVector out;\n    for( unsigned int i = 0; i < dmatches.size(); ++i ) {\n      if( mask8u.at<unsigned char>(i,0) != 0 ) \n        out.push_back( dmatches[i] );\n    }\n\n    return out;\n  }\n\n  void init_dmatch_functions( Module &rb_module ) {\n    rb_module.define_module_function( \"dmatches_to_mat\", &dmatches_to_mat )\n      .define_module_function( \"dmatches_select_by_h\", &dmatches_select_inliers_by_h )\n      .define_module_function( \"dmatches_select_inliers_by_h\", &dmatches_select_inliers_by_h )\n      .define_module_function( \"dmatches_reject_inliers_by_h\", &dmatches_reject_inliers_by_h )\n      .define_module_function( \"dmatches_select_by_mask\", &dmatches_select_inliers_by_mask )\n      .define_module_function( \"dmatches_select_inliers_by_mask\", &dmatches_select_inliers_by_mask );\n }\n\n};\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) DreamLab Onet.pl Sp. z o. o.\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 <v8.h>\n#include <node.h>\n#include <Uri.h>\n\nenum parseOptions {\n    kProtocol = 1,\n    kAuth = 1 << 1,\n    kHost = 1 << 2,\n    kPort = 1 << 3,\n    kQuery = 1 << 4,\n    kFragment = 1 << 5,\n    kPath = 1 << 6,\n    kAll = kProtocol | kAuth | kHost | kPort | kQuery | kFragment | kPath\n};\n\nstatic v8::Persistent<v8::String> protocol_symbol = NODE_PSYMBOL(\"protocol\");\nstatic v8::Persistent<v8::String> auth_symbol = NODE_PSYMBOL(\"auth\");\nstatic v8::Persistent<v8::String> host_symbol = NODE_PSYMBOL(\"host\");\nstatic v8::Persistent<v8::String> port_symbol = NODE_PSYMBOL(\"port\");\nstatic v8::Persistent<v8::String> query_symbol = NODE_PSYMBOL(\"query\");\nstatic v8::Persistent<v8::String> fragment_symbol = NODE_PSYMBOL(\"fragment\");\nstatic v8::Persistent<v8::String> path_symbol = NODE_PSYMBOL(\"path\");\n\nstatic v8::Handle<v8::Value> parse(const v8::Arguments& args){\n    v8::HandleScope scope;\n\n    parseOptions opts = kAll;\n\n    if (args.Length() == 0 || !args[0]->IsString()) {\n        v8::ThrowException(v8::Exception::TypeError(v8::String::New(\"First argument has to be string\")));\n    }\n\n    if (args[1]->IsNumber()) {\n        opts = static_cast<parseOptions>(args[1]->Int32Value());\n    }\n\n    v8::String::Utf8Value url (args[0]->ToString());\n\n    if (url.length() == 0) {\n        v8::ThrowException(v8::Exception::TypeError(v8::String::New(\"String mustn't be empty\")));\n    }\n\n    UriParserStateA state;\n    UriUriA uri;\n\n    state.uri = &uri;\n\n    if (uriParseUriA(&state, *url) != URI_SUCCESS) {\n        return scope.Close(v8::Boolean::New(false));\n    }\n\n    v8::PropertyAttribute attrib = (v8::PropertyAttribute) (v8::ReadOnly | v8::DontDelete);\n    v8::Local<v8::Object> data = v8::Object::New();\n\n    if (uri.scheme.first && opts & kProtocol) {\n        \/\/ +1 here because we need : after protocol\n        data->Set(protocol_symbol, v8::String::New(uri.scheme.first, strlen(uri.scheme.first) - strlen(uri.scheme.afterLast) + 1), attrib);\n    }\n\n    if (uri.userInfo.first && opts & kAuth) {\n        char *auth = (char *) uri.userInfo.first;\n        const char *delim = \":\";\n        auth[strlen(uri.userInfo.first) - strlen(uri.userInfo.afterLast)] = '\\0';\n\n        v8::Local<v8::Object> authData = v8::Object::New();\n        authData->Set(v8::String::New(\"user\"), v8::String::New(strtok(auth, delim))), attrib;\n        authData->Set(v8::String::New(\"password\"), v8::String::New(strtok(NULL, delim)), attrib);\n\n        data->Set(auth_symbol, authData, attrib);\n    }\n\n    if (uri.hostText.first && opts & kHost) {\n        int tmpLength = strlen(uri.hostText.first);\n\n        data->Set(host_symbol, v8::String::New(uri.hostText.first, tmpLength - strlen(uri.hostText.afterLast)), attrib);\n    }\n\n    if (uri.portText.first && opts & kPort) {\n        data->Set(port_symbol, v8::String::New(uri.portText.first, strlen(uri.portText.first) - strlen(uri.portText.afterLast)), attrib);\n    }\n\n    if (uri.query.first && opts & kQuery) {\n        char *query = (char *) uri.query.first;\n        query[strlen(uri.query.first) - strlen(uri.query.afterLast)] = '\\0';\n        const char *amp = \"&\", *sum = \"=\";\n        char *queryParamPtr, *queryParam = strtok_r(query, amp, &queryParamPtr), *queryParamKey, *queryParamValue;\n\n        v8::Local<v8::Object> queryData = v8::Object::New();\n\n        while (queryParam) {\n            queryParamKey = strtok(queryParam, sum);\n            queryParamValue = strtok(NULL, sum);\n            queryParam = strtok_r(NULL, amp, &queryParamPtr);\n\n            queryData->Set(v8::String::New(queryParamKey), v8::String::New(queryParamValue ? queryParamValue : \"\"), attrib);\n        }\n\n        data->Set(query_symbol, queryData, attrib);\n        \/\/parsing the path will be easier\n        query--;\n        query[0] = '\\0';\n    }\n\n    if (uri.fragment.first && opts & kFragment) {\n        data->Set(fragment_symbol, v8::String::New(uri.fragment.first, strlen(uri.fragment.first) - strlen(uri.fragment.afterLast)), attrib);\n    }\n\n    if (uri.pathHead && uri.pathHead->text.first && opts & kPath) {\n        UriPathSegmentA pathHead = *uri.pathHead;\n\n        char *path = (char *) pathHead.text.first;\n\n        int position = strlen(pathHead.text.first);\n        while (pathHead.next) {\n            pathHead = *pathHead.next;\n        }\n\n        int tmpPosition = strlen(pathHead.text.afterLast);\n\n        if ((position - tmpPosition) == 0) {\n            path = (char *) \"\/\";\n        }\n\n        if ((uri.absolutePath || uri.hostText.first) && strlen(path) >= 1) {\n            char *isNull = path;\n\n            if(*(--isNull)) {\n                path--;\n            }\n        }\n\n        data->Set(path_symbol, v8::String::New(path), attrib);\n    } else if (opts & kPath) {\n        data->Set(path_symbol, v8::String::New(\"\/\"), attrib);\n    }\n\n    uriFreeUriMembersA(&uri);\n\n    return scope.Close(data);\n}\n\nextern \"C\" void init (v8::Handle<v8::Object> target){\n    v8::HandleScope scope;\n\n    NODE_SET_METHOD(target, \"parse\", parse);\n    NODE_DEFINE_CONSTANT(target, kProtocol);\n    NODE_DEFINE_CONSTANT(target, kAuth);\n    NODE_DEFINE_CONSTANT(target, kHost);\n    NODE_DEFINE_CONSTANT(target, kPort);\n    NODE_DEFINE_CONSTANT(target, kQuery);\n    NODE_DEFINE_CONSTANT(target, kFragment);\n    NODE_DEFINE_CONSTANT(target, kPath);\n    NODE_DEFINE_CONSTANT(target, kAll);\n}\n<commit_msg>style fix<commit_after>\/*\n * Copyright (C) DreamLab Onet.pl Sp. z o. o.\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 <v8.h>\n#include <node.h>\n#include <Uri.h>\n\nenum parseOptions {\n    kProtocol = 1,\n    kAuth = 1 << 1,\n    kHost = 1 << 2,\n    kPort = 1 << 3,\n    kQuery = 1 << 4,\n    kFragment = 1 << 5,\n    kPath = 1 << 6,\n    kAll = kProtocol | kAuth | kHost | kPort | kQuery | kFragment | kPath\n};\n\nstatic v8::Persistent<v8::String> protocol_symbol = NODE_PSYMBOL(\"protocol\");\nstatic v8::Persistent<v8::String> auth_symbol = NODE_PSYMBOL(\"auth\");\nstatic v8::Persistent<v8::String> host_symbol = NODE_PSYMBOL(\"host\");\nstatic v8::Persistent<v8::String> port_symbol = NODE_PSYMBOL(\"port\");\nstatic v8::Persistent<v8::String> query_symbol = NODE_PSYMBOL(\"query\");\nstatic v8::Persistent<v8::String> fragment_symbol = NODE_PSYMBOL(\"fragment\");\nstatic v8::Persistent<v8::String> path_symbol = NODE_PSYMBOL(\"path\");\n\nstatic v8::Handle<v8::Value> parse(const v8::Arguments& args){\n    v8::HandleScope scope;\n\n    parseOptions opts = kAll;\n\n    if (args.Length() == 0 || !args[0]->IsString()) {\n        v8::ThrowException(v8::Exception::TypeError(v8::String::New(\"First argument has to be string\")));\n    }\n\n    if (args[1]->IsNumber()) {\n        opts = static_cast<parseOptions>(args[1]->Int32Value());\n    }\n\n    v8::String::Utf8Value url (args[0]->ToString());\n\n    if (url.length() == 0) {\n        v8::ThrowException(v8::Exception::TypeError(v8::String::New(\"String mustn't be empty\")));\n    }\n\n    UriParserStateA state;\n    UriUriA uri;\n\n    state.uri = &uri;\n\n    if (uriParseUriA(&state, *url) != URI_SUCCESS) {\n        return scope.Close(v8::Boolean::New(false));\n    }\n\n    v8::PropertyAttribute attrib = (v8::PropertyAttribute) (v8::ReadOnly | v8::DontDelete);\n    v8::Local<v8::Object> data = v8::Object::New();\n\n    if (uri.scheme.first && opts & kProtocol) {\n        \/\/ +1 here because we need : after protocol\n        data->Set(protocol_symbol, v8::String::New(uri.scheme.first, strlen(uri.scheme.first) - strlen(uri.scheme.afterLast) + 1), attrib);\n    }\n\n    if (uri.userInfo.first && opts & kAuth) {\n        char *auth = (char *) uri.userInfo.first;\n        const char *delim = \":\";\n        auth[strlen(uri.userInfo.first) - strlen(uri.userInfo.afterLast)] = '\\0';\n\n        v8::Local<v8::Object> authData = v8::Object::New();\n        authData->Set(v8::String::New(\"user\"), v8::String::New(strtok(auth, delim))), attrib;\n        authData->Set(v8::String::New(\"password\"), v8::String::New(strtok(NULL, delim)), attrib);\n\n        data->Set(auth_symbol, authData, attrib);\n    }\n\n    if (uri.hostText.first && opts & kHost) {\n        int tmpLength = strlen(uri.hostText.first);\n\n        data->Set(host_symbol, v8::String::New(uri.hostText.first, tmpLength - strlen(uri.hostText.afterLast)), attrib);\n    }\n\n    if (uri.portText.first && opts & kPort) {\n        data->Set(port_symbol, v8::String::New(uri.portText.first, strlen(uri.portText.first) - strlen(uri.portText.afterLast)), attrib);\n    }\n\n    if (uri.query.first && opts & kQuery) {\n        char *query = (char *) uri.query.first;\n        query[strlen(uri.query.first) - strlen(uri.query.afterLast)] = '\\0';\n        const char *amp = \"&\", *sum = \"=\";\n        char *queryParamPtr, *queryParam = strtok_r(query, amp, &queryParamPtr), *queryParamKey, *queryParamValue;\n\n        v8::Local<v8::Object> queryData = v8::Object::New();\n\n        while (queryParam) {\n            queryParamKey = strtok(queryParam, sum);\n            queryParamValue = strtok(NULL, sum);\n            queryParam = strtok_r(NULL, amp, &queryParamPtr);\n\n            queryData->Set(v8::String::New(queryParamKey), v8::String::New(queryParamValue ? queryParamValue : \"\"), attrib);\n        }\n\n        data->Set(query_symbol, queryData, attrib);\n        \/\/parsing the path will be easier\n        query--;\n        query[0] = '\\0';\n    }\n\n    if (uri.fragment.first && opts & kFragment) {\n        data->Set(fragment_symbol, v8::String::New(uri.fragment.first, strlen(uri.fragment.first) - strlen(uri.fragment.afterLast)), attrib);\n    }\n\n    if (uri.pathHead && uri.pathHead->text.first && opts & kPath) {\n        UriPathSegmentA pathHead = *uri.pathHead;\n\n        char *path = (char *) pathHead.text.first;\n\n        int position = strlen(pathHead.text.first);\n        while (pathHead.next) {\n            pathHead = *pathHead.next;\n        }\n\n        int tmpPosition = strlen(pathHead.text.afterLast);\n\n        if ((position - tmpPosition) == 0) {\n            path = (char *) \"\/\";\n        }\n\n        if ((uri.absolutePath || uri.hostText.first) && strlen(path) >= 1) {\n            if(*(path - 1)) {\n                path--;\n            }\n        }\n\n        data->Set(path_symbol, v8::String::New(path), attrib);\n    } else if (opts & kPath) {\n        data->Set(path_symbol, v8::String::New(\"\/\"), attrib);\n    }\n\n    uriFreeUriMembersA(&uri);\n\n    return scope.Close(data);\n}\n\nextern \"C\" void init (v8::Handle<v8::Object> target){\n    v8::HandleScope scope;\n\n    NODE_SET_METHOD(target, \"parse\", parse);\n    NODE_DEFINE_CONSTANT(target, kProtocol);\n    NODE_DEFINE_CONSTANT(target, kAuth);\n    NODE_DEFINE_CONSTANT(target, kHost);\n    NODE_DEFINE_CONSTANT(target, kPort);\n    NODE_DEFINE_CONSTANT(target, kQuery);\n    NODE_DEFINE_CONSTANT(target, kFragment);\n    NODE_DEFINE_CONSTANT(target, kPath);\n    NODE_DEFINE_CONSTANT(target, kAll);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/graf:$Id$\n\/\/ Author: Rene Brun   12\/12\/94\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#include \"Riostream.h\"\n#include \"TROOT.h\"\n#include \"Strlen.h\"\n#include \"TWbox.h\"\n#include \"TColor.h\"\n#include \"TVirtualPad.h\"\n#include \"TVirtualX.h\"\n#include \"TPoint.h\"\n\n\nClassImp(TWbox)\n\n\n\/\/______________________________________________________________________________\n\/\/\n\/\/ a TWbox is a TBox with a bordersize and a bordermode.\n\/\/\n\/\/Begin_Html\n\/*\n<img src=\"gif\/wbox.gif\">\n*\/\n\/\/End_Html\n\n\n\/\/______________________________________________________________________________\nTWbox::TWbox(): TBox()\n{\n   \/\/ wbox default constructor.\n\n   fBorderSize  = 0;\n   fBorderMode  = 0;\n}\n\n\n\/\/______________________________________________________________________________\nTWbox::TWbox(Double_t x1, Double_t y1,Double_t x2, Double_t  y2,\n             Color_t color ,Short_t bordersize ,Short_t bordermode)\n       :TBox(x1,y1,x2,y2)\n{\n   \/\/ wbox normal constructor.\n   \/\/\n   \/\/ a WBOX is a box with a bordersize and a bordermode\n   \/\/ the bordersize is in pixels\n   \/\/ bordermode = -1 box looks as it is behind the screen\n   \/\/ bordermode = 0  no special effects\n   \/\/ bordermode = 1  box looks as it is in front of the screen\n\n   fBorderSize  = bordersize;\n   fBorderMode  = bordermode;\n   SetFillColor(color);\n   SetFillStyle(1001);\n}\n\n\n\/\/______________________________________________________________________________\nTWbox::~TWbox()\n{\n   \/\/ wbox default destructor.\n}\n\n\n\/\/______________________________________________________________________________\nTWbox::TWbox(const TWbox &wbox) : TBox(wbox)\n{\n   \/\/ wbox copy constructor.\n\n   ((TWbox&)wbox).Copy(*this);\n}\n\n\n\/\/______________________________________________________________________________\nvoid TWbox::Copy(TObject &obj) const\n{\n   \/\/ Copy this wbox to wbox.\n\n   TBox::Copy(obj);\n   ((TWbox&)obj).fBorderSize  = fBorderSize;\n   ((TWbox&)obj).fBorderMode  = fBorderMode;\n}\n\n\n\/\/______________________________________________________________________________\nvoid TWbox::Draw(Option_t *option)\n{\n   \/\/ Draw this wbox with its current attributes.\n\n   AppendPad(option);\n}\n\n\n\/\/______________________________________________________________________________\nvoid TWbox::DrawWbox(Double_t x1, Double_t y1,Double_t x2, Double_t  y2,\n                     Color_t color ,Short_t bordersize ,Short_t bordermode)\n{\n   \/\/ Draw this wbox with new coordinates.\n\n   TWbox *newwbox = new TWbox(x1,y1,x2,y2,color,bordersize,bordermode);\n   newwbox->SetBit(kCanDelete);\n   newwbox->AppendPad();\n}\n\n\n\/\/______________________________________________________________________________\nvoid TWbox::ExecuteEvent(Int_t event, Int_t px, Int_t py)\n{\n   \/\/ Execute action corresponding to one event.\n   \/\/\n   \/\/  This member function is called when a WBOX object is clicked.\n\n   TBox::ExecuteEvent(event, px, py);\n}\n\n\n\/\/______________________________________________________________________________\nvoid TWbox::Paint(Option_t *)\n{\n   \/\/ Paint this wbox with its current attributes.\n\n   PaintWbox(fX1, fY1, fX2, fY2, GetFillColor(), fBorderSize, fBorderMode);\n}\n\n\n\/\/______________________________________________________________________________\nvoid TWbox::PaintWbox(Double_t x1, Double_t y1, Double_t x2, Double_t  y2,\n                      Color_t color, Short_t bordersize, Short_t bordermode)\n{\n   \/\/ Draw this wbox with new coordinates.\n\n   \/\/ Draw first wbox as a normal filled box\n   TBox::PaintBox(x1, y1, x2, y2);\n\n   \/\/ then paint 3d frame (depending on bordermode)\n   if (!IsTransparent())\n      PaintFrame(x1, y1, x2, y2, color, bordersize, bordermode, kTRUE);\n}\n\n\n\/\/______________________________________________________________________________\nvoid TWbox::PaintFrame(Double_t x1, Double_t y1,Double_t x2, Double_t  y2,\n                       Color_t color, Short_t bordersize, Short_t bordermode,\n                       Bool_t tops)\n{\n   \/\/ Paint a 3D frame around a box.\n\n   if (bordermode == 0) return;\n   if (bordersize <= 0) bordersize = 2;\n\n   Short_t pxl,pyl,pxt,pyt,px1,py1,px2,py2;\n   Double_t xl, xt, yl, yt;\n\n   \/\/ Compute real left bottom & top right of the box in pixels\n   px1 = gPad->XtoPixel(x1);   py1 = gPad->YtoPixel(y1);\n   px2 = gPad->XtoPixel(x2);   py2 = gPad->YtoPixel(y2);\n   if (px1 < px2) {pxl = px1; pxt = px2; xl = x1; xt = x2; }\n   else           {pxl = px2; pxt = px1; xl = x2; xt = x1;}\n   if (py1 > py2) {pyl = py1; pyt = py2; yl = y1; yt = y2;}\n   else           {pyl = py2; pyt = py1; yl = y2; yt = y1;}\n\n   if (!gPad->IsBatch()) {\n      TPoint frame[7];\n\n      \/\/ GetDarkColor() and GetLightColor() use GetFillColor()\n      Color_t oldcolor = GetFillColor();\n      SetFillColor(color);\n      TAttFill::Modify();\n\n      \/\/ Draw top&left part of the box\n      frame[0].fX = pxl;                 frame[0].fY = pyl;\n      frame[1].fX = pxl + bordersize;    frame[1].fY = pyl - bordersize;\n      frame[2].fX = frame[1].fX;         frame[2].fY = pyt + bordersize;\n      frame[3].fX = pxt - bordersize;    frame[3].fY = frame[2].fY;\n      frame[4].fX = pxt;                 frame[4].fY = pyt;\n      frame[5].fX = pxl;                 frame[5].fY = pyt;\n      frame[6].fX = pxl;                 frame[6].fY = pyl;\n\n      if (bordermode == -1) gVirtualX->SetFillColor(GetDarkColor());\n      else                  gVirtualX->SetFillColor(GetLightColor());\n      gVirtualX->DrawFillArea(7, frame);\n\n      \/\/ Draw bottom&right part of the box\n      frame[0].fX = pxl;                 frame[0].fY = pyl;\n      frame[1].fX = pxl + bordersize;    frame[1].fY = pyl - bordersize;\n      frame[2].fX = pxt - bordersize;    frame[2].fY = frame[1].fY;\n      frame[3].fX = frame[2].fX;         frame[3].fY = pyt + bordersize;\n      frame[4].fX = pxt;                 frame[4].fY = pyt;\n      frame[5].fX = pxt;                 frame[5].fY = pyl;\n      frame[6].fX = pxl;                 frame[6].fY = pyl;\n\n      if (bordermode == -1) gVirtualX->SetFillColor(TColor::GetColorBright(GetFillColor()));\n      else                  gVirtualX->SetFillColor(TColor::GetColorDark(GetFillColor()));\n      gVirtualX->DrawFillArea(7, frame);\n\n      gVirtualX->SetFillColor(-1);\n      SetFillColor(oldcolor);\n   }\n\n   if (!tops) return;\n\n   \/\/ same for PostScript\n   \/\/ Double_t dx   = (xt - xl) *Double_t(bordersize)\/Double_t(pxt - pxl);\n   \/\/ Int_t border = gVirtualPS->XtoPS(xt) - gVirtualPS->XtoPS(xt-dx);\n\n   gPad->PaintBorderPS(xl, yl, xt, yt, bordermode, bordersize,\n                         GetDarkColor(), GetLightColor());\n}\n\n\n\/\/______________________________________________________________________________\nvoid TWbox::SavePrimitive(ostream &out, Option_t * \/*= \"\"*\/)\n{\n   \/\/ Save primitive as a C++ statement(s) on output stream out\n\n   if (gROOT->ClassSaved(TWbox::Class())) {\n      out<<\"   \";\n   } else {\n      out<<\"   TWbox *\";\n   }\n   out<<\"wbox = new TWbox(\"<<fX1<<\",\"<<fY1<<\",\"<<fX2<<\",\"<<fY2<<\");\"<<endl;\n\n   SaveFillAttributes(out,\"wbox\",0,1001);\n   SaveLineAttributes(out,\"wbox\",1,1,1);\n\n   out<<\"   wbox->Draw();\"<<endl;\n}\n<commit_msg>- init missing (coverity)<commit_after>\/\/ @(#)root\/graf:$Id$\n\/\/ Author: Rene Brun   12\/12\/94\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#include \"Riostream.h\"\n#include \"TROOT.h\"\n#include \"Strlen.h\"\n#include \"TWbox.h\"\n#include \"TColor.h\"\n#include \"TVirtualPad.h\"\n#include \"TVirtualX.h\"\n#include \"TPoint.h\"\n\n\nClassImp(TWbox)\n\n\n\/\/______________________________________________________________________________\n\/\/\n\/\/ a TWbox is a TBox with a bordersize and a bordermode.\n\/\/\n\/\/Begin_Html\n\/*\n<img src=\"gif\/wbox.gif\">\n*\/\n\/\/End_Html\n\n\n\/\/______________________________________________________________________________\nTWbox::TWbox(): TBox()\n{\n   \/\/ wbox default constructor.\n\n   fBorderSize  = 0;\n   fBorderMode  = 0;\n}\n\n\n\/\/______________________________________________________________________________\nTWbox::TWbox(Double_t x1, Double_t y1,Double_t x2, Double_t  y2,\n             Color_t color ,Short_t bordersize ,Short_t bordermode)\n       :TBox(x1,y1,x2,y2)\n{\n   \/\/ wbox normal constructor.\n   \/\/\n   \/\/ a WBOX is a box with a bordersize and a bordermode\n   \/\/ the bordersize is in pixels\n   \/\/ bordermode = -1 box looks as it is behind the screen\n   \/\/ bordermode = 0  no special effects\n   \/\/ bordermode = 1  box looks as it is in front of the screen\n\n   fBorderSize  = bordersize;\n   fBorderMode  = bordermode;\n   SetFillColor(color);\n   SetFillStyle(1001);\n}\n\n\n\/\/______________________________________________________________________________\nTWbox::~TWbox()\n{\n   \/\/ wbox default destructor.\n}\n\n\n\/\/______________________________________________________________________________\nTWbox::TWbox(const TWbox &wbox) : TBox(wbox)\n{\n   \/\/ wbox copy constructor.\n\n   fBorderSize  = 0;\n   fBorderMode  = 0;\n   ((TWbox&)wbox).Copy(*this);\n}\n\n\n\/\/______________________________________________________________________________\nvoid TWbox::Copy(TObject &obj) const\n{\n   \/\/ Copy this wbox to wbox.\n\n   TBox::Copy(obj);\n   ((TWbox&)obj).fBorderSize  = fBorderSize;\n   ((TWbox&)obj).fBorderMode  = fBorderMode;\n}\n\n\n\/\/______________________________________________________________________________\nvoid TWbox::Draw(Option_t *option)\n{\n   \/\/ Draw this wbox with its current attributes.\n\n   AppendPad(option);\n}\n\n\n\/\/______________________________________________________________________________\nvoid TWbox::DrawWbox(Double_t x1, Double_t y1,Double_t x2, Double_t  y2,\n                     Color_t color ,Short_t bordersize ,Short_t bordermode)\n{\n   \/\/ Draw this wbox with new coordinates.\n\n   TWbox *newwbox = new TWbox(x1,y1,x2,y2,color,bordersize,bordermode);\n   newwbox->SetBit(kCanDelete);\n   newwbox->AppendPad();\n}\n\n\n\/\/______________________________________________________________________________\nvoid TWbox::ExecuteEvent(Int_t event, Int_t px, Int_t py)\n{\n   \/\/ Execute action corresponding to one event.\n   \/\/\n   \/\/  This member function is called when a WBOX object is clicked.\n\n   TBox::ExecuteEvent(event, px, py);\n}\n\n\n\/\/______________________________________________________________________________\nvoid TWbox::Paint(Option_t *)\n{\n   \/\/ Paint this wbox with its current attributes.\n\n   PaintWbox(fX1, fY1, fX2, fY2, GetFillColor(), fBorderSize, fBorderMode);\n}\n\n\n\/\/______________________________________________________________________________\nvoid TWbox::PaintWbox(Double_t x1, Double_t y1, Double_t x2, Double_t  y2,\n                      Color_t color, Short_t bordersize, Short_t bordermode)\n{\n   \/\/ Draw this wbox with new coordinates.\n\n   \/\/ Draw first wbox as a normal filled box\n   TBox::PaintBox(x1, y1, x2, y2);\n\n   \/\/ then paint 3d frame (depending on bordermode)\n   if (!IsTransparent())\n      PaintFrame(x1, y1, x2, y2, color, bordersize, bordermode, kTRUE);\n}\n\n\n\/\/______________________________________________________________________________\nvoid TWbox::PaintFrame(Double_t x1, Double_t y1,Double_t x2, Double_t  y2,\n                       Color_t color, Short_t bordersize, Short_t bordermode,\n                       Bool_t tops)\n{\n   \/\/ Paint a 3D frame around a box.\n\n   if (bordermode == 0) return;\n   if (bordersize <= 0) bordersize = 2;\n\n   Short_t pxl,pyl,pxt,pyt,px1,py1,px2,py2;\n   Double_t xl, xt, yl, yt;\n\n   \/\/ Compute real left bottom & top right of the box in pixels\n   px1 = gPad->XtoPixel(x1);   py1 = gPad->YtoPixel(y1);\n   px2 = gPad->XtoPixel(x2);   py2 = gPad->YtoPixel(y2);\n   if (px1 < px2) {pxl = px1; pxt = px2; xl = x1; xt = x2; }\n   else           {pxl = px2; pxt = px1; xl = x2; xt = x1;}\n   if (py1 > py2) {pyl = py1; pyt = py2; yl = y1; yt = y2;}\n   else           {pyl = py2; pyt = py1; yl = y2; yt = y1;}\n\n   if (!gPad->IsBatch()) {\n      TPoint frame[7];\n\n      \/\/ GetDarkColor() and GetLightColor() use GetFillColor()\n      Color_t oldcolor = GetFillColor();\n      SetFillColor(color);\n      TAttFill::Modify();\n\n      \/\/ Draw top&left part of the box\n      frame[0].fX = pxl;                 frame[0].fY = pyl;\n      frame[1].fX = pxl + bordersize;    frame[1].fY = pyl - bordersize;\n      frame[2].fX = frame[1].fX;         frame[2].fY = pyt + bordersize;\n      frame[3].fX = pxt - bordersize;    frame[3].fY = frame[2].fY;\n      frame[4].fX = pxt;                 frame[4].fY = pyt;\n      frame[5].fX = pxl;                 frame[5].fY = pyt;\n      frame[6].fX = pxl;                 frame[6].fY = pyl;\n\n      if (bordermode == -1) gVirtualX->SetFillColor(GetDarkColor());\n      else                  gVirtualX->SetFillColor(GetLightColor());\n      gVirtualX->DrawFillArea(7, frame);\n\n      \/\/ Draw bottom&right part of the box\n      frame[0].fX = pxl;                 frame[0].fY = pyl;\n      frame[1].fX = pxl + bordersize;    frame[1].fY = pyl - bordersize;\n      frame[2].fX = pxt - bordersize;    frame[2].fY = frame[1].fY;\n      frame[3].fX = frame[2].fX;         frame[3].fY = pyt + bordersize;\n      frame[4].fX = pxt;                 frame[4].fY = pyt;\n      frame[5].fX = pxt;                 frame[5].fY = pyl;\n      frame[6].fX = pxl;                 frame[6].fY = pyl;\n\n      if (bordermode == -1) gVirtualX->SetFillColor(TColor::GetColorBright(GetFillColor()));\n      else                  gVirtualX->SetFillColor(TColor::GetColorDark(GetFillColor()));\n      gVirtualX->DrawFillArea(7, frame);\n\n      gVirtualX->SetFillColor(-1);\n      SetFillColor(oldcolor);\n   }\n\n   if (!tops) return;\n\n   \/\/ same for PostScript\n   \/\/ Double_t dx   = (xt - xl) *Double_t(bordersize)\/Double_t(pxt - pxl);\n   \/\/ Int_t border = gVirtualPS->XtoPS(xt) - gVirtualPS->XtoPS(xt-dx);\n\n   gPad->PaintBorderPS(xl, yl, xt, yt, bordermode, bordersize,\n                         GetDarkColor(), GetLightColor());\n}\n\n\n\/\/______________________________________________________________________________\nvoid TWbox::SavePrimitive(ostream &out, Option_t * \/*= \"\"*\/)\n{\n   \/\/ Save primitive as a C++ statement(s) on output stream out\n\n   if (gROOT->ClassSaved(TWbox::Class())) {\n      out<<\"   \";\n   } else {\n      out<<\"   TWbox *\";\n   }\n   out<<\"wbox = new TWbox(\"<<fX1<<\",\"<<fY1<<\",\"<<fX2<<\",\"<<fY2<<\");\"<<endl;\n\n   SaveFillAttributes(out,\"wbox\",0,1001);\n   SaveLineAttributes(out,\"wbox\",1,1,1);\n\n   out<<\"   wbox->Draw();\"<<endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"grune-json\/grune-json.hpp\"\n\n#include \"grune\/production.hpp\"\n\nusing namespace grune;\n\njson11::Json grune::to_json(const production& value)\n{\n    return { };\n}\n\nbool grune::from_json(const json11::Json& js, production& p)\n{\n    return false;\n}\n\n<commit_msg>Add production serialization.<commit_after>#include \"grune-json\/grune-json.hpp\"\n\n#include \"grune\/production.hpp\"\n\nusing namespace grune;\nusing namespace json11;\n\nJson grune::to_json(const production& value)\n{\n    Json lhs(value.lhs());\n    Json rhs(value.rhs());\n    return Json::object { \n        { \"lhs\", lhs },\n        { \"rhs\", rhs }\n    };\n}\n\nbool grune::from_json(const Json& js, production& p)\n{\n    sequence lhs = js[\"lhs\"].as<sequence>();\n    sequence rhs = js[\"rhs\"].as<sequence>();\n    p = production(lhs, rhs);\n    return true;\n}\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Bug fix in encode, forget to right shift values and new function to return the masking values<commit_after><|endoftext|>"}
{"text":"<commit_before>#include <sstream>\n#include \"Exceptions.h\"\n#include \"Extensions.h\"\n#include \"UNetSender.h\"\n\/\/ -----------------------------------------------------------------------------\nusing namespace std;\nusing namespace UniSetTypes;\nusing namespace UniSetExtensions;\n\/\/ -----------------------------------------------------------------------------\nUNetSender::UNetSender( const std::string s_host, const ost::tpport_t port, SMInterface* smi,\n\t\t\t\t\t\tconst std::string s_f, const std::string s_val, SharedMemory* ic ):\ns_field(s_f),\ns_fvalue(s_val),\nshm(smi),\ns_host(s_host),\nsendpause(150),\nactivated(false),\ndlist(100),\nmaxItem(0),\npacketnum(1),\ns_thr(0)\n{\n\n\t{\n\t\tostringstream s;\n\t\ts << \"(\" << s_host << \":\" << port << \")\";\n\t\tmyname = s.str();\n\t}\n\n\t\/\/ определяем фильтр\n\/\/\ts_field = conf->getArgParam(\"--udp-filter-field\");\n\/\/\ts_fvalue = conf->getArgParam(\"--udp-filter-value\");\n\tdlog[Debug::INFO] << myname << \"(init): read filter-field='\" << s_field\n\t\t\t\t\t\t<< \"' filter-value='\" << s_fvalue << \"'\" << endl;\n\n\tif( dlog.debugging(Debug::INFO) )\n\t\tdlog[Debug::INFO] << \"(UNetSender): UDP set to \" << s_host << \":\" << port << endl;\n\n\tost::Thread::setException(ost::Thread::throwException);\n\ttry\n\t{\n\t\taddr = s_host.c_str();\n\t\tudp = new ost::UDPBroadcast(addr,port);\n\t}\n\tcatch( std::exception& e )\n\t{\n\t\tostringstream s;\n\t\ts << myname << \": \" << e.what();\n\t\tdlog[Debug::CRIT] << s.str() << std::endl;\n\t\tthrow SystemError(s.str());\n\t}\n\tcatch( ... )\n\t{\n\t\tostringstream s;\n\t\ts << myname << \": catch...\";\n\t\tdlog[Debug::CRIT] << s.str() << std::endl;\n\t\tthrow SystemError(s.str());\n\t}\n\n\ts_thr = new ThreadCreator<UNetSender>(this, &UNetSender::send);\n\n\t\/\/ -------------------------------\n\tif( shm->isLocalwork() )\n\t{\n\t\treadConfiguration();\n\t\tdlist.resize(maxItem);\n\t\tdlog[Debug::INFO] << myname << \"(init): dlist size = \" << dlist.size() << endl;\n\t}\n\telse\n\t\tic->addReadItem( sigc::mem_fun(this,&UNetSender::readItem) );\n\n\n\t\/\/ выставляем поля, которые не меняются\n\tmypack.msg.header.nodeID = conf->getLocalNode();\n\tmypack.msg.header.procID = shm->ID();\n}\n\/\/ -----------------------------------------------------------------------------\nUNetSender::~UNetSender()\n{\n  \tdelete s_thr;\n\tdelete udp;\n\tdelete shm;\n}\n\/\/ -----------------------------------------------------------------------------\nvoid UNetSender::updateFromSM()\n{\n\tDMap::iterator it=dlist.begin();\n\tfor( ; it!=dlist.end(); ++it )\n\t{\n\t\tlong value = 0;\n\n\t\tif( it->iotype == UniversalIO::DigitalInput || it->iotype == UniversalIO::DigitalOutput )\n\t\t\tvalue = shm->localGetState(it->dit,it->id) ? 1 : 0;\n\t\telse if( it->iotype == UniversalIO::AnalogInput || it->iotype == UniversalIO::AnalogOutput )\n\t\t\tvalue = shm->localGetValue(it->ait,it->id);\n\t\telse\n\t\t{\n\t\t\tdlog[Debug::CRIT] << myname << \"(update): Unknown iotype for sid=\" << it->id << endl;\n\t\t\tcontinue;\n\t\t}\n\n\t\tupdateItem(it,value);\n\t}\n}\n\/\/ -----------------------------------------------------------------------------\nvoid UNetSender::updateSensor( UniSetTypes::ObjectId id, long value )\n{\n\/\/\tcerr << myname << \": UPDATE SENSOR id=\" << id << \" value=\" << value << endl;\n\tDMap::iterator it=dlist.begin();\n\tfor( ; it!=dlist.end(); ++it )\n\t{\n\t\tif( it->id == id )\n\t\t{\n\t\t\tupdateItem( it, value );\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\/\/ -----------------------------------------------------------------------------\nvoid UNetSender::updateItem( DMap::iterator& it, long value )\n{\n\tif( it == dlist.end() )\n\t\treturn;\n\n\tif( it->iotype == UniversalIO::DigitalInput || it->iotype == UniversalIO::DigitalOutput )\n\t{\n\t\tUniSetTypes::uniset_mutex_lock l(pack_mutex,100);\n\t\tmypack.setDData(it->pack_ind,value);\n\t}\n\telse if( it->iotype == UniversalIO::AnalogInput || it->iotype == UniversalIO::AnalogOutput )\n\t{\n\t\tUniSetTypes::uniset_mutex_lock l(pack_mutex,100);\n\t\tmypack.setAData(it->pack_ind,value);\n\t}\n}\n\/\/ -----------------------------------------------------------------------------\nvoid UNetSender::send()\n{\n\tdlist.resize(maxItem);\n\tdlog[Debug::INFO] << myname << \"(send): dlist size = \" << dlist.size() << endl;\n\/*\n\tost::IPV4Broadcast h = s_host.c_str();\n\ttry\n\t{\t\t\t\n\t\tudp->setPeer(h,port);\n\t}\n\tcatch( ost::SockException& e )\n\t{\n\t\tostringstream s;\n\t\ts << e.getString() << \": \" << e.getSystemErrorString();\n\t\tdlog[Debug::CRIT] << myname << \"(poll): \" << s.str() << endl;\n\t\tthrow SystemError(s.str());\n\t}\n*\/\n\twhile( activated )\n\t{\n\t\ttry\n\t\t{\n\t\t\tif( !shm->isLocalwork() )\n\t\t\t\tupdateFromSM();\n\t\t\t\n\t\t\treal_send();\n\t\t}\n\t\tcatch( ost::SockException& e )\n\t\t{\n\t\t\tdlog[Debug::WARN]  << myname << \"(send): \" << e.getString() << endl;\n\t\t}\n\t\tcatch( UniSetTypes::Exception& ex)\n\t\t{\n\t\t\tdlog[Debug::WARN] << myname << \"(send): \" << ex << std::endl;\n\t\t}\n\t\tcatch( std::exception& e )\n\t\t{\n\t\t\tdlog[Debug::WARN] << myname << \"(send): \" << e.what() << std::endl;\n\t\t}\n\t\tcatch(...)\n\t\t{\n\t\t\tdlog[Debug::WARN] << myname << \"(send): catch ...\" << std::endl;\n\t\t}\t\n\n\t\tmsleep(sendpause);\n\t}\n\n\tdlog[Debug::INFO] << \"************* execute FINISH **********\" << endl;\n}\n\/\/ -----------------------------------------------------------------------------\nvoid UNetSender::real_send()\n{\n\tUniSetTypes::uniset_mutex_lock l(pack_mutex,300);\n\tmypack.msg.header.num = packetnum++;\n\n\tif( packetnum > UniSetUDP::MaxPacketNum )\n\t\tpacketnum = 1;\n\n\/\/\tcout << \"************* send header: \" << mypack.msg.header << endl;\n\/\/\tsize_t sz = mypack.byte_size() + sizeof(UniSetUDP::UDPHeader);\n\tsize_t sz =\tsizeof(UniSetUDP::UDPMessage);\n\tif( !udp->isPending(ost::Socket::pendingOutput) )\n\t\treturn;\n\n\tsize_t ret = udp->send( (char*)&(mypack.msg),sz);\n\tif( ret < sz )\n\t\tdlog[Debug::CRIT] << myname << \"(real_send): FAILED ret=\" << ret << \" < sizeof=\" << sz << endl;\n}\n\/\/ -----------------------------------------------------------------------------\nvoid UNetSender::stop()\n{\n\tactivated = false;\n\/\/\ts_thr->stop();\n}\n\/\/ -----------------------------------------------------------------------------\nvoid UNetSender::start()\n{\n\tif( !activated )\n\t{\n\t\tactivated = true;\n\t\ts_thr->start();\n\t}\n}\n\/\/ -----------------------------------------------------------------------------\nvoid UNetSender::readConfiguration()\n{\n\txmlNode* root = conf->getXMLSensorsSection();\n\tif(!root)\n\t{\n\t\tostringstream err;\n\t\terr << myname << \"(readConfiguration): not found <sensors>\";\n\t\tthrow SystemError(err.str());\n\t}\n\n\tUniXML_iterator it(root);\n\tif( !it.goChildren() )\n\t{\n\t\tstd::cerr << myname << \"(readConfiguration): empty <sensors>?!!\" << endl;\n\t\treturn;\n\t}\n\n\tfor( ;it.getCurrent(); it.goNext() )\n\t{\n\t\tif( check_item(it) )\n\t\t\tinitItem(it);\n\t}\n}\n\/\/ ------------------------------------------------------------------------------------------\nbool UNetSender::check_item( UniXML_iterator& it )\n{\n\tif( s_field.empty() )\n\t\treturn true;\n\n\t\/\/ просто проверка на не пустой field\n\tif( s_fvalue.empty() && it.getProp(s_field).empty() )\n\t\treturn false;\n\n\t\/\/ просто проверка что field = value\n\tif( !s_fvalue.empty() && it.getProp(s_field)!=s_fvalue )\n\t\treturn false;\n\n\treturn true;\n}\n\/\/ ------------------------------------------------------------------------------------------\nbool UNetSender::readItem( UniXML& xml, UniXML_iterator& it, xmlNode* sec )\n{\n\tif( check_item(it) )\n\t\tinitItem(it);\n\treturn true;\n}\n\/\/ ------------------------------------------------------------------------------------------\nbool UNetSender::initItem( UniXML_iterator& it )\n{\n\tstring sname( it.getProp(\"name\") );\n\n\tstring tid(it.getProp(\"id\"));\n\t\n\tObjectId sid;\n\tif( !tid.empty() )\n\t{\n\t\tsid = UniSetTypes::uni_atoi(tid);\n\t\tif( sid <= 0 )\n\t\t\tsid = DefaultObjectId;\n\t}\n\telse\n\t\tsid = conf->getSensorID(sname);\n\n\tif( sid == DefaultObjectId )\n\t{\n\t\tif( dlog )\n\t\t\tdlog[Debug::CRIT] << myname << \"(readItem): ID not found for \"\n\t\t\t\t\t\t\t<< sname << endl;\n\t\treturn false;\n\t}\n\t\n\tUItem p;\n\tp.iotype = UniSetTypes::getIOType(it.getProp(\"iotype\"));\n\t\n\tif( p.iotype == UniversalIO::UnknownIOType )\n\t{\n\t\tdlog[Debug::CRIT] << myname << \"(readItem): Unknown iotype for sid=\" << sid << endl;\n\t\treturn false;\n\t}\n\n\tp.id = sid;\n\n\tif( p.iotype == UniversalIO::DigitalInput || p.iotype == UniversalIO::DigitalOutput )\n\t{\n\t\tp.pack_ind = mypack.addDData(sid,0);\n\t\tif ( p.pack_ind >= UniSetUDP::MaxDCount )\n\t\t{\n\t\t\tdlog[Debug::CRIT] << myname \n\t\t\t\t\t<< \"(readItem): OVERFLOW! MAX UDP DIGITAL DATA LIMIT! max=\" \n\t\t\t\t\t<< UniSetUDP::MaxDCount << endl;\n\t\t\treturn false;\n\t\t}\n\t}\n\telse if( p.iotype == UniversalIO::AnalogInput || p.iotype == UniversalIO::AnalogOutput )\n\t{\n\t\tp.pack_ind = mypack.addAData(sid,0);\n\t\tif ( p.pack_ind >= UniSetUDP::MaxACount )\n\t\t{\n\t\t\tdlog[Debug::CRIT] << myname \n\t\t\t\t\t<< \"(readItem): OVERFLOW! MAX UDP ANALOG DATA LIMIT! max=\" \n\t\t\t\t\t<< UniSetUDP::MaxACount << endl;\n\t\t\treturn false;\n\t\t}\n\t}\n\t\n\tif( maxItem >= dlist.size() )\n\t\tdlist.resize(maxItem+10);\n\t\n\tdlist[maxItem] = p;\n\tmaxItem++;\n\n\tif( dlog.debugging(Debug::INFO) )\n\t\tdlog[Debug::INFO] << myname << \"(initItem): add \" << p << endl;\n\n\treturn true;\n}\n\n\/\/ ------------------------------------------------------------------------------------------\nstd::ostream& operator<<( std::ostream& os, UNetSender::UItem& p )\n{\n\treturn os << \" sid=\" << p.id;\n}\n\/\/ -----------------------------------------------------------------------------\nvoid UNetSender::initIterators()\n{\n\tDMap::iterator it=dlist.begin();\n\tfor( ; it!=dlist.end(); it++ )\n\t{\n\t\tshm->initDIterator(it->dit);\n\t\tshm->initAIterator(it->ait);\n\t}\n}\n\/\/ -----------------------------------------------------------------------------\nvoid UNetSender::askSensors( UniversalIO::UIOCommand cmd )\n{\n\tDMap::iterator it=dlist.begin();\n\tfor( ; it!=dlist.end(); it++ )\n\t\tshm->askSensor(it->id,cmd);\n}\n\/\/ -----------------------------------------------------------------------------\n<commit_msg>(unet2): исправил ещё один баг<commit_after>#include <sstream>\n#include \"Exceptions.h\"\n#include \"Extensions.h\"\n#include \"UNetSender.h\"\n\/\/ -----------------------------------------------------------------------------\nusing namespace std;\nusing namespace UniSetTypes;\nusing namespace UniSetExtensions;\n\/\/ -----------------------------------------------------------------------------\nUNetSender::UNetSender( const std::string s_host, const ost::tpport_t port, SMInterface* smi,\n\t\t\t\t\t\tconst std::string s_f, const std::string s_val, SharedMemory* ic ):\ns_field(s_f),\ns_fvalue(s_val),\nshm(smi),\ns_host(s_host),\nsendpause(150),\nactivated(false),\ndlist(100),\nmaxItem(0),\npacketnum(1),\ns_thr(0)\n{\n\n\t{\n\t\tostringstream s;\n\t\ts << \"(\" << s_host << \":\" << port << \")\";\n\t\tmyname = s.str();\n\t}\n\n\t\/\/ определяем фильтр\n\/\/\ts_field = conf->getArgParam(\"--udp-filter-field\");\n\/\/\ts_fvalue = conf->getArgParam(\"--udp-filter-value\");\n\tdlog[Debug::INFO] << myname << \"(init): read filter-field='\" << s_field\n\t\t\t\t\t\t<< \"' filter-value='\" << s_fvalue << \"'\" << endl;\n\n\tif( dlog.debugging(Debug::INFO) )\n\t\tdlog[Debug::INFO] << \"(UNetSender): UDP set to \" << s_host << \":\" << port << endl;\n\n\tost::Thread::setException(ost::Thread::throwException);\n\ttry\n\t{\n\t\taddr = s_host.c_str();\n\t\tudp = new ost::UDPBroadcast(addr,port);\n\t}\n\tcatch( std::exception& e )\n\t{\n\t\tostringstream s;\n\t\ts << myname << \": \" << e.what();\n\t\tdlog[Debug::CRIT] << s.str() << std::endl;\n\t\tthrow SystemError(s.str());\n\t}\n\tcatch( ... )\n\t{\n\t\tostringstream s;\n\t\ts << myname << \": catch...\";\n\t\tdlog[Debug::CRIT] << s.str() << std::endl;\n\t\tthrow SystemError(s.str());\n\t}\n\n\ts_thr = new ThreadCreator<UNetSender>(this, &UNetSender::send);\n\n\t\/\/ -------------------------------\n\tif( shm->isLocalwork() )\n\t{\n\t\treadConfiguration();\n\t\tdlist.resize(maxItem);\n\t\tdlog[Debug::INFO] << myname << \"(init): dlist size = \" << dlist.size() << endl;\n\t}\n\telse\n\t\tic->addReadItem( sigc::mem_fun(this,&UNetSender::readItem) );\n\n\n\t\/\/ выставляем поля, которые не меняются\n\tmypack.msg.header.nodeID = conf->getLocalNode();\n\tmypack.msg.header.procID = shm->ID();\n}\n\/\/ -----------------------------------------------------------------------------\nUNetSender::~UNetSender()\n{\n  \tdelete s_thr;\n\tdelete udp;\n\tdelete shm;\n}\n\/\/ -----------------------------------------------------------------------------\nvoid UNetSender::updateFromSM()\n{\n\tDMap::iterator it=dlist.begin();\n\tfor( ; it!=dlist.end(); ++it )\n\t{\n\t\tlong value = 0;\n\n\t\tif( it->iotype == UniversalIO::DigitalInput || it->iotype == UniversalIO::DigitalOutput )\n\t\t\tvalue = shm->localGetState(it->dit,it->id) ? 1 : 0;\n\t\telse if( it->iotype == UniversalIO::AnalogInput || it->iotype == UniversalIO::AnalogOutput )\n\t\t\tvalue = shm->localGetValue(it->ait,it->id);\n\t\telse\n\t\t{\n\t\t\tdlog[Debug::CRIT] << myname << \"(update): Unknown iotype for sid=\" << it->id << endl;\n\t\t\tcontinue;\n\t\t}\n\n\t\tupdateItem(it,value);\n\t}\n}\n\/\/ -----------------------------------------------------------------------------\nvoid UNetSender::updateSensor( UniSetTypes::ObjectId id, long value )\n{\n\/\/\tcerr << myname << \": UPDATE SENSOR id=\" << id << \" value=\" << value << endl;\n\tDMap::iterator it=dlist.begin();\n\tfor( ; it!=dlist.end(); ++it )\n\t{\n\t\tif( it->id == id )\n\t\t{\n\t\t\tupdateItem( it, value );\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\/\/ -----------------------------------------------------------------------------\nvoid UNetSender::updateItem( DMap::iterator& it, long value )\n{\n\tif( it == dlist.end() )\n\t\treturn;\n\n\tif( it->iotype == UniversalIO::DigitalInput || it->iotype == UniversalIO::DigitalOutput )\n\t{\n\t\tUniSetTypes::uniset_mutex_lock l(pack_mutex,100);\n\t\tmypack.setDData(it->pack_ind,value);\n\t}\n\telse if( it->iotype == UniversalIO::AnalogInput || it->iotype == UniversalIO::AnalogOutput )\n\t{\n\t\tUniSetTypes::uniset_mutex_lock l(pack_mutex,100);\n\t\tmypack.setAData(it->pack_ind,value);\n\t}\n}\n\/\/ -----------------------------------------------------------------------------\nvoid UNetSender::send()\n{\n\tdlist.resize(maxItem);\n\tdlog[Debug::INFO] << myname << \"(send): dlist size = \" << dlist.size() << endl;\n\/*\n\tost::IPV4Broadcast h = s_host.c_str();\n\ttry\n\t{\t\t\t\n\t\tudp->setPeer(h,port);\n\t}\n\tcatch( ost::SockException& e )\n\t{\n\t\tostringstream s;\n\t\ts << e.getString() << \": \" << e.getSystemErrorString();\n\t\tdlog[Debug::CRIT] << myname << \"(poll): \" << s.str() << endl;\n\t\tthrow SystemError(s.str());\n\t}\n*\/\n\twhile( activated )\n\t{\n\t\ttry\n\t\t{\n\t\t\tif( !shm->isLocalwork() )\n\t\t\t\tupdateFromSM();\n\t\t\t\n\t\t\treal_send();\n\t\t}\n\t\tcatch( ost::SockException& e )\n\t\t{\n\t\t\tdlog[Debug::WARN]  << myname << \"(send): \" << e.getString() << endl;\n\t\t}\n\t\tcatch( UniSetTypes::Exception& ex)\n\t\t{\n\t\t\tdlog[Debug::WARN] << myname << \"(send): \" << ex << std::endl;\n\t\t}\n\t\tcatch( std::exception& e )\n\t\t{\n\t\t\tdlog[Debug::WARN] << myname << \"(send): \" << e.what() << std::endl;\n\t\t}\n\t\tcatch(...)\n\t\t{\n\t\t\tdlog[Debug::WARN] << myname << \"(send): catch ...\" << std::endl;\n\t\t}\t\n\n\t\tmsleep(sendpause);\n\t}\n\n\tdlog[Debug::INFO] << \"************* execute FINISH **********\" << endl;\n}\n\/\/ -----------------------------------------------------------------------------\nvoid UNetSender::real_send()\n{\n\tUniSetTypes::uniset_mutex_lock l(pack_mutex,300);\n\tmypack.msg.header.num = packetnum++;\n\n\tif( packetnum > UniSetUDP::MaxPacketNum )\n\t\tpacketnum = 1;\n\n\/\/\tcout << \"************* send header: \" << mypack.msg.header << endl;\n\/\/\tsize_t sz = mypack.byte_size() + sizeof(UniSetUDP::UDPHeader);\n\tsize_t sz =\tsizeof(UniSetUDP::DataPacket);\n\tif( !udp->isPending(ost::Socket::pendingOutput) )\n\t\treturn;\n\n\tsize_t ret = udp->send( (char*)&(mypack.msg),sz);\n\tif( ret < sz )\n\t\tdlog[Debug::CRIT] << myname << \"(real_send): FAILED ret=\" << ret << \" < sizeof=\" << sz << endl;\n}\n\/\/ -----------------------------------------------------------------------------\nvoid UNetSender::stop()\n{\n\tactivated = false;\n\/\/\ts_thr->stop();\n}\n\/\/ -----------------------------------------------------------------------------\nvoid UNetSender::start()\n{\n\tif( !activated )\n\t{\n\t\tactivated = true;\n\t\ts_thr->start();\n\t}\n}\n\/\/ -----------------------------------------------------------------------------\nvoid UNetSender::readConfiguration()\n{\n\txmlNode* root = conf->getXMLSensorsSection();\n\tif(!root)\n\t{\n\t\tostringstream err;\n\t\terr << myname << \"(readConfiguration): not found <sensors>\";\n\t\tthrow SystemError(err.str());\n\t}\n\n\tUniXML_iterator it(root);\n\tif( !it.goChildren() )\n\t{\n\t\tstd::cerr << myname << \"(readConfiguration): empty <sensors>?!!\" << endl;\n\t\treturn;\n\t}\n\n\tfor( ;it.getCurrent(); it.goNext() )\n\t{\n\t\tif( check_item(it) )\n\t\t\tinitItem(it);\n\t}\n}\n\/\/ ------------------------------------------------------------------------------------------\nbool UNetSender::check_item( UniXML_iterator& it )\n{\n\tif( s_field.empty() )\n\t\treturn true;\n\n\t\/\/ просто проверка на не пустой field\n\tif( s_fvalue.empty() && it.getProp(s_field).empty() )\n\t\treturn false;\n\n\t\/\/ просто проверка что field = value\n\tif( !s_fvalue.empty() && it.getProp(s_field)!=s_fvalue )\n\t\treturn false;\n\n\treturn true;\n}\n\/\/ ------------------------------------------------------------------------------------------\nbool UNetSender::readItem( UniXML& xml, UniXML_iterator& it, xmlNode* sec )\n{\n\tif( check_item(it) )\n\t\tinitItem(it);\n\treturn true;\n}\n\/\/ ------------------------------------------------------------------------------------------\nbool UNetSender::initItem( UniXML_iterator& it )\n{\n\tstring sname( it.getProp(\"name\") );\n\n\tstring tid(it.getProp(\"id\"));\n\t\n\tObjectId sid;\n\tif( !tid.empty() )\n\t{\n\t\tsid = UniSetTypes::uni_atoi(tid);\n\t\tif( sid <= 0 )\n\t\t\tsid = DefaultObjectId;\n\t}\n\telse\n\t\tsid = conf->getSensorID(sname);\n\n\tif( sid == DefaultObjectId )\n\t{\n\t\tif( dlog )\n\t\t\tdlog[Debug::CRIT] << myname << \"(readItem): ID not found for \"\n\t\t\t\t\t\t\t<< sname << endl;\n\t\treturn false;\n\t}\n\t\n\tUItem p;\n\tp.iotype = UniSetTypes::getIOType(it.getProp(\"iotype\"));\n\t\n\tif( p.iotype == UniversalIO::UnknownIOType )\n\t{\n\t\tdlog[Debug::CRIT] << myname << \"(readItem): Unknown iotype for sid=\" << sid << endl;\n\t\treturn false;\n\t}\n\n\tp.id = sid;\n\n\tif( p.iotype == UniversalIO::DigitalInput || p.iotype == UniversalIO::DigitalOutput )\n\t{\n\t\tp.pack_ind = mypack.addDData(sid,0);\n\t\tif ( p.pack_ind >= UniSetUDP::MaxDCount )\n\t\t{\n\t\t\tdlog[Debug::CRIT] << myname \n\t\t\t\t\t<< \"(readItem): OVERFLOW! MAX UDP DIGITAL DATA LIMIT! max=\" \n\t\t\t\t\t<< UniSetUDP::MaxDCount << endl;\n\t\t\treturn false;\n\t\t}\n\t}\n\telse if( p.iotype == UniversalIO::AnalogInput || p.iotype == UniversalIO::AnalogOutput )\n\t{\n\t\tp.pack_ind = mypack.addAData(sid,0);\n\t\tif ( p.pack_ind >= UniSetUDP::MaxACount )\n\t\t{\n\t\t\tdlog[Debug::CRIT] << myname \n\t\t\t\t\t<< \"(readItem): OVERFLOW! MAX UDP ANALOG DATA LIMIT! max=\" \n\t\t\t\t\t<< UniSetUDP::MaxACount << endl;\n\t\t\treturn false;\n\t\t}\n\t}\n\t\n\tif( maxItem >= dlist.size() )\n\t\tdlist.resize(maxItem+10);\n\t\n\tdlist[maxItem] = p;\n\tmaxItem++;\n\n\tif( dlog.debugging(Debug::INFO) )\n\t\tdlog[Debug::INFO] << myname << \"(initItem): add \" << p << endl;\n\n\treturn true;\n}\n\n\/\/ ------------------------------------------------------------------------------------------\nstd::ostream& operator<<( std::ostream& os, UNetSender::UItem& p )\n{\n\treturn os << \" sid=\" << p.id;\n}\n\/\/ -----------------------------------------------------------------------------\nvoid UNetSender::initIterators()\n{\n\tDMap::iterator it=dlist.begin();\n\tfor( ; it!=dlist.end(); it++ )\n\t{\n\t\tshm->initDIterator(it->dit);\n\t\tshm->initAIterator(it->ait);\n\t}\n}\n\/\/ -----------------------------------------------------------------------------\nvoid UNetSender::askSensors( UniversalIO::UIOCommand cmd )\n{\n\tDMap::iterator it=dlist.begin();\n\tfor( ; it!=dlist.end(); it++ )\n\t\tshm->askSensor(it->id,cmd);\n}\n\/\/ -----------------------------------------------------------------------------\n<|endoftext|>"}
{"text":"<commit_before>#include \"vm\/test\/test.hpp\"\n\n#include \"symboltable.hpp\"\n#include \"configuration.hpp\"\n#include \"builtin\/array.hpp\"\n\n#include <algorithm>\n#include <vector>\n\nclass TestSymbolTable : public CxxTest::TestSuite, public VMTest {\npublic:\n\n  SymbolTable* symbols;\n\n  void setUp() {\n    create();\n    symbols = new SymbolTable();\n  }\n\n  void tearDown() {\n    destroy();\n  }\n\n  void test_lookup_with_c_str() {\n    Object* sym = symbols->lookup(state, std::string(\"unique\"));\n    TS_ASSERT(sym->symbol_p());\n\n    Object* sym2 = symbols->lookup(state, std::string(\"unique\"));\n    TS_ASSERT_EQUALS(sym, sym2);\n  }\n\n  void test_lookup_with_empty_string() {\n    String* str = String::create(state, \"\");\n\n    if(LANGUAGE_18_ENABLED(state)) {\n      TS_ASSERT_THROWS_ASSERT(symbols->lookup(state, str), const RubyException &e,\n                              TS_ASSERT(Exception::argument_error_p(state, e.exception)));\n    } else {\n      Symbol* sym = symbols->lookup(state, str);\n      String* str2 = symbols->lookup_string(state, sym);\n      TS_ASSERT_EQUALS(Qtrue, str->equal(state, str2));\n    }\n\n  }\n\n  void test_lookup_with_null_character_in_string() {\n    String* str1 = String::create(state, \"\\0\", 1);\n    String* str2 = String::create(state, \"\\0\\0\", 2);\n\n    if(LANGUAGE_18_ENABLED(state)) {\n      TS_ASSERT_THROWS_ASSERT(symbols->lookup(state, str1), const RubyException &e,\n                              TS_ASSERT(Exception::argument_error_p(state, e.exception)));\n      TS_ASSERT_THROWS_ASSERT(symbols->lookup(state, str2), const RubyException &e,\n                              TS_ASSERT(Exception::argument_error_p(state, e.exception)));\n    } else {\n      Symbol* sym1 = symbols->lookup(state, str1);\n      Symbol* sym2 = symbols->lookup(state, str2);\n\n      TS_ASSERT(sym1 != sym2);\n\n      String* str3 = symbols->lookup_string(state, sym1);\n      String* str4 = symbols->lookup_string(state, sym2);\n\n      TS_ASSERT_EQUALS(Qtrue, str1->equal(state, str3));\n      TS_ASSERT_EQUALS(Qtrue, str2->equal(state, str4));\n      TS_ASSERT_EQUALS(symbols->size(), 2U);\n    }\n  }\n\n  void notest_lookup_colliding_hash() {\n    Object* sym;\n    Object* sym2;\n    const char* str = \"__uint_fast64_t\";\n    const char* str2 = \"TkIF_MOD\";\n\n    TS_ASSERT_EQUALS(String::hash_str((unsigned char*)str, std::strlen(str)),\n                     String::hash_str((unsigned char*)str2, std::strlen(str2)));\n\n    sym  = symbols->lookup(state, std::string(str));\n    sym2 = symbols->lookup(state, std::string(str2));\n\n    TS_ASSERT(sym != sym2);\n  }\n\n  void notest_lookup_colliding_hash2() {\n    String* a = String::create(state, \"__uint_fast64_t\");\n    String* b = String::create(state, \"TkIF_MOD\");\n\n    TS_ASSERT_EQUALS(a->hash_string(state), b->hash_string(state));\n\n    Object* sym;\n    Object* sym2;\n\n    sym  = symbols->lookup(state, a);\n    sym2 = symbols->lookup(state, b);\n\n    TS_ASSERT(sym != sym2);\n  }\n\n  void test_lookup_string() {\n    Symbol* sym = symbols->lookup(state, \"circle\");\n    String* str = symbols->lookup_string(state, sym);\n\n    TS_ASSERT(!strncmp(\"circle\", str->c_str(state), 6));\n  }\n\n  void test_lookup_nil() {\n    TS_ASSERT_THROWS_ASSERT(symbols->lookup(state, reinterpret_cast<String*>(Qnil)),\n                            const RubyException &e,\n                            TS_ASSERT(Exception::argument_error_p(state, e.exception)));\n  }\n\n  void test_lookup_string_nil() {\n    TS_ASSERT_THROWS_ASSERT(symbols->lookup_string(state, reinterpret_cast<Symbol*>(Qnil)),\n                            const RubyException &e,\n                            TS_ASSERT(Exception::argument_error_p(state, e.exception)));\n  }\n\n  void test_lookup_cstring_nil() {\n    TS_ASSERT_THROWS_ASSERT(symbols->lookup_cstring(state, reinterpret_cast<Symbol*>(Qnil)),\n                            const RubyException &e,\n                            TS_ASSERT(Exception::argument_error_p(state, e.exception)));\n  }\n\n  void test_size() {\n    symbols->lookup(state, \"uno\");\n    symbols->lookup(state, \"dos\");\n    symbols->lookup(state, \"tres\");\n\n    TS_ASSERT_EQUALS(symbols->size(), 3U);\n  }\n\n  void test_many_symbols() {\n    size_t size = symbols->size();\n\n    for(size_t i = 0; i < 100; i++) {\n      std::stringstream stream;\n      stream << \"sym\" << i;\n      symbols->lookup(state, stream.str().c_str());\n    }\n\n    TS_ASSERT(symbols->size() > size);\n  }\n\n  void test_all_as_array() {\n    std::vector<Symbol*> syms;\n\n    syms.push_back(symbols->lookup(state, \"__uint_fast64_t\"));\n    syms.push_back(symbols->lookup(state, \"ponies\"));\n    syms.push_back(symbols->lookup(state, \"cupcakes\"));\n    syms.push_back(symbols->lookup(state, \"TkIF_MOD\"));\n    syms.push_back(symbols->lookup(state, \"turtles\"));\n    syms.push_back(symbols->lookup(state, \"starts\"));\n\n    Array* ary = symbols->all_as_array(state);\n    TS_ASSERT_EQUALS(ary->size(), 6U);\n\n    for(size_t i = 0; i < ary->size(); i++) {\n      TS_ASSERT(std::find(syms.begin(), syms.end(), ary->get(state, i)) != syms.end());\n    }\n  }\n};\n<commit_msg>Fix usage of strlen in vm tests<commit_after>#include \"vm\/test\/test.hpp\"\n\n#include \"symboltable.hpp\"\n#include \"configuration.hpp\"\n#include \"builtin\/array.hpp\"\n\n#include <algorithm>\n#include <vector>\n#include <string.h>\n\nclass TestSymbolTable : public CxxTest::TestSuite, public VMTest {\npublic:\n\n  SymbolTable* symbols;\n\n  void setUp() {\n    create();\n    symbols = new SymbolTable();\n  }\n\n  void tearDown() {\n    destroy();\n  }\n\n  void test_lookup_with_c_str() {\n    Object* sym = symbols->lookup(state, std::string(\"unique\"));\n    TS_ASSERT(sym->symbol_p());\n\n    Object* sym2 = symbols->lookup(state, std::string(\"unique\"));\n    TS_ASSERT_EQUALS(sym, sym2);\n  }\n\n  void test_lookup_with_empty_string() {\n    String* str = String::create(state, \"\");\n\n    if(LANGUAGE_18_ENABLED(state)) {\n      TS_ASSERT_THROWS_ASSERT(symbols->lookup(state, str), const RubyException &e,\n                              TS_ASSERT(Exception::argument_error_p(state, e.exception)));\n    } else {\n      Symbol* sym = symbols->lookup(state, str);\n      String* str2 = symbols->lookup_string(state, sym);\n      TS_ASSERT_EQUALS(Qtrue, str->equal(state, str2));\n    }\n\n  }\n\n  void test_lookup_with_null_character_in_string() {\n    String* str1 = String::create(state, \"\\0\", 1);\n    String* str2 = String::create(state, \"\\0\\0\", 2);\n\n    if(LANGUAGE_18_ENABLED(state)) {\n      TS_ASSERT_THROWS_ASSERT(symbols->lookup(state, str1), const RubyException &e,\n                              TS_ASSERT(Exception::argument_error_p(state, e.exception)));\n      TS_ASSERT_THROWS_ASSERT(symbols->lookup(state, str2), const RubyException &e,\n                              TS_ASSERT(Exception::argument_error_p(state, e.exception)));\n    } else {\n      Symbol* sym1 = symbols->lookup(state, str1);\n      Symbol* sym2 = symbols->lookup(state, str2);\n\n      TS_ASSERT(sym1 != sym2);\n\n      String* str3 = symbols->lookup_string(state, sym1);\n      String* str4 = symbols->lookup_string(state, sym2);\n\n      TS_ASSERT_EQUALS(Qtrue, str1->equal(state, str3));\n      TS_ASSERT_EQUALS(Qtrue, str2->equal(state, str4));\n      TS_ASSERT_EQUALS(symbols->size(), 2U);\n    }\n  }\n\n  void notest_lookup_colliding_hash() {\n    Object* sym;\n    Object* sym2;\n    const char* str = \"__uint_fast64_t\";\n    const char* str2 = \"TkIF_MOD\";\n\n    TS_ASSERT_EQUALS(String::hash_str((unsigned char*)str, strlen(str)),\n                     String::hash_str((unsigned char*)str2, strlen(str2)));\n\n    sym  = symbols->lookup(state, std::string(str));\n    sym2 = symbols->lookup(state, std::string(str2));\n\n    TS_ASSERT(sym != sym2);\n  }\n\n  void notest_lookup_colliding_hash2() {\n    String* a = String::create(state, \"__uint_fast64_t\");\n    String* b = String::create(state, \"TkIF_MOD\");\n\n    TS_ASSERT_EQUALS(a->hash_string(state), b->hash_string(state));\n\n    Object* sym;\n    Object* sym2;\n\n    sym  = symbols->lookup(state, a);\n    sym2 = symbols->lookup(state, b);\n\n    TS_ASSERT(sym != sym2);\n  }\n\n  void test_lookup_string() {\n    Symbol* sym = symbols->lookup(state, \"circle\");\n    String* str = symbols->lookup_string(state, sym);\n\n    TS_ASSERT(!strncmp(\"circle\", str->c_str(state), 6));\n  }\n\n  void test_lookup_nil() {\n    TS_ASSERT_THROWS_ASSERT(symbols->lookup(state, reinterpret_cast<String*>(Qnil)),\n                            const RubyException &e,\n                            TS_ASSERT(Exception::argument_error_p(state, e.exception)));\n  }\n\n  void test_lookup_string_nil() {\n    TS_ASSERT_THROWS_ASSERT(symbols->lookup_string(state, reinterpret_cast<Symbol*>(Qnil)),\n                            const RubyException &e,\n                            TS_ASSERT(Exception::argument_error_p(state, e.exception)));\n  }\n\n  void test_lookup_cstring_nil() {\n    TS_ASSERT_THROWS_ASSERT(symbols->lookup_cstring(state, reinterpret_cast<Symbol*>(Qnil)),\n                            const RubyException &e,\n                            TS_ASSERT(Exception::argument_error_p(state, e.exception)));\n  }\n\n  void test_size() {\n    symbols->lookup(state, \"uno\");\n    symbols->lookup(state, \"dos\");\n    symbols->lookup(state, \"tres\");\n\n    TS_ASSERT_EQUALS(symbols->size(), 3U);\n  }\n\n  void test_many_symbols() {\n    size_t size = symbols->size();\n\n    for(size_t i = 0; i < 100; i++) {\n      std::stringstream stream;\n      stream << \"sym\" << i;\n      symbols->lookup(state, stream.str().c_str());\n    }\n\n    TS_ASSERT(symbols->size() > size);\n  }\n\n  void test_all_as_array() {\n    std::vector<Symbol*> syms;\n\n    syms.push_back(symbols->lookup(state, \"__uint_fast64_t\"));\n    syms.push_back(symbols->lookup(state, \"ponies\"));\n    syms.push_back(symbols->lookup(state, \"cupcakes\"));\n    syms.push_back(symbols->lookup(state, \"TkIF_MOD\"));\n    syms.push_back(symbols->lookup(state, \"turtles\"));\n    syms.push_back(symbols->lookup(state, \"starts\"));\n\n    Array* ary = symbols->all_as_array(state);\n    TS_ASSERT_EQUALS(ary->size(), 6U);\n\n    for(size_t i = 0; i < ary->size(); i++) {\n      TS_ASSERT(std::find(syms.begin(), syms.end(), ary->get(state, i)) != syms.end());\n    }\n  }\n};\n<|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/thread:$Id$\n\/\/ Author: Enric Tejedor, CERN  12\/09\/2016\n\n\/*************************************************************************\n * Copyright (C) 1995-2016, 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\/** \\class ROOT::TTreeProcessorMT\n    \\brief A class to process the entries of a TTree in parallel.\n \nBy means of its Process method, ROOT::TTreeProcessorMT provides a way to process the\nentries of a TTree in parallel. When invoking TTreeProcessor::Process, the user\npasses a function whose only parameter is a TTreeReader. The function iterates\non a subrange of entries by using that TTreeReader.\n\nThe implementation of ROOT::TTreeProcessorMT parallelizes the processing of the subranges,\neach corresponding to a cluster in the TTree. This is possible thanks to the use\nof a ROOT::TThreadedObject, so that each thread works with its own TFile and TTree\nobjects.\n*\/\n\n#include \"TROOT.h\"\n#include \"ROOT\/TTreeProcessorMT.hxx\"\n\n#include \"tbb\/task.h\"\n#include \"tbb\/task_group.h\"\n\nusing namespace ROOT;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Constructor based on a file name.\n\/\/\/ \\param[in] filename Name of the file containing the tree to process.\n\/\/\/ \\param[in] treename Name of the tree to process. If not provided,\n\/\/\/                     the implementation will automatically search for a\n\/\/\/                     tree in the file.\nTTreeProcessorMT::TTreeProcessorMT(std::string_view filename, std::string_view treename) : treeView(filename, treename) {}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Constructor based on a collection of file names.\n\/\/\/ \\param[in] filenames Collection of the names of the files containing the tree to process.\n\/\/\/ \\param[in] treename Name of the tree to process. If not provided,\n\/\/\/                     the implementation will automatically search for a\n\/\/\/                     tree in the collection of files.\nTTreeProcessorMT::TTreeProcessorMT(const std::vector<std::string_view>& filenames, std::string_view treename) : treeView(filenames, treename) {}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Constructor based on a TTree.\n\/\/\/ \\param[in] tree Tree or chain of files containing the tree to process.\nTTreeProcessorMT::TTreeProcessorMT(TTree& tree) : treeView(tree) {}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Process the entries of a TTree in parallel. The user-provided function\n\/\/\/ receives a TTreeReader which can be used to iterate on a subrange of\n\/\/\/ entries\n\/\/\/ ~~~{.cpp}\n\/\/\/ TTreeProcessorMT::Process([](TTreeReader& readerSubRange) {\n\/\/\/                            \/\/ Select branches to read\n\/\/\/                            while (readerSubRange.next()) {\n\/\/\/                                \/\/ Use content of current entry\n\/\/\/                            }\n\/\/\/                         });\n\/\/\/ ~~~\n\/\/\/ The user needs to be aware that each of the subranges can potentially\n\/\/\/ be processed in parallel. This means that the code of the user function\n\/\/\/ should be thread safe.\n\/\/\/ \n\/\/\/ \\param[in] func User-defined function that processes a subrange of entries\nvoid TTreeProcessorMT::Process(std::function<void(TTreeReader&)> func)\n{\n   \/\/ Enable this IMT use case (activate its locks)\n   Internal::TParTreeProcessingRAII ptpRAII;\n\n   \/\/ Create task group - assume number of threads has been initialized via ROOT::EnableImplicitMT\n   tbb::task_group g;\n\n   \/\/ Iterate over the collection of files\n   for (size_t i = 0; i < treeView->GetNumFiles(); ++i) {\n      treeView->SetCurrent(i);\n      auto clusterIter = treeView->GetClusterIterator();\n      Long64_t start = 0, end = 0;\n\n      \/\/ Iterate over the clusters in the current file and generate a task for each of them\n      while ((start = clusterIter()) < treeView->GetEntries()) {\n         end = clusterIter.GetNextEntry();\n\n         g.run([this, &func, start, end, i]() {\n            treeView->SetCurrent(i);\n            auto tr = treeView->GetTreeReader();\n            tr->SetEntriesRange(start, end);\n            func(*tr);\n         });\n      }\n   }\n\n   g.wait();\n}\n<commit_msg>remove white spaces<commit_after>\/\/ @(#)root\/thread:$Id$\n\/\/ Author: Enric Tejedor, CERN  12\/09\/2016\n\n\/*************************************************************************\n * Copyright (C) 1995-2016, 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\/** \\class ROOT::TTreeProcessorMT\n    \\brief A class to process the entries of a TTree in parallel.\n\nBy means of its Process method, ROOT::TTreeProcessorMT provides a way to process the\nentries of a TTree in parallel. When invoking TTreeProcessor::Process, the user\npasses a function whose only parameter is a TTreeReader. The function iterates\non a subrange of entries by using that TTreeReader.\n\nThe implementation of ROOT::TTreeProcessorMT parallelizes the processing of the subranges,\neach corresponding to a cluster in the TTree. This is possible thanks to the use\nof a ROOT::TThreadedObject, so that each thread works with its own TFile and TTree\nobjects.\n*\/\n\n#include \"TROOT.h\"\n#include \"ROOT\/TTreeProcessorMT.hxx\"\n\n#include \"tbb\/task.h\"\n#include \"tbb\/task_group.h\"\n\nusing namespace ROOT;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Constructor based on a file name.\n\/\/\/ \\param[in] filename Name of the file containing the tree to process.\n\/\/\/ \\param[in] treename Name of the tree to process. If not provided,\n\/\/\/                     the implementation will automatically search for a\n\/\/\/                     tree in the file.\nTTreeProcessorMT::TTreeProcessorMT(std::string_view filename, std::string_view treename) : treeView(filename, treename) {}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Constructor based on a collection of file names.\n\/\/\/ \\param[in] filenames Collection of the names of the files containing the tree to process.\n\/\/\/ \\param[in] treename Name of the tree to process. If not provided,\n\/\/\/                     the implementation will automatically search for a\n\/\/\/                     tree in the collection of files.\nTTreeProcessorMT::TTreeProcessorMT(const std::vector<std::string_view>& filenames, std::string_view treename) : treeView(filenames, treename) {}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Constructor based on a TTree.\n\/\/\/ \\param[in] tree Tree or chain of files containing the tree to process.\nTTreeProcessorMT::TTreeProcessorMT(TTree& tree) : treeView(tree) {}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Process the entries of a TTree in parallel. The user-provided function\n\/\/\/ receives a TTreeReader which can be used to iterate on a subrange of\n\/\/\/ entries\n\/\/\/ ~~~{.cpp}\n\/\/\/ TTreeProcessorMT::Process([](TTreeReader& readerSubRange) {\n\/\/\/                            \/\/ Select branches to read\n\/\/\/                            while (readerSubRange.next()) {\n\/\/\/                                \/\/ Use content of current entry\n\/\/\/                            }\n\/\/\/                         });\n\/\/\/ ~~~\n\/\/\/ The user needs to be aware that each of the subranges can potentially\n\/\/\/ be processed in parallel. This means that the code of the user function\n\/\/\/ should be thread safe.\n\/\/\/\n\/\/\/ \\param[in] func User-defined function that processes a subrange of entries\nvoid TTreeProcessorMT::Process(std::function<void(TTreeReader&)> func)\n{\n   \/\/ Enable this IMT use case (activate its locks)\n   Internal::TParTreeProcessingRAII ptpRAII;\n\n   \/\/ Create task group - assume number of threads has been initialized via ROOT::EnableImplicitMT\n   tbb::task_group g;\n\n   \/\/ Iterate over the collection of files\n   for (size_t i = 0; i < treeView->GetNumFiles(); ++i) {\n      treeView->SetCurrent(i);\n      auto clusterIter = treeView->GetClusterIterator();\n      Long64_t start = 0, end = 0;\n\n      \/\/ Iterate over the clusters in the current file and generate a task for each of them\n      while ((start = clusterIter()) < treeView->GetEntries()) {\n         end = clusterIter.GetNextEntry();\n\n         g.run([this, &func, start, end, i]() {\n            treeView->SetCurrent(i);\n            auto tr = treeView->GetTreeReader();\n            tr->SetEntriesRange(start, end);\n            func(*tr);\n         });\n      }\n   }\n\n   g.wait();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/treeplayer:$Id$\n\/\/ Author: Axel Naumann, 2011-09-28\n\n\/*************************************************************************\n * Copyright (C) 1995-2011, Rene Brun and Fons Rademakers and al.        *\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 \"TTreeReaderValue.h\"\n\n#include \"TTreeReader.h\"\n#include \"TBranchClones.h\"\n#include \"TBranchElement.h\"\n#include \"TBranchRef.h\"\n#include \"TBranchSTL.h\"\n#include \"TBranchProxyDirector.h\"\n#include \"TLeaf.h\"\n#include \"TTreeProxyGenerator.h\"\n#include \"TTreeReaderValue.h\"\n#include \"TRegexp.h\"\n#include \"TStreamerInfo.h\"\n#include \"TStreamerElement.h\"\n#include \"TNtuple.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/                                                                            \/\/\n\/\/ TTreeReaderValue                                                        \/\/\n\/\/                                                                            \/\/\n\/\/ Extracts data from a TTree.                                                \/\/\n\/\/                                                                            \/\/\n\/\/                                                                            \/\/\n\/\/                                                                            \/\/\n\/\/                                                                            \/\/\n\/\/                                                                            \/\/\n\/\/                                                                            \/\/\n\/\/                                                                            \/\/\n\/\/                                                                            \/\/\n\/\/                                                                            \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nClassImp(TTreeReaderValueBase)\n\n\/\/______________________________________________________________________________\nROOT::TTreeReaderValueBase::TTreeReaderValueBase(TTreeReader* reader \/*= 0*\/,\n                                                 const char* branchname \/*= 0*\/,\n                                                 TDictionary* dict \/*= 0*\/):\n   fBranchName(branchname),\n   fTreeReader(reader),\n   fDict(dict),\n   fProxy(NULL),\n   fLeaf(NULL),\n   fTreeLastOffset(-1),\n   fSetupStatus(kSetupNotSetup),\n   fReadStatus(kReadNothingYet)\n{\n   \/\/ Construct a tree value reader and register it with the reader object.\n   if (fTreeReader) fTreeReader->RegisterValueReader(this);\n}\n\n\/\/______________________________________________________________________________\nROOT::TTreeReaderValueBase::~TTreeReaderValueBase()\n{\n   \/\/ Unregister from tree reader, cleanup.\n   if (fTreeReader) fTreeReader->DeregisterValueReader(this);\n}\n\n\/\/______________________________________________________________________________\nROOT::TTreeReaderValueBase::EReadStatus\nROOT::TTreeReaderValueBase::ProxyRead() {\n   if (!fProxy) return kReadNothingYet;\n   if (fProxy->Read()) {\n      fReadStatus = kReadSuccess;\n   } else {\n      fReadStatus = kReadError;\n   }\n   return fReadStatus;\n}\n\n\/\/______________________________________________________________________________\nTLeaf* ROOT::TTreeReaderValueBase::GetLeaf() { \n   if (fLeafName.Length() > 0){\n\n      Long64_t newChainOffset = fTreeReader->GetTree()->GetChainOffset();\n\n      if (newChainOffset != fTreeLastOffset){\n         fTreeLastOffset = newChainOffset;\n\n         TTree *myTree = fTreeReader->GetTree();\n\n         if (!myTree) {\n            fReadStatus = kReadError;\n            Error(\"GetLeaf()\", \"Unable to get the tree from the TTreeReader\");\n            return 0;\n         }\n\n         TBranch *myBranch = myTree->GetBranch(fBranchName);\n\n         if (!myBranch) {\n            fReadStatus = kReadError;\n            Error(\"GetLeaf()\", \"Unable to get the branch from the tree\");\n            return 0;\n         }\n\n         fLeaf = myBranch->GetLeaf(fLeafName);\n         if (!fLeaf) {\n            Error(\"GetLeaf()\", \"Failed to get the leaf from the branch\");\n         }\n      }\n      return fLeaf;\n   }\n   else {\n      Error(\"GetLeaf()\", \"We are not reading a leaf\");\n      return 0;\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid* ROOT::TTreeReaderValueBase::GetAddress() {\n   if (ProxyRead() != kReadSuccess) return 0;\n\n   if (fLeafName.Length() > 0){\n      if (GetLeaf()){\n         return fLeaf->GetValuePointer();\n      }\n      else {\n         fReadStatus = kReadError;\n         Error(\"GetAddress()\", \"Unable to get the leaf\");\n         return 0;\n      }\n   }\n   return fProxy ? (Byte_t*)fProxy->GetWhere() : 0;\n}\n\n\/\/______________________________________________________________________________\nvoid ROOT::TTreeReaderValueBase::CreateProxy() {\n   \/\/ Create the proxy object for our branch.\n   if (fProxy) {\n      return;\n   }\n   if (!fTreeReader) {\n      Error(\"CreateProxy()\", \"TTreeReader object not set \/ available for branch %s!\",\n            fBranchName.Data());\n      return;\n   }\n   if (!fDict) {\n      TBranch* br = fTreeReader->GetTree()->GetBranch(fBranchName);\n      const char* brDataType = \"{UNDETERMINED}\";\n      if (br) {\n         TDictionary* brDictUnused = 0;\n         brDataType = GetBranchDataType(br, brDictUnused);\n      }\n      Error(\"CreateProxy()\", \"The template argument type T of %s accessing branch %s (which contains data of type %s) is not known to ROOT. You will need to create a dictionary for it.\",\n            GetDerivedTypeName(), fBranchName.Data(), brDataType);\n      return;\n   }\n\n   \/\/ Search for the branchname, determine what it contains, and wire the\n   \/\/ TBranchProxy representing it to us so we can access its data.\n\n   ROOT::TNamedBranchProxy* namedProxy\n      = (ROOT::TNamedBranchProxy*)fTreeReader->FindObject(fBranchName);\n   if (namedProxy && namedProxy->GetDict() == fDict) {\n      fProxy = namedProxy->GetProxy();\n      return;\n   }\n\n   TBranch* branch = fTreeReader->GetTree()->GetBranch(fBranchName);\n   TLeaf *myLeaf = NULL;\n   TDictionary* branchActualType = 0;\n\n   if (!branch) {\n      if (fBranchName.Contains(\".\")){\n         TRegexp leafNameExpression (\"\\\\.[a-zA-Z0-9]+$\");\n         TString leafName (fBranchName(leafNameExpression));\n         TString branchName = fBranchName(0, fBranchName.Length() - leafName.Length());\n         branch = fTreeReader->GetTree()->GetBranch(branchName);\n         if (!branch){\n            Error(\"CreateProxy()\", \"The tree does not have a branch called %s. You could check with TTree::Print() for available branches.\", fBranchName.Data());\n            fProxy = 0;\n            return;\n         }\n         else {\n            myLeaf = branch->GetLeaf(TString(leafName(1, leafName.Length())));\n            if (!myLeaf){\n               Error(\"CreateProxy()\", \"The tree does not have a branch, nor a sub-branch called %s. You could check with TTree::Print() for available branches.\", fBranchName.Data());\n            }\n            else {\n               TDictionary *tempDict = TDictionary::GetDictionary(myLeaf->GetTypeName());\n               if (tempDict && tempDict->IsA() == TDataType::Class() && TDictionary::GetDictionary(((TDataType*)tempDict)->GetTypeName()) == fDict){\n                  \/\/fLeafOffset = myLeaf->GetOffset() \/ 4;\n                  branchActualType = fDict;\n                  fLeaf = myLeaf;\n                  fBranchName = branchName;\n                  fLeafName = leafName(1, leafName.Length());\n               }\n               else {\n                  Error(\"CreateProxy()\", \"Leaf of type %s cannot be read by TTreeReaderValue<%s>.\", myLeaf->GetTypeName(), fDict->GetName());\n               }\n            }\n         }\n      }\n      else {\n         Error(\"CreateProxy()\", \"The tree does not have a branch called %s. You could check with TTree::Print() for available branches.\", fBranchName.Data());\n         fProxy = 0;\n         return;\n      }\n   }\n\n   if (!myLeaf){\n      const char* branchActualTypeName = GetBranchDataType(branch, branchActualType);\n\n      if (!branchActualType) {\n         Error(\"CreateProxy()\", \"The branch %s contains data of type %s, which does not have a dictionary.\",\n               fBranchName.Data(), branchActualTypeName ? branchActualTypeName : \"{UNDETERMINED TYPE}\");\n         fProxy = 0;\n         return;\n      }\n\n      if (fDict != branchActualType) {\n         Error(\"CreateProxy()\", \"The branch %s contains data of type %s. It cannot be accessed by a TTreeReaderValue<%s>\",\n               fBranchName.Data(), branchActualType->GetName(), fDict->GetName());\n         return;\n      }\n   }\n   \n\n   \/\/ Update named proxy's dictionary\n   if (namedProxy && !namedProxy->GetDict()) {\n      namedProxy->SetDict(fDict);\n      fProxy = namedProxy->GetProxy();\n      return;\n   }\n\n   \/\/ Search for the branchname, determine what it contains, and wire the\n   \/\/ TBranchProxy representing it to us so we can access its data.\n   \/\/ A proxy for branch must not have been created before (i.e. check\n   \/\/ fProxies before calling this function!)\n\n   TString membername;\n\n   bool isTopLevel = branch->GetMother() == branch;\n   if (!isTopLevel) {\n      membername = strrchr(branch->GetName(), '.');\n      if (membername.IsNull()) {\n         membername = branch->GetName();\n      }\n   }\n   namedProxy = new ROOT::TNamedBranchProxy(fTreeReader->fDirector, branch, membername);\n   fTreeReader->GetProxies()->Add(namedProxy);\n   fProxy = namedProxy->GetProxy();\n}\n\n\/\/______________________________________________________________________________\nconst char* ROOT::TTreeReaderValueBase::GetBranchDataType(TBranch* branch,\n                                           TDictionary* &dict) const\n{\n   \/\/ Retrieve the type of data stored by branch; put its dictionary into\n   \/\/ dict, return its type name. If no dictionary is available, at least\n   \/\/ its type name should be returned.\n\n   dict = 0;\n   if (branch->IsA() == TBranchElement::Class()) {\n      TBranchElement* brElement = (TBranchElement*)branch;\n      if (brElement->GetType() == TBranchElement::kSTLNode || \n            brElement->GetType() == TBranchElement::kLeafNode || \n            brElement->GetType() == TBranchElement::kObjectNode) {\n\n         TStreamerInfo *streamerInfo = brElement->GetInfo();\n         Int_t id = brElement->GetID();\n\n         if (id >= 0){\n            TStreamerElement *element = (TStreamerElement*)streamerInfo->GetElements()->At(id);\n            if (element->IsA() == TStreamerSTL::Class()){\n               TStreamerSTL *myStl = (TStreamerSTL*)element;\n               dict = myStl->GetClass();\n               return 0;\n            }\n         }\n\n         if (brElement->GetTypeName()) dict = TDictionary::GetDictionary(brElement->GetTypeName());\n         if (dict && dict->IsA() == TDataType::Class()){\n            dict = TDictionary::GetDictionary(((TDataType*)dict)->GetTypeName());\n            if (dict != fDict){\n               dict = TClass::GetClass(brElement->GetTypeName());\n            }\n            if (dict != fDict){\n               dict = brElement->GetCurrentClass();\n            }\n         }\n         else if (!dict) {\n            dict = brElement->GetCurrentClass();\n         }\n\n         return brElement->GetTypeName();\n      } else if (brElement->GetType() == TBranchElement::kClonesNode) {\n         dict = TClonesArray::Class();\n         return \"TClonesArray\";\n      } else if (brElement->GetType() == 31\n                 || brElement->GetType() == 41) {\n         \/\/ it's a member, extract from GetClass()'s streamer info\n         Error(\"GetBranchDataType()\", \"Must use TTreeReaderValueArray to access a member of an object that is stored in a collection.\");\n      }\n      else {\n         Error(\"GetBranchDataType()\", \"Unknown type and class combination: %i, %s\", brElement->GetType(), brElement->GetClassName());\n      }\n      return 0;\n   } else if (branch->IsA() == TBranch::Class()\n              || branch->IsA() == TBranchObject::Class()\n              || branch->IsA() == TBranchSTL::Class()) {\n      if (branch->GetTree()->IsA() == TNtuple::Class()){\n         dict = TDataType::GetDataType(kFloat_t);\n         return dict->GetName();\n      }\n      const char* dataTypeName = branch->GetClassName();\n      if ((!dataTypeName || !dataTypeName[0])\n          && branch->IsA() == TBranch::Class()) {\n         TLeaf *myLeaf = branch->GetLeaf(branch->GetName());\n         if (myLeaf){\n            dict = TDictionary::GetDictionary(((TDataType*)TDictionary::GetDictionary(myLeaf->GetTypeName()))->GetTypeName());\n            return myLeaf->GetTypeName();\n         }\n\n\n         \/\/ leaflist. Can't represent.\n         Error(\"GetBranchDataType()\", \"The branch %s was created using a leaf list and cannot be represented as a C++ type. Please access one of its siblings using a TTreeReaderValueArray:\", branch->GetName());\n         TIter iLeaves(branch->GetListOfLeaves());\n         TLeaf* leaf = 0;\n         while ((leaf = (TLeaf*) iLeaves())) {\n            Error(\"GetBranchDataType()\", \"   %s.%s\", branch->GetName(), leaf->GetName());\n         }\n         return 0;\n      }\n      if (dataTypeName) dict = TDictionary::GetDictionary(dataTypeName);\n      return dataTypeName;\n   } else if (branch->IsA() == TBranchClones::Class()) {\n      dict = TClonesArray::Class();\n      return \"TClonesArray\";\n   } else if (branch->IsA() == TBranchRef::Class()) {\n      \/\/ Can't represent.\n      Error(\"GetBranchDataType()\", \"The branch %s is a TBranchRef and cannot be represented as a C++ type.\", branch->GetName());\n      return 0;\n   } else {\n      Error(\"GetBranchDataType()\", \"The branch %s is of type %s - something that is not handled yet.\", branch->GetName(), branch->IsA()->GetName());\n      return 0;\n   }\n\n   return 0;\n}\n\n<commit_msg>Checking dictionary type and getting data type with numerical value<commit_after>\/\/ @(#)root\/treeplayer:$Id$\n\/\/ Author: Axel Naumann, 2011-09-28\n\n\/*************************************************************************\n * Copyright (C) 1995-2011, Rene Brun and Fons Rademakers and al.        *\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 \"TTreeReaderValue.h\"\n\n#include \"TTreeReader.h\"\n#include \"TBranchClones.h\"\n#include \"TBranchElement.h\"\n#include \"TBranchRef.h\"\n#include \"TBranchSTL.h\"\n#include \"TBranchProxyDirector.h\"\n#include \"TLeaf.h\"\n#include \"TTreeProxyGenerator.h\"\n#include \"TTreeReaderValue.h\"\n#include \"TRegexp.h\"\n#include \"TStreamerInfo.h\"\n#include \"TStreamerElement.h\"\n#include \"TNtuple.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/                                                                            \/\/\n\/\/ TTreeReaderValue                                                        \/\/\n\/\/                                                                            \/\/\n\/\/ Extracts data from a TTree.                                                \/\/\n\/\/                                                                            \/\/\n\/\/                                                                            \/\/\n\/\/                                                                            \/\/\n\/\/                                                                            \/\/\n\/\/                                                                            \/\/\n\/\/                                                                            \/\/\n\/\/                                                                            \/\/\n\/\/                                                                            \/\/\n\/\/                                                                            \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nClassImp(TTreeReaderValueBase)\n\n\/\/______________________________________________________________________________\nROOT::TTreeReaderValueBase::TTreeReaderValueBase(TTreeReader* reader \/*= 0*\/,\n                                                 const char* branchname \/*= 0*\/,\n                                                 TDictionary* dict \/*= 0*\/):\n   fBranchName(branchname),\n   fTreeReader(reader),\n   fDict(dict),\n   fProxy(NULL),\n   fLeaf(NULL),\n   fTreeLastOffset(-1),\n   fSetupStatus(kSetupNotSetup),\n   fReadStatus(kReadNothingYet)\n{\n   \/\/ Construct a tree value reader and register it with the reader object.\n   if (fTreeReader) fTreeReader->RegisterValueReader(this);\n}\n\n\/\/______________________________________________________________________________\nROOT::TTreeReaderValueBase::~TTreeReaderValueBase()\n{\n   \/\/ Unregister from tree reader, cleanup.\n   if (fTreeReader) fTreeReader->DeregisterValueReader(this);\n}\n\n\/\/______________________________________________________________________________\nROOT::TTreeReaderValueBase::EReadStatus\nROOT::TTreeReaderValueBase::ProxyRead() {\n   if (!fProxy) return kReadNothingYet;\n   if (fProxy->Read()) {\n      fReadStatus = kReadSuccess;\n   } else {\n      fReadStatus = kReadError;\n   }\n   return fReadStatus;\n}\n\n\/\/______________________________________________________________________________\nTLeaf* ROOT::TTreeReaderValueBase::GetLeaf() { \n   if (fLeafName.Length() > 0){\n\n      Long64_t newChainOffset = fTreeReader->GetTree()->GetChainOffset();\n\n      if (newChainOffset != fTreeLastOffset){\n         fTreeLastOffset = newChainOffset;\n\n         TTree *myTree = fTreeReader->GetTree();\n\n         if (!myTree) {\n            fReadStatus = kReadError;\n            Error(\"GetLeaf()\", \"Unable to get the tree from the TTreeReader\");\n            return 0;\n         }\n\n         TBranch *myBranch = myTree->GetBranch(fBranchName);\n\n         if (!myBranch) {\n            fReadStatus = kReadError;\n            Error(\"GetLeaf()\", \"Unable to get the branch from the tree\");\n            return 0;\n         }\n\n         fLeaf = myBranch->GetLeaf(fLeafName);\n         if (!fLeaf) {\n            Error(\"GetLeaf()\", \"Failed to get the leaf from the branch\");\n         }\n      }\n      return fLeaf;\n   }\n   else {\n      Error(\"GetLeaf()\", \"We are not reading a leaf\");\n      return 0;\n   }\n}\n\n\/\/______________________________________________________________________________\nvoid* ROOT::TTreeReaderValueBase::GetAddress() {\n   if (ProxyRead() != kReadSuccess) return 0;\n\n   if (fLeafName.Length() > 0){\n      if (GetLeaf()){\n         return fLeaf->GetValuePointer();\n      }\n      else {\n         fReadStatus = kReadError;\n         Error(\"GetAddress()\", \"Unable to get the leaf\");\n         return 0;\n      }\n   }\n   return fProxy ? (Byte_t*)fProxy->GetWhere() : 0;\n}\n\n\/\/______________________________________________________________________________\nvoid ROOT::TTreeReaderValueBase::CreateProxy() {\n   \/\/ Create the proxy object for our branch.\n   if (fProxy) {\n      return;\n   }\n   if (!fTreeReader) {\n      Error(\"CreateProxy()\", \"TTreeReader object not set \/ available for branch %s!\",\n            fBranchName.Data());\n      return;\n   }\n   if (!fDict) {\n      TBranch* br = fTreeReader->GetTree()->GetBranch(fBranchName);\n      const char* brDataType = \"{UNDETERMINED}\";\n      if (br) {\n         TDictionary* brDictUnused = 0;\n         brDataType = GetBranchDataType(br, brDictUnused);\n      }\n      Error(\"CreateProxy()\", \"The template argument type T of %s accessing branch %s (which contains data of type %s) is not known to ROOT. You will need to create a dictionary for it.\",\n            GetDerivedTypeName(), fBranchName.Data(), brDataType);\n      return;\n   }\n\n   \/\/ Search for the branchname, determine what it contains, and wire the\n   \/\/ TBranchProxy representing it to us so we can access its data.\n\n   ROOT::TNamedBranchProxy* namedProxy\n      = (ROOT::TNamedBranchProxy*)fTreeReader->FindObject(fBranchName);\n   if (namedProxy && namedProxy->GetDict() == fDict) {\n      fProxy = namedProxy->GetProxy();\n      return;\n   }\n\n   TBranch* branch = fTreeReader->GetTree()->GetBranch(fBranchName);\n   TLeaf *myLeaf = NULL;\n   TDictionary* branchActualType = 0;\n\n   if (!branch) {\n      if (fBranchName.Contains(\".\")){\n         TRegexp leafNameExpression (\"\\\\.[a-zA-Z0-9]+$\");\n         TString leafName (fBranchName(leafNameExpression));\n         TString branchName = fBranchName(0, fBranchName.Length() - leafName.Length());\n         branch = fTreeReader->GetTree()->GetBranch(branchName);\n         if (!branch){\n            Error(\"CreateProxy()\", \"The tree does not have a branch called %s. You could check with TTree::Print() for available branches.\", fBranchName.Data());\n            fProxy = 0;\n            return;\n         }\n         else {\n            myLeaf = branch->GetLeaf(TString(leafName(1, leafName.Length())));\n            if (!myLeaf){\n               Error(\"CreateProxy()\", \"The tree does not have a branch, nor a sub-branch called %s. You could check with TTree::Print() for available branches.\", fBranchName.Data());\n            }\n            else {\n               TDictionary *tempDict = TDictionary::GetDictionary(myLeaf->GetTypeName());\n               if (tempDict && tempDict->IsA() == TDataType::Class() && TDictionary::GetDictionary(((TDataType*)tempDict)->GetTypeName()) == fDict){\n                  \/\/fLeafOffset = myLeaf->GetOffset() \/ 4;\n                  branchActualType = fDict;\n                  fLeaf = myLeaf;\n                  fBranchName = branchName;\n                  fLeafName = leafName(1, leafName.Length());\n               }\n               else {\n                  Error(\"CreateProxy()\", \"Leaf of type %s cannot be read by TTreeReaderValue<%s>.\", myLeaf->GetTypeName(), fDict->GetName());\n               }\n            }\n         }\n      }\n      else {\n         Error(\"CreateProxy()\", \"The tree does not have a branch called %s. You could check with TTree::Print() for available branches.\", fBranchName.Data());\n         fProxy = 0;\n         return;\n      }\n   }\n\n   if (!myLeaf){\n      const char* branchActualTypeName = GetBranchDataType(branch, branchActualType);\n\n      if (!branchActualType) {\n         Error(\"CreateProxy()\", \"The branch %s contains data of type %s, which does not have a dictionary.\",\n               fBranchName.Data(), branchActualTypeName ? branchActualTypeName : \"{UNDETERMINED TYPE}\");\n         fProxy = 0;\n         return;\n      }\n\n      if (fDict != branchActualType) {\n         Error(\"CreateProxy()\", \"The branch %s contains data of type %s. It cannot be accessed by a TTreeReaderValue<%s>\",\n               fBranchName.Data(), branchActualType->GetName(), fDict->GetName());\n         return;\n      }\n   }\n   \n\n   \/\/ Update named proxy's dictionary\n   if (namedProxy && !namedProxy->GetDict()) {\n      namedProxy->SetDict(fDict);\n      fProxy = namedProxy->GetProxy();\n      return;\n   }\n\n   \/\/ Search for the branchname, determine what it contains, and wire the\n   \/\/ TBranchProxy representing it to us so we can access its data.\n   \/\/ A proxy for branch must not have been created before (i.e. check\n   \/\/ fProxies before calling this function!)\n\n   TString membername;\n\n   bool isTopLevel = branch->GetMother() == branch;\n   if (!isTopLevel) {\n      membername = strrchr(branch->GetName(), '.');\n      if (membername.IsNull()) {\n         membername = branch->GetName();\n      }\n   }\n   namedProxy = new ROOT::TNamedBranchProxy(fTreeReader->fDirector, branch, membername);\n   fTreeReader->GetProxies()->Add(namedProxy);\n   fProxy = namedProxy->GetProxy();\n}\n\n\/\/______________________________________________________________________________\nconst char* ROOT::TTreeReaderValueBase::GetBranchDataType(TBranch* branch,\n                                           TDictionary* &dict) const\n{\n   \/\/ Retrieve the type of data stored by branch; put its dictionary into\n   \/\/ dict, return its type name. If no dictionary is available, at least\n   \/\/ its type name should be returned.\n\n   dict = 0;\n   if (branch->IsA() == TBranchElement::Class()) {\n      TBranchElement* brElement = (TBranchElement*)branch;\n      if (brElement->GetType() == TBranchElement::kSTLNode || \n            brElement->GetType() == TBranchElement::kLeafNode || \n            brElement->GetType() == TBranchElement::kObjectNode) {\n\n         TStreamerInfo *streamerInfo = brElement->GetInfo();\n         Int_t id = brElement->GetID();\n\n         if (id >= 0){\n            TStreamerElement *element = (TStreamerElement*)streamerInfo->GetElements()->At(id);\n            if (element->IsA() == TStreamerSTL::Class()){\n               TStreamerSTL *myStl = (TStreamerSTL*)element;\n               dict = myStl->GetClass();\n               return 0;\n            }\n         }\n\n         if (brElement->GetTypeName()) dict = TDictionary::GetDictionary(brElement->GetTypeName());\n         if (dict && dict->IsA() == TDataType::Class()){\n            dict = TDictionary::GetDictionary(((TDataType*)dict)->GetTypeName());\n            if (dict != fDict){\n               dict = TClass::GetClass(brElement->GetTypeName());\n            }\n            if (dict != fDict){\n               dict = brElement->GetCurrentClass();\n            }\n         }\n         else if (!dict) {\n            dict = brElement->GetCurrentClass();\n         }\n\n         return brElement->GetTypeName();\n      } else if (brElement->GetType() == TBranchElement::kClonesNode) {\n         dict = TClonesArray::Class();\n         return \"TClonesArray\";\n      } else if (brElement->GetType() == 31\n                 || brElement->GetType() == 41) {\n         \/\/ it's a member, extract from GetClass()'s streamer info\n         Error(\"GetBranchDataType()\", \"Must use TTreeReaderValueArray to access a member of an object that is stored in a collection.\");\n      }\n      else {\n         Error(\"GetBranchDataType()\", \"Unknown type and class combination: %i, %s\", brElement->GetType(), brElement->GetClassName());\n      }\n      return 0;\n   } else if (branch->IsA() == TBranch::Class()\n              || branch->IsA() == TBranchObject::Class()\n              || branch->IsA() == TBranchSTL::Class()) {\n      if (branch->GetTree()->IsA() == TNtuple::Class()){\n         dict = TDataType::GetDataType(kFloat_t);\n         return dict->GetName();\n      }\n      const char* dataTypeName = branch->GetClassName();\n      if ((!dataTypeName || !dataTypeName[0])\n          && branch->IsA() == TBranch::Class()) {\n         TLeaf *myLeaf = branch->GetLeaf(branch->GetName());\n         if (myLeaf){\n            TDictionary *myDataType = TDictionary::GetDictionary(myLeaf->GetTypeName());\n            if (myDataType->IsA() == TDataType::Class()){\n               dict = TDataType::GetDataType((EDataType)((TDataType*)myDataType)->GetType());\n               return myLeaf->GetTypeName();\n            }\n         }\n\n\n         \/\/ leaflist. Can't represent.\n         Error(\"GetBranchDataType()\", \"The branch %s was created using a leaf list and cannot be represented as a C++ type. Please access one of its siblings using a TTreeReaderValueArray:\", branch->GetName());\n         TIter iLeaves(branch->GetListOfLeaves());\n         TLeaf* leaf = 0;\n         while ((leaf = (TLeaf*) iLeaves())) {\n            Error(\"GetBranchDataType()\", \"   %s.%s\", branch->GetName(), leaf->GetName());\n         }\n         return 0;\n      }\n      if (dataTypeName) dict = TDictionary::GetDictionary(dataTypeName);\n      return dataTypeName;\n   } else if (branch->IsA() == TBranchClones::Class()) {\n      dict = TClonesArray::Class();\n      return \"TClonesArray\";\n   } else if (branch->IsA() == TBranchRef::Class()) {\n      \/\/ Can't represent.\n      Error(\"GetBranchDataType()\", \"The branch %s is a TBranchRef and cannot be represented as a C++ type.\", branch->GetName());\n      return 0;\n   } else {\n      Error(\"GetBranchDataType()\", \"The branch %s is of type %s - something that is not handled yet.\", branch->GetName(), branch->IsA()->GetName());\n      return 0;\n   }\n\n   return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef MJOLNIR_TEST_MAKE_EMPTY_INPUT_HPP\n#define MJOLNIR_TEST_MAKE_EMPTY_INPUT_HPP\n#include <extlib\/toml\/toml.hpp>\n#include <mjolnir\/util\/string.hpp>\n\nnamespace mjolnir\n{\nnamespace test\n{\n\n\/\/ make a minimal input file that contains no particle, no forcefield.\n\/\/ It contains only parameters that are needed to pass read_input() functions.\ninline toml::Table make_empty_input()\n{\n    using namespace mjolnir::literals::string_literals;\n\n    toml::Table general;\n    general[\"precision\"]     = \"double\"_s;\n    general[\"boundary\"]      = \"Unlimited\"_s;\n    general[\"output_prefix\"] = \"nothing\"_s;\n    general[\"output_path\"]   = \".\/\"_s;\n\n    toml::Table units;\n    units[\"length\"] = \"angstrom\"_s;\n    units[\"energy\"] = \"kcal\/mol\"_s;\n\n    \/\/ Mjolnir does not consider running simulation without simulator\n    \/\/ (that does not make sense!) . Here, temporary set MD simulator with\n    \/\/ Newtonian dynamics.\n    toml::Table simulator;\n    simulator[\"type\"]       = \"Molecular Dynamics\"_s;\n    simulator[\"scheme\"]     = \"Newtonian\"_s;\n    simulator[\"total_step\"] = 1;\n    simulator[\"save_step\"]  = 1;\n    simulator[\"delta_t\"]    = 0.1;\n\n    \/\/ Mjolnir requires a system to simulate, even if it has no particle.\n    toml::Table system;\n    system[\"attributes\"] = toml::Table{{\"temperature\"_s, toml::value(300.0)}};\n    system[\"boundary\"]   = toml::Table(); \/\/ no boundary\n    system[\"particles\"]  = toml::Array(); \/\/ no particle\n    toml::Array systems(1, std::move(system));\n\n    \/\/ \"empty forcefields\" completely make sense because essentially any kind of\n    \/\/ forcefields are a sum of several potential terms. Forcefield that has\n    \/\/ zero term means an ideal system having no interaction.\n    toml::Array forcefields;\n\n    toml::Table input;\n    input[\"general\"]     = std::move(general);\n    input[\"units\"]       = std::move(units);\n    input[\"simulator\"]   = std::move(simulator);\n    input[\"systems\"]     = std::move(systems);\n    input[\"forcefields\"] = std::move(forcefields);\n\n    return input;\n}\n\n} \/\/ test\n} \/\/ mjolnir\n#endif\/\/ MJOLNIR_TEST_MAKE_EMPTY_INPUT_HPP\n<commit_msg>add empty forcefield<commit_after>#ifndef MJOLNIR_TEST_MAKE_EMPTY_INPUT_HPP\n#define MJOLNIR_TEST_MAKE_EMPTY_INPUT_HPP\n#include <extlib\/toml\/toml.hpp>\n#include <mjolnir\/util\/string.hpp>\n\nnamespace mjolnir\n{\nnamespace test\n{\n\n\/\/ make a minimal input file that contains no particle, no forcefield.\n\/\/ It contains only parameters that are needed to pass read_input() functions.\ninline toml::Table make_empty_input()\n{\n    using namespace mjolnir::literals::string_literals;\n\n    toml::Table general;\n    general[\"precision\"]     = \"double\"_s;\n    general[\"boundary\"]      = \"Unlimited\"_s;\n    general[\"output_prefix\"] = \"nothing\"_s;\n    general[\"output_path\"]   = \".\/\"_s;\n\n    toml::Table units;\n    units[\"length\"] = \"angstrom\"_s;\n    units[\"energy\"] = \"kcal\/mol\"_s;\n\n    \/\/ Mjolnir does not consider running simulation without simulator\n    \/\/ (that does not make sense!) . Here, temporary set MD simulator with\n    \/\/ Newtonian dynamics.\n    toml::Table simulator;\n    simulator[\"type\"]       = \"Molecular Dynamics\"_s;\n    simulator[\"scheme\"]     = \"Newtonian\"_s;\n    simulator[\"total_step\"] = 1;\n    simulator[\"save_step\"]  = 1;\n    simulator[\"delta_t\"]    = 0.1;\n\n    \/\/ Mjolnir requires a system to simulate, even if it has no particle.\n    toml::Table system;\n    system[\"attributes\"] = toml::Table{{\"temperature\"_s, toml::value(300.0)}};\n    system[\"boundary\"]   = toml::Table(); \/\/ no boundary\n    system[\"particles\"]  = toml::Array(); \/\/ no particle\n    toml::Array systems(1, std::move(system));\n\n    \/\/ \"empty forcefields\" completely make sense because essentially any kind of\n    \/\/ forcefields are a sum of several potential terms. Forcefield that has\n    \/\/ zero term means an ideal system having no interaction.\n    toml::Array forcefields(1, toml::Table(\/* nothing! *\/));\n\n    toml::Table input;\n    input[\"general\"]     = std::move(general);\n    input[\"units\"]       = std::move(units);\n    input[\"simulator\"]   = std::move(simulator);\n    input[\"systems\"]     = std::move(systems);\n    input[\"forcefields\"] = std::move(forcefields);\n\n    return input;\n}\n\n} \/\/ test\n} \/\/ mjolnir\n#endif\/\/ MJOLNIR_TEST_MAKE_EMPTY_INPUT_HPP\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\/\/--- test modules used --------------------------------------------------------\n#include \"TestSuite.h\"\n\n\/\/--- interface include --------------------------------------------------------\n#include \"AnythingPerfTest.h\"\n\n\/\/--- standard modules used ----------------------------------------------------\n#include \"StringStream.h\"\n#include \"Dbg.h\"\n#include \"DiffTimer.h\"\n#include \"PoolAllocator.h\"\n#include \"System.h\"\n\n\/\/--- c-library modules used ---------------------------------------------------\n\n\/\/---- AnythingPerfTest ----------------------------------------------------------------\nAnythingPerfTest::AnythingPerfTest(TString tstrName) : StatisticTestCase(tstrName)\n{\n\tStartTrace(AnythingPerfTest.Ctor);\n}\n\nAnythingPerfTest::~AnythingPerfTest()\n{\n\tStartTrace(AnythingPerfTest.Dtor);\n}\n\nvoid AnythingPerfTest::setUp()\n{\n\tStartTrace(AnythingPerfTest.setUp);\n\tStatisticTestCase::setUp();\n}\n\nvoid AnythingPerfTest::tearDown()\n{\n\tStartTrace(AnythingPerfTest.tearDown);\n\tStatisticTestCase::tearDown();\n}\n\nvoid AnythingPerfTest::RunIndexLoopAsCharPtr(long index, const Anything &a, const long iterations)\n{\n\tDiffTimer dt;\n\tString out;\n\tfor (long i = 0; i < iterations; i++) {\n\t\tout = a[index].AsCharPtr(\"lookup hallo\");\n\t}\n\tlong lDiff = dt.Diff();\n\tString strName(\"IndexLoopAsCharPtr\");\n\tAddStatisticOutput(strName << iterations, lDiff);\n}\n\nvoid AnythingPerfTest::RunIndexLoopAsString(long index, const Anything &a, const long iterations)\n{\n\tDiffTimer dt;\n\tString out;\n\tfor (long i = 0; i < iterations; i++) {\n\t\tout = a[index].AsString(\"lookup hallo\");\n\t}\n\tlong lDiff = dt.Diff();\n\tString strName(\"IndexLoopAsString\");\n\tAddStatisticOutput(strName << iterations, lDiff);\n}\n\nvoid AnythingPerfTest::RunKeyLoop(const char *key, const Anything &a, const long iterations)\n{\n\tDiffTimer dt;\n\tString out;\n\tfor (long i = 0; i < iterations; i++) {\n\t\tout = a[key].AsCharPtr(\"lookup hallo\");\n\t}\n\tlong lDiff = dt.Diff();\n\tString strName(\"KeyLoopAsCharPtr[\");\n\tAddStatisticOutput(strName << key << \"]\" << iterations, lDiff);\n}\n\nvoid AnythingPerfTest::RunLookupPathLoop(const char *key, const Anything &a, const long iterations)\n{\n\tRunROLookupPathLoop(key, a, iterations);\n\tDiffTimer dt;\n\tconst char *out;\n\tAnything result;\n\tfor (long i = 0; i < iterations; i++) {\n\t\ta.LookupPath(result, key);\n\t\tout = result.AsCharPtr(\"lookup hallo\");\n\t}\n\tlong lDiff = dt.Diff();\n\tString strName(\"LookupPathLoop[\");\n\tAddStatisticOutput(strName << key << \"]\" << iterations, lDiff);\n}\n\nvoid AnythingPerfTest::RunROLookupPathLoop(const char *key, const ROAnything &a, const long iterations)\n{\n\tDiffTimer dt;\n\tconst char *out;\n\tROAnything result;\n\tfor (long i = 0; i < iterations; i++) {\n\t\ta.LookupPath(result, key);\n\t\tout = result.AsCharPtr(\"lookup hallo\");\n\t}\n\tlong lDiff = dt.Diff();\n\tString strName(\"ROLookupPathLoop[\");\n\tAddStatisticOutput(strName << key << \"]\" << iterations, lDiff);\n}\n\nvoid AnythingPerfTest::LookupTest()\n{\n\tStartTrace(AnythingPerfTest.LookupTest);\n\tPoolAllocator p(1, 16384, 10);\n\n\tTestStorageHooks tsh(&p);\n\tStorage::SetHooks(&tsh);\n\n\tAnything a(&p);\n\ta[\"key\"] = \"foo\";\n\ta[\"key\"][\"which\"][\"is\"][\"more\"][\"complex\"] = 1L;\n\tconst long iterations = 100000;\n\tRunIndexLoopAsCharPtr(0L, a, iterations);\n\tRunIndexLoopAsString(0L, a, iterations);\n\tRunKeyLoop(\"key\", a, iterations);\n\tRunKeyLoop(\"keywhichissomewhatlonger\", a, iterations);\n\tRunLookupPathLoop(\"key\", a, iterations);\n\tRunLookupPathLoop(\"keywhichissomewhatlonger\", a, iterations);\n\tRunLookupPathLoop(\"key.which.is.not.there\", a, iterations);\n\tRunLookupPathLoop(\"key.which.is.more.complex\", a, iterations);\n\t\/\/ now with a more populated Anything!\n\tAnything b(&p);\n\tb[\"name\"] = \"Peter\";\n\tb[\"mnam\"] = \"Christian\";\n\tb[\"snam\"] = \"Sommerlad\";\n\tb[\"road\"] = \"Erlenstrasse\";\n\tb[\"hsnr\"] = 79;\n\tb[\"adrs\"][\"postleitzahl\"] = 8832;\n\tb[\"adrs\"][\"Ortsnamentag\"] = \"Wollerau\";\n\tRunKeyLoop(\"hsnr\", b, iterations);\n\tRunKeyLoop(\"name\", b, iterations);\n\tRunKeyLoop(\"noth\", b, iterations);\n\tRunKeyLoop(\"adrs\", b, iterations);\n\tRunLookupPathLoop(\"adrs\", b, iterations);\n\tRunLookupPathLoop(\"adrs.postleitzahl\", b, iterations);\n\tRunLookupPathLoop(\"adrs.Ortsnamentag\", b, iterations);\n\tRunLookupPathLoop(\"adrs.nottheretag \", b, iterations);\n\tRunLookupPathLoop(\"adrs:0\", b, iterations);\n\tRunLookupPathLoop(\"adrs:10\", b, iterations);\n\tRunLookupPathLoop(\"1:10\", b, iterations);\n\n\tStorage::SetHooks(0);\n\tt_assertm(true, \"dummy assertion to generate summary output\");\n}\n\nvoid AnythingPerfTest::DeepCloneTest()\n{\n\tStartTrace(AnythingPerfTest.DeepCloneTest);\n\tDoFunctorTest(1L, \"long 1L\", &AnythingPerfTest::RunDeepCloneLoop);\n\tDoFunctorTest(0.1234, \"float 0.1234\", &AnythingPerfTest::RunDeepCloneLoop);\n\tDoFunctorTest(4433.1234, \"float 4433.1234\", &AnythingPerfTest::RunDeepCloneLoop);\n\tDoFunctorTest(\"guguseli\", \"char* guguseli\", &AnythingPerfTest::RunDeepCloneLoop);\n\tDoFunctorTest(String(\"guguseli\"), \"String guguseli\", &AnythingPerfTest::RunDeepCloneLoop);\n}\n\nvoid AnythingPerfTest::PrintOnTest()\n{\n\tStartTrace(AnythingPerfTest.PrintOnTest);\n\tDoFunctorTest(1L, \"long 1L\", &AnythingPerfTest::RunPrintOnPrettyLoop);\n\tDoFunctorTest(0.1234, \"float 0.1234\", &AnythingPerfTest::RunPrintOnPrettyLoop);\n\tDoFunctorTest(4433.1234, \"float 4433.1234\", &AnythingPerfTest::RunPrintOnPrettyLoop);\n\tDoFunctorTest(\"guguseli\", \"char* guguseli\", &AnythingPerfTest::RunPrintOnPrettyLoop);\n\tDoFunctorTest(String(\"guguseli\"), \"String guguseli\", &AnythingPerfTest::RunPrintOnPrettyLoop);\n}\n\ntemplate <typename T>\nvoid AnythingPerfTest::DoFunctorTest(T value, const char *pName, LoopFunctor pFunc)\n{\n\tStartTrace(AnythingPerfTest.DoFunctorTest);\n\tPoolAllocator p(1, 32768, 20);\n\n\tTestStorageHooks tsh(&p);\n\tStorage::SetHooks(&tsh);\n\tconst long iterations = 10000;\n\n\t{\n\t\tAnything a(&p);\n\t\t(this->*pFunc)(\"Null-Any\", a, iterations);\n\t}\n\t{\n\t\tMetaThing m(&p);\n\t\t(this->*pFunc)(\"MetaThing\", m, iterations);\n\t}\n\/\/\tp.Refresh();\n\t{\n\t\tAnything a(&p);\n\t\ta[\"key\"] = value;\n\t\t(this->*pFunc)(String(\"1 any \") << pName, a, iterations);\n\t}\n\/\/\tp.Refresh();\n\t{\n\t\tAnything a(&p);\n\t\ta[\"key1\"] = value;\n\t\ta[\"key2\"] = value;\n\t\t(this->*pFunc)(String(\"2 any \") << pName, a, iterations);\n\t}\n\/\/\tp.Refresh();\n\t{\n\t\tAnything a(&p);\n\t\ta[\"key\"][\"second\"] = value;\n\t\t(this->*pFunc)(String(\"11 any \") << pName, a, iterations);\n\t}\n\tp.Refresh();\n\t{\n\t\tAnything a(&p);\n\t\ta[\"key\"][\"second\"] = value;\n\t\ta[\"key\"][\"third\"] = value;\n\t\t(this->*pFunc)(String(\"12 any \") << pName, a, iterations);\n\t}\n\/\/\tp.Refresh();\n\t{\n\t\tAnything a(&p);\n\t\ta[\"key1\"][\"second\"] = value;\n\t\ta[\"key1\"][\"third\"] = value;\n\t\ta[\"key2\"][\"second\"] = value;\n\t\ta[\"key2\"][\"third\"] = value;\n\t\t(this->*pFunc)(String(\"22 any \") << pName, a, iterations);\n\t}\n\tStorage::SetHooks(0);\n\tt_assertm(true, \"dummy assertion to generate summary output\");\n}\n\nvoid AnythingPerfTest::RunDeepCloneLoop(const char *pName, const Anything &a, const long iterations)\n{\n\tDiffTimer dt;\n\tAnything result;\n\tfor (long i = 0; i < iterations; i++) {\n\t\tresult = a.DeepClone();\n\t}\n\tlong lDiff = dt.Diff();\n\tString strName(\"DeepCloneLoop[\");\n\tAddStatisticOutput(strName << pName << \"]\" << iterations, lDiff);\n}\n\nvoid AnythingPerfTest::RunPrintOnPrettyLoop(const char *pName, const Anything &a, const long iterations)\n{\n\tDiffTimer dt;\n\tString strBuf;\n\tOStringStream stream(&strBuf);\n\tfor (long i = 0; i < iterations; i++) {\n\t\ta.PrintOn(stream, true);\n\t}\n\tlong lDiff = dt.Diff();\n\tString strName(\"PrintOnPrettyLoop[\");\n\tAddStatisticOutput(strName << pName << \"]\" << iterations, lDiff);\n}\n\nvoid AnythingPerfTest::ExportCsvStatistics()\n{\n\tStatisticTestCase::ExportCsvStatistics(3L);\n}\n\n\/\/ builds up a suite of testcases, add a line for each testmethod\nTest *AnythingPerfTest::suite ()\n{\n\tStartTrace(AnythingPerfTest.suite);\n\tTestSuite *testSuite = new TestSuite;\n\n\tADD_CASE(testSuite, AnythingPerfTest, LookupTest);\n\tADD_CASE(testSuite, AnythingPerfTest, DeepCloneTest);\n\tADD_CASE(testSuite, AnythingPerfTest, PrintOnTest);\n\tADD_CASE(testSuite, AnythingPerfTest, ExportCsvStatistics);\n\n\treturn testSuite;\n}\n<commit_msg>removed obsoleted SetHooks calls<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\/\/--- test modules used --------------------------------------------------------\n#include \"TestSuite.h\"\n\n\/\/--- interface include --------------------------------------------------------\n#include \"AnythingPerfTest.h\"\n\n\/\/--- standard modules used ----------------------------------------------------\n#include \"StringStream.h\"\n#include \"Dbg.h\"\n#include \"DiffTimer.h\"\n#include \"PoolAllocator.h\"\n#include \"System.h\"\n\n\/\/--- c-library modules used ---------------------------------------------------\n\n\/\/---- AnythingPerfTest ----------------------------------------------------------------\nAnythingPerfTest::AnythingPerfTest(TString tstrName) : StatisticTestCase(tstrName)\n{\n\tStartTrace(AnythingPerfTest.Ctor);\n}\n\nAnythingPerfTest::~AnythingPerfTest()\n{\n\tStartTrace(AnythingPerfTest.Dtor);\n}\n\nvoid AnythingPerfTest::setUp()\n{\n\tStartTrace(AnythingPerfTest.setUp);\n\tStatisticTestCase::setUp();\n}\n\nvoid AnythingPerfTest::tearDown()\n{\n\tStartTrace(AnythingPerfTest.tearDown);\n\tStatisticTestCase::tearDown();\n}\n\nvoid AnythingPerfTest::RunIndexLoopAsCharPtr(long index, const Anything &a, const long iterations)\n{\n\tDiffTimer dt;\n\tString out;\n\tfor (long i = 0; i < iterations; i++) {\n\t\tout = a[index].AsCharPtr(\"lookup hallo\");\n\t}\n\tlong lDiff = dt.Diff();\n\tString strName(\"IndexLoopAsCharPtr\");\n\tAddStatisticOutput(strName << iterations, lDiff);\n}\n\nvoid AnythingPerfTest::RunIndexLoopAsString(long index, const Anything &a, const long iterations)\n{\n\tDiffTimer dt;\n\tString out;\n\tfor (long i = 0; i < iterations; i++) {\n\t\tout = a[index].AsString(\"lookup hallo\");\n\t}\n\tlong lDiff = dt.Diff();\n\tString strName(\"IndexLoopAsString\");\n\tAddStatisticOutput(strName << iterations, lDiff);\n}\n\nvoid AnythingPerfTest::RunKeyLoop(const char *key, const Anything &a, const long iterations)\n{\n\tDiffTimer dt;\n\tString out;\n\tfor (long i = 0; i < iterations; i++) {\n\t\tout = a[key].AsCharPtr(\"lookup hallo\");\n\t}\n\tlong lDiff = dt.Diff();\n\tString strName(\"KeyLoopAsCharPtr[\");\n\tAddStatisticOutput(strName << key << \"]\" << iterations, lDiff);\n}\n\nvoid AnythingPerfTest::RunLookupPathLoop(const char *key, const Anything &a, const long iterations)\n{\n\tRunROLookupPathLoop(key, a, iterations);\n\tDiffTimer dt;\n\tconst char *out;\n\tAnything result;\n\tfor (long i = 0; i < iterations; i++) {\n\t\ta.LookupPath(result, key);\n\t\tout = result.AsCharPtr(\"lookup hallo\");\n\t}\n\tlong lDiff = dt.Diff();\n\tString strName(\"LookupPathLoop[\");\n\tAddStatisticOutput(strName << key << \"]\" << iterations, lDiff);\n}\n\nvoid AnythingPerfTest::RunROLookupPathLoop(const char *key, const ROAnything &a, const long iterations)\n{\n\tDiffTimer dt;\n\tconst char *out;\n\tROAnything result;\n\tfor (long i = 0; i < iterations; i++) {\n\t\ta.LookupPath(result, key);\n\t\tout = result.AsCharPtr(\"lookup hallo\");\n\t}\n\tlong lDiff = dt.Diff();\n\tString strName(\"ROLookupPathLoop[\");\n\tAddStatisticOutput(strName << key << \"]\" << iterations, lDiff);\n}\n\nvoid AnythingPerfTest::LookupTest()\n{\n\tStartTrace(AnythingPerfTest.LookupTest);\n\tPoolAllocator p(1, 16384, 10);\n\n\tTestStorageHooks tsh(&p);\n\n\tAnything a(&p);\n\ta[\"key\"] = \"foo\";\n\ta[\"key\"][\"which\"][\"is\"][\"more\"][\"complex\"] = 1L;\n\tconst long iterations = 100000;\n\tRunIndexLoopAsCharPtr(0L, a, iterations);\n\tRunIndexLoopAsString(0L, a, iterations);\n\tRunKeyLoop(\"key\", a, iterations);\n\tRunKeyLoop(\"keywhichissomewhatlonger\", a, iterations);\n\tRunLookupPathLoop(\"key\", a, iterations);\n\tRunLookupPathLoop(\"keywhichissomewhatlonger\", a, iterations);\n\tRunLookupPathLoop(\"key.which.is.not.there\", a, iterations);\n\tRunLookupPathLoop(\"key.which.is.more.complex\", a, iterations);\n\t\/\/ now with a more populated Anything!\n\tAnything b(&p);\n\tb[\"name\"] = \"Peter\";\n\tb[\"mnam\"] = \"Christian\";\n\tb[\"snam\"] = \"Sommerlad\";\n\tb[\"road\"] = \"Erlenstrasse\";\n\tb[\"hsnr\"] = 79;\n\tb[\"adrs\"][\"postleitzahl\"] = 8832;\n\tb[\"adrs\"][\"Ortsnamentag\"] = \"Wollerau\";\n\tRunKeyLoop(\"hsnr\", b, iterations);\n\tRunKeyLoop(\"name\", b, iterations);\n\tRunKeyLoop(\"noth\", b, iterations);\n\tRunKeyLoop(\"adrs\", b, iterations);\n\tRunLookupPathLoop(\"adrs\", b, iterations);\n\tRunLookupPathLoop(\"adrs.postleitzahl\", b, iterations);\n\tRunLookupPathLoop(\"adrs.Ortsnamentag\", b, iterations);\n\tRunLookupPathLoop(\"adrs.nottheretag \", b, iterations);\n\tRunLookupPathLoop(\"adrs:0\", b, iterations);\n\tRunLookupPathLoop(\"adrs:10\", b, iterations);\n\tRunLookupPathLoop(\"1:10\", b, iterations);\n\n\tt_assertm(true, \"dummy assertion to generate summary output\");\n}\n\nvoid AnythingPerfTest::DeepCloneTest()\n{\n\tStartTrace(AnythingPerfTest.DeepCloneTest);\n\tDoFunctorTest(1L, \"long 1L\", &AnythingPerfTest::RunDeepCloneLoop);\n\tDoFunctorTest(0.1234, \"float 0.1234\", &AnythingPerfTest::RunDeepCloneLoop);\n\tDoFunctorTest(4433.1234, \"float 4433.1234\", &AnythingPerfTest::RunDeepCloneLoop);\n\tDoFunctorTest(\"guguseli\", \"char* guguseli\", &AnythingPerfTest::RunDeepCloneLoop);\n\tDoFunctorTest(String(\"guguseli\"), \"String guguseli\", &AnythingPerfTest::RunDeepCloneLoop);\n}\n\nvoid AnythingPerfTest::PrintOnTest()\n{\n\tStartTrace(AnythingPerfTest.PrintOnTest);\n\tDoFunctorTest(1L, \"long 1L\", &AnythingPerfTest::RunPrintOnPrettyLoop);\n\tDoFunctorTest(0.1234, \"float 0.1234\", &AnythingPerfTest::RunPrintOnPrettyLoop);\n\tDoFunctorTest(4433.1234, \"float 4433.1234\", &AnythingPerfTest::RunPrintOnPrettyLoop);\n\tDoFunctorTest(\"guguseli\", \"char* guguseli\", &AnythingPerfTest::RunPrintOnPrettyLoop);\n\tDoFunctorTest(String(\"guguseli\"), \"String guguseli\", &AnythingPerfTest::RunPrintOnPrettyLoop);\n}\n\ntemplate <typename T>\nvoid AnythingPerfTest::DoFunctorTest(T value, const char *pName, LoopFunctor pFunc)\n{\n\tStartTrace(AnythingPerfTest.DoFunctorTest);\n\tPoolAllocator p(1, 32768, 20);\n\n\tTestStorageHooks tsh(&p);\n\n\tconst long iterations = 10000;\n\n\t{\n\t\tAnything a(&p);\n\t\t(this->*pFunc)(\"Null-Any\", a, iterations);\n\t}\n\t{\n\t\tMetaThing m(&p);\n\t\t(this->*pFunc)(\"MetaThing\", m, iterations);\n\t}\n\/\/\tp.Refresh();\n\t{\n\t\tAnything a(&p);\n\t\ta[\"key\"] = value;\n\t\t(this->*pFunc)(String(\"1 any \") << pName, a, iterations);\n\t}\n\/\/\tp.Refresh();\n\t{\n\t\tAnything a(&p);\n\t\ta[\"key1\"] = value;\n\t\ta[\"key2\"] = value;\n\t\t(this->*pFunc)(String(\"2 any \") << pName, a, iterations);\n\t}\n\/\/\tp.Refresh();\n\t{\n\t\tAnything a(&p);\n\t\ta[\"key\"][\"second\"] = value;\n\t\t(this->*pFunc)(String(\"11 any \") << pName, a, iterations);\n\t}\n\tp.Refresh();\n\t{\n\t\tAnything a(&p);\n\t\ta[\"key\"][\"second\"] = value;\n\t\ta[\"key\"][\"third\"] = value;\n\t\t(this->*pFunc)(String(\"12 any \") << pName, a, iterations);\n\t}\n\/\/\tp.Refresh();\n\t{\n\t\tAnything a(&p);\n\t\ta[\"key1\"][\"second\"] = value;\n\t\ta[\"key1\"][\"third\"] = value;\n\t\ta[\"key2\"][\"second\"] = value;\n\t\ta[\"key2\"][\"third\"] = value;\n\t\t(this->*pFunc)(String(\"22 any \") << pName, a, iterations);\n\t}\n\tt_assertm(true, \"dummy assertion to generate summary output\");\n}\n\nvoid AnythingPerfTest::RunDeepCloneLoop(const char *pName, const Anything &a, const long iterations)\n{\n\tDiffTimer dt;\n\tAnything result;\n\tfor (long i = 0; i < iterations; i++) {\n\t\tresult = a.DeepClone();\n\t}\n\tlong lDiff = dt.Diff();\n\tString strName(\"DeepCloneLoop[\");\n\tAddStatisticOutput(strName << pName << \"]\" << iterations, lDiff);\n}\n\nvoid AnythingPerfTest::RunPrintOnPrettyLoop(const char *pName, const Anything &a, const long iterations)\n{\n\tDiffTimer dt;\n\tString strBuf;\n\tOStringStream stream(&strBuf);\n\tfor (long i = 0; i < iterations; i++) {\n\t\ta.PrintOn(stream, true);\n\t}\n\tlong lDiff = dt.Diff();\n\tString strName(\"PrintOnPrettyLoop[\");\n\tAddStatisticOutput(strName << pName << \"]\" << iterations, lDiff);\n}\n\nvoid AnythingPerfTest::ExportCsvStatistics()\n{\n\tStatisticTestCase::ExportCsvStatistics(3L);\n}\n\n\/\/ builds up a suite of testcases, add a line for each testmethod\nTest *AnythingPerfTest::suite ()\n{\n\tStartTrace(AnythingPerfTest.suite);\n\tTestSuite *testSuite = new TestSuite;\n\n\tADD_CASE(testSuite, AnythingPerfTest, LookupTest);\n\tADD_CASE(testSuite, AnythingPerfTest, DeepCloneTest);\n\tADD_CASE(testSuite, AnythingPerfTest, PrintOnTest);\n\tADD_CASE(testSuite, AnythingPerfTest, ExportCsvStatistics);\n\n\treturn testSuite;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>fixed curly brace<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*********************************************************************\n *\n * Copyright (C) 2008,  Simon Kagstrom\n *\n * Filename:      calltablemethod.cc\n * Author:        Simon Kagstrom <simon.kagstrom@gmail.com>\n * Description:   The special call table\n *\n * $Id:$\n *\n ********************************************************************\/\n#include <javamethod.hh>\n#include <emit.hh>\n\nCallTableMethod::CallTableMethod(int maxMethods) : JavaMethod(NULL, 0, 0)\n{\n  this->n_methods = 0;\n  this->methods = (JavaMethod**)xcalloc(sizeof(JavaMethod*), maxMethods);\n  this->method_table = ght_create(maxMethods);\n  memset(this->registerUsage, 0, sizeof(this->registerUsage));\n}\n\nvoid CallTableMethod::addMethod(JavaMethod *method)\n{\n  uint32_t addr = method->getAddress();\n\n  if ( ght_get(this->method_table,\n               sizeof(uint32_t), (void*)&addr) != NULL )\n    {\n      \/* Already exists, don't insert again *\/\n      printf(\"Maboo: %x\\n\", method->getAddress());\n      return;\n    }\n  ght_insert(this->method_table, (void*)method,\n             sizeof(uint32_t), (void*)&addr);\n\n  this->methods[this->n_methods++] = method;\n}\n\nbool CallTableMethod::pass1()\n{\n  this->registerUsage[ R_SP ] = 1;\n  this->registerUsage[ R_A0 ] = 1;\n  this->registerUsage[ R_A1 ] = 1;\n  this->registerUsage[ R_A2 ] = 1;\n  this->registerUsage[ R_A3 ] = 1;\n  this->registerUsage[ R_V0 ] = 1;\n  this->registerUsage[ R_V1 ] = 1;\n\n  return true;\n}\n\nbool CallTableMethod::pass2()\n{\n  emit->generic(\"class CibylCallTable {\\n\"\n                \"  public static final int call(int address, int sp, int a0, int a1, int a2, int a3) throws Exception {\\n\"\n                \"    int v0 = 0;\\n\"\n                \"    switch(address) {\\n\"\n                );\n\n  \/* For each method, output a call to it *\/\n  for (int i = 0; i < this->n_methods; i++)\n    {\n      JavaMethod *mt = this->methods[i];\n      const char *comma = \"\";\n\n      emit->generic(\"      case 0x%x:  \", mt->getAddress());\n      if (mt->clobbersReg( R_V0 ))\n        emit->generic(\"v0 = \");\n      emit->generic(\"Cibyl.%s(\", mt->getName()); \/* FIXME! Don't use static class name *\/\n\n      \/* Pass registers *\/\n      if (mt->clobbersReg( R_SP ))\n        { emit->generic(\"sp\"); comma = \",\"; }\n      if (mt->clobbersReg( R_A0 ))\n        { emit->generic(\"%s a0\", comma); comma = \",\"; }\n      if (mt->clobbersReg( R_A1 ))\n        { emit->generic(\"%s a1\", comma); comma = \",\"; }\n      if (mt->clobbersReg( R_A2 ))\n        { emit->generic(\"%s a2\", comma); comma = \",\"; }\n      if (mt->clobbersReg( R_A3 ))\n        emit->generic(\"%s a3\", comma);\n      emit->generic(\"); break;\\n\");\n    }\n\n  emit->generic(\"      default:\\n\"\n                \"         throw new Exception(\\\"Call to unknown location \\\" + Integer.toHexString(address));\\n\"\n                \"    }\\n\"\n                \"    return v0;\\n\"\n                \"  }\\n\"\n                \"}\\n\"\n                );\n  return true;\n}\n<commit_msg>Removed printout<commit_after>\/*********************************************************************\n *\n * Copyright (C) 2008,  Simon Kagstrom\n *\n * Filename:      calltablemethod.cc\n * Author:        Simon Kagstrom <simon.kagstrom@gmail.com>\n * Description:   The special call table\n *\n * $Id:$\n *\n ********************************************************************\/\n#include <javamethod.hh>\n#include <emit.hh>\n\nCallTableMethod::CallTableMethod(int maxMethods) : JavaMethod(NULL, 0, 0)\n{\n  this->n_methods = 0;\n  this->methods = (JavaMethod**)xcalloc(sizeof(JavaMethod*), maxMethods);\n  this->method_table = ght_create(maxMethods);\n  memset(this->registerUsage, 0, sizeof(this->registerUsage));\n}\n\nvoid CallTableMethod::addMethod(JavaMethod *method)\n{\n  uint32_t addr = method->getAddress();\n\n  if ( ght_get(this->method_table,\n               sizeof(uint32_t), (void*)&addr) != NULL )\n    {\n      \/* Already exists, don't insert again *\/\n      return;\n    }\n  ght_insert(this->method_table, (void*)method,\n             sizeof(uint32_t), (void*)&addr);\n\n  this->methods[this->n_methods++] = method;\n}\n\nbool CallTableMethod::pass1()\n{\n  this->registerUsage[ R_SP ] = 1;\n  this->registerUsage[ R_A0 ] = 1;\n  this->registerUsage[ R_A1 ] = 1;\n  this->registerUsage[ R_A2 ] = 1;\n  this->registerUsage[ R_A3 ] = 1;\n  this->registerUsage[ R_V0 ] = 1;\n  this->registerUsage[ R_V1 ] = 1;\n\n  return true;\n}\n\nbool CallTableMethod::pass2()\n{\n  emit->generic(\"class CibylCallTable {\\n\"\n                \"  public static final int call(int address, int sp, int a0, int a1, int a2, int a3) throws Exception {\\n\"\n                \"    int v0 = 0;\\n\"\n                \"    switch(address) {\\n\"\n                );\n\n  \/* For each method, output a call to it *\/\n  for (int i = 0; i < this->n_methods; i++)\n    {\n      JavaMethod *mt = this->methods[i];\n      const char *comma = \"\";\n\n      emit->generic(\"      case 0x%x:  \", mt->getAddress());\n      if (mt->clobbersReg( R_V0 ))\n        emit->generic(\"v0 = \");\n      emit->generic(\"Cibyl.%s(\", mt->getName()); \/* FIXME! Don't use static class name *\/\n\n      \/* Pass registers *\/\n      if (mt->clobbersReg( R_SP ))\n        { emit->generic(\"sp\"); comma = \",\"; }\n      if (mt->clobbersReg( R_A0 ))\n        { emit->generic(\"%s a0\", comma); comma = \",\"; }\n      if (mt->clobbersReg( R_A1 ))\n        { emit->generic(\"%s a1\", comma); comma = \",\"; }\n      if (mt->clobbersReg( R_A2 ))\n        { emit->generic(\"%s a2\", comma); comma = \",\"; }\n      if (mt->clobbersReg( R_A3 ))\n        emit->generic(\"%s a3\", comma);\n      emit->generic(\"); break;\\n\");\n    }\n\n  emit->generic(\"      default:\\n\"\n                \"         throw new Exception(\\\"Call to unknown location \\\" + Integer.toHexString(address));\\n\"\n                \"    }\\n\"\n                \"    return v0;\\n\"\n                \"  }\\n\"\n                \"}\\n\"\n                );\n  return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ RUN: grep -Ev \"\/\/ *[A-Z-]+:\" %s > %t-input.cpp\n\/\/ RUN: clang-tidy %t-input.cpp -checks='-*,google-explicit-constructor,clang-diagnostic-missing-prototypes' -export-fixes=%t.yaml -- -Wmissing-prototypes > %t.msg 2>&1\n\/\/ RUN: FileCheck -input-file=%t.msg -check-prefix=CHECK-MESSAGES %s -implicit-check-not='{{warning|error|note}}:'\n\/\/ RUN: FileCheck -input-file=%t.yaml -check-prefix=CHECK-YAML %s\n#define X(n) void n ## n() {}\nX(f)\n\n\/\/ CHECK-MESSAGES: -input.cpp:2:1: warning: no previous prototype for function 'ff' [clang-diagnostic-missing-prototypes]\n\/\/ CHECK-MESSAGES: -input.cpp:1:19: note: expanded from macro 'X'\n\/\/ CHECK-MESSAGES: {{^}}note: expanded from here{{$}}\n\n\/\/ CHECK-YAML: ---\n\/\/ CHECK-YAML-NEXT: MainSourceFile:  '{{.*}}-input.cpp'\n\/\/ CHECK-YAML-NEXT: Diagnostics:\n\/\/ CHECK-YAML-NEXT:   - DiagnosticName:  clang-diagnostic-missing-prototypes\n\/\/ CHECK-YAML-NEXT:     DiagnosticMessage:\n\/\/ CHECK-YAML-NEXT:       Message:         'no previous prototype for function\n\/\/ ''ff'''\n\/\/ CHECK-YAML-NEXT:       FilePath:        '{{.*}}-input.cpp'\n\/\/ CHECK-YAML-NEXT:       FileOffset:      30\n\/\/ CHECK-YAML-NEXT:       Replacements:      []\n\/\/ CHECK-YAML-NEXT:     Notes:\n\/\/ CHECK-YAML-NEXT:       - Message:         'expanded from macro ''X'''\n\/\/ CHECK-YAML-NEXT:         FilePath:        '{{.*}}-input.cpp'\n\/\/ CHECK-YAML-NEXT:         FileOffset:      18\n\/\/ CHECK-YAML-NEXT:         Replacements:    []\n\/\/ CHECK-YAML-NEXT:       - Message:         expanded from here\n\/\/ CHECK-YAML-NEXT:         FilePath:        ''\n\/\/ CHECK-YAML-NEXT:         FileOffset:      0\n\/\/ CHECK-YAML-NEXT:         Replacements:    []\n\/\/ CHECK-YAML-NEXT: ...\n<commit_msg>Fix more tests after r363749<commit_after>\/\/ RUN: grep -Ev \"\/\/ *[A-Z-]+:\" %s > %t-input.cpp\n\/\/ RUN: clang-tidy %t-input.cpp -checks='-*,google-explicit-constructor,clang-diagnostic-missing-prototypes' -export-fixes=%t.yaml -- -Wmissing-prototypes > %t.msg 2>&1\n\/\/ RUN: FileCheck -input-file=%t.msg -check-prefix=CHECK-MESSAGES %s -implicit-check-not='{{warning|error|note}}:'\n\/\/ RUN: FileCheck -input-file=%t.yaml -check-prefix=CHECK-YAML %s\n#define X(n) void n ## n() {}\nX(f)\n\n\/\/ CHECK-MESSAGES: -input.cpp:2:1: warning: no previous prototype for function 'ff' [clang-diagnostic-missing-prototypes]\n\/\/ CHECK-MESSAGES: -input.cpp:1:19: note: expanded from macro 'X'\n\/\/ CHECK-MESSAGES: {{^}}note: expanded from here{{$}}\n\/\/ CHECK-MESSAGES: -input.cpp:2:1: note: declare 'static' if the function is not intended to be used outside of this translation unit\n\/\/ CHECK-MESSAGES: -input.cpp:1:14: note: expanded from macro 'X'\n\n\/\/ CHECK-YAML: ---\n\/\/ CHECK-YAML-NEXT: MainSourceFile:  '{{.*}}-input.cpp'\n\/\/ CHECK-YAML-NEXT: Diagnostics:\n\/\/ CHECK-YAML-NEXT:   - DiagnosticName:  clang-diagnostic-missing-prototypes\n\/\/ CHECK-YAML-NEXT:     DiagnosticMessage:\n\/\/ CHECK-YAML-NEXT:       Message:         'no previous prototype for function\n\/\/ ''ff'''\n\/\/ CHECK-YAML-NEXT:       FilePath:        '{{.*}}-input.cpp'\n\/\/ CHECK-YAML-NEXT:       FileOffset:      30\n\/\/ CHECK-YAML-NEXT:       Replacements:      []\n\/\/ CHECK-YAML-NEXT:     Notes:\n\/\/ CHECK-YAML-NEXT:       - Message:         'expanded from macro ''X'''\n\/\/ CHECK-YAML-NEXT:         FilePath:        '{{.*}}-input.cpp'\n\/\/ CHECK-YAML-NEXT:         FileOffset:      18\n\/\/ CHECK-YAML-NEXT:         Replacements:    []\n\/\/ CHECK-YAML-NEXT:       - Message:         expanded from here\n\/\/ CHECK-YAML-NEXT:         FilePath:        ''\n\/\/ CHECK-YAML-NEXT:         FileOffset:      0\n\/\/ CHECK-YAML-NEXT:         Replacements:    []\n\/\/ CHECK-YAML-NEXT:       - Message:         'declare ''static'' if the function is not intended to be used outside of this translation unit'\n\/\/ CHECK-YAML-NEXT:         FilePath:        '{{.*}}-input.cpp'\n\/\/ CHECK-YAML-NEXT:         FileOffset:      30\n\/\/ CHECK-YAML-NEXT:         Replacements:\n\/\/ CHECK-YAML-NEXT:           - FilePath:        '{{.*}}-input.cpp'\n\/\/ CHECK-YAML-NEXT:             Offset:          30\n\/\/ CHECK-YAML-NEXT:             Length:          0\n\/\/ CHECK-YAML-NEXT:             ReplacementText: 'static '\n\/\/ CHECK-YAML-NEXT:       - Message:         'expanded from macro ''X'''\n\/\/ CHECK-YAML-NEXT:         FilePath:        '{{.*}}-input.cpp'\n\/\/ CHECK-YAML-NEXT:         FileOffset:      13\n\/\/ CHECK-YAML-NEXT:         Replacements:    []\n\/\/ CHECK-YAML-NEXT: ...\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"utils.hpp\"\n#include \"mapnik_layer.hpp\"\n#include \"mapnik_datasource.hpp\"\n\/\/#include \"mapnik_js_datasource.hpp\"\n#include \"mapnik_memory_datasource.hpp\"\n\n\/\/ boost\n#include <boost\/make_shared.hpp>\n\n\/\/ mapnik\n#include <mapnik\/version.hpp>\n#include <mapnik\/layer.hpp>\n\n#if MAPNIK_VERSION <= 200000\n#define active isActive\n#define min_zoom getMinZoom\n#define max_zoom getMaxZoom\n#define queryable isQueryable\n#define active isActive\n#define visible isVisible\n#endif\n\n\nPersistent<FunctionTemplate> Layer::constructor;\n\nvoid Layer::Initialize(Handle<Object> target) {\n\n    HandleScope scope;\n\n    constructor = Persistent<FunctionTemplate>::New(FunctionTemplate::New(Layer::New));\n    constructor->InstanceTemplate()->SetInternalFieldCount(1);\n    constructor->SetClassName(String::NewSymbol(\"Layer\"));\n\n    \/\/ methods\n    NODE_SET_PROTOTYPE_METHOD(constructor, \"describe\", describe);\n\n    \/\/ properties\n    ATTR(constructor, \"name\", get_prop, set_prop);\n    ATTR(constructor, \"srs\", get_prop, set_prop);\n    ATTR(constructor, \"styles\", get_prop, set_prop);\n    ATTR(constructor, \"datasource\", get_prop, set_prop);\n\n    target->Set(String::NewSymbol(\"Layer\"),constructor->GetFunction());\n}\n\nLayer::Layer(std::string const& name) :\n    ObjectWrap(),\n    layer_(boost::make_shared<mapnik::layer>(name)) {}\n\nLayer::Layer(std::string const& name, std::string const& srs) :\n    ObjectWrap(),\n    layer_(boost::make_shared<mapnik::layer>(name,srs)) {}\n\nLayer::Layer() :\n    ObjectWrap(),\n    layer_() {}\n\n\nLayer::~Layer() {}\n\nHandle<Value> Layer::New(const Arguments& args)\n{\n    HandleScope scope;\n\n    if (!args.IsConstructCall())\n        return ThrowException(String::New(\"Cannot call constructor as function, you need to use 'new' keyword\"));\n\n    if (args[0]->IsExternal())\n    {\n        Local<External> ext = Local<External>::Cast(args[0]);\n        void* ptr = ext->Value();\n        Layer* l =  static_cast<Layer*>(ptr);\n        l->Wrap(args.This());\n        return args.This();\n    }\n\n    if (args.Length() == 1)\n    {\n        if (!args[0]->IsString())\n        {\n            return ThrowException(Exception::TypeError(\n                                      String::New(\"'name' must be a string\")));\n        }\n        Layer* l = new Layer(TOSTR(args[0]));\n        l->Wrap(args.This());\n        return args.This();\n    }\n    else if (args.Length() == 2)\n    {\n        if (!args[0]->IsString() || !args[1]->IsString())\n            return ThrowException(Exception::TypeError(\n                                      String::New(\"'name' and 'srs' must be a strings\")));\n        Layer* l = new Layer(TOSTR(args[0]),TOSTR(args[1]));\n        l->Wrap(args.This());\n        return args.This();\n    }\n    else\n    {\n        return ThrowException(Exception::TypeError(\n                                  String::New(\"please provide Layer name and optional srs\")));\n    }\n    return args.This();\n}\n\nHandle<Value> Layer::New(mapnik::layer const& lay_ref) {\n    HandleScope scope;\n    Layer* l = new Layer();\n    \/\/ copy new mapnik::layer into the shared_ptr\n    l->layer_ = boost::make_shared<mapnik::layer>(lay_ref);\n    Handle<Value> ext = External::New(l);\n    Handle<Object> obj = constructor->GetFunction()->NewInstance(1, &ext);\n    return scope.Close(obj);\n}\n\nHandle<Value> Layer::get_prop(Local<String> property,\n                              const AccessorInfo& info)\n{\n    HandleScope scope;\n    Layer* l = ObjectWrap::Unwrap<Layer>(info.This());\n    std::string a = TOSTR(property);\n    if (a == \"name\")\n        return scope.Close(String::New(l->layer_->name().c_str()));\n    else if (a == \"srs\")\n        return scope.Close(String::New(l->layer_->srs().c_str()));\n    else if (a == \"styles\") {\n        std::vector<std::string> const& style_names = l->layer_->styles();\n        Local<Array> s = Array::New(style_names.size());\n        for (unsigned i = 0; i < style_names.size(); ++i)\n        {\n            s->Set(i, String::New(style_names[i].c_str()) );\n        }\n        return scope.Close(s);\n    }\n    else if (a == \"datasource\") {\n        mapnik::datasource_ptr ds = l->layer_->datasource();\n        if (ds)\n        {\n            return scope.Close(Datasource::New(ds));\n        }\n    }\n    return Undefined();\n}\n\nvoid Layer::set_prop(Local<String> property,\n                     Local<Value> value,\n                     const AccessorInfo& info)\n{\n    HandleScope scope;\n    Layer* l = ObjectWrap::Unwrap<Layer>(info.This());\n    std::string a = TOSTR(property);\n    if (a == \"name\")\n    {\n        if (!value->IsString()) {\n            ThrowException(Exception::Error(\n                               String::New(\"'name' must be a string\")));\n        } else {\n            l->layer_->set_name(TOSTR(value));\n        }\n    }\n    else if (a == \"srs\")\n    {\n        if (!value->IsString()) {\n            ThrowException(Exception::Error(\n                               String::New(\"'srs' must be a string\")));\n        } else {\n            l->layer_->set_srs(TOSTR(value));\n        }\n    }\n    else if (a == \"styles\")\n    {\n        if (!value->IsArray())\n            ThrowException(Exception::Error(\n                               String::New(\"Must provide an array of style names\")));\n        else {\n            Local<Array> arr = Local<Array>::Cast(value->ToObject());\n            \/\/ todo - how to check if cast worked?\n            uint32_t i = 0;\n            uint32_t a_length = arr->Length();\n            while (i < a_length) {\n                l->layer_->add_style(TOSTR(arr->Get(i)));\n                i++;\n            }\n        }\n    }\n    else if (a == \"datasource\")\n    {\n        Local<Object> obj = value->ToObject();\n        if (value->IsNull() || value->IsUndefined()) {\n            ThrowException(Exception::TypeError(String::New(\"mapnik.Datasource, or mapnik.MemoryDatasource instance expected\")));\n        } else {\n            if (Datasource::constructor->HasInstance(obj)) {\n                Datasource *d = ObjectWrap::Unwrap<Datasource>(obj);\n                l->layer_->set_datasource(d->get());\n            }\n            \/*else if (JSDatasource::constructor->HasInstance(obj))\n            {\n                JSDatasource *d = ObjectWrap::Unwrap<JSDatasource>(obj);\n                l->layer_->set_datasource(d->get());\n            }*\/\n            else if (MemoryDatasource::constructor->HasInstance(obj))\n            {\n                MemoryDatasource *d = ObjectWrap::Unwrap<MemoryDatasource>(obj);\n                l->layer_->set_datasource(d->get());\n            }\n            else\n            {\n                ThrowException(Exception::TypeError(String::New(\"mapnik.Datasource, mapnik.JSDatasource, or mapnik.MemoryDatasource instance expected\")));\n            }\n        }\n    }\n}\n\nHandle<Value> Layer::describe(const Arguments& args)\n{\n    HandleScope scope;\n\n    Layer* l = ObjectWrap::Unwrap<Layer>(args.This());\n\n    Local<Object> description = Object::New();\n    mapnik::layer const& layer = *l->layer_;\n    if ( layer.name() != \"\" )\n    {\n        description->Set(String::NewSymbol(\"name\"), String::New(layer.name().c_str()));\n    }\n\n    if ( layer.srs() != \"\" )\n    {\n        description->Set(String::NewSymbol(\"srs\"), String::New(layer.srs().c_str()));\n    }\n\n    if ( !layer.active())\n    {\n        description->Set(String::NewSymbol(\"status\"), Boolean::New(layer.active()));\n    }\n\n    if ( layer.clear_label_cache())\n    {\n        description->Set(String::NewSymbol(\"clear_label_cache\"), Boolean::New(layer.clear_label_cache()));\n    }\n\n    if ( layer.min_zoom() > 0)\n    {\n        description->Set(String::NewSymbol(\"minzoom\"), Number::New(layer.min_zoom()));\n    }\n\n    if ( layer.max_zoom() != std::numeric_limits<double>::max() )\n    {\n        description->Set(String::NewSymbol(\"maxzoom\"), Number::New(layer.max_zoom()));\n    }\n\n    if ( layer.queryable())\n    {\n        description->Set(String::NewSymbol(\"queryable\"), Boolean::New(layer.queryable()));\n    }\n\n    std::vector<std::string> const& style_names = layer.styles();\n    Local<Array> s = Array::New(style_names.size());\n    for (unsigned i = 0; i < style_names.size(); ++i)\n    {\n        s->Set(i, String::New(style_names[i].c_str()) );\n    }\n\n    description->Set(String::NewSymbol(\"styles\"), s );\n\n    mapnik::datasource_ptr datasource = layer.datasource();\n    Local<v8::Object> ds = Object::New();\n    description->Set(String::NewSymbol(\"datasource\"), ds );\n    if ( datasource )\n    {\n        mapnik::parameters::const_iterator it = datasource->params().begin();\n        mapnik::parameters::const_iterator end = datasource->params().end();\n        for (; it != end; ++it)\n        {\n            node_mapnik::params_to_object serializer( ds , it->first);\n            boost::apply_visitor( serializer, it->second );\n        }\n    }\n\n    return scope.Close(description);\n}\n\n#if MAPNIK_VERSION <= 200000\n#undef active\n#undef min_zoom\n#undef max_zoom\n#undef queryable\n#undef active\n#undef visible\n#endif\n<commit_msg>include limits header, now needed on linux after refactoring of headers upstream in mapnik<commit_after>\n#include \"utils.hpp\"\n#include \"mapnik_layer.hpp\"\n#include \"mapnik_datasource.hpp\"\n\/\/#include \"mapnik_js_datasource.hpp\"\n#include \"mapnik_memory_datasource.hpp\"\n\n\/\/ boost\n#include <boost\/make_shared.hpp>\n\n\/\/ mapnik\n#include <mapnik\/version.hpp>\n#include <mapnik\/layer.hpp>\n\n\/\/ stl\n#include <limits>\n\n#if MAPNIK_VERSION <= 200000\n#define active isActive\n#define min_zoom getMinZoom\n#define max_zoom getMaxZoom\n#define queryable isQueryable\n#define active isActive\n#define visible isVisible\n#endif\n\n\nPersistent<FunctionTemplate> Layer::constructor;\n\nvoid Layer::Initialize(Handle<Object> target) {\n\n    HandleScope scope;\n\n    constructor = Persistent<FunctionTemplate>::New(FunctionTemplate::New(Layer::New));\n    constructor->InstanceTemplate()->SetInternalFieldCount(1);\n    constructor->SetClassName(String::NewSymbol(\"Layer\"));\n\n    \/\/ methods\n    NODE_SET_PROTOTYPE_METHOD(constructor, \"describe\", describe);\n\n    \/\/ properties\n    ATTR(constructor, \"name\", get_prop, set_prop);\n    ATTR(constructor, \"srs\", get_prop, set_prop);\n    ATTR(constructor, \"styles\", get_prop, set_prop);\n    ATTR(constructor, \"datasource\", get_prop, set_prop);\n\n    target->Set(String::NewSymbol(\"Layer\"),constructor->GetFunction());\n}\n\nLayer::Layer(std::string const& name):\n    ObjectWrap(),\n    layer_(boost::make_shared<mapnik::layer>(name)) {}\n\nLayer::Layer(std::string const& name, std::string const& srs):\n    ObjectWrap(),\n    layer_(boost::make_shared<mapnik::layer>(name,srs)) {}\n\nLayer::Layer():\n    ObjectWrap(),\n    layer_() {}\n\n\nLayer::~Layer() {}\n\nHandle<Value> Layer::New(const Arguments& args)\n{\n    HandleScope scope;\n\n    if (!args.IsConstructCall())\n        return ThrowException(String::New(\"Cannot call constructor as function, you need to use 'new' keyword\"));\n\n    if (args[0]->IsExternal())\n    {\n        Local<External> ext = Local<External>::Cast(args[0]);\n        void* ptr = ext->Value();\n        Layer* l =  static_cast<Layer*>(ptr);\n        l->Wrap(args.This());\n        return args.This();\n    }\n\n    if (args.Length() == 1)\n    {\n        if (!args[0]->IsString())\n        {\n            return ThrowException(Exception::TypeError(\n                                      String::New(\"'name' must be a string\")));\n        }\n        Layer* l = new Layer(TOSTR(args[0]));\n        l->Wrap(args.This());\n        return args.This();\n    }\n    else if (args.Length() == 2)\n    {\n        if (!args[0]->IsString() || !args[1]->IsString())\n            return ThrowException(Exception::TypeError(\n                                      String::New(\"'name' and 'srs' must be a strings\")));\n        Layer* l = new Layer(TOSTR(args[0]),TOSTR(args[1]));\n        l->Wrap(args.This());\n        return args.This();\n    }\n    else\n    {\n        return ThrowException(Exception::TypeError(\n                                  String::New(\"please provide Layer name and optional srs\")));\n    }\n    return args.This();\n}\n\nHandle<Value> Layer::New(mapnik::layer const& lay_ref) {\n    HandleScope scope;\n    Layer* l = new Layer();\n    \/\/ copy new mapnik::layer into the shared_ptr\n    l->layer_ = boost::make_shared<mapnik::layer>(lay_ref);\n    Handle<Value> ext = External::New(l);\n    Handle<Object> obj = constructor->GetFunction()->NewInstance(1, &ext);\n    return scope.Close(obj);\n}\n\nHandle<Value> Layer::get_prop(Local<String> property,\n                              const AccessorInfo& info)\n{\n    HandleScope scope;\n    Layer* l = ObjectWrap::Unwrap<Layer>(info.This());\n    std::string a = TOSTR(property);\n    if (a == \"name\")\n        return scope.Close(String::New(l->layer_->name().c_str()));\n    else if (a == \"srs\")\n        return scope.Close(String::New(l->layer_->srs().c_str()));\n    else if (a == \"styles\") {\n        std::vector<std::string> const& style_names = l->layer_->styles();\n        Local<Array> s = Array::New(style_names.size());\n        for (unsigned i = 0; i < style_names.size(); ++i)\n        {\n            s->Set(i, String::New(style_names[i].c_str()) );\n        }\n        return scope.Close(s);\n    }\n    else if (a == \"datasource\") {\n        mapnik::datasource_ptr ds = l->layer_->datasource();\n        if (ds)\n        {\n            return scope.Close(Datasource::New(ds));\n        }\n    }\n    return Undefined();\n}\n\nvoid Layer::set_prop(Local<String> property,\n                     Local<Value> value,\n                     const AccessorInfo& info)\n{\n    HandleScope scope;\n    Layer* l = ObjectWrap::Unwrap<Layer>(info.This());\n    std::string a = TOSTR(property);\n    if (a == \"name\")\n    {\n        if (!value->IsString()) {\n            ThrowException(Exception::Error(\n                               String::New(\"'name' must be a string\")));\n        } else {\n            l->layer_->set_name(TOSTR(value));\n        }\n    }\n    else if (a == \"srs\")\n    {\n        if (!value->IsString()) {\n            ThrowException(Exception::Error(\n                               String::New(\"'srs' must be a string\")));\n        } else {\n            l->layer_->set_srs(TOSTR(value));\n        }\n    }\n    else if (a == \"styles\")\n    {\n        if (!value->IsArray())\n            ThrowException(Exception::Error(\n                               String::New(\"Must provide an array of style names\")));\n        else {\n            Local<Array> arr = Local<Array>::Cast(value->ToObject());\n            \/\/ todo - how to check if cast worked?\n            uint32_t i = 0;\n            uint32_t a_length = arr->Length();\n            while (i < a_length) {\n                l->layer_->add_style(TOSTR(arr->Get(i)));\n                i++;\n            }\n        }\n    }\n    else if (a == \"datasource\")\n    {\n        Local<Object> obj = value->ToObject();\n        if (value->IsNull() || value->IsUndefined()) {\n            ThrowException(Exception::TypeError(String::New(\"mapnik.Datasource, or mapnik.MemoryDatasource instance expected\")));\n        } else {\n            if (Datasource::constructor->HasInstance(obj)) {\n                Datasource *d = ObjectWrap::Unwrap<Datasource>(obj);\n                l->layer_->set_datasource(d->get());\n            }\n            \/*else if (JSDatasource::constructor->HasInstance(obj))\n            {\n                JSDatasource *d = ObjectWrap::Unwrap<JSDatasource>(obj);\n                l->layer_->set_datasource(d->get());\n            }*\/\n            else if (MemoryDatasource::constructor->HasInstance(obj))\n            {\n                MemoryDatasource *d = ObjectWrap::Unwrap<MemoryDatasource>(obj);\n                l->layer_->set_datasource(d->get());\n            }\n            else\n            {\n                ThrowException(Exception::TypeError(String::New(\"mapnik.Datasource, mapnik.JSDatasource, or mapnik.MemoryDatasource instance expected\")));\n            }\n        }\n    }\n}\n\nHandle<Value> Layer::describe(const Arguments& args)\n{\n    HandleScope scope;\n\n    Layer* l = ObjectWrap::Unwrap<Layer>(args.This());\n\n    Local<Object> description = Object::New();\n    mapnik::layer const& layer = *l->layer_;\n    if ( layer.name() != \"\" )\n    {\n        description->Set(String::NewSymbol(\"name\"), String::New(layer.name().c_str()));\n    }\n\n    if ( layer.srs() != \"\" )\n    {\n        description->Set(String::NewSymbol(\"srs\"), String::New(layer.srs().c_str()));\n    }\n\n    if ( !layer.active())\n    {\n        description->Set(String::NewSymbol(\"status\"), Boolean::New(layer.active()));\n    }\n\n    if ( layer.clear_label_cache())\n    {\n        description->Set(String::NewSymbol(\"clear_label_cache\"), Boolean::New(layer.clear_label_cache()));\n    }\n\n    if ( layer.min_zoom() > 0)\n    {\n        description->Set(String::NewSymbol(\"minzoom\"), Number::New(layer.min_zoom()));\n    }\n\n    if ( layer.max_zoom() != std::numeric_limits<double>::max() )\n    {\n        description->Set(String::NewSymbol(\"maxzoom\"), Number::New(layer.max_zoom()));\n    }\n\n    if ( layer.queryable())\n    {\n        description->Set(String::NewSymbol(\"queryable\"), Boolean::New(layer.queryable()));\n    }\n\n    std::vector<std::string> const& style_names = layer.styles();\n    Local<Array> s = Array::New(style_names.size());\n    for (unsigned i = 0; i < style_names.size(); ++i)\n    {\n        s->Set(i, String::New(style_names[i].c_str()) );\n    }\n\n    description->Set(String::NewSymbol(\"styles\"), s );\n\n    mapnik::datasource_ptr datasource = layer.datasource();\n    Local<v8::Object> ds = Object::New();\n    description->Set(String::NewSymbol(\"datasource\"), ds );\n    if ( datasource )\n    {\n        mapnik::parameters::const_iterator it = datasource->params().begin();\n        mapnik::parameters::const_iterator end = datasource->params().end();\n        for (; it != end; ++it)\n        {\n            node_mapnik::params_to_object serializer( ds , it->first);\n            boost::apply_visitor( serializer, it->second );\n        }\n    }\n\n    return scope.Close(description);\n}\n\n#if MAPNIK_VERSION <= 200000\n#undef active\n#undef min_zoom\n#undef max_zoom\n#undef queryable\n#undef active\n#undef visible\n#endif\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\/impl\/codegen\/grpc_types.h>\n#include <grpc\/impl\/codegen\/log.h>\n#include <string.h>\n\n#include <grpc\/support\/log.h>\n\n#include \"src\/core\/lib\/channel\/channel_args.h\"\n#include \"src\/core\/lib\/channel\/channel_stack.h\"\n#include \"src\/core\/lib\/gpr\/useful.h\"\n#include \"src\/core\/lib\/iomgr\/exec_ctx.h\"\n#include \"src\/core\/lib\/surface\/channel.h\"\n#include \"test\/core\/util\/test_config.h\"\n\nstatic void test_create(void) {\n  grpc_core::ExecCtx exec_ctx;\n  grpc_arg to_add[2];\n  grpc_channel_args* ch_args;\n\n  to_add[0] =\n      grpc_channel_arg_integer_create(const_cast<char*>(\"int_arg\"), 123);\n  to_add[1] = grpc_channel_arg_string_create(const_cast<char*>(\"str key\"),\n                                             const_cast<char*>(\"str value\"));\n  ch_args = grpc_channel_args_copy_and_add(nullptr, to_add, 2);\n\n  GPR_ASSERT(ch_args->num_args == 2);\n  GPR_ASSERT(strcmp(ch_args->args[0].key, to_add[0].key) == 0);\n  GPR_ASSERT(ch_args->args[0].type == to_add[0].type);\n  GPR_ASSERT(ch_args->args[0].value.integer == to_add[0].value.integer);\n\n  GPR_ASSERT(strcmp(ch_args->args[1].key, to_add[1].key) == 0);\n  GPR_ASSERT(ch_args->args[1].type == to_add[1].type);\n  GPR_ASSERT(strcmp(ch_args->args[1].value.string, to_add[1].value.string) ==\n             0);\n\n  grpc_channel_args_destroy(ch_args);\n}\n\nstruct fake_class {\n  int foo;\n};\n\nstatic void* fake_pointer_arg_copy(void* arg) {\n  gpr_log(GPR_DEBUG, \"fake_pointer_arg_copy\");\n  fake_class* fc = static_cast<fake_class*>(arg);\n  fake_class* new_fc = static_cast<fake_class*>(gpr_malloc(sizeof(fake_class)));\n  new_fc->foo = fc->foo;\n  return new_fc;\n}\n\nstatic void fake_pointer_arg_destroy(void* arg) {\n  gpr_log(GPR_DEBUG, \"fake_pointer_arg_destroy\");\n  fake_class* fc = static_cast<fake_class*>(arg);\n  gpr_free(fc);\n}\n\nstatic int fake_pointer_cmp(void* a, void* b) { return GPR_ICMP(a, b); }\n\nstatic const grpc_arg_pointer_vtable fake_pointer_arg_vtable = {\n    fake_pointer_arg_copy, fake_pointer_arg_destroy, fake_pointer_cmp};\n\nstatic void test_channel_create_with_args(void) {\n  grpc_arg client_a[3];\n\n  client_a[0] =\n      grpc_channel_arg_integer_create(const_cast<char*>(\"arg_int\"), 0);\n  client_a[1] = grpc_channel_arg_string_create(\n      const_cast<char*>(\"arg_str\"), const_cast<char*>(\"arg_str_val\"));\n  \/\/ allocated and adds custom pointer arg\n  fake_class* fc = static_cast<fake_class*>(gpr_malloc(sizeof(fake_class)));\n  fc->foo = 42;\n  client_a[2] = grpc_channel_arg_pointer_create(\n      const_cast<char*>(\"arg_pointer\"), fc, &fake_pointer_arg_vtable);\n\n  \/\/ creates channel\n  grpc_channel_args client_args = {GPR_ARRAY_SIZE(client_a), client_a};\n  grpc_channel* c =\n      grpc_insecure_channel_create(\"fake_target\", &client_args, nullptr);\n  \/\/ user is can free the memory they allocated here\n  gpr_free(fc);\n  grpc_channel_destroy(c);\n}\n\ngrpc_channel_args* mutate_channel_args(const char* target,\n                                       grpc_channel_args* old_args,\n                                       grpc_channel_stack_type \/*type*\/) {\n  GPR_ASSERT(old_args != nullptr);\n  GPR_ASSERT(grpc_channel_args_find(old_args, \"arg_int\")->value.integer == 0);\n  GPR_ASSERT(strcmp(grpc_channel_args_find(old_args, \"arg_str\")->value.string,\n                    \"arg_str_val\") == 0);\n  GPR_ASSERT(\n      grpc_channel_args_find(old_args, \"arg_pointer\")->value.pointer.vtable ==\n      &fake_pointer_arg_vtable);\n\n  if (strcmp(target, \"no_op_mutator\") == 0) {\n    return old_args;\n  }\n\n  GPR_ASSERT(strcmp(target, \"minimal_stack_mutator\") == 0);\n  const char* args_to_remove[] = {\"arg_int\", \"arg_str\", \"arg_pointer\"};\n\n  grpc_arg no_deadline_filter_arg = grpc_channel_arg_integer_create(\n      const_cast<char*>(GRPC_ARG_MINIMAL_STACK), 1);\n  grpc_channel_args* new_args = nullptr;\n  new_args = grpc_channel_args_copy_and_add_and_remove(\n      old_args, args_to_remove, GPR_ARRAY_SIZE(args_to_remove),\n      &no_deadline_filter_arg, 1);\n  grpc_channel_args_destroy(old_args);\n  return new_args;\n}\n\n\/\/ Minimal stack should not have deadline filter\nstatic bool channel_has_deadline_filter(grpc_channel* c) {\n  grpc_channel_stack* stack = grpc_channel_get_channel_stack(c);\n  for (size_t i = 0; i < stack->count; i++) {\n    if (strcmp(grpc_channel_stack_element(stack, i)->filter->name,\n               \"deadline\") == 0) {\n      return true;\n    }\n  }\n  return false;\n}\n\nstatic void test_channel_create_with_global_mutator(void) {\n  grpc_channel_args_set_client_channel_creation_mutator(mutate_channel_args);\n  \/\/ We also add some custom args to make sure the ownership is correct.\n  grpc_arg client_a[3];\n\n  client_a[0] =\n      grpc_channel_arg_integer_create(const_cast<char*>(\"arg_int\"), 0);\n  client_a[1] = grpc_channel_arg_string_create(\n      const_cast<char*>(\"arg_str\"), const_cast<char*>(\"arg_str_val\"));\n  \/\/ allocated and adds custom pointer arg\n  fake_class* fc = static_cast<fake_class*>(gpr_malloc(sizeof(fake_class)));\n  fc->foo = 42;\n  client_a[2] = grpc_channel_arg_pointer_create(\n      const_cast<char*>(\"arg_pointer\"), fc, &fake_pointer_arg_vtable);\n\n  \/\/ creates channels\n  grpc_channel_args client_args = {GPR_ARRAY_SIZE(client_a), client_a};\n  grpc_channel* c =\n      grpc_insecure_channel_create(\"no_op_mutator\", &client_args, nullptr);\n  GPR_ASSERT(channel_has_deadline_filter(c));\n  grpc_channel_destroy(c);\n\n  c = grpc_insecure_channel_create(\"minimal_stack_mutator\", &client_args,\n                                   nullptr);\n  GPR_ASSERT(channel_has_deadline_filter(c) == false);\n  grpc_channel_destroy(c);\n\n  gpr_free(fc);\n  auto mutator = grpc_channel_args_get_client_channel_creation_mutator();\n  GPR_ASSERT(mutator == &mutate_channel_args);\n}\n\nstatic void test_server_create_with_args(void) {\n  grpc_arg server_a[3];\n\n  \/\/ adds integer arg\n  server_a[0].type = GRPC_ARG_INTEGER;\n  server_a[0].key = const_cast<char*>(\"arg_int\");\n  server_a[0].value.integer = 0;\n\n  \/\/ adds const str arg\n  server_a[1].type = GRPC_ARG_STRING;\n  server_a[1].key = const_cast<char*>(\"arg_str\");\n  server_a[1].value.string = const_cast<char*>(\"arg_str_val\");\n\n  \/\/ allocated and adds custom pointer arg\n  fake_class* fc = static_cast<fake_class*>(gpr_malloc(sizeof(fake_class)));\n  fc->foo = 42;\n  server_a[2].type = GRPC_ARG_POINTER;\n  server_a[2].key = const_cast<char*>(\"arg_pointer\");\n  server_a[2].value.pointer.vtable = &fake_pointer_arg_vtable;\n  server_a[2].value.pointer.p = fc;\n\n  \/\/ creates server\n  grpc_channel_args server_args = {GPR_ARRAY_SIZE(server_a), server_a};\n  grpc_server* s = grpc_server_create(&server_args, nullptr);\n  \/\/ user is can free the memory they allocated here\n  gpr_free(fc);\n  grpc_server_destroy(s);\n}\n\nint main(int argc, char** argv) {\n  grpc::testing::TestEnvironment env(argc, argv);\n  grpc_init();\n  test_create();\n  test_channel_create_with_args();\n  test_server_create_with_args();\n  \/\/ This has to be the last test.\n  test_channel_create_with_global_mutator();\n  grpc_shutdown();\n  return 0;\n}\n<commit_msg>Temporarily disable client_idle filter check<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\/impl\/codegen\/grpc_types.h>\n#include <grpc\/impl\/codegen\/log.h>\n#include <string.h>\n\n#include <grpc\/support\/log.h>\n\n#include \"src\/core\/lib\/channel\/channel_args.h\"\n#include \"src\/core\/lib\/channel\/channel_stack.h\"\n#include \"src\/core\/lib\/gpr\/useful.h\"\n#include \"src\/core\/lib\/iomgr\/exec_ctx.h\"\n#include \"src\/core\/lib\/surface\/channel.h\"\n#include \"test\/core\/util\/test_config.h\"\n\nstatic void test_create(void) {\n  grpc_core::ExecCtx exec_ctx;\n  grpc_arg to_add[2];\n  grpc_channel_args* ch_args;\n\n  to_add[0] =\n      grpc_channel_arg_integer_create(const_cast<char*>(\"int_arg\"), 123);\n  to_add[1] = grpc_channel_arg_string_create(const_cast<char*>(\"str key\"),\n                                             const_cast<char*>(\"str value\"));\n  ch_args = grpc_channel_args_copy_and_add(nullptr, to_add, 2);\n\n  GPR_ASSERT(ch_args->num_args == 2);\n  GPR_ASSERT(strcmp(ch_args->args[0].key, to_add[0].key) == 0);\n  GPR_ASSERT(ch_args->args[0].type == to_add[0].type);\n  GPR_ASSERT(ch_args->args[0].value.integer == to_add[0].value.integer);\n\n  GPR_ASSERT(strcmp(ch_args->args[1].key, to_add[1].key) == 0);\n  GPR_ASSERT(ch_args->args[1].type == to_add[1].type);\n  GPR_ASSERT(strcmp(ch_args->args[1].value.string, to_add[1].value.string) ==\n             0);\n\n  grpc_channel_args_destroy(ch_args);\n}\n\nstruct fake_class {\n  int foo;\n};\n\nstatic void* fake_pointer_arg_copy(void* arg) {\n  gpr_log(GPR_DEBUG, \"fake_pointer_arg_copy\");\n  fake_class* fc = static_cast<fake_class*>(arg);\n  fake_class* new_fc = static_cast<fake_class*>(gpr_malloc(sizeof(fake_class)));\n  new_fc->foo = fc->foo;\n  return new_fc;\n}\n\nstatic void fake_pointer_arg_destroy(void* arg) {\n  gpr_log(GPR_DEBUG, \"fake_pointer_arg_destroy\");\n  fake_class* fc = static_cast<fake_class*>(arg);\n  gpr_free(fc);\n}\n\nstatic int fake_pointer_cmp(void* a, void* b) { return GPR_ICMP(a, b); }\n\nstatic const grpc_arg_pointer_vtable fake_pointer_arg_vtable = {\n    fake_pointer_arg_copy, fake_pointer_arg_destroy, fake_pointer_cmp};\n\nstatic void test_channel_create_with_args(void) {\n  grpc_arg client_a[3];\n\n  client_a[0] =\n      grpc_channel_arg_integer_create(const_cast<char*>(\"arg_int\"), 0);\n  client_a[1] = grpc_channel_arg_string_create(\n      const_cast<char*>(\"arg_str\"), const_cast<char*>(\"arg_str_val\"));\n  \/\/ allocated and adds custom pointer arg\n  fake_class* fc = static_cast<fake_class*>(gpr_malloc(sizeof(fake_class)));\n  fc->foo = 42;\n  client_a[2] = grpc_channel_arg_pointer_create(\n      const_cast<char*>(\"arg_pointer\"), fc, &fake_pointer_arg_vtable);\n\n  \/\/ creates channel\n  grpc_channel_args client_args = {GPR_ARRAY_SIZE(client_a), client_a};\n  grpc_channel* c =\n      grpc_insecure_channel_create(\"fake_target\", &client_args, nullptr);\n  \/\/ user is can free the memory they allocated here\n  gpr_free(fc);\n  grpc_channel_destroy(c);\n}\n\ngrpc_channel_args* mutate_channel_args(const char* target,\n                                       grpc_channel_args* old_args,\n                                       grpc_channel_stack_type \/*type*\/) {\n  GPR_ASSERT(old_args != nullptr);\n  GPR_ASSERT(grpc_channel_args_find(old_args, \"arg_int\")->value.integer == 0);\n  GPR_ASSERT(strcmp(grpc_channel_args_find(old_args, \"arg_str\")->value.string,\n                    \"arg_str_val\") == 0);\n  GPR_ASSERT(\n      grpc_channel_args_find(old_args, \"arg_pointer\")->value.pointer.vtable ==\n      &fake_pointer_arg_vtable);\n\n  if (strcmp(target, \"no_op_mutator\") == 0) {\n    return old_args;\n  }\n\n  GPR_ASSERT(strcmp(target, \"minimal_stack_mutator\") == 0);\n  const char* args_to_remove[] = {\"arg_int\", \"arg_str\", \"arg_pointer\"};\n\n  grpc_arg no_deadline_filter_arg = grpc_channel_arg_integer_create(\n      const_cast<char*>(GRPC_ARG_MINIMAL_STACK), 1);\n  grpc_channel_args* new_args = nullptr;\n  new_args = grpc_channel_args_copy_and_add_and_remove(\n      old_args, args_to_remove, GPR_ARRAY_SIZE(args_to_remove),\n      &no_deadline_filter_arg, 1);\n  grpc_channel_args_destroy(old_args);\n  return new_args;\n}\n\n\/\/ Minimal stack should not have client_idle filter\nstatic bool channel_has_client_idle_filter(grpc_channel* c) {\n  grpc_channel_stack* stack = grpc_channel_get_channel_stack(c);\n  for (size_t i = 0; i < stack->count; i++) {\n    if (strcmp(grpc_channel_stack_element(stack, i)->filter->name,\n               \"client_idle\") == 0) {\n      return true;\n    }\n  }\n  return false;\n}\n\nstatic void test_channel_create_with_global_mutator(void) {\n  grpc_channel_args_set_client_channel_creation_mutator(mutate_channel_args);\n  \/\/ We also add some custom args to make sure the ownership is correct.\n  grpc_arg client_a[3];\n\n  client_a[0] =\n      grpc_channel_arg_integer_create(const_cast<char*>(\"arg_int\"), 0);\n  client_a[1] = grpc_channel_arg_string_create(\n      const_cast<char*>(\"arg_str\"), const_cast<char*>(\"arg_str_val\"));\n  \/\/ allocated and adds custom pointer arg\n  fake_class* fc = static_cast<fake_class*>(gpr_malloc(sizeof(fake_class)));\n  fc->foo = 42;\n  client_a[2] = grpc_channel_arg_pointer_create(\n      const_cast<char*>(\"arg_pointer\"), fc, &fake_pointer_arg_vtable);\n\n  \/\/ creates channels\n  grpc_channel_args client_args = {GPR_ARRAY_SIZE(client_a), client_a};\n  grpc_channel* c =\n      grpc_insecure_channel_create(\"no_op_mutator\", &client_args, nullptr);\n  GPR_ASSERT(channel_has_client_idle_filter(c));\n  grpc_channel_destroy(c);\n\n  c = grpc_insecure_channel_create(\"minimal_stack_mutator\", &client_args,\n                                   nullptr);\n  GPR_ASSERT(channel_has_client_idle_filter(c) == false);\n  grpc_channel_destroy(c);\n\n  gpr_free(fc);\n  auto mutator = grpc_channel_args_get_client_channel_creation_mutator();\n  GPR_ASSERT(mutator == &mutate_channel_args);\n}\n\nstatic void test_server_create_with_args(void) {\n  grpc_arg server_a[3];\n\n  \/\/ adds integer arg\n  server_a[0].type = GRPC_ARG_INTEGER;\n  server_a[0].key = const_cast<char*>(\"arg_int\");\n  server_a[0].value.integer = 0;\n\n  \/\/ adds const str arg\n  server_a[1].type = GRPC_ARG_STRING;\n  server_a[1].key = const_cast<char*>(\"arg_str\");\n  server_a[1].value.string = const_cast<char*>(\"arg_str_val\");\n\n  \/\/ allocated and adds custom pointer arg\n  fake_class* fc = static_cast<fake_class*>(gpr_malloc(sizeof(fake_class)));\n  fc->foo = 42;\n  server_a[2].type = GRPC_ARG_POINTER;\n  server_a[2].key = const_cast<char*>(\"arg_pointer\");\n  server_a[2].value.pointer.vtable = &fake_pointer_arg_vtable;\n  server_a[2].value.pointer.p = fc;\n\n  \/\/ creates server\n  grpc_channel_args server_args = {GPR_ARRAY_SIZE(server_a), server_a};\n  grpc_server* s = grpc_server_create(&server_args, nullptr);\n  \/\/ user is can free the memory they allocated here\n  gpr_free(fc);\n  grpc_server_destroy(s);\n}\n\nint main(int argc, char** argv) {\n  grpc::testing::TestEnvironment env(argc, argv);\n  grpc_init();\n  test_create();\n  test_channel_create_with_args();\n  test_server_create_with_args();\n  \/\/ This has to be the last test.\n  \/\/ TODO(markdroth): re-enable this test once client_idle is re-enabled\n  \/\/ test_channel_create_with_global_mutator();\n  grpc_shutdown();\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 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 * $Log$\n * Revision 1.1  2002\/12\/09 15:45:13  knoaman\n * Initial check-in.\n *\n *\/\n\n\n#if !defined(DGXMLSCANNER_HPP)\n#define DGXMLSCANNER_HPP\n\n#include <xercesc\/internal\/XMLScanner.hpp>\n#include <xercesc\/internal\/ElemStack.hpp>\n#include <xercesc\/util\/ValueVectorOf.hpp>\n#include <xercesc\/validators\/common\/Grammar.hpp>\n\nXERCES_CPP_NAMESPACE_BEGIN\n\nclass DTDGrammar;\nclass DTDValidator;\n\n\n\/\/  This is an integrated scanner class, which does DTD\/XML Schema grammar\n\/\/  processing.\nclass XMLPARSER_EXPORT DGXMLScanner : public XMLScanner\n{\npublic :\n    \/\/ -----------------------------------------------------------------------\n    \/\/  Constructors and Destructor\n    \/\/ -----------------------------------------------------------------------\n    DGXMLScanner\n    (\n        XMLValidator* const valToAdopt\n    );\n    DGXMLScanner\n    (\n        XMLDocumentHandler* const  docHandler\n        , DocTypeHandler* const    docTypeHandler\n        , XMLEntityHandler* const  entityHandler\n        , XMLErrorReporter* const  errReporter\n        , XMLValidator* const      valToAdopt\n    );\n    virtual ~DGXMLScanner();\n\n    \/\/ -----------------------------------------------------------------------\n    \/\/  XMLScanner public virtual methods\n    \/\/ -----------------------------------------------------------------------\n    virtual const XMLCh* getName() const;\n    virtual NameIdPool<DTDEntityDecl>* getEntityDeclPool();\n    virtual const NameIdPool<DTDEntityDecl>* getEntityDeclPool() const;\n    virtual unsigned int resolveQName\n    (\n        const   XMLCh* const        qName\n        ,       XMLBuffer&          prefixBufToFill\n        , const short               mode\n        ,       int&                prefixColonPos\n    );\n    virtual void scanDocument\n    (\n        const   InputSource&    src\n    );\n    virtual bool scanNext(XMLPScanToken& toFill);\n    virtual Grammar* loadGrammar\n    (\n        const   InputSource&    src\n        , const short           grammarType\n        , const bool            toCache = false\n    );\n\nprivate :\n    \/\/ -----------------------------------------------------------------------\n    \/\/  Unimplemented constructors and operators\n    \/\/ -----------------------------------------------------------------------\n    DGXMLScanner();\n    DGXMLScanner(const DGXMLScanner&);\n    void operator=(const DGXMLScanner&);\n\n    \/\/ -----------------------------------------------------------------------\n    \/\/  XMLScanner virtual methods\n    \/\/ -----------------------------------------------------------------------\n    virtual void scanCDSection();\n    virtual void scanCharData(XMLBuffer& toToUse);\n    virtual EntityExpRes scanEntityRef\n    (\n        const   bool    inAttVal\n        ,       XMLCh&  firstCh\n        ,       XMLCh&  secondCh\n        ,       bool&   escaped\n    );\n    virtual void scanDocTypeDecl();\n    virtual void scanReset(const InputSource& src);\n    virtual void sendCharData(XMLBuffer& toSend);\n\n    \/\/ -----------------------------------------------------------------------\n    \/\/  Private helper methods\n    \/\/ -----------------------------------------------------------------------\n    void commonInit();\n    void cleanUp();\n    InputSource* resolveSystemId(const XMLCh* const sysId); \/\/ return owned by caller\n    unsigned int buildAttList\n    (\n        const unsigned int                attCount\n        ,       XMLElementDecl*             elemDecl\n        ,       RefVectorOf<XMLAttr>&       toFill\n    );\n    unsigned int resolvePrefix\n    (\n        const   XMLCh* const        prefix\n        , const ElemStack::MapModes mode\n    );\n    void updateNSMap\n    (\n        const   XMLCh* const attrPrefix\n        , const XMLCh* const attrLocalName\n        , const XMLCh* const attrValue\n    );\n    void scanAttrListforNameSpaces(RefVectorOf<XMLAttr>* theAttrList, int attCount);\n\n    \/\/ -----------------------------------------------------------------------\n    \/\/  Private scanning methods\n    \/\/ -----------------------------------------------------------------------\n    bool scanAttValue\n    (\n        const   XMLAttDef* const    attDef\n        ,       XMLBuffer&          toFill\n    );\n    bool scanContent(const bool extEntity);\n    void scanEndTag(bool& gotData);\n    bool scanStartTag(bool& gotData);\n    bool scanStartTagNS(bool& gotData);\n\n    \/\/ -----------------------------------------------------------------------\n    \/\/  Grammar preparsing methods\n    \/\/ -----------------------------------------------------------------------\n    Grammar* loadDTDGrammar(const InputSource& src, const bool toCache = false);\n\n    \/\/ -----------------------------------------------------------------------\n    \/\/  Data members\n    \/\/\n    \/\/  fElemStack\n    \/\/      This is the element stack that is used to track the elements that\n    \/\/      are currently being worked on.\n    \/\/\n    \/\/  fRawAttrList\n    \/\/      During the initial scan of the attributes we can only do a raw\n    \/\/      scan for key\/value pairs. So this vector is used to store them\n    \/\/      until they can be processed (and put into fAttrList.)\n    \/\/\n    \/\/  fDTDValidator\n    \/\/      The DTD validator instance.\n    \/\/\n    \/\/  fSchemaValidator\n    \/\/      The Schema validator instance.\n    \/\/\n    \/\/  fSeeXsi\n    \/\/      This flag indicates a schema has been seen.\n    \/\/\n    \/\/  fElemState\n    \/\/  fElemStateSize\n    \/\/      Stores an element next state from DFA content model - used for\n    \/\/      wildcard validation\n    \/\/\n    \/\/  fMatcherStack\n    \/\/      Stack of active XPath matchers for identity constraints. All\n    \/\/      active XPath matchers are notified of startElement, characters\n    \/\/      and endElement callbacks in order to perform their matches.\n    \/\/\n    \/\/  fValueStoreCache\n    \/\/      Cache of value stores for identity constraint fields.\n    \/\/\n    \/\/  fFieldActivator\n    \/\/      Activates fields within a certain scope when a selector matches\n    \/\/      its xpath.\n    \/\/\n    \/\/ -----------------------------------------------------------------------\n    ElemStack                   fElemStack;\n    ValueVectorOf<XMLAttr*>*    fAttrNSList;\n    DTDValidator*               fDTDValidator;\n    DTDGrammar*                 fDTDGrammar;\n};\n\ninline const XMLCh* DGXMLScanner::getName() const\n{\n    return XMLUni::fgIGScanner;\n}\n\n\nXERCES_CPP_NAMESPACE_END\n\n#endif\n<commit_msg>Return proper scanner name.<commit_after>\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 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 * $Log$\n * Revision 1.2  2003\/01\/13 18:29:41  knoaman\n * Return proper scanner name.\n *\n * Revision 1.1  2002\/12\/09 15:45:13  knoaman\n * Initial check-in.\n *\n *\/\n\n\n#if !defined(DGXMLSCANNER_HPP)\n#define DGXMLSCANNER_HPP\n\n#include <xercesc\/internal\/XMLScanner.hpp>\n#include <xercesc\/internal\/ElemStack.hpp>\n#include <xercesc\/util\/ValueVectorOf.hpp>\n#include <xercesc\/validators\/common\/Grammar.hpp>\n\nXERCES_CPP_NAMESPACE_BEGIN\n\nclass DTDGrammar;\nclass DTDValidator;\n\n\n\/\/  This is an integrated scanner class, which does DTD\/XML Schema grammar\n\/\/  processing.\nclass XMLPARSER_EXPORT DGXMLScanner : public XMLScanner\n{\npublic :\n    \/\/ -----------------------------------------------------------------------\n    \/\/  Constructors and Destructor\n    \/\/ -----------------------------------------------------------------------\n    DGXMLScanner\n    (\n        XMLValidator* const valToAdopt\n    );\n    DGXMLScanner\n    (\n        XMLDocumentHandler* const  docHandler\n        , DocTypeHandler* const    docTypeHandler\n        , XMLEntityHandler* const  entityHandler\n        , XMLErrorReporter* const  errReporter\n        , XMLValidator* const      valToAdopt\n    );\n    virtual ~DGXMLScanner();\n\n    \/\/ -----------------------------------------------------------------------\n    \/\/  XMLScanner public virtual methods\n    \/\/ -----------------------------------------------------------------------\n    virtual const XMLCh* getName() const;\n    virtual NameIdPool<DTDEntityDecl>* getEntityDeclPool();\n    virtual const NameIdPool<DTDEntityDecl>* getEntityDeclPool() const;\n    virtual unsigned int resolveQName\n    (\n        const   XMLCh* const        qName\n        ,       XMLBuffer&          prefixBufToFill\n        , const short               mode\n        ,       int&                prefixColonPos\n    );\n    virtual void scanDocument\n    (\n        const   InputSource&    src\n    );\n    virtual bool scanNext(XMLPScanToken& toFill);\n    virtual Grammar* loadGrammar\n    (\n        const   InputSource&    src\n        , const short           grammarType\n        , const bool            toCache = false\n    );\n\nprivate :\n    \/\/ -----------------------------------------------------------------------\n    \/\/  Unimplemented constructors and operators\n    \/\/ -----------------------------------------------------------------------\n    DGXMLScanner();\n    DGXMLScanner(const DGXMLScanner&);\n    void operator=(const DGXMLScanner&);\n\n    \/\/ -----------------------------------------------------------------------\n    \/\/  XMLScanner virtual methods\n    \/\/ -----------------------------------------------------------------------\n    virtual void scanCDSection();\n    virtual void scanCharData(XMLBuffer& toToUse);\n    virtual EntityExpRes scanEntityRef\n    (\n        const   bool    inAttVal\n        ,       XMLCh&  firstCh\n        ,       XMLCh&  secondCh\n        ,       bool&   escaped\n    );\n    virtual void scanDocTypeDecl();\n    virtual void scanReset(const InputSource& src);\n    virtual void sendCharData(XMLBuffer& toSend);\n\n    \/\/ -----------------------------------------------------------------------\n    \/\/  Private helper methods\n    \/\/ -----------------------------------------------------------------------\n    void commonInit();\n    void cleanUp();\n    InputSource* resolveSystemId(const XMLCh* const sysId); \/\/ return owned by caller\n    unsigned int buildAttList\n    (\n        const unsigned int                attCount\n        ,       XMLElementDecl*             elemDecl\n        ,       RefVectorOf<XMLAttr>&       toFill\n    );\n    unsigned int resolvePrefix\n    (\n        const   XMLCh* const        prefix\n        , const ElemStack::MapModes mode\n    );\n    void updateNSMap\n    (\n        const   XMLCh* const attrPrefix\n        , const XMLCh* const attrLocalName\n        , const XMLCh* const attrValue\n    );\n    void scanAttrListforNameSpaces(RefVectorOf<XMLAttr>* theAttrList, int attCount);\n\n    \/\/ -----------------------------------------------------------------------\n    \/\/  Private scanning methods\n    \/\/ -----------------------------------------------------------------------\n    bool scanAttValue\n    (\n        const   XMLAttDef* const    attDef\n        ,       XMLBuffer&          toFill\n    );\n    bool scanContent(const bool extEntity);\n    void scanEndTag(bool& gotData);\n    bool scanStartTag(bool& gotData);\n    bool scanStartTagNS(bool& gotData);\n\n    \/\/ -----------------------------------------------------------------------\n    \/\/  Grammar preparsing methods\n    \/\/ -----------------------------------------------------------------------\n    Grammar* loadDTDGrammar(const InputSource& src, const bool toCache = false);\n\n    \/\/ -----------------------------------------------------------------------\n    \/\/  Data members\n    \/\/\n    \/\/  fElemStack\n    \/\/      This is the element stack that is used to track the elements that\n    \/\/      are currently being worked on.\n    \/\/\n    \/\/  fRawAttrList\n    \/\/      During the initial scan of the attributes we can only do a raw\n    \/\/      scan for key\/value pairs. So this vector is used to store them\n    \/\/      until they can be processed (and put into fAttrList.)\n    \/\/\n    \/\/  fDTDValidator\n    \/\/      The DTD validator instance.\n    \/\/\n    \/\/  fSchemaValidator\n    \/\/      The Schema validator instance.\n    \/\/\n    \/\/  fSeeXsi\n    \/\/      This flag indicates a schema has been seen.\n    \/\/\n    \/\/  fElemState\n    \/\/  fElemStateSize\n    \/\/      Stores an element next state from DFA content model - used for\n    \/\/      wildcard validation\n    \/\/\n    \/\/  fMatcherStack\n    \/\/      Stack of active XPath matchers for identity constraints. All\n    \/\/      active XPath matchers are notified of startElement, characters\n    \/\/      and endElement callbacks in order to perform their matches.\n    \/\/\n    \/\/  fValueStoreCache\n    \/\/      Cache of value stores for identity constraint fields.\n    \/\/\n    \/\/  fFieldActivator\n    \/\/      Activates fields within a certain scope when a selector matches\n    \/\/      its xpath.\n    \/\/\n    \/\/ -----------------------------------------------------------------------\n    ElemStack                   fElemStack;\n    ValueVectorOf<XMLAttr*>*    fAttrNSList;\n    DTDValidator*               fDTDValidator;\n    DTDGrammar*                 fDTDGrammar;\n};\n\ninline const XMLCh* DGXMLScanner::getName() const\n{\n    return XMLUni::fgDGScanner;\n}\n\n\nXERCES_CPP_NAMESPACE_END\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2010 David Benjamin. All rights reserved.\n\/\/ Use of this source code is governed by an MIT-style license that can be\n\/\/ found in the LICENSE file.\n#include \"identifiers.h\"\n\n#include \"browser.h\"\n\nnamespace {\n\n#define IDENTIFIER(symbol) const NPUTF8 STR_ ## symbol [] = #symbol;\n#include \"identifier_list.inc.h\"\n#undef IDENTIFIER\n\nconst NPUTF8 *strings[] = {\n    #define IDENTIFIER(symbol) STR_ ## symbol ,\n    #include \"identifier_list.inc.h\"\n    #undef IDENTIFIER\n};\n\n}\n\nnamespace identifier {\nNPIdentifier identifiers[NUM_SYMBOLS] = { 0 };\n}\n\nvoid initializeIdentifiers() {\n    NPN_GetStringIdentifiers(strings,\n                             sizeof(strings) \/ sizeof(strings[0]),\n                             identifier::identifiers);\n}\n<commit_msg>Simplify identifier generation somewhat<commit_after>\/\/ Copyright (c) 2010 David Benjamin. All rights reserved.\n\/\/ Use of this source code is governed by an MIT-style license that can be\n\/\/ found in the LICENSE file.\n#include \"identifiers.h\"\n\n#include \"browser.h\"\n\nnamespace {\n\nconst NPUTF8 *strings[] = {\n    #define IDENTIFIER(symbol) # symbol ,\n    #include \"identifier_list.inc.h\"\n    #undef IDENTIFIER\n};\n\n}\n\nnamespace identifier {\nNPIdentifier identifiers[NUM_SYMBOLS] = { 0 };\n}\n\nvoid initializeIdentifiers() {\n    NPN_GetStringIdentifiers(strings,\n                             sizeof(strings) \/ sizeof(strings[0]),\n                             identifier::identifiers);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * This file is part of the CernVM File System.\n *\/\n\n#include <string>\n\n#include \"cvmfs_config.h\"\n\n#include <cassert>\n\n#include \"logging.h\"\n#include \"swissknife.h\"\n\n#include \"swissknife_check.h\"\n#include \"swissknife_diff.h\"\n#include \"swissknife_gc.h\"\n#include \"swissknife_graft.h\"\n#include \"swissknife_hash.h\"\n#include \"swissknife_history.h\"\n#include \"swissknife_info.h\"\n#include \"swissknife_ingest.h\"\n#include \"swissknife_lease.h\"\n#include \"swissknife_letter.h\"\n#include \"swissknife_lsrepo.h\"\n#include \"swissknife_migrate.h\"\n#include \"swissknife_pull.h\"\n#include \"swissknife_reflog.h\"\n#include \"swissknife_scrub.h\"\n#include \"swissknife_sign.h\"\n#include \"swissknife_sync.h\"\n#include \"swissknife_zpipe.h\"\n#include \"util\/string.h\"\n\nusing namespace std;  \/\/ NOLINT\n\ntypedef vector<swissknife::Command *> Commands;\nCommands command_list;\n\nvoid Usage() {\n  LogCvmfs(kLogCvmfs, kLogStdout,\n    \"CernVM-FS repository storage management commands\\n\"\n    \"Version %s\\n\"\n    \"Usage (normally called from cvmfs_server):\\n\"\n    \"  cvmfs_swissknife <command> [options]\\n\",\n    VERSION);\n\n  for (unsigned i = 0; i < command_list.size(); ++i) {\n    LogCvmfs(kLogCvmfs, kLogStdout | kLogNoLinebreak, \"\\n\"\n             \"Command %s\\n\"\n             \"--------\", command_list[i]->GetName().c_str());\n    for (unsigned j = 0; j < command_list[i]->GetName().length(); ++j) {\n      LogCvmfs(kLogCvmfs, kLogStdout | kLogNoLinebreak, \"-\");\n    }\n    LogCvmfs(kLogCvmfs, kLogStdout, \"\");\n    LogCvmfs(kLogCvmfs, kLogStdout, \"%s\",\n             command_list[i]->GetDescription().c_str());\n    swissknife::ParameterList params = command_list[i]->GetParams();\n    if (!params.empty()) {\n      LogCvmfs(kLogCvmfs, kLogStdout, \"Options:\");\n      for (unsigned j = 0; j < params.size(); ++j) {\n        LogCvmfs(kLogCvmfs, kLogStdout | kLogNoLinebreak, \"  -%c    %s\",\n                 params[j].key(), params[j].description().c_str());\n        if (params[j].optional())\n          LogCvmfs(kLogCvmfs, kLogStdout | kLogNoLinebreak, \" (optional)\");\n        LogCvmfs(kLogCvmfs, kLogStdout, \"\");\n      }\n    }  \/\/ Parameter list\n  }  \/\/ Command list\n\n  LogCvmfs(kLogCvmfs, kLogStdout, \"\");\n}\n\n\nint main(int argc, char **argv) {\n  command_list.push_back(new swissknife::CommandCreate());\n  command_list.push_back(new swissknife::CommandUpload());\n  command_list.push_back(new swissknife::CommandRemove());\n  command_list.push_back(new swissknife::CommandPeek());\n  command_list.push_back(new swissknife::CommandSync());\n  command_list.push_back(new swissknife::CommandApplyDirtab());\n  command_list.push_back(new swissknife::CommandEditTag());\n  command_list.push_back(new swissknife::CommandListTags());\n  command_list.push_back(new swissknife::CommandInfoTag());\n  command_list.push_back(new swissknife::CommandRollbackTag());\n  command_list.push_back(new swissknife::CommandEmptyRecycleBin());\n  command_list.push_back(new swissknife::CommandSign());\n  command_list.push_back(new swissknife::CommandLetter());\n  command_list.push_back(new swissknife::CommandCheck());\n  command_list.push_back(new swissknife::CommandListCatalogs());\n  command_list.push_back(new swissknife::CommandDiff());\n  command_list.push_back(new swissknife::CommandPull());\n  command_list.push_back(new swissknife::CommandZpipe());\n  command_list.push_back(new swissknife::CommandGraft());\n  command_list.push_back(new swissknife::CommandHash());\n  command_list.push_back(new swissknife::CommandInfo());\n  command_list.push_back(new swissknife::CommandVersion());\n  command_list.push_back(new swissknife::CommandMigrate());\n  command_list.push_back(new swissknife::CommandScrub());\n  command_list.push_back(new swissknife::CommandGc());\n  command_list.push_back(new swissknife::CommandReconstructReflog());\n  command_list.push_back(new swissknife::CommandLease());\n  command_list.push_back(new swissknife::Ingest());\n\n  if (argc < 2) {\n    Usage();\n    return 1;\n  }\n  if ((string(argv[1]) == \"--help\")) {\n    Usage();\n    return 0;\n  }\n  if ((string(argv[1]) == \"--version\")) {\n    swissknife::CommandVersion().Main(swissknife::ArgumentList());\n    return 0;\n  }\n\n  \/\/ find the command to be run\n  swissknife::Command *command = NULL;\n  for (unsigned i = 0; i < command_list.size(); ++i) {\n    if (command_list[i]->GetName() == string(argv[1])) {\n      command = command_list[i];\n      break;\n    }\n  }\n\n  if (NULL == command) {\n    Usage();\n    return 1;\n  }\n\n  bool display_statistics = false;\n\n  \/\/ parse the command line arguments for the Command\n  swissknife::ArgumentList args;\n  optind = 1;\n  string option_string = \"\";\n  swissknife::ParameterList params = command->GetParams();\n  for (unsigned j = 0; j < params.size(); ++j) {\n    option_string.push_back(params[j].key());\n    if (!params[j].switch_only())\n      option_string.push_back(':');\n  }\n  \/\/ Now adding the generic -+ extra option command\n  option_string.push_back(swissknife::Command::kGenericParam);\n  option_string.push_back(':');\n  int c;\n  while ((c = getopt(argc, argv, option_string.c_str())) != -1) {\n    bool valid_option = false;\n    for (unsigned j = 0; j < params.size(); ++j) {\n      if (c == params[j].key()) {\n        assert(c != swissknife::Command::kGenericParam);\n        valid_option = true;\n        string *argument = NULL;\n        if (!params[j].switch_only()) {\n          argument = new string(optarg);\n        }\n        args[c] = argument;\n        break;\n      }\n    }\n    if (c == swissknife::Command::kGenericParam) {\n      valid_option = true;\n      vector<string> flags = SplitString(optarg,\n                                         swissknife::\n                                         Command::kGenericParamSeparator);\n      for (unsigned i = 0; i < flags.size(); ++i) {\n        if (flags[i] == \"stats\") {\n          display_statistics = true;\n        }\n      }\n    }\n    if (!valid_option) {\n      Usage();\n      return 1;\n    }\n  }\n  for (unsigned j = 0; j < params.size(); ++j) {\n    if (!params[j].optional()) {\n      if (args.find(params[j].key()) == args.end()) {\n        LogCvmfs(kLogCvmfs, kLogStderr, \"parameter -%c missing\",\n                 params[j].key());\n        return 1;\n      }\n    }\n  }\n\n  \/\/ run the command\n  const int retval = command->Main(args);\n  if (display_statistics) {\n    LogCvmfs(kLogCvmfs, kLogStdout, \"Command statistics\");\n    LogCvmfs(kLogCvmfs, kLogStdout, \"%s\",\n             command->statistics()\n             ->PrintList(perf::Statistics::kPrintHeader).c_str());\n  }\n\n  \/\/ delete the command list\n        Commands::const_iterator i    = command_list.begin();\n  const Commands::const_iterator iend = command_list.end();\n  for (; i != iend; ++i) {\n    delete *i;\n  }\n  command_list.clear();\n\n  return retval;\n}\n<commit_msg>Created a database file.<commit_after>\/**\n * This file is part of the CernVM File System.\n *\/\n\n#include <string>\n\n#include \"cvmfs_config.h\"\n\n#include <cassert>\n\n#include \"logging.h\"\n#include \"swissknife.h\"\n\n#include \"swissknife_check.h\"\n#include \"swissknife_diff.h\"\n#include \"swissknife_gc.h\"\n#include \"swissknife_graft.h\"\n#include \"swissknife_hash.h\"\n#include \"swissknife_history.h\"\n#include \"swissknife_info.h\"\n#include \"swissknife_ingest.h\"\n#include \"swissknife_lease.h\"\n#include \"swissknife_letter.h\"\n#include \"swissknife_lsrepo.h\"\n#include \"swissknife_migrate.h\"\n#include \"swissknife_pull.h\"\n#include \"swissknife_reflog.h\"\n#include \"swissknife_scrub.h\"\n#include \"swissknife_sign.h\"\n#include \"swissknife_sync.h\"\n#include \"swissknife_zpipe.h\"\n#include \"util\/string.h\"\n\nusing namespace std;  \/\/ NOLINT\n\nstruct RevisionFlags {\n  enum T {\n    kInitialRevision   = 1,\n    kUpdatableRevision = 2,\n    kUpdatedRevision   = 3,\n    kFailingRevision   = 4,\n  };\n};\n\nclass StatisticsDatabase : public sqlite::Database<StatisticsDatabase> {\n public:\n  \/\/ not const - needs to be adaptable!\n  static float        kLatestSchema;\n  \/\/ not const - needs to be adaptable!\n  static unsigned     kLatestSchemaRevision;\n  static const float  kLatestCompatibleSchema;\n  static bool         compacting_fails;\n  static unsigned int  instances;\n  unsigned int         create_empty_db_calls;\n  unsigned int         check_compatibility_calls;\n  unsigned int         live_upgrade_calls;\n  mutable unsigned int compact_calls;\n\n  bool CreateEmptyDatabase() {\n    ++create_empty_db_calls;\n\n  return sqlite::Sql(sqlite_db(),\n    \"CREATE TABLE foobar (foo TEXT, bar TEXT, \"\n    \"  CONSTRAINT pk_foo PRIMARY KEY (foo))\").Execute();\n  }\n\n  bool CheckSchemaCompatibility() {\n    ++check_compatibility_calls;\n    return (schema_version() > kLatestCompatibleSchema - 0.1 &&\n            schema_version() < kLatestCompatibleSchema + 0.1);\n  }\n\n  bool LiveSchemaUpgradeIfNecessary() {\n    ++live_upgrade_calls;\n    const unsigned int revision = schema_revision();\n\n    if (revision == RevisionFlags::kInitialRevision) {\n      return true;\n    }\n\n    if (revision == RevisionFlags::kUpdatableRevision) {\n      set_schema_revision(RevisionFlags::kUpdatedRevision);\n      StoreSchemaRevision();\n      return true;\n    }\n\n    if (revision == RevisionFlags::kFailingRevision) {\n      return false;\n    }\n\n    return false;\n  }\n\n  bool CompactDatabase() const {\n    ++compact_calls;\n    return !compacting_fails;\n  }\n\n  ~StatisticsDatabase() {\n    --StatisticsDatabase::instances;\n  }\n\n protected:\n  \/\/ TODO(rmeusel): C++11 - constructor inheritance\n  friend class sqlite::Database<StatisticsDatabase>;\n  StatisticsDatabase(const std::string  &filename,\n                const OpenMode      open_mode) :\n    sqlite::Database<StatisticsDatabase>(filename, open_mode),\n    create_empty_db_calls(0),  check_compatibility_calls(0),\n    live_upgrade_calls(0), compact_calls(0)\n  {\n    ++StatisticsDatabase::instances;\n  }\n};\n\nconst float    StatisticsDatabase::kLatestCompatibleSchema = 1.0f;\nfloat          StatisticsDatabase::kLatestSchema           = 1.0f;\nunsigned       StatisticsDatabase::kLatestSchemaRevision   = RevisionFlags::kInitialRevision;\nunsigned int   StatisticsDatabase::instances               = 0;\nbool           StatisticsDatabase::compacting_fails        = false;\n\ntypedef vector<swissknife::Command *> Commands;\nCommands command_list;\n\nvoid Usage() {\n  LogCvmfs(kLogCvmfs, kLogStdout,\n    \"CernVM-FS repository storage management commands\\n\"\n    \"Version %s\\n\"\n    \"Usage (normally called from cvmfs_server):\\n\"\n    \"  cvmfs_swissknife <command> [options]\\n\",\n    VERSION);\n\n  for (unsigned i = 0; i < command_list.size(); ++i) {\n    LogCvmfs(kLogCvmfs, kLogStdout | kLogNoLinebreak, \"\\n\"\n             \"Command %s\\n\"\n             \"--------\", command_list[i]->GetName().c_str());\n    for (unsigned j = 0; j < command_list[i]->GetName().length(); ++j) {\n      LogCvmfs(kLogCvmfs, kLogStdout | kLogNoLinebreak, \"-\");\n    }\n    LogCvmfs(kLogCvmfs, kLogStdout, \"\");\n    LogCvmfs(kLogCvmfs, kLogStdout, \"%s\",\n             command_list[i]->GetDescription().c_str());\n    swissknife::ParameterList params = command_list[i]->GetParams();\n    if (!params.empty()) {\n      LogCvmfs(kLogCvmfs, kLogStdout, \"Options:\");\n      for (unsigned j = 0; j < params.size(); ++j) {\n        LogCvmfs(kLogCvmfs, kLogStdout | kLogNoLinebreak, \"  -%c    %s\",\n                 params[j].key(), params[j].description().c_str());\n        if (params[j].optional())\n          LogCvmfs(kLogCvmfs, kLogStdout | kLogNoLinebreak, \" (optional)\");\n        LogCvmfs(kLogCvmfs, kLogStdout, \"\");\n      }\n    }  \/\/ Parameter list\n  }  \/\/ Command list\n\n  LogCvmfs(kLogCvmfs, kLogStdout, \"\");\n}\n\n\nint main(int argc, char **argv) {\n  command_list.push_back(new swissknife::CommandCreate());\n  command_list.push_back(new swissknife::CommandUpload());\n  command_list.push_back(new swissknife::CommandRemove());\n  command_list.push_back(new swissknife::CommandPeek());\n  command_list.push_back(new swissknife::CommandSync());\n  command_list.push_back(new swissknife::CommandApplyDirtab());\n  command_list.push_back(new swissknife::CommandEditTag());\n  command_list.push_back(new swissknife::CommandListTags());\n  command_list.push_back(new swissknife::CommandInfoTag());\n  command_list.push_back(new swissknife::CommandRollbackTag());\n  command_list.push_back(new swissknife::CommandEmptyRecycleBin());\n  command_list.push_back(new swissknife::CommandSign());\n  command_list.push_back(new swissknife::CommandLetter());\n  command_list.push_back(new swissknife::CommandCheck());\n  command_list.push_back(new swissknife::CommandListCatalogs());\n  command_list.push_back(new swissknife::CommandDiff());\n  command_list.push_back(new swissknife::CommandPull());\n  command_list.push_back(new swissknife::CommandZpipe());\n  command_list.push_back(new swissknife::CommandGraft());\n  command_list.push_back(new swissknife::CommandHash());\n  command_list.push_back(new swissknife::CommandInfo());\n  command_list.push_back(new swissknife::CommandVersion());\n  command_list.push_back(new swissknife::CommandMigrate());\n  command_list.push_back(new swissknife::CommandScrub());\n  command_list.push_back(new swissknife::CommandGc());\n  command_list.push_back(new swissknife::CommandReconstructReflog());\n  command_list.push_back(new swissknife::CommandLease());\n  command_list.push_back(new swissknife::Ingest());\n\n  if (argc < 2) {\n    Usage();\n    return 1;\n  }\n  if ((string(argv[1]) == \"--help\")) {\n    Usage();\n    return 0;\n  }\n  if ((string(argv[1]) == \"--version\")) {\n    swissknife::CommandVersion().Main(swissknife::ArgumentList());\n    return 0;\n  }\n\n  \/\/ find the command to be run\n  swissknife::Command *command = NULL;\n  for (unsigned i = 0; i < command_list.size(); ++i) {\n    if (command_list[i]->GetName() == string(argv[1])) {\n      command = command_list[i];\n      break;\n    }\n  }\n\n  if (NULL == command) {\n    Usage();\n    return 1;\n  }\n\n  bool display_statistics = false;\n\n  \/\/ parse the command line arguments for the Command\n  swissknife::ArgumentList args;\n  optind = 1;\n  string option_string = \"\";\n  swissknife::ParameterList params = command->GetParams();\n  for (unsigned j = 0; j < params.size(); ++j) {\n    option_string.push_back(params[j].key());\n    if (!params[j].switch_only())\n      option_string.push_back(':');\n  }\n  \/\/ Now adding the generic -+ extra option command\n  option_string.push_back(swissknife::Command::kGenericParam);\n  option_string.push_back(':');\n  int c;\n  while ((c = getopt(argc, argv, option_string.c_str())) != -1) {\n    bool valid_option = false;\n    for (unsigned j = 0; j < params.size(); ++j) {\n      if (c == params[j].key()) {\n        assert(c != swissknife::Command::kGenericParam);\n        valid_option = true;\n        string *argument = NULL;\n        if (!params[j].switch_only()) {\n          argument = new string(optarg);\n        }\n        args[c] = argument;\n        break;\n      }\n    }\n    if (c == swissknife::Command::kGenericParam) {\n      valid_option = true;\n      vector<string> flags = SplitString(optarg,\n                                         swissknife::\n                                         Command::kGenericParamSeparator);\n      for (unsigned i = 0; i < flags.size(); ++i) {\n        if (flags[i] == \"stats\") {\n          display_statistics = true;\n        }\n      }\n    }\n    if (!valid_option) {\n      Usage();\n      return 1;\n    }\n  }\n  for (unsigned j = 0; j < params.size(); ++j) {\n    if (!params[j].optional()) {\n      if (args.find(params[j].key()) == args.end()) {\n        LogCvmfs(kLogCvmfs, kLogStderr, \"parameter -%c missing\",\n                 params[j].key());\n        return 1;\n      }\n    }\n  }\n\n  \/\/ run the command\n  const int retval = command->Main(args);\n  if (display_statistics) {\n    \/\/ get the repo name\n    string repo_name = *args.find('N')->second;\n    \/\/ LogCvmfs(kLogCvmfs, kLogStdout, \"For repository [%s]\", repo_name.c_str());\n    \/\/ create a new database file if is not already there\n    StatisticsDatabase *db = StatisticsDatabase::Create(repo_name + \".db\");\n\n    LogCvmfs(kLogCvmfs, kLogStdout, \"Command statistics\");\n    LogCvmfs(kLogCvmfs, kLogStdout, \"%s\",\n             command->statistics()\n             ->PrintList(perf::Statistics::kPrintHeader).c_str());\n\n    delete db;\n  }\n\n  \/\/ delete the command list\n        Commands::const_iterator i    = command_list.begin();\n  const Commands::const_iterator iend = command_list.end();\n  for (; i != iend; ++i) {\n    delete *i;\n  }\n  command_list.clear();\n\n  return retval;\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"base\/not_null.hpp\"\n\n#include <memory>\n#include <utility>\n#include <string>\n#include <vector>\n\n#include \"base\/macros.hpp\"\n#include \"gtest\/gtest.h\"\n#include \"gmock\/gmock.h\"\n\nusing testing::Eq;\n\nnamespace principia {\nnamespace base {\n\nclass NotNullTest : public testing::Test {\n protected:\n  \/\/ A very convoluted wrapper for the x86 add...\n  void Add(not_null<int*> const destination,\n           not_null<int const*> const source) {\n    *destination += *source;\n  }\n  void Sub(not_null<int*> const destination,\n           not_null<int const*> const source) {\n    *destination -= *source;\n  }\n};\n\nusing NotNullDeathTest = NotNullTest;\n\nTEST_F(NotNullDeathTest, DeathByNullptr) {\n  EXPECT_DEATH({\n    int* const null_int_ptr = nullptr;\n    check_not_null(null_int_ptr);\n  }, \"Check failed: .* != nullptr\");\n  EXPECT_DEATH({\n    std::unique_ptr<int> null_int_ptr;\n    check_not_null(std::move(null_int_ptr));\n  }, \"Check failed: .* != nullptr\");\n}\n\nTEST_F(NotNullTest, Move) {\n  not_null<std::unique_ptr<int>> int_ptr1 = make_not_null_unique<int>(3);\n#if !PRINCIPIA_COMPILER_MSVC || (_MSC_FULL_VER != 190023506)\n  EXPECT_THAT(*(std::unique_ptr<int> const&)int_ptr1, Eq(3));\n#endif\n  not_null<std::unique_ptr<int>> int_ptr2 = std::move(int_ptr1);\n  EXPECT_THAT(*int_ptr2, Eq(3));\n  not_null<std::unique_ptr<int>> int_ptr3(std::move(int_ptr2));\n  EXPECT_THAT(*int_ptr3, Eq(3));\n  int_ptr2 = make_not_null_unique<int>(5);\n  EXPECT_THAT(*int_ptr2, Eq(5));\n  int_ptr2 = std::move(int_ptr3);\n  EXPECT_THAT(*int_ptr2, Eq(3));\n}\n\nTEST_F(NotNullTest, Copy) {\n  std::unique_ptr<int> const owner_of_three = std::make_unique<int>(3);\n  std::unique_ptr<int> const owner_of_five = std::make_unique<int>(5);\n  not_null<int*> const int_ptr1 = check_not_null(owner_of_three.get());\n  not_null<int*> int_ptr2 = int_ptr1;\n  not_null<int*> const int_ptr3(int_ptr2);\n  EXPECT_THAT(int_ptr1, Eq(owner_of_three.get()));\n  EXPECT_THAT(int_ptr2, Eq(owner_of_three.get()));\n  EXPECT_THAT(int_ptr3, Eq(owner_of_three.get()));\n  EXPECT_THAT(*int_ptr1, Eq(3));\n  EXPECT_THAT(*int_ptr2, Eq(3));\n  EXPECT_THAT(*int_ptr3, Eq(3));\n  int_ptr2 = check_not_null(owner_of_five.get());\n  EXPECT_THAT(*int_ptr2, Eq(5));\n  int_ptr2 = std::move(int_ptr3);\n  EXPECT_THAT(*int_ptr2, Eq(3));\n  EXPECT_THAT(*int_ptr3, Eq(3));\n}\n\nTEST_F(NotNullTest, CheckNotNull) {\n#if 0\n  std::unique_ptr<int> owner_int = std::make_unique<int>(3);\n  int* const constant_access_int = owner_int.get();\n  not_null<int*> const constant_not_null_access_int =\n      check_not_null(constant_access_int);\n  check_not_null(constant_not_null_access_int);\n  not_null<std::unique_ptr<int>> not_null_owner_int =\n      check_not_null(std::move(owner_int));\n  check_not_null(std::move(not_null_owner_int));\n#endif\n}\n\nTEST_F(NotNullTest, Booleans) {\n  not_null<std::unique_ptr<int>> const pointer = make_not_null_unique<int>(3);\n  EXPECT_TRUE(pointer);\n  EXPECT_TRUE(pointer != nullptr);\n  EXPECT_FALSE(pointer == nullptr);\n}\n\nTEST_F(NotNullTest, ImplicitConversions) {\n  not_null<std::unique_ptr<int>> not_null_owner_int =\n      make_not_null_unique<int>(3);\n  not_null<int const*> const constant_not_null_access_int =\n      not_null_owner_int.get();\n  \/\/ Copy constructor.\n  not_null<int const*> not_null_access_constant_int =\n      constant_not_null_access_int;\n  \/\/ Copy assignment.\n  not_null_access_constant_int = not_null_owner_int.get();\n  \/\/ Move constructor.\n  not_null<std::unique_ptr<int const>> not_null_owner_constant_int =\n      make_not_null_unique<int>(5);\n  \/\/ Move assignment.\n  not_null_owner_constant_int = std::move(not_null_owner_int);\n}\n\nTEST_F(NotNullTest, Arrow) {\n  not_null<std::unique_ptr<std::string>> not_null_owner_string =\n      make_not_null_unique<std::string>(\"-\");\n  not_null_owner_string->append(\">\");\n  EXPECT_THAT(*not_null_owner_string, Eq(\"->\"));\n  not_null<std::string*> not_null_access_string = not_null_owner_string.get();\n  not_null_access_string->insert(0, \"operator\");\n  EXPECT_THAT(*not_null_access_string, Eq(\"operator->\"));\n}\n\nTEST_F(NotNullTest, NotNullNotNull) {\n  not_null<std::unique_ptr<int>> owner = make_not_null_unique<int>(42);\n  not_null<not_null<int*>> x = owner.get();\n  not_null<int*> y = x;\n  *x = 6 * 9;\n  EXPECT_THAT(*owner, Eq(6 * 9));\n  EXPECT_THAT(*x, Eq(6 * 9));\n  EXPECT_THAT(*y, Eq(6 * 9));\n}\n\nTEST_F(NotNullTest, CheckArguments) {\n  not_null<std::unique_ptr<int>> accumulator = make_not_null_unique<int>(21);\n  std::unique_ptr<int const> twenty_one = std::make_unique<int const>(21);\n  Add(accumulator.get(), check_not_null(twenty_one.get()));\n  EXPECT_THAT(*twenty_one, Eq(21));\n  EXPECT_THAT(*accumulator, Eq(42));\n#if 0\n  Sub(check_not_null(accumulator.get()), check_not_null(twenty_one.get()));\n  EXPECT_THAT(*accumulator, Eq(21));\n#endif\n}\n\nTEST_F(NotNullTest, RValue) {\n  std::unique_ptr<int> owner_int = std::make_unique<int>(1);\n  not_null<int*> not_null_int = new int(2);\n  EXPECT_NE(owner_int.get(), not_null_int);\n\n  not_null<std::unique_ptr<int>> not_null_owner_int =\n      make_not_null_unique<int>(4);\n  std::vector<int*> v1;\n  \/\/ |v1.push_back| would be ambiguous here if |not_null<pointer>| had an\n  \/\/ |operator pointer const&() const&| instead of an\n  \/\/ |operator pointer const&&() const&|.\n  v1.push_back(not_null_owner_int.get());\n  \/\/ |emplace_back| is fine no matter what.\n  v1.emplace_back(not_null_owner_int.get());\n  EXPECT_EQ(4, *v1[0]);\n  EXPECT_EQ(4, *not_null_owner_int);\n\n  std::vector<int*> v2;\n  \/\/ NOTE(egg): The following fails using clang, I'm not sure where the bug is.\n  \/\/ More generally, if functions |foo(int*&&)| and |foo(int* const&)| exist,\n  \/\/ |foo(non_rvalue_not_null)| fails to compile with clang (\"no viable\n  \/\/ conversion\"), but without the |foo(int*&&)| overload it compiles.\n  \/\/ This is easily circumvented using a temporary (whereas the ambiguity that\n  \/\/ would result from having an |operator pointer const&() const&| would\n  \/\/ entirely prevent conversion of |not_null<unique_ptr<T>>| to\n  \/\/ |unique_ptr<T>|), so we ignore it.\n#if PRINCIPIA_COMPILER_MSVC\n  v2.push_back(not_null_int);\n#else\n  int* const temporary = not_null_int;\n  v2.push_back(temporary);\n#endif\n  EXPECT_EQ(2, *v2[0]);\n  EXPECT_EQ(2, *not_null_int);\n\n  \/\/ |std::unique_ptr<int>::operator=| would be ambiguous here between the move\n  \/\/ and copy assignments if |not_null<pointer>| had an\n  \/\/ |operator pointer const&() const&| instead of an\n  \/\/ |operator pointer const&&() const&|.\n  \/\/ Note that one of the overloads (the implicit copy assignment operator) is\n  \/\/ deleted, but this does not matter for overload resolution; however MSVC\n  \/\/ compiles this even when it is ambiguous, while clang correctly fails.\n  owner_int = make_not_null_unique<int>(1729);\n\n  not_null<int*> not_null_access_int = owner_int.get();\n  int const* access_const_int = not_null_access_int;\n\n  not_null<std::shared_ptr<int>> not_null_shared_int = std::make_shared<int>(3);\n  \/\/ This exercises |operator OtherPointer() const&|.  The conversion from\n  \/\/ |not_null<int*>| to |int const*| does not; instead it goes through the\n  \/\/ conversion |not_null<int*>| -> |int*| -> |int const*|, where the latter is\n  \/\/ a qualification adjustment, part of a standard conversion sequence.\n  std::shared_ptr<int const> shared_const_int = not_null_shared_int;\n  \/\/ MSVC seems to be confused by templatized move-conversion operators.\n#if !defined(PRINCIPIA_COMPILER_MSVC)\n  std::unique_ptr<int const> owner_const_int = make_not_null_unique<int>(5);\n  EXPECT_EQ(5, *owner_const_int);\n#endif\n}\n\n}  \/\/ namespace base\n}  \/\/ namespace principia\n<commit_msg>newline<commit_after>\n#include \"base\/not_null.hpp\"\n\n#include <memory>\n#include <utility>\n#include <string>\n#include <vector>\n\n#include \"base\/macros.hpp\"\n#include \"gtest\/gtest.h\"\n#include \"gmock\/gmock.h\"\n\nusing testing::Eq;\n\nnamespace principia {\nnamespace base {\n\nclass NotNullTest : public testing::Test {\n protected:\n  \/\/ A very convoluted wrapper for the x86 add...\n  void Add(not_null<int*> const destination,\n           not_null<int const*> const source) {\n    *destination += *source;\n  }\n  void Sub(not_null<int*> const destination,\n           not_null<int const*> const source) {\n    *destination -= *source;\n  }\n};\n\nusing NotNullDeathTest = NotNullTest;\n\nTEST_F(NotNullDeathTest, DeathByNullptr) {\n  EXPECT_DEATH({\n    int* const null_int_ptr = nullptr;\n    check_not_null(null_int_ptr);\n  }, \"Check failed: .* != nullptr\");\n  EXPECT_DEATH({\n    std::unique_ptr<int> null_int_ptr;\n    check_not_null(std::move(null_int_ptr));\n  }, \"Check failed: .* != nullptr\");\n}\n\nTEST_F(NotNullTest, Move) {\n  not_null<std::unique_ptr<int>> int_ptr1 = make_not_null_unique<int>(3);\n#if !PRINCIPIA_COMPILER_MSVC || (_MSC_FULL_VER != 190023506)\n  EXPECT_THAT(*(std::unique_ptr<int> const&)int_ptr1, Eq(3));\n#endif\n  not_null<std::unique_ptr<int>> int_ptr2 = std::move(int_ptr1);\n  EXPECT_THAT(*int_ptr2, Eq(3));\n  not_null<std::unique_ptr<int>> int_ptr3(std::move(int_ptr2));\n  EXPECT_THAT(*int_ptr3, Eq(3));\n  int_ptr2 = make_not_null_unique<int>(5);\n  EXPECT_THAT(*int_ptr2, Eq(5));\n  int_ptr2 = std::move(int_ptr3);\n  EXPECT_THAT(*int_ptr2, Eq(3));\n}\n\nTEST_F(NotNullTest, Copy) {\n  std::unique_ptr<int> const owner_of_three = std::make_unique<int>(3);\n  std::unique_ptr<int> const owner_of_five = std::make_unique<int>(5);\n  not_null<int*> const int_ptr1 = check_not_null(owner_of_three.get());\n  not_null<int*> int_ptr2 = int_ptr1;\n  not_null<int*> const int_ptr3(int_ptr2);\n  EXPECT_THAT(int_ptr1, Eq(owner_of_three.get()));\n  EXPECT_THAT(int_ptr2, Eq(owner_of_three.get()));\n  EXPECT_THAT(int_ptr3, Eq(owner_of_three.get()));\n  EXPECT_THAT(*int_ptr1, Eq(3));\n  EXPECT_THAT(*int_ptr2, Eq(3));\n  EXPECT_THAT(*int_ptr3, Eq(3));\n  int_ptr2 = check_not_null(owner_of_five.get());\n  EXPECT_THAT(*int_ptr2, Eq(5));\n  int_ptr2 = std::move(int_ptr3);\n  EXPECT_THAT(*int_ptr2, Eq(3));\n  EXPECT_THAT(*int_ptr3, Eq(3));\n}\n\nTEST_F(NotNullTest, CheckNotNull) {\n#if 0\n  std::unique_ptr<int> owner_int = std::make_unique<int>(3);\n  int* const constant_access_int = owner_int.get();\n  not_null<int*> const constant_not_null_access_int =\n      check_not_null(constant_access_int);\n  check_not_null(constant_not_null_access_int);\n  not_null<std::unique_ptr<int>> not_null_owner_int =\n      check_not_null(std::move(owner_int));\n  check_not_null(std::move(not_null_owner_int));\n#endif\n}\n\nTEST_F(NotNullTest, Booleans) {\n  not_null<std::unique_ptr<int>> const pointer = make_not_null_unique<int>(3);\n  EXPECT_TRUE(pointer);\n  EXPECT_TRUE(pointer != nullptr);\n  EXPECT_FALSE(pointer == nullptr);\n}\n\nTEST_F(NotNullTest, ImplicitConversions) {\n  not_null<std::unique_ptr<int>> not_null_owner_int =\n      make_not_null_unique<int>(3);\n  not_null<int const*> const constant_not_null_access_int =\n      not_null_owner_int.get();\n  \/\/ Copy constructor.\n  not_null<int const*> not_null_access_constant_int =\n      constant_not_null_access_int;\n  \/\/ Copy assignment.\n  not_null_access_constant_int = not_null_owner_int.get();\n  \/\/ Move constructor.\n  not_null<std::unique_ptr<int const>> not_null_owner_constant_int =\n      make_not_null_unique<int>(5);\n  \/\/ Move assignment.\n  not_null_owner_constant_int = std::move(not_null_owner_int);\n}\n\nTEST_F(NotNullTest, Arrow) {\n  not_null<std::unique_ptr<std::string>> not_null_owner_string =\n      make_not_null_unique<std::string>(\"-\");\n  not_null_owner_string->append(\">\");\n  EXPECT_THAT(*not_null_owner_string, Eq(\"->\"));\n  not_null<std::string*> not_null_access_string = not_null_owner_string.get();\n  not_null_access_string->insert(0, \"operator\");\n  EXPECT_THAT(*not_null_access_string, Eq(\"operator->\"));\n}\n\nTEST_F(NotNullTest, NotNullNotNull) {\n  not_null<std::unique_ptr<int>> owner = make_not_null_unique<int>(42);\n  not_null<not_null<int*>> x = owner.get();\n  not_null<int*> y = x;\n  *x = 6 * 9;\n  EXPECT_THAT(*owner, Eq(6 * 9));\n  EXPECT_THAT(*x, Eq(6 * 9));\n  EXPECT_THAT(*y, Eq(6 * 9));\n}\n\nTEST_F(NotNullTest, CheckArguments) {\n  not_null<std::unique_ptr<int>> accumulator = make_not_null_unique<int>(21);\n  std::unique_ptr<int const> twenty_one = std::make_unique<int const>(21);\n  Add(accumulator.get(), check_not_null(twenty_one.get()));\n  EXPECT_THAT(*twenty_one, Eq(21));\n  EXPECT_THAT(*accumulator, Eq(42));\n#if 0\n  Sub(check_not_null(accumulator.get()), check_not_null(twenty_one.get()));\n  EXPECT_THAT(*accumulator, Eq(21));\n#endif\n}\n\nTEST_F(NotNullTest, RValue) {\n  std::unique_ptr<int> owner_int = std::make_unique<int>(1);\n  not_null<int*> not_null_int = new int(2);\n  EXPECT_NE(owner_int.get(), not_null_int);\n\n  not_null<std::unique_ptr<int>> not_null_owner_int =\n      make_not_null_unique<int>(4);\n  std::vector<int*> v1;\n  \/\/ |v1.push_back| would be ambiguous here if |not_null<pointer>| had an\n  \/\/ |operator pointer const&() const&| instead of an\n  \/\/ |operator pointer const&&() const&|.\n  v1.push_back(not_null_owner_int.get());\n  \/\/ |emplace_back| is fine no matter what.\n  v1.emplace_back(not_null_owner_int.get());\n  EXPECT_EQ(4, *v1[0]);\n  EXPECT_EQ(4, *not_null_owner_int);\n\n  std::vector<int*> v2;\n  \/\/ NOTE(egg): The following fails using clang, I'm not sure where the bug is.\n  \/\/ More generally, if functions |foo(int*&&)| and |foo(int* const&)| exist,\n  \/\/ |foo(non_rvalue_not_null)| fails to compile with clang (\"no viable\n  \/\/ conversion\"), but without the |foo(int*&&)| overload it compiles.\n  \/\/ This is easily circumvented using a temporary (whereas the ambiguity that\n  \/\/ would result from having an |operator pointer const&() const&| would\n  \/\/ entirely prevent conversion of |not_null<unique_ptr<T>>| to\n  \/\/ |unique_ptr<T>|), so we ignore it.\n#if PRINCIPIA_COMPILER_MSVC\n  v2.push_back(not_null_int);\n#else\n  int* const temporary = not_null_int;\n  v2.push_back(temporary);\n#endif\n  EXPECT_EQ(2, *v2[0]);\n  EXPECT_EQ(2, *not_null_int);\n\n  \/\/ |std::unique_ptr<int>::operator=| would be ambiguous here between the move\n  \/\/ and copy assignments if |not_null<pointer>| had an\n  \/\/ |operator pointer const&() const&| instead of an\n  \/\/ |operator pointer const&&() const&|.\n  \/\/ Note that one of the overloads (the implicit copy assignment operator) is\n  \/\/ deleted, but this does not matter for overload resolution; however MSVC\n  \/\/ compiles this even when it is ambiguous, while clang correctly fails.\n  owner_int = make_not_null_unique<int>(1729);\n\n  not_null<int*> not_null_access_int = owner_int.get();\n  int const* access_const_int = not_null_access_int;\n\n  not_null<std::shared_ptr<int>> not_null_shared_int = std::make_shared<int>(3);\n  \/\/ This exercises |operator OtherPointer() const&|.  The conversion from\n  \/\/ |not_null<int*>| to |int const*| does not; instead it goes through the\n  \/\/ conversion |not_null<int*>| -> |int*| -> |int const*|, where the latter is\n  \/\/ a qualification adjustment, part of a standard conversion sequence.\n  std::shared_ptr<int const> shared_const_int = not_null_shared_int;\n\n  \/\/ MSVC seems to be confused by templatized move-conversion operators.\n#if !defined(PRINCIPIA_COMPILER_MSVC)\n  std::unique_ptr<int const> owner_const_int = make_not_null_unique<int>(5);\n  EXPECT_EQ(5, *owner_const_int);\n#endif\n}\n\n}  \/\/ namespace base\n}  \/\/ namespace principia\n<|endoftext|>"}
{"text":"<commit_before>\/\/snippet-sourcedescription:[Upgrade AWS SDK for C++ to version 1.8 to build list_buckets_disabling_dns_cache.cpp. This example demonstrates how to replace the default HTTP client and override the default HTTP client configurations.]\n\/\/snippet-keyword:[C++]\n\/\/snippet-sourcesyntax:[cpp]\n\/\/snippet-keyword:[Code Sample]\n\/\/snippet-keyword:[Amazon S3]\n\/\/snippet-service:[s3]\n\/\/snippet-sourcetype:[full-example]\n\/\/snippet-sourcedate:[]\n\/\/snippet-sourceauthor:[AWS]\n\n\/**\n * Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.\n * SPDX-License-Identifier: Apache-2.0\n *\/\n\n#include <iostream>\n#include <aws\/core\/Aws.h>\n#include <aws\/core\/utils\/Outcome.h>\n#include <aws\/core\/utils\/logging\/LogLevel.h>\n#include <aws\/core\/http\/standard\/StandardHttpRequest.h>\n#include <aws\/core\/client\/ClientConfiguration.h>\n#include <aws\/core\/http\/curl\/CurlHttpClient.h>\n#include <aws\/s3\/S3Client.h>\n\nusing namespace Aws;\nusing namespace Aws::Http;\nusing namespace Aws::Client;\nusing namespace Aws::S3;\nusing namespace Aws::S3::Model;\n\nstatic const char ALLOCATION_TAG[] = \"OverrideDefaultHttpClient\";\n\n\/**\n * Extending Default CurlHttpClient, and override OverrideOptionsOnConnectionHandle() to disable DNS caching with CURLOPT_DNS_CACHE_TIMEOUT setting to 0.\n *\/\nclass MyCurlHttpClient : public Aws::Http::CurlHttpClient\n{\npublic:\n    MyCurlHttpClient(const Aws::Client::ClientConfiguration& clientConfig) : Aws::Http::CurlHttpClient(clientConfig) {}\n\nprotected:\n    void OverrideOptionsOnConnectionHandle(CURL* connectionHandle) const override\n    {\n        std::cout << \"Disable DNS caching completely.\" << std::endl;\n        curl_easy_setopt(connectionHandle, CURLOPT_DNS_CACHE_TIMEOUT, 0L);\n    }\n};\n\n\/**\n * Extending the default HttpClientFactory to return the custom HttpClient we just created.\n *\/\nclass MyHttpClientFactory : public Aws::Http::HttpClientFactory\n{\n    std::shared_ptr<Aws::Http::HttpClient> CreateHttpClient(const Aws::Client::ClientConfiguration& clientConfiguration) const override\n    {\n        return Aws::MakeShared<MyCurlHttpClient>(ALLOCATION_TAG, clientConfiguration);\n    }\n\n    std::shared_ptr<Aws::Http::HttpRequest> CreateHttpRequest(const Aws::String &uri, Aws::Http::HttpMethod method,\n                                                    const Aws::IOStreamFactory &streamFactory) const override\n    {\n        return CreateHttpRequest(Aws::Http::URI(uri), method, streamFactory);\n    }\n\n    std::shared_ptr<Aws::Http::HttpRequest> CreateHttpRequest(const Aws::Http::URI& uri, Aws::Http::HttpMethod method, const Aws::IOStreamFactory& streamFactory) const override\n    {\n        auto request = Aws::MakeShared<Aws::Http::Standard::StandardHttpRequest>(ALLOCATION_TAG, uri, method);\n        request->SetResponseStreamFactory(streamFactory);\n\n        return request;\n    }\n\n    void InitStaticState() override\n    {\n        MyCurlHttpClient::InitGlobalState();\n    }\n\n    void CleanupStaticState() override\n    {\n        MyCurlHttpClient::CleanupGlobalState();\n    }\n};\n\n\/**\n * With AWS SDK for C++ version 1.8, it's much easier to override the default HTTP client configuration with the virtual functions: OverrideOptionsOn*Handle()\n * In this example, we override the default HTTP client and disable DNS caching with some low level Curl APIs.\n *\/\nint main(int argc, char *argv[])\n{\n    SDKOptions options;\n    options.loggingOptions.logLevel = Utils::Logging::LogLevel::Trace;\n    InitAPI(options);\n    {\n        SetHttpClientFactory(Aws::MakeShared<MyHttpClientFactory>(ALLOCATION_TAG));\n\n        Aws::S3::S3Client s3Client;\n        auto listBucketsOutcome = s3Client.ListBuckets();\n        if (listBucketsOutcome.IsSuccess())\n        {\n            std::cout << \"Found \" << listBucketsOutcome.GetResult().GetBuckets().size() << \" buckets\" << std::endl;\n            for (auto&& bucket : listBucketsOutcome.GetResult().GetBuckets())\n            {\n                std::cout << \"  \" << bucket.GetName() << std::endl;\n            }\n        }\n        else\n        {\n            std::cout << \"Failed to list buckets. Error details:\" << std::endl;\n            std::cout << listBucketsOutcome.GetError() << std::endl;\n        }\n    }\n\n    ShutdownAPI(options);\n    return 0;\n}<commit_msg>Adding note disclaimer for example cpp being linux only for now<commit_after>\/\/NOTE!! This example only currently works on Linux.  If you are on a Windows environment, delete this .cpp file to build your solution.\n\n\/\/snippet-sourcedescription:[Upgrade AWS SDK for C++ to version 1.8 to build list_buckets_disabling_dns_cache.cpp. This example demonstrates how to replace the default HTTP client and override the default HTTP client configurations.]\n\/\/snippet-keyword:[C++]\n\/\/snippet-sourcesyntax:[cpp]\n\/\/snippet-keyword:[Code Sample]\n\/\/snippet-keyword:[Amazon S3]\n\/\/snippet-service:[s3]\n\/\/snippet-sourcetype:[full-example]\n\/\/snippet-sourcedate:[]\n\/\/snippet-sourceauthor:[AWS]\n\n\/**\n * Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.\n * SPDX-License-Identifier: Apache-2.0\n *\/\n\n#include <iostream>\n#include <aws\/core\/Aws.h>\n#include <aws\/core\/utils\/Outcome.h>\n#include <aws\/core\/utils\/logging\/LogLevel.h>\n#include <aws\/core\/http\/standard\/StandardHttpRequest.h>\n#include <aws\/core\/client\/ClientConfiguration.h>\n#include <aws\/core\/http\/curl\/CurlHttpClient.h>  \/\/This example is for Linux only. See top.\n#include <aws\/s3\/S3Client.h>\n\nusing namespace Aws;\nusing namespace Aws::Http;\nusing namespace Aws::Client;\nusing namespace Aws::S3;\nusing namespace Aws::S3::Model;\n\nstatic const char ALLOCATION_TAG[] = \"OverrideDefaultHttpClient\";\n\n\/**\n * Extending Default CurlHttpClient, and override OverrideOptionsOnConnectionHandle() to disable DNS caching with CURLOPT_DNS_CACHE_TIMEOUT setting to 0.\n *\/\nclass MyCurlHttpClient : public Aws::Http::CurlHttpClient\n{\npublic:\n    MyCurlHttpClient(const Aws::Client::ClientConfiguration& clientConfig) : Aws::Http::CurlHttpClient(clientConfig) {}\n\nprotected:\n    void OverrideOptionsOnConnectionHandle(CURL* connectionHandle) const override\n    {\n        std::cout << \"Disable DNS caching completely.\" << std::endl;\n        curl_easy_setopt(connectionHandle, CURLOPT_DNS_CACHE_TIMEOUT, 0L);\n    }\n};\n\n\/**\n * Extending the default HttpClientFactory to return the custom HttpClient we just created.\n *\/\nclass MyHttpClientFactory : public Aws::Http::HttpClientFactory\n{\n    std::shared_ptr<Aws::Http::HttpClient> CreateHttpClient(const Aws::Client::ClientConfiguration& clientConfiguration) const override\n    {\n        return Aws::MakeShared<MyCurlHttpClient>(ALLOCATION_TAG, clientConfiguration);\n    }\n\n    std::shared_ptr<Aws::Http::HttpRequest> CreateHttpRequest(const Aws::String &uri, Aws::Http::HttpMethod method,\n                                                    const Aws::IOStreamFactory &streamFactory) const override\n    {\n        return CreateHttpRequest(Aws::Http::URI(uri), method, streamFactory);\n    }\n\n    std::shared_ptr<Aws::Http::HttpRequest> CreateHttpRequest(const Aws::Http::URI& uri, Aws::Http::HttpMethod method, const Aws::IOStreamFactory& streamFactory) const override\n    {\n        auto request = Aws::MakeShared<Aws::Http::Standard::StandardHttpRequest>(ALLOCATION_TAG, uri, method);\n        request->SetResponseStreamFactory(streamFactory);\n\n        return request;\n    }\n\n    void InitStaticState() override\n    {\n        MyCurlHttpClient::InitGlobalState();\n    }\n\n    void CleanupStaticState() override\n    {\n        MyCurlHttpClient::CleanupGlobalState();\n    }\n};\n\n\/**\n * With AWS SDK for C++ version 1.8, it's much easier to override the default HTTP client configuration with the virtual functions: OverrideOptionsOn*Handle()\n * In this example, we override the default HTTP client and disable DNS caching with some low level Curl APIs.\n *\/\nint main(int argc, char *argv[])\n{\n    SDKOptions options;\n    options.loggingOptions.logLevel = Utils::Logging::LogLevel::Trace;\n    InitAPI(options);\n    {\n        SetHttpClientFactory(Aws::MakeShared<MyHttpClientFactory>(ALLOCATION_TAG));\n\n        Aws::S3::S3Client s3Client;\n        auto listBucketsOutcome = s3Client.ListBuckets();\n        if (listBucketsOutcome.IsSuccess())\n        {\n            std::cout << \"Found \" << listBucketsOutcome.GetResult().GetBuckets().size() << \" buckets\" << std::endl;\n            for (auto&& bucket : listBucketsOutcome.GetResult().GetBuckets())\n            {\n                std::cout << \"  \" << bucket.GetName() << std::endl;\n            }\n        }\n        else\n        {\n            std::cout << \"Failed to list buckets. Error details:\" << std::endl;\n            std::cout << listBucketsOutcome.GetError() << std::endl;\n        }\n    }\n\n    ShutdownAPI(options);\n    return 0;\n}<|endoftext|>"}
{"text":"<commit_before>#include \"ovsgCSkeletonGenerator.h\"\n\n#include <string>\n#include <cstdlib>\n\nusing namespace std;\nusing namespace OpenViBE;\nusing namespace OpenViBE::Kernel;\nusing namespace OpenViBESkeletonGenerator;\n\nCSkeletonGenerator::CSkeletonGenerator(IKernelContext & rKernelContext, ::GtkBuilder * pBuilderInterface)\n\t:m_rKernelContext(rKernelContext)\n\t,m_pBuilderInterface(pBuilderInterface)\n{\n\tm_sConfigurationFile = m_rKernelContext.getConfigurationManager().expand(\"${SkeletonGenerator_ConfigurationFile}\");\n\tm_rKernelContext.getLogManager() << LogLevel_Trace << \"Configuration file [\" << m_sConfigurationFile << \"]\\n\";\n\tloadCommon();\n}\n\nCSkeletonGenerator::~CSkeletonGenerator(void)\n{\n}\n\nvoid CSkeletonGenerator::getCommon()\n{\n\t\/\/Author and Company\n\t::GtkWidget* l_pEntryCompany=GTK_WIDGET(gtk_builder_get_object(m_pBuilderInterface, \"entry_company_name\"));\n\tm_sCompany=CString(\"\");\n\tm_sCompany=gtk_entry_get_text(GTK_ENTRY(l_pEntryCompany));\n\n\t::GtkWidget* l_pEntryAuthor =GTK_WIDGET(gtk_builder_get_object(m_pBuilderInterface, \"entry_author_name\"));\n\tm_sAuthor=CString(\"\");\n\tm_sAuthor=gtk_entry_get_text(GTK_ENTRY(l_pEntryAuthor));\n}\n\nboolean CSkeletonGenerator::saveCommon(void)\n{\n\t\/\/ we get the latest values\n\tgetCommon();\n\n\tFILE* l_pFile=::fopen(m_sConfigurationFile.toASCIIString(), \"ab\");\n\tif(!l_pFile)\n\t{\n\t\tm_rKernelContext.getLogManager() << LogLevel_Warning << \"Saving the common entries in [\" << m_sConfigurationFile << \"] failed !\\n\";\n\t\treturn false;\n\t}\n\n\t::fprintf(l_pFile, \"SkeletonGenerator_Common_Author = %s\\n\", m_sAuthor.toASCIIString());\n\t::fprintf(l_pFile, \"SkeletonGenerator_Common_Company = %s\\n\", m_sCompany.toASCIIString());\n\t::fclose(l_pFile);\n\tm_rKernelContext.getLogManager() << LogLevel_Info << \"Common entries saved in [\" << m_sConfigurationFile << \"]\\n\";\n\n\treturn true;\n}\n\nboolean CSkeletonGenerator::cleanConfigurationFile(void)\n{\n\tFILE* l_pFile=::fopen(m_sConfigurationFile.toASCIIString(), \"wb\");\n\tif(!l_pFile)\n\t{\n\t\tm_rKernelContext.getLogManager() << LogLevel_Warning << \"Failed to clean [\" << m_sConfigurationFile << \"]\\n\";\n\t\treturn false;\n\t}\n\n\tm_rKernelContext.getLogManager() << LogLevel_Info << \"Configuration file [\" << m_sConfigurationFile << \"] cleaned.\\n\";\n\t::fclose(l_pFile);\n\treturn true;\n}\n\nboolean CSkeletonGenerator::loadCommon(void)\n{\n\tif(!m_rKernelContext.getConfigurationManager().addConfigurationFromFile(m_sConfigurationFile))\n\t{\n\t\tm_rKernelContext.getLogManager() << LogLevel_Warning << \"Common: Configuration file [\" << m_sConfigurationFile << \"] could not be loaded. It will be automatically generated after first use.\\n\";\n\t\treturn false;\n\t}\n\n\t::GtkWidget* l_pEntryCompany=GTK_WIDGET(gtk_builder_get_object(m_pBuilderInterface, \"entry_company_name\"));\n\tgtk_entry_set_text(GTK_ENTRY(l_pEntryCompany),m_rKernelContext.getConfigurationManager().expand(\"${SkeletonGenerator_Common_Company}\"));\n\n\t::GtkWidget * l_pEntryAuthorName = GTK_WIDGET(gtk_builder_get_object(m_pBuilderInterface, \"entry_author_name\"));\n\tgtk_entry_set_text(GTK_ENTRY(l_pEntryAuthorName),m_rKernelContext.getConfigurationManager().expand(\"${SkeletonGenerator_Common_Author}\"));\n\n\tm_rKernelContext.getLogManager() << LogLevel_Info << \"Common entries from [\" << m_sConfigurationFile << \"] loaded.\\n\";\n\n\treturn true;\n}\n<commit_msg>skeleton-generator * ovsgCSkeletonGenerator.cpp : the previously entered information are saved an loaded in the application config file using the dedicated token.<commit_after>#include \"ovsgCSkeletonGenerator.h\"\n\n#include <string>\n#include <cstdlib>\n\nusing namespace std;\nusing namespace OpenViBE;\nusing namespace OpenViBE::Kernel;\nusing namespace OpenViBESkeletonGenerator;\n\nCSkeletonGenerator::CSkeletonGenerator(IKernelContext & rKernelContext, ::GtkBuilder * pBuilderInterface)\n\t:m_rKernelContext(rKernelContext)\n\t,m_pBuilderInterface(pBuilderInterface)\n{\n\t\/\/m_sConfigurationFile = m_rKernelContext.getConfigurationManager().expand(\"${SkeletonGenerator_ConfigurationFile}\");\n\tm_sConfigurationFile = m_rKernelContext.getConfigurationManager().expand(\"${CustomConfigurationApplication}\");\n\tm_rKernelContext.getLogManager() << LogLevel_Trace << \"Configuration file [\" << m_sConfigurationFile << \"]\\n\";\n\tloadCommon();\n}\n\nCSkeletonGenerator::~CSkeletonGenerator(void)\n{\n}\n\nvoid CSkeletonGenerator::getCommon()\n{\n\t\/\/Author and Company\n\t::GtkWidget* l_pEntryCompany=GTK_WIDGET(gtk_builder_get_object(m_pBuilderInterface, \"entry_company_name\"));\n\tm_sCompany=CString(\"\");\n\tm_sCompany=gtk_entry_get_text(GTK_ENTRY(l_pEntryCompany));\n\n\t::GtkWidget* l_pEntryAuthor =GTK_WIDGET(gtk_builder_get_object(m_pBuilderInterface, \"entry_author_name\"));\n\tm_sAuthor=CString(\"\");\n\tm_sAuthor=gtk_entry_get_text(GTK_ENTRY(l_pEntryAuthor));\n}\n\nboolean CSkeletonGenerator::saveCommon(void)\n{\n\t\/\/ we get the latest values\n\tgetCommon();\n\n\tFILE* l_pFile=::fopen(m_sConfigurationFile.toASCIIString(), \"ab\");\n\tif(!l_pFile)\n\t{\n\t\tm_rKernelContext.getLogManager() << LogLevel_Warning << \"Saving the common entries in [\" << m_sConfigurationFile << \"] failed !\\n\";\n\t\treturn false;\n\t}\n\n\t::fprintf(l_pFile, \"SkeletonGenerator_Common_Author = %s\\n\", m_sAuthor.toASCIIString());\n\t::fprintf(l_pFile, \"SkeletonGenerator_Common_Company = %s\\n\", m_sCompany.toASCIIString());\n\t::fclose(l_pFile);\n\tm_rKernelContext.getLogManager() << LogLevel_Info << \"Common entries saved in [\" << m_sConfigurationFile << \"]\\n\";\n\n\treturn true;\n}\n\nboolean CSkeletonGenerator::cleanConfigurationFile(void)\n{\n\tFILE* l_pFile=::fopen(m_sConfigurationFile.toASCIIString(), \"wb\");\n\tif(!l_pFile)\n\t{\n\t\tm_rKernelContext.getLogManager() << LogLevel_Warning << \"Failed to clean [\" << m_sConfigurationFile << \"]\\n\";\n\t\treturn false;\n\t}\n\n\tm_rKernelContext.getLogManager() << LogLevel_Info << \"Configuration file [\" << m_sConfigurationFile << \"] cleaned.\\n\";\n\t::fclose(l_pFile);\n\treturn true;\n}\n\nboolean CSkeletonGenerator::loadCommon(void)\n{\n\tif(!m_rKernelContext.getConfigurationManager().addConfigurationFromFile(m_sConfigurationFile))\n\t{\n\t\tm_rKernelContext.getLogManager() << LogLevel_Warning << \"Common: Configuration file [\" << m_sConfigurationFile << \"] could not be loaded. It will be automatically generated after first use.\\n\";\n\t\treturn false;\n\t}\n\n\t::GtkWidget* l_pEntryCompany=GTK_WIDGET(gtk_builder_get_object(m_pBuilderInterface, \"entry_company_name\"));\n\tgtk_entry_set_text(GTK_ENTRY(l_pEntryCompany),m_rKernelContext.getConfigurationManager().expand(\"${SkeletonGenerator_Common_Company}\"));\n\n\t::GtkWidget * l_pEntryAuthorName = GTK_WIDGET(gtk_builder_get_object(m_pBuilderInterface, \"entry_author_name\"));\n\tgtk_entry_set_text(GTK_ENTRY(l_pEntryAuthorName),m_rKernelContext.getConfigurationManager().expand(\"${SkeletonGenerator_Common_Author}\"));\n\n\tm_rKernelContext.getLogManager() << LogLevel_Info << \"Common entries from [\" << m_sConfigurationFile << \"] loaded.\\n\";\n\n\treturn true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: LabelPositionHelper.cxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 13:36: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_chart2.hxx\"\n\n#include \"LabelPositionHelper.hxx\"\n#include \"PlottingPositionHelper.hxx\"\n#include \"CommonConverters.hxx\"\n#include \"PropertyMapper.hxx\"\n#include \"ShapeFactory.hxx\"\n#include \"macros.hxx\"\n#include \"RelativeSizeHelper.hxx\"\n\n\/\/ header for class Vector2D\n#ifndef _VECTOR2D_HXX\n#include <tools\/vector2d.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_DRAWING_TEXTVERTICALADJUST_HPP_\n#include <com\/sun\/star\/drawing\/TextVerticalAdjust.hpp>\n#endif\n#ifndef _COM_SUN_STAR_DRAWING_TEXTHORIZONTALADJUST_HPP_\n#include <com\/sun\/star\/drawing\/TextHorizontalAdjust.hpp>\n#endif\n\n\/\/.............................................................................\nnamespace chart\n{\n\/\/.............................................................................\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::chart2;\n\nLabelPositionHelper::LabelPositionHelper(\n                    PlottingPositionHelper* pPosHelper\n                    , sal_Int32 nDimensionCount\n                    , const uno::Reference< drawing::XShapes >& xLogicTarget\n                    , ShapeFactory* pShapeFactory )\n                    : m_pPosHelper(pPosHelper)\n                    , m_nDimensionCount(nDimensionCount)\n                    , m_xLogicTarget(xLogicTarget)\n                    , m_pShapeFactory(pShapeFactory)\n{\n}\n\nLabelPositionHelper::~LabelPositionHelper()\n{\n}\n\nawt::Point LabelPositionHelper::transformSceneToScreenPosition( const drawing::Position3D& rScenePosition3D ) const\n{\n    \/\/@todo would like to have a cheaper method to do this transformation\n    awt::Point aScreenPoint( static_cast<sal_Int32>(rScenePosition3D.PositionX), static_cast<sal_Int32>(rScenePosition3D.PositionY) );\n\n    \/\/transformation from scene to screen (only neccessary for 3D):\n    if(3==m_nDimensionCount)\n    {\n        \/\/create 3D anchor shape\n        tPropertyNameMap aDummyPropertyNameMap;\n        uno::Reference< drawing::XShape > xShape3DAnchor = m_pShapeFactory->createCube( m_xLogicTarget\n                , DataPointGeometry( rScenePosition3D,drawing::Direction3D(1,1,1) )\n                , 0, aDummyPropertyNameMap);\n        \/\/get 2D position from xShape3DAnchor\n        aScreenPoint = xShape3DAnchor->getPosition();\n        m_xLogicTarget->remove(xShape3DAnchor);\n    }\n    return aScreenPoint;\n}\n\nawt::Point LabelPositionHelper::transformLogicToScreenPosition( const drawing::Position3D& rLogicPosition3D ) const\n{\n    drawing::Position3D aScenePosition3D( SequenceToPosition3D(\n        m_pPosHelper->getTransformationLogicToScene()->transform(\n            Position3DToSequence(rLogicPosition3D) ) ) );\n    if(3==m_nDimensionCount)\n    {\n        drawing::Position3D aScenePosition3D_rotated( aScenePosition3D.PositionX, -aScenePosition3D.PositionZ, aScenePosition3D.PositionY );\n        aScenePosition3D = aScenePosition3D_rotated;\n    }\n    awt::Point aScreenPosition2D( this->transformSceneToScreenPosition( aScenePosition3D ) );\n    return aScreenPosition2D;\n}\n\n\/\/static\nvoid LabelPositionHelper::changeTextAdjustment( tAnySequence& rPropValues, const tNameSequence& rPropNames, LabelAlignment eAlignment)\n{\n    \/\/HorizontalAdjustment\n    {\n        drawing::TextHorizontalAdjust eHorizontalAdjust = drawing::TextHorizontalAdjust_CENTER;\n        if( LABEL_ALIGN_RIGHT==eAlignment || LABEL_ALIGN_RIGHT_TOP==eAlignment || LABEL_ALIGN_RIGHT_BOTTOM==eAlignment )\n            eHorizontalAdjust = drawing::TextHorizontalAdjust_LEFT;\n        else if( LABEL_ALIGN_LEFT==eAlignment || LABEL_ALIGN_LEFT_TOP==eAlignment || LABEL_ALIGN_LEFT_BOTTOM==eAlignment )\n            eHorizontalAdjust = drawing::TextHorizontalAdjust_RIGHT;\n        uno::Any* pHorizontalAdjustAny = PropertyMapper::getValuePointer(rPropValues,rPropNames,C2U(\"TextHorizontalAdjust\"));\n        if(pHorizontalAdjustAny)\n            *pHorizontalAdjustAny = uno::makeAny(eHorizontalAdjust);\n    }\n\n    \/\/VerticalAdjustment\n    {\n        drawing::TextVerticalAdjust eVerticalAdjust = drawing::TextVerticalAdjust_CENTER;\n        if( LABEL_ALIGN_TOP==eAlignment || LABEL_ALIGN_RIGHT_TOP==eAlignment || LABEL_ALIGN_LEFT_TOP==eAlignment )\n            eVerticalAdjust = drawing::TextVerticalAdjust_BOTTOM;\n        else if( LABEL_ALIGN_BOTTOM==eAlignment || LABEL_ALIGN_RIGHT_BOTTOM==eAlignment || LABEL_ALIGN_LEFT_BOTTOM==eAlignment )\n            eVerticalAdjust = drawing::TextVerticalAdjust_TOP;\n        uno::Any* pVerticalAdjustAny = PropertyMapper::getValuePointer(rPropValues,rPropNames,C2U(\"TextVerticalAdjust\"));\n        if(pVerticalAdjustAny)\n            *pVerticalAdjustAny = uno::makeAny(eVerticalAdjust);\n    }\n}\n\nvoid lcl_doDynamicFontResize( uno::Any* pAOldFontHeightAny\n                          , const awt::Size& rOldReferenceSize\n                          , const awt::Size& rNewReferenceSize  )\n{\n    double fOldFontHeight, fNewFontHeight;\n    if( pAOldFontHeightAny && ( *pAOldFontHeightAny >>= fOldFontHeight ) )\n    {\n        fNewFontHeight = RelativeSizeHelper::calculate( fOldFontHeight, rOldReferenceSize, rNewReferenceSize );\n        *pAOldFontHeightAny = uno::makeAny(fNewFontHeight);\n    }\n}\n\n\/\/static\nvoid LabelPositionHelper::doDynamicFontResize( tAnySequence& rPropValues\n                    , const tNameSequence& rPropNames\n                    , const uno::Reference< beans::XPropertySet >& xAxisModelProps\n                    , const awt::Size& rNewReferenceSize\n                    )\n{\n    \/\/-------------------------\n    \/\/handle dynamic font resize:\n    awt::Size aOldReferenceSize;\n    if( xAxisModelProps->getPropertyValue( C2U(\"ReferenceDiagramSize\")) >>= aOldReferenceSize )\n    {\n        uno::Any* pAOldFontHeightAny = PropertyMapper::getValuePointer( rPropValues, rPropNames, C2U(\"CharHeight\") );\n        lcl_doDynamicFontResize( pAOldFontHeightAny, aOldReferenceSize, rNewReferenceSize );\n        pAOldFontHeightAny = PropertyMapper::getValuePointer( rPropValues, rPropNames, C2U(\"CharHeightAsian\") );\n        lcl_doDynamicFontResize( pAOldFontHeightAny, aOldReferenceSize, rNewReferenceSize );\n        pAOldFontHeightAny = PropertyMapper::getValuePointer( rPropValues, rPropNames, C2U(\"CharHeightComplex\") );\n        lcl_doDynamicFontResize( pAOldFontHeightAny, aOldReferenceSize, rNewReferenceSize );\n    }\n}\n\n\/\/.............................................................................\n} \/\/namespace chart\n\/\/.............................................................................\n<commit_msg>INTEGRATION: CWS chart2mst3 (1.2.4); FILE MERGED 2006\/11\/23 17:37:23 iha 1.2.4.9: removed unsued include 2006\/10\/18 17:23:20 bm 1.2.4.8: RESYNC: (1.3-1.4); FILE MERGED 2006\/08\/10 15:59:26 iha 1.2.4.7: Axis Label Layout - Font&Diagram Size 2005\/12\/03 18:58:14 iha 1.2.4.6: added transformSceneToScreenPosition to enable pie segment dragging 2005\/10\/07 12:24:55 bm 1.2.4.5: RESYNC: (1.2-1.3); FILE MERGED 2004\/05\/08 17:54:57 iha 1.2.4.4: polartransformation fixes and pie offset implementation 2004\/04\/29 09:28:06 iha 1.2.4.3: correct 3d bar object position and size 2004\/04\/28 20:16:53 iha 1.2.4.2: removed \/cvs\/graphics\/chart2\/source\/inc\/RegressionCurveHelper.hxx,v: needs patch 2004\/03\/23 14:39:48 iha 1.2.4.1: renamed method transform\/Scaled\/LogicToScreenPosition + getTransformation\/Scaled\/LogicToScene<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: LabelPositionHelper.cxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: vg $ $Date: 2007-05-22 19:24: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_chart2.hxx\"\n\n#include \"LabelPositionHelper.hxx\"\n#include \"PlottingPositionHelper.hxx\"\n#include \"CommonConverters.hxx\"\n#include \"PropertyMapper.hxx\"\n#include \"ShapeFactory.hxx\"\n#include \"macros.hxx\"\n#include \"RelativeSizeHelper.hxx\"\n\n#ifndef _COM_SUN_STAR_DRAWING_TEXTVERTICALADJUST_HPP_\n#include <com\/sun\/star\/drawing\/TextVerticalAdjust.hpp>\n#endif\n#ifndef _COM_SUN_STAR_DRAWING_TEXTHORIZONTALADJUST_HPP_\n#include <com\/sun\/star\/drawing\/TextHorizontalAdjust.hpp>\n#endif\n\n\/\/.............................................................................\nnamespace chart\n{\n\/\/.............................................................................\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::chart2;\n\nLabelPositionHelper::LabelPositionHelper(\n                    PlottingPositionHelper* pPosHelper\n                    , sal_Int32 nDimensionCount\n                    , const uno::Reference< drawing::XShapes >& xLogicTarget\n                    , ShapeFactory* pShapeFactory )\n                    : m_pPosHelper(pPosHelper)\n                    , m_nDimensionCount(nDimensionCount)\n                    , m_xLogicTarget(xLogicTarget)\n                    , m_pShapeFactory(pShapeFactory)\n{\n}\n\nLabelPositionHelper::~LabelPositionHelper()\n{\n}\n\nawt::Point LabelPositionHelper::transformSceneToScreenPosition( const drawing::Position3D& rScenePosition3D ) const\n{\n    return PlottingPositionHelper::transformSceneToScreenPosition(\n                  rScenePosition3D, m_xLogicTarget, m_pShapeFactory, m_nDimensionCount );\n}\n\nawt::Point LabelPositionHelper::transformScaledLogicToScreenPosition( const drawing::Position3D& rLogicPosition3D ) const\n{\n    drawing::Position3D aScenePosition3D( SequenceToPosition3D(\n        m_pPosHelper->getTransformationScaledLogicToScene()->transform(\n            Position3DToSequence(rLogicPosition3D) ) ) );\n    \/*\n    if(3==m_nDimensionCount)\n    {\n        drawing::Position3D aScenePosition3D_rotated( aScenePosition3D.PositionX, -aScenePosition3D.PositionZ, aScenePosition3D.PositionY );\n        aScenePosition3D = aScenePosition3D_rotated;\n    }\n    *\/\n    awt::Point aScreenPosition2D( this->transformSceneToScreenPosition( aScenePosition3D ) );\n    return aScreenPosition2D;\n}\n\n\/\/static\nvoid LabelPositionHelper::changeTextAdjustment( tAnySequence& rPropValues, const tNameSequence& rPropNames, LabelAlignment eAlignment)\n{\n    \/\/HorizontalAdjustment\n    {\n        drawing::TextHorizontalAdjust eHorizontalAdjust = drawing::TextHorizontalAdjust_CENTER;\n        if( LABEL_ALIGN_RIGHT==eAlignment || LABEL_ALIGN_RIGHT_TOP==eAlignment || LABEL_ALIGN_RIGHT_BOTTOM==eAlignment )\n            eHorizontalAdjust = drawing::TextHorizontalAdjust_LEFT;\n        else if( LABEL_ALIGN_LEFT==eAlignment || LABEL_ALIGN_LEFT_TOP==eAlignment || LABEL_ALIGN_LEFT_BOTTOM==eAlignment )\n            eHorizontalAdjust = drawing::TextHorizontalAdjust_RIGHT;\n        uno::Any* pHorizontalAdjustAny = PropertyMapper::getValuePointer(rPropValues,rPropNames,C2U(\"TextHorizontalAdjust\"));\n        if(pHorizontalAdjustAny)\n            *pHorizontalAdjustAny = uno::makeAny(eHorizontalAdjust);\n    }\n\n    \/\/VerticalAdjustment\n    {\n        drawing::TextVerticalAdjust eVerticalAdjust = drawing::TextVerticalAdjust_CENTER;\n        if( LABEL_ALIGN_TOP==eAlignment || LABEL_ALIGN_RIGHT_TOP==eAlignment || LABEL_ALIGN_LEFT_TOP==eAlignment )\n            eVerticalAdjust = drawing::TextVerticalAdjust_BOTTOM;\n        else if( LABEL_ALIGN_BOTTOM==eAlignment || LABEL_ALIGN_RIGHT_BOTTOM==eAlignment || LABEL_ALIGN_LEFT_BOTTOM==eAlignment )\n            eVerticalAdjust = drawing::TextVerticalAdjust_TOP;\n        uno::Any* pVerticalAdjustAny = PropertyMapper::getValuePointer(rPropValues,rPropNames,C2U(\"TextVerticalAdjust\"));\n        if(pVerticalAdjustAny)\n            *pVerticalAdjustAny = uno::makeAny(eVerticalAdjust);\n    }\n}\n\nvoid lcl_doDynamicFontResize( uno::Any* pAOldAndNewFontHeightAny\n                          , const awt::Size& rOldReferenceSize\n                          , const awt::Size& rNewReferenceSize  )\n{\n    double fOldFontHeight, fNewFontHeight;\n    if( pAOldAndNewFontHeightAny && ( *pAOldAndNewFontHeightAny >>= fOldFontHeight ) )\n    {\n        fNewFontHeight = RelativeSizeHelper::calculate( fOldFontHeight, rOldReferenceSize, rNewReferenceSize );\n        *pAOldAndNewFontHeightAny = uno::makeAny(fNewFontHeight);\n    }\n}\n\n\/\/static\nvoid LabelPositionHelper::doDynamicFontResize( tAnySequence& rPropValues\n                    , const tNameSequence& rPropNames\n                    , const uno::Reference< beans::XPropertySet >& xAxisModelProps\n                    , const awt::Size& rNewReferenceSize\n                    )\n{\n    \/\/-------------------------\n    \/\/handle dynamic font resize:\n    awt::Size aOldReferenceSize;\n    if( xAxisModelProps->getPropertyValue( C2U(\"ReferenceDiagramSize\")) >>= aOldReferenceSize )\n    {\n        uno::Any* pAOldAndNewFontHeightAny = PropertyMapper::getValuePointer( rPropValues, rPropNames, C2U(\"CharHeight\") );\n        lcl_doDynamicFontResize( pAOldAndNewFontHeightAny, aOldReferenceSize, rNewReferenceSize );\n        pAOldAndNewFontHeightAny = PropertyMapper::getValuePointer( rPropValues, rPropNames, C2U(\"CharHeightAsian\") );\n        lcl_doDynamicFontResize( pAOldAndNewFontHeightAny, aOldReferenceSize, rNewReferenceSize );\n        pAOldAndNewFontHeightAny = PropertyMapper::getValuePointer( rPropValues, rPropNames, C2U(\"CharHeightComplex\") );\n        lcl_doDynamicFontResize( pAOldAndNewFontHeightAny, aOldReferenceSize, rNewReferenceSize );\n    }\n}\n\n\/\/.............................................................................\n} \/\/namespace chart\n\/\/.............................................................................\n<|endoftext|>"}
{"text":"<commit_before>\n\/*\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\/storage\/storage_node.h\"\n\n#include \"absl\/memory\/memory.h\"\n#include \"asylo\/util\/logging.h\"\n#include \"grpcpp\/create_channel.h\"\n#include \"oak\/proto\/storage_channel.pb.h\"\n\nnamespace oak {\n\nstatic std::string GetStorageId(const std::string& storage_name) {\n  \/\/ TODO: Generate name-based UUID.\n  return storage_name;\n}\n\nStorageNode::StorageNode(std::unique_ptr<MessageChannelReadHalf> req_half,\n                         std::unique_ptr<MessageChannelWriteHalf> rsp_half)\n    : NodeThread(\"storage\"), req_half_(std::move(req_half)), rsp_half_(std::move(rsp_half)) {\n  \/\/ TODO: get a storage service stub from somewhere less hard-coded.\n  storage_service_ = oak::Storage::NewStub(\n      grpc::CreateChannel(\"localhost:7867\", grpc::InsecureChannelCredentials()));\n}\n\nvoid StorageNode::Run() {\n  while (true) {\n    ReadResult result = req_half_->BlockingRead(INT_MAX);\n    if (result.required_size > 0) {\n      LOG(ERROR) << \"Message size too large: \" << result.required_size;\n      return;\n    }\n\n    StorageChannelRequest channel_request;\n    channel_request.ParseFromString(std::string(result.data->data(), result.data->size()));\n\n    \/\/ Forward the request to the storage service.\n    grpc::Status status;\n    grpc::ClientContext context;\n    StorageChannelResponse channel_response;\n    switch (channel_request.operation_case()) {\n      case StorageChannelRequest::kReadRequest: {\n        StorageReadRequest read_request;\n        read_request.set_storage_id(GetStorageId(channel_request.storage_name()));\n        read_request.set_transaction_id(channel_request.read_request().transaction_id());\n        read_request.set_datum_name(channel_request.read_request().datum_name());\n\n        StorageReadResponse read_response;\n        status = storage_service_->Read(&context, read_request, &read_response);\n        channel_response.mutable_read_response()->set_datum_value(read_response.datum_value());\n        break;\n      }\n      case StorageChannelRequest::kWriteRequest: {\n        StorageWriteRequest write_request;\n        write_request.set_storage_id(GetStorageId(channel_request.storage_name()));\n        write_request.set_transaction_id(channel_request.write_request().transaction_id());\n        write_request.set_datum_name(channel_request.write_request().datum_name());\n        write_request.set_datum_value(channel_request.write_request().datum_value());\n\n        StorageWriteResponse write_response;\n        status = storage_service_->Write(&context, write_request, &write_response);\n        break;\n      }\n      case StorageChannelRequest::kDeleteRequest: {\n        StorageDeleteRequest delete_request;\n        delete_request.set_storage_id(GetStorageId(channel_request.storage_name()));\n        delete_request.set_transaction_id(channel_request.delete_request().transaction_id());\n        delete_request.set_datum_name(channel_request.delete_request().datum_name());\n\n        StorageDeleteResponse delete_response;\n        status = storage_service_->Delete(&context, delete_request, &delete_response);\n        break;\n      }\n      case StorageChannelRequest::kBeginRequest: {\n        StorageBeginRequest begin_request;\n        begin_request.set_storage_id(GetStorageId(channel_request.storage_name()));\n\n        StorageBeginResponse begin_response;\n        status = storage_service_->Begin(&context, begin_request, &begin_response);\n        channel_response.mutable_begin_response()->set_transaction_id(\n            begin_response.transaction_id());\n        break;\n      }\n      case StorageChannelRequest::kCommitRequest: {\n        StorageCommitRequest commit_request;\n        commit_request.set_storage_id(GetStorageId(channel_request.storage_name()));\n        commit_request.set_transaction_id(channel_request.commit_request().transaction_id());\n\n        StorageCommitResponse commit_response;\n        status = storage_service_->Commit(&context, commit_request, &commit_response);\n        break;\n      }\n      case StorageChannelRequest::kRollbackRequest: {\n        StorageRollbackRequest rollback_request;\n        rollback_request.set_storage_id(GetStorageId(channel_request.storage_name()));\n        rollback_request.set_transaction_id(channel_request.rollback_request().transaction_id());\n\n        StorageRollbackResponse rollback_response;\n        status = storage_service_->Rollback(&context, rollback_request, &rollback_response);\n\n        break;\n      }\n      case StorageChannelRequest::OPERATION_NOT_SET: {\n        status =\n            grpc::Status(grpc::StatusCode::INVALID_ARGUMENT, \"Operation request field not set.\");\n      }\n    }\n    channel_response.mutable_status()->set_code(status.error_code());\n    channel_response.mutable_status()->set_message(status.error_message());\n\n    \/\/ Serialize the response and write it back to the Node's STORAGE_IN channel\n    std::string rsp_data;\n    channel_response.SerializeToString(&rsp_data);\n    \/\/ TODO: figure out a way to avoid the extra copy (into then out of std::string)\n    std::unique_ptr<Message> rsp_msg = absl::make_unique<Message>(rsp_data.begin(), rsp_data.end());\n    rsp_half_->Write(std::move(rsp_msg));\n  }\n}\n\n}  \/\/ namespace oak\n<commit_msg>Only set storage response values if no error<commit_after>\n\/*\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\/storage\/storage_node.h\"\n\n#include \"absl\/memory\/memory.h\"\n#include \"asylo\/util\/logging.h\"\n#include \"grpcpp\/create_channel.h\"\n#include \"oak\/proto\/storage_channel.pb.h\"\n\nnamespace oak {\n\nstatic std::string GetStorageId(const std::string& storage_name) {\n  \/\/ TODO: Generate name-based UUID.\n  return storage_name;\n}\n\nStorageNode::StorageNode(std::unique_ptr<MessageChannelReadHalf> req_half,\n                         std::unique_ptr<MessageChannelWriteHalf> rsp_half)\n    : NodeThread(\"storage\"), req_half_(std::move(req_half)), rsp_half_(std::move(rsp_half)) {\n  \/\/ TODO: get a storage service stub from somewhere less hard-coded.\n  storage_service_ = oak::Storage::NewStub(\n      grpc::CreateChannel(\"localhost:7867\", grpc::InsecureChannelCredentials()));\n}\n\nvoid StorageNode::Run() {\n  while (true) {\n    ReadResult result = req_half_->BlockingRead(INT_MAX);\n    if (result.required_size > 0) {\n      LOG(ERROR) << \"Message size too large: \" << result.required_size;\n      return;\n    }\n\n    StorageChannelRequest channel_request;\n    channel_request.ParseFromString(std::string(result.data->data(), result.data->size()));\n\n    \/\/ Forward the request to the storage service.\n    grpc::Status status;\n    grpc::ClientContext context;\n    StorageChannelResponse channel_response;\n    switch (channel_request.operation_case()) {\n      case StorageChannelRequest::kReadRequest: {\n        StorageReadRequest read_request;\n        read_request.set_storage_id(GetStorageId(channel_request.storage_name()));\n        read_request.set_transaction_id(channel_request.read_request().transaction_id());\n        read_request.set_datum_name(channel_request.read_request().datum_name());\n\n        StorageReadResponse read_response;\n        status = storage_service_->Read(&context, read_request, &read_response);\n        if (status.ok()) {\n          channel_response.mutable_read_response()->set_datum_value(read_response.datum_value());\n        }\n        break;\n      }\n      case StorageChannelRequest::kWriteRequest: {\n        StorageWriteRequest write_request;\n        write_request.set_storage_id(GetStorageId(channel_request.storage_name()));\n        write_request.set_transaction_id(channel_request.write_request().transaction_id());\n        write_request.set_datum_name(channel_request.write_request().datum_name());\n        write_request.set_datum_value(channel_request.write_request().datum_value());\n\n        StorageWriteResponse write_response;\n        status = storage_service_->Write(&context, write_request, &write_response);\n        break;\n      }\n      case StorageChannelRequest::kDeleteRequest: {\n        StorageDeleteRequest delete_request;\n        delete_request.set_storage_id(GetStorageId(channel_request.storage_name()));\n        delete_request.set_transaction_id(channel_request.delete_request().transaction_id());\n        delete_request.set_datum_name(channel_request.delete_request().datum_name());\n\n        StorageDeleteResponse delete_response;\n        status = storage_service_->Delete(&context, delete_request, &delete_response);\n        break;\n      }\n      case StorageChannelRequest::kBeginRequest: {\n        StorageBeginRequest begin_request;\n        begin_request.set_storage_id(GetStorageId(channel_request.storage_name()));\n\n        StorageBeginResponse begin_response;\n        status = storage_service_->Begin(&context, begin_request, &begin_response);\n        if (status.ok()) {\n          channel_response.mutable_begin_response()->set_transaction_id(\n              begin_response.transaction_id());\n        }\n        break;\n      }\n      case StorageChannelRequest::kCommitRequest: {\n        StorageCommitRequest commit_request;\n        commit_request.set_storage_id(GetStorageId(channel_request.storage_name()));\n        commit_request.set_transaction_id(channel_request.commit_request().transaction_id());\n\n        StorageCommitResponse commit_response;\n        status = storage_service_->Commit(&context, commit_request, &commit_response);\n        break;\n      }\n      case StorageChannelRequest::kRollbackRequest: {\n        StorageRollbackRequest rollback_request;\n        rollback_request.set_storage_id(GetStorageId(channel_request.storage_name()));\n        rollback_request.set_transaction_id(channel_request.rollback_request().transaction_id());\n\n        StorageRollbackResponse rollback_response;\n        status = storage_service_->Rollback(&context, rollback_request, &rollback_response);\n        break;\n      }\n      case StorageChannelRequest::OPERATION_NOT_SET: {\n        LOG(ERROR) << \"unknown operation\";\n        status =\n            grpc::Status(grpc::StatusCode::INVALID_ARGUMENT, \"Operation request field not set.\");\n      }\n    }\n    if (!status.ok()) {\n      LOG(ERROR) << \"operation failed: \" << status.error_code() << \" \" << status.error_message();\n    }\n    channel_response.mutable_status()->set_code(status.error_code());\n    channel_response.mutable_status()->set_message(status.error_message());\n\n    \/\/ Serialize the response and write it back to the Node's STORAGE_IN channel\n    std::string rsp_data;\n    channel_response.SerializeToString(&rsp_data);\n    \/\/ TODO: figure out a way to avoid the extra copy (into then out of std::string)\n    std::unique_ptr<Message> rsp_msg = absl::make_unique<Message>(rsp_data.begin(), rsp_data.end());\n    rsp_half_->Write(std::move(rsp_msg));\n  }\n}\n\n}  \/\/ namespace oak\n<|endoftext|>"}
{"text":"<commit_before>\/\/ $Id$\n\n\/\/**************************************************************************\n\/\/* This file is property of and copyright by the ALICE HLT Project        * \n\/\/* ALICE Experiment at CERN, All rights reserved.                         *\n\/\/*                                                                        *\n\/\/* Primary Authors: Matthias Richter <Matthias.Richter@ift.uib.no         *\n\/\/*                  for The ALICE HLT Project.                            *\n\/\/*                                                                        *\n\/\/* Permission to use, copy, modify and distribute this software and its   *\n\/\/* documentation strictly for non-commercial purposes is hereby granted   *\n\/\/* without fee, provided that the above copyright notice appears in all   *\n\/\/* copies and that both the copyright notice and this permission notice   *\n\/\/* appear in the supporting documentation. The authors make no claims     *\n\/\/* about the suitability of this software for any purpose. It is          *\n\/\/* provided \"as is\" without express or implied warranty.                  *\n\/\/**************************************************************************\n\n\/\/  @file   AliHLTPredictionProcessorGRP.cxx\n\/\/  @author Matthias Richter\n\/\/  @date   2010-04-12\n\/\/  @brief  Prediction processor for the GRP entry\n\/\/ \n\n#include \"AliHLTPredictionProcessorGRP.h\"\n#include \"AliCDBManager.h\"\n#include \"AliCDBEntry.h\"\n#include \"AliGRPObject.h\"\n#include \"AliCDBMetaData.h\"\n#include \"AliCDBId.h\"\n#include <cassert>\n\n\/\/#include <TObjArray.h>\n\/\/#include <AliDCSValue.h>\n\/\/#include <TTimeStamp.h>\n\n\nClassImp(AliHLTPredictionProcessorGRP)\n\nAliHLTPredictionProcessorGRP::AliHLTPredictionProcessorGRP(AliHLTPendolino* pendolino)\n  : AliHLTPredictionProcessorInterface(\"GRP\", pendolino)\n{\n  \/\/ constructor\n  \/\/ see header file for class documentation\n  \/\/ or\n  \/\/ refer to README to build package\n  \/\/ or\n  \/\/ visit http:\/\/web.ift.uib.no\/~kjeks\/doc\/alice-hlt\n}\n\n\nAliHLTPredictionProcessorGRP::~AliHLTPredictionProcessorGRP()\n{\n  \/\/ destructor\n}\n\n\nUInt_t AliHLTPredictionProcessorGRP::makePrediction(Bool_t \/*doPrediction*\/)\n{\n  \/\/ switch for prediction making\n\n  \/\/ not exactly clear what to do here, have to check the interface\n  return 0;\n}\n\n\nvoid AliHLTPredictionProcessorGRP::Initialize(Int_t run, UInt_t startTime, \n\t\t\t\t\t      UInt_t endTime)\n{\n  \/\/ initializes AliHLTPredictionProcessorGRP\n  AliHLTPredictionProcessorInterface::Initialize(run, startTime, endTime);\n\n  TString msg(\"Initialized GRP PredictProc. Run: \");\n  msg += GetRunNumber();\n  msg += \", start time: \";\n  msg += StartTime();\n  msg += \", end time: \";\n  msg += EndTime();\n  msg += \".\";\t\n  Log(msg.Data());\n}\n\n\nUInt_t AliHLTPredictionProcessorGRP::Process(TMap* dcsAliasMap)\n{\n  \/\/ processes the DCS value map\n  \n  if (!dcsAliasMap) return 9;\n  if (dcsAliasMap->GetEntries() == 0 ) return 9;\n\n  Float_t l3Current=0.0;\n  Float_t l3Polarity=0.0;\n  Float_t dipoleCurrent=0.0;\n  Float_t dipolePolarity=0.0;\n  Float_t cavernAtmosPressure=0.0;\n  Float_t cavernAtmosPressure2=0.0;\n  Float_t surfaceAtmosPressure=0.0;\n  \n  \/\/Bool_t bRet = kTRUE;\n  const char* key=\"\";\n\n  key=\"L3Current\";\n  if (!GetSensorValue(dcsAliasMap, key, &l3Current)) {\n    Log(Form(\"failed to extract %s from alias map\", key));\n    \/\/bRet=kFALSE;\n  }\n\n  key=\"L3Polarity\";\n  if (!GetSensorValue(dcsAliasMap, key, &l3Polarity)) {\n    Log(Form(\"failed to extract %s from alias map\", key));\n    \/\/bRet=kFALSE;\n  }\n\n  key=\"DipoleCurrent\";\n  if (!GetSensorValue(dcsAliasMap, key, &dipoleCurrent)) {\n    Log(Form(\"failed to extract %s from alias map\", key));\n    \/\/bRet=kFALSE;\n  }\n\n  key=\"DipolePolarity\";\n  if (!GetSensorValue(dcsAliasMap, key, &dipolePolarity)) {\n    Log(Form(\"failed to extract %s from alias map\", key));\n    \/\/bRet=kFALSE;\n  }\n\n  key=\"CavernAtmosPressure\";\n  if (!GetSensorValue(dcsAliasMap, key, &cavernAtmosPressure)) {\n    Log(Form(\"failed to extract %s from alias map\", key));\n    \/\/bRet=kFALSE;\n  }\n\n  key=\"CavernAtmosPressure2\";\n  if (!GetSensorValue(dcsAliasMap, key, &cavernAtmosPressure2)) {\n    Log(Form(\"failed to extract %s from alias map\", key));\n    \/\/bRet=kFALSE;\n  }\n\n  key=\"SurfaceAtmosPressure2\";\n  if (!GetSensorValue(dcsAliasMap, key, &surfaceAtmosPressure)) {\n    Log(Form(\"failed to extract %s from alias map\", key));\n    \/\/bRet=kFALSE;\n  }\n\n  AliGRPObject* grpObj=NULL;\n  AliGRPObject* grpExist=NULL;\n  AliCDBMetaData* cdbMetaData=NULL;\n  bool bUpdate=false;\n\n  \/\/ read existing GRP object\n  AliCDBEntry* pEntry=GetFromOCDB(\"GRP\",\"Data\");\n  if (pEntry) {\n    grpExist=dynamic_cast<AliGRPObject*>(pEntry->GetObject());\n    if (grpExist) {\n      \/\/ possible values for polarities: 0 and 1\n      \/\/ nominal value of currents is thousands of ampere \n      bUpdate=bUpdate || (TMath::Abs(grpExist->GetL3Polarity()- l3Polarity)>0.5);\n      bUpdate=bUpdate || (TMath::Abs(grpExist->GetL3Current(AliGRPObject::kMean) - l3Current)>10.0);\n      bUpdate=bUpdate || (TMath::Abs(grpExist->GetDipolePolarity()- dipolePolarity)>0.5);\n      bUpdate=bUpdate || (TMath::Abs(grpExist->GetDipoleCurrent(AliGRPObject::kMean) - dipoleCurrent)>10.0);\n\n      cdbMetaData=pEntry->GetMetaData();\n    }\n  }\n  \/\/ don't write if object is there and up-to-date\n  if (grpExist && !bUpdate) return 0;\n\n  if (grpExist) {\n    \/\/ update existing object\n    grpObj=grpExist;\n  } else {\n    \/\/ generate GRP object\n    grpObj=new AliGRPObject;\n    float cmsEnergy=14000;\n    grpObj->SetBeamEnergy(cmsEnergy\/0.120); \/\/ LHC convention\n    grpObj->SetBeamType(\"p-p\");\n  }\n  grpObj->SetL3Current(l3Current,(AliGRPObject::Stats)0);\n  grpObj->SetDipoleCurrent(dipoleCurrent,(AliGRPObject::Stats)0);  \n  grpObj->SetL3Polarity(l3Polarity);  \n  grpObj->SetDipolePolarity(dipolePolarity);\n  grpObj->SetPolarityConventionLHC();                    \/\/ LHC convention +\/+ current -> -\/- field main components\n\n  if (!cdbMetaData) {\n    cdbMetaData=new AliCDBMetaData;\n    cdbMetaData->SetResponsible(\"Matthias.Richter@cern.ch\");\n    cdbMetaData->SetComment(Form(\"GRP entry for the magnetic field initialization of HLT components, produced by %s\", ClassName()));\n  }\n\n  \/\/ note: 'validityStart' specifies run no w.r.t. current run no -> thus 0\n  \/\/ create with run specific validity -> kFALSE \n  if (Store(\"GRP\", \"Data\", grpObj, cdbMetaData, 0, kFALSE)) {\n  } else {\n    Log(\" *** Failed to store GRP object\");\n    return 7;\n  }\n  if (!grpExist) {\n    if (grpObj) delete grpObj;\n    grpObj=NULL;\n    if (cdbMetaData) delete cdbMetaData;\n    cdbMetaData=NULL;\n  }\n  \n  return 0;\n}\n\nTMap* AliHLTPredictionProcessorGRP::produceTestData(TString \/*aliasName*\/)\n{\n  \/\/ produces test data for AliHLTPredictionProcessorGRP\n  TMap* resultMap = 0;\n\n  return resultMap;\n}\n\nbool AliHLTPredictionProcessorGRP::CreateInitialGRPEntry(int runno, const char* beamtype, const char* runtype, const char* \/*detectorList*\/)\n{\n  \/\/ Create the initial GRP entry.\n  \/\/ The beam type and run type parameters are propagated form the ECS to\n  \/\/ the run manager, and provided as arguments to the pendolino.\n  \/\/ The initial GRP entry is created ignoring the magnetic field, this\n  \/\/ is updated by the pendolino afterwords.\n\n  AliGRPObject* grpObj=new AliGRPObject;\n  float cmsEnergy=14000; \/\/ check if this can be obtained from somewhere\n  grpObj->SetBeamEnergy(cmsEnergy\/0.120); \/\/ LHC convention\n  grpObj->SetBeamType(beamtype);\n  grpObj->SetRunType(runtype);\n  grpObj->SetL3Current(0.0,(AliGRPObject::Stats)0);\n  grpObj->SetDipoleCurrent(0.0,(AliGRPObject::Stats)0);  \n  grpObj->SetL3Polarity(0);  \n  grpObj->SetDipolePolarity(0);\n  grpObj->SetPolarityConventionLHC();\n  grpObj->SetTimeStart(time(NULL));   \/\/ check if time can be fetched from ECS\n\n  \/* the following needs to be checked\n  grpObj->SetLHCPeriod(getenv(\"LHC_PERIOD\"));\n  grpObj->SetNumberOfDetectors(numOfDetectors);\n  grpObj->SetDetectorMask(detectMask);  \n  *\/\n  \n  AliCDBManager* man = AliCDBManager::Instance();\n  if (!man || !man->IsDefaultStorageSet()) {\n    return false;\n  }\n\n  AliCDBPath cdbPath(\"GRP\/GRP\/Data\");\n  AliCDBId cdbId(cdbPath, runno, runno);\n  AliCDBMetaData cdbMetaData;\n  cdbMetaData.SetResponsible(\"matthias.richter@cern.ch\");\n  cdbMetaData.SetComment(Form(\"Online GRP entry, produced by AliHLTPredictionProcessorGRP\"));\n  return man->Put(grpObj, cdbId, &cdbMetaData);\n}\n<commit_msg>bugfix: extracting AliDCSSensor of correct type 'bool' for magnet polarities https:\/\/savannah.cern.ch\/bugs\/?73879 type fixed preventing 'SurfaceAtmosPressure' to be retrieved adding pressure sensors to the GRP<commit_after>\/\/ $Id$\n\n\/\/**************************************************************************\n\/\/* This file is property of and copyright by the ALICE HLT Project        * \n\/\/* ALICE Experiment at CERN, All rights reserved.                         *\n\/\/*                                                                        *\n\/\/* Primary Authors: Matthias Richter <Matthias.Richter@ift.uib.no         *\n\/\/*                  for The ALICE HLT Project.                            *\n\/\/*                                                                        *\n\/\/* Permission to use, copy, modify and distribute this software and its   *\n\/\/* documentation strictly for non-commercial purposes is hereby granted   *\n\/\/* without fee, provided that the above copyright notice appears in all   *\n\/\/* copies and that both the copyright notice and this permission notice   *\n\/\/* appear in the supporting documentation. The authors make no claims     *\n\/\/* about the suitability of this software for any purpose. It is          *\n\/\/* provided \"as is\" without express or implied warranty.                  *\n\/\/**************************************************************************\n\n\/\/  @file   AliHLTPredictionProcessorGRP.cxx\n\/\/  @author Matthias Richter\n\/\/  @date   2010-04-12\n\/\/  @brief  Prediction processor for the GRP entry\n\/\/ \n\n#include \"AliHLTPredictionProcessorGRP.h\"\n#include \"AliCDBManager.h\"\n#include \"AliCDBEntry.h\"\n#include \"AliGRPObject.h\"\n#include \"AliCDBMetaData.h\"\n#include \"AliCDBId.h\"\n#include <cassert>\n\n\/\/#include <TObjArray.h>\n\/\/#include <AliDCSValue.h>\n\/\/#include <TTimeStamp.h>\n\n\nClassImp(AliHLTPredictionProcessorGRP)\n\nconst float kNormAtmosPressure = 1013.0; \/\/ norm pressure in mbar\n\nAliHLTPredictionProcessorGRP::AliHLTPredictionProcessorGRP(AliHLTPendolino* pendolino)\n  : AliHLTPredictionProcessorInterface(\"GRP\", pendolino)\n{\n  \/\/ constructor\n  \/\/ see header file for class documentation\n  \/\/ or\n  \/\/ refer to README to build package\n  \/\/ or\n  \/\/ visit http:\/\/web.ift.uib.no\/~kjeks\/doc\/alice-hlt\n}\n\n\nAliHLTPredictionProcessorGRP::~AliHLTPredictionProcessorGRP()\n{\n  \/\/ destructor\n}\n\n\nUInt_t AliHLTPredictionProcessorGRP::makePrediction(Bool_t \/*doPrediction*\/)\n{\n  \/\/ switch for prediction making\n\n  \/\/ not exactly clear what to do here, have to check the interface\n  return 0;\n}\n\n\nvoid AliHLTPredictionProcessorGRP::Initialize(Int_t run, UInt_t startTime, \n\t\t\t\t\t      UInt_t endTime)\n{\n  \/\/ initializes AliHLTPredictionProcessorGRP\n  AliHLTPredictionProcessorInterface::Initialize(run, startTime, endTime);\n\n  TString msg(\"Initialized GRP PredictProc. Run: \");\n  msg += GetRunNumber();\n  msg += \", start time: \";\n  msg += StartTime();\n  msg += \", end time: \";\n  msg += EndTime();\n  msg += \".\";\t\n  Log(msg.Data());\n}\n\n\nUInt_t AliHLTPredictionProcessorGRP::Process(TMap* dcsAliasMap)\n{\n  \/\/ processes the DCS value map\n  \n  if (!dcsAliasMap) return 9;\n  if (dcsAliasMap->GetEntries() == 0 ) return 9;\n\n  Float_t l3Current=0.0;\n  Bool_t l3Polarity=0; \/\/ positive field according to LHC convention\n  Float_t dipoleCurrent=0.0;\n  Bool_t dipolePolarity=0; \/\/ positive field according to LHC convention\n  Float_t cavernAtmosPressure=kNormAtmosPressure;\n  Float_t cavernAtmosPressure2=kNormAtmosPressure;\n  Float_t surfaceAtmosPressure=kNormAtmosPressure;\n  \n  \/\/Bool_t bRet = kTRUE;\n  const char* key=\"\";\n\n  key=\"L3Current\";\n  if (!GetSensorValue(dcsAliasMap, key, &l3Current)) {\n    Log(Form(\"failed to extract %s from alias map\", key));\n    \/\/bRet=kFALSE;\n  }\n\n  key=\"L3Polarity\";\n  if (!GetSensorValue(dcsAliasMap, key, &l3Polarity)) {\n    Log(Form(\"failed to extract %s from alias map\", key));\n    \/\/bRet=kFALSE;\n  }\n\n  key=\"DipoleCurrent\";\n  if (!GetSensorValue(dcsAliasMap, key, &dipoleCurrent)) {\n    Log(Form(\"failed to extract %s from alias map\", key));\n    \/\/bRet=kFALSE;\n  }\n\n  key=\"DipolePolarity\";\n  if (!GetSensorValue(dcsAliasMap, key, &dipolePolarity)) {\n    Log(Form(\"failed to extract %s from alias map\", key));\n    \/\/bRet=kFALSE;\n  }\n\n  key=\"CavernAtmosPressure\";\n  if (!GetSensorValue(dcsAliasMap, key, &cavernAtmosPressure)) {\n    Log(Form(\"failed to extract %s from alias map\", key));\n    \/\/bRet=kFALSE;\n  }\n\n  key=\"CavernAtmosPressure2\";\n  if (!GetSensorValue(dcsAliasMap, key, &cavernAtmosPressure2)) {\n    Log(Form(\"failed to extract %s from alias map\", key));\n    \/\/bRet=kFALSE;\n  }\n\n  key=\"SurfaceAtmosPressure\";\n  if (!GetSensorValue(dcsAliasMap, key, &surfaceAtmosPressure)) {\n    Log(Form(\"failed to extract %s from alias map\", key));\n    \/\/bRet=kFALSE;\n  }\n\n  AliGRPObject* grpObj=NULL;\n  AliGRPObject* grpExist=NULL;\n  AliCDBMetaData* cdbMetaData=NULL;\n  bool bUpdate=false;\n\n  \/\/ read existing GRP object\n  AliCDBEntry* pEntry=GetFromOCDB(\"GRP\",\"Data\");\n  if (pEntry) {\n    grpExist=dynamic_cast<AliGRPObject*>(pEntry->GetObject());\n    if (grpExist) {\n      \/\/ possible values for polarities: 0 and 1\n      \/\/ nominal value of currents is thousands of ampere \n      bUpdate=bUpdate || (TMath::Abs(grpExist->GetL3Polarity()- l3Polarity)>0.5);\n      bUpdate=bUpdate || (TMath::Abs(grpExist->GetL3Current(AliGRPObject::kMean) - l3Current)>10.0);\n      bUpdate=bUpdate || (TMath::Abs(grpExist->GetDipolePolarity()- dipolePolarity)>0.5);\n      bUpdate=bUpdate || (TMath::Abs(grpExist->GetDipoleCurrent(AliGRPObject::kMean) - dipoleCurrent)>10.0);\n      bUpdate=bUpdate \n\t|| (grpExist->GetCavernAtmosPressure()==NULL)\n\t|| (TMath::Abs(grpExist->GetCavernAtmosPressure()->GetValue(0) - cavernAtmosPressure)> 1.0);\n      bUpdate=bUpdate \n\t|| (grpExist->GetCavernAtmosPressure2()==NULL)\n\t|| (TMath::Abs(grpExist->GetCavernAtmosPressure2()->GetValue(0) - cavernAtmosPressure2) > 1.0);\n      bUpdate=bUpdate \n\t|| (grpExist->GetSurfaceAtmosPressure()==NULL)\n\t|| (TMath::Abs(grpExist->GetSurfaceAtmosPressure()->GetValue(0) - surfaceAtmosPressure) > 1.0);\n\n\n      cdbMetaData=pEntry->GetMetaData();\n    } else {\n      bUpdate=true;\n    }\n  } else {\n    bUpdate=true;\n  }\n  \/\/ TString msg=\"AliHLTPredictionProcessorGRP::Process: update \";\n  \/\/ msg+=bUpdate;\n  \/\/ msg+=\"   \\nL3 current = \"; msg+=l3Current;\n  \/\/ msg+=\"   \\nL3 polarity = \"; msg+=l3Polarity;\n  \/\/ msg+=\"   \\nDipole current = \"; msg+=dipoleCurrent;\n  \/\/ msg+=\"   \\nDipole polarity = \"; msg+=l3Polarity;\n  \/\/ msg+=\"   \\nCavern pressure = \"; msg+=cavernAtmosPressure;\n  \/\/ msg+=\"   \\nCavern pressure2 = \"; msg+=cavernAtmosPressure2;\n  \/\/ msg+=\"   \\nSurface pressure = \"; msg+=surfaceAtmosPressure;\n  \/\/ Log(msg.Data());\n\n  \/\/ don't write if object is there and up-to-date\n  if (grpExist && !bUpdate) return 0;\n\n  if (grpExist) {\n    \/\/ update existing object\n    grpObj=grpExist;\n  } else {\n    \/\/ generate GRP object\n    \/\/ TODO: correct energy has to be extracted somewhere\n    grpObj=new AliGRPObject;\n    float cmsEnergy=14000;\n    grpObj->SetBeamEnergy(cmsEnergy\/0.120); \/\/ LHC convention\n    grpObj->SetBeamType(\"p-p\");\n  }\n  grpObj->SetL3Current(l3Current,(AliGRPObject::Stats)0);\n  grpObj->SetDipoleCurrent(dipoleCurrent,(AliGRPObject::Stats)0);  \n  grpObj->SetL3Polarity(l3Polarity);  \n  grpObj->SetDipolePolarity(dipolePolarity);\n  grpObj->SetPolarityConventionLHC();                    \/\/ LHC convention +\/+ current -> -\/- field main components\n  grpObj->SetCavernAtmosPressure(CreateSensor(\"CavernAtmosPressure\",\n\t\t\t\t\t      cavernAtmosPressure,\n\t\t\t\t\t      GetStartTime(),\n\t\t\t\t\t      GetEndTime())\n\t\t\t\t );\n  grpObj->SetCavernAtmosPressure2(CreateSensor(\"CavernAtmosPressure2\",\n\t\t\t\t\t       cavernAtmosPressure2,\n\t\t\t\t\t       GetStartTime(),\n\t\t\t\t\t       GetEndTime())\n\t\t\t\t  );\n  grpObj->SetSurfaceAtmosPressure(CreateSensor(\"SurfaceAtmosPressure\",\n\t\t\t\t\t       surfaceAtmosPressure,\n\t\t\t\t\t       GetStartTime(),\n\t\t\t\t\t       GetEndTime())\n\t\t\t\t  );\n\n  if (!cdbMetaData) {\n    cdbMetaData=new AliCDBMetaData;\n    cdbMetaData->SetResponsible(\"Matthias.Richter@cern.ch\");\n    cdbMetaData->SetComment(Form(\"GRP entry for the magnetic field initialization of HLT components, produced by %s\", ClassName()));\n  }\n\n  \/\/ note: 'validityStart' specifies run no w.r.t. current run no -> thus 0\n  \/\/ create with run specific validity -> kFALSE \n  if (Store(\"GRP\", \"Data\", grpObj, cdbMetaData, 0, kFALSE)) {\n  } else {\n    Log(\" *** Failed to store GRP object\");\n    return 7;\n  }\n  if (!grpExist) {\n    if (grpObj) delete grpObj;\n    grpObj=NULL;\n    if (cdbMetaData) delete cdbMetaData;\n    cdbMetaData=NULL;\n  }\n  \n  return 0;\n}\n\nTMap* AliHLTPredictionProcessorGRP::produceTestData(TString \/*aliasName*\/)\n{\n  \/\/ produces test data for AliHLTPredictionProcessorGRP\n  TMap* resultMap = 0;\n\n  return resultMap;\n}\n\nbool AliHLTPredictionProcessorGRP::CreateInitialGRPEntry(int runno, const char* beamtype, const char* runtype, const char* \/*detectorList*\/)\n{\n  \/\/ Create the initial GRP entry.\n  \/\/ The beam type and run type parameters are propagated form the ECS to\n  \/\/ the run manager, and provided as arguments to the pendolino.\n  \/\/ The initial GRP entry is created ignoring the magnetic field, this\n  \/\/ is updated by the pendolino afterwords.\n\n  AliGRPObject* grpObj=new AliGRPObject;\n  float cmsEnergy=14000; \/\/ check if this can be obtained from somewhere\n  grpObj->SetBeamEnergy(cmsEnergy\/0.120); \/\/ LHC convention\n  grpObj->SetBeamType(beamtype);\n  grpObj->SetRunType(runtype);\n  grpObj->SetL3Current(0.0,(AliGRPObject::Stats)0);\n  grpObj->SetDipoleCurrent(0.0,(AliGRPObject::Stats)0);  \n  grpObj->SetL3Polarity(0);  \n  grpObj->SetDipolePolarity(0);\n  grpObj->SetPolarityConventionLHC();\n  grpObj->SetTimeStart(time(NULL));   \/\/ check if time can be fetched from ECS\n\n  \/* the following needs to be checked\n  grpObj->SetLHCPeriod(getenv(\"LHC_PERIOD\"));\n  grpObj->SetNumberOfDetectors(numOfDetectors);\n  grpObj->SetDetectorMask(detectMask);  \n  *\/\n  \n  AliCDBManager* man = AliCDBManager::Instance();\n  if (!man || !man->IsDefaultStorageSet()) {\n    return false;\n  }\n\n  AliCDBPath cdbPath(\"GRP\/GRP\/Data\");\n  AliCDBId cdbId(cdbPath, runno, runno);\n  AliCDBMetaData cdbMetaData;\n  cdbMetaData.SetResponsible(\"matthias.richter@cern.ch\");\n  cdbMetaData.SetComment(Form(\"Online GRP entry, produced by AliHLTPredictionProcessorGRP\"));\n  return man->Put(grpObj, cdbId, &cdbMetaData);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/***********************************************************************\n    created:    Tue Feb 17 2009\n    author:     Paul D Turner\n*************************************************************************\/\n\/***************************************************************************\n *   Copyright (C) 2004 - 2013 Paul D Turner & The CEGUI Development Team\n *\n *   Permission is hereby granted, free of charge, to any person obtaining\n *   a copy of this software and associated documentation files (the\n *   \"Software\"), to deal in the Software without restriction, including\n *   without limitation the rights to use, copy, modify, merge, publish,\n *   distribute, sublicense, and\/or sell copies of the Software, and to\n *   permit persons to whom the Software is furnished to do so, subject to\n *   the following conditions:\n *\n *   The above copyright notice and this permission notice shall be\n *   included in all copies or substantial portions of the Software.\n *\n *   THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n *   EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n *   MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n *   IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR\n *   OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,\n *   ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\n *   OTHER DEALINGS IN THE SOFTWARE.\n ***************************************************************************\/\n#include \"CEGUI\/RendererModules\/Ogre\/RenderTarget.h\"\n#include \"CEGUI\/GeometryBuffer.h\"\n#include \"CEGUI\/RenderQueue.h\"\n#include \"CEGUI\/RendererModules\/Ogre\/GeometryBuffer.h\"\n\n#include <OgreRenderSystem.h>\n#include <OgreCamera.h>\n#include <OgreViewport.h>\n\n#include \"glm\/glm.hpp\"\n#include \"glm\/gtc\/matrix_transform.hpp\"\n\n\/\/ Start of CEGUI namespace section\nnamespace CEGUI\n{\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nconst float OgreRenderTarget<T>::d_yfov_tan = 0.267949192431123f;\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nOgreRenderTarget<T>::OgreRenderTarget(OgreRenderer& owner,\n                                      Ogre::RenderSystem& rs) :\n    d_owner(owner),\n    d_renderSystem(rs),\n    d_area(0, 0, 0, 0),\n    d_renderTarget(0),\n    d_viewport(0),\n    d_ogreViewportDimensions(0, 0, 0, 0),\n    d_matrix(Ogre::Matrix4::IDENTITY),\n    d_matrixValid(false),\n    d_viewportValid(false),\n    d_viewDistance(0)\n{\n}\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nOgreRenderTarget<T>::~OgreRenderTarget()\n{\n    delete d_viewport;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nvoid OgreRenderTarget<T>::draw(const GeometryBuffer& buffer)\n{\n    buffer.draw();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nvoid OgreRenderTarget<T>::draw(const RenderQueue& queue)\n{\n    queue.draw();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nvoid OgreRenderTarget<T>::setArea(const Rectf& area)\n{\n    d_area = area;\n    setOgreViewportDimensions(area);\n\n    d_matrixValid = false;\n\n    RenderTargetEventArgs args(this);\n    T::fireEvent(RenderTarget::EventAreaChanged, args);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nvoid OgreRenderTarget<T>::setOgreViewportDimensions(const Rectf& area)\n{\n    d_ogreViewportDimensions = area;\n\n    if (d_viewport)\n        updateOgreViewportDimensions(d_viewport->getTarget());\n\n    d_viewportValid = false;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nvoid OgreRenderTarget<T>::updateOgreViewportDimensions(\n                                            const Ogre::RenderTarget* const rt)\n{\n    if (rt)\n    {\n        if(d_viewport)\n            d_viewport->setDimensions(\n            d_ogreViewportDimensions.left() \/ rt->getWidth(),\n            d_ogreViewportDimensions.top() \/ rt->getHeight(),\n            d_ogreViewportDimensions.getWidth() \/ rt->getWidth(),\n            d_ogreViewportDimensions.getHeight() \/ rt->getHeight());\n    }\n}\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nconst Rectf& OgreRenderTarget<T>::getArea() const\n{\n    return d_area;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nvoid OgreRenderTarget<T>::activate()\n{\n    if (!d_matrixValid)\n        updateMatrix();\n\n    if (!d_viewportValid)\n        updateViewport();\n\n    d_renderSystem._setViewport(d_viewport);\n\n    \n    d_owner.setProjectionMatrix(d_matrix);\n    d_owner.setViewMatrix(Ogre::Matrix4::IDENTITY);\n\n    RenderTarget::activate();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nvoid OgreRenderTarget<T>::deactivate()\n{\n    \/\/ currently nothing to do in the basic case\n}\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nvoid OgreRenderTarget<T>::unprojectPoint(const GeometryBuffer& buff,\n                                         const glm::vec2& p_in,\n                                         glm::vec2& p_out) const\n{\n    if (!d_matrixValid)\n        updateMatrix();\n\n    const OgreGeometryBuffer& gb = static_cast<const OgreGeometryBuffer&>(buff);\n\n    const Ogre::Real midx = d_area.getWidth() * 0.5f;\n    const Ogre::Real midy = d_area.getHeight() * 0.5f;\n\n    \/\/ viewport matrix\n    const Ogre::Matrix4 vpmat(\n        midx,    0,    0,    d_area.left() + midx,\n         0,    -midy,  0,    d_area.top() + midy,\n         0,      0,    1,    0,\n         0,      0,    0,    1\n    );\n\n    \/\/ matrices used for projecting and unprojecting points\n\n    const Ogre::Matrix4 proj(OgreRenderer::glmToOgreMatrix(gb.getModelMatrix()) * d_matrix * vpmat);\n    const Ogre::Matrix4 unproj(proj.inverse());\n\n    Ogre::Vector3 in;\n\n    \/\/ unproject the ends of the ray\n    in.x = midx;\n    in.y = midy;\n    in.z = -d_viewDistance;\n    const Ogre::Vector3 r1(unproj * in);\n    in.x = p_in.x;\n    in.y = p_in.y;\n    in.z = 0;\n    \/\/ calculate vector of picking ray\n    const Ogre::Vector3 rv(r1 - unproj * in);\n\n    \/\/ project points to orientate them with GeometryBuffer plane\n    in.x = 0.0;\n    in.y = 0.0;\n    const Ogre::Vector3 p1(proj * in);\n    in.x = 1.0;\n    in.y = 0.0;\n    const Ogre::Vector3 p2(proj * in);\n    in.x = 0.0;\n    in.y = 1.0;\n    const Ogre::Vector3 p3(proj * in);\n\n    \/\/ calculate the plane normal\n    const Ogre::Vector3 pn((p2 - p1).crossProduct(p3 - p1));\n    \/\/ calculate distance from origin\n    const Ogre::Real plen = pn.length();\n    const Ogre::Real dist = -(p1.x * (pn.x \/ plen) +\n                              p1.y * (pn.y \/ plen) +\n                              p1.z * (pn.z \/ plen));\n\n    \/\/ calculate intersection of ray and plane\n    const Ogre::Real pn_dot_rv = pn.dotProduct(rv);\n    const Ogre::Real tmp = pn_dot_rv != 0.0 ?\n                            (pn.dotProduct(r1) + dist) \/ pn_dot_rv :\n                            0.0f;\n\n    p_out.x = static_cast<float>(r1.x - rv.x * tmp);\n    p_out.y = static_cast<float>(r1.y - rv.y * tmp);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nvoid OgreRenderTarget<T>::updateMatrix() const\n{\n    \/\/ Now with updated code from OpenGL renderer\n\n    const float w = d_area.getWidth();\n    const float h = d_area.getHeight();\n\n    \/\/ We need to check if width or height are zero and act accordingly to prevent running into issues\n    \/\/ with divisions by zero which would lead to undefined values, as well as faulty clipping planes\n    \/\/ This is mostly important for avoiding asserts\n    const bool widthAndHeightNotZero = ( w != 0.0f ) && ( h != 0.0f);\n\n    const float aspect = widthAndHeightNotZero ? w \/ h : 1.0f;\n    const float midx = widthAndHeightNotZero ? w * 0.5f : 0.5f;\n    const float midy = widthAndHeightNotZero ? h * 0.5f : 0.5f;\n    d_viewDistance = midx \/ (aspect * 0.267949192431123f);\n\n    const float nearZ = d_viewDistance * 0.5f;\n    const float farZ = d_viewDistance * 2.0f;\n    const float nr_sub_far = nearZ - farZ;\n\n    Ogre::Matrix4 tmp(Ogre::Matrix4::ZERO);\n    tmp[0][0] = 3.732050808f \/ aspect;\n    tmp[0][3] = -d_viewDistance;\n    tmp[1][1] = -3.732050808f;\n    tmp[1][3] = d_viewDistance;\n    tmp[2][2] = -((farZ + nearZ) \/ nr_sub_far);\n    tmp[3][2] = 1.0f;\n    tmp[3][3] = d_viewDistance;\n\n    d_renderSystem._convertProjectionMatrix(tmp, d_matrix);\n\n    d_matrixValid = true;\n    \/\/! This will trigger the RenderTarget to notify all of its GeometryBuffers to regenerate their matrices\n    RenderTarget::d_activationCounter = -1;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nvoid OgreRenderTarget<T>::updateViewport()\n{\n    if (!d_viewport)\n    {\n#ifdef CEGUI_USE_OGRE_COMPOSITOR2\n\n        d_viewport = OGRE_NEW Ogre::Viewport(d_renderTarget, 0, 0, 1, 1);\n#else\n        d_viewport = OGRE_NEW Ogre::Viewport(0, d_renderTarget, 0, 0, 1, 1, 0);\n#endif \/\/ CEGUI_USE_OGRE_COMPOSITOR2\n\n        updateOgreViewportDimensions(d_renderTarget);\n    }\n\n    d_viewport->_updateDimensions();\n\n    d_viewportValid = true;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nRenderer& OgreRenderTarget<T>::getOwner()\n{\n    return d_owner;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\n\n} \/\/ End of  CEGUI namespace section\n<commit_msg>MOD: Replacing matrix with OpenGLRenderer Matrix<commit_after>\/***********************************************************************\n    created:    Tue Feb 17 2009\n    author:     Paul D Turner\n*************************************************************************\/\n\/***************************************************************************\n *   Copyright (C) 2004 - 2013 Paul D Turner & The CEGUI Development Team\n *\n *   Permission is hereby granted, free of charge, to any person obtaining\n *   a copy of this software and associated documentation files (the\n *   \"Software\"), to deal in the Software without restriction, including\n *   without limitation the rights to use, copy, modify, merge, publish,\n *   distribute, sublicense, and\/or sell copies of the Software, and to\n *   permit persons to whom the Software is furnished to do so, subject to\n *   the following conditions:\n *\n *   The above copyright notice and this permission notice shall be\n *   included in all copies or substantial portions of the Software.\n *\n *   THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n *   EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n *   MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n *   IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR\n *   OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,\n *   ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\n *   OTHER DEALINGS IN THE SOFTWARE.\n ***************************************************************************\/\n#include \"CEGUI\/RendererModules\/Ogre\/RenderTarget.h\"\n#include \"CEGUI\/GeometryBuffer.h\"\n#include \"CEGUI\/RenderQueue.h\"\n#include \"CEGUI\/RendererModules\/Ogre\/GeometryBuffer.h\"\n\n#include <OgreRenderSystem.h>\n#include <OgreCamera.h>\n#include <OgreViewport.h>\n\n#include <glm\/glm.hpp>\n#include <glm\/gtc\/type_ptr.hpp>\n#include <glm\/gtc\/matrix_transform.hpp>\n\n\/\/ Start of CEGUI namespace section\nnamespace CEGUI\n{\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nconst float OgreRenderTarget<T>::d_yfov_tan = 0.267949192431123f;\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nOgreRenderTarget<T>::OgreRenderTarget(OgreRenderer& owner,\n                                      Ogre::RenderSystem& rs) :\n    d_owner(owner),\n    d_renderSystem(rs),\n    d_area(0, 0, 0, 0),\n    d_renderTarget(0),\n    d_viewport(0),\n    d_ogreViewportDimensions(0, 0, 0, 0),\n    d_matrix(Ogre::Matrix4::IDENTITY),\n    d_matrixValid(false),\n    d_viewportValid(false),\n    d_viewDistance(0)\n{\n}\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nOgreRenderTarget<T>::~OgreRenderTarget()\n{\n    delete d_viewport;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nvoid OgreRenderTarget<T>::draw(const GeometryBuffer& buffer)\n{\n    buffer.draw();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nvoid OgreRenderTarget<T>::draw(const RenderQueue& queue)\n{\n    queue.draw();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nvoid OgreRenderTarget<T>::setArea(const Rectf& area)\n{\n    d_area = area;\n    setOgreViewportDimensions(area);\n\n    d_matrixValid = false;\n\n    RenderTargetEventArgs args(this);\n    T::fireEvent(RenderTarget::EventAreaChanged, args);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nvoid OgreRenderTarget<T>::setOgreViewportDimensions(const Rectf& area)\n{\n    d_ogreViewportDimensions = area;\n\n    if (d_viewport)\n        updateOgreViewportDimensions(d_viewport->getTarget());\n\n    d_viewportValid = false;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nvoid OgreRenderTarget<T>::updateOgreViewportDimensions(\n                                            const Ogre::RenderTarget* const rt)\n{\n    if (rt)\n    {\n        if(d_viewport)\n            d_viewport->setDimensions(\n            d_ogreViewportDimensions.left() \/ rt->getWidth(),\n            d_ogreViewportDimensions.top() \/ rt->getHeight(),\n            d_ogreViewportDimensions.getWidth() \/ rt->getWidth(),\n            d_ogreViewportDimensions.getHeight() \/ rt->getHeight());\n    }\n}\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nconst Rectf& OgreRenderTarget<T>::getArea() const\n{\n    return d_area;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nvoid OgreRenderTarget<T>::activate()\n{\n    if (!d_matrixValid)\n        updateMatrix();\n\n    if (!d_viewportValid)\n        updateViewport();\n\n    d_renderSystem._setViewport(d_viewport);\n\n    \n    d_owner.setProjectionMatrix(d_matrix);\n    d_owner.setViewMatrix(Ogre::Matrix4::IDENTITY);\n\n    RenderTarget::activate();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nvoid OgreRenderTarget<T>::deactivate()\n{\n    \/\/ currently nothing to do in the basic case\n}\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nvoid OgreRenderTarget<T>::unprojectPoint(const GeometryBuffer& buff,\n                                         const glm::vec2& p_in,\n                                         glm::vec2& p_out) const\n{\n    if (!d_matrixValid)\n        updateMatrix();\n\n    const OgreGeometryBuffer& gb = static_cast<const OgreGeometryBuffer&>(buff);\n\n    const Ogre::Real midx = d_area.getWidth() * 0.5f;\n    const Ogre::Real midy = d_area.getHeight() * 0.5f;\n\n    \/\/ viewport matrix\n    const Ogre::Matrix4 vpmat(\n        midx,    0,    0,    d_area.left() + midx,\n         0,    -midy,  0,    d_area.top() + midy,\n         0,      0,    1,    0,\n         0,      0,    0,    1\n    );\n\n    \/\/ matrices used for projecting and unprojecting points\n\n    const Ogre::Matrix4 proj(OgreRenderer::glmToOgreMatrix(gb.getModelMatrix()) * d_matrix * vpmat);\n    const Ogre::Matrix4 unproj(proj.inverse());\n\n    Ogre::Vector3 in;\n\n    \/\/ unproject the ends of the ray\n    in.x = midx;\n    in.y = midy;\n    in.z = -d_viewDistance;\n    const Ogre::Vector3 r1(unproj * in);\n    in.x = p_in.x;\n    in.y = p_in.y;\n    in.z = 0;\n    \/\/ calculate vector of picking ray\n    const Ogre::Vector3 rv(r1 - unproj * in);\n\n    \/\/ project points to orientate them with GeometryBuffer plane\n    in.x = 0.0;\n    in.y = 0.0;\n    const Ogre::Vector3 p1(proj * in);\n    in.x = 1.0;\n    in.y = 0.0;\n    const Ogre::Vector3 p2(proj * in);\n    in.x = 0.0;\n    in.y = 1.0;\n    const Ogre::Vector3 p3(proj * in);\n\n    \/\/ calculate the plane normal\n    const Ogre::Vector3 pn((p2 - p1).crossProduct(p3 - p1));\n    \/\/ calculate distance from origin\n    const Ogre::Real plen = pn.length();\n    const Ogre::Real dist = -(p1.x * (pn.x \/ plen) +\n                              p1.y * (pn.y \/ plen) +\n                              p1.z * (pn.z \/ plen));\n\n    \/\/ calculate intersection of ray and plane\n    const Ogre::Real pn_dot_rv = pn.dotProduct(rv);\n    const Ogre::Real tmp = pn_dot_rv != 0.0 ?\n                            (pn.dotProduct(r1) + dist) \/ pn_dot_rv :\n                            0.0f;\n\n    p_out.x = static_cast<float>(r1.x - rv.x * tmp);\n    p_out.y = static_cast<float>(r1.y - rv.y * tmp);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nvoid OgreRenderTarget<T>::updateMatrix() const\n{\n    const float w = d_area.getWidth();\n    const float h = d_area.getHeight();\n\n    \/\/ We need to check if width or height are zero and act accordingly to prevent running into issues\n    \/\/ with divisions by zero which would lead to undefined values, as well as faulty clipping planes\n    \/\/ This is mostly important for avoiding asserts\n    const bool widthAndHeightNotZero = ( w != 0.0f ) && ( h != 0.0f);\n\n    const float aspect = widthAndHeightNotZero ? w \/ h : 1.0f;\n    const float midx = widthAndHeightNotZero ? w * 0.5f : 0.5f;\n    const float midy = widthAndHeightNotZero ? h * 0.5f : 0.5f;\n    d_viewDistance = midx \/ (aspect * d_yfov_tan);\n\n    glm::vec3 eye = glm::vec3(midx, midy, -d_viewDistance);\n    glm::vec3 center = glm::vec3(midx, midy, 1);\n    glm::vec3 up = glm::vec3(0, -1, 0);\n\n    glm::mat4 projectionMatrix = glm::perspective(30.f, aspect, d_viewDistance * 0.5f, d_viewDistance * 2.0f);\n    \/\/ Projection matrix abuse!\n    glm::mat4 viewMatrix = glm::lookAt(eye, center, up);\n  \n    glm::mat4 finalMatrix = projectionMatrix * viewMatrix;\n\n    \n    Ogre::Matrix4 temp = OgreRenderer::glmToOgreMatrix(finalMatrix);\n    d_renderSystem._convertProjectionMatrix(temp, d_matrix, true);\n\n    d_matrixValid = true;\n    \/\/! This will trigger the RenderTarget to notify all of its GeometryBuffers to regenerate their matrices\n    RenderTarget::d_activationCounter = -1;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nvoid OgreRenderTarget<T>::updateViewport()\n{\n    if (!d_viewport)\n    {\n#ifdef CEGUI_USE_OGRE_COMPOSITOR2\n\n        d_viewport = OGRE_NEW Ogre::Viewport(d_renderTarget, 0, 0, 1, 1);\n#else\n        d_viewport = OGRE_NEW Ogre::Viewport(0, d_renderTarget, 0, 0, 1, 1, 0);\n#endif \/\/ CEGUI_USE_OGRE_COMPOSITOR2\n\n        updateOgreViewportDimensions(d_renderTarget);\n    }\n\n    d_viewport->_updateDimensions();\n\n    d_viewportValid = true;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\ntemplate <typename T>\nRenderer& OgreRenderTarget<T>::getOwner()\n{\n    return d_owner;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\n\n} \/\/ End of  CEGUI namespace section\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Halide tutorial lesson 11: Cross-compilation\n\n\/\/ This lesson demonstrates how to use Halide as a cross-compiler to\n\/\/ generate code for any platform from any platform.\n\n\/\/ On linux, you can compile and run it like so:\n\/\/ g++ lesson_11*.cpp -g -std=c++11 -I ..\/include -L ..\/bin -lHalide -lpthread -ldl -o lesson_11\n\/\/ LD_LIBRARY_PATH=..\/bin .\/lesson_11\n\n\/\/ On os x:\n\/\/ g++ lesson_11*.cpp -g -std=c++11 -I ..\/include -L ..\/bin -lHalide -o lesson_11\n\/\/ DYLD_LIBRARY_PATH=..\/bin .\/lesson_11\n\n\/\/ If you have the entire Halide source tree, you can also build it by\n\/\/ running:\n\/\/    make tutorial_lesson_11_cross_compilation\n\/\/ in a shell with the current directory at the top of the halide\n\/\/ source tree.\n\n#include \"Halide.h\"\n#include <stdio.h>\nusing namespace Halide;\n\nint main(int argc, char **argv) {\n\n    \/\/ We'll define the simple one-stage pipeline that we used in lesson 10.\n    Func brighter;\n    Var x, y;\n\n    \/\/ Declare the arguments.\n    Param<uint8_t> offset;\n    ImageParam input(type_of<uint8_t>(), 2);\n    std::vector<Argument> args(2);\n    args[0] = input;\n    args[1] = offset;\n\n    \/\/ Define the Func.\n    brighter(x, y) = input(x, y) + offset;\n\n    \/\/ Schedule it.\n    brighter.vectorize(x, 16).parallel(y);\n\n    \/\/ The following line is what we did in lesson 10. It compiles an\n    \/\/ object file suitable for the system that you're running this\n    \/\/ program on.  For example, if you compile and run this file on\n    \/\/ 64-bit linux on an x86 cpu with sse4.1, then the generated code\n    \/\/ will be suitable for 64-bit linux on x86 with sse4.1.\n    brighter.compile_to_file(\"lesson_11_host\", args, \"lesson_11_host\");\n\n    \/\/ We can also compile object files suitable for other cpus and\n    \/\/ operating systems. You do this with an optional third argument\n    \/\/ to compile_to_file which specifies the target to compile for.\n\n    \/\/ Let's use this to compile a 32-bit arm android version of this code:\n    Target target;\n    target.os = Target::Android; \/\/ The operating system\n    target.arch = Target::ARM;   \/\/ The CPU architecture\n    target.bits = 32;            \/\/ The bit-width of the architecture\n    std::vector<Target::Feature> arm_features; \/\/ A list of features to set\n    target.set_features(arm_features);\n    \/\/ We then pass the target as the last argument to compile_to_file.\n    brighter.compile_to_file(\"lesson_11_arm_32_android\", args, \"lesson_11_arm_32_android\", target);\n\n    \/\/ And now a Windows object file for 64-bit x86 with AVX and SSE 4.1:\n    target.os = Target::Windows;\n    target.arch = Target::X86;\n    target.bits = 64;\n    std::vector<Target::Feature> x86_features;\n    x86_features.push_back(Target::AVX);\n    x86_features.push_back(Target::SSE41);\n    target.set_features(x86_features);\n    brighter.compile_to_file(\"lesson_11_x86_64_windows\", args, \"lesson_11_x86_64_windows\", target);\n\n    \/\/ And finally an iOS mach-o object file for one of Apple's 32-bit\n    \/\/ ARM processors - the A6. It's used in the iPhone 5. The A6 uses\n    \/\/ a slightly modified ARM architecture called ARMv7s. We specify\n    \/\/ this using the target features field.  Support for Apple's\n    \/\/ 64-bit ARM processors is very new in llvm, and still somewhat\n    \/\/ flaky.\n    target.os = Target::IOS;\n    target.arch = Target::ARM;\n    target.bits = 32;\n    std::vector<Target::Feature> armv7s_features;\n    armv7s_features.push_back(Target::ARMv7s);\n    target.set_features(armv7s_features);\n    brighter.compile_to_file(\"lesson_11_arm_32_ios\", args, \"lesson_11_arm_32_ios\", target);\n\n\n    \/\/ Now let's check these files are what they claim, by examining\n    \/\/ their first few bytes.\n\n    \/\/ 32-arm android object files start with the magic bytes:\n    uint8_t arm_32_android_magic[] = {0x7f, 'E', 'L', 'F', \/\/ ELF format\n                                      1,       \/\/ 32-bit\n                                      1,       \/\/ 2's complement little-endian\n                                      1};      \/\/ Current version of elf\n\n    FILE *f = fopen(\"lesson_11_arm_32_android.o\", \"rb\");\n    uint8_t header[32];\n    if (!f || fread(header, 32, 1, f) != 1) {\n        printf(\"Object file not generated\\n\");\n        return -1;\n    }\n    fclose(f);\n\n    if (memcmp(header, arm_32_android_magic, sizeof(arm_32_android_magic))) {\n        printf(\"Unexpected header bytes in 32-bit arm object file.\\n\");\n        return -1;\n    }\n\n    \/\/ 64-bit windows object files start with the magic 16-bit value 0x8664\n    \/\/ (presumably referring to x86-64)\n    uint8_t win_64_magic[] = {0x64, 0x86};\n\n    f = fopen(\"lesson_11_x86_64_windows.obj\", \"rb\");\n    if (!f || fread(header, 32, 1, f) != 1) {\n        printf(\"Object file not generated\\n\");\n        return -1;\n    }\n    fclose(f);\n\n    if (memcmp(header, win_64_magic, sizeof(win_64_magic))) {\n        printf(\"Unexpected header bytes in 64-bit windows object file.\\n\");\n        return -1;\n    }\n\n    \/\/ 32-bit arm iOS mach-o files start with the following magic bytes:\n    uint32_t arm_32_ios_magic[] = {0xfeedface, \/\/ Mach-o magic bytes\n                                   12,  \/\/ CPU type is ARM\n                                   11,  \/\/ CPU subtype is ARMv7s\n                                   1};  \/\/ It's a relocatable object file.\n    f = fopen(\"lesson_11_arm_32_ios.o\", \"rb\");\n    if (!f || fread(header, 32, 1, f) != 1) {\n        printf(\"Object file not generated\\n\");\n        return -1;\n    }\n    fclose(f);\n\n    if (memcmp(header, arm_32_ios_magic, sizeof(arm_32_ios_magic))) {\n        printf(\"Unexpected header bytes in 32-bit arm ios object file.\\n\");\n        return -1;\n    }\n\n    \/\/ It looks like the object files we produced are plausible for\n    \/\/ those targets. We'll count that as a success for the purposes\n    \/\/ of this tutorial. For a real application you'd then need to\n    \/\/ figure out how to integrate Halide into your cross-compilation\n    \/\/ toolchain. There are several small examples of this in the\n    \/\/ Halide repository under the apps folder. See HelloAndroid and\n    \/\/ HelloiOS here:\n    \/\/ https:\/\/github.com\/halide\/Halide\/tree\/master\/apps\/\n    printf(\"Success!\\n\");\n    return 0;\n}\n<commit_msg>Update compile_to_file() usage in lesson 11<commit_after>\/\/ Halide tutorial lesson 11: Cross-compilation\n\n\/\/ This lesson demonstrates how to use Halide as a cross-compiler to\n\/\/ generate code for any platform from any platform.\n\n\/\/ On linux, you can compile and run it like so:\n\/\/ g++ lesson_11*.cpp -g -std=c++11 -I ..\/include -L ..\/bin -lHalide -lpthread -ldl -o lesson_11\n\/\/ LD_LIBRARY_PATH=..\/bin .\/lesson_11\n\n\/\/ On os x:\n\/\/ g++ lesson_11*.cpp -g -std=c++11 -I ..\/include -L ..\/bin -lHalide -o lesson_11\n\/\/ DYLD_LIBRARY_PATH=..\/bin .\/lesson_11\n\n\/\/ If you have the entire Halide source tree, you can also build it by\n\/\/ running:\n\/\/    make tutorial_lesson_11_cross_compilation\n\/\/ in a shell with the current directory at the top of the halide\n\/\/ source tree.\n\n#include \"Halide.h\"\n#include <stdio.h>\nusing namespace Halide;\n\nint main(int argc, char **argv) {\n\n    \/\/ We'll define the simple one-stage pipeline that we used in lesson 10.\n    Func brighter;\n    Var x, y;\n\n    \/\/ Declare the arguments.\n    Param<uint8_t> offset;\n    ImageParam input(type_of<uint8_t>(), 2);\n    std::vector<Argument> args(2);\n    args[0] = input;\n    args[1] = offset;\n\n    \/\/ Define the Func.\n    brighter(x, y) = input(x, y) + offset;\n\n    \/\/ Schedule it.\n    brighter.vectorize(x, 16).parallel(y);\n\n    \/\/ The following line is what we did in lesson 10. It compiles an\n    \/\/ object file suitable for the system that you're running this\n    \/\/ program on.  For example, if you compile and run this file on\n    \/\/ 64-bit linux on an x86 cpu with sse4.1, then the generated code\n    \/\/ will be suitable for 64-bit linux on x86 with sse4.1.\n    brighter.compile_to_file(\"lesson_11_host\", args, \"brighter\");\n\n    \/\/ We can also compile object files suitable for other cpus and\n    \/\/ operating systems. You do this with an optional third argument\n    \/\/ to compile_to_file which specifies the target to compile for.\n\n    \/\/ Let's use this to compile a 32-bit arm android version of this code:\n    Target target;\n    target.os = Target::Android; \/\/ The operating system\n    target.arch = Target::ARM;   \/\/ The CPU architecture\n    target.bits = 32;            \/\/ The bit-width of the architecture\n    std::vector<Target::Feature> arm_features; \/\/ A list of features to set\n    target.set_features(arm_features);\n    \/\/ We then pass the target as the last argument to compile_to_file.\n    brighter.compile_to_file(\"lesson_11_arm_32_android\", args, \"brighter\", target);\n\n    \/\/ And now a Windows object file for 64-bit x86 with AVX and SSE 4.1:\n    target.os = Target::Windows;\n    target.arch = Target::X86;\n    target.bits = 64;\n    std::vector<Target::Feature> x86_features;\n    x86_features.push_back(Target::AVX);\n    x86_features.push_back(Target::SSE41);\n    target.set_features(x86_features);\n    brighter.compile_to_file(\"lesson_11_x86_64_windows\", args, \"brighter\", target);\n\n    \/\/ And finally an iOS mach-o object file for one of Apple's 32-bit\n    \/\/ ARM processors - the A6. It's used in the iPhone 5. The A6 uses\n    \/\/ a slightly modified ARM architecture called ARMv7s. We specify\n    \/\/ this using the target features field.  Support for Apple's\n    \/\/ 64-bit ARM processors is very new in llvm, and still somewhat\n    \/\/ flaky.\n    target.os = Target::IOS;\n    target.arch = Target::ARM;\n    target.bits = 32;\n    std::vector<Target::Feature> armv7s_features;\n    armv7s_features.push_back(Target::ARMv7s);\n    target.set_features(armv7s_features);\n    brighter.compile_to_file(\"lesson_11_arm_32_ios\", args, \"brighter\", target);\n\n\n    \/\/ Now let's check these files are what they claim, by examining\n    \/\/ their first few bytes.\n\n    \/\/ 32-arm android object files start with the magic bytes:\n    uint8_t arm_32_android_magic[] = {0x7f, 'E', 'L', 'F', \/\/ ELF format\n                                      1,       \/\/ 32-bit\n                                      1,       \/\/ 2's complement little-endian\n                                      1};      \/\/ Current version of elf\n\n    FILE *f = fopen(\"lesson_11_arm_32_android.o\", \"rb\");\n    uint8_t header[32];\n    if (!f || fread(header, 32, 1, f) != 1) {\n        printf(\"Object file not generated\\n\");\n        return -1;\n    }\n    fclose(f);\n\n    if (memcmp(header, arm_32_android_magic, sizeof(arm_32_android_magic))) {\n        printf(\"Unexpected header bytes in 32-bit arm object file.\\n\");\n        return -1;\n    }\n\n    \/\/ 64-bit windows object files start with the magic 16-bit value 0x8664\n    \/\/ (presumably referring to x86-64)\n    uint8_t win_64_magic[] = {0x64, 0x86};\n\n    f = fopen(\"lesson_11_x86_64_windows.obj\", \"rb\");\n    if (!f || fread(header, 32, 1, f) != 1) {\n        printf(\"Object file not generated\\n\");\n        return -1;\n    }\n    fclose(f);\n\n    if (memcmp(header, win_64_magic, sizeof(win_64_magic))) {\n        printf(\"Unexpected header bytes in 64-bit windows object file.\\n\");\n        return -1;\n    }\n\n    \/\/ 32-bit arm iOS mach-o files start with the following magic bytes:\n    uint32_t arm_32_ios_magic[] = {0xfeedface, \/\/ Mach-o magic bytes\n                                   12,  \/\/ CPU type is ARM\n                                   11,  \/\/ CPU subtype is ARMv7s\n                                   1};  \/\/ It's a relocatable object file.\n    f = fopen(\"lesson_11_arm_32_ios.o\", \"rb\");\n    if (!f || fread(header, 32, 1, f) != 1) {\n        printf(\"Object file not generated\\n\");\n        return -1;\n    }\n    fclose(f);\n\n    if (memcmp(header, arm_32_ios_magic, sizeof(arm_32_ios_magic))) {\n        printf(\"Unexpected header bytes in 32-bit arm ios object file.\\n\");\n        return -1;\n    }\n\n    \/\/ It looks like the object files we produced are plausible for\n    \/\/ those targets. We'll count that as a success for the purposes\n    \/\/ of this tutorial. For a real application you'd then need to\n    \/\/ figure out how to integrate Halide into your cross-compilation\n    \/\/ toolchain. There are several small examples of this in the\n    \/\/ Halide repository under the apps folder. See HelloAndroid and\n    \/\/ HelloiOS here:\n    \/\/ https:\/\/github.com\/halide\/Halide\/tree\/master\/apps\/\n    printf(\"Success!\\n\");\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ This file is distributed under the MIT license.\n\/\/ See the LICENSE file for details.\n\n#include <limits>\n\n#include <visionaray\/math\/math.h>\n#include <visionaray\/phase_function.h>\n#include <visionaray\/random_sampler.h>\n\n#include <gtest\/gtest.h>\n\nusing namespace visionaray;\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ Test normalization property of phase functions\n\/\/\n\ntemplate <typename PF>\nvoid test_normalization(PF const& pf)\n{\n    using T = typename PF::scalar_type;\n    using Vec3 = vector<3, T>;\n\n    random_sampler<T> rs;\n\n\n    \/\/ Test normalization property of phase function\n\n    \/\/ Phase functions only depend on the angle theta\n    \/\/ between wi and wo, so we can choose an arbitrary\n    \/\/ integration plane\n\n    Vec3 wo(-1.0, 0.0, 0.0);\n    Vec3 wi( 1.0, 0.0, 0.0);\n\n    \/\/ Just to make sure..\n    EXPECT_FLOAT_EQ(dot(wo, wi), -1.0f);\n\n    T angle(0.0);\n    T deg(0.001); \/\/ integrate in deg steps\n    T d = deg * constants::degrees_to_radians<T>();\n\n    T int_(0.0);\n\n    while (angle <= T(180.0))\n    {\n        T a = angle * constants::degrees_to_radians<T>();\n\n        \/\/ Riemann integration\n        int_ += pf.tr(-wo, wi) * sin(a) * d;\n\n        wi.x = cos(a);\n        wi.y = -sin(a);\n        angle += deg;\n    }\n\n    int_ *= constants::two_pi<T>();\n\n    T diff = T(1.0) - int_;\n\n    ASSERT_TRUE(abs(diff) < T(1e-2));\n}\n\nTEST(PhaseFunction, Normalization)\n{\n    henyey_greenstein<float>  HGf;\n    henyey_greenstein<double> HGd;\n\n    for (double g = -0.9; g <= 0.9; g += 0.1)\n    {\n        HGf.g = g;\n        HGd.g = g;\n\n        test_normalization(HGf);\n        test_normalization(HGd);\n    }\n}\n<commit_msg>Unnecessary include<commit_after>\/\/ This file is distributed under the MIT license.\n\/\/ See the LICENSE file for details.\n\n#include <visionaray\/math\/math.h>\n#include <visionaray\/phase_function.h>\n#include <visionaray\/random_sampler.h>\n\n#include <gtest\/gtest.h>\n\nusing namespace visionaray;\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ Test normalization property of phase functions\n\/\/\n\ntemplate <typename PF>\nvoid test_normalization(PF const& pf)\n{\n    using T = typename PF::scalar_type;\n    using Vec3 = vector<3, T>;\n\n    random_sampler<T> rs;\n\n\n    \/\/ Test normalization property of phase function\n\n    \/\/ Phase functions only depend on the angle theta\n    \/\/ between wi and wo, so we can choose an arbitrary\n    \/\/ integration plane\n\n    Vec3 wo(-1.0, 0.0, 0.0);\n    Vec3 wi( 1.0, 0.0, 0.0);\n\n    \/\/ Just to make sure..\n    EXPECT_FLOAT_EQ(dot(wo, wi), -1.0f);\n\n    T angle(0.0);\n    T deg(0.001); \/\/ integrate in deg steps\n    T d = deg * constants::degrees_to_radians<T>();\n\n    T int_(0.0);\n\n    while (angle <= T(180.0))\n    {\n        T a = angle * constants::degrees_to_radians<T>();\n\n        \/\/ Riemann integration\n        int_ += pf.tr(-wo, wi) * sin(a) * d;\n\n        wi.x = cos(a);\n        wi.y = -sin(a);\n        angle += deg;\n    }\n\n    int_ *= constants::two_pi<T>();\n\n    T diff = T(1.0) - int_;\n\n    ASSERT_TRUE(abs(diff) < T(1e-2));\n}\n\nTEST(PhaseFunction, Normalization)\n{\n    henyey_greenstein<float>  HGf;\n    henyey_greenstein<double> HGd;\n\n    for (double g = -0.9; g <= 0.9; g += 0.1)\n    {\n        HGf.g = g;\n        HGd.g = g;\n\n        test_normalization(HGf);\n        test_normalization(HGd);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>user defined fields should fill next available component field slot<commit_after><|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include<stdlib.h>\n#include<fstream>\n#include \"mainProgramInterface.h\"\n#include \"derivedChainStack.h\"\n#include \"derivedChainQueue.h\"\n \nusing namespace std; \n\nbool mainProgramInterface :: checkPalindrome(long theNumber)\n{\n\n\tlong n = theNumber;\n\tderivedChainStack* newStack = new derivedChainStack();\n\n\t\/\/ Add each digit to the stack\n\tdo {\n\t\tint digit = n % 10;\n\t\tnewStack->push(digit);\n\t\tn \/= 10;\n\t} while (n > 0);\n\n\t\/\/ reassemble into new number\n\tlong m = 0;\n\n\twhile (!newStack->empty()) {\n\t\tint newN = *(newStack->top());\n\t\tnewStack->pop();\n\t\tm = (m * 10) + newN;\n\t}\n\n\treturn (theNumber == m) ? true : false;\n\n} \n\nbool mainProgramInterface :: validSequence(int *theSequence, int n)\n{\n\t\/*\n\tderivedChainStack* newStack = new derivedChainStack();\n\tbool valid = false;\n\tbool quit = false;\n\tint i = 0;\n\n\twhile (!quit && i <= n) {\n\t\t\/\/ put 5s in stack\n\t\tif (theSequence[i] == 5) {\n\t\t\tnewStack->push(theSequence[i]);\n\t\t\ti++;\n\t\t}\n\t\t\/\/ check for change of 5 if 10 encountered\n\t\telse if (theSequence[i] == 10) {\n\t\t\t\/\/ index of 5\n\t\t\tint index = newStack->indexOf(5);\n\n\t\t\t\/\/ insert 10, remove 5\n\t\t\tif (index > -1) {\n\t\t\t\tnewStack->push(theSequence[i]);\n\t\t\t\tnewStack->erase(index);\n\t\t\t\ti++;\n\t\t\t}\n\t\t\t\/\/ no 5s, return false\n\t\t\telse quit = true;\n\t\t}\n\t\t\/\/ not a 5 or 10\n\t\telse quit = true;\n\t}\n\n\treturn valid;*\/\n\treturn false;\n}\n\nvoid mainProgramInterface :: duplicateStack(derivedChainStack* source, derivedChainStack* dest)\n{\n\n\tderivedChainStack* tempStack = source;\n\n\twhile (!tempStack->empty()) {\n\t\tint* newN = tempStack->top();\n\t\ttempStack->pop();\n\t\tdest->push(*newN);\n\t}\n\t\n}\n\nint mainProgramInterface :: lastCutomer(int m, int n)\n{\n\t\/\/Write your code here. Returns the index of the last customer within m customers. \n\n\t\/\/ number of customers m\n\t\/\/ number of customers sent to end n\n\n\tderivedChainQueue* line = new derivedChainQueue(m);\n\tfor (int i = 1; i <= m; i++) {\n\t\tline->push(i);\n\t}\n\n\twhile (line->size() != 1) {\n\t\tfor (int i = 1; i <= n; i++) {\n\t\t\tline->push(*(line->front()));\n\t\t\tline->pop();\n\t\t}\n\t}\n\n\treturn *(line->front());\n}\n\nvoid mainProgramInterface :: call_Palindrome()\n{\n\n\tcout << endl<<endl<<\"Check for Palindrome \"<<endl<<endl;\n\tifstream myfile;\n\tlong num;\n\tmyfile.open(file1);\n\tfor(int i=0;i<4;i++)\n\t{\n\t\tmyfile >> num;\n\t\tif(checkPalindrome(num))\n\t\t\tcout<< \"The number \" << num << \" is a Palindrome number\" << endl;\n\t\telse\n\t\t\tcout<< \"The number \" << num << \" is not a Palindrome number\" << endl;\n\t\n\t\n\t}\n\t\n\tmyfile.close();\n\n}\nvoid mainProgramInterface :: call_validSequence()\n{\n\n\tcout << endl<<endl<<\"Check for Valid Sequence \"<<endl<<endl;\n\tifstream myfile;\n\tint *sequence;\n\tint length;\n\tmyfile.open(file2);\n\tfor(int i=0;i<4;i++)\n\t{\n\t\tmyfile >> length;\n\t\tsequence = new int[length];\n\t\tfor(int i=0;i<length;i++)\n\t\t\tmyfile >> sequence[i];\n\t\tcout << endl << \"The Sequence is : \" << endl;\n\t\tfor(int i = 0; i < length; i++)\n\t\t\tcout << sequence[i] << \" \";\n\t\tcout << endl;\n\n\t\tif(validSequence(sequence, length))\n\t\t\tcout<< \"The Sequence is a valid sequence\" << endl;\n\t\telse\n\t\t\tcout<< \"The Sequence is not a valid sequence\" << endl;\n\t\n\t\tdelete sequence;\n\t\n\t}\n\t\n\tmyfile.close();\n\n\n\n\n}\n\nvoid mainProgramInterface :: call_dupStack()\n{\n\n\tcout << endl<<endl<<\"Output for Stack Duplicate \"<<endl<<endl;\n\tifstream myfile;\n\tint length;\n\tint temp;\n\tmyfile.open(file3);\n\tderivedChainStack *myStack, *myStack1;\n\tfor(int i=0;i<3;i++)\n\t{\n\t\tmyfile >> length;\n\t\tmyStack = new derivedChainStack(length);\n\t\tmyStack1 = new derivedChainStack(length);\n\t\tfor(int i=0;i<length;i++)\n\t\t{\n\t\t\tmyfile >> temp;\n\t\t\tmyStack->push(temp);\n\t\t}\n\t\t\n\t\t\n\t\tduplicateStack(myStack, myStack1);\n\t\tcout<<\"The source stack is : \";\n\t\t\n\t\tmyStack->printStack();\n\t\t\n\t\tcout<<\"The copied stack is : \";\n\t\t\n\t\tmyStack1->printStack();\n\t\t\n\n\t\tmyStack->~derivedChainStack();\n\t\tmyStack1->~derivedChainStack();\n\t\n\t}\n\t\n\tmyfile.close();\n\n}\nvoid mainProgramInterface :: call_lastCustomer()\n{\n\t\n\tcout << endl<<endl<<\"Output for Last Customer program \"<<endl<<endl;\n\tcout << \"The last customer with lastCutomer(12, 5) is \" << lastCutomer(12, 5) << endl;\n\tcout << \"The last customer with lastCutomer(10, 6) is \" << lastCutomer(10, 6) << endl;\n\tcout << \"The last customer with lastCutomer(10, 3) is \" << lastCutomer(10, 3) << endl;\n\tcout<<endl<<endl;\n\n}\n<commit_msg>Acually now it works :p<commit_after>#include <iostream>\n#include<stdlib.h>\n#include<fstream>\n#include \"mainProgramInterface.h\"\n#include \"derivedChainStack.h\"\n#include \"derivedChainQueue.h\"\n \nusing namespace std; \n\nbool mainProgramInterface :: checkPalindrome(long theNumber)\n{\n\n\tlong n = theNumber;\n\tderivedChainQueue* newQueue = new derivedChainQueue();\n\n\t\/\/ Add each digit to the stack\n\tdo {\n\t\tint digit = n % 10;\n\t\tnewQueue->push(digit);\n\t\tn \/= 10;\n\t} while (n > 0);\n\n\t\/\/ reassemble into new number\n\tlong m = 0;\n\n\twhile (!newQueue->empty()) {\n\t\tint newN = *(newQueue->front());\n\t\tnewQueue->pop();\n\t\tm = (m * 10) + newN;\n\t}\n\n\treturn (theNumber == m) ? true : false;\n\n} \n\nbool mainProgramInterface :: validSequence(int *theSequence, int n)\n{\n\t\/*\n\tderivedChainStack* newStack = new derivedChainStack();\n\tbool valid = false;\n\tbool quit = false;\n\tint i = 0;\n\n\twhile (!quit && i <= n) {\n\t\t\/\/ put 5s in stack\n\t\tif (theSequence[i] == 5) {\n\t\t\tnewStack->push(theSequence[i]);\n\t\t\ti++;\n\t\t}\n\t\t\/\/ check for change of 5 if 10 encountered\n\t\telse if (theSequence[i] == 10) {\n\t\t\t\/\/ index of 5\n\t\t\tint index = newStack->indexOf(5);\n\n\t\t\t\/\/ insert 10, remove 5\n\t\t\tif (index > -1) {\n\t\t\t\tnewStack->push(theSequence[i]);\n\t\t\t\tnewStack->erase(index);\n\t\t\t\ti++;\n\t\t\t}\n\t\t\t\/\/ no 5s, return false\n\t\t\telse quit = true;\n\t\t}\n\t\t\/\/ not a 5 or 10\n\t\telse quit = true;\n\t}\n\n\treturn valid;*\/\n\treturn false;\n}\n\nvoid mainProgramInterface :: duplicateStack(derivedChainStack* source, derivedChainStack* dest)\n{\n\n\tderivedChainStack* tempStack = source;\n\n\twhile (!tempStack->empty()) {\n\t\tint* newN = tempStack->top();\n\t\ttempStack->pop();\n\t\tdest->push(*newN);\n\t}\n\t\n}\n\nint mainProgramInterface :: lastCutomer(int m, int n)\n{\n\t\/\/Write your code here. Returns the index of the last customer within m customers. \n\n\t\/\/ number of customers m\n\t\/\/ number of customers sent to end n\n\n\tderivedChainQueue* line = new derivedChainQueue(m);\n\tfor (int i = 1; i <= m; i++) {\n\t\tline->push(i);\n\t}\n\n\twhile (line->size() != 1) {\n\t\tfor (int i = 1; i <= n; i++) {\n\t\t\tline->push(*(line->front()));\n\t\t\tline->pop();\n\t\t}\n\t}\n\n\treturn *(line->front());\n}\n\nvoid mainProgramInterface :: call_Palindrome()\n{\n\n\tcout << endl<<endl<<\"Check for Palindrome \"<<endl<<endl;\n\tifstream myfile;\n\tlong num;\n\tmyfile.open(file1);\n\tfor(int i=0;i<4;i++)\n\t{\n\t\tmyfile >> num;\n\t\tif(checkPalindrome(num))\n\t\t\tcout<< \"The number \" << num << \" is a Palindrome number\" << endl;\n\t\telse\n\t\t\tcout<< \"The number \" << num << \" is not a Palindrome number\" << endl;\n\t\n\t\n\t}\n\t\n\tmyfile.close();\n\n}\nvoid mainProgramInterface :: call_validSequence()\n{\n\n\tcout << endl<<endl<<\"Check for Valid Sequence \"<<endl<<endl;\n\tifstream myfile;\n\tint *sequence;\n\tint length;\n\tmyfile.open(file2);\n\tfor(int i=0;i<4;i++)\n\t{\n\t\tmyfile >> length;\n\t\tsequence = new int[length];\n\t\tfor(int i=0;i<length;i++)\n\t\t\tmyfile >> sequence[i];\n\t\tcout << endl << \"The Sequence is : \" << endl;\n\t\tfor(int i = 0; i < length; i++)\n\t\t\tcout << sequence[i] << \" \";\n\t\tcout << endl;\n\n\t\tif(validSequence(sequence, length))\n\t\t\tcout<< \"The Sequence is a valid sequence\" << endl;\n\t\telse\n\t\t\tcout<< \"The Sequence is not a valid sequence\" << endl;\n\t\n\t\tdelete sequence;\n\t\n\t}\n\t\n\tmyfile.close();\n\n\n\n\n}\n\nvoid mainProgramInterface :: call_dupStack()\n{\n\n\tcout << endl<<endl<<\"Output for Stack Duplicate \"<<endl<<endl;\n\tifstream myfile;\n\tint length;\n\tint temp;\n\tmyfile.open(file3);\n\tderivedChainStack *myStack, *myStack1;\n\tfor(int i=0;i<3;i++)\n\t{\n\t\tmyfile >> length;\n\t\tmyStack = new derivedChainStack(length);\n\t\tmyStack1 = new derivedChainStack(length);\n\t\tfor(int i=0;i<length;i++)\n\t\t{\n\t\t\tmyfile >> temp;\n\t\t\tmyStack->push(temp);\n\t\t}\n\t\t\n\t\t\n\t\tduplicateStack(myStack, myStack1);\n\t\tcout<<\"The source stack is : \";\n\t\t\n\t\tmyStack->printStack();\n\t\t\n\t\tcout<<\"The copied stack is : \";\n\t\t\n\t\tmyStack1->printStack();\n\t\t\n\n\t\tmyStack->~derivedChainStack();\n\t\tmyStack1->~derivedChainStack();\n\t\n\t}\n\t\n\tmyfile.close();\n\n}\nvoid mainProgramInterface :: call_lastCustomer()\n{\n\t\n\tcout << endl<<endl<<\"Output for Last Customer program \"<<endl<<endl;\n\tcout << \"The last customer with lastCutomer(12, 5) is \" << lastCutomer(12, 5) << endl;\n\tcout << \"The last customer with lastCutomer(10, 6) is \" << lastCutomer(10, 6) << endl;\n\tcout << \"The last customer with lastCutomer(10, 3) is \" << lastCutomer(10, 3) << endl;\n\tcout<<endl<<endl;\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ LAF Base Library\n\/\/ Copyright (c) 2001-2016 David Capello\n\/\/\n\/\/ This file is released under the terms of the MIT license.\n\/\/ Read LICENSE.txt for more information.\n\n#include <gtest\/gtest.h>\n\n#include \"base\/rw_lock.h\"\n\nusing namespace base;\n\nTEST(RWLock, MultipleReaders)\n{\n  RWLock a;\n  EXPECT_TRUE(a.lock(RWLock::ReadLock, 0));\n  EXPECT_TRUE(a.lock(RWLock::ReadLock, 0));\n  EXPECT_TRUE(a.lock(RWLock::ReadLock, 0));\n  EXPECT_TRUE(a.lock(RWLock::ReadLock, 0));\n  EXPECT_FALSE(a.lock(RWLock::WriteLock, 0));\n  a.unlock();\n  a.unlock();\n  a.unlock();\n  a.unlock();\n}\n\nTEST(RWLock, OneWriter)\n{\n  RWLock a;\n\n  EXPECT_TRUE(a.lock(RWLock::WriteLock, 0));\n  EXPECT_FALSE(a.lock(RWLock::ReadLock, 0));\n  a.unlock();\n\n  EXPECT_TRUE(a.lock(RWLock::ReadLock, 0));\n  EXPECT_FALSE(a.lock(RWLock::WriteLock, 0));\n  a.unlock();\n\n  EXPECT_TRUE(a.lock(RWLock::ReadLock, 0));\n  EXPECT_TRUE(a.lock(RWLock::ReadLock, 0));\n  EXPECT_FALSE(a.lock(RWLock::WriteLock, 0));\n  a.unlock();\n  EXPECT_FALSE(a.lock(RWLock::WriteLock, 0));\n  a.unlock();\n  EXPECT_TRUE(a.lock(RWLock::WriteLock, 0));\n  EXPECT_FALSE(a.lock(RWLock::WriteLock, 0));\n  a.unlock();\n}\n\nTEST(RWLock, UpgradeToWrite)\n{\n  RWLock a;\n\n  EXPECT_TRUE(a.lock(RWLock::ReadLock, 0));\n  EXPECT_FALSE(a.lock(RWLock::WriteLock, 0));\n  EXPECT_TRUE(a.upgradeToWrite(0));\n  EXPECT_FALSE(a.lock(RWLock::ReadLock, 0));\n  EXPECT_FALSE(a.lock(RWLock::WriteLock, 0));\n  a.downgradeToRead();\n  a.unlock();\n}\n\nTEST(RWLock, WeakLock)\n{\n  RWLock a;\n  RWLock::WeakLock flag = RWLock::WeakUnlocked;\n\n  EXPECT_TRUE(a.weakLock(&flag));\n  EXPECT_EQ(RWLock::WeakLocked, flag);\n\n  \/\/ We can lock for read-only without timeout and the weak lock\n  \/\/ should stay locked.\n  EXPECT_TRUE(a.lock(RWLock::ReadLock, 0));\n  a.unlock();                   \/\/ Unlock the read-only lock\n  EXPECT_EQ(RWLock::WeakLocked, flag);\n\n  \/\/ If we want to lock for writing purposes, it should fail, but the\n  \/\/ weak lock should be released.\n  EXPECT_FALSE(a.lock(RWLock::WriteLock, 0));\n  EXPECT_EQ(RWLock::WeakUnlocking, flag);\n  a.weakUnlock();\n  EXPECT_EQ(RWLock::WeakUnlocked, flag);\n\n  EXPECT_TRUE(a.lock(RWLock::WriteLock, 0));\n  EXPECT_FALSE(a.weakLock(&flag));\n  a.unlock();                   \/\/ Unlock the write lock\n}\n\nint main(int argc, char** argv)\n{\n  ::testing::InitGoogleTest(&argc, argv);\n  return RUN_ALL_TESTS();\n}\n<commit_msg>Fix rw_lock tests<commit_after>\/\/ LAF Base Library\n\/\/ Copyright (c) 2020 Igara Studio S.A.\n\/\/ Copyright (c) 2001-2016 David Capello\n\/\/\n\/\/ This file is released under the terms of the MIT license.\n\/\/ Read LICENSE.txt for more information.\n\n#include <gtest\/gtest.h>\n\n#include \"base\/rw_lock.h\"\n\nusing namespace base;\n\nTEST(RWLock, MultipleReaders)\n{\n  RWLock a;\n  EXPECT_TRUE(a.lock(RWLock::ReadLock, 0));\n  EXPECT_TRUE(a.lock(RWLock::ReadLock, 0));\n  EXPECT_TRUE(a.lock(RWLock::ReadLock, 0));\n  EXPECT_TRUE(a.lock(RWLock::ReadLock, 0));\n  EXPECT_FALSE(a.lock(RWLock::WriteLock, 0));\n  a.unlock();\n  a.unlock();\n  a.unlock();\n  a.unlock();\n}\n\nTEST(RWLock, OneWriter)\n{\n  RWLock a;\n\n  EXPECT_TRUE(a.lock(RWLock::WriteLock, 0));\n  EXPECT_FALSE(a.lock(RWLock::ReadLock, 0));\n  a.unlock();\n\n  EXPECT_TRUE(a.lock(RWLock::ReadLock, 0));\n  EXPECT_FALSE(a.lock(RWLock::WriteLock, 0));\n  a.unlock();\n\n  EXPECT_TRUE(a.lock(RWLock::ReadLock, 0));\n  EXPECT_TRUE(a.lock(RWLock::ReadLock, 0));\n  EXPECT_FALSE(a.lock(RWLock::WriteLock, 0));\n  a.unlock();\n  EXPECT_FALSE(a.lock(RWLock::WriteLock, 0));\n  a.unlock();\n  EXPECT_TRUE(a.lock(RWLock::WriteLock, 0));\n  EXPECT_FALSE(a.lock(RWLock::WriteLock, 0));\n  a.unlock();\n}\n\nTEST(RWLock, UpgradeToWrite)\n{\n  RWLock a;\n\n  EXPECT_TRUE(a.lock(RWLock::ReadLock, 0));\n  EXPECT_FALSE(a.lock(RWLock::WriteLock, 0));\n  EXPECT_TRUE(a.upgradeToWrite(0));\n  EXPECT_FALSE(a.lock(RWLock::ReadLock, 0));\n  EXPECT_FALSE(a.lock(RWLock::WriteLock, 0));\n  a.downgradeToRead();\n  a.unlock();\n}\n\nTEST(RWLock, WeakLock)\n{\n  RWLock a;\n  std::atomic<RWLock::WeakLock> flag(RWLock::WeakUnlocked);\n\n  EXPECT_TRUE(a.weakLock(&flag));\n  EXPECT_EQ(RWLock::WeakLocked, flag);\n\n  \/\/ We can lock for read-only without timeout and the weak lock\n  \/\/ should stay locked.\n  EXPECT_TRUE(a.lock(RWLock::ReadLock, 0));\n  a.unlock();                   \/\/ Unlock the read-only lock\n  EXPECT_EQ(RWLock::WeakLocked, flag);\n\n  \/\/ If we want to lock for writing purposes, it should fail, but the\n  \/\/ weak lock should be released.\n  EXPECT_FALSE(a.lock(RWLock::WriteLock, 0));\n  EXPECT_EQ(RWLock::WeakUnlocking, flag);\n  a.weakUnlock();\n  EXPECT_EQ(RWLock::WeakUnlocked, flag);\n\n  EXPECT_TRUE(a.lock(RWLock::WriteLock, 0));\n  EXPECT_FALSE(a.weakLock(&flag));\n  a.unlock();                   \/\/ Unlock the write lock\n}\n\nint main(int argc, char** argv)\n{\n  ::testing::InitGoogleTest(&argc, argv);\n  return RUN_ALL_TESTS();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ 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\/browser_accessibility_manager.h\"\n\n#include \"chrome\/browser\/browser_accessibility.h\"\n#include \"chrome\/browser\/render_process_host.h\"\n#include \"chrome\/browser\/render_widget_host.h\"\n\n\/\/ The time in ms after which we give up and return an error when processing an\n\/\/ accessibility message and no response has been received from the renderer.\nstatic const int kAccessibilityMessageTimeOut = 500;\n\n\/\/ static\nBrowserAccessibilityManager* BrowserAccessibilityManager::GetInstance() {\n  return Singleton<BrowserAccessibilityManager>::get();\n}\n\nBrowserAccessibilityManager::BrowserAccessibilityManager()\n    : instance_id_(0) {\n  NotificationService::current()->AddObserver(this,\n      NOTIFY_RENDERER_PROCESS_TERMINATED, NotificationService::AllSources());\n}\n\nBrowserAccessibilityManager::~BrowserAccessibilityManager() {\n  \/\/ Clear hashmaps.\n  instance_map_.clear();\n  render_process_host_map_.clear();\n\n  \/\/ We don't remove ourselves as an observer because we are a Singleton object,\n  \/\/ and NotifcationService is likely gone by this point.\n}\n\nSTDMETHODIMP BrowserAccessibilityManager::CreateAccessibilityInstance(\n    REFIID iid, int iaccessible_id, int instance_id, void** interface_ptr) {\n  if (IID_IUnknown == iid || IID_IDispatch == iid || IID_IAccessible == iid) {\n    CComObject<BrowserAccessibility>* instance = NULL;\n\n    HRESULT hr = CComObject<BrowserAccessibility>::CreateInstance(&instance);\n    DCHECK(SUCCEEDED(hr));\n\n    if (!instance)\n      return E_FAIL;\n\n    CComPtr<IAccessible> accessibility_instance(instance);\n\n    \/\/ Set unique ids.\n    instance->set_iaccessible_id(iaccessible_id);\n    instance->set_instance_id(instance_id);\n\n    \/\/ Retrieve the RenderWidgetHost connected to this request.\n    InstanceMap::iterator it = instance_map_.find(instance_id);\n\n    if (it != instance_map_.end()) {\n      UniqueMembers* members = it->second;\n\n      if (!members || !members->render_widget_host_)\n        return E_FAIL;\n\n      render_process_host_map_[members->render_widget_host_->process()] =\n          instance;\n    } else {\n      \/\/ No RenderProcess active for this instance.\n      return E_FAIL;\n    }\n\n    \/\/ All is well, assign the temp instance to the output pointer.\n    *interface_ptr = accessibility_instance.Detach();\n    return S_OK;\n  }\n  \/\/ No supported interface found, return error.\n  *interface_ptr = NULL;\n  return E_NOINTERFACE;\n}\n\nbool BrowserAccessibilityManager::RequestAccessibilityInfo(\n    int iaccessible_id, int instance_id, int iaccessible_func_id,\n    VARIANT var_id, LONG input1, LONG input2) {\n  \/\/ Create and populate input message structure.\n  ViewMsg_Accessibility_In_Params in_params;\n\n  in_params.iaccessible_id = iaccessible_id;\n  in_params.iaccessible_function_id = iaccessible_func_id;\n  in_params.input_variant_lval = var_id.lVal;\n  in_params.input_long1 = input1;\n  in_params.input_long2 = input2;\n\n  \/\/ Retrieve the RenderWidgetHost connected to this request.\n  InstanceMap::iterator it = instance_map_.find(instance_id);\n\n  if (it == instance_map_.end()) {\n    \/\/ Id not found.\n    return false;\n  }\n\n  UniqueMembers* members = it->second;\n\n  if (!members || !members->render_widget_host_)\n    return false;\n\n  bool success = false;\n  if (members->render_widget_host_->process() &&\n      members->render_widget_host_->process()->channel()) {\n    IPC::SyncMessage* msg =\n        new ViewMsg_GetAccessibilityInfo(members->render_widget_host_->\n            routing_id(), in_params, &out_params_);\n    \/\/ Necessary for the send to keep the UI responsive.\n    msg->EnableMessagePumping();\n    \/\/ By default sync calls are unblocking, i.e if the receiver is an outgoing\n    \/\/ sync call, it will process received sync calls. Webkit is not reentrant.\n    \/\/ We don't want to reenter Webkit if it is in an outgoing sync call.\n    msg->set_unblock(false);\n    success = members->render_widget_host_->process()->channel()->\n        SendWithTimeout(msg, kAccessibilityMessageTimeOut);\n  }\n\n  return success;\n}\n\nViewHostMsg_Accessibility_Out_Params BrowserAccessibilityManager::response() {\n  return out_params_;\n}\n\nHWND BrowserAccessibilityManager::parent_hwnd(int id) {\n  \/\/ Retrieve the parent HWND connected to the requester's id.\n  InstanceMap::iterator it = instance_map_.find(id);\n\n  if (it == instance_map_.end()) {\n    \/\/ Id not found.\n    return NULL;\n  }\n\n  UniqueMembers* members = it->second;\n\n  if (!members || !members->parent_hwnd_)\n    return NULL;\n\n  return members->parent_hwnd_;\n}\n\nint BrowserAccessibilityManager::SetMembers(BrowserAccessibility* browser_acc,\n    HWND parent_hwnd, RenderWidgetHost* render_widget_host) {\n  \/\/ Set HWND and RenderWidgetHost connected to |browser_acc|.\n  instance_map_[instance_id_] =\n      new UniqueMembers(parent_hwnd, render_widget_host);\n\n  render_process_host_map_[render_widget_host->process()] = browser_acc;\n  return instance_id_++;\n}\n\nvoid BrowserAccessibilityManager::Observe(NotificationType type,\n                                          const NotificationSource& source,\n                                          const NotificationDetails& details) {\n  DCHECK(type == NOTIFY_RENDERER_PROCESS_TERMINATED);\n  RenderProcessHost* rph = Source<RenderProcessHost>(source).ptr();\n  DCHECK(rph);\n  RenderProcessHostMap::iterator it = render_process_host_map_.find(rph);\n\n  if (it == render_process_host_map_.end() || !it->second) {\n    \/\/ RenderProcessHost not associated with any BrowserAccessibility instance.\n    return;\n  }\n\n  \/\/ Set BrowserAccessibility instance to inactive state.\n  it->second->set_instance_active(false);\n\n  \/\/ Delete entry also from InstanceMap.\n  InstanceMap::iterator it2 = instance_map_.find(it->second->instance_id());\n\n  if (it2 != instance_map_.end())\n    instance_map_.erase(it2);\n\n  \/\/ Only delete the first entry once it is no longer in use.\n  render_process_host_map_.erase(it);\n}\n<commit_msg>Reverting 5927 as John has a better fix for this issue. was as below:-<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\/browser_accessibility_manager.h\"\n\n#include \"chrome\/browser\/browser_accessibility.h\"\n#include \"chrome\/browser\/render_process_host.h\"\n#include \"chrome\/browser\/render_widget_host.h\"\n\n\/\/ The time in ms after which we give up and return an error when processing an\n\/\/ accessibility message and no response has been received from the renderer.\nstatic const int kAccessibilityMessageTimeOut = 500;\n\n\/\/ static\nBrowserAccessibilityManager* BrowserAccessibilityManager::GetInstance() {\n  return Singleton<BrowserAccessibilityManager>::get();\n}\n\nBrowserAccessibilityManager::BrowserAccessibilityManager()\n    : instance_id_(0) {\n  NotificationService::current()->AddObserver(this,\n      NOTIFY_RENDERER_PROCESS_TERMINATED, NotificationService::AllSources());\n}\n\nBrowserAccessibilityManager::~BrowserAccessibilityManager() {\n  \/\/ Clear hashmaps.\n  instance_map_.clear();\n  render_process_host_map_.clear();\n\n  \/\/ We don't remove ourselves as an observer because we are a Singleton object,\n  \/\/ and NotifcationService is likely gone by this point.\n}\n\nSTDMETHODIMP BrowserAccessibilityManager::CreateAccessibilityInstance(\n    REFIID iid, int iaccessible_id, int instance_id, void** interface_ptr) {\n  if (IID_IUnknown == iid || IID_IDispatch == iid || IID_IAccessible == iid) {\n    CComObject<BrowserAccessibility>* instance = NULL;\n\n    HRESULT hr = CComObject<BrowserAccessibility>::CreateInstance(&instance);\n    DCHECK(SUCCEEDED(hr));\n\n    if (!instance)\n      return E_FAIL;\n\n    CComPtr<IAccessible> accessibility_instance(instance);\n\n    \/\/ Set unique ids.\n    instance->set_iaccessible_id(iaccessible_id);\n    instance->set_instance_id(instance_id);\n\n    \/\/ Retrieve the RenderWidgetHost connected to this request.\n    InstanceMap::iterator it = instance_map_.find(instance_id);\n\n    if (it != instance_map_.end()) {\n      UniqueMembers* members = it->second;\n\n      if (!members || !members->render_widget_host_)\n        return E_FAIL;\n\n      render_process_host_map_[members->render_widget_host_->process()] =\n          instance;\n    } else {\n      \/\/ No RenderProcess active for this instance.\n      return E_FAIL;\n    }\n\n    \/\/ All is well, assign the temp instance to the output pointer.\n    *interface_ptr = accessibility_instance.Detach();\n    return S_OK;\n  }\n  \/\/ No supported interface found, return error.\n  *interface_ptr = NULL;\n  return E_NOINTERFACE;\n}\n\nbool BrowserAccessibilityManager::RequestAccessibilityInfo(\n    int iaccessible_id, int instance_id, int iaccessible_func_id,\n    VARIANT var_id, LONG input1, LONG input2) {\n  \/\/ Create and populate input message structure.\n  ViewMsg_Accessibility_In_Params in_params;\n\n  in_params.iaccessible_id = iaccessible_id;\n  in_params.iaccessible_function_id = iaccessible_func_id;\n  in_params.input_variant_lval = var_id.lVal;\n  in_params.input_long1 = input1;\n  in_params.input_long2 = input2;\n\n  \/\/ Retrieve the RenderWidgetHost connected to this request.\n  InstanceMap::iterator it = instance_map_.find(instance_id);\n\n  if (it == instance_map_.end()) {\n    \/\/ Id not found.\n    return false;\n  }\n\n  UniqueMembers* members = it->second;\n\n  if (!members || !members->render_widget_host_)\n    return false;\n\n  bool success = false;\n  if (members->render_widget_host_->process() &&\n      members->render_widget_host_->process()->channel()) {\n    IPC::SyncMessage* msg =\n        new ViewMsg_GetAccessibilityInfo(members->render_widget_host_->\n            routing_id(), in_params, &out_params_);\n    \/\/ Necessary for the send to keep the UI responsive.\n    msg->EnableMessagePumping();\n    success = members->render_widget_host_->process()->channel()->\n        SendWithTimeout(msg, kAccessibilityMessageTimeOut);\n  }\n\n  return success;\n}\n\nViewHostMsg_Accessibility_Out_Params BrowserAccessibilityManager::response() {\n  return out_params_;\n}\n\nHWND BrowserAccessibilityManager::parent_hwnd(int id) {\n  \/\/ Retrieve the parent HWND connected to the requester's id.\n  InstanceMap::iterator it = instance_map_.find(id);\n\n  if (it == instance_map_.end()) {\n    \/\/ Id not found.\n    return NULL;\n  }\n\n  UniqueMembers* members = it->second;\n\n  if (!members || !members->parent_hwnd_)\n    return NULL;\n\n  return members->parent_hwnd_;\n}\n\nint BrowserAccessibilityManager::SetMembers(BrowserAccessibility* browser_acc,\n    HWND parent_hwnd, RenderWidgetHost* render_widget_host) {\n  \/\/ Set HWND and RenderWidgetHost connected to |browser_acc|.\n  instance_map_[instance_id_] =\n      new UniqueMembers(parent_hwnd, render_widget_host);\n\n  render_process_host_map_[render_widget_host->process()] = browser_acc;\n  return instance_id_++;\n}\n\nvoid BrowserAccessibilityManager::Observe(NotificationType type,\n                                          const NotificationSource& source,\n                                          const NotificationDetails& details) {\n  DCHECK(type == NOTIFY_RENDERER_PROCESS_TERMINATED);\n  RenderProcessHost* rph = Source<RenderProcessHost>(source).ptr();\n  DCHECK(rph);\n  RenderProcessHostMap::iterator it = render_process_host_map_.find(rph);\n\n  if (it == render_process_host_map_.end() || !it->second) {\n    \/\/ RenderProcessHost not associated with any BrowserAccessibility instance.\n    return;\n  }\n\n  \/\/ Set BrowserAccessibility instance to inactive state.\n  it->second->set_instance_active(false);\n\n  \/\/ Delete entry also from InstanceMap.\n  InstanceMap::iterator it2 = instance_map_.find(it->second->instance_id());\n\n  if (it2 != instance_map_.end())\n    instance_map_.erase(it2);\n\n  \/\/ Only delete the first entry once it is no longer in use.\n  render_process_host_map_.erase(it);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2011-2015, Georgia Tech Research Corporation\n * All rights reserved.\n *\n * Author(s): Sumit Jain <sumit@cc.gatech.edu>\n *\n * Georgia Tech Graphics Lab and Humanoid Robotics Lab\n *\n * Directed by Prof. C. Karen Liu and Prof. Mike Stilman\n * <karenliu@cc.gatech.edu> <mstilman@cc.gatech.edu>\n *\n * This file is provided under the following \"BSD-style\" License:\n *   Redistribution and use in source and binary forms, with or\n *   without modification, are permitted provided that the following\n *   conditions are met:\n *   * Redistributions of source code must retain the above copyright\n *     notice, this list of conditions and the following disclaimer.\n *   * Redistributions in binary form must reproduce the above\n *     copyright notice, this list of conditions and the following\n *     disclaimer in the documentation and\/or other materials provided\n *     with the distribution.\n *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND\n *   CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES,\n *   INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\n *   MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n *   DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR\n *   CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n *   USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n *   AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n *   LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n *   ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n *   POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"dart\/gui\/Trackball.h\"\n\n#include \"dart\/renderer\/LoadOpengl.h\"\n\nnamespace dart {\nnamespace gui {\n\nTrackball::Trackball()\n  : mCenter(0.0, 0.0),\n    mRadius(1.0),\n    mStartPos(0.0, 0.0, 0.0),\n    mCurrQuat(1.0, 0.0, 0.0, 0.0) {\n}\n\nTrackball::Trackball(const Eigen::Vector2d& _center, double _radius)\n  : mCenter(_center),\n    mRadius(_radius),\n    mStartPos(0.0, 0.0, 0.0),\n    mCurrQuat(1.0, 0.0, 0.0, 0.0) {\n}\n\nvoid Trackball::startBall(double _x, double _y) {\n  mStartPos = mouseOnSphere(_x, _y);\n}\n\nvoid Trackball::updateBall(double _x, double _y) {\n  Eigen::Vector3d toPos = mouseOnSphere(_x, _y);\n  Eigen::Quaterniond newQuat(quatFromVectors(mStartPos, toPos));\n  mStartPos = toPos;\n  mCurrQuat = newQuat*mCurrQuat;\n}\n\nvoid Trackball::applyGLRotation() {\n  Eigen::Transform<double, 3, Eigen::Affine> t(mCurrQuat);\n  glMultMatrixd(t.data());\n}\n\nvoid Trackball::draw(int _winWidth, int _winHeight) {\n  glDisable(GL_LIGHTING);\n  glDisable(GL_TEXTURE_2D);\n\n  glPushMatrix();\n\n  glMatrixMode(GL_PROJECTION);\n  glLoadIdentity();\n  glViewport(0, 0, _winWidth, _winHeight);\n  gluOrtho2D(0.0, (GLdouble)_winWidth, 0.0, (GLdouble)_winHeight);\n\n  glMatrixMode(GL_MODELVIEW);\n  glLoadIdentity();\n\n  glLineWidth(4.0);\n  glColor3f(1.0f, 1.0f, 0.0f);\n  glBegin(GL_LINE_LOOP);\n  for (int i = 0; i < 360; i += 4) {\n    double theta = i \/ 180.0 * M_PI;\n    double x = mRadius * cos(theta);\n    double y = mRadius * sin(theta);\n    glVertex2d(static_cast<GLdouble>((_winWidth >> 1) + x),\n               static_cast<GLdouble>((_winHeight >> 1) + y));\n  }\n  glEnd();\n\n  glPopMatrix();\n}\n\nvoid Trackball::setTrackball(const Eigen::Vector2d& _center,\n                             const double _radius) {\n  mCenter = _center;\n  mRadius = _radius;\n}\n\nvoid Trackball::setCenter(const Eigen::Vector2d& _center) {\n  mCenter = _center;\n}\n\nvoid Trackball::setRadius(const double _radius) {\n  mRadius = _radius;\n}\n\nvoid Trackball::setQuaternion(const Eigen::Quaterniond& _q) {\n  mCurrQuat = _q;\n}\n\nEigen::Quaterniond Trackball::getCurrQuat() const {\n  return mCurrQuat;\n}\n\nEigen::Matrix3d Trackball::getRotationMatrix() const {\n  return mCurrQuat.toRotationMatrix();\n}\n\nEigen::Vector2d Trackball::getCenter() const {\n  return mCenter;\n}\n\ndouble Trackball::getRadius() const {\n  return mRadius;\n}\n\nEigen::Vector3d Trackball::mouseOnSphere(double _mouseX, double _mouseY) const {\n  double mag;\n  Eigen::Vector3d pointOnSphere;\n\n  pointOnSphere(0) = (_mouseX - mCenter(0)) \/ mRadius;\n  pointOnSphere(1) = (_mouseY - mCenter(1)) \/ mRadius;\n\n  mag = pointOnSphere(0) * pointOnSphere(0) + pointOnSphere(1)*pointOnSphere(1);\n  if (mag > 1.0) {\n    register double scale = 1.0\/sqrt(mag);\n    pointOnSphere(0) *= scale;\n    pointOnSphere(1) *= scale;\n    pointOnSphere(2) = 0.0;\n  } else {\n    pointOnSphere(2) = sqrt(1 - mag);\n  }\n\n  return pointOnSphere;\n}\n\nEigen::Quaterniond Trackball::quatFromVectors(\n    const Eigen::Vector3d& _from, const Eigen::Vector3d& _to) const {\n  Eigen::Quaterniond quat;\n  quat.x() = _from(1)*_to(2) - _from(2)*_to(1);\n  quat.y() = _from(2)*_to(0) - _from(0)*_to(2);\n  quat.z() = _from(0)*_to(1) - _from(1)*_to(0);\n  quat.w() = _from(0)*_to(0) + _from(1)*_to(1) + _from(2)*_to(2);\n  return quat;\n}\n\n}  \/\/ namespace gui\n}  \/\/ namespace dart\n<commit_msg>Remove register keyword which is deprecated in C++11<commit_after>\/*\n * Copyright (c) 2011-2015, Georgia Tech Research Corporation\n * All rights reserved.\n *\n * Author(s): Sumit Jain <sumit@cc.gatech.edu>\n *\n * Georgia Tech Graphics Lab and Humanoid Robotics Lab\n *\n * Directed by Prof. C. Karen Liu and Prof. Mike Stilman\n * <karenliu@cc.gatech.edu> <mstilman@cc.gatech.edu>\n *\n * This file is provided under the following \"BSD-style\" License:\n *   Redistribution and use in source and binary forms, with or\n *   without modification, are permitted provided that the following\n *   conditions are met:\n *   * Redistributions of source code must retain the above copyright\n *     notice, this list of conditions and the following disclaimer.\n *   * Redistributions in binary form must reproduce the above\n *     copyright notice, this list of conditions and the following\n *     disclaimer in the documentation and\/or other materials provided\n *     with the distribution.\n *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND\n *   CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES,\n *   INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\n *   MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n *   DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR\n *   CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n *   USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n *   AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n *   LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n *   ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n *   POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"dart\/gui\/Trackball.h\"\n\n#include \"dart\/renderer\/LoadOpengl.h\"\n\nnamespace dart {\nnamespace gui {\n\nTrackball::Trackball()\n  : mCenter(0.0, 0.0),\n    mRadius(1.0),\n    mStartPos(0.0, 0.0, 0.0),\n    mCurrQuat(1.0, 0.0, 0.0, 0.0) {\n}\n\nTrackball::Trackball(const Eigen::Vector2d& _center, double _radius)\n  : mCenter(_center),\n    mRadius(_radius),\n    mStartPos(0.0, 0.0, 0.0),\n    mCurrQuat(1.0, 0.0, 0.0, 0.0) {\n}\n\nvoid Trackball::startBall(double _x, double _y) {\n  mStartPos = mouseOnSphere(_x, _y);\n}\n\nvoid Trackball::updateBall(double _x, double _y) {\n  Eigen::Vector3d toPos = mouseOnSphere(_x, _y);\n  Eigen::Quaterniond newQuat(quatFromVectors(mStartPos, toPos));\n  mStartPos = toPos;\n  mCurrQuat = newQuat*mCurrQuat;\n}\n\nvoid Trackball::applyGLRotation() {\n  Eigen::Transform<double, 3, Eigen::Affine> t(mCurrQuat);\n  glMultMatrixd(t.data());\n}\n\nvoid Trackball::draw(int _winWidth, int _winHeight) {\n  glDisable(GL_LIGHTING);\n  glDisable(GL_TEXTURE_2D);\n\n  glPushMatrix();\n\n  glMatrixMode(GL_PROJECTION);\n  glLoadIdentity();\n  glViewport(0, 0, _winWidth, _winHeight);\n  gluOrtho2D(0.0, (GLdouble)_winWidth, 0.0, (GLdouble)_winHeight);\n\n  glMatrixMode(GL_MODELVIEW);\n  glLoadIdentity();\n\n  glLineWidth(4.0);\n  glColor3f(1.0f, 1.0f, 0.0f);\n  glBegin(GL_LINE_LOOP);\n  for (int i = 0; i < 360; i += 4) {\n    double theta = i \/ 180.0 * M_PI;\n    double x = mRadius * cos(theta);\n    double y = mRadius * sin(theta);\n    glVertex2d(static_cast<GLdouble>((_winWidth >> 1) + x),\n               static_cast<GLdouble>((_winHeight >> 1) + y));\n  }\n  glEnd();\n\n  glPopMatrix();\n}\n\nvoid Trackball::setTrackball(const Eigen::Vector2d& _center,\n                             const double _radius) {\n  mCenter = _center;\n  mRadius = _radius;\n}\n\nvoid Trackball::setCenter(const Eigen::Vector2d& _center) {\n  mCenter = _center;\n}\n\nvoid Trackball::setRadius(const double _radius) {\n  mRadius = _radius;\n}\n\nvoid Trackball::setQuaternion(const Eigen::Quaterniond& _q) {\n  mCurrQuat = _q;\n}\n\nEigen::Quaterniond Trackball::getCurrQuat() const {\n  return mCurrQuat;\n}\n\nEigen::Matrix3d Trackball::getRotationMatrix() const {\n  return mCurrQuat.toRotationMatrix();\n}\n\nEigen::Vector2d Trackball::getCenter() const {\n  return mCenter;\n}\n\ndouble Trackball::getRadius() const {\n  return mRadius;\n}\n\nEigen::Vector3d Trackball::mouseOnSphere(double _mouseX, double _mouseY) const {\n  double mag;\n  Eigen::Vector3d pointOnSphere;\n\n  pointOnSphere(0) = (_mouseX - mCenter(0)) \/ mRadius;\n  pointOnSphere(1) = (_mouseY - mCenter(1)) \/ mRadius;\n\n  mag = pointOnSphere(0) * pointOnSphere(0) + pointOnSphere(1)*pointOnSphere(1);\n  if (mag > 1.0) {\n    double scale = 1.0\/sqrt(mag);\n    pointOnSphere(0) *= scale;\n    pointOnSphere(1) *= scale;\n    pointOnSphere(2) = 0.0;\n  } else {\n    pointOnSphere(2) = sqrt(1 - mag);\n  }\n\n  return pointOnSphere;\n}\n\nEigen::Quaterniond Trackball::quatFromVectors(\n    const Eigen::Vector3d& _from, const Eigen::Vector3d& _to) const {\n  Eigen::Quaterniond quat;\n  quat.x() = _from(1)*_to(2) - _from(2)*_to(1);\n  quat.y() = _from(2)*_to(0) - _from(0)*_to(2);\n  quat.z() = _from(0)*_to(1) - _from(1)*_to(0);\n  quat.w() = _from(0)*_to(0) + _from(1)*_to(1) + _from(2)*_to(2);\n  return quat;\n}\n\n}  \/\/ namespace gui\n}  \/\/ namespace dart\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2016.  All rights reserved\n *\/\n#include    \"..\/..\/StroikaPreComp.h\"\n\n#if     qPlatform_Windows\n#include    <windows.h>\n#elif   qPlatform_POSIX\n#include    <dirent.h>\n#endif\n\n#include    \"..\/..\/Characters\/CString\/Utilities.h\"\n#include    \"..\/..\/Debug\/AssertExternallySynchronizedLock.h\"\n#include    \"..\/..\/Debug\/Trace.h\"\n#include    \"..\/..\/Execution\/ErrNoException.h\"\n#if     qPlatform_Windows\n#include    \"..\/..\/Execution\/Platform\/Windows\/Exception.h\"\n#endif\n#include    \"..\/..\/IO\/FileAccessException.h\"\n#include    \"..\/..\/IO\/FileSystem\/FileSystem.h\"\n\n#include    \"PathName.h\"\n\n#include    \"DirectoryIterator.h\"\n\n\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\nusing   namespace   Stroika::Foundation;\nusing   namespace   Stroika::Foundation::Characters;\nusing   namespace   Stroika::Foundation::IO;\nusing   namespace   Stroika::Foundation::IO::FileSystem;\nusing   namespace   Stroika::Foundation::Traversal;\n\n#if     qPlatform_Windows\nusing   Execution::Platform::Windows::ThrowIfFalseGetLastError;\n#endif\nusing   Execution::ThrowIfError_errno_t;\nusing   Execution::ThrowErrNoIfNull;\n\n\n\/\/ from https:\/\/www.gnu.org\/software\/libc\/manual\/html_node\/Reading_002fClosing-Directory.html -\n\/\/ To distinguish between an end-of-directory condition or an error, you must set errno to zero before calling readdir.\n\nclass   DirectoryIterator::Rep_ : public Iterator<String>::IRep, private Debug::AssertExternallySynchronizedLock {\nprivate:\n    IteratorReturnType          fIteratorReturnType_;\n    String                      fDirName_;\n    String                      fReportPrefix_;\n#if     qPlatform_POSIX\n    DIR*            fDirIt_             { nullptr };\n    dirent*         fCur_               { nullptr };\n#elif   qPlatform_Windows\n    HANDLE          fHandle_            { INVALID_HANDLE_VALUE };\n    WIN32_FIND_DATA fFindFileData_;\n    int             fSeekOffset_        { 0 };\n#endif\n\nprivate:\n    static  String  mkReportPrefix_ (const String& dirName, IteratorReturnType iteratorReturns)\n    {\n        switch (iteratorReturns) {\n            case IteratorReturnType::eFilenameOnly:\n                return String {};\n            case IteratorReturnType::eDirPlusFilename:\n                return AssureDirectoryPathSlashTerminated (dirName);\n            case IteratorReturnType::eFullPathName:\n                return AssureDirectoryPathSlashTerminated (IO::FileSystem::FileSystem::Default ().GetFullPathName (dirName));\n            default:\n                AssertNotReached ();\n                return String{};\n        }\n    }\n\npublic:\n    Rep_ (const String& dir, IteratorReturnType iteratorReturns)\n        : fIteratorReturnType_ (iteratorReturns)\n        , fDirName_ (dir)\n        , fReportPrefix_ (mkReportPrefix_ (dir, iteratorReturns))\n#if     qPlatform_POSIX\n        , fDirIt_ { ::opendir (dir.AsSDKString ().c_str ()) }\n#endif\n    {\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n        Debug::TraceContextBumper ctx { L\"DirectoryIterator::Rep_::CTOR\" };\n        DbgTrace (L\"('%s')\", dir.c_str ());\n#endif\n        try {\n#if     qPlatform_POSIX\n            if (fDirIt_ == nullptr)\n            {\n                Execution::ThrowIfError_errno_t ();\n            }\n            else {\n                errno = 0;\n                ThrowErrNoIfNull (fCur_ = ::readdir (fDirIt_));\n            }\n            if (fCur_ != nullptr and fCur_->d_name[0] == '.' and (CString::Equals (fCur_->d_name, SDKSTR (\".\")) or CString::Equals (fCur_->d_name, SDKSTR (\"..\"))))\n            {\n                Memory::Optional<String>    tmphack;\n                More (&tmphack, true);\n            }\n#elif   qPlatform_Windows\n            (void)::memset (&fFindFileData_, 0, sizeof (fFindFileData_));\n            fHandle_ = ::FindFirstFile ((dir + L\"\\\\*\").AsSDKString ().c_str (), &fFindFileData_);\n            if (fHandle_ != INVALID_HANDLE_VALUE and fFindFileData_.cFileName[0] == '.' and (CString::Equals (fFindFileData_.cFileName, SDKSTR (\".\")) or CString::Equals (fFindFileData_.cFileName, SDKSTR (\"..\"))))\n            {\n                Memory::Optional<String>    tmphack;\n                More (&tmphack, true);\n            }\n#endif\n        }\n        Stroika_Foundation_IO_FileAccessException_CATCH_REBIND_FILENAMESONLY_HELPER(dir);\n    }\n#if     qPlatform_POSIX\n    Rep_ (DIR* dirObj, const String& dirName, IteratorReturnType iteratorReturns)\n        : fIteratorReturnType_ (iteratorReturns)\n        , fDirName_ (dirName)\n        , fReportPrefix_ (mkReportPrefix_ (dirName, iteratorReturns))\n        , fDirIt_ { dirObj }\n    {\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n        Debug::TraceContextBumper ctx { L\"DirectoryIterator::Rep_::CTOR\" };\n        DbgTrace (L\"(dirObj=%p)\", dirObj);\n#endif\n        if (fDirIt_ != nullptr) {\n            errno = 0;\n            ThrowErrNoIfNull (fCur_ = ::readdir (fDirIt_));\n            if (fCur_ != nullptr and fCur_->d_name[0] == '.' and (CString::Equals (fCur_->d_name, SDKSTR (\".\")) or CString::Equals (fCur_->d_name, SDKSTR (\"..\")))) {\n                Memory::Optional<String>    tmphack;\n                More (&tmphack, true);\n            }\n        }\n    }\n#elif   qPlatform_Windows\n    Rep_ (const String& dir, int seekPos, IteratorReturnType iteratorReturns)\n        : fIteratorReturnType_ (iteratorReturns)\n        , fDirName_ (dir)\n        , fReportPrefix_ (mkReportPrefix_ (dir, iteratorReturns))\n    {\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n        Debug::TraceContextBumper ctx { L\"DirectoryIterator::Rep_::CTOR\" };\n        DbgTrace (L\"('%s',seekPos=%d)\", dir.c_str (), seekPos);\n#endif\n        (void)::memset (&fFindFileData_, 0, sizeof (fFindFileData_));\n        fHandle_ = ::FindFirstFile ((dir + L\"\\\\*\").AsSDKString ().c_str (), &fFindFileData_);\n        for (int i = 0; i < seekPos; ++i) {\n            if (::FindNextFile (fHandle_, &fFindFileData_) == 0) {\n                ::FindClose (fHandle_);\n                fHandle_ = INVALID_HANDLE_VALUE;\n            }\n            else {\n                fSeekOffset_++;\n            }\n        }\n        if (fHandle_ != INVALID_HANDLE_VALUE and fFindFileData_.cFileName[0] == '.' and (CString::Equals (fFindFileData_.cFileName, SDKSTR (\".\")) or CString::Equals (fFindFileData_.cFileName, SDKSTR (\"..\"))) ) {\n            Memory::Optional<String>    tmphack;\n            More (&tmphack, true);\n        }\n    }\n#endif\n    virtual ~Rep_ ()\n    {\n#if     qPlatform_POSIX\n        if (fDirIt_ != nullptr) {\n            ::closedir (fDirIt_);\n        }\n#elif   qPlatform_Windows\n        if (fHandle_ != INVALID_HANDLE_VALUE) {\n            ::FindClose (fHandle_);\n        }\n#endif\n    }\n    virtual void    More (Memory::Optional<String>* result, bool advance) override\n    {\n        lock_guard<const AssertExternallySynchronizedLock> critSec { *this };\n        RequireNotNull (result);\n        result->clear ();\n#if     qPlatform_POSIX\n        if (advance) {\nAgain:\n            RequireNotNull (fCur_);\n            RequireNotNull (fDirIt_);\n            errno = 0;\n            fCur_ = ::readdir (fDirIt_);\n            if (fCur_ == nullptr) {\n                if (errno != EBADF) {\n                    ThrowIfError_errno_t ();\n                }\n            }\n            if (fCur_ != nullptr and fCur_->d_name[0] == '.' and (CString::Equals (fCur_->d_name, SDKSTR (\".\")) or CString::Equals (fCur_->d_name, SDKSTR (\"..\")))) {\n                goto Again;\n            }\n        }\n        if (fCur_ != nullptr) {\n            *result = fReportPrefix_ + String::FromSDKString (fCur_->d_name);\n        }\n#elif   qPlatform_Windows\n        if (advance) {\nAgain:\n            Require (fHandle_ != INVALID_HANDLE_VALUE);\n            (void)::memset (&fFindFileData_, 0, sizeof (fFindFileData_));\n            if (::FindNextFile (fHandle_, &fFindFileData_) == 0) {\n                ::FindClose (fHandle_);\n                fHandle_ = INVALID_HANDLE_VALUE;\n            }\n            if (fHandle_ != INVALID_HANDLE_VALUE and fFindFileData_.cFileName[0] == '.' and (CString::Equals (fFindFileData_.cFileName, SDKSTR (\".\")) or CString::Equals (fFindFileData_.cFileName, SDKSTR (\"..\"))) ) {\n                goto Again;\n            }\n        }\n        if (fHandle_ != INVALID_HANDLE_VALUE) {\n            *result = fReportPrefix_ + String::FromSDKString (fFindFileData_.cFileName);\n        }\n#endif\n    }\n    virtual bool    Equals (const Iterator<String>::IRep* rhs) const override\n    {\n        shared_lock<const AssertExternallySynchronizedLock> critSec { *this };\n        RequireNotNull (rhs);\n        RequireMember (rhs, Rep_);\n        const Rep_&  rrhs = *dynamic_cast<const Rep_*> (rhs);\n#if     qPlatform_POSIX\n        return fDirIt_ == rrhs.fDirIt_;\n#elif   qPlatform_Windows\n        return fHandle_ == rrhs.fHandle_;\n#endif\n    }\n    virtual SharedIRepPtr    Clone () const override\n    {\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n        Debug::TraceContextBumper ctx (L\"Entering DirectoryIterator::Rep_::Clone\");\n#endif\n        shared_lock<const AssertExternallySynchronizedLock> critSec { *this };\n#if     qPlatform_POSIX\n        if (fDirIt_ == nullptr) {\n            return SharedIRepPtr (MakeSharedPtr<Rep_> (nullptr, fDirName_, fIteratorReturnType_));\n        }\n        \/*\n         *  must find telldir() returns the location of the NEXT read. We must pass along the value of telldir as\n         *  of the PREVIOUS read. Essentially (seek CUR_OFF, -1);\n         *\n         *  But - this API doesn't support that.\n         *\n         *  This leaves us with several weak alternatives:\n         *      o   save the telldir, and seek to the start of the dir, and repeatedly seek until\n         *          we get the same telldir, and then return the previous stored value.\n         *\n         *      o   substract 1 from the value of telldir()\n         *\n         *      o   Before each readdir() - do a telldir() to capture its value.\n         *\n         *      o   When cloning - compute offset in file#s by rewinding and seeking til we find the same value by\n         *          name or some such, and then use that same process to re-seek in the cloned dirEnt.\n         *\n         *  The 'subtract 1' approach, though cheap and simple, appears not supported by the telldir documentation,\n         *  and looking at values in the current linux\/gcc, seems unpromising.\n         *\n         *  Between the 'telldir' before each read, and re-seek approaches, the former adds overhead even when not cloning\n         *  iterators, and the later only when you use the feature. Moreover, the seek-to-start and keep looking\n         *  for telldir() approach probably works out efficeintly, as the most likely time to Clone () an iterator is\n         *  when it is 'at start' anyhow (DirectoryIterable). So we'll start with that...\n         *          -- LGP 2014-07-10\n         *\/\n        \/\/ Note - NOT 100% sure its OK to look for identical value telldir in another dir...\n        DIR*        dirObj          =   ::fdopendir (::dirfd (fDirIt_));\n        if (dirObj == nullptr) {\n            Execution::ThrowIfError_errno_t ();\n        }\n        try {\n            if (fCur_ == nullptr) {\n                \/\/ then we're past end end, the cloned fdopen dir one SB too!\n                Assert (::readdir (dirObj) == nullptr);\n            }\n            else {\n                ino_t   aBridgeTooFar   =   fCur_->d_ino;\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n                DbgTrace (\"aBridgeTooFar: fCur_->d_ino=%lld, d_name='%s'\", static_cast<long long> (fCur_->d_ino), fCur_->d_name);\n#endif\n                ::rewinddir (dirObj);\n                long useOffset = ::telldir (dirObj);\n                for (;;) {\n                    dirent* tmp = ::readdir (dirObj);\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n                    if (tmp == nullptr) {\n                        DbgTrace (\"in loop: tmp == nullptr\");\n                    }\n                    else {\n                        DbgTrace (\"in loop: tmp->d_ino=%lld, d_name='%s'\", static_cast<long long> (tmp->d_ino), tmp->d_name);\n                    }\n#endif\n                    if (tmp == nullptr) {\n                        \/\/ somehow the file went away, so no idea where to start, and the end is as reasonable as anywhere else???\n                        useOffset = ::telldir (dirObj);\n                        WeakAssert (false);     \/\/ possible bug? - ususual, and not handled well, but this can happen if the file disappears while we're cloning\n                        break;\n                    }\n                    else if (tmp->d_ino == aBridgeTooFar) {\n                        \/\/ then we are now pointing at the right elt, and want to seek to the PRECEEDING one so when it does a readdir it gets that item\n                        \/\/ so DONT update useOffset - just break!\n                        break;\n                    }\n                    else {\n                        \/\/ update to this reflects the last offset before we find d_ino\n                        useOffset = ::telldir (dirObj);\n                    }\n                }\n                ::seekdir (dirObj, useOffset);\n            }\n            return SharedIRepPtr (MakeSharedPtr<Rep_> (dirObj, fDirName_, fIteratorReturnType_));\n        }\n        catch (...) {\n            ::closedir (dirObj);    \/\/ avoid leak\n            Execution::ReThrow ();\n        }\n#elif   qPlatform_Windows\n        return SharedIRepPtr (MakeSharedPtr<Rep_> (fDirName_, fSeekOffset_, fIteratorReturnType_));\n#endif\n    }\n    virtual IteratorOwnerID GetOwner () const override\n    {\n        \/*\n         *  This return value allows any two DiscreteRange iterators (of the same type) to be compared.\n         *\/\n        return typeid (*this).name ();\n    }\n};\n\n\n\n\n\n\n\n\n\/*\n ********************************************************************************\n ******************** IO::FileSystem::DirectoryIterator *************************\n ********************************************************************************\n *\/\nDirectoryIterator::DirectoryIterator (const String& directoryName, IteratorReturnType iteratorReturns)\n    : Iterator<String> (MakeSharedPtr<Rep_> (directoryName, iteratorReturns))\n{\n}\n<commit_msg>minor cleanups to Foundation\/IO\/FileSystem\/DirectoryIterator<commit_after>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2016.  All rights reserved\n *\/\n#include    \"..\/..\/StroikaPreComp.h\"\n\n#if     qPlatform_Windows\n#include    <windows.h>\n#elif   qPlatform_POSIX\n#include    <dirent.h>\n#endif\n\n#include    \"..\/..\/Characters\/CString\/Utilities.h\"\n#include    \"..\/..\/Debug\/AssertExternallySynchronizedLock.h\"\n#include    \"..\/..\/Debug\/Trace.h\"\n#include    \"..\/..\/Execution\/ErrNoException.h\"\n#if     qPlatform_Windows\n#include    \"..\/..\/Execution\/Platform\/Windows\/Exception.h\"\n#endif\n#include    \"..\/..\/IO\/FileAccessException.h\"\n#include    \"..\/..\/IO\/FileSystem\/FileSystem.h\"\n\n#include    \"PathName.h\"\n\n#include    \"DirectoryIterator.h\"\n\n\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\nusing   namespace   Stroika::Foundation;\nusing   namespace   Stroika::Foundation::Characters;\nusing   namespace   Stroika::Foundation::IO;\nusing   namespace   Stroika::Foundation::IO::FileSystem;\nusing   namespace   Stroika::Foundation::Traversal;\n\n#if     qPlatform_Windows\nusing   Execution::Platform::Windows::ThrowIfFalseGetLastError;\n#endif\nusing   Execution::ThrowIfError_errno_t;\nusing   Execution::ThrowErrNoIfNull;\n\n\n\/\/ from https:\/\/www.gnu.org\/software\/libc\/manual\/html_node\/Reading_002fClosing-Directory.html -\n\/\/ To distinguish between an end-of-directory condition or an error, you must set errno to zero before calling readdir.\n\nclass   DirectoryIterator::Rep_ : public Iterator<String>::IRep, private Debug::AssertExternallySynchronizedLock {\nprivate:\n    IteratorReturnType          fIteratorReturnType_;\n    String                      fDirName_;\n    String                      fReportPrefix_;\n#if     qPlatform_POSIX\n    DIR*            fDirIt_             { nullptr };\n    dirent*         fCur_               { nullptr };\n#elif   qPlatform_Windows\n    HANDLE          fHandle_            { INVALID_HANDLE_VALUE };\n    WIN32_FIND_DATA fFindFileData_;\n    int             fSeekOffset_        { 0 };\n#endif\n\npublic:\n    Rep_ (const String& dir, IteratorReturnType iteratorReturns)\n        : fIteratorReturnType_ (iteratorReturns)\n        , fDirName_ (dir)\n        , fReportPrefix_ (mkReportPrefix_ (dir, iteratorReturns))\n#if     qPlatform_POSIX\n        , fDirIt_ { ::opendir (dir.AsSDKString ().c_str ()) }\n#endif\n    {\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n        Debug::TraceContextBumper ctx { L\"DirectoryIterator::Rep_::CTOR\" };\n        DbgTrace (L\"('%s')\", dir.c_str ());\n#endif\n        try {\n#if     qPlatform_POSIX\n            if (fDirIt_ == nullptr)\n            {\n                Execution::ThrowIfError_errno_t ();\n            }\n            else {\n                errno = 0;\n                ThrowErrNoIfNull (fCur_ = ::readdir (fDirIt_));\n            }\n            if (fCur_ != nullptr and fCur_->d_name[0] == '.' and (CString::Equals (fCur_->d_name, SDKSTR (\".\")) or CString::Equals (fCur_->d_name, SDKSTR (\"..\"))))\n            {\n                Memory::Optional<String>    tmphack;\n                More (&tmphack, true);\n            }\n#elif   qPlatform_Windows\n            (void)::memset (&fFindFileData_, 0, sizeof (fFindFileData_));\n            fHandle_ = ::FindFirstFile ((dir + L\"\\\\*\").AsSDKString ().c_str (), &fFindFileData_);\n            if (fHandle_ != INVALID_HANDLE_VALUE and fFindFileData_.cFileName[0] == '.' and (CString::Equals (fFindFileData_.cFileName, SDKSTR (\".\")) or CString::Equals (fFindFileData_.cFileName, SDKSTR (\"..\"))))\n            {\n                Memory::Optional<String>    tmphack;\n                More (&tmphack, true);\n            }\n#endif\n        }\n        Stroika_Foundation_IO_FileAccessException_CATCH_REBIND_FILENAMESONLY_HELPER(dir);\n    }\n#if     qPlatform_POSIX\n    Rep_ (DIR* dirObj, const String& dirName, IteratorReturnType iteratorReturns)\n        : fIteratorReturnType_ (iteratorReturns)\n        , fDirName_ (dirName)\n        , fReportPrefix_ (mkReportPrefix_ (dirName, iteratorReturns))\n        , fDirIt_ { dirObj }\n    {\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n        Debug::TraceContextBumper ctx { L\"DirectoryIterator::Rep_::CTOR\" };\n        DbgTrace (L\"(dirObj=%p)\", dirObj);\n#endif\n        if (fDirIt_ != nullptr) {\n            errno = 0;\n            ThrowErrNoIfNull (fCur_ = ::readdir (fDirIt_));\n            if (fCur_ != nullptr and fCur_->d_name[0] == '.' and (CString::Equals (fCur_->d_name, SDKSTR (\".\")) or CString::Equals (fCur_->d_name, SDKSTR (\"..\")))) {\n                Memory::Optional<String>    tmphack;\n                More (&tmphack, true);\n            }\n        }\n    }\n#elif   qPlatform_Windows\n    Rep_ (const String& dir, int seekPos, IteratorReturnType iteratorReturns)\n        : fIteratorReturnType_ (iteratorReturns)\n        , fDirName_ (dir)\n        , fReportPrefix_ (mkReportPrefix_ (dir, iteratorReturns))\n    {\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n        Debug::TraceContextBumper ctx { L\"DirectoryIterator::Rep_::CTOR\" };\n        DbgTrace (L\"('%s',seekPos=%d)\", dir.c_str (), seekPos);\n#endif\n        (void)::memset (&fFindFileData_, 0, sizeof (fFindFileData_));\n        fHandle_ = ::FindFirstFile ((dir + L\"\\\\*\").AsSDKString ().c_str (), &fFindFileData_);\n        for (int i = 0; i < seekPos; ++i) {\n            if (::FindNextFile (fHandle_, &fFindFileData_) == 0) {\n                ::FindClose (fHandle_);\n                fHandle_ = INVALID_HANDLE_VALUE;\n            }\n            else {\n                fSeekOffset_++;\n            }\n        }\n        if (fHandle_ != INVALID_HANDLE_VALUE and fFindFileData_.cFileName[0] == '.' and (CString::Equals (fFindFileData_.cFileName, SDKSTR (\".\")) or CString::Equals (fFindFileData_.cFileName, SDKSTR (\"..\"))) ) {\n            Memory::Optional<String>    tmphack;\n            More (&tmphack, true);\n        }\n    }\n#endif\n    virtual ~Rep_ ()\n    {\n#if     qPlatform_POSIX\n        if (fDirIt_ != nullptr) {\n            ::closedir (fDirIt_);\n        }\n#elif   qPlatform_Windows\n        if (fHandle_ != INVALID_HANDLE_VALUE) {\n            ::FindClose (fHandle_);\n        }\n#endif\n    }\n    virtual void    More (Memory::Optional<String>* result, bool advance) override\n    {\n        lock_guard<const AssertExternallySynchronizedLock> critSec { *this };\n        RequireNotNull (result);\n        result->clear ();\n#if     qPlatform_POSIX\n        if (advance) {\nAgain:\n            RequireNotNull (fCur_);\n            RequireNotNull (fDirIt_);\n            errno = 0;\n            fCur_ = ::readdir (fDirIt_);\n            if (fCur_ == nullptr) {\n                if (errno != EBADF) {\n                    ThrowIfError_errno_t ();\n                }\n            }\n            if (fCur_ != nullptr and fCur_->d_name[0] == '.' and (CString::Equals (fCur_->d_name, SDKSTR (\".\")) or CString::Equals (fCur_->d_name, SDKSTR (\"..\")))) {\n                goto Again;\n            }\n        }\n        if (fCur_ != nullptr) {\n            *result = fReportPrefix_ + String::FromSDKString (fCur_->d_name);\n        }\n#elif   qPlatform_Windows\n        if (advance) {\nAgain:\n            Require (fHandle_ != INVALID_HANDLE_VALUE);\n            (void)::memset (&fFindFileData_, 0, sizeof (fFindFileData_));\n            if (::FindNextFile (fHandle_, &fFindFileData_) == 0) {\n                ::FindClose (fHandle_);\n                fHandle_ = INVALID_HANDLE_VALUE;\n            }\n            if (fHandle_ != INVALID_HANDLE_VALUE and fFindFileData_.cFileName[0] == '.' and (CString::Equals (fFindFileData_.cFileName, SDKSTR (\".\")) or CString::Equals (fFindFileData_.cFileName, SDKSTR (\"..\"))) ) {\n                goto Again;\n            }\n        }\n        if (fHandle_ != INVALID_HANDLE_VALUE) {\n            *result = fReportPrefix_ + String::FromSDKString (fFindFileData_.cFileName);\n        }\n#endif\n    }\n    virtual bool    Equals (const Iterator<String>::IRep* rhs) const override\n    {\n        shared_lock<const AssertExternallySynchronizedLock> critSec { *this };\n        RequireNotNull (rhs);\n        RequireMember (rhs, Rep_);\n        const Rep_&  rrhs = *dynamic_cast<const Rep_*> (rhs);\n#if     qPlatform_POSIX\n        return fDirIt_ == rrhs.fDirIt_;\n#elif   qPlatform_Windows\n        return fHandle_ == rrhs.fHandle_;\n#endif\n    }\n    virtual SharedIRepPtr    Clone () const override\n    {\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n        Debug::TraceContextBumper ctx (L\"Entering DirectoryIterator::Rep_::Clone\");\n#endif\n        shared_lock<const AssertExternallySynchronizedLock> critSec { *this };\n#if     qPlatform_POSIX\n        if (fDirIt_ == nullptr) {\n            return SharedIRepPtr (MakeSharedPtr<Rep_> (nullptr, fDirName_, fIteratorReturnType_));\n        }\n        \/*\n         *  must find telldir() returns the location of the NEXT read. We must pass along the value of telldir as\n         *  of the PREVIOUS read. Essentially (seek CUR_OFF, -1);\n         *\n         *  But - this API doesn't support that.\n         *\n         *  This leaves us with several weak alternatives:\n         *      o   save the telldir, and seek to the start of the dir, and repeatedly seek until\n         *          we get the same telldir, and then return the previous stored value.\n         *\n         *      o   substract 1 from the value of telldir()\n         *\n         *      o   Before each readdir() - do a telldir() to capture its value.\n         *\n         *      o   When cloning - compute offset in file#s by rewinding and seeking til we find the same value by\n         *          name or some such, and then use that same process to re-seek in the cloned dirEnt.\n         *\n         *  The 'subtract 1' approach, though cheap and simple, appears not supported by the telldir documentation,\n         *  and looking at values in the current linux\/gcc, seems unpromising.\n         *\n         *  Between the 'telldir' before each read, and re-seek approaches, the former adds overhead even when not cloning\n         *  iterators, and the later only when you use the feature. Moreover, the seek-to-start and keep looking\n         *  for telldir() approach probably works out efficeintly, as the most likely time to Clone () an iterator is\n         *  when it is 'at start' anyhow (DirectoryIterable). So we'll start with that...\n         *          -- LGP 2014-07-10\n         *\/\n        \/\/ Note - NOT 100% sure its OK to look for identical value telldir in another dir...\n        DIR*        dirObj          =   ::fdopendir (::dirfd (fDirIt_));\n        if (dirObj == nullptr) {\n            Execution::ThrowIfError_errno_t ();\n        }\n        try {\n            if (fCur_ == nullptr) {\n                \/\/ then we're past end end, the cloned fdopen dir one SB too!\n                Assert (::readdir (dirObj) == nullptr);\n            }\n            else {\n                ino_t   aBridgeTooFar   =   fCur_->d_ino;\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n                DbgTrace (\"aBridgeTooFar: fCur_->d_ino=%lld, d_name='%s'\", static_cast<long long> (fCur_->d_ino), fCur_->d_name);\n#endif\n                ::rewinddir (dirObj);\n                long useOffset = ::telldir (dirObj);\n                for (;;) {\n                    dirent* tmp = ::readdir (dirObj);\n#if     USE_NOISY_TRACE_IN_THIS_MODULE_\n                    if (tmp == nullptr) {\n                        DbgTrace (\"in loop: tmp == nullptr\");\n                    }\n                    else {\n                        DbgTrace (\"in loop: tmp->d_ino=%lld, d_name='%s'\", static_cast<long long> (tmp->d_ino), tmp->d_name);\n                    }\n#endif\n                    if (tmp == nullptr) {\n                        \/\/ somehow the file went away, so no idea where to start, and the end is as reasonable as anywhere else???\n                        useOffset = ::telldir (dirObj);\n                        WeakAssert (false);     \/\/ possible bug? - ususual, and not handled well, but this can happen if the file disappears while we're cloning\n                        break;\n                    }\n                    else if (tmp->d_ino == aBridgeTooFar) {\n                        \/\/ then we are now pointing at the right elt, and want to seek to the PRECEEDING one so when it does a readdir it gets that item\n                        \/\/ so DONT update useOffset - just break!\n                        break;\n                    }\n                    else {\n                        \/\/ update to this reflects the last offset before we find d_ino\n                        useOffset = ::telldir (dirObj);\n                    }\n                }\n                ::seekdir (dirObj, useOffset);\n            }\n            return SharedIRepPtr (MakeSharedPtr<Rep_> (dirObj, fDirName_, fIteratorReturnType_));\n        }\n        catch (...) {\n            ::closedir (dirObj);    \/\/ avoid leak\n            Execution::ReThrow ();\n        }\n#elif   qPlatform_Windows\n        return SharedIRepPtr (MakeSharedPtr<Rep_> (fDirName_, fSeekOffset_, fIteratorReturnType_));\n#endif\n    }\n    virtual IteratorOwnerID GetOwner () const override\n    {\n        \/*\n         *  This return value allows any two DiscreteRange iterators (of the same type) to be compared.\n         *\/\n        return typeid (*this).name ();\n    }\nprivate:\n    static  String  mkReportPrefix_ (const String& dirName, IteratorReturnType iteratorReturns)\n    {\n        switch (iteratorReturns) {\n            case IteratorReturnType::eFilenameOnly:\n                return String{};\n            case IteratorReturnType::eDirPlusFilename:\n                return AssureDirectoryPathSlashTerminated (dirName);\n            case IteratorReturnType::eFullPathName:\n                return AssureDirectoryPathSlashTerminated (IO::FileSystem::FileSystem::Default ().GetFullPathName (dirName));\n            default:\n                AssertNotReached ();\n                return String{};\n        }\n    }\n};\n\n\n\n\n\n\n\n\n\/*\n ********************************************************************************\n ******************** IO::FileSystem::DirectoryIterator *************************\n ********************************************************************************\n *\/\nDirectoryIterator::DirectoryIterator (const String& directoryName, IteratorReturnType iteratorReturns)\n    : Iterator<String> (MakeSharedPtr<Rep_> (directoryName, iteratorReturns))\n{\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"Mesh.hpp\"\n#include \"ShaderProgram.hpp\"\n#include \"ShaderBinding.hpp\"\n\nMesh::Mesh(Vertex::Format format, BufferType bufferType, bool indexed) :\n\tvertexFormat(format),\n\tvertexCount(0),\n\tindexCount(0),\n\tvertexBuffer(0),\n\tprimitiveType(TRIANGLES),\n\tbufferType(bufferType),\n\tindexed(indexed) {\n\tglGenBuffers(1, &vertexBuffer);\n\tVBE_ASSERT(glGetError() == GL_NO_ERROR, \"Failed to create VBO for mesh\");\n\tglBindBuffer(GL_ARRAY_BUFFER, vertexBuffer);\n\tVBE_ASSERT(glGetError() == GL_NO_ERROR, \"Failed to bind VBO for mesh\");\n\tglBufferData(GL_ARRAY_BUFFER, 0, nullptr, bufferType);\n\tVBE_ASSERT(glGetError() == GL_NO_ERROR, \"Failed to load VBO with empty vertex data\");\n\tif(indexed) {\n\t\tglGenBuffers(1, &indexBuffer);\n\t\tVBE_ASSERT(glGetError() == GL_NO_ERROR, \"Failed to create IBO for mesh\");\n\t}\n}\n\nMesh::~Mesh() {\n\tif(vertexBuffer != 0)\n\t\tglDeleteBuffers(1, &vertexBuffer);\n\tfor(std::map<GLuint, const ShaderBinding*>::iterator it = bindingsCache.begin(); it != bindingsCache.end(); ++it)\n\t\tdelete it->second;\n}\n\nvoid Mesh::draw(const ShaderProgram *program) {\n\tVBE_ASSERT(program->getHandle() != 0, \"nullptr program when about to draw mesh\");\n\tGLuint handle = program->getHandle();\n\tif(bindingsCache.find(handle) == bindingsCache.end())\n\t\tbindingsCache.insert(std::pair<GLuint, const ShaderBinding*>(handle, new ShaderBinding(program, this)));\n\tconst ShaderBinding* binding = bindingsCache.at(handle);\n\tprogram->use();\n\tbinding->bindVAO();\n\tif(!indexed) glDrawArrays(primitiveType, 0, vertexCount);\n\telse glDrawElements(primitiveType, indexCount, GL_UNSIGNED_INT, 0);\n}\n\nconst Vertex::Format& Mesh::getVertexFormat() const {\n\treturn vertexFormat;\n}\n\nunsigned int Mesh::getVertexCount() const {\n\treturn vertexCount;\n}\n\nunsigned int Mesh::getVertexSize() const {\n\treturn vertexFormat.vertexSize();\n}\n\nMesh::BufferType Mesh::getType() const {\n\treturn bufferType;\n}\n\nGLuint Mesh::getVertexBuffer() const {\n\treturn vertexBuffer;\n}\n\nGLuint Mesh::getIndexBuffer() const {\n\treturn indexBuffer;\n}\n\nMesh::PrimitiveType Mesh::getPrimitiveType() const {\n\treturn primitiveType;\n}\n\nbool Mesh::isIndexed() const {\n\treturn indexed;\n}\n\nvoid Mesh::setPrimitiveType(Mesh::PrimitiveType type) {\n\tprimitiveType = type;\n}\n\nvoid Mesh::setVertexData(void* vertexData, unsigned int newVertexCount) {\n\tvertexCount = newVertexCount;\n\tglBindBuffer(GL_ARRAY_BUFFER, vertexBuffer);\n\tglBufferData(GL_ARRAY_BUFFER, vertexFormat.vertexSize() * vertexCount, vertexData, bufferType);\n\tglBindBuffer(GL_ARRAY_BUFFER, 0);\n}\n\nvoid Mesh::setVertexIndices(unsigned int* indexData, unsigned int newIndexCount) {\n\tVBE_ASSERT(indexed, \"Cannot set indexes for a non-indexed mesh\");\n\tindexCount = newIndexCount;\n\tglBindBuffer(GL_ELEMENT_ARRAY_BUFFER, indexBuffer);\n\tglBufferData(GL_ELEMENT_ARRAY_BUFFER, indexCount * sizeof(unsigned int), indexData, bufferType);\n\tglBindBuffer(GL_ELEMENT_ARRAY_BUFFER, 0);\n}\n\nstruct FunctorCompareVec3s{\n\tbool operator()(const vec3s& a, const vec3s& b)\n    {\n        if(a.x != b.x) return a.x < b.x;\n        if(a.y != b.y) return a.y < b.y;\n        if(a.z != b.z) return a.z < b.z;\n        return false;\n    }\n\n};\n\n\nMesh* Mesh::loadFromFile(const std::string filepath, Mesh::BufferType bufferType) {\n\tstd::vector<Vertex::Element> elements;\n\telements.push_back(Vertex::Element(Vertex::Attribute::Position , Vertex::Element::Float, 3));\n\telements.push_back(Vertex::Element(Vertex::Attribute::Normal   , Vertex::Element::Float, 3));\n\telements.push_back(Vertex::Element(Vertex::Attribute::TexCoord , Vertex::Element::Float, 2));\n\n\tstruct vert {\n\t\t\tvert(vec3f pos, vec3f nor, vec2f tex) : pos(pos) , nor(nor), tex(tex) {}\n\t\t\tvec3f pos, nor;\n\t\t\tvec2f tex;\n\t};\n\n\tstd::ifstream in(filepath.c_str(), std::ifstream::in);\n\tVBE_ASSERT(in, \"While importing OBJ: Cannot open \" << filepath );\n\n\tstd::vector<vec3f> vertices;\n\tstd::vector<vec3f> normals;\n\tstd::vector<vec2f> textures;\n\tstd::vector<unsigned int> indices; \/\/indices into data1\n\tstd::vector<vert> dataIndexed; \/\/indexed data\n\tstd::vector<vert> dataNotIndexed; \/\/unindexed data\n\n\tstd::map<vec3s, int, FunctorCompareVec3s> indexMap;\n\n\tstd::string line;\n\twhile (getline(in, line)) {\n\t\tif (line.substr(0, 2) == \"v \") {\n\t\t\tstd::istringstream s(line.substr(2));\n\t\t\tvec3f v;\n\t\t\ts >> v.x >> v.y >> v.z;\n            vertices.push_back(v);\n\t\t}\n\t\telse if (line.substr(0, 3) == \"vn \") {\n\t\t\tstd::istringstream s(line.substr(3));\n\t\t\tvec3f v;\n\t\t\ts >> v.x >> v.y >> v.z;\n\t\t\tnormals.push_back(v);\n\t\t}\n\t\telse if (line.substr(0, 3) == \"vt \") {\n\t\t\tstd::istringstream s(line.substr(3));\n\t\t\tvec2f v;\n\t\t\ts >> v.x >> v.y;\n\t\t\tv.y = 1-v.y;\n\t\t\ttextures.push_back(v);\n\t\t}\n\t\telse if (line.substr(0, 2) == \"f \") {\n\t\t\tstd::istringstream s(line.substr(2));\n\t\t\tstd::vector<vec3s> vInf(3, vec3s(0));\n\t\t\tchar b;\n\t\t\ts   >> vInf[0].x >> b >> vInf[0].y >> b >> vInf[0].z\n\t\t\t\t\t\t\t >> vInf[1].x >> b >> vInf[1].y >> b >> vInf[1].z\n\t\t\t\t\t\t\t >> vInf[2].x >> b >> vInf[2].y >> b >> vInf[2].z;\n\t\t\tfor(unsigned int i = 0; i < 3; ++i)\n            {\n\t\t\t\tstd::map<vec3s, int, FunctorCompareVec3s>::iterator it = indexMap.find(vInf[i]);\n                int ind = 0;\n                if(it == indexMap.end())\n                {\n                    ind = indexMap.size();\n\t\t\t\t\tindexMap.insert(std::pair<vec3s, int>(vInf[i], dataIndexed.size()));\n\t\t\t\t\tdataIndexed.push_back(vert(vertices[vInf[i].x-1], normals[vInf[i].z-1], textures[vInf[i].y-1]));\n                }\n                else\n                    ind = it->second;\n\n                indices.push_back(ind);\n\n\t\t\t\tdataNotIndexed.push_back(vert(vertices[vInf[i].x-1], normals[vInf[i].z-1], textures[vInf[i].y-1]));\n            }\n\t\t}\n\t}\n\tVBE_LOG(indices.size());\n\tfloat sizeWithIndex = dataIndexed.size()*sizeof(dataIndexed[0])+indices.size()*sizeof(indices[0]);\n\tfloat sizeWithoutIndex = dataNotIndexed.size()*sizeof(dataNotIndexed[0]);\n\n\tMesh* mesh = nullptr;\n\tif(true || sizeWithoutIndex > sizeWithIndex) { \/\/indexed\n\t\tmesh = new Mesh(Vertex::Format(elements), bufferType, true);\n\t\tmesh->setVertexData(&dataIndexed[0], dataIndexed.size());\n\t\tmesh->setVertexIndices(&indices[0], indices.size());\n\t}\n\telse { \/\/not indexed\n\t\tmesh = new Mesh(Vertex::Format(elements), bufferType, false);\n\t\tmesh->setVertexData(&dataNotIndexed[0], dataNotIndexed.size());\n\t}\n\treturn mesh;\n}\n\nMesh* Mesh::loadEmpty(Vertex::Format format, Mesh::BufferType bufferType, bool indexed) {\n\treturn new Mesh(format, bufferType, indexed);\n}\n<commit_msg>WTF torra, WTF !?<commit_after>#include \"Mesh.hpp\"\n#include \"ShaderProgram.hpp\"\n#include \"ShaderBinding.hpp\"\n\nMesh::Mesh(Vertex::Format format, BufferType bufferType, bool indexed) :\n\tvertexFormat(format),\n\tvertexCount(0),\n\tindexCount(0),\n\tvertexBuffer(0),\n\tprimitiveType(TRIANGLES),\n\tbufferType(bufferType),\n\tindexed(indexed) {\n\tglGenBuffers(1, &vertexBuffer);\n\tVBE_ASSERT(glGetError() == GL_NO_ERROR, \"Failed to create VBO for mesh\");\n\tglBindBuffer(GL_ARRAY_BUFFER, vertexBuffer);\n\tVBE_ASSERT(glGetError() == GL_NO_ERROR, \"Failed to bind VBO for mesh\");\n\tglBufferData(GL_ARRAY_BUFFER, 0, nullptr, bufferType);\n\tVBE_ASSERT(glGetError() == GL_NO_ERROR, \"Failed to load VBO with empty vertex data\");\n\tif(indexed) {\n\t\tglGenBuffers(1, &indexBuffer);\n\t\tVBE_ASSERT(glGetError() == GL_NO_ERROR, \"Failed to create IBO for mesh\");\n\t}\n}\n\nMesh::~Mesh() {\n\tif(vertexBuffer != 0)\n\t\tglDeleteBuffers(1, &vertexBuffer);\n\tfor(std::map<GLuint, const ShaderBinding*>::iterator it = bindingsCache.begin(); it != bindingsCache.end(); ++it)\n\t\tdelete it->second;\n}\n\nvoid Mesh::draw(const ShaderProgram *program) {\n\tVBE_ASSERT(program->getHandle() != 0, \"nullptr program when about to draw mesh\");\n\tGLuint handle = program->getHandle();\n\tif(bindingsCache.find(handle) == bindingsCache.end())\n\t\tbindingsCache.insert(std::pair<GLuint, const ShaderBinding*>(handle, new ShaderBinding(program, this)));\n\tconst ShaderBinding* binding = bindingsCache.at(handle);\n\tprogram->use();\n\tbinding->bindVAO();\n\tif(!indexed) glDrawArrays(primitiveType, 0, vertexCount);\n\telse glDrawElements(primitiveType, indexCount, GL_UNSIGNED_INT, 0);\n}\n\nconst Vertex::Format& Mesh::getVertexFormat() const {\n\treturn vertexFormat;\n}\n\nunsigned int Mesh::getVertexCount() const {\n\treturn vertexCount;\n}\n\nunsigned int Mesh::getVertexSize() const {\n\treturn vertexFormat.vertexSize();\n}\n\nMesh::BufferType Mesh::getType() const {\n\treturn bufferType;\n}\n\nGLuint Mesh::getVertexBuffer() const {\n\treturn vertexBuffer;\n}\n\nGLuint Mesh::getIndexBuffer() const {\n\treturn indexBuffer;\n}\n\nMesh::PrimitiveType Mesh::getPrimitiveType() const {\n\treturn primitiveType;\n}\n\nbool Mesh::isIndexed() const {\n\treturn indexed;\n}\n\nvoid Mesh::setPrimitiveType(Mesh::PrimitiveType type) {\n\tprimitiveType = type;\n}\n\nvoid Mesh::setVertexData(void* vertexData, unsigned int newVertexCount) {\n\tvertexCount = newVertexCount;\n\tglBindBuffer(GL_ARRAY_BUFFER, vertexBuffer);\n\tglBufferData(GL_ARRAY_BUFFER, vertexFormat.vertexSize() * vertexCount, vertexData, bufferType);\n\tglBindBuffer(GL_ARRAY_BUFFER, 0);\n}\n\nvoid Mesh::setVertexIndices(unsigned int* indexData, unsigned int newIndexCount) {\n\tVBE_ASSERT(indexed, \"Cannot set indexes for a non-indexed mesh\");\n\tindexCount = newIndexCount;\n\tglBindBuffer(GL_ELEMENT_ARRAY_BUFFER, indexBuffer);\n\tglBufferData(GL_ELEMENT_ARRAY_BUFFER, indexCount * sizeof(unsigned int), indexData, bufferType);\n\tglBindBuffer(GL_ELEMENT_ARRAY_BUFFER, 0);\n}\n\nstruct FunctorComparevec3i{\n\tbool operator()(const vec3i& a, const vec3i& b)\n    {\n        if(a.x != b.x) return a.x < b.x;\n        if(a.y != b.y) return a.y < b.y;\n        if(a.z != b.z) return a.z < b.z;\n        return false;\n    }\n\n};\n\n\nMesh* Mesh::loadFromFile(const std::string filepath, Mesh::BufferType bufferType) {\n\tstd::vector<Vertex::Element> elements;\n\telements.push_back(Vertex::Element(Vertex::Attribute::Position , Vertex::Element::Float, 3));\n\telements.push_back(Vertex::Element(Vertex::Attribute::Normal   , Vertex::Element::Float, 3));\n\telements.push_back(Vertex::Element(Vertex::Attribute::TexCoord , Vertex::Element::Float, 2));\n\n\tstruct vert {\n\t\t\tvert(vec3f pos, vec3f nor, vec2f tex) : pos(pos) , nor(nor), tex(tex) {}\n\t\t\tvec3f pos, nor;\n\t\t\tvec2f tex;\n\t};\n\n\tstd::ifstream in(filepath.c_str(), std::ifstream::in);\n\tVBE_ASSERT(in, \"While importing OBJ: Cannot open \" << filepath );\n\n\tstd::vector<vec3f> vertices;\n\tstd::vector<vec3f> normals;\n\tstd::vector<vec2f> textures;\n\tstd::vector<unsigned int> indices; \/\/indices into data1\n\tstd::vector<vert> dataIndexed; \/\/indexed data\n\tstd::vector<vert> dataNotIndexed; \/\/unindexed data\n\n\tstd::map<vec3i, int, FunctorComparevec3i> indexMap;\n\n\tstd::string line;\n\twhile (getline(in, line)) {\n\t\tif (line.substr(0, 2) == \"v \") {\n\t\t\tstd::istringstream s(line.substr(2));\n\t\t\tvec3f v;\n\t\t\ts >> v.x >> v.y >> v.z;\n            vertices.push_back(v);\n\t\t}\n\t\telse if (line.substr(0, 3) == \"vn \") {\n\t\t\tstd::istringstream s(line.substr(3));\n\t\t\tvec3f v;\n\t\t\ts >> v.x >> v.y >> v.z;\n\t\t\tnormals.push_back(v);\n\t\t}\n\t\telse if (line.substr(0, 3) == \"vt \") {\n\t\t\tstd::istringstream s(line.substr(3));\n\t\t\tvec2f v;\n\t\t\ts >> v.x >> v.y;\n\t\t\tv.y = 1-v.y;\n\t\t\ttextures.push_back(v);\n\t\t}\n\t\telse if (line.substr(0, 2) == \"f \") {\n\t\t\tstd::istringstream s(line.substr(2));\n\t\t\tstd::vector<vec3i> vInf(3, vec3i(0));\n\t\t\tchar b;\n\t\t\ts   >> vInf[0].x >> b >> vInf[0].y >> b >> vInf[0].z\n\t\t\t\t\t\t\t >> vInf[1].x >> b >> vInf[1].y >> b >> vInf[1].z\n\t\t\t\t\t\t\t >> vInf[2].x >> b >> vInf[2].y >> b >> vInf[2].z;\n\t\t\tfor(unsigned int i = 0; i < 3; ++i)\n            {\n\t\t\t\tstd::map<vec3i, int, FunctorComparevec3i>::iterator it = indexMap.find(vInf[i]);\n                int ind = 0;\n                if(it == indexMap.end())\n                {\n                    ind = indexMap.size();\n\t\t\t\t\tindexMap.insert(std::pair<vec3i, int>(vInf[i], dataIndexed.size()));\n\t\t\t\t\tdataIndexed.push_back(vert(vertices[vInf[i].x-1], normals[vInf[i].z-1], textures[vInf[i].y-1]));\n                }\n                else\n                    ind = it->second;\n\n                indices.push_back(ind);\n\n\t\t\t\tdataNotIndexed.push_back(vert(vertices[vInf[i].x-1], normals[vInf[i].z-1], textures[vInf[i].y-1]));\n            }\n\t\t}\n\t}\n\tVBE_LOG(indices.size());\n\tfloat sizeWithIndex = dataIndexed.size()*sizeof(dataIndexed[0])+indices.size()*sizeof(indices[0]);\n\tfloat sizeWithoutIndex = dataNotIndexed.size()*sizeof(dataNotIndexed[0]);\n\n\tMesh* mesh = nullptr;\n\tif(true || sizeWithoutIndex > sizeWithIndex) { \/\/indexed\n\t\tmesh = new Mesh(Vertex::Format(elements), bufferType, true);\n\t\tmesh->setVertexData(&dataIndexed[0], dataIndexed.size());\n\t\tmesh->setVertexIndices(&indices[0], indices.size());\n\t}\n\telse { \/\/not indexed\n\t\tmesh = new Mesh(Vertex::Format(elements), bufferType, false);\n\t\tmesh->setVertexData(&dataNotIndexed[0], dataNotIndexed.size());\n\t}\n\treturn mesh;\n}\n\nMesh* Mesh::loadEmpty(Vertex::Format format, Mesh::BufferType bufferType, bool indexed) {\n\treturn new Mesh(format, bufferType, indexed);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ This macro plays a recorded ROOT session showing how to perform various\r\n\/\/ interactive graphical editing operations. The initial graphics setup \r\n\/\/ was created using the following root commands: \r\n\/\/\r\n\/\/   t = new TRecorder();\r\n\/\/   t->Start(\"graphedit_playback.root\");\r\n\/\/   gStyle->SetPalette(1);\r\n\/\/   TCanvas *c2 = new TCanvas(\"c2\",\"c2\",0,0,700,500);\r\n\/\/   TH2F* h2 = new TH2F(\"h2\",\"Random 2D Gaussian\",40,-4,4,40,-4,4);\r\n\/\/   h2->SetDirectory(0);\r\n\/\/   TRandom r;\r\n\/\/   for (int i=0;i<50000;i++) h2->Fill(r.Gaus(),r.Gaus());\r\n\/\/   h2->Draw();\r\n\/\/   gPad->Update();\r\n\/\/   TCanvas *c1 = new TCanvas(\"c1\",\"c1\",0,0,700,500);\r\n\/\/   TH1F* h1 = new TH1F(\"h1\",\"Random 1D Gaussian\",100,-4,4);\r\n\/\/   h1->SetDirectory(0);\r\n\/\/   h1->FillRandom(\"gaus\",10000);\r\n\/\/   h1->Draw();\r\n\/\/   gPad->Update();\r\n\/\/  \r\n\/\/   \/\/ Here the following \"sketch\" was done.\r\n\/\/  \r\n\/\/   t->Stop();\r\n\/\/\r\n\/\/ The interactive editing shows:\r\n\/\/     - Object editing using object editors\r\n\/\/     - Direct editing on the graphics canvas\r\n\/\/     - Saving PS and bitmap files.\r\n\/\/     - Saving as a .C file: C++ code corresponding to the modifications\r\n\/\/       is saved.\r\n\/\/\r\n\/\/ The sketch of the recorded actions is:\r\n\/\/\r\n\/\/    On the canvas c1:\r\n\/\/       Open View\/Editor\r\n\/\/       Select histogram\r\n\/\/       Change fill style\r\n\/\/       Change fill color\r\n\/\/       Move stat box\r\n\/\/       Change fill color\r\n\/\/       Move title \r\n\/\/       Change fill color using wheel color\r\n\/\/       Select Y axis\r\n\/\/       Change axis title\r\n\/\/       Select X axis\r\n\/\/       Change axis title\r\n\/\/       Select histogram\r\n\/\/       Go in binning\r\n\/\/       Change range\r\n\/\/       Move range\r\n\/\/       On the canvas menu set grid Y\r\n\/\/       On the canvas menu set grid X\r\n\/\/       On the canvas menu set log Y\r\n\/\/       Increase the range.\r\n\/\/       Close View\/Editor\r\n\/\/       Save as PS file\r\n\/\/       Save as C file\r\n\/\/       Close c1\r\n\/\/    On the canvas c2:\r\n\/\/       Open View\/Editor\r\n\/\/       Select histogram\r\n\/\/       Select COL\r\n\/\/       Select Palette\r\n\/\/       Move Stats\r\n\/\/       Select Overflows\r\n\/\/       Select histogram\r\n\/\/       Select 3D\r\n\/\/       Select SURF1\r\n\/\/       Rotate Surface\r\n\/\/       Go in binning\r\n\/\/       Change X range\r\n\/\/       Change Y range\r\n\/\/       Close View\/Editor\r\n\/\/       Save as GIF file\r\n\/\/       Save as C file\r\n\/\/       Close c2\r\n\r\nvoid graph_edit_playback()\r\n{\r\n   TRecorder* r = new TRecorder(\"http:\/\/root.cern.ch\/files\/graphedit_playback.root\");\r\n}\r\n<commit_msg>- This new version of the macro does some automatic check at the end   to verify that all went well.<commit_after>\/\/ This macro plays a recorded ROOT session showing how to perform various\n\/\/ interactive graphical editing operations. The initial graphics setup \n\/\/ was created using the following root commands: \n\/*\n     t = new TRecorder();\n     t->Start(\"graphedit_playback.root\");\n     gStyle->SetPalette(1);\n     TCanvas *c2 = new TCanvas(\"c2\",\"c2\",0,0,700,500);\n     TH2F* h2 = new TH2F(\"h2\",\"Random 2D Gaussian\",40,-4,4,40,-4,4);\n     h2->SetDirectory(0);\n     TRandom r;\n     for (int i=0;i<50000;i++) h2->Fill(r.Gaus(),r.Gaus());\n     h2->Draw();\n     gPad->Update();\n     TCanvas *c1 = new TCanvas(\"c1\",\"c1\",0,0,700,500);\n     TH1F* h1 = new TH1F(\"h1\",\"Random 1D Gaussian\",100,-4,4);\n     h1->SetDirectory(0);\n     h1->FillRandom(\"gaus\",10000);\n     h1->Draw();\n     gPad->Update();\n    \n     \/\/ Here the following \"sketch\" was done.\n    \n     t->Stop();\n*\/\n\/\/ Note: The previous commands should be copy\/pasted into a ROOT session, not\n\/\/ executed as a macro.\n\/\/\n\/\/ The interactive editing shows:\n\/\/     - Object editing using object editors\n\/\/     - Direct editing on the graphics canvas\n\/\/     - Saving PS and bitmap files.\n\/\/     - Saving as a .C file: C++ code corresponding to the modifications\n\/\/       is saved.\n\/\/\n\/\/ The sketch of the recorded actions is:\n\/\/\n\/\/    On the canvas c1:\n\/\/       Open View\/Editor\n\/\/       Select histogram\n\/\/       Change fill style\n\/\/       Change fill color\n\/\/       Move stat box\n\/\/       Change fill color\n\/\/       Move title \n\/\/       Change fill color using wheel color\n\/\/       Select Y axis\n\/\/       Change axis title\n\/\/       Select X axis\n\/\/       Change axis title\n\/\/       Select histogram\n\/\/       Go in binning\n\/\/       Change range\n\/\/       Move range\n\/\/       On the canvas menu set grid Y\n\/\/       On the canvas menu set grid X\n\/\/       On the canvas menu set log Y\n\/\/       Increase the range\n\/\/       Close View\/Editor\n\/\/       Open the Tool Bar\n\/\/       Create a text \"Comment\"\n\/\/       Create an arrow\n\/\/       Change the arrow size\n\/\/       Close the Tool Bar\n\/\/       Save as PS file\n\/\/       Save as C file\n\/\/       Close c1\n\/\/    On the canvas c2:\n\/\/       Open View\/Editor\n\/\/       Select histogram\n\/\/       Select COL\n\/\/       Select Palette\n\/\/       Move Stats\n\/\/       Select Overflows\n\/\/       Select histogram\n\/\/       Select 3D\n\/\/       Select SURF1\n\/\/       Rotate Surface\n\/\/       Go in binning\n\/\/       Change X range\n\/\/       Change Y range\n\/\/       Close View\/Editor\n\/\/       Save as GIF file\n\/\/       Save as C file\n\/\/       Close c2\n\nInt_t file_size(char *filename)\n{\n   FileStat_t fs;\n   gSystem->GetPathInfo(filename, fs);\n   return (Int_t)fs.fSize;\n}\n\nvoid graph_edit_playback()\n{\n   r = new TRecorder();\n   r->Replay(\"http:\/\/root.cern.ch\/files\/graphedit_playback.root\",kFALSE);\n\n   \/\/ wait for the recorder to finish the replay\n   while (r->GetState() == TRecorder::kReplaying) {\n      gSystem->ProcessEvents();\n      gSystem->Sleep(1);\n   }\n\n   Int_t c1_ps_Ref  = 11255 , c1_ps_Err  = 100;\n   Int_t c1_C_Ref   =  4784 , c1_C_Err   = 100;\n   Int_t c2_gif_Ref = 20453 , c2_gif_Err = 100;\n   Int_t c2_C_Ref   = 35501 , c2_C_Err   = 100;\n\n   Int_t c1_ps  = file_size(\"c1.ps\");\n   Int_t c1_C   = file_size(\"c1.C\");\n   Int_t c2_gif = file_size(\"c2.gif\");\n   Int_t c2_C   = file_size(\"c2.C\");\n\n   cout << \"**********************************************************************\" <<endl;\n   cout << \"*  Report of graph_edit_playback.C                                   *\" <<endl;\n   cout << \"**********************************************************************\" <<endl;\n\n   if (TMath::Abs(c1_ps_Ref-c1_ps) <= c1_ps_Err) {\n      cout << \"Canvas c1: PS output............................................... OK\" <<endl;\n   } else {\n      cout << \"Canvas c1: PS output........................................... FAILED\" <<endl;\n   }\n   if (TMath::Abs(c1_C_Ref-c1_C) <= c1_C_Err) {\n      cout << \"           C output................................................ OK\" <<endl;\n   } else {\n      cout << \"           C output............................................ FAILED\" <<endl;\n   }\n   if (TMath::Abs(c2_gif_Ref-c2_gif) <= c2_gif_Err) {\n      cout << \"Canvas c2: GIF output.............................................. OK\" <<endl;\n   } else {\n      cout << \"Canvas c2: GIF output.......................................... FAILED\" <<endl;\n   }\n   if (TMath::Abs(c2_C_Ref-c2_C) <= c2_C_Err) {\n      cout << \"           C output................................................ OK\" <<endl;\n   } else {\n      cout << \"           C output............................................ FAILED\" <<endl;\n   }\n   cout << \"**********************************************************************\" <<endl;\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\/dreamview\/backend\/simulation_world\/simulation_world_updater.h\"\n\n#include <string>\n\n#include \"google\/protobuf\/util\/json_util.h\"\n#include \"modules\/dreamview\/backend\/common\/dreamview_gflags.h\"\n#include \"modules\/map\/hdmap\/hdmap_util.h\"\n\nnamespace apollo {\nnamespace dreamview {\n\nusing apollo::common::adapter::AdapterManager;\nusing apollo::common::monitor::MonitorMessageItem;\nusing apollo::routing::RoutingRequest;\nusing google::protobuf::util::MessageToJsonString;\nusing Json = nlohmann::json;\n\nSimulationWorldUpdater::SimulationWorldUpdater(WebSocketHandler *websocket,\n                                               const MapService *map_service,\n                                               bool routing_from_file)\n    : sim_world_service_(map_service, routing_from_file),\n      map_service_(map_service),\n      websocket_(websocket) {\n  \/\/ Initialize default end point\n  CHECK(apollo::common::util::GetProtoFromASCIIFile(\n      apollo::hdmap::EndWayPointFile(), &default_end_point_));\n\n  websocket_->RegisterMessageHandler(\n      \"RetrieveMapData\",\n      [this](const Json &json, WebSocketHandler::Connection *conn) {\n        auto iter = json.find(\"elements\");\n        if (iter != json.end()) {\n          MapElementIds map_element_ids(*iter);\n          auto retrieved = map_service_->RetrieveMapElements(map_element_ids);\n\n          std::string retrieved_json_string;\n          MessageToJsonString(retrieved, &retrieved_json_string);\n\n          Json response;\n          response[\"type\"] = \"MapData\";\n          response[\"data\"] = Json::parse(retrieved_json_string);\n\n          websocket_->SendData(response.dump(), conn);\n        }\n      });\n\n  websocket_->RegisterMessageHandler(\n      \"SendRoutingRequest\",\n      [this](const Json &json, WebSocketHandler::Connection *conn) {\n        RoutingRequest routing_request;\n        bool succeed = ConstructRoutingRequest(json, &routing_request);\n        if (succeed) {\n          AdapterManager::FillRoutingRequestHeader(FLAGS_dreamview_module_name,\n                                                   &routing_request);\n          AdapterManager::PublishRoutingRequest(routing_request);\n        }\n\n        \/\/ publish message\n        if (succeed) {\n          sim_world_service_.PublishMonitorMessage(MonitorMessageItem::INFO,\n                                                   \"Routing Request Sent\");\n        } else {\n          sim_world_service_.PublishMonitorMessage(\n              MonitorMessageItem::ERROR, \"Failed to send routing request\");\n        }\n      });\n}\n\nbool SimulationWorldUpdater::ConstructRoutingRequest(\n    const Json &json, RoutingRequest *routing_request) {\n  \/\/ set start point\n  auto start = json[\"start\"];\n  if (start.find(\"x\") == start.end() || start.find(\"y\") == start.end()) {\n    AERROR << \"Failed to prepare a routing request: start point not found\";\n    return false;\n  }\n  map_service_->ConstructLaneWayPoint(start[\"x\"], start[\"y\"],\n                                      routing_request->mutable_start());\n\n  \/\/ set way point(s) if any\n  auto iter = json.find(\"waypoint\");\n  if (iter != json.end()) {\n    auto *waypoint = routing_request->mutable_waypoint();\n    for (size_t i = 0; i < iter->size(); ++i) {\n      auto &point = (*iter)[i];\n      if (!map_service_->ConstructLaneWayPoint(point[\"x\"], point[\"y\"],\n                                               waypoint->Add())) {\n        waypoint->RemoveLast();\n      }\n    }\n  }\n\n  \/\/ set end point\n  RoutingRequest::LaneWaypoint *endLane = routing_request->mutable_end();\n  if (json[\"sendDefaultRoute\"]) {\n    endLane->set_id(default_end_point_.id());\n    endLane->set_s(default_end_point_.s());\n    auto *pose = endLane->mutable_pose();\n    pose->set_x(default_end_point_.pose().x());\n    pose->set_y(default_end_point_.pose().y());\n  } else {\n    auto end = json[\"end\"];\n    if (end.find(\"x\") == end.end() || end.find(\"y\") == end.end()) {\n      AERROR << \"Failed to prepare a routing request: end point not found\";\n      return false;\n    }\n    map_service_->ConstructLaneWayPoint(end[\"x\"], end[\"y\"], endLane);\n  }\n\n  return true;\n}\n\nvoid SimulationWorldUpdater::Start() {\n  \/\/ start ROS timer, one-shot = false, auto-start = true\n  timer_ =\n      AdapterManager::CreateTimer(ros::Duration(kSimWorldTimeInterval),\n                                  &SimulationWorldUpdater::OnPushTimer, this);\n}\n\nvoid SimulationWorldUpdater::OnPushTimer(const ros::TimerEvent &event) {\n  sim_world_service_.Update();\n  if (!sim_world_service_.ReadyToPush()) {\n    AWARN_EVERY(100)\n        << \"Not sending simulation world as the data is not ready!\";\n    return;\n  }\n  auto json = sim_world_service_.GetUpdateAsJson();\n  websocket_->BroadcastData(json.dump());\n}\n\n}  \/\/ namespace dreamview\n}  \/\/ namespace apollo\n<commit_msg>Dreamview: avoid crashing when default end point file is absent<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\/dreamview\/backend\/simulation_world\/simulation_world_updater.h\"\n\n#include <string>\n\n#include \"google\/protobuf\/util\/json_util.h\"\n#include \"modules\/dreamview\/backend\/common\/dreamview_gflags.h\"\n#include \"modules\/map\/hdmap\/hdmap_util.h\"\n\nnamespace apollo {\nnamespace dreamview {\n\nusing apollo::common::adapter::AdapterManager;\nusing apollo::common::monitor::MonitorMessageItem;\nusing apollo::common::util::GetProtoFromASCIIFile;\nusing apollo::hdmap::EndWayPointFile;\nusing apollo::routing::RoutingRequest;\nusing google::protobuf::util::MessageToJsonString;\nusing Json = nlohmann::json;\n\nSimulationWorldUpdater::SimulationWorldUpdater(WebSocketHandler *websocket,\n                                               const MapService *map_service,\n                                               bool routing_from_file)\n    : sim_world_service_(map_service, routing_from_file),\n      map_service_(map_service),\n      websocket_(websocket) {\n  \/\/ Initialize default end point\n  if (!GetProtoFromASCIIFile(EndWayPointFile(), &default_end_point_)) {\n    AWARN << \"Failed to load default end point from \" << EndWayPointFile();\n  }\n\n  websocket_->RegisterMessageHandler(\n      \"RetrieveMapData\",\n      [this](const Json &json, WebSocketHandler::Connection *conn) {\n        auto iter = json.find(\"elements\");\n        if (iter != json.end()) {\n          MapElementIds map_element_ids(*iter);\n          auto retrieved = map_service_->RetrieveMapElements(map_element_ids);\n\n          std::string retrieved_json_string;\n          MessageToJsonString(retrieved, &retrieved_json_string);\n\n          Json response;\n          response[\"type\"] = \"MapData\";\n          response[\"data\"] = Json::parse(retrieved_json_string);\n\n          websocket_->SendData(response.dump(), conn);\n        }\n      });\n\n  websocket_->RegisterMessageHandler(\n      \"SendRoutingRequest\",\n      [this](const Json &json, WebSocketHandler::Connection *conn) {\n        RoutingRequest routing_request;\n\n        bool succeed = ConstructRoutingRequest(json, &routing_request);\n        if (succeed) {\n          AdapterManager::FillRoutingRequestHeader(FLAGS_dreamview_module_name,\n                                                   &routing_request);\n          AdapterManager::PublishRoutingRequest(routing_request);\n        }\n\n        \/\/ publish message\n        if (succeed) {\n          sim_world_service_.PublishMonitorMessage(MonitorMessageItem::INFO,\n                                                   \"Routing Request Sent\");\n        } else {\n          sim_world_service_.PublishMonitorMessage(\n              MonitorMessageItem::ERROR, \"Failed to send routing request\");\n        }\n      });\n}\n\nbool SimulationWorldUpdater::ConstructRoutingRequest(\n    const Json &json, RoutingRequest *routing_request) {\n  \/\/ Try to reload end point if it hasn't be loaded yet.\n  if (!default_end_point_.has_id() &&\n      !GetProtoFromASCIIFile(EndWayPointFile(), &default_end_point_)) {\n    AERROR << \"Failed to load default end point from \" << EndWayPointFile();\n    return false;\n  }\n\n  \/\/ set start point\n  auto start = json[\"start\"];\n  if (start.find(\"x\") == start.end() || start.find(\"y\") == start.end()) {\n    AERROR << \"Failed to prepare a routing request: start point not found\";\n    return false;\n  }\n  map_service_->ConstructLaneWayPoint(start[\"x\"], start[\"y\"],\n                                      routing_request->mutable_start());\n\n  \/\/ set way point(s) if any\n  auto iter = json.find(\"waypoint\");\n  if (iter != json.end()) {\n    auto *waypoint = routing_request->mutable_waypoint();\n    for (size_t i = 0; i < iter->size(); ++i) {\n      auto &point = (*iter)[i];\n      if (!map_service_->ConstructLaneWayPoint(point[\"x\"], point[\"y\"],\n                                               waypoint->Add())) {\n        waypoint->RemoveLast();\n      }\n    }\n  }\n\n  \/\/ set end point\n  RoutingRequest::LaneWaypoint *endLane = routing_request->mutable_end();\n  if (json[\"sendDefaultRoute\"]) {\n    endLane->set_id(default_end_point_.id());\n    endLane->set_s(default_end_point_.s());\n    auto *pose = endLane->mutable_pose();\n    pose->set_x(default_end_point_.pose().x());\n    pose->set_y(default_end_point_.pose().y());\n  } else {\n    auto end = json[\"end\"];\n    if (end.find(\"x\") == end.end() || end.find(\"y\") == end.end()) {\n      AERROR << \"Failed to prepare a routing request: end point not found\";\n      return false;\n    }\n    map_service_->ConstructLaneWayPoint(end[\"x\"], end[\"y\"], endLane);\n  }\n\n  return true;\n}\n\nvoid SimulationWorldUpdater::Start() {\n  \/\/ start ROS timer, one-shot = false, auto-start = true\n  timer_ =\n      AdapterManager::CreateTimer(ros::Duration(kSimWorldTimeInterval),\n                                  &SimulationWorldUpdater::OnPushTimer, this);\n}\n\nvoid SimulationWorldUpdater::OnPushTimer(const ros::TimerEvent &event) {\n  sim_world_service_.Update();\n  if (!sim_world_service_.ReadyToPush()) {\n    AWARN_EVERY(100)\n        << \"Not sending simulation world as the data is not ready!\";\n    return;\n  }\n  auto json = sim_world_service_.GetUpdateAsJson();\n  websocket_->BroadcastData(json.dump());\n}\n\n}  \/\/ namespace dreamview\n}  \/\/ namespace apollo\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\/\/=====================================================================\/\/\n\/*!\t@file\n\t@brief\tI\/O ユーティリティー @n\n\t\t\tCopyright 2013,2014 Kunihito Hiramatsu\n\t@author\t平松邦仁 (hira@rvf-rc45.net)\n*\/\n\/\/=====================================================================\/\/\n#include <cstdint>\n\nnamespace device {\n\n\t\/\/ R8C(Tiny)\n\ttypedef uint16_t address_type;\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  ８ビット書き込み\n\t\t@param[in]\tadr\t\t書き込みアドレス\n\t\t@param[in]\tdata\t書き込みデータ\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\tstatic inline void wr8_(address_type adr, uint8_t data) {\n\t\t*reinterpret_cast<volatile uint8_t*>(adr) = data;\n\t}\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  ８ビット読み込み\n\t\t@param[in]\tadr\t\t読み込みアドレス\n\t\t@param[in]\tdata\t読み込みデータ\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\tstatic inline uint8_t rd8_(address_type adr) {\n\t\treturn *reinterpret_cast<volatile uint8_t*>(adr);\n\t}\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  １６ビット書き込み\n\t\t@param[in]\tadr\t\t書き込みアドレス\n\t\t@param[in]\tdata\t書き込みデータ\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\tstatic inline void wr16_(address_type adr, uint16_t data) {\n\t\t*reinterpret_cast<volatile uint16_t*>(adr) = data;\n\t}\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  １６ビット読み込み\n\t\t@param[in]\tadr\t\t読み込みアドレス\n\t\t@param[in]\tdata\t読み込みデータ\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\tstatic inline uint16_t rd16_(address_type adr) {\n\t\treturn *reinterpret_cast<volatile uint16_t*>(adr);\n\t}\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  ３２ビット書き込み\n\t\t@param[in]\tadr\t\t書き込みアドレス\n\t\t@param[in]\tdata\t書き込みデータ\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\tstatic inline void wr32_(address_type adr, uint32_t data) {\n\t\t*reinterpret_cast<volatile uint32_t*>(adr) = data;\n\t}\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  ３２ビット読み込み\n\t\t@param[in]\tadr\t\t読み込みアドレス\n\t\t@param[in]\tdata\t読み込みデータ\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\tstatic inline uint32_t rd32_(address_type adr) {\n\t\treturn *reinterpret_cast<volatile uint32_t*>(adr);\n\t}\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  8 bits アクセス・テンプレート\n\t\t@param[in]\tadr\tアドレス\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <address_type adr>\n\tstruct io8 {\n\t\ttypedef uint8_t value_type;\n\n\t\tstatic void write(uint8_t data) { wr8_(adr, data); }\n\t\tstatic uint8_t read() { return rd8_(adr); }\n\n\t\tvoid operator = (value_type data) const { write(data); }\n\t\tvalue_type operator () () const { return read(); }\n\t\tvoid operator |= (value_type data) const { write(read() | data); }\n\t\tvoid operator &= (value_type data) const { write(read() & data); }\n\t};\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  8 bits アクセス・テンプレート(RO)\n\t\t@param[in]\tadr\tアドレス\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <address_type adr>\n\tstruct io8_ro {\n\t\ttypedef uint8_t value_type;\n\n\t\tstatic uint8_t read() { return rd8_(adr); }\n\n\t\tvalue_type operator () () const { return read(); }\n\t};\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  16 bits アクセス・テンプレート\n\t\t@param[in]\tadr\tアドレス\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <address_type adr>\n\tstruct io16 {\n\t\ttypedef uint16_t value_type;\n\n\t\tstatic void write(uint16_t data) { wr16_(adr, data); }\n\t\tstatic uint16_t read() { return rd16_(adr); }\n\n\t\tvoid operator = (value_type data) const { write(data); }\n\t\tvalue_type operator () () const { return read(); }\n\t\tvoid operator |= (value_type data) const { write(read() | data); }\n\t\tvoid operator &= (value_type data) const { write(read() & data); }\n\t};\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  16 bits アクセス・テンプレート(RO)\n\t\t@param[in]\tadr\tアドレス\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <address_type adr>\n\tstruct io16_ro {\n\t\ttypedef uint16_t value_type;\n\n\t\tstatic uint16_t read() { return rd16_(adr); }\n\n\t\tvalue_type operator () () const { return read(); }\n\t};\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  32 bits アクセス・テンプレート\n\t\t@param[in]\tadr\tアドレス\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <address_type adr>\n\tstruct io32 {\n\t\ttypedef uint32_t\tvalue_type;\n\n\t\tstatic void write(uint32_t data) { wr32_(adr, data); }\n\t\tstatic uint32_t read() { return rd32_(adr); }\n\n\t\tvoid operator = (value_type data) const { write(data); }\n\t\tvalue_type operator () () const { return read(); }\n\t\tvoid operator |= (value_type data) const { write(read() | data); }\n\t\tvoid operator &= (value_type data) const { write(read() & data); }\n\t};\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  １ビット・アクセス・テンプレート(R\/W direct)\n\t\t@param[in]\tT\tアクセス・クラス\n\t\t@param[in]\tpos\tビット位置\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class T, uint8_t pos>\n\tstruct bit {\n\t\tstatic bool get() {\n\t\t\treturn (T::read() & (1 << pos)) != 0;\n\t\t}\n\t\tstatic void set(bool v) {\n\t\t\tT::write(v << pos);\n\t\t}\n\n\t    typename T::value_type b(bool f = true) const {\n\t\t\treturn f << pos;\n\t\t}\n\n\t\tvoid operator = (bool v) const { set(v); }\n\t\tbool operator () () const { return get(); }\n\t};\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  １ビット・アクセス・テンプレート(R\/W)\n\t\t@param[in]\tT\tアクセス・クラス\n\t\t@param[in]\tpos\tビット位置\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class T, uint8_t pos>\n\tstruct bit_t {\n\t\tstatic bool get() {\n\t\t\treturn (T::read() & (1 << pos)) != 0;\n\t\t}\n\t\tstatic void set(bool v) {\n\t\t\tT::write((T::read() & ~(1 << pos)) | (v << pos));\n\t\t}\n\n\t    typename T::value_type b(bool v = true) const {\n\t\t\treturn v << pos;\n\t\t}\n\n\t\tvoid operator = (bool v) const { set(v); }\n\t\tbool operator () () const { return get(); }\n\t};\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  ビット・アクセス・テンプレート(R\/W direct)\n\t\t@param[in]\tT\tアクセス・クラス\n\t\t@param[in]\tpos\t初期位置\n\t\t@param[in]\tlen\tビット幅\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class T, uint8_t pos, uint8_t len>\n\tstruct bits {\n\t\tstatic typename T::value_type get() {\n\t\t\treturn (T::read() >> pos) & ((1 << len) - 1);\n\t\t}\n\t\tstatic void set(typename T::value_type v) {\n\t\t\tT::write(v << pos);\n\t\t}\n\n\t    typename T::value_type b(typename T::value_type v) const { return v << pos; }\n\n\t\tvoid operator = (typename T::value_type v) const { set(v); }\n\t\ttypename T::value_type operator () () const { return get(); }\n\t};\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  ビット・アクセス・テンプレート(R\/W)\n\t\t@param[in]\tT\tアクセス・クラス\n\t\t@param[in]\tpos\t初期位置\n\t\t@param[in]\tlen\tビット幅\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class T, uint8_t pos, uint8_t len>\n\tstruct bits_t {\n\t\tstatic typename T::value_type get() {\n\t\t\treturn (T::read() >> pos) & ((1 << len) - 1);\n\t\t}\n\t\tstatic void set(typename T::value_type v) {\n\t\t\ttypename T::value_type m = ((1 << static_cast<typename T::value_type>(len)) - 1) << pos;\n\t\t\tT::write((T::read() & ~m) | (v << pos));\n\t\t}\n\n\t    typename T::value_type b(typename T::value_type v) const { return v << pos; }\n\n\t\tvoid operator = (typename T::value_type v) const { set(v); }\n\t\ttypename T::value_type operator () () const { return get(); }\n\t};\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  １ビット・アクセス・テンプレート(RO)\n\t\t@param[in]\tT\tアクセス・クラス\n\t\t@param[in]\tpos\tビット位置\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class T, uint8_t pos>\n\tstruct bit_ro_t {\n\t\tstatic bool get() {\n\t\t\treturn T::read() & (1 << pos);\n\t\t}\n\n\t\tbool operator () () const { return get(); }\n\t};\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  ビット・アクセス・テンプレート(RO)\n\t\t@param[in]\tT\tアクセス・クラス\n\t\t@param[in]\tpos\t初期位置\n\t\t@param[in]\tlen\tビット幅\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class T, uint8_t pos, uint8_t len>\n\tstruct bits_ro_t {\n\t\tstatic typename T::value_type get() {\n\t\t\treturn (T::read() >> pos) & ((1 << len) - 1);\n\t\t}\n\t\ttypename T::value_type operator () () const { return get(); }\n\t};\n}\n<commit_msg>ビット設定で「型」を規定可能に改修<commit_after>#pragma once\n\/\/=====================================================================\/\/\n\/*!\t@file\n\t@brief\tI\/O ユーティリティー @n\n\t\t\tCopyright 2013,2014 Kunihito Hiramatsu\n\t@author\t平松邦仁 (hira@rvf-rc45.net)\n*\/\n\/\/=====================================================================\/\/\n#include <cstdint>\n\nnamespace device {\n\n\t\/\/ R8C(Tiny)\n\ttypedef uint16_t address_type;\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  ８ビット書き込み\n\t\t@param[in]\tadr\t\t書き込みアドレス\n\t\t@param[in]\tdata\t書き込みデータ\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\tstatic inline void wr8_(address_type adr, uint8_t data) {\n\t\t*reinterpret_cast<volatile uint8_t*>(adr) = data;\n\t}\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  ８ビット読み込み\n\t\t@param[in]\tadr\t\t読み込みアドレス\n\t\t@param[in]\tdata\t読み込みデータ\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\tstatic inline uint8_t rd8_(address_type adr) {\n\t\treturn *reinterpret_cast<volatile uint8_t*>(adr);\n\t}\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  １６ビット書き込み\n\t\t@param[in]\tadr\t\t書き込みアドレス\n\t\t@param[in]\tdata\t書き込みデータ\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\tstatic inline void wr16_(address_type adr, uint16_t data) {\n\t\t*reinterpret_cast<volatile uint16_t*>(adr) = data;\n\t}\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  １６ビット読み込み\n\t\t@param[in]\tadr\t\t読み込みアドレス\n\t\t@param[in]\tdata\t読み込みデータ\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\tstatic inline uint16_t rd16_(address_type adr) {\n\t\treturn *reinterpret_cast<volatile uint16_t*>(adr);\n\t}\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  ３２ビット書き込み\n\t\t@param[in]\tadr\t\t書き込みアドレス\n\t\t@param[in]\tdata\t書き込みデータ\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\tstatic inline void wr32_(address_type adr, uint32_t data) {\n\t\t*reinterpret_cast<volatile uint32_t*>(adr) = data;\n\t}\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  ３２ビット読み込み\n\t\t@param[in]\tadr\t\t読み込みアドレス\n\t\t@param[in]\tdata\t読み込みデータ\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\tstatic inline uint32_t rd32_(address_type adr) {\n\t\treturn *reinterpret_cast<volatile uint32_t*>(adr);\n\t}\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  8 bits アクセス・テンプレート\n\t\t@param[in]\tadr\tアドレス\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <address_type adr>\n\tstruct io8 {\n\t\ttypedef uint8_t value_type;\n\n\t\tstatic void write(uint8_t data) { wr8_(adr, data); }\n\t\tstatic uint8_t read() { return rd8_(adr); }\n\n\t\tvoid operator = (value_type data) const { write(data); }\n\t\tvalue_type operator () () const { return read(); }\n\t\tvoid operator |= (value_type data) const { write(read() | data); }\n\t\tvoid operator &= (value_type data) const { write(read() & data); }\n\t};\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  8 bits アクセス・テンプレート(RO)\n\t\t@param[in]\tadr\tアドレス\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <address_type adr>\n\tstruct io8_ro {\n\t\ttypedef uint8_t value_type;\n\n\t\tstatic uint8_t read() { return rd8_(adr); }\n\n\t\tvalue_type operator () () const { return read(); }\n\t};\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  16 bits アクセス・テンプレート\n\t\t@param[in]\tadr\tアドレス\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <address_type adr>\n\tstruct io16 {\n\t\ttypedef uint16_t value_type;\n\n\t\tstatic void write(uint16_t data) { wr16_(adr, data); }\n\t\tstatic uint16_t read() { return rd16_(adr); }\n\n\t\tvoid operator = (value_type data) const { write(data); }\n\t\tvalue_type operator () () const { return read(); }\n\t\tvoid operator |= (value_type data) const { write(read() | data); }\n\t\tvoid operator &= (value_type data) const { write(read() & data); }\n\t};\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  16 bits アクセス・テンプレート(RO)\n\t\t@param[in]\tadr\tアドレス\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <address_type adr>\n\tstruct io16_ro {\n\t\ttypedef uint16_t value_type;\n\n\t\tstatic uint16_t read() { return rd16_(adr); }\n\n\t\tvalue_type operator () () const { return read(); }\n\t};\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  32 bits アクセス・テンプレート\n\t\t@param[in]\tadr\tアドレス\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <address_type adr>\n\tstruct io32 {\n\t\ttypedef uint32_t\tvalue_type;\n\n\t\tstatic void write(uint32_t data) { wr32_(adr, data); }\n\t\tstatic uint32_t read() { return rd32_(adr); }\n\n\t\tvoid operator = (value_type data) const { write(data); }\n\t\tvalue_type operator () () const { return read(); }\n\t\tvoid operator |= (value_type data) const { write(read() | data); }\n\t\tvoid operator &= (value_type data) const { write(read() & data); }\n\t};\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  １ビット・アクセス・テンプレート(R\/W direct)\n\t\t@param[in]\tT\tアクセス・クラス\n\t\t@param[in]\tpos\tビット位置\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class T, uint8_t pos>\n\tstruct bit {\n\t\tstatic bool get() {\n\t\t\treturn (T::read() & (1 << pos)) != 0;\n\t\t}\n\t\tstatic void set(bool v) {\n\t\t\tT::write(v << pos);\n\t\t}\n\n\t    typename T::value_type b(bool f = true) const {\n\t\t\treturn f << pos;\n\t\t}\n\n\t\tvoid operator = (bool v) const { set(v); }\n\t\tbool operator () () const { return get(); }\n\t};\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  １ビット・アクセス・テンプレート(R\/W)\n\t\t@param[in]\tT\tアクセス・クラス\n\t\t@param[in]\tpos\tビット位置\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class T, uint8_t pos>\n\tstruct bit_t {\n\t\tstatic bool get() {\n\t\t\treturn (T::read() & (1 << pos)) != 0;\n\t\t}\n\t\tstatic void set(bool v) {\n\t\t\tT::write((T::read() & ~(1 << pos)) | (v << pos));\n\t\t}\n\n\t    typename T::value_type b(bool v = true) const {\n\t\t\treturn v << pos;\n\t\t}\n\n\t\tvoid operator = (bool v) const { set(v); }\n\t\tbool operator () () const { return get(); }\n\t};\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  ビット・アクセス・テンプレート(R\/W direct)\n\t\t@param[in]\tT\tアクセス・クラス\n\t\t@param[in]\tpos\t初期位置\n\t\t@param[in]\tlen\tビット幅\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class T, uint8_t pos, uint8_t len>\n\tstruct bits {\n\t\tstatic typename T::value_type get() {\n\t\t\treturn (T::read() >> pos) & ((1 << len) - 1);\n\t\t}\n\t\tstatic void set(typename T::value_type v) {\n\t\t\tT::write(v << pos);\n\t\t}\n\n\t    typename T::value_type b(typename T::value_type v) const { return v << pos; }\n\n\t\tvoid operator = (typename T::value_type v) const { set(v); }\n\t\ttypename T::value_type operator () () const { return get(); }\n\t};\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  ビット・アクセス・テンプレート(R\/W)\n\t\t@param[in]\tT\tアクセス・クラス\n\t\t@param[in]\tpos\t初期位置\n\t\t@param[in]\tlen\tビット幅\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class T, uint8_t pos, uint8_t len, typename R = typename T::value_type>\n\tstruct bits_t {\n\t\tstatic R get() {\n\t\t\treturn static_cast<R>(T::read() >> pos) & ((1 << len) - 1);\n\t\t}\n\t\tstatic void set(R v) {\n\t\t\ttypename T::value_type m = ((1 << static_cast<typename T::value_type>(len)) - 1) << pos;\n\t\t\tT::write((T::read() & ~m) | (static_cast<typename T::value_type>(v) << pos));\n\t\t}\n\n\t    R b(R v) const { return v << pos; }\n\n\t\tvoid operator = (R v) const { set(v); }\n\t\tR operator () () const { return get(); }\n\t};\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  １ビット・アクセス・テンプレート(RO)\n\t\t@param[in]\tT\tアクセス・クラス\n\t\t@param[in]\tpos\tビット位置\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class T, uint8_t pos>\n\tstruct bit_ro_t {\n\t\tstatic bool get() {\n\t\t\treturn T::read() & (1 << pos);\n\t\t}\n\n\t\tbool operator () () const { return get(); }\n\t};\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief  ビット・アクセス・テンプレート(RO)\n\t\t@param[in]\tT\tアクセス・クラス\n\t\t@param[in]\tpos\t初期位置\n\t\t@param[in]\tlen\tビット幅\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class T, uint8_t pos, uint8_t len>\n\tstruct bits_ro_t {\n\t\tstatic typename T::value_type get() {\n\t\t\treturn (T::read() >> pos) & ((1 << len) - 1);\n\t\t}\n\t\ttypename T::value_type operator () () const { return get(); }\n\t};\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Licensed to the Apache Software Foundation (ASF) under one\n\/\/ or more contributor license agreements.  See the NOTICE file\n\/\/ distributed with this work for additional information\n\/\/ regarding copyright ownership.  The ASF licenses this file\n\/\/ to you under the Apache License, Version 2.0 (the\n\/\/ \"License\"); you may not use this file except in compliance\n\/\/ with the License.  You may obtain a copy of the License at\n\/\/\n\/\/   http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing,\n\/\/ software distributed under the License is distributed on an\n\/\/ \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n\/\/ KIND, either express or implied.  See the License for the\n\/\/ specific language governing permissions and limitations\n\/\/ under the License.\n\n#include \"parquet\/file\/reader-internal.h\"\n\n#include <string.h>\n#include <algorithm>\n#include <exception>\n#include <ostream>\n#include <string>\n#include <vector>\n\n#include \"parquet\/column\/page.h\"\n#include \"parquet\/compression\/codec.h\"\n#include \"parquet\/exception.h\"\n#include \"parquet\/schema\/converter.h\"\n#include \"parquet\/schema\/descriptor.h\"\n#include \"parquet\/schema\/types.h\"\n#include \"parquet\/thrift\/util.h\"\n#include \"parquet\/types.h\"\n#include \"parquet\/util\/buffer.h\"\n#include \"parquet\/util\/input.h\"\n\nnamespace parquet {\n\n\/\/ ----------------------------------------------------------------------\n\/\/ SerializedPageReader deserializes Thrift metadata and pages that have been\n\/\/ assembled in a serialized stream for storing in a Parquet files\n\nSerializedPageReader::SerializedPageReader(std::unique_ptr<InputStream> stream,\n    Compression::type codec_type, MemoryAllocator* allocator)\n    : stream_(std::move(stream)), decompression_buffer_(0, allocator) {\n  max_page_header_size_ = DEFAULT_MAX_PAGE_HEADER_SIZE;\n  decompressor_ = Codec::Create(codec_type);\n}\n\nstd::shared_ptr<Page> SerializedPageReader::NextPage() {\n  \/\/ Loop here because there may be unhandled page types that we skip until\n  \/\/ finding a page that we do know what to do with\n  while (true) {\n    int64_t bytes_read = 0;\n    int64_t bytes_available = 0;\n    uint32_t header_size = 0;\n    const uint8_t* buffer;\n    uint32_t allowed_page_size = DEFAULT_PAGE_HEADER_SIZE;\n    std::stringstream ss;\n\n    \/\/ Page headers can be very large because of page statistics\n    \/\/ We try to deserialize a larger buffer progressively\n    \/\/ until a maximum allowed header limit\n    while (true) {\n      buffer = stream_->Peek(allowed_page_size, &bytes_available);\n      if (bytes_available == 0) { return std::shared_ptr<Page>(nullptr); }\n\n      \/\/ This gets used, then set by DeserializeThriftMsg\n      header_size = bytes_available;\n      try {\n        DeserializeThriftMsg(buffer, &header_size, &current_page_header_);\n        break;\n      } catch (std::exception& e) {\n        \/\/ Failed to deserialize. Double the allowed page header size and try again\n        ss << e.what();\n        allowed_page_size *= 2;\n        if (allowed_page_size > max_page_header_size_) {\n          ss << \"Deserializing page header failed.\\n\";\n          throw ParquetException(ss.str());\n        }\n      }\n    }\n    \/\/ Advance the stream offset\n    stream_->Advance(header_size);\n\n    int compressed_len = current_page_header_.compressed_page_size;\n    int uncompressed_len = current_page_header_.uncompressed_page_size;\n\n    \/\/ Read the compressed data page.\n    buffer = stream_->Read(compressed_len, &bytes_read);\n    if (bytes_read != compressed_len) ParquetException::EofException();\n\n    \/\/ Uncompress it if we need to\n    if (decompressor_ != NULL) {\n      \/\/ Grow the uncompressed buffer if we need to.\n      if (uncompressed_len > static_cast<int>(decompression_buffer_.size())) {\n        decompression_buffer_.Resize(uncompressed_len);\n      }\n      decompressor_->Decompress(\n          compressed_len, buffer, uncompressed_len, &decompression_buffer_[0]);\n      buffer = &decompression_buffer_[0];\n    }\n\n    auto page_buffer = std::make_shared<Buffer>(buffer, uncompressed_len);\n\n    if (current_page_header_.type == format::PageType::DICTIONARY_PAGE) {\n      const format::DictionaryPageHeader& dict_header =\n          current_page_header_.dictionary_page_header;\n\n      bool is_sorted = dict_header.__isset.is_sorted ? dict_header.is_sorted : false;\n\n      return std::make_shared<DictionaryPage>(page_buffer, dict_header.num_values,\n          FromThrift(dict_header.encoding), is_sorted);\n    } else if (current_page_header_.type == format::PageType::DATA_PAGE) {\n      const format::DataPageHeader& header = current_page_header_.data_page_header;\n\n      auto page = std::make_shared<DataPage>(page_buffer, header.num_values,\n          FromThrift(header.encoding), FromThrift(header.definition_level_encoding),\n          FromThrift(header.repetition_level_encoding));\n\n      if (header.__isset.statistics) {\n        const format::Statistics stats = header.statistics;\n        if (stats.__isset.max) { page->max_ = stats.max; }\n        if (stats.__isset.min) { page->min_ = stats.min; }\n      }\n      return page;\n    } else if (current_page_header_.type == format::PageType::DATA_PAGE_V2) {\n      const format::DataPageHeaderV2& header = current_page_header_.data_page_header_v2;\n      bool is_compressed = header.__isset.is_compressed ? header.is_compressed : false;\n      return std::make_shared<DataPageV2>(page_buffer, header.num_values,\n          header.num_nulls, header.num_rows, FromThrift(header.encoding),\n          header.definition_levels_byte_length, header.repetition_levels_byte_length,\n          is_compressed);\n    } else {\n      \/\/ We don't know what this page type is. We're allowed to skip non-data\n      \/\/ pages.\n      continue;\n    }\n  }\n  return std::shared_ptr<Page>(nullptr);\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/ SerializedRowGroup\n\nint64_t SerializedRowGroup::num_rows() const {\n  return metadata_->num_rows;\n}\n\nint SerializedRowGroup::num_columns() const {\n  return metadata_->columns.size();\n}\n\nstd::unique_ptr<PageReader> SerializedRowGroup::GetColumnPageReader(int i) {\n  \/\/ Read column chunk from the file\n  const format::ColumnChunk& col = metadata_->columns[i];\n\n  int64_t col_start = col.meta_data.data_page_offset;\n  if (col.meta_data.__isset.dictionary_page_offset &&\n      col_start > col.meta_data.dictionary_page_offset) {\n    col_start = col.meta_data.dictionary_page_offset;\n  }\n\n  int64_t bytes_to_read = col.meta_data.total_compressed_size;\n  std::unique_ptr<InputStream> stream;\n\n  stream = properties_.GetStream(source_, col_start, bytes_to_read);\n\n  return std::unique_ptr<PageReader>(new SerializedPageReader(\n      std::move(stream), FromThrift(col.meta_data.codec), properties_.allocator()));\n}\n\nRowGroupStatistics SerializedRowGroup::GetColumnStats(int i) const {\n  const format::ColumnMetaData& meta_data = metadata_->columns[i].meta_data;\n\n  RowGroupStatistics result;\n  result.num_values = meta_data.num_values;\n  result.null_count = meta_data.statistics.null_count;\n  result.distinct_count = meta_data.statistics.distinct_count;\n  result.max = &meta_data.statistics.max;\n  result.min = &meta_data.statistics.min;\n  return result;\n}\n\nbool SerializedRowGroup::IsColumnStatsSet(int i) const {\n  const format::ColumnMetaData& meta_data = metadata_->columns[i].meta_data;\n  return meta_data.__isset.statistics;\n}\n\nCompression::type SerializedRowGroup::GetColumnCompression(int i) const {\n  const format::ColumnMetaData& meta_data = metadata_->columns[i].meta_data;\n  return FromThrift(meta_data.codec);\n}\n\nstd::vector<Encoding::type> SerializedRowGroup::GetColumnEncodings(int i) const {\n  const format::ColumnMetaData& meta_data = metadata_->columns[i].meta_data;\n\n  std::vector<Encoding::type> encodings;\n  for (auto encoding : meta_data.encodings) {\n    encodings.push_back(FromThrift(encoding));\n  }\n  return encodings;\n}\n\nint64_t SerializedRowGroup::GetColumnUnCompressedSize(int i) const {\n  const format::ColumnMetaData& meta_data = metadata_->columns[i].meta_data;\n  return meta_data.total_uncompressed_size;\n}\n\nint64_t SerializedRowGroup::GetColumnCompressedSize(int i) const {\n  const format::ColumnMetaData& meta_data = metadata_->columns[i].meta_data;\n  return meta_data.total_compressed_size;\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/ SerializedFile: Parquet on-disk layout\n\nstatic constexpr uint32_t FOOTER_SIZE = 8;\nstatic constexpr uint8_t PARQUET_MAGIC[4] = {'P', 'A', 'R', '1'};\n\nstd::unique_ptr<ParquetFileReader::Contents> SerializedFile::Open(\n    std::unique_ptr<RandomAccessSource> source, ReaderProperties props) {\n  std::unique_ptr<ParquetFileReader::Contents> result(\n      new SerializedFile(std::move(source), props));\n\n  \/\/ Access private methods here, but otherwise unavailable\n  SerializedFile* file = static_cast<SerializedFile*>(result.get());\n\n  \/\/ Validates magic bytes, parses metadata, and initializes the SchemaDescriptor\n  file->ParseMetaData();\n\n  return result;\n}\n\nvoid SerializedFile::Close() {\n  source_->Close();\n}\n\nSerializedFile::~SerializedFile() {\n  Close();\n}\n\nstd::shared_ptr<RowGroupReader> SerializedFile::GetRowGroup(int i) {\n  std::unique_ptr<SerializedRowGroup> contents(\n      new SerializedRowGroup(source_.get(), &metadata_.row_groups[i], properties_));\n\n  return std::make_shared<RowGroupReader>(\n      &schema_, std::move(contents), properties_.allocator());\n}\n\nint64_t SerializedFile::num_rows() const {\n  return metadata_.num_rows;\n}\n\nint SerializedFile::num_columns() const {\n  return schema_.num_columns();\n}\n\nint SerializedFile::num_row_groups() const {\n  return metadata_.row_groups.size();\n}\n\nSerializedFile::SerializedFile(std::unique_ptr<RandomAccessSource> source,\n    ReaderProperties props = default_reader_properties())\n    : source_(std::move(source)), properties_(props) {}\n\nvoid SerializedFile::ParseMetaData() {\n  int64_t filesize = source_->Size();\n\n  if (filesize < FOOTER_SIZE) {\n    throw ParquetException(\"Corrupted file, smaller than file footer\");\n  }\n\n  uint8_t footer_buffer[FOOTER_SIZE];\n  source_->Seek(filesize - FOOTER_SIZE);\n  int64_t bytes_read = source_->Read(FOOTER_SIZE, footer_buffer);\n  if (bytes_read != FOOTER_SIZE || memcmp(footer_buffer + 4, PARQUET_MAGIC, 4) != 0) {\n    throw ParquetException(\"Invalid parquet file. Corrupt footer.\");\n  }\n\n  uint32_t metadata_len = *reinterpret_cast<uint32_t*>(footer_buffer);\n  int64_t metadata_start = filesize - FOOTER_SIZE - metadata_len;\n  if (FOOTER_SIZE + metadata_len > filesize) {\n    throw ParquetException(\n        \"Invalid parquet file. File is less than \"\n        \"file metadata size.\");\n  }\n  source_->Seek(metadata_start);\n\n  OwnedMutableBuffer metadata_buffer(metadata_len, properties_.allocator());\n  bytes_read = source_->Read(metadata_len, &metadata_buffer[0]);\n  if (bytes_read != metadata_len) {\n    throw ParquetException(\"Invalid parquet file. Could not read metadata bytes.\");\n  }\n  DeserializeThriftMsg(&metadata_buffer[0], &metadata_len, &metadata_);\n\n  schema::FlatSchemaConverter converter(&metadata_.schema[0], metadata_.schema.size());\n  schema_.Init(converter.Convert());\n}\n\n}  \/\/ namespace parquet\n<commit_msg>PARQUET-641: Instantiate stringstream only if needed in SerializedPageReader::NextPage<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 \"parquet\/file\/reader-internal.h\"\n\n#include <string.h>\n#include <algorithm>\n#include <exception>\n#include <ostream>\n#include <string>\n#include <vector>\n\n#include \"parquet\/column\/page.h\"\n#include \"parquet\/compression\/codec.h\"\n#include \"parquet\/exception.h\"\n#include \"parquet\/schema\/converter.h\"\n#include \"parquet\/schema\/descriptor.h\"\n#include \"parquet\/schema\/types.h\"\n#include \"parquet\/thrift\/util.h\"\n#include \"parquet\/types.h\"\n#include \"parquet\/util\/buffer.h\"\n#include \"parquet\/util\/input.h\"\n\nnamespace parquet {\n\n\/\/ ----------------------------------------------------------------------\n\/\/ SerializedPageReader deserializes Thrift metadata and pages that have been\n\/\/ assembled in a serialized stream for storing in a Parquet files\n\nSerializedPageReader::SerializedPageReader(std::unique_ptr<InputStream> stream,\n    Compression::type codec_type, MemoryAllocator* allocator)\n    : stream_(std::move(stream)), decompression_buffer_(0, allocator) {\n  max_page_header_size_ = DEFAULT_MAX_PAGE_HEADER_SIZE;\n  decompressor_ = Codec::Create(codec_type);\n}\n\nstd::shared_ptr<Page> SerializedPageReader::NextPage() {\n  \/\/ Loop here because there may be unhandled page types that we skip until\n  \/\/ finding a page that we do know what to do with\n  while (true) {\n    int64_t bytes_read = 0;\n    int64_t bytes_available = 0;\n    uint32_t header_size = 0;\n    const uint8_t* buffer;\n    uint32_t allowed_page_size = DEFAULT_PAGE_HEADER_SIZE;\n\n    \/\/ Page headers can be very large because of page statistics\n    \/\/ We try to deserialize a larger buffer progressively\n    \/\/ until a maximum allowed header limit\n    while (true) {\n      buffer = stream_->Peek(allowed_page_size, &bytes_available);\n      if (bytes_available == 0) { return std::shared_ptr<Page>(nullptr); }\n\n      \/\/ This gets used, then set by DeserializeThriftMsg\n      header_size = bytes_available;\n      try {\n        DeserializeThriftMsg(buffer, &header_size, &current_page_header_);\n        break;\n      } catch (std::exception& e) {\n        \/\/ Failed to deserialize. Double the allowed page header size and try again\n        std::stringstream ss;\n        ss << e.what();\n        allowed_page_size *= 2;\n        if (allowed_page_size > max_page_header_size_) {\n          ss << \"Deserializing page header failed.\\n\";\n          throw ParquetException(ss.str());\n        }\n      }\n    }\n    \/\/ Advance the stream offset\n    stream_->Advance(header_size);\n\n    int compressed_len = current_page_header_.compressed_page_size;\n    int uncompressed_len = current_page_header_.uncompressed_page_size;\n\n    \/\/ Read the compressed data page.\n    buffer = stream_->Read(compressed_len, &bytes_read);\n    if (bytes_read != compressed_len) ParquetException::EofException();\n\n    \/\/ Uncompress it if we need to\n    if (decompressor_ != NULL) {\n      \/\/ Grow the uncompressed buffer if we need to.\n      if (uncompressed_len > static_cast<int>(decompression_buffer_.size())) {\n        decompression_buffer_.Resize(uncompressed_len);\n      }\n      decompressor_->Decompress(\n          compressed_len, buffer, uncompressed_len, &decompression_buffer_[0]);\n      buffer = &decompression_buffer_[0];\n    }\n\n    auto page_buffer = std::make_shared<Buffer>(buffer, uncompressed_len);\n\n    if (current_page_header_.type == format::PageType::DICTIONARY_PAGE) {\n      const format::DictionaryPageHeader& dict_header =\n          current_page_header_.dictionary_page_header;\n\n      bool is_sorted = dict_header.__isset.is_sorted ? dict_header.is_sorted : false;\n\n      return std::make_shared<DictionaryPage>(page_buffer, dict_header.num_values,\n          FromThrift(dict_header.encoding), is_sorted);\n    } else if (current_page_header_.type == format::PageType::DATA_PAGE) {\n      const format::DataPageHeader& header = current_page_header_.data_page_header;\n\n      auto page = std::make_shared<DataPage>(page_buffer, header.num_values,\n          FromThrift(header.encoding), FromThrift(header.definition_level_encoding),\n          FromThrift(header.repetition_level_encoding));\n\n      if (header.__isset.statistics) {\n        const format::Statistics stats = header.statistics;\n        if (stats.__isset.max) { page->max_ = stats.max; }\n        if (stats.__isset.min) { page->min_ = stats.min; }\n      }\n      return page;\n    } else if (current_page_header_.type == format::PageType::DATA_PAGE_V2) {\n      const format::DataPageHeaderV2& header = current_page_header_.data_page_header_v2;\n      bool is_compressed = header.__isset.is_compressed ? header.is_compressed : false;\n      return std::make_shared<DataPageV2>(page_buffer, header.num_values,\n          header.num_nulls, header.num_rows, FromThrift(header.encoding),\n          header.definition_levels_byte_length, header.repetition_levels_byte_length,\n          is_compressed);\n    } else {\n      \/\/ We don't know what this page type is. We're allowed to skip non-data\n      \/\/ pages.\n      continue;\n    }\n  }\n  return std::shared_ptr<Page>(nullptr);\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/ SerializedRowGroup\n\nint64_t SerializedRowGroup::num_rows() const {\n  return metadata_->num_rows;\n}\n\nint SerializedRowGroup::num_columns() const {\n  return metadata_->columns.size();\n}\n\nstd::unique_ptr<PageReader> SerializedRowGroup::GetColumnPageReader(int i) {\n  \/\/ Read column chunk from the file\n  const format::ColumnChunk& col = metadata_->columns[i];\n\n  int64_t col_start = col.meta_data.data_page_offset;\n  if (col.meta_data.__isset.dictionary_page_offset &&\n      col_start > col.meta_data.dictionary_page_offset) {\n    col_start = col.meta_data.dictionary_page_offset;\n  }\n\n  int64_t bytes_to_read = col.meta_data.total_compressed_size;\n  std::unique_ptr<InputStream> stream;\n\n  stream = properties_.GetStream(source_, col_start, bytes_to_read);\n\n  return std::unique_ptr<PageReader>(new SerializedPageReader(\n      std::move(stream), FromThrift(col.meta_data.codec), properties_.allocator()));\n}\n\nRowGroupStatistics SerializedRowGroup::GetColumnStats(int i) const {\n  const format::ColumnMetaData& meta_data = metadata_->columns[i].meta_data;\n\n  RowGroupStatistics result;\n  result.num_values = meta_data.num_values;\n  result.null_count = meta_data.statistics.null_count;\n  result.distinct_count = meta_data.statistics.distinct_count;\n  result.max = &meta_data.statistics.max;\n  result.min = &meta_data.statistics.min;\n  return result;\n}\n\nbool SerializedRowGroup::IsColumnStatsSet(int i) const {\n  const format::ColumnMetaData& meta_data = metadata_->columns[i].meta_data;\n  return meta_data.__isset.statistics;\n}\n\nCompression::type SerializedRowGroup::GetColumnCompression(int i) const {\n  const format::ColumnMetaData& meta_data = metadata_->columns[i].meta_data;\n  return FromThrift(meta_data.codec);\n}\n\nstd::vector<Encoding::type> SerializedRowGroup::GetColumnEncodings(int i) const {\n  const format::ColumnMetaData& meta_data = metadata_->columns[i].meta_data;\n\n  std::vector<Encoding::type> encodings;\n  for (auto encoding : meta_data.encodings) {\n    encodings.push_back(FromThrift(encoding));\n  }\n  return encodings;\n}\n\nint64_t SerializedRowGroup::GetColumnUnCompressedSize(int i) const {\n  const format::ColumnMetaData& meta_data = metadata_->columns[i].meta_data;\n  return meta_data.total_uncompressed_size;\n}\n\nint64_t SerializedRowGroup::GetColumnCompressedSize(int i) const {\n  const format::ColumnMetaData& meta_data = metadata_->columns[i].meta_data;\n  return meta_data.total_compressed_size;\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/ SerializedFile: Parquet on-disk layout\n\nstatic constexpr uint32_t FOOTER_SIZE = 8;\nstatic constexpr uint8_t PARQUET_MAGIC[4] = {'P', 'A', 'R', '1'};\n\nstd::unique_ptr<ParquetFileReader::Contents> SerializedFile::Open(\n    std::unique_ptr<RandomAccessSource> source, ReaderProperties props) {\n  std::unique_ptr<ParquetFileReader::Contents> result(\n      new SerializedFile(std::move(source), props));\n\n  \/\/ Access private methods here, but otherwise unavailable\n  SerializedFile* file = static_cast<SerializedFile*>(result.get());\n\n  \/\/ Validates magic bytes, parses metadata, and initializes the SchemaDescriptor\n  file->ParseMetaData();\n\n  return result;\n}\n\nvoid SerializedFile::Close() {\n  source_->Close();\n}\n\nSerializedFile::~SerializedFile() {\n  Close();\n}\n\nstd::shared_ptr<RowGroupReader> SerializedFile::GetRowGroup(int i) {\n  std::unique_ptr<SerializedRowGroup> contents(\n      new SerializedRowGroup(source_.get(), &metadata_.row_groups[i], properties_));\n\n  return std::make_shared<RowGroupReader>(\n      &schema_, std::move(contents), properties_.allocator());\n}\n\nint64_t SerializedFile::num_rows() const {\n  return metadata_.num_rows;\n}\n\nint SerializedFile::num_columns() const {\n  return schema_.num_columns();\n}\n\nint SerializedFile::num_row_groups() const {\n  return metadata_.row_groups.size();\n}\n\nSerializedFile::SerializedFile(std::unique_ptr<RandomAccessSource> source,\n    ReaderProperties props = default_reader_properties())\n    : source_(std::move(source)), properties_(props) {}\n\nvoid SerializedFile::ParseMetaData() {\n  int64_t filesize = source_->Size();\n\n  if (filesize < FOOTER_SIZE) {\n    throw ParquetException(\"Corrupted file, smaller than file footer\");\n  }\n\n  uint8_t footer_buffer[FOOTER_SIZE];\n  source_->Seek(filesize - FOOTER_SIZE);\n  int64_t bytes_read = source_->Read(FOOTER_SIZE, footer_buffer);\n  if (bytes_read != FOOTER_SIZE || memcmp(footer_buffer + 4, PARQUET_MAGIC, 4) != 0) {\n    throw ParquetException(\"Invalid parquet file. Corrupt footer.\");\n  }\n\n  uint32_t metadata_len = *reinterpret_cast<uint32_t*>(footer_buffer);\n  int64_t metadata_start = filesize - FOOTER_SIZE - metadata_len;\n  if (FOOTER_SIZE + metadata_len > filesize) {\n    throw ParquetException(\n        \"Invalid parquet file. File is less than \"\n        \"file metadata size.\");\n  }\n  source_->Seek(metadata_start);\n\n  OwnedMutableBuffer metadata_buffer(metadata_len, properties_.allocator());\n  bytes_read = source_->Read(metadata_len, &metadata_buffer[0]);\n  if (bytes_read != metadata_len) {\n    throw ParquetException(\"Invalid parquet file. Could not read metadata bytes.\");\n  }\n  DeserializeThriftMsg(&metadata_buffer[0], &metadata_len, &metadata_);\n\n  schema::FlatSchemaConverter converter(&metadata_.schema[0], metadata_.schema.size());\n  schema_.Init(converter.Convert());\n}\n\n}  \/\/ namespace parquet\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\/\/=====================================================================\/\/\n\/*!\t@file\n\t@brief\tテキスト表示と制御 @n\n\t\t\tクリッピングされた描画と、位置の管理などを行う @n\n\t\t\t描画領域より大きなテキスト描画を行う場合は、自動でスクロールを行う。\n    @author 平松邦仁 (hira@rvf-rc45.net)\n\t@copyright\tCopyright (C) 2020 Kunihito Hiramatsu @n\n\t\t\t\tReleased under the MIT license @n\n\t\t\t\thttps:\/\/github.com\/hirakuni45\/RX\/blob\/master\/LICENSE\n*\/\n\/\/=====================================================================\/\/\n#include \"graphics\/widget.hpp\"\n\nnamespace gui {\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief\tテキスト・クラス\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\tstruct text : public widget {\n\n\t\ttypedef text value_type;\n\n\t\tstatic const uint16_t\tSCROLL_SPEED_FRAME = 3;\n\t\tstatic const uint16_t\tSCROLL_WAIT_FRAME = 240;\n\n\t\tbool\t\tenable_scroll_;\n\t\tint16_t\t\ttext_draw_h_;\n\t\tint16_t\t\tscroll_h_;\n\t\tuint16_t\tscroll_speed_;\t\/\/\/< フレーム数\n\t\tuint16_t\tscroll_delay_;\n\t\tuint16_t\tscroll_wait_;\n\n\tpublic:\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tコンストラクター\n\t\t\t@param[in]\tloc\t\tロケーション\n\t\t\t@param[in]\tstr\t\t初期文字列\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\ttext(const vtx::srect& loc = vtx::srect(0), const char* str = \"\") noexcept :\n\t\t\twidget(loc, str),\n\t\t\tenable_scroll_(true), text_draw_h_(0), scroll_h_(0),\n\t\t\tscroll_speed_(SCROLL_SPEED_FRAME), scroll_delay_(0), scroll_wait_(SCROLL_WAIT_FRAME)\n\t\t{\n\t\t\tinsert_widget(this);\n\t\t}\n\n\n\t\ttext(const text& th) = delete;\n\t\ttext& operator = (const text& th) = delete;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tデストラクタ\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvirtual ~text() noexcept { remove_widget(this); }\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\tconst char* get_name() const noexcept override { return \"Text\"; }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tID を取得\n\t\t\t@return ID\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tID get_id() const noexcept override { return ID::TEXT; }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\t初期化\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid init() noexcept override { }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tタッチ判定を更新（通常毎フレーム呼ばれる）\n\t\t\t@param[in]\tpos\t\t判定位置\n\t\t\t@param[in]\tnum\t\tタッチ数\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid update_touch(const vtx::spos& pos, uint16_t num) noexcept override\n\t\t{\n\t\t\tif(enable_scroll_ && text_draw_h_ > get_location().size.x) {\n\t\t\t\tif(scroll_wait_ > 0) {\n\t\t\t\t\tscroll_wait_--;\n\t\t\t\t} else {\n\t\t\t\t\t++scroll_delay_;\n\t\t\t\t\tif(scroll_delay_ >= scroll_speed_) {\n\t\t\t\t\t\tscroll_delay_ = 0;\n\t\t\t\t\t\t++scroll_h_;\n\t\t\t\t\t\tif(scroll_h_ == 0) {\n\t\t\t\t\t\t\tscroll_wait_ = SCROLL_WAIT_FRAME;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tset_update();\n\t\t\t\t\t\tif(scroll_h_ >= text_draw_h_) {\n\t\t\t\t\t\t\tscroll_h_ = -get_location().size.x;\n\t\t\t\t\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\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\t選択推移\n\t\t\t@param[in]\tena\t\t無効状態にする場合「false」\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid exec_select(bool ena = true) noexcept override { }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\t許可・不許可\n\t\t\t@param[in]\tena\t\t不許可の場合「false」\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid enable(bool ena = true) noexcept override\n\t\t{\n\t\t\tif(ena) set_state(STATE::ENABLE);\n\t\t\telse set_state(STATE::DISABLE);\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 reset_scroll() noexcept\n\t\t{\n\t\t\ttext_draw_h_ = 0;\n\t\t\tscroll_h_ = 0;\n\t\t\tscroll_speed_ = SCROLL_SPEED_FRAME;\n\t\t\tscroll_delay_ = 0;\n\t\t\tscroll_wait_ = SCROLL_WAIT_FRAME;\n\t\t\tset_update();\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\t描画テンプレート\n\t\t\t@param[in]\trdr\t\t描画インスタンス\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\ttemplate<class RDR>\n\t\tvoid draw(RDR& rdr) noexcept\n\t\t{\n\t\t\tauto r = vtx::srect(get_final_position(), get_location().size);\n\t\t\trdr.set_fore_color(get_base_color());\n\t\t\trdr.fill_box(r);\n#if 0\n\t\t\tuint8_t inten = 64;\n\t\t\tif(get_touch_state().level_) {  \/\/ 0.75\n\t\t\t\tinten = 192;\n\t\t\t}\n\t\t\tgraphics::color_t c;\n\t\t\tgraphics::share_color sh(0, 0, 0);\n\t\t\tsh.set_color(get_base_color().rgba8, inten);\n\t\t\trdr.set_fore_color(sh);\n#endif\n\t\t\trdr.set_fore_color(get_font_color());\n\t\t\tauto sz = rdr.at_font().get_text_size(get_title());\n\t\t\tif(sz.x < r.size.x) {\n\t\t\t\trdr.draw_text(vtx::spos(r.org.x, r.org.y + (r.size.y - sz.y) \/ 2), get_title());\n\t\t\t} else { \n\t\t\t\tif(text_draw_h_ != sz.x) {\n\t\t\t\t\ttext_draw_h_ = sz.x;\n\t\t\t\t\tscroll_h_ = 0;\n\t\t\t\t}\n\t\t\t\tif(enable_scroll_ && text_draw_h_ > 0) {\n\t\t\t\t\tauto oc = rdr.get_clip();\n\t\t\t\t\trdr.set_clip(r);\n\t\t\t\t\trdr.draw_text(vtx::spos(r.org.x - scroll_h_, r.org.y + (r.size.y - sz.y) \/ 2), get_title());\n\t\t\t\t\trdr.set_clip(oc);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t};\n}\n<commit_msg>Update: Reduce flickering of the drawing<commit_after>#pragma once\n\/\/=====================================================================\/\/\n\/*!\t@file\n\t@brief\tテキスト表示と制御 @n\n\t\t\tクリッピングされた描画と、位置の管理などを行う @n\n\t\t\t描画領域より大きなテキスト描画を行う場合は、自動でスクロールを行う。\n    @author 平松邦仁 (hira@rvf-rc45.net)\n\t@copyright\tCopyright (C) 2020 Kunihito Hiramatsu @n\n\t\t\t\tReleased under the MIT license @n\n\t\t\t\thttps:\/\/github.com\/hirakuni45\/RX\/blob\/master\/LICENSE\n*\/\n\/\/=====================================================================\/\/\n#include \"graphics\/widget.hpp\"\n\nnamespace gui {\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief\tテキスト・クラス\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\tstruct text : public widget {\n\n\t\ttypedef text value_type;\n\n\t\tstatic const uint16_t\tSCROLL_SPEED_FRAME = 3;\n\t\tstatic const uint16_t\tSCROLL_WAIT_FRAME = 240;\n\n\t\tbool\t\tenable_scroll_;\n\t\tint16_t\t\ttext_draw_h_;\n\t\tint16_t\t\tscroll_h_;\n\t\tuint16_t\tscroll_speed_;\t\/\/\/< フレーム数\n\t\tuint16_t\tscroll_delay_;\n\t\tuint16_t\tscroll_wait_;\n\n\tpublic:\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tコンストラクター\n\t\t\t@param[in]\tloc\t\tロケーション\n\t\t\t@param[in]\tstr\t\t初期文字列\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\ttext(const vtx::srect& loc = vtx::srect(0), const char* str = \"\") noexcept :\n\t\t\twidget(loc, str),\n\t\t\tenable_scroll_(true), text_draw_h_(0), scroll_h_(0),\n\t\t\tscroll_speed_(SCROLL_SPEED_FRAME), scroll_delay_(0), scroll_wait_(SCROLL_WAIT_FRAME)\n\t\t{\n\t\t\tinsert_widget(this);\n\t\t}\n\n\n\t\ttext(const text& th) = delete;\n\t\ttext& operator = (const text& th) = delete;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tデストラクタ\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvirtual ~text() noexcept { remove_widget(this); }\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\tconst char* get_name() const noexcept override { return \"Text\"; }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tID を取得\n\t\t\t@return ID\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tID get_id() const noexcept override { return ID::TEXT; }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\t初期化\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid init() noexcept override { }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tタッチ判定を更新（通常毎フレーム呼ばれる）\n\t\t\t@param[in]\tpos\t\t判定位置\n\t\t\t@param[in]\tnum\t\tタッチ数\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid update_touch(const vtx::spos& pos, uint16_t num) noexcept override\n\t\t{\n\t\t\tif(enable_scroll_ && text_draw_h_ > get_location().size.x) {\n\t\t\t\tif(scroll_wait_ > 0) {\n\t\t\t\t\tscroll_wait_--;\n\t\t\t\t} else {\n\t\t\t\t\t++scroll_delay_;\n\t\t\t\t\tif(scroll_delay_ >= scroll_speed_) {\n\t\t\t\t\t\tscroll_delay_ = 0;\n\t\t\t\t\t\t++scroll_h_;\n\t\t\t\t\t\tif(scroll_h_ == 0) {\n\t\t\t\t\t\t\tscroll_wait_ = SCROLL_WAIT_FRAME;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tset_update();\n\t\t\t\t\t\tif(scroll_h_ >= text_draw_h_) {\n\t\t\t\t\t\t\tscroll_h_ = -get_location().size.x;\n\t\t\t\t\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\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\t選択推移\n\t\t\t@param[in]\tena\t\t無効状態にする場合「false」\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid exec_select(bool ena = true) noexcept override { }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\t許可・不許可\n\t\t\t@param[in]\tena\t\t不許可の場合「false」\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid enable(bool ena = true) noexcept override\n\t\t{\n\t\t\tif(ena) set_state(STATE::ENABLE);\n\t\t\telse set_state(STATE::DISABLE);\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 reset_scroll() noexcept\n\t\t{\n\t\t\ttext_draw_h_ = 0;\n\t\t\tscroll_h_ = 0;\n\t\t\tscroll_speed_ = SCROLL_SPEED_FRAME;\n\t\t\tscroll_delay_ = 0;\n\t\t\tscroll_wait_ = SCROLL_WAIT_FRAME;\n\t\t\tset_update();\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\t描画テンプレート\n\t\t\t@param[in]\trdr\t\t描画インスタンス\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\ttemplate<class RDR>\n\t\tvoid draw(RDR& rdr) noexcept\n\t\t{\n\t\t\tauto r = vtx::srect(get_final_position(), get_location().size);\n\t\t\tauto sz = rdr.at_font().get_text_size(get_title());\n\t\t\tif(sz.x < r.size.x) {\n\t\t\t\trdr.set_fore_color(get_base_color());\n\t\t\t\trdr.fill_box(r);\n\t\t\t} else {\n\t\t\t\tif(text_draw_h_ != sz.x) {\n\t\t\t\t\ttext_draw_h_ = sz.x;\n\t\t\t\t\tscroll_h_ = 0;\n\t\t\t\t\trdr.set_fore_color(get_base_color());\n\t\t\t\t\trdr.fill_box(r);\n\t\t\t\t}\n\t\t\t}\n#if 0\n\t\t\tuint8_t inten = 64;\n\t\t\tif(get_touch_state().level_) {  \/\/ 0.75\n\t\t\t\tinten = 192;\n\t\t\t}\n\t\t\tgraphics::color_t c;\n\t\t\tgraphics::share_color sh(0, 0, 0);\n\t\t\tsh.set_color(get_base_color().rgba8, inten);\n\t\t\trdr.set_fore_color(sh);\n#endif\n\t\t\trdr.set_fore_color(get_font_color());\n\n\t\t\tif(sz.x < r.size.x) {\n\t\t\t\trdr.draw_text(vtx::spos(r.org.x, r.org.y + (r.size.y - sz.y) \/ 2), get_title());\n\t\t\t} else { \n\t\t\t\trdr.set_back_color(get_base_color());\n\t\t\t\tif(enable_scroll_ && text_draw_h_ > 0) {\n\t\t\t\t\tauto oc = rdr.get_clip();\n\t\t\t\t\trdr.set_clip(r);\n\t\t\t\t\trdr.draw_text(vtx::spos(r.org.x - scroll_h_, r.org.y + (r.size.y - sz.y) \/ 2), get_title(), false, true);\n\t\t\t\t\trdr.set_clip(oc);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t};\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\n#include \"otbReciprocalHAlphaImageFilter.h\"\n#include \"otbSinclairReciprocalImageFilter.h\"\n#include \"otbSinclairToReciprocalCoherencyMatrixFunctor.h\"\n\n\nnamespace otb\n{\nnamespace Wrapper\n{\n\nclass SARDecompositions : public Application\n{\npublic:\n  \/** Standard class typedefs. *\/\n  typedef SARDecompositions                   Self;\n  typedef Application                         Superclass;\n  typedef itk::SmartPointer<Self>             Pointer;\n  typedef itk::SmartPointer<const Self>       ConstPointer;\n\n  \n  \n  typedef otb::Functor::SinclairToReciprocalCoherencyMatrixFunctor<ComplexFloatImageType::PixelType,\n                                    ComplexFloatImageType::PixelType,\n                                    ComplexFloatImageType::PixelType,\n                                    ComplexFloatVectorImageType::PixelType>\t\t\t\t\t\t\t\tFunctorType;\n                                    \n                                    \t\t\t\t\t\t\t\t\n  typedef SinclairReciprocalImageFilter<ComplexFloatImageType, \n\t\t\t\t\t\t\t\t\t\t\t ComplexFloatImageType, \n\t\t\t\t\t\t\t\t\t\t\t ComplexFloatImageType, \n\t\t\t\t\t\t\t\t\t\t\t ComplexFloatVectorImageType, \n\t\t\t\t\t\t\t\t\t\t\t FunctorType > \t\t\t\t\t\t\t\t\t\t\t\tSRFilterType;\n  \n  \n  typedef otb::ReciprocalHAlphaImageFilter<ComplexFloatVectorImageType, FloatVectorImageType> \t\t\tHAFilterType;\n  \n  \n  \n\n  \/** Standard macro *\/\n  itkNewMacro(Self);\n\n  itkTypeMacro(SARDecompositions, otb::Application);\n\nprivate:\n  void DoInit()\n  {\n    SetName(\"SARDecompositions\");\n    SetDescription(\"From one-band complex images (HH, HV or VH, VV), returns the selected decomposition.\");\n\n    \/\/ Documentation\n    SetDocName(\"SARDecompositions\");\n    SetDocLongDescription(\"From one-band complex images (HH, HV, VH, VV), returns the selected decomposition.\\n\"\n\t\t\t\t\t\t  \"The H-alpha-A decomposition is currently the only one available; it is implemented for the monostatic case (transmitter and receiver are co-located).\\n\"\n\t\t\t\t\t\t  \"User must provide three one-band complex images HH, HV or VH, and VV (monostatic case <=> HV = VH).\\n\"\n\t\t\t\t\t\t  \"The applications returns a float vector image, made of three channels : H (entropy), Alpha, A (Anisotropy).\" );\n\t\t\t\t\t\t  \n    SetDocLimitations(\"None\");\n    SetDocAuthors(\"OTB-Team\");\n    SetDocSeeAlso(\"\");\n\n    AddDocTag(Tags::SAR);\n\n    AddParameter(ParameterType_ComplexInputImage,  \"inhh\",   \"Input Image\");\n    SetParameterDescription(\"inhh\", \"Input image (HH)\");\n    \n    AddParameter(ParameterType_ComplexInputImage,  \"inhv\",   \"Input Image\");\n    SetParameterDescription(\"inhv\", \"Input image (HV)\");\n    MandatoryOff(\"inhv\");\n    \n    AddParameter(ParameterType_ComplexInputImage,  \"invh\",   \"Input Image\");\n    SetParameterDescription(\"invh\", \"Input image (VH)\");\n    MandatoryOff(\"invh\");\n    \n    AddParameter(ParameterType_ComplexInputImage,  \"invv\",   \"Input Image\");\n    SetParameterDescription(\"invv\", \"Input image (VV)\");\n    \n    AddParameter(ParameterType_ComplexOutputImage, \"out\",  \"Output Image\");\n    SetParameterDescription(\"out\", \"Output image\");\n    \n    AddParameter(ParameterType_Choice, \"decomp\", \"Decompositions\");\n    AddChoice(\"decomp.haa\",\"H-alpha-A decomposition\");\n    SetParameterDescription(\"decomp.haa\",\"H-alpha-A decomposition\");\n\n    AddRAMParameter();\n\n    \/\/ Default values\n    SetDefaultParameterInt(\"decomp\", 0); \/\/ H-alpha-A\n\n    \/\/ Doc example parameter settings\n    SetDocExampleParameterValue(\"inhh\", \"HH.tif\");\n\tSetDocExampleParameterValue(\"invh\", \"VH.tif\");\n\tSetDocExampleParameterValue(\"invv\", \"VV.tif\");\n\tSetDocExampleParameterValue(\"decomp\", \"haa\");\n    SetDocExampleParameterValue(\"out\", \"HaA.tif\");\n  }\n\n  void DoUpdateParameters()\n  {\n    \/\/ Nothing to do here : all parameters are independent\n  }\n\n  void DoExecute()\n  {\n\t  \n\tbool inhv = HasUserValue(\"inhv\");\n\tbool invh = HasUserValue(\"invh\");\n\t\t\n\tif ( (!inhv) && (!invh) )\n\t  otbAppLogFATAL( << \"Parameter inhv or invh not set. Please provide a HV or a VH complex image.\");\n    \n    switch (GetParameterInt(\"decomp\"))\n      {\n\t\tcase 0: \/\/ H-alpha-A\n\t\t\n\t\tm_SRFilter = SRFilterType::New();\n\t\tm_HAFilter = HAFilterType::New();\n\t\t\n\t\tif (inhv)\n\t\t  m_SRFilter->SetInputHV_VH(GetParameterComplexFloatImage(\"inhv\"));\n\t    else if (invh)\n\t\t  m_SRFilter->SetInputHV_VH(GetParameterComplexFloatImage(\"invh\"));\n\n\t\tm_SRFilter->SetInputHH(GetParameterComplexFloatImage(\"inhh\"));\n\t\tm_SRFilter->SetInputVV(GetParameterComplexFloatImage(\"invv\"));\n\t\t\n\t\tm_HAFilter->SetInput(m_SRFilter->GetOutput());\n\n\t\tSetParameterOutputImage(\"out\", m_HAFilter->GetOutput() );\n    \n\t\tbreak;\n\t  }\n   \t \n  }\n\n  \/\/MCPSFilterType::Pointer m_MCPSFilter;\n  SRFilterType::Pointer m_SRFilter;\n  HAFilterType::Pointer m_HAFilter;\n\n  \n}; \n\n} \/\/end namespace Wrapper\n} \/\/end namespace otb\n\nOTB_APPLICATION_EXPORT(otb::Wrapper::SARDecompositions)\n<commit_msg>BUG: fixed small bug in SARDecompositions app (SAR)<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\n#include \"otbReciprocalHAlphaImageFilter.h\"\n#include \"otbSinclairReciprocalImageFilter.h\"\n#include \"otbSinclairToReciprocalCoherencyMatrixFunctor.h\"\n\n\nnamespace otb\n{\nnamespace Wrapper\n{\n\nclass SARDecompositions : public Application\n{\npublic:\n  \/** Standard class typedefs. *\/\n  typedef SARDecompositions                   Self;\n  typedef Application                         Superclass;\n  typedef itk::SmartPointer<Self>             Pointer;\n  typedef itk::SmartPointer<const Self>       ConstPointer;\n\n  \n  \n  typedef otb::Functor::SinclairToReciprocalCoherencyMatrixFunctor<ComplexFloatImageType::PixelType,\n                                    ComplexFloatImageType::PixelType,\n                                    ComplexFloatImageType::PixelType,\n                                    ComplexFloatVectorImageType::PixelType>\t\t\t\t\t\t\t\tFunctorType;\n                                    \n                                    \t\t\t\t\t\t\t\t\n  typedef SinclairReciprocalImageFilter<ComplexFloatImageType, \n\t\t\t\t\t\t\t\t\t\t\t ComplexFloatImageType, \n\t\t\t\t\t\t\t\t\t\t\t ComplexFloatImageType, \n\t\t\t\t\t\t\t\t\t\t\t ComplexFloatVectorImageType, \n\t\t\t\t\t\t\t\t\t\t\t FunctorType > \t\t\t\t\t\t\t\t\t\t\t\tSRFilterType;\n  \n  \n  typedef otb::ReciprocalHAlphaImageFilter<ComplexFloatVectorImageType, FloatVectorImageType> \t\t\tHAFilterType;\n  \n  \n  \n\n  \/** Standard macro *\/\n  itkNewMacro(Self);\n\n  itkTypeMacro(SARDecompositions, otb::Application);\n\nprivate:\n  void DoInit()\n  {\n    SetName(\"SARDecompositions\");\n    SetDescription(\"From one-band complex images (HH, HV or VH, VV), returns the selected decomposition.\");\n\n    \/\/ Documentation\n    SetDocName(\"SARDecompositions\");\n    SetDocLongDescription(\"From one-band complex images (HH, HV, VH, VV), returns the selected decomposition.\\n\"\n\t\t\t\t\t\t  \"The H-alpha-A decomposition is currently the only one available; it is implemented for the monostatic case (transmitter and receiver are co-located).\\n\"\n\t\t\t\t\t\t  \"User must provide three one-band complex images HH, HV or VH, and VV (monostatic case <=> HV = VH).\\n\"\n\t\t\t\t\t\t  \"The applications returns a float vector image, made of three channels : H (entropy), Alpha, A (Anisotropy).\" );\n\t\t\t\t\t\t  \n    SetDocLimitations(\"None\");\n    SetDocAuthors(\"OTB-Team\");\n    SetDocSeeAlso(\"\");\n\n    AddDocTag(Tags::SAR);\n\n    AddParameter(ParameterType_ComplexInputImage,  \"inhh\",   \"Input Image\");\n    SetParameterDescription(\"inhh\", \"Input image (HH)\");\n    \n    AddParameter(ParameterType_ComplexInputImage,  \"inhv\",   \"Input Image\");\n    SetParameterDescription(\"inhv\", \"Input image (HV)\");\n    MandatoryOff(\"inhv\");\n    \n    AddParameter(ParameterType_ComplexInputImage,  \"invh\",   \"Input Image\");\n    SetParameterDescription(\"invh\", \"Input image (VH)\");\n    MandatoryOff(\"invh\");\n    \n    AddParameter(ParameterType_ComplexInputImage,  \"invv\",   \"Input Image\");\n    SetParameterDescription(\"invv\", \"Input image (VV)\");\n    \n    AddParameter(ParameterType_OutputImage, \"out\",  \"Output Image\");\n    SetParameterDescription(\"out\", \"Output image\");\n    \n    AddParameter(ParameterType_Choice, \"decomp\", \"Decompositions\");\n    AddChoice(\"decomp.haa\",\"H-alpha-A decomposition\");\n    SetParameterDescription(\"decomp.haa\",\"H-alpha-A decomposition\");\n\n    AddRAMParameter();\n\n    \/\/ Default values\n    SetDefaultParameterInt(\"decomp\", 0); \/\/ H-alpha-A\n\n    \/\/ Doc example parameter settings\n    SetDocExampleParameterValue(\"inhh\", \"HH.tif\");\n\tSetDocExampleParameterValue(\"invh\", \"VH.tif\");\n\tSetDocExampleParameterValue(\"invv\", \"VV.tif\");\n\tSetDocExampleParameterValue(\"decomp\", \"haa\");\n    SetDocExampleParameterValue(\"out\", \"HaA.tif\");\n  }\n\n  void DoUpdateParameters()\n  {\n    \/\/ Nothing to do here : all parameters are independent\n  }\n\n  void DoExecute()\n  {\n\t  \n\tbool inhv = HasUserValue(\"inhv\");\n\tbool invh = HasUserValue(\"invh\");\n\t\t\n\tif ( (!inhv) && (!invh) )\n\t  otbAppLogFATAL( << \"Parameter inhv or invh not set. Please provide a HV or a VH complex image.\");\n    \n    switch (GetParameterInt(\"decomp\"))\n      {\n\t\tcase 0: \/\/ H-alpha-A\n\t\t\n\t\tm_SRFilter = SRFilterType::New();\n\t\tm_HAFilter = HAFilterType::New();\n\t\t\n\t\tif (inhv)\n\t\t  m_SRFilter->SetInputHV_VH(GetParameterComplexFloatImage(\"inhv\"));\n\t    else if (invh)\n\t\t  m_SRFilter->SetInputHV_VH(GetParameterComplexFloatImage(\"invh\"));\n\n\t\tm_SRFilter->SetInputHH(GetParameterComplexFloatImage(\"inhh\"));\n\t\tm_SRFilter->SetInputVV(GetParameterComplexFloatImage(\"invv\"));\n\t\t\n\t\tm_HAFilter->SetInput(m_SRFilter->GetOutput());\n\n\t\tSetParameterOutputImage(\"out\", m_HAFilter->GetOutput() );\n    \n\t\tbreak;\n\t  }\n   \t \n  }\n\n  \/\/MCPSFilterType::Pointer m_MCPSFilter;\n  SRFilterType::Pointer m_SRFilter;\n  HAFilterType::Pointer m_HAFilter;\n\n  \n}; \n\n} \/\/end namespace Wrapper\n} \/\/end namespace otb\n\nOTB_APPLICATION_EXPORT(otb::Wrapper::SARDecompositions)\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 <atlbase.h>\n#include <vector>\n\n#include \"base\/file_path.h\"\n#include \"base\/scoped_comptr_win.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/browser_window.h\"\n#include \"chrome\/browser\/renderer_host\/render_widget_host_view_win.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/notification_type.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n\nnamespace {\n\nclass AccessibilityWinBrowserTest : public InProcessBrowserTest {\n public:\n  void SetUpCommandLine(CommandLine* command_line) {\n    \/\/ Turns on the accessibility in the renderer. Off by default until\n    \/\/ http:\/\/crbug.com\/25564 is fixed.\n    command_line->AppendSwitch(switches::kEnableRendererAccessibility);\n  }\n\n protected:\n  IAccessible* GetRenderWidgetHostViewClientAccessible();\n};\n\nclass AccessibleChecker {\n public:\n  AccessibleChecker(std::wstring expected_name, int32 expected_role);\n\n  \/\/ Append an AccessibleChecker that verifies accessibility information for\n  \/\/ a child IAccessible. Order is important.\n  void AppendExpectedChild(AccessibleChecker* expected_child);\n\n  \/\/ Check that the name and role of the given IAccessible instance and its\n  \/\/ descendants match the expected names and roles that this object was\n  \/\/ initialized with.\n  void CheckAccessible(IAccessible* accessible);\n\n  typedef std::vector<AccessibleChecker*> AccessibleCheckerVector;\n\n private:\n  void CheckAccessibleName(IAccessible* accessible);\n  void CheckAccessibleRole(IAccessible* accessible);\n  void CheckAccessibleChildren(IAccessible* accessible);\n\n private:\n  \/\/ Expected accessible name. Checked against IAccessible::get_accName.\n  std::wstring name_;\n\n  \/\/ Expected accessible role. Checked against IAccessible::get_accRole.\n  int32 role_;\n\n  \/\/ Expected accessible children. Checked using IAccessible::get_accChildCount\n  \/\/ and ::AccessibleChildren.\n  AccessibleCheckerVector children_;\n};\n\nVARIANT CreateI4Variant(LONG value) {\n  VARIANT variant = {0};\n\n  V_VT(&variant) = VT_I4;\n  V_I4(&variant) = value;\n\n  return variant;\n}\n\nIAccessible* GetAccessibleFromResultVariant(IAccessible* parent, VARIANT *var) {\n  switch (V_VT(var)) {\n    case VT_DISPATCH:\n      return CComQIPtr<IAccessible>(V_DISPATCH(var)).Detach();\n      break;\n\n    case VT_I4: {\n      CComPtr<IDispatch> dispatch;\n      HRESULT hr = parent->get_accChild(CreateI4Variant(V_I4(var)), &dispatch);\n      EXPECT_EQ(hr, S_OK);\n      return CComQIPtr<IAccessible>(dispatch).Detach();\n      break;\n    }\n  }\n\n  return NULL;\n}\n\n\/\/ Retrieve the MSAA client accessibility object for the Render Widget Host View\n\/\/ of the selected tab.\nIAccessible*\nAccessibilityWinBrowserTest::GetRenderWidgetHostViewClientAccessible() {\n  HWND hwnd_render_widget_host_view =\n      browser()->GetSelectedTabContents()->GetRenderWidgetHostView()->\n          GetNativeView();\n\n  IAccessible* accessible;\n  HRESULT hr = AccessibleObjectFromWindow(\n      hwnd_render_widget_host_view, OBJID_CLIENT,\n      IID_IAccessible, reinterpret_cast<void**>(&accessible));\n  EXPECT_EQ(S_OK, hr);\n  EXPECT_NE(accessible, reinterpret_cast<IAccessible*>(NULL));\n\n  return accessible;\n}\n\nAccessibleChecker::AccessibleChecker(\n    std::wstring expected_name, int32 expected_role) :\n    name_(expected_name),\n    role_(expected_role) {\n}\n\nvoid AccessibleChecker::AppendExpectedChild(\n    AccessibleChecker* expected_child) {\n  children_.push_back(expected_child);\n}\n\nvoid AccessibleChecker::CheckAccessible(IAccessible* accessible) {\n  CheckAccessibleName(accessible);\n  CheckAccessibleRole(accessible);\n  CheckAccessibleChildren(accessible);\n}\n\nvoid AccessibleChecker::CheckAccessibleName(IAccessible* accessible) {\n  CComBSTR name;\n  HRESULT hr =\n      accessible->get_accName(CreateI4Variant(CHILDID_SELF), &name);\n\n  if (name_.empty()) {\n    \/\/ If the object doesn't have name S_FALSE should be returned.\n    EXPECT_EQ(hr, S_FALSE);\n  } else {\n    \/\/ Test that the correct string was returned.\n    EXPECT_EQ(hr, S_OK);\n    EXPECT_EQ(CompareString(LOCALE_NEUTRAL, 0, name, SysStringLen(name),\n                  name_.c_str(), name_.length()),\n              CSTR_EQUAL);\n  }\n}\n\nvoid AccessibleChecker::CheckAccessibleRole(IAccessible* accessible) {\n  VARIANT var_role = {0};\n  HRESULT hr =\n      accessible->get_accRole(CreateI4Variant(CHILDID_SELF), &var_role);\n  EXPECT_EQ(hr, S_OK);\n  EXPECT_EQ(V_VT(&var_role), VT_I4);\n  EXPECT_EQ(V_I4(&var_role), role_);\n}\n\nvoid AccessibleChecker::CheckAccessibleChildren(IAccessible* parent) {\n  LONG child_count = 0;\n  HRESULT hr = parent->get_accChildCount(&child_count);\n  EXPECT_EQ(hr, S_OK);\n\n  \/\/ TODO(dmazzoni): remove as soon as test passes on build bot\n  printf(\"CheckAccessibleChildren: actual=%d expected=%d\\n\",\n         static_cast<int>(child_count),\n         static_cast<int>(children_.size()));\n\n  ASSERT_EQ(child_count, children_.size());\n\n  std::auto_ptr<VARIANT> child_array(new VARIANT[child_count]);\n  LONG obtained_count = 0;\n  hr = AccessibleChildren(parent, 0, child_count,\n                          child_array.get(), &obtained_count);\n  ASSERT_EQ(hr, S_OK);\n  ASSERT_EQ(child_count, obtained_count);\n\n  VARIANT* child = child_array.get();\n  for (AccessibleCheckerVector::iterator child_checker = children_.begin();\n       child_checker != children_.end();\n       ++child_checker, ++child) {\n    ScopedComPtr<IAccessible> child_accessible;\n    child_accessible.Attach(GetAccessibleFromResultVariant(parent, child));\n    (*child_checker)->CheckAccessible(child_accessible);\n  }\n}\n\n\/\/ Flaky and crashing, http:\/\/crbug.com\/44546.\nIN_PROC_BROWSER_TEST_F(AccessibilityWinBrowserTest,\n                       DISABLED_TestRendererAccessibilityTree) {\n  GURL tree_url(\n      \"data:text\/html,<html><head><title>Accessibility Win Test<\/title><\/head>\"\n      \"<body><input type='button' value='push' \/><input type='checkbox' \/>\"\n      \"<\/body><\/html>\");\n  browser()->OpenURL(tree_url, GURL(), CURRENT_TAB, PageTransition::TYPED);\n  ui_test_utils::WaitForNotification(\n      NotificationType::RENDER_VIEW_HOST_ACCESSIBILITY_TREE_UPDATED);\n\n  ScopedComPtr<IAccessible> document_accessible(\n      GetRenderWidgetHostViewClientAccessible());\n\n  AccessibleChecker button_checker(L\"push\", ROLE_SYSTEM_PUSHBUTTON);\n  AccessibleChecker checkbox_checker(L\"\", ROLE_SYSTEM_CHECKBUTTON);\n\n  AccessibleChecker grouping_checker(L\"\", ROLE_SYSTEM_GROUPING);\n  grouping_checker.AppendExpectedChild(&button_checker);\n  grouping_checker.AppendExpectedChild(&checkbox_checker);\n\n  AccessibleChecker document_checker(L\"\", ROLE_SYSTEM_DOCUMENT);\n  document_checker.AppendExpectedChild(&grouping_checker);\n\n  \/\/ Check the accessible tree of the renderer.\n  document_checker.CheckAccessible(document_accessible);\n\n  \/\/ Check that document accessible has a parent accessible.\n  ScopedComPtr<IDispatch> parent_dispatch;\n  HRESULT hr = document_accessible->get_accParent(parent_dispatch.Receive());\n  EXPECT_EQ(hr, S_OK);\n  EXPECT_NE(parent_dispatch, reinterpret_cast<IDispatch*>(NULL));\n\n  \/\/ Navigate to another page.\n  GURL about_url(\"about:\");\n  ui_test_utils::NavigateToURL(browser(), about_url);\n\n  \/\/ Verify that the IAccessible reference still points to a valid object and\n  \/\/ that it calls to its methods fail since the tree is no longer valid after\n  \/\/ the page navagation.\n  \/\/ Todo(ctguil): Currently this is giving a false positive because E_FAIL is\n  \/\/ returned when BrowserAccessibilityManager::RequestAccessibilityInfo fails\n  \/\/ since the previous render view host connection is lost. Verify that\n  \/\/ instances are actually marked as invalid once the browse side cache is\n  \/\/ checked in.\n  CComBSTR name;\n  hr = document_accessible->get_accName(CreateI4Variant(CHILDID_SELF), &name);\n  ASSERT_EQ(E_FAIL, hr);\n}\n}  \/\/ namespace.\n<commit_msg>Change TestRendererAccessibilityTree from disabled to flaky.<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 <atlbase.h>\n#include <vector>\n\n#include \"base\/file_path.h\"\n#include \"base\/scoped_comptr_win.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/browser_window.h\"\n#include \"chrome\/browser\/renderer_host\/render_widget_host_view_win.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/notification_type.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n\nnamespace {\n\nclass AccessibilityWinBrowserTest : public InProcessBrowserTest {\n public:\n  void SetUpCommandLine(CommandLine* command_line) {\n    \/\/ Turns on the accessibility in the renderer. Off by default until\n    \/\/ http:\/\/crbug.com\/25564 is fixed.\n    command_line->AppendSwitch(switches::kEnableRendererAccessibility);\n  }\n\n protected:\n  IAccessible* GetRenderWidgetHostViewClientAccessible();\n};\n\nclass AccessibleChecker {\n public:\n  AccessibleChecker(std::wstring expected_name, int32 expected_role);\n\n  \/\/ Append an AccessibleChecker that verifies accessibility information for\n  \/\/ a child IAccessible. Order is important.\n  void AppendExpectedChild(AccessibleChecker* expected_child);\n\n  \/\/ Check that the name and role of the given IAccessible instance and its\n  \/\/ descendants match the expected names and roles that this object was\n  \/\/ initialized with.\n  void CheckAccessible(IAccessible* accessible);\n\n  typedef std::vector<AccessibleChecker*> AccessibleCheckerVector;\n\n private:\n  void CheckAccessibleName(IAccessible* accessible);\n  void CheckAccessibleRole(IAccessible* accessible);\n  void CheckAccessibleChildren(IAccessible* accessible);\n\n private:\n  \/\/ Expected accessible name. Checked against IAccessible::get_accName.\n  std::wstring name_;\n\n  \/\/ Expected accessible role. Checked against IAccessible::get_accRole.\n  int32 role_;\n\n  \/\/ Expected accessible children. Checked using IAccessible::get_accChildCount\n  \/\/ and ::AccessibleChildren.\n  AccessibleCheckerVector children_;\n};\n\nVARIANT CreateI4Variant(LONG value) {\n  VARIANT variant = {0};\n\n  V_VT(&variant) = VT_I4;\n  V_I4(&variant) = value;\n\n  return variant;\n}\n\nIAccessible* GetAccessibleFromResultVariant(IAccessible* parent, VARIANT *var) {\n  switch (V_VT(var)) {\n    case VT_DISPATCH:\n      return CComQIPtr<IAccessible>(V_DISPATCH(var)).Detach();\n      break;\n\n    case VT_I4: {\n      CComPtr<IDispatch> dispatch;\n      HRESULT hr = parent->get_accChild(CreateI4Variant(V_I4(var)), &dispatch);\n      EXPECT_EQ(hr, S_OK);\n      return CComQIPtr<IAccessible>(dispatch).Detach();\n      break;\n    }\n  }\n\n  return NULL;\n}\n\n\/\/ Retrieve the MSAA client accessibility object for the Render Widget Host View\n\/\/ of the selected tab.\nIAccessible*\nAccessibilityWinBrowserTest::GetRenderWidgetHostViewClientAccessible() {\n  HWND hwnd_render_widget_host_view =\n      browser()->GetSelectedTabContents()->GetRenderWidgetHostView()->\n          GetNativeView();\n\n  IAccessible* accessible;\n  HRESULT hr = AccessibleObjectFromWindow(\n      hwnd_render_widget_host_view, OBJID_CLIENT,\n      IID_IAccessible, reinterpret_cast<void**>(&accessible));\n  EXPECT_EQ(S_OK, hr);\n  EXPECT_NE(accessible, reinterpret_cast<IAccessible*>(NULL));\n\n  return accessible;\n}\n\nAccessibleChecker::AccessibleChecker(\n    std::wstring expected_name, int32 expected_role) :\n    name_(expected_name),\n    role_(expected_role) {\n}\n\nvoid AccessibleChecker::AppendExpectedChild(\n    AccessibleChecker* expected_child) {\n  children_.push_back(expected_child);\n}\n\nvoid AccessibleChecker::CheckAccessible(IAccessible* accessible) {\n  CheckAccessibleName(accessible);\n  CheckAccessibleRole(accessible);\n  CheckAccessibleChildren(accessible);\n}\n\nvoid AccessibleChecker::CheckAccessibleName(IAccessible* accessible) {\n  CComBSTR name;\n  HRESULT hr =\n      accessible->get_accName(CreateI4Variant(CHILDID_SELF), &name);\n\n  if (name_.empty()) {\n    \/\/ If the object doesn't have name S_FALSE should be returned.\n    EXPECT_EQ(hr, S_FALSE);\n  } else {\n    \/\/ Test that the correct string was returned.\n    EXPECT_EQ(hr, S_OK);\n    EXPECT_EQ(CompareString(LOCALE_NEUTRAL, 0, name, SysStringLen(name),\n                  name_.c_str(), name_.length()),\n              CSTR_EQUAL);\n  }\n}\n\nvoid AccessibleChecker::CheckAccessibleRole(IAccessible* accessible) {\n  VARIANT var_role = {0};\n  HRESULT hr =\n      accessible->get_accRole(CreateI4Variant(CHILDID_SELF), &var_role);\n  EXPECT_EQ(hr, S_OK);\n  EXPECT_EQ(V_VT(&var_role), VT_I4);\n  EXPECT_EQ(V_I4(&var_role), role_);\n}\n\nvoid AccessibleChecker::CheckAccessibleChildren(IAccessible* parent) {\n  LONG child_count = 0;\n  HRESULT hr = parent->get_accChildCount(&child_count);\n  EXPECT_EQ(hr, S_OK);\n\n  \/\/ TODO(dmazzoni): remove as soon as test passes on build bot\n  printf(\"CheckAccessibleChildren: actual=%d expected=%d\\n\",\n         static_cast<int>(child_count),\n         static_cast<int>(children_.size()));\n\n  ASSERT_EQ(child_count, children_.size());\n\n  std::auto_ptr<VARIANT> child_array(new VARIANT[child_count]);\n  LONG obtained_count = 0;\n  hr = AccessibleChildren(parent, 0, child_count,\n                          child_array.get(), &obtained_count);\n  ASSERT_EQ(hr, S_OK);\n  ASSERT_EQ(child_count, obtained_count);\n\n  VARIANT* child = child_array.get();\n  for (AccessibleCheckerVector::iterator child_checker = children_.begin();\n       child_checker != children_.end();\n       ++child_checker, ++child) {\n    ScopedComPtr<IAccessible> child_accessible;\n    child_accessible.Attach(GetAccessibleFromResultVariant(parent, child));\n    (*child_checker)->CheckAccessible(child_accessible);\n  }\n}\n\n\/\/ Flaky http:\/\/crbug.com\/44546.\nIN_PROC_BROWSER_TEST_F(AccessibilityWinBrowserTest,\n                       FLAKY_TestRendererAccessibilityTree) {\n  GURL tree_url(\n      \"data:text\/html,<html><head><title>Accessibility Win Test<\/title><\/head>\"\n      \"<body><input type='button' value='push' \/><input type='checkbox' \/>\"\n      \"<\/body><\/html>\");\n  browser()->OpenURL(tree_url, GURL(), CURRENT_TAB, PageTransition::TYPED);\n  ui_test_utils::WaitForNotification(\n      NotificationType::RENDER_VIEW_HOST_ACCESSIBILITY_TREE_UPDATED);\n\n  ScopedComPtr<IAccessible> document_accessible(\n      GetRenderWidgetHostViewClientAccessible());\n  ASSERT_NE(document_accessible.get(), reinterpret_cast<IAccessible*>(NULL));\n\n  AccessibleChecker button_checker(L\"push\", ROLE_SYSTEM_PUSHBUTTON);\n  AccessibleChecker checkbox_checker(L\"\", ROLE_SYSTEM_CHECKBUTTON);\n\n  AccessibleChecker grouping_checker(L\"\", ROLE_SYSTEM_GROUPING);\n  grouping_checker.AppendExpectedChild(&button_checker);\n  grouping_checker.AppendExpectedChild(&checkbox_checker);\n\n  AccessibleChecker document_checker(L\"\", ROLE_SYSTEM_DOCUMENT);\n  document_checker.AppendExpectedChild(&grouping_checker);\n\n  \/\/ Check the accessible tree of the renderer.\n  document_checker.CheckAccessible(document_accessible);\n\n  \/\/ Check that document accessible has a parent accessible.\n  ScopedComPtr<IDispatch> parent_dispatch;\n  HRESULT hr = document_accessible->get_accParent(parent_dispatch.Receive());\n  EXPECT_EQ(hr, S_OK);\n  EXPECT_NE(parent_dispatch, reinterpret_cast<IDispatch*>(NULL));\n\n  \/\/ Navigate to another page.\n  GURL about_url(\"about:\");\n  ui_test_utils::NavigateToURL(browser(), about_url);\n\n  \/\/ Verify that the IAccessible reference still points to a valid object and\n  \/\/ that it calls to its methods fail since the tree is no longer valid after\n  \/\/ the page navagation.\n  \/\/ Todo(ctguil): Currently this is giving a false positive because E_FAIL is\n  \/\/ returned when BrowserAccessibilityManager::RequestAccessibilityInfo fails\n  \/\/ since the previous render view host connection is lost. Verify that\n  \/\/ instances are actually marked as invalid once the browse side cache is\n  \/\/ checked in.\n  CComBSTR name;\n  hr = document_accessible->get_accName(CreateI4Variant(CHILDID_SELF), &name);\n  ASSERT_EQ(E_FAIL, hr);\n}\n}  \/\/ namespace.\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: cachemapobject2.hxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 16:19: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 INCLUDED_UCB_CACHEMAPOBJECT2_HXX\n#define INCLUDED_UCB_CACHEMAPOBJECT2_HXX\n\n#ifndef _CPPUHELPER_WEAK_HXX_\n#include \"cppuhelper\/weak.hxx\"\n#endif\n\nnamespace ucb { namespace cachemap {\n\nclass Object2: public cppu::OWeakObject\n{};\n\n} }\n\n#endif \/\/ INCLUDED_UCB_CACHEMAPOBJECT2_HXX\n<commit_msg>INTEGRATION: CWS changefileheader (1.2.184); FILE MERGED 2008\/04\/01 16:02:30 thb 1.2.184.2: #i85898# Stripping all external header guards 2008\/03\/31 15:30:33 rt 1.2.184.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: cachemapobject2.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 INCLUDED_UCB_CACHEMAPOBJECT2_HXX\n#define INCLUDED_UCB_CACHEMAPOBJECT2_HXX\n\n#include \"cppuhelper\/weak.hxx\"\n\nnamespace ucb { namespace cachemap {\n\nclass Object2: public cppu::OWeakObject\n{};\n\n} }\n\n#endif \/\/ INCLUDED_UCB_CACHEMAPOBJECT2_HXX\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 \"mitkConnectomicsNetworkMapper3D.h\"\n\nmitk::ConnectomicsNetworkMapper3D::ConnectomicsNetworkMapper3D()\n{\n  \/\/TODO: implement\n  m_NetworkAssembly = vtkPropAssembly::New();\n\n}\n\nmitk::ConnectomicsNetworkMapper3D:: ~ConnectomicsNetworkMapper3D()\n{\n  \/\/TODO: implement\n  m_NetworkAssembly->Delete();\n\n}\n\nvoid mitk::ConnectomicsNetworkMapper3D::GenerateDataForRenderer(mitk::BaseRenderer* renderer)\n{\n  \/\/TODO: implement\n\n  if( this->GetInput() == NULL )\n  {\n    return;\n  }\n  if( this->GetInput()->GetIsModified( ) )\n  {\n    GenerateData();\n  }\n}\n\nvoid mitk::ConnectomicsNetworkMapper3D::GenerateData()\n{\n  m_NetworkAssembly->Delete();\n  m_NetworkAssembly = vtkPropAssembly::New();\n\n  \/\/ Here is the part where a graph is given and converted to points and connections between points...\n  std::vector< mitk::ConnectomicsNetwork::NetworkNode > vectorOfNodes = this->GetInput()->GetVectorOfAllNodes();\n  std::vector< std::pair< \n    std::pair< mitk::ConnectomicsNetwork::NetworkNode, mitk::ConnectomicsNetwork::NetworkNode > \n    , mitk::ConnectomicsNetwork::NetworkEdge > >  vectorOfEdges = this->GetInput()->GetVectorOfAllEdges();\n\n  mitk::Point3D tempWorldPoint, tempCNFGeometryPoint;\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/Create Spheres\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n  for(unsigned int i = 0; i < vectorOfNodes.size(); i++)\n  {\n    vtkSmartPointer<vtkSphereSource> sphereSource = \n      vtkSmartPointer<vtkSphereSource>::New();\n\n    for(unsigned int dimension = 0; dimension < 3; dimension++)\n    {\n      tempCNFGeometryPoint.SetElement( dimension , vectorOfNodes[i].coordinates[dimension] );\n    }\n\n    this->GetData()->GetGeometry()->IndexToWorld( tempCNFGeometryPoint, tempWorldPoint );\n\n    sphereSource->SetCenter( tempWorldPoint[0] , tempWorldPoint[1], tempWorldPoint[2] );\n    sphereSource->SetRadius(1.0);\n\n    vtkSmartPointer<vtkPolyDataMapper> mapper = \n      vtkSmartPointer<vtkPolyDataMapper>::New();\n    mapper->SetInput(sphereSource->GetOutput());\n\n    vtkSmartPointer<vtkActor> actor = \n      vtkSmartPointer<vtkActor>::New();\n    actor->SetMapper(mapper);\n\n    m_NetworkAssembly->AddPart(actor);\n  }\n\n  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/Create Tubes\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n  for(unsigned int i = 0; i < vectorOfEdges.size(); i++)\n  {\n\n    vtkSmartPointer<vtkLineSource> lineSource = \n      vtkSmartPointer<vtkLineSource>::New();\n\n    for(unsigned int dimension = 0; dimension < 3; dimension++)\n    {\n      tempCNFGeometryPoint[ dimension ] = vectorOfEdges[i].first.first.coordinates[dimension];\n    }\n\n    this->GetData()->GetGeometry()->IndexToWorld( tempCNFGeometryPoint, tempWorldPoint );\n\n    lineSource->SetPoint1(tempWorldPoint[0], tempWorldPoint[1],tempWorldPoint[2]  );\n\n    for(unsigned int dimension = 0; dimension < 3; dimension++)\n    {\n      tempCNFGeometryPoint[ dimension ] = vectorOfEdges[i].first.second.coordinates[dimension];\n    }\n\n    this->GetData()->GetGeometry()->IndexToWorld( tempCNFGeometryPoint, tempWorldPoint );\n\n    lineSource->SetPoint2(tempWorldPoint[0], tempWorldPoint[1], tempWorldPoint[2] );\n\n    vtkSmartPointer<vtkTubeFilter> tubes = vtkSmartPointer<vtkTubeFilter>::New();\n    tubes->SetInput( lineSource->GetOutput() );\n    tubes->SetNumberOfSides( 12 );\n    double radiusFactor = 1.0 + ((double) vectorOfEdges[i].second.weight) \/ 10.0 ;\n    tubes->SetRadius( std::log10( radiusFactor ) );\n\n    vtkSmartPointer<vtkPolyDataMapper> mapper2 = \n      vtkSmartPointer<vtkPolyDataMapper>::New();\n    mapper2->SetInput( tubes->GetOutput() );\n\n    vtkSmartPointer<vtkActor> actor = \n      vtkSmartPointer<vtkActor>::New();\n    actor->SetMapper(mapper2);\n\n    double maxWeight = (double) this->GetInput()->GetMaximumWeight();\n    double colourFactor = vectorOfEdges[i].second.weight \/ maxWeight;\n    actor->GetProperty()->SetColor( colourFactor, colourFactor, colourFactor);\n\n\n    m_NetworkAssembly->AddPart(actor);\n\n  }\n\n  (static_cast<mitk::ConnectomicsNetwork * > ( GetData() ) )->SetIsModified( false );\n\n  \/\/this->UpdateVtkObjects();\n\n  \n}\n\nconst mitk::ConnectomicsNetwork* mitk::ConnectomicsNetworkMapper3D::GetInput()\n{\n\n  return static_cast<const mitk::ConnectomicsNetwork * > ( GetData() );\n}\n\n\nvoid mitk::ConnectomicsNetworkMapper3D::SetDefaultProperties(DataNode* node, BaseRenderer* renderer , bool overwrite)\n{\n  \/\/TODO: implement\n\n\n  \/\/ hand it to the superclass for base default properties\n  Superclass::SetDefaultProperties(node, renderer, overwrite);\n}\n\nvoid mitk::ConnectomicsNetworkMapper3D::ApplyProperties(mitk::BaseRenderer* renderer)\n{\n  \/\/TODO: implement\n\n}\n\nvoid mitk::ConnectomicsNetworkMapper3D::SetVtkMapperImmediateModeRendering(vtkMapper *mapper)\n{\n  \/\/TODO: implement\n\n}\n\nvoid mitk::ConnectomicsNetworkMapper3D::UpdateVtkObjects()\n{\n  \/\/TODO: implement\n}\n\nvtkProp* mitk::ConnectomicsNetworkMapper3D::GetVtkProp(mitk::BaseRenderer *renderer)\n{\n\n  return m_NetworkAssembly;\n  \n}\n<commit_msg>Added vtk graph rendering, currently not controlled by property<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 \"mitkConnectomicsNetworkMapper3D.h\"\n\n#include <vtkMutableUndirectedGraph.h>\n#include \"vtkGraphLayout.h\"\n#include <vtkPoints.h>\n#include \"vtkGraphToPolyData.h\"\n#include <vtkPassThroughLayoutStrategy.h>\n#include \"vtkGlyph3D.h\"\n#include \"vtkGlyphSource2D.h\"\n\nmitk::ConnectomicsNetworkMapper3D::ConnectomicsNetworkMapper3D()\n{\n  \/\/TODO: implement\n  m_NetworkAssembly = vtkPropAssembly::New();\n\n}\n\nmitk::ConnectomicsNetworkMapper3D:: ~ConnectomicsNetworkMapper3D()\n{\n  \/\/TODO: implement\n  m_NetworkAssembly->Delete();\n\n}\n\nvoid mitk::ConnectomicsNetworkMapper3D::GenerateDataForRenderer(mitk::BaseRenderer* renderer)\n{\n  \/\/TODO: implement\n\n  if( this->GetInput() == NULL )\n  {\n    return;\n  }\n  if( this->GetInput()->GetIsModified( ) )\n  {\n    GenerateData();\n  }\n}\n\nvoid mitk::ConnectomicsNetworkMapper3D::GenerateData()\n{\n  m_NetworkAssembly->Delete();\n  m_NetworkAssembly = vtkPropAssembly::New();\n\n  \/\/ Here is the part where a graph is given and converted to points and connections between points...\n  std::vector< mitk::ConnectomicsNetwork::NetworkNode > vectorOfNodes = this->GetInput()->GetVectorOfAllNodes();\n  std::vector< std::pair< \n    std::pair< mitk::ConnectomicsNetwork::NetworkNode, mitk::ConnectomicsNetwork::NetworkNode > \n    , mitk::ConnectomicsNetwork::NetworkEdge > >  vectorOfEdges = this->GetInput()->GetVectorOfAllEdges();\n\n  \/\/ Decide on the style of rendering due to property\n  if( false )\n  {\n    mitk::Point3D tempWorldPoint, tempCNFGeometryPoint;\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/Create Spheres\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    for(unsigned int i = 0; i < vectorOfNodes.size(); i++)\n    {\n      vtkSmartPointer<vtkSphereSource> sphereSource =\n        vtkSmartPointer<vtkSphereSource>::New();\n\n      for(unsigned int dimension = 0; dimension < 3; dimension++)\n      {\n        tempCNFGeometryPoint.SetElement( dimension , vectorOfNodes[i].coordinates[dimension] );\n      }\n\n      this->GetData()->GetGeometry()->IndexToWorld( tempCNFGeometryPoint, tempWorldPoint );\n\n      sphereSource->SetCenter( tempWorldPoint[0] , tempWorldPoint[1], tempWorldPoint[2] );\n      sphereSource->SetRadius(1.0);\n\n      vtkSmartPointer<vtkPolyDataMapper> mapper =\n        vtkSmartPointer<vtkPolyDataMapper>::New();\n      mapper->SetInput(sphereSource->GetOutput());\n\n      vtkSmartPointer<vtkActor> actor =\n        vtkSmartPointer<vtkActor>::New();\n      actor->SetMapper(mapper);\n\n      m_NetworkAssembly->AddPart(actor);\n    }\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/Create Tubes\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n    for(unsigned int i = 0; i < vectorOfEdges.size(); i++)\n    {\n\n      vtkSmartPointer<vtkLineSource> lineSource =\n        vtkSmartPointer<vtkLineSource>::New();\n\n      for(unsigned int dimension = 0; dimension < 3; dimension++)\n      {\n        tempCNFGeometryPoint[ dimension ] = vectorOfEdges[i].first.first.coordinates[dimension];\n      }\n\n      this->GetData()->GetGeometry()->IndexToWorld( tempCNFGeometryPoint, tempWorldPoint );\n\n      lineSource->SetPoint1(tempWorldPoint[0], tempWorldPoint[1],tempWorldPoint[2]  );\n\n      for(unsigned int dimension = 0; dimension < 3; dimension++)\n      {\n        tempCNFGeometryPoint[ dimension ] = vectorOfEdges[i].first.second.coordinates[dimension];\n      }\n\n      this->GetData()->GetGeometry()->IndexToWorld( tempCNFGeometryPoint, tempWorldPoint );\n\n      lineSource->SetPoint2(tempWorldPoint[0], tempWorldPoint[1], tempWorldPoint[2] );\n\n      vtkSmartPointer<vtkTubeFilter> tubes = vtkSmartPointer<vtkTubeFilter>::New();\n      tubes->SetInput( lineSource->GetOutput() );\n      tubes->SetNumberOfSides( 12 );\n      double radiusFactor = 1.0 + ((double) vectorOfEdges[i].second.weight) \/ 10.0 ;\n      tubes->SetRadius( std::log10( radiusFactor ) );\n\n      vtkSmartPointer<vtkPolyDataMapper> mapper2 =\n        vtkSmartPointer<vtkPolyDataMapper>::New();\n      mapper2->SetInput( tubes->GetOutput() );\n\n      vtkSmartPointer<vtkActor> actor =\n        vtkSmartPointer<vtkActor>::New();\n      actor->SetMapper(mapper2);\n\n      double maxWeight = (double) this->GetInput()->GetMaximumWeight();\n      double colourFactor = vectorOfEdges[i].second.weight \/ maxWeight;\n      actor->GetProperty()->SetColor( colourFactor, colourFactor, colourFactor);\n\n\n      m_NetworkAssembly->AddPart(actor);\n\n    }\n  }\n  else\n  {\n    vtkSmartPointer<vtkMutableUndirectedGraph> graph =\n      vtkSmartPointer<vtkMutableUndirectedGraph>::New();\n\n    std::vector< vtkIdType > networkToVTKvector;\n    networkToVTKvector.resize(vectorOfNodes.size());\n\n    for(unsigned int i = 0; i < vectorOfNodes.size(); i++)\n    {\n      networkToVTKvector[vectorOfNodes[i].id] = graph->AddVertex();\n    }\n\n    for(unsigned int i = 0; i < vectorOfEdges.size(); i++)\n    {\n      graph->AddEdge(networkToVTKvector[vectorOfEdges[i].first.first.id], networkToVTKvector[vectorOfEdges[i].first.second.id]);\n    }\n\n    vtkSmartPointer<vtkPoints> points =\n      vtkSmartPointer<vtkPoints>::New();\n    for(unsigned int i = 0; i < vectorOfNodes.size(); i++)\n    {\n      double x = vectorOfNodes[i].coordinates[0];\n      double y = vectorOfNodes[i].coordinates[1];\n      double z = vectorOfNodes[i].coordinates[2];\n      points->InsertNextPoint( x, y, z);\n    }\n\n    graph->SetPoints(points);\n\n    vtkGraphLayout* layout = vtkGraphLayout::New();\n    layout->SetInput(graph);\n    layout->SetLayoutStrategy(vtkPassThroughLayoutStrategy::New());\n\n    vtkGraphToPolyData* graphToPoly = vtkGraphToPolyData::New();\n    graphToPoly->SetInputConnection(layout->GetOutputPort());\n\n    \/\/ Create the standard VTK polydata mapper and actor\n    \/\/ for the connections (edges) in the tree.\n    vtkPolyDataMapper* edgeMapper = vtkPolyDataMapper::New();\n    edgeMapper->SetInputConnection(graphToPoly->GetOutputPort());\n    vtkActor* edgeActor = vtkActor::New();\n    edgeActor->SetMapper(edgeMapper);\n    edgeActor->GetProperty()->SetColor(0.0, 0.5, 1.0);\n\n    \/\/ Glyph the points of the tree polydata to create\n    \/\/ VTK_VERTEX cells at each vertex in the tree.\n    vtkGlyph3D* vertGlyph = vtkGlyph3D::New();\n    vertGlyph->SetInputConnection(0, graphToPoly->GetOutputPort());\n    vtkGlyphSource2D* glyphSource = vtkGlyphSource2D::New();\n    glyphSource->SetGlyphTypeToVertex();\n    vertGlyph->SetInputConnection(1, glyphSource->GetOutputPort());\n\n    \/\/ Create a mapper for the vertices, and tell the mapper\n    \/\/ to use the specified color array.\n    vtkPolyDataMapper* vertMapper = vtkPolyDataMapper::New();\n    vertMapper->SetInputConnection(vertGlyph->GetOutputPort());\n    \/*if (colorArray)\n    {\n    vertMapper->SetScalarModeToUsePointFieldData();\n    vertMapper->SelectColorArray(colorArray);\n    vertMapper->SetScalarRange(colorRange);\n    }*\/\n\n    \/\/ Create an actor for the vertices.  Move the actor forward\n    \/\/ in the z direction so it is drawn on top of the edge actor.\n    vtkActor* vertActor = vtkActor::New();\n    vertActor->SetMapper(vertMapper);\n    vertActor->GetProperty()->SetPointSize(5);\n    vertActor->SetPosition(0, 0, 0.001);\n\n    m_NetworkAssembly->AddPart(edgeActor);\n    m_NetworkAssembly->AddPart(vertActor);\n  }\n\n  (static_cast<mitk::ConnectomicsNetwork * > ( GetData() ) )->SetIsModified( false );\n}\n\nconst mitk::ConnectomicsNetwork* mitk::ConnectomicsNetworkMapper3D::GetInput()\n{\n\n  return static_cast<const mitk::ConnectomicsNetwork * > ( GetData() );\n}\n\n\nvoid mitk::ConnectomicsNetworkMapper3D::SetDefaultProperties(DataNode* node, BaseRenderer* renderer , bool overwrite)\n{\n  \/\/TODO: implement\n\n\n  \/\/ hand it to the superclass for base default properties\n  Superclass::SetDefaultProperties(node, renderer, overwrite);\n}\n\nvoid mitk::ConnectomicsNetworkMapper3D::ApplyProperties(mitk::BaseRenderer* renderer)\n{\n  \/\/TODO: implement\n\n}\n\nvoid mitk::ConnectomicsNetworkMapper3D::SetVtkMapperImmediateModeRendering(vtkMapper *mapper)\n{\n  \/\/TODO: implement\n\n}\n\nvoid mitk::ConnectomicsNetworkMapper3D::UpdateVtkObjects()\n{\n  \/\/TODO: implement\n}\n\nvtkProp* mitk::ConnectomicsNetworkMapper3D::GetVtkProp(mitk::BaseRenderer *renderer)\n{\n\n  return m_NetworkAssembly;\n  \n}\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n*       SOFA, Simulation Open-Framework Architecture, version 1.0 beta 3      *\n*                (c) 2006-2008 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\n#include <sofa\/component\/topology\/DynamicSparseGridTopologyContainer.h>\n#include <sofa\/core\/ObjectFactory.h>\n\n#include <sofa\/component\/container\/VoxelGridLoader.h>\n\nnamespace sofa\n{\nnamespace component\n{\nnamespace topology\n{\n\nusing namespace std;\nusing namespace sofa::defaulttype;\n\nSOFA_DECL_CLASS ( DynamicSparseGridTopologyContainer );\nint DynamicSparseGridTopologyContainerClass = core::RegisterObject ( \"Hexahedron set topology container\" )\n        .add< DynamicSparseGridTopologyContainer >()\n        ;\n\nDynamicSparseGridTopologyContainer::DynamicSparseGridTopologyContainer()\n    : HexahedronSetTopologyContainer()\n    , resolution ( initData ( &resolution, Vec3i ( 0, 0, 0 ), \"resolution\", \"voxel grid resolution\" ) )\n    , valuesIndexedInRegularGrid( initData ( &valuesIndexedInRegularGrid, sofa::helper::vector<unsigned char>(), \"valuesIndexedInRegularGrid\", \"values indexed in the Regular Grid\" ) )\n    , valuesIndexedInTopology( initData(&valuesIndexedInTopology, \"valuesIndexedInTopology\", \"values indexed in the topology\"))\n    , idxInRegularGrid( initData ( &idxInRegularGrid, sofa::helper::vector<BaseMeshTopology::HexaID>(), \"idxInRegularGrid\", \"indices in the Regular Grid\" ) )\n    , idInRegularGrid2IndexInTopo( initData ( &idInRegularGrid2IndexInTopo, std::map< unsigned int, BaseMeshTopology::HexaID> (), \"idInRegularGrid2IndexInTopo\", \"map between id in the Regular Grid and index in the topology\" ) )\n    , voxelSize( initData(&voxelSize, defaulttype::Vector3(1,1,1), \"voxelSize\", \"Size of the Voxels\"))\n{\n}\n\nDynamicSparseGridTopologyContainer::DynamicSparseGridTopologyContainer ( const sofa::helper::vector< Hexahedron > &hexahedra )\n    : HexahedronSetTopologyContainer ( hexahedra )\n    , resolution ( initData ( &resolution, Vec3i ( 0, 0, 0 ), \"resolution\", \"voxel grid resolution\" ) )\n    , valuesIndexedInRegularGrid( initData ( &valuesIndexedInRegularGrid, sofa::helper::vector<unsigned char>(), \"valuesIndexedInRegularGrid\", \"values indexed in the Regular Grid\" ) )\n    , valuesIndexedInTopology( initData(&valuesIndexedInTopology, \"valuesIndexedInTopology\", \"values indexed in the topology\"))\n    , idxInRegularGrid( initData ( &idxInRegularGrid, sofa::helper::vector<BaseMeshTopology::HexaID>(), \"idxInRegularGrid\", \"indices in the Regular Grid\" ) )\n    , idInRegularGrid2IndexInTopo( initData ( &idInRegularGrid2IndexInTopo, std::map< unsigned int, BaseMeshTopology::HexaID> (), \"idInRegularGrid2IndexInTopo\", \"map between id in the Regular Grid and index in the topology\" ) )\n    , voxelSize( initData(&voxelSize, defaulttype::Vector3(1,1,1), \"voxelSize\", \"Size of the Voxels\"))\n{\n}\n\nvoid DynamicSparseGridTopologyContainer::loadFromMeshLoader ( sofa::component::MeshLoader* loader )\n{\n\n    if (!valuesIndexedInRegularGrid.getValue().empty()) return;\n    HexahedronSetTopologyContainer::loadFromMeshLoader( loader);\n    sofa::component::VoxelGridLoader* voxelGridLoader = dynamic_cast< sofa::component::VoxelGridLoader*> ( loader );\n    if ( !voxelGridLoader )\n    {\n        this->serr << \"DynamicSparseGridTopologyContainer::loadFromMeshLoader(): The loader used is not a VoxelGridLoader ! You must use it for this topology.\" << this->sendl;\n        exit(0);\n    }\n\n    \/\/ Init regular\/topo mapping\n    helper::vector<BaseMeshTopology::HexaID>& iirg = *idxInRegularGrid.beginEdit();\n    std::map< unsigned int, BaseMeshTopology::HexaID> &idrg2tpo = *idInRegularGrid2IndexInTopo.beginEdit();\n    helper::vector<unsigned char>& viirg = *(valuesIndexedInRegularGrid.beginEdit());\n    helper::vector<unsigned char>& viit = *(valuesIndexedInTopology.beginEdit());\n\n    voxelGridLoader->getIndicesInRegularGrid( iirg);\n    for( unsigned int i = 0; i < iirg.size(); i++)\n    {\n        idrg2tpo.insert( make_pair( iirg[i], i ));\n    }\n\n    \/\/ Init values\n    int dataSize = voxelGridLoader->getDataSize();\n    unsigned char* data = voxelGridLoader->getData();\n\n    \/\/ init values in regular grid. (dense).\n    viirg.resize( dataSize);\n    for( int i = 0; i < dataSize; i++)\n        viirg[i] = data[i];\n\n    \/\/ init values in topo. (pas dense).\n    viit.resize( iirg.size());\n    for(unsigned int i = 0; i < iirg.size(); i++)\n    {\n        viit[i] = data[iirg[i]];\n    }\n\n    \/\/ init resolution & voxelSize.\n    Vec3i& res = *resolution.beginEdit();\n    voxelGridLoader->getResolution ( res );\n    resolution.endEdit();\n    idxInRegularGrid.endEdit();\n    idInRegularGrid2IndexInTopo.endEdit();\n    valuesIndexedInRegularGrid.endEdit();\n    valuesIndexedInTopology.endEdit();\n    defaulttype::Vector3 &value=*voxelSize.beginEdit();\n    voxelGridLoader->getVoxelSize ( value );\n    voxelSize.endEdit();\n}\n\n} \/\/ namespace topology\n\n} \/\/ namespace component\n\n} \/\/ namespace sofa\n\n<commit_msg>r4328\/sofa-dev : BUGFIX: in order to generate a surface from the DynamicSparseGridTopologyContainer a mask for active voxels is needed instead the original data.<commit_after>\/******************************************************************************\n*       SOFA, Simulation Open-Framework Architecture, version 1.0 beta 3      *\n*                (c) 2006-2008 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\n#include <sofa\/component\/topology\/DynamicSparseGridTopologyContainer.h>\n#include <sofa\/core\/ObjectFactory.h>\n\n#include <sofa\/component\/container\/VoxelGridLoader.h>\n\nnamespace sofa\n{\nnamespace component\n{\nnamespace topology\n{\n\nusing namespace std;\nusing namespace sofa::defaulttype;\n\nSOFA_DECL_CLASS ( DynamicSparseGridTopologyContainer );\nint DynamicSparseGridTopologyContainerClass = core::RegisterObject ( \"Hexahedron set topology container\" )\n        .add< DynamicSparseGridTopologyContainer >()\n        ;\n\nDynamicSparseGridTopologyContainer::DynamicSparseGridTopologyContainer()\n    : HexahedronSetTopologyContainer()\n    , resolution ( initData ( &resolution, Vec3i ( 0, 0, 0 ), \"resolution\", \"voxel grid resolution\" ) )\n    , valuesIndexedInRegularGrid( initData ( &valuesIndexedInRegularGrid, sofa::helper::vector<unsigned char>(), \"valuesIndexedInRegularGrid\", \"values indexed in the Regular Grid\" ) )\n    , valuesIndexedInTopology( initData(&valuesIndexedInTopology, \"valuesIndexedInTopology\", \"values indexed in the topology\"))\n    , idxInRegularGrid( initData ( &idxInRegularGrid, sofa::helper::vector<BaseMeshTopology::HexaID>(), \"idxInRegularGrid\", \"indices in the Regular Grid\" ) )\n    , idInRegularGrid2IndexInTopo( initData ( &idInRegularGrid2IndexInTopo, std::map< unsigned int, BaseMeshTopology::HexaID> (), \"idInRegularGrid2IndexInTopo\", \"map between id in the Regular Grid and index in the topology\" ) )\n    , voxelSize( initData(&voxelSize, defaulttype::Vector3(1,1,1), \"voxelSize\", \"Size of the Voxels\"))\n{\n}\n\nDynamicSparseGridTopologyContainer::DynamicSparseGridTopologyContainer ( const sofa::helper::vector< Hexahedron > &hexahedra )\n    : HexahedronSetTopologyContainer ( hexahedra )\n    , resolution ( initData ( &resolution, Vec3i ( 0, 0, 0 ), \"resolution\", \"voxel grid resolution\" ) )\n    , valuesIndexedInRegularGrid( initData ( &valuesIndexedInRegularGrid, sofa::helper::vector<unsigned char>(), \"valuesIndexedInRegularGrid\", \"values indexed in the Regular Grid\" ) )\n    , valuesIndexedInTopology( initData(&valuesIndexedInTopology, \"valuesIndexedInTopology\", \"values indexed in the topology\"))\n    , idxInRegularGrid( initData ( &idxInRegularGrid, sofa::helper::vector<BaseMeshTopology::HexaID>(), \"idxInRegularGrid\", \"indices in the Regular Grid\" ) )\n    , idInRegularGrid2IndexInTopo( initData ( &idInRegularGrid2IndexInTopo, std::map< unsigned int, BaseMeshTopology::HexaID> (), \"idInRegularGrid2IndexInTopo\", \"map between id in the Regular Grid and index in the topology\" ) )\n    , voxelSize( initData(&voxelSize, defaulttype::Vector3(1,1,1), \"voxelSize\", \"Size of the Voxels\"))\n{\n}\n\nvoid DynamicSparseGridTopologyContainer::loadFromMeshLoader ( sofa::component::MeshLoader* loader )\n{\n\n    if (!valuesIndexedInRegularGrid.getValue().empty()) return;\n    HexahedronSetTopologyContainer::loadFromMeshLoader( loader);\n    sofa::component::VoxelGridLoader* voxelGridLoader = dynamic_cast< sofa::component::VoxelGridLoader*> ( loader );\n    if ( !voxelGridLoader )\n    {\n        this->serr << \"DynamicSparseGridTopologyContainer::loadFromMeshLoader(): The loader used is not a VoxelGridLoader ! You must use it for this topology.\" << this->sendl;\n        exit(0);\n    }\n\n    \/\/ Init regular\/topo mapping\n    helper::vector<BaseMeshTopology::HexaID>& iirg = *idxInRegularGrid.beginEdit();\n    std::map< unsigned int, BaseMeshTopology::HexaID> &idrg2tpo = *idInRegularGrid2IndexInTopo.beginEdit();\n    helper::vector<unsigned char>& viirg = *(valuesIndexedInRegularGrid.beginEdit());\n    helper::vector<unsigned char>& viit = *(valuesIndexedInTopology.beginEdit());\n\n    voxelGridLoader->getIndicesInRegularGrid( iirg);\n    for( unsigned int i = 0; i < iirg.size(); i++)\n    {\n        idrg2tpo.insert( make_pair( iirg[i], i ));\n    }\n\n    \/\/ Init values\n    int dataSize = voxelGridLoader->getDataSize();\n    unsigned char* data = voxelGridLoader->getData();\n\n    \/\/ init values in regular grid. (dense).\n    viirg.resize( dataSize);\n    \/\/for( int i = 0; i < dataSize; i++)\n    \/\/  viirg[i] = data[i];\n    for( unsigned int i = 0; i < iirg.size(); ++i)\n    {\n        viirg[iirg[i]] = 255;\n    }\n\n    \/\/ init values in topo. (pas dense).\n    viit.resize( iirg.size());\n    for(unsigned int i = 0; i < iirg.size(); i++)\n    {\n        viit[i] = data[iirg[i]];\n    }\n\n    \/\/ init resolution & voxelSize.\n    Vec3i& res = *resolution.beginEdit();\n    voxelGridLoader->getResolution ( res );\n    resolution.endEdit();\n    idxInRegularGrid.endEdit();\n    idInRegularGrid2IndexInTopo.endEdit();\n    valuesIndexedInRegularGrid.endEdit();\n    valuesIndexedInTopology.endEdit();\n    defaulttype::Vector3 &value=*voxelSize.beginEdit();\n    voxelGridLoader->getVoxelSize ( value );\n    voxelSize.endEdit();\n}\n\n} \/\/ namespace topology\n\n} \/\/ namespace component\n\n} \/\/ namespace sofa\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\nHighly Optimized Object-oriented Many-particle Dynamics -- Blue Edition\n(HOOMD-blue) Open Source Software License Copyright 2008-2011 Ames Laboratory\nIowa State University and The Regents of the University of Michigan All rights\nreserved.\n\nHOOMD-blue may contain modifications (\"Contributions\") provided, and to which\ncopyright is held, by various Contributors who have granted The Regents of the\nUniversity of Michigan the right to modify and\/or distribute such Contributions.\n\nYou may redistribute, use, and create derivate works of HOOMD-blue, in source\nand binary forms, provided you abide by the following conditions:\n\n* Redistributions of source code must retain the above copyright notice, this\nlist of conditions, and the following disclaimer both in the code and\nprominently in any materials provided with the distribution.\n\n* Redistributions in binary form must reproduce the above copyright notice, this\nlist of conditions, and the following disclaimer in the documentation and\/or\nother materials provided with the distribution.\n\n* All publications and presentations based on HOOMD-blue, including any reports\nor published results obtained, in whole or in part, with HOOMD-blue, will\nacknowledge its use according to the terms posted at the time of submission on:\nhttp:\/\/codeblue.umich.edu\/hoomd-blue\/citations.html\n\n* Any electronic documents citing HOOMD-Blue will link to the HOOMD-Blue website:\nhttp:\/\/codeblue.umich.edu\/hoomd-blue\/\n\n* Apart from the above required attributions, neither the name of the copyright\nholder nor the names of HOOMD-blue's contributors may be used to endorse or\npromote products derived from this software without specific prior written\npermission.\n\nDisclaimer\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER AND CONTRIBUTORS ``AS IS'' AND\nANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\nWARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, AND\/OR ANY\nWARRANTIES THAT THIS SOFTWARE IS FREE OF INFRINGEMENT ARE DISCLAIMED.\n\nIN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,\nINDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\nBUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\nLIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE\nOR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF\nADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*\/\n\n\n#ifdef WIN32\n#pragma warning( push )\n#pragma warning( disable : 4103 4244 )\n#endif\n\n#include <fstream>\n\n#include <boost\/bind.hpp>\n#include <boost\/function.hpp>\n\n#include \"BondTablePotential.h\"\n\n#ifdef ENABLE_CUDA\n#include \"BondTablePotentialGPU.h\"\n#endif\n\n#include \"Initializers.h\"\n\nusing namespace std;\nusing namespace boost;\n\n\/*! \\file harmonic_bond_force_test.cc\n    \\brief Implements unit tests for BondTablePotential and\n           BondTablePotentialGPU\n    \\ingroup unit_tests\n*\/\n\n\/\/! Name the boost unit test module\n#define BOOST_TEST_MODULE BondTableForceTests\n#include \"boost_utf_configure.h\"\n\n\/\/! Typedef to make using the boost::function factory easier\ntypedef boost::function<shared_ptr<BondTablePotential>  (shared_ptr<SystemDefinition> sysdef, unsigned int width)> bondforce_creator;\n\n\/\/! Perform some simple functionality tests of any BondTableForceCompute\nvoid bond_force_basic_tests(bondforce_creator bf_creator, boost::shared_ptr<ExecutionConfiguration> exec_conf)\n    {\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ start with the simplest possible test: 2 particles in a huge box with only one bond type\n    shared_ptr<SystemDefinition> sysdef_2(new SystemDefinition(2, BoxDim(1000.0), 1, 1, 0, 0, 0, exec_conf));\n    shared_ptr<ParticleData> pdata_2 = sysdef_2->getParticleData();\n    \n    pdata_2->setPosition(0,make_scalar3(0.0,0.0,0.0));\n    pdata_2->setPosition(1,make_scalar3(1.0,0.0,0.0));\n\n    \/\/ create the bond force compute to check\n    shared_ptr<BondTablePotential> fc_2 = bf_creator(sysdef_2,3);\n\n\n    \n    \/\/ compute the force and check the results\n    fc_2->compute(0);\n    GPUArray<Scalar4>& force_array_1 =  fc_2->getForceArray();\n    GPUArray<Scalar>& virial_array_1 =  fc_2->getVirialArray();\n    \n    {\n    unsigned int pitch = virial_array_1.getPitch();\n    ArrayHandle<Scalar4> h_force_1(force_array_1,access_location::host,access_mode::read);\n    ArrayHandle<Scalar> h_virial_1(virial_array_1,access_location::host,access_mode::read);\n    \/\/ check that the force is correct, it should be 0 since we haven't created any bonds yet\n    MY_BOOST_CHECK_SMALL(h_force_1.data[0].x, tol_small);\n    MY_BOOST_CHECK_SMALL(h_force_1.data[0].y, tol_small);\n    MY_BOOST_CHECK_SMALL(h_force_1.data[0].z, tol_small);\n    MY_BOOST_CHECK_SMALL(h_force_1.data[0].w, tol_small);\n    MY_BOOST_CHECK_SMALL(h_virial_1.data[0*pitch+0], tol_small);\n    MY_BOOST_CHECK_SMALL(h_virial_1.data[1*pitch+0], tol_small);\n    MY_BOOST_CHECK_SMALL(h_virial_1.data[2*pitch+0], tol_small);\n    MY_BOOST_CHECK_SMALL(h_virial_1.data[3*pitch+0], tol_small);\n    MY_BOOST_CHECK_SMALL(h_virial_1.data[4*pitch+0], tol_small);\n    MY_BOOST_CHECK_SMALL(h_virial_1.data[5*pitch+0], tol_small);\n    }\n\n\n    \/\/ add a bond and check again\n    sysdef_2->getBondData()->addBond(Bond(0, 0,1));\n    fc_2->compute(1);\n    \n    \/\/ specify a table to interpolate\n    vector<float> V, F;\n    V.push_back(10.0);  F.push_back(1.0);\n    V.push_back(21.0);  F.push_back(6.0);\n    V.push_back(5.0);   F.push_back(2.0);\n    fc_2->setTable(0, V, F, 2.0, 4.0);\n        \n    \/\/ now go to rmin and check for the correct force value\n    {\n    ArrayHandle<Scalar4> h_pos(pdata_2->getPositions(), access_location::host, access_mode::readwrite);\n    h_pos.data[1].x = Scalar(2.1);\n    }\n\n    fc_2->compute(2);\n    \n    {\n    GPUArray<Scalar4>& force_array_3 =  fc_2->getForceArray();\n    GPUArray<Scalar>& virial_array_3 =  fc_2->getVirialArray();\n    unsigned int pitch = virial_array_3.getPitch();\n    ArrayHandle<Scalar4> h_force_3(force_array_3,access_location::host,access_mode::read);\n    ArrayHandle<Scalar> h_virial_3(virial_array_3,access_location::host,access_mode::read);\n    MY_BOOST_CHECK_CLOSE(h_force_3.data[0].x, -1.0, tol);\n    MY_BOOST_CHECK_SMALL(h_force_3.data[0].y, tol_small);\n    MY_BOOST_CHECK_SMALL(h_force_3.data[0].z, tol_small);\n    MY_BOOST_CHECK_CLOSE(h_force_3.data[0].w, 5.0, tol);\n    MY_BOOST_CHECK_CLOSE(Scalar(1.\/3.)*(h_virial_3.data[0*pitch+0]\n                                       +h_virial_3.data[3*pitch+0]\n                                       +h_virial_3.data[5*pitch+0]), (1.0 \/ 6.0) * 2.0, tol);\n    \n    MY_BOOST_CHECK_CLOSE(h_force_3.data[1].x, 1.0, tol);\n    MY_BOOST_CHECK_SMALL(h_force_3.data[1].y, tol_small);\n    MY_BOOST_CHECK_SMALL(h_force_3.data[1].z, tol_small);\n    MY_BOOST_CHECK_CLOSE(h_force_3.data[1].w, 5.0, tol);\n    MY_BOOST_CHECK_CLOSE(Scalar(1.\/3.)*(h_virial_3.data[0*pitch+1]\n                                       +h_virial_3.data[3*pitch+1]\n                                       +h_virial_3.data[5*pitch+1]), (1.0 \/ 6.0) * 2.0, tol);\n    }\n\n    \/\/ go halfway in-between two points\n    {\n    ArrayHandle<Scalar4> h_pos(pdata_2->getPositions(), access_location::host, access_mode::readwrite);\n    h_pos.data[1].y = Scalar(3.5);\n    h_pos.data[1].x = Scalar(0.0);\n    }\n    \n    \/\/ check the forces\n    fc_2->compute(4);\n    \n    {\n    GPUArray<Scalar4>& force_array_4 =  fc_2->getForceArray();\n    GPUArray<Scalar>& virial_array_4 =  fc_2->getVirialArray();\n    unsigned int pitch = virial_array_4.getPitch();\n    ArrayHandle<Scalar4> h_force_4(force_array_4,access_location::host,access_mode::read);\n    ArrayHandle<Scalar> h_virial_4(virial_array_4,access_location::host,access_mode::read);\n    MY_BOOST_CHECK_CLOSE(h_force_4.data[0].y, -4.0, tol);\n    MY_BOOST_CHECK_SMALL(h_force_4.data[0].x, tol_small);\n    MY_BOOST_CHECK_SMALL(h_force_4.data[0].z, tol_small);\n    MY_BOOST_CHECK_CLOSE(h_force_4.data[0].w, 13.0\/2.0, tol);\n    MY_BOOST_CHECK_CLOSE(Scalar(1.\/3.)*(h_virial_4.data[0*pitch+0]\n                                       +h_virial_4.data[3*pitch+0]\n                                       +h_virial_4.data[5*pitch+0]), (1.0 \/ 6.0) * 4.0 * 3.5, tol);\n    \n    MY_BOOST_CHECK_CLOSE(h_force_4.data[1].y, 4.0, tol);\n    MY_BOOST_CHECK_SMALL(h_force_4.data[1].x, tol_small);\n    MY_BOOST_CHECK_SMALL(h_force_4.data[1].z, tol_small);\n    MY_BOOST_CHECK_CLOSE(h_force_4.data[1].w, 13.0 \/ 2.0, tol);\n    MY_BOOST_CHECK_CLOSE(Scalar(1.\/3.)*(h_virial_4.data[0*pitch+1]\n                                       +h_virial_4.data[3*pitch+1]\n                                       +h_virial_4.data[5*pitch+1]), (1.0 \/ 6.0) * 4.0 * 3.5, tol);\n    }\n    }    \n    \n\n\/\/! BondTablePotential creator for bond_force_basic_tests()\nshared_ptr<BondTablePotential> base_class_bf_creator(shared_ptr<SystemDefinition> sysdef, unsigned int width)\n    {\n    return shared_ptr<BondTablePotential>(new BondTablePotential(sysdef, width));\n    }\n\n#ifdef ENABLE_CUDA\n\/\/! BondTablePotential creator for bond_force_basic_tests()\nshared_ptr<BondTablePotential> gpu_bf_creator(shared_ptr<SystemDefinition> sysdef, unsigned int width)\n    {\n    return shared_ptr<BondTablePotential>(new BondTablePotentialGPU(sysdef, width));\n    }\n#endif\n\n\/\/! boost test case for bond forces on the CPU\nBOOST_AUTO_TEST_CASE( BondTablePotential_basic )\n    {\n    bondforce_creator bf_creator = bind(base_class_bf_creator, _1, _2);\n    bond_force_basic_tests(bf_creator, boost::shared_ptr<ExecutionConfiguration>(new ExecutionConfiguration(ExecutionConfiguration::CPU)));\n    }\n\n#ifdef ENABLE_CUDA\n\/\/! boost test case for bond forces on the GPU\nBOOST_AUTO_TEST_CASE( BondTablePotentialGPU_basic )\n    {\n    bondforce_creator bf_creator = bind(gpu_bf_creator, _1, _2);\n    bond_force_basic_tests(bf_creator, boost::shared_ptr<ExecutionConfiguration>(new ExecutionConfiguration(ExecutionConfiguration::GPU)));\n    }\n\n#endif\n\n\n\n#ifdef WIN32\n#pragma warning( pop )\n#endif\n\n<commit_msg>unit test on cpu and gpu tests for bond table initiation and multiple types of bonds<commit_after>\/*\nHighly Optimized Object-oriented Many-particle Dynamics -- Blue Edition\n(HOOMD-blue) Open Source Software License Copyright 2008-2011 Ames Laboratory\nIowa State University and The Regents of the University of Michigan All rights\nreserved.\n\nHOOMD-blue may contain modifications (\"Contributions\") provided, and to which\ncopyright is held, by various Contributors who have granted The Regents of the\nUniversity of Michigan the right to modify and\/or distribute such Contributions.\n\nYou may redistribute, use, and create derivate works of HOOMD-blue, in source\nand binary forms, provided you abide by the following conditions:\n\n* Redistributions of source code must retain the above copyright notice, this\nlist of conditions, and the following disclaimer both in the code and\nprominently in any materials provided with the distribution.\n\n* Redistributions in binary form must reproduce the above copyright notice, this\nlist of conditions, and the following disclaimer in the documentation and\/or\nother materials provided with the distribution.\n\n* All publications and presentations based on HOOMD-blue, including any reports\nor published results obtained, in whole or in part, with HOOMD-blue, will\nacknowledge its use according to the terms posted at the time of submission on:\nhttp:\/\/codeblue.umich.edu\/hoomd-blue\/citations.html\n\n* Any electronic documents citing HOOMD-Blue will link to the HOOMD-Blue website:\nhttp:\/\/codeblue.umich.edu\/hoomd-blue\/\n\n* Apart from the above required attributions, neither the name of the copyright\nholder nor the names of HOOMD-blue's contributors may be used to endorse or\npromote products derived from this software without specific prior written\npermission.\n\nDisclaimer\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER AND CONTRIBUTORS ``AS IS'' AND\nANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\nWARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, AND\/OR ANY\nWARRANTIES THAT THIS SOFTWARE IS FREE OF INFRINGEMENT ARE DISCLAIMED.\n\nIN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,\nINDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\nBUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\nLIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE\nOR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF\nADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*\/\n\n\n#ifdef WIN32\n#pragma warning( push )\n#pragma warning( disable : 4103 4244 )\n#endif\n\n#include <fstream>\n\n#include <boost\/bind.hpp>\n#include <boost\/function.hpp>\n\n#include \"BondTablePotential.h\"\n\n#ifdef ENABLE_CUDA\n#include \"BondTablePotentialGPU.h\"\n#endif\n\n#include \"Initializers.h\"\n\nusing namespace std;\nusing namespace boost;\n\n\/*! \\file harmonic_bond_force_test.cc\n    \\brief Implements unit tests for BondTablePotential and\n           BondTablePotentialGPU\n    \\ingroup unit_tests\n*\/\n\n\/\/! Name the boost unit test module\n#define BOOST_TEST_MODULE BondTableForceTests\n#include \"boost_utf_configure.h\"\n\n\/\/! Typedef to make using the boost::function factory easier\ntypedef boost::function<shared_ptr<BondTablePotential>  (shared_ptr<SystemDefinition> sysdef, unsigned int width)> bondforce_creator;\n\n\/\/! Perform some simple functionality tests of any BondTableForceCompute\nvoid bond_force_basic_tests(bondforce_creator bf_creator, boost::shared_ptr<ExecutionConfiguration> exec_conf)\n    {\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ start with the simplest possible test: 2 particles in a huge box with only one bond type\n    shared_ptr<SystemDefinition> sysdef_2(new SystemDefinition(2, BoxDim(1000.0), 1, 1, 0, 0, 0, exec_conf));\n    shared_ptr<ParticleData> pdata_2 = sysdef_2->getParticleData();\n    \n    pdata_2->setPosition(0,make_scalar3(0.0,0.0,0.0));\n    pdata_2->setPosition(1,make_scalar3(1.0,0.0,0.0));\n\n    \/\/ create the bond force compute to check\n    shared_ptr<BondTablePotential> fc_2 = bf_creator(sysdef_2,3);\n\n\n    \n    \/\/ compute the force and check the results\n    fc_2->compute(0);\n    GPUArray<Scalar4>& force_array_1 =  fc_2->getForceArray();\n    GPUArray<Scalar>& virial_array_1 =  fc_2->getVirialArray();\n    \n    {\n    unsigned int pitch = virial_array_1.getPitch();\n    ArrayHandle<Scalar4> h_force_1(force_array_1,access_location::host,access_mode::read);\n    ArrayHandle<Scalar> h_virial_1(virial_array_1,access_location::host,access_mode::read);\n    \/\/ check that the force is correct, it should be 0 since we haven't created any bonds yet\n    MY_BOOST_CHECK_SMALL(h_force_1.data[0].x, tol_small);\n    MY_BOOST_CHECK_SMALL(h_force_1.data[0].y, tol_small);\n    MY_BOOST_CHECK_SMALL(h_force_1.data[0].z, tol_small);\n    MY_BOOST_CHECK_SMALL(h_force_1.data[0].w, tol_small);\n    MY_BOOST_CHECK_SMALL(h_virial_1.data[0*pitch+0], tol_small);\n    MY_BOOST_CHECK_SMALL(h_virial_1.data[1*pitch+0], tol_small);\n    MY_BOOST_CHECK_SMALL(h_virial_1.data[2*pitch+0], tol_small);\n    MY_BOOST_CHECK_SMALL(h_virial_1.data[3*pitch+0], tol_small);\n    MY_BOOST_CHECK_SMALL(h_virial_1.data[4*pitch+0], tol_small);\n    MY_BOOST_CHECK_SMALL(h_virial_1.data[5*pitch+0], tol_small);\n    }\n\n\n    \/\/ add a bond and check again\n    sysdef_2->getBondData()->addBond(Bond(0, 0,1));\n    \n    \/\/ specify a table to interpolate\n    vector<float> V, F;\n    V.push_back(10.0);  F.push_back(1.0);\n    V.push_back(21.0);  F.push_back(6.0);\n    V.push_back(5.0);   F.push_back(2.0);\n    fc_2->setTable(0, V, F, 2.0, 4.0);\n        \n    \/\/ now go to rmin and check for the correct force value\n    {\n    ArrayHandle<Scalar4> h_pos(pdata_2->getPositions(), access_location::host, access_mode::readwrite);\n    h_pos.data[1].x = Scalar(2.0);\n    }\n\n    fc_2->compute(1);\n    \n    {\n    GPUArray<Scalar4>& force_array_3 =  fc_2->getForceArray();\n    GPUArray<Scalar>& virial_array_3 =  fc_2->getVirialArray();\n    unsigned int pitch = virial_array_3.getPitch();\n    ArrayHandle<Scalar4> h_force_3(force_array_3,access_location::host,access_mode::read);\n    ArrayHandle<Scalar> h_virial_3(virial_array_3,access_location::host,access_mode::read);\n    \n    MY_BOOST_CHECK_CLOSE(h_force_3.data[0].x, -1.0, tol);\n    MY_BOOST_CHECK_SMALL(h_force_3.data[0].y, tol_small);\n    MY_BOOST_CHECK_SMALL(h_force_3.data[0].z, tol_small);\n    MY_BOOST_CHECK_CLOSE(h_force_3.data[0].w, 5.0, tol);\n    MY_BOOST_CHECK_CLOSE(Scalar(1.\/3.)*(h_virial_3.data[0*pitch+0]\n                                       +h_virial_3.data[3*pitch+0]\n                                       +h_virial_3.data[5*pitch+0]), (1.0 \/ 6.0) * 2.0, tol);\n    \n    MY_BOOST_CHECK_CLOSE(h_force_3.data[1].x, 1.0, tol);\n    MY_BOOST_CHECK_SMALL(h_force_3.data[1].y, tol_small);\n    MY_BOOST_CHECK_SMALL(h_force_3.data[1].z, tol_small);\n    MY_BOOST_CHECK_CLOSE(h_force_3.data[1].w, 5.0, tol);\n    MY_BOOST_CHECK_CLOSE(Scalar(1.\/3.)*(h_virial_3.data[0*pitch+1]\n                                       +h_virial_3.data[3*pitch+1]\n                                       +h_virial_3.data[5*pitch+1]), (1.0 \/ 6.0) * 2.0, tol);\n    }\n\n    \/\/ go halfway in-between two points\n    {\n    ArrayHandle<Scalar4> h_pos(pdata_2->getPositions(), access_location::host, access_mode::readwrite);\n    h_pos.data[1].y = Scalar(3.5);\n    h_pos.data[1].x = Scalar(0.0);\n    }\n    \n    \/\/ check the forces\n    fc_2->compute(2);\n    \n    {\n    GPUArray<Scalar4>& force_array_4 =  fc_2->getForceArray();\n    GPUArray<Scalar>& virial_array_4 =  fc_2->getVirialArray();\n    unsigned int pitch = virial_array_4.getPitch();\n    ArrayHandle<Scalar4> h_force_4(force_array_4,access_location::host,access_mode::read);\n    ArrayHandle<Scalar> h_virial_4(virial_array_4,access_location::host,access_mode::read);\n    MY_BOOST_CHECK_CLOSE(h_force_4.data[0].y, -4.0, tol);\n    MY_BOOST_CHECK_SMALL(h_force_4.data[0].x, tol_small);\n    MY_BOOST_CHECK_SMALL(h_force_4.data[0].z, tol_small);\n    MY_BOOST_CHECK_CLOSE(h_force_4.data[0].w, 13.0\/2.0, tol);\n    MY_BOOST_CHECK_CLOSE(Scalar(1.\/3.)*(h_virial_4.data[0*pitch+0]\n                                       +h_virial_4.data[3*pitch+0]\n                                       +h_virial_4.data[5*pitch+0]), (1.0 \/ 6.0) * 4.0 * 3.5, tol);\n    \n    MY_BOOST_CHECK_CLOSE(h_force_4.data[1].y, 4.0, tol);\n    MY_BOOST_CHECK_SMALL(h_force_4.data[1].x, tol_small);\n    MY_BOOST_CHECK_SMALL(h_force_4.data[1].z, tol_small);\n    MY_BOOST_CHECK_CLOSE(h_force_4.data[1].w, 13.0 \/ 2.0, tol);\n    MY_BOOST_CHECK_CLOSE(Scalar(1.\/3.)*(h_virial_4.data[0*pitch+1]\n                                       +h_virial_4.data[3*pitch+1]\n                                       +h_virial_4.data[5*pitch+1]), (1.0 \/ 6.0) * 4.0 * 3.5, tol);\n    }\n    }    \n\n\n\/\/! checks to see if BondTablePotential correctly handles multiple types\nvoid bond_force_type_test(bondforce_creator bf_creator, boost::shared_ptr<ExecutionConfiguration> exec_conf)\n    {\n    \/\/ start with the simplest possible test: 3 particles in a huge box with two bond types\n    shared_ptr<SystemDefinition> sysdef_2(new SystemDefinition(3, BoxDim(1000.0), 1, 2, 0, 0, 0, exec_conf));\n    shared_ptr<ParticleData> pdata_2 = sysdef_2->getParticleData();\n\n    {\n    pdata_2->setPosition(0,make_scalar3(0.0,0.0,0.0));\n    pdata_2->setPosition(1,make_scalar3(1.0,0.0,0.0));\n    pdata_2->setPosition(2,make_scalar3(1.0,1.0,0.0));\n    }\n    \n    \/\/ create the bond force compute to check\n    shared_ptr<BondTablePotential> fc_2 = bf_creator(sysdef_2,3);\n    \n    \/\/ specify a table to interpolate\n    vector<float> V, F;\n    V.push_back(10.0);  F.push_back(1.0);\n    V.push_back(20.0);  F.push_back(6.0);\n    V.push_back(5.0);   F.push_back(2.0);\n    fc_2->setTable(0, V, F, 1.0, 2.0);\n    \n    \/\/ specify a second table to interpolate\n    V.clear(); F.clear();\n    V.push_back(20.0);  F.push_back(2.0);\n    V.push_back(40.0);  F.push_back(12.0);\n    V.push_back(10.0);   F.push_back(4.0);\n    fc_2->setTable(1, V, F, 0.0, 2.0);\n    \n    \/\/ add a bond \n    sysdef_2->getBondData()->addBond(Bond(0, 0,1));\n    \n    \/\/ add a second bond\n    sysdef_2->getBondData()->addBond(Bond(1, 1,2));\n    \n    \/\/ compute and check\n    fc_2->compute(0);\n    \n    {\n    GPUArray<Scalar4>& force_array_6 =  fc_2->getForceArray();\n    GPUArray<Scalar>& virial_array_6 =  fc_2->getVirialArray();\n    unsigned int pitch = virial_array_6.getPitch();\n    ArrayHandle<Scalar4> h_force_6(force_array_6,access_location::host,access_mode::read);\n    ArrayHandle<Scalar> h_virial_6(virial_array_6,access_location::host,access_mode::read);\n    \n    MY_BOOST_CHECK_CLOSE(h_force_6.data[0].x, -1.0, tol);\n    MY_BOOST_CHECK_SMALL(h_force_6.data[0].y, tol_small);\n    MY_BOOST_CHECK_SMALL(h_force_6.data[0].z, tol_small);\n    MY_BOOST_CHECK_CLOSE(h_force_6.data[0].w, 5.0, tol);\n    MY_BOOST_CHECK_CLOSE(Scalar(1.\/3.)*(h_virial_6.data[0*pitch+0]\n                                       +h_virial_6.data[3*pitch+0]\n                                       +h_virial_6.data[5*pitch+0]), (1.0)*1.0\/6.0, tol);\n    \n    MY_BOOST_CHECK_CLOSE(h_force_6.data[1].x, 1.0, tol);\n    MY_BOOST_CHECK_CLOSE(h_force_6.data[1].y, -12.0, tol);\n    MY_BOOST_CHECK_SMALL(h_force_6.data[1].z, tol_small);\n    MY_BOOST_CHECK_CLOSE(h_force_6.data[1].w, 20.0 + 5.0, tol);\n    MY_BOOST_CHECK_CLOSE(Scalar(1.\/3.)*(h_virial_6.data[0*pitch+1]\n                                       +h_virial_6.data[3*pitch+1]\n                                       +h_virial_6.data[5*pitch+1]), (1*1.0 + 12.0 * 1.0)*1.0\/6.0, tol);\n    \n    MY_BOOST_CHECK_SMALL(h_force_6.data[2].x, tol_small);\n    MY_BOOST_CHECK_CLOSE(h_force_6.data[2].y, 12.0, tol);\n    MY_BOOST_CHECK_SMALL(h_force_6.data[2].z, tol_small);\n    MY_BOOST_CHECK_SMALL(h_force_6.data[2].w, 120.0);\n    MY_BOOST_CHECK_CLOSE(Scalar(1.\/3.)*(h_virial_6.data[0*pitch+2]\n                                       +h_virial_6.data[3*pitch+2]\n                                       +h_virial_6.data[5*pitch+2]), (12*1.0)*1.0\/6.0, tol);\n    \n    }\n     }\n\n    \n\n\/\/! BondTablePotential creator for bond_force_basic_tests()\nshared_ptr<BondTablePotential> base_class_bf_creator(shared_ptr<SystemDefinition> sysdef, unsigned int width)\n    {\n    return shared_ptr<BondTablePotential>(new BondTablePotential(sysdef, width));\n    }\n\n#ifdef ENABLE_CUDA\n\/\/! BondTablePotential creator for bond_force_basic_tests()\nshared_ptr<BondTablePotential> gpu_bf_creator(shared_ptr<SystemDefinition> sysdef, unsigned int width)\n    {\n    return shared_ptr<BondTablePotential>(new BondTablePotentialGPU(sysdef, width));\n    }\n#endif\n\n\/\/! boost test case for bond forces on the CPU\nBOOST_AUTO_TEST_CASE( BondTablePotential_basic )\n    {\n    bondforce_creator bf_creator = bind(base_class_bf_creator, _1, _2);\n    bond_force_basic_tests(bf_creator, boost::shared_ptr<ExecutionConfiguration>(new ExecutionConfiguration(ExecutionConfiguration::CPU)));\n    }\n   \n\/\/! boost test case for bond force type on the CPU\nBOOST_AUTO_TEST_CASE( BondTablePotential_type )\n    {\n    bondforce_creator bf_creator = bind(base_class_bf_creator, _1, _2);\n    bond_force_type_test(bf_creator, boost::shared_ptr<ExecutionConfiguration>(new ExecutionConfiguration(ExecutionConfiguration::CPU)));\n    }\n      \n\n#ifdef ENABLE_CUDA\n\/\/! boost test case for bond forces on the GPU\nBOOST_AUTO_TEST_CASE( BondTablePotentialGPU_basic )\n    {\n    bondforce_creator bf_creator = bind(gpu_bf_creator, _1, _2);\n    bond_force_basic_tests(bf_creator, boost::shared_ptr<ExecutionConfiguration>(new ExecutionConfiguration(ExecutionConfiguration::GPU)));\n    }\n    \n\/\/! boost test case for bond force type on the GPU\nBOOST_AUTO_TEST_CASE( BondTablePotentialGPU_type )\n    {\n    bondforce_creator bf_creator = bind(gpu_bf_creator, _1, _2);\n    bond_force_type_test(bf_creator, boost::shared_ptr<ExecutionConfiguration>(new ExecutionConfiguration(ExecutionConfiguration::GPU)));\n    }    \n\n#endif\n\n\n\n#ifdef WIN32\n#pragma warning( pop )\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2016 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\/\/ Basic tests for the ValidationState_t datastructure.\n\n#include <string>\n\n#include \"gmock\/gmock.h\"\n#include \"source\/spirv_validator_options.h\"\n#include \"test\/unit_spirv.h\"\n#include \"test\/val\/val_fixtures.h\"\n\nnamespace spvtools {\nnamespace val {\nnamespace {\n\nusing ::testing::HasSubstr;\n\nusing ValidationStateTest = spvtest::ValidateBase<bool>;\n\nconst char kHeader[] =\n    \" OpCapability Shader\"\n    \" OpCapability Linkage\"\n    \" OpMemoryModel Logical GLSL450 \";\n\nconst char kVulkanMemoryHeader[] =\n    \" OpCapability Shader\"\n    \" OpCapability VulkanMemoryModelKHR\"\n    \" OpExtension \\\"SPV_KHR_vulkan_memory_model\\\"\"\n    \" OpMemoryModel Logical VulkanKHR \";\n\nconst char kVoidFVoid[] =\n    \" %void   = OpTypeVoid\"\n    \" %void_f = OpTypeFunction %void\"\n    \" %func   = OpFunction %void None %void_f\"\n    \" %label  = OpLabel\"\n    \"           OpReturn\"\n    \"           OpFunctionEnd \";\n\n\/\/ k*RecursiveBody examples originally from test\/opt\/function_test.cpp\nconst char* kNonRecursiveBody = R\"(\nOpEntryPoint Fragment %1 \"main\"\nOpExecutionMode %1 OriginUpperLeft\n%void = OpTypeVoid\n%4 = OpTypeFunction %void\n%float = OpTypeFloat 32\n%_struct_6 = OpTypeStruct %float %float\n%7 = OpTypeFunction %_struct_6\n%1 = OpFunction %void Pure|Const %4\n%8 = OpLabel\n%2 = OpFunctionCall %_struct_6 %9\nOpKill\nOpFunctionEnd\n%9 = OpFunction %_struct_6 None %7\n%10 = OpLabel\n%11 = OpFunctionCall %_struct_6 %12\nOpUnreachable\nOpFunctionEnd\n%12 = OpFunction %_struct_6 None %7\n%13 = OpLabel\nOpUnreachable\nOpFunctionEnd\n)\";\n\nconst char* kDirectlyRecursiveBody = R\"(\nOpEntryPoint Fragment %1 \"main\"\nOpExecutionMode %1 OriginUpperLeft\n%void = OpTypeVoid\n%4 = OpTypeFunction %void\n%float = OpTypeFloat 32\n%_struct_6 = OpTypeStruct %float %float\n%7 = OpTypeFunction %_struct_6\n%1 = OpFunction %void Pure|Const %4\n%8 = OpLabel\n%2 = OpFunctionCall %_struct_6 %9\nOpKill\nOpFunctionEnd\n%9 = OpFunction %_struct_6 None %7\n%10 = OpLabel\n%11 = OpFunctionCall %_struct_6 %9\nOpUnreachable\nOpFunctionEnd\n)\";\n\nconst char* kIndirectlyRecursiveBody = R\"(\nOpEntryPoint Fragment %1 \"main\"\nOpExecutionMode %1 OriginUpperLeft\n%void = OpTypeVoid\n%4 = OpTypeFunction %void\n%float = OpTypeFloat 32\n%_struct_6 = OpTypeStruct %float %float\n%7 = OpTypeFunction %_struct_6\n%1 = OpFunction %void Pure|Const %4\n%8 = OpLabel\n%2 = OpFunctionCall %_struct_6 %9\nOpKill\nOpFunctionEnd\n%9 = OpFunction %_struct_6 None %7\n%10 = OpLabel\n%11 = OpFunctionCall %_struct_6 %12\nOpUnreachable\nOpFunctionEnd\n%12 = OpFunction %_struct_6 None %7\n%13 = OpLabel\n%14 = OpFunctionCall %_struct_6 %9\nOpUnreachable\nOpFunctionEnd\n)\";\n\n\/\/ Tests that the instruction count in ValidationState is correct.\nTEST_F(ValidationStateTest, CheckNumInstructions) {\n  std::string spirv = std::string(kHeader) + \"%int = OpTypeInt 32 0\";\n  CompileSuccessfully(spirv);\n  EXPECT_EQ(SPV_SUCCESS, ValidateAndRetrieveValidationState());\n  EXPECT_EQ(size_t(4), vstate_->ordered_instructions().size());\n}\n\n\/\/ Tests that the number of global variables in ValidationState is correct.\nTEST_F(ValidationStateTest, CheckNumGlobalVars) {\n  std::string spirv = std::string(kHeader) + R\"(\n     %int = OpTypeInt 32 0\n%_ptr_int = OpTypePointer Input %int\n   %var_1 = OpVariable %_ptr_int Input\n   %var_2 = OpVariable %_ptr_int Input\n  )\";\n  CompileSuccessfully(spirv);\n  EXPECT_EQ(SPV_SUCCESS, ValidateAndRetrieveValidationState());\n  EXPECT_EQ(unsigned(2), vstate_->num_global_vars());\n}\n\n\/\/ Tests that the number of local variables in ValidationState is correct.\nTEST_F(ValidationStateTest, CheckNumLocalVars) {\n  std::string spirv = std::string(kHeader) + R\"(\n %int      = OpTypeInt 32 0\n %_ptr_int = OpTypePointer Function %int\n %voidt    = OpTypeVoid\n %funct    = OpTypeFunction %voidt\n %main     = OpFunction %voidt None %funct\n %entry    = OpLabel\n %var_1    = OpVariable %_ptr_int Function\n %var_2    = OpVariable %_ptr_int Function\n %var_3    = OpVariable %_ptr_int Function\n OpReturn\n OpFunctionEnd\n  )\";\n  CompileSuccessfully(spirv);\n  EXPECT_EQ(SPV_SUCCESS, ValidateAndRetrieveValidationState());\n  EXPECT_EQ(unsigned(3), vstate_->num_local_vars());\n}\n\n\/\/ Tests that the \"id bound\" in ValidationState is correct.\nTEST_F(ValidationStateTest, CheckIdBound) {\n  std::string spirv = std::string(kHeader) + R\"(\n %int      = OpTypeInt 32 0\n %voidt    = OpTypeVoid\n  )\";\n  CompileSuccessfully(spirv);\n  EXPECT_EQ(SPV_SUCCESS, ValidateAndRetrieveValidationState());\n  EXPECT_EQ(unsigned(3), vstate_->getIdBound());\n}\n\n\/\/ Tests that the entry_points in ValidationState is correct.\nTEST_F(ValidationStateTest, CheckEntryPoints) {\n  std::string spirv = std::string(kHeader) +\n                      \" OpEntryPoint Vertex %func \\\"shader\\\"\" +\n                      std::string(kVoidFVoid);\n  CompileSuccessfully(spirv);\n  EXPECT_EQ(SPV_SUCCESS, ValidateAndRetrieveValidationState());\n  EXPECT_EQ(size_t(1), vstate_->entry_points().size());\n  EXPECT_EQ(SpvOpFunction,\n            vstate_->FindDef(vstate_->entry_points()[0])->opcode());\n}\n\nTEST_F(ValidationStateTest, CheckStructMemberLimitOption) {\n  spvValidatorOptionsSetUniversalLimit(\n      options_, spv_validator_limit_max_struct_members, 32000u);\n  EXPECT_EQ(32000u, options_->universal_limits_.max_struct_members);\n}\n\nTEST_F(ValidationStateTest, CheckNumGlobalVarsLimitOption) {\n  spvValidatorOptionsSetUniversalLimit(\n      options_, spv_validator_limit_max_global_variables, 100u);\n  EXPECT_EQ(100u, options_->universal_limits_.max_global_variables);\n}\n\nTEST_F(ValidationStateTest, CheckNumLocalVarsLimitOption) {\n  spvValidatorOptionsSetUniversalLimit(\n      options_, spv_validator_limit_max_local_variables, 100u);\n  EXPECT_EQ(100u, options_->universal_limits_.max_local_variables);\n}\n\nTEST_F(ValidationStateTest, CheckStructDepthLimitOption) {\n  spvValidatorOptionsSetUniversalLimit(\n      options_, spv_validator_limit_max_struct_depth, 100u);\n  EXPECT_EQ(100u, options_->universal_limits_.max_struct_depth);\n}\n\nTEST_F(ValidationStateTest, CheckSwitchBranchesLimitOption) {\n  spvValidatorOptionsSetUniversalLimit(\n      options_, spv_validator_limit_max_switch_branches, 100u);\n  EXPECT_EQ(100u, options_->universal_limits_.max_switch_branches);\n}\n\nTEST_F(ValidationStateTest, CheckFunctionArgsLimitOption) {\n  spvValidatorOptionsSetUniversalLimit(\n      options_, spv_validator_limit_max_function_args, 100u);\n  EXPECT_EQ(100u, options_->universal_limits_.max_function_args);\n}\n\nTEST_F(ValidationStateTest, CheckCFGDepthLimitOption) {\n  spvValidatorOptionsSetUniversalLimit(\n      options_, spv_validator_limit_max_control_flow_nesting_depth, 100u);\n  EXPECT_EQ(100u, options_->universal_limits_.max_control_flow_nesting_depth);\n}\n\nTEST_F(ValidationStateTest, CheckAccessChainIndexesLimitOption) {\n  spvValidatorOptionsSetUniversalLimit(\n      options_, spv_validator_limit_max_access_chain_indexes, 100u);\n  EXPECT_EQ(100u, options_->universal_limits_.max_access_chain_indexes);\n}\n\nTEST_F(ValidationStateTest, CheckNonRecursiveBodyGood) {\n  std::string spirv = std::string(kHeader) + kNonRecursiveBody;\n  CompileSuccessfully(spirv);\n  EXPECT_EQ(SPV_SUCCESS, ValidateAndRetrieveValidationState());\n}\n\nTEST_F(ValidationStateTest, CheckVulkanNonRecursiveBodyGood) {\n  std::string spirv = std::string(kVulkanMemoryHeader) + kNonRecursiveBody;\n  CompileSuccessfully(spirv, SPV_ENV_VULKAN_1_1);\n  EXPECT_EQ(SPV_SUCCESS,\n            ValidateAndRetrieveValidationState(SPV_ENV_VULKAN_1_1));\n}\n\nTEST_F(ValidationStateTest, CheckWebGPUNonRecursiveBodyGood) {\n  std::string spirv = std::string(kVulkanMemoryHeader) + kNonRecursiveBody;\n  CompileSuccessfully(spirv, SPV_ENV_WEBGPU_0);\n  EXPECT_EQ(SPV_SUCCESS, ValidateAndRetrieveValidationState(SPV_ENV_WEBGPU_0));\n}\n\nTEST_F(ValidationStateTest, CheckDirectlyRecursiveBodyGood) {\n  std::string spirv = std::string(kHeader) + kDirectlyRecursiveBody;\n  CompileSuccessfully(spirv);\n  EXPECT_EQ(SPV_SUCCESS, ValidateAndRetrieveValidationState());\n}\n\nTEST_F(ValidationStateTest, CheckVulkanDirectlyRecursiveBodyBad) {\n  std::string spirv = std::string(kVulkanMemoryHeader) + kDirectlyRecursiveBody;\n  CompileSuccessfully(spirv, SPV_ENV_VULKAN_1_1);\n  EXPECT_EQ(SPV_ERROR_INVALID_BINARY,\n            ValidateAndRetrieveValidationState(SPV_ENV_VULKAN_1_1));\n  EXPECT_THAT(getDiagnosticString(),\n              HasSubstr(\"Entry points may not have a call graph with cycles.\\n \"\n                        \" %1 = OpFunction %void Pure|Const %3\\n\"));\n}\n\nTEST_F(ValidationStateTest, CheckWebGPUDirectlyRecursiveBodyBad) {\n  std::string spirv = std::string(kVulkanMemoryHeader) + kDirectlyRecursiveBody;\n  CompileSuccessfully(spirv, SPV_ENV_WEBGPU_0);\n  EXPECT_EQ(SPV_ERROR_INVALID_BINARY,\n            ValidateAndRetrieveValidationState(SPV_ENV_WEBGPU_0));\n  EXPECT_THAT(getDiagnosticString(),\n              HasSubstr(\"Entry points may not have a call graph with cycles.\\n \"\n                        \" %1 = OpFunction %void Pure|Const %3\\n\"));\n}\n\nTEST_F(ValidationStateTest, CheckIndirectlyRecursiveBodyGood) {\n  std::string spirv = std::string(kHeader) + kIndirectlyRecursiveBody;\n  CompileSuccessfully(spirv);\n  EXPECT_EQ(SPV_SUCCESS, ValidateAndRetrieveValidationState());\n}\n\nTEST_F(ValidationStateTest, CheckVulkanIndirectlyRecursiveBodyBad) {\n  std::string spirv =\n      std::string(kVulkanMemoryHeader) + kIndirectlyRecursiveBody;\n  CompileSuccessfully(spirv, SPV_ENV_VULKAN_1_1);\n  EXPECT_EQ(SPV_ERROR_INVALID_BINARY,\n            ValidateAndRetrieveValidationState(SPV_ENV_VULKAN_1_1));\n  EXPECT_THAT(getDiagnosticString(),\n              HasSubstr(\"Entry points may not have a call graph with cycles.\\n \"\n                        \" %1 = OpFunction %void Pure|Const %3\\n\"));\n}\n\nTEST_F(ValidationStateTest, CheckWebGPUIndirectlyRecursiveBodyBad) {\n  std::string spirv =\n      std::string(kVulkanMemoryHeader) + kIndirectlyRecursiveBody;\n  CompileSuccessfully(spirv, SPV_ENV_WEBGPU_0);\n  EXPECT_EQ(SPV_ERROR_INVALID_BINARY,\n            ValidateAndRetrieveValidationState(SPV_ENV_WEBGPU_0));\n  EXPECT_THAT(getDiagnosticString(),\n              HasSubstr(\"Entry points may not have a call graph with cycles.\\n \"\n                        \" %1 = OpFunction %void Pure|Const %3\\n\"));\n}\n\n}  \/\/ namespace\n}  \/\/ namespace val\n}  \/\/ namespace spvtools\n<commit_msg>Fix broken recurison validation tests (#2174)<commit_after>\/\/ Copyright (c) 2016 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\/\/ Basic tests for the ValidationState_t datastructure.\n\n#include <string>\n\n#include \"gmock\/gmock.h\"\n#include \"source\/spirv_validator_options.h\"\n#include \"test\/unit_spirv.h\"\n#include \"test\/val\/val_fixtures.h\"\n\nnamespace spvtools {\nnamespace val {\nnamespace {\n\nusing ::testing::HasSubstr;\n\nusing ValidationStateTest = spvtest::ValidateBase<bool>;\n\nconst char kHeader[] =\n    \" OpCapability Shader\"\n    \" OpCapability Linkage\"\n    \" OpMemoryModel Logical GLSL450 \";\n\nconst char kVulkanMemoryHeader[] =\n    \" OpCapability Shader\"\n    \" OpCapability VulkanMemoryModelKHR\"\n    \" OpExtension \\\"SPV_KHR_vulkan_memory_model\\\"\"\n    \" OpMemoryModel Logical VulkanKHR \";\n\nconst char kVoidFVoid[] =\n    \" %void   = OpTypeVoid\"\n    \" %void_f = OpTypeFunction %void\"\n    \" %func   = OpFunction %void None %void_f\"\n    \" %label  = OpLabel\"\n    \"           OpReturn\"\n    \"           OpFunctionEnd \";\n\n\/\/ k*RecursiveBody examples originally from test\/opt\/function_test.cpp\nconst char* kNonRecursiveBody = R\"(\nOpEntryPoint Fragment %1 \"main\"\nOpExecutionMode %1 OriginUpperLeft\n%void = OpTypeVoid\n%4 = OpTypeFunction %void\n%float = OpTypeFloat 32\n%_struct_6 = OpTypeStruct %float %float\n%7 = OpTypeFunction %_struct_6\n%12 = OpFunction %_struct_6 None %7\n%13 = OpLabel\nOpUnreachable\nOpFunctionEnd\n%9 = OpFunction %_struct_6 None %7\n%10 = OpLabel\n%11 = OpFunctionCall %_struct_6 %12\nOpUnreachable\nOpFunctionEnd\n%1 = OpFunction %void Pure|Const %4\n%8 = OpLabel\n%2 = OpFunctionCall %_struct_6 %9\nOpKill\nOpFunctionEnd\n)\";\n\nconst char* kDirectlyRecursiveBody = R\"(\nOpEntryPoint Fragment %1 \"main\"\nOpExecutionMode %1 OriginUpperLeft\n%void = OpTypeVoid\n%4 = OpTypeFunction %void\n%float = OpTypeFloat 32\n%_struct_6 = OpTypeStruct %float %float\n%7 = OpTypeFunction %_struct_6\n%9 = OpFunction %_struct_6 None %7\n%10 = OpLabel\n%11 = OpFunctionCall %_struct_6 %9\nOpKill\nOpFunctionEnd\n%1 = OpFunction %void Pure|Const %4\n%8 = OpLabel\n%2 = OpFunctionCall %_struct_6 %9\nOpUnreachable\nOpFunctionEnd\n)\";\n\nconst char* kIndirectlyRecursiveBody = R\"(\nOpEntryPoint Fragment %1 \"main\"\nOpExecutionMode %1 OriginUpperLeft\n%void = OpTypeVoid\n%4 = OpTypeFunction %void\n%float = OpTypeFloat 32\n%_struct_6 = OpTypeStruct %float %float\n%7 = OpTypeFunction %_struct_6\n%9 = OpFunction %_struct_6 None %7\n%10 = OpLabel\n%11 = OpFunctionCall %_struct_6 %12\nOpUnreachable\nOpFunctionEnd\n%12 = OpFunction %_struct_6 None %7\n%13 = OpLabel\n%14 = OpFunctionCall %_struct_6 %9\nOpUnreachable\nOpFunctionEnd\n%1 = OpFunction %void Pure|Const %4\n%8 = OpLabel\n%2 = OpFunctionCall %_struct_6 %9\nOpKill\nOpFunctionEnd\n)\";\n\n\/\/ Tests that the instruction count in ValidationState is correct.\nTEST_F(ValidationStateTest, CheckNumInstructions) {\n  std::string spirv = std::string(kHeader) + \"%int = OpTypeInt 32 0\";\n  CompileSuccessfully(spirv);\n  EXPECT_EQ(SPV_SUCCESS, ValidateAndRetrieveValidationState());\n  EXPECT_EQ(size_t(4), vstate_->ordered_instructions().size());\n}\n\n\/\/ Tests that the number of global variables in ValidationState is correct.\nTEST_F(ValidationStateTest, CheckNumGlobalVars) {\n  std::string spirv = std::string(kHeader) + R\"(\n     %int = OpTypeInt 32 0\n%_ptr_int = OpTypePointer Input %int\n   %var_1 = OpVariable %_ptr_int Input\n   %var_2 = OpVariable %_ptr_int Input\n  )\";\n  CompileSuccessfully(spirv);\n  EXPECT_EQ(SPV_SUCCESS, ValidateAndRetrieveValidationState());\n  EXPECT_EQ(unsigned(2), vstate_->num_global_vars());\n}\n\n\/\/ Tests that the number of local variables in ValidationState is correct.\nTEST_F(ValidationStateTest, CheckNumLocalVars) {\n  std::string spirv = std::string(kHeader) + R\"(\n %int      = OpTypeInt 32 0\n %_ptr_int = OpTypePointer Function %int\n %voidt    = OpTypeVoid\n %funct    = OpTypeFunction %voidt\n %main     = OpFunction %voidt None %funct\n %entry    = OpLabel\n %var_1    = OpVariable %_ptr_int Function\n %var_2    = OpVariable %_ptr_int Function\n %var_3    = OpVariable %_ptr_int Function\n OpReturn\n OpFunctionEnd\n  )\";\n  CompileSuccessfully(spirv);\n  EXPECT_EQ(SPV_SUCCESS, ValidateAndRetrieveValidationState());\n  EXPECT_EQ(unsigned(3), vstate_->num_local_vars());\n}\n\n\/\/ Tests that the \"id bound\" in ValidationState is correct.\nTEST_F(ValidationStateTest, CheckIdBound) {\n  std::string spirv = std::string(kHeader) + R\"(\n %int      = OpTypeInt 32 0\n %voidt    = OpTypeVoid\n  )\";\n  CompileSuccessfully(spirv);\n  EXPECT_EQ(SPV_SUCCESS, ValidateAndRetrieveValidationState());\n  EXPECT_EQ(unsigned(3), vstate_->getIdBound());\n}\n\n\/\/ Tests that the entry_points in ValidationState is correct.\nTEST_F(ValidationStateTest, CheckEntryPoints) {\n  std::string spirv = std::string(kHeader) +\n                      \" OpEntryPoint Vertex %func \\\"shader\\\"\" +\n                      std::string(kVoidFVoid);\n  CompileSuccessfully(spirv);\n  EXPECT_EQ(SPV_SUCCESS, ValidateAndRetrieveValidationState());\n  EXPECT_EQ(size_t(1), vstate_->entry_points().size());\n  EXPECT_EQ(SpvOpFunction,\n            vstate_->FindDef(vstate_->entry_points()[0])->opcode());\n}\n\nTEST_F(ValidationStateTest, CheckStructMemberLimitOption) {\n  spvValidatorOptionsSetUniversalLimit(\n      options_, spv_validator_limit_max_struct_members, 32000u);\n  EXPECT_EQ(32000u, options_->universal_limits_.max_struct_members);\n}\n\nTEST_F(ValidationStateTest, CheckNumGlobalVarsLimitOption) {\n  spvValidatorOptionsSetUniversalLimit(\n      options_, spv_validator_limit_max_global_variables, 100u);\n  EXPECT_EQ(100u, options_->universal_limits_.max_global_variables);\n}\n\nTEST_F(ValidationStateTest, CheckNumLocalVarsLimitOption) {\n  spvValidatorOptionsSetUniversalLimit(\n      options_, spv_validator_limit_max_local_variables, 100u);\n  EXPECT_EQ(100u, options_->universal_limits_.max_local_variables);\n}\n\nTEST_F(ValidationStateTest, CheckStructDepthLimitOption) {\n  spvValidatorOptionsSetUniversalLimit(\n      options_, spv_validator_limit_max_struct_depth, 100u);\n  EXPECT_EQ(100u, options_->universal_limits_.max_struct_depth);\n}\n\nTEST_F(ValidationStateTest, CheckSwitchBranchesLimitOption) {\n  spvValidatorOptionsSetUniversalLimit(\n      options_, spv_validator_limit_max_switch_branches, 100u);\n  EXPECT_EQ(100u, options_->universal_limits_.max_switch_branches);\n}\n\nTEST_F(ValidationStateTest, CheckFunctionArgsLimitOption) {\n  spvValidatorOptionsSetUniversalLimit(\n      options_, spv_validator_limit_max_function_args, 100u);\n  EXPECT_EQ(100u, options_->universal_limits_.max_function_args);\n}\n\nTEST_F(ValidationStateTest, CheckCFGDepthLimitOption) {\n  spvValidatorOptionsSetUniversalLimit(\n      options_, spv_validator_limit_max_control_flow_nesting_depth, 100u);\n  EXPECT_EQ(100u, options_->universal_limits_.max_control_flow_nesting_depth);\n}\n\nTEST_F(ValidationStateTest, CheckAccessChainIndexesLimitOption) {\n  spvValidatorOptionsSetUniversalLimit(\n      options_, spv_validator_limit_max_access_chain_indexes, 100u);\n  EXPECT_EQ(100u, options_->universal_limits_.max_access_chain_indexes);\n}\n\nTEST_F(ValidationStateTest, CheckNonRecursiveBodyGood) {\n  std::string spirv = std::string(kHeader) + kNonRecursiveBody;\n  CompileSuccessfully(spirv);\n  EXPECT_EQ(SPV_SUCCESS, ValidateAndRetrieveValidationState());\n}\n\nTEST_F(ValidationStateTest, CheckVulkanNonRecursiveBodyGood) {\n  std::string spirv = std::string(kVulkanMemoryHeader) + kNonRecursiveBody;\n  CompileSuccessfully(spirv, SPV_ENV_VULKAN_1_1);\n  EXPECT_EQ(SPV_SUCCESS,\n            ValidateAndRetrieveValidationState(SPV_ENV_VULKAN_1_1));\n}\n\nTEST_F(ValidationStateTest, CheckWebGPUNonRecursiveBodyGood) {\n  std::string spirv = std::string(kVulkanMemoryHeader) + kNonRecursiveBody;\n  CompileSuccessfully(spirv, SPV_ENV_WEBGPU_0);\n  EXPECT_EQ(SPV_SUCCESS, ValidateAndRetrieveValidationState(SPV_ENV_WEBGPU_0));\n}\n\nTEST_F(ValidationStateTest, CheckDirectlyRecursiveBodyGood) {\n  std::string spirv = std::string(kHeader) + kDirectlyRecursiveBody;\n  CompileSuccessfully(spirv);\n  EXPECT_EQ(SPV_SUCCESS, ValidateAndRetrieveValidationState());\n}\n\nTEST_F(ValidationStateTest, CheckVulkanDirectlyRecursiveBodyBad) {\n  std::string spirv = std::string(kVulkanMemoryHeader) + kDirectlyRecursiveBody;\n  CompileSuccessfully(spirv, SPV_ENV_VULKAN_1_1);\n  EXPECT_EQ(SPV_ERROR_INVALID_BINARY,\n            ValidateAndRetrieveValidationState(SPV_ENV_VULKAN_1_1));\n  EXPECT_THAT(getDiagnosticString(),\n              HasSubstr(\"Entry points may not have a call graph with cycles.\\n \"\n                        \" %1 = OpFunction %void Pure|Const %3\\n\"));\n}\n\nTEST_F(ValidationStateTest, CheckWebGPUDirectlyRecursiveBodyBad) {\n  std::string spirv = std::string(kVulkanMemoryHeader) + kDirectlyRecursiveBody;\n  CompileSuccessfully(spirv, SPV_ENV_WEBGPU_0);\n  EXPECT_EQ(SPV_ERROR_INVALID_BINARY,\n            ValidateAndRetrieveValidationState(SPV_ENV_WEBGPU_0));\n  EXPECT_THAT(getDiagnosticString(),\n              HasSubstr(\"Entry points may not have a call graph with cycles.\\n \"\n                        \" %1 = OpFunction %void Pure|Const %3\\n\"));\n}\n\nTEST_F(ValidationStateTest, CheckIndirectlyRecursiveBodyGood) {\n  std::string spirv = std::string(kHeader) + kIndirectlyRecursiveBody;\n  CompileSuccessfully(spirv);\n  EXPECT_EQ(SPV_SUCCESS, ValidateAndRetrieveValidationState());\n}\n\nTEST_F(ValidationStateTest, CheckVulkanIndirectlyRecursiveBodyBad) {\n  std::string spirv =\n      std::string(kVulkanMemoryHeader) + kIndirectlyRecursiveBody;\n  CompileSuccessfully(spirv, SPV_ENV_VULKAN_1_1);\n  EXPECT_EQ(SPV_ERROR_INVALID_BINARY,\n            ValidateAndRetrieveValidationState(SPV_ENV_VULKAN_1_1));\n  EXPECT_THAT(getDiagnosticString(),\n              HasSubstr(\"Entry points may not have a call graph with cycles.\\n \"\n                        \" %1 = OpFunction %void Pure|Const %3\\n\"));\n}\n\n\/\/ Indirectly recursive functions are caught by the function definition layout\n\/\/ rules, because they cause a situation where there are 2 functions that have\n\/\/ to be before each other, and layout is checked earlier.\nTEST_F(ValidationStateTest, CheckWebGPUIndirectlyRecursiveBodyBad) {\n  std::string spirv =\n      std::string(kVulkanMemoryHeader) + kIndirectlyRecursiveBody;\n  CompileSuccessfully(spirv, SPV_ENV_WEBGPU_0);\n  EXPECT_EQ(SPV_ERROR_INVALID_LAYOUT,\n            ValidateAndRetrieveValidationState(SPV_ENV_WEBGPU_0));\n  EXPECT_THAT(getDiagnosticString(),\n              HasSubstr(\"For WebGPU, functions need to be defined before being \"\n                        \"called.\\n  %9 = OpFunctionCall %_struct_5 %10\\n\"));\n}\n\n}  \/\/ namespace\n}  \/\/ namespace val\n}  \/\/ namespace spvtools\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: hlmailtp.cxx,v $\n *\n *  $Revision: 1.21 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 04:23: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 _COM_SUN_STAR_FRAME_XDISPATCHPROVIDER_HPP_\n#include <com\/sun\/star\/frame\/XDispatchProvider.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_FRAMESEARCHFLAG_HPP_\n#include <com\/sun\/star\/frame\/FrameSearchFlag.hpp>\n#endif\n\n#ifndef _SFXREQUEST_HXX\n#include <sfx2\/request.hxx>\n#endif\n\n#include <comphelper\/processfactory.hxx>\n\n#ifndef _SFXVIEWFRM_HXX\n#include <sfx2\/viewfrm.hxx>\n#endif\n\n#ifndef INCLUDED_SVTOOLS_PATHOPTIONS_HXX\n#include <svtools\/pathoptions.hxx>\n#endif\n#ifndef INCLUDED_SVTOOLS_MODULEOPTIONS_HXX\n#include <svtools\/moduleoptions.hxx>\n#endif\n\n#include \"hlmailtp.hxx\"\n#include \"hyperdlg.hrc\"\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star;\n\n\/*************************************************************************\n|*\n|* Contructor \/ Destructor\n|*\n|************************************************************************\/\n\nSvxHyperlinkMailTp::SvxHyperlinkMailTp ( Window *pParent, const SfxItemSet& rItemSet)\n:   SvxHyperlinkTabPageBase ( pParent, SVX_RES( RID_SVXPAGE_HYPERLINK_MAIL ),\n                              rItemSet ),\n    maGrpMailNews   ( this, ResId (GRP_MAILNEWS) ),\n    maRbtMail       ( this, ResId (RB_LINKTYP_MAIL) ),\n    maRbtNews       ( this, ResId (RB_LINKTYP_NEWS) ),\n    maFtReceiver    ( this, ResId (FT_RECEIVER) ),\n    maCbbReceiver   ( this, INET_PROT_MAILTO ),\n    maBtAdrBook     ( this, ResId (BTN_ADRESSBOOK) ),\n    maFtSubject     ( this, ResId (FT_SUBJECT) ),\n    maEdSubject     ( this, ResId (ED_SUBJECT) )\n{\n    \/\/ Set HC bitmaps and disable display of bitmap names.\n    maBtAdrBook.SetModeImage( Image( ResId( IMG_ADRESSBOOK_HC ) ), BMP_COLOR_HIGHCONTRAST );\n    maBtAdrBook.EnableTextDisplay (FALSE);\n\n    InitStdControls();\n    FreeResource();\n\n    \/\/ Init URL-Box (pos&size, Open-Handler)\n    maCbbReceiver.SetPosSizePixel ( LogicToPixel( Point( COL_2, 25 ), MAP_APPFONT ),\n                                    LogicToPixel( Size ( 176 - COL_DIFF, 60), MAP_APPFONT ) );\n\n    maCbbReceiver.Show();\n    maCbbReceiver.SetHelpId( HID_HYPERDLG_MAIL_PATH );\n\n    SetExchangeSupport ();\n\n    \/\/ set defaults\n    maRbtMail.Check ();\n\n    \/\/ overload handlers\n    maRbtMail.SetClickHdl        ( LINK ( this, SvxHyperlinkMailTp, Click_SmartProtocol_Impl ) );\n    maRbtNews.SetClickHdl        ( LINK ( this, SvxHyperlinkMailTp, Click_SmartProtocol_Impl ) );\n    maBtAdrBook.SetClickHdl      ( LINK ( this, SvxHyperlinkMailTp, ClickAdrBookHdl_Impl ) );\n    maCbbReceiver.SetModifyHdl   ( LINK ( this, SvxHyperlinkMailTp, ModifiedReceiverHdl_Impl) );\n\n    if ( !SvtModuleOptions().IsModuleInstalled( SvtModuleOptions::E_SDATABASE ) )\n        maBtAdrBook.Hide();\n}\n\nSvxHyperlinkMailTp::~SvxHyperlinkMailTp ()\n{\n}\n\n\/*************************************************************************\n|*\n|* Fill the all dialog-controls except controls in groupbox \"more...\"\n|*\n|************************************************************************\/\n\nvoid SvxHyperlinkMailTp::FillDlgFields ( String& aStrURL )\n{\n    const sal_Char sMailtoScheme[] = INET_MAILTO_SCHEME;\n\n    INetURLObject aURL( aStrURL );\n    String aStrScheme = GetSchemeFromURL( aStrURL );\n\n    \/\/ set URL-field and additional controls\n    String aStrURLc ( aStrURL );\n    \/\/ set additional controls for EMail:\n    if ( aStrScheme.SearchAscii( sMailtoScheme ) == 0 )\n    {\n        \/\/ Find mail-subject\n        String aStrSubject, aStrTmp ( aStrURLc );\n\n        const sal_Char sSubject[] = \"subject\";\n        xub_StrLen nPos = aStrTmp.ToLowerAscii().SearchAscii( sSubject, 0 );\n        nPos = aStrTmp.Search( sal_Unicode( '=' ), nPos );\n\n        if ( nPos != STRING_NOTFOUND )\n            aStrSubject = aStrURLc.Copy( nPos+1, aStrURLc.Len() );\n\n        nPos = aStrURLc.Search ( sal_Unicode( '?' ), 0);\n\n        aStrURLc = aStrURLc.Copy( 0, ( nPos == STRING_NOTFOUND ?\n                                           aStrURLc.Len() : nPos ) );\n\n        maEdSubject.SetText ( aStrSubject );\n    }\n    else\n    {\n        maEdSubject.SetText (aEmptyStr);\n    }\n\n    maCbbReceiver.SetText ( aStrURLc );\n\n    SetScheme( aStrScheme );\n}\n\n\/*************************************************************************\n|*\n|* retrieve and prepare data from dialog-fields\n|*\n|************************************************************************\/\n\nvoid SvxHyperlinkMailTp::GetCurentItemData ( String& aStrURL, String& aStrName,\n                                             String& aStrIntName, String& aStrFrame,\n                                             SvxLinkInsertMode& eMode )\n{\n    aStrURL = CreateAbsoluteURL();\n    GetDataFromCommonFields( aStrName, aStrIntName, aStrFrame, eMode );\n}\n\nString SvxHyperlinkMailTp::CreateAbsoluteURL() const\n{\n    String aStrURL = maCbbReceiver.GetText();\n    INetURLObject aURL(aStrURL);\n\n    if( aURL.GetProtocol() == INET_PROT_NOT_VALID )\n    {\n        aURL.SetSmartProtocol( GetSmartProtocolFromButtons() );\n        aURL.SetSmartURL(aStrURL);\n    }\n\n    \/\/ subject for EMail-url\n    if( aURL.GetProtocol() == INET_PROT_MAILTO )\n    {\n        if ( maEdSubject.GetText() != aEmptyStr )\n        {\n            String aQuery = UniString::CreateFromAscii( RTL_CONSTASCII_STRINGPARAM( \"subject=\" ) );\n            aQuery.Append( maEdSubject.GetText() );\n            aURL.SetParam(aQuery);\n        }\n    }\n\n    if ( aURL.GetProtocol() != INET_PROT_NOT_VALID )\n        return aURL.GetMainURL( INetURLObject::DECODE_WITH_CHARSET );\n    else \/\/#105788# always create a URL even if it is not valid\n        return aStrURL;\n}\n\n\/*************************************************************************\n|*\n|* static method to create Tabpage\n|*\n|************************************************************************\/\n\nIconChoicePage* SvxHyperlinkMailTp::Create( Window* pWindow, const SfxItemSet& rItemSet )\n{\n    return( new SvxHyperlinkMailTp( pWindow, rItemSet ) );\n}\n\n\/*************************************************************************\n|*\n|* Set initial focus\n|*\n|************************************************************************\/\n\nvoid SvxHyperlinkMailTp::SetInitFocus()\n{\n    maCbbReceiver.GrabFocus();\n}\n\n\/*************************************************************************\n|************************************************************************\/\n\nvoid SvxHyperlinkMailTp::SetScheme( const String& aScheme )\n{\n    \/\/if  aScheme is empty or unknown the default beaviour is like it where MAIL\n    const sal_Char sNewsScheme[]   = INET_NEWS_SCHEME;\n\n    BOOL bMail = aScheme.SearchAscii( sNewsScheme ) != 0;\n\n    \/\/update protocol button selection:\n    maRbtMail.Check(bMail);\n    maRbtNews.Check(!bMail);\n\n    \/\/update target:\n    RemoveImproperProtocol(aScheme);\n    maCbbReceiver.SetSmartProtocol( GetSmartProtocolFromButtons() );\n\n    \/\/show\/hide  special fields for MAIL:\n    maFtSubject.Enable(bMail);\n    maEdSubject.Enable(bMail);\n}\n\n\/*************************************************************************\n|*\n|* Remove protocol if it does not fit to the current button selection\n|*\n|************************************************************************\/\n\nvoid SvxHyperlinkMailTp::RemoveImproperProtocol(const String& aProperScheme)\n{\n    String aStrURL ( maCbbReceiver.GetText() );\n    if ( aStrURL != aEmptyStr )\n    {\n        String aStrScheme = GetSchemeFromURL( aStrURL );\n        if ( aStrScheme != aEmptyStr && aStrScheme != aProperScheme )\n        {\n            aStrURL.Erase ( 0, aStrScheme.Len() );\n            maCbbReceiver.SetText ( aStrURL );\n        }\n    }\n}\n\nString SvxHyperlinkMailTp::GetSchemeFromButtons() const\n{\n    if( maRbtNews.IsChecked() )\n    {\n        return String::CreateFromAscii( INET_NEWS_SCHEME );\n    }\n    return String::CreateFromAscii( INET_MAILTO_SCHEME );\n}\n\nINetProtocol SvxHyperlinkMailTp::GetSmartProtocolFromButtons() const\n{\n    if( maRbtNews.IsChecked() )\n    {\n        return INET_PROT_NEWS;\n    }\n    return INET_PROT_MAILTO;\n}\n\n\/*************************************************************************\n|*\n|* Click on radiobutton : Type EMail\n|*\n|************************************************************************\/\n\nIMPL_LINK ( SvxHyperlinkMailTp, Click_SmartProtocol_Impl, void *, EMPTYARG )\n{\n    String aScheme = GetSchemeFromButtons();\n    SetScheme( aScheme );\n    return( 0L );\n}\n\n\/*************************************************************************\n|*\n|* Contens of editfield \"receiver\" modified\n|*\n|************************************************************************\/\n\nIMPL_LINK ( SvxHyperlinkMailTp, ModifiedReceiverHdl_Impl, void *, EMPTYARG )\n{\n    String aScheme = GetSchemeFromURL( maCbbReceiver.GetText() );\n    if(aScheme.Len()!=0)\n        SetScheme( aScheme );\n\n    return( 0L );\n}\n\n\/*************************************************************************\n|*\n|* Click on imagebutton : addressbook\n|*\n|************************************************************************\/\n\nIMPL_LINK ( SvxHyperlinkMailTp, ClickAdrBookHdl_Impl, void *, EMPTYARG )\n{\n    SfxViewFrame* pViewFrame = SfxViewFrame::Current();\n    if( pViewFrame )\n    {\n        SfxItemPool &rPool = pViewFrame->GetPool();\n        SfxRequest aReq(SID_VIEW_DATA_SOURCE_BROWSER, 0, rPool);\n        pViewFrame->ExecuteSlot( aReq, sal_True );\n    }\n\n\n\/*  uno::Reference< frame::XDispatchProvider > xProv( pViewFrame->GetFrame()->GetFrameInterface(), uno::UNO_QUERY );\n    if ( xProv.is() )\n    {\n!!! (pb) we need a new config item here\n        SfxAppIniManagerProperty aProp;\n        GetpApp()->Property( aProp );\n        if( !aProp.GetIniManager() )\n            return ( 0L );\n\n        String aAddressBook = aProp.GetIniManager()->Get( SFX_KEY_ADDRESSBOOK );\n        INetURLObject aObj;\n        aObj.SetSmartProtocol( INET_PROT_FILE );\n        aObj.SetURL( aAddressBook.GetToken( 0, sal_Unicode( ';' ) ) );\n\n        String aMark( RTL_CONSTASCII_USTRINGPARAM( \"db:Table;\" ) );\n        aMark += aAddressBook.GetToken( 1, sal_Unicode( ';' ) );\n        aObj.SetMark( aMark );\n\n        util::URL aURL;\n        aURL.Complete = ::rtl::OUString( aObj.GetMainURL( INetURLObject::NO_DECODE ) );\n\n        uno::Reference< lang::XMultiServiceFactory > xFactory( ::comphelper::getProcessServiceFactory() );\n        if( xFactory.is() )\n        {\n            uno::Reference< util::XURLTransformer > xTrans( xFactory->createInstance\n                ( OUString::createFromAscii( \"com.sun.star.util.URLTransformer\" ) ),\n                                  uno::UNO_QUERY);\n            xTrans->parseStrict( aURL );\n\n            uno::Reference< frame::XDispatch > aDisp = xProv->queryDispatch( aURL,\n                                                        OUString::createFromAscii( \"_beamer\" ),\n                                                        frame::FrameSearchFlag::GLOBAL |\n                                                        frame::FrameSearchFlag::CREATE );\n            if ( aDisp.is() )\n            {\n                uno::Sequence< beans::PropertyValue > aArgs(1);\n                beans::PropertyValue* pArg = aArgs.getArray();\n                pArg[0].Name = DEFINE_CONST_UNICODE(\"Referer\");\n                pArg[0].Value = uno::makeAny( OUString( DEFINE_CONST_UNICODE(\"private:user\") ) );\n                aDisp->dispatch( aURL, aArgs );\n            }\n        }\n    }\n*\/\n\n    return( 0L );\n}\n\n\n<commit_msg>INTEGRATION: CWS residcleanup (1.21.262); FILE MERGED 2007\/02\/20 19:38:31 pl 1.21.262.1: #i74635# get rid of global ResMgr<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: hlmailtp.cxx,v $\n *\n *  $Revision: 1.22 $\n *\n *  last change: $Author: rt $ $Date: 2007-04-26 07:33: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\n#ifdef SVX_DLLIMPLEMENTATION\n#undef SVX_DLLIMPLEMENTATION\n#endif\n\n#ifndef _COM_SUN_STAR_FRAME_XDISPATCHPROVIDER_HPP_\n#include <com\/sun\/star\/frame\/XDispatchProvider.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_FRAMESEARCHFLAG_HPP_\n#include <com\/sun\/star\/frame\/FrameSearchFlag.hpp>\n#endif\n\n#ifndef _SFXREQUEST_HXX\n#include <sfx2\/request.hxx>\n#endif\n\n#include <comphelper\/processfactory.hxx>\n\n#ifndef _SFXVIEWFRM_HXX\n#include <sfx2\/viewfrm.hxx>\n#endif\n\n#ifndef INCLUDED_SVTOOLS_PATHOPTIONS_HXX\n#include <svtools\/pathoptions.hxx>\n#endif\n#ifndef INCLUDED_SVTOOLS_MODULEOPTIONS_HXX\n#include <svtools\/moduleoptions.hxx>\n#endif\n\n#include \"hlmailtp.hxx\"\n#include \"hyperdlg.hrc\"\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star;\n\n\/*************************************************************************\n|*\n|* Contructor \/ Destructor\n|*\n|************************************************************************\/\n\nSvxHyperlinkMailTp::SvxHyperlinkMailTp ( Window *pParent, const SfxItemSet& rItemSet)\n:   SvxHyperlinkTabPageBase ( pParent, SVX_RES( RID_SVXPAGE_HYPERLINK_MAIL ),\n                              rItemSet ),\n    maGrpMailNews   ( this, SVX_RES (GRP_MAILNEWS) ),\n    maRbtMail       ( this, SVX_RES (RB_LINKTYP_MAIL) ),\n    maRbtNews       ( this, SVX_RES (RB_LINKTYP_NEWS) ),\n    maFtReceiver    ( this, SVX_RES (FT_RECEIVER) ),\n    maCbbReceiver   ( this, INET_PROT_MAILTO ),\n    maBtAdrBook     ( this, SVX_RES (BTN_ADRESSBOOK) ),\n    maFtSubject     ( this, SVX_RES (FT_SUBJECT) ),\n    maEdSubject     ( this, SVX_RES (ED_SUBJECT) )\n{\n    \/\/ Set HC bitmaps and disable display of bitmap names.\n    maBtAdrBook.SetModeImage( Image( SVX_RES( IMG_ADRESSBOOK_HC ) ), BMP_COLOR_HIGHCONTRAST );\n    maBtAdrBook.EnableTextDisplay (FALSE);\n\n    InitStdControls();\n    FreeResource();\n\n    \/\/ Init URL-Box (pos&size, Open-Handler)\n    maCbbReceiver.SetPosSizePixel ( LogicToPixel( Point( COL_2, 25 ), MAP_APPFONT ),\n                                    LogicToPixel( Size ( 176 - COL_DIFF, 60), MAP_APPFONT ) );\n\n    maCbbReceiver.Show();\n    maCbbReceiver.SetHelpId( HID_HYPERDLG_MAIL_PATH );\n\n    SetExchangeSupport ();\n\n    \/\/ set defaults\n    maRbtMail.Check ();\n\n    \/\/ overload handlers\n    maRbtMail.SetClickHdl        ( LINK ( this, SvxHyperlinkMailTp, Click_SmartProtocol_Impl ) );\n    maRbtNews.SetClickHdl        ( LINK ( this, SvxHyperlinkMailTp, Click_SmartProtocol_Impl ) );\n    maBtAdrBook.SetClickHdl      ( LINK ( this, SvxHyperlinkMailTp, ClickAdrBookHdl_Impl ) );\n    maCbbReceiver.SetModifyHdl   ( LINK ( this, SvxHyperlinkMailTp, ModifiedReceiverHdl_Impl) );\n\n    if ( !SvtModuleOptions().IsModuleInstalled( SvtModuleOptions::E_SDATABASE ) )\n        maBtAdrBook.Hide();\n}\n\nSvxHyperlinkMailTp::~SvxHyperlinkMailTp ()\n{\n}\n\n\/*************************************************************************\n|*\n|* Fill the all dialog-controls except controls in groupbox \"more...\"\n|*\n|************************************************************************\/\n\nvoid SvxHyperlinkMailTp::FillDlgFields ( String& aStrURL )\n{\n    const sal_Char sMailtoScheme[] = INET_MAILTO_SCHEME;\n\n    INetURLObject aURL( aStrURL );\n    String aStrScheme = GetSchemeFromURL( aStrURL );\n\n    \/\/ set URL-field and additional controls\n    String aStrURLc ( aStrURL );\n    \/\/ set additional controls for EMail:\n    if ( aStrScheme.SearchAscii( sMailtoScheme ) == 0 )\n    {\n        \/\/ Find mail-subject\n        String aStrSubject, aStrTmp ( aStrURLc );\n\n        const sal_Char sSubject[] = \"subject\";\n        xub_StrLen nPos = aStrTmp.ToLowerAscii().SearchAscii( sSubject, 0 );\n        nPos = aStrTmp.Search( sal_Unicode( '=' ), nPos );\n\n        if ( nPos != STRING_NOTFOUND )\n            aStrSubject = aStrURLc.Copy( nPos+1, aStrURLc.Len() );\n\n        nPos = aStrURLc.Search ( sal_Unicode( '?' ), 0);\n\n        aStrURLc = aStrURLc.Copy( 0, ( nPos == STRING_NOTFOUND ?\n                                           aStrURLc.Len() : nPos ) );\n\n        maEdSubject.SetText ( aStrSubject );\n    }\n    else\n    {\n        maEdSubject.SetText (aEmptyStr);\n    }\n\n    maCbbReceiver.SetText ( aStrURLc );\n\n    SetScheme( aStrScheme );\n}\n\n\/*************************************************************************\n|*\n|* retrieve and prepare data from dialog-fields\n|*\n|************************************************************************\/\n\nvoid SvxHyperlinkMailTp::GetCurentItemData ( String& aStrURL, String& aStrName,\n                                             String& aStrIntName, String& aStrFrame,\n                                             SvxLinkInsertMode& eMode )\n{\n    aStrURL = CreateAbsoluteURL();\n    GetDataFromCommonFields( aStrName, aStrIntName, aStrFrame, eMode );\n}\n\nString SvxHyperlinkMailTp::CreateAbsoluteURL() const\n{\n    String aStrURL = maCbbReceiver.GetText();\n    INetURLObject aURL(aStrURL);\n\n    if( aURL.GetProtocol() == INET_PROT_NOT_VALID )\n    {\n        aURL.SetSmartProtocol( GetSmartProtocolFromButtons() );\n        aURL.SetSmartURL(aStrURL);\n    }\n\n    \/\/ subject for EMail-url\n    if( aURL.GetProtocol() == INET_PROT_MAILTO )\n    {\n        if ( maEdSubject.GetText() != aEmptyStr )\n        {\n            String aQuery = UniString::CreateFromAscii( RTL_CONSTASCII_STRINGPARAM( \"subject=\" ) );\n            aQuery.Append( maEdSubject.GetText() );\n            aURL.SetParam(aQuery);\n        }\n    }\n\n    if ( aURL.GetProtocol() != INET_PROT_NOT_VALID )\n        return aURL.GetMainURL( INetURLObject::DECODE_WITH_CHARSET );\n    else \/\/#105788# always create a URL even if it is not valid\n        return aStrURL;\n}\n\n\/*************************************************************************\n|*\n|* static method to create Tabpage\n|*\n|************************************************************************\/\n\nIconChoicePage* SvxHyperlinkMailTp::Create( Window* pWindow, const SfxItemSet& rItemSet )\n{\n    return( new SvxHyperlinkMailTp( pWindow, rItemSet ) );\n}\n\n\/*************************************************************************\n|*\n|* Set initial focus\n|*\n|************************************************************************\/\n\nvoid SvxHyperlinkMailTp::SetInitFocus()\n{\n    maCbbReceiver.GrabFocus();\n}\n\n\/*************************************************************************\n|************************************************************************\/\n\nvoid SvxHyperlinkMailTp::SetScheme( const String& aScheme )\n{\n    \/\/if  aScheme is empty or unknown the default beaviour is like it where MAIL\n    const sal_Char sNewsScheme[]   = INET_NEWS_SCHEME;\n\n    BOOL bMail = aScheme.SearchAscii( sNewsScheme ) != 0;\n\n    \/\/update protocol button selection:\n    maRbtMail.Check(bMail);\n    maRbtNews.Check(!bMail);\n\n    \/\/update target:\n    RemoveImproperProtocol(aScheme);\n    maCbbReceiver.SetSmartProtocol( GetSmartProtocolFromButtons() );\n\n    \/\/show\/hide  special fields for MAIL:\n    maFtSubject.Enable(bMail);\n    maEdSubject.Enable(bMail);\n}\n\n\/*************************************************************************\n|*\n|* Remove protocol if it does not fit to the current button selection\n|*\n|************************************************************************\/\n\nvoid SvxHyperlinkMailTp::RemoveImproperProtocol(const String& aProperScheme)\n{\n    String aStrURL ( maCbbReceiver.GetText() );\n    if ( aStrURL != aEmptyStr )\n    {\n        String aStrScheme = GetSchemeFromURL( aStrURL );\n        if ( aStrScheme != aEmptyStr && aStrScheme != aProperScheme )\n        {\n            aStrURL.Erase ( 0, aStrScheme.Len() );\n            maCbbReceiver.SetText ( aStrURL );\n        }\n    }\n}\n\nString SvxHyperlinkMailTp::GetSchemeFromButtons() const\n{\n    if( maRbtNews.IsChecked() )\n    {\n        return String::CreateFromAscii( INET_NEWS_SCHEME );\n    }\n    return String::CreateFromAscii( INET_MAILTO_SCHEME );\n}\n\nINetProtocol SvxHyperlinkMailTp::GetSmartProtocolFromButtons() const\n{\n    if( maRbtNews.IsChecked() )\n    {\n        return INET_PROT_NEWS;\n    }\n    return INET_PROT_MAILTO;\n}\n\n\/*************************************************************************\n|*\n|* Click on radiobutton : Type EMail\n|*\n|************************************************************************\/\n\nIMPL_LINK ( SvxHyperlinkMailTp, Click_SmartProtocol_Impl, void *, EMPTYARG )\n{\n    String aScheme = GetSchemeFromButtons();\n    SetScheme( aScheme );\n    return( 0L );\n}\n\n\/*************************************************************************\n|*\n|* Contens of editfield \"receiver\" modified\n|*\n|************************************************************************\/\n\nIMPL_LINK ( SvxHyperlinkMailTp, ModifiedReceiverHdl_Impl, void *, EMPTYARG )\n{\n    String aScheme = GetSchemeFromURL( maCbbReceiver.GetText() );\n    if(aScheme.Len()!=0)\n        SetScheme( aScheme );\n\n    return( 0L );\n}\n\n\/*************************************************************************\n|*\n|* Click on imagebutton : addressbook\n|*\n|************************************************************************\/\n\nIMPL_LINK ( SvxHyperlinkMailTp, ClickAdrBookHdl_Impl, void *, EMPTYARG )\n{\n    SfxViewFrame* pViewFrame = SfxViewFrame::Current();\n    if( pViewFrame )\n    {\n        SfxItemPool &rPool = pViewFrame->GetPool();\n        SfxRequest aReq(SID_VIEW_DATA_SOURCE_BROWSER, 0, rPool);\n        pViewFrame->ExecuteSlot( aReq, sal_True );\n    }\n\n\n\/*  uno::Reference< frame::XDispatchProvider > xProv( pViewFrame->GetFrame()->GetFrameInterface(), uno::UNO_QUERY );\n    if ( xProv.is() )\n    {\n!!! (pb) we need a new config item here\n        SfxAppIniManagerProperty aProp;\n        GetpApp()->Property( aProp );\n        if( !aProp.GetIniManager() )\n            return ( 0L );\n\n        String aAddressBook = aProp.GetIniManager()->Get( SFX_KEY_ADDRESSBOOK );\n        INetURLObject aObj;\n        aObj.SetSmartProtocol( INET_PROT_FILE );\n        aObj.SetURL( aAddressBook.GetToken( 0, sal_Unicode( ';' ) ) );\n\n        String aMark( RTL_CONSTASCII_USTRINGPARAM( \"db:Table;\" ) );\n        aMark += aAddressBook.GetToken( 1, sal_Unicode( ';' ) );\n        aObj.SetMark( aMark );\n\n        util::URL aURL;\n        aURL.Complete = ::rtl::OUString( aObj.GetMainURL( INetURLObject::NO_DECODE ) );\n\n        uno::Reference< lang::XMultiServiceFactory > xFactory( ::comphelper::getProcessServiceFactory() );\n        if( xFactory.is() )\n        {\n            uno::Reference< util::XURLTransformer > xTrans( xFactory->createInstance\n                ( OUString::createFromAscii( \"com.sun.star.util.URLTransformer\" ) ),\n                                  uno::UNO_QUERY);\n            xTrans->parseStrict( aURL );\n\n            uno::Reference< frame::XDispatch > aDisp = xProv->queryDispatch( aURL,\n                                                        OUString::createFromAscii( \"_beamer\" ),\n                                                        frame::FrameSearchFlag::GLOBAL |\n                                                        frame::FrameSearchFlag::CREATE );\n            if ( aDisp.is() )\n            {\n                uno::Sequence< beans::PropertyValue > aArgs(1);\n                beans::PropertyValue* pArg = aArgs.getArray();\n                pArg[0].Name = DEFINE_CONST_UNICODE(\"Referer\");\n                pArg[0].Value = uno::makeAny( OUString( DEFINE_CONST_UNICODE(\"private:user\") ) );\n                aDisp->dispatch( aURL, aArgs );\n            }\n        }\n    }\n*\/\n\n    return( 0L );\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/chromeos\/native_dialog_window.h\"\n\n#include \"app\/gtk_signal.h\"\n#include \"base\/logging.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"views\/controls\/native\/native_view_host.h\"\n#include \"views\/window\/dialog_delegate.h\"\n#include \"views\/window\/non_client_view.h\"\n#include \"views\/window\/window.h\"\n\nnamespace {\n\nconst int kDialogPadding = 3;\n\nconst char kNativeDialogHostWindow[] = \"_chromeos_native_dialog_host_window_\";\n\n}  \/\/ namespace\n\nnamespace chromeos {\n\nclass NativeDialogHost : public views::View,\n                         public views::DialogDelegate {\n public:\n  NativeDialogHost(gfx::NativeView native_dialog,\n                   int flags,\n                   const gfx::Size& size,\n                   const gfx::Size& min_size);\n  ~NativeDialogHost();\n\n  \/\/ views::DialogDelegate implementation:\n  virtual bool CanResize() const { return flags_ & DIALOG_FLAG_RESIZEABLE; }\n  virtual int GetDialogButtons() const { return 0; }\n  virtual std::wstring GetWindowTitle() const { return title_; }\n  virtual views::View* GetContentsView() { return this; }\n  virtual bool IsModal() const { return flags_ & DIALOG_FLAG_MODAL; }\n  virtual void WindowClosing();\n\n protected:\n  CHROMEGTK_CALLBACK_0(NativeDialogHost, void, OnCheckResize);\n  CHROMEGTK_CALLBACK_0(NativeDialogHost, void, OnDialogDestroy);\n\n  \/\/ views::View implementation:\n  virtual gfx::Size GetPreferredSize();\n  virtual void Layout();\n  virtual void ViewHierarchyChanged(bool is_add,\n                                    views::View* parent,\n                                    views::View* child);\n private:\n  \/\/ Init and attach to native dialog.\n  void Init();\n\n  \/\/ The GtkDialog whose vbox will be displayed in this view.\n  gfx::NativeView dialog_;\n\n  \/\/ NativeViewHost for the dialog's contents.\n  views::NativeViewHost* contents_view_;\n\n  std::wstring title_;\n  int flags_;\n  gfx::Size size_;\n  gfx::Size min_size_;\n\n  int destroy_signal_id_;\n\n  DISALLOW_IMPLICIT_CONSTRUCTORS(NativeDialogHost);\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ NativeDialogHost, public:\n\nNativeDialogHost::NativeDialogHost(gfx::NativeView native_dialog,\n                                   int flags,\n                                   const gfx::Size& size,\n                                   const gfx::Size& min_size)\n    : dialog_(native_dialog),\n      contents_view_(NULL),\n      flags_(flags),\n      size_(size),\n      min_size_(min_size),\n      destroy_signal_id_(0) {\n  const char* title = gtk_window_get_title(GTK_WINDOW(dialog_));\n  if (title)\n    UTF8ToWide(title, strlen(title), &title_);\n\n  destroy_signal_id_ = g_signal_connect(dialog_, \"destroy\",\n      G_CALLBACK(&OnDialogDestroyThunk), this);\n}\n\nNativeDialogHost::~NativeDialogHost() {\n}\n\nvoid NativeDialogHost::OnCheckResize(GtkWidget* widget) {\n  gfx::NativeView contents = contents_view_->native_view();\n\n  \/\/ Check whether preferred height has changed. We keep the current width\n  \/\/ unchanged and pass \"-1\" as height to let gtk calculate a proper height.\n  gtk_widget_set_size_request(contents, width(), -1);\n  GtkRequisition requsition = { 0 };\n  gtk_widget_size_request(contents, &requsition);\n\n  if (size_.height() != requsition.height) {\n    size_.set_width(requsition.width);\n    size_.set_height(requsition.height);\n    SizeToPreferredSize();\n\n    gfx::Size window_size = window()->GetNonClientView()->GetPreferredSize();\n    gfx::Rect window_bounds = window()->GetBounds();\n    window_bounds.set_width(window_size.width());\n    window_bounds.set_height(window_size.height());\n    window()->SetBounds(window_bounds, NULL);\n  }\n}\n\nvoid NativeDialogHost::OnDialogDestroy(GtkWidget* widget) {\n  dialog_ = NULL;\n  destroy_signal_id_ = 0;\n  window()->Close();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ NativeDialogHost, views::DialogDelegate implementation:\nvoid NativeDialogHost::WindowClosing() {\n  if (dialog_) {\n    \/\/ Disconnect the \"destroy\" signal because we are about to destroy\n    \/\/ the dialog ourselves and no longer interested in it.\n    g_signal_handler_disconnect(G_OBJECT(dialog_), destroy_signal_id_);\n    gtk_dialog_response(GTK_DIALOG(dialog_), GTK_RESPONSE_DELETE_EVENT);\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ NativeDialogHost, views::View implementation:\n\ngfx::Size NativeDialogHost::GetPreferredSize() {\n  return size_;\n}\n\nvoid NativeDialogHost::Layout() {\n  contents_view_->SetBounds(0, 0, width(), height());\n}\n\nvoid NativeDialogHost::ViewHierarchyChanged(bool is_add,\n                                            views::View* parent,\n                                            views::View* child) {\n  if (is_add && child == this)\n    Init();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ NativeDialogHost, private:\nvoid NativeDialogHost::Init() {\n  if (contents_view_)\n    return;\n\n  \/\/ Create a GtkAlignment as dialog contents container.\n  GtkWidget* contents = gtk_alignment_new(0.5, 0.5, 1.0, 1.0);\n  gtk_alignment_set_padding(GTK_ALIGNMENT(contents),\n      kDialogPadding, kDialogPadding,\n      kDialogPadding, kDialogPadding);\n\n  \/\/ Move dialog contents into our container.\n  GtkWidget* dialog_contents = GTK_DIALOG(dialog_)->vbox;\n  g_object_ref(dialog_contents);\n  gtk_container_remove(GTK_CONTAINER(dialog_), dialog_contents);\n  gtk_container_add(GTK_CONTAINER(contents), dialog_contents);\n  g_object_unref(dialog_contents);\n  gtk_widget_hide(dialog_);\n\n  g_object_set_data(G_OBJECT(dialog_), kNativeDialogHostWindow,\n      reinterpret_cast<gpointer>(window()->GetNativeWindow()));\n\n  gtk_widget_show_all(contents);\n\n  contents_view_ = new views::NativeViewHost();\n  AddChildView(contents_view_);\n  contents_view_->Attach(contents);\n\n  g_signal_connect(window()->GetNativeWindow(), \"check-resize\",\n      G_CALLBACK(&OnCheckResizeThunk), this);\n\n  \/\/ Use gtk's default size if size is not speicified.\n  if (size_.IsEmpty()) {\n    \/\/ Use given width or height if given.\n    if (size_.width() || size_.height()) {\n      int width = size_.width() == 0 ? -1 : size_.width();\n      int height = size_.height() == 0 ? -1 : size_.height();\n      gtk_widget_set_size_request(contents, width, height);\n    }\n\n    GtkRequisition requsition = { 0 };\n    gtk_widget_size_request(contents, &requsition);\n    size_.set_width(requsition.width);\n    size_.set_height(requsition.height);\n  }\n\n  \/\/ Apply the minimum size.\n  if (size_.width() < min_size_.width())\n    size_.set_width(min_size_.width());\n  if (size_.height() < min_size_.height())\n    size_.set_height(min_size_.height());\n}\n\nvoid ShowNativeDialog(gfx::NativeWindow parent,\n                      gfx::NativeView native_dialog,\n                      int flags,\n                      const gfx::Size& size,\n                      const gfx::Size& min_size) {\n  NativeDialogHost* native_dialog_host =\n      new NativeDialogHost(native_dialog, flags, size, min_size);\n  views::Window::CreateChromeWindow(parent, gfx::Rect(), native_dialog_host);\n  native_dialog_host->window()->Show();\n}\n\ngfx::NativeWindow GetNativeDialogWindow(gfx::NativeView native_dialog) {\n  return reinterpret_cast<gfx::NativeWindow>(\n      g_object_get_data(G_OBJECT(native_dialog), kNativeDialogHostWindow));\n}\n\n}  \/\/ namespace chromeos\n<commit_msg>Fix native dialog size regression<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\/native_dialog_window.h\"\n\n#include \"app\/gtk_signal.h\"\n#include \"base\/logging.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"views\/controls\/native\/native_view_host.h\"\n#include \"views\/window\/dialog_delegate.h\"\n#include \"views\/window\/non_client_view.h\"\n#include \"views\/window\/window.h\"\n\nnamespace {\n\nconst int kDialogPadding = 3;\n\nconst char kNativeDialogHostWindow[] = \"_chromeos_native_dialog_host_window_\";\n\n}  \/\/ namespace\n\nnamespace chromeos {\n\nclass NativeDialogHost : public views::View,\n                         public views::DialogDelegate {\n public:\n  NativeDialogHost(gfx::NativeView native_dialog,\n                   int flags,\n                   const gfx::Size& size,\n                   const gfx::Size& min_size);\n  ~NativeDialogHost();\n\n  \/\/ views::DialogDelegate implementation:\n  virtual bool CanResize() const { return flags_ & DIALOG_FLAG_RESIZEABLE; }\n  virtual int GetDialogButtons() const { return 0; }\n  virtual std::wstring GetWindowTitle() const { return title_; }\n  virtual views::View* GetContentsView() { return this; }\n  virtual bool IsModal() const { return flags_ & DIALOG_FLAG_MODAL; }\n  virtual void WindowClosing();\n\n protected:\n  CHROMEGTK_CALLBACK_0(NativeDialogHost, void, OnCheckResize);\n  CHROMEGTK_CALLBACK_0(NativeDialogHost, void, OnDialogDestroy);\n\n  \/\/ views::View implementation:\n  virtual gfx::Size GetPreferredSize();\n  virtual void Layout();\n  virtual void ViewHierarchyChanged(bool is_add,\n                                    views::View* parent,\n                                    views::View* child);\n private:\n  \/\/ Init and attach to native dialog.\n  void Init();\n\n  \/\/ Check and apply minimum size restriction.\n  void CheckSize();\n\n  \/\/ The GtkDialog whose vbox will be displayed in this view.\n  gfx::NativeView dialog_;\n\n  \/\/ NativeViewHost for the dialog's contents.\n  views::NativeViewHost* contents_view_;\n\n  std::wstring title_;\n  int flags_;\n  gfx::Size size_;\n  gfx::Size preferred_size_;\n  gfx::Size min_size_;\n\n  int destroy_signal_id_;\n\n  DISALLOW_IMPLICIT_CONSTRUCTORS(NativeDialogHost);\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ NativeDialogHost, public:\n\nNativeDialogHost::NativeDialogHost(gfx::NativeView native_dialog,\n                                   int flags,\n                                   const gfx::Size& size,\n                                   const gfx::Size& min_size)\n    : dialog_(native_dialog),\n      contents_view_(NULL),\n      flags_(flags),\n      size_(size),\n      preferred_size_(size),\n      min_size_(min_size),\n      destroy_signal_id_(0) {\n  const char* title = gtk_window_get_title(GTK_WINDOW(dialog_));\n  if (title)\n    UTF8ToWide(title, strlen(title), &title_);\n\n  destroy_signal_id_ = g_signal_connect(dialog_, \"destroy\",\n      G_CALLBACK(&OnDialogDestroyThunk), this);\n}\n\nNativeDialogHost::~NativeDialogHost() {\n}\n\nvoid NativeDialogHost::OnCheckResize(GtkWidget* widget) {\n  \/\/ Do auto height resize only when we are asked to do so.\n  if (size_.height() == 0) {\n    gfx::NativeView contents = contents_view_->native_view();\n\n    \/\/ Check whether preferred height has changed. We keep the current width\n    \/\/ unchanged and pass \"-1\" as height to let gtk calculate a proper height.\n    gtk_widget_set_size_request(contents, width(), -1);\n    GtkRequisition requsition = { 0 };\n    gtk_widget_size_request(contents, &requsition);\n\n    if (preferred_size_.height() != requsition.height) {\n      preferred_size_.set_width(requsition.width);\n      preferred_size_.set_height(requsition.height);\n      CheckSize();\n      SizeToPreferredSize();\n\n      gfx::Size window_size = window()->GetNonClientView()->GetPreferredSize();\n      gfx::Rect window_bounds = window()->GetBounds();\n      window_bounds.set_width(window_size.width());\n      window_bounds.set_height(window_size.height());\n      window()->SetBounds(window_bounds, NULL);\n    }\n  }\n}\n\nvoid NativeDialogHost::OnDialogDestroy(GtkWidget* widget) {\n  dialog_ = NULL;\n  destroy_signal_id_ = 0;\n  window()->Close();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ NativeDialogHost, views::DialogDelegate implementation:\nvoid NativeDialogHost::WindowClosing() {\n  if (dialog_) {\n    \/\/ Disconnect the \"destroy\" signal because we are about to destroy\n    \/\/ the dialog ourselves and no longer interested in it.\n    g_signal_handler_disconnect(G_OBJECT(dialog_), destroy_signal_id_);\n    gtk_dialog_response(GTK_DIALOG(dialog_), GTK_RESPONSE_DELETE_EVENT);\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ NativeDialogHost, views::View implementation:\n\ngfx::Size NativeDialogHost::GetPreferredSize() {\n  return preferred_size_;\n}\n\nvoid NativeDialogHost::Layout() {\n  contents_view_->SetBounds(0, 0, width(), height());\n}\n\nvoid NativeDialogHost::ViewHierarchyChanged(bool is_add,\n                                            views::View* parent,\n                                            views::View* child) {\n  if (is_add && child == this)\n    Init();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ NativeDialogHost, private:\nvoid NativeDialogHost::Init() {\n  if (contents_view_)\n    return;\n\n  \/\/ Create a GtkAlignment as dialog contents container.\n  GtkWidget* contents = gtk_alignment_new(0.5, 0.5, 1.0, 1.0);\n  gtk_alignment_set_padding(GTK_ALIGNMENT(contents),\n      kDialogPadding, kDialogPadding,\n      kDialogPadding, kDialogPadding);\n\n  \/\/ Move dialog contents into our container.\n  GtkWidget* dialog_contents = GTK_DIALOG(dialog_)->vbox;\n  g_object_ref(dialog_contents);\n  gtk_container_remove(GTK_CONTAINER(dialog_), dialog_contents);\n  gtk_container_add(GTK_CONTAINER(contents), dialog_contents);\n  g_object_unref(dialog_contents);\n  gtk_widget_hide(dialog_);\n\n  g_object_set_data(G_OBJECT(dialog_), kNativeDialogHostWindow,\n      reinterpret_cast<gpointer>(window()->GetNativeWindow()));\n\n  gtk_widget_show_all(contents);\n\n  contents_view_ = new views::NativeViewHost();\n  AddChildView(contents_view_);\n  contents_view_->Attach(contents);\n\n  g_signal_connect(window()->GetNativeWindow(), \"check-resize\",\n      G_CALLBACK(&OnCheckResizeThunk), this);\n\n  \/\/ Use gtk's default size if size is not speicified.\n  if (size_.IsEmpty()) {\n    \/\/ Use given width or height if given.\n    if (size_.width() || size_.height()) {\n      int width = size_.width() == 0 ? -1 : size_.width();\n      int height = size_.height() == 0 ? -1 : size_.height();\n      gtk_widget_set_size_request(contents, width, height);\n    }\n\n    GtkRequisition requsition = { 0 };\n    gtk_widget_size_request(contents, &requsition);\n    preferred_size_.set_width(requsition.width);\n    preferred_size_.set_height(requsition.height);\n  }\n\n  CheckSize();\n}\n\nvoid NativeDialogHost::CheckSize() {\n  \/\/ Apply the minimum size.\n  if (preferred_size_.width() < min_size_.width())\n    preferred_size_.set_width(min_size_.width());\n  if (preferred_size_.height() < min_size_.height())\n    preferred_size_.set_height(min_size_.height());\n}\n\nvoid ShowNativeDialog(gfx::NativeWindow parent,\n                      gfx::NativeView native_dialog,\n                      int flags,\n                      const gfx::Size& size,\n                      const gfx::Size& min_size) {\n  NativeDialogHost* native_dialog_host =\n      new NativeDialogHost(native_dialog, flags, size, min_size);\n  views::Window::CreateChromeWindow(parent, gfx::Rect(), native_dialog_host);\n  native_dialog_host->window()->Show();\n}\n\ngfx::NativeWindow GetNativeDialogWindow(gfx::NativeView native_dialog) {\n  return reinterpret_cast<gfx::NativeWindow>(\n      g_object_get_data(G_OBJECT(native_dialog), kNativeDialogHostWindow));\n}\n\n}  \/\/ namespace chromeos\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file   PathTest.cpp\n * @brief  Path class tester.\n * @author zer0\n * @date   2016-04-07\n *\/\n\n#include <gtest\/gtest.h>\n#include <tester\/DemoAsset.hpp>\n#include <libtbag\/filesystem\/Path.hpp>\n\nusing namespace libtbag;\nusing namespace libtbag::filesystem;\n\nTEST(PathTest, Constructors1)\n{\n    char const * const TEMP = \"TEMP\";\n\n    Path p0;\n    Path p1 = Path(TEMP);\n    Path p2 = Path(std::string(TEMP));\n    Path p3 = Path(TEMP, Path::update_generic());\n    Path p4 = Path(std::string(TEMP), Path::update_generic());\n    Path p5 = p1;\n    Path p6_move = Path(TEMP);\n    Path p6 = std::move(p6_move);\n\n    Path p7 = Path(TEMP, Path::update_canonical());\n    Path p8 = Path(std::string(TEMP), Path::update_canonical());\n\n    ASSERT_STREQ(\"\", p0.getString().c_str());\n    ASSERT_STREQ(TEMP, p1.getString().c_str());\n    ASSERT_STREQ(TEMP, p2.getString().c_str());\n    ASSERT_STREQ(TEMP, p3.getString().c_str());\n    ASSERT_STREQ(TEMP, p4.getString().c_str());\n    ASSERT_STREQ(TEMP, p5.getString().c_str());\n    ASSERT_STREQ(TEMP, p6.getString().c_str());\n}\n\nTEST(PathTest, Constructors2)\n{\n    std::vector<std::string> nodes;\n    nodes.push_back(\"1\");\n    nodes.push_back(\"2\");\n\n    Path p = nodes;\n    ASSERT_STREQ(\"1\/2\", p.getGenericString().c_str());\n}\n\nTEST(PathTest, InitializerList)\n{\n    Path p0 = {\"\/\", \"TE\", \"M\", \"P\"};\n    ASSERT_STREQ(\"\/TE\/M\/P\", p0.getGenericString().c_str());\n}\n\nTEST(PathTest, AssignOperators)\n{\n    char const * const TEMP = \"TEMP\";\n\n    auto rvalue_test = [&]() -> Path {\n        return Path(TEMP);\n    };\n\n    Path const TEMP_PATH = Path(TEMP);\n    std::string const TEMP_STRING = TEMP;\n    ASSERT_STREQ(TEMP, TEMP_PATH.getString().c_str());\n\n    Path p0;\n\n    p0 = TEMP;\n    ASSERT_STREQ(TEMP, p0.getString().c_str());\n\n    p0 = TEMP_STRING;\n    ASSERT_STREQ(TEMP, p0.getString().c_str());\n\n    p0 = std::string(TEMP);\n    ASSERT_STREQ(TEMP, p0.getString().c_str());\n\n    p0 = TEMP_PATH;\n    ASSERT_STREQ(TEMP, p0.getString().c_str());\n\n    p0 = rvalue_test();\n    ASSERT_STREQ(TEMP, p0.getString().c_str());\n}\n\nTEST(PathTest, GetName)\n{\n    Path const path1(\"\/1\/2\/3\/4\/5.test\");\n    ASSERT_STREQ(\"5.test\", path1.getName().c_str());\n\n    Path const path2(\"\");\n    ASSERT_STREQ(\"\", path2.getName().c_str());\n\n    Path const path3(\"\/1\/2\/3\/4.dir\/5.test.ext\");\n    ASSERT_STREQ(\"5.test.ext\", path3.getName().c_str());\n}\n\nTEST(PathTest, GetNameWithoutExtension)\n{\n    Path const path1(\"\/1\/2\/3\/4.dir\/5.test.ext\");\n    ASSERT_STREQ(\"5\", path1.getNameWithoutExtension().c_str());\n\n    Path const path2(\"\");\n    ASSERT_STREQ(\"\", path2.getNameWithoutExtension().c_str());\n\n    Path const path3(\"\/1\/2\/3\/4.dir\/5_test_ext\");\n    ASSERT_STREQ(\"5_test_ext\", path3.getNameWithoutExtension().c_str());\n}\n\nTEST(PathTest, GetExtensionName)\n{\n    Path const path1(\"\/1\/2\/3\/4.dir\/5.test.ext\");\n    ASSERT_STREQ(\".test.ext\", path1.getExtensionName().c_str());\n\n    Path const path2(\"\");\n    ASSERT_STREQ(\"\", path2.getExtensionName().c_str());\n\n    Path const path3(\"\/1\/2\/3\/4.dir\/5_test_ext\");\n    ASSERT_STREQ(\"\", path3.getExtensionName().c_str());\n}\n\nTEST(PathTest, SplitNodes_Canonical1)\n{\n    std::string home = Path::getHomeDir();\n    std::string work = Path::getWorkDir();\n\n    char const * const TEMP1 = \"~\/TEMP1\/TEMP2\/..\/TEMP3\/.\/..\/..\/TEMP4\";\n    char const * const TEMP2 = \"TEMP2\/.\";\n\n    Path path1(TEMP1);\n    Path path2(TEMP2);\n\n    path1.updateCanonical();\n    path2.updateCanonical();\n\n    ASSERT_EQ(Path(home + \"\/TEMP4\").getGenericString(), path1.getGenericString());\n    ASSERT_EQ(Path(work + \"\/TEMP2\").getGenericString(), path2.getGenericString());\n}\n\nTEST(PathTest, SplitNodes_Canonical2)\n{\n#if defined(TBAG_PLATFORM_WINDOWS)\n    char const * const TEMP = \"\/TEMP\";\n#else\n    char const * const TEMP = \"C:\\\\TEMP\";\n#endif\n\n    Path const temp(TEMP);\n    Path const path = Path(temp.splitNodesWithCanonical());\n    ASSERT_STREQ(TEMP, temp.getString().c_str());\n}\n\nTEST(PathTest, SpecialDirectories)\n{\n    ASSERT_FALSE(Path::getWorkDir().getString().empty());\n    ASSERT_FALSE(Path::getHomeDir().getString().empty());\n    ASSERT_FALSE(Path::getExePath().getString().empty());\n    ASSERT_FALSE(Path::getExeDir ().getString().empty());\n}\n\nTEST(PathTest, ScanDir)\n{\n    auto const FILES = DemoAsset::get_tester_dir_image().scanDir();\n    ASSERT_FALSE(FILES.empty());\n}\n\nTEST(PathTest, ScanRecurrentDir)\n{\n    auto const FILES = DemoAsset::get_tester_dir().scanRecurrentDir();\n    ASSERT_FALSE(FILES.empty());\n}\n\n<commit_msg>Update PathTest.ScanDir() tester.<commit_after>\/**\n * @file   PathTest.cpp\n * @brief  Path class tester.\n * @author zer0\n * @date   2016-04-07\n *\/\n\n#include <gtest\/gtest.h>\n#include <tester\/DemoAsset.hpp>\n#include <libtbag\/filesystem\/Path.hpp>\n#include <libtbag\/util\/TestUtils.hpp>\n\n#include <fstream>\n\nusing namespace libtbag;\nusing namespace libtbag::filesystem;\n\nTEST(PathTest, Constructors1)\n{\n    char const * const TEMP = \"TEMP\";\n\n    Path p0;\n    Path p1 = Path(TEMP);\n    Path p2 = Path(std::string(TEMP));\n    Path p3 = Path(TEMP, Path::update_generic());\n    Path p4 = Path(std::string(TEMP), Path::update_generic());\n    Path p5 = p1;\n    Path p6_move = Path(TEMP);\n    Path p6 = std::move(p6_move);\n\n    Path p7 = Path(TEMP, Path::update_canonical());\n    Path p8 = Path(std::string(TEMP), Path::update_canonical());\n\n    ASSERT_STREQ(\"\", p0.getString().c_str());\n    ASSERT_STREQ(TEMP, p1.getString().c_str());\n    ASSERT_STREQ(TEMP, p2.getString().c_str());\n    ASSERT_STREQ(TEMP, p3.getString().c_str());\n    ASSERT_STREQ(TEMP, p4.getString().c_str());\n    ASSERT_STREQ(TEMP, p5.getString().c_str());\n    ASSERT_STREQ(TEMP, p6.getString().c_str());\n}\n\nTEST(PathTest, Constructors2)\n{\n    std::vector<std::string> nodes;\n    nodes.push_back(\"1\");\n    nodes.push_back(\"2\");\n\n    Path p = nodes;\n    ASSERT_STREQ(\"1\/2\", p.getGenericString().c_str());\n}\n\nTEST(PathTest, InitializerList)\n{\n    Path p0 = {\"\/\", \"TE\", \"M\", \"P\"};\n    ASSERT_STREQ(\"\/TE\/M\/P\", p0.getGenericString().c_str());\n}\n\nTEST(PathTest, AssignOperators)\n{\n    char const * const TEMP = \"TEMP\";\n\n    auto rvalue_test = [&]() -> Path {\n        return Path(TEMP);\n    };\n\n    Path const TEMP_PATH = Path(TEMP);\n    std::string const TEMP_STRING = TEMP;\n    ASSERT_STREQ(TEMP, TEMP_PATH.getString().c_str());\n\n    Path p0;\n\n    p0 = TEMP;\n    ASSERT_STREQ(TEMP, p0.getString().c_str());\n\n    p0 = TEMP_STRING;\n    ASSERT_STREQ(TEMP, p0.getString().c_str());\n\n    p0 = std::string(TEMP);\n    ASSERT_STREQ(TEMP, p0.getString().c_str());\n\n    p0 = TEMP_PATH;\n    ASSERT_STREQ(TEMP, p0.getString().c_str());\n\n    p0 = rvalue_test();\n    ASSERT_STREQ(TEMP, p0.getString().c_str());\n}\n\nTEST(PathTest, GetName)\n{\n    Path const path1(\"\/1\/2\/3\/4\/5.test\");\n    ASSERT_STREQ(\"5.test\", path1.getName().c_str());\n\n    Path const path2(\"\");\n    ASSERT_STREQ(\"\", path2.getName().c_str());\n\n    Path const path3(\"\/1\/2\/3\/4.dir\/5.test.ext\");\n    ASSERT_STREQ(\"5.test.ext\", path3.getName().c_str());\n}\n\nTEST(PathTest, GetNameWithoutExtension)\n{\n    Path const path1(\"\/1\/2\/3\/4.dir\/5.test.ext\");\n    ASSERT_STREQ(\"5\", path1.getNameWithoutExtension().c_str());\n\n    Path const path2(\"\");\n    ASSERT_STREQ(\"\", path2.getNameWithoutExtension().c_str());\n\n    Path const path3(\"\/1\/2\/3\/4.dir\/5_test_ext\");\n    ASSERT_STREQ(\"5_test_ext\", path3.getNameWithoutExtension().c_str());\n}\n\nTEST(PathTest, GetExtensionName)\n{\n    Path const path1(\"\/1\/2\/3\/4.dir\/5.test.ext\");\n    ASSERT_STREQ(\".test.ext\", path1.getExtensionName().c_str());\n\n    Path const path2(\"\");\n    ASSERT_STREQ(\"\", path2.getExtensionName().c_str());\n\n    Path const path3(\"\/1\/2\/3\/4.dir\/5_test_ext\");\n    ASSERT_STREQ(\"\", path3.getExtensionName().c_str());\n}\n\nTEST(PathTest, SplitNodes_Canonical1)\n{\n    std::string home = Path::getHomeDir();\n    std::string work = Path::getWorkDir();\n\n    char const * const TEMP1 = \"~\/TEMP1\/TEMP2\/..\/TEMP3\/.\/..\/..\/TEMP4\";\n    char const * const TEMP2 = \"TEMP2\/.\";\n\n    Path path1(TEMP1);\n    Path path2(TEMP2);\n\n    path1.updateCanonical();\n    path2.updateCanonical();\n\n    ASSERT_EQ(Path(home + \"\/TEMP4\").getGenericString(), path1.getGenericString());\n    ASSERT_EQ(Path(work + \"\/TEMP2\").getGenericString(), path2.getGenericString());\n}\n\nTEST(PathTest, SplitNodes_Canonical2)\n{\n#if defined(TBAG_PLATFORM_WINDOWS)\n    char const * const TEMP = \"\/TEMP\";\n#else\n    char const * const TEMP = \"C:\\\\TEMP\";\n#endif\n\n    Path const temp(TEMP);\n    Path const path = Path(temp.splitNodesWithCanonical());\n    ASSERT_STREQ(TEMP, temp.getString().c_str());\n}\n\nTEST(PathTest, SpecialDirectories)\n{\n    ASSERT_FALSE(Path::getWorkDir().getString().empty());\n    ASSERT_FALSE(Path::getHomeDir().getString().empty());\n    ASSERT_FALSE(Path::getExePath().getString().empty());\n    ASSERT_FALSE(Path::getExeDir ().getString().empty());\n}\n\nTEST(PathTest, ScanDir)\n{\n    tttDir_Automatic();\n    auto const TEMP_DIR = tttDir_Get();\n\n    std::string const TEST_DIR1  = \"test1\";\n    std::string const TEST_DIR2  = \"test2\";\n    std::string const TEST_FILE1 = \"file1\";\n    std::string const TEST_FILE2 = \"file2\";\n\n    BRACE(\"Create default resource\") {\n        (TEMP_DIR \/ TEST_DIR1).createDir();\n        (TEMP_DIR \/ TEST_DIR2).createDir();\n        std::ofstream f1((TEMP_DIR \/ TEST_FILE1).toString(), std::ios_base::out);\n        std::ofstream f2((TEMP_DIR \/ TEST_DIR2 \/ TEST_FILE2).toString(), std::ios_base::out);\n        f1 << \"content\";\n        f2 << \"content\";\n    }\n\n    ASSERT_EQ(3, TEMP_DIR.scanDir().size());\n    ASSERT_EQ(2, TEMP_DIR.scanDir(Path::DIRENT_DIR).size());\n    ASSERT_EQ(1, TEMP_DIR.scanDir(Path::DIRENT_FILE).size());\n}\n\nTEST(PathTest, ScanRecurrentDir)\n{\n    tttDir_Automatic();\n    auto const TEMP_DIR = tttDir_Get();\n\n    std::string const TEST_DIR1  = \"test1\";\n    std::string const TEST_DIR2  = \"test2\";\n    std::string const TEST_FILE1 = \"file1\";\n    std::string const TEST_FILE2 = \"file2\";\n\n    BRACE(\"Create default resource\") {\n        (TEMP_DIR \/ TEST_DIR1).createDir();\n        (TEMP_DIR \/ TEST_DIR2).createDir();\n        std::ofstream f1((TEMP_DIR \/ TEST_FILE1).toString(), std::ios_base::out);\n        std::ofstream f2((TEMP_DIR \/ TEST_DIR2 \/ TEST_FILE2).toString(), std::ios_base::out);\n        f1 << \"content\";\n        f2 << \"content\";\n    }\n\n    ASSERT_EQ(4, TEMP_DIR.scanRecurrentDir().size());\n    ASSERT_EQ(2, TEMP_DIR.scanRecurrentDir(Path::DIRENT_DIR).size());\n    ASSERT_EQ(2, TEMP_DIR.scanRecurrentDir(Path::DIRENT_FILE).size());\n}\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Timing<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: pastedlg.cxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 21:53: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#ifdef SVX_DLLIMPLEMENTATION\n#undef SVX_DLLIMPLEMENTATION\n#endif\n\n#ifndef _COM_SUN_STAR_EMBED_ASPECTS_HPP_\n#include <com\/sun\/star\/embed\/Aspects.hpp>\n#endif\n\n#include <pastedlg.hxx>\n#include <svtools\/svmedit.hxx>\n#include <svtools\/insdlg.hxx>\n#include <vcl\/dialog.hxx>\n#include <vcl\/button.hxx>\n#include <vcl\/fixed.hxx>\n#include <vcl\/group.hxx>\n#include <vcl\/lstbox.hxx>\n#include <vcl\/msgbox.hxx>\n#include \"svuidlg.hrc\"\n#include <sot\/formats.hxx>\n#include <sot\/stg.hxx>\n#include <svtools\/sores.hxx>\n\n#include \"dialmgr.hxx\"\n\nSvPasteObjectDialog::SvPasteObjectDialog( Window* pParent )\n\n    : ModalDialog( pParent, ResId( MD_PASTE_OBJECT, DIALOG_MGR() ) ),\n    aFtSource( this, ResId( FT_SOURCE ) ),\n    aFtObjectSource( this, ResId( FT_OBJECT_SOURCE ) ),\n    aRbPaste( this, ResId( RB_PASTE ) ),\n    aRbPasteLink( this, ResId( RB_PASTE_LINK ) ),\n    aLbInsertList( this, ResId( LB_INSERT_LIST ) ),\n    aCbDisplayAsIcon( this, ResId( CB_DISPLAY_AS_ICON ) ),\n    aPbChangeIcon( this, ResId( PB_CHANGE_ICON ) ),\n    aFlChoice( this, ResId( FL_CHOICE ) ),\n    aOKButton1( this, ResId( 1 ) ),\n    aCancelButton1( this, ResId( 1 ) ),\n    aHelpButton1( this, ResId( 1 ) ),\n    aSObject( ResId( S_OBJECT ) )\n{\n    FreeResource();\n    SetHelpId( HID_PASTE_DLG );\n    SetUniqueId( HID_PASTE_DLG );\n\n    Font aFont = aFtObjectSource.GetFont();\n    aFont.SetWeight( WEIGHT_LIGHT );\n    aFtObjectSource.SetFont( aFont );\n    aOKButton1.Disable();\n\n    ObjectLB().SetSelectHdl( LINK( this, SvPasteObjectDialog, SelectHdl ) );\n    ObjectLB().SetDoubleClickHdl( LINK( this, SvPasteObjectDialog, DoubleClickHdl ) );\n    SetDefault();\n}\n\nvoid SvPasteObjectDialog::SelectObject()\n{\n    if ( aLbInsertList.GetEntryCount() &&\n         !aRbPaste.IsVisible() && !aRbPasteLink.IsVisible() )\n    {\n        aLbInsertList.SelectEntryPos(0);\n        SelectHdl( &aLbInsertList );\n    }\n}\n\nIMPL_LINK( SvPasteObjectDialog, SelectHdl, ListBox *, pListBox )\n{\n    if ( !aOKButton1.IsEnabled() )\n        aOKButton1.Enable();\n    return 0;\n}\n\nIMPL_LINK_INLINE_START( SvPasteObjectDialog, DoubleClickHdl, ListBox *, pListBox )\n{\n    EndDialog( RET_OK );\n    return 0;\n}\nIMPL_LINK_INLINE_END( SvPasteObjectDialog, DoubleClickHdl, ListBox *, pListBox )\n\nvoid SvPasteObjectDialog::SetDefault()\n{\n    bLink   = FALSE;\n    nAspect = ::com::sun::star::embed::Aspects::MSOLE_CONTENT;\n}\n\nSvPasteObjectDialog::~SvPasteObjectDialog()\n{\n    void * pStr = aSupplementTable.First();\n    while( pStr )\n    {\n        delete (String *)pStr;\n        pStr = aSupplementTable.Next();\n    }\n}\n\n\/*************************************************************************\n|*    SvPasteObjectDialog::Insert()\n|*\n|*    Beschreibung\n|*    Ersterstellung    MM 14.06.94\n|*    Letzte Aenderung  KA 16.03.2001\n*************************************************************************\/\nvoid SvPasteObjectDialog::Insert( SotFormatStringId nFormat, const String& rFormatName )\n{\n    String * pStr = new String( rFormatName );\n    if( !aSupplementTable.Insert( nFormat, pStr ) )\n        delete pStr;\n}\n\nULONG SvPasteObjectDialog::GetFormat( const TransferableDataHelper& rHelper,\n                                      const DataFlavorExVector* pFormats,\n                                      const TransferableObjectDescriptor* )\n{\n    \/\/TODO\/LATER: why is the Descriptor never used?!\n    TransferableObjectDescriptor aDesc;\n    if( rHelper.HasFormat( SOT_FORMATSTR_ID_OBJECTDESCRIPTOR ) )\n        ((TransferableDataHelper&)rHelper).GetTransferableObjectDescriptor(\n                                SOT_FORMATSTR_ID_OBJECTDESCRIPTOR, aDesc );\n    if ( !pFormats )\n        pFormats = &rHelper.GetDataFlavorExVector();\n\n    \/\/Dialogbox erzeugen und fuellen\n    String aSourceName, aTypeName;\n    ULONG nSelFormat = 0;\n    SvGlobalName aEmptyNm;\n\n    ObjectLB().SetUpdateMode( FALSE );\n\n    DataFlavorExVector::iterator aIter( ((DataFlavorExVector&)*pFormats).begin() ),\n                                 aEnd( ((DataFlavorExVector&)*pFormats).end() );\n    while( aIter != aEnd )\n    {\n        ::com::sun::star::datatransfer::DataFlavor aFlavor( *aIter );\n        SotFormatStringId nFormat = (*aIter++).mnSotId;\n\n        String* pName = (String*) aSupplementTable.Get( nFormat );\n        String aName;\n\n#ifdef WNT\n\/*\n        if( !pName &&\n            ( nFormat == SOT_FORMATSTR_ID_EMBED_SOURCE_OLE || nFormat == SOT_FORMATSTR_ID_EMBEDDED_OBJ_OLE ) )\n        {\n            BOOL IsClipboardObject_Impl( SotDataObject * );\n            if( IsClipboardObject_Impl( pDataObj ) )\n            {\n                IDataObject * pDO = NULL;\n                OleGetClipboard( &pDO );\n                if( pDO )\n                {\n                    FORMATETC fe;\n                    STGMEDIUM stm;\n                    (fe).cfFormat=RegisterClipboardFormat( \"Object Descriptor\" );\n                    (fe).dwAspect=DVASPECT_CONTENT;\n                    (fe).ptd=NULL;\n                    (fe).tymed=TYMED_HGLOBAL;\n                    (fe).lindex=-1;\n\n                    if (SUCCEEDED(pDO->GetData(&fe, &stm)))\n                    {\n                        LPOBJECTDESCRIPTOR pOD=(LPOBJECTDESCRIPTOR)GlobalLock(stm.hGlobal);\n                        if( pOD->dwFullUserTypeName )\n                        {\n                            OLECHAR * pN = (OLECHAR *)(((BYTE *)pOD) + pOD->dwFullUserTypeName);\n                            aName.Append( pN );\n                            pName = &aName;\n                            \/\/ set format to ole object\n                            nFormat = SOT_FORMATSTR_ID_EMBED_SOURCE_OLE;\n                        }\n                        if( pOD->dwSrcOfCopy )\n                        {\n                            OLECHAR * pN = (OLECHAR *)(((BYTE *)pOD) + pOD->dwSrcOfCopy);\n                            aSourceName.Append( *pN++ );\n                        }\n                        else\n                            aSourceName = String( ResId( STR_UNKNOWN_SOURCE, SOAPP->GetResMgr() ) );\n                        GlobalUnlock(stm.hGlobal);\n                        ReleaseStgMedium(&stm);\n                    }\n                }\n            }\n        }\n*\/\n#endif\n\n        \/\/ if there is an \"Embed Source\" or and \"Embedded Object\" on the\n        \/\/ Clipboard we read the Description and the Source of this object\n        \/\/ from an accompanied \"Object Descriptor\" format on the clipboard\n        \/\/ Remember: these formats mostly appear together on the clipboard\n        if ( !pName )\n        {\n            SvPasteObjectHelper::GetEmbeddedName(rHelper,aName,aSourceName,nFormat);\n            if ( aName.Len() )\n                pName = &aName;\n        }\n\n\n        if( pName )\n        {\n            aName = *pName;\n\n            if( SOT_FORMATSTR_ID_EMBED_SOURCE == nFormat )\n            {\n                if( aDesc.maClassName != aEmptyNm )                                {\n                    aSourceName = aDesc.maDisplayName;\n\n                    if( aDesc.maClassName == aObjClassName )\n                        aName = aObjName;\n                    else\n                        aName = aTypeName = aDesc.maTypeName;\n                }\n            }\n            else if( SOT_FORMATSTR_ID_LINK_SOURCE == nFormat )\n            {\n                PasteLink().Enable();\n                continue;\n            }\n            else if( !aName.Len() )\n                aName = SvPasteObjectHelper::GetSotFormatUIName( nFormat );\n\n            if( LISTBOX_ENTRY_NOTFOUND == ObjectLB().GetEntryPos( aName ) )\n                ObjectLB().SetEntryData(\n                    ObjectLB().InsertEntry( aName ), (void*) nFormat );\n        }\n    }\n\n    if( !aTypeName.Len() && !aSourceName.Len() )\n    {\n        if( aDesc.maClassName != aEmptyNm )\n        {\n            aSourceName = aDesc.maDisplayName;\n            aTypeName = aDesc.maTypeName;\n        }\n\n        if( !aTypeName.Len() && !aSourceName.Len() )\n            \/\/ global resource from svtools (former so3 resource)\n            aSourceName = String( ResId( STR_UNKNOWN_SOURCE ) );\n    }\n\n    ObjectLB().SetUpdateMode( TRUE );\n    SelectObject();\n\n    if( aSourceName.Len() )\n    {\n        if( aTypeName.Len() )\n            aTypeName += '\\n';\n\n        aTypeName += aSourceName;\n        aTypeName.ConvertLineEnd();\n    }\n\n    ObjectSource().SetText( aTypeName );\n\n    SetDefault();\n\n    if( Dialog::Execute() == RET_OK )\n    {\n        bLink = PasteLink().IsChecked();\n\n        if( AsIconBox().IsChecked() )\n            nAspect = com::sun::star::embed::Aspects::MSOLE_ICON;\n\n        nSelFormat  = (ULONG)ObjectLB().GetEntryData( ObjectLB().GetSelectEntryPos() );\n    }\n\n    return nSelFormat;\n}\n\nvoid SvPasteObjectDialog::SetObjName( const SvGlobalName & rClass, const String & rObjName )\n{\n    aObjClassName = rClass;\n    aObjName = rObjName;\n}\n\n<commit_msg>INTEGRATION: CWS warnings01 (1.4.222); FILE MERGED 2006\/04\/06 14:39:47 ab 1.4.222.1: #i55991# warning-free code<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: pastedlg.cxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: hr $ $Date: 2006-06-19 15:26: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#ifdef SVX_DLLIMPLEMENTATION\n#undef SVX_DLLIMPLEMENTATION\n#endif\n\n#ifndef _COM_SUN_STAR_EMBED_ASPECTS_HPP_\n#include <com\/sun\/star\/embed\/Aspects.hpp>\n#endif\n\n#include <pastedlg.hxx>\n#include <svtools\/svmedit.hxx>\n#include <svtools\/insdlg.hxx>\n#include <vcl\/dialog.hxx>\n#include <vcl\/button.hxx>\n#include <vcl\/fixed.hxx>\n#include <vcl\/group.hxx>\n#include <vcl\/lstbox.hxx>\n#include <vcl\/msgbox.hxx>\n#include \"svuidlg.hrc\"\n#include <sot\/formats.hxx>\n#include <sot\/stg.hxx>\n#include <svtools\/sores.hxx>\n\n#include \"dialmgr.hxx\"\n\nSvPasteObjectDialog::SvPasteObjectDialog( Window* pParent )\n\n    : ModalDialog( pParent, ResId( MD_PASTE_OBJECT, DIALOG_MGR() ) ),\n    aFtSource( this, ResId( FT_SOURCE ) ),\n    aFtObjectSource( this, ResId( FT_OBJECT_SOURCE ) ),\n    aRbPaste( this, ResId( RB_PASTE ) ),\n    aRbPasteLink( this, ResId( RB_PASTE_LINK ) ),\n    aLbInsertList( this, ResId( LB_INSERT_LIST ) ),\n    aCbDisplayAsIcon( this, ResId( CB_DISPLAY_AS_ICON ) ),\n    aPbChangeIcon( this, ResId( PB_CHANGE_ICON ) ),\n    aFlChoice( this, ResId( FL_CHOICE ) ),\n    aOKButton1( this, ResId( 1 ) ),\n    aCancelButton1( this, ResId( 1 ) ),\n    aHelpButton1( this, ResId( 1 ) ),\n    aSObject( ResId( S_OBJECT ) )\n{\n    FreeResource();\n    SetHelpId( HID_PASTE_DLG );\n    SetUniqueId( HID_PASTE_DLG );\n\n    Font aFont = aFtObjectSource.GetFont();\n    aFont.SetWeight( WEIGHT_LIGHT );\n    aFtObjectSource.SetFont( aFont );\n    aOKButton1.Disable();\n\n    ObjectLB().SetSelectHdl( LINK( this, SvPasteObjectDialog, SelectHdl ) );\n    ObjectLB().SetDoubleClickHdl( LINK( this, SvPasteObjectDialog, DoubleClickHdl ) );\n    SetDefault();\n}\n\nvoid SvPasteObjectDialog::SelectObject()\n{\n    if ( aLbInsertList.GetEntryCount() &&\n         !aRbPaste.IsVisible() && !aRbPasteLink.IsVisible() )\n    {\n        aLbInsertList.SelectEntryPos(0);\n        SelectHdl( &aLbInsertList );\n    }\n}\n\nIMPL_LINK( SvPasteObjectDialog, SelectHdl, ListBox *, pListBox )\n{\n    (void)pListBox;\n\n    if ( !aOKButton1.IsEnabled() )\n        aOKButton1.Enable();\n    return 0;\n}\n\nIMPL_LINK_INLINE_START( SvPasteObjectDialog, DoubleClickHdl, ListBox *, pListBox )\n{\n    (void)pListBox;\n\n    EndDialog( RET_OK );\n    return 0;\n}\nIMPL_LINK_INLINE_END( SvPasteObjectDialog, DoubleClickHdl, ListBox *, pListBox )\n\nvoid SvPasteObjectDialog::SetDefault()\n{\n    bLink   = FALSE;\n    nAspect = ::com::sun::star::embed::Aspects::MSOLE_CONTENT;\n}\n\nSvPasteObjectDialog::~SvPasteObjectDialog()\n{\n    void * pStr = aSupplementTable.First();\n    while( pStr )\n    {\n        delete (String *)pStr;\n        pStr = aSupplementTable.Next();\n    }\n}\n\n\/*************************************************************************\n|*    SvPasteObjectDialog::Insert()\n|*\n|*    Beschreibung\n|*    Ersterstellung    MM 14.06.94\n|*    Letzte Aenderung  KA 16.03.2001\n*************************************************************************\/\nvoid SvPasteObjectDialog::Insert( SotFormatStringId nFormat, const String& rFormatName )\n{\n    String * pStr = new String( rFormatName );\n    if( !aSupplementTable.Insert( nFormat, pStr ) )\n        delete pStr;\n}\n\nULONG SvPasteObjectDialog::GetFormat( const TransferableDataHelper& rHelper,\n                                      const DataFlavorExVector* pFormats,\n                                      const TransferableObjectDescriptor* )\n{\n    \/\/TODO\/LATER: why is the Descriptor never used?!\n    TransferableObjectDescriptor aDesc;\n    if( rHelper.HasFormat( SOT_FORMATSTR_ID_OBJECTDESCRIPTOR ) )\n        ((TransferableDataHelper&)rHelper).GetTransferableObjectDescriptor(\n                                SOT_FORMATSTR_ID_OBJECTDESCRIPTOR, aDesc );\n    if ( !pFormats )\n        pFormats = &rHelper.GetDataFlavorExVector();\n\n    \/\/Dialogbox erzeugen und fuellen\n    String aSourceName, aTypeName;\n    ULONG nSelFormat = 0;\n    SvGlobalName aEmptyNm;\n\n    ObjectLB().SetUpdateMode( FALSE );\n\n    DataFlavorExVector::iterator aIter( ((DataFlavorExVector&)*pFormats).begin() ),\n                                 aEnd( ((DataFlavorExVector&)*pFormats).end() );\n    while( aIter != aEnd )\n    {\n        ::com::sun::star::datatransfer::DataFlavor aFlavor( *aIter );\n        SotFormatStringId nFormat = (*aIter++).mnSotId;\n\n        String* pName = (String*) aSupplementTable.Get( nFormat );\n        String aName;\n\n#ifdef WNT\n\/*\n        if( !pName &&\n            ( nFormat == SOT_FORMATSTR_ID_EMBED_SOURCE_OLE || nFormat == SOT_FORMATSTR_ID_EMBEDDED_OBJ_OLE ) )\n        {\n            BOOL IsClipboardObject_Impl( SotDataObject * );\n            if( IsClipboardObject_Impl( pDataObj ) )\n            {\n                IDataObject * pDO = NULL;\n                OleGetClipboard( &pDO );\n                if( pDO )\n                {\n                    FORMATETC fe;\n                    STGMEDIUM stm;\n                    (fe).cfFormat=RegisterClipboardFormat( \"Object Descriptor\" );\n                    (fe).dwAspect=DVASPECT_CONTENT;\n                    (fe).ptd=NULL;\n                    (fe).tymed=TYMED_HGLOBAL;\n                    (fe).lindex=-1;\n\n                    if (SUCCEEDED(pDO->GetData(&fe, &stm)))\n                    {\n                        LPOBJECTDESCRIPTOR pOD=(LPOBJECTDESCRIPTOR)GlobalLock(stm.hGlobal);\n                        if( pOD->dwFullUserTypeName )\n                        {\n                            OLECHAR * pN = (OLECHAR *)(((BYTE *)pOD) + pOD->dwFullUserTypeName);\n                            aName.Append( pN );\n                            pName = &aName;\n                            \/\/ set format to ole object\n                            nFormat = SOT_FORMATSTR_ID_EMBED_SOURCE_OLE;\n                        }\n                        if( pOD->dwSrcOfCopy )\n                        {\n                            OLECHAR * pN = (OLECHAR *)(((BYTE *)pOD) + pOD->dwSrcOfCopy);\n                            aSourceName.Append( *pN++ );\n                        }\n                        else\n                            aSourceName = String( ResId( STR_UNKNOWN_SOURCE, SOAPP->GetResMgr() ) );\n                        GlobalUnlock(stm.hGlobal);\n                        ReleaseStgMedium(&stm);\n                    }\n                }\n            }\n        }\n*\/\n#endif\n\n        \/\/ if there is an \"Embed Source\" or and \"Embedded Object\" on the\n        \/\/ Clipboard we read the Description and the Source of this object\n        \/\/ from an accompanied \"Object Descriptor\" format on the clipboard\n        \/\/ Remember: these formats mostly appear together on the clipboard\n        if ( !pName )\n        {\n            SvPasteObjectHelper::GetEmbeddedName(rHelper,aName,aSourceName,nFormat);\n            if ( aName.Len() )\n                pName = &aName;\n        }\n\n\n        if( pName )\n        {\n            aName = *pName;\n\n            if( SOT_FORMATSTR_ID_EMBED_SOURCE == nFormat )\n            {\n                if( aDesc.maClassName != aEmptyNm )                                {\n                    aSourceName = aDesc.maDisplayName;\n\n                    if( aDesc.maClassName == aObjClassName )\n                        aName = aObjName;\n                    else\n                        aName = aTypeName = aDesc.maTypeName;\n                }\n            }\n            else if( SOT_FORMATSTR_ID_LINK_SOURCE == nFormat )\n            {\n                PasteLink().Enable();\n                continue;\n            }\n            else if( !aName.Len() )\n                aName = SvPasteObjectHelper::GetSotFormatUIName( nFormat );\n\n            if( LISTBOX_ENTRY_NOTFOUND == ObjectLB().GetEntryPos( aName ) )\n                ObjectLB().SetEntryData(\n                    ObjectLB().InsertEntry( aName ), (void*) nFormat );\n        }\n    }\n\n    if( !aTypeName.Len() && !aSourceName.Len() )\n    {\n        if( aDesc.maClassName != aEmptyNm )\n        {\n            aSourceName = aDesc.maDisplayName;\n            aTypeName = aDesc.maTypeName;\n        }\n\n        if( !aTypeName.Len() && !aSourceName.Len() )\n            \/\/ global resource from svtools (former so3 resource)\n            aSourceName = String( ResId( STR_UNKNOWN_SOURCE ) );\n    }\n\n    ObjectLB().SetUpdateMode( TRUE );\n    SelectObject();\n\n    if( aSourceName.Len() )\n    {\n        if( aTypeName.Len() )\n            aTypeName += '\\n';\n\n        aTypeName += aSourceName;\n        aTypeName.ConvertLineEnd();\n    }\n\n    ObjectSource().SetText( aTypeName );\n\n    SetDefault();\n\n    if( Dialog::Execute() == RET_OK )\n    {\n        bLink = PasteLink().IsChecked();\n\n        if( AsIconBox().IsChecked() )\n            nAspect = com::sun::star::embed::Aspects::MSOLE_ICON;\n\n        nSelFormat  = (ULONG)ObjectLB().GetEntryData( ObjectLB().GetSelectEntryPos() );\n    }\n\n    return nSelFormat;\n}\n\nvoid SvPasteObjectDialog::SetObjName( const SvGlobalName & rClass, const String & rObjName )\n{\n    aObjClassName = rClass;\n    aObjName = rObjName;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: localmultistratum.cxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 04:04: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#include \"localmultistratum.hxx\"\n\n#ifndef CONFIGMGR_LOCALBE_LOCALFILEHELPER_HXX_\n#include \"localfilehelper.hxx\"\n#endif\n#ifndef _CONFIGMGR_FILEHELPER_HXX_\n#include \"filehelper.hxx\"\n#endif\n\n#ifndef CONFIGMGR_API_FACTORY_HXX_\n#include \"confapifactory.hxx\"\n#endif \/\/ CONFIGMGR_API_FACTORY_HXX_\n\n#ifndef CONFIGMGR_SERVICEINFOHELPER_HXX_\n#include \"serviceinfohelper.hxx\"\n#endif \/\/ CONFIGMGR_SERVICEINFOHELPER_HXX_\n\n#ifndef _RTL_USTRBUF_HXX_\n#include <rtl\/ustrbuf.hxx>\n#endif \/\/ _RTL_USTRBUF_HXX_\n\n#ifndef _COM_SUN_STAR_UNO_XCOMPONENTCONTEXT_HPP_\n#include <com\/sun\/star\/uno\/XComponentContext.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONFIGURATION_BACKEND_INSUFFICIENTACCESSRIGHTSEXCEPTION_HPP_\n#include <com\/sun\/star\/configuration\/backend\/InsufficientAccessRightsException.hpp>\n#endif\n\n#ifndef _OSL_FILE_HXX_\n#include <osl\/file.hxx>\n#endif\n\nnamespace configmgr { namespace localbe {\n\n\/\/==============================================================================\n\nstatic inline\nrtl::OUString const & impl_getLayerDataDirectory(rtl::OUString const & aLayerBaseUrl)\n{ return aLayerBaseUrl; }\n\/\/------------------------------------------------------------------------------\nstatic \/\/inline\nrtl::OUString makeLayerId(rtl::OUString const & aComponent,rtl::OUString const & aParticleFile)\n{\n    OSL_ASSERT(aParticleFile.endsWithIgnoreAsciiCaseAsciiL(RTL_CONSTASCII_STRINGPARAM(kLocalDataSuffix)));\n    const sal_Int32 kExtLength = RTL_CONSTASCII_LENGTH(kLocalDataSuffix);\n    rtl::OUString const aParticleName = aParticleFile.copy(0,aParticleFile.getLength() - kExtLength);\n\n    rtl::OUStringBuffer aLayerId(aComponent);\n    aLayerId.append(k_cLayerIdSeparator);\n    aLayerId.append(aParticleName);\n\n    return aLayerId.makeStringAndClear();\n}\n\nLocalMultiStratum::LocalMultiStratum(const uno::Reference<uno::XComponentContext>& xContext)\n: MultiStratumImplBase(xContext)\n{\n}\n\/\/------------------------------------------------------------------------------\n\nLocalMultiStratum::~LocalMultiStratum() {}\n\n\/\/------------------------------------------------------------------------------\nuno::Sequence< rtl::OUString > SAL_CALL\n    LocalMultiStratum::listLayerIds( const rtl::OUString& aComponent,\n                                     const rtl::OUString& aEntity )\n        throw (backend::BackendAccessException, lang::IllegalArgumentException, uno::RuntimeException)\n{\n    typedef uno::Sequence< rtl::OUString > ResultType;\n\n    rtl::OUString const aLayerUrl   = impl_getLayerDataDirectory(getBaseUrl());\n    rtl::OUString const aComponentUrl = aLayerUrl + componentToPath(aComponent);\n\n    using namespace osl;\n    const sal_uInt32 k_STATUS_FIELDS =  FileStatusMask_Type | FileStatusMask_FileName;\n    Directory aComponentDirectory(aComponentUrl);\n    DirectoryItem aItem;\n    std::vector< rtl::OUString > aResult;\n\n    Directory::RC errcode = aComponentDirectory.open();\n    switch (errcode)\n    {\n    case Directory::E_NOENT:\n        return ResultType();\n\n    case Directory::E_None:\n        while (Directory::E_None == (errcode=aComponentDirectory.getNextItem(aItem)))\n        {\n            FileStatus aItemDescriptor( k_STATUS_FIELDS );\n            errcode = aItem.getFileStatus(aItemDescriptor);\n\n            if ( errcode != DirectoryItem::E_None )\n            {\n                OSL_ASSERT(errcode != Directory::E_NOENT); \/\/ unexpected failure for getFileStatus for existing file\n                if (errcode == Directory::E_NOENT) continue;\n\n                OSL_TRACE(\"Reading Component Directory - Error (%u) getting status of directory item.\\n\", unsigned(errcode));\n                break;\n            }\n\n            OSL_ENSURE( aItemDescriptor.isValid(FileStatusMask_Type), \"Could not get type of directory item\");\n            if (aItemDescriptor.getFileType() != FileStatus::Regular)\n                continue;\n\n            OSL_ENSURE( aItemDescriptor.isValid(FileStatusMask_FileName), \"Could not get Name of component found\");\n            OUString const aFileName = aItemDescriptor.getFileName();\n            if (!aFileName.endsWithIgnoreAsciiCaseAsciiL(RTL_CONSTASCII_STRINGPARAM(kLocalDataSuffix)))\n                continue;\n\n            aResult.push_back( makeLayerId(aComponent,aFileName) );\n        }\n        OSL_ASSERT(errcode != Directory::E_None); \/\/ Loop postcond\n\n        \/\/ joint error handling with open failure\n        if (errcode != Directory::E_NOENT) \/\/ normal loop termination\n        {\n    default: \/\/ if open() truly failed we also go here\n            rtl::OUStringBuffer errbuf;\n            errbuf.appendAscii(\"LocalMultiStratum::listLayerIds: \");\n            errbuf.appendAscii(\"Error scanning directory \").append(aComponentUrl)\n                  .appendAscii(\" for particle files. \");\n            errbuf.appendAscii(\"Error: \").append(FileHelper::createOSLErrorString(errcode));\n            rtl::OUString const errmsg = errbuf.makeStringAndClear();\n            throw backend::BackendAccessException(errmsg,*this,uno::Any());\n        }\n\n        return ResultType(&aResult.front(), static_cast<sal_Int32>(aResult.size()));\n    }\n}\n\n\/\/------------------------------------------------------------------------------\nrtl::OUString SAL_CALL\n    LocalMultiStratum::getUpdateLayerId( const rtl::OUString& aComponent,\n                                         const rtl::OUString& aEntity )\n        throw (backend::BackendAccessException, lang::NoSupportException,\n                lang::IllegalArgumentException, uno::RuntimeException)\n{\n    failReadonly();\n    return aComponent;\n}\n\n\/\/------------------------------------------------------------------------------\nuno::Reference< backend::XLayer > SAL_CALL\n    LocalMultiStratum::getLayer( const rtl::OUString& aLayerId,\n                                 const rtl::OUString& aTimestamp )\n        throw (backend::BackendAccessException, lang::IllegalArgumentException,\n                uno::RuntimeException)\n{\n    return LocalStratumBase::getLayer(aLayerId,aTimestamp);\n}\n\/\/------------------------------------------------------------------------------\nuno::Sequence< uno::Reference< backend::XLayer > > SAL_CALL\n    LocalMultiStratum::getLayers( const uno::Sequence< rtl::OUString >& aLayerIds,\n                                  const rtl::OUString& aTimestamp )\n        throw (backend::BackendAccessException, lang::IllegalArgumentException,\n                uno::RuntimeException)\n{\n    sal_Int32 const nLayers = aLayerIds.getLength();\n    uno::Sequence< uno::Reference< backend::XLayer > > aResult(nLayers);\n    for (sal_Int32 ix=0; ix<nLayers; ++ix)\n    {\n        aResult[ix] = LocalStratumBase::getLayer(aLayerIds[ix],aTimestamp);\n    }\n    return aResult;\n}\n\n\/\/------------------------------------------------------------------------------\nuno::Sequence< uno::Reference< backend::XLayer > > SAL_CALL\n    LocalMultiStratum::getMultipleLayers( const uno::Sequence< rtl::OUString >& aLayerIds,\n                                          const uno::Sequence< rtl::OUString >& aTimestamps )\n        throw (backend::BackendAccessException, lang::IllegalArgumentException,\n                uno::RuntimeException)\n{\n    if (aLayerIds.getLength() != aTimestamps.getLength()) {\n        throw lang::IllegalArgumentException(\n                rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\n                    \"LocalStratum::getMultipleLayers(): Timestamp count does not match layer count\")),\n                *this, 0) ;\n    }\n    sal_Int32 const nLayers = aLayerIds.getLength();\n    uno::Sequence< uno::Reference< backend::XLayer > > aResult(nLayers);\n    for (sal_Int32 ix=0; ix<nLayers; ++ix)\n    {\n        aResult[ix] = LocalStratumBase::getLayer(aLayerIds[ix],aTimestamps[ix]);\n    }\n    return aResult;\n}\n\n\/\/------------------------------------------------------------------------------\nuno::Reference< backend::XUpdatableLayer > SAL_CALL\n    LocalMultiStratum::getUpdatableLayer( const rtl::OUString& aLayerId )\n        throw (backend::BackendAccessException, lang::IllegalArgumentException,\n                lang::NoSupportException, uno::RuntimeException)\n{\n    failReadonly();\n    return 0;\n}\n\/\/------------------------------------------------------------------------------\n\nvoid LocalMultiStratum::getLayerDirectories(rtl::OUString& aLayerUrl,\n                                             rtl::OUString& aSubLayerUrl) const\n{\n    aLayerUrl   = impl_getLayerDataDirectory(getBaseUrl());\n    aSubLayerUrl = OUString();\n}\n\/\/------------------------------------------------------------------------------\n\/\/------------------------------------------------------------------------------\n\nstatic const sal_Char * const kMultiStratumImplementation =\n                \"com.sun.star.comp.configuration.backend.LocalMultiStratum\" ;\nstatic const sal_Char * const kBackendService =\n                \"com.sun.star.configuration.backend.MultiStratum\" ;\nstatic const sal_Char * const kLocalService =\n                \"com.sun.star.configuration.backend.LocalMultiStratum\" ;\n\nstatic AsciiServiceName kServiceNames [] = { kLocalService, 0, kBackendService, 0 } ;\nstatic const ServiceImplementationInfo kMultiStratumServiceInfo   = { kMultiStratumImplementation  , kServiceNames, kServiceNames + 2 } ;\n\nconst ServiceRegistrationInfo *getLocalMultiStratumServiceInfo()\n{ return getRegistrationInfo(&kMultiStratumServiceInfo) ; }\n\nuno::Reference<uno::XInterface> SAL_CALL\ninstantiateLocalMultiStratum(const CreationContext& xContext) {\n    return *new LocalMultiStratum(xContext) ;\n}\n\n\/\/------------------------------------------------------------------------------\n\nconst ServiceImplementationInfo * LocalMultiStratum::getServiceInfoData() const\n{\n    return &kMultiStratumServiceInfo;\n}\n\/\/------------------------------------------------------------------------------\n\/\/ ---------------------------------------------------------------------------------------\n\n} } \/\/ configmgr.localsinglestratum\n<commit_msg>INTEGRATION: CWS warnings01 (1.5.4); FILE MERGED 2005\/11\/01 12:47:23 cd 1.5.4.1: #i53898# Warning free code for sun solaris compiler<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: localmultistratum.cxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: hr $ $Date: 2006-06-19 23:25: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#include \"localmultistratum.hxx\"\n\n#ifndef CONFIGMGR_LOCALBE_LOCALFILEHELPER_HXX_\n#include \"localfilehelper.hxx\"\n#endif\n#ifndef _CONFIGMGR_FILEHELPER_HXX_\n#include \"filehelper.hxx\"\n#endif\n\n#ifndef CONFIGMGR_API_FACTORY_HXX_\n#include \"confapifactory.hxx\"\n#endif \/\/ CONFIGMGR_API_FACTORY_HXX_\n\n#ifndef CONFIGMGR_SERVICEINFOHELPER_HXX_\n#include \"serviceinfohelper.hxx\"\n#endif \/\/ CONFIGMGR_SERVICEINFOHELPER_HXX_\n\n#ifndef _RTL_USTRBUF_HXX_\n#include <rtl\/ustrbuf.hxx>\n#endif \/\/ _RTL_USTRBUF_HXX_\n\n#ifndef _COM_SUN_STAR_UNO_XCOMPONENTCONTEXT_HPP_\n#include <com\/sun\/star\/uno\/XComponentContext.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONFIGURATION_BACKEND_INSUFFICIENTACCESSRIGHTSEXCEPTION_HPP_\n#include <com\/sun\/star\/configuration\/backend\/InsufficientAccessRightsException.hpp>\n#endif\n\n#ifndef _OSL_FILE_HXX_\n#include <osl\/file.hxx>\n#endif\n\nnamespace configmgr { namespace localbe {\n\n\/\/==============================================================================\n\nstatic inline\nrtl::OUString const & impl_getLayerDataDirectory(rtl::OUString const & aLayerBaseUrl)\n{ return aLayerBaseUrl; }\n\/\/------------------------------------------------------------------------------\nstatic \/\/inline\nrtl::OUString makeLayerId(rtl::OUString const & aComponent,rtl::OUString const & aParticleFile)\n{\n    OSL_ASSERT(aParticleFile.endsWithIgnoreAsciiCaseAsciiL(RTL_CONSTASCII_STRINGPARAM(kLocalDataSuffix)));\n    const sal_Int32 kExtLength = RTL_CONSTASCII_LENGTH(kLocalDataSuffix);\n    rtl::OUString const aParticleName = aParticleFile.copy(0,aParticleFile.getLength() - kExtLength);\n\n    rtl::OUStringBuffer aLayerId(aComponent);\n    aLayerId.append(k_cLayerIdSeparator);\n    aLayerId.append(aParticleName);\n\n    return aLayerId.makeStringAndClear();\n}\n\nLocalMultiStratum::LocalMultiStratum(const uno::Reference<uno::XComponentContext>& xContext)\n: MultiStratumImplBase(xContext)\n{\n}\n\/\/------------------------------------------------------------------------------\n\nLocalMultiStratum::~LocalMultiStratum() {}\n\n\/\/------------------------------------------------------------------------------\nuno::Sequence< rtl::OUString > SAL_CALL\n    LocalMultiStratum::listLayerIds( const rtl::OUString& aComponent,\n                                     const rtl::OUString& \/*aEntity*\/ )\n        throw (backend::BackendAccessException, lang::IllegalArgumentException, uno::RuntimeException)\n{\n    typedef uno::Sequence< rtl::OUString > ResultType;\n\n    rtl::OUString const aLayerUrl   = impl_getLayerDataDirectory(getBaseUrl());\n    rtl::OUString const aComponentUrl = aLayerUrl + componentToPath(aComponent);\n\n    using namespace osl;\n    const sal_uInt32 k_STATUS_FIELDS =  FileStatusMask_Type | FileStatusMask_FileName;\n    Directory aComponentDirectory(aComponentUrl);\n    DirectoryItem aItem;\n    std::vector< rtl::OUString > aResult;\n\n    Directory::RC errcode = aComponentDirectory.open();\n    switch (errcode)\n    {\n    case Directory::E_NOENT:\n        return ResultType();\n\n    case Directory::E_None:\n        while (Directory::E_None == (errcode=aComponentDirectory.getNextItem(aItem)))\n        {\n            FileStatus aItemDescriptor( k_STATUS_FIELDS );\n            errcode = aItem.getFileStatus(aItemDescriptor);\n\n            if ( errcode != DirectoryItem::E_None )\n            {\n                OSL_ASSERT(errcode != Directory::E_NOENT); \/\/ unexpected failure for getFileStatus for existing file\n                if (errcode == Directory::E_NOENT) continue;\n\n                OSL_TRACE(\"Reading Component Directory - Error (%u) getting status of directory item.\\n\", unsigned(errcode));\n                break;\n            }\n\n            OSL_ENSURE( aItemDescriptor.isValid(FileStatusMask_Type), \"Could not get type of directory item\");\n            if (aItemDescriptor.getFileType() != FileStatus::Regular)\n                continue;\n\n            OSL_ENSURE( aItemDescriptor.isValid(FileStatusMask_FileName), \"Could not get Name of component found\");\n            OUString const aFileName = aItemDescriptor.getFileName();\n            if (!aFileName.endsWithIgnoreAsciiCaseAsciiL(RTL_CONSTASCII_STRINGPARAM(kLocalDataSuffix)))\n                continue;\n\n            aResult.push_back( makeLayerId(aComponent,aFileName) );\n        }\n        OSL_ASSERT(errcode != Directory::E_None); \/\/ Loop postcond\n\n        \/\/ joint error handling with open failure\n        if (errcode != Directory::E_NOENT) \/\/ normal loop termination\n        {\n    default: \/\/ if open() truly failed we also go here\n            rtl::OUStringBuffer errbuf;\n            errbuf.appendAscii(\"LocalMultiStratum::listLayerIds: \");\n            errbuf.appendAscii(\"Error scanning directory \").append(aComponentUrl)\n                  .appendAscii(\" for particle files. \");\n            errbuf.appendAscii(\"Error: \").append(FileHelper::createOSLErrorString(errcode));\n            rtl::OUString const errmsg = errbuf.makeStringAndClear();\n            throw backend::BackendAccessException(errmsg,*this,uno::Any());\n        }\n\n        return ResultType(&aResult.front(), static_cast<sal_Int32>(aResult.size()));\n    }\n}\n\n\/\/------------------------------------------------------------------------------\nrtl::OUString SAL_CALL\n    LocalMultiStratum::getUpdateLayerId( const rtl::OUString& aComponent,\n                                         const rtl::OUString& \/*aEntity*\/ )\n        throw (backend::BackendAccessException, lang::NoSupportException,\n                lang::IllegalArgumentException, uno::RuntimeException)\n{\n    failReadonly();\n    return aComponent;\n}\n\n\/\/------------------------------------------------------------------------------\nuno::Reference< backend::XLayer > SAL_CALL\n    LocalMultiStratum::getLayer( const rtl::OUString& aLayerId,\n                                 const rtl::OUString& aTimestamp )\n        throw (backend::BackendAccessException, lang::IllegalArgumentException,\n                uno::RuntimeException)\n{\n    return LocalStratumBase::getLayer(aLayerId,aTimestamp);\n}\n\/\/------------------------------------------------------------------------------\nuno::Sequence< uno::Reference< backend::XLayer > > SAL_CALL\n    LocalMultiStratum::getLayers( const uno::Sequence< rtl::OUString >& aLayerIds,\n                                  const rtl::OUString& aTimestamp )\n        throw (backend::BackendAccessException, lang::IllegalArgumentException,\n                uno::RuntimeException)\n{\n    sal_Int32 const nLayers = aLayerIds.getLength();\n    uno::Sequence< uno::Reference< backend::XLayer > > aResult(nLayers);\n    for (sal_Int32 ix=0; ix<nLayers; ++ix)\n    {\n        aResult[ix] = LocalStratumBase::getLayer(aLayerIds[ix],aTimestamp);\n    }\n    return aResult;\n}\n\n\/\/------------------------------------------------------------------------------\nuno::Sequence< uno::Reference< backend::XLayer > > SAL_CALL\n    LocalMultiStratum::getMultipleLayers( const uno::Sequence< rtl::OUString >& aLayerIds,\n                                          const uno::Sequence< rtl::OUString >& aTimestamps )\n        throw (backend::BackendAccessException, lang::IllegalArgumentException,\n                uno::RuntimeException)\n{\n    if (aLayerIds.getLength() != aTimestamps.getLength()) {\n        throw lang::IllegalArgumentException(\n                rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\n                    \"LocalStratum::getMultipleLayers(): Timestamp count does not match layer count\")),\n                *this, 0) ;\n    }\n    sal_Int32 const nLayers = aLayerIds.getLength();\n    uno::Sequence< uno::Reference< backend::XLayer > > aResult(nLayers);\n    for (sal_Int32 ix=0; ix<nLayers; ++ix)\n    {\n        aResult[ix] = LocalStratumBase::getLayer(aLayerIds[ix],aTimestamps[ix]);\n    }\n    return aResult;\n}\n\n\/\/------------------------------------------------------------------------------\nuno::Reference< backend::XUpdatableLayer > SAL_CALL\n    LocalMultiStratum::getUpdatableLayer( const rtl::OUString& \/*aLayerId*\/ )\n        throw (backend::BackendAccessException, lang::IllegalArgumentException,\n                lang::NoSupportException, uno::RuntimeException)\n{\n    failReadonly();\n    return 0;\n}\n\/\/------------------------------------------------------------------------------\n\nvoid LocalMultiStratum::getLayerDirectories(rtl::OUString& aLayerUrl,\n                                             rtl::OUString& aSubLayerUrl) const\n{\n    aLayerUrl   = impl_getLayerDataDirectory(getBaseUrl());\n    aSubLayerUrl = OUString();\n}\n\/\/------------------------------------------------------------------------------\n\/\/------------------------------------------------------------------------------\n\nstatic const sal_Char * const kMultiStratumImplementation =\n                \"com.sun.star.comp.configuration.backend.LocalMultiStratum\" ;\nstatic const sal_Char * const kBackendService =\n                \"com.sun.star.configuration.backend.MultiStratum\" ;\nstatic const sal_Char * const kLocalService =\n                \"com.sun.star.configuration.backend.LocalMultiStratum\" ;\n\nstatic AsciiServiceName kServiceNames [] = { kLocalService, 0, kBackendService, 0 } ;\nstatic const ServiceImplementationInfo kMultiStratumServiceInfo   = { kMultiStratumImplementation  , kServiceNames, kServiceNames + 2 } ;\n\nconst ServiceRegistrationInfo *getLocalMultiStratumServiceInfo()\n{ return getRegistrationInfo(&kMultiStratumServiceInfo) ; }\n\nuno::Reference<uno::XInterface> SAL_CALL\ninstantiateLocalMultiStratum(const CreationContext& xContext) {\n    return *new LocalMultiStratum(xContext) ;\n}\n\n\/\/------------------------------------------------------------------------------\n\nconst ServiceImplementationInfo * LocalMultiStratum::getServiceInfoData() const\n{\n    return &kMultiStratumServiceInfo;\n}\n\/\/------------------------------------------------------------------------------\n\/\/ ---------------------------------------------------------------------------------------\n\n} } \/\/ configmgr.localsinglestratum\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: rlrcitem.cxx,v $\n *\n *  $Revision: 1.10 $\n *\n *  last change: $Author: hr $ $Date: 2007-06-27 17:36:31 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_svx.hxx\"\n\n\/\/ INCLUDE ---------------------------------------------------------------\n\n#ifndef _SFXRECTITEM_HXX\n#include <svtools\/rectitem.hxx>\n#endif\n\n\n\n\n\n\n#include <svx\/dialogs.hrc>\n\n#include <svx\/ruler.hxx>\n#include <svx\/lrspitem.hxx>\n#include <svx\/ulspitem.hxx>\n#include <svx\/tstpitem.hxx>\n#include \"protitem.hxx\"\n#include \"rlrcitem.hxx\"\n#include \"rulritem.hxx\"\n#ifndef _SFXENUMITEM_HXX\n#include <svtools\/eitem.hxx>\n#endif\n\n\/\/ class SvxRulerItem ----------------------------------------------------\n\nSvxRulerItem::SvxRulerItem(USHORT _nId, SvxRuler &rRul, SfxBindings &rBindings)\n: SfxControllerItem(_nId, rBindings),\n  rRuler(rRul)\n{\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SvxRulerItem::StateChanged( USHORT nSID, SfxItemState eState,\n                                 const SfxPoolItem* pState)\n{\n    \/\/ SFX_ITEM_DONTCARE => pState == -1 => PTR_CAST buff\n    if ( eState != SFX_ITEM_AVAILABLE )\n        pState = 0;\n\n    switch(nSID)\n    {\n        \/\/ Linker \/ rechter Seitenrand\n        case SID_RULER_LR_MIN_MAX:\n        {\n            const SfxRectangleItem *pItem = PTR_CAST(SfxRectangleItem, pState);\n            rRuler.UpdateFrameMinMax(pItem);\n            break;\n        }\n        case SID_ATTR_LONG_LRSPACE:\n        {\n            const SvxLongLRSpaceItem *pItem = PTR_CAST(SvxLongLRSpaceItem, pState);\n            DBG_ASSERT(pState? 0 != pItem: TRUE, \"SvxLRSpaceItem erwartet\");\n            rRuler.UpdateFrame(pItem);\n            break;\n        }\n        case SID_ATTR_LONG_ULSPACE:\n        {\n            const SvxLongULSpaceItem *pItem = PTR_CAST(SvxLongULSpaceItem, pState);\n            DBG_ASSERT(pState? 0 != pItem: TRUE, \"SvxULSpaceItem erwartet\");\n            rRuler.UpdateFrame(pItem);\n            break;\n        }\n        case SID_ATTR_TABSTOP_VERTICAL:\n        case SID_ATTR_TABSTOP:\n        {\n            const SvxTabStopItem *pItem = PTR_CAST(SvxTabStopItem, pState);\n            DBG_ASSERT(pState?  0 != pItem: TRUE, \"SvxTabStopItem erwartet\");\n            rRuler.Update(pItem);\n            break;\n        }\n        case SID_ATTR_PARA_LRSPACE_VERTICAL:\n        case SID_ATTR_PARA_LRSPACE:\n        {\n            const SvxLRSpaceItem *pItem = PTR_CAST(SvxLRSpaceItem, pState);\n            DBG_ASSERT(pState?  0 != pItem: TRUE, \"SvxLRSpaceItem erwartet\");\n            rRuler.UpdatePara(pItem);\n            break;\n        }\n        case SID_RULER_BORDERS_VERTICAL:\n        case SID_RULER_BORDERS:\n        case SID_RULER_ROWS:\n        case SID_RULER_ROWS_VERTICAL:\n        {\n            const SvxColumnItem *pItem = PTR_CAST(SvxColumnItem, pState);\n            DBG_ASSERT(pState?  0 != pItem: TRUE, \"SvxColumnItem erwartet\");\n#ifdef DBG_UTIL\n            if(pItem)\n            {\n                if(pItem->IsConsistent())\n                    rRuler.Update(pItem, nSID);\n                else\n                    DBG_ERROR(\"Spaltenitem corrupted\");\n            }\n            else\n                rRuler.Update(pItem, nSID);\n#else\n            rRuler.Update(pItem, nSID);\n#endif\n            break;\n        }\n        case SID_RULER_PAGE_POS:\n        {   \/\/ Position Seite, Seitenbreite\n            const SvxPagePosSizeItem *pItem = PTR_CAST(SvxPagePosSizeItem, pState);\n            DBG_ASSERT(pState?  0 != pItem: TRUE, \"SvxPagePosSizeItem erwartet\");\n            rRuler.Update(pItem);\n            break;\n        }\n        case SID_RULER_OBJECT:\n        {   \/\/ Object-Selektion\n            const SvxObjectItem *pItem = PTR_CAST(SvxObjectItem, pState);\n            DBG_ASSERT(pState?  0 != pItem: TRUE, \"SvxObjectItem erwartet\");\n            rRuler.Update(pItem);\n            break;\n        }\n        case SID_RULER_PROTECT:\n        {\n            const SvxProtectItem *pItem = PTR_CAST(SvxProtectItem, pState);\n            DBG_ASSERT(pState?  0 != pItem: TRUE, \"SvxProtectItem erwartet\");\n            rRuler.Update(pItem);\n            break;\n        }\n        case SID_RULER_BORDER_DISTANCE:\n        {\n            const SvxLRSpaceItem *pItem = PTR_CAST(SvxLRSpaceItem, pState);\n            DBG_ASSERT(pState?  0 != pItem: TRUE, \"SvxLRSpaceItem erwartet\");\n            rRuler.UpdateParaBorder(pItem);\n        }\n        break;\n        case SID_RULER_TEXT_RIGHT_TO_LEFT :\n        {\n            const SfxBoolItem *pItem = PTR_CAST(SfxBoolItem, pState);\n            DBG_ASSERT(pState?  0 != pItem: TRUE, \"SfxBoolItem erwartet\");\n            rRuler.UpdateTextRTL(pItem);\n        }\n        break;\n    }\n}\n\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.10.368); FILE MERGED 2008\/04\/01 15:50:30 thb 1.10.368.2: #i85898# Stripping all external header guards 2008\/03\/31 14:20:01 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: rlrcitem.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\/\/ INCLUDE ---------------------------------------------------------------\n#include <svtools\/rectitem.hxx>\n\n\n\n\n\n\n#include <svx\/dialogs.hrc>\n\n#include <svx\/ruler.hxx>\n#include <svx\/lrspitem.hxx>\n#include <svx\/ulspitem.hxx>\n#include <svx\/tstpitem.hxx>\n#include \"protitem.hxx\"\n#include \"rlrcitem.hxx\"\n#include \"rulritem.hxx\"\n#include <svtools\/eitem.hxx>\n\n\/\/ class SvxRulerItem ----------------------------------------------------\n\nSvxRulerItem::SvxRulerItem(USHORT _nId, SvxRuler &rRul, SfxBindings &rBindings)\n: SfxControllerItem(_nId, rBindings),\n  rRuler(rRul)\n{\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SvxRulerItem::StateChanged( USHORT nSID, SfxItemState eState,\n                                 const SfxPoolItem* pState)\n{\n    \/\/ SFX_ITEM_DONTCARE => pState == -1 => PTR_CAST buff\n    if ( eState != SFX_ITEM_AVAILABLE )\n        pState = 0;\n\n    switch(nSID)\n    {\n        \/\/ Linker \/ rechter Seitenrand\n        case SID_RULER_LR_MIN_MAX:\n        {\n            const SfxRectangleItem *pItem = PTR_CAST(SfxRectangleItem, pState);\n            rRuler.UpdateFrameMinMax(pItem);\n            break;\n        }\n        case SID_ATTR_LONG_LRSPACE:\n        {\n            const SvxLongLRSpaceItem *pItem = PTR_CAST(SvxLongLRSpaceItem, pState);\n            DBG_ASSERT(pState? 0 != pItem: TRUE, \"SvxLRSpaceItem erwartet\");\n            rRuler.UpdateFrame(pItem);\n            break;\n        }\n        case SID_ATTR_LONG_ULSPACE:\n        {\n            const SvxLongULSpaceItem *pItem = PTR_CAST(SvxLongULSpaceItem, pState);\n            DBG_ASSERT(pState? 0 != pItem: TRUE, \"SvxULSpaceItem erwartet\");\n            rRuler.UpdateFrame(pItem);\n            break;\n        }\n        case SID_ATTR_TABSTOP_VERTICAL:\n        case SID_ATTR_TABSTOP:\n        {\n            const SvxTabStopItem *pItem = PTR_CAST(SvxTabStopItem, pState);\n            DBG_ASSERT(pState?  0 != pItem: TRUE, \"SvxTabStopItem erwartet\");\n            rRuler.Update(pItem);\n            break;\n        }\n        case SID_ATTR_PARA_LRSPACE_VERTICAL:\n        case SID_ATTR_PARA_LRSPACE:\n        {\n            const SvxLRSpaceItem *pItem = PTR_CAST(SvxLRSpaceItem, pState);\n            DBG_ASSERT(pState?  0 != pItem: TRUE, \"SvxLRSpaceItem erwartet\");\n            rRuler.UpdatePara(pItem);\n            break;\n        }\n        case SID_RULER_BORDERS_VERTICAL:\n        case SID_RULER_BORDERS:\n        case SID_RULER_ROWS:\n        case SID_RULER_ROWS_VERTICAL:\n        {\n            const SvxColumnItem *pItem = PTR_CAST(SvxColumnItem, pState);\n            DBG_ASSERT(pState?  0 != pItem: TRUE, \"SvxColumnItem erwartet\");\n#ifdef DBG_UTIL\n            if(pItem)\n            {\n                if(pItem->IsConsistent())\n                    rRuler.Update(pItem, nSID);\n                else\n                    DBG_ERROR(\"Spaltenitem corrupted\");\n            }\n            else\n                rRuler.Update(pItem, nSID);\n#else\n            rRuler.Update(pItem, nSID);\n#endif\n            break;\n        }\n        case SID_RULER_PAGE_POS:\n        {   \/\/ Position Seite, Seitenbreite\n            const SvxPagePosSizeItem *pItem = PTR_CAST(SvxPagePosSizeItem, pState);\n            DBG_ASSERT(pState?  0 != pItem: TRUE, \"SvxPagePosSizeItem erwartet\");\n            rRuler.Update(pItem);\n            break;\n        }\n        case SID_RULER_OBJECT:\n        {   \/\/ Object-Selektion\n            const SvxObjectItem *pItem = PTR_CAST(SvxObjectItem, pState);\n            DBG_ASSERT(pState?  0 != pItem: TRUE, \"SvxObjectItem erwartet\");\n            rRuler.Update(pItem);\n            break;\n        }\n        case SID_RULER_PROTECT:\n        {\n            const SvxProtectItem *pItem = PTR_CAST(SvxProtectItem, pState);\n            DBG_ASSERT(pState?  0 != pItem: TRUE, \"SvxProtectItem erwartet\");\n            rRuler.Update(pItem);\n            break;\n        }\n        case SID_RULER_BORDER_DISTANCE:\n        {\n            const SvxLRSpaceItem *pItem = PTR_CAST(SvxLRSpaceItem, pState);\n            DBG_ASSERT(pState?  0 != pItem: TRUE, \"SvxLRSpaceItem erwartet\");\n            rRuler.UpdateParaBorder(pItem);\n        }\n        break;\n        case SID_RULER_TEXT_RIGHT_TO_LEFT :\n        {\n            const SfxBoolItem *pItem = PTR_CAST(SfxBoolItem, pState);\n            DBG_ASSERT(pState?  0 != pItem: TRUE, \"SfxBoolItem erwartet\");\n            rRuler.UpdateTextRTL(pItem);\n        }\n        break;\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\/\/ This test validates that the ProcessSingleton class properly makes sure\n\/\/ that there is only one main browser process.\n\/\/\n\/\/ It is currently compiled and run on Windows and Posix(non-Mac) platforms.\n\/\/ Mac uses system services and ProcessSingletonMac is a noop.  (Maybe it still\n\/\/ makes sense to test that the system services are giving the behavior we\n\/\/ want?)\n\n#include \"base\/bind.h\"\n#include \"base\/command_line.h\"\n#include \"base\/files\/file_path.h\"\n#include \"base\/files\/scoped_temp_dir.h\"\n#include \"base\/location.h\"\n#include \"base\/memory\/ref_counted.h\"\n#include \"base\/path_service.h\"\n#include \"base\/process\/launch.h\"\n#include \"base\/process\/process.h\"\n#include \"base\/process\/process_iterator.h\"\n#include \"base\/single_thread_task_runner.h\"\n#include \"base\/synchronization\/waitable_event.h\"\n#include \"base\/test\/test_timeouts.h\"\n#include \"base\/threading\/thread.h\"\n#include \"chrome\/common\/chrome_constants.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/test\/base\/in_process_browser_test.h\"\n#include \"chrome\/test\/base\/test_launcher_utils.h\"\n\nnamespace {\n\n\/\/ This is for the code that is to be ran in multiple threads at once,\n\/\/ to stress a race condition on first process start.\n\/\/ We use the thread safe ref counted base class so that we can use the\n\/\/ base::Bind to run the StartChrome methods in many threads.\nclass ChromeStarter : public base::RefCountedThreadSafe<ChromeStarter> {\n public:\n  ChromeStarter(base::TimeDelta timeout, const base::FilePath& user_data_dir)\n      : ready_event_(false \/* manual *\/, false \/* signaled *\/),\n        done_event_(false \/* manual *\/, false \/* signaled *\/),\n        process_terminated_(false),\n        timeout_(timeout),\n        user_data_dir_(user_data_dir) {\n  }\n\n  \/\/ We must reset some data members since we reuse the same ChromeStarter\n  \/\/ object and start\/stop it a few times. We must start fresh! :-)\n  void Reset() {\n    ready_event_.Reset();\n    done_event_.Reset();\n    if (process_.IsValid())\n      process_.Close();\n    process_terminated_ = false;\n  }\n\n  void StartChrome(base::WaitableEvent* start_event, bool first_run) {\n    \/\/ TODO(mattm): maybe stuff should be refactored to use\n    \/\/ UITest::LaunchBrowserHelper somehow?\n    base::FilePath program;\n    ASSERT_TRUE(PathService::Get(base::FILE_EXE, &program));\n    base::CommandLine command_line(program);\n    command_line.AppendSwitchPath(switches::kUserDataDir, user_data_dir_);\n\n    if (first_run)\n      command_line.AppendSwitch(switches::kForceFirstRun);\n    else\n      command_line.AppendSwitch(switches::kNoFirstRun);\n\n    \/\/ Add the normal test-mode switches, except for the ones we're adding\n    \/\/ ourselves.\n    base::CommandLine standard_switches(base::CommandLine::NO_PROGRAM);\n    test_launcher_utils::PrepareBrowserCommandLineForTests(&standard_switches);\n    const base::CommandLine::SwitchMap& switch_map =\n        standard_switches.GetSwitches();\n    for (base::CommandLine::SwitchMap::const_iterator i = switch_map.begin();\n         i != switch_map.end(); ++i) {\n      const std::string& switch_name = i->first;\n      if (switch_name == switches::kUserDataDir ||\n          switch_name == switches::kForceFirstRun ||\n          switch_name == switches::kNoFirstRun)\n        continue;\n\n      command_line.AppendSwitchNative(switch_name, i->second);\n    }\n\n    \/\/ Try to get all threads to launch the app at the same time.\n    \/\/ So let the test know we are ready.\n    ready_event_.Signal();\n    \/\/ And then wait for the test to tell us to GO!\n    ASSERT_NE(static_cast<base::WaitableEvent*>(NULL), start_event);\n    start_event->Wait();\n\n    \/\/ Here we don't wait for the app to be terminated because one of the\n    \/\/ process will stay alive while the others will be restarted. If we would\n    \/\/ wait here, we would never get a handle to the main process...\n    process_ = base::LaunchProcess(command_line, base::LaunchOptions());\n    ASSERT_TRUE(process_.IsValid());\n\n    \/\/ We can wait on the handle here, we should get stuck on one and only\n    \/\/ one process. The test below will take care of killing that process\n    \/\/ to unstuck us once it confirms there is only one.\n    int exit_code;\n    process_terminated_ = process_.WaitForExitWithTimeout(timeout_, &exit_code);\n    \/\/ Let the test know we are done.\n    done_event_.Signal();\n  }\n\n  \/\/ Public access to simplify the test code using them.\n  base::WaitableEvent ready_event_;\n  base::WaitableEvent done_event_;\n  base::Process process_;\n  bool process_terminated_;\n\n private:\n  friend class base::RefCountedThreadSafe<ChromeStarter>;\n\n  ~ChromeStarter() {}\n\n  base::TimeDelta timeout_;\n  base::FilePath user_data_dir_;\n\n  DISALLOW_COPY_AND_ASSIGN(ChromeStarter);\n};\n\n}  \/\/ namespace\n\n\/\/ Our test fixture that initializes and holds onto a few global vars.\nclass ProcessSingletonTest : public InProcessBrowserTest {\n public:\n  ProcessSingletonTest()\n      \/\/ We use a manual reset so that all threads wake up at once when signaled\n      \/\/ and thus we must manually reset it for each attempt.\n      : threads_waker_(true \/* manual *\/, false \/* signaled *\/) {\n    EXPECT_TRUE(temp_profile_dir_.CreateUniqueTempDir());\n  }\n\n  void SetUp() override {\n    \/\/ Start the threads and create the starters.\n    for (size_t i = 0; i < kNbThreads; ++i) {\n      chrome_starter_threads_[i].reset(new base::Thread(\"ChromeStarter\"));\n      ASSERT_TRUE(chrome_starter_threads_[i]->Start());\n      chrome_starters_[i] = new ChromeStarter(\n          TestTimeouts::action_max_timeout(), temp_profile_dir_.path());\n    }\n  }\n\n  void TearDown() override {\n    \/\/ Stop the threads.\n    for (size_t i = 0; i < kNbThreads; ++i)\n      chrome_starter_threads_[i]->Stop();\n  }\n\n  \/\/ This method is used to make sure we kill the main browser process after\n  \/\/ all of its child processes have successfully attached to it. This was added\n  \/\/ when we realized that if we just kill the parent process right away, we\n  \/\/ sometimes end up with dangling child processes. If we Sleep for a certain\n  \/\/ amount of time, we are OK... So we introduced this method to avoid a\n  \/\/ flaky wait. Instead, we kill all descendants of the main process after we\n  \/\/ killed it, relying on the fact that we can still get the parent id of a\n  \/\/ child process, even when the parent dies.\n  void KillProcessTree(const base::Process& process) {\n    class ProcessTreeFilter : public base::ProcessFilter {\n     public:\n      explicit ProcessTreeFilter(base::ProcessId parent_pid) {\n        ancestor_pids_.insert(parent_pid);\n      }\n      bool Includes(const base::ProcessEntry& entry) const override {\n        if (ancestor_pids_.find(entry.parent_pid()) != ancestor_pids_.end()) {\n          ancestor_pids_.insert(entry.pid());\n          return true;\n        } else {\n          return false;\n        }\n      }\n     private:\n      mutable std::set<base::ProcessId> ancestor_pids_;\n    } process_tree_filter(process.Pid());\n\n    \/\/ Start by explicitly killing the main process we know about...\n    static const int kExitCode = 42;\n    EXPECT_TRUE(process.Terminate(kExitCode, true \/* wait *\/));\n\n    \/\/ Then loop until we can't find any of its descendant.\n    \/\/ But don't try more than kNbTries times...\n    static const int kNbTries = 10;\n    int num_tries = 0;\n    base::FilePath program;\n    ASSERT_TRUE(PathService::Get(base::FILE_EXE, &program));\n    base::FilePath::StringType exe_name = program.BaseName().value();\n    while (base::GetProcessCount(exe_name, &process_tree_filter) > 0 &&\n           num_tries++ < kNbTries) {\n      base::KillProcesses(exe_name, kExitCode, &process_tree_filter);\n    }\n    DLOG_IF(ERROR, num_tries >= kNbTries) << \"Failed to kill all processes!\";\n  }\n\n  \/\/ Since this is a hard to reproduce problem, we make a few attempts.\n  \/\/ We stop the attempts at the first error, and when there are no errors,\n  \/\/ we don't time-out of any wait, so it executes quite fast anyway.\n  static const size_t kNbAttempts = 5;\n\n  \/\/ The idea is to start chrome from multiple threads all at once.\n  static const size_t kNbThreads = 5;\n  scoped_refptr<ChromeStarter> chrome_starters_[kNbThreads];\n  scoped_ptr<base::Thread> chrome_starter_threads_[kNbThreads];\n\n  \/\/ The event that will get all threads to wake up simultaneously and try\n  \/\/ to start a chrome process at the same time.\n  base::WaitableEvent threads_waker_;\n\n  \/\/ We don't want to use the default profile, but can't use UITest's since we\n  \/\/ don't use UITest::LaunchBrowser.\n  base::ScopedTempDir temp_profile_dir_;\n};\n\n#if defined(OS_LINUX) && defined(TOOLKIT_VIEWS)\n\/\/ http:\/\/crbug.com\/58219\n#define MAYBE_StartupRaceCondition DISABLED_StartupRaceCondition\n#else\n#define MAYBE_StartupRaceCondition StartupRaceCondition\n#endif\nIN_PROC_BROWSER_TEST_F(ProcessSingletonTest, MAYBE_StartupRaceCondition) {\n  \/\/ We use this to stop the attempts loop on the first failure.\n  bool failed = false;\n  for (size_t attempt = 0; attempt < kNbAttempts && !failed; ++attempt) {\n    SCOPED_TRACE(testing::Message() << \"Attempt: \" << attempt << \".\");\n    \/\/ We use a single event to get all threads to do the AppLaunch at the same\n    \/\/ time...\n    threads_waker_.Reset();\n\n    \/\/ Test both with and without the first-run dialog, since they exercise\n    \/\/ different paths.\n#if defined(OS_POSIX)\n    \/\/ TODO(mattm): test first run dialog singleton handling on linux too.\n    \/\/ On posix if we test the first run dialog, GracefulShutdownHandler gets\n    \/\/ the TERM signal, but since the message loop isn't running during the gtk\n    \/\/ first run dialog, the ShutdownDetector never handles it, and KillProcess\n    \/\/ has to time out (60 sec!) and SIGKILL.\n    bool first_run = false;\n#else\n    \/\/ Test for races in both regular start up and first run start up cases.\n    bool first_run = attempt % 2;\n#endif\n\n    \/\/ Here we prime all the threads with a ChromeStarter that will wait for\n    \/\/ our signal to launch its chrome process.\n    for (size_t i = 0; i < kNbThreads; ++i) {\n      ASSERT_NE(static_cast<ChromeStarter*>(NULL), chrome_starters_[i].get());\n      chrome_starters_[i]->Reset();\n\n      ASSERT_TRUE(chrome_starter_threads_[i]->IsRunning());\n      ASSERT_NE(static_cast<base::MessageLoop*>(NULL),\n                chrome_starter_threads_[i]->message_loop());\n\n      chrome_starter_threads_[i]->task_runner()->PostTask(\n          FROM_HERE,\n          base::Bind(&ChromeStarter::StartChrome, chrome_starters_[i].get(),\n                     &threads_waker_, first_run));\n    }\n\n    \/\/ Wait for all the starters to be ready.\n    \/\/ We could replace this loop if we ever implement a WaitAll().\n    for (size_t i = 0; i < kNbThreads; ++i) {\n      SCOPED_TRACE(testing::Message() << \"Waiting on thread: \" << i << \".\");\n      chrome_starters_[i]->ready_event_.Wait();\n    }\n    \/\/ GO!\n    threads_waker_.Signal();\n\n    \/\/ As we wait for all threads to signal that they are done, we remove their\n    \/\/ index from this vector so that we get left with only the index of\n    \/\/ the thread that started the main process.\n    std::vector<size_t> pending_starters(kNbThreads);\n    for (size_t i = 0; i < kNbThreads; ++i)\n      pending_starters[i] = i;\n\n    \/\/ We use a local array of starter's done events we must wait on...\n    \/\/ These are collected from the starters that we have not yet been removed\n    \/\/ from the pending_starters vector.\n    base::WaitableEvent* starters_done_events[kNbThreads];\n    \/\/ At the end, \"There can be only one\" main browser process alive.\n    while (pending_starters.size() > 1) {\n      SCOPED_TRACE(testing::Message() << pending_starters.size() <<\n                   \" starters left.\");\n      for (size_t i = 0; i < pending_starters.size(); ++i) {\n        starters_done_events[i] =\n            &chrome_starters_[pending_starters[i]]->done_event_;\n      }\n      size_t done_index = base::WaitableEvent::WaitMany(\n          starters_done_events, pending_starters.size());\n      size_t starter_index = pending_starters[done_index];\n      \/\/ If the starter is done but has not marked itself as terminated,\n      \/\/ it is because it timed out of its WaitForExitCodeWithTimeout(). Only\n      \/\/ the last one standing should be left waiting... So we failed...\n      EXPECT_TRUE(chrome_starters_[starter_index]->process_terminated_ ||\n                  failed) << \"There is more than one main process.\";\n      if (!chrome_starters_[starter_index]->process_terminated_) {\n        \/\/ This will stop the \"for kNbAttempts\" loop.\n        failed = true;\n        \/\/ But we let the last loop turn finish so that we can properly\n        \/\/ kill all remaining processes. Starting with this one...\n        if (chrome_starters_[starter_index]->process_.IsValid()) {\n          KillProcessTree(chrome_starters_[starter_index]->process_);\n        }\n      }\n      pending_starters.erase(pending_starters.begin() + done_index);\n    }\n\n    \/\/ \"There can be only one!\" :-)\n    ASSERT_EQ(static_cast<size_t>(1), pending_starters.size());\n    size_t last_index = pending_starters.front();\n    pending_starters.clear();\n    if (chrome_starters_[last_index]->process_.IsValid()) {\n      KillProcessTree(chrome_starters_[last_index]->process_);\n      chrome_starters_[last_index]->done_event_.Wait();\n    }\n  }\n}\n<commit_msg>Disable ProcessSingletonTest.StartupRaceCondition<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\/\/ This test validates that the ProcessSingleton class properly makes sure\n\/\/ that there is only one main browser process.\n\/\/\n\/\/ It is currently compiled and run on Windows and Posix(non-Mac) platforms.\n\/\/ Mac uses system services and ProcessSingletonMac is a noop.  (Maybe it still\n\/\/ makes sense to test that the system services are giving the behavior we\n\/\/ want?)\n\n#include \"base\/bind.h\"\n#include \"base\/command_line.h\"\n#include \"base\/files\/file_path.h\"\n#include \"base\/files\/scoped_temp_dir.h\"\n#include \"base\/location.h\"\n#include \"base\/memory\/ref_counted.h\"\n#include \"base\/path_service.h\"\n#include \"base\/process\/launch.h\"\n#include \"base\/process\/process.h\"\n#include \"base\/process\/process_iterator.h\"\n#include \"base\/single_thread_task_runner.h\"\n#include \"base\/synchronization\/waitable_event.h\"\n#include \"base\/test\/test_timeouts.h\"\n#include \"base\/threading\/thread.h\"\n#include \"chrome\/common\/chrome_constants.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/test\/base\/in_process_browser_test.h\"\n#include \"chrome\/test\/base\/test_launcher_utils.h\"\n\nnamespace {\n\n\/\/ This is for the code that is to be ran in multiple threads at once,\n\/\/ to stress a race condition on first process start.\n\/\/ We use the thread safe ref counted base class so that we can use the\n\/\/ base::Bind to run the StartChrome methods in many threads.\nclass ChromeStarter : public base::RefCountedThreadSafe<ChromeStarter> {\n public:\n  ChromeStarter(base::TimeDelta timeout, const base::FilePath& user_data_dir)\n      : ready_event_(false \/* manual *\/, false \/* signaled *\/),\n        done_event_(false \/* manual *\/, false \/* signaled *\/),\n        process_terminated_(false),\n        timeout_(timeout),\n        user_data_dir_(user_data_dir) {\n  }\n\n  \/\/ We must reset some data members since we reuse the same ChromeStarter\n  \/\/ object and start\/stop it a few times. We must start fresh! :-)\n  void Reset() {\n    ready_event_.Reset();\n    done_event_.Reset();\n    if (process_.IsValid())\n      process_.Close();\n    process_terminated_ = false;\n  }\n\n  void StartChrome(base::WaitableEvent* start_event, bool first_run) {\n    \/\/ TODO(mattm): maybe stuff should be refactored to use\n    \/\/ UITest::LaunchBrowserHelper somehow?\n    base::FilePath program;\n    ASSERT_TRUE(PathService::Get(base::FILE_EXE, &program));\n    base::CommandLine command_line(program);\n    command_line.AppendSwitchPath(switches::kUserDataDir, user_data_dir_);\n\n    if (first_run)\n      command_line.AppendSwitch(switches::kForceFirstRun);\n    else\n      command_line.AppendSwitch(switches::kNoFirstRun);\n\n    \/\/ Add the normal test-mode switches, except for the ones we're adding\n    \/\/ ourselves.\n    base::CommandLine standard_switches(base::CommandLine::NO_PROGRAM);\n    test_launcher_utils::PrepareBrowserCommandLineForTests(&standard_switches);\n    const base::CommandLine::SwitchMap& switch_map =\n        standard_switches.GetSwitches();\n    for (base::CommandLine::SwitchMap::const_iterator i = switch_map.begin();\n         i != switch_map.end(); ++i) {\n      const std::string& switch_name = i->first;\n      if (switch_name == switches::kUserDataDir ||\n          switch_name == switches::kForceFirstRun ||\n          switch_name == switches::kNoFirstRun)\n        continue;\n\n      command_line.AppendSwitchNative(switch_name, i->second);\n    }\n\n    \/\/ Try to get all threads to launch the app at the same time.\n    \/\/ So let the test know we are ready.\n    ready_event_.Signal();\n    \/\/ And then wait for the test to tell us to GO!\n    ASSERT_NE(static_cast<base::WaitableEvent*>(NULL), start_event);\n    start_event->Wait();\n\n    \/\/ Here we don't wait for the app to be terminated because one of the\n    \/\/ process will stay alive while the others will be restarted. If we would\n    \/\/ wait here, we would never get a handle to the main process...\n    process_ = base::LaunchProcess(command_line, base::LaunchOptions());\n    ASSERT_TRUE(process_.IsValid());\n\n    \/\/ We can wait on the handle here, we should get stuck on one and only\n    \/\/ one process. The test below will take care of killing that process\n    \/\/ to unstuck us once it confirms there is only one.\n    int exit_code;\n    process_terminated_ = process_.WaitForExitWithTimeout(timeout_, &exit_code);\n    \/\/ Let the test know we are done.\n    done_event_.Signal();\n  }\n\n  \/\/ Public access to simplify the test code using them.\n  base::WaitableEvent ready_event_;\n  base::WaitableEvent done_event_;\n  base::Process process_;\n  bool process_terminated_;\n\n private:\n  friend class base::RefCountedThreadSafe<ChromeStarter>;\n\n  ~ChromeStarter() {}\n\n  base::TimeDelta timeout_;\n  base::FilePath user_data_dir_;\n\n  DISALLOW_COPY_AND_ASSIGN(ChromeStarter);\n};\n\n}  \/\/ namespace\n\n\/\/ Our test fixture that initializes and holds onto a few global vars.\nclass ProcessSingletonTest : public InProcessBrowserTest {\n public:\n  ProcessSingletonTest()\n      \/\/ We use a manual reset so that all threads wake up at once when signaled\n      \/\/ and thus we must manually reset it for each attempt.\n      : threads_waker_(true \/* manual *\/, false \/* signaled *\/) {\n    EXPECT_TRUE(temp_profile_dir_.CreateUniqueTempDir());\n  }\n\n  void SetUp() override {\n    InProcessBrowserTest::SetUp();\n    \/\/ Start the threads and create the starters.\n    for (size_t i = 0; i < kNbThreads; ++i) {\n      chrome_starter_threads_[i].reset(new base::Thread(\"ChromeStarter\"));\n      ASSERT_TRUE(chrome_starter_threads_[i]->Start());\n      chrome_starters_[i] = new ChromeStarter(\n          TestTimeouts::action_max_timeout(), temp_profile_dir_.path());\n    }\n  }\n\n  void TearDown() override {\n    \/\/ Stop the threads.\n    for (size_t i = 0; i < kNbThreads; ++i)\n      chrome_starter_threads_[i]->Stop();\n  }\n\n  \/\/ This method is used to make sure we kill the main browser process after\n  \/\/ all of its child processes have successfully attached to it. This was added\n  \/\/ when we realized that if we just kill the parent process right away, we\n  \/\/ sometimes end up with dangling child processes. If we Sleep for a certain\n  \/\/ amount of time, we are OK... So we introduced this method to avoid a\n  \/\/ flaky wait. Instead, we kill all descendants of the main process after we\n  \/\/ killed it, relying on the fact that we can still get the parent id of a\n  \/\/ child process, even when the parent dies.\n  void KillProcessTree(const base::Process& process) {\n    class ProcessTreeFilter : public base::ProcessFilter {\n     public:\n      explicit ProcessTreeFilter(base::ProcessId parent_pid) {\n        ancestor_pids_.insert(parent_pid);\n      }\n      bool Includes(const base::ProcessEntry& entry) const override {\n        if (ancestor_pids_.find(entry.parent_pid()) != ancestor_pids_.end()) {\n          ancestor_pids_.insert(entry.pid());\n          return true;\n        } else {\n          return false;\n        }\n      }\n     private:\n      mutable std::set<base::ProcessId> ancestor_pids_;\n    } process_tree_filter(process.Pid());\n\n    \/\/ Start by explicitly killing the main process we know about...\n    static const int kExitCode = 42;\n    EXPECT_TRUE(process.Terminate(kExitCode, true \/* wait *\/));\n\n    \/\/ Then loop until we can't find any of its descendant.\n    \/\/ But don't try more than kNbTries times...\n    static const int kNbTries = 10;\n    int num_tries = 0;\n    base::FilePath program;\n    ASSERT_TRUE(PathService::Get(base::FILE_EXE, &program));\n    base::FilePath::StringType exe_name = program.BaseName().value();\n    while (base::GetProcessCount(exe_name, &process_tree_filter) > 0 &&\n           num_tries++ < kNbTries) {\n      base::KillProcesses(exe_name, kExitCode, &process_tree_filter);\n    }\n    DLOG_IF(ERROR, num_tries >= kNbTries) << \"Failed to kill all processes!\";\n  }\n\n  \/\/ Since this is a hard to reproduce problem, we make a few attempts.\n  \/\/ We stop the attempts at the first error, and when there are no errors,\n  \/\/ we don't time-out of any wait, so it executes quite fast anyway.\n  static const size_t kNbAttempts = 5;\n\n  \/\/ The idea is to start chrome from multiple threads all at once.\n  static const size_t kNbThreads = 5;\n  scoped_refptr<ChromeStarter> chrome_starters_[kNbThreads];\n  scoped_ptr<base::Thread> chrome_starter_threads_[kNbThreads];\n\n  \/\/ The event that will get all threads to wake up simultaneously and try\n  \/\/ to start a chrome process at the same time.\n  base::WaitableEvent threads_waker_;\n\n  \/\/ We don't want to use the default profile, but can't use UITest's since we\n  \/\/ don't use UITest::LaunchBrowser.\n  base::ScopedTempDir temp_profile_dir_;\n};\n\n\/\/ Disabled on all platforms after code rot due to http:\/\/crbug.com\/513534.\n\/\/ Originally disabled on some platforms due to http:\/\/crbug.com\/58219.\nIN_PROC_BROWSER_TEST_F(ProcessSingletonTest, DISABLED_StartupRaceCondition) {\n  \/\/ We use this to stop the attempts loop on the first failure.\n  bool failed = false;\n  for (size_t attempt = 0; attempt < kNbAttempts && !failed; ++attempt) {\n    SCOPED_TRACE(testing::Message() << \"Attempt: \" << attempt << \".\");\n    \/\/ We use a single event to get all threads to do the AppLaunch at the same\n    \/\/ time...\n    threads_waker_.Reset();\n\n    \/\/ Test both with and without the first-run dialog, since they exercise\n    \/\/ different paths.\n#if defined(OS_POSIX)\n    \/\/ TODO(mattm): test first run dialog singleton handling on linux too.\n    \/\/ On posix if we test the first run dialog, GracefulShutdownHandler gets\n    \/\/ the TERM signal, but since the message loop isn't running during the gtk\n    \/\/ first run dialog, the ShutdownDetector never handles it, and KillProcess\n    \/\/ has to time out (60 sec!) and SIGKILL.\n    bool first_run = false;\n#else\n    \/\/ Test for races in both regular start up and first run start up cases.\n    bool first_run = attempt % 2;\n#endif\n\n    \/\/ Here we prime all the threads with a ChromeStarter that will wait for\n    \/\/ our signal to launch its chrome process.\n    for (size_t i = 0; i < kNbThreads; ++i) {\n      ASSERT_NE(static_cast<ChromeStarter*>(NULL), chrome_starters_[i].get());\n      chrome_starters_[i]->Reset();\n\n      ASSERT_TRUE(chrome_starter_threads_[i]->IsRunning());\n      ASSERT_NE(static_cast<base::MessageLoop*>(NULL),\n                chrome_starter_threads_[i]->message_loop());\n\n      chrome_starter_threads_[i]->task_runner()->PostTask(\n          FROM_HERE,\n          base::Bind(&ChromeStarter::StartChrome, chrome_starters_[i].get(),\n                     &threads_waker_, first_run));\n    }\n\n    \/\/ Wait for all the starters to be ready.\n    \/\/ We could replace this loop if we ever implement a WaitAll().\n    for (size_t i = 0; i < kNbThreads; ++i) {\n      SCOPED_TRACE(testing::Message() << \"Waiting on thread: \" << i << \".\");\n      chrome_starters_[i]->ready_event_.Wait();\n    }\n    \/\/ GO!\n    threads_waker_.Signal();\n\n    \/\/ As we wait for all threads to signal that they are done, we remove their\n    \/\/ index from this vector so that we get left with only the index of\n    \/\/ the thread that started the main process.\n    std::vector<size_t> pending_starters(kNbThreads);\n    for (size_t i = 0; i < kNbThreads; ++i)\n      pending_starters[i] = i;\n\n    \/\/ We use a local array of starter's done events we must wait on...\n    \/\/ These are collected from the starters that we have not yet been removed\n    \/\/ from the pending_starters vector.\n    base::WaitableEvent* starters_done_events[kNbThreads];\n    \/\/ At the end, \"There can be only one\" main browser process alive.\n    while (pending_starters.size() > 1) {\n      SCOPED_TRACE(testing::Message() << pending_starters.size() <<\n                   \" starters left.\");\n      for (size_t i = 0; i < pending_starters.size(); ++i) {\n        starters_done_events[i] =\n            &chrome_starters_[pending_starters[i]]->done_event_;\n      }\n      size_t done_index = base::WaitableEvent::WaitMany(\n          starters_done_events, pending_starters.size());\n      size_t starter_index = pending_starters[done_index];\n      \/\/ If the starter is done but has not marked itself as terminated,\n      \/\/ it is because it timed out of its WaitForExitCodeWithTimeout(). Only\n      \/\/ the last one standing should be left waiting... So we failed...\n      EXPECT_TRUE(chrome_starters_[starter_index]->process_terminated_ ||\n                  failed) << \"There is more than one main process.\";\n      if (!chrome_starters_[starter_index]->process_terminated_) {\n        \/\/ This will stop the \"for kNbAttempts\" loop.\n        failed = true;\n        \/\/ But we let the last loop turn finish so that we can properly\n        \/\/ kill all remaining processes. Starting with this one...\n        if (chrome_starters_[starter_index]->process_.IsValid()) {\n          KillProcessTree(chrome_starters_[starter_index]->process_);\n        }\n      }\n      pending_starters.erase(pending_starters.begin() + done_index);\n    }\n\n    \/\/ \"There can be only one!\" :-)\n    ASSERT_EQ(static_cast<size_t>(1), pending_starters.size());\n    size_t last_index = pending_starters.front();\n    pending_starters.clear();\n    if (chrome_starters_[last_index]->process_.IsValid()) {\n      KillProcessTree(chrome_starters_[last_index]->process_);\n      chrome_starters_[last_index]->done_event_.Wait();\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n  Copyright (C) 2008-2017 The Communi Project\n\n  You may use this file under the terms of BSD license as follows:\n\n  Redistribution and use in source and binary forms, with or without\n  modification, are permitted provided that the following conditions are met:\n    * Redistributions of source code must retain the above copyright\n      notice, this list of conditions and the following disclaimer.\n    * Redistributions in binary form must reproduce the above copyright\n      notice, this list of conditions and the following disclaimer in the\n      documentation and\/or other materials provided with the distribution.\n    * Neither the name of the copyright holder nor the 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 \"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 HOLDERS OR CONTRIBUTORS BE LIABLE FOR\n  ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*\/\n\n#include \"loggerplugin.h\"\n#include <IrcConnection>\n#include <IrcNetwork>\n#include <IrcMessage>\n#include <IrcCommand>\n#include <IrcChannel>\n#include <IrcConnection>\n#include <IrcBufferModel>\n#include <Irc>\n#include <QDir>\n#include <QTextStream>\n#include <QSettings>\n#include <QDebug>\n\nLoggerPlugin::LoggerPlugin(QObject* parent) : QObject(parent)\n    , m_connections(0)\n{\n    this->settingsChanged();\n}\n\nLoggerPlugin::~LoggerPlugin()\n{\n    \/\/ Iterate over all log items and close all open files, etc.\n    foreach (IrcBuffer *buf, this->m_logitems.keys()) {\n        this->removeLogitemForBuffer(buf);\n    }\n}\n\nvoid LoggerPlugin::setConnectionsList(const QList<IrcConnection*>* list)\n{\n    if (list != this->m_connections) {\n        pluginDisabled();\n        this->m_connections = list;\n        pluginEnabled();\n    }\n}\n\nvoid LoggerPlugin::pluginEnabled()\n{\n    if (!this->m_connections)\n        return;\n\n    foreach (IrcConnection* conn, *(this->m_connections)) {\n        IrcBufferModel* model = conn->findChild<IrcBufferModel*>();\n        foreach (IrcBuffer* buf, model->buffers()) {\n            this->bufferAdded(buf);\n        }\n    }\n}\n\nvoid LoggerPlugin::pluginDisabled()\n{\n    foreach (IrcBuffer *buf, this->m_logitems.keys()) {\n        this->bufferRemoved(buf);\n    }\n}\n\nvoid LoggerPlugin::bufferAdded(IrcBuffer* buffer)\n{\n    \/\/ Do not log connection buffers and #magna\n    if (buffer->network()->name().isEmpty())\n        return;\n\n    \/\/ Don't add buffer if already added\n    if (this->m_logitems.contains(buffer))\n        return;\n\n    connect(buffer, SIGNAL(messageReceived(IrcMessage*)), this, SLOT(logMessage(IrcMessage*)));\n    connect(buffer, SIGNAL(destroyed()), this, SLOT(onBufferDestroyed()));\n\n    const QString filename = logfileName(buffer);\n    Item item;\n    item.logfile = new QFile(m_logDirPath + \"\/\" + filename, this);\n    item.logfile->open(QIODevice::WriteOnly | QIODevice::Append | QIODevice::Text);\n    item.textStream = new QTextStream(item.logfile);\n\n    this->m_logitems.insert(buffer, item);\n    writeToFile(buffer, \"=== Logfile started on \" + timestamp() + \" ===\");\n}\n\nvoid LoggerPlugin::bufferRemoved(IrcBuffer* buffer)\n{\n    disconnect(buffer, SIGNAL(messageReceived(IrcMessage*)), this, SLOT(logMessage(IrcMessage*)));\n    disconnect(buffer, SIGNAL(destroyed()), this, SLOT(onBufferDestroyed()));\n\n    removeLogitemForBuffer(buffer);\n}\n\nvoid LoggerPlugin::removeLogitemForBuffer(IrcBuffer *buffer) {\n    if (this->m_logitems.contains(buffer)) {\n        Item item = this->m_logitems.take(buffer);\n\n        item.textStream->flush();\n        delete item.textStream;\n\n        item.logfile->close();\n        delete item.logfile;\n    }\n}\n\nvoid LoggerPlugin::settingsChanged()\n{\n    QSettings settings;\n    QString loggingLocation = settings.value(\"loggingLocation\").toString();\n\n    if (m_logDirPath != loggingLocation) {\n        pluginDisabled();\n\n        m_logDirPath = loggingLocation;\n        QDir logDir;\n        if (!logDir.exists(m_logDirPath))\n            logDir.mkpath(m_logDirPath);\n\n        pluginEnabled();\n    }\n}\n\nvoid LoggerPlugin::logMessage(IrcMessage *message)\n{\n    if (message->type() != IrcMessage::Private)\n        return;\n\n    IrcBuffer *buffer = qobject_cast<IrcBuffer*>(QObject::sender());\n\n    if (buffer) {\n        IrcPrivateMessage *m = static_cast<IrcPrivateMessage*>(message);\n        writeToFile(buffer, timestamp() + \" \" + m->nick() + \": \" + m->content());\n    }\n}\n\nvoid LoggerPlugin::writeToFile(IrcBuffer* buffer, const QString &text)\n{\n    Item item = this->m_logitems[buffer];\n    *(item.textStream) << text << endl;\n}\n\nQString LoggerPlugin::logfileName(IrcBuffer *buffer) const\n{\n    return buffer->network()->name() + \"_\" + buffer->title() + \".log\";\n}\n\nQString LoggerPlugin::timestamp() const\n{\n    return QDateTime::currentDateTime().toString(\"[yyyy-MM-dd] hh:mm:ss\");\n}\n<commit_msg>Remove leftover references to onBufferDestroyed<commit_after>\/*\n  Copyright (C) 2008-2017 The Communi Project\n\n  You may use this file under the terms of BSD license as follows:\n\n  Redistribution and use in source and binary forms, with or without\n  modification, are permitted provided that the following conditions are met:\n    * Redistributions of source code must retain the above copyright\n      notice, this list of conditions and the following disclaimer.\n    * Redistributions in binary form must reproduce the above copyright\n      notice, this list of conditions and the following disclaimer in the\n      documentation and\/or other materials provided with the distribution.\n    * Neither the name of the copyright holder nor the 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 \"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 HOLDERS OR CONTRIBUTORS BE LIABLE FOR\n  ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*\/\n\n#include \"loggerplugin.h\"\n#include <IrcConnection>\n#include <IrcNetwork>\n#include <IrcMessage>\n#include <IrcCommand>\n#include <IrcChannel>\n#include <IrcConnection>\n#include <IrcBufferModel>\n#include <Irc>\n#include <QDir>\n#include <QTextStream>\n#include <QSettings>\n#include <QDebug>\n\nLoggerPlugin::LoggerPlugin(QObject* parent) : QObject(parent)\n    , m_connections(0)\n{\n    this->settingsChanged();\n}\n\nLoggerPlugin::~LoggerPlugin()\n{\n    \/\/ Iterate over all log items and close all open files, etc.\n    foreach (IrcBuffer *buf, this->m_logitems.keys()) {\n        this->removeLogitemForBuffer(buf);\n    }\n}\n\nvoid LoggerPlugin::setConnectionsList(const QList<IrcConnection*>* list)\n{\n    if (list != this->m_connections) {\n        pluginDisabled();\n        this->m_connections = list;\n        pluginEnabled();\n    }\n}\n\nvoid LoggerPlugin::pluginEnabled()\n{\n    if (!this->m_connections)\n        return;\n\n    foreach (IrcConnection* conn, *(this->m_connections)) {\n        IrcBufferModel* model = conn->findChild<IrcBufferModel*>();\n        foreach (IrcBuffer* buf, model->buffers()) {\n            this->bufferAdded(buf);\n        }\n    }\n}\n\nvoid LoggerPlugin::pluginDisabled()\n{\n    foreach (IrcBuffer *buf, this->m_logitems.keys()) {\n        this->bufferRemoved(buf);\n    }\n}\n\nvoid LoggerPlugin::bufferAdded(IrcBuffer* buffer)\n{\n    \/\/ Do not log connection buffers and #magna\n    if (buffer->network()->name().isEmpty())\n        return;\n\n    \/\/ Don't add buffer if already added\n    if (this->m_logitems.contains(buffer))\n        return;\n\n    connect(buffer, SIGNAL(messageReceived(IrcMessage*)), this, SLOT(logMessage(IrcMessage*)));\n\n    const QString filename = logfileName(buffer);\n    Item item;\n    item.logfile = new QFile(m_logDirPath + \"\/\" + filename, this);\n    item.logfile->open(QIODevice::WriteOnly | QIODevice::Append | QIODevice::Text);\n    item.textStream = new QTextStream(item.logfile);\n\n    this->m_logitems.insert(buffer, item);\n    writeToFile(buffer, \"=== Logfile started on \" + timestamp() + \" ===\");\n}\n\nvoid LoggerPlugin::bufferRemoved(IrcBuffer* buffer)\n{\n    disconnect(buffer, SIGNAL(messageReceived(IrcMessage*)), this, SLOT(logMessage(IrcMessage*)));\n\n    removeLogitemForBuffer(buffer);\n}\n\nvoid LoggerPlugin::removeLogitemForBuffer(IrcBuffer *buffer) {\n    if (this->m_logitems.contains(buffer)) {\n        Item item = this->m_logitems.take(buffer);\n\n        item.textStream->flush();\n        delete item.textStream;\n\n        item.logfile->close();\n        delete item.logfile;\n    }\n}\n\nvoid LoggerPlugin::settingsChanged()\n{\n    QSettings settings;\n    QString loggingLocation = settings.value(\"loggingLocation\").toString();\n\n    if (m_logDirPath != loggingLocation) {\n        pluginDisabled();\n\n        m_logDirPath = loggingLocation;\n        QDir logDir;\n        if (!logDir.exists(m_logDirPath))\n            logDir.mkpath(m_logDirPath);\n\n        pluginEnabled();\n    }\n}\n\nvoid LoggerPlugin::logMessage(IrcMessage *message)\n{\n    if (message->type() != IrcMessage::Private)\n        return;\n\n    IrcBuffer *buffer = qobject_cast<IrcBuffer*>(QObject::sender());\n\n    if (buffer) {\n        IrcPrivateMessage *m = static_cast<IrcPrivateMessage*>(message);\n        writeToFile(buffer, timestamp() + \" \" + m->nick() + \": \" + m->content());\n    }\n}\n\nvoid LoggerPlugin::writeToFile(IrcBuffer* buffer, const QString &text)\n{\n    Item item = this->m_logitems[buffer];\n    *(item.textStream) << text << endl;\n}\n\nQString LoggerPlugin::logfileName(IrcBuffer *buffer) const\n{\n    return buffer->network()->name() + \"_\" + buffer->title() + \".log\";\n}\n\nQString LoggerPlugin::timestamp() const\n{\n    return QDateTime::currentDateTime().toString(\"[yyyy-MM-dd] hh:mm:ss\");\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\/ui\/webui\/options\/core_options_handler.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n#include \"content\/browser\/webui\/web_ui_browsertest.h\"\n#include \"googleurl\/src\/gurl.h\"\n#include \"testing\/gmock\/include\/gmock\/gmock.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nusing ::testing::StrictMock;\nusing ::testing::_;\n\nMATCHER_P(Eq_ListValue, inList, \"\") {\n  return arg->Equals(inList);\n}\n\nclass MockCoreOptionsHandler : public CoreOptionsHandler {\n public:\n  MOCK_METHOD1(HandleInitialize,\n      void(const ListValue* args));\n  MOCK_METHOD1(HandleFetchPrefs,\n      void(const ListValue* args));\n  MOCK_METHOD1(HandleObservePrefs,\n      void(const ListValue* args));\n  MOCK_METHOD1(HandleSetBooleanPref,\n      void(const ListValue* args));\n  MOCK_METHOD1(HandleSetIntegerPref,\n      void(const ListValue* args));\n  MOCK_METHOD1(HandleSetDoublePref,\n      void(const ListValue* args));\n  MOCK_METHOD1(HandleSetStringPref,\n      void(const ListValue* args));\n  MOCK_METHOD1(HandleSetObjectPref,\n      void(const ListValue* args));\n  MOCK_METHOD1(HandleClearPref,\n      void(const ListValue* args));\n  MOCK_METHOD1(HandleUserMetricsAction,\n      void(const ListValue* args));\n\n  virtual void RegisterMessages() {\n    web_ui_->RegisterMessageCallback(\"coreOptionsInitialize\",\n        NewCallback(this, &MockCoreOptionsHandler ::HandleInitialize));\n    web_ui_->RegisterMessageCallback(\"fetchPrefs\",\n        NewCallback(this, &MockCoreOptionsHandler ::HandleFetchPrefs));\n    web_ui_->RegisterMessageCallback(\"observePrefs\",\n        NewCallback(this, &MockCoreOptionsHandler ::HandleObservePrefs));\n    web_ui_->RegisterMessageCallback(\"setBooleanPref\",\n        NewCallback(this, &MockCoreOptionsHandler ::HandleSetBooleanPref));\n    web_ui_->RegisterMessageCallback(\"setIntegerPref\",\n        NewCallback(this, &MockCoreOptionsHandler ::HandleSetIntegerPref));\n    web_ui_->RegisterMessageCallback(\"setDoublePref\",\n        NewCallback(this, &MockCoreOptionsHandler ::HandleSetDoublePref));\n    web_ui_->RegisterMessageCallback(\"setStringPref\",\n        NewCallback(this, &MockCoreOptionsHandler ::HandleSetStringPref));\n    web_ui_->RegisterMessageCallback(\"setObjectPref\",\n        NewCallback(this, &MockCoreOptionsHandler ::HandleSetObjectPref));\n    web_ui_->RegisterMessageCallback(\"clearPref\",\n        NewCallback(this, &MockCoreOptionsHandler ::HandleClearPref));\n    web_ui_->RegisterMessageCallback(\"coreOptionsUserMetricsAction\",\n        NewCallback(this, &MockCoreOptionsHandler ::HandleUserMetricsAction));\n  }\n};\n\nclass SettingsWebUITest : public WebUIBrowserTest {\n protected:\n  virtual void SetUpInProcessBrowserTestFixture() {\n    WebUIBrowserTest::SetUpInProcessBrowserTestFixture();\n    AddLibrary(FILE_PATH_LITERAL(\"settings.js\"));\n  }\n\n  virtual void SetUpOnMainThread() {\n    mock_core_options_handler_.reset(new StrictMock<MockCoreOptionsHandler>());\n  }\n\n  virtual void CleanUpOnMainThread() {\n    mock_core_options_handler_.reset();\n  }\n\n  virtual WebUIMessageHandler* GetMockMessageHandler() {\n    return mock_core_options_handler_.get();\n  }\n\n  scoped_ptr<StrictMock<MockCoreOptionsHandler> > mock_core_options_handler_;\n};\n\n\/\/ Test the end to end js to WebUI handler code path for\n\/\/ the message setBooleanPref.\n\/\/ TODO(dtseng): add more EXPECT_CALL's when updating js test.\n\n\/\/ Crashes on Mac only. See http:\/\/crbug.com\/79181\n#if defined(OS_MACOSX)\n#define MAYBE_TestSetBooleanPrefTriggers DISABLED_TestSetBooleanPrefTriggers\n#else\n#define MAYBE_TestSetBooleanPrefTriggers TestSetBooleanPrefTriggers\n#endif\nIN_PROC_BROWSER_TEST_F(SettingsWebUITest, MAYBE_TestSetBooleanPrefTriggers) {\n  \/\/ This serves as an example of a very constrained test.\n  ListValue true_list_value;\n  true_list_value.Append(Value::CreateStringValue(\"browser.show_home_button\"));\n  true_list_value.Append(Value::CreateBooleanValue(true));\n  true_list_value.Append(\n      Value::CreateStringValue(\"Options_Homepage_HomeButton\"));\n  ui_test_utils::NavigateToURL(browser(), GURL(chrome::kChromeUISettingsURL));\n  EXPECT_CALL(*mock_core_options_handler_,\n      HandleSetBooleanPref(Eq_ListValue(&true_list_value)));\n  ASSERT_TRUE(RunJavascriptTest(\"testSetBooleanPrefTriggers\"));\n}\n\n\/\/ Not meant to run on ChromeOS at this time.\n#if defined(OS_CHROMEOS) || OS_MACOSX\n#define MAYBE_TestRefreshStaysOnCurrentPage\\\n    DISABLED_TestRefreshStaysOnCurrentPage\n#else\n#define MAYBE_TestRefreshStaysOnCurrentPage TestRefreshStaysOnCurrentPage\n#endif\nIN_PROC_BROWSER_TEST_F(SettingsWebUITest,\n                       MAYBE_TestRefreshStaysOnCurrentPage) {\n  ui_test_utils::NavigateToURL(browser(), GURL(chrome::kChromeUISettingsURL));\n  ASSERT_TRUE(RunJavascriptFunction(\"openUnderTheHood\"));\n  ASSERT_TRUE(RunJavascriptFunction(\"refreshPage\"));\n  ASSERT_TRUE(RunJavascriptTest(\"testPageIsUnderTheHood\"));\n}\n<commit_msg>Fix disabling to test on OSX.<commit_after>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/ui\/webui\/options\/core_options_handler.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n#include \"content\/browser\/webui\/web_ui_browsertest.h\"\n#include \"googleurl\/src\/gurl.h\"\n#include \"testing\/gmock\/include\/gmock\/gmock.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nusing ::testing::StrictMock;\nusing ::testing::_;\n\nMATCHER_P(Eq_ListValue, inList, \"\") {\n  return arg->Equals(inList);\n}\n\nclass MockCoreOptionsHandler : public CoreOptionsHandler {\n public:\n  MOCK_METHOD1(HandleInitialize,\n      void(const ListValue* args));\n  MOCK_METHOD1(HandleFetchPrefs,\n      void(const ListValue* args));\n  MOCK_METHOD1(HandleObservePrefs,\n      void(const ListValue* args));\n  MOCK_METHOD1(HandleSetBooleanPref,\n      void(const ListValue* args));\n  MOCK_METHOD1(HandleSetIntegerPref,\n      void(const ListValue* args));\n  MOCK_METHOD1(HandleSetDoublePref,\n      void(const ListValue* args));\n  MOCK_METHOD1(HandleSetStringPref,\n      void(const ListValue* args));\n  MOCK_METHOD1(HandleSetObjectPref,\n      void(const ListValue* args));\n  MOCK_METHOD1(HandleClearPref,\n      void(const ListValue* args));\n  MOCK_METHOD1(HandleUserMetricsAction,\n      void(const ListValue* args));\n\n  virtual void RegisterMessages() {\n    web_ui_->RegisterMessageCallback(\"coreOptionsInitialize\",\n        NewCallback(this, &MockCoreOptionsHandler ::HandleInitialize));\n    web_ui_->RegisterMessageCallback(\"fetchPrefs\",\n        NewCallback(this, &MockCoreOptionsHandler ::HandleFetchPrefs));\n    web_ui_->RegisterMessageCallback(\"observePrefs\",\n        NewCallback(this, &MockCoreOptionsHandler ::HandleObservePrefs));\n    web_ui_->RegisterMessageCallback(\"setBooleanPref\",\n        NewCallback(this, &MockCoreOptionsHandler ::HandleSetBooleanPref));\n    web_ui_->RegisterMessageCallback(\"setIntegerPref\",\n        NewCallback(this, &MockCoreOptionsHandler ::HandleSetIntegerPref));\n    web_ui_->RegisterMessageCallback(\"setDoublePref\",\n        NewCallback(this, &MockCoreOptionsHandler ::HandleSetDoublePref));\n    web_ui_->RegisterMessageCallback(\"setStringPref\",\n        NewCallback(this, &MockCoreOptionsHandler ::HandleSetStringPref));\n    web_ui_->RegisterMessageCallback(\"setObjectPref\",\n        NewCallback(this, &MockCoreOptionsHandler ::HandleSetObjectPref));\n    web_ui_->RegisterMessageCallback(\"clearPref\",\n        NewCallback(this, &MockCoreOptionsHandler ::HandleClearPref));\n    web_ui_->RegisterMessageCallback(\"coreOptionsUserMetricsAction\",\n        NewCallback(this, &MockCoreOptionsHandler ::HandleUserMetricsAction));\n  }\n};\n\nclass SettingsWebUITest : public WebUIBrowserTest {\n protected:\n  virtual void SetUpInProcessBrowserTestFixture() {\n    WebUIBrowserTest::SetUpInProcessBrowserTestFixture();\n    AddLibrary(FILE_PATH_LITERAL(\"settings.js\"));\n  }\n\n  virtual void SetUpOnMainThread() {\n    mock_core_options_handler_.reset(new StrictMock<MockCoreOptionsHandler>());\n  }\n\n  virtual void CleanUpOnMainThread() {\n    mock_core_options_handler_.reset();\n  }\n\n  virtual WebUIMessageHandler* GetMockMessageHandler() {\n    return mock_core_options_handler_.get();\n  }\n\n  scoped_ptr<StrictMock<MockCoreOptionsHandler> > mock_core_options_handler_;\n};\n\n\/\/ Test the end to end js to WebUI handler code path for\n\/\/ the message setBooleanPref.\n\/\/ TODO(dtseng): add more EXPECT_CALL's when updating js test.\n\n\/\/ Crashes on Mac only. See http:\/\/crbug.com\/79181\n#if defined(OS_MACOSX)\n#define MAYBE_TestSetBooleanPrefTriggers DISABLED_TestSetBooleanPrefTriggers\n#else\n#define MAYBE_TestSetBooleanPrefTriggers TestSetBooleanPrefTriggers\n#endif\nIN_PROC_BROWSER_TEST_F(SettingsWebUITest, MAYBE_TestSetBooleanPrefTriggers) {\n  \/\/ This serves as an example of a very constrained test.\n  ListValue true_list_value;\n  true_list_value.Append(Value::CreateStringValue(\"browser.show_home_button\"));\n  true_list_value.Append(Value::CreateBooleanValue(true));\n  true_list_value.Append(\n      Value::CreateStringValue(\"Options_Homepage_HomeButton\"));\n  ui_test_utils::NavigateToURL(browser(), GURL(chrome::kChromeUISettingsURL));\n  EXPECT_CALL(*mock_core_options_handler_,\n      HandleSetBooleanPref(Eq_ListValue(&true_list_value)));\n  ASSERT_TRUE(RunJavascriptTest(\"testSetBooleanPrefTriggers\"));\n}\n\n\/\/ Not meant to run on ChromeOS at this time.\n#if defined(OS_CHROMEOS) || defined(OS_MACOSX)\n#define MAYBE_TestRefreshStaysOnCurrentPage\\\n    DISABLED_TestRefreshStaysOnCurrentPage\n#else\n#define MAYBE_TestRefreshStaysOnCurrentPage TestRefreshStaysOnCurrentPage\n#endif\nIN_PROC_BROWSER_TEST_F(SettingsWebUITest,\n                       MAYBE_TestRefreshStaysOnCurrentPage) {\n  ui_test_utils::NavigateToURL(browser(), GURL(chrome::kChromeUISettingsURL));\n  ASSERT_TRUE(RunJavascriptFunction(\"openUnderTheHood\"));\n  ASSERT_TRUE(RunJavascriptFunction(\"refreshPage\"));\n  ASSERT_TRUE(RunJavascriptTest(\"testPageIsUnderTheHood\"));\n}\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n*       SOFA, Simulation Open-Framework Architecture, development version     *\n*                (c) 2006-2017 INRIA, USTL, UJF, CNRS, MGH                    *\n*                                                                             *\n* This program is free software; you can redistribute it and\/or modify it     *\n* under the terms of the GNU 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 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 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 program. If not, see <http:\/\/www.gnu.org\/licenses\/>.        *\n*******************************************************************************\n* Authors: The SOFA Team and external contributors (see Authors.txt)          *\n*                                                                             *\n* Contact information: contact@sofa-framework.org                             *\n******************************************************************************\/\n #include <gtest\/gtest.h>\n#include <exception>\n#include <algorithm>\n\n#include <vector>\nusing std::vector ;\n\n#include <fstream>\nusing std::ofstream ;\n\n#include <string>\nusing std::string ;\n\n#include <sofa\/helper\/system\/FileMonitor.h>\nusing sofa::helper::system::FileEventListener ;\nusing sofa::helper::system::FileMonitor ;\n\n#ifdef WIN32\n#include <windows.h>\n#endif\n\nstatic std::string getPath(std::string s) {\n    return std::string(FRAMEWORK_TEST_RESOURCES_DIR) + std::string(\"\/\") + s;\n}\n\nvoid createAFilledFile(const string filename, unsigned int rep, bool resetFileMonitor=true){\n    ofstream file1 ;\n    file1.open(filename.c_str(), ofstream::out) ;\n\n    \/\/throw_when(!file1.is_open()) ;\n\n    string sample = \"#include<TODOD> int main(int argc...){ ... }\\n}\" ;\n    for(unsigned int i=0;i<rep;i++){\n        file1.write(sample.c_str(), sample.size()) ;\n    }\n    file1.close();\n\n    \/\/ dirty fix to avoid interferences between successive tests using the same file\n    if (resetFileMonitor)\n        FileMonitor::updates();\n}\n\nvoid waitForFileEvents()\n{\n\t\/\/ on windows we use file date, which resoution is assumed (by us) to be below this value in ms\n#ifdef WIN32\n    Sleep(100);\n#endif\n#ifdef __APPLE__\n    sleep(1);\n#endif\n#ifdef __linux__\n  \/\/  sleep(1);\n#endif\n}\n\nclass MyFileListener : public FileEventListener\n{\npublic:\n    vector<string> m_files ;\n\n    virtual void fileHasChanged(const std::string& filename){\n        \/\/std::cout << \"FileHasChanged: \" << filename << std::endl ;\n        m_files.push_back(filename) ;\n    }\n};\n\nTEST(FileMonitor, addFileNotExist_test)\n{\n    MyFileListener listener ;\n\n    \/\/ Should refuse to add a file that does not exists\n     EXPECT_EQ( FileMonitor::addFile(getPath(\"nonexisting.txt\"), &listener), -1 ) ;\n\n     FileMonitor::removeListener(&listener) ;\n}\n\nTEST(FileMonitor, addFileNotExist2_test)\n{\n    MyFileListener listener ;\n\n    \/\/ Should refuse to add a file that does not exists\n     EXPECT_EQ( FileMonitor::addFile(getPath(\"\"),\"nonexisting.txt\", &listener), -1 ) ;\n\n     FileMonitor::removeListener(&listener) ;\n}\n\nTEST(FileMonitor, addFileExist_test)\n{\n    MyFileListener listener ;\n\n    \/\/ create the file\n    createAFilledFile(getPath(\"existing.txt\"), 1) ;\n\n    \/\/ Add an existing file.It should work.\n    EXPECT_EQ( FileMonitor::addFile(getPath(\"existing.txt\"), &listener), 1 ) ;\n\n    FileMonitor::removeListener(&listener) ;\n}\n\nTEST(FileMonitor, addFileTwice_test)\n{\n    MyFileListener listener ;\n\n    \/\/ create the file\n    createAFilledFile(getPath(\"existing.txt\"), 1) ;\n\n    \/\/ Add an existing file.It should work.\n    FileMonitor::addFile(getPath(\"existing.txt\"), &listener);\n\n    \/\/ Retry to add an existing file. It should fail.\n    EXPECT_EQ( FileMonitor::addFile(getPath(\"existing.txt\"), &listener), 1 ) ;\n\n    \/\/ change the file content..\n    createAFilledFile(getPath(\"existing.txt\"), 10) ;\n\n    waitForFileEvents();\n    FileMonitor::updates(2) ;\n\n    \/\/ The listener should be notified 1 times with the same event.\n    EXPECT_EQ( listener.m_files.size(), 1u) ;\n\n    FileMonitor::removeListener(&listener) ;\n}\n\nTEST(FileMonitor, noUpdate_test)\n{\n    MyFileListener listener ;\n\n    \/\/ create the file\n    createAFilledFile(getPath(\"existing.txt\"), 1) ;\n\n    \/\/ Add an existing file.It should work.\n    FileMonitor::addFile(getPath(\"existing.txt\"), &listener) ;\n    EXPECT_EQ( listener.m_files.size(), 0u) ;\n\n    FileMonitor::removeListener(&listener) ;\n}\n\nTEST(FileMonitor, updateNoChange_test)\n{\n    MyFileListener listener ;\n\n    \/\/ create the file\n    createAFilledFile(getPath(\"existing.txt\"), 1) ;\n\n    FileMonitor::addFile(getPath(\"existing.txt\"), &listener) ;\n    waitForFileEvents();\n    FileMonitor::updates(2) ;\n\n    EXPECT_EQ( listener.m_files.size(), 0u) ;\n\n    FileMonitor::removeListener(&listener) ;\n}\n\nTEST(FileMonitor, fileChange_test)\n{\n    MyFileListener listener ;\n\n    \/\/ create the file\n    createAFilledFile(getPath(\"existing.txt\"), 1) ;\n\n    FileMonitor::addFile(getPath(\"existing.txt\"), &listener) ;\n    \/\/waitForFileEvents();\n    \/\/FileMonitor::updates(2) ;\n\n    \/\/ change the file content..\n    createAFilledFile(getPath(\"existing.txt\"), 10,false) ;\n    waitForFileEvents();\n    FileMonitor::updates(2) ;\n    EXPECT_EQ( listener.m_files.size(), 1u) ;\n\n    FileMonitor::removeListener(&listener) ;\n}\n\nTEST(FileMonitor, fileChangeTwice_test)\n{\n    MyFileListener listener ;\n\n    \/\/ create the file\n    createAFilledFile(getPath(\"existing.txt\"), 1) ;\n\n    FileMonitor::addFile(getPath(\"existing.txt\"), &listener) ;\n    \/\/FileMonitor::updates(2) ;\n\n    \/\/ change the file content 2x to test if the events are coalesced.\n    listener.m_files.clear() ;\n    createAFilledFile(getPath(\"existing.txt\"), 100,false) ;\n    createAFilledFile(getPath(\"existing.txt\"), 200,false) ;\n\n    waitForFileEvents();\n    FileMonitor::updates(2) ;\n    EXPECT_EQ( listener.m_files.size(), 1u) ;\n\n    FileMonitor::removeListener(&listener) ;\n}\n\nTEST(FileMonitor, fileListenerRemoved_test)\n{\n    MyFileListener listener1 ;\n    MyFileListener listener2 ;\n\n    \/\/ create the file\n    createAFilledFile(getPath(\"existing.txt\"), 1) ;\n\n    FileMonitor::addFile(getPath(\"existing.txt\"), &listener1) ;\n    FileMonitor::addFile(getPath(\"existing.txt\"), &listener2) ;\n    \/\/FileMonitor::updates(2) ;\n\n    \/\/ change the file content 2x to test if the events are coalesced.\n    listener1.m_files.clear() ;\n    listener2.m_files.clear() ;\n    createAFilledFile(getPath(\"existing.txt\"), 200, false) ;\n\n    FileMonitor::removeFileListener(getPath(\"existing.txt\"), &listener1) ;\n\n    waitForFileEvents();\n    FileMonitor::updates(2) ;\n    EXPECT_EQ( listener1.m_files.size(), 0u) ;\n    EXPECT_EQ( listener2.m_files.size(), 1u) ;\n\n    FileMonitor::removeListener(&listener1) ;\n    FileMonitor::removeListener(&listener2) ;\n}\n\nTEST(FileMonitor, listenerRemoved_test)\n{\n    MyFileListener listener1 ;\n    MyFileListener listener2 ;\n\n    \/\/ create the file\n    createAFilledFile(getPath(\"existing.txt\"), 1) ;\n\n    FileMonitor::addFile(getPath(\"existing.txt\"), &listener1) ;\n    FileMonitor::addFile(getPath(\"existing.txt\"), &listener2) ;\n    \/\/FileMonitor::updates(2) ;\n\n    \/\/ change the file content 2x to test if the events are coalesced.\n    listener1.m_files.clear() ;\n    listener2.m_files.clear() ;\n    createAFilledFile(getPath(\"existing.txt\"), 200,false) ;\n\n    FileMonitor::removeListener(&listener1) ;\n\n    waitForFileEvents();\n    FileMonitor::updates(2) ;\n    EXPECT_EQ( listener1.m_files.size(), 0u) ;\n    EXPECT_EQ( listener2.m_files.size(), 1u) ;\n\n    FileMonitor::removeListener(&listener1) ;\n    FileMonitor::removeListener(&listener2) ;\n}\n\nTEST(FileMonitor, fileChange2_test)\n{\n    MyFileListener listener ;\n\n    \/\/ create the file\n    createAFilledFile(getPath(\"existing.txt\"), 1) ;\n\n    FileMonitor::addFile(getPath(\"\"),\"existing.txt\", &listener) ;\n    \/\/waitForFileEvents();\n    \/\/FileMonitor::updates(2) ;\n\n    \/\/ change the file content..\n    createAFilledFile(getPath(\"existing.txt\"), 10,false) ;\n\n    waitForFileEvents();\n    FileMonitor::updates(2) ;\n    EXPECT_EQ( listener.m_files.size(), 1u) ;\n\n    FileMonitor::removeListener(&listener) ;\n}\n<commit_msg>fixing FileMonitor tests (on Windows)<commit_after>\/******************************************************************************\n*       SOFA, Simulation Open-Framework Architecture, development version     *\n*                (c) 2006-2017 INRIA, USTL, UJF, CNRS, MGH                    *\n*                                                                             *\n* This program is free software; you can redistribute it and\/or modify it     *\n* under the terms of the GNU 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 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 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 program. If not, see <http:\/\/www.gnu.org\/licenses\/>.        *\n*******************************************************************************\n* Authors: The SOFA Team and external contributors (see Authors.txt)          *\n*                                                                             *\n* Contact information: contact@sofa-framework.org                             *\n******************************************************************************\/\n #include <gtest\/gtest.h>\n#include <exception>\n#include <algorithm>\n\n#include <vector>\nusing std::vector ;\n\n#include <fstream>\nusing std::ofstream ;\n\n#include <string>\nusing std::string ;\n\n#include <sofa\/helper\/system\/FileMonitor.h>\nusing sofa::helper::system::FileEventListener ;\nusing sofa::helper::system::FileMonitor ;\n\n#ifdef WIN32\n#include <windows.h>\n#endif\n\nstatic std::string getPath(std::string s) {\n    return std::string(FRAMEWORK_TEST_RESOURCES_DIR) + std::string(\"\/\") + s;\n}\n\nvoid createAFilledFile(const string filename, unsigned int rep, bool resetFileMonitor=true){\n    ofstream file1 ;\n    file1.open(filename.c_str(), ofstream::out) ;\n\n    \/\/throw_when(!file1.is_open()) ;\n\n    string sample = \"#include<TODOD> int main(int argc...){ ... }\\n}\" ;\n    for(unsigned int i=0;i<rep;i++){\n        file1.write(sample.c_str(), sample.size()) ;\n    }\n    file1.close();\n\n    \/\/ dirty fix to avoid interferences between successive tests using the same file\n    if (resetFileMonitor)\n        FileMonitor::updates(1);\n}\n\nvoid waitForFileEvents()\n{\n\t\/\/ on windows we use file date, which resoution is assumed (by us) to be below this value in ms\n#ifdef WIN32\n    Sleep(100);\n#endif\n#ifdef __APPLE__\n    sleep(1);\n#endif\n#ifdef __linux__\n  \/\/  sleep(1);\n#endif\n}\n\nclass MyFileListener : public FileEventListener\n{\npublic:\n    vector<string> m_files ;\n\n    virtual void fileHasChanged(const std::string& filename){\n        \/\/std::cout << \"FileHasChanged: \" << filename << std::endl ;\n        m_files.push_back(filename) ;\n    }\n};\n\nTEST(FileMonitor, addFileNotExist_test)\n{\n    MyFileListener listener ;\n\n    \/\/ Should refuse to add a file that does not exists\n     EXPECT_EQ( FileMonitor::addFile(getPath(\"nonexisting.txt\"), &listener), -1 ) ;\n\n     FileMonitor::removeListener(&listener) ;\n}\n\nTEST(FileMonitor, addFileNotExist2_test)\n{\n    MyFileListener listener ;\n\n    \/\/ Should refuse to add a file that does not exists\n     EXPECT_EQ( FileMonitor::addFile(getPath(\"\"),\"nonexisting.txt\", &listener), -1 ) ;\n\n     FileMonitor::removeListener(&listener) ;\n}\n\nTEST(FileMonitor, addFileExist_test)\n{\n    MyFileListener listener ;\n\n    \/\/ create the file\n    createAFilledFile(getPath(\"existing.txt\"), 1) ;\n\n    \/\/ Add an existing file.It should work.\n    EXPECT_EQ( FileMonitor::addFile(getPath(\"existing.txt\"), &listener), 1 ) ;\n\n    FileMonitor::removeListener(&listener) ;\n}\n\nTEST(FileMonitor, addFileTwice_test)\n{\n    MyFileListener listener ;\n\n    \/\/ create the file\n    createAFilledFile(getPath(\"existing.txt\"), 1) ;\n\twaitForFileEvents();\n\n    \/\/ Add an existing file.It should work.\n    FileMonitor::addFile(getPath(\"existing.txt\"), &listener);\n\n    \/\/ Retry to add an existing file. It should fail.\n    EXPECT_EQ( FileMonitor::addFile(getPath(\"existing.txt\"), &listener), 1 ) ;\n\n    \/\/ change the file content..\n    createAFilledFile(getPath(\"existing.txt\"), 10) ;\n\n    waitForFileEvents();\n    FileMonitor::updates(2) ;\n\n    \/\/ The listener should be notified 1 times with the same event.\n    EXPECT_EQ( listener.m_files.size(), 1u) ;\n\n    FileMonitor::removeListener(&listener) ;\n}\n\nTEST(FileMonitor, noUpdate_test)\n{\n    MyFileListener listener ;\n\n    \/\/ create the file\n    createAFilledFile(getPath(\"existing.txt\"), 1) ;\n\n    \/\/ Add an existing file.It should work.\n    FileMonitor::addFile(getPath(\"existing.txt\"), &listener) ;\n    EXPECT_EQ( listener.m_files.size(), 0u) ;\n\n    FileMonitor::removeListener(&listener) ;\n}\n\nTEST(FileMonitor, updateNoChange_test)\n{\n    MyFileListener listener ;\n\n    \/\/ create the file\n    createAFilledFile(getPath(\"existing.txt\"), 1) ;\n\n    FileMonitor::addFile(getPath(\"existing.txt\"), &listener) ;\n    waitForFileEvents();\n    FileMonitor::updates(2) ;\n\n    EXPECT_EQ( listener.m_files.size(), 0u) ;\n\n    FileMonitor::removeListener(&listener) ;\n}\n\nTEST(FileMonitor, fileChange_test)\n{\n    MyFileListener listener ;\n\n    \/\/ create the file\n    createAFilledFile(getPath(\"existing.txt\"), 1) ;\n\twaitForFileEvents();\n\n    FileMonitor::addFile(getPath(\"existing.txt\"), &listener) ;\n    \/\/waitForFileEvents();\n    \/\/FileMonitor::updates(2) ;\n\n    \/\/ change the file content..\n    createAFilledFile(getPath(\"existing.txt\"), 10,false) ;\n    waitForFileEvents();\n    FileMonitor::updates(2) ;\n    EXPECT_EQ( listener.m_files.size(), 1u) ;\n\n    FileMonitor::removeListener(&listener) ;\n}\n\nTEST(FileMonitor, fileChangeTwice_test)\n{\n    MyFileListener listener ;\n\n    \/\/ create the file\n    createAFilledFile(getPath(\"existing.txt\"), 1) ;\n\twaitForFileEvents();\n\n    FileMonitor::addFile(getPath(\"existing.txt\"), &listener) ;\n    \/\/FileMonitor::updates(2) ;\n\n    \/\/ change the file content 2x to test if the events are coalesced.\n    listener.m_files.clear() ;\n    createAFilledFile(getPath(\"existing.txt\"), 100,false) ;\n    createAFilledFile(getPath(\"existing.txt\"), 200,false) ;\n\n    waitForFileEvents();\n    FileMonitor::updates(2) ;\n    EXPECT_EQ( listener.m_files.size(), 1u) ;\n\n    FileMonitor::removeListener(&listener) ;\n}\n\nTEST(FileMonitor, fileListenerRemoved_test)\n{\n    MyFileListener listener1 ;\n    MyFileListener listener2 ;\n\n    \/\/ create the file\n    createAFilledFile(getPath(\"existing.txt\"), 1) ;\n\twaitForFileEvents();\n\n    FileMonitor::addFile(getPath(\"existing.txt\"), &listener1) ;\n    FileMonitor::addFile(getPath(\"existing.txt\"), &listener2) ;\n    \/\/FileMonitor::updates(2) ;\n\n    \/\/ change the file content 2x to test if the events are coalesced.\n    listener1.m_files.clear() ;\n    listener2.m_files.clear() ;\n    createAFilledFile(getPath(\"existing.txt\"), 200, false) ;\n\n    FileMonitor::removeFileListener(getPath(\"existing.txt\"), &listener1) ;\n\n    waitForFileEvents();\n    FileMonitor::updates(2) ;\n    EXPECT_EQ( listener1.m_files.size(), 0u) ;\n    EXPECT_EQ( listener2.m_files.size(), 1u) ;\n\n    FileMonitor::removeListener(&listener1) ;\n    FileMonitor::removeListener(&listener2) ;\n}\n\nTEST(FileMonitor, listenerRemoved_test)\n{\n    MyFileListener listener1 ;\n    MyFileListener listener2 ;\n\n    \/\/ create the file\n    createAFilledFile(getPath(\"existing.txt\"), 1) ;\n\twaitForFileEvents();\n\n    FileMonitor::addFile(getPath(\"existing.txt\"), &listener1) ;\n    FileMonitor::addFile(getPath(\"existing.txt\"), &listener2) ;\n    \/\/FileMonitor::updates(2) ;\n\n    \/\/ change the file content 2x to test if the events are coalesced.\n    listener1.m_files.clear() ;\n    listener2.m_files.clear() ;\n    createAFilledFile(getPath(\"existing.txt\"), 200,false) ;\n\n    FileMonitor::removeListener(&listener1) ;\n\n    waitForFileEvents();\n    FileMonitor::updates(2) ;\n    EXPECT_EQ( listener1.m_files.size(), 0u) ;\n    EXPECT_EQ( listener2.m_files.size(), 1u) ;\n\n    FileMonitor::removeListener(&listener1) ;\n    FileMonitor::removeListener(&listener2) ;\n}\n\nTEST(FileMonitor, fileChange2_test)\n{\n    MyFileListener listener ;\n\n    \/\/ create the file\n    createAFilledFile(getPath(\"existing.txt\"), 1) ;\n\twaitForFileEvents();\n\n    FileMonitor::addFile(getPath(\"\"),\"existing.txt\", &listener) ;\n    \/\/waitForFileEvents();\n    \/\/FileMonitor::updates(2) ;\n\n    \/\/ change the file content..\n    createAFilledFile(getPath(\"existing.txt\"), 10,false) ;\n\n    waitForFileEvents();\n    FileMonitor::updates(2) ;\n    EXPECT_EQ( listener.m_files.size(), 1u) ;\n\n    FileMonitor::removeListener(&listener) ;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2012 The Chromium Embedded Framework Authors. All rights\n\/\/ reserved. Use of this source code is governed by a BSD-style license that\n\/\/ can be found in the LICENSE file.\n\n#include \"include\/wrapper\/cef_stream_resource_handler.h\"\n\n#include <algorithm>\n\n#include \"include\/base\/cef_bind.h\"\n#include \"include\/base\/cef_logging.h\"\n#include \"include\/base\/cef_macros.h\"\n#include \"include\/cef_callback.h\"\n#include \"include\/cef_request.h\"\n#include \"include\/cef_stream.h\"\n#include \"include\/wrapper\/cef_closure_task.h\"\n#include \"include\/wrapper\/cef_helpers.h\"\n\n\/\/ Class that represents a readable\/writable character buffer.\nclass CefStreamResourceHandler::Buffer {\n public:\n  Buffer()\n      : size_(0),\n        bytes_requested_(0),\n        bytes_written_(0),\n        bytes_read_(0) {\n  }\n\n  void Reset(int new_size) {\n    if (size_ < new_size) {\n      size_ = new_size;\n      buffer_.reset(new char[size_]);\n      DCHECK(buffer_);\n    }\n    bytes_requested_ = new_size;\n    bytes_written_ = 0;\n    bytes_read_ = 0;\n  }\n\n  bool IsEmpty() const {\n    return (bytes_written_ == 0);\n  }\n\n  bool CanRead() const {\n    return (bytes_read_ < bytes_written_);\n  }\n\n  int WriteTo(void* data_out, int bytes_to_read) {\n    const int write_size =\n        std::min(bytes_to_read, bytes_written_ - bytes_read_);\n    if (write_size > 0) {\n      memcpy(data_out, buffer_ .get() + bytes_read_, write_size);\n      bytes_read_ += write_size;\n    }\n    return write_size;\n  }\n\n  int ReadFrom(CefRefPtr<CefStreamReader> reader) {\n    \/\/ Read until the buffer is full or until Read() returns 0 to indicate no\n    \/\/ more data.\n    int bytes_read;\n    do {\n      bytes_read = static_cast<int>(\n          reader->Read(buffer_.get() + bytes_written_, 1,\n                       bytes_requested_ - bytes_written_));\n      bytes_written_ += bytes_read;\n    } while (bytes_read != 0 && bytes_written_ < bytes_requested_);\n\n    return bytes_written_;\n  }\n\n private:\n  scoped_ptr<char[]> buffer_;\n  int size_;\n  int bytes_requested_;\n  int bytes_written_;\n  int bytes_read_;\n\n  DISALLOW_COPY_AND_ASSIGN(Buffer);\n};\n\nCefStreamResourceHandler::CefStreamResourceHandler(\n    const CefString& mime_type,\n    CefRefPtr<CefStreamReader> stream)\n    : status_code_(200),\n      status_text_(\"OK\"),\n      mime_type_(mime_type),\n      stream_(stream)\n#ifndef NDEBUG\n      , buffer_owned_by_file_thread_(false)\n#endif\n{\n  DCHECK(!mime_type_.empty());\n  DCHECK(stream_.get());\n  read_on_file_thread_ = stream_->MayBlock();\n}\n\nCefStreamResourceHandler::CefStreamResourceHandler(\n    int status_code,\n    const CefString& status_text,\n    const CefString& mime_type,\n    CefResponse::HeaderMap header_map,\n    CefRefPtr<CefStreamReader> stream)\n    : status_code_(status_code),\n      status_text_(status_text),\n      mime_type_(mime_type),\n      header_map_(header_map),\n      stream_(stream) {\n  DCHECK(!mime_type_.empty());\n  DCHECK(stream_.get());\n  read_on_file_thread_ = stream_->MayBlock();\n}\n\nCefStreamResourceHandler::~CefStreamResourceHandler() {\n}\n\nbool CefStreamResourceHandler::ProcessRequest(CefRefPtr<CefRequest> request,\n                                              CefRefPtr<CefCallback> callback) {\n  callback->Continue();\n  return true;\n}\n\nvoid CefStreamResourceHandler::GetResponseHeaders(\n    CefRefPtr<CefResponse> response,\n    int64& response_length,\n    CefString& redirectUrl) {\n  response->SetStatus(status_code_);\n  response->SetStatusText(status_text_);\n  response->SetMimeType(mime_type_);\n\n  if (!header_map_.empty())\n    response->SetHeaderMap(header_map_);\n\n  response_length = -1;\n}\n\nbool CefStreamResourceHandler::ReadResponse(void* data_out,\n                                            int bytes_to_read,\n                                            int& bytes_read,\n                                            CefRefPtr<CefCallback> callback) {\n  DCHECK_GT(bytes_to_read, 0);\n\n  if (read_on_file_thread_) {\n#ifndef NDEBUG\n    DCHECK(!buffer_owned_by_file_thread_);\n#endif\n    if (buffer_ && (buffer_->CanRead() || buffer_->IsEmpty())) {\n      if (buffer_->CanRead()) {\n        \/\/ Provide data from the buffer.\n        bytes_read = buffer_->WriteTo(data_out, bytes_to_read);\n        return (bytes_read > 0);\n      } else {\n        \/\/ End of the steam.\n        bytes_read = 0;\n        return false;\n      }\n    } else {\n      \/\/ Perform another read on the file thread.\n      bytes_read = 0;\n#ifndef NDEBUG\n      buffer_owned_by_file_thread_ = true;\n#endif\n      CefPostTask(TID_FILE,\n          base::Bind(&CefStreamResourceHandler::ReadOnFileThread, this,\n                     bytes_to_read, callback));\n      return true;\n    }\n  } else {\n    \/\/ Read until the buffer is full or until Read() returns 0 to indicate no\n    \/\/ more data.\n    bytes_read = 0;\n    int read = 0;\n    do {\n      read = static_cast<int>(\n          stream_->Read(static_cast<char*>(data_out) + bytes_read, 1,\n                        bytes_to_read - bytes_read));\n      bytes_read += read;\n    } while (read != 0 && bytes_read < bytes_to_read);\n\n    return (bytes_read > 0);\n  }\n}\n\nvoid CefStreamResourceHandler::Cancel() {\n}\n\nvoid CefStreamResourceHandler::ReadOnFileThread(\n    int bytes_to_read,\n    CefRefPtr<CefCallback> callback) {\n  CEF_REQUIRE_FILE_THREAD();\n#ifndef NDEBUG\n  DCHECK(buffer_owned_by_file_thread_);\n#endif\n\n  if (!buffer_)\n    buffer_.reset(new Buffer());\n  buffer_->Reset(bytes_to_read);\n  buffer_->ReadFrom(stream_);\n\n#ifndef NDEBUG\n  buffer_owned_by_file_thread_ = false;\n#endif\n  callback->Continue();\n}\n<commit_msg>Add missing initializer to CefStreamResourceHandler constructor (issue #1187).<commit_after>\/\/ Copyright (c) 2012 The Chromium Embedded Framework Authors. All rights\n\/\/ reserved. Use of this source code is governed by a BSD-style license that\n\/\/ can be found in the LICENSE file.\n\n#include \"include\/wrapper\/cef_stream_resource_handler.h\"\n\n#include <algorithm>\n\n#include \"include\/base\/cef_bind.h\"\n#include \"include\/base\/cef_logging.h\"\n#include \"include\/base\/cef_macros.h\"\n#include \"include\/cef_callback.h\"\n#include \"include\/cef_request.h\"\n#include \"include\/cef_stream.h\"\n#include \"include\/wrapper\/cef_closure_task.h\"\n#include \"include\/wrapper\/cef_helpers.h\"\n\n\/\/ Class that represents a readable\/writable character buffer.\nclass CefStreamResourceHandler::Buffer {\n public:\n  Buffer()\n      : size_(0),\n        bytes_requested_(0),\n        bytes_written_(0),\n        bytes_read_(0) {\n  }\n\n  void Reset(int new_size) {\n    if (size_ < new_size) {\n      size_ = new_size;\n      buffer_.reset(new char[size_]);\n      DCHECK(buffer_);\n    }\n    bytes_requested_ = new_size;\n    bytes_written_ = 0;\n    bytes_read_ = 0;\n  }\n\n  bool IsEmpty() const {\n    return (bytes_written_ == 0);\n  }\n\n  bool CanRead() const {\n    return (bytes_read_ < bytes_written_);\n  }\n\n  int WriteTo(void* data_out, int bytes_to_read) {\n    const int write_size =\n        std::min(bytes_to_read, bytes_written_ - bytes_read_);\n    if (write_size > 0) {\n      memcpy(data_out, buffer_ .get() + bytes_read_, write_size);\n      bytes_read_ += write_size;\n    }\n    return write_size;\n  }\n\n  int ReadFrom(CefRefPtr<CefStreamReader> reader) {\n    \/\/ Read until the buffer is full or until Read() returns 0 to indicate no\n    \/\/ more data.\n    int bytes_read;\n    do {\n      bytes_read = static_cast<int>(\n          reader->Read(buffer_.get() + bytes_written_, 1,\n                       bytes_requested_ - bytes_written_));\n      bytes_written_ += bytes_read;\n    } while (bytes_read != 0 && bytes_written_ < bytes_requested_);\n\n    return bytes_written_;\n  }\n\n private:\n  scoped_ptr<char[]> buffer_;\n  int size_;\n  int bytes_requested_;\n  int bytes_written_;\n  int bytes_read_;\n\n  DISALLOW_COPY_AND_ASSIGN(Buffer);\n};\n\nCefStreamResourceHandler::CefStreamResourceHandler(\n    const CefString& mime_type,\n    CefRefPtr<CefStreamReader> stream)\n    : status_code_(200),\n      status_text_(\"OK\"),\n      mime_type_(mime_type),\n      stream_(stream)\n#ifndef NDEBUG\n      , buffer_owned_by_file_thread_(false)\n#endif\n{\n  DCHECK(!mime_type_.empty());\n  DCHECK(stream_.get());\n  read_on_file_thread_ = stream_->MayBlock();\n}\n\nCefStreamResourceHandler::CefStreamResourceHandler(\n    int status_code,\n    const CefString& status_text,\n    const CefString& mime_type,\n    CefResponse::HeaderMap header_map,\n    CefRefPtr<CefStreamReader> stream)\n    : status_code_(status_code),\n      status_text_(status_text),\n      mime_type_(mime_type),\n      header_map_(header_map),\n      stream_(stream)\n#ifndef NDEBUG\n      , buffer_owned_by_file_thread_(false)\n#endif\n{\n  DCHECK(!mime_type_.empty());\n  DCHECK(stream_.get());\n  read_on_file_thread_ = stream_->MayBlock();\n}\n\nCefStreamResourceHandler::~CefStreamResourceHandler() {\n}\n\nbool CefStreamResourceHandler::ProcessRequest(CefRefPtr<CefRequest> request,\n                                              CefRefPtr<CefCallback> callback) {\n  callback->Continue();\n  return true;\n}\n\nvoid CefStreamResourceHandler::GetResponseHeaders(\n    CefRefPtr<CefResponse> response,\n    int64& response_length,\n    CefString& redirectUrl) {\n  response->SetStatus(status_code_);\n  response->SetStatusText(status_text_);\n  response->SetMimeType(mime_type_);\n\n  if (!header_map_.empty())\n    response->SetHeaderMap(header_map_);\n\n  response_length = -1;\n}\n\nbool CefStreamResourceHandler::ReadResponse(void* data_out,\n                                            int bytes_to_read,\n                                            int& bytes_read,\n                                            CefRefPtr<CefCallback> callback) {\n  DCHECK_GT(bytes_to_read, 0);\n\n  if (read_on_file_thread_) {\n#ifndef NDEBUG\n    DCHECK(!buffer_owned_by_file_thread_);\n#endif\n    if (buffer_ && (buffer_->CanRead() || buffer_->IsEmpty())) {\n      if (buffer_->CanRead()) {\n        \/\/ Provide data from the buffer.\n        bytes_read = buffer_->WriteTo(data_out, bytes_to_read);\n        return (bytes_read > 0);\n      } else {\n        \/\/ End of the steam.\n        bytes_read = 0;\n        return false;\n      }\n    } else {\n      \/\/ Perform another read on the file thread.\n      bytes_read = 0;\n#ifndef NDEBUG\n      buffer_owned_by_file_thread_ = true;\n#endif\n      CefPostTask(TID_FILE,\n          base::Bind(&CefStreamResourceHandler::ReadOnFileThread, this,\n                     bytes_to_read, callback));\n      return true;\n    }\n  } else {\n    \/\/ Read until the buffer is full or until Read() returns 0 to indicate no\n    \/\/ more data.\n    bytes_read = 0;\n    int read = 0;\n    do {\n      read = static_cast<int>(\n          stream_->Read(static_cast<char*>(data_out) + bytes_read, 1,\n                        bytes_to_read - bytes_read));\n      bytes_read += read;\n    } while (read != 0 && bytes_read < bytes_to_read);\n\n    return (bytes_read > 0);\n  }\n}\n\nvoid CefStreamResourceHandler::Cancel() {\n}\n\nvoid CefStreamResourceHandler::ReadOnFileThread(\n    int bytes_to_read,\n    CefRefPtr<CefCallback> callback) {\n  CEF_REQUIRE_FILE_THREAD();\n#ifndef NDEBUG\n  DCHECK(buffer_owned_by_file_thread_);\n#endif\n\n  if (!buffer_)\n    buffer_.reset(new Buffer());\n  buffer_->Reset(bytes_to_read);\n  buffer_->ReadFrom(stream_);\n\n#ifndef NDEBUG\n  buffer_owned_by_file_thread_ = false;\n#endif\n  callback->Continue();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <Synopsis\/Trace.hh>\n#include <Buffer.hh>\n#include <Lexer.hh>\n#include <Parser.hh>\n#include <PTree.hh>\n#include <PTree\/Display.hh>\n#include <PTree\/Writer.hh>\n#include <SymbolLookup.hh>\n#include <iostream>\n#include <iomanip>\n#include <fstream>\n\nusing namespace Synopsis;\n\nclass SymbolFinder : public SymbolLookup::Visitor\n{\npublic:\n  SymbolFinder(SymbolLookup::Table &table, std::ostream &os)\n    : SymbolLookup::Visitor(table), my_os(os) {}\n  void find(PTree::Node *node) { node->accept(this);}\nprivate:\n  virtual void visit(PTree::Declarator *decl)\n  {\n  }\n\n  std::ostream &my_os;\n};\n\nint main(int argc, char **argv)\n{\n  if (argc != 3)\n  {\n    std::cerr << \"Usage: \" << argv[0] << \" <output> <input>\" << std::endl;\n    exit(-1);\n  }\n  try\n  {\n    std::ofstream ofs(argv[1]);\n    std::ifstream ifs(argv[2]);\n    Buffer buffer(ifs.rdbuf());\n    Lexer lexer(&buffer);\n    SymbolLookup::Table symbols;\n    Parser parser(lexer, symbols);\n    PTree::Node *node = parser.parse();\n    SymbolFinder finder(symbols, ofs);\n    finder.find(node);\n  }\n  catch (const std::exception &e)\n  {\n    std::cerr << \"Caught exception : \" << e.what() << std::endl;\n  }\n}\n<commit_msg>get some basic support for symbol lookup testing<commit_after>#include <Synopsis\/Trace.hh>\n#include <Buffer.hh>\n#include <Lexer.hh>\n#include <Parser.hh>\n#include <PTree.hh>\n#include <PTree\/Display.hh>\n#include <PTree\/Writer.hh>\n#include <SymbolLookup.hh>\n#include <iostream>\n#include <iomanip>\n#include <fstream>\n\nusing namespace Synopsis;\n\nclass SymbolFinder : public SymbolLookup::Visitor\n{\npublic:\n  SymbolFinder(Buffer const &buffer, SymbolLookup::Table &table, std::ostream &os)\n    : SymbolLookup::Visitor(table), my_buffer(buffer), my_os(os) {}\n  void find(PTree::Node *node) { node->accept(this);}\nprivate:\n  virtual void visit(PTree::Declarator *decl)\n  {\n    PTree::Encoding name = decl->encoded_name();\n    std::cout << \"Declarator : \" << name << std::endl;\n    \/\/ now find it.\n    SymbolLookup::SymbolSet symbols = table().lookup(name);\n    if (!symbols.empty())\n    {\n      std::string filename;\n      SymbolLookup::Symbol const *first = *symbols.begin();\n      unsigned long line_number = my_buffer.origin(first->ptree()->begin(), filename);\n      std::cout << \"declared at line \" << line_number << \" in \" << filename << std::endl;\n    }\n    else\n      std::cout << \"undeclared ! \" << std::endl;\n  }\n\n  virtual void visit(PTree::Name *n)\n  {\n    PTree::Encoding name = n->encoded_name();\n    std::cout << \"Name : \" << name << std::endl;\n    \/\/ now find it.\n    SymbolLookup::SymbolSet symbols = table().lookup(name);\n    if (!symbols.empty())\n    {\n      std::string filename;\n      SymbolLookup::Symbol const *first = *symbols.begin();\n      unsigned long line_number = my_buffer.origin(first->ptree()->begin(), filename);\n      std::cout << \"declared at line \" << line_number << \" in \" << filename << std::endl;\n    }\n    else\n      std::cout << \"undeclared ! \" << std::endl;\n  }\n  \n  Buffer const &my_buffer;\n  std::ostream &my_os;\n};\n\nint main(int argc, char **argv)\n{\n  if (argc != 3)\n  {\n    std::cerr << \"Usage: \" << argv[0] << \" <output> <input>\" << std::endl;\n    exit(-1);\n  }\n  try\n  {\n    std::ofstream ofs(argv[1]);\n    std::ifstream ifs(argv[2]);\n    Buffer buffer(ifs.rdbuf(), argv[2]);\n    Lexer lexer(&buffer);\n    SymbolLookup::Table symbols;\n    Parser parser(lexer, symbols);\n    PTree::Node *node = parser.parse();\n    SymbolFinder finder(buffer, symbols, ofs);\n    finder.find(node);\n  }\n  catch (const std::exception &e)\n  {\n    std::cerr << \"Caught exception : \" << e.what() << std::endl;\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**************************************************************************\n**\n** This file is part of Qt Creator\n**\n** Copyright (c) 2010 Nicolas Arnaud-Cormos.\n**\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** No Commercial Usage\n**\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the Technology Preview License Agreement accompanying\n** this package.\n**\n** GNU Lesser General Public License Usage\n**\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain additional\n** rights.  These rights are described in the Nokia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at qt-info@nokia.com.\n**\n**************************************************************************\/\n\n#include \"macrosplugin.h\"\n\n#include \"macrosconstants.h\"\n#include \"macromanager.h\"\n#include \"macrooptionspage.h\"\n#include \"macrolocatorfilter.h\"\n\n#include <texteditor\/texteditorconstants.h>\n\n#include <coreplugin\/coreconstants.h>\n#include <coreplugin\/actionmanager\/actionmanager.h>\n#include <coreplugin\/actionmanager\/actioncontainer.h>\n#include <coreplugin\/actionmanager\/command.h>\n#include <coreplugin\/icore.h>\n#include <coreplugin\/uniqueidmanager.h>\n#include <coreplugin\/icontext.h>\n\n#include <QtPlugin>\n#include <QAction>\n#include <QKeySequence>\n#include <QSettings>\n#include <QMenu>\n\nusing namespace Macros;\nusing namespace Macros::Internal;\n\n\nMacrosPlugin::MacrosPlugin()\n{\n}\n\nMacrosPlugin::~MacrosPlugin()\n{\n}\n\nbool MacrosPlugin::initialize(const QStringList &arguments, QString *error_message)\n{\n    Q_UNUSED(arguments);\n    Q_UNUSED(error_message);\n\n    addAutoReleasedObject(new MacroOptionsPage);\n    addAutoReleasedObject(new MacroLocatorFilter);\n\n    Core::ICore *core = Core::ICore::instance();\n    Core::ActionManager *am = core->actionManager();\n\n    Core::Context globalcontext(Core::Constants::C_GLOBAL);\n    Core::Context textContext(TextEditor::Constants::C_TEXTEDITOR);\n    m_macroManager = new MacroManager(this);\n\n    \/\/ Menus\n    Core::ActionContainer *mtools = am->actionContainer(Core::Constants::M_TOOLS);\n    Core::ActionContainer *mmacrotools = am->createMenu(Constants::M_TOOLS_MACRO);\n    QMenu *menu = mmacrotools->menu();\n    menu->setTitle(tr(\"&Macros\"));\n    menu->setEnabled(true);\n    mtools->addMenu(mmacrotools);\n\n    QAction *startMacro = new QAction(tr(\"Start Macro\"),  this);\n    Core::Command *command = am->registerAction(startMacro, Constants::START_MACRO, textContext);\n    command->setDefaultKeySequence(QKeySequence(tr(\"Alt+(\")));\n    mmacrotools->addAction(command);\n    connect(startMacro, SIGNAL(triggered()), m_macroManager, SLOT(startMacro()));\n\n    QAction *endMacro = new QAction(tr(\"End Macro\"),  this);\n    endMacro->setEnabled(false);\n    command = am->registerAction(endMacro, Constants::END_MACRO, globalcontext);\n    command->setDefaultKeySequence(QKeySequence(tr(\"Alt+)\")));\n    mmacrotools->addAction(command);\n    connect(endMacro, SIGNAL(triggered()), m_macroManager, SLOT(endMacro()));\n\n    QAction *executeLastMacro = new QAction(tr(\"Execute Last Macro\"),  this);\n    command = am->registerAction(executeLastMacro, Constants::EXECUTE_LAST_MACRO, textContext);\n    command->setDefaultKeySequence(QKeySequence(tr(\"Alt+R,Alt+M\")));\n    mmacrotools->addAction(command);\n    connect(executeLastMacro, SIGNAL(triggered()), m_macroManager, SLOT(executeLastMacro()));\n\n    return true;\n}\n\nvoid MacrosPlugin::extensionsInitialized()\n{\n}\n\nQ_EXPORT_PLUGIN(MacrosPlugin)\n<commit_msg>Macros: add different shortcuts for mac.<commit_after>\/**************************************************************************\n**\n** This file is part of Qt Creator\n**\n** Copyright (c) 2010 Nicolas Arnaud-Cormos.\n**\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** No Commercial Usage\n**\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the Technology Preview License Agreement accompanying\n** this package.\n**\n** GNU Lesser General Public License Usage\n**\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain additional\n** rights.  These rights are described in the Nokia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at qt-info@nokia.com.\n**\n**************************************************************************\/\n\n#include \"macrosplugin.h\"\n\n#include \"macrosconstants.h\"\n#include \"macromanager.h\"\n#include \"macrooptionspage.h\"\n#include \"macrolocatorfilter.h\"\n\n#include <texteditor\/texteditorconstants.h>\n\n#include <coreplugin\/coreconstants.h>\n#include <coreplugin\/actionmanager\/actionmanager.h>\n#include <coreplugin\/actionmanager\/actioncontainer.h>\n#include <coreplugin\/actionmanager\/command.h>\n#include <coreplugin\/icore.h>\n#include <coreplugin\/uniqueidmanager.h>\n#include <coreplugin\/icontext.h>\n\n#include <QtPlugin>\n#include <QAction>\n#include <QKeySequence>\n#include <QSettings>\n#include <QMenu>\n\nusing namespace Macros;\nusing namespace Macros::Internal;\n\n\nMacrosPlugin::MacrosPlugin()\n{\n}\n\nMacrosPlugin::~MacrosPlugin()\n{\n}\n\nbool MacrosPlugin::initialize(const QStringList &arguments, QString *error_message)\n{\n    Q_UNUSED(arguments);\n    Q_UNUSED(error_message);\n\n    addAutoReleasedObject(new MacroOptionsPage);\n    addAutoReleasedObject(new MacroLocatorFilter);\n\n    Core::ICore *core = Core::ICore::instance();\n    Core::ActionManager *am = core->actionManager();\n\n    Core::Context globalcontext(Core::Constants::C_GLOBAL);\n    Core::Context textContext(TextEditor::Constants::C_TEXTEDITOR);\n    m_macroManager = new MacroManager(this);\n\n    \/\/ Menus\n    Core::ActionContainer *mtools = am->actionContainer(Core::Constants::M_TOOLS);\n    Core::ActionContainer *mmacrotools = am->createMenu(Constants::M_TOOLS_MACRO);\n    QMenu *menu = mmacrotools->menu();\n    menu->setTitle(tr(\"&Macros\"));\n    menu->setEnabled(true);\n    mtools->addMenu(mmacrotools);\n\n    QAction *startMacro = new QAction(tr(\"Start Macro\"),  this);\n    Core::Command *command = am->registerAction(startMacro, Constants::START_MACRO, textContext);\n#ifdef Q_WS_MAC\n    command->setDefaultKeySequence(QKeySequence(tr(\"Ctrl+(\")));\n#else\n    command->setDefaultKeySequence(QKeySequence(tr(\"Alt+(\")));\n#endif\n    mmacrotools->addAction(command);\n    connect(startMacro, SIGNAL(triggered()), m_macroManager, SLOT(startMacro()));\n\n    QAction *endMacro = new QAction(tr(\"End Macro\"),  this);\n    endMacro->setEnabled(false);\n    command = am->registerAction(endMacro, Constants::END_MACRO, globalcontext);\n#ifdef Q_WS_MAC\n    command->setDefaultKeySequence(QKeySequence(tr(\"Ctrl+)\")));\n#else\n    command->setDefaultKeySequence(QKeySequence(tr(\"Alt+)\")));\n#endif\n    mmacrotools->addAction(command);\n    connect(endMacro, SIGNAL(triggered()), m_macroManager, SLOT(endMacro()));\n\n    QAction *executeLastMacro = new QAction(tr(\"Execute Last Macro\"),  this);\n    command = am->registerAction(executeLastMacro, Constants::EXECUTE_LAST_MACRO, textContext);\n    command->setDefaultKeySequence(QKeySequence(tr(\"Alt+Shift+R\")));\n    mmacrotools->addAction(command);\n    connect(executeLastMacro, SIGNAL(triggered()), m_macroManager, SLOT(executeLastMacro()));\n\n    return true;\n}\n\nvoid MacrosPlugin::extensionsInitialized()\n{\n}\n\nQ_EXPORT_PLUGIN(MacrosPlugin)\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Add a debug assert to BlockSharedMemStMemberImpl constructor<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#include \"java\/sql\/Timestamp.hxx\"\n#include \"java\/tools.hxx\"\n#include <comphelper\/types.hxx>\n#include \"connectivity\/dbconversion.hxx\"\n\nusing namespace ::comphelper;\nusing namespace connectivity;\n\/\/**************************************************************\n\/\/************ Class: java.sql.Date\n\/\/**************************************************************\nconst double fMilliSecondsPerDay = 86400000.0;\njclass java_sql_Date::theClass = 0;\njava_sql_Date::java_sql_Date( const ::com::sun::star::util::Date& _rOut ) : java_util_Date( NULL, (jobject)NULL )\n{\n    SDBThreadAttach t;\n    if( !t.pEnv )\n        return;\n    jvalue args[1];\n    \/\/ Convert parameters\n    OUString sDateStr;\n    sDateStr = ::dbtools::DBTypeConversion::toDateString(_rOut);\n    args[0].l = convertwchar_tToJavaString(t.pEnv,sDateStr);\n\n    \/\/ Turn of Java-Call for the constructor\n    \/\/ initialise temporary variables\n    static const char * cSignature = \"(Ljava\/lang\/String;)Ljava\/sql\/Date;\";\n    jobject tempObj;\n    static jmethodID mID(NULL);\n    if ( !mID  )\n        mID  = t.pEnv->GetStaticMethodID( getMyClass(), \"valueOf\", cSignature );\n    OSL_ENSURE(mID,\"Unknown method id!\");\n    tempObj = t.pEnv->CallStaticObjectMethod( getMyClass(), mID, args[0].l );\n    saveRef( t.pEnv, tempObj );\n    t.pEnv->DeleteLocalRef( tempObj );\n    \/\/ and clean\n}\n\njava_sql_Date::~java_sql_Date()\n{}\n\njclass java_sql_Date::getMyClass() const\n{\n    return st_getMyClass();\n}\njclass java_sql_Date::st_getMyClass()\n{\n    \/\/ the class needs only be fetched once, that is why it is static\n    if( !theClass )\n        theClass = findMyClass(\"java\/sql\/Date\");\n    return theClass;\n}\n\/\/ -----------------------------------------------------------------------------\n\njava_sql_Date::operator ::com::sun::star::util::Date()\n{\n    return ::dbtools::DBTypeConversion::toDate(toString());\n}\n\n\/\/**************************************************************\n\/\/************ Class: java.sql.Time\n\/\/**************************************************************\n\njclass java_sql_Time::theClass = 0;\n\njava_sql_Time::~java_sql_Time()\n{}\n\njclass java_sql_Time::getMyClass() const\n{\n    return st_getMyClass();\n}\njclass java_sql_Time::st_getMyClass()\n{\n    \/\/ the class needs only be fetched once, that is why it is static\n    if( !theClass )\n        theClass = findMyClass(\"java\/sql\/Time\");\n    return theClass;\n}\njava_sql_Time::java_sql_Time( const ::com::sun::star::util::Time& _rOut ): java_util_Date( NULL, (jobject)NULL )\n{\n    SDBThreadAttach t;\n    if( !t.pEnv )\n        return;\n    jvalue args[1];\n    \/\/ Convert parameters\n    OUString sDateStr;\n    \/\/ java.sql.Time supports only whole seconds...\n    sDateStr = ::dbtools::DBTypeConversion::toTimeStringS(_rOut);\n    args[0].l = convertwchar_tToJavaString(t.pEnv,sDateStr);\n\n    \/\/ Turn off Java-Call for the constructor\n    \/\/ intialise temporary variables\n    static const char * cSignature = \"(Ljava\/lang\/String;)Ljava\/sql\/Time;\";\n    jobject tempObj;\n    static jmethodID mID(NULL);\n    if ( !mID  )\n        mID  = t.pEnv->GetStaticMethodID( getMyClass(), \"valueOf\", cSignature );\n    OSL_ENSURE(mID,\"Unknown method id!\");\n    tempObj = t.pEnv->CallStaticObjectMethod( getMyClass(), mID, args[0].l );\n    t.pEnv->DeleteLocalRef((jstring)args[0].l);\n    saveRef( t.pEnv, tempObj );\n    t.pEnv->DeleteLocalRef( tempObj );\n    \/\/ and clean\n}\n\/\/ -----------------------------------------------------------------------------\njava_sql_Time::operator ::com::sun::star::util::Time()\n{\n    return ::dbtools::DBTypeConversion::toTime(toString());\n}\n\/\/**************************************************************\n\/\/************ Class: java.sql.Timestamp\n\/\/**************************************************************\n\njclass java_sql_Timestamp::theClass = 0;\n\njava_sql_Timestamp::~java_sql_Timestamp()\n{}\n\njclass java_sql_Timestamp::getMyClass() const\n{\n    return st_getMyClass();\n}\n\njclass java_sql_Timestamp::st_getMyClass()\n{\n    \/\/ the class needs only be fetched once, that is why it is static\n    if( !theClass )\n        theClass = findMyClass(\"java\/sql\/Timestamp\");\n    return theClass;\n}\n\njava_sql_Timestamp::java_sql_Timestamp(const ::com::sun::star::util::DateTime& _rOut)\n                   :java_util_Date( NULL, (jobject)NULL )\n{\n        SDBThreadAttach t;\n    if( !t.pEnv )\n        return;\n    jvalue args[1];\n    \/\/ Convert parameters\n    OUString sDateStr;\n    sDateStr = ::dbtools::DBTypeConversion::toDateTimeString(_rOut);\n\n    args[0].l = convertwchar_tToJavaString(t.pEnv,sDateStr);\n\n    \/\/ Turn off Java-Call for the constructor\n    \/\/ initialise temporary variables\n    static const char * cSignature = \"(Ljava\/lang\/String;)Ljava\/sql\/Timestamp;\";\n    jobject tempObj;\n    static jmethodID mID(NULL);\n    if ( !mID  )\n        mID  = t.pEnv->GetStaticMethodID( getMyClass(), \"valueOf\", cSignature );\n    OSL_ENSURE(mID,\"Unknown method id!\");\n    tempObj = t.pEnv->CallStaticObjectMethod( getMyClass(), mID, args[0].l );\n\n    saveRef( t.pEnv, tempObj );\n    t.pEnv->DeleteLocalRef( tempObj );\n    \/\/ and clean\n}\n\n\/\/ -----------------------------------------------------------------------------\njava_sql_Timestamp::operator ::com::sun::star::util::DateTime()\n{\n    return ::dbtools::DBTypeConversion::toDateTime(toString());\n}\n\/\/ -----------------------------------------------------------------------------\n\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>-Werror,-Wunused-const-variable<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 \"java\/sql\/Timestamp.hxx\"\n#include \"java\/tools.hxx\"\n#include <comphelper\/types.hxx>\n#include \"connectivity\/dbconversion.hxx\"\n\nusing namespace ::comphelper;\nusing namespace connectivity;\n\/\/**************************************************************\n\/\/************ Class: java.sql.Date\n\/\/**************************************************************\n\njclass java_sql_Date::theClass = 0;\njava_sql_Date::java_sql_Date( const ::com::sun::star::util::Date& _rOut ) : java_util_Date( NULL, (jobject)NULL )\n{\n    SDBThreadAttach t;\n    if( !t.pEnv )\n        return;\n    jvalue args[1];\n    \/\/ Convert parameters\n    OUString sDateStr;\n    sDateStr = ::dbtools::DBTypeConversion::toDateString(_rOut);\n    args[0].l = convertwchar_tToJavaString(t.pEnv,sDateStr);\n\n    \/\/ Turn of Java-Call for the constructor\n    \/\/ initialise temporary variables\n    static const char * cSignature = \"(Ljava\/lang\/String;)Ljava\/sql\/Date;\";\n    jobject tempObj;\n    static jmethodID mID(NULL);\n    if ( !mID  )\n        mID  = t.pEnv->GetStaticMethodID( getMyClass(), \"valueOf\", cSignature );\n    OSL_ENSURE(mID,\"Unknown method id!\");\n    tempObj = t.pEnv->CallStaticObjectMethod( getMyClass(), mID, args[0].l );\n    saveRef( t.pEnv, tempObj );\n    t.pEnv->DeleteLocalRef( tempObj );\n    \/\/ and clean\n}\n\njava_sql_Date::~java_sql_Date()\n{}\n\njclass java_sql_Date::getMyClass() const\n{\n    return st_getMyClass();\n}\njclass java_sql_Date::st_getMyClass()\n{\n    \/\/ the class needs only be fetched once, that is why it is static\n    if( !theClass )\n        theClass = findMyClass(\"java\/sql\/Date\");\n    return theClass;\n}\n\/\/ -----------------------------------------------------------------------------\n\njava_sql_Date::operator ::com::sun::star::util::Date()\n{\n    return ::dbtools::DBTypeConversion::toDate(toString());\n}\n\n\/\/**************************************************************\n\/\/************ Class: java.sql.Time\n\/\/**************************************************************\n\njclass java_sql_Time::theClass = 0;\n\njava_sql_Time::~java_sql_Time()\n{}\n\njclass java_sql_Time::getMyClass() const\n{\n    return st_getMyClass();\n}\njclass java_sql_Time::st_getMyClass()\n{\n    \/\/ the class needs only be fetched once, that is why it is static\n    if( !theClass )\n        theClass = findMyClass(\"java\/sql\/Time\");\n    return theClass;\n}\njava_sql_Time::java_sql_Time( const ::com::sun::star::util::Time& _rOut ): java_util_Date( NULL, (jobject)NULL )\n{\n    SDBThreadAttach t;\n    if( !t.pEnv )\n        return;\n    jvalue args[1];\n    \/\/ Convert parameters\n    OUString sDateStr;\n    \/\/ java.sql.Time supports only whole seconds...\n    sDateStr = ::dbtools::DBTypeConversion::toTimeStringS(_rOut);\n    args[0].l = convertwchar_tToJavaString(t.pEnv,sDateStr);\n\n    \/\/ Turn off Java-Call for the constructor\n    \/\/ intialise temporary variables\n    static const char * cSignature = \"(Ljava\/lang\/String;)Ljava\/sql\/Time;\";\n    jobject tempObj;\n    static jmethodID mID(NULL);\n    if ( !mID  )\n        mID  = t.pEnv->GetStaticMethodID( getMyClass(), \"valueOf\", cSignature );\n    OSL_ENSURE(mID,\"Unknown method id!\");\n    tempObj = t.pEnv->CallStaticObjectMethod( getMyClass(), mID, args[0].l );\n    t.pEnv->DeleteLocalRef((jstring)args[0].l);\n    saveRef( t.pEnv, tempObj );\n    t.pEnv->DeleteLocalRef( tempObj );\n    \/\/ and clean\n}\n\/\/ -----------------------------------------------------------------------------\njava_sql_Time::operator ::com::sun::star::util::Time()\n{\n    return ::dbtools::DBTypeConversion::toTime(toString());\n}\n\/\/**************************************************************\n\/\/************ Class: java.sql.Timestamp\n\/\/**************************************************************\n\njclass java_sql_Timestamp::theClass = 0;\n\njava_sql_Timestamp::~java_sql_Timestamp()\n{}\n\njclass java_sql_Timestamp::getMyClass() const\n{\n    return st_getMyClass();\n}\n\njclass java_sql_Timestamp::st_getMyClass()\n{\n    \/\/ the class needs only be fetched once, that is why it is static\n    if( !theClass )\n        theClass = findMyClass(\"java\/sql\/Timestamp\");\n    return theClass;\n}\n\njava_sql_Timestamp::java_sql_Timestamp(const ::com::sun::star::util::DateTime& _rOut)\n                   :java_util_Date( NULL, (jobject)NULL )\n{\n        SDBThreadAttach t;\n    if( !t.pEnv )\n        return;\n    jvalue args[1];\n    \/\/ Convert parameters\n    OUString sDateStr;\n    sDateStr = ::dbtools::DBTypeConversion::toDateTimeString(_rOut);\n\n    args[0].l = convertwchar_tToJavaString(t.pEnv,sDateStr);\n\n    \/\/ Turn off Java-Call for the constructor\n    \/\/ initialise temporary variables\n    static const char * cSignature = \"(Ljava\/lang\/String;)Ljava\/sql\/Timestamp;\";\n    jobject tempObj;\n    static jmethodID mID(NULL);\n    if ( !mID  )\n        mID  = t.pEnv->GetStaticMethodID( getMyClass(), \"valueOf\", cSignature );\n    OSL_ENSURE(mID,\"Unknown method id!\");\n    tempObj = t.pEnv->CallStaticObjectMethod( getMyClass(), mID, args[0].l );\n\n    saveRef( t.pEnv, tempObj );\n    t.pEnv->DeleteLocalRef( tempObj );\n    \/\/ and clean\n}\n\n\/\/ -----------------------------------------------------------------------------\njava_sql_Timestamp::operator ::com::sun::star::util::DateTime()\n{\n    return ::dbtools::DBTypeConversion::toDateTime(toString());\n}\n\/\/ -----------------------------------------------------------------------------\n\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\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 \"FCC\"\n#define GRAPHENE_ADDRESS_PREFIX \"FCC\"\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\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_MIN_BLOCK_INTERVAL   1 \/* seconds *\/\n#define GRAPHENE_MAX_BLOCK_INTERVAL  30 \/* seconds *\/\n\n#define GRAPHENE_DEFAULT_BLOCK_INTERVAL  5 \/* 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( 100000000 )\n#define GRAPHENE_BLOCKCHAIN_PRECISION_DIGITS                    8\n\n#define GRAPHENE_MAX_SHARE_SUPPLY int64_t(10000000000ll*GRAPHENE_BLOCKCHAIN_PRECISION)\n#define GRAPHENE_MAX_PAY_RATE 10000 \/* 100% *\/\n#define GRAPHENE_MAX_SIG_CHECK_DEPTH 2\n\n\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                        (1001) \/\/ SHOULD BE ODD\n#define GRAPHENE_DEFAULT_MAX_COMMITTEE                        (1001) \/\/ 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*7*2) \/\/ Two weeks\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                          \"FCC 0.01\"\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\/\/\/ 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\/\/time\n#define FCC_INTEREST_DAY            (3600*24)\n#define FCC_INTEREST_MONTH          (3600*24*30)\n#define FCC_INTEREST_DAYS_YEAR      360\n#define FCC_INTEREST_YEAR           (3600*24*30*FCC_INTEREST_DAYS_YEAR)\n\n\n\/\/percent\n#define FCC_INTEREST_BASE_SUPPLY      1000000000000LL\n\n<commit_msg>fix bug FCC_INTEREST_YEAR<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 \"FCC\"\n#define GRAPHENE_ADDRESS_PREFIX \"FCC\"\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\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_MIN_BLOCK_INTERVAL   1 \/* seconds *\/\n#define GRAPHENE_MAX_BLOCK_INTERVAL  30 \/* seconds *\/\n\n#define GRAPHENE_DEFAULT_BLOCK_INTERVAL  5 \/* 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( 100000000 )\n#define GRAPHENE_BLOCKCHAIN_PRECISION_DIGITS                    8\n\n#define GRAPHENE_MAX_SHARE_SUPPLY int64_t(10000000000ll*GRAPHENE_BLOCKCHAIN_PRECISION)\n#define GRAPHENE_MAX_PAY_RATE 10000 \/* 100% *\/\n#define GRAPHENE_MAX_SIG_CHECK_DEPTH 2\n\n\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                        (1001) \/\/ SHOULD BE ODD\n#define GRAPHENE_DEFAULT_MAX_COMMITTEE                        (1001) \/\/ 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*7*2) \/\/ Two weeks\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                          \"FCC 0.01\"\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\/\/\/ 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\/\/time\n#define FCC_INTEREST_DAY            (3600*24)\n#define FCC_INTEREST_MONTH          (3600*24*30)\n#define FCC_INTEREST_DAYS_YEAR      360\n#define FCC_INTEREST_YEAR           (3600*24*FCC_INTEREST_DAYS_YEAR)\n\n\n\/\/percent\n#define FCC_INTEREST_BASE_SUPPLY      1000000000000LL\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>vcl: Use right size to draw native GTK window background<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/pyroot:$Name:  $:$Id: TPython.cxx,v 1.14 2006\/06\/14 13:46:30 brun Exp $\n\/\/ Author: Wim Lavrijsen, Apr 2004\n\n\/\/ Bindings\n#include \"PyROOT.h\"\n#include \"TPython.h\"\n#include \"ObjectProxy.h\"\n#include \"RootWrapper.h\"\n#include \"TPyClassGenerator.h\"\n\n\/\/ ROOT\n#include \"TROOT.h\"\n#include \"TObject.h\"\n\n\/\/ Standard\n#include <stdio.h>\n#include <Riostream.h>\n#include <string>\n\n\/\/______________________________________________________________________________\n\/\/                          Python interpreter access\n\/\/                          =========================\n\/\/\n\/\/ The TPython class allows for access to python objects from CINT. The current\n\/\/ functionality is only basic: ROOT objects and builtin types can freely cross\n\/\/ the boundary between the two interpreters, python objects can be instantiated\n\/\/ and their methods can be called. All other cross-coding is based on strings\n\/\/ that are run on the python interpreter.\n\/\/\n\/\/ Examples:\n\/\/\n\/\/  $ cat MyPyClass.py\n\/\/  print 'creating class MyPyClass ... '\n\/\/\n\/\/  class MyPyClass:\n\/\/     def __init__( self ):\n\/\/        print 'in MyPyClass.__init__'\n\/\/\n\/\/     def gime( self, what ):\n\/\/        return what\n\/\/\n\/\/  $ root -l\n\/\/  \/\/ Execute a string of python code.\n\/\/  root [0] TPython::Exec( \"print \\'Hello World!\\'\" );\n\/\/  Hello World!\n\/\/\n\/\/  \/\/ Create a TBrowser on the python side, and transfer it back and forth.\n\/\/  \/\/ Note the required explicit (void*) cast!\n\/\/  root [1] TBrowser* b = (void*)TPython::Eval( \"ROOT.TBrowser()\" );\n\/\/  root [2] TPython::Bind( b, \"b\" );\n\/\/  root [3] b == (void*) TPython::Eval( \"b\" )\n\/\/  (int)1\n\/\/\n\/\/  \/\/ Builtin variables can cross-over by using implicit casts.\n\/\/  root [4] int i = TPython::Eval( \"1 + 1\" );\n\/\/  root [5] i\n\/\/  (int)2\n\/\/\n\/\/  \/\/ Load a python module with a class definition, and use it.\n\/\/  root [6] TPython::LoadMacro( \"MyPyClass.py\" );\n\/\/  creating class MyPyClass ...\n\/\/  root [7] MyPyClass m;\n\/\/  in MyPyClass.__init__\n\/\/  root [8] char* s = m.gime( \"aap\" );\n\/\/  root [9] s\n\/\/  (char* 0x41ee7754)\"aap\"\n\/\/\n\/\/ It is possible to switch between interpreters by calling \"TPython::Prompt()\"\n\/\/ on the CINT side, while returning with ^D (EOF). State is preserved between\n\/\/ successive switches.\n\n\n\/\/- data ---------------------------------------------------------------------\nClassImp(TPython)\n\nnamespace {\n\n   PyObject* gMainDict = 0;\n\n   PyObject* gClassString  = 0;\n   PyObject* gNameString   = 0;\n   PyObject* gModuleString = 0;\n\n} \/\/ unnamed namespace\n\n\n\/\/- static public members ----------------------------------------------------\nBool_t TPython::Initialize()\n{\n\/\/ Private initialization method: setup the python interpreter and load the\n\/\/ ROOT module.\n\n   static Bool_t isInitialized = kFALSE;\n   if ( isInitialized )\n      return kTRUE;\n\n   if ( ! Py_IsInitialized() ) {\n   \/\/ this happens if CINT comes in first\n      PyEval_InitThreads();\n      Py_Initialize();\n\n   \/\/ try again\n      if ( ! Py_IsInitialized() ) {\n      \/\/ give up ...\n         std::cerr << \"Error: python has not been intialized; returning.\" << std::endl;           \n         return kFALSE;\n      }\n\n   \/\/ set argv\n      char* argv[] = { const_cast< char* >( \"root\" ) };\n      PySys_SetArgv( sizeof(argv)\/sizeof(argv[0]), argv );\n\n   \/\/ force loading of ROOT\n      PyRun_SimpleString( const_cast< char* >( \"import ROOT\" ) );\n   }\n\n   if ( ! gMainDict ) {\n   \/\/ initialize some handy strings\n      gClassString  = PyString_FromString( \"__class__\" );\n      gNameString   = PyString_FromString( \"__name__\" );\n      gModuleString = PyString_FromString( \"__module__\" );\n\n   \/\/ retrieve the main dictionary\n      gMainDict = PyModule_GetDict(\n         PyImport_AddModule( const_cast< char* >( \"__main__\" ) ) );\n      Py_INCREF( gMainDict );\n   }\n\n\/\/ python side class construction, managed by ROOT\n   gROOT->AddClassGenerator( new TPyClassGenerator );\n\n\/\/ declare success ...\n   isInitialized = kTRUE;\n   return kTRUE;\n}\n\n\/\/____________________________________________________________________________\nvoid TPython::LoadMacro( const char* name )\n{\n\/\/ Execute the give python script as if it were a macro (effectively an\n\/\/ execfile in __main__), and create CINT equivalents for any newly available\n\/\/ python classes.\n\n\/\/ setup\n   if ( ! Initialize() )\n      return;\n\n\/\/ obtain a reference to look for new classes later\n   PyObject* old = PyDict_Values( gMainDict );\n\n\/\/ actual execution\n   Exec( (std::string( \"execfile(\\\"\" ) + name + \"\\\")\").c_str() );\n\n\/\/ obtain new __main__ contents\n   PyObject* current = PyDict_Values( gMainDict );\n\n\/\/ create CINT classes for all new python classes\n   for ( int i = 0; i < PyList_GET_SIZE( current ); ++i ) {\n      PyObject* value = PyList_GET_ITEM( current, i );\n      Py_INCREF( value );\n\n      if ( ! PySequence_Contains( old, value ) ) {\n      \/\/ collect classes\n         if ( PyClass_Check( value ) ||\n              PyObject_HasAttrString( value, const_cast< char* >( \"__bases__\" ) ) ) {\n         \/\/ force class creation\n            PyObject* str = PyObject_Str( value );\n            gROOT->GetClass( PyString_AS_STRING( str ) );\n            Py_DECREF( str );\n         }\n      }\n\n      Py_DECREF( value );\n   }\n\n   Py_DECREF( current );\n   Py_DECREF( old );\n}\n\n\/\/____________________________________________________________________________\nvoid TPython::ExecScript( const char* name, int argc, const char** argv )\n{\n\/\/ Execute a python stand-alone script, with argv CLI arguments.\n\/\/\n\/\/ example of use:\n\/\/    const char* argv[] = { \"1\", \"2\", \"3\" };\n\/\/    TPython::ExecScript( \"test.py\", sizeof(argv)\/sizeof(argv[0]), argv );\n\n\n\/\/ setup\n   if ( ! Initialize() )\n      return;\n\n\/\/ verify arguments\n   if ( ! name ) {\n      std::cerr << \"Error: no file name specified.\" << std::endl;\n      return;\n   }\n\n   FILE* fp = fopen( name, \"r\" );\n   if ( ! fp ) {\n      std::cerr << \"Error: could not open file \\\"\" << name << \"\\\".\" << std::endl;\n      return;\n   }\n\n\/\/ setup command line part\n   PyObject* oldargv = PySys_GetObject( const_cast< char* >( \"argv\" ) );\n   if ( ! oldargv )                               \/\/ e.g. apache\n      PyErr_Clear();\n   else {\n      PyObject* l = PyList_New( PyList_GET_SIZE( oldargv ) );\n      for ( int i = 1; i < PyList_GET_SIZE( oldargv ); ++i ) {\n         PyObject* item = PyList_GET_ITEM( oldargv, i );\n         Py_INCREF( item );\n         PyList_SET_ITEM( l, i, item );           \/\/ steals ref\n      }\n      oldargv = l;\n   }\n\n   argc += 1;\n   const char** argv2 = new const char*[ argc ];\n   for ( int i = 1; i < argc; ++i ) argv2[ i ] = argv[ i-1 ];\n   argv2[ 0 ] = Py_GetProgramName();\n   PySys_SetArgv( argc, const_cast< char** >( argv2 ) );\n   delete argv2;\n\n\/\/ actual script execution\n   PyObject* gbl = PyDict_Copy( gMainDict );\n   PyObject* result = PyRun_FileEx( fp, name, Py_file_input, gbl, gbl, 1 \/* close fp *\/ );\n   if ( ! result )\n      PyErr_Print();\n   Py_XDECREF( result );\n   Py_DECREF( gbl );\n\n\/\/ restore original command line\n   PySys_SetObject( const_cast< char* >( \"argv\" ), oldargv );\n   Py_XDECREF( oldargv );\n}\n\n\/\/____________________________________________________________________________\nvoid TPython::Exec( const char* cmd )\n{\n\/\/ Execute a python statement (e.g. \"import ROOT\").\n\n\/\/ setup\n   if ( ! Initialize() )\n      return;\n\n\/\/ execute the command\n   PyObject* result =\n      PyRun_String( const_cast< char* >( cmd ), Py_file_input, gMainDict, gMainDict );\n\n\/\/ test for error\n   if ( result )\n      Py_DECREF( result );\n   else\n      PyErr_Print();\n}\n\n\n\/\/____________________________________________________________________________\nconst TPyReturn TPython::Eval( const char* expr )\n{\n\/\/ Evaluate a python expression (e.g. \"ROOT.TBrowser()\").\n\/\/\n\/\/ Caution: do not hold on to the return value: either store it in a builtin\n\/\/ type (implicit casting will work), or in a pointer to a ROOT object (explicit\n\/\/ casting to a void* is required).\n\n\/\/ setup\n   if ( ! Initialize() )\n      return TPyReturn();\n\n\/\/ evaluate the expression\n   PyObject* result =\n      PyRun_String( const_cast< char* >( expr ), Py_eval_input, gMainDict, gMainDict );\n\n\/\/ report errors as appropriate; return void\n   if ( ! result ) {\n      PyErr_Print();\n      return TPyReturn();\n   }\n\n\/\/ results that require no converion\n   if ( result == Py_None || PyROOT::ObjectProxy_Check( result ) )\n      return TPyReturn( result );\n\n\/\/ explicit conversion for python type required\n   PyObject* pyclass = PyObject_GetAttr( result, gClassString );\n   if ( pyclass != 0 ) {\n   \/\/ retrieve class name and the module in which it resides\n      PyObject* name = PyObject_GetAttr( pyclass, gNameString );\n      PyObject* module = PyObject_GetAttr( pyclass, gModuleString );\n\n   \/\/ concat name\n      std::string qname =\n         std::string( PyString_AS_STRING( module ) ) + '.' + PyString_AS_STRING( name );\n      Py_DECREF( module );\n      Py_DECREF( name );\n      Py_DECREF( pyclass );\n\n   \/\/ locate ROOT style class with this name\n      TClass* klass = gROOT->GetClass( qname.c_str() );\n\n   \/\/ construct general ROOT python object that pretents to be of class 'klass'\n      if ( klass != 0 )\n         return TPyReturn( result );\n   } else\n      PyErr_Clear();\n\n\/\/ no conversion, return null pointer object\n   Py_DECREF( result );\n   return TPyReturn();\n}\n\n\/\/____________________________________________________________________________\nBool_t TPython::Bind( TObject* object, const char* label )\n{\n\/\/ Bind a ROOT object with, at the python side, the name \"label\".\n\n\/\/ check given address and setup\n   if ( ! ( object && Initialize() ) )\n      return kFALSE;\n\n\/\/ bind object in the main namespace\n   TClass* klass = object->IsA();\n   if ( klass != 0 ) {\n      PyObject* bound = PyROOT::BindRootObject( (void*)object, klass );\n\n      if ( bound ) {\n         Bool_t bOk = PyDict_SetItemString( gMainDict, const_cast< char* >( label ), bound ) == 0;\n         Py_DECREF( bound );\n\n         return bOk;\n      }\n   }\n\n   return kFALSE;\n}\n\n\/\/____________________________________________________________________________\nvoid TPython::Prompt() {\n\/\/ Enter an interactive python session (exit with ^D). State is preserved\n\/\/ between successive calls.\n\n\/\/ setup\n   if ( ! Initialize() ) {\n      return;\n   }\n\n\/\/ enter i\/o interactive mode\n   PyRun_InteractiveLoop( stdin, const_cast< char* >( \"\\0\" ) );\n}\n<commit_msg>From Wim:  o) add const_cast for PyRun_FileEx to be compatible with python2.2<commit_after>\/\/ @(#)root\/pyroot:$Name:  $:$Id: TPython.cxx,v 1.15 2006\/06\/14 13:52:01 brun Exp $\n\/\/ Author: Wim Lavrijsen, Apr 2004\n\n\/\/ Bindings\n#include \"PyROOT.h\"\n#include \"TPython.h\"\n#include \"ObjectProxy.h\"\n#include \"RootWrapper.h\"\n#include \"TPyClassGenerator.h\"\n\n\/\/ ROOT\n#include \"TROOT.h\"\n#include \"TObject.h\"\n\n\/\/ Standard\n#include <stdio.h>\n#include <Riostream.h>\n#include <string>\n\n\/\/______________________________________________________________________________\n\/\/                          Python interpreter access\n\/\/                          =========================\n\/\/\n\/\/ The TPython class allows for access to python objects from CINT. The current\n\/\/ functionality is only basic: ROOT objects and builtin types can freely cross\n\/\/ the boundary between the two interpreters, python objects can be instantiated\n\/\/ and their methods can be called. All other cross-coding is based on strings\n\/\/ that are run on the python interpreter.\n\/\/\n\/\/ Examples:\n\/\/\n\/\/  $ cat MyPyClass.py\n\/\/  print 'creating class MyPyClass ... '\n\/\/\n\/\/  class MyPyClass:\n\/\/     def __init__( self ):\n\/\/        print 'in MyPyClass.__init__'\n\/\/\n\/\/     def gime( self, what ):\n\/\/        return what\n\/\/\n\/\/  $ root -l\n\/\/  \/\/ Execute a string of python code.\n\/\/  root [0] TPython::Exec( \"print \\'Hello World!\\'\" );\n\/\/  Hello World!\n\/\/\n\/\/  \/\/ Create a TBrowser on the python side, and transfer it back and forth.\n\/\/  \/\/ Note the required explicit (void*) cast!\n\/\/  root [1] TBrowser* b = (void*)TPython::Eval( \"ROOT.TBrowser()\" );\n\/\/  root [2] TPython::Bind( b, \"b\" );\n\/\/  root [3] b == (void*) TPython::Eval( \"b\" )\n\/\/  (int)1\n\/\/\n\/\/  \/\/ Builtin variables can cross-over by using implicit casts.\n\/\/  root [4] int i = TPython::Eval( \"1 + 1\" );\n\/\/  root [5] i\n\/\/  (int)2\n\/\/\n\/\/  \/\/ Load a python module with a class definition, and use it.\n\/\/  root [6] TPython::LoadMacro( \"MyPyClass.py\" );\n\/\/  creating class MyPyClass ...\n\/\/  root [7] MyPyClass m;\n\/\/  in MyPyClass.__init__\n\/\/  root [8] char* s = m.gime( \"aap\" );\n\/\/  root [9] s\n\/\/  (char* 0x41ee7754)\"aap\"\n\/\/\n\/\/ It is possible to switch between interpreters by calling \"TPython::Prompt()\"\n\/\/ on the CINT side, while returning with ^D (EOF). State is preserved between\n\/\/ successive switches.\n\n\n\/\/- data ---------------------------------------------------------------------\nClassImp(TPython)\n\nnamespace {\n\n   PyObject* gMainDict = 0;\n\n   PyObject* gClassString  = 0;\n   PyObject* gNameString   = 0;\n   PyObject* gModuleString = 0;\n\n} \/\/ unnamed namespace\n\n\n\/\/- static public members ----------------------------------------------------\nBool_t TPython::Initialize()\n{\n\/\/ Private initialization method: setup the python interpreter and load the\n\/\/ ROOT module.\n\n   static Bool_t isInitialized = kFALSE;\n   if ( isInitialized )\n      return kTRUE;\n\n   if ( ! Py_IsInitialized() ) {\n   \/\/ this happens if CINT comes in first\n      PyEval_InitThreads();\n      Py_Initialize();\n\n   \/\/ try again\n      if ( ! Py_IsInitialized() ) {\n      \/\/ give up ...\n         std::cerr << \"Error: python has not been intialized; returning.\" << std::endl;           \n         return kFALSE;\n      }\n\n   \/\/ set argv\n      char* argv[] = { const_cast< char* >( \"root\" ) };\n      PySys_SetArgv( sizeof(argv)\/sizeof(argv[0]), argv );\n\n   \/\/ force loading of ROOT\n      PyRun_SimpleString( const_cast< char* >( \"import ROOT\" ) );\n   }\n\n   if ( ! gMainDict ) {\n   \/\/ initialize some handy strings\n      gClassString  = PyString_FromString( \"__class__\" );\n      gNameString   = PyString_FromString( \"__name__\" );\n      gModuleString = PyString_FromString( \"__module__\" );\n\n   \/\/ retrieve the main dictionary\n      gMainDict = PyModule_GetDict(\n         PyImport_AddModule( const_cast< char* >( \"__main__\" ) ) );\n      Py_INCREF( gMainDict );\n   }\n\n\/\/ python side class construction, managed by ROOT\n   gROOT->AddClassGenerator( new TPyClassGenerator );\n\n\/\/ declare success ...\n   isInitialized = kTRUE;\n   return kTRUE;\n}\n\n\/\/____________________________________________________________________________\nvoid TPython::LoadMacro( const char* name )\n{\n\/\/ Execute the give python script as if it were a macro (effectively an\n\/\/ execfile in __main__), and create CINT equivalents for any newly available\n\/\/ python classes.\n\n\/\/ setup\n   if ( ! Initialize() )\n      return;\n\n\/\/ obtain a reference to look for new classes later\n   PyObject* old = PyDict_Values( gMainDict );\n\n\/\/ actual execution\n   Exec( (std::string( \"execfile(\\\"\" ) + name + \"\\\")\").c_str() );\n\n\/\/ obtain new __main__ contents\n   PyObject* current = PyDict_Values( gMainDict );\n\n\/\/ create CINT classes for all new python classes\n   for ( int i = 0; i < PyList_GET_SIZE( current ); ++i ) {\n      PyObject* value = PyList_GET_ITEM( current, i );\n      Py_INCREF( value );\n\n      if ( ! PySequence_Contains( old, value ) ) {\n      \/\/ collect classes\n         if ( PyClass_Check( value ) ||\n              PyObject_HasAttrString( value, const_cast< char* >( \"__bases__\" ) ) ) {\n         \/\/ force class creation\n            PyObject* str = PyObject_Str( value );\n            gROOT->GetClass( PyString_AS_STRING( str ) );\n            Py_DECREF( str );\n         }\n      }\n\n      Py_DECREF( value );\n   }\n\n   Py_DECREF( current );\n   Py_DECREF( old );\n}\n\n\/\/____________________________________________________________________________\nvoid TPython::ExecScript( const char* name, int argc, const char** argv )\n{\n\/\/ Execute a python stand-alone script, with argv CLI arguments.\n\/\/\n\/\/ example of use:\n\/\/    const char* argv[] = { \"1\", \"2\", \"3\" };\n\/\/    TPython::ExecScript( \"test.py\", sizeof(argv)\/sizeof(argv[0]), argv );\n\n\n\/\/ setup\n   if ( ! Initialize() )\n      return;\n\n\/\/ verify arguments\n   if ( ! name ) {\n      std::cerr << \"Error: no file name specified.\" << std::endl;\n      return;\n   }\n\n   FILE* fp = fopen( name, \"r\" );\n   if ( ! fp ) {\n      std::cerr << \"Error: could not open file \\\"\" << name << \"\\\".\" << std::endl;\n      return;\n   }\n\n\/\/ setup command line part\n   PyObject* oldargv = PySys_GetObject( const_cast< char* >( \"argv\" ) );\n   if ( ! oldargv )                               \/\/ e.g. apache\n      PyErr_Clear();\n   else {\n      PyObject* l = PyList_New( PyList_GET_SIZE( oldargv ) );\n      for ( int i = 1; i < PyList_GET_SIZE( oldargv ); ++i ) {\n         PyObject* item = PyList_GET_ITEM( oldargv, i );\n         Py_INCREF( item );\n         PyList_SET_ITEM( l, i, item );           \/\/ steals ref\n      }\n      oldargv = l;\n   }\n\n   argc += 1;\n   const char** argv2 = new const char*[ argc ];\n   for ( int i = 1; i < argc; ++i ) argv2[ i ] = argv[ i-1 ];\n   argv2[ 0 ] = Py_GetProgramName();\n   PySys_SetArgv( argc, const_cast< char** >( argv2 ) );\n   delete argv2;\n\n\/\/ actual script execution\n   PyObject* gbl = PyDict_Copy( gMainDict );\n   PyObject* result =   \/\/ PyRun_FileEx closes fp (b\/c of last argument \"1\")\n      PyRun_FileEx( fp, const_cast< char* >( name ), Py_file_input, gbl, gbl, 1 );\n   if ( ! result )\n      PyErr_Print();\n   Py_XDECREF( result );\n   Py_DECREF( gbl );\n\n\/\/ restore original command line\n   PySys_SetObject( const_cast< char* >( \"argv\" ), oldargv );\n   Py_XDECREF( oldargv );\n}\n\n\/\/____________________________________________________________________________\nvoid TPython::Exec( const char* cmd )\n{\n\/\/ Execute a python statement (e.g. \"import ROOT\").\n\n\/\/ setup\n   if ( ! Initialize() )\n      return;\n\n\/\/ execute the command\n   PyObject* result =\n      PyRun_String( const_cast< char* >( cmd ), Py_file_input, gMainDict, gMainDict );\n\n\/\/ test for error\n   if ( result )\n      Py_DECREF( result );\n   else\n      PyErr_Print();\n}\n\n\n\/\/____________________________________________________________________________\nconst TPyReturn TPython::Eval( const char* expr )\n{\n\/\/ Evaluate a python expression (e.g. \"ROOT.TBrowser()\").\n\/\/\n\/\/ Caution: do not hold on to the return value: either store it in a builtin\n\/\/ type (implicit casting will work), or in a pointer to a ROOT object (explicit\n\/\/ casting to a void* is required).\n\n\/\/ setup\n   if ( ! Initialize() )\n      return TPyReturn();\n\n\/\/ evaluate the expression\n   PyObject* result =\n      PyRun_String( const_cast< char* >( expr ), Py_eval_input, gMainDict, gMainDict );\n\n\/\/ report errors as appropriate; return void\n   if ( ! result ) {\n      PyErr_Print();\n      return TPyReturn();\n   }\n\n\/\/ results that require no converion\n   if ( result == Py_None || PyROOT::ObjectProxy_Check( result ) )\n      return TPyReturn( result );\n\n\/\/ explicit conversion for python type required\n   PyObject* pyclass = PyObject_GetAttr( result, gClassString );\n   if ( pyclass != 0 ) {\n   \/\/ retrieve class name and the module in which it resides\n      PyObject* name = PyObject_GetAttr( pyclass, gNameString );\n      PyObject* module = PyObject_GetAttr( pyclass, gModuleString );\n\n   \/\/ concat name\n      std::string qname =\n         std::string( PyString_AS_STRING( module ) ) + '.' + PyString_AS_STRING( name );\n      Py_DECREF( module );\n      Py_DECREF( name );\n      Py_DECREF( pyclass );\n\n   \/\/ locate ROOT style class with this name\n      TClass* klass = gROOT->GetClass( qname.c_str() );\n\n   \/\/ construct general ROOT python object that pretents to be of class 'klass'\n      if ( klass != 0 )\n         return TPyReturn( result );\n   } else\n      PyErr_Clear();\n\n\/\/ no conversion, return null pointer object\n   Py_DECREF( result );\n   return TPyReturn();\n}\n\n\/\/____________________________________________________________________________\nBool_t TPython::Bind( TObject* object, const char* label )\n{\n\/\/ Bind a ROOT object with, at the python side, the name \"label\".\n\n\/\/ check given address and setup\n   if ( ! ( object && Initialize() ) )\n      return kFALSE;\n\n\/\/ bind object in the main namespace\n   TClass* klass = object->IsA();\n   if ( klass != 0 ) {\n      PyObject* bound = PyROOT::BindRootObject( (void*)object, klass );\n\n      if ( bound ) {\n         Bool_t bOk = PyDict_SetItemString( gMainDict, const_cast< char* >( label ), bound ) == 0;\n         Py_DECREF( bound );\n\n         return bOk;\n      }\n   }\n\n   return kFALSE;\n}\n\n\/\/____________________________________________________________________________\nvoid TPython::Prompt() {\n\/\/ Enter an interactive python session (exit with ^D). State is preserved\n\/\/ between successive calls.\n\n\/\/ setup\n   if ( ! Initialize() ) {\n      return;\n   }\n\n\/\/ enter i\/o interactive mode\n   PyRun_InteractiveLoop( stdin, const_cast< char* >( \"\\0\" ) );\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <eosio\/chain\/webassembly\/interface.hpp>\n\n#include <compiler_builtins.hpp>\n#include <softfloat.hpp>\n\n#include <fc\/uint128.hpp>\n\nnamespace eosio { namespace chain { namespace webassembly {\n   inline static constexpr uint32_t SHIFT_WIDTH = (sizeof(uint64_t)*8)-1;\n\n   void interface::__ashlti3(legacy_ptr<__int128> ret, uint64_t low, uint64_t high, uint32_t shift) const {\n      fc::uint128_t i(high, low);\n      i <<= shift;\n      *ret = (unsigned __int128)i;\n   }\n\n   void interface::__ashrti3(legacy_ptr<__int128> ret, uint64_t low, uint64_t high, uint32_t shift) const {\n      \/\/ retain the signedness\n      *ret = high;\n      *ret <<= 64;\n      *ret |= low;\n      *ret >>= shift;\n   }\n\n   void interface::__lshlti3(legacy_ptr<__int128> ret, uint64_t low, uint64_t high, uint32_t shift) const {\n      fc::uint128_t i(high, low);\n      i <<= shift;\n      *ret = (unsigned __int128)i;\n   }\n\n   void interface::__lshrti3(legacy_ptr<__int128> ret, uint64_t low, uint64_t high, uint32_t shift) const {\n      fc::uint128_t i(high, low);\n      i >>= shift;\n      *ret = (unsigned __int128)i;\n   }\n\n   void interface::__divti3(legacy_ptr<__int128> ret, uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb) const {\n      __int128 lhs = ha;\n      __int128 rhs = hb;\n\n      lhs <<= 64;\n      lhs |=  la;\n\n      rhs <<= 64;\n      rhs |=  lb;\n\n      EOS_ASSERT(rhs != 0, arithmetic_exception, \"divide by zero\");\n\n      lhs \/= rhs;\n\n      *ret = lhs;\n   }\n\n   void interface::__udivti3(legacy_ptr<unsigned __int128> ret, uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb) const {\n      unsigned __int128 lhs = ha;\n      unsigned __int128 rhs = hb;\n\n      lhs <<= 64;\n      lhs |=  la;\n\n      rhs <<= 64;\n      rhs |=  lb;\n\n      EOS_ASSERT(rhs != 0, arithmetic_exception, \"divide by zero\");\n\n      lhs \/= rhs;\n      *ret = lhs;\n   }\n\n   void interface::__multi3(legacy_ptr<__int128> ret, uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb) const {\n      __int128 lhs = ha;\n      __int128 rhs = hb;\n\n      lhs <<= 64;\n      lhs |=  la;\n\n      rhs <<= 64;\n      rhs |=  lb;\n\n      lhs *= rhs;\n      *ret = lhs;\n   }\n\n   void interface::__modti3(legacy_ptr<__int128> ret, uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb) const {\n      __int128 lhs = ha;\n      __int128 rhs = hb;\n\n      lhs <<= 64;\n      lhs |=  la;\n\n      rhs <<= 64;\n      rhs |=  lb;\n\n      EOS_ASSERT(rhs != 0, arithmetic_exception, \"divide by zero\");\n\n      lhs %= rhs;\n      *ret = lhs;\n   }\n\n   void interface::__umodti3(legacy_ptr<unsigned __int128> ret, uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb) const {\n      unsigned __int128 lhs = ha;\n      unsigned __int128 rhs = hb;\n\n      lhs <<= 64;\n      lhs |=  la;\n\n      rhs <<= 64;\n      rhs |=  lb;\n\n      EOS_ASSERT(rhs != 0, arithmetic_exception, \"divide by zero\");\n\n      lhs %= rhs;\n      *ret = lhs;\n   }\n\n   \/\/ arithmetic long double\n   void interface::__addtf3( legacy_ptr<float128_t> ret, uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb ) const {\n      float128_t a = {{ la, ha }};\n      float128_t b = {{ lb, hb }};\n      *ret = f128_add( a, b );\n   }\n   void interface::__subtf3( legacy_ptr<float128_t> ret, uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb ) const {\n      float128_t a = {{ la, ha }};\n      float128_t b = {{ lb, hb }};\n      *ret = f128_sub( a, b );\n   }\n   void interface::__multf3( legacy_ptr<float128_t> ret, uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb ) const {\n      float128_t a = {{ la, ha }};\n      float128_t b = {{ lb, hb }};\n      *ret = f128_mul( a, b );\n   }\n   void interface::__divtf3( legacy_ptr<float128_t> ret, uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb ) const {\n      float128_t a = {{ la, ha }};\n      float128_t b = {{ lb, hb }};\n      *ret = f128_div( a, b );\n   }\n   void interface::__negtf2( legacy_ptr<float128_t> ret, uint64_t la, uint64_t ha ) const {\n      *ret = {{ la, (ha ^ (uint64_t)1 << 63) }};\n   }\n\n   \/\/ conversion long double\n   void interface::__extendsftf2( legacy_ptr<float128_t> ret, float f ) const {\n      *ret = f32_to_f128( to_softfloat32(f) );\n   }\n   void interface::__extenddftf2( legacy_ptr<float128_t> ret, double d ) const {\n      *ret = f64_to_f128( to_softfloat64(d) );\n   }\n   double interface::__trunctfdf2( uint64_t l, uint64_t h ) const {\n      float128_t f = {{ l, h }};\n      return from_softfloat64(f128_to_f64( f ));\n   }\n   float interface::__trunctfsf2( uint64_t l, uint64_t h ) const {\n      float128_t f = {{ l, h }};\n      return from_softfloat32(f128_to_f32( f ));\n   }\n   int32_t interface::__fixtfsi( uint64_t l, uint64_t h ) const {\n      float128_t f = {{ l, h }};\n      return f128_to_i32( f, 0, false );\n   }\n   int64_t interface::__fixtfdi( uint64_t l, uint64_t h ) const {\n      float128_t f = {{ l, h }};\n      return f128_to_i64( f, 0, false );\n   }\n   void interface::__fixtfti( legacy_ptr<__int128> ret, uint64_t l, uint64_t h ) const {\n      float128_t f = {{ l, h }};\n      *ret = ___fixtfti( f );\n   }\n   uint32_t interface::__fixunstfsi( uint64_t l, uint64_t h ) const {\n      float128_t f = {{ l, h }};\n      return f128_to_ui32( f, 0, false );\n   }\n   uint64_t interface::__fixunstfdi( uint64_t l, uint64_t h ) const {\n      float128_t f = {{ l, h }};\n      return f128_to_ui64( f, 0, false );\n   }\n   void interface::__fixunstfti( legacy_ptr<unsigned __int128> ret, uint64_t l, uint64_t h ) const {\n      float128_t f = {{ l, h }};\n      *ret = ___fixunstfti( f );\n   }\n   void interface::__fixsfti( legacy_ptr<__int128> ret, float a ) const {\n      *ret = ___fixsfti( to_softfloat32(a).v );\n   }\n   void interface::__fixdfti( legacy_ptr<__int128> ret, double a ) const {\n      *ret = ___fixdfti( to_softfloat64(a).v );\n   }\n   void interface::__fixunssfti( legacy_ptr<unsigned __int128> ret, float a ) const {\n      *ret = ___fixunssfti( to_softfloat32(a).v );\n   }\n   void interface::__fixunsdfti( legacy_ptr<unsigned __int128> ret, double a ) const {\n      *ret = ___fixunsdfti( to_softfloat64(a).v );\n   }\n   double interface::__floatsidf( int32_t i ) const {\n      return from_softfloat64(i32_to_f64(i));\n   }\n   void interface::__floatsitf( legacy_ptr<float128_t> ret, int32_t i ) const {\n      *ret = i32_to_f128(i);\n   }\n   void interface::__floatditf( legacy_ptr<float128_t> ret, uint64_t a ) const {\n      *ret = i64_to_f128( a );\n   }\n   void interface::__floatunsitf( legacy_ptr<float128_t> ret, uint32_t i ) const {\n      *ret = ui32_to_f128(i);\n   }\n   void interface::__floatunditf( legacy_ptr<float128_t> ret, uint64_t a ) const {\n      *ret = ui64_to_f128( a );\n   }\n   double interface::__floattidf( uint64_t l, uint64_t h ) const {\n      fc::uint128_t v(h, l);\n      unsigned __int128 val = (unsigned __int128)v;\n      return ___floattidf( *(__int128*)&val );\n   }\n   double interface::__floatuntidf( uint64_t l, uint64_t h ) const {\n      fc::uint128_t v(h, l);\n      return ___floatuntidf( (unsigned __int128)v );\n   }\n\n   inline static int cmptf2_impl( const interface& i, uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb, int return_value_if_nan ) {\n      float128_t a = {{ la, ha }};\n      float128_t b = {{ lb, hb }};\n      if ( i.__unordtf2(la, ha, lb, hb) )\n         return return_value_if_nan;\n      if ( f128_lt( a, b ) )\n         return -1;\n      if ( f128_eq( a, b ) )\n         return 0;\n      return 1;\n   }\n   int interface::__eqtf2( uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb ) const {\n      return cmptf2_impl(*this, la, ha, lb, hb, 1);\n   }\n   int interface::__netf2( uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb ) const {\n      return cmptf2_impl(*this, la, ha, lb, hb, 1);\n   }\n   int interface::__getf2( uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb ) const {\n      return cmptf2_impl(*this, la, ha, lb, hb, -1);\n   }\n   int interface::__gttf2( uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb ) const {\n      return cmptf2_impl(*this, la, ha, lb, hb, 0);\n   }\n   int interface::__letf2( uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb ) const {\n      return cmptf2_impl(*this, la, ha, lb, hb, 1);\n   }\n   int interface::__lttf2( uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb ) const {\n      return cmptf2_impl(*this, la, ha, lb, hb, 0);\n   }\n   int interface::__cmptf2( uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb ) const {\n      return cmptf2_impl(*this, la, ha, lb, hb, 1);\n   }\n   int interface::__unordtf2( uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb ) const {\n      float128_t a = {{ la, ha }};\n      float128_t b = {{ lb, hb }};\n      if ( f128_is_nan(a) || f128_is_nan(b) )\n         return 1;\n      return 0;\n   }\n}}} \/\/ ns eosio::chain::webassembly\n<commit_msg>Remove unused constant<commit_after>#include <eosio\/chain\/webassembly\/interface.hpp>\n\n#include <compiler_builtins.hpp>\n#include <softfloat.hpp>\n\n#include <fc\/uint128.hpp>\n\nnamespace eosio { namespace chain { namespace webassembly {\n\n   void interface::__ashlti3(legacy_ptr<__int128> ret, uint64_t low, uint64_t high, uint32_t shift) const {\n      fc::uint128_t i(high, low);\n      i <<= shift;\n      *ret = (unsigned __int128)i;\n   }\n\n   void interface::__ashrti3(legacy_ptr<__int128> ret, uint64_t low, uint64_t high, uint32_t shift) const {\n      \/\/ retain the signedness\n      *ret = high;\n      *ret <<= 64;\n      *ret |= low;\n      *ret >>= shift;\n   }\n\n   void interface::__lshlti3(legacy_ptr<__int128> ret, uint64_t low, uint64_t high, uint32_t shift) const {\n      fc::uint128_t i(high, low);\n      i <<= shift;\n      *ret = (unsigned __int128)i;\n   }\n\n   void interface::__lshrti3(legacy_ptr<__int128> ret, uint64_t low, uint64_t high, uint32_t shift) const {\n      fc::uint128_t i(high, low);\n      i >>= shift;\n      *ret = (unsigned __int128)i;\n   }\n\n   void interface::__divti3(legacy_ptr<__int128> ret, uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb) const {\n      __int128 lhs = ha;\n      __int128 rhs = hb;\n\n      lhs <<= 64;\n      lhs |=  la;\n\n      rhs <<= 64;\n      rhs |=  lb;\n\n      EOS_ASSERT(rhs != 0, arithmetic_exception, \"divide by zero\");\n\n      lhs \/= rhs;\n\n      *ret = lhs;\n   }\n\n   void interface::__udivti3(legacy_ptr<unsigned __int128> ret, uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb) const {\n      unsigned __int128 lhs = ha;\n      unsigned __int128 rhs = hb;\n\n      lhs <<= 64;\n      lhs |=  la;\n\n      rhs <<= 64;\n      rhs |=  lb;\n\n      EOS_ASSERT(rhs != 0, arithmetic_exception, \"divide by zero\");\n\n      lhs \/= rhs;\n      *ret = lhs;\n   }\n\n   void interface::__multi3(legacy_ptr<__int128> ret, uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb) const {\n      __int128 lhs = ha;\n      __int128 rhs = hb;\n\n      lhs <<= 64;\n      lhs |=  la;\n\n      rhs <<= 64;\n      rhs |=  lb;\n\n      lhs *= rhs;\n      *ret = lhs;\n   }\n\n   void interface::__modti3(legacy_ptr<__int128> ret, uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb) const {\n      __int128 lhs = ha;\n      __int128 rhs = hb;\n\n      lhs <<= 64;\n      lhs |=  la;\n\n      rhs <<= 64;\n      rhs |=  lb;\n\n      EOS_ASSERT(rhs != 0, arithmetic_exception, \"divide by zero\");\n\n      lhs %= rhs;\n      *ret = lhs;\n   }\n\n   void interface::__umodti3(legacy_ptr<unsigned __int128> ret, uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb) const {\n      unsigned __int128 lhs = ha;\n      unsigned __int128 rhs = hb;\n\n      lhs <<= 64;\n      lhs |=  la;\n\n      rhs <<= 64;\n      rhs |=  lb;\n\n      EOS_ASSERT(rhs != 0, arithmetic_exception, \"divide by zero\");\n\n      lhs %= rhs;\n      *ret = lhs;\n   }\n\n   \/\/ arithmetic long double\n   void interface::__addtf3( legacy_ptr<float128_t> ret, uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb ) const {\n      float128_t a = {{ la, ha }};\n      float128_t b = {{ lb, hb }};\n      *ret = f128_add( a, b );\n   }\n   void interface::__subtf3( legacy_ptr<float128_t> ret, uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb ) const {\n      float128_t a = {{ la, ha }};\n      float128_t b = {{ lb, hb }};\n      *ret = f128_sub( a, b );\n   }\n   void interface::__multf3( legacy_ptr<float128_t> ret, uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb ) const {\n      float128_t a = {{ la, ha }};\n      float128_t b = {{ lb, hb }};\n      *ret = f128_mul( a, b );\n   }\n   void interface::__divtf3( legacy_ptr<float128_t> ret, uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb ) const {\n      float128_t a = {{ la, ha }};\n      float128_t b = {{ lb, hb }};\n      *ret = f128_div( a, b );\n   }\n   void interface::__negtf2( legacy_ptr<float128_t> ret, uint64_t la, uint64_t ha ) const {\n      *ret = {{ la, (ha ^ (uint64_t)1 << 63) }};\n   }\n\n   \/\/ conversion long double\n   void interface::__extendsftf2( legacy_ptr<float128_t> ret, float f ) const {\n      *ret = f32_to_f128( to_softfloat32(f) );\n   }\n   void interface::__extenddftf2( legacy_ptr<float128_t> ret, double d ) const {\n      *ret = f64_to_f128( to_softfloat64(d) );\n   }\n   double interface::__trunctfdf2( uint64_t l, uint64_t h ) const {\n      float128_t f = {{ l, h }};\n      return from_softfloat64(f128_to_f64( f ));\n   }\n   float interface::__trunctfsf2( uint64_t l, uint64_t h ) const {\n      float128_t f = {{ l, h }};\n      return from_softfloat32(f128_to_f32( f ));\n   }\n   int32_t interface::__fixtfsi( uint64_t l, uint64_t h ) const {\n      float128_t f = {{ l, h }};\n      return f128_to_i32( f, 0, false );\n   }\n   int64_t interface::__fixtfdi( uint64_t l, uint64_t h ) const {\n      float128_t f = {{ l, h }};\n      return f128_to_i64( f, 0, false );\n   }\n   void interface::__fixtfti( legacy_ptr<__int128> ret, uint64_t l, uint64_t h ) const {\n      float128_t f = {{ l, h }};\n      *ret = ___fixtfti( f );\n   }\n   uint32_t interface::__fixunstfsi( uint64_t l, uint64_t h ) const {\n      float128_t f = {{ l, h }};\n      return f128_to_ui32( f, 0, false );\n   }\n   uint64_t interface::__fixunstfdi( uint64_t l, uint64_t h ) const {\n      float128_t f = {{ l, h }};\n      return f128_to_ui64( f, 0, false );\n   }\n   void interface::__fixunstfti( legacy_ptr<unsigned __int128> ret, uint64_t l, uint64_t h ) const {\n      float128_t f = {{ l, h }};\n      *ret = ___fixunstfti( f );\n   }\n   void interface::__fixsfti( legacy_ptr<__int128> ret, float a ) const {\n      *ret = ___fixsfti( to_softfloat32(a).v );\n   }\n   void interface::__fixdfti( legacy_ptr<__int128> ret, double a ) const {\n      *ret = ___fixdfti( to_softfloat64(a).v );\n   }\n   void interface::__fixunssfti( legacy_ptr<unsigned __int128> ret, float a ) const {\n      *ret = ___fixunssfti( to_softfloat32(a).v );\n   }\n   void interface::__fixunsdfti( legacy_ptr<unsigned __int128> ret, double a ) const {\n      *ret = ___fixunsdfti( to_softfloat64(a).v );\n   }\n   double interface::__floatsidf( int32_t i ) const {\n      return from_softfloat64(i32_to_f64(i));\n   }\n   void interface::__floatsitf( legacy_ptr<float128_t> ret, int32_t i ) const {\n      *ret = i32_to_f128(i);\n   }\n   void interface::__floatditf( legacy_ptr<float128_t> ret, uint64_t a ) const {\n      *ret = i64_to_f128( a );\n   }\n   void interface::__floatunsitf( legacy_ptr<float128_t> ret, uint32_t i ) const {\n      *ret = ui32_to_f128(i);\n   }\n   void interface::__floatunditf( legacy_ptr<float128_t> ret, uint64_t a ) const {\n      *ret = ui64_to_f128( a );\n   }\n   double interface::__floattidf( uint64_t l, uint64_t h ) const {\n      fc::uint128_t v(h, l);\n      unsigned __int128 val = (unsigned __int128)v;\n      return ___floattidf( *(__int128*)&val );\n   }\n   double interface::__floatuntidf( uint64_t l, uint64_t h ) const {\n      fc::uint128_t v(h, l);\n      return ___floatuntidf( (unsigned __int128)v );\n   }\n\n   inline static int cmptf2_impl( const interface& i, uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb, int return_value_if_nan ) {\n      float128_t a = {{ la, ha }};\n      float128_t b = {{ lb, hb }};\n      if ( i.__unordtf2(la, ha, lb, hb) )\n         return return_value_if_nan;\n      if ( f128_lt( a, b ) )\n         return -1;\n      if ( f128_eq( a, b ) )\n         return 0;\n      return 1;\n   }\n   int interface::__eqtf2( uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb ) const {\n      return cmptf2_impl(*this, la, ha, lb, hb, 1);\n   }\n   int interface::__netf2( uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb ) const {\n      return cmptf2_impl(*this, la, ha, lb, hb, 1);\n   }\n   int interface::__getf2( uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb ) const {\n      return cmptf2_impl(*this, la, ha, lb, hb, -1);\n   }\n   int interface::__gttf2( uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb ) const {\n      return cmptf2_impl(*this, la, ha, lb, hb, 0);\n   }\n   int interface::__letf2( uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb ) const {\n      return cmptf2_impl(*this, la, ha, lb, hb, 1);\n   }\n   int interface::__lttf2( uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb ) const {\n      return cmptf2_impl(*this, la, ha, lb, hb, 0);\n   }\n   int interface::__cmptf2( uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb ) const {\n      return cmptf2_impl(*this, la, ha, lb, hb, 1);\n   }\n   int interface::__unordtf2( uint64_t la, uint64_t ha, uint64_t lb, uint64_t hb ) const {\n      float128_t a = {{ la, ha }};\n      float128_t b = {{ lb, hb }};\n      if ( f128_is_nan(a) || f128_is_nan(b) )\n         return 1;\n      return 0;\n   }\n}}} \/\/ ns eosio::chain::webassembly\n<|endoftext|>"}
{"text":"<commit_before>\/************************************************************************************\n * Copyright (C) 2014 Aleix Pol Gonzalez <aleixpol@blue-systems.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                      *\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 <purpose\/job.h>\n#include <purpose\/pluginbase.h>\n\n#include <KLocalizedString>\n#include <QDebug>\n#include <QTimer>\n#include <QStandardPaths>\n#include <QFile>\n#include <QJsonDocument>\n#include <QJsonArray>\n#include <KPluginFactory>\n#include <KIO\/CopyJob>\n\nEXPORT_SHARE_VERSION\n\nclass SaveAsShareJob : public Purpose::Job\n{\n    Q_OBJECT\n    public:\n        SaveAsShareJob(QObject* parent) : Purpose::Job(parent) {\n            setCapabilities(Killable | Suspendable);\n        }\n\n        virtual void start() override\n        {\n            QJsonArray inputUrls = data().value(QStringLiteral(\"urls\")).toArray();\n\n            if (inputUrls.isEmpty()) {\n                setErrorText(i18n(\"No URLs to save\"));\n                setError(1);\n                emitResult();\n                return;\n            }\n\n            QList<QUrl> urls;\n            foreach(const QJsonValue &val, inputUrls) {\n                urls.append(QUrl(val.toString()));\n            }\n\n            const QUrl destination(data().value(QStringLiteral(\"destinationPath\")).toString());\n            job = KIO::copy(urls, destination);\n            connect(job, &KJob::finished, this, &SaveAsShareJob::fileCopied);\n        }\n\n        bool doKill() override\n        {\n            return job->kill();\n        }\n\n        virtual QUrl configSourceCode() const override\n        {\n            QString path = QStandardPaths::locate(QStandardPaths::GenericDataLocation, QStringLiteral(\"purpose\/dummyplugin_config.qml\"));\n            Q_ASSERT(!path.isEmpty());\n            return QUrl::fromLocalFile(path);\n        }\n\n        void fileCopied(KJob* job)\n        {\n            setError(job->error());\n            setErrorText(job->errorText());\n            if (job->error()==0) {\n                Q_EMIT output({ { QStringLiteral(\"url\"), qobject_cast<KIO::CopyJob*>(job)->destUrl().toString() } });\n            }\n            emitResult();\n        }\n\n    private:\n        KJob* job;\n};\n\nclass Q_DECL_EXPORT SaveAsPlugin : public Purpose::PluginBase\n{\n    Q_OBJECT\n    public:\n        SaveAsPlugin(QObject* p, const QVariantList& ) : Purpose::PluginBase(p) {}\n\n        virtual Purpose::Job* share() const override\n        {\n            return new SaveAsShareJob(nullptr);\n        }\n};\n\nK_PLUGIN_FACTORY_WITH_JSON(SaveAsShare, \"saveasplugin.json\", registerPlugin<SaveAsPlugin>();)\n\n#include \"saveasplugin.moc\"\n<commit_msg>Use the correct configuration file<commit_after>\/************************************************************************************\n * Copyright (C) 2014 Aleix Pol Gonzalez <aleixpol@blue-systems.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                      *\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 <purpose\/job.h>\n#include <purpose\/pluginbase.h>\n\n#include <KLocalizedString>\n#include <QDebug>\n#include <QTimer>\n#include <QStandardPaths>\n#include <QFile>\n#include <QJsonDocument>\n#include <QJsonArray>\n#include <KPluginFactory>\n#include <KIO\/CopyJob>\n\nEXPORT_SHARE_VERSION\n\nclass SaveAsShareJob : public Purpose::Job\n{\n    Q_OBJECT\n    public:\n        SaveAsShareJob(QObject* parent) : Purpose::Job(parent) {\n            setCapabilities(Killable | Suspendable);\n        }\n\n        virtual void start() override\n        {\n            QJsonArray inputUrls = data().value(QStringLiteral(\"urls\")).toArray();\n\n            if (inputUrls.isEmpty()) {\n                setErrorText(i18n(\"No URLs to save\"));\n                setError(1);\n                emitResult();\n                return;\n            }\n\n            QList<QUrl> urls;\n            foreach(const QJsonValue &val, inputUrls) {\n                urls.append(QUrl(val.toString()));\n            }\n\n            const QUrl destination(data().value(QStringLiteral(\"destinationPath\")).toString());\n            job = KIO::copy(urls, destination);\n            connect(job, &KJob::finished, this, &SaveAsShareJob::fileCopied);\n        }\n\n        bool doKill() override\n        {\n            return job->kill();\n        }\n\n        virtual QUrl configSourceCode() const override\n        {\n            QString path = QStandardPaths::locate(QStandardPaths::GenericDataLocation, QStringLiteral(\"purpose\/saveasplugin_config.qml\"));\n            Q_ASSERT(!path.isEmpty());\n            return QUrl::fromLocalFile(path);\n        }\n\n        void fileCopied(KJob* job)\n        {\n            setError(job->error());\n            setErrorText(job->errorText());\n            if (job->error()==0) {\n                Q_EMIT output({ { QStringLiteral(\"url\"), qobject_cast<KIO::CopyJob*>(job)->destUrl().toString() } });\n            }\n            emitResult();\n        }\n\n    private:\n        KJob* job;\n};\n\nclass Q_DECL_EXPORT SaveAsPlugin : public Purpose::PluginBase\n{\n    Q_OBJECT\n    public:\n        SaveAsPlugin(QObject* p, const QVariantList& ) : Purpose::PluginBase(p) {}\n\n        virtual Purpose::Job* share() const override\n        {\n            return new SaveAsShareJob(nullptr);\n        }\n};\n\nK_PLUGIN_FACTORY_WITH_JSON(SaveAsShare, \"saveasplugin.json\", registerPlugin<SaveAsPlugin>();)\n\n#include \"saveasplugin.moc\"\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\/\/ <vector>\n\/\/ vector<bool>\n\n\/\/ void swap(vector& x);\n\n#include <vector>\n#include <cassert>\n#include \"..\/..\/test_allocator.h\"\n\nint main()\n{\n    {\n        std::vector<bool> v1(100);\n        std::vector<bool> v2(200);\n        v1.swap(v2);\n        assert(v1.size() == 200);\n        assert(v1.capacity() >= 200);\n        assert(v2.size() == 100);\n        assert(v2.capacity() >= 100);\n    }\n    {\n        typedef test_allocator<bool> A;\n        std::vector<bool, A> v1(100, true, A(1));\n        std::vector<bool, A> v2(200, false, A(2));\n        swap(v1, v2);\n        assert(v1.size() == 200);\n        assert(v1.capacity() >= 200);\n        assert(v2.size() == 100);\n        assert(v2.capacity() >= 100);\n        assert(v1.get_allocator() == A(1));\n        assert(v2.get_allocator() == A(2));\n    }\n    {\n        typedef other_allocator<bool> A;\n        std::vector<bool, A> v1(100, true, A(1));\n        std::vector<bool, A> v2(200, false, A(2));\n        swap(v1, v2);\n        assert(v1.size() == 200);\n        assert(v1.capacity() >= 200);\n        assert(v2.size() == 100);\n        assert(v2.capacity() >= 100);\n        assert(v1.get_allocator() == A(2));\n        assert(v2.get_allocator() == A(1));\n    }\n}\n<commit_msg>Need one more swap overload for swapping two lvalue vector<bool>::reference's.<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\/\/ <vector>\n\/\/ vector<bool>\n\n\/\/ void swap(vector& x);\n\n#include <vector>\n#include <cassert>\n#include \"..\/..\/test_allocator.h\"\n\nint main()\n{\n    {\n        std::vector<bool> v1(100);\n        std::vector<bool> v2(200);\n        v1.swap(v2);\n        assert(v1.size() == 200);\n        assert(v1.capacity() >= 200);\n        assert(v2.size() == 100);\n        assert(v2.capacity() >= 100);\n    }\n    {\n        typedef test_allocator<bool> A;\n        std::vector<bool, A> v1(100, true, A(1));\n        std::vector<bool, A> v2(200, false, A(2));\n        swap(v1, v2);\n        assert(v1.size() == 200);\n        assert(v1.capacity() >= 200);\n        assert(v2.size() == 100);\n        assert(v2.capacity() >= 100);\n        assert(v1.get_allocator() == A(1));\n        assert(v2.get_allocator() == A(2));\n    }\n    {\n        typedef other_allocator<bool> A;\n        std::vector<bool, A> v1(100, true, A(1));\n        std::vector<bool, A> v2(200, false, A(2));\n        swap(v1, v2);\n        assert(v1.size() == 200);\n        assert(v1.capacity() >= 200);\n        assert(v2.size() == 100);\n        assert(v2.capacity() >= 100);\n        assert(v1.get_allocator() == A(2));\n        assert(v2.get_allocator() == A(1));\n    }\n    {\n        std::vector<bool> v(2);\n        std::vector<bool>::reference r1 = v[0];\n        std::vector<bool>::reference r2 = v[1];\n        r1 = true;\n        using std::swap;\n        swap(r1, r2);\n        assert(v[0] == false);\n        assert(v[1] == true);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* **********************************************************\r\n * Copyright (c) 2012 Google, Inc.  All rights reserved.\r\n * **********************************************************\/\r\n\r\n\/* Dr. Memory: the memory debugger\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;\r\n * version 2.1 of the License, and no 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 Lesser General Public\r\n * License along with this library; if not, write to the Free Software\r\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.\r\n *\/\r\n\r\n#include <windows.h>\r\n#include <objbase.h>\r\n#include <stdlib.h>\r\n\r\n\/\/ For shell link stuff.\r\n#include <shobjidl.h>\r\n#include <shlguid.h>\r\n\r\n#pragma comment(lib, \"ole32.lib\")\r\n\r\n#include \"gtest\/gtest.h\"\r\n\r\n\/\/ Ensure that CoInitializeEx test comes first, because many of the leaks\r\n\/\/ happen once per process, and the callstacks through CoInitializeEx are\r\n\/\/ harder to suppress due its tail call.\r\nTEST(OleTest, CoInitializeEx) {\r\n    HRESULT hr = CoInitializeEx(NULL, COINIT_APARTMENTTHREADED);\r\n    ASSERT_TRUE(SUCCEEDED(hr));\r\n    CoUninitialize();\r\n}\r\n\r\nTEST(OleTest, CoInitialize) {\r\n    HRESULT hr = CoInitialize(NULL);\r\n    ASSERT_TRUE(SUCCEEDED(hr));\r\n    CoUninitialize();\r\n}\r\n\r\nTEST(OleTest, CoCreateInstance) {\r\n    HRESULT hr = CoInitialize(NULL);\r\n    ASSERT_TRUE(SUCCEEDED(hr));\r\n\r\n    \/\/ Some COM object for creating shortcut files.  We just use it as an\r\n    \/\/ arbitrary object that we can create.\r\n    IShellLink* shell_link = NULL;\r\n    hr = CoCreateInstance(CLSID_ShellLink, NULL, CLSCTX_INPROC_SERVER,\r\n                          IID_IShellLink, (LPVOID*)&shell_link);\r\n    ASSERT_TRUE(SUCCEEDED(hr));\r\n    shell_link->Release();\r\n\r\n    CoUninitialize();\r\n}\r\n<commit_msg>fixes issue 746 + dos2unix on ole_tests_win.cpp + fix build error for ole_tests_win.cpp with VS2005<commit_after>\/* **********************************************************\n * Copyright (c) 2012 Google, Inc.  All rights reserved.\n * **********************************************************\/\n\n\/* Dr. Memory: the memory debugger\n *\n * This 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, and no 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 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#if _MSC_VER <= 1400\n# define _WIN32_WINNT 0x0400 \/* == NT4 *\/ \/* not set for VS2005 *\/\n#endif\n\n#include <windows.h>\n#include <objbase.h>\n#include <stdlib.h>\n\n\/\/ For shell link stuff.\n#include <shobjidl.h>\n#include <shlguid.h>\n\n#pragma comment(lib, \"ole32.lib\")\n\n#include \"gtest\/gtest.h\"\n\n\/\/ Ensure that CoInitializeEx test comes first, because many of the leaks\n\/\/ happen once per process, and the callstacks through CoInitializeEx are\n\/\/ harder to suppress due its tail call.\nTEST(OleTest, CoInitializeEx) {\n    HRESULT hr = CoInitializeEx(NULL, COINIT_APARTMENTTHREADED);\n    ASSERT_TRUE(SUCCEEDED(hr));\n    CoUninitialize();\n}\n\nTEST(OleTest, CoInitialize) {\n    HRESULT hr = CoInitialize(NULL);\n    ASSERT_TRUE(SUCCEEDED(hr));\n    CoUninitialize();\n}\n\nTEST(OleTest, CoCreateInstance) {\n    HRESULT hr = CoInitialize(NULL);\n    ASSERT_TRUE(SUCCEEDED(hr));\n\n    \/\/ Some COM object for creating shortcut files.  We just use it as an\n    \/\/ arbitrary object that we can create.\n    IShellLink* shell_link = NULL;\n    hr = CoCreateInstance(CLSID_ShellLink, NULL, CLSCTX_INPROC_SERVER,\n                          IID_IShellLink, (LPVOID*)&shell_link);\n    ASSERT_TRUE(SUCCEEDED(hr));\n    shell_link->Release();\n\n    CoUninitialize();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2015-2017, Deutsches Forschungszentrum für Künstliche Intelligenz GmbH.\n\/\/ Copyright (c) 2015-2017, University of Bremen\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions 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\/\/ 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#include \"TraversabilityMap3dVisualization.hpp\"\n#include <vizkit3d\/Vizkit3DHelper.hpp>\n#include <osg\/Geode>\n#include <osg\/ShapeDrawable>\n#include <osg\/Material>\n#include \"PatchesGeode.hpp\"\n\nusing namespace ::maps::grid;\nusing namespace vizkit3d;\n\nvizkit3d::TraversabilityMap3dVisualization::TraversabilityMap3dVisualization()\n    : Vizkit3DPlugin< ::maps::grid::TraversabilityMap3d<maps::grid::TraversabilityNodeBase *> >()\n    , isoline_interval(16.0), show_connections(false)\n{\n\n}\n\nvizkit3d::TraversabilityMap3dVisualization::~TraversabilityMap3dVisualization()\n{\n\n}\n\nosg::ref_ptr< osg::Node > vizkit3d::TraversabilityMap3dVisualization::createMainNode()\n{\n    osg::ref_ptr<osg::Group> group = new osg::Group();\n\n    return group.release();\n}\n\n\nvoid vizkit3d::TraversabilityMap3dVisualization::updateDataIntern(const maps::grid::TraversabilityMap3d< TraversabilityNodeBase* >& data)\n{\n    map = data;\n}\n\nvoid setColor(const osg::Vec4d& color, osg::Geode* geode)\n{\n    osg::Material *material = new osg::Material();\n    material->setDiffuse(osg::Material::FRONT,  osg::Vec4(0.1, 0.1, 0.1, 1.0));\n    material->setSpecular(osg::Material::FRONT, osg::Vec4(0.6, 0.6, 0.6, 1.0));\n    material->setAmbient(osg::Material::FRONT,  osg::Vec4(0.1, 0.1, 0.1, 1.0));\n    material->setEmission(osg::Material::FRONT, color);\n    material->setShininess(osg::Material::FRONT, 10.0);\n\n    geode->getOrCreateStateSet()->setAttribute(material);    \n}\n\n\nosg::ref_ptr<osg::Geode> getCylinder(const Eigen::Vector3f &from, const Eigen::Vector3f &to)\n{\n    Eigen::Vector3f diff = (to - from);\n    Eigen::Vector3f center = from + diff * .5;\n    \n    osg::Quat quat; \n    osg::Matrix matrix; \n    matrix.makeLookAt(eigenVectorToOsgVec3(from.cast<double>()), eigenVectorToOsgVec3(to.cast<double>()), osg::X_AXIS); \n    quat.set(matrix); \n    \n    osg::ref_ptr<osg::Geode> c2g = new osg::Geode();\n    osg::ref_ptr<osg::Cylinder> c2 = new osg::Cylinder(eigenVectorToOsgVec3(center.cast<double>()), 0.005, diff.norm());\n    c2->setRotation(quat.inverse());\n    osg::ref_ptr<osg::ShapeDrawable> c2d = new osg::ShapeDrawable(c2);\n    c2g->addDrawable(c2d);\n    setColor(osg::Vec4f(1.0, 0, 0, 1.0), c2g);\n    \n    return c2g;\n}\n\n\nvoid addSphere(const Eigen::Vector3f &position, osg::ref_ptr<osg::Geode> geode)\n{\n    osg::ref_ptr<osg::Sphere> sp = new osg::Sphere(eigenVectorToOsgVec3(position.cast<double>()), 0.05);\n    \n    osg::ref_ptr<osg::ShapeDrawable> spd = new osg::ShapeDrawable(sp);\n    spd->setColor(osg::Vec4f(0, 1, 0, 1.0));\n    geode->addDrawable(spd);\n};\n\n\nvoid TraversabilityMap3dVisualization::visualizeNode(const TraversabilityNodeBase* node)\n{\n    Eigen::Vector3f curNodePos = map.getNodePosition(node);\n\n    PatchesGeode *geode = dynamic_cast<PatchesGeode *>(nodeGeode.get());\n    geode->setPosition(curNodePos.x(), curNodePos.y());\n    \n    switch(node->getType())\n    {\n        case TraversabilityNodeBase::OBSTACLE:\n            geode->setColor(osg::Vec4d(1,0,0,1));\n            break;\n        case TraversabilityNodeBase::UNKNOWN:\n            geode->setColor(osg::Vec4d(1,0,1,1));\n            break;\n        case TraversabilityNodeBase::TRAVERSABLE:\n            geode->setColor(osg::Vec4d(0, 1, 0, 1));\n            break;\n        case TraversabilityNodeBase::FRONTIER:\n            geode->setColor(osg::Vec4d(0, 0, 1, 1));\n            break;\n        case TraversabilityNodeBase::HOLE:\n            geode->setColor(osg::Vec4d(0, 1, 1, 1));\n            break;\n        case TraversabilityNodeBase::UNSET:\n            geode->setColor(osg::Vec4d(1, 1, 0, 1));\n            break;            \n        default:\n            std::cout << \"WARNING: unknown node type!\\n\";\n            geode->setColor(osg::Vec4d(0,0,1,1));\n    }\n    \n    if(fabs(node->getHeight()) > 30000)\n    {\n        \/\/FIXME if nodes are too far aways, the culling mechanism of osg breaks.\n        \/\/ I.e. verticves disappear when zooming in on them.\n        std::cout << \"TraversabilityMap3dVisualization:: Warning, ignoring node with height above +-30000 \" << std::endl; \n        return;\n    }\n    \n    if(std::isnan(node->getHeight()))\n        throw std::runtime_error(\"FOOOOOOOO\");\n    \n    geode->drawHorizontalPlane(node->getHeight());\n    \n    if(show_connections)\n    {\n        for(const TraversabilityNodeBase *conNode: node->getConnections())\n        {\n            visualizeConnection(node, conNode);\n        }\n    }\n}\n\nvoid TraversabilityMap3dVisualization::visualizeConnection(const TraversabilityNodeBase* from, const TraversabilityNodeBase* to)\n{\n    Eigen::Vector3f toPos = map.getNodePosition(to);\n    Eigen::Vector3f fromPos = map.getNodePosition(from);\n    osg::Vec3 fromOsg(fromPos.x(), fromPos.y(), fromPos.z());\n    osg::Vec3 toOsg(toPos.x(), toPos.y(), toPos.z());\n    \n    linesNode->addLine(fromOsg, toOsg);\n}\n\nvoid vizkit3d::TraversabilityMap3dVisualization::addNodeList(const maps::grid::LevelList< TraversabilityNodeBase* >& l, osg::Group* group)\n{\n    for(const auto &entry: l)\n    {\n        visualizeNode(entry);\n    }\n}\n\nvoid vizkit3d::TraversabilityMap3dVisualization::updateMainNode(osg::Node* node)\n{\n    osg::Group* group = static_cast<osg::Group*>(node);    \n\n    \/\/clear old data\n    group->removeChildren(0, group->getNumChildren());\n\n    nodeGeode = new PatchesGeode(map.getResolution().x(), map.getResolution().y());\n    linesNode = new osgviz::LinesNode(osg::Vec4(1, 1, 1, 1));\n    group->addChild(nodeGeode);\n    group->addChild(linesNode);\n    \n    PatchesGeode *geode = dynamic_cast<PatchesGeode *>(nodeGeode.get());\n    geode->setColor(osg::Vec4d(1,0,0,1));\n    geode->setShowPatchExtents(true);\n    geode->setShowNormals(true);\n    \n    for(size_t y = 0; y < map.getNumCells().y(); y++)\n    {\n        for(size_t x = 0; x < map.getNumCells().x(); x++)\n        {\n            const LevelList<TraversabilityNodeBase *> &l(map.at(x, y));\n            addNodeList(l, group);\n        }\n    }\n}\n\nvoid vizkit3d::TraversabilityMap3dVisualization::setIsolineInterval(const double& val)\n{\n    isoline_interval = val;\n    emit propertyChanged(\"isoline_interval\");\n    setDirty();\n}\n\nbool TraversabilityMap3dVisualization::getShowConnections()\n{\n    return show_connections;\n}\n\nvoid TraversabilityMap3dVisualization::setShowConnections(bool val)\n{\n    show_connections = true;\n    emit propertyChanged(\"show_connections\");\n    setDirty();\n}\n\n\n\n\n\n<commit_msg>make possible to disable 'show_connections'<commit_after>\/\/\n\/\/ Copyright (c) 2015-2017, Deutsches Forschungszentrum für Künstliche Intelligenz GmbH.\n\/\/ Copyright (c) 2015-2017, University of Bremen\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions 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\/\/ 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#include \"TraversabilityMap3dVisualization.hpp\"\n#include <vizkit3d\/Vizkit3DHelper.hpp>\n#include <osg\/Geode>\n#include <osg\/ShapeDrawable>\n#include <osg\/Material>\n#include \"PatchesGeode.hpp\"\n\nusing namespace ::maps::grid;\nusing namespace vizkit3d;\n\nvizkit3d::TraversabilityMap3dVisualization::TraversabilityMap3dVisualization()\n    : Vizkit3DPlugin< ::maps::grid::TraversabilityMap3d<maps::grid::TraversabilityNodeBase *> >()\n    , isoline_interval(16.0), show_connections(false)\n{\n\n}\n\nvizkit3d::TraversabilityMap3dVisualization::~TraversabilityMap3dVisualization()\n{\n\n}\n\nosg::ref_ptr< osg::Node > vizkit3d::TraversabilityMap3dVisualization::createMainNode()\n{\n    osg::ref_ptr<osg::Group> group = new osg::Group();\n\n    return group.release();\n}\n\n\nvoid vizkit3d::TraversabilityMap3dVisualization::updateDataIntern(const maps::grid::TraversabilityMap3d< TraversabilityNodeBase* >& data)\n{\n    map = data;\n}\n\nvoid setColor(const osg::Vec4d& color, osg::Geode* geode)\n{\n    osg::Material *material = new osg::Material();\n    material->setDiffuse(osg::Material::FRONT,  osg::Vec4(0.1, 0.1, 0.1, 1.0));\n    material->setSpecular(osg::Material::FRONT, osg::Vec4(0.6, 0.6, 0.6, 1.0));\n    material->setAmbient(osg::Material::FRONT,  osg::Vec4(0.1, 0.1, 0.1, 1.0));\n    material->setEmission(osg::Material::FRONT, color);\n    material->setShininess(osg::Material::FRONT, 10.0);\n\n    geode->getOrCreateStateSet()->setAttribute(material);    \n}\n\n\nosg::ref_ptr<osg::Geode> getCylinder(const Eigen::Vector3f &from, const Eigen::Vector3f &to)\n{\n    Eigen::Vector3f diff = (to - from);\n    Eigen::Vector3f center = from + diff * .5;\n    \n    osg::Quat quat; \n    osg::Matrix matrix; \n    matrix.makeLookAt(eigenVectorToOsgVec3(from.cast<double>()), eigenVectorToOsgVec3(to.cast<double>()), osg::X_AXIS); \n    quat.set(matrix); \n    \n    osg::ref_ptr<osg::Geode> c2g = new osg::Geode();\n    osg::ref_ptr<osg::Cylinder> c2 = new osg::Cylinder(eigenVectorToOsgVec3(center.cast<double>()), 0.005, diff.norm());\n    c2->setRotation(quat.inverse());\n    osg::ref_ptr<osg::ShapeDrawable> c2d = new osg::ShapeDrawable(c2);\n    c2g->addDrawable(c2d);\n    setColor(osg::Vec4f(1.0, 0, 0, 1.0), c2g);\n    \n    return c2g;\n}\n\n\nvoid addSphere(const Eigen::Vector3f &position, osg::ref_ptr<osg::Geode> geode)\n{\n    osg::ref_ptr<osg::Sphere> sp = new osg::Sphere(eigenVectorToOsgVec3(position.cast<double>()), 0.05);\n    \n    osg::ref_ptr<osg::ShapeDrawable> spd = new osg::ShapeDrawable(sp);\n    spd->setColor(osg::Vec4f(0, 1, 0, 1.0));\n    geode->addDrawable(spd);\n};\n\n\nvoid TraversabilityMap3dVisualization::visualizeNode(const TraversabilityNodeBase* node)\n{\n    Eigen::Vector3f curNodePos = map.getNodePosition(node);\n\n    PatchesGeode *geode = dynamic_cast<PatchesGeode *>(nodeGeode.get());\n    geode->setPosition(curNodePos.x(), curNodePos.y());\n    \n    switch(node->getType())\n    {\n        case TraversabilityNodeBase::OBSTACLE:\n            geode->setColor(osg::Vec4d(1,0,0,1));\n            break;\n        case TraversabilityNodeBase::UNKNOWN:\n            geode->setColor(osg::Vec4d(1,0,1,1));\n            break;\n        case TraversabilityNodeBase::TRAVERSABLE:\n            geode->setColor(osg::Vec4d(0, 1, 0, 1));\n            break;\n        case TraversabilityNodeBase::FRONTIER:\n            geode->setColor(osg::Vec4d(0, 0, 1, 1));\n            break;\n        case TraversabilityNodeBase::HOLE:\n            geode->setColor(osg::Vec4d(0, 1, 1, 1));\n            break;\n        case TraversabilityNodeBase::UNSET:\n            geode->setColor(osg::Vec4d(1, 1, 0, 1));\n            break;            \n        default:\n            std::cout << \"WARNING: unknown node type!\\n\";\n            geode->setColor(osg::Vec4d(0,0,1,1));\n    }\n    \n    if(fabs(node->getHeight()) > 30000)\n    {\n        \/\/FIXME if nodes are too far aways, the culling mechanism of osg breaks.\n        \/\/ I.e. verticves disappear when zooming in on them.\n        std::cout << \"TraversabilityMap3dVisualization:: Warning, ignoring node with height above +-30000 \" << std::endl; \n        return;\n    }\n    \n    if(std::isnan(node->getHeight()))\n        throw std::runtime_error(\"FOOOOOOOO\");\n    \n    geode->drawHorizontalPlane(node->getHeight());\n    \n    if(show_connections)\n    {\n        for(const TraversabilityNodeBase *conNode: node->getConnections())\n        {\n            visualizeConnection(node, conNode);\n        }\n    }\n}\n\nvoid TraversabilityMap3dVisualization::visualizeConnection(const TraversabilityNodeBase* from, const TraversabilityNodeBase* to)\n{\n    Eigen::Vector3f toPos = map.getNodePosition(to);\n    Eigen::Vector3f fromPos = map.getNodePosition(from);\n    osg::Vec3 fromOsg(fromPos.x(), fromPos.y(), fromPos.z());\n    osg::Vec3 toOsg(toPos.x(), toPos.y(), toPos.z());\n    \n    linesNode->addLine(fromOsg, toOsg);\n}\n\nvoid vizkit3d::TraversabilityMap3dVisualization::addNodeList(const maps::grid::LevelList< TraversabilityNodeBase* >& l, osg::Group* group)\n{\n    for(const auto &entry: l)\n    {\n        visualizeNode(entry);\n    }\n}\n\nvoid vizkit3d::TraversabilityMap3dVisualization::updateMainNode(osg::Node* node)\n{\n    osg::Group* group = static_cast<osg::Group*>(node);    \n\n    \/\/clear old data\n    group->removeChildren(0, group->getNumChildren());\n\n    nodeGeode = new PatchesGeode(map.getResolution().x(), map.getResolution().y());\n    linesNode = new osgviz::LinesNode(osg::Vec4(1, 1, 1, 1));\n    group->addChild(nodeGeode);\n    group->addChild(linesNode);\n    \n    PatchesGeode *geode = dynamic_cast<PatchesGeode *>(nodeGeode.get());\n    geode->setColor(osg::Vec4d(1,0,0,1));\n    geode->setShowPatchExtents(true);\n    geode->setShowNormals(true);\n    \n    for(size_t y = 0; y < map.getNumCells().y(); y++)\n    {\n        for(size_t x = 0; x < map.getNumCells().x(); x++)\n        {\n            const LevelList<TraversabilityNodeBase *> &l(map.at(x, y));\n            addNodeList(l, group);\n        }\n    }\n}\n\nvoid vizkit3d::TraversabilityMap3dVisualization::setIsolineInterval(const double& val)\n{\n    isoline_interval = val;\n    emit propertyChanged(\"isoline_interval\");\n    setDirty();\n}\n\nbool TraversabilityMap3dVisualization::getShowConnections()\n{\n    return show_connections;\n}\n\nvoid TraversabilityMap3dVisualization::setShowConnections(bool val)\n{\n    show_connections = val;\n    emit propertyChanged(\"show_connections\");\n    setDirty();\n}\n\n\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: fntctl.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 23:42: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 <string> \/\/ HACK: prevent conflict between STLPORT and Workshop headern\n\n#ifndef _STDMENU_HXX \/\/autogen\n#include <svtools\/stdmenu.hxx>\n#endif\n#ifndef _SFXAPP_HXX \/\/autogen\n#include <sfx2\/app.hxx>\n#endif\n#ifndef _SFX_OBJSH_HXX \/\/autogen\n#include <sfx2\/objsh.hxx>\n#endif\n#ifndef _SFXDISPATCH_HXX \/\/autogen\n#include <sfx2\/dispatch.hxx>\n#endif\n#pragma hdrstop\n\n#define ITEMID_FONT     1\n#define ITEMID_FONTLIST 2\n\n#include \"fntctl.hxx\"       \/\/ ITEMID_FONT muss vorher definiert sein!\n#include \"svxids.hrc\"\n\n#ifndef _SVX_FLSTITEM_HXX \/\/autogen\n#include \"flstitem.hxx\"\n#endif\n#ifndef _SVX_FONTITEM_HXX \/\/autogen\n#include \"fontitem.hxx\"\n#endif\n\n\/\/ STATIC DATA -----------------------------------------------------------\n\nSFX_IMPL_MENU_CONTROL(SvxFontMenuControl, SvxFontItem);\n\n\/\/--------------------------------------------------------------------\n\n\/*  [Beschreibung]\n\n    Ctor; setzt den Select-Handler am Men\"u und tr\"agt das Men\"u\n    in seinen Parent ein.\n*\/\n\nSvxFontMenuControl::SvxFontMenuControl\n(\n    USHORT          nId,\n    Menu&           rMenu,\n    SfxBindings&    rBindings\n) :\n    pMenu   ( new FontNameMenu ),\n    rParent ( rMenu )\n{\n    rMenu.SetPopupMenu( nId, pMenu );\n    pMenu->SetSelectHdl( LINK( this, SvxFontMenuControl, MenuSelect ) );\n    StartListening( rBindings );\n    FillMenu();\n}\n\n\/\/--------------------------------------------------------------------\n\n\/*  [Beschreibung]\n\n    F\"ullt das Men\"u mit den aktuellen Fonts aus der Fontlist\n    der DocumentShell.\n*\/\n\nvoid SvxFontMenuControl::FillMenu()\n{\n    SfxObjectShell *pDoc = SfxObjectShell::Current();\n\n    if ( pDoc )\n    {\n        const SvxFontListItem* pFonts =\n            (const SvxFontListItem*)pDoc->GetItem( SID_ATTR_CHAR_FONTLIST );\n        const FontList* pList = pFonts ? pFonts->GetFontList(): 0;\n        DBG_ASSERT( pList, \"Kein Fonts gefunden\" );\n        pMenu->Fill( pList );\n    }\n}\n\n\/\/--------------------------------------------------------------------\n\n\/*  [Beschreibung]\n\n    Statusbenachrichtigung;\n    f\"ullt ggf. das Men\"u mit den aktuellen Fonts aus der Fontlist\n    der DocumentShell.\n    Ist die Funktionalit\"at disabled, wird der entsprechende\n    Men\"ueintrag im Parentmen\"u disabled, andernfalls wird er enabled.\n    Der aktuelle Font wird mit einer Checkmark versehen.\n*\/\n\nvoid SvxFontMenuControl::StateChanged(\n\n    USHORT nSID, SfxItemState eState, const SfxPoolItem* pState )\n\n{\n    rParent.EnableItem( GetId(), SFX_ITEM_DISABLED != eState );\n\n    if ( SFX_ITEM_AVAILABLE == eState )\n    {\n        if ( !pMenu->GetItemCount() )\n            FillMenu();\n        const SvxFontItem* pFontItem = PTR_CAST( SvxFontItem, pState );\n        String aFont;\n\n        if ( pFontItem )\n            aFont = pFontItem->GetFamilyName();\n        pMenu->SetCurName( aFont );\n    }\n}\n\n\/\/--------------------------------------------------------------------\n\n\/*  [Beschreibung]\n\n    Statusbenachrichtigung \"uber Bindings;  bei DOCCHANGED\n    wird das Men\"u mit den aktuellen Fonts aus der Fontlist\n    der DocumentShell gef\"ullt.\n*\/\n\nvoid SvxFontMenuControl::SFX_NOTIFY( SfxBroadcaster& rBC, const TypeId& rBCType,\n                                 const SfxHint& rHint, const TypeId& rHintType )\n{\n    if ( rHint.Type() != TYPE(SfxSimpleHint) &&\n         ( (SfxSimpleHint&)rHint ).GetId() == SFX_HINT_DOCCHANGED )\n        FillMenu();\n}\n\n\/\/--------------------------------------------------------------------\n\n\/*  [Beschreibung]\n\n    Select-Handler des Men\"us; der Name des selektierten Fonts\n    wird in einem SvxFontItem verschickt. Das F\"ullen mit den\n    weiteren Fontinformationen mu\\s durch die Applikation geschehen.\n*\/\n\nIMPL_LINK_INLINE_START( SvxFontMenuControl, MenuSelect, FontNameMenu *, pMen )\n{\n    SvxFontItem aItem( GetId() );\n    aItem.GetFamilyName() = pMen->GetCurName();\n    GetBindings().GetDispatcher()->Execute( GetId(), SFX_CALLMODE_RECORD, &aItem, 0L );\n    return 0;\n}\nIMPL_LINK_INLINE_END( SvxFontMenuControl, MenuSelect, FontNameMenu *, pMen )\n\n\/\/--------------------------------------------------------------------\n\n\/*  [Beschreibung]\n\n    Dtor; gibt das Men\"u frei.\n*\/\n\nSvxFontMenuControl::~SvxFontMenuControl()\n{\n    delete pMenu;\n}\n\n\/\/--------------------------------------------------------------------\n\n\/*  [Beschreibung]\n\n    Gibt das Men\"u zur\"uck\n*\/\n\nPopupMenu* SvxFontMenuControl::GetPopup() const\n{\n    return pMenu;\n}\n\n\n\n<commit_msg>INTEGRATION: CWS warnings01 (1.2.220); FILE MERGED 2006\/04\/20 14:49:57 cl 1.2.220.1: warning free code changes<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: fntctl.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: hr $ $Date: 2006-06-19 16:17: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#include <string> \/\/ HACK: prevent conflict between STLPORT and Workshop headern\n\n#ifndef _STDMENU_HXX \/\/autogen\n#include <svtools\/stdmenu.hxx>\n#endif\n#ifndef _SFXAPP_HXX \/\/autogen\n#include <sfx2\/app.hxx>\n#endif\n#ifndef _SFX_OBJSH_HXX \/\/autogen\n#include <sfx2\/objsh.hxx>\n#endif\n#ifndef _SFXDISPATCH_HXX \/\/autogen\n#include <sfx2\/dispatch.hxx>\n#endif\n\n#define ITEMID_FONT     1\n#define ITEMID_FONTLIST 2\n\n#include \"fntctl.hxx\"       \/\/ ITEMID_FONT muss vorher definiert sein!\n#include \"svxids.hrc\"\n\n#ifndef _SVX_FLSTITEM_HXX \/\/autogen\n#include \"flstitem.hxx\"\n#endif\n#ifndef _SVX_FONTITEM_HXX \/\/autogen\n#include \"fontitem.hxx\"\n#endif\n\n\/\/ STATIC DATA -----------------------------------------------------------\n\nSFX_IMPL_MENU_CONTROL(SvxFontMenuControl, SvxFontItem);\n\n\/\/--------------------------------------------------------------------\n\n\/*  [Beschreibung]\n\n    Ctor; setzt den Select-Handler am Men\"u und tr\"agt das Men\"u\n    in seinen Parent ein.\n*\/\n\nSvxFontMenuControl::SvxFontMenuControl\n(\n    USHORT          nId,\n    Menu&           rMenu,\n    SfxBindings&    rBindings\n) :\n    pMenu   ( new FontNameMenu ),\n    rParent ( rMenu )\n{\n    rMenu.SetPopupMenu( nId, pMenu );\n    pMenu->SetSelectHdl( LINK( this, SvxFontMenuControl, MenuSelect ) );\n    StartListening( rBindings );\n    FillMenu();\n}\n\n\/\/--------------------------------------------------------------------\n\n\/*  [Beschreibung]\n\n    F\"ullt das Men\"u mit den aktuellen Fonts aus der Fontlist\n    der DocumentShell.\n*\/\n\nvoid SvxFontMenuControl::FillMenu()\n{\n    SfxObjectShell *pDoc = SfxObjectShell::Current();\n\n    if ( pDoc )\n    {\n        const SvxFontListItem* pFonts =\n            (const SvxFontListItem*)pDoc->GetItem( SID_ATTR_CHAR_FONTLIST );\n        const FontList* pList = pFonts ? pFonts->GetFontList(): 0;\n        DBG_ASSERT( pList, \"Kein Fonts gefunden\" );\n        pMenu->Fill( pList );\n    }\n}\n\n\/\/--------------------------------------------------------------------\n\n\/*  [Beschreibung]\n\n    Statusbenachrichtigung;\n    f\"ullt ggf. das Men\"u mit den aktuellen Fonts aus der Fontlist\n    der DocumentShell.\n    Ist die Funktionalit\"at disabled, wird der entsprechende\n    Men\"ueintrag im Parentmen\"u disabled, andernfalls wird er enabled.\n    Der aktuelle Font wird mit einer Checkmark versehen.\n*\/\n\nvoid SvxFontMenuControl::StateChanged(\n\n    USHORT nSID, SfxItemState eState, const SfxPoolItem* pState )\n\n{\n    rParent.EnableItem( GetId(), SFX_ITEM_DISABLED != eState );\n\n    if ( SFX_ITEM_AVAILABLE == eState )\n    {\n        if ( !pMenu->GetItemCount() )\n            FillMenu();\n        const SvxFontItem* pFontItem = PTR_CAST( SvxFontItem, pState );\n        String aFont;\n\n        if ( pFontItem )\n            aFont = pFontItem->GetFamilyName();\n        pMenu->SetCurName( aFont );\n    }\n}\n\n\/\/--------------------------------------------------------------------\n\n\/*  [Beschreibung]\n\n    Statusbenachrichtigung \"uber Bindings;  bei DOCCHANGED\n    wird das Men\"u mit den aktuellen Fonts aus der Fontlist\n    der DocumentShell gef\"ullt.\n*\/\n\nvoid SvxFontMenuControl::SFX_NOTIFY( SfxBroadcaster& rBC, const TypeId& rBCType,\n                                 const SfxHint& rHint, const TypeId& rHintType )\n{\n    if ( rHint.Type() != TYPE(SfxSimpleHint) &&\n         ( (SfxSimpleHint&)rHint ).GetId() == SFX_HINT_DOCCHANGED )\n        FillMenu();\n}\n\n\/\/--------------------------------------------------------------------\n\n\/*  [Beschreibung]\n\n    Select-Handler des Men\"us; der Name des selektierten Fonts\n    wird in einem SvxFontItem verschickt. Das F\"ullen mit den\n    weiteren Fontinformationen mu\\s durch die Applikation geschehen.\n*\/\n\nIMPL_LINK_INLINE_START( SvxFontMenuControl, MenuSelect, FontNameMenu *, pMen )\n{\n    SvxFontItem aItem( GetId() );\n    aItem.GetFamilyName() = pMen->GetCurName();\n    GetBindings().GetDispatcher()->Execute( GetId(), SFX_CALLMODE_RECORD, &aItem, 0L );\n    return 0;\n}\nIMPL_LINK_INLINE_END( SvxFontMenuControl, MenuSelect, FontNameMenu *, pMen )\n\n\/\/--------------------------------------------------------------------\n\n\/*  [Beschreibung]\n\n    Dtor; gibt das Men\"u frei.\n*\/\n\nSvxFontMenuControl::~SvxFontMenuControl()\n{\n    delete pMenu;\n}\n\n\/\/--------------------------------------------------------------------\n\n\/*  [Beschreibung]\n\n    Gibt das Men\"u zur\"uck\n*\/\n\nPopupMenu* SvxFontMenuControl::GetPopup() const\n{\n    return pMenu;\n}\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: linkmgr.cxx,v $\n *\n *  $Revision: 1.26 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 00:45: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#pragma hdrstop\n\n#ifndef _COM_SUN_STAR_UNO_SEQUENCE_H_\n#include <com\/sun\/star\/uno\/Sequence.h>\n#endif\n#include <sot\/formats.hxx>\n#ifndef _SOT_EXCHANGE_HXX \/\/autogen\n#include <sot\/exchange.hxx>\n#endif\n#ifndef _SV_GRAPH_HXX\n#include <vcl\/graph.hxx>\n#endif\n#ifndef _LNKBASE_HXX \/\/autogen\n#include <sfx2\/lnkbase.hxx>\n#endif\n#ifndef _URLOBJ_HXX \/\/autogen\n#include <tools\/urlobj.hxx>\n#endif\n#ifndef _SFXSTRITEM_HXX \/\/autogen\n#include <svtools\/stritem.hxx>\n#endif\n#ifndef _SFXENUMITEM_HXX \/\/autogen\n#include <svtools\/eitem.hxx>\n#endif\n#ifndef _SFXINTITEM_HXX \/\/autogen\n#include <svtools\/intitem.hxx>\n#endif\n#ifndef _SFXRECTITEM_HXX \/\/autogen\n#include <svtools\/rectitem.hxx>\n#endif\n#ifndef _SFXAPP_HXX\n#include <sfx2\/app.hxx>\n#endif\n#ifndef _SFXREQUEST_HXX\n#include <sfx2\/request.hxx>\n#endif\n#ifndef _SFX_OBJSH_HXX \/\/autogen\n#include <sfx2\/objsh.hxx>\n#endif\n#ifndef _SFX_INTERNO_HXX \/\/autogen\n\/\/#include <sfx2\/interno.hxx>\n#endif\n#ifndef _SFXDISPATCH_HXX \/\/autogen\n#include <sfx2\/dispatch.hxx>\n#endif\n#ifndef _UNOTOOLS_CHARCLASS_HXX\n#include <unotools\/charclass.hxx>\n#endif\n#ifndef _UNOTOOLS_LOCALFILEHELPER_HXX\n#include <unotools\/localfilehelper.hxx>\n#endif\n#ifndef _SFXITEMSET_HXX\n#include <svtools\/itemset.hxx>\n#endif\n#ifndef SVTOOLS_URIHELPER_HXX\n#include <svtools\/urihelper.hxx>\n#endif\n#include <com\/sun\/star\/datatransfer\/DataFlavor.hpp>\n\n#include \"linkmgr.hxx\"\n#include \"fileobj.hxx\"\n#include \"dialmgr.hxx\"\n#include \"dialogs.hrc\"\n#include \"unolingu.hxx\"\n\nclass SvxInternalLink : public sfx2::SvLinkSource\n{\npublic:\n    SvxInternalLink() {}\n\n    virtual BOOL Connect( sfx2::SvBaseLink* );\n};\n\nSvxLinkManager::SvxLinkManager( SfxObjectShell* pPersist )\n{\n    SvLinkManager::SetPersist( pPersist );\n}\n\nsfx2::SvLinkSourceRef SvxLinkManager::CreateObj( sfx2::SvBaseLink * pLink )\n{\n    switch( pLink->GetObjType() )\n    {\n    case OBJECT_CLIENT_FILE:\n    case OBJECT_CLIENT_GRF:\n    case OBJECT_CLIENT_OLE:\n        return new SvFileObject;\n\n    case OBJECT_INTERN:\n        return new SvxInternalLink();\n    }\n    return SvLinkManager::CreateObj( pLink );\n}\n\n\nBOOL SvxLinkManager::InsertFileLink( sfx2::SvBaseLink& rLink,\n                                    USHORT nFileType,\n                                    const String& rFileNm,\n                                    const String* pFilterNm,\n                                    const String* pRange )\n{\n    if( !( OBJECT_CLIENT_SO & rLink.GetObjType() ))\n        return FALSE;\n\n    String sCmd( rFileNm );\n    sCmd += ::sfx2::cTokenSeperator;\n    if( pRange )\n        sCmd += *pRange;\n    if( pFilterNm )\n        ( sCmd += ::sfx2::cTokenSeperator ) += *pFilterNm;\n\n    return SvLinkManager::InsertLink( &rLink, nFileType,\n                                    sfx2::LINKUPDATE_ONCALL, &sCmd );\n}\n\nBOOL SvxLinkManager::InsertFileLink( sfx2::SvBaseLink& rLink )\n{\n    if( OBJECT_CLIENT_FILE == ( OBJECT_CLIENT_FILE & rLink.GetObjType() ))\n        return SvLinkManager::InsertLink( &rLink, rLink.GetObjType(),\n                                            sfx2::LINKUPDATE_ONCALL );\n    return FALSE;\n}\n\n        \/\/ erfrage die Strings fuer den Dialog\nBOOL SvxLinkManager::GetDisplayNames( const sfx2::SvBaseLink* pBaseLink,\n                                        String* pType,\n                                        String* pFile,\n                                        String* pLink,\n                                        String* pFilter ) const\n{\n    BOOL bRet = FALSE;\n    const String sLNm( pBaseLink->GetLinkSourceName() );\n    if( sLNm.Len() )\n        switch( pBaseLink->GetObjType() )\n        {\n        case OBJECT_CLIENT_FILE:\n        case OBJECT_CLIENT_GRF:\n        case OBJECT_CLIENT_OLE:\n            {\n                USHORT nPos = 0;\n                String sFile( sLNm.GetToken( 0, ::sfx2::cTokenSeperator, nPos ) );\n                String sRange( sLNm.GetToken( 0, ::sfx2::cTokenSeperator, nPos ) );\n\n                if( pFile )\n                    *pFile = sFile;\n                if( pLink )\n                    *pLink = sRange;\n                if( pFilter )\n                    *pFilter = sLNm.Copy( nPos );\n\n                if( pType )\n                {\n                    sal_uInt16 nObjType = pBaseLink->GetObjType();\n                    *pType = String( ResId(\n                                ( OBJECT_CLIENT_FILE == nObjType || OBJECT_CLIENT_OLE == nObjType )\n                                        ? RID_SVXSTR_FILELINK\n                                        : RID_SVXSTR_GRAFIKLINK\n                                        , DIALOG_MGR() ));\n                }\n                bRet = TRUE;\n            }\n            break;\n        default:\n            bRet = SvLinkManager::GetDisplayNames( pBaseLink, pType, pFile,\n                                                    pLink, pFilter );\n            break;\n        }\n    return bRet;\n}\n\n\/\/ eine Uebertragung wird abgebrochen, also alle DownloadMedien canceln\n\/\/ (ist zur Zeit nur fuer die FileLinks interressant!)\nvoid SvxLinkManager::CancelTransfers()\n{\n    SvFileObject* pFileObj;\n    sfx2::SvBaseLink* pLnk;\n\n    const sfx2::SvBaseLinks& rLnks = GetLinks();\n    for( USHORT n = rLnks.Count(); n; )\n        if( 0 != ( pLnk = &(*rLnks[ --n ])) &&\n            OBJECT_CLIENT_FILE == (OBJECT_CLIENT_FILE & pLnk->GetObjType()) &&\n            0 != ( pFileObj = (SvFileObject*)pLnk->GetObj() ) )\n\/\/          0 != ( pFileObj = (SvFileObject*)SvFileObject::ClassFactory()->\n\/\/                                  CastAndAddRef( pLnk->GetObj() )) )\n            pFileObj->CancelTransfers();\n}\n\nvoid SvxLinkManager::SetTransferPriority( sfx2::SvBaseLink& rLink, USHORT nPrio )\n{\n    SvFileObject* pFileObj =\n\/\/      (SvFileObject*)SvFileObject::ClassFactory()->\n\/\/                                  CastAndAddRef( rLink.GetObj() );\n            OBJECT_CLIENT_FILE == (OBJECT_CLIENT_FILE & rLink.GetObjType()) ?\n                (SvFileObject*)rLink.GetObj() : 0;\n}\n\n\n    \/\/ um Status Informationen aus dem FileObject an den BaseLink zu\n    \/\/ senden, gibt es eine eigene ClipBoardId. Das SvData-Object hat\n    \/\/ dann die entsprechenden Informationen als String.\n    \/\/ Wird zur Zeit fuer FileObject in Verbindung mit JavaScript benoetigt\n    \/\/ - das braucht Informationen ueber Load\/Abort\/Error\nULONG SvxLinkManager::RegisterStatusInfoId()\n{\n    static ULONG nFormat = 0;\n\n    if( !nFormat )\n    {\n\/\/ wie sieht die neue Schnittstelle aus?\n\/\/      nFormat = Exchange::RegisterFormatName( \"StatusInfo vom SvxInternalLink\" );\n        nFormat = SotExchange::RegisterFormatName(\n                    String::CreateFromAscii( RTL_CONSTASCII_STRINGPARAM(\n                                \"StatusInfo vom SvxInternalLink\" )));\n    }\n    return nFormat;\n}\n\n\/\/ ----------------------------------------------------------------------\n\nBOOL SvxLinkManager::GetGraphicFromAny( const String& rMimeType,\n                                const ::com::sun::star::uno::Any & rValue,\n                                Graphic& rGrf )\n{\n    BOOL bRet = FALSE;\n    ::com::sun::star::uno::Sequence< sal_Int8 > aSeq;\n    if( rValue.hasValue() && ( rValue >>= aSeq ) )\n    {\n        SvMemoryStream aMemStm( (void*)aSeq.getConstArray(), aSeq.getLength(),\n                                STREAM_READ );\n        aMemStm.Seek( 0 );\n\n        switch( SotExchange::GetFormatIdFromMimeType( rMimeType ) )\n        {\n        case SOT_FORMATSTR_ID_SVXB:\n            {\n                aMemStm >> rGrf;\n                bRet = TRUE;\n            }\n            break;\n        case FORMAT_GDIMETAFILE:\n            {\n                GDIMetaFile aMtf;\n                aMtf.Read( aMemStm );\n                rGrf = aMtf;\n                bRet = TRUE;\n            }\n            break;\n        case FORMAT_BITMAP:\n            {\n                Bitmap aBmp;\n                aMemStm >> aBmp;\n                rGrf = aBmp;\n                bRet = TRUE;\n            }\n            break;\n        }\n    }\n    return bRet;\n}\n\n\n\/\/ ----------------------------------------------------------------------\nString lcl_DDE_RelToAbs( const String& rTopic, const String& rBaseURL )\n{\n    String sRet;\n    INetURLObject aURL( rTopic );\n    if( INET_PROT_NOT_VALID == aURL.GetProtocol() )\n        utl::LocalFileHelper::ConvertSystemPathToURL( rTopic, rBaseURL, sRet );\n    if( !sRet.Len() )\n        sRet = URIHelper::SmartRel2Abs( INetURLObject(rBaseURL), rTopic, URIHelper::GetMaybeFileHdl(), true );\n    return sRet;\n}\n\nBOOL SvxInternalLink::Connect( sfx2::SvBaseLink* pLink )\n{\n    SfxObjectShell* pFndShell = 0;\n    String sTopic, sItem, sReferer;\n    if( pLink->GetLinkManager() &&\n        pLink->GetLinkManager()->GetDisplayNames( pLink, 0, &sTopic, &sItem )\n        && sTopic.Len() )\n    {\n        \/\/ erstmal nur ueber die DocumentShells laufen und die mit dem\n        \/\/ Namen heraussuchen:\n\n        CharClass aCC( SvxCreateLocale( LANGUAGE_SYSTEM ));\n        String sNm( sTopic ), sTmp;\n        aCC.toLower( sNm );\n\n        TypeId aType( TYPE(SfxObjectShell) );\n\n        BOOL bFirst = TRUE;\n        SfxObjectShell* pShell = pLink->GetLinkManager()->GetPersist();\n        if( pShell && pShell->GetMedium() )\n            sReferer = pShell->GetMedium()->GetBaseURL();\n\n        String sNmURL( lcl_DDE_RelToAbs( sTopic, sReferer ) );\n        aCC.toLower( sNmURL );\n\n        if ( !pShell )\n        {\n            bFirst = FALSE;\n            pShell = SfxObjectShell::GetFirst( &aType );\n        }\n\n        while( pShell )\n        {\n            if( !sTmp.Len() )\n            {\n                sTmp = pShell->GetTitle( SFX_TITLE_FULLNAME );\n                sTmp = lcl_DDE_RelToAbs(sTmp, sReferer );\n            }\n\n\n            aCC.toLower( sTmp );\n            if( sTmp == sNmURL )        \/\/ die wollen wir haben\n            {\n                pFndShell = pShell;\n                break;\n            }\n\n            if( bFirst )\n            {\n                bFirst = FALSE;\n                pShell = SfxObjectShell::GetFirst( &aType );\n            }\n            else\n                pShell = SfxObjectShell::GetNext( *pShell, &aType );\n\n            sTmp.Erase();\n        }\n    }\n\n    \/\/ empty topics are not allowed - which document is it\n    if( !sTopic.Len() )\n        return FALSE;\n\n    if( !pFndShell )\n    {\n        \/\/ dann versuche die Datei zu laden:\n        INetURLObject aURL( sTopic );\n        INetProtocol eOld = aURL.GetProtocol();\n        aURL.SetURL( sTopic = lcl_DDE_RelToAbs( sTopic, sReferer ) );\n        if( INET_PROT_NOT_VALID != eOld ||\n            INET_PROT_HTTP != aURL.GetProtocol() )\n        {\n            SfxStringItem aName( SID_FILE_NAME, sTopic );\n            SfxBoolItem aMinimized(SID_MINIMIZED, TRUE);\n            SfxStringItem aTarget( SID_TARGETNAME, String::CreateFromAscii(\"_blank\") );\n            SfxStringItem aReferer( SID_REFERER, sReferer );\n\n            \/\/ #i14200# (DDE-link crashes wordprocessor)\n            SfxAllItemSet aArgs( SFX_APP()->GetPool() );\n            aArgs.Put(aReferer);\n            aArgs.Put(aTarget);\n            aArgs.Put(aMinimized);\n            aArgs.Put(aName);\n            pFndShell = SfxObjectShell::CreateAndLoadObject( aArgs );\n        }\n    }\n\n    BOOL bRet = FALSE;\n    if( pFndShell )\n    {\n        sfx2::SvLinkSource* pNewSrc = pFndShell->DdeCreateLinkSource( sItem );\n        if( pNewSrc )\n        {\n            bRet = TRUE;\n\n            ::com::sun::star::datatransfer::DataFlavor aFl;\n            SotExchange::GetFormatDataFlavor( pLink->GetContentType(), aFl );\n\n            pLink->SetObj( pNewSrc );\n            pNewSrc->AddDataAdvise( pLink, aFl.MimeType,\n                                sfx2::LINKUPDATE_ONCALL == pLink->GetUpdateMode()\n                                    ? ADVISEMODE_ONLYONCE\n                                    : 0 );\n        }\n    }\n    return bRet;\n}\n\n\n<commit_msg>INTEGRATION: CWS fwk21 (1.25.198); FILE MERGED 2005\/08\/15 15:58:03 mba 1.25.198.1: i49676: inherit UpdateDocMode from document containing the link<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: linkmgr.cxx,v $\n *\n *  $Revision: 1.27 $\n *\n *  last change: $Author: hr $ $Date: 2005-09-30 10:08: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#pragma hdrstop\n\n#ifndef _COM_SUN_STAR_DOCUMENT_UPDATEDOCMODE_HPP_\n#include <com\/sun\/star\/document\/UpdateDocMode.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UNO_SEQUENCE_H_\n#include <com\/sun\/star\/uno\/Sequence.h>\n#endif\n#include <sot\/formats.hxx>\n#ifndef _SOT_EXCHANGE_HXX \/\/autogen\n#include <sot\/exchange.hxx>\n#endif\n#ifndef _SV_GRAPH_HXX\n#include <vcl\/graph.hxx>\n#endif\n#ifndef _LNKBASE_HXX \/\/autogen\n#include <sfx2\/lnkbase.hxx>\n#endif\n#ifndef _URLOBJ_HXX \/\/autogen\n#include <tools\/urlobj.hxx>\n#endif\n#ifndef _SFXSTRITEM_HXX \/\/autogen\n#include <svtools\/stritem.hxx>\n#endif\n#ifndef _SFXENUMITEM_HXX \/\/autogen\n#include <svtools\/eitem.hxx>\n#endif\n#ifndef _SFXINTITEM_HXX \/\/autogen\n#include <svtools\/intitem.hxx>\n#endif\n#ifndef _SFXRECTITEM_HXX \/\/autogen\n#include <svtools\/rectitem.hxx>\n#endif\n#ifndef _SFXAPP_HXX\n#include <sfx2\/app.hxx>\n#endif\n#ifndef _SFXREQUEST_HXX\n#include <sfx2\/request.hxx>\n#endif\n#ifndef _SFX_OBJSH_HXX \/\/autogen\n#include <sfx2\/objsh.hxx>\n#endif\n#ifndef _SFX_INTERNO_HXX \/\/autogen\n\/\/#include <sfx2\/interno.hxx>\n#endif\n#ifndef _SFXDISPATCH_HXX \/\/autogen\n#include <sfx2\/dispatch.hxx>\n#endif\n#ifndef _UNOTOOLS_CHARCLASS_HXX\n#include <unotools\/charclass.hxx>\n#endif\n#ifndef _UNOTOOLS_LOCALFILEHELPER_HXX\n#include <unotools\/localfilehelper.hxx>\n#endif\n#ifndef _SFXITEMSET_HXX\n#include <svtools\/itemset.hxx>\n#endif\n#ifndef SVTOOLS_URIHELPER_HXX\n#include <svtools\/urihelper.hxx>\n#endif\n#include <com\/sun\/star\/datatransfer\/DataFlavor.hpp>\n\n#include \"linkmgr.hxx\"\n#include \"fileobj.hxx\"\n#include \"dialmgr.hxx\"\n#include \"dialogs.hrc\"\n#include \"unolingu.hxx\"\n\nclass SvxInternalLink : public sfx2::SvLinkSource\n{\npublic:\n    SvxInternalLink() {}\n\n    virtual BOOL Connect( sfx2::SvBaseLink* );\n};\n\nSvxLinkManager::SvxLinkManager( SfxObjectShell* pPersist )\n{\n    SvLinkManager::SetPersist( pPersist );\n}\n\nsfx2::SvLinkSourceRef SvxLinkManager::CreateObj( sfx2::SvBaseLink * pLink )\n{\n    switch( pLink->GetObjType() )\n    {\n    case OBJECT_CLIENT_FILE:\n    case OBJECT_CLIENT_GRF:\n    case OBJECT_CLIENT_OLE:\n        return new SvFileObject;\n\n    case OBJECT_INTERN:\n        return new SvxInternalLink();\n    }\n    return SvLinkManager::CreateObj( pLink );\n}\n\n\nBOOL SvxLinkManager::InsertFileLink( sfx2::SvBaseLink& rLink,\n                                    USHORT nFileType,\n                                    const String& rFileNm,\n                                    const String* pFilterNm,\n                                    const String* pRange )\n{\n    if( !( OBJECT_CLIENT_SO & rLink.GetObjType() ))\n        return FALSE;\n\n    String sCmd( rFileNm );\n    sCmd += ::sfx2::cTokenSeperator;\n    if( pRange )\n        sCmd += *pRange;\n    if( pFilterNm )\n        ( sCmd += ::sfx2::cTokenSeperator ) += *pFilterNm;\n\n    return SvLinkManager::InsertLink( &rLink, nFileType,\n                                    sfx2::LINKUPDATE_ONCALL, &sCmd );\n}\n\nBOOL SvxLinkManager::InsertFileLink( sfx2::SvBaseLink& rLink )\n{\n    if( OBJECT_CLIENT_FILE == ( OBJECT_CLIENT_FILE & rLink.GetObjType() ))\n        return SvLinkManager::InsertLink( &rLink, rLink.GetObjType(),\n                                            sfx2::LINKUPDATE_ONCALL );\n    return FALSE;\n}\n\n        \/\/ erfrage die Strings fuer den Dialog\nBOOL SvxLinkManager::GetDisplayNames( const sfx2::SvBaseLink* pBaseLink,\n                                        String* pType,\n                                        String* pFile,\n                                        String* pLink,\n                                        String* pFilter ) const\n{\n    BOOL bRet = FALSE;\n    const String sLNm( pBaseLink->GetLinkSourceName() );\n    if( sLNm.Len() )\n        switch( pBaseLink->GetObjType() )\n        {\n        case OBJECT_CLIENT_FILE:\n        case OBJECT_CLIENT_GRF:\n        case OBJECT_CLIENT_OLE:\n            {\n                USHORT nPos = 0;\n                String sFile( sLNm.GetToken( 0, ::sfx2::cTokenSeperator, nPos ) );\n                String sRange( sLNm.GetToken( 0, ::sfx2::cTokenSeperator, nPos ) );\n\n                if( pFile )\n                    *pFile = sFile;\n                if( pLink )\n                    *pLink = sRange;\n                if( pFilter )\n                    *pFilter = sLNm.Copy( nPos );\n\n                if( pType )\n                {\n                    sal_uInt16 nObjType = pBaseLink->GetObjType();\n                    *pType = String( ResId(\n                                ( OBJECT_CLIENT_FILE == nObjType || OBJECT_CLIENT_OLE == nObjType )\n                                        ? RID_SVXSTR_FILELINK\n                                        : RID_SVXSTR_GRAFIKLINK\n                                        , DIALOG_MGR() ));\n                }\n                bRet = TRUE;\n            }\n            break;\n        default:\n            bRet = SvLinkManager::GetDisplayNames( pBaseLink, pType, pFile,\n                                                    pLink, pFilter );\n            break;\n        }\n    return bRet;\n}\n\n\/\/ eine Uebertragung wird abgebrochen, also alle DownloadMedien canceln\n\/\/ (ist zur Zeit nur fuer die FileLinks interressant!)\nvoid SvxLinkManager::CancelTransfers()\n{\n    SvFileObject* pFileObj;\n    sfx2::SvBaseLink* pLnk;\n\n    const sfx2::SvBaseLinks& rLnks = GetLinks();\n    for( USHORT n = rLnks.Count(); n; )\n        if( 0 != ( pLnk = &(*rLnks[ --n ])) &&\n            OBJECT_CLIENT_FILE == (OBJECT_CLIENT_FILE & pLnk->GetObjType()) &&\n            0 != ( pFileObj = (SvFileObject*)pLnk->GetObj() ) )\n\/\/          0 != ( pFileObj = (SvFileObject*)SvFileObject::ClassFactory()->\n\/\/                                  CastAndAddRef( pLnk->GetObj() )) )\n            pFileObj->CancelTransfers();\n}\n\nvoid SvxLinkManager::SetTransferPriority( sfx2::SvBaseLink& rLink, USHORT nPrio )\n{\n    SvFileObject* pFileObj =\n\/\/      (SvFileObject*)SvFileObject::ClassFactory()->\n\/\/                                  CastAndAddRef( rLink.GetObj() );\n            OBJECT_CLIENT_FILE == (OBJECT_CLIENT_FILE & rLink.GetObjType()) ?\n                (SvFileObject*)rLink.GetObj() : 0;\n}\n\n\n    \/\/ um Status Informationen aus dem FileObject an den BaseLink zu\n    \/\/ senden, gibt es eine eigene ClipBoardId. Das SvData-Object hat\n    \/\/ dann die entsprechenden Informationen als String.\n    \/\/ Wird zur Zeit fuer FileObject in Verbindung mit JavaScript benoetigt\n    \/\/ - das braucht Informationen ueber Load\/Abort\/Error\nULONG SvxLinkManager::RegisterStatusInfoId()\n{\n    static ULONG nFormat = 0;\n\n    if( !nFormat )\n    {\n\/\/ wie sieht die neue Schnittstelle aus?\n\/\/      nFormat = Exchange::RegisterFormatName( \"StatusInfo vom SvxInternalLink\" );\n        nFormat = SotExchange::RegisterFormatName(\n                    String::CreateFromAscii( RTL_CONSTASCII_STRINGPARAM(\n                                \"StatusInfo vom SvxInternalLink\" )));\n    }\n    return nFormat;\n}\n\n\/\/ ----------------------------------------------------------------------\n\nBOOL SvxLinkManager::GetGraphicFromAny( const String& rMimeType,\n                                const ::com::sun::star::uno::Any & rValue,\n                                Graphic& rGrf )\n{\n    BOOL bRet = FALSE;\n    ::com::sun::star::uno::Sequence< sal_Int8 > aSeq;\n    if( rValue.hasValue() && ( rValue >>= aSeq ) )\n    {\n        SvMemoryStream aMemStm( (void*)aSeq.getConstArray(), aSeq.getLength(),\n                                STREAM_READ );\n        aMemStm.Seek( 0 );\n\n        switch( SotExchange::GetFormatIdFromMimeType( rMimeType ) )\n        {\n        case SOT_FORMATSTR_ID_SVXB:\n            {\n                aMemStm >> rGrf;\n                bRet = TRUE;\n            }\n            break;\n        case FORMAT_GDIMETAFILE:\n            {\n                GDIMetaFile aMtf;\n                aMtf.Read( aMemStm );\n                rGrf = aMtf;\n                bRet = TRUE;\n            }\n            break;\n        case FORMAT_BITMAP:\n            {\n                Bitmap aBmp;\n                aMemStm >> aBmp;\n                rGrf = aBmp;\n                bRet = TRUE;\n            }\n            break;\n        }\n    }\n    return bRet;\n}\n\n\n\/\/ ----------------------------------------------------------------------\nString lcl_DDE_RelToAbs( const String& rTopic, const String& rBaseURL )\n{\n    String sRet;\n    INetURLObject aURL( rTopic );\n    if( INET_PROT_NOT_VALID == aURL.GetProtocol() )\n        utl::LocalFileHelper::ConvertSystemPathToURL( rTopic, rBaseURL, sRet );\n    if( !sRet.Len() )\n        sRet = URIHelper::SmartRel2Abs( INetURLObject(rBaseURL), rTopic, URIHelper::GetMaybeFileHdl(), true );\n    return sRet;\n}\n\nBOOL SvxInternalLink::Connect( sfx2::SvBaseLink* pLink )\n{\n    SfxObjectShell* pFndShell = 0;\n    USHORT nUpdateMode = com::sun::star::document::UpdateDocMode::NO_UPDATE;\n    String sTopic, sItem, sReferer;\n    if( pLink->GetLinkManager() &&\n        pLink->GetLinkManager()->GetDisplayNames( pLink, 0, &sTopic, &sItem )\n        && sTopic.Len() )\n    {\n        \/\/ erstmal nur ueber die DocumentShells laufen und die mit dem\n        \/\/ Namen heraussuchen:\n\n        CharClass aCC( SvxCreateLocale( LANGUAGE_SYSTEM ));\n        String sNm( sTopic ), sTmp;\n        aCC.toLower( sNm );\n\n        TypeId aType( TYPE(SfxObjectShell) );\n\n        BOOL bFirst = TRUE;\n        SfxObjectShell* pShell = pLink->GetLinkManager()->GetPersist();\n        if( pShell && pShell->GetMedium() )\n        {\n            sReferer = pShell->GetMedium()->GetBaseURL();\n            SFX_ITEMSET_ARG( pShell->GetMedium()->GetItemSet(), pItem, SfxUInt16Item, SID_UPDATEDOCMODE, sal_False );\n            if ( pItem )\n                nUpdateMode = pItem->GetValue();\n        }\n\n        String sNmURL( lcl_DDE_RelToAbs( sTopic, sReferer ) );\n        aCC.toLower( sNmURL );\n\n        if ( !pShell )\n        {\n            bFirst = FALSE;\n            pShell = SfxObjectShell::GetFirst( &aType );\n        }\n\n        while( pShell )\n        {\n            if( !sTmp.Len() )\n            {\n                sTmp = pShell->GetTitle( SFX_TITLE_FULLNAME );\n                sTmp = lcl_DDE_RelToAbs(sTmp, sReferer );\n            }\n\n\n            aCC.toLower( sTmp );\n            if( sTmp == sNmURL )        \/\/ die wollen wir haben\n            {\n                pFndShell = pShell;\n                break;\n            }\n\n            if( bFirst )\n            {\n                bFirst = FALSE;\n                pShell = SfxObjectShell::GetFirst( &aType );\n            }\n            else\n                pShell = SfxObjectShell::GetNext( *pShell, &aType );\n\n            sTmp.Erase();\n        }\n    }\n\n    \/\/ empty topics are not allowed - which document is it\n    if( !sTopic.Len() )\n        return FALSE;\n\n    if( !pFndShell )\n    {\n        \/\/ dann versuche die Datei zu laden:\n        INetURLObject aURL( sTopic );\n        INetProtocol eOld = aURL.GetProtocol();\n        aURL.SetURL( sTopic = lcl_DDE_RelToAbs( sTopic, sReferer ) );\n        if( INET_PROT_NOT_VALID != eOld ||\n            INET_PROT_HTTP != aURL.GetProtocol() )\n        {\n            SfxStringItem aName( SID_FILE_NAME, sTopic );\n            SfxBoolItem aMinimized(SID_MINIMIZED, TRUE);\n            SfxStringItem aTarget( SID_TARGETNAME, String::CreateFromAscii(\"_blank\") );\n            SfxStringItem aReferer( SID_REFERER, sReferer );\n            SfxUInt16Item aUpdate( SID_UPDATEDOCMODE, nUpdateMode );\n\n            \/\/ #i14200# (DDE-link crashes wordprocessor)\n            SfxAllItemSet aArgs( SFX_APP()->GetPool() );\n            aArgs.Put(aReferer);\n            aArgs.Put(aTarget);\n            aArgs.Put(aMinimized);\n            aArgs.Put(aName);\n            aArgs.Put(aUpdate);\n            pFndShell = SfxObjectShell::CreateAndLoadObject( aArgs );\n        }\n    }\n\n    BOOL bRet = FALSE;\n    if( pFndShell )\n    {\n        sfx2::SvLinkSource* pNewSrc = pFndShell->DdeCreateLinkSource( sItem );\n        if( pNewSrc )\n        {\n            bRet = TRUE;\n\n            ::com::sun::star::datatransfer::DataFlavor aFl;\n            SotExchange::GetFormatDataFlavor( pLink->GetContentType(), aFl );\n\n            pLink->SetObj( pNewSrc );\n            pNewSrc->AddDataAdvise( pLink, aFl.MimeType,\n                                sfx2::LINKUPDATE_ONCALL == pLink->GetUpdateMode()\n                                    ? ADVISEMODE_ONLYONCE\n                                    : 0 );\n        }\n    }\n    return bRet;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2000, 2010 Oracle and\/or its affiliates.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org.  If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\n\n#include <hintids.hxx>\n\n#include <com\/sun\/star\/i18n\/ScriptType.hdl>\n#include <fmtcntnt.hxx>\n#include <txatbase.hxx>\n#include <frmatr.hxx>\n#include <viscrs.hxx>\n#include <callnk.hxx>\n#include <crsrsh.hxx>\n#include <doc.hxx>\n#include <frmfmt.hxx>\n#include <txtfrm.hxx>\n#include <tabfrm.hxx>\n#include <rowfrm.hxx>\n#include <fmtfsize.hxx>\n#include <ndtxt.hxx>\n#include <flyfrm.hxx>\n#include <breakit.hxx>\n\n#include<vcl\/window.hxx>\n\n\nSwCallLink::SwCallLink( SwCrsrShell & rSh, sal_uLong nAktNode, xub_StrLen nAktCntnt,\n                        sal_uInt8 nAktNdTyp, long nLRPos, bool bAktSelection )\n    : rShell( rSh ), nNode( nAktNode ), nCntnt( nAktCntnt ),\n      nNdTyp( nAktNdTyp ), nLeftFrmPos( nLRPos ),\n      bHasSelection( bAktSelection )\n{\n}\n\n\nSwCallLink::SwCallLink( SwCrsrShell & rSh )\n    : rShell( rSh )\n{\n    \/\/ remember SPoint-values of current cursor\n    SwPaM* pCrsr = rShell.IsTableMode() ? rShell.GetTblCrs() : rShell.GetCrsr();\n    SwNode& rNd = pCrsr->GetPoint()->nNode.GetNode();\n    nNode = rNd.GetIndex();\n    nCntnt = pCrsr->GetPoint()->nContent.GetIndex();\n    nNdTyp = rNd.GetNodeType();\n    bHasSelection = ( *pCrsr->GetPoint() != *pCrsr->GetMark() );\n\n    if( rNd.IsTxtNode() )\n        nLeftFrmPos = SwCallLink::getLayoutFrm( rShell.GetLayout(), (SwTxtNode&)rNd, nCntnt,\n                                            !rShell.ActionPend() );\n    else\n    {\n        nLeftFrmPos = 0;\n\n        \/\/ A special treatment for SwFeShell:\n        \/\/ When deleting the header\/footer, footnotes SwFeShell sets the\n        \/\/ Cursor to NULL (Node + Content).\n        \/\/ If the Cursor is not on a CntntNode (ContentNode) this fact gets\n        \/\/ saved in NdType.\n        if( ND_CONTENTNODE & nNdTyp )\n            nNdTyp = 0;\n    }\n}\n\nvoid lcl_notifyRow(const SwCntntNode* pNode, SwCrsrShell& rShell)\n{\n    if ( pNode != NULL )\n    {\n        SwFrm *myFrm = pNode->getLayoutFrm( rShell.GetLayout() );\n        if (myFrm!=NULL)\n        {\n            \/\/ We need to emulated a change of the row height in order\n            \/\/ to have the complete row redrawn\n            SwRowFrm* pRow = myFrm->FindRowFrm();\n            if ( pRow )\n            {\n                const SwTableLine* pLine = pRow->GetTabLine( );\n                SwFmtFrmSize pSize = pLine->GetFrmFmt( )->GetFrmSize( );\n                pRow->ModifyNotification( NULL, &pSize );\n            }\n        }\n    }\n}\n\nSwCallLink::~SwCallLink()\n{\n    if( !nNdTyp || !rShell.bCallChgLnk )        \/\/ see ctor\n        return ;\n\n    \/\/ If travelling over Nodes check formats and register them anew at the\n    \/\/ new Node.\n    SwPaM* pCurCrsr = rShell.IsTableMode() ? rShell.GetTblCrs() : rShell.GetCrsr();\n    SwCntntNode * pCNd = pCurCrsr->GetCntntNode();\n    if( !pCNd )\n        return;\n\n    lcl_notifyRow(pCNd, rShell);\n\n    const SwDoc *pDoc=rShell.GetDoc();\n    const SwCntntNode *pNode = NULL;\n    if ( ( pDoc != NULL && nNode < pDoc->GetNodes( ).Count( ) ) )\n    {\n        pNode = pDoc->GetNodes()[nNode]->GetCntntNode();\n    }\n    lcl_notifyRow(pNode, rShell);\n\n    xub_StrLen nCmp, nAktCntnt = pCurCrsr->GetPoint()->nContent.GetIndex();\n    sal_uInt16 nNdWhich = pCNd->GetNodeType();\n    sal_uLong nAktNode = pCurCrsr->GetPoint()->nNode.GetIndex();\n\n    \/\/ Register the Shell as dependent at the current Node. By doing this all\n    \/\/ attribute changes can be signaled over the link.\n    pCNd->Add( &rShell );\n\n    if( nNdTyp != nNdWhich || nNode != nAktNode )\n    {\n        \/\/ Every time a switch between nodes occurs, there is a chance that\n        \/\/ new attributes do apply - meaning text-attributes.\n        \/\/ So the currently applying attributes would have to be determined.\n        \/\/ That can be done in one go by the handler.\n        rShell.CallChgLnk();\n    }\n    else if( !bHasSelection != !(*pCurCrsr->GetPoint() != *pCurCrsr->GetMark()) )\n    {\n        \/\/ always call change link when selection changes\n        rShell.CallChgLnk();\n    }\n    else if( rShell.aChgLnk.IsSet() && ND_TEXTNODE == nNdWhich &&\n             nCntnt != nAktCntnt )\n    {\n        \/\/ If travelling with left\/right only and the frame is\n        \/\/ unchanged (columns!) then check text hints.\n        if( nLeftFrmPos == SwCallLink::getLayoutFrm( rShell.GetLayout(), (SwTxtNode&)*pCNd, nAktCntnt,\n                                                    !rShell.ActionPend() ) &&\n            (( nCmp = nCntnt ) + 1 == nAktCntnt ||          \/\/ Right\n            nCntnt -1 == ( nCmp = nAktCntnt )) )            \/\/ Left\n        {\n            if( nCmp == nAktCntnt && pCurCrsr->HasMark() ) \/\/ left & select\n                ++nCmp;\n            if ( ((SwTxtNode*)pCNd)->HasHints() )\n            {\n\n                const SwpHints &rHts = ((SwTxtNode*)pCNd)->GetSwpHints();\n                sal_uInt16 n;\n                xub_StrLen nStart;\n                const xub_StrLen *pEnd;\n\n                for( n = 0; n < rHts.Count(); n++ )\n                {\n                    const SwTxtAttr* pHt = rHts[ n ];\n                    pEnd = pHt->GetEnd();\n                    nStart = *pHt->GetStart();\n\n                    \/\/ If \"only start\" or \"start and end equal\" then call on\n                    \/\/ every overflow of start.\n                    if( ( !pEnd || ( nStart == *pEnd ) ) &&\n                        ( nStart == nCntnt || nStart == nAktCntnt) )\n                    {\n                        rShell.CallChgLnk();\n                        return;\n                    }\n\n                    \/\/ If the attribute has an area and that area is not empty ...\n                    else if( pEnd && nStart < *pEnd &&\n                        \/\/ ... then test if travelling occurred via start\/end.\n                        ( nStart == nCmp ||\n                            ( pHt->DontExpand() ? nCmp == *pEnd-1\n                                                : nCmp == *pEnd ) ))\n                    {\n                        rShell.CallChgLnk();\n                        return;\n                    }\n                    nStart = 0;\n                }\n            }\n\n            if( pBreakIt->GetBreakIter().is() )\n            {\n                const String& rTxt = ((SwTxtNode*)pCNd)->GetTxt();\n                if( !nCmp ||\n                    pBreakIt->GetBreakIter()->getScriptType( rTxt, nCmp )\n                     != pBreakIt->GetBreakIter()->getScriptType( rTxt, nCmp - 1 ))\n                {\n                    rShell.CallChgLnk();\n                    return;\n                }\n            }\n        }\n        else\n            \/\/ If travelling more than one character with home\/end\/.. then\n            \/\/ always call ChgLnk, because it can not be determined here what\n            \/\/ has changed. Something may have changed.\n            rShell.CallChgLnk();\n    }\n\n    const SwFrm* pFrm;\n    const SwFlyFrm *pFlyFrm;\n    if( !rShell.ActionPend() && 0 != ( pFrm = pCNd->getLayoutFrm(rShell.GetLayout(),0,0,sal_False) ) &&\n        0 != ( pFlyFrm = pFrm->FindFlyFrm() ) && !rShell.IsTableMode() )\n    {\n        const SwNodeIndex* pIndex = pFlyFrm->GetFmt()->GetCntnt().GetCntntIdx();\n        OSL_ENSURE( pIndex, \"Fly ohne Cntnt\" );\n\n        if (!pIndex)\n            return;\n\n        const SwNode& rStNd = pIndex->GetNode();\n\n        if( rStNd.EndOfSectionNode()->StartOfSectionIndex() > nNode ||\n            nNode > rStNd.EndOfSectionIndex() )\n            rShell.GetFlyMacroLnk().Call( (void*)pFlyFrm->GetFmt() );\n    }\n}\n\nlong SwCallLink::getLayoutFrm( const SwRootFrm* pRoot, SwTxtNode& rNd, xub_StrLen nCntPos, sal_Bool bCalcFrm )\n{\n    SwTxtFrm* pFrm = (SwTxtFrm*)rNd.getLayoutFrm(pRoot,0,0,bCalcFrm), *pNext = pFrm;\n    if ( pFrm && !pFrm->IsHiddenNow() )\n    {\n        if( pFrm->HasFollow() )\n            while( 0 != ( pNext = (SwTxtFrm*)pFrm->GetFollow() ) &&\n                    nCntPos >= pNext->GetOfst() )\n                pFrm = pNext;\n\n        return pFrm->Frm().Left();\n    }\n    return 0;\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>n#751313 SwCallLink: avoid redrawing complete rows without nested tables<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\n\n#include <hintids.hxx>\n\n#include <com\/sun\/star\/i18n\/ScriptType.hdl>\n#include <fmtcntnt.hxx>\n#include <txatbase.hxx>\n#include <frmatr.hxx>\n#include <viscrs.hxx>\n#include <callnk.hxx>\n#include <crsrsh.hxx>\n#include <doc.hxx>\n#include <frmfmt.hxx>\n#include <txtfrm.hxx>\n#include <tabfrm.hxx>\n#include <rowfrm.hxx>\n#include <fmtfsize.hxx>\n#include <ndtxt.hxx>\n#include <flyfrm.hxx>\n#include <breakit.hxx>\n\n#include<vcl\/window.hxx>\n\n\nSwCallLink::SwCallLink( SwCrsrShell & rSh, sal_uLong nAktNode, xub_StrLen nAktCntnt,\n                        sal_uInt8 nAktNdTyp, long nLRPos, bool bAktSelection )\n    : rShell( rSh ), nNode( nAktNode ), nCntnt( nAktCntnt ),\n      nNdTyp( nAktNdTyp ), nLeftFrmPos( nLRPos ),\n      bHasSelection( bAktSelection )\n{\n}\n\n\nSwCallLink::SwCallLink( SwCrsrShell & rSh )\n    : rShell( rSh )\n{\n    \/\/ remember SPoint-values of current cursor\n    SwPaM* pCrsr = rShell.IsTableMode() ? rShell.GetTblCrs() : rShell.GetCrsr();\n    SwNode& rNd = pCrsr->GetPoint()->nNode.GetNode();\n    nNode = rNd.GetIndex();\n    nCntnt = pCrsr->GetPoint()->nContent.GetIndex();\n    nNdTyp = rNd.GetNodeType();\n    bHasSelection = ( *pCrsr->GetPoint() != *pCrsr->GetMark() );\n\n    if( rNd.IsTxtNode() )\n        nLeftFrmPos = SwCallLink::getLayoutFrm( rShell.GetLayout(), (SwTxtNode&)rNd, nCntnt,\n                                            !rShell.ActionPend() );\n    else\n    {\n        nLeftFrmPos = 0;\n\n        \/\/ A special treatment for SwFeShell:\n        \/\/ When deleting the header\/footer, footnotes SwFeShell sets the\n        \/\/ Cursor to NULL (Node + Content).\n        \/\/ If the Cursor is not on a CntntNode (ContentNode) this fact gets\n        \/\/ saved in NdType.\n        if( ND_CONTENTNODE & nNdTyp )\n            nNdTyp = 0;\n    }\n}\n\nvoid lcl_notifyRow(const SwCntntNode* pNode, SwCrsrShell& rShell)\n{\n    if ( pNode != NULL )\n    {\n        SwFrm *myFrm = pNode->getLayoutFrm( rShell.GetLayout() );\n        if (myFrm!=NULL)\n        {\n            \/\/ We need to emulated a change of the row height in order\n            \/\/ to have the complete row redrawn\n            SwRowFrm* pRow = myFrm->FindRowFrm();\n            if ( pRow )\n            {\n                const SwTableLine* pLine = pRow->GetTabLine( );\n                \/\/ Avoid redrawing the complete row if there are no nested tables\n                bool bHasTable = false;\n                SwFrm *pCell = pRow->GetLower();\n                for (; pCell && !bHasTable; pCell = pCell->GetNext())\n                {\n                    SwFrm *pContent = pCell->GetLower();\n                    for (; pContent && !bHasTable; pContent = pContent->GetNext())\n                        if (pContent->GetType() == FRM_TAB)\n                            bHasTable = true;\n                }\n                if (bHasTable)\n                {\n                    SwFmtFrmSize pSize = pLine->GetFrmFmt()->GetFrmSize();\n                    pRow->ModifyNotification(NULL, &pSize);\n                }\n            }\n        }\n    }\n}\n\nSwCallLink::~SwCallLink()\n{\n    if( !nNdTyp || !rShell.bCallChgLnk )        \/\/ see ctor\n        return ;\n\n    \/\/ If travelling over Nodes check formats and register them anew at the\n    \/\/ new Node.\n    SwPaM* pCurCrsr = rShell.IsTableMode() ? rShell.GetTblCrs() : rShell.GetCrsr();\n    SwCntntNode * pCNd = pCurCrsr->GetCntntNode();\n    if( !pCNd )\n        return;\n\n    lcl_notifyRow(pCNd, rShell);\n\n    const SwDoc *pDoc=rShell.GetDoc();\n    const SwCntntNode *pNode = NULL;\n    if ( ( pDoc != NULL && nNode < pDoc->GetNodes( ).Count( ) ) )\n    {\n        pNode = pDoc->GetNodes()[nNode]->GetCntntNode();\n    }\n    lcl_notifyRow(pNode, rShell);\n\n    xub_StrLen nCmp, nAktCntnt = pCurCrsr->GetPoint()->nContent.GetIndex();\n    sal_uInt16 nNdWhich = pCNd->GetNodeType();\n    sal_uLong nAktNode = pCurCrsr->GetPoint()->nNode.GetIndex();\n\n    \/\/ Register the Shell as dependent at the current Node. By doing this all\n    \/\/ attribute changes can be signaled over the link.\n    pCNd->Add( &rShell );\n\n    if( nNdTyp != nNdWhich || nNode != nAktNode )\n    {\n        \/\/ Every time a switch between nodes occurs, there is a chance that\n        \/\/ new attributes do apply - meaning text-attributes.\n        \/\/ So the currently applying attributes would have to be determined.\n        \/\/ That can be done in one go by the handler.\n        rShell.CallChgLnk();\n    }\n    else if( !bHasSelection != !(*pCurCrsr->GetPoint() != *pCurCrsr->GetMark()) )\n    {\n        \/\/ always call change link when selection changes\n        rShell.CallChgLnk();\n    }\n    else if( rShell.aChgLnk.IsSet() && ND_TEXTNODE == nNdWhich &&\n             nCntnt != nAktCntnt )\n    {\n        \/\/ If travelling with left\/right only and the frame is\n        \/\/ unchanged (columns!) then check text hints.\n        if( nLeftFrmPos == SwCallLink::getLayoutFrm( rShell.GetLayout(), (SwTxtNode&)*pCNd, nAktCntnt,\n                                                    !rShell.ActionPend() ) &&\n            (( nCmp = nCntnt ) + 1 == nAktCntnt ||          \/\/ Right\n            nCntnt -1 == ( nCmp = nAktCntnt )) )            \/\/ Left\n        {\n            if( nCmp == nAktCntnt && pCurCrsr->HasMark() ) \/\/ left & select\n                ++nCmp;\n            if ( ((SwTxtNode*)pCNd)->HasHints() )\n            {\n\n                const SwpHints &rHts = ((SwTxtNode*)pCNd)->GetSwpHints();\n                sal_uInt16 n;\n                xub_StrLen nStart;\n                const xub_StrLen *pEnd;\n\n                for( n = 0; n < rHts.Count(); n++ )\n                {\n                    const SwTxtAttr* pHt = rHts[ n ];\n                    pEnd = pHt->GetEnd();\n                    nStart = *pHt->GetStart();\n\n                    \/\/ If \"only start\" or \"start and end equal\" then call on\n                    \/\/ every overflow of start.\n                    if( ( !pEnd || ( nStart == *pEnd ) ) &&\n                        ( nStart == nCntnt || nStart == nAktCntnt) )\n                    {\n                        rShell.CallChgLnk();\n                        return;\n                    }\n\n                    \/\/ If the attribute has an area and that area is not empty ...\n                    else if( pEnd && nStart < *pEnd &&\n                        \/\/ ... then test if travelling occurred via start\/end.\n                        ( nStart == nCmp ||\n                            ( pHt->DontExpand() ? nCmp == *pEnd-1\n                                                : nCmp == *pEnd ) ))\n                    {\n                        rShell.CallChgLnk();\n                        return;\n                    }\n                    nStart = 0;\n                }\n            }\n\n            if( pBreakIt->GetBreakIter().is() )\n            {\n                const String& rTxt = ((SwTxtNode*)pCNd)->GetTxt();\n                if( !nCmp ||\n                    pBreakIt->GetBreakIter()->getScriptType( rTxt, nCmp )\n                     != pBreakIt->GetBreakIter()->getScriptType( rTxt, nCmp - 1 ))\n                {\n                    rShell.CallChgLnk();\n                    return;\n                }\n            }\n        }\n        else\n            \/\/ If travelling more than one character with home\/end\/.. then\n            \/\/ always call ChgLnk, because it can not be determined here what\n            \/\/ has changed. Something may have changed.\n            rShell.CallChgLnk();\n    }\n\n    const SwFrm* pFrm;\n    const SwFlyFrm *pFlyFrm;\n    if( !rShell.ActionPend() && 0 != ( pFrm = pCNd->getLayoutFrm(rShell.GetLayout(),0,0,sal_False) ) &&\n        0 != ( pFlyFrm = pFrm->FindFlyFrm() ) && !rShell.IsTableMode() )\n    {\n        const SwNodeIndex* pIndex = pFlyFrm->GetFmt()->GetCntnt().GetCntntIdx();\n        OSL_ENSURE( pIndex, \"Fly ohne Cntnt\" );\n\n        if (!pIndex)\n            return;\n\n        const SwNode& rStNd = pIndex->GetNode();\n\n        if( rStNd.EndOfSectionNode()->StartOfSectionIndex() > nNode ||\n            nNode > rStNd.EndOfSectionIndex() )\n            rShell.GetFlyMacroLnk().Call( (void*)pFlyFrm->GetFmt() );\n    }\n}\n\nlong SwCallLink::getLayoutFrm( const SwRootFrm* pRoot, SwTxtNode& rNd, xub_StrLen nCntPos, sal_Bool bCalcFrm )\n{\n    SwTxtFrm* pFrm = (SwTxtFrm*)rNd.getLayoutFrm(pRoot,0,0,bCalcFrm), *pNext = pFrm;\n    if ( pFrm && !pFrm->IsHiddenNow() )\n    {\n        if( pFrm->HasFollow() )\n            while( 0 != ( pNext = (SwTxtFrm*)pFrm->GetFollow() ) &&\n                    nCntPos >= pNext->GetOfst() )\n                pFrm = pNext;\n\n        return pFrm->Frm().Left();\n    }\n    return 0;\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  Copyright (c) 2007, Image Engine Design Inc. All rights reserved.\n\/\/\n\/\/  Redistribution and use in source and binary forms, with or without\n\/\/  modification, are permitted provided that the following conditions are\n\/\/  met:\n\/\/\n\/\/     * Redistributions of source code must retain the above copyright\n\/\/       notice, this list of conditions and the following disclaimer.\n\/\/\n\/\/     * Redistributions in binary form must reproduce the above copyright\n\/\/       notice, this list of conditions and the following disclaimer in the\n\/\/       documentation and\/or other materials provided with the distribution.\n\/\/\n\/\/     * Neither the name of Image Engine Design nor the names of any\n\/\/       other contributors to this software may be used to endorse or\n\/\/       promote products derived from this software without specific prior\n\/\/       written permission.\n\/\/\n\/\/  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n\/\/  IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\n\/\/  THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n\/\/  PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n\/\/  CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\/\/  EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/  PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\/\/  PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\/\/  LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/  NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"boost\/python.hpp\"\n\n#include \"maya\/MPxNode.h\"\n#include \"maya\/MSelectionList.h\"\n#include \"maya\/MFnDependencyNode.h\"\n\n#include \"IECore\/Parameterised.h\"\n\n#include \"IECoreMaya\/IECoreMaya.h\"\n#include \"IECoreMaya\/bindings\/ParameterisedHolderBinding.h\"\n#include \"IECoreMaya\/bindings\/MayaPythonUtilBinding.h\"\n#include \"IECoreMaya\/bindings\/MObjectBinding.h\"\n#include \"IECoreMaya\/bindings\/NodeBinding.h\"\n#include \"IECoreMaya\/bindings\/DagNodeBinding.h\"\n#include \"IECoreMaya\/bindings\/ConverterBinding.h\"\n#include \"IECoreMaya\/bindings\/FromMayaConverterBinding.h\"\n#include \"IECoreMaya\/bindings\/FromMayaPlugConverterBinding.h\"\n#include \"IECoreMaya\/bindings\/PlugBinding.h\"\n#include \"IECoreMaya\/bindings\/FromMayaObjectConverterBinding.h\"\n#include \"IECoreMaya\/bindings\/FromMayaCameraConverterBinding.h\"\n#include \"IECoreMaya\/bindings\/FromMayaCameraConverterBinding.h\"\n#include \"IECoreMaya\/bindings\/MayaMeshBuilderBinding.h\"\n\nusing namespace IECore;\nusing namespace IECoreMaya;\n\nusing namespace boost::python;\n\n\/\/\/ Maya is built with 2-byte Unicode characters, so we need to ensure\n\/\/\/ that we're doing the same so that all external symbols resolve correctly at\n\/\/\/ runtime.\nBOOST_STATIC_ASSERT(sizeof(Py_UNICODE) == 2);\n\nBOOST_PYTHON_MODULE(_IECoreMaya)\n{\n\tbindMayaPythonUtil();\t\t\n\tbindMObject();\n\tbindNode();\n\tbindDagNode();\n\tbindParameterisedHolder();\n\tbindConverter();\n\tbindFromMayaConverter();\n\tbindFromMayaPlugConverter();\n\tbindPlug();\n\tbindFromMayaObjectConverter();\n\tbindFromMayaCameraConverter();\n\tbindMayaMeshBuilder();\t\n\t\n\tdef( \"majorVersion\", &IECoreMaya::majorVersion );\n\tdef( \"minorVersion\", &IECoreMaya::minorVersion );\n\tdef( \"patchVersion\", &IECoreMaya::patchVersion );\n\tdef( \"versionString\", &IECoreMaya::versionString, return_value_policy<copy_const_reference>() );\t\n}\n<commit_msg>Updated unicode compile-time assertion for Maya 2008<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  Copyright (c) 2007, Image Engine Design Inc. All rights reserved.\n\/\/\n\/\/  Redistribution and use in source and binary forms, with or without\n\/\/  modification, are permitted provided that the following conditions are\n\/\/  met:\n\/\/\n\/\/     * Redistributions of source code must retain the above copyright\n\/\/       notice, this list of conditions and the following disclaimer.\n\/\/\n\/\/     * Redistributions in binary form must reproduce the above copyright\n\/\/       notice, this list of conditions and the following disclaimer in the\n\/\/       documentation and\/or other materials provided with the distribution.\n\/\/\n\/\/     * Neither the name of Image Engine Design nor the names of any\n\/\/       other contributors to this software may be used to endorse or\n\/\/       promote products derived from this software without specific prior\n\/\/       written permission.\n\/\/\n\/\/  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n\/\/  IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\n\/\/  THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n\/\/  PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n\/\/  CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\/\/  EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/  PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\/\/  PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\/\/  LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/  NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"boost\/python.hpp\"\n\n#include \"maya\/MPxNode.h\"\n#include \"maya\/MSelectionList.h\"\n#include \"maya\/MFnDependencyNode.h\"\n\n#include \"IECore\/Parameterised.h\"\n\n#include \"IECoreMaya\/IECoreMaya.h\"\n#include \"IECoreMaya\/bindings\/ParameterisedHolderBinding.h\"\n#include \"IECoreMaya\/bindings\/MayaPythonUtilBinding.h\"\n#include \"IECoreMaya\/bindings\/MObjectBinding.h\"\n#include \"IECoreMaya\/bindings\/NodeBinding.h\"\n#include \"IECoreMaya\/bindings\/DagNodeBinding.h\"\n#include \"IECoreMaya\/bindings\/ConverterBinding.h\"\n#include \"IECoreMaya\/bindings\/FromMayaConverterBinding.h\"\n#include \"IECoreMaya\/bindings\/FromMayaPlugConverterBinding.h\"\n#include \"IECoreMaya\/bindings\/PlugBinding.h\"\n#include \"IECoreMaya\/bindings\/FromMayaObjectConverterBinding.h\"\n#include \"IECoreMaya\/bindings\/FromMayaCameraConverterBinding.h\"\n#include \"IECoreMaya\/bindings\/FromMayaCameraConverterBinding.h\"\n#include \"IECoreMaya\/bindings\/MayaMeshBuilderBinding.h\"\n\nusing namespace IECore;\nusing namespace IECoreMaya;\n\nusing namespace boost::python;\n\n\/\/\/ Maya 8.5 is built with 2-byte Unicode characters, Maya 2008 with 4-byte characters.\n\/\/\/ So we need to ensure that we're doing the same so that all external symbols resolve \n\/\/\/ correctly at runtime.\n#if ( MAYA_API_VERSION >= 2008 )\nBOOST_STATIC_ASSERT(sizeof(Py_UNICODE) == 4);\n#else\nBOOST_STATIC_ASSERT(sizeof(Py_UNICODE) == 2);\n#endif\n\nBOOST_PYTHON_MODULE(_IECoreMaya)\n{\n\tbindMayaPythonUtil();\t\t\n\tbindMObject();\n\tbindNode();\n\tbindDagNode();\n\tbindParameterisedHolder();\n\tbindConverter();\n\tbindFromMayaConverter();\n\tbindFromMayaPlugConverter();\n\tbindPlug();\n\tbindFromMayaObjectConverter();\n\tbindFromMayaCameraConverter();\n\tbindMayaMeshBuilder();\t\n\t\n\tdef( \"majorVersion\", &IECoreMaya::majorVersion );\n\tdef( \"minorVersion\", &IECoreMaya::minorVersion );\n\tdef( \"patchVersion\", &IECoreMaya::patchVersion );\n\tdef( \"versionString\", &IECoreMaya::versionString, return_value_policy<copy_const_reference>() );\t\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: docstat.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: vg $ $Date: 2003-04-17 13:51:50 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n\n#pragma hdrstop\n\n#ifndef _DOCSTAT_HXX\n#include <docstat.hxx>\n#endif\n\n\n\/************************************************************************\n *                         SwDocStat::SwDocStat()\n ************************************************************************\/\n\nSwDocStat::SwDocStat() :\n    nTbl(0),\n    nGrf(0),\n    nOLE(0),\n    nPage(1),\n    nPara(1),\n    nWord(0),\n    nChar(0),\n    bModified(TRUE),\n    pInternStat(0)\n{}\n\n\/************************************************************************\n *                         void SwDocStat::Reset()\n ************************************************************************\/\n\nvoid SwDocStat::Reset()\n{\n    nTbl    = 0;\n    nGrf    = 0;\n    nOLE    = 0;\n    nPage   = 1;\n    nPara   = 1;\n    nWord   = 0;\n    nChar   = 0;\n    bModified = TRUE;\n    pInternStat = 0;\n}\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.2.1254); FILE MERGED 2005\/09\/05 13:39:11 rt 1.2.1254.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: docstat.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 03: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\n#pragma hdrstop\n\n#ifndef _DOCSTAT_HXX\n#include <docstat.hxx>\n#endif\n\n\n\/************************************************************************\n *                         SwDocStat::SwDocStat()\n ************************************************************************\/\n\nSwDocStat::SwDocStat() :\n    nTbl(0),\n    nGrf(0),\n    nOLE(0),\n    nPage(1),\n    nPara(1),\n    nWord(0),\n    nChar(0),\n    bModified(TRUE),\n    pInternStat(0)\n{}\n\n\/************************************************************************\n *                         void SwDocStat::Reset()\n ************************************************************************\/\n\nvoid SwDocStat::Reset()\n{\n    nTbl    = 0;\n    nGrf    = 0;\n    nOLE    = 0;\n    nPage   = 1;\n    nPara   = 1;\n    nWord   = 0;\n    nChar   = 0;\n    bModified = TRUE;\n    pInternStat = 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\nHighly Optimized Object-oriented Many-particle Dynamics -- Blue Edition\n(HOOMD-blue) Open Source Software License Copyright 2008-2011 Ames Laboratory\nIowa State University and The Regents of the University of Michigan All rights\nreserved.\n\nHOOMD-blue may contain modifications (\"Contributions\") provided, and to which\ncopyright is held, by various Contributors who have granted The Regents of the\nUniversity of Michigan the right to modify and\/or distribute such Contributions.\n\nYou may redistribute, use, and create derivate works of HOOMD-blue, in source\nand binary forms, provided you abide by the following conditions:\n\n* Redistributions of source code must retain the above copyright notice, this\nlist of conditions, and the following disclaimer both in the code and\nprominently in any materials provided with the distribution.\n\n* Redistributions in binary form must reproduce the above copyright notice, this\nlist of conditions, and the following disclaimer in the documentation and\/or\nother materials provided with the distribution.\n\n* All publications and presentations based on HOOMD-blue, including any reports\nor published results obtained, in whole or in part, with HOOMD-blue, will\nacknowledge its use according to the terms posted at the time of submission on:\nhttp:\/\/codeblue.umich.edu\/hoomd-blue\/citations.html\n\n* Any electronic documents citing HOOMD-Blue will link to the HOOMD-Blue website:\nhttp:\/\/codeblue.umich.edu\/hoomd-blue\/\n\n* Apart from the above required attributions, neither the name of the copyright\nholder nor the names of HOOMD-blue's contributors may be used to endorse or\npromote products derived from this software without specific prior written\npermission.\n\nDisclaimer\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER AND CONTRIBUTORS ``AS IS'' AND\nANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\nWARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, AND\/OR ANY\nWARRANTIES THAT THIS SOFTWARE IS FREE OF INFRINGEMENT ARE DISCLAIMED.\n\nIN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,\nINDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\nBUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\nLIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE\nOR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF\nADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*\/\n\n\/\/ Maintainer: joaander\n\n\/\/ temporarily work around issues with the new boost fileystem libraries\n\/\/ http:\/\/www.boost.org\/doc\/libs\/1_46_1\/libs\/filesystem\/v3\/doc\/index.htm\n\n#ifdef WIN32\n#pragma warning( push )\n#pragma warning( disable : 4103 4244 )\n#endif\n\n#include <boost\/version.hpp>\n#include <boost\/python.hpp>\n\n#include <boost\/filesystem\/operations.hpp>\n#include <boost\/filesystem\/convenience.hpp>\n\nusing namespace boost::filesystem;\n\n#include \"PathUtils.h\"\n#include \"HOOMDVersion.h\"\n\n#include <string>\n#include <sstream>\n#include <list>\n#include <iostream>\nusing namespace std;\n\n#if PY_MAJOR_VERSION >= 3\n#include \"stdlib.h\"\n#endif\n\n\/\/ hack to support both version 2 and version 3 of the boost filesystem API\n#if (BOOST_VERSION >= 104400)\n#define native_file_string string\n#endif\n\n\/*! \\file hoomd.cc\n    \\brief Executable for running python scripts with the hoomd module builtin\n*\/\n\n\/\/! forward declaration of the inithoomd function that inits the python module from hoomd_module.cc\n#if PY_MAJOR_VERSION >= 3\nextern \"C\" PyObject *PyInit_hoomd();\n#else\nextern \"C\" void inithoomd();\n#endif\n\n\/\/! A simple method for finding the hoomd_script python module\nstring find_hoomd_script()\n    {\n    \/\/ this works on the requirement in the hoomd build scripts that the python module is always\n    \/\/ installed in lib\/hoomd\/python-module on linux and mac. On windows, it actually ends up in bin\/python-module\n    path exepath = path(getExePath());\n    list<path> search_paths;\n    search_paths.push_back(exepath \/ \"python-module\");                            \/\/ windows\n    search_paths.push_back(exepath \/ \"..\" \/ \"lib\" \/ \"hoomd\" \/ \"python-module\");   \/\/ linux\/mac\n    search_paths.push_back(path(HOOMD_SOURCE_DIR) \/ \"python-module\");             \/\/ from source builds\n    \n    list<path>::iterator cur_path;\n    for (cur_path = search_paths.begin(); cur_path != search_paths.end(); ++cur_path)\n        {\n        if (exists(*cur_path \/ \"hoomd_script\" \/ \"__init__.py\"))\n            return cur_path->native_file_string();\n        }\n        \n    cerr << endl \n         << \"***Error! HOOMD python-module directory not found. Check your HOOMD directory structure.\" << endl;\n    cerr << \"Searched for hoomd_script in:\" << endl;\n    for (cur_path = search_paths.begin(); cur_path != search_paths.end(); ++cur_path)\n        {\n        cerr << cur_path->native_file_string() << endl;\n        }\n    \n    return \"\";\n    }\n\n\/\/! Main function for the executable\n\/*! \\param argc argument count\n    \\param argv arguments\n    Loads up the hoomd python module and then passes control onto Py_Main\n*\/\nint main(int argc, char **argv)\n    {\n    if (argc == 1)\n        {\n        \/\/ This shell is an interactive launch with no arguments\n        cout << \"Launching intractive python shell now.... run \\\"from hoomd_script import *\\\" to load the HOOMD-blue python module\" << endl << endl;\n        }\n\n    char module_name[] = \"hoomd\";\n#if PY_MAJOR_VERSION >= 3\n    PyImport_AppendInittab(module_name, &PyInit_hoomd);\n#else\n    PyImport_AppendInittab(module_name, &inithoomd);\n#endif\n    Py_Initialize();\n    \n    \/\/ Need to inject the hoomd module path and the plugins dir into sys.path\n    string python_cmds(\"import sys\\n\");\n    string hoomd_script_dir = find_hoomd_script();\n    if (hoomd_script_dir != \"\")\n        {\n        python_cmds += string(\"sys.path.insert(0, r\\\"\") + hoomd_script_dir + string(\"\\\")\\n\");\n        }\n    \n    if (getenv(\"HOOMD_PLUGINS_DIR\"))\n        {\n        string hoomd_plugins_dir = string(getenv(\"HOOMD_PLUGINS_DIR\"));\n        python_cmds += string(\"sys.path.insert(0, r\\\"\") + hoomd_plugins_dir + string(\"\\\")\\n\");\n        cout << \"Notice: Using hoomd plugins in \" << hoomd_plugins_dir << endl;\n        }\n        \n    PyRun_SimpleString(python_cmds.c_str());\n       \n#if PY_MAJOR_VERSION >= 3\n    setlocale(LC_ALL,NULL);\n    wchar_t **argv_w;\n    argv_w = new wchar_t *[argc];\n    for (int i=0; i < argc; i++)\n        {\n        unsigned int n = strlen(argv[i])+1;\n        argv_w[i] = new wchar_t[n];\n        mbstowcs(argv_w[i], argv[i], n);\n        }\n    int retval = Py_Main(argc, argv_w);\n#else\n    int retval = Py_Main(argc, argv);  \n#endif\n\n    \/\/ trying to clean up python's messy memory leaks\n    Py_Finalize();\n    return retval;\n    }\n#ifdef WIN32\n#pragma warning( pop )\n#endif\n\n<commit_msg>Conversion to python3: hoomd_script import works<commit_after>\/*\nHighly Optimized Object-oriented Many-particle Dynamics -- Blue Edition\n(HOOMD-blue) Open Source Software License Copyright 2008-2011 Ames Laboratory\nIowa State University and The Regents of the University of Michigan All rights\nreserved.\n\nHOOMD-blue may contain modifications (\"Contributions\") provided, and to which\ncopyright is held, by various Contributors who have granted The Regents of the\nUniversity of Michigan the right to modify and\/or distribute such Contributions.\n\nYou may redistribute, use, and create derivate works of HOOMD-blue, in source\nand binary forms, provided you abide by the following conditions:\n\n* Redistributions of source code must retain the above copyright notice, this\nlist of conditions, and the following disclaimer both in the code and\nprominently in any materials provided with the distribution.\n\n* Redistributions in binary form must reproduce the above copyright notice, this\nlist of conditions, and the following disclaimer in the documentation and\/or\nother materials provided with the distribution.\n\n* All publications and presentations based on HOOMD-blue, including any reports\nor published results obtained, in whole or in part, with HOOMD-blue, will\nacknowledge its use according to the terms posted at the time of submission on:\nhttp:\/\/codeblue.umich.edu\/hoomd-blue\/citations.html\n\n* Any electronic documents citing HOOMD-Blue will link to the HOOMD-Blue website:\nhttp:\/\/codeblue.umich.edu\/hoomd-blue\/\n\n* Apart from the above required attributions, neither the name of the copyright\nholder nor the names of HOOMD-blue's contributors may be used to endorse or\npromote products derived from this software without specific prior written\npermission.\n\nDisclaimer\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER AND CONTRIBUTORS ``AS IS'' AND\nANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\nWARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, AND\/OR ANY\nWARRANTIES THAT THIS SOFTWARE IS FREE OF INFRINGEMENT ARE DISCLAIMED.\n\nIN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,\nINDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\nBUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\nLIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE\nOR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF\nADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*\/\n\n\/\/ Maintainer: joaander\n\n\/\/ temporarily work around issues with the new boost fileystem libraries\n\/\/ http:\/\/www.boost.org\/doc\/libs\/1_46_1\/libs\/filesystem\/v3\/doc\/index.htm\n\n#ifdef WIN32\n#pragma warning( push )\n#pragma warning( disable : 4103 4244 )\n#endif\n\n#include <boost\/version.hpp>\n#include <boost\/python.hpp>\n\n#include <boost\/filesystem\/operations.hpp>\n#include <boost\/filesystem\/convenience.hpp>\n\nusing namespace boost::filesystem;\n\n#include \"PathUtils.h\"\n#include \"HOOMDVersion.h\"\n\n#include <string>\n#include <sstream>\n#include <list>\n#include <iostream>\nusing namespace std;\n\n#if PY_MAJOR_VERSION >= 3\n#include \"stdlib.h\"\n#endif\n\n\/\/ hack to support both version 2 and version 3 of the boost filesystem API\n#if (BOOST_VERSION >= 104400)\n#define native_file_string string\n#endif\n\n\/*! \\file hoomd.cc\n    \\brief Executable for running python scripts with the hoomd module builtin\n*\/\n\n\/\/! forward declaration of the inithoomd function that inits the python module from hoomd_module.cc\n#if PY_MAJOR_VERSION >= 3\nextern \"C\" PyObject *PyInit_hoomd();\n#else\nextern \"C\" void inithoomd();\n#endif\n\n\/\/! A simple method for finding the hoomd_script python module\nstring find_hoomd_script()\n    {\n    \/\/ this works on the requirement in the hoomd build scripts that the python module is always\n    \/\/ installed in lib\/hoomd\/python-module on linux and mac. On windows, it actually ends up in bin\/python-module\n    path exepath = path(getExePath());\n    list<path> search_paths;\n    search_paths.push_back(exepath \/ \"python-module\");                            \/\/ windows\n    search_paths.push_back(exepath \/ \"..\" \/ \"lib\" \/ \"hoomd\" \/ \"python-module\");   \/\/ linux\/mac\n    search_paths.push_back(path(HOOMD_SOURCE_DIR) \/ \"python-module\");             \/\/ from source builds\n    \n    list<path>::iterator cur_path;\n    for (cur_path = search_paths.begin(); cur_path != search_paths.end(); ++cur_path)\n        {\n        if (exists(*cur_path \/ \"hoomd_script\" \/ \"__init__.py\"))\n            return cur_path->native_file_string();\n        }\n        \n    cerr << endl \n         << \"***Error! HOOMD python-module directory not found. Check your HOOMD directory structure.\" << endl;\n    cerr << \"Searched for hoomd_script in:\" << endl;\n    for (cur_path = search_paths.begin(); cur_path != search_paths.end(); ++cur_path)\n        {\n        cerr << cur_path->native_file_string() << endl;\n        }\n    \n    return \"\";\n    }\n\n\/\/! Main function for the executable\n\/*! \\param argc argument count\n    \\param argv arguments\n    Loads up the hoomd python module and then passes control onto Py_Main\n*\/\nint main(int argc, char **argv)\n    {\n    if (argc == 1)\n        {\n        \/\/ This shell is an interactive launch with no arguments\n        cout << \"Launching intractive python shell now.... run \\\"from hoomd_script import *\\\" to load the HOOMD-blue python module\" << endl << endl;\n        }\n\n    char module_name[] = \"hoomd\";\n#if PY_MAJOR_VERSION >= 3\n    PyImport_AppendInittab(module_name, &PyInit_hoomd);\n#else\n    PyImport_AppendInittab(module_name, &inithoomd);\n#endif\n    Py_Initialize();\n    \n    \/\/ Need to inject the hoomd module path and the plugins dir into sys.path\n    string python_cmds(\"import sys\\n\");\n    string hoomd_script_dir = find_hoomd_script();\n    if (hoomd_script_dir != \"\")\n        {\n        python_cmds += string(\"sys.path.insert(0, r\\\"\") + hoomd_script_dir + string(\"\\\")\\n\");\n        python_cmds += string(\"sys.path.insert(0, r\\\"\") + hoomd_script_dir + \"\/hoomd_script\" +  string(\"\\\")\\n\");\n        }\n    \n    if (getenv(\"HOOMD_PLUGINS_DIR\"))\n        {\n        string hoomd_plugins_dir = string(getenv(\"HOOMD_PLUGINS_DIR\"));\n        python_cmds += string(\"sys.path.insert(0, r\\\"\") + hoomd_plugins_dir + string(\"\\\")\\n\");\n        cout << \"Notice: Using hoomd plugins in \" << hoomd_plugins_dir << endl;\n        }\n        \n    PyRun_SimpleString(python_cmds.c_str());\n       \n#if PY_MAJOR_VERSION >= 3\n    setlocale(LC_ALL,NULL);\n    wchar_t **argv_w;\n    argv_w = new wchar_t *[argc];\n    for (int i=0; i < argc; i++)\n        {\n        unsigned int n = strlen(argv[i])+1;\n        argv_w[i] = new wchar_t[n];\n        mbstowcs(argv_w[i], argv[i], n);\n        }\n    int retval = Py_Main(argc, argv_w);\n#else\n    int retval = Py_Main(argc, argv);  \n#endif\n\n    \/\/ trying to clean up python's messy memory leaks\n    Py_Finalize();\n    return retval;\n    }\n#ifdef WIN32\n#pragma warning( pop )\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>#include <stdio.h>\n#include <stdlib.h>\n#include <inttypes.h>\n#include <string.h>\n\n#include <shared\/rcrpc.h>\n#include <shared\/net.h>\n\n#include <server\/server.h>\n\nnamespace RAMCloud {\n\nServer::Server() : net(0)\n{\n    memset(blobs, 0, sizeof(blobs));\n    net = new DefaultNet(true);\n}\n\nServer::~Server()\n{\n    delete net;\n}\n\nvoid\nServer::handleRPC()\n{\n    struct rcrpc *rcrpc;\n    struct rcrpc *resp = 0;\n    struct rcrpc buf;\n\n    if (net->recvRPC(&rcrpc) == 0) {\n        printf(\"got rpc type: 0x%08x, len 0x%08x\\n\", rcrpc->type, rcrpc->len);\n\n        switch (rcrpc->type) {\n        case RCRPC_PING:\n            resp = &buf;\n            resp->type = RCRPC_PING;\n            resp->len  = RCRPC_PINGLEN;\n            break;\n\n        case RCRPC_READ100:\n            printf(\"read100 from key %d\\n\", rcrpc->read100.key);\n            resp = &blobs[rcrpc->read100.key];\n            resp->type = RCRPC_READ1000;\n            resp->len  = RCRPC_READ1000LEN;\n            printf(\"resp key: %d\\n\", resp->read100.key);\n            break;\n\n        case RCRPC_READ1000:\n            resp = &blobs[rcrpc->read1000.key];\n            resp->type = RCRPC_READ1000;\n            resp->len  = RCRPC_READ1000LEN;\n            break;\n\n        case RCRPC_WRITE100:\n            printf(\"write100 to key %d, val = %s\\n\", rcrpc->write100.key, rcrpc->write100.buf);\n            memcpy(&blobs[rcrpc->write100.key], rcrpc, RCRPC_WRITE100LEN);\n            printf(\"post copy key: %d\\n\", blobs[rcrpc->write100.key].write100.key);\n            resp = &buf;\n            resp->type = RCRPC_OK;\n            resp->len  = RCRPC_OKLEN;\n            break;\n\n        case RCRPC_WRITE1000:\n            memcpy(&blobs[rcrpc->write1000.key], rcrpc, RCRPC_WRITE1000LEN);\n            resp = &buf;\n            resp->type = RCRPC_OK;\n            resp->len  = RCRPC_OKLEN;\n            break;\n\n        default:\n            fprintf(stderr, \"received unknown RPC type 0x%08x\\n\", rcrpc->type);\n            exit(1);\n        }\n    }\n\n    net->sendRPC(resp);\n}\n\n} \/\/ namespace RAMCloud\n<commit_msg>Fixed response size for read100 request<commit_after>#include <stdio.h>\n#include <stdlib.h>\n#include <inttypes.h>\n#include <string.h>\n\n#include <shared\/rcrpc.h>\n#include <shared\/net.h>\n\n#include <server\/server.h>\n\nnamespace RAMCloud {\n\nServer::Server() : net(0)\n{\n    memset(blobs, 0, sizeof(blobs));\n    net = new DefaultNet(true);\n}\n\nServer::~Server()\n{\n    delete net;\n}\n\nvoid\nServer::handleRPC()\n{\n    struct rcrpc *rcrpc;\n    struct rcrpc *resp = 0;\n    struct rcrpc buf;\n\n    if (net->recvRPC(&rcrpc) == 0) {\n        printf(\"got rpc type: 0x%08x, len 0x%08x\\n\", rcrpc->type, rcrpc->len);\n\n        switch (rcrpc->type) {\n        case RCRPC_PING:\n            resp = &buf;\n            resp->type = RCRPC_PING;\n            resp->len  = RCRPC_PINGLEN;\n            break;\n\n        case RCRPC_READ100:\n            printf(\"read100 from key %d\\n\", rcrpc->read100.key);\n            resp = &blobs[rcrpc->read100.key];\n            resp->type = RCRPC_READ100;\n            resp->len  = RCRPC_READ100LEN;\n            printf(\"resp key: %d\\n\", resp->read100.key);\n            break;\n\n        case RCRPC_READ1000:\n            resp = &blobs[rcrpc->read1000.key];\n            resp->type = RCRPC_READ1000;\n            resp->len  = RCRPC_READ1000LEN;\n            break;\n\n        case RCRPC_WRITE100:\n            printf(\"write100 to key %d, val = %s\\n\", rcrpc->write100.key, rcrpc->write100.buf);\n            memcpy(&blobs[rcrpc->write100.key], rcrpc, RCRPC_WRITE100LEN);\n            printf(\"post copy key: %d\\n\", blobs[rcrpc->write100.key].write100.key);\n            resp = &buf;\n            resp->type = RCRPC_OK;\n            resp->len  = RCRPC_OKLEN;\n            break;\n\n        case RCRPC_WRITE1000:\n            memcpy(&blobs[rcrpc->write1000.key], rcrpc, RCRPC_WRITE1000LEN);\n            resp = &buf;\n            resp->type = RCRPC_OK;\n            resp->len  = RCRPC_OKLEN;\n            break;\n\n        default:\n            fprintf(stderr, \"received unknown RPC type 0x%08x\\n\", rcrpc->type);\n            exit(1);\n        }\n    }\n\n    net->sendRPC(resp);\n}\n\n} \/\/ namespace RAMCloud\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*\n * This file is part of the LibreOffice project.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\n * This file incorporates work covered by the following license notice:\n *\n *   Licensed to the Apache Software Foundation (ASF) under one or more\n *   contributor license agreements. See the NOTICE file distributed\n *   with this work for additional information regarding copyright\n *   ownership. The ASF licenses this file to you under the Apache\n *   License, Version 2.0 (the \"License\"); you may not use this file\n *   except in compliance with the License. You may obtain a copy of\n *   the License at http:\/\/www.apache.org\/licenses\/LICENSE-2.0 .\n *\/\n\n#ifndef INCLUDED_SW_SOURCE_CORE_INC_DFLYOBJ_HXX\n#define INCLUDED_SW_SOURCE_CORE_INC_DFLYOBJ_HXX\n\n#include <drawinglayer\/geometry\/viewinformation2d.hxx>\n#include <svx\/svdovirt.hxx>\n\nclass SwFlyFrm;\nclass SwFrmFmt;\nclass SdrObjMacroHitRec;\n\nconst sal_uInt32 SWGInventor =  sal_uInt32('S')*0x00000001 +\n                                sal_uInt32('W')*0x00000100 +\n                                sal_uInt32('G')*0x00010000;\n\nconst sal_uInt16 SwFlyDrawObjIdentifier = 0x0001;\n\n\/\/ DrawObjects for Flys\nclass SwFlyDrawObj : public SdrObject\n{\nprivate:\n    virtual sdr::properties::BaseProperties* CreateObjectSpecificProperties() SAL_OVERRIDE;\n\nprotected:\n    \/\/ #i95264# SwFlyDrawObj needs an own VC since createViewIndependentPrimitive2DSequence()\n    \/\/ is called when RecalcBoundRect() is used\n    virtual sdr::contact::ViewContact* CreateObjectSpecificViewContact() SAL_OVERRIDE;\n\npublic:\n    TYPEINFO_OVERRIDE();\n\n    SwFlyDrawObj();\n    virtual ~SwFlyDrawObj();\n\n    \/\/ for instantiation of this class while loading (via factory)\n    virtual sal_uInt32 GetObjInventor()     const SAL_OVERRIDE;\n    virtual sal_uInt16 GetObjIdentifier()   const SAL_OVERRIDE;\n};\n\n\/\/ virtual objects for Flys\n\/\/ Flys will always be shown with virtual objects. By doing that, they can be\n\/\/ shown multiple times if needed (header\/footer).\nclass SwVirtFlyDrawObj : public SdrVirtObj\n{\nprivate:\n    SwFlyFrm *pFlyFrm;\n\nprotected:\n    \/\/ AW: Need own sdr::contact::ViewContact since AnchorPos from parent is\n    \/\/ not used but something own (top left of new SnapRect minus top left\n    \/\/ of original SnapRect)\n    virtual sdr::contact::ViewContact* CreateObjectSpecificViewContact() SAL_OVERRIDE;\n\npublic:\n    \/\/ for paints triggered form ExecutePrimitive\n    void wrap_DoPaintObject(\n            drawinglayer::geometry::ViewInformation2D const&) const;\n\n    \/\/ for simple access to inner and outer bounds\n    basegfx::B2DRange getOuterBound() const;\n    basegfx::B2DRange getInnerBound() const;\n\n    TYPEINFO_OVERRIDE();\n\n    SwVirtFlyDrawObj(SdrObject& rNew, SwFlyFrm* pFly);\n    virtual ~SwVirtFlyDrawObj();\n\n    \/\/ override method of base class SdrVirtObj\n    virtual void     TakeObjInfo( SdrObjTransformInfoRec& rInfo ) const SAL_OVERRIDE;\n\n    \/\/ we treat the size calculation completely on ourself here\n    virtual const Rectangle& GetCurrentBoundRect() const SAL_OVERRIDE;\n    virtual const Rectangle& GetLastBoundRect() const SAL_OVERRIDE;\n    virtual       void       RecalcBoundRect() SAL_OVERRIDE;\n    virtual       void       RecalcSnapRect() SAL_OVERRIDE;\n    virtual const Rectangle& GetSnapRect()  const SAL_OVERRIDE;\n    virtual       void       SetSnapRect(const Rectangle& rRect) SAL_OVERRIDE;\n    virtual       void       NbcSetSnapRect(const Rectangle& rRect) SAL_OVERRIDE;\n    virtual const Rectangle& GetLogicRect() const SAL_OVERRIDE;\n    virtual       void       SetLogicRect(const Rectangle& rRect) SAL_OVERRIDE;\n    virtual       void       NbcSetLogicRect(const Rectangle& rRect) SAL_OVERRIDE;\n    virtual ::basegfx::B2DPolyPolygon TakeXorPoly() const SAL_OVERRIDE;\n    virtual       void       NbcMove  (const Size& rSiz) SAL_OVERRIDE;\n    virtual       void       NbcResize(const Point& rRef, const Fraction& xFact,\n                                       const Fraction& yFact) SAL_OVERRIDE;\n    virtual       void       NbcCrop(const Point& rRef, const Fraction& xFact, const Fraction& yFact) SAL_OVERRIDE;\n    virtual       void       Move  (const Size& rSiz) SAL_OVERRIDE;\n    virtual       void       Resize(const Point& rRef, const Fraction& xFact,\n                                    const Fraction& yFact, bool bUnsetRelative = true) SAL_OVERRIDE;\n    virtual       void       Crop(const Point& rRef, const Fraction& xFact, const Fraction& yFact) SAL_OVERRIDE;\n    virtual       void       addCropHandles(SdrHdlList& rTarget) const;\n\n    const SwFrmFmt *GetFmt() const;\n          SwFrmFmt *GetFmt();\n\n    \/\/ methods to get pointers for the Fly\n          SwFlyFrm* GetFlyFrm()         { return pFlyFrm; }\n    const SwFlyFrm* GetFlyFrm() const   { return pFlyFrm; }\n\n    void SetRect() const;\n\n    \/\/ if an URL is attached to a graphic than this is a macro object\n    virtual bool       HasMacro() const SAL_OVERRIDE;\n    virtual SdrObject* CheckMacroHit       (const SdrObjMacroHitRec& rRec) const SAL_OVERRIDE;\n    virtual Pointer    GetMacroPointer     (const SdrObjMacroHitRec& rRec) const SAL_OVERRIDE;\n\n    \/\/ FullDrag support\n    virtual bool supportsFullDrag() const SAL_OVERRIDE;\n    virtual SdrObject* getFullDragClone() const SAL_OVERRIDE;\n};\n\n#endif\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>-Werror,-Winconsistent-missing-override<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_SW_SOURCE_CORE_INC_DFLYOBJ_HXX\n#define INCLUDED_SW_SOURCE_CORE_INC_DFLYOBJ_HXX\n\n#include <drawinglayer\/geometry\/viewinformation2d.hxx>\n#include <svx\/svdovirt.hxx>\n\nclass SwFlyFrm;\nclass SwFrmFmt;\nclass SdrObjMacroHitRec;\n\nconst sal_uInt32 SWGInventor =  sal_uInt32('S')*0x00000001 +\n                                sal_uInt32('W')*0x00000100 +\n                                sal_uInt32('G')*0x00010000;\n\nconst sal_uInt16 SwFlyDrawObjIdentifier = 0x0001;\n\n\/\/ DrawObjects for Flys\nclass SwFlyDrawObj : public SdrObject\n{\nprivate:\n    virtual sdr::properties::BaseProperties* CreateObjectSpecificProperties() SAL_OVERRIDE;\n\nprotected:\n    \/\/ #i95264# SwFlyDrawObj needs an own VC since createViewIndependentPrimitive2DSequence()\n    \/\/ is called when RecalcBoundRect() is used\n    virtual sdr::contact::ViewContact* CreateObjectSpecificViewContact() SAL_OVERRIDE;\n\npublic:\n    TYPEINFO_OVERRIDE();\n\n    SwFlyDrawObj();\n    virtual ~SwFlyDrawObj();\n\n    \/\/ for instantiation of this class while loading (via factory)\n    virtual sal_uInt32 GetObjInventor()     const SAL_OVERRIDE;\n    virtual sal_uInt16 GetObjIdentifier()   const SAL_OVERRIDE;\n};\n\n\/\/ virtual objects for Flys\n\/\/ Flys will always be shown with virtual objects. By doing that, they can be\n\/\/ shown multiple times if needed (header\/footer).\nclass SwVirtFlyDrawObj : public SdrVirtObj\n{\nprivate:\n    SwFlyFrm *pFlyFrm;\n\nprotected:\n    \/\/ AW: Need own sdr::contact::ViewContact since AnchorPos from parent is\n    \/\/ not used but something own (top left of new SnapRect minus top left\n    \/\/ of original SnapRect)\n    virtual sdr::contact::ViewContact* CreateObjectSpecificViewContact() SAL_OVERRIDE;\n\npublic:\n    \/\/ for paints triggered form ExecutePrimitive\n    void wrap_DoPaintObject(\n            drawinglayer::geometry::ViewInformation2D const&) const;\n\n    \/\/ for simple access to inner and outer bounds\n    basegfx::B2DRange getOuterBound() const;\n    basegfx::B2DRange getInnerBound() const;\n\n    TYPEINFO_OVERRIDE();\n\n    SwVirtFlyDrawObj(SdrObject& rNew, SwFlyFrm* pFly);\n    virtual ~SwVirtFlyDrawObj();\n\n    \/\/ override method of base class SdrVirtObj\n    virtual void     TakeObjInfo( SdrObjTransformInfoRec& rInfo ) const SAL_OVERRIDE;\n\n    \/\/ we treat the size calculation completely on ourself here\n    virtual const Rectangle& GetCurrentBoundRect() const SAL_OVERRIDE;\n    virtual const Rectangle& GetLastBoundRect() const SAL_OVERRIDE;\n    virtual       void       RecalcBoundRect() SAL_OVERRIDE;\n    virtual       void       RecalcSnapRect() SAL_OVERRIDE;\n    virtual const Rectangle& GetSnapRect()  const SAL_OVERRIDE;\n    virtual       void       SetSnapRect(const Rectangle& rRect) SAL_OVERRIDE;\n    virtual       void       NbcSetSnapRect(const Rectangle& rRect) SAL_OVERRIDE;\n    virtual const Rectangle& GetLogicRect() const SAL_OVERRIDE;\n    virtual       void       SetLogicRect(const Rectangle& rRect) SAL_OVERRIDE;\n    virtual       void       NbcSetLogicRect(const Rectangle& rRect) SAL_OVERRIDE;\n    virtual ::basegfx::B2DPolyPolygon TakeXorPoly() const SAL_OVERRIDE;\n    virtual       void       NbcMove  (const Size& rSiz) SAL_OVERRIDE;\n    virtual       void       NbcResize(const Point& rRef, const Fraction& xFact,\n                                       const Fraction& yFact) SAL_OVERRIDE;\n    virtual       void       NbcCrop(const Point& rRef, const Fraction& xFact, const Fraction& yFact) SAL_OVERRIDE;\n    virtual       void       Move  (const Size& rSiz) SAL_OVERRIDE;\n    virtual       void       Resize(const Point& rRef, const Fraction& xFact,\n                                    const Fraction& yFact, bool bUnsetRelative = true) SAL_OVERRIDE;\n    virtual       void       Crop(const Point& rRef, const Fraction& xFact, const Fraction& yFact) SAL_OVERRIDE;\n    virtual       void       addCropHandles(SdrHdlList& rTarget) const SAL_OVERRIDE;\n\n    const SwFrmFmt *GetFmt() const;\n          SwFrmFmt *GetFmt();\n\n    \/\/ methods to get pointers for the Fly\n          SwFlyFrm* GetFlyFrm()         { return pFlyFrm; }\n    const SwFlyFrm* GetFlyFrm() const   { return pFlyFrm; }\n\n    void SetRect() const;\n\n    \/\/ if an URL is attached to a graphic than this is a macro object\n    virtual bool       HasMacro() const SAL_OVERRIDE;\n    virtual SdrObject* CheckMacroHit       (const SdrObjMacroHitRec& rRec) const SAL_OVERRIDE;\n    virtual Pointer    GetMacroPointer     (const SdrObjMacroHitRec& rRec) const SAL_OVERRIDE;\n\n    \/\/ FullDrag support\n    virtual bool supportsFullDrag() const SAL_OVERRIDE;\n    virtual SdrObject* getFullDragClone() const SAL_OVERRIDE;\n};\n\n#endif\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"gamerow.h\"\n#include \"ui_gamerow.h\"\n\n#include <QPushButton>\n#include <QLabel>\n#include <QHBoxLayout>\n#include <QUrlQuery>\n#include <QMenu>\n#include <QAction>\n#include <QNetworkAccessManager>\n#include <QNetworkRequest>\n#include <QNetworkReply>\n#include <QPixmap>\n\n#include <QDebug>\n\n#include \"itchioapi.h\"\n#include <QStandardPaths>\n#include <QDir>\n#include <QFile>\n\nGameRow::GameRow(QWidget* const parent, const Game& game, const DownloadKey& key, AppController* const controller)\n    : QWidget(parent)\n    , ui(new Ui::GameRow)\n    , game(game)\n    , downloadKey(key)\n    , controller(controller)\n{\n    ui->setupUi(this);\n\n    networkManager = new QNetworkAccessManager(this);\n\n    downloadMenu = new QMenu(\"Choose Download\");\n    ui->downloadButton->setMenu(downloadMenu);\n    connect(downloadMenu, &QMenu::aboutToShow, this, &GameRow::onTriggerDownloadMenu);\n\n    ui->gameCoverLabel->setFixedWidth(\n        int(ui->gameCoverLabel->maximumHeight() * double(Game::COVER_WIDTH) \/ Game::COVER_HEIGHT));\n\n    ui->gameTitleLabel->setText(game.title);\n    ui->gameCreatorLabel->setText(game.user.nameForDisplay());\n\n    refreshThumbnail();\n}\n\nGameRow::~GameRow()\n{\n    delete ui;\n}\n\nvoid GameRow::onClickDownload()\n{\n    qDebug() << \"clicked download\" << game.title;\n}\n\nvoid GameRow::onDownloadThumbnail()\n{\n    QNetworkReply* reply = qobject_cast<QNetworkReply*>(sender());\n    reply->deleteLater();\n\n    if (reply->error() != QNetworkReply::NoError) {\n        qDebug() << \"Error downloading thumbnail\" << reply->errorString();\n        return;\n    }\n\n    QByteArray imageData = reply->readAll();\n    QPixmap pixmap;\n    if (pixmap.loadFromData(imageData)) {\n        ui->gameCoverLabel->setPixmap(pixmap);\n    }\n}\n\nvoid GameRow::onTriggerDownloadMenu()\n{\n    downloadMenu->clear();\n\n    QAction* loaderAction = new QAction(\"Loading...\", downloadMenu);\n\n    loaderAction->setDisabled(true);\n    downloadMenu->addAction(loaderAction);\n\n    controller->api->downloadKeyUploads(downloadKey, [this](QList<Upload> uploads) {\n        onUploads(uploads);\n    });\n}\n\nvoid GameRow::onTriggerUpload()\n{\n    QAction* action = qobject_cast<QAction*>(sender());\n\n    int pos = action->data().toInt();\n\n    Upload upload = pendingUploads[pos];\n\n    controller->api->downloadUpload(downloadKey, upload, [=](QString url) {\n        QString path = QStandardPaths::writableLocation(QStandardPaths::AppDataLocation);\n        QDir().mkpath(path);\n\n        QString fname = QString::number(upload.id);\n        QString fullPath = path + \"\/\" + fname;\n\n        qDebug() << \"Download: \" << url << \"to\" << fullPath;\n\n        QFile* file = new QFile(fullPath);\n        file->open(QIODevice::WriteOnly);\n\n        QNetworkRequest request;\n        request.setUrl(QUrl(url));\n        request.setHeader(QNetworkRequest::UserAgentHeader, ItchioApi::USER_AGENT);\n        QNetworkReply* reply = networkManager->get(request);\n\n        connect(reply, &QNetworkReply::downloadProgress, this, &GameRow::downloadProgress);\n\n        connect(reply, &QNetworkReply::readyRead, [=] {\n            qDebug() << \"ready read\" << reply->bytesAvailable();\n            file->write(reply->read(reply->bytesAvailable()));\n        });\n\n        connect(reply, &QNetworkReply::finished, [=] {\n            reply->deleteLater();\n            qDebug() << \"finished\" << fullPath;\n            file->close();\n            delete file;\n        });\n\n    });\n}\n\nvoid GameRow::onUploads(const QList<Upload>& uploads)\n{\n    pendingUploads = uploads;\n    downloadMenu->clear();\n\n    if (uploads.empty()) {\n        QAction* loaderAction = new QAction(\"No files\", downloadMenu);\n        loaderAction->setDisabled(true);\n        downloadMenu->addAction(loaderAction);\n        return;\n    }\n\n    for (int i = 0; i < uploads.count(); i++) {\n        QAction* const uploadAction = new QAction(uploads[i].filename, downloadMenu);\n        uploadAction->setData(i);\n\n        connect(uploadAction, &QAction::triggered, this, &GameRow::onTriggerUpload);\n\n        downloadMenu->addAction(uploadAction);\n    }\n}\n\nvoid GameRow::refreshThumbnail()\n{\n    if (game.coverImageUrl == \"\") {\n        return;\n    }\n\n    qDebug() << \"Fetching cover\" << game.coverImageUrl;\n\n    QNetworkRequest request;\n    request.setUrl(QUrl(game.coverImageUrl));\n    request.setHeader(QNetworkRequest::UserAgentHeader, ItchioApi::USER_AGENT);\n\n    QNetworkReply* reply = networkManager->get(request);\n    connect(reply, &QNetworkReply::finished, this, &GameRow::onDownloadThumbnail);\n}\n\nvoid GameRow::downloadProgress(qint64 bytesReceived, qint64 bytesTotal)\n{\n    ui->progressBar->setMaximum(bytesTotal);\n    ui->progressBar->setValue(bytesReceived);\n}\n\n<commit_msg>Downloads are now done in a folder on the executable location.<commit_after>#include \"gamerow.h\"\n#include \"ui_gamerow.h\"\n\n#include <QPushButton>\n#include <QLabel>\n#include <QHBoxLayout>\n#include <QUrlQuery>\n#include <QMenu>\n#include <QAction>\n#include <QNetworkAccessManager>\n#include <QNetworkRequest>\n#include <QNetworkReply>\n#include <QPixmap>\n\n#include <QDebug>\n\n#include \"itchioapi.h\"\n#include <QStandardPaths>\n#include <QDir>\n#include <QFile>\n\nGameRow::GameRow(QWidget* const parent, const Game& game, const DownloadKey& key, AppController* const controller)\n    : QWidget(parent)\n    , ui(new Ui::GameRow)\n    , game(game)\n    , downloadKey(key)\n    , controller(controller)\n{\n    ui->setupUi(this);\n\n    networkManager = new QNetworkAccessManager(this);\n\n    downloadMenu = new QMenu(\"Choose Download\");\n    ui->downloadButton->setMenu(downloadMenu);\n    connect(downloadMenu, &QMenu::aboutToShow, this, &GameRow::onTriggerDownloadMenu);\n\n    ui->gameCoverLabel->setFixedWidth(\n        int(ui->gameCoverLabel->maximumHeight() * double(Game::COVER_WIDTH) \/ Game::COVER_HEIGHT));\n\n    ui->gameTitleLabel->setText(game.title);\n    ui->gameCreatorLabel->setText(game.user.nameForDisplay());\n\n    refreshThumbnail();\n}\n\nGameRow::~GameRow()\n{\n    delete ui;\n}\n\nvoid GameRow::onClickDownload()\n{\n    qDebug() << \"clicked download\" << game.title;\n}\n\nvoid GameRow::onDownloadThumbnail()\n{\n    QNetworkReply* reply = qobject_cast<QNetworkReply*>(sender());\n    reply->deleteLater();\n\n    if (reply->error() != QNetworkReply::NoError) {\n        qDebug() << \"Error downloading thumbnail\" << reply->errorString();\n        return;\n    }\n\n    QByteArray imageData = reply->readAll();\n    QPixmap pixmap;\n    if (pixmap.loadFromData(imageData)) {\n        ui->gameCoverLabel->setPixmap(pixmap);\n    }\n}\n\nvoid GameRow::onTriggerDownloadMenu()\n{\n    downloadMenu->clear();\n\n    QAction* loaderAction = new QAction(\"Loading...\", downloadMenu);\n\n    loaderAction->setDisabled(true);\n    downloadMenu->addAction(loaderAction);\n\n    controller->api->downloadKeyUploads(downloadKey, [this](QList<Upload> uploads) {\n        onUploads(uploads);\n    });\n}\n\nvoid GameRow::onTriggerUpload()\n{\n    QAction* action = qobject_cast<QAction*>(sender());\n\n    int pos = action->data().toInt();\n\n    Upload upload = pendingUploads[pos];\n\n    controller->api->downloadUpload(downloadKey, upload, [=](QString url) {\n        QString path = QCoreApplication::applicationDirPath() + \"\/Downloads\";\n        QDir().mkpath(path);\n\n        QString fname = QString::number(upload.id);\n        QString fullPath = path + \"\/\" + fname;\n\n        qDebug() << \"Download: \" << url << \"to\" << fullPath;\n\n        QFile* file = new QFile(fullPath);\n        file->open(QIODevice::WriteOnly);\n\n        QNetworkRequest request;\n        request.setUrl(QUrl(url));\n        request.setHeader(QNetworkRequest::UserAgentHeader, ItchioApi::USER_AGENT);\n        QNetworkReply* reply = networkManager->get(request);\n\n        connect(reply, &QNetworkReply::downloadProgress, this, &GameRow::downloadProgress);\n\n        connect(reply, &QNetworkReply::readyRead, [=] {\n            qDebug() << \"ready read\" << reply->bytesAvailable();\n            file->write(reply->read(reply->bytesAvailable()));\n        });\n\n        connect(reply, &QNetworkReply::finished, [=] {\n            reply->deleteLater();\n            qDebug() << \"finished\" << fullPath;\n            file->close();\n            delete file;\n        });\n\n    });\n}\n\nvoid GameRow::onUploads(const QList<Upload>& uploads)\n{\n    pendingUploads = uploads;\n    downloadMenu->clear();\n\n    if (uploads.empty()) {\n        QAction* loaderAction = new QAction(\"No files\", downloadMenu);\n        loaderAction->setDisabled(true);\n        downloadMenu->addAction(loaderAction);\n        return;\n    }\n\n    for (int i = 0; i < uploads.count(); i++) {\n        QAction* const uploadAction = new QAction(uploads[i].filename, downloadMenu);\n        uploadAction->setData(i);\n\n        connect(uploadAction, &QAction::triggered, this, &GameRow::onTriggerUpload);\n\n        downloadMenu->addAction(uploadAction);\n    }\n}\n\nvoid GameRow::refreshThumbnail()\n{\n    if (game.coverImageUrl == \"\") {\n        return;\n    }\n\n    qDebug() << \"Fetching cover\" << game.coverImageUrl;\n\n    QNetworkRequest request;\n    request.setUrl(QUrl(game.coverImageUrl));\n    request.setHeader(QNetworkRequest::UserAgentHeader, ItchioApi::USER_AGENT);\n\n    QNetworkReply* reply = networkManager->get(request);\n    connect(reply, &QNetworkReply::finished, this, &GameRow::onDownloadThumbnail);\n}\n\nvoid GameRow::downloadProgress(qint64 bytesReceived, qint64 bytesTotal)\n{\n    ui->progressBar->setMaximum(bytesTotal);\n    ui->progressBar->setValue(bytesReceived);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/**************************************************************************\n**\n** This file is part of Qt Creator\n**\n** Copyright (c) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n**\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** Commercial Usage\n**\n** Licensees holding valid Qt Commercial licenses may use this file in\n** accordance with the Qt Commercial License Agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Nokia.\n**\n** GNU Lesser General Public License Usage\n**\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at http:\/\/qt.nokia.com\/contact.\n**\n**************************************************************************\/\n\n#include <qmljs\/parser\/qmljsast_p.h>\n#include <qmljs\/parser\/qmljsastvisitor_p.h>\n#include <qmljs\/qmljsdocument.h>\n\n#include <QFile>\n#include <QList>\n#include <QCoreApplication>\n#include <QStringList>\n#include <QFileInfo>\n#include <QTime>\n#include <QtDebug>\n\n#include <cstdio>\n#include <cstdlib>\n#include <fstream>\n#include <iostream>\n#ifdef __GNUC__\n#  include <cxxabi.h>\n#endif\n\nusing namespace QmlJS;\nusing namespace QmlJS::AST;\nusing namespace std;\n\nclass ASTDump: protected Visitor\n{\npublic:\n    void operator()(const QString &fileName, const QByteArray &src, Node *ast) {\n        _src = src;\n        QString basename = fileName;\n        int dotIdx = basename.lastIndexOf('.');\n        if (dotIdx != -1)\n            basename.truncate(dotIdx);\n        basename.append(QLatin1String(\".ast.dot\"));\n        out.open(basename.toUtf8().constData());\n\n        out << \"digraph AST { ordering=out;\" << endl;\n        \/\/ cout << \"rankdir = \\\"LR\\\";\" << endl;\n        Node::accept(ast, this);\n\n        typedef QPair<QByteArray, QByteArray> Pair;\n\n        foreach (const Pair &conn, _connections)\n            out << conn.first.constData() << \" -> \" << conn.second.constData() << endl;\n\n        alignTerminals();\n\n        out << \"}\" << endl;\n        out.close();\n        cout << qPrintable(basename) << endl;\n    }\n\nprotected: \/\/ visiting methods:\n    virtual bool visit(UiImport *ast) {\n        terminal(ast->importToken);\n\n        if (ast->importUri)\n            nonterminal(ast->importUri);\n        else\n            terminal(ast->fileNameToken);\n\n        terminal(ast->versionToken);\n        terminal(ast->asToken);\n        terminal(ast->importIdToken);\n        terminal(ast->semicolonToken);\n        return false;\n    }\n\n    virtual bool visit(UiObjectBinding *ast) {\n        if (ast->hasOnToken) {\n            nonterminal(ast->qualifiedTypeNameId);\n            terminal(ast->colonToken);\n            nonterminal(ast->qualifiedId);\n        } else {\n            nonterminal(ast->qualifiedId);\n            terminal(ast->colonToken);\n            nonterminal(ast->qualifiedTypeNameId);\n        }\n        nonterminal(ast->initializer);\n        return false;\n    }\n\n    virtual bool visit(UiObjectDefinition *ast) {\n        nonterminal(ast->qualifiedTypeNameId);\n        nonterminal(ast->initializer);\n        return false;\n    }\n\n    virtual bool visit(UiObjectInitializer *ast) {\n        terminal(ast->lbraceToken);\n        nonterminal(ast->members);\n        terminal(ast->rbraceToken);\n        return false;\n    }\n\n    virtual bool visit(UiScriptBinding *ast) {\n        nonterminal(ast->qualifiedId);\n        terminal(ast->colonToken);\n        nonterminal(ast->statement);\n        return false;\n    }\n\n    virtual bool visit(UiArrayBinding *ast) {\n        nonterminal(ast->qualifiedId);\n        terminal(ast->colonToken);\n        terminal(ast->lbracketToken);\n        nonterminal(ast->members);\n        terminal(ast->rbracketToken);\n        return false;\n    }\n\n    virtual bool visit(UiArrayMemberList *ast) {\n        terminal(ast->commaToken);\n        nonterminal(ast->member);\n        nonterminal(ast->next);\n        return false;\n    }\n\n    virtual bool visit(UiQualifiedId *ast) {\n        terminal(ast->identifierToken);\n        nonterminal(ast->next);\n        return false;\n    }\n\n    virtual bool visit(UiPublicMember *ast) {\n        \/\/ TODO: place the paramters...\n\/\/        UiParameterList *parameters;\n\n        terminal(ast->defaultToken);\n        terminal(ast->readonlyToken);\n        terminal(ast->propertyToken);\n        terminal(ast->typeModifierToken);\n        terminal(ast->typeToken);\n        terminal(ast->identifierToken);\n        terminal(ast->colonToken);\n        nonterminal(ast->expression);\n        nonterminal(ast->binding);\n        terminal(ast->semicolonToken);\n        return false;\n    }\n\n    virtual bool visit(StringLiteral *ast) { terminal(ast->literalToken); return false; }\n    virtual bool visit(NumericLiteral *ast) { terminal(ast->literalToken); return false; }\n    virtual bool visit(TrueLiteral *ast) { terminal(ast->trueToken); return false; }\n    virtual bool visit(FalseLiteral *ast) { terminal(ast->falseToken); return false; }\n    virtual bool visit(IdentifierExpression *ast) { terminal(ast->identifierToken); return false; }\n    virtual bool visit(FieldMemberExpression *ast) { nonterminal(ast->base); terminal(ast->dotToken); terminal(ast->identifierToken); return false; }\n    virtual bool visit(BinaryExpression *ast) { nonterminal(ast->left); terminal(ast->operatorToken); nonterminal(ast->right); return false; }\n    virtual bool visit(UnaryPlusExpression *ast) { terminal(ast->plusToken); nonterminal(ast->expression); return false; }\n    virtual bool visit(UnaryMinusExpression *ast) { terminal(ast->minusToken); nonterminal(ast->expression); return false; }\n    virtual bool visit(NestedExpression *ast) { terminal(ast->lparenToken); nonterminal(ast->expression); terminal(ast->rparenToken); return false; }\n\nprotected:\n    void alignTerminals() {\n        out<<\"{ rank=same;\" << endl;\n        foreach (const QByteArray &terminalShape, _terminalShapes) {\n            out << \"  \" << string(terminalShape) << \";\" << endl;\n        }\n        out<<\"}\"<<endl;\n    }\n\n    static QByteArray name(Node *ast) {\n#ifdef __GNUC__\n        QByteArray name = abi::__cxa_demangle(typeid(*ast).name(), 0, 0, 0) + 12;\n#else\n        QByteArray name = typeid(*ast).name();\n#endif\n        return name;\n    }\n\n    QString spell(const SourceLocation &token) {\n        return _src.mid(token.offset, token.length).replace('\\'', \"\\\\\\\\\").replace('\"', \"\\\\\\\"\");\n    }\n\n    void terminal(const SourceLocation &token) {\n        if (!token.isValid())\n            return;\n\n        static int count = 1;\n        QByteArray id = 't' + QByteArray::number(count++);\n        Node *node = _stack.last();\n        _connections.append(qMakePair(_id[node], id));\n\n        QByteArray t;\n        t.append(id);\n        t.append(\" [label = \\\"\");\n        t.append(spell(token));\n        t.append(\"\\\" shape=rect]\");\n        _terminalShapes.append(t);\n    }\n\n    virtual void nonterminal(Node *ast) {\n        Node::accept(ast, this);\n    }\n\n    virtual void node(Node *ast) {\n        out << _id[ast].constData() << \" [label=\\\"\" << name(ast).constData() << \"\\\"];\" << endl;\n    }\n\n    virtual bool preVisit(Node *ast) {\n        static int count = 1;\n        const QByteArray id = 'n' + QByteArray::number(count++);\n        _id[ast] = id;\n\n\n        if (! _stack.isEmpty())\n            _connections.append(qMakePair(_id[_stack.last()], id));\n\n        _stack.append(ast);\n\n        node(ast);\n\n        return true;\n    }\n\n    virtual void postVisit(Node *) {\n        _stack.removeLast();\n    }\n\nprivate:\n    QHash<Node *, QByteArray> _id;\n    QList<QPair<QByteArray, QByteArray> > _connections;\n    QList<Node *> _stack;\n    QList<QByteArray> _terminalShapes;\n    ofstream out;\n    QByteArray _src;\n};\n\nint main(int argc, char *argv[])\n{\n    QCoreApplication app(argc, argv);\n\n    QStringList files = app.arguments();\n    files.removeFirst();\n\n    foreach (const QString &fileName, files) {\n        QFile file(fileName);\n        if (! file.open(QFile::ReadOnly)) {\n            cerr << \"Cannot open \\\"\" << qPrintable(fileName)\n                      << \"\\\", skipping it.\" << endl;\n            continue;\n        }\n\n        const QByteArray source = file.readAll();\n        file.close();\n\n        Document::Ptr doc = Document::create(fileName);\n        doc->setSource(source);\n        doc->parseQml();\n\n        foreach (const DiagnosticMessage &m, doc->diagnosticMessages()) {\n            ostream *os;\n            if (m.isError()) {\n                os = &cerr;\n                *os << \"Error:\";\n            } else {\n                os = &cout;\n                *os << \"Warning:\";\n            }\n\n            if (m.loc.isValid())\n                *os << m.loc.startLine << ':' << m.loc.startColumn << ':';\n            *os << ' ';\n            *os << qPrintable(m.message) << endl;\n        }\n\n        ASTDump dump;\n        dump(fileName, source, doc->qmlProgram());\n    }\n\n    return EXIT_SUCCESS;\n}\n<commit_msg>Added more visitor methods.<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 <qmljs\/parser\/qmljsast_p.h>\n#include <qmljs\/parser\/qmljsastvisitor_p.h>\n#include <qmljs\/qmljsdocument.h>\n\n#include <QFile>\n#include <QList>\n#include <QCoreApplication>\n#include <QStringList>\n#include <QFileInfo>\n#include <QTime>\n#include <QtDebug>\n\n#include <cstdio>\n#include <cstdlib>\n#include <fstream>\n#include <iostream>\n#ifdef __GNUC__\n#  include <cxxabi.h>\n#endif\n\nusing namespace QmlJS;\nusing namespace QmlJS::AST;\nusing namespace std;\n\nclass ASTDump: protected Visitor\n{\npublic:\n    void operator()(const QString &fileName, const QByteArray &src, Node *ast) {\n        _src = src;\n        QString basename = fileName;\n        int dotIdx = basename.lastIndexOf('.');\n        if (dotIdx != -1)\n            basename.truncate(dotIdx);\n        basename.append(QLatin1String(\".ast.dot\"));\n        out.open(basename.toUtf8().constData());\n\n        out << \"digraph AST { ordering=out;\" << endl;\n        \/\/ cout << \"rankdir = \\\"LR\\\";\" << endl;\n        Node::accept(ast, this);\n\n        typedef QPair<QByteArray, QByteArray> Pair;\n\n        foreach (const Pair &conn, _connections)\n            out << conn.first.constData() << \" -> \" << conn.second.constData() << endl;\n\n        alignTerminals();\n\n        out << \"}\" << endl;\n        out.close();\n        cout << qPrintable(basename) << endl;\n    }\n\nprotected:\n    void alignTerminals() {\n        out<<\"{ rank=same;\" << endl;\n        foreach (const QByteArray &terminalShape, _terminalShapes) {\n            out << \"  \" << string(terminalShape) << \";\" << endl;\n        }\n        out<<\"}\"<<endl;\n    }\n\n    static QByteArray name(Node *ast) {\n#ifdef __GNUC__\n        QByteArray name = abi::__cxa_demangle(typeid(*ast).name(), 0, 0, 0) + 12;\n#else\n        QByteArray name = typeid(*ast).name();\n#endif\n        return name;\n    }\n\n    QString spell(const SourceLocation &token) {\n        return _src.mid(token.offset, token.length).replace('\\'', \"\\\\\\\\\").replace('\"', \"\\\\\\\"\");\n    }\n\n    void terminal(const SourceLocation &token) {\n        if (!token.isValid())\n            return;\n\n        static int count = 1;\n        QByteArray id = 't' + QByteArray::number(count++);\n        Node *node = _stack.last();\n        _connections.append(qMakePair(_id[node], id));\n\n        QByteArray t;\n        t.append(id);\n        t.append(\" [label = \\\"\");\n        t.append(spell(token));\n        t.append(\"\\\" shape=rect]\");\n        _terminalShapes.append(t);\n    }\n\n    virtual void nonterminal(Node *ast) {\n        Node::accept(ast, this);\n    }\n\n    virtual void node(Node *ast) {\n        out << _id[ast].constData() << \" [label=\\\"\" << name(ast).constData() << \"\\\"];\" << endl;\n    }\n\n    virtual bool preVisit(Node *ast) {\n        static int count = 1;\n        const QByteArray id = 'n' + QByteArray::number(count++);\n        _id[ast] = id;\n\n\n        if (! _stack.isEmpty())\n            _connections.append(qMakePair(_id[_stack.last()], id));\n\n        _stack.append(ast);\n\n        node(ast);\n\n        return true;\n    }\n\n    virtual void postVisit(Node *) {\n        _stack.removeLast();\n    }\n\nprotected: \/\/ visiting methods:\n    virtual bool visit(UiImport *ast) {\n        terminal(ast->importToken);\n\n        if (ast->importUri)\n            nonterminal(ast->importUri);\n        else\n            terminal(ast->fileNameToken);\n\n        terminal(ast->versionToken);\n        terminal(ast->asToken);\n        terminal(ast->importIdToken);\n        terminal(ast->semicolonToken);\n        return false;\n    }\n\n    virtual bool visit(UiObjectBinding *ast) {\n        if (ast->hasOnToken) {\n            nonterminal(ast->qualifiedTypeNameId);\n            terminal(ast->colonToken);\n            nonterminal(ast->qualifiedId);\n        } else {\n            nonterminal(ast->qualifiedId);\n            terminal(ast->colonToken);\n            nonterminal(ast->qualifiedTypeNameId);\n        }\n        nonterminal(ast->initializer);\n        return false;\n    }\n\n    virtual bool visit(UiObjectDefinition *ast) {\n        nonterminal(ast->qualifiedTypeNameId);\n        nonterminal(ast->initializer);\n        return false;\n    }\n\n    virtual bool visit(UiObjectInitializer *ast) {\n        terminal(ast->lbraceToken);\n        nonterminal(ast->members);\n        terminal(ast->rbraceToken);\n        return false;\n    }\n\n    virtual bool visit(UiScriptBinding *ast) {\n        nonterminal(ast->qualifiedId);\n        terminal(ast->colonToken);\n        nonterminal(ast->statement);\n        return false;\n    }\n\n    virtual bool visit(UiArrayBinding *ast) {\n        nonterminal(ast->qualifiedId);\n        terminal(ast->colonToken);\n        terminal(ast->lbracketToken);\n        nonterminal(ast->members);\n        terminal(ast->rbracketToken);\n        return false;\n    }\n\n    virtual bool visit(UiArrayMemberList *ast) {\n        terminal(ast->commaToken);\n        nonterminal(ast->member);\n        nonterminal(ast->next);\n        return false;\n    }\n\n    virtual bool visit(UiQualifiedId *ast) {\n        terminal(ast->identifierToken);\n        nonterminal(ast->next);\n        return false;\n    }\n\n    virtual bool visit(UiPublicMember *ast) {\n        \/\/ TODO: place the paramters...\n\/\/        UiParameterList *parameters;\n\n        terminal(ast->defaultToken);\n        terminal(ast->readonlyToken);\n        terminal(ast->propertyToken);\n        terminal(ast->typeModifierToken);\n        terminal(ast->typeToken);\n        terminal(ast->identifierToken);\n        terminal(ast->colonToken);\n        nonterminal(ast->expression);\n        nonterminal(ast->binding);\n        terminal(ast->semicolonToken);\n        return false;\n    }\n\n    virtual bool visit(UiFormal *ast) { terminal(ast->identifierToken); terminal(ast->asToken); terminal(ast->aliasToken); return false; }\n    virtual bool visit(UiSignature *ast) { terminal(ast->lparenToken); nonterminal(ast->formals); terminal(ast->rparenToken); return false; }\n\n    virtual bool visit(StringLiteral *ast) { terminal(ast->literalToken); return false; }\n    virtual bool visit(NumericLiteral *ast) { terminal(ast->literalToken); return false; }\n    virtual bool visit(TrueLiteral *ast) { terminal(ast->trueToken); return false; }\n    virtual bool visit(FalseLiteral *ast) { terminal(ast->falseToken); return false; }\n    virtual bool visit(IdentifierExpression *ast) { terminal(ast->identifierToken); return false; }\n    virtual bool visit(FieldMemberExpression *ast) { nonterminal(ast->base); terminal(ast->dotToken); terminal(ast->identifierToken); return false; }\n    virtual bool visit(BinaryExpression *ast) { nonterminal(ast->left); terminal(ast->operatorToken); nonterminal(ast->right); return false; }\n    virtual bool visit(UnaryPlusExpression *ast) { terminal(ast->plusToken); nonterminal(ast->expression); return false; }\n    virtual bool visit(UnaryMinusExpression *ast) { terminal(ast->minusToken); nonterminal(ast->expression); return false; }\n    virtual bool visit(NestedExpression *ast) { terminal(ast->lparenToken); nonterminal(ast->expression); terminal(ast->rparenToken); return false; }\n    virtual bool visit(ThisExpression *ast) { terminal(ast->thisToken); return false; }\n    virtual bool visit(NullExpression *ast) { terminal(ast->nullToken); return false; }\n    virtual bool visit(RegExpLiteral *ast) { terminal(ast->literalToken); return false; }\n    virtual bool visit(ArrayLiteral *ast) { terminal(ast->lbracketToken); nonterminal(ast->elements); terminal(ast->commaToken); nonterminal(ast->elision); terminal(ast->rbracketToken); return false; }\n    virtual bool visit(ObjectLiteral *ast) { terminal(ast->lbraceToken); nonterminal(ast->properties); terminal(ast->rbraceToken); return false; }\n    virtual bool visit(ElementList *ast) { nonterminal(ast->next); terminal(ast->commaToken); nonterminal(ast->elision); nonterminal(ast->expression); return false; }\n    virtual bool visit(Elision *ast) { nonterminal(ast->next); terminal(ast->commaToken); return false; }\n    virtual bool visit(PropertyNameAndValueList *ast) { nonterminal(ast->name); terminal(ast->colonToken); nonterminal(ast->value); terminal(ast->commaToken); nonterminal(ast->next); return false; }\n    virtual bool visit(IdentifierPropertyName *ast) { terminal(ast->propertyNameToken); return false; }\n    virtual bool visit(StringLiteralPropertyName *ast) { terminal(ast->propertyNameToken); return false; }\n    virtual bool visit(NumericLiteralPropertyName *ast) { terminal(ast->propertyNameToken); return false; }\n    virtual bool visit(ArrayMemberExpression *ast) { nonterminal(ast->base); terminal(ast->lbracketToken); nonterminal(ast->expression); terminal(ast->rbracketToken); return false; }\n    virtual bool visit(NewMemberExpression *ast) { terminal(ast->newToken); nonterminal(ast->base); terminal(ast->lparenToken); nonterminal(ast->arguments); terminal(ast->rparenToken); return false; }\n    virtual bool visit(NewExpression *ast) { terminal(ast->newToken); nonterminal(ast->expression); return false; }\n    virtual bool visit(CallExpression *ast) { nonterminal(ast->base); terminal(ast->lparenToken); nonterminal(ast->arguments); terminal(ast->rparenToken); return false; }\n    virtual bool visit(ArgumentList *ast) { nonterminal(ast->expression); terminal(ast->commaToken); nonterminal(ast->next); return false; }\n    virtual bool visit(PostIncrementExpression *ast) { nonterminal(ast->base); terminal(ast->incrementToken); return false; }\n    virtual bool visit(PostDecrementExpression *ast) { nonterminal(ast->base); terminal(ast->decrementToken); return false; }\n    virtual bool visit(DeleteExpression *ast) { terminal(ast->deleteToken); nonterminal(ast->expression); return false; }\n    virtual bool visit(VoidExpression *ast) { terminal(ast->voidToken); nonterminal(ast->expression); return false; }\n    virtual bool visit(TypeOfExpression *ast) { terminal(ast->typeofToken); nonterminal(ast->expression); return false; }\n    virtual bool visit(PreIncrementExpression *ast) { terminal(ast->incrementToken); nonterminal(ast->expression); return false; }\n    virtual bool visit(PreDecrementExpression *ast) { terminal(ast->decrementToken); nonterminal(ast->expression); return false; }\n    virtual bool visit(TildeExpression *ast) { terminal(ast->tildeToken); nonterminal(ast->expression); return false; }\n    virtual bool visit(NotExpression *ast) { terminal(ast->notToken); nonterminal(ast->expression); return false; }\n    virtual bool visit(ConditionalExpression *ast) { nonterminal(ast->expression); terminal(ast->questionToken); nonterminal(ast->ok); terminal(ast->colonToken); nonterminal(ast->ko); return false; }\n    virtual bool visit(Expression *ast) { nonterminal(ast->left); terminal(ast->commaToken); nonterminal(ast->right); return false; }\n    virtual bool visit(Block *ast) { terminal(ast->lbraceToken); nonterminal(ast->statements); terminal(ast->rbraceToken); return false; }\n    virtual bool visit(VariableStatement *ast) { terminal(ast->declarationKindToken); nonterminal(ast->declarations); terminal(ast->semicolonToken); return false; }\n    virtual bool visit(VariableDeclaration *ast) { terminal(ast->identifierToken); nonterminal(ast->expression); return false; }\n    virtual bool visit(VariableDeclarationList *ast) { nonterminal(ast->declaration); terminal(ast->commaToken); nonterminal(ast->next); return false; }\n    virtual bool visit(EmptyStatement* ast) { terminal(ast->semicolonToken); return false; }\n    virtual bool visit(ExpressionStatement *ast) { nonterminal(ast->expression); terminal(ast->semicolonToken); return false; }\n    virtual bool visit(IfStatement *ast) { terminal(ast->ifToken); terminal(ast->lparenToken); nonterminal(ast->expression); terminal(ast->rparenToken); nonterminal(ast->ok); terminal(ast->elseToken); nonterminal(ast->ko); return false; }\n    virtual bool visit(DoWhileStatement *ast) { terminal(ast->doToken); nonterminal(ast->statement); terminal(ast->whileToken); terminal(ast->lparenToken); nonterminal(ast->expression); terminal(ast->rparenToken); terminal(ast->semicolonToken); return false; }\n\n\/\/ TODO: visitors for:\n\/\/    WhileStatement\n\/\/    ForStatement\n\/\/    LocalForStatement\n\/\/    ForEachStatement\n\/\/    LocalForEachStatement\n\/\/    ContinueStatement\n\/\/    BreakStatement\n\/\/    ReturnStatement\n\/\/    WithStatement\n\/\/    CaseBlock\n\/\/    SwitchStatement\n\/\/    CaseClause\n\/\/    DefaultClause\n\/\/    LabelledStatement\n\/\/    ThrowStatement\n\/\/    Catch\n\/\/    Finally\n\/\/    TryStatement\n\/\/    FunctionExpression\n\/\/    FunctionDeclaration\n\/\/    DebuggerStatement\n\/\/    UiParameterList\n\nprivate:\n    QHash<Node *, QByteArray> _id;\n    QList<QPair<QByteArray, QByteArray> > _connections;\n    QList<Node *> _stack;\n    QList<QByteArray> _terminalShapes;\n    ofstream out;\n    QByteArray _src;\n};\n\nint main(int argc, char *argv[])\n{\n    QCoreApplication app(argc, argv);\n\n    QStringList files = app.arguments();\n    files.removeFirst();\n\n    foreach (const QString &fileName, files) {\n        QFile file(fileName);\n        if (! file.open(QFile::ReadOnly)) {\n            cerr << \"Cannot open \\\"\" << qPrintable(fileName)\n                      << \"\\\", skipping it.\" << endl;\n            continue;\n        }\n\n        const QByteArray source = file.readAll();\n        file.close();\n\n        Document::Ptr doc = Document::create(fileName);\n        doc->setSource(source);\n        doc->parseQml();\n\n        foreach (const DiagnosticMessage &m, doc->diagnosticMessages()) {\n            ostream *os;\n            if (m.isError()) {\n                os = &cerr;\n                *os << \"Error:\";\n            } else {\n                os = &cout;\n                *os << \"Warning:\";\n            }\n\n            if (m.loc.isValid())\n                *os << m.loc.startLine << ':' << m.loc.startColumn << ':';\n            *os << ' ';\n            *os << qPrintable(m.message) << endl;\n        }\n\n        ASTDump dump;\n        dump(fileName, source, doc->qmlProgram());\n    }\n\n    return EXIT_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: pagefrm.hxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: ama $ $Date: 2002-02-08 14:47: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#ifndef _PAGEFRM_HXX\n#define _PAGEFRM_HXX\n\n\n\n#ifndef _SVARRAY_HXX \/\/autogen\n#include <svtools\/svarray.hxx>\n#endif\n\n#include \"ftnboss.hxx\"\n\n#ifndef _SVMEMPOOL_HXX \/\/autogen\n#include <tools\/mempool.hxx>\n#endif\n\nclass SwFlyFrm;\nclass SwFrmFmt;\nclass SwPageDesc;\nclass SwCntntFrm;\nstruct SwPosition;\nstruct SwCrsrMoveState;\nclass SwFmtAnchor;\nclass SdrObject;\nclass SwDrawContact;\nclass SwAttrSetChg;\nclass SvPtrarr;\n\nSV_DECL_PTRARR_SORT(SwSortDrawObjs,SdrObjectPtr,1,2);\n\nenum SwPageChg\n{\n    CHG_NEWPAGE,\n    CHG_CUTPAGE,\n    CHG_CHGPAGE\n};\n\nclass SwPageFrm: public SwFtnBossFrm\n{\n    friend class SwFrm;\n\n    \/\/Array fuer die Draw-Objekte auf der Seite.\n    \/\/Das Sortierte Array ist nach den Pointeraddressen sortiert.\n    \/\/Die Objs in dem Array haben ihren Anker nicht notwendigerweise auf\n    \/\/der Seite.\n    SwSortDrawObjs *pSortedObjs;\n\n    SwPageDesc *pDesc;      \/\/PageDesc der die Seite beschreibt.\n\n    USHORT  nPhyPageNum;        \/\/Physikalische Seitennummer.\n\n    BOOL bInvalidCntnt      :1;\n    BOOL bInvalidLayout     :1;\n    BOOL bInvalidFlyCntnt   :1;\n    BOOL bInvalidFlyLayout  :1;\n    BOOL bInvalidFlyInCnt   :1;\n    BOOL bFtnPage           :1; \/\/Diese Seite ist fuer Dokumentende-Fussnoten.\n    BOOL bEmptyPage         :1; \/\/Dies ist eine explizite Leerseite\n    BOOL bInvalidSpelling   :1; \/\/Das Online-Spelling ist gefordert\n    BOOL bEndNotePage       :1; \/\/'Fussnotenseite' fuer Endnoten\n    BOOL bInvalidAutoCmplWrds :1; \/\/Auto-Complete Wordliste aktualisieren\n#ifdef VERTICAL_LAYOUT\n    BOOL bHasGrid           :1; \/\/ Grid for Asian layout\n#endif\n    \/\/Anpassung der RootSize und Benachrichtigungen beim Einsetzen,\n    \/\/Entfernen und Groessenaenderungen der Seite.\n    void AdjustRootSize( const SwPageChg eChgType, const SwRect *pOld );\n\n    void _UpdateAttr( SfxPoolItem*, SfxPoolItem*, BYTE &,\n                      SwAttrSetChg *pa = 0, SwAttrSetChg *pb = 0 );\n\n    \/\/ Anpassen der max. Fussnotenhoehen in den einzelnen Spalten\n    void SetColMaxFtnHeight();\n\nprotected:\n    virtual void MakeAll();\n\npublic:\n    DECL_FIXEDMEMPOOL_NEWDEL(SwPageFrm)\n\n    SwPageFrm( SwFrmFmt*, SwPageDesc* );\n    ~SwPageFrm();\n\n    \/\/public, damit die ViewShell beim Umschalten vom BrowseMode darauf\n    \/\/zugreifen kann.\n    void PrepareHeader();   \/\/Kopf-\/Fusszeilen anlegen\/entfernen.\n    void PrepareFooter();\n\n    const SwSortDrawObjs  *GetSortedObjs() const  { return pSortedObjs; }\n          SwSortDrawObjs  *GetSortedObjs()        { return pSortedObjs; }\n\n    void AppendDrawObj( SwDrawContact *pNew );\n    void RemoveDrawObj( SwDrawContact *pToRemove );\n\n    void AppendFly( SwFlyFrm *pNew );\n    void RemoveFly( SwFlyFrm *pToRemove );\n    void MoveFly( SwFlyFrm *pToMove, SwPageFrm *pDest );\/\/optimiertes Remove\/Append\n\n    void  SetPageDesc( SwPageDesc *, SwFrmFmt * );\n          SwPageDesc *GetPageDesc() { return pDesc; }\n    const SwPageDesc *GetPageDesc() const { return pDesc; }\n          SwPageDesc *FindPageDesc();\n\n                 SwCntntFrm  *FindLastBodyCntnt();\n    inline       SwCntntFrm  *FindFirstBodyCntnt();\n    inline const SwCntntFrm  *FindFirstBodyCntnt() const;\n    inline const SwCntntFrm  *FindLastBodyCntnt() const;\n\n    \/\/Spezialisiertes GetCntntPos() fuer Felder in Rahmen.\n    void GetCntntPosition( const Point &rPt, SwPosition &rPos ) const;\n\n    BOOL IsEmptyPage() const { return bEmptyPage; } \/\/explizite Leerseite.\n\n    void    UpdateFtnNum();\n\n    \/\/Immer nach dem Paste rufen. Erzeugt die Seitengeb. Rahmen und Formatiert\n    \/\/generischen Inhalt.\n    void PreparePage( BOOL bFtn );\n\n    \/\/Schickt an alle ContentFrames ein Prepare wg. geaenderter Registervorlage\n    void PrepareRegisterChg();\n\n    \/\/Haengt einen Fly an den geeigneten LayoutFrm unterhalb der Seite,\n    \/\/fuer SwFEShell und Modify der Flys.\n    SwFrm *PlaceFly( SwFlyFrm *, SwFrmFmt *, const SwFmtAnchor * );\n\n    virtual BOOL GetCrsrOfst( SwPosition *, Point&,\n                              const SwCrsrMoveState* = 0 ) const;\n    virtual void Modify( SfxPoolItem*, SfxPoolItem* );\n        \/\/ erfrage vom Client Informationen\n    virtual BOOL GetInfo( SfxPoolItem& ) const;\n\n    virtual void Cut();\n    virtual void Paste( SwFrm* pParent, SwFrm* pSibling = 0 );\n#ifdef VERTICAL_LAYOUT\n    virtual void  CheckDirection( BOOL bVert );\n    void CheckGrid( BOOL bInvalidate );\n    void PaintGrid( OutputDevice* pOut, SwRect &rRect ) const;\n    BOOL HasGrid() const { return bHasGrid; }\n#endif\n\n    \/\/Umrandungen aller Frms innerhalb der Seite Painten.\n    void PaintAllBorders( const SwRect &rRect ) const;\n\n    \/\/Zeilennummern usw malen\n    void RefreshExtraData( const SwRect & ) const;\n\n    \/\/Hilfslinien malen.\n    void RefreshSubsidiary( const SwRect& ) const;\n\n    \/\/Fussnotenschnittstelle\n    BOOL IsFtnPage() const                                  { return bFtnPage; }\n    BOOL IsEndNotePage() const                              { return bEndNotePage; }\n    void SetFtnPage( BOOL b )                               { bFtnPage = b; }\n    void SetEndNotePage( BOOL b )                           { bEndNotePage = b; }\n\n    inline  const USHORT GetPhyPageNum() const  { return nPhyPageNum;}\n    inline  void SetPhyPageNum( USHORT nNum )   { nPhyPageNum = nNum;}\n    inline  void DecrPhyPageNum()               { --nPhyPageNum;     }\n    inline  void IncrPhyPageNum()               { ++nPhyPageNum;     }\n\n    \/\/Validieren, invalidieren und abfragen des Status der Seite.\n    \/\/Layout\/Cntnt und jeweils Fly\/nicht Fly werden getrennt betrachtet.\n    inline void InvalidateFlyLayout() const;\n    inline void InvalidateFlyCntnt() const;\n    inline void InvalidateFlyInCnt() const;\n    inline void InvalidateLayout() const;\n    inline void InvalidateCntnt() const;\n    inline void InvalidateSpelling() const;\n    inline void InvalidateAutoCompleteWords() const;\n    inline void ValidateFlyLayout() const;\n    inline void ValidateFlyCntnt() const;\n    inline void ValidateFlyInCnt() const;\n    inline void ValidateLayout() const;\n    inline void ValidateCntnt() const;\n    inline void ValidateSpelling()  const;\n    inline void ValidateAutoCompleteWords() const;\n    inline BOOL IsInvalid() const;\n    inline BOOL IsInvalidFly() const;\n    BOOL IsInvalidFlyLayout() const { return bInvalidFlyLayout; }\n    BOOL IsInvalidFlyCntnt() const { return bInvalidFlyCntnt; }\n    BOOL IsInvalidFlyInCnt() const { return bInvalidFlyInCnt; }\n    BOOL IsInvalidLayout() const { return bInvalidLayout; }\n    BOOL IsInvalidCntnt() const { return (bInvalidCntnt || bInvalidFlyInCnt); }\n    BOOL IsInvalidSpelling() const { return bInvalidSpelling; }\n    BOOL IsInvalidAutoCompleteWords() const { return bInvalidAutoCmplWrds; }\n};\n\ninline SwCntntFrm *SwPageFrm::FindFirstBodyCntnt()\n{\n    SwLayoutFrm *pBody = FindBodyCont();\n    return pBody ? pBody->ContainsCntnt() : 0;\n}\ninline const SwCntntFrm *SwPageFrm::FindFirstBodyCntnt() const\n{\n    const SwLayoutFrm *pBody = FindBodyCont();\n    return pBody ? pBody->ContainsCntnt() : 0;\n}\ninline const SwCntntFrm *SwPageFrm::FindLastBodyCntnt() const\n{\n    return ((SwPageFrm*)this)->FindLastBodyCntnt();\n}\ninline void SwPageFrm::InvalidateFlyLayout() const\n{\n    ((SwPageFrm*)this)->bInvalidFlyLayout = TRUE;\n}\ninline void SwPageFrm::InvalidateFlyCntnt() const\n{\n    ((SwPageFrm*)this)->bInvalidFlyCntnt = TRUE;\n}\ninline void SwPageFrm::InvalidateFlyInCnt() const\n{\n    ((SwPageFrm*)this)->bInvalidFlyInCnt = TRUE;\n}\ninline void SwPageFrm::InvalidateLayout() const\n{\n    ((SwPageFrm*)this)->bInvalidLayout = TRUE;\n}\ninline void SwPageFrm::InvalidateCntnt() const\n{\n    ((SwPageFrm*)this)->bInvalidCntnt = TRUE;\n}\ninline void SwPageFrm::InvalidateSpelling() const\n{\n    ((SwPageFrm*)this)->bInvalidSpelling = TRUE;\n}\ninline void SwPageFrm::InvalidateAutoCompleteWords() const\n{\n    ((SwPageFrm*)this)->bInvalidAutoCmplWrds = FALSE;\n}\ninline void SwPageFrm::ValidateFlyLayout() const\n{\n    ((SwPageFrm*)this)->bInvalidFlyLayout = FALSE;\n}\ninline void SwPageFrm::ValidateFlyCntnt() const\n{\n    ((SwPageFrm*)this)->bInvalidFlyCntnt = FALSE;\n}\ninline void SwPageFrm::ValidateFlyInCnt() const\n{\n    ((SwPageFrm*)this)->bInvalidFlyInCnt = FALSE;\n}\ninline void SwPageFrm::ValidateLayout() const\n{\n    ((SwPageFrm*)this)->bInvalidLayout = FALSE;\n}\ninline void SwPageFrm::ValidateCntnt() const\n{\n    ((SwPageFrm*)this)->bInvalidCntnt = FALSE;\n}\ninline void SwPageFrm::ValidateSpelling() const\n{\n    ((SwPageFrm*)this)->bInvalidSpelling = FALSE;\n}\ninline void SwPageFrm::ValidateAutoCompleteWords() const\n{\n    ((SwPageFrm*)this)->bInvalidAutoCmplWrds = FALSE;\n}\n\n\ninline BOOL SwPageFrm::IsInvalid() const\n{\n    return (bInvalidCntnt || bInvalidLayout || bInvalidFlyInCnt);\n}\ninline BOOL SwPageFrm::IsInvalidFly() const\n{\n    return bInvalidFlyLayout || bInvalidFlyCntnt;\n}\n\n#ifdef VERTICAL_LAYOUT\n#define GETGRID( pPage ) const SwTextGridItem *pGrid = NULL; \\\n {if( pPage && pPage->HasGrid() && GRID_NONE==(pGrid=(SwTextGridItem*)&pPage->\\\n     GetPageDesc()->GetMaster().GetAttr(RES_TEXTGRID))->GetGridType() ) \\\n    pGrid = NULL;}\n#endif\n\n\n#endif  \/\/_PAGEFRM_HXX\n<commit_msg>#102450# - new method to determine background color of page<commit_after>\/*************************************************************************\n *\n *  $RCSfile: pagefrm.hxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: od $ $Date: 2002-09-03 07:51: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 _PAGEFRM_HXX\n#define _PAGEFRM_HXX\n\n\n\n#ifndef _SVARRAY_HXX \/\/autogen\n#include <svtools\/svarray.hxx>\n#endif\n\n#include \"ftnboss.hxx\"\n\n#ifndef _SVMEMPOOL_HXX \/\/autogen\n#include <tools\/mempool.hxx>\n#endif\n\nclass SwFlyFrm;\nclass SwFrmFmt;\nclass SwPageDesc;\nclass SwCntntFrm;\nstruct SwPosition;\nstruct SwCrsrMoveState;\nclass SwFmtAnchor;\nclass SdrObject;\nclass SwDrawContact;\nclass SwAttrSetChg;\nclass SvPtrarr;\n\nSV_DECL_PTRARR_SORT(SwSortDrawObjs,SdrObjectPtr,1,2);\n\nenum SwPageChg\n{\n    CHG_NEWPAGE,\n    CHG_CUTPAGE,\n    CHG_CHGPAGE\n};\n\nclass SwPageFrm: public SwFtnBossFrm\n{\n    friend class SwFrm;\n\n    \/\/Array fuer die Draw-Objekte auf der Seite.\n    \/\/Das Sortierte Array ist nach den Pointeraddressen sortiert.\n    \/\/Die Objs in dem Array haben ihren Anker nicht notwendigerweise auf\n    \/\/der Seite.\n    SwSortDrawObjs *pSortedObjs;\n\n    SwPageDesc *pDesc;      \/\/PageDesc der die Seite beschreibt.\n\n    USHORT  nPhyPageNum;        \/\/Physikalische Seitennummer.\n\n    BOOL bInvalidCntnt      :1;\n    BOOL bInvalidLayout     :1;\n    BOOL bInvalidFlyCntnt   :1;\n    BOOL bInvalidFlyLayout  :1;\n    BOOL bInvalidFlyInCnt   :1;\n    BOOL bFtnPage           :1; \/\/Diese Seite ist fuer Dokumentende-Fussnoten.\n    BOOL bEmptyPage         :1; \/\/Dies ist eine explizite Leerseite\n    BOOL bInvalidSpelling   :1; \/\/Das Online-Spelling ist gefordert\n    BOOL bEndNotePage       :1; \/\/'Fussnotenseite' fuer Endnoten\n    BOOL bInvalidAutoCmplWrds :1; \/\/Auto-Complete Wordliste aktualisieren\n#ifdef VERTICAL_LAYOUT\n    BOOL bHasGrid           :1; \/\/ Grid for Asian layout\n#endif\n    \/\/Anpassung der RootSize und Benachrichtigungen beim Einsetzen,\n    \/\/Entfernen und Groessenaenderungen der Seite.\n    void AdjustRootSize( const SwPageChg eChgType, const SwRect *pOld );\n\n    void _UpdateAttr( SfxPoolItem*, SfxPoolItem*, BYTE &,\n                      SwAttrSetChg *pa = 0, SwAttrSetChg *pb = 0 );\n\n    \/\/ Anpassen der max. Fussnotenhoehen in den einzelnen Spalten\n    void SetColMaxFtnHeight();\n\nprotected:\n    virtual void MakeAll();\n\npublic:\n    DECL_FIXEDMEMPOOL_NEWDEL(SwPageFrm)\n\n    SwPageFrm( SwFrmFmt*, SwPageDesc* );\n    ~SwPageFrm();\n\n    \/\/public, damit die ViewShell beim Umschalten vom BrowseMode darauf\n    \/\/zugreifen kann.\n    void PrepareHeader();   \/\/Kopf-\/Fusszeilen anlegen\/entfernen.\n    void PrepareFooter();\n\n    const SwSortDrawObjs  *GetSortedObjs() const  { return pSortedObjs; }\n          SwSortDrawObjs  *GetSortedObjs()        { return pSortedObjs; }\n\n    void AppendDrawObj( SwDrawContact *pNew );\n    void RemoveDrawObj( SwDrawContact *pToRemove );\n\n    void AppendFly( SwFlyFrm *pNew );\n    void RemoveFly( SwFlyFrm *pToRemove );\n    void MoveFly( SwFlyFrm *pToMove, SwPageFrm *pDest );\/\/optimiertes Remove\/Append\n\n    void  SetPageDesc( SwPageDesc *, SwFrmFmt * );\n          SwPageDesc *GetPageDesc() { return pDesc; }\n    const SwPageDesc *GetPageDesc() const { return pDesc; }\n          SwPageDesc *FindPageDesc();\n\n                 SwCntntFrm  *FindLastBodyCntnt();\n    inline       SwCntntFrm  *FindFirstBodyCntnt();\n    inline const SwCntntFrm  *FindFirstBodyCntnt() const;\n    inline const SwCntntFrm  *FindLastBodyCntnt() const;\n\n    \/\/Spezialisiertes GetCntntPos() fuer Felder in Rahmen.\n    void GetCntntPosition( const Point &rPt, SwPosition &rPos ) const;\n\n    BOOL IsEmptyPage() const { return bEmptyPage; } \/\/explizite Leerseite.\n\n    void    UpdateFtnNum();\n\n    \/\/Immer nach dem Paste rufen. Erzeugt die Seitengeb. Rahmen und Formatiert\n    \/\/generischen Inhalt.\n    void PreparePage( BOOL bFtn );\n\n    \/\/Schickt an alle ContentFrames ein Prepare wg. geaenderter Registervorlage\n    void PrepareRegisterChg();\n\n    \/\/Haengt einen Fly an den geeigneten LayoutFrm unterhalb der Seite,\n    \/\/fuer SwFEShell und Modify der Flys.\n    SwFrm *PlaceFly( SwFlyFrm *, SwFrmFmt *, const SwFmtAnchor * );\n\n    virtual BOOL GetCrsrOfst( SwPosition *, Point&,\n                              const SwCrsrMoveState* = 0 ) const;\n    virtual void Modify( SfxPoolItem*, SfxPoolItem* );\n        \/\/ erfrage vom Client Informationen\n    virtual BOOL GetInfo( SfxPoolItem& ) const;\n\n    virtual void Cut();\n    virtual void Paste( SwFrm* pParent, SwFrm* pSibling = 0 );\n#ifdef VERTICAL_LAYOUT\n    virtual void  CheckDirection( BOOL bVert );\n    void CheckGrid( BOOL bInvalidate );\n    void PaintGrid( OutputDevice* pOut, SwRect &rRect ) const;\n    BOOL HasGrid() const { return bHasGrid; }\n#endif\n\n    \/\/Umrandungen aller Frms innerhalb der Seite Painten.\n    void PaintAllBorders( const SwRect &rRect ) const;\n\n    \/\/Zeilennummern usw malen\n    void RefreshExtraData( const SwRect & ) const;\n\n    \/\/Hilfslinien malen.\n    void RefreshSubsidiary( const SwRect& ) const;\n\n    \/\/Fussnotenschnittstelle\n    BOOL IsFtnPage() const                                  { return bFtnPage; }\n    BOOL IsEndNotePage() const                              { return bEndNotePage; }\n    void SetFtnPage( BOOL b )                               { bFtnPage = b; }\n    void SetEndNotePage( BOOL b )                           { bEndNotePage = b; }\n\n    inline  const USHORT GetPhyPageNum() const  { return nPhyPageNum;}\n    inline  void SetPhyPageNum( USHORT nNum )   { nPhyPageNum = nNum;}\n    inline  void DecrPhyPageNum()               { --nPhyPageNum;     }\n    inline  void IncrPhyPageNum()               { ++nPhyPageNum;     }\n\n    \/\/Validieren, invalidieren und abfragen des Status der Seite.\n    \/\/Layout\/Cntnt und jeweils Fly\/nicht Fly werden getrennt betrachtet.\n    inline void InvalidateFlyLayout() const;\n    inline void InvalidateFlyCntnt() const;\n    inline void InvalidateFlyInCnt() const;\n    inline void InvalidateLayout() const;\n    inline void InvalidateCntnt() const;\n    inline void InvalidateSpelling() const;\n    inline void InvalidateAutoCompleteWords() const;\n    inline void ValidateFlyLayout() const;\n    inline void ValidateFlyCntnt() const;\n    inline void ValidateFlyInCnt() const;\n    inline void ValidateLayout() const;\n    inline void ValidateCntnt() const;\n    inline void ValidateSpelling()  const;\n    inline void ValidateAutoCompleteWords() const;\n    inline BOOL IsInvalid() const;\n    inline BOOL IsInvalidFly() const;\n    BOOL IsInvalidFlyLayout() const { return bInvalidFlyLayout; }\n    BOOL IsInvalidFlyCntnt() const { return bInvalidFlyCntnt; }\n    BOOL IsInvalidFlyInCnt() const { return bInvalidFlyInCnt; }\n    BOOL IsInvalidLayout() const { return bInvalidLayout; }\n    BOOL IsInvalidCntnt() const { return (bInvalidCntnt || bInvalidFlyInCnt); }\n    BOOL IsInvalidSpelling() const { return bInvalidSpelling; }\n    BOOL IsInvalidAutoCompleteWords() const { return bInvalidAutoCmplWrds; }\n\n    \/** SwPageFrm::GetDrawBackgrdColor - for #102450#\n\n        29.08.2002:\n        determine the color, that is respectively will be drawn as background\n        for the page frame.\n\n        @author OD\n\n        @return reference to an instance of class Color\n    *\/\n    const Color& GetDrawBackgrdColor() const;\n};\n\ninline SwCntntFrm *SwPageFrm::FindFirstBodyCntnt()\n{\n    SwLayoutFrm *pBody = FindBodyCont();\n    return pBody ? pBody->ContainsCntnt() : 0;\n}\ninline const SwCntntFrm *SwPageFrm::FindFirstBodyCntnt() const\n{\n    const SwLayoutFrm *pBody = FindBodyCont();\n    return pBody ? pBody->ContainsCntnt() : 0;\n}\ninline const SwCntntFrm *SwPageFrm::FindLastBodyCntnt() const\n{\n    return ((SwPageFrm*)this)->FindLastBodyCntnt();\n}\ninline void SwPageFrm::InvalidateFlyLayout() const\n{\n    ((SwPageFrm*)this)->bInvalidFlyLayout = TRUE;\n}\ninline void SwPageFrm::InvalidateFlyCntnt() const\n{\n    ((SwPageFrm*)this)->bInvalidFlyCntnt = TRUE;\n}\ninline void SwPageFrm::InvalidateFlyInCnt() const\n{\n    ((SwPageFrm*)this)->bInvalidFlyInCnt = TRUE;\n}\ninline void SwPageFrm::InvalidateLayout() const\n{\n    ((SwPageFrm*)this)->bInvalidLayout = TRUE;\n}\ninline void SwPageFrm::InvalidateCntnt() const\n{\n    ((SwPageFrm*)this)->bInvalidCntnt = TRUE;\n}\ninline void SwPageFrm::InvalidateSpelling() const\n{\n    ((SwPageFrm*)this)->bInvalidSpelling = TRUE;\n}\ninline void SwPageFrm::InvalidateAutoCompleteWords() const\n{\n    ((SwPageFrm*)this)->bInvalidAutoCmplWrds = FALSE;\n}\ninline void SwPageFrm::ValidateFlyLayout() const\n{\n    ((SwPageFrm*)this)->bInvalidFlyLayout = FALSE;\n}\ninline void SwPageFrm::ValidateFlyCntnt() const\n{\n    ((SwPageFrm*)this)->bInvalidFlyCntnt = FALSE;\n}\ninline void SwPageFrm::ValidateFlyInCnt() const\n{\n    ((SwPageFrm*)this)->bInvalidFlyInCnt = FALSE;\n}\ninline void SwPageFrm::ValidateLayout() const\n{\n    ((SwPageFrm*)this)->bInvalidLayout = FALSE;\n}\ninline void SwPageFrm::ValidateCntnt() const\n{\n    ((SwPageFrm*)this)->bInvalidCntnt = FALSE;\n}\ninline void SwPageFrm::ValidateSpelling() const\n{\n    ((SwPageFrm*)this)->bInvalidSpelling = FALSE;\n}\ninline void SwPageFrm::ValidateAutoCompleteWords() const\n{\n    ((SwPageFrm*)this)->bInvalidAutoCmplWrds = FALSE;\n}\n\n\ninline BOOL SwPageFrm::IsInvalid() const\n{\n    return (bInvalidCntnt || bInvalidLayout || bInvalidFlyInCnt);\n}\ninline BOOL SwPageFrm::IsInvalidFly() const\n{\n    return bInvalidFlyLayout || bInvalidFlyCntnt;\n}\n\n#ifdef VERTICAL_LAYOUT\n#define GETGRID( pPage ) const SwTextGridItem *pGrid = NULL; \\\n {if( pPage && pPage->HasGrid() && GRID_NONE==(pGrid=(SwTextGridItem*)&pPage->\\\n     GetPageDesc()->GetMaster().GetAttr(RES_TEXTGRID))->GetGridType() ) \\\n    pGrid = NULL;}\n#endif\n\n\n#endif  \/\/_PAGEFRM_HXX\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: itratr.hxx,v $\n *\n *  $Revision: 1.16 $\n *\n *  last change: $Author: obo $ $Date: 2004-08-12 12: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#ifndef _ITRATR_HXX\n#define _ITRATR_HXX\n\n\n#ifndef _SOLAR_H\n#include <tools\/solar.h>\n#endif\n#ifndef _ATRHNDL_HXX\n#include <atrhndl.hxx>\n#endif\n\n#include \"txttypes.hxx\"\n#include \"swfont.hxx\"\n#include \"porlay.hxx\"\n\n#define _SVSTDARR_XUB_STRLEN\n#define _SVSTDARR_USHORTS\n#include <svtools\/svstdarr.hxx>\n\nclass OutputDevice;\nclass SwFont;\nclass SwpHints;\nclass SwTxtAttr;\nclass SwAttrSet;\nclass SwTxtNode;\nclass SwRedlineItr;\nclass ViewShell;\n\n#ifdef VERTICAL_LAYOUT\nclass SwTxtFrm;\n#endif\n\n\/*************************************************************************\n *                      class SwAttrIter\n *************************************************************************\/\n\nclass SwAttrIter\n{\n    friend class SwFontSave;\nprotected:\n\n    SwAttrHandler aAttrHandler;\n    ViewShell *pShell;\n    SwFont *pFnt;\n    SwpHints  *pHints;\n    const SwAttrSet* pAttrSet;       \/\/ das Char-Attribut-Set\n    SwScriptInfo* pScriptInfo;\n\nprivate:\n    OutputDevice *pLastOut;\n    MSHORT nChgCnt;\n    SwRedlineItr *pRedln;\n    xub_StrLen nStartIndex, nEndIndex, nPos;\n    BYTE nPropFont;\n    void SeekFwd( const xub_StrLen nPos );\n    inline void SetFnt( SwFont* pNew ) { pFnt = pNew; }\n    const void* aMagicNo[ SW_SCRIPTS ];\n    MSHORT aFntIdx[ SW_SCRIPTS ];\n\nprotected:\n    void Chg( SwTxtAttr *pHt );\n    void Rst( SwTxtAttr *pHt );\n#ifdef VERTICAL_LAYOUT\n    void CtorInit( SwTxtNode& rTxtNode, SwScriptInfo& rScrInf, SwTxtFrm* pFrm = 0 );\n#else\n    void CtorInit( SwTxtNode& rTxtNode, SwScriptInfo& rScrInf );\n#endif\n    inline SwAttrIter()\n        : pFnt(0), pLastOut(0), nChgCnt(0), nPropFont(0), pShell(0), pRedln(0){}\n\npublic:\n    \/\/ Konstruktor, Destruktor\n    inline SwAttrIter( SwTxtNode& rTxtNode, SwScriptInfo& rScrInf )\n        : pFnt(0), pLastOut(0), nChgCnt(0), nPropFont(0), pShell(0), pRedln(0)\n        { CtorInit( rTxtNode, rScrInf ); }\n\n    virtual ~SwAttrIter();\n\n    inline SwRedlineItr *GetRedln() { return pRedln; }\n    \/\/ Liefert im Parameter die Position des naechsten Wechsels vor oder an\n    \/\/ der uebergebenen Characterposition zurueck. Liefert sal_False, wenn vor\n    \/\/ oder an dieser Position kein Wechsel mehr erfolgt, sal_True sonst.\n    xub_StrLen GetNextAttr( ) const;\n    \/\/ Macht die an der Characterposition i gueltigen Attribute im\n    \/\/ logischen Font wirksam.\n    sal_Bool Seek( const xub_StrLen nPos );\n    \/\/ Bastelt den Font an der gew. Position via Seek und fragt ihn,\n    \/\/ ob er ein Symbolfont ist.\n    sal_Bool IsSymbol( const xub_StrLen nPos );\n\n    \/\/ Fuehrt ChgPhysFnt aus, wenn Seek() sal_True zurueckliefert.\n    sal_Bool SeekAndChg( const xub_StrLen nPos, OutputDevice* pOut );\n    sal_Bool SeekStartAndChg( OutputDevice* pOut, const sal_Bool bParaFont = sal_False );\n\n    \/\/ Gibt es ueberhaupt Attributwechsel ?\n    inline sal_Bool HasHints() const { return 0 != pHints; }\n\n    \/\/ liefert fuer eine Position das Attribut\n    SwTxtAttr *GetAttr( const xub_StrLen nPos ) const;\n\n    inline const SwAttrSet* GetAttrSet() const { return pAttrSet; }\n\n    inline const SwpHints *GetHints() const { return pHints; }\n\n    inline SwFont *GetFnt() { return pFnt; }\n    inline const SwFont *GetFnt() const { return pFnt; }\n\n    inline const BYTE GetPropFont() const { return nPropFont; }\n    inline void SetPropFont( const BYTE nNew ) { nPropFont = nNew; }\n\n    inline SwAttrHandler& GetAttrHandler() { return aAttrHandler; }\n\n#if OSL_DEBUG_LEVEL > 1\n    void Dump( SvStream &rOS ) const;\n#endif\n};\n\n#endif\n<commit_msg>INTEGRATION: CWS ooo19126 (1.16.600); FILE MERGED 2005\/09\/05 13:40:50 rt 1.16.600.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: itratr.hxx,v $\n *\n *  $Revision: 1.17 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 04:54: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 _ITRATR_HXX\n#define _ITRATR_HXX\n\n\n#ifndef _SOLAR_H\n#include <tools\/solar.h>\n#endif\n#ifndef _ATRHNDL_HXX\n#include <atrhndl.hxx>\n#endif\n\n#include \"txttypes.hxx\"\n#include \"swfont.hxx\"\n#include \"porlay.hxx\"\n\n#define _SVSTDARR_XUB_STRLEN\n#define _SVSTDARR_USHORTS\n#include <svtools\/svstdarr.hxx>\n\nclass OutputDevice;\nclass SwFont;\nclass SwpHints;\nclass SwTxtAttr;\nclass SwAttrSet;\nclass SwTxtNode;\nclass SwRedlineItr;\nclass ViewShell;\n\n#ifdef VERTICAL_LAYOUT\nclass SwTxtFrm;\n#endif\n\n\/*************************************************************************\n *                      class SwAttrIter\n *************************************************************************\/\n\nclass SwAttrIter\n{\n    friend class SwFontSave;\nprotected:\n\n    SwAttrHandler aAttrHandler;\n    ViewShell *pShell;\n    SwFont *pFnt;\n    SwpHints  *pHints;\n    const SwAttrSet* pAttrSet;       \/\/ das Char-Attribut-Set\n    SwScriptInfo* pScriptInfo;\n\nprivate:\n    OutputDevice *pLastOut;\n    MSHORT nChgCnt;\n    SwRedlineItr *pRedln;\n    xub_StrLen nStartIndex, nEndIndex, nPos;\n    BYTE nPropFont;\n    void SeekFwd( const xub_StrLen nPos );\n    inline void SetFnt( SwFont* pNew ) { pFnt = pNew; }\n    const void* aMagicNo[ SW_SCRIPTS ];\n    MSHORT aFntIdx[ SW_SCRIPTS ];\n\nprotected:\n    void Chg( SwTxtAttr *pHt );\n    void Rst( SwTxtAttr *pHt );\n#ifdef VERTICAL_LAYOUT\n    void CtorInit( SwTxtNode& rTxtNode, SwScriptInfo& rScrInf, SwTxtFrm* pFrm = 0 );\n#else\n    void CtorInit( SwTxtNode& rTxtNode, SwScriptInfo& rScrInf );\n#endif\n    inline SwAttrIter()\n        : pFnt(0), pLastOut(0), nChgCnt(0), nPropFont(0), pShell(0), pRedln(0){}\n\npublic:\n    \/\/ Konstruktor, Destruktor\n    inline SwAttrIter( SwTxtNode& rTxtNode, SwScriptInfo& rScrInf )\n        : pFnt(0), pLastOut(0), nChgCnt(0), nPropFont(0), pShell(0), pRedln(0)\n        { CtorInit( rTxtNode, rScrInf ); }\n\n    virtual ~SwAttrIter();\n\n    inline SwRedlineItr *GetRedln() { return pRedln; }\n    \/\/ Liefert im Parameter die Position des naechsten Wechsels vor oder an\n    \/\/ der uebergebenen Characterposition zurueck. Liefert sal_False, wenn vor\n    \/\/ oder an dieser Position kein Wechsel mehr erfolgt, sal_True sonst.\n    xub_StrLen GetNextAttr( ) const;\n    \/\/ Macht die an der Characterposition i gueltigen Attribute im\n    \/\/ logischen Font wirksam.\n    sal_Bool Seek( const xub_StrLen nPos );\n    \/\/ Bastelt den Font an der gew. Position via Seek und fragt ihn,\n    \/\/ ob er ein Symbolfont ist.\n    sal_Bool IsSymbol( const xub_StrLen nPos );\n\n    \/\/ Fuehrt ChgPhysFnt aus, wenn Seek() sal_True zurueckliefert.\n    sal_Bool SeekAndChg( const xub_StrLen nPos, OutputDevice* pOut );\n    sal_Bool SeekStartAndChg( OutputDevice* pOut, const sal_Bool bParaFont = sal_False );\n\n    \/\/ Gibt es ueberhaupt Attributwechsel ?\n    inline sal_Bool HasHints() const { return 0 != pHints; }\n\n    \/\/ liefert fuer eine Position das Attribut\n    SwTxtAttr *GetAttr( const xub_StrLen nPos ) const;\n\n    inline const SwAttrSet* GetAttrSet() const { return pAttrSet; }\n\n    inline const SwpHints *GetHints() const { return pHints; }\n\n    inline SwFont *GetFnt() { return pFnt; }\n    inline const SwFont *GetFnt() const { return pFnt; }\n\n    inline const BYTE GetPropFont() const { return nPropFont; }\n    inline void SetPropFont( const BYTE nNew ) { nPropFont = nNew; }\n\n    inline SwAttrHandler& GetAttrHandler() { return aAttrHandler; }\n\n#if OSL_DEBUG_LEVEL > 1\n    void Dump( SvStream &rOS ) const;\n#endif\n};\n\n#endif\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_SEARCH_IMPL_ORGANIZED_NEIGHBOR_SEARCH_H_\n#define PCL_SEARCH_IMPL_ORGANIZED_NEIGHBOR_SEARCH_H_\n\n#include \"pcl\/search\/organized2.h\"\n#include <pcl\/common\/eigen.h>\n#include \"pcl\/common\/time.h\"\n#include <eigen3\/Eigen\/Eigenvalues>\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT> int\npcl::search::OrganizedNeighbor<PointT>::radiusSearch (int                 index,\n                                                       const double        radius,\n                                                       std::vector<int>    &k_indices,\n                                                       std::vector<float>  &k_sqr_distances,\n                                                       unsigned int        max_nn) const\n{\n  const PointT& searchPoint = input_->points [index];\n  return (radiusSearch (searchPoint, radius, k_indices, k_sqr_distances, max_nn));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT> int\npcl::search::OrganizedNeighbor<PointT>::radiusSearch (const               PointT &p_q,\n                                                       const double        radius,\n                                                       std::vector<int>    &k_indices,\n                                                       std::vector<float>  &k_sqr_distances,\n                                                       unsigned int        max_nn) const\n{\n  if (projection_matrix_.coeffRef (0) == 0)\n  {\n    PCL_ERROR (\"[pcl::%s::radiusSearch] Invalid projection matrix. Probably input dataset was not organized!\\n\", getName ().c_str ());\n    return (0);\n  }\n\n  \/\/ NAN test\n  if (!pcl_isfinite (p_q.x) || !pcl_isfinite (p_q.y) || !pcl_isfinite (p_q.z))\n    return (0);\n\n  \/\/ search window\n  unsigned left, right, top, bottom;\n  \/\/unsigned x, y, idx;\n  float squared_distance, squared_radius;\n\n  k_indices.clear ();\n  k_sqr_distances.clear ();\n\n  squared_radius = radius * radius;\n\n  this->getProjectedRadiusSearchBox (p_q, squared_radius, left, right, top, bottom);\n\n  \/\/ iterate over search box\n  if (max_nn == 0 || max_nn >= (unsigned int)input_->points.size ())\n    max_nn = input_->points.size ();\n\n  k_indices.reserve (max_nn);\n  k_sqr_distances.reserve (max_nn);\n\n  unsigned yEnd  = (bottom + 1) * input_->width + right + 1;\n  register unsigned idx  = top * input_->width + left;\n  unsigned skip = input_->width - right + left - 1;\n  unsigned xEnd = idx - left + right + 1;\n\n  for (; xEnd != yEnd; idx += skip, xEnd += input_->width)\n  {\n    for (; idx < xEnd; ++idx)\n    {\n      squared_distance = (input_->points[idx].getVector3fMap () - p_q.getVector3fMap ()).squaredNorm ();\n      if (squared_distance <= squared_radius)\n      {\n        k_indices.push_back (idx);\n        k_sqr_distances.push_back (squared_distance);\n        \/\/ already done ?\n        if (k_indices.size () == max_nn)\n          return k_indices.size ();\n      }\n    }\n  }\n  return (k_indices.size ());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT> int\npcl::search::OrganizedNeighbor<PointT>::nearestKSearch (const pcl::PointCloud<PointT> &cloud,\n                                                        int                           index,\n                                                        int                           k,\n                                                        std::vector<int>              &k_indices,\n                                                        std::vector<float>            &k_sqr_distances) const\n{\n  return (nearestKSearch (index, k, k_indices, k_sqr_distances));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT> int\npcl::search::OrganizedNeighbor<PointT>::nearestKSearch (int index,\n                                                        int k,\n                                                        std::vector<int> &k_indices,\n                                                        std::vector<float> &k_distances) const\n{\n  PCL_ERROR (\"[pcl::search::OrganizedNeighbor::nearestKSearch] Method not implemented!\\n\");\n  return (0);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT> void\npcl::search::OrganizedNeighbor<PointT>::getProjectedRadiusSearchBox (const PointT& point,\n                                                                      float squared_radius,\n                                                                      unsigned &minX,\n                                                                      unsigned &maxX,\n                                                                      unsigned &minY,\n                                                                      unsigned &maxY) const\n{\n  Eigen::Vector3f q = KR_ * point.getVector3fMap () + projection_matrix_.block <3, 1> (0, 3);\n\n  float a = squared_radius * KR_KRT_.coeff (8) - q [2] * q [2];\n  float b = squared_radius * KR_KRT_.coeff (7) - q [1] * q [2];\n  float c = squared_radius * KR_KRT_.coeff (4) - q [1] * q [1];\n\n  \/\/ a and c are multiplied by two already => - 4ac -> - ac\n  float det = b * b - a * c;\n  if (det < 0)\n  {\n    minY = 0;\n    maxY = input_->height - 1;\n  }\n  else\n  {\n    minY = (unsigned) std::max (0, (int) floor ((b + sqrt (det)) \/ a));\n    maxY = (unsigned) std::min ((int) input_->height - 1, (int) ceil ((b - sqrt (det)) \/ a));\n  }\n\n  b = squared_radius * KR_KRT_.coeff (6) - q [0] * q [2];\n  c = squared_radius * KR_KRT_.coeff (0) - q [0] * q [0];\n\n  det = b * b - a * c;\n  if (det < 0)\n  {\n    minX = 0;\n    maxX = input_->width - 1;\n  }\n  else\n  {\n    minX = (unsigned) std::max (0, (int) floor ((b + sqrt (det)) \/ a));\n    maxX = (unsigned) std::min ((int)input_->width - 1, (int) ceil ((b - sqrt (det)) \/ a));\n  }\n  std::cout << \"window2: \" << minX << \" : \" << minY << \" - \" << maxX << \" : \" << maxY << std::endl;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT> template <typename MatrixType> void\npcl::search::OrganizedNeighbor<PointT>::makeSymmetric (MatrixType& matrix, bool use_upper_triangular) const\n{\n  if (use_upper_triangular)\n  {\n    matrix.coeffRef (4) = matrix.coeff (1);\n    matrix.coeffRef (8) = matrix.coeff (2);\n    matrix.coeffRef (9) = matrix.coeff (6);\n    matrix.coeffRef (12) = matrix.coeff (3);\n    matrix.coeffRef (13) = matrix.coeff (7);\n    matrix.coeffRef (14) = matrix.coeff (11);\n  }\n  else\n  {\n    matrix.coeffRef (1) = matrix.coeff (4);\n    matrix.coeffRef (2) = matrix.coeff (8);\n    matrix.coeffRef (6) = matrix.coeff (9);\n    matrix.coeffRef (3) = matrix.coeff (12);\n    matrix.coeffRef (7) = matrix.coeff (13);\n    matrix.coeffRef (11) = matrix.coeff (14);\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT> void\npcl::search::OrganizedNeighbor<PointT>::estimateProjectionMatrix ()\n{\n  \/\/ internally we calculate with double but store the result into float matrices.\n  typedef double Scalar;\n  projection_matrix_.setZero ();\n  if (input_->height == 1 || input_->width == 1)\n  {\n    PCL_ERROR (\"[pcl::%s::estimateProjectionMatrix] Input dataset is not organized!\\n\", getName ().c_str ());\n    return;\n  }\n\n  \/\/ we just want to use every 16th column and row -> skip = 2^4\n  const unsigned int skip = input_->width >> 4;\n  Eigen::Matrix<Scalar, 4, 4> A = Eigen::Matrix<Scalar, 4, 4>::Zero ();\n  Eigen::Matrix<Scalar, 4, 4> B = Eigen::Matrix<Scalar, 4, 4>::Zero ();\n  Eigen::Matrix<Scalar, 4, 4> C = Eigen::Matrix<Scalar, 4, 4>::Zero ();\n  Eigen::Matrix<Scalar, 4, 4> D = Eigen::Matrix<Scalar, 4, 4>::Zero ();\n\n  for (unsigned yIdx = 0, idx = 0; yIdx < input_->height; yIdx += skip, idx += input_->width * (skip-1))\n  {\n    for (unsigned xIdx = 0; xIdx < input_->width; xIdx += skip, idx += skip)\n    {\n      const PointT& point = input_->points[idx];\n      if (isFinite (point))\n      {\n        Scalar xx = point.x * point.x;\n        Scalar xy = point.x * point.y;\n        Scalar xz = point.x * point.z;\n        Scalar yy = point.y * point.y;\n        Scalar yz = point.y * point.z;\n        Scalar zz = point.z * point.z;\n        Scalar xx_yy = xIdx * xIdx + yIdx * yIdx;\n\n        A.coeffRef (0) += xx;\n        A.coeffRef (1) += xy;\n        A.coeffRef (2) += xz;\n        A.coeffRef (3) += point.x;\n\n        A.coeffRef (5) += yy;\n        A.coeffRef (6) += yz;\n        A.coeffRef (7) += point.y;\n\n        A.coeffRef (10) += zz;\n        A.coeffRef (11) += point.z;\n        A.coeffRef (15) += 1.0;\n\n        B.coeffRef (0) -= xx * xIdx;\n        B.coeffRef (1) -= xy * xIdx;\n        B.coeffRef (2) -= xz * xIdx;\n        B.coeffRef (3) -= point.x * xIdx;\n\n        B.coeffRef (5) -= yy * xIdx;\n        B.coeffRef (6) -= yz * xIdx;\n        B.coeffRef (7) -= point.y * xIdx;\n\n        B.coeffRef (10) -= zz * xIdx;\n        B.coeffRef (11) -= point.z * xIdx;\n\n        B.coeffRef (15) -= xIdx;\n\n        C.coeffRef (0) -= xx * yIdx;\n        C.coeffRef (1) -= xy * yIdx;\n        C.coeffRef (2) -= xz * yIdx;\n        C.coeffRef (3) -= point.x * yIdx;\n\n        C.coeffRef (5) -= yy * yIdx;\n        C.coeffRef (6) -= yz * yIdx;\n        C.coeffRef (7) -= point.y * yIdx;\n\n        C.coeffRef (10) -= zz * yIdx;\n        C.coeffRef (11) -= point.z * yIdx;\n\n        C.coeffRef (15) -= yIdx;\n\n        D.coeffRef (0) += xx * xx_yy;\n        D.coeffRef (1) += xy * xx_yy;\n        D.coeffRef (2) += xz * xx_yy;\n        D.coeffRef (3) += point.x * xx_yy;\n\n        D.coeffRef (5) += yy * xx_yy;\n        D.coeffRef (6) += yz * xx_yy;\n        D.coeffRef (7) += point.y * xx_yy;\n\n        D.coeffRef (10) += zz * xx_yy;\n        D.coeffRef (11) += point.z * xx_yy;\n\n        D.coeffRef (15) += xx_yy;\n      }\n    }\n  }\n\n  makeSymmetric(A);\n  makeSymmetric(B);\n  makeSymmetric(C);\n  makeSymmetric(D);\n\n  Eigen::Matrix<Scalar, 12, 12> X = Eigen::Matrix<Scalar, 12, 12>::Zero ();\n  X.topLeftCorner<4,4> () = A;\n  X.block<4,4> (0, 8) = B;\n  X.block<4,4> (8, 0) = B;\n  X.block<4,4> (4, 4) = A;\n  X.block<4,4> (4, 8) = C;\n  X.block<4,4> (8, 4) = C;\n  X.block<4,4> (8, 8) = D;\n\n  Eigen::SelfAdjointEigenSolver<Eigen::Matrix<Scalar, 12, 12> > ei_symm(X);\n  Eigen::Matrix<Scalar, 12, 12> eigen_vectors = ei_symm.eigenvectors();\n\n  \/\/ check whether the residual MSE is low. If its high, the cloud was not captured from a projective device.\n  Eigen::Matrix<Scalar, 1, 1> residual_sqr = eigen_vectors.col (0).transpose () * X *  eigen_vectors.col (0);\n  if ( residual_sqr.coeff (0) > eps_ * A.coeff (15))\n  {\n    PCL_ERROR (\"[pcl::%s::radiusSearch] Input dataset is not from a projective device!\\n\", getName ().c_str ());\n    return;\n  }\n\n  projection_matrix_.coeffRef (0) = eigen_vectors.coeff (0);\n  projection_matrix_.coeffRef (1) = eigen_vectors.coeff (12);\n  projection_matrix_.coeffRef (2) = eigen_vectors.coeff (24);\n  projection_matrix_.coeffRef (3) = eigen_vectors.coeff (36);\n  projection_matrix_.coeffRef (4) = eigen_vectors.coeff (48);\n  projection_matrix_.coeffRef (5) = eigen_vectors.coeff (60);\n  projection_matrix_.coeffRef (6) = eigen_vectors.coeff (72);\n  projection_matrix_.coeffRef (7) = eigen_vectors.coeff (84);\n  projection_matrix_.coeffRef (8) = eigen_vectors.coeff (96);\n  projection_matrix_.coeffRef (9) = eigen_vectors.coeff (108);\n  projection_matrix_.coeffRef (10) = eigen_vectors.coeff (120);\n  projection_matrix_.coeffRef (11) = eigen_vectors.coeff (132);\n\n  if (projection_matrix_.coeff (0) < 0)\n    projection_matrix_ *= -1.0;\n\n  \/\/ get left 3x3 sub matrix, which contains K * R, with K = camera matrix = [[fx s cx] [0 fy cy] [0 0 1]]\n  \/\/ and R being the rotation matrix\n  KR_ = projection_matrix_.topLeftCorner <3, 3> ();\n\n  \/\/ precalculate KR * KR^T needed by calculations during nn-search\n  KR_KRT_ = KR_ * KR_.transpose ();\n}\n\n#define PCL_INSTANTIATE_OrganizedNeighbor(T) template class PCL_EXPORTS pcl::search::OrganizedNeighbor<T>;\n\n#endif\n<commit_msg>changed wrong include<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_SEARCH_IMPL_ORGANIZED_NEIGHBOR_SEARCH_H_\n#define PCL_SEARCH_IMPL_ORGANIZED_NEIGHBOR_SEARCH_H_\n\n#include \"pcl\/search\/organized.h\"\n#include <pcl\/common\/eigen.h>\n#include \"pcl\/common\/time.h\"\n#include <eigen3\/Eigen\/Eigenvalues>\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT> int\npcl::search::OrganizedNeighbor<PointT>::radiusSearch (int                 index,\n                                                       const double        radius,\n                                                       std::vector<int>    &k_indices,\n                                                       std::vector<float>  &k_sqr_distances,\n                                                       unsigned int        max_nn) const\n{\n  const PointT& searchPoint = input_->points [index];\n  return (radiusSearch (searchPoint, radius, k_indices, k_sqr_distances, max_nn));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT> int\npcl::search::OrganizedNeighbor<PointT>::radiusSearch (const               PointT &p_q,\n                                                       const double        radius,\n                                                       std::vector<int>    &k_indices,\n                                                       std::vector<float>  &k_sqr_distances,\n                                                       unsigned int        max_nn) const\n{\n  if (projection_matrix_.coeffRef (0) == 0)\n  {\n    PCL_ERROR (\"[pcl::%s::radiusSearch] Invalid projection matrix. Probably input dataset was not organized!\\n\", getName ().c_str ());\n    return (0);\n  }\n\n  \/\/ NAN test\n  if (!pcl_isfinite (p_q.x) || !pcl_isfinite (p_q.y) || !pcl_isfinite (p_q.z))\n    return (0);\n\n  \/\/ search window\n  unsigned left, right, top, bottom;\n  \/\/unsigned x, y, idx;\n  float squared_distance, squared_radius;\n\n  k_indices.clear ();\n  k_sqr_distances.clear ();\n\n  squared_radius = radius * radius;\n\n  this->getProjectedRadiusSearchBox (p_q, squared_radius, left, right, top, bottom);\n\n  \/\/ iterate over search box\n  if (max_nn == 0 || max_nn >= (unsigned int)input_->points.size ())\n    max_nn = input_->points.size ();\n\n  k_indices.reserve (max_nn);\n  k_sqr_distances.reserve (max_nn);\n\n  unsigned yEnd  = (bottom + 1) * input_->width + right + 1;\n  register unsigned idx  = top * input_->width + left;\n  unsigned skip = input_->width - right + left - 1;\n  unsigned xEnd = idx - left + right + 1;\n\n  for (; xEnd != yEnd; idx += skip, xEnd += input_->width)\n  {\n    for (; idx < xEnd; ++idx)\n    {\n      squared_distance = (input_->points[idx].getVector3fMap () - p_q.getVector3fMap ()).squaredNorm ();\n      if (squared_distance <= squared_radius)\n      {\n        k_indices.push_back (idx);\n        k_sqr_distances.push_back (squared_distance);\n        \/\/ already done ?\n        if (k_indices.size () == max_nn)\n          return max_nn;\n      }\n    }\n  }\n  return (k_indices.size ());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT> int\npcl::search::OrganizedNeighbor<PointT>::nearestKSearch (const pcl::PointCloud<PointT> &cloud,\n                                                        int                           index,\n                                                        int                           k,\n                                                        std::vector<int>              &k_indices,\n                                                        std::vector<float>            &k_sqr_distances) const\n{\n  return (nearestKSearch (index, k, k_indices, k_sqr_distances));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT> int\npcl::search::OrganizedNeighbor<PointT>::nearestKSearch (int index,\n                                                        int k,\n                                                        std::vector<int> &k_indices,\n                                                        std::vector<float> &k_distances) const\n{\n  PCL_ERROR (\"[pcl::search::OrganizedNeighbor::nearestKSearch] Method not implemented!\\n\");\n  return (0);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT> void\npcl::search::OrganizedNeighbor<PointT>::getProjectedRadiusSearchBox (const PointT& point,\n                                                                      float squared_radius,\n                                                                      unsigned &minX,\n                                                                      unsigned &maxX,\n                                                                      unsigned &minY,\n                                                                      unsigned &maxY) const\n{\n  Eigen::Vector3f q = KR_ * point.getVector3fMap () + projection_matrix_.block <3, 1> (0, 3);\n\n  float a = squared_radius * KR_KRT_.coeff (8) - q [2] * q [2];\n  float b = squared_radius * KR_KRT_.coeff (7) - q [1] * q [2];\n  float c = squared_radius * KR_KRT_.coeff (4) - q [1] * q [1];\n\n  \/\/ a and c are multiplied by two already => - 4ac -> - ac\n  float det = b * b - a * c;\n  if (det < 0)\n  {\n    minY = 0;\n    maxY = input_->height - 1;\n  }\n  else\n  {\n    minY = (unsigned) std::max (0, (int) floor ((b + sqrt (det)) \/ a));\n    maxY = (unsigned) std::min ((int) input_->height - 1, (int) ceil ((b - sqrt (det)) \/ a));\n  }\n\n  b = squared_radius * KR_KRT_.coeff (6) - q [0] * q [2];\n  c = squared_radius * KR_KRT_.coeff (0) - q [0] * q [0];\n\n  det = b * b - a * c;\n  if (det < 0)\n  {\n    minX = 0;\n    maxX = input_->width - 1;\n  }\n  else\n  {\n    minX = (unsigned) std::max (0, (int) floor ((b + sqrt (det)) \/ a));\n    maxX = (unsigned) std::min ((int)input_->width - 1, (int) ceil ((b - sqrt (det)) \/ a));\n  }\n  std::cout << \"window2: \" << minX << \" : \" << minY << \" - \" << maxX << \" : \" << maxY << std::endl;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT> template <typename MatrixType> void\npcl::search::OrganizedNeighbor<PointT>::makeSymmetric (MatrixType& matrix, bool use_upper_triangular) const\n{\n  if (use_upper_triangular)\n  {\n    matrix.coeffRef (4) = matrix.coeff (1);\n    matrix.coeffRef (8) = matrix.coeff (2);\n    matrix.coeffRef (9) = matrix.coeff (6);\n    matrix.coeffRef (12) = matrix.coeff (3);\n    matrix.coeffRef (13) = matrix.coeff (7);\n    matrix.coeffRef (14) = matrix.coeff (11);\n  }\n  else\n  {\n    matrix.coeffRef (1) = matrix.coeff (4);\n    matrix.coeffRef (2) = matrix.coeff (8);\n    matrix.coeffRef (6) = matrix.coeff (9);\n    matrix.coeffRef (3) = matrix.coeff (12);\n    matrix.coeffRef (7) = matrix.coeff (13);\n    matrix.coeffRef (11) = matrix.coeff (14);\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT> void\npcl::search::OrganizedNeighbor<PointT>::estimateProjectionMatrix ()\n{\n  \/\/ internally we calculate with double but store the result into float matrices.\n  typedef double Scalar;\n  projection_matrix_.setZero ();\n  if (input_->height == 1 || input_->width == 1)\n  {\n    PCL_ERROR (\"[pcl::%s::estimateProjectionMatrix] Input dataset is not organized!\\n\", getName ().c_str ());\n    return;\n  }\n\n  \/\/ we just want to use every 16th column and row -> skip = 2^4\n  const unsigned int skip = input_->width >> 4;\n  Eigen::Matrix<Scalar, 4, 4> A = Eigen::Matrix<Scalar, 4, 4>::Zero ();\n  Eigen::Matrix<Scalar, 4, 4> B = Eigen::Matrix<Scalar, 4, 4>::Zero ();\n  Eigen::Matrix<Scalar, 4, 4> C = Eigen::Matrix<Scalar, 4, 4>::Zero ();\n  Eigen::Matrix<Scalar, 4, 4> D = Eigen::Matrix<Scalar, 4, 4>::Zero ();\n\n  for (unsigned yIdx = 0, idx = 0; yIdx < input_->height; yIdx += skip, idx += input_->width * (skip-1))\n  {\n    for (unsigned xIdx = 0; xIdx < input_->width; xIdx += skip, idx += skip)\n    {\n      const PointT& point = input_->points[idx];\n      if (isFinite (point))\n      {\n        Scalar xx = point.x * point.x;\n        Scalar xy = point.x * point.y;\n        Scalar xz = point.x * point.z;\n        Scalar yy = point.y * point.y;\n        Scalar yz = point.y * point.z;\n        Scalar zz = point.z * point.z;\n        Scalar xx_yy = xIdx * xIdx + yIdx * yIdx;\n\n        A.coeffRef (0) += xx;\n        A.coeffRef (1) += xy;\n        A.coeffRef (2) += xz;\n        A.coeffRef (3) += point.x;\n\n        A.coeffRef (5) += yy;\n        A.coeffRef (6) += yz;\n        A.coeffRef (7) += point.y;\n\n        A.coeffRef (10) += zz;\n        A.coeffRef (11) += point.z;\n        A.coeffRef (15) += 1.0;\n\n        B.coeffRef (0) -= xx * xIdx;\n        B.coeffRef (1) -= xy * xIdx;\n        B.coeffRef (2) -= xz * xIdx;\n        B.coeffRef (3) -= point.x * xIdx;\n\n        B.coeffRef (5) -= yy * xIdx;\n        B.coeffRef (6) -= yz * xIdx;\n        B.coeffRef (7) -= point.y * xIdx;\n\n        B.coeffRef (10) -= zz * xIdx;\n        B.coeffRef (11) -= point.z * xIdx;\n\n        B.coeffRef (15) -= xIdx;\n\n        C.coeffRef (0) -= xx * yIdx;\n        C.coeffRef (1) -= xy * yIdx;\n        C.coeffRef (2) -= xz * yIdx;\n        C.coeffRef (3) -= point.x * yIdx;\n\n        C.coeffRef (5) -= yy * yIdx;\n        C.coeffRef (6) -= yz * yIdx;\n        C.coeffRef (7) -= point.y * yIdx;\n\n        C.coeffRef (10) -= zz * yIdx;\n        C.coeffRef (11) -= point.z * yIdx;\n\n        C.coeffRef (15) -= yIdx;\n\n        D.coeffRef (0) += xx * xx_yy;\n        D.coeffRef (1) += xy * xx_yy;\n        D.coeffRef (2) += xz * xx_yy;\n        D.coeffRef (3) += point.x * xx_yy;\n\n        D.coeffRef (5) += yy * xx_yy;\n        D.coeffRef (6) += yz * xx_yy;\n        D.coeffRef (7) += point.y * xx_yy;\n\n        D.coeffRef (10) += zz * xx_yy;\n        D.coeffRef (11) += point.z * xx_yy;\n\n        D.coeffRef (15) += xx_yy;\n      }\n    }\n  }\n\n  makeSymmetric(A);\n  makeSymmetric(B);\n  makeSymmetric(C);\n  makeSymmetric(D);\n\n  Eigen::Matrix<Scalar, 12, 12> X = Eigen::Matrix<Scalar, 12, 12>::Zero ();\n  X.topLeftCorner<4,4> () = A;\n  X.block<4,4> (0, 8) = B;\n  X.block<4,4> (8, 0) = B;\n  X.block<4,4> (4, 4) = A;\n  X.block<4,4> (4, 8) = C;\n  X.block<4,4> (8, 4) = C;\n  X.block<4,4> (8, 8) = D;\n\n  Eigen::SelfAdjointEigenSolver<Eigen::Matrix<Scalar, 12, 12> > ei_symm(X);\n  Eigen::Matrix<Scalar, 12, 12> eigen_vectors = ei_symm.eigenvectors();\n\n  \/\/ check whether the residual MSE is low. If its high, the cloud was not captured from a projective device.\n  Eigen::Matrix<Scalar, 1, 1> residual_sqr = eigen_vectors.col (0).transpose () * X *  eigen_vectors.col (0);\n  if ( residual_sqr.coeff (0) > eps_ * A.coeff (15))\n  {\n    PCL_ERROR (\"[pcl::%s::radiusSearch] Input dataset is not from a projective device!\\n\", getName ().c_str ());\n    return;\n  }\n\n  projection_matrix_.coeffRef (0) = eigen_vectors.coeff (0);\n  projection_matrix_.coeffRef (1) = eigen_vectors.coeff (12);\n  projection_matrix_.coeffRef (2) = eigen_vectors.coeff (24);\n  projection_matrix_.coeffRef (3) = eigen_vectors.coeff (36);\n  projection_matrix_.coeffRef (4) = eigen_vectors.coeff (48);\n  projection_matrix_.coeffRef (5) = eigen_vectors.coeff (60);\n  projection_matrix_.coeffRef (6) = eigen_vectors.coeff (72);\n  projection_matrix_.coeffRef (7) = eigen_vectors.coeff (84);\n  projection_matrix_.coeffRef (8) = eigen_vectors.coeff (96);\n  projection_matrix_.coeffRef (9) = eigen_vectors.coeff (108);\n  projection_matrix_.coeffRef (10) = eigen_vectors.coeff (120);\n  projection_matrix_.coeffRef (11) = eigen_vectors.coeff (132);\n\n  if (projection_matrix_.coeff (0) < 0)\n    projection_matrix_ *= -1.0;\n\n  \/\/ get left 3x3 sub matrix, which contains K * R, with K = camera matrix = [[fx s cx] [0 fy cy] [0 0 1]]\n  \/\/ and R being the rotation matrix\n  KR_ = projection_matrix_.topLeftCorner <3, 3> ();\n\n  \/\/ precalculate KR * KR^T needed by calculations during nn-search\n  KR_KRT_ = KR_ * KR_.transpose ();\n}\n\n#define PCL_INSTANTIATE_OrganizedNeighbor(T) template class PCL_EXPORTS pcl::search::OrganizedNeighbor<T>;\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n * Copyright (c) 2010 Kohei Yoshida\n * \n * Permission is hereby granted, free of charge, to any person\n * obtaining a copy of this software and associated documentation\n * files (the \"Software\"), to deal in the Software without\n * restriction, including without limitation the rights to use,\n * copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following\n * conditions:\n * \n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n * \n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\n * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\n * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\n * OTHER DEALINGS IN THE SOFTWARE.\n *\n ************************************************************************\/\n\n#include <vector>\n#include <unordered_set>\n#include <set>\n#include <list>\n\n#include <stdio.h>\n#include <string>\n#include <sys\/time.h>\n\nusing namespace std;\n\nnamespace {\n\nclass StackPrinter\n{\npublic:\n    explicit StackPrinter(const char* msg) :\n        msMsg(msg)\n    {\n        fprintf(stdout, \"%s: --begin\\n\", msMsg.c_str());\n        mfStartTime = getTime();\n    }\n\n    ~StackPrinter()\n    {\n        double fEndTime = getTime();\n        fprintf(stdout, \"%s: --end (duration: %g sec)\\n\", msMsg.c_str(), (fEndTime-mfStartTime));\n    }\n\n    void printTime(int line) const\n    {\n        double fEndTime = getTime();\n        fprintf(stdout, \"%s: --(%d) (duration: %g sec)\\n\", msMsg.c_str(), line, (fEndTime-mfStartTime));\n    }\n\nprivate:\n    double getTime() const\n    {\n        timeval tv;\n        gettimeofday(&tv, NULL);\n        return tv.tv_sec + tv.tv_usec \/ 1000000.0;\n    }\n\n    ::std::string msMsg;\n    double mfStartTime;\n};\n\n}\n\nint main()\n{\n    size_t store_size = 50000000;\n    {\n        StackPrinter __stack_printer__(\"vector non-reserved\");\n        string* ptr = 0x000000000;\n        vector<void*> store;\n        for (size_t i = 0; i < store_size; ++i)\n            store.push_back(ptr++);\n    }\n\n    {\n        StackPrinter __stack_printer__(\"vector reserved\");\n        string* ptr = 0x000000000;\n        vector<void*> store;\n        store.reserve(store_size);\n        for (size_t i = 0; i < store_size; ++i)\n            store.push_back(ptr++);\n    }\n\n    {\n        StackPrinter __stack_printer__(\"list\");\n        string* ptr = 0x000000000;\n        list<void*> store;\n        for (size_t i = 0; i < store_size; ++i)\n            store.push_back(ptr++);\n    }\n\n    {\n        StackPrinter __stack_printer__(\"set\");\n        string* ptr = 0x000000000;\n        set<void*> store;   \n        for (size_t i = 0; i < store_size; ++i)\n            store.insert(ptr++);\n    }\n\n    {\n        StackPrinter __stack_printer__(\"unordered set\");\n        string* ptr = 0x000000000;\n        unordered_set<void*> store;\n        for (size_t i = 0; i < store_size; ++i)\n            store.insert(ptr++);\n    }\n}\n<commit_msg>Remove excess '0' from the initial pointer values.<commit_after>\/*************************************************************************\n *\n * Copyright (c) 2010 Kohei Yoshida\n * \n * Permission is hereby granted, free of charge, to any person\n * obtaining a copy of this software and associated documentation\n * files (the \"Software\"), to deal in the Software without\n * restriction, including without limitation the rights to use,\n * copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following\n * conditions:\n * \n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n * \n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\n * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\n * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\n * OTHER DEALINGS IN THE SOFTWARE.\n *\n ************************************************************************\/\n\n#include <vector>\n#include <unordered_set>\n#include <set>\n#include <list>\n\n#include <stdio.h>\n#include <string>\n#include <sys\/time.h>\n\nusing namespace std;\n\nnamespace {\n\nclass StackPrinter\n{\npublic:\n    explicit StackPrinter(const char* msg) :\n        msMsg(msg)\n    {\n        fprintf(stdout, \"%s: --begin\\n\", msMsg.c_str());\n        mfStartTime = getTime();\n    }\n\n    ~StackPrinter()\n    {\n        double fEndTime = getTime();\n        fprintf(stdout, \"%s: --end (duration: %g sec)\\n\", msMsg.c_str(), (fEndTime-mfStartTime));\n    }\n\n    void printTime(int line) const\n    {\n        double fEndTime = getTime();\n        fprintf(stdout, \"%s: --(%d) (duration: %g sec)\\n\", msMsg.c_str(), line, (fEndTime-mfStartTime));\n    }\n\nprivate:\n    double getTime() const\n    {\n        timeval tv;\n        gettimeofday(&tv, NULL);\n        return tv.tv_sec + tv.tv_usec \/ 1000000.0;\n    }\n\n    ::std::string msMsg;\n    double mfStartTime;\n};\n\n}\n\nint main()\n{\n    size_t store_size = 50000000;\n    {\n        StackPrinter __stack_printer__(\"vector non-reserved\");\n        string* ptr = 0x00000000;\n        vector<void*> store;\n        for (size_t i = 0; i < store_size; ++i)\n            store.push_back(ptr++);\n    }\n\n    {\n        StackPrinter __stack_printer__(\"vector reserved\");\n        string* ptr = 0x00000000;\n        vector<void*> store;\n        store.reserve(store_size);\n        for (size_t i = 0; i < store_size; ++i)\n            store.push_back(ptr++);\n    }\n\n    {\n        StackPrinter __stack_printer__(\"list\");\n        string* ptr = 0x00000000;\n        list<void*> store;\n        for (size_t i = 0; i < store_size; ++i)\n            store.push_back(ptr++);\n    }\n\n    {\n        StackPrinter __stack_printer__(\"set\");\n        string* ptr = 0x00000000;\n        set<void*> store;   \n        for (size_t i = 0; i < store_size; ++i)\n            store.insert(ptr++);\n    }\n\n    {\n        StackPrinter __stack_printer__(\"unordered set\");\n        string* ptr = 0x00000000;\n        unordered_set<void*> store;\n        for (size_t i = 0; i < store_size; ++i)\n            store.insert(ptr++);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: fldfunc.hxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: jp $ $Date: 2001-01-18 14:01: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 _SWFLDFUNC_HXX\n#define _SWFLDFUNC_HXX\n\n#ifndef _SFXTABDLG_HXX \/\/autogen\n#include <sfx2\/tabdlg.hxx>\n#endif\n#ifndef _SV_FIXED_HXX \/\/autogen\n#include <vcl\/fixed.hxx>\n#endif\n#ifndef _SV_LSTBOX_HXX \/\/autogen\n#include <vcl\/lstbox.hxx>\n#endif\n#ifndef _SV_BUTTON_HXX \/\/autogen\n#include <vcl\/button.hxx>\n#endif\n#ifndef _SV_GROUP_HXX \/\/autogen\n#include <vcl\/group.hxx>\n#endif\n#ifndef _SV_EDIT_HXX \/\/autogen\n#include <vcl\/edit.hxx>\n#endif\n\n#include \"condedit.hxx\"\n#include \"fldpage.hxx\"\n\n\/*--------------------------------------------------------------------\n   Beschreibung:\n --------------------------------------------------------------------*\/\n\nclass SwFldFuncPage : public SwFldPage\n{\n    FixedText       aTypeFT;\n    ListBox         aTypeLB;\n    FixedText       aSelectionFT;\n    ListBox         aSelectionLB;\n    FixedText       aFormatFT;\n    ListBox         aFormatLB;\n    FixedText       aNameFT;\n    ConditionEdit   aNameED;\n    FixedText       aValueFT;\n    Edit            aValueED;\n    FixedText       aCond1FT;\n    ConditionEdit   aCond1ED;\n    FixedText       aCond2FT;\n    ConditionEdit   aCond2ED;\n    PushButton      aMacroBT;\n\n    String          sOldValueFT;\n    String          sOldNameFT;\n\n    ULONG           nOldFormat;\n\n    DECL_LINK( TypeHdl, ListBox* pLB = 0 );\n    DECL_LINK( SelectHdl, ListBox* pLB = 0 );\n    DECL_LINK( InsertMacroHdl, ListBox* pLB = 0 );\n    DECL_LINK( ModifyHdl, Edit *pEd = 0 );\n\n    \/\/ Macro auswhlen\n    DECL_LINK( MacroHdl, Button * );\n\n    void                UpdateSubType();\n    String              TurnMacroString(const String &rMacro);\n\nprotected:\n    virtual USHORT      GetGroup();\n\npublic:\n                        SwFldFuncPage(Window* pParent, const SfxItemSet& rSet);\n\n                        ~SwFldFuncPage();\n\n    static SfxTabPage*  Create(Window* pParent, const SfxItemSet& rAttrSet);\n\n    virtual BOOL        FillItemSet( SfxItemSet& rSet );\n    virtual void        Reset( const SfxItemSet& rSet );\n\n    virtual void        FillUserData();\n};\n\n\n#endif\n\n<commit_msg>INTEGRATION: CWS aig04 (1.2.254); FILE MERGED 2003\/06\/26 07:29:12 os 1.2.254.2: #108791# List item edit field inserts on RETURN key 2003\/06\/18 14:51:23 os 1.2.254.1: #108791# UI for drop down fields implemented<commit_after>\/*************************************************************************\n *\n *  $RCSfile: fldfunc.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: hr $ $Date: 2003-06-30 15:55:50 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef _SWFLDFUNC_HXX\n#define _SWFLDFUNC_HXX\n\n#ifndef _SFXTABDLG_HXX \/\/autogen\n#include <sfx2\/tabdlg.hxx>\n#endif\n#ifndef _SV_FIXED_HXX \/\/autogen\n#include <vcl\/fixed.hxx>\n#endif\n#ifndef _SV_LSTBOX_HXX \/\/autogen\n#include <vcl\/lstbox.hxx>\n#endif\n#ifndef _SV_BUTTON_HXX \/\/autogen\n#include <vcl\/button.hxx>\n#endif\n#ifndef _SV_GROUP_HXX \/\/autogen\n#include <vcl\/group.hxx>\n#endif\n#ifndef _SV_EDIT_HXX \/\/autogen\n#include <vcl\/edit.hxx>\n#endif\n\n#include \"condedit.hxx\"\n#include \"fldpage.hxx\"\n#ifndef _ACTCTRL_HXX\n#include <actctrl.hxx>\n#endif\n\/*--------------------------------------------------------------------\n   Beschreibung:\n --------------------------------------------------------------------*\/\n\nclass SwFldFuncPage : public SwFldPage\n{\n    FixedText       aTypeFT;\n    ListBox         aTypeLB;\n    FixedText       aSelectionFT;\n    ListBox         aSelectionLB;\n    FixedText       aFormatFT;\n    ListBox         aFormatLB;\n    FixedText       aNameFT;\n    ConditionEdit   aNameED;\n    FixedText       aValueFT;\n    Edit            aValueED;\n    FixedText       aCond1FT;\n    ConditionEdit   aCond1ED;\n    FixedText       aCond2FT;\n    ConditionEdit   aCond2ED;\n    PushButton      aMacroBT;\n\n    \/\/controls of \"Input list\"\n    FixedText       aListItemFT;\n    ReturnActionEdit aListItemED;\n    PushButton      aListAddPB;\n    FixedText       aListItemsFT;\n    ListBox         aListItemsLB;\n    PushButton      aListRemovePB;\n    PushButton      aListUpPB;\n    PushButton      aListDownPB;\n    FixedText       aListNameFT;\n    Edit            aListNameED;\n\n    String          sOldValueFT;\n    String          sOldNameFT;\n\n    ULONG           nOldFormat;\n    bool            bDropDownLBChanged;\n\n    DECL_LINK( TypeHdl, ListBox* pLB = 0 );\n    DECL_LINK( SelectHdl, ListBox* pLB = 0 );\n    DECL_LINK( InsertMacroHdl, ListBox* pLB = 0 );\n    DECL_LINK( ModifyHdl, Edit *pEd = 0 );\n    DECL_LINK( ListModifyHdl, Control*);\n    DECL_LINK( ListEnableHdl, void*);\n\n    \/\/ Macro auswhlen\n    DECL_LINK( MacroHdl, Button * );\n\n    void                UpdateSubType();\n    String              TurnMacroString(const String &rMacro);\n\nprotected:\n    virtual USHORT      GetGroup();\n\npublic:\n                        SwFldFuncPage(Window* pParent, const SfxItemSet& rSet);\n\n                        ~SwFldFuncPage();\n\n    static SfxTabPage*  Create(Window* pParent, const SfxItemSet& rAttrSet);\n\n    virtual BOOL        FillItemSet( SfxItemSet& rSet );\n    virtual void        Reset( const SfxItemSet& rSet );\n\n    virtual void        FillUserData();\n};\n\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: colmgr.cxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: hr $ $Date: 2007-09-27 11:51: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sw.hxx\"\n\n\n\n#include \"hintids.hxx\"\n\n#ifndef _SVX_LRSPITEM_HXX \/\/autogen\n#include <svx\/lrspitem.hxx>\n#endif\n\n#include \"frmmgr.hxx\"\n#include \"frmfmt.hxx\"\n#include \"colmgr.hxx\"\n\n\n\/\/ PRIVATE METHODES ------------------------------------------------------\n\/*------------------------------------------------------------------------\n Beschreibung:  Spaltenbreite auf aktuelle Breite einstellen\n------------------------------------------------------------------------*\/\n\n\n\nvoid FitToActualSize(SwFmtCol& rCol, USHORT nWidth)\n{\n    const USHORT nCount = rCol.GetColumns().Count();\n    for(USHORT i = 0; i < nCount; ++i)\n    {\n        const USHORT nTmp = rCol.CalcColWidth(i, nWidth);\n        rCol.GetColumns()[i]->SetWishWidth(nTmp);\n    }\n    rCol.SetWishWidth(nWidth);\n}\n\n\n\/\/ PUBLIC METHODES -------------------------------------------------------\n\/*------------------------------------------------------------------------\n Beschreibung:  Setzen Spaltenanzahl und Gutterwidth\n------------------------------------------------------------------------*\/\n\n\n\nvoid SwColMgr::SetCount(USHORT nCount, USHORT  nGutterWidth)\n{\n    aFmtCol.Init(nCount, nGutterWidth, nWidth);\n    aFmtCol.SetWishWidth(nWidth);\n    aFmtCol.SetGutterWidth(nGutterWidth, nWidth);\n}\n\n\n\nUSHORT SwColMgr::GetGutterWidth( USHORT nPos ) const\n{\n    USHORT nRet;\n    if(nPos == USHRT_MAX )\n        nRet = GetCount() > 1 ? aFmtCol.GetGutterWidth() : DEF_GUTTER_WIDTH;\n    else\n    {\n        DBG_ASSERT(nPos < GetCount() - 1, \"Spalte ueberindiziert\" )\n        const SwColumns& rCols = aFmtCol.GetColumns();\n        nRet = rCols.GetObject(nPos)->GetRight() + rCols.GetObject(nPos + 1)->GetLeft();\n    }\n    return nRet;\n}\n\n\/*-----------------22.10.96 14.28-------------------\n\n--------------------------------------------------*\/\n\n\nvoid SwColMgr::SetGutterWidth(USHORT nGutterWidth, USHORT nPos )\n{\n    if(nPos == USHRT_MAX)\n        aFmtCol.SetGutterWidth(nGutterWidth, nWidth);\n    else\n    {\n        DBG_ASSERT(nPos < GetCount() - 1, \"Spalte ueberindiziert\" )\n        SwColumns& rCols = aFmtCol.GetColumns();\n        USHORT nGutterWidth2 = nGutterWidth \/ 2;\n        rCols.GetObject(nPos)->SetRight(nGutterWidth2);\n        rCols.GetObject(nPos + 1)->SetLeft(nGutterWidth2);\n    }\n}\n\n\/*------------------------------------------------------------------------\n Beschreibung:  Hoehe Trennlinie\n------------------------------------------------------------------------*\/\n\n\n\nshort SwColMgr::GetLineHeightPercent() const\n{\n    return (short)aFmtCol.GetLineHeight();\n}\n\n\n\nvoid SwColMgr::SetLineHeightPercent(short nPercent)\n{\n    ASSERT(nPercent <= 100, LineHeight darf nur bis 100 % gross  sein);\n    aFmtCol.SetLineHeight((BYTE)nPercent);\n}\n\/*------------------------------------------------------------------------\n Beschreibung:  Spaltenbreite\n------------------------------------------------------------------------*\/\n\n\n\nUSHORT SwColMgr::GetColWidth(USHORT nIdx) const\n{\n    ASSERT(nIdx < GetCount(), Spaltenarray ueberindiziert.);\n    return aFmtCol.CalcPrtColWidth(nIdx, nWidth);\n}\n\n\n\nvoid SwColMgr::SetColWidth(USHORT nIdx, USHORT nWd)\n{\n    ASSERT(nIdx < GetCount(), Spaltenarray ueberindiziert.);\n    aFmtCol.GetColumns()[nIdx]->SetWishWidth(nWd);\n\n}\n\n\/*--------------------------------------------------------------------\n    Beschreibung:   Groesse neu setzen\n --------------------------------------------------------------------*\/\n\n\n\nvoid SwColMgr::SetActualWidth(USHORT nW)\n{\n    nWidth = nW;\n    ::FitToActualSize(aFmtCol, nW);\n}\n\n\/*--------------------------------------------------------------------\n    Beschreibung: ctor\n --------------------------------------------------------------------*\/\n\n\n\nSwColMgr::SwColMgr(const SfxItemSet& rSet, USHORT nActWidth) :\n    aFmtCol((const SwFmtCol&)rSet.Get(RES_COL)),\n    nWidth(nActWidth)\n{\n    if(nWidth == USHRT_MAX)\n    {\n        nWidth = (USHORT)((const SwFmtFrmSize&)rSet.Get(RES_FRM_SIZE)).GetWidth();\n        if (nWidth < MINLAY)\n            nWidth = USHRT_MAX;\n        const SvxLRSpaceItem &rLR = (const SvxLRSpaceItem&)rSet.Get(RES_LR_SPACE);\n        nWidth = nWidth - (USHORT)rLR.GetLeft();\n        nWidth = nWidth - (USHORT)rLR.GetRight();\n    }\n    ::FitToActualSize(aFmtCol, nWidth);\n}\n\n\n\n\nSwColMgr::~SwColMgr() {}\n\n\n\n\n\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.6.242); FILE MERGED 2008\/04\/01 15:59:06 thb 1.6.242.2: #i85898# Stripping all external header guards 2008\/03\/31 16:58:13 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: colmgr.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\n#include \"hintids.hxx\"\n#include <svx\/lrspitem.hxx>\n\n#include \"frmmgr.hxx\"\n#include \"frmfmt.hxx\"\n#include \"colmgr.hxx\"\n\n\n\/\/ PRIVATE METHODES ------------------------------------------------------\n\/*------------------------------------------------------------------------\n Beschreibung:  Spaltenbreite auf aktuelle Breite einstellen\n------------------------------------------------------------------------*\/\n\n\n\nvoid FitToActualSize(SwFmtCol& rCol, USHORT nWidth)\n{\n    const USHORT nCount = rCol.GetColumns().Count();\n    for(USHORT i = 0; i < nCount; ++i)\n    {\n        const USHORT nTmp = rCol.CalcColWidth(i, nWidth);\n        rCol.GetColumns()[i]->SetWishWidth(nTmp);\n    }\n    rCol.SetWishWidth(nWidth);\n}\n\n\n\/\/ PUBLIC METHODES -------------------------------------------------------\n\/*------------------------------------------------------------------------\n Beschreibung:  Setzen Spaltenanzahl und Gutterwidth\n------------------------------------------------------------------------*\/\n\n\n\nvoid SwColMgr::SetCount(USHORT nCount, USHORT  nGutterWidth)\n{\n    aFmtCol.Init(nCount, nGutterWidth, nWidth);\n    aFmtCol.SetWishWidth(nWidth);\n    aFmtCol.SetGutterWidth(nGutterWidth, nWidth);\n}\n\n\n\nUSHORT SwColMgr::GetGutterWidth( USHORT nPos ) const\n{\n    USHORT nRet;\n    if(nPos == USHRT_MAX )\n        nRet = GetCount() > 1 ? aFmtCol.GetGutterWidth() : DEF_GUTTER_WIDTH;\n    else\n    {\n        DBG_ASSERT(nPos < GetCount() - 1, \"Spalte ueberindiziert\" )\n        const SwColumns& rCols = aFmtCol.GetColumns();\n        nRet = rCols.GetObject(nPos)->GetRight() + rCols.GetObject(nPos + 1)->GetLeft();\n    }\n    return nRet;\n}\n\n\/*-----------------22.10.96 14.28-------------------\n\n--------------------------------------------------*\/\n\n\nvoid SwColMgr::SetGutterWidth(USHORT nGutterWidth, USHORT nPos )\n{\n    if(nPos == USHRT_MAX)\n        aFmtCol.SetGutterWidth(nGutterWidth, nWidth);\n    else\n    {\n        DBG_ASSERT(nPos < GetCount() - 1, \"Spalte ueberindiziert\" )\n        SwColumns& rCols = aFmtCol.GetColumns();\n        USHORT nGutterWidth2 = nGutterWidth \/ 2;\n        rCols.GetObject(nPos)->SetRight(nGutterWidth2);\n        rCols.GetObject(nPos + 1)->SetLeft(nGutterWidth2);\n    }\n}\n\n\/*------------------------------------------------------------------------\n Beschreibung:  Hoehe Trennlinie\n------------------------------------------------------------------------*\/\n\n\n\nshort SwColMgr::GetLineHeightPercent() const\n{\n    return (short)aFmtCol.GetLineHeight();\n}\n\n\n\nvoid SwColMgr::SetLineHeightPercent(short nPercent)\n{\n    ASSERT(nPercent <= 100, LineHeight darf nur bis 100 % gross  sein);\n    aFmtCol.SetLineHeight((BYTE)nPercent);\n}\n\/*------------------------------------------------------------------------\n Beschreibung:  Spaltenbreite\n------------------------------------------------------------------------*\/\n\n\n\nUSHORT SwColMgr::GetColWidth(USHORT nIdx) const\n{\n    ASSERT(nIdx < GetCount(), Spaltenarray ueberindiziert.);\n    return aFmtCol.CalcPrtColWidth(nIdx, nWidth);\n}\n\n\n\nvoid SwColMgr::SetColWidth(USHORT nIdx, USHORT nWd)\n{\n    ASSERT(nIdx < GetCount(), Spaltenarray ueberindiziert.);\n    aFmtCol.GetColumns()[nIdx]->SetWishWidth(nWd);\n\n}\n\n\/*--------------------------------------------------------------------\n    Beschreibung:   Groesse neu setzen\n --------------------------------------------------------------------*\/\n\n\n\nvoid SwColMgr::SetActualWidth(USHORT nW)\n{\n    nWidth = nW;\n    ::FitToActualSize(aFmtCol, nW);\n}\n\n\/*--------------------------------------------------------------------\n    Beschreibung: ctor\n --------------------------------------------------------------------*\/\n\n\n\nSwColMgr::SwColMgr(const SfxItemSet& rSet, USHORT nActWidth) :\n    aFmtCol((const SwFmtCol&)rSet.Get(RES_COL)),\n    nWidth(nActWidth)\n{\n    if(nWidth == USHRT_MAX)\n    {\n        nWidth = (USHORT)((const SwFmtFrmSize&)rSet.Get(RES_FRM_SIZE)).GetWidth();\n        if (nWidth < MINLAY)\n            nWidth = USHRT_MAX;\n        const SvxLRSpaceItem &rLR = (const SvxLRSpaceItem&)rSet.Get(RES_LR_SPACE);\n        nWidth = nWidth - (USHORT)rLR.GetLeft();\n        nWidth = nWidth - (USHORT)rLR.GetRight();\n    }\n    ::FitToActualSize(aFmtCol, nWidth);\n}\n\n\n\n\nSwColMgr::~SwColMgr() {}\n\n\n\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: regsingleton.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2004-10-28 16:22: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 <stdio.h>\n\n#include \"sal\/main.h\"\n#include <osl\/diagnose.h>\n#include <osl\/file.h>\n\n#include <cppuhelper\/bootstrap.hxx>\n\n#include <com\/sun\/star\/registry\/XSimpleRegistry.hpp>\n\n#define OUSTR(x) ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM(x) )\n\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\n\nstatic void print_options() SAL_THROW( () )\n{\n    printf(\n        \"\\nusage: regsingleton [-r|-ra] registry_file singleton_name[=service_name] ...\\n\\n\"\n        \"Inserts a singleton entry into rdb.\\n\"\n        \"Option -r revokes given entries, -ra revokes all entries.\\n\" );\n}\n\n\/\/==================================================================================================\nSAL_IMPLEMENT_MAIN_WITH_ARGS(argc, argv)\n{\n    if (argc < 3)\n    {\n        print_options();\n        return 1;\n    }\n\n    bool insert_entry = true;\n    bool remove_all = false;\n    int nPos = 1;\n    if ('-' == argv[ nPos ][ 0 ] && 'r' == argv[ nPos ][ 1 ])\n    {\n        if ('a' == argv[ nPos ][ 2 ] && '\\0' == argv[ nPos ][ 3 ])\n        {\n            remove_all = true;\n        }\n        else if ('\\0' != argv[ nPos ][ 2 ])\n        {\n            print_options();\n            return 1;\n        }\n        insert_entry = false;\n        ++nPos;\n    }\n\n    OUString sys_path( OUString::createFromAscii( argv[ nPos ] ) );\n    OUString file_url;\n    oslFileError rc = osl_getFileURLFromSystemPath( sys_path.pData, &file_url.pData );\n    if (osl_File_E_None != rc)\n    {\n        fprintf( stderr, \"\\nerror: cannot make file url out of %s\\n\", argv[ nPos ] );\n        return 1;\n    }\n    ++nPos;\n\n    try\n    {\n        Reference< registry::XSimpleRegistry > xSimReg( ::cppu::createSimpleRegistry() );\n        xSimReg->open( file_url, sal_False, sal_True );\n        Reference< registry::XRegistryKey > xRoot( xSimReg->getRootKey() );\n\n        if (remove_all)\n        {\n            try\n            {\n                xRoot->deleteKey( OUSTR(\"SINGLETONS\") );\n            }\n            catch (registry::InvalidRegistryException & exc)\n            {\n                OString cstr_msg(\n                    OUStringToOString( exc.Message, RTL_TEXTENCODING_ASCII_US ) );\n                fprintf(\n                    stderr, \"\\nwarning: removing all singletons failed: %s\\n\",\n                    cstr_msg.getStr() );\n            }\n        }\n        else\n        {\n            Reference< registry::XRegistryKey > xKey( xRoot->openKey( OUSTR(\"SINGLETONS\") ) );\n            if (! xKey.is())\n                xKey = xRoot->createKey( OUSTR(\"SINGLETONS\") );\n\n            for ( ; nPos < argc; ++nPos )\n            {\n                OUString singleton( OUString::createFromAscii( argv[ nPos ] ) );\n                OUString service;\n                sal_Int32 eq = singleton.indexOf( '=' );\n                if (eq >= 0)\n                {\n                    service = singleton.copy( eq +1 );\n                    singleton = singleton.copy( 0, eq );\n                }\n\n                if (insert_entry)\n                {\n                    if (service.getLength())\n                    {\n                        Reference< registry::XRegistryKey > xEntry( xKey->openKey( singleton ) );\n                        if (! xEntry.is())\n                            xEntry = xKey->createKey( singleton );\n                        xEntry->setStringValue( service );\n                    }\n                    else\n                    {\n                        OString entry( OUStringToOString( singleton, RTL_TEXTENCODING_ASCII_US ) );\n                        fprintf(\n                            stderr, \"\\nwarning: no service name given for singleton %s!\\n\",\n                            entry.getStr() );\n                    }\n                }\n                else\n                {\n                    try\n                    {\n                        xKey->deleteKey( singleton );\n                    }\n                    catch (registry::InvalidRegistryException & exc)\n                    {\n                        OString cstr_singleton(\n                            OUStringToOString( singleton, RTL_TEXTENCODING_ASCII_US ) );\n                        OString cstr_msg(\n                            OUStringToOString( exc.Message, RTL_TEXTENCODING_ASCII_US ) );\n                        fprintf(\n                            stderr, \"\\nwarning: singleton %s is not registered: %s\\n\",\n                            cstr_singleton.getStr(), cstr_msg.getStr() );\n                    }\n                }\n            }\n        }\n\n        return 0;\n    }\n    catch (Exception & rExc)\n    {\n        OString msg( OUStringToOString( rExc.Message, RTL_TEXTENCODING_ASCII_US ) );\n        fprintf( stderr, \"\\nerror: %s\\n\", msg.getStr() );\n        return 1;\n    }\n}\n<commit_msg>INTEGRATION: CWS ooo19126 (1.3.16); FILE MERGED 2005\/09\/05 15:19:53 rt 1.3.16.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: regsingleton.cxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 09:38: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#include <stdio.h>\n\n#include \"sal\/main.h\"\n#include <osl\/diagnose.h>\n#include <osl\/file.h>\n\n#include <cppuhelper\/bootstrap.hxx>\n\n#include <com\/sun\/star\/registry\/XSimpleRegistry.hpp>\n\n#define OUSTR(x) ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM(x) )\n\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\n\nstatic void print_options() SAL_THROW( () )\n{\n    printf(\n        \"\\nusage: regsingleton [-r|-ra] registry_file singleton_name[=service_name] ...\\n\\n\"\n        \"Inserts a singleton entry into rdb.\\n\"\n        \"Option -r revokes given entries, -ra revokes all entries.\\n\" );\n}\n\n\/\/==================================================================================================\nSAL_IMPLEMENT_MAIN_WITH_ARGS(argc, argv)\n{\n    if (argc < 3)\n    {\n        print_options();\n        return 1;\n    }\n\n    bool insert_entry = true;\n    bool remove_all = false;\n    int nPos = 1;\n    if ('-' == argv[ nPos ][ 0 ] && 'r' == argv[ nPos ][ 1 ])\n    {\n        if ('a' == argv[ nPos ][ 2 ] && '\\0' == argv[ nPos ][ 3 ])\n        {\n            remove_all = true;\n        }\n        else if ('\\0' != argv[ nPos ][ 2 ])\n        {\n            print_options();\n            return 1;\n        }\n        insert_entry = false;\n        ++nPos;\n    }\n\n    OUString sys_path( OUString::createFromAscii( argv[ nPos ] ) );\n    OUString file_url;\n    oslFileError rc = osl_getFileURLFromSystemPath( sys_path.pData, &file_url.pData );\n    if (osl_File_E_None != rc)\n    {\n        fprintf( stderr, \"\\nerror: cannot make file url out of %s\\n\", argv[ nPos ] );\n        return 1;\n    }\n    ++nPos;\n\n    try\n    {\n        Reference< registry::XSimpleRegistry > xSimReg( ::cppu::createSimpleRegistry() );\n        xSimReg->open( file_url, sal_False, sal_True );\n        Reference< registry::XRegistryKey > xRoot( xSimReg->getRootKey() );\n\n        if (remove_all)\n        {\n            try\n            {\n                xRoot->deleteKey( OUSTR(\"SINGLETONS\") );\n            }\n            catch (registry::InvalidRegistryException & exc)\n            {\n                OString cstr_msg(\n                    OUStringToOString( exc.Message, RTL_TEXTENCODING_ASCII_US ) );\n                fprintf(\n                    stderr, \"\\nwarning: removing all singletons failed: %s\\n\",\n                    cstr_msg.getStr() );\n            }\n        }\n        else\n        {\n            Reference< registry::XRegistryKey > xKey( xRoot->openKey( OUSTR(\"SINGLETONS\") ) );\n            if (! xKey.is())\n                xKey = xRoot->createKey( OUSTR(\"SINGLETONS\") );\n\n            for ( ; nPos < argc; ++nPos )\n            {\n                OUString singleton( OUString::createFromAscii( argv[ nPos ] ) );\n                OUString service;\n                sal_Int32 eq = singleton.indexOf( '=' );\n                if (eq >= 0)\n                {\n                    service = singleton.copy( eq +1 );\n                    singleton = singleton.copy( 0, eq );\n                }\n\n                if (insert_entry)\n                {\n                    if (service.getLength())\n                    {\n                        Reference< registry::XRegistryKey > xEntry( xKey->openKey( singleton ) );\n                        if (! xEntry.is())\n                            xEntry = xKey->createKey( singleton );\n                        xEntry->setStringValue( service );\n                    }\n                    else\n                    {\n                        OString entry( OUStringToOString( singleton, RTL_TEXTENCODING_ASCII_US ) );\n                        fprintf(\n                            stderr, \"\\nwarning: no service name given for singleton %s!\\n\",\n                            entry.getStr() );\n                    }\n                }\n                else\n                {\n                    try\n                    {\n                        xKey->deleteKey( singleton );\n                    }\n                    catch (registry::InvalidRegistryException & exc)\n                    {\n                        OString cstr_singleton(\n                            OUStringToOString( singleton, RTL_TEXTENCODING_ASCII_US ) );\n                        OString cstr_msg(\n                            OUStringToOString( exc.Message, RTL_TEXTENCODING_ASCII_US ) );\n                        fprintf(\n                            stderr, \"\\nwarning: singleton %s is not registered: %s\\n\",\n                            cstr_singleton.getStr(), cstr_msg.getStr() );\n                    }\n                }\n            }\n        }\n\n        return 0;\n    }\n    catch (Exception & rExc)\n    {\n        OString msg( OUStringToOString( rExc.Message, RTL_TEXTENCODING_ASCII_US ) );\n        fprintf( stderr, \"\\nerror: %s\\n\", msg.getStr() );\n        return 1;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\n * icon_view.cpp : Icon view for the Playlist\n ****************************************************************************\n * Copyright © 2010 the VideoLAN team\n * $Id$\n *\n * Authors:         Jean-Baptiste Kempf <jb@videolan.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 Foundation, Inc.,\n * 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.\n *****************************************************************************\/\n\n#include \"components\/playlist\/icon_view.hpp\"\n#include \"components\/playlist\/playlist_model.hpp\"\n#include \"input_manager.hpp\"\n\n#include <QPainter>\n#include <QRect>\n#include <QStyleOptionViewItem>\n#include <QApplication>\n\n#include \"assert.h\"\n\n#define RECT_SIZE 100\n#define ART_SIZE  64\n#define OFFSET    (100-64)\/2\n\nvoid PlListViewItemDelegate::paint( QPainter * painter, const QStyleOptionViewItem & option, const QModelIndex & index ) const\n{\n    painter->setRenderHint( QPainter::Antialiasing );\n\n    \/*if( option.state & QStyle::State_Selected )\n         painter->fillRect(option.rect, option.palette.highlight());*\/\n    QApplication::style()->drawPrimitive( QStyle::PE_PanelItemViewItem, &option, painter );\n\n    PLItem *currentItem = static_cast<PLItem*>( index.internalPointer() );\n    assert( currentItem );\n\n    QPixmap pix;\n    QString url = InputManager::decodeArtURL( currentItem->inputItem() );\n\n    if( !url.isEmpty() && pix.load( url ) )\n    {\n        pix = pix.scaled( ART_SIZE, ART_SIZE, Qt::KeepAspectRatioByExpanding );\n    }\n    else\n    {\n        pix = QPixmap( \":\/noart64\" );\n    }\n\n    QRect art_rect = option.rect.adjusted( OFFSET - 1, 0, - OFFSET, - OFFSET *2 );\n\n    painter->drawPixmap( art_rect, pix );\n\n    painter->setFont( QFont( \"Verdana\", 7 ) );\n\n    QRect textRect = option.rect.adjusted( 1, ART_SIZE + 2, -1, -1 );\n    painter->drawText( textRect, qfu( input_item_GetTitle( currentItem->inputItem() ) ),\n                       QTextOption( Qt::AlignCenter ) );\n\n}\n\nQSize PlListViewItemDelegate::sizeHint ( const QStyleOptionViewItem & option, const QModelIndex & index ) const\n{\n    return QSize( RECT_SIZE, RECT_SIZE);\n}\n\n\nPlIconView::PlIconView( PLModel *model, QWidget *parent ) : QListView( parent )\n{\n    setModel( model );\n    setViewMode( QListView::IconMode );\n    setMovement( QListView::Static );\n\n    PlListViewItemDelegate *pl = new PlListViewItemDelegate();\n    setItemDelegate( pl );\n}\n<commit_msg>Qt: wrap items automatically in a grid.<commit_after>\/*****************************************************************************\n * icon_view.cpp : Icon view for the Playlist\n ****************************************************************************\n * Copyright © 2010 the VideoLAN team\n * $Id$\n *\n * Authors:         Jean-Baptiste Kempf <jb@videolan.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 Foundation, Inc.,\n * 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.\n *****************************************************************************\/\n\n#include \"components\/playlist\/icon_view.hpp\"\n#include \"components\/playlist\/playlist_model.hpp\"\n#include \"input_manager.hpp\"\n\n#include <QPainter>\n#include <QRect>\n#include <QStyleOptionViewItem>\n#include <QApplication>\n\n#include \"assert.h\"\n\n#define RECT_SIZE 100\n#define ART_SIZE  64\n#define OFFSET    (100-64)\/2\n\nvoid PlListViewItemDelegate::paint( QPainter * painter, const QStyleOptionViewItem & option, const QModelIndex & index ) const\n{\n    painter->setRenderHint( QPainter::Antialiasing );\n\n    \/*if( option.state & QStyle::State_Selected )\n         painter->fillRect(option.rect, option.palette.highlight());*\/\n    QApplication::style()->drawPrimitive( QStyle::PE_PanelItemViewItem, &option, painter );\n\n    PLItem *currentItem = static_cast<PLItem*>( index.internalPointer() );\n    assert( currentItem );\n\n    QPixmap pix;\n    QString url = InputManager::decodeArtURL( currentItem->inputItem() );\n\n    if( !url.isEmpty() && pix.load( url ) )\n    {\n        pix = pix.scaled( ART_SIZE, ART_SIZE, Qt::KeepAspectRatioByExpanding );\n    }\n    else\n    {\n        pix = QPixmap( \":\/noart64\" );\n    }\n\n    QRect art_rect = option.rect.adjusted( OFFSET - 1, 0, - OFFSET, - OFFSET *2 );\n\n    painter->drawPixmap( art_rect, pix );\n\n    painter->setFont( QFont( \"Verdana\", 7 ) );\n\n    QRect textRect = option.rect.adjusted( 1, ART_SIZE + 2, -1, -1 );\n    painter->drawText( textRect, qfu( input_item_GetTitle( currentItem->inputItem() ) ),\n                       QTextOption( Qt::AlignCenter ) );\n\n}\n\nQSize PlListViewItemDelegate::sizeHint ( const QStyleOptionViewItem & option, const QModelIndex & index ) const\n{\n    return QSize( RECT_SIZE, RECT_SIZE);\n}\n\n\nPlIconView::PlIconView( PLModel *model, QWidget *parent ) : QListView( parent )\n{\n    setModel( model );\n    setViewMode( QListView::IconMode );\n    setMovement( QListView::Static );\n    setResizeMode( QListView::Adjust );\n    setGridSize( QSize( 100, 100 ) );\n    setWrapping( true );\n\n    PlListViewItemDelegate *pl = new PlListViewItemDelegate();\n    setItemDelegate( pl );\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\n * vlc_model.hpp : base for playlist and ml model\n ****************************************************************************\n * Copyright (C) 2010 the VideoLAN team and AUTHORS\n * $Id$\n *\n * Authors: Srikanth Raju <srikiraju#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\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#ifndef _VLC_MODEL_H_\n#define _VLC_MODEL_H_\n\n#ifdef HAVE_CONFIG_H\n# include \"config.h\"\n#endif\n\n#include \"qt4.hpp\"\n#include \"sorting.h\"\n\n#include <vlc_input.h>\n\n#include <QModelIndex>\n#include <QPixmapCache>\n#include <QSize>\n#include <QAbstractItemModel>\n\n\nclass VLCModel : public QAbstractItemModel\n{\n    Q_OBJECT\npublic:\n    enum {\n      IsCurrentRole = Qt::UserRole,\n      IsLeafNodeRole,\n      IsCurrentsParentNodeRole\n    };\n\n    VLCModel( intf_thread_t *_p_intf, QObject *parent = 0 );\n    virtual int getId( QModelIndex index ) const = 0;\n    virtual QModelIndex currentIndex() const = 0;\n    virtual bool popup( const QModelIndex & index,\n            const QPoint &point, const QModelIndexList &list ) = 0;\n    virtual void doDelete( QModelIndexList ) = 0;\n    virtual ~VLCModel();\n    static QString getMeta( const QModelIndex & index, int meta );\n    static QPixmap getArtPixmap( const QModelIndex & index, const QSize & size );\n\npublic slots:\n    virtual void activateItem( const QModelIndex &index ) = 0;\n\nprotected:\n    intf_thread_t *p_intf;\n};\n\nstatic int columnToMeta( int _column )\n{\n    int meta = 1;\n    int column = 0;\n\n    while( column != _column && meta != COLUMN_END )\n    {\n        meta <<= 1;\n        column++;\n    }\n\n    return meta;\n}\n\nstatic int columnFromMeta( int meta_col )\n{\n    int meta = 1;\n    int column = 0;\n\n    while( meta != meta_col && meta != COLUMN_END )\n    {\n        meta <<= 1;\n        column++;\n    }\n\n    return column;\n}\n\n#endif\n<commit_msg>Qt: fix a warning in the playlist models<commit_after>\/*****************************************************************************\n * vlc_model.hpp : base for playlist and ml model\n ****************************************************************************\n * Copyright (C) 2010 the VideoLAN team and AUTHORS\n * $Id$\n *\n * Authors: Srikanth Raju <srikiraju#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\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#ifndef _VLC_MODEL_H_\n#define _VLC_MODEL_H_\n\n#ifdef HAVE_CONFIG_H\n# include \"config.h\"\n#endif\n\n#include \"qt4.hpp\"\n#include \"sorting.h\"\n\n#include <vlc_input.h>\n\n#include <QModelIndex>\n#include <QPixmapCache>\n#include <QSize>\n#include <QAbstractItemModel>\n\n\nclass VLCModel : public QAbstractItemModel\n{\n    Q_OBJECT\npublic:\n    enum {\n      IsCurrentRole = Qt::UserRole,\n      IsLeafNodeRole,\n      IsCurrentsParentNodeRole\n    };\n\n    VLCModel( intf_thread_t *_p_intf, QObject *parent = 0 );\n    virtual int getId( QModelIndex index ) const = 0;\n    virtual QModelIndex currentIndex() const = 0;\n    virtual bool popup( const QModelIndex & index,\n            const QPoint &point, const QModelIndexList &list ) = 0;\n    virtual void doDelete( QModelIndexList ) = 0;\n    virtual ~VLCModel();\n    static QString getMeta( const QModelIndex & index, int meta );\n    static QPixmap getArtPixmap( const QModelIndex & index, const QSize & size );\n\n    static int columnToMeta( int _column )\n    {\n        int meta = 1;\n        int column = 0;\n\n        while( column != _column && meta != COLUMN_END )\n        {\n            meta <<= 1;\n            column++;\n        }\n\n        return meta;\n    }\n\n    static int columnFromMeta( int meta_col )\n    {\n        int meta = 1;\n        int column = 0;\n\n        while( meta != meta_col && meta != COLUMN_END )\n        {\n            meta <<= 1;\n            column++;\n        }\n\n        return column;\n    }\n\npublic slots:\n    virtual void activateItem( const QModelIndex &index ) = 0;\n\nprotected:\n    intf_thread_t *p_intf;\n\n};\n\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/***************************************************************************\n    copyright            : (C) 2002, 2003 by Scott Wheeler\n    email                : wheeler@kde.org\n ***************************************************************************\/\n\n\/***************************************************************************\n *   This library is free software; you can redistribute it and\/or modify  *\n *   it under the terms of the GNU Lesser General Public License version   *\n *   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., 59 Temple Place, Suite 330, Boston, MA  02111-1307  *\n *   USA                                                                   *\n *                                                                         *\n *   Alternatively, this file is available under the Mozilla Public        *\n *   License Version 1.1.  You may obtain a copy of the License at         *\n *   http:\/\/www.mozilla.org\/MPL\/                                           *\n ***************************************************************************\/\n\n#include <tfile.h>\n#include <tdebug.h>\n\n#include \"id3v2tag.h\"\n#include \"id3v2header.h\"\n#include \"id3v2extendedheader.h\"\n#include \"id3v2footer.h\"\n#include \"id3v2synchdata.h\"\n\n#include \"id3v1genres.h\"\n\n#include \"frames\/textidentificationframe.h\"\n#include \"frames\/commentsframe.h\"\n\nusing namespace TagLib;\nusing namespace ID3v2;\n\nclass ID3v2::Tag::TagPrivate\n{\npublic:\n  TagPrivate() : file(0), tagOffset(-1), extendedHeader(0), footer(0), paddingSize(0)\n  {\n    frameList.setAutoDelete(true);\n  }\n  ~TagPrivate()\n  {\n    delete extendedHeader;\n    delete footer;\n  }\n\n  File *file;\n  long tagOffset;\n  const FrameFactory *factory;\n\n  Header header;\n  ExtendedHeader *extendedHeader;\n  Footer *footer;\n\n  int paddingSize;\n\n  FrameListMap frameListMap;\n  FrameList frameList;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ public members\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nID3v2::Tag::Tag() : TagLib::Tag()\n{\n  d = new TagPrivate;\n  d->factory = FrameFactory::instance();\n}\n\nID3v2::Tag::Tag(File *file, long tagOffset, const FrameFactory *factory) :\n  TagLib::Tag()\n{\n  d = new TagPrivate;\n\n  d->file = file;\n  d->tagOffset = tagOffset;\n  d->factory = factory;\n\n  read();\n}\n\nID3v2::Tag::~Tag()\n{\n  delete d;\n}\n\n\nString ID3v2::Tag::title() const\n{\n  if(!d->frameListMap[\"TIT2\"].isEmpty())\n    return d->frameListMap[\"TIT2\"].front()->toString();\n  return String::null;\n}\n\nString ID3v2::Tag::artist() const\n{\n  if(!d->frameListMap[\"TPE1\"].isEmpty())\n    return d->frameListMap[\"TPE1\"].front()->toString();\n  return String::null;\n}\n\nString ID3v2::Tag::album() const\n{\n  if(!d->frameListMap[\"TALB\"].isEmpty())\n    return d->frameListMap[\"TALB\"].front()->toString();\n  return String::null;\n}\n\nString ID3v2::Tag::comment() const\n{\n  if(!d->frameListMap[\"COMM\"].isEmpty())\n    return d->frameListMap[\"COMM\"].front()->toString();\n  return String::null;\n}\n\nString ID3v2::Tag::genre() const\n{\n  \/\/ TODO: In the next major version (TagLib 2.0) a list of multiple genres\n  \/\/ should be separated by \" \/ \" instead of \" \".  For the moment to keep\n  \/\/ the behavior the same as released versions it is being left with \" \".\n\n  if(d->frameListMap[\"TCON\"].isEmpty() ||\n     !dynamic_cast<TextIdentificationFrame *>(d->frameListMap[\"TCON\"].front()))\n  {\n    return String::null;\n  }\n\n  \/\/ ID3v2.4 lists genres as the fields in its frames field list.  If the field\n  \/\/ is simply a number it can be assumed that it is an ID3v1 genre number.\n  \/\/ Here was assume that if an ID3v1 string is present that it should be\n  \/\/ appended to the genre string.  Multiple fields will be appended as the\n  \/\/ string is built.\n\n  TextIdentificationFrame *f = static_cast<TextIdentificationFrame *>(\n    d->frameListMap[\"TCON\"].front());\n\n  StringList fields = f->fieldList();\n\n  StringList genres;\n\n  for(StringList::Iterator it = fields.begin(); it != fields.end(); ++it) {\n\n    bool isNumber = true;\n\n    for(String::ConstIterator charIt = (*it).begin();\n        isNumber && charIt != (*it).end();\n        ++charIt)\n    {\n      isNumber = *charIt >= '0' && *charIt <= '9';\n    }\n\n    if(isNumber) {\n      int number = (*it).toInt();\n      if(number >= 0 && number <= 255)\n        *it = ID3v1::genre(number);\n    }\n\n    if(std::find(genres.begin(), genres.end(), *it) == genres.end())\n      genres.append(*it);\n  }\n\n  return genres.toString();\n}\n\nTagLib::uint ID3v2::Tag::year() const\n{\n  if(!d->frameListMap[\"TDRC\"].isEmpty())\n    return d->frameListMap[\"TDRC\"].front()->toString().substr(0, 4).toInt();\n  return 0;\n}\n\nTagLib::uint ID3v2::Tag::track() const\n{\n  if(!d->frameListMap[\"TRCK\"].isEmpty())\n    return d->frameListMap[\"TRCK\"].front()->toString().toInt();\n  return 0;\n}\n\nvoid ID3v2::Tag::setTitle(const String &s)\n{\n  setTextFrame(\"TIT2\", s);\n}\n\nvoid ID3v2::Tag::setArtist(const String &s)\n{\n  setTextFrame(\"TPE1\", s);\n}\n\nvoid ID3v2::Tag::setAlbum(const String &s)\n{\n  setTextFrame(\"TALB\", s);\n}\n\nvoid ID3v2::Tag::setComment(const String &s)\n{\n  if(s.isEmpty()) {\n    removeFrames(\"COMM\");\n    return;\n  }\n\n  if(!d->frameListMap[\"COMM\"].isEmpty())\n    d->frameListMap[\"COMM\"].front()->setText(s);\n  else {\n    CommentsFrame *f = new CommentsFrame(d->factory->defaultTextEncoding());\n    addFrame(f);\n    f->setText(s);\n  }\n}\n\nvoid ID3v2::Tag::setGenre(const String &s)\n{\n  if(s.isEmpty()) {\n    removeFrames(\"TCON\");\n    return;\n  }\n\n  \/\/ iTunes can't handle correctly encoded ID3v2.4 numerical genres.  Just use\n  \/\/ strings until iTunes sucks less.\n\n#ifdef NO_ITUNES_HACKS\n\n  int index = ID3v1::genreIndex(s);\n\n  if(index != 255)\n    setTextFrame(\"TCON\", String::number(index));\n  else\n    setTextFrame(\"TCON\", s);\n\n#else\n\n  setTextFrame(\"TCON\", s);\n\n#endif\n}\n\nvoid ID3v2::Tag::setYear(uint i)\n{\n  if(i <= 0) {\n    removeFrames(\"TDRC\");\n    return;\n  }\n  setTextFrame(\"TDRC\", String::number(i));\n}\n\nvoid ID3v2::Tag::setTrack(uint i)\n{\n  if(i <= 0) {\n    removeFrames(\"TRCK\");\n    return;\n  }\n  setTextFrame(\"TRCK\", String::number(i));\n}\n\nbool ID3v2::Tag::isEmpty() const\n{\n  return d->frameList.isEmpty();\n}\n\nHeader *ID3v2::Tag::header() const\n{\n  return &(d->header);\n}\n\nExtendedHeader *ID3v2::Tag::extendedHeader() const\n{\n  return d->extendedHeader;\n}\n\nFooter *ID3v2::Tag::footer() const\n{\n  return d->footer;\n}\n\nconst FrameListMap &ID3v2::Tag::frameListMap() const\n{\n  return d->frameListMap;\n}\n\nconst FrameList &ID3v2::Tag::frameList() const\n{\n  return d->frameList;\n}\n\nconst FrameList &ID3v2::Tag::frameList(const ByteVector &frameID) const\n{\n  return d->frameListMap[frameID];\n}\n\nvoid ID3v2::Tag::addFrame(Frame *frame)\n{\n  d->frameList.append(frame);\n  d->frameListMap[frame->frameID()].append(frame);\n}\n\nvoid ID3v2::Tag::removeFrame(Frame *frame, bool del)\n{\n  \/\/ remove the frame from the frame list\n  FrameList::Iterator it = d->frameList.find(frame);\n  d->frameList.erase(it);\n\n  \/\/ ...and from the frame list map\n  it = d->frameListMap[frame->frameID()].find(frame);\n  d->frameListMap[frame->frameID()].erase(it);\n\n  \/\/ ...and delete as desired\n  if(del)\n    delete frame;\n}\n\nvoid ID3v2::Tag::removeFrames(const ByteVector &id)\n{\n    FrameList l = d->frameListMap[id];\n    for(FrameList::Iterator it = l.begin(); it != l.end(); ++it)\n      removeFrame(*it, true);\n}\n\nByteVector ID3v2::Tag::render() const\n{\n  \/\/ We need to render the \"tag data\" first so that we have to correct size to\n  \/\/ render in the tag's header.  The \"tag data\" -- everything that is included\n  \/\/ in ID3v2::Header::tagSize() -- includes the extended header, frames and\n  \/\/ padding, but does not include the tag's header or footer.\n\n  ByteVector tagData;\n\n  \/\/ TODO: Render the extended header.\n\n  \/\/ Loop through the frames rendering them and adding them to the tagData.\n\n  for(FrameList::Iterator it = d->frameList.begin(); it != d->frameList.end(); it++) {\n    if(!(*it)->header()->tagAlterPreservation())\n      tagData.append((*it)->render());\n  }\n\n  \/\/ Compute the amount of padding, and append that to tagData.\n\n  uint paddingSize = 0;\n  uint originalSize = d->header.tagSize();\n\n  if(tagData.size() < originalSize)\n    paddingSize = originalSize - tagData.size();\n  else\n    paddingSize = 1024;\n\n  tagData.append(ByteVector(paddingSize, char(0)));\n\n  \/\/ Set the tag size.\n  d->header.setTagSize(tagData.size());\n\n  \/\/ TODO: This should eventually include d->footer->render().\n  return d->header.render() + tagData;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ protected members\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid ID3v2::Tag::read()\n{\n  if(d->file && d->file->isOpen()) {\n\n    d->file->seek(d->tagOffset);\n    d->header.setData(d->file->readBlock(Header::size()));\n\n    \/\/ if the tag size is 0, then this is an invalid tag (tags must contain at\n    \/\/ least one frame)\n\n    if(d->header.tagSize() == 0)\n      return;\n\n    parse(d->file->readBlock(d->header.tagSize()));\n  }\n}\n\nvoid ID3v2::Tag::parse(const ByteVector &origData)\n{\n  ByteVector data = origData;\n\n  if(d->header.unsynchronisation() && d->header.majorVersion() <= 3) {\n    SynchData::decode(data);\n  }\n\n  uint frameDataPosition = 0;\n  uint frameDataLength = data.size();\n\n  \/\/ check for extended header\n\n  if(d->header.extendedHeader()) {\n    if(!d->extendedHeader)\n      d->extendedHeader = new ExtendedHeader;\n    d->extendedHeader->setData(data);\n    if(d->extendedHeader->size() <= data.size()) {\n      frameDataPosition += d->extendedHeader->size();\n      frameDataLength -= d->extendedHeader->size();\n    }\n  }\n\n  \/\/ check for footer -- we don't actually need to parse it, as it *must*\n  \/\/ contain the same data as the header, but we do need to account for its\n  \/\/ size.\n\n  if(d->header.footerPresent() && Footer::size() <= frameDataLength)\n    frameDataLength -= Footer::size();\n\n  \/\/ parse frames\n\n  \/\/ Make sure that there is at least enough room in the remaining frame data for\n  \/\/ a frame header.\n\n  while(frameDataPosition < frameDataLength - Frame::headerSize(d->header.majorVersion())) {\n\n    \/\/ If the next data is position is 0, assume that we've hit the padding\n    \/\/ portion of the frame data.\n\n    if(data.at(frameDataPosition) == 0) {\n      if(d->header.footerPresent())\n        debug(\"Padding *and* a footer found.  This is not allowed by the spec.\");\n\n      d->paddingSize = frameDataLength - frameDataPosition;\n      return;\n    }\n\n    Frame *frame = d->factory->createFrame(data.mid(frameDataPosition),\n                                           &d->header);\n\n    if(!frame)\n      return;\n\n    \/\/ Checks to make sure that frame parsed correctly.\n\n    if(frame->size() <= 0) {\n      delete frame;\n      return;\n    }\n\n    frameDataPosition += frame->size() + Frame::headerSize(d->header.majorVersion());\n    addFrame(frame);\n  }\n}\n\nvoid ID3v2::Tag::setTextFrame(const ByteVector &id, const String &value)\n{\n  if(value.isEmpty()) {\n    removeFrames(id);\n    return;\n  }\n\n  if(!d->frameListMap[id].isEmpty())\n    d->frameListMap[id].front()->setText(value);\n  else {\n    const String::Type encoding = d->factory->defaultTextEncoding();\n    TextIdentificationFrame *f = new TextIdentificationFrame(id, encoding);\n    addFrame(f);\n    f->setText(value);\n  }\n}\n<commit_msg>Try to work around iTunes putting binary data in a comments field by preferring a comment without an empty description.<commit_after>\/***************************************************************************\n    copyright            : (C) 2002, 2003 by Scott Wheeler\n    email                : wheeler@kde.org\n ***************************************************************************\/\n\n\/***************************************************************************\n *   This library is free software; you can redistribute it and\/or modify  *\n *   it under the terms of the GNU Lesser General Public License version   *\n *   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., 59 Temple Place, Suite 330, Boston, MA  02111-1307  *\n *   USA                                                                   *\n *                                                                         *\n *   Alternatively, this file is available under the Mozilla Public        *\n *   License Version 1.1.  You may obtain a copy of the License at         *\n *   http:\/\/www.mozilla.org\/MPL\/                                           *\n ***************************************************************************\/\n\n#include <tfile.h>\n#include <tdebug.h>\n\n#include \"id3v2tag.h\"\n#include \"id3v2header.h\"\n#include \"id3v2extendedheader.h\"\n#include \"id3v2footer.h\"\n#include \"id3v2synchdata.h\"\n\n#include \"id3v1genres.h\"\n\n#include \"frames\/textidentificationframe.h\"\n#include \"frames\/commentsframe.h\"\n\nusing namespace TagLib;\nusing namespace ID3v2;\n\nclass ID3v2::Tag::TagPrivate\n{\npublic:\n  TagPrivate() : file(0), tagOffset(-1), extendedHeader(0), footer(0), paddingSize(0)\n  {\n    frameList.setAutoDelete(true);\n  }\n  ~TagPrivate()\n  {\n    delete extendedHeader;\n    delete footer;\n  }\n\n  File *file;\n  long tagOffset;\n  const FrameFactory *factory;\n\n  Header header;\n  ExtendedHeader *extendedHeader;\n  Footer *footer;\n\n  int paddingSize;\n\n  FrameListMap frameListMap;\n  FrameList frameList;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ public members\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nID3v2::Tag::Tag() : TagLib::Tag()\n{\n  d = new TagPrivate;\n  d->factory = FrameFactory::instance();\n}\n\nID3v2::Tag::Tag(File *file, long tagOffset, const FrameFactory *factory) :\n  TagLib::Tag()\n{\n  d = new TagPrivate;\n\n  d->file = file;\n  d->tagOffset = tagOffset;\n  d->factory = factory;\n\n  read();\n}\n\nID3v2::Tag::~Tag()\n{\n  delete d;\n}\n\n\nString ID3v2::Tag::title() const\n{\n  if(!d->frameListMap[\"TIT2\"].isEmpty())\n    return d->frameListMap[\"TIT2\"].front()->toString();\n  return String::null;\n}\n\nString ID3v2::Tag::artist() const\n{\n  if(!d->frameListMap[\"TPE1\"].isEmpty())\n    return d->frameListMap[\"TPE1\"].front()->toString();\n  return String::null;\n}\n\nString ID3v2::Tag::album() const\n{\n  if(!d->frameListMap[\"TALB\"].isEmpty())\n    return d->frameListMap[\"TALB\"].front()->toString();\n  return String::null;\n}\n\nString ID3v2::Tag::comment() const\n{\n  const FrameList &comments = d->frameListMap[\"COMM\"];\n\n  if(comments.isEmpty())\n    return String::null;\n\n  for(FrameList::ConstIterator it = comments.begin(); it != comments.end(); ++it)\n  {\n    if(static_cast<CommentsFrame *>(*it)->description().isEmpty())\n      return (*it)->toString();\n  }\n\n  return comments.front()->toString();\n}\n\nString ID3v2::Tag::genre() const\n{\n  \/\/ TODO: In the next major version (TagLib 2.0) a list of multiple genres\n  \/\/ should be separated by \" \/ \" instead of \" \".  For the moment to keep\n  \/\/ the behavior the same as released versions it is being left with \" \".\n\n  if(d->frameListMap[\"TCON\"].isEmpty() ||\n     !dynamic_cast<TextIdentificationFrame *>(d->frameListMap[\"TCON\"].front()))\n  {\n    return String::null;\n  }\n\n  \/\/ ID3v2.4 lists genres as the fields in its frames field list.  If the field\n  \/\/ is simply a number it can be assumed that it is an ID3v1 genre number.\n  \/\/ Here was assume that if an ID3v1 string is present that it should be\n  \/\/ appended to the genre string.  Multiple fields will be appended as the\n  \/\/ string is built.\n\n  TextIdentificationFrame *f = static_cast<TextIdentificationFrame *>(\n    d->frameListMap[\"TCON\"].front());\n\n  StringList fields = f->fieldList();\n\n  StringList genres;\n\n  for(StringList::Iterator it = fields.begin(); it != fields.end(); ++it) {\n\n    bool isNumber = true;\n\n    for(String::ConstIterator charIt = (*it).begin();\n        isNumber && charIt != (*it).end();\n        ++charIt)\n    {\n      isNumber = *charIt >= '0' && *charIt <= '9';\n    }\n\n    if(isNumber) {\n      int number = (*it).toInt();\n      if(number >= 0 && number <= 255)\n        *it = ID3v1::genre(number);\n    }\n\n    if(std::find(genres.begin(), genres.end(), *it) == genres.end())\n      genres.append(*it);\n  }\n\n  return genres.toString();\n}\n\nTagLib::uint ID3v2::Tag::year() const\n{\n  if(!d->frameListMap[\"TDRC\"].isEmpty())\n    return d->frameListMap[\"TDRC\"].front()->toString().substr(0, 4).toInt();\n  return 0;\n}\n\nTagLib::uint ID3v2::Tag::track() const\n{\n  if(!d->frameListMap[\"TRCK\"].isEmpty())\n    return d->frameListMap[\"TRCK\"].front()->toString().toInt();\n  return 0;\n}\n\nvoid ID3v2::Tag::setTitle(const String &s)\n{\n  setTextFrame(\"TIT2\", s);\n}\n\nvoid ID3v2::Tag::setArtist(const String &s)\n{\n  setTextFrame(\"TPE1\", s);\n}\n\nvoid ID3v2::Tag::setAlbum(const String &s)\n{\n  setTextFrame(\"TALB\", s);\n}\n\nvoid ID3v2::Tag::setComment(const String &s)\n{\n  if(s.isEmpty()) {\n    removeFrames(\"COMM\");\n    return;\n  }\n\n  if(!d->frameListMap[\"COMM\"].isEmpty())\n    d->frameListMap[\"COMM\"].front()->setText(s);\n  else {\n    CommentsFrame *f = new CommentsFrame(d->factory->defaultTextEncoding());\n    addFrame(f);\n    f->setText(s);\n  }\n}\n\nvoid ID3v2::Tag::setGenre(const String &s)\n{\n  if(s.isEmpty()) {\n    removeFrames(\"TCON\");\n    return;\n  }\n\n  \/\/ iTunes can't handle correctly encoded ID3v2.4 numerical genres.  Just use\n  \/\/ strings until iTunes sucks less.\n\n#ifdef NO_ITUNES_HACKS\n\n  int index = ID3v1::genreIndex(s);\n\n  if(index != 255)\n    setTextFrame(\"TCON\", String::number(index));\n  else\n    setTextFrame(\"TCON\", s);\n\n#else\n\n  setTextFrame(\"TCON\", s);\n\n#endif\n}\n\nvoid ID3v2::Tag::setYear(uint i)\n{\n  if(i <= 0) {\n    removeFrames(\"TDRC\");\n    return;\n  }\n  setTextFrame(\"TDRC\", String::number(i));\n}\n\nvoid ID3v2::Tag::setTrack(uint i)\n{\n  if(i <= 0) {\n    removeFrames(\"TRCK\");\n    return;\n  }\n  setTextFrame(\"TRCK\", String::number(i));\n}\n\nbool ID3v2::Tag::isEmpty() const\n{\n  return d->frameList.isEmpty();\n}\n\nHeader *ID3v2::Tag::header() const\n{\n  return &(d->header);\n}\n\nExtendedHeader *ID3v2::Tag::extendedHeader() const\n{\n  return d->extendedHeader;\n}\n\nFooter *ID3v2::Tag::footer() const\n{\n  return d->footer;\n}\n\nconst FrameListMap &ID3v2::Tag::frameListMap() const\n{\n  return d->frameListMap;\n}\n\nconst FrameList &ID3v2::Tag::frameList() const\n{\n  return d->frameList;\n}\n\nconst FrameList &ID3v2::Tag::frameList(const ByteVector &frameID) const\n{\n  return d->frameListMap[frameID];\n}\n\nvoid ID3v2::Tag::addFrame(Frame *frame)\n{\n  d->frameList.append(frame);\n  d->frameListMap[frame->frameID()].append(frame);\n}\n\nvoid ID3v2::Tag::removeFrame(Frame *frame, bool del)\n{\n  \/\/ remove the frame from the frame list\n  FrameList::Iterator it = d->frameList.find(frame);\n  d->frameList.erase(it);\n\n  \/\/ ...and from the frame list map\n  it = d->frameListMap[frame->frameID()].find(frame);\n  d->frameListMap[frame->frameID()].erase(it);\n\n  \/\/ ...and delete as desired\n  if(del)\n    delete frame;\n}\n\nvoid ID3v2::Tag::removeFrames(const ByteVector &id)\n{\n    FrameList l = d->frameListMap[id];\n    for(FrameList::Iterator it = l.begin(); it != l.end(); ++it)\n      removeFrame(*it, true);\n}\n\nByteVector ID3v2::Tag::render() const\n{\n  \/\/ We need to render the \"tag data\" first so that we have to correct size to\n  \/\/ render in the tag's header.  The \"tag data\" -- everything that is included\n  \/\/ in ID3v2::Header::tagSize() -- includes the extended header, frames and\n  \/\/ padding, but does not include the tag's header or footer.\n\n  ByteVector tagData;\n\n  \/\/ TODO: Render the extended header.\n\n  \/\/ Loop through the frames rendering them and adding them to the tagData.\n\n  for(FrameList::Iterator it = d->frameList.begin(); it != d->frameList.end(); it++) {\n    if(!(*it)->header()->tagAlterPreservation())\n      tagData.append((*it)->render());\n  }\n\n  \/\/ Compute the amount of padding, and append that to tagData.\n\n  uint paddingSize = 0;\n  uint originalSize = d->header.tagSize();\n\n  if(tagData.size() < originalSize)\n    paddingSize = originalSize - tagData.size();\n  else\n    paddingSize = 1024;\n\n  tagData.append(ByteVector(paddingSize, char(0)));\n\n  \/\/ Set the tag size.\n  d->header.setTagSize(tagData.size());\n\n  \/\/ TODO: This should eventually include d->footer->render().\n  return d->header.render() + tagData;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ protected members\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid ID3v2::Tag::read()\n{\n  if(d->file && d->file->isOpen()) {\n\n    d->file->seek(d->tagOffset);\n    d->header.setData(d->file->readBlock(Header::size()));\n\n    \/\/ if the tag size is 0, then this is an invalid tag (tags must contain at\n    \/\/ least one frame)\n\n    if(d->header.tagSize() == 0)\n      return;\n\n    parse(d->file->readBlock(d->header.tagSize()));\n  }\n}\n\nvoid ID3v2::Tag::parse(const ByteVector &origData)\n{\n  ByteVector data = origData;\n\n  if(d->header.unsynchronisation() && d->header.majorVersion() <= 3) {\n    SynchData::decode(data);\n  }\n\n  uint frameDataPosition = 0;\n  uint frameDataLength = data.size();\n\n  \/\/ check for extended header\n\n  if(d->header.extendedHeader()) {\n    if(!d->extendedHeader)\n      d->extendedHeader = new ExtendedHeader;\n    d->extendedHeader->setData(data);\n    if(d->extendedHeader->size() <= data.size()) {\n      frameDataPosition += d->extendedHeader->size();\n      frameDataLength -= d->extendedHeader->size();\n    }\n  }\n\n  \/\/ check for footer -- we don't actually need to parse it, as it *must*\n  \/\/ contain the same data as the header, but we do need to account for its\n  \/\/ size.\n\n  if(d->header.footerPresent() && Footer::size() <= frameDataLength)\n    frameDataLength -= Footer::size();\n\n  \/\/ parse frames\n\n  \/\/ Make sure that there is at least enough room in the remaining frame data for\n  \/\/ a frame header.\n\n  while(frameDataPosition < frameDataLength - Frame::headerSize(d->header.majorVersion())) {\n\n    \/\/ If the next data is position is 0, assume that we've hit the padding\n    \/\/ portion of the frame data.\n\n    if(data.at(frameDataPosition) == 0) {\n      if(d->header.footerPresent())\n        debug(\"Padding *and* a footer found.  This is not allowed by the spec.\");\n\n      d->paddingSize = frameDataLength - frameDataPosition;\n      return;\n    }\n\n    Frame *frame = d->factory->createFrame(data.mid(frameDataPosition),\n                                           &d->header);\n\n    if(!frame)\n      return;\n\n    \/\/ Checks to make sure that frame parsed correctly.\n\n    if(frame->size() <= 0) {\n      delete frame;\n      return;\n    }\n\n    frameDataPosition += frame->size() + Frame::headerSize(d->header.majorVersion());\n    addFrame(frame);\n  }\n}\n\nvoid ID3v2::Tag::setTextFrame(const ByteVector &id, const String &value)\n{\n  if(value.isEmpty()) {\n    removeFrames(id);\n    return;\n  }\n\n  if(!d->frameListMap[id].isEmpty())\n    d->frameListMap[id].front()->setText(value);\n  else {\n    const String::Type encoding = d->factory->defaultTextEncoding();\n    TextIdentificationFrame *f = new TextIdentificationFrame(id, encoding);\n    addFrame(f);\n    f->setText(value);\n  }\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\/\/ C++ Includes   -----------------------------------\n\n\/\/ Local Includes -----------------------------------\n#include \"elem.h\"\n#include \"mesh_base.h\"\n#include \"parallel.h\"\n#include \"partitioner.h\"\n\n\n\/\/ ------------------------------------------------------------\n\/\/ Partitioner implementation\n\n\nvoid Partitioner::partition (MeshBase& mesh,\n\t\t\t     const unsigned int n)\n{\n  \/\/ Set the number of partitions in the mesh\n  mesh.set_n_partitions()=n;\n\n  \/\/ Call the partitioning function\n  this->_do_partition(mesh,n);\n\n  \/\/ Set the node's processor ids\n  this->_set_node_processor_ids(mesh);\n}\n\n\n\n\n\nvoid Partitioner::repartition (MeshBase& mesh,\n\t\t\t       const unsigned int n)\n{\n  \/\/ Set the number of partitions in the mesh\n  mesh.set_n_partitions()=n;\n  \n  \/\/ Call the partitioning function\n  this->_do_repartition(mesh,n);\n\n  \/\/ Set the node's processor ids\n  this->_set_node_processor_ids(mesh);\n}\n\n\n\n\n\nvoid Partitioner::single_partition (MeshBase& mesh)\n{\n  \/\/ Loop over all the elements and assign them to processor 0.\n  MeshBase::element_iterator       elem_it  = mesh.elements_begin();\n  const MeshBase::element_iterator elem_end = mesh.elements_end(); \n\n  for ( ; elem_it != elem_end; ++elem_it)\n    (*elem_it)->processor_id() = 0;\n\n  \/\/ For a single partition, all the nodes are on processor 0\n  MeshBase::node_iterator       node_it  = mesh.nodes_begin();\n  const MeshBase::node_iterator node_end = mesh.nodes_end();\n  \n  for ( ; node_it != node_end; ++node_it)\n    (*node_it)->processor_id() = 0;\n}\n\n\n\n\nvoid Partitioner::_set_node_processor_ids(MeshBase& mesh)\n{\n  \/\/ Unset any previously-set node processor ids\n  \/\/ (maybe from previous partitionings).\n  MeshBase::node_iterator       node_it  = mesh.nodes_begin();\n  const MeshBase::node_iterator node_end = mesh.nodes_end();\n  \n  for ( ; node_it != node_end; ++node_it)\n    {\n      Node *node = *node_it;\n      assert(node);\n      node->invalidate_processor_id();\n    }\n  \n  \n  \/\/ Loop over all the active elements\n  MeshBase::element_iterator       elem_it  = mesh.active_elements_begin();\n  const MeshBase::element_iterator elem_end = mesh.active_elements_end(); \n  \n  for ( ; elem_it != elem_end; ++elem_it)\n    {\n      Elem* elem = *elem_it;\n      assert(elem);\n      \n      \/\/ For each node, set the processor ID to the min of\n      \/\/ its current value and this Element's processor id.\n      for (unsigned int n=0; n<elem->n_nodes(); ++n)\n\telem->get_node(n)->processor_id() = std::min(elem->get_node(n)->processor_id(),\n\t\t\t\t\t\t     elem->processor_id());\n    }\n\n  \/\/ And loop over the subactive elements, but don't reassign\n  \/\/ nodes that are already active on another processor.\n  MeshBase::element_iterator       sub_it  = mesh.subactive_elements_begin();\n  const MeshBase::element_iterator sub_end = mesh.subactive_elements_end(); \n  \n  for ( ; sub_it != sub_end; ++sub_it)\n    {\n      Elem* elem = *sub_it;\n      assert(elem);\n      \n      for (unsigned int n=0; n<elem->n_nodes(); ++n)\n        if (elem->get_node(n)->processor_id() == DofObject::invalid_processor_id)\n\t  elem->get_node(n)->processor_id() = std::min(elem->get_node(n)->processor_id(),\n\t\t\t\t\t\t       elem->processor_id());\n    }\n\n  \/\/ At this point, if we're in parallel, all our own processor ids\n  \/\/ should be correct, but ghost nodes may be incorrect.  However,\n  \/\/ our tenative processor ids will let us know who to ask.\n\n  \/\/ Loop over all the nodes, count the ones on each processor\n  std::vector<unsigned int>\n    ghost_objects_from_proc(libMesh::n_processors(), 0);\n\n  node_it  = mesh.nodes_begin();\n  for ( ; node_it != node_end; ++node_it)\n    {\n      Node *node = *node_it;\n      assert(node);\n      unsigned int obj_procid = node->processor_id();\n      assert(obj_procid != DofObject::invalid_processor_id);\n      ghost_objects_from_proc[obj_procid]++;\n    }\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 reserve()\n  \/\/ space for each.\n  for (unsigned int p=0; p != libMesh::n_processors(); ++p)\n    if (p != libMesh::processor_id())\n      requested_ids[p].reserve(ghost_objects_from_proc[p]);\n\n  node_it  = mesh.nodes_begin();\n  for ( ; node_it != node_end; ++node_it)\n    {\n      Node *node = *node_it;\n      requested_ids[node->processor_id()].push_back(node->id());\n    }\n\n  \/\/ Next set ghost object ids from other processors\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          Node *node = mesh.node_ptr(request_to_fill[i]);\n          assert(node);\n          new_ids[i] = node->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      assert(filled_request.size() == requested_ids[procup].size());\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          Node *node = mesh.node_ptr(requested_ids[procup][i]);\n          assert(filled_request[i] < libMesh::n_processors());\n          node->processor_id(filled_request[i]);\n        }\n    }\n}\n<commit_msg>Disable repartitioning in parallel; add parallel_only() macros where appropriate<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\/\/ C++ Includes   -----------------------------------\n\n\/\/ Local Includes -----------------------------------\n#include \"elem.h\"\n#include \"mesh_base.h\"\n#include \"parallel.h\"\n#include \"partitioner.h\"\n\n\n\/\/ ------------------------------------------------------------\n\/\/ Partitioner implementation\n\n\nvoid Partitioner::partition (MeshBase& mesh,\n\t\t\t     const unsigned int n)\n{\n  \/\/ For now we don't repartition in parallel\n  if (!mesh.is_serial())\n    return;\n\n  \/\/ Set the number of partitions in the mesh\n  mesh.set_n_partitions()=n;\n\n  \/\/ Call the partitioning function\n  this->_do_partition(mesh,n);\n\n  \/\/ Set the node's processor ids\n  this->_set_node_processor_ids(mesh);\n}\n\n\n\n\n\nvoid Partitioner::repartition (MeshBase& mesh,\n\t\t\t       const unsigned int n)\n{\n  \/\/ Set the number of partitions in the mesh\n  mesh.set_n_partitions()=n;\n  \n  \/\/ Call the partitioning function\n  this->_do_repartition(mesh,n);\n\n  \/\/ Set the node's processor ids\n  this->_set_node_processor_ids(mesh);\n}\n\n\n\n\n\nvoid Partitioner::single_partition (MeshBase& mesh)\n{\n  \/\/ Loop over all the elements and assign them to processor 0.\n  MeshBase::element_iterator       elem_it  = mesh.elements_begin();\n  const MeshBase::element_iterator elem_end = mesh.elements_end(); \n\n  for ( ; elem_it != elem_end; ++elem_it)\n    (*elem_it)->processor_id() = 0;\n\n  \/\/ For a single partition, all the nodes are on processor 0\n  MeshBase::node_iterator       node_it  = mesh.nodes_begin();\n  const MeshBase::node_iterator node_end = mesh.nodes_end();\n  \n  for ( ; node_it != node_end; ++node_it)\n    (*node_it)->processor_id() = 0;\n}\n\n\n\n\nvoid Partitioner::_set_node_processor_ids(MeshBase& mesh)\n{\n  \/\/ This function must be run on all processors at once\n  parallel_only();\n\n  \/\/ Unset any previously-set node processor ids\n  \/\/ (maybe from previous partitionings).\n  MeshBase::node_iterator       node_it  = mesh.nodes_begin();\n  const MeshBase::node_iterator node_end = mesh.nodes_end();\n  \n  for ( ; node_it != node_end; ++node_it)\n    {\n      Node *node = *node_it;\n      assert(node);\n      node->invalidate_processor_id();\n    }\n  \n  \n  \/\/ Loop over all the active elements\n  MeshBase::element_iterator       elem_it  = mesh.active_elements_begin();\n  const MeshBase::element_iterator elem_end = mesh.active_elements_end(); \n  \n  for ( ; elem_it != elem_end; ++elem_it)\n    {\n      Elem* elem = *elem_it;\n      assert(elem);\n      \n      \/\/ For each node, set the processor ID to the min of\n      \/\/ its current value and this Element's processor id.\n      for (unsigned int n=0; n<elem->n_nodes(); ++n)\n\telem->get_node(n)->processor_id() = std::min(elem->get_node(n)->processor_id(),\n\t\t\t\t\t\t     elem->processor_id());\n    }\n\n  \/\/ And loop over the subactive elements, but don't reassign\n  \/\/ nodes that are already active on another processor.\n  MeshBase::element_iterator       sub_it  = mesh.subactive_elements_begin();\n  const MeshBase::element_iterator sub_end = mesh.subactive_elements_end(); \n  \n  for ( ; sub_it != sub_end; ++sub_it)\n    {\n      Elem* elem = *sub_it;\n      assert(elem);\n      \n      for (unsigned int n=0; n<elem->n_nodes(); ++n)\n        if (elem->get_node(n)->processor_id() == DofObject::invalid_processor_id)\n\t  elem->get_node(n)->processor_id() = std::min(elem->get_node(n)->processor_id(),\n\t\t\t\t\t\t       elem->processor_id());\n    }\n\n  \/\/ At this point, if we're in parallel, all our own processor ids\n  \/\/ should be correct, but ghost nodes may be incorrect.  However,\n  \/\/ our tenative processor ids will let us know who to ask.\n\n  \/\/ Loop over all the nodes, count the ones on each processor\n  std::vector<unsigned int>\n    ghost_objects_from_proc(libMesh::n_processors(), 0);\n\n  node_it  = mesh.nodes_begin();\n  for ( ; node_it != node_end; ++node_it)\n    {\n      Node *node = *node_it;\n      assert(node);\n      unsigned int obj_procid = node->processor_id();\n      assert(obj_procid != DofObject::invalid_processor_id);\n      ghost_objects_from_proc[obj_procid]++;\n    }\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 reserve()\n  \/\/ space for each.\n  for (unsigned int p=0; p != libMesh::n_processors(); ++p)\n    if (p != libMesh::processor_id())\n      requested_ids[p].reserve(ghost_objects_from_proc[p]);\n\n  node_it  = mesh.nodes_begin();\n  for ( ; node_it != node_end; ++node_it)\n    {\n      Node *node = *node_it;\n      requested_ids[node->processor_id()].push_back(node->id());\n    }\n\n  \/\/ Next set ghost object ids from other processors\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          Node *node = mesh.node_ptr(request_to_fill[i]);\n          assert(node);\n          new_ids[i] = node->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      assert(filled_request.size() == requested_ids[procup].size());\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          Node *node = mesh.node_ptr(requested_ids[procup][i]);\n          assert(filled_request[i] < libMesh::n_processors());\n          node->processor_id(filled_request[i]);\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <igl\/colon.h>\r\n#include <igl\/column_to_quats.h>\r\n#include <igl\/directed_edge_orientations.h>\r\n#include <igl\/directed_edge_parents.h>\r\n#include <igl\/forward_kinematics.h>\r\n#include <igl\/PI.h>\r\n#include <igl\/jet.h>\r\n#include <igl\/lbs_matrix.h>\r\n#include <igl\/deform_skeleton.h>\r\n#include <igl\/dqs.h>\r\n#include <igl\/normalize_row_sums.h>\r\n#include <igl\/readDMAT.h>\r\n#include <igl\/readOBJ.h>\r\n#include <igl\/readTGF.h>\r\n#include <igl\/viewer\/Viewer.h>\r\n\r\n#include <Eigen\/Geometry>\r\n#include <Eigen\/StdVector>\r\n#include <vector>\r\n#include <algorithm>\r\n#include <iostream>\r\n\r\ntypedef \r\n  std::vector<Eigen::Quaterniond,Eigen::aligned_allocator<Eigen::Quaterniond> >\r\n  RotationList;\r\n\r\nconst Eigen::RowVector3d sea_green(70.\/255.,252.\/255.,167.\/255.);\r\nEigen::MatrixXd V,W,C,U,M;\r\nEigen::MatrixXi F,BE;\r\nEigen::VectorXi P;\r\nstd::vector<RotationList > poses;\r\ndouble anim_t = 0.0;\r\ndouble anim_t_dir = 0.015;\r\nbool use_dqs = false;\r\n\r\nbool pre_draw(igl::Viewer & viewer)\r\n{\r\n  using namespace Eigen;\r\n  using namespace std;\r\n  if(viewer.core.is_animating)\r\n  {\r\n    \/\/ Find pose interval\r\n    const int begin = (int)floor(anim_t)%poses.size();\r\n    const int end = (int)(floor(anim_t)+1)%poses.size();\r\n    const double t = anim_t - floor(anim_t);\r\n    \/\/cout<<anim_t<<\": \"<<begin<<\" \"<<end<<endl;\r\n\r\n    \/\/ Interpolate pose and identity\r\n    RotationList anim_pose(poses[begin].size());\r\n    for(int e = 0;e<poses[begin].size();e++)\r\n    {\r\n      anim_pose[e] = poses[begin][e].slerp(t,poses[end][e]);\r\n    }\r\n    \/\/ Propogate relative rotations via FK to retrieve absolute transformations\r\n    RotationList vQ;\r\n    vector<Vector3d> vT;\r\n    igl::forward_kinematics(C,BE,P,anim_pose,vQ,vT);\r\n    const int dim = C.cols();\r\n    MatrixXd T(BE.rows()*(dim+1),dim);\r\n    for(int e = 0;e<BE.rows();e++)\r\n    {\r\n      Affine3d a = Affine3d::Identity();\r\n      a.translate(vT[e]);\r\n      a.rotate(vQ[e]);\r\n      T.block(e*(dim+1),0,dim+1,dim) =\r\n        a.matrix().transpose().block(0,0,dim+1,dim);\r\n    }\r\n    \/\/ Compute deformation via LBS as matrix multiplication\r\n    if(use_dqs)\r\n    {\r\n      igl::dqs(V,W,vQ,vT,U);\r\n    }else\r\n    {\r\n      U = M*T;\r\n    }\r\n\r\n    \/\/ Also deform skeleton edges\r\n    MatrixXd CT;\r\n    MatrixXi BET;\r\n    igl::deform_skeleton(C,BE,T,CT,BET);\r\n    \r\n    viewer.set_vertices(U);\r\n    viewer.set_edges(CT,BET,sea_green);\r\n    viewer.compute_normals();\r\n    anim_t += anim_t_dir;\r\n  }\r\n  return false;\r\n}\r\n\r\nbool key_down(igl::Viewer &viewer, unsigned char key, int mods)\r\n{\r\n  switch(key)\r\n  {\r\n    case 'D':\r\n    case 'd':\r\n      use_dqs = !use_dqs;\r\n      break;\r\n    case ' ':\r\n      viewer.core.is_animating = !viewer.core.is_animating;\r\n      break;\r\n  }\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  igl::readOBJ(\"..\/shared\/arm.obj\",V,F);\r\n  U=V;\r\n  igl::readTGF(\"..\/shared\/arm.tgf\",C,BE);\r\n  \/\/ retrieve parents for forward kinematics\r\n  igl::directed_edge_parents(BE,P);\r\n  RotationList rest_pose;\r\n  igl::directed_edge_orientations(C,BE,rest_pose);\r\n  poses.resize(4,RotationList(4,Quaterniond::Identity()));\r\n  \/\/ poses[1] \/\/ twist\r\n  const Quaterniond twist(AngleAxisd(igl::PI,Vector3d(1,0,0)));\r\n  poses[1][2] = rest_pose[2]*twist*rest_pose[2].conjugate();\r\n  const Quaterniond bend(AngleAxisd(-igl::PI*0.7,Vector3d(0,0,1)));\r\n  poses[3][2] = rest_pose[2]*bend*rest_pose[2].conjugate();\r\n\r\n  igl::readDMAT(\"..\/shared\/arm-weights.dmat\",W);\r\n  igl::lbs_matrix(V,W,M);\r\n\r\n  \/\/ Plot the mesh with pseudocolors\r\n  igl::Viewer viewer;\r\n  viewer.set_mesh(U, F);\r\n  viewer.set_edges(C,BE,sea_green);\r\n  viewer.core.show_lines = false;\r\n  viewer.core.show_overlay_depth = false;\r\n  viewer.core.line_width = 1;\r\n  viewer.core.trackball_angle.normalize();\r\n  viewer.callback_pre_draw = &pre_draw;\r\n  viewer.callback_key_down = &key_down;\r\n  viewer.core.is_animating = false;\r\n  viewer.core.animation_max_fps = 30.;\r\n  viewer.launch();\r\n}\r\n<commit_msg> fine tuning on dqs example<commit_after>#include <igl\/directed_edge_orientations.h>\r\n#include <igl\/directed_edge_parents.h>\r\n#include <igl\/forward_kinematics.h>\r\n#include <igl\/PI.h>\r\n#include <igl\/lbs_matrix.h>\r\n#include <igl\/deform_skeleton.h>\r\n#include <igl\/dqs.h>\r\n#include <igl\/readDMAT.h>\r\n#include <igl\/readOBJ.h>\r\n#include <igl\/readTGF.h>\r\n#include <igl\/viewer\/Viewer.h>\r\n\r\n#include <Eigen\/Geometry>\r\n#include <Eigen\/StdVector>\r\n#include <vector>\r\n#include <algorithm>\r\n#include <iostream>\r\n\r\ntypedef \r\n  std::vector<Eigen::Quaterniond,Eigen::aligned_allocator<Eigen::Quaterniond> >\r\n  RotationList;\r\n\r\nconst Eigen::RowVector3d sea_green(70.\/255.,252.\/255.,167.\/255.);\r\nEigen::MatrixXd V,W,C,U,M;\r\nEigen::MatrixXi F,BE;\r\nEigen::VectorXi P;\r\nstd::vector<RotationList > poses;\r\ndouble anim_t = 0.0;\r\ndouble anim_t_dir = 0.015;\r\nbool use_dqs = false;\r\n\r\nbool pre_draw(igl::Viewer & viewer)\r\n{\r\n  using namespace Eigen;\r\n  using namespace std;\r\n  if(viewer.core.is_animating)\r\n  {\r\n    \/\/ Find pose interval\r\n    const int begin = (int)floor(anim_t)%poses.size();\r\n    const int end = (int)(floor(anim_t)+1)%poses.size();\r\n    const double t = anim_t - floor(anim_t);\r\n    \/\/cout<<anim_t<<\": \"<<begin<<\" \"<<end<<endl;\r\n\r\n    \/\/ Interpolate pose and identity\r\n    RotationList anim_pose(poses[begin].size());\r\n    for(int e = 0;e<poses[begin].size();e++)\r\n    {\r\n      anim_pose[e] = poses[begin][e].slerp(t,poses[end][e]);\r\n    }\r\n    \/\/ Propogate relative rotations via FK to retrieve absolute transformations\r\n    RotationList vQ;\r\n    vector<Vector3d> vT;\r\n    igl::forward_kinematics(C,BE,P,anim_pose,vQ,vT);\r\n    const int dim = C.cols();\r\n    MatrixXd T(BE.rows()*(dim+1),dim);\r\n    for(int e = 0;e<BE.rows();e++)\r\n    {\r\n      Affine3d a = Affine3d::Identity();\r\n      a.translate(vT[e]);\r\n      a.rotate(vQ[e]);\r\n      T.block(e*(dim+1),0,dim+1,dim) =\r\n        a.matrix().transpose().block(0,0,dim+1,dim);\r\n    }\r\n    \/\/ Compute deformation via LBS as matrix multiplication\r\n    if(use_dqs)\r\n    {\r\n      igl::dqs(V,W,vQ,vT,U);\r\n    }else\r\n    {\r\n      U = M*T;\r\n    }\r\n\r\n    \/\/ Also deform skeleton edges\r\n    MatrixXd CT;\r\n    MatrixXi BET;\r\n    igl::deform_skeleton(C,BE,T,CT,BET);\r\n    \r\n    viewer.set_vertices(U);\r\n    viewer.set_edges(CT,BET,sea_green);\r\n    viewer.compute_normals();\r\n    anim_t += anim_t_dir;\r\n  }\r\n  return false;\r\n}\r\n\r\nbool key_down(igl::Viewer &viewer, unsigned char key, int mods)\r\n{\r\n  switch(key)\r\n  {\r\n    case 'D':\r\n    case 'd':\r\n      use_dqs = !use_dqs;\r\n      break;\r\n    case ' ':\r\n      viewer.core.is_animating = !viewer.core.is_animating;\r\n      break;\r\n  }\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  igl::readOBJ(\"..\/shared\/arm.obj\",V,F);\r\n  U=V;\r\n  igl::readTGF(\"..\/shared\/arm.tgf\",C,BE);\r\n  \/\/ retrieve parents for forward kinematics\r\n  igl::directed_edge_parents(BE,P);\r\n  RotationList rest_pose;\r\n  igl::directed_edge_orientations(C,BE,rest_pose);\r\n  poses.resize(4,RotationList(4,Quaterniond::Identity()));\r\n  \/\/ poses[1] \/\/ twist\r\n  const Quaterniond twist(AngleAxisd(igl::PI,Vector3d(1,0,0)));\r\n  poses[1][2] = rest_pose[2]*twist*rest_pose[2].conjugate();\r\n  const Quaterniond bend(AngleAxisd(-igl::PI*0.7,Vector3d(0,0,1)));\r\n  poses[3][2] = rest_pose[2]*bend*rest_pose[2].conjugate();\r\n\r\n  igl::readDMAT(\"..\/shared\/arm-weights.dmat\",W);\r\n  igl::lbs_matrix(V,W,M);\r\n\r\n  \/\/ Plot the mesh with pseudocolors\r\n  igl::Viewer viewer;\r\n  viewer.set_mesh(U, F);\r\n  viewer.set_edges(C,BE,sea_green);\r\n  viewer.core.show_lines = false;\r\n  viewer.core.show_overlay_depth = false;\r\n  viewer.core.line_width = 1;\r\n  viewer.core.trackball_angle.normalize();\r\n  viewer.callback_pre_draw = &pre_draw;\r\n  viewer.callback_key_down = &key_down;\r\n  viewer.core.is_animating = false;\r\n  viewer.core.camera_zoom = 2.5;\r\n  viewer.core.animation_max_fps = 30.;\r\n  viewer.launch();\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2018 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 <seastar\/core\/print.hh>\n#include \"db\/query_context.hh\"\n#include \"db\/system_keyspace.hh\"\n#include \"db\/large_data_handler.hh\"\n#include \"sstables\/sstables.hh\"\n\nnamespace db {\n\nfuture<> large_data_handler::maybe_update_large_partitions(const sstables::sstable& sst, const sstables::key& key, uint64_t partition_size) const {\n    if (!_stopped && partition_size > _partition_threshold_bytes) {\n        ++_stats.partitions_bigger_than_threshold;\n\n        const schema& s = *sst.get_schema();\n        return update_large_partitions(s, sst.get_filename(), key, partition_size);\n    }\n    return make_ready_future<>();\n}\n\nlogging::logger cql_table_large_data_handler::large_data_logger(\"large_data\");\n\nfuture<> cql_table_large_data_handler::update_large_partitions(const schema& s, const sstring& sstable_name, const sstables::key& key, uint64_t partition_size) const {\n    static const sstring req = format(\"INSERT INTO system.{} (keyspace_name, table_name, sstable_name, partition_size, partition_key, compaction_time) VALUES (?, ?, ?, ?, ?, ?) USING TTL 2592000\",\n            db::system_keyspace::LARGE_PARTITIONS);\n    auto ks_name = s.ks_name();\n    auto cf_name = s.cf_name();\n    std::ostringstream oss;\n    oss << key.to_partition_key(s).with_schema(s);\n    auto timestamp = std::chrono::duration_cast<std::chrono::milliseconds>(db_clock::now().time_since_epoch()).count();\n    auto key_str = oss.str();\n    return db::execute_cql(req, ks_name, cf_name, sstable_name, int64_t(partition_size), key_str, timestamp)\n    .then_wrapped([ks_name, cf_name, key_str, partition_size](auto&& f) {\n        try {\n            f.get();\n            large_data_logger.warn(\"Writing large partition {}\/{}:{} ({} bytes)\", ks_name, cf_name, key_str, partition_size);\n        } catch (...) {\n            large_data_logger.warn(\"Failed to update {}: {}\", db::system_keyspace::LARGE_PARTITIONS, std::current_exception());\n        }\n    });\n}\n\nfuture<> cql_table_large_data_handler::delete_large_partitions_entry(const schema& s, const sstring& sstable_name) const {\n    static const sstring req = format(\"DELETE FROM system.{} WHERE keyspace_name = ? AND table_name = ? AND sstable_name = ?\", db::system_keyspace::LARGE_PARTITIONS);\n    return db::execute_cql(req, s.ks_name(), s.cf_name(), sstable_name).discard_result().handle_exception([](std::exception_ptr ep) {\n            large_data_logger.warn(\"Failed to drop entries from {}: {}\", db::system_keyspace::LARGE_PARTITIONS, ep);\n        });\n}\n\nfuture<> cql_table_large_data_handler::record_large_rows(const sstables::sstable& sst, const sstables::key& partition_key,\n        const clustering_key_prefix* clustering_key, uint64_t row_size) const {\n    const schema &s = *sst.get_schema();\n    if (clustering_key) {\n        large_data_logger.warn(\"Writing large row {}\/{}: {} {} ({} bytes)\", s.ks_name(), s.cf_name(),\n                partition_key.to_partition_key(s).with_schema(s), clustering_key->with_schema(s), row_size);\n    } else {\n        large_data_logger.warn(\"Writing large static row {}\/{}: {} ({} bytes)\", s.ks_name(), s.cf_name(),\n                partition_key.to_partition_key(s).with_schema(s), row_size);\n    }\n    return make_ready_future<>();\n}\n\nfuture<> cql_table_large_data_handler::delete_large_rows_entries(const schema& s, const sstring& sstable_name) const {\n    return make_ready_future<>();\n}\n}\n<commit_msg>Extract a key_to_str helper<commit_after>\/*\n * Copyright (C) 2018 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 <seastar\/core\/print.hh>\n#include \"db\/query_context.hh\"\n#include \"db\/system_keyspace.hh\"\n#include \"db\/large_data_handler.hh\"\n#include \"sstables\/sstables.hh\"\n\nnamespace db {\n\nfuture<> large_data_handler::maybe_update_large_partitions(const sstables::sstable& sst, const sstables::key& key, uint64_t partition_size) const {\n    if (!_stopped && partition_size > _partition_threshold_bytes) {\n        ++_stats.partitions_bigger_than_threshold;\n\n        const schema& s = *sst.get_schema();\n        return update_large_partitions(s, sst.get_filename(), key, partition_size);\n    }\n    return make_ready_future<>();\n}\n\nlogging::logger cql_table_large_data_handler::large_data_logger(\"large_data\");\n\ntemplate <typename T> static std::string key_to_str(const T& key, const schema& s) {\n    std::ostringstream oss;\n    oss << key.with_schema(s);\n    return oss.str();\n}\n\nfuture<> cql_table_large_data_handler::update_large_partitions(const schema& s, const sstring& sstable_name, const sstables::key& key, uint64_t partition_size) const {\n    static const sstring req = format(\"INSERT INTO system.{} (keyspace_name, table_name, sstable_name, partition_size, partition_key, compaction_time) VALUES (?, ?, ?, ?, ?, ?) USING TTL 2592000\",\n            db::system_keyspace::LARGE_PARTITIONS);\n    auto ks_name = s.ks_name();\n    auto cf_name = s.cf_name();\n    auto timestamp = std::chrono::duration_cast<std::chrono::milliseconds>(db_clock::now().time_since_epoch()).count();\n    auto key_str = key_to_str(key.to_partition_key(s), s);\n    return db::execute_cql(req, ks_name, cf_name, sstable_name, int64_t(partition_size), key_str, timestamp)\n    .then_wrapped([ks_name, cf_name, key_str, partition_size](auto&& f) {\n        try {\n            f.get();\n            large_data_logger.warn(\"Writing large partition {}\/{}:{} ({} bytes)\", ks_name, cf_name, key_str, partition_size);\n        } catch (...) {\n            large_data_logger.warn(\"Failed to update {}: {}\", db::system_keyspace::LARGE_PARTITIONS, std::current_exception());\n        }\n    });\n}\n\nfuture<> cql_table_large_data_handler::delete_large_partitions_entry(const schema& s, const sstring& sstable_name) const {\n    static const sstring req = format(\"DELETE FROM system.{} WHERE keyspace_name = ? AND table_name = ? AND sstable_name = ?\", db::system_keyspace::LARGE_PARTITIONS);\n    return db::execute_cql(req, s.ks_name(), s.cf_name(), sstable_name).discard_result().handle_exception([](std::exception_ptr ep) {\n            large_data_logger.warn(\"Failed to drop entries from {}: {}\", db::system_keyspace::LARGE_PARTITIONS, ep);\n        });\n}\n\nfuture<> cql_table_large_data_handler::record_large_rows(const sstables::sstable& sst, const sstables::key& partition_key,\n        const clustering_key_prefix* clustering_key, uint64_t row_size) const {\n    const schema &s = *sst.get_schema();\n    if (clustering_key) {\n        large_data_logger.warn(\"Writing large row {}\/{}: {} {} ({} bytes)\", s.ks_name(), s.cf_name(),\n                partition_key.to_partition_key(s).with_schema(s), clustering_key->with_schema(s), row_size);\n    } else {\n        large_data_logger.warn(\"Writing large static row {}\/{}: {} ({} bytes)\", s.ks_name(), s.cf_name(),\n                partition_key.to_partition_key(s).with_schema(s), row_size);\n    }\n    return make_ready_future<>();\n}\n\nfuture<> cql_table_large_data_handler::delete_large_rows_entries(const schema& s, const sstring& sstable_name) const {\n    return make_ready_future<>();\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <SofaTest\/Sofa_test.h>\n\n#include <SofaPython\/PythonFactory.h>\n#include <SofaPython\/Binding_BaseObject.h>\n\n\n#include <SofaSimulationGraph\/DAGSimulation.h>\n#include <sofa\/simulation\/Node.h>\n\n#include <sofa\/core\/ObjectFactory.h>\n#include <SofaPython\/PythonToSofa.inl>\n\nusing sofa::simulation::Node;\n\n#include <sofa\/core\/ObjectFactory.h>\n\n#include \"..\/SceneLoaderPY.h\"\nusing sofa::simulation::SceneLoaderPY ;\nusing sofa::core::objectmodel::BaseObject ;\n\nnamespace sofa {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ A new Component \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nclass ExternalComponent : public core::objectmodel::BaseObject\n{\npublic:\n    Data<std::string> d_value ;\n\n    SOFA_CLASS( ExternalComponent,core::objectmodel::BaseObject);\n\n    ExternalComponent() :\n        d_value(initData(&d_value, \"value\", \"value\", \"simpletest\"))\n    {\n    }\n\n    void helloWorld()\n    {\n        msg_info()<<\"ExternalComponent \\\"\"<<this->getName()<<\"\\\" says hello world\";\n        ++nbcalls;\n    }\n\n    static int nbcalls;\n};\n\nint ExternalComponent::nbcalls = 0;\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ \/\/\/\/\/\/\/\/ Registering the new component in the factory \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nSOFA_DECL_CLASS (ExternalComponent)\nint ExternalComponentClass = core::RegisterObject ( \"An dummy External Component\" )\n        .add<ExternalComponent>(true);\n}\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ Binding the new component in Python \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nSP_DECLARE_CLASS_TYPE(ExternalComponent)\n\nstatic PyObject * ExternalComponent_helloWorld(PyObject *self, PyObject * \/*args*\/)\n{\n    sofa::ExternalComponent* obj = sofa::py::unwrap<sofa::ExternalComponent>(self);\n       \n    obj->helloWorld();\n    Py_RETURN_NONE;\n}\n\nSP_CLASS_METHODS_BEGIN(ExternalComponent)\nSP_CLASS_METHOD(ExternalComponent,helloWorld)\nSP_CLASS_METHODS_END\n\nSP_CLASS_TYPE_SPTR(ExternalComponent,sofa::ExternalComponent,BaseObject)\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ End of the new component  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ TESTS \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nnamespace sofa {\nstruct PythonFactory_test : public Sofa_test<>,\n                            public ::testing::WithParamInterface<std::vector<std::string>>\n{\nprotected:\n\n    virtual void SetUp() override\n    {\n        \/\/\/ ADDING new component in the python Factory\n        \/\/\/ of course its binding must be defined!\n        SP_ADD_CLASS_IN_FACTORY( ExternalComponent, sofa::ExternalComponent )\n    }\n\n    virtual void TearDown() override\n    {\n    }\n\n    void test()\n    {\n        EXPECT_EQ(0, ExternalComponent::nbcalls);\n        sofa::simulation::setSimulation(new sofa::simulation::graph::DAGSimulation());\n\n        static const std::string scenePath = std::string(SOFAPYTHON_TEST_PYTHON_DIR)+std::string(\"\/test_PythonFactory.py\");\n        simulation::getSimulation()->load(scenePath.c_str());\n\n        EXPECT_EQ(1, ExternalComponent::nbcalls);\n    }\n\n\n    void testAttributeConversion(const std::vector<std::string>& params)\n    {\n        std::string value = params[0] ;\n        std::string result = params[1] ;\n\n        const std::string scenePath = std::string(SOFAPYTHON_TEST_PYTHON_DIR)+std::string(\"\/test_PythonFactory2.py\");\n        std::ofstream f(scenePath, std::ofstream::out);\n        ASSERT_TRUE(f.is_open());\n        f <<\n                 \"import Sofa                          \\n\"\n                 \"from SofaTest.Macro import *         \\n\"\n                 \"                                     \\n\"\n                 \"class NonCustomizedObject(object):   \\n\"\n                 \"   def __init__(self):               \\n\"\n                 \"        return None                  \\n\"\n                 \"   def __str__(self):                \\n\"\n                 \"        return 'default'             \\n\"\n                 \"class CustomObject(object):           \\n\"\n                 \"   def getAsACreateObjectParameter(self):            \\n\"\n                 \"        return 'custom value'        \\n\"\n                 \"def createScene(rootNode):           \\n\"\n                 \"    first = rootNode.createObject( 'ExternalComponent', name='theFirst') \\n\"\n                 \"    externalComponent = rootNode.createObject( 'ExternalComponent', name='second', value=\"<<value<<\") \\n\"\n                 \"    externalComponent.helloWorld()   \\n\" ;\n        f.close();\n\n        Node::SPtr root = simulation::getSimulation()->load(scenePath.c_str());\n        ASSERT_NE(root, nullptr);\n\n        BaseObject* aComponent = root->getObject(\"second\") ;\n\n        ASSERT_NE(aComponent, nullptr);\n        ASSERT_NE(aComponent->findData(\"value\"), nullptr);\n        ASSERT_EQ(aComponent->findData(\"value\")->getValueString(), result);\n        simulation::getSimulation()->unload(root);\n    }\n};\n\nTEST_F(PythonFactory_test, result)\n{\n    test();\n}\n\n\nTEST_F(PythonFactory_test, testCreateObjectDataConversionWarning)\n{\n    EXPECT_MSG_EMIT(Warning) ;\n    this->testAttributeConversion({\"NonCustomizedObject()\", \"default\"});\n}\n\nstd::vector<std::vector<std::string>> dataconversionvalues =\n    {{\"1\", \"1\"},\n     {\"1.1\", \"1.1\"},\n     {\"True\", \"True\"},\n     {\"'aString'\", \"aString\"},\n     {\"'aString'.join('[ ]')\", \"[aString aString]\"},\n     {\"' '.join(['AA', 'BB', 'CC'])\", \"AA BB CC\"},\n     {\"[1, 2, 3, 4]\", \"1 2 3 4\"},\n     {\"[1.0, 2.0, 3.0, 4.0]\", \"1.0 2.0 3.0 4.0\"},\n     {\"['ab', 'cd', 'ef', 'gh']\", \"ab cd ef gh\"},\n     {\"[[1,2], [3,4], [5,6]]\", \"1 2 3 4 5 6\"},\n     {\"[['aa','bb'], ['cc','dd'], ['ee','ff']]\", \"aa bb cc dd ee ff\"},\n     {\"range(1,5)\", \"1 2 3 4\"},\n     {\"xrange(1,5)\", \"1 2 3 4\"},\n     {\"'XX_'+first.findData('name').getLinkPath()\", \"XX_@\/theFirst.name\"},\n     {\"first.findData('name').getLinkPath()\", \"theFirst\"},\n     {\"first.findData('name')\", \"theFirst\"},\n     {\"'XX_'+rootNode.getAsACreateObjectParameter()\", \"XX_@\"},\n     {\"CustomObject()\", \"custom value\"}\n    } ;\n\nTEST_P(PythonFactory_test, testCreateObjectDataConversion)\n{\n   this->testAttributeConversion(GetParam());\n}\n\nINSTANTIATE_TEST_CASE_P(testCreateObjectDataConversion,\n                        PythonFactory_test,\n                        ::testing::ValuesIn(dataconversionvalues));\n}\n\n\n<commit_msg>[PythonFactory_test] Update the test to the replacement of str by repr<commit_after>#include <SofaTest\/Sofa_test.h>\n\n#include <SofaPython\/PythonFactory.h>\n#include <SofaPython\/Binding_BaseObject.h>\n\n\n#include <SofaSimulationGraph\/DAGSimulation.h>\n#include <sofa\/simulation\/Node.h>\n\n#include <sofa\/core\/ObjectFactory.h>\n#include <SofaPython\/PythonToSofa.inl>\n\nusing sofa::simulation::Node;\n\n#include <sofa\/core\/ObjectFactory.h>\n\n#include \"..\/SceneLoaderPY.h\"\nusing sofa::simulation::SceneLoaderPY ;\nusing sofa::core::objectmodel::BaseObject ;\n\nnamespace sofa {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ A new Component \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nclass ExternalComponent : public core::objectmodel::BaseObject\n{\npublic:\n    Data<std::string> d_value ;\n\n    SOFA_CLASS( ExternalComponent,core::objectmodel::BaseObject);\n\n    ExternalComponent() :\n        d_value(initData(&d_value, \"value\", \"value\", \"simpletest\"))\n    {\n    }\n\n    void helloWorld()\n    {\n        msg_info()<<\"ExternalComponent \\\"\"<<this->getName()<<\"\\\" says hello world\";\n        ++nbcalls;\n    }\n\n    static int nbcalls;\n};\n\nint ExternalComponent::nbcalls = 0;\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ \/\/\/\/\/\/\/\/ Registering the new component in the factory \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nSOFA_DECL_CLASS (ExternalComponent)\nint ExternalComponentClass = core::RegisterObject ( \"An dummy External Component\" )\n        .add<ExternalComponent>(true);\n}\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ Binding the new component in Python \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nSP_DECLARE_CLASS_TYPE(ExternalComponent)\n\nstatic PyObject * ExternalComponent_helloWorld(PyObject *self, PyObject * \/*args*\/)\n{\n    sofa::ExternalComponent* obj = sofa::py::unwrap<sofa::ExternalComponent>(self);\n\n    obj->helloWorld();\n    Py_RETURN_NONE;\n}\n\nSP_CLASS_METHODS_BEGIN(ExternalComponent)\nSP_CLASS_METHOD(ExternalComponent,helloWorld)\nSP_CLASS_METHODS_END\n\nSP_CLASS_TYPE_SPTR(ExternalComponent,sofa::ExternalComponent,BaseObject)\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ End of the new component  \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ TESTS \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nnamespace sofa {\nstruct PythonFactory_test : public Sofa_test<>,\n                            public ::testing::WithParamInterface<std::vector<std::string>>\n{\nprotected:\n\n    virtual void SetUp() override\n    {\n        \/\/\/ ADDING new component in the python Factory\n        \/\/\/ of course its binding must be defined!\n        SP_ADD_CLASS_IN_FACTORY( ExternalComponent, sofa::ExternalComponent )\n    }\n\n    virtual void TearDown() override\n    {\n    }\n\n    void test()\n    {\n        EXPECT_EQ(0, ExternalComponent::nbcalls);\n        sofa::simulation::setSimulation(new sofa::simulation::graph::DAGSimulation());\n\n        static const std::string scenePath = std::string(SOFAPYTHON_TEST_PYTHON_DIR)+std::string(\"\/test_PythonFactory.py\");\n        simulation::getSimulation()->load(scenePath.c_str());\n\n        EXPECT_EQ(1, ExternalComponent::nbcalls);\n    }\n\n\n    void testAttributeConversion(const std::vector<std::string>& params)\n    {\n        std::string value = params[0] ;\n        std::string result = params[1] ;\n\n        const std::string scenePath = std::string(SOFAPYTHON_TEST_PYTHON_DIR)+std::string(\"\/test_PythonFactory2.py\");\n        std::ofstream f(scenePath, std::ofstream::out);\n        ASSERT_TRUE(f.is_open());\n        f <<\n                 \"import Sofa                          \\n\"\n                 \"from SofaTest.Macro import *         \\n\"\n                 \"                                     \\n\"\n                 \"class NonCustomizedObject(object):   \\n\"\n                 \"   def __init__(self):               \\n\"\n                 \"        return None                  \\n\"\n                 \"   def __repr__(self):                \\n\"\n                 \"        return 'default'             \\n\"\n                 \"class CustomObject(object):           \\n\"\n                 \"   def getAsACreateObjectParameter(self):            \\n\"\n                 \"        return 'custom value'        \\n\"\n                 \"def createScene(rootNode):           \\n\"\n                 \"    first = rootNode.createObject( 'ExternalComponent', name='theFirst') \\n\"\n                 \"    externalComponent = rootNode.createObject( 'ExternalComponent', name='second', value=\"<<value<<\") \\n\"\n                 \"    externalComponent.helloWorld()   \\n\" ;\n        f.close();\n\n        Node::SPtr root = simulation::getSimulation()->load(scenePath.c_str());\n        ASSERT_NE(root, nullptr);\n\n        BaseObject* aComponent = root->getObject(\"second\") ;\n\n        ASSERT_NE(aComponent, nullptr);\n        ASSERT_NE(aComponent->findData(\"value\"), nullptr);\n        ASSERT_EQ(aComponent->findData(\"value\")->getValueString(), result);\n        simulation::getSimulation()->unload(root);\n    }\n};\n\nTEST_F(PythonFactory_test, result)\n{\n    test();\n}\n\n\nTEST_F(PythonFactory_test, testCreateObjectDataConversionWarning)\n{\n    EXPECT_MSG_EMIT(Warning) ;\n    this->testAttributeConversion({\"NonCustomizedObject()\", \"default\"});\n}\n\nstd::vector<std::vector<std::string>> dataconversionvalues =\n    {{\"1\", \"1\"},\n     {\"1.1\", \"1.1\"},\n     {\"True\", \"True\"},\n     {\"'aString'\", \"aString\"},\n     {\"'aString'.join('[ ]')\", \"[aString aString]\"},\n     {\"' '.join(['AA', 'BB', 'CC'])\", \"AA BB CC\"},\n     {\"[1, 2, 3, 4]\", \"1 2 3 4\"},\n     {\"[1.0, 2.0, 3.0, 4.0]\", \"1.0 2.0 3.0 4.0\"},\n     {\"['ab', 'cd', 'ef', 'gh']\", \"ab cd ef gh\"},\n     {\"[[1,2], [3,4], [5,6]]\", \"1 2 3 4 5 6\"},\n     {\"[['aa','bb'], ['cc','dd'], ['ee','ff']]\", \"aa bb cc dd ee ff\"},\n     {\"range(1,5)\", \"1 2 3 4\"},\n     {\"xrange(1,5)\", \"1 2 3 4\"},\n     {\"'XX_'+first.findData('name').getLinkPath()\", \"XX_@\/theFirst.name\"},\n     {\"first.findData('name').getLinkPath()\", \"theFirst\"},\n     {\"first.findData('name')\", \"theFirst\"},\n     {\"'XX_'+rootNode.getAsACreateObjectParameter()\", \"XX_@\"},\n     {\"CustomObject()\", \"custom value\"}\n    } ;\n\nTEST_P(PythonFactory_test, testCreateObjectDataConversion)\n{\n   this->testAttributeConversion(GetParam());\n}\n\nINSTANTIATE_TEST_CASE_P(testCreateObjectDataConversion,\n                        PythonFactory_test,\n                        ::testing::ValuesIn(dataconversionvalues));\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ DXGL\r\n\/\/ Copyright (C) 2012 William Feely\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., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA\r\n\r\n#include \"common.h\"\r\n#include \"glDirectDraw.h\"\r\n#include \"glRenderWindow.h\"\r\n#include \"ddraw.h\"\r\n\r\n\r\nWNDCLASSEXA wndclass;\r\nbool wndclasscreated = false;\r\n#ifdef _DEBUG\r\nbool hotkeyregistered = false;\r\n#endif\r\n\r\nvoid WaitForObjectAndMessages(HANDLE object)\r\n{\r\n\tMSG Msg;\r\n\twhile(1)\r\n\t{\r\n\t\tswitch(MsgWaitForMultipleObjects(1,&object,FALSE,INFINITE,QS_ALLINPUT))\r\n\t\t{\r\n\t\tcase WAIT_OBJECT_0:\r\n\t\t\treturn;\r\n\t\tcase WAIT_OBJECT_0+1:\r\n\t\t\twhile(PeekMessage(&Msg,NULL,0,0,PM_REMOVE))\r\n\t\t\t{\r\n\t\t\t\tTranslateMessage(&Msg);\r\n\t\t\t\tDispatchMessage(&Msg);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n}\r\n\r\nglRenderWindow::glRenderWindow(int width, int height, bool fullscreen, HWND parent, glDirectDraw7 *glDD7, bool devwnd)\r\n{\r\n\tddInterface = glDD7;\r\n\tthis->width = width;\r\n\tthis->height = height;\r\n\tthis->fullscreen = fullscreen;\r\n\tthis->device = devwnd;\r\n\thParentWnd = parent;\r\n\tReadyEvent = CreateEvent(NULL,false,false,NULL);\r\n\thThread = CreateThread(NULL,0,ThreadEntry,this,0,NULL);\r\n\tWaitForObjectAndMessages(ReadyEvent);\r\n\tCloseHandle(ReadyEvent);\r\n\tReadyEvent = NULL;\r\n}\r\n\r\nDWORD WINAPI glRenderWindow::ThreadEntry(void *entry)\r\n{\r\n\treturn ((glRenderWindow*)entry)->_Entry();\r\n}\r\n\r\nDWORD glRenderWindow::_Entry()\r\n{\r\n\tchar *windowname;\r\n\tif (device) windowname = \"DirectDrawDeviceWnd\";\r\n\telse windowname = \"Renderer\";\r\n    MSG Msg;\r\n\tif(!wndclasscreated)\r\n\t{\r\n\t\twndclass.cbSize = sizeof(WNDCLASSEXA);\r\n\t\twndclass.style = 0;\r\n\t\twndclass.lpfnWndProc = RenderWndProc;\r\n\t\twndclass.cbClsExtra = 0;\r\n\t\twndclass.cbWndExtra = 0;\r\n\t\twndclass.hInstance = (HINSTANCE)GetModuleHandle(NULL);\r\n\t\twndclass.hIcon = NULL;\r\n\t\twndclass.hCursor = NULL;\r\n\t\twndclass.hbrBackground = NULL;\r\n\t\twndclass.lpszMenuName = NULL;\r\n\t\twndclass.lpszClassName = \"DirectDrawDeviceWnd\";\r\n\t\twndclass.hIconSm = NULL;\r\n\t\tRegisterClassExA(&wndclass);\r\n\t\twndclasscreated = true;\r\n\t}\r\n\tRECT rectRender;\r\n\tGetClientRect(hParentWnd,&rectRender);\r\n\tdead = false;\r\n\tif(hParentWnd)\r\n\t{\r\n\t\thWnd = CreateWindowA(\"DirectDrawDeviceWnd\",windowname,WS_CHILD|WS_VISIBLE,0,0,rectRender.right - rectRender.left,\r\n\t\t\trectRender.bottom - rectRender.top,hParentWnd,NULL,wndclass.hInstance,this);\r\n\t\tSetWindowPos(hWnd,HWND_TOP,0,0,rectRender.right,rectRender.bottom,SWP_SHOWWINDOW);\r\n\t}\r\n\telse\r\n\t{\r\n\t\twidth = GetSystemMetrics(SM_CXSCREEN);\r\n\t\theight = GetSystemMetrics(SM_CYSCREEN);\r\n\t\thWnd = CreateWindowExA(WS_EX_TOOLWINDOW|WS_EX_LAYERED|WS_EX_TRANSPARENT|WS_EX_TOPMOST,\r\n\t\t\t\"DirectDrawDeviceWnd\",windowname,WS_POPUP,0,0,width,height,0,0,NULL,this);\r\n\t\tSetWindowPos(hWnd,HWND_TOP,0,0,width,height,SWP_SHOWWINDOW|SWP_NOACTIVATE);\r\n\t}\r\n\t#ifdef _DEBUG\r\n\tif(RegisterHotKey(hWnd,1,MOD_CONTROL,VK_CANCEL)) hotkeyregistered = true;\r\n\telse\r\n\t{\r\n\t\tTRACE_STRING(\"Failed to register hotkey.\\n\");\r\n\t\tBeep(120, 1000);\r\n\t}\r\n\t#endif\r\n\tSetEvent(ReadyEvent);\r\n\twhile((GetMessage(&Msg, NULL, 0, 0) > 0) && !dead)\r\n\t{\r\n\t\tTranslateMessage(&Msg);\r\n\t\tDispatchMessage(&Msg);\r\n\t}\r\n\treturn 0;\r\n}\r\n\r\nglRenderWindow::~glRenderWindow()\r\n{\r\n\t#ifdef _DEBUG\r\n\tif(hotkeyregistered) UnregisterHotKey(hWnd,1);\r\n\t#endif\r\n\tSendMessage(hWnd,WM_CLOSE,0,0);\r\n\tWaitForSingleObject(hThread,INFINITE);\r\n\tCloseHandle(hThread);\r\n}\r\n\r\n#ifdef _TRACE\r\nDWORD WINAPI BeepThread(void *unused)\r\n{\r\n\tBeep(3600,150);\r\n\treturn 0;\r\n}\r\n#endif\r\n\r\nLRESULT glRenderWindow::WndProc(HWND hwnd, UINT msg, WPARAM wParam, LPARAM lParam)\r\n{\r\n\tint oldx,oldy;\r\n\tfloat mulx, muly;\r\n\tint translatex, translatey;\r\n\tLPARAM newpos;\r\n\tHWND hParent;\r\n\tLONG sizes[6];\r\n\tHCURSOR cursor;\r\n\tswitch(msg)\r\n\t{\r\n\tcase WM_CREATE:\r\n\t\tSetWindowLongPtr(hwnd,GWLP_USERDATA,(LONG_PTR)this);\r\n\t\treturn 0;\r\n\tcase WM_SETCURSOR:\r\n\t\thParent = GetParent(hwnd);\r\n\t\tcursor = (HCURSOR)GetClassLong(hParent,GCL_HCURSOR);\r\n\t\tSetCursor(cursor);\r\n\t\treturn SendMessage(hParent,msg,wParam,lParam);\r\n\tcase WM_MOUSEMOVE:\r\n\tcase WM_LBUTTONDOWN:\r\n\tcase WM_LBUTTONUP:\r\n\tcase WM_LBUTTONDBLCLK:\r\n\tcase WM_RBUTTONDOWN:\r\n\tcase WM_RBUTTONUP:\r\n\tcase WM_RBUTTONDBLCLK:\r\n\tcase WM_MBUTTONDOWN:\r\n\tcase WM_MBUTTONUP:\r\n\tcase WM_MBUTTONDBLCLK:\r\n\tcase WM_MOUSEWHEEL:\r\n\tcase WM_XBUTTONDOWN:\r\n\tcase WM_XBUTTONUP:\r\n\tcase WM_XBUTTONDBLCLK:\r\n\tcase WM_MOUSEHWHEEL:\r\n\t\thParent = GetParent(hwnd);\r\n\t\tif((dxglcfg.scaler != 0) && ddInterface->GetFullscreen())\r\n\t\t{\r\n\t\t\toldx = LOWORD(lParam);\r\n\t\t\toldy = HIWORD(lParam);\r\n\t\t\tddInterface->GetSizes(sizes);\r\n\t\t\tmulx = (float)sizes[2] \/ (float)sizes[0];\r\n\t\t\tmuly = (float)sizes[3] \/ (float)sizes[1];\r\n\t\t\ttranslatex = (sizes[4]-sizes[0])\/2;\r\n\t\t\ttranslatey = (sizes[5]-sizes[1])\/2;\r\n\t\t\toldx -= translatex;\r\n\t\t\toldy -= translatey;\r\n\t\t\toldx = (int)((float)oldx * mulx);\r\n\t\t\toldy = (int)((float)oldy * muly);\r\n\t\t\tif(oldx < 0) oldx = 0;\r\n\t\t\tif(oldy < 0) oldy = 0;\r\n\t\t\tif(oldx >= sizes[2]) oldx = sizes[2]-1;\r\n\t\t\tif(oldy >= sizes[3]) oldy = sizes[3]-1;\r\n\t\t\tnewpos = oldx + (oldy << 16);\r\n\t\t\treturn SendMessage(hParent,msg,wParam,newpos);\r\n\t\t}\r\n\t\telse return SendMessage(hParent,msg,wParam,lParam);\r\n\tcase WM_CLOSE:\r\n\t\tDestroyWindow(hWnd);\r\n\t\treturn 0;\r\n\tcase WM_DESTROY:\r\n\t\tPostQuitMessage(0);\r\n\t\tdead = true;\r\n\t\treturn 0;\r\n\t#ifdef _DEBUG\r\n\tcase WM_HOTKEY:\r\n\t\t#ifdef _TRACE\r\n\t\ttrace_end = TRUE;\r\n\t\tCreateThread(NULL,0,BeepThread,NULL,0,NULL);\r\n\t\tUnregisterHotKey(hWnd,1);\r\n\t\thotkeyregistered = false;\r\n\t\t#else\r\n\t\tBeep(3600,150);\r\n\t\tDebugBreak();\r\n\t\t#endif\r\n\t#endif\r\n\tdefault:\r\n\t\treturn DefWindowProc(hwnd,msg,wParam,lParam);\r\n\t}\r\n\treturn 0;\r\n}\r\n\r\n\r\n\r\n\r\n\r\n\/\/ Render Window event handler\r\nLRESULT CALLBACK RenderWndProc(HWND hwnd, UINT msg, WPARAM wParam, LPARAM lParam)\r\n{\r\n\tglRenderWindow* instance = reinterpret_cast<glRenderWindow*>(GetWindowLongPtr(hwnd,GWLP_USERDATA));\r\n\tif(!instance)\r\n\t{\r\n\t\tif(msg == WM_CREATE)\r\n\t\t\tinstance = reinterpret_cast<glRenderWindow*>(*(LONG_PTR*)lParam);\r\n\t\telse return DefWindowProc(hwnd,msg,wParam,lParam);\r\n\t}\r\n\treturn instance->WndProc(hwnd,msg,wParam,lParam);\r\n}\r\n<commit_msg>Minimize fullscreen window on focus loss.<commit_after>\/\/ DXGL\r\n\/\/ Copyright (C) 2012 William Feely\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., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA\r\n\r\n#include \"common.h\"\r\n#include \"glDirectDraw.h\"\r\n#include \"glRenderWindow.h\"\r\n#include \"ddraw.h\"\r\n\r\n\r\nWNDCLASSEXA wndclass;\r\nbool wndclasscreated = false;\r\n#ifdef _DEBUG\r\nbool hotkeyregistered = false;\r\n#endif\r\n\r\nconst TCHAR *wndprop = _T(\"DXGLWndProc\");\r\n\r\nLRESULT CALLBACK DXGLWndHookProc(HWND hWnd, UINT uMsg, WPARAM wParam, LPARAM lParam);\r\nvoid InstallDXGLHook(HWND hWnd)\r\n{\r\n\tif (GetProp(hWnd, wndprop)) return;\r\n\tSetProp(hWnd, wndprop, (HANDLE)GetWindowLongPtr(hWnd, GWLP_WNDPROC));\r\n\tSetWindowLongPtr(hWnd, GWLP_WNDPROC, (LONG_PTR)DXGLWndHookProc);\r\n}\r\nvoid UninstallDXGLHook(HWND hWnd)\r\n{\r\n\tif (!GetProp(hWnd, wndprop)) return;\r\n\tSetWindowLongPtr(hWnd, GWLP_WNDPROC, (LONG_PTR)GetProp(hWnd, wndprop));\r\n\tRemoveProp(hWnd, wndprop);\r\n}\r\nLRESULT CALLBACK DXGLWndHookProc(HWND hWnd, UINT uMsg, WPARAM wParam, LPARAM lParam)\r\n{\r\n\tWNDPROC parentproc = (WNDPROC)GetProp(hWnd, wndprop);\r\n\tswitch (uMsg)\r\n\t{\r\n\tcase WM_DESTROY:\r\n\t\tUninstallDXGLHook(hWnd);\r\n\t\tbreak;\r\n\tcase WM_ACTIVATEAPP:\r\n\t\tif (!wParam) ShowWindow(hWnd, SW_MINIMIZE);\r\n\t\tbreak;\r\n\t}\r\n\treturn parentproc(hWnd,uMsg,wParam,lParam);\r\n}\r\n\r\nvoid WaitForObjectAndMessages(HANDLE object)\r\n{\r\n\tMSG Msg;\r\n\twhile(1)\r\n\t{\r\n\t\tswitch(MsgWaitForMultipleObjects(1,&object,FALSE,INFINITE,QS_ALLINPUT))\r\n\t\t{\r\n\t\tcase WAIT_OBJECT_0:\r\n\t\t\treturn;\r\n\t\tcase WAIT_OBJECT_0+1:\r\n\t\t\twhile(PeekMessage(&Msg,NULL,0,0,PM_REMOVE))\r\n\t\t\t{\r\n\t\t\t\tTranslateMessage(&Msg);\r\n\t\t\t\tDispatchMessage(&Msg);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n}\r\n\r\nglRenderWindow::glRenderWindow(int width, int height, bool fullscreen, HWND parent, glDirectDraw7 *glDD7, bool devwnd)\r\n{\r\n\tddInterface = glDD7;\r\n\tthis->width = width;\r\n\tthis->height = height;\r\n\tthis->fullscreen = fullscreen;\r\n\tthis->device = devwnd;\r\n\thParentWnd = parent;\r\n\tReadyEvent = CreateEvent(NULL,false,false,NULL);\r\n\thThread = CreateThread(NULL,0,ThreadEntry,this,0,NULL);\r\n\tWaitForObjectAndMessages(ReadyEvent);\r\n\tCloseHandle(ReadyEvent);\r\n\tReadyEvent = NULL;\r\n}\r\n\r\nDWORD WINAPI glRenderWindow::ThreadEntry(void *entry)\r\n{\r\n\treturn ((glRenderWindow*)entry)->_Entry();\r\n}\r\n\r\nDWORD glRenderWindow::_Entry()\r\n{\r\n\tchar *windowname;\r\n\tif (device) windowname = \"DirectDrawDeviceWnd\";\r\n\telse windowname = \"Renderer\";\r\n    MSG Msg;\r\n\tif(!wndclasscreated)\r\n\t{\r\n\t\twndclass.cbSize = sizeof(WNDCLASSEXA);\r\n\t\twndclass.style = 0;\r\n\t\twndclass.lpfnWndProc = RenderWndProc;\r\n\t\twndclass.cbClsExtra = 0;\r\n\t\twndclass.cbWndExtra = 0;\r\n\t\twndclass.hInstance = (HINSTANCE)GetModuleHandle(NULL);\r\n\t\twndclass.hIcon = NULL;\r\n\t\twndclass.hCursor = NULL;\r\n\t\twndclass.hbrBackground = NULL;\r\n\t\twndclass.lpszMenuName = NULL;\r\n\t\twndclass.lpszClassName = \"DirectDrawDeviceWnd\";\r\n\t\twndclass.hIconSm = NULL;\r\n\t\tRegisterClassExA(&wndclass);\r\n\t\twndclasscreated = true;\r\n\t}\r\n\tRECT rectRender;\r\n\tGetClientRect(hParentWnd,&rectRender);\r\n\tdead = false;\r\n\tif(hParentWnd)\r\n\t{\r\n\t\thWnd = CreateWindowA(\"DirectDrawDeviceWnd\",windowname,WS_CHILD|WS_VISIBLE,0,0,rectRender.right - rectRender.left,\r\n\t\t\trectRender.bottom - rectRender.top,hParentWnd,NULL,wndclass.hInstance,this);\r\n\t\tSetWindowPos(hWnd,HWND_TOP,0,0,rectRender.right,rectRender.bottom,SWP_SHOWWINDOW);\r\n\t\tif (fullscreen) InstallDXGLHook(hParentWnd);\r\n\t}\r\n\telse\r\n\t{\r\n\t\twidth = GetSystemMetrics(SM_CXSCREEN);\r\n\t\theight = GetSystemMetrics(SM_CYSCREEN);\r\n\t\thWnd = CreateWindowExA(WS_EX_TOOLWINDOW|WS_EX_LAYERED|WS_EX_TRANSPARENT|WS_EX_TOPMOST,\r\n\t\t\t\"DirectDrawDeviceWnd\",windowname,WS_POPUP,0,0,width,height,0,0,NULL,this);\r\n\t\tSetWindowPos(hWnd,HWND_TOP,0,0,width,height,SWP_SHOWWINDOW|SWP_NOACTIVATE);\r\n\t}\r\n\t#ifdef _DEBUG\r\n\tif(RegisterHotKey(hWnd,1,MOD_CONTROL,VK_CANCEL)) hotkeyregistered = true;\r\n\telse\r\n\t{\r\n\t\tTRACE_STRING(\"Failed to register hotkey.\\n\");\r\n\t\tBeep(120, 1000);\r\n\t}\r\n\t#endif\r\n\tSetEvent(ReadyEvent);\r\n\twhile((GetMessage(&Msg, NULL, 0, 0) > 0) && !dead)\r\n\t{\r\n\t\tTranslateMessage(&Msg);\r\n\t\tDispatchMessage(&Msg);\r\n\t}\r\n\treturn 0;\r\n}\r\n\r\nglRenderWindow::~glRenderWindow()\r\n{\r\n\t#ifdef _DEBUG\r\n\tif(hotkeyregistered) UnregisterHotKey(hWnd,1);\r\n\t#endif\r\n\tSendMessage(hWnd,WM_CLOSE,0,0);\r\n\tWaitForSingleObject(hThread,INFINITE);\r\n\tCloseHandle(hThread);\r\n}\r\n\r\n#ifdef _TRACE\r\nDWORD WINAPI BeepThread(void *unused)\r\n{\r\n\tBeep(3600,150);\r\n\treturn 0;\r\n}\r\n#endif\r\n\r\nLRESULT glRenderWindow::WndProc(HWND hwnd, UINT msg, WPARAM wParam, LPARAM lParam)\r\n{\r\n\tint oldx,oldy;\r\n\tfloat mulx, muly;\r\n\tint translatex, translatey;\r\n\tLPARAM newpos;\r\n\tHWND hParent;\r\n\tLONG sizes[6];\r\n\tHCURSOR cursor;\r\n\tswitch(msg)\r\n\t{\r\n\tcase WM_CREATE:\r\n\t\tSetWindowLongPtr(hwnd,GWLP_USERDATA,(LONG_PTR)this);\r\n\t\treturn 0;\r\n\tcase WM_SETCURSOR:\r\n\t\thParent = GetParent(hwnd);\r\n\t\tcursor = (HCURSOR)GetClassLong(hParent,GCL_HCURSOR);\r\n\t\tSetCursor(cursor);\r\n\t\treturn SendMessage(hParent,msg,wParam,lParam);\r\n\tcase WM_MOUSEMOVE:\r\n\tcase WM_LBUTTONDOWN:\r\n\tcase WM_LBUTTONUP:\r\n\tcase WM_LBUTTONDBLCLK:\r\n\tcase WM_RBUTTONDOWN:\r\n\tcase WM_RBUTTONUP:\r\n\tcase WM_RBUTTONDBLCLK:\r\n\tcase WM_MBUTTONDOWN:\r\n\tcase WM_MBUTTONUP:\r\n\tcase WM_MBUTTONDBLCLK:\r\n\tcase WM_MOUSEWHEEL:\r\n\tcase WM_XBUTTONDOWN:\r\n\tcase WM_XBUTTONUP:\r\n\tcase WM_XBUTTONDBLCLK:\r\n\tcase WM_MOUSEHWHEEL:\r\n\t\thParent = GetParent(hwnd);\r\n\t\tif((dxglcfg.scaler != 0) && ddInterface->GetFullscreen())\r\n\t\t{\r\n\t\t\toldx = LOWORD(lParam);\r\n\t\t\toldy = HIWORD(lParam);\r\n\t\t\tddInterface->GetSizes(sizes);\r\n\t\t\tmulx = (float)sizes[2] \/ (float)sizes[0];\r\n\t\t\tmuly = (float)sizes[3] \/ (float)sizes[1];\r\n\t\t\ttranslatex = (sizes[4]-sizes[0])\/2;\r\n\t\t\ttranslatey = (sizes[5]-sizes[1])\/2;\r\n\t\t\toldx -= translatex;\r\n\t\t\toldy -= translatey;\r\n\t\t\toldx = (int)((float)oldx * mulx);\r\n\t\t\toldy = (int)((float)oldy * muly);\r\n\t\t\tif(oldx < 0) oldx = 0;\r\n\t\t\tif(oldy < 0) oldy = 0;\r\n\t\t\tif(oldx >= sizes[2]) oldx = sizes[2]-1;\r\n\t\t\tif(oldy >= sizes[3]) oldy = sizes[3]-1;\r\n\t\t\tnewpos = oldx + (oldy << 16);\r\n\t\t\treturn SendMessage(hParent,msg,wParam,newpos);\r\n\t\t}\r\n\t\telse return SendMessage(hParent,msg,wParam,lParam);\r\n\tcase WM_CLOSE:\r\n\t\tif (fullscreen) UninstallDXGLHook(hParentWnd);\r\n\t\tDestroyWindow(hWnd);\r\n\t\treturn 0;\r\n\tcase WM_DESTROY:\r\n\t\tPostQuitMessage(0);\r\n\t\tdead = true;\r\n\t\treturn 0;\r\n\t#ifdef _DEBUG\r\n\tcase WM_HOTKEY:\r\n\t\t#ifdef _TRACE\r\n\t\ttrace_end = TRUE;\r\n\t\tCreateThread(NULL,0,BeepThread,NULL,0,NULL);\r\n\t\tUnregisterHotKey(hWnd,1);\r\n\t\thotkeyregistered = false;\r\n\t\t#else\r\n\t\tBeep(3600,150);\r\n\t\tDebugBreak();\r\n\t\t#endif\r\n\t#endif\r\n\tdefault:\r\n\t\treturn DefWindowProc(hwnd,msg,wParam,lParam);\r\n\t}\r\n\treturn 0;\r\n}\r\n\r\n\r\n\r\n\r\n\r\n\/\/ Render Window event handler\r\nLRESULT CALLBACK RenderWndProc(HWND hwnd, UINT msg, WPARAM wParam, LPARAM lParam)\r\n{\r\n\tglRenderWindow* instance = reinterpret_cast<glRenderWindow*>(GetWindowLongPtr(hwnd,GWLP_USERDATA));\r\n\tif(!instance)\r\n\t{\r\n\t\tif(msg == WM_CREATE)\r\n\t\t\tinstance = reinterpret_cast<glRenderWindow*>(*(LONG_PTR*)lParam);\r\n\t\telse return DefWindowProc(hwnd,msg,wParam,lParam);\r\n\t}\r\n\treturn instance->WndProc(hwnd,msg,wParam,lParam);\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Prediction: tmp disable pedestrian interaction model<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"OneDHeatForcingFunction.h\"\n\ntemplate<>\nInputParameters validParams<OneDHeatForcingFunction>()\n{\n  InputParameters params = validParams<Kernel>();\n  params.addRequiredParam<std::string>(\"fuel_type\", \"The type of the fuel (plate | cylinder)\");\n  params.addRequiredParam<Real>(\"power_fraction\", \"The fraction of power used\");\n  params.addRequiredCoupledVar(\"total_power\", \"Total reactor power\");\n  params.addParam<PostprocessorName>(\"fuel_volume\", \"The name of the postprocessor that computes fuel volume\");\n  params.addParam<FunctionName>(\"power_shape_function\", \"The name of the function that defines the power shape\");\n\n  return params;\n}\n\nOneDHeatForcingFunction::OneDHeatForcingFunction(const std::string & name, InputParameters parameters) :\n    Kernel(name, parameters),\n    _fuel_type(getParam<std::string>(\"fuel_type\")),\n    _power_fraction(getParam<Real>(\"power_fraction\")),\n    _total_power(coupledScalarValue(\"total_power\")),\n    _fuel_volume(getPostprocessorValue(getParam<PostprocessorName>(\"fuel_volume\"))),\n    _power_shape_function(getFunction(\"power_shape_function\"))\n{\n}\n\nOneDHeatForcingFunction::~OneDHeatForcingFunction()\n{\n}\n\nReal\nOneDHeatForcingFunction::computeQpResidual()\n{\n  Real power_density = _power_fraction * _total_power[0] \/ _fuel_volume;\n  Real local_power = power_density * _power_shape_function.value(_t, _q_point[_qp]);\n  return -local_power * _test[_i][_qp];\n}\n\n\n<commit_msg>Updated PostprocessorInterface to use for getPostprocessorValue and getPostprocessorValueByName Changed CompositeFunction to used FunctionName for Peacock dropdown Added Postprocessors to dropdown menus in Peacock (refs-#1903)<commit_after>#include \"OneDHeatForcingFunction.h\"\n\ntemplate<>\nInputParameters validParams<OneDHeatForcingFunction>()\n{\n  InputParameters params = validParams<Kernel>();\n  params.addRequiredParam<std::string>(\"fuel_type\", \"The type of the fuel (plate | cylinder)\");\n  params.addRequiredParam<Real>(\"power_fraction\", \"The fraction of power used\");\n  params.addRequiredCoupledVar(\"total_power\", \"Total reactor power\");\n  params.addParam<PostprocessorName>(\"fuel_volume\", \"The name of the postprocessor that computes fuel volume\");\n  params.addParam<FunctionName>(\"power_shape_function\", \"The name of the function that defines the power shape\");\n\n  return params;\n}\n\nOneDHeatForcingFunction::OneDHeatForcingFunction(const std::string & name, InputParameters parameters) :\n    Kernel(name, parameters),\n    _fuel_type(getParam<std::string>(\"fuel_type\")),\n    _power_fraction(getParam<Real>(\"power_fraction\")),\n    _total_power(coupledScalarValue(\"total_power\")),\n    _fuel_volume(getPostprocessorValue(\"fuel_volume\")),\n    _power_shape_function(getFunction(\"power_shape_function\"))\n{\n}\n\nOneDHeatForcingFunction::~OneDHeatForcingFunction()\n{\n}\n\nReal\nOneDHeatForcingFunction::computeQpResidual()\n{\n  Real power_density = _power_fraction * _total_power[0] \/ _fuel_volume;\n  Real local_power = power_density * _power_shape_function.value(_t, _q_point[_qp]);\n  return -local_power * _test[_i][_qp];\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************** <auto-copyright.pl BEGIN do not edit this line> **************\n *\n * VR Juggler is (C) Copyright 1998-2010 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., 59 Temple Place - Suite 330,\n * Boston, MA 02111-1307, USA.\n *\n *************** <auto-copyright.pl END do not edit this line> ***************\/\n\n#include <vrj\/vrjConfig.h>\n\n#include <string>\n#include <gmtl\/Math.h>\n#include <gmtl\/Vec.h>\n#include <gmtl\/Matrix.h>\n#include <gmtl\/MatrixOps.h>\n#include <gmtl\/Generate.h>\n#include <gmtl\/Xforms.h>\n\n#include <jccl\/Config\/ConfigElement.h>\n#include <gadget\/Type\/Position\/PositionUnitConversion.h>\n\n#include <vrj\/Kernel\/User.h>\n#include <vrj\/Util\/Debug.h>\n#include <vrj\/Display\/SurfaceProjection.h>\n#include <vrj\/Display\/TrackedSurfaceProjection.h>\n#include <vrj\/Display\/DisplayExceptions.h>\n#include <vrj\/Display\/SurfaceViewport.h>\n\n\nnamespace vrj\n{\n\nSurfaceViewport::SurfaceViewport()\n   : Viewport()\n   , mTracked(false)\n{\n   \/* Do nothing. *\/ ;\n}\n\nViewportPtr SurfaceViewport::create()\n{\n   return ViewportPtr(new SurfaceViewport());\n}\n\nSurfaceViewport::~SurfaceViewport()\n{\n   \/* Do nothing. *\/ ;\n}\n\nbool SurfaceViewport::config(jccl::ConfigElementPtr element)\n{\n   vprASSERT(element.get() != NULL);\n   vprASSERT(element->getID() == \"surface_viewport\");\n\n   \/\/ Call base class config\n   if ( ! Viewport::config(element) )\n   {\n      return false;\n   }\n\n   bool result(true);\n\n   mType = SURFACE;\n\n   \/\/ Read in the corners\n   mLLCorner.set(element->getProperty<float>(\"lower_left_corner\", 0),\n                 element->getProperty<float>(\"lower_left_corner\", 1),\n                 element->getProperty<float>(\"lower_left_corner\", 2));\n   mLRCorner.set(element->getProperty<float>(\"lower_right_corner\", 0),\n                 element->getProperty<float>(\"lower_right_corner\", 1),\n                 element->getProperty<float>(\"lower_right_corner\", 2));\n   mURCorner.set(element->getProperty<float>(\"upper_right_corner\", 0),\n                 element->getProperty<float>(\"upper_right_corner\", 1),\n                 element->getProperty<float>(\"upper_right_corner\", 2));\n   mULCorner.set(element->getProperty<float>(\"upper_left_corner\", 0),\n                 element->getProperty<float>(\"upper_left_corner\", 1),\n                 element->getProperty<float>(\"upper_left_corner\", 2));\n\n   \/\/ Calculate the rotation and the pts\n\/\/   calculateSurfaceRotation();\n\/\/   calculateCornersInBaseFrame();\n\n   \/\/ Get info about being tracked\n   mTracked = element->getProperty<bool>(\"tracked\");\n   if(mTracked)\n   {\n      mTrackerProxyName = element->getProperty<std::string>(\"tracker_proxy\");\n   }\n\n   \/\/ Create Projection objects\n   \/\/ NOTE: The -'s are because we are measuring distance to\n   \/\/  the left(bottom) which is opposite the normal axis direction\n   \/\/vjMatrix rot_inv;\n   \/\/rot_inv.invert(mSurfaceRotation);\n   SurfaceProjectionPtr left_proj;\n   SurfaceProjectionPtr right_proj;\n\n   if(!mTracked)\n   {\n      left_proj = SurfaceProjection::create(mLLCorner, mLRCorner, mURCorner,\n                                            mULCorner);\n      right_proj = SurfaceProjection::create(mLLCorner, mLRCorner, mURCorner,\n                                             mULCorner);\n   }\n   else\n   {\n      left_proj = TrackedSurfaceProjection::create(mLLCorner, mLRCorner,\n                                                   mURCorner, mULCorner,\n                                                   mTrackerProxyName);\n      right_proj = TrackedSurfaceProjection::create(mLLCorner, mLRCorner,\n                                                    mURCorner, mULCorner,\n                                                    mTrackerProxyName);\n   }\n\n   try\n   {\n      left_proj->validateCorners();\n      right_proj->validateCorners();\n\n      \/\/ NOTE: Even if the corner validation above failed, we still proceed with\n      \/\/ setting up mLeftProj and mRightProj. This is because other code is not\n      \/\/ written to handle the case of a viewport having no projections. This\n      \/\/ could definitely be improved.\n      mLeftProj  = left_proj;\n      mRightProj = right_proj;\n\n      \/\/ Configure the projections\n      mLeftProj->config(element);\n      mLeftProj->setEye(Projection::LEFT);\n      mLeftProj->setViewport(shared_from_this());\n\n      mRightProj->config(element);\n      mRightProj->setEye(Projection::RIGHT);\n      mRightProj->setViewport(shared_from_this());\n   }\n   catch (InvalidSurfaceException& ex)\n   {\n      vprDEBUG(vrjDBG_DISP_MGR, vprDBG_CRITICAL_LVL)\n         << clrOutBOLD(clrRED, \"ERROR\")\n         << \": The surface defined by the viewport named\\n\" << vprDEBUG_FLUSH;\n      vprDEBUG_NEXT(vrjDBG_DISP_MGR, vprDBG_CRITICAL_LVL)\n         << \"       '\" << element->getName() << \"' is invalid!\\n\"\n         << vprDEBUG_FLUSH;\n      vprDEBUG_NEXT(vrjDBG_DISP_MGR, vprDBG_CRITICAL_LVL)\n         << ex.what() << std::endl << vprDEBUG_FLUSH;\n\n      result = false;\n   }\n\n   return result;\n}\n\nvoid SurfaceViewport::updateProjections(const float positionScale)\n{\n   gmtl::Matrix44f left_eye_pos, right_eye_pos;     \/\/ NOTE: Eye coord system is -z forward, x-right, y-up\n\n   \/\/ -- Calculate Eye Positions -- \/\/\n   gmtl::Matrix44f cur_head_pos = mUser->getHeadPosProxy()->getData(positionScale);\n   \/*\n   Coord  head_coord(cur_head_pos);       \/\/ Create a user readable version\n\n   vprDEBUG(vprDBG_ALL, vprDBG_HVERB_LVL)\n      << \"vjDisplay::updateProjections: Getting head position\" << std::endl\n      << vprDEBUG_FLUSH;\n   vprDEBUG(vprDBG_ALL, vprDBG_HVERB_LVL) << \"\\tHeadPos:\" << head_coord.pos << \"\\tHeadOr:\"\n                        << head_coord.orient << std::endl << vprDEBUG_FLUSH;\n                        *\/\n\n   \/\/ Compute location of left and right eyes\n   \/\/float interocularDist = 2.75f\/12.0f;\n   float interocular_dist = mUser->getInterocularDistance();\n   interocular_dist *= positionScale;              \/\/ Scale eye separation\n   float eye_offset = interocular_dist\/2.0f;      \/\/ Distance to move eye\n\n   left_eye_pos = cur_head_pos * gmtl::makeTrans<gmtl::Matrix44f>(gmtl::Vec3f( -eye_offset, 0, 0));\n   right_eye_pos = cur_head_pos * gmtl::makeTrans<gmtl::Matrix44f>(gmtl::Vec3f(eye_offset, 0, 0));\n\n   mLeftProj->calcViewMatrix(left_eye_pos, positionScale);\n   mRightProj->calcViewMatrix(right_eye_pos, positionScale);\n}\n\nstd::ostream& SurfaceViewport::outStream(std::ostream& out,\n                                         const unsigned int indentLevel)\n{\n   Viewport::outStream(out, indentLevel);\n   out << std::endl;\n\n   const std::string indent_text(indentLevel, ' ');\n\n   \/*\n   out << \"LL: \" << mLLCorner << \", LR: \" << mLRCorner\n       << \", UR: \" << mURCorner << \", UL:\" << mULCorner << std::endl;\n   out << \"surfRot: \\n\" << mSurfaceRotation << std::endl;\n   *\/\n   if ( mView == vrj::Viewport::LEFT_EYE || mView == vrj::Viewport::STEREO )\n   {\n      out << indent_text << \"Left projection:\\n\";\n      mLeftProj->outStream(out, indentLevel + 2);\n      out << std::endl;\n   }\n   if ( mView == vrj::Viewport::RIGHT_EYE || mView == vrj::Viewport::STEREO )\n   {\n      out << indent_text << \"Right projection:\\n\";\n      mRightProj->outStream(out, indentLevel + 2);\n      out << std::endl;\n   }\n\n   return out;\n}\n\n}\n<commit_msg>Only calculate the projection matrices that are needed based on the current eye configuration. Use const values\/objects where possible. This is based on a patch submitted by Doug McCorkle.<commit_after>\/*************** <auto-copyright.pl BEGIN do not edit this line> **************\n *\n * VR Juggler is (C) Copyright 1998-2010 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., 59 Temple Place - Suite 330,\n * Boston, MA 02111-1307, USA.\n *\n *************** <auto-copyright.pl END do not edit this line> ***************\/\n\n#include <vrj\/vrjConfig.h>\n\n#include <string>\n#include <gmtl\/Math.h>\n#include <gmtl\/Vec.h>\n#include <gmtl\/Matrix.h>\n#include <gmtl\/MatrixOps.h>\n#include <gmtl\/Generate.h>\n#include <gmtl\/Xforms.h>\n\n#include <jccl\/Config\/ConfigElement.h>\n#include <gadget\/Type\/Position\/PositionUnitConversion.h>\n\n#include <vrj\/Kernel\/User.h>\n#include <vrj\/Util\/Debug.h>\n#include <vrj\/Display\/SurfaceProjection.h>\n#include <vrj\/Display\/TrackedSurfaceProjection.h>\n#include <vrj\/Display\/DisplayExceptions.h>\n#include <vrj\/Display\/SurfaceViewport.h>\n\n\nnamespace vrj\n{\n\nSurfaceViewport::SurfaceViewport()\n   : Viewport()\n   , mTracked(false)\n{\n   \/* Do nothing. *\/ ;\n}\n\nViewportPtr SurfaceViewport::create()\n{\n   return ViewportPtr(new SurfaceViewport());\n}\n\nSurfaceViewport::~SurfaceViewport()\n{\n   \/* Do nothing. *\/ ;\n}\n\nbool SurfaceViewport::config(jccl::ConfigElementPtr element)\n{\n   vprASSERT(element.get() != NULL);\n   vprASSERT(element->getID() == \"surface_viewport\");\n\n   \/\/ Call base class config\n   if ( ! Viewport::config(element) )\n   {\n      return false;\n   }\n\n   bool result(true);\n\n   mType = SURFACE;\n\n   \/\/ Read in the corners\n   mLLCorner.set(element->getProperty<float>(\"lower_left_corner\", 0),\n                 element->getProperty<float>(\"lower_left_corner\", 1),\n                 element->getProperty<float>(\"lower_left_corner\", 2));\n   mLRCorner.set(element->getProperty<float>(\"lower_right_corner\", 0),\n                 element->getProperty<float>(\"lower_right_corner\", 1),\n                 element->getProperty<float>(\"lower_right_corner\", 2));\n   mURCorner.set(element->getProperty<float>(\"upper_right_corner\", 0),\n                 element->getProperty<float>(\"upper_right_corner\", 1),\n                 element->getProperty<float>(\"upper_right_corner\", 2));\n   mULCorner.set(element->getProperty<float>(\"upper_left_corner\", 0),\n                 element->getProperty<float>(\"upper_left_corner\", 1),\n                 element->getProperty<float>(\"upper_left_corner\", 2));\n\n   \/\/ Calculate the rotation and the pts\n\/\/   calculateSurfaceRotation();\n\/\/   calculateCornersInBaseFrame();\n\n   \/\/ Get info about being tracked\n   mTracked = element->getProperty<bool>(\"tracked\");\n   if(mTracked)\n   {\n      mTrackerProxyName = element->getProperty<std::string>(\"tracker_proxy\");\n   }\n\n   \/\/ Create Projection objects\n   \/\/ NOTE: The -'s are because we are measuring distance to\n   \/\/  the left(bottom) which is opposite the normal axis direction\n   \/\/vjMatrix rot_inv;\n   \/\/rot_inv.invert(mSurfaceRotation);\n   SurfaceProjectionPtr left_proj;\n   SurfaceProjectionPtr right_proj;\n\n   if(!mTracked)\n   {\n      left_proj = SurfaceProjection::create(mLLCorner, mLRCorner, mURCorner,\n                                            mULCorner);\n      right_proj = SurfaceProjection::create(mLLCorner, mLRCorner, mURCorner,\n                                             mULCorner);\n   }\n   else\n   {\n      left_proj = TrackedSurfaceProjection::create(mLLCorner, mLRCorner,\n                                                   mURCorner, mULCorner,\n                                                   mTrackerProxyName);\n      right_proj = TrackedSurfaceProjection::create(mLLCorner, mLRCorner,\n                                                    mURCorner, mULCorner,\n                                                    mTrackerProxyName);\n   }\n\n   try\n   {\n      left_proj->validateCorners();\n      right_proj->validateCorners();\n\n      \/\/ NOTE: Even if the corner validation above failed, we still proceed with\n      \/\/ setting up mLeftProj and mRightProj. This is because other code is not\n      \/\/ written to handle the case of a viewport having no projections. This\n      \/\/ could definitely be improved.\n      mLeftProj  = left_proj;\n      mRightProj = right_proj;\n\n      \/\/ Configure the projections\n      mLeftProj->config(element);\n      mLeftProj->setEye(Projection::LEFT);\n      mLeftProj->setViewport(shared_from_this());\n\n      mRightProj->config(element);\n      mRightProj->setEye(Projection::RIGHT);\n      mRightProj->setViewport(shared_from_this());\n   }\n   catch (InvalidSurfaceException& ex)\n   {\n      vprDEBUG(vrjDBG_DISP_MGR, vprDBG_CRITICAL_LVL)\n         << clrOutBOLD(clrRED, \"ERROR\")\n         << \": The surface defined by the viewport named\\n\" << vprDEBUG_FLUSH;\n      vprDEBUG_NEXT(vrjDBG_DISP_MGR, vprDBG_CRITICAL_LVL)\n         << \"       '\" << element->getName() << \"' is invalid!\\n\"\n         << vprDEBUG_FLUSH;\n      vprDEBUG_NEXT(vrjDBG_DISP_MGR, vprDBG_CRITICAL_LVL)\n         << ex.what() << std::endl << vprDEBUG_FLUSH;\n\n      result = false;\n   }\n\n   return result;\n}\n\nvoid SurfaceViewport::updateProjections(const float positionScale)\n{\n   \/\/ -- Calculate Eye Positions -- \/\/\n   const gmtl::Matrix44f cur_head_pos(\n      mUser->getHeadPosProxy()->getData(positionScale)\n   );\n   \/*\n   Coord  head_coord(cur_head_pos);       \/\/ Create a user readable version\n\n   vprDEBUG(vprDBG_ALL, vprDBG_HVERB_LVL)\n      << \"vjDisplay::updateProjections: Getting head position\" << std::endl\n      << vprDEBUG_FLUSH;\n   vprDEBUG(vprDBG_ALL, vprDBG_HVERB_LVL) << \"\\tHeadPos:\" << head_coord.pos << \"\\tHeadOr:\"\n                        << head_coord.orient << std::endl << vprDEBUG_FLUSH;\n                        *\/\n\n   \/\/ Compute location of left and right eyes\n   \/\/float interocularDist = 2.75f\/12.0f;\n   float interocular_dist = mUser->getInterocularDistance();\n   interocular_dist *= positionScale;              \/\/ Scale eye separation\n\n   \/\/ Distance to move eye.\n   const float eye_offset(interocular_dist * 0.5f);\n\n   \/\/ NOTE: Eye coord system is -z forward, x-right, y-up\n\n   if (Viewport::LEFT_EYE == mView || Viewport::STEREO == mView)\n   {\n      const gmtl::Matrix44f left_eye_pos(\n         cur_head_pos *\n            gmtl::makeTrans<gmtl::Matrix44f>(gmtl::Vec3f(-eye_offset, 0, 0))\n      );\n      mLeftProj->calcViewMatrix(left_eye_pos, positionScale);\n   }\n\n   if (Viewport::RIGHT_EYE == mView || Viewport::STEREO == mView)\n   {\n      const gmtl::Matrix44f right_eye_pos(\n         cur_head_pos * \n            gmtl::makeTrans<gmtl::Matrix44f>(gmtl::Vec3f(eye_offset, 0, 0))\n      );\n      mRightProj->calcViewMatrix(right_eye_pos, positionScale);\n   }\n}\n\nstd::ostream& SurfaceViewport::outStream(std::ostream& out,\n                                         const unsigned int indentLevel)\n{\n   Viewport::outStream(out, indentLevel);\n   out << std::endl;\n\n   const std::string indent_text(indentLevel, ' ');\n\n   \/*\n   out << \"LL: \" << mLLCorner << \", LR: \" << mLRCorner\n       << \", UR: \" << mURCorner << \", UL:\" << mULCorner << std::endl;\n   out << \"surfRot: \\n\" << mSurfaceRotation << std::endl;\n   *\/\n   if ( mView == vrj::Viewport::LEFT_EYE || mView == vrj::Viewport::STEREO )\n   {\n      out << indent_text << \"Left projection:\\n\";\n      mLeftProj->outStream(out, indentLevel + 2);\n      out << std::endl;\n   }\n   if ( mView == vrj::Viewport::RIGHT_EYE || mView == vrj::Viewport::STEREO )\n   {\n      out << indent_text << \"Right projection:\\n\";\n      mRightProj->outStream(out, indentLevel + 2);\n      out << std::endl;\n   }\n\n   return out;\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>FOGL-1977: unit tests added<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>Restructure t_hack_generator<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/                         PelotonDB\n\/\/\n\/\/ transaction_test.cpp\n\/\/\n\/\/ Identification: tests\/concurrency\/transaction_test.cpp\n\/\/\n\/\/ Copyright (c) 2015, Carnegie Mellon University Database Group\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"harness.h\"\n#include \"concurrency\/transaction_tests_util.h\"\n\nnamespace peloton {\n\nnamespace test {\n\n\/\/===--------------------------------------------------------------------===\/\/\n\/\/ Transaction Tests\n\/\/===--------------------------------------------------------------------===\/\/\n\nclass TransactionTests : public PelotonTest {};\n\n\/\/ Execute a schedule, the result for any read will be recorded in\n\/\/ schedule->results\nvoid ExecuteSchedule(concurrency::TransactionManager *txn_manager,\n                     storage::DataTable *table, TransactionSchedule *schedule) {\n  \/\/ Sleep for the first operation, this gives the opportunity to schedule\n  \/\/ the start time of a txn\n  int last_time = schedule->times[0];\n  std::this_thread::sleep_for(std::chrono::milliseconds(last_time));\n\n  auto transaction = txn_manager->BeginTransaction();\n  for (int i = 0; i < (int)schedule->operations.size(); i++) {\n    \/\/ Sleep milliseconds\n    std::this_thread::sleep_for(\n        std::chrono::milliseconds(schedule->times[i] - last_time));\n    last_time = schedule->times[i];\n\n    \/\/ Prepare data for operation\n    txn_op_t op = schedule->operations[i].op;\n    int id = schedule->operations[i].id;\n    int value = schedule->operations[i].value;\n\n    \/\/ Execute the operation\n    switch (op) {\n      case TXN_OP_INSERT: {\n        LOG_TRACE(\"Execute Insert\");\n        TransactionTestsUtil::ExecuteInsert(transaction, table, id, value);\n        break;\n      }\n      case TXN_OP_READ: {\n        LOG_TRACE(\"Execute Read\");\n        int result = TransactionTestsUtil::ExecuteRead(transaction, table, id);\n        schedule->results.push_back(result);\n        break;\n      }\n      case TXN_OP_DELETE: {\n        LOG_TRACE(\"Execute Delete\");\n        TransactionTestsUtil::ExecuteDelete(transaction, table, id);\n        break;\n      }\n      case TXN_OP_UPDATE: {\n        LOG_TRACE(\"Execute Update\");\n        TransactionTestsUtil::ExecuteUpdate(transaction, table, id, value);\n        break;\n      }\n      case TXN_OP_SCAN: {\n        LOG_TRACE(\"Execute Scan\");\n        TransactionTestsUtil::ExecuteScan(transaction, schedule->results, table,\n                                          id);\n        break;\n      }\n      case TXN_OP_ABORT: {\n        LOG_TRACE(\"Abort\");\n        \/\/ Assert last operation\n        assert(i == (int)schedule->operations.size() - 1);\n        break;\n      }\n      case TXN_OP_NOTHING: {\n        LOG_TRACE(\"Do nothing\");\n        \/\/ Do nothing\n        break;\n      }\n    }\n  }\n\n  if (schedule->operations.rbegin()->op == TXN_OP_ABORT)\n    schedule->txn_result = txn_manager->AbortTransaction();\n  else {\n    schedule->txn_result = txn_manager->CommitTransaction();\n  }\n\n  LOG_TRACE(\"Txn finished\");\n}\n\nvoid ThreadExecuteSchedule(concurrency::TransactionManager *txn_manager,\n                           storage::DataTable *table,\n                           TransactionSchedules *schedules) {\n  int next_schedule = schedules->next_sched.fetch_add(1);\n  auto schedule = schedules->schedules[next_schedule];\n  ExecuteSchedule(txn_manager, table, schedule);\n}\n\nvoid TransactionTest(concurrency::TransactionManager *txn_manager) {\n  uint64_t thread_id = TestingHarness::GetInstance().GetThreadId();\n\n  for (oid_t txn_itr = 1; txn_itr <= 100; txn_itr++) {\n    txn_manager->BeginTransaction();\n    if (thread_id % 2 == 0) {\n      std::chrono::microseconds sleep_time(1);\n      std::this_thread::sleep_for(sleep_time);\n    }\n\n    if (txn_itr % 50 != 0) {\n      txn_manager->CommitTransaction();\n    } else {\n      txn_manager->AbortTransaction();\n    }\n  }\n}\n\nvoid DirtyWriteTest() {\n  auto &txn_manager = concurrency::TransactionManagerFactory::GetInstance();\n  std::unique_ptr<storage::DataTable> table(\n      TransactionTestsUtil::CreateTable());\n  TransactionSchedules schedules;\n\n  \/\/ Update (0, ?) to (0, 1) at 0 ms, commit at 1000 ms\n  TransactionSchedule schedule1;\n  schedule1.AddUpdate(0, 1, 0);\n  schedule1.AddDoNothing(1000);\n  \/\/ Update (0, ?) to (0, 2) at 500 ms\n  TransactionSchedule schedule2;\n  schedule2.AddUpdate(0, 2, 500);\n  \/\/ Read (0, ?) at 1500 ms, should read 1\n  TransactionSchedule schedule3;\n  schedule3.AddRead(0, 1500);\n\n  schedules.AddSchedule(&schedule1);\n  schedules.AddSchedule(&schedule2);\n  schedules.AddSchedule(&schedule3);\n\n  LaunchParallelTest(3, ThreadExecuteSchedule, &txn_manager, table.get(),\n                     &schedules);\n\n  EXPECT_EQ(1, schedule3.results[0]);\n  \/\/ When to use RESULT_FAILURE, when RESULT_ABORTED\n  EXPECT_EQ(RESULT_ABORTED, schedule2.txn_result);\n}\n\nvoid DirtyReadTest() {\n  auto &txn_manager = concurrency::TransactionManagerFactory::GetInstance();\n  std::unique_ptr<storage::DataTable> table(\n      TransactionTestsUtil::CreateTable());\n\n  TransactionSchedules schedules;\n\n  \/\/ Insert (1, 1) at 500 ms, commit at 1500 ms\n  TransactionSchedule schedule1;\n  schedule1.AddInsert(10, 1, 500);\n  schedule1.AddDoNothing(1500);\n  \/\/ Start transaction at 0 ms, but read at 2000 ms, should read nothing\n  TransactionSchedule schedule2;\n  schedule2.AddDoNothing(0);\n  schedule2.AddRead(10, 2000);\n  \/\/ Read 1 at 1000 ms, should not read the uncommitted version\n  TransactionSchedule schedule3;\n  schedule3.AddRead(10, 1000);\n  \/\/ Read 1 at 2000 ms, should read the committed version\n  TransactionSchedule schedule4;\n  schedule4.AddRead(10, 2000);\n\n  schedules.AddSchedule(&schedule1);\n  schedules.AddSchedule(&schedule2);\n  schedules.AddSchedule(&schedule3);\n  schedules.AddSchedule(&schedule4);\n\n  LaunchParallelTest(4, ThreadExecuteSchedule, &txn_manager, table.get(),\n                     &schedules);\n\n  EXPECT_EQ(-1, schedule2.results[0]);\n  EXPECT_EQ(-1, schedule3.results[0]);\n  EXPECT_EQ(1, schedule4.results[0]);\n}\n\nvoid FuzzyReadTest() {\n  auto &txn_manager = concurrency::TransactionManagerFactory::GetInstance();\n  std::unique_ptr<storage::DataTable> table(\n      TransactionTestsUtil::CreateTable());\n\n  TransactionSchedules schedules;\n\n  \/\/ T1 Read at 0 ms, T2 update at 500 ms, T1 commit at 1000 ms, T1 should fail\n  TransactionSchedule schedule1;\n  schedule1.AddRead(0, 0);\n  schedule1.AddDoNothing(1000);\n  TransactionSchedule schedule2;\n  schedule2.AddUpdate(0, 1, 500);\n\n  \/\/ T1 Read at 0 ms, T2 delete at 500 ms, T1 commit at 1000 ms, T1 should fail\n  TransactionSchedule schedule3;\n  schedule3.AddRead(1, 0);\n  schedule3.AddDoNothing(1000);\n  TransactionSchedule schedule4;\n  schedule4.AddDelete(1, 500);\n\n  schedules.AddSchedule(&schedule1);\n  schedules.AddSchedule(&schedule2);\n  schedules.AddSchedule(&schedule3);\n  schedules.AddSchedule(&schedule4);\n\n  LaunchParallelTest(4, ThreadExecuteSchedule, &txn_manager, table.get(),\n                     &schedules);\n\n  EXPECT_EQ(RESULT_SUCCESS, schedule2.txn_result);\n  EXPECT_EQ(RESULT_SUCCESS, schedule4.txn_result);\n  EXPECT_EQ(RESULT_ABORTED, schedule1.txn_result);\n  EXPECT_EQ(RESULT_ABORTED, schedule3.txn_result);\n}\n\nvoid PhantomTest() {\n  auto &txn_manager = concurrency::TransactionManagerFactory::GetInstance();\n  std::unique_ptr<storage::DataTable> table(\n      TransactionTestsUtil::CreateTable());\n\n  TransactionSchedules schedules;\n  \/\/ Begin Scan for id>=1 at 0 ms, Insert (5, 0) at 500 ms, Commit at 1000 ms,\n  \/\/ should fail\n  TransactionSchedule schedule1;\n  schedule1.AddScan(0, 0);\n  schedule1.AddDoNothing(1000);\n  TransactionSchedule schedule2;\n  schedule2.AddInsert(5, 0, 500);\n  \/\/ Another txn scan again, should see the new val\n  TransactionSchedule schedule3;\n  schedule3.AddScan(0, 1500);\n  TransactionSchedule schedule4;\n  schedule4.AddScan(0, 0);\n\n  schedules.AddSchedule(&schedule1);\n  schedules.AddSchedule(&schedule2);\n  schedules.AddSchedule(&schedule3);\n  schedules.AddSchedule(&schedule4);\n\n  LaunchParallelTest(4, ThreadExecuteSchedule, &txn_manager, table.get(),\n                     &schedules);\n\n  EXPECT_EQ(RESULT_ABORTED, schedule1.txn_result);\n  EXPECT_EQ(RESULT_SUCCESS, schedule1.txn_result);\n  EXPECT_EQ(11, schedule3.results.size());\n  EXPECT_EQ(10, schedule4.results.size());\n}\n\nTEST_F(TransactionTests, TransactionTest) {\n  auto &txn_manager = concurrency::TransactionManagerFactory::GetInstance();\n\n  LaunchParallelTest(8, TransactionTest, &txn_manager);\n\n  std::cout << \"next Commit Id :: \" << txn_manager.GetNextCommitId() << \"\\n\";\n}\n\nTEST_F(TransactionTests, AbortTest) {\n  auto &txn_manager = concurrency::TransactionManagerFactory::GetInstance();\n  std::unique_ptr<storage::DataTable> table(\n      TransactionTestsUtil::CreateTable());\n  TransactionSchedules schedules;\n  TransactionSchedule schedule1;\n  TransactionSchedule schedule2;\n  \/\/ Schedule one thread to update and abort, another thread to read afterwards\n  schedule1.AddUpdate(0, 100, 0);\n  schedule1.AddAbort(50);\n  schedule2.AddRead(0, 100);\n  schedules.AddSchedule(&schedule1);\n  schedules.AddSchedule(&schedule2);\n  LaunchParallelTest(2, ThreadExecuteSchedule, &txn_manager, table.get(),\n                     &schedules);\n\n  EXPECT_EQ(schedule2.results[0], 0);\n}\n\nTEST_F(TransactionTests, SerializableTest) {\n  DirtyWriteTest();\n  DirtyReadTest();\n  FuzzyReadTest();\n  PhantomTest();\n}\n\n}  \/\/ End test namespace\n}  \/\/ End peloton namespace\n<commit_msg>don't test phantom<commit_after>\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/                         PelotonDB\n\/\/\n\/\/ transaction_test.cpp\n\/\/\n\/\/ Identification: tests\/concurrency\/transaction_test.cpp\n\/\/\n\/\/ Copyright (c) 2015, Carnegie Mellon University Database Group\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"harness.h\"\n#include \"concurrency\/transaction_tests_util.h\"\n\nnamespace peloton {\n\nnamespace test {\n\n\/\/===--------------------------------------------------------------------===\/\/\n\/\/ Transaction Tests\n\/\/===--------------------------------------------------------------------===\/\/\n\nclass TransactionTests : public PelotonTest {};\n\n\/\/ Execute a schedule, the result for any read will be recorded in\n\/\/ schedule->results\nvoid ExecuteSchedule(concurrency::TransactionManager *txn_manager,\n                     storage::DataTable *table, TransactionSchedule *schedule) {\n  \/\/ Sleep for the first operation, this gives the opportunity to schedule\n  \/\/ the start time of a txn\n  int last_time = schedule->times[0];\n  std::this_thread::sleep_for(std::chrono::milliseconds(last_time));\n\n  auto transaction = txn_manager->BeginTransaction();\n  for (int i = 0; i < (int)schedule->operations.size(); i++) {\n    \/\/ Sleep milliseconds\n    std::this_thread::sleep_for(\n        std::chrono::milliseconds(schedule->times[i] - last_time));\n    last_time = schedule->times[i];\n\n    \/\/ Prepare data for operation\n    txn_op_t op = schedule->operations[i].op;\n    int id = schedule->operations[i].id;\n    int value = schedule->operations[i].value;\n\n    \/\/ Execute the operation\n    switch (op) {\n      case TXN_OP_INSERT: {\n        LOG_TRACE(\"Execute Insert\");\n        TransactionTestsUtil::ExecuteInsert(transaction, table, id, value);\n        break;\n      }\n      case TXN_OP_READ: {\n        LOG_TRACE(\"Execute Read\");\n        int result = TransactionTestsUtil::ExecuteRead(transaction, table, id);\n        schedule->results.push_back(result);\n        break;\n      }\n      case TXN_OP_DELETE: {\n        LOG_TRACE(\"Execute Delete\");\n        TransactionTestsUtil::ExecuteDelete(transaction, table, id);\n        break;\n      }\n      case TXN_OP_UPDATE: {\n        LOG_TRACE(\"Execute Update\");\n        TransactionTestsUtil::ExecuteUpdate(transaction, table, id, value);\n        break;\n      }\n      case TXN_OP_SCAN: {\n        LOG_TRACE(\"Execute Scan\");\n        TransactionTestsUtil::ExecuteScan(transaction, schedule->results, table,\n                                          id);\n        break;\n      }\n      case TXN_OP_ABORT: {\n        LOG_TRACE(\"Abort\");\n        \/\/ Assert last operation\n        assert(i == (int)schedule->operations.size() - 1);\n        break;\n      }\n      case TXN_OP_NOTHING: {\n        LOG_TRACE(\"Do nothing\");\n        \/\/ Do nothing\n        break;\n      }\n    }\n  }\n\n  if (schedule->operations.rbegin()->op == TXN_OP_ABORT)\n    schedule->txn_result = txn_manager->AbortTransaction();\n  else {\n    schedule->txn_result = txn_manager->CommitTransaction();\n  }\n\n  LOG_TRACE(\"Txn finished\");\n}\n\nvoid ThreadExecuteSchedule(concurrency::TransactionManager *txn_manager,\n                           storage::DataTable *table,\n                           TransactionSchedules *schedules) {\n  int next_schedule = schedules->next_sched.fetch_add(1);\n  auto schedule = schedules->schedules[next_schedule];\n  ExecuteSchedule(txn_manager, table, schedule);\n}\n\nvoid TransactionTest(concurrency::TransactionManager *txn_manager) {\n  uint64_t thread_id = TestingHarness::GetInstance().GetThreadId();\n\n  for (oid_t txn_itr = 1; txn_itr <= 100; txn_itr++) {\n    txn_manager->BeginTransaction();\n    if (thread_id % 2 == 0) {\n      std::chrono::microseconds sleep_time(1);\n      std::this_thread::sleep_for(sleep_time);\n    }\n\n    if (txn_itr % 50 != 0) {\n      txn_manager->CommitTransaction();\n    } else {\n      txn_manager->AbortTransaction();\n    }\n  }\n}\n\nvoid DirtyWriteTest() {\n  auto &txn_manager = concurrency::TransactionManagerFactory::GetInstance();\n  std::unique_ptr<storage::DataTable> table(\n      TransactionTestsUtil::CreateTable());\n  TransactionSchedules schedules;\n\n  \/\/ Update (0, ?) to (0, 1) at 0 ms, commit at 1000 ms\n  TransactionSchedule schedule1;\n  schedule1.AddUpdate(0, 1, 0);\n  schedule1.AddDoNothing(1000);\n  \/\/ Update (0, ?) to (0, 2) at 500 ms\n  TransactionSchedule schedule2;\n  schedule2.AddUpdate(0, 2, 500);\n  \/\/ Read (0, ?) at 1500 ms, should read 1\n  TransactionSchedule schedule3;\n  schedule3.AddRead(0, 1500);\n\n  schedules.AddSchedule(&schedule1);\n  schedules.AddSchedule(&schedule2);\n  schedules.AddSchedule(&schedule3);\n\n  LaunchParallelTest(3, ThreadExecuteSchedule, &txn_manager, table.get(),\n                     &schedules);\n\n  EXPECT_EQ(1, schedule3.results[0]);\n  \/\/ When to use RESULT_FAILURE, when RESULT_ABORTED\n  EXPECT_EQ(RESULT_ABORTED, schedule2.txn_result);\n}\n\nvoid DirtyReadTest() {\n  auto &txn_manager = concurrency::TransactionManagerFactory::GetInstance();\n  std::unique_ptr<storage::DataTable> table(\n      TransactionTestsUtil::CreateTable());\n\n  TransactionSchedules schedules;\n\n  \/\/ Insert (1, 1) at 500 ms, commit at 1500 ms\n  TransactionSchedule schedule1;\n  schedule1.AddInsert(10, 1, 500);\n  schedule1.AddDoNothing(1500);\n  \/\/ Start transaction at 0 ms, but read at 2000 ms, should read nothing\n  TransactionSchedule schedule2;\n  schedule2.AddDoNothing(0);\n  schedule2.AddRead(10, 2000);\n  \/\/ Read 1 at 1000 ms, should not read the uncommitted version\n  TransactionSchedule schedule3;\n  schedule3.AddRead(10, 1000);\n  \/\/ Read 1 at 2000 ms, should read the committed version\n  TransactionSchedule schedule4;\n  schedule4.AddRead(10, 2000);\n\n  schedules.AddSchedule(&schedule1);\n  schedules.AddSchedule(&schedule2);\n  schedules.AddSchedule(&schedule3);\n  schedules.AddSchedule(&schedule4);\n\n  LaunchParallelTest(4, ThreadExecuteSchedule, &txn_manager, table.get(),\n                     &schedules);\n\n  EXPECT_EQ(-1, schedule2.results[0]);\n  EXPECT_EQ(-1, schedule3.results[0]);\n  EXPECT_EQ(1, schedule4.results[0]);\n}\n\nvoid FuzzyReadTest() {\n  auto &txn_manager = concurrency::TransactionManagerFactory::GetInstance();\n  std::unique_ptr<storage::DataTable> table(\n      TransactionTestsUtil::CreateTable());\n\n  TransactionSchedules schedules;\n\n  \/\/ T1 Read at 0 ms, T2 update at 500 ms, T1 commit at 1000 ms, T1 should fail\n  TransactionSchedule schedule1;\n  schedule1.AddRead(0, 0);\n  schedule1.AddDoNothing(1000);\n  TransactionSchedule schedule2;\n  schedule2.AddUpdate(0, 1, 500);\n\n  \/\/ T1 Read at 0 ms, T2 delete at 500 ms, T1 commit at 1000 ms, T1 should fail\n  TransactionSchedule schedule3;\n  schedule3.AddRead(1, 0);\n  schedule3.AddDoNothing(1000);\n  TransactionSchedule schedule4;\n  schedule4.AddDelete(1, 500);\n\n  schedules.AddSchedule(&schedule1);\n  schedules.AddSchedule(&schedule2);\n  schedules.AddSchedule(&schedule3);\n  schedules.AddSchedule(&schedule4);\n\n  LaunchParallelTest(4, ThreadExecuteSchedule, &txn_manager, table.get(),\n                     &schedules);\n\n  EXPECT_EQ(RESULT_SUCCESS, schedule2.txn_result);\n  EXPECT_EQ(RESULT_SUCCESS, schedule4.txn_result);\n  EXPECT_EQ(RESULT_ABORTED, schedule1.txn_result);\n  EXPECT_EQ(RESULT_ABORTED, schedule3.txn_result);\n}\n\nvoid PhantomTest() {\n  auto &txn_manager = concurrency::TransactionManagerFactory::GetInstance();\n  std::unique_ptr<storage::DataTable> table(\n      TransactionTestsUtil::CreateTable());\n\n  TransactionSchedules schedules;\n  \/\/ Begin Scan for id>=1 at 0 ms, Insert (5, 0) at 500 ms, Commit at 1000 ms,\n  \/\/ should fail\n  TransactionSchedule schedule1;\n  schedule1.AddScan(0, 0);\n  schedule1.AddDoNothing(1000);\n  TransactionSchedule schedule2;\n  schedule2.AddInsert(5, 0, 500);\n  \/\/ Another txn scan again, should see the new val\n  TransactionSchedule schedule3;\n  schedule3.AddScan(0, 1500);\n  TransactionSchedule schedule4;\n  schedule4.AddScan(0, 0);\n\n  schedules.AddSchedule(&schedule1);\n  schedules.AddSchedule(&schedule2);\n  schedules.AddSchedule(&schedule3);\n  schedules.AddSchedule(&schedule4);\n\n  LaunchParallelTest(4, ThreadExecuteSchedule, &txn_manager, table.get(),\n                     &schedules);\n\n  EXPECT_EQ(RESULT_ABORTED, schedule1.txn_result);\n  EXPECT_EQ(RESULT_SUCCESS, schedule1.txn_result);\n  EXPECT_EQ(11, schedule3.results.size());\n  EXPECT_EQ(10, schedule4.results.size());\n}\n\nTEST_F(TransactionTests, TransactionTest) {\n  auto &txn_manager = concurrency::TransactionManagerFactory::GetInstance();\n\n  LaunchParallelTest(8, TransactionTest, &txn_manager);\n\n  std::cout << \"next Commit Id :: \" << txn_manager.GetNextCommitId() << \"\\n\";\n}\n\nTEST_F(TransactionTests, AbortTest) {\n  auto &txn_manager = concurrency::TransactionManagerFactory::GetInstance();\n  std::unique_ptr<storage::DataTable> table(\n      TransactionTestsUtil::CreateTable());\n  TransactionSchedules schedules;\n  TransactionSchedule schedule1;\n  TransactionSchedule schedule2;\n  \/\/ Schedule one thread to update and abort, another thread to read afterwards\n  schedule1.AddUpdate(0, 100, 0);\n  schedule1.AddAbort(50);\n  schedule2.AddRead(0, 100);\n  schedules.AddSchedule(&schedule1);\n  schedules.AddSchedule(&schedule2);\n  LaunchParallelTest(2, ThreadExecuteSchedule, &txn_manager, table.get(),\n                     &schedules);\n\n  EXPECT_EQ(schedule2.results[0], 0);\n}\n\nTEST_F(TransactionTests, SerializableTest) {\n  DirtyWriteTest();\n  DirtyReadTest();\n  FuzzyReadTest();\n\/\/  PhantomTest();\n}\n\n}  \/\/ End test namespace\n}  \/\/ End peloton namespace\n<|endoftext|>"}
{"text":"<commit_before>\/\/ compilation on OSX\n\/\/ $ g++ -std=c++11 main.cpp -o main\n\n#include <iostream>\n#include <fstream>\n#include <vector>\n#include <map>\n#include <cmath>\n#include <future>\n\ntypedef std::string GameTitle;\ntypedef int GameTime;\ntypedef std::vector<GameTime> GameTimes;\ntypedef std::map< GameTitle, GameTimes > GameMap;\n\nint sum(GameTimes &vector)\n{\n  int sumOfElems = 0;\n\n  for (int n : vector)\n    sumOfElems += n;\n\n  return sumOfElems;\n}\n\ndouble avg(GameTimes &vector)\n{\n  return std::floor(sum(vector) \/ vector.size());\n}\n\nint main()\n{\n  std::ifstream input(\".\/tests\/input_1.txt\");\n\n  unsigned int lineCount, gameCount;\n\n  input >> lineCount >> gameCount;\n\n  \/\/ Read data from input file\n  GameMap games;\n  GameTitle key;\n  GameTime value;\n  std::string temp;\n\n  for (int i = 0; i < lineCount; i++)\n  {\n    input >> temp >> key >> value;\n\n    if (!games.count(key)) games[key];\n\n    games[key].push_back(value);\n  }\n\n  input.close();\n\n  \/\/ Start calculating the sum and avg for every game\n  std::vector<std::future<int>> results;\n\n  for (auto& game : games) {\n    std::cout << game.first << \" \" << sum(game.second) << \" \"<< avg(game.second) << std::endl;\n  }\n\n  return 0;\n}\n<commit_msg>introduce new typedefs<commit_after>\/\/ compilation on OSX\n\/\/ $ g++ -std=c++11 main.cpp -o main\n\n#include <iostream>\n#include <fstream>\n#include <vector>\n#include <map>\n#include <cmath>\n#include <future>\n\ntypedef std::string GameTitle;\ntypedef int GameTime;\ntypedef std::vector<GameTime> GameTimes;\ntypedef std::map< GameTitle, GameTimes > GameMap;\ntypedef std::future<std::pair<int, double>> StatPair;\ntypedef std::map< GameTitle, StatPair> GameStat;\n\nint sum(GameTimes &vector)\n{\n  int sumOfElems = 0;\n\n  for (int n : vector)\n    sumOfElems += n;\n\n  return sumOfElems;\n}\n\ndouble avg(GameTimes &vector)\n{\n  return std::floor(sum(vector) \/ vector.size());\n}\n\nstd::pair<int, double> processGame(GameTimes &vector)\n{\n  return std::make_pair(sum(vector), avg(vector));\n}\n\nint main()\n{\n  std::ifstream input(\".\/tests\/input_1.txt\");\n\n  unsigned int lineCount, gameCount;\n\n  input >> lineCount >> gameCount;\n\n  \/\/ Read data from input file\n  GameMap games;\n  GameTitle key;\n  GameTime value;\n  std::string temp;\n\n  for (int i = 0; i < lineCount; i++)\n  {\n    input >> temp >> key >> value;\n\n    if (!games.count(key)) games[key];\n\n    games[key].push_back(value);\n  }\n\n  input.close();\n\n  \/\/ Start calculating the sum and avg for every game\n  GameStat results;\n\n  for (auto& game : games)\n  {\n    std::cout << game.first << \" \" << sum(game.second) << \" \"<< avg(game.second) << std::endl;\n\n    \/\/ results[game.first] = processGame(game.second));\n  }\n\n  return 0;\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\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_;\n  std::string io_method_name_;\n  int image_width_, image_height_, framerate_;\n  std::string pixel_format_name_;\n  bool autofocus_;\n  std::string camera_name_;\n  std::string camera_info_url_;\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    \/\/ 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\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)\", camera_name_.c_str(), video_device_name_.c_str(), image_width_,\n             image_height_, io_method_name_.c_str(), pixel_format_name_.c_str());\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    \/\/ check auto focus\n    if (autofocus_)\n      usb_cam_camera_set_auto_focus(1);\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    return true;\n  }\n\n  bool spin()\n  {\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    }\n    return true;\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>added ability to call v4l-utils as well as correctly set autofocus<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_;\n  std::string io_method_name_;\n  int image_width_, image_height_, framerate_;\n  std::string pixel_format_name_;\n  bool autofocus_;\n  std::string camera_name_;\n  std::string camera_info_url_;\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    \/\/ 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\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)\", camera_name_.c_str(), video_device_name_.c_str(), image_width_,\n             image_height_, io_method_name_.c_str(), pixel_format_name_.c_str());\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    \/\/ 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  }\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    return true;\n  }\n\n  bool spin()\n  {\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    }\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>\/***************************************************************************\n *\n * Project: libLAS -- C\/C++ read\/write library for LAS LIDAR data\n * Purpose: LAS translation with optional configuration\n * Author:  Howard Butler, hobu.inc at gmail.com\n ***************************************************************************\n * Copyright (c) 2010, Howard Butler, hobu.inc at gmail.com \n *\n * See LICENSE.txt in this source distribution for more information.\n **************************************************************************\/\n\n\n#include <iostream>\n\n#include <libpc\/exceptions.hpp>\n\/\/#include <libpc\/libpc_config.hpp>\n\/\/#include <libpc\/Bounds.hpp>\n\/\/#include <libpc\/Color.hpp>\n\/\/#include <libpc\/Dimension.hpp>\n\/\/#include <libpc\/Schema.hpp>\n#include <libpc\/filters\/Chipper.hpp>\n\/\/#include <libpc\/ColorFilter.hpp>\n\/\/#include <libpc\/MosaicFilter.hpp>\n\/\/#include <libpc\/FauxReader.hpp>\n\/\/#include <libpc\/FauxWriter.hpp>\n#include <libpc\/drivers\/las\/Reader.hpp>\n\/\/#include <libpc\/LasHeader.hpp>\n#include <libpc\/drivers\/las\/Writer.hpp>\n#include <libpc\/filters\/CacheFilter.hpp>\n#include <libpc\/filters\/ByteSwapFilter.hpp>\n\n#include <libpc\/drivers\/liblas\/Writer.hpp>\n#include <libpc\/drivers\/liblas\/Reader.hpp>\n\n#ifdef LIBPC_HAVE_ORACLE\n#include <libpc\/drivers\/oci\/Writer.hpp>\n#include <libpc\/drivers\/oci\/Reader.hpp>\n#endif\n\n#include <boost\/property_tree\/xml_parser.hpp>\n\n#include \"Application.hpp\"\n\nusing namespace libpc;\nnamespace po = boost::program_options;\n\n\nclass Application_pc2pc : public Application\n{\npublic:\n    Application_pc2pc(int argc, char* argv[]);\n    int execute();\n\nprivate:\n    void addOptions();\n    bool validateOptions();\n\n    std::string m_inputFile;\n    std::string m_outputFile;\n    std::string m_xml;\n    std::string m_srs;\n    bool m_bCompress;\n    \n};\n\n\nApplication_pc2pc::Application_pc2pc(int argc, char* argv[])\n    : Application(argc, argv, \"pc2pc\")\n{\n}\n\n\nbool Application_pc2pc::validateOptions()\n{\n    if (!hasOption(\"input\"))\n    {\n        usageError(\"--input\/-i required\");\n        return false;\n    }\n\n    if (!hasOption(\"output\"))\n    {\n        usageError(\"--output\/-o required\");\n        return false;\n    }\n\n    return true;\n}\n\n\nvoid Application_pc2pc::addOptions()\n{\n    po::options_description* file_options = new po::options_description(\"file options\");\n\n    file_options->add_options()\n        (\"input,i\", po::value<std::string>(&m_inputFile), \"input file name\")\n        (\"output,o\", po::value<std::string>(&m_outputFile), \"output file name\")\n        (\"native\", \"use native LAS classes (not liblas)\")\n        (\"oracle-writer\", \"Read data from LAS file and write to Oracle\")\n        (\"oracle-reader\", \"Read data from Oracle and write to LAS\")\n        (\"a_srs\", po::value<std::string>(&m_srs)->default_value(\"\"), \"Assign output coordinate system\")\n        (\"compress\", po::value<bool>(&m_bCompress)->zero_tokens()->implicit_value(true),\"Compress output data if available\")\n        (\"xml\", po::value<std::string>(&m_xml)->default_value(\"log.xml\"), \"XML file to load process (OCI only right now)\")\n        ;\n\n    addOptionSet(file_options);\n}\n\nint Application_pc2pc::execute()\n{\n    if (!Utils::fileExists(m_inputFile))\n    {\n        runtimeError(\"file not found: \" + m_inputFile);\n        return 1;\n    }\n\n    std::ostream* ofs = Utils::createFile(m_outputFile);\n\n    if (hasOption(\"native\"))\n    {\n        libpc::drivers::las::LasReader reader(m_inputFile);\n    \n        const boost::uint64_t numPoints = reader.getNumPoints();\n\n        libpc::drivers::las::LasWriter writer(reader, *ofs);\n\n        \/\/BUG: handle laz writer.setCompressed(false);\n\n        \/\/writer.setPointFormat( reader.getPointFormatNumber() );\n\n        writer.write(numPoints);\n    }\n\n    else if (hasOption(\"oracle-writer\"))\n    {\n#ifdef LIBPC_HAVE_ORACLE\n        libpc::drivers::liblas::LiblasReader reader(m_inputFile);\n    \n        const boost::uint64_t numPoints = reader.getNumPoints();\n\n        boost::property_tree::ptree load_tree;\n        \n        boost::property_tree::read_xml(m_xml, load_tree);\n        \n        boost::property_tree::ptree oracle_options = load_tree.get_child(\"drivers.oci.writer\");\n    \n        libpc::Options options(oracle_options);\n    \n        boost::property_tree::ptree& tree = options.GetPTree();\n        \n        boost::uint32_t capacity = tree.get<boost::uint32_t>(\"capacity\");\n        \n        \n        libpc::filters::CacheFilter cache(reader, 1, capacity);\n        libpc::filters::Chipper chipper(cache, capacity);\n        libpc::filters::ByteSwapFilter swapper(chipper);\n        libpc::drivers::oci::Writer writer(swapper, options);\n\n        \/\/ libpc::filters::CacheFilter cache(reader, 1, capacity);\n        \/\/ libpc::filters::Chipper chipper(cache, capacity);\n        \/\/ libpc::drivers::oci::Writer writer(chipper, options);\n\n        writer.write(numPoints);\n        boost::property_tree::ptree output_tree;\n        \/\/ output_tree.put_child(writer.getName(), options.GetPTree());\n        \/\/ boost::property_tree::write_xml(m_xml, output_tree);\n                    \n#else\n        throw configuration_error(\"libPC not compiled with Oracle support\");\n#endif\n    }\n        else if (hasOption(\"oracle-reader\"))\n        {\n    #ifdef LIBPC_HAVE_ORACLE\n\n        boost::property_tree::ptree load_tree;\n        \n        boost::property_tree::read_xml(m_xml, load_tree);\n        \n        boost::property_tree::ptree oracle_options = load_tree.get_child(\"drivers.oci.reader\");\n    \n        libpc::Options options(oracle_options);\n\n        libpc::drivers::oci::Reader reader(options);\n\n        const boost::uint64_t numPoints = reader.getNumPoints();\n\n        libpc::filters::ByteSwapFilter swapper(reader);\n\n\n\n        libpc::drivers::las::LasWriter writer(swapper, *ofs);\n\n\n        if (hasOption(\"a_srs\"))\n        {\n            libpc::SpatialReference ref;\n            if (m_srs.size() > 0)\n            {\n                ref.setFromUserInput(m_srs);\n                writer.setSpatialReference(ref);\n            }\n        }\n        if (hasOption(\"compress\"))\n        {\n            if (m_bCompress)\n                writer.setCompressed(true);            \n        }\n        writer.write(numPoints);\n\n        boost::property_tree::ptree output_tree;\n        \n        output_tree.put_child(reader.getName(), options.GetPTree());\n        \/\/ output_tree.put_child(writer.getName(), )\n        \/\/ boost::property_tree::write_xml(m_xml, output_tree);\n            \n    #else\n            throw configuration_error(\"libPC not compiled with Oracle support\");\n    #endif\n        }\n\n\n\n    else\n    {\n        libpc::drivers::liblas::LiblasReader reader(m_inputFile);\n    \n        const boost::uint64_t numPoints = reader.getNumPoints();\n\n        libpc::drivers::liblas::LiblasWriter writer(reader, *ofs);\n\n        \/\/BUG: handle laz writer.setCompressed(false);\n\n        writer.setPointFormat( reader.getPointFormat() );\n\n        writer.write(numPoints);\n    }\n\n    Utils::closeFile(ofs);\n\n    return 0;\n}\n\nint main(int argc, char* argv[])\n{\n    Application_pc2pc app(argc, argv);\n    return app.run();\n}\n\n\n\n<commit_msg>make the oracle reader\/writer use the ByteSwapFilter<commit_after>\/***************************************************************************\n *\n * Project: libLAS -- C\/C++ read\/write library for LAS LIDAR data\n * Purpose: LAS translation with optional configuration\n * Author:  Howard Butler, hobu.inc at gmail.com\n ***************************************************************************\n * Copyright (c) 2010, Howard Butler, hobu.inc at gmail.com \n *\n * See LICENSE.txt in this source distribution for more information.\n **************************************************************************\/\n\n\n#include <iostream>\n\n#include <libpc\/exceptions.hpp>\n\/\/#include <libpc\/libpc_config.hpp>\n\/\/#include <libpc\/Bounds.hpp>\n\/\/#include <libpc\/Color.hpp>\n\/\/#include <libpc\/Dimension.hpp>\n\/\/#include <libpc\/Schema.hpp>\n#include <libpc\/filters\/Chipper.hpp>\n\/\/#include <libpc\/ColorFilter.hpp>\n\/\/#include <libpc\/MosaicFilter.hpp>\n\/\/#include <libpc\/FauxReader.hpp>\n\/\/#include <libpc\/FauxWriter.hpp>\n#include <libpc\/drivers\/las\/Reader.hpp>\n\/\/#include <libpc\/LasHeader.hpp>\n#include <libpc\/drivers\/las\/Writer.hpp>\n#include <libpc\/filters\/CacheFilter.hpp>\n#include <libpc\/filters\/ByteSwapFilter.hpp>\n\n#include <libpc\/drivers\/liblas\/Writer.hpp>\n#include <libpc\/drivers\/liblas\/Reader.hpp>\n\n#ifdef LIBPC_HAVE_ORACLE\n#include <libpc\/drivers\/oci\/Writer.hpp>\n#include <libpc\/drivers\/oci\/Reader.hpp>\n#endif\n\n#include <boost\/property_tree\/xml_parser.hpp>\n\n#include \"Application.hpp\"\n\nusing namespace libpc;\nnamespace po = boost::program_options;\n\n\nclass Application_pc2pc : public Application\n{\npublic:\n    Application_pc2pc(int argc, char* argv[]);\n    int execute();\n\nprivate:\n    void addOptions();\n    bool validateOptions();\n\n    std::string m_inputFile;\n    std::string m_outputFile;\n    std::string m_xml;\n    std::string m_srs;\n    bool m_bCompress;\n    \n};\n\n\nApplication_pc2pc::Application_pc2pc(int argc, char* argv[])\n    : Application(argc, argv, \"pc2pc\")\n{\n}\n\n\nbool Application_pc2pc::validateOptions()\n{\n    if (!hasOption(\"input\"))\n    {\n        usageError(\"--input\/-i required\");\n        return false;\n    }\n\n    if (!hasOption(\"output\"))\n    {\n        usageError(\"--output\/-o required\");\n        return false;\n    }\n\n    return true;\n}\n\n\nvoid Application_pc2pc::addOptions()\n{\n    po::options_description* file_options = new po::options_description(\"file options\");\n\n    file_options->add_options()\n        (\"input,i\", po::value<std::string>(&m_inputFile), \"input file name\")\n        (\"output,o\", po::value<std::string>(&m_outputFile), \"output file name\")\n        (\"native\", \"use native LAS classes (not liblas)\")\n        (\"oracle-writer\", \"Read data from LAS file and write to Oracle\")\n        (\"oracle-reader\", \"Read data from Oracle and write to LAS\")\n        (\"a_srs\", po::value<std::string>(&m_srs)->default_value(\"\"), \"Assign output coordinate system\")\n        (\"compress\", po::value<bool>(&m_bCompress)->zero_tokens()->implicit_value(true),\"Compress output data if available\")\n        (\"xml\", po::value<std::string>(&m_xml)->default_value(\"log.xml\"), \"XML file to load process (OCI only right now)\")\n        ;\n\n    addOptionSet(file_options);\n}\n\nint Application_pc2pc::execute()\n{\n    if (!Utils::fileExists(m_inputFile))\n    {\n        runtimeError(\"file not found: \" + m_inputFile);\n        return 1;\n    }\n\n    std::ostream* ofs = Utils::createFile(m_outputFile);\n\n    if (hasOption(\"native\"))\n    {\n        libpc::drivers::las::LasReader reader(m_inputFile);\n    \n        const boost::uint64_t numPoints = reader.getNumPoints();\n\n        libpc::drivers::las::LasWriter writer(reader, *ofs);\n\n        \/\/BUG: handle laz writer.setCompressed(false);\n\n        \/\/writer.setPointFormat( reader.getPointFormatNumber() );\n\n        writer.write(numPoints);\n    }\n\n    else if (hasOption(\"oracle-writer\"))\n    {\n#ifdef LIBPC_HAVE_ORACLE\n        libpc::drivers::liblas::LiblasReader reader(m_inputFile);\n    \n        const boost::uint64_t numPoints = reader.getNumPoints();\n\n        boost::property_tree::ptree load_tree;\n        \n        boost::property_tree::read_xml(m_xml, load_tree);\n        \n        boost::property_tree::ptree oracle_options = load_tree.get_child(\"drivers.oci.writer\");\n    \n        libpc::Options options(oracle_options);\n    \n        boost::property_tree::ptree& tree = options.GetPTree();\n        \n        boost::uint32_t capacity = tree.get<boost::uint32_t>(\"capacity\");\n        \n        \n        libpc::filters::CacheFilter cache(reader, 1, capacity);\n        libpc::filters::Chipper chipper(cache, capacity);\n        libpc::filters::ByteSwapFilter swapper(chipper);\n        libpc::drivers::oci::Writer writer(swapper, options);\n\n        \/\/ libpc::filters::CacheFilter cache(reader, 1, capacity);\n        \/\/ libpc::filters::Chipper chipper(cache, capacity);\n        \/\/ libpc::drivers::oci::Writer writer(chipper, options);\n\n        writer.write(numPoints);\n        boost::property_tree::ptree output_tree;\n        \/\/ output_tree.put_child(writer.getName(), options.GetPTree());\n        \/\/ boost::property_tree::write_xml(m_xml, output_tree);\n                    \n#else\n        throw configuration_error(\"libPC not compiled with Oracle support\");\n#endif\n    }\n        else if (hasOption(\"oracle-reader\"))\n        {\n    #ifdef LIBPC_HAVE_ORACLE\n\n        boost::property_tree::ptree load_tree;\n        \n        boost::property_tree::read_xml(m_xml, load_tree);\n        \n        boost::property_tree::ptree oracle_options = load_tree.get_child(\"drivers.oci.reader\");\n    \n        libpc::Options options(oracle_options);\n\n        libpc::drivers::oci::Reader reader(options);\n        libpc::filters::ByteSwapFilter swapper(reader);\n        const boost::uint64_t numPoints = reader.getNumPoints();\n        libpc::drivers::las::LasWriter writer(swapper, *ofs);\n        \n        writer.setChunkSize(options.GetPTree().get<boost::uint32_t>(\"capacity\"));\n\n        if (hasOption(\"a_srs\"))\n        {\n            libpc::SpatialReference ref;\n            if (m_srs.size() > 0)\n            {\n                ref.setFromUserInput(m_srs);\n                writer.setSpatialReference(ref);\n            }\n        }\n        if (hasOption(\"compress\"))\n        {\n            if (m_bCompress)\n                writer.setCompressed(true);            \n        }\n        writer.write(numPoints);\n\n        boost::property_tree::ptree output_tree;\n        \n        output_tree.put_child(reader.getName(), options.GetPTree());\n        \/\/ output_tree.put_child(writer.getName(), )\n        \/\/ boost::property_tree::write_xml(m_xml, output_tree);\n            \n    #else\n            throw configuration_error(\"libPC not compiled with Oracle support\");\n    #endif\n        }\n\n\n\n    else\n    {\n        libpc::drivers::liblas::LiblasReader reader(m_inputFile);\n    \n        const boost::uint64_t numPoints = reader.getNumPoints();\n\n        libpc::drivers::liblas::LiblasWriter writer(reader, *ofs);\n\n        \/\/BUG: handle laz writer.setCompressed(false);\n\n        writer.setPointFormat( reader.getPointFormat() );\n\n        writer.write(numPoints);\n    }\n\n    Utils::closeFile(ofs);\n\n    return 0;\n}\n\nint main(int argc, char* argv[])\n{\n    Application_pc2pc app(argc, argv);\n    return app.run();\n}\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: CRowSetDataColumn.cxx,v $\n *\n *  $Revision: 1.20 $\n *\n *  last change: $Author: oj $ $Date: 2001-08-27 09:14: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 _DBACORE_DATACOLUMN_HXX_\n#include \"CRowSetDataColumn.hxx\"\n#endif\n#ifndef DBACCESS_SHARED_DBASTRINGS_HRC\n#include \"dbastrings.hrc\"\n#endif\n#ifndef _DBASHARED_APITOOLS_HXX_\n#include \"apitools.hxx\"\n#endif\n#ifndef _COMPHELPER_TYPES_HXX_\n#include <comphelper\/types.hxx>\n#endif\n#ifndef _CPPUHELPER_TYPEPROVIDER_HXX_\n#include <cppuhelper\/typeprovider.hxx>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYATTRIBUTE_HPP_\n#include <com\/sun\/star\/beans\/PropertyAttribute.hpp>\n#endif\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n\nusing namespace dbaccess;\nusing namespace comphelper;\nusing namespace connectivity;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::beans;\n\/\/  using namespace ::com::sun::star::sdbcx;\nusing namespace ::com::sun::star::sdbc;\nusing namespace ::com::sun::star::container;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::util;\nusing namespace cppu;\nusing namespace osl;\n\nDBG_NAME(ORowSetDataColumn);\n\/\/ -------------------------------------------------------------------------\nORowSetDataColumn::ORowSetDataColumn(   const Reference < XResultSetMetaData >& _xMetaData,\n                                      const Reference < XRow >& _xRow,\n                                      const Reference < XRowUpdate >& _xRowUpdate,\n                                      sal_Int32 _nPos,\n                                      const ::rtl::OUString& _rDescription,\n                                      const ORowSetCacheIterator& _rColumnValue,\n                                      ORowSetMatrix::iterator& _rEnd)\n    : ODataColumn(_xMetaData,_xRow,_xRowUpdate,_nPos)\n    ,m_aDescription(_rDescription)\n    ,m_aColumnValue(_rColumnValue)\n    ,m_rEnd(_rEnd)\n{\n    DBG_CTOR(ORowSetDataColumn,NULL);\n}\n\/\/ -------------------------------------------------------------------------\nORowSetDataColumn::~ORowSetDataColumn()\n{\n    DBG_DTOR(ORowSetDataColumn,NULL);\n}\n\/\/ -------------------------------------------------------------------------\n\/\/ comphelper::OPropertyArrayUsageHelper\n\/\/------------------------------------------------------------------------------\n::cppu::IPropertyArrayHelper* ORowSetDataColumn::createArrayHelper( ) const\n{\n    BEGIN_PROPERTY_HELPER(28)\n        DECL_PROP1(ALIGN,                   sal_Int32,          MAYBEVOID);\n        DECL_PROP1(CATALOGNAME,             ::rtl::OUString,    READONLY);\n        DECL_PROP0_IFACE(CONTROLMODEL,      XPropertySet                );\n        DECL_PROP1(DESCRIPTION,             ::rtl::OUString,    READONLY);\n        DECL_PROP1(DISPLAYSIZE,             sal_Int32,          READONLY);\n        DECL_PROP1(NUMBERFORMAT,            sal_Int32,          MAYBEVOID);\n        DECL_PROP0_BOOL(HIDDEN                                          );\n        DECL_PROP1_BOOL(ISAUTOINCREMENT,                        READONLY);\n        DECL_PROP1_BOOL(ISCASESENSITIVE,                        READONLY);\n        DECL_PROP1_BOOL(ISCURRENCY,                             READONLY);\n        DECL_PROP1_BOOL(ISDEFINITELYWRITABLE,                   READONLY);\n        DECL_PROP1(ISNULLABLE,              sal_Int32,          READONLY);\n        DECL_PROP1_BOOL(ISREADONLY,                             READONLY);\n        DECL_PROP1_BOOL(ISSEARCHABLE,                           READONLY);\n        DECL_PROP1_BOOL(ISSIGNED,                               READONLY);\n        DECL_PROP1_BOOL(ISWRITABLE,                             READONLY);\n        DECL_PROP1(LABEL,                   ::rtl::OUString,    READONLY);\n        DECL_PROP1(NAME,                    ::rtl::OUString,    READONLY);\n        DECL_PROP1(PRECISION,               sal_Int32,          READONLY);\n        DECL_PROP1(RELATIVEPOSITION,        sal_Int32,          MAYBEVOID);\n        DECL_PROP1(SCALE,                   sal_Int32,          READONLY);\n        DECL_PROP1(SCHEMANAME,              ::rtl::OUString,    READONLY);\n        DECL_PROP1(SERVICENAME,             ::rtl::OUString,    READONLY);\n        DECL_PROP1(TABLENAME,               ::rtl::OUString,    READONLY);\n        DECL_PROP1(TYPE,                    sal_Int32,          READONLY);\n        DECL_PROP1(TYPENAME,                ::rtl::OUString,    READONLY);\n        DECL_PROP1(VALUE,                   Any,                BOUND);\n        DECL_PROP1(WIDTH,                   sal_Int32,          MAYBEVOID);\n    END_PROPERTY_HELPER();\n}\n\n\/\/ cppu::OPropertySetHelper\n\/\/------------------------------------------------------------------------------\n::cppu::IPropertyArrayHelper& ORowSetDataColumn::getInfoHelper()\n{\n    return *static_cast< ::comphelper::OPropertyArrayUsageHelper< ORowSetDataColumn >* >(this)->getArrayHelper();\n}\n\/\/ -------------------------------------------------------------------------\nvoid SAL_CALL ORowSetDataColumn::getFastPropertyValue( Any& rValue, sal_Int32 nHandle ) const\n{\n    switch(nHandle)\n    {\n        case PROPERTY_ID_DESCRIPTION:\n            rValue <<= m_aDescription;\n            break;\n        case PROPERTY_ID_ALIGN:\n        case PROPERTY_ID_NUMBERFORMAT:\n        case PROPERTY_ID_RELATIVEPOSITION:\n        case PROPERTY_ID_WIDTH:\n        case PROPERTY_ID_HIDDEN:\n        case PROPERTY_ID_CONTROLMODEL:\n            OColumnSettings::getFastPropertyValue( rValue, nHandle );\n            break;\n        case PROPERTY_ID_VALUE:\n            if(!m_aColumnValue.isNull() && m_aColumnValue != m_rEnd && m_aColumnValue->isValid())\n            {\n                ORowSetRow aRow = *m_aColumnValue;\n                OSL_ENSURE((sal_Int32)aRow->size() > m_nPos,\"Pos is greater than size of vector\");\n                rValue = (*(*m_aColumnValue))[m_nPos].makeAny();\n            }\n            break;\n        default:\n            ODataColumn::getFastPropertyValue(rValue,nHandle);\n    }\n}\n\/\/ -------------------------------------------------------------------------\nvoid SAL_CALL ORowSetDataColumn::setFastPropertyValue_NoBroadcast(sal_Int32 nHandle,const Any& rValue )throw (Exception)\n{\n    switch(nHandle)\n    {\n        case PROPERTY_ID_ALIGN:\n        case PROPERTY_ID_NUMBERFORMAT:\n        case PROPERTY_ID_RELATIVEPOSITION:\n        case PROPERTY_ID_WIDTH:\n        case PROPERTY_ID_HIDDEN:\n        case PROPERTY_ID_CONTROLMODEL:\n            OColumnSettings::setFastPropertyValue_NoBroadcast( nHandle, rValue );\n            break;\n        case PROPERTY_ID_VALUE:\n            updateObject(rValue);\n            break;\n        default:\n            ODataColumn::setFastPropertyValue_NoBroadcast(nHandle,rValue );\n    }\n}\n\/\/ -------------------------------------------------------------------------\nsal_Bool SAL_CALL ORowSetDataColumn::convertFastPropertyValue( Any & rConvertedValue,\n                                                            Any & rOldValue,\n                                                            sal_Int32 nHandle,\n                                                            const Any& rValue ) throw (IllegalArgumentException)\n{\n    sal_Bool bModified = sal_False;\n    switch(nHandle)\n    {\n        case PROPERTY_ID_ALIGN:\n        case PROPERTY_ID_NUMBERFORMAT:\n        case PROPERTY_ID_RELATIVEPOSITION:\n        case PROPERTY_ID_WIDTH:\n        case PROPERTY_ID_HIDDEN:\n        case PROPERTY_ID_CONTROLMODEL:\n            bModified = OColumnSettings::convertFastPropertyValue( rConvertedValue, rOldValue, nHandle, rValue );\n            break;\n        case PROPERTY_ID_VALUE:\n            rConvertedValue = rValue;\n            getFastPropertyValue(rOldValue, PROPERTY_ID_VALUE);\n            bModified = !::comphelper::compare(rConvertedValue, rOldValue);\n            break;\n        default:\n            bModified = ODataColumn::convertFastPropertyValue(rConvertedValue, rOldValue, nHandle, rValue);\n\n    }\n\n    return bModified;\n}\n\/\/--------------------------------------------------------------------------\nSequence< sal_Int8 > ORowSetDataColumn::getImplementationId() throw (RuntimeException)\n{\n    static OImplementationId * pId = 0;\n    if (! pId)\n    {\n        MutexGuard aGuard( Mutex::getGlobalMutex() );\n        if (! pId)\n        {\n            static OImplementationId aId;\n            pId = &aId;\n        }\n    }\n    return pId->getImplementationId();\n}\n\/\/ -------------------------------------------------------------------------\nvoid ORowSetDataColumn::fireValueChange(const ORowSetValue& _rOldValue)\n{\n    if(!m_aColumnValue.isNull() && m_aColumnValue != m_rEnd && m_aColumnValue->isValid() && (!((*(*m_aColumnValue))[m_nPos] == _rOldValue)))\n    {\n        sal_Int32 nHandle = PROPERTY_ID_VALUE;\n        m_aOldValue = _rOldValue.makeAny();\n        Any aNew = (*(*m_aColumnValue))[m_nPos].makeAny();\n\n        fire(&nHandle, &aNew, &m_aOldValue, 1, sal_False );\n    }\n    else\n        OSL_ENSURE(0,\"Invalid column value found!\");\n}\n\n\/\/ -------------------------------------------------------------------------\nReference< ::com::sun::star::container::XNamed > ORowSetDataColumns::createObject(const ::rtl::OUString& _rName)\n{\n    Reference< ::com::sun::star::container::XNamed > xNamed;\n\n    ::comphelper::UStringMixEqual aCase(isCaseSensitive());\n    ::connectivity::OSQLColumns::const_iterator first =  ::connectivity::find(m_aColumns->begin(),m_aColumns->end(),_rName,aCase);\n    if(first != m_aColumns->end())\n        xNamed = Reference< ::com::sun::star::container::XNamed >(*first,UNO_QUERY);\n\n    return xNamed;\n}\n\/\/ -----------------------------------------------------------------------------\nvoid SAL_CALL ORowSetDataColumns::disposing(void)\n{\n    \/\/  clear_NoDispose();\n    ORowSetDataColumns_BASE::disposing();\n    m_aColumns = NULL;\n    \/\/  m_aColumns.clear();\n}\n\/\/ -----------------------------------------------------------------------------\nvoid ORowSetDataColumns::assign(const ::vos::ORef< ::connectivity::OSQLColumns>& _rColumns,const ::std::vector< ::rtl::OUString> &_rVector)\n{\n    m_aColumns = _rColumns;\n    reFill(_rVector);\n}\n\/\/ -----------------------------------------------------------------------------\n\n\n<commit_msg>#91790# removed a wrong assertion<commit_after>\/*************************************************************************\n *\n *  $RCSfile: CRowSetDataColumn.cxx,v $\n *\n *  $Revision: 1.21 $\n *\n *  last change: $Author: fs $ $Date: 2001-08-31 14:19:53 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _DBACORE_DATACOLUMN_HXX_\n#include \"CRowSetDataColumn.hxx\"\n#endif\n#ifndef DBACCESS_SHARED_DBASTRINGS_HRC\n#include \"dbastrings.hrc\"\n#endif\n#ifndef _DBASHARED_APITOOLS_HXX_\n#include \"apitools.hxx\"\n#endif\n#ifndef _COMPHELPER_TYPES_HXX_\n#include <comphelper\/types.hxx>\n#endif\n#ifndef _CPPUHELPER_TYPEPROVIDER_HXX_\n#include <cppuhelper\/typeprovider.hxx>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYATTRIBUTE_HPP_\n#include <com\/sun\/star\/beans\/PropertyAttribute.hpp>\n#endif\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n\nusing namespace dbaccess;\nusing namespace comphelper;\nusing namespace connectivity;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::beans;\n\/\/  using namespace ::com::sun::star::sdbcx;\nusing namespace ::com::sun::star::sdbc;\nusing namespace ::com::sun::star::container;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::util;\nusing namespace cppu;\nusing namespace osl;\n\nDBG_NAME(ORowSetDataColumn);\n\/\/ -------------------------------------------------------------------------\nORowSetDataColumn::ORowSetDataColumn(   const Reference < XResultSetMetaData >& _xMetaData,\n                                      const Reference < XRow >& _xRow,\n                                      const Reference < XRowUpdate >& _xRowUpdate,\n                                      sal_Int32 _nPos,\n                                      const ::rtl::OUString& _rDescription,\n                                      const ORowSetCacheIterator& _rColumnValue,\n                                      ORowSetMatrix::iterator& _rEnd)\n    : ODataColumn(_xMetaData,_xRow,_xRowUpdate,_nPos)\n    ,m_aDescription(_rDescription)\n    ,m_aColumnValue(_rColumnValue)\n    ,m_rEnd(_rEnd)\n{\n    DBG_CTOR(ORowSetDataColumn,NULL);\n}\n\/\/ -------------------------------------------------------------------------\nORowSetDataColumn::~ORowSetDataColumn()\n{\n    DBG_DTOR(ORowSetDataColumn,NULL);\n}\n\/\/ -------------------------------------------------------------------------\n\/\/ comphelper::OPropertyArrayUsageHelper\n\/\/------------------------------------------------------------------------------\n::cppu::IPropertyArrayHelper* ORowSetDataColumn::createArrayHelper( ) const\n{\n    BEGIN_PROPERTY_HELPER(28)\n        DECL_PROP1(ALIGN,                   sal_Int32,          MAYBEVOID);\n        DECL_PROP1(CATALOGNAME,             ::rtl::OUString,    READONLY);\n        DECL_PROP0_IFACE(CONTROLMODEL,      XPropertySet                );\n        DECL_PROP1(DESCRIPTION,             ::rtl::OUString,    READONLY);\n        DECL_PROP1(DISPLAYSIZE,             sal_Int32,          READONLY);\n        DECL_PROP1(NUMBERFORMAT,            sal_Int32,          MAYBEVOID);\n        DECL_PROP0_BOOL(HIDDEN                                          );\n        DECL_PROP1_BOOL(ISAUTOINCREMENT,                        READONLY);\n        DECL_PROP1_BOOL(ISCASESENSITIVE,                        READONLY);\n        DECL_PROP1_BOOL(ISCURRENCY,                             READONLY);\n        DECL_PROP1_BOOL(ISDEFINITELYWRITABLE,                   READONLY);\n        DECL_PROP1(ISNULLABLE,              sal_Int32,          READONLY);\n        DECL_PROP1_BOOL(ISREADONLY,                             READONLY);\n        DECL_PROP1_BOOL(ISSEARCHABLE,                           READONLY);\n        DECL_PROP1_BOOL(ISSIGNED,                               READONLY);\n        DECL_PROP1_BOOL(ISWRITABLE,                             READONLY);\n        DECL_PROP1(LABEL,                   ::rtl::OUString,    READONLY);\n        DECL_PROP1(NAME,                    ::rtl::OUString,    READONLY);\n        DECL_PROP1(PRECISION,               sal_Int32,          READONLY);\n        DECL_PROP1(RELATIVEPOSITION,        sal_Int32,          MAYBEVOID);\n        DECL_PROP1(SCALE,                   sal_Int32,          READONLY);\n        DECL_PROP1(SCHEMANAME,              ::rtl::OUString,    READONLY);\n        DECL_PROP1(SERVICENAME,             ::rtl::OUString,    READONLY);\n        DECL_PROP1(TABLENAME,               ::rtl::OUString,    READONLY);\n        DECL_PROP1(TYPE,                    sal_Int32,          READONLY);\n        DECL_PROP1(TYPENAME,                ::rtl::OUString,    READONLY);\n        DECL_PROP1(VALUE,                   Any,                BOUND);\n        DECL_PROP1(WIDTH,                   sal_Int32,          MAYBEVOID);\n    END_PROPERTY_HELPER();\n}\n\n\/\/ cppu::OPropertySetHelper\n\/\/------------------------------------------------------------------------------\n::cppu::IPropertyArrayHelper& ORowSetDataColumn::getInfoHelper()\n{\n    return *static_cast< ::comphelper::OPropertyArrayUsageHelper< ORowSetDataColumn >* >(this)->getArrayHelper();\n}\n\/\/ -------------------------------------------------------------------------\nvoid SAL_CALL ORowSetDataColumn::getFastPropertyValue( Any& rValue, sal_Int32 nHandle ) const\n{\n    switch(nHandle)\n    {\n        case PROPERTY_ID_DESCRIPTION:\n            rValue <<= m_aDescription;\n            break;\n        case PROPERTY_ID_ALIGN:\n        case PROPERTY_ID_NUMBERFORMAT:\n        case PROPERTY_ID_RELATIVEPOSITION:\n        case PROPERTY_ID_WIDTH:\n        case PROPERTY_ID_HIDDEN:\n        case PROPERTY_ID_CONTROLMODEL:\n            OColumnSettings::getFastPropertyValue( rValue, nHandle );\n            break;\n        case PROPERTY_ID_VALUE:\n            if(!m_aColumnValue.isNull() && m_aColumnValue != m_rEnd && m_aColumnValue->isValid())\n            {\n                ORowSetRow aRow = *m_aColumnValue;\n                OSL_ENSURE((sal_Int32)aRow->size() > m_nPos,\"Pos is greater than size of vector\");\n                rValue = (*(*m_aColumnValue))[m_nPos].makeAny();\n            }\n            break;\n        default:\n            ODataColumn::getFastPropertyValue(rValue,nHandle);\n    }\n}\n\/\/ -------------------------------------------------------------------------\nvoid SAL_CALL ORowSetDataColumn::setFastPropertyValue_NoBroadcast(sal_Int32 nHandle,const Any& rValue )throw (Exception)\n{\n    switch(nHandle)\n    {\n        case PROPERTY_ID_ALIGN:\n        case PROPERTY_ID_NUMBERFORMAT:\n        case PROPERTY_ID_RELATIVEPOSITION:\n        case PROPERTY_ID_WIDTH:\n        case PROPERTY_ID_HIDDEN:\n        case PROPERTY_ID_CONTROLMODEL:\n            OColumnSettings::setFastPropertyValue_NoBroadcast( nHandle, rValue );\n            break;\n        case PROPERTY_ID_VALUE:\n            updateObject(rValue);\n            break;\n        default:\n            ODataColumn::setFastPropertyValue_NoBroadcast(nHandle,rValue );\n    }\n}\n\/\/ -------------------------------------------------------------------------\nsal_Bool SAL_CALL ORowSetDataColumn::convertFastPropertyValue( Any & rConvertedValue,\n                                                            Any & rOldValue,\n                                                            sal_Int32 nHandle,\n                                                            const Any& rValue ) throw (IllegalArgumentException)\n{\n    sal_Bool bModified = sal_False;\n    switch(nHandle)\n    {\n        case PROPERTY_ID_ALIGN:\n        case PROPERTY_ID_NUMBERFORMAT:\n        case PROPERTY_ID_RELATIVEPOSITION:\n        case PROPERTY_ID_WIDTH:\n        case PROPERTY_ID_HIDDEN:\n        case PROPERTY_ID_CONTROLMODEL:\n            bModified = OColumnSettings::convertFastPropertyValue( rConvertedValue, rOldValue, nHandle, rValue );\n            break;\n        case PROPERTY_ID_VALUE:\n            rConvertedValue = rValue;\n            getFastPropertyValue(rOldValue, PROPERTY_ID_VALUE);\n            bModified = !::comphelper::compare(rConvertedValue, rOldValue);\n            break;\n        default:\n            bModified = ODataColumn::convertFastPropertyValue(rConvertedValue, rOldValue, nHandle, rValue);\n\n    }\n\n    return bModified;\n}\n\/\/--------------------------------------------------------------------------\nSequence< sal_Int8 > ORowSetDataColumn::getImplementationId() throw (RuntimeException)\n{\n    static OImplementationId * pId = 0;\n    if (! pId)\n    {\n        MutexGuard aGuard( Mutex::getGlobalMutex() );\n        if (! pId)\n        {\n            static OImplementationId aId;\n            pId = &aId;\n        }\n    }\n    return pId->getImplementationId();\n}\n\/\/ -------------------------------------------------------------------------\nvoid ORowSetDataColumn::fireValueChange(const ORowSetValue& _rOldValue)\n{\n    if(!m_aColumnValue.isNull() && m_aColumnValue != m_rEnd && m_aColumnValue->isValid() && (!((*(*m_aColumnValue))[m_nPos] == _rOldValue)))\n    {\n        sal_Int32 nHandle = PROPERTY_ID_VALUE;\n        m_aOldValue = _rOldValue.makeAny();\n        Any aNew = (*(*m_aColumnValue))[m_nPos].makeAny();\n\n        fire(&nHandle, &aNew, &m_aOldValue, 1, sal_False );\n    }\n}\n\n\/\/ -------------------------------------------------------------------------\nReference< ::com::sun::star::container::XNamed > ORowSetDataColumns::createObject(const ::rtl::OUString& _rName)\n{\n    Reference< ::com::sun::star::container::XNamed > xNamed;\n\n    ::comphelper::UStringMixEqual aCase(isCaseSensitive());\n    ::connectivity::OSQLColumns::const_iterator first =  ::connectivity::find(m_aColumns->begin(),m_aColumns->end(),_rName,aCase);\n    if(first != m_aColumns->end())\n        xNamed = Reference< ::com::sun::star::container::XNamed >(*first,UNO_QUERY);\n\n    return xNamed;\n}\n\/\/ -----------------------------------------------------------------------------\nvoid SAL_CALL ORowSetDataColumns::disposing(void)\n{\n    \/\/  clear_NoDispose();\n    ORowSetDataColumns_BASE::disposing();\n    m_aColumns = NULL;\n    \/\/  m_aColumns.clear();\n}\n\/\/ -----------------------------------------------------------------------------\nvoid ORowSetDataColumns::assign(const ::vos::ORef< ::connectivity::OSQLColumns>& _rColumns,const ::std::vector< ::rtl::OUString> &_rVector)\n{\n    m_aColumns = _rColumns;\n    reFill(_rVector);\n}\n\/\/ -----------------------------------------------------------------------------\n\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef __COMPUTE_TASK_STRUCT_HPP_INCLUDED\n#define __COMPUTE_TASK_STRUCT_HPP_INCLUDED\n\n#include \"pre_iterate_callback.hpp\"\n#include \"post_iterate_callback.hpp\"\n#include \"code\/ylikuutio\/common\/any_value.hpp\"\n\n\/\/ Include GLEW\n#include \"code\/ylikuutio\/opengl\/ylikuutio_glew.hpp\" \/\/ GLfloat, GLuint etc.\n\n\/\/ Include standard headers\n#include <cstddef>  \/\/ std::size_t\n#include <limits>   \/\/ std::numeric_limits\n#include <memory>   \/\/ std::make_shared, std::shared_ptr\n\nnamespace yli\n{\n    namespace callback_system\n    {\n        class CallbackEngine;\n    }\n\n    namespace ontology\n    {\n        class Shader;\n    }\n}\n\ntypedef struct ComputeTaskStruct\n{\n    ComputeTaskStruct()\n        : parent(nullptr),\n        left_filler_vector_any_value(nullptr),\n        right_filler_vector_any_value(nullptr),\n        end_condition_callback_engine(nullptr),\n        n_max_iterations(1),                                     \/\/ By default execute GLSL shader exactly once (do not iterate further).\n        compute_taskID(std::numeric_limits<std::size_t>::max()), \/\/ `std::numeric_limits<std::size_t>::max()` means that `compute_taskID` is not defined.\n        texture_width(0),\n        texture_height(0),\n        texture_depth(0),\n        n_index_characters(4),\n        format(GL_RGB),\n        internal_format(GL_INVALID_ENUM), \/\/ If `internal_format` is left to `GL_INVALID_ENUM`, `format` is used as the internal format.\n        output_format(GL_INVALID_ENUM),   \/\/ If `output_format` is left to `GL_INVALID_ENUM`, `format` is used as the output format.\n        type(GL_UNSIGNED_BYTE),\n        should_ylikuutio_save_intermediate_results(false),\n        should_ylikuutio_flip_texture(true),\n        preiterate_callback(nullptr),\n        postiterate_callback(nullptr)\n    {\n        \/\/ constructor.\n    }\n\n    std::string texture_file_format; \/\/ Type of the texture file. supported file formats so far: `\"bmp\"`\/`\"BMP\"`, `\"dds\"`\/`\"DDS\"`.\n    std::string texture_filename;    \/\/ Filename of the model file.\n    std::string output_filename;     \/\/ Filename of the output file.\n    yli::ontology::Shader* parent; \/\/ pointer to the `Shader`.\n    std::shared_ptr<yli::datatypes::AnyValue> left_filler_vector_any_value;\n    std::shared_ptr<yli::datatypes::AnyValue> right_filler_vector_any_value;\n    std::shared_ptr<yli::callback_system::CallbackEngine> end_condition_callback_engine;\n    std::size_t n_max_iterations;\n    std::size_t compute_taskID;\n    std::size_t texture_width;\n    std::size_t texture_height;\n    std::size_t texture_depth;\n    std::size_t n_index_characters;  \/\/ For intermediate results' filenames.\n    GLenum format;\n    GLenum internal_format;\n    GLenum output_format;\n    GLenum type;\n    bool should_ylikuutio_save_intermediate_results;\n    bool should_ylikuutio_flip_texture;\n    PreIterateCallback preiterate_callback;\n    PostIterateCallback postiterate_callback;\n} TextureStruct;\n\n#endif\n<commit_msg>Edited comments.<commit_after>#ifndef __COMPUTE_TASK_STRUCT_HPP_INCLUDED\n#define __COMPUTE_TASK_STRUCT_HPP_INCLUDED\n\n#include \"pre_iterate_callback.hpp\"\n#include \"post_iterate_callback.hpp\"\n#include \"code\/ylikuutio\/common\/any_value.hpp\"\n\n\/\/ Include GLEW\n#include \"code\/ylikuutio\/opengl\/ylikuutio_glew.hpp\" \/\/ GLfloat, GLuint etc.\n\n\/\/ Include standard headers\n#include <cstddef>  \/\/ std::size_t\n#include <limits>   \/\/ std::numeric_limits\n#include <memory>   \/\/ std::make_shared, std::shared_ptr\n\nnamespace yli\n{\n    namespace callback_system\n    {\n        class CallbackEngine;\n    }\n\n    namespace ontology\n    {\n        class Shader;\n    }\n}\n\ntypedef struct ComputeTaskStruct\n{\n    ComputeTaskStruct()\n        : parent(nullptr),\n        left_filler_vector_any_value(nullptr),\n        right_filler_vector_any_value(nullptr),\n        end_condition_callback_engine(nullptr),\n        n_max_iterations(1),                                     \/\/ By default execute GLSL shader exactly once (do not iterate further).\n        compute_taskID(std::numeric_limits<std::size_t>::max()), \/\/ `std::numeric_limits<std::size_t>::max()` means that `compute_taskID` is not defined.\n        texture_width(0),\n        texture_height(0),\n        texture_depth(0),\n        n_index_characters(4),\n        format(GL_RGB),\n        internal_format(GL_INVALID_ENUM), \/\/ If `internal_format` is left to `GL_INVALID_ENUM`, `format` is used as the internal format.\n        output_format(GL_INVALID_ENUM),   \/\/ If `output_format` is left to `GL_INVALID_ENUM`, `format` is used as the output format.\n        type(GL_UNSIGNED_BYTE),\n        should_ylikuutio_save_intermediate_results(false),\n        should_ylikuutio_flip_texture(true),\n        preiterate_callback(nullptr),\n        postiterate_callback(nullptr)\n    {\n        \/\/ constructor.\n    }\n\n    std::string texture_file_format; \/\/ Type of the texture file. supported file formats so far: `\"bmp\"`\/`\"BMP\"`, `\"csv\"`\/`\"CSV\"`, `\"dds\"`\/`\"DDS\"`.\n    std::string texture_filename;    \/\/ Filename of the model file.\n    std::string output_filename;     \/\/ Filename of the output file.\n    yli::ontology::Shader* parent;   \/\/ Pointer to the `Shader`.\n    std::shared_ptr<yli::datatypes::AnyValue> left_filler_vector_any_value;\n    std::shared_ptr<yli::datatypes::AnyValue> right_filler_vector_any_value;\n    std::shared_ptr<yli::callback_system::CallbackEngine> end_condition_callback_engine;\n    std::size_t n_max_iterations;\n    std::size_t compute_taskID;\n    std::size_t texture_width;\n    std::size_t texture_height;\n    std::size_t texture_depth;\n    std::size_t n_index_characters;  \/\/ For intermediate results' filenames.\n    GLenum format;\n    GLenum internal_format;\n    GLenum output_format;\n    GLenum type;\n    bool should_ylikuutio_save_intermediate_results;\n    bool should_ylikuutio_flip_texture;\n    PreIterateCallback preiterate_callback;\n    PostIterateCallback postiterate_callback;\n} TextureStruct;\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * LocalDegreeScore.cpp\n *\n *  Created on: 28.08.2014\n *      Author: Gerd Lindner\n *\/\n\n#include \"LocalDegreeScore.h\"\n#include \"LocalSimilarityScore.h\"\n\nnamespace NetworKit {\n\nLocalDegreeScore::LocalDegreeScore(const Graph& G) : EdgeScore<double>(G) {\n}\n\nvoid LocalDegreeScore::run() {\n\tif (!G.hasEdgeIds()) {\n\t\tthrow std::runtime_error(\"edges have not been indexed - call indexEdges first\");\n\t}\n\n\tstd::vector<double> exponents (G.upperEdgeIdBound(), 0.0);\n\n\tG.balancedParallelForNodes([&](node i) {\n\t\tcount d = G.degree(i);\n\n\t\t\/**\n\t\t *  The top d^e edges (sorted by degree)\n\t\t * are to be kept in the graph *\/\n\n\t\tstd::vector<AttributizedEdge<count>> neighbors;\n\t\tneighbors.reserve(G.degree(i));\n\t\tG.forNeighborsOf(i, [&](node _i, node j, edgeid eid) {\n\t\t\tneighbors.push_back(AttributizedEdge<count>(i, j, eid, G.degree(j)));\n\t\t});\n\t\tstd::sort(neighbors.begin(), neighbors.end());\n\n\t\t\/**\n\t\t * By convention, we want to the edges with highest \"similarity\" or \"cohesion\" to have values close to 1,\n\t\t * so we invert the range.\n\t\t *\/\n\n\t\tcount rank = 0;\n\t\tcount numSame = 1;\n\t\tcount oldValue = 0; \/\/ none of the neighbors will have degree 0, so 0 is a safe start value\n\n\t\t#pragma omp critical\n\t\tfor (auto neighborEdge : neighbors) {\n\t\t\tif (neighborEdge.value != oldValue) {\n\t\t\t\trank += numSame;\n\t\t\t\tnumSame = 1;\n\t\t\t} else {\n\t\t\t\t++numSame;\n\t\t\t}\n\n\t\t\tedgeid eid = neighborEdge.eid;\n\n\t\t\tdouble e = 1.0; \/\/ If the node has only one neighbor, the edge should be kept anyway.\n\t\t\tif (d > 1)\n\t\t\t\te = 1.0 - (log(rank) \/ log(d));\n\n\t\t\texponents[eid] = std::max(e, exponents[eid]);\n\t\t}\n\n\t});\n\n\tscoreData = std::move(exponents);\n\thasRun = true;\n}\n\ndouble LocalDegreeScore::score(node u, node v) {\n\tthrow std::runtime_error(\"Not implemented: Use scores() instead.\");\n}\n\ndouble LocalDegreeScore::score(edgeid eid) {\n\tthrow std::runtime_error(\"Not implemented: Use scores() instead.\");\n}\n\n} \/* namespace NetworKit *\/\n<commit_msg>LocalDegreeScore: use atomic max instead of critical section<commit_after>\/*\n * LocalDegreeScore.cpp\n *\n *  Created on: 28.08.2014\n *      Author: Gerd Lindner\n *\/\n\n#include \"LocalDegreeScore.h\"\n#include \"..\/auxiliary\/Parallel.h\"\n\nnamespace NetworKit {\n\ntemplate<typename T>\nstruct AttributizedEdge {\n\tedgeid eid;\n\tT value;\n\n\tAttributizedEdge(edgeid eid, T v) :\n\t\t\teid(eid), value(v) {\n\t}\n\n\tbool operator<(const AttributizedEdge<T>& other) const {\n\t\treturn (value > other.value);\n\t}\n};\n\nLocalDegreeScore::LocalDegreeScore(const Graph& G) : EdgeScore<double>(G) {\n}\n\nvoid LocalDegreeScore::run() {\n\tif (!G.hasEdgeIds()) {\n\t\tthrow std::runtime_error(\"edges have not been indexed - call indexEdges first\");\n\t}\n\n\tstd::vector<std::atomic<double>> exponents (G.upperEdgeIdBound());\n\n\tG.balancedParallelForNodes([&](node i) {\n\t\tcount d = G.degree(i);\n\n\t\t\/**\n\t\t *  The top d^e edges (sorted by degree)\n\t\t * are to be kept in the graph *\/\n\n\t\tstd::vector<AttributizedEdge<count>> neighbors;\n\t\tneighbors.reserve(G.degree(i));\n\t\tG.forNeighborsOf(i, [&](node _i, node j, edgeid eid) {\n\t\t\tneighbors.emplace_back(eid, G.degree(j));\n\t\t});\n\t\tstd::sort(neighbors.begin(), neighbors.end());\n\n\t\t\/**\n\t\t * By convention, we want to the edges with highest \"similarity\" or \"cohesion\" to have values close to 1,\n\t\t * so we invert the range.\n\t\t *\/\n\n\t\tcount rank = 0;\n\t\tcount numSame = 1;\n\t\tcount oldValue = 0; \/\/ none of the neighbors will have degree 0, so 0 is a safe start value\n\n\t\tfor (auto neighborEdge : neighbors) {\n\t\t\tif (neighborEdge.value != oldValue) {\n\t\t\t\trank += numSame;\n\t\t\t\tnumSame = 1;\n\t\t\t} else {\n\t\t\t\t++numSame;\n\t\t\t}\n\n\t\t\tedgeid eid = neighborEdge.eid;\n\n\t\t\tdouble e = 1.0; \/\/ If the node has only one neighbor, the edge should be kept anyway.\n\t\t\tif (d > 1)\n\t\t\t\te = 1.0 - (log(rank) \/ log(d));\n\n\t\t\tAux::Parallel::atomic_max(exponents[eid], e);\n\t\t}\n\n\t});\n\n\tscoreData.clear();\n\tscoreData.resize(G.upperEdgeIdBound());\n\n\t#pragma omp parallel for\n\tfor (index i = 0; i < scoreData.size(); ++i) {\n\t\tscoreData[i] = exponents[i];\n\t}\n\n\thasRun = true;\n}\n\ndouble LocalDegreeScore::score(node u, node v) {\n\tthrow std::runtime_error(\"Not implemented: Use scores() instead.\");\n}\n\ndouble LocalDegreeScore::score(edgeid eid) {\n\tthrow std::runtime_error(\"Not implemented: Use scores() instead.\");\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: weakeventlistener.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 COMPHELPER_WEAKEVENTLISTENER_HXX\n#define COMPHELPER_WEAKEVENTLISTENER_HXX\n\n#include <cppuhelper\/compbase1.hxx>\n#include <com\/sun\/star\/lang\/XComponent.hpp>\n#include <com\/sun\/star\/uno\/XWeak.hpp>\n#include <cppuhelper\/weakref.hxx>\n#include <comphelper\/broadcasthelper.hxx>\n#include \"comphelper\/comphelperdllapi.h\"\n\n\/\/.........................................................................\nnamespace comphelper\n{\n\/\/.........................................................................\n\n    \/\/=====================================================================\n    \/\/= OWeakListenerAdapterBase\n    \/\/=====================================================================\n    \/** (the base for) an adapter which allows to add as listener to a foreign component, without\n        being held hard.\n\n        <p>The idea is that this adapter is added as listener to a foreign component, which usually\n        holds it's listener hard. The adapter itself knows the real listener as weak reference,\n        thus not affecting it's life time.<\/p>\n    *\/\n    class OWeakListenerAdapterBase : public OBaseMutex\n    {\n    private:\n        ::com::sun::star::uno::WeakReference< ::com::sun::star::uno::XInterface >\n                m_aListener;\n        ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >\n                m_xBroadcaster;\n\n    protected:\n        inline ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >\n                getListener( ) const\n        {\n            return m_aListener.get();\n        }\n\n        inline const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >&\n                getBroadcaster( ) const\n        {\n            return m_xBroadcaster;\n        }\n\n        inline void resetListener( )\n        {\n            m_aListener = ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >();\n        }\n\n\n    protected:\n        inline OWeakListenerAdapterBase(\n            const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XWeak >& _rxListener,\n            const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _rxBroadcaster\n        )\n            :m_aListener    (  _rxListener )\n            ,m_xBroadcaster ( _rxBroadcaster )\n        {\n        }\n\n    protected:\n        virtual ~OWeakListenerAdapterBase();\n    };\n\n\n    \/\/=====================================================================\n    \/\/= OWeakListenerAdapter\n    \/\/=====================================================================\n    template< class BROADCASTER, class LISTENER >\n    \/** yet another base for weak listener adapters, this time with some type safety\n\n        <p>Note that derived classes need to overwrite all virtual methods of their interface\n        except XEventListener::disposing, and forward it to their master listener.<\/p>\n\n        <p>Addtionally, derived classes need to add themself as listener to the broadcaster,\n        as this can't be done in a generic way<\/p>\n    *\/\n    class OWeakListenerAdapter\n            :public ::cppu::WeakComponentImplHelper1 < LISTENER >\n            ,public OWeakListenerAdapterBase\n    {\n    protected:\n        \/** ctor\n            <p>Note that derived classes still need to add themself as listener to the broadcaster,\n            as this can't be done in a generic way<\/p>\n        *\/\n        OWeakListenerAdapter(\n            const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XWeak >& _rxListener,\n            const ::com::sun::star::uno::Reference< BROADCASTER >& _rxBroadcaster\n        );\n\n    protected:\n        inline  ::com::sun::star::uno::Reference< LISTENER > getListener( ) const\n        {\n            return  ::com::sun::star::uno::Reference< LISTENER >( OWeakListenerAdapterBase::getListener(), ::com::sun::star::uno::UNO_QUERY );\n        }\n\n        \/\/ XEventListener overridables\n        virtual void SAL_CALL disposing( const ::com::sun::star::lang::EventObject& Source ) throw (::com::sun::star::uno::RuntimeException);\n\n    protected:\n        \/\/ OComponentHelper overridables\n        \/\/ to be overridden, again - the derived class should revoke the listener from the broadcaster\n        virtual void SAL_CALL disposing( ) = 0;\n    };\n\n    \/\/=====================================================================\n    \/\/= OWeakEventListenerAdapter\n    \/\/=====================================================================\n    typedef OWeakListenerAdapter    <   ::com::sun::star::lang::XComponent\n                                    ,   ::com::sun::star::lang::XEventListener\n                                    >   OWeakEventListenerAdapter_Base;\n    \/** the most simple listener adapter: for XEventListeners at XComponents\n    *\/\n    class COMPHELPER_DLLPUBLIC OWeakEventListenerAdapter : public OWeakEventListenerAdapter_Base\n    {\n    public:\n        OWeakEventListenerAdapter(\n            ::com::sun::star::uno::Reference< ::com::sun::star::uno::XWeak > _rxListener,\n            ::com::sun::star::uno::Reference< ::com::sun::star::lang::XComponent > _rxBroadcaster\n        );\n\n        \/\/ nothing to do except an own ctor - the forwarding of the \"disposing\" is already done\n        \/\/ in the base class\n\n    protected:\n        using OWeakEventListenerAdapter_Base::disposing;\n        virtual void SAL_CALL disposing( );\n    };\n\n    \/\/=====================================================================\n    \/\/= OWeakListenerAdapter\n    \/\/=====================================================================\n    \/\/---------------------------------------------------------------------\n    template< class BROADCASTER, class LISTENER >\n    OWeakListenerAdapter< BROADCASTER, LISTENER >::OWeakListenerAdapter(\n        const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XWeak >& _rxListener,\n        const ::com::sun::star::uno::Reference< BROADCASTER >& _rxBroadcaster\n    )\n        : ::cppu::WeakComponentImplHelper1< LISTENER >( m_aMutex )\n        , OWeakListenerAdapterBase( _rxListener, _rxBroadcaster )\n    {\n    }\n\n    \/\/---------------------------------------------------------------------\n    template< class BROADCASTER, class LISTENER >\n    void SAL_CALL OWeakListenerAdapter< BROADCASTER, LISTENER >::disposing( const ::com::sun::star::lang::EventObject& _rSource ) throw (::com::sun::star::uno::RuntimeException)\n    {\n        ::com::sun::star::uno::Reference< LISTENER > xListener( getListener() );\n        if ( xListener.is() )\n            xListener->disposing( _rSource );\n    }\n\n\/\/.........................................................................\n}   \/\/ namespace comphelper\n\/\/.........................................................................\n\n#endif\/\/ COMPHELPER_WEAKEVENTLISTENER_HXX\n\n\n<commit_msg>writerfilter07: merged CWS swunolocking1<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: weakeventlistener.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 COMPHELPER_WEAKEVENTLISTENER_HXX\n#define COMPHELPER_WEAKEVENTLISTENER_HXX\n\n#include <cppuhelper\/compbase1.hxx>\n#include <com\/sun\/star\/lang\/XComponent.hpp>\n#include <com\/sun\/star\/uno\/XWeak.hpp>\n#include <cppuhelper\/weakref.hxx>\n#include <comphelper\/broadcasthelper.hxx>\n#include \"comphelper\/comphelperdllapi.h\"\n\n\/\/.........................................................................\nnamespace comphelper\n{\n\/\/.........................................................................\n\n    \/\/=====================================================================\n    \/\/= OWeakListenerAdapterBase\n    \/\/=====================================================================\n    \/** (the base for) an adapter which allows to add as listener to a foreign component, without\n        being held hard.\n\n        <p>The idea is that this adapter is added as listener to a foreign component, which usually\n        holds it's listener hard. The adapter itself knows the real listener as weak reference,\n        thus not affecting it's life time.<\/p>\n    *\/\n    class OWeakListenerAdapterBase : public OBaseMutex\n    {\n    private:\n        ::com::sun::star::uno::WeakReference< ::com::sun::star::uno::XInterface >\n                m_aListener;\n        ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >\n                m_xBroadcaster;\n\n    protected:\n        inline ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >\n                getListener( ) const\n        {\n            return m_aListener.get();\n        }\n\n        inline const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >&\n                getBroadcaster( ) const\n        {\n            return m_xBroadcaster;\n        }\n\n        inline void resetListener( )\n        {\n            m_aListener.clear();\n        }\n\n\n    protected:\n        inline OWeakListenerAdapterBase(\n            const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XWeak >& _rxListener,\n            const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _rxBroadcaster\n        )\n            :m_aListener    (  _rxListener )\n            ,m_xBroadcaster ( _rxBroadcaster )\n        {\n        }\n\n    protected:\n        virtual ~OWeakListenerAdapterBase();\n    };\n\n\n    \/\/=====================================================================\n    \/\/= OWeakListenerAdapter\n    \/\/=====================================================================\n    template< class BROADCASTER, class LISTENER >\n    \/** yet another base for weak listener adapters, this time with some type safety\n\n        <p>Note that derived classes need to overwrite all virtual methods of their interface\n        except XEventListener::disposing, and forward it to their master listener.<\/p>\n\n        <p>Addtionally, derived classes need to add themself as listener to the broadcaster,\n        as this can't be done in a generic way<\/p>\n    *\/\n    class OWeakListenerAdapter\n            :public ::cppu::WeakComponentImplHelper1 < LISTENER >\n            ,public OWeakListenerAdapterBase\n    {\n    protected:\n        \/** ctor\n            <p>Note that derived classes still need to add themself as listener to the broadcaster,\n            as this can't be done in a generic way<\/p>\n        *\/\n        OWeakListenerAdapter(\n            const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XWeak >& _rxListener,\n            const ::com::sun::star::uno::Reference< BROADCASTER >& _rxBroadcaster\n        );\n\n    protected:\n        inline  ::com::sun::star::uno::Reference< LISTENER > getListener( ) const\n        {\n            return  ::com::sun::star::uno::Reference< LISTENER >( OWeakListenerAdapterBase::getListener(), ::com::sun::star::uno::UNO_QUERY );\n        }\n\n        \/\/ XEventListener overridables\n        virtual void SAL_CALL disposing( const ::com::sun::star::lang::EventObject& Source ) throw (::com::sun::star::uno::RuntimeException);\n\n    protected:\n        \/\/ OComponentHelper overridables\n        \/\/ to be overridden, again - the derived class should revoke the listener from the broadcaster\n        virtual void SAL_CALL disposing( ) = 0;\n    };\n\n    \/\/=====================================================================\n    \/\/= OWeakEventListenerAdapter\n    \/\/=====================================================================\n    typedef OWeakListenerAdapter    <   ::com::sun::star::lang::XComponent\n                                    ,   ::com::sun::star::lang::XEventListener\n                                    >   OWeakEventListenerAdapter_Base;\n    \/** the most simple listener adapter: for XEventListeners at XComponents\n    *\/\n    class COMPHELPER_DLLPUBLIC OWeakEventListenerAdapter : public OWeakEventListenerAdapter_Base\n    {\n    public:\n        OWeakEventListenerAdapter(\n            ::com::sun::star::uno::Reference< ::com::sun::star::uno::XWeak > _rxListener,\n            ::com::sun::star::uno::Reference< ::com::sun::star::lang::XComponent > _rxBroadcaster\n        );\n\n        \/\/ nothing to do except an own ctor - the forwarding of the \"disposing\" is already done\n        \/\/ in the base class\n\n    protected:\n        using OWeakEventListenerAdapter_Base::disposing;\n        virtual void SAL_CALL disposing( );\n    };\n\n    \/\/=====================================================================\n    \/\/= OWeakListenerAdapter\n    \/\/=====================================================================\n    \/\/---------------------------------------------------------------------\n    template< class BROADCASTER, class LISTENER >\n    OWeakListenerAdapter< BROADCASTER, LISTENER >::OWeakListenerAdapter(\n        const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XWeak >& _rxListener,\n        const ::com::sun::star::uno::Reference< BROADCASTER >& _rxBroadcaster\n    )\n        : ::cppu::WeakComponentImplHelper1< LISTENER >( m_aMutex )\n        , OWeakListenerAdapterBase( _rxListener, _rxBroadcaster )\n    {\n    }\n\n    \/\/---------------------------------------------------------------------\n    template< class BROADCASTER, class LISTENER >\n    void SAL_CALL OWeakListenerAdapter< BROADCASTER, LISTENER >::disposing( const ::com::sun::star::lang::EventObject& _rSource ) throw (::com::sun::star::uno::RuntimeException)\n    {\n        ::com::sun::star::uno::Reference< LISTENER > xListener( getListener() );\n        if ( xListener.is() )\n            xListener->disposing( _rSource );\n    }\n\n\/\/.........................................................................\n}   \/\/ namespace comphelper\n\/\/.........................................................................\n\n#endif\/\/ COMPHELPER_WEAKEVENTLISTENER_HXX\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: webdavdatasupplier.hxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: ihi $ $Date: 2007-06-05 18:21: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 _WEBDAV_UCP_DATASUPPLIER_HXX\n#define _WEBDAV_UCP_DATASUPPLIER_HXX\n\n#include <vector>\n\n#ifndef _RTL_REF_HXX_\n#include <rtl\/ref.hxx>\n#endif\n\n#ifndef _UCBHELPER_RESULTSET_HXX\n#include <ucbhelper\/resultset.hxx>\n#endif\n\nnamespace webdav_ucp {\n\nstruct DataSupplier_Impl;\nclass Content;\nstruct DAVResource;\nclass ContentProperties;\n\nclass DataSupplier : public ucbhelper::ResultSetDataSupplier\n{\n    DataSupplier_Impl* m_pImpl;\n\nprivate:\n    sal_Bool getData();\n\npublic:\n    DataSupplier( const com::sun::star::uno::Reference<\n              com::sun::star::lang::XMultiServiceFactory >& rxSMgr,\n              const rtl::Reference< Content >& rContent,\n              sal_Int32 nOpenMode);\n\n    virtual ~DataSupplier();\n\n    virtual rtl::OUString queryContentIdentifierString( sal_uInt32 nIndex );\n    virtual com::sun::star::uno::Reference<\n                com::sun::star::ucb::XContentIdentifier >\n    queryContentIdentifier( sal_uInt32 nIndex );\n    virtual com::sun::star::uno::Reference< com::sun::star::ucb::XContent >\n    queryContent( sal_uInt32 nIndex );\n\n    virtual sal_Bool getResult( sal_uInt32 nIndex );\n\n    virtual sal_uInt32 totalCount();\n    virtual sal_uInt32 currentCount();\n    virtual sal_Bool isCountFinal();\n\n    virtual com::sun::star::uno::Reference< com::sun::star::sdbc::XRow >\n    queryPropertyValues( sal_uInt32 nIndex  );\n    virtual void releasePropertyValues( sal_uInt32 nIndex );\n\n    virtual void close();\n\n    virtual void validate()\n        throw( com::sun::star::ucb::ResultSetException );\n};\n\n}\n\n#endif\n<commit_msg>INTEGRATION: CWS changefileheader (1.9.72); FILE MERGED 2008\/04\/01 16:02:29 thb 1.9.72.2: #i85898# Stripping all external header guards 2008\/03\/31 15:30:32 rt 1.9.72.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: webdavdatasupplier.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 _WEBDAV_UCP_DATASUPPLIER_HXX\n#define _WEBDAV_UCP_DATASUPPLIER_HXX\n\n#include <vector>\n#include <rtl\/ref.hxx>\n#include <ucbhelper\/resultset.hxx>\n\nnamespace webdav_ucp {\n\nstruct DataSupplier_Impl;\nclass Content;\nstruct DAVResource;\nclass ContentProperties;\n\nclass DataSupplier : public ucbhelper::ResultSetDataSupplier\n{\n    DataSupplier_Impl* m_pImpl;\n\nprivate:\n    sal_Bool getData();\n\npublic:\n    DataSupplier( const com::sun::star::uno::Reference<\n              com::sun::star::lang::XMultiServiceFactory >& rxSMgr,\n              const rtl::Reference< Content >& rContent,\n              sal_Int32 nOpenMode);\n\n    virtual ~DataSupplier();\n\n    virtual rtl::OUString queryContentIdentifierString( sal_uInt32 nIndex );\n    virtual com::sun::star::uno::Reference<\n                com::sun::star::ucb::XContentIdentifier >\n    queryContentIdentifier( sal_uInt32 nIndex );\n    virtual com::sun::star::uno::Reference< com::sun::star::ucb::XContent >\n    queryContent( sal_uInt32 nIndex );\n\n    virtual sal_Bool getResult( sal_uInt32 nIndex );\n\n    virtual sal_uInt32 totalCount();\n    virtual sal_uInt32 currentCount();\n    virtual sal_Bool isCountFinal();\n\n    virtual com::sun::star::uno::Reference< com::sun::star::sdbc::XRow >\n    queryPropertyValues( sal_uInt32 nIndex  );\n    virtual void releasePropertyValues( sal_uInt32 nIndex );\n\n    virtual void close();\n\n    virtual void validate()\n        throw( com::sun::star::ucb::ResultSetException );\n};\n\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: fmtextcontrolshell.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: obo $ $Date: 2005-07-08 10:34: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 SVX_SOURCE_INC_FMTEXTCONTROLSHELL_HXX\n#define SVX_SOURCE_INC_FMTEXTCONTROLSHELL_HXX\n\n\/** === begin UNO includes === **\/\n#ifndef _COM_SUN_STAR_FRAME_XDISPATCHPROVIDER_HPP_\n#include <com\/sun\/star\/frame\/XDispatchProvider.hpp>\n#endif\n#ifndef _COM_SUN_STAR_AWT_XTEXTCOMPONENT_HPP_\n#include <com\/sun\/star\/awt\/XTextComponent.hpp>\n#endif\n#ifndef _COM_SUN_STAR_FRAME_XSTATUSLISTENER_HPP_\n#include <com\/sun\/star\/frame\/XStatusListener.hpp>\n#endif\n#ifndef _COM_SUN_STAR_AWT_XFOCUSLISTENER_HPP_\n#include <com\/sun\/star\/awt\/XFocusListener.hpp>\n#endif\n#ifndef _COM_SUN_STAR_AWT_XMOUSELISTENER_HPP_\n#include <com\/sun\/star\/awt\/XMouseListener.hpp>\n#endif\n#ifndef _COM_SUN_STAR_FORM_XFORMCONTROLLER_HPP_\n#include <com\/sun\/star\/form\/XFormController.hpp>\n#endif\n#ifndef _COM_SUN_STAR_AWT_XCONTROL_HPP_\n#include <com\/sun\/star\/awt\/XControl.hpp>\n#endif\n\/** === end UNO includes === **\/\n\n#ifndef _COMPHELPER_IMPLEMENTATIONREFERENCE_HXX\n#include <comphelper\/implementationreference.hxx>\n#endif\n\n#ifndef _LINK_HXX\n#include <tools\/link.hxx>\n#endif\n\n#ifndef _SV_TIMER_HXX\n#include <vcl\/timer.hxx>\n#endif\n\n#ifndef SVX_SOURCE_INC_FMSLOTINVALIDATOR_HXX\n#include \"fmslotinvalidator.hxx\"\n#endif\n\n#include <vector>\n#include <map>\n\nclass SfxRequest;\nclass SfxItemSet;\nclass SfxAllItemSet;\nclass SfxBindings;\nclass SfxViewFrame;\nclass Window;\nclass SfxApplication;\n\n\/\/........................................................................\nnamespace svx\n{\n\/\/........................................................................\n\n    class FmFocusListenerAdapter;\n    class FmTextControlFeature;\n    class FmMouseListenerAdapter;\n\n    \/\/====================================================================\n    \/\/= IFocusObserver\n    \/\/====================================================================\n    class IFocusObserver\n    {\n    public:\n        virtual void    focusGained( const ::com::sun::star::awt::FocusEvent& _rEvent ) = 0;\n        virtual void    focusLost( const ::com::sun::star::awt::FocusEvent& _rEvent ) = 0;\n    };\n\n    \/\/====================================================================\n    \/\/= IFocusObserver\n    \/\/====================================================================\n    class IContextRequestObserver\n    {\n    public:\n        virtual void    contextMenuRequested( const ::com::sun::star::awt::MouseEvent& _rEvent ) = 0;\n    };\n\n    \/\/====================================================================\n    \/\/= FmTextControlShell\n    \/\/====================================================================\n    class FmTextControlShell :public IFocusObserver\n                             ,public ISlotInvalidator\n                             ,public IContextRequestObserver\n    {\n    private:\n        ::com::sun::star::uno::Reference< ::com::sun::star::awt::XControl >         m_xActiveControl;\n        ::com::sun::star::uno::Reference< ::com::sun::star::awt::XTextComponent >   m_xActiveTextComponent;\n        ::com::sun::star::uno::Reference< ::com::sun::star::form::XFormController > m_xActiveController;\n#ifndef DONT_REMEMBER_LAST_CONTROL\n        \/\/ without this define, m_xActiveControl remembers the *last* active control, even\n        \/\/ if it, in the meantime, already lost the focus\n        bool                                                                        m_bActiveControl;\n            \/\/ so we need an additional boolean flag telling whether the active cotrol\n            \/\/ is really focused\n#endif\n        bool                                                                        m_bActiveControlIsReadOnly;\n        bool                                                                        m_bActiveControlIsRichText;\n\n        \/\/ listening at all controls of the active controller for focus changes\n        typedef ::comphelper::ImplementationReference< FmFocusListenerAdapter, ::com::sun::star::awt::XFocusListener >\n                                                                                    FocusListenerAdapter;\n        typedef ::std::vector< FocusListenerAdapter >                               FocusListenerAdapters;\n        FocusListenerAdapters                                                       m_aControlObservers;\n\n        typedef ::comphelper::ImplementationReference< FmMouseListenerAdapter, ::com::sun::star::awt::XMouseListener >\n                                                                                    MouseListenerAdapter;\n        MouseListenerAdapter                                                        m_aContextMenuObserver;\n\n        \/\/ translating between \"slots\" of the framework and \"features\" of the active control\n        typedef ::comphelper::ImplementationReference< FmTextControlFeature, ::com::sun::star::frame::XStatusListener >\n                                                                                    ControlFeature;\n        typedef ::std::map< SfxSlotId, ControlFeature, ::std::less< SfxSlotId > >   ControlFeatures;\n        ControlFeatures                                                             m_aControlFeatures;\n\n        SfxViewFrame*                                                               m_pViewFrame;\n        \/\/ invalidating slots\n        SfxBindings&                                                                m_rBindings;\n        Link                                                                        m_aControlActivationHandler;\n        AutoTimer                                                                   m_aClipboardInvalidation;\n        bool                                                                        m_bNeedClipboardInvalidation;\n\n    public:\n        FmTextControlShell( SfxViewFrame* _pFrame );\n        ~FmTextControlShell();\n\n        \/\/ clean up any resources associated with this instance\n        void    dispose();\n\n        void    ExecuteTextAttribute( SfxRequest& _rReq );\n        void    GetTextAttributeState( SfxItemSet& _rSet );\n        bool    IsActiveControl( bool _bCountRichTextOnly = false ) const;\n        void    ForgetActiveControl();\n        void    SetControlActivationHandler( const Link& _rHdl ) { m_aControlActivationHandler = _rHdl; }\n\n        \/** to be called when a form in our document has been activated\n        *\/\n        void    formActivated( const ::com::sun::star::uno::Reference< ::com::sun::star::form::XFormController >& _rxController );\n        \/** to be called when a form in our document has been deactivated\n        *\/\n        void    formDeactivated( const ::com::sun::star::uno::Reference< ::com::sun::star::form::XFormController >& _rxController );\n\n        \/** notifies the instance that the design mode has changed\n        *\/\n        void    designModeChanged( bool _bNewDesignMode );\n\n    protected:\n        \/\/ IFocusObserver\n        virtual void    focusGained( const ::com::sun::star::awt::FocusEvent& _rEvent );\n        virtual void    focusLost( const ::com::sun::star::awt::FocusEvent& _rEvent );\n\n        \/\/ IContextRequestObserver\n        virtual void    contextMenuRequested( const ::com::sun::star::awt::MouseEvent& _rEvent );\n\n        \/\/ ISlotInvalidator\n        virtual void    Invalidate( SfxSlotId _nSlot );\n\n    protected:\n        enum AttributeSet { eCharAttribs, eParaAttribs };\n        void    executeAttributeDialog( AttributeSet _eSet, SfxRequest& _rReq );\n        bool    executeSelectAll( );\n        bool    executeClipboardSlot( SfxSlotId _nSlot );\n\n    private:\n        inline  bool    isControllerListening() const { return !m_aControlObservers.empty(); }\n\n        FmTextControlFeature*\n                        implGetFeatureDispatcher(\n                            const ::com::sun::star::uno::Reference< ::com::sun::star::frame::XDispatchProvider >& _rxProvider,\n                            SfxApplication* _pApplication,\n                            SfxSlotId _nSlot\n                        );\n\n        \/\/ fills the given structure with dispatchers for the given slots, for the given control\n        void            fillFeatureDispatchers(\n                            const ::com::sun::star::uno::Reference< ::com::sun::star::awt::XControl > _rxControl,\n                            SfxSlotId* _pZeroTerminatedSlots,\n                            ControlFeatures& _rDispatchers\n                        );\n\n        \/\/\/ creates SfxPoolItes for all features in the given set, and puts them into the given SfxAllItemSet\n        void            transferFeatureStatesToItemSet(\n                            ControlFeatures& _rDispatchers,\n                            SfxAllItemSet& _rSet,\n                            bool _bTranslateLatin = false\n                        );\n\n        \/\/\/ to be called when a control has been activated\n        void    controlActivated( const ::com::sun::star::uno::Reference< ::com::sun::star::awt::XControl >& _rxControl );\n        \/\/\/ to be called when the currently active control has been deactivated\n        void    controlDeactivated( );\n\n        void    implClearActiveControlRef();\n\n        \/** starts listening at all controls of the given controller for focus events\n        @precond\n            we don't have an active controller currently\n        *\/\n        void    startControllerListening( const ::com::sun::star::uno::Reference< ::com::sun::star::form::XFormController >& _rxController );\n        \/** stops listening at the active controller\n        @precond\n            we have an active controller currently\n        *\/\n        void    stopControllerListening( );\n\n        DECL_LINK( OnInvalidateClipboard, void* );\n    };\n\n\/\/........................................................................\n} \/\/ namespace svx\n\/\/........................................................................\n\n#endif \/\/ SVX_SOURCE_INC_FMTEXTCONTROLSHELL_HXX\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.3.114); FILE MERGED 2005\/09\/05 14:25:12 rt 1.3.114.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: fmtextcontrolshell.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 23:20:44 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n#ifndef SVX_SOURCE_INC_FMTEXTCONTROLSHELL_HXX\n#define SVX_SOURCE_INC_FMTEXTCONTROLSHELL_HXX\n\n\/** === begin UNO includes === **\/\n#ifndef _COM_SUN_STAR_FRAME_XDISPATCHPROVIDER_HPP_\n#include <com\/sun\/star\/frame\/XDispatchProvider.hpp>\n#endif\n#ifndef _COM_SUN_STAR_AWT_XTEXTCOMPONENT_HPP_\n#include <com\/sun\/star\/awt\/XTextComponent.hpp>\n#endif\n#ifndef _COM_SUN_STAR_FRAME_XSTATUSLISTENER_HPP_\n#include <com\/sun\/star\/frame\/XStatusListener.hpp>\n#endif\n#ifndef _COM_SUN_STAR_AWT_XFOCUSLISTENER_HPP_\n#include <com\/sun\/star\/awt\/XFocusListener.hpp>\n#endif\n#ifndef _COM_SUN_STAR_AWT_XMOUSELISTENER_HPP_\n#include <com\/sun\/star\/awt\/XMouseListener.hpp>\n#endif\n#ifndef _COM_SUN_STAR_FORM_XFORMCONTROLLER_HPP_\n#include <com\/sun\/star\/form\/XFormController.hpp>\n#endif\n#ifndef _COM_SUN_STAR_AWT_XCONTROL_HPP_\n#include <com\/sun\/star\/awt\/XControl.hpp>\n#endif\n\/** === end UNO includes === **\/\n\n#ifndef _COMPHELPER_IMPLEMENTATIONREFERENCE_HXX\n#include <comphelper\/implementationreference.hxx>\n#endif\n\n#ifndef _LINK_HXX\n#include <tools\/link.hxx>\n#endif\n\n#ifndef _SV_TIMER_HXX\n#include <vcl\/timer.hxx>\n#endif\n\n#ifndef SVX_SOURCE_INC_FMSLOTINVALIDATOR_HXX\n#include \"fmslotinvalidator.hxx\"\n#endif\n\n#include <vector>\n#include <map>\n\nclass SfxRequest;\nclass SfxItemSet;\nclass SfxAllItemSet;\nclass SfxBindings;\nclass SfxViewFrame;\nclass Window;\nclass SfxApplication;\n\n\/\/........................................................................\nnamespace svx\n{\n\/\/........................................................................\n\n    class FmFocusListenerAdapter;\n    class FmTextControlFeature;\n    class FmMouseListenerAdapter;\n\n    \/\/====================================================================\n    \/\/= IFocusObserver\n    \/\/====================================================================\n    class IFocusObserver\n    {\n    public:\n        virtual void    focusGained( const ::com::sun::star::awt::FocusEvent& _rEvent ) = 0;\n        virtual void    focusLost( const ::com::sun::star::awt::FocusEvent& _rEvent ) = 0;\n    };\n\n    \/\/====================================================================\n    \/\/= IFocusObserver\n    \/\/====================================================================\n    class IContextRequestObserver\n    {\n    public:\n        virtual void    contextMenuRequested( const ::com::sun::star::awt::MouseEvent& _rEvent ) = 0;\n    };\n\n    \/\/====================================================================\n    \/\/= FmTextControlShell\n    \/\/====================================================================\n    class FmTextControlShell :public IFocusObserver\n                             ,public ISlotInvalidator\n                             ,public IContextRequestObserver\n    {\n    private:\n        ::com::sun::star::uno::Reference< ::com::sun::star::awt::XControl >         m_xActiveControl;\n        ::com::sun::star::uno::Reference< ::com::sun::star::awt::XTextComponent >   m_xActiveTextComponent;\n        ::com::sun::star::uno::Reference< ::com::sun::star::form::XFormController > m_xActiveController;\n#ifndef DONT_REMEMBER_LAST_CONTROL\n        \/\/ without this define, m_xActiveControl remembers the *last* active control, even\n        \/\/ if it, in the meantime, already lost the focus\n        bool                                                                        m_bActiveControl;\n            \/\/ so we need an additional boolean flag telling whether the active cotrol\n            \/\/ is really focused\n#endif\n        bool                                                                        m_bActiveControlIsReadOnly;\n        bool                                                                        m_bActiveControlIsRichText;\n\n        \/\/ listening at all controls of the active controller for focus changes\n        typedef ::comphelper::ImplementationReference< FmFocusListenerAdapter, ::com::sun::star::awt::XFocusListener >\n                                                                                    FocusListenerAdapter;\n        typedef ::std::vector< FocusListenerAdapter >                               FocusListenerAdapters;\n        FocusListenerAdapters                                                       m_aControlObservers;\n\n        typedef ::comphelper::ImplementationReference< FmMouseListenerAdapter, ::com::sun::star::awt::XMouseListener >\n                                                                                    MouseListenerAdapter;\n        MouseListenerAdapter                                                        m_aContextMenuObserver;\n\n        \/\/ translating between \"slots\" of the framework and \"features\" of the active control\n        typedef ::comphelper::ImplementationReference< FmTextControlFeature, ::com::sun::star::frame::XStatusListener >\n                                                                                    ControlFeature;\n        typedef ::std::map< SfxSlotId, ControlFeature, ::std::less< SfxSlotId > >   ControlFeatures;\n        ControlFeatures                                                             m_aControlFeatures;\n\n        SfxViewFrame*                                                               m_pViewFrame;\n        \/\/ invalidating slots\n        SfxBindings&                                                                m_rBindings;\n        Link                                                                        m_aControlActivationHandler;\n        AutoTimer                                                                   m_aClipboardInvalidation;\n        bool                                                                        m_bNeedClipboardInvalidation;\n\n    public:\n        FmTextControlShell( SfxViewFrame* _pFrame );\n        ~FmTextControlShell();\n\n        \/\/ clean up any resources associated with this instance\n        void    dispose();\n\n        void    ExecuteTextAttribute( SfxRequest& _rReq );\n        void    GetTextAttributeState( SfxItemSet& _rSet );\n        bool    IsActiveControl( bool _bCountRichTextOnly = false ) const;\n        void    ForgetActiveControl();\n        void    SetControlActivationHandler( const Link& _rHdl ) { m_aControlActivationHandler = _rHdl; }\n\n        \/** to be called when a form in our document has been activated\n        *\/\n        void    formActivated( const ::com::sun::star::uno::Reference< ::com::sun::star::form::XFormController >& _rxController );\n        \/** to be called when a form in our document has been deactivated\n        *\/\n        void    formDeactivated( const ::com::sun::star::uno::Reference< ::com::sun::star::form::XFormController >& _rxController );\n\n        \/** notifies the instance that the design mode has changed\n        *\/\n        void    designModeChanged( bool _bNewDesignMode );\n\n    protected:\n        \/\/ IFocusObserver\n        virtual void    focusGained( const ::com::sun::star::awt::FocusEvent& _rEvent );\n        virtual void    focusLost( const ::com::sun::star::awt::FocusEvent& _rEvent );\n\n        \/\/ IContextRequestObserver\n        virtual void    contextMenuRequested( const ::com::sun::star::awt::MouseEvent& _rEvent );\n\n        \/\/ ISlotInvalidator\n        virtual void    Invalidate( SfxSlotId _nSlot );\n\n    protected:\n        enum AttributeSet { eCharAttribs, eParaAttribs };\n        void    executeAttributeDialog( AttributeSet _eSet, SfxRequest& _rReq );\n        bool    executeSelectAll( );\n        bool    executeClipboardSlot( SfxSlotId _nSlot );\n\n    private:\n        inline  bool    isControllerListening() const { return !m_aControlObservers.empty(); }\n\n        FmTextControlFeature*\n                        implGetFeatureDispatcher(\n                            const ::com::sun::star::uno::Reference< ::com::sun::star::frame::XDispatchProvider >& _rxProvider,\n                            SfxApplication* _pApplication,\n                            SfxSlotId _nSlot\n                        );\n\n        \/\/ fills the given structure with dispatchers for the given slots, for the given control\n        void            fillFeatureDispatchers(\n                            const ::com::sun::star::uno::Reference< ::com::sun::star::awt::XControl > _rxControl,\n                            SfxSlotId* _pZeroTerminatedSlots,\n                            ControlFeatures& _rDispatchers\n                        );\n\n        \/\/\/ creates SfxPoolItes for all features in the given set, and puts them into the given SfxAllItemSet\n        void            transferFeatureStatesToItemSet(\n                            ControlFeatures& _rDispatchers,\n                            SfxAllItemSet& _rSet,\n                            bool _bTranslateLatin = false\n                        );\n\n        \/\/\/ to be called when a control has been activated\n        void    controlActivated( const ::com::sun::star::uno::Reference< ::com::sun::star::awt::XControl >& _rxControl );\n        \/\/\/ to be called when the currently active control has been deactivated\n        void    controlDeactivated( );\n\n        void    implClearActiveControlRef();\n\n        \/** starts listening at all controls of the given controller for focus events\n        @precond\n            we don't have an active controller currently\n        *\/\n        void    startControllerListening( const ::com::sun::star::uno::Reference< ::com::sun::star::form::XFormController >& _rxController );\n        \/** stops listening at the active controller\n        @precond\n            we have an active controller currently\n        *\/\n        void    stopControllerListening( );\n\n        DECL_LINK( OnInvalidateClipboard, void* );\n    };\n\n\/\/........................................................................\n} \/\/ namespace svx\n\/\/........................................................................\n\n#endif \/\/ SVX_SOURCE_INC_FMTEXTCONTROLSHELL_HXX\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: accportions.hxx,v $\n *\n *  $Revision: 1.17 $\n *\n *  last change: $Author: rt $ $Date: 2007-04-25 08:59: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#ifndef _ACCPORTIONS_HXX\n#define _ACCPORTIONS_HXX\n#include <SwPortionHandler.hxx>\n#include <sal\/types.h>\n\n#ifndef _RTL_USTRBUF_HXX_\n#include <rtl\/ustrbuf.hxx>\n#endif\n#include <vector>\n\nclass String;\nclass SwTxtNode;\nstruct SwSpecialPos;\nclass SwViewOption;\nnamespace com { namespace sun { namespace star {\n    namespace i18n { struct Boundary; }\n} } }\n\n\/**\n * collect text portion data from the layout through SwPortionHandler interface\n *\/\nclass SwAccessiblePortionData : public SwPortionHandler\n{\n    \/\/ the node this portion is referring to\n    const SwTxtNode* pTxtNode;\n\n    \/\/ variables used while collecting the data\n    rtl::OUStringBuffer aBuffer;\n    sal_Int32 nModelPosition;\n    sal_Bool bFinished;\n    const SwViewOption* pViewOptions;\n\n    \/\/ the accessible string\n    rtl::OUString sAccessibleString;\n\n    \/\/ positions array\n    \/\/ instances of Position_t must always include the minimum and\n    \/\/ maximum positions as first\/last elements (to simplify the\n    \/\/ algorithms)\n    typedef std::vector<sal_Int32> Positions_t;\n\n    Positions_t aLineBreaks;        \/\/\/ position of line breaks\n    Positions_t aModelPositions;    \/\/\/ position of portion breaks in the model\n    Positions_t aAccessiblePositions;   \/\/\/ portion breaks in sAccessibleString\n\n    typedef std::vector<sal_uInt8> PortionAttrs_t;\n    PortionAttrs_t aPortionAttrs;   \/\/\/ additional portion attributes\n\n    Positions_t* pSentences;    \/\/\/ positions of sentence breaks\n\n    size_t nBeforePortions;     \/\/\/ # of portions before first model character\n    sal_Bool bLastIsSpecial;    \/\/\/ set if last portion was 'Special()'\n\n    \/\/\/ returns the index of the first position whose value is smaller\n    \/\/\/ or equal, and whose following value is equal or larger\n    size_t FindBreak( const Positions_t& rPositions, sal_Int32 nValue );\n\n    \/\/\/ like FindBreak, but finds the last equal or larger position\n    size_t FindLastBreak( const Positions_t& rPositions, sal_Int32 nValue );\n\n    \/\/\/ fill the boundary with the values from rPositions[nPos]\n    void FillBoundary(com::sun::star::i18n::Boundary& rBound,\n                      const Positions_t& rPositions,\n                      size_t nPos );\n\n    \/\/\/ Access to portion attributes\n    sal_Bool IsPortionAttrSet( size_t nPortionNo, sal_uInt8 nAttr );\n    inline sal_Bool IsSpecialPortion( size_t nPortionNo );\n    inline sal_Bool IsReadOnlyPortion( size_t nPortionNo );\n    inline sal_Bool IsGrayPortion( size_t nPortionNo );\n\n    \/\/ Helper methods for SwPortionHandler:\n\n    \/\/\/ Is a portion of this type gray?\n    sal_Bool IsGrayPortionType( USHORT nType );\n\n    \/\/ helper method for GetEditableRange(...):\n    void AdjustAndCheck( sal_Int32 nPos, size_t& nPortionNo,\n                         USHORT& nCorePos, sal_Bool& bEdit );\n\npublic:\n    SwAccessiblePortionData( const SwTxtNode* pTxtNd,\n                             const SwViewOption* pViewOpt = NULL );\n    virtual ~SwAccessiblePortionData();\n\n    \/\/ SwPortionHandler methods\n    virtual void Text(USHORT nLength, USHORT nType);\n    virtual void Special(USHORT nLength, const String& rText, USHORT nType);\n    virtual void LineBreak();\n    virtual void Skip(USHORT nLength);\n    virtual void Finish();\n\n\n    \/\/ access to the portion data\n\n    \/\/\/ get the text string, as presented by the layout\n    const rtl::OUString& GetAccessibleString();\n\n    \/\/\/ get the start & end positions of the sentence\n    void GetLineBoundary( com::sun::star::i18n::Boundary& rBound,\n                          sal_Int32 nPos );\n\n    \/\/ get start and end position of the last line\n    void GetLastLineBoundary( com::sun::star::i18n::Boundary& rBound );\n\n    \/\/\/ get the position in the model string for a given\n    \/\/\/ (accessibility) position\n    USHORT GetModelPosition( sal_Int32 nPos );\n\n    \/\/\/ get the position in the accessibility string for a given model position\n    sal_Int32 GetAccessiblePosition( USHORT nPos );\n\n    \/\/\/ fill a SwSpecialPos structure, suitable for calling\n    \/\/\/ SwTxtFrm->GetCharRect\n    \/\/\/ Returns the core position, and fills thr rpPos either with NULL or\n    \/\/\/ with the &rPos, after putting the appropriate data into it.\n    USHORT FillSpecialPos( sal_Int32 nPos,\n                           SwSpecialPos& rPos,\n                           SwSpecialPos*& rpPos );\n\n\n    \/\/ get boundaries of words\/sentences. The data structures are\n    \/\/ created on-demand.\n    void GetSentenceBoundary( com::sun::star::i18n::Boundary& rBound,\n                              sal_Int32 nPos );\n\n    \/\/ get (a) boundary for attribut change\n    void GetAttributeBoundary( com::sun::star::i18n::Boundary& rBound,\n                               sal_Int32 nPos );\n\n    \/\/\/ Convert start and end positions into core positions.\n    \/\/\/ @returns true if 'special' portions are included either completely\n    \/\/\/          or not at all. This can be used to test whether editing\n    \/\/\/          that range would be legal\n    sal_Bool GetEditableRange( sal_Int32 nStart, sal_Int32 nEnd,\n                               USHORT& nCoreStart, USHORT& nCoreEnd );\n\n    \/\/\/ Determine whether this core position is valid for these portions.\n    \/\/\/ (A paragraph may be split into several frames, e.g. at page\n    \/\/\/  boundaries. In this case, only part of a paragraph is represented\n    \/\/\/  through this object. This method determines whether one particular\n    \/\/\/  position is valid for this object or not.)\n    sal_Bool IsValidCorePosition( USHORT nPos );\n    USHORT GetFirstValidCorePosition();\n    USHORT GetLastValidCorePosition();\n};\n\n\n#endif\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.17.438); FILE MERGED 2008\/04\/01 15:56:43 thb 1.17.438.2: #i85898# Stripping all external header guards 2008\/03\/31 16:53:39 rt 1.17.438.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: accportions.hxx,v $\n * $Revision: 1.18 $\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 _ACCPORTIONS_HXX\n#define _ACCPORTIONS_HXX\n#include <SwPortionHandler.hxx>\n#include <sal\/types.h>\n#include <rtl\/ustrbuf.hxx>\n#include <vector>\n\nclass String;\nclass SwTxtNode;\nstruct SwSpecialPos;\nclass SwViewOption;\nnamespace com { namespace sun { namespace star {\n    namespace i18n { struct Boundary; }\n} } }\n\n\/**\n * collect text portion data from the layout through SwPortionHandler interface\n *\/\nclass SwAccessiblePortionData : public SwPortionHandler\n{\n    \/\/ the node this portion is referring to\n    const SwTxtNode* pTxtNode;\n\n    \/\/ variables used while collecting the data\n    rtl::OUStringBuffer aBuffer;\n    sal_Int32 nModelPosition;\n    sal_Bool bFinished;\n    const SwViewOption* pViewOptions;\n\n    \/\/ the accessible string\n    rtl::OUString sAccessibleString;\n\n    \/\/ positions array\n    \/\/ instances of Position_t must always include the minimum and\n    \/\/ maximum positions as first\/last elements (to simplify the\n    \/\/ algorithms)\n    typedef std::vector<sal_Int32> Positions_t;\n\n    Positions_t aLineBreaks;        \/\/\/ position of line breaks\n    Positions_t aModelPositions;    \/\/\/ position of portion breaks in the model\n    Positions_t aAccessiblePositions;   \/\/\/ portion breaks in sAccessibleString\n\n    typedef std::vector<sal_uInt8> PortionAttrs_t;\n    PortionAttrs_t aPortionAttrs;   \/\/\/ additional portion attributes\n\n    Positions_t* pSentences;    \/\/\/ positions of sentence breaks\n\n    size_t nBeforePortions;     \/\/\/ # of portions before first model character\n    sal_Bool bLastIsSpecial;    \/\/\/ set if last portion was 'Special()'\n\n    \/\/\/ returns the index of the first position whose value is smaller\n    \/\/\/ or equal, and whose following value is equal or larger\n    size_t FindBreak( const Positions_t& rPositions, sal_Int32 nValue );\n\n    \/\/\/ like FindBreak, but finds the last equal or larger position\n    size_t FindLastBreak( const Positions_t& rPositions, sal_Int32 nValue );\n\n    \/\/\/ fill the boundary with the values from rPositions[nPos]\n    void FillBoundary(com::sun::star::i18n::Boundary& rBound,\n                      const Positions_t& rPositions,\n                      size_t nPos );\n\n    \/\/\/ Access to portion attributes\n    sal_Bool IsPortionAttrSet( size_t nPortionNo, sal_uInt8 nAttr );\n    inline sal_Bool IsSpecialPortion( size_t nPortionNo );\n    inline sal_Bool IsReadOnlyPortion( size_t nPortionNo );\n    inline sal_Bool IsGrayPortion( size_t nPortionNo );\n\n    \/\/ Helper methods for SwPortionHandler:\n\n    \/\/\/ Is a portion of this type gray?\n    sal_Bool IsGrayPortionType( USHORT nType );\n\n    \/\/ helper method for GetEditableRange(...):\n    void AdjustAndCheck( sal_Int32 nPos, size_t& nPortionNo,\n                         USHORT& nCorePos, sal_Bool& bEdit );\n\npublic:\n    SwAccessiblePortionData( const SwTxtNode* pTxtNd,\n                             const SwViewOption* pViewOpt = NULL );\n    virtual ~SwAccessiblePortionData();\n\n    \/\/ SwPortionHandler methods\n    virtual void Text(USHORT nLength, USHORT nType);\n    virtual void Special(USHORT nLength, const String& rText, USHORT nType);\n    virtual void LineBreak();\n    virtual void Skip(USHORT nLength);\n    virtual void Finish();\n\n\n    \/\/ access to the portion data\n\n    \/\/\/ get the text string, as presented by the layout\n    const rtl::OUString& GetAccessibleString();\n\n    \/\/\/ get the start & end positions of the sentence\n    void GetLineBoundary( com::sun::star::i18n::Boundary& rBound,\n                          sal_Int32 nPos );\n\n    \/\/ get start and end position of the last line\n    void GetLastLineBoundary( com::sun::star::i18n::Boundary& rBound );\n\n    \/\/\/ get the position in the model string for a given\n    \/\/\/ (accessibility) position\n    USHORT GetModelPosition( sal_Int32 nPos );\n\n    \/\/\/ get the position in the accessibility string for a given model position\n    sal_Int32 GetAccessiblePosition( USHORT nPos );\n\n    \/\/\/ fill a SwSpecialPos structure, suitable for calling\n    \/\/\/ SwTxtFrm->GetCharRect\n    \/\/\/ Returns the core position, and fills thr rpPos either with NULL or\n    \/\/\/ with the &rPos, after putting the appropriate data into it.\n    USHORT FillSpecialPos( sal_Int32 nPos,\n                           SwSpecialPos& rPos,\n                           SwSpecialPos*& rpPos );\n\n\n    \/\/ get boundaries of words\/sentences. The data structures are\n    \/\/ created on-demand.\n    void GetSentenceBoundary( com::sun::star::i18n::Boundary& rBound,\n                              sal_Int32 nPos );\n\n    \/\/ get (a) boundary for attribut change\n    void GetAttributeBoundary( com::sun::star::i18n::Boundary& rBound,\n                               sal_Int32 nPos );\n\n    \/\/\/ Convert start and end positions into core positions.\n    \/\/\/ @returns true if 'special' portions are included either completely\n    \/\/\/          or not at all. This can be used to test whether editing\n    \/\/\/          that range would be legal\n    sal_Bool GetEditableRange( sal_Int32 nStart, sal_Int32 nEnd,\n                               USHORT& nCoreStart, USHORT& nCoreEnd );\n\n    \/\/\/ Determine whether this core position is valid for these portions.\n    \/\/\/ (A paragraph may be split into several frames, e.g. at page\n    \/\/\/  boundaries. In this case, only part of a paragraph is represented\n    \/\/\/  through this object. This method determines whether one particular\n    \/\/\/  position is valid for this object or not.)\n    sal_Bool IsValidCorePosition( USHORT nPos );\n    USHORT GetFirstValidCorePosition();\n    USHORT GetLastValidCorePosition();\n};\n\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright (c) 2018 PaddlePaddle Authors. All Rights Reserve.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License. *\/\n\n#include \"paddle\/fluid\/operators\/teacher_student_sigmoid_loss_op.h\"\n#include \"paddle\/fluid\/operators\/math\/math_function.h\"\n\nnamespace paddle {\nnamespace operators {\n\nusing Tensor = framework::Tensor;\n\nclass TeacherStudentSigmoidLossOp : public framework::OperatorWithKernel {\n public:\n  using framework::OperatorWithKernel::OperatorWithKernel;\n\n  void InferShape(framework::InferShapeContext* ctx) const override {\n    PADDLE_ENFORCE(ctx->HasInput(\"X\"), \"Input(X) should be not null.\");\n    PADDLE_ENFORCE(ctx->HasInput(\"Label\"), \"Input(Label) should be not null.\");\n    PADDLE_ENFORCE(ctx->HasOutput(\"Y\"), \"Output(Y) should be not null.\");\n\n    auto x_dims = ctx->GetInputDim(\"X\");\n    auto label_dims = ctx->GetInputDim(\"Label\");\n    PADDLE_ENFORCE_EQ(x_dims.size(), 2UL, \"Input(X)'s rank should be 2.\");\n    PADDLE_ENFORCE_EQ(label_dims.size(), 2UL,\n                      \"Input(Label)'s rank should be 2.\");\n    PADDLE_ENFORCE_EQ(x_dims[0], label_dims[0],\n                      \"The 1st dimension of Input(X) and Input(Label) should \"\n                      \"be equal.\");\n    PADDLE_ENFORCE_EQ(label_dims[1], 1UL,\n                      \"The 2nd dimension of \"\n                      \"Input(Label) should be 1.\");\n    ctx->SetOutputDim(\"Y\", {x_dims[0], 1});\n    ctx->ShareLoD(\"X\", \/*->*\/ \"Y\");\n  }\n\n protected:\n  \/\/ Explicitly set that the data type of computation kernel of\n  \/\/ teacher_student_sigmoid_loss\n  \/\/ is determined by its input \"X\".\n  framework::OpKernelType GetExpectedKernelType(\n      const framework::ExecutionContext& ctx) const override {\n    return framework::OpKernelType(ctx.Input<Tensor>(\"X\")->type(),\n                                   ctx.device_context());\n  }\n};\n\nclass TeacherStudentSigmoidLossGradientOp\n    : public framework::OperatorWithKernel {\n public:\n  using framework::OperatorWithKernel::OperatorWithKernel;\n\n  void InferShape(framework::InferShapeContext* ctx) const override {\n    PADDLE_ENFORCE(ctx->HasInput(\"X\"), \"Input(X) should be not null.\");\n    PADDLE_ENFORCE(ctx->HasInput(\"Label\"), \"Input(Label) should be not null.\");\n    PADDLE_ENFORCE(ctx->HasInput(framework::GradVarName(\"Y\")),\n                   \"Input(Y@GRAD) should be not null.\");\n    PADDLE_ENFORCE(ctx->HasOutput(framework::GradVarName(\"X\")),\n                   \"Output(X@GRAD) should be not null.\");\n\n    auto x_dims = ctx->GetInputDim(\"X\");\n    auto label_dims = ctx->GetInputDim(\"Label\");\n    auto dy_dims = ctx->GetInputDim(framework::GradVarName(\"Y\"));\n    PADDLE_ENFORCE_EQ(x_dims.size(), 2, \"Input(X)'s rank should be 2.\");\n    PADDLE_ENFORCE_EQ(dy_dims.size(), 2, \"Input(Y@Grad)'s rank should be 2.\");\n    PADDLE_ENFORCE_EQ(label_dims.size(), 2, \"Input(Label)'s rank should be 2.\");\n    PADDLE_ENFORCE_EQ(x_dims[0], label_dims[0],\n                      \"The 1st dimension of Input(X) and Input(Label) should \"\n                      \"be equal.\");\n    PADDLE_ENFORCE_EQ(x_dims[0], dy_dims[0],\n                      \"The 1st dimension of Input(X) and Input(Y@Grad) should \"\n                      \"be equal.\");\n    PADDLE_ENFORCE_EQ(dy_dims[1], 1,\n                      \"The 2nd dimension of Input(Y@Grad) should be 1.\");\n    PADDLE_ENFORCE_EQ(label_dims[1], 1,\n                      \"When Attr(soft_label) == false, the 2nd dimension of \"\n                      \"Input(Label) should be 1.\");\n    ctx->SetOutputDim(framework::GradVarName(\"X\"), x_dims);\n    ctx->ShareLoD(\"X\", framework::GradVarName(\"X\"));\n  }\n\n protected:\n  \/\/ Explicitly set that the data type of computation kernel of\n  \/\/ teacher_student_sigmoid_loss\n  \/\/ is determined by its input \"X\".\n  framework::OpKernelType GetExpectedKernelType(\n      const framework::ExecutionContext& ctx) const override {\n    return framework::OpKernelType(ctx.Input<Tensor>(\"X\")->type(),\n                                   ctx.device_context());\n  }\n};\n\nclass TeacherStudentSigmoidLossOpMaker\n    : public framework::OpProtoAndCheckerMaker {\n public:\n  void Make() override {\n    AddInput(\"X\",\n             \"(Tensor, default Tensor<float>), a 2-D tensor with shape [N x 1],\"\n             \" where N is the batch size and D is the output. \"\n             \"This input is a probability computed by the previous operator, \"\n             \"which is almost always the result of a softmax operator.\");\n    AddInput(\"Label\",\n             \"(Tensor), the ground truth which is a 2-D tensor. \"\n             \"Label is a Tensor<float> with shape [N x 1]. \");\n    AddOutput(\"Y\",\n              \"(Tensor, default Tensor<float>), a 2-D tensor with shape \"\n              \"[N x 1]. The teacher student sigmoid loss.\");\n    AddAttr<float>(\n        \"soft_max_up_bound\",\n        \"fp32, if input > soft_max_up_bound, input will be bound, default 15.0\")\n        .SetDefault(15.0);\n    AddAttr<float>(\"soft_max_lower_bound\",\n                   \"fp32, if input < soft_max_lower_bound, input will be \"\n                   \"bound, default -15.0\")\n        .SetDefault(-15.0);\n    AddComment(R\"DOC(\nTeacherStudentSigmoidLoss Operator.\n\nIt's similarity to SigmoidCrossEntropyWithLogits Operator. The difference is that\nwe add another label(z') to original.\n        loss = max(x, 0) - x * z + log(1 + exp(-abs(x))) + max(x, 0) - x * z' + log(1 + exp(-abs(x)))\n        z is click or not\n        z' is teacher value \n        label = {-2, -1, [0, 2]}\n        when z' is not exist, clk = 0 : label = -2;\n        when z' is not exist, clk = 1 : label = -1;\n        when z' is exist    , clk = 0 : label = 0 + z';\n        when z' is exist    , clk = 1 : label = 1 + z';\n\n)DOC\");\n  }\n};\n\n}  \/\/ namespace operators\n}  \/\/ namespace paddle\n\nnamespace ops = paddle::operators;\nREGISTER_OPERATOR(teacher_student_sigmoid_loss,\n                  ops::TeacherStudentSigmoidLossOp,\n                  ops::TeacherStudentSigmoidLossOpMaker,\n                  paddle::framework::DefaultGradOpDescMaker<true>);\n\nREGISTER_OPERATOR(teacher_student_sigmoid_loss_grad,\n                  ops::TeacherStudentSigmoidLossGradientOp);\n\nREGISTER_OP_CPU_KERNEL(teacher_student_sigmoid_loss,\n                       ops::TeacherStudentSigmoidLossOpKernel<float>,\n                       ops::TeacherStudentSigmoidLossOpKernel<double>);\n\nREGISTER_OP_CPU_KERNEL(teacher_student_sigmoid_loss_grad,\n                       ops::TeacherStudentSigmoidLossGradOpKernel<float>,\n                       ops::TeacherStudentSigmoidLossGradOpKernel<double>);\n<commit_msg>remove mkl & fix commit test=develop<commit_after>\/* Copyright (c) 2018 PaddlePaddle Authors. All Rights Reserve.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License. *\/\n\n#include \"paddle\/fluid\/operators\/teacher_student_sigmoid_loss_op.h\"\n#include \"paddle\/fluid\/operators\/math\/math_function.h\"\n\nnamespace paddle {\nnamespace operators {\n\nusing Tensor = framework::Tensor;\n\nclass TeacherStudentSigmoidLossOp : public framework::OperatorWithKernel {\n public:\n  using framework::OperatorWithKernel::OperatorWithKernel;\n\n  void InferShape(framework::InferShapeContext* ctx) const override {\n    PADDLE_ENFORCE(ctx->HasInput(\"X\"), \"Input(X) should be not null.\");\n    PADDLE_ENFORCE(ctx->HasInput(\"Label\"), \"Input(Label) should be not null.\");\n    PADDLE_ENFORCE(ctx->HasOutput(\"Y\"), \"Output(Y) should be not null.\");\n\n    auto x_dims = ctx->GetInputDim(\"X\");\n    auto label_dims = ctx->GetInputDim(\"Label\");\n    PADDLE_ENFORCE_EQ(x_dims.size(), 2UL, \"Input(X)'s rank should be 2.\");\n    PADDLE_ENFORCE_EQ(label_dims.size(), 2UL,\n                      \"Input(Label)'s rank should be 2.\");\n    PADDLE_ENFORCE_EQ(x_dims[0], label_dims[0],\n                      \"The 1st dimension of Input(X) and Input(Label) should \"\n                      \"be equal.\");\n    PADDLE_ENFORCE_EQ(label_dims[1], 1UL,\n                      \"The 2nd dimension of \"\n                      \"Input(Label) should be 1.\");\n    ctx->SetOutputDim(\"Y\", {x_dims[0], 1});\n    ctx->ShareLoD(\"X\", \/*->*\/ \"Y\");\n  }\n\n protected:\n  \/\/ Explicitly set that the data type of computation kernel of\n  \/\/ teacher_student_sigmoid_loss\n  \/\/ is determined by its input \"X\".\n  framework::OpKernelType GetExpectedKernelType(\n      const framework::ExecutionContext& ctx) const override {\n    return framework::OpKernelType(ctx.Input<Tensor>(\"X\")->type(),\n                                   ctx.device_context());\n  }\n};\n\nclass TeacherStudentSigmoidLossGradientOp\n    : public framework::OperatorWithKernel {\n public:\n  using framework::OperatorWithKernel::OperatorWithKernel;\n\n  void InferShape(framework::InferShapeContext* ctx) const override {\n    PADDLE_ENFORCE(ctx->HasInput(\"X\"), \"Input(X) should be not null.\");\n    PADDLE_ENFORCE(ctx->HasInput(\"Label\"), \"Input(Label) should be not null.\");\n    PADDLE_ENFORCE(ctx->HasInput(framework::GradVarName(\"Y\")),\n                   \"Input(Y@GRAD) should be not null.\");\n    PADDLE_ENFORCE(ctx->HasOutput(framework::GradVarName(\"X\")),\n                   \"Output(X@GRAD) should be not null.\");\n\n    auto x_dims = ctx->GetInputDim(\"X\");\n    auto label_dims = ctx->GetInputDim(\"Label\");\n    auto dy_dims = ctx->GetInputDim(framework::GradVarName(\"Y\"));\n    PADDLE_ENFORCE_EQ(x_dims.size(), 2, \"Input(X)'s rank should be 2.\");\n    PADDLE_ENFORCE_EQ(dy_dims.size(), 2, \"Input(Y@Grad)'s rank should be 2.\");\n    PADDLE_ENFORCE_EQ(label_dims.size(), 2, \"Input(Label)'s rank should be 2.\");\n    PADDLE_ENFORCE_EQ(x_dims[0], label_dims[0],\n                      \"The 1st dimension of Input(X) and Input(Label) should \"\n                      \"be equal.\");\n    PADDLE_ENFORCE_EQ(x_dims[0], dy_dims[0],\n                      \"The 1st dimension of Input(X) and Input(Y@Grad) should \"\n                      \"be equal.\");\n    PADDLE_ENFORCE_EQ(dy_dims[1], 1,\n                      \"The 2nd dimension of Input(Y@Grad) should be 1.\");\n    PADDLE_ENFORCE_EQ(label_dims[1], 1,\n                      \"When Attr(soft_label) == false, the 2nd dimension of \"\n                      \"Input(Label) should be 1.\");\n    ctx->SetOutputDim(framework::GradVarName(\"X\"), x_dims);\n    ctx->ShareLoD(\"X\", framework::GradVarName(\"X\"));\n  }\n\n protected:\n  \/\/ Explicitly set that the data type of computation kernel of\n  \/\/ teacher_student_sigmoid_loss\n  \/\/ is determined by its input \"X\".\n  framework::OpKernelType GetExpectedKernelType(\n      const framework::ExecutionContext& ctx) const override {\n    return framework::OpKernelType(ctx.Input<Tensor>(\"X\")->type(),\n                                   ctx.device_context());\n  }\n};\n\nclass TeacherStudentSigmoidLossOpMaker\n    : public framework::OpProtoAndCheckerMaker {\n public:\n  void Make() override {\n    AddInput(\"X\",\n             \"(Tensor, default Tensor<float>), a 2-D tensor with shape [N x 1],\"\n             \" where N is the batch size and D is the output. \"\n             \"This input is a probability computed by the previous operator, \"\n             \"which is almost always the result of a softmax operator.\");\n    AddInput(\"Label\",\n             \"(Tensor), the ground truth which is a 2-D tensor. \"\n             \"Label is a Tensor<float> with shape [N x 1]. \");\n    AddOutput(\"Y\",\n              \"(Tensor, default Tensor<float>), a 2-D tensor with shape \"\n              \"[N x 1]. The teacher student sigmoid loss.\");\n    AddAttr<float>(\n        \"soft_max_up_bound\",\n        \"fp32, if input > soft_max_up_bound, input will be bound, default 15.0\")\n        .SetDefault(15.0);\n    AddAttr<float>(\"soft_max_lower_bound\",\n                   \"fp32, if input < soft_max_lower_bound, input will be \"\n                   \"bound, default -15.0\")\n        .SetDefault(-15.0);\n    AddComment(R\"DOC(\nTeacherStudentSigmoidLoss Operator.\n\nIt's similarity to SigmoidCrossEntropyWithLogits Operator. The difference is that\nwe add another label(z') to original.\n        loss = max(x, 0) - x * z + log(1 + exp(-abs(x))) + max(x, 0) - x * z' + log(1 + exp(-abs(x)))\n        z is click or not\n        z' is teacher value \n        label = {-2, -1, [0, 2]}\n        when z' is not exist, clk = 0 : label = -2;\n        when z' is not exist, clk = 1 : label = -1;\n        when z' is exist , clk = 0 : label = 0 + z';\n        when z' is exist    , clk = 1 : label = 1 + z';\n\n)DOC\");\n  }\n};\n\n}  \/\/ namespace operators\n}  \/\/ namespace paddle\n\nnamespace ops = paddle::operators;\nREGISTER_OPERATOR(teacher_student_sigmoid_loss,\n                  ops::TeacherStudentSigmoidLossOp,\n                  ops::TeacherStudentSigmoidLossOpMaker,\n                  paddle::framework::DefaultGradOpDescMaker<true>);\n\nREGISTER_OPERATOR(teacher_student_sigmoid_loss_grad,\n                  ops::TeacherStudentSigmoidLossGradientOp);\n\nREGISTER_OP_CPU_KERNEL(teacher_student_sigmoid_loss,\n                       ops::TeacherStudentSigmoidLossOpKernel<float>,\n                       ops::TeacherStudentSigmoidLossOpKernel<double>);\n\nREGISTER_OP_CPU_KERNEL(teacher_student_sigmoid_loss_grad,\n                       ops::TeacherStudentSigmoidLossGradOpKernel<float>,\n                       ops::TeacherStudentSigmoidLossGradOpKernel<double>);\n<|endoftext|>"}
{"text":"<commit_before>#ifndef Metric_arith\n#define Metric_arith\n\n#include <array>\n#include <limits>\n#include <string>\n#include <utility>\n#include <algorithm>\n#include <stdexcept>\n#include <cinttypes>\n#include <cstdint>\n\n#include \"algorithm.hpp\"\n\nnamespace arithmetic\n{\n\ttemplate <typename number> inline\n\tnumber operator+(number a, const number &b)\n\t{\n\t\treturn a += b;\n\t}\n\n\ttemplate <typename number> inline\n\tnumber operator-(number a, const number &b)\n\t{\n\t\treturn a -= b;\n\t}\n\n\ttemplate <typename number> inline\n\tnumber operator*(number a, const number &b)\n\t{\n\t\treturn a *= b;\n\t}\n\n\ttemplate <typename number> inline\n\tnumber operator\/(number a, const number &b)\n\t{\n\t\treturn a \/= b;\n\t}\n\n\ttemplate <typename number> inline\n\tnumber operator%(number a, const number &b)\n\t{\n\t\treturn a %= b;\n\t}\n\n\ttemplate <typename number> inline\n\tnumber operator++(number &a, int postfix)\n\t{\n\t\tnumber b = a;\n\t\t++a;\n\t\treturn b;\n\t}\n\n\ttemplate <typename number> inline\n\tnumber operator--(number &a, int postfix)\n\t{\n\t\tnumber b = a;\n\t\t--a;\n\t\treturn b;\n\t}\n\n\ttemplate <typename number> inline\n\tnumber operator<<(number a, unsigned b)\n\t{\n\t\treturn a <<= b;\n\t}\n\n\ttemplate <typename number> inline\n\tnumber operator>>(number a, unsigned b)\n\t{\n\t\treturn a >>= b;\n\t}\n\t\n\tusing namespace std::rel_ops;\n\n\n\ttemplate <size_t size> class integer\n\t{\n\t\tusing base = uint8_t;\n\t\tusing int_t = intmax_t;\n\t\tusing uint_t = uintmax_t;\n\n\t\tusing divide = std::imaxdiv;\n\t\tusing overflow = std::overflow_error;\n\t\tusing underflow = std::underflow_error;\n\n\t\tstatic const uint_t mod = 1 + std::numeric_limits<base>::max();\n\n\t\tstd::array<base, size> digits;\n\n\tpublic:\n\n\t\tinteger operator+=(const integer &that)\n\t\t{\n\t\t\tuint_t carry = 0;\n\t\t\tfor (size_t i = 0; i < size; ++i) {\n\t\t\t\tuint_t num = digits[i] + that.digits[i] + carry;\n\t\t\t\tif (mod < num) {\n\t\t\t\t\tauto div = divide(num, mod);\n\t\t\t\t\tdigits[i] = div.rem;\n\t\t\t\t\tcarry = div.quot;\t\n\t\t\t\t} else {\n\t\t\t\t\tdigits[i] = num;\n\t\t\t\t\tcarry = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (carry) {\n\t\t\t\tthrow overflow(\"+\");\n\t\t\t}\n\t\t\treturn *this;\n\t\t}\n\n\t\tinteger operator-=(const integer &that)\n\t\t{\n\t\t\tuint_t carry = 0;\n\t\t\tfor (size_t i = 0; i < size; ++i) {\n\t\t\t\tint_t num = digits[i] - that.digits[i] - carry;\n\t\t\t\tcarry = 0;\n\t\t\t\twhile (num < 0) {\n\t\t\t\t\tnum += mod;\n\t\t\t\t\t++carry;\n\t\t\t\t}\n\t\t\t\tdigits[i] = num;\n\t\t\t}\n\t\t\tif (carry) {\n\t\t\t\tthrow underflow(\"-\");\n\t\t\t}\n\t\t\treturn *this;\n\t\t}\n\n\t\tinteger operator*=(const integer &that)\n\t\t{\n\t\t\tuint_t carry = 0;\n\t\t\tuint_t sums[size*2] = {0};\n\t\t\tfor (size_t i = 0; i < size; ++i) {\n\t\t\t for (size_t j = 0; j < size; ++j) {\n\t\t\t\tuint_t num = digits[i] * that.digits[j] + carry;\n\t\t\t\tif (mod < num) {\n\t\t\t\t\tauto div = divide(num, mod);\n\t\t\t\t\tsums[i + j] += div.rem;\n\t\t\t\t\tcarry = div.quot;\n\t\t\t\t} else {\n\t\t\t\t\tsums[i + j] += num;\n\t\t\t\t\tcarry = 0;\n\t\t\t\t}\n\t\t\t }\n\t\t\t digits[i] = sums[i];\n\t\t\t sums[size + i] += carry;\n\t\t\t carry = 0;\n\t\t\t}\n\t\t\treturn *this;\n\t\t}\n\n\t\tinteger operator\/=(const integer &that)\n\t\t{\n\t\t\tinteger quot;\n\t\t\twhile (*this >= that) {\n\t\t\t\t*this -= that;\n\t\t\t\t++quot;\n\t\t\t}\n\t\t\tswap(quot);\n\t\t\treturn *this;\n\t\t}\n\n\t\tinteger operator%=(const integer &that)\n\t\t{\n\t\t\twhile (*this >= that) {\n\t\t\t\t*this -= that;\n\t\t\t}\n\t\t\treturn *this;\n\t\t}\n\n\t\tinteger operator++()\n\t\t{\n\t\t\tfor (base &dig : digits) {\n\t\t\t\tif (dig < mod) {\n\t\t\t\t\t++dig;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tdig = 0;\n\t\t\t}\n\t\t\treturn *this;\n\t\t}\n\n\t\tinteger operator--()\n\t\t{\n\t\t\tfor (base &dig : digits) {\n\t\t\t\tif (0 < dig) {\n\t\t\t\t\t--dig;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tdig = mod;\n\t\t\t}\n\t\t\treturn *this;\n\t\t}\n\n\t\tbool operator==(const integer &that)\n\t\t{\n\t\t\treturn digits == that.digits;\n\t\t}\n\n\t\tbool operator<(const integer &that)\n\t\t{\n\t\t\tbool equal = true;\n\t\t\tfor (size_t i = 0; i < size; ++i) {\n\t\t\t\tif (digits[i] > that.digits[i]) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\tif (digits[i] < that.digits[i]) {\n\t\t\t\t\tequal = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn !equal;\n\t\t}\n\n\t\tbool operator!()\n\t\t{\n\t\t\tauto zero = [](base dig){ return !dig; };\n\t\t\treturn algorithm::all_of(digits, zero);\n\t\t}\n\n\t\tinteger operator=(const std::string &string)\n\t\t{\n\t\t\tdigits.fill(0);\n\t\t\tfor (char byte : string) {\n\t\t\t\tuint_t carry = byte - '0';\n\t\t\t\tfor (size_t index = 0; index < size; ++index) {\n\t\t\t\t\tcarry += digits[index] * 10;\n\t\t\t\t\tif (mod < carry) {\n\t\t\t\t\t\tauto div = divide(carry, mod);\n\t\t\t\t\t\tdigits[index] = div.rem;\n\t\t\t\t\t\tcarry = div.quot;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tdigits[index] = carry;\n\t\t\t\t\t\tcarry = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (carry) {\n\t\t\t\t\tthrow overflow(\"=string\");\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *this;\n\t\t}\n\n\t\tinteger operator=(uint_t num)\n\t\t{\n\t\t\tdigits.fill(0);\n\t\t\tsize_t index = 0;\n\t\t\twhile (num) {\n\t\t\t\tauto div = divide(num, mod);\n\t\t\t\tdigits[index] = div.rem;\n\t\t\t\tnum = div.quot;\n\t\t\t\t++index;\n\t\t\t\tif (size == index) {\n\t\t\t\t\tthrow overflow(\"=int\");\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *this;\n\t\t}\n\n\t\toperator std::string() const\n\t\t{\n\t\t\tstd::string string;\n\t\t\tfor (base dig : digits) {\n\t\t\t\tstring += \":\" + std::to_string(dig);\n\t\t\t}\n\t\t\treturn string;\n\t\t}\n\n\t\toperator uint_t() const\n\t\t{\n\t\t\tsize_t index = 0;\n\t\t\tuint_t num = 0, order = 1;\n\t\t\twhile (index < size) {\n\t\t\t\tnum += order * digits[index];\n\t\t\t\torder *= mod;\n\t\t\t\t++index;\n\t\t\t}\n\t\t\treturn num;\n\t\t}\n\n\t\tinteger()\n\t\t{\n\t\t\tdigits.fill(0);\n\t\t}\n\n\t\tinteger(uint_t num)\n\t\t{\n\t\t\t*this = num;\n\t\t}\n\n\t\tinteger(const std::string &string)\n\t\t{\n\t\t\t*this = string;\n\t\t}\n\n\t\tinline void swap(integer &that)\n\t\t{\n\t\t\tdigits.swap(that.digits);\n\t\t}\n\t};\n\n}; \/\/ namespace arithmetic\n\n#endif \/\/ Metric_arithmetic\n\n<commit_msg>Fixed error confusing max and mod in precision integer<commit_after>#ifndef Metric_arith\n#define Metric_arith\n\n#include <array>\n#include <limits>\n#include <string>\n#include <utility>\n#include <algorithm>\n#include <stdexcept>\n#include <cinttypes>\n#include <cstdint>\n\n#include \"algorithm.hpp\"\n\nnamespace arithmetic\n{\n\ttemplate <typename number> inline\n\tnumber operator+(number a, const number &b)\n\t{\n\t\treturn a += b;\n\t}\n\n\ttemplate <typename number> inline\n\tnumber operator-(number a, const number &b)\n\t{\n\t\treturn a -= b;\n\t}\n\n\ttemplate <typename number> inline\n\tnumber operator*(number a, const number &b)\n\t{\n\t\treturn a *= b;\n\t}\n\n\ttemplate <typename number> inline\n\tnumber operator\/(number a, const number &b)\n\t{\n\t\treturn a \/= b;\n\t}\n\n\ttemplate <typename number> inline\n\tnumber operator%(number a, const number &b)\n\t{\n\t\treturn a %= b;\n\t}\n\n\ttemplate <typename number> inline\n\tnumber operator++(number &a, int postfix)\n\t{\n\t\tnumber b = a;\n\t\t++a;\n\t\treturn b;\n\t}\n\n\ttemplate <typename number> inline\n\tnumber operator--(number &a, int postfix)\n\t{\n\t\tnumber b = a;\n\t\t--a;\n\t\treturn b;\n\t}\n\n\ttemplate <typename number> inline\n\tnumber operator<<(number a, unsigned b)\n\t{\n\t\treturn a <<= b;\n\t}\n\n\ttemplate <typename number> inline\n\tnumber operator>>(number a, unsigned b)\n\t{\n\t\treturn a >>= b;\n\t}\n\t\n\tusing namespace std::rel_ops;\n\n\n\ttemplate <size_t size> class integer\n\t{\n\t\tusing base = uint8_t;\n\t\tusing int_t = intmax_t;\n\t\tusing uint_t = uintmax_t;\n\n\t\tusing divide = std::imaxdiv;\n\t\tusing overflow = std::overflow_error;\n\t\tusing underflow = std::underflow_error;\n\n\t\tstatic const uint_t max = std::numeric_limits<base>::max();\n\t\tstatic const uint_t mod = max + 1;\n\n\t\tstd::array<base, size> digits;\n\n\tpublic:\n\n\t\tinteger operator+=(const integer &that)\n\t\t{\n\t\t\tuint_t carry = 0;\n\t\t\tfor (size_t i = 0; i < size; ++i) {\n\t\t\t\tuint_t num = digits[i] + that.digits[i] + carry;\n\t\t\t\tif (max < num) {\n\t\t\t\t\tauto div = divide(num, mod);\n\t\t\t\t\tdigits[i] = div.rem;\n\t\t\t\t\tcarry = div.quot;\t\n\t\t\t\t} else {\n\t\t\t\t\tdigits[i] = num;\n\t\t\t\t\tcarry = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (carry) {\n\t\t\t\tthrow overflow(\"+\");\n\t\t\t}\n\t\t\treturn *this;\n\t\t}\n\n\t\tinteger operator-=(const integer &that)\n\t\t{\n\t\t\tuint_t carry = 0;\n\t\t\tfor (size_t i = 0; i < size; ++i) {\n\t\t\t\tint_t num = digits[i] - that.digits[i] - carry;\n\t\t\t\tcarry = 0;\n\t\t\t\twhile (num < 0) {\n\t\t\t\t\tnum += mod;\n\t\t\t\t\t++carry;\n\t\t\t\t}\n\t\t\t\tdigits[i] = num;\n\t\t\t}\n\t\t\tif (carry) {\n\t\t\t\tthrow underflow(\"-\");\n\t\t\t}\n\t\t\treturn *this;\n\t\t}\n\n\t\tinteger operator*=(const integer &that)\n\t\t{\n\t\t\tuint_t carry = 0;\n\t\t\tuint_t sums[size*2] = {0};\n\t\t\tfor (size_t i = 0; i < size; ++i) {\n\t\t\t for (size_t j = 0; j < size; ++j) {\n\t\t\t\tuint_t num = digits[i] * that.digits[j] + carry;\n\t\t\t\tif (max < num) {\n\t\t\t\t\tauto div = divide(num, mod);\n\t\t\t\t\tsums[i + j] += div.rem;\n\t\t\t\t\tcarry = div.quot;\n\t\t\t\t} else {\n\t\t\t\t\tsums[i + j] += num;\n\t\t\t\t\tcarry = 0;\n\t\t\t\t}\n\t\t\t }\n\t\t\t digits[i] = sums[i];\n\t\t\t sums[size + i] += carry;\n\t\t\t carry = 0;\n\t\t\t}\n\t\t\treturn *this;\n\t\t}\n\n\t\tinteger operator\/=(const integer &that)\n\t\t{\n\t\t\tinteger quot;\n\t\t\twhile (*this >= that) {\n\t\t\t\t*this -= that;\n\t\t\t\t++quot;\n\t\t\t}\n\t\t\tswap(quot);\n\t\t\treturn *this;\n\t\t}\n\n\t\tinteger operator%=(const integer &that)\n\t\t{\n\t\t\twhile (*this >= that) {\n\t\t\t\t*this -= that;\n\t\t\t}\n\t\t\treturn *this;\n\t\t}\n\n\t\tinteger operator++()\n\t\t{\n\t\t\tfor (base &dig : digits) {\n\t\t\t\tif (dig < max) {\n\t\t\t\t\t++dig;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tdig = 0;\n\t\t\t}\n\t\t\treturn *this;\n\t\t}\n\n\t\tinteger operator--()\n\t\t{\n\t\t\tfor (base &dig : digits) {\n\t\t\t\tif (0 < dig) {\n\t\t\t\t\t--dig;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tdig = max;\n\t\t\t}\n\t\t\treturn *this;\n\t\t}\n\n\t\tbool operator==(const integer &that)\n\t\t{\n\t\t\treturn digits == that.digits;\n\t\t}\n\n\t\tbool operator<(const integer &that)\n\t\t{\n\t\t\tbool equal = true;\n\t\t\tfor (size_t i = 0; i < size; ++i) {\n\t\t\t\tif (digits[i] > that.digits[i]) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\tif (digits[i] < that.digits[i]) {\n\t\t\t\t\tequal = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn !equal;\n\t\t}\n\n\t\tbool operator!()\n\t\t{\n\t\t\tauto zero = [](base dig){return !dig;};\n\t\t\treturn algorithm::all_of(digits, zero);\n\t\t}\n\n\t\tinteger operator=(const std::string &string)\n\t\t{\n\t\t\tdigits.fill(0);\n\t\t\tfor (char byte : string) {\n\t\t\t\tuint_t carry = byte - '0';\n\t\t\t\tfor (size_t i = 0; i < size; ++i) {\n\t\t\t\t\tcarry += digits[i] * 10;\n\t\t\t\t\tif (max < carry) {\n\t\t\t\t\t\tauto div = divide(carry, mod);\n\t\t\t\t\t\tdigits[i] = div.rem;\n\t\t\t\t\t\tcarry = div.quot;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tdigits[i] = carry;\n\t\t\t\t\t\tcarry = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (carry) {\n\t\t\t\t\tthrow overflow(\"=string\");\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *this;\n\t\t}\n\n\t\tinteger operator=(uint_t num)\n\t\t{\n\t\t\tdigits.fill(0);\n\t\t\tsize_t index = 0;\n\t\t\twhile (num) {\n\t\t\t\tauto div = divide(num, mod);\n\t\t\t\tdigits[index] = div.rem;\n\t\t\t\tnum = div.quot;\n\t\t\t\t++index;\n\t\t\t\tif (size == index) {\n\t\t\t\t\tthrow overflow(\"=int\");\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *this;\n\t\t}\n\n\t\toperator std::string() const\n\t\t{\n\t\t\t\/\/TODO\n\t\t\tstd::string string;\n\t\t\tfor (base dig : digits) {\n\t\t\t\tstring += \":\" + std::to_string(dig);\n\t\t\t}\n\t\t\treturn string;\n\t\t}\n\n\t\toperator uint_t() const\n\t\t{\n\t\t\tsize_t index = 0;\n\t\t\tuint_t num = 0, order = 1;\n\t\t\twhile (index < size) {\n\t\t\t\tnum += order * digits[index];\n\t\t\t\torder *= mod;\n\t\t\t\t++index;\n\t\t\t\t\/\/should detect overflow\n\t\t\t}\n\t\t\treturn num;\n\t\t}\n\n\t\tinteger()\n\t\t{\n\t\t\tdigits.fill(0);\n\t\t}\n\n\t\tinteger(uint_t num)\n\t\t{\n\t\t\t*this = num;\n\t\t}\n\n\t\tinteger(const std::string &string)\n\t\t{\n\t\t\t*this = string;\n\t\t}\n\n\t\tinline void swap(integer &that)\n\t\t{\n\t\t\tdigits.swap(that.digits);\n\t\t}\n\t};\n\n}; \/\/ namespace arithmetic\n\n#endif \/\/ Metric_arithmetic\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 \"Exodus.h\"\n\n\/\/ Moose includes\n#include \"DisplacedProblem.h\"\n#include \"ExodusFormatter.h\"\n#include \"FEProblem.h\"\n#include \"FileMesh.h\"\n#include \"MooseApp.h\"\n#include \"MooseVariableScalar.h\"\n#include \"LockFile.h\"\n\n#include \"libmesh\/exodusII_io.h\"\n\nregisterMooseObject(\"MooseApp\", Exodus);\n\ntemplate <>\nInputParameters\nvalidParams<Exodus>()\n{\n  \/\/ Get the base class parameters\n  InputParameters params = validParams<OversampleOutput>();\n  params += AdvancedOutput::enableOutputTypes(\"nodal elemental scalar postprocessor input\");\n\n  \/\/ Enable sequential file output (do not set default, the use_displace criteria relies on\n  \/\/ isParamValid, see Constructor)\n  params.addParam<bool>(\"sequence\",\n                        \"Enable\/disable sequential file output (enabled by default \"\n                        \"when 'use_displace = true', otherwise defaults to false\");\n\n  \/\/ Select problem dimension for mesh output\n  params.addDeprecatedParam<bool>(\"use_problem_dimension\",\n                                  \"Use the problem dimension to the mesh output. \"\n                                  \"Set to false when outputting lower dimensional \"\n                                  \"meshes embedded in a higher dimensional space.\",\n                                  \"Use 'output_dimension = problem_dimension' instead.\");\n\n  MooseEnum output_dimension(\"default 1 2 3 problem_dimension\", \"default\");\n\n  params.addParam<MooseEnum>(\n      \"output_dimension\", output_dimension, \"The dimension of the output file\");\n\n  params.addParamNamesToGroup(\"output_dimension\", \"Advanced\");\n\n  \/\/ Set the default padding to 3\n  params.set<unsigned int>(\"padding\") = 3;\n\n  \/\/ Add description for the Exodus class\n  params.addClassDescription(\"Object for output data in the Exodus II format\");\n\n  \/\/ Flag for overwriting at each timestep\n  params.addParam<bool>(\"overwrite\",\n                        false,\n                        \"When true the latest timestep will overwrite the \"\n                        \"existing file, so only a single timestep exists.\");\n\n  \/\/ Set outputting of the input to be on by default\n  params.set<ExecFlagEnum>(\"execute_input_on\") = EXEC_INITIAL;\n\n  \/\/ Flag for outputting discontinuous data to Exodus\n  params.addParam<bool>(\"discontinuous\",false,\"Enables discontinuous output format for Exodus files.\");\n\n  \/\/ Return the InputParameters\n  return params;\n}\n\nExodus::Exodus(const InputParameters & parameters)\n  : OversampleOutput(parameters),\n    _exodus_initialized(false),\n    _exodus_num(declareRestartableData<unsigned int>(\"exodus_num\", 0)),\n    _recovering(_app.isRecovering()),\n    _exodus_mesh_changed(declareRestartableData<bool>(\"exodus_mesh_changed\", true)),\n    _sequence(isParamValid(\"sequence\") ? getParam<bool>(\"sequence\")\n                                       : _use_displaced ? true : false),\n    _overwrite(getParam<bool>(\"overwrite\")),\n    _output_dimension(getParam<MooseEnum>(\"output_dimension\")),\n    _discontinuous(getParam<bool>(\"discontinuous\"))\n{\n  if (isParamValid(\"use_problem_dimension\"))\n  {\n    auto use_problem_dimension = getParam<bool>(\"use_problem_dimension\");\n\n    if (use_problem_dimension)\n      _output_dimension = \"problem_dimension\";\n    else\n      _output_dimension = \"default\";\n  }\n  if(_discontinuous && !getParam<bool>(\"elemental_as_nodal\")) mooseWarning(\"Requested discontinuous output, but 'elemental_as_nodal = false'\");\n}\n\nvoid\nExodus::setOutputDimension(unsigned int dim)\n{\n  if (dim >= 1 && dim <= 3)\n    _output_dimension = dim;\n  else\n    mooseError(\n        name(), \": Invalid dimension (\", dim, \") specified.  Allowed dimensions are 1, 2 or 3.\");\n}\n\nvoid\nExodus::initialSetup()\n{\n  \/\/ Call base class setup method\n  AdvancedOutput::initialSetup();\n\n  \/\/ The libMesh::ExodusII_IO will fail when it is closed if the object is created but\n  \/\/ nothing is written to the file. This checks that at least something will be written.\n  if (!hasOutput())\n    mooseError(\"The current settings result in nothing being output to the Exodus file.\");\n\n  \/\/ Test that some sort of variable output exists (case when all variables are disabled but input\n  \/\/ output is still enabled\n  if (!hasNodalVariableOutput() && !hasElementalVariableOutput() && !hasPostprocessorOutput() &&\n      !hasScalarOutput())\n    mooseError(\"The current settings results in only the input file and no variables being output \"\n               \"to the Exodus file, this is not supported.\");\n}\n\nvoid\nExodus::meshChanged()\n{\n  \/\/ Maintain Oversample::meshChanged() functionality\n  OversampleOutput::meshChanged();\n\n  \/\/ Indicate to the Exodus object that the mesh has changed\n  _exodus_mesh_changed = true;\n}\n\nvoid\nExodus::sequence(bool state)\n{\n  _sequence = state;\n}\n\nvoid\nExodus::outputSetup()\n{\n  if (_exodus_io_ptr)\n  {\n    \/\/ Do nothing if the ExodusII_IO objects exists, but has not been initialized\n    if (!_exodus_initialized)\n      return;\n\n    \/\/ Do nothing if the output is using oversampling. In this case the mesh that is being output\n    \/\/ has not been changed, so there is no need to create a new ExodusII_IO object\n    if (_oversample || _change_position)\n      return;\n\n    \/\/ Do nothing if the mesh has not changed and sequential output is not desired\n    if (!_exodus_mesh_changed && !_sequence)\n      return;\n  }\n\n  \/\/ Create the ExodusII_IO object\n  _exodus_io_ptr = libmesh_make_unique<ExodusII_IO>(_es_ptr->get_mesh());\n  _exodus_initialized = false;\n\n  \/\/ Increment file number and set appending status, append if all the following conditions are met:\n  \/\/   (1) If the application is recovering (not restarting)\n  \/\/   (2) The mesh has NOT changed\n  \/\/   (3) An existing Exodus file exists for appending (_exodus_num > 0)\n  \/\/   (4) Sequential output is NOT desired\n  if (_recovering && !_exodus_mesh_changed && _exodus_num > 0 && !_sequence)\n  {\n    \/\/ Set the recovering flag to false so that this special case is not triggered again\n    _recovering = false;\n\n    \/\/ Set the append flag to true b\/c on recover the file is being appended\n    _exodus_io_ptr->append(true);\n  }\n  else\n  {\n    \/\/ Increment file counter\n    if (_exodus_mesh_changed || _sequence)\n      _file_num++;\n\n    \/\/ Disable file appending and reset exodus file number count\n    _exodus_io_ptr->append(false);\n    _exodus_num = 1;\n  }\n\n  switch (_output_dimension)\n  {\n    case 0: \/\/ default\n      \/\/ If the spatial_dimension is 1 (this can only happen in recent\n      \/\/ versions of libmesh where the meaning of spatial_dimension has\n      \/\/ changed), then force the Exodus file to be written with\n      \/\/ num_dim==3.\n      \/\/\n      \/\/ This works around an issue in Paraview where 1D meshes cannot\n      \/\/ not be visualized correctly.  Note: the mesh_dimension() should\n      \/\/ get changed back to 1 the next time MeshBase::prepare_for_use()\n      \/\/ is called.\n      if (_es_ptr->get_mesh().spatial_dimension() == 1)\n        _exodus_io_ptr->write_as_dimension(3);\n\n      \/\/ If the spatial_dimension is 2 (again, only possible in recent\n      \/\/ versions of libmesh), then we need to be careful as this mesh\n      \/\/ would not have been written with num_dim==2 in the past.\n      \/\/\n      \/\/ We *can't* simply write it with num_dim==mesh_dimension,\n      \/\/ because mesh_dimension might be 1, and as discussed above, we\n      \/\/ don't allow num_dim==1 Exodus files.  Therefore, in this\n      \/\/ particular case, we force writing with num_dim==3.  Note: the\n      \/\/ humor of writing a mesh of 1D elements which lives in 2D space\n      \/\/ as num_dim==3 is not lost on me.\n      if (_es_ptr->get_mesh().spatial_dimension() == 2 && _es_ptr->get_mesh().mesh_dimension() == 1)\n        _exodus_io_ptr->write_as_dimension(3);\n\n      \/\/ Utilize the spatial dimension.  This value of this flag is\n      \/\/ superseded by the value passed to write_as_dimension(), if any.\n      if (_es_ptr->get_mesh().mesh_dimension() != 1)\n        _exodus_io_ptr->use_mesh_dimension_instead_of_spatial_dimension(true);\n\n      break;\n\n    case 1:\n    case 2:\n    case 3:\n      _exodus_io_ptr->write_as_dimension((int)_output_dimension);\n      break;\n\n    case 4: \/\/ problem_dimension\n      _exodus_io_ptr->use_mesh_dimension_instead_of_spatial_dimension(true);\n      break;\n\n    default:\n      mooseError(\"Unknown output_dimension\");\n  }\n}\n\nvoid\nExodus::outputNodalVariables()\n{\n  \/\/ Set the output variable to the nodal variables\n  std::vector<std::string> nodal(getNodalVariableOutput().begin(), getNodalVariableOutput().end());\n  _exodus_io_ptr->set_output_variables(nodal);\n\n  \/\/ Write the data via libMesh::ExodusII_IO\n  if (_discontinuous)\n    _exodus_io_ptr->write_timestep_discontinuous(\n        filename(), *_es_ptr, _exodus_num, time() + _app.getGlobalTimeOffset());\n  else\n    _exodus_io_ptr->write_timestep(\n        filename(), *_es_ptr, _exodus_num, time() + _app.getGlobalTimeOffset());\n\n  if (!_overwrite)\n    _exodus_num++;\n\n  \/\/ This satisfies the initialization of the ExodusII_IO object\n  _exodus_initialized = true;\n}\n\nvoid\nExodus::outputElementalVariables()\n{\n  \/\/ Make sure the the file is ready for writing of elemental data\n  if (!_exodus_initialized || !hasNodalVariableOutput())\n    outputEmptyTimestep();\n\n  \/\/ Write the elemental data\n  std::vector<std::string> elemental(getElementalVariableOutput().begin(),\n                                     getElementalVariableOutput().end());\n  _exodus_io_ptr->set_output_variables(elemental);\n  _exodus_io_ptr->write_element_data(*_es_ptr);\n}\n\nvoid\nExodus::outputPostprocessors()\n{\n  \/\/ List of desired postprocessor outputs\n  const std::set<std::string> & pps = getPostprocessorOutput();\n\n  \/\/ Append the postprocessor data to the global name value parameters; scalar outputs\n  \/\/ also append these member variables\n  for (const auto & name : pps)\n  {\n    _global_names.push_back(name);\n    _global_values.push_back(_problem_ptr->getPostprocessorValue(name));\n  }\n}\n\nvoid\nExodus::outputScalarVariables()\n{\n  \/\/ List of desired scalar outputs\n  const std::set<std::string> & out = getScalarOutput();\n\n  \/\/ Append the scalar to the global output lists\n  for (const auto & out_name : out)\n  {\n    \/\/ Make sure scalar values are in sync with the solution vector\n    \/\/ and are visible on this processor.  See TableOutput.C for\n    \/\/ TableOutput::outputScalarVariables() explanatory comments\n\n    MooseVariableScalar & scalar_var = _problem_ptr->getScalarVariable(0, out_name);\n    scalar_var.reinit();\n    VariableValue value = scalar_var.sln();\n\n    const std::vector<dof_id_type> & dof_indices = scalar_var.dofIndices();\n    const unsigned int n = dof_indices.size();\n    value.resize(n);\n\n    const DofMap & dof_map = scalar_var.sys().dofMap();\n    for (unsigned int i = 0; i != n; ++i)\n    {\n      const processor_id_type pid = dof_map.dof_owner(dof_indices[i]);\n      this->comm().broadcast(value[i], pid);\n    }\n\n    \/\/ If the scalar has a single component, output the name directly\n    if (n == 1)\n    {\n      _global_names.push_back(out_name);\n      _global_values.push_back(value[0]);\n    }\n\n    \/\/ If the scalar as many components add indices to the end of the name\n    else\n    {\n      for (unsigned int i = 0; i < n; ++i)\n      {\n        std::ostringstream os;\n        os << out_name << \"_\" << i;\n        _global_names.push_back(os.str());\n        _global_values.push_back(value[i]);\n      }\n    }\n  }\n}\n\nvoid\nExodus::outputInput()\n{\n  \/\/ Format the input file\n  ExodusFormatter syntax_formatter;\n  syntax_formatter.printInputFile(_app.actionWarehouse());\n  syntax_formatter.format();\n\n  \/\/ Store the information\n  _input_record = syntax_formatter.getInputFileRecord();\n}\n\nvoid\nExodus::output(const ExecFlagType & type)\n{\n  \/\/ Do nothing if there is nothing to output\n  if (!hasOutput(type))\n    return;\n\n  \/\/ Start the performance log\n  Moose::perf_log.push(\"Exodus::output()\", \"Output\");\n\n  \/\/ Prepare the ExodusII_IO object\n  outputSetup();\n  LockFile lf(filename(), processor_id() == 0);\n\n  \/\/ Adjust the position of the output\n  if (_app.hasOutputPosition())\n    _exodus_io_ptr->set_coordinate_offset(_app.getOutputPosition());\n\n  \/\/ Clear the global variables (postprocessors and scalars)\n  _global_names.clear();\n  _global_values.clear();\n\n  \/\/ Call the individual output methods\n  AdvancedOutput::output(type);\n\n  \/\/ Write the global variables (populated by the output methods)\n  if (!_global_values.empty())\n  {\n    if (!_exodus_initialized)\n      outputEmptyTimestep();\n    _exodus_io_ptr->write_global_data(_global_values, _global_names);\n  }\n\n  \/\/ Write the input file record if it exists and the output file is initialized\n  if (!_input_record.empty() && _exodus_initialized)\n  {\n    _exodus_io_ptr->write_information_records(_input_record);\n    _input_record.clear();\n  }\n\n  \/\/ Reset the mesh changed flag\n  _exodus_mesh_changed = false;\n\n  \/\/ Stop the logging\n  Moose::perf_log.pop(\"Exodus::output()\", \"Output\");\n}\n\nstd::string\nExodus::filename()\n{\n  \/\/ Append the .e extension on the base file name\n  std::ostringstream output;\n  output << _file_base + \".e\";\n\n  \/\/ Add the -s00x extension to the file\n  if (_file_num > 1)\n    output << \"-s\" << std::setw(_padding) << std::setprecision(0) << std::setfill('0') << std::right\n           << _file_num;\n\n  \/\/ Return the filename\n  return output.str();\n}\n\nvoid\nExodus::outputEmptyTimestep()\n{\n  \/\/ Write a timestep with no variables\n  _exodus_io_ptr->set_output_variables(std::vector<std::string>());\n  _exodus_io_ptr->write_timestep(\n      filename(), *_es_ptr, _exodus_num, time() + _app.getGlobalTimeOffset());\n\n  if (!_overwrite)\n    _exodus_num++;\n\n  _exodus_initialized = true;\n}\n<commit_msg>Adding explanation of parameter check in discontinuous Exodus.<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 \"Exodus.h\"\n\n\/\/ Moose includes\n#include \"DisplacedProblem.h\"\n#include \"ExodusFormatter.h\"\n#include \"FEProblem.h\"\n#include \"FileMesh.h\"\n#include \"MooseApp.h\"\n#include \"MooseVariableScalar.h\"\n#include \"LockFile.h\"\n\n#include \"libmesh\/exodusII_io.h\"\n\nregisterMooseObject(\"MooseApp\", Exodus);\n\ntemplate <>\nInputParameters\nvalidParams<Exodus>()\n{\n  \/\/ Get the base class parameters\n  InputParameters params = validParams<OversampleOutput>();\n  params += AdvancedOutput::enableOutputTypes(\"nodal elemental scalar postprocessor input\");\n\n  \/\/ Enable sequential file output (do not set default, the use_displace criteria relies on\n  \/\/ isParamValid, see Constructor)\n  params.addParam<bool>(\"sequence\",\n                        \"Enable\/disable sequential file output (enabled by default \"\n                        \"when 'use_displace = true', otherwise defaults to false\");\n\n  \/\/ Select problem dimension for mesh output\n  params.addDeprecatedParam<bool>(\"use_problem_dimension\",\n                                  \"Use the problem dimension to the mesh output. \"\n                                  \"Set to false when outputting lower dimensional \"\n                                  \"meshes embedded in a higher dimensional space.\",\n                                  \"Use 'output_dimension = problem_dimension' instead.\");\n\n  MooseEnum output_dimension(\"default 1 2 3 problem_dimension\", \"default\");\n\n  params.addParam<MooseEnum>(\n      \"output_dimension\", output_dimension, \"The dimension of the output file\");\n\n  params.addParamNamesToGroup(\"output_dimension\", \"Advanced\");\n\n  \/\/ Set the default padding to 3\n  params.set<unsigned int>(\"padding\") = 3;\n\n  \/\/ Add description for the Exodus class\n  params.addClassDescription(\"Object for output data in the Exodus II format\");\n\n  \/\/ Flag for overwriting at each timestep\n  params.addParam<bool>(\"overwrite\",\n                        false,\n                        \"When true the latest timestep will overwrite the \"\n                        \"existing file, so only a single timestep exists.\");\n\n  \/\/ Set outputting of the input to be on by default\n  params.set<ExecFlagEnum>(\"execute_input_on\") = EXEC_INITIAL;\n\n  \/\/ Flag for outputting discontinuous data to Exodus\n  params.addParam<bool>(\"discontinuous\",false,\"Enables discontinuous output format for Exodus files.\");\n\n  \/\/ Return the InputParameters\n  return params;\n}\n\nExodus::Exodus(const InputParameters & parameters)\n  : OversampleOutput(parameters),\n    _exodus_initialized(false),\n    _exodus_num(declareRestartableData<unsigned int>(\"exodus_num\", 0)),\n    _recovering(_app.isRecovering()),\n    _exodus_mesh_changed(declareRestartableData<bool>(\"exodus_mesh_changed\", true)),\n    _sequence(isParamValid(\"sequence\") ? getParam<bool>(\"sequence\")\n                                       : _use_displaced ? true : false),\n    _overwrite(getParam<bool>(\"overwrite\")),\n    _output_dimension(getParam<MooseEnum>(\"output_dimension\")),\n    _discontinuous(getParam<bool>(\"discontinuous\"))\n{\n  if (isParamValid(\"use_problem_dimension\"))\n  {\n    auto use_problem_dimension = getParam<bool>(\"use_problem_dimension\");\n\n    if (use_problem_dimension)\n      _output_dimension = \"problem_dimension\";\n    else\n      _output_dimension = \"default\";\n  }\n  \/\/ Cannot update parameters(const) to activate 'elemental_as_nodal' when 'discontinuous' is \n  \/\/ present,so issue a warning instead. When 'elemental_as_nodal' is false while \n  \/\/ 'discontinuous' is true, behavior reverts back to as if 'discontinuous' was set to false.\n  if(_discontinuous && !getParam<bool>(\"elemental_as_nodal\")) mooseWarning(\"Requested discontinuous output, but 'elemental_as_nodal = false'\");\n}\n\nvoid\nExodus::setOutputDimension(unsigned int dim)\n{\n  if (dim >= 1 && dim <= 3)\n    _output_dimension = dim;\n  else\n    mooseError(\n        name(), \": Invalid dimension (\", dim, \") specified.  Allowed dimensions are 1, 2 or 3.\");\n}\n\nvoid\nExodus::initialSetup()\n{\n  \/\/ Call base class setup method\n  AdvancedOutput::initialSetup();\n\n  \/\/ The libMesh::ExodusII_IO will fail when it is closed if the object is created but\n  \/\/ nothing is written to the file. This checks that at least something will be written.\n  if (!hasOutput())\n    mooseError(\"The current settings result in nothing being output to the Exodus file.\");\n\n  \/\/ Test that some sort of variable output exists (case when all variables are disabled but input\n  \/\/ output is still enabled\n  if (!hasNodalVariableOutput() && !hasElementalVariableOutput() && !hasPostprocessorOutput() &&\n      !hasScalarOutput())\n    mooseError(\"The current settings results in only the input file and no variables being output \"\n               \"to the Exodus file, this is not supported.\");\n}\n\nvoid\nExodus::meshChanged()\n{\n  \/\/ Maintain Oversample::meshChanged() functionality\n  OversampleOutput::meshChanged();\n\n  \/\/ Indicate to the Exodus object that the mesh has changed\n  _exodus_mesh_changed = true;\n}\n\nvoid\nExodus::sequence(bool state)\n{\n  _sequence = state;\n}\n\nvoid\nExodus::outputSetup()\n{\n  if (_exodus_io_ptr)\n  {\n    \/\/ Do nothing if the ExodusII_IO objects exists, but has not been initialized\n    if (!_exodus_initialized)\n      return;\n\n    \/\/ Do nothing if the output is using oversampling. In this case the mesh that is being output\n    \/\/ has not been changed, so there is no need to create a new ExodusII_IO object\n    if (_oversample || _change_position)\n      return;\n\n    \/\/ Do nothing if the mesh has not changed and sequential output is not desired\n    if (!_exodus_mesh_changed && !_sequence)\n      return;\n  }\n\n  \/\/ Create the ExodusII_IO object\n  _exodus_io_ptr = libmesh_make_unique<ExodusII_IO>(_es_ptr->get_mesh());\n  _exodus_initialized = false;\n\n  \/\/ Increment file number and set appending status, append if all the following conditions are met:\n  \/\/   (1) If the application is recovering (not restarting)\n  \/\/   (2) The mesh has NOT changed\n  \/\/   (3) An existing Exodus file exists for appending (_exodus_num > 0)\n  \/\/   (4) Sequential output is NOT desired\n  if (_recovering && !_exodus_mesh_changed && _exodus_num > 0 && !_sequence)\n  {\n    \/\/ Set the recovering flag to false so that this special case is not triggered again\n    _recovering = false;\n\n    \/\/ Set the append flag to true b\/c on recover the file is being appended\n    _exodus_io_ptr->append(true);\n  }\n  else\n  {\n    \/\/ Increment file counter\n    if (_exodus_mesh_changed || _sequence)\n      _file_num++;\n\n    \/\/ Disable file appending and reset exodus file number count\n    _exodus_io_ptr->append(false);\n    _exodus_num = 1;\n  }\n\n  switch (_output_dimension)\n  {\n    case 0: \/\/ default\n      \/\/ If the spatial_dimension is 1 (this can only happen in recent\n      \/\/ versions of libmesh where the meaning of spatial_dimension has\n      \/\/ changed), then force the Exodus file to be written with\n      \/\/ num_dim==3.\n      \/\/\n      \/\/ This works around an issue in Paraview where 1D meshes cannot\n      \/\/ not be visualized correctly.  Note: the mesh_dimension() should\n      \/\/ get changed back to 1 the next time MeshBase::prepare_for_use()\n      \/\/ is called.\n      if (_es_ptr->get_mesh().spatial_dimension() == 1)\n        _exodus_io_ptr->write_as_dimension(3);\n\n      \/\/ If the spatial_dimension is 2 (again, only possible in recent\n      \/\/ versions of libmesh), then we need to be careful as this mesh\n      \/\/ would not have been written with num_dim==2 in the past.\n      \/\/\n      \/\/ We *can't* simply write it with num_dim==mesh_dimension,\n      \/\/ because mesh_dimension might be 1, and as discussed above, we\n      \/\/ don't allow num_dim==1 Exodus files.  Therefore, in this\n      \/\/ particular case, we force writing with num_dim==3.  Note: the\n      \/\/ humor of writing a mesh of 1D elements which lives in 2D space\n      \/\/ as num_dim==3 is not lost on me.\n      if (_es_ptr->get_mesh().spatial_dimension() == 2 && _es_ptr->get_mesh().mesh_dimension() == 1)\n        _exodus_io_ptr->write_as_dimension(3);\n\n      \/\/ Utilize the spatial dimension.  This value of this flag is\n      \/\/ superseded by the value passed to write_as_dimension(), if any.\n      if (_es_ptr->get_mesh().mesh_dimension() != 1)\n        _exodus_io_ptr->use_mesh_dimension_instead_of_spatial_dimension(true);\n\n      break;\n\n    case 1:\n    case 2:\n    case 3:\n      _exodus_io_ptr->write_as_dimension((int)_output_dimension);\n      break;\n\n    case 4: \/\/ problem_dimension\n      _exodus_io_ptr->use_mesh_dimension_instead_of_spatial_dimension(true);\n      break;\n\n    default:\n      mooseError(\"Unknown output_dimension\");\n  }\n}\n\nvoid\nExodus::outputNodalVariables()\n{\n  \/\/ Set the output variable to the nodal variables\n  std::vector<std::string> nodal(getNodalVariableOutput().begin(), getNodalVariableOutput().end());\n  _exodus_io_ptr->set_output_variables(nodal);\n\n  \/\/ Write the data via libMesh::ExodusII_IO\n  if (_discontinuous)\n    _exodus_io_ptr->write_timestep_discontinuous(\n        filename(), *_es_ptr, _exodus_num, time() + _app.getGlobalTimeOffset());\n  else\n    _exodus_io_ptr->write_timestep(\n        filename(), *_es_ptr, _exodus_num, time() + _app.getGlobalTimeOffset());\n\n  if (!_overwrite)\n    _exodus_num++;\n\n  \/\/ This satisfies the initialization of the ExodusII_IO object\n  _exodus_initialized = true;\n}\n\nvoid\nExodus::outputElementalVariables()\n{\n  \/\/ Make sure the the file is ready for writing of elemental data\n  if (!_exodus_initialized || !hasNodalVariableOutput())\n    outputEmptyTimestep();\n\n  \/\/ Write the elemental data\n  std::vector<std::string> elemental(getElementalVariableOutput().begin(),\n                                     getElementalVariableOutput().end());\n  _exodus_io_ptr->set_output_variables(elemental);\n  _exodus_io_ptr->write_element_data(*_es_ptr);\n}\n\nvoid\nExodus::outputPostprocessors()\n{\n  \/\/ List of desired postprocessor outputs\n  const std::set<std::string> & pps = getPostprocessorOutput();\n\n  \/\/ Append the postprocessor data to the global name value parameters; scalar outputs\n  \/\/ also append these member variables\n  for (const auto & name : pps)\n  {\n    _global_names.push_back(name);\n    _global_values.push_back(_problem_ptr->getPostprocessorValue(name));\n  }\n}\n\nvoid\nExodus::outputScalarVariables()\n{\n  \/\/ List of desired scalar outputs\n  const std::set<std::string> & out = getScalarOutput();\n\n  \/\/ Append the scalar to the global output lists\n  for (const auto & out_name : out)\n  {\n    \/\/ Make sure scalar values are in sync with the solution vector\n    \/\/ and are visible on this processor.  See TableOutput.C for\n    \/\/ TableOutput::outputScalarVariables() explanatory comments\n\n    MooseVariableScalar & scalar_var = _problem_ptr->getScalarVariable(0, out_name);\n    scalar_var.reinit();\n    VariableValue value = scalar_var.sln();\n\n    const std::vector<dof_id_type> & dof_indices = scalar_var.dofIndices();\n    const unsigned int n = dof_indices.size();\n    value.resize(n);\n\n    const DofMap & dof_map = scalar_var.sys().dofMap();\n    for (unsigned int i = 0; i != n; ++i)\n    {\n      const processor_id_type pid = dof_map.dof_owner(dof_indices[i]);\n      this->comm().broadcast(value[i], pid);\n    }\n\n    \/\/ If the scalar has a single component, output the name directly\n    if (n == 1)\n    {\n      _global_names.push_back(out_name);\n      _global_values.push_back(value[0]);\n    }\n\n    \/\/ If the scalar as many components add indices to the end of the name\n    else\n    {\n      for (unsigned int i = 0; i < n; ++i)\n      {\n        std::ostringstream os;\n        os << out_name << \"_\" << i;\n        _global_names.push_back(os.str());\n        _global_values.push_back(value[i]);\n      }\n    }\n  }\n}\n\nvoid\nExodus::outputInput()\n{\n  \/\/ Format the input file\n  ExodusFormatter syntax_formatter;\n  syntax_formatter.printInputFile(_app.actionWarehouse());\n  syntax_formatter.format();\n\n  \/\/ Store the information\n  _input_record = syntax_formatter.getInputFileRecord();\n}\n\nvoid\nExodus::output(const ExecFlagType & type)\n{\n  \/\/ Do nothing if there is nothing to output\n  if (!hasOutput(type))\n    return;\n\n  \/\/ Start the performance log\n  Moose::perf_log.push(\"Exodus::output()\", \"Output\");\n\n  \/\/ Prepare the ExodusII_IO object\n  outputSetup();\n  LockFile lf(filename(), processor_id() == 0);\n\n  \/\/ Adjust the position of the output\n  if (_app.hasOutputPosition())\n    _exodus_io_ptr->set_coordinate_offset(_app.getOutputPosition());\n\n  \/\/ Clear the global variables (postprocessors and scalars)\n  _global_names.clear();\n  _global_values.clear();\n\n  \/\/ Call the individual output methods\n  AdvancedOutput::output(type);\n\n  \/\/ Write the global variables (populated by the output methods)\n  if (!_global_values.empty())\n  {\n    if (!_exodus_initialized)\n      outputEmptyTimestep();\n    _exodus_io_ptr->write_global_data(_global_values, _global_names);\n  }\n\n  \/\/ Write the input file record if it exists and the output file is initialized\n  if (!_input_record.empty() && _exodus_initialized)\n  {\n    _exodus_io_ptr->write_information_records(_input_record);\n    _input_record.clear();\n  }\n\n  \/\/ Reset the mesh changed flag\n  _exodus_mesh_changed = false;\n\n  \/\/ Stop the logging\n  Moose::perf_log.pop(\"Exodus::output()\", \"Output\");\n}\n\nstd::string\nExodus::filename()\n{\n  \/\/ Append the .e extension on the base file name\n  std::ostringstream output;\n  output << _file_base + \".e\";\n\n  \/\/ Add the -s00x extension to the file\n  if (_file_num > 1)\n    output << \"-s\" << std::setw(_padding) << std::setprecision(0) << std::setfill('0') << std::right\n           << _file_num;\n\n  \/\/ Return the filename\n  return output.str();\n}\n\nvoid\nExodus::outputEmptyTimestep()\n{\n  \/\/ Write a timestep with no variables\n  _exodus_io_ptr->set_output_variables(std::vector<std::string>());\n  _exodus_io_ptr->write_timestep(\n      filename(), *_es_ptr, _exodus_num, time() + _app.getGlobalTimeOffset());\n\n  if (!_overwrite)\n    _exodus_num++;\n\n  _exodus_initialized = true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: localdataimportsvc.cxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-16 15:11: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_configmgr.hxx\"\n\n#include \"localdataimportsvc.hxx\"\n\n#ifndef CONFIGMGR_LOCALBE_LOCALSINGLEBACKEND_HXX_\n#include \"localsinglebackend.hxx\"\n#endif\n\n#ifndef CONFIGMGR_API_FACTORY_HXX_\n#include \"confapifactory.hxx\"\n#endif\n\n#ifndef _RTL_USTRBUF_HXX_\n#include <rtl\/ustrbuf.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_WRAPPEDTARGETRUNTIMEEXCEPTION_HPP_\n#include <com\/sun\/star\/lang\/WrappedTargetRuntimeException.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONFIGURATION_BACKEND_XLAYERIMPORTER_HPP_\n#include <com\/sun\/star\/configuration\/backend\/XLayerImporter.hpp>\n#endif\n\n\/\/ -----------------------------------------------------------------------------\n#define OUSTRING( constascii ) rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(constascii))\n\/\/ -----------------------------------------------------------------------------\nnamespace configmgr\n{\n\/\/ -----------------------------------------------------------------------------\n    namespace localbe\n    {\n\/\/ -----------------------------------------------------------------------------\n        namespace backend = ::com::sun::star::configuration::backend;\n\/\/ -----------------------------------------------------------------------------\n\nAsciiServiceName const aLocalDataImportServices[] =\n{\n    \"com.sun.star.configuration.backend.LocalDataImporter\",\n    0,\n    \"com.sun.star.configuration.backend.DataImporter\",\n    0\n};\nconst ServiceImplementationInfo aLocalDataImportSI =\n{\n    \"com.sun.star.comp.configuration.backend.LocalDataImporter\",\n    aLocalDataImportServices,\n    aLocalDataImportServices + 3\n};\n\/\/ -----------------------------------------------------------------------------\n\nconst ServiceRegistrationInfo* getLocalDataImportServiceInfo()\n{ return getRegistrationInfo(& aLocalDataImportSI); }\n\/\/ -----------------------------------------------------------------------------\n\ninline\nServiceInfoHelper LocalDataImportService::getServiceInfo()\n{\n    return & aLocalDataImportSI;\n}\n\/\/ -----------------------------------------------------------------------------\n\nuno::Reference< uno::XInterface > SAL_CALL instantiateLocalDataImporter\n( CreationContext const& xContext )\n{\n    return * new LocalDataImportService( xContext );\n}\n\/\/ -----------------------------------------------------------------------------\n\nLocalDataImportService::LocalDataImportService(CreationArg _xContext)\n: m_xServiceFactory(_xContext->getServiceManager(), uno::UNO_QUERY)\n{\n    if (!m_xServiceFactory.is())\n    {\n        OUString sMessage = OUSTRING(\"Configuration Importer: Context has no service manager (or interface is missing)\");\n        throw lang::NullPointerException(sMessage,NULL);\n    }\n}\n\/\/ -----------------------------------------------------------------------------\n\nLocalDataImportService::~LocalDataImportService()\n{}\n\/\/ -----------------------------------------------------------------------------\n\nnamespace\n{\n\/\/ -----------------------------------------------------------------------------\n    struct JobDesc\n    {\n        explicit JobDesc(task::XJob * pJob, const uno::Sequence< beans::NamedValue >& aArguments);\n\n        OUString aLayerDataUrl;\n        OUString aImporterService;\n\n        OUString aComponent;\n        OUString aEntity;\n\n        uno::Reference< backend::XLayer > xLayerFilter;\n\n        sal_Bool overwrite;\n        sal_Bool truncate;\n\n        sal_Bool use_component;\n        sal_Bool use_entity;\n        sal_Bool use_overwrite;\n        sal_Bool use_truncate;\n    };\n    \/\/ -----------------------------------------------------------------------------\n\n    JobDesc::JobDesc(task::XJob * pJob, const uno::Sequence< beans::NamedValue >& aArguments)\n    : aLayerDataUrl()\n    , aImporterService()\n    , aComponent()\n    , aEntity()\n    , xLayerFilter()\n    , overwrite(true)\n    , truncate(false)\n    , use_component(false)\n    , use_entity(false)\n    , use_overwrite(false)\n    , use_truncate(false)\n    {\n        sal_Int16 const nCount = static_cast<sal_Int16>(aArguments.getLength());\n\n        if (sal_Int32(nCount) != aArguments.getLength())\n        {\n            OUString sMessage = OUSTRING(\"Too many arguments for LocalDataImporter Job\");\n            throw lang::IllegalArgumentException(sMessage,pJob,0);\n        }\n\n        for (sal_Int16 i=0; i < nCount; ++i)\n        {\n            sal_Bool bKnown = false;\n            sal_Bool bGood  = false;\n\n            if (aArguments[i].Name.equalsAsciiL(RTL_CONSTASCII_STRINGPARAM(\"LayerDataUrl\")))\n            {\n                bKnown = true;\n                bGood  = (aArguments[i].Value >>= aLayerDataUrl);\n            }\n            else if (aArguments[i].Name.equalsAsciiL(RTL_CONSTASCII_STRINGPARAM(\"ImporterService\")))\n            {\n                bKnown = true;\n                bGood  = (aArguments[i].Value >>= aImporterService);\n            }\n            else if (aArguments[i].Name.equalsAsciiL(RTL_CONSTASCII_STRINGPARAM(\"Component\")))\n            {\n                bKnown = true;\n                bGood  = (aArguments[i].Value >>= aComponent);\n                use_component = bGood && (aComponent.getLength() != 0);\n            }\n            else if (aArguments[i].Name.equalsAsciiL(RTL_CONSTASCII_STRINGPARAM(\"Entity\")))\n            {\n                bKnown = true;\n                bGood  = (aArguments[i].Value >>= aEntity);\n                use_entity = bGood && (aEntity.getLength() != 0);\n            }\n            else if (aArguments[i].Name.equalsAsciiL(RTL_CONSTASCII_STRINGPARAM(\"LayerFilter\")))\n            {\n                bKnown = true;\n                bGood  = (aArguments[i].Value >>= xLayerFilter);\n                if (xLayerFilter.is() && !uno::Reference<lang::XInitialization>::query(xLayerFilter).is())\n                    bGood = false;\n            }\n            else if (aArguments[i].Name.equalsAsciiL(RTL_CONSTASCII_STRINGPARAM(\"OverwriteExisting\")))\n            {\n                bKnown = true;\n                bGood  = (aArguments[i].Value >>= overwrite);\n                use_overwrite = bGood;\n            }\n            else if (aArguments[i].Name.equalsAsciiL(RTL_CONSTASCII_STRINGPARAM(\"TruncateExisting\")))\n            {\n                bKnown = true;\n                bGood  = (aArguments[i].Value >>= truncate);\n                use_truncate = bGood;\n            }\n\n            if (!bGood)\n            {\n                rtl::OUStringBuffer sMsg;\n                sMsg.appendAscii(\"LocalDataImportService - Illegal argument: \");\n                if (bKnown)\n                    sMsg.appendAscii(\"Wrong value type for argument '\");\n                else\n                    sMsg.appendAscii(\"Unknown argument '\");\n\n                sMsg.append(aArguments[i].Name).appendAscii(\"'.\");\n\n                throw lang::IllegalArgumentException(sMsg.makeStringAndClear(),pJob,i+1);\n            }\n        }\n        if (aLayerDataUrl.getLength() == 0)\n        {\n            rtl::OUStringBuffer sMsg;\n            sMsg.appendAscii(\"LocalDataImportService - Missing argument: \");\n            sMsg.appendAscii(\"No data URL available\");\n            throw lang::IllegalArgumentException(sMsg.makeStringAndClear(),pJob,0);\n        }\n        if (aImporterService.getLength() == 0)\n        {\n            if (use_truncate && truncate || use_overwrite && !overwrite)\n                aImporterService = OUSTRING(\"com.sun.star.configuration.backend.CopyImporter\");\n            else\n                aImporterService = OUSTRING(\"com.sun.star.configuration.backend.MergeImporter\");\n        }\n    }\n    \/\/ -----------------------------------------------------------------------------\n\n    static\n    inline\n    uno::Type getOverwriteFailedExceptionType()\n    {\n        lang::IllegalAccessException const * const selected = 0;\n        return ::getCppuType(selected);\n    }\n\/\/ -----------------------------------------------------------------------------\n}\n\/\/ -----------------------------------------------------------------------------\n\/\/ XJob\n\nuno::Any SAL_CALL\n    LocalDataImportService::execute( const uno::Sequence< beans::NamedValue >& Arguments )\n        throw (lang::IllegalArgumentException, uno::Exception, uno::RuntimeException)\n{\n    JobDesc const aJob(this,Arguments);\n\n    ServiceFactory aFactory = this->getServiceFactory();\n\n    uno::Reference< backend::XLayer > xLayer = aJob.use_component ?\n        LocalSingleBackend::createSimpleLayer(aFactory,aJob.aLayerDataUrl, aJob.aComponent ):\n        LocalSingleBackend::createSimpleLayer(aFactory,aJob.aLayerDataUrl) ;\n\n    if (!xLayer.is())\n    {\n        OUString sMessage = OUSTRING(\"LocalDataImportService - Cannot create layer to import from\");\n        throw lang::NullPointerException(sMessage,*this);\n    }\n\n    uno::Reference< lang::XInitialization > xFilterInit(aJob.xLayerFilter,uno::UNO_QUERY);\n    if (xFilterInit.is())\n    {\n        beans::NamedValue argvalue(\n            OUString( RTL_CONSTASCII_USTRINGPARAM(\"Source\") ),\n            uno::makeAny( xLayer) );\n\n        uno::Sequence< uno::Any > args(1);\n        args[0] <<= argvalue;\n\n        xFilterInit->initialize(args);\n\n        xLayer = aJob.xLayerFilter;\n    }\n\n    uno::Reference< backend::XLayerImporter > xImporter;\n\n    int nArgCount = 0;\n    if (aJob.use_overwrite) ++nArgCount;\n    if (aJob.use_truncate)  ++nArgCount;\n\n    if (nArgCount)\n    {\n        uno::Sequence< uno::Any > aArgs(nArgCount);\n\n        int n = 0;\n        if (aJob.use_overwrite)\n            aArgs[n++] <<= beans::NamedValue(OUSTRING(\"Overwrite\"), uno::makeAny(aJob.overwrite));\n\n        if (aJob.use_truncate)\n            aArgs[n++] <<= beans::NamedValue(OUSTRING(\"Truncate\"),  uno::makeAny(aJob.truncate));\n\n        OSL_ASSERT(n == nArgCount);\n\n        xImporter.set( aFactory->createInstanceWithArguments(aJob.aImporterService,aArgs), uno::UNO_QUERY);\n    }\n    else\n        xImporter.set( aFactory->createInstance(aJob.aImporterService), uno::UNO_QUERY);\n\n    if (!xImporter.is())\n    {\n        OUString sMessage = OUSTRING(\"LocalDataImportService - Cannot create importer service: \") + aJob.aImporterService;\n        throw lang::NullPointerException(sMessage,*this);\n    }\n\n    try\n    {\n        if (aJob.use_entity)\n            xImporter->importLayerForEntity(xLayer,aJob.aEntity);\n\n        else\n            xImporter->importLayer(xLayer);\n    }\n    catch (lang::WrappedTargetException & e)\n    {\n        if (aJob.overwrite || !e.TargetException.isExtractableTo(getOverwriteFailedExceptionType())) throw;\n        return e.TargetException;\n    }\n    catch (lang::WrappedTargetRuntimeException & e)\n    {\n        if (aJob.overwrite || !e.TargetException.isExtractableTo(getOverwriteFailedExceptionType())) throw;\n        return e.TargetException;\n    }\n\n    return uno::Any();\n}\n\/\/ -----------------------------------------------------------------------------\n\n\/\/ XServiceInfo\n\nOUString SAL_CALL\n    LocalDataImportService::getImplementationName(  )\n        throw (uno::RuntimeException)\n{\n    return getServiceInfo().getImplementationName( );\n}\n\/\/ -----------------------------------------------------------------------------\n\n\nsal_Bool SAL_CALL\n    LocalDataImportService::supportsService( const OUString& ServiceName )\n        throw (uno::RuntimeException)\n{\n    return getServiceInfo().supportsService( ServiceName );\n}\n\/\/ -----------------------------------------------------------------------------\n\n\nuno::Sequence< ::rtl::OUString > SAL_CALL\n    LocalDataImportService::getSupportedServiceNames(  )\n        throw (uno::RuntimeException)\n{\n    return getServiceInfo().getSupportedServiceNames( );\n}\n\/\/ -----------------------------------------------------------------------------\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ -----------------------------------------------------------------------------\n    } \/\/ namespace\n\n\/\/ -----------------------------------------------------------------------------\n} \/\/ namespace\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.8.72); FILE MERGED 2008\/04\/01 15:06:46 thb 1.8.72.3: #i85898# Stripping all external header guards 2008\/04\/01 12:27:27 thb 1.8.72.2: #i85898# Stripping all external header guards 2008\/03\/31 12:22:48 rt 1.8.72.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: localdataimportsvc.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_configmgr.hxx\"\n\n#include \"localdataimportsvc.hxx\"\n#include \"localsinglebackend.hxx\"\n\n#ifndef CONFIGMGR_API_FACTORY_HXX_\n#include \"confapifactory.hxx\"\n#endif\n#include <rtl\/ustrbuf.hxx>\n#include <com\/sun\/star\/lang\/WrappedTargetRuntimeException.hpp>\n#include <com\/sun\/star\/configuration\/backend\/XLayerImporter.hpp>\n\n\/\/ -----------------------------------------------------------------------------\n#define OUSTRING( constascii ) rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(constascii))\n\/\/ -----------------------------------------------------------------------------\nnamespace configmgr\n{\n\/\/ -----------------------------------------------------------------------------\n    namespace localbe\n    {\n\/\/ -----------------------------------------------------------------------------\n        namespace backend = ::com::sun::star::configuration::backend;\n\/\/ -----------------------------------------------------------------------------\n\nAsciiServiceName const aLocalDataImportServices[] =\n{\n    \"com.sun.star.configuration.backend.LocalDataImporter\",\n    0,\n    \"com.sun.star.configuration.backend.DataImporter\",\n    0\n};\nconst ServiceImplementationInfo aLocalDataImportSI =\n{\n    \"com.sun.star.comp.configuration.backend.LocalDataImporter\",\n    aLocalDataImportServices,\n    aLocalDataImportServices + 3\n};\n\/\/ -----------------------------------------------------------------------------\n\nconst ServiceRegistrationInfo* getLocalDataImportServiceInfo()\n{ return getRegistrationInfo(& aLocalDataImportSI); }\n\/\/ -----------------------------------------------------------------------------\n\ninline\nServiceInfoHelper LocalDataImportService::getServiceInfo()\n{\n    return & aLocalDataImportSI;\n}\n\/\/ -----------------------------------------------------------------------------\n\nuno::Reference< uno::XInterface > SAL_CALL instantiateLocalDataImporter\n( CreationContext const& xContext )\n{\n    return * new LocalDataImportService( xContext );\n}\n\/\/ -----------------------------------------------------------------------------\n\nLocalDataImportService::LocalDataImportService(CreationArg _xContext)\n: m_xServiceFactory(_xContext->getServiceManager(), uno::UNO_QUERY)\n{\n    if (!m_xServiceFactory.is())\n    {\n        OUString sMessage = OUSTRING(\"Configuration Importer: Context has no service manager (or interface is missing)\");\n        throw lang::NullPointerException(sMessage,NULL);\n    }\n}\n\/\/ -----------------------------------------------------------------------------\n\nLocalDataImportService::~LocalDataImportService()\n{}\n\/\/ -----------------------------------------------------------------------------\n\nnamespace\n{\n\/\/ -----------------------------------------------------------------------------\n    struct JobDesc\n    {\n        explicit JobDesc(task::XJob * pJob, const uno::Sequence< beans::NamedValue >& aArguments);\n\n        OUString aLayerDataUrl;\n        OUString aImporterService;\n\n        OUString aComponent;\n        OUString aEntity;\n\n        uno::Reference< backend::XLayer > xLayerFilter;\n\n        sal_Bool overwrite;\n        sal_Bool truncate;\n\n        sal_Bool use_component;\n        sal_Bool use_entity;\n        sal_Bool use_overwrite;\n        sal_Bool use_truncate;\n    };\n    \/\/ -----------------------------------------------------------------------------\n\n    JobDesc::JobDesc(task::XJob * pJob, const uno::Sequence< beans::NamedValue >& aArguments)\n    : aLayerDataUrl()\n    , aImporterService()\n    , aComponent()\n    , aEntity()\n    , xLayerFilter()\n    , overwrite(true)\n    , truncate(false)\n    , use_component(false)\n    , use_entity(false)\n    , use_overwrite(false)\n    , use_truncate(false)\n    {\n        sal_Int16 const nCount = static_cast<sal_Int16>(aArguments.getLength());\n\n        if (sal_Int32(nCount) != aArguments.getLength())\n        {\n            OUString sMessage = OUSTRING(\"Too many arguments for LocalDataImporter Job\");\n            throw lang::IllegalArgumentException(sMessage,pJob,0);\n        }\n\n        for (sal_Int16 i=0; i < nCount; ++i)\n        {\n            sal_Bool bKnown = false;\n            sal_Bool bGood  = false;\n\n            if (aArguments[i].Name.equalsAsciiL(RTL_CONSTASCII_STRINGPARAM(\"LayerDataUrl\")))\n            {\n                bKnown = true;\n                bGood  = (aArguments[i].Value >>= aLayerDataUrl);\n            }\n            else if (aArguments[i].Name.equalsAsciiL(RTL_CONSTASCII_STRINGPARAM(\"ImporterService\")))\n            {\n                bKnown = true;\n                bGood  = (aArguments[i].Value >>= aImporterService);\n            }\n            else if (aArguments[i].Name.equalsAsciiL(RTL_CONSTASCII_STRINGPARAM(\"Component\")))\n            {\n                bKnown = true;\n                bGood  = (aArguments[i].Value >>= aComponent);\n                use_component = bGood && (aComponent.getLength() != 0);\n            }\n            else if (aArguments[i].Name.equalsAsciiL(RTL_CONSTASCII_STRINGPARAM(\"Entity\")))\n            {\n                bKnown = true;\n                bGood  = (aArguments[i].Value >>= aEntity);\n                use_entity = bGood && (aEntity.getLength() != 0);\n            }\n            else if (aArguments[i].Name.equalsAsciiL(RTL_CONSTASCII_STRINGPARAM(\"LayerFilter\")))\n            {\n                bKnown = true;\n                bGood  = (aArguments[i].Value >>= xLayerFilter);\n                if (xLayerFilter.is() && !uno::Reference<lang::XInitialization>::query(xLayerFilter).is())\n                    bGood = false;\n            }\n            else if (aArguments[i].Name.equalsAsciiL(RTL_CONSTASCII_STRINGPARAM(\"OverwriteExisting\")))\n            {\n                bKnown = true;\n                bGood  = (aArguments[i].Value >>= overwrite);\n                use_overwrite = bGood;\n            }\n            else if (aArguments[i].Name.equalsAsciiL(RTL_CONSTASCII_STRINGPARAM(\"TruncateExisting\")))\n            {\n                bKnown = true;\n                bGood  = (aArguments[i].Value >>= truncate);\n                use_truncate = bGood;\n            }\n\n            if (!bGood)\n            {\n                rtl::OUStringBuffer sMsg;\n                sMsg.appendAscii(\"LocalDataImportService - Illegal argument: \");\n                if (bKnown)\n                    sMsg.appendAscii(\"Wrong value type for argument '\");\n                else\n                    sMsg.appendAscii(\"Unknown argument '\");\n\n                sMsg.append(aArguments[i].Name).appendAscii(\"'.\");\n\n                throw lang::IllegalArgumentException(sMsg.makeStringAndClear(),pJob,i+1);\n            }\n        }\n        if (aLayerDataUrl.getLength() == 0)\n        {\n            rtl::OUStringBuffer sMsg;\n            sMsg.appendAscii(\"LocalDataImportService - Missing argument: \");\n            sMsg.appendAscii(\"No data URL available\");\n            throw lang::IllegalArgumentException(sMsg.makeStringAndClear(),pJob,0);\n        }\n        if (aImporterService.getLength() == 0)\n        {\n            if (use_truncate && truncate || use_overwrite && !overwrite)\n                aImporterService = OUSTRING(\"com.sun.star.configuration.backend.CopyImporter\");\n            else\n                aImporterService = OUSTRING(\"com.sun.star.configuration.backend.MergeImporter\");\n        }\n    }\n    \/\/ -----------------------------------------------------------------------------\n\n    static\n    inline\n    uno::Type getOverwriteFailedExceptionType()\n    {\n        lang::IllegalAccessException const * const selected = 0;\n        return ::getCppuType(selected);\n    }\n\/\/ -----------------------------------------------------------------------------\n}\n\/\/ -----------------------------------------------------------------------------\n\/\/ XJob\n\nuno::Any SAL_CALL\n    LocalDataImportService::execute( const uno::Sequence< beans::NamedValue >& Arguments )\n        throw (lang::IllegalArgumentException, uno::Exception, uno::RuntimeException)\n{\n    JobDesc const aJob(this,Arguments);\n\n    ServiceFactory aFactory = this->getServiceFactory();\n\n    uno::Reference< backend::XLayer > xLayer = aJob.use_component ?\n        LocalSingleBackend::createSimpleLayer(aFactory,aJob.aLayerDataUrl, aJob.aComponent ):\n        LocalSingleBackend::createSimpleLayer(aFactory,aJob.aLayerDataUrl) ;\n\n    if (!xLayer.is())\n    {\n        OUString sMessage = OUSTRING(\"LocalDataImportService - Cannot create layer to import from\");\n        throw lang::NullPointerException(sMessage,*this);\n    }\n\n    uno::Reference< lang::XInitialization > xFilterInit(aJob.xLayerFilter,uno::UNO_QUERY);\n    if (xFilterInit.is())\n    {\n        beans::NamedValue argvalue(\n            OUString( RTL_CONSTASCII_USTRINGPARAM(\"Source\") ),\n            uno::makeAny( xLayer) );\n\n        uno::Sequence< uno::Any > args(1);\n        args[0] <<= argvalue;\n\n        xFilterInit->initialize(args);\n\n        xLayer = aJob.xLayerFilter;\n    }\n\n    uno::Reference< backend::XLayerImporter > xImporter;\n\n    int nArgCount = 0;\n    if (aJob.use_overwrite) ++nArgCount;\n    if (aJob.use_truncate)  ++nArgCount;\n\n    if (nArgCount)\n    {\n        uno::Sequence< uno::Any > aArgs(nArgCount);\n\n        int n = 0;\n        if (aJob.use_overwrite)\n            aArgs[n++] <<= beans::NamedValue(OUSTRING(\"Overwrite\"), uno::makeAny(aJob.overwrite));\n\n        if (aJob.use_truncate)\n            aArgs[n++] <<= beans::NamedValue(OUSTRING(\"Truncate\"),  uno::makeAny(aJob.truncate));\n\n        OSL_ASSERT(n == nArgCount);\n\n        xImporter.set( aFactory->createInstanceWithArguments(aJob.aImporterService,aArgs), uno::UNO_QUERY);\n    }\n    else\n        xImporter.set( aFactory->createInstance(aJob.aImporterService), uno::UNO_QUERY);\n\n    if (!xImporter.is())\n    {\n        OUString sMessage = OUSTRING(\"LocalDataImportService - Cannot create importer service: \") + aJob.aImporterService;\n        throw lang::NullPointerException(sMessage,*this);\n    }\n\n    try\n    {\n        if (aJob.use_entity)\n            xImporter->importLayerForEntity(xLayer,aJob.aEntity);\n\n        else\n            xImporter->importLayer(xLayer);\n    }\n    catch (lang::WrappedTargetException & e)\n    {\n        if (aJob.overwrite || !e.TargetException.isExtractableTo(getOverwriteFailedExceptionType())) throw;\n        return e.TargetException;\n    }\n    catch (lang::WrappedTargetRuntimeException & e)\n    {\n        if (aJob.overwrite || !e.TargetException.isExtractableTo(getOverwriteFailedExceptionType())) throw;\n        return e.TargetException;\n    }\n\n    return uno::Any();\n}\n\/\/ -----------------------------------------------------------------------------\n\n\/\/ XServiceInfo\n\nOUString SAL_CALL\n    LocalDataImportService::getImplementationName(  )\n        throw (uno::RuntimeException)\n{\n    return getServiceInfo().getImplementationName( );\n}\n\/\/ -----------------------------------------------------------------------------\n\n\nsal_Bool SAL_CALL\n    LocalDataImportService::supportsService( const OUString& ServiceName )\n        throw (uno::RuntimeException)\n{\n    return getServiceInfo().supportsService( ServiceName );\n}\n\/\/ -----------------------------------------------------------------------------\n\n\nuno::Sequence< ::rtl::OUString > SAL_CALL\n    LocalDataImportService::getSupportedServiceNames(  )\n        throw (uno::RuntimeException)\n{\n    return getServiceInfo().getSupportedServiceNames( );\n}\n\/\/ -----------------------------------------------------------------------------\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ -----------------------------------------------------------------------------\n    } \/\/ namespace\n\n\/\/ -----------------------------------------------------------------------------\n} \/\/ namespace\n\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"core_configuration.hpp\"\n#include \"file_monitor.hpp\"\n#include \"logger.hpp\"\n\nnamespace krbn {\nclass configuration_monitor final {\npublic:\n  \/\/ Signals\n\n  boost::signals2::signal<void(std::shared_ptr<core_configuration> core_configuration)>\n      core_configuration_updated;\n\n  \/\/ Methods\n\n  configuration_monitor(const std::string& user_core_configuration_file_path,\n                        const std::string& system_core_configuration_file_path = constants::get_system_core_configuration_file_path()) : user_core_configuration_file_path_(user_core_configuration_file_path),\n                                                                                                                                         system_core_configuration_file_path_(system_core_configuration_file_path) {\n    std::vector<std::string> targets = {\n        user_core_configuration_file_path_,\n        system_core_configuration_file_path_,\n    };\n\n    file_monitor_ = std::make_unique<file_monitor>(targets);\n\n    file_monitor_->file_changed.connect([this](auto&& file_path) {\n      core_configuration_file_changed();\n    });\n  }\n\n  ~configuration_monitor(void) {\n    file_monitor_ = nullptr;\n  }\n\n  void start() {\n    std::lock_guard<std::mutex> lock(file_monitor_mutex_);\n\n    file_monitor_->start();\n\n    \/\/ `core_configuration_file_changed` is enqueued by `file_monitor::start` only if the file exists.\n    \/\/ We have to enqueue it manually for when the file does not exist.\n\n    file_monitor_->get_run_loop_thread()->enqueue(^{\n      {\n        std::lock_guard<std::mutex> lock(core_configuration_mutex_);\n\n        if (core_configuration_) {\n          \/\/ `core_configuration_file_changed` is already called.\n          \/\/ We do not need call the method again.\n          return;\n        }\n      }\n\n      core_configuration_file_changed();\n    });\n  }\n\n  std::shared_ptr<core_configuration> get_core_configuration(void) const {\n    std::lock_guard<std::mutex> lock(core_configuration_mutex_);\n\n    return core_configuration_;\n  }\n\n  std::shared_ptr<cf_utility::run_loop_thread> get_run_loop_thread(void) const {\n    std::lock_guard<std::mutex> lock(file_monitor_mutex_);\n\n    return file_monitor_->get_run_loop_thread();\n  }\n\nprivate:\n  void core_configuration_file_changed(void) {\n    std::string file_path = system_core_configuration_file_path_;\n    if (filesystem::exists(user_core_configuration_file_path_)) {\n      file_path = user_core_configuration_file_path_;\n    }\n\n    logger::get_logger().info(\"Load {0}...\", file_path);\n\n    auto c = std::make_shared<core_configuration>(file_path);\n\n    {\n      std::lock_guard<std::mutex> lock(core_configuration_mutex_);\n\n      if (core_configuration_ && !c->is_loaded()) {\n        return;\n      }\n\n      if (core_configuration_ && core_configuration_->to_json() == c->to_json()) {\n        return;\n      }\n\n      logger::get_logger().info(\"core_configuration is updated.\");\n      core_configuration_ = c;\n    }\n\n    core_configuration_updated(c);\n  }\n\n  std::string user_core_configuration_file_path_;\n  std::string system_core_configuration_file_path_;\n\n  std::unique_ptr<file_monitor> file_monitor_;\n  mutable std::mutex file_monitor_mutex_;\n\n  std::shared_ptr<core_configuration> core_configuration_;\n  mutable std::mutex core_configuration_mutex_;\n};\n} \/\/ namespace krbn\n<commit_msg>check file_monitor::start return value<commit_after>#pragma once\n\n#include \"core_configuration.hpp\"\n#include \"file_monitor.hpp\"\n#include \"logger.hpp\"\n\nnamespace krbn {\nclass configuration_monitor final {\npublic:\n  \/\/ Signals\n\n  boost::signals2::signal<void(std::shared_ptr<core_configuration> core_configuration)>\n      core_configuration_updated;\n\n  \/\/ Methods\n\n  configuration_monitor(const std::string& user_core_configuration_file_path,\n                        const std::string& system_core_configuration_file_path = constants::get_system_core_configuration_file_path()) : user_core_configuration_file_path_(user_core_configuration_file_path),\n                                                                                                                                         system_core_configuration_file_path_(system_core_configuration_file_path) {\n    std::vector<std::string> targets = {\n        user_core_configuration_file_path_,\n        system_core_configuration_file_path_,\n    };\n\n    file_monitor_ = std::make_unique<file_monitor>(targets);\n\n    file_monitor_->file_changed.connect([this](auto&& file_path) {\n      core_configuration_file_changed();\n    });\n  }\n\n  ~configuration_monitor(void) {\n    file_monitor_ = nullptr;\n  }\n\n  void start() {\n    std::lock_guard<std::mutex> lock(file_monitor_mutex_);\n\n    if (file_monitor_->start()) {\n      \/\/ `core_configuration_file_changed` is enqueued by `file_monitor::start` only if the file exists.\n      \/\/ We have to enqueue it manually for when the file does not exist.\n\n      file_monitor_->get_run_loop_thread()->enqueue(^{\n        {\n          std::lock_guard<std::mutex> lock(core_configuration_mutex_);\n\n          if (core_configuration_) {\n            \/\/ `core_configuration_file_changed` is already called.\n            \/\/ We do not need call the method again.\n            return;\n          }\n        }\n\n        core_configuration_file_changed();\n      });\n    }\n  }\n\n  std::shared_ptr<core_configuration> get_core_configuration(void) const {\n    std::lock_guard<std::mutex> lock(core_configuration_mutex_);\n\n    return core_configuration_;\n  }\n\n  std::shared_ptr<cf_utility::run_loop_thread> get_run_loop_thread(void) const {\n    std::lock_guard<std::mutex> lock(file_monitor_mutex_);\n\n    return file_monitor_->get_run_loop_thread();\n  }\n\nprivate:\n  void core_configuration_file_changed(void) {\n    std::string file_path = system_core_configuration_file_path_;\n    if (filesystem::exists(user_core_configuration_file_path_)) {\n      file_path = user_core_configuration_file_path_;\n    }\n\n    logger::get_logger().info(\"Load {0}...\", file_path);\n\n    auto c = std::make_shared<core_configuration>(file_path);\n\n    {\n      std::lock_guard<std::mutex> lock(core_configuration_mutex_);\n\n      if (core_configuration_ && !c->is_loaded()) {\n        return;\n      }\n\n      if (core_configuration_ && core_configuration_->to_json() == c->to_json()) {\n        return;\n      }\n\n      logger::get_logger().info(\"core_configuration is updated.\");\n      core_configuration_ = c;\n    }\n\n    core_configuration_updated(c);\n  }\n\n  std::string user_core_configuration_file_path_;\n  std::string system_core_configuration_file_path_;\n\n  std::unique_ptr<file_monitor> file_monitor_;\n  mutable std::mutex file_monitor_mutex_;\n\n  std::shared_ptr<core_configuration> core_configuration_;\n  mutable std::mutex core_configuration_mutex_;\n};\n} \/\/ namespace krbn\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: EResultSet.cxx,v $\n *\n *  $Revision: 1.17 $\n *\n *  last change: $Author: obo $ $Date: 2003-09-04 08:26: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 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 _COM_SUN_STAR_SDBCX_COMPAREBOOKMARK_HPP_\n#include <com\/sun\/star\/sdbcx\/CompareBookmark.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBCX_XDELETEROWS_HPP_\n#include <com\/sun\/star\/sdbcx\/XDeleteRows.hpp>\n#endif\n#ifndef _CONNECTIVITY_FLAT_ERESULTSET_HXX_\n#include \"flat\/EResultSet.hxx\"\n#endif\n#ifndef _COM_SUN_STAR_LANG_DISPOSEDEXCEPTION_HPP_\n#include <com\/sun\/star\/lang\/DisposedException.hpp>\n#endif\n#ifndef _COMPHELPER_SEQUENCE_HXX_\n#include <comphelper\/sequence.hxx>\n#endif\n#ifndef _COMPHELPER_TYPES_HXX_\n#include <comphelper\/types.hxx>\n#endif\n\nusing namespace ::comphelper;\n\nusing namespace connectivity::flat;\nusing namespace connectivity::file;\nusing namespace ::cppu;\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::lang;\nusing namespace com::sun::star::beans;\nusing namespace com::sun::star::sdbc;\nusing namespace com::sun::star::sdbcx;\n\/\/  using namespace com::sun::star::container;\n\/\/  using namespace com::sun::star::util;\n\/\/------------------------------------------------------------------------------\nOFlatResultSet::OFlatResultSet( OStatement_Base* pStmt,connectivity::OSQLParseTreeIterator& _aSQLIterator)\n                : file::OResultSet(pStmt,_aSQLIterator)\n                ,m_bBookmarkable(sal_True)\n{\n    registerProperty(OMetaConnection::getPropMap().getNameByIndex(PROPERTY_ID_ISBOOKMARKABLE),         PROPERTY_ID_ISBOOKMARKABLE,       PropertyAttribute::READONLY,&m_bBookmarkable,                ::getBooleanCppuType());\n}\n\/\/ -------------------------------------------------------------------------\n::rtl::OUString SAL_CALL OFlatResultSet::getImplementationName(  ) throw ( RuntimeException)\n{\n    return ::rtl::OUString::createFromAscii(\"com.sun.star.sdbcx.flat.ResultSet\");\n}\n\/\/ -------------------------------------------------------------------------\nSequence< ::rtl::OUString > SAL_CALL OFlatResultSet::getSupportedServiceNames(  ) throw( RuntimeException)\n{\n     Sequence< ::rtl::OUString > aSupported(2);\n    aSupported[0] = ::rtl::OUString::createFromAscii(\"com.sun.star.sdbc.ResultSet\");\n    aSupported[1] = ::rtl::OUString::createFromAscii(\"com.sun.star.sdbcx.ResultSet\");\n    return aSupported;\n}\n\/\/ -------------------------------------------------------------------------\nsal_Bool SAL_CALL OFlatResultSet::supportsService( const ::rtl::OUString& _rServiceName ) throw( RuntimeException)\n{\n    Sequence< ::rtl::OUString > aSupported(getSupportedServiceNames());\n    const ::rtl::OUString* pSupported = aSupported.getConstArray();\n    const ::rtl::OUString* pEnd = pSupported + aSupported.getLength();\n    for (;pSupported != pEnd && !pSupported->equals(_rServiceName); ++pSupported)\n        ;\n\n    return pSupported != pEnd;\n}\n\/\/ -------------------------------------------------------------------------\nAny SAL_CALL OFlatResultSet::queryInterface( const Type & rType ) throw(RuntimeException)\n{\n    if(rType == ::getCppuType((const Reference<XDeleteRows>*)0) || rType == ::getCppuType((const Reference<XResultSetUpdate>*)0)\n        || rType == ::getCppuType((const Reference<XRowUpdate>*)0))\n        return Any();\n\n    Any aRet = OResultSet::queryInterface(rType);\n    return aRet.hasValue() ? aRet : OFlatResultSet_BASE::queryInterface(rType);\n}\n\/\/ -------------------------------------------------------------------------\nSequence<  Type > SAL_CALL OFlatResultSet::getTypes(  ) throw( RuntimeException)\n{\n    Sequence< Type > aTypes = OResultSet::getTypes();\n    ::std::vector<Type> aOwnTypes;\n    aOwnTypes.reserve(aTypes.getLength());\n    const Type* pBegin = aTypes.getConstArray();\n    const Type* pEnd = pBegin + aTypes.getLength();\n    for(;pBegin != pEnd;++pBegin)\n    {\n        if(!(*pBegin == ::getCppuType((const Reference<XDeleteRows>*)0) ||\n            *pBegin == ::getCppuType((const Reference<XResultSetUpdate>*)0) ||\n            *pBegin == ::getCppuType((const Reference<XRowUpdate>*)0)))\n        {\n            aOwnTypes.push_back(*pBegin);\n        }\n    }\n    Sequence< Type > aRet(aOwnTypes.begin(),aOwnTypes.size());\n    return ::comphelper::concatSequences(aRet,OFlatResultSet_BASE::getTypes());\n}\n\n\/\/ -------------------------------------------------------------------------\n\/\/ XRowLocate\nAny SAL_CALL OFlatResultSet::getBookmark(  ) throw( SQLException,  RuntimeException)\n{\n     ::osl::MutexGuard aGuard( m_aMutex );\n        checkDisposed(OResultSet_BASE::rBHelper.bDisposed);\n\n\n    return makeAny((sal_Int32)(*m_aRow)[0]->getValue());\n}\n\/\/ -------------------------------------------------------------------------\nsal_Bool SAL_CALL OFlatResultSet::moveToBookmark( const  Any& bookmark ) throw( SQLException,  RuntimeException)\n{\n    ::osl::MutexGuard aGuard( m_aMutex );\n        checkDisposed(OResultSet_BASE::rBHelper.bDisposed);\n\n\n    m_bRowDeleted = m_bRowInserted = m_bRowUpdated = sal_False;\n\n    return Move(IResultSetHelper::BOOKMARK,comphelper::getINT32(bookmark),sal_True);\n}\n\/\/ -------------------------------------------------------------------------\nsal_Bool SAL_CALL OFlatResultSet::moveRelativeToBookmark( const  Any& bookmark, sal_Int32 rows ) throw( SQLException,  RuntimeException)\n{\n    ::osl::MutexGuard aGuard( m_aMutex );\n        checkDisposed(OResultSet_BASE::rBHelper.bDisposed);\n\n\n    m_bRowDeleted = m_bRowInserted = m_bRowUpdated = sal_False;\n\n    Move(IResultSetHelper::BOOKMARK,comphelper::getINT32(bookmark),sal_False);\n\n    return relative(rows);\n}\n\n\/\/ -------------------------------------------------------------------------\nsal_Int32 SAL_CALL OFlatResultSet::compareBookmarks( const  Any& first, const  Any& second ) throw( SQLException,  RuntimeException)\n{\n    return (first == second) ? 0 : 2;\n}\n\/\/ -------------------------------------------------------------------------\nsal_Bool SAL_CALL OFlatResultSet::hasOrderedBookmarks(  ) throw( SQLException,  RuntimeException)\n{\n    return sal_True;\n}\n\/\/ -------------------------------------------------------------------------\nsal_Int32 SAL_CALL OFlatResultSet::hashBookmark( const  Any& bookmark ) throw( SQLException,  RuntimeException)\n{\n    return comphelper::getINT32(bookmark);\n}\n\/\/ -------------------------------------------------------------------------\nIPropertyArrayHelper* OFlatResultSet::createArrayHelper( ) const\n{\n    Sequence< Property > aProps;\n    describeProperties(aProps);\n    return new ::cppu::OPropertyArrayHelper(aProps);\n}\n\/\/ -------------------------------------------------------------------------\nIPropertyArrayHelper & OFlatResultSet::getInfoHelper()\n{\n    return *OFlatResultSet_BASE3::getArrayHelper();\n}\n\/\/ -----------------------------------------------------------------------------\nvoid SAL_CALL OFlatResultSet::acquire() throw()\n{\n    OFlatResultSet_BASE2::acquire();\n}\n\/\/ -----------------------------------------------------------------------------\nvoid SAL_CALL OFlatResultSet::release() throw()\n{\n    OFlatResultSet_BASE2::release();\n}\n\/\/ -----------------------------------------------------------------------------\n::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySetInfo > SAL_CALL OFlatResultSet::getPropertySetInfo(  ) throw(::com::sun::star::uno::RuntimeException)\n{\n    return ::cppu::OPropertySetHelper::createPropertySetInfo(getInfoHelper());\n}\n\/\/ -----------------------------------------------------------------------------\n\n<commit_msg>INTEGRATION: CWS ooo20040704 (1.17.68); FILE MERGED 2004\/06\/28 13:54:18 cmc 1.17.68.1: #i30801# allow using system stl if possible<commit_after>\/*************************************************************************\n *\n *  $RCSfile: EResultSet.cxx,v $\n *\n *  $Revision: 1.18 $\n *\n *  last change: $Author: rt $ $Date: 2004-09-08 16:21:08 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER 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 _COM_SUN_STAR_SDBCX_COMPAREBOOKMARK_HPP_\n#include <com\/sun\/star\/sdbcx\/CompareBookmark.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBCX_XDELETEROWS_HPP_\n#include <com\/sun\/star\/sdbcx\/XDeleteRows.hpp>\n#endif\n#ifndef _CONNECTIVITY_FLAT_ERESULTSET_HXX_\n#include \"flat\/EResultSet.hxx\"\n#endif\n#ifndef _COM_SUN_STAR_LANG_DISPOSEDEXCEPTION_HPP_\n#include <com\/sun\/star\/lang\/DisposedException.hpp>\n#endif\n#ifndef _COMPHELPER_SEQUENCE_HXX_\n#include <comphelper\/sequence.hxx>\n#endif\n#ifndef _COMPHELPER_TYPES_HXX_\n#include <comphelper\/types.hxx>\n#endif\n\nusing namespace ::comphelper;\n\nusing namespace connectivity::flat;\nusing namespace connectivity::file;\nusing namespace ::cppu;\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::lang;\nusing namespace com::sun::star::beans;\nusing namespace com::sun::star::sdbc;\nusing namespace com::sun::star::sdbcx;\n\/\/  using namespace com::sun::star::container;\n\/\/  using namespace com::sun::star::util;\n\/\/------------------------------------------------------------------------------\nOFlatResultSet::OFlatResultSet( OStatement_Base* pStmt,connectivity::OSQLParseTreeIterator& _aSQLIterator)\n                : file::OResultSet(pStmt,_aSQLIterator)\n                ,m_bBookmarkable(sal_True)\n{\n    registerProperty(OMetaConnection::getPropMap().getNameByIndex(PROPERTY_ID_ISBOOKMARKABLE),         PROPERTY_ID_ISBOOKMARKABLE,       PropertyAttribute::READONLY,&m_bBookmarkable,                ::getBooleanCppuType());\n}\n\/\/ -------------------------------------------------------------------------\n::rtl::OUString SAL_CALL OFlatResultSet::getImplementationName(  ) throw ( RuntimeException)\n{\n    return ::rtl::OUString::createFromAscii(\"com.sun.star.sdbcx.flat.ResultSet\");\n}\n\/\/ -------------------------------------------------------------------------\nSequence< ::rtl::OUString > SAL_CALL OFlatResultSet::getSupportedServiceNames(  ) throw( RuntimeException)\n{\n     Sequence< ::rtl::OUString > aSupported(2);\n    aSupported[0] = ::rtl::OUString::createFromAscii(\"com.sun.star.sdbc.ResultSet\");\n    aSupported[1] = ::rtl::OUString::createFromAscii(\"com.sun.star.sdbcx.ResultSet\");\n    return aSupported;\n}\n\/\/ -------------------------------------------------------------------------\nsal_Bool SAL_CALL OFlatResultSet::supportsService( const ::rtl::OUString& _rServiceName ) throw( RuntimeException)\n{\n    Sequence< ::rtl::OUString > aSupported(getSupportedServiceNames());\n    const ::rtl::OUString* pSupported = aSupported.getConstArray();\n    const ::rtl::OUString* pEnd = pSupported + aSupported.getLength();\n    for (;pSupported != pEnd && !pSupported->equals(_rServiceName); ++pSupported)\n        ;\n\n    return pSupported != pEnd;\n}\n\/\/ -------------------------------------------------------------------------\nAny SAL_CALL OFlatResultSet::queryInterface( const Type & rType ) throw(RuntimeException)\n{\n    if(rType == ::getCppuType((const Reference<XDeleteRows>*)0) || rType == ::getCppuType((const Reference<XResultSetUpdate>*)0)\n        || rType == ::getCppuType((const Reference<XRowUpdate>*)0))\n        return Any();\n\n    Any aRet = OResultSet::queryInterface(rType);\n    return aRet.hasValue() ? aRet : OFlatResultSet_BASE::queryInterface(rType);\n}\n\/\/ -------------------------------------------------------------------------\nSequence<  Type > SAL_CALL OFlatResultSet::getTypes(  ) throw( RuntimeException)\n{\n    Sequence< Type > aTypes = OResultSet::getTypes();\n    ::std::vector<Type> aOwnTypes;\n    aOwnTypes.reserve(aTypes.getLength());\n    const Type* pBegin = aTypes.getConstArray();\n    const Type* pEnd = pBegin + aTypes.getLength();\n    for(;pBegin != pEnd;++pBegin)\n    {\n        if(!(*pBegin == ::getCppuType((const Reference<XDeleteRows>*)0) ||\n            *pBegin == ::getCppuType((const Reference<XResultSetUpdate>*)0) ||\n            *pBegin == ::getCppuType((const Reference<XRowUpdate>*)0)))\n        {\n            aOwnTypes.push_back(*pBegin);\n        }\n    }\n    Type* pTypes = aOwnTypes.empty() ? 0 : &aOwnTypes[0];\n    Sequence< Type > aRet(pTypes, aOwnTypes.size());\n    return ::comphelper::concatSequences(aRet,OFlatResultSet_BASE::getTypes());\n}\n\n\/\/ -------------------------------------------------------------------------\n\/\/ XRowLocate\nAny SAL_CALL OFlatResultSet::getBookmark(  ) throw( SQLException,  RuntimeException)\n{\n     ::osl::MutexGuard aGuard( m_aMutex );\n        checkDisposed(OResultSet_BASE::rBHelper.bDisposed);\n\n\n    return makeAny((sal_Int32)(*m_aRow)[0]->getValue());\n}\n\/\/ -------------------------------------------------------------------------\nsal_Bool SAL_CALL OFlatResultSet::moveToBookmark( const  Any& bookmark ) throw( SQLException,  RuntimeException)\n{\n    ::osl::MutexGuard aGuard( m_aMutex );\n        checkDisposed(OResultSet_BASE::rBHelper.bDisposed);\n\n\n    m_bRowDeleted = m_bRowInserted = m_bRowUpdated = sal_False;\n\n    return Move(IResultSetHelper::BOOKMARK,comphelper::getINT32(bookmark),sal_True);\n}\n\/\/ -------------------------------------------------------------------------\nsal_Bool SAL_CALL OFlatResultSet::moveRelativeToBookmark( const  Any& bookmark, sal_Int32 rows ) throw( SQLException,  RuntimeException)\n{\n    ::osl::MutexGuard aGuard( m_aMutex );\n        checkDisposed(OResultSet_BASE::rBHelper.bDisposed);\n\n\n    m_bRowDeleted = m_bRowInserted = m_bRowUpdated = sal_False;\n\n    Move(IResultSetHelper::BOOKMARK,comphelper::getINT32(bookmark),sal_False);\n\n    return relative(rows);\n}\n\n\/\/ -------------------------------------------------------------------------\nsal_Int32 SAL_CALL OFlatResultSet::compareBookmarks( const  Any& first, const  Any& second ) throw( SQLException,  RuntimeException)\n{\n    return (first == second) ? 0 : 2;\n}\n\/\/ -------------------------------------------------------------------------\nsal_Bool SAL_CALL OFlatResultSet::hasOrderedBookmarks(  ) throw( SQLException,  RuntimeException)\n{\n    return sal_True;\n}\n\/\/ -------------------------------------------------------------------------\nsal_Int32 SAL_CALL OFlatResultSet::hashBookmark( const  Any& bookmark ) throw( SQLException,  RuntimeException)\n{\n    return comphelper::getINT32(bookmark);\n}\n\/\/ -------------------------------------------------------------------------\nIPropertyArrayHelper* OFlatResultSet::createArrayHelper( ) const\n{\n    Sequence< Property > aProps;\n    describeProperties(aProps);\n    return new ::cppu::OPropertyArrayHelper(aProps);\n}\n\/\/ -------------------------------------------------------------------------\nIPropertyArrayHelper & OFlatResultSet::getInfoHelper()\n{\n    return *OFlatResultSet_BASE3::getArrayHelper();\n}\n\/\/ -----------------------------------------------------------------------------\nvoid SAL_CALL OFlatResultSet::acquire() throw()\n{\n    OFlatResultSet_BASE2::acquire();\n}\n\/\/ -----------------------------------------------------------------------------\nvoid SAL_CALL OFlatResultSet::release() throw()\n{\n    OFlatResultSet_BASE2::release();\n}\n\/\/ -----------------------------------------------------------------------------\n::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySetInfo > SAL_CALL OFlatResultSet::getPropertySetInfo(  ) throw(::com::sun::star::uno::RuntimeException)\n{\n    return ::cppu::OPropertySetHelper::createPropertySetInfo(getInfoHelper());\n}\n\/\/ -----------------------------------------------------------------------------\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2000, 2012, Oracle and\/or its affiliates. All rights reserved.\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * This code is free software; you can redistribute it and\/or modify it\n * under the terms of the GNU General Public License version 2 only, as\n * published by the Free Software Foundation.\n *\n * This code 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\n * version 2 for more details (a copy is included in the LICENSE file that\n * accompanied this code).\n *\n * You should have received a copy of the GNU General Public License version\n * 2 along with this work; if not, write to the Free Software Foundation,\n * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.\n *\n * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA\n * or visit www.oracle.com if you need additional information or have any\n * questions.\n *\n *\/\n\n#ifndef SHARE_VM_GRAAL_GRAALGLOBALS_HPP\n#define SHARE_VM_GRAAL_GRAALGLOBALS_HPP\n\n#include \"runtime\/globals.hpp\"\n#ifdef TARGET_ARCH_x86\n# include \"graalGlobals_x86.hpp\"\n#endif\n#ifdef TARGET_ARCH_sparc\n# include \"graalGlobals_sparc.hpp\"\n#endif\n#ifdef TARGET_ARCH_arm\n# include \"graalGlobals_arm.hpp\"\n#endif\n#ifdef TARGET_ARCH_ppc\n# include \"graalGlobals_ppc.hpp\"\n#endif\n\n\/\/\n\/\/ Defines all global flags used by the Graal compiler. Only flags that need\n\/\/ to be accessible to the Graal C++ code should be defined here. All other\n\/\/ Graal flags should be defined in GraalOptions.java.\n\/\/\n#define GRAAL_FLAGS(develop, develop_pd, product, product_pd, notproduct)   \\\n                                                                            \\\n  product(bool, DebugGraal, true,                                           \\\n          \"Enable JVMTI for the compiler thread\")                           \\\n                                                                            \\\n  COMPILERGRAAL_PRESENT(product(bool, BootstrapGraal, true,                 \\\n          \"Bootstrap Graal before running Java main method\"))               \\\n                                                                            \\\n  COMPILERGRAAL_PRESENT(product(bool, UseGraalCompilationQueue, false,      \\\n          \"Use non-native compilation queue for Graal\"))                    \\\n                                                                            \\\n  product(bool, ForceGraalInitialization, false,                            \\\n          \"Force VM to initialize the compiler even if not used\")           \\\n                                                                            \\\n  product(intx, TraceGraal, 0,                                              \\\n          \"Trace level for Graal\")                                          \\\n                                                                            \\\n  product(intx, GraalCounterSize, 0,                                        \\\n          \"Reserved size for benchmark counters\")                           \\\n                                                                            \\\n  product(bool, GraalCountersExcludeCompiler, true,                         \\\n          \"Exclude Graal compiler threads from benchmark counters\")         \\\n                                                                            \\\n  product(bool, GraalDeferredInitBarriers, true,                            \\\n          \"Defer write barriers of young objects\")                          \\\n                                                                            \\\n  product(bool, GraalHProfEnabled, false,                                   \\\n          \"Is Heap  Profiler enabled\")                                      \\\n                                                                            \\\n  develop(bool, GraalUseFastLocking, true,                                  \\\n          \"Use fast inlined locking code\")                                  \\\n                                                                            \\\n  develop(bool, GraalUseFastNewTypeArray, true,                             \\\n          \"Use fast inlined type array allocation\")                         \\\n                                                                            \\\n  develop(bool, GraalUseFastNewObjectArray, true,                           \\\n          \"Use fast inlined object array allocation\")                       \\\n                                                                            \\\n  product(intx, GraalNMethodSizeLimit, (80*K)*wordSize,                     \\\n          \"Maximum size of a compiled method.\")                             \\\n                                                                            \\\n  notproduct(bool, GraalPrintSimpleStubs, false,                            \\\n          \"Print simple Graal stubs\")                                       \\\n                                                                            \\\n  develop(bool, TraceUncollectedSpeculations, false,                        \\\n          \"Print message when a failed speculation was not collected\")      \\\n                                                                            \\\n  product(bool, UseHSAILDeoptimization, true,                               \\\n          \"Code gen and runtime support for deoptimizing HSAIL kernels\")    \\\n                                                                            \\\n  product(bool, UseHSAILSafepoints, true,                                   \\\n          \"Code gen and runtime support for safepoints in HSAIL kernels\")   \\\n                                                                            \\\n  product(bool, GPUOffload, false,                                          \\\n          \"Offload execution to GPU whenever possible\")                     \\\n                                                                            \\\n  product(bool, TraceGPUInteraction, false,                                 \\\n          \"Trace external GPU Interaction\")                                 \\\n                                                                            \\\n\n\n\/\/ Read default values for Graal globals\n\nGRAAL_FLAGS(DECLARE_DEVELOPER_FLAG, DECLARE_PD_DEVELOPER_FLAG, DECLARE_PRODUCT_FLAG, DECLARE_PD_PRODUCT_FLAG, DECLARE_NOTPRODUCT_FLAG)\n\n#endif \/\/ SHARE_VM_GRAAL_GRAALGLOBALS_HPP\n<commit_msg>Backed out changeset: a1b9340534bf<commit_after>\/*\n * Copyright (c) 2000, 2012, Oracle and\/or its affiliates. All rights reserved.\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * This code is free software; you can redistribute it and\/or modify it\n * under the terms of the GNU General Public License version 2 only, as\n * published by the Free Software Foundation.\n *\n * This code 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\n * version 2 for more details (a copy is included in the LICENSE file that\n * accompanied this code).\n *\n * You should have received a copy of the GNU General Public License version\n * 2 along with this work; if not, write to the Free Software Foundation,\n * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.\n *\n * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA\n * or visit www.oracle.com if you need additional information or have any\n * questions.\n *\n *\/\n\n#ifndef SHARE_VM_GRAAL_GRAALGLOBALS_HPP\n#define SHARE_VM_GRAAL_GRAALGLOBALS_HPP\n\n#include \"runtime\/globals.hpp\"\n#ifdef TARGET_ARCH_x86\n# include \"graalGlobals_x86.hpp\"\n#endif\n#ifdef TARGET_ARCH_sparc\n# include \"graalGlobals_sparc.hpp\"\n#endif\n#ifdef TARGET_ARCH_arm\n# include \"graalGlobals_arm.hpp\"\n#endif\n#ifdef TARGET_ARCH_ppc\n# include \"graalGlobals_ppc.hpp\"\n#endif\n\n\/\/\n\/\/ Defines all global flags used by the Graal compiler. Only flags that need\n\/\/ to be accessible to the Graal C++ code should be defined here. All other\n\/\/ Graal flags should be defined in GraalOptions.java.\n\/\/\n#define GRAAL_FLAGS(develop, develop_pd, product, product_pd, notproduct)   \\\n                                                                            \\\n  product(bool, DebugGraal, true,                                           \\\n          \"Enable JVMTI for the compiler thread\")                           \\\n                                                                            \\\n  COMPILERGRAAL_PRESENT(product(bool, BootstrapGraal, true,                 \\\n          \"Bootstrap Graal before running Java main method\"))               \\\n                                                                            \\\n  COMPILERGRAAL_PRESENT(product(bool, UseGraalCompilationQueue, true,       \\\n          \"Use non-native compilation queue for Graal\"))                    \\\n                                                                            \\\n  product(bool, ForceGraalInitialization, false,                            \\\n          \"Force VM to initialize the compiler even if not used\")           \\\n                                                                            \\\n  product(intx, TraceGraal, 0,                                              \\\n          \"Trace level for Graal\")                                          \\\n                                                                            \\\n  product(intx, GraalCounterSize, 0,                                        \\\n          \"Reserved size for benchmark counters\")                           \\\n                                                                            \\\n  product(bool, GraalCountersExcludeCompiler, true,                         \\\n          \"Exclude Graal compiler threads from benchmark counters\")         \\\n                                                                            \\\n  product(bool, GraalDeferredInitBarriers, true,                            \\\n          \"Defer write barriers of young objects\")                          \\\n                                                                            \\\n  product(bool, GraalHProfEnabled, false,                                   \\\n          \"Is Heap  Profiler enabled\")                                      \\\n                                                                            \\\n  develop(bool, GraalUseFastLocking, true,                                  \\\n          \"Use fast inlined locking code\")                                  \\\n                                                                            \\\n  develop(bool, GraalUseFastNewTypeArray, true,                             \\\n          \"Use fast inlined type array allocation\")                         \\\n                                                                            \\\n  develop(bool, GraalUseFastNewObjectArray, true,                           \\\n          \"Use fast inlined object array allocation\")                       \\\n                                                                            \\\n  product(intx, GraalNMethodSizeLimit, (80*K)*wordSize,                     \\\n          \"Maximum size of a compiled method.\")                             \\\n                                                                            \\\n  notproduct(bool, GraalPrintSimpleStubs, false,                            \\\n          \"Print simple Graal stubs\")                                       \\\n                                                                            \\\n  develop(bool, TraceUncollectedSpeculations, false,                        \\\n          \"Print message when a failed speculation was not collected\")      \\\n                                                                            \\\n  product(bool, UseHSAILDeoptimization, true,                               \\\n          \"Code gen and runtime support for deoptimizing HSAIL kernels\")    \\\n                                                                            \\\n  product(bool, UseHSAILSafepoints, true,                                   \\\n          \"Code gen and runtime support for safepoints in HSAIL kernels\")   \\\n                                                                            \\\n  product(bool, GPUOffload, false,                                          \\\n          \"Offload execution to GPU whenever possible\")                     \\\n                                                                            \\\n  product(bool, TraceGPUInteraction, false,                                 \\\n          \"Trace external GPU Interaction\")                                 \\\n                                                                            \\\n\n\n\/\/ Read default values for Graal globals\n\nGRAAL_FLAGS(DECLARE_DEVELOPER_FLAG, DECLARE_PD_DEVELOPER_FLAG, DECLARE_PRODUCT_FLAG, DECLARE_PD_PRODUCT_FLAG, DECLARE_NOTPRODUCT_FLAG)\n\n#endif \/\/ SHARE_VM_GRAAL_GRAALGLOBALS_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/net\/websocket_experiment\/websocket_experiment_runner.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/compiler_specific.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/metrics\/field_trial.h\"\n#include \"base\/task.h\"\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/browser_thread.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"net\/base\/host_resolver.h\"\n#include \"net\/base\/net_errors.h\"\n#include \"net\/websockets\/websocket.h\"\n\nnamespace chrome_browser_net_websocket_experiment {\n\nstatic const char *kExperimentHost = \"websocket-experiment.chromium.org\";\nstatic const int kAlternativePort = 61985;\n\n\/\/ Hold reference while experiment is running.\nstatic scoped_refptr<WebSocketExperimentRunner> runner;\n\n\/* static *\/\nvoid WebSocketExperimentRunner::Start() {\n  DCHECK(!runner.get());\n\n  scoped_refptr<base::FieldTrial> trial =\n      new base::FieldTrial(\"WebSocketExperiment\", 1000);\n  trial->AppendGroup(\"active\", 5);  \/\/ 0.5% in active group.\n\n  bool run_experiment =\n      (trial->group() != base::FieldTrial::kNotParticipating);\n#ifndef NDEBUG\n  const CommandLine& command_line = *CommandLine::ForCurrentProcess();\n  std::string experiment_host = command_line.GetSwitchValueASCII(\n      switches::kWebSocketLiveExperimentHost);\n  if (!experiment_host.empty())\n    run_experiment = true;\n#endif\n  if (!run_experiment)\n    return;\n\n  runner = new WebSocketExperimentRunner;\n  runner->Run();\n}\n\n\/* static *\/\nvoid WebSocketExperimentRunner::Stop() {\n  if (runner.get())\n    runner->Cancel();\n  runner = NULL;\n}\n\nWebSocketExperimentRunner::WebSocketExperimentRunner()\n    : next_state_(STATE_NONE),\n      task_state_(STATE_NONE),\n      ALLOW_THIS_IN_INITIALIZER_LIST(\n          task_callback_(this, &WebSocketExperimentRunner::OnTaskCompleted)) {\n  WebSocketExperimentTask::InitHistogram();\n  InitConfig();\n}\n\nWebSocketExperimentRunner::~WebSocketExperimentRunner() {\n  DCHECK(!task_.get());\n  WebSocketExperimentTask::ReleaseHistogram();\n}\n\nvoid WebSocketExperimentRunner::Run() {\n  DCHECK_EQ(next_state_, STATE_NONE);\n  next_state_ = STATE_RUN_WS;\n  BrowserThread::PostDelayedTask(\n      BrowserThread::IO,\n      FROM_HERE,\n      NewRunnableMethod(this, &WebSocketExperimentRunner::DoLoop),\n      config_.initial_delay_ms);\n}\n\nvoid WebSocketExperimentRunner::Cancel() {\n  next_state_ = STATE_NONE;\n  BrowserThread::PostTask(\n      BrowserThread::IO,\n      FROM_HERE,\n      NewRunnableMethod(this, &WebSocketExperimentRunner::DoLoop));\n}\n\nvoid WebSocketExperimentRunner::InitConfig() {\n  config_.initial_delay_ms = 5 * 60 * 1000;  \/\/ 5 mins\n  config_.next_delay_ms = 12 * 60 * 60 * 1000;  \/\/ 12 hours\n\n  std::string experiment_host = kExperimentHost;\n#ifndef NDEBUG\n  const CommandLine& command_line = *CommandLine::ForCurrentProcess();\n  std::string experiment_host_override = command_line.GetSwitchValueASCII(\n      switches::kWebSocketLiveExperimentHost);\n  if (!experiment_host_override.empty()) {\n    experiment_host = experiment_host_override;\n    config_.initial_delay_ms = 5 * 1000;  \/\/ 5 secs.\n  }\n#endif\n\n  WebSocketExperimentTask::Config* config;\n  WebSocketExperimentTask::Config task_config;\n\n  task_config.protocol_version = net::WebSocket::DEFAULT_VERSION;\n  config = &config_.ws_config[STATE_RUN_WS - STATE_RUN_WS];\n  *config = task_config;\n  config->url =\n      GURL(StringPrintf(\"ws:\/\/%s\/live_exp\", experiment_host.c_str()));\n  config->ws_location =\n      StringPrintf(\"ws:\/\/%s\/live_exp\", experiment_host.c_str());\n  config->http_url =\n      GURL(StringPrintf(\"http:\/\/%s\/\", experiment_host.c_str()));\n\n  config = &config_.ws_config[STATE_RUN_WSS - STATE_RUN_WS];\n  *config = task_config;\n  config->url =\n      GURL(StringPrintf(\"wss:\/\/%s\/live_exp\", experiment_host.c_str()));\n  config->ws_location =\n      StringPrintf(\"wss:\/\/%s\/live_exp\", experiment_host.c_str());\n  config->http_url =\n      GURL(StringPrintf(\"https:\/\/%s\/\", experiment_host.c_str()));\n\n  config = &config_.ws_config[STATE_RUN_WS_NODEFAULT_PORT -\n                              STATE_RUN_WS];\n  *config = task_config;\n  config->url =\n      GURL(StringPrintf(\"ws:\/\/%s:%d\/live_exp\",\n                        experiment_host.c_str(), kAlternativePort));\n  config->ws_location =\n      StringPrintf(\"ws:\/\/%s:%d\/live_exp\",\n                   experiment_host.c_str(), kAlternativePort);\n  config->http_url =\n      GURL(StringPrintf(\"http:\/\/%s:%d\/\",\n                        experiment_host.c_str(), kAlternativePort));\n\n  task_config.protocol_version = net::WebSocket::DRAFT75;\n  config = &config_.ws_config[STATE_RUN_WS_DRAFT75 - STATE_RUN_WS];\n  *config = task_config;\n  config->url =\n      GURL(StringPrintf(\"ws:\/\/%s\/live_exp\", experiment_host.c_str()));\n  config->ws_location =\n      StringPrintf(\"ws:\/\/%s\/live_exp\", experiment_host.c_str());\n  config->http_url =\n      GURL(StringPrintf(\"http:\/\/%s\/\", experiment_host.c_str()));\n\n  config = &config_.ws_config[STATE_RUN_WSS_DRAFT75 - STATE_RUN_WS];\n  *config = task_config;\n  config->url =\n      GURL(StringPrintf(\"wss:\/\/%s\/live_exp\", experiment_host.c_str()));\n  config->ws_location =\n      StringPrintf(\"wss:\/\/%s\/live_exp\", experiment_host.c_str());\n  config->http_url =\n      GURL(StringPrintf(\"https:\/\/%s\/\", experiment_host.c_str()));\n\n  config = &config_.ws_config[STATE_RUN_WS_NODEFAULT_PORT_DRAFT75 -\n                              STATE_RUN_WS];\n  *config = task_config;\n  config->url =\n      GURL(StringPrintf(\"ws:\/\/%s:%d\/live_exp\",\n                        experiment_host.c_str(), kAlternativePort));\n  config->ws_location =\n      StringPrintf(\"ws:\/\/%s:%d\/live_exp\",\n                   experiment_host.c_str(), kAlternativePort);\n  config->http_url =\n      GURL(StringPrintf(\"http:\/\/%s:%d\/\",\n                        experiment_host.c_str(), kAlternativePort));\n\n}\n\nvoid WebSocketExperimentRunner::DoLoop() {\n  if (next_state_ == STATE_NONE) {\n    if (task_.get()) {\n      AddRef();  \/\/ Release in OnTaskCompleted after Cancelled.\n      task_->Cancel();\n    }\n    return;\n  }\n\n  State state = next_state_;\n  task_state_ = STATE_NONE;\n  next_state_ = STATE_NONE;\n\n  switch (state) {\n    case STATE_IDLE:\n      task_.reset();\n      next_state_ = STATE_RUN_WS;\n      BrowserThread::PostDelayedTask(\n          BrowserThread::IO,\n          FROM_HERE,\n          NewRunnableMethod(this, &WebSocketExperimentRunner::DoLoop),\n          config_.next_delay_ms);\n      break;\n    case STATE_RUN_WS:\n    case STATE_RUN_WSS:\n    case STATE_RUN_WS_NODEFAULT_PORT:\n    case STATE_RUN_WS_DRAFT75:\n    case STATE_RUN_WSS_DRAFT75:\n    case STATE_RUN_WS_NODEFAULT_PORT_DRAFT75:\n      task_.reset(new WebSocketExperimentTask(\n          config_.ws_config[state - STATE_RUN_WS], &task_callback_));\n      task_state_ = state;\n      if (static_cast<State>(state + 1) == NUM_STATES)\n        next_state_ = STATE_IDLE;\n      else\n        next_state_ = static_cast<State>(state + 1);\n      break;\n    default:\n      NOTREACHED();\n      break;\n  }\n  if (task_.get())\n    task_->Run();\n}\n\nvoid WebSocketExperimentRunner::OnTaskCompleted(int result) {\n  if (next_state_ == STATE_NONE) {\n    task_.reset();\n    \/\/ Task is Canceled.\n    DLOG(INFO) << \"WebSocketExperiment Task is canceled.\";\n    Release();\n    return;\n  }\n  task_->SaveResult();\n  task_.reset();\n\n  DoLoop();\n}\n\n}  \/\/ namespace chrome_browser_net_websocket_experiment\n<commit_msg>disable websocket live experiment by default<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\/net\/websocket_experiment\/websocket_experiment_runner.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/compiler_specific.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/metrics\/field_trial.h\"\n#include \"base\/task.h\"\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/browser_thread.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"net\/base\/host_resolver.h\"\n#include \"net\/base\/net_errors.h\"\n#include \"net\/websockets\/websocket.h\"\n\nnamespace chrome_browser_net_websocket_experiment {\n\nstatic const char *kExperimentHost = \"websocket-experiment.chromium.org\";\nstatic const int kAlternativePort = 61985;\n\n\/\/ Hold reference while experiment is running.\nstatic scoped_refptr<WebSocketExperimentRunner> runner;\n\n\/* static *\/\nvoid WebSocketExperimentRunner::Start() {\n  DCHECK(!runner.get());\n\n  scoped_refptr<base::FieldTrial> trial =\n      new base::FieldTrial(\"WebSocketExperiment\", 1000);\n  trial->AppendGroup(\"active\", 5);  \/\/ 0.5% in active group.\n\n  bool run_experiment =\n      (trial->group() != base::FieldTrial::kNotParticipating);\n#ifndef NDEBUG\n  const CommandLine& command_line = *CommandLine::ForCurrentProcess();\n  std::string experiment_host = command_line.GetSwitchValueASCII(\n      switches::kWebSocketLiveExperimentHost);\n  if (!experiment_host.empty())\n    run_experiment = true;\n#else\n  run_experiment = false;\n#endif\n  if (!run_experiment)\n    return;\n\n  runner = new WebSocketExperimentRunner;\n  runner->Run();\n}\n\n\/* static *\/\nvoid WebSocketExperimentRunner::Stop() {\n  if (runner.get())\n    runner->Cancel();\n  runner = NULL;\n}\n\nWebSocketExperimentRunner::WebSocketExperimentRunner()\n    : next_state_(STATE_NONE),\n      task_state_(STATE_NONE),\n      ALLOW_THIS_IN_INITIALIZER_LIST(\n          task_callback_(this, &WebSocketExperimentRunner::OnTaskCompleted)) {\n  WebSocketExperimentTask::InitHistogram();\n  InitConfig();\n}\n\nWebSocketExperimentRunner::~WebSocketExperimentRunner() {\n  DCHECK(!task_.get());\n  WebSocketExperimentTask::ReleaseHistogram();\n}\n\nvoid WebSocketExperimentRunner::Run() {\n  DCHECK_EQ(next_state_, STATE_NONE);\n  next_state_ = STATE_RUN_WS;\n  BrowserThread::PostDelayedTask(\n      BrowserThread::IO,\n      FROM_HERE,\n      NewRunnableMethod(this, &WebSocketExperimentRunner::DoLoop),\n      config_.initial_delay_ms);\n}\n\nvoid WebSocketExperimentRunner::Cancel() {\n  next_state_ = STATE_NONE;\n  BrowserThread::PostTask(\n      BrowserThread::IO,\n      FROM_HERE,\n      NewRunnableMethod(this, &WebSocketExperimentRunner::DoLoop));\n}\n\nvoid WebSocketExperimentRunner::InitConfig() {\n  config_.initial_delay_ms = 5 * 60 * 1000;  \/\/ 5 mins\n  config_.next_delay_ms = 12 * 60 * 60 * 1000;  \/\/ 12 hours\n\n  std::string experiment_host = kExperimentHost;\n#ifndef NDEBUG\n  const CommandLine& command_line = *CommandLine::ForCurrentProcess();\n  std::string experiment_host_override = command_line.GetSwitchValueASCII(\n      switches::kWebSocketLiveExperimentHost);\n  if (!experiment_host_override.empty()) {\n    experiment_host = experiment_host_override;\n    config_.initial_delay_ms = 5 * 1000;  \/\/ 5 secs.\n  }\n#endif\n\n  WebSocketExperimentTask::Config* config;\n  WebSocketExperimentTask::Config task_config;\n\n  task_config.protocol_version = net::WebSocket::DEFAULT_VERSION;\n  config = &config_.ws_config[STATE_RUN_WS - STATE_RUN_WS];\n  *config = task_config;\n  config->url =\n      GURL(StringPrintf(\"ws:\/\/%s\/live_exp\", experiment_host.c_str()));\n  config->ws_location =\n      StringPrintf(\"ws:\/\/%s\/live_exp\", experiment_host.c_str());\n  config->http_url =\n      GURL(StringPrintf(\"http:\/\/%s\/\", experiment_host.c_str()));\n\n  config = &config_.ws_config[STATE_RUN_WSS - STATE_RUN_WS];\n  *config = task_config;\n  config->url =\n      GURL(StringPrintf(\"wss:\/\/%s\/live_exp\", experiment_host.c_str()));\n  config->ws_location =\n      StringPrintf(\"wss:\/\/%s\/live_exp\", experiment_host.c_str());\n  config->http_url =\n      GURL(StringPrintf(\"https:\/\/%s\/\", experiment_host.c_str()));\n\n  config = &config_.ws_config[STATE_RUN_WS_NODEFAULT_PORT -\n                              STATE_RUN_WS];\n  *config = task_config;\n  config->url =\n      GURL(StringPrintf(\"ws:\/\/%s:%d\/live_exp\",\n                        experiment_host.c_str(), kAlternativePort));\n  config->ws_location =\n      StringPrintf(\"ws:\/\/%s:%d\/live_exp\",\n                   experiment_host.c_str(), kAlternativePort);\n  config->http_url =\n      GURL(StringPrintf(\"http:\/\/%s:%d\/\",\n                        experiment_host.c_str(), kAlternativePort));\n\n  task_config.protocol_version = net::WebSocket::DRAFT75;\n  config = &config_.ws_config[STATE_RUN_WS_DRAFT75 - STATE_RUN_WS];\n  *config = task_config;\n  config->url =\n      GURL(StringPrintf(\"ws:\/\/%s\/live_exp\", experiment_host.c_str()));\n  config->ws_location =\n      StringPrintf(\"ws:\/\/%s\/live_exp\", experiment_host.c_str());\n  config->http_url =\n      GURL(StringPrintf(\"http:\/\/%s\/\", experiment_host.c_str()));\n\n  config = &config_.ws_config[STATE_RUN_WSS_DRAFT75 - STATE_RUN_WS];\n  *config = task_config;\n  config->url =\n      GURL(StringPrintf(\"wss:\/\/%s\/live_exp\", experiment_host.c_str()));\n  config->ws_location =\n      StringPrintf(\"wss:\/\/%s\/live_exp\", experiment_host.c_str());\n  config->http_url =\n      GURL(StringPrintf(\"https:\/\/%s\/\", experiment_host.c_str()));\n\n  config = &config_.ws_config[STATE_RUN_WS_NODEFAULT_PORT_DRAFT75 -\n                              STATE_RUN_WS];\n  *config = task_config;\n  config->url =\n      GURL(StringPrintf(\"ws:\/\/%s:%d\/live_exp\",\n                        experiment_host.c_str(), kAlternativePort));\n  config->ws_location =\n      StringPrintf(\"ws:\/\/%s:%d\/live_exp\",\n                   experiment_host.c_str(), kAlternativePort);\n  config->http_url =\n      GURL(StringPrintf(\"http:\/\/%s:%d\/\",\n                        experiment_host.c_str(), kAlternativePort));\n\n}\n\nvoid WebSocketExperimentRunner::DoLoop() {\n  if (next_state_ == STATE_NONE) {\n    if (task_.get()) {\n      AddRef();  \/\/ Release in OnTaskCompleted after Cancelled.\n      task_->Cancel();\n    }\n    return;\n  }\n\n  State state = next_state_;\n  task_state_ = STATE_NONE;\n  next_state_ = STATE_NONE;\n\n  switch (state) {\n    case STATE_IDLE:\n      task_.reset();\n      next_state_ = STATE_RUN_WS;\n      BrowserThread::PostDelayedTask(\n          BrowserThread::IO,\n          FROM_HERE,\n          NewRunnableMethod(this, &WebSocketExperimentRunner::DoLoop),\n          config_.next_delay_ms);\n      break;\n    case STATE_RUN_WS:\n    case STATE_RUN_WSS:\n    case STATE_RUN_WS_NODEFAULT_PORT:\n    case STATE_RUN_WS_DRAFT75:\n    case STATE_RUN_WSS_DRAFT75:\n    case STATE_RUN_WS_NODEFAULT_PORT_DRAFT75:\n      task_.reset(new WebSocketExperimentTask(\n          config_.ws_config[state - STATE_RUN_WS], &task_callback_));\n      task_state_ = state;\n      if (static_cast<State>(state + 1) == NUM_STATES)\n        next_state_ = STATE_IDLE;\n      else\n        next_state_ = static_cast<State>(state + 1);\n      break;\n    default:\n      NOTREACHED();\n      break;\n  }\n  if (task_.get())\n    task_->Run();\n}\n\nvoid WebSocketExperimentRunner::OnTaskCompleted(int result) {\n  if (next_state_ == STATE_NONE) {\n    task_.reset();\n    \/\/ Task is Canceled.\n    DLOG(INFO) << \"WebSocketExperiment Task is canceled.\";\n    Release();\n    return;\n  }\n  task_->SaveResult();\n  task_.reset();\n\n  DoLoop();\n}\n\n}  \/\/ namespace chrome_browser_net_websocket_experiment\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2012 Intel Corp\n\/\/ Copyright (c) 2012 The Chromium 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 deal\n\/\/  in the Software without restriction, including without limitation the rights\n\/\/  to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell co\n\/\/ pies of the Software, and to permit persons to whom the Software is furnished\n\/\/  to do so, subject to the following conditions:\n\/\/ \n\/\/ The above copyright notice and this permission notice shall be included in al\n\/\/ l copies or substantial portions of the Software.\n\/\/ \n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IM\n\/\/ PLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNES\n\/\/ S FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS\n\/\/  OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WH\n\/\/ ETHER 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#include \"content\/nw\/src\/shell_content_browser_client.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/file_path.h\"\n#include \"base\/file_util.h\"\n#include \"base\/string_util.h\"\n#include \"base\/threading\/thread_restrictions.h\"\n#include \"base\/values.h\"\n#include \"content\/public\/browser\/browser_url_handler.h\"\n#include \"content\/public\/browser\/render_process_host.h\"\n#include \"content\/public\/browser\/render_view_host.h\"\n#include \"content\/public\/browser\/resource_dispatcher_host.h\"\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"content\/public\/common\/content_switches.h\"\n#include \"content\/public\/common\/renderer_preferences.h\"\n#include \"content\/nw\/src\/api\/dispatcher_host.h\"\n#include \"content\/nw\/src\/common\/shell_switches.h\"\n#include \"content\/nw\/src\/browser\/shell_devtools_delegate.h\"\n#include \"content\/nw\/src\/browser\/shell_resource_dispatcher_host_delegate.h\"\n#include \"content\/nw\/src\/media\/media_internals.h\"\n#include \"content\/nw\/src\/nw_package.h\"\n#include \"content\/nw\/src\/nw_shell.h\"\n#include \"content\/nw\/src\/nw_version.h\"\n#include \"content\/nw\/src\/shell_browser_context.h\"\n#include \"content\/nw\/src\/shell_browser_main_parts.h\"\n#include \"geolocation\/shell_access_token_store.h\"\n#include \"googleurl\/src\/gurl.h\"\n#include \"webkit\/glue\/webpreferences.h\"\n#include \"webkit\/user_agent\/user_agent_util.h\"\n#include \"ui\/base\/l10n\/l10n_util.h\"\n#include \"webkit\/plugins\/npapi\/plugin_list.h\"\n\nnamespace content {\n\nShellContentBrowserClient::ShellContentBrowserClient()\n    : shell_browser_main_parts_(NULL) {\n}\n\nShellContentBrowserClient::~ShellContentBrowserClient() {\n}\n\nBrowserMainParts* ShellContentBrowserClient::CreateBrowserMainParts(\n    const MainFunctionParams& parameters) {\n  shell_browser_main_parts_ = new ShellBrowserMainParts(parameters);\n  return shell_browser_main_parts_;\n}\n\nWebContentsView* ShellContentBrowserClient::OverrideCreateWebContentsView(\n      WebContents* web_contents,\n      RenderViewHostDelegateView** render_view_host_delegate_view) {\n  std::string user_agent, rules;\n  nw::Package* package = shell_browser_main_parts()->package();\n  content::RendererPreferences* prefs = web_contents->GetMutableRendererPrefs();\n  if (package->root()->GetString(switches::kmUserAgent, &user_agent)) {\n    std::string name, version;\n    package->root()->GetString(switches::kmName, &name);\n    package->root()->GetString(\"version\", &version);\n    ReplaceSubstringsAfterOffset(&user_agent, 0, \"%name\", name);\n    ReplaceSubstringsAfterOffset(&user_agent, 0, \"%ver\", version);\n    ReplaceSubstringsAfterOffset(&user_agent, 0, \"%nwver\", NW_VERSION_STRING);\n    ReplaceSubstringsAfterOffset(&user_agent, 0, \"%webkit_ver\", webkit_glue::GetWebKitVersion());\n    ReplaceSubstringsAfterOffset(&user_agent, 0, \"%osinfo\", webkit_glue::BuildOSInfo());\n    prefs->user_agent_override = user_agent;\n  }\n  if (package->root()->GetString(switches::kmRemotePages, &rules))\n      prefs->nw_remote_page_rules = rules;\n  return NULL;\n}\n\nvoid ShellContentBrowserClient::RenderViewHostCreated(\n    RenderViewHost* render_view_host) {\n  new api::DispatcherHost(render_view_host);\n}\n\nstd::string ShellContentBrowserClient::GetApplicationLocale() {\n  return l10n_util::GetApplicationLocale(\"en-US\");\n}\n\nvoid ShellContentBrowserClient::AppendExtraCommandLineSwitches(\n    CommandLine* command_line,\n    int child_process_id) {\n  if (command_line->GetSwitchValueASCII(\"type\") != \"renderer\")\n    return;\n  if (child_process_id > 0) {\n    content::RenderProcessHost* rph =\n      content::RenderProcessHost::FromID(child_process_id);\n\n    content::RenderProcessHost::RenderWidgetHostsIterator iter(\n      rph->GetRenderWidgetHostsIterator());\n    for (; !iter.IsAtEnd(); iter.Advance()) {\n      const content::RenderWidgetHost* widget = iter.GetCurrentValue();\n      DCHECK(widget);\n      if (!widget || !widget->IsRenderView())\n        continue;\n\n      content::RenderViewHost* host = content::RenderViewHost::From(\n        const_cast<content::RenderWidgetHost*>(widget));\n      content::Shell* shell = content::Shell::FromRenderViewHost(host);\n      if (shell && (shell->is_devtools() || !shell->nodejs()))\n        return;\n    }\n  }\n  nw::Package* package = shell_browser_main_parts()->package();\n  if (package && package->GetUseNode()) {\n    \/\/ Allow node.js\n    command_line->AppendSwitch(switches::kmNodejs);\n\n    \/\/ Set cwd\n    command_line->AppendSwitchPath(switches::kWorkingDirectory,\n                                   package->path());\n\n    \/\/ Check if we have 'node-main'.\n    std::string node_main;\n    if (package->root()->GetString(switches::kNodeMain, &node_main))\n      command_line->AppendSwitchASCII(switches::kNodeMain, node_main);\n\n    std::string snapshot_path;\n    if (package->root()->GetString(switches::kSnapshot, &snapshot_path))\n      command_line->AppendSwitchASCII(switches::kSnapshot, snapshot_path);\n  }\n\n  \/\/ without the switch, the destructor of the shell object will\n  \/\/ shutdown renderwidgethost (RenderWidgetHostImpl::Shutdown) and\n  \/\/ destory rph immediately. Then the channel error msg is caught by\n  \/\/ SuicideOnChannelErrorFilter and the renderer is killed\n  \/\/ immediately\n\n  command_line->AppendSwitch(switches::kChildCleanExit);\n}\n\nvoid ShellContentBrowserClient::ResourceDispatcherHostCreated() {\n  resource_dispatcher_host_delegate_.reset(\n      new ShellResourceDispatcherHostDelegate());\n  ResourceDispatcherHost::Get()->SetDelegate(\n      resource_dispatcher_host_delegate_.get());\n}\n\nstd::string ShellContentBrowserClient::GetDefaultDownloadName() {\n  return \"download\";\n}\n\nMediaObserver* ShellContentBrowserClient::GetMediaObserver() {\n  return MediaInternals::GetInstance();\n}\n\nvoid ShellContentBrowserClient::BrowserURLHandlerCreated(\n    BrowserURLHandler* handler) {\n}\n\nShellBrowserContext* ShellContentBrowserClient::browser_context() {\n  return shell_browser_main_parts_->browser_context();\n}\n\nShellBrowserContext*\n    ShellContentBrowserClient::off_the_record_browser_context() {\n  return shell_browser_main_parts_->off_the_record_browser_context();\n}\n\nAccessTokenStore* ShellContentBrowserClient::CreateAccessTokenStore() {\n  return new ShellAccessTokenStore(browser_context()->GetRequestContext());\n}\n\nvoid ShellContentBrowserClient::OverrideWebkitPrefs(\n      RenderViewHost* render_view_host,\n      const GURL& url,\n      webkit_glue::WebPreferences* prefs) {\n  nw::Package* package = shell_browser_main_parts()->package();\n\n  \/\/ Disable web security.\n  prefs->dom_paste_enabled = true;\n  prefs->javascript_can_access_clipboard = true;\n  prefs->web_security_enabled = false;\n  prefs->allow_file_access_from_file_urls = true;\n\n  \/\/ Open experimental features.\n  prefs->css_sticky_position_enabled = true;\n  prefs->css_shaders_enabled = true;\n  prefs->css_variables_enabled = true;\n\n  \/\/ Disable plugins and cache by default.\n  prefs->plugins_enabled = false;\n  prefs->java_enabled = false;\n  prefs->uses_page_cache = false;\n\n  base::DictionaryValue* webkit;\n  if (package->root()->GetDictionary(switches::kmWebkit, &webkit)) {\n    webkit->GetBoolean(switches::kmJava, &prefs->java_enabled);\n    webkit->GetBoolean(switches::kmPlugin, &prefs->plugins_enabled);\n    webkit->GetBoolean(switches::kmPageCache, &prefs->uses_page_cache);\n    FilePath plugins_dir = package->path();\n    \/\/PathService::Get(base::DIR_CURRENT, &plugins_dir);\n    plugins_dir = plugins_dir.AppendASCII(\"plugins\");\n\n    webkit::npapi::PluginList::Singleton()->AddExtraPluginDir(plugins_dir);\n  }\n}\n\nbool ShellContentBrowserClient::ShouldTryToUseExistingProcessHost(\n      BrowserContext* browser_context, const GURL& url) {\n  ShellBrowserContext* shell_browser_context =\n    static_cast<ShellBrowserContext*>(browser_context);\n  if (shell_browser_context->pinning_renderer())\n    return true;\n  else\n    return false;\n}\n\nbool ShellContentBrowserClient::IsSuitableHost(RenderProcessHost* process_host,\n                                          const GURL& site_url) {\n  return true;\n}\n\n}  \/\/ namespace content\n<commit_msg>use 'child-clean-exit' on POSIX systems only<commit_after>\/\/ Copyright (c) 2012 Intel Corp\n\/\/ Copyright (c) 2012 The Chromium 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 deal\n\/\/  in the Software without restriction, including without limitation the rights\n\/\/  to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell co\n\/\/ pies of the Software, and to permit persons to whom the Software is furnished\n\/\/  to do so, subject to the following conditions:\n\/\/ \n\/\/ The above copyright notice and this permission notice shall be included in al\n\/\/ l copies or substantial portions of the Software.\n\/\/ \n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IM\n\/\/ PLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNES\n\/\/ S FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS\n\/\/  OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WH\n\/\/ ETHER 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#include \"content\/nw\/src\/shell_content_browser_client.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/file_path.h\"\n#include \"base\/file_util.h\"\n#include \"base\/string_util.h\"\n#include \"base\/threading\/thread_restrictions.h\"\n#include \"base\/values.h\"\n#include \"content\/public\/browser\/browser_url_handler.h\"\n#include \"content\/public\/browser\/render_process_host.h\"\n#include \"content\/public\/browser\/render_view_host.h\"\n#include \"content\/public\/browser\/resource_dispatcher_host.h\"\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"content\/public\/common\/content_switches.h\"\n#include \"content\/public\/common\/renderer_preferences.h\"\n#include \"content\/nw\/src\/api\/dispatcher_host.h\"\n#include \"content\/nw\/src\/common\/shell_switches.h\"\n#include \"content\/nw\/src\/browser\/shell_devtools_delegate.h\"\n#include \"content\/nw\/src\/browser\/shell_resource_dispatcher_host_delegate.h\"\n#include \"content\/nw\/src\/media\/media_internals.h\"\n#include \"content\/nw\/src\/nw_package.h\"\n#include \"content\/nw\/src\/nw_shell.h\"\n#include \"content\/nw\/src\/nw_version.h\"\n#include \"content\/nw\/src\/shell_browser_context.h\"\n#include \"content\/nw\/src\/shell_browser_main_parts.h\"\n#include \"geolocation\/shell_access_token_store.h\"\n#include \"googleurl\/src\/gurl.h\"\n#include \"webkit\/glue\/webpreferences.h\"\n#include \"webkit\/user_agent\/user_agent_util.h\"\n#include \"ui\/base\/l10n\/l10n_util.h\"\n#include \"webkit\/plugins\/npapi\/plugin_list.h\"\n\nnamespace content {\n\nShellContentBrowserClient::ShellContentBrowserClient()\n    : shell_browser_main_parts_(NULL) {\n}\n\nShellContentBrowserClient::~ShellContentBrowserClient() {\n}\n\nBrowserMainParts* ShellContentBrowserClient::CreateBrowserMainParts(\n    const MainFunctionParams& parameters) {\n  shell_browser_main_parts_ = new ShellBrowserMainParts(parameters);\n  return shell_browser_main_parts_;\n}\n\nWebContentsView* ShellContentBrowserClient::OverrideCreateWebContentsView(\n      WebContents* web_contents,\n      RenderViewHostDelegateView** render_view_host_delegate_view) {\n  std::string user_agent, rules;\n  nw::Package* package = shell_browser_main_parts()->package();\n  content::RendererPreferences* prefs = web_contents->GetMutableRendererPrefs();\n  if (package->root()->GetString(switches::kmUserAgent, &user_agent)) {\n    std::string name, version;\n    package->root()->GetString(switches::kmName, &name);\n    package->root()->GetString(\"version\", &version);\n    ReplaceSubstringsAfterOffset(&user_agent, 0, \"%name\", name);\n    ReplaceSubstringsAfterOffset(&user_agent, 0, \"%ver\", version);\n    ReplaceSubstringsAfterOffset(&user_agent, 0, \"%nwver\", NW_VERSION_STRING);\n    ReplaceSubstringsAfterOffset(&user_agent, 0, \"%webkit_ver\", webkit_glue::GetWebKitVersion());\n    ReplaceSubstringsAfterOffset(&user_agent, 0, \"%osinfo\", webkit_glue::BuildOSInfo());\n    prefs->user_agent_override = user_agent;\n  }\n  if (package->root()->GetString(switches::kmRemotePages, &rules))\n      prefs->nw_remote_page_rules = rules;\n  return NULL;\n}\n\nvoid ShellContentBrowserClient::RenderViewHostCreated(\n    RenderViewHost* render_view_host) {\n  new api::DispatcherHost(render_view_host);\n}\n\nstd::string ShellContentBrowserClient::GetApplicationLocale() {\n  return l10n_util::GetApplicationLocale(\"en-US\");\n}\n\nvoid ShellContentBrowserClient::AppendExtraCommandLineSwitches(\n    CommandLine* command_line,\n    int child_process_id) {\n  if (command_line->GetSwitchValueASCII(\"type\") != \"renderer\")\n    return;\n  if (child_process_id > 0) {\n    content::RenderProcessHost* rph =\n      content::RenderProcessHost::FromID(child_process_id);\n\n    content::RenderProcessHost::RenderWidgetHostsIterator iter(\n      rph->GetRenderWidgetHostsIterator());\n    for (; !iter.IsAtEnd(); iter.Advance()) {\n      const content::RenderWidgetHost* widget = iter.GetCurrentValue();\n      DCHECK(widget);\n      if (!widget || !widget->IsRenderView())\n        continue;\n\n      content::RenderViewHost* host = content::RenderViewHost::From(\n        const_cast<content::RenderWidgetHost*>(widget));\n      content::Shell* shell = content::Shell::FromRenderViewHost(host);\n      if (shell && (shell->is_devtools() || !shell->nodejs()))\n        return;\n    }\n  }\n  nw::Package* package = shell_browser_main_parts()->package();\n  if (package && package->GetUseNode()) {\n    \/\/ Allow node.js\n    command_line->AppendSwitch(switches::kmNodejs);\n\n    \/\/ Set cwd\n    command_line->AppendSwitchPath(switches::kWorkingDirectory,\n                                   package->path());\n\n    \/\/ Check if we have 'node-main'.\n    std::string node_main;\n    if (package->root()->GetString(switches::kNodeMain, &node_main))\n      command_line->AppendSwitchASCII(switches::kNodeMain, node_main);\n\n    std::string snapshot_path;\n    if (package->root()->GetString(switches::kSnapshot, &snapshot_path))\n      command_line->AppendSwitchASCII(switches::kSnapshot, snapshot_path);\n  }\n\n  \/\/ without the switch, the destructor of the shell object will\n  \/\/ shutdown renderwidgethost (RenderWidgetHostImpl::Shutdown) and\n  \/\/ destory rph immediately. Then the channel error msg is caught by\n  \/\/ SuicideOnChannelErrorFilter and the renderer is killed\n  \/\/ immediately\n#if defined(OS_POSIX)\n  command_line->AppendSwitch(switches::kChildCleanExit);\n#endif\n}\n\nvoid ShellContentBrowserClient::ResourceDispatcherHostCreated() {\n  resource_dispatcher_host_delegate_.reset(\n      new ShellResourceDispatcherHostDelegate());\n  ResourceDispatcherHost::Get()->SetDelegate(\n      resource_dispatcher_host_delegate_.get());\n}\n\nstd::string ShellContentBrowserClient::GetDefaultDownloadName() {\n  return \"download\";\n}\n\nMediaObserver* ShellContentBrowserClient::GetMediaObserver() {\n  return MediaInternals::GetInstance();\n}\n\nvoid ShellContentBrowserClient::BrowserURLHandlerCreated(\n    BrowserURLHandler* handler) {\n}\n\nShellBrowserContext* ShellContentBrowserClient::browser_context() {\n  return shell_browser_main_parts_->browser_context();\n}\n\nShellBrowserContext*\n    ShellContentBrowserClient::off_the_record_browser_context() {\n  return shell_browser_main_parts_->off_the_record_browser_context();\n}\n\nAccessTokenStore* ShellContentBrowserClient::CreateAccessTokenStore() {\n  return new ShellAccessTokenStore(browser_context()->GetRequestContext());\n}\n\nvoid ShellContentBrowserClient::OverrideWebkitPrefs(\n      RenderViewHost* render_view_host,\n      const GURL& url,\n      webkit_glue::WebPreferences* prefs) {\n  nw::Package* package = shell_browser_main_parts()->package();\n\n  \/\/ Disable web security.\n  prefs->dom_paste_enabled = true;\n  prefs->javascript_can_access_clipboard = true;\n  prefs->web_security_enabled = false;\n  prefs->allow_file_access_from_file_urls = true;\n\n  \/\/ Open experimental features.\n  prefs->css_sticky_position_enabled = true;\n  prefs->css_shaders_enabled = true;\n  prefs->css_variables_enabled = true;\n\n  \/\/ Disable plugins and cache by default.\n  prefs->plugins_enabled = false;\n  prefs->java_enabled = false;\n  prefs->uses_page_cache = false;\n\n  base::DictionaryValue* webkit;\n  if (package->root()->GetDictionary(switches::kmWebkit, &webkit)) {\n    webkit->GetBoolean(switches::kmJava, &prefs->java_enabled);\n    webkit->GetBoolean(switches::kmPlugin, &prefs->plugins_enabled);\n    webkit->GetBoolean(switches::kmPageCache, &prefs->uses_page_cache);\n    FilePath plugins_dir = package->path();\n    \/\/PathService::Get(base::DIR_CURRENT, &plugins_dir);\n    plugins_dir = plugins_dir.AppendASCII(\"plugins\");\n\n    webkit::npapi::PluginList::Singleton()->AddExtraPluginDir(plugins_dir);\n  }\n}\n\nbool ShellContentBrowserClient::ShouldTryToUseExistingProcessHost(\n      BrowserContext* browser_context, const GURL& url) {\n  ShellBrowserContext* shell_browser_context =\n    static_cast<ShellBrowserContext*>(browser_context);\n  if (shell_browser_context->pinning_renderer())\n    return true;\n  else\n    return false;\n}\n\nbool ShellContentBrowserClient::IsSuitableHost(RenderProcessHost* process_host,\n                                          const GURL& site_url) {\n  return true;\n}\n\n}  \/\/ namespace content\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: JStatement.hxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: vg $ $Date: 2007-01-15 13:37:56 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n#ifndef _CONNECTIVITY_JAVA_SQL_STATEMENT_HXX_\n#define _CONNECTIVITY_JAVA_SQL_STATEMENT_HXX_\n\n#ifndef _CONNECTIVITY_JAVA_LANG_OBJECT_HXX_\n#include \"java\/lang\/Object.hxx\"\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XSTATEMENT_HPP_\n#include <com\/sun\/star\/sdbc\/XStatement.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_SDBC_XMULTIPLERESULTS_HPP_\n#include <com\/sun\/star\/sdbc\/XMultipleResults.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XBATCHEXECUTION_HPP_\n#include <com\/sun\/star\/sdbc\/XBatchExecution.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XCLOSEABLE_HPP_\n#include <com\/sun\/star\/sdbc\/XCloseable.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UTIL_XCANCELLABLE_HPP_\n#include <com\/sun\/star\/util\/XCancellable.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XGENERATEDRESULTSET_HPP_\n#include <com\/sun\/star\/sdbc\/XGeneratedResultSet.hpp>\n#endif\n#ifndef _COMPHELPER_PROPERTY_ARRAY_HELPER_HXX_\n#include <comphelper\/proparrhlp.hxx>\n#endif\n#ifndef _CPPUHELPER_COMPBASE6_HXX_\n#include <cppuhelper\/compbase6.hxx>\n#endif\n#ifndef _COMPHELPER_UNO3_HXX_\n#include <comphelper\/uno3.hxx>\n#endif\n#ifndef _CONNECTIVITY_COMMONTOOLS_HXX_\n#include \"connectivity\/CommonTools.hxx\"\n#endif\n#ifndef _CONNECTIVITY_OSUBCOMPONENT_HXX_\n#include \"OSubComponent.hxx\"\n#endif\n#ifndef _COM_SUN_STAR_LANG_XSERVICEINFO_HPP_\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#endif\n#ifndef _COMPHELPER_BROADCASTHELPER_HXX_\n#include <comphelper\/broadcasthelper.hxx>\n#endif\n\nnamespace connectivity\n{\n\n        typedef ::cppu::WeakComponentImplHelper6<       ::com::sun::star::sdbc::XStatement,\n                                                        ::com::sun::star::sdbc::XWarningsSupplier,\n                                                        ::com::sun::star::util::XCancellable,\n                                                        ::com::sun::star::sdbc::XCloseable,\n                                                        ::com::sun::star::sdbc::XGeneratedResultSet,\n                                                        ::com::sun::star::sdbc::XMultipleResults> java_sql_Statement_BASE;\n\n    class java_sql_Connection;\n\n    \/\/**************************************************************\n    \/\/************ Class: java.sql.Statement\n    \/\/**************************************************************\n    class java_sql_Statement_Base : public comphelper::OBaseMutex,\n                                    public  java_sql_Statement_BASE,\n                                    public  java_lang_Object,\n                                    public  ::cppu::OPropertySetHelper,\n                                    public  ::comphelper::OPropertyArrayUsageHelper<java_sql_Statement_Base>\n\n    {\n\n        sal_Int32 getQueryTimeOut()             throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        sal_Int32 getMaxFieldSize()             throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        sal_Int32 getMaxRows()                  throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        sal_Int32 getResultSetConcurrency()     throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        sal_Int32 getResultSetType()            throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        sal_Int32 getFetchDirection()           throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        sal_Int32 getFetchSize()                throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        ::rtl::OUString getCursorName()         throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n\n        void setQueryTimeOut(sal_Int32 _par0)                   throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        void setMaxFieldSize(sal_Int32 _par0)                   throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        void setMaxRows(sal_Int32 _par0)                                throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        void setResultSetConcurrency(sal_Int32 _par0)   throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        void setResultSetType(sal_Int32 _par0)                  throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        void setFetchDirection(sal_Int32 _par0)                 throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        void setFetchSize(sal_Int32 _par0)                              throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        void setCursorName(const ::rtl::OUString &_par0) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        void setEscapeProcessing(sal_Bool _par0) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n\n    protected:\n        ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XStatement>       m_xGeneratedStatement;\n        java_sql_Connection*        m_pConnection;\n        ::rtl::OUString             m_sSqlStatement;\n        \/\/ Properties\n        sal_Int32                   m_nResultSetConcurrency;\n        sal_Int32                   m_nResultSetType;\n        sal_Bool                    m_bEscapeProcessing;\n        ::cppu::OBroadcastHelper&   rBHelper;\n\n\n    \/\/ statische Daten fuer die Klasse\n        static jclass theClass;\n        \/\/ der Destruktor um den Object-Counter zu aktualisieren\n        static void saveClassRef( jclass pClass );\n\n        \/\/ OPropertyArrayUsageHelper\n        virtual ::cppu::IPropertyArrayHelper* createArrayHelper( ) const;\n        \/\/ OPropertySetHelper\n        virtual ::cppu::IPropertyArrayHelper & SAL_CALL getInfoHelper();\n\n        virtual sal_Bool SAL_CALL convertFastPropertyValue(\n                                    ::com::sun::star::uno::Any & rConvertedValue,\n                                    ::com::sun::star::uno::Any & rOldValue,\n                                    sal_Int32 nHandle,\n                                    const ::com::sun::star::uno::Any& rValue\n                                )   throw (::com::sun::star::lang::IllegalArgumentException);\n\n        virtual void SAL_CALL setFastPropertyValue_NoBroadcast(\n                                    sal_Int32 nHandle,\n                                    const ::com::sun::star::uno::Any& rValue\n                                )   throw (::com::sun::star::uno::Exception);\n\n        virtual void SAL_CALL getFastPropertyValue(\n                                    ::com::sun::star::uno::Any& rValue,\n                                    sal_Int32 nHandle\n                                ) const;\n\n        virtual void createStatement(JNIEnv* _pEnv) = 0;\n\n        virtual ~java_sql_Statement_Base();\n\n    public:\n        static jclass getMyClass();\n\n        \/\/ ein Konstruktor, der fuer das Returnen des Objektes benoetigt wird:\n        java_sql_Statement_Base( JNIEnv * pEnv, java_sql_Connection* _pCon );\n\n        \/\/ OComponentHelper\n        virtual void SAL_CALL disposing(void);\n        \/\/ XInterface\n        virtual void SAL_CALL acquire() throw();\n        virtual void SAL_CALL release() throw();\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\n        \/\/ XPropertySet\n        virtual ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySetInfo > SAL_CALL getPropertySetInfo(  ) throw(::com::sun::star::uno::RuntimeException);\n        \/\/ XStatement\n        virtual ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XResultSet > SAL_CALL executeQuery( const ::rtl::OUString& sql ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException) ;\n        virtual sal_Int32 SAL_CALL executeUpdate( const ::rtl::OUString& sql ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException) ;\n        virtual sal_Bool SAL_CALL execute( const ::rtl::OUString& sql ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException) ;\n        virtual ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection > SAL_CALL getConnection(  ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException) ;\n        \/\/ XWarningsSupplier\n        virtual ::com::sun::star::uno::Any SAL_CALL getWarnings(  ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        virtual void SAL_CALL clearWarnings(  ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        \/\/ XCancellable\n        virtual void SAL_CALL cancel(  ) throw(::com::sun::star::uno::RuntimeException);\n        \/\/ XCloseable\n        virtual void SAL_CALL close(  ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        \/\/ XMultipleResults\n        virtual ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XResultSet > SAL_CALL getResultSet(  ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        virtual sal_Int32 SAL_CALL getUpdateCount(  ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        virtual sal_Bool SAL_CALL getMoreResults(  ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        \/\/XGeneratedResultSet\n        virtual ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XResultSet > SAL_CALL getGeneratedValues(  ) throw (::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n\n    public:\n        using ::cppu::OPropertySetHelper::getFastPropertyValue;\n    };\n\n    class OStatement_BASE2  :public java_sql_Statement_Base\n                            ,public OSubComponent<OStatement_BASE2, java_sql_Statement_BASE>\n\n    {\n        friend class OSubComponent<OStatement_BASE2, java_sql_Statement_BASE>;\n    public:\n        OStatement_BASE2(JNIEnv * pEnv, java_sql_Connection* _pCon ) : java_sql_Statement_Base( pEnv, _pCon ),\n                                OSubComponent<OStatement_BASE2, java_sql_Statement_BASE>((::cppu::OWeakObject*)_pCon, this){}\n\n        \/\/ OComponentHelper\n        virtual void SAL_CALL disposing(void);\n        \/\/ XInterface\n        virtual void SAL_CALL release() throw();\n    };\n\n    class java_sql_Statement :  public OStatement_BASE2,\n                                public ::com::sun::star::sdbc::XBatchExecution,\n                                public ::com::sun::star::lang::XServiceInfo\n    {\n    protected:\n        \/\/ statische Daten fuer die Klasse\n        static jclass theClass;\n        \/\/ der Destruktor um den Object-Counter zu aktualisieren\n        static void saveClassRef( jclass pClass );\n\n        virtual void createStatement(JNIEnv* _pEnv);\n\n        virtual ~java_sql_Statement();\n    public:\n        DECLARE_SERVICE_INFO();\n        static jclass getMyClass();\n\n        \/\/ ein Konstruktor, der fuer das Returnen des Objektes benoetigt wird:\n        java_sql_Statement( JNIEnv * pEnv, java_sql_Connection* _pCon ) : OStatement_BASE2( pEnv, _pCon){};\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        virtual void SAL_CALL acquire() throw();\n        virtual void SAL_CALL release() throw();\n        \/\/ XBatchExecution\n        virtual void SAL_CALL addBatch( const ::rtl::OUString& sql ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        virtual void SAL_CALL clearBatch(  ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        virtual ::com::sun::star::uno::Sequence< sal_Int32 > SAL_CALL executeBatch(  ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n    };\n}\n#endif \/\/ _CONNECTIVITY_JAVA_SQL_STATEMENT_HXX_\n\n<commit_msg>INTEGRATION: CWS sdblogging (1.2.28); FILE MERGED 2007\/04\/11 08:55:23 fs 1.2.28.1: #i76119# added support for logging driver activities<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: JStatement.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: hr $ $Date: 2007-06-27 14:39: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#ifndef _CONNECTIVITY_JAVA_SQL_STATEMENT_HXX_\n#define _CONNECTIVITY_JAVA_SQL_STATEMENT_HXX_\n\n#ifndef _CONNECTIVITY_JAVA_LANG_OBJECT_HXX_\n#include \"java\/lang\/Object.hxx\"\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XSTATEMENT_HPP_\n#include <com\/sun\/star\/sdbc\/XStatement.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_SDBC_XMULTIPLERESULTS_HPP_\n#include <com\/sun\/star\/sdbc\/XMultipleResults.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XBATCHEXECUTION_HPP_\n#include <com\/sun\/star\/sdbc\/XBatchExecution.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XCLOSEABLE_HPP_\n#include <com\/sun\/star\/sdbc\/XCloseable.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UTIL_XCANCELLABLE_HPP_\n#include <com\/sun\/star\/util\/XCancellable.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XGENERATEDRESULTSET_HPP_\n#include <com\/sun\/star\/sdbc\/XGeneratedResultSet.hpp>\n#endif\n#ifndef _COMPHELPER_PROPERTY_ARRAY_HELPER_HXX_\n#include <comphelper\/proparrhlp.hxx>\n#endif\n#ifndef _CPPUHELPER_COMPBASE6_HXX_\n#include <cppuhelper\/compbase6.hxx>\n#endif\n#ifndef _COMPHELPER_UNO3_HXX_\n#include <comphelper\/uno3.hxx>\n#endif\n#ifndef _CONNECTIVITY_COMMONTOOLS_HXX_\n#include \"connectivity\/CommonTools.hxx\"\n#endif\n#ifndef _CONNECTIVITY_OSUBCOMPONENT_HXX_\n#include \"OSubComponent.hxx\"\n#endif\n#ifndef _COM_SUN_STAR_LANG_XSERVICEINFO_HPP_\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#endif\n#ifndef _COMPHELPER_BROADCASTHELPER_HXX_\n#include <comphelper\/broadcasthelper.hxx>\n#endif\n\n#include \"java\/sql\/ConnectionLog.hxx\"\n\nnamespace connectivity\n{\n\n        typedef ::cppu::WeakComponentImplHelper6<       ::com::sun::star::sdbc::XStatement,\n                                                        ::com::sun::star::sdbc::XWarningsSupplier,\n                                                        ::com::sun::star::util::XCancellable,\n                                                        ::com::sun::star::sdbc::XCloseable,\n                                                        ::com::sun::star::sdbc::XGeneratedResultSet,\n                                                        ::com::sun::star::sdbc::XMultipleResults> java_sql_Statement_BASE;\n\n    class java_sql_Connection;\n\n    \/\/**************************************************************\n    \/\/************ Class: java.sql.Statement\n    \/\/**************************************************************\n    class java_sql_Statement_Base : public comphelper::OBaseMutex,\n                                    public  java_sql_Statement_BASE,\n                                    public  java_lang_Object,\n                                    public  ::cppu::OPropertySetHelper,\n                                    public  ::comphelper::OPropertyArrayUsageHelper<java_sql_Statement_Base>\n\n    {\n\n        sal_Int32 getQueryTimeOut()             throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        sal_Int32 getMaxFieldSize()             throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        sal_Int32 getMaxRows()                  throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        sal_Int32 getResultSetConcurrency()     throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        sal_Int32 getResultSetType()            throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        sal_Int32 getFetchDirection()           throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        sal_Int32 getFetchSize()                throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        ::rtl::OUString getCursorName()         throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n\n        void setQueryTimeOut(sal_Int32 _par0)                   throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        void setMaxFieldSize(sal_Int32 _par0)                   throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        void setMaxRows(sal_Int32 _par0)                                throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        void setResultSetConcurrency(sal_Int32 _par0)   throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        void setResultSetType(sal_Int32 _par0)                  throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        void setFetchDirection(sal_Int32 _par0)                 throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        void setFetchSize(sal_Int32 _par0)                              throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        void setCursorName(const ::rtl::OUString &_par0) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        void setEscapeProcessing(sal_Bool _par0) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n\n    protected:\n        ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XStatement>       m_xGeneratedStatement;\n        java_sql_Connection*        m_pConnection;\n        java::sql::ConnectionLog    m_aLogger;\n        ::rtl::OUString             m_sSqlStatement;\n        \/\/ Properties\n        sal_Int32                   m_nResultSetConcurrency;\n        sal_Int32                   m_nResultSetType;\n        sal_Bool                    m_bEscapeProcessing;\n        ::cppu::OBroadcastHelper&   rBHelper;\n\n\n    \/\/ statische Daten fuer die Klasse\n        static jclass theClass;\n        \/\/ der Destruktor um den Object-Counter zu aktualisieren\n        static void saveClassRef( jclass pClass );\n\n        \/\/ OPropertyArrayUsageHelper\n        virtual ::cppu::IPropertyArrayHelper* createArrayHelper( ) const;\n        \/\/ OPropertySetHelper\n        virtual ::cppu::IPropertyArrayHelper & SAL_CALL getInfoHelper();\n\n        virtual sal_Bool SAL_CALL convertFastPropertyValue(\n                                    ::com::sun::star::uno::Any & rConvertedValue,\n                                    ::com::sun::star::uno::Any & rOldValue,\n                                    sal_Int32 nHandle,\n                                    const ::com::sun::star::uno::Any& rValue\n                                )   throw (::com::sun::star::lang::IllegalArgumentException);\n\n        virtual void SAL_CALL setFastPropertyValue_NoBroadcast(\n                                    sal_Int32 nHandle,\n                                    const ::com::sun::star::uno::Any& rValue\n                                )   throw (::com::sun::star::uno::Exception);\n\n        virtual void SAL_CALL getFastPropertyValue(\n                                    ::com::sun::star::uno::Any& rValue,\n                                    sal_Int32 nHandle\n                                ) const;\n\n        virtual void createStatement(JNIEnv* _pEnv) = 0;\n\n        virtual ~java_sql_Statement_Base();\n\n    public:\n        static jclass getMyClass();\n\n        \/\/ ein Konstruktor, der fuer das Returnen des Objektes benoetigt wird:\n        java_sql_Statement_Base( JNIEnv * pEnv, java_sql_Connection& _rCon );\n\n        sal_Int32   getStatementObjectID() const { return m_aLogger.getObjectID(); }\n\n        \/\/ OComponentHelper\n        virtual void SAL_CALL disposing(void);\n        \/\/ XInterface\n        virtual void SAL_CALL acquire() throw();\n        virtual void SAL_CALL release() throw();\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\n        \/\/ XPropertySet\n        virtual ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySetInfo > SAL_CALL getPropertySetInfo(  ) throw(::com::sun::star::uno::RuntimeException);\n        \/\/ XStatement\n        virtual ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XResultSet > SAL_CALL executeQuery( const ::rtl::OUString& sql ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException) ;\n        virtual sal_Int32 SAL_CALL executeUpdate( const ::rtl::OUString& sql ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException) ;\n        virtual sal_Bool SAL_CALL execute( const ::rtl::OUString& sql ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException) ;\n        virtual ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection > SAL_CALL getConnection(  ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException) ;\n        \/\/ XWarningsSupplier\n        virtual ::com::sun::star::uno::Any SAL_CALL getWarnings(  ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        virtual void SAL_CALL clearWarnings(  ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        \/\/ XCancellable\n        virtual void SAL_CALL cancel(  ) throw(::com::sun::star::uno::RuntimeException);\n        \/\/ XCloseable\n        virtual void SAL_CALL close(  ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        \/\/ XMultipleResults\n        virtual ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XResultSet > SAL_CALL getResultSet(  ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        virtual sal_Int32 SAL_CALL getUpdateCount(  ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        virtual sal_Bool SAL_CALL getMoreResults(  ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        \/\/XGeneratedResultSet\n        virtual ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XResultSet > SAL_CALL getGeneratedValues(  ) throw (::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n\n    public:\n        using ::cppu::OPropertySetHelper::getFastPropertyValue;\n    };\n\n    class OStatement_BASE2  :public java_sql_Statement_Base\n                            ,public OSubComponent<OStatement_BASE2, java_sql_Statement_BASE>\n\n    {\n        friend class OSubComponent<OStatement_BASE2, java_sql_Statement_BASE>;\n    public:\n        OStatement_BASE2(JNIEnv * pEnv, java_sql_Connection& _rCon ) : java_sql_Statement_Base( pEnv, _rCon ),\n                                OSubComponent<OStatement_BASE2, java_sql_Statement_BASE>((::cppu::OWeakObject*)(&_rCon), this){}\n\n        \/\/ OComponentHelper\n        virtual void SAL_CALL disposing(void);\n        \/\/ XInterface\n        virtual void SAL_CALL release() throw();\n    };\n\n    class java_sql_Statement :  public OStatement_BASE2,\n                                public ::com::sun::star::sdbc::XBatchExecution,\n                                public ::com::sun::star::lang::XServiceInfo\n    {\n    protected:\n        \/\/ statische Daten fuer die Klasse\n        static jclass theClass;\n        \/\/ der Destruktor um den Object-Counter zu aktualisieren\n        static void saveClassRef( jclass pClass );\n\n        virtual void createStatement(JNIEnv* _pEnv);\n\n        virtual ~java_sql_Statement();\n    public:\n        DECLARE_SERVICE_INFO();\n        static jclass getMyClass();\n\n        \/\/ ein Konstruktor, der fuer das Returnen des Objektes benoetigt wird:\n        java_sql_Statement( JNIEnv * pEnv, java_sql_Connection& _rCon ) : OStatement_BASE2( pEnv, _rCon){};\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        virtual void SAL_CALL acquire() throw();\n        virtual void SAL_CALL release() throw();\n        \/\/ XBatchExecution\n        virtual void SAL_CALL addBatch( const ::rtl::OUString& sql ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        virtual void SAL_CALL clearBatch(  ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        virtual ::com::sun::star::uno::Sequence< sal_Int32 > SAL_CALL executeBatch(  ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n    };\n}\n#endif \/\/ _CONNECTIVITY_JAVA_SQL_STATEMENT_HXX_\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 <jni.h>\n#include <vector>\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\/basictypes.h\"\n#include \"base\/lazy_instance.h\"\n#include \"base\/logging.h\"\n#include \"content\/browser\/android\/content_view_statics.h\"\n#include \"content\/common\/android\/address_parser.h\"\n#include \"content\/common\/view_messages.h\"\n#include \"content\/public\/browser\/render_process_host.h\"\n#include \"content\/public\/browser\/render_process_host_observer.h\"\n#include \"jni\/ContentViewStatics_jni.h\"\n\nusing base::android::ConvertJavaStringToUTF16;\nusing base::android::ConvertUTF16ToJavaString;\n\nnamespace {\n\n\/\/ TODO(pliard): http:\/\/crbug.com\/235909. Move WebKit shared timer toggling\n\/\/ functionality out of ContentViewStatistics and not be build on top of\n\/\/ blink::Platform::SuspendSharedTimer.\n\/\/ TODO(pliard): http:\/\/crbug.com\/235912. Add unit tests for WebKit shared timer\n\/\/ toggling.\n\n\/\/ This tracks the renderer processes that received a suspend request. It's\n\/\/ important on resume to only resume the renderer processes that were actually\n\/\/ suspended as opposed to all the current renderer processes because the\n\/\/ suspend calls are refcounted within WebKitPlatformSupport and it expects a\n\/\/ perfectly matched number of resume calls.\n\/\/ Note that this class is only accessed from the UI thread.\nclass SuspendedProcessWatcher : public content::RenderProcessHostObserver {\n public:\n\n  \/\/ If the process crashes, stop watching the corresponding RenderProcessHost\n  \/\/ and ensure it doesn't get over-resumed.\n  virtual void RenderProcessExited(content::RenderProcessHost* host,\n                                   base::ProcessHandle handle,\n                                   base::TerminationStatus status,\n                                   int exit_code) OVERRIDE {\n    std::vector<int>::iterator pos = std::find(suspended_processes_.begin(),\n                                               suspended_processes_.end(),\n                                               host->GetID());\n    DCHECK_NE(pos, suspended_processes_.end());\n    host->RemoveObserver(this);\n    suspended_processes_.erase(pos);\n  }\n\n  \/\/ Suspends timers in all current render processes.\n  void SuspendWebKitSharedTimers() {\n    DCHECK(suspended_processes_.empty());\n\n    for (content::RenderProcessHost::iterator i(\n            content::RenderProcessHost::AllHostsIterator());\n         !i.IsAtEnd(); i.Advance()) {\n      content::RenderProcessHost* host = i.GetCurrentValue();\n      if (host->HasConnection()) {\n        host->AddObserver(this);\n        host->Send(new ViewMsg_SetWebKitSharedTimersSuspended(true));\n        suspended_processes_.push_back(host->GetID());\n      }\n    }\n  }\n\n  \/\/ Resumes timers in processes that were previously stopped.\n  void ResumeWebkitSharedTimers() {\n    for (std::vector<int>::const_iterator it = suspended_processes_.begin();\n         it != suspended_processes_.end(); ++it) {\n      content::RenderProcessHost* host =\n          content::RenderProcessHost::FromID(*it);\n      DCHECK(host);\n      host->RemoveObserver(this);\n      host->Send(new ViewMsg_SetWebKitSharedTimersSuspended(false));\n    }\n    suspended_processes_.clear();\n  }\n\n private:\n  std::vector<int \/* RenderProcessHost id *\/> suspended_processes_;\n};\n\nbase::LazyInstance<SuspendedProcessWatcher> g_suspended_processes_watcher =\n    LAZY_INSTANCE_INITIALIZER;\n\n}  \/\/ namespace\n\n\/\/ Returns the first substring consisting of the address of a physical location.\nstatic jstring FindAddress(JNIEnv* env, jclass clazz, jstring addr) {\n  base::string16 content_16 = ConvertJavaStringToUTF16(env, addr);\n  base::string16 result_16;\n  if (content::address_parser::FindAddress(content_16, &result_16))\n    return ConvertUTF16ToJavaString(env, result_16).Release();\n  return NULL;\n}\n\nstatic void SetWebKitSharedTimersSuspended(JNIEnv* env,\n                                           jclass obj,\n                                           jboolean suspend) {\n  if (suspend) {\n    g_suspended_processes_watcher.Pointer()->SuspendWebKitSharedTimers();\n  } else {\n    g_suspended_processes_watcher.Pointer()->ResumeWebkitSharedTimers();\n  }\n}\n\nnamespace content {\n\nbool RegisterWebViewStatics(JNIEnv* env) {\n  return RegisterNativesImpl(env);\n}\n\n}  \/\/ namespace content\n<commit_msg>Fix crash introduced in https:\/\/codereview.chromium.org\/179123002\/<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 <jni.h>\n#include <vector>\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\/basictypes.h\"\n#include \"base\/lazy_instance.h\"\n#include \"base\/logging.h\"\n#include \"content\/browser\/android\/content_view_statics.h\"\n#include \"content\/common\/android\/address_parser.h\"\n#include \"content\/common\/view_messages.h\"\n#include \"content\/public\/browser\/render_process_host.h\"\n#include \"content\/public\/browser\/render_process_host_observer.h\"\n#include \"jni\/ContentViewStatics_jni.h\"\n\nusing base::android::ConvertJavaStringToUTF16;\nusing base::android::ConvertUTF16ToJavaString;\n\nnamespace {\n\n\/\/ TODO(pliard): http:\/\/crbug.com\/235909. Move WebKit shared timer toggling\n\/\/ functionality out of ContentViewStatistics and not be build on top of\n\/\/ blink::Platform::SuspendSharedTimer.\n\/\/ TODO(pliard): http:\/\/crbug.com\/235912. Add unit tests for WebKit shared timer\n\/\/ toggling.\n\n\/\/ This tracks the renderer processes that received a suspend request. It's\n\/\/ important on resume to only resume the renderer processes that were actually\n\/\/ suspended as opposed to all the current renderer processes because the\n\/\/ suspend calls are refcounted within WebKitPlatformSupport and it expects a\n\/\/ perfectly matched number of resume calls.\n\/\/ Note that this class is only accessed from the UI thread.\nclass SuspendedProcessWatcher : public content::RenderProcessHostObserver {\n public:\n\n  \/\/ If the process crashes, stop watching the corresponding RenderProcessHost\n  \/\/ and ensure it doesn't get over-resumed.\n  virtual void RenderProcessExited(content::RenderProcessHost* host,\n                                   base::ProcessHandle handle,\n                                   base::TerminationStatus status,\n                                   int exit_code) OVERRIDE {\n    StopWatching(host);\n  }\n\n  virtual void RenderProcessHostDestroyed(\n      content::RenderProcessHost* host) OVERRIDE {\n    StopWatching(host);\n  }\n\n  \/\/ Suspends timers in all current render processes.\n  void SuspendWebKitSharedTimers() {\n    DCHECK(suspended_processes_.empty());\n\n    for (content::RenderProcessHost::iterator i(\n            content::RenderProcessHost::AllHostsIterator());\n         !i.IsAtEnd(); i.Advance()) {\n      content::RenderProcessHost* host = i.GetCurrentValue();\n      if (host->HasConnection()) {\n        host->AddObserver(this);\n        host->Send(new ViewMsg_SetWebKitSharedTimersSuspended(true));\n        suspended_processes_.push_back(host->GetID());\n      }\n    }\n  }\n\n  \/\/ Resumes timers in processes that were previously stopped.\n  void ResumeWebkitSharedTimers() {\n    for (std::vector<int>::const_iterator it = suspended_processes_.begin();\n         it != suspended_processes_.end(); ++it) {\n      content::RenderProcessHost* host =\n          content::RenderProcessHost::FromID(*it);\n      DCHECK(host);\n      host->RemoveObserver(this);\n      host->Send(new ViewMsg_SetWebKitSharedTimersSuspended(false));\n    }\n    suspended_processes_.clear();\n  }\n\n private:\n  void StopWatching(content::RenderProcessHost* host) {\n    std::vector<int>::iterator pos = std::find(suspended_processes_.begin(),\n                                               suspended_processes_.end(),\n                                               host->GetID());\n    DCHECK_NE(pos, suspended_processes_.end());\n    host->RemoveObserver(this);\n    suspended_processes_.erase(pos);\n  }\n\n  std::vector<int \/* RenderProcessHost id *\/> suspended_processes_;\n};\n\nbase::LazyInstance<SuspendedProcessWatcher> g_suspended_processes_watcher =\n    LAZY_INSTANCE_INITIALIZER;\n\n}  \/\/ namespace\n\n\/\/ Returns the first substring consisting of the address of a physical location.\nstatic jstring FindAddress(JNIEnv* env, jclass clazz, jstring addr) {\n  base::string16 content_16 = ConvertJavaStringToUTF16(env, addr);\n  base::string16 result_16;\n  if (content::address_parser::FindAddress(content_16, &result_16))\n    return ConvertUTF16ToJavaString(env, result_16).Release();\n  return NULL;\n}\n\nstatic void SetWebKitSharedTimersSuspended(JNIEnv* env,\n                                           jclass obj,\n                                           jboolean suspend) {\n  if (suspend) {\n    g_suspended_processes_watcher.Pointer()->SuspendWebKitSharedTimers();\n  } else {\n    g_suspended_processes_watcher.Pointer()->ResumeWebkitSharedTimers();\n  }\n}\n\nnamespace content {\n\nbool RegisterWebViewStatics(JNIEnv* env) {\n  return RegisterNativesImpl(env);\n}\n\n}  \/\/ namespace content\n<|endoftext|>"}
{"text":"<commit_before>#include \"kernel.h\"\n#include \"raster.h\"\n#include \"connectorinterface.h\"\n#include \"ilwisoperation.h\"\n\nusing namespace Ilwis;\n\nOperationHelper::OperationHelper()\n{\n}\n\nBox3D<qint32> OperationHelper::initialize(const IGridCoverage &inputGC, IGridCoverage &outputGC, const Parameter& parm, quint64 what)\n{\n    Resource resource(itGRIDCOVERAGE);\n    Size sz = inputGC->size();\n    Box3D<qint32> box(sz);\n\n    if ( what & itGRIDSIZE) {\n        QString range = parm.modifier(\"range\");\n        if (range != sUNDEF) {\n            box = Box3D<qint32>(range);\n            if ( box.zlength() == 0) {\n                box.max_corner().z(box.min_corner().z() + 1);\n            }\n        }\n        resource.addProperty(\"size\", IVARIANT(box.size()));\n    }\n    if ( what & itENVELOPE) {\n        if ( box.isNull() || !box.isValid()) {\n            sz = inputGC->size();\n            box  = Box3D<qint32>(sz);\n        }\n        Box2D<double> bounds = inputGC->georeference()->pixel2Coord(box);\n        resource.addProperty(\"envelope\", IVARIANT(bounds));\n    }\n    if ( what & itCOORDSYSTEM) {\n        resource.addProperty(\"coordinatesystem\", IVARIANT(inputGC->coordinateSystem()));\n    }\n    if ( what & itGEOREF) {\n        if ( box.isNull() || !box.isValid()) {\n            sz = inputGC->size();\n            box  = Box3D<qint32>(sz);\n        }\n        if ( sz.xsize() == box.xlength() && sz.ysize() == box.ylength())\n            resource.addProperty(\"georeference\", IVARIANT(inputGC->georeference()));\n    }\n    if ( what & itDOMAIN) {\n        resource.addProperty(\"domain\", IVARIANT(inputGC->datadef().domain()));\n    }\n    resource.prepare();\n\n    outputGC.prepare(resource);\n   \/\/mastercatalog()->addItems({resource});\n\n    return box;\n}\n\nint OperationHelper::subdivideTasks(const IGridCoverage& gcov, const Box3D<qint32> &bnds, std::vector<Box3D<qint32> > &boxes)\n{\n    if ( !gcov.isValid() || gcov->size().isNull() || gcov->size().ysize() == 0) {\n        return ERROR1(ERR_NO_INITIALIZED_1, \"Grid size\");\n        return iUNDEF;\n    }\n\n    int cores = std::min(QThread::idealThreadCount(),gcov->size().ysize());\n    if (gcov->size().totalSize() < 10000)\n        cores = 1;\n\n    boxes.clear();\n    boxes.resize(cores);\n    Box3D<qint32> bounds = bnds;\n    if ( bounds.isNull())\n        bounds = Box3D<qint32>(gcov->size());\n    int left = 0; \/\/bounds.min_corner().x();\n    int right = bounds.size().xsize();\n    int top = bounds.size().ysize();\n    int step = bounds.size().ysize() \/ cores;\n    int currentY = 0;\n\n    for(int i=0 ; i < cores; ++i){\n        Box3D<qint32> smallBox(Pixel(left, currentY), Pixel(right, std::min(top,currentY + step)) );\n        boxes[i] = smallBox;\n        currentY = currentY + step + 1 ;\n    }\n    return cores;\n}\n\n<commit_msg>attribute tables can be added; correct calculation of sub boxes with multi cores<commit_after>#include \"kernel.h\"\n#include \"raster.h\"\n#include \"connectorinterface.h\"\n#include \"ilwisoperation.h\"\n\nusing namespace Ilwis;\n\nOperationHelper::OperationHelper()\n{\n}\n\nBox3D<qint32> OperationHelper::initialize(const IGridCoverage &inputGC, IGridCoverage &outputGC, const Parameter& parm, quint64 what)\n{\n    Resource resource(itGRIDCOVERAGE);\n    Size sz = inputGC->size();\n    Box3D<qint32> box(sz);\n\n    if ( what & itGRIDSIZE) {\n        QString range = parm.modifier(\"range\");\n        if (range != sUNDEF) {\n            box = Box3D<qint32>(range);\n            if ( box.zlength() == 0) {\n                box.max_corner().z(box.min_corner().z() + 1);\n            }\n        }\n        resource.addProperty(\"size\", IVARIANT(box.size()));\n    }\n    if ( what & itENVELOPE) {\n        if ( box.isNull() || !box.isValid()) {\n            sz = inputGC->size();\n            box  = Box3D<qint32>(sz);\n        }\n        Box2D<double> bounds = inputGC->georeference()->pixel2Coord(box);\n        resource.addProperty(\"envelope\", IVARIANT(bounds));\n    }\n    if ( what & itCOORDSYSTEM) {\n        resource.addProperty(\"coordinatesystem\", IVARIANT(inputGC->coordinateSystem()));\n    }\n\n    if ( what & itGEOREF) {\n        if ( box.isNull() || !box.isValid()) {\n            sz = inputGC->size();\n            box  = Box3D<qint32>(sz);\n        }\n        if ( sz.xsize() == box.xlength() && sz.ysize() == box.ylength())\n            resource.addProperty(\"georeference\", IVARIANT(inputGC->georeference()));\n    }\n    if ( what & itDOMAIN) {\n        resource.addProperty(\"domain\", IVARIANT(inputGC->datadef().domain()));\n    }\n    resource.prepare();\n\n    outputGC.prepare(resource);\n    if ( what & itTABLE) {\n        if ( inputGC->attributeTable(itGRIDCOVERAGE).isValid())    {\n            if ( inputGC->datadef().domain() == outputGC->datadef().domain()) {\n                if ( outputGC.isValid())\n                    outputGC->attributeTable(itGRIDCOVERAGE,inputGC->attributeTable(itGRIDCOVERAGE));\n            }\n        }\n    }\n\n    return box;\n}\n\nint OperationHelper::subdivideTasks(const IGridCoverage& gcov, const Box3D<qint32> &bnds, std::vector<Box3D<qint32> > &boxes)\n{\n    if ( !gcov.isValid() || gcov->size().isNull() || gcov->size().ysize() == 0) {\n        return ERROR1(ERR_NO_INITIALIZED_1, \"Grid size\");\n        return iUNDEF;\n    }\n\n    int cores = std::min(QThread::idealThreadCount(),gcov->size().ysize());\n    \/\/if (gcov->size().totalSize() < 10000)\n        cores = 1;\n\n    boxes.clear();\n    boxes.resize(cores);\n    Box3D<qint32> bounds = bnds;\n    if ( bounds.isNull())\n        bounds = Box3D<qint32>(gcov->size());\n    int left = 0; \/\/bounds.min_corner().x();\n    int right = bounds.size().xsize();\n    int top = bounds.size().ysize();\n    int step = bounds.size().ysize() \/ cores;\n    int currentY = 0;\n\n    for(int i=0 ; i < cores; ++i){\n        Box3D<qint32> smallBox(Pixel(left, currentY), Pixel(right - 1, std::min(top - 1,currentY + step)) );\n        boxes[i] = smallBox;\n        currentY = currentY + step  ;\n    }\n    return cores;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"apiserver\/ApiServer.h\"\n#include \"world\/World.h\"\n\nvoid Susi::Api::ApiServer::onConnect(std::string & id) {\n\tstd::cout<<\"got new connection!\"<<std::endl;\n\tworld.sessionManager->updateSession(id);\n}\nvoid Susi::Api::ApiServer::onClose(std::string & id) {\n\tstd::cout<<\"lost connection...\"<<std::endl;\n\tworld.sessionManager->killSession(id);\n\tsenders.erase(id);\n\teventsToAck.erase(id);\n\n\tauto & subs = consumerSubscriptions[id];\n\tfor(auto & kv : subs) {\n\t\tSusi::Events::unsubscribe(kv.second);\n\t}\n\tconsumerSubscriptions.erase(id);\n\tauto & subs2 = processorSubscriptions[id];\n\tfor(auto & kv : subs2) {\n\t\tSusi::Events::unsubscribe(kv.second);\n\t}\n\tprocessorSubscriptions.erase(id);\n}\n\t\nvoid Susi::Api::ApiServer::onMessage(std::string & id, Susi::Util::Any & packet) {\n\ttry{\n\t\tstd::cout<<\"onMessage:\"<<packet.toString()<<std::endl;\n\t\tauto & type = packet[\"type\"];\n\t\tif(type.isString()){\n\t\t\tif(type==\"registerConsumer\"){\n\t\t\t\thandleRegisterConsumer(id,packet);\n\t\t\t}else if(type==\"registerProcessor\"){\n\t\t\t\thandleRegisterProcessor(id,packet);\n\t\t\t}else if(type==\"unregisterConsumer\"){\n\t\t\t\thandleUnregisterConsumer(id,packet);\n\t\t\t}else if(type==\"unregisterProcessor\"){\n\t\t\t\thandleUnregisterProcessor(id,packet);\n\t\t\t}else if(type==\"publish\"){\n\t\t\t\thandlePublish(id,packet);\n\t\t\t}else if(type==\"ack\"){\n\t\t\t\thandleAck(id,packet);\n\t\t\t}else {\n\t\t\t\tsendFail(id,\"type not known\");\n\t\t\t}\n\t\t}else{\n\t\t\tsendFail(id,\"type is not a string\");\n\t\t}\n\t}catch(const std::exception & e){\n\t\tstd::string msg = \"exception while processing: \";\n\t\tmsg += e.what();\n\t\tsendFail(id,msg);\n\t}\n}\n\nvoid Susi::Api::ApiServer::handleRegisterConsumer(std::string & id, Susi::Util::Any & packet){\n\tauto & data = packet[\"data\"];\n\n\tstd::cout<<\"handleRegisterConsumer:\"<<data.toString()<<std::endl;\n\tif(data.isString()){\n\t\tstd::string topic = data;\n\t\tauto & subs = consumerSubscriptions[id];\n\t\tif(subs.find(topic) != subs.end()){\n\t\t\tsendFail(id,\"you are allready subscribed to \"+topic);\n\t\t\treturn;\n\t\t}\n\t\tSusi::Events::Consumer callback = [this,id](Susi::Events::SharedEventPtr event){\n\t\t\tSusi::Util::Any::Array headers;\n\t\t\tfor(auto & kv : event->headers){\n\t\t\t\theaders.push_back(Susi::Util::Any::Object{{kv.first,kv.second}});\n\t\t\t}\n\t\t\tSusi::Util::Any packet;\n\t\t\tpacket[\"type\"] = \"consumerEvent\";\n\t\t\tpacket[\"data\"] = Susi::Util::Any::Object{\n\t\t\t\t{\"id\",event->id},\n\t\t\t\t{\"topic\",event->topic},\n\t\t\t\t{\"headers\",headers},\n\t\t\t\t{\"payload\",event->payload},\n\t\t\t\t{\"sessionid\",event->sessionID}\n\t\t\t};\n\t\t\tstd::string _id = id;\n\t\t\t\/\/std::cout<<\"got consumer event, try to send it \"+packet.toString()<<std::endl;\n\t\t\tsend(_id,packet);\n\t\t};\n\t\tlong subid = Susi::Events::subscribe(topic,callback);\n\t\tsubs[topic] = subid;\n\t\tsendOk(id);\n\t}else{\n\t\tstd::cout<<\"handleRegisterConsumer-> data is not a string:\"<<std::endl;\n\t\tsendFail(id,\"data is not a string\");\n\t}\n}\nvoid Susi::Api::ApiServer::handleRegisterProcessor(std::string & id, Susi::Util::Any & packet){\n\tauto & data = packet[\"data\"];\n\tif(data.isString()){\n\t\tstd::string topic = data;\n\t\tauto & subs = processorSubscriptions[id];\n\t\tif(subs.find(topic) != subs.end()){\n\t\t\tsendFail(id,\"you are allready subscribed to \"+topic);\n\t\t\treturn;\n\t\t}\n\t\tlong subid = Susi::Events::subscribe(topic,[this,id](Susi::Events::EventPtr event){\n\t\t\tSusi::Util::Any::Array headers;\n\t\t\tfor(auto & kv : event->headers){\n\t\t\t\theaders.push_back(Susi::Util::Any::Object{{kv.first,kv.second}});\n\t\t\t}\n\t\t\tSusi::Util::Any packet;\n\t\t\tpacket[\"type\"] = \"processorEvent\";\n\t\t\tpacket[\"data\"] = Susi::Util::Any::Object{\n\t\t\t\t{\"id\",event->id},\n\t\t\t\t{\"topic\",event->topic},\n\t\t\t\t{\"headers\",headers},\n\t\t\t\t{\"payload\",event->payload},\n\t\t\t\t{\"sessionid\",event->sessionID}\n\t\t\t};\n\t\t\tstd::string _id = id;\n\t\t\teventsToAck[_id][event->id] = std::move(event);\n\t\t\tsend(_id,packet);\n\t\t});\n\t\tsubs[topic] = subid;\n\t\tsendOk(id);\n\t}else{\n\t\tsendFail(id,\"data is not a string\");\n\t}\n}\nvoid Susi::Api::ApiServer::handleUnregisterConsumer(std::string & id, Susi::Util::Any & packet){\n\tauto & data = packet[\"data\"];\n\tif(data.isString()){\n\t\tstd::string topic = data;\n\t\tauto & subs = consumerSubscriptions[id];\n\t\tif(subs.find(topic)!=subs.end()){\n\t\t\tlong subid = subs[topic];\n\t\t\tSusi::Events::unsubscribe(subid);\n\t\t\tsendOk(id);\n\t\t}else{\n\t\t\tsendFail(id,\"you are not registered for \"+topic);\n\t\t}\n\t}else{\n\t\tsendFail(id,\"data is not a string\");\n\t}\n}\n\nvoid Susi::Api::ApiServer::handleUnregisterProcessor(std::string & id, Susi::Util::Any & packet){\n\tauto & data = packet[\"data\"];\n\tif(data.isString()){\n\t\tstd::string topic = data;\n\t\tauto & subs = processorSubscriptions[id];\n\t\tif(subs.find(topic)!=subs.end()){\n\t\t\tlong subid = subs[topic];\n\t\t\tSusi::Events::unsubscribe(subid);\n\t\t\tsendOk(id);\n\t\t}else{\n\t\t\tsendFail(id,\"you are not registered for \"+topic);\n\t\t}\n\t}else{\n\t\tsendFail(id,\"data is not a string\");\n\t}\n}\nvoid Susi::Api::ApiServer::handlePublish(std::string & id, Susi::Util::Any & packet){\n\tstd::cout<<\"got publish!\"<<std::endl;\n\tauto & eventData = packet[\"data\"];\n\tif(!eventData.isObject() || !eventData[\"topic\"].isString()){\n\t\tsendFail(id,\"data is not an object or topic is not set correctly\");\n\t\treturn;\n\t}\n\tauto event = Susi::Events::createEvent(eventData[\"topic\"]);\n\tevent->sessionID = id;\n\tauto eventID = eventData[\"id\"];\n\tif(eventID.isNull()){\n\t\teventID = std::chrono::system_clock::now().time_since_epoch().count();\n\t}\n\tevent->id = eventID;\n\tif(eventData[\"headers\"].isArray()){\n\t\tSusi::Util::Any::Array arr = eventData[\"headers\"];\n\t\tfor(Susi::Util::Any::Object & val : arr){\n\t\t\tfor(auto & kv : val){\n\t\t\t\tevent->headers.push_back(std::make_pair(kv.first,(std::string)kv.second));\n\t\t\t}\n\t\t}\n\t}\n\tif(!eventData[\"payload\"].isNull()){\n\t\tevent->payload = eventData[\"payload\"];\n\t}\n\tSusi::Events::publish(std::move(event),[this,id](Susi::Events::SharedEventPtr event){\n\t\tSusi::Util::Any::Array headers;\n\t\tfor(auto & kv : event->headers){\n\t\t\theaders.push_back(Susi::Util::Any::Object{{kv.first,kv.second}});\n\t\t}\n\t\tSusi::Util::Any packet;\n\t\tpacket[\"type\"] = \"ack\";\n\t\tpacket[\"data\"] = Susi::Util::Any::Object{\n\t\t\t{\"id\",event->id},\n\t\t\t{\"topic\",event->topic},\n\t\t\t{\"headers\",headers},\n\t\t\t{\"payload\",event->payload},\n\t\t\t{\"sessionid\",event->sessionID}\n\t\t};\n\t\tstd::string _id = id;\n\t\tsend(_id,packet);\n\t});\n\tsendOk(id);\n}\n\nvoid Susi::Api::ApiServer::handleAck(std::string & id, Susi::Util::Any & packet){\n\n\tstd::cout<<\"handleAck:\"<<packet.toString()<<std::endl;\n\t\n\tauto & eventData = packet[\"data\"];\n\tif(!eventData.isObject() || !eventData[\"topic\"].isString()){\n\t\tsendFail(id,\"data is not an object or topic is not set correctly\");\n\t\treturn;\n\t}\n\tlong eventID = eventData[\"id\"];\n\tauto event = std::move(eventsToAck[id][eventID]);\n\teventsToAck[id].erase(eventID);\n\tevent->headers.clear();\n\tevent->id = eventID;\n\tif(eventData[\"headers\"].isArray()){\n\t\tSusi::Util::Any::Array arr = eventData[\"headers\"];\n\t\tfor(Susi::Util::Any::Object & val : arr){\n\t\t\tfor(auto & kv : val){\n\t\t\t\tevent->headers.push_back(std::make_pair(kv.first,(std::string)kv.second));\n\t\t\t}\n\t\t}\n\t}\n\tif(!eventData[\"payload\"].isNull()){\n\t\tevent->payload = eventData[\"payload\"];\n\t}\n\tSusi::Events::ack(std::move(event));\n\tsendOk(id);\n}\n\nvoid Susi::Api::ApiServer::sendOk(std::string & id){\n\tSusi::Util::Any response;\n\tresponse[\"type\"] = \"status\";\n\tresponse[\"error\"] = false;\n\tsend(id,response);\n}\n\nvoid Susi::Api::ApiServer::sendFail(std::string & id,std::string error){\n\tSusi::Util::Any response;\n\tresponse[\"type\"] = \"status\";\n\tresponse[\"error\"] = true;\n\tresponse[\"data\"] = error;\n\tsend(id,response);\t\n}<commit_msg>[ApiServer] removed some couts;<commit_after>#include \"apiserver\/ApiServer.h\"\n#include \"world\/World.h\"\n\nvoid Susi::Api::ApiServer::onConnect(std::string & id) {\n\tstd::cout<<\"got new connection!\"<<std::endl;\n\tworld.sessionManager->updateSession(id);\n}\nvoid Susi::Api::ApiServer::onClose(std::string & id) {\n\tstd::cout<<\"lost connection...\"<<std::endl;\n\tworld.sessionManager->killSession(id);\n\tsenders.erase(id);\n\teventsToAck.erase(id);\n\n\tauto & subs = consumerSubscriptions[id];\n\tfor(auto & kv : subs) {\n\t\tSusi::Events::unsubscribe(kv.second);\n\t}\n\tconsumerSubscriptions.erase(id);\n\tauto & subs2 = processorSubscriptions[id];\n\tfor(auto & kv : subs2) {\n\t\tSusi::Events::unsubscribe(kv.second);\n\t}\n\tprocessorSubscriptions.erase(id);\n}\n\t\nvoid Susi::Api::ApiServer::onMessage(std::string & id, Susi::Util::Any & packet) {\n\ttry{\n\t\tstd::cout<<\"onMessage:\"<<packet.toString()<<std::endl;\n\t\tauto & type = packet[\"type\"];\n\t\tif(type.isString()){\n\t\t\tif(type==\"registerConsumer\"){\n\t\t\t\thandleRegisterConsumer(id,packet);\n\t\t\t}else if(type==\"registerProcessor\"){\n\t\t\t\thandleRegisterProcessor(id,packet);\n\t\t\t}else if(type==\"unregisterConsumer\"){\n\t\t\t\thandleUnregisterConsumer(id,packet);\n\t\t\t}else if(type==\"unregisterProcessor\"){\n\t\t\t\thandleUnregisterProcessor(id,packet);\n\t\t\t}else if(type==\"publish\"){\n\t\t\t\thandlePublish(id,packet);\n\t\t\t}else if(type==\"ack\"){\n\t\t\t\thandleAck(id,packet);\n\t\t\t}else {\n\t\t\t\tsendFail(id,\"type not known\");\n\t\t\t}\n\t\t}else{\n\t\t\tsendFail(id,\"type is not a string\");\n\t\t}\n\t}catch(const std::exception & e){\n\t\tstd::string msg = \"exception while processing: \";\n\t\tmsg += e.what();\n\t\tsendFail(id,msg);\n\t}\n}\n\nvoid Susi::Api::ApiServer::handleRegisterConsumer(std::string & id, Susi::Util::Any & packet){\n\tauto & data = packet[\"data\"];\n\n\tif(data.isString()){\n\t\tstd::string topic = data;\n\t\tauto & subs = consumerSubscriptions[id];\n\t\tif(subs.find(topic) != subs.end()){\n\t\t\tsendFail(id,\"you are allready subscribed to \"+topic);\n\t\t\treturn;\n\t\t}\n\t\tSusi::Events::Consumer callback = [this,id](Susi::Events::SharedEventPtr event){\n\t\t\tSusi::Util::Any::Array headers;\n\t\t\tfor(auto & kv : event->headers){\n\t\t\t\theaders.push_back(Susi::Util::Any::Object{{kv.first,kv.second}});\n\t\t\t}\n\t\t\tSusi::Util::Any packet;\n\t\t\tpacket[\"type\"] = \"consumerEvent\";\n\t\t\tpacket[\"data\"] = Susi::Util::Any::Object{\n\t\t\t\t{\"id\",event->id},\n\t\t\t\t{\"topic\",event->topic},\n\t\t\t\t{\"headers\",headers},\n\t\t\t\t{\"payload\",event->payload},\n\t\t\t\t{\"sessionid\",event->sessionID}\n\t\t\t};\n\t\t\tstd::string _id = id;\n\t\t\t\/\/std::cout<<\"got consumer event, try to send it \"+packet.toString()<<std::endl;\n\t\t\tsend(_id,packet);\n\t\t};\n\t\tlong subid = Susi::Events::subscribe(topic,callback);\n\t\tsubs[topic] = subid;\n\t\tsendOk(id);\n\t}else{\n\t\tstd::cout<<\"handleRegisterConsumer-> data is not a string:\"<<std::endl;\n\t\tsendFail(id,\"data is not a string\");\n\t}\n}\nvoid Susi::Api::ApiServer::handleRegisterProcessor(std::string & id, Susi::Util::Any & packet){\n\tauto & data = packet[\"data\"];\n\tif(data.isString()){\n\t\tstd::string topic = data;\n\t\tauto & subs = processorSubscriptions[id];\n\t\tif(subs.find(topic) != subs.end()){\n\t\t\tsendFail(id,\"you are allready subscribed to \"+topic);\n\t\t\treturn;\n\t\t}\n\t\tlong subid = Susi::Events::subscribe(topic,[this,id](Susi::Events::EventPtr event){\n\t\t\tSusi::Util::Any::Array headers;\n\t\t\tfor(auto & kv : event->headers){\n\t\t\t\theaders.push_back(Susi::Util::Any::Object{{kv.first,kv.second}});\n\t\t\t}\n\t\t\tSusi::Util::Any packet;\n\t\t\tpacket[\"type\"] = \"processorEvent\";\n\t\t\tpacket[\"data\"] = Susi::Util::Any::Object{\n\t\t\t\t{\"id\",event->id},\n\t\t\t\t{\"topic\",event->topic},\n\t\t\t\t{\"headers\",headers},\n\t\t\t\t{\"payload\",event->payload},\n\t\t\t\t{\"sessionid\",event->sessionID}\n\t\t\t};\n\t\t\tstd::string _id = id;\n\t\t\teventsToAck[_id][event->id] = std::move(event);\n\t\t\tsend(_id,packet);\n\t\t});\n\t\tsubs[topic] = subid;\n\t\tsendOk(id);\n\t}else{\n\t\tsendFail(id,\"data is not a string\");\n\t}\n}\nvoid Susi::Api::ApiServer::handleUnregisterConsumer(std::string & id, Susi::Util::Any & packet){\n\tauto & data = packet[\"data\"];\n\tif(data.isString()){\n\t\tstd::string topic = data;\n\t\tauto & subs = consumerSubscriptions[id];\n\t\tif(subs.find(topic)!=subs.end()){\n\t\t\tlong subid = subs[topic];\n\t\t\tSusi::Events::unsubscribe(subid);\n\t\t\tsendOk(id);\n\t\t}else{\n\t\t\tsendFail(id,\"you are not registered for \"+topic);\n\t\t}\n\t}else{\n\t\tsendFail(id,\"data is not a string\");\n\t}\n}\n\nvoid Susi::Api::ApiServer::handleUnregisterProcessor(std::string & id, Susi::Util::Any & packet){\n\tauto & data = packet[\"data\"];\n\tif(data.isString()){\n\t\tstd::string topic = data;\n\t\tauto & subs = processorSubscriptions[id];\n\t\tif(subs.find(topic)!=subs.end()){\n\t\t\tlong subid = subs[topic];\n\t\t\tSusi::Events::unsubscribe(subid);\n\t\t\tsendOk(id);\n\t\t}else{\n\t\t\tsendFail(id,\"you are not registered for \"+topic);\n\t\t}\n\t}else{\n\t\tsendFail(id,\"data is not a string\");\n\t}\n}\nvoid Susi::Api::ApiServer::handlePublish(std::string & id, Susi::Util::Any & packet){\n\tauto & eventData = packet[\"data\"];\n\tif(!eventData.isObject() || !eventData[\"topic\"].isString()){\n\t\tsendFail(id,\"data is not an object or topic is not set correctly\");\n\t\treturn;\n\t}\n\tauto event = Susi::Events::createEvent(eventData[\"topic\"]);\n\tevent->sessionID = id;\n\tauto eventID = eventData[\"id\"];\n\tif(eventID.isNull()){\t\t\t\t\n\t\teventID = std::chrono::system_clock::now().time_since_epoch().count();\n\t}\n\t\n\tevent->id = eventID;\n\t\n\tif(eventData[\"headers\"].isArray()){\n\t\tSusi::Util::Any::Array arr = eventData[\"headers\"];\n\t\tfor(Susi::Util::Any::Object & val : arr){\n\t\t\tfor(auto & kv : val){\n\t\t\t\tevent->headers.push_back(std::make_pair(kv.first,(std::string)kv.second));\n\t\t\t}\n\t\t}\n\t}\n\tif(!eventData[\"payload\"].isNull()){\n\t\tevent->payload = eventData[\"payload\"];\n\t}\n\n\tSusi::Events::publish(std::move(event),[this,id](Susi::Events::SharedEventPtr event){\n\t\tSusi::Util::Any::Array headers;\n\t\tfor(auto & kv : event->headers){\n\t\t\theaders.push_back(Susi::Util::Any::Object{{kv.first,kv.second}});\n\t\t}\n\t\tSusi::Util::Any packet;\n\t\tpacket[\"type\"] = \"ack\";\n\t\tpacket[\"data\"] = Susi::Util::Any::Object{\n\t\t\t{\"id\",event->id},\n\t\t\t{\"topic\",event->topic},\n\t\t\t{\"headers\",headers},\n\t\t\t{\"payload\",event->payload},\n\t\t\t{\"sessionid\",event->sessionID}\n\t\t};\n\t\tstd::string _id = id;\n\t\tsend(_id,packet);\n\t});\n\n\tsendOk(id);\n}\n\nvoid Susi::Api::ApiServer::handleAck(std::string & id, Susi::Util::Any & packet){\t\n\tauto & eventData = packet[\"data\"];\n\tif(!eventData.isObject() || !eventData[\"topic\"].isString()){\n\t\tsendFail(id,\"data is not an object or topic is not set correctly\");\n\t\treturn;\n\t}\n\tlong eventID = eventData[\"id\"];\n\tauto event = std::move(eventsToAck[id][eventID]);\n\teventsToAck[id].erase(eventID);\n\tevent->headers.clear();\n\tevent->id = eventID;\n\tif(eventData[\"headers\"].isArray()){\n\t\tSusi::Util::Any::Array arr = eventData[\"headers\"];\n\t\tfor(Susi::Util::Any::Object & val : arr){\n\t\t\tfor(auto & kv : val){\n\t\t\t\tevent->headers.push_back(std::make_pair(kv.first,(std::string)kv.second));\n\t\t\t}\n\t\t}\n\t}\n\tif(!eventData[\"payload\"].isNull()){\n\t\tevent->payload = eventData[\"payload\"];\n\t}\n\tSusi::Events::ack(std::move(event));\n\tsendOk(id);\n}\n\nvoid Susi::Api::ApiServer::sendOk(std::string & id){\n\tSusi::Util::Any response;\n\tresponse[\"type\"] = \"status\";\n\tresponse[\"error\"] = false;\n\tsend(id,response);\n}\n\nvoid Susi::Api::ApiServer::sendFail(std::string & id,std::string error){\n\tSusi::Util::Any response;\n\tresponse[\"type\"] = \"status\";\n\tresponse[\"error\"] = true;\n\tresponse[\"data\"] = error;\n\tsend(id,response);\t\n}<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: targetdragcontext.cxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 16: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_dtrans.hxx\"\n\n#ifndef _RTL_UNLOAD_H_\n#include <rtl\/unload.h>\n#endif\n\n#include \"targetdragcontext.hxx\"\n\nextern rtl_StandardModuleCount g_moduleCount;\nTargetDragContext::TargetDragContext( DropTarget* p)\n{\n    g_moduleCount.modCnt.acquire( &g_moduleCount.modCnt );\n    m_pDropTarget= p;\n    p->acquire();\n}\n\nTargetDragContext::~TargetDragContext()\n{\n    m_pDropTarget->release();\n    g_moduleCount.modCnt.release( &g_moduleCount.modCnt );\n}\n\nvoid SAL_CALL TargetDragContext::acceptDrag( sal_Int8 dragOperation )\n    throw( RuntimeException)\n{\n    m_pDropTarget->_acceptDrag( dragOperation, static_cast<XDropTargetDragContext*>( this) );\n\n}\nvoid SAL_CALL TargetDragContext::rejectDrag( )\n    throw( RuntimeException)\n{\n    m_pDropTarget->_rejectDrag( static_cast<XDropTargetDragContext*>( this) );\n}\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.7.62); FILE MERGED 2008\/04\/01 15:13:34 thb 1.7.62.2: #i85898# Stripping all external header guards 2008\/03\/31 13:08:59 rt 1.7.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: targetdragcontext.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_dtrans.hxx\"\n#include <rtl\/unload.h>\n\n#include \"targetdragcontext.hxx\"\n\nextern rtl_StandardModuleCount g_moduleCount;\nTargetDragContext::TargetDragContext( DropTarget* p)\n{\n    g_moduleCount.modCnt.acquire( &g_moduleCount.modCnt );\n    m_pDropTarget= p;\n    p->acquire();\n}\n\nTargetDragContext::~TargetDragContext()\n{\n    m_pDropTarget->release();\n    g_moduleCount.modCnt.release( &g_moduleCount.modCnt );\n}\n\nvoid SAL_CALL TargetDragContext::acceptDrag( sal_Int8 dragOperation )\n    throw( RuntimeException)\n{\n    m_pDropTarget->_acceptDrag( dragOperation, static_cast<XDropTargetDragContext*>( this) );\n\n}\nvoid SAL_CALL TargetDragContext::rejectDrag( )\n    throw( RuntimeException)\n{\n    m_pDropTarget->_rejectDrag( static_cast<XDropTargetDragContext*>( this) );\n}\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#include \"stdafx.h\"\n\n#include <zorba\/diagnostic_list.h>\n#include \"diagnostics\/diagnostic.h\"\n#include \"diagnostics\/dict.h\"\n#include \"diagnostics\/util_macros.h\"\n#include \"diagnostics\/zorba_exception.h\"\n\n#include \"store\/api\/item.h\"\n#include \"simple_temp_seq.h\"\n#include \"store\/api\/copymode.h\"\n\nnamespace zorba { namespace simplestore {\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\nSimpleTempSeq::SimpleTempSeq(store::Item_t& item) \n{\n  theItems.push_back(NULL);\n  theItems[0] = item.release();\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\nSimpleTempSeq::SimpleTempSeq(std::vector<store::Item_t>& items)\n{\n  theItems.resize(items.size());\n\n  std::vector<store::Item_t>::iterator ite = items.begin();\n  std::vector<store::Item_t>::iterator end = items.end();\n  std::vector<store::Item*>::iterator ite2 = theItems.begin();\n  for (; ite != end; ++ite, ++ite2)\n  {\n    (*ite2) = (*ite).release();\n  }\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\nSimpleTempSeq::SimpleTempSeq(const store::Iterator_t& iter)\n{\n  try\n  {\n    init(iter);\n  }\n  catch (...)\n  {\n    clear();\n  }\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\nSimpleTempSeq::~SimpleTempSeq()\n{\n  clear();\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\nvoid SimpleTempSeq::clear()\n{\n  std::vector<store::Item*>::iterator ite = theItems.begin();\n  std::vector<store::Item*>::iterator end = theItems.end();\n  for (; ite != end; ++ite)\n  {\n    (*ite)->removeReference();\n  }\n\n  theItems.clear();\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\nvoid SimpleTempSeq::init(const store::Iterator_t& iter)\n{\n  store::Item_t curItem;\n\n  clear();\n\n  while (iter->next(curItem)) \n  {\n    \/\/ TODO ???? Check that the size is less than max(csize, xs_integer)\n    theItems.push_back(NULL);\n    theItems.back() = curItem.release();\n  }\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\nvoid SimpleTempSeq::append(const store::Iterator_t& iter)\n{\n  store::Item_t curItem;\n\n  while (iter->next(curItem))\n  {\n    \/\/ TODO ???? Check that the size is less than max(csize, xs_integer)\n    theItems.push_back(NULL);\n    theItems.back() = curItem.release();\n  }\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\nvoid SimpleTempSeq::purge()\n{\n  clear();\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\nvoid SimpleTempSeq::purgeUpTo(xs_integer pos)\n{\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\nbool SimpleTempSeq::empty()\n{\n  return theItems.empty();\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\nxs_integer SimpleTempSeq::getSize() const\n{\n  return xs_integer( theItems.size() );\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\nvoid SimpleTempSeq::getItem(xs_integer position, store::Item_t& res)\n{\n  xs_long pos;\n  try \n  {\n    pos = to_xs_long(position);\n  }\n  catch (std::range_error const&)\n  {\n    throw ZORBA_EXCEPTION(\n      zerr::ZSTR0060_RANGE_EXCEPTION,\n      ERROR_PARAMS( position, ZED(ZSTR0060_ForSequence) )\n    );\n  }\n\n  if (0 < pos && pos <= theItems.size())\n\t{\n    res = theItems[pos - 1];\n  }\n  else\n\t{\n    res = NULL;\n  }\n}\n\t\n\n\/*******************************************************************************\n\n********************************************************************************\/\nbool SimpleTempSeq::containsItem(xs_integer position)\n{\n  xs_long pos;\n  try \n  {\n    pos = to_xs_long(position);\n  }\n  catch (std::range_error const&)\n  {\n    throw ZORBA_EXCEPTION(\n      zerr::ZSTR0060_RANGE_EXCEPTION,\n      ERROR_PARAMS( position, ZED(ZSTR0060_ForSequence) )\n    );\n  }\n\n  return 0 < pos && pos <= theItems.size();\n}\n\n\n\/*******************************************************************************\n********************************************************************************\/\n#ifndef NDEBUG\nstd::string SimpleTempSeq::toString() const\n{\n  std::stringstream result;\n  \n  result << \"{\";\n  for (unsigned int i=0; i < theItems.size(); i++)\n  {\n    if (i != 0)\n      result << \" , \";\n    result << theItems[i]->show();\n  }\n  result << \"}\";\n  \n  return result.str();\n}\n#endif\n\n\n\/*******************************************************************************\n********************************************************************************\/\n#ifndef NDEBUG\nzstring SimpleTempSeq::show() const\n{\n  return toString();\n}\n#endif\n\n\n\/*******************************************************************************\n  Reads the whole Sequence from beginning to end; it is allowed to have several \n  concurrent iterators on the same TempSeq.\n\n  @return Iterator which iterates over the complete TempSeq\n********************************************************************************\/\nstore::Iterator_t SimpleTempSeq::getIterator() const\n{\n  return new SimpleTempSeqIter(this);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/                                                                             \/\/\n\/\/  SimpleTempSeqIter                                                          \/\/\n\/\/                                                                             \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\t\nSimpleTempSeqIter::SimpleTempSeqIter(const SimpleTempSeq* tempSeq)\n\t:\n  theTempSeq(const_cast<SimpleTempSeq*>(tempSeq))\n{\n  theBegin = theTempSeq->theItems.begin();\n  theEnd = theTempSeq->theItems.end();\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\t\nvoid SimpleTempSeqIter::init(const store::TempSeq_t& tempSeq)\n{\n  theTempSeq = tempSeq;\n\n  theBegin = theTempSeq->theItems.begin();\n  theEnd = theTempSeq->theItems.end();\n}\n\n\n\/*******************************************************************************\n  Return the items in the subrange [startPos, endPos]\n********************************************************************************\/\t\nvoid SimpleTempSeqIter::init(\n    const store::TempSeq_t& tempSeq,\n    xs_integer startPos,\n    xs_integer endPos)\n{\n  theTempSeq = tempSeq;\n\n  xs_long start;\n  xs_long end;\n\n  try\n  {\n    start = to_xs_long(startPos);\n  }\n  catch ( std::range_error const& )\n  {\n    throw ZORBA_EXCEPTION(\n      zerr::ZSTR0060_RANGE_EXCEPTION,\n      ERROR_PARAMS( start, ZED(ZSTR0060_ForSequence) )\n    );\n  }\n  try\n  {\n    end = to_xs_long(endPos);\n  }\n  catch ( std::range_error const& )\n  {\n    throw ZORBA_EXCEPTION(\n      zerr::ZSTR0060_RANGE_EXCEPTION,\n      ERROR_PARAMS( end, ZED(ZSTR0060_ForSequence) )\n    );\n  }\n\n  if (start > 0 && end > 0)\n  {\n    theBegin = theTempSeq->theItems.begin() + (start - 1);\n    theEnd = theTempSeq->theItems.begin() + end;\n  }\n  else\n  {\n    theBegin = theTempSeq->theItems.end();\n    theEnd = theTempSeq->theItems.end();\n  }\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\t\nvoid SimpleTempSeqIter::open()\n{\n  theIte = theBegin;\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\t\nbool SimpleTempSeqIter::next(store::Item_t& result)\n{\n  if (theIte != theEnd)\n  {\n    result = *theIte;\n    ++theIte;\n    return true;\n  }\n\n  result = NULL;\n  return false;\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\t\nvoid SimpleTempSeqIter::reset()\n{\n  theIte = theBegin;\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\t\nvoid SimpleTempSeqIter::close()\n{\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/ \n#ifndef NDEBUG\nstd::string SimpleTempSeqIter::toString() const\n{\n  std::stringstream ss;\n  ss << this << \" = SimpleTempSeqIter current pos: \" << (theIte - theBegin) << \" sequence: \";\n  if (theTempSeq.getp() != NULL)\n    ss << theTempSeq->toString();\n  else\n    ss << \"NULL\";\n  return ss.str();\n}\n#endif\n\n\n} \/\/ namespace store\n} \/\/ namespace zorba\n\/* vim:set et sw=2 ts=2: *\/\n<commit_msg>fixed memory leak<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#include \"stdafx.h\"\n\n#include <zorba\/diagnostic_list.h>\n#include \"diagnostics\/diagnostic.h\"\n#include \"diagnostics\/dict.h\"\n#include \"diagnostics\/util_macros.h\"\n#include \"diagnostics\/zorba_exception.h\"\n\n#include \"store\/api\/item.h\"\n#include \"simple_temp_seq.h\"\n#include \"store\/api\/copymode.h\"\n\nnamespace zorba { namespace simplestore {\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\nSimpleTempSeq::SimpleTempSeq(store::Item_t& item) \n{\n  theItems.push_back(NULL);\n  theItems[0] = item.release();\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\nSimpleTempSeq::SimpleTempSeq(std::vector<store::Item_t>& items)\n{\n  theItems.resize(items.size());\n\n  std::vector<store::Item_t>::iterator ite = items.begin();\n  std::vector<store::Item_t>::iterator end = items.end();\n  std::vector<store::Item*>::iterator ite2 = theItems.begin();\n  for (; ite != end; ++ite, ++ite2)\n  {\n    (*ite2) = (*ite).release();\n  }\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\nSimpleTempSeq::SimpleTempSeq(const store::Iterator_t& iter)\n{\n  try\n  {\n    init(iter);\n  }\n  catch (...)\n  {\n    clear();\n    throw;\n  }\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\nSimpleTempSeq::~SimpleTempSeq()\n{\n  clear();\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\nvoid SimpleTempSeq::clear()\n{\n  std::vector<store::Item*>::iterator ite = theItems.begin();\n  std::vector<store::Item*>::iterator end = theItems.end();\n  for (; ite != end; ++ite)\n  {\n    (*ite)->removeReference();\n  }\n\n  theItems.clear();\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\nvoid SimpleTempSeq::init(const store::Iterator_t& iter)\n{\n  store::Item_t curItem;\n\n  clear();\n\n  while (iter->next(curItem)) \n  {\n    \/\/ TODO ???? Check that the size is less than max(csize, xs_integer)\n    theItems.push_back(NULL);\n    theItems.back() = curItem.release();\n  }\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\nvoid SimpleTempSeq::append(const store::Iterator_t& iter)\n{\n  store::Item_t curItem;\n\n  while (iter->next(curItem))\n  {\n    \/\/ TODO ???? Check that the size is less than max(csize, xs_integer)\n    theItems.push_back(NULL);\n    theItems.back() = curItem.release();\n  }\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\nvoid SimpleTempSeq::purge()\n{\n  clear();\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\nvoid SimpleTempSeq::purgeUpTo(xs_integer pos)\n{\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\nbool SimpleTempSeq::empty()\n{\n  return theItems.empty();\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\nxs_integer SimpleTempSeq::getSize() const\n{\n  return xs_integer( theItems.size() );\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\nvoid SimpleTempSeq::getItem(xs_integer position, store::Item_t& res)\n{\n  xs_long pos;\n  try \n  {\n    pos = to_xs_long(position);\n  }\n  catch (std::range_error const&)\n  {\n    throw ZORBA_EXCEPTION(\n      zerr::ZSTR0060_RANGE_EXCEPTION,\n      ERROR_PARAMS( position, ZED(ZSTR0060_ForSequence) )\n    );\n  }\n\n  if (0 < pos && pos <= theItems.size())\n\t{\n    res = theItems[pos - 1];\n  }\n  else\n\t{\n    res = NULL;\n  }\n}\n\t\n\n\/*******************************************************************************\n\n********************************************************************************\/\nbool SimpleTempSeq::containsItem(xs_integer position)\n{\n  xs_long pos;\n  try \n  {\n    pos = to_xs_long(position);\n  }\n  catch (std::range_error const&)\n  {\n    throw ZORBA_EXCEPTION(\n      zerr::ZSTR0060_RANGE_EXCEPTION,\n      ERROR_PARAMS( position, ZED(ZSTR0060_ForSequence) )\n    );\n  }\n\n  return 0 < pos && pos <= theItems.size();\n}\n\n\n\/*******************************************************************************\n********************************************************************************\/\n#ifndef NDEBUG\nstd::string SimpleTempSeq::toString() const\n{\n  std::stringstream result;\n  \n  result << \"{\";\n  for (unsigned int i=0; i < theItems.size(); i++)\n  {\n    if (i != 0)\n      result << \" , \";\n    result << theItems[i]->show();\n  }\n  result << \"}\";\n  \n  return result.str();\n}\n#endif\n\n\n\/*******************************************************************************\n********************************************************************************\/\n#ifndef NDEBUG\nzstring SimpleTempSeq::show() const\n{\n  return toString();\n}\n#endif\n\n\n\/*******************************************************************************\n  Reads the whole Sequence from beginning to end; it is allowed to have several \n  concurrent iterators on the same TempSeq.\n\n  @return Iterator which iterates over the complete TempSeq\n********************************************************************************\/\nstore::Iterator_t SimpleTempSeq::getIterator() const\n{\n  return new SimpleTempSeqIter(this);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/                                                                             \/\/\n\/\/  SimpleTempSeqIter                                                          \/\/\n\/\/                                                                             \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\t\nSimpleTempSeqIter::SimpleTempSeqIter(const SimpleTempSeq* tempSeq)\n\t:\n  theTempSeq(const_cast<SimpleTempSeq*>(tempSeq))\n{\n  theBegin = theTempSeq->theItems.begin();\n  theEnd = theTempSeq->theItems.end();\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\t\nvoid SimpleTempSeqIter::init(const store::TempSeq_t& tempSeq)\n{\n  theTempSeq = tempSeq;\n\n  theBegin = theTempSeq->theItems.begin();\n  theEnd = theTempSeq->theItems.end();\n}\n\n\n\/*******************************************************************************\n  Return the items in the subrange [startPos, endPos]\n********************************************************************************\/\t\nvoid SimpleTempSeqIter::init(\n    const store::TempSeq_t& tempSeq,\n    xs_integer startPos,\n    xs_integer endPos)\n{\n  theTempSeq = tempSeq;\n\n  xs_long start;\n  xs_long end;\n\n  try\n  {\n    start = to_xs_long(startPos);\n  }\n  catch ( std::range_error const& )\n  {\n    throw ZORBA_EXCEPTION(\n      zerr::ZSTR0060_RANGE_EXCEPTION,\n      ERROR_PARAMS( start, ZED(ZSTR0060_ForSequence) )\n    );\n  }\n  try\n  {\n    end = to_xs_long(endPos);\n  }\n  catch ( std::range_error const& )\n  {\n    throw ZORBA_EXCEPTION(\n      zerr::ZSTR0060_RANGE_EXCEPTION,\n      ERROR_PARAMS( end, ZED(ZSTR0060_ForSequence) )\n    );\n  }\n\n  if (start > 0 && end > 0)\n  {\n    theBegin = theTempSeq->theItems.begin() + (start - 1);\n    theEnd = theTempSeq->theItems.begin() + end;\n  }\n  else\n  {\n    theBegin = theTempSeq->theItems.end();\n    theEnd = theTempSeq->theItems.end();\n  }\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\t\nvoid SimpleTempSeqIter::open()\n{\n  theIte = theBegin;\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\t\nbool SimpleTempSeqIter::next(store::Item_t& result)\n{\n  if (theIte != theEnd)\n  {\n    result = *theIte;\n    ++theIte;\n    return true;\n  }\n\n  result = NULL;\n  return false;\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\t\nvoid SimpleTempSeqIter::reset()\n{\n  theIte = theBegin;\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\t\nvoid SimpleTempSeqIter::close()\n{\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/ \n#ifndef NDEBUG\nstd::string SimpleTempSeqIter::toString() const\n{\n  std::stringstream ss;\n  ss << this << \" = SimpleTempSeqIter current pos: \" << (theIte - theBegin) << \" sequence: \";\n  if (theTempSeq.getp() != NULL)\n    ss << theTempSeq->toString();\n  else\n    ss << \"NULL\";\n  return ss.str();\n}\n#endif\n\n\n} \/\/ namespace store\n} \/\/ namespace zorba\n\/* vim:set et sw=2 ts=2: *\/\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2016 Facebook, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/\/ @author: Bert Maher <bertrand@fb.com>\n\n#include <thread>\n#include <iostream>\n#include <stdio.h>\n#include <pthread.h>\n\n#include <folly\/Benchmark.h>\n#include <folly\/ProducerConsumerQueue.h>\n#include <folly\/portability\/GFlags.h>\n#include <folly\/stats\/Histogram.h>\n#include <folly\/stats\/Histogram-defs.h>\n#include <glog\/logging.h>\n\nnamespace {\n\nusing namespace folly;\n\ntypedef unsigned int ThroughputType;\ntypedef ProducerConsumerQueue<ThroughputType> ThroughputQueueType;\n\ntypedef unsigned long LatencyType;\ntypedef ProducerConsumerQueue<LatencyType> LatencyQueueType;\n\ntemplate<class QueueType>\nstruct ThroughputTest {\n  explicit ThroughputTest(size_t size, int iters, int cpu0, int cpu1)\n  : queue_(size),\n    done_(false),\n    iters_(iters),\n    cpu0_(cpu0),\n    cpu1_(cpu1)\n    { }\n\n  void producer() {\n    if (cpu0_ > -1) {\n      cpu_set_t cpuset;\n      CPU_ZERO(&cpuset);\n      CPU_SET(cpu0_, &cpuset);\n      pthread_setaffinity_np(pthread_self(), sizeof(cpu_set_t), &cpuset);\n    }\n    for (int i = 0; i < iters_; ++i) {\n      ThroughputType item = i;\n      while (!queue_.write((ThroughputType) item)) {\n      }\n    }\n  }\n\n  void consumer() {\n    if (cpu1_ > -1) {\n      cpu_set_t cpuset;\n      CPU_ZERO(&cpuset);\n      CPU_SET(cpu1_, &cpuset);\n      pthread_setaffinity_np(pthread_self(), sizeof(cpu_set_t), &cpuset);\n    }\n    for (int i = 0; i < iters_; ++i) {\n      ThroughputType item = 0;\n      while (!queue_.read(item)) {\n      }\n      doNotOptimizeAway(item);\n    }\n  }\n\n  QueueType queue_;\n  std::atomic<bool> done_;\n  int iters_;\n  int cpu0_;\n  int cpu1_;\n};\n\ntemplate<class QueueType>\nstruct LatencyTest {\n  explicit LatencyTest(size_t size, int iters, int cpu0, int cpu1)\n  : queue_(size),\n    done_(false),\n    iters_(iters),\n    cpu0_(cpu0),\n    cpu1_(cpu1),\n    hist_(1, 0, 30)\n    {\n      computeTimeCost();\n    }\n\n  void computeTimeCost() {\n    int iterations = 1000;\n    timespec start, end;\n    clock_gettime(CLOCK_REALTIME, &start);\n    for (int i = 0; i < iterations; ++i) {\n      timespec tv;\n      clock_gettime(CLOCK_REALTIME, &tv);\n    }\n    clock_gettime(CLOCK_REALTIME, &end);\n    time_cost_ = 2 * detail::timespecDiff(end, start) \/ iterations;\n  }\n\n  void producer() {\n    if (cpu0_ > -1) {\n      cpu_set_t cpuset;\n      CPU_ZERO(&cpuset);\n      CPU_SET(cpu0_, &cpuset);\n      pthread_setaffinity_np(pthread_self(), sizeof(cpu_set_t), &cpuset);\n    }\n    for (int i = 0; i < iters_; ++i) {\n      timespec sleeptime, sleepstart;\n      clock_gettime(CLOCK_REALTIME, &sleepstart);\n      do {\n        clock_gettime(CLOCK_REALTIME, &sleeptime);\n      } while (detail::timespecDiff(sleeptime, sleepstart) < 1000000);\n\n      timespec tv;\n      clock_gettime(CLOCK_REALTIME, &tv);\n      while (!queue_.write((LatencyType) tv.tv_nsec)) {\n      }\n    }\n  }\n\n  void consumer() {\n    if (cpu1_ > -1) {\n      cpu_set_t cpuset;\n      CPU_ZERO(&cpuset);\n      CPU_SET(cpu1_, &cpuset);\n      pthread_setaffinity_np(pthread_self(), sizeof(cpu_set_t), &cpuset);\n    }\n    for (int i = 0; i < iters_; ++i) {\n      unsigned long enqueue_nsec;\n      while (!queue_.read(enqueue_nsec)) {\n      }\n\n      timespec tv;\n      clock_gettime(CLOCK_REALTIME, &tv);\n      int diff = tv.tv_nsec - enqueue_nsec - time_cost_;\n      if (diff < 0) {\n        continue;\n      }\n\n      \/\/ Naive log-scale bucketing.\n      int bucket;\n      for (bucket = 0;\n           bucket <= 30 && (1 << bucket) <= diff;\n           ++bucket) {\n      }\n      hist_.addValue(bucket - 1);\n    }\n  }\n\n  void printHistogram() {\n    hist_.toTSV(std::cout);\n  }\n\n  QueueType queue_;\n  std::atomic<bool> done_;\n  int time_cost_;\n  int iters_;\n  int cpu0_;\n  int cpu1_;\n  Histogram<int> hist_;\n};\n\nvoid BM_ProducerConsumer(int iters, int size) {\n  BenchmarkSuspender susp;\n  CHECK_GT(size, 0);\n  ThroughputTest<ThroughputQueueType> *test =\n    new ThroughputTest<ThroughputQueueType>(size, iters, -1, -1);\n  susp.dismiss();\n\n  std::thread producer( [test] { test->producer(); } );\n  std::thread consumer( [test] { test->consumer(); } );\n\n  producer.join();\n  test->done_ = true;\n  consumer.join();\n  delete test;\n}\n\nvoid BM_ProducerConsumerAffinity(int iters, int size) {\n  BenchmarkSuspender susp;\n  CHECK_GT(size, 0);\n  ThroughputTest<ThroughputQueueType> *test =\n    new ThroughputTest<ThroughputQueueType>(size, iters, 0, 1);\n  susp.dismiss();\n\n  std::thread producer( [test] { test->producer(); } );\n  std::thread consumer( [test] { test->consumer(); } );\n\n  producer.join();\n  test->done_ = true;\n  consumer.join();\n  delete test;\n}\n\nvoid BM_ProducerConsumerLatency(int \/* iters *\/, int size) {\n  BenchmarkSuspender susp;\n  CHECK_GT(size, 0);\n  LatencyTest<LatencyQueueType> *test =\n    new LatencyTest<LatencyQueueType>(size, 100000, 0, 1);\n  susp.dismiss();\n\n  std::thread producer( [test] { test->producer(); } );\n  std::thread consumer( [test] { test->consumer(); } );\n\n  producer.join();\n  test->done_ = true;\n  consumer.join();\n  test->printHistogram();\n  delete test;\n}\n\n\nBENCHMARK_DRAW_LINE();\n\nBENCHMARK_PARAM(BM_ProducerConsumer, 1048574);\nBENCHMARK_PARAM(BM_ProducerConsumerAffinity, 1048574);\nBENCHMARK_PARAM(BM_ProducerConsumerLatency, 1048574);\n\n}\n\nint main(int argc, char** argv) {\n  google::InitGoogleLogging(argv[0]);\n  gflags::ParseCommandLineFlags(&argc, &argv, true);\n\n  runBenchmarks();\n  return 0;\n}\n\n#if 0\n\/*\nBenchmark on Intel(R) Xeon(R) CPU E5-2660 0 @ 2.20GHz\nLatency histogram:\n  log(nsec)\n  min  max     count\n  6    7       5124\n  7    8       4799\n  8    9       49\n  9    10      2\n  10   11      1\n  11   12      5\n  12   13      3\n  13   14      9\n  14   15      8\n============================================================================\nfolly\/test\/ProducerConsumerQueueBenchmark.cpp   relative  time\/iter  iters\/s\n============================================================================\n----------------------------------------------------------------------------\nBM_ProducerConsumer(1048574)                                 7.52ns  132.90M\nBM_ProducerConsumerAffinity(1048574)                         8.28ns  120.75M\nBM_ProducerConsumerLatency(1048574)                          10.00s   99.98m\n============================================================================\n*\/\n#endif\n<commit_msg>Correctly use iters_ in ProducerConsumerQueueBenchmark<commit_after>\/*\n * Copyright 2016 Facebook, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/\/ @author: Bert Maher <bertrand@fb.com>\n\n#include <thread>\n#include <iostream>\n#include <stdio.h>\n#include <pthread.h>\n\n#include <folly\/Benchmark.h>\n#include <folly\/ProducerConsumerQueue.h>\n#include <folly\/portability\/GFlags.h>\n#include <folly\/stats\/Histogram.h>\n#include <folly\/stats\/Histogram-defs.h>\n#include <glog\/logging.h>\n\nnamespace {\n\nusing namespace folly;\n\ntypedef unsigned int ThroughputType;\ntypedef ProducerConsumerQueue<ThroughputType> ThroughputQueueType;\n\ntypedef unsigned long LatencyType;\ntypedef ProducerConsumerQueue<LatencyType> LatencyQueueType;\n\ntemplate<class QueueType>\nstruct ThroughputTest {\n  explicit ThroughputTest(size_t size, int iters, int cpu0, int cpu1)\n  : queue_(size),\n    done_(false),\n    iters_(iters),\n    cpu0_(cpu0),\n    cpu1_(cpu1)\n    { }\n\n  void producer() {\n    if (cpu0_ > -1) {\n      cpu_set_t cpuset;\n      CPU_ZERO(&cpuset);\n      CPU_SET(cpu0_, &cpuset);\n      pthread_setaffinity_np(pthread_self(), sizeof(cpu_set_t), &cpuset);\n    }\n    for (int i = 0; i < iters_; ++i) {\n      ThroughputType item = i;\n      while (!queue_.write((ThroughputType) item)) {\n      }\n    }\n  }\n\n  void consumer() {\n    if (cpu1_ > -1) {\n      cpu_set_t cpuset;\n      CPU_ZERO(&cpuset);\n      CPU_SET(cpu1_, &cpuset);\n      pthread_setaffinity_np(pthread_self(), sizeof(cpu_set_t), &cpuset);\n    }\n    for (int i = 0; i < iters_; ++i) {\n      ThroughputType item = 0;\n      while (!queue_.read(item)) {\n      }\n      doNotOptimizeAway(item);\n    }\n  }\n\n  QueueType queue_;\n  std::atomic<bool> done_;\n  int iters_;\n  int cpu0_;\n  int cpu1_;\n};\n\ntemplate<class QueueType>\nstruct LatencyTest {\n  explicit LatencyTest(size_t size, int iters, int cpu0, int cpu1)\n  : queue_(size),\n    done_(false),\n    iters_(iters),\n    cpu0_(cpu0),\n    cpu1_(cpu1),\n    hist_(1, 0, 30)\n    {\n      computeTimeCost();\n    }\n\n  void computeTimeCost() {\n    timespec start, end;\n    clock_gettime(CLOCK_REALTIME, &start);\n    for (int i = 0; i < iters_; ++i) {\n      timespec tv;\n      clock_gettime(CLOCK_REALTIME, &tv);\n    }\n    clock_gettime(CLOCK_REALTIME, &end);\n    time_cost_ = 2 * detail::timespecDiff(end, start) \/ iters_;\n  }\n\n  void producer() {\n    if (cpu0_ > -1) {\n      cpu_set_t cpuset;\n      CPU_ZERO(&cpuset);\n      CPU_SET(cpu0_, &cpuset);\n      pthread_setaffinity_np(pthread_self(), sizeof(cpu_set_t), &cpuset);\n    }\n    for (int i = 0; i < iters_; ++i) {\n      timespec sleeptime, sleepstart;\n      clock_gettime(CLOCK_REALTIME, &sleepstart);\n      do {\n        clock_gettime(CLOCK_REALTIME, &sleeptime);\n      } while (detail::timespecDiff(sleeptime, sleepstart) < 1000000);\n\n      timespec tv;\n      clock_gettime(CLOCK_REALTIME, &tv);\n      while (!queue_.write((LatencyType) tv.tv_nsec)) {\n      }\n    }\n  }\n\n  void consumer() {\n    if (cpu1_ > -1) {\n      cpu_set_t cpuset;\n      CPU_ZERO(&cpuset);\n      CPU_SET(cpu1_, &cpuset);\n      pthread_setaffinity_np(pthread_self(), sizeof(cpu_set_t), &cpuset);\n    }\n    for (int i = 0; i < iters_; ++i) {\n      unsigned long enqueue_nsec;\n      while (!queue_.read(enqueue_nsec)) {\n      }\n\n      timespec tv;\n      clock_gettime(CLOCK_REALTIME, &tv);\n      int diff = tv.tv_nsec - enqueue_nsec - time_cost_;\n      if (diff < 0) {\n        continue;\n      }\n\n      \/\/ Naive log-scale bucketing.\n      int bucket;\n      for (bucket = 0;\n           bucket <= 30 && (1 << bucket) <= diff;\n           ++bucket) {\n      }\n      hist_.addValue(bucket - 1);\n    }\n  }\n\n  void printHistogram() {\n    hist_.toTSV(std::cout);\n  }\n\n  QueueType queue_;\n  std::atomic<bool> done_;\n  int time_cost_;\n  int iters_;\n  int cpu0_;\n  int cpu1_;\n  Histogram<int> hist_;\n};\n\nvoid BM_ProducerConsumer(int iters, int size) {\n  BenchmarkSuspender susp;\n  CHECK_GT(size, 0);\n  ThroughputTest<ThroughputQueueType> *test =\n    new ThroughputTest<ThroughputQueueType>(size, iters, -1, -1);\n  susp.dismiss();\n\n  std::thread producer( [test] { test->producer(); } );\n  std::thread consumer( [test] { test->consumer(); } );\n\n  producer.join();\n  test->done_ = true;\n  consumer.join();\n  delete test;\n}\n\nvoid BM_ProducerConsumerAffinity(int iters, int size) {\n  BenchmarkSuspender susp;\n  CHECK_GT(size, 0);\n  ThroughputTest<ThroughputQueueType> *test =\n    new ThroughputTest<ThroughputQueueType>(size, iters, 0, 1);\n  susp.dismiss();\n\n  std::thread producer( [test] { test->producer(); } );\n  std::thread consumer( [test] { test->consumer(); } );\n\n  producer.join();\n  test->done_ = true;\n  consumer.join();\n  delete test;\n}\n\nvoid BM_ProducerConsumerLatency(int \/* iters *\/, int size) {\n  BenchmarkSuspender susp;\n  CHECK_GT(size, 0);\n  LatencyTest<LatencyQueueType> *test =\n    new LatencyTest<LatencyQueueType>(size, 100000, 0, 1);\n  susp.dismiss();\n\n  std::thread producer( [test] { test->producer(); } );\n  std::thread consumer( [test] { test->consumer(); } );\n\n  producer.join();\n  test->done_ = true;\n  consumer.join();\n  test->printHistogram();\n  delete test;\n}\n\n\nBENCHMARK_DRAW_LINE();\n\nBENCHMARK_PARAM(BM_ProducerConsumer, 1048574);\nBENCHMARK_PARAM(BM_ProducerConsumerAffinity, 1048574);\nBENCHMARK_PARAM(BM_ProducerConsumerLatency, 1048574);\n\n}\n\nint main(int argc, char** argv) {\n  google::InitGoogleLogging(argv[0]);\n  gflags::ParseCommandLineFlags(&argc, &argv, true);\n\n  runBenchmarks();\n  return 0;\n}\n\n#if 0\n\/*\nBenchmark on Intel(R) Xeon(R) CPU E5-2660 0 @ 2.20GHz\nLatency histogram:\n  log(nsec)\n  min  max     count\n  6    7       5124\n  7    8       4799\n  8    9       49\n  9    10      2\n  10   11      1\n  11   12      5\n  12   13      3\n  13   14      9\n  14   15      8\n============================================================================\nfolly\/test\/ProducerConsumerQueueBenchmark.cpp   relative  time\/iter  iters\/s\n============================================================================\n----------------------------------------------------------------------------\nBM_ProducerConsumer(1048574)                                 7.52ns  132.90M\nBM_ProducerConsumerAffinity(1048574)                         8.28ns  120.75M\nBM_ProducerConsumerLatency(1048574)                          10.00s   99.98m\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 \"config.h\"\n#include \"webkit\/plugins\/ppapi\/ppb_graphics_3d_impl.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/command_line.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/utf_string_conversions.h\"\n\/\/FIXME #include \"gpu\/command_buffer\/client\/gles2_implementation.h\"\n#include \"ppapi\/c\/ppp_graphics_3d.h\"\n#include \"ppapi\/thunk\/enter.h\"\n\/*FIXME\n#include \"third_party\/WebKit\/Source\/Platform\/chromium\/public\/WebString.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebConsoleMessage.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebDocument.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebElement.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebFrame.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebPluginContainer.h\"\n*\/\n#include \"webkit\/plugins\/plugin_switches.h\"\n#include \"webkit\/plugins\/ppapi\/plugin_module.h\"\n#include \"webkit\/plugins\/ppapi\/ppapi_plugin_instance.h\"\n#include \"webkit\/plugins\/ppapi\/resource_helper.h\"\n\n#include \"PepperPluginContainer.h\"\n#include \"WebCore\/page\/Console.h\"\n#include <WebCore\/Document.h>\n#include <WebCore\/Element.h>\n#include <WebCore\/Frame.h>\n#include <WebCore\/FrameView.h>\n#include \"gpu_shim.h\"\n\nusing ppapi::thunk::EnterResourceNoLock;\nusing ppapi::thunk::PPB_Graphics3D_API;\nusing namespace WebCore;\n\n\/*FIXME\nusing WebKit::WebConsoleMessage;\nusing WebKit::WebFrame;\nusing WebKit::WebPluginContainer;\nusing WebKit::WebString;\n*\/\n\nnamespace webkit {\nnamespace ppapi {\n\nnamespace {\nconst int32 kCommandBufferSize = 1024 * 1024;\nconst int32 kTransferBufferSize = 1024 * 1024;\n\nPP_Bool ShmToHandle(base::SharedMemory* shm,\n                    size_t size,\n                    int* shm_handle,\n                    uint32_t* shm_size) {\n  if (!shm || !shm_handle || !shm_size)\n    return PP_FALSE;\n#if defined(OS_POSIX)\n  *shm_handle = shm->handle().fd;\n#elif defined(OS_WIN)\n  *shm_handle = reinterpret_cast<int>(shm->handle());\n#else\n  #error \"Platform not supported.\"\n#endif\n  *shm_size = size;\n  return PP_TRUE;\n}\n\nPP_Graphics3DTrustedState PPStateFromGPUState(\n    const gpu::CommandBuffer::State& s) {\n  PP_Graphics3DTrustedState state = {\n      s.num_entries,\n      s.get_offset,\n      s.put_offset,\n      s.token,\n      static_cast<PPB_Graphics3DTrustedError>(s.error),\n      s.generation\n  };\n  return state;\n}\n}  \/\/ namespace.\n\nPPB_Graphics3D_Impl::PPB_Graphics3D_Impl(PP_Instance instance)\n    : PPB_Graphics3D_Shared(instance),\n      bound_to_instance_(false),\n      commit_pending_(false),\n      weak_ptr_factory_(ALLOW_THIS_IN_INITIALIZER_LIST(this)) {\n}\n\nPPB_Graphics3D_Impl::~PPB_Graphics3D_Impl() {\n  DestroyGLES2Impl();\n}\n\n\/\/ static\nPP_Bool PPB_Graphics3D_Impl::IsGpuBlacklisted() {\n  CommandLine* command_line = CommandLine::ForCurrentProcess();\n  if (command_line)\n    return PP_FromBool(\n        command_line->HasSwitch(switches::kDisablePepper3d));\n  return PP_TRUE;\n}\n\n\/\/ static\nPP_Resource PPB_Graphics3D_Impl::Create(PP_Instance instance,\n                                        PP_Resource share_context,\n                                        const int32_t* attrib_list) {\n  PPB_Graphics3D_API* share_api = NULL;\n  if (IsGpuBlacklisted())\n    return 0;\n  if (share_context) {\n    EnterResourceNoLock<PPB_Graphics3D_API> enter(share_context, true);\n    if (enter.failed())\n      return 0;\n    share_api = enter.object();\n  }\n  scoped_refptr<PPB_Graphics3D_Impl> graphics_3d(\n      new PPB_Graphics3D_Impl(instance));\n  if (!graphics_3d->Init(share_api, attrib_list))\n    return 0;\n  return graphics_3d->GetReference();\n}\n\n\/\/ static\nPP_Resource PPB_Graphics3D_Impl::CreateRaw(PP_Instance instance,\n                                           PP_Resource share_context,\n                                           const int32_t* attrib_list) {\n  PPB_Graphics3D_API* share_api = NULL;\n  if (IsGpuBlacklisted())\n    return 0;\n  if (share_context) {\n    EnterResourceNoLock<PPB_Graphics3D_API> enter(share_context, true);\n    if (enter.failed())\n      return 0;\n    share_api = enter.object();\n  }\n  scoped_refptr<PPB_Graphics3D_Impl> graphics_3d(\n      new PPB_Graphics3D_Impl(instance));\n  if (!graphics_3d->InitRaw(share_api, attrib_list))\n    return 0;\n  return graphics_3d->GetReference();\n}\n\nPP_Bool PPB_Graphics3D_Impl::InitCommandBuffer() {\n  return PP_FromBool(GetCommandBuffer()->Initialize());\n}\n\nPP_Bool PPB_Graphics3D_Impl::SetGetBuffer(int32_t transfer_buffer_id) {\n  GetCommandBuffer()->SetGetBuffer(transfer_buffer_id);\n  return PP_TRUE;\n}\n\nPP_Graphics3DTrustedState PPB_Graphics3D_Impl::GetState() {\n  return PPStateFromGPUState(GetCommandBuffer()->GetState());\n}\n\nint32_t PPB_Graphics3D_Impl::CreateTransferBuffer(uint32_t size) {\n  int32_t id = -1;\n  GetCommandBuffer()->CreateTransferBuffer(size, &id);\n  return id;\n}\n\nPP_Bool PPB_Graphics3D_Impl::DestroyTransferBuffer(int32_t id) {\n  GetCommandBuffer()->DestroyTransferBuffer(id);\n  return PP_TRUE;\n}\n\nPP_Bool PPB_Graphics3D_Impl::GetTransferBuffer(int32_t id,\n                                               int* shm_handle,\n                                               uint32_t* shm_size) {\n  gpu::Buffer buffer = GetCommandBuffer()->GetTransferBuffer(id);\n  return ShmToHandle(buffer.shared_memory, buffer.size, shm_handle, shm_size);\n}\n\nPP_Bool PPB_Graphics3D_Impl::Flush(int32_t put_offset) {\n  GetCommandBuffer()->Flush(put_offset);\n  return PP_TRUE;\n}\n\nPP_Graphics3DTrustedState PPB_Graphics3D_Impl::FlushSync(int32_t put_offset) {\n  gpu::CommandBuffer::State state = GetCommandBuffer()->GetState();\n  return PPStateFromGPUState(\n      GetCommandBuffer()->FlushSync(put_offset, state.get_offset));\n}\n\nPP_Graphics3DTrustedState PPB_Graphics3D_Impl::FlushSyncFast(\n    int32_t put_offset,\n    int32_t last_known_get) {\n  return PPStateFromGPUState(\n      GetCommandBuffer()->FlushSync(put_offset, last_known_get));\n}\n\nbool PPB_Graphics3D_Impl::BindToInstance(bool bind) {\n  bound_to_instance_ = bind;\n  return true;\n}\n\nunsigned int PPB_Graphics3D_Impl::GetBackingTextureId() {\n  return platform_context_->GetBackingTextureId();\n}\n\nbool PPB_Graphics3D_Impl::IsOpaque() {\n  return platform_context_->IsOpaque();\n}\n\nvoid PPB_Graphics3D_Impl::ViewWillInitiatePaint() {\n}\n\nvoid PPB_Graphics3D_Impl::ViewInitiatedPaint() {\n  commit_pending_ = false;\n\n  if (HasPendingSwap())\n    SwapBuffersACK(PP_OK);\n}\n\nvoid PPB_Graphics3D_Impl::ViewFlushedPaint() {\n}\n\ngpu::CommandBuffer* PPB_Graphics3D_Impl::GetCommandBuffer() {\n  return platform_context_->GetCommandBuffer();\n}\n\nint32 PPB_Graphics3D_Impl::DoSwapBuffers() {\n  \/\/ We do not have a GLES2 implementation when using an OOP proxy.\n  \/\/ The plugin-side proxy is responsible for adding the SwapBuffers command\n  \/\/ to the command buffer in that case.\n  if (gles2_impl())\n    gles2_impl()->SwapBuffers();\n\n  if (bound_to_instance_) {\n    \/\/ If we are bound to the instance, we need to ask the compositor\n    \/\/ to commit our backing texture so that the graphics appears on the page.\n    \/\/ When the backing texture will be committed we get notified via\n    \/\/ ViewFlushedPaint().\n    \/\/\n    \/\/ Don't need to check for NULL from GetPluginInstance since when we're\n    \/\/ bound, we know our instance is valid.\n    ResourceHelper::GetPluginInstance(this)->CommitBackingTexture();\n    commit_pending_ = true;\n  } else {\n    \/\/ Wait for the command to complete on the GPU to allow for throttling.\n    platform_context_->Echo(base::Bind(&PPB_Graphics3D_Impl::OnSwapBuffers,\n                                       weak_ptr_factory_.GetWeakPtr()));\n  }\n\n  MessageLoop::current()->PostDelayedTask(FROM_HERE, base::Bind(\n      &PPB_Graphics3D_Impl::OnSwapBuffers, weak_ptr_factory_.GetWeakPtr()), base::TimeDelta::FromMilliseconds(1000\/30)); \/\/ 30 FPS\n\n  return PP_OK_COMPLETIONPENDING;\n}\n\nbool PPB_Graphics3D_Impl::Init(PPB_Graphics3D_API* share_context,\n                               const int32_t* attrib_list) {\n  if (!InitRaw(share_context, attrib_list))\n    return false;\n\n  gpu::CommandBuffer* command_buffer = GetCommandBuffer();\n  if (!command_buffer->Initialize())\n    return false;\n\n  gpu::gles2::GLES2Implementation* share_gles2 = NULL;\n  if (share_context) {\n    share_gles2 =\n        static_cast<PPB_Graphics3D_Shared*>(share_context)->gles2_impl();\n  }\n\n  if (!CreateGLES2Impl(kCommandBufferSize, kTransferBufferSize,\n                         share_gles2))\n    return false;\n\n  WebKit::PepperPluginContainer* container =\n      ResourceHelper::GetPluginInstance(this)->container();\n  if (!container)\n    return false;\n  gles2_impl()->CreateContext(attrib_list, container->element()->document()->view()->root()->hostWindow());\n  return true;\n}\n\nbool PPB_Graphics3D_Impl::InitRaw(PPB_Graphics3D_API* share_context,\n                                  const int32_t* attrib_list) {\n  PluginInstance* plugin_instance = ResourceHelper::GetPluginInstance(this);\n  if (!plugin_instance)\n    return false;\n\n  PluginDelegate::PlatformContext3D* share_platform_context = NULL;\n  if (share_context) {\n    PPB_Graphics3D_Impl* share_graphics =\n        static_cast<PPB_Graphics3D_Impl*>(share_context);\n    share_platform_context = share_graphics->platform_context();\n  }\n\n  platform_context_.reset(plugin_instance->CreateContext3D());\n  if (!platform_context_.get())\n    return false;\n\n  if (!platform_context_->Init(attrib_list, share_platform_context))\n    return false;\n\n  platform_context_->SetContextLostCallback(\n      base::Bind(&PPB_Graphics3D_Impl::OnContextLost,\n                 weak_ptr_factory_.GetWeakPtr()));\n\n  platform_context_->SetOnConsoleMessageCallback(\n      base::Bind(&PPB_Graphics3D_Impl::OnConsoleMessage,\n                 weak_ptr_factory_.GetWeakPtr()));\n  return true;\n}\n\nvoid PPB_Graphics3D_Impl::OnConsoleMessage(const std::string& message,\n                                           int id) {\n  if (!bound_to_instance_)\n    return;\n  WebKit::PepperPluginContainer* container =\n      ResourceHelper::GetPluginInstance(this)->container();\n  if (!container)\n    return;\n  Frame* frame = container->element()->document()->frame();\n  if (!frame)\n    return;\n  container->element()->document()->addConsoleMessage(OtherMessageSource, ErrorMessageLevel, message.c_str());\n}\n\nvoid PPB_Graphics3D_Impl::OnSwapBuffers() {\n  if (HasPendingSwap()) {\n    \/\/ If we're off-screen, no need to trigger and wait for compositing.\n    \/\/ Just send the swap-buffers ACK to the plugin immediately.\n    commit_pending_ = false;\n    SwapBuffersACK(PP_OK);\n  }\n}\n\nvoid PPB_Graphics3D_Impl::OnContextLost() {\n  \/\/ Don't need to check for NULL from GetPluginInstance since when we're\n  \/\/ bound, we know our instance is valid.\n  if (bound_to_instance_)\n    ResourceHelper::GetPluginInstance(this)->BindGraphics(pp_instance(), 0);\n\n  \/\/ Send context lost to plugin. This may have been caused by a PPAPI call, so\n  \/\/ avoid re-entering.\n  MessageLoop::current()->PostTask(FROM_HERE, base::Bind(\n      &PPB_Graphics3D_Impl::SendContextLost, weak_ptr_factory_.GetWeakPtr()));\n}\n\nvoid PPB_Graphics3D_Impl::SendContextLost() {\n  \/\/ By the time we run this, the instance may have been deleted, or in the\n  \/\/ process of being deleted. Even in the latter case, we don't want to send a\n  \/\/ callback after DidDestroy.\n  PluginInstance* instance = ResourceHelper::GetPluginInstance(this);\n  if (!instance || !instance->container())\n    return;\n\n  const PPP_Graphics3D* ppp_graphics_3d =\n      static_cast<const PPP_Graphics3D*>(\n          instance->module()->GetPluginInterface(\n              PPP_GRAPHICS_3D_INTERFACE));\n  if (ppp_graphics_3d)\n    ppp_graphics_3d->Graphics3DContextLost(pp_instance());\n}\n\n}  \/\/ namespace ppapi\n}  \/\/ namespace webkit\n<commit_msg>Increase FPS to 60, to look more like the chrome GLES plugin.<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 \"config.h\"\n#include \"webkit\/plugins\/ppapi\/ppb_graphics_3d_impl.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/command_line.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/utf_string_conversions.h\"\n\/\/FIXME #include \"gpu\/command_buffer\/client\/gles2_implementation.h\"\n#include \"ppapi\/c\/ppp_graphics_3d.h\"\n#include \"ppapi\/thunk\/enter.h\"\n\/*FIXME\n#include \"third_party\/WebKit\/Source\/Platform\/chromium\/public\/WebString.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebConsoleMessage.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebDocument.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebElement.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebFrame.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/WebPluginContainer.h\"\n*\/\n#include \"webkit\/plugins\/plugin_switches.h\"\n#include \"webkit\/plugins\/ppapi\/plugin_module.h\"\n#include \"webkit\/plugins\/ppapi\/ppapi_plugin_instance.h\"\n#include \"webkit\/plugins\/ppapi\/resource_helper.h\"\n\n#include \"PepperPluginContainer.h\"\n#include \"WebCore\/page\/Console.h\"\n#include <WebCore\/Document.h>\n#include <WebCore\/Element.h>\n#include <WebCore\/Frame.h>\n#include <WebCore\/FrameView.h>\n#include \"gpu_shim.h\"\n\nusing ppapi::thunk::EnterResourceNoLock;\nusing ppapi::thunk::PPB_Graphics3D_API;\nusing namespace WebCore;\n\n\/*FIXME\nusing WebKit::WebConsoleMessage;\nusing WebKit::WebFrame;\nusing WebKit::WebPluginContainer;\nusing WebKit::WebString;\n*\/\n\nnamespace webkit {\nnamespace ppapi {\n\nnamespace {\nconst int32 kCommandBufferSize = 1024 * 1024;\nconst int32 kTransferBufferSize = 1024 * 1024;\n\nPP_Bool ShmToHandle(base::SharedMemory* shm,\n                    size_t size,\n                    int* shm_handle,\n                    uint32_t* shm_size) {\n  if (!shm || !shm_handle || !shm_size)\n    return PP_FALSE;\n#if defined(OS_POSIX)\n  *shm_handle = shm->handle().fd;\n#elif defined(OS_WIN)\n  *shm_handle = reinterpret_cast<int>(shm->handle());\n#else\n  #error \"Platform not supported.\"\n#endif\n  *shm_size = size;\n  return PP_TRUE;\n}\n\nPP_Graphics3DTrustedState PPStateFromGPUState(\n    const gpu::CommandBuffer::State& s) {\n  PP_Graphics3DTrustedState state = {\n      s.num_entries,\n      s.get_offset,\n      s.put_offset,\n      s.token,\n      static_cast<PPB_Graphics3DTrustedError>(s.error),\n      s.generation\n  };\n  return state;\n}\n}  \/\/ namespace.\n\nPPB_Graphics3D_Impl::PPB_Graphics3D_Impl(PP_Instance instance)\n    : PPB_Graphics3D_Shared(instance),\n      bound_to_instance_(false),\n      commit_pending_(false),\n      weak_ptr_factory_(ALLOW_THIS_IN_INITIALIZER_LIST(this)) {\n}\n\nPPB_Graphics3D_Impl::~PPB_Graphics3D_Impl() {\n  DestroyGLES2Impl();\n}\n\n\/\/ static\nPP_Bool PPB_Graphics3D_Impl::IsGpuBlacklisted() {\n  CommandLine* command_line = CommandLine::ForCurrentProcess();\n  if (command_line)\n    return PP_FromBool(\n        command_line->HasSwitch(switches::kDisablePepper3d));\n  return PP_TRUE;\n}\n\n\/\/ static\nPP_Resource PPB_Graphics3D_Impl::Create(PP_Instance instance,\n                                        PP_Resource share_context,\n                                        const int32_t* attrib_list) {\n  PPB_Graphics3D_API* share_api = NULL;\n  if (IsGpuBlacklisted())\n    return 0;\n  if (share_context) {\n    EnterResourceNoLock<PPB_Graphics3D_API> enter(share_context, true);\n    if (enter.failed())\n      return 0;\n    share_api = enter.object();\n  }\n  scoped_refptr<PPB_Graphics3D_Impl> graphics_3d(\n      new PPB_Graphics3D_Impl(instance));\n  if (!graphics_3d->Init(share_api, attrib_list))\n    return 0;\n  return graphics_3d->GetReference();\n}\n\n\/\/ static\nPP_Resource PPB_Graphics3D_Impl::CreateRaw(PP_Instance instance,\n                                           PP_Resource share_context,\n                                           const int32_t* attrib_list) {\n  PPB_Graphics3D_API* share_api = NULL;\n  if (IsGpuBlacklisted())\n    return 0;\n  if (share_context) {\n    EnterResourceNoLock<PPB_Graphics3D_API> enter(share_context, true);\n    if (enter.failed())\n      return 0;\n    share_api = enter.object();\n  }\n  scoped_refptr<PPB_Graphics3D_Impl> graphics_3d(\n      new PPB_Graphics3D_Impl(instance));\n  if (!graphics_3d->InitRaw(share_api, attrib_list))\n    return 0;\n  return graphics_3d->GetReference();\n}\n\nPP_Bool PPB_Graphics3D_Impl::InitCommandBuffer() {\n  return PP_FromBool(GetCommandBuffer()->Initialize());\n}\n\nPP_Bool PPB_Graphics3D_Impl::SetGetBuffer(int32_t transfer_buffer_id) {\n  GetCommandBuffer()->SetGetBuffer(transfer_buffer_id);\n  return PP_TRUE;\n}\n\nPP_Graphics3DTrustedState PPB_Graphics3D_Impl::GetState() {\n  return PPStateFromGPUState(GetCommandBuffer()->GetState());\n}\n\nint32_t PPB_Graphics3D_Impl::CreateTransferBuffer(uint32_t size) {\n  int32_t id = -1;\n  GetCommandBuffer()->CreateTransferBuffer(size, &id);\n  return id;\n}\n\nPP_Bool PPB_Graphics3D_Impl::DestroyTransferBuffer(int32_t id) {\n  GetCommandBuffer()->DestroyTransferBuffer(id);\n  return PP_TRUE;\n}\n\nPP_Bool PPB_Graphics3D_Impl::GetTransferBuffer(int32_t id,\n                                               int* shm_handle,\n                                               uint32_t* shm_size) {\n  gpu::Buffer buffer = GetCommandBuffer()->GetTransferBuffer(id);\n  return ShmToHandle(buffer.shared_memory, buffer.size, shm_handle, shm_size);\n}\n\nPP_Bool PPB_Graphics3D_Impl::Flush(int32_t put_offset) {\n  GetCommandBuffer()->Flush(put_offset);\n  return PP_TRUE;\n}\n\nPP_Graphics3DTrustedState PPB_Graphics3D_Impl::FlushSync(int32_t put_offset) {\n  gpu::CommandBuffer::State state = GetCommandBuffer()->GetState();\n  return PPStateFromGPUState(\n      GetCommandBuffer()->FlushSync(put_offset, state.get_offset));\n}\n\nPP_Graphics3DTrustedState PPB_Graphics3D_Impl::FlushSyncFast(\n    int32_t put_offset,\n    int32_t last_known_get) {\n  return PPStateFromGPUState(\n      GetCommandBuffer()->FlushSync(put_offset, last_known_get));\n}\n\nbool PPB_Graphics3D_Impl::BindToInstance(bool bind) {\n  bound_to_instance_ = bind;\n  return true;\n}\n\nunsigned int PPB_Graphics3D_Impl::GetBackingTextureId() {\n  return platform_context_->GetBackingTextureId();\n}\n\nbool PPB_Graphics3D_Impl::IsOpaque() {\n  return platform_context_->IsOpaque();\n}\n\nvoid PPB_Graphics3D_Impl::ViewWillInitiatePaint() {\n}\n\nvoid PPB_Graphics3D_Impl::ViewInitiatedPaint() {\n  commit_pending_ = false;\n\n  if (HasPendingSwap())\n    SwapBuffersACK(PP_OK);\n}\n\nvoid PPB_Graphics3D_Impl::ViewFlushedPaint() {\n}\n\ngpu::CommandBuffer* PPB_Graphics3D_Impl::GetCommandBuffer() {\n  return platform_context_->GetCommandBuffer();\n}\n\nint32 PPB_Graphics3D_Impl::DoSwapBuffers() {\n  \/\/ We do not have a GLES2 implementation when using an OOP proxy.\n  \/\/ The plugin-side proxy is responsible for adding the SwapBuffers command\n  \/\/ to the command buffer in that case.\n  if (gles2_impl())\n    gles2_impl()->SwapBuffers();\n\n  if (bound_to_instance_) {\n    \/\/ If we are bound to the instance, we need to ask the compositor\n    \/\/ to commit our backing texture so that the graphics appears on the page.\n    \/\/ When the backing texture will be committed we get notified via\n    \/\/ ViewFlushedPaint().\n    \/\/\n    \/\/ Don't need to check for NULL from GetPluginInstance since when we're\n    \/\/ bound, we know our instance is valid.\n    ResourceHelper::GetPluginInstance(this)->CommitBackingTexture();\n    commit_pending_ = true;\n  } else {\n    \/\/ Wait for the command to complete on the GPU to allow for throttling.\n    platform_context_->Echo(base::Bind(&PPB_Graphics3D_Impl::OnSwapBuffers,\n                                       weak_ptr_factory_.GetWeakPtr()));\n  }\n\n  MessageLoop::current()->PostDelayedTask(FROM_HERE, base::Bind(\n      &PPB_Graphics3D_Impl::OnSwapBuffers, weak_ptr_factory_.GetWeakPtr()), base::TimeDelta::FromMilliseconds(1000\/60)); \/\/ 60 FPS\n\n  return PP_OK_COMPLETIONPENDING;\n}\n\nbool PPB_Graphics3D_Impl::Init(PPB_Graphics3D_API* share_context,\n                               const int32_t* attrib_list) {\n  if (!InitRaw(share_context, attrib_list))\n    return false;\n\n  gpu::CommandBuffer* command_buffer = GetCommandBuffer();\n  if (!command_buffer->Initialize())\n    return false;\n\n  gpu::gles2::GLES2Implementation* share_gles2 = NULL;\n  if (share_context) {\n    share_gles2 =\n        static_cast<PPB_Graphics3D_Shared*>(share_context)->gles2_impl();\n  }\n\n  if (!CreateGLES2Impl(kCommandBufferSize, kTransferBufferSize,\n                         share_gles2))\n    return false;\n\n  WebKit::PepperPluginContainer* container =\n      ResourceHelper::GetPluginInstance(this)->container();\n  if (!container)\n    return false;\n  gles2_impl()->CreateContext(attrib_list, container->element()->document()->view()->root()->hostWindow());\n  return true;\n}\n\nbool PPB_Graphics3D_Impl::InitRaw(PPB_Graphics3D_API* share_context,\n                                  const int32_t* attrib_list) {\n  PluginInstance* plugin_instance = ResourceHelper::GetPluginInstance(this);\n  if (!plugin_instance)\n    return false;\n\n  PluginDelegate::PlatformContext3D* share_platform_context = NULL;\n  if (share_context) {\n    PPB_Graphics3D_Impl* share_graphics =\n        static_cast<PPB_Graphics3D_Impl*>(share_context);\n    share_platform_context = share_graphics->platform_context();\n  }\n\n  platform_context_.reset(plugin_instance->CreateContext3D());\n  if (!platform_context_.get())\n    return false;\n\n  if (!platform_context_->Init(attrib_list, share_platform_context))\n    return false;\n\n  platform_context_->SetContextLostCallback(\n      base::Bind(&PPB_Graphics3D_Impl::OnContextLost,\n                 weak_ptr_factory_.GetWeakPtr()));\n\n  platform_context_->SetOnConsoleMessageCallback(\n      base::Bind(&PPB_Graphics3D_Impl::OnConsoleMessage,\n                 weak_ptr_factory_.GetWeakPtr()));\n  return true;\n}\n\nvoid PPB_Graphics3D_Impl::OnConsoleMessage(const std::string& message,\n                                           int id) {\n  if (!bound_to_instance_)\n    return;\n  WebKit::PepperPluginContainer* container =\n      ResourceHelper::GetPluginInstance(this)->container();\n  if (!container)\n    return;\n  Frame* frame = container->element()->document()->frame();\n  if (!frame)\n    return;\n  container->element()->document()->addConsoleMessage(OtherMessageSource, ErrorMessageLevel, message.c_str());\n}\n\nvoid PPB_Graphics3D_Impl::OnSwapBuffers() {\n  if (HasPendingSwap()) {\n    \/\/ If we're off-screen, no need to trigger and wait for compositing.\n    \/\/ Just send the swap-buffers ACK to the plugin immediately.\n    commit_pending_ = false;\n    SwapBuffersACK(PP_OK);\n  }\n}\n\nvoid PPB_Graphics3D_Impl::OnContextLost() {\n  \/\/ Don't need to check for NULL from GetPluginInstance since when we're\n  \/\/ bound, we know our instance is valid.\n  if (bound_to_instance_)\n    ResourceHelper::GetPluginInstance(this)->BindGraphics(pp_instance(), 0);\n\n  \/\/ Send context lost to plugin. This may have been caused by a PPAPI call, so\n  \/\/ avoid re-entering.\n  MessageLoop::current()->PostTask(FROM_HERE, base::Bind(\n      &PPB_Graphics3D_Impl::SendContextLost, weak_ptr_factory_.GetWeakPtr()));\n}\n\nvoid PPB_Graphics3D_Impl::SendContextLost() {\n  \/\/ By the time we run this, the instance may have been deleted, or in the\n  \/\/ process of being deleted. Even in the latter case, we don't want to send a\n  \/\/ callback after DidDestroy.\n  PluginInstance* instance = ResourceHelper::GetPluginInstance(this);\n  if (!instance || !instance->container())\n    return;\n\n  const PPP_Graphics3D* ppp_graphics_3d =\n      static_cast<const PPP_Graphics3D*>(\n          instance->module()->GetPluginInterface(\n              PPP_GRAPHICS_3D_INTERFACE));\n  if (ppp_graphics_3d)\n    ppp_graphics_3d->Graphics3DContextLost(pp_instance());\n}\n\n}  \/\/ namespace ppapi\n}  \/\/ namespace webkit\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Enable TCMalloc<commit_after><|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\/comploader.h>\n#include <tnt\/componentfactory.h>\n#include <tnt\/tntconfig.h>\n#include <tnt\/httperror.h>\n#include <tnt\/util.h>\n#include <cxxtools\/log.h>\n#include <cxxtools\/dlloader.h>\n#include <stdlib.h>\n\nnamespace\n{\n  cxxtools::ReadWriteMutex mutex;\n}\n\nnamespace tnt\n{\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ ComponentLibrary\n\/\/\nlog_define(\"tntnet.comploader\")\n\nvoid* ComponentLibrary::dlopen(const std::string& name, bool local)\n{\n  log_debug(\"dlopen <\" << name << \">, \" << local);\n\n  int flags = local ? RTLD_NOW|RTLD_LOCAL: RTLD_NOW|RTLD_GLOBAL;\n  std::string n = name;\n  if (!n.empty() && n[0] == '!')\n  {\n    flags = RTLD_NOW|RTLD_GLOBAL;\n    n.erase(0, 1);\n    log_debug(\"dlopen => <\" << n << '>');\n  }\n\n  void* ret = ::dlopen((n + \".so\").c_str(), flags);\n  if (ret != 0)\n  {\n    log_info(\"library \\\"\" << n << \".so\\\"\");\n    return ret;\n  }\n\n  ret = ::dlopen((n + \".a\").c_str(), flags);\n  if (ret != 0)\n  {\n    log_info(\"library \\\"\" << n << \".a\\\"\");\n    return ret;\n  }\n\n  ret = ::dlopen((n + \".dll\").c_str(), flags);\n  if (ret != 0)\n  {\n    log_info(\"library \\\"\" << n << \".dll\\\"\");\n    return ret;\n  }\n\n  ret = ::dlopen(n.c_str(), flags);\n  if (ret == 0)\n    log_warn(\"failed to load library \\\"\" << n << '\"');\n  else\n    log_info(\"library \\\"\" << n << \"\\\"\");\n\n  return ret;\n}\n\nvoid ComponentLibrary::init(const std::string& name, bool local)\n{\n  void* handle = dlopen(name, local);\n  if (handle)\n    handlePtr = new HandleType(handle);\n}\n\nComponent* ComponentLibrary::create(\n  const std::string& component_name, Comploader& cl,\n  const Urlmapper& rootmapper)\n{\n  log_debug(\"create \\\"\" << component_name << '\"');\n\n  ComponentFactory* factory;\n\n  \/\/ look for factory in my map\n  factoryMapType::const_iterator i = factoryMap.find(component_name);\n  if (i == factoryMap.end())\n    throw NotFoundException(component_name);\n\n  factory = i->second;\n\n  \/\/ call the creator\n  Compident ci = Compident(libname, component_name);\n  log_debug(\"call creator for \\\"\" << ci << '\"');\n\n  return factory->create(ci, rootmapper, cl);\n}\n\nLangLib::PtrType ComponentLibrary::getLangLib(const std::string& lang)\n{\n  cxxtools::ReadLock rlock(mutex);\n  langlibsType::const_iterator it = langlibs.find(lang);\n  if (it != langlibs.end())\n    return it->second;\n\n  rlock.unlock();\n  cxxtools::WriteLock wlock(mutex);\n\n  LangLib::PtrType l;\n  try\n  {\n    std::string n = (path.empty() ? libname : (path + '\/' + libname));\n    l = new LangLib(n, lang);\n  }\n  catch (const unzipError& e)\n  {\n    log_warn(\"unzipError: \" << e.what());\n  }\n  langlibs[lang] = l;\n  return l;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Comploader\n\/\/\nComploader::Comploader()\n{\n  if (config)\n  {\n    Tntconfig::config_entries_type configLoad;\n    config->getConfigValues(\"Load\", configLoad);\n\n    for (Tntconfig::config_entries_type::const_iterator it = configLoad.begin();\n         it != configLoad.end(); ++it)\n    {\n      if (it->params.empty())\n        throwRuntimeError(\"missing libraryname in Load-command\");\n      fetchLib(it->params[0]);\n    }\n  }\n}\n\nComploader::librarymap_type& Comploader::getLibrarymap()\n{\n  static librarymap_type librarymap;\n  return librarymap;\n}\n\nstatic const Tntconfig emptyconfig;\nconst Tntconfig* Comploader::config = &emptyconfig;\nComploader::search_path_type Comploader::search_path;\nComponentLibrary::factoryMapType* Comploader::currentFactoryMap = 0;\n\nComponent& Comploader::fetchComp(const Compident& ci,\n  const Urlmapper& rootmapper)\n{\n  log_debug(\"fetchComp \\\"\" << ci << '\"');\n\n  cxxtools::ReadLock rlock(mutex);\n  cxxtools::WriteLock wlock(mutex, false);\n\n  \/\/ lookup Component\n  componentmap_type::iterator it = componentmap.find(ci);\n  if (it == componentmap.end())\n  {\n    rlock.unlock();\n    wlock.lock();\n    componentmap_type::iterator it = componentmap.find(ci);\n    if (it == componentmap.end())\n    {\n      ComponentLibrary& lib = fetchLib(ci.libname);\n      Component* comp = lib.create(ci.compname, *this, rootmapper);\n\n      componentmap[ci] = comp;\n      return *comp;\n    }\n  }\n\n  return *(it->second);\n}\n\nComponent* Comploader::createComp(const Compident& ci,\n  const Urlmapper& rootmapper)\n{\n  log_debug(\"createComp \\\"\" << ci << '\"');\n\n  ComponentLibrary& lib = fetchLib(ci.libname);\n  Component* comp = lib.create(ci.compname, *this, rootmapper);\n  return comp;\n}\n\nconst char* Comploader::getLangData(const Compident& ci,\n  const std::string& lang)\n{\n  log_debug(\"getLangData(\" << ci << \", \\\"\" << lang << \"\\\")\");\n  ComponentLibrary& lib = fetchLib(ci.libname);\n  LangLib::PtrType langLib = lib.getLangLib(lang);\n  if (langLib)\n    return langLib->getData(ci.compname);\n  else\n    return 0;\n}\n\nnamespace\n{\n  template <typename T>\n  class ValueResetter\n  {\n      T& value;\n      T null;\n\n    public:\n      explicit ValueResetter(T& value_, T null_ = T())\n        : value(value_),\n          null(null_)\n          { }\n      ~ValueResetter()\n      { value = null; }\n  };\n}\n\nComponentLibrary& Comploader::fetchLib(const std::string& libname)\n{\n  log_debug(\"fetchLib \\\"\" << libname << '\"');\n\n  std::string n = libname;\n  bool local = false;\n  if (!n.empty() && n[0] == '!')\n  {\n    local = true;\n    n.erase(0, 1);\n  }\n\n  librarymap_type& librarymap = getLibrarymap();\n  librarymap_type::iterator it = librarymap.find(n);\n  if (it == librarymap.end())\n  {\n    ComponentLibrary::factoryMapType factoryMap;\n    currentFactoryMap = &factoryMap;\n    ValueResetter<ComponentLibrary::factoryMapType*> valueResetter(currentFactoryMap, 0);\n\n    \/\/ load library\n    log_info(\"load library \\\"\" << n << '\"');\n    ComponentLibrary lib;\n\n    for (search_path_type::const_iterator p = search_path.begin();\n         !lib && p != search_path.end(); ++p)\n    {\n      log_debug(\"load library \\\"\" << n << \"\\\" from \" << *p << \" dir\");\n      lib = ComponentLibrary(*p, n, local);\n    }\n\n    if (!lib)\n    {\n      log_debug(\"load library \\\"\" << n << \"\\\" from current dir\");\n      lib = ComponentLibrary(\".\", n, local);\n    }\n\n#ifdef PKGLIBDIR\n    if (!lib)\n    {\n      log_debug(\"load library \\\"\" << n << \"\\\" from package lib dir <\" << PKGLIBDIR << '>');\n      lib = ComponentLibrary(PKGLIBDIR, n, local);\n    }\n#endif\n\n    if (!lib)\n    {\n      log_debug(\"library \\\"\" << n << \"\\\" in current dir not found - search lib-path\");\n      lib = ComponentLibrary(n, local);\n    }\n\n    if (!lib)\n      throw LibraryNotFound(n);\n\n    lib.factoryMap = factoryMap;\n    log_debug(\"insert new library \" << n);\n    it = librarymap.insert(librarymap_type::value_type(n, lib)).first;\n  }\n  else\n    log_debug(\"library \" << n << \" found\");\n\n  return it->second;\n}\n\nvoid Comploader::configure(const Tntconfig& config_)\n{\n  config = &config_;\n\n  Tntconfig::config_entries_type compPath;\n  config_.getConfigValues(\"CompPath\", compPath);\n  for (Tntconfig::config_entries_type::const_iterator it = compPath.begin();\n       it != compPath.end(); ++it)\n  {\n    if (it->params.size() > 0)\n      search_path.push_back(it->params[0]);\n  }\n}\n\nvoid Comploader::registerFactory(const std::string& component_name,\n  ComponentFactory* factory)\n{\n  log_debug(\"Comploader::registerFactory(\" << component_name << \", \" << factory << ')');\n\n  if (currentFactoryMap)\n    currentFactoryMap->insert(ComponentLibrary::factoryMapType::value_type(component_name, factory));\n  else\n  {\n    librarymap_type& librarymap = getLibrarymap();\n    log_debug(\"register component without library-name\");\n    librarymap_type::iterator it = librarymap.find(std::string());\n    if (it == librarymap.end())\n    {\n      \/\/ empty library not in map - create a new empty library-object\n      it = librarymap.insert(\n        librarymap_type::value_type(std::string(),\n                                    ComponentLibrary())).first;\n    }\n    it->second.registerFactory(component_name, factory);\n  }\n}\n\n}\n<commit_msg>fix for a very old bug, which may cause a crash under very rare cicrumstances<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\/comploader.h>\n#include <tnt\/componentfactory.h>\n#include <tnt\/tntconfig.h>\n#include <tnt\/httperror.h>\n#include <tnt\/util.h>\n#include <cxxtools\/log.h>\n#include <cxxtools\/dlloader.h>\n#include <stdlib.h>\n\nnamespace\n{\n  cxxtools::ReadWriteMutex mutex;\n}\n\nnamespace tnt\n{\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ ComponentLibrary\n\/\/\nlog_define(\"tntnet.comploader\")\n\nvoid* ComponentLibrary::dlopen(const std::string& name, bool local)\n{\n  log_debug(\"dlopen <\" << name << \">, \" << local);\n\n  int flags = local ? RTLD_NOW|RTLD_LOCAL: RTLD_NOW|RTLD_GLOBAL;\n  std::string n = name;\n  if (!n.empty() && n[0] == '!')\n  {\n    flags = RTLD_NOW|RTLD_GLOBAL;\n    n.erase(0, 1);\n    log_debug(\"dlopen => <\" << n << '>');\n  }\n\n  void* ret = ::dlopen((n + \".so\").c_str(), flags);\n  if (ret != 0)\n  {\n    log_info(\"library \\\"\" << n << \".so\\\"\");\n    return ret;\n  }\n\n  ret = ::dlopen((n + \".a\").c_str(), flags);\n  if (ret != 0)\n  {\n    log_info(\"library \\\"\" << n << \".a\\\"\");\n    return ret;\n  }\n\n  ret = ::dlopen((n + \".dll\").c_str(), flags);\n  if (ret != 0)\n  {\n    log_info(\"library \\\"\" << n << \".dll\\\"\");\n    return ret;\n  }\n\n  ret = ::dlopen(n.c_str(), flags);\n  if (ret == 0)\n    log_warn(\"failed to load library \\\"\" << n << '\"');\n  else\n    log_info(\"library \\\"\" << n << \"\\\"\");\n\n  return ret;\n}\n\nvoid ComponentLibrary::init(const std::string& name, bool local)\n{\n  void* handle = dlopen(name, local);\n  if (handle)\n    handlePtr = new HandleType(handle);\n}\n\nComponent* ComponentLibrary::create(\n  const std::string& component_name, Comploader& cl,\n  const Urlmapper& rootmapper)\n{\n  log_debug(\"create \\\"\" << component_name << '\"');\n\n  ComponentFactory* factory;\n\n  \/\/ look for factory in my map\n  factoryMapType::const_iterator i = factoryMap.find(component_name);\n  if (i == factoryMap.end())\n    throw NotFoundException(component_name);\n\n  factory = i->second;\n\n  \/\/ call the creator\n  Compident ci = Compident(libname, component_name);\n  log_debug(\"call creator for \\\"\" << ci << '\"');\n\n  return factory->create(ci, rootmapper, cl);\n}\n\nLangLib::PtrType ComponentLibrary::getLangLib(const std::string& lang)\n{\n  cxxtools::ReadLock rlock(mutex);\n  langlibsType::const_iterator it = langlibs.find(lang);\n  if (it != langlibs.end())\n    return it->second;\n\n  rlock.unlock();\n  cxxtools::WriteLock wlock(mutex);\n\n  LangLib::PtrType l;\n  try\n  {\n    std::string n = (path.empty() ? libname : (path + '\/' + libname));\n    l = new LangLib(n, lang);\n  }\n  catch (const unzipError& e)\n  {\n    log_warn(\"unzipError: \" << e.what());\n  }\n  langlibs[lang] = l;\n  return l;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Comploader\n\/\/\nComploader::Comploader()\n{\n  if (config)\n  {\n    Tntconfig::config_entries_type configLoad;\n    config->getConfigValues(\"Load\", configLoad);\n\n    for (Tntconfig::config_entries_type::const_iterator it = configLoad.begin();\n         it != configLoad.end(); ++it)\n    {\n      if (it->params.empty())\n        throwRuntimeError(\"missing libraryname in Load-command\");\n      fetchLib(it->params[0]);\n    }\n  }\n}\n\nComploader::librarymap_type& Comploader::getLibrarymap()\n{\n  static librarymap_type librarymap;\n  return librarymap;\n}\n\nstatic const Tntconfig emptyconfig;\nconst Tntconfig* Comploader::config = &emptyconfig;\nComploader::search_path_type Comploader::search_path;\nComponentLibrary::factoryMapType* Comploader::currentFactoryMap = 0;\n\nComponent& Comploader::fetchComp(const Compident& ci,\n  const Urlmapper& rootmapper)\n{\n  log_debug(\"fetchComp \\\"\" << ci << '\"');\n\n  cxxtools::ReadLock rlock(mutex);\n  cxxtools::WriteLock wlock(mutex, false);\n\n  \/\/ lookup Component\n  componentmap_type::iterator it = componentmap.find(ci);\n  if (it == componentmap.end())\n  {\n    rlock.unlock();\n    wlock.lock();\n    it = componentmap.find(ci);\n    if (it == componentmap.end())\n    {\n      ComponentLibrary& lib = fetchLib(ci.libname);\n      Component* comp = lib.create(ci.compname, *this, rootmapper);\n\n      componentmap[ci] = comp;\n      return *comp;\n    }\n  }\n\n  return *(it->second);\n}\n\nComponent* Comploader::createComp(const Compident& ci,\n  const Urlmapper& rootmapper)\n{\n  log_debug(\"createComp \\\"\" << ci << '\"');\n\n  ComponentLibrary& lib = fetchLib(ci.libname);\n  Component* comp = lib.create(ci.compname, *this, rootmapper);\n  return comp;\n}\n\nconst char* Comploader::getLangData(const Compident& ci,\n  const std::string& lang)\n{\n  log_debug(\"getLangData(\" << ci << \", \\\"\" << lang << \"\\\")\");\n  ComponentLibrary& lib = fetchLib(ci.libname);\n  LangLib::PtrType langLib = lib.getLangLib(lang);\n  if (langLib)\n    return langLib->getData(ci.compname);\n  else\n    return 0;\n}\n\nnamespace\n{\n  template <typename T>\n  class ValueResetter\n  {\n      T& value;\n      T null;\n\n    public:\n      explicit ValueResetter(T& value_, T null_ = T())\n        : value(value_),\n          null(null_)\n          { }\n      ~ValueResetter()\n      { value = null; }\n  };\n}\n\nComponentLibrary& Comploader::fetchLib(const std::string& libname)\n{\n  log_debug(\"fetchLib \\\"\" << libname << '\"');\n\n  std::string n = libname;\n  bool local = false;\n  if (!n.empty() && n[0] == '!')\n  {\n    local = true;\n    n.erase(0, 1);\n  }\n\n  librarymap_type& librarymap = getLibrarymap();\n  librarymap_type::iterator it = librarymap.find(n);\n  if (it == librarymap.end())\n  {\n    ComponentLibrary::factoryMapType factoryMap;\n    currentFactoryMap = &factoryMap;\n    ValueResetter<ComponentLibrary::factoryMapType*> valueResetter(currentFactoryMap, 0);\n\n    \/\/ load library\n    log_info(\"load library \\\"\" << n << '\"');\n    ComponentLibrary lib;\n\n    for (search_path_type::const_iterator p = search_path.begin();\n         !lib && p != search_path.end(); ++p)\n    {\n      log_debug(\"load library \\\"\" << n << \"\\\" from \" << *p << \" dir\");\n      lib = ComponentLibrary(*p, n, local);\n    }\n\n    if (!lib)\n    {\n      log_debug(\"load library \\\"\" << n << \"\\\" from current dir\");\n      lib = ComponentLibrary(\".\", n, local);\n    }\n\n#ifdef PKGLIBDIR\n    if (!lib)\n    {\n      log_debug(\"load library \\\"\" << n << \"\\\" from package lib dir <\" << PKGLIBDIR << '>');\n      lib = ComponentLibrary(PKGLIBDIR, n, local);\n    }\n#endif\n\n    if (!lib)\n    {\n      log_debug(\"library \\\"\" << n << \"\\\" in current dir not found - search lib-path\");\n      lib = ComponentLibrary(n, local);\n    }\n\n    if (!lib)\n      throw LibraryNotFound(n);\n\n    lib.factoryMap = factoryMap;\n    log_debug(\"insert new library \" << n);\n    it = librarymap.insert(librarymap_type::value_type(n, lib)).first;\n  }\n  else\n    log_debug(\"library \" << n << \" found\");\n\n  return it->second;\n}\n\nvoid Comploader::configure(const Tntconfig& config_)\n{\n  config = &config_;\n\n  Tntconfig::config_entries_type compPath;\n  config_.getConfigValues(\"CompPath\", compPath);\n  for (Tntconfig::config_entries_type::const_iterator it = compPath.begin();\n       it != compPath.end(); ++it)\n  {\n    if (it->params.size() > 0)\n      search_path.push_back(it->params[0]);\n  }\n}\n\nvoid Comploader::registerFactory(const std::string& component_name,\n  ComponentFactory* factory)\n{\n  log_debug(\"Comploader::registerFactory(\" << component_name << \", \" << factory << ')');\n\n  if (currentFactoryMap)\n    currentFactoryMap->insert(ComponentLibrary::factoryMapType::value_type(component_name, factory));\n  else\n  {\n    librarymap_type& librarymap = getLibrarymap();\n    log_debug(\"register component without library-name\");\n    librarymap_type::iterator it = librarymap.find(std::string());\n    if (it == librarymap.end())\n    {\n      \/\/ empty library not in map - create a new empty library-object\n      it = librarymap.insert(\n        librarymap_type::value_type(std::string(),\n                                    ComponentLibrary())).first;\n    }\n    it->second.registerFactory(component_name, factory);\n  }\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* comploader.cpp\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 * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received 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\n#include <tnt\/comploader.h>\n#include <tnt\/componentfactory.h>\n#include <tnt\/tntconfig.h>\n#include <tnt\/httperror.h>\n#include <tnt\/util.h>\n#include <cxxtools\/log.h>\n#include <cxxtools\/dlloader.h>\n#include <stdlib.h>\n\nnamespace\n{\n  cxxtools::Mutex mutex;\n}\n\nnamespace tnt\n{\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ ComponentLibrary\n\/\/\nlog_define(\"tntnet.comploader\")\n\nvoid* ComponentLibrary::dlopen(const std::string& name)\n{\n  log_debug(\"dlopen <\" << name << '>');\n\n  void* ret = ::dlopen((name + \".so\").c_str(), RTLD_NOW|RTLD_LOCAL);\n  if (ret != 0)\n  {\n    log_debug(\"library \\\"\" << name << \".so\\\" successfully opened\");\n    return ret;\n  }\n\n  ret = ::dlopen((name + \".a\").c_str(), RTLD_NOW|RTLD_LOCAL);\n  if (ret != 0)\n  {\n    log_debug(\"library \\\"\" << name << \".a\\\" successfully opened\");\n    return ret;\n  }\n\n  ret = ::dlopen((name + \".dll\").c_str(), RTLD_NOW|RTLD_LOCAL);\n  if (ret != 0)\n  {\n    log_debug(\"library \\\"\" << name << \".dll\\\" successfully opened\");\n    return ret;\n  }\n\n  ret = ::dlopen(name.c_str(), RTLD_NOW|RTLD_LOCAL);\n  if (ret == 0)\n    log_warn(\"failed to load library \\\"\" << name << '\"');\n  else\n    log_debug(\"library \\\"\" << name << \"\\\" successfully opened\");\n\n  return ret;\n}\n\nvoid ComponentLibrary::init(const std::string& name)\n{\n  void* handle = dlopen(name);\n  if (handle)\n    handlePtr = new HandleType(handle);\n}\n\nComponent* ComponentLibrary::create(\n  const std::string& component_name, Comploader& cl,\n  const Urlmapper& rootmapper)\n{\n  log_debug(\"create \\\"\" << component_name << '\"');\n\n  ComponentFactory* factory;\n\n  \/\/ look for factory in my map\n  factoryMapType::const_iterator i = factoryMap.find(component_name);\n  if (i == factoryMap.end())\n    throw NotFoundException(component_name);\n\n  factory = i->second;\n\n  \/\/ call the creator\n  Compident ci = Compident(libname, component_name);\n  log_debug(\"call creator for \\\"\" << ci << '\"');\n\n  return factory->create(ci, rootmapper, cl);\n}\n\nLangLib::PtrType ComponentLibrary::getLangLib(const std::string& lang)\n{\n  cxxtools::MutexLock lock(mutex);\n  langlibsType::const_iterator it = langlibs.find(lang);\n  if (it != langlibs.end())\n    return it->second;\n\n  LangLib::PtrType l;\n  try\n  {\n    std::string n = (path.empty() ? libname : (path + '\/' + libname));\n    l = new LangLib(n, lang);\n  }\n  catch (const unzipError& e)\n  {\n    log_warn(\"unzipError: \" << e.what());\n  }\n  langlibs[lang] = l;\n  return l;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Comploader\n\/\/\nComploader::Comploader()\n{\n  if (config)\n  {\n    Tntconfig::config_entries_type configLoad;\n    config->getConfigValues(\"Load\", configLoad);\n\n    for (Tntconfig::config_entries_type::const_iterator it = configLoad.begin();\n         it != configLoad.end(); ++it)\n    {\n      if (it->params.empty())\n        throwRuntimeError(\"missing libraryname in Load-command\");\n      fetchLib(it->params[0]);\n    }\n  }\n}\n\nComploader::librarymap_type& Comploader::getLibrarymap()\n{\n  static librarymap_type librarymap;\n  return librarymap;\n}\n\nstatic const Tntconfig emptyconfig;\nconst Tntconfig* Comploader::config = &emptyconfig;\nComploader::search_path_type Comploader::search_path;\nComponentLibrary::factoryMapType* Comploader::currentFactoryMap = 0;\n\nComponent& Comploader::fetchComp(const Compident& ci,\n  const Urlmapper& rootmapper)\n{\n  log_debug(\"fetchComp \\\"\" << ci << '\"');\n\n  cxxtools::MutexLock lock(mutex);\n\n  \/\/ lookup Component\n  componentmap_type::iterator it = componentmap.find(ci);\n  if (it == componentmap.end())\n  {\n    ComponentLibrary& lib = fetchLib(ci.libname);\n    Component* comp = lib.create(ci.compname, *this, rootmapper);\n\n    componentmap[ci] = comp;\n    return *comp;\n  }\n  else\n    return *(it->second);\n}\n\nComponent* Comploader::createComp(const Compident& ci,\n  const Urlmapper& rootmapper)\n{\n  log_debug(\"createComp \\\"\" << ci << '\"');\n\n  ComponentLibrary& lib = fetchLib(ci.libname);\n  Component* comp = lib.create(ci.compname, *this, rootmapper);\n  return comp;\n}\n\nconst char* Comploader::getLangData(const Compident& ci,\n  const std::string& lang)\n{\n  log_debug(\"getLangData(\" << ci << \", \\\"\" << lang << \"\\\")\");\n  ComponentLibrary& lib = fetchLib(ci.libname);\n  LangLib::PtrType langLib = lib.getLangLib(lang);\n  if (langLib)\n    return langLib->getData(ci.compname);\n  else\n    return 0;\n}\n\nnamespace\n{\n  template <typename T>\n  class ValueResetter\n  {\n      T& value;\n      T null;\n\n    public:\n      explicit ValueResetter(T& value_, T null_ = T())\n        : value(value_),\n          null(null_)\n          { }\n      ~ValueResetter()\n      { value = null; }\n  };\n}\n\nComponentLibrary& Comploader::fetchLib(const std::string& libname)\n{\n  log_debug(\"fetchLib \\\"\" << libname << '\"');\n\n  librarymap_type& librarymap = getLibrarymap();\n  librarymap_type::iterator it = librarymap.find(libname);\n  if (it == librarymap.end())\n  {\n    ComponentLibrary::factoryMapType factoryMap;\n    currentFactoryMap = &factoryMap;\n    ValueResetter<ComponentLibrary::factoryMapType*> valueResetter(currentFactoryMap, 0);\n\n    \/\/ load library\n    log_info(\"load library \\\"\" << libname << '\"');\n    ComponentLibrary lib;\n\n    for (search_path_type::const_iterator p = search_path.begin();\n         !lib && p != search_path.end(); ++p)\n    {\n      log_debug(\"load library \\\"\" << libname << \"\\\" from \" << *p << \" dir\");\n      lib = ComponentLibrary(*p, libname);\n    }\n\n#ifdef PKGLIBDIR\n    if (!lib)\n    {\n      log_debug(\"load library \\\"\" << libname << \"\\\" from package lib dir <\" << PKGLIBDIR << '>');\n      lib = ComponentLibrary(PKGLIBDIR, libname);\n    }\n#endif\n\n    if (!lib)\n    {\n      log_debug(\"load library \\\"\" << libname << \"\\\" from current dir\");\n      lib = ComponentLibrary(\".\", libname);\n    }\n\n    if (!lib)\n    {\n      log_debug(\"library \\\"\" << libname << \"\\\" in current dir not found - search lib-path\");\n      lib = ComponentLibrary(libname);\n    }\n\n    if (!lib)\n      throw LibraryNotFound(libname);\n\n    lib.factoryMap = factoryMap;\n    log_debug(\"insert new library \" << libname);\n    it = librarymap.insert(librarymap_type::value_type(libname, lib)).first;\n  }\n  else\n    log_debug(\"library \" << libname << \" found\");\n\n  return it->second;\n}\n\nvoid Comploader::configure(const Tntconfig& config_)\n{\n  config = &config_;\n\n  Tntconfig::config_entries_type compPath;\n  config_.getConfigValues(\"CompPath\", compPath);\n  for (Tntconfig::config_entries_type::const_iterator it = compPath.begin();\n       it != compPath.end(); ++it)\n  {\n    if (it->params.size() > 0)\n      search_path.push_back(it->params[0]);\n  }\n}\n\nvoid Comploader::registerFactory(const std::string& component_name,\n  ComponentFactory* factory)\n{\n  log_debug(\"Comploader::registerFactory(\" << component_name << \", \" << factory << ')');\n\n  if (currentFactoryMap)\n    currentFactoryMap->insert(ComponentLibrary::factoryMapType::value_type(component_name, factory));\n  else\n  {\n    librarymap_type& librarymap = getLibrarymap();\n    log_debug(\"register component without library-name\");\n    librarymap_type::iterator it = librarymap.find(std::string());\n    if (it == librarymap.end())\n    {\n      \/\/ empty library not in map - create a new empty library-object\n      it = librarymap.insert(\n        librarymap_type::value_type(std::string(),\n                                    ComponentLibrary())).first;\n    }\n    it->second.registerFactory(component_name, factory);\n  }\n}\n\n}\n<commit_msg>use read write mutex instead of mutex in component loader for better scalability<commit_after>\/* comploader.cpp\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 * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received 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\n#include <tnt\/comploader.h>\n#include <tnt\/componentfactory.h>\n#include <tnt\/tntconfig.h>\n#include <tnt\/httperror.h>\n#include <tnt\/util.h>\n#include <cxxtools\/log.h>\n#include <cxxtools\/dlloader.h>\n#include <stdlib.h>\n\nnamespace\n{\n  cxxtools::ReadWriteMutex mutex;\n}\n\nnamespace tnt\n{\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ ComponentLibrary\n\/\/\nlog_define(\"tntnet.comploader\")\n\nvoid* ComponentLibrary::dlopen(const std::string& name)\n{\n  log_debug(\"dlopen <\" << name << '>');\n\n  void* ret = ::dlopen((name + \".so\").c_str(), RTLD_NOW|RTLD_LOCAL);\n  if (ret != 0)\n  {\n    log_debug(\"library \\\"\" << name << \".so\\\" successfully opened\");\n    return ret;\n  }\n\n  ret = ::dlopen((name + \".a\").c_str(), RTLD_NOW|RTLD_LOCAL);\n  if (ret != 0)\n  {\n    log_debug(\"library \\\"\" << name << \".a\\\" successfully opened\");\n    return ret;\n  }\n\n  ret = ::dlopen((name + \".dll\").c_str(), RTLD_NOW|RTLD_LOCAL);\n  if (ret != 0)\n  {\n    log_debug(\"library \\\"\" << name << \".dll\\\" successfully opened\");\n    return ret;\n  }\n\n  ret = ::dlopen(name.c_str(), RTLD_NOW|RTLD_LOCAL);\n  if (ret == 0)\n    log_debug(\"failed to load library \\\"\" << name << '\"');\n  else\n    log_debug(\"library \\\"\" << name << \"\\\" successfully opened\");\n\n  return ret;\n}\n\nvoid ComponentLibrary::init(const std::string& name)\n{\n  void* handle = dlopen(name);\n  if (handle)\n    handlePtr = new HandleType(handle);\n}\n\nComponent* ComponentLibrary::create(\n  const std::string& component_name, Comploader& cl,\n  const Urlmapper& rootmapper)\n{\n  log_debug(\"create \\\"\" << component_name << '\"');\n\n  ComponentFactory* factory;\n\n  \/\/ look for factory in my map\n  factoryMapType::const_iterator i = factoryMap.find(component_name);\n  if (i == factoryMap.end())\n    throw NotFoundException(component_name);\n\n  factory = i->second;\n\n  \/\/ call the creator\n  Compident ci = Compident(libname, component_name);\n  log_debug(\"call creator for \\\"\" << ci << '\"');\n\n  return factory->create(ci, rootmapper, cl);\n}\n\nLangLib::PtrType ComponentLibrary::getLangLib(const std::string& lang)\n{\n  cxxtools::ReadLock rlock(mutex);\n  langlibsType::const_iterator it = langlibs.find(lang);\n  if (it != langlibs.end())\n    return it->second;\n\n  rlock.unlock();\n  cxxtools::WriteLock wlock(mutex);\n\n  LangLib::PtrType l;\n  try\n  {\n    std::string n = (path.empty() ? libname : (path + '\/' + libname));\n    l = new LangLib(n, lang);\n  }\n  catch (const unzipError& e)\n  {\n    log_warn(\"unzipError: \" << e.what());\n  }\n  langlibs[lang] = l;\n  return l;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Comploader\n\/\/\nComploader::Comploader()\n{\n  if (config)\n  {\n    Tntconfig::config_entries_type configLoad;\n    config->getConfigValues(\"Load\", configLoad);\n\n    for (Tntconfig::config_entries_type::const_iterator it = configLoad.begin();\n         it != configLoad.end(); ++it)\n    {\n      if (it->params.empty())\n        throwRuntimeError(\"missing libraryname in Load-command\");\n      fetchLib(it->params[0]);\n    }\n  }\n}\n\nComploader::librarymap_type& Comploader::getLibrarymap()\n{\n  static librarymap_type librarymap;\n  return librarymap;\n}\n\nstatic const Tntconfig emptyconfig;\nconst Tntconfig* Comploader::config = &emptyconfig;\nComploader::search_path_type Comploader::search_path;\nComponentLibrary::factoryMapType* Comploader::currentFactoryMap = 0;\n\nComponent& Comploader::fetchComp(const Compident& ci,\n  const Urlmapper& rootmapper)\n{\n  log_debug(\"fetchComp \\\"\" << ci << '\"');\n\n  cxxtools::ReadLock rlock(mutex);\n  cxxtools::WriteLock wlock(mutex, false);\n\n  \/\/ lookup Component\n  componentmap_type::iterator it = componentmap.find(ci);\n  if (it == componentmap.end())\n  {\n    rlock.unlock();\n    wlock.lock();\n    componentmap_type::iterator it = componentmap.find(ci);\n    if (it == componentmap.end())\n    {\n      ComponentLibrary& lib = fetchLib(ci.libname);\n      Component* comp = lib.create(ci.compname, *this, rootmapper);\n\n      componentmap[ci] = comp;\n      return *comp;\n    }\n  }\n\n  return *(it->second);\n}\n\nComponent* Comploader::createComp(const Compident& ci,\n  const Urlmapper& rootmapper)\n{\n  log_debug(\"createComp \\\"\" << ci << '\"');\n\n  ComponentLibrary& lib = fetchLib(ci.libname);\n  Component* comp = lib.create(ci.compname, *this, rootmapper);\n  return comp;\n}\n\nconst char* Comploader::getLangData(const Compident& ci,\n  const std::string& lang)\n{\n  log_debug(\"getLangData(\" << ci << \", \\\"\" << lang << \"\\\")\");\n  ComponentLibrary& lib = fetchLib(ci.libname);\n  LangLib::PtrType langLib = lib.getLangLib(lang);\n  if (langLib)\n    return langLib->getData(ci.compname);\n  else\n    return 0;\n}\n\nnamespace\n{\n  template <typename T>\n  class ValueResetter\n  {\n      T& value;\n      T null;\n\n    public:\n      explicit ValueResetter(T& value_, T null_ = T())\n        : value(value_),\n          null(null_)\n          { }\n      ~ValueResetter()\n      { value = null; }\n  };\n}\n\nComponentLibrary& Comploader::fetchLib(const std::string& libname)\n{\n  log_debug(\"fetchLib \\\"\" << libname << '\"');\n\n  librarymap_type& librarymap = getLibrarymap();\n  librarymap_type::iterator it = librarymap.find(libname);\n  if (it == librarymap.end())\n  {\n    ComponentLibrary::factoryMapType factoryMap;\n    currentFactoryMap = &factoryMap;\n    ValueResetter<ComponentLibrary::factoryMapType*> valueResetter(currentFactoryMap, 0);\n\n    \/\/ load library\n    log_info(\"load library \\\"\" << libname << '\"');\n    ComponentLibrary lib;\n\n    for (search_path_type::const_iterator p = search_path.begin();\n         !lib && p != search_path.end(); ++p)\n    {\n      log_debug(\"load library \\\"\" << libname << \"\\\" from \" << *p << \" dir\");\n      lib = ComponentLibrary(*p, libname);\n    }\n\n#ifdef PKGLIBDIR\n    if (!lib)\n    {\n      log_debug(\"load library \\\"\" << libname << \"\\\" from package lib dir <\" << PKGLIBDIR << '>');\n      lib = ComponentLibrary(PKGLIBDIR, libname);\n    }\n#endif\n\n    if (!lib)\n    {\n      log_debug(\"load library \\\"\" << libname << \"\\\" from current dir\");\n      lib = ComponentLibrary(\".\", libname);\n    }\n\n    if (!lib)\n    {\n      log_debug(\"library \\\"\" << libname << \"\\\" in current dir not found - search lib-path\");\n      lib = ComponentLibrary(libname);\n    }\n\n    if (!lib)\n      throw LibraryNotFound(libname);\n\n    lib.factoryMap = factoryMap;\n    log_debug(\"insert new library \" << libname);\n    it = librarymap.insert(librarymap_type::value_type(libname, lib)).first;\n  }\n  else\n    log_debug(\"library \" << libname << \" found\");\n\n  return it->second;\n}\n\nvoid Comploader::configure(const Tntconfig& config_)\n{\n  config = &config_;\n\n  Tntconfig::config_entries_type compPath;\n  config_.getConfigValues(\"CompPath\", compPath);\n  for (Tntconfig::config_entries_type::const_iterator it = compPath.begin();\n       it != compPath.end(); ++it)\n  {\n    if (it->params.size() > 0)\n      search_path.push_back(it->params[0]);\n  }\n}\n\nvoid Comploader::registerFactory(const std::string& component_name,\n  ComponentFactory* factory)\n{\n  log_debug(\"Comploader::registerFactory(\" << component_name << \", \" << factory << ')');\n\n  if (currentFactoryMap)\n    currentFactoryMap->insert(ComponentLibrary::factoryMapType::value_type(component_name, factory));\n  else\n  {\n    librarymap_type& librarymap = getLibrarymap();\n    log_debug(\"register component without library-name\");\n    librarymap_type::iterator it = librarymap.find(std::string());\n    if (it == librarymap.end())\n    {\n      \/\/ empty library not in map - create a new empty library-object\n      it = librarymap.insert(\n        librarymap_type::value_type(std::string(),\n                                    ComponentLibrary())).first;\n    }\n    it->second.registerFactory(component_name, factory);\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\/comploader.h>\n#include <tnt\/componentfactory.h>\n#include <tnt\/tntconfig.h>\n#include <tnt\/httperror.h>\n#include <tnt\/util.h>\n#include <cxxtools\/log.h>\n#include <cxxtools\/dlloader.h>\n#include <stdlib.h>\n\nnamespace\n{\n  cxxtools::ReadWriteMutex mutex;\n}\n\nnamespace tnt\n{\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ ComponentLibrary\n\/\/\nlog_define(\"tntnet.comploader\")\n\nvoid* ComponentLibrary::dlopen(const std::string& name, bool local)\n{\n  log_debug(\"dlopen <\" << name << \">, \" << local);\n\n  int flags = local ? RTLD_NOW|RTLD_LOCAL: RTLD_NOW|RTLD_GLOBAL;\n  std::string n = name;\n  if (!n.empty() && n[0] == '!')\n  {\n    flags = RTLD_NOW|RTLD_GLOBAL;\n    n.erase(0, 1);\n    log_debug(\"dlopen => <\" << n << '>');\n  }\n\n  void* ret = ::dlopen((n + \".so\").c_str(), flags);\n  if (ret != 0)\n  {\n    log_info(\"library \\\"\" << n << \".so\\\"\");\n    return ret;\n  }\n\n  ret = ::dlopen((n + \".a\").c_str(), flags);\n  if (ret != 0)\n  {\n    log_info(\"library \\\"\" << n << \".a\\\"\");\n    return ret;\n  }\n\n  ret = ::dlopen((n + \".dll\").c_str(), flags);\n  if (ret != 0)\n  {\n    log_info(\"library \\\"\" << n << \".dll\\\"\");\n    return ret;\n  }\n\n  ret = ::dlopen(n.c_str(), flags);\n  if (ret == 0)\n    log_warn(\"failed to load library \\\"\" << n << '\"');\n  else\n    log_info(\"library \\\"\" << n << \"\\\"\");\n\n  return ret;\n}\n\nvoid ComponentLibrary::init(const std::string& name, bool local)\n{\n  void* handle = dlopen(name, local);\n  if (handle)\n    handlePtr = new HandleType(handle);\n}\n\nComponent* ComponentLibrary::create(\n  const std::string& component_name, Comploader& cl,\n  const Urlmapper& rootmapper)\n{\n  log_debug(\"create \\\"\" << component_name << '\"');\n\n  ComponentFactory* factory;\n\n  \/\/ look for factory in my map\n  factoryMapType::const_iterator i = factoryMap.find(component_name);\n  if (i == factoryMap.end())\n    throw NotFoundException(component_name);\n\n  factory = i->second;\n\n  \/\/ call the creator\n  Compident ci = Compident(libname, component_name);\n  log_debug(\"call creator for \\\"\" << ci << '\"');\n\n  return factory->create(ci, rootmapper, cl);\n}\n\nLangLib::PtrType ComponentLibrary::getLangLib(const std::string& lang)\n{\n  cxxtools::ReadLock rlock(mutex);\n  langlibsType::const_iterator it = langlibs.find(lang);\n  if (it != langlibs.end())\n    return it->second;\n\n  rlock.unlock();\n  cxxtools::WriteLock wlock(mutex);\n\n  LangLib::PtrType l;\n  try\n  {\n    std::string n = (path.empty() ? libname : (path + '\/' + libname));\n    l = new LangLib(n, lang);\n  }\n  catch (const unzipError& e)\n  {\n    log_warn(\"unzipError: \" << e.what());\n  }\n  langlibs[lang] = l;\n  return l;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Comploader\n\/\/\nComploader::Comploader()\n{\n  if (config)\n  {\n    Tntconfig::config_entries_type configLoad;\n    config->getConfigValues(\"Load\", configLoad);\n\n    for (Tntconfig::config_entries_type::const_iterator it = configLoad.begin();\n         it != configLoad.end(); ++it)\n    {\n      if (it->params.empty())\n        throwRuntimeError(\"missing libraryname in Load-command\");\n      fetchLib(it->params[0]);\n    }\n  }\n}\n\nComploader::librarymap_type& Comploader::getLibrarymap()\n{\n  static librarymap_type librarymap;\n  return librarymap;\n}\n\nstatic const Tntconfig emptyconfig;\nconst Tntconfig* Comploader::config = &emptyconfig;\nComploader::search_path_type Comploader::search_path;\nComponentLibrary::factoryMapType* Comploader::currentFactoryMap = 0;\n\nComponent& Comploader::fetchComp(const Compident& ci,\n  const Urlmapper& rootmapper)\n{\n  log_debug(\"fetchComp \\\"\" << ci << '\"');\n\n  cxxtools::ReadLock rlock(mutex);\n  cxxtools::WriteLock wlock(mutex, false);\n\n  \/\/ lookup Component\n  componentmap_type::iterator it = componentmap.find(ci);\n  if (it == componentmap.end())\n  {\n    rlock.unlock();\n    wlock.lock();\n    componentmap_type::iterator it = componentmap.find(ci);\n    if (it == componentmap.end())\n    {\n      ComponentLibrary& lib = fetchLib(ci.libname);\n      Component* comp = lib.create(ci.compname, *this, rootmapper);\n\n      componentmap[ci] = comp;\n      return *comp;\n    }\n  }\n\n  return *(it->second);\n}\n\nComponent* Comploader::createComp(const Compident& ci,\n  const Urlmapper& rootmapper)\n{\n  log_debug(\"createComp \\\"\" << ci << '\"');\n\n  ComponentLibrary& lib = fetchLib(ci.libname);\n  Component* comp = lib.create(ci.compname, *this, rootmapper);\n  return comp;\n}\n\nconst char* Comploader::getLangData(const Compident& ci,\n  const std::string& lang)\n{\n  log_debug(\"getLangData(\" << ci << \", \\\"\" << lang << \"\\\")\");\n  ComponentLibrary& lib = fetchLib(ci.libname);\n  LangLib::PtrType langLib = lib.getLangLib(lang);\n  if (langLib)\n    return langLib->getData(ci.compname);\n  else\n    return 0;\n}\n\nnamespace\n{\n  template <typename T>\n  class ValueResetter\n  {\n      T& value;\n      T null;\n\n    public:\n      explicit ValueResetter(T& value_, T null_ = T())\n        : value(value_),\n          null(null_)\n          { }\n      ~ValueResetter()\n      { value = null; }\n  };\n}\n\nComponentLibrary& Comploader::fetchLib(const std::string& libname)\n{\n  log_debug(\"fetchLib \\\"\" << libname << '\"');\n\n  std::string n = libname;\n  bool local = false;\n  if (!n.empty() && n[0] == '!')\n  {\n    local = true;\n    n.erase(0, 1);\n  }\n\n  librarymap_type& librarymap = getLibrarymap();\n  librarymap_type::iterator it = librarymap.find(n);\n  if (it == librarymap.end())\n  {\n    ComponentLibrary::factoryMapType factoryMap;\n    currentFactoryMap = &factoryMap;\n    ValueResetter<ComponentLibrary::factoryMapType*> valueResetter(currentFactoryMap, 0);\n\n    \/\/ load library\n    log_info(\"load library \\\"\" << n << '\"');\n    ComponentLibrary lib;\n\n    for (search_path_type::const_iterator p = search_path.begin();\n         !lib && p != search_path.end(); ++p)\n    {\n      log_debug(\"load library \\\"\" << n << \"\\\" from \" << *p << \" dir\");\n      lib = ComponentLibrary(*p, n, local);\n    }\n\n#ifdef PKGLIBDIR\n    if (!lib)\n    {\n      log_debug(\"load library \\\"\" << n << \"\\\" from package lib dir <\" << PKGLIBDIR << '>');\n      lib = ComponentLibrary(PKGLIBDIR, n, local);\n    }\n#endif\n\n    if (!lib)\n    {\n      log_debug(\"load library \\\"\" << n << \"\\\" from current dir\");\n      lib = ComponentLibrary(\".\", n, local);\n    }\n\n    if (!lib)\n    {\n      log_debug(\"library \\\"\" << n << \"\\\" in current dir not found - search lib-path\");\n      lib = ComponentLibrary(n, local);\n    }\n\n    if (!lib)\n      throw LibraryNotFound(n);\n\n    lib.factoryMap = factoryMap;\n    log_debug(\"insert new library \" << n);\n    it = librarymap.insert(librarymap_type::value_type(n, lib)).first;\n  }\n  else\n    log_debug(\"library \" << n << \" found\");\n\n  return it->second;\n}\n\nvoid Comploader::configure(const Tntconfig& config_)\n{\n  config = &config_;\n\n  Tntconfig::config_entries_type compPath;\n  config_.getConfigValues(\"CompPath\", compPath);\n  for (Tntconfig::config_entries_type::const_iterator it = compPath.begin();\n       it != compPath.end(); ++it)\n  {\n    if (it->params.size() > 0)\n      search_path.push_back(it->params[0]);\n  }\n}\n\nvoid Comploader::registerFactory(const std::string& component_name,\n  ComponentFactory* factory)\n{\n  log_debug(\"Comploader::registerFactory(\" << component_name << \", \" << factory << ')');\n\n  if (currentFactoryMap)\n    currentFactoryMap->insert(ComponentLibrary::factoryMapType::value_type(component_name, factory));\n  else\n  {\n    librarymap_type& librarymap = getLibrarymap();\n    log_debug(\"register component without library-name\");\n    librarymap_type::iterator it = librarymap.find(std::string());\n    if (it == librarymap.end())\n    {\n      \/\/ empty library not in map - create a new empty library-object\n      it = librarymap.insert(\n        librarymap_type::value_type(std::string(),\n                                    ComponentLibrary())).first;\n    }\n    it->second.registerFactory(component_name, factory);\n  }\n}\n\n}\n<commit_msg>change search order for component libraries: look in current directory before pkglibdir<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\/comploader.h>\n#include <tnt\/componentfactory.h>\n#include <tnt\/tntconfig.h>\n#include <tnt\/httperror.h>\n#include <tnt\/util.h>\n#include <cxxtools\/log.h>\n#include <cxxtools\/dlloader.h>\n#include <stdlib.h>\n\nnamespace\n{\n  cxxtools::ReadWriteMutex mutex;\n}\n\nnamespace tnt\n{\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ ComponentLibrary\n\/\/\nlog_define(\"tntnet.comploader\")\n\nvoid* ComponentLibrary::dlopen(const std::string& name, bool local)\n{\n  log_debug(\"dlopen <\" << name << \">, \" << local);\n\n  int flags = local ? RTLD_NOW|RTLD_LOCAL: RTLD_NOW|RTLD_GLOBAL;\n  std::string n = name;\n  if (!n.empty() && n[0] == '!')\n  {\n    flags = RTLD_NOW|RTLD_GLOBAL;\n    n.erase(0, 1);\n    log_debug(\"dlopen => <\" << n << '>');\n  }\n\n  void* ret = ::dlopen((n + \".so\").c_str(), flags);\n  if (ret != 0)\n  {\n    log_info(\"library \\\"\" << n << \".so\\\"\");\n    return ret;\n  }\n\n  ret = ::dlopen((n + \".a\").c_str(), flags);\n  if (ret != 0)\n  {\n    log_info(\"library \\\"\" << n << \".a\\\"\");\n    return ret;\n  }\n\n  ret = ::dlopen((n + \".dll\").c_str(), flags);\n  if (ret != 0)\n  {\n    log_info(\"library \\\"\" << n << \".dll\\\"\");\n    return ret;\n  }\n\n  ret = ::dlopen(n.c_str(), flags);\n  if (ret == 0)\n    log_warn(\"failed to load library \\\"\" << n << '\"');\n  else\n    log_info(\"library \\\"\" << n << \"\\\"\");\n\n  return ret;\n}\n\nvoid ComponentLibrary::init(const std::string& name, bool local)\n{\n  void* handle = dlopen(name, local);\n  if (handle)\n    handlePtr = new HandleType(handle);\n}\n\nComponent* ComponentLibrary::create(\n  const std::string& component_name, Comploader& cl,\n  const Urlmapper& rootmapper)\n{\n  log_debug(\"create \\\"\" << component_name << '\"');\n\n  ComponentFactory* factory;\n\n  \/\/ look for factory in my map\n  factoryMapType::const_iterator i = factoryMap.find(component_name);\n  if (i == factoryMap.end())\n    throw NotFoundException(component_name);\n\n  factory = i->second;\n\n  \/\/ call the creator\n  Compident ci = Compident(libname, component_name);\n  log_debug(\"call creator for \\\"\" << ci << '\"');\n\n  return factory->create(ci, rootmapper, cl);\n}\n\nLangLib::PtrType ComponentLibrary::getLangLib(const std::string& lang)\n{\n  cxxtools::ReadLock rlock(mutex);\n  langlibsType::const_iterator it = langlibs.find(lang);\n  if (it != langlibs.end())\n    return it->second;\n\n  rlock.unlock();\n  cxxtools::WriteLock wlock(mutex);\n\n  LangLib::PtrType l;\n  try\n  {\n    std::string n = (path.empty() ? libname : (path + '\/' + libname));\n    l = new LangLib(n, lang);\n  }\n  catch (const unzipError& e)\n  {\n    log_warn(\"unzipError: \" << e.what());\n  }\n  langlibs[lang] = l;\n  return l;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Comploader\n\/\/\nComploader::Comploader()\n{\n  if (config)\n  {\n    Tntconfig::config_entries_type configLoad;\n    config->getConfigValues(\"Load\", configLoad);\n\n    for (Tntconfig::config_entries_type::const_iterator it = configLoad.begin();\n         it != configLoad.end(); ++it)\n    {\n      if (it->params.empty())\n        throwRuntimeError(\"missing libraryname in Load-command\");\n      fetchLib(it->params[0]);\n    }\n  }\n}\n\nComploader::librarymap_type& Comploader::getLibrarymap()\n{\n  static librarymap_type librarymap;\n  return librarymap;\n}\n\nstatic const Tntconfig emptyconfig;\nconst Tntconfig* Comploader::config = &emptyconfig;\nComploader::search_path_type Comploader::search_path;\nComponentLibrary::factoryMapType* Comploader::currentFactoryMap = 0;\n\nComponent& Comploader::fetchComp(const Compident& ci,\n  const Urlmapper& rootmapper)\n{\n  log_debug(\"fetchComp \\\"\" << ci << '\"');\n\n  cxxtools::ReadLock rlock(mutex);\n  cxxtools::WriteLock wlock(mutex, false);\n\n  \/\/ lookup Component\n  componentmap_type::iterator it = componentmap.find(ci);\n  if (it == componentmap.end())\n  {\n    rlock.unlock();\n    wlock.lock();\n    componentmap_type::iterator it = componentmap.find(ci);\n    if (it == componentmap.end())\n    {\n      ComponentLibrary& lib = fetchLib(ci.libname);\n      Component* comp = lib.create(ci.compname, *this, rootmapper);\n\n      componentmap[ci] = comp;\n      return *comp;\n    }\n  }\n\n  return *(it->second);\n}\n\nComponent* Comploader::createComp(const Compident& ci,\n  const Urlmapper& rootmapper)\n{\n  log_debug(\"createComp \\\"\" << ci << '\"');\n\n  ComponentLibrary& lib = fetchLib(ci.libname);\n  Component* comp = lib.create(ci.compname, *this, rootmapper);\n  return comp;\n}\n\nconst char* Comploader::getLangData(const Compident& ci,\n  const std::string& lang)\n{\n  log_debug(\"getLangData(\" << ci << \", \\\"\" << lang << \"\\\")\");\n  ComponentLibrary& lib = fetchLib(ci.libname);\n  LangLib::PtrType langLib = lib.getLangLib(lang);\n  if (langLib)\n    return langLib->getData(ci.compname);\n  else\n    return 0;\n}\n\nnamespace\n{\n  template <typename T>\n  class ValueResetter\n  {\n      T& value;\n      T null;\n\n    public:\n      explicit ValueResetter(T& value_, T null_ = T())\n        : value(value_),\n          null(null_)\n          { }\n      ~ValueResetter()\n      { value = null; }\n  };\n}\n\nComponentLibrary& Comploader::fetchLib(const std::string& libname)\n{\n  log_debug(\"fetchLib \\\"\" << libname << '\"');\n\n  std::string n = libname;\n  bool local = false;\n  if (!n.empty() && n[0] == '!')\n  {\n    local = true;\n    n.erase(0, 1);\n  }\n\n  librarymap_type& librarymap = getLibrarymap();\n  librarymap_type::iterator it = librarymap.find(n);\n  if (it == librarymap.end())\n  {\n    ComponentLibrary::factoryMapType factoryMap;\n    currentFactoryMap = &factoryMap;\n    ValueResetter<ComponentLibrary::factoryMapType*> valueResetter(currentFactoryMap, 0);\n\n    \/\/ load library\n    log_info(\"load library \\\"\" << n << '\"');\n    ComponentLibrary lib;\n\n    for (search_path_type::const_iterator p = search_path.begin();\n         !lib && p != search_path.end(); ++p)\n    {\n      log_debug(\"load library \\\"\" << n << \"\\\" from \" << *p << \" dir\");\n      lib = ComponentLibrary(*p, n, local);\n    }\n\n    if (!lib)\n    {\n      log_debug(\"load library \\\"\" << n << \"\\\" from current dir\");\n      lib = ComponentLibrary(\".\", n, local);\n    }\n\n#ifdef PKGLIBDIR\n    if (!lib)\n    {\n      log_debug(\"load library \\\"\" << n << \"\\\" from package lib dir <\" << PKGLIBDIR << '>');\n      lib = ComponentLibrary(PKGLIBDIR, n, local);\n    }\n#endif\n\n    if (!lib)\n    {\n      log_debug(\"library \\\"\" << n << \"\\\" in current dir not found - search lib-path\");\n      lib = ComponentLibrary(n, local);\n    }\n\n    if (!lib)\n      throw LibraryNotFound(n);\n\n    lib.factoryMap = factoryMap;\n    log_debug(\"insert new library \" << n);\n    it = librarymap.insert(librarymap_type::value_type(n, lib)).first;\n  }\n  else\n    log_debug(\"library \" << n << \" found\");\n\n  return it->second;\n}\n\nvoid Comploader::configure(const Tntconfig& config_)\n{\n  config = &config_;\n\n  Tntconfig::config_entries_type compPath;\n  config_.getConfigValues(\"CompPath\", compPath);\n  for (Tntconfig::config_entries_type::const_iterator it = compPath.begin();\n       it != compPath.end(); ++it)\n  {\n    if (it->params.size() > 0)\n      search_path.push_back(it->params[0]);\n  }\n}\n\nvoid Comploader::registerFactory(const std::string& component_name,\n  ComponentFactory* factory)\n{\n  log_debug(\"Comploader::registerFactory(\" << component_name << \", \" << factory << ')');\n\n  if (currentFactoryMap)\n    currentFactoryMap->insert(ComponentLibrary::factoryMapType::value_type(component_name, factory));\n  else\n  {\n    librarymap_type& librarymap = getLibrarymap();\n    log_debug(\"register component without library-name\");\n    librarymap_type::iterator it = librarymap.find(std::string());\n    if (it == librarymap.end())\n    {\n      \/\/ empty library not in map - create a new empty library-object\n      it = librarymap.insert(\n        librarymap_type::value_type(std::string(),\n                                    ComponentLibrary())).first;\n    }\n    it->second.registerFactory(component_name, factory);\n  }\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2011-2013 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 \"walletview.h\"\n\n#include \"addressbookpage.h\"\n#include \"askpassphrasedialog.h\"\n#include \"bitcoingui.h\"\n#include \"clientmodel.h\"\n#include \"guiutil.h\"\n#include \"optionsmodel.h\"\n#include \"overviewpage.h\"\n#include \"receivecoinsdialog.h\"\n#include \"sendcoinsdialog.h\"\n#include \"signverifymessagedialog.h\"\n#include \"transactiontablemodel.h\"\n#include \"transactionview.h\"\n#include \"walletmodel.h\"\n\n#include \"ui_interface.h\"\n\n#include <QAction>\n#include <QActionGroup>\n#include <QFileDialog>\n#include <QHBoxLayout>\n#include <QProgressDialog>\n#include <QPushButton>\n#include <QVBoxLayout>\n\nWalletView::WalletView(QWidget *parent):\n    QStackedWidget(parent),\n    clientModel(0),\n    walletModel(0)\n{\n    \/\/ Create tabs\n    overviewPage = new OverviewPage();\n\n    transactionsPage = new QWidget(this);\n    QVBoxLayout *vbox = new QVBoxLayout();\n    QHBoxLayout *hbox_buttons = new QHBoxLayout();\n    transactionView = new TransactionView(this);\n    vbox->addWidget(transactionView);\n    QPushButton *exportButton = new QPushButton(tr(\"&Export\"), this);\n    exportButton->setToolTip(tr(\"Export the data in the current tab to a file\"));\n#ifndef Q_OS_MAC \/\/ Icons on push buttons are very uncommon on Mac\n    exportButton->setIcon(QIcon(\":\/icons\/export\"));\n#endif\n    hbox_buttons->addStretch();\n    hbox_buttons->addWidget(exportButton);\n    vbox->addLayout(hbox_buttons);\n    transactionsPage->setLayout(vbox);\n\n    receiveCoinsPage = new ReceiveCoinsDialog();\n    sendCoinsPage = new SendCoinsDialog();\n\n    addWidget(overviewPage);\n    addWidget(transactionsPage);\n    addWidget(receiveCoinsPage);\n    addWidget(sendCoinsPage);\n\n    \/\/ Clicking on a transaction on the overview pre-selects the transaction on the transaction history page\n    connect(overviewPage, SIGNAL(transactionClicked(QModelIndex)), transactionView, SLOT(focusTransaction(QModelIndex)));\n\n    \/\/ Double-clicking on a transaction on the transaction history page shows details\n    connect(transactionView, SIGNAL(doubleClicked(QModelIndex)), transactionView, SLOT(showDetails()));\n\n    \/\/ Clicking on \"Export\" allows to export the transaction list\n    connect(exportButton, SIGNAL(clicked()), transactionView, SLOT(exportClicked()));\n\n    \/\/ Pass through messages from sendCoinsPage\n    connect(sendCoinsPage, SIGNAL(message(QString,QString,unsigned int)), this, SIGNAL(message(QString,QString,unsigned int)));\n    \/\/ Pass through messages from transactionView\n    connect(transactionView, SIGNAL(message(QString,QString,unsigned int)), this, SIGNAL(message(QString,QString,unsigned int)));\n}\n\nWalletView::~WalletView()\n{\n}\n\nvoid WalletView::setBitcoinGUI(BitcoinGUI *gui)\n{\n    if (gui)\n    {\n        \/\/ Clicking on a transaction on the overview page simply sends you to transaction history page\n        connect(overviewPage, SIGNAL(transactionClicked(QModelIndex)), gui, SLOT(gotoHistoryPage()));\n\n        \/\/ Receive and report messages\n        connect(this, SIGNAL(message(QString,QString,unsigned int)), gui, SLOT(message(QString,QString,unsigned int)));\n\n        \/\/ Pass through encryption status changed signals\n        connect(this, SIGNAL(encryptionStatusChanged(int)), gui, SLOT(setEncryptionStatus(int)));\n\n        \/\/ Pass through transaction notifications\n        connect(this, SIGNAL(incomingTransaction(QString,int,qint64,QString,QString)), gui, SLOT(incomingTransaction(QString,int,qint64,QString,QString)));\n    }\n}\n\nvoid WalletView::setClientModel(ClientModel *clientModel)\n{\n    this->clientModel = clientModel;\n\n    overviewPage->setClientModel(clientModel);\n}\n\nvoid WalletView::setWalletModel(WalletModel *walletModel)\n{\n    this->walletModel = walletModel;\n\n    \/\/ Put transaction list in tabs\n    transactionView->setModel(walletModel);\n    overviewPage->setWalletModel(walletModel);\n    receiveCoinsPage->setModel(walletModel);\n    sendCoinsPage->setModel(walletModel);\n\n    if (walletModel)\n    {\n        \/\/ Receive and pass through messages from wallet model\n        connect(walletModel, SIGNAL(message(QString,QString,unsigned int)), this, SIGNAL(message(QString,QString,unsigned int)));\n\n        \/\/ Handle changes in encryption status\n        connect(walletModel, SIGNAL(encryptionStatusChanged(int)), this, SIGNAL(encryptionStatusChanged(int)));\n        updateEncryptionStatus();\n\n        \/\/ Balloon pop-up for new transaction\n        connect(walletModel->getTransactionTableModel(), SIGNAL(rowsInserted(QModelIndex,int,int)),\n                this, SLOT(processNewTransaction(QModelIndex,int,int)));\n\n        \/\/ Ask for passphrase if needed\n        connect(walletModel, SIGNAL(requireUnlock()), this, SLOT(unlockWallet()));\n\n        \/\/ Show progress dialog\n        connect(walletModel, SIGNAL(showProgress(QString,int)), this, SLOT(showProgress(QString,int)));\n    }\n}\n\nvoid WalletView::processNewTransaction(const QModelIndex& parent, int start, int \/*end*\/)\n{\n    \/\/ Prevent balloon-spam when initial block download is in progress\n    if (!walletModel || !clientModel || clientModel->inInitialBlockDownload())\n        return;\n\n    TransactionTableModel *ttm = walletModel->getTransactionTableModel();\n    if (!ttm || ttm->processingQueuedTransactions())\n        return;\n\n    QString date = ttm->index(start, TransactionTableModel::Date, parent).data().toString();\n    qint64 amount = ttm->index(start, TransactionTableModel::Amount, parent).data(Qt::EditRole).toULongLong();\n    QString type = ttm->index(start, TransactionTableModel::Type, parent).data().toString();\n    QString address = ttm->index(start, TransactionTableModel::ToAddress, parent).data().toString();\n\n    emit incomingTransaction(date, walletModel->getOptionsModel()->getDisplayUnit(), amount, type, address);\n}\n\nvoid WalletView::gotoOverviewPage()\n{\n    setCurrentWidget(overviewPage);\n}\n\nvoid WalletView::gotoHistoryPage()\n{\n    setCurrentWidget(transactionsPage);\n}\n\nvoid WalletView::gotoReceiveCoinsPage()\n{\n    setCurrentWidget(receiveCoinsPage);\n}\n\nvoid WalletView::gotoSendCoinsPage(QString addr)\n{\n    setCurrentWidget(sendCoinsPage);\n\n    if (!addr.isEmpty())\n        sendCoinsPage->setAddress(addr);\n}\n\nvoid WalletView::gotoSignMessageTab(QString addr)\n{\n    \/\/ calls show() in showTab_SM()\n    SignVerifyMessageDialog *signVerifyMessageDialog = new SignVerifyMessageDialog(this);\n    signVerifyMessageDialog->setAttribute(Qt::WA_DeleteOnClose);\n    signVerifyMessageDialog->setModel(walletModel);\n    signVerifyMessageDialog->showTab_SM(true);\n\n    if (!addr.isEmpty())\n        signVerifyMessageDialog->setAddress_SM(addr);\n}\n\nvoid WalletView::gotoVerifyMessageTab(QString addr)\n{\n    \/\/ calls show() in showTab_VM()\n    SignVerifyMessageDialog *signVerifyMessageDialog = new SignVerifyMessageDialog(this);\n    signVerifyMessageDialog->setAttribute(Qt::WA_DeleteOnClose);\n    signVerifyMessageDialog->setModel(walletModel);\n    signVerifyMessageDialog->showTab_VM(true);\n\n    if (!addr.isEmpty())\n        signVerifyMessageDialog->setAddress_VM(addr);\n}\n\nbool WalletView::handlePaymentRequest(const SendCoinsRecipient& recipient)\n{\n    return sendCoinsPage->handlePaymentRequest(recipient);\n}\n\nvoid WalletView::showOutOfSyncWarning(bool fShow)\n{\n    overviewPage->showOutOfSyncWarning(fShow);\n}\n\nvoid WalletView::updateEncryptionStatus()\n{\n    emit encryptionStatusChanged(walletModel->getEncryptionStatus());\n}\n\nvoid WalletView::encryptWallet(bool status)\n{\n    if(!walletModel)\n        return;\n    AskPassphraseDialog dlg(status ? AskPassphraseDialog::Encrypt : AskPassphraseDialog::Decrypt, this);\n    dlg.setModel(walletModel);\n    dlg.exec();\n\n    updateEncryptionStatus();\n}\n\nvoid WalletView::backupWallet()\n{\n    QString filename = GUIUtil::getSaveFileName(this,\n        tr(\"Backup Wallet\"), QString(),\n        tr(\"Wallet Data (*.dat)\"), NULL);\n\n    if (filename.isEmpty())\n        return;\n\n    if (!walletModel->backupWallet(filename)) {\n        emit message(tr(\"Backup Failed\"), tr(\"There was an error trying to save the wallet data to %1.\").arg(filename),\n            CClientUIInterface::MSG_ERROR);\n        }\n    else {\n        emit message(tr(\"Backup Successful\"), tr(\"The wallet data was successfully saved to %1.\").arg(filename),\n            CClientUIInterface::MSG_INFORMATION);\n    }\n}\n\nvoid WalletView::changePassphrase()\n{\n    AskPassphraseDialog dlg(AskPassphraseDialog::ChangePass, this);\n    dlg.setModel(walletModel);\n    dlg.exec();\n}\n\nvoid WalletView::unlockWallet()\n{\n    if(!walletModel)\n        return;\n    \/\/ Unlock wallet when requested by wallet model\n\n    if (walletModel->getEncryptionStatus() == WalletModel::Locked || walletModel->getEncryptionStatus() == WalletModel::UnlockedForAnonymizationOnly)\n    {\n        AskPassphraseDialog dlg(AskPassphraseDialog::UnlockAnonymize, this);\n        dlg.setModel(walletModel);\n        dlg.exec();\n    }\n}\n\nvoid WalletView::lockWallet()\n{\n    if(!walletModel)\n        return;\n\n    walletModel->setWalletLocked(true);\n}\n\nvoid WalletView::usedSendingAddresses()\n{\n    if(!walletModel)\n        return;\n    AddressBookPage *dlg = new AddressBookPage(AddressBookPage::ForEditing, AddressBookPage::SendingTab, this);\n    dlg->setAttribute(Qt::WA_DeleteOnClose);\n    dlg->setModel(walletModel->getAddressTableModel());\n    dlg->show();\n}\n\nvoid WalletView::usedReceivingAddresses()\n{\n    if(!walletModel)\n        return;\n    AddressBookPage *dlg = new AddressBookPage(AddressBookPage::ForEditing, AddressBookPage::ReceivingTab, this);\n    dlg->setAttribute(Qt::WA_DeleteOnClose);\n    dlg->setModel(walletModel->getAddressTableModel());\n    dlg->show();\n}\n\nvoid WalletView::showProgress(const QString &title, int nProgress)\n{\n    if (nProgress == 0)\n    {\n        progressDialog = new QProgressDialog(title, \"\", 0, 100);\n        progressDialog->setWindowModality(Qt::ApplicationModal);\n        progressDialog->setMinimumDuration(0);\n        progressDialog->setCancelButton(0);\n        progressDialog->setAutoClose(false);\n        progressDialog->setValue(0);\n    }\n    else if (nProgress == 100)\n    {\n        if (progressDialog)\n        {\n            progressDialog->close();\n            progressDialog->deleteLater();\n        }\n    }\n    else if (progressDialog)\n        progressDialog->setValue(nProgress);\n}\n<commit_msg>Update walletview.cpp<commit_after>\/\/ Copyright (c) 2011-2013 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 \"walletview.h\"\n\n#include \"addressbookpage.h\"\n#include \"askpassphrasedialog.h\"\n#include \"bitcoingui.h\"\n#include \"clientmodel.h\"\n#include \"guiutil.h\"\n#include \"optionsmodel.h\"\n#include \"overviewpage.h\"\n#include \"receivecoinsdialog.h\"\n#include \"sendcoinsdialog.h\"\n#include \"signverifymessagedialog.h\"\n#include \"transactiontablemodel.h\"\n#include \"transactionview.h\"\n#include \"walletmodel.h\"\n#include \"utilitydialog.h\"\n\n#include \"ui_interface.h\"\n\n#include <QAction>\n#include <QActionGroup>\n#include <QFileDialog>\n#include <QHBoxLayout>\n#include <QProgressDialog>\n#include <QPushButton>\n#include <QVBoxLayout>\n\nWalletView::WalletView(QWidget *parent):\n    QStackedWidget(parent),\n    clientModel(0),\n    walletModel(0)\n{\n    \/\/ Create tabs\n    overviewPage = new OverviewPage();\n\n    transactionsPage = new QWidget(this);\n    QVBoxLayout *vbox = new QVBoxLayout();\n    QHBoxLayout *hbox_buttons = new QHBoxLayout();\n    transactionView = new TransactionView(this);\n    vbox->addWidget(transactionView);\n    QPushButton *exportButton = new QPushButton(tr(\"&Export\"), this);\n    exportButton->setToolTip(tr(\"Export the data in the current tab to a file\"));\n#ifndef Q_OS_MAC \/\/ Icons on push buttons are very uncommon on Mac\n    exportButton->setIcon(QIcon(\":\/icons\/export\"));\n#endif\n    hbox_buttons->addStretch();\n    hbox_buttons->addWidget(exportButton);\n    vbox->addLayout(hbox_buttons);\n    transactionsPage->setLayout(vbox);\n\n    receiveCoinsPage = new ReceiveCoinsDialog();\n    sendCoinsPage = new SendCoinsDialog();\n\n    addWidget(overviewPage);\n    addWidget(transactionsPage);\n    addWidget(receiveCoinsPage);\n    addWidget(sendCoinsPage);\n\n    \/\/ Clicking on a transaction on the overview pre-selects the transaction on the transaction history page\n    connect(overviewPage, SIGNAL(transactionClicked(QModelIndex)), transactionView, SLOT(focusTransaction(QModelIndex)));\n\n    \/\/ Double-clicking on a transaction on the transaction history page shows details\n    connect(transactionView, SIGNAL(doubleClicked(QModelIndex)), transactionView, SLOT(showDetails()));\n\n    \/\/ Clicking on \"Export\" allows to export the transaction list\n    connect(exportButton, SIGNAL(clicked()), transactionView, SLOT(exportClicked()));\n\n    \/\/ Pass through messages from sendCoinsPage\n    connect(sendCoinsPage, SIGNAL(message(QString,QString,unsigned int)), this, SIGNAL(message(QString,QString,unsigned int)));\n    \/\/ Pass through messages from transactionView\n    connect(transactionView, SIGNAL(message(QString,QString,unsigned int)), this, SIGNAL(message(QString,QString,unsigned int)));\n}\n\nWalletView::~WalletView()\n{\n}\n\nvoid WalletView::setBitcoinGUI(BitcoinGUI *gui)\n{\n    if (gui)\n    {\n        \/\/ Clicking on a transaction on the overview page simply sends you to transaction history page\n        connect(overviewPage, SIGNAL(transactionClicked(QModelIndex)), gui, SLOT(gotoHistoryPage()));\n\n        \/\/ Receive and report messages\n        connect(this, SIGNAL(message(QString,QString,unsigned int)), gui, SLOT(message(QString,QString,unsigned int)));\n\n        \/\/ Pass through encryption status changed signals\n        connect(this, SIGNAL(encryptionStatusChanged(int)), gui, SLOT(setEncryptionStatus(int)));\n\n        \/\/ Pass through transaction notifications\n        connect(this, SIGNAL(incomingTransaction(QString,int,qint64,QString,QString)), gui, SLOT(incomingTransaction(QString,int,qint64,QString,QString)));\n    }\n}\n\nvoid WalletView::setClientModel(ClientModel *clientModel)\n{\n    this->clientModel = clientModel;\n\n    overviewPage->setClientModel(clientModel);\n}\n\nvoid WalletView::setWalletModel(WalletModel *walletModel)\n{\n    this->walletModel = walletModel;\n\n    \/\/ Put transaction list in tabs\n    transactionView->setModel(walletModel);\n    overviewPage->setWalletModel(walletModel);\n    receiveCoinsPage->setModel(walletModel);\n    sendCoinsPage->setModel(walletModel);\n\n    if (walletModel)\n    {\n        \/\/ Receive and pass through messages from wallet model\n        connect(walletModel, SIGNAL(message(QString,QString,unsigned int)), this, SIGNAL(message(QString,QString,unsigned int)));\n\n        \/\/ Handle changes in encryption status\n        connect(walletModel, SIGNAL(encryptionStatusChanged(int)), this, SIGNAL(encryptionStatusChanged(int)));\n        updateEncryptionStatus();\n\n        \/\/ Balloon pop-up for new transaction\n        connect(walletModel->getTransactionTableModel(), SIGNAL(rowsInserted(QModelIndex,int,int)),\n                this, SLOT(processNewTransaction(QModelIndex,int,int)));\n\n        \/\/ Ask for passphrase if needed\n        connect(walletModel, SIGNAL(requireUnlock()), this, SLOT(unlockWallet()));\n\n        \/\/ Show progress dialog\n        connect(walletModel, SIGNAL(showProgress(QString,int)), this, SLOT(showProgress(QString,int)));\n    }\n}\n\nvoid WalletView::processNewTransaction(const QModelIndex& parent, int start, int \/*end*\/)\n{\n    \/\/ Prevent balloon-spam when initial block download is in progress\n    if (!walletModel || !clientModel || clientModel->inInitialBlockDownload())\n        return;\n\n    TransactionTableModel *ttm = walletModel->getTransactionTableModel();\n    if (!ttm || ttm->processingQueuedTransactions())\n        return;\n\n    QString date = ttm->index(start, TransactionTableModel::Date, parent).data().toString();\n    qint64 amount = ttm->index(start, TransactionTableModel::Amount, parent).data(Qt::EditRole).toULongLong();\n    QString type = ttm->index(start, TransactionTableModel::Type, parent).data().toString();\n    QString address = ttm->index(start, TransactionTableModel::ToAddress, parent).data().toString();\n\n    emit incomingTransaction(date, walletModel->getOptionsModel()->getDisplayUnit(), amount, type, address);\n}\n\nvoid WalletView::gotoOverviewPage()\n{\n    setCurrentWidget(overviewPage);\n}\n\nvoid WalletView::gotoHistoryPage()\n{\n    setCurrentWidget(transactionsPage);\n}\n\nvoid WalletView::gotoReceiveCoinsPage()\n{\n    setCurrentWidget(receiveCoinsPage);\n}\n\nvoid WalletView::gotoSendCoinsPage(QString addr)\n{\n    setCurrentWidget(sendCoinsPage);\n\n    if (!addr.isEmpty())\n        sendCoinsPage->setAddress(addr);\n}\n\nvoid WalletView::gotoSignMessageTab(QString addr)\n{\n    \/\/ calls show() in showTab_SM()\n    SignVerifyMessageDialog *signVerifyMessageDialog = new SignVerifyMessageDialog(this);\n    signVerifyMessageDialog->setAttribute(Qt::WA_DeleteOnClose);\n    signVerifyMessageDialog->setModel(walletModel);\n    signVerifyMessageDialog->showTab_SM(true);\n\n    if (!addr.isEmpty())\n        signVerifyMessageDialog->setAddress_SM(addr);\n}\n\nvoid WalletView::gotoVerifyMessageTab(QString addr)\n{\n    \/\/ calls show() in showTab_VM()\n    SignVerifyMessageDialog *signVerifyMessageDialog = new SignVerifyMessageDialog(this);\n    signVerifyMessageDialog->setAttribute(Qt::WA_DeleteOnClose);\n    signVerifyMessageDialog->setModel(walletModel);\n    signVerifyMessageDialog->showTab_VM(true);\n\n    if (!addr.isEmpty())\n        signVerifyMessageDialog->setAddress_VM(addr);\n}\n\nbool WalletView::handlePaymentRequest(const SendCoinsRecipient& recipient)\n{\n    return sendCoinsPage->handlePaymentRequest(recipient);\n}\n\nvoid WalletView::showOutOfSyncWarning(bool fShow)\n{\n    overviewPage->showOutOfSyncWarning(fShow);\n}\n\nvoid WalletView::updateEncryptionStatus()\n{\n    emit encryptionStatusChanged(walletModel->getEncryptionStatus());\n}\n\nvoid WalletView::encryptWallet(bool status)\n{\n    if(!walletModel)\n        return;\n    AskPassphraseDialog dlg(status ? AskPassphraseDialog::Encrypt : AskPassphraseDialog::Decrypt, this);\n    dlg.setModel(walletModel);\n    dlg.exec();\n\n    updateEncryptionStatus();\n}\n\nvoid WalletView::backupWallet()\n{\n    QString filename = GUIUtil::getSaveFileName(this,\n        tr(\"Backup Wallet\"), QString(),\n        tr(\"Wallet Data (*.dat)\"), NULL);\n\n    if (filename.isEmpty())\n        return;\n\n    if (!walletModel->backupWallet(filename)) {\n        emit message(tr(\"Backup Failed\"), tr(\"There was an error trying to save the wallet data to %1.\").arg(filename),\n            CClientUIInterface::MSG_ERROR);\n        }\n    else {\n        emit message(tr(\"Backup Successful\"), tr(\"The wallet data was successfully saved to %1.\").arg(filename),\n            CClientUIInterface::MSG_INFORMATION);\n    }\n}\n\nvoid WalletView::changePassphrase()\n{\n    AskPassphraseDialog dlg(AskPassphraseDialog::ChangePass, this);\n    dlg.setModel(walletModel);\n    dlg.exec();\n}\n\nvoid WalletView::unlockWallet()\n{\n    if(!walletModel)\n        return;\n    \/\/ Unlock wallet when requested by wallet model\n\n    if (walletModel->getEncryptionStatus() == WalletModel::Locked || walletModel->getEncryptionStatus() == WalletModel::UnlockedForAnonymizationOnly)\n    {\n        AskPassphraseDialog dlg(AskPassphraseDialog::UnlockAnonymize, this);\n        dlg.setModel(walletModel);\n        dlg.exec();\n    }\n}\n\nvoid WalletView::lockWallet()\n{\n    if(!walletModel)\n        return;\n\n    walletModel->setWalletLocked(true);\n}\n\nvoid WalletView::usedSendingAddresses()\n{\n    if(!walletModel)\n        return;\n    AddressBookPage *dlg = new AddressBookPage(AddressBookPage::ForEditing, AddressBookPage::SendingTab, this);\n    dlg->setAttribute(Qt::WA_DeleteOnClose);\n    dlg->setModel(walletModel->getAddressTableModel());\n    dlg->show();\n}\n\nvoid WalletView::usedReceivingAddresses()\n{\n    if(!walletModel)\n        return;\n    AddressBookPage *dlg = new AddressBookPage(AddressBookPage::ForEditing, AddressBookPage::ReceivingTab, this);\n    dlg->setAttribute(Qt::WA_DeleteOnClose);\n    dlg->setModel(walletModel->getAddressTableModel());\n    dlg->show();\n}\n\nvoid WalletView::showProgress(const QString &title, int nProgress)\n{\n    if (nProgress == 0)\n    {\n        progressDialog = new QProgressDialog(title, \"\", 0, 100);\n        progressDialog->setWindowModality(Qt::ApplicationModal);\n        progressDialog->setMinimumDuration(0);\n        progressDialog->setCancelButton(0);\n        progressDialog->setAutoClose(false);\n        progressDialog->setValue(0);\n    }\n    else if (nProgress == 100)\n    {\n        if (progressDialog)\n        {\n            progressDialog->close();\n            progressDialog->deleteLater();\n        }\n    }\n    else if (progressDialog)\n        progressDialog->setValue(nProgress);\n}\nvoid WalletView::printPaperWallets()\n{\n    if(!walletModel)\n        return;\n\n    PaperWalletDialog dlg(this);\n    dlg.setModel(walletModel);\n    dlg.exec();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <QtCore\/QString>\n#include <QtCore>\n#include <QApplication>\n#include <QtGui\/qevent.h>\n#include \"controlpanel.h\"\n#include \"ui_controlpanel.h\"\n\nControlPanel::ControlPanel(QWidget *parent) :\n    QMainWindow(parent),\n    ui(new Ui::ControlPanel)\n{\n    ui->setupUi(this);\n    paletteOrg.setColor(paletteOrg.WindowText, Qt::black);\n    paletteRed.setColor(paletteRed.WindowText, Qt::red);\n    ui->lcdNumber_Right->setPalette(paletteOrg);\n    ui->lcdNumber_Left->setPalette(paletteOrg);\n    ui->lcdNumber_Right->display(\"00\");\n    ui->lcdNumber_Left->display(\"00:00\");\n    timer = new QTimer(this);\n    connect(timer, SIGNAL(timeout()), this, SLOT(updatePanel()));\n    timer->start(1000);\n}\n\nControlPanel::~ControlPanel(void)\n{\n    delete(ui);\n    delete(timer);\n}\n\n\nvoid ControlPanel::setValues(FlightController *newController, ros::NodeHandle *n, int countdownSeconds){\n    node = n;\n    secondsLeft = secondsleftConst = countdownSeconds;\n    controller = newController;\n    sub_navdata = n->subscribe<ardrone_autonomy::Navdata>(\"ardrone\/navdata\", 1000, &ControlPanel::callback, this);\n}\n\nvoid ControlPanel::callback(const ardrone_autonomy::NavdataConstPtr &msg) {\n    battery =  msg->batteryPercent;\n}\n\nvoid ControlPanel::on_pushButton_Start_clicked(void)\n{\n    controller->startProgram();\n    started = true;\n}\n\nvoid ControlPanel::on_pushButton_Reset_clicked(void)\n{\n    started = false;\n    secondsLeft = secondsleftConst;\n    controller->resetProgram();\n}\n\nvoid ControlPanel::on_pushButton_Stop_clicked(void)\n{\n    started = false;\n    secondsLeft = secondsleftConst;\n    controller->abortProgram();\n}\n\nvoid ControlPanel::on_pushButton_Test_clicked(void)\n{\n    controller->testProgram();\n}\n\nvoid ControlPanel::updatePanel(void) {\n\n    if (started && --secondsLeft > -600) {\n        string timeStr;\n\n        int mins = secondsLeft \/ 60;\n        int secs = secondsLeft % 60;\n\n        if (mins != 0) {\n            timeStr = to_string(mins);\n            timeStr.append(\":\");\n        }\n\n        if (secondsLeft < 0 && mins != 0)\n            secs = -secs;\n\n        timeStr.append(to_string(secs));\n\n        if (secondsLeft < 30)\n            ui->lcdNumber_Left->setPalette(paletteRed);\n        else\n            ui->lcdNumber_Left->setPalette(paletteOrg);\n\n        ui->lcdNumber_Left->display(QString::fromStdString(timeStr));\n    }\n    if (battery < 30.00)\n        ui->lcdNumber_Right->setPalette(paletteRed);\n    else\n        ui->lcdNumber_Right->setPalette(paletteOrg);\n\n    ui->lcdNumber_Right->display(battery);\n}\n\nvoid ControlPanel::on_pushButton_shutdown_clicked(void)\n{\n    const char* command = \"kill $(ps aux | grep ros | grep -v grep | awk '{print $2}')\";\n    controller->resetProgram();\n    system(command);\n    exit (EXIT_SUCCESS);\n}\n\n<commit_msg>Reduced update queue<commit_after>#include <QtCore\/QString>\n#include <QtCore>\n#include <QApplication>\n#include <QtGui\/qevent.h>\n#include \"controlpanel.h\"\n#include \"ui_controlpanel.h\"\n\nControlPanel::ControlPanel(QWidget *parent) :\n    QMainWindow(parent),\n    ui(new Ui::ControlPanel)\n{\n    ui->setupUi(this);\n    paletteOrg.setColor(paletteOrg.WindowText, Qt::black);\n    paletteRed.setColor(paletteRed.WindowText, Qt::red);\n    ui->lcdNumber_Right->setPalette(paletteOrg);\n    ui->lcdNumber_Left->setPalette(paletteOrg);\n    ui->lcdNumber_Right->display(\"00\");\n    ui->lcdNumber_Left->display(\"00:00\");\n    timer = new QTimer(this);\n    connect(timer, SIGNAL(timeout()), this, SLOT(updatePanel()));\n    timer->start(1000);\n}\n\nControlPanel::~ControlPanel(void)\n{\n    delete(ui);\n    delete(timer);\n}\n\n\nvoid ControlPanel::setValues(FlightController *newController, ros::NodeHandle *n, int countdownSeconds){\n    node = n;\n    secondsLeft = secondsleftConst = countdownSeconds;\n    controller = newController;\n    sub_navdata = n->subscribe<ardrone_autonomy::Navdata>(\"ardrone\/navdata\", 10, &ControlPanel::callback, this);\n}\n\nvoid ControlPanel::callback(const ardrone_autonomy::NavdataConstPtr &msg) {\n    battery =  msg->batteryPercent;\n}\n\nvoid ControlPanel::on_pushButton_Start_clicked(void)\n{\n    controller->startProgram();\n    started = true;\n}\n\nvoid ControlPanel::on_pushButton_Reset_clicked(void)\n{\n    started = false;\n    secondsLeft = secondsleftConst;\n    controller->resetProgram();\n}\n\nvoid ControlPanel::on_pushButton_Stop_clicked(void)\n{\n    started = false;\n    secondsLeft = secondsleftConst;\n    controller->abortProgram();\n}\n\nvoid ControlPanel::on_pushButton_Test_clicked(void)\n{\n    controller->testProgram();\n}\n\nvoid ControlPanel::updatePanel(void) {\n\n    if (started && --secondsLeft > -600) {\n        string timeStr;\n\n        int mins = secondsLeft \/ 60;\n        int secs = secondsLeft % 60;\n\n        if (mins != 0) {\n            timeStr = to_string(mins);\n            timeStr.append(\":\");\n        }\n\n        if (secondsLeft < 0 && mins != 0)\n            secs = -secs;\n\n        timeStr.append(to_string(secs));\n\n        if (secondsLeft < 30)\n            ui->lcdNumber_Left->setPalette(paletteRed);\n        else\n            ui->lcdNumber_Left->setPalette(paletteOrg);\n\n        ui->lcdNumber_Left->display(QString::fromStdString(timeStr));\n    }\n    if (battery < 30.00)\n        ui->lcdNumber_Right->setPalette(paletteRed);\n    else\n        ui->lcdNumber_Right->setPalette(paletteOrg);\n\n    ui->lcdNumber_Right->display(battery);\n}\n\nvoid ControlPanel::on_pushButton_shutdown_clicked(void)\n{\n    const char* command = \"kill $(ps aux | grep ros | grep -v grep | awk '{print $2}')\";\n    controller->resetProgram();\n    system(command);\n    exit (EXIT_SUCCESS);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies). <qt-info@nokia.com>\n    Copyright (C) 2011-2012 Collabora Ltd. <info@collabora.com>\n\n    This library is free software; you can redistribute it and\/or modify\n    it under the terms of the GNU Lesser General Public License version 2.1\n    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 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, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include \"gstqtvideosinkbase.h\"\n#include \"delegates\/qtvideosinkdelegate.h\"\n#include \"painters\/genericsurfacepainter.h\"\n#include <cstring>\n#include <QCoreApplication>\n\n\nGstVideoSinkClass *GstQtVideoSinkBase::s_parent_class = NULL;\n\nDEFINE_TYPE(GstQtVideoSinkBase, GST_TYPE_VIDEO_SINK)\n\n\/\/------------------------------\n\nvoid GstQtVideoSinkBase::base_init(gpointer g_class)\n{\n    GstElementClass *element_class = GST_ELEMENT_CLASS(g_class);\n\n    static GstStaticPadTemplate sink_pad_template =\n        GST_STATIC_PAD_TEMPLATE(\"sink\", GST_PAD_SINK, GST_PAD_ALWAYS,\n            GST_STATIC_CAPS(\n                \"video\/x-raw-rgb, \"\n                \"framerate = (fraction) [ 0, MAX ], \"\n                \"width = (int) [ 1, MAX ], \"\n                \"height = (int) [ 1, MAX ]\"\n                \"; \"\n            )\n        );\n\n    gst_element_class_add_pad_template(\n            element_class, gst_static_pad_template_get(&sink_pad_template));\n}\n\nvoid GstQtVideoSinkBase::class_init(gpointer g_class, gpointer class_data)\n{\n    Q_UNUSED(class_data);\n\n    s_parent_class = reinterpret_cast<GstVideoSinkClass*>(g_type_class_peek_parent(g_class));\n\n    GObjectClass *object_class = G_OBJECT_CLASS(g_class);\n    object_class->finalize = GstQtVideoSinkBase::finalize;\n    object_class->set_property = GstQtVideoSinkBase::set_property;\n    object_class->get_property = GstQtVideoSinkBase::get_property;\n\n    GstElementClass *element_class = GST_ELEMENT_CLASS(g_class);\n    element_class->change_state = GstQtVideoSinkBase::change_state;\n\n    GstBaseSinkClass *base_sink_class = GST_BASE_SINK_CLASS(g_class);\n    base_sink_class->get_caps = GstQtVideoSinkBase::get_caps;\n    base_sink_class->set_caps = GstQtVideoSinkBase::set_caps;\n\n    GstVideoSinkClass *video_sink_class = GST_VIDEO_SINK_CLASS(g_class);\n    video_sink_class->show_frame = GstQtVideoSinkBase::show_frame;\n\n    \/**\n     * GstQtVideoSinkBase::pixel-aspect-ratio\n     *\n     * The pixel aspect ratio of the display device.\n     **\/\n    g_object_class_install_property(object_class, PROP_PIXEL_ASPECT_RATIO,\n        g_param_spec_string(\"pixel-aspect-ratio\", \"Pixel aspect ratio\",\n                            \"The pixel aspect ratio of the display device\",\n                            \"1\/1\", static_cast<GParamFlags>(G_PARAM_READWRITE)));\n\n    \/**\n     * GstQtVideoSinkBase::force-aspect-ratio\n     *\n     * If set to TRUE, the sink will scale the video respecting its original aspect ratio\n     * and any remaining space will be filled with black.\n     * If set to FALSE, the sink will scale the video to fit the whole drawing area.\n     **\/\n    g_object_class_install_property(object_class, PROP_FORCE_ASPECT_RATIO,\n        g_param_spec_boolean(\"force-aspect-ratio\", \"Force aspect ratio\",\n                             \"When enabled, scaling will respect original aspect ratio\",\n                             FALSE, static_cast<GParamFlags>(G_PARAM_READWRITE)));\n\n}\n\nvoid GstQtVideoSinkBase::init(GTypeInstance *instance, gpointer g_class)\n{\n    GstQtVideoSinkBase *sink = GST_QT_VIDEO_SINK_BASE(instance);\n    Q_UNUSED(g_class);\n\n    sink->formatDirty = true;\n    \/* sink->delegate is initialized in the subclasses *\/\n}\n\nvoid GstQtVideoSinkBase::finalize(GObject *object)\n{\n    GstQtVideoSinkBase *sink = GST_QT_VIDEO_SINK_BASE(object);\n\n    delete sink->delegate;\n    sink->delegate = 0;\n}\n\n\/\/------------------------------\n\nvoid GstQtVideoSinkBase::set_property(GObject *object, guint prop_id,\n                                      const GValue *value, GParamSpec *pspec)\n{\n    GstQtVideoSinkBase *sink = GST_QT_VIDEO_SINK_BASE(object);\n\n    switch (prop_id) {\n    case PROP_PIXEL_ASPECT_RATIO:\n      {\n        GValue tmp;\n        std::memset(&tmp, 0, sizeof(GValue));\n        g_value_init(&tmp, GST_TYPE_FRACTION);\n        if (g_value_transform(value, &tmp)) {\n            int n = gst_value_get_fraction_numerator(&tmp);\n            int d = gst_value_get_fraction_denominator(&tmp);\n            sink->delegate->setPixelAspectRatio(Fraction(n, d));\n        } else {\n            GST_WARNING_OBJECT(object, \"Could not transform string to aspect ratio\");\n        }\n        g_value_unset(&tmp);\n        break;\n      }\n    case PROP_FORCE_ASPECT_RATIO:\n        sink->delegate->setForceAspectRatio(g_value_get_boolean(value));\n        break;\n    default:\n        G_OBJECT_WARN_INVALID_PROPERTY_ID(object, prop_id, pspec);\n        break;\n    }\n}\n\nvoid GstQtVideoSinkBase::get_property(GObject *object, guint prop_id,\n                                      GValue *value, GParamSpec *pspec)\n{\n    GstQtVideoSinkBase *sink = GST_QT_VIDEO_SINK_BASE(object);\n\n    switch (prop_id) {\n    case PROP_PIXEL_ASPECT_RATIO:\n      {\n        GValue tmp;\n        Fraction par = sink->delegate->pixelAspectRatio();\n        std::memset(&tmp, 0, sizeof(GValue));\n        g_value_init(&tmp, GST_TYPE_FRACTION);\n        gst_value_set_fraction(&tmp, par.numerator, par.denominator);\n        g_value_transform(&tmp, value);\n        g_value_unset(&tmp);\n        break;\n      }\n    case PROP_FORCE_ASPECT_RATIO:\n        g_value_set_boolean(value, sink->delegate->forceAspectRatio());\n        break;\n    default:\n        G_OBJECT_WARN_INVALID_PROPERTY_ID(object, prop_id, pspec);\n        break;\n    }\n}\n\n\/\/------------------------------\n\nGstStateChangeReturn GstQtVideoSinkBase::change_state(GstElement *element, GstStateChange transition)\n{\n    GstQtVideoSinkBase *sink = GST_QT_VIDEO_SINK_BASE(element);\n\n    switch (transition) {\n    case GST_STATE_CHANGE_READY_TO_PAUSED:\n        sink->delegate->setActive(true);\n        break;\n    case GST_STATE_CHANGE_PAUSED_TO_READY:\n        sink->delegate->setActive(false);\n        break;\n    default:\n        break;\n    }\n\n    return GST_ELEMENT_CLASS(s_parent_class)->change_state(element, transition);\n}\n\n\/\/------------------------------\n\nGstCaps *GstQtVideoSinkBase::get_caps(GstBaseSink *base, GstCaps *filter)\n{\n    Q_UNUSED(base);\n\n    GstCaps *caps = gst_caps_new_empty();\n\n    Q_FOREACH(GstVideoFormat format, GenericSurfacePainter::supportedPixelFormats()) {\n        gst_caps_append(caps, BufferFormat::newTemplateCaps(format));\n    }\n\n    return caps;\n}\n\ngboolean GstQtVideoSinkBase::set_caps(GstBaseSink *base, GstCaps *caps)\n{\n    GstQtVideoSinkBase *sink = GST_QT_VIDEO_SINK_BASE(base);\n\n    GST_LOG_OBJECT(sink, \"new caps %\" GST_PTR_FORMAT, caps);\n    sink->formatDirty = true;\n    return TRUE;\n}\n\n\/\/------------------------------\n\nGstFlowReturn GstQtVideoSinkBase::show_frame(GstVideoSink *video_sink, GstBuffer *buffer)\n{\n    GstQtVideoSinkBase *sink = GST_QT_VIDEO_SINK_BASE(video_sink);\n\n    GST_TRACE_OBJECT(sink, \"Posting new buffer (%\"GST_PTR_FORMAT\") for rendering. \"\n                           \"Format dirty: %d\", buffer, (int)sink->formatDirty);\n\n    QCoreApplication::postEvent(sink->delegate,\n            new QtVideoSinkDelegate::BufferEvent(buffer, sink->formatDirty));\n\n    sink->formatDirty = false;\n    return GST_FLOW_OK;\n}\n<commit_msg>gstqtvideosink\/gstqtvideosinkbase.cpp implement applying filter to caps<commit_after>\/*\n    Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies). <qt-info@nokia.com>\n    Copyright (C) 2011-2012 Collabora Ltd. <info@collabora.com>\n\n    This library is free software; you can redistribute it and\/or modify\n    it under the terms of the GNU Lesser General Public License version 2.1\n    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 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, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include \"gstqtvideosinkbase.h\"\n#include \"delegates\/qtvideosinkdelegate.h\"\n#include \"painters\/genericsurfacepainter.h\"\n#include <cstring>\n#include <QCoreApplication>\n\n\nGstVideoSinkClass *GstQtVideoSinkBase::s_parent_class = NULL;\n\nDEFINE_TYPE(GstQtVideoSinkBase, GST_TYPE_VIDEO_SINK)\n\n\/\/------------------------------\n\nvoid GstQtVideoSinkBase::base_init(gpointer g_class)\n{\n    GstElementClass *element_class = GST_ELEMENT_CLASS(g_class);\n\n    static GstStaticPadTemplate sink_pad_template =\n        GST_STATIC_PAD_TEMPLATE(\"sink\", GST_PAD_SINK, GST_PAD_ALWAYS,\n            GST_STATIC_CAPS(\n                \"video\/x-raw-rgb, \"\n                \"framerate = (fraction) [ 0, MAX ], \"\n                \"width = (int) [ 1, MAX ], \"\n                \"height = (int) [ 1, MAX ]\"\n                \"; \"\n            )\n        );\n\n    gst_element_class_add_pad_template(\n            element_class, gst_static_pad_template_get(&sink_pad_template));\n}\n\nvoid GstQtVideoSinkBase::class_init(gpointer g_class, gpointer class_data)\n{\n    Q_UNUSED(class_data);\n\n    s_parent_class = reinterpret_cast<GstVideoSinkClass*>(g_type_class_peek_parent(g_class));\n\n    GObjectClass *object_class = G_OBJECT_CLASS(g_class);\n    object_class->finalize = GstQtVideoSinkBase::finalize;\n    object_class->set_property = GstQtVideoSinkBase::set_property;\n    object_class->get_property = GstQtVideoSinkBase::get_property;\n\n    GstElementClass *element_class = GST_ELEMENT_CLASS(g_class);\n    element_class->change_state = GstQtVideoSinkBase::change_state;\n\n    GstBaseSinkClass *base_sink_class = GST_BASE_SINK_CLASS(g_class);\n    base_sink_class->get_caps = GstQtVideoSinkBase::get_caps;\n    base_sink_class->set_caps = GstQtVideoSinkBase::set_caps;\n\n    GstVideoSinkClass *video_sink_class = GST_VIDEO_SINK_CLASS(g_class);\n    video_sink_class->show_frame = GstQtVideoSinkBase::show_frame;\n\n    \/**\n     * GstQtVideoSinkBase::pixel-aspect-ratio\n     *\n     * The pixel aspect ratio of the display device.\n     **\/\n    g_object_class_install_property(object_class, PROP_PIXEL_ASPECT_RATIO,\n        g_param_spec_string(\"pixel-aspect-ratio\", \"Pixel aspect ratio\",\n                            \"The pixel aspect ratio of the display device\",\n                            \"1\/1\", static_cast<GParamFlags>(G_PARAM_READWRITE)));\n\n    \/**\n     * GstQtVideoSinkBase::force-aspect-ratio\n     *\n     * If set to TRUE, the sink will scale the video respecting its original aspect ratio\n     * and any remaining space will be filled with black.\n     * If set to FALSE, the sink will scale the video to fit the whole drawing area.\n     **\/\n    g_object_class_install_property(object_class, PROP_FORCE_ASPECT_RATIO,\n        g_param_spec_boolean(\"force-aspect-ratio\", \"Force aspect ratio\",\n                             \"When enabled, scaling will respect original aspect ratio\",\n                             FALSE, static_cast<GParamFlags>(G_PARAM_READWRITE)));\n\n}\n\nvoid GstQtVideoSinkBase::init(GTypeInstance *instance, gpointer g_class)\n{\n    GstQtVideoSinkBase *sink = GST_QT_VIDEO_SINK_BASE(instance);\n    Q_UNUSED(g_class);\n\n    sink->formatDirty = true;\n    \/* sink->delegate is initialized in the subclasses *\/\n}\n\nvoid GstQtVideoSinkBase::finalize(GObject *object)\n{\n    GstQtVideoSinkBase *sink = GST_QT_VIDEO_SINK_BASE(object);\n\n    delete sink->delegate;\n    sink->delegate = 0;\n}\n\n\/\/------------------------------\n\nvoid GstQtVideoSinkBase::set_property(GObject *object, guint prop_id,\n                                      const GValue *value, GParamSpec *pspec)\n{\n    GstQtVideoSinkBase *sink = GST_QT_VIDEO_SINK_BASE(object);\n\n    switch (prop_id) {\n    case PROP_PIXEL_ASPECT_RATIO:\n      {\n        GValue tmp;\n        std::memset(&tmp, 0, sizeof(GValue));\n        g_value_init(&tmp, GST_TYPE_FRACTION);\n        if (g_value_transform(value, &tmp)) {\n            int n = gst_value_get_fraction_numerator(&tmp);\n            int d = gst_value_get_fraction_denominator(&tmp);\n            sink->delegate->setPixelAspectRatio(Fraction(n, d));\n        } else {\n            GST_WARNING_OBJECT(object, \"Could not transform string to aspect ratio\");\n        }\n        g_value_unset(&tmp);\n        break;\n      }\n    case PROP_FORCE_ASPECT_RATIO:\n        sink->delegate->setForceAspectRatio(g_value_get_boolean(value));\n        break;\n    default:\n        G_OBJECT_WARN_INVALID_PROPERTY_ID(object, prop_id, pspec);\n        break;\n    }\n}\n\nvoid GstQtVideoSinkBase::get_property(GObject *object, guint prop_id,\n                                      GValue *value, GParamSpec *pspec)\n{\n    GstQtVideoSinkBase *sink = GST_QT_VIDEO_SINK_BASE(object);\n\n    switch (prop_id) {\n    case PROP_PIXEL_ASPECT_RATIO:\n      {\n        GValue tmp;\n        Fraction par = sink->delegate->pixelAspectRatio();\n        std::memset(&tmp, 0, sizeof(GValue));\n        g_value_init(&tmp, GST_TYPE_FRACTION);\n        gst_value_set_fraction(&tmp, par.numerator, par.denominator);\n        g_value_transform(&tmp, value);\n        g_value_unset(&tmp);\n        break;\n      }\n    case PROP_FORCE_ASPECT_RATIO:\n        g_value_set_boolean(value, sink->delegate->forceAspectRatio());\n        break;\n    default:\n        G_OBJECT_WARN_INVALID_PROPERTY_ID(object, prop_id, pspec);\n        break;\n    }\n}\n\n\/\/------------------------------\n\nGstStateChangeReturn GstQtVideoSinkBase::change_state(GstElement *element, GstStateChange transition)\n{\n    GstQtVideoSinkBase *sink = GST_QT_VIDEO_SINK_BASE(element);\n\n    switch (transition) {\n    case GST_STATE_CHANGE_READY_TO_PAUSED:\n        sink->delegate->setActive(true);\n        break;\n    case GST_STATE_CHANGE_PAUSED_TO_READY:\n        sink->delegate->setActive(false);\n        break;\n    default:\n        break;\n    }\n\n    return GST_ELEMENT_CLASS(s_parent_class)->change_state(element, transition);\n}\n\n\/\/------------------------------\n\nGstCaps *GstQtVideoSinkBase::get_caps(GstBaseSink *base, GstCaps *filter)\n{\n    Q_UNUSED(base);\n\n    GstCaps *caps = gst_caps_new_empty();\n\n    Q_FOREACH(GstVideoFormat format, GenericSurfacePainter::supportedPixelFormats()) {\n        gst_caps_append(caps, BufferFormat::newTemplateCaps(format));\n    }\n\n    if (filter) {\n        GstCaps *intersection;\n        intersection = gst_caps_intersect_full(filter, caps, GST_CAPS_INTERSECT_FIRST);\n        gst_caps_unref(caps);\n        caps = intersection;\n    }\n\n    return caps;\n}\n\ngboolean GstQtVideoSinkBase::set_caps(GstBaseSink *base, GstCaps *caps)\n{\n    GstQtVideoSinkBase *sink = GST_QT_VIDEO_SINK_BASE(base);\n\n    GST_LOG_OBJECT(sink, \"new caps %\" GST_PTR_FORMAT, caps);\n    sink->formatDirty = true;\n    return TRUE;\n}\n\n\/\/------------------------------\n\nGstFlowReturn GstQtVideoSinkBase::show_frame(GstVideoSink *video_sink, GstBuffer *buffer)\n{\n    GstQtVideoSinkBase *sink = GST_QT_VIDEO_SINK_BASE(video_sink);\n\n    GST_TRACE_OBJECT(sink, \"Posting new buffer (%\"GST_PTR_FORMAT\") for rendering. \"\n                           \"Format dirty: %d\", buffer, (int)sink->formatDirty);\n\n    QCoreApplication::postEvent(sink->delegate,\n            new QtVideoSinkDelegate::BufferEvent(buffer, sink->formatDirty));\n\n    sink->formatDirty = false;\n    return GST_FLOW_OK;\n}\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 <sstream>\n#include <vector>\n\n#include \"elang\/compiler\/translate\/translator.h\"\n\n#include \"base\/auto_reset.h\"\n#include \"base\/logging.h\"\n#include \"base\/strings\/utf_string_conversions.h\"\n#include \"elang\/compiler\/analysis\/analysis.h\"\n#include \"elang\/compiler\/ast\/class.h\"\n#include \"elang\/compiler\/ast\/expressions.h\"\n#include \"elang\/compiler\/ast\/method.h\"\n#include \"elang\/compiler\/ast\/namespace.h\"\n#include \"elang\/compiler\/ast\/statements.h\"\n#include \"elang\/compiler\/compilation_session.h\"\n#include \"elang\/compiler\/predefined_names.h\"\n#include \"elang\/compiler\/public\/compiler_error_code.h\"\n#include \"elang\/compiler\/semantics\/factory.h\"\n#include \"elang\/compiler\/semantics\/nodes.h\"\n#include \"elang\/compiler\/token.h\"\n#include \"elang\/compiler\/token_data.h\"\n#include \"elang\/compiler\/token_type.h\"\n#include \"elang\/compiler\/translate\/builder.h\"\n#include \"elang\/compiler\/translate\/type_mapper.h\"\n#include \"elang\/optimizer\/error_data.h\"\n#include \"elang\/optimizer\/factory.h\"\n#include \"elang\/optimizer\/function.h\"\n#include \"elang\/optimizer\/nodes.h\"\n#include \"elang\/optimizer\/types.h\"\n#include \"elang\/optimizer\/type_factory.h\"\n\nnamespace elang {\nnamespace compiler {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Translator\n\/\/\nTranslator::Translator(CompilationSession* session, ir::Factory* factory)\n    : CompilationSessionUser(session),\n      FactoryUser(factory),\n      break_context_(nullptr),\n      builder_(nullptr),\n      type_mapper_(new IrTypeMapper(session, factory->type_factory())),\n      visit_result_(nullptr) {\n}\n\nTranslator::~Translator() {\n}\n\nvoid Translator::BindParameters(ast::Method* method) {\n  if (method->parameters().empty())\n    return;\n  auto index = 0;\n  for (auto const parameter : method->parameters()) {\n    auto const variable = ValueOf(parameter)->as<sm::Variable>();\n    DCHECK(variable);\n    builder_->BindVariable(variable, builder()->ParameterAt(index));\n    ++index;\n  }\n}\n\nvoid Translator::SetVisitorResult(ir::Node* node) {\n  DCHECK(!visit_result_);\n  visit_result_ = node;\n}\n\nir::Type* Translator::MapType(PredefinedName name) const {\n  return type_mapper_->Map(name);\n}\n\nir::Type* Translator::MapType(sm::Type* type) const {\n  return type_mapper_->Map(type);\n}\n\n\/\/ The entry point of |Translator::|.\nvoid Translator::Run() {\n  session()->Apply(this);\n}\n\nsm::Semantic* Translator::ValueOf(ast::Node* node) const {\n  return analysis()->SemanticOf(node);\n}\n\n\/\/\n\/\/ ast::Visitor\n\/\/\nvoid Translator::DoDefaultVisit(ast::Node* node) {\n  if (node->is<ast::Expression>()) {\n    Error(ErrorCode::TranslatorExpressionNotYetImplemented, node);\n    return;\n  }\n  if (node->is<ast::Statement>()) {\n    Error(ErrorCode::TranslatorStatementNotYetImplemented, node);\n    return;\n  }\n  ast::Visitor::DoDefaultVisit(node);\n}\n\n\/\/\n\/\/ ast::Visitor declaration nodes\n\/\/\n\nvoid Translator::VisitMethod(ast::Method* ast_method) {\n  DCHECK(!builder_);\n  \/\/  1 Convert ast::FunctionType to ir::FunctionType\n  \/\/  2 ir::NewFunction(function_type)\n  auto const method = ValueOf(ast_method)->as<sm::Method>();\n  if (!method) {\n    DVLOG(0) << \"Not resolved \" << *ast_method;\n    return;\n  }\n  auto const ast_method_body = ast_method->body();\n  if (!ast_method_body)\n    return;\n  auto const function = factory()->NewFunction(\n      type_mapper()->Map(method->signature())->as<ir::FunctionType>());\n  session()->RegisterFunction(ast_method, function);\n\n  auto const builder = std::make_unique<Builder>(factory(), function);\n  base::AutoReset<Builder*> builder_scope(&builder_, builder.get());\n\n  BindParameters(ast_method);\n  \/\/ TODO(eval1749) handle body expression\n  TranslateStatement(ast_method_body->as<ast::Statement>());\n  if (!builder_->has_control())\n    return;\n  if (MapType(method->return_type()) != MapType(PredefinedName::Void) &&\n      function->exit_node()->input(0)->CountInputs()) {\n    Error(ErrorCode::TranslatorReturnNone, ast_method);\n  }\n  builder_->EndBlockWithRet(void_value());\n}\n\n}  \/\/ namespace compiler\n}  \/\/ namespace elang\n<commit_msg>elang\/compiler\/translator: Make |Translator| to generate |ir::Function| with |sm::Method::function_signature()| to support instance method.<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 <sstream>\n#include <vector>\n\n#include \"elang\/compiler\/translate\/translator.h\"\n\n#include \"base\/auto_reset.h\"\n#include \"base\/logging.h\"\n#include \"base\/strings\/utf_string_conversions.h\"\n#include \"elang\/compiler\/analysis\/analysis.h\"\n#include \"elang\/compiler\/ast\/class.h\"\n#include \"elang\/compiler\/ast\/expressions.h\"\n#include \"elang\/compiler\/ast\/method.h\"\n#include \"elang\/compiler\/ast\/namespace.h\"\n#include \"elang\/compiler\/ast\/statements.h\"\n#include \"elang\/compiler\/compilation_session.h\"\n#include \"elang\/compiler\/predefined_names.h\"\n#include \"elang\/compiler\/public\/compiler_error_code.h\"\n#include \"elang\/compiler\/semantics\/factory.h\"\n#include \"elang\/compiler\/semantics\/nodes.h\"\n#include \"elang\/compiler\/token.h\"\n#include \"elang\/compiler\/token_data.h\"\n#include \"elang\/compiler\/token_type.h\"\n#include \"elang\/compiler\/translate\/builder.h\"\n#include \"elang\/compiler\/translate\/type_mapper.h\"\n#include \"elang\/optimizer\/error_data.h\"\n#include \"elang\/optimizer\/factory.h\"\n#include \"elang\/optimizer\/function.h\"\n#include \"elang\/optimizer\/nodes.h\"\n#include \"elang\/optimizer\/types.h\"\n#include \"elang\/optimizer\/type_factory.h\"\n\nnamespace elang {\nnamespace compiler {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Translator\n\/\/\nTranslator::Translator(CompilationSession* session, ir::Factory* factory)\n    : CompilationSessionUser(session),\n      FactoryUser(factory),\n      break_context_(nullptr),\n      builder_(nullptr),\n      type_mapper_(new IrTypeMapper(session, factory->type_factory())),\n      visit_result_(nullptr) {\n}\n\nTranslator::~Translator() {\n}\n\nvoid Translator::BindParameters(ast::Method* method) {\n  if (method->parameters().empty())\n    return;\n  auto index = 0;\n  for (auto const parameter : method->parameters()) {\n    auto const variable = ValueOf(parameter)->as<sm::Variable>();\n    DCHECK(variable);\n    builder_->BindVariable(variable, builder()->ParameterAt(index));\n    ++index;\n  }\n}\n\nvoid Translator::SetVisitorResult(ir::Node* node) {\n  DCHECK(!visit_result_);\n  visit_result_ = node;\n}\n\nir::Type* Translator::MapType(PredefinedName name) const {\n  return type_mapper_->Map(name);\n}\n\nir::Type* Translator::MapType(sm::Type* type) const {\n  return type_mapper_->Map(type);\n}\n\n\/\/ The entry point of |Translator::|.\nvoid Translator::Run() {\n  session()->Apply(this);\n}\n\nsm::Semantic* Translator::ValueOf(ast::Node* node) const {\n  return analysis()->SemanticOf(node);\n}\n\n\/\/\n\/\/ ast::Visitor\n\/\/\nvoid Translator::DoDefaultVisit(ast::Node* node) {\n  if (node->is<ast::Expression>()) {\n    Error(ErrorCode::TranslatorExpressionNotYetImplemented, node);\n    return;\n  }\n  if (node->is<ast::Statement>()) {\n    Error(ErrorCode::TranslatorStatementNotYetImplemented, node);\n    return;\n  }\n  ast::Visitor::DoDefaultVisit(node);\n}\n\n\/\/\n\/\/ ast::Visitor declaration nodes\n\/\/\n\nvoid Translator::VisitMethod(ast::Method* ast_method) {\n  DCHECK(!builder_);\n  \/\/  1 Convert ast::FunctionType to ir::FunctionType\n  \/\/  2 ir::NewFunction(function_type)\n  auto const method = ValueOf(ast_method)->as<sm::Method>();\n  if (!method) {\n    DVLOG(0) << \"Not resolved \" << *ast_method;\n    return;\n  }\n  auto const ast_method_body = ast_method->body();\n  if (!ast_method_body)\n    return;\n  auto const function = factory()->NewFunction(\n      type_mapper()->Map(method->function_signature())->as<ir::FunctionType>());\n  session()->RegisterFunction(ast_method, function);\n\n  auto const builder = std::make_unique<Builder>(factory(), function);\n  base::AutoReset<Builder*> builder_scope(&builder_, builder.get());\n\n  BindParameters(ast_method);\n  \/\/ TODO(eval1749) handle body expression\n  TranslateStatement(ast_method_body->as<ast::Statement>());\n  if (!builder_->has_control())\n    return;\n  if (MapType(method->return_type()) != MapType(PredefinedName::Void) &&\n      function->exit_node()->input(0)->CountInputs()) {\n    Error(ErrorCode::TranslatorReturnNone, ast_method);\n  }\n  builder_->EndBlockWithRet(void_value());\n}\n\n}  \/\/ namespace compiler\n}  \/\/ namespace elang\n<|endoftext|>"}
{"text":"<commit_before>#line 2 \"togo\/collection\/fixed_array.hpp\"\n\/**\n@copyright MIT license; see @ref index or the accompanying LICENSE file.\n\n@file\n@brief FixedArray interface.\n@ingroup collection\n@ingroup fixed_array\n*\/\n\n#pragma once\n\n#include <togo\/config.hpp>\n#include <togo\/types.hpp>\n#include <togo\/collection\/types.hpp>\n#include <togo\/memory\/memory.hpp>\n#include <togo\/error\/assert.hpp>\n\n#include <cstring>\n\nnamespace togo {\n\n\/\/\/ Construct.\ntemplate<class T, unsigned N>\ninline FixedArray<T, N>::FixedArray()\n\t: _size(0)\n\t, _data()\n{}\n\n\/\/\/ Access value by index.\ntemplate<class T, unsigned N>\ninline T& FixedArray<T, N>::operator[](unsigned const i) {\n\tTOGO_DEBUG_ASSERTE(i < _size);\n\treturn _data[i];\n}\n\n\/\/\/ Access value by index.\ntemplate<class T, unsigned N>\ninline T const& FixedArray<T, N>::operator[](unsigned const i) const {\n\tTOGO_DEBUG_ASSERTE(i < _size);\n\treturn _data[i];\n}\n\nnamespace fixed_array {\n\n\/**\n\t@addtogroup fixed_array\n\t@{\n*\/\n\n\/\/\/ Number of items.\ntemplate<class T, unsigned N>\ninline u32_fast size(FixedArray<T, N> const& a) { return a._size; }\n\n\/\/\/ Number of items reserved.\ntemplate<class T, unsigned N>\ninline u32_fast capacity(FixedArray<T, N> const& \/*a*\/) { return N; }\n\n\/\/\/ Number of items that can be added before the array is full.\ntemplate<class T, unsigned N>\ninline u32_fast space(FixedArray<T, N> const& a) { return N - a._size; }\n\n\/\/\/ Returns true if there are any items in the array.\ntemplate<class T, unsigned N>\ninline bool any(FixedArray<T, N> const& a) { return a._size != 0; }\n\n\/\/\/ Returns true if there are no items in the array.\ntemplate<class T, unsigned N>\ninline bool empty(FixedArray<T, N> const& a) { return a._size == 0; }\n\n\/\/\/ Beginning iterator: [begin, end).\ntemplate<class T, unsigned N>\ninline T* begin(FixedArray<T, N>& a) {\n\treturn a._data;\n}\n\/\/\/ Beginning iterator: [begin, end).\ntemplate<class T, unsigned N>\ninline T const* begin(FixedArray<T, N> const& a) {\n\treturn a._data;\n}\n\n\/\/\/ Ending iterator: [begin, end).\ntemplate<class T, unsigned N>\ninline T* end(FixedArray<T, N>& a) {\n\treturn a._data + a._size;\n}\n\/\/\/ Ending iterator: [begin, end).\ntemplate<class T, unsigned N>\ninline T const* end(FixedArray<T, N> const& a) {\n\treturn a._data + a._size;\n}\n\n\/\/\/ Access first item.\ntemplate<class T, unsigned N>\ninline T& front(FixedArray<T, N>& a) {\n\tTOGO_DEBUG_ASSERTE(any(a));\n\treturn a._data[0];\n}\n\/\/\/ Access first item.\ntemplate<class T, unsigned N>\ninline T const& front(FixedArray<T, N> const& a) {\n\tTOGO_DEBUG_ASSERTE(any(a));\n\treturn a._data[0];\n}\n\n\/\/\/ Access last item.\ntemplate<class T, unsigned N>\ninline T& back(FixedArray<T, N>& a) {\n\tTOGO_DEBUG_ASSERTE(any(a));\n\treturn a._data[a._size - 1];\n}\n\/\/\/ Access last item.\ntemplate<class T, unsigned N>\ninline T const& back(FixedArray<T, N> const& a) {\n\tTOGO_DEBUG_ASSERTE(any(a));\n\treturn a._data[a._size - 1];\n}\n\n\/\/\/ Change size.\n\/\/\/\n\/\/\/ An assertion will fail if new_size is larger than the capacity.\ntemplate<class T, unsigned N>\ninline void resize(FixedArray<T, N>& a, u32_fast const new_size) {\n\tTOGO_ASSERTE(new_size <= capacity(a));\n\ta._size = new_size;\n}\n\n\/\/\/ Remove all items.\ntemplate<class T, unsigned N>\ninline void clear(FixedArray<T, N>& a) {\n\tresize(a, 0);\n}\n\n\/\/\/ Add an item to the end.\n\/\/\/\n\/\/\/ An assertion will fail if the array is full.\ntemplate<class T, unsigned N>\ninline T& push_back(FixedArray<T, N>& a, T const& item) {\n\tTOGO_DEBUG_ASSERTE(space(a));\n\treturn a._data[a._size++] = item;\n}\n\n\/\/\/ Remove the last item.\n\/\/\/\n\/\/\/ An assertion will fail if the array is empty.\ntemplate<class T, unsigned N>\ninline void pop_back(FixedArray<T, N>& a) {\n\tTOGO_DEBUG_ASSERTE(any(a));\n\t--a._size;\n}\n\n\/\/\/ Copy array.\ntemplate<class T, unsigned N, unsigned M>\ninline void copy(FixedArray<T, N>& dst, FixedArray<T, M> const& src) {\n\tresize(dst, src._size);\n\tstd::memcpy(dst._data, src._data, src._size * sizeof(T));\n}\n\n\/** @} *\/ \/\/ end of doc-group fixed_array\n\n} \/\/ namespace fixed_array\n\n\/** @cond INTERNAL *\/\n\n\/\/ ADL support\n\ntemplate<class T, unsigned N>\ninline T* begin(FixedArray<T, N>& a) {\n\treturn fixed_array::begin(a);\n}\ntemplate<class T, unsigned N>\ninline T const* begin(FixedArray<T, N> const& a) {\n\treturn fixed_array::begin(a);\n}\n\ntemplate<class T, unsigned N>\ninline T* end(FixedArray<T, N>& a) {\n\treturn fixed_array::end(a);\n}\ntemplate<class T, unsigned N>\ninline T const* end(FixedArray<T, N> const& a) {\n\treturn fixed_array::end(a);\n}\n\n\/** @endcond *\/ \/\/ INTERNAL\n\n} \/\/ namespace togo\n<commit_msg>collection\/fixed_array: added increase_size().<commit_after>#line 2 \"togo\/collection\/fixed_array.hpp\"\n\/**\n@copyright MIT license; see @ref index or the accompanying LICENSE file.\n\n@file\n@brief FixedArray interface.\n@ingroup collection\n@ingroup fixed_array\n*\/\n\n#pragma once\n\n#include <togo\/config.hpp>\n#include <togo\/types.hpp>\n#include <togo\/collection\/types.hpp>\n#include <togo\/memory\/memory.hpp>\n#include <togo\/error\/assert.hpp>\n\n#include <cstring>\n\nnamespace togo {\n\n\/\/\/ Construct.\ntemplate<class T, unsigned N>\ninline FixedArray<T, N>::FixedArray()\n\t: _size(0)\n\t, _data()\n{}\n\n\/\/\/ Access value by index.\ntemplate<class T, unsigned N>\ninline T& FixedArray<T, N>::operator[](unsigned const i) {\n\tTOGO_DEBUG_ASSERTE(i < _size);\n\treturn _data[i];\n}\n\n\/\/\/ Access value by index.\ntemplate<class T, unsigned N>\ninline T const& FixedArray<T, N>::operator[](unsigned const i) const {\n\tTOGO_DEBUG_ASSERTE(i < _size);\n\treturn _data[i];\n}\n\nnamespace fixed_array {\n\n\/**\n\t@addtogroup fixed_array\n\t@{\n*\/\n\n\/\/\/ Number of items.\ntemplate<class T, unsigned N>\ninline u32_fast size(FixedArray<T, N> const& a) { return a._size; }\n\n\/\/\/ Number of items reserved.\ntemplate<class T, unsigned N>\ninline u32_fast capacity(FixedArray<T, N> const& \/*a*\/) { return N; }\n\n\/\/\/ Number of items that can be added before the array is full.\ntemplate<class T, unsigned N>\ninline u32_fast space(FixedArray<T, N> const& a) { return N - a._size; }\n\n\/\/\/ Returns true if there are any items in the array.\ntemplate<class T, unsigned N>\ninline bool any(FixedArray<T, N> const& a) { return a._size != 0; }\n\n\/\/\/ Returns true if there are no items in the array.\ntemplate<class T, unsigned N>\ninline bool empty(FixedArray<T, N> const& a) { return a._size == 0; }\n\n\/\/\/ Beginning iterator: [begin, end).\ntemplate<class T, unsigned N>\ninline T* begin(FixedArray<T, N>& a) {\n\treturn a._data;\n}\n\/\/\/ Beginning iterator: [begin, end).\ntemplate<class T, unsigned N>\ninline T const* begin(FixedArray<T, N> const& a) {\n\treturn a._data;\n}\n\n\/\/\/ Ending iterator: [begin, end).\ntemplate<class T, unsigned N>\ninline T* end(FixedArray<T, N>& a) {\n\treturn a._data + a._size;\n}\n\/\/\/ Ending iterator: [begin, end).\ntemplate<class T, unsigned N>\ninline T const* end(FixedArray<T, N> const& a) {\n\treturn a._data + a._size;\n}\n\n\/\/\/ Access first item.\ntemplate<class T, unsigned N>\ninline T& front(FixedArray<T, N>& a) {\n\tTOGO_DEBUG_ASSERTE(any(a));\n\treturn a._data[0];\n}\n\/\/\/ Access first item.\ntemplate<class T, unsigned N>\ninline T const& front(FixedArray<T, N> const& a) {\n\tTOGO_DEBUG_ASSERTE(any(a));\n\treturn a._data[0];\n}\n\n\/\/\/ Access last item.\ntemplate<class T, unsigned N>\ninline T& back(FixedArray<T, N>& a) {\n\tTOGO_DEBUG_ASSERTE(any(a));\n\treturn a._data[a._size - 1];\n}\n\/\/\/ Access last item.\ntemplate<class T, unsigned N>\ninline T const& back(FixedArray<T, N> const& a) {\n\tTOGO_DEBUG_ASSERTE(any(a));\n\treturn a._data[a._size - 1];\n}\n\n\/\/\/ Change size.\n\/\/\/\n\/\/\/ An assertion will fail if new_size is larger than the capacity.\ntemplate<class T, unsigned N>\ninline void resize(FixedArray<T, N>& a, u32_fast const new_size) {\n\tTOGO_ASSERTE(new_size <= capacity(a));\n\ta._size = new_size;\n}\n\n\/\/\/ Increase size.\n\/\/\/\n\/\/\/ An assertion will fail if new_size is larger than the capacity.\ntemplate<class T, unsigned N>\ninline void increase_size(FixedArray<T, N>& a, u32_fast const num_items) {\n\tresize(a, size(a) + num_items);\n}\n\n\/\/\/ Remove all items.\ntemplate<class T, unsigned N>\ninline void clear(FixedArray<T, N>& a) {\n\tresize(a, 0);\n}\n\n\/\/\/ Add an item to the end.\n\/\/\/\n\/\/\/ An assertion will fail if the array is full.\ntemplate<class T, unsigned N>\ninline T& push_back(FixedArray<T, N>& a, T const& item) {\n\tTOGO_DEBUG_ASSERTE(space(a));\n\treturn a._data[a._size++] = item;\n}\n\n\/\/\/ Remove the last item.\n\/\/\/\n\/\/\/ An assertion will fail if the array is empty.\ntemplate<class T, unsigned N>\ninline void pop_back(FixedArray<T, N>& a) {\n\tTOGO_DEBUG_ASSERTE(any(a));\n\t--a._size;\n}\n\n\/\/\/ Copy array.\ntemplate<class T, unsigned N, unsigned M>\ninline void copy(FixedArray<T, N>& dst, FixedArray<T, M> const& src) {\n\tresize(dst, src._size);\n\tstd::memcpy(dst._data, src._data, src._size * sizeof(T));\n}\n\n\/** @} *\/ \/\/ end of doc-group fixed_array\n\n} \/\/ namespace fixed_array\n\n\/** @cond INTERNAL *\/\n\n\/\/ ADL support\n\ntemplate<class T, unsigned N>\ninline T* begin(FixedArray<T, N>& a) {\n\treturn fixed_array::begin(a);\n}\ntemplate<class T, unsigned N>\ninline T const* begin(FixedArray<T, N> const& a) {\n\treturn fixed_array::begin(a);\n}\n\ntemplate<class T, unsigned N>\ninline T* end(FixedArray<T, N>& a) {\n\treturn fixed_array::end(a);\n}\ntemplate<class T, unsigned N>\ninline T const* end(FixedArray<T, N> const& a) {\n\treturn fixed_array::end(a);\n}\n\n\/** @endcond *\/ \/\/ INTERNAL\n\n} \/\/ namespace togo\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Source : https:\/\/leetcode.com\/problems\/move-zeroes\/\n\/\/ Author : Calinescu Valentin\n\/\/ Date   : 2015-10-21\n\n\/*************************************************************************************** \n *\n * Given an array nums, write a function to move all 0's to the end of it while \n * maintaining the relative order of the non-zero elements.\n *\n * For example, given nums = [0, 1, 0, 3, 12], after calling your function, nums should\n * be [1, 3, 12, 0, 0].\n * \n * Note:\n * You must do this in-place without making a copy of the array.\n * Minimize the total number of operations.\n * \n * Credits:\n * Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.\n *               \n ***************************************************************************************\/\n\n\n\n\/* \n * Solutions\n * =========\n *\n * One solution would be to store the position of the next non-zero element of the array.\n * Every position of the array, starting with position 0, must store this next non-zero\n * element until we can no more do that, case in which we need to add the remaining zeros\n * that we skipped.\n * \n * \n * Time Complexity: O(N)\n * Space Complexity: O(1)\n * \n *\/\nclass Solution {\npublic:\n    void moveZeroes(vector<int>& nums) {\n        int i = 0, poz = 0;\n        for(i = 0; i < nums.size() && poz < nums.size(); i++)\n        {\n                while(nums[poz] == 0)\n                    poz++;\n                if(poz < nums.size())\n                    nums[i] = nums[poz];\n                else\n                    i--; \/\/ we need 0 on position i, but i is increasing one last time\n                poz++;\n        }\n        for(; i < nums.size(); i++)\n            nums[i] = 0;\n    }\n};\n<commit_msg>Another implemtation which is easy to understand<commit_after>\/\/ Source : https:\/\/leetcode.com\/problems\/move-zeroes\/\n\/\/ Author : Calinescu Valentin, Hao Chen\n\/\/ Date   : 2015-10-21\n\n\/*************************************************************************************** \n *\n * Given an array nums, write a function to move all 0's to the end of it while \n * maintaining the relative order of the non-zero elements.\n *\n * For example, given nums = [0, 1, 0, 3, 12], after calling your function, nums should\n * be [1, 3, 12, 0, 0].\n * \n * Note:\n * You must do this in-place without making a copy of the array.\n * Minimize the total number of operations.\n * \n * Credits:\n * Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.\n *               \n ***************************************************************************************\/\n\n\n\nclass Solution {\npublic:\n    \/* \n     * Solution (Calinescu Valentin)\n     * ==============================\n     *\n     * One solution would be to store the position of the next non-zero element of the array.\n     * Every position of the array, starting with position 0, must store this next non-zero\n     * element until we can no more do that, case in which we need to add the remaining zeros\n     * that we skipped.\n     * \n     * \n     * Time Complexity: O(N)\n     * Space Complexity: O(1)\n     * \n     *\/\n    void moveZeroes(vector<int>& nums) {\n        int i = 0, poz = 0;\n        for(i = 0; i < nums.size() && poz < nums.size(); i++)\n        {\n                while(nums[poz] == 0)\n                    poz++;\n                if(poz < nums.size())\n                    nums[i] = nums[poz];\n                else\n                    i--; \/\/ we need 0 on position i, but i is increasing one last time\n                poz++;\n        }\n        for(; i < nums.size(); i++)\n            nums[i] = 0;\n    }\n\n\n\n    \/*\n     * Another implemtation which is easy to understand (Hao Chen)\n     * ===========================================================\n     *\n     * We have two pointers to travel the array, assume they named `p1` and `p2`.\n     * \n     *   1) `p1` points the tail of current arrays without any ZEROs.\n     *   2) `p2` points the head of the reset array which skips the ZEROs.\n     * \n     * Then we can just simply move the item from `p2` to `p1`.\n     *\n     *\/\n    void moveZeroes(vector<int>& nums) {\n        int p1=0, p2=0;\n\n        \/\/ Find the first ZERO, where is the tail of the array.\n        \/\/ (Notes: we can simply remove this!)\n        for (; nums[p1]!=0 && p1<nums.size(); p1++);\n        \n        \/\/ copy the item from p2 to p1, and skip the ZERO\n        for (p2=p1; p2<nums.size(); p2++) {\n            if ( nums[p2] == 0 ) continue;\n            nums[p1++] = nums[p2]; \n        }    \n        \n        while ( p1<nums.size() ) nums[p1++] = 0;\n    }\n\n};\n<|endoftext|>"}
{"text":"<commit_before>\n\/\/g++-4.4 -DNOMTL  -Wl,-rpath \/usr\/local\/lib\/oski -L \/usr\/local\/lib\/oski\/ -l oski -l oski_util -l oski_util_Tid  -DOSKI -I ~\/Coding\/LinearAlgebra\/mtl4\/  spmv.cpp  -I .. -O2 -DNDEBUG -lrt  -lm -l oski_mat_CSC_Tid  -loskilt && .\/a.out r200000 c200000 n100 t1 p1\n\n#define SCALAR double\n\n#include <iostream>\n#include <algorithm>\n#include \"BenchTimer.h\"\n#include \"BenchSparseUtil.h\"\n\n#define SPMV_BENCH(CODE) BENCH(t,tries,repeats,CODE);\n\n\/\/ #ifdef MKL\n\/\/\n\/\/ #include \"mkl_types.h\"\n\/\/ #include \"mkl_spblas.h\"\n\/\/\n\/\/ template<typename Lhs,typename Rhs,typename Res>\n\/\/ void mkl_multiply(const Lhs& lhs, const Rhs& rhs, Res& res)\n\/\/ {\n\/\/   char n = 'N';\n\/\/   float alpha = 1;\n\/\/   char matdescra[6];\n\/\/   matdescra[0] = 'G';\n\/\/   matdescra[1] = 0;\n\/\/   matdescra[2] = 0;\n\/\/   matdescra[3] = 'C';\n\/\/   mkl_scscmm(&n, lhs.rows(), rhs.cols(), lhs.cols(), &alpha, matdescra,\n\/\/              lhs._valuePtr(), lhs._innerIndexPtr(), lhs.outerIndexPtr(),\n\/\/              pntre, b, &ldb, &beta, c, &ldc);\n\/\/ \/\/   mkl_somatcopy('C', 'T', lhs.rows(), lhs.cols(), 1,\n\/\/ \/\/                 lhs._valuePtr(), lhs.rows(), DST, dst_stride);\n\/\/ }\n\/\/\n\/\/ #endif\n\nint main(int argc, char *argv[])\n{\n  int size = 10000;\n  int rows = size;\n  int cols = size;\n  int nnzPerCol = 40;\n  int tries = 2;\n  int repeats = 2;\n\n  bool need_help = false;\n  for(int i = 1; i < argc; i++)\n  {\n    if(argv[i][0] == 'r')\n    {\n      rows = atoi(argv[i]+1);\n    }\n    else if(argv[i][0] == 'c')\n    {\n      cols = atoi(argv[i]+1);\n    }\n    else if(argv[i][0] == 'n')\n    {\n      nnzPerCol = atoi(argv[i]+1);\n    }\n    else if(argv[i][0] == 't')\n    {\n      tries = atoi(argv[i]+1);\n    }\n    else if(argv[i][0] == 'p')\n    {\n      repeats = atoi(argv[i]+1);\n    }\n    else\n    {\n      need_help = true;\n    }\n  }\n  if(need_help)\n  {\n    std::cout << argv[0] << \" r<nb rows> c<nb columns> n<non zeros per column> t<nb tries> p<nb repeats>\\n\";\n    return 1;\n  }\n\n  std::cout << \"SpMV \" << rows << \" x \" << cols << \" with \" << nnzPerCol << \" non zeros per column. (\" << repeats << \" repeats, and \" << tries << \" tries)\\n\\n\";\n\n  EigenSparseMatrix sm(rows,cols);\n  DenseVector dv(cols), res(rows);\n  dv.setRandom();\n\n  BenchTimer t;\n  while (nnzPerCol>=4)\n  {\n    std::cout << \"nnz: \" << nnzPerCol << \"\\n\";\n    sm.setZero();\n    fillMatrix2(nnzPerCol, rows, cols, sm);\n\n    \/\/ dense matrices\n    #ifdef DENSEMATRIX\n    {\n      DenseMatrix dm(rows,cols), (rows,cols);\n      eiToDense(sm, dm);\n\n      SPMV_BENCH(res = dm * sm);\n      std::cout << \"Dense       \" << t.value()\/repeats << \"\\t\";\n\n      SPMV_BENCHres = dm.transpose() * sm);\n      std::cout << t.value()\/repeats << endl;\n    }\n    #endif\n\n    \/\/ eigen sparse matrices\n    {\n      SPMV_BENCH(res.noalias() += sm * dv; )\n      std::cout << \"Eigen       \" << t.value()\/repeats << \"\\t\";\n\n      SPMV_BENCH(res.noalias() += sm.transpose() * dv; )\n      std::cout << t.value()\/repeats << endl;\n    }\n\n    \/\/ CSparse\n    #ifdef CSPARSE\n    {\n      std::cout << \"CSparse \\n\";\n      cs *csm;\n      eiToCSparse(sm, csm);\n\n\/\/       BENCH();\n\/\/       timer.stop();\n\/\/       std::cout << \"   a * b:\\t\" << timer.value() << endl;\n\n\/\/       BENCH( { m3 = cs_sorted_multiply2(m1, m2); cs_spfree(m3); } );\n\/\/       std::cout << \"   a * b:\\t\" << timer.value() << endl;\n    }\n    #endif\n\n    #ifdef OSKI\n    {\n      oski_matrix_t om;\n      oski_vecview_t ov, ores;\n      oski_Init();\n      om = oski_CreateMatCSC(sm._outerIndexPtr(), sm._innerIndexPtr(), sm._valuePtr(), rows, cols,\n                             SHARE_INPUTMAT, 1, INDEX_ZERO_BASED);\n      ov = oski_CreateVecView(dv.data(), cols, STRIDE_UNIT);\n      ores = oski_CreateVecView(res.data(), rows, STRIDE_UNIT);\n\n      SPMV_BENCH( oski_MatMult(om, OP_NORMAL, 1, ov, 0, ores) );\n      std::cout << \"OSKI        \" << t.value()\/repeats << \"\\t\";\n\n      SPMV_BENCH( oski_MatMult(om, OP_TRANS, 1, ov, 0, ores) );\n      std::cout << t.value()\/repeats << \"\\n\";\n\n      \/\/ tune\n      t.reset();\n      t.start();\n      oski_SetHintMatMult(om, OP_NORMAL, 1.0, SYMBOLIC_VEC, 0.0, SYMBOLIC_VEC, ALWAYS_TUNE_AGGRESSIVELY);\n      oski_TuneMat(om);\n      t.stop();\n      double tuning = t.value();\n\n      SPMV_BENCH( oski_MatMult(om, OP_NORMAL, 1, ov, 0, ores) );\n      std::cout << \"OSKI tuned  \" << t.value()\/repeats << \"\\t\";\n\n      SPMV_BENCH( oski_MatMult(om, OP_TRANS, 1, ov, 0, ores) );\n      std::cout << t.value()\/repeats << \"\\t(\" << tuning <<  \")\\n\";\n\n\n      oski_DestroyMat(om);\n      oski_DestroyVecView(ov);\n      oski_DestroyVecView(ores);\n      oski_Close();\n    }\n    #endif\n\n    #ifndef NOUBLAS\n    {\n      using namespace boost::numeric;\n      UblasMatrix um(rows,cols);\n      eiToUblas(sm, um);\n\n      boost::numeric::ublas::vector<Scalar> uv(cols), ures(rows);\n      Map<Matrix<Scalar,Dynamic,1> >(&uv[0], cols) = dv;\n      Map<Matrix<Scalar,Dynamic,1> >(&ures[0], rows) = res;\n\n      SPMV_BENCH(ublas::axpy_prod(um, uv, ures, true));\n      std::cout << \"ublas       \" << t.value()\/repeats << \"\\t\";\n\n      SPMV_BENCH(ublas::axpy_prod(boost::numeric::ublas::trans(um), uv, ures, true));\n      std::cout << t.value()\/repeats << endl;\n    }\n    #endif\n\n    \/\/ GMM++\n    #ifndef NOGMM\n    {\n      GmmSparse gm(rows,cols);\n      eiToGmm(sm, gm);\n\n      std::vector<Scalar> gv(cols), gres(rows);\n      Map<Matrix<Scalar,Dynamic,1> >(&gv[0], cols) = dv;\n      Map<Matrix<Scalar,Dynamic,1> >(&gres[0], rows) = res;\n\n      SPMV_BENCH(gmm::mult(gm, gv, gres));\n      std::cout << \"GMM++       \" << t.value()\/repeats << \"\\t\";\n\n      SPMV_BENCH(gmm::mult(gmm::transposed(gm), gv, gres));\n      std::cout << t.value()\/repeats << endl;\n    }\n    #endif\n\n    \/\/ MTL4\n    #ifndef NOMTL\n    {\n      MtlSparse mm(rows,cols);\n      eiToMtl(sm, mm);\n      mtl::dense_vector<Scalar> mv(cols, 1.0);\n      mtl::dense_vector<Scalar> mres(rows, 1.0);\n\n      SPMV_BENCH(mres = mm * mv);\n      std::cout << \"MTL4        \" << t.value()\/repeats << \"\\t\";\n\n      SPMV_BENCH(mres = trans(mm) * mv);\n      std::cout << t.value()\/repeats << endl;\n    }\n    #endif\n\n    std::cout << \"\\n\";\n\n    if(nnzPerCol==1)\n      break;\n    nnzPerCol -= nnzPerCol\/2;\n  }\n\n  return 0;\n}\n\n\n\n<commit_msg>Fix bug 595: typo<commit_after>\n\/\/g++-4.4 -DNOMTL  -Wl,-rpath \/usr\/local\/lib\/oski -L \/usr\/local\/lib\/oski\/ -l oski -l oski_util -l oski_util_Tid  -DOSKI -I ~\/Coding\/LinearAlgebra\/mtl4\/  spmv.cpp  -I .. -O2 -DNDEBUG -lrt  -lm -l oski_mat_CSC_Tid  -loskilt && .\/a.out r200000 c200000 n100 t1 p1\n\n#define SCALAR double\n\n#include <iostream>\n#include <algorithm>\n#include \"BenchTimer.h\"\n#include \"BenchSparseUtil.h\"\n\n#define SPMV_BENCH(CODE) BENCH(t,tries,repeats,CODE);\n\n\/\/ #ifdef MKL\n\/\/\n\/\/ #include \"mkl_types.h\"\n\/\/ #include \"mkl_spblas.h\"\n\/\/\n\/\/ template<typename Lhs,typename Rhs,typename Res>\n\/\/ void mkl_multiply(const Lhs& lhs, const Rhs& rhs, Res& res)\n\/\/ {\n\/\/   char n = 'N';\n\/\/   float alpha = 1;\n\/\/   char matdescra[6];\n\/\/   matdescra[0] = 'G';\n\/\/   matdescra[1] = 0;\n\/\/   matdescra[2] = 0;\n\/\/   matdescra[3] = 'C';\n\/\/   mkl_scscmm(&n, lhs.rows(), rhs.cols(), lhs.cols(), &alpha, matdescra,\n\/\/              lhs._valuePtr(), lhs._innerIndexPtr(), lhs.outerIndexPtr(),\n\/\/              pntre, b, &ldb, &beta, c, &ldc);\n\/\/ \/\/   mkl_somatcopy('C', 'T', lhs.rows(), lhs.cols(), 1,\n\/\/ \/\/                 lhs._valuePtr(), lhs.rows(), DST, dst_stride);\n\/\/ }\n\/\/\n\/\/ #endif\n\nint main(int argc, char *argv[])\n{\n  int size = 10000;\n  int rows = size;\n  int cols = size;\n  int nnzPerCol = 40;\n  int tries = 2;\n  int repeats = 2;\n\n  bool need_help = false;\n  for(int i = 1; i < argc; i++)\n  {\n    if(argv[i][0] == 'r')\n    {\n      rows = atoi(argv[i]+1);\n    }\n    else if(argv[i][0] == 'c')\n    {\n      cols = atoi(argv[i]+1);\n    }\n    else if(argv[i][0] == 'n')\n    {\n      nnzPerCol = atoi(argv[i]+1);\n    }\n    else if(argv[i][0] == 't')\n    {\n      tries = atoi(argv[i]+1);\n    }\n    else if(argv[i][0] == 'p')\n    {\n      repeats = atoi(argv[i]+1);\n    }\n    else\n    {\n      need_help = true;\n    }\n  }\n  if(need_help)\n  {\n    std::cout << argv[0] << \" r<nb rows> c<nb columns> n<non zeros per column> t<nb tries> p<nb repeats>\\n\";\n    return 1;\n  }\n\n  std::cout << \"SpMV \" << rows << \" x \" << cols << \" with \" << nnzPerCol << \" non zeros per column. (\" << repeats << \" repeats, and \" << tries << \" tries)\\n\\n\";\n\n  EigenSparseMatrix sm(rows,cols);\n  DenseVector dv(cols), res(rows);\n  dv.setRandom();\n\n  BenchTimer t;\n  while (nnzPerCol>=4)\n  {\n    std::cout << \"nnz: \" << nnzPerCol << \"\\n\";\n    sm.setZero();\n    fillMatrix2(nnzPerCol, rows, cols, sm);\n\n    \/\/ dense matrices\n    #ifdef DENSEMATRIX\n    {\n      DenseMatrix dm(rows,cols), (rows,cols);\n      eiToDense(sm, dm);\n\n      SPMV_BENCH(res = dm * sm);\n      std::cout << \"Dense       \" << t.value()\/repeats << \"\\t\";\n\n      SPMV_BENCH(res = dm.transpose() * sm);\n      std::cout << t.value()\/repeats << endl;\n    }\n    #endif\n\n    \/\/ eigen sparse matrices\n    {\n      SPMV_BENCH(res.noalias() += sm * dv; )\n      std::cout << \"Eigen       \" << t.value()\/repeats << \"\\t\";\n\n      SPMV_BENCH(res.noalias() += sm.transpose() * dv; )\n      std::cout << t.value()\/repeats << endl;\n    }\n\n    \/\/ CSparse\n    #ifdef CSPARSE\n    {\n      std::cout << \"CSparse \\n\";\n      cs *csm;\n      eiToCSparse(sm, csm);\n\n\/\/       BENCH();\n\/\/       timer.stop();\n\/\/       std::cout << \"   a * b:\\t\" << timer.value() << endl;\n\n\/\/       BENCH( { m3 = cs_sorted_multiply2(m1, m2); cs_spfree(m3); } );\n\/\/       std::cout << \"   a * b:\\t\" << timer.value() << endl;\n    }\n    #endif\n\n    #ifdef OSKI\n    {\n      oski_matrix_t om;\n      oski_vecview_t ov, ores;\n      oski_Init();\n      om = oski_CreateMatCSC(sm._outerIndexPtr(), sm._innerIndexPtr(), sm._valuePtr(), rows, cols,\n                             SHARE_INPUTMAT, 1, INDEX_ZERO_BASED);\n      ov = oski_CreateVecView(dv.data(), cols, STRIDE_UNIT);\n      ores = oski_CreateVecView(res.data(), rows, STRIDE_UNIT);\n\n      SPMV_BENCH( oski_MatMult(om, OP_NORMAL, 1, ov, 0, ores) );\n      std::cout << \"OSKI        \" << t.value()\/repeats << \"\\t\";\n\n      SPMV_BENCH( oski_MatMult(om, OP_TRANS, 1, ov, 0, ores) );\n      std::cout << t.value()\/repeats << \"\\n\";\n\n      \/\/ tune\n      t.reset();\n      t.start();\n      oski_SetHintMatMult(om, OP_NORMAL, 1.0, SYMBOLIC_VEC, 0.0, SYMBOLIC_VEC, ALWAYS_TUNE_AGGRESSIVELY);\n      oski_TuneMat(om);\n      t.stop();\n      double tuning = t.value();\n\n      SPMV_BENCH( oski_MatMult(om, OP_NORMAL, 1, ov, 0, ores) );\n      std::cout << \"OSKI tuned  \" << t.value()\/repeats << \"\\t\";\n\n      SPMV_BENCH( oski_MatMult(om, OP_TRANS, 1, ov, 0, ores) );\n      std::cout << t.value()\/repeats << \"\\t(\" << tuning <<  \")\\n\";\n\n\n      oski_DestroyMat(om);\n      oski_DestroyVecView(ov);\n      oski_DestroyVecView(ores);\n      oski_Close();\n    }\n    #endif\n\n    #ifndef NOUBLAS\n    {\n      using namespace boost::numeric;\n      UblasMatrix um(rows,cols);\n      eiToUblas(sm, um);\n\n      boost::numeric::ublas::vector<Scalar> uv(cols), ures(rows);\n      Map<Matrix<Scalar,Dynamic,1> >(&uv[0], cols) = dv;\n      Map<Matrix<Scalar,Dynamic,1> >(&ures[0], rows) = res;\n\n      SPMV_BENCH(ublas::axpy_prod(um, uv, ures, true));\n      std::cout << \"ublas       \" << t.value()\/repeats << \"\\t\";\n\n      SPMV_BENCH(ublas::axpy_prod(boost::numeric::ublas::trans(um), uv, ures, true));\n      std::cout << t.value()\/repeats << endl;\n    }\n    #endif\n\n    \/\/ GMM++\n    #ifndef NOGMM\n    {\n      GmmSparse gm(rows,cols);\n      eiToGmm(sm, gm);\n\n      std::vector<Scalar> gv(cols), gres(rows);\n      Map<Matrix<Scalar,Dynamic,1> >(&gv[0], cols) = dv;\n      Map<Matrix<Scalar,Dynamic,1> >(&gres[0], rows) = res;\n\n      SPMV_BENCH(gmm::mult(gm, gv, gres));\n      std::cout << \"GMM++       \" << t.value()\/repeats << \"\\t\";\n\n      SPMV_BENCH(gmm::mult(gmm::transposed(gm), gv, gres));\n      std::cout << t.value()\/repeats << endl;\n    }\n    #endif\n\n    \/\/ MTL4\n    #ifndef NOMTL\n    {\n      MtlSparse mm(rows,cols);\n      eiToMtl(sm, mm);\n      mtl::dense_vector<Scalar> mv(cols, 1.0);\n      mtl::dense_vector<Scalar> mres(rows, 1.0);\n\n      SPMV_BENCH(mres = mm * mv);\n      std::cout << \"MTL4        \" << t.value()\/repeats << \"\\t\";\n\n      SPMV_BENCH(mres = trans(mm) * mv);\n      std::cout << t.value()\/repeats << endl;\n    }\n    #endif\n\n    std::cout << \"\\n\";\n\n    if(nnzPerCol==1)\n      break;\n    nnzPerCol -= nnzPerCol\/2;\n  }\n\n  return 0;\n}\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"util\/coordinate_calculation.hpp\"\n#include \"util\/rectangle.hpp\"\n\n#include \"util\/string_util.hpp\"\n#include \"util\/trigonometry_table.hpp\"\n\n#include <boost\/assert.hpp>\n#include <boost\/math\/constants\/constants.hpp>\n\n#include <cmath>\n\n#include <limits>\n\nnamespace osrm\n{\nnamespace util\n{\nnamespace coordinate_calculation\n{\n\ndouble haversineDistance(const int lat1, const int lon1, const int lat2, const int lon2)\n{\n    BOOST_ASSERT(lat1 != std::numeric_limits<int>::min());\n    BOOST_ASSERT(lon1 != std::numeric_limits<int>::min());\n    BOOST_ASSERT(lat2 != std::numeric_limits<int>::min());\n    BOOST_ASSERT(lon2 != std::numeric_limits<int>::min());\n    const double lt1 = lat1 \/ COORDINATE_PRECISION;\n    const double ln1 = lon1 \/ COORDINATE_PRECISION;\n    const double lt2 = lat2 \/ COORDINATE_PRECISION;\n    const double ln2 = lon2 \/ COORDINATE_PRECISION;\n    const double dlat1 = lt1 * (RAD);\n\n    const double dlong1 = ln1 * (RAD);\n    const double dlat2 = lt2 * (RAD);\n    const double dlong2 = ln2 * (RAD);\n\n    const double dlong = dlong1 - dlong2;\n    const double dlat = dlat1 - dlat2;\n\n    const double aharv = std::pow(std::sin(dlat \/ 2.0), 2.0) +\n                         std::cos(dlat1) * std::cos(dlat2) * std::pow(std::sin(dlong \/ 2.), 2);\n    const double charv = 2. * std::atan2(std::sqrt(aharv), std::sqrt(1.0 - aharv));\n    return EARTH_RADIUS * charv;\n}\n\ndouble haversineDistance(const FixedPointCoordinate coordinate_1,\n                         const FixedPointCoordinate coordinate_2)\n{\n    return haversineDistance(coordinate_1.lat, coordinate_1.lon, coordinate_2.lat,\n                             coordinate_2.lon);\n}\n\ndouble greatCircleDistance(const FixedPointCoordinate coordinate_1,\n                           const FixedPointCoordinate coordinate_2)\n{\n    return greatCircleDistance(coordinate_1.lat, coordinate_1.lon, coordinate_2.lat,\n                               coordinate_2.lon);\n}\n\ndouble greatCircleDistance(const int lat1, const int lon1, const int lat2, const int lon2)\n{\n    BOOST_ASSERT(lat1 != std::numeric_limits<int>::min());\n    BOOST_ASSERT(lon1 != std::numeric_limits<int>::min());\n    BOOST_ASSERT(lat2 != std::numeric_limits<int>::min());\n    BOOST_ASSERT(lon2 != std::numeric_limits<int>::min());\n\n    const double float_lat1 = (lat1 \/ COORDINATE_PRECISION) * RAD;\n    const double float_lon1 = (lon1 \/ COORDINATE_PRECISION) * RAD;\n    const double float_lat2 = (lat2 \/ COORDINATE_PRECISION) * RAD;\n    const double float_lon2 = (lon2 \/ COORDINATE_PRECISION) * RAD;\n\n    const double x_value = (float_lon2 - float_lon1) * std::cos((float_lat1 + float_lat2) \/ 2.0);\n    const double y_value = float_lat2 - float_lat1;\n    return std::hypot(x_value, y_value) * EARTH_RADIUS;\n}\n\ndouble perpendicularDistance(const FixedPointCoordinate source_coordinate,\n                             const FixedPointCoordinate target_coordinate,\n                             const FixedPointCoordinate query_location)\n{\n    double ratio;\n    FixedPointCoordinate nearest_location;\n\n    return perpendicularDistance(source_coordinate, target_coordinate, query_location,\n                                 nearest_location, ratio);\n}\n\ndouble perpendicularDistance(const FixedPointCoordinate segment_source,\n                             const FixedPointCoordinate segment_target,\n                             const FixedPointCoordinate query_location,\n                             FixedPointCoordinate &nearest_location,\n                             double &ratio)\n{\n    using namespace coordinate_calculation;\n\n    return perpendicularDistanceFromProjectedCoordinate(\n        segment_source, segment_target, query_location,\n        {mercator::latToY(query_location.lat \/ COORDINATE_PRECISION),\n         query_location.lon \/ COORDINATE_PRECISION},\n        nearest_location, ratio);\n}\n\ndouble\nperpendicularDistanceFromProjectedCoordinate(const FixedPointCoordinate source_coordinate,\n                                             const FixedPointCoordinate target_coordinate,\n                                             const FixedPointCoordinate query_location,\n                                             const std::pair<double, double> projected_coordinate)\n{\n    double ratio;\n    FixedPointCoordinate nearest_location;\n\n    return perpendicularDistanceFromProjectedCoordinate(source_coordinate, target_coordinate,\n                                                        query_location, projected_coordinate,\n                                                        nearest_location, ratio);\n}\n\ndouble\nperpendicularDistanceFromProjectedCoordinate(const FixedPointCoordinate segment_source,\n                                             const FixedPointCoordinate segment_target,\n                                             const FixedPointCoordinate query_location,\n                                             const std::pair<double, double> projected_coordinate,\n                                             FixedPointCoordinate &nearest_location,\n                                             double &ratio)\n{\n    using namespace coordinate_calculation;\n\n    BOOST_ASSERT(query_location.IsValid());\n\n    \/\/ initialize values\n    const double x = projected_coordinate.first;\n    const double y = projected_coordinate.second;\n    const double a = mercator::latToY(segment_source.lat \/ COORDINATE_PRECISION);\n    const double b = segment_source.lon \/ COORDINATE_PRECISION;\n    const double c = mercator::latToY(segment_target.lat \/ COORDINATE_PRECISION);\n    const double d = segment_target.lon \/ COORDINATE_PRECISION;\n    double p, q \/*,mX*\/, new_y;\n    if (std::abs(a - c) > std::numeric_limits<double>::epsilon())\n    {\n        const double m = (d - b) \/ (c - a); \/\/ slope\n        \/\/ Projection of (x,y) on line joining (a,b) and (c,d)\n        p = ((x + (m * y)) + (m * m * a - m * b)) \/ (1.0 + m * m);\n        q = b + m * (p - a);\n    }\n    else\n    {\n        p = c;\n        q = y;\n    }\n    new_y = (d * p - c * q) \/ (a * d - b * c);\n\n    \/\/ discretize the result to coordinate precision. it's a hack!\n    if (std::abs(new_y) < (1.0 \/ COORDINATE_PRECISION))\n    {\n        new_y = 0.0;\n    }\n\n    \/\/ compute ratio\n    ratio = static_cast<double>((p - new_y * a) \/\n                                c); \/\/ These values are actually n\/m+n and m\/m+n , we need\n    \/\/ not calculate the explicit values of m an n as we\n    \/\/ are just interested in the ratio\n    if (std::isnan(ratio))\n    {\n        ratio = (segment_target == query_location ? 1.0 : 0.0);\n    }\n    else if (std::abs(ratio) <= std::numeric_limits<double>::epsilon())\n    {\n        ratio = 0.0;\n    }\n    else if (std::abs(ratio - 1.0) <= std::numeric_limits<double>::epsilon())\n    {\n        ratio = 1.0;\n    }\n\n    \/\/ compute nearest location\n    BOOST_ASSERT(!std::isnan(ratio));\n    if (ratio <= 0.0)\n    {\n        nearest_location = segment_source;\n    }\n    else if (ratio >= 1.0)\n    {\n        nearest_location = segment_target;\n    }\n    else\n    {\n        \/\/ point lies in between\n        nearest_location.lat = static_cast<int>(mercator::yToLat(p) * COORDINATE_PRECISION);\n        nearest_location.lon = static_cast<int>(q * COORDINATE_PRECISION);\n    }\n    BOOST_ASSERT(nearest_location.IsValid());\n\n    const double approximate_distance = greatCircleDistance(query_location, nearest_location);\n    BOOST_ASSERT(0.0 <= approximate_distance);\n    return approximate_distance;\n}\n\ndouble degToRad(const double degree)\n{\n    using namespace boost::math::constants;\n    return degree * (pi<double>() \/ 180.0);\n}\n\ndouble radToDeg(const double radian)\n{\n    using namespace boost::math::constants;\n    return radian * (180.0 * (1. \/ pi<double>()));\n}\n\ndouble bearing(const FixedPointCoordinate first_coordinate,\n               const FixedPointCoordinate second_coordinate)\n{\n    const double lon_diff =\n        second_coordinate.lon \/ COORDINATE_PRECISION - first_coordinate.lon \/ COORDINATE_PRECISION;\n    const double lon_delta = degToRad(lon_diff);\n    const double lat1 = degToRad(first_coordinate.lat \/ COORDINATE_PRECISION);\n    const double lat2 = degToRad(second_coordinate.lat \/ COORDINATE_PRECISION);\n    const double y = std::sin(lon_delta) * std::cos(lat2);\n    const double x =\n        std::cos(lat1) * std::sin(lat2) - std::sin(lat1) * std::cos(lat2) * std::cos(lon_delta);\n    double result = radToDeg(std::atan2(y, x));\n    while (result < 0.0)\n    {\n        result += 360.0;\n    }\n\n    while (result >= 360.0)\n    {\n        result -= 360.0;\n    }\n    return result;\n}\n\ndouble computeAngle(const FixedPointCoordinate first,\n                    const FixedPointCoordinate second,\n                    const FixedPointCoordinate third)\n{\n    using namespace boost::math::constants;\n    using namespace coordinate_calculation;\n\n    const double v1x = (first.lon - second.lon) \/ COORDINATE_PRECISION;\n    const double v1y = mercator::latToY(first.lat \/ COORDINATE_PRECISION) -\n                       mercator::latToY(second.lat \/ COORDINATE_PRECISION);\n    const double v2x = (third.lon - second.lon) \/ COORDINATE_PRECISION;\n    const double v2y = mercator::latToY(third.lat \/ COORDINATE_PRECISION) -\n                       mercator::latToY(second.lat \/ COORDINATE_PRECISION);\n\n    double angle = (atan2_lookup(v2y, v2x) - atan2_lookup(v1y, v1x)) * 180. \/ pi<double>();\n\n    while (angle < 0.)\n    {\n        angle += 360.;\n    }\n\n    return angle;\n}\n\nnamespace mercator\n{\ndouble yToLat(const double value)\n{\n    using namespace boost::math::constants;\n\n    return 180. * (1. \/ pi<long double>()) *\n           (2. * std::atan(std::exp(value * pi<double>() \/ 180.)) - half_pi<double>());\n}\n\ndouble latToY(const double latitude)\n{\n    using namespace boost::math::constants;\n\n    return 180. * (1. \/ pi<double>()) *\n           std::log(std::tan((pi<double>() \/ 4.) + latitude * (pi<double>() \/ 180.) \/ 2.));\n}\n} \/\/ ns mercato \/\/ ns mercatorr\n} \/\/ ns coordinate_calculation\n} \/\/ ns util\n} \/\/ ns osrm\n<commit_msg>We don't need this header.<commit_after>#include \"util\/coordinate_calculation.hpp\"\n\n#include \"util\/string_util.hpp\"\n#include \"util\/trigonometry_table.hpp\"\n\n#include <boost\/assert.hpp>\n#include <boost\/math\/constants\/constants.hpp>\n\n#include <cmath>\n\n#include <limits>\n\nnamespace osrm\n{\nnamespace util\n{\nnamespace coordinate_calculation\n{\n\ndouble haversineDistance(const int lat1, const int lon1, const int lat2, const int lon2)\n{\n    BOOST_ASSERT(lat1 != std::numeric_limits<int>::min());\n    BOOST_ASSERT(lon1 != std::numeric_limits<int>::min());\n    BOOST_ASSERT(lat2 != std::numeric_limits<int>::min());\n    BOOST_ASSERT(lon2 != std::numeric_limits<int>::min());\n    const double lt1 = lat1 \/ COORDINATE_PRECISION;\n    const double ln1 = lon1 \/ COORDINATE_PRECISION;\n    const double lt2 = lat2 \/ COORDINATE_PRECISION;\n    const double ln2 = lon2 \/ COORDINATE_PRECISION;\n    const double dlat1 = lt1 * (RAD);\n\n    const double dlong1 = ln1 * (RAD);\n    const double dlat2 = lt2 * (RAD);\n    const double dlong2 = ln2 * (RAD);\n\n    const double dlong = dlong1 - dlong2;\n    const double dlat = dlat1 - dlat2;\n\n    const double aharv = std::pow(std::sin(dlat \/ 2.0), 2.0) +\n                         std::cos(dlat1) * std::cos(dlat2) * std::pow(std::sin(dlong \/ 2.), 2);\n    const double charv = 2. * std::atan2(std::sqrt(aharv), std::sqrt(1.0 - aharv));\n    return EARTH_RADIUS * charv;\n}\n\ndouble haversineDistance(const FixedPointCoordinate coordinate_1,\n                         const FixedPointCoordinate coordinate_2)\n{\n    return haversineDistance(coordinate_1.lat, coordinate_1.lon, coordinate_2.lat,\n                             coordinate_2.lon);\n}\n\ndouble greatCircleDistance(const FixedPointCoordinate coordinate_1,\n                           const FixedPointCoordinate coordinate_2)\n{\n    return greatCircleDistance(coordinate_1.lat, coordinate_1.lon, coordinate_2.lat,\n                               coordinate_2.lon);\n}\n\ndouble greatCircleDistance(const int lat1, const int lon1, const int lat2, const int lon2)\n{\n    BOOST_ASSERT(lat1 != std::numeric_limits<int>::min());\n    BOOST_ASSERT(lon1 != std::numeric_limits<int>::min());\n    BOOST_ASSERT(lat2 != std::numeric_limits<int>::min());\n    BOOST_ASSERT(lon2 != std::numeric_limits<int>::min());\n\n    const double float_lat1 = (lat1 \/ COORDINATE_PRECISION) * RAD;\n    const double float_lon1 = (lon1 \/ COORDINATE_PRECISION) * RAD;\n    const double float_lat2 = (lat2 \/ COORDINATE_PRECISION) * RAD;\n    const double float_lon2 = (lon2 \/ COORDINATE_PRECISION) * RAD;\n\n    const double x_value = (float_lon2 - float_lon1) * std::cos((float_lat1 + float_lat2) \/ 2.0);\n    const double y_value = float_lat2 - float_lat1;\n    return std::hypot(x_value, y_value) * EARTH_RADIUS;\n}\n\ndouble perpendicularDistance(const FixedPointCoordinate source_coordinate,\n                             const FixedPointCoordinate target_coordinate,\n                             const FixedPointCoordinate query_location)\n{\n    double ratio;\n    FixedPointCoordinate nearest_location;\n\n    return perpendicularDistance(source_coordinate, target_coordinate, query_location,\n                                 nearest_location, ratio);\n}\n\ndouble perpendicularDistance(const FixedPointCoordinate segment_source,\n                             const FixedPointCoordinate segment_target,\n                             const FixedPointCoordinate query_location,\n                             FixedPointCoordinate &nearest_location,\n                             double &ratio)\n{\n    using namespace coordinate_calculation;\n\n    return perpendicularDistanceFromProjectedCoordinate(\n        segment_source, segment_target, query_location,\n        {mercator::latToY(query_location.lat \/ COORDINATE_PRECISION),\n         query_location.lon \/ COORDINATE_PRECISION},\n        nearest_location, ratio);\n}\n\ndouble\nperpendicularDistanceFromProjectedCoordinate(const FixedPointCoordinate source_coordinate,\n                                             const FixedPointCoordinate target_coordinate,\n                                             const FixedPointCoordinate query_location,\n                                             const std::pair<double, double> projected_coordinate)\n{\n    double ratio;\n    FixedPointCoordinate nearest_location;\n\n    return perpendicularDistanceFromProjectedCoordinate(source_coordinate, target_coordinate,\n                                                        query_location, projected_coordinate,\n                                                        nearest_location, ratio);\n}\n\ndouble\nperpendicularDistanceFromProjectedCoordinate(const FixedPointCoordinate segment_source,\n                                             const FixedPointCoordinate segment_target,\n                                             const FixedPointCoordinate query_location,\n                                             const std::pair<double, double> projected_coordinate,\n                                             FixedPointCoordinate &nearest_location,\n                                             double &ratio)\n{\n    using namespace coordinate_calculation;\n\n    BOOST_ASSERT(query_location.IsValid());\n\n    \/\/ initialize values\n    const double x = projected_coordinate.first;\n    const double y = projected_coordinate.second;\n    const double a = mercator::latToY(segment_source.lat \/ COORDINATE_PRECISION);\n    const double b = segment_source.lon \/ COORDINATE_PRECISION;\n    const double c = mercator::latToY(segment_target.lat \/ COORDINATE_PRECISION);\n    const double d = segment_target.lon \/ COORDINATE_PRECISION;\n    double p, q \/*,mX*\/, new_y;\n    if (std::abs(a - c) > std::numeric_limits<double>::epsilon())\n    {\n        const double m = (d - b) \/ (c - a); \/\/ slope\n        \/\/ Projection of (x,y) on line joining (a,b) and (c,d)\n        p = ((x + (m * y)) + (m * m * a - m * b)) \/ (1.0 + m * m);\n        q = b + m * (p - a);\n    }\n    else\n    {\n        p = c;\n        q = y;\n    }\n    new_y = (d * p - c * q) \/ (a * d - b * c);\n\n    \/\/ discretize the result to coordinate precision. it's a hack!\n    if (std::abs(new_y) < (1.0 \/ COORDINATE_PRECISION))\n    {\n        new_y = 0.0;\n    }\n\n    \/\/ compute ratio\n    ratio = static_cast<double>((p - new_y * a) \/\n                                c); \/\/ These values are actually n\/m+n and m\/m+n , we need\n    \/\/ not calculate the explicit values of m an n as we\n    \/\/ are just interested in the ratio\n    if (std::isnan(ratio))\n    {\n        ratio = (segment_target == query_location ? 1.0 : 0.0);\n    }\n    else if (std::abs(ratio) <= std::numeric_limits<double>::epsilon())\n    {\n        ratio = 0.0;\n    }\n    else if (std::abs(ratio - 1.0) <= std::numeric_limits<double>::epsilon())\n    {\n        ratio = 1.0;\n    }\n\n    \/\/ compute nearest location\n    BOOST_ASSERT(!std::isnan(ratio));\n    if (ratio <= 0.0)\n    {\n        nearest_location = segment_source;\n    }\n    else if (ratio >= 1.0)\n    {\n        nearest_location = segment_target;\n    }\n    else\n    {\n        \/\/ point lies in between\n        nearest_location.lat = static_cast<int>(mercator::yToLat(p) * COORDINATE_PRECISION);\n        nearest_location.lon = static_cast<int>(q * COORDINATE_PRECISION);\n    }\n    BOOST_ASSERT(nearest_location.IsValid());\n\n    const double approximate_distance = greatCircleDistance(query_location, nearest_location);\n    BOOST_ASSERT(0.0 <= approximate_distance);\n    return approximate_distance;\n}\n\ndouble degToRad(const double degree)\n{\n    using namespace boost::math::constants;\n    return degree * (pi<double>() \/ 180.0);\n}\n\ndouble radToDeg(const double radian)\n{\n    using namespace boost::math::constants;\n    return radian * (180.0 * (1. \/ pi<double>()));\n}\n\ndouble bearing(const FixedPointCoordinate first_coordinate,\n               const FixedPointCoordinate second_coordinate)\n{\n    const double lon_diff =\n        second_coordinate.lon \/ COORDINATE_PRECISION - first_coordinate.lon \/ COORDINATE_PRECISION;\n    const double lon_delta = degToRad(lon_diff);\n    const double lat1 = degToRad(first_coordinate.lat \/ COORDINATE_PRECISION);\n    const double lat2 = degToRad(second_coordinate.lat \/ COORDINATE_PRECISION);\n    const double y = std::sin(lon_delta) * std::cos(lat2);\n    const double x =\n        std::cos(lat1) * std::sin(lat2) - std::sin(lat1) * std::cos(lat2) * std::cos(lon_delta);\n    double result = radToDeg(std::atan2(y, x));\n    while (result < 0.0)\n    {\n        result += 360.0;\n    }\n\n    while (result >= 360.0)\n    {\n        result -= 360.0;\n    }\n    return result;\n}\n\ndouble computeAngle(const FixedPointCoordinate first,\n                    const FixedPointCoordinate second,\n                    const FixedPointCoordinate third)\n{\n    using namespace boost::math::constants;\n    using namespace coordinate_calculation;\n\n    const double v1x = (first.lon - second.lon) \/ COORDINATE_PRECISION;\n    const double v1y = mercator::latToY(first.lat \/ COORDINATE_PRECISION) -\n                       mercator::latToY(second.lat \/ COORDINATE_PRECISION);\n    const double v2x = (third.lon - second.lon) \/ COORDINATE_PRECISION;\n    const double v2y = mercator::latToY(third.lat \/ COORDINATE_PRECISION) -\n                       mercator::latToY(second.lat \/ COORDINATE_PRECISION);\n\n    double angle = (atan2_lookup(v2y, v2x) - atan2_lookup(v1y, v1x)) * 180. \/ pi<double>();\n\n    while (angle < 0.)\n    {\n        angle += 360.;\n    }\n\n    return angle;\n}\n\nnamespace mercator\n{\ndouble yToLat(const double value)\n{\n    using namespace boost::math::constants;\n\n    return 180. * (1. \/ pi<long double>()) *\n           (2. * std::atan(std::exp(value * pi<double>() \/ 180.)) - half_pi<double>());\n}\n\ndouble latToY(const double latitude)\n{\n    using namespace boost::math::constants;\n\n    return 180. * (1. \/ pi<double>()) *\n           std::log(std::tan((pi<double>() \/ 4.) + latitude * (pi<double>() \/ 180.) \/ 2.));\n}\n} \/\/ ns mercato \/\/ ns mercatorr\n} \/\/ ns coordinate_calculation\n} \/\/ ns util\n} \/\/ ns osrm\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2016 Samsung Electronics Co., Ltd.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n\/\/ CLASS HEADER\n#include \"emboss-filter.h\"\n\n\/\/ EXTERNAL INCLUDES\n#include <sstream>\n#include <dali\/public-api\/animation\/constraints.h>\n#include <dali\/public-api\/common\/stage.h>\n#include <dali\/public-api\/object\/property-map.h>\n#include <dali\/public-api\/render-tasks\/render-task-list.h>\n#include <dali\/public-api\/rendering\/renderer.h>\n#include <dali\/devel-api\/images\/texture-set-image.h>\n\n\/\/ INTERNAL INCLUDES\n#include <dali-toolkit\/devel-api\/visual-factory\/visual-factory.h>\n#include <dali-toolkit\/devel-api\/visual-factory\/devel-visual-properties.h>\n#include <dali-toolkit\/internal\/visuals\/visual-base-impl.h>\n\nnamespace Dali\n{\n\nnamespace Toolkit\n{\n\nnamespace Internal\n{\n\nnamespace\n{\n\nconst char* EMBOSS_FRAGMENT_SOURCE =\n{\n \"precision highp float;\\n\"\n \"varying mediump vec2 vTexCoord;\\n\"\n \"uniform sampler2D sTexture;\\n\"\n \"uniform vec2 uTexScale;\\n\"\n \"uniform vec3 uCoefficient;\\n\"\n \"\\n\"\n \"void main()\\n\"\n \"{\\n\"\n \"  vec4 color  = uCoefficient.x * texture2D( sTexture, vTexCoord + vec2(0.0, -uTexScale.y) );\\n\"\n \"  color += uCoefficient.y * texture2D( sTexture, vTexCoord );\\n\"\n \"  color += uCoefficient.z * texture2D( sTexture, vTexCoord + vec2(0.0, uTexScale.y) );\\n\"\n \"  gl_FragColor = color;\\n\"\n \"}\\n\"\n};\n\nconst char* const COMPOSITE_FRAGMENT_SOURCE =\n{\n  \"varying mediump vec2 vTexCoord;\\n\"\n  \"uniform sampler2D sTexture;\\n\"\n  \"uniform lowp vec4 uEffectColor;\\n\"\n  \"void main()\\n\"\n  \"{\\n\"\n  \"  gl_FragColor = uEffectColor;\\n\"\n  \"  gl_FragColor.a *= texture2D( sTexture, vTexCoord).a;\\n\"\n  \"}\\n\"\n};\n\nconst char* const TEX_SCALE_UNIFORM_NAME( \"uTexScale\" );\nconst char* const COEFFICIENT_UNIFORM_NAME( \"uCoefficient\" );\nconst char* const COLOR_UNIFORM_NAME( \"uEffectColor\" );\n\n} \/\/ namespace\n\nEmbossFilter::EmbossFilter()\n: ImageFilter()\n{\n}\n\nEmbossFilter::~EmbossFilter()\n{\n}\n\nvoid EmbossFilter::Enable()\n{\n  mImageForEmboss1 = FrameBufferImage::New( mTargetSize.width, mTargetSize.height, mPixelFormat );\n  mImageForEmboss2 = FrameBufferImage::New( mTargetSize.width, mTargetSize.height, mPixelFormat );\n\n  Property::Map customShader;\n  customShader[ Toolkit::Visual::Shader::Property::FRAGMENT_SHADER ] = EMBOSS_FRAGMENT_SOURCE;\n  Property::Map visualMap;\n  visualMap.Insert( Toolkit::VisualProperty::SHADER, customShader );\n\n  \/\/ create actor to render input with applied emboss effect\n  mActorForInput1 = Toolkit::ImageView::New(mInputImage);\n  mActorForInput1.SetParentOrigin( ParentOrigin::CENTER );\n  mActorForInput1.SetSize(mTargetSize);\n  Vector2 textureScale( 1.5f\/mTargetSize.width, 1.5f\/mTargetSize.height);\n  mActorForInput1.RegisterProperty( TEX_SCALE_UNIFORM_NAME, textureScale );\n  mActorForInput1.RegisterProperty( COEFFICIENT_UNIFORM_NAME, Vector3( 2.f, -1.f, -1.f ) );\n  \/\/ set EMBOSS custom shader\n  mActorForInput1.SetProperty( Toolkit::ImageView::Property::IMAGE, visualMap );\n  mRootActor.Add( mActorForInput1 );\n\n  mActorForInput2 = Toolkit::ImageView::New(mInputImage);\n  mActorForInput2.SetParentOrigin( ParentOrigin::CENTER );\n  mActorForInput2.SetSize(mTargetSize);\n  mActorForInput2.RegisterProperty( TEX_SCALE_UNIFORM_NAME, textureScale );\n  mActorForInput2.RegisterProperty( COEFFICIENT_UNIFORM_NAME, Vector3( -1.f, -1.f, 2.f ) );\n  \/\/ set EMBOSS custom shader\n  mActorForInput2.SetProperty( Toolkit::ImageView::Property::IMAGE, visualMap );\n  mRootActor.Add( mActorForInput2 );\n\n  mActorForComposite = Actor::New();\n  mActorForComposite.SetParentOrigin( ParentOrigin::CENTER );\n  mActorForComposite.SetSize(mTargetSize);\n  mActorForComposite.SetColor( Color::BLACK );\n\n  customShader[ Toolkit::Visual::Shader::Property::FRAGMENT_SHADER ] = COMPOSITE_FRAGMENT_SOURCE;\n\n  mRootActor.Add( mActorForComposite );\n\n  Image dummyImage; \/\/ Dummy image, force creation of an image visual\n\n  InitializeVisual( mActorForComposite, mVisualForEmboss1, dummyImage );\n  Toolkit::GetImplementation( mVisualForEmboss1 ).SetCustomShader( customShader );\n\n  InitializeVisual( mActorForComposite, mVisualForEmboss2, dummyImage );\n  Toolkit::GetImplementation( mVisualForEmboss2 ).SetCustomShader( customShader );\n\n  TextureSet textureSet1 = TextureSet::New();\n  TextureSetImage( textureSet1, 0, mImageForEmboss1 );\n  mActorForComposite.GetRendererAt(0).SetTextures( textureSet1 );\n  mActorForComposite.GetRendererAt(0).RegisterProperty( COLOR_UNIFORM_NAME, Color::BLACK );\n\n  TextureSet textureSet2 = TextureSet::New();\n  TextureSetImage( textureSet2, 0, mImageForEmboss2 );\n  mActorForComposite.GetRendererAt(1).SetTextures( textureSet2 );\n  mActorForComposite.GetRendererAt(1).RegisterProperty( COLOR_UNIFORM_NAME, Color::WHITE );\n\n  SetupCamera();\n  CreateRenderTasks();\n}\n\nvoid EmbossFilter::Disable()\n{\n  if( mRootActor )\n  {\n    if( mCameraActor )\n    {\n      mRootActor.Remove( mCameraActor );\n      mCameraActor.Reset();\n    }\n\n    if( mActorForInput1 )\n    {\n      mRootActor.Remove( mActorForInput1 );\n      mActorForInput1.Reset();\n    }\n\n    if( mActorForInput2 )\n    {\n      mRootActor.Remove( mActorForInput2 );\n      mActorForInput2.Reset();\n    }\n\n    if( mActorForComposite )\n    {\n      mVisualForEmboss1.SetOffStage( mActorForComposite );\n      mVisualForEmboss2.SetOffStage( mActorForComposite );\n      mVisualForEmboss1.Reset();\n      mVisualForEmboss2.Reset();\n      mRootActor.Remove( mActorForComposite );\n      mActorForComposite.Reset();\n    }\n\n    RenderTaskList taskList = Stage::GetCurrent().GetRenderTaskList();\n    if( mRenderTaskForEmboss1 )\n    {\n      taskList.RemoveTask(mRenderTaskForEmboss1);\n    }\n\n    if( mRenderTaskForEmboss2 )\n    {\n      taskList.RemoveTask(mRenderTaskForEmboss2);\n    }\n\n    mRootActor.Reset();\n  }\n}\n\nvoid EmbossFilter::Refresh()\n{\n  if( mRenderTaskForEmboss1 )\n  {\n    mRenderTaskForEmboss1.SetRefreshRate( mRefreshOnDemand ? RenderTask::REFRESH_ONCE : RenderTask::REFRESH_ALWAYS );\n  }\n  if( mRenderTaskForEmboss2 )\n  {\n    mRenderTaskForEmboss2.SetRefreshRate( mRefreshOnDemand ? RenderTask::REFRESH_ONCE : RenderTask::REFRESH_ALWAYS );\n  }\n}\n\nvoid EmbossFilter::SetSize( const Vector2& size )\n{\n  mTargetSize = size;\n  if( mActorForInput1 )\n  {\n    mActorForInput1.SetSize(mTargetSize);\n  }\n  if( mActorForInput2 )\n  {\n    mActorForInput2.SetSize(mTargetSize);\n  }\n  if( mActorForComposite )\n  {\n    mActorForComposite.SetSize(mTargetSize);\n  }\n}\n\nvoid EmbossFilter::CreateRenderTasks()\n{\n  RenderTaskList taskList = Stage::GetCurrent().GetRenderTaskList();\n\n  mRenderTaskForEmboss1 = taskList.CreateTask();\n  mRenderTaskForEmboss1.SetRefreshRate( mRefreshOnDemand ? RenderTask::REFRESH_ONCE : RenderTask::REFRESH_ALWAYS );\n  mRenderTaskForEmboss1.SetSourceActor( mActorForInput1 );\n  mRenderTaskForEmboss1.SetExclusive(true);\n  mRenderTaskForEmboss1.SetInputEnabled( false );\n  mRenderTaskForEmboss1.SetClearColor( Vector4( 0.0f, 0.0f, 0.0f, 0.0f ) );\n  mRenderTaskForEmboss1.SetClearEnabled( true );\n  mRenderTaskForEmboss1.SetTargetFrameBuffer( mImageForEmboss1 );\n  mRenderTaskForEmboss1.SetCameraActor( mCameraActor );\n\n  mRenderTaskForEmboss2 = taskList.CreateTask();\n  mRenderTaskForEmboss2.SetRefreshRate( mRefreshOnDemand ? RenderTask::REFRESH_ONCE : RenderTask::REFRESH_ALWAYS );\n  mRenderTaskForEmboss2.SetSourceActor( mActorForInput2 );\n  mRenderTaskForEmboss2.SetExclusive(true);\n  mRenderTaskForEmboss2.SetInputEnabled( false );\n  mRenderTaskForEmboss2.SetClearColor( Vector4( 1.0f, 1.0f, 1.0f, 0.0f ) );\n  mRenderTaskForEmboss2.SetClearEnabled( true );\n  mRenderTaskForEmboss2.SetTargetFrameBuffer( mImageForEmboss2 );\n  mRenderTaskForEmboss2.SetCameraActor( mCameraActor );\n\n  mRenderTaskForOutput = taskList.CreateTask();\n  mRenderTaskForOutput.SetRefreshRate( mRefreshOnDemand ? RenderTask::REFRESH_ONCE : RenderTask::REFRESH_ALWAYS );\n  mRenderTaskForOutput.SetSourceActor( mActorForComposite );\n  mRenderTaskForOutput.SetExclusive(true);\n  mRenderTaskForOutput.SetInputEnabled( false );\n  mRenderTaskForOutput.SetClearColor( Vector4( 0.5f, 0.5f, 0.5f, 0.0f ) );\n  mRenderTaskForOutput.SetClearEnabled( true );\n  mRenderTaskForOutput.SetTargetFrameBuffer( mOutputImage );\n  mRenderTaskForOutput.SetCameraActor( mCameraActor );\n}\n\n} \/\/ namespace Internal\n\n} \/\/ namespace Toolkit\n\n} \/\/ namespace Dali\n<commit_msg>Emboss filter not to use Texture Set explictly<commit_after>\/*\n * Copyright (c) 2016 Samsung Electronics Co., Ltd.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n\/\/ CLASS HEADER\n#include \"emboss-filter.h\"\n\n\/\/ EXTERNAL INCLUDES\n#include <sstream>\n#include <dali\/public-api\/animation\/constraints.h>\n#include <dali\/public-api\/common\/stage.h>\n#include <dali\/public-api\/object\/property-map.h>\n#include <dali\/public-api\/render-tasks\/render-task-list.h>\n#include <dali\/public-api\/rendering\/renderer.h>\n#include <dali\/devel-api\/images\/texture-set-image.h>\n\n\/\/ INTERNAL INCLUDES\n#include <dali-toolkit\/devel-api\/visual-factory\/visual-factory.h>\n#include <dali-toolkit\/devel-api\/visual-factory\/devel-visual-properties.h>\n#include <dali-toolkit\/internal\/visuals\/visual-base-impl.h>\n\nnamespace Dali\n{\n\nnamespace Toolkit\n{\n\nnamespace Internal\n{\n\nnamespace\n{\n\nconst char* EMBOSS_FRAGMENT_SOURCE =\n{\n \"precision highp float;\\n\"\n \"varying mediump vec2 vTexCoord;\\n\"\n \"uniform sampler2D sTexture;\\n\"\n \"uniform vec2 uTexScale;\\n\"\n \"uniform vec3 uCoefficient;\\n\"\n \"\\n\"\n \"void main()\\n\"\n \"{\\n\"\n \"  vec4 color  = uCoefficient.x * texture2D( sTexture, vTexCoord + vec2(0.0, -uTexScale.y) );\\n\"\n \"  color += uCoefficient.y * texture2D( sTexture, vTexCoord );\\n\"\n \"  color += uCoefficient.z * texture2D( sTexture, vTexCoord + vec2(0.0, uTexScale.y) );\\n\"\n \"  gl_FragColor = color;\\n\"\n \"}\\n\"\n};\n\nconst char* const COMPOSITE_FRAGMENT_SOURCE =\n{\n  \"varying mediump vec2 vTexCoord;\\n\"\n  \"uniform sampler2D sTexture;\\n\"\n  \"uniform lowp vec4 uEffectColor;\\n\"\n  \"void main()\\n\"\n  \"{\\n\"\n  \"  gl_FragColor = uEffectColor;\\n\"\n  \"  gl_FragColor.a *= texture2D( sTexture, vTexCoord).a;\\n\"\n  \"}\\n\"\n};\n\nconst char* const TEX_SCALE_UNIFORM_NAME( \"uTexScale\" );\nconst char* const COEFFICIENT_UNIFORM_NAME( \"uCoefficient\" );\nconst char* const COLOR_UNIFORM_NAME( \"uEffectColor\" );\n\n} \/\/ namespace\n\nEmbossFilter::EmbossFilter()\n: ImageFilter()\n{\n}\n\nEmbossFilter::~EmbossFilter()\n{\n}\n\nvoid EmbossFilter::Enable()\n{\n  mImageForEmboss1 = FrameBufferImage::New( mTargetSize.width, mTargetSize.height, mPixelFormat );\n  mImageForEmboss2 = FrameBufferImage::New( mTargetSize.width, mTargetSize.height, mPixelFormat );\n\n  Property::Map customShader;\n  customShader[ Toolkit::Visual::Shader::Property::FRAGMENT_SHADER ] = EMBOSS_FRAGMENT_SOURCE;\n  Property::Map visualMap;\n  visualMap.Insert( Toolkit::VisualProperty::SHADER, customShader );\n\n  \/\/ create actor to render input with applied emboss effect\n  mActorForInput1 = Toolkit::ImageView::New(mInputImage);\n  mActorForInput1.SetParentOrigin( ParentOrigin::CENTER );\n  mActorForInput1.SetSize(mTargetSize);\n  Vector2 textureScale( 1.5f\/mTargetSize.width, 1.5f\/mTargetSize.height);\n  mActorForInput1.RegisterProperty( TEX_SCALE_UNIFORM_NAME, textureScale );\n  mActorForInput1.RegisterProperty( COEFFICIENT_UNIFORM_NAME, Vector3( 2.f, -1.f, -1.f ) );\n  \/\/ set EMBOSS custom shader\n  mActorForInput1.SetProperty( Toolkit::ImageView::Property::IMAGE, visualMap );\n  mRootActor.Add( mActorForInput1 );\n\n  mActorForInput2 = Toolkit::ImageView::New(mInputImage);\n  mActorForInput2.SetParentOrigin( ParentOrigin::CENTER );\n  mActorForInput2.SetSize(mTargetSize);\n  mActorForInput2.RegisterProperty( TEX_SCALE_UNIFORM_NAME, textureScale );\n  mActorForInput2.RegisterProperty( COEFFICIENT_UNIFORM_NAME, Vector3( -1.f, -1.f, 2.f ) );\n  \/\/ set EMBOSS custom shader\n  mActorForInput2.SetProperty( Toolkit::ImageView::Property::IMAGE, visualMap );\n  mRootActor.Add( mActorForInput2 );\n\n  mActorForComposite = Actor::New();\n  mActorForComposite.SetParentOrigin( ParentOrigin::CENTER );\n  mActorForComposite.SetSize(mTargetSize);\n  mActorForComposite.SetColor( Color::BLACK );\n\n  customShader[ Toolkit::Visual::Shader::Property::FRAGMENT_SHADER ] = COMPOSITE_FRAGMENT_SOURCE;\n\n  mRootActor.Add( mActorForComposite );\n\n  InitializeVisual( mActorForComposite, mVisualForEmboss1, mImageForEmboss1 );\n  Toolkit::GetImplementation( mVisualForEmboss1 ).SetCustomShader( customShader );\n  mActorForComposite.GetRendererAt(0).RegisterProperty( COLOR_UNIFORM_NAME, Color::BLACK );\n  InitializeVisual( mActorForComposite, mVisualForEmboss2, mImageForEmboss2 );\n  Toolkit::GetImplementation( mVisualForEmboss2 ).SetCustomShader( customShader );\n  mActorForComposite.GetRendererAt(1).RegisterProperty( COLOR_UNIFORM_NAME, Color::WHITE );\n\n  SetupCamera();\n  CreateRenderTasks();\n}\n\nvoid EmbossFilter::Disable()\n{\n  if( mRootActor )\n  {\n    if( mCameraActor )\n    {\n      mRootActor.Remove( mCameraActor );\n      mCameraActor.Reset();\n    }\n\n    if( mActorForInput1 )\n    {\n      mRootActor.Remove( mActorForInput1 );\n      mActorForInput1.Reset();\n    }\n\n    if( mActorForInput2 )\n    {\n      mRootActor.Remove( mActorForInput2 );\n      mActorForInput2.Reset();\n    }\n\n    if( mActorForComposite )\n    {\n      mVisualForEmboss1.SetOffStage( mActorForComposite );\n      mVisualForEmboss2.SetOffStage( mActorForComposite );\n      mVisualForEmboss1.Reset();\n      mVisualForEmboss2.Reset();\n      mRootActor.Remove( mActorForComposite );\n      mActorForComposite.Reset();\n    }\n\n    RenderTaskList taskList = Stage::GetCurrent().GetRenderTaskList();\n    if( mRenderTaskForEmboss1 )\n    {\n      taskList.RemoveTask(mRenderTaskForEmboss1);\n    }\n\n    if( mRenderTaskForEmboss2 )\n    {\n      taskList.RemoveTask(mRenderTaskForEmboss2);\n    }\n\n    mRootActor.Reset();\n  }\n}\n\nvoid EmbossFilter::Refresh()\n{\n  if( mRenderTaskForEmboss1 )\n  {\n    mRenderTaskForEmboss1.SetRefreshRate( mRefreshOnDemand ? RenderTask::REFRESH_ONCE : RenderTask::REFRESH_ALWAYS );\n  }\n  if( mRenderTaskForEmboss2 )\n  {\n    mRenderTaskForEmboss2.SetRefreshRate( mRefreshOnDemand ? RenderTask::REFRESH_ONCE : RenderTask::REFRESH_ALWAYS );\n  }\n}\n\nvoid EmbossFilter::SetSize( const Vector2& size )\n{\n  mTargetSize = size;\n  if( mActorForInput1 )\n  {\n    mActorForInput1.SetSize(mTargetSize);\n  }\n  if( mActorForInput2 )\n  {\n    mActorForInput2.SetSize(mTargetSize);\n  }\n  if( mActorForComposite )\n  {\n    mActorForComposite.SetSize(mTargetSize);\n  }\n}\n\nvoid EmbossFilter::CreateRenderTasks()\n{\n  RenderTaskList taskList = Stage::GetCurrent().GetRenderTaskList();\n\n  mRenderTaskForEmboss1 = taskList.CreateTask();\n  mRenderTaskForEmboss1.SetRefreshRate( mRefreshOnDemand ? RenderTask::REFRESH_ONCE : RenderTask::REFRESH_ALWAYS );\n  mRenderTaskForEmboss1.SetSourceActor( mActorForInput1 );\n  mRenderTaskForEmboss1.SetExclusive(true);\n  mRenderTaskForEmboss1.SetInputEnabled( false );\n  mRenderTaskForEmboss1.SetClearColor( Vector4( 0.0f, 0.0f, 0.0f, 0.0f ) );\n  mRenderTaskForEmboss1.SetClearEnabled( true );\n  mRenderTaskForEmboss1.SetTargetFrameBuffer( mImageForEmboss1 );\n  mRenderTaskForEmboss1.SetCameraActor( mCameraActor );\n\n  mRenderTaskForEmboss2 = taskList.CreateTask();\n  mRenderTaskForEmboss2.SetRefreshRate( mRefreshOnDemand ? RenderTask::REFRESH_ONCE : RenderTask::REFRESH_ALWAYS );\n  mRenderTaskForEmboss2.SetSourceActor( mActorForInput2 );\n  mRenderTaskForEmboss2.SetExclusive(true);\n  mRenderTaskForEmboss2.SetInputEnabled( false );\n  mRenderTaskForEmboss2.SetClearColor( Vector4( 1.0f, 1.0f, 1.0f, 0.0f ) );\n  mRenderTaskForEmboss2.SetClearEnabled( true );\n  mRenderTaskForEmboss2.SetTargetFrameBuffer( mImageForEmboss2 );\n  mRenderTaskForEmboss2.SetCameraActor( mCameraActor );\n\n  mRenderTaskForOutput = taskList.CreateTask();\n  mRenderTaskForOutput.SetRefreshRate( mRefreshOnDemand ? RenderTask::REFRESH_ONCE : RenderTask::REFRESH_ALWAYS );\n  mRenderTaskForOutput.SetSourceActor( mActorForComposite );\n  mRenderTaskForOutput.SetExclusive(true);\n  mRenderTaskForOutput.SetInputEnabled( false );\n  mRenderTaskForOutput.SetClearColor( Vector4( 0.5f, 0.5f, 0.5f, 0.0f ) );\n  mRenderTaskForOutput.SetClearEnabled( true );\n  mRenderTaskForOutput.SetTargetFrameBuffer( mOutputImage );\n  mRenderTaskForOutput.SetCameraActor( mCameraActor );\n}\n\n} \/\/ namespace Internal\n\n} \/\/ namespace Toolkit\n\n} \/\/ namespace Dali\n<|endoftext|>"}
{"text":"<commit_before>#include \"Array.h\"\n#include \"Runtime.h\"\n#include \"SnowString.h\"\n#include \"Function.h\"\n#include <sstream>\n\n#define DEFAULT_ARRAY_LENGTH 8\n\nnamespace snow {\n\tGC_ROOTS_IMPL(Array) {\n\t\tGC_SUPER(Object);\n\t\t\n\t\tGC_ROOT(m_Data);\n\t\tfor (size_t i = 0; i < m_Length; ++i) {\n\t\t\tGC_ROOT(m_Data[i]);\n\t\t}\n\t}\n\n\tvoid Array::resize(size_t new_size) {\n\t\t\/\/ TODO: Grow more than strictly necessary to minimize allocations\n\t\tVALUE* old_pointer = m_Data;\n\t\tm_Data = new(kGarbage, kBlob) VALUE[new_size];\n\t\tm_AllocatedSize = new_size;\n\t\tif (m_Length != 0 && old_pointer) {\n\t\t\tmemcpy(m_Data, old_pointer, m_Length*sizeof(VALUE));\n\t\t}\n\t}\n\t\n\tArray::Array(size_t preallocate_length) : Object(array_prototype()), m_Data(NULL), m_Length(0), m_AllocatedSize(0) {\n\t\tif (preallocate_length == 0)\n\t\t\tpreallocate_length = DEFAULT_ARRAY_LENGTH;\n\t\tresize(preallocate_length * sizeof(VALUE));\n\t}\n\t\n\tArray::Array(const Array& other) : Object(array_prototype()), m_Data(other.m_Data), m_Length(other.m_Length), m_AllocatedSize(0) {\n\t\tresize(m_Length * sizeof(VALUE));\n\t}\n\t\n\tArray::Array(VALUE* existing_array, size_t len, bool copy) : Object(array_prototype()), m_Data(existing_array), m_Length(len), m_AllocatedSize(0) {\n\t\tif (copy)\n\t\t\tresize(m_Length * sizeof(VALUE));\n\t}\n\t\n\tvoid Array::ensure_length(size_t len) {\n\t\tASSERT(!is_frozen());\n\t\tif (len * sizeof(VALUE) <= m_AllocatedSize)\n\t\t\treturn;\n\t\tresize(len * sizeof(VALUE));\n\t}\n\t\n\tVALUE& Array::operator[](int64_t idx) {\n\t\tif (idx < 0)\n\t\t\tidx %= m_Length;\n\t\tif (idx >= (int64_t)m_Length)\n\t\t{\n\t\t\tensure_length(idx+1);\n\t\t\tauto old_length = m_Length;\n\t\t\tm_Length = idx+1;\n\t\t\tfor (size_t i = old_length; i < m_Length; ++i) {\n\t\t\t\tm_Data[i] = nil();\n\t\t\t}\n\t\t}\n\t\treturn m_Data[idx];\n\t}\n\t\n\tVALUE Array::operator[](int64_t idx) const {\n\t\tif (idx < 0)\n\t\t\tidx = m_Length + idx;\n\t\tif (idx < 0 || idx >= (int64_t)m_Length)\n\t\t\treturn nil();\n\t\treturn m_Data[idx];\n\t}\n\t\n\tVALUE Array::push(VALUE val) {\n\t\tensure_length(m_Length + 1);\n\t\tm_Data[m_Length] = val;\n\t\t++m_Length;\n\t\treturn val;\n\t}\n\t\n\tVALUE Array::pop() {\n\t\tASSERT(!is_frozen());\n\t\tif (m_Length == 0)\n\t\t\treturn nil();\n\t\tVALUE val = m_Data[m_Length-1];\n\t\t--m_Length;\n\t\treturn val;\n\t}\n\t\n\tVALUE Array::unshift(VALUE val) {\n\t\tensure_length(m_Length+1);\n\t\t\/\/ XXX: For some reason, memmove doesn't work here. Investigate!\n\t\t\/\/ Also, this might be acceptable, since it's faster than memmove.\n\t\tfor (size_t i = 0; i < m_Length; ++i) {\n\t\t\tm_Data[m_Length-i] = m_Data[m_Length-1-i];\n\t\t}\n\t\t++m_Length;\n\t\tm_Data[0] = val;\n\t\treturn val;\n\t}\n\t\n\tVALUE Array::shift() {\n\t\tASSERT(!is_frozen());\n\t\tif (m_Length == 0)\n\t\t\treturn nil();\n\t\tVALUE val = m_Data[0];\n\t\t--m_Length;\n\t\tmemmove(m_Data, &m_Data[1], m_Length);\n\t\treturn val;\n\t}\n\t\n\tVALUE Array::va_call(VALUE self, uint64_t num_args, va_list& args) {\n\t\tif (num_args == 0)\n\t\t\treturn this;\n\t\tif (num_args == 1) {\n\t\t\tint64_t index = integer(va_arg(args, VALUE));\n\t\t\treturn (*this)[index];\n\t\t}\n\t\t\/\/ TODO: ranges and such.\n\t\tTRAP();\n\t\treturn this;\n\t}\n\t\n\tstatic VALUE array_new(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\treturn new Array(args, num_args);\n\t}\n\t\n\tstatic VALUE array_get(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tASSERT_ARGS(num_args == 1);\n\t\tauto array = object_cast<Array>(self);\n\t\tint64_t idx = integer(args[0]);\n\t\treturn (*array)[idx];\n\t}\n\t\n\tstatic VALUE array_set(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tASSERT_ARGS(num_args == 2);\n\t\tauto array = object_cast<Array>(self);\n\t\tint idx = integer(args[0]);\n\t\tVALUE new_value = args[1];\n\t\treturn array->set_by_index(idx, new_value);\n\t}\n\t\n\tstatic VALUE array_each(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tASSERT_ARGS(num_args >= 1);\n\t\tauto array = object_cast<Array>(self);\n\t\t\n\t\tVALUE closure = args[0];\n\t\tfor (size_t i = 0; i < array->length(); ++i) {\n\t\t\tsnow::call(NULL, closure, 2, (*array)[i], value((int64_t)i));\n\t\t}\n\t\treturn self;\n\t}\n\t\n\tstatic VALUE array_length(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tauto array = object_cast<Array>(self);\n\t\treturn value((int64_t)array->length());\n\t}\n\t\n\tstatic VALUE array_inspect(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tauto array = object_cast<Array>(self);\n\t\tstd::stringstream ss;\n\t\t\n\t\tss << \"@(\";\n\t\tfor (size_t i = 0; i < array->length(); ++i) {\n\t\t\tss << value_to_string(snow::call_method((*array)[i], \"inspect\", 0));\n\t\t\tif (i != array->length() - 1)\n\t\t\t\tss << \", \";\n\t\t}\n\t\tss << \")\";\n\t\t\n\t\treturn new String(ss.str());\n\t}\n\t\n\tstatic VALUE array_push(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tASSERT_ARGS(num_args == 1);\n\t\tauto array = object_cast<Array>(self);\n\t\tVALUE val = args[0];\n\t\tarray->push(val);\n\t\treturn self;\n\t}\n\t\n\tstatic VALUE array_pop(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tASSERT_ARGS(num_args == 0);\n\t\tauto array = object_cast<Array>(self);\n\t\treturn array->pop();\n\t}\n\t\n\tstatic VALUE array_unshift(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tASSERT_ARGS(num_args == 1);\n\t\tauto array = object_cast<Array>(self);\n\t\tVALUE val = args[0];\n\t\treturn array->unshift(val);\n\t}\n\t\n\tstatic VALUE array_shift(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tASSERT_ARGS(num_args == 0);\n\t\tauto array = object_cast<Array>(self);\n\t\treturn array->shift();\n\t}\n\t\n\tObject* array_prototype() {\n\t\tstatic Object* proto = NULL;\n\t\tif (proto) return proto;\n\t\tproto = new(kMalloc) Object;\n\t\tproto->set_raw_s(\"new\", new Function(array_new));\n\t\tproto->set_raw_s(\"get\", new Function(array_get));\n\t\tproto->set_raw_s(\"set\", new Function(array_set));\n\t\tproto->set_raw_s(\"each\", new Function(array_each));\n\t\tproto->set_raw_s(\"push\", new Function(array_push));\t\t\n\t\tproto->set_raw_s(\"pop\", new Function(array_pop));\n\t\tproto->set_raw_s(\"unshift\", new Function(array_unshift));\n\t\tproto->set_raw_s(\"shift\", new Function(array_shift));\n\t\tproto->set_property_getter(symbol(\"length\"), new Function(array_length));\n\t\tproto->set_raw_s(\"inspect\", new Function(array_inspect));\n\t\tproto->set_raw_s(\"<<\", new Function(array_push));\n\t\treturn proto;\n\t}\n}\n<commit_msg>Fixed Array.shift (closes #20). use of memmove appears to be unsafe, even for overlapping blobs.<commit_after>#include \"Array.h\"\n#include \"Runtime.h\"\n#include \"SnowString.h\"\n#include \"Function.h\"\n#include <sstream>\n\n#define DEFAULT_ARRAY_LENGTH 8\n\nnamespace snow {\n\tGC_ROOTS_IMPL(Array) {\n\t\tGC_SUPER(Object);\n\t\t\n\t\tGC_ROOT(m_Data);\n\t\tfor (size_t i = 0; i < m_Length; ++i) {\n\t\t\tGC_ROOT(m_Data[i]);\n\t\t}\n\t}\n\n\tvoid Array::resize(size_t new_size) {\n\t\t\/\/ TODO: Grow more than strictly necessary to minimize allocations\n\t\tVALUE* old_pointer = m_Data;\n\t\tm_Data = new(kGarbage, kBlob) VALUE[new_size];\n\t\tm_AllocatedSize = new_size;\n\t\tif (m_Length != 0 && old_pointer) {\n\t\t\tmemcpy(m_Data, old_pointer, m_Length*sizeof(VALUE));\n\t\t}\n\t}\n\t\n\tArray::Array(size_t preallocate_length) : Object(array_prototype()), m_Data(NULL), m_Length(0), m_AllocatedSize(0) {\n\t\tif (preallocate_length == 0)\n\t\t\tpreallocate_length = DEFAULT_ARRAY_LENGTH;\n\t\tresize(preallocate_length * sizeof(VALUE));\n\t}\n\t\n\tArray::Array(const Array& other) : Object(array_prototype()), m_Data(other.m_Data), m_Length(other.m_Length), m_AllocatedSize(0) {\n\t\tresize(m_Length * sizeof(VALUE));\n\t}\n\t\n\tArray::Array(VALUE* existing_array, size_t len, bool copy) : Object(array_prototype()), m_Data(existing_array), m_Length(len), m_AllocatedSize(0) {\n\t\tif (copy)\n\t\t\tresize(m_Length * sizeof(VALUE));\n\t}\n\t\n\tvoid Array::ensure_length(size_t len) {\n\t\tASSERT(!is_frozen());\n\t\tif (len * sizeof(VALUE) <= m_AllocatedSize)\n\t\t\treturn;\n\t\tresize(len * sizeof(VALUE));\n\t}\n\t\n\tVALUE& Array::operator[](int64_t idx) {\n\t\tif (idx < 0)\n\t\t\tidx %= m_Length;\n\t\tif (idx >= (int64_t)m_Length)\n\t\t{\n\t\t\tensure_length(idx+1);\n\t\t\tauto old_length = m_Length;\n\t\t\tm_Length = idx+1;\n\t\t\tfor (size_t i = old_length; i < m_Length; ++i) {\n\t\t\t\tm_Data[i] = nil();\n\t\t\t}\n\t\t}\n\t\treturn m_Data[idx];\n\t}\n\t\n\tVALUE Array::operator[](int64_t idx) const {\n\t\tif (idx < 0)\n\t\t\tidx = m_Length + idx;\n\t\tif (idx < 0 || idx >= (int64_t)m_Length)\n\t\t\treturn nil();\n\t\treturn m_Data[idx];\n\t}\n\t\n\tVALUE Array::push(VALUE val) {\n\t\tensure_length(m_Length + 1);\n\t\tm_Data[m_Length] = val;\n\t\t++m_Length;\n\t\treturn val;\n\t}\n\t\n\tVALUE Array::pop() {\n\t\tASSERT(!is_frozen());\n\t\tif (m_Length == 0)\n\t\t\treturn nil();\n\t\tVALUE val = m_Data[m_Length-1];\n\t\t--m_Length;\n\t\treturn val;\n\t}\n\t\n\tVALUE Array::unshift(VALUE val) {\n\t\tensure_length(m_Length+1);\n\t\t\/\/ XXX: For some reason, memmove doesn't work here. Investigate!\n\t\t\/\/ Also, this might be acceptable, since it's faster than memmove.\n\t\tfor (size_t i = 0; i < m_Length; ++i) {\n\t\t\tm_Data[m_Length-i] = m_Data[m_Length-1-i];\n\t\t}\n\t\t++m_Length;\n\t\tm_Data[0] = val;\n\t\treturn val;\n\t}\n\t\n\tVALUE Array::shift() {\n\t\tASSERT(!is_frozen());\n\t\tif (m_Length == 0)\n\t\t\treturn nil();\n\t\tVALUE val = m_Data[0];\n\t\t--m_Length;\n\t\tfor (size_t i = 0; i < m_Length; ++i) {\n\t\t\tm_Data[i] = m_Data[i+1];\n\t\t}\n\t\treturn val;\n\t}\n\t\n\tVALUE Array::va_call(VALUE self, uint64_t num_args, va_list& args) {\n\t\tif (num_args == 0)\n\t\t\treturn this;\n\t\tif (num_args == 1) {\n\t\t\tint64_t index = integer(va_arg(args, VALUE));\n\t\t\treturn (*this)[index];\n\t\t}\n\t\t\/\/ TODO: ranges and such.\n\t\tTRAP();\n\t\treturn this;\n\t}\n\t\n\tstatic VALUE array_new(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\treturn new Array(args, num_args);\n\t}\n\t\n\tstatic VALUE array_get(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tASSERT_ARGS(num_args == 1);\n\t\tauto array = object_cast<Array>(self);\n\t\tint64_t idx = integer(args[0]);\n\t\treturn (*array)[idx];\n\t}\n\t\n\tstatic VALUE array_set(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tASSERT_ARGS(num_args == 2);\n\t\tauto array = object_cast<Array>(self);\n\t\tint idx = integer(args[0]);\n\t\tVALUE new_value = args[1];\n\t\treturn array->set_by_index(idx, new_value);\n\t}\n\t\n\tstatic VALUE array_each(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tASSERT_ARGS(num_args >= 1);\n\t\tauto array = object_cast<Array>(self);\n\t\t\n\t\tVALUE closure = args[0];\n\t\tfor (size_t i = 0; i < array->length(); ++i) {\n\t\t\tsnow::call(NULL, closure, 2, (*array)[i], value((int64_t)i));\n\t\t}\n\t\treturn self;\n\t}\n\t\n\tstatic VALUE array_length(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tauto array = object_cast<Array>(self);\n\t\treturn value((int64_t)array->length());\n\t}\n\t\n\tstatic VALUE array_inspect(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tauto array = object_cast<Array>(self);\n\t\tstd::stringstream ss;\n\t\t\n\t\tss << \"@(\";\n\t\tfor (size_t i = 0; i < array->length(); ++i) {\n\t\t\tss << value_to_string(snow::call_method((*array)[i], \"inspect\", 0));\n\t\t\tif (i != array->length() - 1)\n\t\t\t\tss << \", \";\n\t\t}\n\t\tss << \")\";\n\t\t\n\t\treturn new String(ss.str());\n\t}\n\t\n\tstatic VALUE array_push(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tASSERT_ARGS(num_args == 1);\n\t\tauto array = object_cast<Array>(self);\n\t\tVALUE val = args[0];\n\t\tarray->push(val);\n\t\treturn self;\n\t}\n\t\n\tstatic VALUE array_pop(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tASSERT_ARGS(num_args == 0);\n\t\tauto array = object_cast<Array>(self);\n\t\treturn array->pop();\n\t}\n\t\n\tstatic VALUE array_unshift(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tASSERT_ARGS(num_args == 1);\n\t\tauto array = object_cast<Array>(self);\n\t\tVALUE val = args[0];\n\t\treturn array->unshift(val);\n\t}\n\t\n\tstatic VALUE array_shift(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tASSERT_ARGS(num_args == 0);\n\t\tauto array = object_cast<Array>(self);\n\t\treturn array->shift();\n\t}\n\t\n\tObject* array_prototype() {\n\t\tstatic Object* proto = NULL;\n\t\tif (proto) return proto;\n\t\tproto = new(kMalloc) Object;\n\t\tproto->set_raw_s(\"new\", new Function(array_new));\n\t\tproto->set_raw_s(\"get\", new Function(array_get));\n\t\tproto->set_raw_s(\"set\", new Function(array_set));\n\t\tproto->set_raw_s(\"each\", new Function(array_each));\n\t\tproto->set_raw_s(\"push\", new Function(array_push));\t\t\n\t\tproto->set_raw_s(\"pop\", new Function(array_pop));\n\t\tproto->set_raw_s(\"unshift\", new Function(array_unshift));\n\t\tproto->set_raw_s(\"shift\", new Function(array_shift));\n\t\tproto->set_property_getter(symbol(\"length\"), new Function(array_length));\n\t\tproto->set_raw_s(\"inspect\", new Function(array_inspect));\n\t\tproto->set_raw_s(\"<<\", new Function(array_push));\n\t\treturn proto;\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2015 CNRS\n\/\/ Copyright (c) 2015 Wandercraft, 86 rue de Paris 91400 Orsay, France.\n\/\/\n\/\/ This file is part of Pinocchio\n\/\/ Pinocchio 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\/\/ Pinocchio 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\/\/ Pinocchio If not, see\n\/\/ <http:\/\/www.gnu.org\/licenses\/>.\n\n#ifndef __math_sincos_hpp__\n#define __math_sincos_hpp__\n\n#include <cmath>\n\n#ifdef __linux__\n#define SINCOS sincos\n#elif __APPLE__\n#define SINCOS __sincos\n#elif __QNXNTO__\n#define SINCOS(a,sa,ca) (*sa) = std::sin(a); (*ca) = std::cos(a)\n#endif\n\n#endif \/\/#ifndef __math_sincos_hpp__\n<commit_msg>[C++] Set default SINCOS for architecture with no sincos function<commit_after>\/\/\n\/\/ Copyright (c) 2015-2016 CNRS\n\/\/ Copyright (c) 2015 Wandercraft, 86 rue de Paris 91400 Orsay, France.\n\/\/\n\/\/ This file is part of Pinocchio\n\/\/ Pinocchio 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\/\/ Pinocchio 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\/\/ Pinocchio If not, see\n\/\/ <http:\/\/www.gnu.org\/licenses\/>.\n\n#ifndef __math_sincos_hpp__\n#define __math_sincos_hpp__\n\n#include <cmath>\n\n#ifdef __linux__\n  #define SINCOS sincos\n#elif __APPLE__\n  #define SINCOS __sincos\n#else \/\/ if sincos specialization does not exist\n  #define SINCOS(a,sa,ca) (*sa) = std::sin(a); (*ca) = std::cos(a)\n#endif\n\n#endif \/\/#ifndef __math_sincos_hpp__\n<|endoftext|>"}
{"text":"<commit_before>\/\/  A simple echo server use select model\r\n\/\/  by ichenq@gmail.com \r\n\/\/  Oct 19, 2011\r\n\r\n#include \"..\/common\/utility.h\"\r\n#include <WinSock2.h>\r\n#include <WS2tcpip.h>\r\n#include <algorithm>\r\n\r\n#pragma warning(disable: 4127)\r\n#pragma comment(lib, \"ws2_32\")\r\n\r\n\r\n\r\nSOCKET  create_listen_socket(const _tstring& strHost, const _tstring& strPort);\r\n\r\n\/\/ event handlers\r\nvoid    on_close(SOCKET sockfd, SOCKET* socklist, int* count_ptr);\r\nbool    on_accept(SOCKET sockfd, SOCKET* socklist, int* count_ptr);\r\nbool    on_recv(SOCKET sockfd);\r\n\r\n\r\n\/\/ initialize winsock and other environment\r\nstatic global_init g_global_init;\r\n\r\n\/\/ main entry\r\nint _tmain(int argc, TCHAR* argv[])\r\n{\r\n    if (argc != 3)\r\n    {\r\n        _tprintf(_T(\"Usage: $program $host $port\"));\r\n        return 1;\r\n    }\r\n\r\n    SOCKET sockfd = create_listen_socket(argv[1], argv[2]);\r\n    if (sockfd == INVALID_SOCKET)\r\n    {\r\n        return 1;\r\n    }\r\n    \r\n    \/\/ total socket descriptor\r\n    SOCKET socklist[FD_SETSIZE] = {};\r\n\r\n    \/\/ we only concern readable socket set\r\n    FD_SET readset = {}; \r\n\r\n    \/\/ how many client sockets are avaliable\r\n    int total_count = 0;\r\n\r\n    for (;;)\r\n    {\r\n        FD_ZERO(&readset);\r\n        FD_SET(sockfd, &readset); \/\/ add listen socket\r\n        for (int i = 0; i < total_count; ++i)\r\n        {\r\n            FD_SET(socklist[i], &readset); \/\/ add client sockets\r\n        }\r\n\r\n        \/\/ 50 ms\r\n        timeval timeout = {0, 500*1000};\r\n        int nready = select(0, &readset, NULL, NULL, &timeout);\r\n        if (nready == SOCKET_ERROR)\r\n        {\r\n            _tprintf(_T(\"select() failed, %s\"), LAST_ERROR_MSG);\r\n            break;\r\n        }\r\n        if (nready == 0) \/\/ time limit expired, timer callback can be handled here\r\n        {            \r\n            continue;\r\n        }\r\n\r\n        \/\/ check one by one\r\n        for (int i = 0; i < nready; ++i)\r\n        {\r\n            if (FD_ISSET(socklist[i], &readset))\r\n            {\r\n                if (!on_recv(socklist[i]))\r\n                {\r\n                    \/\/ recv failed, close the socket\r\n                    on_close(socklist[i], socklist, &total_count);\r\n                }\r\n            }\r\n        }\r\n\r\n        \/\/ new accepted socket\r\n        if (FD_ISSET(sockfd, &readset))\r\n        {\r\n            on_accept(sockfd, socklist, &total_count);\r\n        }\r\n    }\r\n\r\n    closesocket(sockfd); \/\/ close the listen socket\r\n    return 0;\r\n}\r\n\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ handlers\r\n\r\nbool on_recv(SOCKET sockfd)\r\n{\r\n    char buf[BUFE_SIZE];\r\n    int bytes = recv(sockfd, buf, BUFE_SIZE, 0);\r\n    if (bytes == SOCKET_ERROR)\r\n    {\r\n        _tprintf(_T(\"recv() failed, %s\"), LAST_ERROR_MSG);\r\n        return false;\r\n    }\r\n    if (bytes == 0) \/\/ gracefully closed\r\n    {\r\n        return false;\r\n    }\r\n\r\n    bytes = send(sockfd, buf, bytes, 0);\r\n    if (bytes == SOCKET_ERROR)\r\n    {\r\n        _tprintf(_T(\"send() failed, %s\"), LAST_ERROR_MSG);\r\n        return false;\r\n    }\r\n\r\n    return true;\r\n}\r\n\r\nbool on_accept(SOCKET sockfd, SOCKET* socklist, int* count_ptr)\r\n{\r\n    assert(count_ptr);\r\n    if (*count_ptr == FD_SETSIZE - 1)\r\n    {\r\n        _tprintf(_T(\"got the 64 limit.\\n\"));\r\n        return false;\r\n    }\r\n\r\n    sockaddr_in addr = {};\r\n    int addrlen = sizeof(addr);\r\n    int socknew = accept(sockfd, (sockaddr*)&addr, &addrlen);\r\n    if (socknew == INVALID_SOCKET)\r\n    {\r\n        _tprintf(_T(\"accept() failed, %s\"), LAST_ERROR_MSG);\r\n        return false;\r\n    }\r\n\r\n    \/\/ set to non-blocking mode\r\n    ULONG nonblock = 1;\r\n    if (ioctlsocket(socknew, FIONBIO, &nonblock) == SOCKET_ERROR)\r\n    {\r\n        _tprintf(_T(\"ioctlsocket() failed, %s\"), LAST_ERROR_MSG);\r\n        closesocket(socknew);\r\n        return false;\r\n    }\r\n\r\n    _tprintf(_T(\"socket %d accepted at %s.\\n\"), socknew, Now().data());\r\n\r\n    socklist[*count_ptr] = socknew;\r\n    (*count_ptr)++;\r\n    return true;\r\n}\r\n\r\nvoid on_close(SOCKET sockfd, SOCKET* socklist, int* count_ptr)\r\n{\r\n    assert(count_ptr);\r\n    _tprintf(_T(\"socket %d closed at %s.\\n\"), sockfd, Now().data());\r\n\r\n    \/\/ find index of this socket\r\n    SOCKET* listend = socklist + (*count_ptr+1);\r\n    bool removed = (std::remove(socklist, listend, sockfd) != listend);\r\n    if (!removed)\r\n    {\r\n        _tprintf(_T(\"socket %d not found in list.\\n\"), sockfd);\r\n    }\r\n    else\r\n    {\r\n        closesocket(sockfd);\r\n        (*count_ptr)--;\r\n    }\r\n}\r\n\r\n\r\nSOCKET  create_listen_socket(const _tstring& strHost, const _tstring& strPort)\r\n{\r\n    sockaddr_in addr = {};\r\n    const _tstring& strAddr = strHost + _T(\":\") + strPort;\r\n    if (!StringToAddress(strAddr, &addr))\r\n    {\r\n        _tprintf(_T(\"cannot convert '%s' to socket address, %s\"), strAddr.data(), LAST_ERROR_MSG);\r\n        return INVALID_SOCKET;\r\n    }\r\n\r\n    SOCKET sockfd = socket(AF_INET, SOCK_STREAM, IPPROTO_TCP);\r\n    if (sockfd == INVALID_SOCKET)\r\n    {\r\n        _tprintf(_T(\"socket() failed, %s\"), LAST_ERROR_MSG);\r\n        return 0;\r\n    }\r\n\r\n    int error = bind(sockfd, (sockaddr*)&addr, sizeof(addr));\r\n    if (error == SOCKET_ERROR)\r\n    {\r\n        _tprintf(_T(\"bind() failed, %s\"), LAST_ERROR_MSG);\r\n        closesocket(sockfd);\r\n        return INVALID_SOCKET;\r\n    }\r\n\r\n    error = listen(sockfd, SOMAXCONN);\r\n    if (error == SOCKET_ERROR)\r\n    {\r\n        _tprintf(_T(\"listen() failed, %s\"), LAST_ERROR_MSG);\r\n        closesocket(sockfd);\r\n        return INVALID_SOCKET;\r\n    }\r\n\r\n    \/\/ set socket to non-blocking mode\r\n    ULONG nonblock = 1;\r\n    if (ioctlsocket(sockfd, FIONBIO, &nonblock) == SOCKET_ERROR)\r\n    {\r\n        _tprintf(_T(\"ioctlsocket() failed, %s\"), LAST_ERROR_MSG);\r\n        closesocket(sockfd);\r\n        return INVALID_SOCKET;\r\n    }\r\n\r\n    _tprintf(_T(\"server listen at %s, %s.\\n\"), strAddr.data(), Now().data());\r\n    return sockfd;\r\n}\r\n<commit_msg>select模型<commit_after>\/**\r\n *  @file   select.cpp\r\n *  @author ichenq@gmail.com\r\n *  @date   Oct 19, 2011\r\n *  @brief  使用select模型实现的简单Echo Server\r\n *\t\t\t为每个客户端连接创建一个线程\r\n *\/\r\n\r\n#include \"..\/common\/utility.h\"\r\n#include <assert.h>\r\n#include <set>\r\n\r\n\r\n\r\n#pragma warning(disable:4127)\r\n\r\n\/\/ 所有的客户端套接字\r\nstd::set<SOCKET>    g_total_sockets;\r\n\r\n\r\n\/\/ 处理接收数据\r\nbool on_recv(SOCKET sockfd)\r\n{\r\n    char buf[BUFSIZ];\r\n    int bytes = recv(sockfd, buf, BUFSIZ, 0);\r\n    if (bytes == SOCKET_ERROR)\r\n    {\r\n        fprintf(stderr, (\"recv() failed, %s\"), LAST_ERROR_MSG);\r\n        return false;\r\n    }\r\n    if (bytes == 0)\r\n    {\r\n        return false;\r\n    }\r\n\r\n    bytes = send(sockfd, buf, bytes, 0);\r\n    if (bytes == SOCKET_ERROR)\r\n    {\r\n        fprintf(stderr, (\"send() failed, %s\"), LAST_ERROR_MSG);\r\n        return false;\r\n    }\r\n\r\n    return true;\r\n}\r\n\r\n\/\/ 处理客户端连入\r\nbool on_accept(SOCKET sockfd)\r\n{\r\n    \/\/ 达到上限\r\n    if (g_total_sockets.size() == FD_SETSIZE - 1)\r\n    {\r\n        fprintf(stderr, (\"got the 64 limit.\\n\"));\r\n        return false;\r\n    }\r\n\r\n    sockaddr_in addr = {};\r\n    int addrlen = sizeof(addr);\r\n    int socknew = accept(sockfd, (sockaddr*)&addr, &addrlen);\r\n    if (socknew == INVALID_SOCKET)\r\n    {\r\n        fprintf(stderr, (\"accept() failed, %s\"), LAST_ERROR_MSG);\r\n        return false;\r\n    }\r\n\r\n    \/\/ 设置为非阻塞模式\r\n    ULONG nonblock = 1;\r\n    if (ioctlsocket(socknew, FIONBIO, &nonblock) == SOCKET_ERROR)\r\n    {\r\n        fprintf(stderr, (\"ioctlsocket() failed, %s\"), LAST_ERROR_MSG);\r\n        closesocket(socknew);\r\n        return false;\r\n    }\r\n\r\n    fprintf(stdout, (\"socket %d accepted at %s.\\n\"), socknew, Now().data());\r\n\r\n    g_total_sockets.insert(socknew);\r\n    return true;\r\n}\r\n\r\n\/\/ 处理客户端连接关闭\r\nvoid on_close(SOCKET sockfd)\r\n{\r\n    fprintf(stdout, (\"socket %d closed at %s.\\n\"), sockfd, Now().data());\r\n    closesocket(sockfd);\r\n}\r\n\r\n\/\/ 创建监听套接字\r\nSOCKET  create_listen_socket(const char* host, const char* port)\r\n{\r\n    addrinfo* aiList = NULL;\r\n    addrinfo hints = {};\r\n    hints.ai_family = AF_INET;          \/\/ TCP v4\r\n    hints.ai_socktype = SOCK_STREAM;\r\n    hints.ai_protocol = IPPROTO_TCP;\r\n    hints.ai_flags = AI_PASSIVE;\r\n    int error = getaddrinfo(host, port, &hints, &aiList);\r\n    if (error != 0)\r\n    {\r\n        fprintf(stderr, (\"getaddrinfo() failed, %s:%s, %s.\\n\"), host, port, gai_strerror(error));\r\n        return INVALID_SOCKET;\r\n    }\r\n\r\n    SOCKET sockfd = INVALID_SOCKET;\r\n    for (ADDRINFOT* pinfo = aiList; pinfo != NULL; pinfo = pinfo->ai_next)\r\n    {\r\n        sockfd = socket(pinfo->ai_family, pinfo->ai_socktype, pinfo->ai_protocol);\r\n        if (sockfd == INVALID_SOCKET)\r\n        {\r\n            fprintf(stderr, (\"socket() failed, %s\"), LAST_ERROR_MSG);\r\n            continue;\r\n        }\r\n        int error = bind(sockfd, pinfo->ai_addr, pinfo->ai_addrlen);\r\n        if (error == SOCKET_ERROR)\r\n        {\r\n            fprintf(stderr, (\"bind() failed, addr: %s, len: %d, %s\"), \r\n                pinfo->ai_addr, pinfo->ai_addrlen, LAST_ERROR_MSG);\r\n            closesocket(sockfd);\r\n            sockfd = INVALID_SOCKET;\r\n            continue;\r\n        }\r\n        error = listen(sockfd, SOMAXCONN);\r\n        if (error == SOCKET_ERROR)\r\n        {\r\n            fprintf(stderr, (\"listen() failed, %s\"), LAST_ERROR_MSG);\r\n            closesocket(sockfd);\r\n            continue;\r\n        }\r\n        \/\/ 需要将套接字设置为非阻塞模式\r\n        ULONG nonblock = 1;\r\n        if (ioctlsocket(sockfd, FIONBIO, &nonblock) == SOCKET_ERROR)\r\n        {\r\n            fprintf(stderr, (\"ioctlsocket() failed, %s\"), LAST_ERROR_MSG);\r\n            closesocket(sockfd);\r\n            return INVALID_SOCKET;\r\n        }\r\n        break;\r\n    }\r\n\r\n    freeaddrinfo(aiList);\r\n    fprintf(stdout, (\"server listen at %s:%s, %s.\\n\"), host, port, Now().data());\r\n    return sockfd;\r\n}\r\n\r\n\r\nbool select_loop(SOCKET sockfd)\r\n{\r\n    fd_set readset = {}; \r\n\r\n    \/\/ 添加监听套接字\r\n    FD_SET(sockfd, &readset);\r\n\r\n    \/\/ 添加客户端套接字 \r\n    for (std::set<SOCKET>::const_iterator iter = g_total_sockets.begin();\r\n        iter != g_total_sockets.end(); ++iter)\r\n    {\r\n        FD_SET(*iter, &readset);\r\n    }\r\n\r\n    \/\/ 50毫秒的超时\r\n    timeval timeout = {0, 500*1000};\r\n    int nready = select(0, &readset, NULL, NULL, &timeout);\r\n    if (nready == SOCKET_ERROR)\r\n    {\r\n        fprintf(stderr, (\"select() failed, %s\"), LAST_ERROR_MSG);\r\n        return false;\r\n    }\r\n    if (nready == 0) \/\/ 超时处理\r\n    {            \r\n        return true;\r\n    }\r\n\r\n    \/\/ 检查接收数据\r\n    std::set<SOCKET>::iterator iter = g_total_sockets.begin();\r\n    while (iter != g_total_sockets.end())\r\n    {\r\n        SOCKET fd = *iter;\r\n        if (FD_ISSET(fd, &readset))\r\n        {\r\n            if (!on_recv(fd))\r\n            {\r\n                on_close(fd); \/\/ 失败后关闭连接\r\n                iter = g_total_sockets.erase(iter);\r\n                continue;\r\n            }\r\n        }\r\n        ++iter;\r\n    }\r\n\r\n    \/\/ 是否有新连接\r\n    if (FD_ISSET(sockfd, &readset))\r\n    {\r\n        on_accept(sockfd);\r\n    }\r\n\r\n    return true;\r\n}\r\n\r\nint main(int argc, const char* argv[])\r\n{\r\n    if (argc != 3)\r\n    {\r\n        fprintf(stderr, (\"Usage: select [host] [port]\\n\"));\r\n        return 1;\r\n    }\r\n\r\n    WinsockInit init;\r\n    SOCKET sockfd = create_listen_socket(argv[1], argv[2]);\r\n    if (sockfd == INVALID_SOCKET)\r\n    {\r\n        return 1;\r\n    }\r\n    \r\n    while (select_loop(sockfd))\r\n    {        \r\n    }\r\n\r\n    closesocket(sockfd); \/\/ close the listen socket\r\n    return 0;\r\n}\r\n\r\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2019 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 \"google\/cloud\/spanner\/internal\/background_threads_impl.h\"\n#include <gmock\/gmock.h>\n\nnamespace google {\nnamespace cloud {\nnamespace spanner {\ninline namespace SPANNER_CLIENT_NS {\nnamespace internal {\nnamespace {\n\n\/\/\/ @test Verify we can create and use a CustomerSuppliedBackgroundThreads\n\/\/\/ without impacting the completion queue\nTEST(CustomerSuppliedBackgroundThreads, LifecycleNoShutdown) {\n  grpc_utils::CompletionQueue cq;\n  promise<void> p;\n  std::thread t([&cq, &p] {\n    cq.Run();\n    p.set_value();\n  });\n\n  { CustomerSuppliedBackgroundThreads actual(cq); }\n\n  using ms = std::chrono::milliseconds;\n\n  auto has_shutdown = p.get_future();\n  EXPECT_NE(std::future_status::ready, has_shutdown.wait_for(ms(2)));\n\n  auto expired = cq.MakeRelativeTimer(ms(0));\n  EXPECT_EQ(std::future_status::ready, expired.wait_for(ms(100)));\n\n  cq.Shutdown();\n  EXPECT_EQ(std::future_status::ready, has_shutdown.wait_for(ms(100)));\n\n  t.join();\n}\n\n\/\/\/ @test Verify that users can supply their own queue and threads.\nTEST(CustomerSuppliedBackgroundThreads, SharesCompletionQueue) {\n  grpc_utils::CompletionQueue cq;\n\n  CustomerSuppliedBackgroundThreads actual(cq);\n\n  \/\/ Verify the completion queue is shared, scheduling work in actual.cq() works\n  \/\/ if our thread is blocked in cq.Run().\n  std::thread t([&cq] { cq.Run(); });\n  using ms = std::chrono::milliseconds;\n  future<std::thread::id> id = actual.cq().MakeRelativeTimer(ms(0)).then(\n      [](future<std::chrono::system_clock::time_point>) {\n        return std::this_thread::get_id();\n      });\n  EXPECT_EQ(std::future_status::ready, id.wait_for(ms(100)));\n  EXPECT_EQ(t.get_id(), id.get());\n\n  cq.Shutdown();\n  t.join();\n}\n\n\/\/\/ @test Verify that automatically created completion queues are usable.\nTEST(AutomaticallyCreatedBackgroundThreads, IsActive) {\n  AutomaticallyCreatedBackgroundThreads actual;\n\n  using ms = std::chrono::milliseconds;\n\n  auto expired = actual.cq().MakeRelativeTimer(ms(0));\n  EXPECT_EQ(std::future_status::ready, expired.wait_for(ms(100)));\n}\n\n}  \/\/ namespace\n}  \/\/ namespace internal\n}  \/\/ namespace SPANNER_CLIENT_NS\n}  \/\/ namespace spanner\n}  \/\/ namespace cloud\n}  \/\/ namespace google\n<commit_msg>bug: remove another flaky test (googleapis\/google-cloud-cpp-spanner#1087)<commit_after>\/\/ Copyright 2019 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 \"google\/cloud\/spanner\/internal\/background_threads_impl.h\"\n#include <gmock\/gmock.h>\n\nnamespace google {\nnamespace cloud {\nnamespace spanner {\ninline namespace SPANNER_CLIENT_NS {\nnamespace internal {\nnamespace {\n\n\/\/\/ @test Verify we can create and use a CustomerSuppliedBackgroundThreads\n\/\/\/ without impacting the completion queue\nTEST(CustomerSuppliedBackgroundThreads, LifecycleNoShutdown) {\n  grpc_utils::CompletionQueue cq;\n  promise<void> p;\n  std::thread t([&cq, &p] {\n    cq.Run();\n    p.set_value();\n  });\n\n  { CustomerSuppliedBackgroundThreads actual(cq); }\n\n  using ms = std::chrono::milliseconds;\n\n  auto has_shutdown = p.get_future();\n  EXPECT_NE(std::future_status::ready, has_shutdown.wait_for(ms(2)));\n\n  auto expired = cq.MakeRelativeTimer(ms(0));\n  EXPECT_EQ(std::future_status::ready, expired.wait_for(ms(100)));\n\n  cq.Shutdown();\n  EXPECT_EQ(std::future_status::ready, has_shutdown.wait_for(ms(100)));\n\n  t.join();\n}\n\n\/\/\/ @test Verify that users can supply their own queue and threads.\nTEST(CustomerSuppliedBackgroundThreads, SharesCompletionQueue) {\n  grpc_utils::CompletionQueue cq;\n\n  CustomerSuppliedBackgroundThreads actual(cq);\n\n  using ms = std::chrono::milliseconds;\n  \/\/ Verify the completion queue is shared. Scheduling work in actual.cq() works\n  \/\/ once a thread is blocked in cq.Run(). Start that thread after scheduling\n  \/\/ the work to avoid flaky failures where the timer expires immediately.\n  future<std::thread::id> id = actual.cq().MakeRelativeTimer(ms(1)).then(\n      [](future<std::chrono::system_clock::time_point>) {\n        return std::this_thread::get_id();\n      });\n  std::thread t([&cq] { cq.Run(); });\n  EXPECT_EQ(std::future_status::ready, id.wait_for(ms(100)));\n  EXPECT_EQ(t.get_id(), id.get());\n\n  cq.Shutdown();\n  t.join();\n}\n\n\/\/\/ @test Verify that automatically created completion queues are usable.\nTEST(AutomaticallyCreatedBackgroundThreads, IsActive) {\n  AutomaticallyCreatedBackgroundThreads actual;\n\n  using ms = std::chrono::milliseconds;\n\n  auto expired = actual.cq().MakeRelativeTimer(ms(0));\n  EXPECT_EQ(std::future_status::ready, expired.wait_for(ms(100)));\n}\n\n}  \/\/ namespace\n}  \/\/ namespace internal\n}  \/\/ namespace SPANNER_CLIENT_NS\n}  \/\/ namespace spanner\n}  \/\/ namespace cloud\n}  \/\/ namespace google\n<|endoftext|>"}
{"text":"<commit_before>#include <Core\/Resources\/Resources.hpp>\n#include <Core\/Utils\/StdFilesystem.hpp>\n#include <Gui\/Utils\/KeyMappingManager.hpp>\n\n#include <catch2\/catch.hpp>\n\n#include <QtGlobal>\n\nusing namespace Ra;\nusing namespace Ra::Gui;\nusing Idx = KeyMappingManager::KeyMappingAction;\nusing Ctx = KeyMappingManager::Context;\n\nclass Dummy : public KeyMappingManageable<Dummy>\n{\n  public:\n    Dummy();\n    friend class KeyMappingManageable<Dummy>;\n\n  private:\n    bool checkIntegrity( const std::string& mess ) const;\n    static void configureKeyMapping_impl();\n\n    \/\/ here in public for testing purpose\n  public:\n#define KeyMappingDummy \\\n    KMA_VALUE( TEST1 )  \\\n    KMA_VALUE( TEST2 )\n\n#define KMA_VALUE( XX ) static KeyMappingManager::KeyMappingAction XX;\n    KeyMappingDummy\n#undef KMA_VALUE\n};\n\nusing KeyMapping = KeyMappingManageable<Dummy>;\n\n#define KMA_VALUE( XX ) Gui::KeyMappingManager::KeyMappingAction Dummy::XX;\nKeyMappingDummy\n#undef KMA_VALUE\n\n    void\n    Dummy::configureKeyMapping_impl() {\n\n    KeyMapping::setContext( Gui::KeyMappingManager::getInstance()->getContext( \"DummyContext\" ) );\n    if ( Dummy::getContext().isInvalid() )\n    {\n        LOG( Ra::Core::Utils::logINFO )\n            << \"DummyContext not defined (maybe the configuration file do not contains it)\";\n        return;\n    }\n\n#define KMA_VALUE( XX ) \\\n    XX = Gui::KeyMappingManager::getInstance()->getActionIndex( KeyMapping::getContext(), #XX );\n    KeyMappingDummy\n#undef KMA_VALUE\n}\n\nTEST_CASE( \"Gui\/Utils\/KeyMappingManager\", \"[Gui][Gui\/Utils][KeyMappingManager]\" ) {\n    QCoreApplication::setOrganizationName( \"RadiumUnitTests\" );\n    QCoreApplication::setApplicationName( \"KeyMappingManager\" );\n    QSettings settings;\n    settings.clear();\n    KeyMappingManager::createInstance();\n    auto mgr = Gui::KeyMappingManager::getInstance();\n    auto optionalPath {Core::Resources::getRadiumResourcesPath()};\n    auto resourcesRootDir {optionalPath.value_or( \"[[Default resrouces path not found]]\" )};\n    \/\/\/\\todo how to check here ?\n    auto defaultConfigFile = resourcesRootDir + std::string( \"Configs\/default.xml\" );\n\n    SECTION( \"key mapping file load\" ) {\n        REQUIRE( defaultConfigFile == mgr->getLoadedFilename() );\n        mgr->loadConfiguration( \"dummy\" );\n        REQUIRE( defaultConfigFile == mgr->getLoadedFilename() );\n        std::cout << std::filesystem::current_path() << \"\\n\";\n        mgr->loadConfiguration( \"data\/keymapping-valid.xml\" );\n        REQUIRE( \"data\/keymapping-valid.xml\" == mgr->getLoadedFilename() );\n        \/\/ invalid xml should not be loaded, and switch to default\n        mgr->loadConfiguration( \"data\/keymapping-invalid.xml\" );\n        REQUIRE( defaultConfigFile == mgr->getLoadedFilename() );\n        \/\/ while config error are loaded, with error message\n        mgr->loadConfiguration( \"data\/keymapping-double-actions.xml\" );\n        REQUIRE( \"data\/keymapping-double-actions.xml\" == mgr->getLoadedFilename() );\n        \/\/ bad tag load defaults\n        mgr->loadConfiguration( \"data\/keymapping-bad-tag.xml\" );\n        REQUIRE( defaultConfigFile == mgr->getLoadedFilename() );\n        \/\/ bad main tag loads with a warning\n        mgr->loadConfiguration( \"data\/keymapping-bad-main.xml\" );\n        REQUIRE( \"data\/keymapping-bad-main.xml\" == mgr->getLoadedFilename() );\n    }\n\n    SECTION( \"getAction\" ) {\n        mgr->loadConfiguration( \"data\/keymapping-valid.xml\" );\n        \/\/ check context\n        auto cameraContext {mgr->getContext( \"CameraContext\" )};\n        REQUIRE( cameraContext.isValid() );\n        REQUIRE( mgr->getContextName( cameraContext ) == \"CameraContext\" );\n\n        auto viewerContext {mgr->getContext( \"ViewerContext\" )};\n        REQUIRE( viewerContext.isValid() );\n        REQUIRE( viewerContext != cameraContext );\n\n        auto invalidContext {mgr->getContext( \"InvalidContext\" )};\n        REQUIRE( invalidContext.isInvalid() );\n        \/\/ invalidContext index returns \"Invalid\" context name\n        REQUIRE( mgr->getContextName( Ctx {} ) == \"Invalid\" );\n        REQUIRE( mgr->getContextName( Ctx {42} ) == \"Invalid\" );\n\n        \/\/ test on action\n        auto validAction {mgr->getAction( cameraContext, Qt::LeftButton, Qt::NoModifier, -1 )};\n        REQUIRE( validAction.isValid() );\n        REQUIRE( validAction == mgr->getActionIndex( cameraContext, \"TRACKBALLCAMERA_ROTATE\" ) );\n        REQUIRE( mgr->getActionIndex( Ctx {}, \"TRACKBALLCAMERA_ROTATE\" ).isInvalid() );\n        REQUIRE( mgr->getActionIndex( Ctx {42}, \"TRACKBALLCAMERA_ROTATE\" ).isInvalid() );\n        REQUIRE( mgr->getActionName( cameraContext, validAction ) == \"TRACKBALLCAMERA_ROTATE\" );\n\n        \/\/ invalid action index returns \"Invalid\" action name\n        REQUIRE( mgr->getActionName( cameraContext, Idx {} ) == \"Invalid\" );\n\n        \/\/ modifiers as key are ignored\n        validAction = mgr->getAction( cameraContext, Qt::LeftButton, Qt::ShiftModifier, -1 );\n        auto action2 {\n            mgr->getAction( cameraContext, Qt::LeftButton, Qt::ShiftModifier, Qt::Key_Shift )};\n        REQUIRE( validAction == action2 );\n\n        \/\/ tests some invalid actions\n        auto invalidAction {mgr->getAction( cameraContext, Qt::LeftButton, Qt::AltModifier, -1 )};\n        REQUIRE( invalidAction.isInvalid() );\n        REQUIRE( invalidAction != mgr->getActionIndex( cameraContext, \"TRACKBALLCAMERA_ROTATE\" ) );\n        REQUIRE( mgr->getAction( Idx {}, Qt::LeftButton, Qt::AltModifier, -1 ).isInvalid() );\n        REQUIRE( mgr->getAction( Idx {}, Qt::LeftButton, Qt::AltModifier, 1 ).isInvalid() );\n        REQUIRE( mgr->getAction( Idx {}, Qt::LeftButton, Qt::NoModifier, -1 ).isInvalid() );\n        REQUIRE( mgr->getAction( Idx {}, Qt::RightButton, Qt::AltModifier, -1 ).isInvalid() );\n\n        \/\/ with key and modifiers\n        validAction = mgr->getAction( viewerContext, Qt::RightButton, Qt::NoModifier, Qt::Key_V );\n        REQUIRE( validAction.isValid() );\n        REQUIRE( validAction == mgr->getActionIndex( viewerContext, \"VIEWER_PICKING_VERTEX\" ) );\n\n        \/\/ action index\n        REQUIRE( mgr->getActionIndex( viewerContext, \"UnkownAction\" ).isInvalid() );\n        validAction = mgr->getAction( viewerContext, Qt::NoButton, Qt::ControlModifier, Qt::Key_W );\n        REQUIRE( validAction.isValid() );\n        REQUIRE( validAction == mgr->getActionIndex( viewerContext, \"VIEWER_TOGGLE_WIREFRAME\" ) );\n\n        \/\/ action are context dependent\n        invalidAction = mgr->getAction( viewerContext, Qt::LeftButton, Qt::NoModifier, -1 );\n        REQUIRE( invalidAction.isInvalid() );\n        REQUIRE( mgr->getActionIndex( cameraContext, \"VIEWER_TOGGLE_WIREFRAME\" ).isInvalid() );\n    }\n\n    SECTION( \"listener\" ) {\n        \/\/ dummy1.xml\n        \/\/ LeftButton triggers TEST1, RightButton triggers TEST2\n        \/\/ (with index TEST1 : 0, TEST2: 1)\n        \/\/ dummy2.xml is the other way round dummy2.xml\n        \/\/ LeftButton triggers TEST2, RightButton triggers TEST1\n        \/\/ (with index TEST2: 0, TEST1: 1)\n\n        auto didx = mgr->addListener( Dummy::configureKeyMapping );\n        mgr->loadConfiguration( \"data\/dummy1.xml\" );\n\n        \/\/ action index correspond to configuration\n        auto test1Idx = mgr->getActionIndex( Dummy::getContext(), \"TEST1\" );\n        auto test2Idx = mgr->getActionIndex( Dummy::getContext(), \"TEST2\" );\n\n        REQUIRE( test1Idx ==\n                 mgr->getAction( Dummy::getContext(), Qt::LeftButton, Qt::NoModifier, -1 ) );\n        REQUIRE( test2Idx ==\n                 mgr->getAction( Dummy::getContext(), Qt::RightButton, Qt::NoModifier, -1 ) );\n        \/\/ and set in Dummy class\n        REQUIRE( Dummy::TEST1 == test1Idx );\n        REQUIRE( Dummy::TEST2 == test2Idx );\n\n        \/\/ reload trigger configureKeyMapping and update binding\/action index\n        mgr->loadConfiguration( \"data\/dummy2.xml\" );\n        auto test1Idx2 = mgr->getActionIndex( Dummy::getContext(), \"TEST1\" );\n        auto test2Idx2 = mgr->getActionIndex( Dummy::getContext(), \"TEST2\" );\n\n        \/\/ action index have been updated in Dummy class (by observation)\n        REQUIRE( Dummy::TEST1 ==\n                 mgr->getAction( Dummy::getContext(), Qt::RightButton, Qt::NoModifier, -1 ) );\n        REQUIRE( Dummy::TEST2 ==\n                 mgr->getAction( Dummy::getContext(), Qt::LeftButton, Qt::NoModifier, -1 ) );\n        \/\/ and do not corresponds to the old one\n        REQUIRE( test1Idx != Dummy::TEST1 );\n        REQUIRE( test2Idx != Dummy::TEST2 );\n\n        \/\/ remove listener and relaod do not update action index\n        mgr->removeListener( didx );\n        mgr->loadConfiguration( \"data\/dummy1.xml\" );\n        \/\/ action index have been reverted\n        REQUIRE( test1Idx ==\n                 mgr->getAction( Dummy::getContext(), Qt::LeftButton, Qt::NoModifier, -1 ) );\n        REQUIRE( test2Idx ==\n                 mgr->getAction( Dummy::getContext(), Qt::RightButton, Qt::NoModifier, -1 ) );\n        \/\/ but not updated in Dummy class\n        REQUIRE( Dummy::TEST1 != test1Idx );\n        REQUIRE( Dummy::TEST1 == test1Idx2 );\n        REQUIRE( Dummy::TEST2 != test2Idx );\n        REQUIRE( Dummy::TEST2 == test2Idx2 );\n    }\n\n    SECTION( \"Custom context and actions\" ) {\n        auto nonExistingcontext = mgr->getContext( \"Keymapping::CustomContext\" );\n        REQUIRE( nonExistingcontext.isInvalid() );\n        auto customContext = mgr->addContext( \"Keymapping::CustomContext\" );\n        REQUIRE( customContext.isValid() );\n        auto replicateContext = mgr->addContext( \"Keymapping::CustomContext\" );\n        REQUIRE( replicateContext == customContext );\n        auto customAction = mgr->addAction( customContext, \"CustomAction\", \"Key_F1\", \"\", \"\", \"\" );\n        REQUIRE( customAction.isValid() );\n        auto customActionDuplicate =\n            mgr->addAction( customContext, \"CustomAction\", \"Key_F1\", \"\", \"\", \"\" );\n        REQUIRE( customActionDuplicate.isInvalid() );\n        auto customActionInvalid =\n            mgr->addAction( nonExistingcontext, \"CustomAction\", \"Key_F1\", \"\", \"\", \"\" );\n        REQUIRE( customActionInvalid.isInvalid() );\n    }\n}\n<commit_msg>[tests] update keymapping unit test.<commit_after>#include <Core\/Resources\/Resources.hpp>\n#include <Core\/Utils\/StdFilesystem.hpp>\n#include <Gui\/Utils\/KeyMappingManager.hpp>\n\n#include <catch2\/catch.hpp>\n\n#include <QtGlobal>\n\nusing namespace Ra;\nusing namespace Ra::Gui;\nusing Idx = KeyMappingManager::KeyMappingAction;\nusing Ctx = KeyMappingManager::Context;\n\nclass Dummy : public KeyMappingManageable<Dummy>\n{\n  public:\n    Dummy();\n    friend class KeyMappingManageable<Dummy>;\n\n  private:\n    bool checkIntegrity( const std::string& mess ) const;\n    static void configureKeyMapping_impl();\n\n    \/\/ here in public for testing purpose\n  public:\n#define KeyMappingDummy \\\n    KMA_VALUE( TEST1 )  \\\n    KMA_VALUE( TEST2 )\n\n#define KMA_VALUE( XX ) static KeyMappingManager::KeyMappingAction XX;\n    KeyMappingDummy\n#undef KMA_VALUE\n};\n\nusing KeyMapping = KeyMappingManageable<Dummy>;\n\n#define KMA_VALUE( XX ) Gui::KeyMappingManager::KeyMappingAction Dummy::XX;\nKeyMappingDummy\n#undef KMA_VALUE\n\n    void\n    Dummy::configureKeyMapping_impl() {\n\n    KeyMapping::setContext( Gui::KeyMappingManager::getInstance()->getContext( \"DummyContext\" ) );\n    if ( Dummy::getContext().isInvalid() )\n    {\n        LOG( Ra::Core::Utils::logINFO )\n            << \"DummyContext not defined (maybe the configuration file do not contains it)\";\n        return;\n    }\n\n#define KMA_VALUE( XX ) \\\n    XX = Gui::KeyMappingManager::getInstance()->getActionIndex( KeyMapping::getContext(), #XX );\n    KeyMappingDummy\n#undef KMA_VALUE\n}\n\nTEST_CASE( \"Gui\/Utils\/KeyMappingManager\", \"[Gui][Gui\/Utils][KeyMappingManager]\" ) {\n    QCoreApplication::setOrganizationName( \"RadiumUnitTests\" );\n    QCoreApplication::setApplicationName( \"KeyMappingManager\" );\n    QSettings settings;\n    settings.clear();\n    KeyMappingManager::createInstance();\n    auto mgr = Gui::KeyMappingManager::getInstance();\n    auto optionalPath {Core::Resources::getRadiumResourcesPath()};\n    auto resourcesRootDir {optionalPath.value_or( \"[[Default resrouces path not found]]\" )};\n    \/\/\/\\todo how to check here ?\n    auto defaultConfigFile = resourcesRootDir + std::string( \"Configs\/default.xml\" );\n\n    SECTION( \"key mapping file load\" ) {\n        REQUIRE( defaultConfigFile == mgr->getLoadedFilename() );\n        mgr->loadConfiguration( \"dummy\" );\n        REQUIRE( defaultConfigFile == mgr->getLoadedFilename() );\n        std::cout << std::filesystem::current_path() << \"\\n\";\n        mgr->loadConfiguration( \"data\/keymapping-valid.xml\" );\n        REQUIRE( \"data\/keymapping-valid.xml\" == mgr->getLoadedFilename() );\n        \/\/ invalid xml should not be loaded, and switch to default\n        mgr->loadConfiguration( \"data\/keymapping-invalid.xml\" );\n        REQUIRE( defaultConfigFile == mgr->getLoadedFilename() );\n        \/\/ while config error are loaded, with error message\n        mgr->loadConfiguration( \"data\/keymapping-double-actions.xml\" );\n        REQUIRE( \"data\/keymapping-double-actions.xml\" == mgr->getLoadedFilename() );\n        \/\/ bad tag load defaults\n        mgr->loadConfiguration( \"data\/keymapping-bad-tag.xml\" );\n        REQUIRE( defaultConfigFile == mgr->getLoadedFilename() );\n        \/\/ bad main tag loads with a warning\n        mgr->loadConfiguration( \"data\/keymapping-bad-main.xml\" );\n        REQUIRE( \"data\/keymapping-bad-main.xml\" == mgr->getLoadedFilename() );\n    }\n\n    SECTION( \"getAction\" ) {\n        mgr->loadConfiguration( \"data\/keymapping-valid.xml\" );\n        \/\/ check context\n        auto cameraContext {mgr->getContext( \"CameraContext\" )};\n        REQUIRE( cameraContext.isValid() );\n        REQUIRE( mgr->getContextName( cameraContext ) == \"CameraContext\" );\n\n        auto viewerContext {mgr->getContext( \"ViewerContext\" )};\n        REQUIRE( viewerContext.isValid() );\n        REQUIRE( viewerContext != cameraContext );\n\n        auto invalidContext {mgr->getContext( \"InvalidContext\" )};\n        REQUIRE( invalidContext.isInvalid() );\n        \/\/ invalidContext index returns \"Invalid\" context name\n        REQUIRE( mgr->getContextName( Ctx {} ) == \"Invalid\" );\n        REQUIRE( mgr->getContextName( Ctx {42} ) == \"Invalid\" );\n\n        \/\/ test on action\n        auto validAction {mgr->getAction( cameraContext, Qt::LeftButton, Qt::NoModifier, -1 )};\n        REQUIRE( validAction.isValid() );\n        REQUIRE( validAction == mgr->getActionIndex( cameraContext, \"TRACKBALLCAMERA_ROTATE\" ) );\n        REQUIRE( mgr->getActionIndex( Ctx {}, \"TRACKBALLCAMERA_ROTATE\" ).isInvalid() );\n        REQUIRE( mgr->getActionIndex( Ctx {42}, \"TRACKBALLCAMERA_ROTATE\" ).isInvalid() );\n        REQUIRE( mgr->getActionName( cameraContext, validAction ) == \"TRACKBALLCAMERA_ROTATE\" );\n\n        \/\/ invalid action index returns \"Invalid\" action name\n        REQUIRE( mgr->getActionName( cameraContext, Idx {} ) == \"Invalid\" );\n\n        \/\/ modifiers as key are ignored\n        validAction = mgr->getAction( cameraContext, Qt::LeftButton, Qt::ShiftModifier, -1 );\n        auto action2 {\n            mgr->getAction( cameraContext, Qt::LeftButton, Qt::ShiftModifier, Qt::Key_Shift )};\n        REQUIRE( validAction == action2 );\n\n        \/\/ tests some invalid actions\n        auto invalidAction {mgr->getAction( cameraContext, Qt::LeftButton, Qt::AltModifier, -1 )};\n        REQUIRE( invalidAction.isInvalid() );\n        REQUIRE( invalidAction != mgr->getActionIndex( cameraContext, \"TRACKBALLCAMERA_ROTATE\" ) );\n        REQUIRE( mgr->getAction( Idx {}, Qt::LeftButton, Qt::AltModifier, -1 ).isInvalid() );\n        REQUIRE( mgr->getAction( Idx {}, Qt::LeftButton, Qt::AltModifier, 1 ).isInvalid() );\n        REQUIRE( mgr->getAction( Idx {}, Qt::LeftButton, Qt::NoModifier, -1 ).isInvalid() );\n        REQUIRE( mgr->getAction( Idx {}, Qt::RightButton, Qt::AltModifier, -1 ).isInvalid() );\n\n        \/\/ with key and modifiers\n        validAction = mgr->getAction( viewerContext, Qt::RightButton, Qt::NoModifier, Qt::Key_V );\n        REQUIRE( validAction.isValid() );\n        REQUIRE( validAction == mgr->getActionIndex( viewerContext, \"VIEWER_PICKING_VERTEX\" ) );\n\n        \/\/ action index\n        REQUIRE( mgr->getActionIndex( viewerContext, \"UnkownAction\" ).isInvalid() );\n        validAction = mgr->getAction( viewerContext, Qt::NoButton, Qt::ControlModifier, Qt::Key_W );\n        REQUIRE( validAction.isValid() );\n        REQUIRE( validAction == mgr->getActionIndex( viewerContext, \"VIEWER_TOGGLE_WIREFRAME\" ) );\n\n        \/\/ action are context dependent\n        invalidAction = mgr->getAction( viewerContext, Qt::LeftButton, Qt::NoModifier, -1 );\n        REQUIRE( invalidAction.isInvalid() );\n        REQUIRE( mgr->getActionIndex( cameraContext, \"VIEWER_TOGGLE_WIREFRAME\" ).isInvalid() );\n    }\n\n    SECTION( \"listener\" ) {\n        \/\/ dummy1.xml\n        \/\/ LeftButton triggers TEST1, RightButton triggers TEST2\n        \/\/ (with index TEST1 : 0, TEST2: 1)\n        \/\/ dummy2.xml is the other way round dummy2.xml\n        \/\/ LeftButton triggers TEST2, RightButton triggers TEST1\n        \/\/ (with index TEST2: 0, TEST1: 1)\n\n        auto didx = mgr->addListener( Dummy::configureKeyMapping );\n        mgr->loadConfiguration( \"data\/dummy1.xml\" );\n\n        \/\/ action index correspond to configuration\n        auto test1Idx = mgr->getActionIndex( Dummy::getContext(), \"TEST1\" );\n        auto test2Idx = mgr->getActionIndex( Dummy::getContext(), \"TEST2\" );\n\n        REQUIRE( test1Idx ==\n                 mgr->getAction( Dummy::getContext(), Qt::LeftButton, Qt::NoModifier, -1 ) );\n        REQUIRE( test2Idx ==\n                 mgr->getAction( Dummy::getContext(), Qt::RightButton, Qt::NoModifier, -1 ) );\n        \/\/ and set in Dummy class\n        REQUIRE( Dummy::TEST1 == test1Idx );\n        REQUIRE( Dummy::TEST2 == test2Idx );\n\n        \/\/ reload trigger configureKeyMapping and update binding\/action index\n        mgr->loadConfiguration( \"data\/dummy2.xml\" );\n        auto test1Idx2 = mgr->getActionIndex( Dummy::getContext(), \"TEST1\" );\n        auto test2Idx2 = mgr->getActionIndex( Dummy::getContext(), \"TEST2\" );\n\n        \/\/ action index have been updated in Dummy class (by observation)\n        REQUIRE( Dummy::TEST1 ==\n                 mgr->getAction( Dummy::getContext(), Qt::RightButton, Qt::NoModifier, -1 ) );\n        REQUIRE( Dummy::TEST2 ==\n                 mgr->getAction( Dummy::getContext(), Qt::LeftButton, Qt::NoModifier, -1 ) );\n        \/\/ and do not corresponds to the old one\n        REQUIRE( test1Idx != Dummy::TEST1 );\n        REQUIRE( test2Idx != Dummy::TEST2 );\n\n        \/\/ remove listener and relaod do not update action index\n        mgr->removeListener( didx );\n        mgr->loadConfiguration( \"data\/dummy1.xml\" );\n        \/\/ action index have been reverted\n        REQUIRE( test1Idx ==\n                 mgr->getAction( Dummy::getContext(), Qt::LeftButton, Qt::NoModifier, -1 ) );\n        REQUIRE( test2Idx ==\n                 mgr->getAction( Dummy::getContext(), Qt::RightButton, Qt::NoModifier, -1 ) );\n        \/\/ but not updated in Dummy class\n        REQUIRE( Dummy::TEST1 != test1Idx );\n        REQUIRE( Dummy::TEST1 == test1Idx2 );\n        REQUIRE( Dummy::TEST2 != test2Idx );\n        REQUIRE( Dummy::TEST2 == test2Idx2 );\n    }\n\n    SECTION( \"Custom context and actions\" ) {\n        auto nonExistingcontext = mgr->getContext( \"Keymapping::CustomContext\" );\n        REQUIRE( nonExistingcontext.isInvalid() );\n        auto customContext = mgr->addContext( \"Keymapping::CustomContext\" );\n        REQUIRE( customContext.isValid() );\n        auto replicateContext = mgr->addContext( \"Keymapping::CustomContext\" );\n        REQUIRE( replicateContext == customContext );\n        auto customAction = mgr->addAction(\n            \"Keymapping::CustomContext\", \"CustomAction\", \"Key_F1\", \"\", \"\", \"\", false );\n        REQUIRE( customAction.isValid() );\n        auto customActionDuplicate = mgr->addAction(\n            \"Keymapping::CustomContext\", \"CustomAction\", \"Key_F1\", \"\", \"\", \"\", false );\n        REQUIRE( customActionDuplicate.isValid() );\n        REQUIRE( customActionDuplicate == customAction );\n        auto customActionOtherBinding = mgr->addAction(\n            \"Keymapping::CustomContext\", \"CustomAction\", \"Key_F2\", \"\", \"\", \"\", false );\n        REQUIRE( customActionOtherBinding.isValid() );\n        REQUIRE( customActionOtherBinding == customAction );\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n  * Touhou Community Reliant Automatic Patcher\n  * Tasogare Frontier support plugin\n  *\n  * ----\n  *\n  * Files list handling.\n  *\/\n\n#include <thcrap.h>\n#include <unordered_map>\n#include \"thcrap_tasofro.h\"\n\n\/\/ Normalized Hash\nDWORD SpecialFNVHash(const char *begin, const char *end, DWORD initHash = 0x811C9DC5u)\n{\n\tDWORD hash; \/\/ eax@1\n\tDWORD ch; \/\/ esi@2\n\n\tint inMBCS = 0;\n\tfor (hash = initHash; begin != end; hash = (hash ^ ch) * 0x1000193)\n\t{\n\t\tch = *begin++;\n\t\tif (!inMBCS && ((unsigned char)ch >= 0x81u && (unsigned char)ch <= 0x9Fu || (unsigned char)ch + 32 <= 0x1Fu)) inMBCS = 2;\n\t\tif (!inMBCS)\n\t\t{\n\t\t\tch = tolower(ch);  \/\/ bad ass style but WORKS PERFECTLY!\n\t\t\tif (ch == '\/') ch = '\\\\';\n\t\t}\n\t\telse inMBCS--;\n\t}\n\treturn hash * -1;\n}\n\nstd::unordered_map<DWORD, FileHeaderFull> fileHashToName;\nint LoadFileNameList(const char* FileName)\n{\n\tFILE* fp = fopen(FileName, \"rt\");\n\tif (!fp) return -1;\n\tchar FilePath[MAX_PATH] = { 0 };\n\twhile (fgets(FilePath, MAX_PATH, fp))\n\t{\n\t\tint tlen = strlen(FilePath);\n\t\twhile (tlen && FilePath[tlen - 1] == '\\n') FilePath[--tlen] = 0;\n\t\tDWORD thash = SpecialFNVHash(FilePath, FilePath + tlen);\n\t\tstrcpy(fileHashToName[thash].path, FilePath);\n\t}\n\tfclose(fp);\n\treturn 0;\n}\n\nint LoadFileNameListFromMemory(char* list, size_t size)\n{\n\twhile (size > 0)\n\t{\n\t\tsize_t len = 0;\n\t\twhile (len < size && list[len] != '\\r' && list[len] != '\\n') {\n\t\t\tlen++;\n\t\t}\n\t\tDWORD thash = SpecialFNVHash(list, list + len);\n\t\tstrncpy(fileHashToName[thash].path, list, len);\n\t\tlist += len;\n\t\tsize -= len;\n\t\twhile (len < size && (list[len] == '\\r' || list[len] == '\\n')) {\n\t\t\tlist++;\n\t\t\tsize--;\n\t\t}\n\t}\n\treturn 0;\n}\n\nDWORD filename_to_hash(const char* filename)\n{\n\treturn SpecialFNVHash(filename, filename + strlen(filename));\n}\n\nstruct FileHeaderFull* register_file_header(FileHeader* header, DWORD *key)\n{\n\tFileHeaderFull& full_header = fileHashToName[header->filename_hash];\n\n\tfull_header.filename_hash = header->filename_hash;\n\tfull_header.unknown = header->unknown;\n\tfull_header.offset = header->offset;\n\tfull_header.size = header->size;\n\n\tfull_header.key[0] = key[0] * -1;\n\tfull_header.key[1] = key[1] * -1;\n\tfull_header.key[2] = key[2] * -1;\n\tfull_header.key[3] = key[3] * -1;\n\tfull_header.effective_offset = -1;\n\tfull_header.orig_size = header->size;\n\n\tZeroMemory(&full_header.fr, sizeof(file_rep_t));\n\n\treturn &full_header;\n}\n\nstruct FileHeaderFull* hash_to_file_header(DWORD hash)\n{\n\tstd::unordered_map<DWORD, FileHeaderFull>::iterator it = fileHashToName.find(hash);\n\n\tif (it != fileHashToName.end())\n\t\treturn &it->second;\n\telse\n\t\treturn NULL;\n}<commit_msg>Tasofro: LoadFileNameListFromMemory: Correctly skip over line breaks.<commit_after>\/**\n  * Touhou Community Reliant Automatic Patcher\n  * Tasogare Frontier support plugin\n  *\n  * ----\n  *\n  * Files list handling.\n  *\/\n\n#include <thcrap.h>\n#include <unordered_map>\n#include \"thcrap_tasofro.h\"\n\n\/\/ Normalized Hash\nDWORD SpecialFNVHash(const char *begin, const char *end, DWORD initHash = 0x811C9DC5u)\n{\n\tDWORD hash; \/\/ eax@1\n\tDWORD ch; \/\/ esi@2\n\n\tint inMBCS = 0;\n\tfor (hash = initHash; begin != end; hash = (hash ^ ch) * 0x1000193)\n\t{\n\t\tch = *begin++;\n\t\tif (!inMBCS && ((unsigned char)ch >= 0x81u && (unsigned char)ch <= 0x9Fu || (unsigned char)ch + 32 <= 0x1Fu)) inMBCS = 2;\n\t\tif (!inMBCS)\n\t\t{\n\t\t\tch = tolower(ch);  \/\/ bad ass style but WORKS PERFECTLY!\n\t\t\tif (ch == '\/') ch = '\\\\';\n\t\t}\n\t\telse inMBCS--;\n\t}\n\treturn hash * -1;\n}\n\nstd::unordered_map<DWORD, FileHeaderFull> fileHashToName;\nint LoadFileNameList(const char* FileName)\n{\n\tFILE* fp = fopen(FileName, \"rt\");\n\tif (!fp) return -1;\n\tchar FilePath[MAX_PATH] = { 0 };\n\twhile (fgets(FilePath, MAX_PATH, fp))\n\t{\n\t\tint tlen = strlen(FilePath);\n\t\twhile (tlen && FilePath[tlen - 1] == '\\n') FilePath[--tlen] = 0;\n\t\tDWORD thash = SpecialFNVHash(FilePath, FilePath + tlen);\n\t\tstrcpy(fileHashToName[thash].path, FilePath);\n\t}\n\tfclose(fp);\n\treturn 0;\n}\n\nint LoadFileNameListFromMemory(char* list, size_t size)\n{\n\twhile (size > 0)\n\t{\n\t\tsize_t len = 0;\n\t\twhile (len < size && list[len] != '\\r' && list[len] != '\\n') {\n\t\t\tlen++;\n\t\t}\n\t\tDWORD thash = SpecialFNVHash(list, list + len);\n\t\tstrncpy(fileHashToName[thash].path, list, len);\n\t\tlist += len;\n\t\tsize -= len;\n\t\twhile (size > 0 && (list[0] == '\\r' || list[0] == '\\n')) {\n\t\t\tlist++;\n\t\t\tsize--;\n\t\t}\n\t}\n\treturn 0;\n}\n\nDWORD filename_to_hash(const char* filename)\n{\n\treturn SpecialFNVHash(filename, filename + strlen(filename));\n}\n\nstruct FileHeaderFull* register_file_header(FileHeader* header, DWORD *key)\n{\n\tFileHeaderFull& full_header = fileHashToName[header->filename_hash];\n\n\tfull_header.filename_hash = header->filename_hash;\n\tfull_header.unknown = header->unknown;\n\tfull_header.offset = header->offset;\n\tfull_header.size = header->size;\n\n\tfull_header.key[0] = key[0] * -1;\n\tfull_header.key[1] = key[1] * -1;\n\tfull_header.key[2] = key[2] * -1;\n\tfull_header.key[3] = key[3] * -1;\n\tfull_header.effective_offset = -1;\n\tfull_header.orig_size = header->size;\n\n\tZeroMemory(&full_header.fr, sizeof(file_rep_t));\n\n\treturn &full_header;\n}\n\nstruct FileHeaderFull* hash_to_file_header(DWORD hash)\n{\n\tstd::unordered_map<DWORD, FileHeaderFull>::iterator it = fileHashToName.find(hash);\n\n\tif (it != fileHashToName.end())\n\t\treturn &it->second;\n\telse\n\t\treturn NULL;\n}<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (C) 2014 BMW Group\n\/\/ Author: Lutz Bichler (lutz.bichler@bmw.de)\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 VSOMEIP_LOCAL_ROUTING_MANAGER_HPP\n#define VSOMEIP_LOCAL_ROUTING_MANAGER_HPP\n\n#include <map>\n#include <memory>\n#include <set>\n\n#include <boost\/asio\/io_service.hpp>\n\n#include <vsomeip\/primitive_types.hpp>\n\n#include \"endpoint_host.hpp\"\n\nnamespace vsomeip {\n\nclass endpoint;\n\nclass local_routing_manager:\npublic:\n\tvirtual ~local_routing_manager() {};\n\n\tvirtual endpoint * find_local_client(client_t _client) = 0;\n\tvirtual endpoint * create_local_client(client_t _client) = 0;\n\tvirtual endpoint * find_or_create_local_client(client_t _client) = 0;\n\tvirtual void remove_local_client(client_t) = 0;\n\n\tvirtual endpoint * find_local_service(service_t _service, instance_t _instance) = 0;\n\tvirtual void add_local_service(client_t _client, service_t _service, instance_t _instance) = 0;\n\tvirtual void remove_local_service(service_t _service, instance_t _instance) = 0;\n\n\t\/\/ endpoint_host\n\tvirtual void on_message(const byte_t *_data, length_t _length, endpoint *_receiver) = 0;\n};\n\n} \/\/ namespace vsomeip\n\n#endif \/\/ VSOMEIP_LOCAL_ROUTING_MANAGER_HPP\n<commit_msg>Removed unused base class. This needs to be reintroduced later, as proxy and implementation share the same code for local services.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ RUN: %clang_cc1 -verify -triple x86_64-apple-darwin -emit-llvm -o - %s | FileCheck %s\n\n\/\/ CHECK: @a = global i32 10\nint a = 10;\n\/\/ CHECK: @ar = constant i32* @a\nint &ar = a;\n\nvoid f();\n\/\/ CHECK: @fr = constant void ()* @_Z1fv\nvoid (&fr)() = f;\n\nstruct S { int& a; };\n\/\/ CHECK: @s = global %struct.S { i32* @a }\nS s = { a };\n\n\/\/ PR5581\nnamespace PR5581 {\nclass C {\npublic:\n  enum { e0, e1 };\n  unsigned f;\n};\n\n\/\/ CHECK: @_ZN6PR55812g0E = global %\"class.PR5581::C\" { i32 1 }\nC g0 = { C::e1 };\n}\n\nnamespace test2 {\n  struct A {\n    static const double d = 1.0;\n    static const float f = d \/ 2;\n    static int g();\n  } a;\n\n  \/\/ CHECK: @_ZN5test22t0E = global double {{1\\.0+e\\+0+}}, align 8\n  \/\/ CHECK: @_ZN5test22t1E = global [2 x double] [double {{1\\.0+e\\+0+}}, double {{5\\.0+e-0*}}1], align 16\n  \/\/ CHECK: @_ZN5test22t2E = global double* @_ZN5test21A1d\n  \/\/ CHECK: @_ZN5test22t3E = global {{.*}} @_ZN5test21A1g\n  double t0 = A::d;\n  double t1[] = { A::d, A::f };\n  const double *t2 = &a.d;\n  int (*t3)() = &a.g;\n}\n\n\/\/ We don't expect to fold this in the frontend, but make sure it doesn't crash.\n\/\/ CHECK: @PR9558 = global float 0.000000e+0\nfloat PR9558 = reinterpret_cast<const float&>(\"asd\");\n\n\/\/ An initialized const automatic variable cannot be promoted to a constant\n\/\/ global if it has a mutable member.\nstruct MutableMember {\n  mutable int n;\n};\nint writeToMutable() {\n  \/\/ CHECK-NOT: {{.*}}MM{{.*}} = {{.*}}constant\n  const MutableMember MM = { 0 };\n  return ++MM.n;\n}\n\n\/\/ Make sure we don't try to fold this in the frontend; the backend can't\n\/\/ handle it.\n\/\/ CHECK: @PR11705 = global i128 0\n__int128_t PR11705 = (__int128_t)&PR11705;\n\n\/\/ Make sure we don't try to fold this either.\n\/\/ CHECK: @_ZZ23UnfoldableAddrLabelDiffvE1x = internal global i128 0\nvoid UnfoldableAddrLabelDiff() { static __int128_t x = (long)&&a-(long)&&b; a:b:return;}\n\n\/\/ But make sure we do fold this.\n\/\/ CHECK: @_ZZ21FoldableAddrLabelDiffvE1x = internal global i64 sub (i64 ptrtoint (i8* blockaddress(@_Z21FoldableAddrLabelDiffv, %a)\nvoid FoldableAddrLabelDiff() { static long x = (long)&&a-(long)&&b; a:b:return;}\n<commit_msg>Fix test on Release builds.<commit_after>\/\/ RUN: %clang_cc1 -verify -triple x86_64-apple-darwin -emit-llvm -o - %s | FileCheck %s\n\n\/\/ CHECK: @a = global i32 10\nint a = 10;\n\/\/ CHECK: @ar = constant i32* @a\nint &ar = a;\n\nvoid f();\n\/\/ CHECK: @fr = constant void ()* @_Z1fv\nvoid (&fr)() = f;\n\nstruct S { int& a; };\n\/\/ CHECK: @s = global %struct.S { i32* @a }\nS s = { a };\n\n\/\/ PR5581\nnamespace PR5581 {\nclass C {\npublic:\n  enum { e0, e1 };\n  unsigned f;\n};\n\n\/\/ CHECK: @_ZN6PR55812g0E = global %\"class.PR5581::C\" { i32 1 }\nC g0 = { C::e1 };\n}\n\nnamespace test2 {\n  struct A {\n    static const double d = 1.0;\n    static const float f = d \/ 2;\n    static int g();\n  } a;\n\n  \/\/ CHECK: @_ZN5test22t0E = global double {{1\\.0+e\\+0+}}, align 8\n  \/\/ CHECK: @_ZN5test22t1E = global [2 x double] [double {{1\\.0+e\\+0+}}, double {{5\\.0+e-0*}}1], align 16\n  \/\/ CHECK: @_ZN5test22t2E = global double* @_ZN5test21A1d\n  \/\/ CHECK: @_ZN5test22t3E = global {{.*}} @_ZN5test21A1g\n  double t0 = A::d;\n  double t1[] = { A::d, A::f };\n  const double *t2 = &a.d;\n  int (*t3)() = &a.g;\n}\n\n\/\/ We don't expect to fold this in the frontend, but make sure it doesn't crash.\n\/\/ CHECK: @PR9558 = global float 0.000000e+0\nfloat PR9558 = reinterpret_cast<const float&>(\"asd\");\n\n\/\/ An initialized const automatic variable cannot be promoted to a constant\n\/\/ global if it has a mutable member.\nstruct MutableMember {\n  mutable int n;\n};\nint writeToMutable() {\n  \/\/ CHECK-NOT: {{.*}}MM{{.*}} = {{.*}}constant\n  const MutableMember MM = { 0 };\n  return ++MM.n;\n}\n\n\/\/ Make sure we don't try to fold this in the frontend; the backend can't\n\/\/ handle it.\n\/\/ CHECK: @PR11705 = global i128 0\n__int128_t PR11705 = (__int128_t)&PR11705;\n\n\/\/ Make sure we don't try to fold this either.\n\/\/ CHECK: @_ZZ23UnfoldableAddrLabelDiffvE1x = internal global i128 0\nvoid UnfoldableAddrLabelDiff() { static __int128_t x = (long)&&a-(long)&&b; a:b:return;}\n\n\/\/ But make sure we do fold this.\n\/\/ CHECK: @_ZZ21FoldableAddrLabelDiffvE1x = internal global i64 sub (i64 ptrtoint (i8* blockaddress(@_Z21FoldableAddrLabelDiffv\nvoid FoldableAddrLabelDiff() { static long x = (long)&&a-(long)&&b; a:b:return;}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ RUN: %clang_cc1 -triple x86_64-apple-darwin -verify -emit-llvm -o - %s | FileCheck %s\nvoid t1() {\n  \/\/ CHECK: define void @_Z2t1v\n  \/\/ CHECK: [[REFLOAD:%.*]] = load i32** @a, align 8\n  \/\/ CHECK: load i32* [[REFLOAD]], align 4\n  extern int& a;\n  int b = a; \n}\n\nvoid t2(int& a) {\n  \/\/ CHECK: define void @_Z2t2Ri\n  \/\/ CHECK: [[REFLOAD2:%.*]] = load i32** {{.*}}, align 8\n  \/\/ CHECK: load i32* [[REFLOAD2]], align 4\n  int b = a;\n}\n\nint g;\nint& gr = g;\nint& grr = gr;\nvoid t3() {\n  int b = gr;\n}\n\n\/\/ Test reference binding.\n\nstruct C { int a; };\nvoid f(const bool&);\nvoid f(const int&);\nvoid f(const _Complex int&);\nvoid f(const C&);\n\nC aggregate_return();\n\nbool& bool_reference_return();\nint& int_reference_return();\n_Complex int& complex_int_reference_return();\nC& aggregate_reference_return();\n\nvoid test_bool() {\n  bool a = true;\n  f(a);\n\n  f(true);\n  \n  bool_reference_return() = true;\n  a = bool_reference_return();\n  \n  struct { const bool& b; } b = { true };\n}\n\nvoid test_scalar() {\n  int a = 10;\n  f(a);\n  \n  struct { int bitfield : 3; } s = { 3 };\n  f(s.bitfield);\n  \n  f(10);\n\n  __attribute((vector_size(16))) typedef int vec4;\n  f((vec4){1,2,3,4}[0]);\n  \n  int_reference_return() = 10;\n  a = int_reference_return();\n  \n  struct { const int& a; } agg = { 10 };\n}\n\nvoid test_complex() {\n  _Complex int a = 10i;\n  f(a);\n  \n  f(10i);\n  \n  complex_int_reference_return() = 10i;\n  a = complex_int_reference_return();\n  \n  struct { const _Complex int &a; } agg = { 10i };\n}\n\nvoid test_aggregate() {\n  C c;\n  f(c);\n\n  f(aggregate_return());\n  aggregate_reference_return().a = 10;\n\n  c = aggregate_reference_return();\n  \n  struct { const C& a; } agg = { C() };\n}\n\nint& reference_return() {\n  return g;\n}\n\nint reference_decl() {\n  int& a = g;\n  const int& b = 1;\n  return a+b;\n}\n\nstruct A {\n  int& b();\n};\n\nvoid f(A* a) {\n  int b = a->b();\n}\n\n\/\/ PR5122\nvoid *foo = 0;\nvoid * const & kFoo = foo;\n\nstruct D : C { D(); ~D(); };\n\nvoid h() {\n  \/\/ CHECK: call void @_ZN1DD1Ev\n  const C& c = D();\n}\n\nnamespace T {\n  struct A {\n    A();\n    ~A();\n  };\n\n  struct B {\n    B();\n    ~B();\n    A f();\n  };\n\n  void f() {\n    \/\/ CHECK: call void @_ZN1T1BC1Ev\n    \/\/ CHECK: call void @_ZN1T1B1fEv\n    \/\/ CHECK: call void @_ZN1T1BD1Ev\n    const A& a = B().f();\n    \/\/ CHECK: call void @_ZN1T1fEv\n    f();\n    \/\/ CHECK: call void @_ZN1T1AD1Ev\n  }\n}\n\n\/\/ PR5227.\nnamespace PR5227 {\nvoid f(int &a) {\n  (a = 10) = 20;\n}\n}\n\n\/\/ PR5590\nstruct s0;\nstruct s1 { struct s0 &s0; };\nvoid f0(s1 a) { s1 b = a; }\n\n\/\/ PR6024\n\/\/ CHECK: @_Z2f2v()\n\/\/ CHECK: alloca i32,\n\/\/ CHECK-NEXT: store\n\/\/ CHECK-NEXT: ret\nconst int &f2() { return 0; }\n\n\/\/ Don't constant fold const reference parameters with default arguments to\n\/\/ their default arguments.\nnamespace N1 {\n  const int foo = 1;\n  \/\/ CHECK: @_ZN2N14test\n  void test(const int& arg = foo) {\n    \/\/ Ensure this array is on the stack where we can set values instead of\n    \/\/ being a global constant.\n    \/\/ CHECK: %args_array = alloca\n    const int* const args_array[] = { &arg };\n  }\n}\n\n\/\/ Bind to subobjects while extending the life of the complete object.\nnamespace N2 {\n  class X {\n  public:\n    X(const X&);\n    X &operator=(const X&);\n    ~X();\n  };\n\n  struct P {\n    X first;\n  };\n\n  P getP();\n\n  \/\/ CHECK: define void @_ZN2N21fEi\n  \/\/ CHECK: call void @_ZN2N24getPEv\n  \/\/ CHECK: getelementptr inbounds\n  \/\/ CHECK: store i32 17\n  \/\/ CHECK: call void @_ZN2N21PD1Ev\n  void f(int i) {\n    const X& xr = getP().first;\n    i = 17;\n  }\n\n  struct SpaceWaster {\n    int i, j;\n  };\n\n  struct ReallyHasX {\n    X x;\n  };\n\n  struct HasX : ReallyHasX { };\n\n  struct HasXContainer {\n    HasX has;\n  };\n\n  struct Y : SpaceWaster, HasXContainer { };\n  struct Z : SpaceWaster, Y { };\n\n  Z getZ();\n\n  \/\/ CHECK: define void @_ZN2N21gEi\n  \/\/ CHECK: call void @_ZN2N24getZEv\n  \/\/ CHECK: {{getelementptr inbounds.*i32 0, i32 0}}\n  \/\/ CHECK: {{getelementptr inbounds.*i32 0, i32 0}}\n  \/\/ CHECK: store i32 19\n  \/\/ CHECK: call void @_ZN2N21ZD1Ev\n  \/\/ CHECK: ret void\n  void g(int i) {\n    const X &xr = getZ().has.x;\n    i = 19;    \n  }\n}\n\nnamespace N3 {\n\n\/\/ PR7326\n\nstruct A {\n  explicit A(int);\n  ~A();\n};\n\n\/\/ CHECK: define internal void @__cxx_global_var_init\n\/\/ CHECK: call void @_ZN2N31AC1Ei(%\"struct.N3::A\"* @_ZGRN2N35sA123E, i32 123)\n\/\/ CHECK: call i32 @__cxa_atexit\n\/\/ CHECK: ret void\nconst A &sA123 = A(123);\n}\n\nnamespace N4 {\n  \nstruct A {\n  A();\n  ~A();\n};\n\nvoid f() {\n  \/\/ CHECK: define void @_ZN2N41fEv\n  \/\/ CHECK: call void @_ZN2N41AC1Ev(%\"struct.N4::A\"* @_ZGRZN2N41fEvE2ar)\n  \/\/ CHECK: call i32 @__cxa_atexit\n  \/\/ CHECK: ret void\n  static const A& ar = A();\n  \n}\n}\n\n\/\/ PR9494\nnamespace N5 {\nstruct AnyS { bool b; };\nvoid f(const bool&);\nAnyS g();\nvoid h() {\n  \/\/ CHECK: call i8 @_ZN2N51gEv()\n  \/\/ CHECK: call void @_ZN2N51fERKb(i8*\n  f(g().b);\n}\n}\n\n\/\/ PR9565\nnamespace PR9565 {\n  struct a { int a : 10, b : 10; };\n  \/\/ CHECK: define void @_ZN6PR95651fEv()\n  void f() {\n    \/\/ CHECK: call void @llvm.memcpy\n    a x = { 0, 0 };\n    \/\/ CHECK: [[WITH_SEVENTEEN:%[a-zA-Z0-9]+]] = or i32 [[WITHOUT_SEVENTEEN:%[a-zA-Z0-9]+]], 17\n    \/\/ CHECK: store i32 [[WITH_SEVENTEEN]], i32* [[XA:%[a-zA-Z0-9]+]]\n    x.a = 17;\n    \/\/ CHECK-NEXT: bitcast\n    \/\/ CHECK-NEXT: load \n    \/\/ CHECK-NEXT: and\n    \/\/ CHECK-NEXT: shl\n    \/\/ CHECK-NEXT: ashr\n    \/\/ CHECK-NEXT: store i32\n    \/\/ CHECK-NEXT: store i32*\n    const int &y = x.a;\n    \/\/ CHECK-NEXT: bitcast\n    \/\/ CHECK-NEXT: load\n    \/\/ CHECK-NEXT: and\n    \/\/ CHECK-NEXT: or\n    \/\/ CHECK-NEXT: store i32\n    x.b = 19;\n    \/\/ CHECK-NEXT: ret void\n  }\n}\n\nnamespace N6 {\n  extern struct x {char& x;}y;\n  int a() { return y.x; }\n  \/\/ CHECK: define i32 @_ZN2N61aEv\n  \/\/ CHECK: [[REFLOAD3:%.*]] = load i8** getelementptr inbounds (%\"struct.N6::x\"* @_ZN2N61yE, i32 0, i32 0), align 8\n  \/\/ CHECK: %0 = load i8* [[REFLOAD3]], align 1\n}\n<commit_msg>Fix test on Release builds.<commit_after>\/\/ RUN: %clang_cc1 -triple x86_64-apple-darwin -verify -emit-llvm -o - %s | FileCheck %s\nvoid t1() {\n  \/\/ CHECK: define void @_Z2t1v\n  \/\/ CHECK: [[REFLOAD:%.*]] = load i32** @a, align 8\n  \/\/ CHECK: load i32* [[REFLOAD]], align 4\n  extern int& a;\n  int b = a; \n}\n\nvoid t2(int& a) {\n  \/\/ CHECK: define void @_Z2t2Ri\n  \/\/ CHECK: [[REFLOAD2:%.*]] = load i32** {{.*}}, align 8\n  \/\/ CHECK: load i32* [[REFLOAD2]], align 4\n  int b = a;\n}\n\nint g;\nint& gr = g;\nint& grr = gr;\nvoid t3() {\n  int b = gr;\n}\n\n\/\/ Test reference binding.\n\nstruct C { int a; };\nvoid f(const bool&);\nvoid f(const int&);\nvoid f(const _Complex int&);\nvoid f(const C&);\n\nC aggregate_return();\n\nbool& bool_reference_return();\nint& int_reference_return();\n_Complex int& complex_int_reference_return();\nC& aggregate_reference_return();\n\nvoid test_bool() {\n  bool a = true;\n  f(a);\n\n  f(true);\n  \n  bool_reference_return() = true;\n  a = bool_reference_return();\n  \n  struct { const bool& b; } b = { true };\n}\n\nvoid test_scalar() {\n  int a = 10;\n  f(a);\n  \n  struct { int bitfield : 3; } s = { 3 };\n  f(s.bitfield);\n  \n  f(10);\n\n  __attribute((vector_size(16))) typedef int vec4;\n  f((vec4){1,2,3,4}[0]);\n  \n  int_reference_return() = 10;\n  a = int_reference_return();\n  \n  struct { const int& a; } agg = { 10 };\n}\n\nvoid test_complex() {\n  _Complex int a = 10i;\n  f(a);\n  \n  f(10i);\n  \n  complex_int_reference_return() = 10i;\n  a = complex_int_reference_return();\n  \n  struct { const _Complex int &a; } agg = { 10i };\n}\n\nvoid test_aggregate() {\n  C c;\n  f(c);\n\n  f(aggregate_return());\n  aggregate_reference_return().a = 10;\n\n  c = aggregate_reference_return();\n  \n  struct { const C& a; } agg = { C() };\n}\n\nint& reference_return() {\n  return g;\n}\n\nint reference_decl() {\n  int& a = g;\n  const int& b = 1;\n  return a+b;\n}\n\nstruct A {\n  int& b();\n};\n\nvoid f(A* a) {\n  int b = a->b();\n}\n\n\/\/ PR5122\nvoid *foo = 0;\nvoid * const & kFoo = foo;\n\nstruct D : C { D(); ~D(); };\n\nvoid h() {\n  \/\/ CHECK: call void @_ZN1DD1Ev\n  const C& c = D();\n}\n\nnamespace T {\n  struct A {\n    A();\n    ~A();\n  };\n\n  struct B {\n    B();\n    ~B();\n    A f();\n  };\n\n  void f() {\n    \/\/ CHECK: call void @_ZN1T1BC1Ev\n    \/\/ CHECK: call void @_ZN1T1B1fEv\n    \/\/ CHECK: call void @_ZN1T1BD1Ev\n    const A& a = B().f();\n    \/\/ CHECK: call void @_ZN1T1fEv\n    f();\n    \/\/ CHECK: call void @_ZN1T1AD1Ev\n  }\n}\n\n\/\/ PR5227.\nnamespace PR5227 {\nvoid f(int &a) {\n  (a = 10) = 20;\n}\n}\n\n\/\/ PR5590\nstruct s0;\nstruct s1 { struct s0 &s0; };\nvoid f0(s1 a) { s1 b = a; }\n\n\/\/ PR6024\n\/\/ CHECK: @_Z2f2v()\n\/\/ CHECK: alloca i32,\n\/\/ CHECK-NEXT: store\n\/\/ CHECK-NEXT: ret\nconst int &f2() { return 0; }\n\n\/\/ Don't constant fold const reference parameters with default arguments to\n\/\/ their default arguments.\nnamespace N1 {\n  const int foo = 1;\n  \/\/ CHECK: @_ZN2N14test\n  void test(const int& arg = foo) {\n    \/\/ Ensure this array is on the stack where we can set values instead of\n    \/\/ being a global constant.\n    \/\/ CHECK: %args_array = alloca\n    const int* const args_array[] = { &arg };\n  }\n}\n\n\/\/ Bind to subobjects while extending the life of the complete object.\nnamespace N2 {\n  class X {\n  public:\n    X(const X&);\n    X &operator=(const X&);\n    ~X();\n  };\n\n  struct P {\n    X first;\n  };\n\n  P getP();\n\n  \/\/ CHECK: define void @_ZN2N21fEi\n  \/\/ CHECK: call void @_ZN2N24getPEv\n  \/\/ CHECK: getelementptr inbounds\n  \/\/ CHECK: store i32 17\n  \/\/ CHECK: call void @_ZN2N21PD1Ev\n  void f(int i) {\n    const X& xr = getP().first;\n    i = 17;\n  }\n\n  struct SpaceWaster {\n    int i, j;\n  };\n\n  struct ReallyHasX {\n    X x;\n  };\n\n  struct HasX : ReallyHasX { };\n\n  struct HasXContainer {\n    HasX has;\n  };\n\n  struct Y : SpaceWaster, HasXContainer { };\n  struct Z : SpaceWaster, Y { };\n\n  Z getZ();\n\n  \/\/ CHECK: define void @_ZN2N21gEi\n  \/\/ CHECK: call void @_ZN2N24getZEv\n  \/\/ CHECK: {{getelementptr inbounds.*i32 0, i32 0}}\n  \/\/ CHECK: {{getelementptr inbounds.*i32 0, i32 0}}\n  \/\/ CHECK: store i32 19\n  \/\/ CHECK: call void @_ZN2N21ZD1Ev\n  \/\/ CHECK: ret void\n  void g(int i) {\n    const X &xr = getZ().has.x;\n    i = 19;    \n  }\n}\n\nnamespace N3 {\n\n\/\/ PR7326\n\nstruct A {\n  explicit A(int);\n  ~A();\n};\n\n\/\/ CHECK: define internal void @__cxx_global_var_init\n\/\/ CHECK: call void @_ZN2N31AC1Ei(%\"struct.N3::A\"* @_ZGRN2N35sA123E, i32 123)\n\/\/ CHECK: call i32 @__cxa_atexit\n\/\/ CHECK: ret void\nconst A &sA123 = A(123);\n}\n\nnamespace N4 {\n  \nstruct A {\n  A();\n  ~A();\n};\n\nvoid f() {\n  \/\/ CHECK: define void @_ZN2N41fEv\n  \/\/ CHECK: call void @_ZN2N41AC1Ev(%\"struct.N4::A\"* @_ZGRZN2N41fEvE2ar)\n  \/\/ CHECK: call i32 @__cxa_atexit\n  \/\/ CHECK: ret void\n  static const A& ar = A();\n  \n}\n}\n\n\/\/ PR9494\nnamespace N5 {\nstruct AnyS { bool b; };\nvoid f(const bool&);\nAnyS g();\nvoid h() {\n  \/\/ CHECK: call i8 @_ZN2N51gEv()\n  \/\/ CHECK: call void @_ZN2N51fERKb(i8*\n  f(g().b);\n}\n}\n\n\/\/ PR9565\nnamespace PR9565 {\n  struct a { int a : 10, b : 10; };\n  \/\/ CHECK: define void @_ZN6PR95651fEv()\n  void f() {\n    \/\/ CHECK: call void @llvm.memcpy\n    a x = { 0, 0 };\n    \/\/ CHECK: [[WITH_SEVENTEEN:%[a-zA-Z0-9]+]] = or i32 [[WITHOUT_SEVENTEEN:%[a-zA-Z0-9]+]], 17\n    \/\/ CHECK: store i32 [[WITH_SEVENTEEN]], i32* [[XA:%[a-zA-Z0-9]+]]\n    x.a = 17;\n    \/\/ CHECK-NEXT: bitcast\n    \/\/ CHECK-NEXT: load \n    \/\/ CHECK-NEXT: and\n    \/\/ CHECK-NEXT: shl\n    \/\/ CHECK-NEXT: ashr\n    \/\/ CHECK-NEXT: store i32\n    \/\/ CHECK-NEXT: store i32*\n    const int &y = x.a;\n    \/\/ CHECK-NEXT: bitcast\n    \/\/ CHECK-NEXT: load\n    \/\/ CHECK-NEXT: and\n    \/\/ CHECK-NEXT: or\n    \/\/ CHECK-NEXT: store i32\n    x.b = 19;\n    \/\/ CHECK-NEXT: ret void\n  }\n}\n\nnamespace N6 {\n  extern struct x {char& x;}y;\n  int a() { return y.x; }\n  \/\/ CHECK: define i32 @_ZN2N61aEv\n  \/\/ CHECK: [[REFLOAD3:%.*]] = load i8** getelementptr inbounds (%\"struct.N6::x\"* @_ZN2N61yE, i32 0, i32 0), align 8\n  \/\/ CHECK: load i8* [[REFLOAD3]], align 1\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\/float_v>\n#include \"benchmark.h\"\n#include <cstdio>\n#include <cstdlib>\n\nusing namespace Vc;\n\nenum {\n    Factor = 2000000 \/ float_v::Size\n};\n\nstatic float randomF(float min, float max)\n{\n    const float delta = max - min;\n    return min + delta * rand() \/ RAND_MAX;\n}\n\nstatic float randomF12() { return randomF(1.f, 2.f); }\n\nint bmain(Benchmark::OutputMode out)\n{\n    const int Repetitions = out == Benchmark::Stdout ? 10 : 100;\n\n    int blackHole = true;\n    {\n        Benchmark timer(\"class\", 8. * float_v::Size * Factor, \"FLOP\");\n        for (int repetitions = 0; repetitions < Repetitions; ++repetitions) {\n            const float_v alpha[4] = {\n                float_v(repetitions + randomF(.1f, .2f)),\n                float_v(repetitions - randomF(.1f, .2f)),\n                float_v(repetitions + randomF(.1f, .2f)),\n                float_v(repetitions - randomF(.1f, .2f))\n            };\n            float_v x[4] = { randomF12(), randomF12(), randomF12(), randomF12() };\n            const float_v y[4] = { randomF12(), randomF12(), randomF12(), randomF12() };\n\n            \/\/ force the x vectors to registers, otherwise GCC decides to work on the stack and\n            \/\/ lose half of the performance\n            forceToRegisters(x[0], x[1], x[2], x[3]);\n\n            timer.Start();\n            \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n            for (int i = 0; i < Factor; ++i) {\n                    x[0] = alpha[0] * x[0] + y[0];\n                    x[1] = alpha[1] * x[1] + y[1];\n                    x[2] = alpha[2] * x[2] + y[2];\n                    x[3] = alpha[3] * x[3] + y[3];\n            }\n\n            \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n            timer.Stop();\n\n            const int k = (x[0] < x[1]) && (x[2] < x[3]);\n            blackHole &= k;\n        }\n        timer.Print(Benchmark::PrintAverage);\n    }\n\n    \/\/ reference\n    {\n        Benchmark timer(\"reference\", 8. * float_v::Size * Factor, \"FLOP\");\n        for (int repetitions = 0; repetitions < Repetitions; ++repetitions) {\n#if VC_IMPL_SSE\n            __m128 tmp = _mm_set1_ps(static_cast<float>(repetitions));\n            const __m128 oPoint2 = _mm_set1_ps(randomF(.1f, .2f));\n            const __m128 oPoint1 = _mm_set1_ps(randomF(.1f, .2f));\n            const __m128 alpha[4] = {\n                _mm_add_ps(tmp, oPoint2),\n                _mm_sub_ps(tmp, oPoint2),\n                _mm_add_ps(tmp, oPoint1),\n                _mm_sub_ps(tmp, oPoint1)\n            };\n            __m128 x[4] = { _mm_set1_ps(randomF12()), _mm_set1_ps(randomF12()), _mm_set1_ps(randomF12()), _mm_set1_ps(randomF12()) };\n            const __m128 y[4] = { _mm_set1_ps(randomF12()), _mm_set1_ps(randomF12()), _mm_set1_ps(randomF12()), _mm_set1_ps(randomF12()) };\n\n            timer.Start();\n            \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n            for (int i = 0; i < Factor; ++i) {\n                    x[0] = _mm_add_ps(_mm_mul_ps(alpha[0], x[0]), y[0]);\n                    x[1] = _mm_add_ps(_mm_mul_ps(alpha[1], x[1]), y[1]);\n                    x[2] = _mm_add_ps(_mm_mul_ps(alpha[2], x[2]), y[2]);\n                    x[3] = _mm_add_ps(_mm_mul_ps(alpha[3], x[3]), y[3]);\n            }\n\n            \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n            timer.Stop();\n\n            const int k = _mm_movemask_ps(_mm_add_ps(_mm_add_ps(x[0], x[1]), _mm_add_ps(x[2], x[3])));\n            blackHole &= k;\n#elif VC_IMPL_LRBni\n            __m512 tmp = _mm512_set_1to16_ps(static_cast<float>(repetitions));\n            const __m512 oPoint2 = _mm512_set_1to16_ps(randomF(.1f, .2f));\n            const __m512 oPoint1 = _mm512_set_1to16_ps(randomF(.1f, .2f));\n            const __m512 alpha[4] = {\n                _mm512_add_ps(tmp, oPoint2),\n                _mm512_sub_ps(tmp, oPoint2),\n                _mm512_add_ps(tmp, oPoint1),\n                _mm512_sub_ps(tmp, oPoint1)\n            };\n            __m512 x[4] = { _mm512_set_1to16_ps(randomF12()), _mm512_set_1to16_ps(randomF12()), _mm512_set_1to16_ps(randomF12()), _mm512_set_1to16_ps(randomF12()) };\n            const __m512 y[4] = { _mm512_set_1to16_ps(randomF12()), _mm512_set_1to16_ps(randomF12()), _mm512_set_1to16_ps(randomF12()), _mm512_set_1to16_ps(randomF12()) };\n\n            timer.Start();\n            \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n            for (int i = 0; i < Factor; ++i) {\n                    x[0] = _mm512_madd132_ps(x[0], y[0], alpha[0]);\n                    x[1] = _mm512_madd132_ps(x[1], y[1], alpha[1]);\n                    x[2] = _mm512_madd132_ps(x[2], y[2], alpha[2]);\n                    x[3] = _mm512_madd132_ps(x[3], y[3], alpha[3]);\n            }\n\n            \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n            timer.Stop();\n\n            const int k = _mm512_cmpeq_ps(_mm512_add_ps(x[0], x[1]), _mm512_add_ps(x[2], x[3]));\n            blackHole &= k;\n#else\n            const float alpha[4] = {\n                float(repetitions + randomF(.1f, .2f)),\n                float(repetitions - randomF(.1f, .2f)),\n                float(repetitions + randomF(.1f, .2f)),\n                float(repetitions - randomF(.1f, .2f))\n            };\n            float x[4] = { randomF12(), randomF12(), randomF12(), randomF12() };\n            const float y[4] = { randomF12(), randomF12(), randomF12(), randomF12() };\n\n            timer.Start();\n            \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n            for (int i = 0; i < Factor; ++i) {\n                    x[0] = alpha[0] * x[0] + y[0];\n                    x[1] = alpha[1] * x[1] + y[1];\n                    x[2] = alpha[2] * x[2] + y[2];\n                    x[3] = alpha[3] * x[3] + y[3];\n            }\n\n            \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n            timer.Stop();\n\n            const int k = (x[0] < x[1]) && (x[2] < x[3]);\n            blackHole &= k;\n#endif\n        }\n        timer.Print(Benchmark::PrintAverage);\n    }\n    if (blackHole != 0) {\n        std::cout << std::endl;\n    }\n    return 0;\n}\n<commit_msg>reach peak FLOP\/cycle using only one constant and 7 independent variables<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\/float_v>\n#include \"benchmark.h\"\n#include <cstdio>\n#include <cstdlib>\n\nusing namespace Vc;\n\nenum {\n    Factor = 2000000 \/ float_v::Size\n};\n\nstatic float randomF(float min, float max)\n{\n    const float delta = max - min;\n    return min + delta * rand() \/ RAND_MAX;\n}\n\nstatic float randomF12() { return randomF(1.f, 2.f); }\n\nint bmain(Benchmark::OutputMode out)\n{\n    const int Repetitions = out == Benchmark::Stdout ? 10 : 100;\n\n    int blackHole = true;\n    {\n        Benchmark timer(\"class\", 2 * 7 * float_v::Size * Factor, \"FLOP\");\n        for (int repetitions = 0; repetitions < Repetitions; ++repetitions) {\n            const float_v alpha(repetitions - randomF(.1f, .2f));\n            const float_v y = randomF12();\n            float_v x[7] = { randomF12(), randomF12(), randomF12(), randomF12(), randomF12(), randomF12(), randomF12() };\n\n            \/\/ force the x vectors to registers, otherwise GCC decides to work on the stack and\n            \/\/ lose half of the performance\n            forceToRegisters(x[0], x[1], x[2], x[3], x[4], x[5], x[6]);\n\n            timer.Start();\n            \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n            for (int i = 0; i < Factor; ++i) {\n                    x[0] = y * x[0] + y;\n                    x[1] = y * x[1] + y;\n                    x[2] = y * x[2] + y;\n                    x[3] = y * x[3] + y;\n                    x[4] = y * x[4] + y;\n                    x[5] = y * x[5] + y;\n                    x[6] = y * x[6] + y;\n            }\n\n            \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n            timer.Stop();\n\n            const int k = (x[0] < x[1]) && (x[2] < x[3]) && (x[4] < x[5]) && (x[0] < x[6]);\n            blackHole &= k;\n        }\n        timer.Print(Benchmark::PrintAverage);\n    }\n\n    \/\/ asm reference\n#ifdef __GNUC__\n    {\n        Benchmark timer(\"asm reference\", 2 * 7 * float_v::Size * Factor, \"FLOP\");\n        for (int repetitions = 0; repetitions < Repetitions; ++repetitions) {\n#if VC_IMPL_SSE\n            __m128 x[7] = { _mm_set1_ps(randomF12()), _mm_set1_ps(randomF12()), _mm_set1_ps(randomF12()), _mm_set1_ps(randomF12()), _mm_set1_ps(randomF12()), _mm_set1_ps(randomF12()), _mm_set1_ps(randomF12()) };\n            const __m128 y = _mm_set1_ps(randomF12());\n\n            timer.Start();\n            \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n            int i = Factor;\n            __asm__(\n                    \".align 16\\n\\t0: \"\n                    \"mulps  %8,%0\"   \"\\n\\t\"\n                    \"sub    $1,%7\"   \"\\n\\t\"\n                    \"mulps  %8,%1\"   \"\\n\\t\"\n                    \"mulps  %8,%2\"   \"\\n\\t\"\n                    \"addps  %8,%0\"   \"\\n\\t\"\n                    \"mulps  %8,%3\"   \"\\n\\t\"\n                    \"addps  %8,%1\"   \"\\n\\t\"\n                    \"mulps  %8,%4\"   \"\\n\\t\"\n                    \"addps  %8,%2\"   \"\\n\\t\"\n                    \"mulps  %8,%5\"   \"\\n\\t\"\n                    \"addps  %8,%3\"   \"\\n\\t\"\n                    \"addps  %8,%4\"   \"\\n\\t\"\n                    \"mulps  %8,%6\"   \"\\n\\t\"\n                    \"addps  %8,%5\"   \"\\n\\t\"\n                    \"addps  %8,%6\"   \"\\n\\t\"\n                    \"jne 0b\"         \"\\n\\t\"\n                    : \"+x\"(x[0]), \"+x\"(x[1]), \"+x\"(x[2]), \"+x\"(x[3]), \"+x\"(x[4]), \"+x\"(x[5]), \"+x\"(x[6]), \"+r\"(i)\n                    : \"x\"(y));\n            \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n            timer.Stop();\n\n            const int k = _mm_movemask_ps(_mm_add_ps(_mm_add_ps(_mm_add_ps(x[0], x[1]), _mm_add_ps(x[2], x[3])), _mm_add_ps(_mm_add_ps(x[4], x[5]), x[6])));\n            blackHole &= k;\n#elif VC_IMPL_LRBni\n\/\/X             __m512 x[7] = { _mm512_set_1to16_ps(randomF12()), _mm512_set_1to16_ps(randomF12()), _mm512_set_1to16_ps(randomF12()), _mm512_set_1to16_ps(randomF12()), _mm512_set_1to16_ps(randomF12()), _mm512_set_1to16_ps(randomF12()), _mm512_set_1to16_ps(randomF12()) };\n\/\/X             const __m512 y = _mm512_set_1to16_ps(randomF12());\n\/\/X \n\/\/X             timer.Start();\n\/\/X             \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/X             \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/X             timer.Stop();\n\/\/X \n\/\/X             const int k = _mm512_cmpeq_ps(_mm512_add_ps(_mm512_add_ps(x[4], x[5]), _mm512_add_ps(x[0], x[1])), _mm512_add_ps(x[6], _mm512_add_ps(x[2], x[3])));\n\/\/X             blackHole &= k;\n#else\n            float x[7] = { randomF12(), randomF12(), randomF12(), randomF12(), randomF12(), randomF12(), randomF12() };\n            const float y = randomF12();\n\n            timer.Start();\n            \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n            int i = Factor;\n            __asm__(\n                    \".align 16\\n\\t0: \"\n                    \"mulss  %8,%0\"   \"\\n\\t\"\n                    \"sub    $1,%7\"   \"\\n\\t\"\n                    \"mulss  %8,%1\"   \"\\n\\t\"\n                    \"mulss  %8,%2\"   \"\\n\\t\"\n                    \"addss  %8,%0\"   \"\\n\\t\"\n                    \"mulss  %8,%3\"   \"\\n\\t\"\n                    \"addss  %8,%1\"   \"\\n\\t\"\n                    \"mulss  %8,%4\"   \"\\n\\t\"\n                    \"addss  %8,%2\"   \"\\n\\t\"\n                    \"mulss  %8,%5\"   \"\\n\\t\"\n                    \"addss  %8,%3\"   \"\\n\\t\"\n                    \"addss  %8,%4\"   \"\\n\\t\"\n                    \"mulss  %8,%6\"   \"\\n\\t\"\n                    \"addss  %8,%5\"   \"\\n\\t\"\n                    \"addss  %8,%6\"   \"\\n\\t\"\n                    \"jne 0b\"         \"\\n\\t\"\n                    : \"+x\"(x[0]), \"+x\"(x[1]), \"+x\"(x[2]), \"+x\"(x[3]), \"+x\"(x[4]), \"+x\"(x[5]), \"+x\"(x[6]), \"+r\"(i)\n                    : \"x\"(y));\n            \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n            timer.Stop();\n\n            const int k = (x[0] < x[1]) && (x[2] < x[3]) && (x[4] < x[5]) && (x[2] < x[6]);\n            blackHole &= k;\n#endif\n        }\n        timer.Print(Benchmark::PrintAverage);\n    }\n#endif\n\n    \/\/ intrinsics reference\n    {\n        Benchmark timer(\"intrinsics reference\", 2 * 7 * float_v::Size * Factor, \"FLOP\");\n        for (int repetitions = 0; repetitions < Repetitions; ++repetitions) {\n#if VC_IMPL_SSE\n            __m128 x[7] = { _mm_set1_ps(randomF12()), _mm_set1_ps(randomF12()), _mm_set1_ps(randomF12()), _mm_set1_ps(randomF12()), _mm_set1_ps(randomF12()), _mm_set1_ps(randomF12()), _mm_set1_ps(randomF12()) };\n            const __m128 y = _mm_set1_ps(randomF12());\n\n            timer.Start();\n            \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n            for (int i = 0; i < Factor; ++i) {\n                    x[0] = _mm_add_ps(_mm_mul_ps(y, x[0]), y);\n                    x[1] = _mm_add_ps(_mm_mul_ps(y, x[1]), y);\n                    x[2] = _mm_add_ps(_mm_mul_ps(y, x[2]), y);\n                    x[3] = _mm_add_ps(_mm_mul_ps(y, x[3]), y);\n                    x[4] = _mm_add_ps(_mm_mul_ps(y, x[4]), y);\n                    x[5] = _mm_add_ps(_mm_mul_ps(y, x[5]), y);\n                    x[6] = _mm_add_ps(_mm_mul_ps(y, x[6]), y);\n            }\n\n            \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n            timer.Stop();\n\n            const int k = _mm_movemask_ps(_mm_add_ps(_mm_add_ps(_mm_add_ps(x[0], x[1]), _mm_add_ps(x[2], x[3])), _mm_add_ps(_mm_add_ps(x[4], x[5]), x[6])));\n            blackHole &= k;\n#elif VC_IMPL_LRBni\n            __m512 x[7] = { _mm512_set_1to16_ps(randomF12()), _mm512_set_1to16_ps(randomF12()), _mm512_set_1to16_ps(randomF12()), _mm512_set_1to16_ps(randomF12()), _mm512_set_1to16_ps(randomF12()), _mm512_set_1to16_ps(randomF12()), _mm512_set_1to16_ps(randomF12()) };\n            const __m512 y = _mm512_set_1to16_ps(randomF12());\n\n            timer.Start();\n            \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n            for (int i = 0; i < Factor; ++i) {\n                    x[0] = _mm512_madd132_ps(x[0], y, y);\n                    x[1] = _mm512_madd132_ps(x[1], y, y);\n                    x[2] = _mm512_madd132_ps(x[2], y, y);\n                    x[3] = _mm512_madd132_ps(x[3], y, y);\n                    x[4] = _mm512_madd132_ps(x[4], y, y);\n                    x[5] = _mm512_madd132_ps(x[5], y, y);\n                    x[6] = _mm512_madd132_ps(x[6], y, y);\n            }\n\n            \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n            timer.Stop();\n\n            const int k = _mm512_cmpeq_ps(_mm512_add_ps(_mm512_add_ps(x[4], x[5]), _mm512_add_ps(x[0], x[1])), _mm512_add_ps(x[6], _mm512_add_ps(x[2], x[3])));\n            blackHole &= k;\n#else\n            float x[7] = { randomF12(), randomF12(), randomF12(), randomF12(), randomF12(), randomF12(), randomF12() };\n            const float y = randomF12();\n\n            timer.Start();\n            \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n            for (int i = 0; i < Factor; ++i) {\n                    x[0] = y * x[0] + y;\n                    x[1] = y * x[1] + y;\n                    x[2] = y * x[2] + y;\n                    x[3] = y * x[3] + y;\n                    x[4] = y * x[4] + y;\n                    x[5] = y * x[5] + y;\n                    x[6] = y * x[6] + y;\n            }\n\n            \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n            timer.Stop();\n\n            const int k = (x[0] < x[1]) && (x[2] < x[3]) && (x[4] < x[5]) && (x[2] < x[6]);\n            blackHole &= k;\n#endif\n        }\n        timer.Print(Benchmark::PrintAverage);\n    }\n    if (blackHole != 0) {\n        std::cout << std::endl;\n    }\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: ContainerMediator.cxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: ihi $ $Date: 2006-10-18 13:29:28 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_dbaccess.hxx\"\n#ifndef DBA_CONTAINERMEDIATOR_HXX\n#include \"ContainerMediator.hxx\"\n#endif\n#ifndef DBACCESS_SHARED_DBASTRINGS_HRC\n#include \"dbastrings.hrc\"\n#endif\n#ifndef DBA_PROPERTYSETFORWARD_HXX\n#include \"PropertyForward.hxx\"\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYATTRIBUTE_HPP_\n#include <com\/sun\/star\/beans\/PropertyAttribute.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBCX_XCOLUMNSSUPPLIER_HPP_\n#include <com\/sun\/star\/sdbcx\/XColumnsSupplier.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBCX_XTABLESSUPPLIER_HPP_\n#include <com\/sun\/star\/sdbcx\/XTablesSupplier.hpp>\n#endif\n\n#ifndef _CONNECTIVITY_DBTOOLS_HXX_\n#include <connectivity\/dbtools.hxx>\n#endif\n#ifndef _COMPHELPER_PROPERTY_HXX_\n#include <comphelper\/property.hxx>\n#endif\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n#ifndef TOOLS_DIAGNOSE_EX_H\n#include <tools\/diagnose_ex.h>\n#endif\n\n\n\/\/........................................................................\nnamespace dbaccess\n{\n\/\/........................................................................\n    using namespace ::com::sun::star::uno;\n    using namespace ::com::sun::star::lang;\n    using namespace ::com::sun::star::sdbc;\n    using namespace ::com::sun::star::sdbcx;\n    using namespace ::com::sun::star::beans;\n    using namespace ::com::sun::star::container;\n\nDBG_NAME(OContainerMediator)\nOContainerMediator::OContainerMediator( const Reference< XContainer >& _xContainer, const Reference< XNameAccess >& _xSettings,\n    const Reference< XConnection >& _rxConnection, ContainerType _eType )\n    : m_xSettings( _xSettings )\n    , m_xContainer( _xContainer )\n    , m_aConnection( _rxConnection )\n    , m_eType( _eType )\n{\n    DBG_CTOR(OContainerMediator,NULL);\n    osl_incrementInterlockedCount(&m_refCount);\n    try\n    {\n        m_xContainer->addContainerListener(this);\n        Reference< XContainer > xContainer(m_xSettings, UNO_QUERY);\n        if ( xContainer.is() )\n            xContainer->addContainerListener(this);\n    }\n    catch(Exception&)\n    {\n        OSL_ENSURE(sal_False, \"OContainerMediator::OContainerMediator: caught an exception!\");\n    }\n    osl_decrementInterlockedCount( &m_refCount );\n}\n\/\/ -----------------------------------------------------------------------------\nOContainerMediator::~OContainerMediator()\n{\n    DBG_DTOR(OContainerMediator,NULL);\n    acquire();\n    impl_cleanup_nothrow();\n}\n\n\/\/ -----------------------------------------------------------------------------\nvoid OContainerMediator::impl_cleanup_nothrow()\n{\n    try\n    {\n        Reference< XContainer > xContainer( m_xSettings, UNO_QUERY );\n        if ( xContainer.is() )\n            xContainer->removeContainerListener( this );\n        m_xSettings = NULL;\n\n        if ( m_xContainer.is() )\n            m_xContainer->removeContainerListener( this );\n        m_xContainer = NULL;\n    }\n    catch( const Exception& )\n    {\n        DBG_UNHANDLED_EXCEPTION();\n    }\n}\n\n\/\/ -----------------------------------------------------------------------------\nvoid SAL_CALL OContainerMediator::elementInserted( const ContainerEvent& _rEvent ) throw(RuntimeException)\n{\n    ::osl::MutexGuard aGuard(m_aMutex);\n    if ( _rEvent.Source == m_xSettings && m_xSettings.is() )\n    {\n        ::rtl::OUString sElementName;\n        _rEvent.Accessor >>= sElementName;\n        PropertyForwardList::iterator aFind = m_aForwardList.find(sElementName);\n        if ( aFind != m_aForwardList.end() )\n        {\n            Reference< XPropertySet> xDest(_rEvent.Element,UNO_QUERY);\n            aFind->second->setDefinition( xDest );\n        }\n    }\n}\n\/\/ -----------------------------------------------------------------------------\nvoid SAL_CALL OContainerMediator::elementRemoved( const ContainerEvent& _rEvent ) throw(RuntimeException)\n{\n    ::osl::MutexGuard aGuard(m_aMutex);\n    if ( _rEvent.Source == m_xContainer && m_xContainer.is() )\n    {\n        ::rtl::OUString sElementName;\n        _rEvent.Accessor >>= sElementName;\n        m_aForwardList.erase(sElementName);\n        try\n        {\n            Reference<XNameContainer> xNameContainer( m_xSettings, UNO_QUERY_THROW );\n            if ( xNameContainer.is() && m_xSettings->hasByName( sElementName ) )\n                xNameContainer->removeByName( sElementName );\n        }\n        catch( const Exception& )\n        {\n            DBG_UNHANDLED_EXCEPTION();\n        }\n    }\n}\n\/\/ -----------------------------------------------------------------------------\nvoid SAL_CALL OContainerMediator::elementReplaced( const ContainerEvent& \/*_rEvent*\/ ) throw(RuntimeException)\n{\n    OSL_ENSURE( false, \"OContainerMediator::elementReplaced: not yet implemented!\" );\n    \/\/ we would need to update our PropertyForwarder with the new elements, and initially synchronize them\n}\n\n\/\/ -----------------------------------------------------------------------------\nvoid SAL_CALL OContainerMediator::disposing( const EventObject& Source ) throw(RuntimeException)\n{\n    ::osl::MutexGuard aGuard(m_aMutex);\n\n    if ( Source.Source == m_xContainer || Source.Source == m_xSettings )\n        impl_cleanup_nothrow();\n}\n\n\/\/ -----------------------------------------------------------------------------\nReference< XPropertySet > OContainerMediator::impl_getSettingsForInitialization_nothrow( const ::rtl::OUString& _rName,\n    const Reference< XPropertySet >& _rxDestination ) const\n{\n    Reference< XPropertySet > xSettings;\n    try\n    {\n        if ( m_xSettings->hasByName( _rName ) )\n            OSL_VERIFY( m_xSettings->getByName( _rName ) >>= xSettings );\n        else if ( m_eType == eColumns )\n        {\n            do  \/\/ artifial loop for easier flow control\n            {\n\n            Reference< XConnection > xConnection( m_aConnection );\n            if ( !xConnection.is() )\n                break;\n\n            Reference< XPropertySetInfo > xPSI( _rxDestination->getPropertySetInfo(), UNO_QUERY_THROW );\n            if  (   !xPSI->hasPropertyByName( PROPERTY_TABLENAME )\n                ||  !xPSI->hasPropertyByName( PROPERTY_REALNAME )\n                )\n                break;\n\n            \/\/ determine the composed table name, plus the column name, as indicated by the\n            \/\/ respective properties at the destination object\n            ::rtl::OUString sCatalog, sSchema, sTable, sColumn;\n            if ( xPSI->hasPropertyByName( PROPERTY_CATALOGNAME ) )\n            {\n                OSL_VERIFY( _rxDestination->getPropertyValue( PROPERTY_CATALOGNAME ) >>= sCatalog );\n            }\n            if ( xPSI->hasPropertyByName( PROPERTY_SCHEMANAME ) )\n            {\n                OSL_VERIFY( _rxDestination->getPropertyValue( PROPERTY_SCHEMANAME ) >>= sSchema );\n            }\n            OSL_VERIFY( _rxDestination->getPropertyValue( PROPERTY_TABLENAME ) >>= sTable );\n            OSL_VERIFY( _rxDestination->getPropertyValue( PROPERTY_REALNAME ) >>= sColumn );\n\n            ::rtl::OUString sComposedTableName = ::dbtools::composeTableName(\n                xConnection->getMetaData(), sCatalog, sSchema, sTable, sal_False, ::dbtools::eComplete );\n\n            \/\/ retrieve the table in question\n            Reference< XTablesSupplier > xSuppTables( xConnection, UNO_QUERY_THROW );\n            Reference< XNameAccess > xTables( xSuppTables->getTables(), UNO_QUERY_THROW );\n            if ( !xTables->hasByName( sComposedTableName ) )\n                break;\n\n            Reference< XColumnsSupplier > xSuppCols( xTables->getByName( sComposedTableName ), UNO_QUERY_THROW );\n            Reference< XNameAccess > xColumns( xSuppCols->getColumns(), UNO_QUERY_THROW );\n            if ( !xColumns->hasByName( sColumn ) )\n                break;\n\n            xSettings.set( xColumns->getByName( sColumn ), UNO_QUERY );\n\n            }\n            while ( false );\n        }\n    }\n    catch( const Exception& )\n    {\n        DBG_UNHANDLED_EXCEPTION();\n    }\n    return xSettings;\n}\n\n\/\/ -----------------------------------------------------------------------------\nvoid OContainerMediator::notifyElementCreated(const ::rtl::OUString& _sName,const Reference<XPropertySet>& _xDest)\n{\n    PropertyForwardList::iterator aFind = m_aForwardList.find(_sName);\n    if ( aFind == m_aForwardList.end() && m_xSettings.is() )\n    {\n        ::std::vector< ::rtl::OUString> aPropertyList;\n\n        try\n        {\n            \/\/ initially copy from the settings object (if existent) to the newly created object\n            Reference< XPropertySet > xSetting( impl_getSettingsForInitialization_nothrow( _sName, _xDest ) );\n            if ( xSetting.is() )\n                ::comphelper::copyProperties( xSetting, _xDest );\n\n            \/\/ collect the to-be-monitored properties\n            Reference< XPropertySetInfo > xPSI( _xDest->getPropertySetInfo(), UNO_QUERY_THROW );\n            Sequence< Property > aProperties( xPSI->getProperties() );\n            const Property* property = aProperties.getConstArray();\n            const Property* propertyEnd = aProperties.getConstArray() + aProperties.getLength();\n            for ( ; property != propertyEnd; ++property )\n            {\n                if ( ( property->Attributes & PropertyAttribute::READONLY ) != 0 )\n                    continue;\n                if ( ( property->Attributes & PropertyAttribute::BOUND ) == 0 )\n                    continue;\n\n                aPropertyList.push_back( property->Name );\n            }\n        }\n        catch( const Exception& )\n        {\n            DBG_UNHANDLED_EXCEPTION();\n        }\n\n        ::rtl::Reference< OPropertyForward > pForward( new OPropertyForward( _xDest, m_xSettings, _sName, aPropertyList ) );\n        m_aForwardList.insert( PropertyForwardList::value_type( _sName, pForward ) );\n    }\n}\n\/\/ -----------------------------------------------------------------------------\n\/\/........................................................................\n}   \/\/ namespace dbaccess\n\/\/........................................................................\n<commit_msg>INTEGRATION: CWS dba24a (1.8.108); FILE MERGED 2007\/09\/05 11:02:57 oj 1.8.108.1: #i68334# fix ref count prob<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: ContainerMediator.cxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: hr $ $Date: 2007-09-26 14:40: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_dbaccess.hxx\"\n#ifndef DBA_CONTAINERMEDIATOR_HXX\n#include \"ContainerMediator.hxx\"\n#endif\n#ifndef DBACCESS_SHARED_DBASTRINGS_HRC\n#include \"dbastrings.hrc\"\n#endif\n#ifndef DBA_PROPERTYSETFORWARD_HXX\n#include \"PropertyForward.hxx\"\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYATTRIBUTE_HPP_\n#include <com\/sun\/star\/beans\/PropertyAttribute.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBCX_XCOLUMNSSUPPLIER_HPP_\n#include <com\/sun\/star\/sdbcx\/XColumnsSupplier.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBCX_XTABLESSUPPLIER_HPP_\n#include <com\/sun\/star\/sdbcx\/XTablesSupplier.hpp>\n#endif\n\n#ifndef _CONNECTIVITY_DBTOOLS_HXX_\n#include <connectivity\/dbtools.hxx>\n#endif\n#ifndef _COMPHELPER_PROPERTY_HXX_\n#include <comphelper\/property.hxx>\n#endif\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n#ifndef TOOLS_DIAGNOSE_EX_H\n#include <tools\/diagnose_ex.h>\n#endif\n\n\n\/\/........................................................................\nnamespace dbaccess\n{\n\/\/........................................................................\n    using namespace ::com::sun::star::uno;\n    using namespace ::com::sun::star::lang;\n    using namespace ::com::sun::star::sdbc;\n    using namespace ::com::sun::star::sdbcx;\n    using namespace ::com::sun::star::beans;\n    using namespace ::com::sun::star::container;\n\nDBG_NAME(OContainerMediator)\nOContainerMediator::OContainerMediator( const Reference< XContainer >& _xContainer, const Reference< XNameAccess >& _xSettings,\n    const Reference< XConnection >& _rxConnection, ContainerType _eType )\n    : m_xSettings( _xSettings )\n    , m_xContainer( _xContainer )\n    , m_aConnection( _rxConnection )\n    , m_eType( _eType )\n{\n    DBG_CTOR(OContainerMediator,NULL);\n\n    if ( _xSettings.is() && _xContainer.is() )\n    {\n        osl_incrementInterlockedCount(&m_refCount);\n        try\n        {\n            m_xContainer->addContainerListener(this);\n            Reference< XContainer > xContainer(_xSettings, UNO_QUERY);\n            if ( xContainer.is() )\n                xContainer->addContainerListener(this);\n        }\n        catch(Exception&)\n        {\n            OSL_ENSURE(sal_False, \"OContainerMediator::OContainerMediator: caught an exception!\");\n        }\n        osl_decrementInterlockedCount( &m_refCount );\n    }\n    else\n    {\n        m_xSettings.clear();\n        m_xContainer.clear();\n    }\n}\n\/\/ -----------------------------------------------------------------------------\nOContainerMediator::~OContainerMediator()\n{\n    DBG_DTOR(OContainerMediator,NULL);\n    acquire();\n    impl_cleanup_nothrow();\n}\n\n\/\/ -----------------------------------------------------------------------------\nvoid OContainerMediator::impl_cleanup_nothrow()\n{\n    try\n    {\n        Reference< XContainer > xContainer( m_xSettings, UNO_QUERY );\n        if ( xContainer.is() )\n            xContainer->removeContainerListener( this );\n        m_xSettings.clear();\n\n        xContainer = m_xContainer;\n        if ( xContainer.is() )\n            xContainer->removeContainerListener( this );\n        m_xContainer.clear();\/\/WeakReference< XContainer >();\n\n        m_aForwardList.clear();\n    }\n    catch( const Exception& )\n    {\n        DBG_UNHANDLED_EXCEPTION();\n    }\n}\n\n\/\/ -----------------------------------------------------------------------------\nvoid SAL_CALL OContainerMediator::elementInserted( const ContainerEvent& _rEvent ) throw(RuntimeException)\n{\n    ::osl::MutexGuard aGuard(m_aMutex);\n    if ( _rEvent.Source == m_xSettings && m_xSettings.is() )\n    {\n        ::rtl::OUString sElementName;\n        _rEvent.Accessor >>= sElementName;\n        PropertyForwardList::iterator aFind = m_aForwardList.find(sElementName);\n        if ( aFind != m_aForwardList.end() )\n        {\n            Reference< XPropertySet> xDest(_rEvent.Element,UNO_QUERY);\n            aFind->second->setDefinition( xDest );\n        }\n    }\n}\n\/\/ -----------------------------------------------------------------------------\nvoid SAL_CALL OContainerMediator::elementRemoved( const ContainerEvent& _rEvent ) throw(RuntimeException)\n{\n    ::osl::MutexGuard aGuard(m_aMutex);\n    Reference< XContainer > xContainer = m_xContainer;\n    if ( _rEvent.Source == xContainer && xContainer.is() )\n    {\n        ::rtl::OUString sElementName;\n        _rEvent.Accessor >>= sElementName;\n        m_aForwardList.erase(sElementName);\n        try\n        {\n            Reference<XNameContainer> xNameContainer( m_xSettings, UNO_QUERY_THROW );\n            if ( xNameContainer.is() && m_xSettings->hasByName( sElementName ) )\n                xNameContainer->removeByName( sElementName );\n        }\n        catch( const Exception& )\n        {\n            DBG_UNHANDLED_EXCEPTION();\n        }\n    }\n}\n\/\/ -----------------------------------------------------------------------------\nvoid SAL_CALL OContainerMediator::elementReplaced( const ContainerEvent& \/*_rEvent*\/ ) throw(RuntimeException)\n{\n    OSL_ENSURE( false, \"OContainerMediator::elementReplaced: not yet implemented!\" );\n    \/\/ we would need to update our PropertyForwarder with the new elements, and initially synchronize them\n}\n\n\/\/ -----------------------------------------------------------------------------\nvoid SAL_CALL OContainerMediator::disposing( const EventObject& \/*Source*\/ ) throw(RuntimeException)\n{\n    ::osl::MutexGuard aGuard(m_aMutex);\n\n\/\/    Reference< XContainer > xContainer = m_xContainer;\n\/\/  if ( Source.Source == xContainer || Source.Source == m_xSettings )\n    \/\/ this can only be one of them :-) So no check needed here\n    impl_cleanup_nothrow();\n}\n\n\/\/ -----------------------------------------------------------------------------\nReference< XPropertySet > OContainerMediator::impl_getSettingsForInitialization_nothrow( const ::rtl::OUString& _rName,\n    const Reference< XPropertySet >& _rxDestination ) const\n{\n    Reference< XPropertySet > xSettings;\n    try\n    {\n        if ( m_xSettings.is() && m_xSettings->hasByName( _rName ) )\n            OSL_VERIFY( m_xSettings->getByName( _rName ) >>= xSettings );\n        else if ( m_eType == eColumns )\n        {\n            do  \/\/ artifial loop for easier flow control\n            {\n\n            Reference< XConnection > xConnection( m_aConnection );\n            if ( !xConnection.is() )\n                break;\n\n            Reference< XPropertySetInfo > xPSI( _rxDestination->getPropertySetInfo(), UNO_QUERY_THROW );\n            if  (   !xPSI->hasPropertyByName( PROPERTY_TABLENAME )\n                ||  !xPSI->hasPropertyByName( PROPERTY_REALNAME )\n                )\n                break;\n\n            \/\/ determine the composed table name, plus the column name, as indicated by the\n            \/\/ respective properties at the destination object\n            ::rtl::OUString sCatalog, sSchema, sTable, sColumn;\n            if ( xPSI->hasPropertyByName( PROPERTY_CATALOGNAME ) )\n            {\n                OSL_VERIFY( _rxDestination->getPropertyValue( PROPERTY_CATALOGNAME ) >>= sCatalog );\n            }\n            if ( xPSI->hasPropertyByName( PROPERTY_SCHEMANAME ) )\n            {\n                OSL_VERIFY( _rxDestination->getPropertyValue( PROPERTY_SCHEMANAME ) >>= sSchema );\n            }\n            OSL_VERIFY( _rxDestination->getPropertyValue( PROPERTY_TABLENAME ) >>= sTable );\n            OSL_VERIFY( _rxDestination->getPropertyValue( PROPERTY_REALNAME ) >>= sColumn );\n\n            ::rtl::OUString sComposedTableName = ::dbtools::composeTableName(\n                xConnection->getMetaData(), sCatalog, sSchema, sTable, sal_False, ::dbtools::eComplete );\n\n            \/\/ retrieve the table in question\n            Reference< XTablesSupplier > xSuppTables( xConnection, UNO_QUERY_THROW );\n            Reference< XNameAccess > xTables( xSuppTables->getTables(), UNO_QUERY_THROW );\n            if ( !xTables->hasByName( sComposedTableName ) )\n                break;\n\n            Reference< XColumnsSupplier > xSuppCols( xTables->getByName( sComposedTableName ), UNO_QUERY_THROW );\n            Reference< XNameAccess > xColumns( xSuppCols->getColumns(), UNO_QUERY_THROW );\n            if ( !xColumns->hasByName( sColumn ) )\n                break;\n\n            xSettings.set( xColumns->getByName( sColumn ), UNO_QUERY );\n\n            }\n            while ( false );\n        }\n    }\n    catch( const Exception& )\n    {\n        DBG_UNHANDLED_EXCEPTION();\n    }\n    return xSettings;\n}\n\n\/\/ -----------------------------------------------------------------------------\nvoid OContainerMediator::notifyElementCreated(const ::rtl::OUString& _sName,const Reference<XPropertySet>& _xDest)\n{\n    PropertyForwardList::iterator aFind = m_aForwardList.find(_sName);\n    if ( aFind == m_aForwardList.end() && m_xSettings.is() )\n    {\n        ::std::vector< ::rtl::OUString> aPropertyList;\n\n        try\n        {\n            \/\/ initially copy from the settings object (if existent) to the newly created object\n            Reference< XPropertySet > xSetting( impl_getSettingsForInitialization_nothrow( _sName, _xDest ) );\n            if ( xSetting.is() )\n                ::comphelper::copyProperties( xSetting, _xDest );\n\n            \/\/ collect the to-be-monitored properties\n            Reference< XPropertySetInfo > xPSI( _xDest->getPropertySetInfo(), UNO_QUERY_THROW );\n            Sequence< Property > aProperties( xPSI->getProperties() );\n            const Property* property = aProperties.getConstArray();\n            const Property* propertyEnd = aProperties.getConstArray() + aProperties.getLength();\n            for ( ; property != propertyEnd; ++property )\n            {\n                if ( ( property->Attributes & PropertyAttribute::READONLY ) != 0 )\n                    continue;\n                if ( ( property->Attributes & PropertyAttribute::BOUND ) == 0 )\n                    continue;\n\n                aPropertyList.push_back( property->Name );\n            }\n        }\n        catch( const Exception& )\n        {\n            DBG_UNHANDLED_EXCEPTION();\n        }\n\n        ::rtl::Reference< OPropertyForward > pForward( new OPropertyForward( _xDest, m_xSettings, _sName, aPropertyList ) );\n        m_aForwardList.insert( PropertyForwardList::value_type( _sName, pForward ) );\n    }\n}\n\/\/ -----------------------------------------------------------------------------\n\/\/........................................................................\n}   \/\/ namespace dbaccess\n\/\/........................................................................\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>OUString::trim() does not modify in-place<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/------------------------------------------------------------------------------\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\n\/\/ author:  Vassil Vassilev <vasil.georgiev.vasilev@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\/Interpreter\/ClangInternalState.h\"\n\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/Lex\/Preprocessor.h\"\n#include \"clang\/AST\/RecursiveASTVisitor.h\"\n#include \"clang\/Basic\/Builtins.h\"\n#include \"clang\/Basic\/SourceManager.h\"\n#include \"clang\/CodeGen\/ModuleBuilder.h\"\n\n#include \"llvm\/ADT\/SmallString.h\"\n#include \"llvm\/IR\/Module.h\"\n#include \"llvm\/Support\/FileSystem.h\"\n#include \"llvm\/Support\/Path.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Support\/Signals.h\"\n\n#include <cstdio>\n#include <sstream>\n#include <string>\n#include <time.h>\n\n#ifdef WIN32\n#define popen _popen\n#define pclose _pclose\n#endif\n\nusing namespace clang;\n\nnamespace cling {\n\n  ClangInternalState::ClangInternalState(ASTContext& AC, Preprocessor& PP,\n                                         llvm::Module* M, CodeGenerator* CG,\n                                         const std::string& name)\n    : m_ASTContext(AC), m_Preprocessor(PP), m_Module(M), m_CodeGen(CG),\n      m_DiffCommand(\"diff -u --text \"), m_Name(name), m_DiffPair(0) {\n    store();\n  }\n\n  ClangInternalState::~ClangInternalState() {\n    \/\/ cleanup the temporary files:\n    remove(m_LookupTablesFile.c_str());\n    remove(m_IncludedFilesFile.c_str());\n    remove(m_ASTFile.c_str());\n    remove(m_LLVMModuleFile.c_str());\n    remove(m_MacrosFile.c_str());\n  }\n\n  void ClangInternalState::store() {\n    \/\/ Cannot use the stack (private copy ctor)\n    llvm::OwningPtr<llvm::raw_fd_ostream> m_LookupTablesOS;\n    llvm::OwningPtr<llvm::raw_fd_ostream> m_IncludedFilesOS;\n    llvm::OwningPtr<llvm::raw_fd_ostream> m_ASTOS;\n    llvm::OwningPtr<llvm::raw_fd_ostream> m_LLVMModuleOS;\n    llvm::OwningPtr<llvm::raw_fd_ostream> m_MacrosOS;\n\n    m_LookupTablesOS.reset(createOutputFile(\"lookup\",\n                                            &m_LookupTablesFile));\n    m_IncludedFilesOS.reset(createOutputFile(\"included\",\n                                             &m_IncludedFilesFile));\n    m_ASTOS.reset(createOutputFile(\"ast\", &m_ASTFile));\n    m_LLVMModuleOS.reset(createOutputFile(\"module\", &m_LLVMModuleFile));\n    m_MacrosOS.reset(createOutputFile(\"macros\", &m_MacrosFile));\n\n    printLookupTables(*m_LookupTablesOS.get(), m_ASTContext);\n    printIncludedFiles(*m_IncludedFilesOS.get(),\n                       m_ASTContext.getSourceManager());\n    printAST(*m_ASTOS.get(), m_ASTContext);\n    if (m_Module)\n      printLLVMModule(*m_LLVMModuleOS.get(), *m_Module, *m_CodeGen);\n    printMacroDefinitions(*m_MacrosOS.get(), m_Preprocessor);\n  }\n  namespace {\n    std::string getCurrentTimeAsString() {\n      time_t rawtime;\n      struct tm * timeinfo;\n      char buffer [80];\n\n      time (&rawtime);\n      timeinfo = localtime (&rawtime);\n\n      strftime (buffer, 80, \"%I_%M_%S\", timeinfo);\n      return buffer;\n    }\n  }\n\n  \/\/ Copied with modifications from CompilerInstance.cpp\n  llvm::raw_fd_ostream*\n  ClangInternalState::createOutputFile(llvm::StringRef OutFile,\n                                       std::string *TempPathName\/*=0*\/,\n                                       bool RemoveFileOnSignal\/*=true*\/) {\n    llvm::OwningPtr<llvm::raw_fd_ostream> OS;\n    std::string OSFile;\n    llvm::SmallString<256> OutputPath;\n    llvm::sys::path::system_temp_directory(\/*erasedOnReboot*\/false, OutputPath);\n\n    \/\/ Only create the temporary if the parent directory exists (or create\n    \/\/ missing directories is true) and we can actually write to OutPath,\n    \/\/ otherwise we want to fail early.\n    llvm::SmallString<256> TempPath(OutputPath);\n    llvm::sys::fs::make_absolute(TempPath);\n    assert(llvm::sys::fs::is_directory(TempPath.str()) && \"Must be a folder.\");\n    \/\/ Create a temporary file.\n    llvm::sys::path::append(TempPath, \"cling-\" + OutFile);\n    TempPath += \"-\" + getCurrentTimeAsString();\n    TempPath += \"-%%%%%%%%\";\n    int fd;\n    if (llvm::sys::fs::createUniqueFile(TempPath.str(), fd, TempPath)\n        == llvm::errc::success) {\n      OS.reset(new llvm::raw_fd_ostream(fd, \/*shouldClose=*\/true));\n      OSFile = TempPath.str();\n    }\n\n    \/\/ Make sure the out stream file gets removed if we crash.\n    if (RemoveFileOnSignal)\n      llvm::sys::RemoveFileOnSignal(OSFile);\n\n    if (TempPathName)\n      *TempPathName = OSFile;\n\n    return OS.take();\n  }\n\n  void ClangInternalState::compare(const std::string& name) {\n    assert(name == m_Name && \"Different names!?\");\n    m_DiffPair.reset(new ClangInternalState(m_ASTContext, m_Preprocessor,\n                                            m_Module, m_CodeGen, name));\n    std::string differences = \"\";\n    \/\/ Ignore the builtins\n    typedef llvm::SmallVector<const char*, 1024> Builtins;\n    Builtins builtinNames;\n    m_ASTContext.BuiltinInfo.GetBuiltinNames(builtinNames);\n    for (Builtins::iterator I = builtinNames.begin();\n         I != builtinNames.end();) {\n      if (llvm::StringRef(*I).startswith(\"__builtin\"))\n        I = builtinNames.erase(I);\n      else\n        ++I;\n    }\n\n    builtinNames.push_back(\".*__builtin.*\");\n\n    if (differentContent(m_LookupTablesFile, m_DiffPair->m_LookupTablesFile,\n                         differences, &builtinNames)) {\n      llvm::errs() << \"Differences in the lookup tables\\n\";\n      llvm::errs() << differences << \"\\n\";\n      differences = \"\";\n    }\n    if (differentContent(m_IncludedFilesFile, m_DiffPair->m_IncludedFilesFile,\n                         differences)) {\n      llvm::errs() << \"Differences in the included files\\n\";\n      llvm::errs() << differences << \"\\n\";\n      differences = \"\";\n    }\n    if (differentContent(m_ASTFile, m_DiffPair->m_ASTFile, differences)) {\n      llvm::errs() << \"Differences in the AST \\n\";\n      llvm::errs() << differences << \"\\n\";\n      differences = \"\";\n    }\n    if (m_Module) {\n      assert(m_CodeGen && \"Must have CodeGen set\");\n      \/\/ We want to skip the intrinsics\n      builtinNames.clear();\n      for (llvm::Module::const_iterator I = m_Module->begin(),\n             E = m_Module->end(); I != E; ++I)\n        if (I->isIntrinsic())\n          builtinNames.push_back(I->getName().data());\n\n      if (differentContent(m_LLVMModuleFile, m_DiffPair->m_LLVMModuleFile,\n                           differences, &builtinNames)) {\n        llvm::errs() << \"Differences in the llvm Module \\n\";\n        llvm::errs() << differences << \"\\n\";\n        differences = \"\";\n      }\n    }\n    if (differentContent(m_MacrosFile, m_DiffPair->m_MacrosFile, differences)){\n      llvm::errs() << \"Differences in the Macro Definitions \\n\";\n      llvm::errs() << differences << \"\\n\";\n      differences = \"\";\n    }\n  }\n\n  bool ClangInternalState::differentContent(const std::string& file1,\n                                            const std::string& file2,\n                                            std::string& differences,\n                const llvm::SmallVectorImpl<const char*>* ignores\/*=0*\/) const {\n    std::string diffCall = m_DiffCommand;\n    if (ignores) {\n      for (size_t i = 0, e = ignores->size(); i < e; ++i) {\n        diffCall += \" --ignore-matching-lines=\\\".*\";\n        diffCall += (*ignores)[i];\n        diffCall += \".*\\\"\";\n      }\n    }\n\n    FILE* pipe = popen((diffCall + \" \" + file1 + \" \" + file2).c_str() , \"r\");\n    assert(pipe && \"Error creating the pipe\");\n    assert(differences.empty() && \"Must be empty\");\n\n    char buffer[128];\n    while(!feof(pipe)) {\n      if(fgets(buffer, 128, pipe) != NULL)\n        differences += buffer;\n    }\n    pclose(pipe);\n\n    if (!differences.empty())\n      llvm::errs() << diffCall << \" \" << file1 << \" \" << file2 << \"\\n\";\n\n    return !differences.empty();\n  }\n\n  class DumpLookupTables : public RecursiveASTVisitor<DumpLookupTables> {\n  private:\n    llvm::raw_ostream& m_OS;\n  public:\n    DumpLookupTables(llvm::raw_ostream& OS) : m_OS(OS) { }\n    bool VisitDecl(Decl* D) {\n      if (DeclContext* DC = dyn_cast<DeclContext>(D))\n        VisitDeclContext(DC);\n      return true;\n    }\n\n    bool VisitDeclContext(DeclContext* DC) {\n      \/\/ If the lookup is pending for building, force its creation.\n      if (DC == DC->getPrimaryContext() && !DC->getLookupPtr())\n        DC->buildLookup();\n      DC->dumpLookups(m_OS);\n      return true;\n    }\n  };\n\n  void ClangInternalState::printLookupTables(llvm::raw_ostream& Out,\n                                             ASTContext& C) {\n    DumpLookupTables dumper(Out);\n    dumper.TraverseDecl(C.getTranslationUnitDecl());\n  }\n\n  void ClangInternalState::printIncludedFiles(llvm::raw_ostream& Out,\n                                              SourceManager& SM) {\n    for (clang::SourceManager::fileinfo_iterator I = SM.fileinfo_begin(),\n           E = SM.fileinfo_end(); I != E; ++I) {\n      const clang::SrcMgr::ContentCache &C = *I->second;\n      const clang::FileEntry *FE = C.OrigEntry;\n      \/\/ Our error recovery purges the cache of the FileEntry, but keeps\n      \/\/ the FileEntry's pointer so that if it was used by smb (like the\n      \/\/ SourceManager) it wouldn't be dangling. In that case we shouldn't\n      \/\/ print the FileName, because semantically it is not there.\n      if (!FE->getSize() && !FE->getModificationTime())\n        continue;\n      std::string fileName(FE->getName());\n      if (!(fileName.compare(0, 5, \"\/usr\/\") == 0 &&\n            fileName.find(\"\/bits\/\") != std::string::npos)) {\n        Out << fileName << '\\n';\n      }\n    }\n  }\n\n  void ClangInternalState::printAST(llvm::raw_ostream& Out, ASTContext& C) {\n    TranslationUnitDecl* TU = C.getTranslationUnitDecl();\n    unsigned Indentation = 0;\n    bool PrintInstantiation = false;\n    std::string ErrMsg;\n    clang::PrintingPolicy policy = C.getPrintingPolicy();\n    TU->print(Out, policy, Indentation, PrintInstantiation);\n    \/\/ TODO: For future when we relpace the bump allocation with slab.\n    \/\/\n    \/\/Out << \"Allocated memory: \" << C.getAllocatedMemory();\n    \/\/Out << \"Side table allocated memory: \" << C.getSideTableAllocatedMemory();\n    Out.flush();\n  }\n\n  void ClangInternalState::printLLVMModule(llvm::raw_ostream& Out,\n                                           llvm::Module& M,\n                                           CodeGenerator& CG) {\n    M.print(Out, \/*AssemblyAnnotationWriter*\/ 0);\n    CG.print(Out);\n  }\n\n  void ClangInternalState::printMacroDefinitions(llvm::raw_ostream& Out,\n                            clang::Preprocessor& PP) {\n    std::string contents;\n    llvm::raw_string_ostream contentsOS(contents);\n    PP.printMacros(contentsOS);\n    contentsOS.flush();\n    Out << \"Ordered Alphabetically:\\n\";\n    std::vector<std::string> elems;\n    {\n      \/\/ Split the string into lines.\n      char delim = '\\n';\n      std::stringstream ss(contents);\n      std::string item;\n      while (std::getline(ss, item, delim)) {\n        elems.push_back(item);\n      }\n      \/\/ Sort them alphabetically\n      std::sort(elems.begin(), elems.end());\n    }\n    for(std::vector<std::string>::iterator I = elems.begin(), \n          E = elems.end(); I != E; ++I)\n      Out << *I << '\\n';\n    Out.flush();\n  }\n} \/\/ end namespace cling\n<commit_msg>Fix init order.<commit_after>\/\/------------------------------------------------------------------------------\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\n\/\/ author:  Vassil Vassilev <vasil.georgiev.vasilev@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\/Interpreter\/ClangInternalState.h\"\n\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/Lex\/Preprocessor.h\"\n#include \"clang\/AST\/RecursiveASTVisitor.h\"\n#include \"clang\/Basic\/Builtins.h\"\n#include \"clang\/Basic\/SourceManager.h\"\n#include \"clang\/CodeGen\/ModuleBuilder.h\"\n\n#include \"llvm\/ADT\/SmallString.h\"\n#include \"llvm\/IR\/Module.h\"\n#include \"llvm\/Support\/FileSystem.h\"\n#include \"llvm\/Support\/Path.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Support\/Signals.h\"\n\n#include <cstdio>\n#include <sstream>\n#include <string>\n#include <time.h>\n\n#ifdef WIN32\n#define popen _popen\n#define pclose _pclose\n#endif\n\nusing namespace clang;\n\nnamespace cling {\n\n  ClangInternalState::ClangInternalState(ASTContext& AC, Preprocessor& PP,\n                                         llvm::Module* M, CodeGenerator* CG,\n                                         const std::string& name)\n    : m_ASTContext(AC), m_Preprocessor(PP), m_CodeGen(CG), m_Module(M),\n      m_DiffCommand(\"diff -u --text \"), m_Name(name), m_DiffPair(0) {\n    store();\n  }\n\n  ClangInternalState::~ClangInternalState() {\n    \/\/ cleanup the temporary files:\n    remove(m_LookupTablesFile.c_str());\n    remove(m_IncludedFilesFile.c_str());\n    remove(m_ASTFile.c_str());\n    remove(m_LLVMModuleFile.c_str());\n    remove(m_MacrosFile.c_str());\n  }\n\n  void ClangInternalState::store() {\n    \/\/ Cannot use the stack (private copy ctor)\n    llvm::OwningPtr<llvm::raw_fd_ostream> m_LookupTablesOS;\n    llvm::OwningPtr<llvm::raw_fd_ostream> m_IncludedFilesOS;\n    llvm::OwningPtr<llvm::raw_fd_ostream> m_ASTOS;\n    llvm::OwningPtr<llvm::raw_fd_ostream> m_LLVMModuleOS;\n    llvm::OwningPtr<llvm::raw_fd_ostream> m_MacrosOS;\n\n    m_LookupTablesOS.reset(createOutputFile(\"lookup\",\n                                            &m_LookupTablesFile));\n    m_IncludedFilesOS.reset(createOutputFile(\"included\",\n                                             &m_IncludedFilesFile));\n    m_ASTOS.reset(createOutputFile(\"ast\", &m_ASTFile));\n    m_LLVMModuleOS.reset(createOutputFile(\"module\", &m_LLVMModuleFile));\n    m_MacrosOS.reset(createOutputFile(\"macros\", &m_MacrosFile));\n\n    printLookupTables(*m_LookupTablesOS.get(), m_ASTContext);\n    printIncludedFiles(*m_IncludedFilesOS.get(),\n                       m_ASTContext.getSourceManager());\n    printAST(*m_ASTOS.get(), m_ASTContext);\n    if (m_Module)\n      printLLVMModule(*m_LLVMModuleOS.get(), *m_Module, *m_CodeGen);\n    printMacroDefinitions(*m_MacrosOS.get(), m_Preprocessor);\n  }\n  namespace {\n    std::string getCurrentTimeAsString() {\n      time_t rawtime;\n      struct tm * timeinfo;\n      char buffer [80];\n\n      time (&rawtime);\n      timeinfo = localtime (&rawtime);\n\n      strftime (buffer, 80, \"%I_%M_%S\", timeinfo);\n      return buffer;\n    }\n  }\n\n  \/\/ Copied with modifications from CompilerInstance.cpp\n  llvm::raw_fd_ostream*\n  ClangInternalState::createOutputFile(llvm::StringRef OutFile,\n                                       std::string *TempPathName\/*=0*\/,\n                                       bool RemoveFileOnSignal\/*=true*\/) {\n    llvm::OwningPtr<llvm::raw_fd_ostream> OS;\n    std::string OSFile;\n    llvm::SmallString<256> OutputPath;\n    llvm::sys::path::system_temp_directory(\/*erasedOnReboot*\/false, OutputPath);\n\n    \/\/ Only create the temporary if the parent directory exists (or create\n    \/\/ missing directories is true) and we can actually write to OutPath,\n    \/\/ otherwise we want to fail early.\n    llvm::SmallString<256> TempPath(OutputPath);\n    llvm::sys::fs::make_absolute(TempPath);\n    assert(llvm::sys::fs::is_directory(TempPath.str()) && \"Must be a folder.\");\n    \/\/ Create a temporary file.\n    llvm::sys::path::append(TempPath, \"cling-\" + OutFile);\n    TempPath += \"-\" + getCurrentTimeAsString();\n    TempPath += \"-%%%%%%%%\";\n    int fd;\n    if (llvm::sys::fs::createUniqueFile(TempPath.str(), fd, TempPath)\n        == llvm::errc::success) {\n      OS.reset(new llvm::raw_fd_ostream(fd, \/*shouldClose=*\/true));\n      OSFile = TempPath.str();\n    }\n\n    \/\/ Make sure the out stream file gets removed if we crash.\n    if (RemoveFileOnSignal)\n      llvm::sys::RemoveFileOnSignal(OSFile);\n\n    if (TempPathName)\n      *TempPathName = OSFile;\n\n    return OS.take();\n  }\n\n  void ClangInternalState::compare(const std::string& name) {\n    assert(name == m_Name && \"Different names!?\");\n    m_DiffPair.reset(new ClangInternalState(m_ASTContext, m_Preprocessor,\n                                            m_Module, m_CodeGen, name));\n    std::string differences = \"\";\n    \/\/ Ignore the builtins\n    typedef llvm::SmallVector<const char*, 1024> Builtins;\n    Builtins builtinNames;\n    m_ASTContext.BuiltinInfo.GetBuiltinNames(builtinNames);\n    for (Builtins::iterator I = builtinNames.begin();\n         I != builtinNames.end();) {\n      if (llvm::StringRef(*I).startswith(\"__builtin\"))\n        I = builtinNames.erase(I);\n      else\n        ++I;\n    }\n\n    builtinNames.push_back(\".*__builtin.*\");\n\n    if (differentContent(m_LookupTablesFile, m_DiffPair->m_LookupTablesFile,\n                         differences, &builtinNames)) {\n      llvm::errs() << \"Differences in the lookup tables\\n\";\n      llvm::errs() << differences << \"\\n\";\n      differences = \"\";\n    }\n    if (differentContent(m_IncludedFilesFile, m_DiffPair->m_IncludedFilesFile,\n                         differences)) {\n      llvm::errs() << \"Differences in the included files\\n\";\n      llvm::errs() << differences << \"\\n\";\n      differences = \"\";\n    }\n    if (differentContent(m_ASTFile, m_DiffPair->m_ASTFile, differences)) {\n      llvm::errs() << \"Differences in the AST \\n\";\n      llvm::errs() << differences << \"\\n\";\n      differences = \"\";\n    }\n    if (m_Module) {\n      assert(m_CodeGen && \"Must have CodeGen set\");\n      \/\/ We want to skip the intrinsics\n      builtinNames.clear();\n      for (llvm::Module::const_iterator I = m_Module->begin(),\n             E = m_Module->end(); I != E; ++I)\n        if (I->isIntrinsic())\n          builtinNames.push_back(I->getName().data());\n\n      if (differentContent(m_LLVMModuleFile, m_DiffPair->m_LLVMModuleFile,\n                           differences, &builtinNames)) {\n        llvm::errs() << \"Differences in the llvm Module \\n\";\n        llvm::errs() << differences << \"\\n\";\n        differences = \"\";\n      }\n    }\n    if (differentContent(m_MacrosFile, m_DiffPair->m_MacrosFile, differences)){\n      llvm::errs() << \"Differences in the Macro Definitions \\n\";\n      llvm::errs() << differences << \"\\n\";\n      differences = \"\";\n    }\n  }\n\n  bool ClangInternalState::differentContent(const std::string& file1,\n                                            const std::string& file2,\n                                            std::string& differences,\n                const llvm::SmallVectorImpl<const char*>* ignores\/*=0*\/) const {\n    std::string diffCall = m_DiffCommand;\n    if (ignores) {\n      for (size_t i = 0, e = ignores->size(); i < e; ++i) {\n        diffCall += \" --ignore-matching-lines=\\\".*\";\n        diffCall += (*ignores)[i];\n        diffCall += \".*\\\"\";\n      }\n    }\n\n    FILE* pipe = popen((diffCall + \" \" + file1 + \" \" + file2).c_str() , \"r\");\n    assert(pipe && \"Error creating the pipe\");\n    assert(differences.empty() && \"Must be empty\");\n\n    char buffer[128];\n    while(!feof(pipe)) {\n      if(fgets(buffer, 128, pipe) != NULL)\n        differences += buffer;\n    }\n    pclose(pipe);\n\n    if (!differences.empty())\n      llvm::errs() << diffCall << \" \" << file1 << \" \" << file2 << \"\\n\";\n\n    return !differences.empty();\n  }\n\n  class DumpLookupTables : public RecursiveASTVisitor<DumpLookupTables> {\n  private:\n    llvm::raw_ostream& m_OS;\n  public:\n    DumpLookupTables(llvm::raw_ostream& OS) : m_OS(OS) { }\n    bool VisitDecl(Decl* D) {\n      if (DeclContext* DC = dyn_cast<DeclContext>(D))\n        VisitDeclContext(DC);\n      return true;\n    }\n\n    bool VisitDeclContext(DeclContext* DC) {\n      \/\/ If the lookup is pending for building, force its creation.\n      if (DC == DC->getPrimaryContext() && !DC->getLookupPtr())\n        DC->buildLookup();\n      DC->dumpLookups(m_OS);\n      return true;\n    }\n  };\n\n  void ClangInternalState::printLookupTables(llvm::raw_ostream& Out,\n                                             ASTContext& C) {\n    DumpLookupTables dumper(Out);\n    dumper.TraverseDecl(C.getTranslationUnitDecl());\n  }\n\n  void ClangInternalState::printIncludedFiles(llvm::raw_ostream& Out,\n                                              SourceManager& SM) {\n    for (clang::SourceManager::fileinfo_iterator I = SM.fileinfo_begin(),\n           E = SM.fileinfo_end(); I != E; ++I) {\n      const clang::SrcMgr::ContentCache &C = *I->second;\n      const clang::FileEntry *FE = C.OrigEntry;\n      \/\/ Our error recovery purges the cache of the FileEntry, but keeps\n      \/\/ the FileEntry's pointer so that if it was used by smb (like the\n      \/\/ SourceManager) it wouldn't be dangling. In that case we shouldn't\n      \/\/ print the FileName, because semantically it is not there.\n      if (!FE->getSize() && !FE->getModificationTime())\n        continue;\n      std::string fileName(FE->getName());\n      if (!(fileName.compare(0, 5, \"\/usr\/\") == 0 &&\n            fileName.find(\"\/bits\/\") != std::string::npos)) {\n        Out << fileName << '\\n';\n      }\n    }\n  }\n\n  void ClangInternalState::printAST(llvm::raw_ostream& Out, ASTContext& C) {\n    TranslationUnitDecl* TU = C.getTranslationUnitDecl();\n    unsigned Indentation = 0;\n    bool PrintInstantiation = false;\n    std::string ErrMsg;\n    clang::PrintingPolicy policy = C.getPrintingPolicy();\n    TU->print(Out, policy, Indentation, PrintInstantiation);\n    \/\/ TODO: For future when we relpace the bump allocation with slab.\n    \/\/\n    \/\/Out << \"Allocated memory: \" << C.getAllocatedMemory();\n    \/\/Out << \"Side table allocated memory: \" << C.getSideTableAllocatedMemory();\n    Out.flush();\n  }\n\n  void ClangInternalState::printLLVMModule(llvm::raw_ostream& Out,\n                                           llvm::Module& M,\n                                           CodeGenerator& CG) {\n    M.print(Out, \/*AssemblyAnnotationWriter*\/ 0);\n    CG.print(Out);\n  }\n\n  void ClangInternalState::printMacroDefinitions(llvm::raw_ostream& Out,\n                            clang::Preprocessor& PP) {\n    std::string contents;\n    llvm::raw_string_ostream contentsOS(contents);\n    PP.printMacros(contentsOS);\n    contentsOS.flush();\n    Out << \"Ordered Alphabetically:\\n\";\n    std::vector<std::string> elems;\n    {\n      \/\/ Split the string into lines.\n      char delim = '\\n';\n      std::stringstream ss(contents);\n      std::string item;\n      while (std::getline(ss, item, delim)) {\n        elems.push_back(item);\n      }\n      \/\/ Sort them alphabetically\n      std::sort(elems.begin(), elems.end());\n    }\n    for(std::vector<std::string>::iterator I = elems.begin(), \n          E = elems.end(); I != E; ++I)\n      Out << *I << '\\n';\n    Out.flush();\n  }\n} \/\/ end namespace cling\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2013-2014 Chun-Ying Huang\n *\n * This file is part of GamingAnywhere (GA).\n *\n * GA is free software; you can redistribute it and\/or modify it\n * under the terms of the 3-clause BSD License as published by the\n * Free Software Foundation: http:\/\/directory.fsf.org\/wiki\/License:BSD_3Clause\n *\n * GA is distributed in the hope 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 3-clause BSD License along with GA;\n * if not, write to the Free Software Foundation, Inc.,\n * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.\n *\/\n\n#include <MPEG1or2AudioRTPSink.hh>\n#include <MPEG4GenericRTPSink.hh>\n#include <AC3AudioRTPSink.hh>\n#include <SimpleRTPSink.hh>\n#include <VorbisAudioRTPSink.hh>\n#include <H264VideoRTPSink.hh>\n#include <H265VideoRTPSink.hh>\n#include <VP8VideoRTPSink.hh>\n#include <TheoraVideoRTPSink.hh>\n#include <T140TextRTPSink.hh>\n#include <H264VideoStreamDiscreteFramer.hh>\n#include <H265VideoStreamDiscreteFramer.hh>\n\n#include \"ga-common.h\"\n#include \"rtspconf.h\"\n#include \"encoder-common.h\"\n#include \"ga-mediasubsession.h\"\n#include \"ga-audiolivesource.h\"\n#include \"ga-videolivesource.h\"\n\nGAMediaSubsession\n::GAMediaSubsession(UsageEnvironment &env, int cid, const char *mimetype, portNumBits initialPortNum, Boolean multiplexRTCPWithRTP)\n\t\t: OnDemandServerMediaSubsession(env, True\/*reuseFirstSource*\/, initialPortNum, multiplexRTCPWithRTP) {\n\tthis->mimetype = strdup(mimetype);\n\tthis->channelId = cid;\n}\n\nGAMediaSubsession * GAMediaSubsession\n::createNew(UsageEnvironment &env, int cid, const char *mimetype,\n\t\tportNumBits initialPortNum,\n\t\tBoolean multiplexRTCPWithRTP) {\n\treturn new GAMediaSubsession(env, cid, mimetype, initialPortNum, multiplexRTCPWithRTP);\n}\n\nFramedSource* GAMediaSubsession\n::createNewStreamSource(unsigned clientSessionId,\n\t\t\tunsigned& estBitrate) {\n\tFramedSource *result = NULL;\n\tif(strncmp(\"audio\/\", this->mimetype, 6) == 0) {\n\t\testBitrate = 128; \/* Kbps *\/\n\t\tresult = GAAudioLiveSource::createNew(envir(), this->channelId);\n\t} else if(strncmp(\"video\/\", this->mimetype, 6) == 0) {\n\t\testBitrate = 500; \/* Kbps *\/\n\t\tOutPacketBuffer::increaseMaxSizeTo(300000);\n\t\tresult = GAVideoLiveSource::createNew(envir(), this->channelId);\n\t}\n\tdo if(result != NULL) {\n\t\tif(strcmp(\"video\/H264\", this->mimetype) == 0) {\n\t\t\tresult = H264VideoStreamDiscreteFramer::createNew(envir(), result);\n\t\t\tbreak;\n\t\t}\n\t\tif(strcmp(\"video\/H265\", this->mimetype) == 0) {\n\t\t\tresult = H265VideoStreamDiscreteFramer::createNew(envir(), result);\n\t\t\tbreak;\n\t\t}\n\t} while(0);\n\treturn result;\n}\n\n\/\/ \"estBitrate\" is the stream's estimated bitrate, in kbps\nRTPSink* GAMediaSubsession\n::createNewRTPSink(Groupsock* rtpGroupsock,\n\t\t\tunsigned char rtpPayloadTypeIfDynamic,\n\t\t\tFramedSource* inputSource) {\n\tRTPSink *result = NULL;\n\tstruct RTSPConf *rtspconf = rtspconf_global();\n\tconst char *mimetype = this->mimetype;\n\t\/\/\n\tif(strcmp(mimetype, \"audio\/MPEG\") == 0) {\n\t\tresult = MPEG1or2AudioRTPSink::createNew(envir(), rtpGroupsock);\n\t} else if(strcmp(mimetype, \"audio\/AAC\") == 0) {\n\t\t\/\/ TODO: not implememted\n\t\tga_error(\"GAMediaSubsession: %s NOT IMPLEMENTED\\n\", mimetype);\n\t\texit(-1);\n\t} else if(strcmp(mimetype, \"audio\/AC3\") == 0) {\n\t\tresult = AC3AudioRTPSink\n\t\t\t::createNew(envir(), rtpGroupsock, rtpPayloadTypeIfDynamic,\n\t\t\t\t\trtspconf->audio_samplerate);\n\t} else if(strcmp(mimetype, \"audio\/OPUS\") == 0) {\n\t\tresult = SimpleRTPSink\n\t\t\t::createNew(envir(), rtpGroupsock, rtpPayloadTypeIfDynamic,\n\t\t\t\t\trtspconf->audio_samplerate,\n\t\t\t\t\t\"audio\", \"OPUS\", 2, False\/*only 1 Opus 'packet' in each RTP packet*\/);\n\t} else if(strcmp(mimetype, \"audio\/VORBIS\") == 0) {\n\t\tu_int8_t* identificationHeader = NULL; unsigned identificationHeaderSize = 0;\n\t\tu_int8_t* commentHeader = NULL; unsigned commentHeaderSize = 0;\n\t\tu_int8_t* setupHeader = NULL; unsigned setupHeaderSize = 0;\n\t\t\/\/ TODO: not implememted\n\t\tga_error(\"GAMediaSubsession: %s NOT IMPLEMENTED\\n\", mimetype);\n\t\texit(-1);\n\t\tresult = VorbisAudioRTPSink\n\t\t\t::createNew(envir(), rtpGroupsock, rtpPayloadTypeIfDynamic,\n\t\t\t\t\trtspconf->audio_samplerate,\n\t\t\t\t\trtspconf->audio_channels,\n\t\t\t\t\tidentificationHeader, identificationHeaderSize,\n\t\t\t\t\tcommentHeader, commentHeaderSize,\n\t\t\t\t\tsetupHeader, setupHeaderSize);\n\t} else if(strcmp(mimetype, \"video\/THEORA\") == 0) {\n\t\tu_int8_t* identificationHeader = NULL; unsigned identificationHeaderSize = 0;\n\t\tu_int8_t* commentHeader = NULL; unsigned commentHeaderSize = 0;\n\t\tu_int8_t* setupHeader = NULL; unsigned setupHeaderSize = 0;\n\t\t\/\/ TODO: not implememted\n\t\tga_error(\"GAMediaSubsession: %s NOT IMPLEMENTED\\n\", mimetype);\n\t\texit(-1);\n\t\tresult = TheoraVideoRTPSink\n\t\t\t::createNew(envir(), rtpGroupsock, rtpPayloadTypeIfDynamic,\n\t\t\t\t\tidentificationHeader, identificationHeaderSize,\n\t\t\t\t\tcommentHeader, commentHeaderSize,\n\t\t\t\t\tsetupHeader, setupHeaderSize);\n\t} else if(strcmp(mimetype, \"video\/H264\") == 0) {\n\t\tga_module_t *m = encoder_get_vencoder();\n\t\tunsigned profile_level_id = 0;\n\t\tu_int8_t* SPS = NULL; int SPSSize = 0;\n\t\tu_int8_t* PPS = NULL; int PPSSize = 0;\n\t\tSPS = (u_int8_t*) m->option1((void*) this->channelId, &SPSSize);\n\t\tPPS = (u_int8_t*) m->option2((void*) this->channelId, &PPSSize);\n\t\tif (SPSSize >= 1\/*'profile_level_id' offset within SPS*\/ + 3\/*num bytes needed*\/) {\n\t\t\tprofile_level_id = (SPS[1]<<16) | (SPS[2]<<8) | SPS[3];\n\t\t}\n\t\tga_error(\"GAMediaSubsession: %s SPS=%p(%d); PPS=%p(%d); profile_level_id=%x\\n\",\n\t\t\tmimetype,\n\t\t\tSPS, SPSSize, PPS, PPSSize, profile_level_id);\n\t\tresult = H264VideoRTPSink::createNew(envir(), rtpGroupsock, rtpPayloadTypeIfDynamic,\n\t\t\t\tSPS, SPSSize, PPS, PPSSize, profile_level_id);\n\t} else if(strcmp(mimetype, \"video\/H265\") == 0) {\n\t\tunsigned profileSpace = 0; \/\/ general_profile_space\n\t\tunsigned profileId = 0; \/\/ general_profile_idc\n\t\tunsigned tierFlag = 0; \/\/ general_tier_flag\n\t\tunsigned levelId = 0; \/\/ general_level_idc\n\t\tchar interopConstraintsStr[100];\n\t\t\/\/\n\t\tu_int8_t* VPS = NULL; unsigned VPSSize = 0;\n\t\tu_int8_t* SPS = NULL; unsigned SPSSize = 0;\n\t\tu_int8_t* PPS = NULL; unsigned PPSSize = 0;\n\t\t\/\/ TODO: not implememted\n\t\tga_error(\"GAMediaSubsession: %s NOT IMPLEMENTED\\n\", mimetype);\n\t\texit(-1);\n\t\tresult = H265VideoRTPSink::createNew(envir(), rtpGroupsock, rtpPayloadTypeIfDynamic,\n\t\t\t\tVPS, VPSSize, SPS, SPSSize, PPS, PPSSize,\n\t\t\t\tprofileSpace, profileId, tierFlag, levelId,\n\t\t\t\tinteropConstraintsStr);\n\t} else if(strcmp(mimetype, \"video\/VP8\") == 0) {\n\t\tresult = VP8VideoRTPSink::createNew(envir(), rtpGroupsock, rtpPayloadTypeIfDynamic);\n\t} \n\tif(result == NULL) {\n\t\tga_error(\"GAMediaSubsession: create RTP sink for %s failed.\\n\", mimetype);\n\t}\n\treturn result;\n}\n\n<commit_msg>retrieve estimate bitrate from audio\/video configs<commit_after>\/*\n * Copyright (c) 2013-2014 Chun-Ying Huang\n *\n * This file is part of GamingAnywhere (GA).\n *\n * GA is free software; you can redistribute it and\/or modify it\n * under the terms of the 3-clause BSD License as published by the\n * Free Software Foundation: http:\/\/directory.fsf.org\/wiki\/License:BSD_3Clause\n *\n * GA is distributed in the hope 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 3-clause BSD License along with GA;\n * if not, write to the Free Software Foundation, Inc.,\n * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.\n *\/\n\n#include <MPEG1or2AudioRTPSink.hh>\n#include <MPEG4GenericRTPSink.hh>\n#include <AC3AudioRTPSink.hh>\n#include <SimpleRTPSink.hh>\n#include <VorbisAudioRTPSink.hh>\n#include <H264VideoRTPSink.hh>\n#include <H265VideoRTPSink.hh>\n#include <VP8VideoRTPSink.hh>\n#include <TheoraVideoRTPSink.hh>\n#include <T140TextRTPSink.hh>\n#include <H264VideoStreamDiscreteFramer.hh>\n#include <H265VideoStreamDiscreteFramer.hh>\n\n#include \"ga-common.h\"\n#include \"ga-conf.h\"\n#include \"rtspconf.h\"\n#include \"encoder-common.h\"\n#include \"ga-mediasubsession.h\"\n#include \"ga-audiolivesource.h\"\n#include \"ga-videolivesource.h\"\n\nGAMediaSubsession\n::GAMediaSubsession(UsageEnvironment &env, int cid, const char *mimetype, portNumBits initialPortNum, Boolean multiplexRTCPWithRTP)\n\t\t: OnDemandServerMediaSubsession(env, True\/*reuseFirstSource*\/, initialPortNum, multiplexRTCPWithRTP) {\n\tthis->mimetype = strdup(mimetype);\n\tthis->channelId = cid;\n}\n\nGAMediaSubsession * GAMediaSubsession\n::createNew(UsageEnvironment &env, int cid, const char *mimetype,\n\t\tportNumBits initialPortNum,\n\t\tBoolean multiplexRTCPWithRTP) {\n\treturn new GAMediaSubsession(env, cid, mimetype, initialPortNum, multiplexRTCPWithRTP);\n}\n\nFramedSource* GAMediaSubsession\n::createNewStreamSource(unsigned clientSessionId,\n\t\t\tunsigned& estBitrate) {\n\tFramedSource *result = NULL;\n\tstruct RTSPConf *rtspconf = rtspconf_global();\n\tif(strncmp(\"audio\/\", this->mimetype, 6) == 0) {\n\t\testBitrate = rtspconf->audio_bitrate \/ 1000; \/* Kbps *\/\n\t\tresult = GAAudioLiveSource::createNew(envir(), this->channelId);\n\t} else if(strncmp(\"video\/\", this->mimetype, 6) == 0) {\n\t\t\/\/estBitrate = 500; \/* Kbps *\/\n\t\testBitrate = ga_conf_mapreadint(\"video-specific\", \"b\") \/ 1000; \/* Kbps *\/\n\t\tOutPacketBuffer::increaseMaxSizeTo(300000);\n\t\tresult = GAVideoLiveSource::createNew(envir(), this->channelId);\n\t}\n\tdo if(result != NULL) {\n\t\tif(strcmp(\"video\/H264\", this->mimetype) == 0) {\n\t\t\tresult = H264VideoStreamDiscreteFramer::createNew(envir(), result);\n\t\t\tbreak;\n\t\t}\n\t\tif(strcmp(\"video\/H265\", this->mimetype) == 0) {\n\t\t\tresult = H265VideoStreamDiscreteFramer::createNew(envir(), result);\n\t\t\tbreak;\n\t\t}\n\t} while(0);\n\treturn result;\n}\n\n\/\/ \"estBitrate\" is the stream's estimated bitrate, in kbps\nRTPSink* GAMediaSubsession\n::createNewRTPSink(Groupsock* rtpGroupsock,\n\t\t\tunsigned char rtpPayloadTypeIfDynamic,\n\t\t\tFramedSource* inputSource) {\n\tRTPSink *result = NULL;\n\tstruct RTSPConf *rtspconf = rtspconf_global();\n\tconst char *mimetype = this->mimetype;\n\t\/\/\n\tif(strcmp(mimetype, \"audio\/MPEG\") == 0) {\n\t\tresult = MPEG1or2AudioRTPSink::createNew(envir(), rtpGroupsock);\n\t} else if(strcmp(mimetype, \"audio\/AAC\") == 0) {\n\t\t\/\/ TODO: not implememted\n\t\tga_error(\"GAMediaSubsession: %s NOT IMPLEMENTED\\n\", mimetype);\n\t\texit(-1);\n\t} else if(strcmp(mimetype, \"audio\/AC3\") == 0) {\n\t\tresult = AC3AudioRTPSink\n\t\t\t::createNew(envir(), rtpGroupsock, rtpPayloadTypeIfDynamic,\n\t\t\t\t\trtspconf->audio_samplerate);\n\t} else if(strcmp(mimetype, \"audio\/OPUS\") == 0) {\n\t\tresult = SimpleRTPSink\n\t\t\t::createNew(envir(), rtpGroupsock, rtpPayloadTypeIfDynamic,\n\t\t\t\t\trtspconf->audio_samplerate,\n\t\t\t\t\t\"audio\", \"OPUS\", 2, False\/*only 1 Opus 'packet' in each RTP packet*\/);\n\t} else if(strcmp(mimetype, \"audio\/VORBIS\") == 0) {\n\t\tu_int8_t* identificationHeader = NULL; unsigned identificationHeaderSize = 0;\n\t\tu_int8_t* commentHeader = NULL; unsigned commentHeaderSize = 0;\n\t\tu_int8_t* setupHeader = NULL; unsigned setupHeaderSize = 0;\n\t\t\/\/ TODO: not implememted\n\t\tga_error(\"GAMediaSubsession: %s NOT IMPLEMENTED\\n\", mimetype);\n\t\texit(-1);\n\t\tresult = VorbisAudioRTPSink\n\t\t\t::createNew(envir(), rtpGroupsock, rtpPayloadTypeIfDynamic,\n\t\t\t\t\trtspconf->audio_samplerate,\n\t\t\t\t\trtspconf->audio_channels,\n\t\t\t\t\tidentificationHeader, identificationHeaderSize,\n\t\t\t\t\tcommentHeader, commentHeaderSize,\n\t\t\t\t\tsetupHeader, setupHeaderSize);\n\t} else if(strcmp(mimetype, \"video\/THEORA\") == 0) {\n\t\tu_int8_t* identificationHeader = NULL; unsigned identificationHeaderSize = 0;\n\t\tu_int8_t* commentHeader = NULL; unsigned commentHeaderSize = 0;\n\t\tu_int8_t* setupHeader = NULL; unsigned setupHeaderSize = 0;\n\t\t\/\/ TODO: not implememted\n\t\tga_error(\"GAMediaSubsession: %s NOT IMPLEMENTED\\n\", mimetype);\n\t\texit(-1);\n\t\tresult = TheoraVideoRTPSink\n\t\t\t::createNew(envir(), rtpGroupsock, rtpPayloadTypeIfDynamic,\n\t\t\t\t\tidentificationHeader, identificationHeaderSize,\n\t\t\t\t\tcommentHeader, commentHeaderSize,\n\t\t\t\t\tsetupHeader, setupHeaderSize);\n\t} else if(strcmp(mimetype, \"video\/H264\") == 0) {\n\t\tga_module_t *m = encoder_get_vencoder();\n\t\tunsigned profile_level_id = 0;\n\t\tu_int8_t* SPS = NULL; int SPSSize = 0;\n\t\tu_int8_t* PPS = NULL; int PPSSize = 0;\n\t\tSPS = (u_int8_t*) m->option1((void*) this->channelId, &SPSSize);\n\t\tPPS = (u_int8_t*) m->option2((void*) this->channelId, &PPSSize);\n\t\tif (SPSSize >= 1\/*'profile_level_id' offset within SPS*\/ + 3\/*num bytes needed*\/) {\n\t\t\tprofile_level_id = (SPS[1]<<16) | (SPS[2]<<8) | SPS[3];\n\t\t}\n\t\tga_error(\"GAMediaSubsession: %s SPS=%p(%d); PPS=%p(%d); profile_level_id=%x\\n\",\n\t\t\tmimetype,\n\t\t\tSPS, SPSSize, PPS, PPSSize, profile_level_id);\n\t\tresult = H264VideoRTPSink::createNew(envir(), rtpGroupsock, rtpPayloadTypeIfDynamic,\n\t\t\t\tSPS, SPSSize, PPS, PPSSize, profile_level_id);\n\t} else if(strcmp(mimetype, \"video\/H265\") == 0) {\n\t\tunsigned profileSpace = 0; \/\/ general_profile_space\n\t\tunsigned profileId = 0; \/\/ general_profile_idc\n\t\tunsigned tierFlag = 0; \/\/ general_tier_flag\n\t\tunsigned levelId = 0; \/\/ general_level_idc\n\t\tchar interopConstraintsStr[100];\n\t\t\/\/\n\t\tu_int8_t* VPS = NULL; unsigned VPSSize = 0;\n\t\tu_int8_t* SPS = NULL; unsigned SPSSize = 0;\n\t\tu_int8_t* PPS = NULL; unsigned PPSSize = 0;\n\t\t\/\/ TODO: not implememted\n\t\tga_error(\"GAMediaSubsession: %s NOT IMPLEMENTED\\n\", mimetype);\n\t\texit(-1);\n\t\tresult = H265VideoRTPSink::createNew(envir(), rtpGroupsock, rtpPayloadTypeIfDynamic,\n\t\t\t\tVPS, VPSSize, SPS, SPSSize, PPS, PPSSize,\n\t\t\t\tprofileSpace, profileId, tierFlag, levelId,\n\t\t\t\tinteropConstraintsStr);\n\t} else if(strcmp(mimetype, \"video\/VP8\") == 0) {\n\t\tresult = VP8VideoRTPSink::createNew(envir(), rtpGroupsock, rtpPayloadTypeIfDynamic);\n\t} \n\tif(result == NULL) {\n\t\tga_error(\"GAMediaSubsession: create RTP sink for %s failed.\\n\", mimetype);\n\t}\n\treturn result;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Author: Jon Trulson <jtrulson@ics.com>\n * Copyright (c) 2015 Intel Corporation.\n *\n * Thanks to Adafruit for some important clues\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 <unistd.h>\n#include <math.h>\n#include <iostream>\n#include <string>\n\n#include \"si114x.h\"\n\nusing namespace upm;\nusing namespace std;\n\n\nSI114X::SI114X(int bus, uint8_t address)\n{\n  m_addr = address;\n  m_uvIndex = 0;\n\n  \/\/ setup our i2c link\n  if ( !(m_i2c = mraa_i2c_init(bus)) )\n    {\n      cerr << \"SI114X: mraa_i2c_init() failed.\" << endl;\n      return;\n    }\n      \n  mraa_result_t rv;\n  \n  if ( (rv = mraa_i2c_address(m_i2c, m_addr)) != MRAA_SUCCESS)\n    {\n      cerr << \"SI114X: Could not initialize i2c bus. \" << endl;\n      mraa_result_print(rv);\n      return;\n    }\n\n  \/\/ The data sheet recommends setting the UV calibration values to\n  \/\/ 0x7b, 0x6b, 0x01, and 0x00, however the adafruit code uses a\n  \/\/ different set of values, presumably calibrated to their specific\n  \/\/ implementation.  We will use those defaults here, as this was\n  \/\/ developed on an adafruit device.  \n\n  \/\/ Use setUVCalibration() to set a different set of values before\n  \/\/ calling init() if you need different values.\n\n  setUVCalibration(0x29, 0x89, 0x02, 0x00);\n}\n\nSI114X::~SI114X()\n{\n  mraa_i2c_stop(m_i2c);\n}\n\nbool SI114X::writeByte(uint8_t reg, uint8_t byte)\n{\n  mraa_result_t rv = mraa_i2c_write_byte_data(m_i2c, byte, reg);\n\n  if (rv != MRAA_SUCCESS)\n    {\n      cerr << __FUNCTION__ << \": mraa_i2c_write_byte() failed.\" << endl;\n      mraa_result_print(rv);\n      return false;\n    }\n\n  return true;\n}\n\nuint8_t SI114X::readByte(uint8_t reg)\n{\n  return mraa_i2c_read_byte_data(m_i2c, reg);\n}\n\nuint16_t SI114X::readWord(uint8_t reg)\n{\n  return mraa_i2c_read_word_data(m_i2c, reg);\n}\n\nvoid SI114X::setUVCalibration(uint8_t uvcoeff0, uint8_t uvcoeff1, \n                              uint8_t uvcoeff2, uint8_t uvcoeff3)\n{\n  m_uv_cal[0] = uvcoeff0;\n  m_uv_cal[1] = uvcoeff1;\n  m_uv_cal[2] = uvcoeff2;\n  m_uv_cal[3] = uvcoeff3; \n};\n\n\nvoid SI114X::writeParam(SI114X_PARAM_T param, uint8_t value)\n{\n  \/\/ write a parameter to the RAM parameter area\n\n  \/\/ We write the value to the PARAM_WR register, then execute a\n  \/\/ PARAM_WRITE command\n\n  writeByte(REG_PARAM_WR, value);\n\n  \/\/ now write it to parameter memory\n  writeByte(REG_COMMAND, CMD_PARAM_SET | param);\n}\n\nuint8_t SI114X::readParam(SI114X_PARAM_T param)\n{\n  \/\/ get the parameter into register REG_PARAM_READ, then read and return it.\n\n  writeByte(REG_COMMAND, CMD_PARAM_QUERY | param);\n  return readByte(REG_PARAM_READ);\n}\n\nvoid SI114X::reset()\n{\n  \/\/ reset the device \n\n  \/\/ zero out measuring rate\n  writeByte(REG_MEAS_RATE0, 0);\n  writeByte(REG_MEAS_RATE1, 0);\n\n  \/\/ disable IRQ MODES\n  \/\/ these are undocumented in the datasheet, but mentioned in Adafruit's code\n  writeByte(REG_IRQ_MODE1, 0);\n  writeByte(REG_IRQ_MODE2, 0);\n  \n  \/\/ turn off interrupts\n  writeByte(REG_INT_CFG, 0);\n  writeByte(REG_IRQ_STATUS, 0xff);\n\n  \/\/ send a reset\n  writeByte(REG_COMMAND, CMD_RESET);\n  usleep(100);\n\n  \/\/ set the hardware key\n  writeByte(REG_HW_KEY, SI114X_HW_KEY);\n  usleep(100);\n}\n\nvoid SI114X::initialize()\n{\n  \/\/ initialize the device\n\n  \/\/ first, reset it\n  reset();\n\n  \/\/ UV coefficients\n  writeByte(REG_UCOEF0, m_uv_cal[0]);\n  writeByte(REG_UCOEF1, m_uv_cal[1]);\n  writeByte(REG_UCOEF2, m_uv_cal[2]);\n  writeByte(REG_UCOEF3, m_uv_cal[3]);\n  \n  \/\/ enable UV sensor only for now\n  writeParam(PARAM_CHLIST, CHLIST_EN_UV);\n\n  \/\/ auto-measure speed - slowest - (rate * 31.25us)\n  writeByte(REG_MEAS_RATE0, 0xff); \/\/ 7.9ms\n\n  \/\/ set autorun\n  writeByte(REG_COMMAND, CMD_ALS_AUTO);\n}\n\nvoid SI114X::update()\n{\n  \/\/ for now, just update the UV Index member variable\n  uint16_t uvi = readWord(REG_AUX_UVINDEX0);\n\n  m_uvIndex = float(uvi) \/ 100.0;\n\n  \/\/ Add any further data gets() here\n\n  return;\n}\n<commit_msg>si114x: throw exception(s) on fatal errors<commit_after>\/*\n * Author: Jon Trulson <jtrulson@ics.com>\n * Copyright (c) 2015 Intel Corporation.\n *\n * Thanks to Adafruit for some important clues\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 <unistd.h>\n#include <math.h>\n#include <iostream>\n#include <stdexcept>\n#include <string>\n\n#include \"si114x.h\"\n\nusing namespace upm;\nusing namespace std;\n\n\nSI114X::SI114X(int bus, uint8_t address)\n{\n  m_addr = address;\n  m_uvIndex = 0;\n\n  \/\/ setup our i2c link\n  if ( !(m_i2c = mraa_i2c_init(bus)) )\n    {\n      throw std::invalid_argument(std::string(__FUNCTION__) +\n                                  \": mraa_i2c_init() failed\");\n      return;\n    }\n      \n  mraa_result_t rv;\n  \n  if ( (rv = mraa_i2c_address(m_i2c, m_addr)) != MRAA_SUCCESS)\n    {\n      throw std::runtime_error(std::string(__FUNCTION__) +\n                               \": mraa_i2c_address() failed\");\n      return;\n    }\n\n  \/\/ The data sheet recommends setting the UV calibration values to\n  \/\/ 0x7b, 0x6b, 0x01, and 0x00, however the adafruit code uses a\n  \/\/ different set of values, presumably calibrated to their specific\n  \/\/ implementation.  We will use those defaults here, as this was\n  \/\/ developed on an adafruit device.  \n\n  \/\/ Use setUVCalibration() to set a different set of values before\n  \/\/ calling init() if you need different values.\n\n  setUVCalibration(0x29, 0x89, 0x02, 0x00);\n}\n\nSI114X::~SI114X()\n{\n  mraa_i2c_stop(m_i2c);\n}\n\nbool SI114X::writeByte(uint8_t reg, uint8_t byte)\n{\n  mraa_result_t rv = mraa_i2c_write_byte_data(m_i2c, byte, reg);\n\n  if (rv != MRAA_SUCCESS)\n    {\n      throw std::runtime_error(std::string(__FUNCTION__) +\n                               \": mraa_i2c_write_byte() failed\");\n      return false;\n    }\n\n  return true;\n}\n\nuint8_t SI114X::readByte(uint8_t reg)\n{\n  return mraa_i2c_read_byte_data(m_i2c, reg);\n}\n\nuint16_t SI114X::readWord(uint8_t reg)\n{\n  return mraa_i2c_read_word_data(m_i2c, reg);\n}\n\nvoid SI114X::setUVCalibration(uint8_t uvcoeff0, uint8_t uvcoeff1, \n                              uint8_t uvcoeff2, uint8_t uvcoeff3)\n{\n  m_uv_cal[0] = uvcoeff0;\n  m_uv_cal[1] = uvcoeff1;\n  m_uv_cal[2] = uvcoeff2;\n  m_uv_cal[3] = uvcoeff3; \n};\n\n\nvoid SI114X::writeParam(SI114X_PARAM_T param, uint8_t value)\n{\n  \/\/ write a parameter to the RAM parameter area\n\n  \/\/ We write the value to the PARAM_WR register, then execute a\n  \/\/ PARAM_WRITE command\n\n  writeByte(REG_PARAM_WR, value);\n\n  \/\/ now write it to parameter memory\n  writeByte(REG_COMMAND, CMD_PARAM_SET | param);\n}\n\nuint8_t SI114X::readParam(SI114X_PARAM_T param)\n{\n  \/\/ get the parameter into register REG_PARAM_READ, then read and return it.\n\n  writeByte(REG_COMMAND, CMD_PARAM_QUERY | param);\n  return readByte(REG_PARAM_READ);\n}\n\nvoid SI114X::reset()\n{\n  \/\/ reset the device \n\n  \/\/ zero out measuring rate\n  writeByte(REG_MEAS_RATE0, 0);\n  writeByte(REG_MEAS_RATE1, 0);\n\n  \/\/ disable IRQ MODES\n  \/\/ these are undocumented in the datasheet, but mentioned in Adafruit's code\n  writeByte(REG_IRQ_MODE1, 0);\n  writeByte(REG_IRQ_MODE2, 0);\n  \n  \/\/ turn off interrupts\n  writeByte(REG_INT_CFG, 0);\n  writeByte(REG_IRQ_STATUS, 0xff);\n\n  \/\/ send a reset\n  writeByte(REG_COMMAND, CMD_RESET);\n  usleep(100);\n\n  \/\/ set the hardware key\n  writeByte(REG_HW_KEY, SI114X_HW_KEY);\n  usleep(100);\n}\n\nvoid SI114X::initialize()\n{\n  \/\/ initialize the device\n\n  \/\/ first, reset it\n  reset();\n\n  \/\/ UV coefficients\n  writeByte(REG_UCOEF0, m_uv_cal[0]);\n  writeByte(REG_UCOEF1, m_uv_cal[1]);\n  writeByte(REG_UCOEF2, m_uv_cal[2]);\n  writeByte(REG_UCOEF3, m_uv_cal[3]);\n  \n  \/\/ enable UV sensor only for now\n  writeParam(PARAM_CHLIST, CHLIST_EN_UV);\n\n  \/\/ auto-measure speed - slowest - (rate * 31.25us)\n  writeByte(REG_MEAS_RATE0, 0xff); \/\/ 7.9ms\n\n  \/\/ set autorun\n  writeByte(REG_COMMAND, CMD_ALS_AUTO);\n}\n\nvoid SI114X::update()\n{\n  \/\/ for now, just update the UV Index member variable\n  uint16_t uvi = readWord(REG_AUX_UVINDEX0);\n\n  m_uvIndex = float(uvi) \/ 100.0;\n\n  \/\/ Add any further data gets() here\n\n  return;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************************\n *                                                                                       *\n * owl                                                                                   *\n *                                                                                       *\n * Copyright (c) 2014 Jonas Strandstedt                                                  *\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 <owl\/signal\/signal.h>\n\n#include <signal.h>\n#ifdef __WIN32__\n\n#ifndef SIGHUP\n#define SIGHUP 1\n#endif\n#ifndef SIGQUIT\n#define SIGQUIT 3\n#endif\n#ifndef SIGKILL\n#define SIGKILL 9\n#endif\n#ifndef SIGSTOP\n#define SIGSTOP 23\n#endif\n#ifndef SIGTSTP\n#define SIGTSTP 20\n#endif\n\n#endif\n\n#include <owl\/data\/bimap.hpp>\n\nnamespace {\n    const std::string _loggerCat = \"SignalHandler\";\n}\n\nnamespace owl {\n\nvoid owl_signal_handler(int signo) {\n    owl::SignalHandler::ref().call(signo);\n}\n\nSignalHandler::SignalHandler() {\n    for (auto &c: _callbacks) {\n        c = nullptr;\n    }\n}\n\nSignalHandler::~SignalHandler() {\n}\n\nint SignalHandler::signalnumber (Signal s) {\n    switch (s) {\n        case Signal::Hangup:\n            return SIGHUP;\n        case Signal::Abort:\n            return SIGABRT;\n        case Signal::Quit:\n            return SIGQUIT;\n        case Signal::IllegalInstruction:\n            return SIGILL;\n        case Signal::Interrupt:\n            return SIGINT;\n        case Signal::Kill:\n            return SIGKILL;\n        case Signal::Terminate:\n            return SIGTERM;\n        case Signal::Stop:\n            return SIGSTOP;\n        case Signal::TTYStop:\n            return SIGTSTP;\n        default:\n            return 0;\n    }\n}\n\nint SignalHandler::numberToSignalPosition (int signo) {\n    switch (signo) {\n        case SIGHUP:\n            return 0;\n        case SIGABRT:\n            return 1;\n        case SIGQUIT:\n            return 2;\n        case SIGILL:\n            return 3;\n        case SIGINT:\n            return 4;\n        case SIGKILL:\n            return 5;\n        case SIGTERM:\n            return 6;\n        case SIGSTOP:\n            return 7;\n        case SIGTSTP:\n            return 8;\n        default:\n            return -1;\n    }\n}\n\nvoid SignalHandler::setCallback(int s, SignalCallback callback) {\n    \n    void (*c)(int) = owl_signal_handler;\n    if(callback == nullptr)\n        c = SIG_DFL;\n    \n    _lock.lock();\n    for (int i = 0; i < SignalHandler::NumberOfCallbacks; ++i) {\n        int no = 1 << i;\n        if(s & no) {\n            int signr = signalnumber(static_cast<Signal>(no));\n            if(signr > 0) {\n                _callbacks[i] = callback;\n                signal(signr, c);\n            }\n        }\n    }\n    _lock.unlock();\n}\n    \nstd::string SignalHandler::toString(Signal signal) {\n    switch(signal) {\n        case Signal::Hangup:\n            return \"Hangup\";\n        case Signal::Abort:\n            return \"Abort\";\n        case Signal::Quit:\n            return \"Quit\";\n        case Signal::IllegalInstruction:\n            return \"IllegalInstruction\";\n        case Signal::Interrupt:\n            return \"Interrupt\";\n        case Signal::Kill:\n            return \"Kill\";\n        case Signal::Terminate:\n            return \"Terminate\";\n        case Signal::Stop:\n            return \"Stop\";\n        case Signal::TTYStop:\n            return \"TTYStop\";\n        default:\n            return \"Unknown\";\n            break;\n    }\n}\n    \nstd::string SignalHandler::toString(int signal) {\n    switch(signal) {\n        case SIGHUP :\n            return toString(Signal::Hangup);\n        case SIGABRT  :\n            return toString(Signal::Abort);\n        case SIGQUIT  :\n            return toString(Signal::Quit);\n        case SIGILL :\n            return toString(Signal::IllegalInstruction);\n        case SIGINT :\n            return toString(Signal::Interrupt);\n        case SIGKILL  :\n            return toString(Signal::Kill);\n        case SIGTERM  :\n            return toString(Signal::Terminate);\n        case SIGSTOP  :\n            return toString(Signal::Stop);\n        case SIGTSTP :\n            return toString(Signal::TTYStop);\n        default:\n            return \"Unknown\";\n            break;\n    }\n}\n\nvoid SignalHandler::call(int signo) {\n    int callbackpos = numberToSignalPosition(signo);\n    if(callbackpos < 0)\n        return;\n    \n    _lock.lock();\n    \n        if(_callbacks[callbackpos] != nullptr)\n            _callbacks[callbackpos](static_cast<Signal>(1<<callbackpos));\n    \n    _lock.unlock();\n}\n\n}<commit_msg>REmoved reference to BiMap<commit_after>\/*****************************************************************************************\n *                                                                                       *\n * owl                                                                                   *\n *                                                                                       *\n * Copyright (c) 2014 Jonas Strandstedt                                                  *\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 <owl\/signal\/signal.h>\n\n#include <signal.h>\n#ifdef __WIN32__\n\n#ifndef SIGHUP\n#define SIGHUP 1\n#endif\n#ifndef SIGQUIT\n#define SIGQUIT 3\n#endif\n#ifndef SIGKILL\n#define SIGKILL 9\n#endif\n#ifndef SIGSTOP\n#define SIGSTOP 23\n#endif\n#ifndef SIGTSTP\n#define SIGTSTP 20\n#endif\n\n#endif\n\nnamespace {\n    const std::string _loggerCat = \"SignalHandler\";\n}\n\nnamespace owl {\n\nvoid owl_signal_handler(int signo) {\n    owl::SignalHandler::ref().call(signo);\n}\n\nSignalHandler::SignalHandler() {\n    for (auto &c: _callbacks) {\n        c = nullptr;\n    }\n}\n\nSignalHandler::~SignalHandler() {\n}\n\nint SignalHandler::signalnumber (Signal s) {\n    switch (s) {\n        case Signal::Hangup:\n            return SIGHUP;\n        case Signal::Abort:\n            return SIGABRT;\n        case Signal::Quit:\n            return SIGQUIT;\n        case Signal::IllegalInstruction:\n            return SIGILL;\n        case Signal::Interrupt:\n            return SIGINT;\n        case Signal::Kill:\n            return SIGKILL;\n        case Signal::Terminate:\n            return SIGTERM;\n        case Signal::Stop:\n            return SIGSTOP;\n        case Signal::TTYStop:\n            return SIGTSTP;\n        default:\n            return 0;\n    }\n}\n\nint SignalHandler::numberToSignalPosition (int signo) {\n    switch (signo) {\n        case SIGHUP:\n            return 0;\n        case SIGABRT:\n            return 1;\n        case SIGQUIT:\n            return 2;\n        case SIGILL:\n            return 3;\n        case SIGINT:\n            return 4;\n        case SIGKILL:\n            return 5;\n        case SIGTERM:\n            return 6;\n        case SIGSTOP:\n            return 7;\n        case SIGTSTP:\n            return 8;\n        default:\n            return -1;\n    }\n}\n\nvoid SignalHandler::setCallback(int s, SignalCallback callback) {\n    \n    void (*c)(int) = owl_signal_handler;\n    if(callback == nullptr)\n        c = SIG_DFL;\n    \n    _lock.lock();\n    for (int i = 0; i < SignalHandler::NumberOfCallbacks; ++i) {\n        int no = 1 << i;\n        if(s & no) {\n            int signr = signalnumber(static_cast<Signal>(no));\n            if(signr > 0) {\n                _callbacks[i] = callback;\n                signal(signr, c);\n            }\n        }\n    }\n    _lock.unlock();\n}\n    \nstd::string SignalHandler::toString(Signal signal) {\n    switch(signal) {\n        case Signal::Hangup:\n            return \"Hangup\";\n        case Signal::Abort:\n            return \"Abort\";\n        case Signal::Quit:\n            return \"Quit\";\n        case Signal::IllegalInstruction:\n            return \"IllegalInstruction\";\n        case Signal::Interrupt:\n            return \"Interrupt\";\n        case Signal::Kill:\n            return \"Kill\";\n        case Signal::Terminate:\n            return \"Terminate\";\n        case Signal::Stop:\n            return \"Stop\";\n        case Signal::TTYStop:\n            return \"TTYStop\";\n        default:\n            return \"Unknown\";\n            break;\n    }\n}\n    \nstd::string SignalHandler::toString(int signal) {\n    switch(signal) {\n        case SIGHUP :\n            return toString(Signal::Hangup);\n        case SIGABRT  :\n            return toString(Signal::Abort);\n        case SIGQUIT  :\n            return toString(Signal::Quit);\n        case SIGILL :\n            return toString(Signal::IllegalInstruction);\n        case SIGINT :\n            return toString(Signal::Interrupt);\n        case SIGKILL  :\n            return toString(Signal::Kill);\n        case SIGTERM  :\n            return toString(Signal::Terminate);\n        case SIGSTOP  :\n            return toString(Signal::Stop);\n        case SIGTSTP :\n            return toString(Signal::TTYStop);\n        default:\n            return \"Unknown\";\n            break;\n    }\n}\n\nvoid SignalHandler::call(int signo) {\n    int callbackpos = numberToSignalPosition(signo);\n    if(callbackpos < 0)\n        return;\n    \n    _lock.lock();\n    \n        if(_callbacks[callbackpos] != nullptr)\n            _callbacks[callbackpos](static_cast<Signal>(1<<callbackpos));\n    \n    _lock.unlock();\n}\n\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n\nCopyright (c) 2007, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n    * Redistributions of source code must retain the above copyright\n      notice, this list of conditions and the following disclaimer.\n    * Redistributions in binary form must reproduce the above copyright\n      notice, this list of conditions and the following disclaimer in\n      the documentation and\/or other materials provided with the distribution.\n    * Neither the name of the author nor the names of its\n      contributors may be used to endorse or promote products derived\n      from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/pch.hpp\"\n\n#include \"libtorrent\/socks5_stream.hpp\"\n#include \"libtorrent\/assert.hpp\"\n\nnamespace libtorrent\n{\n\n\tvoid socks5_stream::name_lookup(asio::error_code const& e, tcp::resolver::iterator i\n\t\t, boost::shared_ptr<handler_type> h)\n\t{\n\t\tif (e || i == tcp::resolver::iterator())\n\t\t{\n\t\t\t(*h)(e);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\n\t\tm_sock.async_connect(i->endpoint(), boost::bind(\n\t\t\t&socks5_stream::connected, this, _1, h));\n\t}\n\n\tvoid socks5_stream::connected(asio::error_code const& e, boost::shared_ptr<handler_type> h)\n\t{\n\t\tif (e)\n\t\t{\n\t\t\t(*h)(e);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\n\t\tusing namespace libtorrent::detail;\n\t\t\/\/ send SOCKS5 authentication methods\n\t\tm_buffer.resize(m_user.empty()?3:4);\n\t\tchar* p = &m_buffer[0];\n\t\twrite_uint8(5, p); \/\/ SOCKS VERSION 5\n\t\tif (m_user.empty())\n\t\t{\n\t\t\twrite_uint8(1, p); \/\/ 1 authentication method (no auth)\n\t\t\twrite_uint8(0, p); \/\/ no authentication\n\t\t}\n\t\telse\n\t\t{\n\t\t\twrite_uint8(2, p); \/\/ 2 authentication methods\n\t\t\twrite_uint8(0, p); \/\/ no authentication\n\t\t\twrite_uint8(2, p); \/\/ username\/password\n\t\t}\n\t\tasio::async_write(m_sock, asio::buffer(m_buffer)\n\t\t\t, boost::bind(&socks5_stream::handshake1, this, _1, h));\n\t}\n\n\tvoid socks5_stream::handshake1(asio::error_code const& e, boost::shared_ptr<handler_type> h)\n\t{\n\t\tif (e)\n\t\t{\n\t\t\t(*h)(e);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\n\t\tm_buffer.resize(2);\n\t\tasio::async_read(m_sock, asio::buffer(m_buffer)\n\t\t\t, boost::bind(&socks5_stream::handshake2, this, _1, h));\n\t}\n\n\tvoid socks5_stream::handshake2(asio::error_code const& e, boost::shared_ptr<handler_type> h)\n\t{\n\t\tif (e)\n\t\t{\n\t\t\t(*h)(e);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\n\t\tusing namespace libtorrent::detail;\n\n\t\tchar* p = &m_buffer[0];\n\t\tint version = read_uint8(p);\n\t\tint method = read_uint8(p);\n\n\t\tif (version < 5)\n\t\t{\n\t\t\t(*h)(asio::error::operation_not_supported);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\n\t\tif (method == 0)\n\t\t{\n\t\t\tsocks_connect(h);\n\t\t}\n\t\telse if (method == 2)\n\t\t{\n\t\t\tif (m_user.empty())\n\t\t\t{\n\t\t\t\t(*h)(asio::error::operation_not_supported);\n\t\t\t\tasio::error_code ec;\n\t\t\t\tclose(ec);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t\/\/ start sub-negotiation\n\t\t\tm_buffer.resize(m_user.size() + m_password.size() + 3);\n\t\t\tchar* p = &m_buffer[0];\n\t\t\twrite_uint8(1, p);\n\t\t\twrite_uint8(m_user.size(), p);\n\t\t\twrite_string(m_user, p);\n\t\t\twrite_uint8(m_password.size(), p);\n\t\t\twrite_string(m_password, p);\n\t\t\tasio::async_write(m_sock, asio::buffer(m_buffer)\n\t\t\t\t, boost::bind(&socks5_stream::handshake3, this, _1, h));\n\t\t}\n\t\telse\n\t\t{\n\t\t\t(*h)(asio::error::operation_not_supported);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\t}\n\n\tvoid socks5_stream::handshake3(asio::error_code const& e\n\t\t, boost::shared_ptr<handler_type> h)\n\t{\n\t\tif (e)\n\t\t{\n\t\t\t(*h)(e);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\n\t\tm_buffer.resize(2);\n\t\tasio::async_read(m_sock, asio::buffer(m_buffer)\n\t\t\t, boost::bind(&socks5_stream::handshake4, this, _1, h));\n\t}\n\n\tvoid socks5_stream::handshake4(asio::error_code const& e\n\t\t, boost::shared_ptr<handler_type> h)\n\t{\n\t\tif (e)\n\t\t{\n\t\t\t(*h)(e);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\n\t\tusing namespace libtorrent::detail;\n\n\t\tchar* p = &m_buffer[0];\n\t\tint version = read_uint8(p);\n\t\tint status = read_uint8(p);\n\n\t\tif (version != 1)\n\t\t{\n\t\t\t(*h)(asio::error::operation_not_supported);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\n\t\tif (status != 0)\n\t\t{\n\t\t\t(*h)(asio::error::operation_not_supported);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\n\t\tstd::vector<char>().swap(m_buffer);\n\t\t(*h)(e);\t\n\t}\n\n\tvoid socks5_stream::socks_connect(boost::shared_ptr<handler_type> h)\n\t{\n\t\tusing namespace libtorrent::detail;\n\n\t\t\/\/ send SOCKS5 connect command\n\t\tm_buffer.resize(6 + (m_remote_endpoint.address().is_v4()?4:16));\n\t\tchar* p = &m_buffer[0];\n\t\twrite_uint8(5, p); \/\/ SOCKS VERSION 5\n\t\twrite_uint8(1, p); \/\/ CONNECT command\n\t\twrite_uint8(0, p); \/\/ reserved\n\t\twrite_uint8(m_remote_endpoint.address().is_v4()?1:4, p); \/\/ address type\n\t\twrite_address(m_remote_endpoint.address(), p);\n\t\twrite_uint16(m_remote_endpoint.port(), p);\n\t\tTORRENT_ASSERT(p - &m_buffer[0] == int(m_buffer.size()));\n\n\t\tasio::async_write(m_sock, asio::buffer(m_buffer)\n\t\t\t, boost::bind(&socks5_stream::connect1, this, _1, h));\n\t}\n\n\tvoid socks5_stream::connect1(asio::error_code const& e, boost::shared_ptr<handler_type> h)\n\t{\n\t\tif (e)\n\t\t{\n\t\t\t(*h)(e);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\n\t\tm_buffer.resize(6 + 4); \/\/ assume an IPv4 address\n\t\tasio::async_read(m_sock, asio::buffer(m_buffer)\n\t\t\t, boost::bind(&socks5_stream::connect2, this, _1, h));\n\t}\n\n\tvoid socks5_stream::connect2(asio::error_code const& e, boost::shared_ptr<handler_type> h)\n\t{\n\t\tif (e)\n\t\t{\n\t\t\t(*h)(e);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\n\t\tusing namespace libtorrent::detail;\n\n\t\t\/\/ send SOCKS5 connect command\n\t\tchar* p = &m_buffer[0];\n\t\tint version = read_uint8(p);\n\t\tif (version < 5)\n\t\t{\n\t\t\t(*h)(asio::error::operation_not_supported);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\t\tint response = read_uint8(p);\n\t\tif (response != 0)\n\t\t{\n\t\t\tasio::error_code e = asio::error::fault;\n\t\t\tswitch (response)\n\t\t\t{\n\t\t\t\tcase 1: e = asio::error::fault; break;\n\t\t\t\tcase 2: e = asio::error::no_permission; break;\n\t\t\t\tcase 3: e = asio::error::network_unreachable; break;\n\t\t\t\tcase 4: e = asio::error::host_unreachable; break;\n\t\t\t\tcase 5: e = asio::error::connection_refused; break;\n\t\t\t\tcase 6: e = asio::error::timed_out; break;\n\t\t\t\tcase 7: e = asio::error::operation_not_supported; break;\n\t\t\t\tcase 8: e = asio::error::address_family_not_supported; break;\n\t\t\t}\n\t\t\t(*h)(e);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\t\tp += 1; \/\/ reserved\n\t\tint atyp = read_uint8(p);\n\t\t\/\/ we ignore the proxy IP it was bound to\n\t\tif (atyp == 1)\n\t\t{\n\t\t\tstd::vector<char>().swap(m_buffer);\n\t\t\t(*h)(e);\n\t\t\treturn;\n\t\t}\n\t\tint skip_bytes = 0;\n\t\tif (atyp == 4)\n\t\t{\n\t\t\tskip_bytes = 12;\n\t\t}\n\t\telse if (atyp == 3)\n\t\t{\n\t\t\tskip_bytes = read_uint8(p) - 3;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t(*h)(asio::error::operation_not_supported);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\t\tm_buffer.resize(skip_bytes);\n\n\t\tasio::async_read(m_sock, asio::buffer(m_buffer)\n\t\t\t, boost::bind(&socks5_stream::connect3, this, _1, h));\n\t}\n\n\tvoid socks5_stream::connect3(asio::error_code const& e, boost::shared_ptr<handler_type> h)\n\t{\n\t\tif (e)\n\t\t{\n\t\t\t(*h)(e);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\n\t\tstd::vector<char>().swap(m_buffer);\n\t\t(*h)(e);\n\t}\n}\n\n<commit_msg>fixed bug in socks5 implementation when using user\/pass authentication<commit_after>\/*\n\nCopyright (c) 2007, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n    * Redistributions of source code must retain the above copyright\n      notice, this list of conditions and the following disclaimer.\n    * Redistributions in binary form must reproduce the above copyright\n      notice, this list of conditions and the following disclaimer in\n      the documentation and\/or other materials provided with the distribution.\n    * Neither the name of the author nor the names of its\n      contributors may be used to endorse or promote products derived\n      from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/pch.hpp\"\n\n#include \"libtorrent\/socks5_stream.hpp\"\n#include \"libtorrent\/assert.hpp\"\n\nnamespace libtorrent\n{\n\n\tvoid socks5_stream::name_lookup(asio::error_code const& e, tcp::resolver::iterator i\n\t\t, boost::shared_ptr<handler_type> h)\n\t{\n\t\tif (e || i == tcp::resolver::iterator())\n\t\t{\n\t\t\t(*h)(e);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\n\t\tm_sock.async_connect(i->endpoint(), boost::bind(\n\t\t\t&socks5_stream::connected, this, _1, h));\n\t}\n\n\tvoid socks5_stream::connected(asio::error_code const& e, boost::shared_ptr<handler_type> h)\n\t{\n\t\tif (e)\n\t\t{\n\t\t\t(*h)(e);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\n\t\tusing namespace libtorrent::detail;\n\t\t\/\/ send SOCKS5 authentication methods\n\t\tm_buffer.resize(m_user.empty()?3:4);\n\t\tchar* p = &m_buffer[0];\n\t\twrite_uint8(5, p); \/\/ SOCKS VERSION 5\n\t\tif (m_user.empty())\n\t\t{\n\t\t\twrite_uint8(1, p); \/\/ 1 authentication method (no auth)\n\t\t\twrite_uint8(0, p); \/\/ no authentication\n\t\t}\n\t\telse\n\t\t{\n\t\t\twrite_uint8(2, p); \/\/ 2 authentication methods\n\t\t\twrite_uint8(0, p); \/\/ no authentication\n\t\t\twrite_uint8(2, p); \/\/ username\/password\n\t\t}\n\t\tasio::async_write(m_sock, asio::buffer(m_buffer)\n\t\t\t, boost::bind(&socks5_stream::handshake1, this, _1, h));\n\t}\n\n\tvoid socks5_stream::handshake1(asio::error_code const& e, boost::shared_ptr<handler_type> h)\n\t{\n\t\tif (e)\n\t\t{\n\t\t\t(*h)(e);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\n\t\tm_buffer.resize(2);\n\t\tasio::async_read(m_sock, asio::buffer(m_buffer)\n\t\t\t, boost::bind(&socks5_stream::handshake2, this, _1, h));\n\t}\n\n\tvoid socks5_stream::handshake2(asio::error_code const& e, boost::shared_ptr<handler_type> h)\n\t{\n\t\tif (e)\n\t\t{\n\t\t\t(*h)(e);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\n\t\tusing namespace libtorrent::detail;\n\n\t\tchar* p = &m_buffer[0];\n\t\tint version = read_uint8(p);\n\t\tint method = read_uint8(p);\n\n\t\tif (version < 5)\n\t\t{\n\t\t\t(*h)(asio::error::operation_not_supported);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\n\t\tif (method == 0)\n\t\t{\n\t\t\tsocks_connect(h);\n\t\t}\n\t\telse if (method == 2)\n\t\t{\n\t\t\tif (m_user.empty())\n\t\t\t{\n\t\t\t\t(*h)(asio::error::operation_not_supported);\n\t\t\t\tasio::error_code ec;\n\t\t\t\tclose(ec);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t\/\/ start sub-negotiation\n\t\t\tm_buffer.resize(m_user.size() + m_password.size() + 3);\n\t\t\tchar* p = &m_buffer[0];\n\t\t\twrite_uint8(1, p);\n\t\t\twrite_uint8(m_user.size(), p);\n\t\t\twrite_string(m_user, p);\n\t\t\twrite_uint8(m_password.size(), p);\n\t\t\twrite_string(m_password, p);\n\t\t\tasio::async_write(m_sock, asio::buffer(m_buffer)\n\t\t\t\t, boost::bind(&socks5_stream::handshake3, this, _1, h));\n\t\t}\n\t\telse\n\t\t{\n\t\t\t(*h)(asio::error::operation_not_supported);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\t}\n\n\tvoid socks5_stream::handshake3(asio::error_code const& e\n\t\t, boost::shared_ptr<handler_type> h)\n\t{\n\t\tif (e)\n\t\t{\n\t\t\t(*h)(e);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\n\t\tm_buffer.resize(2);\n\t\tasio::async_read(m_sock, asio::buffer(m_buffer)\n\t\t\t, boost::bind(&socks5_stream::handshake4, this, _1, h));\n\t}\n\n\tvoid socks5_stream::handshake4(asio::error_code const& e\n\t\t, boost::shared_ptr<handler_type> h)\n\t{\n\t\tif (e)\n\t\t{\n\t\t\t(*h)(e);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\n\t\tusing namespace libtorrent::detail;\n\n\t\tchar* p = &m_buffer[0];\n\t\tint version = read_uint8(p);\n\t\tint status = read_uint8(p);\n\n\t\tif (version != 1)\n\t\t{\n\t\t\t(*h)(asio::error::operation_not_supported);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\n\t\tif (status != 0)\n\t\t{\n\t\t\t(*h)(asio::error::operation_not_supported);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\n\t\tstd::vector<char>().swap(m_buffer);\n\t\tsocks_connect(h);\n\t}\n\n\tvoid socks5_stream::socks_connect(boost::shared_ptr<handler_type> h)\n\t{\n\t\tusing namespace libtorrent::detail;\n\n\t\t\/\/ send SOCKS5 connect command\n\t\tm_buffer.resize(6 + (m_remote_endpoint.address().is_v4()?4:16));\n\t\tchar* p = &m_buffer[0];\n\t\twrite_uint8(5, p); \/\/ SOCKS VERSION 5\n\t\twrite_uint8(1, p); \/\/ CONNECT command\n\t\twrite_uint8(0, p); \/\/ reserved\n\t\twrite_uint8(m_remote_endpoint.address().is_v4()?1:4, p); \/\/ address type\n\t\twrite_address(m_remote_endpoint.address(), p);\n\t\twrite_uint16(m_remote_endpoint.port(), p);\n\t\tTORRENT_ASSERT(p - &m_buffer[0] == int(m_buffer.size()));\n\n\t\tasio::async_write(m_sock, asio::buffer(m_buffer)\n\t\t\t, boost::bind(&socks5_stream::connect1, this, _1, h));\n\t}\n\n\tvoid socks5_stream::connect1(asio::error_code const& e, boost::shared_ptr<handler_type> h)\n\t{\n\t\tif (e)\n\t\t{\n\t\t\t(*h)(e);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\n\t\tm_buffer.resize(6 + 4); \/\/ assume an IPv4 address\n\t\tasio::async_read(m_sock, asio::buffer(m_buffer)\n\t\t\t, boost::bind(&socks5_stream::connect2, this, _1, h));\n\t}\n\n\tvoid socks5_stream::connect2(asio::error_code const& e, boost::shared_ptr<handler_type> h)\n\t{\n\t\tif (e)\n\t\t{\n\t\t\t(*h)(e);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\n\t\tusing namespace libtorrent::detail;\n\n\t\t\/\/ send SOCKS5 connect command\n\t\tchar* p = &m_buffer[0];\n\t\tint version = read_uint8(p);\n\t\tif (version < 5)\n\t\t{\n\t\t\t(*h)(asio::error::operation_not_supported);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\t\tint response = read_uint8(p);\n\t\tif (response != 0)\n\t\t{\n\t\t\tasio::error_code e = asio::error::fault;\n\t\t\tswitch (response)\n\t\t\t{\n\t\t\t\tcase 1: e = asio::error::fault; break;\n\t\t\t\tcase 2: e = asio::error::no_permission; break;\n\t\t\t\tcase 3: e = asio::error::network_unreachable; break;\n\t\t\t\tcase 4: e = asio::error::host_unreachable; break;\n\t\t\t\tcase 5: e = asio::error::connection_refused; break;\n\t\t\t\tcase 6: e = asio::error::timed_out; break;\n\t\t\t\tcase 7: e = asio::error::operation_not_supported; break;\n\t\t\t\tcase 8: e = asio::error::address_family_not_supported; break;\n\t\t\t}\n\t\t\t(*h)(e);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\t\tp += 1; \/\/ reserved\n\t\tint atyp = read_uint8(p);\n\t\t\/\/ we ignore the proxy IP it was bound to\n\t\tif (atyp == 1)\n\t\t{\n\t\t\tstd::vector<char>().swap(m_buffer);\n\t\t\t(*h)(e);\n\t\t\treturn;\n\t\t}\n\t\tint skip_bytes = 0;\n\t\tif (atyp == 4)\n\t\t{\n\t\t\tskip_bytes = 12;\n\t\t}\n\t\telse if (atyp == 3)\n\t\t{\n\t\t\tskip_bytes = read_uint8(p) - 3;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t(*h)(asio::error::operation_not_supported);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\t\tm_buffer.resize(skip_bytes);\n\n\t\tasio::async_read(m_sock, asio::buffer(m_buffer)\n\t\t\t, boost::bind(&socks5_stream::connect3, this, _1, h));\n\t}\n\n\tvoid socks5_stream::connect3(asio::error_code const& e, boost::shared_ptr<handler_type> h)\n\t{\n\t\tif (e)\n\t\t{\n\t\t\t(*h)(e);\n\t\t\tasio::error_code ec;\n\t\t\tclose(ec);\n\t\t\treturn;\n\t\t}\n\n\t\tstd::vector<char>().swap(m_buffer);\n\t\t(*h)(e);\n\t}\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"ros\/ros.h\"\n#include \"std_msgs\/String.h\"\n#include \"std_msgs\/Int32.h\"\n\nvoid CvDrive(const std_msgs::Int32 msg)\n{\n  ROS_INFO(\"I heard: %d\", msg.data);\n}\n\nint main(int argc, char **argv)\n{\n\n  ros::init(argc, argv, \"listener\");\n\n  ros::NodeHandle n;\n\n  ros::Subscriber sub = n.subscribe(\"camdata\", 1000, CvDrive);\n\n  ros::spin();\n\n  return 0;\n}\n<commit_msg>Delete driving.cpp<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/-----------------------------------------------------------------------------\n\/\/ Jikken - 3D Abstract High Performance Graphics API\n\/\/ Copyright(c) 2017 Jeff Hutchinson\n\/\/ Copyright(c) 2017 Tim Barnes\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 <cassert>\n#include <cstdlib>\n#include \"vulkan\/VulkanGraphicsDevice.hpp\"\n#include \"vulkan\/VulkanUtil.hpp\"\n\/\/just temp\n#include <GLFW\/glfw3.h>\n\nnamespace Jikken\n{\n\tVulkanGraphicsDevice::VulkanGraphicsDevice() :\n\t\tmInstance(VK_NULL_HANDLE),\n\t\tmSurface(VK_NULL_HANDLE),\n\t\tmPhysicalDevice(VK_NULL_HANDLE),\n\t\tmDevice(VK_NULL_HANDLE),\n\t\tmGraphicsQueue(VK_NULL_HANDLE),\n\t\tmGraphicsQueueIndex(UINT32_MAX),\n\t\tmDebugCallback(VK_NULL_HANDLE),\n\t\tmAllocCallback(nullptr)\n\t{\n\t}\n\n\tVulkanGraphicsDevice::~VulkanGraphicsDevice()\n\t{\n\t\t\/\/wait for device to be idle\n\t\tif (mDevice)\n\t\t\tvkDeviceWaitIdle(mDevice);\n\n\t\t\/\/ cleanup other stuff\n\n\t\t\/\/ destroy logical device\n\t\tif (mDevice)\n\t\t\tvkDestroyDevice(mDevice, mAllocCallback);\n\n\t\tif (mSurface)\n\t\t\tvkDestroySurfaceKHR(mInstance, mSurface, mAllocCallback);\n\n\t\tif (mDebugCallback)\n\t\t{\n\t\t\tauto debugReportDestroyFunc = (PFN_vkDestroyDebugReportCallbackEXT)vkGetInstanceProcAddr(mInstance, \"vkDestroyDebugReportCallbackEXT\");\n\t\t\tif (debugReportDestroyFunc != nullptr)\n\t\t\t{\n\t\t\t\tdebugReportDestroyFunc(mInstance, mDebugCallback, mAllocCallback);\n\t\t\t}\n\t\t}\n\n\t\tif (mInstance)\n\t\t\tvkDestroyInstance(mInstance, mAllocCallback);\n\t}\n\n\tbool VulkanGraphicsDevice::init(void *glfwWinHandle)\n\t{\n\t\tif (!glfwVulkanSupported())\n\t\t{\n\t\t\tstd::printf(\"Vulkan is not supported\\n\");\n\t\t\/\/\treturn false;\n\t\t}\n\n\t\t\/\/validation layers\n\t#ifdef _DEBUG\n\t\tbool validationLayersEnabled = true;\n\t#else\n\t\tbool validationLayersEnabled = false\n\t#endif\n\n\t\t\/\/grab vulkan instance extension list\n\t\tuint32_t extensionsCount = 0;\n\t\tVkResult result = vkEnumerateInstanceExtensionProperties(nullptr, &extensionsCount, nullptr);\n\t\tif (result != VK_SUCCESS || extensionsCount == 0)\n\t\t{\n\t\t\tstd::printf(\"vkEnumerateInstanceExtensionProperties failed\\n\");\n\t\t\treturn false;\n\t\t}\n\n\t\tstd::vector<VkExtensionProperties> instanceExtensionList(extensionsCount);\n\t\tresult = vkEnumerateInstanceExtensionProperties(nullptr, &extensionsCount, instanceExtensionList.data());\n\n\t\tif (result != VK_SUCCESS)\n\t\t{\n\t\t\tstd::printf(\"vkEnumerateInstanceExtensionProperties failed\\n\");\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/get required extensions from glfw\n\t\tuint32_t glfwExtCount = 0;\n\t\tconst char** glfwExtensions = glfwGetRequiredInstanceExtensions(&glfwExtCount);\n\t\tif (glfwExtCount == 0)\n\t\t{\n\t\t\tstd::printf(\"Failed to find any required extensions\\n\");\n\t\t\treturn false;\n\t\t}\n\n\t\tstd::vector<const char*> requiredExtensions(glfwExtensions, glfwExtensions + glfwExtCount);\n\n\t\tif (validationLayersEnabled)\n\t\t\trequiredExtensions.push_back(VK_EXT_DEBUG_REPORT_EXTENSION_NAME);\n\n\t\t\/\/ check required extension list against all availble extensions\n\t\tfor (const auto &ext : requiredExtensions)\n\t\t{\n\t\t\tif (!vkutils::checkExtension(ext, instanceExtensionList))\n\t\t\t{\n\t\t\t\tstd::printf(\"Required extension: %s not found\\n\", ext);\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\t\/\/setup validation layers - just VK_LAYER_LUNARG_standard_validation for now. There are plenty more though ;)\n\t\tconst std::vector<const char*> validationLayers = { \"VK_LAYER_LUNARG_standard_validation\" };\n\n\t\tuint32_t layerCount = 0;\n\n\t\tif (validationLayersEnabled)\n\t\t{\n\t\t\tvkEnumerateInstanceLayerProperties(&layerCount, nullptr);\n\t\t\tstd::vector<VkLayerProperties> availableLayers(layerCount);\n\t\t\tvkEnumerateInstanceLayerProperties(&layerCount, availableLayers.data());\n\n\t\t\tfor (const auto &layer : validationLayers)\n\t\t\t{\n\t\t\t\t\/\/this is not fatal so just disable validation layers if it is not found\n\t\t\t\tif (!vkutils::checkLayer(layer, availableLayers))\n\t\t\t\t{\n\t\t\t\t\tstd::printf(\"Could not find validation layer: %s Disabling validation layers\\n\", layer);\n\t\t\t\t\tvalidationLayersEnabled = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t\/\/setup application and instance info\n\t\tVkApplicationInfo appInfo = {};\n\t\tappInfo.sType = VK_STRUCTURE_TYPE_APPLICATION_INFO;\n\t\tappInfo.pApplicationName = \"Jikken\";\n\t\tappInfo.applicationVersion = VK_MAKE_VERSION(1, 0, 0);\n\t\tappInfo.pEngineName = \"Jikken\";\n\t\tappInfo.engineVersion = VK_MAKE_VERSION(1, 0, 0);\n\t\tappInfo.apiVersion = VK_API_VERSION_1_0;\n\n\t\tVkInstanceCreateInfo createInfo = {};\n\t\tcreateInfo.sType = VK_STRUCTURE_TYPE_INSTANCE_CREATE_INFO;\n\t\tcreateInfo.flags = 0;\n\t\tcreateInfo.pApplicationInfo = &appInfo;\n\t\tcreateInfo.enabledExtensionCount = static_cast<uint32_t>(requiredExtensions.size());\n\t\tcreateInfo.ppEnabledExtensionNames = requiredExtensions.data();\n\t\tif (validationLayersEnabled)\n\t\t{\n\t\t\tcreateInfo.enabledLayerCount = static_cast<uint32_t>(validationLayers.size());\n\t\t\tcreateInfo.ppEnabledLayerNames = validationLayers.data();\n\t\t}\n\t\telse\n\t\t\tcreateInfo.enabledLayerCount = 0;\n\n\t\t\/\/finally create vulkan instance\n\t\tresult = vkCreateInstance(&createInfo, mAllocCallback, &mInstance);\n\n\t\tif (result != VK_SUCCESS)\n\t\t{\n\t\t\tstd::printf(\"vkCreateInstance failed\\n\");\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/setup debug callback if validation layers enabled\n\t\tif (validationLayersEnabled)\n\t\t{\n\t\t\tVkDebugReportCallbackCreateInfoEXT debugCreateInfo = {};\n\t\t\tdebugCreateInfo.sType = VK_STRUCTURE_TYPE_DEBUG_REPORT_CALLBACK_CREATE_INFO_EXT;\n\t\t\tdebugCreateInfo.flags = VK_DEBUG_REPORT_ERROR_BIT_EXT | VK_DEBUG_REPORT_WARNING_BIT_EXT | VK_DEBUG_REPORT_PERFORMANCE_WARNING_BIT_EXT;\n\t\t\tdebugCreateInfo.pfnCallback = vkutils::debugCallback;\n\n\t\t\tauto debugReportFunc = (PFN_vkCreateDebugReportCallbackEXT)vkGetInstanceProcAddr(mInstance, \"vkCreateDebugReportCallbackEXT\");\n\t\t\tif (debugReportFunc != nullptr)\n\t\t\t{\n\t\t\t\tresult = debugReportFunc(mInstance, &debugCreateInfo, mAllocCallback, &mDebugCallback);\n\n\t\t\t\tif (result != VK_SUCCESS)\n\t\t\t\t{\n\t\t\t\t\tstd::printf(\"vkCreateDebugReportCallbackEXT failed\\n\");\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\tstd::printf(\"Failed to retrieve vkCreateDebugReportCallbackEXT address. Debug callbacks will be disabled\\n\");\n\t\t\t\tvalidationLayersEnabled = false;\n\t\t\t}\n\t\t}\n\n\t\t\/\/create window surface\n\t\tresult = glfwCreateWindowSurface(mInstance, static_cast<GLFWwindow*>(glfwWinHandle), mAllocCallback, &mSurface);\n\t\tif (result != VK_SUCCESS)\n\t\t{\n\t\t\tstd::printf(\"Failed to create vulkan window surface\\n\");\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/find physical devices\n\t\tuint32_t numDevices = 0;\n\t\tresult = vkEnumeratePhysicalDevices(mInstance, &numDevices, nullptr);\n\t\tif (result != VK_SUCCESS || numDevices == 0)\n\t\t{\n\t\t\tstd::printf(\"vkEnumeratePhysicalDevices failed\\n\");\n\t\t\treturn false;\n\t\t}\n\n\t\tstd::vector<VkPhysicalDevice> physicalDevices(numDevices);\n\t\tresult = vkEnumeratePhysicalDevices(mInstance, &numDevices, physicalDevices.data());\n\t\tif (result != VK_SUCCESS)\n\t\t{\n\t\t\tstd::printf(\"vkEnumeratePhysicalDevices failed\\n\");\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/get our queue index and hopefully find an acceptable device\n\t\tfor (const auto &device : physicalDevices)\n\t\t{\n\t\t\t\/\/break on first acceptable device\n\t\t\tif (vkutils::checkPhysicalDevice(device, mSurface, mGraphicsQueueIndex))\n\t\t\t{\n\t\t\t\tmPhysicalDevice = device;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif (mGraphicsQueueIndex == UINT32_MAX)\n\t\t{\n\t\t\tstd::printf(\"Failed to find suitable graphics queue\\n\");\n\t\t\treturn false;\n\t\t}\n\n\t\tif (mPhysicalDevice == VK_NULL_HANDLE)\n\t\t{\n\t\t\tstd::printf(\"Failed to select a physical device\\n\");\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/print some information about our physical device\n\t\tvkutils::printDeviceInfo(mPhysicalDevice);\n\n\t\t\/\/create logical device\n\t\tstd::vector<VkDeviceQueueCreateInfo> queueCreateInfos;\n\t\tfloat queuePriority = 1.0f;\n\t\tVkDeviceQueueCreateInfo queueCreateInfo = {};\n\t\tqueueCreateInfo.sType = VK_STRUCTURE_TYPE_DEVICE_QUEUE_CREATE_INFO;\n\t\tqueueCreateInfo.flags = 0;\n\t\tqueueCreateInfo.queueFamilyIndex = mGraphicsQueueIndex;\n\t\tqueueCreateInfo.queueCount = 1;\n\t\tqueueCreateInfo.pQueuePriorities = &queuePriority;\n\t\tqueueCreateInfos.push_back(queueCreateInfo);\n\n\t\t\/\/need swap chain extension - this extension is already checked above with checkPhysicalDevice, no need to check again\n\t\tstd::vector<const char*> requiredDeviceExtensions = { VK_KHR_SWAPCHAIN_EXTENSION_NAME };\n\n\t\tVkDeviceCreateInfo deviceCreateInfo = {};\n\t\tdeviceCreateInfo.sType = VK_STRUCTURE_TYPE_DEVICE_CREATE_INFO;\n\t\tdeviceCreateInfo.flags = 0;\n\t\tdeviceCreateInfo.enabledExtensionCount = static_cast<uint32_t>(requiredDeviceExtensions.size());\n\t\tdeviceCreateInfo.ppEnabledExtensionNames = requiredDeviceExtensions.data();\n\t\tdeviceCreateInfo.queueCreateInfoCount = 1;\n\t\tdeviceCreateInfo.pQueueCreateInfos = queueCreateInfos.data();\n\t\tdeviceCreateInfo.queueCreateInfoCount = static_cast<uint32_t>(queueCreateInfos.size());\n\n\t\tdeviceCreateInfo.enabledLayerCount = 0;\n\t\tif (validationLayersEnabled)\n\t\t{\n\t\t\tdeviceCreateInfo.enabledLayerCount = static_cast<uint32_t>(validationLayers.size());\n\t\t\tdeviceCreateInfo.ppEnabledLayerNames = validationLayers.data();\n\t\t}\n\n\t\t\/\/create vulkan device\n\t\t\/\/todo: for some reason this is creating vkCreateSampler errors here, find out why because we are not calling that function.\n\t\t\/\/happens on both intel\/nv drivers and also happens with lunarg demo, possible lunarg debug layer bug??\n\t\tresult = vkCreateDevice(mPhysicalDevice, &deviceCreateInfo, mAllocCallback, &mDevice);\n\t\tif (result != VK_SUCCESS)\n\t\t{\n\t\t\tstd::printf(\"vkCreateDevice failed\\n\");\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/grab graphics queue handle\n\t\tvkGetDeviceQueue(mDevice, mGraphicsQueueIndex, 0, &mGraphicsQueue);\n\n\t\tif (!mGraphicsQueue)\n\t\t{\n\t\t\tstd::printf(\"Failed to retrieve graphics queue\\n\");\n\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tShaderHandle VulkanGraphicsDevice::createShader(const std::vector<ShaderDetails> &shaders)\n\t{\n\t\treturn InvalidHandle;\n\t}\n\n\tBufferHandle VulkanGraphicsDevice::createBuffer(BufferType type, BufferUsageHint hint, size_t dataSize, float *data)\n\t{\n\t\treturn InvalidHandle;\n\t}\n\n\tLayoutHandle VulkanGraphicsDevice::createVertexInputLayout(const std::vector<VertexInputLayout> &attributes)\n\t{\n\t\treturn InvalidHandle;\n\t}\n\n\tVertexArrayHandle VulkanGraphicsDevice::createVAO(LayoutHandle layout, BufferHandle vertexBuffer, BufferHandle indexBuffer)\n\t{\n\t\treturn InvalidHandle;\n\t}\n\n\tvoid VulkanGraphicsDevice::bindConstantBuffer(ShaderHandle shader, BufferHandle cBuffer, int32_t index)\n\t{\n\t}\n\n\tvoid VulkanGraphicsDevice::deleteVertexInputLayout(LayoutHandle handle)\n\t{\n\t}\n\n\tvoid VulkanGraphicsDevice::deleteVAO(VertexArrayHandle handle)\n\t{\n\t}\n\n\tvoid VulkanGraphicsDevice::deleteBuffer(BufferHandle handle)\n\t{\n\t}\n\n\tvoid VulkanGraphicsDevice::deleteShader(ShaderHandle handle)\n\t{\n\t}\n\n\tvoid VulkanGraphicsDevice::submitCommandQueue(CommandQueue *cmdQueue)\n\t{\n\t}\n\n\tvoid VulkanGraphicsDevice::present()\n\t{\n\t}\n}<commit_msg>validation layer update<commit_after>\/\/-----------------------------------------------------------------------------\n\/\/ Jikken - 3D Abstract High Performance Graphics API\n\/\/ Copyright(c) 2017 Jeff Hutchinson\n\/\/ Copyright(c) 2017 Tim Barnes\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 <cassert>\n#include <cstdlib>\n#include \"vulkan\/VulkanGraphicsDevice.hpp\"\n#include \"vulkan\/VulkanUtil.hpp\"\n\/\/just temp\n#include <GLFW\/glfw3.h>\n\nnamespace Jikken\n{\n\tVulkanGraphicsDevice::VulkanGraphicsDevice() :\n\t\tmInstance(VK_NULL_HANDLE),\n\t\tmSurface(VK_NULL_HANDLE),\n\t\tmPhysicalDevice(VK_NULL_HANDLE),\n\t\tmDevice(VK_NULL_HANDLE),\n\t\tmGraphicsQueue(VK_NULL_HANDLE),\n\t\tmGraphicsQueueIndex(UINT32_MAX),\n\t\tmDebugCallback(VK_NULL_HANDLE),\n\t\tmAllocCallback(nullptr)\n\t{\n\t}\n\n\tVulkanGraphicsDevice::~VulkanGraphicsDevice()\n\t{\n\t\t\/\/wait for device to be idle\n\t\tif (mDevice)\n\t\t\tvkDeviceWaitIdle(mDevice);\n\n\t\t\/\/ cleanup other stuff\n\n\t\t\/\/ destroy logical device\n\t\tif (mDevice)\n\t\t\tvkDestroyDevice(mDevice, mAllocCallback);\n\n\t\tif (mSurface)\n\t\t\tvkDestroySurfaceKHR(mInstance, mSurface, mAllocCallback);\n\n\t\tif (mDebugCallback)\n\t\t{\n\t\t\tauto debugReportDestroyFunc = (PFN_vkDestroyDebugReportCallbackEXT)vkGetInstanceProcAddr(mInstance, \"vkDestroyDebugReportCallbackEXT\");\n\t\t\tif (debugReportDestroyFunc != nullptr)\n\t\t\t{\n\t\t\t\tdebugReportDestroyFunc(mInstance, mDebugCallback, mAllocCallback);\n\t\t\t}\n\t\t}\n\n\t\tif (mInstance)\n\t\t\tvkDestroyInstance(mInstance, mAllocCallback);\n\t}\n\n\tbool VulkanGraphicsDevice::init(void *glfwWinHandle)\n\t{\n\t\tif (!glfwVulkanSupported())\n\t\t{\n\t\t\tstd::printf(\"Vulkan is not supported\\n\");\n\t\t\/\/\treturn false;\n\t\t}\n\n\t\t\/\/validation layers\n\t#ifdef _DEBUG\n\t\tbool validationLayersEnabled = true;\n\t#else\n\t\tbool validationLayersEnabled = false\n\t#endif\n\n\t\t\/\/grab vulkan instance extension list\n\t\tuint32_t extensionsCount = 0;\n\t\tVkResult result = vkEnumerateInstanceExtensionProperties(nullptr, &extensionsCount, nullptr);\n\t\tif (result != VK_SUCCESS || extensionsCount == 0)\n\t\t{\n\t\t\tstd::printf(\"vkEnumerateInstanceExtensionProperties failed\\n\");\n\t\t\treturn false;\n\t\t}\n\n\t\tstd::vector<VkExtensionProperties> instanceExtensionList(extensionsCount);\n\t\tresult = vkEnumerateInstanceExtensionProperties(nullptr, &extensionsCount, instanceExtensionList.data());\n\n\t\tif (result != VK_SUCCESS)\n\t\t{\n\t\t\tstd::printf(\"vkEnumerateInstanceExtensionProperties failed\\n\");\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/get required extensions from glfw\n\t\tuint32_t glfwExtCount = 0;\n\t\tconst char** glfwExtensions = glfwGetRequiredInstanceExtensions(&glfwExtCount);\n\t\tif (glfwExtCount == 0)\n\t\t{\n\t\t\tstd::printf(\"Failed to find any required extensions\\n\");\n\t\t\treturn false;\n\t\t}\n\n\t\tstd::vector<const char*> requiredExtensions(glfwExtensions, glfwExtensions + glfwExtCount);\n\n\t\tif (validationLayersEnabled)\n\t\t\trequiredExtensions.push_back(VK_EXT_DEBUG_REPORT_EXTENSION_NAME);\n\n\t\t\/\/ check required extension list against all availble extensions\n\t\tfor (const auto &ext : requiredExtensions)\n\t\t{\n\t\t\tif (!vkutils::checkExtension(ext, instanceExtensionList))\n\t\t\t{\n\t\t\t\tstd::printf(\"Required extension: %s not found\\n\", ext);\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\t\/\/setup validation layers - VK_LAYER_LUNARG_standard_validation enables:\n\t\t\/\/VK_LAYER_GOOGLE_threading, VK_LAYER_LUNARG_parameter_validation, VK_LAYER_LUNARG_object_tracker, VK_LAYER_LUNARG_image, VK_LAYER_LUNARG_core_validation,VK_LAYER_LUNARG_swapchain, and VK_LAYER_GOOGLE_unique_objects\n\t\tconst std::vector<const char*> validationLayers = { \"VK_LAYER_LUNARG_standard_validation\" };\n\n\t\tuint32_t layerCount = 0;\n\n\t\tif (validationLayersEnabled)\n\t\t{\n\t\t\tvkEnumerateInstanceLayerProperties(&layerCount, nullptr);\n\t\t\tstd::vector<VkLayerProperties> availableLayers(layerCount);\n\t\t\tvkEnumerateInstanceLayerProperties(&layerCount, availableLayers.data());\n\n\t\t\tfor (const auto &layer : validationLayers)\n\t\t\t{\n\t\t\t\t\/\/this is not fatal so just disable validation layers if it is not found\n\t\t\t\tif (!vkutils::checkLayer(layer, availableLayers))\n\t\t\t\t{\n\t\t\t\t\tstd::printf(\"Could not find validation layer: %s Disabling validation layers\\n\", layer);\n\t\t\t\t\tvalidationLayersEnabled = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t\/\/setup application and instance info\n\t\tVkApplicationInfo appInfo = {};\n\t\tappInfo.sType = VK_STRUCTURE_TYPE_APPLICATION_INFO;\n\t\tappInfo.pApplicationName = \"Jikken\";\n\t\tappInfo.applicationVersion = VK_MAKE_VERSION(1, 0, 0);\n\t\tappInfo.pEngineName = \"Jikken\";\n\t\tappInfo.engineVersion = VK_MAKE_VERSION(1, 0, 0);\n\t\tappInfo.apiVersion = VK_API_VERSION_1_0;\n\n\t\tVkInstanceCreateInfo createInfo = {};\n\t\tcreateInfo.sType = VK_STRUCTURE_TYPE_INSTANCE_CREATE_INFO;\n\t\tcreateInfo.flags = 0;\n\t\tcreateInfo.pApplicationInfo = &appInfo;\n\t\tcreateInfo.enabledExtensionCount = static_cast<uint32_t>(requiredExtensions.size());\n\t\tcreateInfo.ppEnabledExtensionNames = requiredExtensions.data();\n\t\tif (validationLayersEnabled)\n\t\t{\n\t\t\tcreateInfo.enabledLayerCount = static_cast<uint32_t>(validationLayers.size());\n\t\t\tcreateInfo.ppEnabledLayerNames = validationLayers.data();\n\t\t}\n\t\telse\n\t\t\tcreateInfo.enabledLayerCount = 0;\n\n\t\t\/\/finally create vulkan instance\n\t\tresult = vkCreateInstance(&createInfo, mAllocCallback, &mInstance);\n\n\t\tif (result != VK_SUCCESS)\n\t\t{\n\t\t\tstd::printf(\"vkCreateInstance failed\\n\");\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/setup debug callback if validation layers enabled\n\t\tif (validationLayersEnabled)\n\t\t{\n\t\t\tVkDebugReportCallbackCreateInfoEXT debugCreateInfo = {};\n\t\t\tdebugCreateInfo.sType = VK_STRUCTURE_TYPE_DEBUG_REPORT_CALLBACK_CREATE_INFO_EXT;\n\t\t\tdebugCreateInfo.flags = VK_DEBUG_REPORT_ERROR_BIT_EXT | VK_DEBUG_REPORT_WARNING_BIT_EXT | VK_DEBUG_REPORT_PERFORMANCE_WARNING_BIT_EXT;\n\t\t\tdebugCreateInfo.pfnCallback = vkutils::debugCallback;\n\n\t\t\tauto debugReportFunc = (PFN_vkCreateDebugReportCallbackEXT)vkGetInstanceProcAddr(mInstance, \"vkCreateDebugReportCallbackEXT\");\n\t\t\tif (debugReportFunc != nullptr)\n\t\t\t{\n\t\t\t\tresult = debugReportFunc(mInstance, &debugCreateInfo, mAllocCallback, &mDebugCallback);\n\n\t\t\t\tif (result != VK_SUCCESS)\n\t\t\t\t{\n\t\t\t\t\tstd::printf(\"vkCreateDebugReportCallbackEXT failed\\n\");\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\tstd::printf(\"Failed to retrieve vkCreateDebugReportCallbackEXT address. Debug callbacks will be disabled\\n\");\n\t\t\t\tvalidationLayersEnabled = false;\n\t\t\t}\n\t\t}\n\n\t\t\/\/create window surface\n\t\tresult = glfwCreateWindowSurface(mInstance, static_cast<GLFWwindow*>(glfwWinHandle), mAllocCallback, &mSurface);\n\t\tif (result != VK_SUCCESS)\n\t\t{\n\t\t\tstd::printf(\"Failed to create vulkan window surface\\n\");\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/find physical devices\n\t\tuint32_t numDevices = 0;\n\t\tresult = vkEnumeratePhysicalDevices(mInstance, &numDevices, nullptr);\n\t\tif (result != VK_SUCCESS || numDevices == 0)\n\t\t{\n\t\t\tstd::printf(\"vkEnumeratePhysicalDevices failed\\n\");\n\t\t\treturn false;\n\t\t}\n\n\t\tstd::vector<VkPhysicalDevice> physicalDevices(numDevices);\n\t\tresult = vkEnumeratePhysicalDevices(mInstance, &numDevices, physicalDevices.data());\n\t\tif (result != VK_SUCCESS)\n\t\t{\n\t\t\tstd::printf(\"vkEnumeratePhysicalDevices failed\\n\");\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/get our queue index and hopefully find an acceptable device\n\t\tfor (const auto &device : physicalDevices)\n\t\t{\n\t\t\t\/\/break on first acceptable device\n\t\t\tif (vkutils::checkPhysicalDevice(device, mSurface, mGraphicsQueueIndex))\n\t\t\t{\n\t\t\t\tmPhysicalDevice = device;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif (mGraphicsQueueIndex == UINT32_MAX)\n\t\t{\n\t\t\tstd::printf(\"Failed to find suitable graphics queue\\n\");\n\t\t\treturn false;\n\t\t}\n\n\t\tif (mPhysicalDevice == VK_NULL_HANDLE)\n\t\t{\n\t\t\tstd::printf(\"Failed to select a physical device\\n\");\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/print some information about our physical device\n\t\tvkutils::printDeviceInfo(mPhysicalDevice);\n\n\t\t\/\/create logical device\n\t\tstd::vector<VkDeviceQueueCreateInfo> queueCreateInfos;\n\t\tfloat queuePriority = 1.0f;\n\t\tVkDeviceQueueCreateInfo queueCreateInfo = {};\n\t\tqueueCreateInfo.sType = VK_STRUCTURE_TYPE_DEVICE_QUEUE_CREATE_INFO;\n\t\tqueueCreateInfo.flags = 0;\n\t\tqueueCreateInfo.queueFamilyIndex = mGraphicsQueueIndex;\n\t\tqueueCreateInfo.queueCount = 1;\n\t\tqueueCreateInfo.pQueuePriorities = &queuePriority;\n\t\tqueueCreateInfos.push_back(queueCreateInfo);\n\n\t\t\/\/need swap chain extension - this extension is already checked above with checkPhysicalDevice, no need to check again\n\t\tstd::vector<const char*> requiredDeviceExtensions = { VK_KHR_SWAPCHAIN_EXTENSION_NAME };\n\n\t\tVkDeviceCreateInfo deviceCreateInfo = {};\n\t\tdeviceCreateInfo.sType = VK_STRUCTURE_TYPE_DEVICE_CREATE_INFO;\n\t\tdeviceCreateInfo.flags = 0;\n\t\tdeviceCreateInfo.enabledExtensionCount = static_cast<uint32_t>(requiredDeviceExtensions.size());\n\t\tdeviceCreateInfo.ppEnabledExtensionNames = requiredDeviceExtensions.data();\n\t\tdeviceCreateInfo.queueCreateInfoCount = 1;\n\t\tdeviceCreateInfo.pQueueCreateInfos = queueCreateInfos.data();\n\t\tdeviceCreateInfo.queueCreateInfoCount = static_cast<uint32_t>(queueCreateInfos.size());\n\n\t\tdeviceCreateInfo.enabledLayerCount = 0;\n\t\tif (validationLayersEnabled)\n\t\t{\n\t\t\tdeviceCreateInfo.enabledLayerCount = static_cast<uint32_t>(validationLayers.size());\n\t\t\tdeviceCreateInfo.ppEnabledLayerNames = validationLayers.data();\n\t\t}\n\n\t\t\/\/create vulkan device\n\t\t\/\/todo: for some reason this is creating vkCreateSampler errors here, find out why because we are not calling that function.\n\t\t\/\/happens on both intel\/nv drivers and also happens with lunarg demo, possible lunarg debug layer bug??\n\t\tresult = vkCreateDevice(mPhysicalDevice, &deviceCreateInfo, mAllocCallback, &mDevice);\n\t\tif (result != VK_SUCCESS)\n\t\t{\n\t\t\tstd::printf(\"vkCreateDevice failed\\n\");\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/grab graphics queue handle\n\t\tvkGetDeviceQueue(mDevice, mGraphicsQueueIndex, 0, &mGraphicsQueue);\n\n\t\tif (!mGraphicsQueue)\n\t\t{\n\t\t\tstd::printf(\"Failed to retrieve graphics queue\\n\");\n\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tShaderHandle VulkanGraphicsDevice::createShader(const std::vector<ShaderDetails> &shaders)\n\t{\n\t\treturn InvalidHandle;\n\t}\n\n\tBufferHandle VulkanGraphicsDevice::createBuffer(BufferType type, BufferUsageHint hint, size_t dataSize, float *data)\n\t{\n\t\treturn InvalidHandle;\n\t}\n\n\tLayoutHandle VulkanGraphicsDevice::createVertexInputLayout(const std::vector<VertexInputLayout> &attributes)\n\t{\n\t\treturn InvalidHandle;\n\t}\n\n\tVertexArrayHandle VulkanGraphicsDevice::createVAO(LayoutHandle layout, BufferHandle vertexBuffer, BufferHandle indexBuffer)\n\t{\n\t\treturn InvalidHandle;\n\t}\n\n\tvoid VulkanGraphicsDevice::bindConstantBuffer(ShaderHandle shader, BufferHandle cBuffer, int32_t index)\n\t{\n\t}\n\n\tvoid VulkanGraphicsDevice::deleteVertexInputLayout(LayoutHandle handle)\n\t{\n\t}\n\n\tvoid VulkanGraphicsDevice::deleteVAO(VertexArrayHandle handle)\n\t{\n\t}\n\n\tvoid VulkanGraphicsDevice::deleteBuffer(BufferHandle handle)\n\t{\n\t}\n\n\tvoid VulkanGraphicsDevice::deleteShader(ShaderHandle handle)\n\t{\n\t}\n\n\tvoid VulkanGraphicsDevice::submitCommandQueue(CommandQueue *cmdQueue)\n\t{\n\t}\n\n\tvoid VulkanGraphicsDevice::present()\n\t{\n\t}\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 *\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#define BOOST_TEST_MODULE big_decimal\n\n#include <boost\/test\/unit_test.hpp>\n#include \"utils\/big_decimal.hh\"\n\nnamespace {\n\nvoid test_div(const char *r_cstr, const int64_t q, const char *expected_cstr) {\n    big_decimal r{r_cstr};\n    auto res = r.div(q, big_decimal::rounding_mode::HALF_EVEN);\n    big_decimal expected{expected_cstr};\n    BOOST_REQUIRE_EQUAL(res.unscaled_value(), expected.unscaled_value());\n    BOOST_REQUIRE_EQUAL(res.scale(), expected.scale());\n}\n\ntemplate<typename Op>\nvoid test_op(const char* x_cstr, const char* y_cstr, const char* expected_cstr, Op&& op) {\n    big_decimal x{x_cstr};\n    big_decimal y{y_cstr};\n    big_decimal expected{expected_cstr};\n    auto ret = op(x, y);\n    BOOST_REQUIRE_EQUAL(ret.unscaled_value(), expected.unscaled_value());\n    BOOST_REQUIRE_EQUAL(ret.scale(), expected.scale());\n}\n\nvoid test_assignadd(const char *x_cstr, const char *y_cstr, const char *expected_cstr) {\n    return test_op(x_cstr, y_cstr, expected_cstr, [](big_decimal& d1, big_decimal& d2) { return d1 += d2; });\n}\n\nvoid test_add(const char *x_cstr, const char *y_cstr, const char *expected_cstr) {\n    return test_op(x_cstr, y_cstr, expected_cstr, [](big_decimal& d1, big_decimal& d2) { return d1 + d2; });\n}\n\nvoid test_assignsub(const char *x_cstr, const char *y_cstr, const char *expected_cstr) {\n    return test_op(x_cstr, y_cstr, expected_cstr, [](big_decimal& d1, big_decimal& d2) { return d1 -= d2; });\n}\n\nvoid test_sub(const char *x_cstr, const char *y_cstr, const char *expected_cstr) {\n    return test_op(x_cstr, y_cstr, expected_cstr, [](big_decimal& d1, big_decimal& d2) { return d1 - d2; });\n}\n\n} \/* anonymous namespoce *\/\n\nBOOST_AUTO_TEST_CASE(test_big_decimal_construct_from_string) {\n    big_decimal x0{\"0\"};\n    big_decimal x1{\"0.0\"};\n    big_decimal x2{\"0.00\"};\n    big_decimal x3{\"0.000\"};\n    big_decimal x4{\"0E3\"};\n    big_decimal x5{\"0E10\"};\n\n    BOOST_REQUIRE_EQUAL(x0.unscaled_value(), 0);\n    BOOST_REQUIRE_EQUAL(x0.scale(), 0);\n\n    BOOST_REQUIRE_EQUAL(x1.unscaled_value(), 0);\n    BOOST_REQUIRE_EQUAL(x1.scale(), 1);\n\n    BOOST_REQUIRE_EQUAL(x2.unscaled_value(), 0);\n    BOOST_REQUIRE_EQUAL(x2.scale(), 2);\n\n    BOOST_REQUIRE_EQUAL(x3.unscaled_value(), 0);\n    BOOST_REQUIRE_EQUAL(x3.scale(), 3);\n\n    BOOST_REQUIRE_EQUAL(x4.unscaled_value(), 0);\n    BOOST_REQUIRE_EQUAL(x4.scale(), -3);\n\n    BOOST_REQUIRE_EQUAL(x5.unscaled_value(), 0);\n    BOOST_REQUIRE_EQUAL(x5.scale(), -10);\n}\n\nBOOST_AUTO_TEST_CASE(test_big_decimal_div) {\n    test_div(\"1\", 4, \"0\");\n    test_div(\"1.00\", 4, \"0.25\");\n    test_div(\"0.10\", 4, \"0.02\");\n    test_div(\"1.000\", 4, \"0.250\");\n    test_div(\"0.100\", 4, \"0.025\");\n    test_div(\"1\", 3, \"0\");\n    test_div(\"1.00\", 3, \"0.33\");\n    test_div(\"1.000\", 3, \"0.333\");\n    test_div(\"0.100\", 3, \"0.033\");\n    test_div(\"11\", 10, \"1\");\n    test_div(\"15\", 10, \"2\");\n    test_div(\"16\", 10, \"2\");\n    test_div(\"25\", 10, \"2\");\n    test_div(\"26\", 10, \"3\");\n    test_div(\"0.11\", 10, \"0.01\");\n    test_div(\"0.15\", 10, \"0.02\");\n    test_div(\"0.16\", 10, \"0.02\");\n    test_div(\"0.25\", 10, \"0.02\");\n    test_div(\"0.26\", 10, \"0.03\");\n    test_div(\"10E10\", 3, \"3E10\");\n\n    test_div(\"-1\", 4, \"0\");\n    test_div(\"-1.00\", 4, \"-0.25\");\n    test_div(\"-0.10\", 4, \"-0.02\");\n    test_div(\"-1.000\", 4, \"-0.250\");\n    test_div(\"-0.100\", 4, \"-0.025\");\n    test_div(\"-1\", 3, \"0\");\n    test_div(\"-1.00\", 3, \"-0.33\");\n    test_div(\"-1.000\", 3, \"-0.333\");\n    test_div(\"-0.100\", 3, \"-0.033\");\n    test_div(\"-11\", 10, \"-1\");\n    test_div(\"-15\", 10, \"-2\");\n    test_div(\"-16\", 10, \"-2\");\n    test_div(\"-25\", 10, \"-2\");\n    test_div(\"-26\", 10, \"-3\");\n    test_div(\"-0.11\", 10, \"-0.01\");\n    test_div(\"-0.15\", 10, \"-0.02\");\n    test_div(\"-0.16\", 10, \"-0.02\");\n    test_div(\"-0.25\", 10, \"-0.02\");\n    test_div(\"-0.26\", 10, \"-0.03\");\n    test_div(\"-10E10\", 3, \"-3E10\");\n}\n\nBOOST_AUTO_TEST_CASE(test_big_decimal_assignadd) {\n    test_assignadd(\"1\", \"4\", \"5\");\n    test_assignadd(\"1.00\", \"4.00\", \"5.00\");\n    test_assignadd(\"1.000\", \"4.000\", \"5.000\");\n    test_assignadd(\"1\", \"-1\", \"0\");\n    test_assignadd(\"1.00\", \"-1.00\", \"0.00\");\n    test_assignadd(\"1.000\", \"-1.000\", \"0.000\");\n    test_assignadd(\"0.0\", \"0.000\", \"0.000\");\n    test_assignadd(\"1.0\", \"1.000\", \"2.000\");\n    test_assignadd(\"-1.0\", \"-1.000\", \"-2.000\");\n}\n\nBOOST_AUTO_TEST_CASE(test_big_decimal_add) {\n    test_add(\"1\", \"4\", \"5\");\n    test_add(\"1.00\", \"4.00\", \"5.00\");\n    test_add(\"1.000\", \"4.000\", \"5.000\");\n    test_add(\"1\", \"-1\", \"0\");\n    test_add(\"1.00\", \"-1.00\", \"0.00\");\n    test_add(\"1.000\", \"-1.000\", \"0.000\");\n    test_add(\"0.0\", \"0.000\", \"0.000\");\n    test_add(\"1.0\", \"1.000\", \"2.000\");\n    test_add(\"-1.0\", \"-1.000\", \"-2.000\");\n}\n\nBOOST_AUTO_TEST_CASE(test_big_decimal_assignsub) {\n    test_assignsub(\"1\", \"4\", \"-3\");\n    test_assignsub(\"1.00\", \"4.00\", \"-3.00\");\n    test_assignsub(\"1.000\", \"4.000\", \"-3.000\");\n    test_assignsub(\"1\", \"-1\", \"2\");\n    test_assignsub(\"1.00\", \"-1.00\", \"2.00\");\n    test_assignsub(\"1.000\", \"-1.000\", \"2.000\");\n    test_assignsub(\"0.0\", \"0.000\", \"0.000\");\n    test_assignsub(\"1.0\", \"1.000\", \"0.000\");\n    test_assignsub(\"-1.0\", \"1.000\", \"-2.000\");\n}\n\nBOOST_AUTO_TEST_CASE(test_big_decimal_sub) {\n    test_sub(\"1\", \"4\", \"-3\");\n    test_sub(\"1.00\", \"4.00\", \"-3.00\");\n    test_sub(\"1.000\", \"4.000\", \"-3.000\");\n    test_sub(\"1\", \"-1\", \"2\");\n    test_sub(\"1.00\", \"-1.00\", \"2.00\");\n    test_sub(\"1.000\", \"-1.000\", \"2.000\");\n    test_sub(\"0.0\", \"0.000\", \"0.000\");\n    test_sub(\"1.0\", \"1.000\", \"0.000\");\n    test_sub(\"-1.0\", \"1.000\", \"-2.000\");\n}\n<commit_msg>test: add test cases to big_decimal_test<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 *\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#define BOOST_TEST_MODULE big_decimal\n\n#include <boost\/test\/unit_test.hpp>\n#include \"utils\/big_decimal.hh\"\n#include \"marshal_exception.hh\"\n\nnamespace {\n\nvoid test_div(const char *r_cstr, const int64_t q, const char *expected_cstr) {\n    big_decimal r{r_cstr};\n    auto res = r.div(q, big_decimal::rounding_mode::HALF_EVEN);\n    big_decimal expected{expected_cstr};\n    BOOST_REQUIRE_EQUAL(res.unscaled_value(), expected.unscaled_value());\n    BOOST_REQUIRE_EQUAL(res.scale(), expected.scale());\n}\n\ntemplate<typename Op>\nvoid test_op(const char* x_cstr, const char* y_cstr, const char* expected_cstr, Op&& op) {\n    big_decimal x{x_cstr};\n    big_decimal y{y_cstr};\n    big_decimal expected{expected_cstr};\n    auto ret = op(x, y);\n    BOOST_REQUIRE_EQUAL(ret.unscaled_value(), expected.unscaled_value());\n    BOOST_REQUIRE_EQUAL(ret.scale(), expected.scale());\n}\n\nvoid test_assignadd(const char *x_cstr, const char *y_cstr, const char *expected_cstr) {\n    return test_op(x_cstr, y_cstr, expected_cstr, [](big_decimal& d1, big_decimal& d2) { return d1 += d2; });\n}\n\nvoid test_add(const char *x_cstr, const char *y_cstr, const char *expected_cstr) {\n    return test_op(x_cstr, y_cstr, expected_cstr, [](big_decimal& d1, big_decimal& d2) { return d1 + d2; });\n}\n\nvoid test_assignsub(const char *x_cstr, const char *y_cstr, const char *expected_cstr) {\n    return test_op(x_cstr, y_cstr, expected_cstr, [](big_decimal& d1, big_decimal& d2) { return d1 -= d2; });\n}\n\nvoid test_sub(const char *x_cstr, const char *y_cstr, const char *expected_cstr) {\n    return test_op(x_cstr, y_cstr, expected_cstr, [](big_decimal& d1, big_decimal& d2) { return d1 - d2; });\n}\n\n} \/* anonymous namespoce *\/\n\nBOOST_AUTO_TEST_CASE(test_big_decimal_construct_from_string) {\n    big_decimal x0{\"0\"};\n    big_decimal x1{\"0.0\"};\n    big_decimal x2{\"0.00\"};\n    big_decimal x3{\"0.000\"};\n    big_decimal x4{\"0E3\"};\n    big_decimal x5{\"0E10\"};\n    big_decimal x6{\"+12.34e5\"};\n    big_decimal x7{\"10e+3\"};\n\n    BOOST_REQUIRE_EQUAL(x0.unscaled_value(), 0);\n    BOOST_REQUIRE_EQUAL(x0.scale(), 0);\n\n    BOOST_REQUIRE_EQUAL(x1.unscaled_value(), 0);\n    BOOST_REQUIRE_EQUAL(x1.scale(), 1);\n\n    BOOST_REQUIRE_EQUAL(x2.unscaled_value(), 0);\n    BOOST_REQUIRE_EQUAL(x2.scale(), 2);\n\n    BOOST_REQUIRE_EQUAL(x3.unscaled_value(), 0);\n    BOOST_REQUIRE_EQUAL(x3.scale(), 3);\n\n    BOOST_REQUIRE_EQUAL(x4.unscaled_value(), 0);\n    BOOST_REQUIRE_EQUAL(x4.scale(), -3);\n\n    BOOST_REQUIRE_EQUAL(x5.unscaled_value(), 0);\n    BOOST_REQUIRE_EQUAL(x5.scale(), -10);\n\n    BOOST_REQUIRE_EQUAL(x6.unscaled_value(), 1234);\n    BOOST_REQUIRE_EQUAL(x6.scale(), -3);\n\n    BOOST_REQUIRE_EQUAL(x7.unscaled_value(), 10);\n    BOOST_REQUIRE_EQUAL(x7.scale(), -3);\n\n    BOOST_REQUIRE_THROW(big_decimal(\"\"), marshal_exception);\n    BOOST_REQUIRE_THROW(big_decimal(\"10.0.3\"), marshal_exception);\n    BOOST_REQUIRE_THROW(big_decimal(\"10.0e7.3\"), marshal_exception);\n    BOOST_REQUIRE_THROW(big_decimal(\"10.0e7e2\"), marshal_exception);\n    BOOST_REQUIRE_THROW(big_decimal(\"-\"), marshal_exception);\n    BOOST_REQUIRE_THROW(big_decimal(\".\"), marshal_exception);\n    BOOST_REQUIRE_THROW(big_decimal(\".e\"), marshal_exception);\n    BOOST_REQUIRE_THROW(big_decimal(\".E0\"), marshal_exception);\n    BOOST_REQUIRE_THROW(big_decimal(\"10e\"), marshal_exception);\n    BOOST_REQUIRE_THROW(big_decimal(\"10.3e\"), marshal_exception);\n    BOOST_REQUIRE_THROW(big_decimal(\"10.3e+\"), marshal_exception);\n    BOOST_REQUIRE_THROW(big_decimal(\"-+5\"), marshal_exception);\n    BOOST_REQUIRE_THROW(big_decimal(\"+-5\"), marshal_exception);\n    BOOST_REQUIRE_THROW(big_decimal(\"++5\"), marshal_exception);\n    BOOST_REQUIRE_THROW(big_decimal(\"--5\"), marshal_exception);\n}\n\nBOOST_AUTO_TEST_CASE(test_big_decimal_div) {\n    test_div(\"1\", 4, \"0\");\n    test_div(\"1.00\", 4, \"0.25\");\n    test_div(\"0.10\", 4, \"0.02\");\n    test_div(\"1.000\", 4, \"0.250\");\n    test_div(\"0.100\", 4, \"0.025\");\n    test_div(\"1\", 3, \"0\");\n    test_div(\"1.00\", 3, \"0.33\");\n    test_div(\"1.000\", 3, \"0.333\");\n    test_div(\"0.100\", 3, \"0.033\");\n    test_div(\"11\", 10, \"1\");\n    test_div(\"15\", 10, \"2\");\n    test_div(\"16\", 10, \"2\");\n    test_div(\"25\", 10, \"2\");\n    test_div(\"26\", 10, \"3\");\n    test_div(\"0.11\", 10, \"0.01\");\n    test_div(\"0.15\", 10, \"0.02\");\n    test_div(\"0.16\", 10, \"0.02\");\n    test_div(\"0.25\", 10, \"0.02\");\n    test_div(\"0.26\", 10, \"0.03\");\n    test_div(\"10E10\", 3, \"3E10\");\n\n    test_div(\"-1\", 4, \"0\");\n    test_div(\"-1.00\", 4, \"-0.25\");\n    test_div(\"-0.10\", 4, \"-0.02\");\n    test_div(\"-1.000\", 4, \"-0.250\");\n    test_div(\"-0.100\", 4, \"-0.025\");\n    test_div(\"-1\", 3, \"0\");\n    test_div(\"-1.00\", 3, \"-0.33\");\n    test_div(\"-1.000\", 3, \"-0.333\");\n    test_div(\"-0.100\", 3, \"-0.033\");\n    test_div(\"-11\", 10, \"-1\");\n    test_div(\"-15\", 10, \"-2\");\n    test_div(\"-16\", 10, \"-2\");\n    test_div(\"-25\", 10, \"-2\");\n    test_div(\"-26\", 10, \"-3\");\n    test_div(\"-0.11\", 10, \"-0.01\");\n    test_div(\"-0.15\", 10, \"-0.02\");\n    test_div(\"-0.16\", 10, \"-0.02\");\n    test_div(\"-0.25\", 10, \"-0.02\");\n    test_div(\"-0.26\", 10, \"-0.03\");\n    test_div(\"-10E10\", 3, \"-3E10\");\n}\n\nBOOST_AUTO_TEST_CASE(test_big_decimal_assignadd) {\n    test_assignadd(\"1\", \"4\", \"5\");\n    test_assignadd(\"1.00\", \"4.00\", \"5.00\");\n    test_assignadd(\"1.000\", \"4.000\", \"5.000\");\n    test_assignadd(\"1\", \"-1\", \"0\");\n    test_assignadd(\"1.00\", \"-1.00\", \"0.00\");\n    test_assignadd(\"1.000\", \"-1.000\", \"0.000\");\n    test_assignadd(\"0.0\", \"0.000\", \"0.000\");\n    test_assignadd(\"1.0\", \"1.000\", \"2.000\");\n    test_assignadd(\"-1.0\", \"-1.000\", \"-2.000\");\n}\n\nBOOST_AUTO_TEST_CASE(test_big_decimal_add) {\n    test_add(\"1\", \"4\", \"5\");\n    test_add(\"1.00\", \"4.00\", \"5.00\");\n    test_add(\"1.000\", \"4.000\", \"5.000\");\n    test_add(\"1\", \"-1\", \"0\");\n    test_add(\"1.00\", \"-1.00\", \"0.00\");\n    test_add(\"1.000\", \"-1.000\", \"0.000\");\n    test_add(\"0.0\", \"0.000\", \"0.000\");\n    test_add(\"1.0\", \"1.000\", \"2.000\");\n    test_add(\"-1.0\", \"-1.000\", \"-2.000\");\n    test_add(\"0000123456789012345678901234\", \"19e3\", \"00123456789012345678920234\");\n    test_add(\"000000000012345678901234.5678901234e-1\", \"0777.555555555555555555555e2\", \"1234567967879.0123445678955555555\");\n}\n\nBOOST_AUTO_TEST_CASE(test_big_decimal_assignsub) {\n    test_assignsub(\"1\", \"4\", \"-3\");\n    test_assignsub(\"1.00\", \"4.00\", \"-3.00\");\n    test_assignsub(\"1.000\", \"4.000\", \"-3.000\");\n    test_assignsub(\"1\", \"-1\", \"2\");\n    test_assignsub(\"1.00\", \"-1.00\", \"2.00\");\n    test_assignsub(\"1.000\", \"-1.000\", \"2.000\");\n    test_assignsub(\"0.0\", \"0.000\", \"0.000\");\n    test_assignsub(\"1.0\", \"1.000\", \"0.000\");\n    test_assignsub(\"-1.0\", \"1.000\", \"-2.000\");\n}\n\nBOOST_AUTO_TEST_CASE(test_big_decimal_sub) {\n    test_sub(\"1\", \"4\", \"-3\");\n    test_sub(\"1.00\", \"4.00\", \"-3.00\");\n    test_sub(\"1.000\", \"4.000\", \"-3.000\");\n    test_sub(\"1\", \"-1\", \"2\");\n    test_sub(\"1.00\", \"-1.00\", \"2.00\");\n    test_sub(\"1.000\", \"-1.000\", \"2.000\");\n    test_sub(\"0.0\", \"0.000\", \"0.000\");\n    test_sub(\"1.0\", \"1.000\", \"0.000\");\n    test_sub(\"-1.0\", \"1.000\", \"-2.000\");\n    test_sub(\"9999999999999999999999999999999999999\", \"-1.000e0\", \"10000000000000000000000000000000000000.000\");\n    test_sub(\"+10.\", \"1.e+1\", \"0\");\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"Halide.h\"\nusing namespace Halide;\n\n#include <stdio.h>\n\nint main(int argc, char **argv) {\n    Func f;\n    Var x;\n    f(x) = x;\n\n    f.compile_jit(parse_target_string(\"host\"));\n    f.realize(100);\n\n    Func g;\n    g(x) = x;\n    g.compile_jit(parse_target_string(\"host-profile\"));\n    g.realize(100);\n\n    return 0;\n}\n<commit_msg>Delete incorrect test<commit_after><|endoftext|>"}
{"text":"<commit_before>#include <ESP8266WiFi.h>\n#include <Ticker.h>\n#include \"Sds011.h\"\n#include \"Pcd8544.h\"\n#include \"Expander.h\"\n#include \"Dht.h\"\n\nextern pcd8544::Pcd8544 display;\nextern expander::Expander expand;\n\nsds011::Sds011 sensor(Serial);\ndht::Dht dht22(14);\nTicker timer1;\nTicker timer2;\n\nstatic const int PM25_NORM=25;\nstatic const int PM10_NORM=40;\nstatic const int SAMPLES=10;\n\nstatic String val_to_str(uint16_t v)\n{\n    String r;\n\n    r = String(v\/10);\n    if (v < 1000 && v%10) {\n        r += String(\".\") + String(v%10);\n    }\n\n    for (int i = 4 - r.length(); i > 0; i--) {\n        r = String(\" \") + r;\n    }\n\n    return r;\n}\n\nstatic void display_data(uint16_t pm25, uint16_t pm10, int16_t t, uint16_t h)\n{\n    display.clear();\n    display.setCursor(0, 0);\n\n    display.println(\"    2.5   10\");\n\n    display.print(\"ug \");\n    display.print(val_to_str(pm25).c_str());\n\n    display.setCursor(8*7, 1);\n    display.println(val_to_str(pm10).c_str());\n\n    display.print(\"%  \");\n    display.print(val_to_str((10*pm25\/PM25_NORM)*10).c_str());\n    display.setCursor(8*7, 2);\n    display.print(val_to_str((10*pm10\/PM10_NORM)*10).c_str());\n\n    display.setCursor(0, 3);\n    display.print(\"t:  \");\n    display.print(val_to_str(t).c_str());\n    display.print(\"C\");\n    display.setCursor(0, 4);\n    display.print(\"h:  \");\n    display.print(val_to_str(h).c_str());\n    display.println(\"%\");\n}\n\nstatic void turnOff(void)\n{\n    expand.digitalWrite(0, HIGH);\n}\n\nstatic void turnOn(void)\n{\n    uint8_t b = expand.readByte();\n\n    if ((b & 0b10) != 0b10) {\n        timer2.once_ms(5000, turnOff);\n        expand.digitalWrite(0, LOW);\n    }\n}\n\nstatic void iter()\n{\n    timer1.once_ms(30, turnOn);\n}\n\nvoid normal_setup(void)\n{\n    dht22.begin();\n    expand.attachInterrupt(iter);\n\n    WiFi.mode(WIFI_STA);\n\n    sensor.set_sleep(false);\n    sensor.set_mode(sds011::QUERY);\n    sensor.set_sleep(true);\n}\n\nvoid normal_loop(void)\n{\n    int pm25, pm10;\n    bool ok;\n\n    sensor.set_sleep(false);\n    delay(1000);\n    ok = sensor.query_data_auto(&pm25, &pm10, SAMPLES);\n    sensor.set_sleep(true);\n\n    int16_t t = dht22.get_temperature();\n    uint16_t h = dht22.get_humidity();\n\n    if (ok) {\n        display_data(pm25, pm10, t, h);\n    } else {\n        display.clear();\n        display.setCursor(0, 0);\n        display.println(\"NO SENSOR!\");\n    }\n\n    WiFi.disconnect();\n    delay(100);\n    WiFi.forceSleepBegin(); \/\/ Use WiFi.forceSleepWake() to enable wifi\n\n    delay(3000);\n    ESP.deepSleep(1000*1000*10, WAKE_RF_DEFAULT);\n}\n<commit_msg>normal_mode: Connect to wifi<commit_after>#include <ESP8266WiFi.h>\n#include <Ticker.h>\n#include \"Sds011.h\"\n#include \"Pcd8544.h\"\n#include \"Expander.h\"\n#include \"Dht.h\"\n#include \"config.h\"\n\nextern pcd8544::Pcd8544 display;\nextern expander::Expander expand;\nextern struct Configuration config;\n\nsds011::Sds011 sensor(Serial);\ndht::Dht dht22(14);\nTicker timer1;\nTicker timer2;\n\nstatic const int PM25_NORM=25;\nstatic const int PM10_NORM=40;\nstatic const int SAMPLES=10;\n\nstatic String val_to_str(uint16_t v)\n{\n    String r;\n\n    r = String(v\/10);\n    if (v < 1000 && v%10) {\n        r += String(\".\") + String(v%10);\n    }\n\n    for (int i = 4 - r.length(); i > 0; i--) {\n        r = String(\" \") + r;\n    }\n\n    return r;\n}\n\nstatic void display_data(uint16_t pm25, uint16_t pm10, int16_t t, uint16_t h)\n{\n    display.clear();\n    display.setCursor(0, 0);\n\n    display.println(\"    2.5   10\");\n\n    display.print(\"ug \");\n    display.print(val_to_str(pm25).c_str());\n\n    display.setCursor(8*7, 1);\n    display.println(val_to_str(pm10).c_str());\n\n    display.print(\"%  \");\n    display.print(val_to_str((10*pm25\/PM25_NORM)*10).c_str());\n    display.setCursor(8*7, 2);\n    display.print(val_to_str((10*pm10\/PM10_NORM)*10).c_str());\n\n    display.setCursor(0, 3);\n    display.print(\"t:  \");\n    display.print(val_to_str(t).c_str());\n    display.print(\"C\");\n    display.setCursor(0, 4);\n    display.print(\"h:  \");\n    display.print(val_to_str(h).c_str());\n    display.println(\"%\");\n}\n\nstatic void turnOff(void)\n{\n    expand.digitalWrite(0, HIGH);\n}\n\nstatic void turnOn(void)\n{\n    uint8_t b = expand.readByte();\n\n    if ((b & 0b10) != 0b10) {\n        timer2.once_ms(5000, turnOff);\n        expand.digitalWrite(0, LOW);\n    }\n}\n\nstatic void iter()\n{\n    timer1.once_ms(30, turnOn);\n}\n\nvoid normal_setup(void)\n{\n    dht22.begin();\n    expand.attachInterrupt(iter);\n\n    WiFi.mode(WIFI_STA);\n\n    sensor.set_sleep(false);\n    sensor.set_mode(sds011::QUERY);\n    sensor.set_sleep(true);\n}\n\nvoid normal_loop(void)\n{\n    int pm25, pm10;\n    bool ok;\n\n    WiFi.begin(config.wifi_ssid, config.wifi_pass);\n\n    sensor.set_sleep(false);\n    delay(1000);\n    ok = sensor.query_data_auto(&pm25, &pm10, SAMPLES);\n    sensor.set_sleep(true);\n\n    int16_t t = dht22.get_temperature();\n    uint16_t h = dht22.get_humidity();\n\n    if (ok) {\n        display_data(pm25, pm10, t, h);\n        display.print(\".\");\n        if (WiFi.waitForConnectResult() != WL_CONNECTED) {\n            display.println(\"Wifi Connection Failed!\");\n        }\n        display.print(\".\");\n    } else {\n        display.clear();\n        display.setCursor(0, 0);\n        display.println(\"NO SENSOR!\");\n    }\n\n    WiFi.disconnect();\n    delay(100);\n    WiFi.forceSleepBegin(); \/\/ Use WiFi.forceSleepWake() to enable wifi\n\n    delay(3000);\n    ESP.deepSleep(1000*1000*10, WAKE_RF_DEFAULT);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"Platform.hpp\"\n#include \"genome.pb.h\"\n#include \"CellComponent.hpp\"\n#include \"ActivityStats.hpp\"\n#include \"Neuron.hpp\"\n#include \"Branch.hpp\"\n#include \"Synapse.hpp\"\n#include \"Base64.hpp\"\n#include \"Brain.hpp\"\n#include \"SimpleProteinEnvironment.hpp\"\n#include \"genome.pb.h\"\n#include <time.h>\n\nnamespace Elysia {\nvoid testTwoConnectedNeurons() {\n    ProteinEnvironment *myProteinEnvironment= new SimpleProteinEnvironment();\n\n\tBrain *brain= new Brain(myProteinEnvironment);\n\tFILE *dendriteTree=NULL;\n\tdendriteTree = fopen(\"Dendritic_Tree.txt\", \"w\");\n\tfor(float i=0;i<2;i++){\n        Genome::Gene gene;\/\/FIXME set source and target regions to match the desired behavior\n        Genome::TemporalBoundingBox *sourcebb=gene.add_bounds();\n        Genome::TemporalBoundingBox *targetbb=gene.add_bounds();\n        sourcebb->set_minx(i);\n        sourcebb->set_miny(i);\n        sourcebb->set_minz(i);\n\n        sourcebb->set_maxx(i);\n        sourcebb->set_maxy(i);\n        sourcebb->set_maxz(i);\n\n        targetbb->set_minx(1-i);\n        targetbb->set_miny(1-i);\n        targetbb->set_minz(1-i);\n\n        targetbb->set_maxx(1-i);\n        targetbb->set_maxy(1-i);\n        targetbb->set_maxz(1-i);\n\n        \n\n\t\tVector3f v;\n\t\tv.x = i;\n\t\tv.y = i;\n\t\tv.z = i;\n\t\tNeuron *n;\n\t\tsrand(time(NULL));\n\t\tbrain->mAllNeurons.insert(n = new Neuron(brain, 2, 3, 4, v,gene)); \n        n->developSynapse(n->getActivityStats());\n        \n        size_t parent;\n        parent = 0;\n        n->visualizeTree(dendriteTree, parent);\n        n->activateComponent(*brain,100);\n        n->tick();\n\t\t\/\/const Vector3f &location):  mNeuronLocation(location){));\n\t}\n\tfclose(dendriteTree);\n}\n\n\nvoid testResultHelper(const std::vector<std::pair<Elysia::Genome::Effect, float> >&combinedResult, float*grow_leaf_count,float*grow_neuron_count,float*other_count){\n   using namespace Elysia::Genome;\n    *grow_neuron_count=0;\n    *grow_leaf_count=0;\n    *other_count=0;\n    for (size_t i=0;i<combinedResult.size();++i) {\n       switch(combinedResult[i].first) {\n         case GROW_NEURON:\n           *grow_neuron_count+=combinedResult[i].second;\n           break;\n         case GROW_LEAF:\n           *grow_leaf_count+=combinedResult[i].second;\n           break;\n         default:\n           *other_count+=combinedResult[i].second;\n           break;\n       }\n   }\n\n}\n\nvoid testProteinEnvironment() {\n   using namespace Elysia::Genome;\n   Elysia::Genome::Genome twoOverlappingGenes;\n   Elysia::Genome::Chromosome *father=twoOverlappingGenes.mutable_fathers();\n   Elysia::Genome::Gene firstGene;\n   Elysia::Genome::Protein firstProtein;\n   firstProtein.set_protein_code(GROW_NEURON);\/\/so we can easily identify where\n   firstProtein.set_density(0.125);   \n   Elysia::Genome::Protein firstAuxProtein;\n   firstAuxProtein.set_protein_code(GROW_LEAF);\/\/so we see that they are additive\n   firstAuxProtein.set_density(0.25);\n   *firstGene.add_external_proteins()=firstProtein;\n   assert(firstGene.external_proteins(0).protein_code()==GROW_NEURON);\n   *firstGene.add_external_proteins()=firstAuxProtein;\n   assert(firstGene.external_proteins(1).protein_code()==GROW_LEAF);\n   Elysia::Genome::TemporalBoundingBox firstRegion;\n   firstRegion.set_minx(0);\n   firstRegion.set_miny(0);\n   firstRegion.set_minz(0);\n   firstRegion.set_maxx(2);\n   firstRegion.set_maxy(2);\n   firstRegion.set_maxz(2);\n\n   *firstGene.add_bounds()=firstRegion;\n\n   Elysia::Genome::TemporalBoundingBox firstTargetRegion;\n   firstTargetRegion.set_minx(5);\n   firstTargetRegion.set_miny(5);\n   firstTargetRegion.set_minz(5);\n   firstTargetRegion.set_maxx(8);\n   firstTargetRegion.set_maxy(8);\n   firstTargetRegion.set_maxz(8);\n\n   *firstGene.add_target_region()=firstTargetRegion;\n   Elysia::Genome::Gene secondGene;\n   Elysia::Genome::Protein secondProtein;\n   secondProtein.set_protein_code(GROW_LEAF);\n   secondProtein.set_density(0.5);\n   *secondGene.add_external_proteins()=secondProtein;\n   Elysia::Genome::TemporalBoundingBox secondRegion;\n   secondRegion.set_minx(-1);\n   secondRegion.set_miny(-1);\n   secondRegion.set_minz(-1);\n   secondRegion.set_maxx(1);\n   secondRegion.set_maxy(1);\n   secondRegion.set_maxz(1);\n   *secondGene.add_bounds()=secondRegion;\n\n   Elysia::Genome::TemporalBoundingBox secondTargetRegion;\n   secondTargetRegion.set_minx(-5);\n   secondTargetRegion.set_miny(-5);\n   secondTargetRegion.set_minz(-5);\n   secondTargetRegion.set_maxx(3);\n   secondTargetRegion.set_maxy(3);\n   secondTargetRegion.set_maxz(3);\n\n   *secondGene.add_target_region()=secondTargetRegion;\n\n\n   *father->add_genes()=firstGene;\n   *father->add_genes()=secondGene;\n   \n   ProteinEnvironment * pe=new SimpleProteinEnvironment;\n   pe->initialize(twoOverlappingGenes);\n   std::vector<std::pair<Elysia::Genome::Effect, float> > combinedResult=pe->getCompleteProteinDensity(Vector3f(.5,.5,.5));\n   \/\/check that firstResult matches expectations\n   std::vector<std::pair<Elysia::Genome::Effect, float> > firstResult=pe->getCompleteProteinDensity(Vector3f(1.5,1.5,1.5));\n   \/\/check that secondResult matches expectations\n   std::vector<std::pair<Elysia::Genome::Effect, float> > secondResult=pe->getCompleteProteinDensity(Vector3f(-.5,-.5,-.5));\n   float grow_leaf_count=0;\n   float grow_neuron_count=0;\n   float other_count=0;\n\n   testResultHelper(combinedResult,&grow_leaf_count,&grow_neuron_count,&other_count);\n   assert(grow_leaf_count==.75);\n   assert(grow_neuron_count==.125);\n   assert(other_count==0);\n\n   testResultHelper(firstResult,&grow_leaf_count,&grow_neuron_count,&other_count);\n   assert(grow_leaf_count==.25);\n   assert(grow_neuron_count==.125);\n   assert(other_count==0);\n\n   testResultHelper(secondResult,&grow_leaf_count,&grow_neuron_count,&other_count);\n   assert(grow_leaf_count==.5);\n   assert(grow_neuron_count==0);\n   assert(other_count==0);\n   return;\/\/UNCOMMENT TO GET FAILING TEST\n   const Gene * grow_neuron_gene = &pe->retrieveGene(Vector3f(0.5,0.5,0.5),\n                                              GROW_NEURON);\n   const Gene * combined_grow_leaf_gene = &pe->retrieveGene(Vector3f(0.5,0.5,0.5),\n                                                     GROW_LEAF);\n   const Gene * first_grow_leaf_gene = &pe->retrieveGene(Vector3f(1.5,1.5,1.5),\n                                                  GROW_LEAF);\n   const Gene * second_grow_leaf_gene = &pe->retrieveGene(Vector3f(-0.5,-0.5,-0.5),\n                                                   GROW_LEAF);\n   assert(grow_neuron_gene->target_region(0).minx()==5);\n   assert(combined_grow_leaf_gene->target_region(0).minx()==5||\n          combined_grow_leaf_gene->target_region(0).minx()==-5);\n   assert(first_grow_leaf_gene->target_region(0).minx()==5);\n   assert(second_grow_leaf_gene->target_region(0).minx()==-5);\n\n   delete pe;\n}\n}\n\nint runtest(){\n    Elysia::testTwoConnectedNeurons();\n    Elysia::testProteinEnvironment();\n\t\/\/getchar();\n\treturn 1;\n\t\n}\n<commit_msg><commit_after>#include \"Platform.hpp\"\n#include \"genome.pb.h\"\n#include \"CellComponent.hpp\"\n#include \"ActivityStats.hpp\"\n#include \"Neuron.hpp\"\n#include \"Branch.hpp\"\n#include \"Synapse.hpp\"\n#include \"Base64.hpp\"\n#include \"Brain.hpp\"\n#include \"SimpleProteinEnvironment.hpp\"\n#include \"genome.pb.h\"\n#include <time.h>\n\nnamespace Elysia {\nvoid testTwoConnectedNeurons() {\n    ProteinEnvironment *myProteinEnvironment= new SimpleProteinEnvironment();\n\n\tBrain *brain= new Brain(myProteinEnvironment);\n\tFILE *dendriteTree=NULL;\n\tdendriteTree = fopen(\"Dendritic_Tree.txt\", \"w\");\n\tstd::vector<Neuron *> createdList;\n\tint neuronNumber = 2;\n\tfor(float i=0;i<neuronNumber;i++){\n        Genome::Gene gene;\/\/FIXME set source and target regions to match the desired behavior\n        Genome::TemporalBoundingBox *sourcebb=gene.add_bounds();\n        Genome::TemporalBoundingBox *targetbb=gene.add_bounds();\n        sourcebb->set_minx(i);\n        sourcebb->set_miny(i);\n        sourcebb->set_minz(i);\n\n        sourcebb->set_maxx(i);\n        sourcebb->set_maxy(i);\n        sourcebb->set_maxz(i);\n\n        targetbb->set_minx(1-i);\n        targetbb->set_miny(1-i);\n        targetbb->set_minz(1-i);\n\n        targetbb->set_maxx(1-i);\n        targetbb->set_maxy(1-i);\n        targetbb->set_maxz(1-i);\n\n        \n\n\t\tVector3f v;\n\t\tv.x = i;\n\t\tv.y = i;\n\t\tv.z = i;\n\t\tNeuron *n;\n\t\tsrand(time(NULL));\n\t\tbrain->mAllNeurons.insert(n = new Neuron(brain, 2, 3, 4, v,gene)); \n\t\tbrain->mAllNeurons.insert(n = new Neuron(brain, 2, 3, 4, v,gene));\n\t\tcreatedList.push_back(n);\n\t\t}\n\tfor(float i=0;i<neuronNumber;i++){\n\t\tNeuron *n = createdList[i];\n        n->developSynapse(n->getActivityStats());\n        \n        size_t parent;\n\t\tsize_t parent;\n        parent = 0;\n        n->visualizeTree(dendriteTree, parent);\n        n->activateComponent(*brain,100);\n        n->tick();\n\t\tcreatedList.push_back(n);\n\t\t\/\/const Vector3f &location):  mNeuronLocation(location){));\n\t}\n\tfclose(dendriteTree);\n}\n\n\nvoid testResultHelper(const std::vector<std::pair<Elysia::Genome::Effect, float> >&combinedResult, float*grow_leaf_count,float*grow_neuron_count,float*other_count){\n   using namespace Elysia::Genome;\n    *grow_neuron_count=0;\n    *grow_leaf_count=0;\n    *other_count=0;\n    for (size_t i=0;i<combinedResult.size();++i) {\n       switch(combinedResult[i].first) {\n         case GROW_NEURON:\n           *grow_neuron_count+=combinedResult[i].second;\n           break;\n         case GROW_LEAF:\n           *grow_leaf_count+=combinedResult[i].second;\n           break;\n         default:\n           *other_count+=combinedResult[i].second;\n           break;\n       }\n   }\n\n}\n\nvoid testProteinEnvironment() {\n   using namespace Elysia::Genome;\n   Elysia::Genome::Genome twoOverlappingGenes;\n   Elysia::Genome::Chromosome *father=twoOverlappingGenes.mutable_fathers();\n   Elysia::Genome::Gene firstGene;\n   Elysia::Genome::Protein firstProtein;\n   firstProtein.set_protein_code(GROW_NEURON);\/\/so we can easily identify where\n   firstProtein.set_density(0.125);   \n   Elysia::Genome::Protein firstAuxProtein;\n   firstAuxProtein.set_protein_code(GROW_LEAF);\/\/so we see that they are additive\n   firstAuxProtein.set_density(0.25);\n   *firstGene.add_external_proteins()=firstProtein;\n   assert(firstGene.external_proteins(0).protein_code()==GROW_NEURON);\n   *firstGene.add_external_proteins()=firstAuxProtein;\n   assert(firstGene.external_proteins(1).protein_code()==GROW_LEAF);\n   Elysia::Genome::TemporalBoundingBox firstRegion;\n   firstRegion.set_minx(0);\n   firstRegion.set_miny(0);\n   firstRegion.set_minz(0);\n   firstRegion.set_maxx(2);\n   firstRegion.set_maxy(2);\n   firstRegion.set_maxz(2);\n\n   *firstGene.add_bounds()=firstRegion;\n\n   Elysia::Genome::TemporalBoundingBox firstTargetRegion;\n   firstTargetRegion.set_minx(5);\n   firstTargetRegion.set_miny(5);\n   firstTargetRegion.set_minz(5);\n   firstTargetRegion.set_maxx(8);\n   firstTargetRegion.set_maxy(8);\n   firstTargetRegion.set_maxz(8);\n\n   *firstGene.add_target_region()=firstTargetRegion;\n   Elysia::Genome::Gene secondGene;\n   Elysia::Genome::Protein secondProtein;\n   secondProtein.set_protein_code(GROW_LEAF);\n   secondProtein.set_density(0.5);\n   *secondGene.add_external_proteins()=secondProtein;\n   Elysia::Genome::TemporalBoundingBox secondRegion;\n   secondRegion.set_minx(-1);\n   secondRegion.set_miny(-1);\n   secondRegion.set_minz(-1);\n   secondRegion.set_maxx(1);\n   secondRegion.set_maxy(1);\n   secondRegion.set_maxz(1);\n   *secondGene.add_bounds()=secondRegion;\n\n   Elysia::Genome::TemporalBoundingBox secondTargetRegion;\n   secondTargetRegion.set_minx(-5);\n   secondTargetRegion.set_miny(-5);\n   secondTargetRegion.set_minz(-5);\n   secondTargetRegion.set_maxx(3);\n   secondTargetRegion.set_maxy(3);\n   secondTargetRegion.set_maxz(3);\n\n   *secondGene.add_target_region()=secondTargetRegion;\n\n\n   *father->add_genes()=firstGene;\n   *father->add_genes()=secondGene;\n   \n   ProteinEnvironment * pe=new SimpleProteinEnvironment;\n   pe->initialize(twoOverlappingGenes);\n   std::vector<std::pair<Elysia::Genome::Effect, float> > combinedResult=pe->getCompleteProteinDensity(Vector3f(.5,.5,.5));\n   \/\/check that firstResult matches expectations\n   std::vector<std::pair<Elysia::Genome::Effect, float> > firstResult=pe->getCompleteProteinDensity(Vector3f(1.5,1.5,1.5));\n   \/\/check that secondResult matches expectations\n   std::vector<std::pair<Elysia::Genome::Effect, float> > secondResult=pe->getCompleteProteinDensity(Vector3f(-.5,-.5,-.5));\n   float grow_leaf_count=0;\n   float grow_neuron_count=0;\n   float other_count=0;\n\n   testResultHelper(combinedResult,&grow_leaf_count,&grow_neuron_count,&other_count);\n   assert(grow_leaf_count==.75);\n   assert(grow_neuron_count==.125);\n   assert(other_count==0);\n\n   testResultHelper(firstResult,&grow_leaf_count,&grow_neuron_count,&other_count);\n   assert(grow_leaf_count==.25);\n   assert(grow_neuron_count==.125);\n   assert(other_count==0);\n\n   testResultHelper(secondResult,&grow_leaf_count,&grow_neuron_count,&other_count);\n   assert(grow_leaf_count==.5);\n   assert(grow_neuron_count==0);\n   assert(other_count==0);\n   return;\/\/UNCOMMENT TO GET FAILING TEST\n   const Gene * grow_neuron_gene = &pe->retrieveGene(Vector3f(0.5,0.5,0.5),\n                                              GROW_NEURON);\n   const Gene * combined_grow_leaf_gene = &pe->retrieveGene(Vector3f(0.5,0.5,0.5),\n                                                     GROW_LEAF);\n   const Gene * first_grow_leaf_gene = &pe->retrieveGene(Vector3f(1.5,1.5,1.5),\n                                                  GROW_LEAF);\n   const Gene * second_grow_leaf_gene = &pe->retrieveGene(Vector3f(-0.5,-0.5,-0.5),\n                                                   GROW_LEAF);\n   assert(grow_neuron_gene->target_region(0).minx()==5);\n   assert(combined_grow_leaf_gene->target_region(0).minx()==5||\n          combined_grow_leaf_gene->target_region(0).minx()==-5);\n   assert(first_grow_leaf_gene->target_region(0).minx()==5);\n   assert(second_grow_leaf_gene->target_region(0).minx()==-5);\n\n   delete pe;\n}\n}\n\nint runtest(){\n    Elysia::testTwoConnectedNeurons();\n    Elysia::testProteinEnvironment();\n\t\/\/getchar();\n\treturn 1;\n\t\n}\nvoid testProteinEnvironment() {\n   using namespace Elysia::Genome;\n   Elysia::Genome::Genome twoOverlappingGenes;\n   Elysia::Genome::Chromosome *father=twoOverlappingGenes.mutable_fathers();\n   Elysia::Genome::Gene firstGene;\n   Elysia::Genome::Protein firstProtein;\n   firstProtein.set_protein_code(GROW_NEURON);\/\/so we can easily identify where\n   firstProtein.set_density(0.125);   \n   Elysia::Genome::Protein firstAuxProtein;\n   firstProtein.set_protein_code(GROW_LEAF);\/\/so we see that they are additive\n   firstProtein.set_density(0.25);\n   *firstGene.add_external_proteins()=firstProtein;\n   *firstGene.add_external_proteins()=firstAuxProtein;\n   Elysia::Genome::TemporalBoundingBox firstRegion;\n   firstRegion.set_minx(0);\n   firstRegion.set_miny(0);\n   firstRegion.set_minz(0);\n   firstRegion.set_maxx(2);\n   firstRegion.set_maxy(2);\n   firstRegion.set_maxz(2);\n\n   *firstGene.add_bounds()=firstRegion;\n   Elysia::Genome::Gene secondGene;\n   Elysia::Genome::Protein secondProtein;\n   secondProtein.set_protein_code(GROW_LEAF);\n   secondProtein.set_density(0.5);\n   *secondGene.add_external_proteins()=secondProtein;\n   Elysia::Genome::TemporalBoundingBox secondRegion;\n   secondRegion.set_minx(-1);\n   secondRegion.set_miny(-1);\n   secondRegion.set_minz(-1);\n   secondRegion.set_maxx(1);\n   secondRegion.set_maxy(1);\n   secondRegion.set_maxz(1);\n   *secondGene.add_bounds()=secondRegion;\n   *father->add_genes()=firstGene;\n   *father->add_genes()=secondGene;\n   \n   ProteinEnvironment * pe=new SimpleProteinEnvironment;\n   pe->initialize(twoOverlappingGenes);\n   std::vector<std::pair<Elysia::Genome::Effect, float> > combinedResult=pe->getCompleteProteinDensity(Vector3f(.5,.5,.5));\n   \/\/check that firstResult matches expectations\n   std::vector<std::pair<Elysia::Genome::Effect, float> > firstResult=pe->getCompleteProteinDensity(Vector3f(1.5,1.5,1.5));\n   \/\/check that secondResult matches expectations\n   std::vector<std::pair<Elysia::Genome::Effect, float> > secondResult=pe->getCompleteProteinDensity(Vector3f(-.5,-.5,-.5));\n   assert(combinedResult.size()==2);\n   assert(firstResult.size()==2);\n   assert(secondResult.size()==1);\n   assert((combinedResult[0].first==GROW_LEAF&&combinedResult[0].second==.75)||\n          (combinedResult[1].first==GROW_LEAF&&combinedResult[1].second==.75));\n   assert((combinedResult[0].first==GROW_NEURON&&combinedResult[0].second==.125)||\n          (combinedResult[1].first==GROW_NEURON&&combinedResult[1].second==.125));\n   assert((firstResult[0].first==GROW_LEAF&&firstResult[0].second==.25)||\n          (firstResult[1].first==GROW_LEAF&&firstResult[1].second==.25));\n   assert((firstResult[0].first==GROW_NEURON&&firstResult[0].second==.125)||\n          (firstResult[1].first==GROW_NEURON&&firstResult[1].second==.125));\n   assert(secondResult[0].first==GROW_LEAF&&secondResult[0].second==.5);\n   delete pe;\n}\n}\n\nint runtest(){\n    Elysia::testTwoConnectedNeurons();\n    \/\/Elysia::testProteinEnvironment();\n\t\/\/getchar();\n\treturn 1;\n\t\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"vtkMoabReader.h\"\n\n#include \"SimpleMoab.h\"\n#include \"DataSetConverter.h\"\n\n\n#include \"vtkNew.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkInformation.h\"\n#include \"vtkInformationVector.h\"\n#include \"vtkMultiBlockDataSet.h\"\n#include \"vtkUnstructuredGrid.h\"\n\n#include \"vtkPolyData.h\"\n\n\nvtkStandardNewMacro(vtkMoabReader)\n\/\/------------------------------------------------------------------------------\nvtkMoabReader::vtkMoabReader()\n  {\n  this->SetNumberOfInputPorts(0);\n  this->FileName = NULL;\n  }\n\n\/\/------------------------------------------------------------------------------\nvtkMoabReader::~vtkMoabReader()\n  {\n  }\n\n\/\/------------------------------------------------------------------------------\nint vtkMoabReader::RequestInformation(vtkInformation *request,\n                       vtkInformationVector **inputVector,\n                       vtkInformationVector *outputVector)\n{\n\n  \/\/todo. Walk the file and display all the 2d and 3d elements that the users\n  \/\/could possibly want to load\n  return this->Superclass::RequestInformation(request,inputVector,outputVector);\n}\n\n\/\/------------------------------------------------------------------------------\nint vtkMoabReader::RequestData(vtkInformation *vtkNotUsed(request),\n                vtkInformationVector **vtkNotUsed(inputVector),\n                vtkInformationVector *outputVector)\n{\n  \/\/First pass is lets load in all 3d elements in a block called Volumes,\n  \/\/and load all 2d elements in a block called Surfaces\n\n  vtkInformation* outInfo = outputVector->GetInformationObject(0);\n  vtkMultiBlockDataSet *output =\n    vtkMultiBlockDataSet::SafeDownCast(outInfo->Get(vtkDataObject::DATA_OBJECT()));\n\n  vtkNew<vtkMultiBlockDataSet> volumeRoot;\n  vtkNew<vtkMultiBlockDataSet> boundaryRoot;\n  vtkNew<vtkMultiBlockDataSet> surfaceRoot;\n  vtkNew<vtkMultiBlockDataSet> materialRoot;\n  vtkNew<vtkMultiBlockDataSet> neumannRoot;\n  vtkNew<vtkMultiBlockDataSet> dirichletRoot;\n\n  const int blockIndex = output->GetNumberOfBlocks();\n  output->SetBlock(blockIndex,volumeRoot.GetPointer());\n  output->SetBlock(blockIndex+1,boundaryRoot.GetPointer());\n  output->SetBlock(blockIndex+2,surfaceRoot.GetPointer());\n  output->SetBlock(blockIndex+3,neumannRoot.GetPointer());\n  output->SetBlock(blockIndex+4,dirichletRoot.GetPointer());\n  output->SetBlock(blockIndex+5,materialRoot.GetPointer());\n\n  \/\/boring work, set the names of the blocks\n  output->GetMetaData(blockIndex)->Set(vtkCompositeDataSet::NAME(), \"Volumes\");\n  output->GetMetaData(blockIndex+1)->Set(vtkCompositeDataSet::NAME(), \"Boundary\");\n  output->GetMetaData(blockIndex+2)->Set(vtkCompositeDataSet::NAME(), \"Surfaces\");\n  output->GetMetaData(blockIndex+3)->Set(vtkCompositeDataSet::NAME(), \"Neumann Sets\");\n  output->GetMetaData(blockIndex+4)->Set(vtkCompositeDataSet::NAME(), \"Dirichlet Sets\");\n  output->GetMetaData(blockIndex+5)->Set(vtkCompositeDataSet::NAME(), \"Material Sets\");\n\n  smoab::GeomTag geom3Tag(3);\n  smoab::GeomTag geom2Tag(2);\n  smoab::GeomTag geom1Tag(1);\n  smoab::NeumannTag neTag;\n  smoab::DirichletTag diTag;\n  smoab::MaterialTag metTag;\n\n  smoab::Interface interface(this->FileName);\n\n  this->CreateSubBlocks(volumeRoot, &interface, &geom3Tag);\n  this->CreateSubBlocks(boundaryRoot, &interface, &geom3Tag, &geom2Tag);\n\n  this->CreateSubBlocks(surfaceRoot, &interface, &geom2Tag);\n  this->CreateSubBlocks(neumannRoot, &interface, &neTag);\n  this->CreateSubBlocks(dirichletRoot, &interface, &diTag);\n\n  \/\/this->CreateSubBlocks(materialRoot, &interface, &metTag); \/\/ no points\n  this->CreateSubBlocks(materialRoot, &interface, &metTag,  &geom3Tag);\n\n  return 1;\n}\n\n\n\/\/------------------------------------------------------------------------------\nvoid vtkMoabReader::CreateSubBlocks(vtkNew<vtkMultiBlockDataSet> & root,\n                                    smoab::Interface* interface,\n                                    smoab::Tag const* parentTag,\n                                    smoab::Tag const* extractTag)\n{\n  if(!extractTag)\n    {\n    extractTag = parentTag;\n    }\n  \/\/basic premise: query the database for all tagged elements and create a new\n  \/\/multiblock elemenent for each\n  smoab::DataSetConverter converter(*interface,extractTag);\n  converter.readMaterialIds(true);\n  converter.readProperties(true);\n\n  smoab::EntityHandle rootHandle = interface->getRoot();\n  smoab::Range parents = interface->findEntityRootParents(rootHandle);\n  smoab::Range dimEnts = interface->findEntitiesWithTag(*parentTag,\n                                                       rootHandle);\n\n  smoab::Range geomParents = smoab::intersect(parents,dimEnts);\n\n  parents.clear(); \/\/remove this range as it is unneeded\n  dimEnts.clear();\n\n  \/\/now each item in range can be extracted into a different grid\n  typedef smoab::Range::iterator iterator;\n  vtkIdType index = 0;\n  for(iterator i=geomParents.begin(); i != geomParents.end(); ++i)\n    {\n    vtkNew<vtkUnstructuredGrid> block;\n    \/\/fill the dataset with geometry and properties\n    converter.fill(*i, block.GetPointer(),index);\n\n    \/\/only add it if we have cells found\n    if(block->GetNumberOfCells() > 0)\n      {\n      root->SetBlock(index,block.GetPointer());\n      std::string name = interface->name(*i);\n      if(name.size() > 0)\n        {\n        std::cout << index << ' ' << name << std::endl;\n        root->GetMetaData(index)->Set(vtkCompositeDataSet::NAME(), name.c_str());\n        }\n      ++index;\n      }\n    }\n}\n\n\/\/------------------------------------------------------------------------------\nvoid vtkMoabReader::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os,indent);\n}\n<commit_msg>fix a leak<commit_after>#include \"vtkMoabReader.h\"\n\n#include \"SimpleMoab.h\"\n#include \"DataSetConverter.h\"\n\n\n#include \"vtkNew.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkInformation.h\"\n#include \"vtkInformationVector.h\"\n#include \"vtkMultiBlockDataSet.h\"\n#include \"vtkUnstructuredGrid.h\"\n\n#include \"vtkPolyData.h\"\n\n\nvtkStandardNewMacro(vtkMoabReader)\n\/\/------------------------------------------------------------------------------\nvtkMoabReader::vtkMoabReader()\n  {\n  this->SetNumberOfInputPorts(0);\n  this->FileName = NULL;\n  }\n\n\/\/------------------------------------------------------------------------------\nvtkMoabReader::~vtkMoabReader()\n  {\n  delete[](this->FileName);\n  }\n\n\/\/------------------------------------------------------------------------------\nint vtkMoabReader::RequestInformation(vtkInformation *request,\n                       vtkInformationVector **inputVector,\n                       vtkInformationVector *outputVector)\n{\n\n  \/\/todo. Walk the file and display all the 2d and 3d elements that the users\n  \/\/could possibly want to load\n  return this->Superclass::RequestInformation(request,inputVector,outputVector);\n}\n\n\/\/------------------------------------------------------------------------------\nint vtkMoabReader::RequestData(vtkInformation *vtkNotUsed(request),\n                vtkInformationVector **vtkNotUsed(inputVector),\n                vtkInformationVector *outputVector)\n{\n  \/\/First pass is lets load in all 3d elements in a block called Volumes,\n  \/\/and load all 2d elements in a block called Surfaces\n\n  vtkInformation* outInfo = outputVector->GetInformationObject(0);\n  vtkMultiBlockDataSet *output =\n    vtkMultiBlockDataSet::SafeDownCast(outInfo->Get(vtkDataObject::DATA_OBJECT()));\n\n  vtkNew<vtkMultiBlockDataSet> volumeRoot;\n  vtkNew<vtkMultiBlockDataSet> boundaryRoot;\n  vtkNew<vtkMultiBlockDataSet> surfaceRoot;\n  vtkNew<vtkMultiBlockDataSet> materialRoot;\n  vtkNew<vtkMultiBlockDataSet> neumannRoot;\n  vtkNew<vtkMultiBlockDataSet> dirichletRoot;\n\n  const int blockIndex = output->GetNumberOfBlocks();\n  output->SetBlock(blockIndex,volumeRoot.GetPointer());\n  output->SetBlock(blockIndex+1,boundaryRoot.GetPointer());\n  output->SetBlock(blockIndex+2,surfaceRoot.GetPointer());\n  output->SetBlock(blockIndex+3,neumannRoot.GetPointer());\n  output->SetBlock(blockIndex+4,dirichletRoot.GetPointer());\n  output->SetBlock(blockIndex+5,materialRoot.GetPointer());\n\n  \/\/boring work, set the names of the blocks\n  output->GetMetaData(blockIndex)->Set(vtkCompositeDataSet::NAME(), \"Volumes\");\n  output->GetMetaData(blockIndex+1)->Set(vtkCompositeDataSet::NAME(), \"Boundary\");\n  output->GetMetaData(blockIndex+2)->Set(vtkCompositeDataSet::NAME(), \"Surfaces\");\n  output->GetMetaData(blockIndex+3)->Set(vtkCompositeDataSet::NAME(), \"Neumann Sets\");\n  output->GetMetaData(blockIndex+4)->Set(vtkCompositeDataSet::NAME(), \"Dirichlet Sets\");\n  output->GetMetaData(blockIndex+5)->Set(vtkCompositeDataSet::NAME(), \"Material Sets\");\n\n  smoab::GeomTag geom3Tag(3);\n  smoab::GeomTag geom2Tag(2);\n  smoab::GeomTag geom1Tag(1);\n  smoab::NeumannTag neTag;\n  smoab::DirichletTag diTag;\n  smoab::MaterialTag metTag;\n\n  smoab::Interface interface(this->FileName);\n\n  this->CreateSubBlocks(volumeRoot, &interface, &geom3Tag);\n  this->CreateSubBlocks(boundaryRoot, &interface, &geom3Tag, &geom2Tag);\n\n  this->CreateSubBlocks(surfaceRoot, &interface, &geom2Tag);\n  this->CreateSubBlocks(neumannRoot, &interface, &neTag);\n  this->CreateSubBlocks(dirichletRoot, &interface, &diTag);\n\n  \/\/this->CreateSubBlocks(materialRoot, &interface, &metTag); \/\/ no points\n  this->CreateSubBlocks(materialRoot, &interface, &metTag,  &geom3Tag);\n\n  return 1;\n}\n\n\n\/\/------------------------------------------------------------------------------\nvoid vtkMoabReader::CreateSubBlocks(vtkNew<vtkMultiBlockDataSet> & root,\n                                    smoab::Interface* interface,\n                                    smoab::Tag const* parentTag,\n                                    smoab::Tag const* extractTag)\n{\n  if(!extractTag)\n    {\n    extractTag = parentTag;\n    }\n  \/\/basic premise: query the database for all tagged elements and create a new\n  \/\/multiblock elemenent for each\n  smoab::DataSetConverter converter(*interface,extractTag);\n  converter.readMaterialIds(true);\n  converter.readProperties(true);\n\n  smoab::EntityHandle rootHandle = interface->getRoot();\n  smoab::Range parents = interface->findEntityRootParents(rootHandle);\n  smoab::Range dimEnts = interface->findEntitiesWithTag(*parentTag,\n                                                       rootHandle);\n\n  smoab::Range geomParents = smoab::intersect(parents,dimEnts);\n\n  parents.clear(); \/\/remove this range as it is unneeded\n  dimEnts.clear();\n\n  \/\/now each item in range can be extracted into a different grid\n  typedef smoab::Range::iterator iterator;\n  vtkIdType index = 0;\n  for(iterator i=geomParents.begin(); i != geomParents.end(); ++i)\n    {\n    vtkNew<vtkUnstructuredGrid> block;\n    \/\/fill the dataset with geometry and properties\n    converter.fill(*i, block.GetPointer(),index);\n\n    \/\/only add it if we have cells found\n    if(block->GetNumberOfCells() > 0)\n      {\n      root->SetBlock(index,block.GetPointer());\n      std::string name = interface->name(*i);\n      if(name.size() > 0)\n        {\n        std::cout << index << ' ' << name << std::endl;\n        root->GetMetaData(index)->Set(vtkCompositeDataSet::NAME(), name.c_str());\n        }\n      ++index;\n      }\n    }\n}\n\n\/\/------------------------------------------------------------------------------\nvoid vtkMoabReader::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os,indent);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"oniguruma.h\"\n#include \"onig-scanner.h\"\n#include \"onig-reg-exp.h\"\n#include \"onig-result.h\"\n#include \"unicode-utils.h\"\n\nvoid OnigScanner::Init(Handle<Object> target) {\n  Local<FunctionTemplate> tpl = FunctionTemplate::New(OnigScanner::New);\n  tpl->SetClassName(String::NewSymbol(\"OnigScanner\"));\n  tpl->InstanceTemplate()->SetInternalFieldCount(1);\n  tpl->PrototypeTemplate()->Set(String::NewSymbol(\"findNextMatch\"), FunctionTemplate::New(OnigScanner::FindNextMatch)->GetFunction());\n\n  Persistent<Function> constructor = Persistent<Function>::New(tpl->GetFunction());\n  target->Set(String::NewSymbol(\"OnigScanner\"), constructor);\n}\n\nNODE_MODULE(onig_scanner, OnigScanner::Init)\n\nHandle<Value> OnigScanner::New(const Arguments& args) {\n  HandleScope scope;\n  OnigScanner* scanner = new OnigScanner(Local<Array>::Cast(args[0]));\n  scanner->Wrap(args.This());\n  return args.This();\n}\n\nHandle<Value> OnigScanner::FindNextMatch(const Arguments& args) {\n  HandleScope scope;\n  OnigScanner* scanner = node::ObjectWrap::Unwrap<OnigScanner>(args.This());\n  return scope.Close(scanner->FindNextMatch(Local<String>::Cast(args[0]), Local<Number>::Cast(args[1])));\n}\n\nOnigScanner::OnigScanner(Handle<Array> sources) {\n  int length = sources->Length();\n  regExps.resize(length);\n  cachedResults.resize(length);\n\n  for (int i = 0; i < length; i++) {\n    String::Utf8Value utf8Value(sources->Get(i));\n    regExps[i] = unique_ptr<OnigRegExp>(new OnigRegExp(string(*utf8Value)));\n  }\n};\n\nOnigScanner::~OnigScanner() {};\n\nHandle<Value> OnigScanner::FindNextMatch(Handle<String> v8String, Handle<Number> v8StartLocation) {\n  String::Utf8Value utf8Value(v8String);\n  string string(*utf8Value);\n  int startLocation = UnicodeUtils::bytes_in_characters(string.data(), v8StartLocation->Value());\n  int bestIndex = -1;\n  int bestLocation = NULL;\n  OnigResult* bestResult = NULL;\n\n  bool useCachedResults = (string == lastMatchedString && startLocation >= lastStartLocation);\n  lastStartLocation = startLocation;\n\n  if (!useCachedResults) {\n    ClearCachedResults();\n    lastMatchedString = string;\n  }\n\n  vector<unique_ptr<OnigRegExp>>::iterator iter = regExps.begin();\n  int index = 0;\n  while (iter < regExps.end()) {\n    OnigRegExp *regExp = (*iter).get();\n\n    bool useCachedResult = false;\n    OnigResult *result = nullptr;\n\n    \/\/ In Oniguruma, \\G is based on the start position of the match, so the result\n    \/\/ changes based on the start position. So it can't be cached.\n    bool containsBackslashG = regExp->Contains(\"\\\\G\");\n    if (useCachedResults && index <= maxCachedIndex && ! containsBackslashG) {\n      result = cachedResults[index].get();\n      useCachedResult = (result == NULL || result->LocationAt(0) >= startLocation);\n    }\n\n    if (!useCachedResult) {\n      result = regExp->Search(string, startLocation);\n      cachedResults[index] = unique_ptr<OnigResult>(result);\n      maxCachedIndex = index;\n    }\n\n    if (result && result->Count() > 0) {\n      int location = result->LocationAt(0);\n      if (bestIndex == -1 || location < bestLocation) {\n        bestLocation = location;\n        bestResult = result;\n        bestIndex = index;\n      }\n\n      if (location == startLocation) {\n        break;\n      }\n    }\n\n    iter++;\n    index++;\n  }\n\n  if (bestIndex >= 0) {\n    Local<Object> result = Object::New();\n    result->Set(String::NewSymbol(\"index\"), Number::New(bestIndex));\n    result->Set(String::NewSymbol(\"captureIndices\"), CaptureIndicesForMatch(bestResult));\n    return result;\n  }\n  else {\n    return Null();\n  }\n}\n\nvoid OnigScanner::ClearCachedResults() {\n  maxCachedIndex = -1;\n  cachedResults.clear();\n}\n\nHandle<Value> OnigScanner::CaptureIndicesForMatch(OnigResult* result) {\n  int resultCount = result->Count();\n  Local<Array> array = Array::New(resultCount * 3);\n  int i = 0;\n  for (int index = 0; index < resultCount; index++) {\n    int captureLength = result->LengthAt(index);\n    int captureStart = result->LocationAt(index);\n\n    array->Set(i++, Number::New(index));\n    array->Set(i++, Number::New(captureStart));\n    array->Set(i++, Number::New(captureStart + captureLength));\n  }\n\n  return array;\n}\n<commit_msg>Remove check for \\G in regex scanner :<commit_after>#include \"oniguruma.h\"\n#include \"onig-scanner.h\"\n#include \"onig-reg-exp.h\"\n#include \"onig-result.h\"\n#include \"unicode-utils.h\"\n\nvoid OnigScanner::Init(Handle<Object> target) {\n  Local<FunctionTemplate> tpl = FunctionTemplate::New(OnigScanner::New);\n  tpl->SetClassName(String::NewSymbol(\"OnigScanner\"));\n  tpl->InstanceTemplate()->SetInternalFieldCount(1);\n  tpl->PrototypeTemplate()->Set(String::NewSymbol(\"findNextMatch\"), FunctionTemplate::New(OnigScanner::FindNextMatch)->GetFunction());\n\n  Persistent<Function> constructor = Persistent<Function>::New(tpl->GetFunction());\n  target->Set(String::NewSymbol(\"OnigScanner\"), constructor);\n}\n\nNODE_MODULE(onig_scanner, OnigScanner::Init)\n\nHandle<Value> OnigScanner::New(const Arguments& args) {\n  HandleScope scope;\n  OnigScanner* scanner = new OnigScanner(Local<Array>::Cast(args[0]));\n  scanner->Wrap(args.This());\n  return args.This();\n}\n\nHandle<Value> OnigScanner::FindNextMatch(const Arguments& args) {\n  HandleScope scope;\n  OnigScanner* scanner = node::ObjectWrap::Unwrap<OnigScanner>(args.This());\n  return scope.Close(scanner->FindNextMatch(Local<String>::Cast(args[0]), Local<Number>::Cast(args[1])));\n}\n\nOnigScanner::OnigScanner(Handle<Array> sources) {\n  int length = sources->Length();\n  regExps.resize(length);\n  cachedResults.resize(length);\n\n  for (int i = 0; i < length; i++) {\n    String::Utf8Value utf8Value(sources->Get(i));\n    regExps[i] = unique_ptr<OnigRegExp>(new OnigRegExp(string(*utf8Value)));\n  }\n};\n\nOnigScanner::~OnigScanner() {};\n\nHandle<Value> OnigScanner::FindNextMatch(Handle<String> v8String, Handle<Number> v8StartLocation) {\n  String::Utf8Value utf8Value(v8String);\n  string string(*utf8Value);\n  int startLocation = UnicodeUtils::bytes_in_characters(string.data(), v8StartLocation->Value());\n  int bestIndex = -1;\n  int bestLocation = NULL;\n  OnigResult* bestResult = NULL;\n\n  bool useCachedResults = (string == lastMatchedString && startLocation >= lastStartLocation);\n  lastStartLocation = startLocation;\n\n  if (!useCachedResults) {\n    ClearCachedResults();\n    lastMatchedString = string;\n  }\n\n  vector<unique_ptr<OnigRegExp>>::iterator iter = regExps.begin();\n  int index = 0;\n  while (iter < regExps.end()) {\n    OnigRegExp *regExp = (*iter).get();\n\n    bool useCachedResult = false;\n    OnigResult *result = nullptr;\n\n    if (useCachedResults && index <= maxCachedIndex) {\n      result = cachedResults[index].get();\n      useCachedResult = (result == NULL || result->LocationAt(0) >= startLocation);\n    }\n\n    if (!useCachedResult) {\n      result = regExp->Search(string, startLocation);\n      cachedResults[index] = unique_ptr<OnigResult>(result);\n      maxCachedIndex = index;\n    }\n\n    if (result && result->Count() > 0) {\n      int location = result->LocationAt(0);\n      if (bestIndex == -1 || location < bestLocation) {\n        bestLocation = location;\n        bestResult = result;\n        bestIndex = index;\n      }\n\n      if (location == startLocation) {\n        break;\n      }\n    }\n\n    iter++;\n    index++;\n  }\n\n  if (bestIndex >= 0) {\n    Local<Object> result = Object::New();\n    result->Set(String::NewSymbol(\"index\"), Number::New(bestIndex));\n    result->Set(String::NewSymbol(\"captureIndices\"), CaptureIndicesForMatch(bestResult));\n    return result;\n  }\n  else {\n    return Null();\n  }\n}\n\nvoid OnigScanner::ClearCachedResults() {\n  maxCachedIndex = -1;\n  cachedResults.clear();\n}\n\nHandle<Value> OnigScanner::CaptureIndicesForMatch(OnigResult* result) {\n  int resultCount = result->Count();\n  Local<Array> array = Array::New(resultCount * 3);\n  int i = 0;\n  for (int index = 0; index < resultCount; index++) {\n    int captureLength = result->LengthAt(index);\n    int captureStart = result->LocationAt(index);\n\n    array->Set(i++, Number::New(index));\n    array->Set(i++, Number::New(captureStart));\n    array->Set(i++, Number::New(captureStart + captureLength));\n  }\n\n  return array;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef STAN_MATH_PRIM_FUN_ZEROS_VECTOR_HPP\n#define STAN_MATH_PRIM_FUN_ZEROS_VECTOR_HPP\n\n#include <stan\/math\/prim\/err.hpp>\n#include <stan\/math\/prim\/fun\/Eigen.hpp>\n\nnamespace stan {\nnamespace math {\n\n\/**\n * Return a vector of zeros\n *\n * @param K size of the vector\n * @return A vector of size K with all elements initialised to 0.\n * @throw std::domain_error if K is negative.\n *\/\ninline Eigen::VectorXd zeros_vector(int K) {\n  check_nonnegative(\"ones_vector\", \"size\", K);\n  return Eigen::VectorXd::Zero(K);\n}\n\n}  \/\/ namespace math\n}  \/\/ namespace stan\n\n#endif\n<commit_msg>Report the correct function name<commit_after>#ifndef STAN_MATH_PRIM_FUN_ZEROS_VECTOR_HPP\n#define STAN_MATH_PRIM_FUN_ZEROS_VECTOR_HPP\n\n#include <stan\/math\/prim\/err.hpp>\n#include <stan\/math\/prim\/fun\/Eigen.hpp>\n\nnamespace stan {\nnamespace math {\n\n\/**\n * Return a vector of zeros\n *\n * @param K size of the vector\n * @return A vector of size K with all elements initialised to 0.\n * @throw std::domain_error if K is negative.\n *\/\ninline Eigen::VectorXd zeros_vector(int K) {\n  check_nonnegative(\"zeros_vector\", \"size\", K);\n  return Eigen::VectorXd::Zero(K);\n}\n\n}  \/\/ namespace math\n}  \/\/ namespace stan\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/* \n Esp.cpp - ESP8266-specific APIs\n Copyright (c) 2015 Ivan Grokhotkov. All rights reserved.\n This file is part of the esp8266 core for Arduino environment.\n \n This 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 \"Arduino.h\"\n\nextern \"C\" {\n#include \"user_interface.h\"\n}\n\n\/\/extern \"C\" void ets_wdt_init(uint32_t val);\nextern \"C\" void ets_wdt_enable(void);\nextern \"C\" void ets_wdt_disable(void);\nextern \"C\" void wdt_feed(void);\n\n\/**\n * User-defined Literals\n *  usage:\n *\n *   uint32_t = test = 10_MHz; \/\/ --> 10000000\n *\/\n\nunsigned long long operator\"\" _kHz(unsigned long long x) {\n    return x * 1000;\n}\n\nunsigned long long operator\"\" _MHz(unsigned long long x) {\n    return x * 1000 * 1000;\n}\n\nunsigned long long operator\"\" _GHz(unsigned long long x) {\n    return x * 1000 * 1000 * 1000;\n}\n\nunsigned long long operator\"\" _kBit(unsigned long long x) {\n    return x * 1024;\n}\n\nunsigned long long operator\"\" _MBit(unsigned long long x) {\n    return x * 1024 * 1024;\n}\n\nunsigned long long operator\"\" _GBit(unsigned long long x) {\n    return x * 1024 * 1024 * 1024;\n}\n\nunsigned long long operator\"\" _kB(unsigned long long x) {\n    return x * 1024;\n}\n\nunsigned long long operator\"\" _MB(unsigned long long x) {\n    return x * 1024 * 1024;\n}\n\nunsigned long long operator\"\" _GB(unsigned long long x) {\n    return x * 1024 * 1024 * 1024;\n}\n\n\nEspClass ESP;\n\nEspClass::EspClass()\n{\n\n}\n\nvoid EspClass::wdtEnable(uint32_t timeout_ms)\n{\n    \/\/todo find doku for ets_wdt_init may set the timeout\n\tets_wdt_enable();\n}\n\nvoid EspClass::wdtEnable(WDTO_t timeout_ms)\n{\n    wdtEnable((uint32_t) timeout_ms);\n}\n\nvoid EspClass::wdtDisable(void)\n{\n\tets_wdt_disable();\n}\n\nvoid EspClass::wdtFeed(void)\n{\n\twdt_feed();\n}\n\nvoid EspClass::deepSleep(uint32_t time_us, WakeMode mode)\n{\n\tsystem_deep_sleep_set_option(static_cast<int>(mode));\n \tsystem_deep_sleep(time_us);\n}\n\nvoid EspClass::reset(void)\n{\n\t((void (*)(void))0x40000080)();\n}\n\nvoid EspClass::restart(void)\n{\n    system_restart();\n}\n\nuint16_t EspClass::getVcc(void)\n{\n    return system_get_vdd33();\n}\n\nuint32_t EspClass::getFreeHeap(void)\n{\n    return system_get_free_heap_size();\n}\n\nuint32_t EspClass::getChipId(void)\n{\n    return system_get_chip_id();\n}\n\nconst char * EspClass::getSdkVersion(void)\n{\n    return system_get_sdk_version();\n}\n\nuint8_t EspClass::getBootVersion(void)\n{\n    return system_get_boot_version();\n}\n\nuint8_t EspClass::getBootMode(void)\n{\n    return system_get_boot_mode();\n}\n\nuint8_t EspClass::getCpuFreqMHz(void)\n{\n    return system_get_cpu_freq();\n}\n\n\nuint32_t EspClass::getFlashChipId(void)\n{\n    return spi_flash_get_id();\n}\n\nuint32_t EspClass::getFlashChipSize(void)\n{\n    uint32_t data;\n    uint8_t * bytes = (uint8_t *) &data;\n    \/\/ read first 4 byte (magic byte + flash config)\n    if(spi_flash_read(0x0000, &data, 4) == SPI_FLASH_RESULT_OK) {\n        switch((bytes[3] & 0xf0) >> 4) {\n            case 0x0: \/\/ 4 Mbit (512KB)\n                return (512_kB);\n            case 0x1: \/\/ 2 MBit (256KB)\n                return (256_kB);\n            case 0x2: \/\/ 8 MBit (1MB)\n                return (1_MB);\n            case 0x3: \/\/ 16 MBit (2MB)\n                return (2_MB);\n            case 0x4: \/\/ 32 MBit (4MB)\n                return (4_MB);\n            default: \/\/ fail?\n                return 0;\n        }\n    }\n    return 0;\n}\n\nuint32_t EspClass::getFlashChipSpeed(void)\n{\n    uint32_t data;\n    uint8_t * bytes = (uint8_t *) &data;\n    \/\/ read first 4 byte (magic byte + flash config)\n    if(spi_flash_read(0x0000, &data, 4) == SPI_FLASH_RESULT_OK) {\n        switch(bytes[3] & 0x0F) {\n            case 0x0: \/\/ 40 MHz\n                return (40_MHz);\n            case 0x1: \/\/ 26 MHz\n                return (26_MHz);\n            case 0x2: \/\/ 20 MHz\n                return (20_MHz);\n            case 0xf: \/\/ 80 MHz\n                return (80_MHz);\n            default: \/\/ fail?\n                return 0;\n        }\n    }\n    return 0;\n}\n\nFlashMode_t EspClass::getFlashChipMode(void)\n{\n    FlashMode_t mode = FM_UNKNOWN;\n    uint32_t data;\n    uint8_t * bytes = (uint8_t *) &data;\n    \/\/ read first 4 byte (magic byte + flash config)\n    if(spi_flash_read(0x0000, &data, 4) == SPI_FLASH_RESULT_OK) {\n        mode = (FlashMode_t) bytes[2];\n        if(mode > FM_DOUT) {\n            mode = FM_UNKNOWN;\n        }\n    }\n    return mode;\n}\n\n\/**\n * Infos from\n *  http:\/\/www.wlxmall.com\/images\/stock_item\/att\/A1010004.pdf\n *  http:\/\/www.gigadevice.com\/product-series\/5.html?locale=en_US\n *\/\nuint32_t EspClass::getFlashChipSizeByChipId(void) {\n    uint32_t chipId = getFlashChipId();\n    switch(chipId) {\n        case 0x1740C8: \/\/ GD25Q64B\n            return (8_MB);\n        case 0x1640C8: \/\/ GD25Q32B\n            return (4_MB);\n        case 0x1540C8: \/\/ GD25Q16B\n            return (2_MB);\n        case 0x1440C8: \/\/ GD25Q80\n            return (1_MB);\n        case 0x1340C8: \/\/ GD25Q40\n            return (512_kB);\n        case 0x1240C8: \/\/ GD25Q20\n            return (256_kB);\n        case 0x1140C8: \/\/ GD25Q10\n            return (128_kB);\n        case 0x1040C8: \/\/ GD25Q12\n            return (64_kB);\n        default:\n            return 0;\n    }\n}\n<commit_msg>add Winbond flash chip Ids<commit_after>\/* \n Esp.cpp - ESP8266-specific APIs\n Copyright (c) 2015 Ivan Grokhotkov. All rights reserved.\n This file is part of the esp8266 core for Arduino environment.\n \n This 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 \"Arduino.h\"\n\nextern \"C\" {\n#include \"user_interface.h\"\n}\n\n\/\/extern \"C\" void ets_wdt_init(uint32_t val);\nextern \"C\" void ets_wdt_enable(void);\nextern \"C\" void ets_wdt_disable(void);\nextern \"C\" void wdt_feed(void);\n\n\/**\n * User-defined Literals\n *  usage:\n *\n *   uint32_t = test = 10_MHz; \/\/ --> 10000000\n *\/\n\nunsigned long long operator\"\" _kHz(unsigned long long x) {\n    return x * 1000;\n}\n\nunsigned long long operator\"\" _MHz(unsigned long long x) {\n    return x * 1000 * 1000;\n}\n\nunsigned long long operator\"\" _GHz(unsigned long long x) {\n    return x * 1000 * 1000 * 1000;\n}\n\nunsigned long long operator\"\" _kBit(unsigned long long x) {\n    return x * 1024;\n}\n\nunsigned long long operator\"\" _MBit(unsigned long long x) {\n    return x * 1024 * 1024;\n}\n\nunsigned long long operator\"\" _GBit(unsigned long long x) {\n    return x * 1024 * 1024 * 1024;\n}\n\nunsigned long long operator\"\" _kB(unsigned long long x) {\n    return x * 1024;\n}\n\nunsigned long long operator\"\" _MB(unsigned long long x) {\n    return x * 1024 * 1024;\n}\n\nunsigned long long operator\"\" _GB(unsigned long long x) {\n    return x * 1024 * 1024 * 1024;\n}\n\n\nEspClass ESP;\n\nEspClass::EspClass()\n{\n\n}\n\nvoid EspClass::wdtEnable(uint32_t timeout_ms)\n{\n    \/\/todo find doku for ets_wdt_init may set the timeout\n\tets_wdt_enable();\n}\n\nvoid EspClass::wdtEnable(WDTO_t timeout_ms)\n{\n    wdtEnable((uint32_t) timeout_ms);\n}\n\nvoid EspClass::wdtDisable(void)\n{\n\tets_wdt_disable();\n}\n\nvoid EspClass::wdtFeed(void)\n{\n\twdt_feed();\n}\n\nvoid EspClass::deepSleep(uint32_t time_us, WakeMode mode)\n{\n\tsystem_deep_sleep_set_option(static_cast<int>(mode));\n \tsystem_deep_sleep(time_us);\n}\n\nvoid EspClass::reset(void)\n{\n\t((void (*)(void))0x40000080)();\n}\n\nvoid EspClass::restart(void)\n{\n    system_restart();\n}\n\nuint16_t EspClass::getVcc(void)\n{\n    return system_get_vdd33();\n}\n\nuint32_t EspClass::getFreeHeap(void)\n{\n    return system_get_free_heap_size();\n}\n\nuint32_t EspClass::getChipId(void)\n{\n    return system_get_chip_id();\n}\n\nconst char * EspClass::getSdkVersion(void)\n{\n    return system_get_sdk_version();\n}\n\nuint8_t EspClass::getBootVersion(void)\n{\n    return system_get_boot_version();\n}\n\nuint8_t EspClass::getBootMode(void)\n{\n    return system_get_boot_mode();\n}\n\nuint8_t EspClass::getCpuFreqMHz(void)\n{\n    return system_get_cpu_freq();\n}\n\n\nuint32_t EspClass::getFlashChipId(void)\n{\n    return spi_flash_get_id();\n}\n\nuint32_t EspClass::getFlashChipSize(void)\n{\n    uint32_t data;\n    uint8_t * bytes = (uint8_t *) &data;\n    \/\/ read first 4 byte (magic byte + flash config)\n    if(spi_flash_read(0x0000, &data, 4) == SPI_FLASH_RESULT_OK) {\n        switch((bytes[3] & 0xf0) >> 4) {\n            case 0x0: \/\/ 4 Mbit (512KB)\n                return (512_kB);\n            case 0x1: \/\/ 2 MBit (256KB)\n                return (256_kB);\n            case 0x2: \/\/ 8 MBit (1MB)\n                return (1_MB);\n            case 0x3: \/\/ 16 MBit (2MB)\n                return (2_MB);\n            case 0x4: \/\/ 32 MBit (4MB)\n                return (4_MB);\n            default: \/\/ fail?\n                return 0;\n        }\n    }\n    return 0;\n}\n\nuint32_t EspClass::getFlashChipSpeed(void)\n{\n    uint32_t data;\n    uint8_t * bytes = (uint8_t *) &data;\n    \/\/ read first 4 byte (magic byte + flash config)\n    if(spi_flash_read(0x0000, &data, 4) == SPI_FLASH_RESULT_OK) {\n        switch(bytes[3] & 0x0F) {\n            case 0x0: \/\/ 40 MHz\n                return (40_MHz);\n            case 0x1: \/\/ 26 MHz\n                return (26_MHz);\n            case 0x2: \/\/ 20 MHz\n                return (20_MHz);\n            case 0xf: \/\/ 80 MHz\n                return (80_MHz);\n            default: \/\/ fail?\n                return 0;\n        }\n    }\n    return 0;\n}\n\nFlashMode_t EspClass::getFlashChipMode(void)\n{\n    FlashMode_t mode = FM_UNKNOWN;\n    uint32_t data;\n    uint8_t * bytes = (uint8_t *) &data;\n    \/\/ read first 4 byte (magic byte + flash config)\n    if(spi_flash_read(0x0000, &data, 4) == SPI_FLASH_RESULT_OK) {\n        mode = (FlashMode_t) bytes[2];\n        if(mode > FM_DOUT) {\n            mode = FM_UNKNOWN;\n        }\n    }\n    return mode;\n}\n\n\/**\n * Infos from\n *  http:\/\/www.wlxmall.com\/images\/stock_item\/att\/A1010004.pdf\n *  http:\/\/www.gigadevice.com\/product-series\/5.html?locale=en_US\n *  http:\/\/www.elinux.org\/images\/f\/f5\/Winbond-w25q32.pdf\n *\/\nuint32_t EspClass::getFlashChipSizeByChipId(void) {\n    uint32_t chipId = getFlashChipId();\n    switch(chipId) {\n\n        \/\/ GigaDevice\n        case 0x1740C8: \/\/ GD25Q64B\n            return (8_MB);\n        case 0x1640C8: \/\/ GD25Q32B\n            return (4_MB);\n        case 0x1540C8: \/\/ GD25Q16B\n            return (2_MB);\n        case 0x1440C8: \/\/ GD25Q80\n            return (1_MB);\n        case 0x1340C8: \/\/ GD25Q40\n            return (512_kB);\n        case 0x1240C8: \/\/ GD25Q20\n            return (256_kB);\n        case 0x1140C8: \/\/ GD25Q10\n            return (128_kB);\n        case 0x1040C8: \/\/ GD25Q12\n            return (64_kB);\n\n        \/\/ Winbond\n        case 0x1640EF: \/\/ W25Q32\n            return (4_MB);\n        case 0x1540EF: \/\/ W25Q16\n            return (2_MB);\n        case 0x1440EF: \/\/ W25Q80\n            return (1_MB);\n\n        default:\n            return 0;\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 <boost\/tuple\/tuple.hpp>\n\n#include <hpp\/core\/path-planner.hh>\n#include <hpp\/core\/nearest-neighbor.hh>\n#include <hpp\/util\/debug.hh>\n\n#include <hpp\/core\/roadmap.hh>\n#include <hpp\/core\/problem.hh>\n#include <hpp\/core\/problem-target.hh>\n#include <hpp\/core\/node.hh>\n#include <hpp\/core\/edge.hh>\n#include <hpp\/core\/path.hh>\n#include <hpp\/core\/path-validation.hh>\n#include <hpp\/core\/path-projector.hh>\n#include <hpp\/core\/steering-method.hh>\n#include \"astar.hh\"\n#include <hpp\/util\/timer.hh>\n\nnamespace hpp {\n  namespace core {\n    unsigned long int uint_infty = std::numeric_limits <unsigned long int>::infinity ();\n    value_type float_infty = std::numeric_limits <value_type>::infinity ();\n\n    PathPlanner::PathPlanner (const Problem& problem) :\n      problem_ (problem), roadmap_ (Roadmap::create (problem.distance (),\n\t\t\t\t\t\t     problem.robot())),\n      interrupt_ (false),\n      maxIterations_ (uint_infty),\n      timeOut_ (float_infty),\n      stopWhenProblemIsSolved_ (true)\n    {\n    }\n\n    PathPlanner::PathPlanner (const Problem& problem,\n\t\t\t      const RoadmapPtr_t& roadmap) :\n      problem_ (problem), roadmap_ (roadmap),\n      interrupt_ (false),\n      maxIterations_ (uint_infty),\n      timeOut_ (float_infty),\n      stopWhenProblemIsSolved_ (true)\n    {\n    }\n\n    void PathPlanner::init (const PathPlannerWkPtr_t& weak)\n    {\n      weakPtr_ = weak;\n    }\n\n    const RoadmapPtr_t& PathPlanner::roadmap () const\n    {\n      return roadmap_;\n    }\n\n    const Problem& PathPlanner::problem () const\n    {\n      return problem_;\n    }\n\n    void PathPlanner::startSolve ()\n    {\n      problem_.checkProblem ();\n      \/\/ Tag init and goal configurations in the roadmap\n      roadmap()->resetGoalNodes ();\n      roadmap()->initNode (problem_.initConfig ());\n      const Configurations_t goals (problem_.goalConfigs ());\n      for (Configurations_t::const_iterator itGoal = goals.begin ();\n          itGoal != goals.end (); ++itGoal) {\n        roadmap()->addGoalNode (*itGoal);\n      }\n\n      problem_.target()->check(roadmap());\n    }\n\n    PathVectorPtr_t PathPlanner::solve ()\n    {\n      namespace bpt = boost::posix_time;\n\n      interrupt_ = false;\n      bool solved = false;\n      unsigned long int nIter (0);\n      bpt::ptime timeStart(bpt::microsec_clock::universal_time());\n      startSolve ();\n      tryConnectInitAndGoals ();\n      solved = stopWhenProblemIsSolved_ && problem_.target()->reached (roadmap());\n      if (solved ) {\n\thppDout (info, \"tryConnectInitAndGoals succeeded\");\n      }\n      if (interrupt_) throw std::runtime_error (\"Interruption\");\n      while (!solved) {\n        \/\/ Check limits\n        std::ostringstream oss;\n        if (maxIterations_ != uint_infty && nIter >= maxIterations_) {\n          if (!stopWhenProblemIsSolved_\n              && problem_.target()->reached (roadmap())) break;\n          oss << \"Maximal number of iterations reached: \" << maxIterations_;\n          throw std::runtime_error (oss.str ().c_str ());\n        }\n        bpt::ptime timeStop(bpt::microsec_clock::universal_time());\n        if(static_cast<value_type>((timeStop - timeStart).total_milliseconds())\n            > timeOut_*1000){\n          if (!stopWhenProblemIsSolved_\n              && problem_.target()->reached (roadmap())) break;\n          oss << \"time out reached : \" << timeOut_<<\" s\";\n          throw std::runtime_error (oss.str ().c_str ());\n        }\n\n        \/\/ Execute one step\n        hppStartBenchmark(ONE_STEP);\n        oneStep ();\n        hppStopBenchmark(ONE_STEP);\n        hppDisplayBenchmark(ONE_STEP);\n\n        \/\/ Check if problem is solved.\n        ++nIter;\n        solved = stopWhenProblemIsSolved_ && problem_.target()->reached (roadmap());\n        if (interrupt_) throw std::runtime_error (\"Interruption\");\n      }\n      PathVectorPtr_t planned =  computePath ();\n      return finishSolve (planned);\n    }\n\n    void PathPlanner::interrupt ()\n    {\n      interrupt_ = true;\n    }\n\n    void PathPlanner::maxIterations (const unsigned long int& n)\n    {\n      if (!stopWhenProblemIsSolved_ && n == uint_infty && timeOut_ == float_infty)\n        throw std::invalid_argument(\"stopWhenProblemIsSolved is disabled so \"\n            \"maxIterations or timeOut must be finite.\");\n      maxIterations_ = n;\n    }\n\n    void PathPlanner::timeOut (const double& time)\n    {\n      if (!stopWhenProblemIsSolved_ && maxIterations_ == uint_infty && time == float_infty)\n        throw std::invalid_argument(\"stopWhenProblemIsSolved is disabled so \"\n            \"maxIterations or timeOut must be finite.\");\n      timeOut_ = time;\n    }\n\n    void PathPlanner::stopWhenProblemIsSolved(bool enable)\n    {\n      if (!enable && maxIterations_ == uint_infty && timeOut_ == float_infty)\n        throw std::invalid_argument(\"Disabling stopWhenProblemIsSolved is only \"\n            \"possible when maxIterations or timeOut are set to a finite value.\");\n      stopWhenProblemIsSolved_ = enable;\n    }\n\n    PathVectorPtr_t PathPlanner::computePath () const\n    {\n      return problem_.target()->computePath(roadmap());\n    }\n\n    PathVectorPtr_t PathPlanner::finishSolve (const PathVectorPtr_t& path)\n    {\n      return path;\n    }\n\n    void PathPlanner::tryDirectPath ()\n    {\n      \/\/ call steering method here to build a direct conexion\n      const SteeringMethodPtr_t& sm (problem ().steeringMethod ());\n      PathValidationPtr_t pathValidation (problem ().pathValidation ());\n      PathProjectorPtr_t pathProjector (problem ().pathProjector ());\n      PathPtr_t validPath, projPath, path;\n      NodePtr_t initNode = roadmap ()->initNode();\n      for (NodeVector_t::const_iterator itn = roadmap ()->goalNodes ().begin();\n\t   itn != roadmap ()->goalNodes ().end (); ++itn) {\n\tConfigurationPtr_t q1 ((initNode)->configuration ());\n\tConfigurationPtr_t q2 ((*itn)->configuration ());\n\tpath = (*sm) (*q1, *q2);\n        if (!path) continue;\n        if (pathProjector) {\n          if (!pathProjector->apply (path, projPath)) continue;\n        } else {\n          projPath = path;\n        }\n        if (projPath) {\n\t  PathValidationReportPtr_t report;\n          bool pathValid = pathValidation->validate (projPath, false, validPath,\n\t\t\t\t\t\t     report);\n          if (pathValid && validPath->length() > 0) {\n            roadmap ()->addEdge (initNode, *itn, projPath);\n            roadmap ()->addEdge (*itn, initNode, projPath->reverse());\n          }\n        }\n      }\n    }\n\n    void PathPlanner::tryConnectInitAndGoals ()\n    {\n      \/\/ call steering method here to build a direct conexion\n      const SteeringMethodPtr_t& sm (problem ().steeringMethod ());\n      PathValidationPtr_t pathValidation (problem ().pathValidation ());\n      PathProjectorPtr_t pathProjector (problem ().pathProjector ());\n      PathPtr_t validPath, projPath, path;\n      NodePtr_t initNode = roadmap ()->initNode();\n      NearestNeighborPtr_t nn (roadmap ()->nearestNeighbor ());\n      \/\/ Register edges to add to roadmap and add them after iterating\n      \/\/ among the connected components.\n      typedef boost::tuple <NodePtr_t, NodePtr_t, PathPtr_t> FutureEdge_t;\n      typedef std::vector <FutureEdge_t> FutureEdges_t;\n      FutureEdges_t futureEdges;\n      ConnectedComponentPtr_t initCC (initNode->connectedComponent ());\n      for (ConnectedComponents_t::iterator itCC\n             (roadmap ()->connectedComponents ().begin ());\n           itCC != roadmap ()->connectedComponents ().end (); ++itCC) {\n        if (*itCC != initCC) {\n          value_type d;\n          NodePtr_t near (nn->search (*initNode->configuration (),\n                                      *itCC, d, true));\n          assert (near);\n          ConfigurationPtr_t q1 (initNode->configuration ());\n          ConfigurationPtr_t q2 (near->configuration ());\n          path = (*sm) (*q1, *q2);\n          if (!path) continue;\n          if (pathProjector) {\n            if (!pathProjector->apply (path, projPath)) continue;\n          } else {\n            projPath = path;\n          }\n          if (projPath) {\n            PathValidationReportPtr_t report;\n            bool pathValid = pathValidation->validate (projPath, false,\n                                                       validPath, report);\n            if (pathValid && validPath->length() > 0) {\n              futureEdges.push_back (FutureEdge_t (initNode, near, projPath));\n            }\n          }\n        }\n      }\n      for (NodeVector_t::const_iterator itn = roadmap ()->goalNodes ().begin();\n\t   itn != roadmap ()->goalNodes ().end (); ++itn) {\n        ConnectedComponentPtr_t goalCC ((*itn)->connectedComponent ());\n        for (ConnectedComponents_t::iterator itCC\n               (roadmap ()->connectedComponents ().begin ());\n             itCC != roadmap ()->connectedComponents ().end (); ++itCC) {\n          if (*itCC != goalCC) {\n            value_type d;\n            NodePtr_t near (nn->search (*(*itn)->configuration (), *itCC, d,\n                                        false));\n            assert (near);\n            ConfigurationPtr_t q1 (near->configuration ());\n            ConfigurationPtr_t q2 ((*itn)->configuration ());\n            path = (*sm) (*q1, *q2);\n            if (!path) continue;\n            if (pathProjector) {\n              if (!pathProjector->apply (path, projPath)) continue;\n            } else {\n              projPath = path;\n            }\n            if (projPath) {\n              PathValidationReportPtr_t report;\n              bool pathValid = pathValidation->validate (projPath, false,\n                                                         validPath, report);\n              if (pathValid && validPath->length() > 0) {\n                futureEdges.push_back (FutureEdge_t (near, (*itn), projPath));\n              }\n            }\n          }\n        }\n      }\n      \/\/ Add edges\n      for (FutureEdges_t::const_iterator it (futureEdges.begin ());\n           it != futureEdges.end (); ++it) {\n        roadmap ()->addEdge (it->get <0> (), it->get <1> (), it->get <2> ());\n      }\n    }\n\n  } \/\/   namespace core\n} \/\/ namespace hpp\n<commit_msg>[PathPlanner] Stop resolution if direct path found even if stopWhenLimitReached<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 <boost\/tuple\/tuple.hpp>\n\n#include <hpp\/core\/path-planner.hh>\n#include <hpp\/core\/nearest-neighbor.hh>\n#include <hpp\/util\/debug.hh>\n\n#include <hpp\/core\/roadmap.hh>\n#include <hpp\/core\/problem.hh>\n#include <hpp\/core\/problem-target.hh>\n#include <hpp\/core\/node.hh>\n#include <hpp\/core\/edge.hh>\n#include <hpp\/core\/path.hh>\n#include <hpp\/core\/path-validation.hh>\n#include <hpp\/core\/path-projector.hh>\n#include <hpp\/core\/steering-method.hh>\n#include \"astar.hh\"\n#include <hpp\/util\/timer.hh>\n\nnamespace hpp {\n  namespace core {\n    unsigned long int uint_infty = std::numeric_limits <unsigned long int>::infinity ();\n    value_type float_infty = std::numeric_limits <value_type>::infinity ();\n\n    PathPlanner::PathPlanner (const Problem& problem) :\n      problem_ (problem), roadmap_ (Roadmap::create (problem.distance (),\n\t\t\t\t\t\t     problem.robot())),\n      interrupt_ (false),\n      maxIterations_ (uint_infty),\n      timeOut_ (float_infty),\n      stopWhenProblemIsSolved_ (true)\n    {\n    }\n\n    PathPlanner::PathPlanner (const Problem& problem,\n\t\t\t      const RoadmapPtr_t& roadmap) :\n      problem_ (problem), roadmap_ (roadmap),\n      interrupt_ (false),\n      maxIterations_ (uint_infty),\n      timeOut_ (float_infty),\n      stopWhenProblemIsSolved_ (true)\n    {\n    }\n\n    void PathPlanner::init (const PathPlannerWkPtr_t& weak)\n    {\n      weakPtr_ = weak;\n    }\n\n    const RoadmapPtr_t& PathPlanner::roadmap () const\n    {\n      return roadmap_;\n    }\n\n    const Problem& PathPlanner::problem () const\n    {\n      return problem_;\n    }\n\n    void PathPlanner::startSolve ()\n    {\n      problem_.checkProblem ();\n      \/\/ Tag init and goal configurations in the roadmap\n      roadmap()->resetGoalNodes ();\n      roadmap()->initNode (problem_.initConfig ());\n      const Configurations_t goals (problem_.goalConfigs ());\n      for (Configurations_t::const_iterator itGoal = goals.begin ();\n          itGoal != goals.end (); ++itGoal) {\n        roadmap()->addGoalNode (*itGoal);\n      }\n\n      problem_.target()->check(roadmap());\n    }\n\n    PathVectorPtr_t PathPlanner::solve ()\n    {\n      namespace bpt = boost::posix_time;\n\n      interrupt_ = false;\n      bool solved = false;\n      unsigned long int nIter (0);\n      bpt::ptime timeStart(bpt::microsec_clock::universal_time());\n      startSolve ();\n      tryConnectInitAndGoals ();\n      \/\/ We choose to stop if a direct path solves the problem.\n      \/\/ We could also respect the stopWhenLimitReached_ attribute.\n      \/\/ It is ambiguous what should be done as it is case dependent.\n      \/\/ If the intent is to build a roadmap, then we should not stop.\n      \/\/ If the intent is to solve a optimal planning problem, then we should stop.\n      solved = problem_.target()->reached (roadmap());\n      if (solved ) {\n\thppDout (info, \"tryConnectInitAndGoals succeeded\");\n      }\n      if (interrupt_) throw std::runtime_error (\"Interruption\");\n      while (!solved) {\n        \/\/ Check limits\n        std::ostringstream oss;\n        if (maxIterations_ != uint_infty && nIter >= maxIterations_) {\n          if (!stopWhenProblemIsSolved_\n              && problem_.target()->reached (roadmap())) break;\n          oss << \"Maximal number of iterations reached: \" << maxIterations_;\n          throw std::runtime_error (oss.str ().c_str ());\n        }\n        bpt::ptime timeStop(bpt::microsec_clock::universal_time());\n        if(static_cast<value_type>((timeStop - timeStart).total_milliseconds())\n            > timeOut_*1000){\n          if (!stopWhenProblemIsSolved_\n              && problem_.target()->reached (roadmap())) break;\n          oss << \"time out reached : \" << timeOut_<<\" s\";\n          throw std::runtime_error (oss.str ().c_str ());\n        }\n\n        \/\/ Execute one step\n        hppStartBenchmark(ONE_STEP);\n        oneStep ();\n        hppStopBenchmark(ONE_STEP);\n        hppDisplayBenchmark(ONE_STEP);\n\n        \/\/ Check if problem is solved.\n        ++nIter;\n        solved = stopWhenProblemIsSolved_ && problem_.target()->reached (roadmap());\n        if (interrupt_) throw std::runtime_error (\"Interruption\");\n      }\n      PathVectorPtr_t planned =  computePath ();\n      return finishSolve (planned);\n    }\n\n    void PathPlanner::interrupt ()\n    {\n      interrupt_ = true;\n    }\n\n    void PathPlanner::maxIterations (const unsigned long int& n)\n    {\n      if (!stopWhenProblemIsSolved_ && n == uint_infty && timeOut_ == float_infty)\n        throw std::invalid_argument(\"stopWhenProblemIsSolved is disabled so \"\n            \"maxIterations or timeOut must be finite.\");\n      maxIterations_ = n;\n    }\n\n    void PathPlanner::timeOut (const double& time)\n    {\n      if (!stopWhenProblemIsSolved_ && maxIterations_ == uint_infty && time == float_infty)\n        throw std::invalid_argument(\"stopWhenProblemIsSolved is disabled so \"\n            \"maxIterations or timeOut must be finite.\");\n      timeOut_ = time;\n    }\n\n    void PathPlanner::stopWhenProblemIsSolved(bool enable)\n    {\n      if (!enable && maxIterations_ == uint_infty && timeOut_ == float_infty)\n        throw std::invalid_argument(\"Disabling stopWhenProblemIsSolved is only \"\n            \"possible when maxIterations or timeOut are set to a finite value.\");\n      stopWhenProblemIsSolved_ = enable;\n    }\n\n    PathVectorPtr_t PathPlanner::computePath () const\n    {\n      return problem_.target()->computePath(roadmap());\n    }\n\n    PathVectorPtr_t PathPlanner::finishSolve (const PathVectorPtr_t& path)\n    {\n      return path;\n    }\n\n    void PathPlanner::tryDirectPath ()\n    {\n      \/\/ call steering method here to build a direct conexion\n      const SteeringMethodPtr_t& sm (problem ().steeringMethod ());\n      PathValidationPtr_t pathValidation (problem ().pathValidation ());\n      PathProjectorPtr_t pathProjector (problem ().pathProjector ());\n      PathPtr_t validPath, projPath, path;\n      NodePtr_t initNode = roadmap ()->initNode();\n      for (NodeVector_t::const_iterator itn = roadmap ()->goalNodes ().begin();\n\t   itn != roadmap ()->goalNodes ().end (); ++itn) {\n\tConfigurationPtr_t q1 ((initNode)->configuration ());\n\tConfigurationPtr_t q2 ((*itn)->configuration ());\n\tpath = (*sm) (*q1, *q2);\n        if (!path) continue;\n        if (pathProjector) {\n          if (!pathProjector->apply (path, projPath)) continue;\n        } else {\n          projPath = path;\n        }\n        if (projPath) {\n\t  PathValidationReportPtr_t report;\n          bool pathValid = pathValidation->validate (projPath, false, validPath,\n\t\t\t\t\t\t     report);\n          if (pathValid && validPath->length() > 0) {\n            roadmap ()->addEdge (initNode, *itn, projPath);\n            roadmap ()->addEdge (*itn, initNode, projPath->reverse());\n          }\n        }\n      }\n    }\n\n    void PathPlanner::tryConnectInitAndGoals ()\n    {\n      \/\/ call steering method here to build a direct conexion\n      const SteeringMethodPtr_t& sm (problem ().steeringMethod ());\n      PathValidationPtr_t pathValidation (problem ().pathValidation ());\n      PathProjectorPtr_t pathProjector (problem ().pathProjector ());\n      PathPtr_t validPath, projPath, path;\n      NodePtr_t initNode = roadmap ()->initNode();\n      NearestNeighborPtr_t nn (roadmap ()->nearestNeighbor ());\n      \/\/ Register edges to add to roadmap and add them after iterating\n      \/\/ among the connected components.\n      typedef boost::tuple <NodePtr_t, NodePtr_t, PathPtr_t> FutureEdge_t;\n      typedef std::vector <FutureEdge_t> FutureEdges_t;\n      FutureEdges_t futureEdges;\n      ConnectedComponentPtr_t initCC (initNode->connectedComponent ());\n      for (ConnectedComponents_t::iterator itCC\n             (roadmap ()->connectedComponents ().begin ());\n           itCC != roadmap ()->connectedComponents ().end (); ++itCC) {\n        if (*itCC != initCC) {\n          value_type d;\n          NodePtr_t near (nn->search (*initNode->configuration (),\n                                      *itCC, d, true));\n          assert (near);\n          ConfigurationPtr_t q1 (initNode->configuration ());\n          ConfigurationPtr_t q2 (near->configuration ());\n          path = (*sm) (*q1, *q2);\n          if (!path) continue;\n          if (pathProjector) {\n            if (!pathProjector->apply (path, projPath)) continue;\n          } else {\n            projPath = path;\n          }\n          if (projPath) {\n            PathValidationReportPtr_t report;\n            bool pathValid = pathValidation->validate (projPath, false,\n                                                       validPath, report);\n            if (pathValid && validPath->length() > 0) {\n              futureEdges.push_back (FutureEdge_t (initNode, near, projPath));\n            }\n          }\n        }\n      }\n      for (NodeVector_t::const_iterator itn = roadmap ()->goalNodes ().begin();\n\t   itn != roadmap ()->goalNodes ().end (); ++itn) {\n        ConnectedComponentPtr_t goalCC ((*itn)->connectedComponent ());\n        for (ConnectedComponents_t::iterator itCC\n               (roadmap ()->connectedComponents ().begin ());\n             itCC != roadmap ()->connectedComponents ().end (); ++itCC) {\n          if (*itCC != goalCC) {\n            value_type d;\n            NodePtr_t near (nn->search (*(*itn)->configuration (), *itCC, d,\n                                        false));\n            assert (near);\n            ConfigurationPtr_t q1 (near->configuration ());\n            ConfigurationPtr_t q2 ((*itn)->configuration ());\n            path = (*sm) (*q1, *q2);\n            if (!path) continue;\n            if (pathProjector) {\n              if (!pathProjector->apply (path, projPath)) continue;\n            } else {\n              projPath = path;\n            }\n            if (projPath) {\n              PathValidationReportPtr_t report;\n              bool pathValid = pathValidation->validate (projPath, false,\n                                                         validPath, report);\n              if (pathValid && validPath->length() > 0) {\n                futureEdges.push_back (FutureEdge_t (near, (*itn), projPath));\n              }\n            }\n          }\n        }\n      }\n      \/\/ Add edges\n      for (FutureEdges_t::const_iterator it (futureEdges.begin ());\n           it != futureEdges.end (); ++it) {\n        roadmap ()->addEdge (it->get <0> (), it->get <1> (), it->get <2> ());\n      }\n    }\n\n  } \/\/   namespace core\n} \/\/ namespace hpp\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  FRESteamWorks.cpp\n\/\/  FRESteamWorks\n\/\/\n\/\/  Created by David `Oldes` Oliva on 3\/29\/12.\n\/\/  Copyright (c) 2012 Amanita Design. All rights reserved.\n\/\/\n\n#include \"FRESteamWorks.h\"\n\n\/\/ Used to dispatch event back to AIR\nFREContext AIRContext;\n\n\/\/ Global access to Steam object\nCSteam*\tg_Steam = NULL;\n\n\/\/ utility functions\nFREObject FREBool(bool value) {\n\tFREObject result;\n\tFRENewObjectFromBool(value, &result);\n\treturn result;\n}\n\nFREObject FREInt(int32 value) {\n\tFREObject result;\n\tFRENewObjectFromInt32(value, &result);\n\treturn result;\n}\n\nFREObject FREFloat(float value) {\n\tFREObject result;\n\tFRENewObjectFromDouble(value, &result);\n\treturn result;\n}\n\nstd::string FREGetString(FREObject object) {\n\tuint32_t len;\n\tconst uint8_t* string;\n\tFREResult res = FREGetObjectAsUTF8(object, &len, &string);\n\n\tif(res != FRE_OK) return std::string();\n\n\treturn std::string((const char*)string, len);\n}\n\nvoid ANESteam::DispatchEvent(char* level, char* code) {\n\tFREResult res = FREDispatchStatusEventAsync(AIRContext, (const uint8_t*)code, (const uint8_t*)level);\n\tif (res != FRE_OK) {\n\t\treturn;\n\t}\n}\n\nextern \"C\" {\n\n\tFREObject AIRSteam_Init(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\t\/\/ check if already initialized\n\t\tif (g_Steam) return FREBool(true);\n\n\t\tbool ret = SteamAPI_Init();\n\t\tif (ret) g_Steam = new CSteam();\n\n\t\treturn FREBool(ret);\n\t}\n\n\tFREObject AIRSteam_RequestStats(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tbool ret = false;\n\t\tif (g_Steam) ret = g_Steam->RequestStats();\n\n\t\tSteamAPI_RunCallbacks();\n\t\treturn FREBool(ret);\n\t}\n\n\tFREObject AIRSteam_SetAchievement(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tbool ret = false;\n\n\t\tif (g_Steam && argc == 1) {\n\t\t\tstd::string name = FREGetString(argv[0]);\n\t\t\tif (!name.empty()) {\n\t\t\t\tret = g_Steam->SetAchievement(name.c_str());\n\t\t\t}\n\t\t}\n\n\t\tSteamAPI_RunCallbacks();\n\t\treturn FREBool(ret);\n\t}\n\n\tFREObject AIRSteam_ClearAchievement(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam || argc != 1) return FREBool(false);\n\n\t\tstd::string name = FREGetString(argv[0]);\n\t\tif (name.empty()) return FREBool(false);\n\n\t\treturn FREBool(g_Steam->ClearAchievement(name.c_str()));\n\t}\n\n\tFREObject AIRSteam_IsAchievement(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam || argc != 1) return FREBool(false);\n\n\t\tstd::string name = FREGetString(argv[0]);\n\t\tif (name.empty()) return FREBool(false);\n\n\t\treturn FREBool(g_Steam->IsAchievement(name.c_str()));\n\t}\n\n\tFREObject AIRSteam_RunCallbacks(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tSteamAPI_RunCallbacks();\n\t\treturn NULL;\n\t}\n\n\tFREObject AIRSteam_GetStatInt(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam || argc != 1) return FREInt(0);\n\n\t\tstd::string name = FREGetString(argv[0]);\n\t\tif (name.empty()) return FREInt(0);\n\n\t\tint32 value;\n\t\tg_Steam->GetStat(name.c_str(), &value);\n\t\treturn FREInt(value);\n\t}\n\n\tFREObject AIRSteam_GetStatFloat(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam || argc != 1) return FREFloat(0.0);\n\n\t\tstd::string name = FREGetString(argv[0]);\n\t\tif (name.empty()) return FREFloat(0.0);\n\n\t\tfloat value = 0.0f;\n\t\tg_Steam->GetStat(name.c_str(), &value);\n\t\treturn FREFloat(value);\n\t}\n\n\tFREObject AIRSteam_SetStatInt(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam || argc != 2) return FREBool(false);\n\n\t\tstd::string name = FREGetString(argv[0]);\n\t\tif (name.empty()) return FREBool(false);\n\n\t\tint32 value;\n\t\tif (FREGetObjectAsInt32(argv[1], &value) != FRE_OK) return FREBool(false);\n\n\t\treturn FREBool(g_Steam->SetStat(name.c_str(), value));\n\t}\n\tFREObject AIRSteam_SetStatFloat(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam || argc != 2) return FREBool(false);\n\n\t\tstd::string name = FREGetString(argv[0]);\n\t\tif (name.empty()) return FREBool(false);\n\n\t\tdouble value;\n\t\tif (FREGetObjectAsDouble(argv[1], &value) != FRE_OK) return FREBool(false);\n\n\t\treturn FREBool(g_Steam->SetStat(name.c_str(), (float)value));\n\t}\n\n\tFREObject AIRSteam_StoreStats(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam) return FREBool(false);\n\n\t\treturn FREBool(g_Steam->StoreStats());\n\t}\n\n\tFREObject AIRSteam_ResetAllStats(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam || argc != 1) return FREBool(false);\n\n\t\tuint32_t achievementsToo;\n\t\tif (FREGetObjectAsBool(argv[0], &achievementsToo) != FRE_OK)\n\t\t\treturn FREBool(false);\n\n\t\treturn FREBool(g_Steam->ResetAllStats(achievementsToo != 0));\n\t}\n\n\t\/\/Steam Cloud\n\tFREObject AIRSteam_GetFileCount(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam) return FREInt(0);\n\n\t\treturn FREInt(SteamRemoteStorage()->GetFileCount());\n\t}\n\n\tFREObject AIRSteam_GetFileSize(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam || argc != 1) return FREInt(0);\n\n\t\tstd::string name = FREGetString(argv[0]);\n\t\tif (name.empty()) return FREInt(0);\n\n\t\treturn FREInt(SteamRemoteStorage()->GetFileSize(name.c_str()));\n\t}\n\n\tFREObject AIRSteam_FileExists(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam || argc != 1) return FREBool(false);\n\n\t\tstd::string name = FREGetString(argv[0]);\n\t\tif (name.empty()) return FREBool(false);\n\n\t\treturn FREBool(SteamRemoteStorage()->FileExists(name.c_str()));\n\t}\n\n\tFREObject AIRSteam_FileWrite(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam || argc != 2) return FREBool(false);\n\n\t\tstd::string name = FREGetString(argv[0]);\n\t\tif (name.empty()) return FREBool(false);\n\n\t\tFREByteArray byteArray;\n\t\tif (FREAcquireByteArray(argv[1], &byteArray) != FRE_OK)\n\t\t\treturn false;\n\n\t\tbool ret = SteamRemoteStorage()->FileWrite(name.c_str(), byteArray.bytes, byteArray.length);\n\t\tFREReleaseByteArray(argv[1]);\n\n\t\treturn FREBool(ret);\n\t}\n\n\tFREObject AIRSteam_FileRead(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam || argc != 2) return FREBool(false);\n\n\t\tstd::string name = FREGetString(argv[0]);\n\t\tif (name.empty()) return FREBool(false);\n\n\t\tFREByteArray byteArray;\n\t\tif (FREAcquireByteArray(argv[1], &byteArray) != FRE_OK)\n\t\t\treturn FREBool(false);\n\n\t\tuint32 size = SteamRemoteStorage()->GetFileSize(name.c_str());\n\t\tint32 ret = 0;\n\t\tif (size > 0 && size <= byteArray.length) {\n\t\t\tchar* data = (char*)malloc(size);\n\t\t\tret = SteamRemoteStorage()->FileRead(name.c_str(), data, size);\n\t\t\tmemcpy(byteArray.bytes, data, size);\n\t\t\tfree(data);\n\t\t}\n\t\tFREReleaseByteArray(argv[1]);\n\n\t\treturn FREBool(ret != 0);\n\t}\n\n\tFREObject AIRSteam_FileDelete(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam || argc != 1) return FREBool(false);\n\n\t\tstd::string name = FREGetString(argv[0]);\n\t\tif (name.empty()) return FREBool(false);\n\n\t\treturn FREBool(SteamRemoteStorage()->FileDelete(name.c_str()));\n\t}\n\n\tFREObject AIRSteam_IsCloudEnabledForApp(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam) return FREBool(false);\n\n\t\treturn FREBool(SteamRemoteStorage()->IsCloudEnabledForApp());\n\t}\n\n\tFREObject AIRSteam_SetCloudEnabledForApp(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam || argc != 1) return FREBool(false);\n\n\t\tuint32_t enabled = 0;\n\t\tif (FREGetObjectAsBool(argv[0], &enabled) != FRE_OK)\n\t\t\treturn FREBool(false);\n\n\t\tbool bEnabled = (enabled != 0);\n\t\tSteamRemoteStorage()->SetCloudEnabledForApp(bEnabled);\n\n\t\treturn FREBool(bEnabled == SteamRemoteStorage()->IsCloudEnabledForApp());\n\t}\n\t\/\/============================\n\n\t\/\/ A native context instance is created\n\tvoid ContextInitializer(void* extData, const uint8_t* ctxType, FREContext ctx,\n\t                        uint32_t* numFunctions, const FRENamedFunction** functions) {\n\t\tAIRContext = ctx;\n\n#define FRE_FUNC(fname) \\\n\t\t{ (const uint8_t*) #fname, NULL, &fname }\n\n\t\tstatic FRENamedFunction func[] = {\n\t\t\tFRE_FUNC(AIRSteam_Init),\n\t\t\tFRE_FUNC(AIRSteam_RunCallbacks),\n\n\t\t\t\/\/ stats \/ achievements\n\t\t\tFRE_FUNC(AIRSteam_RequestStats),\n\t\t\tFRE_FUNC(AIRSteam_SetAchievement),\n\t\t\tFRE_FUNC(AIRSteam_ClearAchievement),\n\t\t\tFRE_FUNC(AIRSteam_IsAchievement),\n\t\t\tFRE_FUNC(AIRSteam_GetStatInt),\n\t\t\tFRE_FUNC(AIRSteam_GetStatFloat),\n\t\t\tFRE_FUNC(AIRSteam_SetStatInt),\n\t\t\tFRE_FUNC(AIRSteam_SetStatFloat),\n\t\t\tFRE_FUNC(AIRSteam_StoreStats),\n\t\t\tFRE_FUNC(AIRSteam_ResetAllStats),\n\n\t\t\t\/\/ remote storage\n\t\t\tFRE_FUNC(AIRSteam_GetFileCount),\n\t\t\tFRE_FUNC(AIRSteam_GetFileSize),\n\t\t\tFRE_FUNC(AIRSteam_FileExists),\n\t\t\tFRE_FUNC(AIRSteam_FileWrite),\n\t\t\tFRE_FUNC(AIRSteam_FileRead),\n\t\t\tFRE_FUNC(AIRSteam_FileDelete),\n\t\t\tFRE_FUNC(AIRSteam_IsCloudEnabledForApp),\n\t\t\tFRE_FUNC(AIRSteam_SetCloudEnabledForApp)\n\t\t};\n\n\t\t*functions = func;\n\t\t*numFunctions = sizeof(func) \/ sizeof(func[0]);\n\t}\n\n\t\/\/ A native context instance is disposed\n\tvoid ContextFinalizer(FREContext ctx) {\n\t\tAIRContext = NULL;\n\t\t\/\/ Shutdown Steam\n\t\tSteamAPI_Shutdown();\n\t\t\/\/ Delete the SteamAchievements object\n\t\tif (g_Steam) g_Steam = NULL;\n\t}\n\n\t\/\/ Initialization function of each extension\n\tEXPORT void ExtInitializer(void** extDataToSet, FREContextInitializer* ctxInitializerToSet,\n\t                           FREContextFinalizer* ctxFinalizerToSet) {\n\t\t*extDataToSet = NULL;\n\t\t*ctxInitializerToSet = &ContextInitializer;\n\t\t*ctxFinalizerToSet = &ContextFinalizer;\n\t}\n\n\t\/\/ Called when extension is unloaded\n\tEXPORT void ExtFinalizer(void* extData) {\n\t\treturn;\n\t}\n}\n<commit_msg>Create instance of correct class<commit_after>\/\/\n\/\/  FRESteamWorks.cpp\n\/\/  FRESteamWorks\n\/\/\n\/\/  Created by David `Oldes` Oliva on 3\/29\/12.\n\/\/  Copyright (c) 2012 Amanita Design. All rights reserved.\n\/\/\n\n#include \"FRESteamWorks.h\"\n\n\/\/ Used to dispatch event back to AIR\nFREContext AIRContext;\n\n\/\/ Global access to Steam object\nCSteam*\tg_Steam = NULL;\n\n\/\/ utility functions\nFREObject FREBool(bool value) {\n\tFREObject result;\n\tFRENewObjectFromBool(value, &result);\n\treturn result;\n}\n\nFREObject FREInt(int32 value) {\n\tFREObject result;\n\tFRENewObjectFromInt32(value, &result);\n\treturn result;\n}\n\nFREObject FREFloat(float value) {\n\tFREObject result;\n\tFRENewObjectFromDouble(value, &result);\n\treturn result;\n}\n\nstd::string FREGetString(FREObject object) {\n\tuint32_t len;\n\tconst uint8_t* string;\n\tFREResult res = FREGetObjectAsUTF8(object, &len, &string);\n\n\tif(res != FRE_OK) return std::string();\n\n\treturn std::string((const char*)string, len);\n}\n\nvoid ANESteam::DispatchEvent(char* level, char* code) {\n\tFREResult res = FREDispatchStatusEventAsync(AIRContext, (const uint8_t*)code, (const uint8_t*)level);\n\tif (res != FRE_OK) {\n\t\treturn;\n\t}\n}\n\nextern \"C\" {\n\n\tFREObject AIRSteam_Init(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\t\/\/ check if already initialized\n\t\tif (g_Steam) return FREBool(true);\n\n\t\tbool ret = SteamAPI_Init();\n\t\tif (ret) g_Steam = new ANESteam();\n\n\t\treturn FREBool(ret);\n\t}\n\n\tFREObject AIRSteam_RequestStats(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tbool ret = false;\n\t\tif (g_Steam) ret = g_Steam->RequestStats();\n\n\t\tSteamAPI_RunCallbacks();\n\t\treturn FREBool(ret);\n\t}\n\n\tFREObject AIRSteam_SetAchievement(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tbool ret = false;\n\n\t\tif (g_Steam && argc == 1) {\n\t\t\tstd::string name = FREGetString(argv[0]);\n\t\t\tif (!name.empty()) {\n\t\t\t\tret = g_Steam->SetAchievement(name.c_str());\n\t\t\t}\n\t\t}\n\n\t\tSteamAPI_RunCallbacks();\n\t\treturn FREBool(ret);\n\t}\n\n\tFREObject AIRSteam_ClearAchievement(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam || argc != 1) return FREBool(false);\n\n\t\tstd::string name = FREGetString(argv[0]);\n\t\tif (name.empty()) return FREBool(false);\n\n\t\treturn FREBool(g_Steam->ClearAchievement(name.c_str()));\n\t}\n\n\tFREObject AIRSteam_IsAchievement(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam || argc != 1) return FREBool(false);\n\n\t\tstd::string name = FREGetString(argv[0]);\n\t\tif (name.empty()) return FREBool(false);\n\n\t\treturn FREBool(g_Steam->IsAchievement(name.c_str()));\n\t}\n\n\tFREObject AIRSteam_RunCallbacks(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tSteamAPI_RunCallbacks();\n\t\treturn NULL;\n\t}\n\n\tFREObject AIRSteam_GetStatInt(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam || argc != 1) return FREInt(0);\n\n\t\tstd::string name = FREGetString(argv[0]);\n\t\tif (name.empty()) return FREInt(0);\n\n\t\tint32 value;\n\t\tg_Steam->GetStat(name.c_str(), &value);\n\t\treturn FREInt(value);\n\t}\n\n\tFREObject AIRSteam_GetStatFloat(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam || argc != 1) return FREFloat(0.0);\n\n\t\tstd::string name = FREGetString(argv[0]);\n\t\tif (name.empty()) return FREFloat(0.0);\n\n\t\tfloat value = 0.0f;\n\t\tg_Steam->GetStat(name.c_str(), &value);\n\t\treturn FREFloat(value);\n\t}\n\n\tFREObject AIRSteam_SetStatInt(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam || argc != 2) return FREBool(false);\n\n\t\tstd::string name = FREGetString(argv[0]);\n\t\tif (name.empty()) return FREBool(false);\n\n\t\tint32 value;\n\t\tif (FREGetObjectAsInt32(argv[1], &value) != FRE_OK) return FREBool(false);\n\n\t\treturn FREBool(g_Steam->SetStat(name.c_str(), value));\n\t}\n\tFREObject AIRSteam_SetStatFloat(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam || argc != 2) return FREBool(false);\n\n\t\tstd::string name = FREGetString(argv[0]);\n\t\tif (name.empty()) return FREBool(false);\n\n\t\tdouble value;\n\t\tif (FREGetObjectAsDouble(argv[1], &value) != FRE_OK) return FREBool(false);\n\n\t\treturn FREBool(g_Steam->SetStat(name.c_str(), (float)value));\n\t}\n\n\tFREObject AIRSteam_StoreStats(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam) return FREBool(false);\n\n\t\treturn FREBool(g_Steam->StoreStats());\n\t}\n\n\tFREObject AIRSteam_ResetAllStats(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam || argc != 1) return FREBool(false);\n\n\t\tuint32_t achievementsToo;\n\t\tif (FREGetObjectAsBool(argv[0], &achievementsToo) != FRE_OK)\n\t\t\treturn FREBool(false);\n\n\t\treturn FREBool(g_Steam->ResetAllStats(achievementsToo != 0));\n\t}\n\n\t\/\/Steam Cloud\n\tFREObject AIRSteam_GetFileCount(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam) return FREInt(0);\n\n\t\treturn FREInt(SteamRemoteStorage()->GetFileCount());\n\t}\n\n\tFREObject AIRSteam_GetFileSize(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam || argc != 1) return FREInt(0);\n\n\t\tstd::string name = FREGetString(argv[0]);\n\t\tif (name.empty()) return FREInt(0);\n\n\t\treturn FREInt(SteamRemoteStorage()->GetFileSize(name.c_str()));\n\t}\n\n\tFREObject AIRSteam_FileExists(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam || argc != 1) return FREBool(false);\n\n\t\tstd::string name = FREGetString(argv[0]);\n\t\tif (name.empty()) return FREBool(false);\n\n\t\treturn FREBool(SteamRemoteStorage()->FileExists(name.c_str()));\n\t}\n\n\tFREObject AIRSteam_FileWrite(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam || argc != 2) return FREBool(false);\n\n\t\tstd::string name = FREGetString(argv[0]);\n\t\tif (name.empty()) return FREBool(false);\n\n\t\tFREByteArray byteArray;\n\t\tif (FREAcquireByteArray(argv[1], &byteArray) != FRE_OK)\n\t\t\treturn false;\n\n\t\tbool ret = SteamRemoteStorage()->FileWrite(name.c_str(), byteArray.bytes, byteArray.length);\n\t\tFREReleaseByteArray(argv[1]);\n\n\t\treturn FREBool(ret);\n\t}\n\n\tFREObject AIRSteam_FileRead(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam || argc != 2) return FREBool(false);\n\n\t\tstd::string name = FREGetString(argv[0]);\n\t\tif (name.empty()) return FREBool(false);\n\n\t\tFREByteArray byteArray;\n\t\tif (FREAcquireByteArray(argv[1], &byteArray) != FRE_OK)\n\t\t\treturn FREBool(false);\n\n\t\tuint32 size = SteamRemoteStorage()->GetFileSize(name.c_str());\n\t\tint32 ret = 0;\n\t\tif (size > 0 && size <= byteArray.length) {\n\t\t\tchar* data = (char*)malloc(size);\n\t\t\tret = SteamRemoteStorage()->FileRead(name.c_str(), data, size);\n\t\t\tmemcpy(byteArray.bytes, data, size);\n\t\t\tfree(data);\n\t\t}\n\t\tFREReleaseByteArray(argv[1]);\n\n\t\treturn FREBool(ret != 0);\n\t}\n\n\tFREObject AIRSteam_FileDelete(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam || argc != 1) return FREBool(false);\n\n\t\tstd::string name = FREGetString(argv[0]);\n\t\tif (name.empty()) return FREBool(false);\n\n\t\treturn FREBool(SteamRemoteStorage()->FileDelete(name.c_str()));\n\t}\n\n\tFREObject AIRSteam_IsCloudEnabledForApp(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam) return FREBool(false);\n\n\t\treturn FREBool(SteamRemoteStorage()->IsCloudEnabledForApp());\n\t}\n\n\tFREObject AIRSteam_SetCloudEnabledForApp(FREContext ctx, void* funcData, uint32_t argc, FREObject argv[]) {\n\t\tif (!g_Steam || argc != 1) return FREBool(false);\n\n\t\tuint32_t enabled = 0;\n\t\tif (FREGetObjectAsBool(argv[0], &enabled) != FRE_OK)\n\t\t\treturn FREBool(false);\n\n\t\tbool bEnabled = (enabled != 0);\n\t\tSteamRemoteStorage()->SetCloudEnabledForApp(bEnabled);\n\n\t\treturn FREBool(bEnabled == SteamRemoteStorage()->IsCloudEnabledForApp());\n\t}\n\t\/\/============================\n\n\t\/\/ A native context instance is created\n\tvoid ContextInitializer(void* extData, const uint8_t* ctxType, FREContext ctx,\n\t                        uint32_t* numFunctions, const FRENamedFunction** functions) {\n\t\tAIRContext = ctx;\n\n#define FRE_FUNC(fname) \\\n\t\t{ (const uint8_t*) #fname, NULL, &fname }\n\n\t\tstatic FRENamedFunction func[] = {\n\t\t\tFRE_FUNC(AIRSteam_Init),\n\t\t\tFRE_FUNC(AIRSteam_RunCallbacks),\n\n\t\t\t\/\/ stats \/ achievements\n\t\t\tFRE_FUNC(AIRSteam_RequestStats),\n\t\t\tFRE_FUNC(AIRSteam_SetAchievement),\n\t\t\tFRE_FUNC(AIRSteam_ClearAchievement),\n\t\t\tFRE_FUNC(AIRSteam_IsAchievement),\n\t\t\tFRE_FUNC(AIRSteam_GetStatInt),\n\t\t\tFRE_FUNC(AIRSteam_GetStatFloat),\n\t\t\tFRE_FUNC(AIRSteam_SetStatInt),\n\t\t\tFRE_FUNC(AIRSteam_SetStatFloat),\n\t\t\tFRE_FUNC(AIRSteam_StoreStats),\n\t\t\tFRE_FUNC(AIRSteam_ResetAllStats),\n\n\t\t\t\/\/ remote storage\n\t\t\tFRE_FUNC(AIRSteam_GetFileCount),\n\t\t\tFRE_FUNC(AIRSteam_GetFileSize),\n\t\t\tFRE_FUNC(AIRSteam_FileExists),\n\t\t\tFRE_FUNC(AIRSteam_FileWrite),\n\t\t\tFRE_FUNC(AIRSteam_FileRead),\n\t\t\tFRE_FUNC(AIRSteam_FileDelete),\n\t\t\tFRE_FUNC(AIRSteam_IsCloudEnabledForApp),\n\t\t\tFRE_FUNC(AIRSteam_SetCloudEnabledForApp)\n\t\t};\n\n\t\t*functions = func;\n\t\t*numFunctions = sizeof(func) \/ sizeof(func[0]);\n\t}\n\n\t\/\/ A native context instance is disposed\n\tvoid ContextFinalizer(FREContext ctx) {\n\t\tAIRContext = NULL;\n\t\t\/\/ Shutdown Steam\n\t\tSteamAPI_Shutdown();\n\t\t\/\/ Delete the SteamAchievements object\n\t\tif (g_Steam) g_Steam = NULL;\n\t}\n\n\t\/\/ Initialization function of each extension\n\tEXPORT void ExtInitializer(void** extDataToSet, FREContextInitializer* ctxInitializerToSet,\n\t                           FREContextFinalizer* ctxFinalizerToSet) {\n\t\t*extDataToSet = NULL;\n\t\t*ctxInitializerToSet = &ContextInitializer;\n\t\t*ctxFinalizerToSet = &ContextFinalizer;\n\t}\n\n\t\/\/ Called when extension is unloaded\n\tEXPORT void ExtFinalizer(void* extData) {\n\t\treturn;\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ SPDX-FileCopyrightText: 2022 James R. Barlow\n\/\/ SPDX-License-Identifier: MPL-2.0\n\n#include \"pikepdf.h\"\n#include <qpdf\/QPDFLogger.hh>\n\nstatic auto pikepdf_logger = QPDFLogger::create();\n\n\/\/ Pipeline to relay QPDF log messages to Python logging module\n\/\/ This is a sink - cannot pass to other pipeline objects\nclass Pl_PythonLogger : public Pipeline {\npublic:\n    Pl_PythonLogger(const char *identifier, py::object logger, const char *level)\n        : Pipeline(identifier, nullptr), logger(logger), level(level)\n    {\n    }\n\n    virtual ~Pl_PythonLogger()                          = default;\n    Pl_PythonLogger(const Pl_PythonLogger &)            = delete;\n    Pl_PythonLogger &operator=(const Pl_PythonLogger &) = delete;\n    Pl_PythonLogger(Pl_PythonLogger &&)                 = delete;\n    Pl_PythonLogger &operator=(Pl_PythonLogger &&)      = delete;\n\n    void write(const unsigned char *buf, size_t len) override;\n    void finish() override;\n\nprivate:\n    py::object logger;\n    const char *level;\n};\n\nvoid Pl_PythonLogger::write(const unsigned char *buf, size_t len)\n{\n    py::gil_scoped_acquire gil;\n    auto msg = py::str(reinterpret_cast<const char *>(buf), len);\n    this->logger.attr(this->level)(msg);\n}\n\nvoid Pl_PythonLogger::finish()\n{\n    py::gil_scoped_acquire gil;\n    this->logger.attr(\"flush\")();\n}\n\nstd::shared_ptr<QPDFLogger> get_pikepdf_logger()\n{\n    \/\/ All QPDFs can use the same logger\n    return pikepdf_logger;\n}\n\nvoid init_logger(py::module_ &m)\n{\n    auto py_logger = py::module_::import(\"logging\").attr(\"getLogger\")(\"pikepdf._qpdf\");\n\n    std::shared_ptr<Pipeline> pl_log_info = std::make_shared<Pl_PythonLogger>(\n        \"QPDF to Python logging pipeline\", py_logger, \"info\");\n    std::shared_ptr<Pipeline> pl_log_warn = std::make_shared<Pl_PythonLogger>(\n        \"QPDF to Python logging pipeline\", py_logger, \"warning\");\n    std::shared_ptr<Pipeline> pl_log_error = std::make_shared<Pl_PythonLogger>(\n        \"QPDF to Python logging pipeline\", py_logger, \"error\");\n\n    pikepdf_logger->setInfo(pl_log_info);\n    pikepdf_logger->setWarn(pl_log_warn);\n    pikepdf_logger->setError(pl_log_error);\n    pikepdf_logger->info(\"pikepdf C++ to Python logger bridge initialized\");\n}<commit_msg>logger: hold GIL when assigning py::object<commit_after>\/\/ SPDX-FileCopyrightText: 2022 James R. Barlow\n\/\/ SPDX-License-Identifier: MPL-2.0\n\n#include \"pikepdf.h\"\n#include <qpdf\/QPDFLogger.hh>\n\nstatic auto pikepdf_logger = QPDFLogger::create();\n\n\/\/ Pipeline to relay QPDF log messages to Python logging module\n\/\/ This is a sink - cannot pass to other pipeline objects\nclass Pl_PythonLogger : public Pipeline {\npublic:\n    Pl_PythonLogger(const char *identifier, py::object logger, const char *level)\n        : Pipeline(identifier, nullptr), level(level)\n    {\n        py::gil_scoped_acquire gil;\n        this->logger = logger;\n    }\n\n    virtual ~Pl_PythonLogger()                          = default;\n    Pl_PythonLogger(const Pl_PythonLogger &)            = delete;\n    Pl_PythonLogger &operator=(const Pl_PythonLogger &) = delete;\n    Pl_PythonLogger(Pl_PythonLogger &&)                 = delete;\n    Pl_PythonLogger &operator=(Pl_PythonLogger &&)      = delete;\n\n    void write(const unsigned char *buf, size_t len) override;\n    void finish() override;\n\nprivate:\n    py::object logger;\n    const char *level;\n};\n\nvoid Pl_PythonLogger::write(const unsigned char *buf, size_t len)\n{\n    py::gil_scoped_acquire gil;\n    auto msg = py::str(reinterpret_cast<const char *>(buf), len);\n    this->logger.attr(this->level)(msg);\n}\n\nvoid Pl_PythonLogger::finish()\n{\n    py::gil_scoped_acquire gil;\n    this->logger.attr(\"flush\")();\n}\n\nstd::shared_ptr<QPDFLogger> get_pikepdf_logger()\n{\n    \/\/ All QPDFs can use the same logger\n    return pikepdf_logger;\n}\n\nvoid init_logger(py::module_ &m)\n{\n    auto py_logger = py::module_::import(\"logging\").attr(\"getLogger\")(\"pikepdf._qpdf\");\n\n    std::shared_ptr<Pipeline> pl_log_info = std::make_shared<Pl_PythonLogger>(\n        \"QPDF to Python logging pipeline\", py_logger, \"info\");\n    std::shared_ptr<Pipeline> pl_log_warn = std::make_shared<Pl_PythonLogger>(\n        \"QPDF to Python logging pipeline\", py_logger, \"warning\");\n    std::shared_ptr<Pipeline> pl_log_error = std::make_shared<Pl_PythonLogger>(\n        \"QPDF to Python logging pipeline\", py_logger, \"error\");\n\n    pikepdf_logger->setInfo(pl_log_info);\n    pikepdf_logger->setWarn(pl_log_warn);\n    pikepdf_logger->setError(pl_log_error);\n    pikepdf_logger->info(\"pikepdf C++ to Python logger bridge initialized\");\n}<|endoftext|>"}
{"text":"<commit_before>\/***************************************************************************\n *   Copyright (c) Alexander Golubev (Fat-Zer) <fatzer2@gmail.com> 2015    *\n *                                                                         *\n *   This file is part of the FreeCAD CAx development system.              *\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         *\n *   GNU Library General Public License for more details.                  *\n *                                                                         *\n *   You should have received a copy of the GNU Library General Public     *\n *   License along with this library; see the file COPYING.LIB. If not,    *\n *   write to the Free Software Foundation, Inc., 59 Temple Place,         *\n *   Suite 330, Boston, MA  02111-1307, USA                                *\n *                                                                         *\n ***************************************************************************\/\n\n#include \"PreCompiled.h\"\n\n#ifndef _PreComp_\n# include <Inventor\/actions\/SoGetBoundingBoxAction.h>\n# include <Inventor\/nodes\/SoSeparator.h>\n# include <boost\/bind.hpp>\n#endif\n\n#include <Base\/Console.h>\n#include <App\/OriginGroup.h>\n#include <App\/Origin.h>\n\n#include \"Application.h\"\n#include \"Document.h\"\n#include \"View3DInventor.h\"\n#include \"View3DInventorViewer.h\"\n#include \"ViewProviderOrigin.h\"\n#include \"ViewProviderOriginFeature.h\"\n\n#include \"ViewProviderOriginGroup.h\"\n\n\nusing namespace Gui;\n\n\nPROPERTY_SOURCE(Gui::ViewProviderOriginGroup, Gui::ViewProviderGeoFeatureGroup)\n\nViewProviderOriginGroup::ViewProviderOriginGroup ()\n{ }\n\nViewProviderOriginGroup::~ViewProviderOriginGroup () { \n    connectChangedObjectApp.disconnect();\n    connectChangedObjectGui.disconnect();\n}\n\nstd::vector<App::DocumentObject*> ViewProviderOriginGroup::constructChildren (\n        const std::vector<App::DocumentObject*> &children ) const\n{\n    App::OriginGroup *group = static_cast <App::OriginGroup *> ( getObject() );\n    App::DocumentObject *originObj = group->Origin.getValue();\n\n    \/\/ Origin must be first\n    if (originObj) {\n        std::vector<App::DocumentObject*> rv;\n        rv.push_back (originObj);\n        std::copy (children.begin(), children.end(), std::back_inserter (rv));\n        return rv;\n    } else { \/\/ Generally shouldn't happen but must be handled in case origin is lost\n        return children;\n    }\n}\n\n\nstd::vector<App::DocumentObject*> ViewProviderOriginGroup::claimChildren () const {\n    return constructChildren ( ViewProviderGeoFeatureGroup::claimChildren () );\n}\n\nstd::vector<App::DocumentObject*> ViewProviderOriginGroup::claimChildren3D () const {\n    return constructChildren ( ViewProviderGeoFeatureGroup::claimChildren3D () );\n}\n\nvoid ViewProviderOriginGroup::attach(App::DocumentObject *pcObject) {\n    ViewProviderGeoFeatureGroup::attach ( pcObject );\n\n    App::Document *adoc  = pcObject->getDocument ();\n    Gui::Document *gdoc = Gui::Application::Instance->getDocument ( adoc ) ;\n\n    assert ( adoc );\n    assert ( gdoc );\n\n    connectChangedObjectApp = adoc->signalChangedObject.connect (\n            boost::bind ( &ViewProviderOriginGroup::slotChangedObjectApp, this, _1) );\n    \n    connectChangedObjectGui = gdoc->signalChangedObject.connect (\n            boost::bind ( &ViewProviderOriginGroup::slotChangedObjectGui, this, _1) );\n}\n\nvoid ViewProviderOriginGroup::updateData ( const App::Property* prop ) {\n    App::OriginGroup *group = static_cast<App::OriginGroup*> ( getObject() );\n    if ( group && prop == &group->Group ) {\n        updateOriginSize();\n    }\n\n    ViewProviderGeoFeatureGroup::updateData ( prop );\n}\n\nvoid ViewProviderOriginGroup::slotChangedObjectApp ( const App::DocumentObject& obj) {\n    App::OriginGroup *group = static_cast<App::OriginGroup*> ( getObject() );\n    if ( group && group->hasObject (&obj, \/*recusive=*\/ true ) ) {\n        updateOriginSize ();\n    }\n}\n\nvoid ViewProviderOriginGroup::slotChangedObjectGui ( const Gui::ViewProviderDocumentObject& vp) {\n    if ( !vp.isDerivedFrom ( Gui::ViewProviderOrigin::getClassTypeId () ) ) {\n        \/\/ Ignore origins to avoid infinite recursion (not likely in a well-formed focument, \n        \/\/          but may happen in documents designed in old versions of assembly branch )\n        App::OriginGroup *group = static_cast<App::OriginGroup*> ( getObject() );\n        App::DocumentObject *obj = vp.getObject ();\n\n        if ( group && obj && group->hasObject (obj, \/*recusive=*\/ true ) ) {\n            updateOriginSize ();\n        }\n    }\n}\n\nvoid ViewProviderOriginGroup::updateOriginSize () {\n    App::OriginGroup* group = static_cast<App::OriginGroup*> ( getObject() );\n\n    \/\/ obtain an Origin and it's ViewProvider\n    App::Origin* origin = 0;\n    Gui::ViewProviderOrigin* vpOrigin = 0;\n    try {\n        origin = group->getOrigin ();\n        assert (origin);\n\n        Gui::ViewProvider *vp = Gui::Application::Instance->getViewProvider(origin);\n        if (!vp) {\n            throw Base::Exception (\"No view provider linked to the Origin\");\n        }\n        assert ( vp->isDerivedFrom ( Gui::ViewProviderOrigin::getClassTypeId () ) );\n        vpOrigin = static_cast <Gui::ViewProviderOrigin *> ( vp );\n    } catch (const Base::Exception &ex) {\n        Base::Console().Error (\"%s\\n\", ex.what() );\n        return;\n    }\n\n    View3DInventorViewer* viewer = static_cast<View3DInventor*>(this->getActiveView())->getViewer();\n    SoGetBoundingBoxAction bboxAction(viewer->getSoRenderManager()->getViewportRegion());\n\n    \/\/ calculate the bounding box for out content\n    SbBox3f bbox(0,0,0, 0,0,0);\n    for(App::DocumentObject* obj : group->getGeoSubObjects()) {\n        ViewProvider *vp = Gui::Application::Instance->getViewProvider(obj);\n        if (!vp) {\n            continue;\n        }\n\n        bboxAction.apply ( vp->getRoot () );\n        bbox.extendBy ( bboxAction.getBoundingBox () );\n    };\n\n    \/\/ get the bounding box values\n    SbVec3f max = bbox.getMax();\n    SbVec3f min = bbox.getMin();\n\n    Base::Vector3d size;\n\n    for (uint_fast8_t i=0; i<3; i++) {\n        size[i] = std::max ( fabs ( max[i] ), fabs ( min[i] ) );\n        if (size[i] < 1e-7) { \/\/ TODO replace the magic values (2015-08-31, Fat-Zer)\n            size[i] = ViewProviderOrigin::defaultSize();\n        }\n    }\n\n    vpOrigin->Size.setValue ( size * 1.3 );\n}\n<commit_msg>Gui\/ViewProviderOriginGroup: prevent recalculation of origin size on ViewProviderOriginFeature changes<commit_after>\/***************************************************************************\n *   Copyright (c) Alexander Golubev (Fat-Zer) <fatzer2@gmail.com> 2015    *\n *                                                                         *\n *   This file is part of the FreeCAD CAx development system.              *\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         *\n *   GNU Library General Public License for more details.                  *\n *                                                                         *\n *   You should have received a copy of the GNU Library General Public     *\n *   License along with this library; see the file COPYING.LIB. If not,    *\n *   write to the Free Software Foundation, Inc., 59 Temple Place,         *\n *   Suite 330, Boston, MA  02111-1307, USA                                *\n *                                                                         *\n ***************************************************************************\/\n\n#include \"PreCompiled.h\"\n\n#ifndef _PreComp_\n# include <Inventor\/actions\/SoGetBoundingBoxAction.h>\n# include <Inventor\/nodes\/SoSeparator.h>\n# include <boost\/bind.hpp>\n#endif\n\n#include <Base\/Console.h>\n#include <App\/OriginGroup.h>\n#include <App\/Origin.h>\n\n#include \"Application.h\"\n#include \"Document.h\"\n#include \"View3DInventor.h\"\n#include \"View3DInventorViewer.h\"\n#include \"ViewProviderOrigin.h\"\n#include \"ViewProviderOriginFeature.h\"\n\n#include \"ViewProviderOriginGroup.h\"\n\n\nusing namespace Gui;\n\n\nPROPERTY_SOURCE(Gui::ViewProviderOriginGroup, Gui::ViewProviderGeoFeatureGroup)\n\nViewProviderOriginGroup::ViewProviderOriginGroup ()\n{ }\n\nViewProviderOriginGroup::~ViewProviderOriginGroup () { \n    connectChangedObjectApp.disconnect();\n    connectChangedObjectGui.disconnect();\n}\n\nstd::vector<App::DocumentObject*> ViewProviderOriginGroup::constructChildren (\n        const std::vector<App::DocumentObject*> &children ) const\n{\n    App::OriginGroup *group = static_cast <App::OriginGroup *> ( getObject() );\n    App::DocumentObject *originObj = group->Origin.getValue();\n\n    \/\/ Origin must be first\n    if (originObj) {\n        std::vector<App::DocumentObject*> rv;\n        rv.push_back (originObj);\n        std::copy (children.begin(), children.end(), std::back_inserter (rv));\n        return rv;\n    } else { \/\/ Generally shouldn't happen but must be handled in case origin is lost\n        return children;\n    }\n}\n\n\nstd::vector<App::DocumentObject*> ViewProviderOriginGroup::claimChildren () const {\n    return constructChildren ( ViewProviderGeoFeatureGroup::claimChildren () );\n}\n\nstd::vector<App::DocumentObject*> ViewProviderOriginGroup::claimChildren3D () const {\n    return constructChildren ( ViewProviderGeoFeatureGroup::claimChildren3D () );\n}\n\nvoid ViewProviderOriginGroup::attach(App::DocumentObject *pcObject) {\n    ViewProviderGeoFeatureGroup::attach ( pcObject );\n\n    App::Document *adoc  = pcObject->getDocument ();\n    Gui::Document *gdoc = Gui::Application::Instance->getDocument ( adoc ) ;\n\n    assert ( adoc );\n    assert ( gdoc );\n\n    connectChangedObjectApp = adoc->signalChangedObject.connect (\n            boost::bind ( &ViewProviderOriginGroup::slotChangedObjectApp, this, _1) );\n    \n    connectChangedObjectGui = gdoc->signalChangedObject.connect (\n            boost::bind ( &ViewProviderOriginGroup::slotChangedObjectGui, this, _1) );\n}\n\nvoid ViewProviderOriginGroup::updateData ( const App::Property* prop ) {\n    App::OriginGroup *group = static_cast<App::OriginGroup*> ( getObject() );\n    if ( group && prop == &group->Group ) {\n        updateOriginSize();\n    }\n\n    ViewProviderGeoFeatureGroup::updateData ( prop );\n}\n\nvoid ViewProviderOriginGroup::slotChangedObjectApp ( const App::DocumentObject& obj) {\n    App::OriginGroup *group = static_cast<App::OriginGroup*> ( getObject() );\n    if ( group && group->hasObject (&obj, \/*recusive=*\/ true ) ) {\n        updateOriginSize ();\n    }\n}\n\nvoid ViewProviderOriginGroup::slotChangedObjectGui ( const Gui::ViewProviderDocumentObject& vp) {\n    if ( !vp.isDerivedFrom ( Gui::ViewProviderOrigin::getClassTypeId () ) &&\n         !vp.isDerivedFrom ( Gui::ViewProviderOriginFeature::getClassTypeId () ) ) {\n        \/\/ Ignore origins to avoid infinite recursion (not likely in a well-formed focument, \n        \/\/          but may happen in documents designed in old versions of assembly branch )\n        App::OriginGroup *group = static_cast<App::OriginGroup*> ( getObject() );\n        App::DocumentObject *obj = vp.getObject ();\n\n        if ( group && obj && group->hasObject (obj, \/*recusive=*\/ true ) ) {\n            updateOriginSize ();\n        }\n    }\n}\n\nvoid ViewProviderOriginGroup::updateOriginSize () {\n    App::OriginGroup* group = static_cast<App::OriginGroup*> ( getObject() );\n\n    \/\/ obtain an Origin and it's ViewProvider\n    App::Origin* origin = 0;\n    Gui::ViewProviderOrigin* vpOrigin = 0;\n    try {\n        origin = group->getOrigin ();\n        assert (origin);\n\n        Gui::ViewProvider *vp = Gui::Application::Instance->getViewProvider(origin);\n        if (!vp) {\n            throw Base::Exception (\"No view provider linked to the Origin\");\n        }\n        assert ( vp->isDerivedFrom ( Gui::ViewProviderOrigin::getClassTypeId () ) );\n        vpOrigin = static_cast <Gui::ViewProviderOrigin *> ( vp );\n    } catch (const Base::Exception &ex) {\n        Base::Console().Error (\"%s\\n\", ex.what() );\n        return;\n    }\n\n    View3DInventorViewer* viewer = static_cast<View3DInventor*>(this->getActiveView())->getViewer();\n    SoGetBoundingBoxAction bboxAction(viewer->getSoRenderManager()->getViewportRegion());\n\n    \/\/ calculate the bounding box for out content\n    SbBox3f bbox(0,0,0, 0,0,0);\n    for(App::DocumentObject* obj : group->getGeoSubObjects()) {\n        ViewProvider *vp = Gui::Application::Instance->getViewProvider(obj);\n        if (!vp) {\n            continue;\n        }\n\n        bboxAction.apply ( vp->getRoot () );\n        bbox.extendBy ( bboxAction.getBoundingBox () );\n    };\n\n    \/\/ get the bounding box values\n    SbVec3f max = bbox.getMax();\n    SbVec3f min = bbox.getMin();\n\n    Base::Vector3d size;\n\n    for (uint_fast8_t i=0; i<3; i++) {\n        size[i] = std::max ( fabs ( max[i] ), fabs ( min[i] ) );\n        if (size[i] < 1e-7) { \/\/ TODO replace the magic values (2015-08-31, Fat-Zer)\n            size[i] = ViewProviderOrigin::defaultSize();\n        }\n    }\n\n    vpOrigin->Size.setValue ( size * 1.3 );\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Update Lab_02_Question_12.cpp<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"dafs\/customhash.hpp\"\n#include \"dafs\/propose.hpp\"\n#include \"dafs\/serialization.hpp\"\n#include \"dafs\/replication.hpp\"\n#include \"dafs\/result.hpp\"\n\n\nnamespace dafs\n{\n    PaxosReplication::PaxosReplication(\n        dafs::Address address,\n        dafs::Root root)\n    : progress_map(),\n      parliament(Replica(address.ip, address.port),\n                 root.directory,\n                 dafs::Commit(root, progress_map),\n                 dafs::Ignore(progress_map)),\n      mutex()\n    {\n    }\n\n\n    PaxosReplication::PaxosReplication(\n        const PaxosReplication& other\n    )\n        : progress_map(other.progress_map),\n          parliament(other.parliament),\n          mutex()\n    {\n    }\n\n\n    dafs::Result\n    PaxosReplication::Write(std::string entry)\n    {\n        \/\/ Here mutex is to guard against concurrent write access to\n        \/\/ progress_map.\n        std::lock_guard<std::mutex> guard(mutex);\n\n        auto proposal = dafs::Deserialize<dafs::Proposal>(entry);\n\n        do\n        {\n            proposal.uuid = boost::uuids::random_generator()();\n        }\n        while (progress_map.find(proposal.uuid) != progress_map.end());\n\n        progress_map[proposal.uuid] = std::make_shared<dafs::Signal>();\n\n        parliament.SendProposal(dafs::Serialize(proposal));\n\n        auto result = progress_map[proposal.uuid]->Wait();\n        progress_map.erase(proposal.uuid);\n        return result;\n    }\n\n\n    void\n    PaxosReplication::AddReplica(dafs::Address address, std::string location)\n    {\n        parliament.AddLegislator(address.ip, address.port, location);\n    }\n\n\n    void\n    PaxosReplication::RemoveReplica(dafs::Address address)\n    {\n        parliament.RemoveLegislator(address.ip, address.port);\n    }\n\n\n    std::vector<dafs::Address>\n    PaxosReplication::GetMissingReplicas()\n    {\n        int minimum_ballot_count = 10;\n        auto absentee_ballots = parliament.GetAbsenteeBallots(minimum_ballot_count);\n\n        if (absentee_ballots.size() < minimum_ballot_count)\n        {\n            \/\/\n            \/\/ We don't have enough data to suggest missing replica.\n            \/\/\n            return std::vector<dafs::Address>{};\n        }\n\n        auto nonresponsive = parliament.GetLegislators();\n\n        for (auto i : parliament.GetAbsenteeBallots(minimum_ballot_count))\n        {\n            nonresponsive = nonresponsive->Intersection(i.second);\n        }\n        std::vector<dafs::Address> nonresponsive_endpoints;\n        for (auto r : *nonresponsive)\n        {\n            nonresponsive_endpoints.push_back(dafs::Address(r.hostname, r.port));\n        }\n        return nonresponsive_endpoints;\n    }\n}\n<commit_msg>Remove replication write lock<commit_after>#include \"dafs\/customhash.hpp\"\n#include \"dafs\/propose.hpp\"\n#include \"dafs\/serialization.hpp\"\n#include \"dafs\/replication.hpp\"\n#include \"dafs\/result.hpp\"\n\n\nnamespace dafs\n{\n    PaxosReplication::PaxosReplication(\n        dafs::Address address,\n        dafs::Root root)\n    : progress_map(),\n      parliament(Replica(address.ip, address.port),\n                 root.directory,\n                 dafs::Commit(root, progress_map),\n                 dafs::Ignore(progress_map)),\n      mutex()\n    {\n    }\n\n\n    PaxosReplication::PaxosReplication(\n        const PaxosReplication& other\n    )\n        : progress_map(other.progress_map),\n          parliament(other.parliament),\n          mutex()\n    {\n    }\n\n\n    dafs::Result\n    PaxosReplication::Write(std::string entry)\n    {\n        auto proposal = dafs::Deserialize<dafs::Proposal>(entry);\n\n        do\n        {\n            proposal.uuid = boost::uuids::random_generator()();\n        }\n        while (progress_map.find(proposal.uuid) != progress_map.end());\n\n        progress_map[proposal.uuid] = std::make_shared<dafs::Signal>();\n\n        parliament.SendProposal(dafs::Serialize(proposal));\n\n        auto result = progress_map[proposal.uuid]->Wait();\n        progress_map.erase(proposal.uuid);\n        return result;\n    }\n\n\n    void\n    PaxosReplication::AddReplica(dafs::Address address, std::string location)\n    {\n        parliament.AddLegislator(address.ip, address.port, location);\n    }\n\n\n    void\n    PaxosReplication::RemoveReplica(dafs::Address address)\n    {\n        parliament.RemoveLegislator(address.ip, address.port);\n    }\n\n\n    std::vector<dafs::Address>\n    PaxosReplication::GetMissingReplicas()\n    {\n        int minimum_ballot_count = 10;\n        auto absentee_ballots = parliament.GetAbsenteeBallots(minimum_ballot_count);\n\n        if (absentee_ballots.size() < minimum_ballot_count)\n        {\n            \/\/\n            \/\/ We don't have enough data to suggest missing replica.\n            \/\/\n            return std::vector<dafs::Address>{};\n        }\n\n        auto nonresponsive = parliament.GetLegislators();\n\n        for (auto i : parliament.GetAbsenteeBallots(minimum_ballot_count))\n        {\n            nonresponsive = nonresponsive->Intersection(i.second);\n        }\n        std::vector<dafs::Address> nonresponsive_endpoints;\n        for (auto r : *nonresponsive)\n        {\n            nonresponsive_endpoints.push_back(dafs::Address(r.hostname, r.port));\n        }\n        return nonresponsive_endpoints;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\nCopyright 2015 Adam Grandquist\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 * @author Adam Grandquist\n * @copyright Apache\n *\/\n\n#ifndef REQL_REQL_CURSOR_HPP_\n#define REQL_REQL_CURSOR_HPP_\n\n#include \".\/reql\/decode.hpp\"\n#include \".\/reql\/parser.hpp\"\n#include \".\/reql\/pipe.hpp\"\n#include \".\/reql\/response.hpp\"\n#include \".\/reql\/types.hpp\"\n\n#include <atomic>\n#include <memory>\n\nnamespace _ReQL {\n\ntemplate <class result_t, class str_t>\nclass Cur_t {\npublic:\n  Cur_t() {}\n\n  enum Response_e {\n    REQL_CLIENT_ERROR = 16,\n    REQL_COMPILE_ERROR = 17,\n    REQL_RUNTIME_ERROR = 18,\n    REQL_SUCCESS_ATOM = 1,\n    REQL_SUCCESS_PARTIAL = 3,\n    REQL_SUCCESS_SEQUENCE = 2,\n    REQL_WAIT_COMPLETE = 4\n  };\n\n  Cur_t(std::shared_ptr<Pipe_t<Response_t<str_t>>> pipe) :\n    p_pipe([this](Response_t<str_t> &&response) {\n      Parser_t<result_t> parser;\n      decode(response.p_json, parser);\n      switch (parser.r_type()) {\n        case REQL_SUCCESS_ATOM:\n        case REQL_SUCCESS_SEQUENCE:\n        case REQL_WAIT_COMPLETE: {\n          response.done();\n          break;\n        }\n        case REQL_SUCCESS_PARTIAL: {\n          response.next();\n          break;\n        }\n        case REQL_CLIENT_ERROR:\n        case REQL_COMPILE_ERROR:\n        case REQL_RUNTIME_ERROR:\n        default: {\n          response.done();\n        }\n      }\n      return parser.get();\n    }, pipe) {}\n\n  Cur_t(Cur_t &&other) : p_pipe(std::move(other.p_pipe)) {}\n\n  Cur_t &operator =(Cur_t &&other) {\n    if (this != &other) {\n      p_pipe = std::move(other.p_pipe);\n    }\n    return *this;\n  }\n\n  bool isOpen() {\n    return p_pipe.isOpen();\n  }\n\n  Cur_t &operator >>(result_t &value) {\n    p_pipe >> value;\n    return *this;\n  }\n\n  template <class func_t>\n  typename Pipe_t<result_t>::Sink_t sink(func_t func) {\n    return p_pipe.sink(func);\n  }\n\n  void close() {\n    p_pipe.close();\n  }\n\n  Pipe_t<result_t> p_pipe;\n};\n\n}  \/\/ namespace _ReQL\n\n#endif  \/\/ REQL_REQL_CURSOR_HPP_\n<commit_msg>Create cursor with a pipe manager.<commit_after>\/*\nCopyright 2015 Adam Grandquist\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 * @author Adam Grandquist\n * @copyright Apache\n *\/\n\n#ifndef REQL_REQL_CURSOR_HPP_\n#define REQL_REQL_CURSOR_HPP_\n\n#include \".\/reql\/decode.hpp\"\n#include \".\/reql\/parser.hpp\"\n#include \".\/reql\/pipe.hpp\"\n#include \".\/reql\/response.hpp\"\n#include \".\/reql\/types.hpp\"\n\n#include <atomic>\n#include <memory>\n\nnamespace _ReQL {\n\ntemplate <class result_t, class str_t>\nclass Cur_t {\npublic:\n  Cur_t() {}\n\n  enum Response_e {\n    REQL_CLIENT_ERROR = 16,\n    REQL_COMPILE_ERROR = 17,\n    REQL_RUNTIME_ERROR = 18,\n    REQL_SUCCESS_ATOM = 1,\n    REQL_SUCCESS_PARTIAL = 3,\n    REQL_SUCCESS_SEQUENCE = 2,\n    REQL_WAIT_COMPLETE = 4\n  };\n\n  Cur_t(Pipe_t<Response_t<str_t>> &pipe) :\n    p_pipe([this](Response_t<str_t> &&response) {\n      Parser_t<result_t> parser;\n      decode(response.p_json, parser);\n      switch (parser.r_type()) {\n        case REQL_SUCCESS_ATOM:\n        case REQL_SUCCESS_SEQUENCE:\n        case REQL_WAIT_COMPLETE: {\n          response.done();\n          break;\n        }\n        case REQL_SUCCESS_PARTIAL: {\n          response.next();\n          break;\n        }\n        case REQL_CLIENT_ERROR:\n        case REQL_COMPILE_ERROR:\n        case REQL_RUNTIME_ERROR:\n        default: {\n          response.done();\n        }\n      }\n      return parser.get();\n    }, pipe) {}\n\n  Cur_t(Cur_t &&other) : p_pipe(std::move(other.p_pipe)) {}\n\n  Cur_t &operator =(Cur_t &&other) {\n    if (this != &other) {\n      p_pipe = std::move(other.p_pipe);\n    }\n    return *this;\n  }\n\n  bool isOpen() {\n    return p_pipe.isOpen();\n  }\n\n  Cur_t &operator >>(result_t &value) {\n    p_pipe >> value;\n    return *this;\n  }\n\n  template <class func_t>\n  typename Pipe_t<result_t>::Sink_t sink(func_t func) {\n    return p_pipe.sink(func);\n  }\n\n  void close() {\n    p_pipe.close();\n  }\n\n  Pipe_t<result_t> p_pipe;\n};\n\n}  \/\/ namespace _ReQL\n\n#endif  \/\/ REQL_REQL_CURSOR_HPP_\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * File    : D.cpp\n * Author  : Kazune Takahashi\n * Created : 11\/23\/2018, 9:25:43 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\nll a[40];\n\nvoid no()\n{\n  cout << \"invalid\" << endl;\n  exit(0);\n}\n\nll sum(ll N, ll k)\n{\n  ll ans = 0;\n  while (N > 0)\n  {\n    ans += N % k;\n    ans \/= k;\n  }\n  return ans;\n}\n\nbool check(ll N)\n{\n  if (!(1 <= N && N <= 1000000000000))\n  {\n    return false;\n  }\n  for (auto i = 2; i <= 30; i++)\n  {\n    if (sum(N, i) != a[i])\n    {\n      return false;\n    }\n  }\n  return true;\n}\n\nvector<vector<ll>> X[9];\nll pwr[24];\n\nvoid init()\n{\n  for (auto i = 0; i <= 2; i++)\n  {\n    for (auto j = 0; j <= 2; j++)\n    {\n      for (auto k = 0; k <= 2; k++)\n      {\n        for (auto l = 0; l <= 2; l++)\n        {\n          X[i + j + k + l].push_back({i, j, k, l});\n        }\n      }\n    }\n  }\n  pwr[0] = 1;\n  for (auto i = 1; i < 24; i++)\n  {\n    pwr[i] = 3 * pwr[i - 1];\n  }\n}\n\nbool discover(vector<ll> V)\n{\n  assert((int)V.size() == 6);\n  for (auto x : V)\n  {\n    if (!(0 <= x && x <= 8))\n    {\n      return false;\n    }\n  }\n  vector<ll> Y[6];\n  for (auto i = 0; i < 6; i++)\n  {\n    for (auto v : X[V[i]])\n    {\n      ll Q = 0;\n      for (auto j = 0; j < 4; j++)\n      {\n        Q += pwr[6 * j + i] * v[j];\n      }\n      Y[i].push_back(Q);\n    }\n  }\n  for (auto a : Y[0])\n  {\n    for (auto b : Y[1])\n    {\n      for (auto c : Y[2])\n      {\n        for (auto d : Y[3])\n        {\n          for (auto e : Y[4])\n          {\n            for (auto f : Y[5])\n            {\n              ll N = a + b + c + d + e + f;\n              if (check(N))\n              {\n                cout << N << endl;\n                return true;\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n  return false;\n}\n\nint main()\n{\n  init();\n  for (auto i = 2; i <= 30; i++)\n  {\n    cin >> a[i];\n  }\n  for (auto i = 0; i <= 8; i++)\n  {\n    for (auto j = 0; j <= 8; j++)\n    {\n      for (auto k = 0; k <= 8; k++)\n      {\n        vector<ll> V;\n        V.push_back(i);\n        V.push_back(j);\n        V.push_back(k);\n        ll A = a[3] - (i + j + k);\n        ll B = a[9] - (i + 3 * j + k);\n        ll C = a[27] - (i + 3 * j + 9 * k);\n        ll T = -4 * A + B + C;\n        if (T % 8 != 0)\n        {\n          continue;\n        }\n        ll X5 = T \/ 8;\n        ll U = B - A;\n        if (U % 2 != 0)\n        {\n          continue;\n        }\n        ll X3 = U \/ 2 - X5;\n        ll X4 = A - X3 - X5;\n        V.push_back(X3);\n        V.push_back(X4);\n        V.push_back(X5);\n        for (auto x : V)\n        {\n          cerr << x << \" \";\n        }\n        cerr << endl;\n        if (discover(V))\n        {\n          return 0;\n        }\n      }\n    }\n  }\n  no();\n}<commit_msg>tried D.cpp to 'D'<commit_after>\/**\n * File    : D.cpp\n * Author  : Kazune Takahashi\n * Created : 11\/23\/2018, 9:25:43 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\nll a[40];\n\nvoid no()\n{\n  cout << \"invalid\" << endl;\n  exit(0);\n}\n\nll sum(ll N, ll k)\n{\n  ll ans = 0;\n  while (N > 0)\n  {\n    ans += N % k;\n    ans \/= k;\n  }\n  return ans;\n}\n\nbool check(ll N)\n{\n  if (!(1 <= N && N <= 1000000000000))\n  {\n    return false;\n  }\n  for (auto i = 2; i <= 30; i++)\n  {\n    if (sum(N, i) != a[i])\n    {\n      return false;\n    }\n  }\n  return true;\n}\n\nvector<vector<ll>> X[9];\nll pwr[24];\n\nvoid init()\n{\n  for (auto i = 0; i <= 2; i++)\n  {\n    for (auto j = 0; j <= 2; j++)\n    {\n      for (auto k = 0; k <= 2; k++)\n      {\n        for (auto l = 0; l <= 2; l++)\n        {\n          X[i + j + k + l].push_back({i, j, k, l});\n        }\n      }\n    }\n  }\n  pwr[0] = 1;\n  for (auto i = 1; i < 24; i++)\n  {\n    pwr[i] = 3 * pwr[i - 1];\n  }\n}\n\nbool discover(vector<ll> V)\n{\n  assert((int)V.size() == 6);\n  for (auto x : V)\n  {\n    if (!(0 <= x && x <= 8))\n    {\n      return false;\n    }\n  }\n  vector<ll> Y[6];\n  for (auto i = 0; i < 6; i++)\n  {\n    for (auto v : X[V[i]])\n    {\n      ll Q = 0;\n      for (auto j = 0; j < 4; j++)\n      {\n        Q += pwr[6 * j + i] * v[j];\n      }\n      Y[i].push_back(Q);\n    }\n  }\n  for (auto a : Y[0])\n  {\n    for (auto b : Y[1])\n    {\n      for (auto c : Y[2])\n      {\n        for (auto d : Y[3])\n        {\n          for (auto e : Y[4])\n          {\n            for (auto f : Y[5])\n            {\n              ll N = a + b + c + d + e + f;\n              if (check(N))\n              {\n                cout << N << endl;\n                return true;\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n  return false;\n}\n\nint main()\n{\n  init();\n  for (auto i = 2; i <= 30; i++)\n  {\n    cin >> a[i];\n  }\n  no();\n  for (auto i = 0; i <= 8; i++)\n  {\n    for (auto j = 0; j <= 8; j++)\n    {\n      for (auto k = 0; k <= 8; k++)\n      {\n        vector<ll> V;\n        V.push_back(i);\n        V.push_back(j);\n        V.push_back(k);\n        ll A = a[3] - (i + j + k);\n        ll B = a[9] - (i + 3 * j + k);\n        ll C = a[27] - (i + 3 * j + 9 * k);\n        ll T = -4 * A + B + C;\n        if (T % 8 != 0)\n        {\n          continue;\n        }\n        ll X5 = T \/ 8;\n        ll U = B - A;\n        if (U % 2 != 0)\n        {\n          continue;\n        }\n        ll X3 = U \/ 2 - X5;\n        ll X4 = A - X3 - X5;\n        V.push_back(X3);\n        V.push_back(X4);\n        V.push_back(X5);\n        if (discover(V))\n        {\n          return 0;\n        }\n      }\n    }\n  }\n  no();\n}<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2012 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\/*\n * Logging infrastructure that aims to support multi-threading\n *\/\n\n\n#include \"rust_log.h\"\n#include \"rust_crate_map.h\"\n#include \"util\/array_list.h\"\n#include \"rust_util.h\"\n#include \"rust_task.h\"\n\n\/**\n * Synchronizes access to the underlying logging mechanism.\n *\/\nstatic lock_and_signal _log_lock;\n\/**\n * Indicates whether we are outputting to the console.\n * Protected by _log_lock;\n *\/\nstatic bool _log_to_console = true;\n\n\/*\n * Request that console logging be turned on.\n *\/\nvoid\nlog_console_on() {\n    scoped_lock with(_log_lock);\n    _log_to_console = true;\n}\n\n\/*\n * Request that console logging be turned off. Can be\n * overridden by the environment.\n *\/\nvoid\nlog_console_off() {\n    scoped_lock with(_log_lock);\n    _log_to_console = false;\n}\n\nbool\nshould_log_console() {\n    scoped_lock with(_log_lock);\n    return _log_to_console;\n}\n\nrust_log::rust_log(rust_sched_loop *sched_loop) :\n    _sched_loop(sched_loop) {\n}\n\nrust_log::~rust_log() {\n\n}\n\nconst uint16_t\nhash(uintptr_t ptr) {\n#   if(ULONG_MAX == 0xFFFFFFFF)\n    \/\/ Robert Jenkins' 32 bit integer hash function\n    ptr = (ptr + 0x7ed55d16) + (ptr << 12);\n    ptr = (ptr ^ 0xc761c23c) ^ (ptr >> 19);\n    ptr = (ptr + 0x165667b1) + (ptr << 5);\n    ptr = (ptr + 0xd3a2646c) ^ (ptr << 9);\n    ptr = (ptr + 0xfd7046c5) + (ptr << 3);\n    ptr = (ptr ^ 0xb55a4f09) ^ (ptr >> 16);\n#   elif(ULONG_MAX == 0xFFFFFFFFFFFFFFFF)\n    \/\/ \"hash64shift()\" from http:\/\/www.concentric.net\/~Ttwang\/tech\/inthash.htm\n    ptr = (~ptr) + (ptr << 21); \/\/ ptr = (ptr << 21) - ptr - 1;\n    ptr = ptr ^ (ptr >> 24);\n    ptr = (ptr + (ptr << 3)) + (ptr << 8); \/\/ ptr * 265\n    ptr = ptr ^ (ptr >> 14);\n    ptr = (ptr + (ptr << 2)) + (ptr << 4); \/\/ ptr * 21\n    ptr = ptr ^ (ptr >> 28);\n    ptr = ptr + (ptr << 31);\n#   else\n#   error \"hash() not defined for this pointer size\"\n#   endif\n    return (uint16_t) ptr;\n}\n\nchar *\ncopy_string(char *dst, const char *src, size_t length) {\n    return strncpy(dst, src, length) + length;\n}\n\nchar *\nappend_string(char *buffer, const char *format, ...) {\n    if (buffer != NULL && format) {\n        va_list args;\n        va_start(args, format);\n        size_t off = strlen(buffer);\n        vsnprintf(buffer + off, BUF_BYTES - off, format, args);\n        va_end(args);\n    }\n    return buffer;\n}\n\nvoid\nrust_log::log(rust_task* task, uint32_t level, char const *fmt, ...) {\n    char buf[BUF_BYTES];\n    va_list args;\n    va_start(args, fmt);\n    int formattedbytes = vsnprintf(buf, sizeof(buf), fmt, args);\n    if( formattedbytes and (unsigned)formattedbytes > BUF_BYTES ){\n        const char truncatedstr[] = \"[...]\";\n        memcpy( &buf[BUF_BYTES-sizeof(truncatedstr)],\n                truncatedstr,\n                sizeof(truncatedstr));\n    }\n    trace_ln(task, level, buf);\n    va_end(args);\n}\n\nvoid\nrust_log::trace_ln(char *prefix, char *message) {\n    char buffer[BUF_BYTES] = \"\";\n    _log_lock.lock();\n    append_string(buffer, \"%s\", prefix);\n    append_string(buffer, \"%s\", message);\n    if (_log_to_console) {\n        fprintf(stderr, \"rust: %s\\n\", buffer);\n        fflush(stderr);\n    }\n    _log_lock.unlock();\n}\n\nvoid\nrust_log::trace_ln(rust_task *task, uint32_t level, char *message) {\n\n    if (task) {\n        \/\/ There is not enough room to be logging on the rust stack\n        assert(!task->on_rust_stack() && \"logging on rust stack\");\n    }\n\n    \/\/ FIXME (#2672): The scheduler and task names used to have meaning,\n    \/\/ but they are always equal to 'main' currently\n#if 0\n\n#if defined(__WIN32__)\n    uint32_t thread_id = 0;\n#else\n    uint32_t thread_id = hash((uintptr_t) pthread_self());\n#endif\n\n    char prefix[BUF_BYTES] = \"\";\n    if (_sched_loop && _sched_loop-.name) {\n        append_string(prefix, \"%04\" PRIxPTR \":%.10s:\",\n                      thread_id, _sched_loop->name);\n    } else {\n        append_string(prefix, \"%04\" PRIxPTR \":0x%08\" PRIxPTR \":\",\n                      thread_id, (uintptr_t) _sched_loop);\n    }\n    if (task) {\n        if (task->name) {\n            append_string(prefix, \"%.10s:\", task->name);\n        } else {\n            append_string(prefix, \"0x%08\" PRIxPTR \":\", (uintptr_t) task);\n        }\n    }\n#else\n    char prefix[BUF_BYTES] = \"\";\n#endif\n\n    trace_ln(prefix, message);\n}\n\n\/\/ Reading log directives and setting log level vars\n\nstruct log_directive {\n    char* name;\n    size_t level;\n};\n\nconst size_t max_log_directives = 255;\nconst size_t max_log_level = 255;\nconst size_t default_log_level = log_err;\n\n\/\/ This is a rather ugly parser for strings in the form\n\/\/ \"crate1,crate2.mod3,crate3.x=1\". Log levels are 0-255,\n\/\/ with the most likely ones being 0-3 (defined in core::).\nsize_t parse_logging_spec(char* spec, log_directive* dirs) {\n    size_t dir = 0;\n    while (dir < max_log_directives && *spec) {\n        char* start = spec;\n        char cur;\n        while (true) {\n            cur = *spec;\n            if (cur == ',' || cur == '=' || cur == '\\0') {\n                if (start == spec) {spec++; break;}\n                if (*spec != '\\0') {\n                    *spec = '\\0';\n                    spec++;\n                }\n                size_t level = max_log_level;\n                if (cur == '=' && *spec != '\\0') {\n                    level = *spec - '0';\n                    if (level > max_log_level) level = max_log_level;\n                    if (*spec) ++spec;\n                }\n                dirs[dir].name = start;\n                dirs[dir++].level = level;\n                break;\n            } else {\n                spec++;\n            }\n        }\n    }\n    return dir;\n}\n\nstruct update_entry_args {\n    log_directive* dirs;\n    size_t n_dirs;\n    size_t *n_matches;\n};\n\nstatic void update_entry(const mod_entry* entry, void *cookie) {\n    update_entry_args *args = (update_entry_args *)cookie;\n    size_t level = default_log_level, longest_match = 0;\n    for (size_t d = 0; d < args->n_dirs; d++) {\n        if (strstr(entry->name, args->dirs[d].name) == entry->name &&\n            strlen(args->dirs[d].name) > longest_match) {\n            longest_match = strlen(args->dirs[d].name);\n            level = args->dirs[d].level;\n        }\n    }\n    *entry->state = level;\n    (*args->n_matches)++;\n}\n\nvoid update_module_map(const mod_entry* map, log_directive* dirs,\n                       size_t n_dirs, size_t *n_matches) {\n    update_entry_args args = { dirs, n_dirs, n_matches };\n    iter_module_map(map, update_entry, &args);\n}\n\nvoid update_crate_map(const cratemap* map, log_directive* dirs,\n                      size_t n_dirs, size_t *n_matches) {\n    update_entry_args args = { dirs, n_dirs, n_matches };\n    iter_crate_map(map, update_entry, &args);\n}\n\nvoid print_mod_name(const mod_entry* mod, void *cooke) {\n    printf(\" %s\\n\", mod->name);\n}\n\nvoid print_crate_log_map(const cratemap* map) {\n    iter_crate_map(map, print_mod_name, NULL);\n}\n\n\/\/ These are pseudo-modules used to control logging in the runtime.\n\nuint32_t log_rt_mem;\nuint32_t log_rt_box;\nuint32_t log_rt_comm;\nuint32_t log_rt_task;\nuint32_t log_rt_dom;\nuint32_t log_rt_trace;\nuint32_t log_rt_cache;\nuint32_t log_rt_upcall;\nuint32_t log_rt_timer;\nuint32_t log_rt_gc;\nuint32_t log_rt_stdlib;\nuint32_t log_rt_kern;\nuint32_t log_rt_backtrace;\nuint32_t log_rt_callback;\n\nstatic const mod_entry _rt_module_map[] =\n    {{\"::rt::mem\", &log_rt_mem},\n     {\"::rt::box\", &log_rt_box},\n     {\"::rt::comm\", &log_rt_comm},\n     {\"::rt::task\", &log_rt_task},\n     {\"::rt::dom\", &log_rt_dom},\n     {\"::rt::trace\", &log_rt_trace},\n     {\"::rt::cache\", &log_rt_cache},\n     {\"::rt::upcall\", &log_rt_upcall},\n     {\"::rt::timer\", &log_rt_timer},\n     {\"::rt::gc\", &log_rt_gc},\n     {\"::rt::stdlib\", &log_rt_stdlib},\n     {\"::rt::kern\", &log_rt_kern},\n     {\"::rt::backtrace\", &log_rt_backtrace},\n     {\"::rt::callback\", &log_rt_callback},\n     {NULL, NULL}};\n\nvoid update_log_settings(void* crate_map, char* settings) {\n    char* buffer = NULL;\n    log_directive dirs[256];\n    size_t n_dirs = 0;\n\n    if (settings) {\n\n        if (strcmp(settings, \"::help\") == 0 ||\n            strcmp(settings, \"?\") == 0) {\n            printf(\"\\nCrate log map:\\n\\n\");\n            print_crate_log_map((const cratemap*)crate_map);\n            printf(\"\\n\");\n            exit(1);\n        }\n\n        size_t buflen = strlen(settings) + 1;\n        buffer = (char*)malloc(buflen);\n        strncpy(buffer, settings, buflen);\n        n_dirs = parse_logging_spec(buffer, &dirs[0]);\n    }\n\n    size_t n_matches = 0;\n    update_module_map(_rt_module_map, &dirs[0], n_dirs, &n_matches);\n    update_crate_map((const cratemap*)crate_map, &dirs[0],\n                     n_dirs, &n_matches);\n\n    if (n_matches < n_dirs) {\n        \/\/ NB: Android compiler is complaining about format specifiers here\n        \/\/ and I don't understand why\n        \/*printf(\"warning: got %\" PRIdPTR \" RUST_LOG specs, \"\n               \"enabled %\" PRIdPTR \" flags.\",\n               (uintptr_t)n_dirs, (uintptr_t)n_matches);*\/\n    }\n\n    free(buffer);\n}\n\nextern \"C\" CDECL void\nrust_update_log_settings(void* crate_map, char* settings) {\n    update_log_settings(crate_map, settings);\n}\n\n\/\/\n\/\/ Local Variables:\n\/\/ mode: C++\n\/\/ fill-column: 78;\n\/\/ indent-tabs-mode: nil\n\/\/ c-basic-offset: 4\n\/\/ buffer-file-coding-system: utf-8-unix\n\/\/ compile-command: \"make -k -C $RBUILD 2>&1 | sed -e 's\/\\\\\/x\\\\\/\/x:\\\\\/\/g'\";\n\/\/ End:\n\/\/\n<commit_msg>Warn about unused RUST_LOG specs<commit_after>\/\/ Copyright 2012 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\/*\n * Logging infrastructure that aims to support multi-threading\n *\/\n\n\n#include \"rust_log.h\"\n#include \"rust_crate_map.h\"\n#include \"util\/array_list.h\"\n#include \"rust_util.h\"\n#include \"rust_task.h\"\n\n\/**\n * Synchronizes access to the underlying logging mechanism.\n *\/\nstatic lock_and_signal _log_lock;\n\/**\n * Indicates whether we are outputting to the console.\n * Protected by _log_lock;\n *\/\nstatic bool _log_to_console = true;\n\n\/*\n * Request that console logging be turned on.\n *\/\nvoid\nlog_console_on() {\n    scoped_lock with(_log_lock);\n    _log_to_console = true;\n}\n\n\/*\n * Request that console logging be turned off. Can be\n * overridden by the environment.\n *\/\nvoid\nlog_console_off() {\n    scoped_lock with(_log_lock);\n    _log_to_console = false;\n}\n\nbool\nshould_log_console() {\n    scoped_lock with(_log_lock);\n    return _log_to_console;\n}\n\nrust_log::rust_log(rust_sched_loop *sched_loop) :\n    _sched_loop(sched_loop) {\n}\n\nrust_log::~rust_log() {\n\n}\n\nconst uint16_t\nhash(uintptr_t ptr) {\n#   if(ULONG_MAX == 0xFFFFFFFF)\n    \/\/ Robert Jenkins' 32 bit integer hash function\n    ptr = (ptr + 0x7ed55d16) + (ptr << 12);\n    ptr = (ptr ^ 0xc761c23c) ^ (ptr >> 19);\n    ptr = (ptr + 0x165667b1) + (ptr << 5);\n    ptr = (ptr + 0xd3a2646c) ^ (ptr << 9);\n    ptr = (ptr + 0xfd7046c5) + (ptr << 3);\n    ptr = (ptr ^ 0xb55a4f09) ^ (ptr >> 16);\n#   elif(ULONG_MAX == 0xFFFFFFFFFFFFFFFF)\n    \/\/ \"hash64shift()\" from http:\/\/www.concentric.net\/~Ttwang\/tech\/inthash.htm\n    ptr = (~ptr) + (ptr << 21); \/\/ ptr = (ptr << 21) - ptr - 1;\n    ptr = ptr ^ (ptr >> 24);\n    ptr = (ptr + (ptr << 3)) + (ptr << 8); \/\/ ptr * 265\n    ptr = ptr ^ (ptr >> 14);\n    ptr = (ptr + (ptr << 2)) + (ptr << 4); \/\/ ptr * 21\n    ptr = ptr ^ (ptr >> 28);\n    ptr = ptr + (ptr << 31);\n#   else\n#   error \"hash() not defined for this pointer size\"\n#   endif\n    return (uint16_t) ptr;\n}\n\nchar *\ncopy_string(char *dst, const char *src, size_t length) {\n    return strncpy(dst, src, length) + length;\n}\n\nchar *\nappend_string(char *buffer, const char *format, ...) {\n    if (buffer != NULL && format) {\n        va_list args;\n        va_start(args, format);\n        size_t off = strlen(buffer);\n        vsnprintf(buffer + off, BUF_BYTES - off, format, args);\n        va_end(args);\n    }\n    return buffer;\n}\n\nvoid\nrust_log::log(rust_task* task, uint32_t level, char const *fmt, ...) {\n    char buf[BUF_BYTES];\n    va_list args;\n    va_start(args, fmt);\n    int formattedbytes = vsnprintf(buf, sizeof(buf), fmt, args);\n    if( formattedbytes and (unsigned)formattedbytes > BUF_BYTES ){\n        const char truncatedstr[] = \"[...]\";\n        memcpy( &buf[BUF_BYTES-sizeof(truncatedstr)],\n                truncatedstr,\n                sizeof(truncatedstr));\n    }\n    trace_ln(task, level, buf);\n    va_end(args);\n}\n\nvoid\nrust_log::trace_ln(char *prefix, char *message) {\n    char buffer[BUF_BYTES] = \"\";\n    _log_lock.lock();\n    append_string(buffer, \"%s\", prefix);\n    append_string(buffer, \"%s\", message);\n    if (_log_to_console) {\n        fprintf(stderr, \"rust: %s\\n\", buffer);\n        fflush(stderr);\n    }\n    _log_lock.unlock();\n}\n\nvoid\nrust_log::trace_ln(rust_task *task, uint32_t level, char *message) {\n\n    if (task) {\n        \/\/ There is not enough room to be logging on the rust stack\n        assert(!task->on_rust_stack() && \"logging on rust stack\");\n    }\n\n    \/\/ FIXME (#2672): The scheduler and task names used to have meaning,\n    \/\/ but they are always equal to 'main' currently\n#if 0\n\n#if defined(__WIN32__)\n    uint32_t thread_id = 0;\n#else\n    uint32_t thread_id = hash((uintptr_t) pthread_self());\n#endif\n\n    char prefix[BUF_BYTES] = \"\";\n    if (_sched_loop && _sched_loop-.name) {\n        append_string(prefix, \"%04\" PRIxPTR \":%.10s:\",\n                      thread_id, _sched_loop->name);\n    } else {\n        append_string(prefix, \"%04\" PRIxPTR \":0x%08\" PRIxPTR \":\",\n                      thread_id, (uintptr_t) _sched_loop);\n    }\n    if (task) {\n        if (task->name) {\n            append_string(prefix, \"%.10s:\", task->name);\n        } else {\n            append_string(prefix, \"0x%08\" PRIxPTR \":\", (uintptr_t) task);\n        }\n    }\n#else\n    char prefix[BUF_BYTES] = \"\";\n#endif\n\n    trace_ln(prefix, message);\n}\n\n\/\/ Reading log directives and setting log level vars\n\nstruct log_directive {\n    char* name;\n    size_t level;\n};\n\nconst size_t max_log_directives = 255;\nconst size_t max_log_level = 255;\nconst size_t default_log_level = log_err;\n\n\/\/ This is a rather ugly parser for strings in the form\n\/\/ \"crate1,crate2.mod3,crate3.x=1\". Log levels are 0-255,\n\/\/ with the most likely ones being 0-3 (defined in core::).\nsize_t parse_logging_spec(char* spec, log_directive* dirs) {\n    size_t dir = 0;\n    while (dir < max_log_directives && *spec) {\n        char* start = spec;\n        char cur;\n        while (true) {\n            cur = *spec;\n            if (cur == ',' || cur == '=' || cur == '\\0') {\n                if (start == spec) {spec++; break;}\n                if (*spec != '\\0') {\n                    *spec = '\\0';\n                    spec++;\n                }\n                size_t level = max_log_level;\n                if (cur == '=' && *spec != '\\0') {\n                    level = *spec - '0';\n                    if (level > max_log_level) level = max_log_level;\n                    if (*spec) ++spec;\n                }\n                dirs[dir].name = start;\n                dirs[dir++].level = level;\n                break;\n            } else {\n                spec++;\n            }\n        }\n    }\n    return dir;\n}\n\nstruct update_entry_args {\n    log_directive* dirs;\n    size_t n_dirs;\n    size_t *n_matches;\n};\n\nstatic void update_entry(const mod_entry* entry, void *cookie) {\n    update_entry_args *args = (update_entry_args *)cookie;\n    size_t level = default_log_level, longest_match = 0;\n    for (size_t d = 0; d < args->n_dirs; d++) {\n        if (strstr(entry->name, args->dirs[d].name) == entry->name &&\n            strlen(args->dirs[d].name) > longest_match) {\n            longest_match = strlen(args->dirs[d].name);\n            level = args->dirs[d].level;\n        }\n    }\n    *entry->state = level;\n    if (longest_match > 0) {\n        (*args->n_matches)++;\n    }\n}\n\nvoid update_module_map(const mod_entry* map, log_directive* dirs,\n                       size_t n_dirs, size_t *n_matches) {\n    update_entry_args args = { dirs, n_dirs, n_matches };\n    iter_module_map(map, update_entry, &args);\n}\n\nvoid update_crate_map(const cratemap* map, log_directive* dirs,\n                      size_t n_dirs, size_t *n_matches) {\n    update_entry_args args = { dirs, n_dirs, n_matches };\n    iter_crate_map(map, update_entry, &args);\n}\n\nvoid print_mod_name(const mod_entry* mod, void *cooke) {\n    printf(\" %s\\n\", mod->name);\n}\n\nvoid print_crate_log_map(const cratemap* map) {\n    iter_crate_map(map, print_mod_name, NULL);\n}\n\n\/\/ These are pseudo-modules used to control logging in the runtime.\n\nuint32_t log_rt_mem;\nuint32_t log_rt_box;\nuint32_t log_rt_comm;\nuint32_t log_rt_task;\nuint32_t log_rt_dom;\nuint32_t log_rt_trace;\nuint32_t log_rt_cache;\nuint32_t log_rt_upcall;\nuint32_t log_rt_timer;\nuint32_t log_rt_gc;\nuint32_t log_rt_stdlib;\nuint32_t log_rt_kern;\nuint32_t log_rt_backtrace;\nuint32_t log_rt_callback;\n\nstatic const mod_entry _rt_module_map[] =\n    {{\"::rt::mem\", &log_rt_mem},\n     {\"::rt::box\", &log_rt_box},\n     {\"::rt::comm\", &log_rt_comm},\n     {\"::rt::task\", &log_rt_task},\n     {\"::rt::dom\", &log_rt_dom},\n     {\"::rt::trace\", &log_rt_trace},\n     {\"::rt::cache\", &log_rt_cache},\n     {\"::rt::upcall\", &log_rt_upcall},\n     {\"::rt::timer\", &log_rt_timer},\n     {\"::rt::gc\", &log_rt_gc},\n     {\"::rt::stdlib\", &log_rt_stdlib},\n     {\"::rt::kern\", &log_rt_kern},\n     {\"::rt::backtrace\", &log_rt_backtrace},\n     {\"::rt::callback\", &log_rt_callback},\n     {NULL, NULL}};\n\nvoid update_log_settings(void* crate_map, char* settings) {\n    char* buffer = NULL;\n    log_directive dirs[256];\n    size_t n_dirs = 0;\n\n    if (settings) {\n\n        if (strcmp(settings, \"::help\") == 0 ||\n            strcmp(settings, \"?\") == 0) {\n            printf(\"\\nCrate log map:\\n\\n\");\n            print_crate_log_map((const cratemap*)crate_map);\n            printf(\"\\n\");\n            exit(1);\n        }\n\n        size_t buflen = strlen(settings) + 1;\n        buffer = (char*)malloc(buflen);\n        strncpy(buffer, settings, buflen);\n        n_dirs = parse_logging_spec(buffer, &dirs[0]);\n    }\n\n    size_t n_matches = 0;\n    update_module_map(_rt_module_map, &dirs[0], n_dirs, &n_matches);\n    update_crate_map((const cratemap*)crate_map, &dirs[0],\n                     n_dirs, &n_matches);\n\n    if (n_matches < n_dirs) {\n        fprintf(stderr, \"warning: got %lu RUST_LOG specs but only matched %lu of them.\\n\"\n                \"You may have mistyped a RUST_LOG spec.\\n\"\n                \"Use RUST_LOG=::help to see the list of crates and modules.\\n\",\n                (unsigned long)n_dirs, (unsigned long)n_matches);\n    }\n\n    free(buffer);\n}\n\nextern \"C\" CDECL void\nrust_update_log_settings(void* crate_map, char* settings) {\n    update_log_settings(crate_map, settings);\n}\n\n\/\/\n\/\/ Local Variables:\n\/\/ mode: C++\n\/\/ fill-column: 78;\n\/\/ indent-tabs-mode: nil\n\/\/ c-basic-offset: 4\n\/\/ buffer-file-coding-system: utf-8-unix\n\/\/ compile-command: \"make -k -C $RBUILD 2>&1 | sed -e 's\/\\\\\/x\\\\\/\/x:\\\\\/\/g'\";\n\/\/ End:\n\/\/\n<|endoftext|>"}
{"text":"<commit_before>\/* This source file is part of the Tomviz project, https:\/\/tomviz.org\/.\n   It is released under the 3-Clause BSD License, see \"LICENSE\". *\/\n\n#include \"ExternalPythonExecutor.h\"\n#include \"DataSource.h\"\n#include \"EmdFormat.h\"\n#include \"Operator.h\"\n#include \"OperatorPython.h\"\n#include \"Pipeline.h\"\n#include \"PipelineWorker.h\"\n\nnamespace tomviz {\n\nExternalPythonExecutor::ExternalPythonExecutor(Pipeline* pipeline)\n  : ExternalPipelineExecutor(pipeline)\n{\n}\n\nExternalPythonExecutor::~ExternalPythonExecutor() = default;\n\nPipeline::Future* ExternalPythonExecutor::execute(vtkDataObject* data,\n                                                  QList<Operator*> operators,\n                                                  int start, int end)\n{\n\n  auto future = ExternalPipelineExecutor::execute(data, operators, start, end);\n\n  \/\/ We are now ready to run the pipeline\n  QStringList args = executorArgs(start);\n\n  PipelineSettings settings;\n  auto pythonExecutable = settings.externalPythonExecutablePath();\n\n  \/\/ Find the tomviz-pipeline executable\n  auto pythonExecutableFile = QFileInfo(pythonExecutable);\n\n  if (!pythonExecutableFile.exists()) {\n    displayError(\"External Python Error\",\n                 QString(\"The external python executable doesn't exist: %1\\n\")\n                   .arg(pythonExecutable));\n\n    return Pipeline::emptyFuture();\n  }\n\n  auto baseDir = pythonExecutableFile.dir();\n  auto tomvizPipelineExecutable =\n    QFileInfo(baseDir.filePath(\"tomviz-pipeline\"));\n  if (!tomvizPipelineExecutable.exists()) {\n    displayError(\n      \"External Python Error\",\n      QString(\"Unable to find tomviz-pipeline executable, please ensure \"\n              \"tomviz package has been installed in python environment.\"\n              \"Click the Help button for more details on setting up your \"\n              \"Python environment.\"));\n\n    return Pipeline::emptyFuture();\n  }\n\n  m_process.reset(new QProcess(this));\n\n  connect(m_process.data(), &QProcess::errorOccurred, this,\n          &ExternalPythonExecutor::error);\n  connect(\n    m_process.data(),\n    QOverload<int, QProcess::ExitStatus>::of(&QProcess::finished),\n    [this](int exitCode, QProcess::ExitStatus exitStatus) {\n\n      QString standardOut(this->m_process->readAllStandardOutput());\n      QString standardErr(this->m_process->readAllStandardError());\n\n      if (exitStatus == QProcess::CrashExit) {\n        displayError(\"External Python Error\",\n                     QString(\"The external python process crash: %1\\n\\n \"\n                             \"stderr:\\n%2 \\n\\n stdout:\\n%3 \\n\")\n                       .arg(commandLine(this->m_process.data()))\n                       .arg(standardErr)\n                       .arg(standardOut));\n\n      } else if (exitCode != 0) {\n        displayError(\n          \"External Python Error\",\n          QString(\"The external python return a non-zero exist code: %1\\n\\n \"\n                  \"command: %2 \\n\\n stderr:\\n%3 \\n\\n stdout:\\n%4 \\n\")\n            .arg(exitCode)\n            .arg(commandLine(this->m_process.data()))\n            .arg(standardErr)\n            .arg(standardOut));\n      }\n\n      qDebug().noquote() << standardErr;\n      qDebug().noquote() << standardOut;\n    });\n\n  \/\/ We have to get the process environment and unset TOMVIZ_APPLICATION and\n  \/\/ set that as the process environment for the process, otherwise the\n  \/\/ python package will think its running in the applicaton.\n  auto processEnv = QProcessEnvironment::systemEnvironment();\n  processEnv.remove(\"TOMVIZ_APPLICATION\");\n  m_process->setProcessEnvironment(processEnv);\n\n  m_process->start(tomvizPipelineExecutable.filePath(), args);\n\n  return future;\n}\n\nvoid ExternalPythonExecutor::cancel(std::function<void()> canceled)\n{\n\n  reset();\n\n  m_process->kill();\n\n  canceled();\n}\n\nbool ExternalPythonExecutor::cancel(Operator* op)\n{\n  Q_UNUSED(op);\n\n  \/\/ Stop the progress reader\n  m_progressReader->stop();\n\n  m_process->kill();\n\n  \/\/ Clean update state.\n  reset();\n\n  \/\/ We can't cancel an individual operator so we return false, so the caller\n  \/\/ knows\n  return false;\n}\n\nbool ExternalPythonExecutor::isRunning()\n{\n  return !m_process.isNull() && m_process->state() != QProcess::NotRunning;\n}\n\nvoid ExternalPythonExecutor::error(QProcess::ProcessError error)\n{\n  auto process = qobject_cast<QProcess*>(sender());\n  auto invocation = commandLine(process);\n\n  displayError(\"Execution Error\",\n               QString(\"An error occurred executing '%1', '%2'\")\n                 .arg(invocation)\n                 .arg(error));\n}\n\nvoid ExternalPythonExecutor::pipelineStarted()\n{\n  qDebug(\"Pipeline started in external python!\");\n}\n\nvoid ExternalPythonExecutor::reset()\n{\n  ExternalPipelineExecutor::reset();\n\n  m_process->waitForFinished();\n  m_process.reset();\n}\n\nQString ExternalPythonExecutor::executorWorkingDir()\n{\n  return workingDir();\n}\n\nQString ExternalPythonExecutor::commandLine(QProcess* process)\n{\n  return QString(\"%1 %2\")\n    .arg(process->program())\n    .arg(process->arguments().join(\" \"));\n}\n\n} \/\/ namespace tomviz\n<commit_msg>Remove python env vars before calling external python<commit_after>\/* This source file is part of the Tomviz project, https:\/\/tomviz.org\/.\n   It is released under the 3-Clause BSD License, see \"LICENSE\". *\/\n\n#include \"ExternalPythonExecutor.h\"\n#include \"DataSource.h\"\n#include \"EmdFormat.h\"\n#include \"Operator.h\"\n#include \"OperatorPython.h\"\n#include \"Pipeline.h\"\n#include \"PipelineWorker.h\"\n\nnamespace tomviz {\n\nExternalPythonExecutor::ExternalPythonExecutor(Pipeline* pipeline)\n  : ExternalPipelineExecutor(pipeline)\n{\n}\n\nExternalPythonExecutor::~ExternalPythonExecutor() = default;\n\nPipeline::Future* ExternalPythonExecutor::execute(vtkDataObject* data,\n                                                  QList<Operator*> operators,\n                                                  int start, int end)\n{\n\n  auto future = ExternalPipelineExecutor::execute(data, operators, start, end);\n\n  \/\/ We are now ready to run the pipeline\n  QStringList args = executorArgs(start);\n\n  PipelineSettings settings;\n  auto pythonExecutable = settings.externalPythonExecutablePath();\n\n  \/\/ Find the tomviz-pipeline executable\n  auto pythonExecutableFile = QFileInfo(pythonExecutable);\n\n  if (!pythonExecutableFile.exists()) {\n    displayError(\"External Python Error\",\n                 QString(\"The external python executable doesn't exist: %1\\n\")\n                   .arg(pythonExecutable));\n\n    return Pipeline::emptyFuture();\n  }\n\n  auto baseDir = pythonExecutableFile.dir();\n  auto tomvizPipelineExecutable =\n    QFileInfo(baseDir.filePath(\"tomviz-pipeline\"));\n  if (!tomvizPipelineExecutable.exists()) {\n    displayError(\n      \"External Python Error\",\n      QString(\"Unable to find tomviz-pipeline executable, please ensure \"\n              \"tomviz package has been installed in python environment.\"\n              \"Click the Help button for more details on setting up your \"\n              \"Python environment.\"));\n\n    return Pipeline::emptyFuture();\n  }\n\n  m_process.reset(new QProcess(this));\n\n  connect(m_process.data(), &QProcess::errorOccurred, this,\n          &ExternalPythonExecutor::error);\n  connect(\n    m_process.data(),\n    QOverload<int, QProcess::ExitStatus>::of(&QProcess::finished),\n    [this](int exitCode, QProcess::ExitStatus exitStatus) {\n\n      QString standardOut(this->m_process->readAllStandardOutput());\n      QString standardErr(this->m_process->readAllStandardError());\n\n      if (exitStatus == QProcess::CrashExit) {\n        displayError(\"External Python Error\",\n                     QString(\"The external python process crash: %1\\n\\n \"\n                             \"stderr:\\n%2 \\n\\n stdout:\\n%3 \\n\")\n                       .arg(commandLine(this->m_process.data()))\n                       .arg(standardErr)\n                       .arg(standardOut));\n\n      } else if (exitCode != 0) {\n        displayError(\n          \"External Python Error\",\n          QString(\"The external python return a non-zero exist code: %1\\n\\n \"\n                  \"command: %2 \\n\\n stderr:\\n%3 \\n\\n stdout:\\n%4 \\n\")\n            .arg(exitCode)\n            .arg(commandLine(this->m_process.data()))\n            .arg(standardErr)\n            .arg(standardOut));\n      }\n\n      qDebug().noquote() << standardErr;\n      qDebug().noquote() << standardOut;\n    });\n\n  \/\/ We have to get the process environment and unset TOMVIZ_APPLICATION and\n  \/\/ set that as the process environment for the process, otherwise the\n  \/\/ python package will think its running in the applicaton.\n  auto processEnv = QProcessEnvironment::systemEnvironment();\n  processEnv.remove(\"TOMVIZ_APPLICATION\");\n  \/\/ Remove vars related to python environment\n  processEnv.remove(\"PYTHONHOME\");\n  processEnv.remove(\"PYTHONPATH\");\n  m_process->setProcessEnvironment(processEnv);\n\n  m_process->start(tomvizPipelineExecutable.filePath(), args);\n\n  return future;\n}\n\nvoid ExternalPythonExecutor::cancel(std::function<void()> canceled)\n{\n\n  reset();\n\n  m_process->kill();\n\n  canceled();\n}\n\nbool ExternalPythonExecutor::cancel(Operator* op)\n{\n  Q_UNUSED(op);\n\n  \/\/ Stop the progress reader\n  m_progressReader->stop();\n\n  m_process->kill();\n\n  \/\/ Clean update state.\n  reset();\n\n  \/\/ We can't cancel an individual operator so we return false, so the caller\n  \/\/ knows\n  return false;\n}\n\nbool ExternalPythonExecutor::isRunning()\n{\n  return !m_process.isNull() && m_process->state() != QProcess::NotRunning;\n}\n\nvoid ExternalPythonExecutor::error(QProcess::ProcessError error)\n{\n  auto process = qobject_cast<QProcess*>(sender());\n  auto invocation = commandLine(process);\n\n  displayError(\"Execution Error\",\n               QString(\"An error occurred executing '%1', '%2'\")\n                 .arg(invocation)\n                 .arg(error));\n}\n\nvoid ExternalPythonExecutor::pipelineStarted()\n{\n  qDebug(\"Pipeline started in external python!\");\n}\n\nvoid ExternalPythonExecutor::reset()\n{\n  ExternalPipelineExecutor::reset();\n\n  m_process->waitForFinished();\n  m_process.reset();\n}\n\nQString ExternalPythonExecutor::executorWorkingDir()\n{\n  return workingDir();\n}\n\nQString ExternalPythonExecutor::commandLine(QProcess* process)\n{\n  return QString(\"%1 %2\")\n    .arg(process->program())\n    .arg(process->arguments().join(\" \"));\n}\n\n} \/\/ namespace tomviz\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"Types.cpp\"\n#include \"Utils.cpp\"\n#include \"json.hpp\"\n#include \"Diagnostics.cpp\"\n#include \"Extension.cpp\"\n#include \"Core.cpp\"\n#include <signal.h>\n#include <curl\/curl.h>\n\nusing namespace L10ns;\nusing namespace TestFramework;\nusing json = nlohmann::json;\n\nint child;\n\nvoid kill_all_processes(int signum) {\n    kill(child, SIGTERM);\n    unlink(\"\/tmp\/l10ns.sock\");\n    exit(signum);\n}\n\nsize_t write_data(void *buffer, size_t size, size_t nmemb, void *userp) {\n   return size * nmemb;\n}\n\nvoid run_extension_tests(Session* session) {\n    string extension_file = join_paths(*session->root_dir, \"Extension.json\");\n    Extension* extension;\n\n    auto start_extension_server = [&]() -> void {\n        extension = Extension::create(session, extension_file);\n        child = extension->start_server();\n        signal(SIGINT, kill_all_processes);\n\n        CURL *curl;\n        CURLcode res;\n        curl = curl_easy_init();\n        while (true) {\n            curl_easy_setopt(curl, CURLOPT_URL, \"http:\/\/localhost:8888\");\n            curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, write_data);\n            res = curl_easy_perform(curl);\n            if(res != CURLE_OK) {\n                continue;\n            }\n\n            curl_easy_cleanup(curl);\n            break;\n        }\n    };\n\n    auto for_each_compilation_test_file = [&](std::function<void (const string&)> callback) -> void {\n        vector<string> comilation_test_files = find_files(*session->root_dir + \"Tests\/Cases\/Compilations\/*\");\n        for (auto const& f : comilation_test_files) {\n            callback(f);\n        }\n    };\n\n    auto for_each_key_extraction_test_file = [&](std::function<void (const string&)> callback) -> void {\n        vector<string> comilation_test_files = find_files(*session->root_dir + \"Tests\/Cases\/KeyExtractions\/*\");\n        for (auto const& f : comilation_test_files) {\n            callback(f);\n        }\n    };\n\n    start_extension_server();\n    domain(\"KeyExtractions\");\n    for_each_key_extraction_test_file([&](const string& test_file) {\n        vector<string> files = { test_file };\n        FileToKeys file_to_keys = extension->get_localization_keys(files, extension->function_names);\n        Json::Value result;\n        for (FileToKeys::iterator it = file_to_keys.begin(); it != file_to_keys.end(); it++) {\n            vector<Key> keys = it->second;\n            Json::Value keys_json = Json::arrayValue;\n            for (auto key_it = keys.begin(); key_it != keys.end(); key_it++) {\n                auto key = key_it;\n                auto params = key->params;\n                Json::Value params_json = Json::arrayValue;\n                for (vector<string>::iterator param_it = params.begin(); param_it != params.end(); param_it++) {\n                    params_json.append(*param_it);\n                }\n                Json::Value key_json;\n                key_json[\"name\"] = key->name;\n                key_json[\"params\"] = params_json;\n                key_json[\"line\"] = key->line;\n                key_json[\"column\"] = key->column;\n                keys_json.append(key_json);\n            }\n            result[it->first] = keys_json;\n        }\n        Json::StreamWriterBuilder builder;\n        builder[\"indentation\"] = \"    \";\n        std::unique_ptr<Json::StreamWriter> writer(builder.newStreamWriter());\n        std::ostringstream string_buffer;\n        writer->write(result, &string_buffer);\n        string result_string = string_buffer.str();\n        result_string = replace_string(result_string, *session->root_dir + \"Tests\/Cases\/\", \"\");\n        string currents_file_path = replace_string(test_file, \"Cases\", \"Currents\");\n        currents_file_path = replace_string(currents_file_path, \".js\", \".json\");\n        string currents_dir = currents_file_path.substr(0, currents_file_path.find_last_of(\"\/\"));\n        recursively_create_dir(currents_dir);\n        write_file(replace_string(currents_file_path, \"Cases\", \"Currents\"), result_string);\n        string reference_file_path = replace_string(currents_file_path, \"Cases\", \"References\");\n        string reference_string = \"\";\n        if (file_exists(reference_file_path)) {\n            reference_string = read_file(reference_file_path);\n        }\n        string test_name = currents_file_path.substr(currents_file_path.find_last_of(\"\/\") + 1);\n        test_name = replace_string(test_name, *session->root_dir, \"\");\n        test(test_name, [reference_string, result_string](Test* t) {\n            if (result_string != reference_string) {\n                cout << result_string << endl;\n                cout << reference_string << endl;\n                throw runtime_error(\"Assertion Error!\");\n            }\n        });\n    });\n    runTests();\n    printResult();\n    kill_all_processes(SIGTERM);\n}\n<commit_msg>Fixes exit code<commit_after>\n#include \"Types.cpp\"\n#include \"Utils.cpp\"\n#include \"json.hpp\"\n#include \"Diagnostics.cpp\"\n#include \"Extension.cpp\"\n#include \"Core.cpp\"\n#include <signal.h>\n#include <curl\/curl.h>\n\nusing namespace L10ns;\nusing namespace TestFramework;\nusing json = nlohmann::json;\n\nint child;\n\nvoid kill_all_processes(int signum) {\n    kill(child, SIGTERM);\n    unlink(\"\/tmp\/l10ns.sock\");\n}\n\nsize_t write_data(void *buffer, size_t size, size_t nmemb, void *userp) {\n   return size * nmemb;\n}\n\nvoid run_extension_tests(Session* session) {\n    string extension_file = join_paths(*session->root_dir, \"Extension.json\");\n    Extension* extension;\n\n    auto start_extension_server = [&]() -> void {\n        extension = Extension::create(session, extension_file);\n        child = extension->start_server();\n        signal(SIGINT, kill_all_processes);\n\n        CURL *curl;\n        CURLcode res;\n        curl = curl_easy_init();\n        while (true) {\n            curl_easy_setopt(curl, CURLOPT_URL, \"http:\/\/localhost:8888\");\n            curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, write_data);\n            res = curl_easy_perform(curl);\n            if(res != CURLE_OK) {\n                continue;\n            }\n\n            curl_easy_cleanup(curl);\n            break;\n        }\n    };\n\n    auto for_each_compilation_test_file = [&](std::function<void (const string&)> callback) -> void {\n        vector<string> comilation_test_files = find_files(*session->root_dir + \"Tests\/Cases\/Compilations\/*\");\n        for (auto const& f : comilation_test_files) {\n            callback(f);\n        }\n    };\n\n    auto for_each_key_extraction_test_file = [&](std::function<void (const string&)> callback) -> void {\n        vector<string> comilation_test_files = find_files(*session->root_dir + \"Tests\/Cases\/KeyExtractions\/*\");\n        for (auto const& f : comilation_test_files) {\n            callback(f);\n        }\n    };\n\n    start_extension_server();\n    domain(\"KeyExtractions\");\n    for_each_key_extraction_test_file([&](const string& test_file) {\n        vector<string> files = { test_file };\n        FileToKeys file_to_keys = extension->get_localization_keys(files, extension->function_names);\n        Json::Value result;\n        for (FileToKeys::iterator it = file_to_keys.begin(); it != file_to_keys.end(); it++) {\n            vector<Key> keys = it->second;\n            Json::Value keys_json = Json::arrayValue;\n            for (auto key_it = keys.begin(); key_it != keys.end(); key_it++) {\n                auto key = key_it;\n                auto params = key->params;\n                Json::Value params_json = Json::arrayValue;\n                for (vector<string>::iterator param_it = params.begin(); param_it != params.end(); param_it++) {\n                    params_json.append(*param_it);\n                }\n                Json::Value key_json;\n                key_json[\"name\"] = key->name;\n                key_json[\"params\"] = params_json;\n                key_json[\"line\"] = key->line;\n                key_json[\"column\"] = key->column;\n                keys_json.append(key_json);\n            }\n            result[it->first] = keys_json;\n        }\n        Json::StreamWriterBuilder builder;\n        builder[\"indentation\"] = \"    \";\n        std::unique_ptr<Json::StreamWriter> writer(builder.newStreamWriter());\n        std::ostringstream string_buffer;\n        writer->write(result, &string_buffer);\n        string result_string = string_buffer.str();\n        result_string = replace_string(result_string, *session->root_dir + \"Tests\/Cases\/\", \"\");\n        string currents_file_path = replace_string(test_file, \"Cases\", \"Currents\");\n        currents_file_path = replace_string(currents_file_path, \".js\", \".json\");\n        string currents_dir = currents_file_path.substr(0, currents_file_path.find_last_of(\"\/\"));\n        recursively_create_dir(currents_dir);\n        write_file(replace_string(currents_file_path, \"Cases\", \"Currents\"), result_string);\n        string reference_file_path = replace_string(currents_file_path, \"Cases\", \"References\");\n        string reference_string = \"\";\n        if (file_exists(reference_file_path)) {\n            reference_string = read_file(reference_file_path);\n        }\n        string test_name = currents_file_path.substr(currents_file_path.find_last_of(\"\/\") + 1);\n        test_name = replace_string(test_name, *session->root_dir, \"\");\n        test(test_name, [reference_string, result_string](Test* t) {\n            if (result_string != reference_string) {\n                cout << result_string << endl;\n                cout << reference_string << endl;\n                throw runtime_error(\"Assertion Error!\");\n            }\n        });\n    });\n    runTests();\n    printResult();\n    kill_all_processes(SIGTERM);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2016 Yahoo Inc. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n#include \"compressor.h\"\n#include <vespa\/vespalib\/util\/memory.h>\n#include <vespa\/vespalib\/util\/stringfmt.h>\n#include <stdexcept>\n#include <lz4.h>\n#include <lz4hc.h>\n\nusing vespalib::alloc::Alloc;\nusing vespalib::ConstBufferRef;\nusing vespalib::DataBuffer;\nusing vespalib::make_string;\n\nnamespace document\n{\n\nsize_t LZ4Compressor::adjustProcessLen(uint16_t, size_t len)   const { return LZ4_compressBound(len); }\nsize_t LZ4Compressor::adjustUnProcessLen(uint16_t, size_t len) const { return len; }\n\nbool\nLZ4Compressor::process(const CompressionConfig& config, const void * inputV, size_t inputLen, void * outputV, size_t & outputLenV)\n{\n    const char * input(static_cast<const char *>(inputV));\n    char * output(static_cast<char *>(outputV));\n    int sz(-1);\n    if (config.compressionLevel > 6) {\n        Alloc state = Alloc::alloc(LZ4_sizeofStateHC());\n        int maxOutputLen = LZ4_compressBound(inputLen);\n        sz = LZ4_compress_HC_extStateHC(state.get(), input, output, inputLen, maxOutputLen, config.compressionLevel);\n    } else {\n        Alloc state = Alloc::alloc(LZ4_sizeofState());\n        sz = LZ4_compress_withState(state.get(), input, output, inputLen);\n    }\n    if (sz != 0) {\n        outputLenV = sz;\n    }\n    assert(sz != 0);\n    return (sz != 0);\n    \n}\n\nbool\nLZ4Compressor::unprocess(const void * inputV, size_t inputLen, void * outputV, size_t & outputLenV)\n{\n    const char * input(static_cast<const char *>(inputV));\n    char * output(static_cast<char *>(outputV));\n    int sz = LZ4_decompress_safe(input, output, inputLen, outputLenV);\n    if (sz > 0) {\n        outputLenV = sz;\n    }\n    assert(sz > 0);\n    return (sz > 0);\n}\n\nCompressionConfig::Type\ncompress(ICompressor & compressor, const CompressionConfig & compression, const ConstBufferRef & org, DataBuffer & dest)\n{\n    CompressionConfig::Type type(CompressionConfig::NONE);\n    dest.ensureFree(compressor.adjustProcessLen(0, org.size()));\n    size_t compressedSize(dest.getFreeLen());\n    if (compressor.process(compression, org.c_str(), org.size(), dest.getFree(), compressedSize)) {\n        if (compressedSize < ((org.size() * compression.threshold)\/100)) {\n            dest.moveFreeToData(compressedSize);\n            type = compression.type;\n        }\n    }\n    return type;\n}\n\nCompressionConfig::Type\ndocompress(const CompressionConfig & compression, const ConstBufferRef & org, DataBuffer & dest)\n{\n    CompressionConfig::Type type(CompressionConfig::NONE);\n    switch (compression.type) {\n    case CompressionConfig::LZ4:\n        {\n            LZ4Compressor lz4;\n            type = compress(lz4, compression, org, dest);\n        }\n        break;\n    case CompressionConfig::NONE:\n    default:\n        break;\n    }\n    return type;\n}\n\nCompressionConfig::Type\ncompress(const CompressionConfig & compression, const ConstBufferRef & org, DataBuffer & dest, bool allowSwap)\n{\n    CompressionConfig::Type type(CompressionConfig::NONE);\n    if (org.size() >= compression.minSize) {\n        type = docompress(compression, org, dest);\n    }\n    if (type == CompressionConfig::NONE) {\n        if (allowSwap) {\n            DataBuffer tmp(const_cast<char *>(org.c_str()), org.size());\n            tmp.moveFreeToData(org.size());\n            dest.swap(tmp);\n        } else {\n            dest.writeBytes(org.c_str(), org.size());\n        }\n    }\n    return type;\n}\n\n\nvoid\ndecompress(ICompressor & decompressor, size_t uncompressedLen, const ConstBufferRef & org, DataBuffer & dest, bool allowSwap)\n{\n    dest.ensureFree(uncompressedLen);\n    size_t realUncompressedLen(dest.getFreeLen());\n    if ( ! decompressor.unprocess(org.c_str(), org.size(), dest.getFree(), realUncompressedLen) ) {\n        if ( uncompressedLen < realUncompressedLen) {\n            if (allowSwap) {\n                DataBuffer tmp(const_cast<char *>(org.c_str()), org.size());\n                tmp.moveFreeToData(org.size());\n                dest.swap(tmp);\n            } else {\n                dest.writeBytes(org.c_str(), org.size());\n            }\n        } else {\n            throw std::runtime_error(make_string(\"unprocess failed had %\" PRIu64 \", wanted %\" PRId64 \", got %\" PRIu64,\n                                                 org.size(), uncompressedLen, realUncompressedLen));\n        }\n    } else {\n        dest.moveFreeToData(realUncompressedLen);\n    }\n}\n\nvoid\ndecompress(const CompressionConfig::Type & type, size_t uncompressedLen, const ConstBufferRef & org, DataBuffer & dest, bool allowSwap)\n{\n    switch (type) {\n    case CompressionConfig::LZ4:\n        {\n            LZ4Compressor lz4;\n            decompress(lz4, uncompressedLen, org, dest, allowSwap);\n        }\n        break;\n    case CompressionConfig::NONE:\n    case CompressionConfig::UNCOMPRESSABLE:\n        if (allowSwap) {\n            DataBuffer tmp(const_cast<char *>(org.c_str()), org.size());\n            tmp.moveFreeToData(org.size());\n            dest.swap(tmp);\n        } else {\n            dest.writeBytes(org.c_str(), org.size());\n        }\n        break;\n    default:\n        throw std::runtime_error(make_string(\"Unable to handle decompression of type '%d'\", type));\n        break;\n    }\n}\n\n}\n<commit_msg>Avoid using deprecated compression method. LZ4_compress_withState -> LZ4_compress_fast_extState.<commit_after>\/\/ Copyright 2016 Yahoo Inc. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n#include \"compressor.h\"\n#include <vespa\/vespalib\/util\/memory.h>\n#include <vespa\/vespalib\/util\/stringfmt.h>\n#include <stdexcept>\n#include <lz4.h>\n#include <lz4hc.h>\n\nusing vespalib::alloc::Alloc;\nusing vespalib::ConstBufferRef;\nusing vespalib::DataBuffer;\nusing vespalib::make_string;\n\nnamespace document\n{\n\nsize_t LZ4Compressor::adjustProcessLen(uint16_t, size_t len)   const { return LZ4_compressBound(len); }\nsize_t LZ4Compressor::adjustUnProcessLen(uint16_t, size_t len) const { return len; }\n\nbool\nLZ4Compressor::process(const CompressionConfig& config, const void * inputV, size_t inputLen, void * outputV, size_t & outputLenV)\n{\n    const char * input(static_cast<const char *>(inputV));\n    char * output(static_cast<char *>(outputV));\n    int sz(-1);\n    int maxOutputLen = LZ4_compressBound(inputLen);\n    if (config.compressionLevel > 6) {\n        Alloc state = Alloc::alloc(LZ4_sizeofStateHC());\n        sz = LZ4_compress_HC_extStateHC(state.get(), input, output, inputLen, maxOutputLen, config.compressionLevel);\n    } else {\n        Alloc state = Alloc::alloc(LZ4_sizeofState());\n        sz = LZ4_compress_fast_extState(state.get(), input, output, inputLen, maxOutputLen, 1);\n    }\n    if (sz != 0) {\n        outputLenV = sz;\n    }\n    assert(sz != 0);\n    return (sz != 0);\n    \n}\n\nbool\nLZ4Compressor::unprocess(const void * inputV, size_t inputLen, void * outputV, size_t & outputLenV)\n{\n    const char * input(static_cast<const char *>(inputV));\n    char * output(static_cast<char *>(outputV));\n    int sz = LZ4_decompress_safe(input, output, inputLen, outputLenV);\n    if (sz > 0) {\n        outputLenV = sz;\n    }\n    assert(sz > 0);\n    return (sz > 0);\n}\n\nCompressionConfig::Type\ncompress(ICompressor & compressor, const CompressionConfig & compression, const ConstBufferRef & org, DataBuffer & dest)\n{\n    CompressionConfig::Type type(CompressionConfig::NONE);\n    dest.ensureFree(compressor.adjustProcessLen(0, org.size()));\n    size_t compressedSize(dest.getFreeLen());\n    if (compressor.process(compression, org.c_str(), org.size(), dest.getFree(), compressedSize)) {\n        if (compressedSize < ((org.size() * compression.threshold)\/100)) {\n            dest.moveFreeToData(compressedSize);\n            type = compression.type;\n        }\n    }\n    return type;\n}\n\nCompressionConfig::Type\ndocompress(const CompressionConfig & compression, const ConstBufferRef & org, DataBuffer & dest)\n{\n    CompressionConfig::Type type(CompressionConfig::NONE);\n    switch (compression.type) {\n    case CompressionConfig::LZ4:\n        {\n            LZ4Compressor lz4;\n            type = compress(lz4, compression, org, dest);\n        }\n        break;\n    case CompressionConfig::NONE:\n    default:\n        break;\n    }\n    return type;\n}\n\nCompressionConfig::Type\ncompress(const CompressionConfig & compression, const ConstBufferRef & org, DataBuffer & dest, bool allowSwap)\n{\n    CompressionConfig::Type type(CompressionConfig::NONE);\n    if (org.size() >= compression.minSize) {\n        type = docompress(compression, org, dest);\n    }\n    if (type == CompressionConfig::NONE) {\n        if (allowSwap) {\n            DataBuffer tmp(const_cast<char *>(org.c_str()), org.size());\n            tmp.moveFreeToData(org.size());\n            dest.swap(tmp);\n        } else {\n            dest.writeBytes(org.c_str(), org.size());\n        }\n    }\n    return type;\n}\n\n\nvoid\ndecompress(ICompressor & decompressor, size_t uncompressedLen, const ConstBufferRef & org, DataBuffer & dest, bool allowSwap)\n{\n    dest.ensureFree(uncompressedLen);\n    size_t realUncompressedLen(dest.getFreeLen());\n    if ( ! decompressor.unprocess(org.c_str(), org.size(), dest.getFree(), realUncompressedLen) ) {\n        if ( uncompressedLen < realUncompressedLen) {\n            if (allowSwap) {\n                DataBuffer tmp(const_cast<char *>(org.c_str()), org.size());\n                tmp.moveFreeToData(org.size());\n                dest.swap(tmp);\n            } else {\n                dest.writeBytes(org.c_str(), org.size());\n            }\n        } else {\n            throw std::runtime_error(make_string(\"unprocess failed had %\" PRIu64 \", wanted %\" PRId64 \", got %\" PRIu64,\n                                                 org.size(), uncompressedLen, realUncompressedLen));\n        }\n    } else {\n        dest.moveFreeToData(realUncompressedLen);\n    }\n}\n\nvoid\ndecompress(const CompressionConfig::Type & type, size_t uncompressedLen, const ConstBufferRef & org, DataBuffer & dest, bool allowSwap)\n{\n    switch (type) {\n    case CompressionConfig::LZ4:\n        {\n            LZ4Compressor lz4;\n            decompress(lz4, uncompressedLen, org, dest, allowSwap);\n        }\n        break;\n    case CompressionConfig::NONE:\n    case CompressionConfig::UNCOMPRESSABLE:\n        if (allowSwap) {\n            DataBuffer tmp(const_cast<char *>(org.c_str()), org.size());\n            tmp.moveFreeToData(org.size());\n            dest.swap(tmp);\n        } else {\n            dest.writeBytes(org.c_str(), org.size());\n        }\n        break;\n    default:\n        throw std::runtime_error(make_string(\"Unable to handle decompression of type '%d'\", type));\n        break;\n    }\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <SFML\/Graphics.hpp>\n\n#include <game-of-life\/Globals.hpp>\n\n#include <array> \n#include <iostream>\n\nclass Game\n{\nprivate:\n    enum class State {\n        Start,\n        Paused, \n        InProgress\n    };\n\n    sf::RenderWindow window{{WIN_WIDTH, WIN_HEIGHT}, \"Conway's Game of Life\"};\n\n    std::array<bool, ROWS*COLS>               current_world = {{false}};\n    std::array<bool, ROWS*COLS>               updated_world = {{false}};\n    std::array<sf::RectangleShape, ROWS*COLS> grid;\n    \n    sf::Font liberationSans;\n    sf::Text textState;\n\n    State state{State::Paused};\n\n    bool pausePressedLastFrame{false};\n\npublic:\n    Game()\n    {\n        window.setVerticalSyncEnabled(true);\n\n        liberationSans.loadFromFile(R\"(..\/resources\/fonts\/LiberationSans-Regular.ttf)\");\n\n        \/\/ Text for game state\n        textState.setFont(liberationSans);\n        textState.setCharacterSize(35.f);\n        textState.setColor(sf::Color::Black);\n        textState.setString(\"Paused\");\n        auto stateBox = textState.getLocalBounds();\n        textState.setOrigin(stateBox.left + stateBox.width\/2.f, \n                            stateBox.top  + stateBox.height\/2.f);\n        textState.setPosition(WIN_WIDTH\/2.f, WIN_HEIGHT\/2.f);\n\n        \/\/ Setup grid\n        for (int r = 0; r < ROWS; r++) {\n            for (int c = 0; c < COLS; c++) {\n                sf::RectangleShape cell;\n                cell.setOrigin(SQUARE_SIZE \/ 2.f, SQUARE_SIZE \/ 2.f);\n                cell.setPosition((c*SQUARE_SIZE)+(SQUARE_SIZE\/2.f), (r*SQUARE_SIZE)+(SQUARE_SIZE\/2.f));\n                cell.setSize({SQUARE_SIZE, SQUARE_SIZE});\n                cell.setFillColor(sf::Color::White);\n                grid[idx(r,c)] = cell;\n            }\n        }\n    }\n\n    \/\/ Reset the state of the grid\n    void restart()\n    {\n        state = State::Start;\n\n        current_world.fill(false);\n        updated_world.fill(false);\n\n        \/\/ Add glider in upper left corner\n        current_world[idx(0,1)] = true;\n        current_world[idx(1,2)] = true;\n        current_world[idx(2,0)] = true;\n        current_world[idx(2,1)] = true;\n        current_world[idx(2,2)] = true;\n\n        \/\/ Add some other random shit\n        for (int i = 0; i < ROWS; i++)\n            current_world[idx(i % 11, (i + 3) % 7)] = true;\n        for (int i = 0; i < COLS; i++)\n            current_world[idx(i % 7, (i + 5) % 11)] = true;\n\n        window.clear(sf::Color::White);\n    }\n\n    \/\/ Enter game loop\n    void run()\n    {\n        sf::Time sleepTime = sf::seconds(0.1f);\n        while (window.isOpen()) {\n            processEvents();\n            render();\n            update();\n            sf::sleep(sleepTime);\n        }\n    }\n\nprivate:\n    \/\/ Process external events\n    void processEvents()\n    {\n        sf::Event event;\n        while (window.pollEvent(event)) {\n            if (event.type == sf::Event::Closed)\n                window.close();\n        }\n    }\n\n    \/\/ Update the state of the grid\n    void update()\n    {\n        \/\/ Calculate updated world\n        for (int r = 0; r < ROWS; r++)\n            for (int c = 0; c < COLS; c++)\n                updated_world[idx(r,c)] = liveOrDie(r, c, adjacentNeighbors(r,c));\n\n        \/\/ Update current world\n        for (int r = 0; r < ROWS; r++)\n            for (int c = 0; c < COLS; c++) {\n                current_world[idx(r,c)] = updated_world[idx(r,c)];\n                grid[idx(r,c)].setFillColor(current_world[idx(r,c)] ? sf::Color::Black : sf::Color::White);\n            }\n    }\n\n    \/\/ Render the state of the grid to the window\n    void render()\n    {\n        window.clear(sf::Color::White);\n        for (auto& cell : grid)\n            window.draw(cell);\n        window.display();\n    }\n\n    \/\/ Translate grid index to linear index\n    int idx(int r, int c)\n    {\n        return COLS*r + c;\n    }\n\n    \/\/ Determine whether a given cell should live or die\n    int liveOrDie(int r, int c, int n)\n    {\n        return n == 3 || (n == 2 && current_world[idx(r,c)]);\n    }\n\n    \/\/ Count number of neighbors around each cell, making\n    \/\/ sure not to count the cell itself\n    int adjacentNeighbors(int r, int c)\n    {\n        int n = 0;\n        for (int r1 = r-1; r1 < r+2; r1++)\n            for (int c1 = c-1; c1 < c+2; c1++)\n                if (current_world[idx((r1+ROWS) % ROWS, (c1+COLS) % COLS)])\n                    n++;\n\n        if (current_world[idx(r,c)])\n            n--;\n\n        return n;\n    }\n};\n<commit_msg>Click to initialize grid<commit_after>#pragma once\n\n#include <SFML\/Graphics.hpp>\n\n#include <game-of-life\/Globals.hpp>\n\n#include <array> \n#include <iostream>\n\nclass Game\n{\nprivate:\n    enum class State {\n        Start,\n        Paused, \n        InProgress\n    };\n\n    sf::RenderWindow window{{WIN_WIDTH, WIN_HEIGHT}, \"Conway's Game of Life\"};\n\n    std::array<bool, ROWS*COLS>               current_world = {{false}};\n    std::array<bool, ROWS*COLS>               updated_world = {{false}};\n    std::array<sf::RectangleShape, ROWS*COLS> grid;\n    \n    sf::Font liberationSans;\n    sf::Text textState;\n\n    sf::Vector2i mousePosition;\n\n    State state{State::Paused};\n\n    bool pausePressedLastFrame{false};\n\npublic:\n    Game()\n    {\n        window.setVerticalSyncEnabled(true);\n\n        liberationSans.loadFromFile(R\"(..\/resources\/fonts\/LiberationSans-Regular.ttf)\");\n\n        \/\/ Text for game state\n        textState.setFont(liberationSans);\n        textState.setCharacterSize(35.f);\n        textState.setColor(sf::Color::Black);\n        textState.setString(\"Paused\");\n        auto stateBox = textState.getLocalBounds();\n        textState.setOrigin(stateBox.left + stateBox.width\/2.f, \n                            stateBox.top  + stateBox.height\/2.f);\n        textState.setPosition(WIN_WIDTH\/2.f, WIN_HEIGHT\/2.f);\n\n        \/\/ Setup grid\n        for (int r = 0; r < ROWS; r++) {\n            for (int c = 0; c < COLS; c++) {\n                sf::RectangleShape cell;\n                cell.setOrigin(SQUARE_SIZE \/ 2.f, SQUARE_SIZE \/ 2.f);\n                cell.setPosition((c*SQUARE_SIZE)+(SQUARE_SIZE\/2.f), (r*SQUARE_SIZE)+(SQUARE_SIZE\/2.f));\n                cell.setSize({SQUARE_SIZE, SQUARE_SIZE});\n                cell.setFillColor(sf::Color::White);\n                grid[idx(r,c)] = cell;\n            }\n        }\n    }\n\n    \/\/ Reset the state of the grid\n    void restart()\n    {\n        state = State::Start;\n\n        current_world.fill(false);\n        updated_world.fill(false);\n\n        \/\/ Add glider in upper left corner\n        \/*\n        current_world[idx(0,1)] = true;\n        current_world[idx(1,2)] = true;\n        current_world[idx(2,0)] = true;\n        current_world[idx(2,1)] = true;\n        current_world[idx(2,2)] = true;\n\n        \/\/ Add some other random shit\n        for (int i = 0; i < ROWS; i++)\n            current_world[idx(i % 11, (i + 3) % 7)] = true;\n        for (int i = 0; i < COLS; i++)\n            current_world[idx(i % 7, (i + 5) % 11)] = true;\n        *\/\n\n        window.clear(sf::Color::White);\n    }\n\n    \/\/ Enter game loop\n    void run()\n    {\n        while (state == State::Start) {\n            processStartEvents();\n            render();\n        }\n\n\n        sf::Time sleepTime = sf::seconds(0.1f);\n        while (window.isOpen()) {\n            processEvents();\n            render();\n            update();\n            sf::sleep(sleepTime);\n        }\n    }\n\nprivate:\n    \/\/ Process events in start state\n    void processStartEvents()\n    {\n        sf::Event event;\n        while (window.pollEvent(event)) {\n            if (event.type == sf::Event::Closed) {\n                window.close();\n            } else if (event.type == sf::Event::MouseButtonPressed) {\n                mousePosition = sf::Mouse::getPosition(window);\n                int mx = mousePosition.x;\n                int my = mousePosition.y;\n                if (0 <= mx and mx < WIN_WIDTH and 0 <= my and my < WIN_HEIGHT) {\n                    int gridIdx = idx(my \/ SQUARE_SIZE, mx \/ SQUARE_SIZE);\n\n                    grid[gridIdx].setFillColor(sf::Color::Black);\n                    current_world[gridIdx] = true;\n                }\n            }\n        }\n\n        if (sf::Keyboard::isKeyPressed(sf::Keyboard::Key::Return))\n            state = State::InProgress;\n    }\n\n    \/\/ Process external events\n    void processEvents()\n    {\n        sf::Event event;\n        while (window.pollEvent(event)) {\n            if (event.type == sf::Event::Closed) {\n                window.close();\n            } else if (event.type == sf::Event::MouseButtonPressed) {\n        \n            }\n        }\n    }\n\n    \/\/ Update the state of the grid\n    void update()\n    {\n        \/\/ Calculate updated world\n        for (int r = 0; r < ROWS; r++)\n            for (int c = 0; c < COLS; c++)\n                updated_world[idx(r,c)] = liveOrDie(r, c, adjacentNeighbors(r,c));\n\n        \/\/ Update current world\n        for (int r = 0; r < ROWS; r++) {\n            for (int c = 0; c < COLS; c++) {\n                current_world[idx(r,c)] = updated_world[idx(r,c)];\n                grid[idx(r,c)].setFillColor(current_world[idx(r,c)] ? sf::Color::Black : sf::Color::White);\n            }\n        }\n    }\n\n    \/\/ Render the state of the grid to the window\n    void render()\n    {\n        window.clear(sf::Color::White);\n        for (auto& cell : grid)\n            window.draw(cell);\n        window.display();\n    }\n\n    \/\/ Translate grid index to linear index\n    int idx(int r, int c)\n    {\n        return COLS*r + c;\n    }\n\n    \/\/ Determine whether a given cell should live or die\n    int liveOrDie(int r, int c, int n)\n    {\n        return n == 3 or (n == 2 and current_world[idx(r,c)]);\n    }\n\n    \/\/ Count number of neighbors around each cell, making\n    \/\/ sure not to count the cell itself\n    int adjacentNeighbors(int r, int c)\n    {\n        int n = 0;\n        for (int r1 = r-1; r1 < r+2; r1++)\n            for (int c1 = c-1; c1 < c+2; c1++)\n                if (current_world[idx((r1+ROWS) % ROWS, (c1+COLS) % COLS)])\n                    n++;\n\n        if (current_world[idx(r,c)])\n            n--;\n\n        return n;\n    }\n};\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) Microsoft Corporation. All rights reserved.\n\/\/ Licensed under the MIT License.\n\n#include \"core\/providers\/cpu\/tensor\/space_depth_ops.h\"\n#include \"core\/util\/eigen_common_wrapper.h\"\n#include <array>\n\nnamespace onnxruntime {\n\nONNX_CPU_OPERATOR_KERNEL(\n    SpaceToDepth,\n    1,\n    KernelDefBuilder().TypeConstraint(\"T\", DataTypeImpl::GetTensorType<float>()),\n    SpaceToDepth<float>);\n\nONNX_CPU_OPERATOR_VERSIONED_KERNEL(\n    DepthToSpace,\n    1, 10,\n    KernelDefBuilder().TypeConstraint(\"T\", DataTypeImpl::GetTensorType<float>()),\n    DepthToSpace<float>);\n\nONNX_CPU_OPERATOR_KERNEL(\n    DepthToSpace,\n    11,\n    KernelDefBuilder().TypeConstraint(\"T\", DataTypeImpl::GetTensorType<float>()),\n    DepthToSpace<float>);\n\n\/\/ intemediate tensor shapes are:\n\/\/ (batch, blocksize, blocksize, input_depth \/ (blocksize * blocksize), input_height, input_width) for DepthToSpace\n\/\/ (batch, input_depth, input_height \/ blocksize, blocksize, input_width \/ blocksize, blocksize) for SpaceToDepth\nconst int IntermediateTensorRank = 6;\ntypedef Eigen::TensorMap<Eigen::Tensor<float, IntermediateTensorRank, Eigen::RowMajor, int64_t>,\n                         Eigen::Aligned>\n    EigenTensorMap;\n\ntemplate <>\nStatus SpaceToDepth<float>::Compute(OpKernelContext* context) const {\n  const auto* tensor_pointer = context->Input<Tensor>(0);\n  if (tensor_pointer == nullptr) return Status(common::ONNXRUNTIME, common::FAIL, \"input count mismatch\");\n  const Tensor& input = *tensor_pointer;\n  ORT_ENFORCE(input.Shape().NumDimensions() == 4);\n  const int64_t batch = input.Shape().GetDims().at(0);\n  const int64_t input_depth = input.Shape().GetDims().at(1);\n  const int64_t input_height = input.Shape().GetDims().at(2);\n  const int64_t input_width = input.Shape().GetDims().at(3);\n  ORT_ENFORCE(input_height % this->blocksize_ == 0);\n  ORT_ENFORCE(input_width % this->blocksize_ == 0);\n\n  const int64_t output_depth = input_depth * blocksize_ * blocksize_;\n  const int64_t output_height = input_height \/ blocksize_;\n  const int64_t output_width = input_width \/ blocksize_;\n  Tensor& output = *context->Output(0, {batch, output_depth, output_height, output_width});\n\n  std::array<int64_t, IntermediateTensorRank> permutation{{0, 3, 5, 1, 2, 4}};\n  EigenTensorMap(output.template MutableData<float>(), batch, blocksize_, blocksize_,\n                 input_depth, input_height \/ blocksize_, input_width \/ blocksize_) =\n      EigenTensorMap(const_cast<float*>(input.template Data<float>()), batch,\n                     input_depth, input_height \/ blocksize_, blocksize_,\n                     input_width \/ blocksize_, blocksize_)\n          .shuffle(permutation);\n\n  return Status::OK();\n}\n\ntemplate <>\nStatus DepthToSpace<float>::Compute(OpKernelContext* context) const {\n  const auto* tensor_pointer = context->Input<Tensor>(0);\n  if (tensor_pointer == nullptr) return Status(common::ONNXRUNTIME, common::FAIL, \"input count mismatch\");\n  const Tensor& input = *tensor_pointer;\n  ORT_ENFORCE(input.Shape().NumDimensions() == 4);\n\n  const int64_t batch = input.Shape().GetDims().at(0);\n  const int64_t input_depth = input.Shape().GetDims().at(1);\n  const int64_t input_height = input.Shape().GetDims().at(2);\n  const int64_t input_width = input.Shape().GetDims().at(3);\n  ORT_ENFORCE(input_depth % (blocksize_ * blocksize_) == 0);\n\n  const int64_t output_depth = input_depth \/ blocksize_ \/ blocksize_;\n  const int64_t output_height = input_height * blocksize_;\n  const int64_t output_width = input_width * blocksize_;\n\n  Tensor& output = *context->Output(0, {batch, output_depth, output_height, output_width});\n  \n  \/\/ Process \"DCR\" mode\n  if (is_dcr_) {\n    std::array<int64_t, IntermediateTensorRank> permutation{{0, 3, 4, 1, 5, 2}};\n    EigenTensorMap(output.template MutableData<float>(), batch, input_depth \/ blocksize_ \/ blocksize_,\n                   input_height, blocksize_, input_width, blocksize_) =\n        EigenTensorMap(const_cast<float*>(input.template Data<float>()), batch,\n                       blocksize_, blocksize_, input_depth \/ blocksize_ \/ blocksize_,\n                       input_height, input_width)\n            .shuffle(permutation);   \n  }\n\n  \/\/ Process \"CRD\" mode\n  else {\n    std::array<int64_t, IntermediateTensorRank> permutation{{0, 1, 4, 2, 5, 3}};\n    EigenTensorMap(output.template MutableData<float>(), batch, input_depth \/ blocksize_ \/ blocksize_,\n                   input_height, blocksize_, input_width, blocksize_) =\n        EigenTensorMap(const_cast<float*>(input.template Data<float>()), batch,\n                       input_depth \/ blocksize_ \/ blocksize_, blocksize_, blocksize_,\n                       input_height, input_width)\n            .shuffle(permutation);  \n  }\n\n  return Status::OK();\n}\n\n}  \/\/ namespace onnxruntime\n<commit_msg>Add helper to create output to minimize binary size. (#2365)<commit_after>\/\/ Copyright (c) Microsoft Corporation. All rights reserved.\n\/\/ Licensed under the MIT License.\n\n#include \"core\/providers\/cpu\/tensor\/space_depth_ops.h\"\n#include \"core\/util\/eigen_common_wrapper.h\"\n#include <array>\n\nnamespace onnxruntime {\n\nONNX_CPU_OPERATOR_KERNEL(\n    SpaceToDepth,\n    1,\n    KernelDefBuilder().TypeConstraint(\"T\", DataTypeImpl::GetTensorType<float>()),\n    SpaceToDepth<float>);\n\nONNX_CPU_OPERATOR_VERSIONED_KERNEL(\n    DepthToSpace,\n    1, 10,\n    KernelDefBuilder().TypeConstraint(\"T\", DataTypeImpl::GetTensorType<float>()),\n    DepthToSpace<float>);\n\nONNX_CPU_OPERATOR_KERNEL(\n    DepthToSpace,\n    11,\n    KernelDefBuilder().TypeConstraint(\"T\", DataTypeImpl::GetTensorType<float>()),\n    DepthToSpace<float>);\n\n\/\/ intermediate tensor shapes are:\n\/\/ (batch, blocksize, blocksize, input_depth \/ (blocksize * blocksize), input_height, input_width) for DepthToSpace\n\/\/ (batch, input_depth, input_height \/ blocksize, blocksize, input_width \/ blocksize, blocksize) for SpaceToDepth\nconst int IntermediateTensorRank = 6;\ntypedef Eigen::TensorMap<Eigen::Tensor<float, IntermediateTensorRank, Eigen::RowMajor, int64_t>,\n                         Eigen::Aligned>\n    EigenTensorMap;\n\ntypedef Eigen::TensorMap<Eigen::Tensor<const float, IntermediateTensorRank, Eigen::RowMajor, int64_t>,\n                         Eigen::Aligned>\n    ConstEigenTensorMap;\n\n\/\/ helper to create output to minimize binary size\nstatic void CreateOutput(const Tensor& input, Tensor& output,\n                         const std::array<int64_t, IntermediateTensorRank>& permutation,\n                         const int64_t batch_size,  \/\/ dim0 in both input and output\n                         const int64_t in_dim1, const int64_t in_dim2, const int64_t in_dim3,\n                         const int64_t in_dim4, const int64_t in_dim5,\n                         const int64_t out_dim1, const int64_t out_dim2, const int64_t out_dim3,\n                         const int64_t out_dim4, const int64_t out_dim5) {\n  EigenTensorMap(output.template MutableData<float>(), batch_size, out_dim1, out_dim2, out_dim3, out_dim4, out_dim5) =\n      ConstEigenTensorMap(input.template Data<float>(), batch_size,\n                          in_dim1, in_dim2, in_dim3, in_dim4, in_dim5)\n          .shuffle(permutation);\n}\n\ntemplate <>\nStatus SpaceToDepth<float>::Compute(OpKernelContext* context) const {\n  const auto* tensor_pointer = context->Input<Tensor>(0);\n  if (tensor_pointer == nullptr) return Status(common::ONNXRUNTIME, common::FAIL, \"input count mismatch\");\n  const Tensor& input = *tensor_pointer;\n  ORT_ENFORCE(input.Shape().NumDimensions() == 4);\n  const int64_t batch = input.Shape().GetDims().at(0);\n  const int64_t input_depth = input.Shape().GetDims().at(1);\n  const int64_t input_height = input.Shape().GetDims().at(2);\n  const int64_t input_width = input.Shape().GetDims().at(3);\n  ORT_ENFORCE(input_height % this->blocksize_ == 0);\n  ORT_ENFORCE(input_width % this->blocksize_ == 0);\n\n  const int64_t output_depth = input_depth * blocksize_ * blocksize_;\n  const int64_t output_height = input_height \/ blocksize_;\n  const int64_t output_width = input_width \/ blocksize_;\n  Tensor& output = *context->Output(0, {batch, output_depth, output_height, output_width});\n\n  std::array<int64_t, IntermediateTensorRank> permutation{{0, 3, 5, 1, 2, 4}};\n  CreateOutput(input, output, permutation, batch,\n               input_depth, input_height \/ blocksize_, blocksize_, input_width \/ blocksize_, blocksize_,\n               blocksize_, blocksize_, input_depth, input_height \/ blocksize_, input_width \/ blocksize_);\n\n  return Status::OK();\n}\n\ntemplate <>\nStatus DepthToSpace<float>::Compute(OpKernelContext* context) const {\n  const auto* tensor_pointer = context->Input<Tensor>(0);\n  if (tensor_pointer == nullptr) return Status(common::ONNXRUNTIME, common::FAIL, \"input count mismatch\");\n  const Tensor& input = *tensor_pointer;\n  ORT_ENFORCE(input.Shape().NumDimensions() == 4);\n\n  const int64_t batch = input.Shape().GetDims().at(0);\n  const int64_t input_depth = input.Shape().GetDims().at(1);\n  const int64_t input_height = input.Shape().GetDims().at(2);\n  const int64_t input_width = input.Shape().GetDims().at(3);\n  ORT_ENFORCE(input_depth % (blocksize_ * blocksize_) == 0);\n\n  const int64_t output_depth = input_depth \/ blocksize_ \/ blocksize_;\n  const int64_t output_height = input_height * blocksize_;\n  const int64_t output_width = input_width * blocksize_;\n\n  Tensor& output = *context->Output(0, {batch, output_depth, output_height, output_width});\n\n  \/\/ handle DCR and CRD format\n  auto dim1 = is_dcr_ ? blocksize_ : input_depth \/ blocksize_ \/ blocksize_;\n  auto dim3 = is_dcr_ ? input_depth \/ blocksize_ \/ blocksize_ : blocksize_;\n\n  auto permutation = is_dcr_ ? std::array<int64_t, IntermediateTensorRank>{{0, 3, 4, 1, 5, 2}}\n                             : std::array<int64_t, IntermediateTensorRank>{{0, 1, 4, 2, 5, 3}};\n\n  CreateOutput(input, output, permutation, batch,\n               dim1, blocksize_, dim3, input_height, input_width,\n               input_depth \/ blocksize_ \/ blocksize_, input_height, blocksize_, input_width, blocksize_);\n\n  return Status::OK();\n}\n\n}  \/\/ namespace onnxruntime\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2000, 2010 Oracle and\/or its affiliates.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org.  If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_unotools.hxx\"\n\n#include <unotools\/xmlaccelcfg.hxx>\n\n#include <vector>\n#include <com\/sun\/star\/xml\/sax\/XAttributeList.hpp>\n#include <cppuhelper\/implbase1.hxx>\n\nusing namespace rtl;\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::xml::sax;\n\n#define ELEMENT_ACCELERATORLIST     \"acceleratorlist\"\n#define ELEMENT_ACCELERATORITEM     \"item\"\n\n#define ATTRIBUTE_KEYCODE           \"code\"\n#define ATTRIBUTE_MODIFIER          \"modifier\"\n#define ATTRIBUTE_URL               \"url\"\n\n#define ATTRIBUTE_TYPE_CDATA        \"CDATA\"\n\n\/\/ ------------------------------------------------------------------\n\nstruct AttributeListImpl_impl;\nclass AttributeListImpl : public ::cppu::WeakImplHelper1< ::com::sun::star::xml::sax::XAttributeList >\n{\nprotected:\n    ~AttributeListImpl();\n\npublic:\n    AttributeListImpl();\n    AttributeListImpl( const AttributeListImpl & );\n\npublic:\n    virtual sal_Int16 SAL_CALL getLength(void) throw (::com::sun::star::uno::RuntimeException);\n    virtual ::rtl::OUString  SAL_CALL getNameByIndex(sal_Int16 i) throw (::com::sun::star::uno::RuntimeException);\n    virtual ::rtl::OUString  SAL_CALL getTypeByIndex(sal_Int16 i) throw (::com::sun::star::uno::RuntimeException);\n    virtual ::rtl::OUString  SAL_CALL getTypeByName(const ::rtl::OUString& aName) throw (::com::sun::star::uno::RuntimeException);\n    virtual ::rtl::OUString  SAL_CALL getValueByIndex(sal_Int16 i) throw (::com::sun::star::uno::RuntimeException);\n    virtual ::rtl::OUString  SAL_CALL getValueByName(const ::rtl::OUString& aName) throw (::com::sun::star::uno::RuntimeException);\n\npublic:\n    void addAttribute( const ::rtl::OUString &sName , const ::rtl::OUString &sType , const ::rtl::OUString &sValue );\n    void clear();\n\nprivate:\n    struct AttributeListImpl_impl *m_pImpl;\n};\n\nstruct TagAttribute\n{\n    TagAttribute(){}\n    TagAttribute( const OUString &aName, const OUString &aType , const OUString &aValue )\n    {\n        sName   = aName;\n        sType   = aType;\n        sValue  = aValue;\n    }\n\n    OUString sName;\n    OUString sType;\n    OUString sValue;\n};\n\nstruct AttributeListImpl_impl\n{\n    AttributeListImpl_impl()\n    {\n        \/\/ performance improvement during adding\n        vecAttribute.reserve(20);\n    }\n    ::std::vector<struct TagAttribute> vecAttribute;\n};\n\n\n\nsal_Int16 SAL_CALL AttributeListImpl::getLength(void) throw (RuntimeException)\n{\n    return sal::static_int_cast< sal_Int16 >(m_pImpl->vecAttribute.size());\n}\n\n\nAttributeListImpl::AttributeListImpl( const AttributeListImpl &r ) :\n    cppu::WeakImplHelper1<com::sun::star::xml::sax::XAttributeList>(r)\n{\n    m_pImpl = new AttributeListImpl_impl;\n    *m_pImpl = *(r.m_pImpl);\n}\n\nOUString AttributeListImpl::getNameByIndex(sal_Int16 i) throw (RuntimeException)\n{\n    if( i < sal::static_int_cast<sal_Int16>(m_pImpl->vecAttribute.size()) ) {\n        return m_pImpl->vecAttribute[i].sName;\n    }\n    return OUString();\n}\n\n\nOUString AttributeListImpl::getTypeByIndex(sal_Int16 i) throw (RuntimeException)\n{\n    if( i < sal::static_int_cast<sal_Int16>(m_pImpl->vecAttribute.size()) ) {\n        return m_pImpl->vecAttribute[i].sType;\n    }\n    return OUString();\n}\n\nOUString AttributeListImpl::getValueByIndex(sal_Int16 i) throw (RuntimeException)\n{\n    if( i < sal::static_int_cast<sal_Int16>(m_pImpl->vecAttribute.size()) ) {\n        return m_pImpl->vecAttribute[i].sValue;\n    }\n    return OUString();\n\n}\n\nOUString AttributeListImpl::getTypeByName( const OUString& sName ) throw (RuntimeException)\n{\n    ::std::vector<struct TagAttribute>::iterator ii = m_pImpl->vecAttribute.begin();\n\n    for( ; ii != m_pImpl->vecAttribute.end() ; ii ++ ) {\n        if( (*ii).sName == sName ) {\n            return (*ii).sType;\n        }\n    }\n    return OUString();\n}\n\nOUString AttributeListImpl::getValueByName(const OUString& sName) throw (RuntimeException)\n{\n    ::std::vector<struct TagAttribute>::iterator ii = m_pImpl->vecAttribute.begin();\n\n    for( ; ii != m_pImpl->vecAttribute.end() ; ii ++ ) {\n        if( (*ii).sName == sName ) {\n            return (*ii).sValue;\n        }\n    }\n    return OUString();\n}\n\n\nAttributeListImpl::AttributeListImpl()\n{\n    m_pImpl = new AttributeListImpl_impl;\n}\n\n\n\nAttributeListImpl::~AttributeListImpl()\n{\n    delete m_pImpl;\n}\n\n\nvoid AttributeListImpl::addAttribute(   const OUString &sName ,\n                                        const OUString &sType ,\n                                        const OUString &sValue )\n{\n    m_pImpl->vecAttribute.push_back( TagAttribute( sName , sType , sValue ) );\n}\n\nvoid AttributeListImpl::clear()\n{\n    ::std::vector<struct TagAttribute> dummy;\n    m_pImpl->vecAttribute.swap( dummy );\n\n    OSL_ASSERT( ! getLength() );\n}\n\n\/\/ ------------------------------------------------------------------\n\nAny SAL_CALL OReadAccelatorDocumentHandler::queryInterface( const Type & rType ) throw( RuntimeException )\n{\n    Any a = ::cppu::queryInterface( rType ,SAL_STATIC_CAST( XDocumentHandler*, this ));\n    if ( a.hasValue() )\n        return a;\n    else\n        return OWeakObject::queryInterface( rType );\n}\n\nvoid SAL_CALL OReadAccelatorDocumentHandler::ignorableWhitespace(\n    const OUString& )\nthrow( SAXException, RuntimeException )\n{\n}\n\nvoid SAL_CALL OReadAccelatorDocumentHandler::processingInstruction(\n    const OUString&, const OUString& )\nthrow( SAXException, RuntimeException )\n{\n}\n\nvoid SAL_CALL OReadAccelatorDocumentHandler::setDocumentLocator(\n    const Reference< XLocator > &xLocator)\nthrow(  SAXException, RuntimeException )\n{\n    m_xLocator = xLocator;\n}\n\n::rtl::OUString OReadAccelatorDocumentHandler::getErrorLineString()\n{\n    char buffer[32];\n\n    if ( m_xLocator.is() )\n    {\n        return OUString::createFromAscii( buffer );\n    }\n    else\n        return OUString();\n}\n\nvoid SAL_CALL OReadAccelatorDocumentHandler::startDocument(void)\n    throw ( SAXException, RuntimeException )\n{\n}\n\nvoid SAL_CALL OReadAccelatorDocumentHandler::endDocument(void)\n    throw( SAXException, RuntimeException )\n{\n    if ( m_nElementDepth > 0 )\n    {\n        OUString aErrorMessage = getErrorLineString();\n        aErrorMessage += OUString( RTL_CONSTASCII_USTRINGPARAM( \"A closing element is missing!\" ));\n        throw SAXException( aErrorMessage, Reference< XInterface >(), Any() );\n    }\n}\n\n\nvoid SAL_CALL OReadAccelatorDocumentHandler::startElement(\n    const OUString& aElementName, const Reference< XAttributeList > &xAttrList )\nthrow( SAXException, RuntimeException )\n{\n    m_nElementDepth++;\n\n    if ( aElementName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM( ELEMENT_ACCELERATORLIST )))\n    {\n        \/\/ acceleratorlist\n        if ( m_bAcceleratorMode )\n        {\n            OUString aErrorMessage = getErrorLineString();\n            aErrorMessage += OUString( RTL_CONSTASCII_USTRINGPARAM( \"Accelerator list used twice!\" ));\n            throw SAXException( aErrorMessage, Reference< XInterface >(), Any() );\n        }\n        else\n            m_bAcceleratorMode = sal_True;\n    }\n    else if ( aElementName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM( ELEMENT_ACCELERATORITEM )))\n    {\n        \/\/ accelerator item\n        if ( !m_bAcceleratorMode )\n        {\n            OUString aErrorMessage = getErrorLineString();\n            aErrorMessage += OUString( RTL_CONSTASCII_USTRINGPARAM( \"Accelerator list element has to be used before!\" ));\n            throw SAXException( aErrorMessage, Reference< XInterface >(), Any() );\n        }\n        else\n        {\n            \/\/ read accelerator item\n            m_bItemCloseExpected = sal_True;\n\n            SvtAcceleratorConfigItem aItem;\n\n            \/\/ read attributes for accelerator\n            for ( sal_Int16 i=0; i< xAttrList->getLength(); i++ )\n            {\n                OUString aName = xAttrList->getNameByIndex( i );\n                OUString aValue = xAttrList->getValueByIndex( i );\n\n                if ( aName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM( ATTRIBUTE_URL )))\n                    aItem.aCommand = aValue;\n                else if ( aName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM( ATTRIBUTE_MODIFIER )))\n                    aItem.nModifier = (sal_uInt16)aValue.toInt32();\n                else if ( aName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM( ATTRIBUTE_KEYCODE )))\n                    aItem.nCode = (sal_uInt16)aValue.toInt32();\n            }\n\n            m_aReadAcceleratorList.push_back( aItem );\n        }\n    }\n    else\n    {\n        OUString aErrorMessage = getErrorLineString();\n        aErrorMessage += OUString( RTL_CONSTASCII_USTRINGPARAM( \"Unknown element found!\" ));\n        throw SAXException( aErrorMessage, Reference< XInterface >(), Any() );\n    }\n}\n\n\nvoid SAL_CALL OReadAccelatorDocumentHandler::characters(const rtl::OUString&)\nthrow(  SAXException, RuntimeException )\n{\n}\n\n\nvoid SAL_CALL OReadAccelatorDocumentHandler::endElement( const OUString& aName )\n    throw( SAXException, RuntimeException )\n{\n    m_nElementDepth--;\n\n    if ( aName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM( ELEMENT_ACCELERATORLIST )))\n    {\n        \/\/ acceleratorlist\n        if ( !m_bAcceleratorMode )\n        {\n            OUString aErrorMessage = getErrorLineString();\n            aErrorMessage += OUString( RTL_CONSTASCII_USTRINGPARAM( \"Accelerator list used twice!\" ));\n            throw SAXException( aErrorMessage, Reference< XInterface >(), Any() );\n        }\n    }\n    else if ( aName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM( ELEMENT_ACCELERATORITEM )))\n    {\n        if ( !m_bItemCloseExpected )\n        {\n            OUString aErrorMessage = getErrorLineString();\n            aErrorMessage += OUString( RTL_CONSTASCII_USTRINGPARAM( \"Closing accelerator item element expected!\" ));\n            throw SAXException( aErrorMessage, Reference< XInterface >(), Any() );\n        }\n    }\n    else\n    {\n        OUString aErrorMessage = getErrorLineString();\n        aErrorMessage += OUString( RTL_CONSTASCII_USTRINGPARAM( \"Unknown closing element found!\" ));\n        throw SAXException( aErrorMessage, Reference< XInterface >(), Any() );\n    }\n}\n\n\/\/ ------------------------------------------------------------------\n\nOWriteAccelatorDocumentHandler::OWriteAccelatorDocumentHandler(\n    const SvtAcceleratorItemList& aWriteAcceleratorList, Reference< XDocumentHandler > xDocumentHandler ) :\n    m_xWriteDocumentHandler( xDocumentHandler ),\n    m_aWriteAcceleratorList( aWriteAcceleratorList )\n{\n    m_aAttributeType = OUString( RTL_CONSTASCII_USTRINGPARAM( ATTRIBUTE_TYPE_CDATA ));\n}\n\nOWriteAccelatorDocumentHandler::~OWriteAccelatorDocumentHandler()\n{\n}\n\nvoid OWriteAccelatorDocumentHandler::WriteAcceleratorDocument()\n    throw ( SAXException, RuntimeException )\n{\n    AttributeListImpl* pList = new AttributeListImpl;\n    Reference< XAttributeList > rList( (XAttributeList *)pList , UNO_QUERY );\n\n    m_xWriteDocumentHandler->startDocument();\n    m_xWriteDocumentHandler->startElement( OUString( RTL_CONSTASCII_USTRINGPARAM( ELEMENT_ACCELERATORLIST )), rList );\n    m_xWriteDocumentHandler->ignorableWhitespace( OUString() );\n\n    std::list< SvtAcceleratorConfigItem>::const_iterator p;\n    for ( p = m_aWriteAcceleratorList.begin(); p != m_aWriteAcceleratorList.end(); p++ )\n        WriteAcceleratorItem( *p );\n\n    m_xWriteDocumentHandler->endElement( OUString( RTL_CONSTASCII_USTRINGPARAM( ELEMENT_ACCELERATORLIST )) );\n    m_xWriteDocumentHandler->endDocument();\n}\n\nvoid OWriteAccelatorDocumentHandler::WriteAcceleratorItem(\n    const SvtAcceleratorConfigItem& aAcceleratorItem )\n    throw( SAXException, RuntimeException )\n{\n    AttributeListImpl* pAcceleratorAttributes = new AttributeListImpl;\n    Reference< XAttributeList > xAcceleratorAttrList( (XAttributeList *)pAcceleratorAttributes , UNO_QUERY );\n\n    \/\/ set attributes\n    pAcceleratorAttributes->addAttribute(\n        OUString( RTL_CONSTASCII_USTRINGPARAM( ATTRIBUTE_KEYCODE )),\n        m_aAttributeType,\n        OUString::valueOf( aAcceleratorItem.nCode ));\n\n    pAcceleratorAttributes->addAttribute(\n        OUString( RTL_CONSTASCII_USTRINGPARAM( ATTRIBUTE_MODIFIER )),\n        m_aAttributeType,\n        OUString::valueOf( aAcceleratorItem.nModifier ));\n\n    pAcceleratorAttributes->addAttribute(\n        OUString( RTL_CONSTASCII_USTRINGPARAM( ATTRIBUTE_URL )),\n        m_aAttributeType,\n        aAcceleratorItem.aCommand );\n\n    \/\/ write start element\n    m_xWriteDocumentHandler->startElement(\n        OUString( RTL_CONSTASCII_USTRINGPARAM( ELEMENT_ACCELERATORITEM )),\n        xAcceleratorAttrList );\n    m_xWriteDocumentHandler->ignorableWhitespace( OUString() );\n    m_xWriteDocumentHandler->endElement( OUString( RTL_CONSTASCII_USTRINGPARAM( ELEMENT_ACCELERATORITEM )) );\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>cppcheck: prefer prefix variant<commit_after>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2000, 2010 Oracle and\/or its affiliates.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org.  If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_unotools.hxx\"\n\n#include <unotools\/xmlaccelcfg.hxx>\n\n#include <vector>\n#include <com\/sun\/star\/xml\/sax\/XAttributeList.hpp>\n#include <cppuhelper\/implbase1.hxx>\n\nusing namespace rtl;\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::xml::sax;\n\n#define ELEMENT_ACCELERATORLIST     \"acceleratorlist\"\n#define ELEMENT_ACCELERATORITEM     \"item\"\n\n#define ATTRIBUTE_KEYCODE           \"code\"\n#define ATTRIBUTE_MODIFIER          \"modifier\"\n#define ATTRIBUTE_URL               \"url\"\n\n#define ATTRIBUTE_TYPE_CDATA        \"CDATA\"\n\n\/\/ ------------------------------------------------------------------\n\nstruct AttributeListImpl_impl;\nclass AttributeListImpl : public ::cppu::WeakImplHelper1< ::com::sun::star::xml::sax::XAttributeList >\n{\nprotected:\n    ~AttributeListImpl();\n\npublic:\n    AttributeListImpl();\n    AttributeListImpl( const AttributeListImpl & );\n\npublic:\n    virtual sal_Int16 SAL_CALL getLength(void) throw (::com::sun::star::uno::RuntimeException);\n    virtual ::rtl::OUString  SAL_CALL getNameByIndex(sal_Int16 i) throw (::com::sun::star::uno::RuntimeException);\n    virtual ::rtl::OUString  SAL_CALL getTypeByIndex(sal_Int16 i) throw (::com::sun::star::uno::RuntimeException);\n    virtual ::rtl::OUString  SAL_CALL getTypeByName(const ::rtl::OUString& aName) throw (::com::sun::star::uno::RuntimeException);\n    virtual ::rtl::OUString  SAL_CALL getValueByIndex(sal_Int16 i) throw (::com::sun::star::uno::RuntimeException);\n    virtual ::rtl::OUString  SAL_CALL getValueByName(const ::rtl::OUString& aName) throw (::com::sun::star::uno::RuntimeException);\n\npublic:\n    void addAttribute( const ::rtl::OUString &sName , const ::rtl::OUString &sType , const ::rtl::OUString &sValue );\n    void clear();\n\nprivate:\n    struct AttributeListImpl_impl *m_pImpl;\n};\n\nstruct TagAttribute\n{\n    TagAttribute(){}\n    TagAttribute( const OUString &aName, const OUString &aType , const OUString &aValue )\n    {\n        sName   = aName;\n        sType   = aType;\n        sValue  = aValue;\n    }\n\n    OUString sName;\n    OUString sType;\n    OUString sValue;\n};\n\nstruct AttributeListImpl_impl\n{\n    AttributeListImpl_impl()\n    {\n        \/\/ performance improvement during adding\n        vecAttribute.reserve(20);\n    }\n    ::std::vector<struct TagAttribute> vecAttribute;\n};\n\n\n\nsal_Int16 SAL_CALL AttributeListImpl::getLength(void) throw (RuntimeException)\n{\n    return sal::static_int_cast< sal_Int16 >(m_pImpl->vecAttribute.size());\n}\n\n\nAttributeListImpl::AttributeListImpl( const AttributeListImpl &r ) :\n    cppu::WeakImplHelper1<com::sun::star::xml::sax::XAttributeList>(r)\n{\n    m_pImpl = new AttributeListImpl_impl;\n    *m_pImpl = *(r.m_pImpl);\n}\n\nOUString AttributeListImpl::getNameByIndex(sal_Int16 i) throw (RuntimeException)\n{\n    if( i < sal::static_int_cast<sal_Int16>(m_pImpl->vecAttribute.size()) ) {\n        return m_pImpl->vecAttribute[i].sName;\n    }\n    return OUString();\n}\n\n\nOUString AttributeListImpl::getTypeByIndex(sal_Int16 i) throw (RuntimeException)\n{\n    if( i < sal::static_int_cast<sal_Int16>(m_pImpl->vecAttribute.size()) ) {\n        return m_pImpl->vecAttribute[i].sType;\n    }\n    return OUString();\n}\n\nOUString AttributeListImpl::getValueByIndex(sal_Int16 i) throw (RuntimeException)\n{\n    if( i < sal::static_int_cast<sal_Int16>(m_pImpl->vecAttribute.size()) ) {\n        return m_pImpl->vecAttribute[i].sValue;\n    }\n    return OUString();\n\n}\n\nOUString AttributeListImpl::getTypeByName( const OUString& sName ) throw (RuntimeException)\n{\n    ::std::vector<struct TagAttribute>::iterator ii = m_pImpl->vecAttribute.begin();\n\n    for( ; ii != m_pImpl->vecAttribute.end() ; ii ++ ) {\n        if( (*ii).sName == sName ) {\n            return (*ii).sType;\n        }\n    }\n    return OUString();\n}\n\nOUString AttributeListImpl::getValueByName(const OUString& sName) throw (RuntimeException)\n{\n    ::std::vector<struct TagAttribute>::iterator ii = m_pImpl->vecAttribute.begin();\n\n    for( ; ii != m_pImpl->vecAttribute.end() ; ii ++ ) {\n        if( (*ii).sName == sName ) {\n            return (*ii).sValue;\n        }\n    }\n    return OUString();\n}\n\n\nAttributeListImpl::AttributeListImpl()\n{\n    m_pImpl = new AttributeListImpl_impl;\n}\n\n\n\nAttributeListImpl::~AttributeListImpl()\n{\n    delete m_pImpl;\n}\n\n\nvoid AttributeListImpl::addAttribute(   const OUString &sName ,\n                                        const OUString &sType ,\n                                        const OUString &sValue )\n{\n    m_pImpl->vecAttribute.push_back( TagAttribute( sName , sType , sValue ) );\n}\n\nvoid AttributeListImpl::clear()\n{\n    ::std::vector<struct TagAttribute> dummy;\n    m_pImpl->vecAttribute.swap( dummy );\n\n    OSL_ASSERT( ! getLength() );\n}\n\n\/\/ ------------------------------------------------------------------\n\nAny SAL_CALL OReadAccelatorDocumentHandler::queryInterface( const Type & rType ) throw( RuntimeException )\n{\n    Any a = ::cppu::queryInterface( rType ,SAL_STATIC_CAST( XDocumentHandler*, this ));\n    if ( a.hasValue() )\n        return a;\n    else\n        return OWeakObject::queryInterface( rType );\n}\n\nvoid SAL_CALL OReadAccelatorDocumentHandler::ignorableWhitespace(\n    const OUString& )\nthrow( SAXException, RuntimeException )\n{\n}\n\nvoid SAL_CALL OReadAccelatorDocumentHandler::processingInstruction(\n    const OUString&, const OUString& )\nthrow( SAXException, RuntimeException )\n{\n}\n\nvoid SAL_CALL OReadAccelatorDocumentHandler::setDocumentLocator(\n    const Reference< XLocator > &xLocator)\nthrow(  SAXException, RuntimeException )\n{\n    m_xLocator = xLocator;\n}\n\n::rtl::OUString OReadAccelatorDocumentHandler::getErrorLineString()\n{\n    char buffer[32];\n\n    if ( m_xLocator.is() )\n    {\n        return OUString::createFromAscii( buffer );\n    }\n    else\n        return OUString();\n}\n\nvoid SAL_CALL OReadAccelatorDocumentHandler::startDocument(void)\n    throw ( SAXException, RuntimeException )\n{\n}\n\nvoid SAL_CALL OReadAccelatorDocumentHandler::endDocument(void)\n    throw( SAXException, RuntimeException )\n{\n    if ( m_nElementDepth > 0 )\n    {\n        OUString aErrorMessage = getErrorLineString();\n        aErrorMessage += OUString( RTL_CONSTASCII_USTRINGPARAM( \"A closing element is missing!\" ));\n        throw SAXException( aErrorMessage, Reference< XInterface >(), Any() );\n    }\n}\n\n\nvoid SAL_CALL OReadAccelatorDocumentHandler::startElement(\n    const OUString& aElementName, const Reference< XAttributeList > &xAttrList )\nthrow( SAXException, RuntimeException )\n{\n    m_nElementDepth++;\n\n    if ( aElementName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM( ELEMENT_ACCELERATORLIST )))\n    {\n        \/\/ acceleratorlist\n        if ( m_bAcceleratorMode )\n        {\n            OUString aErrorMessage = getErrorLineString();\n            aErrorMessage += OUString( RTL_CONSTASCII_USTRINGPARAM( \"Accelerator list used twice!\" ));\n            throw SAXException( aErrorMessage, Reference< XInterface >(), Any() );\n        }\n        else\n            m_bAcceleratorMode = sal_True;\n    }\n    else if ( aElementName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM( ELEMENT_ACCELERATORITEM )))\n    {\n        \/\/ accelerator item\n        if ( !m_bAcceleratorMode )\n        {\n            OUString aErrorMessage = getErrorLineString();\n            aErrorMessage += OUString( RTL_CONSTASCII_USTRINGPARAM( \"Accelerator list element has to be used before!\" ));\n            throw SAXException( aErrorMessage, Reference< XInterface >(), Any() );\n        }\n        else\n        {\n            \/\/ read accelerator item\n            m_bItemCloseExpected = sal_True;\n\n            SvtAcceleratorConfigItem aItem;\n\n            \/\/ read attributes for accelerator\n            for ( sal_Int16 i=0; i< xAttrList->getLength(); i++ )\n            {\n                OUString aName = xAttrList->getNameByIndex( i );\n                OUString aValue = xAttrList->getValueByIndex( i );\n\n                if ( aName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM( ATTRIBUTE_URL )))\n                    aItem.aCommand = aValue;\n                else if ( aName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM( ATTRIBUTE_MODIFIER )))\n                    aItem.nModifier = (sal_uInt16)aValue.toInt32();\n                else if ( aName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM( ATTRIBUTE_KEYCODE )))\n                    aItem.nCode = (sal_uInt16)aValue.toInt32();\n            }\n\n            m_aReadAcceleratorList.push_back( aItem );\n        }\n    }\n    else\n    {\n        OUString aErrorMessage = getErrorLineString();\n        aErrorMessage += OUString( RTL_CONSTASCII_USTRINGPARAM( \"Unknown element found!\" ));\n        throw SAXException( aErrorMessage, Reference< XInterface >(), Any() );\n    }\n}\n\n\nvoid SAL_CALL OReadAccelatorDocumentHandler::characters(const rtl::OUString&)\nthrow(  SAXException, RuntimeException )\n{\n}\n\n\nvoid SAL_CALL OReadAccelatorDocumentHandler::endElement( const OUString& aName )\n    throw( SAXException, RuntimeException )\n{\n    m_nElementDepth--;\n\n    if ( aName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM( ELEMENT_ACCELERATORLIST )))\n    {\n        \/\/ acceleratorlist\n        if ( !m_bAcceleratorMode )\n        {\n            OUString aErrorMessage = getErrorLineString();\n            aErrorMessage += OUString( RTL_CONSTASCII_USTRINGPARAM( \"Accelerator list used twice!\" ));\n            throw SAXException( aErrorMessage, Reference< XInterface >(), Any() );\n        }\n    }\n    else if ( aName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM( ELEMENT_ACCELERATORITEM )))\n    {\n        if ( !m_bItemCloseExpected )\n        {\n            OUString aErrorMessage = getErrorLineString();\n            aErrorMessage += OUString( RTL_CONSTASCII_USTRINGPARAM( \"Closing accelerator item element expected!\" ));\n            throw SAXException( aErrorMessage, Reference< XInterface >(), Any() );\n        }\n    }\n    else\n    {\n        OUString aErrorMessage = getErrorLineString();\n        aErrorMessage += OUString( RTL_CONSTASCII_USTRINGPARAM( \"Unknown closing element found!\" ));\n        throw SAXException( aErrorMessage, Reference< XInterface >(), Any() );\n    }\n}\n\n\/\/ ------------------------------------------------------------------\n\nOWriteAccelatorDocumentHandler::OWriteAccelatorDocumentHandler(\n    const SvtAcceleratorItemList& aWriteAcceleratorList, Reference< XDocumentHandler > xDocumentHandler ) :\n    m_xWriteDocumentHandler( xDocumentHandler ),\n    m_aWriteAcceleratorList( aWriteAcceleratorList )\n{\n    m_aAttributeType = OUString( RTL_CONSTASCII_USTRINGPARAM( ATTRIBUTE_TYPE_CDATA ));\n}\n\nOWriteAccelatorDocumentHandler::~OWriteAccelatorDocumentHandler()\n{\n}\n\nvoid OWriteAccelatorDocumentHandler::WriteAcceleratorDocument()\n    throw ( SAXException, RuntimeException )\n{\n    AttributeListImpl* pList = new AttributeListImpl;\n    Reference< XAttributeList > rList( (XAttributeList *)pList , UNO_QUERY );\n\n    m_xWriteDocumentHandler->startDocument();\n    m_xWriteDocumentHandler->startElement( OUString( RTL_CONSTASCII_USTRINGPARAM( ELEMENT_ACCELERATORLIST )), rList );\n    m_xWriteDocumentHandler->ignorableWhitespace( OUString() );\n\n    std::list< SvtAcceleratorConfigItem>::const_iterator p;\n    for ( p = m_aWriteAcceleratorList.begin(); p != m_aWriteAcceleratorList.end(); ++p )\n        WriteAcceleratorItem( *p );\n\n    m_xWriteDocumentHandler->endElement( OUString( RTL_CONSTASCII_USTRINGPARAM( ELEMENT_ACCELERATORLIST )) );\n    m_xWriteDocumentHandler->endDocument();\n}\n\nvoid OWriteAccelatorDocumentHandler::WriteAcceleratorItem(\n    const SvtAcceleratorConfigItem& aAcceleratorItem )\n    throw( SAXException, RuntimeException )\n{\n    AttributeListImpl* pAcceleratorAttributes = new AttributeListImpl;\n    Reference< XAttributeList > xAcceleratorAttrList( (XAttributeList *)pAcceleratorAttributes , UNO_QUERY );\n\n    \/\/ set attributes\n    pAcceleratorAttributes->addAttribute(\n        OUString( RTL_CONSTASCII_USTRINGPARAM( ATTRIBUTE_KEYCODE )),\n        m_aAttributeType,\n        OUString::valueOf( aAcceleratorItem.nCode ));\n\n    pAcceleratorAttributes->addAttribute(\n        OUString( RTL_CONSTASCII_USTRINGPARAM( ATTRIBUTE_MODIFIER )),\n        m_aAttributeType,\n        OUString::valueOf( aAcceleratorItem.nModifier ));\n\n    pAcceleratorAttributes->addAttribute(\n        OUString( RTL_CONSTASCII_USTRINGPARAM( ATTRIBUTE_URL )),\n        m_aAttributeType,\n        aAcceleratorItem.aCommand );\n\n    \/\/ write start element\n    m_xWriteDocumentHandler->startElement(\n        OUString( RTL_CONSTASCII_USTRINGPARAM( ELEMENT_ACCELERATORITEM )),\n        xAcceleratorAttrList );\n    m_xWriteDocumentHandler->ignorableWhitespace( OUString() );\n    m_xWriteDocumentHandler->endElement( OUString( RTL_CONSTASCII_USTRINGPARAM( ELEMENT_ACCELERATORITEM )) );\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before>#include <stdio.h>\n#include \"Halide.h\"\n#include <iostream>\n#include <limits>\n\nusing namespace Halide;\nusing namespace Halide::ConciseCasts;\n\ntypedef Expr (*cast_maker_t)(Expr);\n\ntemplate <typename source_t, typename target_t>\nvoid test_saturating() {\n    source_t source_min = std::numeric_limits<source_t>::lowest();\n    source_t source_max = std::numeric_limits<source_t>::max();\n\n    target_t target_min = std::numeric_limits<target_t>::lowest();\n    target_t target_max = std::numeric_limits<target_t>::max();\n\n    Buffer<source_t> in(7);\n    in(0) = (source_t)0;\n    in(1) = (source_t)1;\n    \/\/ This can intentionally change the value if source_t is unsigned\n    in(2) = (source_t)-1;\n    in(3) = (source_t)source_max;\n    in(4) = (source_t)source_min;\n    \/\/ These two can intentionally change the value if source_t is smaller than target_t\n    in(5) = (source_t)target_min;\n    in(6) = (source_t)target_max;\n\n    Var x;\n    Func f;\n\n    f(x) = saturating_cast<target_t>(in(x));\n\n    Buffer<target_t> result = f.realize(7);\n\n    for (int32_t i = 0; i < 7; i++) {\n        bool source_signed = std::numeric_limits<source_t>::is_signed;\n        bool target_signed = std::numeric_limits<target_t>::is_signed;\n        bool source_floating = !std::numeric_limits<source_t>::is_integer;\n        bool target_floating = !std::numeric_limits<target_t>::is_integer;\n\n        target_t correct_result;\n        if (source_floating) {\n            double bounded_lower = std::max((double)in(i), (double)target_min);\n            if (bounded_lower >= (double)target_max) {\n                correct_result = target_max;\n            } else {\n                correct_result = (target_t)bounded_lower;\n            }\n        } else if (target_floating) {\n            correct_result = (target_t)std::min((double)in(i), (double)target_max);\n        } else if (source_signed == target_signed) {\n            if (sizeof(source_t) > sizeof(target_t)) {\n                correct_result = (target_t)std::min(std::max(in(i),\n                                                             (source_t)target_min),\n                                                    (source_t)target_max);\n            } else {\n                correct_result = (target_t)in(i);\n            }\n        } else {\n            if (source_signed) {\n                source_t val = std::max(in(i), (source_t)0);\n                if (sizeof(source_t) > sizeof(target_t)) {\n                    correct_result = (target_t)std::min(val, (source_t)target_max);\n                } else {\n                    correct_result = (target_t)val;\n                }\n            } else {\n                if (sizeof(source_t) >= sizeof(target_t)) {\n                    correct_result = (target_t)std::min(in(i), (source_t)target_max);\n                } else { \/\/ dest is signed, but larger so unsigned source_t guaranteed to fit\n                    correct_result = std::min((target_t)in(i), target_max);\n                }\n            }\n        }\n\n        \/\/ Do a simpler verification as well if a 64-bit int will hold everything\n        if (!target_floating && (sizeof(target_t) < 8 || target_signed) &&\n            !source_floating && (sizeof(source_t) < 8 || source_signed)) {\n            int64_t simpler_correct_result;\n\n            simpler_correct_result = std::min(std::max((int64_t)in(i),\n                                                       (int64_t)target_min),\n                                              (int64_t)target_max);\n\n            if (simpler_correct_result != (int64_t)correct_result) {\n                std::cout << \"Simpler verification failed for index \" << i\n                          << \" correct_result is \" << correct_result\n                          << \" correct_result casted to int64_t is \" << (int64_t)correct_result\n                          << \" simpler_correct_result is \" << simpler_correct_result << \"\\n\";\n                std::cout << \"in(i) \" << in(i)\n                          << \" target_min \" << target_min\n                          << \" target_max \" << target_max << \"\\n\";\n            }\n            assert(simpler_correct_result == (int64_t)correct_result);\n        }\n\n        if (result(i) != correct_result) {\n            std::cout << \"Match failure at index \" << i\n                      << \" got \" << result(i)\n                      << \" expected \" << correct_result\n                      << \" for input \" << in(i) << std::endl;\n        }\n\n        assert(result(i) == correct_result);\n    }\n}\n\ntemplate <typename source_t, typename target_t>\nvoid test_concise(cast_maker_t cast_maker, bool saturating) {\n    source_t source_min = std::numeric_limits<source_t>::min();\n    source_t source_max = std::numeric_limits<source_t>::max();\n\n    target_t target_min = std::numeric_limits<target_t>::min();\n    target_t target_max = std::numeric_limits<target_t>::max();\n\n    Buffer<source_t> in(7);\n    in(0) = (source_t)0;\n    in(1) = (source_t)1;\n    \/\/ This can intentionally change the value if source_t is unsigned\n    in(2) = (source_t)-1;\n    in(3) = (source_t)source_max;\n    in(4) = (source_t)source_min;\n    \/\/ These two can intentionally change the value if source_t is smaller than target_t\n    in(5) = (source_t)target_min;\n    in(6) = (source_t)target_max;\n\n    Var x;\n    Func f;\n\n    f(x) = cast_maker(in(x));\n\n    Buffer<target_t> result = f.realize(7);\n\n    for (int32_t i = 0; i < 7; i++) {\n        bool source_signed = std::numeric_limits<source_t>::is_signed;\n        bool target_signed = std::numeric_limits<target_t>::is_signed;\n        bool source_floating = !std::numeric_limits<source_t>::is_integer;\n\n        target_t correct_result;\n        if (saturating) {\n            if (source_floating) {\n                source_t bounded_lower = std::max(in(i), (source_t)target_min);\n                if (bounded_lower >= (source_t)target_max) {\n                    correct_result = target_max;\n                } else {\n                    correct_result = (target_t)bounded_lower;\n                }\n            } else if (source_signed == target_signed) {\n                if (sizeof(source_t) > sizeof(target_t)) {\n                    correct_result = (target_t)std::min(std::max(in(i),\n                                                                 (source_t)target_min),\n                                                        (source_t)target_max);\n                } else {\n                  correct_result = (target_t)in(i);\n                }\n            } else {\n                if (source_signed) {\n                    source_t val = std::max(in(i), (source_t)0);\n                    if (sizeof(source_t) > sizeof(target_t)) {\n                        correct_result = (target_t)std::min(val, (source_t)target_max);\n                    } else {\n                        correct_result = (target_t)val;\n                    }\n                } else {\n                    if (sizeof(source_t) >= sizeof(target_t)) {\n                        correct_result = (target_t)std::min(in(i), (source_t)target_max);\n                    } else { \/\/ dest is signed, but larger so unsigned source_t guaranteed to fit\n                        correct_result = std::min((target_t)in(i), target_max);\n                    }\n                }\n            }\n\n            \/\/ Do a simpler verification as well if a 64-bit int will hold everything\n            if ((sizeof(target_t) < 8 || target_signed) &&\n                (source_floating || (sizeof(source_t) < 8 || source_signed))) {\n                int64_t simpler_correct_result;\n\n                if (source_floating) {\n                    double bounded_lower = std::max((double)in(i), (double)target_min);\n                    if (bounded_lower >= (double)target_max) {\n                        simpler_correct_result = target_max;\n                    } else {\n                        simpler_correct_result = (int64_t)bounded_lower;\n                    }\n                } else {\n                  simpler_correct_result = std::min(std::max((int64_t)in(i),\n                                                             (int64_t)target_min),\n                                                    (int64_t)target_max);\n                }\n\n                if (simpler_correct_result != (int64_t)correct_result) {\n                    std::cout << \"Simpler verification failed for index \" << i\n                              << \" correct_result is \" << correct_result\n                              << \" correct_result casted to int64_t is \" << (int64_t)correct_result\n                              << \" simpler_correct_result is \" << simpler_correct_result << \"\\n\";\n                    std::cout << \"in(i) \" << in(i)\n                              << \" target_min \" << target_min\n                              << \" target_max \" << target_max << \"\\n\";\n                }\n                assert(simpler_correct_result == (int64_t)correct_result);\n            }\n\n        } else {\n            correct_result = (target_t)in(i);\n        }\n\n        if (result(i) != correct_result) {\n            std::cout << \"Match failure at index \" << i\n                      << \" got \" << result(i)\n                      << \" expected \" << correct_result\n                      << \" for input \" << in(i)\n                      << (saturating ? \" saturating\" : \" nonsaturating\") << std::endl;\n        }\n\n        assert(result(i) == correct_result);\n    }\n}\n\ntemplate <typename source_t>\nvoid test_one_source_saturating() {\n    test_saturating<source_t, int8_t>();\n    test_saturating<source_t, uint8_t>();\n\n    test_saturating<source_t, int16_t>();\n    test_saturating<source_t, uint16_t>();\n\n    test_saturating<source_t, int32_t>();\n    test_saturating<source_t, uint32_t>();\n\n    test_saturating<source_t, int64_t>();\n    test_saturating<source_t, uint64_t>();\n\n    test_saturating<source_t, float>();\n    test_saturating<source_t, double>();\n}\n\n\ntemplate <typename source_t>\nvoid test_one_source_concise() {\n    test_concise<source_t, int8_t>(i8, false);\n    test_concise<source_t, uint8_t>(u8, false);\n    test_concise<source_t, int8_t>(i8_sat, true);\n    test_concise<source_t, uint8_t>(u8_sat, true);\n\n    test_concise<source_t, int16_t>(i16, false);\n    test_concise<source_t, uint16_t>(u16, false);\n    test_concise<source_t, int16_t>(i16_sat, true);\n    test_concise<source_t, uint16_t>(u16_sat, true);\n\n    test_concise<source_t, int32_t>(i32, false);\n    test_concise<source_t, uint32_t>(u32, false);\n    test_concise<source_t, int32_t>(i32_sat, true);\n    test_concise<source_t, uint32_t>(u32_sat, true);\n\n    test_concise<source_t, int64_t>(i64, false);\n    test_concise<source_t, uint64_t>(u64, false);\n    test_concise<source_t, int64_t>(i64_sat, true);\n    test_concise<source_t, uint64_t>(u64_sat, true);\n}\n\ntemplate <typename source_t>\nvoid test_one_source() {\n    test_one_source_saturating<source_t>();\n    test_one_source_concise<source_t>();\n}\n\nint main(int argc, char **argv) {\n    test_one_source<int8_t>();\n    test_one_source<uint8_t>();\n    test_one_source<int16_t>();\n    test_one_source<uint16_t>();\n    test_one_source<int32_t>();\n    test_one_source<uint32_t>();\n    test_one_source<int64_t>();\n    test_one_source<uint64_t>();\n\n    \/\/ Casting out of range values from floating-point\n    \/\/ to integer types is undefined behavior so only\n    \/\/ do the saturating casts.\n    test_one_source_saturating<float>();\n    test_one_source_saturating<double>();\n\n    printf(\"Success!\\n\");\n    return 0;\n}\n<commit_msg>Fix another MSVC compiler warning<commit_after>#include <stdio.h>\n#include \"Halide.h\"\n#include <iostream>\n#include <limits>\n\n\/\/ Disable a warning in MSVC that we know will be triggered here.\n#ifdef _MSC_VER\n#pragma warning(disable:4756)  \/\/ \"overflow in constant arithmetic\"\n#endif\n\nusing namespace Halide;\nusing namespace Halide::ConciseCasts;\n\ntypedef Expr (*cast_maker_t)(Expr);\n\ntemplate <typename source_t, typename target_t>\nvoid test_saturating() {\n    source_t source_min = std::numeric_limits<source_t>::lowest();\n    source_t source_max = std::numeric_limits<source_t>::max();\n\n    target_t target_min = std::numeric_limits<target_t>::lowest();\n    target_t target_max = std::numeric_limits<target_t>::max();\n\n    Buffer<source_t> in(7);\n    in(0) = (source_t)0;\n    in(1) = (source_t)1;\n    \/\/ This can intentionally change the value if source_t is unsigned\n    in(2) = (source_t)-1;\n    in(3) = (source_t)source_max;\n    in(4) = (source_t)source_min;\n    \/\/ These two can intentionally change the value if source_t is smaller than target_t\n    in(5) = (source_t)target_min;\n    in(6) = (source_t)target_max;\n\n    Var x;\n    Func f;\n\n    f(x) = saturating_cast<target_t>(in(x));\n\n    Buffer<target_t> result = f.realize(7);\n\n    for (int32_t i = 0; i < 7; i++) {\n        bool source_signed = std::numeric_limits<source_t>::is_signed;\n        bool target_signed = std::numeric_limits<target_t>::is_signed;\n        bool source_floating = !std::numeric_limits<source_t>::is_integer;\n        bool target_floating = !std::numeric_limits<target_t>::is_integer;\n\n        target_t correct_result;\n        if (source_floating) {\n            double bounded_lower = std::max((double)in(i), (double)target_min);\n            if (bounded_lower >= (double)target_max) {\n                correct_result = target_max;\n            } else {\n                correct_result = (target_t)bounded_lower;\n            }\n        } else if (target_floating) {\n            correct_result = (target_t)std::min((double)in(i), (double)target_max);\n        } else if (source_signed == target_signed) {\n            if (sizeof(source_t) > sizeof(target_t)) {\n                correct_result = (target_t)std::min(std::max(in(i),\n                                                             (source_t)target_min),\n                                                    (source_t)target_max);\n            } else {\n                correct_result = (target_t)in(i);\n            }\n        } else {\n            if (source_signed) {\n                source_t val = std::max(in(i), (source_t)0);\n                if (sizeof(source_t) > sizeof(target_t)) {\n                    correct_result = (target_t)std::min(val, (source_t)target_max);\n                } else {\n                    correct_result = (target_t)val;\n                }\n            } else {\n                if (sizeof(source_t) >= sizeof(target_t)) {\n                    correct_result = (target_t)std::min(in(i), (source_t)target_max);\n                } else { \/\/ dest is signed, but larger so unsigned source_t guaranteed to fit\n                    correct_result = std::min((target_t)in(i), target_max);\n                }\n            }\n        }\n\n        \/\/ Do a simpler verification as well if a 64-bit int will hold everything\n        if (!target_floating && (sizeof(target_t) < 8 || target_signed) &&\n            !source_floating && (sizeof(source_t) < 8 || source_signed)) {\n            int64_t simpler_correct_result;\n\n            simpler_correct_result = std::min(std::max((int64_t)in(i),\n                                                       (int64_t)target_min),\n                                              (int64_t)target_max);\n\n            if (simpler_correct_result != (int64_t)correct_result) {\n                std::cout << \"Simpler verification failed for index \" << i\n                          << \" correct_result is \" << correct_result\n                          << \" correct_result casted to int64_t is \" << (int64_t)correct_result\n                          << \" simpler_correct_result is \" << simpler_correct_result << \"\\n\";\n                std::cout << \"in(i) \" << in(i)\n                          << \" target_min \" << target_min\n                          << \" target_max \" << target_max << \"\\n\";\n            }\n            assert(simpler_correct_result == (int64_t)correct_result);\n        }\n\n        if (result(i) != correct_result) {\n            std::cout << \"Match failure at index \" << i\n                      << \" got \" << result(i)\n                      << \" expected \" << correct_result\n                      << \" for input \" << in(i) << std::endl;\n        }\n\n        assert(result(i) == correct_result);\n    }\n}\n\ntemplate <typename source_t, typename target_t>\nvoid test_concise(cast_maker_t cast_maker, bool saturating) {\n    source_t source_min = std::numeric_limits<source_t>::min();\n    source_t source_max = std::numeric_limits<source_t>::max();\n\n    target_t target_min = std::numeric_limits<target_t>::min();\n    target_t target_max = std::numeric_limits<target_t>::max();\n\n    Buffer<source_t> in(7);\n    in(0) = (source_t)0;\n    in(1) = (source_t)1;\n    \/\/ This can intentionally change the value if source_t is unsigned\n    in(2) = (source_t)-1;\n    in(3) = (source_t)source_max;\n    in(4) = (source_t)source_min;\n    \/\/ These two can intentionally change the value if source_t is smaller than target_t\n    in(5) = (source_t)target_min;\n    in(6) = (source_t)target_max;\n\n    Var x;\n    Func f;\n\n    f(x) = cast_maker(in(x));\n\n    Buffer<target_t> result = f.realize(7);\n\n    for (int32_t i = 0; i < 7; i++) {\n        bool source_signed = std::numeric_limits<source_t>::is_signed;\n        bool target_signed = std::numeric_limits<target_t>::is_signed;\n        bool source_floating = !std::numeric_limits<source_t>::is_integer;\n\n        target_t correct_result;\n        if (saturating) {\n            if (source_floating) {\n                source_t bounded_lower = std::max(in(i), (source_t)target_min);\n                if (bounded_lower >= (source_t)target_max) {\n                    correct_result = target_max;\n                } else {\n                    correct_result = (target_t)bounded_lower;\n                }\n            } else if (source_signed == target_signed) {\n                if (sizeof(source_t) > sizeof(target_t)) {\n                    correct_result = (target_t)std::min(std::max(in(i),\n                                                                 (source_t)target_min),\n                                                        (source_t)target_max);\n                } else {\n                  correct_result = (target_t)in(i);\n                }\n            } else {\n                if (source_signed) {\n                    source_t val = std::max(in(i), (source_t)0);\n                    if (sizeof(source_t) > sizeof(target_t)) {\n                        correct_result = (target_t)std::min(val, (source_t)target_max);\n                    } else {\n                        correct_result = (target_t)val;\n                    }\n                } else {\n                    if (sizeof(source_t) >= sizeof(target_t)) {\n                        correct_result = (target_t)std::min(in(i), (source_t)target_max);\n                    } else { \/\/ dest is signed, but larger so unsigned source_t guaranteed to fit\n                        correct_result = std::min((target_t)in(i), target_max);\n                    }\n                }\n            }\n\n            \/\/ Do a simpler verification as well if a 64-bit int will hold everything\n            if ((sizeof(target_t) < 8 || target_signed) &&\n                (source_floating || (sizeof(source_t) < 8 || source_signed))) {\n                int64_t simpler_correct_result;\n\n                if (source_floating) {\n                    double bounded_lower = std::max((double)in(i), (double)target_min);\n                    if (bounded_lower >= (double)target_max) {\n                        simpler_correct_result = target_max;\n                    } else {\n                        simpler_correct_result = (int64_t)bounded_lower;\n                    }\n                } else {\n                  simpler_correct_result = std::min(std::max((int64_t)in(i),\n                                                             (int64_t)target_min),\n                                                    (int64_t)target_max);\n                }\n\n                if (simpler_correct_result != (int64_t)correct_result) {\n                    std::cout << \"Simpler verification failed for index \" << i\n                              << \" correct_result is \" << correct_result\n                              << \" correct_result casted to int64_t is \" << (int64_t)correct_result\n                              << \" simpler_correct_result is \" << simpler_correct_result << \"\\n\";\n                    std::cout << \"in(i) \" << in(i)\n                              << \" target_min \" << target_min\n                              << \" target_max \" << target_max << \"\\n\";\n                }\n                assert(simpler_correct_result == (int64_t)correct_result);\n            }\n\n        } else {\n            correct_result = (target_t)in(i);\n        }\n\n        if (result(i) != correct_result) {\n            std::cout << \"Match failure at index \" << i\n                      << \" got \" << result(i)\n                      << \" expected \" << correct_result\n                      << \" for input \" << in(i)\n                      << (saturating ? \" saturating\" : \" nonsaturating\") << std::endl;\n        }\n\n        assert(result(i) == correct_result);\n    }\n}\n\ntemplate <typename source_t>\nvoid test_one_source_saturating() {\n    test_saturating<source_t, int8_t>();\n    test_saturating<source_t, uint8_t>();\n\n    test_saturating<source_t, int16_t>();\n    test_saturating<source_t, uint16_t>();\n\n    test_saturating<source_t, int32_t>();\n    test_saturating<source_t, uint32_t>();\n\n    test_saturating<source_t, int64_t>();\n    test_saturating<source_t, uint64_t>();\n\n    test_saturating<source_t, float>();\n    test_saturating<source_t, double>();\n}\n\n\ntemplate <typename source_t>\nvoid test_one_source_concise() {\n    test_concise<source_t, int8_t>(i8, false);\n    test_concise<source_t, uint8_t>(u8, false);\n    test_concise<source_t, int8_t>(i8_sat, true);\n    test_concise<source_t, uint8_t>(u8_sat, true);\n\n    test_concise<source_t, int16_t>(i16, false);\n    test_concise<source_t, uint16_t>(u16, false);\n    test_concise<source_t, int16_t>(i16_sat, true);\n    test_concise<source_t, uint16_t>(u16_sat, true);\n\n    test_concise<source_t, int32_t>(i32, false);\n    test_concise<source_t, uint32_t>(u32, false);\n    test_concise<source_t, int32_t>(i32_sat, true);\n    test_concise<source_t, uint32_t>(u32_sat, true);\n\n    test_concise<source_t, int64_t>(i64, false);\n    test_concise<source_t, uint64_t>(u64, false);\n    test_concise<source_t, int64_t>(i64_sat, true);\n    test_concise<source_t, uint64_t>(u64_sat, true);\n}\n\ntemplate <typename source_t>\nvoid test_one_source() {\n    test_one_source_saturating<source_t>();\n    test_one_source_concise<source_t>();\n}\n\nint main(int argc, char **argv) {\n    test_one_source<int8_t>();\n    test_one_source<uint8_t>();\n    test_one_source<int16_t>();\n    test_one_source<uint16_t>();\n    test_one_source<int32_t>();\n    test_one_source<uint32_t>();\n    test_one_source<int64_t>();\n    test_one_source<uint64_t>();\n\n    \/\/ Casting out of range values from floating-point\n    \/\/ to integer types is undefined behavior so only\n    \/\/ do the saturating casts.\n    test_one_source_saturating<float>();\n    test_one_source_saturating<double>();\n\n    printf(\"Success!\\n\");\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/                         Peloton\n\/\/\n\/\/ executor_tests_util.cpp\n\/\/\n\/\/ Identification: test\/executor\/executor_tests_util.cpp\n\/\/\n\/\/ Copyright (c) 2015-16, Carnegie Mellon University Database Group\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n\n#include \"executor\/executor_tests_util.h\"\n\n#include <cstdlib>\n#include <ctime>\n#include <memory>\n#include <vector>\n\n#include \"common\/harness.h\"\n\n#include \"catalog\/schema.h\"\n#include \"common\/value.h\"\n#include \"common\/value_factory.h\"\n#include \"common\/exception.h\"\n#include \"concurrency\/transaction.h\"\n#include \"concurrency\/transaction_manager_factory.h\"\n#include \"executor\/abstract_executor.h\"\n#include \"executor\/logical_tile.h\"\n#include \"storage\/tile_group.h\"\n#include \"storage\/tile_group_factory.h\"\n#include \"storage\/tuple.h\"\n#include \"storage\/data_table.h\"\n#include \"storage\/table_factory.h\"\n#include \"index\/index_factory.h\"\n\n#include \"executor\/mock_executor.h\"\n\nusing ::testing::IsNull;\nusing ::testing::NotNull;\nusing ::testing::Return;\n\nnamespace peloton {\nnamespace test {\n\n\/** @brief Helper function for defining schema *\/\n\/*\n * GetColumnInfo() - Returns column object for testing\n *\n * Column 0: Integer column, not null\n * Column 1: Integer column, not null\n * Column 2: Double column, not null\n * Column 3: VARCHAR, max len = 25, not null\n *\n * For other column IDs an exception will be thrown\n *\/\ncatalog::Column ExecutorTestsUtil::GetColumnInfo(int index) {\n  const bool is_inlined = true;\n  std::string not_null_constraint_name = \"not_null\";\n  catalog::Column dummy_column;\n\n  switch (index) {\n    case 0: {\n      auto column =\n          catalog::Column(VALUE_TYPE_INTEGER, GetTypeSize(VALUE_TYPE_INTEGER),\n                          \"COL_A\", is_inlined);\n\n      column.AddConstraint(catalog::Constraint(CONSTRAINT_TYPE_NOTNULL,\n                                               not_null_constraint_name));\n      return column;\n    } break;\n\n    case 1: {\n      auto column =\n          catalog::Column(VALUE_TYPE_INTEGER, GetTypeSize(VALUE_TYPE_INTEGER),\n                          \"COL_B\", is_inlined);\n\n      column.AddConstraint(catalog::Constraint(CONSTRAINT_TYPE_NOTNULL,\n                                               not_null_constraint_name));\n      return column;\n    } break;\n\n    case 2: {\n      auto column =\n          catalog::Column(VALUE_TYPE_DOUBLE, GetTypeSize(VALUE_TYPE_DOUBLE),\n                          \"COL_C\", is_inlined);\n\n      column.AddConstraint(catalog::Constraint(CONSTRAINT_TYPE_NOTNULL,\n                                               not_null_constraint_name));\n      return column;\n    } break;\n\n    case 3: {\n      auto column = catalog::Column(VALUE_TYPE_VARCHAR, 25,  \/\/ Column length.\n                                    \"COL_D\", !is_inlined);   \/\/ inlined.\n\n      column.AddConstraint(catalog::Constraint(CONSTRAINT_TYPE_NOTNULL,\n                                               not_null_constraint_name));\n      return column;\n    } break;\n\n    default: {\n      throw ExecutorException(\"Invalid column index : \" +\n                              std::to_string(index));\n    }\n  }\n\n  return dummy_column;\n}\n\n\/**\n * @brief Creates simple tile group for testing purposes.\n * @param backend Backend for tile group to use.\n * @param tuple_count Tuple capacity of this tile group.\n *\n * Tile group has two tiles, and each of them has two columns.\n * The first two columns have INTEGER types, the last two have TINYINT\n * and VARCHAR.\n *\n * IMPORTANT: If you modify this function, it is your responsibility to\n *            fix any affected test cases. Test cases may be depending\n *            on things like the specific number of tiles in this group.\n *\n * @return Pointer to tile group.\n *\/\nstd::shared_ptr<storage::TileGroup> ExecutorTestsUtil::CreateTileGroup(\n    int tuple_count) {\n  std::vector<catalog::Column> columns;\n  std::vector<catalog::Schema> schemas;\n\n  columns.push_back(GetColumnInfo(0));\n  columns.push_back(GetColumnInfo(1));\n  catalog::Schema schema1(columns);\n  schemas.push_back(schema1);\n\n  columns.clear();\n  columns.push_back(GetColumnInfo(2));\n  columns.push_back(GetColumnInfo(3));\n\n  catalog::Schema schema2(columns);\n  schemas.push_back(schema2);\n\n  std::map<oid_t, std::pair<oid_t, oid_t>> column_map;\n  column_map[0] = std::make_pair(0, 0);\n  column_map[1] = std::make_pair(0, 1);\n  column_map[2] = std::make_pair(1, 0);\n  column_map[3] = std::make_pair(1, 1);\n\n  std::shared_ptr<storage::TileGroup> tile_group_ptr(\n      storage::TileGroupFactory::GetTileGroup(\n          INVALID_OID, INVALID_OID,\n          TestingHarness::GetInstance().GetNextTileGroupId(), nullptr, schemas,\n          column_map, tuple_count));\n\n  catalog::Manager::GetInstance().AddTileGroup(tile_group_ptr->GetTileGroupId(),\n                                               tile_group_ptr);\n  return tile_group_ptr;\n}\n\n\/**\n * @brief Populates the table\n * @param table Table to populate with values.\n * @param num_rows Number of tuples to insert.\n *\/\nvoid ExecutorTestsUtil::PopulateTable(storage::DataTable *table, int num_rows,\n                                      bool mutate, bool random, bool group_by) {\n  \/\/ Random values\n  if (random) std::srand(std::time(nullptr));\n\n  const catalog::Schema *schema = table->GetSchema();\n\n  \/\/ Ensure that the tile group is as expected.\n  PL_ASSERT(schema->GetColumnCount() == 4);\n\n  \/\/ Insert tuples into tile_group.\n  const bool allocate = true;\n  auto testing_pool = TestingHarness::GetInstance().GetTestingPool();\n  for (int rowid = 0; rowid < num_rows; rowid++) {\n    int populate_value = rowid;\n    if (mutate) populate_value *= 3;\n\n    storage::Tuple tuple(schema, allocate);\n\n    if (group_by) {\n      \/\/ First column has only two distinct values\n      tuple.SetValue(0, ValueFactory::GetIntegerValue(PopulatedValue(\n                            int(populate_value \/ (num_rows \/ 2)), 0)),\n                     testing_pool);\n\n    } else {\n      \/\/ First column is unique in this case\n      tuple.SetValue(\n          0, ValueFactory::GetIntegerValue(PopulatedValue(populate_value, 0)),\n          testing_pool);\n    }\n\n    \/\/ In case of random, make sure this column has duplicated values\n    tuple.SetValue(\n        1, ValueFactory::GetIntegerValue(PopulatedValue(\n               random ? std::rand() % (num_rows \/ 3) : populate_value, 1)),\n        testing_pool);\n\n    tuple.SetValue(2, ValueFactory::GetDoubleValue(PopulatedValue(\n                          random ? std::rand() : populate_value, 2)),\n                   testing_pool);\n\n    \/\/ In case of random, make sure this column has duplicated values\n    Value string_value =\n        ValueFactory::GetStringValue(std::to_string(PopulatedValue(\n            random ? std::rand() % (num_rows \/ 3) : populate_value, 3)));\n    tuple.SetValue(3, string_value, testing_pool);\n\n    ItemPointer tuple_slot_id = table->InsertTuple(&tuple);\n    PL_ASSERT(tuple_slot_id.block != INVALID_OID);\n    PL_ASSERT(tuple_slot_id.offset != INVALID_OID);\n\n    auto &txn_manager = concurrency::TransactionManagerFactory::GetInstance();\n    UNUSED_ATTRIBUTE bool status = txn_manager.PerformInsert(tuple_slot_id);\n    PL_ASSERT(status == true);\n  }\n}\n\n\/**\n * @brief  Populates the tiles in the given tile-group in a specific manner.\n * @param tile_group Tile-group to populate with values.\n * @param num_rows Number of tuples to insert.\n *\/\nvoid ExecutorTestsUtil::PopulateTiles(\n    std::shared_ptr<storage::TileGroup> tile_group, int num_rows) {\n  \/\/ Create tuple schema from tile schemas.\n  std::vector<catalog::Schema> &tile_schemas = tile_group->GetTileSchemas();\n  std::unique_ptr<catalog::Schema> schema(\n      catalog::Schema::AppendSchemaList(tile_schemas));\n\n  \/\/ Ensure that the tile group is as expected.\n  PL_ASSERT(schema->GetColumnCount() == 4);\n\n  \/\/ Insert tuples into tile_group.\n  auto &txn_manager = concurrency::TransactionManagerFactory::GetInstance();\n  const bool allocate = true;\n  txn_manager.BeginTransaction();\n  auto testing_pool = TestingHarness::GetInstance().GetTestingPool();\n\n  for (int col_itr = 0; col_itr < num_rows; col_itr++) {\n    storage::Tuple tuple(schema.get(), allocate);\n    tuple.SetValue(0, ValueFactory::GetIntegerValue(PopulatedValue(col_itr, 0)),\n                   testing_pool);\n    tuple.SetValue(1, ValueFactory::GetIntegerValue(PopulatedValue(col_itr, 1)),\n                   testing_pool);\n    tuple.SetValue(2, ValueFactory::GetDoubleValue(PopulatedValue(col_itr, 2)),\n                   testing_pool);\n    Value string_value = ValueFactory::GetStringValue(\n        std::to_string(PopulatedValue(col_itr, 3)));\n    tuple.SetValue(3, string_value, testing_pool);\n\n    oid_t tuple_slot_id = tile_group->InsertTuple(&tuple);\n    txn_manager.PerformInsert(\n        ItemPointer(tile_group->GetTileGroupId(), tuple_slot_id));\n  }\n\n  txn_manager.CommitTransaction();\n}\n\n\/**\n * @brief Convenience function to pass a single logical tile through an\n *        executor which has only one child.\n * @param executor Executor to pass logical tile through.\n * @param source_logical_tile Logical tile to pass through executor.\n * @param check the value of logical tiles\n *\n * @return Pointer to processed logical tile.\n *\/\nexecutor::LogicalTile *ExecutorTestsUtil::ExecuteTile(\n    executor::AbstractExecutor *executor,\n    executor::LogicalTile *source_logical_tile) {\n  MockExecutor child_executor;\n  executor->AddChild(&child_executor);\n\n  \/\/ Uneventful init...\n  EXPECT_CALL(child_executor, DInit()).WillOnce(Return(true));\n  EXPECT_TRUE(executor->Init());\n\n  \/\/ Where the main work takes place...\n  EXPECT_CALL(child_executor, DExecute()).WillOnce(Return(true)).WillOnce(\n      Return(false));\n\n  EXPECT_CALL(child_executor, GetOutput())\n      .WillOnce(Return(source_logical_tile));\n\n  EXPECT_TRUE(executor->Execute());\n  std::unique_ptr<executor::LogicalTile> result_logical_tile(\n      executor->GetOutput());\n  EXPECT_THAT(result_logical_tile, NotNull());\n  EXPECT_THAT(executor->Execute(), false);\n\n  return result_logical_tile.release();\n}\n\nstorage::DataTable *ExecutorTestsUtil::CreateTable(\n    int tuples_per_tilegroup_count,\n    bool indexes,\n    oid_t table_oid) {\n  catalog::Schema *table_schema = new catalog::Schema(\n      {GetColumnInfo(0), GetColumnInfo(1), GetColumnInfo(2), GetColumnInfo(3)});\n  std::string table_name(\"TEST_TABLE\");\n\n  \/\/ Create table.\n  bool own_schema = true;\n  bool adapt_table = false;\n  storage::DataTable *table = storage::TableFactory::GetDataTable(\n      INVALID_OID, table_oid, table_schema, table_name,\n      tuples_per_tilegroup_count, own_schema, adapt_table);\n\n  if (indexes == true) {\n\n    \/\/ This holds column ID in the underlying table that are being indexed\n    std::vector<oid_t> key_attrs;\n\n    \/\/ This holds schema of the underlying table, which stays all the same\n    \/\/ for all indices on the same underlying table\n    auto tuple_schema = table->GetSchema();\n    \n    \/\/ This points to the schmea of only columns indiced by the index\n    \/\/ This is basically selecting tuple_schema() with key_attrs as index\n    catalog::Schema *key_schema;\n    \n    \/\/ This will be created for each index on the table\n    \/\/ and the metadata is passed as part of the index construction paratemter\n    \/\/ list\n    index::IndexMetadata *index_metadata;\n    \n    \/\/ Whether keys should be unique. For primary key this must be true;\n    \/\/ for secondary keys this might be true as an extra constraint\n    bool unique;\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ Add primary key on column 0\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n    key_attrs = {0};\n    key_schema = catalog::Schema::CopySchema(tuple_schema, key_attrs);\n    key_schema->SetIndexedColumns(key_attrs);\n\n    unique = true;\n\n    index_metadata = new index::IndexMetadata(\n        \"primary_btree_index\", 123, INDEX_TYPE_BTREE,\n        INDEX_CONSTRAINT_TYPE_PRIMARY_KEY, tuple_schema, key_schema, key_attrs, unique);\n\n    std::shared_ptr<index::Index> pkey_index(index::IndexFactory::GetInstance(index_metadata));\n\n    table->AddIndex(pkey_index);\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ Add index on table column 0 and 1\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \n    key_attrs = {0, 1};\n    key_schema = catalog::Schema::CopySchema(tuple_schema, key_attrs);\n    key_schema->SetIndexedColumns(key_attrs);\n\n    unique = false;\n    index_metadata = new index::IndexMetadata(\n        \"secondary_btree_index\", 124, INDEX_TYPE_BTREE,\n        INDEX_CONSTRAINT_TYPE_DEFAULT, tuple_schema, key_schema, key_attrs, unique);\n    std::shared_ptr<index::Index> sec_index(index::IndexFactory::GetInstance(index_metadata));\n\n    table->AddIndex(sec_index);\n  }\n\n  return table;\n}\n\n\/**\n * @brief Convenience method to create table for test.\n *\n * @return Table generated for test.\n *\/\nstorage::DataTable *ExecutorTestsUtil::CreateAndPopulateTable() {\n  const int tuple_count = TESTS_TUPLES_PER_TILEGROUP;\n  storage::DataTable *table = ExecutorTestsUtil::CreateTable(tuple_count);\n  auto &txn_manager = concurrency::TransactionManagerFactory::GetInstance();\n  txn_manager.BeginTransaction();\n  ExecutorTestsUtil::PopulateTable(table, tuple_count * DEFAULT_TILEGROUP_COUNT,\n                                   false, false, false);\n  txn_manager.CommitTransaction();\n\n  return table;\n}\n\nstd::unique_ptr<storage::Tuple> ExecutorTestsUtil::GetTuple(\n    storage::DataTable *table, oid_t tuple_id, VarlenPool *pool) {\n  std::unique_ptr<storage::Tuple> tuple(\n      new storage::Tuple(table->GetSchema(), true));\n  tuple->SetValue(0, ValueFactory::GetIntegerValue(PopulatedValue(tuple_id, 0)),\n                  pool);\n  tuple->SetValue(1, ValueFactory::GetIntegerValue(PopulatedValue(tuple_id, 1)),\n                  pool);\n  tuple->SetValue(2, ValueFactory::GetDoubleValue(PopulatedValue(tuple_id, 2)),\n                  pool);\n  tuple->SetValue(3, ValueFactory::GetStringValue(\"12345\"), pool);\n\n  return tuple;\n}\n\nstd::unique_ptr<storage::Tuple> ExecutorTestsUtil::GetNullTuple(\n    storage::DataTable *table, VarlenPool *pool) {\n  std::unique_ptr<storage::Tuple> tuple(\n      new storage::Tuple(table->GetSchema(), true));\n  tuple->SetValue(0, ValueFactory::GetNullValue(), pool);\n  tuple->SetValue(1, ValueFactory::GetNullValue(), pool);\n  tuple->SetValue(2, ValueFactory::GetNullValue(), pool);\n  tuple->SetValue(3, ValueFactory::GetNullStringValue(), pool);\n\n  return tuple;\n}\n\nvoid ExecutorTestsUtil::PrintTileVector(\n    std::vector<std::unique_ptr<executor::LogicalTile>> &tile_vec) {\n  for (auto &tile : tile_vec) {\n    for (oid_t tuple_id : *tile) {\n      LOG_INFO(\"<\");\n      for (oid_t col_id = 0; col_id < tile->GetColumnCount(); col_id++) {\n        LOG_INFO(\"%s\", tile->GetValue(tuple_id, col_id).GetInfo().c_str());\n      }\n      LOG_INFO(\">\");\n    }\n  }\n}\n\n}  \/\/ namespace test\n}  \/\/ namespace peloton\n<commit_msg>Correct documentation for test util<commit_after>\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/                         Peloton\n\/\/\n\/\/ executor_tests_util.cpp\n\/\/\n\/\/ Identification: test\/executor\/executor_tests_util.cpp\n\/\/\n\/\/ Copyright (c) 2015-16, Carnegie Mellon University Database Group\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n\n#include \"executor\/executor_tests_util.h\"\n\n#include <cstdlib>\n#include <ctime>\n#include <memory>\n#include <vector>\n\n#include \"common\/harness.h\"\n\n#include \"catalog\/schema.h\"\n#include \"common\/value.h\"\n#include \"common\/value_factory.h\"\n#include \"common\/exception.h\"\n#include \"concurrency\/transaction.h\"\n#include \"concurrency\/transaction_manager_factory.h\"\n#include \"executor\/abstract_executor.h\"\n#include \"executor\/logical_tile.h\"\n#include \"storage\/tile_group.h\"\n#include \"storage\/tile_group_factory.h\"\n#include \"storage\/tuple.h\"\n#include \"storage\/data_table.h\"\n#include \"storage\/table_factory.h\"\n#include \"index\/index_factory.h\"\n\n#include \"executor\/mock_executor.h\"\n\nusing ::testing::IsNull;\nusing ::testing::NotNull;\nusing ::testing::Return;\n\nnamespace peloton {\nnamespace test {\n\n\/** @brief Helper function for defining schema *\/\n\/*\n * GetColumnInfo() - Returns column object for testing\n *\n * Column 0: Integer column, not null\n * Column 1: Integer column, not null\n * Column 2: Double column, not null\n * Column 3: VARCHAR, max len = 25, not null\n *\n * For other column IDs an exception will be thrown\n *\/\ncatalog::Column ExecutorTestsUtil::GetColumnInfo(int index) {\n  const bool is_inlined = true;\n  std::string not_null_constraint_name = \"not_null\";\n  catalog::Column dummy_column;\n\n  switch (index) {\n    case 0: {\n      auto column =\n          catalog::Column(VALUE_TYPE_INTEGER, GetTypeSize(VALUE_TYPE_INTEGER),\n                          \"COL_A\", is_inlined);\n\n      column.AddConstraint(catalog::Constraint(CONSTRAINT_TYPE_NOTNULL,\n                                               not_null_constraint_name));\n      return column;\n    } break;\n\n    case 1: {\n      auto column =\n          catalog::Column(VALUE_TYPE_INTEGER, GetTypeSize(VALUE_TYPE_INTEGER),\n                          \"COL_B\", is_inlined);\n\n      column.AddConstraint(catalog::Constraint(CONSTRAINT_TYPE_NOTNULL,\n                                               not_null_constraint_name));\n      return column;\n    } break;\n\n    case 2: {\n      auto column =\n          catalog::Column(VALUE_TYPE_DOUBLE, GetTypeSize(VALUE_TYPE_DOUBLE),\n                          \"COL_C\", is_inlined);\n\n      column.AddConstraint(catalog::Constraint(CONSTRAINT_TYPE_NOTNULL,\n                                               not_null_constraint_name));\n      return column;\n    } break;\n\n    case 3: {\n      auto column = catalog::Column(VALUE_TYPE_VARCHAR, 25,  \/\/ Column length.\n                                    \"COL_D\", !is_inlined);   \/\/ inlined.\n\n      column.AddConstraint(catalog::Constraint(CONSTRAINT_TYPE_NOTNULL,\n                                               not_null_constraint_name));\n      return column;\n    } break;\n\n    default: {\n      throw ExecutorException(\"Invalid column index : \" +\n                              std::to_string(index));\n    }\n  }\n\n  return dummy_column;\n}\n\n\/**\n * @brief Creates simple tile group for testing purposes.\n * @param backend Backend for tile group to use.\n * @param tuple_count Tuple capacity of this tile group.\n *\n * Tile group has two tiles, and each of them has two columns.\n * The first two columns have INTEGER types, the last two have TINYINT\n * and VARCHAR.\n *\n * IMPORTANT: If you modify this function, it is your responsibility to\n *            fix any affected test cases. Test cases may be depending\n *            on things like the specific number of tiles in this group.\n *\n * @return Pointer to tile group.\n *\/\nstd::shared_ptr<storage::TileGroup> ExecutorTestsUtil::CreateTileGroup(\n    int tuple_count) {\n  std::vector<catalog::Column> columns;\n  std::vector<catalog::Schema> schemas;\n\n  columns.push_back(GetColumnInfo(0));\n  columns.push_back(GetColumnInfo(1));\n  catalog::Schema schema1(columns);\n  schemas.push_back(schema1);\n\n  columns.clear();\n  columns.push_back(GetColumnInfo(2));\n  columns.push_back(GetColumnInfo(3));\n\n  catalog::Schema schema2(columns);\n  schemas.push_back(schema2);\n\n  std::map<oid_t, std::pair<oid_t, oid_t>> column_map;\n  column_map[0] = std::make_pair(0, 0);\n  column_map[1] = std::make_pair(0, 1);\n  column_map[2] = std::make_pair(1, 0);\n  column_map[3] = std::make_pair(1, 1);\n\n  std::shared_ptr<storage::TileGroup> tile_group_ptr(\n      storage::TileGroupFactory::GetTileGroup(\n          INVALID_OID, INVALID_OID,\n          TestingHarness::GetInstance().GetNextTileGroupId(), nullptr, schemas,\n          column_map, tuple_count));\n\n  catalog::Manager::GetInstance().AddTileGroup(tile_group_ptr->GetTileGroupId(),\n                                               tile_group_ptr);\n  return tile_group_ptr;\n}\n\n\/**\n * @brief Populates the table\n * @param table Table to populate with values.\n * @param num_rows Number of tuples to insert.\n *\/\nvoid ExecutorTestsUtil::PopulateTable(storage::DataTable *table, int num_rows,\n                                      bool mutate, bool random, bool group_by) {\n  \/\/ Random values\n  if (random) std::srand(std::time(nullptr));\n\n  const catalog::Schema *schema = table->GetSchema();\n\n  \/\/ Ensure that the tile group is as expected.\n  PL_ASSERT(schema->GetColumnCount() == 4);\n\n  \/\/ Insert tuples into tile_group.\n  const bool allocate = true;\n  auto testing_pool = TestingHarness::GetInstance().GetTestingPool();\n  for (int rowid = 0; rowid < num_rows; rowid++) {\n    int populate_value = rowid;\n    if (mutate) populate_value *= 3;\n\n    storage::Tuple tuple(schema, allocate);\n\n    if (group_by) {\n      \/\/ First column has only two distinct values\n      tuple.SetValue(0, ValueFactory::GetIntegerValue(PopulatedValue(\n                            int(populate_value \/ (num_rows \/ 2)), 0)),\n                     testing_pool);\n\n    } else {\n      \/\/ First column is unique in this case\n      tuple.SetValue(\n          0, ValueFactory::GetIntegerValue(PopulatedValue(populate_value, 0)),\n          testing_pool);\n    }\n\n    \/\/ In case of random, make sure this column has duplicated values\n    tuple.SetValue(\n        1, ValueFactory::GetIntegerValue(PopulatedValue(\n               random ? std::rand() % (num_rows \/ 3) : populate_value, 1)),\n        testing_pool);\n\n    tuple.SetValue(2, ValueFactory::GetDoubleValue(PopulatedValue(\n                          random ? std::rand() : populate_value, 2)),\n                   testing_pool);\n\n    \/\/ In case of random, make sure this column has duplicated values\n    Value string_value =\n        ValueFactory::GetStringValue(std::to_string(PopulatedValue(\n            random ? std::rand() % (num_rows \/ 3) : populate_value, 3)));\n    tuple.SetValue(3, string_value, testing_pool);\n\n    ItemPointer tuple_slot_id = table->InsertTuple(&tuple);\n    PL_ASSERT(tuple_slot_id.block != INVALID_OID);\n    PL_ASSERT(tuple_slot_id.offset != INVALID_OID);\n\n    auto &txn_manager = concurrency::TransactionManagerFactory::GetInstance();\n    UNUSED_ATTRIBUTE bool status = txn_manager.PerformInsert(tuple_slot_id);\n    PL_ASSERT(status == true);\n  }\n}\n\n\/**\n * @brief  Populates the tiles in the given tile-group in a specific manner.\n * @param tile_group Tile-group to populate with values.\n * @param num_rows Number of tuples to insert.\n *\/\nvoid ExecutorTestsUtil::PopulateTiles(\n    std::shared_ptr<storage::TileGroup> tile_group, int num_rows) {\n  \/\/ Create tuple schema from tile schemas.\n  std::vector<catalog::Schema> &tile_schemas = tile_group->GetTileSchemas();\n  std::unique_ptr<catalog::Schema> schema(\n      catalog::Schema::AppendSchemaList(tile_schemas));\n\n  \/\/ Ensure that the tile group is as expected.\n  PL_ASSERT(schema->GetColumnCount() == 4);\n\n  \/\/ Insert tuples into tile_group.\n  auto &txn_manager = concurrency::TransactionManagerFactory::GetInstance();\n  const bool allocate = true;\n  txn_manager.BeginTransaction();\n  auto testing_pool = TestingHarness::GetInstance().GetTestingPool();\n\n  for (int col_itr = 0; col_itr < num_rows; col_itr++) {\n    storage::Tuple tuple(schema.get(), allocate);\n    tuple.SetValue(0, ValueFactory::GetIntegerValue(PopulatedValue(col_itr, 0)),\n                   testing_pool);\n    tuple.SetValue(1, ValueFactory::GetIntegerValue(PopulatedValue(col_itr, 1)),\n                   testing_pool);\n    tuple.SetValue(2, ValueFactory::GetDoubleValue(PopulatedValue(col_itr, 2)),\n                   testing_pool);\n    Value string_value = ValueFactory::GetStringValue(\n        std::to_string(PopulatedValue(col_itr, 3)));\n    tuple.SetValue(3, string_value, testing_pool);\n\n    oid_t tuple_slot_id = tile_group->InsertTuple(&tuple);\n    txn_manager.PerformInsert(\n        ItemPointer(tile_group->GetTileGroupId(), tuple_slot_id));\n  }\n\n  txn_manager.CommitTransaction();\n}\n\n\/**\n * @brief Convenience function to pass a single logical tile through an\n *        executor which has only one child.\n * @param executor Executor to pass logical tile through.\n * @param source_logical_tile Logical tile to pass through executor.\n * @param check the value of logical tiles\n *\n * @return Pointer to processed logical tile.\n *\/\nexecutor::LogicalTile *ExecutorTestsUtil::ExecuteTile(\n    executor::AbstractExecutor *executor,\n    executor::LogicalTile *source_logical_tile) {\n  MockExecutor child_executor;\n  executor->AddChild(&child_executor);\n\n  \/\/ Uneventful init...\n  EXPECT_CALL(child_executor, DInit()).WillOnce(Return(true));\n  EXPECT_TRUE(executor->Init());\n\n  \/\/ Where the main work takes place...\n  EXPECT_CALL(child_executor, DExecute()).WillOnce(Return(true)).WillOnce(\n      Return(false));\n\n  EXPECT_CALL(child_executor, GetOutput())\n      .WillOnce(Return(source_logical_tile));\n\n  EXPECT_TRUE(executor->Execute());\n  std::unique_ptr<executor::LogicalTile> result_logical_tile(\n      executor->GetOutput());\n  EXPECT_THAT(result_logical_tile, NotNull());\n  EXPECT_THAT(executor->Execute(), false);\n\n  return result_logical_tile.release();\n}\n\nstorage::DataTable *ExecutorTestsUtil::CreateTable(\n    int tuples_per_tilegroup_count,\n    bool indexes,\n    oid_t table_oid) {\n  catalog::Schema *table_schema = new catalog::Schema(\n      {GetColumnInfo(0), GetColumnInfo(1), GetColumnInfo(2), GetColumnInfo(3)});\n  std::string table_name(\"TEST_TABLE\");\n\n  \/\/ Create table.\n  bool own_schema = true;\n  bool adapt_table = false;\n  storage::DataTable *table = storage::TableFactory::GetDataTable(\n      INVALID_OID, table_oid, table_schema, table_name,\n      tuples_per_tilegroup_count, own_schema, adapt_table);\n\n  if (indexes == true) {\n\n    \/\/ This holds column ID in the underlying table that are being indexed\n    std::vector<oid_t> key_attrs;\n\n    \/\/ This holds schema of the underlying table, which stays all the same\n    \/\/ for all indices on the same underlying table\n    auto tuple_schema = table->GetSchema();\n    \n    \/\/ This points to the schmea of only columns indiced by the index\n    \/\/ This is basically selecting tuple_schema() with key_attrs as index\n    \/\/ but the order inside tuple schema is preserved - the order of schema\n    \/\/ inside key_schema is not the order of real key\n    catalog::Schema *key_schema;\n    \n    \/\/ This will be created for each index on the table\n    \/\/ and the metadata is passed as part of the index construction paratemter\n    \/\/ list\n    index::IndexMetadata *index_metadata;\n    \n    \/\/ Whether keys should be unique. For primary key this must be true;\n    \/\/ for secondary keys this might be true as an extra constraint\n    bool unique;\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ Add primary key on column 0\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n    key_attrs = {0};\n    key_schema = catalog::Schema::CopySchema(tuple_schema, key_attrs);\n    \n    \/\/ This is not redundant\n    \/\/ since the key schema always follows the ordering of the base table\n    \/\/ schema, we need real ordering of the key columns\n    key_schema->SetIndexedColumns(key_attrs);\n\n    unique = true;\n\n    index_metadata = new index::IndexMetadata(\n        \"primary_btree_index\", 123, INDEX_TYPE_BTREE,\n        INDEX_CONSTRAINT_TYPE_PRIMARY_KEY, tuple_schema, key_schema, key_attrs, unique);\n\n    std::shared_ptr<index::Index> pkey_index(index::IndexFactory::GetInstance(index_metadata));\n\n    table->AddIndex(pkey_index);\n\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ Add index on table column 0 and 1\n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \n    key_attrs = {0, 1};\n    key_schema = catalog::Schema::CopySchema(tuple_schema, key_attrs);\n    key_schema->SetIndexedColumns(key_attrs);\n\n    unique = false;\n    index_metadata = new index::IndexMetadata(\n        \"secondary_btree_index\", 124, INDEX_TYPE_BTREE,\n        INDEX_CONSTRAINT_TYPE_DEFAULT, tuple_schema, key_schema, key_attrs, unique);\n    std::shared_ptr<index::Index> sec_index(index::IndexFactory::GetInstance(index_metadata));\n\n    table->AddIndex(sec_index);\n  }\n\n  return table;\n}\n\n\/**\n * @brief Convenience method to create table for test.\n *\n * @return Table generated for test.\n *\/\nstorage::DataTable *ExecutorTestsUtil::CreateAndPopulateTable() {\n  const int tuple_count = TESTS_TUPLES_PER_TILEGROUP;\n  storage::DataTable *table = ExecutorTestsUtil::CreateTable(tuple_count);\n  auto &txn_manager = concurrency::TransactionManagerFactory::GetInstance();\n  txn_manager.BeginTransaction();\n  ExecutorTestsUtil::PopulateTable(table, tuple_count * DEFAULT_TILEGROUP_COUNT,\n                                   false, false, false);\n  txn_manager.CommitTransaction();\n\n  return table;\n}\n\nstd::unique_ptr<storage::Tuple> ExecutorTestsUtil::GetTuple(\n    storage::DataTable *table, oid_t tuple_id, VarlenPool *pool) {\n  std::unique_ptr<storage::Tuple> tuple(\n      new storage::Tuple(table->GetSchema(), true));\n  tuple->SetValue(0, ValueFactory::GetIntegerValue(PopulatedValue(tuple_id, 0)),\n                  pool);\n  tuple->SetValue(1, ValueFactory::GetIntegerValue(PopulatedValue(tuple_id, 1)),\n                  pool);\n  tuple->SetValue(2, ValueFactory::GetDoubleValue(PopulatedValue(tuple_id, 2)),\n                  pool);\n  tuple->SetValue(3, ValueFactory::GetStringValue(\"12345\"), pool);\n\n  return tuple;\n}\n\nstd::unique_ptr<storage::Tuple> ExecutorTestsUtil::GetNullTuple(\n    storage::DataTable *table, VarlenPool *pool) {\n  std::unique_ptr<storage::Tuple> tuple(\n      new storage::Tuple(table->GetSchema(), true));\n  tuple->SetValue(0, ValueFactory::GetNullValue(), pool);\n  tuple->SetValue(1, ValueFactory::GetNullValue(), pool);\n  tuple->SetValue(2, ValueFactory::GetNullValue(), pool);\n  tuple->SetValue(3, ValueFactory::GetNullStringValue(), pool);\n\n  return tuple;\n}\n\nvoid ExecutorTestsUtil::PrintTileVector(\n    std::vector<std::unique_ptr<executor::LogicalTile>> &tile_vec) {\n  for (auto &tile : tile_vec) {\n    for (oid_t tuple_id : *tile) {\n      LOG_INFO(\"<\");\n      for (oid_t col_id = 0; col_id < tile->GetColumnCount(); col_id++) {\n        LOG_INFO(\"%s\", tile->GetValue(tuple_id, col_id).GetInfo().c_str());\n      }\n      LOG_INFO(\">\");\n    }\n  }\n}\n\n}  \/\/ namespace test\n}  \/\/ namespace peloton\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- llvm-ranlib.cpp - LLVM archive index generator --------------------===\/\/\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\/\/ Adds or updates an index (symbol table) for an LLVM archive file.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Module.h\"\n#include \"llvm\/Bitcode\/Archive.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/ManagedStatic.h\"\n#include \"llvm\/System\/Signals.h\"\n#include <iostream>\n#include <iomanip>\n#include <memory>\n\nusing namespace llvm;\n\n\/\/ llvm-ar operation code and modifier flags\nstatic cl::opt<std::string>\nArchiveName(cl::Positional, cl::Optional, cl::desc(\"<archive-file>\"));\n\nstatic cl::opt<bool>\nVerbose(\"verbose\",cl::Optional,cl::init(false),\n        cl::desc(\"Print the symbol table\"));\n\n\/\/ printSymbolTable - print out the archive's symbol table.\nvoid printSymbolTable(Archive* TheArchive) {\n  std::cout << \"\\nArchive Symbol Table:\\n\";\n  const Archive::SymTabType& symtab = TheArchive->getSymbolTable();\n  for (Archive::SymTabType::const_iterator I=symtab.begin(), E=symtab.end();\n       I != E; ++I ) {\n    unsigned offset = TheArchive->getFirstFileOffset() + I->second;\n    std::cout << \" \" << std::setw(9) << offset << \"\\t\" << I->first <<\"\\n\";\n  }\n}\n\nint main(int argc, char **argv) {\n  llvm_shutdown_obj X;  \/\/ Call llvm_shutdown() on exit.\n\n  \/\/ Have the command line options parsed and handle things\n  \/\/ like --help and --version.\n  cl::ParseCommandLineOptions(argc, argv,\n    \"LLVM Archive Index Generator (llvm-ranlib)\\n\\n\"\n    \"  This program adds or updates an index of bitcode symbols\\n\"\n    \"  to an LLVM archive file.\"\n  );\n\n  \/\/ Print a stack trace if we signal out.\n  sys::PrintStackTraceOnErrorSignal();\n\n  int exitCode = 0;\n\n  \/\/ Make sure we don't exit with \"unhandled exception\".\n  try {\n\n    \/\/ Check the path name of the archive\n    sys::Path ArchivePath;\n    if (!ArchivePath.set(ArchiveName))\n      throw std::string(\"Archive name invalid: \") + ArchiveName;\n\n    \/\/ Make sure it exists, we don't create empty archives\n    if (!ArchivePath.exists())\n      throw std::string(\"Archive file does not exist\");\n\n    std::string err_msg;\n    std::auto_ptr<Archive>\n      AutoArchive(Archive::OpenAndLoad(ArchivePath,&err_msg));\n    Archive* TheArchive = AutoArchive.get();\n    if (!TheArchive)\n      throw err_msg;\n\n    if (TheArchive->writeToDisk(true, false, false, &err_msg ))\n      throw err_msg;\n\n    if (Verbose)\n      printSymbolTable(TheArchive);\n\n  } catch (const char*msg) {\n    std::cerr << argv[0] << \": \" << msg << \"\\n\\n\";\n    exitCode = 1;\n  } catch (const std::string& msg) {\n    std::cerr << argv[0] << \": \" << msg << \"\\n\";\n    exitCode = 2;\n  } catch (...) {\n    std::cerr << argv[0] << \": An unexpected unknown exception occurred.\\n\";\n    exitCode = 3;\n  }\n  return exitCode;\n}\n<commit_msg>Add spacing between type and variable name.<commit_after>\/\/===-- llvm-ranlib.cpp - LLVM archive index generator --------------------===\/\/\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\/\/ Adds or updates an index (symbol table) for an LLVM archive file.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Module.h\"\n#include \"llvm\/Bitcode\/Archive.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/ManagedStatic.h\"\n#include \"llvm\/System\/Signals.h\"\n#include <iostream>\n#include <iomanip>\n#include <memory>\n\nusing namespace llvm;\n\n\/\/ llvm-ar operation code and modifier flags\nstatic cl::opt<std::string>\nArchiveName(cl::Positional, cl::Optional, cl::desc(\"<archive-file>\"));\n\nstatic cl::opt<bool>\nVerbose(\"verbose\",cl::Optional,cl::init(false),\n        cl::desc(\"Print the symbol table\"));\n\n\/\/ printSymbolTable - print out the archive's symbol table.\nvoid printSymbolTable(Archive* TheArchive) {\n  std::cout << \"\\nArchive Symbol Table:\\n\";\n  const Archive::SymTabType& symtab = TheArchive->getSymbolTable();\n  for (Archive::SymTabType::const_iterator I=symtab.begin(), E=symtab.end();\n       I != E; ++I ) {\n    unsigned offset = TheArchive->getFirstFileOffset() + I->second;\n    std::cout << \" \" << std::setw(9) << offset << \"\\t\" << I->first <<\"\\n\";\n  }\n}\n\nint main(int argc, char **argv) {\n  llvm_shutdown_obj X;  \/\/ Call llvm_shutdown() on exit.\n\n  \/\/ Have the command line options parsed and handle things\n  \/\/ like --help and --version.\n  cl::ParseCommandLineOptions(argc, argv,\n    \"LLVM Archive Index Generator (llvm-ranlib)\\n\\n\"\n    \"  This program adds or updates an index of bitcode symbols\\n\"\n    \"  to an LLVM archive file.\"\n  );\n\n  \/\/ Print a stack trace if we signal out.\n  sys::PrintStackTraceOnErrorSignal();\n\n  int exitCode = 0;\n\n  \/\/ Make sure we don't exit with \"unhandled exception\".\n  try {\n\n    \/\/ Check the path name of the archive\n    sys::Path ArchivePath;\n    if (!ArchivePath.set(ArchiveName))\n      throw std::string(\"Archive name invalid: \") + ArchiveName;\n\n    \/\/ Make sure it exists, we don't create empty archives\n    if (!ArchivePath.exists())\n      throw std::string(\"Archive file does not exist\");\n\n    std::string err_msg;\n    std::auto_ptr<Archive>\n      AutoArchive(Archive::OpenAndLoad(ArchivePath,&err_msg));\n    Archive* TheArchive = AutoArchive.get();\n    if (!TheArchive)\n      throw err_msg;\n\n    if (TheArchive->writeToDisk(true, false, false, &err_msg ))\n      throw err_msg;\n\n    if (Verbose)\n      printSymbolTable(TheArchive);\n\n  } catch (const char* msg) {\n    std::cerr << argv[0] << \": \" << msg << \"\\n\\n\";\n    exitCode = 1;\n  } catch (const std::string& msg) {\n    std::cerr << argv[0] << \": \" << msg << \"\\n\";\n    exitCode = 2;\n  } catch (...) {\n    std::cerr << argv[0] << \": An unexpected unknown exception occurred.\\n\";\n    exitCode = 3;\n  }\n  return exitCode;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/---------------------------------------------------------\n\/\/ Copyright 2015 Ontario Institute for Cancer Research\n\/\/ Written by Jared Simpson (jared.simpson@oicr.on.ca)\n\/\/---------------------------------------------------------\n\/\/\n\/\/ nanopolish_anchor - a collection of data types\n\/\/ for representing a set of event-to-sequence\n\/\/ mappings.\n#include <vector>\n#include <string>\n#include <stdio.h>\n#include <assert.h>\n#include \"htslib\/faidx.h\"\n#include \"nanopolish_common.h\"\n#include \"nanopolish_anchor.h\"\n#include \"nanopolish_squiggle_read.h\"\n\nHMMRealignmentInput build_input_for_region(const std::string& bam_filename, \n                                           const std::string& ref_filename, \n                                           const Fast5Map& read_name_map, \n                                           const std::string& contig_name,\n                                           int start, \n                                           int end, \n                                           int stride)\n{\n    \/\/ Initialize return data\n    HMMRealignmentInput ret;\n\n    \/\/ load bam file\n    htsFile* bam_fh = sam_open(bam_filename.c_str(), \"r\");\n    assert(bam_fh != NULL);\n\n    \/\/ load bam index file\n    std::string index_filename = bam_filename + \".bai\";\n    hts_idx_t* bam_idx = bam_index_load(index_filename.c_str());\n    assert(bam_idx != NULL);\n\n    \/\/ read the bam header\n    bam_hdr_t* hdr = sam_hdr_read(bam_fh);\n    int contig_id = bam_name2id(hdr, contig_name.c_str());\n    \n    \/\/ load reference fai file\n    faidx_t *fai = fai_load(ref_filename.c_str());\n\n    \/\/ Adjust end position to make sure we don't go out-of-range\n    end = std::min(end, faidx_seq_len(fai, contig_name.c_str()));\n\n    \/\/ load the reference sequence for this region\n    int fetched_len = 0;\n    char* ref_segment = faidx_fetch_seq(fai, contig_name.c_str(), start, end, &fetched_len);\n    ret.original_sequence = ref_segment;\n\n    \/\/ Initialize iteration\n    bam1_t* record = bam_init1();\n    hts_itr_t* itr = sam_itr_queryi(bam_idx, contig_id, start, end);\n    \n    \/\/ Iterate over reads aligned here\n    std::vector<HMMReadAnchorSet> read_anchors;\n    std::vector<std::vector<std::string>> read_substrings;\n\n    \/\/ kmer size of pore model\n    uint32_t k = 0;\n\n    \/\/ Load the SquiggleReads aligned to this region and the bases\n    \/\/ that are mapped to our reference anchoring positions\n    int result;\n    while((result = sam_itr_next(bam_fh, itr, record)) >= 0) {\n\n        \/\/ Load a squiggle read for the mapped read\n        std::string read_name = bam_get_qname(record);\n        std::string fast5_path = read_name_map.get_path(read_name);\n\n        \/\/ load read\n        ret.reads.push_back(std::unique_ptr<SquiggleRead>(new SquiggleRead(read_name, fast5_path)));\n        const SquiggleRead& sr = *ret.reads.back();\n        k = sr.pore_model[T_IDX].k;\n\n        \/\/ parse alignments to reference\n        std::vector<AlignedPair> aligned_pairs = get_aligned_pairs(record);\n        std::vector<int> read_bases_for_anchors = \n            uniformally_sample_read_positions(aligned_pairs, start, end, stride);\n\n        \/*\n        for(size_t i = 0; i < read_bases_for_anchors.size(); ++i) {\n            printf(\"%d \", read_bases_for_anchors[i]);\n        }\n        printf(\"\\n\");\n        *\/\n\n        \/\/ Convert the read base positions into event indices for both strands\n        HMMReadAnchorSet event_anchors;\n        event_anchors.strand_anchors[T_IDX].resize(read_bases_for_anchors.size());\n        event_anchors.strand_anchors[C_IDX].resize(read_bases_for_anchors.size());\n\n        bool do_base_rc = bam_is_rev(record);\n        bool template_rc = do_base_rc;\n        bool complement_rc = !do_base_rc;\n\n        for(size_t ai = 0; ai < read_bases_for_anchors.size(); ++ai) {\n\n            int read_kidx = read_bases_for_anchors[ai];\n\n            \/\/ read not aligned to this reference position\n            if(read_kidx == -1) {\n                continue;\n            }\n\n            if(do_base_rc)\n                read_kidx = sr.flip_k_strand(read_kidx);\n\n            \/\/ If the aligned base is beyong the start of the last k-mer of the read, skip\n            if(read_kidx >= (int)(sr.read_sequence.size() - k + 1)) {\n                continue;\n            }\n\n            int template_idx = sr.get_closest_event_to(read_kidx, T_IDX);\n            int complement_idx = sr.get_closest_event_to(read_kidx, C_IDX);\n\n            assert(template_idx != -1 && complement_idx != -1);\n            assert(template_idx < (int)sr.events[T_IDX].size());\n            assert(complement_idx < (int)sr.events[C_IDX].size());\n\n            event_anchors.strand_anchors[T_IDX][ai] = { template_idx, template_rc };\n            event_anchors.strand_anchors[C_IDX][ai] = { complement_idx, complement_rc };\n            \n            \/\/ If this is not the last anchor, extract the sequence of the read\n            \/\/ from this anchor to the next anchor as an alternative assembly\n            if(ai < read_bases_for_anchors.size() - 1) {\n                int start_kidx = read_bases_for_anchors[ai];\n                int end_kidx = read_bases_for_anchors[ai + 1];\n                int max_kidx = sr.read_sequence.size() - k;\n\n                \/\/ flip\n                if(do_base_rc) {\n                    start_kidx = sr.flip_k_strand(start_kidx);\n                    end_kidx = sr.flip_k_strand(end_kidx);\n                    \n                    \/\/ swap\n                    int tmp = end_kidx;\n                    end_kidx = start_kidx;\n                    start_kidx = tmp;\n                }\n\n                \/\/ clamp values within range\n                start_kidx = start_kidx >= 0 ? start_kidx : 0;\n                end_kidx = end_kidx <= max_kidx ? end_kidx : max_kidx;\n                \n                std::string s = sr.read_sequence.substr(start_kidx, end_kidx - start_kidx + k);\n\n                if(do_base_rc) {\n                    s = gDNAAlphabet.reverse_complement(s);\n                }\n\n                if(ai >= read_substrings.size())\n                    read_substrings.resize(ai + 1);\n\n                read_substrings[ai].push_back(s);\n            }\n        }\n\n        read_anchors.push_back(event_anchors);\n    }\n\n    \/\/ If there are no reads aligned to this segment return empty data\n    if(read_anchors.empty()) {\n        return ret;\n    }\n\n    \/\/ The HMMReadAnchorSet contains anchors for each strand of a read\n    \/\/ laid out in a vector. Transpose this data so we have one anchor\n    \/\/ for every read column-wise.\n    assert(read_anchors.front().strand_anchors[T_IDX].size() == \n           read_anchors.back().strand_anchors[T_IDX].size());\n\n    \/\/ same for all anchors, so we use the first\n    size_t num_anchors = read_anchors.front().strand_anchors[T_IDX].size(); \n    size_t num_strands = read_anchors.size() * 2;\n    \n    ret.anchored_columns.resize(num_anchors);\n    for(size_t ai = 0; ai < num_anchors; ++ai) {\n        \n        HMMAnchoredColumn& column = ret.anchored_columns[ai];\n\n        for(size_t rai = 0; rai < read_anchors.size(); ++rai) {\n            HMMReadAnchorSet& ras = read_anchors[rai];\n            assert(ai < ras.strand_anchors[T_IDX].size());\n            assert(ai < ras.strand_anchors[C_IDX].size());\n\n            column.anchors.push_back(ras.strand_anchors[T_IDX][ai]);\n            column.anchors.push_back(ras.strand_anchors[C_IDX][ai]);\n        }\n        assert(column.anchors.size() == num_strands);\n\n        \/\/ Add sequences except for last anchor\n        if(ai != num_anchors - 1) {\n            \n            \/\/ base, these sequences need to overlap by k - 1 bases\n            int base_length = stride + k;\n            if((int)ai * stride + base_length > fetched_len)\n                base_length = fetched_len - ai * stride;\n\n            column.base_sequence = std::string(ref_segment + ai * stride, base_length);\n            column.base_contig = contig_name;\n            column.base_start_position = start + ai * stride;\n            assert(column.base_sequence.back() != '\\0');\n\n            \/\/ alts\n            if(ai < read_substrings.size())\n                column.alt_sequences = read_substrings[ai];\n        }\n    }\n\n    \/\/ cleanup\n    sam_itr_destroy(itr);\n    bam_hdr_destroy(hdr);\n    bam_destroy1(record);\n    fai_destroy(fai);\n    sam_close(bam_fh);\n    hts_idx_destroy(bam_idx);\n    free(ref_segment);\n\n    return ret;\n}\n\nstd::vector<AlignedPair> get_aligned_pairs(const bam1_t* record, int read_stride)\n{\n    std::vector<AlignedPair> out;\n\n    \/\/ This code is derived from bam_fillmd1_core\n    \/\/uint8_t *ref = NULL;\n    \/\/uint8_t *seq = bam_get_seq(record);\n    uint32_t *cigar = bam_get_cigar(record);\n    const bam1_core_t *c = &record->core;\n\n    \/\/ read pos is an index into the original sequence that is present in the FASTQ\n    \/\/ on the strand matching the reference\n    int read_pos = 0;\n\n    \/\/ query pos is an index in the query string that is recorded in the bam\n    \/\/ we record this as a sanity check\n    \/\/int query_pos = 0;\n    \n    int ref_pos = c->pos;\n\n    for (int ci = 0; ci < c->n_cigar; ++ci) {\n        \n        int cigar_len = cigar[ci] >> 4;\n        int cigar_op = cigar[ci] & 0xf;\n\n        \/\/ Set the amount that the ref\/read positions should be incremented\n        \/\/ based on the cigar operation\n        int read_inc = 0;\n        int ref_inc = 0;\n        \n        \/\/ Process match between the read and the reference\n        bool is_aligned = false;\n        if(cigar_op == BAM_CMATCH || cigar_op == BAM_CEQUAL || cigar_op == BAM_CDIFF) {\n            is_aligned = true;\n            read_inc = read_stride;\n            ref_inc = 1;\n        } else if(cigar_op == BAM_CDEL || cigar_op == BAM_CREF_SKIP) {\n            ref_inc = 1;   \n        } else if(cigar_op == BAM_CINS) {\n            read_inc = read_stride;\n        } else if(cigar_op == BAM_CSOFT_CLIP) {\n            read_inc = 1; \/\/ special case, do not use read_stride\n        } else if(cigar_op == BAM_CHARD_CLIP) {\n            read_inc = 0;\n        } else {\n            printf(\"Cigar: %d\\n\", cigar_op);\n            assert(false && \"Unhandled cigar operation\");\n        }\n\n        \/\/ Iterate over the pairs of aligned bases\n        for(int j = 0; j < cigar_len; ++j) {\n            if(is_aligned) {\n                out.push_back({ref_pos, read_pos});\n            }\n\n            \/\/ increment\n            read_pos += read_inc;\n            ref_pos += ref_inc;\n        }\n    }\n    return out;\n}\n\nstd::vector<int> uniformally_sample_read_positions(const std::vector<AlignedPair>& aligned_pairs,\n                                                   int ref_start,\n                                                   int ref_end,\n                                                   int ref_stride)\n{\n    uint32_t num_anchors = ((ref_end - ref_start) \/ ref_stride) + 1;\n    std::vector<int> out(num_anchors, -1);\n\n    for(size_t pair_idx = 0; pair_idx < aligned_pairs.size(); ++pair_idx) {\n\n        \/\/ We use a loop here in case there is no read base\n        \/\/ aligned to one of the anchor positions we are interested in.\n        \/\/ In this situation the loop will catch it and emit the last seen\n        \/\/ read position\n        int ref_pos = aligned_pairs[pair_idx].ref_pos;\n        int end_pos = pair_idx + 1 != aligned_pairs.size() ? aligned_pairs[pair_idx + 1].ref_pos : ref_pos + 1;\n\n        for(; ref_pos < end_pos; ++ref_pos) {\n            if(ref_pos >= ref_start && ref_pos <= ref_end && ref_pos % ref_stride == 0) {\n                uint32_t anchor_id = (ref_pos - ref_start) \/ ref_stride;\n                assert(anchor_id < num_anchors);\n                out[anchor_id] = aligned_pairs[pair_idx].read_pos;\n            }\n        }\n    }\n    return out;\n}\n<commit_msg>add missing check after fixing conversion warnings<commit_after>\/\/---------------------------------------------------------\n\/\/ Copyright 2015 Ontario Institute for Cancer Research\n\/\/ Written by Jared Simpson (jared.simpson@oicr.on.ca)\n\/\/---------------------------------------------------------\n\/\/\n\/\/ nanopolish_anchor - a collection of data types\n\/\/ for representing a set of event-to-sequence\n\/\/ mappings.\n#include <vector>\n#include <string>\n#include <stdio.h>\n#include <assert.h>\n#include \"htslib\/faidx.h\"\n#include \"nanopolish_common.h\"\n#include \"nanopolish_anchor.h\"\n#include \"nanopolish_squiggle_read.h\"\n\nHMMRealignmentInput build_input_for_region(const std::string& bam_filename, \n                                           const std::string& ref_filename, \n                                           const Fast5Map& read_name_map, \n                                           const std::string& contig_name,\n                                           int start, \n                                           int end, \n                                           int stride)\n{\n    \/\/ Initialize return data\n    HMMRealignmentInput ret;\n\n    \/\/ load bam file\n    htsFile* bam_fh = sam_open(bam_filename.c_str(), \"r\");\n    assert(bam_fh != NULL);\n\n    \/\/ load bam index file\n    std::string index_filename = bam_filename + \".bai\";\n    hts_idx_t* bam_idx = bam_index_load(index_filename.c_str());\n    assert(bam_idx != NULL);\n\n    \/\/ read the bam header\n    bam_hdr_t* hdr = sam_hdr_read(bam_fh);\n    int contig_id = bam_name2id(hdr, contig_name.c_str());\n    \n    \/\/ load reference fai file\n    faidx_t *fai = fai_load(ref_filename.c_str());\n\n    \/\/ Adjust end position to make sure we don't go out-of-range\n    end = std::min(end, faidx_seq_len(fai, contig_name.c_str()));\n\n    \/\/ load the reference sequence for this region\n    int fetched_len = 0;\n    char* ref_segment = faidx_fetch_seq(fai, contig_name.c_str(), start, end, &fetched_len);\n    ret.original_sequence = ref_segment;\n\n    \/\/ Initialize iteration\n    bam1_t* record = bam_init1();\n    hts_itr_t* itr = sam_itr_queryi(bam_idx, contig_id, start, end);\n    \n    \/\/ Iterate over reads aligned here\n    std::vector<HMMReadAnchorSet> read_anchors;\n    std::vector<std::vector<std::string>> read_substrings;\n\n    \/\/ kmer size of pore model\n    uint32_t k = 0;\n\n    \/\/ Load the SquiggleReads aligned to this region and the bases\n    \/\/ that are mapped to our reference anchoring positions\n    int result;\n    while((result = sam_itr_next(bam_fh, itr, record)) >= 0) {\n\n        \/\/ Load a squiggle read for the mapped read\n        std::string read_name = bam_get_qname(record);\n        std::string fast5_path = read_name_map.get_path(read_name);\n\n        \/\/ load read\n        ret.reads.push_back(std::unique_ptr<SquiggleRead>(new SquiggleRead(read_name, fast5_path)));\n        const SquiggleRead& sr = *ret.reads.back();\n        k = sr.pore_model[T_IDX].k;\n\n        \/\/ parse alignments to reference\n        std::vector<AlignedPair> aligned_pairs = get_aligned_pairs(record);\n        std::vector<int> read_bases_for_anchors = \n            uniformally_sample_read_positions(aligned_pairs, start, end, stride);\n\n        \/*\n        for(size_t i = 0; i < read_bases_for_anchors.size(); ++i) {\n            printf(\"%d \", read_bases_for_anchors[i]);\n        }\n        printf(\"\\n\");\n        *\/\n\n        \/\/ Convert the read base positions into event indices for both strands\n        HMMReadAnchorSet event_anchors;\n        event_anchors.strand_anchors[T_IDX].resize(read_bases_for_anchors.size());\n        event_anchors.strand_anchors[C_IDX].resize(read_bases_for_anchors.size());\n\n        bool do_base_rc = bam_is_rev(record);\n        bool template_rc = do_base_rc;\n        bool complement_rc = !do_base_rc;\n\n        for(size_t ai = 0; ai < read_bases_for_anchors.size(); ++ai) {\n\n            int read_kidx = read_bases_for_anchors[ai];\n\n            \/\/ read not aligned to this reference position\n            if(read_kidx == -1) {\n                continue;\n            }\n\n            if(do_base_rc)\n                read_kidx = sr.flip_k_strand(read_kidx);\n\n            \/\/ If the aligned base is beyong the start of the last k-mer of the read, skip\n            if(read_kidx < 0 || read_kidx >= (int)(sr.read_sequence.size() - k + 1)) {\n                continue;\n            }\n\n            int template_idx = sr.get_closest_event_to(read_kidx, T_IDX);\n            int complement_idx = sr.get_closest_event_to(read_kidx, C_IDX);\n\n            assert(template_idx != -1 && complement_idx != -1);\n            assert(template_idx < (int)sr.events[T_IDX].size());\n            assert(complement_idx < (int)sr.events[C_IDX].size());\n\n            event_anchors.strand_anchors[T_IDX][ai] = { template_idx, template_rc };\n            event_anchors.strand_anchors[C_IDX][ai] = { complement_idx, complement_rc };\n            \n            \/\/ If this is not the last anchor, extract the sequence of the read\n            \/\/ from this anchor to the next anchor as an alternative assembly\n            if(ai < read_bases_for_anchors.size() - 1) {\n                int start_kidx = read_bases_for_anchors[ai];\n                int end_kidx = read_bases_for_anchors[ai + 1];\n                int max_kidx = sr.read_sequence.size() - k;\n\n                \/\/ flip\n                if(do_base_rc) {\n                    start_kidx = sr.flip_k_strand(start_kidx);\n                    end_kidx = sr.flip_k_strand(end_kidx);\n                    \n                    \/\/ swap\n                    int tmp = end_kidx;\n                    end_kidx = start_kidx;\n                    start_kidx = tmp;\n                }\n\n                \/\/ clamp values within range\n                start_kidx = start_kidx >= 0 ? start_kidx : 0;\n                end_kidx = end_kidx <= max_kidx ? end_kidx : max_kidx;\n                \n                std::string s = sr.read_sequence.substr(start_kidx, end_kidx - start_kidx + k);\n\n                if(do_base_rc) {\n                    s = gDNAAlphabet.reverse_complement(s);\n                }\n\n                if(ai >= read_substrings.size())\n                    read_substrings.resize(ai + 1);\n\n                read_substrings[ai].push_back(s);\n            }\n        }\n\n        read_anchors.push_back(event_anchors);\n    }\n\n    \/\/ If there are no reads aligned to this segment return empty data\n    if(read_anchors.empty()) {\n        return ret;\n    }\n\n    \/\/ The HMMReadAnchorSet contains anchors for each strand of a read\n    \/\/ laid out in a vector. Transpose this data so we have one anchor\n    \/\/ for every read column-wise.\n    assert(read_anchors.front().strand_anchors[T_IDX].size() == \n           read_anchors.back().strand_anchors[T_IDX].size());\n\n    \/\/ same for all anchors, so we use the first\n    size_t num_anchors = read_anchors.front().strand_anchors[T_IDX].size(); \n    size_t num_strands = read_anchors.size() * 2;\n    \n    ret.anchored_columns.resize(num_anchors);\n    for(size_t ai = 0; ai < num_anchors; ++ai) {\n        \n        HMMAnchoredColumn& column = ret.anchored_columns[ai];\n\n        for(size_t rai = 0; rai < read_anchors.size(); ++rai) {\n            HMMReadAnchorSet& ras = read_anchors[rai];\n            assert(ai < ras.strand_anchors[T_IDX].size());\n            assert(ai < ras.strand_anchors[C_IDX].size());\n\n            column.anchors.push_back(ras.strand_anchors[T_IDX][ai]);\n            column.anchors.push_back(ras.strand_anchors[C_IDX][ai]);\n        }\n        assert(column.anchors.size() == num_strands);\n\n        \/\/ Add sequences except for last anchor\n        if(ai != num_anchors - 1) {\n            \n            \/\/ base, these sequences need to overlap by k - 1 bases\n            int base_length = stride + k;\n            if((int)ai * stride + base_length > fetched_len)\n                base_length = fetched_len - ai * stride;\n\n            column.base_sequence = std::string(ref_segment + ai * stride, base_length);\n            column.base_contig = contig_name;\n            column.base_start_position = start + ai * stride;\n            assert(column.base_sequence.back() != '\\0');\n\n            \/\/ alts\n            if(ai < read_substrings.size())\n                column.alt_sequences = read_substrings[ai];\n        }\n    }\n\n    \/\/ cleanup\n    sam_itr_destroy(itr);\n    bam_hdr_destroy(hdr);\n    bam_destroy1(record);\n    fai_destroy(fai);\n    sam_close(bam_fh);\n    hts_idx_destroy(bam_idx);\n    free(ref_segment);\n\n    return ret;\n}\n\nstd::vector<AlignedPair> get_aligned_pairs(const bam1_t* record, int read_stride)\n{\n    std::vector<AlignedPair> out;\n\n    \/\/ This code is derived from bam_fillmd1_core\n    \/\/uint8_t *ref = NULL;\n    \/\/uint8_t *seq = bam_get_seq(record);\n    uint32_t *cigar = bam_get_cigar(record);\n    const bam1_core_t *c = &record->core;\n\n    \/\/ read pos is an index into the original sequence that is present in the FASTQ\n    \/\/ on the strand matching the reference\n    int read_pos = 0;\n\n    \/\/ query pos is an index in the query string that is recorded in the bam\n    \/\/ we record this as a sanity check\n    \/\/int query_pos = 0;\n    \n    int ref_pos = c->pos;\n\n    for (int ci = 0; ci < c->n_cigar; ++ci) {\n        \n        int cigar_len = cigar[ci] >> 4;\n        int cigar_op = cigar[ci] & 0xf;\n\n        \/\/ Set the amount that the ref\/read positions should be incremented\n        \/\/ based on the cigar operation\n        int read_inc = 0;\n        int ref_inc = 0;\n        \n        \/\/ Process match between the read and the reference\n        bool is_aligned = false;\n        if(cigar_op == BAM_CMATCH || cigar_op == BAM_CEQUAL || cigar_op == BAM_CDIFF) {\n            is_aligned = true;\n            read_inc = read_stride;\n            ref_inc = 1;\n        } else if(cigar_op == BAM_CDEL || cigar_op == BAM_CREF_SKIP) {\n            ref_inc = 1;   \n        } else if(cigar_op == BAM_CINS) {\n            read_inc = read_stride;\n        } else if(cigar_op == BAM_CSOFT_CLIP) {\n            read_inc = 1; \/\/ special case, do not use read_stride\n        } else if(cigar_op == BAM_CHARD_CLIP) {\n            read_inc = 0;\n        } else {\n            printf(\"Cigar: %d\\n\", cigar_op);\n            assert(false && \"Unhandled cigar operation\");\n        }\n\n        \/\/ Iterate over the pairs of aligned bases\n        for(int j = 0; j < cigar_len; ++j) {\n            if(is_aligned) {\n                out.push_back({ref_pos, read_pos});\n            }\n\n            \/\/ increment\n            read_pos += read_inc;\n            ref_pos += ref_inc;\n        }\n    }\n    return out;\n}\n\nstd::vector<int> uniformally_sample_read_positions(const std::vector<AlignedPair>& aligned_pairs,\n                                                   int ref_start,\n                                                   int ref_end,\n                                                   int ref_stride)\n{\n    uint32_t num_anchors = ((ref_end - ref_start) \/ ref_stride) + 1;\n    std::vector<int> out(num_anchors, -1);\n\n    for(size_t pair_idx = 0; pair_idx < aligned_pairs.size(); ++pair_idx) {\n\n        \/\/ We use a loop here in case there is no read base\n        \/\/ aligned to one of the anchor positions we are interested in.\n        \/\/ In this situation the loop will catch it and emit the last seen\n        \/\/ read position\n        int ref_pos = aligned_pairs[pair_idx].ref_pos;\n        int end_pos = pair_idx + 1 != aligned_pairs.size() ? aligned_pairs[pair_idx + 1].ref_pos : ref_pos + 1;\n\n        for(; ref_pos < end_pos; ++ref_pos) {\n            if(ref_pos >= ref_start && ref_pos <= ref_end && ref_pos % ref_stride == 0) {\n                uint32_t anchor_id = (ref_pos - ref_start) \/ ref_stride;\n                assert(anchor_id < num_anchors);\n                out[anchor_id] = aligned_pairs[pair_idx].read_pos;\n            }\n        }\n    }\n    return out;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: svborder.cxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: hr $ $Date: 2007-06-27 22:14: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_tools.hxx\"\n\n#include <tools\/svborder.hxx>\n#include <osl\/diagnose.h>\n\nSvBorder::SvBorder( const Rectangle & rOuter, const Rectangle & rInner )\n{\n    Rectangle aOuter( rOuter );\n    aOuter.Justify();\n    Rectangle aInner( rInner );\n    if( aInner.IsEmpty() )\n        aInner = Rectangle( aOuter.Center(), aOuter.Center() );\n    else\n        aInner.Justify();\n\n    OSL_ENSURE( aOuter.IsInside( aInner ),\n                \"SvBorder::SvBorder: FALSE == aOuter.IsInside( aInner )\" );\n    nTop    = aInner.Top()    - aOuter.Top();\n    nRight  = aOuter.Right()  - aInner.Right();\n    nBottom = aOuter.Bottom() - aInner.Bottom();\n    nLeft   = aInner.Left()   - aOuter.Left();\n}\n\nRectangle & operator += ( Rectangle & rRect, const SvBorder & rBorder )\n{\n    \/\/ wegen Empty-Rect, GetSize muss als erstes gerufen werden\n    Size aS( rRect.GetSize() );\n    aS.Width()  += rBorder.Left() + rBorder.Right();\n    aS.Height() += rBorder.Top() + rBorder.Bottom();\n\n    rRect.Left()   -= rBorder.Left();\n    rRect.Top()    -= rBorder.Top();\n    rRect.SetSize( aS );\n    return rRect;\n}\n\nRectangle & operator -= ( Rectangle & rRect, const SvBorder & rBorder )\n{\n    \/\/ wegen Empty-Rect, GetSize muss als erstes gerufen werden\n    Size aS( rRect.GetSize() );\n    aS.Width()  -= rBorder.Left() + rBorder.Right();\n    aS.Height() -= rBorder.Top() + rBorder.Bottom();\n\n    rRect.Left()   += rBorder.Left();\n    rRect.Top()    += rBorder.Top();\n    rRect.SetSize( aS );\n    return rRect;\n}\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.5.84); FILE MERGED 2008\/03\/28 15:41:21 rt 1.5.84.1: #i87441# Change license header to LPGL v3.<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: svborder.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_tools.hxx\"\n\n#include <tools\/svborder.hxx>\n#include <osl\/diagnose.h>\n\nSvBorder::SvBorder( const Rectangle & rOuter, const Rectangle & rInner )\n{\n    Rectangle aOuter( rOuter );\n    aOuter.Justify();\n    Rectangle aInner( rInner );\n    if( aInner.IsEmpty() )\n        aInner = Rectangle( aOuter.Center(), aOuter.Center() );\n    else\n        aInner.Justify();\n\n    OSL_ENSURE( aOuter.IsInside( aInner ),\n                \"SvBorder::SvBorder: FALSE == aOuter.IsInside( aInner )\" );\n    nTop    = aInner.Top()    - aOuter.Top();\n    nRight  = aOuter.Right()  - aInner.Right();\n    nBottom = aOuter.Bottom() - aInner.Bottom();\n    nLeft   = aInner.Left()   - aOuter.Left();\n}\n\nRectangle & operator += ( Rectangle & rRect, const SvBorder & rBorder )\n{\n    \/\/ wegen Empty-Rect, GetSize muss als erstes gerufen werden\n    Size aS( rRect.GetSize() );\n    aS.Width()  += rBorder.Left() + rBorder.Right();\n    aS.Height() += rBorder.Top() + rBorder.Bottom();\n\n    rRect.Left()   -= rBorder.Left();\n    rRect.Top()    -= rBorder.Top();\n    rRect.SetSize( aS );\n    return rRect;\n}\n\nRectangle & operator -= ( Rectangle & rRect, const SvBorder & rBorder )\n{\n    \/\/ wegen Empty-Rect, GetSize muss als erstes gerufen werden\n    Size aS( rRect.GetSize() );\n    aS.Width()  -= rBorder.Left() + rBorder.Right();\n    aS.Height() -= rBorder.Top() + rBorder.Bottom();\n\n    rRect.Left()   += rBorder.Left();\n    rRect.Top()    += rBorder.Top();\n    rRect.SetSize( aS );\n    return rRect;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"collector.h\"\n#include \"SceneGraph\/clwscene.h\"\n#include \"SceneGraph\/iterator.h\"\n#include <vector>\n#include <cassert>\n\nnamespace Baikal\n{\n    struct IdCompare \n    {\n        bool operator() (const SceneObject::Ptr& lhs, const SceneObject::Ptr& rhs) const\n        {\n            return lhs->GetId() < rhs->GetId();\n        }\n    };\n    using ItemMap = std::map<SceneObject::Ptr, int>;\n    using ItemSet = std::set<SceneObject::Ptr, IdCompare>;\n\n    class BundleImpl : public Bundle\n    {\n    public:\n        BundleImpl(ItemMap const& map, ItemSet const& set)\n        : m_map(map)\n        , m_set(set)\n        {\n        }\n\n        ItemMap m_map;\n        ItemSet m_set;\n    };\n\n    struct Collector::CollectorImpl\n    {\n        ItemMap m_map;\n        ItemSet m_set;\n    };\n\n    Collector::Collector()\n    : m_impl (new CollectorImpl)\n    {\n    }\n\n    Collector::~Collector() = default;\n\n    void Collector::Clear()\n    {\n        m_impl->m_map.clear();\n        m_impl->m_set.clear();\n    }\n\n    std::unique_ptr<Iterator> Collector::CreateIterator() const\n    {\n        return std::unique_ptr<Iterator>(\n            new IteratorImpl<ItemSet::const_iterator>(m_impl->m_set.cbegin(),\n                                                      m_impl->m_set.cend()));\n    }\n    \n    void Collector::Collect(Iterator& iter, ExpandFunc expand_func)\n    {\n        for(;iter.IsValid(); iter.Next())\n        {\n            \/\/ Expand current item\n            auto cur_items = expand_func(iter.Item());\n\n            \/\/ Insert items\n            m_impl->m_set.insert(cur_items.cbegin(), cur_items.cend());\n        }\n    }\n\n    void Collector::Collect(std::shared_ptr < Baikal::SceneObject > object)\n    {\n        m_impl->m_set.insert(object);\n    }\n\n    void Collector::Commit()\n    {\n        m_impl->m_map.clear();\n\n        int idx = 0;\n        for (auto& i : m_impl->m_set)\n        {\n            m_impl->m_map[i] = idx++;\n        }\n    }\n\n    void Collector::Finalize(FinalizeFunc finalize_func)\n    {\n        for (auto& i : m_impl->m_set)\n        {\n            finalize_func(i);\n        }\n    }\n\n    bool Collector::NeedsUpdate(Bundle const* bundle, ChangedFunc changed_func) const\n    {\n        auto bundle_impl = static_cast<BundleImpl const*>(bundle);\n\n        \/\/ Check if:\n        \/\/ 0) bundle and our map sizes match.\n        \/\/ 1) All the objects collector has are in the bundle.\n        \/\/ 2) They have not changed.\n        if (bundle_impl->m_set.size() != m_impl->m_set.size())\n        {\n            return true;\n        }\n\n        for (auto& i : m_impl->m_set)\n        {\n            if (changed_func(i))\n            {\n                \/\/ Case 2: we have the object which is changed.\n                return true;\n            }\n\n            auto iter = bundle_impl->m_set.find(i);\n\n            if (iter == bundle_impl->m_set.cend())\n            {\n                \/\/ Case 1: we have an object which is not serialized as a part of bundle.\n                return true;\n            }\n\n            \/\/ Here we know that bundle_impl->m_map[i] == m_impl->m_map[i]\n            \/\/ since it is defined by set traversal order.\n        }\n\n        return false;\n    }\n\n    std::size_t Collector::GetNumItems() const\n    {\n        return m_impl->m_set.size();\n    }\n\n    Bundle* Collector::CreateBundle() const\n    {\n        return new BundleImpl { m_impl->m_map, m_impl->m_set };\n    }\n\n    std::uint32_t Collector::GetItemIndex(SceneObject::Ptr item) const\n    {\n        auto iter = m_impl->m_map.find(item);\n\n        if (iter == m_impl->m_map.cend())\n        {\n            throw std::runtime_error(\"No such item in the collector\");\n        }\n\n        return iter->second;\n    }\n\n\n}\n<commit_msg>Switch to unordered_map in collector<commit_after>#include \"collector.h\"\n#include \"SceneGraph\/clwscene.h\"\n#include \"SceneGraph\/iterator.h\"\n#include <vector>\n#include <cassert>\n#include <unordered_map>\n\nnamespace Baikal\n{\n    struct IdCompare\n    {\n        bool operator() (const SceneObject::Ptr& lhs, const SceneObject::Ptr& rhs) const\n        {\n            return lhs->GetId() < rhs->GetId();\n        }\n    };\n    using ItemMap = std::unordered_map<uint32_t, int>;\n    using ItemSet = std::set<SceneObject::Ptr, IdCompare>;\n    \n    class BundleImpl : public Bundle\n    {\n    public:\n        BundleImpl(ItemMap const& map, ItemSet const& set)\n        : m_map(map)\n        , m_set(set)\n        {\n        }\n        \n        ItemMap m_map;\n        ItemSet m_set;\n    };\n    \n    struct Collector::CollectorImpl\n    {\n        ItemMap m_map;\n        ItemSet m_set;\n    };\n    \n    Collector::Collector()\n    : m_impl (new CollectorImpl)\n    {\n    }\n    \n    Collector::~Collector() = default;\n    \n    void Collector::Clear()\n    {\n        m_impl->m_map.clear();\n        m_impl->m_set.clear();\n    }\n    \n    std::unique_ptr<Iterator> Collector::CreateIterator() const\n    {\n        return std::unique_ptr<Iterator>(\n            new IteratorImpl<ItemSet::const_iterator>(m_impl->m_set.cbegin(),\n                                                      m_impl->m_set.cend()));\n    }\n    \n    void Collector::Collect(Iterator& iter, ExpandFunc expand_func)\n    {\n        for(;iter.IsValid(); iter.Next())\n        {\n            \/\/ Expand current item\n            auto cur_items = expand_func(iter.Item());\n            \n            \/\/ Insert items\n            m_impl->m_set.insert(cur_items.cbegin(), cur_items.cend());\n        }\n    }\n\n    void Collector::Collect(std::shared_ptr < Baikal::SceneObject > object)\n    {\n        m_impl->m_set.insert(object);\n    }\n\n    void Collector::Commit()\n    {\n        m_impl->m_map.clear();\n        \n        int idx = 0;\n        for (auto& i : m_impl->m_set)\n        {\n            m_impl->m_map[i->GetId()] = idx++;\n        }\n    }\n    \n    void Collector::Finalize(FinalizeFunc finalize_func)\n    {\n        for (auto& i : m_impl->m_set)\n        {\n            finalize_func(i);\n        }\n    }\n    \n    bool Collector::NeedsUpdate(Bundle const* bundle, ChangedFunc changed_func) const\n    {\n        auto bundle_impl = static_cast<BundleImpl const*>(bundle);\n        \n        \/\/ Check if:\n        \/\/ 0) bundle and our map sizes match.\n        \/\/ 1) All the objects collector has are in the bundle.\n        \/\/ 2) They have not changed.\n        if (bundle_impl->m_set.size() != m_impl->m_set.size())\n        {\n            return true;\n        }\n        \n        for (auto& i : m_impl->m_set)\n        {\n            if (changed_func(i))\n            {\n                \/\/ Case 2: we have the object which is changed.\n                return true;\n            }\n            \n            auto iter = bundle_impl->m_set.find(i);\n            \n            if (iter == bundle_impl->m_set.cend())\n            {\n                \/\/ Case 1: we have an object which is not serialized as a part of bundle.\n                return true;\n            }\n\n            \/\/ Here we know that bundle_impl->m_map[i] == m_impl->m_map[i]\n            \/\/ since it is defined by set traversal order.\n        }\n        \n        return false;\n    }\n    \n    std::size_t Collector::GetNumItems() const\n    {\n        return m_impl->m_set.size();\n    }\n    \n    Bundle* Collector::CreateBundle() const\n    {\n        return new BundleImpl { m_impl->m_map, m_impl->m_set };\n    }\n    \n    std::uint32_t Collector::GetItemIndex(SceneObject::Ptr item) const\n    {\n        auto iter = m_impl->m_map.find(item->GetId());\n        \n        if (iter == m_impl->m_map.cend())\n        {\n            throw std::runtime_error(\"No such item in the collector\");\n        }\n        \n        return iter->second;\n    }\n    \n    \n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n\nusing namespace std;\n\nclass datas {\n\tfriend class PNode;\n\tfriend class PoQueue;\n\tfriend PoQueue addterm(PoQueue a, PoQueue b);\n\tfriend PoQueue subterm(PoQueue &a, PoQueue b);\n\tfriend PoQueue multterm(PoQueue a, PoQueue b);\n\tfriend PoQueue multtermAll(datas a, PoQueue b);\nprivate:\n\tint ci, xi;\npublic:\n\tdatas(int a,int b):ci(a),xi(b){}\n};\n\nclass PNode {\n\tfriend class PoQueue;\npublic:\n\tPNode(datas a,PNode *p) :data(a), next(p) {}\nprivate:\n\tdatas data;\n\tPNode* next;\n};\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nclass PoQueue {\n\tfriend PoQueue addterm(PoQueue a, PoQueue b);\n\tfriend PoQueue subterm(PoQueue &a, PoQueue b);\n\tfriend PoQueue multtermAll(datas a, PoQueue b);\n\tfriend PoQueue multterm(PoQueue a, PoQueue b);\nprivate:\n\tvoid deenQueue(datas);\n\tdatas deQueue();\n\tvoid enQueue(datas);\n\tint size() { return N; }\n\tbool isEmpty() { return N == 0; }\n\tPNode *first,*last;\n\tint N;\npublic:\n\tPoQueue() :N(0), first(NULL), last(NULL) {}\n\tPoQueue(PoQueue& y) :N(0), first(NULL), last(NULL) {\n\t\tPNode* tp = y.first;\n\t\tfor (int i = y.N; i > 0; i--)\n\t\t{\n\t\t\tenQueue(tp->data);\n\t\t\ttp = tp->next;\n\t\t}\n\t}\n\t~PoQueue() {\n\t\tfor (int i = N; i > 0; i--)\n\t\t{\n\t\t\tPNode* tp = first;\n\t\t\tfirst = first->next;\n\t\t\tdelete tp;\n\t\t}\n\t}\n\tPoQueue& enIt(int ci, int xi);\n\tPoQueue& show();\n};\nPoQueue& PoQueue::show() {\n\tPNode* tp = first;\n\tfor (int i = N; i > 0; i--)\n\t{\n\t\tcout << tp->data.xi << \"x^\" << tp->data.ci;\n\t\ttp = tp->next;\n\t\tif (i != 1)\n\t\t\tcout << '+';\n\t}\n\tcout << endl;\n\treturn *this;\n\n}\nvoid PoQueue::enQueue(datas a) {\n\tPNode* oldlast = last;\n\tlast = new PNode(a, NULL);\n\tif (isEmpty())\t first = last;\n\telse\t\t\toldlast->next = last;\n\tN++;\n}\nvoid PoQueue::deenQueue(datas a) {\n\tPNode* oldfirst = first;\n\tfirst = new PNode(a, oldfirst);\n\tN++;\n}\ndatas PoQueue::deQueue() {\n\tif (first)\n\t{\n\t\tdatas t = first->data;\n\t\tPNode* tp = first;\n\t\tfirst = first->next;\n\t\tdelete tp;\n\t\tN--;\n\t\treturn t;\n\t}\n\tthrow underflow_error(\"Nothing to deQueue!\");\n}\n\nPoQueue& PoQueue::enIt(int xi, int ci) {\n\tdatas a1(ci, xi);\n\tenQueue(a1);\n\treturn *this;\n}\n\nPoQueue addterm(PoQueue a, PoQueue b) {\n\tPoQueue result;\n\twhile (1) {\n\t\tif (a.isEmpty() && b.isEmpty())\treturn result;\n\t\telse if (b.isEmpty()) {\n\t\t\tresult.enQueue(a.deQueue());\n\t\t}\n\t\telse if (a.isEmpty()) {\n\t\t\tresult.enQueue(b.deQueue());\n\t\t}\n\t\telse {\n\t\t\tdatas as = a.deQueue(), bs = b.deQueue();\n\t\t\tif (as.ci>bs.ci)\n\t\t\t{\n\t\t\t\tresult.enQueue(as);\n\t\t\t\tb.deenQueue(bs);\n\t\t\t}\n\t\t\telse \tif (as.ci<bs.ci)\n\t\t\t{\n\t\t\t\tresult.enQueue(bs);\n\t\t\t\ta.deenQueue(as);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tdatas oh(as.ci, as.xi + bs.xi);\n\t\t\t\tresult.enQueue(oh);\n\t\t\t}\n\t\t}\n\t}\n\t\n}\nPoQueue subterm(PoQueue &a, PoQueue b) {\n\tdatas fuhao(0, -1);\n\tPoQueue newb(multtermAll(fuhao, b));\n\treturn addterm(a, newb);\n}\nPoQueue multtermAll(datas a, PoQueue b) {\n\tPoQueue result;\n\twhile (1)\n\t{\n\t\tif (b.isEmpty())\n\t\t\treturn result;\n\t\tdatas ee = b.deQueue();\n\t\tdatas oh(a.ci + ee.ci, a.xi * ee.xi);\n\t\tresult.enQueue(oh);\n\t}\n}\nPoQueue multterm(PoQueue a, PoQueue b) {\n\tstatic PoQueue empty;\n\tif (a.isEmpty())\n\t\treturn empty;\n\telse\n\t{\n\t\tdatas temp = a.deQueue();\n\t\tPoQueue tempb(b);\n\t\treturn addterm(multtermAll(temp, tempb), multterm(a, b));\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/*\nAPI:PoQueue\n\n\nPoQueue& PoQueue::enIt(int xi, int ci  ɴС\nPoQueue addterm(PoQueue a, PoQueue b)\nPoQueue subterm(PoQueue &a, PoQueue b)\nPoQueue multterm(PoQueue a, PoQueue b)\nPoQueue multtermAll(datas a, PoQueue b)\nPoQueue& PoQueue::show()\n\n\n*\/\nvoid main(void) {\n\tPoQueue a, b,c;\n\ta.enIt(2, 1); \n\tb.enIt(2, 5).enIt(3, 4).enIt(2, 3); \n\tc.enIt(2, 2);\/\/enIt ɴС\n\tsubterm(multterm(addterm(a, b).show(), a).show(),c).show();\n}<commit_msg>update<commit_after><|endoftext|>"}
{"text":"<commit_before>\n\n#include <iostream>\n#include \"parser\/packrat_parser.h\"\n\nusing namespace std;\nusing namespace lars;\n\nclass math_visitor{\n  \n  double value;\n  \npublic:\n  \n  double get_value(){\n    return value;\n  }\n  \n  double get_value(expression<math_visitor> e){\n    e.accept(this);\n    return get_value();\n  }\n  \n  void set_value(double v){\n    value = v;\n  }\n  \n  void visit_binary_operator_list (expression<math_visitor> e){\n    double lhs = get_value(e[0]);\n    \n    for(auto i:range(e.size()-1)+1){\n      double rhs = get_value(e[i]);\n      if(e.intermediate(i)==\"+\"){ lhs = lhs + rhs; }\n      if(e.intermediate(i)==\"-\"){ lhs = lhs - rhs; }\n      if(e.intermediate(i)==\"*\"){ lhs = lhs * rhs; }\n      if(e.intermediate(i)==\"\/\"){ lhs = lhs \/ rhs; }\n    }\n    \n    value = lhs;\n  }\n\n};\n\nint main(int argc, char ** argv){\n  parsing_expression_grammar_builder<math_visitor> g;\n  using expression = expression<math_visitor>;\n  \n  g[\"Expression\"] << \"Sum\"                       << [](expression e){ e[0].accept(); };\n  g[\"Sum\"       ] << \"Product ([+-] Product)*\"   << [](expression e){ e.visitor().visit_binary_operator_list(e); };\n  g[\"Product\"   ] << \"Atomic  ([*\/] Atomic )*\"   << [](expression e){ e.visitor().visit_binary_operator_list(e); };\n  g[\"Atomic\"    ] << \"Number | Brackets\"         << [](expression e){ e[0].accept(); };\n  g[\"Brackets\"  ] << \"'(' Sum ')'\"               << [](expression e){ e[0].accept(); };\n  g[\"Number\"    ] << \"'-'? [0-9]+ ('.' [0-9]+)?\" << [](expression e){ e.visitor().set_value(stod(e.string())); };\n  \n  g.set_starting_rule(\"Expression\");\n  auto p = g.get_parser();\n  \n  while (true) {\n    string str;\n    cout << \"> \";\n    cin >> str;\n    if(str == \"q\" || str == \"quit\")break;\n    cout << \" -> \";\n    try { cout << p.parse(str).evaluate()->get_value(); }\n    catch (const char * error){ std::cout << error; }\n    cout << std::endl;\n  }\n\n  return 0;\n}\n\n<commit_msg>clarified binary operator associativity<commit_after>\n\n#include <iostream>\n#include \"parser\/packrat_parser.h\"\n\nusing namespace std;\nusing namespace lars;\n\nclass math_visitor{\n  \n  double value;\n  \npublic:\n  \n  double get_value(){\n    return value;\n  }\n  \n  double get_value(expression<math_visitor> e){\n    e.accept(this);\n    return get_value();\n  }\n  \n  void set_value(double v){\n    value = v;\n  }\n  \n  void visit_left_binary_operator_list (expression<math_visitor> e){\n    double lhs = get_value(e[0]);\n    \n    for(auto i:range(e.size()-1)+1){\n      double rhs = get_value(e[i]);\n      if(e.intermediate(i)==\"+\"){ lhs = lhs + rhs; }\n      if(e.intermediate(i)==\"-\"){ lhs = lhs - rhs; }\n      if(e.intermediate(i)==\"*\"){ lhs = lhs * rhs; }\n      if(e.intermediate(i)==\"\/\"){ lhs = lhs \/ rhs; }\n    }\n    \n    value = lhs;\n  }\n\n};\n\nint main(int argc, char ** argv){\n  parsing_expression_grammar_builder<math_visitor> g;\n  using expression = expression<math_visitor>;\n  \n  g[\"Expression\"] << \"Sum\"                       << [](expression e){ e[0].accept(); };\n  g[\"Sum\"       ] << \"Product ([+-] Product)*\"   << [](expression e){ e.visitor().visit_left_binary_operator_list(e); };\n  g[\"Product\"   ] << \"Atomic  ([*\/] Atomic )*\"   << [](expression e){ e.visitor().visit_left_binary_operator_list(e); };\n  g[\"Atomic\"    ] << \"Number | Brackets\"         << [](expression e){ e[0].accept(); };\n  g[\"Brackets\"  ] << \"'(' Sum ')'\"               << [](expression e){ e[0].accept(); };\n  g[\"Number\"    ] << \"'-'? [0-9]+ ('.' [0-9]+)?\" << [](expression e){ e.visitor().set_value(stod(e.string())); };\n  \n  g.set_starting_rule(\"Expression\");\n  auto p = g.get_parser();\n  \n  while (true) {\n    string str;\n    cout << \"> \";\n    cin >> str;\n    if(str == \"q\" || str == \"quit\")break;\n    cout << \" -> \";\n    try { cout << p.parse(str).evaluate()->get_value(); }\n    catch (const char * error){ std::cout << error; }\n    cout << std::endl;\n  }\n\n  return 0;\n}\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\/\/ Homepage: http:\/\/primesieve.googlecode.com\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions\n\/\/ are met:\n\/\/\n\/\/   * Redistributions of source code must retain the above copyright\n\/\/     notice, this list of conditions and the following disclaimer.\n\/\/   * Redistributions in binary form must reproduce the above\n\/\/     copyright notice, this list of conditions and the following\n\/\/     disclaimer in the documentation and\/or other materials provided\n\/\/     with the distribution.\n\/\/   * Neither the name of the author nor the names of its\n\/\/     contributors may be used to endorse or promote products derived\n\/\/     from this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n\/\/ FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n\/\/ COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n\/\/ INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n\/\/ (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\/\/ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n\/\/ HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n\/\/ STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n\/\/ OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include \"EratBig.h\"\n#include \"SieveOfEratosthenes.h\"\n#include \"WheelFactorization.h\"\n#include \"defs.h\"\n#include \"bithacks.h\"\n\n#include <stdexcept>\n#include <cstdlib>\n#include <cstring>\n#include <list>\n\nEratBig::EratBig(const SieveOfEratosthenes& soe) :\n  Modulo210Wheel_t(soe),\n  lists_(NULL),\n  stock_(NULL),\n  log2SieveSize_(floorLog2(soe.getSieveSize())),\n  moduloSieveSize_(soe.getSieveSize() - 1)\n{\n  \/\/ EratBig uses bitwise operations that require a power of 2 sieve size\n  if (!isPowerOf2(soe.getSieveSize()))\n    throw std::invalid_argument(\n        \"EratBig: sieveSize must be a power of 2 (2^n).\");\n  this->setSize(soe);\n  this->initBucketLists();\n}\n\nEratBig::~EratBig() {\n  delete[] lists_;\n  for (std::list<Bucket*>::iterator it = pointers_.begin();\n      it != pointers_.end(); ++it)\n    delete[] *it;\n}\n\n\/**  \n * Set the size of the lists_ array.\n * @remark The size is a power of 2 value which allows use of fast\n *         bitwise operators in sieve(uint8_t*).\n *\/\nvoid EratBig::setSize(const SieveOfEratosthenes& soe) {\n  \/\/ MAX values in sieve(uint8_t*)\n  uint32_t maxSievingPrime   = soe.getSquareRoot() \/ SieveOfEratosthenes::NUMBERS_PER_BYTE;\n  uint32_t maxWheelFactor    = wheel(1)->nextMultipleFactor;\n  uint32_t maxMultipleOffset = maxSievingPrime * maxWheelFactor + maxWheelFactor;\n  uint32_t maxMultipleIndex  = (soe.getSieveSize() - 1) + maxMultipleOffset;\n  uint32_t maxSegmentCount   = maxMultipleIndex \/ soe.getSieveSize();\n  \/\/ 'maxSegmentCount + 1' is the smallest possible\n  \/\/ size for the lists_ array\n  size_ = nextHighestPowerOf2(maxSegmentCount + 1);\n  moduloListsSize_ = size_ - 1;\n}\n\n\/**\n * Allocate the lists_ array and initialize each list\n * with an empty bucket.\n *\/\nvoid EratBig::initBucketLists() {\n  lists_ = new Bucket*[size_];\n  for (uint32_t i = 0; i < size_; i++) {\n    lists_[i] = NULL;\n    this->pushBucket(i);\n  }\n}\n\n\/**\n * Add a prime number <= sqrt(n) for sieving to EratBig.\n *\/\nvoid EratBig::addSievingPrime(uint32_t prime) {\n  uint32_t multipleIndex;\n  uint32_t wheelIndex;\n  if (this->getWheelPrimeData(&prime, &multipleIndex, &wheelIndex) == true) {\n    \/\/ indicates in how many segments the next multiple\n    \/\/ of prime needs to be crossed-off\n    uint32_t segmentCount = multipleIndex >> log2SieveSize_;\n    \/\/ index for the SieveOfEratosthenes::sieve_ array\n    multipleIndex &= moduloSieveSize_;\n    \/\/ calculate the list index related to the next multiple of prime\n    uint32_t next = segmentCount & moduloListsSize_;\n    \/\/ add prime to the bucket list related to\n    \/\/ its next multiple occurrence\n    if (!lists_[next]->addWheelPrime(prime, multipleIndex, wheelIndex))\n      this->pushBucket(next);\n  }\n}\n\n\/**\n * Add an empty bucket from the bucket stock_ to the\n * front of lists_[index], if the bucket stock_ is\n * empty new buckets are allocated first.\n *\/\nvoid EratBig::pushBucket(uint32_t index) {\n  if (stock_ == NULL) {\n    Bucket* more = new Bucket[BUCKETS_PER_ALLOC];\n    stock_ = &more[0];\n    pointers_.push_back(more);\n    for(int i = 0; i < BUCKETS_PER_ALLOC - 1; i++)\n      more[i].setNext(&more[i + 1]);\n    more[BUCKETS_PER_ALLOC - 1].setNext(NULL);\n  }\n  Bucket* bucket = stock_;\n  stock_ = stock_->next();\n  bucket->setNext(lists_[index]);\n  lists_[index] = bucket;\n}\n\n\/**\n * Implementation of Tomas Oliveira e Silva's cache-friendly segmented\n * sieve of Eratosthenes algorithm, see:\n * http:\/\/www.ieeta.pt\/~tos\/software\/prime_sieve.html\n * My implementation uses a sieve array with 30 numbers per byte,\n * 8 bytes per sieving prime and a modulo 210 wheel that skips\n * multiples of 2, 3, 5 and 7.\n *\n * Removes the multiples of big sieving primes (i.e. with very few\n * multiple occurrences per segment) from the sieve array.\n * @see SieveOfEratosthenes::crossOffMultiples()\n *\/\nvoid EratBig::sieve(uint8_t* sieve)\n{\n  \/\/ lists_[0] contains the list of buckets related to the current\n  \/\/ segment i.e. its buckets contain all the sieving primes that have\n  \/\/ multiple occurrence(s) in the current segment\n  while (!lists_[0]->isEmpty() || lists_[0]->hasNext()) {\n    Bucket* bucket = lists_[0];\n    lists_[0] = NULL;\n    this->pushBucket(0);\n\n    \/\/ each loop iteration processes a bucket i.e. removes\n    \/\/ the next multiple of its sieving primes\n    do {\n      const WheelPrime* wPrime = bucket->begin();\n      const WheelPrime* end    = bucket->end();\n\n      \/\/ iterate over the sieving primes within the current bucket\n      \/\/ loop unrolled 2 times, optimized for x64 CPUs\n      for (; wPrime + 2 <= end; wPrime += 2) {\n        uint32_t multipleIndex0 = wPrime[0].getMultipleIndex();\n        uint32_t wheelIndex0    = wPrime[0].getWheelIndex();\n        uint32_t sievingPrime0  = wPrime[0].getSievingPrime();\n        uint32_t multipleIndex1 = wPrime[1].getMultipleIndex();\n        uint32_t wheelIndex1    = wPrime[1].getWheelIndex();\n        uint32_t sievingPrime1  = wPrime[1].getSievingPrime();\n\n        \/\/ cross-off the next multiple (unset corresponding bit) of the\n        \/\/ current sieving primes within the sieve array\n        sieve[multipleIndex0] &= wheel(wheelIndex0)->unsetBit;\n        multipleIndex0        += wheel(wheelIndex0)->nextMultipleFactor * sievingPrime0;\n        multipleIndex0        += wheel(wheelIndex0)->correct;\n        wheelIndex0           += wheel(wheelIndex0)->next;\n        sieve[multipleIndex1] &= wheel(wheelIndex1)->unsetBit;\n        multipleIndex1        += wheel(wheelIndex1)->nextMultipleFactor * sievingPrime1;\n        multipleIndex1        += wheel(wheelIndex1)->correct;\n        wheelIndex1           += wheel(wheelIndex1)->next;\n\n        uint32_t next0 = (multipleIndex0 >> log2SieveSize_) & moduloListsSize_;\n        multipleIndex0 &= moduloSieveSize_;\n        uint32_t next1 = (multipleIndex1 >> log2SieveSize_) & moduloListsSize_;\n        multipleIndex1 &= moduloSieveSize_;\n\n        \/\/ move the current sieving primes to the bucket list\n        \/\/ related to their next multiple occurrence\n        if (!lists_[next0]->addWheelPrime(sievingPrime0, multipleIndex0, wheelIndex0))\n          this->pushBucket(next0);\n        if (!lists_[next1]->addWheelPrime(sievingPrime1, multipleIndex1, wheelIndex1))\n          this->pushBucket(next1);\n      }\n\n      \/\/ process the remaining sieving primes\n      for (; wPrime < end; wPrime++) {\n        uint32_t multipleIndex = wPrime->getMultipleIndex();\n        uint32_t wheelIndex    = wPrime->getWheelIndex();\n        uint32_t sievingPrime  = wPrime->getSievingPrime();\n        sieve[multipleIndex] &= wheel(wheelIndex)->unsetBit;\n        multipleIndex        += wheel(wheelIndex)->nextMultipleFactor * sievingPrime;\n        multipleIndex        += wheel(wheelIndex)->correct;\n        wheelIndex           += wheel(wheelIndex)->next;\n        uint32_t next = (multipleIndex >> log2SieveSize_) & moduloListsSize_;\n        multipleIndex &= moduloSieveSize_;\n        if (!lists_[next]->addWheelPrime(sievingPrime, multipleIndex, wheelIndex))\n          this->pushBucket(next);\n      }\n\n      \/\/ reset the processed bucket and move it to the bucket stock_\n      Bucket* old = bucket;\n      bucket = bucket->next();\n      old->reset();\n      old->setNext(stock_);\n      stock_ = old;\n    }\n    while (bucket != NULL);\n  }\n\n  \/\/ lists_[0] has been processed, thus the list related to\n  \/\/ the next segment lists_[1] moves to lists_[0]\n  Bucket* tmp = lists_[0];\n  std::memmove(lists_, &lists_[1], (size_ - 1) * sizeof(Bucket*));\n  lists_[size_ - 1] = tmp;\n}\n<commit_msg>comments<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\/\/ Homepage: http:\/\/primesieve.googlecode.com\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions\n\/\/ are met:\n\/\/\n\/\/   * Redistributions of source code must retain the above copyright\n\/\/     notice, this list of conditions and the following disclaimer.\n\/\/   * Redistributions in binary form must reproduce the above\n\/\/     copyright notice, this list of conditions and the following\n\/\/     disclaimer in the documentation and\/or other materials provided\n\/\/     with the distribution.\n\/\/   * Neither the name of the author nor the names of its\n\/\/     contributors may be used to endorse or promote products derived\n\/\/     from this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n\/\/ FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n\/\/ COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n\/\/ INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n\/\/ (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\/\/ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n\/\/ HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n\/\/ STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n\/\/ OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include \"EratBig.h\"\n#include \"SieveOfEratosthenes.h\"\n#include \"WheelFactorization.h\"\n#include \"defs.h\"\n#include \"bithacks.h\"\n\n#include <stdexcept>\n#include <cstdlib>\n#include <cstring>\n#include <list>\n\nEratBig::EratBig(const SieveOfEratosthenes& soe) :\n  Modulo210Wheel_t(soe),\n  lists_(NULL),\n  stock_(NULL),\n  log2SieveSize_(floorLog2(soe.getSieveSize())),\n  moduloSieveSize_(soe.getSieveSize() - 1)\n{\n  \/\/ EratBig uses bitwise operations that require a power of 2 sieve size\n  if (!isPowerOf2(soe.getSieveSize()))\n    throw std::invalid_argument(\n        \"EratBig: sieveSize must be a power of 2 (2^n).\");\n  this->setSize(soe);\n  this->initBucketLists();\n}\n\nEratBig::~EratBig() {\n  delete[] lists_;\n  for (std::list<Bucket*>::iterator it = pointers_.begin();\n      it != pointers_.end(); ++it)\n    delete[] *it;\n}\n\n\/**  \n * Set the size of the lists_ array.\n * @remark The size is a power of 2 value which allows use of fast\n *         bitwise operators in sieve(uint8_t*).\n *\/\nvoid EratBig::setSize(const SieveOfEratosthenes& soe) {\n  \/\/ MAX values in sieve(uint8_t*)\n  uint32_t maxSievingPrime   = soe.getSquareRoot() \/ SieveOfEratosthenes::NUMBERS_PER_BYTE;\n  uint32_t maxWheelFactor    = wheel(1)->nextMultipleFactor;\n  uint32_t maxMultipleOffset = maxSievingPrime * maxWheelFactor + maxWheelFactor;\n  uint32_t maxMultipleIndex  = (soe.getSieveSize() - 1) + maxMultipleOffset;\n  uint32_t maxSegmentCount   = maxMultipleIndex \/ soe.getSieveSize();\n  \/\/ 'maxSegmentCount + 1' is the smallest possible\n  \/\/ size for the lists_ array\n  size_ = nextHighestPowerOf2(maxSegmentCount + 1);\n  moduloListsSize_ = size_ - 1;\n}\n\n\/**\n * Allocate the lists_ array and initialize each list\n * with an empty bucket.\n *\/\nvoid EratBig::initBucketLists() {\n  lists_ = new Bucket*[size_];\n  for (uint32_t i = 0; i < size_; i++) {\n    lists_[i] = NULL;\n    this->pushBucket(i);\n  }\n}\n\n\/**\n * Add a prime number <= sqrt(n) for sieving to EratBig.\n *\/\nvoid EratBig::addSievingPrime(uint32_t prime) {\n  uint32_t multipleIndex;\n  uint32_t wheelIndex;\n  if (this->getWheelPrimeData(&prime, &multipleIndex, &wheelIndex) == true) {\n    \/\/ indicates in how many segments the next multiple\n    \/\/ of prime needs to be crossed-off\n    uint32_t segmentCount = multipleIndex >> log2SieveSize_;\n    \/\/ index for the SieveOfEratosthenes::sieve_ array\n    multipleIndex &= moduloSieveSize_;\n    \/\/ calculate the list index related to the next multiple of prime\n    uint32_t next = segmentCount & moduloListsSize_;\n    \/\/ add prime to the bucket list related to\n    \/\/ its next multiple occurrence\n    if (!lists_[next]->addWheelPrime(prime, multipleIndex, wheelIndex))\n      this->pushBucket(next);\n  }\n}\n\n\/**\n * Add an empty bucket from the bucket stock_ to the\n * front of lists_[index], if the bucket stock_ is\n * empty new buckets are allocated first.\n *\/\nvoid EratBig::pushBucket(uint32_t index) {\n  if (stock_ == NULL) {\n    Bucket* more = new Bucket[BUCKETS_PER_ALLOC];\n    stock_ = &more[0];\n    pointers_.push_back(more);\n    for(int i = 0; i < BUCKETS_PER_ALLOC - 1; i++)\n      more[i].setNext(&more[i + 1]);\n    more[BUCKETS_PER_ALLOC - 1].setNext(NULL);\n  }\n  Bucket* bucket = stock_;\n  stock_ = stock_->next();\n  bucket->setNext(lists_[index]);\n  lists_[index] = bucket;\n}\n\n\/**\n * Implementation of Tomas Oliveira e Silva's cache-friendly segmented\n * sieve of Eratosthenes algorithm, see:\n * http:\/\/www.ieeta.pt\/~tos\/software\/prime_sieve.html\n * My implementation uses a sieve array with 30 numbers per byte,\n * 8 bytes per sieving prime and a modulo 210 wheel that skips\n * multiples of 2, 3, 5 and 7.\n *\n * Removes the multiples of big sieving primes (i.e. with very few\n * multiple occurrences per segment) from the sieve array.\n * @see SieveOfEratosthenes::crossOffMultiples()\n *\/\nvoid EratBig::sieve(uint8_t* sieve)\n{\n  \/\/ lists_[0] contains the list of buckets related to the current\n  \/\/ segment i.e. its buckets contain all the sieving primes that have\n  \/\/ multiple occurrence(s) in the current segment\n  while (!lists_[0]->isEmpty() || lists_[0]->hasNext()) {\n    Bucket* bucket = lists_[0];\n    lists_[0] = NULL;\n    this->pushBucket(0);\n\n    \/\/ each loop iteration processes a bucket i.e. removes\n    \/\/ the next multiple of its sieving primes\n    do {\n      const WheelPrime* wPrime = bucket->begin();\n      const WheelPrime* end    = bucket->end();\n\n      \/\/ Optimized for out-of-order CPUs\n      \/\/ The wheel(wheelIndex)->... lookup table is the algorithm's main\n      \/\/ bottleneck, the memory access time is improved by processing 2\n      \/\/ sieving primes per loop iteration\n      for (; wPrime + 2 <= end; wPrime += 2) {\n        uint32_t multipleIndex0 = wPrime[0].getMultipleIndex();\n        uint32_t wheelIndex0    = wPrime[0].getWheelIndex();\n        uint32_t sievingPrime0  = wPrime[0].getSievingPrime();\n        uint32_t multipleIndex1 = wPrime[1].getMultipleIndex();\n        uint32_t wheelIndex1    = wPrime[1].getWheelIndex();\n        uint32_t sievingPrime1  = wPrime[1].getSievingPrime();\n        \/\/ cross-off the next multiple (unset corresponding bit) of the\n        \/\/ current sieving primes within the sieve array\n        sieve[multipleIndex0] &= wheel(wheelIndex0)->unsetBit;\n        multipleIndex0        += wheel(wheelIndex0)->nextMultipleFactor * sievingPrime0;\n        multipleIndex0        += wheel(wheelIndex0)->correct;\n        wheelIndex0           += wheel(wheelIndex0)->next;\n        sieve[multipleIndex1] &= wheel(wheelIndex1)->unsetBit;\n        multipleIndex1        += wheel(wheelIndex1)->nextMultipleFactor * sievingPrime1;\n        multipleIndex1        += wheel(wheelIndex1)->correct;\n        wheelIndex1           += wheel(wheelIndex1)->next;\n        uint32_t next0 = (multipleIndex0 >> log2SieveSize_) & moduloListsSize_;\n        multipleIndex0 &= moduloSieveSize_;\n        uint32_t next1 = (multipleIndex1 >> log2SieveSize_) & moduloListsSize_;\n        multipleIndex1 &= moduloSieveSize_;\n        \/\/ move the current sieving primes to the bucket list\n        \/\/ related to their next multiple occurrence\n        if (!lists_[next0]->addWheelPrime(sievingPrime0, multipleIndex0, wheelIndex0))\n          this->pushBucket(next0);\n        if (!lists_[next1]->addWheelPrime(sievingPrime1, multipleIndex1, wheelIndex1))\n          this->pushBucket(next1);\n      }\n\n      \/\/ process the remaining sieving prime\n      if (wPrime != end) {\n        uint32_t multipleIndex = wPrime->getMultipleIndex();\n        uint32_t wheelIndex    = wPrime->getWheelIndex();\n        uint32_t sievingPrime  = wPrime->getSievingPrime();\n        sieve[multipleIndex] &= wheel(wheelIndex)->unsetBit;\n        multipleIndex        += wheel(wheelIndex)->nextMultipleFactor * sievingPrime;\n        multipleIndex        += wheel(wheelIndex)->correct;\n        wheelIndex           += wheel(wheelIndex)->next;\n        uint32_t next = (multipleIndex >> log2SieveSize_) & moduloListsSize_;\n        multipleIndex &= moduloSieveSize_;\n        if (!lists_[next]->addWheelPrime(sievingPrime, multipleIndex, wheelIndex))\n          this->pushBucket(next);\n      }\n\n      \/\/ reset the processed bucket and move it to the bucket stock_\n      Bucket* old = bucket;\n      bucket = bucket->next();\n      old->reset();\n      old->setNext(stock_);\n      stock_ = old;\n    }\n    while (bucket != NULL);\n  }\n\n  \/\/ lists_[0] has been processed, thus the list related to\n  \/\/ the next segment lists_[1] moves to lists_[0]\n  Bucket* tmp = lists_[0];\n  std::memmove(lists_, &lists_[1], (size_ - 1) * sizeof(Bucket*));\n  lists_[size_ - 1] = tmp;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>coverity#735925 Explicit null dereferenced<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 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#ifndef IOX_BINDING_C_CPP2C_WAITSET_HPP\n#define IOX_BINDING_C_CPP2C_WAITSET_HPP\n\n#include \"iceoryx_posh\/popo\/wait_set.hpp\"\n\nclass cpp2c_WaitSet : public iox::popo::WaitSet<>\n{\n    using iox::popo::WaitSet<>::WaitSet;\n};\n\n#endif\n<commit_msg>iox-#341 added default ctor to hopefully fix windows compile error<commit_after>\/\/ Copyright (c) 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#ifndef IOX_BINDING_C_CPP2C_WAITSET_HPP\n#define IOX_BINDING_C_CPP2C_WAITSET_HPP\n\n#include \"iceoryx_posh\/popo\/wait_set.hpp\"\n\nclass cpp2c_WaitSet : public iox::popo::WaitSet<>\n{\n    using iox::popo::WaitSet<>::WaitSet;\n    ~cpp2c_WaitSet() = default;\n};\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"integrators\/embedded_explicit_runge_kutta_nyström_integrator.hpp\"\n\n#include <algorithm>\n#include <vector>\n\n#include \"base\/macros.hpp\"\n#include \"glog\/logging.h\"\n#include \"gmock\/gmock.h\"\n#include \"gtest\/gtest.h\"\n#include \"quantities\/si.hpp\"\n#include \"testing_utilities\/integration.hpp\"\n#include \"testing_utilities\/numerics.hpp\"\n\nnamespace principia {\n\nusing quantities::Abs;\nusing quantities::Length;\nusing si::Centi;\nusing si::Metre;\nusing si::Milli;\nusing si::Second;\nusing testing_utilities::AbsoluteError;\nusing ::std::placeholders::_1;\nusing ::std::placeholders::_2;\nusing ::std::placeholders::_3;\nusing ::testing::AllOf;\nusing ::testing::Ge;\nusing ::testing::Le;\n\nnamespace integrators {\n\nusing ODE = SpecialSecondOrderDifferentialEquation<Length>;\n\nnamespace {\n\n\/\/ TODO(egg): use the one from testing_utilities\/integration again when everyone\n\/\/ uses |Instant|s.\nvoid ComputeHarmonicOscillatorAcceleration(\n    Instant const& t,\n    std::vector<Length> const& q,\n    std::vector<Acceleration>* const result,\n    not_null<int*> evaluations) {\n  (*result)[0] = -q[0] * (SIUnit<Stiffness>() \/ SIUnit<Mass>());\n  ++*evaluations;\n}\n\ndouble HarmonicOscillatorToleranceRatio(\n    Time const& h,\n    ODE::SystemStateError const& error,\n    Length const& q_tolerance,\n    Speed const& v_tolerance,\n    std::function<void(bool tolerable)> callback) {\n  double const r = std::min(q_tolerance \/ Abs(error.position_error[0]),\n                            v_tolerance \/ Abs(error.velocity_error[0]));\n  callback(r > 1.0);\n  return r;\n}\n\n}  \/\/ namespace\n\nclass EmbeddedExplicitRungeKuttaNyströmIntegratorTest\n    : public ::testing::Test {};\n\nTEST_F(EmbeddedExplicitRungeKuttaNyströmIntegratorTest,\n       HarmonicOscillatorBackAndForth) {\n  AdaptiveSizeIntegrator<ODE> const& integrator =\n      DormandElMikkawyPrince1986RKN434FM<Length>();\n  Length const x_initial = 1 * Metre;\n  Speed const v_initial = 0 * Metre \/ Second;\n  Time const period = 2 * π * Second;\n  Instant const t_initial;\n  Instant const t_final = t_initial + 10 * period;\n  Length const length_tolerance = 1 * Milli(Metre);\n  Speed const speed_tolerance = 1 * Milli(Metre) \/ Second;\n  int const steps_forward = 132;\n  \/\/ We integrate backward with double the tolerance.\n  int const steps_backward = 112;\n\n  int evaluations = 0;\n  int initial_rejections = 0;\n  int subsequent_rejections = 0;\n  bool first_step = true;\n  auto const step_size_callback = [&initial_rejections, &subsequent_rejections,\n                                   &first_step](bool tolerable) {\n    if (!tolerable) {\n      if (first_step) {\n        ++initial_rejections;\n      } else {\n        ++subsequent_rejections;\n      }\n    } else if (first_step) {\n      first_step = false;\n    }\n  };\n\n  std::vector<ODE::SystemState> solution;\n  ODE harmonic_oscillator;\n  harmonic_oscillator.compute_acceleration =\n      std::bind(ComputeHarmonicOscillatorAcceleration,\n                _1, _2, _3, &evaluations);\n  IntegrationProblem<ODE> problem;\n  problem.equation = harmonic_oscillator;\n  ODE::SystemState const initial_state = {{x_initial}, {v_initial}, t_initial};\n  problem.initial_state = &initial_state;\n  problem.t_final = t_final;\n  problem.append_state = [&solution](ODE::SystemState const& state) {\n    solution.push_back(state);\n  };\n  AdaptiveStepSize<ODE> adaptive_step_size;\n  adaptive_step_size.first_time_step = t_final - t_initial;\n  adaptive_step_size.safety_factor = 0.9;\n  adaptive_step_size.tolerance_to_error_ratio =\n      std::bind(HarmonicOscillatorToleranceRatio,\n                _1, _2, length_tolerance, speed_tolerance, step_size_callback);\n\n  integrator.Solve(problem, adaptive_step_size);\n  EXPECT_THAT(AbsoluteError(x_initial, solution.back().positions[0].value),\n              AllOf(Ge(3E-4 * Metre), Le(4E-4 * Metre)));\n  EXPECT_THAT(AbsoluteError(v_initial, solution.back().velocities[0].value),\n              AllOf(Ge(2E-3 * Metre \/ Second), Le(3E-3 * Metre \/ Second)));\n  EXPECT_EQ(t_final, solution.back().time.value);\n  EXPECT_EQ(steps_forward, solution.size());\n  EXPECT_EQ(\n      (steps_forward + initial_rejections + subsequent_rejections) * 4,\n      evaluations);\n\n  evaluations = 0;\n  subsequent_rejections = 0;\n  initial_rejections = 0;\n  problem.initial_state = &solution.back();\n  problem.t_final = t_initial;\n  adaptive_step_size.first_time_step = t_initial - t_final;\n  adaptive_step_size.tolerance_to_error_ratio =\n      std::bind(HarmonicOscillatorToleranceRatio,\n                _1, _2, 2 * length_tolerance, 2 * speed_tolerance,\n                step_size_callback);\n\n  integrator.Solve(problem, adaptive_step_size);\n  EXPECT_THAT(AbsoluteError(x_initial, solution.back().positions[0].value),\n              AllOf(Ge(1E-3 * Metre), Le(2E-3 * Metre)));\n  EXPECT_THAT(AbsoluteError(v_initial, solution.back().velocities[0].value),\n              AllOf(Ge(2E-3 * Metre \/ Second), Le(3E-3 * Metre \/ Second)));\n  EXPECT_EQ(t_initial, solution.back().time.value);\n  EXPECT_EQ(steps_backward, solution.size() - steps_forward);\n  EXPECT_EQ(\n      (steps_backward + initial_rejections + subsequent_rejections) * 4,\n      evaluations);\n}\n\n}  \/\/ namespace integrators\n}  \/\/ namespace principia\n<commit_msg>...exactly as expected.<commit_after>\n#include \"integrators\/embedded_explicit_runge_kutta_nyström_integrator.hpp\"\n\n#include <algorithm>\n#include <vector>\n\n#include \"base\/macros.hpp\"\n#include \"glog\/logging.h\"\n#include \"gmock\/gmock.h\"\n#include \"gtest\/gtest.h\"\n#include \"quantities\/si.hpp\"\n#include \"testing_utilities\/integration.hpp\"\n#include \"testing_utilities\/numerics.hpp\"\n\nnamespace principia {\n\nusing quantities::Abs;\nusing quantities::Length;\nusing si::Centi;\nusing si::Metre;\nusing si::Milli;\nusing si::Second;\nusing testing_utilities::AbsoluteError;\nusing ::std::placeholders::_1;\nusing ::std::placeholders::_2;\nusing ::std::placeholders::_3;\nusing ::testing::AllOf;\nusing ::testing::Ge;\nusing ::testing::Le;\n\nnamespace integrators {\n\nusing ODE = SpecialSecondOrderDifferentialEquation<Length>;\n\nnamespace {\n\n\/\/ TODO(egg): use the one from testing_utilities\/integration again when everyone\n\/\/ uses |Instant|s.\nvoid ComputeHarmonicOscillatorAcceleration(\n    Instant const& t,\n    std::vector<Length> const& q,\n    std::vector<Acceleration>* const result,\n    not_null<int*> evaluations) {\n  (*result)[0] = -q[0] * (SIUnit<Stiffness>() \/ SIUnit<Mass>());\n  ++*evaluations;\n}\n\ndouble HarmonicOscillatorToleranceRatio(\n    Time const& h,\n    ODE::SystemStateError const& error,\n    Length const& q_tolerance,\n    Speed const& v_tolerance,\n    std::function<void(bool tolerable)> callback) {\n  double const r = std::min(q_tolerance \/ Abs(error.position_error[0]),\n                            v_tolerance \/ Abs(error.velocity_error[0]));\n  callback(r > 1.0);\n  return r;\n}\n\n}  \/\/ namespace\n\nclass EmbeddedExplicitRungeKuttaNyströmIntegratorTest\n    : public ::testing::Test {};\n\nTEST_F(EmbeddedExplicitRungeKuttaNyströmIntegratorTest,\n       HarmonicOscillatorBackAndForth) {\n  AdaptiveSizeIntegrator<ODE> const& integrator =\n      DormandElMikkawyPrince1986RKN434FM<Length>();\n  Length const x_initial = 1 * Metre;\n  Speed const v_initial = 0 * Metre \/ Second;\n  Time const period = 2 * π * Second;\n  Instant const t_initial;\n  Instant const t_final = t_initial + 10 * period;\n  Length const length_tolerance = 1 * Milli(Metre);\n  Speed const speed_tolerance = 1 * Milli(Metre) \/ Second;\n  int const steps_forward = 132;\n  \/\/ We integrate backward with double the tolerance.\n  int const steps_backward = 112;\n\n  int evaluations = 0;\n  int initial_rejections = 0;\n  int subsequent_rejections = 0;\n  bool first_step = true;\n  auto const step_size_callback = [&initial_rejections, &subsequent_rejections,\n                                   &first_step](bool tolerable) {\n    if (!tolerable) {\n      if (first_step) {\n        ++initial_rejections;\n      } else {\n        ++subsequent_rejections;\n      }\n    } else if (first_step) {\n      first_step = false;\n    }\n  };\n\n  std::vector<ODE::SystemState> solution;\n  ODE harmonic_oscillator;\n  harmonic_oscillator.compute_acceleration =\n      std::bind(ComputeHarmonicOscillatorAcceleration,\n                _1, _2, _3, &evaluations);\n  IntegrationProblem<ODE> problem;\n  problem.equation = harmonic_oscillator;\n  ODE::SystemState const initial_state = {{x_initial}, {v_initial}, t_initial};\n  problem.initial_state = &initial_state;\n  problem.t_final = t_final;\n  problem.append_state = [&solution](ODE::SystemState const& state) {\n    solution.push_back(state);\n  };\n  AdaptiveStepSize<ODE> adaptive_step_size;\n  adaptive_step_size.first_time_step = t_final - t_initial;\n  adaptive_step_size.safety_factor = 0.9;\n  adaptive_step_size.tolerance_to_error_ratio =\n      std::bind(HarmonicOscillatorToleranceRatio,\n                _1, _2, length_tolerance, speed_tolerance, step_size_callback);\n\n  integrator.Solve(problem, adaptive_step_size);\n  EXPECT_THAT(AbsoluteError(x_initial, solution.back().positions[0].value),\n              AllOf(Ge(3E-4 * Metre), Le(4E-4 * Metre)));\n  EXPECT_THAT(AbsoluteError(v_initial, solution.back().velocities[0].value),\n              AllOf(Ge(2E-3 * Metre \/ Second), Le(3E-3 * Metre \/ Second)));\n  EXPECT_EQ(t_final, solution.back().time.value);\n  EXPECT_EQ(steps_forward, solution.size());\n  EXPECT_EQ(\n      (1 + initial_rejections) * 4 +\n          (steps_forward - 1 + subsequent_rejections) * 3,\n      evaluations);\n\n  evaluations = 0;\n  subsequent_rejections = 0;\n  initial_rejections = 0;\n  first_step = true;\n  problem.initial_state = &solution.back();\n  problem.t_final = t_initial;\n  adaptive_step_size.first_time_step = t_initial - t_final;\n  adaptive_step_size.tolerance_to_error_ratio =\n      std::bind(HarmonicOscillatorToleranceRatio,\n                _1, _2, 2 * length_tolerance, 2 * speed_tolerance,\n                step_size_callback);\n\n  integrator.Solve(problem, adaptive_step_size);\n  EXPECT_THAT(AbsoluteError(x_initial, solution.back().positions[0].value),\n              AllOf(Ge(1E-3 * Metre), Le(2E-3 * Metre)));\n  EXPECT_THAT(AbsoluteError(v_initial, solution.back().velocities[0].value),\n              AllOf(Ge(2E-3 * Metre \/ Second), Le(3E-3 * Metre \/ Second)));\n  EXPECT_EQ(t_initial, solution.back().time.value);\n  EXPECT_EQ(steps_backward, solution.size() - steps_forward);\n  EXPECT_EQ(\n      (1 + initial_rejections) * 4 +\n          (steps_backward - 1 + subsequent_rejections) * 3,\n      evaluations);\n}\n\n}  \/\/ namespace integrators\n}  \/\/ namespace principia\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Objects in stock.  May be used for connection pooling.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"Stock.hxx\"\n#include \"Class.hxx\"\n#include \"Stats.hxx\"\n#include \"Item.hxx\"\n#include \"GetHandler.hxx\"\n#include \"async.hxx\"\n#include \"pool.hxx\"\n#include \"event\/TimerEvent.hxx\"\n#include \"event\/DeferEvent.hxx\"\n#include \"event\/Callback.hxx\"\n#include \"util\/Cast.hxx\"\n\n#include <daemon\/log.h>\n\n#include <glib.h>\n\n#include <assert.h>\n\nstruct Stock {\n    struct pool &pool;\n    const StockClass &cls;\n    void *const class_ctx;\n    const char *const uri;\n\n    \/**\n     * The maximum number of items in this stock.  If any more items\n     * are requested, they are put into the #waiting list, which gets\n     * checked as soon as stock_put() is called.\n     *\/\n    const unsigned limit;\n\n    \/**\n     * The maximum number of permanent idle items.  If there are more\n     * than that, a timer will incrementally kill excess items.\n     *\/\n    const unsigned max_idle;\n\n    StockHandler *const handler;\n\n    \/**\n     * This event is used to move the \"retry waiting\" code out of the\n     * current stack, to invoke the handler method in a safe\n     * environment.\n     *\/\n    DeferEvent retry_event;\n\n    \/**\n     * This event is used to move the \"empty\" check out of the current\n     * stack, to invoke the handler method in a safe environment.\n     *\/\n    DeferEvent empty_event;\n\n    TimerEvent cleanup_event;\n    TimerEvent clear_event;\n\n    typedef boost::intrusive::list<StockItem,\n                                   boost::intrusive::constant_time_size<true>> ItemList;\n\n    ItemList idle;\n\n    ItemList busy;\n\n    unsigned num_create = 0;\n\n    struct Waiting\n        : boost::intrusive::list_base_hook<boost::intrusive::link_mode<boost::intrusive::normal_link>> {\n\n        Stock &stock;\n\n        struct async_operation operation;\n\n        struct pool &pool;\n        void *const info;\n\n        StockGetHandler &handler;\n\n        struct async_operation_ref &async_ref;\n\n        Waiting(Stock &_stock, struct pool &_pool, void *_info,\n                StockGetHandler &_handler,\n                struct async_operation_ref &_async_ref)\n            :stock(_stock), pool(_pool), info(_info),\n             handler(_handler),\n             async_ref(_async_ref) {\n            operation.Init2<Waiting>();\n            pool_ref(&pool);\n            async_ref.Set(operation);\n        }\n\n        void Destroy() {\n            DeleteUnrefPool(pool, this);\n        }\n\n        void Abort();\n    };\n\n    typedef boost::intrusive::list<Waiting,\n                                   boost::intrusive::constant_time_size<false>> WaitingList;\n\n    WaitingList waiting;\n\n    bool may_clear = false;\n\n    Stock(struct pool &_pool, const StockClass &cls, void *class_ctx,\n          const char *uri, unsigned limit, unsigned max_idle,\n          StockHandler *handler);\n\n    ~Stock();\n\n    const char *GetUri() const {\n        return uri;\n    }\n\n    gcc_pure\n    bool IsEmpty() const {\n        return idle.empty() && busy.empty() && num_create == 0;\n    }\n\n    void AddStats(StockStats &data) const {\n        data.busy += busy.size();\n        data.idle += idle.size();\n    }\n\n    void FadeAll();\n\n    \/**\n     * Check if the stock has become empty, and invoke the handler.\n     *\/\n    void CheckEmpty();\n    void ScheduleCheckEmpty();\n\n    void DestroyItem(StockItem &item);\n\n    void ScheduleClear() {\n        static constexpr struct timeval tv = { .tv_sec = 60, .tv_usec = 0 };\n        clear_event.Add(tv);\n    }\n\n    void ClearIdle();\n\n    bool GetIdle(StockGetHandler &handler);\n    void GetCreate(struct pool &caller_pool, void *info,\n                   StockGetHandler &get_handler,\n                   struct async_operation_ref &async_ref);\n\n    void Get(struct pool &caller_pool, void *info,\n             StockGetHandler &get_handler,\n             struct async_operation_ref &async_ref);\n\n    StockItem *GetNow(struct pool &caller_pool, void *info, GError **error_r);\n\n    void Put(StockItem &item, bool destroy);\n\n    void ItemIdleDisconnect(StockItem &item);\n\n    void ItemCreateSuccess(StockItem &item);\n    void ItemCreateError(StockItem &item, GError *error);\n    void ItemCreateAborted(StockItem &item);\n\n    \/**\n     * Retry the waiting requests.  This is called after the number of\n     * busy items was reduced.\n     *\/\n    void RetryWaiting();\n    void ScheduleRetryWaiting();\n\n    void ScheduleCleanup() {\n        static constexpr struct timeval tv = { .tv_sec = 20, .tv_usec = 0 };\n        cleanup_event.Add(tv);\n    }\n\n    void UnscheduleCleanup() {\n        cleanup_event.Cancel();\n    }\n    void CleanupEventCallback();\n    void ClearEventCallback();\n};\n\nvoid\nStock::FadeAll()\n{\n    for (auto &i : busy)\n        i.fade = true;\n\n    ClearIdle();\n    ScheduleCheckEmpty();\n\n    \/\/ TODO: restart the \"num_create\" list?\n}\n\n\/*\n * The \"empty()\" handler method.\n *\n *\/\n\nvoid\nStock::CheckEmpty()\n{\n    if (IsEmpty() && handler != nullptr)\n        handler->OnStockEmpty(*this, uri);\n}\n\nvoid\nStock::ScheduleCheckEmpty()\n{\n    if (IsEmpty() && handler != nullptr)\n        empty_event.Add();\n}\n\n\n\/*\n * cleanup\n *\n *\/\n\nvoid\nStock::CleanupEventCallback()\n{\n    assert(idle.size() > max_idle);\n\n    \/* destroy one third of the idle items *\/\n\n    for (unsigned i = (idle.size() - max_idle + 2) \/ 3; i > 0; --i)\n        idle.pop_front_and_dispose([this](StockItem *item){\n                DestroyItem(*item);\n            });\n\n    \/* schedule next cleanup *\/\n\n    if (idle.size() > max_idle)\n        ScheduleCleanup();\n    else\n        CheckEmpty();\n}\n\n\n\/*\n * wait operation\n *\n *\/\n\ninline void\nStock::Waiting::Abort()\n{\n    auto &list = stock.waiting;\n    const auto i = list.iterator_to(*this);\n    list.erase_and_dispose(i, [](Stock::Waiting *w){ w->Destroy(); });\n}\n\nvoid\nStock::RetryWaiting()\n{\n    if (limit == 0)\n        \/* no limit configured, no waiters possible *\/\n        return;\n\n    \/* first try to serve existing idle items *\/\n\n    while (!idle.empty()) {\n        const auto i = waiting.begin();\n        if (i == waiting.end())\n            return;\n\n        auto &w = *i;\n\n        w.operation.Finished();\n        waiting.erase(i);\n\n        if (GetIdle(w.handler))\n            w.Destroy();\n        else\n            \/* didn't work (probably because borrowing the item has\n               failed) - re-add to \"waiting\" list *\/\n            waiting.push_front(w);\n    }\n\n    \/* if we're below the limit, create a bunch of new items *\/\n\n    for (unsigned i = limit - busy.size() - num_create;\n         busy.size() + num_create < limit && i > 0 && !waiting.empty();\n         --i) {\n        auto &w = waiting.front();\n        waiting.pop_front();\n\n        w.operation.Finished();\n        GetCreate(w.pool, w.info,\n                  w.handler,\n                  w.async_ref);\n        w.Destroy();\n    }\n}\n\nvoid\nStock::ScheduleRetryWaiting()\n{\n    if (limit > 0 && !waiting.empty() &&\n        busy.size() - num_create < limit)\n        retry_event.Add();\n}\n\n\n\/*\n * clear after 60 seconds idle\n *\n *\/\n\nvoid\nStock::ClearIdle()\n{\n    daemon_log(5, \"Stock::ClearIdle(%p, '%s') num_idle=%zu num_busy=%zu\\n\",\n               (const void *)this, uri,\n               idle.size(), busy.size());\n\n    if (idle.size() > max_idle)\n        UnscheduleCleanup();\n\n    idle.clear_and_dispose([this](StockItem *item){\n            DestroyItem(*item);\n        });\n}\n\nvoid\nStock::ClearEventCallback()\n{\n    daemon_log(6, \"stock_clear_event_callback(%p, '%s') may_clear=%d\\n\",\n               (const void *)this, uri, may_clear);\n\n    if (may_clear)\n        ClearIdle();\n\n    may_clear = true;\n    ScheduleClear();\n    CheckEmpty();\n}\n\n\n\/*\n * constructor\n *\n *\/\n\ninline Stock::Stock(struct pool &_pool,\n                    const StockClass &_cls, void *_class_ctx,\n                    const char *_uri, unsigned _limit, unsigned _max_idle,\n                    StockHandler *_handler)\n    :pool(_pool), cls(_cls), class_ctx(_class_ctx),\n     uri(p_strdup_checked(&pool, _uri)),\n     limit(_limit), max_idle(_max_idle),\n     handler(_handler),\n     retry_event(MakeSimpleEventCallback(Stock, RetryWaiting), this),\n     empty_event(MakeSimpleEventCallback(Stock, CheckEmpty), this),\n     cleanup_event(MakeSimpleEventCallback(Stock, CleanupEventCallback), this),\n     clear_event(MakeSimpleEventCallback(Stock, ClearEventCallback), this)\n{\n    ScheduleClear();\n}\n\ninline Stock::~Stock()\n{\n    assert(num_create == 0);\n\n    \/* must not call stock_free() when there are busy items left *\/\n    assert(busy.empty());\n\n    retry_event.Deinit();\n    empty_event.Deinit();\n    cleanup_event.Deinit();\n    clear_event.Deinit();\n\n    ClearIdle();\n\n    pool_unref(&pool);\n}\n\nStock *\nstock_new(struct pool &_pool, const StockClass &cls, void *class_ctx,\n          const char *uri, unsigned limit, unsigned max_idle,\n          StockHandler *handler)\n{\n    assert(cls.pool != nullptr);\n    assert(cls.create != nullptr);\n    assert(max_idle > 0);\n\n    struct pool *pool = pool_new_libc(&_pool, \"stock\");\n\n    return new Stock(*pool, cls, class_ctx,\n                     uri, limit, max_idle,\n                     handler);\n}\n\nvoid\nStock::DestroyItem(StockItem &item)\n{\n    item.Destroy(class_ctx);\n}\n\nvoid\nstock_free(Stock *stock)\n{\n    assert(stock != nullptr);\n\n    delete stock;\n}\n\nconst char *\nstock_get_uri(Stock &stock)\n{\n    return stock.GetUri();\n}\n\nbool\nstock_is_empty(const Stock &stock)\n{\n    return stock.IsEmpty();\n}\n\nvoid\nstock_add_stats(const Stock &stock, StockStats &data)\n{\n    stock.AddStats(data);\n}\n\nvoid\nstock_fade_all(Stock &stock)\n{\n    stock.FadeAll();\n}\n\nbool\nStock::GetIdle(StockGetHandler &get_handler)\n{\n    auto i = idle.begin();\n    const auto end = idle.end();\n    while (i != end) {\n        StockItem &item = *i;\n        assert(item.is_idle);\n\n        i = idle.erase(i);\n\n        if (idle.size() == max_idle)\n            UnscheduleCleanup();\n\n        if (item.Borrow(class_ctx)) {\n#ifndef NDEBUG\n            item.is_idle = false;\n#endif\n\n            busy.push_front(item);\n\n            get_handler.OnStockItemReady(item);\n            return true;\n        }\n\n        DestroyItem(item);\n    }\n\n    ScheduleCheckEmpty();\n    return false;\n}\n\nvoid\nStock::GetCreate(struct pool &caller_pool, void *info,\n                 StockGetHandler &get_handler,\n                 struct async_operation_ref &async_ref)\n{\n    struct pool *item_pool = cls.pool(class_ctx, pool, uri);\n\n    ++num_create;\n\n    cls.create(class_ctx, {*this, *item_pool, get_handler},\n               uri, info, caller_pool, async_ref);\n}\n\nvoid\nStock::Get(struct pool &caller_pool, void *info,\n           StockGetHandler &get_handler,\n           struct async_operation_ref &async_ref)\n{\n    may_clear = false;\n\n    if (GetIdle(get_handler))\n        return;\n\n    if (limit > 0 && busy.size() + num_create >= limit) {\n        \/* item limit reached: wait for an item to return *\/\n        auto w = NewFromPool<Stock::Waiting>(caller_pool, *this,\n                                             caller_pool, info,\n                                             get_handler, async_ref);\n        waiting.push_front(*w);\n        return;\n    }\n\n    GetCreate(caller_pool, info, get_handler, async_ref);\n}\n\nvoid\nstock_get(Stock &stock, struct pool &caller_pool, void *info,\n          StockGetHandler &handler,\n          struct async_operation_ref &async_ref)\n{\n    stock.Get(caller_pool, info, handler, async_ref);\n}\n\nStockItem *\nStock::GetNow(struct pool &caller_pool, void *info, GError **error_r)\n{\n    struct NowRequest final : public StockGetHandler {\n#ifndef NDEBUG\n        bool created = false;\n#endif\n        StockItem *item;\n        GError *error;\n\n        \/* virtual methods from class StockGetHandler *\/\n        void OnStockItemReady(StockItem &_item) override {\n#ifndef NDEBUG\n            created = true;\n#endif\n\n            item = &_item;\n        }\n\n        void OnStockItemError(GError *_error) override {\n#ifndef NDEBUG\n            created = true;\n#endif\n\n            item = nullptr;\n            error = _error;\n        }\n    };\n\n    NowRequest data;\n    struct async_operation_ref async_ref;\n\n    \/* cannot call this on a limited stock *\/\n    assert(limit == 0);\n\n    Get(caller_pool, info, data, async_ref);\n    assert(data.created);\n\n    if (data.item == nullptr)\n        g_propagate_error(error_r, data.error);\n\n    return data.item;\n}\n\nStockItem *\nstock_get_now(Stock &stock, struct pool &pool, void *info,\n              GError **error_r)\n{\n    return stock.GetNow(pool, info, error_r);\n}\n\nvoid\nStock::ItemCreateSuccess(StockItem &item)\n{\n    assert(num_create > 0);\n    --num_create;\n\n    busy.push_front(item);\n\n    item.handler.OnStockItemReady(item);\n}\n\nvoid\nstock_item_available(StockItem &item)\n{\n    item.stock.ItemCreateSuccess(item);\n}\n\nvoid\nStock::ItemCreateError(StockItem &item, GError *error)\n{\n    assert(error != nullptr);\n    assert(num_create > 0);\n    --num_create;\n\n    item.handler.OnStockItemError(error);\n    item.Destroy(class_ctx);\n\n    ScheduleCheckEmpty();\n    ScheduleRetryWaiting();\n}\n\nvoid\nstock_item_failed(StockItem &item, GError *error)\n{\n    item.stock.ItemCreateError(item, error);\n}\n\nvoid\nStock::ItemCreateAborted(StockItem &item)\n{\n    assert(num_create > 0);\n    --num_create;\n\n    item.Destroy(class_ctx);\n\n    ScheduleCheckEmpty();\n    ScheduleRetryWaiting();\n}\n\nvoid\nstock_item_aborted(StockItem &item)\n{\n    item.stock.ItemCreateAborted(item);\n}\n\nvoid\nStock::Put(StockItem &item, bool destroy)\n{\n    assert(!item.is_idle);\n\n    may_clear = false;\n\n    assert(!busy.empty());\n\n    busy.erase(busy.iterator_to(item));\n\n    if (destroy || item.fade || !item.Release(class_ctx)) {\n        DestroyItem(item);\n        ScheduleCheckEmpty();\n    } else {\n#ifndef NDEBUG\n        item.is_idle = true;\n#endif\n\n        if (idle.size() == max_idle)\n            ScheduleCleanup();\n\n        idle.push_front(item);\n    }\n\n    ScheduleRetryWaiting();\n}\n\nvoid\nstock_put(StockItem &item, bool destroy)\n{\n    item.stock.Put(item, destroy);\n}\n\nvoid\nStock::ItemIdleDisconnect(StockItem &item)\n{\n    assert(item.is_idle);\n\n    assert(!idle.empty());\n\n    idle.erase(idle.iterator_to(item));\n\n    if (idle.size() == max_idle)\n        UnscheduleCleanup();\n\n    DestroyItem(item);\n    ScheduleCheckEmpty();\n}\n\nvoid\nstock_del(StockItem &item)\n{\n    item.stock.ItemIdleDisconnect(item);\n}\n<commit_msg>Stock: convert struct to class<commit_after>\/*\n * Objects in stock.  May be used for connection pooling.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"Stock.hxx\"\n#include \"Class.hxx\"\n#include \"Stats.hxx\"\n#include \"Item.hxx\"\n#include \"GetHandler.hxx\"\n#include \"async.hxx\"\n#include \"pool.hxx\"\n#include \"event\/TimerEvent.hxx\"\n#include \"event\/DeferEvent.hxx\"\n#include \"event\/Callback.hxx\"\n#include \"util\/Cast.hxx\"\n\n#include <daemon\/log.h>\n\n#include <glib.h>\n\n#include <assert.h>\n\nclass Stock {\n    struct pool &pool;\n    const StockClass &cls;\n    void *const class_ctx;\n    const char *const uri;\n\n    \/**\n     * The maximum number of items in this stock.  If any more items\n     * are requested, they are put into the #waiting list, which gets\n     * checked as soon as stock_put() is called.\n     *\/\n    const unsigned limit;\n\n    \/**\n     * The maximum number of permanent idle items.  If there are more\n     * than that, a timer will incrementally kill excess items.\n     *\/\n    const unsigned max_idle;\n\n    StockHandler *const handler;\n\n    \/**\n     * This event is used to move the \"retry waiting\" code out of the\n     * current stack, to invoke the handler method in a safe\n     * environment.\n     *\/\n    DeferEvent retry_event;\n\n    \/**\n     * This event is used to move the \"empty\" check out of the current\n     * stack, to invoke the handler method in a safe environment.\n     *\/\n    DeferEvent empty_event;\n\n    TimerEvent cleanup_event;\n    TimerEvent clear_event;\n\n    typedef boost::intrusive::list<StockItem,\n                                   boost::intrusive::constant_time_size<true>> ItemList;\n\n    ItemList idle;\n\n    ItemList busy;\n\n    unsigned num_create = 0;\n\n    struct Waiting\n        : boost::intrusive::list_base_hook<boost::intrusive::link_mode<boost::intrusive::normal_link>> {\n\n        Stock &stock;\n\n        struct async_operation operation;\n\n        struct pool &pool;\n        void *const info;\n\n        StockGetHandler &handler;\n\n        struct async_operation_ref &async_ref;\n\n        Waiting(Stock &_stock, struct pool &_pool, void *_info,\n                StockGetHandler &_handler,\n                struct async_operation_ref &_async_ref)\n            :stock(_stock), pool(_pool), info(_info),\n             handler(_handler),\n             async_ref(_async_ref) {\n            operation.Init2<Waiting>();\n            pool_ref(&pool);\n            async_ref.Set(operation);\n        }\n\n        void Destroy() {\n            DeleteUnrefPool(pool, this);\n        }\n\n        void Abort();\n    };\n\n    typedef boost::intrusive::list<Waiting,\n                                   boost::intrusive::constant_time_size<false>> WaitingList;\n\n    WaitingList waiting;\n\n    bool may_clear = false;\n\npublic:\n    Stock(struct pool &_pool, const StockClass &cls, void *class_ctx,\n          const char *uri, unsigned limit, unsigned max_idle,\n          StockHandler *handler);\n\n    ~Stock();\n\n    const char *GetUri() const {\n        return uri;\n    }\n\n    gcc_pure\n    bool IsEmpty() const {\n        return idle.empty() && busy.empty() && num_create == 0;\n    }\n\n    void AddStats(StockStats &data) const {\n        data.busy += busy.size();\n        data.idle += idle.size();\n    }\n\n    void FadeAll();\n\nprivate:\n    \/**\n     * Check if the stock has become empty, and invoke the handler.\n     *\/\n    void CheckEmpty();\n    void ScheduleCheckEmpty();\n\n    void DestroyItem(StockItem &item);\n\n    void ScheduleClear() {\n        static constexpr struct timeval tv = { .tv_sec = 60, .tv_usec = 0 };\n        clear_event.Add(tv);\n    }\n\n    void ClearIdle();\n\n    bool GetIdle(StockGetHandler &handler);\n    void GetCreate(struct pool &caller_pool, void *info,\n                   StockGetHandler &get_handler,\n                   struct async_operation_ref &async_ref);\n\npublic:\n    void Get(struct pool &caller_pool, void *info,\n             StockGetHandler &get_handler,\n             struct async_operation_ref &async_ref);\n\n    StockItem *GetNow(struct pool &caller_pool, void *info, GError **error_r);\n\n    void Put(StockItem &item, bool destroy);\n\n    void ItemIdleDisconnect(StockItem &item);\n\n    void ItemCreateSuccess(StockItem &item);\n    void ItemCreateError(StockItem &item, GError *error);\n    void ItemCreateAborted(StockItem &item);\n\n    \/**\n     * Retry the waiting requests.  This is called after the number of\n     * busy items was reduced.\n     *\/\n    void RetryWaiting();\n    void ScheduleRetryWaiting();\n\nprivate:\n    void ScheduleCleanup() {\n        static constexpr struct timeval tv = { .tv_sec = 20, .tv_usec = 0 };\n        cleanup_event.Add(tv);\n    }\n\n    void UnscheduleCleanup() {\n        cleanup_event.Cancel();\n    }\n    void CleanupEventCallback();\n    void ClearEventCallback();\n};\n\nvoid\nStock::FadeAll()\n{\n    for (auto &i : busy)\n        i.fade = true;\n\n    ClearIdle();\n    ScheduleCheckEmpty();\n\n    \/\/ TODO: restart the \"num_create\" list?\n}\n\n\/*\n * The \"empty()\" handler method.\n *\n *\/\n\nvoid\nStock::CheckEmpty()\n{\n    if (IsEmpty() && handler != nullptr)\n        handler->OnStockEmpty(*this, uri);\n}\n\nvoid\nStock::ScheduleCheckEmpty()\n{\n    if (IsEmpty() && handler != nullptr)\n        empty_event.Add();\n}\n\n\n\/*\n * cleanup\n *\n *\/\n\nvoid\nStock::CleanupEventCallback()\n{\n    assert(idle.size() > max_idle);\n\n    \/* destroy one third of the idle items *\/\n\n    for (unsigned i = (idle.size() - max_idle + 2) \/ 3; i > 0; --i)\n        idle.pop_front_and_dispose([this](StockItem *item){\n                DestroyItem(*item);\n            });\n\n    \/* schedule next cleanup *\/\n\n    if (idle.size() > max_idle)\n        ScheduleCleanup();\n    else\n        CheckEmpty();\n}\n\n\n\/*\n * wait operation\n *\n *\/\n\ninline void\nStock::Waiting::Abort()\n{\n    auto &list = stock.waiting;\n    const auto i = list.iterator_to(*this);\n    list.erase_and_dispose(i, [](Stock::Waiting *w){ w->Destroy(); });\n}\n\nvoid\nStock::RetryWaiting()\n{\n    if (limit == 0)\n        \/* no limit configured, no waiters possible *\/\n        return;\n\n    \/* first try to serve existing idle items *\/\n\n    while (!idle.empty()) {\n        const auto i = waiting.begin();\n        if (i == waiting.end())\n            return;\n\n        auto &w = *i;\n\n        w.operation.Finished();\n        waiting.erase(i);\n\n        if (GetIdle(w.handler))\n            w.Destroy();\n        else\n            \/* didn't work (probably because borrowing the item has\n               failed) - re-add to \"waiting\" list *\/\n            waiting.push_front(w);\n    }\n\n    \/* if we're below the limit, create a bunch of new items *\/\n\n    for (unsigned i = limit - busy.size() - num_create;\n         busy.size() + num_create < limit && i > 0 && !waiting.empty();\n         --i) {\n        auto &w = waiting.front();\n        waiting.pop_front();\n\n        w.operation.Finished();\n        GetCreate(w.pool, w.info,\n                  w.handler,\n                  w.async_ref);\n        w.Destroy();\n    }\n}\n\nvoid\nStock::ScheduleRetryWaiting()\n{\n    if (limit > 0 && !waiting.empty() &&\n        busy.size() - num_create < limit)\n        retry_event.Add();\n}\n\n\n\/*\n * clear after 60 seconds idle\n *\n *\/\n\nvoid\nStock::ClearIdle()\n{\n    daemon_log(5, \"Stock::ClearIdle(%p, '%s') num_idle=%zu num_busy=%zu\\n\",\n               (const void *)this, uri,\n               idle.size(), busy.size());\n\n    if (idle.size() > max_idle)\n        UnscheduleCleanup();\n\n    idle.clear_and_dispose([this](StockItem *item){\n            DestroyItem(*item);\n        });\n}\n\nvoid\nStock::ClearEventCallback()\n{\n    daemon_log(6, \"stock_clear_event_callback(%p, '%s') may_clear=%d\\n\",\n               (const void *)this, uri, may_clear);\n\n    if (may_clear)\n        ClearIdle();\n\n    may_clear = true;\n    ScheduleClear();\n    CheckEmpty();\n}\n\n\n\/*\n * constructor\n *\n *\/\n\ninline Stock::Stock(struct pool &_pool,\n                    const StockClass &_cls, void *_class_ctx,\n                    const char *_uri, unsigned _limit, unsigned _max_idle,\n                    StockHandler *_handler)\n    :pool(_pool), cls(_cls), class_ctx(_class_ctx),\n     uri(p_strdup_checked(&pool, _uri)),\n     limit(_limit), max_idle(_max_idle),\n     handler(_handler),\n     retry_event(MakeSimpleEventCallback(Stock, RetryWaiting), this),\n     empty_event(MakeSimpleEventCallback(Stock, CheckEmpty), this),\n     cleanup_event(MakeSimpleEventCallback(Stock, CleanupEventCallback), this),\n     clear_event(MakeSimpleEventCallback(Stock, ClearEventCallback), this)\n{\n    ScheduleClear();\n}\n\ninline Stock::~Stock()\n{\n    assert(num_create == 0);\n\n    \/* must not call stock_free() when there are busy items left *\/\n    assert(busy.empty());\n\n    retry_event.Deinit();\n    empty_event.Deinit();\n    cleanup_event.Deinit();\n    clear_event.Deinit();\n\n    ClearIdle();\n\n    pool_unref(&pool);\n}\n\nStock *\nstock_new(struct pool &_pool, const StockClass &cls, void *class_ctx,\n          const char *uri, unsigned limit, unsigned max_idle,\n          StockHandler *handler)\n{\n    assert(cls.pool != nullptr);\n    assert(cls.create != nullptr);\n    assert(max_idle > 0);\n\n    struct pool *pool = pool_new_libc(&_pool, \"stock\");\n\n    return new Stock(*pool, cls, class_ctx,\n                     uri, limit, max_idle,\n                     handler);\n}\n\nvoid\nStock::DestroyItem(StockItem &item)\n{\n    item.Destroy(class_ctx);\n}\n\nvoid\nstock_free(Stock *stock)\n{\n    assert(stock != nullptr);\n\n    delete stock;\n}\n\nconst char *\nstock_get_uri(Stock &stock)\n{\n    return stock.GetUri();\n}\n\nbool\nstock_is_empty(const Stock &stock)\n{\n    return stock.IsEmpty();\n}\n\nvoid\nstock_add_stats(const Stock &stock, StockStats &data)\n{\n    stock.AddStats(data);\n}\n\nvoid\nstock_fade_all(Stock &stock)\n{\n    stock.FadeAll();\n}\n\nbool\nStock::GetIdle(StockGetHandler &get_handler)\n{\n    auto i = idle.begin();\n    const auto end = idle.end();\n    while (i != end) {\n        StockItem &item = *i;\n        assert(item.is_idle);\n\n        i = idle.erase(i);\n\n        if (idle.size() == max_idle)\n            UnscheduleCleanup();\n\n        if (item.Borrow(class_ctx)) {\n#ifndef NDEBUG\n            item.is_idle = false;\n#endif\n\n            busy.push_front(item);\n\n            get_handler.OnStockItemReady(item);\n            return true;\n        }\n\n        DestroyItem(item);\n    }\n\n    ScheduleCheckEmpty();\n    return false;\n}\n\nvoid\nStock::GetCreate(struct pool &caller_pool, void *info,\n                 StockGetHandler &get_handler,\n                 struct async_operation_ref &async_ref)\n{\n    struct pool *item_pool = cls.pool(class_ctx, pool, uri);\n\n    ++num_create;\n\n    cls.create(class_ctx, {*this, *item_pool, get_handler},\n               uri, info, caller_pool, async_ref);\n}\n\nvoid\nStock::Get(struct pool &caller_pool, void *info,\n           StockGetHandler &get_handler,\n           struct async_operation_ref &async_ref)\n{\n    may_clear = false;\n\n    if (GetIdle(get_handler))\n        return;\n\n    if (limit > 0 && busy.size() + num_create >= limit) {\n        \/* item limit reached: wait for an item to return *\/\n        auto w = NewFromPool<Stock::Waiting>(caller_pool, *this,\n                                             caller_pool, info,\n                                             get_handler, async_ref);\n        waiting.push_front(*w);\n        return;\n    }\n\n    GetCreate(caller_pool, info, get_handler, async_ref);\n}\n\nvoid\nstock_get(Stock &stock, struct pool &caller_pool, void *info,\n          StockGetHandler &handler,\n          struct async_operation_ref &async_ref)\n{\n    stock.Get(caller_pool, info, handler, async_ref);\n}\n\nStockItem *\nStock::GetNow(struct pool &caller_pool, void *info, GError **error_r)\n{\n    struct NowRequest final : public StockGetHandler {\n#ifndef NDEBUG\n        bool created = false;\n#endif\n        StockItem *item;\n        GError *error;\n\n        \/* virtual methods from class StockGetHandler *\/\n        void OnStockItemReady(StockItem &_item) override {\n#ifndef NDEBUG\n            created = true;\n#endif\n\n            item = &_item;\n        }\n\n        void OnStockItemError(GError *_error) override {\n#ifndef NDEBUG\n            created = true;\n#endif\n\n            item = nullptr;\n            error = _error;\n        }\n    };\n\n    NowRequest data;\n    struct async_operation_ref async_ref;\n\n    \/* cannot call this on a limited stock *\/\n    assert(limit == 0);\n\n    Get(caller_pool, info, data, async_ref);\n    assert(data.created);\n\n    if (data.item == nullptr)\n        g_propagate_error(error_r, data.error);\n\n    return data.item;\n}\n\nStockItem *\nstock_get_now(Stock &stock, struct pool &pool, void *info,\n              GError **error_r)\n{\n    return stock.GetNow(pool, info, error_r);\n}\n\nvoid\nStock::ItemCreateSuccess(StockItem &item)\n{\n    assert(num_create > 0);\n    --num_create;\n\n    busy.push_front(item);\n\n    item.handler.OnStockItemReady(item);\n}\n\nvoid\nstock_item_available(StockItem &item)\n{\n    item.stock.ItemCreateSuccess(item);\n}\n\nvoid\nStock::ItemCreateError(StockItem &item, GError *error)\n{\n    assert(error != nullptr);\n    assert(num_create > 0);\n    --num_create;\n\n    item.handler.OnStockItemError(error);\n    item.Destroy(class_ctx);\n\n    ScheduleCheckEmpty();\n    ScheduleRetryWaiting();\n}\n\nvoid\nstock_item_failed(StockItem &item, GError *error)\n{\n    item.stock.ItemCreateError(item, error);\n}\n\nvoid\nStock::ItemCreateAborted(StockItem &item)\n{\n    assert(num_create > 0);\n    --num_create;\n\n    item.Destroy(class_ctx);\n\n    ScheduleCheckEmpty();\n    ScheduleRetryWaiting();\n}\n\nvoid\nstock_item_aborted(StockItem &item)\n{\n    item.stock.ItemCreateAborted(item);\n}\n\nvoid\nStock::Put(StockItem &item, bool destroy)\n{\n    assert(!item.is_idle);\n\n    may_clear = false;\n\n    assert(!busy.empty());\n\n    busy.erase(busy.iterator_to(item));\n\n    if (destroy || item.fade || !item.Release(class_ctx)) {\n        DestroyItem(item);\n        ScheduleCheckEmpty();\n    } else {\n#ifndef NDEBUG\n        item.is_idle = true;\n#endif\n\n        if (idle.size() == max_idle)\n            ScheduleCleanup();\n\n        idle.push_front(item);\n    }\n\n    ScheduleRetryWaiting();\n}\n\nvoid\nstock_put(StockItem &item, bool destroy)\n{\n    item.stock.Put(item, destroy);\n}\n\nvoid\nStock::ItemIdleDisconnect(StockItem &item)\n{\n    assert(item.is_idle);\n\n    assert(!idle.empty());\n\n    idle.erase(idle.iterator_to(item));\n\n    if (idle.size() == max_idle)\n        UnscheduleCleanup();\n\n    DestroyItem(item);\n    ScheduleCheckEmpty();\n}\n\nvoid\nstock_del(StockItem &item)\n{\n    item.stock.ItemIdleDisconnect(item);\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"stringmanip.h\"\n\n#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <cstring>\n#include <sstream>\n#include <cstdarg>\n\nnamespace boxutil {\n\ntemplate<typename T>\nvoid Split(const std::string &s, char delim, T result) {\n    std::stringstream ss(s);\n    std::string item;\n    while (std::getline(ss, item, delim)) {\n        *(result++) = item;\n    }\n}\n\nstd::vector<std::string> Split(const std::string &s, char delim) {\n    std::vector<std::string> elems;\n    Split(s, delim, std::back_inserter(elems));\n    return elems;\n}\n\nstd::string GetNext(std::string &source, const std::string &delim) {\n\n    if (source == \"\") {\n        return \"\";\n    }\n\n    size_t n = source.find(delim);\n    if (n == std::string::npos) {\n        std::string ret = source;\n        source = \"\";\n        return ret;\n    } else {\n        std::string ret = source.substr(0, n);\n        source = source.substr(n+1);\n        return ret;\n    }\n\n}\n\nunsigned int CountCharsInString(const std::string &strTarget, char chChar){\n    unsigned int uiCount = 0;\n    for (unsigned int i=0; i<strTarget.size(); i++){\n        if (strTarget[i] == chChar){\n            uiCount++;\n        }\n    }\n    return uiCount;\n}\n\nbool GetStringMidByBoundingChars(const std::string &strTarget, char chBound, std::string &strOutput){\n\n    if (CountCharsInString(strTarget, chBound) != 2){\n        return false;\n    }\n\n    size_t pos1 = strTarget.find(chBound);\n    size_t pos2 = strTarget.find(chBound, pos1+1);\n\n    if (pos1 == std::string::npos || pos2 == std::string::npos){\n        return false;\n    }\n\n    strOutput = strTarget.substr(pos1+1, pos2-pos1-1);\n    return true;\n\n}\n\nstd::string TxtStrFromBuffer(const unsigned char * pcbBuffer, const unsigned int iBuffSize){\n    std::string strRet = std::string(reinterpret_cast<const char *>(pcbBuffer), iBuffSize);\n    return strRet;\n}\n\nstd::string HexStrFromBuffer(const unsigned char * pcbBuffer, const unsigned int iBuffSize){\n\n    std::string strRet;\n    char chAux[3] = {0};\n    for (unsigned int i = 0; i < iBuffSize; i++){\n        box_snprintf(chAux, 3, \"%02X\", pcbBuffer[i]);\n        strRet += chAux;\n    }\n    return strRet;\n\n}\n\nstd::string PopSurroundingChar(const std::string &strSource, const char leftChar, const char rightChar){\n    if (strSource.size() < 2){\n        return \"\";\n    }\n    size_t q1 = strSource.find(leftChar);\n    if (q1 == std::string::npos){\n        q1 = 0;\n    } else {\n        q1++;\n    }\n    size_t q2 = strSource.find(rightChar, q1+1);\n    if (q2 == std::string::npos){\n        q2 = strSource.size() - q1;\n    } else {\n        q2 -= q1;\n    }\n    return strSource.substr(q1, q2);\n}\n\nstd::string PopExtension(const std::string &strFilename){\n\n    size_t dotpos = strFilename.rfind(\".\");\n    std::string strExt;\n    if (dotpos != std::string::npos && dotpos < strFilename.size()-1){\n        strExt = strFilename.substr(0, dotpos);\n    }\n    return strExt;\n\n}\n\nstd::string GetExtension(const std::string &strFilename){\n\n    size_t dotpos = strFilename.rfind(\".\");\n    std::string strExt;\n    if (dotpos != std::string::npos && dotpos < strFilename.size()-1){\n        strExt = strFilename.substr(dotpos+1);\n    }\n    return strExt;\n\n}\n\nstd::string MakeUppercase(const std::string &strTarget){\n    std::string local = strTarget;\n    std::transform(local.begin(), local.end(), local.begin(), ::toupper);\n    return local;\n}\n\nstd::string MakeLowercase(const std::string &strTarget){\n    std::string local = strTarget;\n    std::transform(local.begin(), local.end(), local.begin(), ::tolower);\n    return local;\n}\n\nint CompareNoCase(const std::string &strLeft, const std::string &strRight){\n    std::string left = MakeLowercase(strLeft);\n    std::string right = MakeLowercase(strRight);\n    int ret = left.compare(right);\n    return ret;\n}\n\nbool EqualsNoCase(const std::string &strLeft, const std::string &strRight){\n    if (CompareNoCase(strLeft, strRight) == 0)\n        return true;\n    else\n        return false;\n}\n\nbool ContainsNoCase(const std::string &strTarget, const std::string &strContent){\n    std::string target = MakeLowercase(strTarget);\n    std::string content = MakeLowercase(strContent);\n    size_t ret = target.find(content);\n    if (ret == std::string::npos)\n        return false;\n    else\n        return true;\n}\n\nbool IsNumericString(const std::string &strElement) {\n    std::istringstream ss(strElement);\n    int num = 0;\n    if(ss >> num) {\n        return true;\n    }\n    return false;\n}\n\nbool IsAlpha(const std::string &strValue) {\n    if (strValue.find_first_not_of(\"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789\") != std::string::npos){\n        return false;\n    } \n    return true;\n}\n\nbool IsAlphaExt(const std::string &strValue) {\n    if (strValue.find_first_not_of(\"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_\/.- \") != std::string::npos){\n        return false;\n    }\n    return true;\n}\n\nbool IsBCD(const std::string &strValue) {\n    if (strValue.find_first_not_of(\"0123456789\") != std::string::npos){\n        return false;\n    }\n    return true;\n}\n\nbool IsHexStr(const std::string &strValue) {\n    if (strValue.find_first_not_of(\"abcdefABCDEF0123456789\") != std::string::npos){\n        return false;\n    }\n    return true;\n}\n\nbool IsWithinBounds(const std::string &strValue, const unsigned int min, const unsigned int max) {\n    if (strValue.size() < min || strValue.size() > max){\n        return false;\n    }\n    return true;\n}\n\nvoid HexDump(const std::vector<unsigned char> &_buffer){\n\n    std::cout << std::endl;\n\n    size_t c = 0;\n    unsigned int offs = 0;\n    printf(\"%04X   \", offs);\n\n    for (size_t i = 0; i < _buffer.size(); i++){\n\n        if (c == 16){\n            std::cout << std::endl;\n            offs += 16;\n            printf(\"%04X   \", offs);\n            c = 0;\n        }\n\n        printf(\"%02X \", _buffer[i]);\n        c++;\n    }\n    std::cout << std::endl << std::endl;\n\n}\n\nint custom_strncpy_s(char *dest, size_t dest_s, const char * src, size_t src_s){\n\n#if defined(_WIN64) || defined(_WIN32)\n    for (unsigned int i = 0; i < src_s; i++) {\n        if (i >= dest_s) {\n            return -1;\n        }\n        dest[i] = src[i];\n    }\n    return 0;\n#else\n    char *r = std::strncpy(dest, src, src_s);\n    (void)r;\n    (void)dest_s;\n    return 0;\n#endif\n\n}\n\nstd::string RemoveComment(const std::string &_cmd, const std::string _cc){\n\n    std::string localcmd = _cmd;\n    size_t p = localcmd.find(_cc);\n    if (p != std::string::npos){\n        localcmd = localcmd.substr(0, p);\n    }\n    return localcmd;\n\n}\n\nstd::string LTrim(const std::string &source){\n    size_t n = source.find_first_not_of(' ');\n    if (n == std::string::npos){\n        return source;\n    }\n    return source.substr(n);\n}\n\nstd::string RTrim(const std::string &source){\n    if (source == \"\"){\n        return \"\";\n    }\n    if (source[source.size()-1] != ' '){\n        return source;\n    }\n    int n = -1;\n    for (int i = source.size()-1; i!=-1; i--){\n        if (source[i] != ' '){\n            n = i;\n            break;\n        }\n    }\n    if (n == -1){\n        return source;\n    }\n    return source.substr(0, n+1);\n}\n\nstd::string Trim(const std::string &source){\n    return LTrim(RTrim(source));\n}\n\n} \/\/ ns: boxutil\n<commit_msg>stringmanip: fixed compilation on msvc2015<commit_after>\n#include \"stringmanip.h\"\n\n#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <iterator>\n#include <cstring>\n#include <sstream>\n#include <cstdarg>\n\nnamespace boxutil {\n\ntemplate<typename T>\nvoid Split(const std::string &s, char delim, T result) {\n    std::stringstream ss(s);\n    std::string item;\n    while (std::getline(ss, item, delim)) {\n        *(result++) = item;\n    }\n}\n\nstd::vector<std::string> Split(const std::string &s, char delim) {\n    std::vector<std::string> elems;\n    Split(s, delim, std::back_inserter(elems));\n    return elems;\n}\n\nstd::string GetNext(std::string &source, const std::string &delim) {\n\n    if (source == \"\") {\n        return \"\";\n    }\n\n    size_t n = source.find(delim);\n    if (n == std::string::npos) {\n        std::string ret = source;\n        source = \"\";\n        return ret;\n    } else {\n        std::string ret = source.substr(0, n);\n        source = source.substr(n+1);\n        return ret;\n    }\n\n}\n\nunsigned int CountCharsInString(const std::string &strTarget, char chChar){\n    unsigned int uiCount = 0;\n    for (unsigned int i=0; i<strTarget.size(); i++){\n        if (strTarget[i] == chChar){\n            uiCount++;\n        }\n    }\n    return uiCount;\n}\n\nbool GetStringMidByBoundingChars(const std::string &strTarget, char chBound, std::string &strOutput){\n\n    if (CountCharsInString(strTarget, chBound) != 2){\n        return false;\n    }\n\n    size_t pos1 = strTarget.find(chBound);\n    size_t pos2 = strTarget.find(chBound, pos1+1);\n\n    if (pos1 == std::string::npos || pos2 == std::string::npos){\n        return false;\n    }\n\n    strOutput = strTarget.substr(pos1+1, pos2-pos1-1);\n    return true;\n\n}\n\nstd::string TxtStrFromBuffer(const unsigned char * pcbBuffer, const unsigned int iBuffSize){\n    std::string strRet = std::string(reinterpret_cast<const char *>(pcbBuffer), iBuffSize);\n    return strRet;\n}\n\nstd::string HexStrFromBuffer(const unsigned char * pcbBuffer, const unsigned int iBuffSize){\n\n    std::string strRet;\n    char chAux[3] = {0};\n    for (unsigned int i = 0; i < iBuffSize; i++){\n        box_snprintf(chAux, 3, \"%02X\", pcbBuffer[i]);\n        strRet += chAux;\n    }\n    return strRet;\n\n}\n\nstd::string PopSurroundingChar(const std::string &strSource, const char leftChar, const char rightChar){\n    if (strSource.size() < 2){\n        return \"\";\n    }\n    size_t q1 = strSource.find(leftChar);\n    if (q1 == std::string::npos){\n        q1 = 0;\n    } else {\n        q1++;\n    }\n    size_t q2 = strSource.find(rightChar, q1+1);\n    if (q2 == std::string::npos){\n        q2 = strSource.size() - q1;\n    } else {\n        q2 -= q1;\n    }\n    return strSource.substr(q1, q2);\n}\n\nstd::string PopExtension(const std::string &strFilename){\n\n    size_t dotpos = strFilename.rfind(\".\");\n    std::string strExt;\n    if (dotpos != std::string::npos && dotpos < strFilename.size()-1){\n        strExt = strFilename.substr(0, dotpos);\n    }\n    return strExt;\n\n}\n\nstd::string GetExtension(const std::string &strFilename){\n\n    size_t dotpos = strFilename.rfind(\".\");\n    std::string strExt;\n    if (dotpos != std::string::npos && dotpos < strFilename.size()-1){\n        strExt = strFilename.substr(dotpos+1);\n    }\n    return strExt;\n\n}\n\nstd::string MakeUppercase(const std::string &strTarget){\n    std::string local = strTarget;\n    std::transform(local.begin(), local.end(), local.begin(), ::toupper);\n    return local;\n}\n\nstd::string MakeLowercase(const std::string &strTarget){\n    std::string local = strTarget;\n    std::transform(local.begin(), local.end(), local.begin(), ::tolower);\n    return local;\n}\n\nint CompareNoCase(const std::string &strLeft, const std::string &strRight){\n    std::string left = MakeLowercase(strLeft);\n    std::string right = MakeLowercase(strRight);\n    int ret = left.compare(right);\n    return ret;\n}\n\nbool EqualsNoCase(const std::string &strLeft, const std::string &strRight){\n    if (CompareNoCase(strLeft, strRight) == 0)\n        return true;\n    else\n        return false;\n}\n\nbool ContainsNoCase(const std::string &strTarget, const std::string &strContent){\n    std::string target = MakeLowercase(strTarget);\n    std::string content = MakeLowercase(strContent);\n    size_t ret = target.find(content);\n    if (ret == std::string::npos)\n        return false;\n    else\n        return true;\n}\n\nbool IsNumericString(const std::string &strElement) {\n    std::istringstream ss(strElement);\n    int num = 0;\n    if(ss >> num) {\n        return true;\n    }\n    return false;\n}\n\nbool IsAlpha(const std::string &strValue) {\n    if (strValue.find_first_not_of(\"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789\") != std::string::npos){\n        return false;\n    } \n    return true;\n}\n\nbool IsAlphaExt(const std::string &strValue) {\n    if (strValue.find_first_not_of(\"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_\/.- \") != std::string::npos){\n        return false;\n    }\n    return true;\n}\n\nbool IsBCD(const std::string &strValue) {\n    if (strValue.find_first_not_of(\"0123456789\") != std::string::npos){\n        return false;\n    }\n    return true;\n}\n\nbool IsHexStr(const std::string &strValue) {\n    if (strValue.find_first_not_of(\"abcdefABCDEF0123456789\") != std::string::npos){\n        return false;\n    }\n    return true;\n}\n\nbool IsWithinBounds(const std::string &strValue, const unsigned int min, const unsigned int max) {\n    if (strValue.size() < min || strValue.size() > max){\n        return false;\n    }\n    return true;\n}\n\nvoid HexDump(const std::vector<unsigned char> &_buffer){\n\n    std::cout << std::endl;\n\n    size_t c = 0;\n    unsigned int offs = 0;\n    printf(\"%04X   \", offs);\n\n    for (size_t i = 0; i < _buffer.size(); i++){\n\n        if (c == 16){\n            std::cout << std::endl;\n            offs += 16;\n            printf(\"%04X   \", offs);\n            c = 0;\n        }\n\n        printf(\"%02X \", _buffer[i]);\n        c++;\n    }\n    std::cout << std::endl << std::endl;\n\n}\n\nint custom_strncpy_s(char *dest, size_t dest_s, const char * src, size_t src_s){\n\n#if defined(_WIN64) || defined(_WIN32)\n    for (unsigned int i = 0; i < src_s; i++) {\n        if (i >= dest_s) {\n            return -1;\n        }\n        dest[i] = src[i];\n    }\n    return 0;\n#else\n    char *r = std::strncpy(dest, src, src_s);\n    (void)r;\n    (void)dest_s;\n    return 0;\n#endif\n\n}\n\nstd::string RemoveComment(const std::string &_cmd, const std::string _cc){\n\n    std::string localcmd = _cmd;\n    size_t p = localcmd.find(_cc);\n    if (p != std::string::npos){\n        localcmd = localcmd.substr(0, p);\n    }\n    return localcmd;\n\n}\n\nstd::string LTrim(const std::string &source){\n    size_t n = source.find_first_not_of(' ');\n    if (n == std::string::npos){\n        return source;\n    }\n    return source.substr(n);\n}\n\nstd::string RTrim(const std::string &source){\n    if (source == \"\"){\n        return \"\";\n    }\n    if (source[source.size()-1] != ' '){\n        return source;\n    }\n    int n = -1;\n    for (int i = source.size()-1; i!=-1; i--){\n        if (source[i] != ' '){\n            n = i;\n            break;\n        }\n    }\n    if (n == -1){\n        return source;\n    }\n    return source.substr(0, n+1);\n}\n\nstd::string Trim(const std::string &source){\n    return LTrim(RTrim(source));\n}\n\n} \/\/ ns: boxutil\n<|endoftext|>"}
{"text":"<commit_before>#include \"tarsnaptask.h\"\n\nWARNINGS_DISABLE\n#include <QFileInfo>\nWARNINGS_ENABLE\n\n#include \"utils.h\"\n\n#include <ConsoleLog.h>\n\n#if defined Q_OS_UNIX\n#include <signal.h>\n#endif\n\n#define DEFAULT_TIMEOUT_MS 5000\n#define LOG_MAX_LENGTH 3072\n#define LOG_MAX_SEARCH_NL 1024\n\nTarsnapTask::TarsnapTask()\n    : QObject(),\n      _uuid(QUuid::createUuid()),\n      _process(nullptr),\n      _truncateLogOutput(false),\n      _exitCode(EXIT_NO_MEANING)\n{\n#ifdef QT_TESTLIB_LIB\n    _fake = false;\n#endif\n}\n\nTarsnapTask::~TarsnapTask()\n{\n}\n\nstatic bool cmdInPath(QString cmd)\n{\n    \/\/ Check stand-alone command\n    QFileInfo info(cmd);\n    if(info.isExecutable())\n        return true;\n\n    \/\/ Search for command in path\n    const char *env_path = getenv(\"PATH\");\n    QStringList paths    = QString(env_path).split(\":\");\n    for(const QString &path : paths)\n    {\n        const QString path_cmd = path + QDir::separator() + cmd;\n        QFileInfo     info_path(path_cmd);\n        if(info_path.isExecutable())\n            return true;\n    }\n\n    return false;\n}\n\nvoid TarsnapTask::run()\n{\n    \/\/ Set up new _process\n    _process = new QProcess();\n    _process->setProgram(_command);\n    _process->setArguments(_arguments);\n    if(!_stdOutFile.isEmpty())\n        _process->setStandardOutputFile(_stdOutFile);\n\n    LOG << tr(\"Task %1 started:\\n[%2 %3]\\n\")\n               .arg(_uuid.toString())\n               .arg(_process->program())\n               .arg(Utils::quoteCommandLine(_process->arguments()));\n\n#ifdef QT_TESTLIB_LIB\n    \/\/ Bail if desired.  Make sure this happens before we check if the\n    \/\/ command exists, otherwise we might bail for the wrong reason.\n    if(_fake)\n    {\n        LOG << \"Not running task due to 'fake this task' request.\\n\";\n        _fake = false;\n        emit finished(_data, EXIT_FAKE_REQUEST, \"\", \"\");\n        goto cleanup;\n    }\n#endif\n\n    \/\/ Make sure that the command exists and is executable because QProcess\n    \/\/ doesn't clean up its memory if it fails due to \"command not found\".\n    if(!cmdInPath(_command))\n    {\n        LOG << QString(\"Command '%1' not found\\n\").arg(_command);\n        emit finished(_data, EXIT_CMD_NOT_FOUND, \"\", \"\");\n        goto cleanup;\n    }\n\n    \/\/ Start the _process, and wait for confirmation of it starting.\n    _process->start();\n    if(_process->waitForStarted(DEFAULT_TIMEOUT_MS))\n    {\n        emit started(_data);\n    }\n    else\n    {\n        _exitCode = EXIT_DID_NOT_START;\n        processError();\n        goto cleanup;\n    }\n\n    \/\/ Write to the process' stdin (e.g., the confirmation text for nuke, the\n    \/\/ password for tarsnap-keygen, the list of files to restore via tarsnap's\n    \/\/ \"-x -T -\" options).\n    if(!_stdIn.isEmpty())\n    {\n        QByteArray password(_stdIn.toUtf8());\n        _process->write(password.data(), password.size());\n        _process->closeWriteChannel();\n    }\n\n    \/\/ Wait indefinitely for the process to finish\n    if(_process->waitForFinished(-1))\n    {\n        readProcessOutput();\n        processFinished();\n    }\n    else\n    {\n        readProcessOutput();\n        processError();\n        goto cleanup;\n    }\n\ncleanup:\n    delete _process;\n    _process = nullptr;\n    emit dequeue();\n}\n\nvoid TarsnapTask::stop(bool kill)\n{\n    if(_process->state() == QProcess::Running)\n    {\n        _process->terminate();\n        if(kill && (false == _process->waitForFinished(DEFAULT_TIMEOUT_MS)))\n            _process->kill();\n    }\n}\n\nvoid TarsnapTask::interrupt()\n{\n#if defined Q_OS_UNIX\n    \/\/ Assume that Q_PID is a valid pid on this system.\n    pid_t pid = static_cast<pid_t>(_process->pid());\n    \/\/ If this is sent to the Tarsnap client creating an archive, it will\n    \/\/ truncate it and leave a '.part' partial archive.\n    kill(pid, SIGQUIT);\n#endif\n}\n\nvoid TarsnapTask::cancel()\n{\n    emit canceled(_data);\n}\n\nbool TarsnapTask::waitForTask()\n{\n    return _process->waitForFinished(-1);\n}\n\nQProcess::ProcessState TarsnapTask::taskStatus()\n{\n    return _process->state();\n}\n\nQString TarsnapTask::command() const\n{\n    return _command;\n}\n\nvoid TarsnapTask::setCommand(const QString &command)\n{\n    _command = command;\n}\n\nQStringList TarsnapTask::arguments() const\n{\n    return _arguments;\n}\n\nvoid TarsnapTask::setArguments(const QStringList &arguments)\n{\n    _arguments = arguments;\n}\n\nvoid TarsnapTask::setStdIn(const QString &standardIn)\n{\n    _stdIn = standardIn;\n}\n\nvoid TarsnapTask::setStdOutFile(const QString &fileName)\n{\n    _stdOutFile = fileName;\n}\n\nQVariant TarsnapTask::data() const\n{\n    return _data;\n}\n\nvoid TarsnapTask::setData(const QVariant &data)\n{\n    _data = data;\n}\n\nbool TarsnapTask::truncateLogOutput() const\n{\n    return _truncateLogOutput;\n}\n\nvoid TarsnapTask::setTruncateLogOutput(bool truncateLogOutput)\n{\n    _truncateLogOutput = truncateLogOutput;\n}\n\nvoid TarsnapTask::readProcessOutput()\n{\n    if(_stdOutFile.isEmpty())\n        _stdOut.append(_process->readAllStandardOutput().trimmed());\n    _stdErr.append(_process->readAllStandardError().trimmed());\n}\n\nQByteArray TarsnapTask::truncate_output(QByteArray stdOut)\n{\n    \/\/ Find a good newline to which to truncate.\n    int from = LOG_MAX_LENGTH\n               + std::min(stdOut.size() - LOG_MAX_LENGTH, LOG_MAX_SEARCH_NL);\n    int nextNL = stdOut.lastIndexOf(QChar('\\n'), from);\n    \/\/ Only keep the first part of the logfile.\n    stdOut.truncate(std::max(LOG_MAX_LENGTH, nextNL));\n    \/\/ Notify about truncation in log.\n    int num_truncated = _stdOut.mid(stdOut.size()).count('\\n');\n    stdOut.append(tr(\"\\n...\\n-- %1 output lines truncated by Tarsnap GUI --\\n\")\n                      .arg(num_truncated));\n    return stdOut;\n}\n\nvoid TarsnapTask::processFinished()\n{\n    switch(_process->exitStatus())\n    {\n    case QProcess::NormalExit:\n    {\n        _exitCode = _process->exitCode();\n        emit finished(_data, _exitCode, QString(_stdOut), QString(_stdErr));\n\n        \/\/ Truncate LOG output\n        QByteArray stdOut(_stdOut);\n        if(_truncateLogOutput && (stdOut.size() > LOG_MAX_LENGTH))\n            stdOut = truncate_output(stdOut);\n\n        LOG << tr(\"Task %1 finished with exit code %2:\\n[%3 %4]\\n%5\\n\")\n                   .arg(_uuid.toString())\n                   .arg(_exitCode)\n                   .arg(_command)\n                   .arg(Utils::quoteCommandLine(_arguments))\n                   .arg(QString(stdOut + _stdErr));\n        break;\n    }\n    case QProcess::CrashExit:\n    {\n        _exitCode = EXIT_CRASHED;\n        processError();\n        break;\n    }\n    }\n}\n\nvoid TarsnapTask::processError()\n{\n    LOG << tr(\"Task %1 finished with error %2 (%3) occured \"\n              \"(exit code %4):\\n[%5 %6]\\n%7\\n\")\n               .arg(_uuid.toString())\n               .arg(_process->error())\n               .arg(_process->errorString())\n               .arg(_exitCode)\n               .arg(_command)\n               .arg(Utils::quoteCommandLine(_arguments))\n               .arg(QString(_stdOut + _stdErr).trimmed());\n    emit finished(_data, _exitCode, QString(_stdOut), QString(_stdErr));\n    cancel();\n}\n\n#ifdef QT_TESTLIB_LIB\nvoid TarsnapTask::fake()\n{\n    _fake = true;\n}\n#endif\n<commit_msg>TarsnapTask: use QStandardPaths::findExecutable<commit_after>#include \"tarsnaptask.h\"\n\nWARNINGS_DISABLE\n#include <QFileInfo>\n#include <QStandardPaths>\nWARNINGS_ENABLE\n\n#include \"utils.h\"\n\n#include <ConsoleLog.h>\n\n#if defined Q_OS_UNIX\n#include <signal.h>\n#endif\n\n#define DEFAULT_TIMEOUT_MS 5000\n#define LOG_MAX_LENGTH 3072\n#define LOG_MAX_SEARCH_NL 1024\n\nTarsnapTask::TarsnapTask()\n    : QObject(),\n      _uuid(QUuid::createUuid()),\n      _process(nullptr),\n      _truncateLogOutput(false),\n      _exitCode(EXIT_NO_MEANING)\n{\n#ifdef QT_TESTLIB_LIB\n    _fake = false;\n#endif\n}\n\nTarsnapTask::~TarsnapTask()\n{\n}\n\nvoid TarsnapTask::run()\n{\n    \/\/ Set up new _process\n    _process = new QProcess();\n    _process->setProgram(_command);\n    _process->setArguments(_arguments);\n    if(!_stdOutFile.isEmpty())\n        _process->setStandardOutputFile(_stdOutFile);\n\n    LOG << tr(\"Task %1 started:\\n[%2 %3]\\n\")\n               .arg(_uuid.toString())\n               .arg(_process->program())\n               .arg(Utils::quoteCommandLine(_process->arguments()));\n\n#ifdef QT_TESTLIB_LIB\n    \/\/ Bail if desired.  Make sure this happens before we check if the\n    \/\/ command exists, otherwise we might bail for the wrong reason.\n    if(_fake)\n    {\n        LOG << \"Not running task due to 'fake this task' request.\\n\";\n        _fake = false;\n        emit finished(_data, EXIT_FAKE_REQUEST, \"\", \"\");\n        goto cleanup;\n    }\n#endif\n\n    \/\/ Make sure that the command exists and is executable, because QProcess\n    \/\/ doesn't clean up its memory if it fails due to \"command not found\".\n    if(QStandardPaths::findExecutable(_command).isEmpty())\n    {\n        LOG << QString(\"Command '%1' not found\\n\").arg(_command);\n        emit finished(_data, EXIT_CMD_NOT_FOUND, \"\", \"\");\n        goto cleanup;\n    }\n\n    \/\/ Start the _process, and wait for confirmation of it starting.\n    _process->start();\n    if(_process->waitForStarted(DEFAULT_TIMEOUT_MS))\n    {\n        emit started(_data);\n    }\n    else\n    {\n        _exitCode = EXIT_DID_NOT_START;\n        processError();\n        goto cleanup;\n    }\n\n    \/\/ Write to the process' stdin (e.g., the confirmation text for nuke, the\n    \/\/ password for tarsnap-keygen, the list of files to restore via tarsnap's\n    \/\/ \"-x -T -\" options).\n    if(!_stdIn.isEmpty())\n    {\n        QByteArray password(_stdIn.toUtf8());\n        _process->write(password.data(), password.size());\n        _process->closeWriteChannel();\n    }\n\n    \/\/ Wait indefinitely for the process to finish\n    if(_process->waitForFinished(-1))\n    {\n        readProcessOutput();\n        processFinished();\n    }\n    else\n    {\n        readProcessOutput();\n        processError();\n        goto cleanup;\n    }\n\ncleanup:\n    delete _process;\n    _process = nullptr;\n    emit dequeue();\n}\n\nvoid TarsnapTask::stop(bool kill)\n{\n    if(_process->state() == QProcess::Running)\n    {\n        _process->terminate();\n        if(kill && (false == _process->waitForFinished(DEFAULT_TIMEOUT_MS)))\n            _process->kill();\n    }\n}\n\nvoid TarsnapTask::interrupt()\n{\n#if defined Q_OS_UNIX\n    \/\/ Assume that Q_PID is a valid pid on this system.\n    pid_t pid = static_cast<pid_t>(_process->pid());\n    \/\/ If this is sent to the Tarsnap client creating an archive, it will\n    \/\/ truncate it and leave a '.part' partial archive.\n    kill(pid, SIGQUIT);\n#endif\n}\n\nvoid TarsnapTask::cancel()\n{\n    emit canceled(_data);\n}\n\nbool TarsnapTask::waitForTask()\n{\n    return _process->waitForFinished(-1);\n}\n\nQProcess::ProcessState TarsnapTask::taskStatus()\n{\n    return _process->state();\n}\n\nQString TarsnapTask::command() const\n{\n    return _command;\n}\n\nvoid TarsnapTask::setCommand(const QString &command)\n{\n    _command = command;\n}\n\nQStringList TarsnapTask::arguments() const\n{\n    return _arguments;\n}\n\nvoid TarsnapTask::setArguments(const QStringList &arguments)\n{\n    _arguments = arguments;\n}\n\nvoid TarsnapTask::setStdIn(const QString &standardIn)\n{\n    _stdIn = standardIn;\n}\n\nvoid TarsnapTask::setStdOutFile(const QString &fileName)\n{\n    _stdOutFile = fileName;\n}\n\nQVariant TarsnapTask::data() const\n{\n    return _data;\n}\n\nvoid TarsnapTask::setData(const QVariant &data)\n{\n    _data = data;\n}\n\nbool TarsnapTask::truncateLogOutput() const\n{\n    return _truncateLogOutput;\n}\n\nvoid TarsnapTask::setTruncateLogOutput(bool truncateLogOutput)\n{\n    _truncateLogOutput = truncateLogOutput;\n}\n\nvoid TarsnapTask::readProcessOutput()\n{\n    if(_stdOutFile.isEmpty())\n        _stdOut.append(_process->readAllStandardOutput().trimmed());\n    _stdErr.append(_process->readAllStandardError().trimmed());\n}\n\nQByteArray TarsnapTask::truncate_output(QByteArray stdOut)\n{\n    \/\/ Find a good newline to which to truncate.\n    int from = LOG_MAX_LENGTH\n               + std::min(stdOut.size() - LOG_MAX_LENGTH, LOG_MAX_SEARCH_NL);\n    int nextNL = stdOut.lastIndexOf(QChar('\\n'), from);\n    \/\/ Only keep the first part of the logfile.\n    stdOut.truncate(std::max(LOG_MAX_LENGTH, nextNL));\n    \/\/ Notify about truncation in log.\n    int num_truncated = _stdOut.mid(stdOut.size()).count('\\n');\n    stdOut.append(tr(\"\\n...\\n-- %1 output lines truncated by Tarsnap GUI --\\n\")\n                      .arg(num_truncated));\n    return stdOut;\n}\n\nvoid TarsnapTask::processFinished()\n{\n    switch(_process->exitStatus())\n    {\n    case QProcess::NormalExit:\n    {\n        _exitCode = _process->exitCode();\n        emit finished(_data, _exitCode, QString(_stdOut), QString(_stdErr));\n\n        \/\/ Truncate LOG output\n        QByteArray stdOut(_stdOut);\n        if(_truncateLogOutput && (stdOut.size() > LOG_MAX_LENGTH))\n            stdOut = truncate_output(stdOut);\n\n        LOG << tr(\"Task %1 finished with exit code %2:\\n[%3 %4]\\n%5\\n\")\n                   .arg(_uuid.toString())\n                   .arg(_exitCode)\n                   .arg(_command)\n                   .arg(Utils::quoteCommandLine(_arguments))\n                   .arg(QString(stdOut + _stdErr));\n        break;\n    }\n    case QProcess::CrashExit:\n    {\n        _exitCode = EXIT_CRASHED;\n        processError();\n        break;\n    }\n    }\n}\n\nvoid TarsnapTask::processError()\n{\n    LOG << tr(\"Task %1 finished with error %2 (%3) occured \"\n              \"(exit code %4):\\n[%5 %6]\\n%7\\n\")\n               .arg(_uuid.toString())\n               .arg(_process->error())\n               .arg(_process->errorString())\n               .arg(_exitCode)\n               .arg(_command)\n               .arg(Utils::quoteCommandLine(_arguments))\n               .arg(QString(_stdOut + _stdErr).trimmed());\n    emit finished(_data, _exitCode, QString(_stdOut), QString(_stdErr));\n    cancel();\n}\n\n#ifdef QT_TESTLIB_LIB\nvoid TarsnapTask::fake()\n{\n    _fake = true;\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n Copyright (C) 2011 by Ivan Safrin\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 \"PolyCoreServices.h\"\n#include \"PolyCore.h\"\n#include \"PolyCoreInput.h\"\n#include \"PolyInputEvent.h\"\n#include \"PolyLogger.h\"\n#include \"PolyModule.h\"\n#include \"PolyResourceManager.h\"\n#include \"PolyMaterialManager.h\"\n#include \"PolyRenderer.h\"\n#include \"PolyConfig.h\"\n#include \"PolyFontManager.h\"\n#include \"PolyScreenManager.h\"\n#include \"PolySceneManager.h\"\n#include \"PolyTimerManager.h\"\n#include \"PolyTweenManager.h\"\n#include \"PolySoundManager.h\"\n\n\/\/ For use by getScreenInfo\n#if defined(_WINDOWS)\n#include <windows.h>\n#elif defined(__APPLE__) && defined(__MACH__)\n#include <ApplicationServices\/ApplicationServices.h>\n#elif defined(__linux) || defined(__linux__) || defined(linux)\n#include <X11\/extensions\/Xrandr.h>\n#include <gdk\/gdkx.h>\n#elif defined(SDL_VERSION)\n#include <SDL\/SDL.h>\n#endif\n\nusing namespace Polycode;\n\nstd::map<long, CoreServices*> CoreServices::instanceMap;\nCoreMutex *CoreServices::renderMutex = 0;\nCoreServices* CoreServices::overrideInstance = NULL;\n\nCoreMutex *CoreServices::getRenderMutex() {\n\tif(renderMutex == NULL) {\n\t\tLogger::log(\"Creating render mutex...\\n\");\n\t\trenderMutex = getInstance()->getCore()->createMutex();\n\t}\n\treturn renderMutex;\n}\n\nvoid CoreServices::setInstance(CoreServices *_instance) {\n\toverrideInstance = _instance;\n\tLogger::log(\"Overriding core instance...\\n\");\n}\n\nCoreServices* CoreServices::getInstance() {\n\n\tif(overrideInstance) {\n\t\treturn overrideInstance;\n\t}\n\n\/\/#ifdef _WINDOWS\n\t\toverrideInstance = new CoreServices;\n\t\tLogger::log(\"Creating new core services instance...\\n\");\n\t\treturn overrideInstance;\n\/\/#else\n\/\/\tlong threadID = getThreadID(); \n\/\/\tCoreServices *instance;\n\/\/\tif(instanceMap.find(threadID) == instanceMap.end()) {\n\/\/\t\tLogger::log(\"Creating new core services instance...\\n\");\n\/\/\t\tinstance = new CoreServices;\n\/\/\t\tinstanceMap[threadID] = instance;\n\/\/\t} else {\n\/\/\t\tinstance = instanceMap[threadID];\n\/\/\t}\n\/\/\treturn instance;\n\/\/#endif\n}\n\nMaterialManager *CoreServices::getMaterialManager() {\n\treturn materialManager;\n}\n\nTimerManager *CoreServices::getTimerManager() {\n\treturn timerManager;\n}\n\nFontManager *CoreServices::getFontManager() {\n\treturn fontManager;\n}\n\nConfig *CoreServices::getConfig() {\n\treturn config;\n}\n\nvoid CoreServices::installModule(PolycodeModule *module)  {\n\tmodules.push_back(module);\n\tswitch(module->getType()) {\n\t\tcase PolycodeModule::TYPE_SHADER:\n\/\/\t\t\trenderer->addShaderModule((ShaderModule*)module);\n\t\t\tresourceManager->addShaderModule((PolycodeShaderModule*) module);\n\t\t\tmaterialManager->addShaderModule((PolycodeShaderModule*) module);\n\t\t\trenderer->addShaderModule((PolycodeShaderModule*) module);\n\t\tbreak;\n\t}\n}\n\nCoreServices::CoreServices() : EventDispatcher() {\n\tresourceManager = new ResourceManager();\t\n\tconfig = new Config();\n\tmaterialManager = new MaterialManager();\n\tscreenManager = new ScreenManager();\n\taddEventListener(screenManager, InputEvent::EVENT_MOUSEDOWN);\n\taddEventListener(screenManager, InputEvent::EVENT_MOUSEMOVE);\n\taddEventListener(screenManager, InputEvent::EVENT_MOUSEUP);\n\taddEventListener(screenManager, InputEvent::EVENT_MOUSEWHEEL_UP);\n\taddEventListener(screenManager, InputEvent::EVENT_MOUSEWHEEL_DOWN);\t\n\taddEventListener(screenManager, InputEvent::EVENT_KEYDOWN);\n\taddEventListener(screenManager, InputEvent::EVENT_KEYUP);\t\n\tsceneManager = new SceneManager();\n\ttimerManager = new TimerManager();\n\ttweenManager = new TweenManager();\n\tsoundManager = new SoundManager();\n\tfontManager = new FontManager();\n}\n\nCoreServices::~CoreServices() {\n\tdelete materialManager;\n\tdelete screenManager;\n\tdelete sceneManager;\n\tdelete timerManager;\n\tdelete tweenManager;\n\tdelete resourceManager;\n\tdelete soundManager;\n\tdelete fontManager;\n\tinstanceMap.clear();\n\toverrideInstance = NULL;\n\t\n}\n\nvoid CoreServices::setCore(Core *core) {\n\tthis->core = core;\n\tcore->getInput()->addEventListener(this, InputEvent::EVENT_MOUSEDOWN);\n\tcore->getInput()->addEventListener(this, InputEvent::EVENT_MOUSEMOVE);\n\tcore->getInput()->addEventListener(this, InputEvent::EVENT_MOUSEUP);\n\tcore->getInput()->addEventListener(this, InputEvent::EVENT_MOUSEWHEEL_DOWN);\t\n\tcore->getInput()->addEventListener(this, InputEvent::EVENT_MOUSEWHEEL_UP);\t\t\n\tcore->getInput()->addEventListener(this, InputEvent::EVENT_KEYDOWN);\n\tcore->getInput()->addEventListener(this, InputEvent::EVENT_KEYUP);\n}\n\nvoid CoreServices::handleEvent(Event *event) {\n\tif(event->getDispatcher() == core->getInput()) {\n\t\tInputEvent *inputEvent = (InputEvent*)event;\n\t\tswitch(event->getEventCode()) {\n\t\t\tcase InputEvent::EVENT_KEYDOWN:\n\t\t\tcase InputEvent::EVENT_KEYUP:\n\t\t\t\tdispatchEvent(new InputEvent(inputEvent->key, inputEvent->charCode, inputEvent->timestamp), inputEvent->getEventCode());\t\t\t\n\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tInputEvent *_inputEvent = new InputEvent(inputEvent->mousePosition, inputEvent->timestamp);\n\t\t\t\t_inputEvent->mouseButton = inputEvent->mouseButton;\n\t\t\t\tdispatchEvent(_inputEvent, inputEvent->getEventCode());\t\t\t\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\nCore *CoreServices::getCore() {\n\treturn core;\n}\n\n\nvoid CoreServices::setRenderer(Renderer *renderer) {\n\tthis->renderer = renderer;\n}\n\nRenderer *CoreServices::getRenderer() {\n\treturn renderer;\n}\n\nvoid CoreServices::Update(int elapsed) {\n\ttimerManager->Update();\n\ttweenManager->Update();\n\tmaterialManager->Update(elapsed);\n\trenderer->setPerspectiveMode();\n\tsceneManager->UpdateVirtual();\n\trenderer->clearScreen();\n\tsceneManager->Update();\n\/\/\trenderer->setOrthoMode();\n\tscreenManager->Update();\n}\n\nSoundManager *CoreServices::getSoundManager() {\n\treturn soundManager;\n}\n\nScreenManager *CoreServices::getScreenManager() {\n\treturn screenManager;\n}\n\nSceneManager *CoreServices::getSceneManager() {\n\treturn sceneManager;\n}\n\nTweenManager *CoreServices::getTweenManager() {\n\treturn tweenManager;\n}\n\nResourceManager *CoreServices::getResourceManager() {\n\treturn resourceManager;\n}\n\nvoid CoreServices::getScreenInfo(int *width, int *height, int *hz) {\n#if defined(_WINDOWS)\n\t\n\tDEVMODE mode = {.dmSize = sizeof(DEVMODE), .dmDriverExtra = 0};\n\t\n    EnumDisplaySettings(0, ENUM_CURRENT_SETTINGS, &mode);\n\t\n    \/\/ Store the current display settings.\n    if (width) *width = mode.dmPelsWidth;\n    if (height) *height = mode.dmPelsHeight;\n    if (hz) *hz = mode.dmDisplayFrequency;\n\t\n#elif defined(__APPLE__) && defined(__MACH__)\n\t\n\tCGDisplayModeRef mode = CGDisplayCopyDisplayMode(CGMainDisplayID());\n    \n    \/\/ Copy the relevant data.\n    if (width) *width = CGDisplayModeGetWidth(mode);\n    if (height) *height = CGDisplayModeGetHeight(mode);\n    if (hz) *hz = CGDisplayModeGetRefreshRate(mode);\n    \n    CGDisplayModeRelease(mode);\n\t\n#elif defined(__linux) || defined(__linux__) || defined(linux)\n\t\n    \/\/ Get the current configuration.\n    XRRScreenConfiguration *config = XRRGetScreenInfo(gdk_x11_get_default_xdisplay(),\n                                                      gdk_x11_get_default_root_xwindow());\n    int size_count;\n    \/\/ Obtain the dimensions.\n    XRRScreenSize *sizes = XRRConfigSizes(config, &size_count);\n    Rotation current_rotation;\n    SizeID current_mode = XRRConfigCurrentConfiguration(config, &current_rotation);\n\t\n    \/\/ Store the results.\n    if (width) *width = sizes[current_mode].width;\n    if (height) *height = sizes[current_mode].height;\n    if (hz) *hz = XRRConfigCurrentRate(config); \/\/ Warning: On some drivers (nvidia?) this can lie.\n\t\n    XRRFreeScreenConfigInfo(config);\n\t\n#elif defined(SDL_VERSION)\n\t\n\tconst SDL_VideoInfo *video = SDL_GetVideoInfo();\n\tif (width) *width = video->current_w;\n\tif (height) *height = video->current_h;\n\tif (hz) *hz = 0;\n\t\n#else\n\t\n\tif (width) *width = 0;\n\tif (height) *height = 0;\n\tif (hz) *hz = 0;\n\t\n#endif\n}<commit_msg>CoreServices::getScreenInfo, Linux version fix: remove hard-to-compile gdk dependency; assume Linux is using SDL and jump straight to that solution.<commit_after>\/*\n Copyright (C) 2011 by Ivan Safrin\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 \"PolyCoreServices.h\"\n#include \"PolyCore.h\"\n#include \"PolyCoreInput.h\"\n#include \"PolyInputEvent.h\"\n#include \"PolyLogger.h\"\n#include \"PolyModule.h\"\n#include \"PolyResourceManager.h\"\n#include \"PolyMaterialManager.h\"\n#include \"PolyRenderer.h\"\n#include \"PolyConfig.h\"\n#include \"PolyFontManager.h\"\n#include \"PolyScreenManager.h\"\n#include \"PolySceneManager.h\"\n#include \"PolyTimerManager.h\"\n#include \"PolyTweenManager.h\"\n#include \"PolySoundManager.h\"\n\n\/\/ For use by getScreenInfo\n#if defined(_WINDOWS)\n#include <windows.h>\n#elif defined(__APPLE__) && defined(__MACH__)\n#include <ApplicationServices\/ApplicationServices.h>\n#elif defined(__linux) || defined(__linux__) || defined(linux)\n#include <SDL\/SDL.h>\n#endif\n\nusing namespace Polycode;\n\nstd::map<long, CoreServices*> CoreServices::instanceMap;\nCoreMutex *CoreServices::renderMutex = 0;\nCoreServices* CoreServices::overrideInstance = NULL;\n\nCoreMutex *CoreServices::getRenderMutex() {\n\tif(renderMutex == NULL) {\n\t\tLogger::log(\"Creating render mutex...\\n\");\n\t\trenderMutex = getInstance()->getCore()->createMutex();\n\t}\n\treturn renderMutex;\n}\n\nvoid CoreServices::setInstance(CoreServices *_instance) {\n\toverrideInstance = _instance;\n\tLogger::log(\"Overriding core instance...\\n\");\n}\n\nCoreServices* CoreServices::getInstance() {\n\n\tif(overrideInstance) {\n\t\treturn overrideInstance;\n\t}\n\n\/\/#ifdef _WINDOWS\n\t\toverrideInstance = new CoreServices;\n\t\tLogger::log(\"Creating new core services instance...\\n\");\n\t\treturn overrideInstance;\n\/\/#else\n\/\/\tlong threadID = getThreadID(); \n\/\/\tCoreServices *instance;\n\/\/\tif(instanceMap.find(threadID) == instanceMap.end()) {\n\/\/\t\tLogger::log(\"Creating new core services instance...\\n\");\n\/\/\t\tinstance = new CoreServices;\n\/\/\t\tinstanceMap[threadID] = instance;\n\/\/\t} else {\n\/\/\t\tinstance = instanceMap[threadID];\n\/\/\t}\n\/\/\treturn instance;\n\/\/#endif\n}\n\nMaterialManager *CoreServices::getMaterialManager() {\n\treturn materialManager;\n}\n\nTimerManager *CoreServices::getTimerManager() {\n\treturn timerManager;\n}\n\nFontManager *CoreServices::getFontManager() {\n\treturn fontManager;\n}\n\nConfig *CoreServices::getConfig() {\n\treturn config;\n}\n\nvoid CoreServices::installModule(PolycodeModule *module)  {\n\tmodules.push_back(module);\n\tswitch(module->getType()) {\n\t\tcase PolycodeModule::TYPE_SHADER:\n\/\/\t\t\trenderer->addShaderModule((ShaderModule*)module);\n\t\t\tresourceManager->addShaderModule((PolycodeShaderModule*) module);\n\t\t\tmaterialManager->addShaderModule((PolycodeShaderModule*) module);\n\t\t\trenderer->addShaderModule((PolycodeShaderModule*) module);\n\t\tbreak;\n\t}\n}\n\nCoreServices::CoreServices() : EventDispatcher() {\n\tresourceManager = new ResourceManager();\t\n\tconfig = new Config();\n\tmaterialManager = new MaterialManager();\n\tscreenManager = new ScreenManager();\n\taddEventListener(screenManager, InputEvent::EVENT_MOUSEDOWN);\n\taddEventListener(screenManager, InputEvent::EVENT_MOUSEMOVE);\n\taddEventListener(screenManager, InputEvent::EVENT_MOUSEUP);\n\taddEventListener(screenManager, InputEvent::EVENT_MOUSEWHEEL_UP);\n\taddEventListener(screenManager, InputEvent::EVENT_MOUSEWHEEL_DOWN);\t\n\taddEventListener(screenManager, InputEvent::EVENT_KEYDOWN);\n\taddEventListener(screenManager, InputEvent::EVENT_KEYUP);\t\n\tsceneManager = new SceneManager();\n\ttimerManager = new TimerManager();\n\ttweenManager = new TweenManager();\n\tsoundManager = new SoundManager();\n\tfontManager = new FontManager();\n}\n\nCoreServices::~CoreServices() {\n\tdelete materialManager;\n\tdelete screenManager;\n\tdelete sceneManager;\n\tdelete timerManager;\n\tdelete tweenManager;\n\tdelete resourceManager;\n\tdelete soundManager;\n\tdelete fontManager;\n\tinstanceMap.clear();\n\toverrideInstance = NULL;\n\t\n}\n\nvoid CoreServices::setCore(Core *core) {\n\tthis->core = core;\n\tcore->getInput()->addEventListener(this, InputEvent::EVENT_MOUSEDOWN);\n\tcore->getInput()->addEventListener(this, InputEvent::EVENT_MOUSEMOVE);\n\tcore->getInput()->addEventListener(this, InputEvent::EVENT_MOUSEUP);\n\tcore->getInput()->addEventListener(this, InputEvent::EVENT_MOUSEWHEEL_DOWN);\t\n\tcore->getInput()->addEventListener(this, InputEvent::EVENT_MOUSEWHEEL_UP);\t\t\n\tcore->getInput()->addEventListener(this, InputEvent::EVENT_KEYDOWN);\n\tcore->getInput()->addEventListener(this, InputEvent::EVENT_KEYUP);\n}\n\nvoid CoreServices::handleEvent(Event *event) {\n\tif(event->getDispatcher() == core->getInput()) {\n\t\tInputEvent *inputEvent = (InputEvent*)event;\n\t\tswitch(event->getEventCode()) {\n\t\t\tcase InputEvent::EVENT_KEYDOWN:\n\t\t\tcase InputEvent::EVENT_KEYUP:\n\t\t\t\tdispatchEvent(new InputEvent(inputEvent->key, inputEvent->charCode, inputEvent->timestamp), inputEvent->getEventCode());\t\t\t\n\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tInputEvent *_inputEvent = new InputEvent(inputEvent->mousePosition, inputEvent->timestamp);\n\t\t\t\t_inputEvent->mouseButton = inputEvent->mouseButton;\n\t\t\t\tdispatchEvent(_inputEvent, inputEvent->getEventCode());\t\t\t\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\nCore *CoreServices::getCore() {\n\treturn core;\n}\n\n\nvoid CoreServices::setRenderer(Renderer *renderer) {\n\tthis->renderer = renderer;\n}\n\nRenderer *CoreServices::getRenderer() {\n\treturn renderer;\n}\n\nvoid CoreServices::Update(int elapsed) {\n\ttimerManager->Update();\n\ttweenManager->Update();\n\tmaterialManager->Update(elapsed);\n\trenderer->setPerspectiveMode();\n\tsceneManager->UpdateVirtual();\n\trenderer->clearScreen();\n\tsceneManager->Update();\n\/\/\trenderer->setOrthoMode();\n\tscreenManager->Update();\n}\n\nSoundManager *CoreServices::getSoundManager() {\n\treturn soundManager;\n}\n\nScreenManager *CoreServices::getScreenManager() {\n\treturn screenManager;\n}\n\nSceneManager *CoreServices::getSceneManager() {\n\treturn sceneManager;\n}\n\nTweenManager *CoreServices::getTweenManager() {\n\treturn tweenManager;\n}\n\nResourceManager *CoreServices::getResourceManager() {\n\treturn resourceManager;\n}\n\nvoid CoreServices::getScreenInfo(int *width, int *height, int *hz) {\n#if defined(_WINDOWS)\n\t\n\tDEVMODE mode = {.dmSize = sizeof(DEVMODE), .dmDriverExtra = 0};\n\t\n    EnumDisplaySettings(0, ENUM_CURRENT_SETTINGS, &mode);\n\t\n    \/\/ Store the current display settings.\n    if (width) *width = mode.dmPelsWidth;\n    if (height) *height = mode.dmPelsHeight;\n    if (hz) *hz = mode.dmDisplayFrequency;\n\t\n#elif defined(__APPLE__) && defined(__MACH__)\n\t\n\tCGDisplayModeRef mode = CGDisplayCopyDisplayMode(CGMainDisplayID());\n    \n    \/\/ Copy the relevant data.\n    if (width) *width = CGDisplayModeGetWidth(mode);\n    if (height) *height = CGDisplayModeGetHeight(mode);\n    if (hz) *hz = CGDisplayModeGetRefreshRate(mode);\n    \n    CGDisplayModeRelease(mode);\n\t\n#elif defined(__linux) || defined(__linux__) || defined(linux)\n\t\n\tSDL_Init(SDL_INIT_VIDEO); \/\/ Or GetVideoInfo will not work\n\tconst SDL_VideoInfo *video = SDL_GetVideoInfo();\n\tif (width) *width = video->current_w;\n\tif (height) *height = video->current_h;\n\tif (hz) *hz = 0;\n\t\n#else\n\t\n\tif (width) *width = 0;\n\tif (height) *height = 0;\n\tif (hz) *hz = 0;\n\t\n#endif\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"mitkPositionTracker.h\"\n\n#include <mitkBaseRenderer.h>\n#include <mitkDataTree.h>\n#include <mitkDisplayPositionEvent.h>\n#include \"mitkInteractionConst.h\"\n#include <mitkPointSet.h>\n#include <mitkRenderingManager.h>\n#include <mitkVector.h> \/\/ for PointDataType \n\n\nmitk::PositionTracker::PositionTracker(const char * type, mitk::OperationActor* operationActor)\n: mitk::StateMachine(type)\n{}\n\n\nbool mitk::PositionTracker::ExecuteAction(Action* action, mitk::StateEvent const* stateEvent)\n {\n\/\/  std::cout<<\"PositionTracker\";\n  bool ok = false;\n\t\n  const DisplayPositionEvent* displayPositionEvent = dynamic_cast<const DisplayPositionEvent*>(stateEvent->GetEvent());\n\n  mitk::DataTreeIteratorClone dtit;\n  mitk::DataTreeNode::Pointer  dtnode;\n if(displayPositionEvent!=NULL)\n {\n   if(stateEvent->GetEvent()->GetSender()!=NULL)\n   {\n     dtit = stateEvent->GetEvent()->GetSender()->GetData();\n   }\n   else\n   {\n     itkWarningMacro(<<\"StateEvent::GetSender()==NULL - setting timeInMS to 0\");\n     return false;\n   }\n\n\n   if (dtit.IsNull()) return false;\n\n   \/\/ looking for desired point set\n   bool isPointSet=false;\n   while( !dtit->IsAtEnd() )\n   {\n     dtnode = dtit->Get();\n     if ( dtnode->GetBoolProperty(\"inputdevice\",isPointSet) && isPointSet)\n     {\n       \/\/std::cout<<\"PointSet found!!!\"<<std::endl;\n       break;\n     }\n     ++dtit;\n   }\n\n   if ( dtit->IsAtEnd() ) return ok;\n\n   \/\/switch could be removed if no proper distinction is needed\n   switch (action->GetActionId())\n   {\n     case AcNEWPOINT:\n     case AcINITMOVEMENT:\n     case AcMOVEPOINT:\n     case AcMOVE:\n     case AcFINISHMOVEMENT:\n            if( isPointSet )\n            {\n              mitk::PointSet* ps = (mitk::PointSet*) dtnode->GetData();\n              int position = 0;\n              \n              if( ps->GetPointSet()->GetPoints()->IndexExists( position )) \/\/first element\n              {\n                ps->GetPointSet()->GetPoints()->SetElement( position, displayPositionEvent->GetWorldPosition());                            \n              }\n              else\n              {\n                mitk::PointSet::PointDataType pointData = {position , false \/*selected*\/, mitk::PTUNDEFINED};\n                ps->GetPointSet()->GetPointData()->InsertElement(position, pointData);\n                ps->GetPointSet()->GetPoints()->InsertElement(position, displayPositionEvent->GetWorldPosition());\n              }\n\n              dtnode->SetData(ps);\n              mitk::RenderingManager::GetInstance()->RequestUpdateAll();\n            }\n            \n            ok = true;\n            break;\n     case AcREMOVEPOINT:\n       \/\/rmv\n       std::cout<<\"PosTrack: AcREMOVEPOINT\"<<std::endl;\n     default:\n       ok = false;\n       break;\n   }\n   \n }\n\treturn ok;\n}\n<commit_msg>FIX warning unused parameter<commit_after>#include <mitkPositionTracker.h>\n\n#include <mitkBaseRenderer.h>\n#include <mitkDataTree.h>\n#include <mitkDisplayPositionEvent.h>\n#include <mitkInteractionConst.h>\n#include <mitkPointSet.h>\n#include <mitkRenderingManager.h>\n#include <mitkVector.h> \/\/ for PointDataType \n\n\nmitk::PositionTracker::PositionTracker(const char * type, mitk::OperationActor* \/*operationActor*\/)\n: mitk::StateMachine(type)\n{}\n\n\nbool mitk::PositionTracker::ExecuteAction(Action* action, mitk::StateEvent const* stateEvent)\n {\n  bool ok = false;\n\t\n  const DisplayPositionEvent* displayPositionEvent = dynamic_cast<const DisplayPositionEvent*>(stateEvent->GetEvent());\n\n  mitk::DataTreeIteratorClone dtit;\n  mitk::DataTreeNode::Pointer  dtnode;\n if(displayPositionEvent!=NULL)\n {\n   if(stateEvent->GetEvent()->GetSender()!=NULL)\n   {\n     dtit = stateEvent->GetEvent()->GetSender()->GetData();\n   }\n   else\n   {\n     itkWarningMacro(<<\"StateEvent::GetSender()==NULL - setting timeInMS to 0\");\n     return false;\n   }\n\n\n   if (dtit.IsNull()) return false;\n\n   \/\/ looking for desired point set\n   bool isPointSet=false;\n   while( !dtit->IsAtEnd() )\n   {\n     dtnode = dtit->Get();\n     if ( dtnode->GetBoolProperty(\"inputdevice\",isPointSet) && isPointSet)\n     {\n       \/\/std::cout<<\"PointSet found!!!\"<<std::endl;\n       break;\n     }\n     ++dtit;\n   }\n\n   if ( dtit->IsAtEnd() ) return ok;\n\n   \/\/switch could be removed if no proper distinction is needed\n   switch (action->GetActionId())\n   {\n     case AcNEWPOINT:\n     case AcINITMOVEMENT:\n     case AcMOVEPOINT:\n     case AcMOVE:\n     case AcFINISHMOVEMENT:\n            if( isPointSet )\n            {\n              mitk::PointSet* ps = (mitk::PointSet*) dtnode->GetData();\n              int position = 0;\n              \n              if( ps->GetPointSet()->GetPoints()->IndexExists( position )) \/\/first element\n              {\n                ps->GetPointSet()->GetPoints()->SetElement( position, displayPositionEvent->GetWorldPosition());                            \n              }\n              else\n              {\n                mitk::PointSet::PointDataType pointData = {position , false \/*selected*\/, mitk::PTUNDEFINED};\n                ps->GetPointSet()->GetPointData()->InsertElement(position, pointData);\n                ps->GetPointSet()->GetPoints()->InsertElement(position, displayPositionEvent->GetWorldPosition());\n              }\n\n              dtnode->SetData(ps);\n              mitk::RenderingManager::GetInstance()->RequestUpdateAll();\n            }\n            \n            ok = true;\n            break;\n     case AcREMOVEPOINT:\n       \/\/rmv\n       std::cout<<\"PosTrack: AcREMOVEPOINT\"<<std::endl;\n     default:\n       ok = false;\n       break;\n   }\n   \n }\n\treturn ok;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/***********************************************************************************************************************\n**\n** Copyright (c) 2011, 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\n#include \"DeclarationVisitor.h\"\n#include \"ExpressionVisitor.h\"\n#include \"StatementVisitor.h\"\n#include \"ElementVisitor.h\"\n\n#include \"OOModel\/src\/elements\/FormalArgument.h\"\n#include \"OOModel\/src\/elements\/FormalMetaArgument.h\"\n#include \"OOModel\/src\/elements\/FormalResult.h\"\n#include \"OOModel\/src\/elements\/FormalTypeArgument.h\"\n#include \"OOModel\/src\/elements\/CatchClause.h\"\n#include \"OOModel\/src\/elements\/Enumerator.h\"\n#include \"OOModel\/src\/elements\/MemberInitializer.h\"\n#include \"OOModel\/src\/expressions\/types\/PointerTypeExpression.h\"\n#include \"OOModel\/src\/expressions\/types\/FunctionTypeExpression.h\"\n#include \"OOModel\/src\/expressions\/types\/ArrayTypeExpression.h\"\n\nusing namespace Export;\nusing namespace OOModel;\n\nnamespace CppExport {\n\nSourceFragment* ElementVisitor::visit(FormalArgument* argument)\n{\n\tauto fragment = new CompositeFragment(argument);\n\n\tauto pointerTypeExpression = DCast<PointerTypeExpression>(argument->typeExpression());\n\tif (pointerTypeExpression && DCast<FunctionTypeExpression>(pointerTypeExpression->typeExpression()))\n\t\t*fragment << ExpressionVisitor(data()).visitFunctionPointer(pointerTypeExpression, argument->name());\n\telse if (auto arrayTypeExpression = DCast<ArrayTypeExpression>(argument->typeExpression()))\n\t\t*fragment << expression(arrayTypeExpression->typeExpression()) << \" \" << argument->nameNode() << \"[]\";\n\telse\n\t\t*fragment << expression(argument->typeExpression()) << \" \" << argument->nameNode();\n\n\tif (headerVisitor() && argument->initialValue())\n\t\t*fragment << \" = \" << ExpressionVisitor(data()).visit(argument->initialValue());\n\n\treturn fragment;\n}\n\nSourceFragment* ElementVisitor::visit(FormalMetaArgument* argument)\n{\n\tauto fragment = new CompositeFragment(argument);\n\t*fragment << argument->nameNode();\n\treturn fragment;\n}\n\nSourceFragment* ElementVisitor::visit(FormalResult* result)\n{\n\tauto fragment = new CompositeFragment(result);\n\t*fragment << \"RESULT\";\n\treturn fragment;\n}\n\nSourceFragment* ElementVisitor::visit(FormalTypeArgument* typeArgument)\n{\n\tauto fragment = new CompositeFragment(typeArgument);\n\t*fragment << \"typename \" << typeArgument->nameNode();\n\treturn fragment;\n}\n\nSourceFragment* ElementVisitor::visit(CatchClause* catchClause)\n{\n\tauto fragment = new CompositeFragment(catchClause);\n\n\trequired(catchClause, catchClause->exceptionToCatch(), \"Exception type to catch\");\n\n\t*fragment << \"catch (\";\n\tif (catchClause->exceptionToCatch()) *fragment << expression(catchClause->exceptionToCatch());\n\t*fragment << \")\";\n\t*fragment << list(catchClause->body(), StatementVisitor(data()), \"body\");\n\n\treturn fragment;\n}\n\nSourceFragment* ElementVisitor::visit(Enumerator* enumerator)\n{\n\tauto fragment = new CompositeFragment(enumerator);\n\t*fragment << enumerator->name();\n\tif (auto value = enumerator->value())\n\t{\n\t\t*fragment << \" = \" << expression(value);\n\t}\n\treturn fragment;\n}\n\nSourceFragment* ElementVisitor::visit(MemberInitializer* memberInitializer)\n{\n\tauto fragment = new CompositeFragment(memberInitializer);\n\t*fragment << expression(memberInitializer->memberReference())\n\t\t\t\t << list(memberInitializer->arguments(), ExpressionVisitor(data()), \"initializerList\");\n\treturn fragment;\n}\n\n}\n<commit_msg>fix formal result export<commit_after>\/***********************************************************************************************************************\n**\n** Copyright (c) 2011, 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\n#include \"DeclarationVisitor.h\"\n#include \"ExpressionVisitor.h\"\n#include \"StatementVisitor.h\"\n#include \"ElementVisitor.h\"\n\n#include \"OOModel\/src\/elements\/FormalArgument.h\"\n#include \"OOModel\/src\/elements\/FormalMetaArgument.h\"\n#include \"OOModel\/src\/elements\/FormalResult.h\"\n#include \"OOModel\/src\/elements\/FormalTypeArgument.h\"\n#include \"OOModel\/src\/elements\/CatchClause.h\"\n#include \"OOModel\/src\/elements\/Enumerator.h\"\n#include \"OOModel\/src\/elements\/MemberInitializer.h\"\n#include \"OOModel\/src\/expressions\/types\/PointerTypeExpression.h\"\n#include \"OOModel\/src\/expressions\/types\/FunctionTypeExpression.h\"\n#include \"OOModel\/src\/expressions\/types\/ArrayTypeExpression.h\"\n\nusing namespace Export;\nusing namespace OOModel;\n\nnamespace CppExport {\n\nSourceFragment* ElementVisitor::visit(FormalArgument* argument)\n{\n\tauto fragment = new CompositeFragment(argument);\n\n\tauto pointerTypeExpression = DCast<PointerTypeExpression>(argument->typeExpression());\n\tif (pointerTypeExpression && DCast<FunctionTypeExpression>(pointerTypeExpression->typeExpression()))\n\t\t*fragment << ExpressionVisitor(data()).visitFunctionPointer(pointerTypeExpression, argument->name());\n\telse if (auto arrayTypeExpression = DCast<ArrayTypeExpression>(argument->typeExpression()))\n\t\t*fragment << expression(arrayTypeExpression->typeExpression()) << \" \" << argument->nameNode() << \"[]\";\n\telse\n\t\t*fragment << expression(argument->typeExpression()) << \" \" << argument->nameNode();\n\n\tif (headerVisitor() && argument->initialValue())\n\t\t*fragment << \" = \" << ExpressionVisitor(data()).visit(argument->initialValue());\n\n\treturn fragment;\n}\n\nSourceFragment* ElementVisitor::visit(FormalMetaArgument* argument)\n{\n\tauto fragment = new CompositeFragment(argument);\n\t*fragment << argument->nameNode();\n\treturn fragment;\n}\n\nSourceFragment* ElementVisitor::visit(FormalResult* result)\n{\n\tauto fragment = new CompositeFragment(result);\n\t*fragment << expression(result->typeExpression());\n\treturn fragment;\n}\n\nSourceFragment* ElementVisitor::visit(FormalTypeArgument* typeArgument)\n{\n\tauto fragment = new CompositeFragment(typeArgument);\n\t*fragment << \"typename \" << typeArgument->nameNode();\n\treturn fragment;\n}\n\nSourceFragment* ElementVisitor::visit(CatchClause* catchClause)\n{\n\tauto fragment = new CompositeFragment(catchClause);\n\n\trequired(catchClause, catchClause->exceptionToCatch(), \"Exception type to catch\");\n\n\t*fragment << \"catch (\";\n\tif (catchClause->exceptionToCatch()) *fragment << expression(catchClause->exceptionToCatch());\n\t*fragment << \")\";\n\t*fragment << list(catchClause->body(), StatementVisitor(data()), \"body\");\n\n\treturn fragment;\n}\n\nSourceFragment* ElementVisitor::visit(Enumerator* enumerator)\n{\n\tauto fragment = new CompositeFragment(enumerator);\n\t*fragment << enumerator->name();\n\tif (auto value = enumerator->value())\n\t{\n\t\t*fragment << \" = \" << expression(value);\n\t}\n\treturn fragment;\n}\n\nSourceFragment* ElementVisitor::visit(MemberInitializer* memberInitializer)\n{\n\tauto fragment = new CompositeFragment(memberInitializer);\n\t*fragment << expression(memberInitializer->memberReference())\n\t\t\t\t << list(memberInitializer->arguments(), ExpressionVisitor(data()), \"initializerList\");\n\treturn fragment;\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**************************************************************************\n *\n * Copyright 2010 VMware, Inc.\n * All Rights Reserved.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *\n **************************************************************************\/\n\n\/*\n * Helpers for coloring output.\n *\/\n\n#ifndef _FORMATTER_HPP_\n#define _FORMATTER_HPP_\n\n\n#include <iostream>\n\n\nnamespace formatter {\n\n\/*\n * See also http:\/\/bytes.com\/topic\/c\/answers\/63822-design-question-little-c-header-colorizing-text-linux-comments-ideas\n *\/\n\nclass Attribute {\npublic:\n    virtual ~Attribute() {}\n\n    virtual void apply(std::ostream &) const {}\n};\n\n\nenum Color {\n    RED,\n    GREEN,\n    BLUE,\n};\n\n\nclass Formatter {\npublic:\n    virtual ~Formatter() {}\n\n    virtual Attribute *normal(void) const { return new Attribute; }\n    virtual Attribute *bold(void) const { return new Attribute; }\n    virtual Attribute *italic(void) const { return new Attribute; }\n    virtual Attribute *strike(void) const { return new Attribute; }\n    virtual Attribute *color(Color) const { return new Attribute; }\n};\n\n\nclass AnsiAttribute : public Attribute {\nprotected:\n    const char *escape;\npublic:\n    AnsiAttribute(const char *_escape) : escape(_escape) {}\n    void apply(std::ostream& os) const {\n        os << \"\\33[\" << escape;\n    }\n};\n\n\n\/**\n * Formatter for plain-text files which outputs ANSI escape codes. See\n * http:\/\/en.wikipedia.org\/wiki\/ANSI_escape_code for more information\n * concerning ANSI escape codes.\n *\/\nclass AnsiFormatter : public Formatter {\nprotected:\npublic:\n    virtual Attribute *normal(void) const { return new AnsiAttribute(\"0m\"); }\n    virtual Attribute *bold(void) const { return new AnsiAttribute(\"1m\"); }\n    virtual Attribute *italic(void) const { return new AnsiAttribute(\"3m\"); }\n    virtual Attribute *strike(void) const { return new AnsiAttribute(\"9m\"); }\n    virtual Attribute *color(Color c) const { \n        static const char *color_escapes[] = {\n            \"31m\", \/* red *\/\n            \"32m\", \/* green *\/\n            \"34m\", \/* blue *\/\n        };\n        return new AnsiAttribute(color_escapes[c]); \n    }\n};\n\n\ninline std::ostream& operator<<(std::ostream& os, const Attribute *attr) {\n    attr->apply(os);\n    return os;\n}\n\n\n#ifdef _WIN32\n\n\n#include <windows.h>\n\n\n#ifndef COMMON_LVB_LEADING_BYTE\n#define COMMON_LVB_LEADING_BYTE    0x0100\n#endif\n\n#ifndef COMMON_LVB_TRAILING_BYTE\n#define COMMON_LVB_TRAILING_BYTE   0x0200\n#endif\n\n#ifndef COMMON_LVB_GRID_HORIZONTAL\n#define COMMON_LVB_GRID_HORIZONTAL 0x0400\n#endif\n\n#ifndef COMMON_LVB_GRID_LVERTICAL\n#define COMMON_LVB_GRID_LVERTICAL  0x0800\n#endif\n\n#ifndef COMMON_LVB_GRID_RVERTICAL\n#define COMMON_LVB_GRID_RVERTICAL  0x1000\n#endif\n\n#ifndef COMMON_LVB_REVERSE_VIDEO\n#define COMMON_LVB_REVERSE_VIDEO   0x4000\n#endif\n\n#ifndef COMMON_LVB_UNDERSCORE\n#define COMMON_LVB_UNDERSCORE      0x8000\n#endif\n\n\nclass WindowsAttribute : public Attribute {\nprotected:\n    WORD wAttributes;\npublic:\n    WindowsAttribute(WORD _wAttributes) : wAttributes(_wAttributes) {}\n    void apply(std::ostream& os) const {\n        DWORD nStdHandleOutput;\n        if (os == std::cout) {\n            nStdHandleOutput = STD_OUTPUT_HANDLE;\n        } else if (os == std::cerr) {\n            nStdHandleOutput = STD_ERROR_HANDLE;\n        } else {\n            return;\n        }\n        HANDLE hConsoleOutput = GetStdHandle(nStdHandleOutput);\n        if (hConsoleOutput == INVALID_HANDLE_VALUE) {\n            return;\n        }\n\n        SetConsoleTextAttribute(hConsoleOutput, wAttributes);\n    }\n};\n\n\n\/**\n * Formatter for the Windows Console.\n *\/\nclass WindowsFormatter : public Formatter {\nprotected:\npublic:\n    virtual Attribute *normal(void) const { return new WindowsAttribute(FOREGROUND_BLUE | FOREGROUND_GREEN | FOREGROUND_RED); }\n    virtual Attribute *bold(void) const { return new WindowsAttribute(FOREGROUND_BLUE | FOREGROUND_GREEN | FOREGROUND_RED | FOREGROUND_INTENSITY); }\n    virtual Attribute *italic(void) const { return new WindowsAttribute(FOREGROUND_BLUE | FOREGROUND_GREEN | FOREGROUND_RED); }\n    virtual Attribute *strike(void) const { return new WindowsAttribute(COMMON_LVB_REVERSE_VIDEO | FOREGROUND_BLUE | FOREGROUND_GREEN | FOREGROUND_RED); }\n    virtual Attribute *color(Color c) const { \n        static const WORD color_escapes[] = {\n            FOREGROUND_RED | FOREGROUND_INTENSITY,\n            FOREGROUND_GREEN | FOREGROUND_INTENSITY,\n            FOREGROUND_BLUE | FOREGROUND_INTENSITY, \n        };\n        return new WindowsAttribute(color_escapes[c]); \n    }\n};\n\n#endif\n\n\ninline Formatter *defaultFormatter(bool color = true) {\n    if (color) {\n#ifdef _WIN32\n        return new WindowsFormatter;\n#else\n        return new AnsiFormatter;\n#endif\n    } else {\n        return new Formatter;\n    }\n}\n\n\n} \/* namespace formatter *\/\n\n\n#endif \/* _FORMATTER_HPP_ *\/\n<commit_msg>Disable italic ansi escape.<commit_after>\/**************************************************************************\n *\n * Copyright 2010 VMware, Inc.\n * All Rights Reserved.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *\n **************************************************************************\/\n\n\/*\n * Helpers for coloring output.\n *\/\n\n#ifndef _FORMATTER_HPP_\n#define _FORMATTER_HPP_\n\n\n#include <iostream>\n\n\nnamespace formatter {\n\n\/*\n * See also http:\/\/bytes.com\/topic\/c\/answers\/63822-design-question-little-c-header-colorizing-text-linux-comments-ideas\n *\/\n\nclass Attribute {\npublic:\n    virtual ~Attribute() {}\n\n    virtual void apply(std::ostream &) const {}\n};\n\n\nenum Color {\n    RED,\n    GREEN,\n    BLUE,\n};\n\n\nclass Formatter {\npublic:\n    virtual ~Formatter() {}\n\n    virtual Attribute *normal(void) const { return new Attribute; }\n    virtual Attribute *bold(void) const { return new Attribute; }\n    virtual Attribute *italic(void) const { return new Attribute; }\n    virtual Attribute *strike(void) const { return new Attribute; }\n    virtual Attribute *color(Color) const { return new Attribute; }\n};\n\n\nclass AnsiAttribute : public Attribute {\nprotected:\n    const char *escape;\npublic:\n    AnsiAttribute(const char *_escape) : escape(_escape) {}\n    void apply(std::ostream& os) const {\n        os << \"\\33[\" << escape;\n    }\n};\n\n\n\/**\n * Formatter for plain-text files which outputs ANSI escape codes. See\n * http:\/\/en.wikipedia.org\/wiki\/ANSI_escape_code for more information\n * concerning ANSI escape codes.\n *\/\nclass AnsiFormatter : public Formatter {\nprotected:\npublic:\n    virtual Attribute *normal(void) const { return new AnsiAttribute(\"0m\"); }\n    virtual Attribute *bold(void) const { return new AnsiAttribute(\"1m\"); }\n    \/* Italic is not widely supported, or worse, implemented with a reverse *\/\n#if 0\n    virtual Attribute *italic(void) const { return new AnsiAttribute(\"3m\"); }\n#endif\n    virtual Attribute *strike(void) const { return new AnsiAttribute(\"9m\"); }\n    virtual Attribute *color(Color c) const { \n        static const char *color_escapes[] = {\n            \"31m\", \/* red *\/\n            \"32m\", \/* green *\/\n            \"34m\", \/* blue *\/\n        };\n        return new AnsiAttribute(color_escapes[c]); \n    }\n};\n\n\ninline std::ostream& operator<<(std::ostream& os, const Attribute *attr) {\n    attr->apply(os);\n    return os;\n}\n\n\n#ifdef _WIN32\n\n\n#include <windows.h>\n\n\n#ifndef COMMON_LVB_LEADING_BYTE\n#define COMMON_LVB_LEADING_BYTE    0x0100\n#endif\n\n#ifndef COMMON_LVB_TRAILING_BYTE\n#define COMMON_LVB_TRAILING_BYTE   0x0200\n#endif\n\n#ifndef COMMON_LVB_GRID_HORIZONTAL\n#define COMMON_LVB_GRID_HORIZONTAL 0x0400\n#endif\n\n#ifndef COMMON_LVB_GRID_LVERTICAL\n#define COMMON_LVB_GRID_LVERTICAL  0x0800\n#endif\n\n#ifndef COMMON_LVB_GRID_RVERTICAL\n#define COMMON_LVB_GRID_RVERTICAL  0x1000\n#endif\n\n#ifndef COMMON_LVB_REVERSE_VIDEO\n#define COMMON_LVB_REVERSE_VIDEO   0x4000\n#endif\n\n#ifndef COMMON_LVB_UNDERSCORE\n#define COMMON_LVB_UNDERSCORE      0x8000\n#endif\n\n\nclass WindowsAttribute : public Attribute {\nprotected:\n    WORD wAttributes;\npublic:\n    WindowsAttribute(WORD _wAttributes) : wAttributes(_wAttributes) {}\n    void apply(std::ostream& os) const {\n        DWORD nStdHandleOutput;\n        if (os == std::cout) {\n            nStdHandleOutput = STD_OUTPUT_HANDLE;\n        } else if (os == std::cerr) {\n            nStdHandleOutput = STD_ERROR_HANDLE;\n        } else {\n            return;\n        }\n        HANDLE hConsoleOutput = GetStdHandle(nStdHandleOutput);\n        if (hConsoleOutput == INVALID_HANDLE_VALUE) {\n            return;\n        }\n\n        SetConsoleTextAttribute(hConsoleOutput, wAttributes);\n    }\n};\n\n\n\/**\n * Formatter for the Windows Console.\n *\/\nclass WindowsFormatter : public Formatter {\nprotected:\npublic:\n    virtual Attribute *normal(void) const { return new WindowsAttribute(FOREGROUND_BLUE | FOREGROUND_GREEN | FOREGROUND_RED); }\n    virtual Attribute *bold(void) const { return new WindowsAttribute(FOREGROUND_BLUE | FOREGROUND_GREEN | FOREGROUND_RED | FOREGROUND_INTENSITY); }\n    virtual Attribute *italic(void) const { return new WindowsAttribute(FOREGROUND_BLUE | FOREGROUND_GREEN | FOREGROUND_RED); }\n    virtual Attribute *strike(void) const { return new WindowsAttribute(COMMON_LVB_REVERSE_VIDEO | FOREGROUND_BLUE | FOREGROUND_GREEN | FOREGROUND_RED); }\n    virtual Attribute *color(Color c) const { \n        static const WORD color_escapes[] = {\n            FOREGROUND_RED | FOREGROUND_INTENSITY,\n            FOREGROUND_GREEN | FOREGROUND_INTENSITY,\n            FOREGROUND_BLUE | FOREGROUND_INTENSITY, \n        };\n        return new WindowsAttribute(color_escapes[c]); \n    }\n};\n\n#endif\n\n\ninline Formatter *defaultFormatter(bool color = true) {\n    if (color) {\n#ifdef _WIN32\n        return new WindowsFormatter;\n#else\n        return new AnsiFormatter;\n#endif\n    } else {\n        return new Formatter;\n    }\n}\n\n\n} \/* namespace formatter *\/\n\n\n#endif \/* _FORMATTER_HPP_ *\/\n<|endoftext|>"}
{"text":"<commit_before>\/* BEGIN_COMMON_COPYRIGHT_HEADER\n * (c)LGPL2+\n *\n * LXDE-Qt - a lightweight, Qt based, desktop toolset\n * http:\/\/razor-qt.org\n *\n * Copyright: 2010-2011 Razor team\n * Authors:\n *   Alexander Sokoloff <sokoloff.a@gmail.com>\n *   Petr Vanek <petr@scribus.info>\n *\n * This program or library is free software; you can redistribute it\n * and\/or modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n * Lesser General Public License for more details.\n\n * You should have received a copy of the GNU Lesser General\n * Public License along with this library; if not, write to the\n * Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,\n * Boston, MA 02110-1301 USA\n *\n * END_COMMON_COPYRIGHT_HEADER *\/\n\n#include \"dialog.h\"\n#include \"ui_dialog.h\"\n#include \"widgets.h\"\n#include \"commanditemmodel.h\"\n#include \"configuredialog\/configuredialog.h\"\n\n#include <LXQt\/Settings>\n#include <XdgIcon>\n#include <LXQt\/PowerManager>\n#include <LXQt\/ScreenSaver>\n#include <LXQtGlobalKeys\/Action>\n#include <LXQtGlobalKeys\/Client>\n#include <QDebug>\n#include <QCloseEvent>\n#include <QDesktopWidget>\n#include <QProcess>\n#include <QLineEdit>\n#include <QAction>\n#include <QMessageBox>\n#include <QApplication>\n#include <QMenu>\n#include <QWindow>\n#include <QScrollBar>\n\n#include <KF5\/KWindowSystem\/KWindowSystem>\n\n#define DEFAULT_SHORTCUT \"Alt+F2\"\n\n\/************************************************\n\n ************************************************\/\nDialog::Dialog(QWidget *parent) :\n    QDialog(parent, Qt::Dialog | Qt::WindowStaysOnTopHint | Qt::CustomizeWindowHint),\n    ui(new Ui::Dialog),\n    mSettings(new LxQt::Settings(\"lxqt-runner\", this)),\n    mGlobalShortcut(0),\n    mLockCascadeChanges(false),\n    mConfigureDialog(0)\n{\n    ui->setupUi(this);\n    setWindowTitle(\"LXQt Runner\");\n    setAttribute(Qt::WA_TranslucentBackground);\n\n    connect(LxQt::Settings::globalSettings(), SIGNAL(iconThemeChanged()), this, SLOT(update()));\n    connect(ui->closeButton, SIGNAL(clicked()), this, SLOT(hide()));\n    connect(mSettings, SIGNAL(settingsChanged()), this, SLOT(applySettings()));\n\n    ui->commandEd->installEventFilter(this);\n\n    connect(ui->commandEd, SIGNAL(textChanged(QString)), this, SLOT(setFilter(QString)));\n    connect(ui->commandEd, SIGNAL(returnPressed()), this, SLOT(runCommand()));\n\n    mCommandItemModel = new CommandItemModel(this);\n    ui->commandList->installEventFilter(this);\n    ui->commandList->setModel(mCommandItemModel);\n    ui->commandList->setEditTriggers(QAbstractItemView::NoEditTriggers);\n    connect(ui->commandList, SIGNAL(clicked(QModelIndex)), this, SLOT(runCommand()));\n    setFilter(\"\");\n    dataChanged();\n\n    ui->commandList->setItemDelegate(new HtmlDelegate(QSize(32, 32), ui->commandList));\n\n    \/\/ Popup menu ...............................\n    QAction *a = new QAction(XdgIcon::fromTheme(\"configure\"), tr(\"Configure\"), this);\n    connect(a, SIGNAL(triggered()), this, SLOT(showConfigDialog()));\n    addAction(a);\n\n    a = new QAction(XdgIcon::fromTheme(\"edit-clear-history\"), tr(\"Clear History\"), this);\n    connect(a, SIGNAL(triggered()), mCommandItemModel, SLOT(clearHistory()));\n    addAction(a);\n\n    mPowerManager = new LxQt::PowerManager(this);\n    addActions(mPowerManager->availableActions());\n    mScreenSaver = new LxQt::ScreenSaver(this);\n    addActions(mScreenSaver->availableActions());\n\n    setContextMenuPolicy(Qt::ActionsContextMenu);\n\n    QMenu *menu = new QMenu(this);\n    menu->addActions(actions());\n    ui->actionButton->setMenu(menu);\n    ui->actionButton->setIcon(XdgIcon::fromTheme(\"configure\"));\n    \/\/ End of popup menu ........................\n\n    applySettings();\n\n    connect(QApplication::desktop(), SIGNAL(screenCountChanged(int)), SLOT(realign()));\n    connect(QApplication::desktop(), SIGNAL(workAreaResized(int)), SLOT(realign()));\n    connect(mGlobalShortcut, SIGNAL(activated()), this, SLOT(showHide()));\n    connect(mGlobalShortcut, SIGNAL(shortcutChanged(QString,QString)), this, SLOT(shortcutChanged(QString,QString)));\n\n    resize(mSettings->value(\"dialog\/width\", 400).toInt(), size().height());\n\n\n    \/\/ TEST\n    connect(mCommandItemModel, SIGNAL(layoutChanged()), this, SLOT(dataChanged()));\n}\n\n\n\/************************************************\n\n ************************************************\/\nDialog::~Dialog()\n{\n    delete ui;\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::closeEvent(QCloseEvent *event)\n{\n    hide();\n    event->ignore();\n}\n\n\n\/************************************************\n\n ************************************************\/\nQSize Dialog::sizeHint() const\n{\n    QSize size = QDialog::sizeHint();\n    size.setWidth(this->size().width());\n    return size;\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::resizeEvent(QResizeEvent *event)\n{\n    mSettings->setValue(\"dialog\/width\", size().width());\n}\n\n\n\/************************************************\n\n ************************************************\/\nbool Dialog::eventFilter(QObject *object, QEvent *event)\n{\n    if (event->type() == QEvent::KeyPress)\n    {\n        QKeyEvent *keyEvent = static_cast<QKeyEvent*>(event);\n\n        if (object == ui->commandEd)\n            return editKeyPressEvent(keyEvent);\n\n        if (object == ui->commandList)\n            return listKeyPressEvent(keyEvent);\n    }\n\n    return QDialog::eventFilter(object, event);\n}\n\n\n\/************************************************\n eventFilter for ui->commandEd\n ************************************************\/\nbool Dialog::editKeyPressEvent(QKeyEvent *event)\n{\n    switch (event->key())\n    {\n    case Qt::Key_N:\n        if (event->modifiers().testFlag(Qt::ControlModifier))\n        {\n            QKeyEvent ev(QEvent::KeyPress, Qt::Key_Down, Qt::NoModifier);\n            editKeyPressEvent(&ev);\n            return true;\n        }\n            return false;\n\n    case Qt::Key_P:\n        if (event->modifiers().testFlag(Qt::ControlModifier))\n        {\n            QKeyEvent ev(QEvent::KeyPress, Qt::Key_Up, Qt::NoModifier);\n            editKeyPressEvent(&ev);\n            return true;\n        }\n            return false;\n\n    case Qt::Key_Up:\n    case Qt::Key_PageUp:\n        if (ui->commandEd->text().isEmpty() &&\n            ui->commandList->isVisible() &&\n            ui->commandList->currentIndex().row() == 0\n           )\n        {\n            setFilter(\"\", false);\n            return true;\n        }\n        qApp->sendEvent(ui->commandList, event);\n        return true;\n\n    case Qt::Key_Down:\n    case Qt::Key_PageDown:\n        if (ui->commandEd->text().isEmpty() &&\n            ui->commandList->isHidden()\n           )\n        {\n            setFilter(\"\", true);\n            return true;\n        }\n\n        qApp->sendEvent(ui->commandList, event);\n        return true;\n    }\n\n    return QDialog::eventFilter(ui->commandList, event);\n}\n\n\n\/************************************************\n eventFilter for ui->commandList\n ************************************************\/\nbool Dialog::listKeyPressEvent(QKeyEvent *event)\n{\n    switch (event->key())\n    {\n    case Qt::Key_Up:\n    case Qt::Key_PageUp:\n        if (ui->commandList->currentIndex().row() == 0)\n        {\n            ui->commandEd->setFocus();\n            return true;\n        }\n        break;\n\n    case Qt::Key_Left:\n    case Qt::Key_Right:\n        ui->commandEd->setFocus();\n        qApp->sendEvent(ui->commandEd, event);\n        return true;\n\n    default:\n        \/\/ Alphabetical or number key ...........\n        if (!event->text().isEmpty())\n        {\n            ui->commandEd->setFocus();\n            qApp->sendEvent(ui->commandEd, event);\n            return true;\n        }\n    }\n\n    return QDialog::eventFilter(ui->commandEd, event);\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::showHide()\n{\n    if (isVisible() && isActiveWindow())\n    {\n        hide();\n    }\n    else\n    {\n        realign();\n        show();\n        KWindowSystem::forceActiveWindow(windowHandle()->winId());\n        ui->commandEd->setFocus(Qt::ShortcutFocusReason);\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::realign()\n{\n    QRect desktop;\n\n    int screen = mMonitor;\n    if (mMonitor < 0 || mMonitor > QApplication::desktop()->screenCount() - 1)\n        screen = QApplication::desktop()->screenNumber(QCursor::pos());\n\n    desktop = QApplication::desktop()->availableGeometry(screen).intersected(KWindowSystem::workArea(screen));\n\n    QRect rect = this->geometry();\n    rect.moveCenter(desktop.center());\n\n    if (mShowOnTop)\n        rect.moveTop(desktop.top());\n    else\n        rect.moveTop(desktop.center().y() - ui->panel->sizeHint().height());\n\n    setGeometry(rect);\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::applySettings()\n{\n    if (mLockCascadeChanges)\n        return;\n\n    \/\/ Shortcut .................................\n    QString shortcut = mSettings->value(\"dialog\/shortcut\", DEFAULT_SHORTCUT).toString();\n    if (shortcut.isEmpty())\n        shortcut = DEFAULT_SHORTCUT;\n\n    if (!mGlobalShortcut)\n        mGlobalShortcut = GlobalKeyShortcut::Client::instance()->addAction(shortcut, \"\/runner\/show_hide_dialog\", tr(\"Show\/hide runner dialog\"), this);\n    else if (mGlobalShortcut->shortcut() != shortcut)\n        mGlobalShortcut->changeShortcut(shortcut);\n\n    mShowOnTop = mSettings->value(\"dialog\/show_on_top\", true).toBool();\n\n    mMonitor = mSettings->value(\"dialog\/monitor\", -1).toInt();\n\n    realign();\n    mSettings->sync();\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::shortcutChanged(const QString &\/*oldShortcut*\/, const QString &newShortcut)\n{\n    if (!newShortcut.isEmpty())\n    {\n        mLockCascadeChanges = true;\n\n        mSettings->setValue(\"dialog\/shortcut\", newShortcut);\n        mSettings->sync();\n\n        mLockCascadeChanges = false;\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::setFilter(const QString &text, bool onlyHistory)\n{\n    qDebug() << \"Ind i setFilter...\";\n    if (mCommandItemModel->isOutDated())\n        mCommandItemModel->rebuild();\n\n    QString trimmedText = text.simplified();\n    mCommandItemModel->setCommand(trimmedText);\n    mCommandItemModel->showOnlyHistory(onlyHistory);\n    mCommandItemModel->setFilterWildcard(trimmedText);\n    mCommandItemModel->sort(0);\n}\n\nvoid Dialog::dataChanged()\n{\n    if (mCommandItemModel->rowCount())\n    {\n       ui->commandList->setCurrentIndex(mCommandItemModel->appropriateItem(mCommandItemModel->command()));\n        ui->commandList->scrollTo(ui->commandList->currentIndex());\n        ui->commandList->show();\n    }\n    else\n    {\n        ui->commandList->hide();\n    }\n\n    adjustSize();\n\n}\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::runCommand()\n{\n    bool res =false;\n    const CommandProviderItem *command = mCommandItemModel->command(ui->commandList->currentIndex());\n\n    if (command)\n        res = command->run();\n\n    if (res)\n    {\n        hide();\n        ui->commandEd->clear();\n    }\n\n}\n\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::showConfigDialog()\n{\n    if (!mConfigureDialog)\n        mConfigureDialog = new ConfigureDialog(mSettings, DEFAULT_SHORTCUT, this);\n    mConfigureDialog->exec();\n}\n\n#undef DEFAULT_SHORTCUT\n<commit_msg>Fixes dialog type, alt+tab won't focus it<commit_after>\/* BEGIN_COMMON_COPYRIGHT_HEADER\n * (c)LGPL2+\n *\n * LXDE-Qt - a lightweight, Qt based, desktop toolset\n * http:\/\/razor-qt.org\n *\n * Copyright: 2010-2011 Razor team\n * Authors:\n *   Alexander Sokoloff <sokoloff.a@gmail.com>\n *   Petr Vanek <petr@scribus.info>\n *\n * This program or library is free software; you can redistribute it\n * and\/or modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n * Lesser General Public License for more details.\n\n * You should have received a copy of the GNU Lesser General\n * Public License along with this library; if not, write to the\n * Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,\n * Boston, MA 02110-1301 USA\n *\n * END_COMMON_COPYRIGHT_HEADER *\/\n\n#include \"dialog.h\"\n#include \"ui_dialog.h\"\n#include \"widgets.h\"\n#include \"commanditemmodel.h\"\n#include \"configuredialog\/configuredialog.h\"\n\n#include <LXQt\/Settings>\n#include <XdgIcon>\n#include <LXQt\/PowerManager>\n#include <LXQt\/ScreenSaver>\n#include <LXQtGlobalKeys\/Action>\n#include <LXQtGlobalKeys\/Client>\n#include <QDebug>\n#include <QCloseEvent>\n#include <QDesktopWidget>\n#include <QProcess>\n#include <QLineEdit>\n#include <QAction>\n#include <QMessageBox>\n#include <QApplication>\n#include <QMenu>\n#include <QWindow>\n#include <QScrollBar>\n\n#include <KF5\/KWindowSystem\/KWindowSystem>\n\n#define DEFAULT_SHORTCUT \"Alt+F2\"\n\n\/************************************************\n\n ************************************************\/\nDialog::Dialog(QWidget *parent) :\n    QDialog(parent, Qt::Tool | Qt::WindowStaysOnTopHint | Qt::CustomizeWindowHint),\n    ui(new Ui::Dialog),\n    mSettings(new LxQt::Settings(\"lxqt-runner\", this)),\n    mGlobalShortcut(0),\n    mLockCascadeChanges(false),\n    mConfigureDialog(0)\n{\n    ui->setupUi(this);\n    setWindowTitle(\"LXQt Runner\");\n    setAttribute(Qt::WA_TranslucentBackground);\n\n    connect(LxQt::Settings::globalSettings(), SIGNAL(iconThemeChanged()), this, SLOT(update()));\n    connect(ui->closeButton, SIGNAL(clicked()), this, SLOT(hide()));\n    connect(mSettings, SIGNAL(settingsChanged()), this, SLOT(applySettings()));\n\n    ui->commandEd->installEventFilter(this);\n\n    connect(ui->commandEd, SIGNAL(textChanged(QString)), this, SLOT(setFilter(QString)));\n    connect(ui->commandEd, SIGNAL(returnPressed()), this, SLOT(runCommand()));\n\n    mCommandItemModel = new CommandItemModel(this);\n    ui->commandList->installEventFilter(this);\n    ui->commandList->setModel(mCommandItemModel);\n    ui->commandList->setEditTriggers(QAbstractItemView::NoEditTriggers);\n    connect(ui->commandList, SIGNAL(clicked(QModelIndex)), this, SLOT(runCommand()));\n    setFilter(\"\");\n    dataChanged();\n\n    ui->commandList->setItemDelegate(new HtmlDelegate(QSize(32, 32), ui->commandList));\n\n    \/\/ Popup menu ...............................\n    QAction *a = new QAction(XdgIcon::fromTheme(\"configure\"), tr(\"Configure\"), this);\n    connect(a, SIGNAL(triggered()), this, SLOT(showConfigDialog()));\n    addAction(a);\n\n    a = new QAction(XdgIcon::fromTheme(\"edit-clear-history\"), tr(\"Clear History\"), this);\n    connect(a, SIGNAL(triggered()), mCommandItemModel, SLOT(clearHistory()));\n    addAction(a);\n\n    mPowerManager = new LxQt::PowerManager(this);\n    addActions(mPowerManager->availableActions());\n    mScreenSaver = new LxQt::ScreenSaver(this);\n    addActions(mScreenSaver->availableActions());\n\n    setContextMenuPolicy(Qt::ActionsContextMenu);\n\n    QMenu *menu = new QMenu(this);\n    menu->addActions(actions());\n    ui->actionButton->setMenu(menu);\n    ui->actionButton->setIcon(XdgIcon::fromTheme(\"configure\"));\n    \/\/ End of popup menu ........................\n\n    applySettings();\n\n    connect(QApplication::desktop(), SIGNAL(screenCountChanged(int)), SLOT(realign()));\n    connect(QApplication::desktop(), SIGNAL(workAreaResized(int)), SLOT(realign()));\n    connect(mGlobalShortcut, SIGNAL(activated()), this, SLOT(showHide()));\n    connect(mGlobalShortcut, SIGNAL(shortcutChanged(QString,QString)), this, SLOT(shortcutChanged(QString,QString)));\n\n    resize(mSettings->value(\"dialog\/width\", 400).toInt(), size().height());\n\n\n    \/\/ TEST\n    connect(mCommandItemModel, SIGNAL(layoutChanged()), this, SLOT(dataChanged()));\n}\n\n\n\/************************************************\n\n ************************************************\/\nDialog::~Dialog()\n{\n    delete ui;\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::closeEvent(QCloseEvent *event)\n{\n    hide();\n    event->ignore();\n}\n\n\n\/************************************************\n\n ************************************************\/\nQSize Dialog::sizeHint() const\n{\n    QSize size = QDialog::sizeHint();\n    size.setWidth(this->size().width());\n    return size;\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::resizeEvent(QResizeEvent *event)\n{\n    mSettings->setValue(\"dialog\/width\", size().width());\n}\n\n\n\/************************************************\n\n ************************************************\/\nbool Dialog::eventFilter(QObject *object, QEvent *event)\n{\n    if (event->type() == QEvent::KeyPress)\n    {\n        QKeyEvent *keyEvent = static_cast<QKeyEvent*>(event);\n\n        if (object == ui->commandEd)\n            return editKeyPressEvent(keyEvent);\n\n        if (object == ui->commandList)\n            return listKeyPressEvent(keyEvent);\n    }\n\n    return QDialog::eventFilter(object, event);\n}\n\n\n\/************************************************\n eventFilter for ui->commandEd\n ************************************************\/\nbool Dialog::editKeyPressEvent(QKeyEvent *event)\n{\n    switch (event->key())\n    {\n    case Qt::Key_N:\n        if (event->modifiers().testFlag(Qt::ControlModifier))\n        {\n            QKeyEvent ev(QEvent::KeyPress, Qt::Key_Down, Qt::NoModifier);\n            editKeyPressEvent(&ev);\n            return true;\n        }\n            return false;\n\n    case Qt::Key_P:\n        if (event->modifiers().testFlag(Qt::ControlModifier))\n        {\n            QKeyEvent ev(QEvent::KeyPress, Qt::Key_Up, Qt::NoModifier);\n            editKeyPressEvent(&ev);\n            return true;\n        }\n            return false;\n\n    case Qt::Key_Up:\n    case Qt::Key_PageUp:\n        if (ui->commandEd->text().isEmpty() &&\n            ui->commandList->isVisible() &&\n            ui->commandList->currentIndex().row() == 0\n           )\n        {\n            setFilter(\"\", false);\n            return true;\n        }\n        qApp->sendEvent(ui->commandList, event);\n        return true;\n\n    case Qt::Key_Down:\n    case Qt::Key_PageDown:\n        if (ui->commandEd->text().isEmpty() &&\n            ui->commandList->isHidden()\n           )\n        {\n            setFilter(\"\", true);\n            return true;\n        }\n\n        qApp->sendEvent(ui->commandList, event);\n        return true;\n    }\n\n    return QDialog::eventFilter(ui->commandList, event);\n}\n\n\n\/************************************************\n eventFilter for ui->commandList\n ************************************************\/\nbool Dialog::listKeyPressEvent(QKeyEvent *event)\n{\n    switch (event->key())\n    {\n    case Qt::Key_Up:\n    case Qt::Key_PageUp:\n        if (ui->commandList->currentIndex().row() == 0)\n        {\n            ui->commandEd->setFocus();\n            return true;\n        }\n        break;\n\n    case Qt::Key_Left:\n    case Qt::Key_Right:\n        ui->commandEd->setFocus();\n        qApp->sendEvent(ui->commandEd, event);\n        return true;\n\n    default:\n        \/\/ Alphabetical or number key ...........\n        if (!event->text().isEmpty())\n        {\n            ui->commandEd->setFocus();\n            qApp->sendEvent(ui->commandEd, event);\n            return true;\n        }\n    }\n\n    return QDialog::eventFilter(ui->commandEd, event);\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::showHide()\n{\n    if (isVisible() && isActiveWindow())\n    {\n        hide();\n    }\n    else\n    {\n        realign();\n        show();\n        KWindowSystem::forceActiveWindow(windowHandle()->winId());\n        ui->commandEd->setFocus();\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::realign()\n{\n    QRect desktop;\n\n    int screen = mMonitor;\n    if (mMonitor < 0 || mMonitor > QApplication::desktop()->screenCount() - 1)\n        screen = QApplication::desktop()->screenNumber(QCursor::pos());\n\n    desktop = QApplication::desktop()->availableGeometry(screen).intersected(KWindowSystem::workArea(screen));\n\n    QRect rect = this->geometry();\n    rect.moveCenter(desktop.center());\n\n    if (mShowOnTop)\n        rect.moveTop(desktop.top());\n    else\n        rect.moveTop(desktop.center().y() - ui->panel->sizeHint().height());\n\n    setGeometry(rect);\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::applySettings()\n{\n    if (mLockCascadeChanges)\n        return;\n\n    \/\/ Shortcut .................................\n    QString shortcut = mSettings->value(\"dialog\/shortcut\", DEFAULT_SHORTCUT).toString();\n    if (shortcut.isEmpty())\n        shortcut = DEFAULT_SHORTCUT;\n\n    if (!mGlobalShortcut)\n        mGlobalShortcut = GlobalKeyShortcut::Client::instance()->addAction(shortcut, \"\/runner\/show_hide_dialog\", tr(\"Show\/hide runner dialog\"), this);\n    else if (mGlobalShortcut->shortcut() != shortcut)\n        mGlobalShortcut->changeShortcut(shortcut);\n\n    mShowOnTop = mSettings->value(\"dialog\/show_on_top\", true).toBool();\n\n    mMonitor = mSettings->value(\"dialog\/monitor\", -1).toInt();\n\n    realign();\n    mSettings->sync();\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::shortcutChanged(const QString &\/*oldShortcut*\/, const QString &newShortcut)\n{\n    if (!newShortcut.isEmpty())\n    {\n        mLockCascadeChanges = true;\n\n        mSettings->setValue(\"dialog\/shortcut\", newShortcut);\n        mSettings->sync();\n\n        mLockCascadeChanges = false;\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::setFilter(const QString &text, bool onlyHistory)\n{\n    qDebug() << \"Ind i setFilter...\";\n    if (mCommandItemModel->isOutDated())\n        mCommandItemModel->rebuild();\n\n    QString trimmedText = text.simplified();\n    mCommandItemModel->setCommand(trimmedText);\n    mCommandItemModel->showOnlyHistory(onlyHistory);\n    mCommandItemModel->setFilterWildcard(trimmedText);\n    mCommandItemModel->sort(0);\n}\n\nvoid Dialog::dataChanged()\n{\n    if (mCommandItemModel->rowCount())\n    {\n       ui->commandList->setCurrentIndex(mCommandItemModel->appropriateItem(mCommandItemModel->command()));\n        ui->commandList->scrollTo(ui->commandList->currentIndex());\n        ui->commandList->show();\n    }\n    else\n    {\n        ui->commandList->hide();\n    }\n\n    adjustSize();\n\n}\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::runCommand()\n{\n    bool res =false;\n    const CommandProviderItem *command = mCommandItemModel->command(ui->commandList->currentIndex());\n\n    if (command)\n        res = command->run();\n\n    if (res)\n    {\n        hide();\n        ui->commandEd->clear();\n    }\n\n}\n\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::showConfigDialog()\n{\n    if (!mConfigureDialog)\n        mConfigureDialog = new ConfigureDialog(mSettings, DEFAULT_SHORTCUT, this);\n    mConfigureDialog->exec();\n}\n\n#undef DEFAULT_SHORTCUT\n<|endoftext|>"}
{"text":"<commit_before>\/* BEGIN_COMMON_COPYRIGHT_HEADER\n * (c)LGPL2+\n *\n * Razor - a lightweight, Qt based, desktop toolset\n * http:\/\/razor-qt.org\n *\n * Copyright: 2010-2011 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#include \"dialog.h\"\n#include \"ui_dialog.h\"\n#include \"widgets.h\"\n#include \"commanditemmodel.h\"\n#include \"configuredialog\/configuredialog.h\"\n\n#include <razorqt\/razorsettings.h>\n#include <qtxdg\/xdgicon.h>\n#include <razorqxt\/qxtglobalshortcut.h>\n\n\n#include <QtCore\/QDebug>\n#include <QtGui\/QCloseEvent>\n#include <QtGui\/QDesktopWidget>\n#include <QtCore\/QProcess>\n#include <QtGui\/QLineEdit>\n#include <QtGui\/QAction>\n#include <QtGui\/QMessageBox>\n#include <QtGui\/QApplication>\n\n#include <QScrollBar>\n\/\/ I hate a X11 heading files. As a result we have such nightmare.\nQEvent::Type QEventKeyPress=QEvent::KeyPress;\n#include <razorqt\/xfitman.h>\n\n\/************************************************\n\n ************************************************\/\nDialog::Dialog(QWidget *parent) :\n    QDialog(parent, Qt::Dialog | Qt::WindowStaysOnTopHint | Qt::CustomizeWindowHint),\n    ui(new Ui::Dialog),\n    mSettings(new RazorSettings(\"razor-runner\", this)),\n    mGlobalShortcut(new QxtGlobalShortcut(this))\n{\n    ui->setupUi(this);\n    connect(RazorSettings::globalSettings(), SIGNAL(iconThemeChanged()), this, SLOT(update()));\n\n    connect(ui->closeButton, SIGNAL(clicked()), this, SLOT(hide()));\n\n    connect(mSettings, SIGNAL(settingsChanged()), this, SLOT(applySettings()));\n\n\n    ui->commandEd->installEventFilter(this);\n    ui->commandEd->setInsertPolicy(QComboBox::NoInsert);\n    ui->commandEd->setCompleter(0);\n\n    connect(ui->commandEd, SIGNAL(textChanged(QString)), this, SLOT(setFilter(QString)));\n    connect(ui->commandEd->lineEdit(), SIGNAL(returnPressed()), this, SLOT(runCommand()));\n\n\n    mCommandItemModel = new CommandItemModel(this);\n    ui->commandList->installEventFilter(this);\n    ui->commandList->setModel(mCommandItemModel);\n    ui->commandList->setEditTriggers(QAbstractItemView::NoEditTriggers);\n    connect(ui->commandList, SIGNAL(clicked(QModelIndex)), this, SLOT(runCommand()));\n    setFilter(\"\");\n\n    ui->commandList->setItemDelegate(new HtmlDelegate(QSize(32, 32), ui->commandList));\n    connect(mGlobalShortcut, SIGNAL(activated()), this, SLOT(showHide()));\n\n    \/\/ Popup menu ...............................\n    QAction *a = new QAction(XdgIcon::fromTheme(\"configure\"), tr(\"Configure razor-runner\"), this);\n    connect(a, SIGNAL(triggered()), this, SLOT(showConfigDialog()));\n    addAction(a);\n\n    setContextMenuPolicy(Qt::ActionsContextMenu);\n    \/\/ End of popup menu ........................\n\n    applySettings();\n    resize(mSettings->value(\"dialog\/width\", 400).toInt(), size().height());\n}\n\n\n\/************************************************\n\n ************************************************\/\nDialog::~Dialog()\n{\n    delete ui;\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::closeEvent(QCloseEvent *event)\n{\n    hide();\n    event->ignore();\n}\n\n\n\/************************************************\n\n ************************************************\/\nQSize Dialog::sizeHint() const\n{\n    QSize size=QDialog::sizeHint();\n    size.setWidth(this->size().width());\n    return size;\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::resizeEvent(QResizeEvent *event)\n{\n    mSettings->setValue(\"dialog\/width\", size().width());\n}\n\n\n\/************************************************\n\n ************************************************\/\nbool Dialog::eventFilter(QObject *object, QEvent *event)\n{\n    if (event->type() == QEventKeyPress) \/\/ QEvent::KeyPress\n    {\n        QKeyEvent *keyEvent = static_cast<QKeyEvent*>(event);\n\n        if (object == ui->commandEd)\n            return editKeyPressEvent(keyEvent);\n\n        if (object == ui->commandList)\n            return listKeyPressEvent(keyEvent);\n    }\n\n    return QDialog::eventFilter(object, event);\n}\n\n\n\/************************************************\n eventFilter for ui->commandEd\n ************************************************\/\nbool Dialog::editKeyPressEvent(QKeyEvent *event)\n{\n    switch (event->key())\n    {\n    case Qt::Key_Up:\n    case Qt::Key_PageUp:\n        if (ui->commandEd->currentText().isEmpty() &&\n            ui->commandList->isVisible() &&\n            ui->commandList->currentIndex().row() == 0\n           )\n        {\n            setFilter(\"\", false);\n            return true;\n        }\n        qApp->sendEvent(ui->commandList, event);\n        return true;\n\n    case Qt::Key_Down:\n    case Qt::Key_PageDown:\n        if (ui->commandEd->currentText().isEmpty() &&\n            ui->commandList->isHidden()\n           )\n        {\n            setFilter(\"\", true);\n            return true;\n        }\n\n        qApp->sendEvent(ui->commandList, event);\n        return true;\n    }\n\n    return QDialog::eventFilter(ui->commandList, event);\n}\n\n\n\/************************************************\n eventFilter for ui->commandList\n ************************************************\/\nbool Dialog::listKeyPressEvent(QKeyEvent *event)\n{\n    switch (event->key())\n    {\n    case Qt::Key_Up:\n    case Qt::Key_PageUp:\n        if (ui->commandList->currentIndex().row() == 0)\n        {\n            ui->commandEd->setFocus();\n            return true;\n        }\n        break;\n\n    case Qt::Key_Left:\n    case Qt::Key_Right:\n        ui->commandEd->setFocus();\n        qApp->sendEvent(ui->commandEd, event);\n        return true;\n\n    default:\n        \/\/ Alphabetical or number key ...........\n        if (!event->text().isEmpty())\n        {\n            ui->commandEd->setFocus();\n            qApp->sendEvent(ui->commandEd, event);\n            return true;\n        }\n    }\n\n    return QDialog::eventFilter(ui->commandEd, event);\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::showHide()\n{\n    if (isVisible() &&  isActiveWindow())\n    {\n        hide();\n    }\n    else\n    {\n        realign();\n        show();\n        \/\/ I do not know why but next 2 lines don't work\n        \/\/ in KWIN. So we use the native X11.\n        \/\/QApplication::setActiveWindow(this);\n        \/\/activateWindow();\n        xfitMan().raiseWindow(this->effectiveWinId());\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::realign()\n{\n    QRect desktop;\n\n    if (mMonitor) \/\/ Show on the specified monitor.\n        desktop = xfitMan().availableGeometry(mMonitor-1);\n    else         \/\/ Follow the mouse.\n        desktop = xfitMan().availableGeometry(QCursor::pos());\n\n\n    QRect rect = this->geometry();\n    rect.moveCenter(desktop.center());\n\n    if (mShowOnTop)\n        rect.moveTop(desktop.top());\n    else\n        rect.moveTop(desktop.center().y() - ui->panel->sizeHint().height());\n\n    setGeometry(rect);\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::applySettings()\n{\n    \/\/ Shortcut .................................\n    QKeySequence shortcut = QKeySequence::fromString(mSettings->value(\"dialog\/shortcut\", \"Alt+F2\").toString());\n    if (shortcut.isEmpty())\n        shortcut = QKeySequence::fromString(\"Alt+F2\");\n\n    if (mGlobalShortcut->shortcut() != shortcut)\n    {\n        mGlobalShortcut->setShortcut(shortcut);\n        qDebug() << tr(\"Press \\\"%1\\\" to see dialog.\").arg(shortcut.toString());\n    }\n\n    mShowOnTop = mSettings->value(\"dialog\/show_on_top\", true).toBool();\n\n    mMonitor = mSettings->value(\"dialog\/monitor\", 0).toInt();\n\n    realign();\n    mSettings->sync();\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::setFilter(const QString &text, bool onlyHistory)\n{\n    if (mCommandItemModel->isOutDated())\n        mCommandItemModel->rebuild();\n\n    mCommandItemModel->showOnlyHistory(onlyHistory);\n    mCommandItemModel->setFilterWildcard(text);\n\n    if (mCommandItemModel->rowCount())\n    {\n        mCommandItemModel->sort(0);\n        ui->commandList->setCurrentIndex(mCommandItemModel->appropriateItem(text));\n        ui->commandList->scrollTo(ui->commandList->currentIndex());\n        ui->commandList->show();\n    }\n    else\n    {\n        ui->commandList->hide();\n    }\n\n    adjustSize();\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::runCommand()\n{\n    bool res =false;\n    const CommandProviderItem *command = mCommandItemModel->command(ui->commandList->currentIndex());\n\n    if (command)\n    {\n        res = command->run();\n    }\n    else\n    {\n        QString command = ui->commandEd->currentText();\n        res = QProcess::startDetached(command);\n        if (res)\n        {\n            mCommandItemModel->addHistoryCommand(command);\n        }\n    }\n\n    if (res)\n    {\n        hide();\n        ui->commandEd->clearEditText();\n    }\n\n}\n\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::showConfigDialog()\n{\n    ConfigureDialog::createAndShow(mSettings, this);\n}\n<commit_msg>Set window titles for use with WM's like fvwm<commit_after>\/* BEGIN_COMMON_COPYRIGHT_HEADER\n * (c)LGPL2+\n *\n * Razor - a lightweight, Qt based, desktop toolset\n * http:\/\/razor-qt.org\n *\n * Copyright: 2010-2011 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#include \"dialog.h\"\n#include \"ui_dialog.h\"\n#include \"widgets.h\"\n#include \"commanditemmodel.h\"\n#include \"configuredialog\/configuredialog.h\"\n\n#include <razorqt\/razorsettings.h>\n#include <qtxdg\/xdgicon.h>\n#include <razorqxt\/qxtglobalshortcut.h>\n\n\n#include <QtCore\/QDebug>\n#include <QtGui\/QCloseEvent>\n#include <QtGui\/QDesktopWidget>\n#include <QtCore\/QProcess>\n#include <QtGui\/QLineEdit>\n#include <QtGui\/QAction>\n#include <QtGui\/QMessageBox>\n#include <QtGui\/QApplication>\n\n#include <QScrollBar>\n\/\/ I hate a X11 heading files. As a result we have such nightmare.\nQEvent::Type QEventKeyPress=QEvent::KeyPress;\n#include <razorqt\/xfitman.h>\n\n\/************************************************\n\n ************************************************\/\nDialog::Dialog(QWidget *parent) :\n    QDialog(parent, Qt::Dialog | Qt::WindowStaysOnTopHint | Qt::CustomizeWindowHint),\n    ui(new Ui::Dialog),\n    mSettings(new RazorSettings(\"razor-runner\", this)),\n    mGlobalShortcut(new QxtGlobalShortcut(this))\n{\n    ui->setupUi(this);\n    setWindowTitle(\"Razor Runner\");\n\n    connect(RazorSettings::globalSettings(), SIGNAL(iconThemeChanged()), this, SLOT(update()));\n\n    connect(ui->closeButton, SIGNAL(clicked()), this, SLOT(hide()));\n\n    connect(mSettings, SIGNAL(settingsChanged()), this, SLOT(applySettings()));\n\n\n    ui->commandEd->installEventFilter(this);\n    ui->commandEd->setInsertPolicy(QComboBox::NoInsert);\n    ui->commandEd->setCompleter(0);\n\n    connect(ui->commandEd, SIGNAL(textChanged(QString)), this, SLOT(setFilter(QString)));\n    connect(ui->commandEd->lineEdit(), SIGNAL(returnPressed()), this, SLOT(runCommand()));\n\n\n    mCommandItemModel = new CommandItemModel(this);\n    ui->commandList->installEventFilter(this);\n    ui->commandList->setModel(mCommandItemModel);\n    ui->commandList->setEditTriggers(QAbstractItemView::NoEditTriggers);\n    connect(ui->commandList, SIGNAL(clicked(QModelIndex)), this, SLOT(runCommand()));\n    setFilter(\"\");\n\n    ui->commandList->setItemDelegate(new HtmlDelegate(QSize(32, 32), ui->commandList));\n    connect(mGlobalShortcut, SIGNAL(activated()), this, SLOT(showHide()));\n\n    \/\/ Popup menu ...............................\n    QAction *a = new QAction(XdgIcon::fromTheme(\"configure\"), tr(\"Configure razor-runner\"), this);\n    connect(a, SIGNAL(triggered()), this, SLOT(showConfigDialog()));\n    addAction(a);\n\n    setContextMenuPolicy(Qt::ActionsContextMenu);\n    \/\/ End of popup menu ........................\n\n    applySettings();\n    resize(mSettings->value(\"dialog\/width\", 400).toInt(), size().height());\n}\n\n\n\/************************************************\n\n ************************************************\/\nDialog::~Dialog()\n{\n    delete ui;\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::closeEvent(QCloseEvent *event)\n{\n    hide();\n    event->ignore();\n}\n\n\n\/************************************************\n\n ************************************************\/\nQSize Dialog::sizeHint() const\n{\n    QSize size=QDialog::sizeHint();\n    size.setWidth(this->size().width());\n    return size;\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::resizeEvent(QResizeEvent *event)\n{\n    mSettings->setValue(\"dialog\/width\", size().width());\n}\n\n\n\/************************************************\n\n ************************************************\/\nbool Dialog::eventFilter(QObject *object, QEvent *event)\n{\n    if (event->type() == QEventKeyPress) \/\/ QEvent::KeyPress\n    {\n        QKeyEvent *keyEvent = static_cast<QKeyEvent*>(event);\n\n        if (object == ui->commandEd)\n            return editKeyPressEvent(keyEvent);\n\n        if (object == ui->commandList)\n            return listKeyPressEvent(keyEvent);\n    }\n\n    return QDialog::eventFilter(object, event);\n}\n\n\n\/************************************************\n eventFilter for ui->commandEd\n ************************************************\/\nbool Dialog::editKeyPressEvent(QKeyEvent *event)\n{\n    switch (event->key())\n    {\n    case Qt::Key_Up:\n    case Qt::Key_PageUp:\n        if (ui->commandEd->currentText().isEmpty() &&\n            ui->commandList->isVisible() &&\n            ui->commandList->currentIndex().row() == 0\n           )\n        {\n            setFilter(\"\", false);\n            return true;\n        }\n        qApp->sendEvent(ui->commandList, event);\n        return true;\n\n    case Qt::Key_Down:\n    case Qt::Key_PageDown:\n        if (ui->commandEd->currentText().isEmpty() &&\n            ui->commandList->isHidden()\n           )\n        {\n            setFilter(\"\", true);\n            return true;\n        }\n\n        qApp->sendEvent(ui->commandList, event);\n        return true;\n    }\n\n    return QDialog::eventFilter(ui->commandList, event);\n}\n\n\n\/************************************************\n eventFilter for ui->commandList\n ************************************************\/\nbool Dialog::listKeyPressEvent(QKeyEvent *event)\n{\n    switch (event->key())\n    {\n    case Qt::Key_Up:\n    case Qt::Key_PageUp:\n        if (ui->commandList->currentIndex().row() == 0)\n        {\n            ui->commandEd->setFocus();\n            return true;\n        }\n        break;\n\n    case Qt::Key_Left:\n    case Qt::Key_Right:\n        ui->commandEd->setFocus();\n        qApp->sendEvent(ui->commandEd, event);\n        return true;\n\n    default:\n        \/\/ Alphabetical or number key ...........\n        if (!event->text().isEmpty())\n        {\n            ui->commandEd->setFocus();\n            qApp->sendEvent(ui->commandEd, event);\n            return true;\n        }\n    }\n\n    return QDialog::eventFilter(ui->commandEd, event);\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::showHide()\n{\n    if (isVisible() &&  isActiveWindow())\n    {\n        hide();\n    }\n    else\n    {\n        realign();\n        show();\n        \/\/ I do not know why but next 2 lines don't work\n        \/\/ in KWIN. So we use the native X11.\n        \/\/QApplication::setActiveWindow(this);\n        \/\/activateWindow();\n        xfitMan().raiseWindow(this->effectiveWinId());\n    }\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::realign()\n{\n    QRect desktop;\n\n    if (mMonitor) \/\/ Show on the specified monitor.\n        desktop = xfitMan().availableGeometry(mMonitor-1);\n    else         \/\/ Follow the mouse.\n        desktop = xfitMan().availableGeometry(QCursor::pos());\n\n\n    QRect rect = this->geometry();\n    rect.moveCenter(desktop.center());\n\n    if (mShowOnTop)\n        rect.moveTop(desktop.top());\n    else\n        rect.moveTop(desktop.center().y() - ui->panel->sizeHint().height());\n\n    setGeometry(rect);\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::applySettings()\n{\n    \/\/ Shortcut .................................\n    QKeySequence shortcut = QKeySequence::fromString(mSettings->value(\"dialog\/shortcut\", \"Alt+F2\").toString());\n    if (shortcut.isEmpty())\n        shortcut = QKeySequence::fromString(\"Alt+F2\");\n\n    if (mGlobalShortcut->shortcut() != shortcut)\n    {\n        mGlobalShortcut->setShortcut(shortcut);\n        qDebug() << tr(\"Press \\\"%1\\\" to see dialog.\").arg(shortcut.toString());\n    }\n\n    mShowOnTop = mSettings->value(\"dialog\/show_on_top\", true).toBool();\n\n    mMonitor = mSettings->value(\"dialog\/monitor\", 0).toInt();\n\n    realign();\n    mSettings->sync();\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::setFilter(const QString &text, bool onlyHistory)\n{\n    if (mCommandItemModel->isOutDated())\n        mCommandItemModel->rebuild();\n\n    mCommandItemModel->showOnlyHistory(onlyHistory);\n    mCommandItemModel->setFilterWildcard(text);\n\n    if (mCommandItemModel->rowCount())\n    {\n        mCommandItemModel->sort(0);\n        ui->commandList->setCurrentIndex(mCommandItemModel->appropriateItem(text));\n        ui->commandList->scrollTo(ui->commandList->currentIndex());\n        ui->commandList->show();\n    }\n    else\n    {\n        ui->commandList->hide();\n    }\n\n    adjustSize();\n}\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::runCommand()\n{\n    bool res =false;\n    const CommandProviderItem *command = mCommandItemModel->command(ui->commandList->currentIndex());\n\n    if (command)\n    {\n        res = command->run();\n    }\n    else\n    {\n        QString command = ui->commandEd->currentText();\n        res = QProcess::startDetached(command);\n        if (res)\n        {\n            mCommandItemModel->addHistoryCommand(command);\n        }\n    }\n\n    if (res)\n    {\n        hide();\n        ui->commandEd->clearEditText();\n    }\n\n}\n\n\n\n\/************************************************\n\n ************************************************\/\nvoid Dialog::showConfigDialog()\n{\n    ConfigureDialog::createAndShow(mSettings, this);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n Program:   Visualization Toolkit\n Module:    vtkSource.cxx\n Language:  C++\n Date:      $Date$\n Version:   $Revision$\n\n\nCopyright (c) 1993-1998 Ken Martin, Will Schroeder, Bill Lorensen.\n\nThis software is copyrighted by Ken Martin, Will Schroeder and Bill Lorensen.\nThe following terms apply to all files associated with the software unless\nexplicitly disclaimed in individual files. This copyright specifically does\nnot apply to the related textbook \"The Visualization Toolkit\" ISBN\n013199837-4 published by Prentice Hall which is covered by its own copyright.\n\nThe authors hereby grant permission to use, copy, and distribute this\nsoftware and its documentation for any purpose, provided that existing\ncopyright notices are retained in all copies and that this notice is included\nverbatim in any distributions. Additionally, the authors grant permission to\nmodify this software and its documentation for any purpose, provided that\nsuch modifications are not distributed without the explicit consent of the\nauthors and that existing copyright notices are retained in all copies. Some\nof the algorithms implemented by this software are patented, observe all\napplicable patent law.\n\nIN NO EVENT SHALL THE AUTHORS OR DISTRIBUTORS BE LIABLE TO ANY PARTY FOR\nDIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT\nOF THE USE OF THIS SOFTWARE, ITS DOCUMENTATION, OR ANY DERIVATIVES THEREOF,\nEVEN IF THE AUTHORS HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\nTHE AUTHORS AND DISTRIBUTORS SPECIFICALLY DISCLAIM ANY WARRANTIES, INCLUDING,\nBUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\nPARTICULAR PURPOSE, AND NON-INFRINGEMENT.  THIS SOFTWARE IS PROVIDED ON AN\n\"AS IS\" BASIS, AND THE AUTHORS AND DISTRIBUTORS HAVE NO OBLIGATION TO PROVIDE\nMAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.\n \n\n=========================================================================*\/\n#include \"vtkSource.h\"\n#include \"vtkDataObject.h\"\n\n#ifndef NULL\n#define NULL 0\n#endif\n\n\/\/----------------------------------------------------------------------------\nvtkSource::vtkSource()\n{\n  this->NumberOfOutputs = 0;\n  this->Outputs = NULL;\n  this->Updating = 0; \n}\n\n\/\/----------------------------------------------------------------------------\nvtkSource::~vtkSource()\n{\n  int idx;\n  \n  for (idx = 0; idx < this->NumberOfOutputs; ++idx)\n    {\n    if (this->Outputs[idx])\n      {\n      this->Outputs[idx]->SetSource(NULL);\n      this->Outputs[idx]->UnRegister(this);\n      this->Outputs[idx] = NULL;\n      }\n    }\n  if (this->Outputs)\n    {\n    delete [] this->Outputs;\n    this->Outputs = NULL;\n    this->NumberOfOutputs = 0;\n    }\n}\n\n\/\/----------------------------------------------------------------------------\nvtkDataObject *vtkSource::GetOutput(int i)\n{\n  if (this->NumberOfOutputs < i+1)\n    {\n    return NULL;\n    }\n  \n  return this->Outputs[i];\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkSource::GetReleaseDataFlag()\n{\n  if (this->GetOutput(0))\n    {\n    return this->GetOutput(0)->GetReleaseDataFlag();\n    }\n  vtkWarningMacro(<<\"Output doesn't exist!\");\n  return 1;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkSource::SetReleaseDataFlag(int i)\n{\n  int idx;\n  \n  for (idx = 0; idx < this->NumberOfOutputs; idx++)\n    {\n    if (this->Outputs[idx])\n      {\n      this->Outputs[idx]->SetReleaseDataFlag(i);\n      }\n    }\n}\n\n\n\/\/----------------------------------------------------------------------------\nvoid vtkSource::Update()\n{\n  if (this->GetOutput(0))\n    {\n    this->GetOutput(0)->Update();\n    }\n}\n\ntypedef vtkDataObject *vtkDataObjectPointer;\n\/\/----------------------------------------------------------------------------\n\/\/ Called by constructor to set up output array.\nvoid vtkSource::SetNumberOfOutputs(int num)\n{\n  int idx;\n  vtkDataObjectPointer *outputs;\n\n  \/\/ in case nothing has changed.\n  if (num == this->NumberOfOutputs)\n    {\n    return;\n    }\n  \n  \/\/ Allocate new arrays.\n  outputs = new vtkDataObjectPointer[num];\n\n  \/\/ Initialize with NULLs.\n  for (idx = 0; idx < num; ++idx)\n    {\n    outputs[idx] = NULL;\n    }\n\n  \/\/ Copy old outputs\n  for (idx = 0; idx < num && idx < this->NumberOfOutputs; ++idx)\n    {\n    outputs[idx] = this->Outputs[idx];\n    }\n  \n  \/\/ delete the previous arrays\n  if (this->Outputs)\n    {\n    delete [] this->Outputs;\n    this->Outputs = NULL;\n    this->NumberOfOutputs = 0;\n    }\n  \n  \/\/ Set the new arrays\n  this->Outputs = outputs;\n  \n  this->NumberOfOutputs = num;\n  this->Modified();\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ Adds an output to the first null position in the output list.\n\/\/ Expands the list memory if necessary\nvoid vtkSource::AddOutput(vtkDataObject *output)\n{\n  int idx;\n  \n  if (output)\n    {\n    output->SetSource(this);\n    output->Register(this);\n    }\n  this->Modified();\n  \n  for (idx = 0; idx < this->NumberOfOutputs; ++idx)\n    {\n    if (this->Outputs[idx] == NULL)\n      {\n      this->Outputs[idx] = output;\n      return;\n      }\n    }\n  \n  this->SetNumberOfOutputs(this->NumberOfOutputs + 1);\n  this->Outputs[this->NumberOfOutputs - 1] = output;\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ Adds an output to the first null position in the output list.\n\/\/ Expands the list memory if necessary\nvoid vtkSource::RemoveOutput(vtkDataObject *output)\n{\n  int idx, loc;\n  \n  if (!output)\n    {\n    return;\n    }\n  \n  \/\/ find the output in the list of outputs\n  loc = -1;\n  for (idx = 0; idx < this->NumberOfOutputs; ++idx)\n    {\n    if (this->Outputs[idx] == output)\n      {\n      loc = idx;\n      }\n    }\n  if (loc == -1)\n    {\n    vtkDebugMacro(\"tried to remove an output that was not in the list\");\n    return;\n    }\n  \n  this->Outputs[loc]->SetSource(NULL);\n  this->Outputs[loc]->UnRegister(this);\n  this->Outputs[loc] = NULL;\n\n  \/\/ if that was the last output, then shrink the list\n  if (loc == this->NumberOfOutputs - 1)\n    {\n    this->SetNumberOfOutputs(this->NumberOfOutputs - 1);\n    }\n  \n  this->Modified();\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ Set an Output of this filter. \nvoid vtkSource::SetOutput(int idx, vtkDataObject *output)\n{\n  if (idx < 0)\n    {\n    vtkErrorMacro(<< \"SetOutput: \" << idx << \", cannot set output. \");\n    return;\n    }\n  \/\/ Expand array if necessary.\n  if (idx >= this->NumberOfOutputs)\n    {\n    this->SetNumberOfOutputs(idx + 1);\n    }\n  \n  \/\/ does this change anything?\n  if (output == this->Outputs[idx])\n    {\n    return;\n    }\n  \n  if (this->Outputs[idx])\n    {\n    this->Outputs[idx]->SetSource(NULL);\n    this->Outputs[idx]->UnRegister(this);\n    this->Outputs[idx] = NULL;\n    }\n  \n  if (output)\n    {\n    output->SetSource(this);\n    output->Register(this);\n    }\n\n  this->Outputs[idx] = output;\n  this->Modified();\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ Update input to this filter and the filter itself.\n\/\/ This is a streaming version of the update method.\nvoid vtkSource::InternalUpdate(vtkDataObject *output)\n{\n  int idx;\n  int numDivisions, division;\n\n  \/\/ prevent chasing our tail\n  if (this->Updating)\n    {\n    return;\n    }\n\n  \/\/ Let the source initialize the data for streaming.\n  \/\/ output->Initialize and CopyStructure ...\n  this->StreamExecuteStart();\n  \n  \/\/ Determine how many pieces we are going to process.\n  numDivisions = this->GetNumberOfStreamDivisions();\n  for (division = 0; division < numDivisions; ++division)\n    {\n    \/\/ Compute the update extent for all of the inputs.\n    if (this->ComputeDivisionExtents(output, division, numDivisions))\n      {\n      \/\/ Update the inputs\n      this->Updating = 1;\n      for (idx = 0; idx < this->NumberOfInputs; ++idx)\n\t{\n\tif (this->Inputs[idx] != NULL)\n\t  {\n\t  this->Inputs[idx]->InternalUpdate();\n\t  }\n\t}\n      this->Updating = 0;\n      \n      \/\/ Execute\n      if ( this->StartMethod )\n\t{\n\t(*this->StartMethod)(this->StartMethodArg);\n\t}\n      \/\/ reset Abort flag\n      this->AbortExecute = 0;\n      this->Progress = 0.0;\n      this->Execute();\n      if ( !this->AbortExecute )\n\t{\n\tthis->UpdateProgress(1.0);\n\t}\n      if ( this->EndMethod )\n\t{\n\t(*this->EndMethod)(this->EndMethodArg);\n\t}\n      }\n    }\n  \n  \/\/ Let the source clean up after streaming.\n  this->StreamExecuteEnd();\n  \n  for (idx = 0; idx < this->NumberOfInputs; ++idx)\n    {\n    if (this->Inputs[idx] != NULL)\n      {\n      if ( this->Inputs[idx]->ShouldIReleaseData() )\n\t{\n\tthis->Inputs[idx]->ReleaseData();\n\t}\n      }  \n    }\n  \n  \/\/ Information gets invalidated as soon as Update is called,\n  \/\/ so validate it again here.\n  this->InformationTime.Modified();\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ To facilitate a single Update method, we are putting data initialization\n\/\/ in this method.\nvoid vtkSource::StreamExecuteStart()\n{\n  int idx;\n  \n  \/\/ clear output (why isn't this ReleaseData.  Does it allocate data too?)\n  \/\/ Should it be done if StreamExecuteStart?\n  for (idx = 0; idx < this->NumberOfOutputs; idx++)\n    {\n    if (this->Outputs[idx])\n      {\n      this->Outputs[idx]->Initialize(); \n      }\n    }\n}\n\n\n\n\/\/----------------------------------------------------------------------------\nint vtkSource::ComputeDivisionExtents(vtkDataObject *output,\n\t\t\t\t      int idx, int numDivisions)\n{\n  if (idx == 0 && numDivisions == 1)\n    {\n    return this->ComputeInputUpdateExtents(output);\n    }\n  if (this->NumberOfInputs > 0)\n    {\n    vtkErrorMacro(\"Source did not implement ComputeDivisionExtents\");\n    return 0;\n    }\n  \n  return 1;\n}\n\n\n\/\/----------------------------------------------------------------------------\nint vtkSource::ComputeInputUpdateExtents(vtkDataObject *output)\n{\n  if (this->NumberOfInputs > 0)\n    {\n    vtkErrorMacro(\"Subclass did not implement ComputeInputUpdateExtents\");\n    }\n  return 1;\n}\n\n\n\n\/\/----------------------------------------------------------------------------\nvoid vtkSource::UpdateInformation()\n{\n  unsigned long t1, t2, size;\n  int locality, l2, idx;\n  vtkDataObject *pd;\n\n  if (this->Outputs[0] == NULL)\n    {\n    return;\n    }\n  \n  if (this->Updating)\n    {\n    \/\/ We are in a pipeline loop.\n    \/\/ Force an update\n    this->GetOutput(0)->Modified();\n    return;\n    }\n  \n  \/\/ Update information on the input and\n  \/\/ compute information that is general to vtkDataObject.\n  t1 = this->GetMTime();\n  size = 0;\n  locality = 0;\n\n  for (idx = 0; idx < this->NumberOfInputs; ++idx)\n    {\n    if (this->Inputs[idx] != NULL)\n      {\n      pd = this->Inputs[idx];\n\n      this->Updating = 1;\n      pd->UpdateInformation();\n      this->Updating = 0;\n      \n      \/\/ for MPI port stuff\n      l2 = pd->GetLocality();\n      if (l2 > locality)\n\t{\n\tlocality = l2;\n\t}\n      \n      \/\/ Pipeline MTime stuff\n      t2 = pd->GetPipelineMTime();\n      if (t2 > t1)\n\t{\n\tt1 = t2;\n\t}\n      \/\/ Pipeline MTime does not include the MTime of the data object itself.\n      \/\/ Factor these mtimes into the next PipelineMTime\n      t2 = pd->GetMTime();\n      if (t2 > t1)\n\t{\n\tt1 = t2;\n\t}\n      \n      \/\/ Default estimated size is just the sum of the sizes of the inputs.\n      size += pd->GetEstimatedMemorySize();\n      }\n    }\n \n  for (idx = 0; idx < this->NumberOfOutputs; ++idx)\n    {\n    if (this->GetOutput(idx))\n      {\n      this->GetOutput(idx)->SetLocality(locality + 1);\n      this->GetOutput(idx)->SetEstimatedMemorySize(size);\n      this->GetOutput(idx)->SetPipelineMTime(t1);\n      }  \n    }\n  \n  \/\/ Call ExecuteInformation for subclass specific information.\n  \/\/ Some sources (readers) have an expensive ExecuteInformation method.\n  if (t1 > this->InformationTime.GetMTime())\n    {\n    this->ExecuteInformation();\n    \/\/ This call to modify is almost useless.  Update invalidates this time.\n    \/\/ InformationTime is modified at the end of InternalUpdate too.\n    \/\/ Keep this modified in case we have multiple calls to UpdateInformation.\n    this->InformationTime.Modified();\n    }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkSource::Execute()\n{\n  vtkErrorMacro(<< \"Definition of Execute() method should be in subclass\");\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkSource::ExecuteInformation()\n{\n  \/\/vtkErrorMacro(<< \"Subclass did not implement ExecuteInformation\");\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkSource::PrintSelf(ostream& os, vtkIndent indent)\n{\n  vtkProcessObject::PrintSelf(os,indent);\n\n  if ( this->NumberOfOutputs)\n    {\n    int idx;\n    for (idx = 0; idx < this->NumberOfOutputs; ++idx)\n      {\n      os << indent << \"Output \" << idx << \": (\" << this->Outputs[idx] << \")\\n\";\n      }\n    }\n  else\n    {\n    os << indent <<\"No Outputs\\n\";\n    }\n}\n\nint vtkSource::InRegisterLoop(vtkObject *o)\n{\n  int idx;\n  int num = 0;\n  int cnum = 0;\n  int match = 0;\n  \n  for (idx = 0; idx < this->NumberOfOutputs; idx++)\n    {\n    if (this->Outputs[idx])\n      {\n      if (this->Outputs[idx] == o)\n\t{\n\tmatch = 1;\n\t}\n      if (this->Outputs[idx]->GetSource() == this)\n\t{\n\tnum++;\n\tcnum += this->Outputs[idx]->GetNetReferenceCount();\n\t}\n      }\n    }\n  \n  \/\/ if no one outside is using us\n  \/\/ and our data objects are down to one net reference\n  \/\/ and we are being asked by one of our data objects\n  if (this->ReferenceCount == num && cnum == (num + 1) && match)\n    {\n    return 1;\n    }\n  return 0;\n}\n                           \nvoid vtkSource::UnRegister(vtkObject *o)\n{\n  int idx;\n  int done = 0;\n\n  \/\/ detect the circular loop source <-> data\n  \/\/ If we have two references and one of them is my data\n  \/\/ and I am not being unregistered by my data, break the loop.\n  if (this->ReferenceCount == (this->NumberOfOutputs+1))\n    {\n    done = 1;\n    for (idx = 0; idx < this->NumberOfOutputs; idx++)\n      {\n      if (this->Outputs[idx])\n\t{\n\tif (this->Outputs[idx] == o)\n\t  {\n\t  done = 0;\n\t  }\n\tif (this->Outputs[idx]->GetNetReferenceCount() != 1)\n\t  {\n\t  done = 0;\n\t  }\n\t}\n      }\n    }\n  \n  if (this->ReferenceCount == this->NumberOfOutputs)\n    {\n    int match = 0;\n    int total = 0;\n    for (idx = 0; idx < this->NumberOfOutputs; idx++)\n      {\n      if (this->Outputs[idx])\n\t{\n\tif (this->Outputs[idx] == o)\n\t  {\n\t  match = 1;\n\t  }\n\ttotal += this->Outputs[idx]->GetNetReferenceCount();\n\t}\n      }\n    if (total == (this->NumberOfOutputs + 1) && match)\n      {\n      done = 1;\n      }\n    }\n    \n  if (done)\n    {\n    for (idx = 0; idx < this->NumberOfOutputs; idx++)\n      {\n      if (this->Outputs[idx])\n\t{\n\tthis->Outputs[idx]->SetSource(NULL);\n\t}\n      }\n    }\n  \n  this->vtkObject::UnRegister(o);\n}\n\n\n\n\n\n\n\n<commit_msg>Keep double reference consistent<commit_after>\/*=========================================================================\n\n Program:   Visualization Toolkit\n Module:    vtkSource.cxx\n Language:  C++\n Date:      $Date$\n Version:   $Revision$\n\n\nCopyright (c) 1993-1998 Ken Martin, Will Schroeder, Bill Lorensen.\n\nThis software is copyrighted by Ken Martin, Will Schroeder and Bill Lorensen.\nThe following terms apply to all files associated with the software unless\nexplicitly disclaimed in individual files. This copyright specifically does\nnot apply to the related textbook \"The Visualization Toolkit\" ISBN\n013199837-4 published by Prentice Hall which is covered by its own copyright.\n\nThe authors hereby grant permission to use, copy, and distribute this\nsoftware and its documentation for any purpose, provided that existing\ncopyright notices are retained in all copies and that this notice is included\nverbatim in any distributions. Additionally, the authors grant permission to\nmodify this software and its documentation for any purpose, provided that\nsuch modifications are not distributed without the explicit consent of the\nauthors and that existing copyright notices are retained in all copies. Some\nof the algorithms implemented by this software are patented, observe all\napplicable patent law.\n\nIN NO EVENT SHALL THE AUTHORS OR DISTRIBUTORS BE LIABLE TO ANY PARTY FOR\nDIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT\nOF THE USE OF THIS SOFTWARE, ITS DOCUMENTATION, OR ANY DERIVATIVES THEREOF,\nEVEN IF THE AUTHORS HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\nTHE AUTHORS AND DISTRIBUTORS SPECIFICALLY DISCLAIM ANY WARRANTIES, INCLUDING,\nBUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\nPARTICULAR PURPOSE, AND NON-INFRINGEMENT.  THIS SOFTWARE IS PROVIDED ON AN\n\"AS IS\" BASIS, AND THE AUTHORS AND DISTRIBUTORS HAVE NO OBLIGATION TO PROVIDE\nMAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.\n \n\n=========================================================================*\/\n#include \"vtkSource.h\"\n#include \"vtkDataObject.h\"\n\n#ifndef NULL\n#define NULL 0\n#endif\n\n\/\/----------------------------------------------------------------------------\nvtkSource::vtkSource()\n{\n  this->NumberOfOutputs = 0;\n  this->Outputs = NULL;\n  this->Updating = 0; \n}\n\n\/\/----------------------------------------------------------------------------\nvtkSource::~vtkSource()\n{\n  int idx;\n  \n  for (idx = 0; idx < this->NumberOfOutputs; ++idx)\n    {\n    if (this->Outputs[idx])\n      {\n      this->Outputs[idx]->SetSource(NULL);\n      this->Outputs[idx]->UnRegister(this);\n      this->Outputs[idx] = NULL;\n      }\n    }\n  if (this->Outputs)\n    {\n    delete [] this->Outputs;\n    this->Outputs = NULL;\n    this->NumberOfOutputs = 0;\n    }\n}\n\n\/\/----------------------------------------------------------------------------\nvtkDataObject *vtkSource::GetOutput(int i)\n{\n  if (this->NumberOfOutputs < i+1)\n    {\n    return NULL;\n    }\n  \n  return this->Outputs[i];\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkSource::GetReleaseDataFlag()\n{\n  if (this->GetOutput(0))\n    {\n    return this->GetOutput(0)->GetReleaseDataFlag();\n    }\n  vtkWarningMacro(<<\"Output doesn't exist!\");\n  return 1;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkSource::SetReleaseDataFlag(int i)\n{\n  int idx;\n  \n  for (idx = 0; idx < this->NumberOfOutputs; idx++)\n    {\n    if (this->Outputs[idx])\n      {\n      this->Outputs[idx]->SetReleaseDataFlag(i);\n      }\n    }\n}\n\n\n\/\/----------------------------------------------------------------------------\nvoid vtkSource::Update()\n{\n  if (this->GetOutput(0))\n    {\n    this->GetOutput(0)->Update();\n    }\n}\n\ntypedef vtkDataObject *vtkDataObjectPointer;\n\/\/----------------------------------------------------------------------------\n\/\/ Called by constructor to set up output array.\nvoid vtkSource::SetNumberOfOutputs(int num)\n{\n  int idx;\n  vtkDataObjectPointer *outputs;\n\n  \/\/ in case nothing has changed.\n  if (num == this->NumberOfOutputs)\n    {\n    return;\n    }\n  \n  \/\/ Allocate new arrays.\n  outputs = new vtkDataObjectPointer[num];\n\n  \/\/ Initialize with NULLs.\n  for (idx = 0; idx < num; ++idx)\n    {\n    outputs[idx] = NULL;\n    }\n\n  \/\/ Copy old outputs\n  for (idx = 0; idx < num && idx < this->NumberOfOutputs; ++idx)\n    {\n    outputs[idx] = this->Outputs[idx];\n    }\n  \n  \/\/ delete the previous arrays\n  if (this->Outputs)\n    {\n    delete [] this->Outputs;\n    this->Outputs = NULL;\n    this->NumberOfOutputs = 0;\n    }\n  \n  \/\/ Set the new arrays\n  this->Outputs = outputs;\n  \n  this->NumberOfOutputs = num;\n  this->Modified();\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ Adds an output to the first null position in the output list.\n\/\/ Expands the list memory if necessary\nvoid vtkSource::AddOutput(vtkDataObject *output)\n{\n  int idx;\n  \n  if (output)\n    {\n    output->SetSource(this);\n    output->Register(this);\n    }\n  this->Modified();\n  \n  for (idx = 0; idx < this->NumberOfOutputs; ++idx)\n    {\n    if (this->Outputs[idx] == NULL)\n      {\n      this->Outputs[idx] = output;\n      return;\n      }\n    }\n  \n  this->SetNumberOfOutputs(this->NumberOfOutputs + 1);\n  this->Outputs[this->NumberOfOutputs - 1] = output;\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ Adds an output to the first null position in the output list.\n\/\/ Expands the list memory if necessary\nvoid vtkSource::RemoveOutput(vtkDataObject *output)\n{\n  int idx, loc;\n  \n  if (!output)\n    {\n    return;\n    }\n  \n  \/\/ find the output in the list of outputs\n  loc = -1;\n  for (idx = 0; idx < this->NumberOfOutputs; ++idx)\n    {\n    if (this->Outputs[idx] == output)\n      {\n      loc = idx;\n      }\n    }\n  if (loc == -1)\n    {\n    vtkDebugMacro(\"tried to remove an output that was not in the list\");\n    return;\n    }\n  \n  this->Outputs[loc]->SetSource(NULL);\n  this->Outputs[loc]->UnRegister(this);\n  this->Outputs[loc] = NULL;\n\n  \/\/ if that was the last output, then shrink the list\n  if (loc == this->NumberOfOutputs - 1)\n    {\n    this->SetNumberOfOutputs(this->NumberOfOutputs - 1);\n    }\n  \n  this->Modified();\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ Set an Output of this filter. \n\/\/ tricky because we have to manage the double pointers and keep\n\/\/ them consistent.\nvoid vtkSource::SetOutput(int idx, vtkDataObject *newOutput)\n{\n  vtkDataObject *oldOutput;\n  \n  if (idx < 0)\n    {\n    vtkErrorMacro(<< \"SetOutput: \" << idx << \", cannot set output. \");\n    return;\n    }\n  \/\/ Expand array if necessary.\n  if (idx >= this->NumberOfOutputs)\n    {\n    this->SetNumberOfOutputs(idx + 1);\n    }\n  \n  \/\/ does this change anything?\n  oldOutput = this->Outputs[idx];\n  if (newOutput == oldOutput)\n    {\n    return;\n    }\n  \n  \/\/ disconnect first existing source-output relationship.\n  if (oldOutput)\n    {\n    oldOutput->SetSource(NULL);\n    oldOutput->UnRegister(this);\n    this->Outputs[idx] = NULL;\n    }\n  \n  if (newOutput)\n    {\n    vtkSource *newOutputOldSource = newOutput->GetSource();\n\n    \/\/ Register the newOutput so it does not get deleted.\n    \/\/ Don't set the link yet until previous links is disconnected.\n    newOutput->Register(this);\n    \n    \/\/ disconnect second existing source-output relationship\n    if (newOutputOldSource)\n      {\n      newOutputOldSource->RemoveOutput(newOutput);\n      }\n    newOutput->SetSource(this);\n    }\n  \/\/ now actually make the link that was registered previously.\n  this->Outputs[idx] = newOutput;\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ Update input to this filter and the filter itself.\n\/\/ This is a streaming version of the update method.\nvoid vtkSource::InternalUpdate(vtkDataObject *output)\n{\n  int idx;\n  int numDivisions, division;\n\n  \/\/ prevent chasing our tail\n  if (this->Updating)\n    {\n    return;\n    }\n\n  \/\/ Let the source initialize the data for streaming.\n  \/\/ output->Initialize and CopyStructure ...\n  this->StreamExecuteStart();\n  \n  \/\/ Determine how many pieces we are going to process.\n  numDivisions = this->GetNumberOfStreamDivisions();\n  for (division = 0; division < numDivisions; ++division)\n    {\n    \/\/ Compute the update extent for all of the inputs.\n    if (this->ComputeDivisionExtents(output, division, numDivisions))\n      {\n      \/\/ Update the inputs\n      this->Updating = 1;\n      for (idx = 0; idx < this->NumberOfInputs; ++idx)\n\t{\n\tif (this->Inputs[idx] != NULL)\n\t  {\n\t  this->Inputs[idx]->InternalUpdate();\n\t  }\n\t}\n      this->Updating = 0;\n      \n      \/\/ Execute\n      if ( this->StartMethod )\n\t{\n\t(*this->StartMethod)(this->StartMethodArg);\n\t}\n      \/\/ reset Abort flag\n      this->AbortExecute = 0;\n      this->Progress = 0.0;\n      this->Execute();\n      if ( !this->AbortExecute )\n\t{\n\tthis->UpdateProgress(1.0);\n\t}\n      if ( this->EndMethod )\n\t{\n\t(*this->EndMethod)(this->EndMethodArg);\n\t}\n      }\n    }\n  \n  \/\/ Let the source clean up after streaming.\n  this->StreamExecuteEnd();\n  \n  for (idx = 0; idx < this->NumberOfInputs; ++idx)\n    {\n    if (this->Inputs[idx] != NULL)\n      {\n      if ( this->Inputs[idx]->ShouldIReleaseData() )\n\t{\n\tthis->Inputs[idx]->ReleaseData();\n\t}\n      }  \n    }\n  \n  \/\/ Information gets invalidated as soon as Update is called,\n  \/\/ so validate it again here.\n  this->InformationTime.Modified();\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ To facilitate a single Update method, we are putting data initialization\n\/\/ in this method.\nvoid vtkSource::StreamExecuteStart()\n{\n  int idx;\n  \n  \/\/ clear output (why isn't this ReleaseData.  Does it allocate data too?)\n  \/\/ Should it be done if StreamExecuteStart?\n  for (idx = 0; idx < this->NumberOfOutputs; idx++)\n    {\n    if (this->Outputs[idx])\n      {\n      this->Outputs[idx]->Initialize(); \n      }\n    }\n}\n\n\n\n\/\/----------------------------------------------------------------------------\nint vtkSource::ComputeDivisionExtents(vtkDataObject *output,\n\t\t\t\t      int idx, int numDivisions)\n{\n  if (idx == 0 && numDivisions == 1)\n    {\n    return this->ComputeInputUpdateExtents(output);\n    }\n  if (this->NumberOfInputs > 0)\n    {\n    vtkErrorMacro(\"Source did not implement ComputeDivisionExtents\");\n    return 0;\n    }\n  \n  return 1;\n}\n\n\n\/\/----------------------------------------------------------------------------\nint vtkSource::ComputeInputUpdateExtents(vtkDataObject *output)\n{\n  if (this->NumberOfInputs > 0)\n    {\n    vtkErrorMacro(\"Subclass did not implement ComputeInputUpdateExtents\");\n    }\n  return 1;\n}\n\n\n\n\/\/----------------------------------------------------------------------------\nvoid vtkSource::UpdateInformation()\n{\n  unsigned long t1, t2, size;\n  int locality, l2, idx;\n  vtkDataObject *pd;\n\n  if (this->Outputs[0] == NULL)\n    {\n    return;\n    }\n  \n  if (this->Updating)\n    {\n    \/\/ We are in a pipeline loop.\n    \/\/ Force an update\n    this->GetOutput(0)->Modified();\n    return;\n    }\n  \n  \/\/ Update information on the input and\n  \/\/ compute information that is general to vtkDataObject.\n  t1 = this->GetMTime();\n  size = 0;\n  locality = 0;\n\n  for (idx = 0; idx < this->NumberOfInputs; ++idx)\n    {\n    if (this->Inputs[idx] != NULL)\n      {\n      pd = this->Inputs[idx];\n\n      this->Updating = 1;\n      pd->UpdateInformation();\n      this->Updating = 0;\n      \n      \/\/ for MPI port stuff\n      l2 = pd->GetLocality();\n      if (l2 > locality)\n\t{\n\tlocality = l2;\n\t}\n      \n      \/\/ Pipeline MTime stuff\n      t2 = pd->GetPipelineMTime();\n      if (t2 > t1)\n\t{\n\tt1 = t2;\n\t}\n      \/\/ Pipeline MTime does not include the MTime of the data object itself.\n      \/\/ Factor these mtimes into the next PipelineMTime\n      t2 = pd->GetMTime();\n      if (t2 > t1)\n\t{\n\tt1 = t2;\n\t}\n      \n      \/\/ Default estimated size is just the sum of the sizes of the inputs.\n      size += pd->GetEstimatedMemorySize();\n      }\n    }\n \n  for (idx = 0; idx < this->NumberOfOutputs; ++idx)\n    {\n    if (this->GetOutput(idx))\n      {\n      this->GetOutput(idx)->SetLocality(locality + 1);\n      this->GetOutput(idx)->SetEstimatedMemorySize(size);\n      this->GetOutput(idx)->SetPipelineMTime(t1);\n      }  \n    }\n  \n  \/\/ Call ExecuteInformation for subclass specific information.\n  \/\/ Some sources (readers) have an expensive ExecuteInformation method.\n  if (t1 > this->InformationTime.GetMTime())\n    {\n    this->ExecuteInformation();\n    \/\/ This call to modify is almost useless.  Update invalidates this time.\n    \/\/ InformationTime is modified at the end of InternalUpdate too.\n    \/\/ Keep this modified in case we have multiple calls to UpdateInformation.\n    this->InformationTime.Modified();\n    }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkSource::Execute()\n{\n  vtkErrorMacro(<< \"Definition of Execute() method should be in subclass\");\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkSource::ExecuteInformation()\n{\n  \/\/vtkErrorMacro(<< \"Subclass did not implement ExecuteInformation\");\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkSource::PrintSelf(ostream& os, vtkIndent indent)\n{\n  vtkProcessObject::PrintSelf(os,indent);\n\n  if ( this->NumberOfOutputs)\n    {\n    int idx;\n    for (idx = 0; idx < this->NumberOfOutputs; ++idx)\n      {\n      os << indent << \"Output \" << idx << \": (\" << this->Outputs[idx] << \")\\n\";\n      }\n    }\n  else\n    {\n    os << indent <<\"No Outputs\\n\";\n    }\n}\n\nint vtkSource::InRegisterLoop(vtkObject *o)\n{\n  int idx;\n  int num = 0;\n  int cnum = 0;\n  int match = 0;\n  \n  for (idx = 0; idx < this->NumberOfOutputs; idx++)\n    {\n    if (this->Outputs[idx])\n      {\n      if (this->Outputs[idx] == o)\n\t{\n\tmatch = 1;\n\t}\n      if (this->Outputs[idx]->GetSource() == this)\n\t{\n\tnum++;\n\tcnum += this->Outputs[idx]->GetNetReferenceCount();\n\t}\n      }\n    }\n  \n  \/\/ if no one outside is using us\n  \/\/ and our data objects are down to one net reference\n  \/\/ and we are being asked by one of our data objects\n  if (this->ReferenceCount == num && cnum == (num + 1) && match)\n    {\n    return 1;\n    }\n  return 0;\n}\n                           \nvoid vtkSource::UnRegister(vtkObject *o)\n{\n  int idx;\n  int done = 0;\n\n  \/\/ detect the circular loop source <-> data\n  \/\/ If we have two references and one of them is my data\n  \/\/ and I am not being unregistered by my data, break the loop.\n  if (this->ReferenceCount == (this->NumberOfOutputs+1))\n    {\n    done = 1;\n    for (idx = 0; idx < this->NumberOfOutputs; idx++)\n      {\n      if (this->Outputs[idx])\n\t{\n\tif (this->Outputs[idx] == o)\n\t  {\n\t  done = 0;\n\t  }\n\tif (this->Outputs[idx]->GetNetReferenceCount() != 1)\n\t  {\n\t  done = 0;\n\t  }\n\t}\n      }\n    }\n  \n  if (this->ReferenceCount == this->NumberOfOutputs)\n    {\n    int match = 0;\n    int total = 0;\n    for (idx = 0; idx < this->NumberOfOutputs; idx++)\n      {\n      if (this->Outputs[idx])\n\t{\n\tif (this->Outputs[idx] == o)\n\t  {\n\t  match = 1;\n\t  }\n\ttotal += this->Outputs[idx]->GetNetReferenceCount();\n\t}\n      }\n    if (total == (this->NumberOfOutputs + 1) && match)\n      {\n      done = 1;\n      }\n    }\n    \n  if (done)\n    {\n    for (idx = 0; idx < this->NumberOfOutputs; idx++)\n      {\n      if (this->Outputs[idx])\n\t{\n\tthis->Outputs[idx]->SetSource(NULL);\n\t}\n      }\n    }\n  \n  this->vtkObject::UnRegister(o);\n}\n\n\n\n\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"common_headers.h\"\n\n#include \"builtins.h\"\n#include \"errors.h\"\n#include \"globals.h\"\n#include \"operations.h\"\n#include \"structs.h\"\n#include \"term.h\"\n\nvoid StructDefinition_alloc(Term* type, Term* term);\nvoid StructDefinition_copy(Term* source, Term* dest);\nvoid StructInstance_alloc(Term* type, Term* term);\nvoid StructInstance_copy(Term* type, Term* term);\n\nStructDefinition::StructDefinition()\n{\n}\n\nvoid\nStructDefinition::addField(std::string name, Term* type)\n{\n    this->fields.push_back(Field(name, type));\n}\n\nint\nStructDefinition::numFields() const\n{\n    return (int) this->fields.size();\n}\n\nTerm*\nStructDefinition::getType(int index) const\n{\n    return this->fields[index].type;\n}\n\nint\nStructDefinition::findField(std::string name)\n{\n    for (int i=0; i < numFields(); i++) {\n        if (this->fields[i].name == name)\n            return i;\n    }\n    return -1;\n}\n\nStructDefinition* as_struct_definition(Term* term)\n{\n    if (term->type != BUILTIN_STRUCT_DEFINITION_TYPE)\n        throw errors::InternalTypeError(term, BUILTIN_STRUCT_DEFINITION_TYPE);\n\n    return (StructDefinition*) term->value;\n}\n\nStructInstance* as_struct_instance(Term* term)\n{\n    \/\/ todo: type check\n    return (StructInstance*) term->value;\n}\n\nvoid StructDefinition_alloc(Term* type, Term* term)\n{\n    StructDefinition* def = new StructDefinition();\n    def->alloc = StructInstance_alloc;\n    def->copy = StructInstance_copy;\n\n    term->value = def;\n}\n\nvoid StructDefinition_copy(Term* source, Term* dest)\n{\n    *as_struct_definition(dest) = *as_struct_definition(source);\n}\n\nvoid struct_definition_add_field(Term* caller)\n{\n    \/\/ Recycling input: 0\n    string fieldName = as_string(caller->inputs[1]);\n    Term* fieldType = caller->inputs[2];\n    as_struct_definition(caller)->addField(fieldName, fieldType);\n}\n\nvoid StructInstance_alloc(Term* type, Term* term)\n{\n    StructDefinition *def = as_struct_definition(type);\n\n    int numFields = def->numFields();\n    StructInstance* structInstance = new StructInstance();\n    structInstance->fields = new Term*[numFields];\n    term->value = structInstance;\n\n    for (int i=0; i < numFields; i++)\n    {\n        Term* fieldType = def->getType(i);\n        Term* field = new Term();\n        change_type(field, fieldType);\n        structInstance->fields[i] = field;\n    }\n}\n\nvoid StructInstance_copy(Term* source, Term* dest)\n{\n    *as_struct_instance(dest) = *as_struct_instance(source);\n}\n\nvoid struct_definition_set_name(Term* caller)\n{\n    copy_term(caller->inputs[0], caller);\n\n    as_struct_definition(caller)->name = as_string(caller->inputs[1]);\n}\n\nvoid struct_get_field(Term* caller)\n{\n    StructDefinition* def = as_struct_definition(caller->inputs[0]->type);\n    string fieldName = as_string(caller->inputs[1]);\n\n    int fieldIndex = def->findField(fieldName);\n    if (fieldIndex == -1)\n        throw errors::InternalError(string(\"Field \" ) + fieldName + \" not found.\");\n\n    Term* fieldType = def->getType(fieldIndex);\n    specialize_type(caller, fieldType);\n\n    StructInstance* structInstance = as_struct_instance(caller->inputs[0]);\n    Term* field = structInstance->fields[fieldIndex];\n\n    copy_term(field, caller);\n}\n\nvoid struct_set_field(Term* caller)\n{\n    \/\/ Temp: Copy the target struct\n    specialize_type(caller, caller->inputs[0]->type);\n    copy_term(caller->inputs[0], caller);\n    \n    string fieldName = as_string(caller->inputs[1]);\n    Term* value = caller->inputs[2];\n    StructDefinition* def = as_struct_definition(caller->type);\n\n    int fieldIndex = def->findField(fieldName);\n    if (fieldIndex == -1)\n        throw errors::InternalError(string(\"Field \" ) + fieldName + \" not found.\");\n\n    StructInstance* structInstance = as_struct_instance(caller);\n    Term* field = structInstance->fields[fieldIndex];\n\n    copy_term(value, field);\n}\n\nvoid initialize_structs(CodeUnit* code)\n{\n    BUILTIN_STRUCT_DEFINITION_TYPE = quick_create_type(KERNEL, \"StructDefinition\", StructDefinition_alloc, NULL, StructDefinition_copy);\n    quick_create_function(code, \"get-field\", struct_get_field,\n        TermList(GetGlobal(\"any\"), GetGlobal(\"string\")), GetGlobal(\"any\"));\n    quick_create_function(code, \"set-field\", struct_set_field,\n        TermList(GetGlobal(\"any\"), GetGlobal(\"string\"), GetGlobal(\"any\")),\n        GetGlobal(\"any\"));\n\n    Term* add_field = quick_create_function(code, \"add-field\", struct_definition_add_field,\n        TermList(GetGlobal(\"StructDefinition\"), GetGlobal(\"string\"), GetGlobal(\"Type\")),\n        GetGlobal(\"StructDefinition\"));\n    as_function(add_field)->recycleInput = 0;\n\n    quick_create_function(code, \"struct-definition-set-name\", struct_definition_set_name,\n        TermList(GetGlobal(\"StructDefinition\"), GetGlobal(\"string\")),\n        GetGlobal(\"StructDefinition\"));\n}\n<commit_msg>About to add init functions<commit_after>#include \"common_headers.h\"\n\n#include \"builtins.h\"\n#include \"errors.h\"\n#include \"globals.h\"\n#include \"operations.h\"\n#include \"structs.h\"\n#include \"term.h\"\n\nvoid StructDefinition_alloc(Term* type, Term* term);\nvoid StructDefinition_copy(Term* source, Term* dest);\nvoid StructInstance_alloc(Term* type, Term* term);\nvoid StructInstance_copy(Term* type, Term* term);\n\nStructDefinition::StructDefinition()\n{\n}\n\nvoid\nStructDefinition::addField(std::string name, Term* type)\n{\n    this->fields.push_back(Field(name, type));\n}\n\nint\nStructDefinition::numFields() const\n{\n    return (int) this->fields.size();\n}\n\nTerm*\nStructDefinition::getType(int index) const\n{\n    return this->fields[index].type;\n}\n\nint\nStructDefinition::findField(std::string name)\n{\n    for (int i=0; i < numFields(); i++) {\n        if (this->fields[i].name == name)\n            return i;\n    }\n    return -1;\n}\n\nStructDefinition* as_struct_definition(Term* term)\n{\n    if (term->type != BUILTIN_STRUCT_DEFINITION_TYPE)\n        throw errors::InternalTypeError(term, BUILTIN_STRUCT_DEFINITION_TYPE);\n\n    return (StructDefinition*) term->value;\n}\n\nStructInstance* as_struct_instance(Term* term)\n{\n    \/\/ todo: type check\n    return (StructInstance*) term->value;\n}\n\nvoid StructDefinition_alloc(Term* type, Term* term)\n{\n    StructDefinition* def = new StructDefinition();\n    def->alloc = StructInstance_alloc;\n    def->copy = StructInstance_copy;\n\n    term->value = def;\n}\n\nvoid StructDefinition_copy(Term* source, Term* dest)\n{\n    *as_struct_definition(dest) = *as_struct_definition(source);\n}\n\nvoid struct_definition_add_field(Term* caller)\n{\n    \/\/ Recycling input: 0\n    string fieldName = as_string(caller->inputs[1]);\n    Term* fieldType = caller->inputs[2];\n    as_struct_definition(caller)->addField(fieldName, fieldType);\n}\n\nvoid StructInstance_alloc(Term* type, Term* term)\n{\n    StructDefinition *def = as_struct_definition(type);\n\n    int numFields = def->numFields();\n    StructInstance* structInstance = new StructInstance();\n    structInstance->fields = new Term*[numFields];\n    term->value = structInstance;\n\n    for (int i=0; i < numFields; i++)\n    {\n        Term* fieldType = def->getType(i);\n        Term* field = new Term();\n        change_type(field, fieldType);\n        structInstance->fields[i] = field;\n    }\n}\n\nvoid StructInstance_copy(Term* source, Term* dest)\n{\n    *as_struct_instance(dest) = *as_struct_instance(source);\n}\n\nvoid struct_definition_set_name(Term* caller)\n{\n    copy_term(caller->inputs[0], caller);\n\n    as_struct_definition(caller)->name = as_string(caller->inputs[1]);\n}\n\nvoid struct_get_field(Term* caller)\n{\n    StructDefinition* def = as_struct_definition(caller->inputs[0]->type);\n    string fieldName = as_string(caller->inputs[1]);\n\n    int fieldIndex = def->findField(fieldName);\n    if (fieldIndex == -1)\n        throw errors::InternalError(string(\"Field \" ) + fieldName + \" not found.\");\n\n    Term* fieldType = def->getType(fieldIndex);\n    specialize_type(caller, fieldType);\n\n    StructInstance* structInstance = as_struct_instance(caller->inputs[0]);\n    Term* field = structInstance->fields[fieldIndex];\n\n    copy_term(field, caller);\n}\n\nvoid struct_set_field_init(Term* caller)\n{\n    \/\/ Propagate type\n    specialize_type(caller, caller->inputs[0]->type);\n}\n\nvoid struct_set_field(Term* caller)\n{\n    \/\/ Recycles input 0\n    \/\/ Temp: copy by hand\n    specialize_type(caller, caller->inputs[0]->type);\n    copy_term(caller->inputs[0], caller);\n\n    string fieldName = as_string(caller->inputs[1]);\n    Term* value = caller->inputs[2];\n    StructDefinition* def = as_struct_definition(caller->type);\n\n    int fieldIndex = def->findField(fieldName);\n    if (fieldIndex == -1)\n        throw errors::InternalError(string(\"Field \" ) + fieldName + \" not found.\");\n\n    StructInstance* structInstance = as_struct_instance(caller);\n    Term* field = structInstance->fields[fieldIndex];\n\n    copy_term(value, field);\n}\n\nvoid initialize_structs(CodeUnit* code)\n{\n    BUILTIN_STRUCT_DEFINITION_TYPE = quick_create_type(KERNEL, \"StructDefinition\", StructDefinition_alloc, NULL, StructDefinition_copy);\n    quick_create_function(code, \"get-field\", struct_get_field,\n        TermList(GetGlobal(\"any\"), GetGlobal(\"string\")), GetGlobal(\"any\"));\n\n    Term* set_field = quick_create_function(code, \"set-field\", struct_set_field,\n        TermList(GetGlobal(\"any\"), GetGlobal(\"string\"), GetGlobal(\"any\")),\n        GetGlobal(\"any\"));\n    \/\/ as_function(set_field)->recycleInput = 0;\n    as_function(set_field)->initialize = struct_set_field_init;\n\n    Term* add_field = quick_create_function(code, \"add-field\", struct_definition_add_field,\n        TermList(GetGlobal(\"StructDefinition\"), GetGlobal(\"string\"), GetGlobal(\"Type\")),\n        GetGlobal(\"StructDefinition\"));\n    as_function(add_field)->recycleInput = 0;\n\n    quick_create_function(code, \"struct-definition-set-name\", struct_definition_set_name,\n        TermList(GetGlobal(\"StructDefinition\"), GetGlobal(\"string\")),\n        GetGlobal(\"StructDefinition\"));\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\r\n#include <ctime>\r\n#include \"arbreCubes.cpp\"\r\n\r\nusing namespace std;\r\n\r\n\/\/------------------------------------------------------------------------------\r\n\/\/ Fonctionnalités de chronométrage\r\n\/**\r\n * @var chrono\r\n * @brief chronomètre du programme\r\n**\/\r\nclock_t chrono;\r\n\r\n\/**\r\n * @def START\r\n * @brief démarre le chronomètre\r\n**\/\r\n#define START chrono=clock()\r\n\r\n\/**\r\n * @def STOP\r\n * @brief arrête le chronomètre\r\n**\/\r\n#define STOP chrono=clock()-chrono\r\n\r\n\/**\r\n * @def TEMPS\r\n * @brief donne le temps du chronomètre (après arrêt)\r\n**\/\r\n#define TEMPS double(chrono)\/CLOCKS_PER_SEC\r\n\r\n\/\/------------------------------------------------------------------------------\r\n\/\/ Programme principal\r\nint main()\r\n{\r\n\tstring nomfic = \".\/FichiersTests\/cubes10_4.txt\";\r\n\r\n\tcout << \"CONSTRUCTION\" << endl;\r\n\tcout << \"------------\" << endl;\r\n\tSTART;\r\n\tarbrecubes AC(nomfic);\r\n\tSTOP;\r\n\tcout << \">>> Temps : \" << TEMPS << \"s\" << endl << endl;\r\n\t\r\n\tcout << \"LISTAGE DES premier cube posé sur la table\" << endl;\r\n\tcout << \"------------\" << endl;\r\n\tSTART;\r\n\tvector<cube> liste = AC.dessus(AC.table());\r\n\tvector<cube>::iterator it = liste.begin();\r\n\tfor ( int i = 0; i < 100; i++ ){\r\n\t\tAC.dessus(AC.table());\r\n\t}\r\n\tfor(it;it != liste.end(); it++)\r\n\t\tcout<<\" coordonnée :\"<<(*it).centre().x<<\",\"<<(*it).centre().y <<\"||\"<<(*it).cote()<<endl;\r\n\t\t \r\n\tSTOP;\r\n\tcout << \">>> Temps : \" << TEMPS << \"s\" << endl << endl;\r\n\t\r\n\tcout << \"SOUTIEN\" << endl;\r\n\tcout << \"------------\" << endl;\r\n\tSTART;\r\n\tcube soutien = AC.soutien(liste[1]);\r\n\tcout<<\" le cube soutenant [\"<<liste[1].centre().x<<\",\"<<liste[1].centre().y <<\"||\"<<liste[1].cote()<<\"]\"<< \"est :\"<<endl;\r\n\tcout<<\"[\"<<soutien.centre().x<<\",\"<<soutien.centre().y <<\"||\"<<soutien.cote()<<\"]\"<<endl;\t\r\n\tSTOP;\r\n\tcout << \">>> Temps : \" << TEMPS << \"s\" << endl << endl;\r\n\t\r\n\tcout << \"AJOUTER\" << endl;\r\n\tcout << \"------------\" << endl;\r\n\tSTART;\r\n\tAC.ajouter(liste[1]);\r\n\tSTOP;\r\n\tcout << \">>> Temps : \" << TEMPS<< \"s\" << endl << endl;\r\n\t\r\n\tdouble temps2 = 0;\r\n\tint cpt = 0;\r\n\tifstream fic(nomfic.c_str());\r\n   \tassert(fic.is_open());\r\n    \tstring ligne;\r\n    \tgetline(fic,ligne);\r\n\twhile(!fic.eof() && cpt < 1000)\r\n    \t{\r\n        stringstream ss(ligne);\r\n        int x,y,largeur;\r\n        ss >> x >> y >> largeur;\r\n        point P(x,y);\r\n        cube CC(P,largeur);\r\n\tcout << \"SUPPRIMER\" << endl;\r\n\tcout << \"------------\" << endl;\r\n\tSTART;\r\n\tAC.supprimer(CC);\r\n\ttemps2 = temps2 + TEMPS;\r\n\tSTOP;\r\n\tcout << \">>> Temps : \" << temps2<< \"s\" << endl << endl;         \r\n\tgetline(fic,ligne);\r\n\t\r\n\t}\t\r\n\r\n\treturn 0;\r\n}\r\n<commit_msg>fdsffgfd<commit_after>#include <iostream>\r\n#include <ctime>\r\n#include \"arbreCubes.cpp\"\r\n\r\nusing namespace std;\r\n\r\n\/\/------------------------------------------------------------------------------\r\n\/\/ Fonctionnalités de chronométrage\r\n\/**\r\n * @var chrono\r\n * @brief chronomètre du programme\r\n**\/\r\nclock_t chrono;\r\n\r\n\/**\r\n * @def START\r\n * @brief démarre le chronomètre\r\n**\/\r\n#define START chrono=clock()\r\n\r\n\/**\r\n * @def STOP\r\n * @brief arrête le chronomètre\r\n**\/\r\n#define STOP chrono=clock()-chrono\r\n\r\n\/**\r\n * @def TEMPS\r\n * @brief donne le temps du chronomètre (après arrêt)\r\n**\/\r\n#define TEMPS double(chrono)\/CLOCKS_PER_SEC\r\n\r\n\/\/------------------------------------------------------------------------------\r\n\/\/ Programme principal\r\nint main()\r\n{\r\n\tstring nomfic = \".\/FichiersTests\/cubes10_4.txt\";\r\n\r\n\tcout << \"CONSTRUCTION\" << endl;\r\n\tcout << \"------------\" << endl;\r\n\tSTART;\r\n\tarbrecubes AC(nomfic);\r\n\tSTOP;\r\n\tcout << \">>> Temps : \" << TEMPS << \"s\" << endl << endl;\r\n\t\r\n\tcout << \"LISTAGE DES premier cube posé sur la table\" << endl;\r\n\tcout << \"------------\" << endl;\r\n\tSTART;\r\n\tvector<cube> liste = AC.dessus(AC.table());\r\n\tvector<cube>::iterator it = liste.begin();\r\n\tfor ( int i = 0; i < 100; i++ ){\r\n\t\tAC.dessus(AC.table());\r\n\t}\r\n\tfor(it;it != liste.end(); it++)\r\n\t\tcout<<\" coordonnée :\"<<(*it).centre().x<<\",\"<<(*it).centre().y <<\"||\"<<(*it).cote()<<endl;\r\n\t\t \r\n\tSTOP;\r\n\tcout << \">>> Temps : \" << TEMPS << \"s\" << endl << endl;\r\n\t\r\n\tcout << \"SOUTIEN\" << endl;\r\n\tcout << \"------------\" << endl;\r\n\tSTART;\r\n\tcube soutien = AC.soutien(liste[1]);\r\n\tcout<<\" le cube soutenant [\"<<liste[1].centre().x<<\",\"<<liste[1].centre().y <<\"||\"<<liste[1].cote()<<\"]\"<< \"est :\"<<endl;\r\n\tcout<<\"[\"<<soutien.centre().x<<\",\"<<soutien.centre().y <<\"||\"<<soutien.cote()<<\"]\"<<endl;\t\r\n\tSTOP;\r\n\tcout << \">>> Temps : \" << TEMPS << \"s\" << endl << endl;\r\n\r\n\tcout << \"SUPPRIMER\" << endl;\r\n\tcout << \"------------\" << endl;\r\n\tdouble temps2 = 0;\r\n\tint cpt = 0;\r\n\tifstream fic(nomfic.c_str());\r\n   \tassert(fic.is_open());\r\n    \tstring ligne;\r\n    \tgetline(fic,ligne);\r\n\twhile(!fic.eof() && cpt < 1)\r\n    \t{\r\n\t\tstringstream ss(ligne);\r\n\t\tint x,y,largeur;\r\n\t\tss >> x >> y >> largeur;\r\n\t\tpoint P(x,y);\r\n\t\tcube CC(P,largeur);\r\n\t\tSTART;\r\n\t\tAC.supprimer(CC);\r\n\t\tSTOP;\r\n\t\ttemps2 = temps2 + TEMPS;\r\n\t\tcpt = cpt + 1;\r\n\t}\r\n\tcout << \">>> Temps : \" << temps2<< \"s\" << endl << endl;         \r\n\t\tgetline(fic,ligne);\t\r\n\r\n\treturn 0;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\nCopyright (c) 2010, Anton Petersson < anton (at) anp.nu >\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n    * Redistributions of source code must retain the above copyright\n      notice, this list of conditions and the following disclaimer.\n    * Redistributions in binary form must reproduce the above copyright\n      notice, this list of conditions and the following disclaimer in the\n      documentation and\/or other materials provided with the distribution.\n\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#include <vector>\n#include <algorithm>\n#include <string>\n#include <sstream>\n#include <fircc\/networkcache.h>\n#include <fircc\/channelcache.h>\n#include \"inc\/userinfo.h\"\n#include \"inc\/utilities.h\"\n#include <stdexcept>\n#include <anpcode\/log_singleton.h>\n#include <anpcode\/anp_threading.h>\n#include <stdint.h>\n\nnamespace anp\n{\nnamespace irc\n{\n\n\tstruct ChannelUserRelation\n\t{\n\t\tChannelUserRelation(const std::string &channel,\n                            const std::string &user, uint32_t modes):\n\t\tm_channel(channel),\n\t\tm_user(user),\n\t\tm_modes(modes)\n\t\t{\n\t\t}\n\t\tuint32_t m_modes;\n\t\tstd::string m_channel;\n\t\tstd::string m_user;\n\t};\n\n\t\/\/ Use to sort on channel only\n\tstatic int channeluserrelation_compareC(const ChannelUserRelation &r1,\n\t\t\t\t\t\t\t\t\tconst ChannelUserRelation &r2)\n\t{\n\t\treturn r1.m_channel.compare(r2.m_channel);\n\t}\n\n\t\/\/ Use to sort on channel, user\n\tstatic int channeluserrelation_compareCU(const ChannelUserRelation &r1,\n\t\t\t\t\t\t\t\t\tconst ChannelUserRelation &r2)\n\t{\n\t\tint ret = r1.m_channel.compare(r2.m_channel);\n\t\tif ( 0 == ret )\n\t\t{\n\t\t\treturn r1.m_user.compare(r2.m_user);\n\t\t}\n\t\treturn ret;\n\t}\n\n\t\/\/ pImpl object\n\tclass NetworkCacheImpl\n\t{\n\tpublic:\n\t\t~NetworkCacheImpl();\n\n\t\tconst ChannelCache *channel(const std::string &name) const;\n\t\tChannelCache *channel(const std::string &name);\n\t\tconst ChannelCache *getChannelCopy(\n\t\t\t\t\t\t\t\t\t\tconst std::string &name) const;\n\t\tvoid getChannelCopy(const std::string &name,\n\t\t\t\t\t\t\t\t\t\t\t\tChannelCache &dest) const;\n\t\t\n\t\tUserInfo *userByName(const std::string &name);\n\t\tstd::vector<ChannelCache *> m_channels;\n\t\tstd::vector<ChannelUserRelation> m_cuRelations;\n\t\tstd::string m_clientNickName;\n\t\tLogSingletonHelper m_log;\n\t\tanp::threading::Mutex m_mutex;\n\tprivate:\n\t\tstd::vector<UserInfo *> m_users;\n\t};\n\n\tNetworkCacheImpl::~NetworkCacheImpl()\n\t{\n\t\tanp::threading::Lock lock(m_mutex);\n\n\t\tstd::vector<ChannelCache *>::iterator c;\n\t\tfor ( c=m_channels.begin(); c != m_channels.end(); c++ )\n\t\t{\n\t\t\tdelete (*c);\n\t\t}\n\t\tm_channels.clear();\n\n\t\tstd::vector<UserInfo *>::iterator u;\n\t\tfor ( u=m_users.begin(); u != m_users.end(); u++ )\n\t\t{\n\t\t\tdelete (*u);\n\t\t}\n\t\tm_users.clear();\n\t}\n\n\tconst ChannelCache *NetworkCacheImpl::channel(\n\t\t\t\t\t\t\t\t\t\tconst std::string &name) const\n\t{\n\t\tChannelCache tempChan(name);\n\t\tstd::vector<ChannelCache *>::const_iterator i = std::lower_bound(\n\t\t\tm_channels.begin(), m_channels.end(), &tempChan,\n\n\t\tchannelinfo_compare);\n\t\tif ( i != m_channels.end() )\n\t\t{\n\t\t\treturn (*i);\n\t\t} else\n\t\t{\n\t\t\tthrow std::runtime_error(\"Unable to find channel.\");\n\t\t}\n\t\tthrow std::logic_error(\"Reached an unreachable point in code.\");\n\t\treturn NULL; \/\/ Should never happen\n\t}\n\n\tChannelCache *NetworkCacheImpl::channel(\n\t\t\t\t\t\t\t\t\t\tconst std::string &name)\n\t{\n\t\tChannelCache tempChan(name);\n\t\tstd::vector<ChannelCache *>::iterator i = std::lower_bound(\n\t\t\tm_channels.begin(), m_channels.end(), &tempChan,\n\t\t\tchannelinfo_compare);\n\t\tif ( i != m_channels.end() )\n\t\t{\n\t\t\treturn (*i);\n\t\t} else\n\t\t{\n\t\t\tstd::stringstream err;\n\t\t\terr << \"Unable to find channel: \" << name;\n\t\t\tthrow std::runtime_error(err.str());\n\t\t}\n\t\tthrow std::logic_error(\"Reached an unreachable point in code.\");\n\t\treturn NULL; \/\/ Should never happen\n\t}\n\n\tvoid NetworkCacheImpl::getChannelCopy(const std::string &name,\n\t\t\t\t\t\t\t\t\tChannelCache &dest) const\n\t{\n\t\tdest = *this->channel(name);\n\t}\n\n\tUserInfo *NetworkCacheImpl::userByName(const std::string &name) {\n\t\tUserInfo temp(name, \"\", \"\");\n\t\tstd::pair<\n\t\t\tstd::vector<UserInfo *>::iterator,\n\t\t\tstd::vector<UserInfo *>::iterator\n\t\t> res = std::equal_range(m_users.begin(), m_users.end(),\n\t\t\t\t\t\t\t&temp, userinfo_compare);\n\t\tif ( res.first != m_users.end() )\n\t\t{\n\t\t\treturn *res.first;\n\t\t} else\n\t\t{\n\t\t\treturn NULL;\n\t\t}\n\t}\n\t\n\t\/\/ Wrapper functions\n\tNetworkCache::NetworkCache():\n\tm_impl(new NetworkCacheImpl)\n\t{\n\t}\n\n\tNetworkCache::~NetworkCache()\n\t{\n\t\tdelete m_impl;\n\t}\n\t\n\tvoid NetworkCache::getChannel(const std::string &name,\n\t\t\t\t\t\t\t\t\tChannelCache &dest) const\n\t{\n\t\tanp::threading::Lock lock(m_impl->m_mutex);\n\n\t\tm_impl->getChannelCopy(name, dest);\n\t}\n\n\tvoid NetworkCache::addChannel(const std::string &channel)\n\t{\n\t\tanp::threading::Lock lock(m_impl->m_mutex);\n\t\t\n\t\t\/\/ TODO: Cache this channel here, since \"addUserToChannel\" will\n\t\t\/\/ likely be called next, upon some RPL_NAMREPLY\n\t\tChannelCache *temp = new ChannelCache(channel);\n\t\tstd::vector<ChannelCache *> &list = m_impl->m_channels;\n\t\tlist.insert(std::lower_bound(list.begin(),\n\t\t\tlist.end(), temp, channelinfo_compare), temp);\n\t}\n\n\tvoid NetworkCache::removeChannel(const std::string &channel)\n\t{\n\t\tanp::threading::Lock lock(m_impl->m_mutex);\n\n\t\tChannelCache temp(channel);\n\t\tstd::vector<ChannelCache *> &list = m_impl->m_channels;\n\t\tstd::vector<ChannelCache *>::iterator i = \n\t\ti = std::lower_bound(list.begin(),\n\t\t\tlist.end(), &temp, channelinfo_compare);\n\t\tif ( i != list.end() )\n\t\t{\n\t\t\tdelete (*i);\n\t\t\tlist.erase(i);\n\t\t}\n\n\t\t\/\/ Remove entries in relation table\n\t\tremoveAllUsersFromChannel(channel);\n\t}\n\n\tvoid NetworkCache::addUserToChannel(const std::string &name,\n\t\t\t\t\t\t\t  const std::string &user,\n\t\t\t\t\t\t\t  const std::string &host,\n\t\t\t\t\t\t\t  const std::string &channelName)\n\t{\n\t\tanp::threading::Lock lock(m_impl->m_mutex);\n\n\t\tChannelCache *channel = m_impl->channel(channelName);\n\t\t\n\t\tChannelUserRelation newRelation(channelName, name, 0);\n\t\tstd::vector<ChannelUserRelation> &table = m_impl->m_cuRelations;\n\n\t\t\/\/ Avoid duplicates (drop duplicates silently without\n\t\t\/\/ exceptions or anything)\n\t\tif ( table.empty() || !std::binary_search(table.begin(), \n\t\t\t\ttable.end(), newRelation,\n\t\t\t\tchanneluserrelation_compareCU) )\n\t\t{\n\t\t\tstd::stringstream ss;\n\t\t\tss << \"(cache) Added '\" << name << \"' to '\"\n\t\t\t\t<< channelName << \"'.\";\n\t\t\tANPLOGD(\"libfirc\", ss.str());\n\t\t\ttable.insert(\n\t\t\t\tstd::lower_bound(\n\t\t\t\t\ttable.begin(),\n\t\t\t\t\ttable.end(),\n\t\t\t\t\tnewRelation,\n\t\t\t\t\tchanneluserrelation_compareCU\n\t\t\t\t),\n\t\t\t\tnewRelation\n\t\t\t);\n\t\t} else\n\t\t{\n\t\t\tstd::stringstream ss;\n\t\t\tss << \"(cache) Didn't add '\" << name << \"' to '\"\n\t\t\t\t<< channelName << \"' because of binary_search. table.size()=\"\n\t\t\t\t<< table.size();\n\t\t\tANPLOGD(\"libfirc\", ss.str());\n\t\t}\n\t}\n\t\n\t\/**\n\t\tRemoves a channel - user relation.\n\n\t\t@param name\n\t\tNickname of the user.\n\n\t\t@param channelName\n\t\tName of the channel.\n\n\t\t@remark\n\t\tAssumes there's no duplicate entries.\n\t*\/\n\tvoid NetworkCache::removeUserFromChannel(const std::string &name,\n                                             const std::string &channelName)\n\t{\n\t\tanp::threading::Lock lock(m_impl->m_mutex);\n\n\t\tChannelUserRelation tempRel(channelName, name, 0);\n\t\tstd::vector<ChannelUserRelation> &table = m_impl->m_cuRelations;\n\t\tstd::pair<\n\t\t\tstd::vector<ChannelUserRelation>::iterator,\n\t\t\tstd::vector<ChannelUserRelation>::iterator\n\t\t> range = std::equal_range(table.begin(), table.end(), tempRel,\n\t\t\t\t\t\t\t\t\tchanneluserrelation_compareC);\n\n\t\tif ( range.first != table.end() ) \/\/ equal_range() succeeded?\n\t\t{\n\t\t\t\/\/ infinite loop while ( range.first != range.second )\n\t\t\tbool erased = false;\n\t\t\twhile ( !erased && range.first != range.second )\n\t\t\t{\n\t\t\t\tif ( (*range.first).m_user == name )\n\t\t\t\t{\n\t\t\t\t\trange.first = table.erase(range.first);\n\t\t\t\t\tstd::stringstream ss;\n\t\t\t\t\tss << \"(cache) Removed '\" << name\n\t\t\t\t\t\t<< \"' from '\" << channelName << \"'.\";\n\t\t\t\t\tANPLOGD(\"libfirc\", ss.str());\n\t\t\t\t\terased = true;\n\t\t\t\t} else\n\t\t\t\t{\n\t\t\t\t\trange.first++;\n\t\t\t\t}\n\t\t\t}\n\t\t} else\n\t\t{\n\t\t\tstd::stringstream ss;\n\t\t\tss << \"Unable to find channel '\" << channelName << \"'.\";\n\t\t\tANPLOGD(\"libfirc\", ss.str());\n\t\t\tthrow std::runtime_error(ss.str());\n\t\t}\n\t}\n\n\tvoid NetworkCache::removeAllUsersFromChannel(\n\t\t\t\t\t\t\t\tconst std::string &channel)\n\t{\n\t\tanp::threading::Lock lock(m_impl->m_mutex);\n\n\t\tChannelUserRelation tempRel(channel, \"\", 0);\n\t\tstd::vector<ChannelUserRelation> &table = m_impl->m_cuRelations;\n\t\tstd::pair<\n\t\t\tstd::vector<ChannelUserRelation>::iterator,\n\t\t\tstd::vector<ChannelUserRelation>::iterator\n\t\t> range = std::equal_range(table.begin(), table.end(), tempRel,\n\t\t\t\t\t\t\t\t\tchanneluserrelation_compareC);\n\t\t\n\t\tstd::stringstream ss;\n\t\tss << \"Erasing all users in \" << channel;\n\t\tANPLOGD(\"libfirc\", ss.str());\n\t\ttable.erase(range.first, range.second);\n\t}\n\n\tvoid NetworkCache::setTopic(const std::string &channelName,\n\t\t\t\t\t\t\t\tconst std::string &topic)\n\t{\n\t\tanp::threading::Lock lock(m_impl->m_mutex);\n\n\t\tChannelCache *channel = m_impl->channel(channelName);\n\t\tchannel->setTopic(topic);\n\t}\n\n\tvoid NetworkCache::setClientNickName(\n\t\t\t\t\t\t\tconst std::string &clientNickName)\n\t{\n\t\tanp::threading::Lock lock(m_impl->m_mutex);\n\n\t\tm_impl->m_clientNickName = clientNickName;\n\t}\n\n\tvoid NetworkCache::getClientNickName(\n\t\t\t\t\t\t\tstd::string &clientNickName) const\n\t{\n\t\tanp::threading::Lock lock(m_impl->m_mutex);\n\n\t\tclientNickName = m_impl->m_clientNickName;\n\t}\n\t\n\tvoid NetworkCache::getUsersInChannel(const std::string &name,\n                        anp::IWritableContainer<std::string> &userList) const\n\t{\n\t\tanp::threading::Lock lock(m_impl->m_mutex);\n\t\t\n\t\tChannelUserRelation tempRel(name, \"\", 0);\n\t\tstd::vector<ChannelUserRelation> &table = m_impl->m_cuRelations;\n\t\tstd::pair<\n\t\t\tstd::vector<ChannelUserRelation>::iterator,\n\t\t\tstd::vector<ChannelUserRelation>::iterator\n\t\t> range = std::equal_range(table.begin(), table.end(), tempRel,\n\t\t\t\t\t\t\t\t\tchanneluserrelation_compareC);\n\/\/ todo: UserList copy constructor\n\t\tif ( range.first != table.end() ) \/\/ equal_range() succeeded?\n\t\t{\n\t\t\twhile ( range.first != range.second )\n\t\t\t{\n\t\t\t\tuserList.pushBack((*range.first).m_user);\n\t\t\t\trange.first++;\n\t\t\t}\n\t\t} else\n\t\t{\n\t\t\tstd::stringstream ss;\n\t\t\tss << \"Unable to find channel '\" << name << \"'.\";\n\t\t\tANPLOGD(\"libfirc\", ss.str());\n\t\t\tthrow std::runtime_error(ss.str());\n\t\t}\n\t}\n\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\/\/ Event subscriber interfaces\n\t\n\tvoid NetworkCache::receiveEvent(anp::irc::events::NumericReply &event)\n\t{\n\t\tconst std::string &command = event.command();\n\n\t\tif ( command == \"332\" ) \/\/ RPL_TOPIC\n\t\t{\n\t\t\tsetTopic(event.param(1), event.param(2));\n\t\t}\n\t}\n\n\tvoid NetworkCache::receiveEvent(anp::irc::events::Join &event)\n\t{\n\t\tconst MsgPrefix &origin = event.origin();\n\t\tstd::string clientNickName;\n\n\t\tgetClientNickName(clientNickName);\n\t\tif ( origin.nick() == clientNickName )\n\t\t{\n\t\t\taddChannel(event.channel());\n\t\t}\n\t\taddUserToChannel(origin.nick(),\n\t\t\t\t\t\t origin.user(),\n\t\t\t\t\t\t origin.host(),\n\t\t\t\t\t\t event.channel());\n\t}\n\n\tvoid NetworkCache::receiveEvent(anp::irc::events::Part &event)\n\t{\n\t\tconst MsgPrefix &origin = event.origin();\n\t\tstd::string clientNickName;\n\n\t\tgetClientNickName(clientNickName);\n\t\tif ( origin.nick() == clientNickName )\n\t\t{\n\t\t\tremoveChannel(event.channel());\n\t\t} else\n\t\t{\n\t\t\tremoveUserFromChannel(origin.nick(), event.channel());\n\t\t}\n\t}\n\tvoid NetworkCache::receiveEvent(anp::irc::events::Topic &event)\n\t{\n\t\tsetTopic(event.channel(), event.topic());\n\t}\n}\n}\n<commit_msg>Fix deadlock<commit_after>\/*\n\nCopyright (c) 2010, Anton Petersson < anton (at) anp.nu >\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n    * Redistributions of source code must retain the above copyright\n      notice, this list of conditions and the following disclaimer.\n    * Redistributions in binary form must reproduce the above copyright\n      notice, this list of conditions and the following disclaimer in the\n      documentation and\/or other materials provided with the distribution.\n\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#include <vector>\n#include <algorithm>\n#include <string>\n#include <sstream>\n#include <fircc\/networkcache.h>\n#include <fircc\/channelcache.h>\n#include \"inc\/userinfo.h\"\n#include \"inc\/utilities.h\"\n#include <stdexcept>\n#include <anpcode\/log_singleton.h>\n#include <anpcode\/anp_threading.h>\n#include <stdint.h>\n\nnamespace anp\n{\nnamespace irc\n{\n\n\tstruct ChannelUserRelation\n\t{\n\t\tChannelUserRelation(const std::string &channel,\n                            const std::string &user, uint32_t modes):\n\t\tm_channel(channel),\n\t\tm_user(user),\n\t\tm_modes(modes)\n\t\t{\n\t\t}\n\t\tuint32_t m_modes;\n\t\tstd::string m_channel;\n\t\tstd::string m_user;\n\t};\n\n\t\/\/ Use to sort on channel only\n\tstatic int channeluserrelation_compareC(const ChannelUserRelation &r1,\n\t\t\t\t\t\t\t\t\tconst ChannelUserRelation &r2)\n\t{\n\t\treturn r1.m_channel.compare(r2.m_channel);\n\t}\n\n\t\/\/ Use to sort on channel, user\n\tstatic int channeluserrelation_compareCU(const ChannelUserRelation &r1,\n\t\t\t\t\t\t\t\t\tconst ChannelUserRelation &r2)\n\t{\n\t\tint ret = r1.m_channel.compare(r2.m_channel);\n\t\tif ( 0 == ret )\n\t\t{\n\t\t\treturn r1.m_user.compare(r2.m_user);\n\t\t}\n\t\treturn ret;\n\t}\n\n\t\/\/ pImpl object\n\tclass NetworkCacheImpl\n\t{\n\tpublic:\n\t\t~NetworkCacheImpl();\n\n\t\tconst ChannelCache *channel(const std::string &name) const;\n\t\tChannelCache *channel(const std::string &name);\n\t\tconst ChannelCache *getChannelCopy(\n\t\t\t\t\t\t\t\t\t\tconst std::string &name) const;\n\t\tvoid getChannelCopy(const std::string &name,\n\t\t\t\t\t\t\t\t\t\t\t\tChannelCache &dest) const;\n\t\t\n\t\tUserInfo *userByName(const std::string &name);\n\t\tstd::vector<ChannelCache *> m_channels;\n\t\tstd::vector<ChannelUserRelation> m_cuRelations;\n\t\tstd::string m_clientNickName;\n\t\tLogSingletonHelper m_log;\n\t\tanp::threading::Mutex m_mutex;\n\tprivate:\n\t\tstd::vector<UserInfo *> m_users;\n\t};\n\n\tNetworkCacheImpl::~NetworkCacheImpl()\n\t{\n\t\tanp::threading::Lock lock(m_mutex);\n\n\t\tstd::vector<ChannelCache *>::iterator c;\n\t\tfor ( c=m_channels.begin(); c != m_channels.end(); c++ )\n\t\t{\n\t\t\tdelete (*c);\n\t\t}\n\t\tm_channels.clear();\n\n\t\tstd::vector<UserInfo *>::iterator u;\n\t\tfor ( u=m_users.begin(); u != m_users.end(); u++ )\n\t\t{\n\t\t\tdelete (*u);\n\t\t}\n\t\tm_users.clear();\n\t}\n\n\tconst ChannelCache *NetworkCacheImpl::channel(\n\t\t\t\t\t\t\t\t\t\tconst std::string &name) const\n\t{\n\t\tChannelCache tempChan(name);\n\t\tstd::vector<ChannelCache *>::const_iterator i = std::lower_bound(\n\t\t\tm_channels.begin(), m_channels.end(), &tempChan,\n\n\t\tchannelinfo_compare);\n\t\tif ( i != m_channels.end() )\n\t\t{\n\t\t\treturn (*i);\n\t\t} else\n\t\t{\n\t\t\tthrow std::runtime_error(\"Unable to find channel.\");\n\t\t}\n\t\tthrow std::logic_error(\"Reached an unreachable point in code.\");\n\t\treturn NULL; \/\/ Should never happen\n\t}\n\n\tChannelCache *NetworkCacheImpl::channel(\n\t\t\t\t\t\t\t\t\t\tconst std::string &name)\n\t{\n\t\tChannelCache tempChan(name);\n\t\tstd::vector<ChannelCache *>::iterator i = std::lower_bound(\n\t\t\tm_channels.begin(), m_channels.end(), &tempChan,\n\t\t\tchannelinfo_compare);\n\t\tif ( i != m_channels.end() )\n\t\t{\n\t\t\treturn (*i);\n\t\t} else\n\t\t{\n\t\t\tstd::stringstream err;\n\t\t\terr << \"Unable to find channel: \" << name;\n\t\t\tthrow std::runtime_error(err.str());\n\t\t}\n\t\tthrow std::logic_error(\"Reached an unreachable point in code.\");\n\t\treturn NULL; \/\/ Should never happen\n\t}\n\n\tvoid NetworkCacheImpl::getChannelCopy(const std::string &name,\n\t\t\t\t\t\t\t\t\tChannelCache &dest) const\n\t{\n\t\tdest = *this->channel(name);\n\t}\n\n\tUserInfo *NetworkCacheImpl::userByName(const std::string &name) {\n\t\tUserInfo temp(name, \"\", \"\");\n\t\tstd::pair<\n\t\t\tstd::vector<UserInfo *>::iterator,\n\t\t\tstd::vector<UserInfo *>::iterator\n\t\t> res = std::equal_range(m_users.begin(), m_users.end(),\n\t\t\t\t\t\t\t&temp, userinfo_compare);\n\t\tif ( res.first != m_users.end() )\n\t\t{\n\t\t\treturn *res.first;\n\t\t} else\n\t\t{\n\t\t\treturn NULL;\n\t\t}\n\t}\n\t\n\t\/\/ Wrapper functions\n\tNetworkCache::NetworkCache():\n\tm_impl(new NetworkCacheImpl)\n\t{\n\t}\n\n\tNetworkCache::~NetworkCache()\n\t{\n\t\tdelete m_impl;\n\t}\n\t\n\tvoid NetworkCache::getChannel(const std::string &name,\n\t\t\t\t\t\t\t\t\tChannelCache &dest) const\n\t{\n\t\tanp::threading::Lock lock(m_impl->m_mutex);\n\n\t\tm_impl->getChannelCopy(name, dest);\n\t}\n\n\tvoid NetworkCache::addChannel(const std::string &channel)\n\t{\n\t\tanp::threading::Lock lock(m_impl->m_mutex);\n\t\t\n\t\t\/\/ TODO: Cache this channel here, since \"addUserToChannel\" will\n\t\t\/\/ likely be called next, upon some RPL_NAMREPLY\n\t\tChannelCache *temp = new ChannelCache(channel);\n\t\tstd::vector<ChannelCache *> &list = m_impl->m_channels;\n\t\tlist.insert(std::lower_bound(list.begin(),\n\t\t\tlist.end(), temp, channelinfo_compare), temp);\n\t}\n\n    void NetworkCache::removeChannel(const std::string &channel)\n    {\n\t\t{\n            anp::threading::Lock lock(m_impl->m_mutex);\n\n            ChannelCache temp(channel);\n            std::vector<ChannelCache *> &list = m_impl->m_channels;\n            std::vector<ChannelCache *>::iterator i =\n            i = std::lower_bound(list.begin(),\n                list.end(), &temp, channelinfo_compare);\n            if ( i != list.end() )\n            {\n                delete (*i);\n                list.erase(i);\n            }\n        } \/\/ End of lock scope.\n        \/\/ Remove entries in relation table\n        removeAllUsersFromChannel(channel);\n    }\n\n\tvoid NetworkCache::addUserToChannel(const std::string &name,\n\t\t\t\t\t\t\t  const std::string &user,\n\t\t\t\t\t\t\t  const std::string &host,\n\t\t\t\t\t\t\t  const std::string &channelName)\n\t{\n\t\tanp::threading::Lock lock(m_impl->m_mutex);\n\n\t\tChannelCache *channel = m_impl->channel(channelName);\n\t\t\n\t\tChannelUserRelation newRelation(channelName, name, 0);\n\t\tstd::vector<ChannelUserRelation> &table = m_impl->m_cuRelations;\n\n\t\t\/\/ Avoid duplicates (drop duplicates silently without\n\t\t\/\/ exceptions or anything)\n\t\tif ( table.empty() || !std::binary_search(table.begin(), \n\t\t\t\ttable.end(), newRelation,\n\t\t\t\tchanneluserrelation_compareCU) )\n\t\t{\n\t\t\tstd::stringstream ss;\n\t\t\tss << \"(cache) Added '\" << name << \"' to '\"\n\t\t\t\t<< channelName << \"'.\";\n\t\t\tANPLOGD(\"libfirc\", ss.str());\n\t\t\ttable.insert(\n\t\t\t\tstd::lower_bound(\n\t\t\t\t\ttable.begin(),\n\t\t\t\t\ttable.end(),\n\t\t\t\t\tnewRelation,\n\t\t\t\t\tchanneluserrelation_compareCU\n\t\t\t\t),\n\t\t\t\tnewRelation\n\t\t\t);\n\t\t} else\n\t\t{\n\t\t\tstd::stringstream ss;\n\t\t\tss << \"(cache) Didn't add '\" << name << \"' to '\"\n\t\t\t\t<< channelName << \"' because of binary_search. table.size()=\"\n\t\t\t\t<< table.size();\n\t\t\tANPLOGD(\"libfirc\", ss.str());\n\t\t}\n\t}\n\t\n\t\/**\n\t\tRemoves a channel - user relation.\n\n\t\t@param name\n\t\tNickname of the user.\n\n\t\t@param channelName\n\t\tName of the channel.\n\n\t\t@remark\n\t\tAssumes there's no duplicate entries.\n\t*\/\n\tvoid NetworkCache::removeUserFromChannel(const std::string &name,\n                                             const std::string &channelName)\n\t{\n\t\tanp::threading::Lock lock(m_impl->m_mutex);\n\n\t\tChannelUserRelation tempRel(channelName, name, 0);\n\t\tstd::vector<ChannelUserRelation> &table = m_impl->m_cuRelations;\n\t\tstd::pair<\n\t\t\tstd::vector<ChannelUserRelation>::iterator,\n\t\t\tstd::vector<ChannelUserRelation>::iterator\n\t\t> range = std::equal_range(table.begin(), table.end(), tempRel,\n\t\t\t\t\t\t\t\t\tchanneluserrelation_compareC);\n\n\t\tif ( range.first != table.end() ) \/\/ equal_range() succeeded?\n\t\t{\n\t\t\t\/\/ infinite loop while ( range.first != range.second )\n\t\t\tbool erased = false;\n\t\t\twhile ( !erased && range.first != range.second )\n\t\t\t{\n\t\t\t\tif ( (*range.first).m_user == name )\n\t\t\t\t{\n\t\t\t\t\trange.first = table.erase(range.first);\n\t\t\t\t\tstd::stringstream ss;\n\t\t\t\t\tss << \"(cache) Removed '\" << name\n\t\t\t\t\t\t<< \"' from '\" << channelName << \"'.\";\n\t\t\t\t\tANPLOGD(\"libfirc\", ss.str());\n\t\t\t\t\terased = true;\n\t\t\t\t} else\n\t\t\t\t{\n\t\t\t\t\trange.first++;\n\t\t\t\t}\n\t\t\t}\n\t\t} else\n\t\t{\n\t\t\tstd::stringstream ss;\n\t\t\tss << \"Unable to find channel '\" << channelName << \"'.\";\n\t\t\tANPLOGD(\"libfirc\", ss.str());\n\t\t\tthrow std::runtime_error(ss.str());\n\t\t}\n\t}\n\n\tvoid NetworkCache::removeAllUsersFromChannel(\n\t\t\t\t\t\t\t\tconst std::string &channel)\n\t{\n\t\tanp::threading::Lock lock(m_impl->m_mutex);\n\n\t\tChannelUserRelation tempRel(channel, \"\", 0);\n\t\tstd::vector<ChannelUserRelation> &table = m_impl->m_cuRelations;\n\t\tstd::pair<\n\t\t\tstd::vector<ChannelUserRelation>::iterator,\n\t\t\tstd::vector<ChannelUserRelation>::iterator\n\t\t> range = std::equal_range(table.begin(), table.end(), tempRel,\n\t\t\t\t\t\t\t\t\tchanneluserrelation_compareC);\n\t\t\n\t\tstd::stringstream ss;\n\t\tss << \"Erasing all users in \" << channel;\n\t\tANPLOGD(\"libfirc\", ss.str());\n\t\ttable.erase(range.first, range.second);\n\t}\n\n\tvoid NetworkCache::setTopic(const std::string &channelName,\n\t\t\t\t\t\t\t\tconst std::string &topic)\n\t{\n\t\tanp::threading::Lock lock(m_impl->m_mutex);\n\n\t\tChannelCache *channel = m_impl->channel(channelName);\n\t\tchannel->setTopic(topic);\n\t}\n\n\tvoid NetworkCache::setClientNickName(\n\t\t\t\t\t\t\tconst std::string &clientNickName)\n\t{\n\t\tanp::threading::Lock lock(m_impl->m_mutex);\n\n\t\tm_impl->m_clientNickName = clientNickName;\n\t}\n\n\tvoid NetworkCache::getClientNickName(\n\t\t\t\t\t\t\tstd::string &clientNickName) const\n\t{\n\t\tanp::threading::Lock lock(m_impl->m_mutex);\n\n\t\tclientNickName = m_impl->m_clientNickName;\n\t}\n\t\n\tvoid NetworkCache::getUsersInChannel(const std::string &name,\n                        anp::IWritableContainer<std::string> &userList) const\n\t{\n\t\tanp::threading::Lock lock(m_impl->m_mutex);\n\t\t\n\t\tChannelUserRelation tempRel(name, \"\", 0);\n\t\tstd::vector<ChannelUserRelation> &table = m_impl->m_cuRelations;\n\t\tstd::pair<\n\t\t\tstd::vector<ChannelUserRelation>::iterator,\n\t\t\tstd::vector<ChannelUserRelation>::iterator\n\t\t> range = std::equal_range(table.begin(), table.end(), tempRel,\n\t\t\t\t\t\t\t\t\tchanneluserrelation_compareC);\n\/\/ todo: UserList copy constructor\n\t\tif ( range.first != table.end() ) \/\/ equal_range() succeeded?\n\t\t{\n\t\t\twhile ( range.first != range.second )\n\t\t\t{\n\t\t\t\tuserList.pushBack((*range.first).m_user);\n\t\t\t\trange.first++;\n\t\t\t}\n\t\t} else\n\t\t{\n\t\t\tstd::stringstream ss;\n\t\t\tss << \"Unable to find channel '\" << name << \"'.\";\n\t\t\tANPLOGD(\"libfirc\", ss.str());\n\t\t\tthrow std::runtime_error(ss.str());\n\t\t}\n\t}\n\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\/\/ Event subscriber interfaces\n\t\n\tvoid NetworkCache::receiveEvent(anp::irc::events::NumericReply &event)\n\t{\n\t\tconst std::string &command = event.command();\n\n\t\tif ( command == \"332\" ) \/\/ RPL_TOPIC\n\t\t{\n\t\t\tsetTopic(event.param(1), event.param(2));\n\t\t}\n\t}\n\n\tvoid NetworkCache::receiveEvent(anp::irc::events::Join &event)\n\t{\n\t\tconst MsgPrefix &origin = event.origin();\n\t\tstd::string clientNickName;\n\n\t\tgetClientNickName(clientNickName);\n\t\tif ( origin.nick() == clientNickName )\n\t\t{\n\t\t\taddChannel(event.channel());\n\t\t}\n\t\taddUserToChannel(origin.nick(),\n\t\t\t\t\t\t origin.user(),\n\t\t\t\t\t\t origin.host(),\n\t\t\t\t\t\t event.channel());\n\t}\n\n\tvoid NetworkCache::receiveEvent(anp::irc::events::Part &event)\n\t{\n\t\tconst MsgPrefix &origin = event.origin();\n\t\tstd::string clientNickName;\n\n\t\tgetClientNickName(clientNickName);\n\t\tif ( origin.nick() == clientNickName )\n\t\t{\n\t\t\tremoveChannel(event.channel());\n\t\t} else\n\t\t{\n\t\t\tremoveUserFromChannel(origin.nick(), event.channel());\n\t\t}\n\t}\n\tvoid NetworkCache::receiveEvent(anp::irc::events::Topic &event)\n\t{\n\t\tsetTopic(event.channel(), event.topic());\n\t}\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* \n * File:   DebugServer.cpp\n * Author: thomas\n * \n * Created on 10. September 2010, 15:38\n *\/\n\n#include \"DebugServer.h\"\n\nDebugServer::DebugServer()\n: socket(NULL)\n{\n  GError *err = NULL;\n \n  \n  g_message(\"Creating new socket object\");\n\n  socket = g_socket_new(G_SOCKET_FAMILY_IPV4, G_SOCKET_TYPE_STREAM, G_SOCKET_PROTOCOL_TCP, &err);\n  GInetAddress* inetAddress = g_inet_address_new_any(G_SOCKET_FAMILY_IPV4);\n \n  GSocketAddress* socketAddress = g_inet_socket_address_new(inetAddress, 12345);\n\n  g_message(\"Binding socket to port %d\", 12345);\n  g_socket_bind(socket, socketAddress, true, &err);\n  g_assert(err == NULL);\n\n  g_message(\"Listen\");\n  g_socket_listen(socket, &err);\n  g_assert(err == NULL);\n\n  g_message(\"Try to accept\");\n  GSocket* activeConnection = g_socket_accept(socket, NULL, &err);\n  g_assert(err == NULL);\n\n  g_message(\"Hey, someone is connected!\");\n  \n\n}\n\n\nDebugServer::~DebugServer()\n{\n  g_object_unref(socket);\n}\n\n<commit_msg>- send a friendly message<commit_after>\/* \n * File:   DebugServer.cpp\n * Author: thomas\n * \n * Created on 10. September 2010, 15:38\n *\/\n\n#include <string>\n\n#include \"DebugServer.h\"\n\nDebugServer::DebugServer()\n: socket(NULL)\n{\n  GError *err = NULL;\n \n  \n  g_message(\"Creating new socket object\");\n\n  socket = g_socket_new(G_SOCKET_FAMILY_IPV4, G_SOCKET_TYPE_STREAM, G_SOCKET_PROTOCOL_TCP, &err);\n  GInetAddress* inetAddress = g_inet_address_new_any(G_SOCKET_FAMILY_IPV4);\n \n  GSocketAddress* socketAddress = g_inet_socket_address_new(inetAddress, 12345);\n\n  g_message(\"Binding socket to port %d\", 12345);\n  g_socket_bind(socket, socketAddress, true, &err);\n  g_assert(err == NULL);\n\n  g_message(\"Listen\");\n  g_socket_listen(socket, &err);\n  g_assert(err == NULL);\n\n  g_message(\"Try to accept\");\n  GSocket* activeConnection = g_socket_accept(socket, NULL, &err);\n  g_assert(err == NULL);\n\n  g_message(\"Hey, someone is connected!\");\n  std::string msg = \"Good morning, the DebugServer is not openend yet. Please be patient.\\n\";\n  g_socket_send(activeConnection, msg.c_str(), msg.size(), NULL, NULL);\n\n  g_socket_close(activeConnection, NULL);\n\n}\n\n\nDebugServer::~DebugServer()\n{\n  g_object_unref(socket);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <thread>\n\n#include <boost\/asio.hpp>\n\n#include <blackhole\/trace.hpp>\n\n#include \"global.hpp\"\n#include \"mocks\/trace.hpp\"\n\nTEST(Context, Initiating) {\n    auto& distribution = random_t<mock::distribution_t>::instance().distribution();\n    EXPECT_CALL(distribution, next())\n            .Times(1)\n            .WillOnce(Return(42));\n\n    EXPECT_EQ(0, this_thread::current_span().trace);\n    EXPECT_EQ(0, this_thread::current_span().span);\n    EXPECT_EQ(0, this_thread::current_span().parent);\n\n    trace::context_t<random_t<mock::distribution_t>> context;\n    EXPECT_EQ(42, this_thread::current_span().trace);\n    EXPECT_EQ(42, this_thread::current_span().span);\n    EXPECT_EQ(0, this_thread::current_span().parent);\n}\n\nTEST(Context, ResetContextAfterLeavingScope) {\n    auto& distribution = random_t<mock::distribution_t>::instance().distribution();\n    EXPECT_CALL(distribution, next())\n            .Times(1)\n            .WillOnce(Return(42));\n\n    EXPECT_EQ(0, this_thread::current_span().trace);\n    EXPECT_EQ(0, this_thread::current_span().span);\n    EXPECT_EQ(0, this_thread::current_span().parent);\n\n    {\n        trace::context_t<random_t<mock::distribution_t>> context;\n        EXPECT_EQ(42, this_thread::current_span().trace);\n        EXPECT_EQ(42, this_thread::current_span().span);\n        EXPECT_EQ(0, this_thread::current_span().parent);\n    }\n\n    \/\/ Trace context is completery reset.\n    EXPECT_EQ(0, this_thread::current_span().trace);\n    EXPECT_EQ(0, this_thread::current_span().span);\n    EXPECT_EQ(0, this_thread::current_span().parent);\n}\n\nTEST(Context, ExactlyResetNotFallbackContextAfterLeavingScope) {\n    auto& distribution = random_t<mock::distribution_t>::instance().distribution();\n    EXPECT_CALL(distribution, next())\n            .Times(2)\n            .WillOnce(Return(42))\n            .WillOnce(Return(100500));\n\n    EXPECT_EQ(0, this_thread::current_span().trace);\n    EXPECT_EQ(0, this_thread::current_span().span);\n    EXPECT_EQ(0, this_thread::current_span().parent);\n\n    {\n        trace::context_t<random_t<mock::distribution_t>> context;\n        EXPECT_EQ(42, this_thread::current_span().trace);\n        EXPECT_EQ(42, this_thread::current_span().span);\n        EXPECT_EQ(0, this_thread::current_span().parent);\n\n        {\n            trace::context_t<random_t<mock::distribution_t>> nested;\n            EXPECT_EQ(42, this_thread::current_span().trace);\n            EXPECT_EQ(100500, this_thread::current_span().span);\n            EXPECT_EQ(42, this_thread::current_span().parent);\n        }\n\n        \/\/ Trace context is partially reset at this moment.\n        EXPECT_EQ(42, this_thread::current_span().trace);\n        EXPECT_EQ(42, this_thread::current_span().span);\n        EXPECT_EQ(0, this_thread::current_span().parent);\n    }\n\n    \/\/ Trace context is completery reset now.\n    EXPECT_EQ(0, this_thread::current_span().trace);\n    EXPECT_EQ(0, this_thread::current_span().span);\n    EXPECT_EQ(0, this_thread::current_span().parent);\n}\n\nnamespace testing {\n\nnamespace loop_handling {\n\nvoid check(int& counter) {\n    EXPECT_EQ(span_t(43, 43), this_thread::current_span());\n    counter++;\n}\n\n} \/\/ namespace loop_handling\n\n} \/\/ namespace testing\n\nTEST(Context, AsynchronousHandlingViaEventLoop) {\n    boost::asio::io_service loop;\n    int counter = 0;\n\n    auto& distribution = random_t<mock::distribution_t>::instance().distribution();\n    EXPECT_CALL(distribution, next())\n            .Times(1)\n            .WillOnce(Return(43));\n    trace::context_t<random_t<mock::distribution_t>> context;\n\n    loop.post(\n        trace::wrap(\n            std::bind(&loop_handling::check, std::ref(counter))\n        )\n    );\n\n    loop.run();\n    EXPECT_EQ(1, counter);\n}\n\nnamespace testing {\n\nnamespace loop_handling {\n\nnamespace simultaneous {\n\nvoid check_first(int& counter) {\n    EXPECT_EQ(span_t(1, 1), this_thread::current_span());\n    EXPECT_EQ(0, counter);\n    counter++;\n}\n\nvoid check_second(int& counter) {\n    EXPECT_EQ(span_t(2, 2), this_thread::current_span());\n    EXPECT_EQ(1, counter);\n    counter++;\n}\n\nvoid create_first_trace(boost::asio::io_service& loop, int& counter) {\n    trace::context_t<random_t<mock::distribution_t>> context(1);\n    loop.post(trace::wrap(std::bind(&check_first, std::ref(counter))));\n}\n\nvoid create_second_trace(boost::asio::io_service& loop, int& counter) {\n    trace::context_t<random_t<mock::distribution_t>> context(2);\n    loop.post(trace::wrap(std::bind(&check_second, std::ref(counter))));\n}\n\n} \/\/ namespace simultaneous\n\n} \/\/ namespace loop_handling\n\n} \/\/ namespace testing\n\nTEST(Context, SimultaneousSimpleTraceHandlingViaEventLoop) {\n    boost::asio::io_service loop;\n    int counter = 0;\n\n    loop.post(\n        std::bind(\n            &loop_handling::simultaneous::create_first_trace,\n            std::ref(loop),\n            std::ref(counter)\n        )\n    );\n    loop.post(\n        std::bind(\n            &loop_handling::simultaneous::create_second_trace,\n            std::ref(loop),\n            std::ref(counter)\n        )\n    );\n\n    loop.run();\n    EXPECT_EQ(2, counter);\n}\n\nnamespace testing {\n\nnamespace loop_handling {\n\nnamespace random_delay {\n\nvoid check_first(int& counter, const boost::system::error_code&) {\n    EXPECT_EQ(span_t(44, 44, 0), this_thread::current_span());\n    EXPECT_EQ(0, counter);\n    counter++;\n}\n\nvoid check_second(int& counter) {\n    EXPECT_EQ(span_t(45, 45, 0), this_thread::current_span());\n    EXPECT_EQ(1, counter);\n    counter++;\n}\n\n\/\/ Emulate socket accept handler.\nvoid create_first_trace(boost::asio::io_service& loop, int& counter) {\n    trace::context_t<random_t<mock::distribution_t>> context(44);\n    boost::asio::deadline_timer timer(loop);\n    timer.expires_from_now(boost::posix_time::milliseconds(1));\n    timer.async_wait(\n        trace::wrap(\n            std::bind(&check_first, std::ref(counter), std::placeholders::_1)\n        )\n    );\n}\n\nvoid create_second_trace(boost::asio::io_service& loop, int& counter) {\n    trace::context_t<random_t<mock::distribution_t>> context(45);\n    loop.post(\n        trace::wrap(\n            std::bind(&check_second, std::ref(counter))\n        )\n    );\n}\n\n} \/\/ namespace random_delay\n\n} \/\/ namespace loop_handling\n\n} \/\/ namespace testing\n\nTEST(Context, AsynchronousContextWithRandomDelay) {\n    \/\/! Sequence diagram:\n    \/\/! --44----c1\n    \/\/! ----45c2--\n\n    boost::asio::io_service loop;\n    int counter = 0;\n\n    loop.post(\n        std::bind(\n            &loop_handling::random_delay::create_first_trace,\n            std::ref(loop),\n            std::ref(counter)\n        )\n    );\n    loop.post(\n        std::bind(\n            &loop_handling::random_delay::create_second_trace,\n            std::ref(loop),\n            std::ref(counter)\n        )\n    );\n\n    loop.run();\n\n    EXPECT_EQ(span_t::invalid(), this_thread::current_span());\n\n    EXPECT_EQ(2, counter);\n}\n\nnamespace testing {\n\nnamespace thread_handling {\n\nvoid check(std::atomic<int>& counter) {\n    EXPECT_EQ(span_t(46, 46, 0), this_thread::current_span());\n    counter++;\n}\n\n} \/\/ namespace thread_handling\n\n} \/\/ namespace testing\n\nTEST(Context, AsynchronousHandlingViaThreads) {\n    std::atomic<int> counter(0);\n\n    auto& distribution = random_t<mock::distribution_t>::instance().distribution();\n    EXPECT_CALL(distribution, next())\n            .Times(1)\n            .WillOnce(Return(46));\n    trace::context_t<random_t<mock::distribution_t>> context;\n\n    std::thread thread(\n        trace::wrap(std::bind(&thread_handling::check, std::ref(counter)))\n    );\n    thread.join();\n\n    EXPECT_EQ(1, counter);\n}\n<commit_msg>[Unit Testing] Forgotten include added.<commit_after>#include <thread>\n\n#include <boost\/asio.hpp>\n\n#include <blackhole\/trace.hpp>\n#include <blackhole\/utils\/atomic.hpp>\n\n#include \"global.hpp\"\n#include \"mocks\/trace.hpp\"\n\nTEST(Context, Initiating) {\n    auto& distribution = random_t<mock::distribution_t>::instance().distribution();\n    EXPECT_CALL(distribution, next())\n            .Times(1)\n            .WillOnce(Return(42));\n\n    EXPECT_EQ(0, this_thread::current_span().trace);\n    EXPECT_EQ(0, this_thread::current_span().span);\n    EXPECT_EQ(0, this_thread::current_span().parent);\n\n    trace::context_t<random_t<mock::distribution_t>> context;\n    EXPECT_EQ(42, this_thread::current_span().trace);\n    EXPECT_EQ(42, this_thread::current_span().span);\n    EXPECT_EQ(0, this_thread::current_span().parent);\n}\n\nTEST(Context, ResetContextAfterLeavingScope) {\n    auto& distribution = random_t<mock::distribution_t>::instance().distribution();\n    EXPECT_CALL(distribution, next())\n            .Times(1)\n            .WillOnce(Return(42));\n\n    EXPECT_EQ(0, this_thread::current_span().trace);\n    EXPECT_EQ(0, this_thread::current_span().span);\n    EXPECT_EQ(0, this_thread::current_span().parent);\n\n    {\n        trace::context_t<random_t<mock::distribution_t>> context;\n        EXPECT_EQ(42, this_thread::current_span().trace);\n        EXPECT_EQ(42, this_thread::current_span().span);\n        EXPECT_EQ(0, this_thread::current_span().parent);\n    }\n\n    \/\/ Trace context is completery reset.\n    EXPECT_EQ(0, this_thread::current_span().trace);\n    EXPECT_EQ(0, this_thread::current_span().span);\n    EXPECT_EQ(0, this_thread::current_span().parent);\n}\n\nTEST(Context, ExactlyResetNotFallbackContextAfterLeavingScope) {\n    auto& distribution = random_t<mock::distribution_t>::instance().distribution();\n    EXPECT_CALL(distribution, next())\n            .Times(2)\n            .WillOnce(Return(42))\n            .WillOnce(Return(100500));\n\n    EXPECT_EQ(0, this_thread::current_span().trace);\n    EXPECT_EQ(0, this_thread::current_span().span);\n    EXPECT_EQ(0, this_thread::current_span().parent);\n\n    {\n        trace::context_t<random_t<mock::distribution_t>> context;\n        EXPECT_EQ(42, this_thread::current_span().trace);\n        EXPECT_EQ(42, this_thread::current_span().span);\n        EXPECT_EQ(0, this_thread::current_span().parent);\n\n        {\n            trace::context_t<random_t<mock::distribution_t>> nested;\n            EXPECT_EQ(42, this_thread::current_span().trace);\n            EXPECT_EQ(100500, this_thread::current_span().span);\n            EXPECT_EQ(42, this_thread::current_span().parent);\n        }\n\n        \/\/ Trace context is partially reset at this moment.\n        EXPECT_EQ(42, this_thread::current_span().trace);\n        EXPECT_EQ(42, this_thread::current_span().span);\n        EXPECT_EQ(0, this_thread::current_span().parent);\n    }\n\n    \/\/ Trace context is completery reset now.\n    EXPECT_EQ(0, this_thread::current_span().trace);\n    EXPECT_EQ(0, this_thread::current_span().span);\n    EXPECT_EQ(0, this_thread::current_span().parent);\n}\n\nnamespace testing {\n\nnamespace loop_handling {\n\nvoid check(int& counter) {\n    EXPECT_EQ(span_t(43, 43), this_thread::current_span());\n    counter++;\n}\n\n} \/\/ namespace loop_handling\n\n} \/\/ namespace testing\n\nTEST(Context, AsynchronousHandlingViaEventLoop) {\n    boost::asio::io_service loop;\n    int counter = 0;\n\n    auto& distribution = random_t<mock::distribution_t>::instance().distribution();\n    EXPECT_CALL(distribution, next())\n            .Times(1)\n            .WillOnce(Return(43));\n    trace::context_t<random_t<mock::distribution_t>> context;\n\n    loop.post(\n        trace::wrap(\n            std::bind(&loop_handling::check, std::ref(counter))\n        )\n    );\n\n    loop.run();\n    EXPECT_EQ(1, counter);\n}\n\nnamespace testing {\n\nnamespace loop_handling {\n\nnamespace simultaneous {\n\nvoid check_first(int& counter) {\n    EXPECT_EQ(span_t(1, 1), this_thread::current_span());\n    EXPECT_EQ(0, counter);\n    counter++;\n}\n\nvoid check_second(int& counter) {\n    EXPECT_EQ(span_t(2, 2), this_thread::current_span());\n    EXPECT_EQ(1, counter);\n    counter++;\n}\n\nvoid create_first_trace(boost::asio::io_service& loop, int& counter) {\n    trace::context_t<random_t<mock::distribution_t>> context(1);\n    loop.post(trace::wrap(std::bind(&check_first, std::ref(counter))));\n}\n\nvoid create_second_trace(boost::asio::io_service& loop, int& counter) {\n    trace::context_t<random_t<mock::distribution_t>> context(2);\n    loop.post(trace::wrap(std::bind(&check_second, std::ref(counter))));\n}\n\n} \/\/ namespace simultaneous\n\n} \/\/ namespace loop_handling\n\n} \/\/ namespace testing\n\nTEST(Context, SimultaneousSimpleTraceHandlingViaEventLoop) {\n    boost::asio::io_service loop;\n    int counter = 0;\n\n    loop.post(\n        std::bind(\n            &loop_handling::simultaneous::create_first_trace,\n            std::ref(loop),\n            std::ref(counter)\n        )\n    );\n    loop.post(\n        std::bind(\n            &loop_handling::simultaneous::create_second_trace,\n            std::ref(loop),\n            std::ref(counter)\n        )\n    );\n\n    loop.run();\n    EXPECT_EQ(2, counter);\n}\n\nnamespace testing {\n\nnamespace loop_handling {\n\nnamespace random_delay {\n\nvoid check_first(int& counter, const boost::system::error_code&) {\n    EXPECT_EQ(span_t(44, 44, 0), this_thread::current_span());\n    EXPECT_EQ(0, counter);\n    counter++;\n}\n\nvoid check_second(int& counter) {\n    EXPECT_EQ(span_t(45, 45, 0), this_thread::current_span());\n    EXPECT_EQ(1, counter);\n    counter++;\n}\n\n\/\/ Emulate socket accept handler.\nvoid create_first_trace(boost::asio::io_service& loop, int& counter) {\n    trace::context_t<random_t<mock::distribution_t>> context(44);\n    boost::asio::deadline_timer timer(loop);\n    timer.expires_from_now(boost::posix_time::milliseconds(1));\n    timer.async_wait(\n        trace::wrap(\n            std::bind(&check_first, std::ref(counter), std::placeholders::_1)\n        )\n    );\n}\n\nvoid create_second_trace(boost::asio::io_service& loop, int& counter) {\n    trace::context_t<random_t<mock::distribution_t>> context(45);\n    loop.post(\n        trace::wrap(\n            std::bind(&check_second, std::ref(counter))\n        )\n    );\n}\n\n} \/\/ namespace random_delay\n\n} \/\/ namespace loop_handling\n\n} \/\/ namespace testing\n\nTEST(Context, AsynchronousContextWithRandomDelay) {\n    \/\/! Sequence diagram:\n    \/\/! --44----c1\n    \/\/! ----45c2--\n\n    boost::asio::io_service loop;\n    int counter = 0;\n\n    loop.post(\n        std::bind(\n            &loop_handling::random_delay::create_first_trace,\n            std::ref(loop),\n            std::ref(counter)\n        )\n    );\n    loop.post(\n        std::bind(\n            &loop_handling::random_delay::create_second_trace,\n            std::ref(loop),\n            std::ref(counter)\n        )\n    );\n\n    loop.run();\n\n    EXPECT_EQ(span_t::invalid(), this_thread::current_span());\n\n    EXPECT_EQ(2, counter);\n}\n\nnamespace testing {\n\nnamespace thread_handling {\n\nvoid check(std::atomic<int>& counter) {\n    EXPECT_EQ(span_t(46, 46, 0), this_thread::current_span());\n    counter++;\n}\n\n} \/\/ namespace thread_handling\n\n} \/\/ namespace testing\n\nTEST(Context, AsynchronousHandlingViaThreads) {\n    std::atomic<int> counter(0);\n\n    auto& distribution = random_t<mock::distribution_t>::instance().distribution();\n    EXPECT_CALL(distribution, next())\n            .Times(1)\n            .WillOnce(Return(46));\n    trace::context_t<random_t<mock::distribution_t>> context;\n\n    std::thread thread(\n        trace::wrap(std::bind(&thread_handling::check, std::ref(counter)))\n    );\n    thread.join();\n\n    EXPECT_EQ(1, counter);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *  Copyright 2019-2020 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#pragma once\n\n\/\/\/ \\file\n\/\/\/ Implementation of Diligent::QueryBase template class\n\n#include \"Query.h\"\n#include \"DeviceObjectBase.hpp\"\n#include \"GraphicsTypes.h\"\n#include \"RefCntAutoPtr.hpp\"\n\nnamespace Diligent\n{\n\n\/\/\/ Template class implementing base functionality for a Query object\n\n\/\/\/ \\tparam BaseInterface - base interface that this class will inheret\n\/\/\/                         (Diligent::IQueryD3D11, Diligent::IQueryD3D12,\n\/\/\/                          Diligent::IQueryGL or Diligent::IQueryVk).\n\/\/\/ \\tparam RenderDeviceImplType - type of the render device implementation\ntemplate <class BaseInterface, class RenderDeviceImplType>\nclass QueryBase : public DeviceObjectBase<BaseInterface, RenderDeviceImplType, QueryDesc>\n{\npublic:\n    enum class QueryState\n    {\n        Inactive,\n        Querying,\n        Complete\n    };\n\n    using TDeviceObjectBase = DeviceObjectBase<BaseInterface, RenderDeviceImplType, QueryDesc>;\n\n    \/\/\/ \\param pRefCounters      - reference counters object that controls the lifetime of this command list.\n    \/\/\/ \\param pDevice           - pointer to the device.\n    \/\/\/ \\param Desc              - Query description\n    \/\/\/ \\param bIsDeviceInternal - flag indicating if the Query is an internal device object and\n    \/\/\/\t\t\t\t\t\t\t   must not keep a strong reference to the device.\n    QueryBase(IReferenceCounters*   pRefCounters,\n              RenderDeviceImplType* pDevice,\n              const QueryDesc&      Desc,\n              bool                  bIsDeviceInternal = false) :\n        TDeviceObjectBase{pRefCounters, pDevice, Desc, bIsDeviceInternal}\n    {\n        const auto& deviceFeatures = pDevice->GetDeviceCaps().Features;\n        static_assert(QUERY_TYPE_NUM_TYPES == 6, \"Not all QUERY_TYPE enum values are handled below\");\n        switch (Desc.Type)\n        {\n            case QUERY_TYPE_OCCLUSION:\n                if (!deviceFeatures.OcclusionQueries)\n                    LOG_ERROR_AND_THROW(\"Occlusion queries are not supported by this device\");\n                break;\n\n            case QUERY_TYPE_BINARY_OCCLUSION:\n                if (!deviceFeatures.BinaryOcclusionQueries)\n                    LOG_ERROR_AND_THROW(\"Binary occlusion queries are not supported by this device\");\n                break;\n\n            case QUERY_TYPE_TIMESTAMP:\n                if (!deviceFeatures.TimestampQueries)\n                    LOG_ERROR_AND_THROW(\"Timestamp queries are not supported by this device\");\n                break;\n\n            case QUERY_TYPE_PIPELINE_STATISTICS:\n                if (!deviceFeatures.PipelineStatisticsQueries)\n                    LOG_ERROR_AND_THROW(\"Pipeline statistics queries are not supported by this device\");\n                break;\n\n            case QUERY_TYPE_DURATION:\n                if (!deviceFeatures.DurationQueries)\n                    LOG_ERROR_AND_THROW(\"Duration queries are not supported by this device\");\n                break;\n\n            default:\n                UNEXPECTED(\"Unexpected device type\");\n        }\n    }\n\n    ~QueryBase()\n    {\n        if (m_State == QueryState::Querying)\n        {\n            LOG_ERROR_MESSAGE(\"Destroying query '\", this->m_Desc.Name,\n                              \"' that is in querying state. End the query before releasing it.\");\n        }\n    }\n\n    IMPLEMENT_QUERY_INTERFACE_IN_PLACE(IID_Query, TDeviceObjectBase)\n\n    virtual void DILIGENT_CALL_TYPE Invalidate() override\n    {\n        m_State = QueryState::Inactive;\n    }\n\n    bool OnBeginQuery(struct IDeviceContext* pContext)\n    {\n        if (this->m_Desc.Type == QUERY_TYPE_TIMESTAMP)\n        {\n            LOG_ERROR_MESSAGE(\"BeginQuery cannot be called on timestamp query '\", this->m_Desc.Name,\n                              \"'. Call EndQuery to set the timestamp.\");\n            return false;\n        }\n\n        if (m_State == QueryState::Querying)\n        {\n            LOG_ERROR_MESSAGE(\"Attempting to begin query '\", this->m_Desc.Name,\n                              \"' twice. A query must be ended before it can be begun again.\");\n            return false;\n        }\n\n        m_pContext = pContext;\n        m_State    = QueryState::Querying;\n        return true;\n    }\n\n    bool OnEndQuery(IDeviceContext* pContext)\n    {\n        if (this->m_Desc.Type != QUERY_TYPE_TIMESTAMP)\n        {\n            if (m_State != QueryState::Querying)\n            {\n                LOG_ERROR_MESSAGE(\"Attempting to end query '\", this->m_Desc.Name, \"' that has not been begun\");\n                return false;\n            }\n        }\n\n        if (m_pContext == nullptr)\n        {\n            if (this->m_Desc.Type != QUERY_TYPE_TIMESTAMP)\n            {\n                LOG_ERROR_MESSAGE(\"Ending query '\", this->m_Desc.Name, \"' that has not been begun\");\n                return false;\n            }\n\n            m_pContext = pContext;\n        }\n        else if (m_pContext != pContext)\n        {\n            LOG_ERROR_MESSAGE(\"Query '\", this->m_Desc.Name, \"' has been begun by another context\");\n            return false;\n        }\n\n        m_State = QueryState::Complete;\n        return true;\n    }\n\n    QueryState GetState() const\n    {\n        return m_State;\n    }\n\n    bool CheckQueryDataPtr(void* pData, Uint32 DataSize)\n    {\n        if (m_State != QueryState::Complete)\n        {\n            LOG_ERROR_MESSAGE(\"Attempting to get data of query '\", this->m_Desc.Name, \"' that has not been ended\");\n            return false;\n        }\n\n        if (pData != nullptr)\n        {\n            if (*reinterpret_cast<QUERY_TYPE*>(pData) != this->m_Desc.Type)\n            {\n                LOG_ERROR_MESSAGE(\"Incorrect query data structure type.\");\n                return false;\n            }\n\n            static_assert(QUERY_TYPE_NUM_TYPES == 6, \"Not all QUERY_TYPE enum values are handled below\");\n            switch (this->m_Desc.Type)\n            {\n                case QUERY_TYPE_UNDEFINED:\n                    UNEXPECTED(\"Undefined query type is unexpected\");\n                    return false;\n\n                case QUERY_TYPE_OCCLUSION:\n                    if (DataSize != sizeof(QueryDataOcclusion))\n                    {\n                        LOG_ERROR_MESSAGE(\"The size of query data (\", DataSize, \") is incorrect: \", sizeof(QueryDataOcclusion), \" (aka sizeof(QueryDataOcclusion)) is expected\");\n                        return false;\n                    }\n                    break;\n\n                case QUERY_TYPE_BINARY_OCCLUSION:\n                    if (DataSize != sizeof(QueryDataBinaryOcclusion))\n                    {\n                        LOG_ERROR_MESSAGE(\"The size of query data (\", DataSize, \") is incorrect: \", sizeof(QueryDataBinaryOcclusion), \" (aka sizeof(QueryDataBinaryOcclusion)) is expected\");\n                        return false;\n                    }\n                    break;\n\n                case QUERY_TYPE_TIMESTAMP:\n                    if (DataSize != sizeof(QueryDataTimestamp))\n                    {\n                        LOG_ERROR_MESSAGE(\"The size of query data (\", DataSize, \") is incorrect: \", sizeof(QueryDataTimestamp), \" (aka sizeof(QueryDataTimestamp)) is expected\");\n                        return false;\n                    }\n                    break;\n\n                case QUERY_TYPE_PIPELINE_STATISTICS:\n                    if (DataSize != sizeof(QueryDataPipelineStatistics))\n                    {\n                        LOG_ERROR_MESSAGE(\"The size of query data (\", DataSize, \") is incorrect: \", sizeof(QueryDataPipelineStatistics), \" (aka sizeof(QueryDataPipelineStatistics)) is expected\");\n                        return false;\n                    }\n                    break;\n\n                case QUERY_TYPE_DURATION:\n                    if (DataSize != sizeof(QueryDataDuration))\n                    {\n                        LOG_ERROR_MESSAGE(\"The size of query data (\", DataSize, \") is incorrect: \", sizeof(QueryDataDuration), \" (aka sizeof(QueryDataDuration)) is expected\");\n                        return false;\n                    }\n                    break;\n\n                default:\n                    UNEXPECTED(\"Unexpected query type\");\n                    return false;\n            }\n        }\n\n        return true;\n    }\n\nprotected:\n    RefCntAutoPtr<IDeviceContext> m_pContext;\n\n    QueryState m_State = QueryState::Inactive;\n};\n\n} \/\/ namespace Diligent\n<commit_msg>Renamed QueryState::Complete to QueryState::Ended<commit_after>\/*\n *  Copyright 2019-2020 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#pragma once\n\n\/\/\/ \\file\n\/\/\/ Implementation of Diligent::QueryBase template class\n\n#include \"Query.h\"\n#include \"DeviceObjectBase.hpp\"\n#include \"GraphicsTypes.h\"\n#include \"RefCntAutoPtr.hpp\"\n\nnamespace Diligent\n{\n\n\/\/\/ Template class implementing base functionality for a Query object\n\n\/\/\/ \\tparam BaseInterface - base interface that this class will inheret\n\/\/\/                         (Diligent::IQueryD3D11, Diligent::IQueryD3D12,\n\/\/\/                          Diligent::IQueryGL or Diligent::IQueryVk).\n\/\/\/ \\tparam RenderDeviceImplType - type of the render device implementation\ntemplate <class BaseInterface, class RenderDeviceImplType>\nclass QueryBase : public DeviceObjectBase<BaseInterface, RenderDeviceImplType, QueryDesc>\n{\npublic:\n    enum class QueryState\n    {\n        Inactive,\n        Querying,\n        Ended\n    };\n\n    using TDeviceObjectBase = DeviceObjectBase<BaseInterface, RenderDeviceImplType, QueryDesc>;\n\n    \/\/\/ \\param pRefCounters      - reference counters object that controls the lifetime of this command list.\n    \/\/\/ \\param pDevice           - pointer to the device.\n    \/\/\/ \\param Desc              - Query description\n    \/\/\/ \\param bIsDeviceInternal - flag indicating if the Query is an internal device object and\n    \/\/\/\t\t\t\t\t\t\t   must not keep a strong reference to the device.\n    QueryBase(IReferenceCounters*   pRefCounters,\n              RenderDeviceImplType* pDevice,\n              const QueryDesc&      Desc,\n              bool                  bIsDeviceInternal = false) :\n        TDeviceObjectBase{pRefCounters, pDevice, Desc, bIsDeviceInternal}\n    {\n        const auto& deviceFeatures = pDevice->GetDeviceCaps().Features;\n        static_assert(QUERY_TYPE_NUM_TYPES == 6, \"Not all QUERY_TYPE enum values are handled below\");\n        switch (Desc.Type)\n        {\n            case QUERY_TYPE_OCCLUSION:\n                if (!deviceFeatures.OcclusionQueries)\n                    LOG_ERROR_AND_THROW(\"Occlusion queries are not supported by this device\");\n                break;\n\n            case QUERY_TYPE_BINARY_OCCLUSION:\n                if (!deviceFeatures.BinaryOcclusionQueries)\n                    LOG_ERROR_AND_THROW(\"Binary occlusion queries are not supported by this device\");\n                break;\n\n            case QUERY_TYPE_TIMESTAMP:\n                if (!deviceFeatures.TimestampQueries)\n                    LOG_ERROR_AND_THROW(\"Timestamp queries are not supported by this device\");\n                break;\n\n            case QUERY_TYPE_PIPELINE_STATISTICS:\n                if (!deviceFeatures.PipelineStatisticsQueries)\n                    LOG_ERROR_AND_THROW(\"Pipeline statistics queries are not supported by this device\");\n                break;\n\n            case QUERY_TYPE_DURATION:\n                if (!deviceFeatures.DurationQueries)\n                    LOG_ERROR_AND_THROW(\"Duration queries are not supported by this device\");\n                break;\n\n            default:\n                UNEXPECTED(\"Unexpected device type\");\n        }\n    }\n\n    ~QueryBase()\n    {\n        if (m_State == QueryState::Querying)\n        {\n            LOG_ERROR_MESSAGE(\"Destroying query '\", this->m_Desc.Name,\n                              \"' that is in querying state. End the query before releasing it.\");\n        }\n    }\n\n    IMPLEMENT_QUERY_INTERFACE_IN_PLACE(IID_Query, TDeviceObjectBase)\n\n    virtual void DILIGENT_CALL_TYPE Invalidate() override\n    {\n        m_State = QueryState::Inactive;\n    }\n\n    bool OnBeginQuery(struct IDeviceContext* pContext)\n    {\n        if (this->m_Desc.Type == QUERY_TYPE_TIMESTAMP)\n        {\n            LOG_ERROR_MESSAGE(\"BeginQuery cannot be called on timestamp query '\", this->m_Desc.Name,\n                              \"'. Call EndQuery to set the timestamp.\");\n            return false;\n        }\n\n        if (m_State == QueryState::Querying)\n        {\n            LOG_ERROR_MESSAGE(\"Attempting to begin query '\", this->m_Desc.Name,\n                              \"' twice. A query must be ended before it can be begun again.\");\n            return false;\n        }\n\n        m_pContext = pContext;\n        m_State    = QueryState::Querying;\n        return true;\n    }\n\n    bool OnEndQuery(IDeviceContext* pContext)\n    {\n        if (this->m_Desc.Type != QUERY_TYPE_TIMESTAMP)\n        {\n            if (m_State != QueryState::Querying)\n            {\n                LOG_ERROR_MESSAGE(\"Attempting to end query '\", this->m_Desc.Name, \"' that has not been begun\");\n                return false;\n            }\n        }\n\n        if (m_pContext == nullptr)\n        {\n            if (this->m_Desc.Type != QUERY_TYPE_TIMESTAMP)\n            {\n                LOG_ERROR_MESSAGE(\"Ending query '\", this->m_Desc.Name, \"' that has not been begun\");\n                return false;\n            }\n\n            m_pContext = pContext;\n        }\n        else if (m_pContext != pContext)\n        {\n            LOG_ERROR_MESSAGE(\"Query '\", this->m_Desc.Name, \"' has been begun by another context\");\n            return false;\n        }\n\n        m_State = QueryState::Ended;\n        return true;\n    }\n\n    QueryState GetState() const\n    {\n        return m_State;\n    }\n\n    bool CheckQueryDataPtr(void* pData, Uint32 DataSize)\n    {\n        if (m_State != QueryState::Ended)\n        {\n            LOG_ERROR_MESSAGE(\"Attempting to get data of query '\", this->m_Desc.Name, \"' that has not been ended\");\n            return false;\n        }\n\n        if (pData != nullptr)\n        {\n            if (*reinterpret_cast<QUERY_TYPE*>(pData) != this->m_Desc.Type)\n            {\n                LOG_ERROR_MESSAGE(\"Incorrect query data structure type.\");\n                return false;\n            }\n\n            static_assert(QUERY_TYPE_NUM_TYPES == 6, \"Not all QUERY_TYPE enum values are handled below\");\n            switch (this->m_Desc.Type)\n            {\n                case QUERY_TYPE_UNDEFINED:\n                    UNEXPECTED(\"Undefined query type is unexpected\");\n                    return false;\n\n                case QUERY_TYPE_OCCLUSION:\n                    if (DataSize != sizeof(QueryDataOcclusion))\n                    {\n                        LOG_ERROR_MESSAGE(\"The size of query data (\", DataSize, \") is incorrect: \", sizeof(QueryDataOcclusion), \" (aka sizeof(QueryDataOcclusion)) is expected\");\n                        return false;\n                    }\n                    break;\n\n                case QUERY_TYPE_BINARY_OCCLUSION:\n                    if (DataSize != sizeof(QueryDataBinaryOcclusion))\n                    {\n                        LOG_ERROR_MESSAGE(\"The size of query data (\", DataSize, \") is incorrect: \", sizeof(QueryDataBinaryOcclusion), \" (aka sizeof(QueryDataBinaryOcclusion)) is expected\");\n                        return false;\n                    }\n                    break;\n\n                case QUERY_TYPE_TIMESTAMP:\n                    if (DataSize != sizeof(QueryDataTimestamp))\n                    {\n                        LOG_ERROR_MESSAGE(\"The size of query data (\", DataSize, \") is incorrect: \", sizeof(QueryDataTimestamp), \" (aka sizeof(QueryDataTimestamp)) is expected\");\n                        return false;\n                    }\n                    break;\n\n                case QUERY_TYPE_PIPELINE_STATISTICS:\n                    if (DataSize != sizeof(QueryDataPipelineStatistics))\n                    {\n                        LOG_ERROR_MESSAGE(\"The size of query data (\", DataSize, \") is incorrect: \", sizeof(QueryDataPipelineStatistics), \" (aka sizeof(QueryDataPipelineStatistics)) is expected\");\n                        return false;\n                    }\n                    break;\n\n                case QUERY_TYPE_DURATION:\n                    if (DataSize != sizeof(QueryDataDuration))\n                    {\n                        LOG_ERROR_MESSAGE(\"The size of query data (\", DataSize, \") is incorrect: \", sizeof(QueryDataDuration), \" (aka sizeof(QueryDataDuration)) is expected\");\n                        return false;\n                    }\n                    break;\n\n                default:\n                    UNEXPECTED(\"Unexpected query type\");\n                    return false;\n            }\n        }\n\n        return true;\n    }\n\nprotected:\n    RefCntAutoPtr<IDeviceContext> m_pContext;\n\n    QueryState m_State = QueryState::Inactive;\n};\n\n} \/\/ namespace Diligent\n<|endoftext|>"}
{"text":"<commit_before>\n\/\/ =================================================================================================\n\/\/ This file is part of the CLBlast project. The project is licensed under Apache Version 2.0. This\n\/\/ project loosely follows the Google C++ styleguide and uses a tab-size of two spaces and a max-\n\/\/ width of 100 characters per line.\n\/\/\n\/\/ Author(s):\n\/\/   Cedric Nugteren <www.cedricnugteren.nl>\n\/\/\n\/\/ This file uses the CLTune auto-tuner to tune the xgemv OpenCL kernels. Three variants are tuned:\n\/\/ 1: The full version of the kernel\n\/\/ 2: The fast version for non-transposed matrices\n\/\/ 3: The fast version for transposed matrices\n\/\/\n\/\/ =================================================================================================\n\n#include <string>\n#include <vector>\n\n#include \"internal\/utilities.h\"\n#include \"internal\/tuning.h\"\n\nnamespace clblast {\n\/\/ =================================================================================================\n\n\/\/ See comment at top of file for a description of the class\ntemplate <typename T, int V>\nclass TuneXgemv {\n public:\n\n  \/\/ The representative kernel and the source code\n  static std::string KernelFamily() { return \"xgemv_\"+std::to_string(V); }\n  static std::string KernelName() { return (V==1) ? \"Xgemv\" : ((V==2) ? \"XgemvFast\" : \"XgemvFastRot\"); }\n  static std::string GetSources() {\n    return\n      #include \"..\/src\/kernels\/common.opencl\"\n      #include \"..\/src\/kernels\/level2\/xgemv.opencl\"\n    ;\n  }\n\n  \/\/ The list of arguments relevant for this routine\n  static std::vector<std::string> GetOptions() { return {kArgM, kArgN, kArgAlpha, kArgBeta}; }\n\n  \/\/ Tests for valid arguments\n  static void TestValidArguments(const Arguments<T> &) { }\n\n  \/\/ Sets the default values for the arguments\n  static size_t DefaultM() { return 2048; }\n  static size_t DefaultN() { return 2048; }\n  static size_t DefaultK() { return 1; } \/\/ N\/A for this kernel\n  static double DefaultFraction() { return 1.0; } \/\/ N\/A for this kernel\n\n  \/\/ Describes how to obtain the sizes of the buffers\n  static size_t GetSizeX(const Arguments<T> &args) { return args.n; }\n  static size_t GetSizeY(const Arguments<T> &args) { return args.m; }\n  static size_t GetSizeA(const Arguments<T> &args) { return args.m * args.n; }\n  static size_t GetSizeB(const Arguments<T> &) { return 1; } \/\/ N\/A for this kernel\n  static size_t GetSizeC(const Arguments<T> &) { return 1; } \/\/ N\/A for this kernel\n  static size_t GetSizeTemp(const Arguments<T> &) { return 1; } \/\/ N\/A for this kernel\n\n  \/\/ Sets the tuning parameters and their possible values\n  static void SetParameters(cltune::Tuner &tuner, const size_t id) {\n    tuner.AddParameter(id, \"WGS\"+std::to_string(V), {64, 128, 256, 512});\n    tuner.AddParameter(id, \"WPT\"+std::to_string(V), {1, 2, 4});\n    if (V==2 || V==3) { tuner.AddParameter(id, \"VW\"+std::to_string(V), {1, 2, 4, 8}); }\n  }\n\n  \/\/ Sets the constraints and local memory size\n  static void SetConstraints(cltune::Tuner &tuner, const size_t id) {\n    auto MultipleOfX = [] (std::vector<size_t> v) { return IsMultiple(v[0], v[1]); };\n    if (V==2 || V==3) {\n      tuner.AddConstraint(id, MultipleOfX, {\"WPT\"+std::to_string(V), \"VW\"+std::to_string(V)});\n    }\n  }\n  static void SetLocalMemorySize(cltune::Tuner &tuner, const size_t id, const Arguments<T> &args) {\n    auto LocalMemorySize = [args] (std::vector<size_t> v) { return v[0]*GetBytes(args.precision); };\n    tuner.SetLocalMemoryUsage(id, LocalMemorySize, {\"WGS\"+std::to_string(V)});\n  }\n\n  \/\/ Sets the base thread configuration\n  static std::vector<size_t> GlobalSize(const Arguments<T> &args) { return {args.m}; }\n  static std::vector<size_t> GlobalSizeRef(const Arguments<T> &args) { return GlobalSize(args); }\n  static std::vector<size_t> LocalSize() { return {1}; }\n  static std::vector<size_t> LocalSizeRef() { return {64}; }\n\n  \/\/ Transforms the thread configuration based on the parameters\n  using TransformVector = std::vector<std::vector<std::string>>;\n  static TransformVector MulLocal() { return {{\"WGS\"+std::to_string(V)}}; }\n  static TransformVector DivLocal() { return {}; }\n  static TransformVector MulGlobal() { return {}; }\n  static TransformVector DivGlobal() { return {{\"WPT\"+std::to_string(V)}}; }\n\n  \/\/ Sets the kernel's arguments\n  static void SetArguments(cltune::Tuner &tuner, const Arguments<T> &args,\n                           std::vector<T> &x_vec, std::vector<T> &y_vec,\n                           std::vector<T> &a_mat, std::vector<T> &, std::vector<T> &,\n                           std::vector<T> &) {\n    auto a_rotated = (V==3) ? 1 : 0;\n    tuner.AddArgumentScalar(static_cast<int>(args.m));\n    tuner.AddArgumentScalar(static_cast<int>(args.n));\n    tuner.AddArgumentScalar(args.alpha);\n    tuner.AddArgumentScalar(args.beta);\n    tuner.AddArgumentScalar(static_cast<int>(a_rotated));\n    tuner.AddArgumentInput(a_mat);\n    tuner.AddArgumentScalar(0);\n    tuner.AddArgumentScalar(static_cast<int>(args.m));\n    tuner.AddArgumentInput(x_vec);\n    tuner.AddArgumentScalar(0);\n    tuner.AddArgumentScalar(1);\n    tuner.AddArgumentOutput(y_vec);\n    tuner.AddArgumentScalar(0);\n    tuner.AddArgumentScalar(1);\n    tuner.AddArgumentScalar(0); \/\/ Conjugate transpose\n    tuner.AddArgumentScalar(0); \/\/ Additional parameter\n    tuner.AddArgumentScalar(0); \/\/ Banded 'kl'\n    tuner.AddArgumentScalar(0); \/\/ Banded 'ku'\n  }\n\n  \/\/ Describes how to compute the performance metrics\n  static size_t GetMetric(const Arguments<T> &args) {\n    return (args.m*args.n + 2*args.m + args.n) * GetBytes(args.precision);\n  }\n  static std::string PerformanceUnit() { return \"GB\/s\"; }\n};\n\n\/\/ =================================================================================================\n} \/\/ namespace clblast\n\n\/\/ Shortcuts to the clblast namespace\nusing float2 = clblast::float2;\nusing double2 = clblast::double2;\n\n\/\/ Function to tune a specific variation V (not within the clblast namespace)\ntemplate <int V>\nvoid StartVariation(int argc, char *argv[]) {\n  switch(clblast::GetPrecision(argc, argv)) {\n    case clblast::Precision::kHalf: throw std::runtime_error(\"Unsupported precision mode\");\n    case clblast::Precision::kSingle: clblast::Tuner<clblast::TuneXgemv<float,V>, float>(argc, argv); break;\n    case clblast::Precision::kDouble: clblast::Tuner<clblast::TuneXgemv<double,V>, double>(argc, argv); break;\n    case clblast::Precision::kComplexSingle: clblast::Tuner<clblast::TuneXgemv<float2,V>, float2>(argc, argv); break;\n    case clblast::Precision::kComplexDouble: clblast::Tuner<clblast::TuneXgemv<double2,V>, double2>(argc, argv); break;\n  }\n}\n\n\/\/ Main function (not within the clblast namespace)\nint main(int argc, char *argv[]) {\n  StartVariation<1>(argc, argv);\n  StartVariation<2>(argc, argv);\n  StartVariation<3>(argc, argv);\n  return 0;\n}\n\n\/\/ =================================================================================================\n<commit_msg>Reduced the maximum workgroup-size for GEMV kernels further<commit_after>\n\/\/ =================================================================================================\n\/\/ This file is part of the CLBlast project. The project is licensed under Apache Version 2.0. This\n\/\/ project loosely follows the Google C++ styleguide and uses a tab-size of two spaces and a max-\n\/\/ width of 100 characters per line.\n\/\/\n\/\/ Author(s):\n\/\/   Cedric Nugteren <www.cedricnugteren.nl>\n\/\/\n\/\/ This file uses the CLTune auto-tuner to tune the xgemv OpenCL kernels. Three variants are tuned:\n\/\/ 1: The full version of the kernel\n\/\/ 2: The fast version for non-transposed matrices\n\/\/ 3: The fast version for transposed matrices\n\/\/\n\/\/ =================================================================================================\n\n#include <string>\n#include <vector>\n\n#include \"internal\/utilities.h\"\n#include \"internal\/tuning.h\"\n\nnamespace clblast {\n\/\/ =================================================================================================\n\n\/\/ See comment at top of file for a description of the class\ntemplate <typename T, int V>\nclass TuneXgemv {\n public:\n\n  \/\/ The representative kernel and the source code\n  static std::string KernelFamily() { return \"xgemv_\"+std::to_string(V); }\n  static std::string KernelName() { return (V==1) ? \"Xgemv\" : ((V==2) ? \"XgemvFast\" : \"XgemvFastRot\"); }\n  static std::string GetSources() {\n    return\n      #include \"..\/src\/kernels\/common.opencl\"\n      #include \"..\/src\/kernels\/level2\/xgemv.opencl\"\n    ;\n  }\n\n  \/\/ The list of arguments relevant for this routine\n  static std::vector<std::string> GetOptions() { return {kArgM, kArgN, kArgAlpha, kArgBeta}; }\n\n  \/\/ Tests for valid arguments\n  static void TestValidArguments(const Arguments<T> &) { }\n\n  \/\/ Sets the default values for the arguments\n  static size_t DefaultM() { return 2048; }\n  static size_t DefaultN() { return 2048; }\n  static size_t DefaultK() { return 1; } \/\/ N\/A for this kernel\n  static double DefaultFraction() { return 1.0; } \/\/ N\/A for this kernel\n\n  \/\/ Describes how to obtain the sizes of the buffers\n  static size_t GetSizeX(const Arguments<T> &args) { return args.n; }\n  static size_t GetSizeY(const Arguments<T> &args) { return args.m; }\n  static size_t GetSizeA(const Arguments<T> &args) { return args.m * args.n; }\n  static size_t GetSizeB(const Arguments<T> &) { return 1; } \/\/ N\/A for this kernel\n  static size_t GetSizeC(const Arguments<T> &) { return 1; } \/\/ N\/A for this kernel\n  static size_t GetSizeTemp(const Arguments<T> &) { return 1; } \/\/ N\/A for this kernel\n\n  \/\/ Sets the tuning parameters and their possible values\n  static void SetParameters(cltune::Tuner &tuner, const size_t id) {\n    tuner.AddParameter(id, \"WGS\"+std::to_string(V), {64, 128, 256});\n    tuner.AddParameter(id, \"WPT\"+std::to_string(V), {1, 2, 4});\n    if (V==2 || V==3) { tuner.AddParameter(id, \"VW\"+std::to_string(V), {1, 2, 4, 8}); }\n  }\n\n  \/\/ Sets the constraints and local memory size\n  static void SetConstraints(cltune::Tuner &tuner, const size_t id) {\n    auto MultipleOfX = [] (std::vector<size_t> v) { return IsMultiple(v[0], v[1]); };\n    if (V==2 || V==3) {\n      tuner.AddConstraint(id, MultipleOfX, {\"WPT\"+std::to_string(V), \"VW\"+std::to_string(V)});\n    }\n  }\n  static void SetLocalMemorySize(cltune::Tuner &tuner, const size_t id, const Arguments<T> &args) {\n    auto LocalMemorySize = [args] (std::vector<size_t> v) { return v[0]*GetBytes(args.precision); };\n    tuner.SetLocalMemoryUsage(id, LocalMemorySize, {\"WGS\"+std::to_string(V)});\n  }\n\n  \/\/ Sets the base thread configuration\n  static std::vector<size_t> GlobalSize(const Arguments<T> &args) { return {args.m}; }\n  static std::vector<size_t> GlobalSizeRef(const Arguments<T> &args) { return GlobalSize(args); }\n  static std::vector<size_t> LocalSize() { return {1}; }\n  static std::vector<size_t> LocalSizeRef() { return {64}; }\n\n  \/\/ Transforms the thread configuration based on the parameters\n  using TransformVector = std::vector<std::vector<std::string>>;\n  static TransformVector MulLocal() { return {{\"WGS\"+std::to_string(V)}}; }\n  static TransformVector DivLocal() { return {}; }\n  static TransformVector MulGlobal() { return {}; }\n  static TransformVector DivGlobal() { return {{\"WPT\"+std::to_string(V)}}; }\n\n  \/\/ Sets the kernel's arguments\n  static void SetArguments(cltune::Tuner &tuner, const Arguments<T> &args,\n                           std::vector<T> &x_vec, std::vector<T> &y_vec,\n                           std::vector<T> &a_mat, std::vector<T> &, std::vector<T> &,\n                           std::vector<T> &) {\n    auto a_rotated = (V==3) ? 1 : 0;\n    tuner.AddArgumentScalar(static_cast<int>(args.m));\n    tuner.AddArgumentScalar(static_cast<int>(args.n));\n    tuner.AddArgumentScalar(args.alpha);\n    tuner.AddArgumentScalar(args.beta);\n    tuner.AddArgumentScalar(static_cast<int>(a_rotated));\n    tuner.AddArgumentInput(a_mat);\n    tuner.AddArgumentScalar(0);\n    tuner.AddArgumentScalar(static_cast<int>(args.m));\n    tuner.AddArgumentInput(x_vec);\n    tuner.AddArgumentScalar(0);\n    tuner.AddArgumentScalar(1);\n    tuner.AddArgumentOutput(y_vec);\n    tuner.AddArgumentScalar(0);\n    tuner.AddArgumentScalar(1);\n    tuner.AddArgumentScalar(0); \/\/ Conjugate transpose\n    tuner.AddArgumentScalar(0); \/\/ Additional parameter\n    tuner.AddArgumentScalar(0); \/\/ Banded 'kl'\n    tuner.AddArgumentScalar(0); \/\/ Banded 'ku'\n  }\n\n  \/\/ Describes how to compute the performance metrics\n  static size_t GetMetric(const Arguments<T> &args) {\n    return (args.m*args.n + 2*args.m + args.n) * GetBytes(args.precision);\n  }\n  static std::string PerformanceUnit() { return \"GB\/s\"; }\n};\n\n\/\/ =================================================================================================\n} \/\/ namespace clblast\n\n\/\/ Shortcuts to the clblast namespace\nusing float2 = clblast::float2;\nusing double2 = clblast::double2;\n\n\/\/ Function to tune a specific variation V (not within the clblast namespace)\ntemplate <int V>\nvoid StartVariation(int argc, char *argv[]) {\n  switch(clblast::GetPrecision(argc, argv)) {\n    case clblast::Precision::kHalf: throw std::runtime_error(\"Unsupported precision mode\");\n    case clblast::Precision::kSingle: clblast::Tuner<clblast::TuneXgemv<float,V>, float>(argc, argv); break;\n    case clblast::Precision::kDouble: clblast::Tuner<clblast::TuneXgemv<double,V>, double>(argc, argv); break;\n    case clblast::Precision::kComplexSingle: clblast::Tuner<clblast::TuneXgemv<float2,V>, float2>(argc, argv); break;\n    case clblast::Precision::kComplexDouble: clblast::Tuner<clblast::TuneXgemv<double2,V>, double2>(argc, argv); break;\n  }\n}\n\n\/\/ Main function (not within the clblast namespace)\nint main(int argc, char *argv[]) {\n  StartVariation<1>(argc, argv);\n  StartVariation<2>(argc, argv);\n  StartVariation<3>(argc, argv);\n  return 0;\n}\n\n\/\/ =================================================================================================\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n#include \"allocator_block.hpp\"\n#include <boost\/container\/flat_set.hpp>\n#include <boost\/property_tree\/ptree_fwd.hpp>\n#include <mcppalloc\/object_state.hpp>\nnamespace mcppalloc\n{\n  namespace sparse\n  {\n    namespace details\n    {\n      using memory_range_t = ::std::pair<void *, void *>;\n      \/**\n       * \\brief This is a set of allocator blocks with the same minimum and maximum allocation size.\n       *\n       * This stores lists of allocator blocks for various sizes of allocations.\n      **\/\n      template <typename Allocator_Policy>\n      class allocator_block_set_t\n      {\n      public:\n        using allocator_policy_type = Allocator_Policy;\n        static_assert(::std::is_base_of<allocator_policy_tag_t, allocator_policy_type>::value,\n                      \"Allocator policy must be allocator_policy\");\n        using allocator = typename Allocator_Policy::internal_allocator_type;\n        using allocator_block_type = allocator_block_t<allocator_policy_type>;\n        using allocation_return_type = typename allocator_block_type::allocation_return_type;\n        using allocator_block_vector_t = rebind_vector_t<allocator_block_type, allocator>;\n        using sized_block_ref_t = typename ::std::pair<size_t, allocator_block_type *>;\n        using allocator_block_reference_vector_t = rebind_vector_t<sized_block_ref_t, allocator>;\n\n        const struct abrvr_compare_type {\n          constexpr auto operator()(const sized_block_ref_t &r, const sized_block_ref_t &it) const -> bool\n          {\n            if (r.first < it.first)\n              return true;\n            else if (r.first == it.first)\n              return r.second < it.second;\n            else\n              return false;\n          }\n\n        } abrvr_compare{};\n        const struct abrvr_size_compare_type {\n          constexpr auto operator()(const sized_block_ref_t &r, const sized_block_ref_t &it) const -> bool\n          {\n            return r.first < it.first;\n          }\n\n        } abrvr_size_compare{};\n\n        using allocator_block_flat_set_t =\n            ::boost::container::flat_set<sized_block_ref_t,\n                                         abrvr_compare_type,\n                                         typename ::std::allocator_traits<allocator>::template rebind_alloc<sized_block_ref_t>>;\n        using block_type = block_t<allocator_policy_type>;\n        explicit allocator_block_set_t() = default;\n        allocator_block_set_t(const allocator_block_set_t &) = delete;\n        allocator_block_set_t(allocator_block_set_t &&abs) = delete;\n        allocator_block_set_t &operator=(const allocator_block_set_t &) = delete;\n        allocator_block_set_t &operator=(allocator_block_set_t &&) = delete;\n        \/**\n         * \\brief Constructor\n         *\n         * @param allocator_min_size Minimum allocation size.\n         * @param allocator_max_size Maximum allocation size.\n        **\/\n        allocator_block_set_t(size_t allocator_min_size, size_t allocator_max_size);\n        \/**\n         * \\brief Set minimum and maximum allocation size.\n         *\n         * This should not be called after first use.\n         * @param min Minimum allocation size.\n         * @param max Maximum allocation size.\n        **\/\n        void _set_allocator_sizes(size_t min, size_t max);\n        \/**\n         * \\brief Return the minimum allocation size.\n        **\/\n        size_t allocator_min_size() const;\n        \/**\n         * \\brief Return the maximum object allocation size.\n        **\/\n        size_t allocator_max_size() const;\n        \/**\n         * \\brief Return the number of blocks in the set.\n        **\/\n        size_t size() const;\n        \/**\n         * \\brief Regenerate available blocks in case it is stale.\n         *\n         * Also should be called if m_blocks may have changed locations because of allocation.\n        **\/\n        void regenerate_available_blocks();\n        \/**\n         * \\brief Collect all blocks in set.\n        **\/\n        void collect();\n        \/**\n         * \\brief Allocate memory of given size, return nullptr if not possible in existing blocks.\n         *\n         * @param sz Size to allocate.\n         * @return A pointer to allocated memory, nullptr on failure.\n        **\/\n        auto allocate(size_t sz) -> allocation_return_type;\n        \/**\n         * \\brief Destroy memory.\n         * @return True if this block set allocated the memory and thus destroyed it, false otherwise.\n        **\/\n        bool destroy(void *v);\n\n        \/**\n         * \\brief Add a block to the set.\n         *\n         * @param lock_func Functional with no args called before modifing blocks.\n         * @param unlock_func Functional with no args called after modifying blocks.\n         * @param move_func Functional to call on moved blocks.\n        **\/\n        template <typename Lock_Functional, typename Unlock_Functional, typename Move_Functional>\n        auto add_block(allocator_block_type &&block,\n                       Lock_Functional &&lock_func,\n                       Unlock_Functional &&unlock_func,\n                       Move_Functional &&move_func) -> allocator_block_type &;\n        \/**\n         * \\brief Add a block to the set.\n        **\/\n        auto add_block(allocator_block_type &&block) -> allocator_block_type &;\n\n        \/**\n         * \\brief Remove a block from the set.\n         *\n         * The functional on_move is a functional of the form (begin,end,offset) that is called on blocks that are moved.\n         * param it Position to remove.\n         * @param lock_func Functional with no args called before modifing blocks.\n         * @param unlock_func Functional with no args called after modifying blocks.\n         * @param move_func Functional to call on moved blocks.\n         **\/\n        template <typename Lock_Functional, typename Unlock_Functional, typename Move_Functional>\n        void remove_block(typename allocator_block_vector_t::iterator it,\n                          Lock_Functional &&lock_func,\n                          Unlock_Functional &&unlock_func,\n                          Move_Functional &&move_func);\n        \/**\n         * \\brief Return true if add_block would cause the container of blocks to move in memory, false otherwise.\n        **\/\n        bool add_block_is_safe() const;\n        \/**\n         * \\brief Grow the capacity of m_blocks.  Return the offset by which it moved.\n         *\n         * Thus subtract offset from m_blocks[i] to get the old position.\n         * @param sz If provided, the number of blocks to reserve.\n        **\/\n        size_t grow_blocks(size_t sz = 0);\n        \/**\n         * \\brief Return reference to last added block.\n        **\/\n        auto last_block() noexcept -> allocator_block_type *;\n        \/**\n         * \\brief Return reference to last added block.\n        **\/\n        auto last_block() const noexcept -> const allocator_block_type *;\n        \/**\n         * \\brief Push all empty block memory ranges onto container t and then remove th\n         *\n         * The on_move is a functional of the form (begin,end,offset) that is called on blocks that are moved.\n         * @param l Function to call on removed blocks (called multiple times with r val block ref).\n         * @param lock_func Functional with no args called before modifing blocks.\n         * @param unlock_func Functional with no args called after modifying blocks.\n         * @param move_func Functional to call on moved blocks.\n         * @param min_to_leave Minimum number of free blocks to leave in this set.\n        **\/\n        template <typename L, typename Lock_Functional, typename Unlock_Functional, typename Move_Functional>\n        void free_empty_blocks(L &&l,\n                               Lock_Functional &&lock_func,\n                               Unlock_Functional &&unlock_func,\n                               Move_Functional &&move_func,\n                               size_t min_to_leave = 0);\n\n        \/**\n         * \\brief Return the number of memory addresses destroyed since last free empty blocks operation.\n         **\/\n        auto num_destroyed_since_last_free() const noexcept -> size_t;\n        \/**\n         * \\brief Do internal verification.\n        **\/\n        void _verify() const;\n        \/**\n         * \\brief Do maintance on thread associated blocks.\n         *\n         * Coalescing, etc happens here.\n        **\/\n        void _do_maintenance();\n\n        \/**\n         * \\brief Return the bytes of primary memory used.\n         **\/\n        auto primary_memory_used() const noexcept -> size_t;\n        \/**\n         * \\brief Return the bytes of secondary memory used.\n         **\/\n        auto secondary_memory_used() const noexcept -> size_t;\n        \/**\n         * \\brief Return the bytes of secondary memory used for self only.\n         **\/\n        auto secondary_memory_used_self() const noexcept -> size_t;\n        \/**\n         * \\brief Shrink secondary data structures to fit.\n         **\/\n        void shrink_secondary_memory_usage_to_fit();\n        \/**\n         * \\brief Shrink secondary data structures to fit for self only.\n         **\/\n        void shrink_secondary_memory_usage_to_fit_self();\n        \/**\n         * \\brief Put information about abs into a property tree.\n         * @param level Level of information to give.  Higher is more verbose.\n         **\/\n        void to_ptree(::boost::property_tree::ptree &ptree, int level) const;\n\n      private:\n        static const constexpr uint64_t cs_magic_prefix = 0x54a89202;\n        const volatile uint64_t m_magic_prefix{cs_magic_prefix};\n        allocator_block_type *m_last_block = nullptr;\n\n      public:\n        \/**\n         * \\brief Blocks that are available for placement.\n         *\n         * This is sorted by allocation size available.\n         * It does not contain a pointer to the last block.\n         * So if last block keeps getting hit, it is not necessary to recalculate memory free.\n         * First part of an element is memory available in that block.\n         * Second part is a pointer to the block.\n        **\/\n        allocator_block_flat_set_t m_available_blocks;\n        \/**\n         * \\brief All blocks.\n        **\/\n        allocator_block_vector_t m_blocks;\n\n      private:\n        \/**\n         * \\brief Minimum allocation size.\n        **\/\n        size_t m_allocator_min_size = 0;\n        \/**\n         * \\brief Maximum allocation size.\n        **\/\n        size_t m_allocator_max_size = 0;\n        \/*\n         * \\brief Number of memory addresses destroyed since last free empty blocks operation.\n         **\/\n        size_t m_num_destroyed_since_free = 0;\n      };\n    }\n  }\n}\n#include \"allocator_block_set_impl.hpp\"\n<commit_msg>Fix unneeded extended constexpr.<commit_after>#pragma once\n#include \"allocator_block.hpp\"\n#include <boost\/container\/flat_set.hpp>\n#include <boost\/property_tree\/ptree_fwd.hpp>\n#include <mcppalloc\/object_state.hpp>\nnamespace mcppalloc\n{\n  namespace sparse\n  {\n    namespace details\n    {\n      using memory_range_t = ::std::pair<void *, void *>;\n      \/**\n       * \\brief This is a set of allocator blocks with the same minimum and maximum allocation size.\n       *\n       * This stores lists of allocator blocks for various sizes of allocations.\n      **\/\n      template <typename Allocator_Policy>\n      class allocator_block_set_t\n      {\n      public:\n        using allocator_policy_type = Allocator_Policy;\n        static_assert(::std::is_base_of<allocator_policy_tag_t, allocator_policy_type>::value,\n                      \"Allocator policy must be allocator_policy\");\n        using allocator = typename Allocator_Policy::internal_allocator_type;\n        using allocator_block_type = allocator_block_t<allocator_policy_type>;\n        using allocation_return_type = typename allocator_block_type::allocation_return_type;\n        using allocator_block_vector_t = rebind_vector_t<allocator_block_type, allocator>;\n        using sized_block_ref_t = typename ::std::pair<size_t, allocator_block_type *>;\n        using allocator_block_reference_vector_t = rebind_vector_t<sized_block_ref_t, allocator>;\n\n        const struct abrvr_compare_type {\n          auto operator()(const sized_block_ref_t &r, const sized_block_ref_t &it) const -> bool\n          {\n            if (r.first < it.first)\n              return true;\n            else if (r.first == it.first)\n              return r.second < it.second;\n            else\n              return false;\n          }\n\n        } abrvr_compare{};\n        const struct abrvr_size_compare_type {\n          constexpr auto operator()(const sized_block_ref_t &r, const sized_block_ref_t &it) const -> bool\n          {\n            return r.first < it.first;\n          }\n\n        } abrvr_size_compare{};\n\n        using allocator_block_flat_set_t =\n            ::boost::container::flat_set<sized_block_ref_t,\n                                         abrvr_compare_type,\n                                         typename ::std::allocator_traits<allocator>::template rebind_alloc<sized_block_ref_t>>;\n        using block_type = block_t<allocator_policy_type>;\n        explicit allocator_block_set_t() = default;\n        allocator_block_set_t(const allocator_block_set_t &) = delete;\n        allocator_block_set_t(allocator_block_set_t &&abs) = delete;\n        allocator_block_set_t &operator=(const allocator_block_set_t &) = delete;\n        allocator_block_set_t &operator=(allocator_block_set_t &&) = delete;\n        \/**\n         * \\brief Constructor\n         *\n         * @param allocator_min_size Minimum allocation size.\n         * @param allocator_max_size Maximum allocation size.\n        **\/\n        allocator_block_set_t(size_t allocator_min_size, size_t allocator_max_size);\n        \/**\n         * \\brief Set minimum and maximum allocation size.\n         *\n         * This should not be called after first use.\n         * @param min Minimum allocation size.\n         * @param max Maximum allocation size.\n        **\/\n        void _set_allocator_sizes(size_t min, size_t max);\n        \/**\n         * \\brief Return the minimum allocation size.\n        **\/\n        size_t allocator_min_size() const;\n        \/**\n         * \\brief Return the maximum object allocation size.\n        **\/\n        size_t allocator_max_size() const;\n        \/**\n         * \\brief Return the number of blocks in the set.\n        **\/\n        size_t size() const;\n        \/**\n         * \\brief Regenerate available blocks in case it is stale.\n         *\n         * Also should be called if m_blocks may have changed locations because of allocation.\n        **\/\n        void regenerate_available_blocks();\n        \/**\n         * \\brief Collect all blocks in set.\n        **\/\n        void collect();\n        \/**\n         * \\brief Allocate memory of given size, return nullptr if not possible in existing blocks.\n         *\n         * @param sz Size to allocate.\n         * @return A pointer to allocated memory, nullptr on failure.\n        **\/\n        auto allocate(size_t sz) -> allocation_return_type;\n        \/**\n         * \\brief Destroy memory.\n         * @return True if this block set allocated the memory and thus destroyed it, false otherwise.\n        **\/\n        bool destroy(void *v);\n\n        \/**\n         * \\brief Add a block to the set.\n         *\n         * @param lock_func Functional with no args called before modifing blocks.\n         * @param unlock_func Functional with no args called after modifying blocks.\n         * @param move_func Functional to call on moved blocks.\n        **\/\n        template <typename Lock_Functional, typename Unlock_Functional, typename Move_Functional>\n        auto add_block(allocator_block_type &&block,\n                       Lock_Functional &&lock_func,\n                       Unlock_Functional &&unlock_func,\n                       Move_Functional &&move_func) -> allocator_block_type &;\n        \/**\n         * \\brief Add a block to the set.\n        **\/\n        auto add_block(allocator_block_type &&block) -> allocator_block_type &;\n\n        \/**\n         * \\brief Remove a block from the set.\n         *\n         * The functional on_move is a functional of the form (begin,end,offset) that is called on blocks that are moved.\n         * param it Position to remove.\n         * @param lock_func Functional with no args called before modifing blocks.\n         * @param unlock_func Functional with no args called after modifying blocks.\n         * @param move_func Functional to call on moved blocks.\n         **\/\n        template <typename Lock_Functional, typename Unlock_Functional, typename Move_Functional>\n        void remove_block(typename allocator_block_vector_t::iterator it,\n                          Lock_Functional &&lock_func,\n                          Unlock_Functional &&unlock_func,\n                          Move_Functional &&move_func);\n        \/**\n         * \\brief Return true if add_block would cause the container of blocks to move in memory, false otherwise.\n        **\/\n        bool add_block_is_safe() const;\n        \/**\n         * \\brief Grow the capacity of m_blocks.  Return the offset by which it moved.\n         *\n         * Thus subtract offset from m_blocks[i] to get the old position.\n         * @param sz If provided, the number of blocks to reserve.\n        **\/\n        size_t grow_blocks(size_t sz = 0);\n        \/**\n         * \\brief Return reference to last added block.\n        **\/\n        auto last_block() noexcept -> allocator_block_type *;\n        \/**\n         * \\brief Return reference to last added block.\n        **\/\n        auto last_block() const noexcept -> const allocator_block_type *;\n        \/**\n         * \\brief Push all empty block memory ranges onto container t and then remove th\n         *\n         * The on_move is a functional of the form (begin,end,offset) that is called on blocks that are moved.\n         * @param l Function to call on removed blocks (called multiple times with r val block ref).\n         * @param lock_func Functional with no args called before modifing blocks.\n         * @param unlock_func Functional with no args called after modifying blocks.\n         * @param move_func Functional to call on moved blocks.\n         * @param min_to_leave Minimum number of free blocks to leave in this set.\n        **\/\n        template <typename L, typename Lock_Functional, typename Unlock_Functional, typename Move_Functional>\n        void free_empty_blocks(L &&l,\n                               Lock_Functional &&lock_func,\n                               Unlock_Functional &&unlock_func,\n                               Move_Functional &&move_func,\n                               size_t min_to_leave = 0);\n\n        \/**\n         * \\brief Return the number of memory addresses destroyed since last free empty blocks operation.\n         **\/\n        auto num_destroyed_since_last_free() const noexcept -> size_t;\n        \/**\n         * \\brief Do internal verification.\n        **\/\n        void _verify() const;\n        \/**\n         * \\brief Do maintance on thread associated blocks.\n         *\n         * Coalescing, etc happens here.\n        **\/\n        void _do_maintenance();\n\n        \/**\n         * \\brief Return the bytes of primary memory used.\n         **\/\n        auto primary_memory_used() const noexcept -> size_t;\n        \/**\n         * \\brief Return the bytes of secondary memory used.\n         **\/\n        auto secondary_memory_used() const noexcept -> size_t;\n        \/**\n         * \\brief Return the bytes of secondary memory used for self only.\n         **\/\n        auto secondary_memory_used_self() const noexcept -> size_t;\n        \/**\n         * \\brief Shrink secondary data structures to fit.\n         **\/\n        void shrink_secondary_memory_usage_to_fit();\n        \/**\n         * \\brief Shrink secondary data structures to fit for self only.\n         **\/\n        void shrink_secondary_memory_usage_to_fit_self();\n        \/**\n         * \\brief Put information about abs into a property tree.\n         * @param level Level of information to give.  Higher is more verbose.\n         **\/\n        void to_ptree(::boost::property_tree::ptree &ptree, int level) const;\n\n      private:\n        static const constexpr uint64_t cs_magic_prefix = 0x54a89202;\n        const volatile uint64_t m_magic_prefix{cs_magic_prefix};\n        allocator_block_type *m_last_block = nullptr;\n\n      public:\n        \/**\n         * \\brief Blocks that are available for placement.\n         *\n         * This is sorted by allocation size available.\n         * It does not contain a pointer to the last block.\n         * So if last block keeps getting hit, it is not necessary to recalculate memory free.\n         * First part of an element is memory available in that block.\n         * Second part is a pointer to the block.\n        **\/\n        allocator_block_flat_set_t m_available_blocks;\n        \/**\n         * \\brief All blocks.\n        **\/\n        allocator_block_vector_t m_blocks;\n\n      private:\n        \/**\n         * \\brief Minimum allocation size.\n        **\/\n        size_t m_allocator_min_size = 0;\n        \/**\n         * \\brief Maximum allocation size.\n        **\/\n        size_t m_allocator_max_size = 0;\n        \/*\n         * \\brief Number of memory addresses destroyed since last free empty blocks operation.\n         **\/\n        size_t m_num_destroyed_since_free = 0;\n      };\n    }\n  }\n}\n#include \"allocator_block_set_impl.hpp\"\n<|endoftext|>"}
{"text":"<commit_before>#include \"skybox.h\"\n#include \"mathplus.h\"\n#include <SFML\/Graphics\/RenderTarget.hpp>\n#include <SFML\/Graphics\/Sprite.hpp>\n\nSkybox::Skybox(){\n\tstd::string filename = \"data\/skybox_plains.png\";\n\tmTexture = std::make_shared<sf::Texture>();\n\tmTexture->loadFromFile(filename);\n\tmTexture->setRepeated(true);\n\tmPhaseColor[Day] = sf::Color(128,192,255);\n\tmPhaseColor[Night] = sf::Color(0,32,64);\n\n\tint ticksPerMinute = 25 * 60;\n\tmPhaseTime[Day] = 5 * ticksPerMinute;\n\tmPhaseTime[Night] = 6 * ticksPerMinute;\n\tmTicks = 0;\n\tmInterpolationTime = ticksPerMinute * 1;\n}\n\nvoid Skybox::tick(){\n\tmTicks++;\n\tif (mTicks >= mPhaseTime[Phase::Max - 1])\n\t\tmTicks = 0;\n}\n\nSkybox::Phase Skybox::getPhase() const{\n\tfor(int i = 0; i < Phase::Max; i++){\n\t\tif (mTicks < mPhaseTime[i])\n\t\t\treturn static_cast<Skybox::Phase>(i);\n\t}\n\treturn Night;\n}\n\nvoid Skybox::render(sf::RenderTarget& window) const{\n\trenderSky(window);\n\n\tif (getPhase() == Phase::Day){\n\t\tsf::IntRect rect(0,0,128,128);\n\t\trenderSun(window, rect, 0, mPhaseTime[Phase::Day] - mInterpolationTime);\n\t} else {\n\t\tsf::IntRect rect(128,0,128,128);\n\t\trenderSun(window, rect, mPhaseTime[Phase::Day] - mInterpolationTime, mPhaseTime[Phase::Night]);\n\t}\n\n\trenderTerrain(window, 128, 384, 0.3);\n\trenderTerrain(window, 128, 256, 0.6);\n}\n\nvoid Skybox::renderSky(sf::RenderTarget& window) const{\n\tPhase phase = getPhase();\n\n\tif (mTicks + mInterpolationTime >= mPhaseTime[phase]){\n\t\tauto& oldColor = mPhaseColor[phase];\n\t\tauto& newColor = mPhaseColor[(phase + 1) % Phase::Max];\n\n\t\tdouble interpolation = 1 - static_cast<double>(mPhaseTime[phase] - mTicks) \/ static_cast<double>(mInterpolationTime);\n\n\t\twindow.clear(sf::Color(\n\t\t\tMathPlus::interpolate(oldColor.r, newColor.r, interpolation),\n\t\t\tMathPlus::interpolate(oldColor.g, newColor.g, interpolation),\n\t\t\tMathPlus::interpolate(oldColor.b, newColor.b, interpolation)));\n\t} else {\n\t\twindow.clear(mPhaseColor[phase]);\n\t}\n}\n\nvoid Skybox::renderTerrain(sf::RenderTarget& window, int imgTop, int imgHeight, double scrollSpeed) const{\n\t\/\/ Draw the terain\n\tsf::Sprite sprite;\n\tsprite.setTexture(*mTexture);\n\n\tsf::Vector2u windowSize = window.getSize();\n\n\tint terrainHeight = std::min(imgHeight, static_cast<int>(windowSize.y \/ 2));\n\n\tsf::Vector2f worldPos = window.mapPixelToCoords(sf::Vector2i(0,windowSize.y - terrainHeight ));\n\n\tsprite.setPosition(worldPos);\n\tsprite.setScale(sf::Vector2f(0.5f, 0.5f));\n\n\tint skyLeft = static_cast<int>(window.getView().getCenter().x * scrollSpeed);\n\n\tsprite.setTextureRect(sf::IntRect(skyLeft, imgTop, windowSize.x, imgHeight));\n\n\twindow.draw(sprite);\n}\n\nvoid Skybox::renderSun(sf::RenderTarget& window, const sf::IntRect& rect, int tickStart, int tickEnd) const{\n\tif (mTicks < tickStart || mTicks > tickEnd)\n\t\treturn;\n\n\tdouble time = static_cast<double>(mTicks - tickStart) \/ static_cast<double>(tickEnd - tickStart);\n\n\tsf::Sprite sprite;\n\tsprite.setTexture(*mTexture);\n\tsprite.setTextureRect(rect);\n\tsprite.setOrigin(64,64);\n\tfloat scale = 0.3f;\n\tsprite.setScale(scale, scale);\n\n\tconstexpr double pi = 3.141592;\n\n\tsf::Vector2u windowSize = window.getSize();\n\n\tsf::Vector2i center(windowSize.x \/ 2, windowSize.y - 200);\n\tsf::Vector2f radius(windowSize.x * 0.4, windowSize.x * 0.2);\n\tdouble angle = pi * (time) + pi;\n\tsf::Vector2i translate(std::cos(angle) * radius.x, std::sin(angle) * radius.y);\n\tsf::Vector2f worldPos = window.mapPixelToCoords(center + translate);\n\n\tsprite.setPosition(worldPos);\n\n\twindow.draw(sprite);\n}\n\n<commit_msg>Fixed moon in Skybox<commit_after>#include \"skybox.h\"\n#include \"mathplus.h\"\n#include <SFML\/Graphics\/RenderTarget.hpp>\n#include <SFML\/Graphics\/Sprite.hpp>\n\nSkybox::Skybox(){\n\tstd::string filename = \"data\/skybox_plains.png\";\n\tmTexture = std::make_shared<sf::Texture>();\n\tmTexture->loadFromFile(filename);\n\tmTexture->setRepeated(true);\n\tmPhaseColor[Day] = sf::Color(128,192,255);\n\tmPhaseColor[Night] = sf::Color(0,32,64);\n\n\tint ticksPerMinute = 25 * 60;\n\tmPhaseTime[Day] = 5 * ticksPerMinute;\n\tmPhaseTime[Night] = 6 * ticksPerMinute;\n\tmTicks = 0;\n\tmInterpolationTime = ticksPerMinute * 1;\n}\n\nvoid Skybox::tick(){\n\tmTicks++;\n\tif (mTicks >= mPhaseTime[Phase::Max - 1])\n\t\tmTicks = 0;\n}\n\nSkybox::Phase Skybox::getPhase() const{\n\tfor(int i = 0; i < Phase::Max; i++){\n\t\tif (mTicks < mPhaseTime[i])\n\t\t\treturn static_cast<Skybox::Phase>(i);\n\t}\n\treturn Night;\n}\n\nvoid Skybox::render(sf::RenderTarget& window) const{\n\trenderSky(window);\n\n\trenderSun(window, sf::IntRect(0,0,128,128), 0, mPhaseTime[Phase::Day] - mInterpolationTime);\n\trenderSun(window, sf::IntRect(128,0,128,128), mPhaseTime[Phase::Day] - mInterpolationTime, mPhaseTime[Phase::Night]);\n\n\trenderTerrain(window, 128, 384, 0.3);\n\trenderTerrain(window, 128, 256, 0.6);\n}\n\nvoid Skybox::renderSky(sf::RenderTarget& window) const{\n\tPhase phase = getPhase();\n\n\tif (mTicks + mInterpolationTime >= mPhaseTime[phase]){\n\t\tauto& oldColor = mPhaseColor[phase];\n\t\tauto& newColor = mPhaseColor[(phase + 1) % Phase::Max];\n\n\t\tdouble interpolation = 1 - static_cast<double>(mPhaseTime[phase] - mTicks) \/ static_cast<double>(mInterpolationTime);\n\n\t\twindow.clear(sf::Color(\n\t\t\tMathPlus::interpolate(oldColor.r, newColor.r, interpolation),\n\t\t\tMathPlus::interpolate(oldColor.g, newColor.g, interpolation),\n\t\t\tMathPlus::interpolate(oldColor.b, newColor.b, interpolation)));\n\t} else {\n\t\twindow.clear(mPhaseColor[phase]);\n\t}\n}\n\nvoid Skybox::renderTerrain(sf::RenderTarget& window, int imgTop, int imgHeight, double scrollSpeed) const{\n\t\/\/ Draw the terain\n\tsf::Sprite sprite;\n\tsprite.setTexture(*mTexture);\n\n\tsf::Vector2u windowSize = window.getSize();\n\n\tint terrainHeight = std::min(imgHeight, static_cast<int>(windowSize.y \/ 2));\n\n\tsf::Vector2f worldPos = window.mapPixelToCoords(sf::Vector2i(0,windowSize.y - terrainHeight ));\n\n\tsprite.setPosition(worldPos);\n\tsprite.setScale(sf::Vector2f(0.5f, 0.5f));\n\n\tint skyLeft = static_cast<int>(window.getView().getCenter().x * scrollSpeed);\n\n\tsprite.setTextureRect(sf::IntRect(skyLeft, imgTop, windowSize.x, imgHeight));\n\n\twindow.draw(sprite);\n}\n\nvoid Skybox::renderSun(sf::RenderTarget& window, const sf::IntRect& rect, int tickStart, int tickEnd) const{\n\tif (mTicks < tickStart || mTicks > tickEnd)\n\t\treturn;\n\n\tdouble time = static_cast<double>(mTicks - tickStart) \/ static_cast<double>(tickEnd - tickStart);\n\n\tsf::Sprite sprite;\n\tsprite.setTexture(*mTexture);\n\tsprite.setTextureRect(rect);\n\tsprite.setOrigin(64,64);\n\tfloat scale = 0.3f;\n\tsprite.setScale(scale, scale);\n\n\tconstexpr double pi = 3.141592;\n\n\tsf::Vector2u windowSize = window.getSize();\n\n\tsf::Vector2i center(windowSize.x \/ 2, windowSize.y - 200);\n\tsf::Vector2f radius(windowSize.x * 0.4, windowSize.x * 0.2);\n\tdouble angle = pi * (time) + pi;\n\tsf::Vector2i translate(std::cos(angle) * radius.x, std::sin(angle) * radius.y);\n\tsf::Vector2f worldPos = window.mapPixelToCoords(center + translate);\n\n\tsprite.setPosition(worldPos);\n\n\twindow.draw(sprite);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"envoy\/common\/exception.h\"\n\n#include \"common\/config\/rds_json.h\"\n#include \"common\/json\/json_loader.h\"\n\n#include \"gmock\/gmock.h\"\n#include \"gtest\/gtest.h\"\n\nusing testing::_;\n\nnamespace Envoy {\nnamespace Config {\nnamespace {\n\nTEST(RdsJsonTest, TestRuntimeFractionTranslation) {\n  const std::string json_string = R\"EOF(\n  {\n    \"prefix\": \"\/new_endpoint\",\n    \"prefix_rewrite\": \"\/api\/new_endpoint\",\n    \"cluster\": \"www2\",\n    \"runtime\": {\n      \"default\": 42,\n      \"key\": \"some_key\"\n    },\n    \"request_headers_to_add\": [\n      {\n        \"key\": \"x-key\",\n        \"value\": \"%UPSTREAM_METADATA([\\\"namespace\\\", \\\"key\\\"])%\"\n      }\n    ]\n  }\n  )EOF\";\n  envoy::api::v2::route::Route route;\n  auto json_object_ptr = Json::Factory::loadFromString(json_string);\n  Envoy::Config::RdsJson::translateRoute(*json_object_ptr, route);\n\n  EXPECT_EQ(route.match().runtime_fraction().default_value().numerator(), 42);\n  EXPECT_EQ(route.match().runtime_fraction().default_value().denominator(),\n            envoy::type::FractionalPercent::HUNDRED);\n  EXPECT_EQ(route.match().runtime_fraction().runtime_key(), \"some_key\");\n}\n\n} \/\/ namespace\n} \/\/ namespace Config\n} \/\/ namespace Envoy\n<commit_msg>Add test of parsing weighted_cluster route configuration to improve test coverage. (#6711)<commit_after>#include \"envoy\/common\/exception.h\"\n\n#include \"common\/config\/rds_json.h\"\n#include \"common\/json\/json_loader.h\"\n\n#include \"gmock\/gmock.h\"\n#include \"gtest\/gtest.h\"\n\nusing testing::_;\n\nnamespace Envoy {\nnamespace Config {\nnamespace {\n\nTEST(RdsJsonTest, TestRuntimeFractionTranslation) {\n  const std::string json_string = R\"EOF(\n  {\n    \"prefix\": \"\/new_endpoint\",\n    \"prefix_rewrite\": \"\/api\/new_endpoint\",\n    \"cluster\": \"www2\",\n    \"runtime\": {\n      \"default\": 42,\n      \"key\": \"some_key\"\n    },\n    \"request_headers_to_add\": [\n      {\n        \"key\": \"x-key\",\n        \"value\": \"%UPSTREAM_METADATA([\\\"namespace\\\", \\\"key\\\"])%\"\n      }\n    ]\n  }\n  )EOF\";\n  envoy::api::v2::route::Route route;\n  auto json_object_ptr = Json::Factory::loadFromString(json_string);\n  Envoy::Config::RdsJson::translateRoute(*json_object_ptr, route);\n\n  EXPECT_EQ(route.match().runtime_fraction().default_value().numerator(), 42);\n  EXPECT_EQ(route.match().runtime_fraction().default_value().denominator(),\n            envoy::type::FractionalPercent::HUNDRED);\n  EXPECT_EQ(route.match().runtime_fraction().runtime_key(), \"some_key\");\n}\n\nTEST(RdsJsonTest, TestWeightedClusterTranslation) {\n  const std::string json_string = R\"EOF(\n  {\n    \"prefix\": \"\/new_endpoint\",\n    \"prefix_rewrite\": \"\/api\/new_endpoint\",\n    \"weighted_clusters\": {\n      \"clusters\": [\n        {\n          \"name\": \"foo\",\n          \"weight\": 80\n        },\n        {\n          \"name\": \"bar\",\n          \"weight\": 20\n        }\n      ]\n    }\n  }\n  )EOF\";\n  envoy::api::v2::route::Route route;\n  auto json_object_ptr = Json::Factory::loadFromString(json_string);\n  Envoy::Config::RdsJson::translateRoute(*json_object_ptr, route);\n\n  EXPECT_TRUE(route.has_route());\n  EXPECT_TRUE(route.route().has_weighted_clusters());\n  EXPECT_EQ(2, route.route().weighted_clusters().clusters_size());\n  EXPECT_EQ(\"foo\", route.route().weighted_clusters().clusters(0).name());\n  EXPECT_EQ(80, route.route().weighted_clusters().clusters(0).weight().value());\n  EXPECT_EQ(\"bar\", route.route().weighted_clusters().clusters(1).name());\n  EXPECT_EQ(20, route.route().weighted_clusters().clusters(1).weight().value());\n}\n\n} \/\/ namespace\n} \/\/ namespace Config\n} \/\/ namespace Envoy\n<|endoftext|>"}
{"text":"<commit_before>#include <algorithm>\n#include <cctype>\n#include <cstdlib>\n#include <iostream>\n#include <memory>\n#include <string>\n#include <unordered_map>\n#include <vector>\n\n\/\/ Require libidn for handling international domain names.\n#include <idna.h>\n\n#include \"phf\/builder.h\"\n\n#include \"public-suffix-types.h\"\n\nusing namespace public_suffix;\n\nclass Suffix\n{\npublic:\n\tSuffix(Rule rule, const std::string &label) : rule_(rule), label_(label)\n\t{\n\t}\n\n\tauto GetSuffix(const std::string &label)\n\t{\n\t\treturn std::find_if(\n\t\t\tnext_level_.begin(), next_level_.end(),\n\t\t\t[&label](const Suffix &suffix) { return suffix.label_ == label; });\n\t}\n\n\tvoid AddSuffix(Rule rule, const std::string &next, const std::string &first,\n\t\t       const std::string &rest)\n\t{\n\t\tauto delim = next.find_last_of('.');\n\t\tif (delim == std::string::npos) {\n\t\t\tauto it = GetSuffix(next);\n\t\t\tif (it == next_level_.end())\n\t\t\t\tnext_level_.emplace_back(rule, next);\n\t\t\telse if (it->rule_ != Rule::kDefault)\n\t\t\t\tthrow std::runtime_error(\"Duplicate name: \" + rest + \".\"\n\t\t\t\t\t\t\t + first);\n\t\t\telse\n\t\t\t\tit->rule_ = rule;\n\t\t} else {\n\t\t\tstd::string last = next.substr(delim + 1);\n\t\t\tstd::string more = next.substr(0, delim);\n\t\t\tauto it = GetSuffix(last);\n\t\t\tif (it == next_level_.end()) {\n\t\t\t\tnext_level_.emplace_back(Rule::kDefault, last);\n\t\t\t\tnext_level_.back().AddSuffix(rule, more, first, rest);\n\t\t\t} else {\n\t\t\t\tit->AddSuffix(rule, more, first, rest);\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid Dump(std::ostream &stream, size_t level) const\n\t{\n\t\tstream << \"\/\/ \";\n\t\tfor (size_t i = 0; i < level; i++)\n\t\t\tstream << \"  \";\n\t\tif (rule_ == Rule::kException)\n\t\t\tstream << '!';\n\t\telse if (rule_ == Rule::kWildcard)\n\t\t\tstream << \"*.\";\n\t\tstream << label_;\n\t\tstream << \"\\n\";\n\n\t\tfor (const auto &suffix : next_level_)\n\t\t\tsuffix.Dump(stream, level + 1);\n\t}\n\nprivate:\n\tRule rule_;\n\tstd::string label_;\n\tstd::vector<Suffix> next_level_;\n\n\tfriend class SuffixRoot;\n};\n\nclass SuffixRoot\n{\npublic:\n\tvoid AddSingle(const std::string &label)\n\t{\n\t\tauto it = std::find_if(first_level_.begin(), first_level_.end(),\n\t\t\t\t       [&label](auto suffix) { return suffix == label; });\n\t\tif (it != first_level_.end())\n\t\t\tthrow std::runtime_error(\"Duplicate name: \" + label);\n\t\tfirst_level_.emplace_back(label);\n\t}\n\n\tvoid AddDouble(Rule rule, const std::string &label)\n\t{\n\t\tauto it = second_level_.find(label);\n\t\tif (it == second_level_.end())\n\t\t\tsecond_level_.emplace(label, Suffix(rule, label));\n\t\telse if (it->second.rule_ != Rule::kDefault)\n\t\t\tthrow std::runtime_error(\"Duplicate name: \" + label);\n\t\telse\n\t\t\tit->second.rule_ = rule;\n\t}\n\n\tvoid AddMultiple(Rule rule, const std::string &first, const std::string &rest)\n\t{\n\t\tauto it = second_level_.find(first);\n\t\tif (it == second_level_.end())\n\t\t\tit = second_level_.emplace(first, Suffix(Rule::kDefault, first)).first;\n\t\tit->second.AddSuffix(rule, rest, first, rest);\n\t}\n\n\tvoid BuildMPHF() {\n\t\tauto seed = phf::random_device_seed{}();\n\t\tphf::builder<16, std::string, Fnv64> builder(1.5, seed);\n\t\tfor (const auto &suffix : second_level_)\n\t\t\tbuilder.insert(suffix.second.label_);\n\t\tbuilder.build();\n\t}\n\n\tvoid Dump(std::ostream &stream) const\n\t{\n\t\tstream << \"\/\/\\n\";\n\t\tfor (const auto &label : first_level_)\n\t\t\tstream << \"\/\/ *.\" << label << \"\\n\";\n\t\tstream << \"\/\/\\n\";\n\t\tfor (const auto &suffix : second_level_)\n\t\t\tsuffix.second.Dump(stream, 0);\n\t\tstream << \"\/\/\\n\";\n\t}\n\nprivate:\n\t\/\/ Main suffix table. Contains all entries with at least two labels\n\t\/\/ such \"co.uk\", \"foo.co.uk\" etc.\n\tstd::unordered_map<std::string, Suffix> second_level_;\n\n\t\/\/ Additional suffix table. Contains only wildcard entries with\n\t\/\/ single specified label such as \"*.ck\"\n\tstd::vector<std::string> first_level_;\n};\n\nint\nmain(int ac, char *av[]) try {\n\tif (ac != 1) {\n\t\tstd::cerr << \"Usage: \" << av[0] << \"<input-file >output-file\\n\";\n\t\treturn EXIT_FAILURE;\n\t}\n\n\tSuffixRoot root;\n\n\tfor (;;) {\n\t\tstd::string line;\n\t\tif (!std::getline(std::cin, line))\n\t\t\tbreak;\n\n\t\t\/\/ Trim everything after the first white space.\n\t\tstd::string data = line.substr(0, line.find_first_of(\" \\t\\r\"));\n\t\t\/\/ Skip empty lines and comments.\n\t\tif (data.empty() || data.front() == '\/')\n\t\t\tcontinue;\n\n\t\t\/\/ Trim a trailing dot if any. From this point onward it is\n\t\t\/\/ safe to access the char just after any found dot as it\n\t\t\/\/ cannot be at the string end.\n\t\tif (data.back() == '.') {\n\t\t\tdata.pop_back();\n\t\t\t\/\/ Two consecutive dots are not allowed. A solitary\n\t\t\t\/\/ dot is not allowed as well.\n\t\t\tif (data.empty() || data.back() == '.')\n\t\t\t\tthrow std::runtime_error(\"Invalid line: \" + line);\n\t\t}\n\n\t\t\/\/ Presume the line contains just a regular host name.\n\t\tRule rule = Rule::kRegular;\n\t\tsize_t skip = 0;\n\n\t\t\/\/ Check for special cases: a wildcard or exception rule.\n\t\tif (data.front() == '!') {\n\t\t\trule = Rule::kException;\n\t\t\tskip = 1;\n\t\t} else if (data.front() == '*') {\n\t\t\trule = Rule::kWildcard;\n\t\t\tfor (++skip; skip < data.size(); skip += 2) {\n\t\t\t\tif (data[skip] != '.')\n\t\t\t\t\tthrow std::runtime_error(\"Invalid line: \" + line);\n\t\t\t\tif (data[skip + 1] != '*')\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Skip a leading dot if any. From this point onward it is safe\n\t\t\/\/ to access the char just before any found dot.\n\t\tif (skip < data.size() && data[skip] == '.') {\n\t\t\t++skip;\n\t\t\t\/\/ Two consecutive dots are not allowed. A solitary\n\t\t\t\/\/ dot is not allowed as well.\n\t\t\tif (skip >= data.size() || data[skip] == '.')\n\t\t\t\tthrow std::runtime_error(\"Invalid line: \" + line);\n\t\t}\n\n\t\t\/\/ Encode a possibly international name.\n\t\tchar *idn_result;\n\t\tif (skip >= data.size())\n\t\t\tthrow std::runtime_error(\"Invalid line: \" + line);\n\t\tif (idna_to_ascii_8z(data.data() + skip, &idn_result, 0) != IDNA_SUCCESS)\n\t\t\tthrow std::runtime_error(\"Invalid line: \" + line);\n\t\tstd::unique_ptr<char, decltype(&std::free)> idn_free(idn_result, &std::free);\n\n\t\t\/\/ Verify that the name contains only valid chars.\n\t\tdata.assign(idn_result);\n\t\tfor (auto c : data) {\n\t\t\tif (!std::isalnum(c) && c != '.' && c != '-')\n\t\t\t\tthrow std::runtime_error(\"Invalid line: \" + line);\n\t\t}\n\n\t\t\/\/ Seek where the rightmost label starts.\n\t\tauto delim = data.find_last_of('.');\n\t\tif (delim == std::string::npos) {\n\t\t\t\/\/ If this is a trivial TLD then don't bother with it.\n\t\t\t\/\/ However remember it if it as a wildcard rule.\n\t\t\tif (rule == Rule::kWildcard)\n\t\t\t\troot.AddSingle(data);\n\t\t} else {\n\t\t\tif (data[delim - 1] == '.')\n\t\t\t\tthrow std::runtime_error(\"Invalid line: \" + line);\n\n\t\t\tdelim = data.find_last_of('.', delim - 1);\n\t\t\tif (delim == std::string::npos)\n\t\t\t\troot.AddDouble(rule, data);\n\t\t\telse\n\t\t\t\troot.AddMultiple(rule, data.substr(delim + 1),\n\t\t\t\t\t\t data.substr(0, delim));\n\t\t}\n\t}\n\n\t\/\/root.Dump(std::cout);\n\troot.BuildMPHF();\n\n\treturn EXIT_SUCCESS;\n} catch (std::exception &e) {\n\tstd::cerr << \"Exception occurred: \" << e.what() << '\\n';\n\treturn EXIT_FAILURE;\n}\n<commit_msg>Build suffix tables<commit_after>#include <algorithm>\n#include <cctype>\n#include <cstdlib>\n#include <iostream>\n#include <memory>\n#include <string>\n#include <unordered_map>\n#include <vector>\n\n\/\/ Require libidn for handling international domain names.\n#include <idna.h>\n\n#define PHF_DEBUG 2\n#include \"phf\/builder.h\"\n\n#include \"public-suffix-types.h\"\n\nusing namespace public_suffix;\n\nstruct BuildContext\n{\n\tstd::size_t aux_tables = 0;\n\tstd::size_t max_label_size = 0;\n};\n\nclass Suffix\n{\npublic:\n\tSuffix(Rule rule, const std::string &label) : rule_(rule), label_(label)\n\t{\n\t}\n\n\tauto GetSuffix(const std::string &label)\n\t{\n\t\treturn std::find_if(\n\t\t\tnext_level_.begin(), next_level_.end(),\n\t\t\t[&label](const Suffix &suffix) { return suffix.label_ == label; });\n\t}\n\n\tvoid AddSuffix(Rule rule, const std::string &next, const std::string &first,\n\t\t       const std::string &rest)\n\t{\n\t\tauto delim = next.find_last_of('.');\n\t\tif (delim == std::string::npos) {\n\t\t\tauto it = GetSuffix(next);\n\t\t\tif (it == next_level_.end())\n\t\t\t\tnext_level_.emplace_back(rule, next);\n\t\t\telse if (it->rule_ != Rule::kDefault)\n\t\t\t\tthrow std::runtime_error(\"Duplicate name: \" + rest + \".\"\n\t\t\t\t\t\t\t + first);\n\t\t\telse\n\t\t\t\tit->rule_ = rule;\n\t\t} else {\n\t\t\tstd::string last = next.substr(delim + 1);\n\t\t\tstd::string more = next.substr(0, delim);\n\t\t\tauto it = GetSuffix(last);\n\t\t\tif (it == next_level_.end()) {\n\t\t\t\tnext_level_.emplace_back(Rule::kDefault, last);\n\t\t\t\tnext_level_.back().AddSuffix(rule, more, first, rest);\n\t\t\t} else {\n\t\t\t\tit->AddSuffix(rule, more, first, rest);\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid Dump(std::ostream &stream, size_t level) const\n\t{\n\t\tstream << \"\/\/ \";\n\t\tfor (size_t i = 0; i < level; i++)\n\t\t\tstream << \"  \";\n\t\tif (rule_ == Rule::kException)\n\t\t\tstream << '!';\n\t\telse if (rule_ == Rule::kWildcard)\n\t\t\tstream << \"*.\";\n\t\tstream << label_;\n\t\tstream << \"\\n\";\n\n\t\tfor (const auto &suffix : next_level_)\n\t\t\tsuffix.Dump(stream, level + 1);\n\t}\n\n\tvoid BuildPrepare(BuildContext &ctx)\n\t{\n\t\tauto size = label_.size() + 1;\n\t\tif (ctx.max_label_size < size)\n\t\t\tctx.max_label_size = size;\n\n\t\tif (!next_level_.empty()) {\n\t\t\tfor (auto &suffix : next_level_)\n\t\t\t\tsuffix.BuildPrepare(ctx);\n\n\t\t\tauto aux_table_no = ctx.aux_tables++;\n\t\t\tnode_ = \"node_\" + std::to_string(aux_table_no);\n\t\t}\n\t}\n\n\tvoid BuildNode()\n\t{\n\t\tif (!next_level_.empty()) {\n\t\t\tfor (auto &suffix : next_level_)\n\t\t\t\tsuffix.BuildNode();\n\n\t\t\tstd::cout << \"Node \" << node_ << \"[] = {\\n\";\n\t\t\tfor (auto &suffix : next_level_) {\n\t\t\t\tstd::cout << \"\\t{\\\"\" << suffix.label_ << \"\\\", \"\n\t\t\t\t\t  << suffix.next_level_.size() << \", \" << suffix.rule_;\n\t\t\t\tif (!suffix.next_level_.empty())\n\t\t\t\t\tstd::cout << \", \" << suffix.node_;\n\t\t\t\tstd::cout << \"},\\n\";\n\t\t\t}\n\t\t\tstd::cout << \"};\\n\\n\";\n\t\t}\n\t}\n\nprivate:\n\tRule rule_;\n\tstd::string label_;\n\tstd::vector<Suffix> next_level_;\n\n\tstd::string node_;\n\n\tfriend class SuffixRoot;\n};\n\nclass SuffixRoot\n{\npublic:\n\tvoid AddSingle(const std::string &label)\n\t{\n\t\tauto it = std::find_if(first_level_.begin(), first_level_.end(),\n\t\t\t\t       [&label](auto suffix) { return suffix == label; });\n\t\tif (it != first_level_.end())\n\t\t\tthrow std::runtime_error(\"Duplicate name: \" + label);\n\t\tfirst_level_.emplace_back(label);\n\t}\n\n\tvoid AddDouble(Rule rule, const std::string &label)\n\t{\n\t\tauto it = second_level_.find(label);\n\t\tif (it == second_level_.end())\n\t\t\tsecond_level_.emplace(label, Suffix(rule, label));\n\t\telse if (it->second.rule_ != Rule::kDefault)\n\t\t\tthrow std::runtime_error(\"Duplicate name: \" + label);\n\t\telse\n\t\t\tit->second.rule_ = rule;\n\t}\n\n\tvoid AddMultiple(Rule rule, const std::string &first, const std::string &rest)\n\t{\n\t\tauto it = second_level_.find(first);\n\t\tif (it == second_level_.end())\n\t\t\tit = second_level_.emplace(first, Suffix(Rule::kDefault, first)).first;\n\t\tit->second.AddSuffix(rule, rest, first, rest);\n\t}\n\n\tvoid BuildMPHF()\n\t{\n\t\tauto seed = phf::random_device_seed{}();\n\t\tphf::builder<16, std::string, Fnv64> builder(4, seed);\n\t\tfor (const auto &suffix : second_level_)\n\t\t\tbuilder.insert(suffix.second.label_);\n\n\t\tauto mph = builder.build();\n\n\t\tstd::vector<Suffix *> index(second_level_.size());\n\t\tfor (auto &suffix : second_level_) {\n\t\t\tauto i = (*mph)[suffix.second.label_];\n\t\t\tif (i >= index.size())\n\t\t\t\tthrow std::runtime_error(\"mph produced invalid index \"\n\t\t\t\t\t\t\t + std::to_string(i));\n\t\t\tindex[i] = &suffix.second;\n\t\t}\n\n\t\tBuildContext ctx;\n\t\tfor (auto suffix : index) {\n\t\t\tsuffix->BuildPrepare(ctx);\n\t\t}\n\t\tfor (auto &label : first_level_) {\n\t\t\tauto size = label.size() + 1;\n\t\t\tif (ctx.max_label_size < size)\n\t\t\t\tctx.max_label_size = size;\n\t\t}\n\n\t\tstd::cout << \"#include \\\"public-suffix-types.h\\\"\\n\\n\";\n\t\tstd::cout << \"using namespace public_suffix;\\n\\n\";\n\t\tstd::cout << \"namespace {\\n\\n\";\n\t\tstd::cout << \"struct Node {\\n\";\n\t\tstd::cout << \"\\tchar label[\" << ctx.max_label_size << \"];\\n\";\n\t\tstd::cout << \"\\tuint8_t size;\\n\";\n\t\tstd::cout << \"\\tRule rule;\\n\";\n\t\tstd::cout << \"\\tNode* node;\\n\";\n\t\tstd::cout << \"};\\n\\n\";\n\n\t\tfor (auto &suffix : index) {\n\t\t\tif (!suffix->next_level_.empty())\n\t\t\t\tsuffix->BuildNode();\n\t\t}\n\n\t\tstd::cout << \"Node second_level_nodes[] = {\\n\";\n\t\tfor (auto suffix : index) {\n\t\t\tstd::cout << \"\\t{\\\"\" << suffix->label_ << \"\\\", \"\n\t\t\t\t  << suffix->next_level_.size() << \", \" << suffix->rule_;\n\t\t\tif (!suffix->next_level_.empty())\n\t\t\t\tstd::cout << \", \" << suffix->node_;\n\t\t\tstd::cout << \"},\\n\";\n\t\t}\n\t\tstd::cout << \"};\\n\\n\";\n\n\t\tstd::cout << \"Node first_level_nodes[] = {\\n\";\n\t\tfor (auto &label : first_level_)\n\t\t\tstd::cout << \"\\t{\\\"\" << label << \"\\\", 0, Rule::kWildcard},\\n\";\n\t\tstd::cout << \"};\\n\\n\";\n\n\t\tstd::cout << \"} \/\/ namespace\\n\";\n\t}\n\n\tvoid Dump(std::ostream &stream) const\n\t{\n\t\tstream << \"\/\/\\n\";\n\t\tfor (const auto &label : first_level_)\n\t\t\tstream << \"\/\/ *.\" << label << \"\\n\";\n\t\tstream << \"\/\/\\n\";\n\t\tfor (const auto &suffix : second_level_)\n\t\t\tsuffix.second.Dump(stream, 0);\n\t\tstream << \"\/\/\\n\";\n\t}\n\nprivate:\n\t\/\/ Main suffix table. Contains all entries with at least two labels\n\t\/\/ such \"co.uk\", \"foo.co.uk\" etc.\n\tstd::unordered_map<std::string, Suffix> second_level_;\n\n\t\/\/ Additional suffix table. Contains only wildcard entries with\n\t\/\/ single specified label such as \"*.ck\"\n\tstd::vector<std::string> first_level_;\n};\n\nint\nmain(int ac, char *av[]) try {\n\tif (ac != 1) {\n\t\tstd::cerr << \"Usage: \" << av[0] << \"<input-file >output-file\\n\";\n\t\treturn EXIT_FAILURE;\n\t}\n\n\tSuffixRoot root;\n\n\tfor (;;) {\n\t\tstd::string line;\n\t\tif (!std::getline(std::cin, line))\n\t\t\tbreak;\n\n\t\t\/\/ Trim everything after the first white space.\n\t\tstd::string data = line.substr(0, line.find_first_of(\" \\t\\r\"));\n\t\t\/\/ Skip empty lines and comments.\n\t\tif (data.empty() || data.front() == '\/')\n\t\t\tcontinue;\n\n\t\t\/\/ Trim a trailing dot if any. From this point onward it is\n\t\t\/\/ safe to access the char just after any found dot as it\n\t\t\/\/ cannot be at the string end.\n\t\tif (data.back() == '.') {\n\t\t\tdata.pop_back();\n\t\t\t\/\/ Two consecutive dots are not allowed. A solitary\n\t\t\t\/\/ dot is not allowed as well.\n\t\t\tif (data.empty() || data.back() == '.')\n\t\t\t\tthrow std::runtime_error(\"Invalid line: \" + line);\n\t\t}\n\n\t\t\/\/ Presume the line contains just a regular host name.\n\t\tRule rule = Rule::kRegular;\n\t\tsize_t skip = 0;\n\n\t\t\/\/ Check for special cases: a wildcard or exception rule.\n\t\tif (data.front() == '!') {\n\t\t\trule = Rule::kException;\n\t\t\tskip = 1;\n\t\t} else if (data.front() == '*') {\n\t\t\trule = Rule::kWildcard;\n\t\t\tfor (++skip; skip < data.size(); skip += 2) {\n\t\t\t\tif (data[skip] != '.')\n\t\t\t\t\tthrow std::runtime_error(\"Invalid line: \" + line);\n\t\t\t\tif (data[skip + 1] != '*')\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Skip a leading dot if any. From this point onward it is safe\n\t\t\/\/ to access the char just before any found dot.\n\t\tif (skip < data.size() && data[skip] == '.') {\n\t\t\t++skip;\n\t\t\t\/\/ Two consecutive dots are not allowed. A solitary\n\t\t\t\/\/ dot is not allowed as well.\n\t\t\tif (skip >= data.size() || data[skip] == '.')\n\t\t\t\tthrow std::runtime_error(\"Invalid line: \" + line);\n\t\t}\n\n\t\t\/\/ Encode a possibly international name.\n\t\tchar *idn_result;\n\t\tif (skip >= data.size())\n\t\t\tthrow std::runtime_error(\"Invalid line: \" + line);\n\t\tif (idna_to_ascii_8z(data.data() + skip, &idn_result, 0) != IDNA_SUCCESS)\n\t\t\tthrow std::runtime_error(\"Invalid line: \" + line);\n\t\tstd::unique_ptr<char, decltype(&std::free)> idn_free(idn_result, &std::free);\n\n\t\t\/\/ Verify that the name contains only valid chars.\n\t\tdata.assign(idn_result);\n\t\tfor (auto c : data) {\n\t\t\tif (!std::isalnum(c) && c != '.' && c != '-')\n\t\t\t\tthrow std::runtime_error(\"Invalid line: \" + line);\n\t\t}\n\n\t\t\/\/ Seek where the rightmost label starts.\n\t\tauto delim = data.find_last_of('.');\n\t\tif (delim == std::string::npos) {\n\t\t\t\/\/ If this is a trivial TLD then don't bother with it.\n\t\t\t\/\/ However remember it if it as a wildcard rule.\n\t\t\tif (rule == Rule::kWildcard)\n\t\t\t\troot.AddSingle(data);\n\t\t} else {\n\t\t\tif (data[delim - 1] == '.')\n\t\t\t\tthrow std::runtime_error(\"Invalid line: \" + line);\n\n\t\t\tdelim = data.find_last_of('.', delim - 1);\n\t\t\tif (delim == std::string::npos)\n\t\t\t\troot.AddDouble(rule, data);\n\t\t\telse\n\t\t\t\troot.AddMultiple(rule, data.substr(delim + 1),\n\t\t\t\t\t\t data.substr(0, delim));\n\t\t}\n\t}\n\n\t\/\/root.Dump(std::cout);\n\troot.BuildMPHF();\n\n\treturn EXIT_SUCCESS;\n} catch (std::exception &e) {\n\tstd::cerr << \"Exception occurred: \" << e.what() << '\\n';\n\treturn EXIT_FAILURE;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2012, Peter Thorson. All 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 WebSocket++ Project nor the\n *       names of its contributors may be used to endorse or promote products\n *       derived from this software without specific prior written permission.\n * \n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" \n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE \n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE \n * ARE DISCLAIMED. IN NO EVENT SHALL PETER THORSON BE LIABLE FOR ANY\n * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n * \n *\/\n\n#include \"..\/..\/src\/websocketpp.hpp\"\n\n#include <cstring>\n#include <set>\n\n#include <boost\/functional.hpp>\n#include <boost\/bind.hpp>\n\nusing websocketpp::server;\n\n\/\/\/ Thread body. Counts up indefinitely, one increment per second. After each\n\/\/\/ it calls the handler back asking it to broadcast the new value. The handler\n\/\/\/ callback returns whether or not the handler would like the telemetry thread\n\/\/\/ to stop. If callback returns true the telemetry loop ands end the thread \n\/\/\/ exits.\nvoid generate_telemetry(boost::function<bool(const std::string&)> callback) {\n    size_t value = 0;\n    \n    for (;;) {        \n        \/\/ do some work\n        value++;\n        \n        \/\/ broadcast state\n        std::stringstream m;\n        m << value;\n        \n        if (callback(m.str())) {\n            break;\n        }\n        \n        \/\/ wait\n        boost::this_thread::sleep(boost::posix_time::milliseconds(1000));\n    }\n}\n\nclass telemetry_server_handler : public server::handler {\npublic:\n    typedef telemetry_server_handler type;\n    typedef boost::shared_ptr<type> ptr;\n    \n    telemetry_server_handler() : m_done(false),m_value(0) {\n        boost::function<void(const std::string&)> callback = boost::bind(&type::on_tick,this,_1);\n        \n        \/\/ start a thread that will generate telemetry independently and call\n        \/\/ this handler back when it has new data to send.\n        m_telemetry_thread.reset(new boost::thread(\n            boost::bind(\n                &generate_telemetry,\n                callback\n            )\n        ));\n    }\n    \n    \/\/ If the handler is going away set done to true and wait for the thread\n    \/\/ to exit.\n    ~telemetry_server_handler() {\n        {\n            boost::lock_guard<boost::mutex> guard(m_mutex);\n            m_done = true;\n        }\n        m_telemetry_thread->join();\n    }\n    \n    \/\/\/ Function that we pass to the telemetry thread to broadcast the new \n    \/\/\/ state. It returns the global \"are we done\" value so we can control when\n    \/\/\/ the thread stops running.\n    bool on_tick(const std::string& msg) {\n        boost::lock_guard<boost::mutex> guard(m_mutex);\n        \n        std::set<connection_ptr>::iterator it;\n        \n        for (it = m_connections.begin(); it != m_connections.end(); it++) {\n            (*it)->send(msg);\n        }\n        \n        return m_done;\n    }\n    \n    \/\/ register a new client\n    void on_open(connection_ptr con) {\n        boost::lock_guard<boost::mutex> guard(m_mutex);\n        m_connections.insert(con);\n    }\n    \n    \/\/ remove an exiting client\n    void on_close(connection_ptr con) {\n        boost::lock_guard<boost::mutex> guard(m_mutex);\n        m_connections.erase(con);\n    }\nprivate:\n    bool                                m_done;\n    size_t                              m_value;\n    std::set<connection_ptr>            m_connections;\n    \n    boost::mutex                        m_mutex;    \/\/ guards m_connections\n    boost::shared_ptr<boost::thread>    m_telemetry_thread;\n};\n\nint main(int argc, char* argv[]) {\n    unsigned short port = 9007;\n        \n    if (argc == 2) {\n        port = atoi(argv[1]);\n        \n        if (port == 0) {\n            std::cout << \"Unable to parse port input \" << argv[1] << std::endl;\n            return 1;\n        }\n    }\n    \n    try {       \n        server::handler::ptr handler(new telemetry_server_handler());\n        server endpoint(handler);\n                \n        endpoint.alog().unset_level(websocketpp::log::alevel::ALL);\n        endpoint.elog().unset_level(websocketpp::log::elevel::ALL);\n        \n        endpoint.alog().set_level(websocketpp::log::alevel::CONNECT);\n        endpoint.alog().set_level(websocketpp::log::alevel::DISCONNECT);\n        \n        endpoint.elog().set_level(websocketpp::log::elevel::RERROR);\n        endpoint.elog().set_level(websocketpp::log::elevel::FATAL);\n        \n        std::cout << \"Starting WebSocket telemetry server on port \" << port << std::endl;\n        endpoint.listen(port);\n    } catch (std::exception& e) {\n        std::cerr << \"Exception: \" << e.what() << std::endl;\n    }\n    \n    return 0;\n}\n<commit_msg>fixes telemetry server bug references #121<commit_after>\/*\n * Copyright (c) 2012, Peter Thorson. All 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 WebSocket++ Project nor the\n *       names of its contributors may be used to endorse or promote products\n *       derived from this software without specific prior written permission.\n * \n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" \n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE \n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE \n * ARE DISCLAIMED. IN NO EVENT SHALL PETER THORSON BE LIABLE FOR ANY\n * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n * \n *\/\n\n#include \"..\/..\/src\/websocketpp.hpp\"\n\n#include <cstring>\n#include <set>\n\n#include <boost\/functional.hpp>\n#include <boost\/bind.hpp>\n\nusing websocketpp::server;\n\n\/\/\/ Thread body. Counts up indefinitely, one increment per second. After each\n\/\/\/ it calls the handler back asking it to broadcast the new value. The handler\n\/\/\/ callback returns whether or not the handler would like the telemetry thread\n\/\/\/ to stop. If callback returns true the telemetry loop ands end the thread \n\/\/\/ exits.\nvoid generate_telemetry(boost::function<bool(const std::string&)> callback) {\n    size_t value = 0;\n    \n    for (;;) {        \n        \/\/ do some work\n        value++;\n        \n        \/\/ broadcast state\n        std::stringstream m;\n        m << value;\n        \n        if (callback(m.str())) {\n            break;\n        }\n        \n        \/\/ wait\n        boost::this_thread::sleep(boost::posix_time::milliseconds(1000));\n    }\n}\n\nclass telemetry_server_handler : public server::handler {\npublic:\n    typedef telemetry_server_handler type;\n    typedef boost::shared_ptr<type> ptr;\n    \n    telemetry_server_handler() : m_done(false),m_value(0) {\n        boost::function<bool(const std::string&)> callback = boost::bind(&type::on_tick,this,_1);\n        \n        \/\/ start a thread that will generate telemetry independently and call\n        \/\/ this handler back when it has new data to send.\n        m_telemetry_thread.reset(new boost::thread(\n            boost::bind(\n                &generate_telemetry,\n                callback\n            )\n        ));\n    }\n    \n    \/\/ If the handler is going away set done to true and wait for the thread\n    \/\/ to exit.\n    ~telemetry_server_handler() {\n        {\n            boost::lock_guard<boost::mutex> guard(m_mutex);\n            m_done = true;\n        }\n        m_telemetry_thread->join();\n    }\n    \n    \/\/\/ Function that we pass to the telemetry thread to broadcast the new \n    \/\/\/ state. It returns the global \"are we done\" value so we can control when\n    \/\/\/ the thread stops running.\n    bool on_tick(const std::string& msg) {\n        boost::lock_guard<boost::mutex> guard(m_mutex);\n        \n        std::set<connection_ptr>::iterator it;\n        \n        for (it = m_connections.begin(); it != m_connections.end(); it++) {\n            (*it)->send(msg);\n        }\n        \n        return m_done;\n    }\n    \n    \/\/ register a new client\n    void on_open(connection_ptr con) {\n        boost::lock_guard<boost::mutex> guard(m_mutex);\n        m_connections.insert(con);\n    }\n    \n    \/\/ remove an exiting client\n    void on_close(connection_ptr con) {\n        boost::lock_guard<boost::mutex> guard(m_mutex);\n        m_connections.erase(con);\n    }\nprivate:\n    bool                                m_done;\n    size_t                              m_value;\n    std::set<connection_ptr>            m_connections;\n    \n    boost::mutex                        m_mutex;    \/\/ guards m_connections\n    boost::shared_ptr<boost::thread>    m_telemetry_thread;\n};\n\nint main(int argc, char* argv[]) {\n    unsigned short port = 9007;\n        \n    if (argc == 2) {\n        port = atoi(argv[1]);\n        \n        if (port == 0) {\n            std::cout << \"Unable to parse port input \" << argv[1] << std::endl;\n            return 1;\n        }\n    }\n    \n    try {       \n        server::handler::ptr handler(new telemetry_server_handler());\n        server endpoint(handler);\n                \n        endpoint.alog().unset_level(websocketpp::log::alevel::ALL);\n        endpoint.elog().unset_level(websocketpp::log::elevel::ALL);\n        \n        endpoint.alog().set_level(websocketpp::log::alevel::CONNECT);\n        endpoint.alog().set_level(websocketpp::log::alevel::DISCONNECT);\n        \n        endpoint.elog().set_level(websocketpp::log::elevel::RERROR);\n        endpoint.elog().set_level(websocketpp::log::elevel::FATAL);\n        \n        std::cout << \"Starting WebSocket telemetry server on port \" << port << std::endl;\n        endpoint.listen(port);\n    } catch (std::exception& e) {\n        std::cerr << \"Exception: \" << e.what() << std::endl;\n    }\n    \n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the Qt Mobility Components.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the Technology Preview License Agreement accompanying\n** this package.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain additional\n** rights.  These rights are described in the Nokia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at qt-info@nokia.com.\n**\n**\n**\n**\n**\n**\n**\n**\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"addressfinder.h\"\n#include <qmessageaddress.h>\n#include <QComboBox>\n#include <QDateTime>\n#include <QGroupBox>\n#include <QLabel>\n#include <QLayout>\n#include <QListWidget>\n#include <QPushButton>\n#include <QTimer>\n#include <QDebug>\n#include <QApplication>\n#include <QMenuBar>\n#include <QTabWidget>\n\nAddressFinder::AddressFinder(QWidget *parent, Qt::WindowFlags flags)\n    : QMainWindow(parent, flags),\n      tabWidget(0),\n      includePeriod(0),\n      excludePeriod(0),\n      searchAction(0),\n      searchButton(0),\n      addressList(0),\n      messageCombo(0)\n {\n    setupUi();\n\n    connect(&service, SIGNAL(stateChanged(QMessageServiceAction::State)), this, SLOT(stateChanged(QMessageServiceAction::State)));\n    connect(&service, SIGNAL(messagesFound(QMessageIdList)), this, SLOT(messagesFound(QMessageIdList)));\n}\n\nAddressFinder::~AddressFinder()\n{\n}\n\nvoid AddressFinder::includePeriodChanged(int selected)\n{\n    \/\/ Only allow smaller periods to be excluded\n    excludePeriod->clear();\n\n    switch (selected) {\n        case 0: excludePeriod->insertItem(0, \"9 Months\"); \/\/ fall through:\n        case 1: excludePeriod->insertItem(0, \"6 Months\");\n        case 2: excludePeriod->insertItem(0, \"3 Months\");\n        case 3: excludePeriod->insertItem(0, \"Month\");\n        case 4: excludePeriod->insertItem(0, \"Week\");\n        case 5: excludePeriod->insertItem(0, \"Second\");\n        default: break;\n    }\n\n    excludePeriod->setCurrentIndex(0);\n}\n\nvoid AddressFinder::addressSelected(const QString &address)\n{\n    QString name;\n    QString addressOnly;\n    QMessageAddress::parseEmailAddress(address, &name, &addressOnly);\n    messageCombo->clear();\n\n    foreach (const QString &message, addressMessages[addressOnly]) {\n        messageCombo->addItem(message);\n    }\n}\n\nvoid AddressFinder::searchMessages()\n{\n    setSearchActionEnabled(false);\n\n    addressList->clear();\n    messageCombo->clear();\n    excludedAddresses.clear();\n    includedAddresses.clear();\n    addressMessages.clear();\n\n    QDateTime now(QDateTime::currentDateTime());\n\n    QDateTime minimumDate(now);\n    switch (includePeriod->currentIndex()) {\n        case 0: minimumDate = minimumDate.addMonths(-12); break;\n        case 1: minimumDate = minimumDate.addMonths(-9); break;\n        case 2: minimumDate = minimumDate.addMonths(-6); break;\n        case 3: minimumDate = minimumDate.addMonths(-3); break;\n        case 4: minimumDate = minimumDate.addMonths(-1); break;\n        case 5: minimumDate = minimumDate.addDays(-7); break;\n        default: break;\n    }\n\n    QDateTime maximumDate(now);\n    switch (excludePeriod->currentIndex()) {\n        case 0: maximumDate = maximumDate.addSecs(-1); break;\n        case 1: maximumDate = maximumDate.addDays(-7); break;\n        case 2: maximumDate = maximumDate.addMonths(-1); break;\n        case 3: maximumDate = maximumDate.addMonths(-3); break;\n        case 4: maximumDate = maximumDate.addMonths(-6); break;\n        case 5: maximumDate = maximumDate.addMonths(-9); break;\n        default: break;\n    }\n\n    QMessageFilter includeFilter(QMessageFilter::byTimeStamp(minimumDate, QMessageDataComparator::GreaterThanEqual));\n    QMessageFilter excludeFilter(QMessageFilter::byTimeStamp(maximumDate, QMessageDataComparator::GreaterThanEqual));\n    QMessageFilter sentFilter(QMessageFilter::byStandardFolder(QMessage::SentFolder));\n\n    \/\/ Search for messages containing addresses to exclude\n    service.queryMessages(sentFilter & excludeFilter);\n\n    \/\/ Create the filter needed to locate messages to search for addresses\n    inclusionFilter = (sentFilter & includeFilter & ~excludeFilter);\n}\n\nvoid AddressFinder::stateChanged(QMessageServiceAction::State s)\n{\n    if (s == QMessageServiceAction::Successful) {\n        if (!inclusionFilter.isEmpty()) {\n            \/\/ Now find the included messages\n            service.queryMessages(inclusionFilter);\n            inclusionFilter = QMessageFilter();\n        } else {\n            \/\/ We have found the message sets to process\n            if (!inclusionMessages.isEmpty()) {\n                QTimer::singleShot(0, this, SLOT(continueSearch()));\n            } else {\n                searchAction->setEnabled(true);\n                searchButton->setEnabled(true);\n            }\n        }\n    } else if (s == QMessageServiceAction::Failed) {\n        qWarning() << \"Search failed!\";\n        setSearchActionEnabled(true);\n    }\n}\n\nvoid AddressFinder::messagesFound(const QMessageIdList &ids)\n{\n    if (!inclusionFilter.isEmpty()) {\n        exclusionMessages << ids;\n    } else {\n        inclusionMessages << ids;\n    }\n}\n\nvoid AddressFinder::continueSearch()\n{\n    QString name;\n    QString addressOnly;\n    if (!exclusionMessages.isEmpty()) {\n        QMessageId id(exclusionMessages.takeFirst());\n        const QMessage message(id);\n\n        \/\/ All recipient addresses are to be excluded\n        foreach (const QMessageAddress &address, message.to() + message.cc() + message.bcc()) {\n            QMessageAddress::parseEmailAddress(address.recipient(), &name, &addressOnly);\n            if (!excludedAddresses.contains(addressOnly))\n                qDebug() << \"Exclude\" << addressOnly;\n            excludedAddresses.insert(addressOnly);\n        }\n    } else if (!inclusionMessages.isEmpty()) {\n        QMessageId id(inclusionMessages.takeFirst());\n        const QMessage message(id);\n\n        \/\/ Determine the properties of the message\n        QString details(QString(\"[%1] %2\").arg(message.date().toString(\"MMM d\")).arg(message.subject()));\n\n        foreach (const QMessageAddress &address, message.to() + message.cc() + message.bcc()) {\n            QString recipient(address.recipient());\n            QMessageAddress::parseEmailAddress(address.recipient(), &name, &addressOnly);\n            if (!includedAddresses.contains(addressOnly))\n                qDebug() << \"Include\" << addressOnly;\n            includedAddresses.insert(addressOnly);\n            if (!excludedAddresses.contains(addressOnly)) {\n                \/\/ Link this message to this address\n                qDebug() << \"Exclude\" << addressOnly;\n                QStringList &messages = addressMessages[addressOnly];\n                if (messages.isEmpty()) {\n                    addressList->addItem(recipient);\n                }\n                messages.append(details);\n            }\n        }\n    }\n\n    if (!exclusionMessages.isEmpty() || !inclusionMessages.isEmpty()) {\n        QTimer::singleShot(0, this, SLOT(continueSearch()));\n    } else {\n        setSearchActionEnabled(true);\n#ifdef _WIN32_WCE\n        tabChanged(1);\n#endif\n        if (addressList->currentItem())\n            addressSelected(addressList->currentItem()->text());\n    }\n}\n\n#ifdef _WIN32_WCE\nvoid AddressFinder::tabChanged(int index)\n{\n    QWidget* currentTab = tabWidget->currentWidget();\n    QAction* action = 0;\n    if(currentTab && !currentTab->actions().isEmpty())\n        action = currentTab->actions().first();\n    menuBar()->setDefaultAction(action);\n}\n#endif\n\nvoid AddressFinder::setupUi()\n{\n    setWindowTitle(tr(\"Keep In Touch\"));\n\n#ifdef _WIN32_WCE\n    tabWidget = new QTabWidget(this);\n    setCentralWidget(tabWidget);\n    connect(tabWidget,SIGNAL(currentChanged(int)),this,SLOT(tabChanged(int)));\n#else\n    QWidget* centralWidget = new QWidget(this);\n    setCentralWidget(centralWidget);\n    QVBoxLayout* centralLayout = new QVBoxLayout(centralWidget);\n#endif\n\n    QGroupBox *inputGroup = new QGroupBox(tr(\"Find addresses\"));\n    inputGroup->setAlignment(Qt::AlignLeft);\n#ifdef _WIN32_WCE\n    tabWidget->addTab(inputGroup,\"Search\");\n#else\n    centralLayout->addWidget(inputGroup);\n#endif\n\n    QGridLayout *filterLayout = new QGridLayout(inputGroup);\n\n    QLabel *includeLabel = new QLabel(tr(\"Contacted this\"));\n    filterLayout->addWidget(includeLabel, 0, 0);\n    filterLayout->setAlignment(includeLabel, Qt::AlignRight);\n\n    QLabel *excludeLabel = new QLabel(tr(\"But not last\"));\n    filterLayout->addWidget(excludeLabel, 1, 0);\n    filterLayout->setAlignment(excludeLabel, Qt::AlignRight);\n\n    includePeriod = new QComboBox;\n    filterLayout->addWidget(includePeriod, 0, 1);\n    includePeriod ->setSizePolicy(QSizePolicy::Fixed, QSizePolicy::Fixed);\n    includePeriod->addItem(tr(\"Year\"));\n    includePeriod->addItem(tr(\"9 Months\"));\n    includePeriod->addItem(tr(\"6 Months\"));\n    includePeriod->addItem(tr(\"3 Months\"));\n    includePeriod->addItem(tr(\"Month\"));\n    includePeriod->addItem(tr(\"Week\"));\n    connect(includePeriod, SIGNAL(currentIndexChanged(int)), this, SLOT(includePeriodChanged(int)));\n\n    excludePeriod = new QComboBox;\n    excludePeriod ->setSizePolicy(QSizePolicy::Fixed, QSizePolicy::Fixed);\n    filterLayout->addWidget(excludePeriod, 1, 1);\n\n#ifndef _WIN32_WCE\n    searchButton = new QPushButton(tr(\"Search\"));\n    searchButton->setSizePolicy(QSizePolicy::Fixed, QSizePolicy::Fixed);\n    filterLayout->addWidget(searchButton,0,2,2,1,Qt::AlignVCenter | Qt::AlignHCenter);\n    connect(searchButton, SIGNAL(clicked()), this, SLOT(searchMessages()), Qt::QueuedConnection);\n#endif\n\n    addressList = new QListWidget(this);\n    connect(addressList, SIGNAL(currentTextChanged(QString)), this, SLOT(addressSelected(QString)));\n\n#ifdef _WIN32_WCE\n    QWidget* resultsWidget = new QWidget(this);\n    QVBoxLayout* resultsLayout = new QVBoxLayout(resultsWidget);\n    tabWidget->addTab(resultsWidget,\"Results\");\n#else\n    QVBoxLayout* resultsLayout = centralLayout;\n#endif\n\n    QGroupBox *addressGroup = new QGroupBox(tr(\"Address\"));\n    addressGroup->setAlignment(Qt::AlignLeft);\n    addressGroup->setLayout(new QVBoxLayout);\n    addressGroup->layout()->addWidget(addressList);\n    resultsLayout->addWidget(addressGroup);\n\n    QGroupBox *messageGroup = new QGroupBox(tr(\"Messages\"));\n    messageGroup->setAlignment(Qt::AlignLeft);\n    messageGroup->setLayout(new QHBoxLayout);\n    resultsLayout->addWidget(messageGroup);\n\n    messageCombo = new QComboBox;\n    messageGroup->layout()->addWidget(messageCombo);\n\n    searchAction = new QAction(\"Search\",this);\n    inputGroup->addAction(searchAction);\n    connect(searchAction,SIGNAL(triggered()),this,SLOT(searchMessages()),Qt::QueuedConnection);\n    QAction* quitAction = menuBar()->addAction(\"Quit\");\n    connect(quitAction,SIGNAL(triggered()),qApp,SLOT(quit()));\n\n    includePeriodChanged(0);\n#ifdef _WIN32_WCE\n    tabChanged(0);\n#endif\n}\n\nvoid AddressFinder::setSearchActionEnabled(bool val)\n{\n    searchAction->setEnabled(val);\n#ifndef _WIN32_WCE\n    searchButton->setEnabled(val);\n#endif\n}\n<commit_msg>Fix a bug with keepintouch crashing when no results where found,  crash when 0 ptr searchButton was dereferenced.<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 \"addressfinder.h\"\n#include <qmessageaddress.h>\n#include <QComboBox>\n#include <QDateTime>\n#include <QGroupBox>\n#include <QLabel>\n#include <QLayout>\n#include <QListWidget>\n#include <QPushButton>\n#include <QTimer>\n#include <QDebug>\n#include <QApplication>\n#include <QMenuBar>\n#include <QTabWidget>\n\nAddressFinder::AddressFinder(QWidget *parent, Qt::WindowFlags flags)\n    : QMainWindow(parent, flags),\n      tabWidget(0),\n      includePeriod(0),\n      excludePeriod(0),\n      searchAction(0),\n      searchButton(0),\n      addressList(0),\n      messageCombo(0)\n {\n    setupUi();\n\n    connect(&service, SIGNAL(stateChanged(QMessageServiceAction::State)), this, SLOT(stateChanged(QMessageServiceAction::State)));\n    connect(&service, SIGNAL(messagesFound(QMessageIdList)), this, SLOT(messagesFound(QMessageIdList)));\n}\n\nAddressFinder::~AddressFinder()\n{\n}\n\nvoid AddressFinder::includePeriodChanged(int selected)\n{\n    \/\/ Only allow smaller periods to be excluded\n    excludePeriod->clear();\n\n    switch (selected) {\n        case 0: excludePeriod->insertItem(0, \"9 Months\"); \/\/ fall through:\n        case 1: excludePeriod->insertItem(0, \"6 Months\");\n        case 2: excludePeriod->insertItem(0, \"3 Months\");\n        case 3: excludePeriod->insertItem(0, \"Month\");\n        case 4: excludePeriod->insertItem(0, \"Week\");\n        case 5: excludePeriod->insertItem(0, \"Second\");\n        default: break;\n    }\n\n    excludePeriod->setCurrentIndex(0);\n}\n\nvoid AddressFinder::addressSelected(const QString &address)\n{\n    QString name;\n    QString addressOnly;\n    QMessageAddress::parseEmailAddress(address, &name, &addressOnly);\n    messageCombo->clear();\n\n    foreach (const QString &message, addressMessages[addressOnly]) {\n        messageCombo->addItem(message);\n    }\n}\n\nvoid AddressFinder::searchMessages()\n{\n    setSearchActionEnabled(false);\n\n    addressList->clear();\n    messageCombo->clear();\n    excludedAddresses.clear();\n    includedAddresses.clear();\n    addressMessages.clear();\n\n    QDateTime now(QDateTime::currentDateTime());\n\n    QDateTime minimumDate(now);\n    switch (includePeriod->currentIndex()) {\n        case 0: minimumDate = minimumDate.addMonths(-12); break;\n        case 1: minimumDate = minimumDate.addMonths(-9); break;\n        case 2: minimumDate = minimumDate.addMonths(-6); break;\n        case 3: minimumDate = minimumDate.addMonths(-3); break;\n        case 4: minimumDate = minimumDate.addMonths(-1); break;\n        case 5: minimumDate = minimumDate.addDays(-7); break;\n        default: break;\n    }\n\n    QDateTime maximumDate(now);\n    switch (excludePeriod->currentIndex()) {\n        case 0: maximumDate = maximumDate.addSecs(-1); break;\n        case 1: maximumDate = maximumDate.addDays(-7); break;\n        case 2: maximumDate = maximumDate.addMonths(-1); break;\n        case 3: maximumDate = maximumDate.addMonths(-3); break;\n        case 4: maximumDate = maximumDate.addMonths(-6); break;\n        case 5: maximumDate = maximumDate.addMonths(-9); break;\n        default: break;\n    }\n\n    QMessageFilter includeFilter(QMessageFilter::byTimeStamp(minimumDate, QMessageDataComparator::GreaterThanEqual));\n    QMessageFilter excludeFilter(QMessageFilter::byTimeStamp(maximumDate, QMessageDataComparator::GreaterThanEqual));\n    QMessageFilter sentFilter(QMessageFilter::byStandardFolder(QMessage::SentFolder));\n\n    \/\/ Search for messages containing addresses to exclude\n    service.queryMessages(sentFilter & excludeFilter);\n\n    \/\/ Create the filter needed to locate messages to search for addresses\n    inclusionFilter = (sentFilter & includeFilter & ~excludeFilter);\n}\n\nvoid AddressFinder::stateChanged(QMessageServiceAction::State s)\n{\n    if (s == QMessageServiceAction::Successful) {\n        if (!inclusionFilter.isEmpty()) {\n            \/\/ Now find the included messages\n            service.queryMessages(inclusionFilter);\n            inclusionFilter = QMessageFilter();\n        } else {\n            \/\/ We have found the message sets to process\n            if (!inclusionMessages.isEmpty()) {\n                QTimer::singleShot(0, this, SLOT(continueSearch()));\n            } else {\n                searchAction->setEnabled(true);\n#ifndef _WIN32_WCE\n                searchButton->setEnabled(true);\n#endif\n            }\n        }\n    } else if (s == QMessageServiceAction::Failed) {\n        qWarning() << \"Search failed!\";\n        setSearchActionEnabled(true);\n    }\n}\n\nvoid AddressFinder::messagesFound(const QMessageIdList &ids)\n{\n    if (!inclusionFilter.isEmpty()) {\n        exclusionMessages << ids;\n    } else {\n        inclusionMessages << ids;\n    }\n}\n\nvoid AddressFinder::continueSearch()\n{\n    QString name;\n    QString addressOnly;\n    if (!exclusionMessages.isEmpty()) {\n        QMessageId id(exclusionMessages.takeFirst());\n        const QMessage message(id);\n\n        \/\/ All recipient addresses are to be excluded\n        foreach (const QMessageAddress &address, message.to() + message.cc() + message.bcc()) {\n            QMessageAddress::parseEmailAddress(address.recipient(), &name, &addressOnly);\n            if (!excludedAddresses.contains(addressOnly))\n                qDebug() << \"Exclude\" << addressOnly;\n            excludedAddresses.insert(addressOnly);\n        }\n    } else if (!inclusionMessages.isEmpty()) {\n        QMessageId id(inclusionMessages.takeFirst());\n        const QMessage message(id);\n\n        \/\/ Determine the properties of the message\n        QString details(QString(\"[%1] %2\").arg(message.date().toString(\"MMM d\")).arg(message.subject()));\n\n        foreach (const QMessageAddress &address, message.to() + message.cc() + message.bcc()) {\n            QString recipient(address.recipient());\n            QMessageAddress::parseEmailAddress(address.recipient(), &name, &addressOnly);\n            if (!includedAddresses.contains(addressOnly))\n                qDebug() << \"Include\" << addressOnly;\n            includedAddresses.insert(addressOnly);\n            if (!excludedAddresses.contains(addressOnly)) {\n                \/\/ Link this message to this address\n                qDebug() << \"Exclude\" << addressOnly;\n                QStringList &messages = addressMessages[addressOnly];\n                if (messages.isEmpty()) {\n                    addressList->addItem(recipient);\n                }\n                messages.append(details);\n            }\n        }\n    }\n\n    if (!exclusionMessages.isEmpty() || !inclusionMessages.isEmpty()) {\n        QTimer::singleShot(0, this, SLOT(continueSearch()));\n    } else {\n        setSearchActionEnabled(true);\n#ifdef _WIN32_WCE\n        tabChanged(1);\n#endif\n        if (addressList->currentItem())\n            addressSelected(addressList->currentItem()->text());\n    }\n}\n\n#ifdef _WIN32_WCE\nvoid AddressFinder::tabChanged(int index)\n{\n    QWidget* currentTab = tabWidget->currentWidget();\n    QAction* action = 0;\n    if(currentTab && !currentTab->actions().isEmpty())\n        action = currentTab->actions().first();\n    menuBar()->setDefaultAction(action);\n}\n#endif\n\nvoid AddressFinder::setupUi()\n{\n    setWindowTitle(tr(\"Keep In Touch\"));\n\n#ifdef _WIN32_WCE\n    tabWidget = new QTabWidget(this);\n    setCentralWidget(tabWidget);\n    connect(tabWidget,SIGNAL(currentChanged(int)),this,SLOT(tabChanged(int)));\n#else\n    QWidget* centralWidget = new QWidget(this);\n    setCentralWidget(centralWidget);\n    QVBoxLayout* centralLayout = new QVBoxLayout(centralWidget);\n#endif\n\n    QGroupBox *inputGroup = new QGroupBox(tr(\"Find addresses\"));\n    inputGroup->setAlignment(Qt::AlignLeft);\n#ifdef _WIN32_WCE\n    tabWidget->addTab(inputGroup,\"Search\");\n#else\n    centralLayout->addWidget(inputGroup);\n#endif\n\n    QGridLayout *filterLayout = new QGridLayout(inputGroup);\n\n    QLabel *includeLabel = new QLabel(tr(\"Contacted this\"));\n    filterLayout->addWidget(includeLabel, 0, 0);\n    filterLayout->setAlignment(includeLabel, Qt::AlignRight);\n\n    QLabel *excludeLabel = new QLabel(tr(\"But not last\"));\n    filterLayout->addWidget(excludeLabel, 1, 0);\n    filterLayout->setAlignment(excludeLabel, Qt::AlignRight);\n\n    includePeriod = new QComboBox;\n    filterLayout->addWidget(includePeriod, 0, 1);\n    includePeriod ->setSizePolicy(QSizePolicy::Fixed, QSizePolicy::Fixed);\n    includePeriod->addItem(tr(\"Year\"));\n    includePeriod->addItem(tr(\"9 Months\"));\n    includePeriod->addItem(tr(\"6 Months\"));\n    includePeriod->addItem(tr(\"3 Months\"));\n    includePeriod->addItem(tr(\"Month\"));\n    includePeriod->addItem(tr(\"Week\"));\n    connect(includePeriod, SIGNAL(currentIndexChanged(int)), this, SLOT(includePeriodChanged(int)));\n\n    excludePeriod = new QComboBox;\n    excludePeriod ->setSizePolicy(QSizePolicy::Fixed, QSizePolicy::Fixed);\n    filterLayout->addWidget(excludePeriod, 1, 1);\n\n#ifndef _WIN32_WCE\n    searchButton = new QPushButton(tr(\"Search\"));\n    searchButton->setSizePolicy(QSizePolicy::Fixed, QSizePolicy::Fixed);\n    filterLayout->addWidget(searchButton,0,2,2,1,Qt::AlignVCenter | Qt::AlignHCenter);\n    connect(searchButton, SIGNAL(clicked()), this, SLOT(searchMessages()), Qt::QueuedConnection);\n#endif\n\n    addressList = new QListWidget(this);\n    connect(addressList, SIGNAL(currentTextChanged(QString)), this, SLOT(addressSelected(QString)));\n\n#ifdef _WIN32_WCE\n    QWidget* resultsWidget = new QWidget(this);\n    QVBoxLayout* resultsLayout = new QVBoxLayout(resultsWidget);\n    tabWidget->addTab(resultsWidget,\"Results\");\n#else\n    QVBoxLayout* resultsLayout = centralLayout;\n#endif\n\n    QGroupBox *addressGroup = new QGroupBox(tr(\"Address\"));\n    addressGroup->setAlignment(Qt::AlignLeft);\n    addressGroup->setLayout(new QVBoxLayout);\n    addressGroup->layout()->addWidget(addressList);\n    resultsLayout->addWidget(addressGroup);\n\n    QGroupBox *messageGroup = new QGroupBox(tr(\"Messages\"));\n    messageGroup->setAlignment(Qt::AlignLeft);\n    messageGroup->setLayout(new QHBoxLayout);\n    resultsLayout->addWidget(messageGroup);\n\n    messageCombo = new QComboBox;\n    messageGroup->layout()->addWidget(messageCombo);\n\n    searchAction = new QAction(\"Search\",this);\n    inputGroup->addAction(searchAction);\n    connect(searchAction,SIGNAL(triggered()),this,SLOT(searchMessages()),Qt::QueuedConnection);\n    QAction* quitAction = menuBar()->addAction(\"Quit\");\n    connect(quitAction,SIGNAL(triggered()),qApp,SLOT(quit()));\n\n    includePeriodChanged(0);\n#ifdef _WIN32_WCE\n    tabChanged(0);\n#endif\n}\n\nvoid AddressFinder::setSearchActionEnabled(bool val)\n{\n    searchAction->setEnabled(val);\n#ifndef _WIN32_WCE\n    searchButton->setEnabled(val);\n#endif\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        \/\/ 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<commit_msg>Avoid conflict with Spark internal debug flag<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\nstatic const bool 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>\/*\n** Copyright 2014 Merethis\n**\n** This file is part of Centreon Broker.\n**\n** Centreon Broker is free software: you can redistribute it and\/or\n** modify it under the terms of the GNU General Public License version 2\n** as published by the Free Software Foundation.\n**\n** Centreon Broker is distributed in the hope that it will be useful,\n** but WITHOUT ANY WARRANTY; without even the implied warranty of\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n** General Public License for more details.\n**\n** You should have received a copy of the GNU General Public License\n** along with Centreon Broker. If not, see\n** <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <cstdio>\n#include <cstdlib>\n#include <iostream>\n#include <QFile>\n#include \"com\/centreon\/broker\/exceptions\/msg.hh\"\n#include \"test\/config.hh\"\n#include \"test\/engine.hh\"\n#include \"test\/external_command.hh\"\n#include \"test\/generate.hh\"\n#include \"test\/misc.hh\"\n#include \"test\/vars.hh\"\n\nusing namespace com::centreon::broker;\n\n#define DB_NAME \"broker_notification_non_correlated\"\n\n\/**\n *  Check that notification is properly enabled when non-correlation\n *  option is set on services.\n *\n *  @return EXIT_SUCCESS on success.\n *\/\nint main() {\n  \/\/ Error flag.\n  bool error(true);\n\n  \/\/ Variables that need cleaning.\n  std::list<host> hosts;\n  std::list<service> services;\n  std::string engine_config_path(tmpnam(NULL));\n  std::string flag_file(tmpnam(NULL));\n  std::string node_cache_file(tmpnam(NULL));\n  external_command commander;\n  engine monitoring;\n  test_file broker_cfg;\n  test_db db;\n\n  try {\n    \/\/ Log some info.\n    std::cout << \"flag file: \" << flag_file << \"\\n\";\n    std::cout << \"node cache: \" << node_cache_file << \"\\n\";\n\n    \/\/ Prepare database.\n    db.open(NULL, NULL, DB_NAME);\n\n    \/\/ Prepare monitoring engine configuration parameters.\n    generate_hosts(hosts, 1);\n    generate_services(services, hosts, 2);\n    for (std::list<service>::iterator\n           it(services.begin()),\n           end(services.end());\n         it != end;\n         ++it) {\n      it->checks_enabled = 0;\n      it->accept_passive_service_checks = 1;\n      it->max_attempts = 1;\n    }\n    set_custom_variable(\n      services.back(),\n      \"FLAGFILE\",\n      flag_file.c_str());\n\n    \/\/ Populate database.\n    db.centreon_run(\n         \"INSERT INTO cfg_hosts (host_id, host_name)\"\n         \"  VALUES (1, 'Host1')\",\n         \"could not create host\");\n    db.centreon_run(\n         \"INSERT INTO cfg_services (service_id,\"\n         \"            service_description,\"\n         \"            service_notification_options)\"\n         \"  VALUES (1, 'Service1', 'ywcu'), (2, 'Service2', 'ywcu')\",\n         \"could not create services\");\n    db.centreon_run(\n         \"INSERT INTO cfg_hosts_services_relations (host_host_id,\"\n         \"            service_service_id)\"\n         \"  VALUES (1, 1), (1, 2)\",\n         \"could not link host and services\");\n\n    \/\/ Create contact in DB.\n    db.centreon_run(\n         \"INSERT INTO cfg_contacts (contact_id, contact_name)\"\n         \"  VALUES (1, 'Contact1')\",\n         \"could not create contact\");\n    db.centreon_run(\n         \"INSERT INTO cfg_contacts_services_relations (contact_id,\"\n         \"            service_service_id)\"\n         \"  VALUES (1, 1), (1, 2)\",\n         \"could not link services and contact\");\n\n    \/\/ Create notification command in DB.\n    db.centreon_run(\n         \"INSERT INTO cfg_commands (command_id, command_name,\"\n         \"            command_line)\"\n         \"  VALUES (1, 'NotificationCommand1', 'cmake -E touch $_SERVICEFLAGFILE$')\",\n         \"could not create notification command\");\n\n    \/\/ Create notification rules in DB.\n    db.centreon_run(\n         \"INSERT INTO cfg_notification_methods (method_id,\"\n         \"            name, command_id, `interval`, status, types)\"\n         \"  VALUES (1, 'NotificationMethod', 1, 300, 'w,c,u', 'n')\",\n         \"could not create notification method\");\n    db.centreon_run(\n         \"INSERT INTO cfg_notification_rules (rule_id, method_id, \"\n         \"            timeperiod_id, owner_id, contact_id, host_id,\"\n         \"            service_id, enabled)\"\n         \"  VALUES (1, 1, NULL, 1, 1, 1, 2, 1)\",\n         \"could not create notification rule (cfg)\");\n    db.centreon_run(\n         \"INSERT INTO rt_notification_rules (rule_id, method_id,\"\n         \"            timeperiod_id, contact_id, host_id,\"\n         \"            service_id)\"\n         \"  VALUES (1, 1, NULL, 1, 1, 2)\",\n         \"could not create notification rule (rt)\");\n\n    \/\/ Generate configuration.\n    broker_cfg.set_template(\n      PROJECT_SOURCE_DIR \"\/test\/cfg\/notification_non_correlated.xml.in\");\n    broker_cfg.set(\"NODE_CACHE_FILE\", node_cache_file);\n    commander.set_file(tmpnam(NULL));\n    std::string additional_config;\n    {\n      std::ostringstream oss;\n      oss << commander.get_engine_config()\n          << \"broker_module=\" << CBMOD_PATH << \" \"\n          << broker_cfg.generate() << \"\\n\";\n      additional_config = oss.str();\n    }\n    config_write(\n      engine_config_path.c_str(),\n      additional_config.c_str(),\n      &hosts,\n      &services);\n\n    \/\/ Start monitoring.\n    std::string engine_config_file(engine_config_path);\n    engine_config_file.append(\"\/nagios.cfg\");\n    monitoring.set_config_file(engine_config_file);\n    monitoring.start();\n    sleep_for(3 * MONITORING_ENGINE_INTERVAL_LENGTH);\n    commander.execute(\n      \"PROCESS_SERVICE_CHECK_RESULT;1;1;0;Submitted by unit test\");\n    commander.execute(\n      \"PROCESS_SERVICE_CHECK_RESULT;1;2;0;Submitted by unit test\");\n    sleep_for(5 * MONITORING_ENGINE_INTERVAL_LENGTH);\n\n    \/\/ Make services CRITICAL.\n    commander.execute(\n      \"PROCESS_SERVICE_CHECK_RESULT;1;1;2;Submitted by unit test\");\n    commander.execute(\n      \"PROCESS_SERVICE_CHECK_RESULT;1;2;2;Submitted by unit test\");\n    sleep_for(25 * MONITORING_ENGINE_INTERVAL_LENGTH);\n\n    \/\/ Check file creation.\n    error = !QFile::exists(flag_file.c_str());\n  }\n  catch (std::exception const& e) {\n    std::cerr << e.what() << std::endl;\n  }\n  catch (...) {\n    std::cerr << \"unknown exception\" << std::endl;\n  }\n\n  \/\/ Cleanup.\n  monitoring.stop();\n  sleep_for(3 * MONITORING_ENGINE_INTERVAL_LENGTH);\n  ::remove(flag_file.c_str());\n  ::remove(node_cache_file.c_str());\n  config_remove(engine_config_path.c_str());\n  free_hosts(hosts);\n  free_services(services);\n\n  return (error ? EXIT_FAILURE : EXIT_SUCCESS);\n}\n<commit_msg>Notification: Working non correlated notification unit test.<commit_after>\/*\n** Copyright 2014 Merethis\n**\n** This file is part of Centreon Broker.\n**\n** Centreon Broker is free software: you can redistribute it and\/or\n** modify it under the terms of the GNU General Public License version 2\n** as published by the Free Software Foundation.\n**\n** Centreon Broker is distributed in the hope that it will be useful,\n** but WITHOUT ANY WARRANTY; without even the implied warranty of\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n** General Public License for more details.\n**\n** You should have received a copy of the GNU General Public License\n** along with Centreon Broker. If not, see\n** <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <cstdio>\n#include <cstdlib>\n#include <iostream>\n#include <QFile>\n#include \"com\/centreon\/broker\/exceptions\/msg.hh\"\n#include \"test\/config.hh\"\n#include \"test\/engine.hh\"\n#include \"test\/external_command.hh\"\n#include \"test\/generate.hh\"\n#include \"test\/misc.hh\"\n#include \"test\/vars.hh\"\n\nusing namespace com::centreon::broker;\n\n#define DB_NAME \"broker_notification_non_correlated\"\n\n\/**\n *  Check that notification is properly enabled when non-correlation\n *  option is set on services.\n *\n *  @return EXIT_SUCCESS on success.\n *\/\nint main() {\n  \/\/ Error flag.\n  bool error(true);\n\n  \/\/ Variables that need cleaning.\n  std::list<host> hosts;\n  std::list<service> services;\n  std::string engine_config_path(tmpnam(NULL));\n  std::string flag_file(tmpnam(NULL));\n  std::string node_cache_file(tmpnam(NULL));\n  external_command commander;\n  engine monitoring;\n  test_file broker_cfg;\n  test_db db;\n\n  try {\n    \/\/ Log some info.\n    std::cout << \"flag file: \" << flag_file << \"\\n\";\n    std::cout << \"node cache: \" << node_cache_file << \"\\n\";\n\n    \/\/ Prepare database.\n    db.open(NULL, NULL, DB_NAME);\n\n    \/\/ Prepare monitoring engine configuration parameters.\n    generate_hosts(hosts, 1);\n    generate_services(services, hosts, 2);\n    for (std::list<service>::iterator\n           it(services.begin()),\n           end(services.end());\n         it != end;\n         ++it) {\n      it->checks_enabled = 0;\n      it->accept_passive_service_checks = 1;\n      it->max_attempts = 1;\n    }\n    set_custom_variable(\n      services.back(),\n      \"FLAGFILE\",\n      flag_file.c_str());\n\n    \/\/ Populate database.\n    db.centreon_run(\n        \"INSERT INTO cfg_organizations (organization_id, name, shortname)\"\n        \"  VALUES (1, '42', '42')\",\n        \"could not create organization\");\n\n    db.centreon_run(\n         \"INSERT INTO cfg_hosts (host_id, host_name, organization_id)\"\n         \"  VALUES (1, 'Host1', 1)\",\n         \"could not create host\");\n    db.centreon_run(\n         \"INSERT INTO cfg_services (service_id,\"\n         \"            service_description,\"\n         \"            service_notification_options, organization_id)\"\n         \"  VALUES (1, 'Service1', 'ywcu', 1), (2, 'Service2', 'ywcu', 1)\",\n         \"could not create services\");\n    db.centreon_run(\n         \"INSERT INTO cfg_hosts_services_relations (host_host_id,\"\n         \"            service_service_id)\"\n         \"  VALUES (1, 1), (1, 2)\",\n         \"could not link host and services\");\n\n    \/\/ Create contact in DB.\n    db.centreon_run(\n         \"INSERT INTO cfg_contacts (contact_id, description)\"\n         \"  VALUES (1, 'Contact1')\",\n         \"could not create contact\");\n\n    \/\/ Create notification command in DB.\n    db.centreon_run(\n         \"INSERT INTO cfg_commands (command_id, command_name,\"\n         \"            command_line, organization_id)\"\n         \"  VALUES (1, 'NotificationCommand1', 'cmake -E touch $_SERVICEFLAGFILE$', 1)\",\n         \"could not create notification command\");\n\n    \/\/ Create notification rules in DB.\n    db.centreon_run(\n         \"INSERT INTO cfg_notification_methods (method_id,\"\n         \"            name, command_id, `interval`, status, types)\"\n         \"  VALUES (1, 'NotificationMethod', 1, 300, 'w,c,u', 'n')\",\n         \"could not create notification method\");\n    db.centreon_run(\n         \"INSERT INTO cfg_notification_rules (rule_id, method_id, \"\n         \"            timeperiod_id, owner_id, contact_id, host_id,\"\n         \"            service_id, enabled)\"\n         \"  VALUES (1, 1, NULL, 1, 1, 1, 2, 1)\",\n         \"could not create notification rule (cfg)\");\n    db.centreon_run(\n         \"INSERT INTO rt_notification_rules (rule_id, method_id,\"\n         \"            timeperiod_id, contact_id, host_id,\"\n         \"            service_id)\"\n         \"  VALUES (1, 1, NULL, 1, 1, 2)\",\n         \"could not create notification rule (rt)\");\n\n    \/\/ Generate configuration.\n    broker_cfg.set_template(\n      PROJECT_SOURCE_DIR \"\/test\/cfg\/notification_non_correlated.xml.in\");\n    broker_cfg.set(\"NODE_CACHE_FILE\", node_cache_file);\n    commander.set_file(tmpnam(NULL));\n    std::string additional_config;\n    {\n      std::ostringstream oss;\n      oss << commander.get_engine_config()\n          << \"broker_module=\" << CBMOD_PATH << \" \"\n          << broker_cfg.generate() << \"\\n\";\n      additional_config = oss.str();\n    }\n    config_write(\n      engine_config_path.c_str(),\n      additional_config.c_str(),\n      &hosts,\n      &services);\n\n    \/\/ Start monitoring.\n    std::string engine_config_file(engine_config_path);\n    engine_config_file.append(\"\/nagios.cfg\");\n    monitoring.set_config_file(engine_config_file);\n    monitoring.start();\n    sleep_for(3 * MONITORING_ENGINE_INTERVAL_LENGTH);\n    commander.execute(\n      \"PROCESS_SERVICE_CHECK_RESULT;1;1;0;Submitted by unit test\");\n    commander.execute(\n      \"PROCESS_SERVICE_CHECK_RESULT;1;2;0;Submitted by unit test\");\n    sleep_for(5 * MONITORING_ENGINE_INTERVAL_LENGTH);\n\n    \/\/ Make services CRITICAL.\n    commander.execute(\n      \"PROCESS_SERVICE_CHECK_RESULT;1;1;2;Submitted by unit test\");\n    commander.execute(\n      \"PROCESS_SERVICE_CHECK_RESULT;1;2;2;Submitted by unit test\");\n    sleep_for(25 * MONITORING_ENGINE_INTERVAL_LENGTH);\n\n    \/\/ Check file creation.\n    error = !QFile::exists(flag_file.c_str());\n  }\n  catch (std::exception const& e) {\n    std::cerr << e.what() << std::endl;\n  }\n  catch (...) {\n    std::cerr << \"unknown exception\" << std::endl;\n  }\n\n  \/\/ Cleanup.\n  monitoring.stop();\n  sleep_for(3 * MONITORING_ENGINE_INTERVAL_LENGTH);\n  ::remove(flag_file.c_str());\n  ::remove(node_cache_file.c_str());\n  config_remove(engine_config_path.c_str());\n  free_hosts(hosts);\n  free_services(services);\n\n  return (error ? EXIT_FAILURE : EXIT_SUCCESS);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkPNMReader.cc\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#include \"vtkPNMReader.hh\"\n\nchar vtkPNMReaderGetChar(FILE *fp)\n{\n  char c;\n  int result;\n\n  if ((result = getc(fp)) == EOF )\n    {\n    return '\\0';\n    }\n  \n  c = (char)result;\n  if (c == '#')\n    {\n    do\n      {\n      if ((result = getc(fp)) == EOF )\n\t{\n\treturn '\\0';\n\t}\n      c = (char)result;\n      }\n    while (c != '\\n');\n    }\n  \n  return c;\n}\n\nint vtkPNMReaderGetInt(FILE *fp)\n{\n  char c;\n  int result = 0;\n  \n  do\n    {\n    c = vtkPNMReaderGetChar(fp);\n    }\n  while ((c < '1')||(c > '9'));\n  do\n    {\n    result = result * 10 + (c - '0');\n    c = vtkPNMReaderGetChar(fp);\n    }\n  while ((c >= '0')&&(c <= '9'));\n\n  return result;\n}\n  \n\nvtkPNMReader::vtkPNMReader()\n{\n  this->Filename = NULL;\n  this->ImageRange[0] = this->ImageRange[1] = -1;\n\n  this->DataOrigin[0] = this->DataOrigin[1] = this->DataOrigin[2] = 0.0;\n  this->DataAspectRatio[0] = this->DataAspectRatio[1] = this->DataAspectRatio[2] = 1.0;\n}\n\nvoid vtkPNMReader::Execute()\n{\n  vtkColorScalars *newScalars;\n  int dim[3];\n  vtkStructuredPoints *output = this->GetOutput();\n  \n\n  if ( this->Filename == NULL )\n    {\n    vtkErrorMacro(<<\"Please specify a filename!\");\n    return;\n    }\n\n  if ( this->ImageRange[0] < 0 )\n    {\n    newScalars = this->ReadImage(dim);\n    }\n  else\n    {\n    newScalars = this->ReadVolume(dim);\n    }\n\n  if ( ! newScalars ) return;\n\n  output->SetDimensions(dim);\n  output->SetAspectRatio(this->DataAspectRatio);\n  output->SetOrigin(this->DataOrigin);\n  output->GetPointData()->SetScalars(newScalars);\n  newScalars->Delete();\n}\n\nvtkColorScalars *vtkPNMReader::ReadImage(int dim[3])\n{\n  char magic[80];\n  vtkPixmap *pixmap;\n  vtkGraymap *graymap;\n  vtkBitmap *bitmap;\n  vtkColorScalars *s=NULL;\n  FILE *fp;\n  int numPts;\n  char c;\n  \n  dim[2] = 1;\n\n  if ( !(fp = fopen(this->Filename,\"r\")) )\n    {\n    vtkErrorMacro(<<\"Can't find file: \" << this->Filename);\n    return NULL;\n    }\n\n  \/\/ get the magic number\n  do\n    {\n    c = vtkPNMReaderGetChar(fp);\n    }\n  while (c != 'P');\n  magic[0] = c;\n  magic[1] = vtkPNMReaderGetChar(fp);\n  magic[2] = '\\0';\n\n  \/\/ now get the dimensions\n  dim[0] = vtkPNMReaderGetInt(fp);\n  dim[1] = vtkPNMReaderGetInt(fp);\n\n  \/\/ check input\n  if ( (numPts = dim[0]*dim[1]) < 1 )\n    {\n    vtkErrorMacro(<<\"Bad input data!\");\n    return NULL;\n    }\n\n  \/\/ compare magic number to see proper file type\n  if ( ! strcmp(magic,\"P4\") ) \/\/pbm file\n    {\n    bitmap = new vtkBitmap(numPts);\n    }\n\n  else if ( ! strcmp(magic,\"P5\") ) \/\/pgm file\n    {\n    graymap = new vtkGraymap(numPts);\n    if ( this->ReadBinaryPGM(fp,graymap,dim[0],dim[1]) )\n      {\n      s = (vtkColorScalars *) graymap;\n      }\n    else\n      {\n      graymap->Delete();\n      }\n    }\n\n  else if ( ! strcmp(magic,\"P6\") ) \/\/ppm file\n    {\n    pixmap = new vtkPixmap(numPts);\n    if ( this->ReadBinaryPPM(fp,pixmap,dim[0],dim[1]) )\n      {\n      s = (vtkColorScalars *) pixmap;\n      }\n    else\n      {\n      pixmap->Delete();\n      }\n    }\n  else\n    {\n    vtkErrorMacro(<<\"Unknown file type!\");\n    return NULL;\n    }\n\n  return s;\n}\n\nvtkColorScalars *vtkPNMReader::ReadVolume(int dim[3])\n{\n  vtkColorScalars *s=NULL;\n\n  return s;\n}\n\n\nint vtkPNMReader::ReadBinaryPBM(FILE *fp, vtkBitmap* bitmap,\n                               int xsize, int ysize)\n{\n  int max, j, packedXSize=xsize\/8;\n  unsigned char *cptr;\n\n  max = vtkPNMReaderGetInt(fp);\n\n\/\/\n\/\/ Since pnm coordinate system is at upper left of image, need to convert\n\/\/ to lower rh corner origin by reading a row at a time.\n\/\/\n  for (j=0; j<ysize; j++)\n    {\n    cptr = bitmap->WritePtr((ysize-j-1)*packedXSize,packedXSize);\n    if ( ! fread(cptr,1,packedXSize,fp) )\n      {\n      vtkErrorMacro(<<\"Error reaading raw pbm data!\");\n      return 0;\n      }\n    }\n\n  return 1;\n}\n\nint vtkPNMReader::ReadBinaryPGM(FILE *fp, vtkGraymap* graymap,\n                               int xsize, int ysize)\n{\n  int max, j;\n  unsigned char *cptr;\n\n  max = vtkPNMReaderGetInt(fp);\n\/\/\n\/\/ Since pnm coordinate system is at upper left of image, need to convert\n\/\/ to lower rh corner origin by reading a row at a time.\n\/\/\n  for (j=0; j<ysize; j++)\n    {\n    cptr = graymap->WritePtr((ysize-j-1)*xsize,xsize);\n    if ( ! fread(cptr,1,xsize,fp) )\n      {\n      vtkErrorMacro(<<\"Error reaading raw pgm data!\");\n      return 0;\n      }\n    }\n\n  return 1;\n}\n\nint vtkPNMReader::ReadBinaryPPM(FILE *fp, vtkPixmap* pixmap,\n                               int xsize, int ysize)\n{\n  int max, j;\n  unsigned char *cptr;\n\n  max = vtkPNMReaderGetInt(fp);\n\/\/\n\/\/ Since pnm coordinate system is at upper left of image, need to convert\n\/\/ to lower rh corner origin by reading a row at a time.\n\/\/\n  for (j=0; j<ysize; j++)\n    {\n    cptr = pixmap->WritePtr((ysize-j-1)*xsize,xsize);\n    if ( ! fread(cptr,3,xsize,fp) )\n      {\n      vtkErrorMacro(<<\"Error reaading raw ppm data!\");\n      return 0;\n      }\n    }\n\n  return 1;\n}\n\nvoid vtkPNMReader::PrintSelf(ostream& os, vtkIndent indent)\n{\n  vtkStructuredPointsSource::PrintSelf(os,indent);\n\n  os << indent << \"Filename: \" \n     << (this->Filename ? this->Filename : \"(none)\") << \"\\n\";\n  os << indent << \"Image Range: (\" << this->ImageRange[0] << \", \" \n     << this->ImageRange[1] << \")\\n\";\n  os << indent << \"Data Origin: (\" << this->DataOrigin[0] << \", \"\n                                   << this->DataOrigin[1] << \", \"\n                                   << this->DataOrigin[2] << \")\\n\";\n  os << indent << \"AspectRatio: (\" << this->DataAspectRatio[0] << \", \"\n                                   << this->DataAspectRatio[1] << \", \"\n                                   << this->DataAspectRatio[2] << \")\\n\";\n}\n<commit_msg>PC file io stuff<commit_after>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkPNMReader.cc\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#include \"vtkPNMReader.hh\"\n\nchar vtkPNMReaderGetChar(FILE *fp)\n{\n  char c;\n  int result;\n\n  if ((result = getc(fp)) == EOF )\n    {\n    return '\\0';\n    }\n  \n  c = (char)result;\n  if (c == '#')\n    {\n    do\n      {\n      if ((result = getc(fp)) == EOF )\n\t{\n\treturn '\\0';\n\t}\n      c = (char)result;\n      }\n    while (c != '\\n');\n    }\n  \n  return c;\n}\n\nint vtkPNMReaderGetInt(FILE *fp)\n{\n  char c;\n  int result = 0;\n  \n  do\n    {\n    c = vtkPNMReaderGetChar(fp);\n    }\n  while ((c < '1')||(c > '9'));\n  do\n    {\n    result = result * 10 + (c - '0');\n    c = vtkPNMReaderGetChar(fp);\n    }\n  while ((c >= '0')&&(c <= '9'));\n\n  return result;\n}\n  \n\nvtkPNMReader::vtkPNMReader()\n{\n  this->Filename = NULL;\n  this->ImageRange[0] = this->ImageRange[1] = -1;\n\n  this->DataOrigin[0] = this->DataOrigin[1] = this->DataOrigin[2] = 0.0;\n  this->DataAspectRatio[0] = this->DataAspectRatio[1] = this->DataAspectRatio[2] = 1.0;\n}\n\nvoid vtkPNMReader::Execute()\n{\n  vtkColorScalars *newScalars;\n  int dim[3];\n  vtkStructuredPoints *output = this->GetOutput();\n  \n\n  if ( this->Filename == NULL )\n    {\n    vtkErrorMacro(<<\"Please specify a filename!\");\n    return;\n    }\n\n  if ( this->ImageRange[0] < 0 )\n    {\n    newScalars = this->ReadImage(dim);\n    }\n  else\n    {\n    newScalars = this->ReadVolume(dim);\n    }\n\n  if ( ! newScalars ) return;\n\n  output->SetDimensions(dim);\n  output->SetAspectRatio(this->DataAspectRatio);\n  output->SetOrigin(this->DataOrigin);\n  output->GetPointData()->SetScalars(newScalars);\n  newScalars->Delete();\n}\n\nvtkColorScalars *vtkPNMReader::ReadImage(int dim[3])\n{\n  char magic[80];\n  vtkPixmap *pixmap;\n  vtkGraymap *graymap;\n  vtkBitmap *bitmap;\n  vtkColorScalars *s=NULL;\n  FILE *fp;\n  int numPts;\n  char c;\n  \n  dim[2] = 1;\n\n  if ( !(fp = fopen(this->Filename,\"rb\")) )\n    {\n    vtkErrorMacro(<<\"Can't find file: \" << this->Filename);\n    return NULL;\n    }\n\n  \/\/ get the magic number\n  do\n    {\n    c = vtkPNMReaderGetChar(fp);\n    }\n  while (c != 'P');\n  magic[0] = c;\n  magic[1] = vtkPNMReaderGetChar(fp);\n  magic[2] = '\\0';\n\n  \/\/ now get the dimensions\n  dim[0] = vtkPNMReaderGetInt(fp);\n  dim[1] = vtkPNMReaderGetInt(fp);\n\n  \/\/ check input\n  if ( (numPts = dim[0]*dim[1]) < 1 )\n    {\n    vtkErrorMacro(<<\"Bad input data!\");\n    return NULL;\n    }\n\n  \/\/ compare magic number to see proper file type\n  if ( ! strcmp(magic,\"P4\") ) \/\/pbm file\n    {\n    bitmap = new vtkBitmap(numPts);\n    }\n\n  else if ( ! strcmp(magic,\"P5\") ) \/\/pgm file\n    {\n    graymap = new vtkGraymap(numPts);\n    if ( this->ReadBinaryPGM(fp,graymap,dim[0],dim[1]) )\n      {\n      s = (vtkColorScalars *) graymap;\n      }\n    else\n      {\n      graymap->Delete();\n      }\n    }\n\n  else if ( ! strcmp(magic,\"P6\") ) \/\/ppm file\n    {\n    pixmap = new vtkPixmap(numPts);\n    if ( this->ReadBinaryPPM(fp,pixmap,dim[0],dim[1]) )\n      {\n      s = (vtkColorScalars *) pixmap;\n      }\n    else\n      {\n      pixmap->Delete();\n      }\n    }\n  else\n    {\n    vtkErrorMacro(<<\"Unknown file type!\");\n    return NULL;\n    }\n\n  return s;\n}\n\nvtkColorScalars *vtkPNMReader::ReadVolume(int dim[3])\n{\n  vtkColorScalars *s=NULL;\n\n  return s;\n}\n\n\nint vtkPNMReader::ReadBinaryPBM(FILE *fp, vtkBitmap* bitmap,\n                               int xsize, int ysize)\n{\n  int max, j, packedXSize=xsize\/8;\n  unsigned char *cptr;\n\n  max = vtkPNMReaderGetInt(fp);\n\n\/\/\n\/\/ Since pnm coordinate system is at upper left of image, need to convert\n\/\/ to lower rh corner origin by reading a row at a time.\n\/\/\n  for (j=0; j<ysize; j++)\n    {\n    cptr = bitmap->WritePtr((ysize-j-1)*packedXSize,packedXSize);\n    if ( ! fread(cptr,1,packedXSize,fp) )\n      {\n      vtkErrorMacro(<<\"Error reaading raw pbm data!\");\n      return 0;\n      }\n    }\n\n  return 1;\n}\n\nint vtkPNMReader::ReadBinaryPGM(FILE *fp, vtkGraymap* graymap,\n                               int xsize, int ysize)\n{\n  int max, j;\n  unsigned char *cptr;\n\n  max = vtkPNMReaderGetInt(fp);\n\/\/\n\/\/ Since pnm coordinate system is at upper left of image, need to convert\n\/\/ to lower rh corner origin by reading a row at a time.\n\/\/\n  for (j=0; j<ysize; j++)\n    {\n    cptr = graymap->WritePtr((ysize-j-1)*xsize,xsize);\n    if ( ! fread(cptr,1,xsize,fp) )\n      {\n      vtkErrorMacro(<<\"Error reaading raw pgm data!\");\n      return 0;\n      }\n    }\n\n  return 1;\n}\n\nint vtkPNMReader::ReadBinaryPPM(FILE *fp, vtkPixmap* pixmap,\n                               int xsize, int ysize)\n{\n  int max, j;\n  unsigned char *cptr;\n\n  max = vtkPNMReaderGetInt(fp);\n  \/\/\n  \/\/ Since pnm coordinate system is at upper left of image, need to convert\n  \/\/ to lower rh corner origin by reading a row at a time.\n  \/\/\n  for (j=0; j<ysize; j++)\n    {\n    cptr = pixmap->WritePtr((ysize-j-1)*xsize,xsize);\n    if ( ! fread(cptr,1,3*xsize,fp) )\n      {\n      vtkErrorMacro(<<\"Error reaading raw ppm data!\");\n      return 0;\n      }\n    }\n\n  return 1;\n}\n\nvoid vtkPNMReader::PrintSelf(ostream& os, vtkIndent indent)\n{\n  vtkStructuredPointsSource::PrintSelf(os,indent);\n\n  os << indent << \"Filename: \" \n     << (this->Filename ? this->Filename : \"(none)\") << \"\\n\";\n  os << indent << \"Image Range: (\" << this->ImageRange[0] << \", \" \n     << this->ImageRange[1] << \")\\n\";\n  os << indent << \"Data Origin: (\" << this->DataOrigin[0] << \", \"\n                                   << this->DataOrigin[1] << \", \"\n                                   << this->DataOrigin[2] << \")\\n\";\n  os << indent << \"AspectRatio: (\" << this->DataAspectRatio[0] << \", \"\n                                   << this->DataAspectRatio[1] << \", \"\n                                   << this->DataAspectRatio[2] << \")\\n\";\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"core\/link_strand.h\"\n#include \"core\/config.h\"\n#include \"dsa\/network.h\"\n\n#include \"network\/tcp\/tcp_client.h\"\n#include \"network\/tcp\/tcp_server.h\"\n\n#include \"module\/default_modules.h\"\n\n#include \"gtest\/gtest.h\"\n\n#include <iostream>\n\nusing namespace dsa;\n\nTEST(TcpServerTest, SingleStrand) {\n  App app(\"SingleStrandTest\");\n\n  WrapperConfig config;\n  config.tcp_host = \"127.0.0.1\";\n  config.tcp_port = 8092;\n  config.strand = make_intrusive_<DefaultModules>(app);\n\n  app.async_start(10);\n\n  auto tcp_server = make_shared_<TcpServer>(config);\n  tcp_server->start();\n\n  std::vector<shared_ptr_<TcpClient>> clients;\n  for (unsigned int i = 0; i < 2; ++i) {\n    shared_ptr_<TcpClient> tcp_client(\n        new TcpClient(config));\n    tcp_client->connect();\n    clients.push_back(std::move(tcp_client));\n  }\n\n  app.sleep(2000);\n\n  tcp_server->close();\n  for (unsigned int i = 0; i < 2; ++i) {\n    clients[i]->close();\n  }\n\n  app.sleep(500);\n  \/\/ TODO: check if app has pending jobs\n\n  app.close();\n\n  app.wait();\n}\n\nTEST(TcpServerTest, MultiStrand) {\n  App app(\"MultiStrandTest\");\n\n  WrapperConfig server_config;\n  server_config.tcp_host = \"127.0.0.1\";\n  server_config.tcp_port = 8092;\n  server_config.strand = make_intrusive_<DefaultModules>(app);\n\n  app.async_start(10);\n\n\/\/  auto tcp_server(new TcpServer(server_config));\n  auto tcp_server = make_shared_<TcpServer>(server_config);\n  tcp_server->start();\n\n  WrapperConfig client_config;\n  client_config.tcp_host = \"127.0.0.1\";\n  client_config.tcp_port = 8092;\n  client_config.strand = make_intrusive_<DefaultModules>(app);\n\n  std::vector<shared_ptr_<TcpClient>> clients;\n  for (unsigned int i = 0; i < 2; ++i) {\n    shared_ptr_<TcpClient> tcp_client(\n        new TcpClient(client_config));\n    tcp_client->connect();\n    clients.push_back(std::move(tcp_client));\n  }\n\n  app.sleep(2000);\n\n  tcp_server->close();\n  for (unsigned int i = 0; i < 2; ++i) {\n    clients[i]->close();\n  }\n\n  app.sleep(500);\n  \/\/ TODO: check if app has pending jobs\n  app.force_stop();\n\n  app.wait();\n}\n<commit_msg>revert changes<commit_after>#include \"core\/link_strand.h\"\n#include \"core\/config.h\"\n#include \"dsa\/network.h\"\n\n#include \"network\/tcp\/tcp_client.h\"\n#include \"network\/tcp\/tcp_server.h\"\n\n#include \"module\/default_modules.h\"\n\n#include \"gtest\/gtest.h\"\n\n#include <iostream>\n\nusing namespace dsa;\n\nTEST(TcpServerTest, SingleStrand) {\n  App app(\"SingleStrandTest\");\n\n  WrapperConfig config;\n  config.tcp_host = \"127.0.0.1\";\n  config.tcp_port = 8092;\n  config.strand = make_intrusive_<DefaultModules>(app);\n\n  app.async_start(10);\n\n  auto tcp_server = make_shared_<TcpServer>(config);\n  tcp_server->start();\n\n  std::vector<shared_ptr_<TcpClient>> clients;\n  for (unsigned int i = 0; i < 2; ++i) {\n    shared_ptr_<TcpClient> tcp_client(\n        new TcpClient(config));\n    tcp_client->connect();\n    clients.push_back(std::move(tcp_client));\n  }\n\n  app.sleep(2000);\n\n  tcp_server->close();\n  for (unsigned int i = 0; i < 2; ++i) {\n    clients[i]->close();\n  }\n\n  app.sleep(500);\n  \/\/ TODO: check if app has pending jobs\n\n  app.force_stop();\n\n  app.wait();\n}\n\nTEST(TcpServerTest, MultiStrand) {\n  App app(\"MultiStrandTest\");\n\n  WrapperConfig server_config;\n  server_config.tcp_host = \"127.0.0.1\";\n  server_config.tcp_port = 8092;\n  server_config.strand = make_intrusive_<DefaultModules>(app);\n\n  app.async_start(10);\n\n\/\/  auto tcp_server(new TcpServer(server_config));\n  auto tcp_server = make_shared_<TcpServer>(server_config);\n  tcp_server->start();\n\n  WrapperConfig client_config;\n  client_config.tcp_host = \"127.0.0.1\";\n  client_config.tcp_port = 8092;\n  client_config.strand = make_intrusive_<DefaultModules>(app);\n\n  std::vector<shared_ptr_<TcpClient>> clients;\n  for (unsigned int i = 0; i < 2; ++i) {\n    shared_ptr_<TcpClient> tcp_client(\n        new TcpClient(client_config));\n    tcp_client->connect();\n    clients.push_back(std::move(tcp_client));\n  }\n\n  app.sleep(2000);\n\n  tcp_server->close();\n  for (unsigned int i = 0; i < 2; ++i) {\n    clients[i]->close();\n  }\n\n  app.sleep(500);\n  \/\/ TODO: check if app has pending jobs\n  app.force_stop();\n\n  app.wait();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright 2019 Axel Huebl, Benjamin Worpitz, Jakob Krude\n *\n * This file is part of Alpaka.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#include <alpaka\/test\/acc\/TestAccs.hpp>\n#include <alpaka\/test\/mem\/view\/Iterator.hpp>\n#include <alpaka\/test\/Extent.hpp>\n#include <catch2\/catch.hpp>\n\n\ntemplate<\n    typename TDim,\n    typename TIdx,\n    typename TAcc,\n    typename TData,\n    typename Vec = alpaka::vec::Vec<\n        TDim,\n        TIdx>>\nstruct TestContainer\n{\n\n    using AccQueueProperty = alpaka::queue::Blocking;\n    using DevQueue = alpaka::queue::Queue<\n        TAcc,\n        AccQueueProperty\n    >;\n    using DevAcc = alpaka::dev::Dev<TAcc>;\n    using PltfAcc = alpaka::pltf::Pltf<DevAcc>;\n\n    using DevHost = alpaka::dev::DevCpu;\n    using PltfHost = alpaka::pltf::Pltf<DevHost>;\n\n    using BufHost = alpaka::mem::buf::Buf<\n        DevHost,\n        TData,\n        TDim,\n        TIdx\n    >;\n    using BufDevice = alpaka::mem::buf::Buf<\n        DevAcc,\n        TData,\n        TDim,\n        TIdx\n    >;\n\n    using SubView = alpaka::mem::view::ViewSubView<\n        DevAcc,\n        TData,\n        TDim,\n        TIdx\n    >;\n\n    DevAcc const devAcc;\n    DevHost const devHost;\n    DevQueue devQueue;\n\n\n    \/\/ Constructor\n    TestContainer():\n        devAcc(alpaka::pltf::getDevByIdx<PltfAcc>(0u)),\n        devHost(alpaka::pltf::getDevByIdx<PltfHost>(0u)),\n        devQueue(devAcc)\n    {}\n\n\n    auto createHostBuffer(\n        Vec extents,\n        bool indexed\n    ) -> BufHost\n    {\n        BufHost bufHost(\n            alpaka::mem::buf::alloc<\n                TData,\n                TIdx\n            >(\n                devHost,\n                extents\n            ));\n        if(indexed)\n        {\n            TData *const ptr = alpaka::mem::view::getPtrNative(bufHost);\n            for(TIdx i(0);i < extents.prod();++i)\n            {\n                ptr[i] = static_cast<TData>(i);\n            }\n        }\n        return bufHost;\n    }\n\n\n    auto createDeviceBuffer(Vec extents) -> BufDevice\n    {\n        BufDevice bufDevice(\n            alpaka::mem::buf::alloc<\n                TData,\n                TIdx\n            >(\n                devAcc,\n                extents\n            ));\n        return bufDevice;\n    }\n\n\n    auto copyToAcc(\n        BufHost bufHost,\n        BufDevice bufAcc,\n        Vec extents\n    ) -> void\n    {\n        alpaka::mem::view::copy(\n            devQueue,\n            bufAcc,\n            bufHost,\n            extents\n        );\n    }\n\n\n    auto copyToHost(\n        BufDevice bufAcc,\n        BufHost bufHost,\n        Vec extents\n    ) -> void\n    {\n        alpaka::mem::view::copy(\n            devQueue,\n            bufHost,\n            bufAcc,\n            extents\n        );\n    }\n\n\n    auto sliceOnDevice(\n        BufDevice bufferToBeSliced,\n        Vec subViewExtents,\n        Vec offsets\n    ) -> BufDevice\n    {\n        BufDevice slicedBuffer = createDeviceBuffer(subViewExtents);\n        \/\/ Create a subView with a possible offset.\n        SubView subView = SubView(\n            bufferToBeSliced,\n            subViewExtents,\n            offsets\n        );\n        \/\/ Copy the subView into a new buffer.\n        alpaka::mem::view::copy(\n            devQueue,\n            slicedBuffer,\n            subView,\n            subViewExtents\n        );\n        return slicedBuffer;\n    }\n\n\n    auto compareBuffer(\n        BufHost const & bufferA,\n        BufHost const & bufferB,\n        Vec const & extents\n    ) const\n    {\n        TData const *const ptrA = alpaka::mem::view::getPtrNative(bufferA);\n        TData const *const ptrB = alpaka::mem::view::getPtrNative(bufferB);\n        for(TIdx i(0);i < extents.prod();++i)\n        {\n            INFO(\"Dim: \" << TDim::value)\n            INFO(\"Idx: \" << typeid(TIdx).name())\n            INFO(\"Acc: \" << alpaka::acc::traits::GetAccName<TAcc>::getAccName())\n            INFO(\"i: \" << i)\n            REQUIRE(ptrA[i] == Approx(ptrB[i]));\n        }\n\n    }\n};\n\nusing DataTypes = std::tuple<\n    int,\n    float,\n    double\n>;\n\nusing TestAccWithDataTypes =\nalpaka::meta::CartesianProduct<\n    std::tuple,\n    alpaka::test::acc::TestAccs,\n    DataTypes\n>;\n\nTEMPLATE_LIST_TEST_CASE(\"memBufSlicingTest\",\n    \"[memBuf]\",\n    TestAccWithDataTypes)\n{\n    using Acc = std::tuple_element_t<\n        0,\n        TestType\n    >;\n    using Data = std::tuple_element_t<\n        1,\n        TestType\n    >;\n    using Dim = alpaka::dim::Dim<Acc>;\n\n    \/\/ fourth-dimension is not supposed to be tested currently\n    if(Dim::value == 4)\n    {\n        return;\n    }\n    using Idx = alpaka::idx::Idx<Acc>;\n    TestContainer<\n        Dim,\n        Idx,\n        Acc,\n        Data\n    > slicingTest;\n\n    auto const extents(\n        alpaka::vec::createVecFromIndexedFn<\n            Dim,\n            alpaka::test::CreateVecWithIdx<Idx>::template ForExtentBuf\n        >());\n\n    auto const extentsSubView(\n        alpaka::vec::createVecFromIndexedFn<\n            Dim,\n            alpaka::test::CreateVecWithIdx<Idx>::template ForExtentSubView\n        >());\n    auto const offsets(\n        alpaka::vec::createVecFromIndexedFn<\n            Dim,\n            alpaka::test::CreateVecWithIdx<Idx>::template ForOffset\n        >());\n\n    \/\/ This is the initial buffer.\n    auto const indexedBuffer = slicingTest.createHostBuffer(\n        extents,\n        true\n    );\n    \/\/ This buffer will hold the sliced-buffer when it was copied to the host.\n    auto resultBuffer = slicingTest.createHostBuffer(\n        extentsSubView,\n        false\n    );\n\n    \/\/ Copy of the indexBuffer on the deviceSide.\n    auto deviceBuffer = slicingTest.createDeviceBuffer(extents);\n\n    \/\/ Start: Main-Test\n    slicingTest.copyToAcc(\n        indexedBuffer,\n        deviceBuffer,\n        extents\n    );\n\n    auto slicedBuffer = slicingTest.sliceOnDevice(\n        deviceBuffer,\n        extentsSubView,\n        offsets\n    );\n\n    slicingTest.copyToHost(\n        slicedBuffer,\n        resultBuffer,\n        extentsSubView\n    );\n\n    auto correctResults = slicingTest.createHostBuffer(\n        extentsSubView,\n        false\n    );\n    Data *ptrNative = alpaka::mem::view::getPtrNative(correctResults);\n    using Dim1 = alpaka::dim::DimInt<1u>;\n\n    for(Idx i(0);i < extentsSubView.prod();++i)\n    {\n        auto mappedToND = alpaka::idx::mapIdx<\n            Dim::value,\n            Dim1::value\n        >(\n            alpaka::vec::Vec<\n                Dim1,\n                Idx\n            >(i),\n            extentsSubView\n        );\n        auto addedOffset = mappedToND + offsets;\n        auto mappedTo1D = alpaka::idx::mapIdx<Dim1::value>(\n            addedOffset,\n            extents\n        )[0]; \/\/ take the only element in the vector\n        ptrNative[i] = static_cast<Data>(mappedTo1D);\n    }\n\n    \/\/ resultBuffer will be compared with the manually computed results.\n    slicingTest.compareBuffer(\n        resultBuffer,\n        correctResults,\n        extentsSubView\n    );\n}\n<commit_msg>Suppress warning C4127: conditional expression is constant.<commit_after>\/* Copyright 2019 Axel Huebl, Benjamin Worpitz, Jakob Krude\n *\n * This file is part of Alpaka.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#include <alpaka\/test\/acc\/TestAccs.hpp>\n#include <alpaka\/test\/mem\/view\/Iterator.hpp>\n#include <alpaka\/test\/Extent.hpp>\n#include <catch2\/catch.hpp>\n\n#if BOOST_COMP_MSVC || defined(BOOST_COMP_MSVC_EMULATED)\n    #pragma warning(push)\n    #pragma warning(disable: 4127) \/\/ suppress warning for c++17 conditional expression is constant\n#endif\n\ntemplate<\n    typename TDim,\n    typename TIdx,\n    typename TAcc,\n    typename TData,\n    typename Vec = alpaka::vec::Vec<\n        TDim,\n        TIdx>>\nstruct TestContainer\n{\n\n    using AccQueueProperty = alpaka::queue::Blocking;\n    using DevQueue = alpaka::queue::Queue<\n        TAcc,\n        AccQueueProperty\n    >;\n    using DevAcc = alpaka::dev::Dev<TAcc>;\n    using PltfAcc = alpaka::pltf::Pltf<DevAcc>;\n\n    using DevHost = alpaka::dev::DevCpu;\n    using PltfHost = alpaka::pltf::Pltf<DevHost>;\n\n    using BufHost = alpaka::mem::buf::Buf<\n        DevHost,\n        TData,\n        TDim,\n        TIdx\n    >;\n    using BufDevice = alpaka::mem::buf::Buf<\n        DevAcc,\n        TData,\n        TDim,\n        TIdx\n    >;\n\n    using SubView = alpaka::mem::view::ViewSubView<\n        DevAcc,\n        TData,\n        TDim,\n        TIdx\n    >;\n\n    DevAcc const devAcc;\n    DevHost const devHost;\n    DevQueue devQueue;\n\n\n    \/\/ Constructor\n    TestContainer():\n        devAcc(alpaka::pltf::getDevByIdx<PltfAcc>(0u)),\n        devHost(alpaka::pltf::getDevByIdx<PltfHost>(0u)),\n        devQueue(devAcc)\n    {}\n\n\n    auto createHostBuffer(\n        Vec extents,\n        bool indexed\n    ) -> BufHost\n    {\n        BufHost bufHost(\n            alpaka::mem::buf::alloc<\n                TData,\n                TIdx\n            >(\n                devHost,\n                extents\n            ));\n        if(indexed)\n        {\n            TData *const ptr = alpaka::mem::view::getPtrNative(bufHost);\n            for(TIdx i(0);i < extents.prod();++i)\n            {\n                ptr[i] = static_cast<TData>(i);\n            }\n        }\n        return bufHost;\n    }\n\n\n    auto createDeviceBuffer(Vec extents) -> BufDevice\n    {\n        BufDevice bufDevice(\n            alpaka::mem::buf::alloc<\n                TData,\n                TIdx\n            >(\n                devAcc,\n                extents\n            ));\n        return bufDevice;\n    }\n\n\n    auto copyToAcc(\n        BufHost bufHost,\n        BufDevice bufAcc,\n        Vec extents\n    ) -> void\n    {\n        alpaka::mem::view::copy(\n            devQueue,\n            bufAcc,\n            bufHost,\n            extents\n        );\n    }\n\n\n    auto copyToHost(\n        BufDevice bufAcc,\n        BufHost bufHost,\n        Vec extents\n    ) -> void\n    {\n        alpaka::mem::view::copy(\n            devQueue,\n            bufHost,\n            bufAcc,\n            extents\n        );\n    }\n\n\n    auto sliceOnDevice(\n        BufDevice bufferToBeSliced,\n        Vec subViewExtents,\n        Vec offsets\n    ) -> BufDevice\n    {\n        BufDevice slicedBuffer = createDeviceBuffer(subViewExtents);\n        \/\/ Create a subView with a possible offset.\n        SubView subView = SubView(\n            bufferToBeSliced,\n            subViewExtents,\n            offsets\n        );\n        \/\/ Copy the subView into a new buffer.\n        alpaka::mem::view::copy(\n            devQueue,\n            slicedBuffer,\n            subView,\n            subViewExtents\n        );\n        return slicedBuffer;\n    }\n\n\n    auto compareBuffer(\n        BufHost const & bufferA,\n        BufHost const & bufferB,\n        Vec const & extents\n    ) const\n    {\n        TData const *const ptrA = alpaka::mem::view::getPtrNative(bufferA);\n        TData const *const ptrB = alpaka::mem::view::getPtrNative(bufferB);\n        for(TIdx i(0);i < extents.prod();++i)\n        {\n            INFO(\"Dim: \" << TDim::value)\n            INFO(\"Idx: \" << typeid(TIdx).name())\n            INFO(\"Acc: \" << alpaka::acc::traits::GetAccName<TAcc>::getAccName())\n            INFO(\"i: \" << i)\n            REQUIRE(ptrA[i] == Approx(ptrB[i]));\n        }\n\n    }\n};\n\nusing DataTypes = std::tuple<\n    int,\n    float,\n    double\n>;\n\nusing TestAccWithDataTypes =\nalpaka::meta::CartesianProduct<\n    std::tuple,\n    alpaka::test::acc::TestAccs,\n    DataTypes\n>;\n\nTEMPLATE_LIST_TEST_CASE(\"memBufSlicingTest\",\n    \"[memBuf]\",\n    TestAccWithDataTypes)\n{\n    using Acc = std::tuple_element_t<\n        0,\n        TestType\n    >;\n    using Data = std::tuple_element_t<\n        1,\n        TestType\n    >;\n    using Dim = alpaka::dim::Dim<Acc>;\n    \/\/ fourth-dimension is not supposed to be tested currently\n    if(Dim::value == 4)\n    {\n        return;\n    }\n    using Idx = alpaka::idx::Idx<Acc>;\n    TestContainer<\n        Dim,\n        Idx,\n        Acc,\n        Data\n    > slicingTest;\n\n    auto const extents(\n        alpaka::vec::createVecFromIndexedFn<\n            Dim,\n            alpaka::test::CreateVecWithIdx<Idx>::template ForExtentBuf\n        >());\n\n    auto const extentsSubView(\n        alpaka::vec::createVecFromIndexedFn<\n            Dim,\n            alpaka::test::CreateVecWithIdx<Idx>::template ForExtentSubView\n        >());\n    auto const offsets(\n        alpaka::vec::createVecFromIndexedFn<\n            Dim,\n            alpaka::test::CreateVecWithIdx<Idx>::template ForOffset\n        >());\n\n    \/\/ This is the initial buffer.\n    auto const indexedBuffer = slicingTest.createHostBuffer(\n        extents,\n        true\n    );\n    \/\/ This buffer will hold the sliced-buffer when it was copied to the host.\n    auto resultBuffer = slicingTest.createHostBuffer(\n        extentsSubView,\n        false\n    );\n\n    \/\/ Copy of the indexBuffer on the deviceSide.\n    auto deviceBuffer = slicingTest.createDeviceBuffer(extents);\n\n    \/\/ Start: Main-Test\n    slicingTest.copyToAcc(\n        indexedBuffer,\n        deviceBuffer,\n        extents\n    );\n\n    auto slicedBuffer = slicingTest.sliceOnDevice(\n        deviceBuffer,\n        extentsSubView,\n        offsets\n    );\n\n    slicingTest.copyToHost(\n        slicedBuffer,\n        resultBuffer,\n        extentsSubView\n    );\n\n    auto correctResults = slicingTest.createHostBuffer(\n        extentsSubView,\n        false\n    );\n    Data *ptrNative = alpaka::mem::view::getPtrNative(correctResults);\n    using Dim1 = alpaka::dim::DimInt<1u>;\n\n    for(Idx i(0);i < extentsSubView.prod();++i)\n    {\n        auto mappedToND = alpaka::idx::mapIdx<\n            Dim::value,\n            Dim1::value\n        >(\n            alpaka::vec::Vec<\n                Dim1,\n                Idx\n            >(i),\n            extentsSubView\n        );\n        auto addedOffset = mappedToND + offsets;\n        auto mappedTo1D = alpaka::idx::mapIdx<Dim1::value>(\n            addedOffset,\n            extents\n        )[0]; \/\/ take the only element in the vector\n        ptrNative[i] = static_cast<Data>(mappedTo1D);\n    }\n\n    \/\/ resultBuffer will be compared with the manually computed results.\n    slicingTest.compareBuffer(\n        resultBuffer,\n        correctResults,\n        extentsSubView\n    );\n}\n\n#if BOOST_COMP_MSVC || defined(BOOST_COMP_MSVC_EMULATED)\n    #pragma warning(pop)\n#endif\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>increase get info pririty to medium high<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/                         Peloton\n\/\/\n\/\/ zone_map_test.cpp\n\/\/\n\/\/ Identification: test\/storage\/zone_map_test.cpp\n\/\/\n\/\/ Copyright (c) 2015-16, Carnegie Mellon University Database Group\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include <stdio.h>\n#include <stdlib.h>\n#include \"common\/harness.h\"\n\n#include \"storage\/data_table.h\"\n\n#include \"executor\/testing_executor_util.h\"\n#include \"storage\/tile_group.h\"\n#include \"storage\/database.h\"\n#include \"storage\/tile.h\"\n#include \"storage\/tile_group_header.h\"\n#include \"storage\/tuple.h\"\n#include \"storage\/zone_map_manager.h\"\n#include \"catalog\/schema.h\"\n#include \"catalog\/catalog.h\"\n#include \"catalog\/zone_map_catalog.h\"\n\n#include \"concurrency\/transaction_manager_factory.h\"\n\nnamespace peloton {\nnamespace test {\n\nclass ZoneMapTests : public PelotonTest {};\n\nTEST_F(ZoneMapTests, ZoneMapContentsTest) {\n  storage::DataTable *data_table = TestingExecutorUtil::CreateTable(5, false, 1);\n  auto &txn_manager = concurrency::TransactionManagerFactory::GetInstance();\n  auto txn = txn_manager.BeginTransaction();\n  TestingExecutorUtil::PopulateTable(data_table, 20, false, false, false, txn);\n  txn_manager.CommitTransaction(txn);\n\n\n  oid_t num_tile_groups = data_table->GetTileGroupCount();\n  for (oid_t i = 0; i < num_tile_groups - 1; i++) {\n    auto tile_group = data_table->GetTileGroup(i);\n    auto tile_group_ptr = tile_group.get();\n    auto tile_group_header = tile_group_ptr->GetHeader();\n    tile_group_header->SetImmutability();\n  }\n\n  auto catalog = catalog::Catalog::GetInstance();\n  (void)catalog;\n  storage::ZoneMapManager *zone_map_manager = storage::ZoneMapManager::GetInstance();\n  zone_map_manager->CreateZoneMapTableInCatalog();\n  txn = txn_manager.BeginTransaction();\n  zone_map_manager->CreateZoneMapsForTable(data_table, txn);\n  txn_manager.CommitTransaction(txn);\n\n  for (oid_t i = 0; i < num_tile_groups - 1; i++) {\n    oid_t database_id = data_table->GetDatabaseOid();\n    oid_t table_id = data_table->GetOid();\n    for (int j = 0; j < 4; j++) {\n      std::shared_ptr<storage::ZoneMapManager::ColumnStatistics> stats = zone_map_manager->GetZoneMapFromCatalog(database_id, table_id, i, j);\n      type::Value min_val = (stats.get())->min;\n      type::Value max_val = (stats.get())->max;\n      int max = ((TESTS_TUPLES_PER_TILEGROUP * (i+1)) - 1)*10;\n      int min = (TESTS_TUPLES_PER_TILEGROUP * (i))*10;\n      \/\/ Integer Columns\n      if (j == 0 || j == 1) {\n        int min_zone_map = min_val.GetAs<int>();\n        int max_zone_map = max_val.GetAs<int>();\n        EXPECT_EQ(min + j, min_zone_map);\n        EXPECT_EQ(max + j, max_zone_map);\n      } else if (j == 2) {\n        \/\/ Decimal Column\n        double min_zone_map = min_val.GetAs<double>();\n        double max_zone_map = max_val.GetAs<double>();\n        EXPECT_EQ((double)(min + j), min_zone_map);\n        EXPECT_EQ((double)(max + j), max_zone_map);\n      } else {\n        \/\/ VARCHAR Column\n        const char *min_zone_map_str;\n        const char *max_zone_map_str;\n\n        min_zone_map_str = min_val.GetData();\n        max_zone_map_str = max_val.GetData();\n\n        std::stringstream min_ss;\n        std::stringstream max_ss;\n        if (i == 0) {\n          min_ss << (min + j + 10);\n        } else {\n          min_ss << (min + j);\n        }\n        max_ss << (max +j);\n        std::string min_str = min_ss.str();\n        std::string max_str = max_ss.str();\n        EXPECT_EQ(min_str, min_zone_map_str);\n        EXPECT_EQ(max_str, max_zone_map_str);\n      }\n    }\n  } \n}\n}  \/\/ End test namespace\n}  \/\/ End peloton namespace<commit_msg>Roses are red, Sky is blue. Memory Leaks - Fuck You<commit_after>\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/                         Peloton\n\/\/\n\/\/ zone_map_test.cpp\n\/\/\n\/\/ Identification: test\/storage\/zone_map_test.cpp\n\/\/\n\/\/ Copyright (c) 2015-16, Carnegie Mellon University Database Group\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include <stdio.h>\n#include <stdlib.h>\n#include \"common\/harness.h\"\n\n#include \"storage\/data_table.h\"\n\n#include \"executor\/testing_executor_util.h\"\n#include \"storage\/tile_group.h\"\n#include \"storage\/database.h\"\n#include \"storage\/tile.h\"\n#include \"storage\/tile_group_header.h\"\n#include \"storage\/tuple.h\"\n#include \"storage\/zone_map_manager.h\"\n#include \"catalog\/schema.h\"\n#include \"catalog\/catalog.h\"\n#include \"catalog\/zone_map_catalog.h\"\n\n#include \"concurrency\/transaction_manager_factory.h\"\n\nnamespace peloton {\nnamespace test {\n\nclass ZoneMapTests : public PelotonTest {};\n\nTEST_F(ZoneMapTests, ZoneMapContentsTest) {\n\n  std::unique_ptr<storage::DataTable> data_table(TestingExecutorUtil::CreateTable(5, false, 1));\n  \/\/ storage::DataTable *data_table = TestingExecutorUtil::CreateTable(5, false, 1);\n  auto &txn_manager = concurrency::TransactionManagerFactory::GetInstance();\n  auto txn = txn_manager.BeginTransaction();\n  TestingExecutorUtil::PopulateTable(data_table.get(), 20, false, false, false, txn);\n  txn_manager.CommitTransaction(txn);\n\n\n  oid_t num_tile_groups = (data_table.get())->GetTileGroupCount();\n  for (oid_t i = 0; i < num_tile_groups - 1; i++) {\n    auto tile_group = (data_table.get())->GetTileGroup(i);\n    auto tile_group_ptr = tile_group.get();\n    auto tile_group_header = tile_group_ptr->GetHeader();\n    tile_group_header->SetImmutability();\n  }\n\n  auto catalog = catalog::Catalog::GetInstance();\n  (void)catalog;\n  storage::ZoneMapManager *zone_map_manager = storage::ZoneMapManager::GetInstance();\n  zone_map_manager->CreateZoneMapTableInCatalog();\n  txn = txn_manager.BeginTransaction();\n  zone_map_manager->CreateZoneMapsForTable((data_table.get()), txn);\n  txn_manager.CommitTransaction(txn);\n\n  for (oid_t i = 0; i < num_tile_groups - 1; i++) {\n    oid_t database_id = (data_table.get())->GetDatabaseOid();\n    oid_t table_id = (data_table.get())->GetOid();\n    for (int j = 0; j < 4; j++) {\n      std::shared_ptr<storage::ZoneMapManager::ColumnStatistics> stats = zone_map_manager->GetZoneMapFromCatalog(database_id, table_id, i, j);\n      type::Value min_val = (stats.get())->min;\n      type::Value max_val = (stats.get())->max;\n      int max = ((TESTS_TUPLES_PER_TILEGROUP * (i+1)) - 1)*10;\n      int min = (TESTS_TUPLES_PER_TILEGROUP * (i))*10;\n      \/\/ Integer Columns\n      if (j == 0 || j == 1) {\n        int min_zone_map = min_val.GetAs<int>();\n        int max_zone_map = max_val.GetAs<int>();\n        EXPECT_EQ(min + j, min_zone_map);\n        EXPECT_EQ(max + j, max_zone_map);\n      } else if (j == 2) {\n        \/\/ Decimal Column\n        double min_zone_map = min_val.GetAs<double>();\n        double max_zone_map = max_val.GetAs<double>();\n        EXPECT_EQ((double)(min + j), min_zone_map);\n        EXPECT_EQ((double)(max + j), max_zone_map);\n      } else {\n        \/\/ VARCHAR Column\n        const char *min_zone_map_str;\n        const char *max_zone_map_str;\n\n        min_zone_map_str = min_val.GetData();\n        max_zone_map_str = max_val.GetData();\n\n        std::stringstream min_ss;\n        std::stringstream max_ss;\n        if (i == 0) {\n          min_ss << (min + j + 10);\n        } else {\n          min_ss << (min + j);\n        }\n        max_ss << (max +j);\n        std::string min_str = min_ss.str();\n        std::string max_str = max_ss.str();\n        EXPECT_EQ(min_str, min_zone_map_str);\n        EXPECT_EQ(max_str, max_zone_map_str);\n      }\n    }\n  }\n}\n}  \/\/ End test namespace\n}  \/\/ End peloton namespace<|endoftext|>"}
{"text":"<commit_before>\/\/ Originally from GraphCT, version 0.6.0\n\/\/ License: GeorgiaTech\n\n#include \"defs.hpp\"\n#include <Grappa.hpp>\n#include <ForkJoin.hpp>\n#include <GlobalAllocator.hpp>\n#include <Delegate.hpp>\n#include <Collective.hpp>\n#include <common.hpp>\n#include <Cache.hpp>\n#include <GlobalTaskJoiner.hpp>\n#include <PushBuffer.hpp>\n#include <Array.hpp>\n\n#include \"..\/compat\/mersenne.h\"\n\n#define read      Grappa_delegate_read_word\n#define write     Grappa_delegate_write_word\n#define cmp_swap  Grappa_delegate_compare_and_swap_word\n#define fetch_add Grappa_delegate_fetch_and_add_word\n\nstatic inline double read_double(GlobalAddress<double> addr) {\n  int64_t temp = Grappa_delegate_read_word(addr);\n  return *reinterpret_cast<double*>(&temp);\n}\n\nstruct CentralityScratch {\n  GlobalAddress<double> delta;\n  GlobalAddress<graphint> dist, Q, sigma, marks, child, child_count, explored,\n                          Qnext;\n};\n\nstatic LocalTaskJoiner joiner;\n\nstatic graph g;\nstatic CentralityScratch c;\nstatic GlobalAddress<double> bc;\nstatic graphint d_phase;\nstatic graphint local_Qnext;\n\nstatic int64_t nedge_traversed;\n\nstatic PushBuffer<int64_t> Qbuf;\n\nvoid bfs_push_visit_neighbor(int64_t kstart, int64_t kiters, GlobalAddress<void*> packed) {\n  graphint v = (graphint)packed.pointer();\n  DVLOG(3) << \"neighbors \" << v << \": \" << kstart << \" -> \" << kstart+kiters;\n\n  graphint sigmav = read(c.sigma+v);\n  graphint vStart = read(g.edgeStart+v);\n\n  graphint bufEndV[kiters];\n  Incoherent<int64_t>::RO cendV(g.endVertex+kstart, kiters, bufEndV);\n  \n  graphint ccount = 0;\n  graphint bufChild[kiters];\n    \n  for (int64_t k=0; k<kiters; k++) {\n    graphint w = cendV[k];\n    graphint d = read(c.dist+w);\n    \n    \/* If node has not been visited, set distance and push on Q (but only once) *\/\n    if (d < 0) {\n      if (cmp_swap(c.marks+w, 0, 1)) {\n        write(c.dist+w, d_phase);\n        \/\/write(c.Q + fetch_add(c.Qnext, 1), w);\n        Qbuf.push(w);\n      }\n    }\n    if (d < 0 || d == d_phase) {\n      fetch_add(c.sigma+w, sigmav);\n      bufChild[ccount++] = w;\n    }\n  }\n  graphint l = vStart + fetch_add(c.child_count+v, ccount);\n  Incoherent<int64_t>::WO cChild(c.child+l, ccount, bufChild);\n}\n\nvoid bfs_push_visit_vertex(int64_t jstart, int64_t jiters) {\n  DVLOG(3) << \"visit_vertex< \" << jstart << \" -> \" << jstart+jiters << \" >\";\n  int64_t bufQ[jiters];\n  Incoherent<int64_t>::RO cQ(c.Q+jstart, jiters, bufQ);\n\n  for (int64_t j=0; j<jiters; j++) {\n    const int64_t v = cQ[j];\n    CHECK(v < g.numVertices) << v << \" < \" << g.numVertices;\n    \n    int64_t bufEdgeStart[2];\n    Incoherent<int64_t>::RO cr(g.edgeStart+v, 2, bufEdgeStart);\n\n    const graphint vstart = cr[0];\n    const graphint vend = cr[1];\n    CHECK(v < (1L<<32)) << \"can't pack 'v' into 32-bit value! have to get more creative\";\n    CHECK(vend < (1L<<32)) << \"can't pack 'vo' into 32-bit value! have to get more creative\";\n \n    nedge_traversed += vend - vstart;\n    DVLOG(3) << \"visit (\" << jstart+j << \"): \" << vstart << \" -> \" << vend;\n    async_parallel_for_hack(bfs_push_visit_neighbor, vstart, vend-vstart, v);\n  }\n}\n\nLOOP_FUNCTOR(bfs_push, nid, ((graphint,d_phase_)) ((int64_t,start)) ((int64_t,end))) {\n  d_phase = d_phase_;\n\n  Qbuf.setup(c.Q, c.Qnext);\n\n  global_async_parallel_for_thresh(bfs_push_visit_vertex, start, end-start, 1);  \n\n  Qbuf.flush();\n}\n\nvoid bfs_pop_children(int64_t kstart, int64_t kiters, GlobalAddress<void*> packed) {\n  int64_t v = (int64_t)packed.pointer();\n  int64_t sigma_v = read(c.sigma+v);\n  \n  graphint bufChildren[kiters];\n  Incoherent<graphint>::RO cChildren(c.child+kstart, kiters, bufChildren);\n\n  double sum = 0;\n\n  for (graphint k=0; k<kiters; k++) {\n    graphint w = cChildren[k];\n    sum += ((double)sigma_v) * (1.0 + read_double(c.delta+w)) \/ (double)read(c.sigma+w);\n  }\n  \n  DVLOG(4) << \"v(\" << v << \")[\" << kstart << \",\" << kstart+kiters << \"] sum: \" << sum;\n  ff_delegate_add(c.delta+v, sum);\n}\n\n\nvoid bfs_pop_vertex(int64_t jstart, int64_t jiters) {\n  DVLOG(3) << \"pop_vertex < \" << jstart << \" -> \" << jstart+jiters << \" >\";\n  int64_t bufQ[jiters];\n  Incoherent<int64_t>::RO cQ(c.Q+jstart, jiters, bufQ);\n\n  double sum = 0;\n  \n  for (int64_t j=0; j<jiters; j++) {\n    graphint v = cQ[j];\n    graphint myStart = read(g.edgeStart+v);\n    graphint myEnd   = myStart + read(c.child_count+v);\n  \n    nedge_traversed += myEnd-myStart;\n    DVLOG(4) << \"pop \" << v << \" (\" << jstart+j << \")\";\n    \n    async_parallel_for_hack(bfs_pop_children, myStart, myEnd-myStart, v);\n  }\n}\n\nvoid bc_add_delta(int64_t jstart, int64_t jiters) {\n  int64_t bufQ[jiters];\n  Incoherent<int64_t>::RO cQ(c.Q+jstart, jiters, bufQ);\n  for (int64_t j=0; j<jiters; j++) {\n    const graphint v = cQ[j];\n    \n    double d = read_double(c.delta+v);\n    DVLOG(4) << \"updating \" << v << \" (\" << jstart+j << \") <= \" << d;\n\n    ff_delegate_add(bc+v, d);\n  }\n}\n\nLOOP_FUNCTOR(bfs_pop, nid, ((graphint,start)) ((graphint,end)) ) {\n  \/\/TODO: consider adjusting threshold programmatically for different kinds of apf's...\n  global_async_parallel_for_thresh(bfs_pop_vertex, start, end-start, 1);\n  DVLOG(4) << \"###################\";\n  global_async_parallel_for_thresh(bc_add_delta, start, end-start, 1);\n}\n\nLOOP_FUNCTOR( initCentrality, nid, ((graph,g_)) ((CentralityScratch,s_)) ((GlobalAddress<double>,bc_)) ) {\n  nedge_traversed = 0;\n  g = g_;\n  c = s_;\n  bc = bc_;\n}\n\nLOOP_FUNCTOR( totalCentrality, v, ((GlobalAddress<double>,total)) ) {\n  ff_delegate_add(total, read_double(bc+v));\n}\n\nLOOP_FUNCTION( totalNedgeFunc, n ) {\n  nedge_traversed = Grappa_allreduce<int64_t,collective_add<int64_t>,0>(nedge_traversed);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Profiling stuff\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nLOOP_FUNCTION(func_enable_tau, nid) {\n  FLAGS_record_grappa_events = true;\n}\nLOOP_FUNCTION(func_enable_google_profiler, nid) {\n  Grappa_start_profiling();\n}\nstatic void enable_tau() {\n#ifdef GRAPPA_TRACE\n  VLOG(1) << \"Enabling TAU recording.\";\n  func_enable_tau f;\n  fork_join_custom(&f);\n#endif\n#ifdef GOOGLE_PROFILER\n  func_enable_google_profiler g;\n  fork_join_custom(&g);\n#else\n  Grappa_reset_stats_all_nodes();\n#endif\n}\nLOOP_FUNCTION(func_disable_tau, nid) {\n  FLAGS_record_grappa_events = false;\n}\nLOOP_FUNCTION(func_disable_google_profiler, nid) {\n  Grappa_stop_profiling();\n}\nstatic void disable_tau() {\n#ifdef GRAPPA_TRACE\n  VLOG(1) << \"Disabling TAU recording.\";\n  func_disable_tau f;\n  fork_join_custom(&f);\n#endif\n#ifdef GOOGLE_PROFILER\n  func_disable_google_profiler g;\n  fork_join_custom(&g);\n#else\n  Grappa_merge_and_dump_stats();\n  Grappa_reset_stats_all_nodes();\n#endif\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/\/ Computes the approximate vertex betweenness centrality on an unweighted\n\/\/\/ graph using 'Vs' source vertices. Returns the average centrality.\ndouble centrality(graph *g, GlobalAddress<double> bc, graphint Vs,\n    \/* outputs: *\/ double * avg_centrality = NULL, int64_t * total_nedge = NULL) {\n  graphint Qnext;\n\n  bool computeAllVertices = (Vs == g->numVertices);\n  \n  graphint QHead[100 * SCALE];\n  \n  c.delta       = Grappa_typed_malloc<double>  (g->numVertices);\n  c.dist        = Grappa_typed_malloc<graphint>(g->numVertices);\n  c.Q           = Grappa_typed_malloc<graphint>(g->numVertices);\n  c.sigma       = Grappa_typed_malloc<graphint>(g->numVertices);\n  c.marks       = Grappa_typed_malloc<graphint>(g->numVertices+2);\n  c.child       = Grappa_typed_malloc<graphint>(g->numEdges);\n  c.child_count = Grappa_typed_malloc<graphint>(g->numVertices);\n  if (!computeAllVertices) c.explored = Grappa_typed_malloc<graphint>(g->numVertices);\n  c.Qnext       = make_global(&Qnext);\n  \n  double t; t = timer();\n  double rngtime, tt;\n\n  enable_tau();\n\n  {\n    initCentrality f(*g, c, bc); fork_join_custom(&f);\n  }\n  \n  Grappa_memset(bc, 0.0, g->numVertices);\n  if (!computeAllVertices) Grappa_memset(c.explored, (graphint)0L, g->numVertices);\n  \n  \/\/srand(12345);\n  mersenne_seed(12345);\n\n  graphint nQ, d_phase, Qstart, Qend;\n  \n  for (graphint x = 0; (x < g->numVertices) && (Vs > 0); x++) {\n    \/\/\/ Choose vertex at random\n    graphint s;\n    tt = timer();\n    if (computeAllVertices) {\n      s = x;\n    } else {\n      do {\n        s = mersenne_rand() % g->numVertices;\n        VLOG(1) << \"s (\" << s << \")\";\n      } while (!cmp_swap(c.explored+s, 0, 1));\n    }\n    rngtime += timer() - tt;\n    \n    graphint pair_[2];\n    Incoherent<graphint>::RO pair(g->edgeStart+s, 2, pair_);\n    \n    VLOG(1) << \"degree (\" << pair[1]-pair[0] << \")\";\n\n    if (pair[0] == pair[1]) {\n      continue;\n    } else {\n      Vs--;\n    }\n    \n    VLOG(3) << \"s = \" << s;\n    \n    Grappa_memset(c.dist,       (graphint)-1, g->numVertices);\n    Grappa_memset(c.sigma,      (graphint) 0, g->numVertices);\n    Grappa_memset(c.marks,      (graphint) 0, g->numVertices);\n    Grappa_memset(c.child_count,(graphint) 0, g->numVertices);\n    Grappa_memset(c.delta,        (double) 0, g->numVertices);\n    \n    \/\/ Push node i onto Q and set bounds for first Q sublist\n    write(c.Q+0, s);\n    Qnext = 1;\n    nQ = 1;\n    QHead[0] = 0;\n    QHead[1] = 1;\n    write(c.dist+s, 0);\n    write(c.marks+s, 1);\n    write(c.sigma+s, 1);\n\n  PushOnStack: \/\/ push nodes onto Q\n    \n    \/\/ Execute the nested loop for each node v on the Q AND\n    \/\/ for each neighbor w of v whose edge weight is not divisible by 8\n    d_phase = nQ;\n    Qstart = QHead[nQ-1];\n    Qend = QHead[nQ];\n    DVLOG(1) << \"pushing d_phase(\" << d_phase << \") \" << Qstart << \" -> \" << Qend;\n    {\n      bfs_push f(d_phase, Qstart, Qend); fork_join_custom(&f);\n    }\n    \n    \/\/ If new nodes pushed onto Q\n    if (Qnext != QHead[nQ]) {\n      nQ++;\n      QHead[nQ] = Qnext; \n      goto PushOnStack;\n    }\n    \n    \/\/ Dependence accumulation phase\n    nQ--;\n    VLOG(3) << \"nQ = \" << nQ;\n    \n\/\/    {\n\/\/      std::stringstream ss;\n\/\/      ss << \"sigma = [\";\n\/\/      for (graphint i=0; i<g->numVertices; i++) ss << \" \" << read(c.sigma+i);\n\/\/      ss << \" ]\";\n\/\/      VLOG(1) << ss.str();\n\/\/    } \n    Grappa_memset(c.delta, 0.0, g->numVertices);\n    \n    \/\/ Pop nodes off of Q in the reverse order they were pushed on\n    for ( ; nQ > 1; nQ--) {\n      Qstart = QHead[nQ-1];\n      Qend = QHead[nQ];\n      \n      {\n        bfs_pop f(Qstart, Qend); fork_join_custom(&f);\n      }\n      \/\/VLOG(1) << \"-----------------------\";\n      \/\/for (int64_t i=0; i<g->numVertices; i++) {\n      \/\/  VLOG(1) << \"bc[\" << i << \"] = \" << read_double(bc+i);\n      \/\/}\n    }\n\/\/    {\n\/\/      std::stringstream ss;\n\/\/      ss << \"bc = [\";\n\/\/      for (graphint i=0; i<g->numVertices; i++) ss << \" \" << read_double(bc+i);\n\/\/      ss << \" ]\";\n\/\/      VLOG(1) << ss.str();\n\/\/    }\n\/\/    VLOG(1) << \"bc[\" << 12 << \"] = \" << read_double(bc+12);\n  } \/\/ end for(x=0; x<NV && Vs>0)\n    \n  t = timer() - t;\n  disable_tau();\n\n  VLOG(1) << \"centrality rngtime = \" << rngtime;\n\n  Grappa_free(c.delta);\n  Grappa_free(c.dist);\n  Grappa_free(c.Q);\n  Grappa_free(c.sigma);\n  Grappa_free(c.marks);\n  Grappa_free(c.child);\n  Grappa_free(c.child_count);\n  Grappa_free(c.explored);\n\n  double bc_total = 0;\n  {\n    totalCentrality f(make_global(&bc_total)); fork_join(&f, 0, g->numVertices);\n  }\n  { totalNedgeFunc f; fork_join_custom(&f); }\n\n  VLOG(2) << \"nedge_traversed: \" << nedge_traversed;\n\n  if (avg_centrality != NULL) *avg_centrality = bc_total \/ g->numVertices;\n  if (total_nedge != NULL) *total_nedge = nedge_traversed;\n  return t;\n}\n<commit_msg>Port Centrality.<commit_after>\/\/ Originally from GraphCT, version 0.6.0\n\/\/ License: GeorgiaTech\n\n#include \"defs.hpp\"\n#include <Grappa.hpp>\n#include <ForkJoin.hpp>\n#include <GlobalAllocator.hpp>\n#include <Delegate.hpp>\n#include <AsyncDelegate.hpp>\n#include <Collective.hpp>\n#include <common.hpp>\n#include <Cache.hpp>\n#include <GlobalTaskJoiner.hpp>\n#include <PushBuffer.hpp>\n#include <Array.hpp>\n#include <Statistics.hpp>\n\n#include \"..\/compat\/mersenne.h\"\n\nusing namespace Grappa;\n\nstatic inline double read_double(GlobalAddress<double> addr) {\n  int64_t temp = Grappa_delegate_read_word(addr);\n  return *reinterpret_cast<double*>(&temp);\n}\n\nstruct CentralityScratch {\n  GlobalAddress<double> delta;\n  GlobalAddress<graphint> dist, Q, sigma, marks, child, child_count, explored,\n                          Qnext;\n};\n\nstatic LocalTaskJoiner joiner;\n\nstatic graph g;\nstatic CentralityScratch c;\nstatic GlobalAddress<double> bc;\nstatic graphint d_phase;\nstatic graphint local_Qnext;\n\nstatic double local_centrality_total;\n\nstatic int64_t nedge_traversed;\n\nstatic PushBuffer<int64_t> Qbuf;\n\nvoid do_bfs_push(graphint d_phase_, int64_t start, int64_t end) {\n  \n  call_on_all_cores([d_phase_]{\n    Qbuf.setup(c.Q, c.Qnext);\n    d_phase = d_phase_;\n  });\n\n  forall_localized(c.Q+start, end-start, [](int64_t i, graphint& v){\n    CHECK(v < g.numVertices) << v << \" < \" << g.numVertices;\n    \n    int64_t bufEdgeStart[2];\n    Incoherent<int64_t>::RO cr(g.edgeStart+v, 2, bufEdgeStart);\n\n    const graphint vstart = cr[0];\n    const graphint vend = cr[1];\n    CHECK(v < (1L<<32)) << \"can't pack 'v' into 32-bit value! have to get more creative\";\n    CHECK(vend < (1L<<32)) << \"can't pack 'vo' into 32-bit value! have to get more creative\";\n \n    nedge_traversed += vend - vstart;\n    DVLOG(3) << \"visit (\" << i << \"): \" << vstart << \" -> \" << vend;\n    \/\/ async_parallel_for_hack(bfs_push_visit_neighbor, vstart, vend-vstart, v);\n    forall_localized(g.endVertex+vstart, vend-vstart,\n                    [v](int64_t kstart, int64_t kiters, int64_t * kfirst) {\n      DVLOG(3) << \"neighbors \" << v << \": \" << kstart << \" -> \" << kstart+kiters;\n\n      \/\/ TODO: overlap these\n      graphint sigmav = delegate::read(c.sigma+v);\n      graphint vStart = delegate::read(g.edgeStart+v);\n  \n      graphint ccount = 0;\n      graphint bufChild[kiters];\n      \n      char pool_buf[2 * kiters * sizeof(delegate::write_msg_proxy<graphint>)];\n      MessagePool pool(pool_buf, sizeof(pool_buf));\n      \n      for (int64_t k=0; k<kiters; k++) {\n        graphint w = kfirst[k];\n        graphint d = delegate::read(c.dist+w);\n    \n        \/* If node has not been visited, set distance and push on Q (but only once) *\/\n        if (d < 0) {\n          if (delegate::compare_and_swap(c.marks+w, 0, 1)) {\n            delegate::write_async(pool, c.dist+w, d_phase);\n            \/\/write(c.Q + fetch_add(c.Qnext, 1), w);\n            Qbuf.push(w);\n          }\n        }\n        if (d < 0 || d == d_phase) {\n          delegate::increment_async(pool, c.sigma+w, sigmav);\n          bufChild[ccount++] = w;\n        }\n      }\n      \/\/ TODO: find out if it makes sense to buffer these\n      graphint l = vStart + delegate::fetch_and_add(c.child_count+v, ccount);\n      Incoherent<int64_t>::WO cChild(c.child+l, ccount, bufChild);\n    });\n  });\n\n  on_all_cores([] { Qbuf.flush(); });\n}\n\nvoid do_bfs_pop(graphint start, graphint end) {\n  \/\/ global_async_parallel_for_thresh(bfs_pop_vertex, start, end-start, 1);\n  forall_localized(c.Q+start, end-start, [](int64_t i, graphint& v){\n    \/\/ TODO: overlap reads\n    graphint myStart = delegate::read(g.edgeStart+v);\n    graphint myEnd   = myStart + delegate::read(c.child_count+v);\n  \n    nedge_traversed += myEnd-myStart;\n    DVLOG(4) << \"pop \" << v << \" (\" << i << \")\";\n    \n    \/\/ pop children\n    \/\/ async_parallel_for_hack(bfs_pop_children, myStart, myEnd-myStart, v);\n    forall_localized_async(c.child+myStart, myEnd-myStart,\n        [v](int64_t kstart, int64_t kiters, graphint * kchildren){\n      char pool_buf[sizeof(delegate::write_msg_proxy<double>)];\n      MessagePool pool(pool_buf, sizeof(pool_buf));\n      \n      int64_t sigma_v = delegate::read(c.sigma+v);\n\n      double sum = 0;\n\n      for (graphint k=0; k<kiters; k++) {\n        graphint w = kchildren[k];\n        \/\/ TODO: overlap\n        sum += ((double)sigma_v) * (1.0 + delegate::read(c.delta+w)) \/ (double)delegate::read(c.sigma+w);\n      }\n  \n      DVLOG(4) << \"v(\" << v << \")[\" << kstart << \",\" << kstart+kiters << \"] sum: \" << sum;\n      \/\/ TODO: maybe shared pool so we don't have to block on sending message?\n      delegate::increment_async(pool, c.delta+v, sum);\n    });\n  });\n  \n  DVLOG(4) << \"###################\";\n  \/\/ global_async_parallel_for_thresh(bc_add_delta, start, end-start, 1);\n  forall_localized(c.Q+start, end-start, [](int64_t jstart, int64_t jiters, graphint * cQ){\n    char pool_buf[jiters * sizeof(delegate::write_msg_proxy<graphint>)];\n    MessagePool pool(pool_buf, sizeof(pool_buf));\n    \n    for (int64_t j=0; j<jiters; j++) {\n      const graphint v = cQ[j];\n      \n      double d = delegate::read(c.delta+v);\n      DVLOG(4) << \"updating \" << v << \" (\" << jstart+j << \") <= \" << d;\n\n      delegate::increment_async(pool, bc+v, d);\n    }\n  });\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Profiling stuff\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstatic void enable_tau() {\n#ifdef GRAPPA_TRACE\n  VLOG(1) << \"Enabling TAU recording.\";\n  call_on_all_cores([]{ FLAGS_record_grappa_events = true; });\n#endif\n#ifdef GOOGLE_PROFILER\n  call_on_all_cores([]{ Grappa_start_profiling(); });\n#else\n  call_on_all_cores([]{ Statistics::reset(); });\n#endif\n}\nstatic void disable_tau() {\n#ifdef GRAPPA_TRACE\n  VLOG(1) << \"Disabling TAU recording.\";\n  call_on_all_cores([]{ FLAGS_record_grappa_events = false; });\n#endif\n#ifdef GOOGLE_PROFILER\n  call_on_all_cores([]{ Grappa_stop_profiling(); });\n#else\n  Statistics::merge_and_print();\n  call_on_all_cores([]{ Statistics::reset(); });\n#endif\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/\/ Computes the approximate vertex betweenness centrality on an unweighted\n\/\/\/ graph using 'Vs' source vertices. Returns the average centrality.\ndouble centrality(graph *g_in, GlobalAddress<double> bc_in, graphint Vs,\n    \/* outputs: *\/ double * avg_centrality = NULL, int64_t * total_nedge = NULL) {\n  graphint Qnext;\n\n  bool computeAllVertices = (Vs == g_in->numVertices);\n  \n  graphint QHead[100 * SCALE];\n  \n  c.delta       = Grappa_typed_malloc<double>  (g_in->numVertices);\n  c.dist        = Grappa_typed_malloc<graphint>(g_in->numVertices);\n  c.Q           = Grappa_typed_malloc<graphint>(g_in->numVertices);\n  c.sigma       = Grappa_typed_malloc<graphint>(g_in->numVertices);\n  c.marks       = Grappa_typed_malloc<graphint>(g_in->numVertices+2);\n  c.child       = Grappa_typed_malloc<graphint>(g_in->numEdges);\n  c.child_count = Grappa_typed_malloc<graphint>(g_in->numVertices);\n  if (!computeAllVertices) c.explored = Grappa_typed_malloc<graphint>(g_in->numVertices);\n  c.Qnext       = make_global(&Qnext);\n  \n  double t; t = timer();\n  double rngtime, tt;\n\n  enable_tau();\n\n  { \/\/ initialize globals on all cores\n    auto _g = *g_in;\n    auto _c = c;\n    call_on_all_cores([_g,_c,bc_in]{\n      nedge_traversed = 0;\n      g = _g;\n      c = _c;\n      bc = bc_in;\n    });\n  }\n  \n  Grappa::memset(bc, 0.0, g.numVertices);\n  if (!computeAllVertices) Grappa::memset(c.explored, (graphint)0L, g.numVertices);\n  \n  mersenne_seed(12345);\n\n  graphint nQ, d_phase, Qstart, Qend;\n  \n  for (graphint x = 0; (x < g.numVertices) && (Vs > 0); x++) {\n    \/\/\/ Choose vertex at random\n    graphint s;\n    tt = timer();\n    if (computeAllVertices) {\n      s = x;\n    } else {\n      do {\n        s = mersenne_rand() % g.numVertices;\n        VLOG(1) << \"s (\" << s << \")\";\n      } while (!delegate::compare_and_swap(c.explored+s, 0, 1));\n    }\n    rngtime += timer() - tt;\n    \n    graphint pair_[2];\n    Incoherent<graphint>::RO pair(g.edgeStart+s, 2, pair_);\n    \n    VLOG(1) << \"degree (\" << pair[1]-pair[0] << \")\";\n\n    if (pair[0] == pair[1]) {\n      continue;\n    } else {\n      Vs--;\n    }\n    \n    VLOG(3) << \"s = \" << s;\n    \n    Grappa::memset(c.dist,       (graphint)-1, g.numVertices);\n    Grappa::memset(c.sigma,      (graphint) 0, g.numVertices);\n    Grappa::memset(c.marks,      (graphint) 0, g.numVertices);\n    Grappa::memset(c.child_count,(graphint) 0, g.numVertices);\n    Grappa::memset(c.delta,        (double) 0, g.numVertices);\n    \n    \/\/ Push node i onto Q and set bounds for first Q sublist\n    delegate::write(c.Q+0, s);\n    Qnext = 1;\n    nQ = 1;\n    QHead[0] = 0;\n    QHead[1] = 1;\n    delegate::write(c.dist+s, 0);\n    delegate::write(c.marks+s, 1);\n    delegate::write(c.sigma+s, 1);\n\n  PushOnStack: \/\/ push nodes onto Q\n    \n    \/\/ Execute the nested loop for each node v on the Q AND\n    \/\/ for each neighbor w of v whose edge weight is not divisible by 8\n    d_phase = nQ;\n    Qstart = QHead[nQ-1];\n    Qend = QHead[nQ];\n    DVLOG(1) << \"pushing d_phase(\" << d_phase << \") \" << Qstart << \" -> \" << Qend;\n    do_bfs_push(d_phase, Qstart, Qend);\n    \n    \/\/ If new nodes pushed onto Q\n    if (Qnext != QHead[nQ]) {\n      nQ++;\n      QHead[nQ] = Qnext; \n      goto PushOnStack;\n    }\n    \n    \/\/ Dependence accumulation phase\n    nQ--;\n    VLOG(3) << \"nQ = \" << nQ;\n    \n\/\/    {\n\/\/      std::stringstream ss;\n\/\/      ss << \"sigma = [\";\n\/\/      for (graphint i=0; i<g->numVertices; i++) ss << \" \" << read(c.sigma+i);\n\/\/      ss << \" ]\";\n\/\/      VLOG(1) << ss.str();\n\/\/    } \n    Grappa::memset(c.delta, 0.0, g.numVertices);\n    \n    \/\/ Pop nodes off of Q in the reverse order they were pushed on\n    for ( ; nQ > 1; nQ--) {\n      Qstart = QHead[nQ-1];\n      Qend = QHead[nQ];\n      \n      do_bfs_pop(Qstart, Qend);\n      \/\/VLOG(1) << \"-----------------------\";\n      \/\/for (int64_t i=0; i<g->numVertices; i++) {\n      \/\/  VLOG(1) << \"bc[\" << i << \"] = \" << read_double(bc+i);\n      \/\/}\n    }\n\/\/    {\n\/\/      std::stringstream ss;\n\/\/      ss << \"bc = [\";\n\/\/      for (graphint i=0; i<g->numVertices; i++) ss << \" \" << read_double(bc+i);\n\/\/      ss << \" ]\";\n\/\/      VLOG(1) << ss.str();\n\/\/    }\n\/\/    VLOG(1) << \"bc[\" << 12 << \"] = \" << read_double(bc+12);\n  } \/\/ end for(x=0; x<NV && Vs>0)\n    \n  t = timer() - t;\n  disable_tau();\n\n  VLOG(1) << \"centrality rngtime = \" << rngtime;\n\n  Grappa_free(c.delta);\n  Grappa_free(c.dist);\n  Grappa_free(c.Q);\n  Grappa_free(c.sigma);\n  Grappa_free(c.marks);\n  Grappa_free(c.child);\n  Grappa_free(c.child_count);\n  Grappa_free(c.explored);\n\n  double bc_total = 0;\n  Core origin = mycore();\n  \/\/ TODO: use array reduction op, or mutable \"forall_localized\"-held state\n  on_all_cores([bc, &bc_total, origin]{\n    auto b = bc.localize();\n    auto local_end  = (bc+g.numVertices).localize();\n    double sum = 0.0;\n    for (; b < local_end; b++) { sum += *b; }\n    sum = allreduce<double,collective_add>(sum);\n    if (mycore() == origin) bc_total = sum;\n  });\n  nedge_traversed = reduce<int64_t,collective_add>(&nedge_traversed);\n\n  VLOG(2) << \"nedge_traversed: \" << nedge_traversed;\n\n  if (avg_centrality != NULL) *avg_centrality = bc_total \/ g.numVertices;\n  if (total_nedge != NULL) *total_nedge = nedge_traversed;\n  return t;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2017 Advanced Micro Devices, Inc. All rights reserved.\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\n#ifndef ROCPRIM_DEVICE_DETAIL_DEVICE_SCAN_REDUCE_THEN_SCAN_HPP_\n#define ROCPRIM_DEVICE_DETAIL_DEVICE_SCAN_REDUCE_THEN_SCAN_HPP_\n\n#include <type_traits>\n#include <iterator>\n\n\/\/ HIP API\n#include <hip\/hip_runtime.h>\n#include <hip\/hip_hcc.h>\n\n#include \"..\/..\/detail\/config.hpp\"\n#include \"..\/..\/detail\/various.hpp\"\n\n#include \"..\/..\/intrinsics.hpp\"\n#include \"..\/..\/functional.hpp\"\n#include \"..\/..\/types.hpp\"\n\n#include \"..\/..\/block\/block_load.hpp\"\n#include \"..\/..\/block\/block_store.hpp\"\n#include \"..\/..\/block\/block_scan.hpp\"\n#include \"..\/..\/block\/block_reduce.hpp\"\n\n\nBEGIN_ROCPRIM_NAMESPACE\n\nnamespace detail\n{\n\n\/\/ Helper functions for performing exclusive or inclusive\n\/\/ block scan in single_scan.\ntemplate<\n    bool Exclusive,\n    class BlockScan,\n    class T,\n    class InitValueType,\n    unsigned int ItemsPerThread,\n    class BinaryFunction\n>\nauto single_scan_block_scan(T (&input)[ItemsPerThread],\n                            T (&output)[ItemsPerThread],\n                            InitValueType initial_value,\n                            typename BlockScan::storage_type& storage,\n                            BinaryFunction scan_op) [[hc]]\n    -> typename std::enable_if<Exclusive>::type\n{\n    BlockScan()\n        .exclusive_scan(\n            input, \/\/ input\n            output, \/\/ output\n            initial_value,\n            storage,\n            scan_op\n        );\n}\n\ntemplate<\n    bool Exclusive,\n    class BlockScan,\n    class T,\n    class InitValueType,\n    unsigned int ItemsPerThread,\n    class BinaryFunction\n>\nauto single_scan_block_scan(T (&input)[ItemsPerThread],\n                            T (&output)[ItemsPerThread],\n                            InitValueType initial_value,\n                            typename BlockScan::storage_type& storage,\n                            BinaryFunction scan_op) [[hc]]\n    -> typename std::enable_if<!Exclusive>::type\n{\n    (void) initial_value;\n    BlockScan()\n        .inclusive_scan(\n            input, \/\/ input\n            output, \/\/ output\n            storage,\n            scan_op\n        );\n}\n\ntemplate<\n    unsigned int BlockSize,\n    unsigned int ItemsPerThread,\n    bool Exclusive,\n    class InputIterator,\n    class OutputIterator,\n    class BinaryFunction,\n    class InitValueType\n>\nvoid single_scan_kernel_impl(InputIterator input,\n                             const size_t input_size,\n                             InitValueType initial_value,\n                             OutputIterator output,\n                             BinaryFunction scan_op) [[hc]]\n{\n    using output_type = typename std::iterator_traits<OutputIterator>::value_type;\n\n    using block_load_type = ::rocprim::block_load<\n        output_type, BlockSize, ItemsPerThread,\n        ::rocprim::block_load_method::block_load_transpose\n    >;\n    using block_store_type = ::rocprim::block_store<\n        output_type, BlockSize, ItemsPerThread,\n        ::rocprim::block_store_method::block_store_transpose\n    >;\n    using block_scan_type = ::rocprim::block_scan<\n        output_type, BlockSize,\n        ::rocprim::block_scan_algorithm::reduce_then_scan\n    >;\n\n    __shared__ union\n    {\n        typename block_load_type::storage_type load;\n        typename block_store_type::storage_type store;\n        typename block_scan_type::storage_type scan;\n    } storage;\n\n    output_type values[ItemsPerThread];\n    \/\/ load input values into values\n    block_load_type()\n        .load(\n            input,\n            values,\n            input_size,\n            storage.load\n        );\n    ::rocprim::syncthreads(); \/\/ sync threads to reuse shared memory\n\n    single_scan_block_scan<Exclusive, block_scan_type>(\n        values, \/\/ input\n        values, \/\/ output\n        initial_value,\n        storage.scan,\n        scan_op\n    );\n    ::rocprim::syncthreads(); \/\/ sync threads to reuse shared memory\n\n    \/\/ Save values into output array\n    block_store_type()\n        .store(\n            output,\n            values,\n            input_size,\n            storage.store\n        );\n}\n\n\/\/ Calculates block prefixes that will be used in final_scan\n\/\/ when performing block scan operations.\ntemplate<\n    unsigned int BlockSize,\n    unsigned int ItemsPerThread,\n    class InputIterator,\n    class BinaryFunction,\n    class ScanOpResultType\n>\nvoid block_reduce_kernel_impl(InputIterator input,\n                              const size_t input_size,\n                              BinaryFunction scan_op,\n                              ScanOpResultType * block_prefixes) [[hc]]\n{\n    using input_type = typename std::iterator_traits<InputIterator>::value_type;\n\n    using block_reduce_type = ::rocprim::block_reduce<\n        input_type, BlockSize,\n        ::rocprim::block_reduce_algorithm::using_warp_reduce\n    >;\n    __shared__ typename block_reduce_type::storage_type reduce_storage;\n\n    \/\/ It's assumed kernel is executed in 1D\n    const unsigned int flat_id = ::rocprim::block_thread_id(0);\n    const unsigned int flat_block_id = ::rocprim::block_id(0);\n\n    const unsigned int block_offset = flat_block_id * ItemsPerThread * BlockSize;\n    constexpr unsigned int items_per_block = BlockSize * ItemsPerThread;\n    \/\/ TODO: number_of_blocks can be calculated on host\n    const unsigned int number_of_blocks = (input_size + items_per_block - 1)\/items_per_block;\n\n    \/\/ For input values\n    input_type values[ItemsPerThread];\n\n    input_type block_prefix;\n    \/\/ TODO: valid_in_last_block can be calculated on host\n    auto valid_in_last_block = input_size - items_per_block * (number_of_blocks - 1);\n    \/\/ load input values into values\n    if(flat_block_id == (number_of_blocks - 1)) \/\/ last block\n    {\n        block_load_direct_striped<BlockSize>(\n            flat_id,\n            input + block_offset,\n            values,\n            valid_in_last_block\n        );\n    }\n    else\n    {\n        block_load_direct_striped<BlockSize>(\n            flat_id,\n            input + block_offset,\n            values\n        );\n    }\n\n    block_reduce_type()\n        .reduce(\n            values, \/\/ input\n            block_prefix, \/\/ output\n            reduce_storage,\n            scan_op\n        );\n\n    \/\/ Save block prefix\n    if(flat_id == 0)\n    {\n        block_prefixes[flat_block_id] = block_prefix;\n    }\n}\n\n\/\/ Helper functions for performing exclusive or inclusive\n\/\/ block scan operation in final_scan\ntemplate<\n    bool Exclusive,\n    class BlockScan,\n    class T,\n    unsigned int ItemsPerThread,\n    class InitValueType,\n    class ScanOpResultType,\n    class BinaryFunction\n>\nauto final_scan_block_scan(const unsigned int flat_block_id,\n                           T (&input)[ItemsPerThread],\n                           T (&output)[ItemsPerThread],\n                           InitValueType initial_value,\n                           ScanOpResultType * block_prefixes,\n                           typename BlockScan::storage_type& storage,\n                           BinaryFunction scan_op) [[hc]]\n    -> typename std::enable_if<Exclusive>::type\n{\n    if(flat_block_id == 0)\n    {\n        BlockScan()\n            .exclusive_scan(\n                input, \/\/ input\n                output, \/\/ output\n                initial_value,\n                storage,\n                scan_op\n            );\n    }\n    else\n    {\n        \/\/ Include initial value in block prefix\n        initial_value = scan_op(\n            initial_value, block_prefixes[flat_block_id - 1]\n        );\n        BlockScan()\n            .exclusive_scan(\n                input, \/\/ input\n                output, \/\/ output\n                initial_value,\n                storage,\n                scan_op\n            );\n    }\n}\n\ntemplate<\n    bool Exclusive,\n    class BlockScan,\n    class T,\n    unsigned int ItemsPerThread,\n    class InitValueType,\n    class ScanOpResultType,\n    class BinaryFunction\n>\nauto final_scan_block_scan(const unsigned int flat_block_id,\n                           T (&input)[ItemsPerThread],\n                           T (&output)[ItemsPerThread],\n                           InitValueType initial_value,\n                           ScanOpResultType * block_prefixes,\n                           typename BlockScan::storage_type& storage,\n                           BinaryFunction scan_op) [[hc]]\n    -> typename std::enable_if<!Exclusive>::type\n{\n    if(flat_block_id == 0)\n    {\n        (void) initial_value;\n        BlockScan()\n            .inclusive_scan(\n                input, \/\/ input\n                output, \/\/ output\n                storage,\n                scan_op\n            );\n    }\n    else\n    {\n        auto block_prefix_op =\n            [&block_prefixes, &flat_block_id](const T& \/*not used*\/)\n            {\n                return block_prefixes[flat_block_id - 1];\n            };\n        BlockScan()\n            .inclusive_scan(\n                input, \/\/ input\n                output, \/\/ output\n                storage,\n                block_prefix_op,\n                scan_op\n            );\n    }\n}\n\ntemplate<\n    unsigned int BlockSize,\n    unsigned int ItemsPerThread,\n    bool Exclusive,\n    class InputIterator,\n    class OutputIterator,\n    class BinaryFunction,\n    class InitValueType,\n    class ScanOpResultType\n>\nvoid final_scan_kernel_impl(InputIterator input,\n                            const size_t input_size,\n                            OutputIterator output,\n                            const InitValueType initial_value,\n                            BinaryFunction scan_op,\n                            ScanOpResultType * block_prefixes) [[hc]]\n{\n    using output_type = typename std::iterator_traits<OutputIterator>::value_type;\n\n    using block_load_type = ::rocprim::block_load<\n        output_type, BlockSize, ItemsPerThread,\n        ::rocprim::block_load_method::block_load_transpose\n    >;\n    using block_store_type = ::rocprim::block_store<\n        output_type, BlockSize, ItemsPerThread,\n        ::rocprim::block_store_method::block_store_transpose\n    >;\n    using block_scan_type = ::rocprim::block_scan<\n        output_type, BlockSize,\n        ::rocprim::block_scan_algorithm::using_warp_scan\n    >;\n\n    __shared__ union\n    {\n        typename block_load_type::storage_type load;\n        typename block_store_type::storage_type store;\n        typename block_scan_type::storage_type scan;\n    } storage;\n\n    \/\/ It's assumed kernel is executed in 1D\n    const unsigned int flat_block_id = ::rocprim::block_id(0);\n\n    constexpr unsigned int items_per_block = BlockSize * ItemsPerThread;\n    const unsigned int block_offset = flat_block_id * items_per_block;\n    \/\/ TODO: number_of_blocks can be calculated on host\n    const unsigned int number_of_blocks = (input_size + items_per_block - 1)\/items_per_block;\n\n    \/\/ For input values\n    output_type values[ItemsPerThread];\n\n    \/\/ TODO: valid_in_last_block can be calculated on host\n    auto valid_in_last_block = input_size - items_per_block * (number_of_blocks - 1);\n    \/\/ load input values into values\n    if(flat_block_id == (number_of_blocks - 1)) \/\/ last block\n    {\n        block_load_type()\n            .load(\n                input + block_offset,\n                values,\n                valid_in_last_block,\n                storage.load\n            );\n    }\n    else\n    {\n        block_load_type()\n            .load(\n                input + block_offset,\n                values,\n                storage.load\n            );\n    }\n\n    final_scan_block_scan<Exclusive, block_scan_type>(\n        flat_block_id,\n        values, \/\/ input\n        values, \/\/ output\n        initial_value,\n        block_prefixes,\n        storage.scan,\n        scan_op\n    );\n\n    \/\/ Save values into output array\n    if(flat_block_id == (number_of_blocks - 1)) \/\/ last block\n    {\n        block_store_type()\n            .store(\n                output + block_offset,\n                values,\n                valid_in_last_block,\n                storage.store\n            );\n    }\n    else\n    {\n        block_store_type()\n            .store(\n                output + block_offset,\n                values,\n                storage.store\n            );\n    }\n}\n\n\/\/ Returns size of temporary storage in bytes.\ntemplate<class T>\nsize_t get_temporary_storage_bytes(size_t input_size,\n                                   size_t items_per_block)\n{\n    if(input_size <= items_per_block)\n    {\n        return 0;\n    }\n    auto size = (input_size + items_per_block - 1)\/(items_per_block);\n    return size * sizeof(T) + get_temporary_storage_bytes<T>(size, items_per_block);\n}\n\n} \/\/ end of detail namespace\n\nEND_ROCPRIM_NAMESPACE\n\n#endif \/\/ ROCPRIM_DEVICE_DETAIL_DEVICE_SCAN_REDUCE_THEN_SCAN_HPP_\n<commit_msg>Better support for differnt types in input\/output for device_scan_*<commit_after>\/\/ Copyright (c) 2017 Advanced Micro Devices, Inc. All rights reserved.\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\n#ifndef ROCPRIM_DEVICE_DETAIL_DEVICE_SCAN_REDUCE_THEN_SCAN_HPP_\n#define ROCPRIM_DEVICE_DETAIL_DEVICE_SCAN_REDUCE_THEN_SCAN_HPP_\n\n#include <type_traits>\n#include <iterator>\n\n\/\/ HIP API\n#include <hip\/hip_runtime.h>\n#include <hip\/hip_hcc.h>\n\n#include \"..\/..\/detail\/config.hpp\"\n#include \"..\/..\/detail\/various.hpp\"\n\n#include \"..\/..\/intrinsics.hpp\"\n#include \"..\/..\/functional.hpp\"\n#include \"..\/..\/types.hpp\"\n\n#include \"..\/..\/block\/block_load.hpp\"\n#include \"..\/..\/block\/block_store.hpp\"\n#include \"..\/..\/block\/block_scan.hpp\"\n#include \"..\/..\/block\/block_reduce.hpp\"\n\n\nBEGIN_ROCPRIM_NAMESPACE\n\nnamespace detail\n{\n\n\/\/ Helper functions for performing exclusive or inclusive\n\/\/ block scan in single_scan.\ntemplate<\n    bool Exclusive,\n    class BlockScan,\n    class T,\n    class InitValueType,\n    unsigned int ItemsPerThread,\n    class BinaryFunction\n>\nauto single_scan_block_scan(T (&input)[ItemsPerThread],\n                            T (&output)[ItemsPerThread],\n                            InitValueType initial_value,\n                            typename BlockScan::storage_type& storage,\n                            BinaryFunction scan_op) [[hc]]\n    -> typename std::enable_if<Exclusive>::type\n{\n    BlockScan()\n        .exclusive_scan(\n            input, \/\/ input\n            output, \/\/ output\n            initial_value,\n            storage,\n            scan_op\n        );\n}\n\ntemplate<\n    bool Exclusive,\n    class BlockScan,\n    class T,\n    class InitValueType,\n    unsigned int ItemsPerThread,\n    class BinaryFunction\n>\nauto single_scan_block_scan(T (&input)[ItemsPerThread],\n                            T (&output)[ItemsPerThread],\n                            InitValueType initial_value,\n                            typename BlockScan::storage_type& storage,\n                            BinaryFunction scan_op) [[hc]]\n    -> typename std::enable_if<!Exclusive>::type\n{\n    (void) initial_value;\n    BlockScan()\n        .inclusive_scan(\n            input, \/\/ input\n            output, \/\/ output\n            storage,\n            scan_op\n        );\n}\n\ntemplate<\n    unsigned int BlockSize,\n    unsigned int ItemsPerThread,\n    bool Exclusive,\n    class InputIterator,\n    class OutputIterator,\n    class BinaryFunction,\n    class InitValueType\n>\nvoid single_scan_kernel_impl(InputIterator input,\n                             const size_t input_size,\n                             InitValueType initial_value,\n                             OutputIterator output,\n                             BinaryFunction scan_op) [[hc]]\n{\n    using output_type = typename std::iterator_traits<OutputIterator>::value_type;\n\n    using block_load_type = ::rocprim::block_load<\n        output_type, BlockSize, ItemsPerThread,\n        ::rocprim::block_load_method::block_load_transpose\n    >;\n    using block_store_type = ::rocprim::block_store<\n        output_type, BlockSize, ItemsPerThread,\n        ::rocprim::block_store_method::block_store_transpose\n    >;\n    using block_scan_type = ::rocprim::block_scan<\n        output_type, BlockSize,\n        ::rocprim::block_scan_algorithm::reduce_then_scan\n    >;\n\n    __shared__ union\n    {\n        typename block_load_type::storage_type load;\n        typename block_store_type::storage_type store;\n        typename block_scan_type::storage_type scan;\n    } storage;\n\n    output_type values[ItemsPerThread];\n    \/\/ load input values into values\n    block_load_type()\n        .load(\n            input,\n            values,\n            input_size,\n            storage.load\n        );\n    ::rocprim::syncthreads(); \/\/ sync threads to reuse shared memory\n\n    single_scan_block_scan<Exclusive, block_scan_type>(\n        values, \/\/ input\n        values, \/\/ output\n        initial_value,\n        storage.scan,\n        scan_op\n    );\n    ::rocprim::syncthreads(); \/\/ sync threads to reuse shared memory\n\n    \/\/ Save values into output array\n    block_store_type()\n        .store(\n            output,\n            values,\n            input_size,\n            storage.store\n        );\n}\n\n\/\/ Calculates block prefixes that will be used in final_scan\n\/\/ when performing block scan operations.\ntemplate<\n    unsigned int BlockSize,\n    unsigned int ItemsPerThread,\n    class InputIterator,\n    class BinaryFunction,\n    class ScanOpResultType\n>\nvoid block_reduce_kernel_impl(InputIterator input,\n                              const size_t input_size,\n                              BinaryFunction scan_op,\n                              ScanOpResultType * block_prefixes) [[hc]]\n{\n    using result_type = ScanOpResultType;\n\n    using block_reduce_type = ::rocprim::block_reduce<\n        result_type, BlockSize,\n        ::rocprim::block_reduce_algorithm::using_warp_reduce\n    >;\n    __shared__ typename block_reduce_type::storage_type reduce_storage;\n\n    \/\/ It's assumed kernel is executed in 1D\n    const unsigned int flat_id = ::rocprim::block_thread_id(0);\n    const unsigned int flat_block_id = ::rocprim::block_id(0);\n\n    const unsigned int block_offset = flat_block_id * ItemsPerThread * BlockSize;\n    constexpr unsigned int items_per_block = BlockSize * ItemsPerThread;\n    \/\/ TODO: number_of_blocks can be calculated on host\n    const unsigned int number_of_blocks = (input_size + items_per_block - 1)\/items_per_block;\n\n    \/\/ For input values\n    result_type values[ItemsPerThread];\n\n    result_type block_prefix;\n    \/\/ TODO: valid_in_last_block can be calculated on host\n    auto valid_in_last_block = input_size - items_per_block * (number_of_blocks - 1);\n    \/\/ load input values into values\n    if(flat_block_id == (number_of_blocks - 1)) \/\/ last block\n    {\n        block_load_direct_striped<BlockSize>(\n            flat_id,\n            input + block_offset,\n            values,\n            valid_in_last_block\n        );\n    }\n    else\n    {\n        block_load_direct_striped<BlockSize>(\n            flat_id,\n            input + block_offset,\n            values\n        );\n    }\n\n    block_reduce_type()\n        .reduce(\n            values, \/\/ input\n            block_prefix, \/\/ output\n            reduce_storage,\n            scan_op\n        );\n\n    \/\/ Save block prefix\n    if(flat_id == 0)\n    {\n        block_prefixes[flat_block_id] = block_prefix;\n    }\n}\n\n\/\/ Helper functions for performing exclusive or inclusive\n\/\/ block scan operation in final_scan\ntemplate<\n    bool Exclusive,\n    class BlockScan,\n    class T,\n    unsigned int ItemsPerThread,\n    class ScanOpResultType,\n    class BinaryFunction\n>\nauto final_scan_block_scan(const unsigned int flat_block_id,\n                           T (&input)[ItemsPerThread],\n                           T (&output)[ItemsPerThread],\n                           T initial_value,\n                           ScanOpResultType * block_prefixes,\n                           typename BlockScan::storage_type& storage,\n                           BinaryFunction scan_op) [[hc]]\n    -> typename std::enable_if<Exclusive>::type\n{\n    if(flat_block_id == 0)\n    {\n        BlockScan()\n            .exclusive_scan(\n                input, \/\/ input\n                output, \/\/ output\n                initial_value,\n                storage,\n                scan_op\n            );\n    }\n    else\n    {\n        \/\/ Include initial value in block prefix\n        initial_value = scan_op(\n            initial_value, block_prefixes[flat_block_id - 1]\n        );\n        BlockScan()\n            .exclusive_scan(\n                input, \/\/ input\n                output, \/\/ output\n                initial_value,\n                storage,\n                scan_op\n            );\n    }\n}\n\ntemplate<\n    bool Exclusive,\n    class BlockScan,\n    class T,\n    unsigned int ItemsPerThread,\n    class ScanOpResultType,\n    class BinaryFunction\n>\nauto final_scan_block_scan(const unsigned int flat_block_id,\n                           T (&input)[ItemsPerThread],\n                           T (&output)[ItemsPerThread],\n                           T initial_value,\n                           ScanOpResultType * block_prefixes,\n                           typename BlockScan::storage_type& storage,\n                           BinaryFunction scan_op) [[hc]]\n    -> typename std::enable_if<!Exclusive>::type\n{\n    (void) initial_value;\n    if(flat_block_id == 0)\n    {\n        BlockScan()\n            .inclusive_scan(\n                input, \/\/ input\n                output, \/\/ output\n                storage,\n                scan_op\n            );\n    }\n    else\n    {\n        auto block_prefix_op =\n            [&block_prefixes, &flat_block_id](const T& \/*not used*\/)\n            {\n                return block_prefixes[flat_block_id - 1];\n            };\n        BlockScan()\n            .inclusive_scan(\n                input, \/\/ input\n                output, \/\/ output\n                storage,\n                block_prefix_op,\n                scan_op\n            );\n    }\n}\n\ntemplate<\n    unsigned int BlockSize,\n    unsigned int ItemsPerThread,\n    bool Exclusive,\n    class InputIterator,\n    class OutputIterator,\n    class BinaryFunction,\n    class InitValueType,\n    class ScanOpResultType\n>\nvoid final_scan_kernel_impl(InputIterator input,\n                            const size_t input_size,\n                            OutputIterator output,\n                            const InitValueType initial_value,\n                            BinaryFunction scan_op,\n                            ScanOpResultType * block_prefixes) [[hc]]\n{\n    using output_type = typename std::iterator_traits<OutputIterator>::value_type;\n\n    using block_load_type = ::rocprim::block_load<\n        output_type, BlockSize, ItemsPerThread,\n        ::rocprim::block_load_method::block_load_transpose\n    >;\n    using block_store_type = ::rocprim::block_store<\n        output_type, BlockSize, ItemsPerThread,\n        ::rocprim::block_store_method::block_store_transpose\n    >;\n    using block_scan_type = ::rocprim::block_scan<\n        output_type, BlockSize,\n        ::rocprim::block_scan_algorithm::using_warp_scan\n    >;\n\n    __shared__ union\n    {\n        typename block_load_type::storage_type load;\n        typename block_store_type::storage_type store;\n        typename block_scan_type::storage_type scan;\n    } storage;\n\n    \/\/ It's assumed kernel is executed in 1D\n    const unsigned int flat_block_id = ::rocprim::block_id(0);\n\n    constexpr unsigned int items_per_block = BlockSize * ItemsPerThread;\n    const unsigned int block_offset = flat_block_id * items_per_block;\n    \/\/ TODO: number_of_blocks can be calculated on host\n    const unsigned int number_of_blocks = (input_size + items_per_block - 1)\/items_per_block;\n\n    \/\/ For input values\n    output_type values[ItemsPerThread];\n\n    \/\/ TODO: valid_in_last_block can be calculated on host\n    auto valid_in_last_block = input_size - items_per_block * (number_of_blocks - 1);\n    \/\/ load input values into values\n    if(flat_block_id == (number_of_blocks - 1)) \/\/ last block\n    {\n        block_load_type()\n            .load(\n                input + block_offset,\n                values,\n                valid_in_last_block,\n                storage.load\n            );\n    }\n    else\n    {\n        block_load_type()\n            .load(\n                input + block_offset,\n                values,\n                storage.load\n            );\n    }\n\n    final_scan_block_scan<Exclusive, block_scan_type>(\n        flat_block_id,\n        values, \/\/ input\n        values, \/\/ output\n        static_cast<output_type>(initial_value),\n        block_prefixes,\n        storage.scan,\n        scan_op\n    );\n\n    \/\/ Save values into output array\n    if(flat_block_id == (number_of_blocks - 1)) \/\/ last block\n    {\n        block_store_type()\n            .store(\n                output + block_offset,\n                values,\n                valid_in_last_block,\n                storage.store\n            );\n    }\n    else\n    {\n        block_store_type()\n            .store(\n                output + block_offset,\n                values,\n                storage.store\n            );\n    }\n}\n\n\/\/ Returns size of temporary storage in bytes.\ntemplate<class T>\nsize_t get_temporary_storage_bytes(size_t input_size,\n                                   size_t items_per_block)\n{\n    if(input_size <= items_per_block)\n    {\n        return 0;\n    }\n    auto size = (input_size + items_per_block - 1)\/(items_per_block);\n    return size * sizeof(T) + get_temporary_storage_bytes<T>(size, items_per_block);\n}\n\n} \/\/ end of detail namespace\n\nEND_ROCPRIM_NAMESPACE\n\n#endif \/\/ ROCPRIM_DEVICE_DETAIL_DEVICE_SCAN_REDUCE_THEN_SCAN_HPP_\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2012-2013, The University of Oxford\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * 1. Redistributions of source code must retain the above copyright notice,\n *    this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n *    this list of conditions and the following disclaimer in the documentation\n *    and\/or other materials provided with the distribution.\n * 3. Neither the name of the University of Oxford nor the names of its\n *    contributors may be used to endorse or promote products derived from this\n *    software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"apps\/lib\/oskar_settings_load_sky.h\"\n\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <QtCore\/QSettings>\n#include <QtCore\/QByteArray>\n#include <QtCore\/QStringList>\n\n#ifndef M_PI\n#define M_PI 3.14159265358979323846\n#endif\n\n#define D2R M_PI\/180.0\n#define ARCSEC2RAD M_PI\/648000.0\n\nstatic void get_extended_params(QSettings& s, oskar_SettingsSkyExtendedSources* ext);\nstatic void get_filter_params(QSettings& s, oskar_SettingsSkyFilter* flt);\nstatic int get_seed(const QVariant& t);\n\nextern \"C\"\nint oskar_settings_load_sky(oskar_SettingsSky* sky, const char* filename)\n{\n    QByteArray t;\n    QStringList list;\n    QString temp;\n    QSettings s(QString(filename), QSettings::IniFormat);\n    s.beginGroup(\"sky\");\n\n    \/\/ Output OSKAR sky model text file.\n    t = s.value(\"output_text_file\").toByteArray();\n    if (t.size() > 0)\n    {\n        sky->output_text_file = (char*)malloc(t.size() + 1);\n        strcpy(sky->output_text_file, t.constData());\n    }\n\n    \/\/ Output OSKAR sky model binary file.\n    t = s.value(\"output_binary_file\").toByteArray();\n    if (t.size() > 0)\n    {\n        sky->output_binary_file = (char*)malloc(t.size() + 1);\n        strcpy(sky->output_binary_file, t.constData());\n    }\n\n    \/\/ Input OSKAR sky model files.\n    s.beginGroup(\"oskar_sky_model\");\n    list = s.value(\"file\").toStringList();\n    sky->oskar_sky_model.num_files = list.size();\n    sky->oskar_sky_model.file = (char**)malloc(sky->oskar_sky_model.num_files *\n            sizeof(char*));\n    for (int i = 0; i < sky->oskar_sky_model.num_files; ++i)\n    {\n        t = list[i].toLatin1();\n        sky->oskar_sky_model.file[i] = (char*)malloc(t.size() + 1);\n        strcpy(sky->oskar_sky_model.file[i], t.constData());\n    }\n    get_filter_params(s, &sky->oskar_sky_model.filter);\n    get_extended_params(s, &sky->oskar_sky_model.extended_sources);\n    s.endGroup();\n\n    \/\/ GSM file.\n    s.beginGroup(\"gsm\");\n    t = s.value(\"file\").toByteArray();\n    if (t.size() > 0)\n    {\n        sky->gsm.file = (char*)malloc(t.size() + 1);\n        strcpy(sky->gsm.file, t.constData());\n    }\n    get_filter_params(s, &sky->gsm.filter);\n    get_extended_params(s, &sky->gsm.extended_sources);\n    s.endGroup();\n\n    \/\/ Input FITS image files.\n    s.beginGroup(\"fits_image\");\n    list = s.value(\"file\").toStringList();\n    sky->fits_image.num_files = list.size();\n    sky->fits_image.file = (char**)malloc(sky->fits_image.num_files *\n            sizeof(char*));\n    for (int i = 0; i < sky->fits_image.num_files; ++i)\n    {\n        t = list[i].toLatin1();\n        sky->fits_image.file[i] = (char*)malloc(t.size() + 1);\n        strcpy(sky->fits_image.file[i], t.constData());\n    }\n    sky->fits_image.downsample_factor =\n            s.value(\"downsample_factor\", 1).toInt();\n    sky->fits_image.min_peak_fraction =\n            s.value(\"min_peak_fraction\", 0.02).toDouble();\n    sky->fits_image.noise_floor =\n            s.value(\"noise_floor\", 0.0).toDouble();\n    sky->fits_image.spectral_index =\n            s.value(\"spectral_index\", 0.0).toDouble();\n    s.endGroup();\n\n    \/\/ Input HEALPix FITS files.\n    s.beginGroup(\"healpix_fits\");\n    list = s.value(\"file\").toStringList();\n    sky->healpix_fits.num_files = list.size();\n    sky->healpix_fits.file = (char**)malloc(sky->healpix_fits.num_files *\n            sizeof(char*));\n    for (int i = 0; i < sky->healpix_fits.num_files; ++i)\n    {\n        t = list[i].toLatin1();\n        sky->healpix_fits.file[i] = (char*)malloc(t.size() + 1);\n        strcpy(sky->healpix_fits.file[i], t.constData());\n    }\n    temp = s.value(\"coord_sys\", \"Galactic\").toString();\n    if (temp.startsWith('G', Qt::CaseInsensitive))\n        sky->healpix_fits.coord_sys = OSKAR_SPHERICAL_TYPE_GALACTIC;\n    else\n        sky->healpix_fits.coord_sys = OSKAR_SPHERICAL_TYPE_EQUATORIAL;\n    temp = s.value(\"map_units\", \"mK\/sr\").toString();\n    if (temp.startsWith(\"mK\", Qt::CaseInsensitive))\n        sky->healpix_fits.map_units = OSKAR_MAP_UNITS_MK_PER_SR;\n    else if (temp.startsWith(\"K\", Qt::CaseInsensitive))\n        sky->healpix_fits.map_units = OSKAR_MAP_UNITS_K_PER_SR;\n    else\n        sky->healpix_fits.map_units = OSKAR_MAP_UNITS_JY;\n    get_filter_params(s, &sky->healpix_fits.filter);\n    get_extended_params(s, &sky->healpix_fits.extended_sources);\n    s.endGroup();\n\n    \/\/ Generator settings.\n    s.beginGroup(\"generator\");\n\n    \/\/ Random power-law generator settings.\n    s.beginGroup(\"random_power_law\");\n    sky->generator.random_power_law.num_sources =\n            s.value(\"num_sources\").toInt();\n    sky->generator.random_power_law.flux_min = s.value(\"flux_min\").toDouble();\n    sky->generator.random_power_law.flux_max = s.value(\"flux_max\").toDouble();\n    sky->generator.random_power_law.power = s.value(\"power\").toDouble();\n    sky->generator.random_power_law.seed = get_seed(s.value(\"seed\"));\n    \/\/ Random power-law generator filter.\n    get_filter_params(s, &sky->generator.random_power_law.filter);\n    get_extended_params(s, &sky->generator.random_power_law.extended_sources);\n    s.endGroup();\n\n    \/\/ Random broken-power-law generator settings.\n    s.beginGroup(\"random_broken_power_law\");\n    sky->generator.random_broken_power_law.num_sources =\n            s.value(\"num_sources\").toInt();\n    sky->generator.random_broken_power_law.flux_min =\n            s.value(\"flux_min\").toDouble();\n    sky->generator.random_broken_power_law.flux_max =\n            s.value(\"flux_max\").toDouble();\n    sky->generator.random_broken_power_law.threshold =\n            s.value(\"threshold\").toDouble();\n    sky->generator.random_broken_power_law.power1 =\n            s.value(\"power1\").toDouble();\n    sky->generator.random_broken_power_law.power2 =\n            s.value(\"power2\").toDouble();\n    sky->generator.random_broken_power_law.seed = get_seed(s.value(\"seed\"));\n    \/\/ Random broken-power-law generator filter.\n    get_filter_params(s, &sky->generator.random_broken_power_law.filter);\n    get_extended_params(s, &sky->generator.random_broken_power_law.extended_sources);\n    s.endGroup();\n\n    \/\/ HEALPix generator settings.\n    s.beginGroup(\"healpix\");\n    sky->generator.healpix.nside = s.value(\"nside\", 0).toInt();\n    sky->generator.healpix.amplitude = s.value(\"amplitude\", 1.0).toDouble();\n    \/\/ HEALPix generator filter.\n    get_filter_params(s, &sky->generator.healpix.filter);\n    get_extended_params(s, &sky->generator.healpix.extended_sources);\n    s.endGroup();\n\n    \/\/ End generator group.\n    s.endGroup();\n\n    \/\/ Spectral index override settings.\n    s.beginGroup(\"spectral_index\");\n    sky->spectral_index.override = s.value(\"override\", false).toBool();\n    sky->spectral_index.ref_frequency_hz =\n            s.value(\"ref_frequency_hz\", 0.0).toDouble();\n    sky->spectral_index.mean = s.value(\"mean\", 0.0).toDouble();\n    sky->spectral_index.std_dev = s.value(\"std_dev\", 0.0).toDouble();\n    sky->spectral_index.seed = get_seed(s.value(\"seed\"));\n    s.endGroup();\n\n    \/\/ Common flux filtering settings, applied per-channel\n    \/\/ after spectral index scaling.\n    s.beginGroup(\"common_flux_filter\");\n    temp = s.value(\"flux_min\", \"min\").toString();\n    if (temp.compare(\"min\", Qt::CaseInsensitive) == 0)\n        sky->common_flux_filter_min_jy = 0.0;\n    else\n        sky->common_flux_filter_min_jy = temp.toDouble();\n    temp = s.value(\"flux_max\", \"max\").toString();\n    if (temp.compare(\"max\", Qt::CaseInsensitive) == 0)\n        sky->common_flux_filter_max_jy = 0.0;\n    else\n        sky->common_flux_filter_max_jy = temp.toDouble();\n    s.endGroup();\n\n    sky->zero_failed_gaussians = s.value(\"advanced\/zero_failed_gaussians\", false).toBool();\n\n    return OSKAR_SUCCESS;\n}\n\nstatic void get_extended_params(QSettings& s,\n        oskar_SettingsSkyExtendedSources* ext)\n{\n    s.beginGroup(\"extended_sources\");\n    ext->FWHM_major = s.value(\"FWHM_major\").toDouble() * ARCSEC2RAD;\n    ext->FWHM_minor = s.value(\"FWHM_minor\").toDouble() * ARCSEC2RAD;\n    ext->position_angle = s.value(\"position_angle\").toDouble() * D2R;\n    s.endGroup();\n}\n\nstatic void get_filter_params(QSettings& s, oskar_SettingsSkyFilter* flt)\n{\n    QString temp;\n    s.beginGroup(\"filter\");\n    temp = s.value(\"flux_min\", \"min\").toString();\n    if (temp.compare(\"min\", Qt::CaseInsensitive) == 0)\n        flt->flux_min = 0.0;\n    else\n        flt->flux_min = temp.toDouble();\n    temp = s.value(\"flux_max\", \"max\").toString();\n    if (temp.compare(\"max\", Qt::CaseInsensitive) == 0)\n        flt->flux_max = 0.0;\n    else\n        flt->flux_max = temp.toDouble();\n    flt->radius_inner = s.value(\"radius_inner_deg\").toDouble() * D2R;\n    flt->radius_outer = s.value(\"radius_outer_deg\", 180.0).toDouble() * D2R;\n    s.endGroup();\n}\n\nstatic int get_seed(const QVariant& t)\n{\n    QString str = t.toString().toUpper();\n    int val = str.toInt();\n    return (str == \"TIME\" || val < 0) ? (int)time(NULL) : val;\n}\n<commit_msg>Fixed an issue where loading a list of OSKAR sky model text files wouldnt work if the value is quoted - this is a similar fix to what is already applied to the device list in the simulator settings group<commit_after>\/*\n * Copyright (c) 2012-2013, The University of Oxford\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * 1. Redistributions of source code must retain the above copyright notice,\n *    this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n *    this list of conditions and the following disclaimer in the documentation\n *    and\/or other materials provided with the distribution.\n * 3. Neither the name of the University of Oxford nor the names of its\n *    contributors may be used to endorse or promote products derived from this\n *    software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"apps\/lib\/oskar_settings_load_sky.h\"\n\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <QtCore\/QSettings>\n#include <QtCore\/QByteArray>\n#include <QtCore\/QStringList>\n\n#ifndef M_PI\n#define M_PI 3.14159265358979323846\n#endif\n\n#define D2R M_PI\/180.0\n#define ARCSEC2RAD M_PI\/648000.0\n\nstatic void get_extended_params(QSettings& s, oskar_SettingsSkyExtendedSources* ext);\nstatic void get_filter_params(QSettings& s, oskar_SettingsSkyFilter* flt);\nstatic int get_seed(const QVariant& t);\n\nextern \"C\"\nint oskar_settings_load_sky(oskar_SettingsSky* sky, const char* filename)\n{\n    QByteArray t;\n    QStringList list;\n    QString temp;\n    QSettings s(QString(filename), QSettings::IniFormat);\n    s.beginGroup(\"sky\");\n\n    \/\/ Output OSKAR sky model text file.\n    t = s.value(\"output_text_file\").toByteArray();\n    if (t.size() > 0)\n    {\n        sky->output_text_file = (char*)malloc(t.size() + 1);\n        strcpy(sky->output_text_file, t.constData());\n    }\n\n    \/\/ Output OSKAR sky model binary file.\n    t = s.value(\"output_binary_file\").toByteArray();\n    if (t.size() > 0)\n    {\n        sky->output_binary_file = (char*)malloc(t.size() + 1);\n        strcpy(sky->output_binary_file, t.constData());\n    }\n\n    \/\/ Input OSKAR sky model files.\n    s.beginGroup(\"oskar_sky_model\");\n    QVariant vFiles = s.value(\"file\");\n    if (vFiles.type() == QVariant::StringList)\n        list = vFiles.toStringList();\n    else if (vFiles.type() == QVariant::String)\n        list = vFiles.toString().split(\",\");\n    \/\/list = s.value(\"file\").toStringList();\n    sky->oskar_sky_model.num_files = list.size();\n    sky->oskar_sky_model.file = (char**)malloc(sky->oskar_sky_model.num_files *\n            sizeof(char*));\n    for (int i = 0; i < sky->oskar_sky_model.num_files; ++i)\n    {\n        t = list[i].toLatin1();\n        sky->oskar_sky_model.file[i] = (char*)malloc(t.size() + 1);\n        strcpy(sky->oskar_sky_model.file[i], t.constData());\n    }\n    get_filter_params(s, &sky->oskar_sky_model.filter);\n    get_extended_params(s, &sky->oskar_sky_model.extended_sources);\n    s.endGroup();\n\n    \/\/ GSM file.\n    s.beginGroup(\"gsm\");\n    t = s.value(\"file\").toByteArray();\n    if (t.size() > 0)\n    {\n        sky->gsm.file = (char*)malloc(t.size() + 1);\n        strcpy(sky->gsm.file, t.constData());\n    }\n    get_filter_params(s, &sky->gsm.filter);\n    get_extended_params(s, &sky->gsm.extended_sources);\n    s.endGroup();\n\n    \/\/ Input FITS image files.\n    s.beginGroup(\"fits_image\");\n    list = s.value(\"file\").toStringList();\n    sky->fits_image.num_files = list.size();\n    sky->fits_image.file = (char**)malloc(sky->fits_image.num_files *\n            sizeof(char*));\n    for (int i = 0; i < sky->fits_image.num_files; ++i)\n    {\n        t = list[i].toLatin1();\n        sky->fits_image.file[i] = (char*)malloc(t.size() + 1);\n        strcpy(sky->fits_image.file[i], t.constData());\n    }\n    sky->fits_image.downsample_factor =\n            s.value(\"downsample_factor\", 1).toInt();\n    sky->fits_image.min_peak_fraction =\n            s.value(\"min_peak_fraction\", 0.02).toDouble();\n    sky->fits_image.noise_floor =\n            s.value(\"noise_floor\", 0.0).toDouble();\n    sky->fits_image.spectral_index =\n            s.value(\"spectral_index\", 0.0).toDouble();\n    s.endGroup();\n\n    \/\/ Input HEALPix FITS files.\n    s.beginGroup(\"healpix_fits\");\n    list = s.value(\"file\").toStringList();\n    sky->healpix_fits.num_files = list.size();\n    sky->healpix_fits.file = (char**)malloc(sky->healpix_fits.num_files *\n            sizeof(char*));\n    for (int i = 0; i < sky->healpix_fits.num_files; ++i)\n    {\n        t = list[i].toLatin1();\n        sky->healpix_fits.file[i] = (char*)malloc(t.size() + 1);\n        strcpy(sky->healpix_fits.file[i], t.constData());\n    }\n    temp = s.value(\"coord_sys\", \"Galactic\").toString();\n    if (temp.startsWith('G', Qt::CaseInsensitive))\n        sky->healpix_fits.coord_sys = OSKAR_SPHERICAL_TYPE_GALACTIC;\n    else\n        sky->healpix_fits.coord_sys = OSKAR_SPHERICAL_TYPE_EQUATORIAL;\n    temp = s.value(\"map_units\", \"mK\/sr\").toString();\n    if (temp.startsWith(\"mK\", Qt::CaseInsensitive))\n        sky->healpix_fits.map_units = OSKAR_MAP_UNITS_MK_PER_SR;\n    else if (temp.startsWith(\"K\", Qt::CaseInsensitive))\n        sky->healpix_fits.map_units = OSKAR_MAP_UNITS_K_PER_SR;\n    else\n        sky->healpix_fits.map_units = OSKAR_MAP_UNITS_JY;\n    get_filter_params(s, &sky->healpix_fits.filter);\n    get_extended_params(s, &sky->healpix_fits.extended_sources);\n    s.endGroup();\n\n    \/\/ Generator settings.\n    s.beginGroup(\"generator\");\n\n    \/\/ Random power-law generator settings.\n    s.beginGroup(\"random_power_law\");\n    sky->generator.random_power_law.num_sources =\n            s.value(\"num_sources\").toInt();\n    sky->generator.random_power_law.flux_min = s.value(\"flux_min\").toDouble();\n    sky->generator.random_power_law.flux_max = s.value(\"flux_max\").toDouble();\n    sky->generator.random_power_law.power = s.value(\"power\").toDouble();\n    sky->generator.random_power_law.seed = get_seed(s.value(\"seed\"));\n    \/\/ Random power-law generator filter.\n    get_filter_params(s, &sky->generator.random_power_law.filter);\n    get_extended_params(s, &sky->generator.random_power_law.extended_sources);\n    s.endGroup();\n\n    \/\/ Random broken-power-law generator settings.\n    s.beginGroup(\"random_broken_power_law\");\n    sky->generator.random_broken_power_law.num_sources =\n            s.value(\"num_sources\").toInt();\n    sky->generator.random_broken_power_law.flux_min =\n            s.value(\"flux_min\").toDouble();\n    sky->generator.random_broken_power_law.flux_max =\n            s.value(\"flux_max\").toDouble();\n    sky->generator.random_broken_power_law.threshold =\n            s.value(\"threshold\").toDouble();\n    sky->generator.random_broken_power_law.power1 =\n            s.value(\"power1\").toDouble();\n    sky->generator.random_broken_power_law.power2 =\n            s.value(\"power2\").toDouble();\n    sky->generator.random_broken_power_law.seed = get_seed(s.value(\"seed\"));\n    \/\/ Random broken-power-law generator filter.\n    get_filter_params(s, &sky->generator.random_broken_power_law.filter);\n    get_extended_params(s, &sky->generator.random_broken_power_law.extended_sources);\n    s.endGroup();\n\n    \/\/ HEALPix generator settings.\n    s.beginGroup(\"healpix\");\n    sky->generator.healpix.nside = s.value(\"nside\", 0).toInt();\n    sky->generator.healpix.amplitude = s.value(\"amplitude\", 1.0).toDouble();\n    \/\/ HEALPix generator filter.\n    get_filter_params(s, &sky->generator.healpix.filter);\n    get_extended_params(s, &sky->generator.healpix.extended_sources);\n    s.endGroup();\n\n    \/\/ End generator group.\n    s.endGroup();\n\n    \/\/ Spectral index override settings.\n    s.beginGroup(\"spectral_index\");\n    sky->spectral_index.override = s.value(\"override\", false).toBool();\n    sky->spectral_index.ref_frequency_hz =\n            s.value(\"ref_frequency_hz\", 0.0).toDouble();\n    sky->spectral_index.mean = s.value(\"mean\", 0.0).toDouble();\n    sky->spectral_index.std_dev = s.value(\"std_dev\", 0.0).toDouble();\n    sky->spectral_index.seed = get_seed(s.value(\"seed\"));\n    s.endGroup();\n\n    \/\/ Common flux filtering settings, applied per-channel\n    \/\/ after spectral index scaling.\n    s.beginGroup(\"common_flux_filter\");\n    temp = s.value(\"flux_min\", \"min\").toString();\n    if (temp.compare(\"min\", Qt::CaseInsensitive) == 0)\n        sky->common_flux_filter_min_jy = 0.0;\n    else\n        sky->common_flux_filter_min_jy = temp.toDouble();\n    temp = s.value(\"flux_max\", \"max\").toString();\n    if (temp.compare(\"max\", Qt::CaseInsensitive) == 0)\n        sky->common_flux_filter_max_jy = 0.0;\n    else\n        sky->common_flux_filter_max_jy = temp.toDouble();\n    s.endGroup();\n\n    sky->zero_failed_gaussians = s.value(\"advanced\/zero_failed_gaussians\", false).toBool();\n\n    return OSKAR_SUCCESS;\n}\n\nstatic void get_extended_params(QSettings& s,\n        oskar_SettingsSkyExtendedSources* ext)\n{\n    s.beginGroup(\"extended_sources\");\n    ext->FWHM_major = s.value(\"FWHM_major\").toDouble() * ARCSEC2RAD;\n    ext->FWHM_minor = s.value(\"FWHM_minor\").toDouble() * ARCSEC2RAD;\n    ext->position_angle = s.value(\"position_angle\").toDouble() * D2R;\n    s.endGroup();\n}\n\nstatic void get_filter_params(QSettings& s, oskar_SettingsSkyFilter* flt)\n{\n    QString temp;\n    s.beginGroup(\"filter\");\n    temp = s.value(\"flux_min\", \"min\").toString();\n    if (temp.compare(\"min\", Qt::CaseInsensitive) == 0)\n        flt->flux_min = 0.0;\n    else\n        flt->flux_min = temp.toDouble();\n    temp = s.value(\"flux_max\", \"max\").toString();\n    if (temp.compare(\"max\", Qt::CaseInsensitive) == 0)\n        flt->flux_max = 0.0;\n    else\n        flt->flux_max = temp.toDouble();\n    flt->radius_inner = s.value(\"radius_inner_deg\").toDouble() * D2R;\n    flt->radius_outer = s.value(\"radius_outer_deg\", 180.0).toDouble() * D2R;\n    s.endGroup();\n}\n\nstatic int get_seed(const QVariant& t)\n{\n    QString str = t.toString().toUpper();\n    int val = str.toInt();\n    return (str == \"TIME\" || val < 0) ? (int)time(NULL) : val;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"Texture2DManager.h\"\n\n#include <WICTextureLoader.h>\n#include <DirectXTex.h>\n#include <locale>\n#include <codecvt>\n\n#include \"Utility.hpp\"\n\nusing namespace Rendering::Manager;\nusing namespace Rendering::Texture;\nusing namespace Rendering::View;\nusing namespace DirectX;\n\nTexture2DManager::Texture2DPtr Texture2DManager::LoadTextureFromFile(Device::DirectX& dx, const std::string& fileDir, bool hasAlpha)\n{\n\tstd::string folderPath, name, format;\n\tUtility::String::ParseDirectory(fileDir, &folderPath, &name, &format);\n\n\t\/\/ Find texture\n\t{\n\t\tTexture2DPtr tex = Find(name + format);\n\t\tif(tex)\n\t\t\treturn tex;\n\t}\n\n\tstd::wstring_convert<std::codecvt_utf8_utf16<wchar_t>> converter;\n\tstd::wstring wFilePath = converter.from_bytes(fileDir);\n\n\tID3D11ShaderResourceView*\tsrv\t\t\t= nullptr;\n\tID3D11Resource*\t\t\t\tresource\t= nullptr;\n\tTexture2DPtr\t\t\t\ttex\t\t\t= nullptr;\n\tTexMetadata\t\t\t\t\tmetaData;\n\tScratchImage\t\t\t\timage;\n\n\tif(format == \"tga\")\t\n\t\tASSERT_SUCCEEDED(LoadFromTGAFile(wFilePath.c_str(), &metaData, image));\n\telse if(format == \"dds\")\n\t\tASSERT_SUCCEEDED(LoadFromDDSFile(wFilePath.c_str(), 0u,  &metaData, image));\n\telse\n\t\tASSERT_SUCCEEDED(CreateWICTextureFromFile(dx.GetDevice(), dx.GetContext(), wFilePath.c_str(), &resource, &srv));\n\n\tbool notCreatedSRV = (format == \"tga\") || (format == \"dds\");\n\tif (notCreatedSRV)\n\t{\n\t\tASSERT_SUCCEEDED(CreateShaderResourceView(dx.GetDevice(), image.GetImages(), image.GetImageCount(), metaData, &srv));\n\t\tsrv->GetResource(&resource);\n\t}\n\n\tID3D11Texture2D* tex2d = nullptr;\n\tresource->QueryInterface(__uuidof(ID3D11Texture2D), (void**)&tex2d);\n\n\tuint texW = image.GetImages()[0].width;\n\tuint texH = image.GetImages()[0].height;\n\tauto dxResource = DXResource<ID3D11ShaderResourceView>(srv);\n\ttex = std::make_shared<Texture2D>(ShaderResourceView(dxResource), DXResource<ID3D11Texture2D>(tex2d), hasAlpha, Size<uint>(texW, texH));\n\t_hash.insert(std::make_pair(name + format, tex));\n\t\n\treturn tex;\n}\n\nTexture2DManager::Texture2DPtr Texture2DManager::Find(const std::string& key)\n{\n\tauto findIter = _hash.find(key);\n\treturn findIter == _hash.end() ? nullptr : findIter->second;\n}\n\nvoid Texture2DManager::Delete(const std::string& key)\n{\n\tauto findIter = _hash.find(key);\n\n\tif(findIter != _hash.end())\n\t{\n\t\tfindIter->second.reset();\n\t\t_hash.erase(findIter);\n\t}\n}\n\nvoid Texture2DManager::DeleteAll()\n{\n\t_hash.clear();\n}<commit_msg>에러 수정<commit_after>#include \"Texture2DManager.h\"\n\n#include <WICTextureLoader.h>\n#include <DirectXTex.h>\n#include <locale>\n#include <codecvt>\n\n#include \"Utility.hpp\"\n\nusing namespace Rendering::Manager;\nusing namespace Rendering::Texture;\nusing namespace Rendering::View;\nusing namespace DirectX;\n\nTexture2DManager::Texture2DPtr Texture2DManager::LoadTextureFromFile(Device::DirectX& dx, const std::string& fileDir, bool hasAlpha)\n{\n\tstd::string folderPath, name, format;\n\tUtility::String::ParseDirectory(fileDir, &folderPath, &name, &format);\n\n\t\/\/ Find texture\n\t{\n\t\tTexture2DPtr tex = Find(name + format);\n\t\tif(tex)\n\t\t\treturn tex;\n\t}\n\n\tstd::wstring_convert<std::codecvt_utf8_utf16<wchar_t>> converter;\n\tstd::wstring wFilePath = converter.from_bytes(fileDir);\n\n\tID3D11ShaderResourceView*\tsrv\t\t\t= nullptr;\n\tID3D11Resource*\t\t\t\tresource\t= nullptr;\n\tTexture2DPtr\t\t\t\ttex\t\t\t= nullptr;\n\tTexMetadata\t\t\t\t\tmetaData;\n\tScratchImage\t\t\t\timage;\n\n\tif(format == \"tga\")\t\n\t\tASSERT_SUCCEEDED(LoadFromTGAFile(wFilePath.c_str(), &metaData, image));\n\telse if(format == \"dds\")\n\t\tASSERT_SUCCEEDED(LoadFromDDSFile(wFilePath.c_str(), 0u,  &metaData, image));\n\telse\n\t\tASSERT_SUCCEEDED(CreateWICTextureFromFile(dx.GetDevice().GetRaw(), dx.GetContext().GetRaw(), wFilePath.c_str(), &resource, &srv));\n\n\tbool notCreatedSRV = (format == \"tga\") || (format == \"dds\");\n\tif (notCreatedSRV)\n\t{\n\t\tASSERT_SUCCEEDED(CreateShaderResourceView(dx.GetDevice().GetRaw(), image.GetImages(), image.GetImageCount(), metaData, &srv));\n\t\tsrv->GetResource(&resource);\n\t}\n\n\tID3D11Texture2D* tex2d = nullptr;\n\tresource->QueryInterface(__uuidof(ID3D11Texture2D), (void**)&tex2d);\n\n\tuint texW = image.GetImages()[0].width;\n\tuint texH = image.GetImages()[0].height;\n\tauto dxResource = DXResource<ID3D11ShaderResourceView>(srv);\n\ttex = std::make_shared<Texture2D>(ShaderResourceView(dxResource), DXResource<ID3D11Texture2D>(tex2d), hasAlpha, Size<uint>(texW, texH));\n\t_hash.insert(std::make_pair(name + format, tex));\n\t\n\treturn tex;\n}\n\nTexture2DManager::Texture2DPtr Texture2DManager::Find(const std::string& key)\n{\n\tauto findIter = _hash.find(key);\n\treturn findIter == _hash.end() ? nullptr : findIter->second;\n}\n\nvoid Texture2DManager::Delete(const std::string& key)\n{\n\tauto findIter = _hash.find(key);\n\n\tif(findIter != _hash.end())\n\t{\n\t\tfindIter->second.reset();\n\t\t_hash.erase(findIter);\n\t}\n}\n\nvoid Texture2DManager::DeleteAll()\n{\n\t_hash.clear();\n}<|endoftext|>"}
{"text":"<commit_before>\/*=============================================================================\n\tCopyright (c) 2012-2014 Richard Otis\n\n    Distributed under the Boost Software License, Version 1.0. (See accompanying\n    file LICENSE_1_0.txt or copy at http:\/\/www.boost.org\/LICENSE_1_0.txt)\n=============================================================================*\/\n\n#include \"libgibbs\/include\/libgibbs_pch.hpp\"\n#include \"libtdb\/include\/structure.hpp\"\n#include \"libtdb\/include\/parameter.hpp\"\n#include \"libtdb\/include\/database.hpp\"\n#include \"libtdb\/include\/logging.hpp\"\n#include \"libgibbs\/include\/conditions.hpp\"\n#include \"libgibbs\/include\/compositionset.hpp\"\n#include \"libgibbs\/include\/equilibrium.hpp\"\n#include \"libgibbs\/include\/models.hpp\"\n#include \"libgibbs\/include\/optimizer\/utils\/build_variable_map.hpp\"\n#include <cmath>\n#include <boost\/python.hpp>\n#include <boost\/python\/enum.hpp>\n#include <boost\/python\/suite\/indexing\/map_indexing_suite.hpp>\n#include <boost\/python\/suite\/indexing\/vector_indexing_suite.hpp>\n\nusing namespace boost::python;\nusing namespace Optimizer;\n\nBOOST_PYTHON_MODULE(libcalphadcpp)\n{\n\tinit_logging();\n\t\/\/ Wrapper to convert some common std containers\n\tclass_<std::map<std::string,double>>(\"StdMap\")\n\t\t.def(map_indexing_suite<std::map<std::string, double> >() )\n\t;\n        class_<std::map<std::string,int>>(\"IndexStdMap\")\n        .def(map_indexing_suite<std::map<std::string, int> >() )\n        ;\n        class_<boost::bimap<std::string,int>>(\"IndexBiMap\")\n        ;\n\tclass_<std::map<std::string,Optimizer::PhaseStatus>>(\"PhaseStatusMap\")\n\t\t.def(map_indexing_suite<std::map<std::string, PhaseStatus> >() )\n\t;\n        class_<std::map<std::string,::Phase>>(\"PhaseMap\")\n        .def(map_indexing_suite<std::map<std::string, ::Phase> >() )\n        ;\n        class_<std::map<std::string,boost::shared_ptr<CompositionSet>>, boost::noncopyable>(\"CompositionSetMap\", no_init)\n        .def(map_indexing_suite<std::map<std::string, boost::shared_ptr<CompositionSet>>, true >() )\n        ;\n\t\/\/ TODO: why do I have charmaps at all? This is a class decl problem\n\tclass_<std::map<char,double>>(\"StdCharMap\")\n\t\t.def(map_indexing_suite<std::map<char, double> >() )\n\t;\n\tclass_<std::vector<std::string>>(\"StdVector\")\n\t\t.def(vector_indexing_suite<std::vector<std::string> >() )\n\t;\n\tenum_<PhaseStatus>(\"PhaseStatus\")\n\t\t.value(\"ENTERED\", PhaseStatus::ENTERED)\n\t\t.value(\"DORMANT\", PhaseStatus::DORMANT)\n\t\t.value(\"FIXED\", PhaseStatus::FIXED)\n\t\t.value(\"SUSPENDED\",  PhaseStatus::SUSPENDED)\n\t;\n\n    class_<evalconditions>(\"evalconditions\")\n    \t.def_readwrite(\"statevars\", &evalconditions::statevars)\n    \t.def_readwrite(\"elements\", &evalconditions::elements)\n    \t.def_readwrite(\"phases\", &evalconditions::phases)\n    \t.def_readwrite(\"xfrac\", &evalconditions::xfrac)\n    ;\n    \n    class_<Database>(\"Database\")\n    .def(init<std::string>()) \/\/ alternative constructor\n    .def(\"get_info\", &Database::get_info)\n    .def(\"get_phases\", &Database::get_phases)\n    .def(\"get_parameter_set\", &Database::get_parameter_set)\n    .def(\"process_command\", &Database::proc_command)\n    ;\n\n    class_<Equilibrium, boost::shared_ptr<Equilibrium>, boost::noncopyable>(\"Equilibrium\", no_init)\n    \t.def(\"__repr__\", &Equilibrium::print)\n    \t.def(\"__str__\", &Equilibrium::print)\n    \t.def(\"GibbsEnergy\", &Equilibrium::GibbsEnergy)\n    ;\n    class_<EquilibriumFactory, boost::noncopyable>(\"EquilibriumFactory\")\n        .def(\"create\", &EquilibriumFactory::create)\n    ; \n    class_<::Phase>(\"Phase\")\n    \/\/ missing implementation .def_readwrite(\"subls\", &::Phase::subls)\n    .def_readwrite(\"init_cmds\", &::Phase::init_cmds)\n    .def_readwrite(\"magnetic_afm_factor\", &::Phase::magnetic_afm_factor)\n    .def_readwrite(\"magnetic_sro_enthalpy_order_fraction\", &::Phase::magnetic_sro_enthalpy_order_fraction)\n    .def_readwrite(\"name\", &::Phase::phase_name)\n    ;\n    class_<sublattice_entry>(\"sublattice_entry\", init<int,int,double,std::string,std::string>() )\n    .def_readwrite(\"index\", &sublattice_entry::index)\n    .def_readwrite(\"opt_index\", &sublattice_entry::opt_index)\n    .def_readwrite(\"phase\", &sublattice_entry::phase)\n    .def_readwrite(\"species\", &sublattice_entry::species)\n    ;\n    class_<sublattice_set>(\"sublattice_set\")\n    ;\n    class_<parameter_set>(\"parameter_set\")\n    ;\n    \/\/ function pointer for overloaded build_variable_map()\n    sublattice_set (*bvm1)( \n         const Phase_Collection&, \n         const evalconditions&,\n         boost::bimap<std::string,int>&\n                          ) = &build_variable_map;\n    def(\"build_variable_map\", bvm1);\n\n    class_<CompositionSet, boost::noncopyable>(\"CompositionSet\", \n                           init<::Phase,\n                                parameter_set, \n                                sublattice_set, \n                                boost::bimap<std::string,int>\n                                >()\n                          )\n    ;\n}\n<commit_msg>Added API classes.<commit_after>\/*=============================================================================\n\tCopyright (c) 2012-2014 Richard Otis\n\n    Distributed under the Boost Software License, Version 1.0. (See accompanying\n    file LICENSE_1_0.txt or copy at http:\/\/www.boost.org\/LICENSE_1_0.txt)\n=============================================================================*\/\n\n#include \"libgibbs\/include\/libgibbs_pch.hpp\"\n#include \"libtdb\/include\/structure.hpp\"\n#include \"libtdb\/include\/parameter.hpp\"\n#include \"libtdb\/include\/database.hpp\"\n#include \"libtdb\/include\/logging.hpp\"\n#include \"libgibbs\/include\/conditions.hpp\"\n#include \"libgibbs\/include\/compositionset.hpp\"\n#include \"libgibbs\/include\/equilibrium.hpp\"\n#include \"libgibbs\/include\/models.hpp\"\n#include \"libgibbs\/include\/optimizer\/utils\/build_variable_map.hpp\"\n#include <cmath>\n#include <boost\/python.hpp>\n#include <boost\/python\/enum.hpp>\n#include <boost\/python\/suite\/indexing\/map_indexing_suite.hpp>\n#include <boost\/python\/suite\/indexing\/vector_indexing_suite.hpp>\n\nusing namespace boost::python;\nusing namespace Optimizer;\n\nBOOST_PYTHON_MODULE(libcalphadcpp)\n{\n\tinit_logging();\n\t\/\/ Wrapper to convert some common std containers\n\tclass_<std::map<std::string,double>>(\"StdMap\")\n\t\t.def(map_indexing_suite<std::map<std::string, double> >() )\n\t;\n        class_<std::map<std::string,int>>(\"IndexStdMap\")\n        .def(map_indexing_suite<std::map<std::string, int> >() )\n        ;\n        class_<boost::bimap<std::string,int>>(\"IndexBiMap\")\n        ;\n\tclass_<std::map<std::string,Optimizer::PhaseStatus>>(\"PhaseStatusMap\")\n\t\t.def(map_indexing_suite<std::map<std::string, PhaseStatus> >() )\n\t;\n        class_<std::map<std::string,::Phase>>(\"PhaseMap\")\n        .def(map_indexing_suite<std::map<std::string, ::Phase> >() )\n        ;\n        class_<std::map<std::string,boost::shared_ptr<CompositionSet>>, boost::noncopyable>(\"CompositionSetMap\", no_init)\n        .def(map_indexing_suite<std::map<std::string, boost::shared_ptr<CompositionSet>>, true >() )\n        ;\n\t\/\/ TODO: why do I have charmaps at all? This is a class decl problem\n\tclass_<std::map<char,double>>(\"StdCharMap\")\n\t\t.def(map_indexing_suite<std::map<char, double> >() )\n\t;\n\tclass_<std::vector<std::string>>(\"StdVector\")\n\t\t.def(vector_indexing_suite<std::vector<std::string> >() )\n\t;\n\tenum_<PhaseStatus>(\"PhaseStatus\")\n\t\t.value(\"ENTERED\", PhaseStatus::ENTERED)\n\t\t.value(\"DORMANT\", PhaseStatus::DORMANT)\n\t\t.value(\"FIXED\", PhaseStatus::FIXED)\n\t\t.value(\"SUSPENDED\",  PhaseStatus::SUSPENDED)\n\t;\n\n    class_<evalconditions>(\"evalconditions\")\n    \t.def_readwrite(\"statevars\", &evalconditions::statevars)\n    \t.def_readwrite(\"elements\", &evalconditions::elements)\n    \t.def_readwrite(\"phases\", &evalconditions::phases)\n    \t.def_readwrite(\"xfrac\", &evalconditions::xfrac)\n    ;\n    \n    class_<Database>(\"Database\")\n    .def(init<std::string>()) \/\/ alternative constructor\n    .def(\"get_info\", &Database::get_info)\n    .def(\"get_phases\", &Database::get_phases)\n    .def(\"get_parameter_set\", &Database::get_parameter_set)\n    .def(\"process_command\", &Database::proc_command)\n    ;\n\n    class_<Equilibrium, boost::shared_ptr<Equilibrium>, boost::noncopyable>(\"Equilibrium\", no_init)\n    \t.def(\"__repr__\", &Equilibrium::print)\n    \t.def(\"__str__\", &Equilibrium::print)\n    \t.def(\"GibbsEnergy\", &Equilibrium::GibbsEnergy)\n    ;\n    class_<EquilibriumFactory, boost::noncopyable>(\"EquilibriumFactory\")\n        .def(\"create\", &EquilibriumFactory::create)\n    ; \n    class_<::Phase>(\"Phase\")\n    \/\/ missing implementation .def_readwrite(\"subls\", &::Phase::subls)\n    .def_readwrite(\"init_cmds\", &::Phase::init_cmds)\n    .def_readwrite(\"magnetic_afm_factor\", &::Phase::magnetic_afm_factor)\n    .def_readwrite(\"magnetic_sro_enthalpy_order_fraction\", &::Phase::magnetic_sro_enthalpy_order_fraction)\n    .def_readwrite(\"name\", &::Phase::phase_name)\n    ;\n    class_<sublattice_entry>(\"sublattice_entry\", init<int,int,double,std::string,std::string>() )\n    .def_readwrite(\"index\", &sublattice_entry::index)\n    .def_readwrite(\"opt_index\", &sublattice_entry::opt_index)\n    .def_readwrite(\"phase\", &sublattice_entry::phase)\n    .def_readwrite(\"species\", &sublattice_entry::species)\n    ;\n    class_<sublattice_set>(\"sublattice_set\")\n    ;\n    class_<parameter_set>(\"parameter_set\")\n    ;\n    \/\/ function pointer for overloaded build_variable_map()\n    sublattice_set (*bvm1)( \n         const Phase_Collection&, \n         const evalconditions&,\n         boost::bimap<std::string,int>&\n                          ) = &build_variable_map;\n    def(\"build_variable_map\", bvm1);\n\n    class_<CompositionSet, boost::noncopyable>(\"CompositionSet\", \n                           init<const ::Phase&,\n                                const parameter_set&, \n                                const sublattice_set&, \n                                const boost::bimap<std::string,int>&\n                                >()\n                          )\n    .def(init<const CompositionSet&,const std::map<std::string, double>&,const std::string&> () )\n    .def(\"name\", &CompositionSet::name)\n    ;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- RenderScriptx86ABIFixups.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#include <set>\n\n\/\/ Other libraries and framework includes\n#include \"llvm\/ADT\/StringRef.h\"\n#include \"llvm\/IR\/BasicBlock.h\"\n#include \"llvm\/IR\/CallSite.h\"\n#include \"llvm\/IR\/Constants.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/IR\/Instruction.h\"\n#include \"llvm\/IR\/Instructions.h\"\n#include \"llvm\/IR\/Module.h\"\n#include \"llvm\/IRReader\/IRReader.h\"\n#include \"llvm\/Pass.h\"\n\n\/\/ Project includes\n#include \"lldb\/Target\/Process.h\"\n#include \"lldb\/Utility\/Log.h\"\n\nusing namespace lldb_private;\nnamespace {\n\nbool isRSAPICall(llvm::Module &module, llvm::CallInst *call_inst) {\n  \/\/ TODO get the list of renderscript modules from lldb and check if\n  \/\/ this llvm::Module calls into any of them.\n  (void)module;\n  const auto func_name = call_inst->getCalledFunction()->getName();\n  if (func_name.startswith(\"llvm\") || func_name.startswith(\"lldb\"))\n    return false;\n\n  if (call_inst->getCalledFunction()->isIntrinsic())\n    return false;\n\n  return true;\n}\n\nbool isRSLargeReturnCall(llvm::Module &module, llvm::CallInst *call_inst) {\n  \/\/ i686 and x86_64 returns for large vectors in the RenderScript API are not\n  \/\/ handled as normal\n  \/\/ register pairs, but as a hidden sret type. This is not reflected in the\n  \/\/ debug info or mangled\n  \/\/ symbol name, and the android ABI for x86 and x86_64, (as well as the\n  \/\/ emulators) specifies there is\n  \/\/ no AVX, so bcc generates an sret function because we cannot natively return\n  \/\/ 256 bit vectors.\n  \/\/ This function simply checks whether a function has a > 128bit return type.\n  \/\/ It is perhaps an\n  \/\/ unreliable heuristic, and relies on bcc not generating AVX code, so if the\n  \/\/ android ABI one day\n  \/\/ provides for AVX, this function may go out of fashion.\n  (void)module;\n  if (!call_inst || !call_inst->getCalledFunction())\n    return false;\n\n  return call_inst->getCalledFunction()\n             ->getReturnType()\n             ->getPrimitiveSizeInBits() > 128;\n}\n\nbool isRSAllocationPtrTy(const llvm::Type *type) {\n  if (!type->isPointerTy())\n    return false;\n  auto ptr_type = type->getPointerElementType();\n\n  return ptr_type->isStructTy() &&\n         ptr_type->getStructName().startswith(\"struct.rs_allocation\");\n}\n\nbool isRSAllocationTyCallSite(llvm::Module &module, llvm::CallInst *call_inst) {\n  (void)module;\n  if (!call_inst->hasByValArgument())\n    return false;\n  for (const auto &param : call_inst->operand_values())\n    if (isRSAllocationPtrTy(param->getType()))\n      return true;\n  return false;\n}\n\nllvm::FunctionType *cloneToStructRetFnTy(llvm::CallInst *call_inst) {\n  \/\/ on x86 StructReturn functions return a pointer to the return value, rather\n  \/\/ than the return\n  \/\/ value itself [ref](http:\/\/www.agner.org\/optimize\/calling_conventions.pdf\n  \/\/ section 6).\n  \/\/ We create a return type by getting the pointer type of the old return type,\n  \/\/ and inserting a new\n  \/\/ initial argument of pointer type of the original return type.\n  Log *log(\n      GetLogIfAnyCategoriesSet(LIBLLDB_LOG_LANGUAGE | LIBLLDB_LOG_EXPRESSIONS));\n\n  assert(call_inst && \"no CallInst\");\n  llvm::Function *orig = call_inst->getCalledFunction();\n  assert(orig && \"CallInst has no called function\");\n  llvm::FunctionType *orig_type = orig->getFunctionType();\n  auto name = orig->getName();\n  if (log)\n    log->Printf(\"%s - cloning to StructRet function for '%s'\", __FUNCTION__,\n                name.str().c_str());\n\n  unsigned num_params = orig_type->getNumParams();\n  std::vector<llvm::Type *> new_params{num_params + 1, nullptr};\n  std::vector<llvm::Type *> params{orig_type->param_begin(),\n                                   orig_type->param_end()};\n\n  \/\/ This may not work if the function is somehow declared void as llvm is\n  \/\/ strongly typed\n  \/\/ and represents void* with i8*\n  assert(!orig_type->getReturnType()->isVoidTy() &&\n         \"Cannot add StructRet attribute to void function\");\n  llvm::PointerType *return_type_ptr_type =\n      llvm::PointerType::getUnqual(orig->getReturnType());\n  assert(return_type_ptr_type &&\n         \"failed to get function return type PointerType\");\n  if (!return_type_ptr_type)\n    return nullptr;\n\n  if (log)\n    log->Printf(\"%s - return type pointer type for StructRet clone @ '0x%p':\\n\",\n                __FUNCTION__, (void *)return_type_ptr_type);\n  \/\/ put the the sret pointer argument in place at the beginning of the argument\n  \/\/ list.\n  params.emplace(params.begin(), return_type_ptr_type);\n  assert(params.size() == num_params + 1);\n  return llvm::FunctionType::get(return_type_ptr_type, params,\n                                 orig->isVarArg());\n}\n\nbool findRSCallSites(llvm::Module &module,\n                     std::set<llvm::CallInst *> &rs_callsites,\n                     bool (*predicate)(llvm::Module &, llvm::CallInst *)) {\n  bool found = false;\n\n  for (auto &func : module.getFunctionList())\n    for (auto &block : func.getBasicBlockList())\n      for (auto &inst : block) {\n        llvm::CallInst *call_inst =\n            llvm::dyn_cast_or_null<llvm::CallInst>(&inst);\n        if (!call_inst || !call_inst->getCalledFunction())\n          \/\/ This is not the call-site you are looking for...\n          continue;\n        if (isRSAPICall(module, call_inst) && predicate(module, call_inst)) {\n          rs_callsites.insert(call_inst);\n          found = true;\n        }\n      }\n  return found;\n}\n\nbool fixupX86StructRetCalls(llvm::Module &module) {\n  bool changed = false;\n  \/\/ changing a basic block while iterating over it seems to have some undefined\n  \/\/ behaviour\n  \/\/ going on so we find all RS callsites first, then fix them up after\n  \/\/ consuming\n  \/\/ the iterator.\n  std::set<llvm::CallInst *> rs_callsites;\n  if (!findRSCallSites(module, rs_callsites, isRSLargeReturnCall))\n    return false;\n\n  for (auto call_inst : rs_callsites) {\n    llvm::FunctionType *new_func_type = cloneToStructRetFnTy(call_inst);\n    assert(new_func_type &&\n           \"failed to clone functionType for Renderscript ABI fixup\");\n\n    llvm::CallSite call_site(call_inst);\n    llvm::Function *func = call_inst->getCalledFunction();\n    assert(func && \"cannot resolve function in RenderScriptRuntime\");\n    \/\/ Copy the original call arguments\n    std::vector<llvm::Value *> new_call_args(call_site.arg_begin(),\n                                             call_site.arg_end());\n\n    \/\/ Allocate enough space to store the return value of the original function\n    \/\/ we pass a pointer to this allocation as the StructRet param, and then\n    \/\/ copy its\n    \/\/ value into the lldb return value\n    llvm::AllocaInst *return_value_alloc = new llvm::AllocaInst(\n        func->getReturnType(), \"var_vector_return_alloc\", call_inst);\n    \/\/ use the new allocation as the new first argument\n    new_call_args.emplace(new_call_args.begin(),\n                          llvm::cast<llvm::Value>(return_value_alloc));\n    llvm::PointerType *new_func_ptr_type =\n        llvm::PointerType::get(new_func_type, 0);\n    \/\/ Create the type cast from the old function type to the new one\n    llvm::Constant *new_func_cast = llvm::ConstantExpr::getCast(\n        llvm::Instruction::BitCast, func, new_func_ptr_type);\n    \/\/ create an allocation for a new function pointer\n    llvm::AllocaInst *new_func_ptr =\n        new llvm::AllocaInst(new_func_ptr_type, \"new_func_ptr\", call_inst);\n    \/\/ store the new_func_cast to the newly allocated space\n    (new llvm::StoreInst(new_func_cast, new_func_ptr, call_inst))\n        ->setName(\"new_func_ptr_load_cast\");\n    \/\/ load the new function address ready for a jump\n    llvm::LoadInst *new_func_addr_load =\n        new llvm::LoadInst(new_func_ptr, \"load_func_pointer\", call_inst);\n    \/\/ and create a callinstruction from it\n    llvm::CallInst *new_call_inst = llvm::CallInst::Create(\n        new_func_addr_load, new_call_args, \"new_func_call\", call_inst);\n    new_call_inst->setCallingConv(call_inst->getCallingConv());\n    new_call_inst->setTailCall(call_inst->isTailCall());\n    llvm::LoadInst *lldb_save_result_address =\n        new llvm::LoadInst(return_value_alloc, \"save_return_val\", call_inst);\n\n    \/\/ Now remove the old broken call\n    call_inst->replaceAllUsesWith(lldb_save_result_address);\n    call_inst->eraseFromParent();\n    changed = true;\n  }\n  return changed;\n}\n\nbool fixupRSAllocationStructByValCalls(llvm::Module &module) {\n  \/\/ On x86_64, calls to functions in the RS runtime that take an\n  \/\/ `rs_allocation` type argument\n  \/\/ are actually handled as by-ref params by bcc, but appear to be passed by\n  \/\/ value by lldb (the callsite all use\n  \/\/ `struct byval`).\n  \/\/ On x86_64 Linux, struct arguments are transferred in registers if the\n  \/\/ struct size is no bigger than\n  \/\/ 128bits [ref](http:\/\/www.agner.org\/optimize\/calling_conventions.pdf)\n  \/\/ section 7.1 \"Passing and returning objects\"\n  \/\/ otherwise passed on the stack.\n  \/\/ an object of type `rs_allocation` is actually 256bits, so should be passed\n  \/\/ on the stack. However, code generated\n  \/\/ by bcc actually treats formal params of type `rs_allocation` as\n  \/\/ `rs_allocation *` so we need to convert the\n  \/\/ calling convention to pass by reference, and remove any hint of byval from\n  \/\/ formal parameters.\n  bool changed = false;\n  std::set<llvm::CallInst *> rs_callsites;\n  if (!findRSCallSites(module, rs_callsites, isRSAllocationTyCallSite))\n    return false;\n\n  std::set<llvm::Function *> rs_functions;\n\n  \/\/ for all call instructions\n  for (auto call_inst : rs_callsites) {\n    \/\/ add the called function to a set so that we can strip its byval\n    \/\/ attributes in another pass\n    rs_functions.insert(call_inst->getCalledFunction());\n\n    \/\/ get the function attributes\n    llvm::AttributeList call_attribs = call_inst->getAttributes();\n\n    \/\/ iterate over the argument attributes\n    for (size_t i = 1; i <= call_attribs.getNumSlots(); ++i) {\n      \/\/ if this argument is passed by val\n      if (call_attribs.hasAttribute(i, llvm::Attribute::ByVal)) {\n        \/\/ strip away the byval attribute\n        call_inst->removeAttribute(i, llvm::Attribute::ByVal);\n        changed = true;\n      }\n    }\n  }\n\n  \/\/ for all called function decls\n  for (auto func : rs_functions) {\n    \/\/ inspect all of the arguments in the call\n    for (auto &arg : func->args()) {\n      if (arg.hasByValAttr()) {\n        arg.removeAttr(llvm::Attribute::ByVal);\n        changed = true;\n      }\n    }\n  }\n  return changed;\n}\n} \/\/ end anonymous namespace\n\nnamespace lldb_private {\nnamespace lldb_renderscript {\n\nbool fixupX86FunctionCalls(llvm::Module &module) {\n  return fixupX86StructRetCalls(module);\n}\n\nbool fixupX86_64FunctionCalls(llvm::Module &module) {\n  bool changed = false;\n  changed |= fixupX86StructRetCalls(module);\n  changed |= fixupRSAllocationStructByValCalls(module);\n  return changed;\n}\n\n} \/\/ end namespace lldb_renderscript\n} \/\/ end namespace lldb_private\n<commit_msg>Update for alloca construction changes<commit_after>\/\/===-- RenderScriptx86ABIFixups.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#include <set>\n\n\/\/ Other libraries and framework includes\n#include \"llvm\/ADT\/StringRef.h\"\n#include \"llvm\/IR\/BasicBlock.h\"\n#include \"llvm\/IR\/CallSite.h\"\n#include \"llvm\/IR\/Constants.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/IR\/Instruction.h\"\n#include \"llvm\/IR\/Instructions.h\"\n#include \"llvm\/IR\/Module.h\"\n#include \"llvm\/IRReader\/IRReader.h\"\n#include \"llvm\/Pass.h\"\n\n\/\/ Project includes\n#include \"lldb\/Target\/Process.h\"\n#include \"lldb\/Utility\/Log.h\"\n\nusing namespace lldb_private;\nnamespace {\n\nbool isRSAPICall(llvm::Module &module, llvm::CallInst *call_inst) {\n  \/\/ TODO get the list of renderscript modules from lldb and check if\n  \/\/ this llvm::Module calls into any of them.\n  (void)module;\n  const auto func_name = call_inst->getCalledFunction()->getName();\n  if (func_name.startswith(\"llvm\") || func_name.startswith(\"lldb\"))\n    return false;\n\n  if (call_inst->getCalledFunction()->isIntrinsic())\n    return false;\n\n  return true;\n}\n\nbool isRSLargeReturnCall(llvm::Module &module, llvm::CallInst *call_inst) {\n  \/\/ i686 and x86_64 returns for large vectors in the RenderScript API are not\n  \/\/ handled as normal\n  \/\/ register pairs, but as a hidden sret type. This is not reflected in the\n  \/\/ debug info or mangled\n  \/\/ symbol name, and the android ABI for x86 and x86_64, (as well as the\n  \/\/ emulators) specifies there is\n  \/\/ no AVX, so bcc generates an sret function because we cannot natively return\n  \/\/ 256 bit vectors.\n  \/\/ This function simply checks whether a function has a > 128bit return type.\n  \/\/ It is perhaps an\n  \/\/ unreliable heuristic, and relies on bcc not generating AVX code, so if the\n  \/\/ android ABI one day\n  \/\/ provides for AVX, this function may go out of fashion.\n  (void)module;\n  if (!call_inst || !call_inst->getCalledFunction())\n    return false;\n\n  return call_inst->getCalledFunction()\n             ->getReturnType()\n             ->getPrimitiveSizeInBits() > 128;\n}\n\nbool isRSAllocationPtrTy(const llvm::Type *type) {\n  if (!type->isPointerTy())\n    return false;\n  auto ptr_type = type->getPointerElementType();\n\n  return ptr_type->isStructTy() &&\n         ptr_type->getStructName().startswith(\"struct.rs_allocation\");\n}\n\nbool isRSAllocationTyCallSite(llvm::Module &module, llvm::CallInst *call_inst) {\n  (void)module;\n  if (!call_inst->hasByValArgument())\n    return false;\n  for (const auto &param : call_inst->operand_values())\n    if (isRSAllocationPtrTy(param->getType()))\n      return true;\n  return false;\n}\n\nllvm::FunctionType *cloneToStructRetFnTy(llvm::CallInst *call_inst) {\n  \/\/ on x86 StructReturn functions return a pointer to the return value, rather\n  \/\/ than the return\n  \/\/ value itself [ref](http:\/\/www.agner.org\/optimize\/calling_conventions.pdf\n  \/\/ section 6).\n  \/\/ We create a return type by getting the pointer type of the old return type,\n  \/\/ and inserting a new\n  \/\/ initial argument of pointer type of the original return type.\n  Log *log(\n      GetLogIfAnyCategoriesSet(LIBLLDB_LOG_LANGUAGE | LIBLLDB_LOG_EXPRESSIONS));\n\n  assert(call_inst && \"no CallInst\");\n  llvm::Function *orig = call_inst->getCalledFunction();\n  assert(orig && \"CallInst has no called function\");\n  llvm::FunctionType *orig_type = orig->getFunctionType();\n  auto name = orig->getName();\n  if (log)\n    log->Printf(\"%s - cloning to StructRet function for '%s'\", __FUNCTION__,\n                name.str().c_str());\n\n  unsigned num_params = orig_type->getNumParams();\n  std::vector<llvm::Type *> new_params{num_params + 1, nullptr};\n  std::vector<llvm::Type *> params{orig_type->param_begin(),\n                                   orig_type->param_end()};\n\n  \/\/ This may not work if the function is somehow declared void as llvm is\n  \/\/ strongly typed\n  \/\/ and represents void* with i8*\n  assert(!orig_type->getReturnType()->isVoidTy() &&\n         \"Cannot add StructRet attribute to void function\");\n  llvm::PointerType *return_type_ptr_type =\n      llvm::PointerType::getUnqual(orig->getReturnType());\n  assert(return_type_ptr_type &&\n         \"failed to get function return type PointerType\");\n  if (!return_type_ptr_type)\n    return nullptr;\n\n  if (log)\n    log->Printf(\"%s - return type pointer type for StructRet clone @ '0x%p':\\n\",\n                __FUNCTION__, (void *)return_type_ptr_type);\n  \/\/ put the the sret pointer argument in place at the beginning of the argument\n  \/\/ list.\n  params.emplace(params.begin(), return_type_ptr_type);\n  assert(params.size() == num_params + 1);\n  return llvm::FunctionType::get(return_type_ptr_type, params,\n                                 orig->isVarArg());\n}\n\nbool findRSCallSites(llvm::Module &module,\n                     std::set<llvm::CallInst *> &rs_callsites,\n                     bool (*predicate)(llvm::Module &, llvm::CallInst *)) {\n  bool found = false;\n\n  for (auto &func : module.getFunctionList())\n    for (auto &block : func.getBasicBlockList())\n      for (auto &inst : block) {\n        llvm::CallInst *call_inst =\n            llvm::dyn_cast_or_null<llvm::CallInst>(&inst);\n        if (!call_inst || !call_inst->getCalledFunction())\n          \/\/ This is not the call-site you are looking for...\n          continue;\n        if (isRSAPICall(module, call_inst) && predicate(module, call_inst)) {\n          rs_callsites.insert(call_inst);\n          found = true;\n        }\n      }\n  return found;\n}\n\nbool fixupX86StructRetCalls(llvm::Module &module) {\n  bool changed = false;\n  \/\/ changing a basic block while iterating over it seems to have some undefined\n  \/\/ behaviour\n  \/\/ going on so we find all RS callsites first, then fix them up after\n  \/\/ consuming\n  \/\/ the iterator.\n  std::set<llvm::CallInst *> rs_callsites;\n  if (!findRSCallSites(module, rs_callsites, isRSLargeReturnCall))\n    return false;\n\n  for (auto call_inst : rs_callsites) {\n    llvm::FunctionType *new_func_type = cloneToStructRetFnTy(call_inst);\n    assert(new_func_type &&\n           \"failed to clone functionType for Renderscript ABI fixup\");\n\n    llvm::CallSite call_site(call_inst);\n    llvm::Function *func = call_inst->getCalledFunction();\n    assert(func && \"cannot resolve function in RenderScriptRuntime\");\n    \/\/ Copy the original call arguments\n    std::vector<llvm::Value *> new_call_args(call_site.arg_begin(),\n                                             call_site.arg_end());\n\n    \/\/ Allocate enough space to store the return value of the original function\n    \/\/ we pass a pointer to this allocation as the StructRet param, and then\n    \/\/ copy its\n    \/\/ value into the lldb return value\n    const llvm::DataLayout &DL = module.getDataLayout();\n    llvm::AllocaInst *return_value_alloc = new llvm::AllocaInst(\n      func->getReturnType(), DL.getAllocaAddrSpace(), \"var_vector_return_alloc\",\n      call_inst);\n    \/\/ use the new allocation as the new first argument\n    new_call_args.emplace(new_call_args.begin(),\n                          llvm::cast<llvm::Value>(return_value_alloc));\n    llvm::PointerType *new_func_ptr_type =\n        llvm::PointerType::get(new_func_type, 0);\n    \/\/ Create the type cast from the old function type to the new one\n    llvm::Constant *new_func_cast = llvm::ConstantExpr::getCast(\n        llvm::Instruction::BitCast, func, new_func_ptr_type);\n    \/\/ create an allocation for a new function pointer\n    llvm::AllocaInst *new_func_ptr =\n        new llvm::AllocaInst(new_func_ptr_type, DL.getAllocaAddrSpace(),\n                             \"new_func_ptr\", call_inst);\n    \/\/ store the new_func_cast to the newly allocated space\n    (new llvm::StoreInst(new_func_cast, new_func_ptr, call_inst))\n        ->setName(\"new_func_ptr_load_cast\");\n    \/\/ load the new function address ready for a jump\n    llvm::LoadInst *new_func_addr_load =\n        new llvm::LoadInst(new_func_ptr, \"load_func_pointer\", call_inst);\n    \/\/ and create a callinstruction from it\n    llvm::CallInst *new_call_inst = llvm::CallInst::Create(\n        new_func_addr_load, new_call_args, \"new_func_call\", call_inst);\n    new_call_inst->setCallingConv(call_inst->getCallingConv());\n    new_call_inst->setTailCall(call_inst->isTailCall());\n    llvm::LoadInst *lldb_save_result_address =\n        new llvm::LoadInst(return_value_alloc, \"save_return_val\", call_inst);\n\n    \/\/ Now remove the old broken call\n    call_inst->replaceAllUsesWith(lldb_save_result_address);\n    call_inst->eraseFromParent();\n    changed = true;\n  }\n  return changed;\n}\n\nbool fixupRSAllocationStructByValCalls(llvm::Module &module) {\n  \/\/ On x86_64, calls to functions in the RS runtime that take an\n  \/\/ `rs_allocation` type argument\n  \/\/ are actually handled as by-ref params by bcc, but appear to be passed by\n  \/\/ value by lldb (the callsite all use\n  \/\/ `struct byval`).\n  \/\/ On x86_64 Linux, struct arguments are transferred in registers if the\n  \/\/ struct size is no bigger than\n  \/\/ 128bits [ref](http:\/\/www.agner.org\/optimize\/calling_conventions.pdf)\n  \/\/ section 7.1 \"Passing and returning objects\"\n  \/\/ otherwise passed on the stack.\n  \/\/ an object of type `rs_allocation` is actually 256bits, so should be passed\n  \/\/ on the stack. However, code generated\n  \/\/ by bcc actually treats formal params of type `rs_allocation` as\n  \/\/ `rs_allocation *` so we need to convert the\n  \/\/ calling convention to pass by reference, and remove any hint of byval from\n  \/\/ formal parameters.\n  bool changed = false;\n  std::set<llvm::CallInst *> rs_callsites;\n  if (!findRSCallSites(module, rs_callsites, isRSAllocationTyCallSite))\n    return false;\n\n  std::set<llvm::Function *> rs_functions;\n\n  \/\/ for all call instructions\n  for (auto call_inst : rs_callsites) {\n    \/\/ add the called function to a set so that we can strip its byval\n    \/\/ attributes in another pass\n    rs_functions.insert(call_inst->getCalledFunction());\n\n    \/\/ get the function attributes\n    llvm::AttributeList call_attribs = call_inst->getAttributes();\n\n    \/\/ iterate over the argument attributes\n    for (size_t i = 1; i <= call_attribs.getNumSlots(); ++i) {\n      \/\/ if this argument is passed by val\n      if (call_attribs.hasAttribute(i, llvm::Attribute::ByVal)) {\n        \/\/ strip away the byval attribute\n        call_inst->removeAttribute(i, llvm::Attribute::ByVal);\n        changed = true;\n      }\n    }\n  }\n\n  \/\/ for all called function decls\n  for (auto func : rs_functions) {\n    \/\/ inspect all of the arguments in the call\n    for (auto &arg : func->args()) {\n      if (arg.hasByValAttr()) {\n        arg.removeAttr(llvm::Attribute::ByVal);\n        changed = true;\n      }\n    }\n  }\n  return changed;\n}\n} \/\/ end anonymous namespace\n\nnamespace lldb_private {\nnamespace lldb_renderscript {\n\nbool fixupX86FunctionCalls(llvm::Module &module) {\n  return fixupX86StructRetCalls(module);\n}\n\nbool fixupX86_64FunctionCalls(llvm::Module &module) {\n  bool changed = false;\n  changed |= fixupX86StructRetCalls(module);\n  changed |= fixupRSAllocationStructByValCalls(module);\n  return changed;\n}\n\n} \/\/ end namespace lldb_renderscript\n} \/\/ end namespace lldb_private\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 descriptor_test.hpp\n * \\date July 2015\n * \\author Jan Issac (jan.issac@gmail.com)\n *\/\n\n#include <gtest\/gtest.h>\n\n#include <fl\/util\/descriptor.hpp>\n\ntemplate <typename...> class Dummy;\n\ntemplate <>\nclass Dummy<>\n    : public fl::Descriptor\n{\npublic:\n    virtual std::string name() const\n    {\n        return \"Dummy<>\";\n    }\n\n    virtual std::string description() const\n    {\n        return \"Dummy class implementing the fl::Descriptor\";\n    }\n};\n\ntemplate <typename D>\nclass NestedDummy\n    : public D\n{\npublic:\n    virtual std::string name() const\n    {\n        return \"NestedDummy<\" + indent(D::name()) + \">\";\n    }\n\n    virtual std::string description() const\n    {\n        return \"NestedDummy class implementing the fl::Descriptor with\"\n                + indent(D::description());\n    }\n};\n\nTEST(DescriptorTests, Dummy_name)\n{\n    Dummy<> dummy;\n    EXPECT_STREQ(dummy.name().c_str(), \"Dummy<>\");\n}\n\nTEST(DescriptorTests, Dummy_description)\n{\n    Dummy<> dummy;\n    EXPECT_STREQ(dummy.description().c_str(),\n                 \"Dummy class implementing the fl::Descriptor\");\n}\n\nTEST(DescriptorTests, Dummy_indent)\n{\n    Dummy<> dummy;\n\n    EXPECT_STREQ(dummy.indent(dummy.description()).c_str()  ,\n                 \"\\n    Dummy class implementing the fl::Descriptor\");\n}\n\n\nTEST(DescriptorTests, NestedDummy_name)\n{\n    NestedDummy<Dummy<>> dummy;\n    EXPECT_STREQ(dummy.name().c_str(), \"NestedDummy<\\n    Dummy<>>\");\n}\n\nTEST(DescriptorTests, NestedDummy_description)\n{\n    NestedDummy<Dummy<>> dummy;\n    EXPECT_STREQ(dummy.description().c_str(),\n                 \"NestedDummy class implementing the fl::Descriptor with\"\n                 \"\\n    Dummy class implementing the fl::Descriptor\");\n}\n\nTEST(DescriptorTests, NestedDummy_indent)\n{\n    NestedDummy<Dummy<>> dummy;\n\n    EXPECT_STREQ(dummy.indent(dummy.description()).c_str()  ,\n                 \"\\n    NestedDummy class implementing the fl::Descriptor with\"\n                 \"\\n        Dummy class implementing the fl::Descriptor\");\n}\n\n\nTEST(DescriptorTests, NestedNestedDummy_name)\n{\n    NestedDummy<NestedDummy<Dummy<>>> dummy;\n\n    EXPECT_STREQ(dummy.name().c_str(),\n                 \"NestedDummy<\\n    NestedDummy<\\n        Dummy<>>>\");\n}\n\nTEST(DescriptorTests, NestedNestedDummy_description)\n{\n    NestedDummy<NestedDummy<Dummy<>>> dummy;\n\n    EXPECT_STREQ(dummy.description().c_str(),\n                 \"NestedDummy class implementing the fl::Descriptor with\"\n                 \"\\n    NestedDummy class implementing the fl::Descriptor with\"\n                 \"\\n        Dummy class implementing the fl::Descriptor\");\n}\n<commit_msg>fixed argument-dependent lookup for gcc 4.7 and above<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 descriptor_test.hpp\n * \\date July 2015\n * \\author Jan Issac (jan.issac@gmail.com)\n *\/\n\n#include <gtest\/gtest.h>\n\n#include <fl\/util\/descriptor.hpp>\n\ntemplate <typename...> class Dummy;\n\ntemplate <>\nclass Dummy<>\n    : public fl::Descriptor\n{\npublic:\n    virtual std::string name() const\n    {\n        return \"Dummy<>\";\n    }\n\n    virtual std::string description() const\n    {\n        return \"Dummy class implementing the fl::Descriptor\";\n    }\n};\n\ntemplate <typename D>\nclass NestedDummy\n    : public D\n{\npublic:\n    using D::indent;\n\n    virtual std::string name() const\n    {\n        return \"NestedDummy<\" + indent(D::name()) + \">\";\n    }\n\n    virtual std::string description() const\n    {\n        return \"NestedDummy class implementing the fl::Descriptor with\"\n                + indent(D::description());\n    }\n};\n\nTEST(DescriptorTests, Dummy_name)\n{\n    Dummy<> dummy;\n    EXPECT_STREQ(dummy.name().c_str(), \"Dummy<>\");\n}\n\nTEST(DescriptorTests, Dummy_description)\n{\n    Dummy<> dummy;\n    EXPECT_STREQ(dummy.description().c_str(),\n                 \"Dummy class implementing the fl::Descriptor\");\n}\n\nTEST(DescriptorTests, Dummy_indent)\n{\n    Dummy<> dummy;\n\n    EXPECT_STREQ(dummy.indent(dummy.description()).c_str()  ,\n                 \"\\n    Dummy class implementing the fl::Descriptor\");\n}\n\n\nTEST(DescriptorTests, NestedDummy_name)\n{\n    NestedDummy<Dummy<>> dummy;\n    EXPECT_STREQ(dummy.name().c_str(), \"NestedDummy<\\n    Dummy<>>\");\n}\n\nTEST(DescriptorTests, NestedDummy_description)\n{\n    NestedDummy<Dummy<>> dummy;\n    EXPECT_STREQ(dummy.description().c_str(),\n                 \"NestedDummy class implementing the fl::Descriptor with\"\n                 \"\\n    Dummy class implementing the fl::Descriptor\");\n}\n\nTEST(DescriptorTests, NestedDummy_indent)\n{\n    NestedDummy<Dummy<>> dummy;\n\n    EXPECT_STREQ(dummy.indent(dummy.description()).c_str()  ,\n                 \"\\n    NestedDummy class implementing the fl::Descriptor with\"\n                 \"\\n        Dummy class implementing the fl::Descriptor\");\n}\n\n\nTEST(DescriptorTests, NestedNestedDummy_name)\n{\n    NestedDummy<NestedDummy<Dummy<>>> dummy;\n\n    EXPECT_STREQ(dummy.name().c_str(),\n                 \"NestedDummy<\\n    NestedDummy<\\n        Dummy<>>>\");\n}\n\nTEST(DescriptorTests, NestedNestedDummy_description)\n{\n    NestedDummy<NestedDummy<Dummy<>>> dummy;\n\n    EXPECT_STREQ(dummy.description().c_str(),\n                 \"NestedDummy class implementing the fl::Descriptor with\"\n                 \"\\n    NestedDummy class implementing the fl::Descriptor with\"\n                 \"\\n        Dummy class implementing the fl::Descriptor\");\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ C++\n#include <iostream>\n#include <string>\n\n\/\/ PCL - visualziation\n#include <pcl\/visualization\/common\/common.h>\n\n\/\/ PCL - outofcore\n#include <pcl\/outofcore\/visualization\/camera.h>\n#include <pcl\/outofcore\/visualization\/object.h>\n\n\/\/ VTK\n#include <vtkActor.h>\n#include <vtkCamera.h>\n#include <vtkCameraActor.h>\n#include <vtkHull.h>\n#include <vtkPlanes.h>\n#include <vtkPolyData.h>\n#include <vtkPolyDataMapper.h>\n#include <vtkProperty.h>\n#include <vtkSmartPointer.h>\n\n\/\/ Operators\n\/\/ -----------------------------------------------------------------------------\nCamera::Camera (std::string name) :\n    Object (name), display_ (false)\n{\n  camera_ = vtkSmartPointer<vtkCamera>::New ();\n  camera_->SetClippingRange(0.0001, 100000);\n\n  camera_actor_ = vtkSmartPointer<vtkCameraActor>::New ();\n  camera_actor_->SetCamera (camera_);\n  camera_actor_->GetProperty ()->SetLighting (0);\n  camera_actor_->GetProperty ()->SetLineStipplePattern (1010101010);\n\n  for (int i = 0; i < 24; i++)\n    frustum_[i] = 0;\n\n  hull_actor_ = vtkSmartPointer<vtkActor>::New ();\n  vtkSmartPointer<vtkPolyDataMapper> hull_mapper = vtkSmartPointer<vtkPolyDataMapper>::New ();\n\n  hull_actor_->SetMapper (hull_mapper);\n  hull_actor_->GetProperty ()->SetLighting (0);\n  hull_actor_->GetProperty ()->SetColor (1.0, 0.0, 0.0);\n  hull_actor_->GetProperty ()->SetOpacity (0.25);\n}\n\nCamera::Camera (std::string name, vtkSmartPointer<vtkCamera> camera) :\n    Object (name), display_ (false)\n{\n  camera_ = camera;\n  camera_->SetClippingRange(0.0001, 100000);\n\n  camera_actor_ = vtkSmartPointer<vtkCameraActor>::New ();\n  camera_actor_->SetCamera (camera_);\n  camera_actor_->GetProperty ()->SetLighting (0);\n\n  for (int i = 0; i < 24; i++)\n    frustum_[i] = 0;\n\n  hull_actor_ = vtkSmartPointer<vtkActor>::New ();\n  vtkSmartPointer<vtkPolyDataMapper> hull_mapper = vtkSmartPointer<vtkPolyDataMapper>::New ();\n\n  hull_actor_->SetMapper (hull_mapper);\n  hull_actor_->GetProperty ()->SetLighting (0);\n  hull_actor_->GetProperty ()->SetColor (1.0, 0.0, 0.0);\n  hull_actor_->GetProperty ()->SetOpacity (0.25);\n\n  prevUp_[0] = prevUp_[1] = prevUp_[2] = 0;\n  prevFocal_[0] = prevFocal_[1] = prevFocal_[2] = 0;\n  prevPos_[0] = prevPos_[1] = prevPos_[2] = 0;\n}\n\n\/\/std::ostream & operator<<(std::ostream &os, const Camera& camera)\n\/\/{\n\/\/    return os << camera.getName();\n\/\/}\n\n\/\/ Methods\n\/\/ -----------------------------------------------------------------------------\nvoid\n\/\/Camera::computeFrustum(double aspect)\nCamera::computeFrustum ()\n{\n  \/\/ The planes array contains six plane equations of the form (Ax+By+Cz+D=0), the first four values are (A,B,C,D)\n  \/\/ which repeats for each of the planes. The planes are given in the following order: -x,+x,-y,+y,-z,+z.\n  \/\/camera_->GetFrustumPlanes(aspect, frustum_);\n\n  pcl::visualization::getViewFrustum (getViewProjectionMatrix (), frustum_);\n\n  vtkSmartPointer<vtkHull> hull = vtkSmartPointer<vtkHull>::New ();\n  vtkSmartPointer<vtkPlanes> planes = vtkSmartPointer<vtkPlanes>::New ();\n  vtkSmartPointer<vtkPolyData> hullData = vtkSmartPointer<vtkPolyData>::New ();\n\n  planes->SetFrustumPlanes (frustum_);\n  hull->SetPlanes (planes);\n  hull->GenerateHull (hullData, -200, 200, -200, 200, -200, 200);\n\n  vtkSmartPointer<vtkPolyDataMapper> hull_mapper = static_cast<vtkPolyDataMapper*> (hull_actor_->GetMapper ());\n\n#if VTK_MAJOR_VERSION <= 5\n  hull_mapper->SetInput (hullData);\n#else\n  hull_mapper->SetInputData(hullData);\n#endif\n\n  hull_actor_->SetMapper (hull_mapper);\n}\n\nvoid\nCamera::printFrustum ()\n{\n  for (int i = 0; i < 6; i++)\n  {\n    std::cout << frustum_[(i * 4)] << \"x + \" << frustum_[(i * 4) + 1] << \"y + \" << frustum_[(i * 4) + 2] << \"z + \"\n        << frustum_[(i * 4) + 3] << std::endl;\n  }\n}\n\nvoid\nCamera::render (vtkRenderer* renderer)\n{\n  vtkSmartPointer<vtkCamera> active_camera = renderer->GetActiveCamera ();\n\n  if (camera_.GetPointer() != active_camera.GetPointer())\n  {\n    if (display_)\n    {\n      renderer->AddActor (camera_actor_);\n      renderer->AddActor (hull_actor_);\n    }\n    else\n    {\n      renderer->RemoveActor (camera_actor_);\n      renderer->RemoveActor (hull_actor_);\n    }\n    return;\n  }\n\n  \/\/ Reset clipping range\n  setClippingRange();\n\n  double *up = active_camera->GetViewUp ();\n  double *focal = active_camera->GetFocalPoint ();\n  double *pos = active_camera->GetPosition ();\n\n  bool viewpointChanged = false;\n\n  \/\/ Check up vector\n  if (up[0] != prevUp_[0] || up[1] != prevUp_[1] || up[2] != prevUp_[2])\n    viewpointChanged = true;\n\n  \/\/ Check focal point\n  if (focal[0] != prevFocal_[0] || focal[1] != prevFocal_[1] || focal[2] != prevFocal_[2])\n    viewpointChanged = true;\n\n  \/\/ Check position\n  if (pos[0] != prevPos_[0] || pos[1] != prevPos_[1] || pos[2] != prevPos_[2])\n    viewpointChanged = true;\n\n  \/\/ Break loop if the viewpoint hasn't changed\n  if (viewpointChanged)\n  {\n    prevUp_[0] = up[0];\n    prevUp_[1] = up[1];\n    prevUp_[2] = up[2];\n    prevFocal_[0] = focal[0];\n    prevFocal_[1] = focal[1];\n    prevFocal_[2] = focal[2];\n    prevPos_[0] = pos[0];\n    prevPos_[1] = pos[1];\n    prevPos_[2] = pos[2];\n\n\/\/        std::cout << \"View Changed\" << std::endl;\n\/\/        std::cout << \"Up: <\" << up[0] << \", \" << up[1] << \", \" << up[2] << \">\" << std::endl;\n\/\/        std::cout << \"Focal: <\" << focal[0] << \", \" << focal[1] << \", \" << focal[2] << \">\" << std::endl;\n\/\/        std::cout << \"Pos: <\" << pos[0] << \", \" << pos[1] << \", \" << pos[2] << \">\" << std::endl;\n\n    {\n      renderer->ComputeAspect ();\n      double *aspect = renderer->GetAspect ();\n\n      projection_matrix_ = pcl::visualization::vtkToEigen (active_camera->GetProjectionTransformMatrix (aspect[0] \/ aspect[1], 0.0, 1.0));\n      model_view_matrix_ = pcl::visualization::vtkToEigen (active_camera->GetModelViewTransformMatrix ());\n\n      \/\/computeFrustum (renderer->GetTiledAspectRatio());\n      computeFrustum ();\n    }\n  }\n\n  Object::render(renderer);\n}\n<commit_msg>Removing camera hull from computing possibly causing crashing<commit_after>\/\/ C++\n#include <iostream>\n#include <string>\n\n\/\/ PCL - visualziation\n#include <pcl\/visualization\/common\/common.h>\n\n\/\/ PCL - outofcore\n#include <pcl\/outofcore\/visualization\/camera.h>\n#include <pcl\/outofcore\/visualization\/object.h>\n\n\/\/ VTK\n#include <vtkActor.h>\n#include <vtkCamera.h>\n#include <vtkCameraActor.h>\n#include <vtkHull.h>\n#include <vtkPlanes.h>\n#include <vtkPolyData.h>\n#include <vtkPolyDataMapper.h>\n#include <vtkProperty.h>\n#include <vtkSmartPointer.h>\n\n\/\/ Operators\n\/\/ -----------------------------------------------------------------------------\nCamera::Camera (std::string name) :\n    Object (name), display_ (false)\n{\n  camera_ = vtkSmartPointer<vtkCamera>::New ();\n  camera_->SetClippingRange(0.0001, 100000);\n\n  camera_actor_ = vtkSmartPointer<vtkCameraActor>::New ();\n  camera_actor_->SetCamera (camera_);\n  camera_actor_->GetProperty ()->SetLighting (0);\n  camera_actor_->GetProperty ()->SetLineStipplePattern (1010101010);\n\n  for (int i = 0; i < 24; i++)\n    frustum_[i] = 0;\n\n  hull_actor_ = vtkSmartPointer<vtkActor>::New ();\n  vtkSmartPointer<vtkPolyDataMapper> hull_mapper = vtkSmartPointer<vtkPolyDataMapper>::New ();\n\n  hull_actor_->SetMapper (hull_mapper);\n  hull_actor_->GetProperty ()->SetLighting (0);\n  hull_actor_->GetProperty ()->SetColor (1.0, 0.0, 0.0);\n  hull_actor_->GetProperty ()->SetOpacity (0.25);\n}\n\nCamera::Camera (std::string name, vtkSmartPointer<vtkCamera> camera) :\n    Object (name), display_ (false)\n{\n  camera_ = camera;\n  camera_->SetClippingRange(0.0001, 100000);\n\n  camera_actor_ = vtkSmartPointer<vtkCameraActor>::New ();\n  camera_actor_->SetCamera (camera_);\n  camera_actor_->GetProperty ()->SetLighting (0);\n\n  for (int i = 0; i < 24; i++)\n    frustum_[i] = 0;\n\n  hull_actor_ = vtkSmartPointer<vtkActor>::New ();\n  vtkSmartPointer<vtkPolyDataMapper> hull_mapper = vtkSmartPointer<vtkPolyDataMapper>::New ();\n\n  hull_actor_->SetMapper (hull_mapper);\n  hull_actor_->GetProperty ()->SetLighting (0);\n  hull_actor_->GetProperty ()->SetColor (1.0, 0.0, 0.0);\n  hull_actor_->GetProperty ()->SetOpacity (0.25);\n\n  prevUp_[0] = prevUp_[1] = prevUp_[2] = 0;\n  prevFocal_[0] = prevFocal_[1] = prevFocal_[2] = 0;\n  prevPos_[0] = prevPos_[1] = prevPos_[2] = 0;\n}\n\n\/\/std::ostream & operator<<(std::ostream &os, const Camera& camera)\n\/\/{\n\/\/    return os << camera.getName();\n\/\/}\n\n\/\/ Methods\n\/\/ -----------------------------------------------------------------------------\nvoid\n\/\/Camera::computeFrustum(double aspect)\nCamera::computeFrustum ()\n{\n  \/\/ The planes array contains six plane equations of the form (Ax+By+Cz+D=0), the first four values are (A,B,C,D)\n  \/\/ which repeats for each of the planes. The planes are given in the following order: -x,+x,-y,+y,-z,+z.\n  \/\/camera_->GetFrustumPlanes(aspect, frustum_);\n\n  pcl::visualization::getViewFrustum (getViewProjectionMatrix (), frustum_);\n\n\/\/  vtkSmartPointer<vtkHull> hull = vtkSmartPointer<vtkHull>::New ();\n\/\/  vtkSmartPointer<vtkPlanes> planes = vtkSmartPointer<vtkPlanes>::New ();\n\/\/  vtkSmartPointer<vtkPolyData> hullData = vtkSmartPointer<vtkPolyData>::New ();\n\/\/\n\/\/  planes->SetFrustumPlanes (frustum_);\n\/\/  hull->SetPlanes (planes);\n\/\/  hull->GenerateHull (hullData, -200, 200, -200, 200, -200, 200);\n\/\/\n\/\/  vtkSmartPointer<vtkPolyDataMapper> hull_mapper = static_cast<vtkPolyDataMapper*> (hull_actor_->GetMapper ());\n\/\/\n\/\/#if VTK_MAJOR_VERSION <= 5\n\/\/  hull_mapper->SetInput (hullData);\n\/\/#else\n\/\/  hull_mapper->SetInputData(hullData);\n\/\/#endif\n\/\/\n\/\/  hull_actor_->SetMapper (hull_mapper);\n}\n\nvoid\nCamera::printFrustum ()\n{\n  for (int i = 0; i < 6; i++)\n  {\n    std::cout << frustum_[(i * 4)] << \"x + \" << frustum_[(i * 4) + 1] << \"y + \" << frustum_[(i * 4) + 2] << \"z + \"\n        << frustum_[(i * 4) + 3] << std::endl;\n  }\n}\n\nvoid\nCamera::render (vtkRenderer* renderer)\n{\n  vtkSmartPointer<vtkCamera> active_camera = renderer->GetActiveCamera ();\n\n\/\/  if (camera_.GetPointer() != active_camera.GetPointer())\n\/\/  {\n\/\/    if (display_)\n\/\/    {\n\/\/      renderer->AddActor (camera_actor_);\n\/\/      renderer->AddActor (hull_actor_);\n\/\/    }\n\/\/    else\n\/\/    {\n\/\/      renderer->RemoveActor (camera_actor_);\n\/\/      renderer->RemoveActor (hull_actor_);\n\/\/    }\n\/\/    return;\n\/\/  }\n\n  \/\/ Reset clipping range\n  setClippingRange();\n\n  double *up = active_camera->GetViewUp ();\n  double *focal = active_camera->GetFocalPoint ();\n  double *pos = active_camera->GetPosition ();\n\n  bool viewpointChanged = false;\n\n  \/\/ Check up vector\n  if (up[0] != prevUp_[0] || up[1] != prevUp_[1] || up[2] != prevUp_[2])\n    viewpointChanged = true;\n\n  \/\/ Check focal point\n  if (focal[0] != prevFocal_[0] || focal[1] != prevFocal_[1] || focal[2] != prevFocal_[2])\n    viewpointChanged = true;\n\n  \/\/ Check position\n  if (pos[0] != prevPos_[0] || pos[1] != prevPos_[1] || pos[2] != prevPos_[2])\n    viewpointChanged = true;\n\n  \/\/ Break loop if the viewpoint hasn't changed\n  if (viewpointChanged)\n  {\n    prevUp_[0] = up[0];\n    prevUp_[1] = up[1];\n    prevUp_[2] = up[2];\n    prevFocal_[0] = focal[0];\n    prevFocal_[1] = focal[1];\n    prevFocal_[2] = focal[2];\n    prevPos_[0] = pos[0];\n    prevPos_[1] = pos[1];\n    prevPos_[2] = pos[2];\n\n\/\/        std::cout << \"View Changed\" << std::endl;\n\/\/        std::cout << \"Up: <\" << up[0] << \", \" << up[1] << \", \" << up[2] << \">\" << std::endl;\n\/\/        std::cout << \"Focal: <\" << focal[0] << \", \" << focal[1] << \", \" << focal[2] << \">\" << std::endl;\n\/\/        std::cout << \"Pos: <\" << pos[0] << \", \" << pos[1] << \", \" << pos[2] << \">\" << std::endl;\n\n    {\n      renderer->ComputeAspect ();\n      double *aspect = renderer->GetAspect ();\n\n      projection_matrix_ = pcl::visualization::vtkToEigen (active_camera->GetProjectionTransformMatrix (aspect[0] \/ aspect[1], 0.0, 1.0));\n      model_view_matrix_ = pcl::visualization::vtkToEigen (active_camera->GetModelViewTransformMatrix ());\n\n      \/\/computeFrustum (renderer->GetTiledAspectRatio());\n      computeFrustum ();\n    }\n  }\n\n  Object::render(renderer);\n}\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 \"Config.h\"\n#include \"Log.h\"\n#include \"StringConvert.h\"\n#include \"StringFormat.h\"\n#include \"Util.h\"\n#include <mutex>\n#include <fstream>\n#include <unordered_map>\n\nnamespace\n{\n    std::string _filename;\n    std::vector<std::string> _additonalFiles;\n    std::vector<std::string> _args;\n    std::unordered_map<std::string \/*name*\/, std::string \/*value*\/> _configOptions;\n    std::mutex _configLock;\n\n    void AddKey(std::string const& optionName, std::string const& optionKey, bool replace = true)\n    {\n        auto const& itr = _configOptions.find(optionName);\n        if (itr != _configOptions.end())\n        {\n            if (!replace)\n            {\n                LOG_ERROR(\"server\", \"> Config: Option '%s' is exist! Option key - '%s'\", optionName.c_str(), itr->second.c_str());\n                return;\n            }\n\n            _configOptions.erase(optionName);\n        }\n\n        _configOptions.emplace(optionName, optionKey);\n    }\n\n    void ParseFile(std::string const& file)\n    {\n        std::ifstream in(file);\n\n        if (in.fail())\n            throw ConfigException(acore::StringFormat(\"Config::LoadFile: Failed open file '%s'\", file.c_str()));\n\n        uint32 count = 0;\n\n        while (in.good())\n        {\n            std::string line;\n            std::getline(in, line);\n\n            if (line.empty())\n                continue;\n\n            line = acore::String::Trim(line, in.getloc());\n\n            \/\/ comments\n            if (line[0] == '#' || line[0] == '[')\n                continue;\n\n            size_t found = line.find_first_of('#');\n            if (found != std::string::npos)\n                line = line.substr(0, found);\n\n            auto const equal_pos = line.find('=');\n\n            if (equal_pos == std::string::npos || equal_pos == line.length())\n                return;\n\n            auto entry = acore::String::Trim(line.substr(0, equal_pos), in.getloc());\n            auto value = acore::String::Trim(line.substr(equal_pos + 1), in.getloc());\n\n            value.erase(std::remove(value.begin(), value.end(), '\"'), value.end());\n\n            AddKey(entry, value);\n\n            count++;\n        }\n\n        if (!count)\n            throw ConfigException(acore::StringFormat(\"Config::LoadFile: Empty file '%s'\", file.c_str()));\n    }\n\n    bool LoadFile(std::string const& file)\n    {\n        try\n        {\n            ParseFile(file);\n            return true;\n        }\n        catch (const std::exception& e)\n        {\n            LOG_ERROR(\"server\", \"> Config: %s\", e.what());\n        }\n\n        return false;\n    }\n}\n\nbool ConfigMgr::LoadInitial(std::string const& file)\n{\n    std::lock_guard<std::mutex> lock(_configLock);\n    _configOptions.clear();\n    return LoadFile(file);\n}\n\nbool ConfigMgr::LoadAdditionalFile(std::string file)\n{\n    std::lock_guard<std::mutex> lock(_configLock);\n    return LoadFile(file);\n}\n\nConfigMgr* ConfigMgr::instance()\n{\n    static ConfigMgr instance;\n    return &instance;\n}\n\nbool ConfigMgr::Reload()\n{\n    if (!LoadAppConfigs())\n        return false;\n\n    return LoadModulesConfigs();\n}\n\ntemplate<class T>\nT ConfigMgr::GetValueDefault(std::string const& name, T const& def, bool showLogs \/*= true*\/) const\n{\n    auto const& itr = _configOptions.find(name);\n    if (itr == _configOptions.end())\n    {\n        if (showLogs)\n        {\n            LOG_ERROR(\"server\", \"> Config: Missing name %s in config, add \\\"%s = %s\\\"\",\n                name.c_str(), name.c_str(), acore::ToString(def).c_str());\n        }\n\n        return def;\n    }\n\n    auto value = acore::StringTo<T>(itr->second);\n    if (!value)\n    {\n        if (showLogs)\n        {\n            LOG_ERROR(\"server\", \"> Config: Bad value defined for name '%s', going to use '%s' instead\",\n                name.c_str(), acore::ToString(def).c_str());\n        }\n\n        return def;\n    }\n\n    return *value;\n}\n\ntemplate<>\nstd::string ConfigMgr::GetValueDefault<std::string>(std::string const& name, std::string const& def, bool showLogs \/*= true*\/) const\n{\n    auto const& itr = _configOptions.find(name);\n    if (itr == _configOptions.end())\n    {\n        if (showLogs)\n        {\n            LOG_ERROR(\"server\", \"> Config: Missing name %s in config, add \\\"%s = %s\\\"\",\n                name.c_str(), name.c_str(), def.c_str());\n        }\n\n        return def;\n    }\n\n    return itr->second;\n}\n\ntemplate<class T>\nT ConfigMgr::GetOption(std::string const& name, T const& def, bool showLogs \/*= true*\/) const\n{\n    return GetValueDefault<T>(name, def, showLogs);\n}\n\ntemplate<>\nbool ConfigMgr::GetOption<bool>(std::string const& name, bool const& def, bool showLogs \/*= true*\/) const\n{\n    std::string val = GetValueDefault(name, std::string(def ? \"1\" : \"0\"), showLogs);\n\n    auto boolVal = acore::StringTo<bool>(val);\n    if (!boolVal)\n    {\n        if (showLogs)\n        {\n            LOG_ERROR(\"server\", \"> Config: Bad value defined for name '%s', going to use '%s' instead\",\n                name.c_str(), def ? \"true\" : \"false\");\n        }\n\n        return def;\n    }\n\n    return *boolVal;\n}\n\nstd::vector<std::string> ConfigMgr::GetKeysByString(std::string const& name)\n{\n    std::lock_guard<std::mutex> lock(_configLock);\n\n    std::vector<std::string> keys;\n\n    for (auto const& [optionName, key] : _configOptions)\n        if (!optionName.compare(0, name.length(), name))\n            keys.emplace_back(optionName);\n\n    return keys;\n}\n\nstd::string const& ConfigMgr::GetFilename()\n{\n    std::lock_guard<std::mutex> lock(_configLock);\n    return _filename;\n}\n\nstd::vector<std::string> const& ConfigMgr::GetArguments() const\n{\n    return _args;\n}\n\nstd::string const ConfigMgr::GetConfigPath()\n{\n    std::lock_guard<std::mutex> lock(_configLock);\n\n#if AC_PLATFORM == AC_PLATFORM_WINDOWS\n    return \"configs\/\";\n#else\n    return std::string(_CONF_DIR) + \"\/\";\n#endif\n}\n\nvoid ConfigMgr::Configure(std::string const& initFileName, std::vector<std::string> args, std::string const& modulesConfigList \/*= \"\"*\/)\n{\n    _filename = initFileName;\n    _args = std::move(args);\n\n    \/\/ Add modules config if exist\n    if (!modulesConfigList.empty())\n    {\n        Tokenizer configFileList(modulesConfigList, ',');\n        for (auto const& itr : configFileList)\n            _additonalFiles.emplace_back(std::string(itr));\n    }\n}\n\nbool ConfigMgr::LoadAppConfigs()\n{\n    \/\/ #1 - Load init config file .conf.dist\n    if (!LoadInitial(_filename + \".dist\"))\n        return false;\n\n    \/\/ #2 - Load .conf file\n    if (!LoadAdditionalFile(_filename))\n        return false;\n\n    return true;\n}\n\nbool ConfigMgr::LoadModulesConfigs()\n{\n    if (_additonalFiles.empty())\n        return true;\n\n    \/\/ Start loading module configs\n    std::vector<std::string \/*config variant*\/> moduleConfigFiles;\n    std::string const& moduleConfigPath = GetConfigPath() + \"modules\/\";\n    bool isExistDefaultConfig = true;\n    bool isExistDistConfig = true;\n\n    for (auto const& distFileName : _additonalFiles)\n    {\n        std::string defaultFileName = distFileName;\n\n        if (!defaultFileName.empty())\n            defaultFileName.erase(defaultFileName.end() - 5, defaultFileName.end());\n\n        \/\/ Load .conf.dist config\n        if (!LoadAdditionalFile(moduleConfigPath + distFileName))\n            isExistDistConfig = false;\n\n        \/\/ Load .conf config\n        if (!LoadAdditionalFile(moduleConfigPath + defaultFileName))\n            isExistDefaultConfig = false;\n\n        if (isExistDefaultConfig && isExistDistConfig)\n            moduleConfigFiles.emplace_back(defaultFileName);\n        else if (!isExistDefaultConfig && isExistDistConfig)\n            moduleConfigFiles.emplace_back(distFileName);\n    }\n\n    \/\/ If module configs not exist - no load\n    if (moduleConfigFiles.empty())\n        return false;\n\n    \/\/ Print modules configurations\n    LOG_INFO(\"server\", \" \");\n    LOG_INFO(\"server\", \"Using modules configuration:\");\n\n    for (auto const& itr : moduleConfigFiles)\n        LOG_INFO(\"server\", \"> %s\", itr.c_str());\n\n    LOG_INFO(\"server\", \" \");\n\n    return true;\n}\n\n\/*\n * Deprecated geters. This geters will be deleted\n *\/\n\n\/\/ @deprecated DO NOT USE - use GetOption<std::string> instead.\nstd::string ConfigMgr::GetStringDefault(std::string const& name, const std::string& def, bool showLogs \/*= true*\/)\n{\n    return GetOption<std::string>(name, def, showLogs);\n}\n\n\/\/ @deprecated DO NOT USE - use GetOption<bool> instead.\nbool ConfigMgr::GetBoolDefault(std::string const& name, bool def, bool showLogs \/*= true*\/)\n{\n    return GetOption<bool>(name, def, showLogs);\n}\n\n\/\/ @deprecated DO NOT USE - use GetOption<int32> instead.\nint ConfigMgr::GetIntDefault(std::string const& name, int def, bool showLogs \/*= true*\/)\n{\n    return GetOption<int32>(name, def, showLogs);\n}\n\n\/\/ @deprecated DO NOT USE - use GetOption<float> instead.\nfloat ConfigMgr::GetFloatDefault(std::string const& name, float def, bool showLogs \/*= true*\/)\n{\n    return GetOption<float>(name, def, showLogs);\n}\n\n\/*\n * End deprecated geters\n *\/\n\n#define TEMPLATE_CONFIG_OPTION(__typename) \\\n    template __typename ConfigMgr::GetOption<__typename>(std::string const& name, __typename const& def, bool showLogs \/*= true*\/) const;\n\nTEMPLATE_CONFIG_OPTION(std::string)\nTEMPLATE_CONFIG_OPTION(uint8)\nTEMPLATE_CONFIG_OPTION(int8)\nTEMPLATE_CONFIG_OPTION(uint16)\nTEMPLATE_CONFIG_OPTION(int16)\nTEMPLATE_CONFIG_OPTION(uint32)\nTEMPLATE_CONFIG_OPTION(int32)\nTEMPLATE_CONFIG_OPTION(uint64)\nTEMPLATE_CONFIG_OPTION(int64)\nTEMPLATE_CONFIG_OPTION(float)\n\n#undef TEMPLATE_CONFIG_OPTION\n<commit_msg>feat(Core\/Config): added info about bad lines in config file (#5813)<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 \"Config.h\"\n#include \"Log.h\"\n#include \"StringConvert.h\"\n#include \"StringFormat.h\"\n#include \"Util.h\"\n#include <mutex>\n#include <fstream>\n#include <unordered_map>\n\nnamespace\n{\n    std::string _filename;\n    std::vector<std::string> _additonalFiles;\n    std::vector<std::string> _args;\n    std::unordered_map<std::string \/*name*\/, std::string \/*value*\/> _configOptions;\n    std::mutex _configLock;\n\n    \/\/ Check system configs like *server.conf*\n    bool IsAppConfig(std::string_view fileName)\n    {\n        size_t found = fileName.find_first_of(\"authserver.conf\");\n        if (found != std::string::npos)\n        {\n            return true;\n        }\n\n        found = fileName.find_first_of(\"worldserver.conf\");\n        if (found != std::string::npos)\n        {\n            return true;\n        }\n\n        return false;\n    }\n\n    template<typename Format, typename... Args>\n    inline void PrintError(std::string_view filename, Format&& fmt, Args&& ... args)\n    {\n        std::string message = acore::StringFormat(std::forward<Format>(fmt), std::forward<Args>(args)...);\n\n        if (IsAppConfig(filename))\n        {\n            printf(\"%s\\n\", message.c_str());\n        }\n        else\n        {\n            LOG_ERROR(\"server.loading\", \"%s\", message.c_str());\n        }\n    }\n\n    void AddKey(std::string const& optionName, std::string const& optionKey, bool replace = true)\n    {\n        auto const& itr = _configOptions.find(optionName);\n        if (itr != _configOptions.end())\n        {\n            if (!replace)\n            {\n                LOG_ERROR(\"server\", \"> Config: Option '%s' is exist! Option key - '%s'\", optionName.c_str(), itr->second.c_str());\n                return;\n            }\n\n            _configOptions.erase(optionName);\n        }\n\n        _configOptions.emplace(optionName, optionKey);\n    }\n\n    void ParseFile(std::string const& file)\n    {\n        std::ifstream in(file);\n\n        if (in.fail())\n        {\n            throw ConfigException(acore::StringFormat(\"Config::LoadFile: Failed open file '%s'\", file.c_str()));\n        }\n\n        uint32 count = 0;\n        uint32 lineNumber = 0;\n        std::unordered_map<std::string \/*name*\/, std::string \/*value*\/> fileConfigs;\n\n        auto IsDuplicateOption = [&](std::string const& confOption)\n        {\n            auto const& itr = fileConfigs.find(confOption);\n            if (itr != fileConfigs.end())\n            {\n                PrintError(file, \"> Config::LoadFile: Dublicate key name '%s' in config file '%s'\", std::string(confOption).c_str(), file.c_str());\n                return true;\n            }\n\n            return false;\n        };\n\n        while (in.good())\n        {\n            lineNumber++;\n            std::string line;\n            std::getline(in, line);\n\n            \/\/ read line error\n            if (!in.good() && !in.eof())\n            {\n                throw ConfigException(acore::StringFormat(\"> Config::LoadFile: Failure to read line number %u in file '%s'\", lineNumber, file.c_str()));\n            }\n\n            \/\/ remove whitespace in line\n            line = acore::String::Trim(line, in.getloc());\n\n            if (line.empty())\n            {\n                continue;\n            }\n\n            \/\/ comments\n            if (line[0] == '#' || line[0] == '[')\n            {\n                continue;\n            }\n\n            size_t found = line.find_first_of('#');\n            if (found != std::string::npos)\n            {\n                line = line.substr(0, found);\n            }\n\n            auto const equal_pos = line.find('=');\n\n            if (equal_pos == std::string::npos || equal_pos == line.length())\n            {\n                PrintError(file, \"> Config::LoadFile: Failure to read line number %u in file '%s'. Skip this line\", lineNumber, file.c_str());\n                continue;\n            }\n\n            auto entry = acore::String::Trim(line.substr(0, equal_pos), in.getloc());\n            auto value = acore::String::Trim(line.substr(equal_pos + 1, std::string::npos), in.getloc());\n\n            value.erase(std::remove(value.begin(), value.end(), '\"'), value.end());\n\n            \/\/ Skip if 2+ same options in one config file\n            if (IsDuplicateOption(entry))\n            {\n                continue;\n            }\n\n            \/\/ Add to temp container\n            fileConfigs.emplace(entry, value);\n            count++;\n        }\n\n        \/\/ No lines read\n        if (!count)\n            throw ConfigException(acore::StringFormat(\"Config::LoadFile: Empty file '%s'\", file.c_str()));\n\n        \/\/ Add correct keys if file load without errors\n        for (auto const& [entry, key] : fileConfigs)\n        {\n            AddKey(entry, key);\n        }\n    }\n\n    bool LoadFile(std::string const& file)\n    {\n        try\n        {\n            ParseFile(file);\n            return true;\n        }\n        catch (const std::exception& e)\n        {\n            PrintError(file, \"> %s\", e.what());\n        }\n\n        return false;\n    }\n}\n\nbool ConfigMgr::LoadInitial(std::string const& file)\n{\n    std::lock_guard<std::mutex> lock(_configLock);\n    _configOptions.clear();\n    return LoadFile(file);\n}\n\nbool ConfigMgr::LoadAdditionalFile(std::string file)\n{\n    std::lock_guard<std::mutex> lock(_configLock);\n    return LoadFile(file);\n}\n\nConfigMgr* ConfigMgr::instance()\n{\n    static ConfigMgr instance;\n    return &instance;\n}\n\nbool ConfigMgr::Reload()\n{\n    if (!LoadAppConfigs())\n        return false;\n\n    return LoadModulesConfigs();\n}\n\ntemplate<class T>\nT ConfigMgr::GetValueDefault(std::string const& name, T const& def, bool showLogs \/*= true*\/) const\n{\n    auto const& itr = _configOptions.find(name);\n    if (itr == _configOptions.end())\n    {\n        if (showLogs)\n        {\n            LOG_ERROR(\"server\", \"> Config: Missing name %s in config, add \\\"%s = %s\\\"\",\n                name.c_str(), name.c_str(), acore::ToString(def).c_str());\n        }\n\n        return def;\n    }\n\n    auto value = acore::StringTo<T>(itr->second);\n    if (!value)\n    {\n        if (showLogs)\n        {\n            LOG_ERROR(\"server\", \"> Config: Bad value defined for name '%s', going to use '%s' instead\",\n                name.c_str(), acore::ToString(def).c_str());\n        }\n\n        return def;\n    }\n\n    return *value;\n}\n\ntemplate<>\nstd::string ConfigMgr::GetValueDefault<std::string>(std::string const& name, std::string const& def, bool showLogs \/*= true*\/) const\n{\n    auto const& itr = _configOptions.find(name);\n    if (itr == _configOptions.end())\n    {\n        if (showLogs)\n        {\n            LOG_ERROR(\"server\", \"> Config: Missing name %s in config, add \\\"%s = %s\\\"\",\n                name.c_str(), name.c_str(), def.c_str());\n        }\n\n        return def;\n    }\n\n    return itr->second;\n}\n\ntemplate<class T>\nT ConfigMgr::GetOption(std::string const& name, T const& def, bool showLogs \/*= true*\/) const\n{\n    return GetValueDefault<T>(name, def, showLogs);\n}\n\ntemplate<>\nbool ConfigMgr::GetOption<bool>(std::string const& name, bool const& def, bool showLogs \/*= true*\/) const\n{\n    std::string val = GetValueDefault(name, std::string(def ? \"1\" : \"0\"), showLogs);\n\n    auto boolVal = acore::StringTo<bool>(val);\n    if (!boolVal)\n    {\n        if (showLogs)\n        {\n            LOG_ERROR(\"server\", \"> Config: Bad value defined for name '%s', going to use '%s' instead\",\n                name.c_str(), def ? \"true\" : \"false\");\n        }\n\n        return def;\n    }\n\n    return *boolVal;\n}\n\nstd::vector<std::string> ConfigMgr::GetKeysByString(std::string const& name)\n{\n    std::lock_guard<std::mutex> lock(_configLock);\n\n    std::vector<std::string> keys;\n\n    for (auto const& [optionName, key] : _configOptions)\n        if (!optionName.compare(0, name.length(), name))\n            keys.emplace_back(optionName);\n\n    return keys;\n}\n\nstd::string const& ConfigMgr::GetFilename()\n{\n    std::lock_guard<std::mutex> lock(_configLock);\n    return _filename;\n}\n\nstd::vector<std::string> const& ConfigMgr::GetArguments() const\n{\n    return _args;\n}\n\nstd::string const ConfigMgr::GetConfigPath()\n{\n    std::lock_guard<std::mutex> lock(_configLock);\n\n#if AC_PLATFORM == AC_PLATFORM_WINDOWS\n    return \"configs\/\";\n#else\n    return std::string(_CONF_DIR) + \"\/\";\n#endif\n}\n\nvoid ConfigMgr::Configure(std::string const& initFileName, std::vector<std::string> args, std::string const& modulesConfigList \/*= \"\"*\/)\n{\n    _filename = initFileName;\n    _args = std::move(args);\n\n    \/\/ Add modules config if exist\n    if (!modulesConfigList.empty())\n    {\n        Tokenizer configFileList(modulesConfigList, ',');\n        for (auto const& itr : configFileList)\n            _additonalFiles.emplace_back(std::string(itr));\n    }\n}\n\nbool ConfigMgr::LoadAppConfigs()\n{\n    \/\/ #1 - Load init config file .conf.dist\n    if (!LoadInitial(_filename + \".dist\"))\n        return false;\n\n    \/\/ #2 - Load .conf file\n    if (!LoadAdditionalFile(_filename))\n        return false;\n\n    return true;\n}\n\nbool ConfigMgr::LoadModulesConfigs()\n{\n    if (_additonalFiles.empty())\n        return true;\n\n    \/\/ Start loading module configs\n    std::vector<std::string \/*config variant*\/> moduleConfigFiles;\n    std::string const& moduleConfigPath = GetConfigPath() + \"modules\/\";\n    bool isExistDefaultConfig = true;\n    bool isExistDistConfig = true;\n\n    for (auto const& distFileName : _additonalFiles)\n    {\n        std::string defaultFileName = distFileName;\n\n        if (!defaultFileName.empty())\n            defaultFileName.erase(defaultFileName.end() - 5, defaultFileName.end());\n\n        \/\/ Load .conf.dist config\n        if (!LoadAdditionalFile(moduleConfigPath + distFileName))\n            isExistDistConfig = false;\n\n        \/\/ Load .conf config\n        if (!LoadAdditionalFile(moduleConfigPath + defaultFileName))\n            isExistDefaultConfig = false;\n\n        if (isExistDefaultConfig && isExistDistConfig)\n            moduleConfigFiles.emplace_back(defaultFileName);\n        else if (!isExistDefaultConfig && isExistDistConfig)\n            moduleConfigFiles.emplace_back(distFileName);\n    }\n\n    \/\/ If module configs not exist - no load\n    if (moduleConfigFiles.empty())\n        return false;\n\n    \/\/ Print modules configurations\n    LOG_INFO(\"server\", \" \");\n    LOG_INFO(\"server\", \"Using modules configuration:\");\n\n    for (auto const& itr : moduleConfigFiles)\n        LOG_INFO(\"server\", \"> %s\", itr.c_str());\n\n    LOG_INFO(\"server\", \" \");\n\n    return true;\n}\n\n\/*\n * Deprecated geters. This geters will be deleted\n *\/\n\n\/\/ @deprecated DO NOT USE - use GetOption<std::string> instead.\nstd::string ConfigMgr::GetStringDefault(std::string const& name, const std::string& def, bool showLogs \/*= true*\/)\n{\n    return GetOption<std::string>(name, def, showLogs);\n}\n\n\/\/ @deprecated DO NOT USE - use GetOption<bool> instead.\nbool ConfigMgr::GetBoolDefault(std::string const& name, bool def, bool showLogs \/*= true*\/)\n{\n    return GetOption<bool>(name, def, showLogs);\n}\n\n\/\/ @deprecated DO NOT USE - use GetOption<int32> instead.\nint ConfigMgr::GetIntDefault(std::string const& name, int def, bool showLogs \/*= true*\/)\n{\n    return GetOption<int32>(name, def, showLogs);\n}\n\n\/\/ @deprecated DO NOT USE - use GetOption<float> instead.\nfloat ConfigMgr::GetFloatDefault(std::string const& name, float def, bool showLogs \/*= true*\/)\n{\n    return GetOption<float>(name, def, showLogs);\n}\n\n\/*\n * End deprecated geters\n *\/\n\n#define TEMPLATE_CONFIG_OPTION(__typename) \\\n    template __typename ConfigMgr::GetOption<__typename>(std::string const& name, __typename const& def, bool showLogs \/*= true*\/) const;\n\nTEMPLATE_CONFIG_OPTION(std::string)\nTEMPLATE_CONFIG_OPTION(uint8)\nTEMPLATE_CONFIG_OPTION(int8)\nTEMPLATE_CONFIG_OPTION(uint16)\nTEMPLATE_CONFIG_OPTION(int16)\nTEMPLATE_CONFIG_OPTION(uint32)\nTEMPLATE_CONFIG_OPTION(int32)\nTEMPLATE_CONFIG_OPTION(uint64)\nTEMPLATE_CONFIG_OPTION(int64)\nTEMPLATE_CONFIG_OPTION(float)\n\n#undef TEMPLATE_CONFIG_OPTION\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>comment out instructions in graph matching integration test for now<commit_after><|endoftext|>"}
{"text":"<commit_before>#ifndef EMD_HAT_HPP\n#define EMD_HAT_HPP\n\n#include <utility>\n#include <vector>\n#include \"EMD_DEFS.hpp\"\n#include \"flow_utils.hpp\"\n\n\/\/\/ Fastest version of EMD. Also, in my experience metric ground distance yields better\n\/\/\/ performance.\n\/\/\/\n\/\/\/ Required params:\n\/\/\/ P,Q - Two histograms of size N\n\/\/\/ C - The NxN matrix of the ground distance between bins of P and Q. Must be a metric. I\n\/\/\/     recommend it to be a thresholded metric (which is also a metric, see ICCV paper).\n\/\/\/\n\/\/\/ Optional params:\n\/\/\/ extra_mass_penalty - The penalty for extra mass - If you want the\n\/\/\/                     resulting distance to be a metric, it should be\n\/\/\/                     at least half the diameter of the space (maximum\n\/\/\/                     possible distance between any two points). If you\n\/\/\/                     want partial matching you can set it to zero (but\n\/\/\/                     then the resulting distance is not guaranteed to be a metric).\n\/\/\/                     Default value is -1 which means 1*max_element_in_C\n\/\/\/ F - *F is filled with flows or nothing happens to F. See template param FLOW_TYPE.\n\/\/\/     Note that EMD and EMD-HAT does not necessarily have a unique flow solution.\n\/\/\/     We assume *F is already allocated and has enough space and is initialized to zeros.\n\/\/\/     See also flow_utils.hpp file for flow-related utils.\n\/\/\/     Default value: NULL and then FLOW_TYPE must be NO_FLOW.\n\/\/\/\n\/\/\/ Required template params:\n\/\/\/ NUM_T - the type of the histogram bins count (should be one of: int, long int, long long int, double)\n\/\/\/\n\/\/\/ Optional template params:\n\/\/\/ FLOW_TYPE == NO_FLOW - does nothing with the given F.\n\/\/\/           == WITHOUT_TRANSHIPMENT_FLOW - fills F with the flows between bins connected\n\/\/\/              with edges smaller than max(C).\n\/\/\/           == WITHOUT_EXTRA_MASS_FLOW - fills F with the flows between all bins, except the flow\n\/\/\/              to the extra mass bin.\n\/\/\/           Note that if F is the default NULL then FLOW_TYPE must be NO_FLOW.\n\ntemplate<typename NUM_T, FLOW_TYPE_T FLOW_TYPE= NO_FLOW>\nstruct emd_hat_gd_metric {\n    NUM_T operator()(const std::vector<NUM_T>& P, const std::vector<NUM_T>& Q,\n                     const std::vector< std::vector<NUM_T> >& C,\n                     NUM_T extra_mass_penalty= -1,\n                     std::vector< std::vector<NUM_T> >* F= NULL);\n};\n\n\/\/\/ Same as emd_hat_gd_metric, but does not assume metric property for the ground distance (C).\n\/\/\/ Note that C should still be symmetric and non-negative!\ntemplate<typename NUM_T, FLOW_TYPE_T FLOW_TYPE= NO_FLOW>\nstruct emd_hat {\n    NUM_T operator()(const std::vector<NUM_T>& P, const std::vector<NUM_T>& Q,\n                     const std::vector< std::vector<NUM_T> >& C,\n                     NUM_T extra_mass_penalty= -1,\n                     std::vector< std::vector<NUM_T> >* F= NULL);\n\n};\n\n\n\/\/\/ =========================================================================\n\/\/\/ 02\/27\/2014 - Added by Will Mayner <wmayner@gmail.com>\n\/\/\/ -------------------------------------------------------------------------\n\/\/\/ Instantiate the templates with various types to easily import into Cython\nemd_hat_gd_metric<int> emd_hat_gd_metric_int;\nemd_hat_gd_metric<double> emd_hat_gd_metric_double;\nemd_hat_gd_metric<long int> emd_hat_gd_metric_long_int;\nemd_hat_gd_metric<long long int> emd_hat_gd_metric_long_long_int;\nemd_hat<int> emd_hat_int;\nemd_hat<double> emd_hat_double;\nemd_hat<long int> emd_hat_long_int;\nemd_hat<long long int> emd_hat_long_long_int;\n\n\/\/\/ =========================================================================\n\/\/\/ 01\/06\/2017 - Added by Will Mayner <wmayner@gmail.com>\n\/\/\/ -------------------------------------------------------------------------\nemd_hat_gd_metric<double, WITHOUT_EXTRA_MASS_FLOW>\n    emd_hat_gd_metric_double_with_flow;\n\/\/\/ =========================================================================\n\n\/\/\/ =========================================================================\n\/\/\/ 25\/11\/2016 - Added by Rémi Louf <remi@sciti.es>\n\/\/\/ -------------------------------------------------------------------------\n\/\/\/ Wrapper function to output the flow\nstd::pair< double, std::vector<std::vector<double> > >\n    emd_hat_gd_metric_double_with_flow_wrapper(\n        const std::vector<double>& P,\n        const std::vector<double>& Q,\n        const std::vector<std::vector<double> >& C,\n        double extra_mass_penalty) {\n    std::vector<std::vector<double> > flow(P.size(), std::vector<double>(P.size()));\n    double emd = emd_hat_gd_metric_double_with_flow(P, Q, C, extra_mass_penalty, &flow);\n    std::pair< double, std::vector<std::vector<double> > > results =\n        std::make_pair(emd, flow);\n    return results;\n}\n\/\/\/ =========================================================================\n\n\n#include \"emd_hat_impl.hpp\"\n\n#endif\n\n\/\/ Copyright (c) 2009-2012, Ofir Pele\n\/\/ All 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 The Hebrew University of Jerusalem 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\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 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\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<commit_msg>Remove unused template instantiations<commit_after>#ifndef EMD_HAT_HPP\n#define EMD_HAT_HPP\n\n#include <utility>\n#include <vector>\n#include \"EMD_DEFS.hpp\"\n#include \"flow_utils.hpp\"\n\n\/\/\/ Fastest version of EMD. Also, in my experience metric ground distance yields better\n\/\/\/ performance.\n\/\/\/\n\/\/\/ Required params:\n\/\/\/ P,Q - Two histograms of size N\n\/\/\/ C - The NxN matrix of the ground distance between bins of P and Q. Must be a metric. I\n\/\/\/     recommend it to be a thresholded metric (which is also a metric, see ICCV paper).\n\/\/\/\n\/\/\/ Optional params:\n\/\/\/ extra_mass_penalty - The penalty for extra mass - If you want the\n\/\/\/                     resulting distance to be a metric, it should be\n\/\/\/                     at least half the diameter of the space (maximum\n\/\/\/                     possible distance between any two points). If you\n\/\/\/                     want partial matching you can set it to zero (but\n\/\/\/                     then the resulting distance is not guaranteed to be a metric).\n\/\/\/                     Default value is -1 which means 1*max_element_in_C\n\/\/\/ F - *F is filled with flows or nothing happens to F. See template param FLOW_TYPE.\n\/\/\/     Note that EMD and EMD-HAT does not necessarily have a unique flow solution.\n\/\/\/     We assume *F is already allocated and has enough space and is initialized to zeros.\n\/\/\/     See also flow_utils.hpp file for flow-related utils.\n\/\/\/     Default value: NULL and then FLOW_TYPE must be NO_FLOW.\n\/\/\/\n\/\/\/ Required template params:\n\/\/\/ NUM_T - the type of the histogram bins count (should be one of: int, long int, long long int, double)\n\/\/\/\n\/\/\/ Optional template params:\n\/\/\/ FLOW_TYPE == NO_FLOW - does nothing with the given F.\n\/\/\/           == WITHOUT_TRANSHIPMENT_FLOW - fills F with the flows between bins connected\n\/\/\/              with edges smaller than max(C).\n\/\/\/           == WITHOUT_EXTRA_MASS_FLOW - fills F with the flows between all bins, except the flow\n\/\/\/              to the extra mass bin.\n\/\/\/           Note that if F is the default NULL then FLOW_TYPE must be NO_FLOW.\n\ntemplate<typename NUM_T, FLOW_TYPE_T FLOW_TYPE= NO_FLOW>\nstruct emd_hat_gd_metric {\n    NUM_T operator()(const std::vector<NUM_T>& P, const std::vector<NUM_T>& Q,\n                     const std::vector< std::vector<NUM_T> >& C,\n                     NUM_T extra_mass_penalty= -1,\n                     std::vector< std::vector<NUM_T> >* F= NULL);\n};\n\n\/\/\/ Same as emd_hat_gd_metric, but does not assume metric property for the ground distance (C).\n\/\/\/ Note that C should still be symmetric and non-negative!\ntemplate<typename NUM_T, FLOW_TYPE_T FLOW_TYPE= NO_FLOW>\nstruct emd_hat {\n    NUM_T operator()(const std::vector<NUM_T>& P, const std::vector<NUM_T>& Q,\n                     const std::vector< std::vector<NUM_T> >& C,\n                     NUM_T extra_mass_penalty= -1,\n                     std::vector< std::vector<NUM_T> >* F= NULL);\n\n};\n\n\n\/\/\/ =========================================================================\n\/\/\/ 02\/27\/2014 - Added by Will Mayner <wmayner@gmail.com>\n\/\/\/ -------------------------------------------------------------------------\n\/\/\/ Instantiate the template for importing into Cython\nemd_hat_gd_metric<double> emd_hat_gd_metric_double;\n\n\/\/\/ =========================================================================\n\/\/\/ 01\/06\/2017 - Added by Will Mayner <wmayner@gmail.com>\n\/\/\/ -------------------------------------------------------------------------\nemd_hat_gd_metric<double, WITHOUT_EXTRA_MASS_FLOW>\n    emd_hat_gd_metric_double_with_flow;\n\/\/\/ =========================================================================\n\n\/\/\/ =========================================================================\n\/\/\/ 25\/11\/2016 - Added by Rémi Louf <remi@sciti.es>\n\/\/\/ -------------------------------------------------------------------------\n\/\/\/ Wrapper function to output the flow\nstd::pair< double, std::vector<std::vector<double> > >\n    emd_hat_gd_metric_double_with_flow_wrapper(\n        const std::vector<double>& P,\n        const std::vector<double>& Q,\n        const std::vector<std::vector<double> >& C,\n        double extra_mass_penalty) {\n    std::vector<std::vector<double> > flow(P.size(), std::vector<double>(P.size()));\n    double emd = emd_hat_gd_metric_double_with_flow(P, Q, C, extra_mass_penalty, &flow);\n    std::pair< double, std::vector<std::vector<double> > > results =\n        std::make_pair(emd, flow);\n    return results;\n}\n\/\/\/ =========================================================================\n\n\n#include \"emd_hat_impl.hpp\"\n\n#endif\n\n\/\/ Copyright (c) 2009-2012, Ofir Pele\n\/\/ All 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 The Hebrew University of Jerusalem 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\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 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\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<|endoftext|>"}
{"text":"<commit_before>#ifndef __CLUSTERING_IMMEDIATE_CONSISTENCY_BRANCH_BACKFILLEE_HPP__\n#define __CLUSTERING_IMMEDIATE_CONSISTENCY_BRANCH_BACKFILLEE_HPP__\n\n#include \"clustering\/immediate_consistency\/branch\/metadata.hpp\"\n#include \"concurrency\/promise.hpp\"\n#include \"rpc\/semilattice\/view.hpp\"\n\n\/* TODO: What if the backfill chunks on the network get reordered in transit?\nEven if the `protocol_t` can tolerate backfill chunks being reordered, it's\nclearly not OK for the end-of-backfill message to be processed before the last\nof the backfill chunks are. Consider using a FIFO enforcer or something. *\/\n\ntemplate<class protocol_t>\nvoid on_receive_backfill_chunk(\n        store_view_t<protocol_t> *store,\n        signal_t *dont_go_until,\n        typename protocol_t::backfill_chunk_t chunk,\n        signal_t *interruptor,\n        UNUSED auto_drainer_t::lock_t keepalive)\n        THROWS_NOTHING\n{\n    {\n        wait_any_t waiter(dont_go_until, interruptor);\n        waiter.wait_lazily_unordered();\n        if (interruptor->is_pulsed()) { \n            return;\n        }\n    }\n\n    try {\n        boost::scoped_ptr<fifo_enforcer_sink_t::exit_write_t> write_token;\n        store->new_write_token(write_token);\n        store->receive_backfill(chunk, write_token, interruptor);\n    } catch (interrupted_exc_t) {\n        return;\n    }\n};\n\ntemplate<class protocol_t>\nvoid backfillee(\n        mailbox_manager_t *mailbox_manager,\n        boost::shared_ptr<semilattice_read_view_t<branch_history_t<protocol_t> > > branch_history,\n        store_view_t<protocol_t> *store,\n        clone_ptr_t<directory_single_rview_t<boost::optional<backfiller_business_card_t<protocol_t> > > > backfiller_metadata,\n        signal_t *interruptor)\n        THROWS_ONLY(interrupted_exc_t, resource_lost_exc_t)\n{\n    resource_access_t<backfiller_business_card_t<protocol_t> > backfiller(backfiller_metadata);\n\n    \/* Read the metadata to determine where we're starting from *\/\n    boost::scoped_ptr<fifo_enforcer_sink_t::exit_read_t> read_token;\n    store->new_read_token(read_token);\n    region_map_t<protocol_t, version_range_t> start_point =\n        region_map_transform<protocol_t, binary_blob_t, version_range_t>(\n            store->get_metainfo(read_token, interruptor),\n            &binary_blob_t::get<version_range_t>\n            );\n\n    \/* Pick a unique ID to identify this backfill session to the backfiller *\/\n    backfill_session_id_t backfill_session_id = generate_uuid();\n\n    \/* The backfiller will send a message to `end_point_mailbox` before it sends\n    any other messages; that message will tell us what the version will be when\n    the backfill is over. *\/\n    promise_t<region_map_t<protocol_t, version_range_t> > end_point_cond;\n    async_mailbox_t<void(region_map_t<protocol_t, version_range_t>)> end_point_mailbox(\n        mailbox_manager, boost::bind(&promise_t<region_map_t<protocol_t, version_range_t> >::pulse, &end_point_cond, _1));\n\n    \/* `dont_go_until` prevents any backfill chunks from being applied before we\n    update the store metadata to indicate that the backfill is in progress. *\/\n    cond_t dont_go_until;\n\n    \/* The backfiller will notify `done_mailbox` when the backfill is all over\n    and the version described in `end_point_mailbox` has been achieved. *\/\n    cond_t done_cond;\n    async_mailbox_t<void()> done_mailbox(\n        mailbox_manager, boost::bind(&cond_t::pulse, &done_cond));\n\n    {\n        \/* Use an `auto_drainer_t` to wait for all the bits of the backfill to\n        finish being applied. Construct it before `chunk_mailbox` so that we\n        don't get any chunks after `drainer` is destroyed. *\/\n        auto_drainer_t drainer;\n\n        \/* The backfiller will send individual chunks of the backfill to\n        `chunk_mailbox`. *\/\n        async_mailbox_t<void(typename protocol_t::backfill_chunk_t)> chunk_mailbox(\n            mailbox_manager, boost::bind(&on_receive_backfill_chunk<protocol_t>,\n                store, &dont_go_until, _1, interruptor, auto_drainer_t::lock_t(&drainer)\n                ));\n\n        \/* Send off the backfill request *\/\n        send(mailbox_manager,\n            backfiller.access().backfill_mailbox,\n            backfill_session_id,\n            start_point,\n            end_point_mailbox.get_address(),\n            chunk_mailbox.get_address(),\n            done_mailbox.get_address()\n            );\n\n        \/* If something goes wrong, we'd like to inform the backfiller that it\n        it has gone wrong, so it doesn't just keep blindly sending us chunks.\n        `backfiller_notifier` notifies the backfiller in its destructor. If\n        everything goes right, we'll explicitly disarm it. *\/\n        death_runner_t backfiller_notifier;\n        {\n            \/* We have to cast `send()` to the correct type before we pass\n            it to `boost::bind()`, or else C++ can't figure out which\n            overload to use. *\/\n            void (*send_cast_to_correct_type)(\n                mailbox_manager_t *,\n                typename backfiller_business_card_t<protocol_t>::cancel_backfill_mailbox_t::address_t,\n                const backfill_session_id_t &) = &send;\n            backfiller_notifier.fun = boost::bind(\n                send_cast_to_correct_type, mailbox_manager,\n                backfiller.access().cancel_backfill_mailbox,\n                backfill_session_id);\n        }\n\n        \/* Wait until we get a message in `end_point_mailbox`. *\/\n        {\n            wait_any_t waiter(end_point_cond.get_ready_signal(), backfiller.get_failed_signal());\n            wait_interruptible(&waiter, interruptor);\n\n            \/* Throw an exception if backfiller died *\/\n            backfiller.access();\n            rassert(end_point_cond.get_ready_signal()->is_pulsed());\n        }\n\n        \/* Indicate in the metadata that a backfill is happening. We do this by\n        marking every region as indeterminate between the current state and the\n        backfill end state, since we don't know whether the backfill has reached\n        that region yet. *\/\n\n        typedef region_map_t<protocol_t, version_range_t> version_map_t;\n\n        version_map_t end_point = end_point_cond.get_value();\n\n        std::vector<std::pair<typename protocol_t::region_t, version_range_t> > span_parts;\n\n        for (typename version_map_t::const_iterator it  = start_point.begin();\n                                                    it != start_point.end();\n                                                    it++) {\n            for (typename version_map_t::const_iterator jt  = end_point.begin();\n                                                        jt != end_point.end();\n                                                        jt++) {\n                typename protocol_t::region_t ixn = region_intersection(it->first, jt->first);\n                if (!region_is_empty(ixn)) {\n                    rassert(version_is_ancestor(branch_history->get(),\n                        it->second.earliest,\n                        jt->second.latest,\n                        ixn),\n                        \"We're on a different timeline than the backfiller, \"\n                        \"but it somehow failed to notice.\");\n                    span_parts.push_back(std::make_pair(\n                        ixn,\n                        version_range_t(it->second.earliest, jt->second.latest)\n                        ));\n                }\n            }\n        }\n        boost::scoped_ptr<fifo_enforcer_sink_t::exit_write_t> write_token;\n        store->new_write_token(write_token);\n        store->set_metainfo(\n            region_map_transform<protocol_t, version_range_t, binary_blob_t>(\n                region_map_t<protocol_t, version_range_t>(span_parts.end(), span_parts.begin()),\n                &binary_blob_t::make<version_range_t>\n                ),\n            write_token,\n            interruptor\n            );\n\n        \/* Now that the metadata indicates that the backfill is happening, it's\n        OK for backfill chunks to be applied *\/\n        dont_go_until.pulse();\n\n        \/* Now wait for the backfill to be over *\/\n        {\n            wait_any_t waiter(&done_cond, backfiller.get_failed_signal());\n            wait_interruptible(&waiter, interruptor);\n\n            \/* Throw an exception if backfiller died *\/\n            backfiller.access();\n            rassert(done_cond.is_pulsed());\n        }\n\n        \/* All went well, so don't send a cancel message to the backfiller *\/\n        backfiller_notifier.fun = 0;\n\n        \/* `drainer` destructor is run here; we block until all the chunks are\n        done being applied. *\/\n    }\n\n    \/* Update the metadata to indicate that the backfill occurred *\/\n    boost::scoped_ptr<fifo_enforcer_sink_t::exit_write_t> write_token;\n    store->new_write_token(write_token);\n    store->set_metainfo(\n        region_map_transform<protocol_t, version_range_t, binary_blob_t>(\n            end_point_cond.get_value(),\n            &binary_blob_t::make<version_range_t>\n            ),\n        write_token,\n        interruptor\n        );\n}\n\n#endif \/* __CLUSTERING_IMMEDIATE_CONSISTENCY_BRANCH_BACKFILLEE_HPP__ *\/\n<commit_msg>Fix bad_alloc bug<commit_after>#ifndef __CLUSTERING_IMMEDIATE_CONSISTENCY_BRANCH_BACKFILLEE_HPP__\n#define __CLUSTERING_IMMEDIATE_CONSISTENCY_BRANCH_BACKFILLEE_HPP__\n\n#include \"clustering\/immediate_consistency\/branch\/metadata.hpp\"\n#include \"concurrency\/promise.hpp\"\n#include \"rpc\/semilattice\/view.hpp\"\n\n\/* TODO: What if the backfill chunks on the network get reordered in transit?\nEven if the `protocol_t` can tolerate backfill chunks being reordered, it's\nclearly not OK for the end-of-backfill message to be processed before the last\nof the backfill chunks are. Consider using a FIFO enforcer or something. *\/\n\ntemplate<class protocol_t>\nvoid on_receive_backfill_chunk(\n        store_view_t<protocol_t> *store,\n        signal_t *dont_go_until,\n        typename protocol_t::backfill_chunk_t chunk,\n        signal_t *interruptor,\n        UNUSED auto_drainer_t::lock_t keepalive)\n        THROWS_NOTHING\n{\n    {\n        wait_any_t waiter(dont_go_until, interruptor);\n        waiter.wait_lazily_unordered();\n        if (interruptor->is_pulsed()) { \n            return;\n        }\n    }\n\n    try {\n        boost::scoped_ptr<fifo_enforcer_sink_t::exit_write_t> write_token;\n        store->new_write_token(write_token);\n        store->receive_backfill(chunk, write_token, interruptor);\n    } catch (interrupted_exc_t) {\n        return;\n    }\n};\n\ntemplate<class protocol_t>\nvoid backfillee(\n        mailbox_manager_t *mailbox_manager,\n        boost::shared_ptr<semilattice_read_view_t<branch_history_t<protocol_t> > > branch_history,\n        store_view_t<protocol_t> *store,\n        clone_ptr_t<directory_single_rview_t<boost::optional<backfiller_business_card_t<protocol_t> > > > backfiller_metadata,\n        signal_t *interruptor)\n        THROWS_ONLY(interrupted_exc_t, resource_lost_exc_t)\n{\n    resource_access_t<backfiller_business_card_t<protocol_t> > backfiller(backfiller_metadata);\n\n    \/* Read the metadata to determine where we're starting from *\/\n    boost::scoped_ptr<fifo_enforcer_sink_t::exit_read_t> read_token;\n    store->new_read_token(read_token);\n    region_map_t<protocol_t, version_range_t> start_point =\n        region_map_transform<protocol_t, binary_blob_t, version_range_t>(\n            store->get_metainfo(read_token, interruptor),\n            &binary_blob_t::get<version_range_t>\n            );\n\n    \/* Pick a unique ID to identify this backfill session to the backfiller *\/\n    backfill_session_id_t backfill_session_id = generate_uuid();\n\n    \/* The backfiller will send a message to `end_point_mailbox` before it sends\n    any other messages; that message will tell us what the version will be when\n    the backfill is over. *\/\n    promise_t<region_map_t<protocol_t, version_range_t> > end_point_cond;\n    async_mailbox_t<void(region_map_t<protocol_t, version_range_t>)> end_point_mailbox(\n        mailbox_manager, boost::bind(&promise_t<region_map_t<protocol_t, version_range_t> >::pulse, &end_point_cond, _1));\n\n    \/* `dont_go_until` prevents any backfill chunks from being applied before we\n    update the store metadata to indicate that the backfill is in progress. *\/\n    cond_t dont_go_until;\n\n    \/* The backfiller will notify `done_mailbox` when the backfill is all over\n    and the version described in `end_point_mailbox` has been achieved. *\/\n    cond_t done_cond;\n    async_mailbox_t<void()> done_mailbox(\n        mailbox_manager, boost::bind(&cond_t::pulse, &done_cond));\n\n    {\n        \/* Use an `auto_drainer_t` to wait for all the bits of the backfill to\n        finish being applied. Construct it before `chunk_mailbox` so that we\n        don't get any chunks after `drainer` is destroyed. *\/\n        auto_drainer_t drainer;\n\n        \/* The backfiller will send individual chunks of the backfill to\n        `chunk_mailbox`. *\/\n        async_mailbox_t<void(typename protocol_t::backfill_chunk_t)> chunk_mailbox(\n            mailbox_manager, boost::bind(&on_receive_backfill_chunk<protocol_t>,\n                store, &dont_go_until, _1, interruptor, auto_drainer_t::lock_t(&drainer)\n                ));\n\n        \/* Send off the backfill request *\/\n        send(mailbox_manager,\n            backfiller.access().backfill_mailbox,\n            backfill_session_id,\n            start_point,\n            end_point_mailbox.get_address(),\n            chunk_mailbox.get_address(),\n            done_mailbox.get_address()\n            );\n\n        \/* If something goes wrong, we'd like to inform the backfiller that it\n        it has gone wrong, so it doesn't just keep blindly sending us chunks.\n        `backfiller_notifier` notifies the backfiller in its destructor. If\n        everything goes right, we'll explicitly disarm it. *\/\n        death_runner_t backfiller_notifier;\n        {\n            \/* We have to cast `send()` to the correct type before we pass\n            it to `boost::bind()`, or else C++ can't figure out which\n            overload to use. *\/\n            void (*send_cast_to_correct_type)(\n                mailbox_manager_t *,\n                typename backfiller_business_card_t<protocol_t>::cancel_backfill_mailbox_t::address_t,\n                const backfill_session_id_t &) = &send;\n            backfiller_notifier.fun = boost::bind(\n                send_cast_to_correct_type, mailbox_manager,\n                backfiller.access().cancel_backfill_mailbox,\n                backfill_session_id);\n        }\n\n        \/* Wait until we get a message in `end_point_mailbox`. *\/\n        {\n            wait_any_t waiter(end_point_cond.get_ready_signal(), backfiller.get_failed_signal());\n            wait_interruptible(&waiter, interruptor);\n\n            \/* Throw an exception if backfiller died *\/\n            backfiller.access();\n            rassert(end_point_cond.get_ready_signal()->is_pulsed());\n        }\n\n        \/* Indicate in the metadata that a backfill is happening. We do this by\n        marking every region as indeterminate between the current state and the\n        backfill end state, since we don't know whether the backfill has reached\n        that region yet. *\/\n\n        typedef region_map_t<protocol_t, version_range_t> version_map_t;\n\n        version_map_t end_point = end_point_cond.get_value();\n\n        std::vector<std::pair<typename protocol_t::region_t, version_range_t> > span_parts;\n\n        for (typename version_map_t::const_iterator it  = start_point.begin();\n                                                    it != start_point.end();\n                                                    it++) {\n            for (typename version_map_t::const_iterator jt  = end_point.begin();\n                                                        jt != end_point.end();\n                                                        jt++) {\n                typename protocol_t::region_t ixn = region_intersection(it->first, jt->first);\n                if (!region_is_empty(ixn)) {\n                    rassert(version_is_ancestor(branch_history->get(),\n                        it->second.earliest,\n                        jt->second.latest,\n                        ixn),\n                        \"We're on a different timeline than the backfiller, \"\n                        \"but it somehow failed to notice.\");\n                    span_parts.push_back(std::make_pair(\n                        ixn,\n                        version_range_t(it->second.earliest, jt->second.latest)\n                        ));\n                }\n            }\n        }\n        boost::scoped_ptr<fifo_enforcer_sink_t::exit_write_t> write_token;\n        store->new_write_token(write_token);\n        store->set_metainfo(\n            region_map_transform<protocol_t, version_range_t, binary_blob_t>(\n                region_map_t<protocol_t, version_range_t>(span_parts.begin(), span_parts.end()),\n                &binary_blob_t::make<version_range_t>\n                ),\n            write_token,\n            interruptor\n            );\n\n        \/* Now that the metadata indicates that the backfill is happening, it's\n        OK for backfill chunks to be applied *\/\n        dont_go_until.pulse();\n\n        \/* Now wait for the backfill to be over *\/\n        {\n            wait_any_t waiter(&done_cond, backfiller.get_failed_signal());\n            wait_interruptible(&waiter, interruptor);\n\n            \/* Throw an exception if backfiller died *\/\n            backfiller.access();\n            rassert(done_cond.is_pulsed());\n        }\n\n        \/* All went well, so don't send a cancel message to the backfiller *\/\n        backfiller_notifier.fun = 0;\n\n        \/* `drainer` destructor is run here; we block until all the chunks are\n        done being applied. *\/\n    }\n\n    \/* Update the metadata to indicate that the backfill occurred *\/\n    boost::scoped_ptr<fifo_enforcer_sink_t::exit_write_t> write_token;\n    store->new_write_token(write_token);\n    store->set_metainfo(\n        region_map_transform<protocol_t, version_range_t, binary_blob_t>(\n            end_point_cond.get_value(),\n            &binary_blob_t::make<version_range_t>\n            ),\n        write_token,\n        interruptor\n        );\n}\n\n#endif \/* __CLUSTERING_IMMEDIATE_CONSISTENCY_BRANCH_BACKFILLEE_HPP__ *\/\n<|endoftext|>"}
{"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/memory\/lib\/phy\/adr32s.C $  *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2016,2019                        *\/\n\/* [+] International Business Machines Corp.                              *\/\n\/*                                                                        *\/\n\/*                                                                        *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\");        *\/\n\/* you may not use this file except in compliance with the License.       *\/\n\/* You may obtain a copy of the License at                                *\/\n\/*                                                                        *\/\n\/*     http:\/\/www.apache.org\/licenses\/LICENSE-2.0                         *\/\n\/*                                                                        *\/\n\/* Unless required by applicable law or agreed to in writing, software    *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS,      *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or        *\/\n\/* implied. See the License for the specific language governing           *\/\n\/* permissions and limitations under the License.                         *\/\n\/*                                                                        *\/\n\/* IBM_PROLOG_END_TAG                                                     *\/\n\n\/\/\/\n\/\/\/ @file adr32s.C\n\/\/\/ @brief Subroutines for the PHY ADR32S registers\n\/\/\/\n\/\/ *HWP HWP Owner: Brian Silver <bsilver@us.ibm.com>\n\/\/ *HWP HWP Backup: Andre Marin <aamarin@us.ibm.com>\n\/\/ *HWP Team: Memory\n\/\/ *HWP Level: 2\n\/\/ *HWP Consumed by: FSP:HB\n\n#include <fapi2.H>\n#include <lib\/phy\/adr32s.H>\n#include <lib\/utils\/find.H>\n\nusing fapi2::TARGET_TYPE_MCA;\nusing fapi2::TARGET_TYPE_SYSTEM;\nusing fapi2::FAPI2_RC_SUCCESS;\n\nnamespace mss\n{\n\n\/\/ Definition of the ADR32S DLL Config registers\nconst std::vector<uint64_t> adr32sTraits<fapi2::TARGET_TYPE_MCA>::DLL_CNFG_REG =\n{\n    MCA_DDRPHY_ADR_DLL_CNTL_P0_ADR32S0,\n    MCA_DDRPHY_ADR_DLL_CNTL_P0_ADR32S1\n};\n\n\/\/ Definition of the ADR32S output driver registers\nconst std::vector<uint64_t> adr32sTraits<fapi2::TARGET_TYPE_MCA>::OUTPUT_DRIVER_REG =\n{\n    MCA_DDRPHY_ADR_OUTPUT_FORCE_ATEST_CNTL_P0_ADR32S0,\n    MCA_DDRPHY_ADR_OUTPUT_FORCE_ATEST_CNTL_P0_ADR32S1,\n};\n\n\/\/ Definition of the ADR32S duty cycle distortion registers\nconst std::vector<uint64_t> adr32sTraits<fapi2::TARGET_TYPE_MCA>::DUTY_CYCLE_DISTORTION_REG =\n{\n    MCA_DDRPHY_ADR_DCD_CONTROL_P0_ADR32S0,\n    MCA_DDRPHY_ADR_DCD_CONTROL_P0_ADR32S1,\n    MCA_DDRPHY_DP16_DCD_CONTROL0_P0_0,\n    MCA_DDRPHY_DP16_DCD_CONTROL1_P0_0,\n    MCA_DDRPHY_DP16_DCD_CONTROL0_P0_1,\n    MCA_DDRPHY_DP16_DCD_CONTROL1_P0_1,\n    MCA_DDRPHY_DP16_DCD_CONTROL0_P0_2,\n    MCA_DDRPHY_DP16_DCD_CONTROL1_P0_2,\n    MCA_DDRPHY_DP16_DCD_CONTROL0_P0_3,\n    MCA_DDRPHY_DP16_DCD_CONTROL1_P0_3,\n    MCA_DDRPHY_DP16_DCD_CONTROL0_P0_4,\n    MCA_DDRPHY_DP16_DCD_CONTROL1_P0_4,\n};\n\n\/\/ Definition of the ADR32S write clock static offset registers\nconst std::vector<uint64_t> adr32sTraits<fapi2::TARGET_TYPE_MCA>::PR_STATIC_OFFSET_REG =\n{\n    MCA_DDRPHY_ADR_MCCLK_WRCLK_PR_STATIC_OFFSET_P0_ADR32S0,\n    MCA_DDRPHY_ADR_MCCLK_WRCLK_PR_STATIC_OFFSET_P0_ADR32S1,\n};\n\nnamespace adr32s\n{\n\n\/\/\/\n\/\/\/ @brief Helper to iterate over ADR32S 'sides' when performing DCD cal\n\/\/\/ @param[in] i_target the MCA to iterate for\n\/\/\/ @param[in] i_reg the register (ADR0 or ADR1's register)\n\/\/\/ @param[in] i_seed the seed value for the adjuster\n\/\/\/ @param[in] i_side bool; true if this is side a, false for side b\n\/\/\/ @param[out] o_value the value of the adjuster when the compare bit changes state\n\/\/\/ @return FAPI2_RC_SUCCESS iff ok\n\/\/\/\nfapi2::ReturnCode dcd_cal_helper( const fapi2::Target<TARGET_TYPE_MCA>& i_target,\n                                  const uint64_t i_reg,\n                                  const uint64_t i_seed,\n                                  const bool i_side,\n                                  uint64_t& o_value )\n{\n    typedef adr32sTraits<TARGET_TYPE_MCA> TT;\n\n    constexpr uint64_t l_dcd_adjust_overflow =  0b1111111;\n    constexpr uint64_t l_dcd_adjust_underflow = 0b0000000;\n\n    \/\/ If compare out is 0, we tick up ...\n    \/\/ Signed value which helps us increment or decrement the adjustment\n    int64_t l_tick = 1;\n    \/\/ ... and we expect a transition to 1\n    bool l_expected = 1;\n    \/\/ ... and we don't expect to overflow\n    uint64_t l_overrun = l_dcd_adjust_overflow;\n\n    fapi2::buffer<uint64_t> l_read;\n    uint64_t l_current_adjust = i_seed;\n    size_t l_iter = 0;\n\n    \/\/ More or less mirror's Bialas's logic for DD2 so we can kind of try out the algorithm on DD1.\n\n    FAPI_INF(\"enter dcd_cal_helper %s 0x%016lx seed: 0x%016lx side: %d\",\n             mss::c_str(i_target), i_reg, i_seed, i_side );\n\n    \/\/ Prime the system with the starting values. We don't need to read\/modify\/write here as we're resetting\n    \/\/ the world and saving a scom here is likely benificial. Clear the compare out bit as writing it set\n    \/\/ will cause the PHY to throw a parity error\n    l_read.insertFromRight<TT::DCD_CONTROL_DLL_ADJUST, TT::DCD_CONTROL_DLL_ADJUST_LEN>(l_current_adjust);\n    l_read.writeBit<TT::DCD_CONTROL_DLL_ITER_A>(i_side);\n    l_read.clearBit<TT::DCD_CONTROL_DLL_COMPARE_OUT>();\n    FAPI_TRY( mss::putScom(i_target, i_reg, l_read) );\n\n    \/\/ Algorithm waits 128ck (~100ns) between steps. However, scom takes so long (and rippling up thru\n    \/\/ the platforms takes time too) that there's no need to actually delay - plenty of time has elapsed.\n\n    \/\/ Read. Note the register is volatile in that l_read which we just wrote isn't what we'll read\n    \/\/ as the distortion logic will take the seeded adjustment value and give us information on the next\n    \/\/ read (so don't get cute and remove this getScom.)\n    FAPI_TRY( mss::getScom(i_target, i_reg, l_read) );\n\n    \/\/ Based on the 'direction' we're going, we have some values to setup. We setup the bit == 0 case\n    \/\/ when we initialized these variables above.\n    if (l_read.getBit<TT::DCD_CONTROL_DLL_COMPARE_OUT>() != 0)\n    {\n        \/\/ If compare out is 1, we tick down ...\n        l_tick = -1;\n\n        \/\/ ... and we expect a transition to 0\n        l_expected = 0;\n\n        \/\/ ... and we don't expect to underflow\n        l_overrun = l_dcd_adjust_underflow;\n    }\n\n    do\n    {\n        l_iter += 1;\n        bool l_current_compare = l_read.getBit<TT::DCD_CONTROL_DLL_COMPARE_OUT>();\n\n        FAPI_INF(\"dcd_cal_helper: iter %d tick: %d expected: %d overrun: 0x%x out: %d adj: 0x%x\",\n                 l_iter, l_tick, l_expected, l_overrun, l_current_compare, l_current_adjust);\n\n        if (l_current_compare == l_expected)\n        {\n            break;\n        }\n\n        \/\/ If we're here we're not done, so just adjust and try again. Clear the compare out bit, it must\n        \/\/ always be 0 or the PHY will parity error\n        l_read.insertFromRight<TT::DCD_CONTROL_DLL_ADJUST, TT::DCD_CONTROL_DLL_ADJUST_LEN>(l_current_adjust + l_tick);\n        l_read.clearBit<TT::DCD_CONTROL_DLL_COMPARE_OUT>();\n        FAPI_TRY( mss::putScom(i_target, i_reg, l_read) );\n\n        \/\/ Wait 128ck (~100ns) ...\n\n        FAPI_TRY( mss::getScom(i_target, i_reg, l_read) );\n\n        l_read.extractToRight<TT::DCD_CONTROL_DLL_ADJUST, TT::DCD_CONTROL_DLL_ADJUST_LEN>(l_current_adjust);\n\n    }\n    while (l_current_adjust != l_overrun);\n\n    FAPI_ASSERT( l_current_adjust != l_overrun,\n                 fapi2::MSS_DUTY_CLOCK_DISTORTION_CAL_FAILED()\n                 .set_TARGET(i_target)\n                 .set_CURRENT_ADJUST(l_current_adjust)\n                 .set_SIDE(i_side)\n                 .set_REGISTER(i_reg)\n                 .set_REGISTER_VALUE(l_read),\n                 \"Failed ADR DCD for %s 0x%016lx\", mss::c_str(i_target), i_reg );\n\n    \/\/ If we're here, we were done and there were no errors. So we can return back the current adjust value\n    \/\/ as the output\/result of our operation\n    o_value = l_current_adjust;\n    FAPI_INF(\"side: %d final adjust value: 0x%x (0x%x)\", i_side, o_value, l_current_adjust);\n\n    return FAPI2_RC_SUCCESS;\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\n\n\/\/\/\n\/\/\/ @brief Perform ADR DCD calibration - Nimbus Only\n\/\/\/ @param[in] i_target the MCBIST (controler) to perform calibration on\n\/\/\/ @return FAPI2_RC_SUCCESS iff ok\n\/\/\/\nfapi2::ReturnCode duty_cycle_distortion_calibration( const fapi2::Target<fapi2::TARGET_TYPE_MCBIST>& i_target )\n{\n    typedef adr32sTraits<TARGET_TYPE_MCA> TT;\n\n    const auto l_mca = mss::find_targets<TARGET_TYPE_MCA>(i_target);\n    fapi2::buffer<uint64_t> l_read;\n    uint8_t l_sim = 0;\n\n    FAPI_TRY( mss::is_simulation( l_sim) );\n\n    \/\/ Nothing works here in cycle sim ...\n    if (l_sim)\n    {\n        return FAPI2_RC_SUCCESS;\n    }\n\n    if (l_mca.size() == 0)\n    {\n        FAPI_INF(\"No MCA, skipping duty cycle distortion calibration\");\n        return FAPI2_RC_SUCCESS;\n    }\n\n    \/\/ Do a quick check to make sure this chip doesn't have the DCD logic built in (e.g., DD1 Nimbus)\n    \/\/ TODO RTC:159687 For DD2 all we need to do is kick off the h\/w cal and wait. We can check any ADR_DCD\n    \/\/ register, they all should reflect the inclusion of the DCD logic.\n\n    FAPI_TRY( mss::getScom(l_mca[0], TT::DUTY_CYCLE_DISTORTION_REG[0], l_read) );\n\n    if (l_read.getBit<TT::DCD_CONTROL_DLL_CORRECT_EN>() == 1)\n    {\n        FAPI_ERR(\"seeing ADR DCD algorithm is in the logic but we didn't code it?\");\n        fapi2::Assert(false);\n    }\n\n    \/\/ We must calibrate each of our ports. Each has 2 ADR units and each unit needs it's A-side and B-side calibrated.\n    for (const auto& p : mss::find_targets<TARGET_TYPE_MCA>(i_target))\n    {\n        uint64_t l_seed = TT::DCD_ADJUST_DEFAULT;\n\n        for (const auto& r : TT::DUTY_CYCLE_DISTORTION_REG)\n        {\n            uint64_t l_a_side_value = 0;\n            uint64_t l_b_side_value = 0;\n\n            FAPI_TRY( dcd_cal_helper(p, r, l_seed, true, l_a_side_value) );\n\n            \/\/ We want to seed the other side (and each subsequent port) with the\n            \/\/ value found in the pervious iteration as that will likely reduce the number\n            \/\/ of iterations to find the transition. We back up one so that if we're on\n            \/\/ a transition, we don't 'bounce' from a 1 to a 0. This will give us a good\n            \/\/ transition if the a-side value is really to be the b-side value too.\n            FAPI_TRY( dcd_cal_helper(p, r, l_a_side_value - 1, false, l_b_side_value) );\n\n            \/\/ The final value is the average of the a-side and b-side values.\n            l_seed = (l_a_side_value + l_b_side_value) \/ 2;\n\n            FAPI_INF(\"average for both sides 0x%02x\", l_seed);\n\n            \/\/ Note this writes all the other values to 0's which is OK for DD1\n            FAPI_TRY( mss::putScom(p, r, l_seed) );\n        }\n    }\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\n} \/\/ close namespace adrs32\n\n} \/\/ close namespace mss\n<commit_msg>Updates code to run PHY DCD calibration<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/memory\/lib\/phy\/adr32s.C $  *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2016,2019                        *\/\n\/* [+] International Business Machines Corp.                              *\/\n\/*                                                                        *\/\n\/*                                                                        *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\");        *\/\n\/* you may not use this file except in compliance with the License.       *\/\n\/* You may obtain a copy of the License at                                *\/\n\/*                                                                        *\/\n\/*     http:\/\/www.apache.org\/licenses\/LICENSE-2.0                         *\/\n\/*                                                                        *\/\n\/* Unless required by applicable law or agreed to in writing, software    *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS,      *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or        *\/\n\/* implied. See the License for the specific language governing           *\/\n\/* permissions and limitations under the License.                         *\/\n\/*                                                                        *\/\n\/* IBM_PROLOG_END_TAG                                                     *\/\n\n\/\/\/\n\/\/\/ @file adr32s.C\n\/\/\/ @brief Subroutines for the PHY ADR32S registers\n\/\/\/\n\/\/ *HWP HWP Owner: Brian Silver <bsilver@us.ibm.com>\n\/\/ *HWP HWP Backup: Andre Marin <aamarin@us.ibm.com>\n\/\/ *HWP Team: Memory\n\/\/ *HWP Level: 2\n\/\/ *HWP Consumed by: FSP:HB\n\n#include <fapi2.H>\n#include <lib\/phy\/adr32s.H>\n#include <lib\/workarounds\/adr32s_workarounds.H>\n#include <lib\/utils\/find.H>\n\nusing fapi2::TARGET_TYPE_MCA;\nusing fapi2::TARGET_TYPE_SYSTEM;\nusing fapi2::FAPI2_RC_SUCCESS;\n\nnamespace mss\n{\n\n\/\/ Definition of the ADR32S DLL Config registers\nconst std::vector<uint64_t> adr32sTraits<fapi2::TARGET_TYPE_MCA>::DLL_CNFG_REG =\n{\n    MCA_DDRPHY_ADR_DLL_CNTL_P0_ADR32S0,\n    MCA_DDRPHY_ADR_DLL_CNTL_P0_ADR32S1\n};\n\n\/\/ Definition of the ADR32S output driver registers\nconst std::vector<uint64_t> adr32sTraits<fapi2::TARGET_TYPE_MCA>::OUTPUT_DRIVER_REG =\n{\n    MCA_DDRPHY_ADR_OUTPUT_FORCE_ATEST_CNTL_P0_ADR32S0,\n    MCA_DDRPHY_ADR_OUTPUT_FORCE_ATEST_CNTL_P0_ADR32S1,\n};\n\n\/\/ Definition of the ADR32S duty cycle distortion registers\nconst std::vector<uint64_t> adr32sTraits<fapi2::TARGET_TYPE_MCA>::DUTY_CYCLE_DISTORTION_REG =\n{\n    MCA_DDRPHY_ADR_DCD_CONTROL_P0_ADR32S0,\n    MCA_DDRPHY_ADR_DCD_CONTROL_P0_ADR32S1,\n};\n\n\/\/ Definition of the ADR32S write clock static offset registers\nconst std::vector<uint64_t> adr32sTraits<fapi2::TARGET_TYPE_MCA>::PR_STATIC_OFFSET_REG =\n{\n    MCA_DDRPHY_ADR_MCCLK_WRCLK_PR_STATIC_OFFSET_P0_ADR32S0,\n    MCA_DDRPHY_ADR_MCCLK_WRCLK_PR_STATIC_OFFSET_P0_ADR32S1,\n};\n\nnamespace adr32s\n{\n\n\/\/\/\n\/\/\/ @brief Perform ADR DCD calibration - Nimbus Only\n\/\/\/ @param[in] i_target the MCBIST (controler) to perform calibration on\n\/\/\/ @return FAPI2_RC_SUCCESS iff ok\n\/\/\/\nfapi2::ReturnCode duty_cycle_distortion_calibration( const fapi2::Target<fapi2::TARGET_TYPE_MCBIST>& i_target )\n{\n    typedef adr32sTraits<TARGET_TYPE_MCA> TT;\n\n    const auto l_mca = mss::find_targets<TARGET_TYPE_MCA>(i_target);\n    fapi2::buffer<uint64_t> l_read;\n    uint8_t l_sim = 0;\n\n    FAPI_TRY( mss::is_simulation( l_sim) );\n\n    \/\/ Nothing works here in cycle sim ...\n    if (l_sim)\n    {\n        return FAPI2_RC_SUCCESS;\n    }\n\n    if (l_mca.size() == 0)\n    {\n        FAPI_INF(\"No MCA, skipping duty cycle distortion calibration\");\n        return FAPI2_RC_SUCCESS;\n    }\n\n    \/\/ Do a quick check to make sure this chip doesn't have the DCD logic built in (e.g., DD1 Nimbus)\n    \/\/ TODO RTC:159687 For DD2 all we need to do is kick off the h\/w cal and wait. We can check any ADR_DCD\n    \/\/ register, they all should reflect the inclusion of the DCD logic.\n\n    FAPI_TRY( mss::getScom(l_mca[0], TT::DUTY_CYCLE_DISTORTION_REG[0], l_read) );\n\n    if (l_read.getBit<TT::DCD_CONTROL_DLL_CORRECT_EN>() == 1)\n    {\n        FAPI_ERR(\"seeing ADR DCD algorithm is in the logic but we didn't code it?\");\n        fapi2::Assert(false);\n    }\n\n    \/\/ Runs the DD1 algorithm for now. The below TODO is to add in a switch to the DD2 algorithm\n    \/\/ TODO RTC:159687 For DD2 all we need to do is kick off the h\/w cal and wait. We can check any ADR_DCD\n    FAPI_TRY(mss::workarounds::adr32s::duty_cycle_distortion_calibration(i_target));\n\nfapi_try_exit:\n    return fapi2::current_err;\n}\n\n} \/\/ close namespace adrs32\n\n} \/\/ close namespace mss\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Filename: config_rocket.cxx\n\/\/ Created by:  rdb (04Nov11)\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 \"config_rocket.h\"\n#include \"rocketFileInterface.h\"\n#include \"rocketInputHandler.h\"\n#include \"rocketRegion.h\"\n#include \"rocketSystemInterface.h\"\n\n#include \"pandaSystem.h\"\n#include \"dconfig.h\"\n#include \"default_font.h\"\n\n\/\/ This is defined by both Panda and Rocket.\n#define Factory RocketFactory\n#include <Rocket\/Core.h>\n#undef Factory\n\nConfigure(config_rocket);\nNotifyCategoryDef(rocket, \"\");\n\nConfigureFn(config_rocket) {\n  init_librocket();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: init_librocket\n\/\/  Description: Initializes the library.  This must be called at\n\/\/               least once before any of the functions or classes in\n\/\/               this library can be used.  Normally it will be\n\/\/               called by the static initializers and need not be\n\/\/               called explicitly, but special cases exist.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid\ninit_librocket() {\n  static bool initialized = false;\n  if (initialized) {\n    return;\n  }\n  initialized = true;\n\n  RocketInputHandler::init_type();\n  RocketRegion::init_type();\n\n  RocketFileInterface* fi = new RocketFileInterface;\n  Rocket::Core::SetFileInterface(fi);\n\n  RocketSystemInterface* si = new RocketSystemInterface;\n  Rocket::Core::SetSystemInterface(si);\n\n  Rocket::Core::Initialise();\n\n#ifdef COMPILE_IN_DEFAULT_FONT\n#ifdef HAVE_FREETYPE\n  \/\/ Load Panda's default compiled-in freetype font (Perspective Sans).\n  Rocket::Core::FontDatabase::LoadFontFace(default_font_data, default_font_size);\n#endif\n#endif\n}\n<commit_msg>Add libRocket to PandaSystem<commit_after>\/\/ Filename: config_rocket.cxx\n\/\/ Created by:  rdb (04Nov11)\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 \"config_rocket.h\"\n#include \"rocketFileInterface.h\"\n#include \"rocketInputHandler.h\"\n#include \"rocketRegion.h\"\n#include \"rocketSystemInterface.h\"\n\n#include \"pandaSystem.h\"\n#include \"dconfig.h\"\n#include \"default_font.h\"\n\n\/\/ This is defined by both Panda and Rocket.\n#define Factory RocketFactory\n#include <Rocket\/Core.h>\n#undef Factory\n\nConfigure(config_rocket);\nNotifyCategoryDef(rocket, \"\");\n\nConfigureFn(config_rocket) {\n  init_librocket();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: init_librocket\n\/\/  Description: Initializes the library.  This must be called at\n\/\/               least once before any of the functions or classes in\n\/\/               this library can be used.  Normally it will be\n\/\/               called by the static initializers and need not be\n\/\/               called explicitly, but special cases exist.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid\ninit_librocket() {\n  static bool initialized = false;\n  if (initialized) {\n    return;\n  }\n  initialized = true;\n\n  RocketInputHandler::init_type();\n  RocketRegion::init_type();\n\n  if (rocket_cat->is_debug()) {\n    rocket_cat->debug() << \"Initializing libRocket library.\\n\";\n  }\n\n  RocketFileInterface* fi = new RocketFileInterface;\n  Rocket::Core::SetFileInterface(fi);\n\n  RocketSystemInterface* si = new RocketSystemInterface;\n  Rocket::Core::SetSystemInterface(si);\n\n  Rocket::Core::Initialise();\n\n  \/\/ Register that we have the libRocket system.\n  PandaSystem *ps = PandaSystem::get_global_ptr();\n  ps->add_system(\"libRocket\");\n\n#ifdef COMPILE_IN_DEFAULT_FONT\n#ifdef HAVE_FREETYPE\n  \/\/ Load Panda's default compiled-in freetype font (Perspective Sans).\n  Rocket::Core::FontDatabase::LoadFontFace(default_font_data, default_font_size);\n#endif\n#endif\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Filename: binToC.cxx\n\/\/ Created by:  drose (18Jul03)\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ PANDA 3D SOFTWARE\n\/\/ Copyright (c) 2001 - 2004, Disney Enterprises, Inc.  All rights reserved\n\/\/\n\/\/ All use of this software is subject to the terms of the Panda 3d\n\/\/ Software license.  You should have received a copy of this license\n\/\/ along with this source code; you will also find a current copy of\n\/\/ the license at http:\/\/etc.cmu.edu\/panda3d\/docs\/license\/ .\n\/\/\n\/\/ To contact the maintainers of this program write to\n\/\/ panda3d-general@lists.sourceforge.net .\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n#include \"binToC.h\"\n\n\/\/ The number of bytes across the page to write.\nstatic const int col_width = 11;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BinToC::Constructor\n\/\/       Access: Public\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nBinToC::\nBinToC() :\n  WithOutputFile(true, true, false)\n{\n  clear_runlines();\n  add_runline(\"input output.c\");\n  add_runline(\"input -o output.c\");\n  add_runline(\"input >output.c\");\n\n  set_program_description\n    (\"bin2c is a simple utility program to read a disk file, presumably \"\n     \"one with binary contents, and output a table that can be \"\n     \"compiled via a C compiler to generate the same data.  It's handy \"\n     \"for portably importing binary data into a library or executable.\");\n\n  add_option\n    (\"n\", \"name\", 0, \n     \"Specify the name of the table that is generated.\",\n     &BinToC::dispatch_string, NULL, &_table_name);\n\n  add_option\n    (\"static\", \"\", 0, \n     \"Flag the table with the keyword 'static'.\",\n     &BinToC::dispatch_none, &_static_table);\n\n  add_option\n    (\"string\", \"\", 0,\n     \"Define the table suitablly to pass to a string constructor.\",\n     &BinToC::dispatch_none, &_for_string);\n\n  add_option\n    (\"o\", \"filename\", 0, \n     \"Specify the filename to which the resulting C code will be written.  \"\n     \"If this option is omitted, the last parameter name is taken to be the \"\n     \"name of the output file, or standard output is used if there are no \"\n     \"other parameters.\",\n     &BinToC::dispatch_filename, &_got_output_filename, &_output_filename);\n\n  _table_name = \"data\";\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BinToC::run\n\/\/       Access: Public\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BinToC::\nrun() {\n  ifstream in;\n  if (!_input_filename.open_read(in)) {\n    nout << \"Unable to read \" << _input_filename << \".\\n\";\n    exit(1);\n  }\n\n  ostream &out = get_output();\n  string static_keyword;\n  if (_static_table) {\n    static_keyword = \"static \";\n  }\n\n  string table_type = \"const unsigned char \";\n  string length_type = \"const int \";\n  if (_for_string) {\n    table_type = \"const char \";\n    length_type = \"const size_t \";\n  }\n\n  out << \"\\n\"\n      << \"\/*\\n\"\n      << \" * This table was generated by the command:\\n\"\n      << \" *\\n\"\n      << \" * \" << get_exec_command() << \"\\n\"\n      << \" *\/\\n\\n\"\n      << static_keyword << table_type << _table_name << \"[] = {\";\n  out << hex << setfill('0');\n  int count = 0;\n  int col = 0;\n  unsigned int ch;\n  ch = in.get();\n  while (!in.fail() && !in.eof()) {\n    if (col == 0) {\n      out << \"\\n  \";\n    } else if (col == col_width) {\n      out << \",\\n  \";\n      col = 0;\n    } else {\n      out << \", \";\n    }\n    out << \"0x\" << setw(2) << ch;\n    col++;\n    count++;\n    ch = in.get();\n  }\n  out << \"\\n};\\n\\n\"\n      << static_keyword << length_type << _table_name << \"_len = \" \n      << dec << count << \";\\n\\n\";\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BinToC::handle_args\n\/\/       Access: Protected, Virtual\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool BinToC::\nhandle_args(ProgramBase::Args &args) {\n  if (args.size() == 2 && !_got_output_filename) {\n    \/\/ The second argument, if present, is implicitly the output file.\n    _got_output_filename = true;\n    _output_filename = args[1];\n    args.pop_back();\n  }\n\n  if (args.size() != 1) {\n    nout << \"You must specify exactly one input file to read on the command line.\\n\";\n    return false;\n  }\n\n  _input_filename = Filename::binary_filename(args[0]);\n  return true;\n}\n\n\nint main(int argc, char *argv[]) {\n  BinToC prog;\n  prog.parse_command_line(argc, argv);\n  prog.run();\n  return 0;\n}\n<commit_msg>avoid noisy errors on win32<commit_after>\/\/ Filename: binToC.cxx\n\/\/ Created by:  drose (18Jul03)\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ PANDA 3D SOFTWARE\n\/\/ Copyright (c) 2001 - 2004, Disney Enterprises, Inc.  All rights reserved\n\/\/\n\/\/ All use of this software is subject to the terms of the Panda 3d\n\/\/ Software license.  You should have received a copy of this license\n\/\/ along with this source code; you will also find a current copy of\n\/\/ the license at http:\/\/etc.cmu.edu\/panda3d\/docs\/license\/ .\n\/\/\n\/\/ To contact the maintainers of this program write to\n\/\/ panda3d-general@lists.sourceforge.net .\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n#include \"binToC.h\"\n\n\/\/ The number of bytes across the page to write.\nstatic const int col_width = 11;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BinToC::Constructor\n\/\/       Access: Public\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nBinToC::\nBinToC() :\n  WithOutputFile(true, true, false)\n{\n  clear_runlines();\n  add_runline(\"input output.c\");\n  add_runline(\"input -o output.c\");\n  add_runline(\"input >output.c\");\n\n  set_program_description\n    (\"bin2c is a simple utility program to read a disk file, presumably \"\n     \"one with binary contents, and output a table that can be \"\n     \"compiled via a C compiler to generate the same data.  It's handy \"\n     \"for portably importing binary data into a library or executable.\");\n\n  add_option\n    (\"n\", \"name\", 0, \n     \"Specify the name of the table that is generated.\",\n     &BinToC::dispatch_string, NULL, &_table_name);\n\n  add_option\n    (\"static\", \"\", 0, \n     \"Flag the table with the keyword 'static'.\",\n     &BinToC::dispatch_none, &_static_table);\n\n  add_option\n    (\"string\", \"\", 0,\n     \"Define the table suitablly to pass to a string constructor.\",\n     &BinToC::dispatch_none, &_for_string);\n\n  add_option\n    (\"o\", \"filename\", 0, \n     \"Specify the filename to which the resulting C code will be written.  \"\n     \"If this option is omitted, the last parameter name is taken to be the \"\n     \"name of the output file, or standard output is used if there are no \"\n     \"other parameters.\",\n     &BinToC::dispatch_filename, &_got_output_filename, &_output_filename);\n\n  _table_name = \"data\";\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BinToC::run\n\/\/       Access: Public\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid BinToC::\nrun() {\n  ifstream in;\n  if (!_input_filename.open_read(in)) {\n    nout << \"Unable to read \" << _input_filename << \".\\n\";\n    exit(1);\n  }\n\n  ostream &out = get_output();\n  string static_keyword;\n  if (_static_table) {\n    static_keyword = \"static \";\n  }\n\n  string table_type = \"const unsigned char \";\n  string length_type = \"const int \";\n  if (_for_string) {\n    \/\/ Actually, declaring the table as \"const char\" causes VC7 to\n    \/\/ yell about truncating all of the values >= 0x80.\n    \/\/ table_type = \"const char \";\n    length_type = \"const size_t \";\n  }\n\n  out << \"\\n\"\n      << \"\/*\\n\"\n      << \" * This table was generated by the command:\\n\"\n      << \" *\\n\"\n      << \" * \" << get_exec_command() << \"\\n\"\n      << \" *\/\\n\\n\"\n      << static_keyword << table_type << _table_name << \"[] = {\";\n  out << hex << setfill('0');\n  int count = 0;\n  int col = 0;\n  unsigned int ch;\n  ch = in.get();\n  while (!in.fail() && !in.eof()) {\n    if (col == 0) {\n      out << \"\\n  \";\n    } else if (col == col_width) {\n      out << \",\\n  \";\n      col = 0;\n    } else {\n      out << \", \";\n    }\n    out << \"0x\" << setw(2) << ch;\n    col++;\n    count++;\n    ch = in.get();\n  }\n  out << \"\\n};\\n\\n\"\n      << static_keyword << length_type << _table_name << \"_len = \" \n      << dec << count << \";\\n\\n\";\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: BinToC::handle_args\n\/\/       Access: Protected, Virtual\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool BinToC::\nhandle_args(ProgramBase::Args &args) {\n  if (args.size() == 2 && !_got_output_filename) {\n    \/\/ The second argument, if present, is implicitly the output file.\n    _got_output_filename = true;\n    _output_filename = args[1];\n    args.pop_back();\n  }\n\n  if (args.size() != 1) {\n    nout << \"You must specify exactly one input file to read on the command line.\\n\";\n    return false;\n  }\n\n  _input_filename = Filename::binary_filename(args[0]);\n  return true;\n}\n\n\nint main(int argc, char *argv[]) {\n  BinToC prog;\n  prog.parse_command_line(argc, argv);\n  prog.run();\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n-----------------------------------------------------------------------------\nThis source file is part of OGRE\n    (Object-oriented Graphics Rendering Engine)\nFor the latest info, see http:\/\/www.ogre3d.org\/\n\nCopyright (c) 2000-2012 Torus Knot Software Ltd\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 \"OgreGLTextureManager.h\"\n#include \"OgreRoot.h\"\n#include \"OgreRenderSystem.h\"\n#include \"OgreGLRenderTexture.h\"\n\nnamespace Ogre {\n    \/\/-----------------------------------------------------------------------------\n    GLTextureManager::GLTextureManager(GLSupport& support)\n        : TextureManager(), mGLSupport(support), mWarningTextureID(0)\n    {\n        \/\/ register with group manager\n        ResourceGroupManager::getSingleton()._registerResourceManager(mResourceType, this);\n\n\t\tcreateWarningTexture();\n    }\n    \/\/-----------------------------------------------------------------------------\n    GLTextureManager::~GLTextureManager()\n    {\n        \/\/ unregister with group manager\n        ResourceGroupManager::getSingleton()._unregisterResourceManager(mResourceType);\n\t\t\/\/ Delete warning texture\n\t\tglDeleteTextures(1, &mWarningTextureID);\n    }\n    \/\/-----------------------------------------------------------------------------\n    Resource* GLTextureManager::createImpl(const String& name, ResourceHandle handle, \n        const String& group, bool isManual, ManualResourceLoader* loader, \n        const NameValuePairList* createParams)\n    {\n        return new GLTexture(this, name, handle, group, isManual, loader, mGLSupport);\n    }\n\n\t\/\/-----------------------------------------------------------------------------\n\tvoid GLTextureManager::createWarningTexture()\n\t{\n\t\t\/\/ Generate warning texture\n\t\tsize_t width = 8;\n\t\tsize_t height = 8;\n\t\tuint32 *data = new uint32[width*height];\t\t\/\/ 0xXXRRGGBB\n\t\t\/\/ Yellow\/black stripes\n\t\tfor(size_t y=0; y<height; ++y)\n\t\t{\n\t\t\tfor(size_t x=0; x<width; ++x)\n\t\t\t{\n\t\t\t\tdata[y*width+x] = (((x+y)%8)<4)?0x000000:0xFFFF00;\n\t\t\t}\n\t\t}\n\t\t\/\/ Create GL resource\n        glGenTextures(1, &mWarningTextureID);\n\t\tglBindTexture(GL_TEXTURE_2D, mWarningTextureID);\n\t\tif (GLEW_VERSION_1_2)\n\t\t{\n\t\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAX_LEVEL, 0);\n\t\t\tglTexImage2D(GL_TEXTURE_2D, 0, GL_RGB8, width, height, 0, GL_BGRA, GL_UNSIGNED_INT_8_8_8_8_REV, (void*)data);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tglTexImage2D(GL_TEXTURE_2D, 0, GL_RGB8, width, height, 0, GL_BGRA, GL_UNSIGNED_INT, (void*)data);\n\t\t}\n\t\t\/\/ Free memory\n\t\tdelete [] data;\n\t}\n\t\/\/-----------------------------------------------------------------------------\n\tPixelFormat GLTextureManager::getNativeFormat(TextureType ttype, PixelFormat format, int usage)\n\t{\n\t\t\/\/ Adjust requested parameters to capabilities\n        const RenderSystemCapabilities *caps = Root::getSingleton().getRenderSystem()->getCapabilities();\n\n\t\t\/\/ Check compressed texture support\n\t\t\/\/ if a compressed format not supported, revert to PF_A8R8G8B8\n\t\tif(PixelUtil::isCompressed(format) &&\n            !caps->hasCapability( RSC_TEXTURE_COMPRESSION_DXT ))\n\t\t{\n\t\t\treturn PF_A8R8G8B8;\n\t\t}\n\t\t\/\/ if floating point textures not supported, revert to PF_A8R8G8B8\n\t\tif(PixelUtil::isFloatingPoint(format) &&\n            !caps->hasCapability( RSC_TEXTURE_FLOAT ))\n\t\t{\n\t\t\treturn PF_A8R8G8B8;\n\t\t}\n        \n        \/\/ Check if this is a valid rendertarget format\n\t\tif( usage & TU_RENDERTARGET )\n        {\n            \/\/\/ Get closest supported alternative\n            \/\/\/ If mFormat is supported it's returned\n            return GLRTTManager::getSingleton().getSupportedAlternative(format);\n        }\n\n\t\t\/\/ Supported\n\t\treturn format;\n\n\t\t\n\t}\n\t\/\/-----------------------------------------------------------------------------\n    bool GLTextureManager::isHardwareFilteringSupported(TextureType ttype, PixelFormat format, int usage,\n            bool preciseFormatOnly)\n    {\n        if (format == PF_UNKNOWN)\n            return false;\n\n        \/\/ Check native format\n        PixelFormat nativeFormat = getNativeFormat(ttype, format, usage);\n        if (preciseFormatOnly && format != nativeFormat)\n            return false;\n\n        \/\/ Assume non-floating point is supported always\n        if (!PixelUtil::isFloatingPoint(nativeFormat))\n            return true;\n\n        \/\/ Hack: there are no elegant GL API to detects texture filtering supported,\n        \/\/ just hard code for cards based on vendor specifications.\n\n        \/\/ TODO: Add cards that 16 bits floating point flitering supported by\n        \/\/ hardware below\n        static const String sFloat16SupportedCards[] =\n        {\n            \/\/ GeForce 8 Series\n            \"*GeForce*8800*\",\n\n            \/\/ GeForce 7 Series\n            \"*GeForce*7950*\",\n            \"*GeForce*7900*\",\n            \"*GeForce*7800*\",\n            \"*GeForce*7600*\",\n            \"*GeForce*7500*\",\n            \"*GeForce*7300*\",\n\n            \/\/ GeForce 6 Series\n            \"*GeForce*6800*\",\n            \"*GeForce*6700*\",\n            \"*GeForce*6600*\",\n            \"*GeForce*6500*\",\n\n            \"\"                      \/\/ Empty string means end of list\n        };\n\n        \/\/ TODO: Add cards that 32 bits floating point flitering supported by\n        \/\/ hardware below\n        static const String sFloat32SupportedCards[] =\n        {\n            \/\/ GeForce 8 Series\n            \"*GeForce*8800*\",\n\n            \"\"                      \/\/ Empty string means end of list\n        };\n\n        PixelComponentType pct = PixelUtil::getComponentType(nativeFormat);\n        const String* supportedCards;\n        switch (pct)\n        {\n        case PCT_FLOAT16:\n            supportedCards = sFloat16SupportedCards;\n            break;\n        case PCT_FLOAT32:\n            supportedCards = sFloat32SupportedCards;\n            break;\n        default:\n            return false;\n        }\n\n        const GLubyte* pcRenderer = glGetString(GL_RENDERER);\n        String str = (const char*)pcRenderer;\n\n        for (; !supportedCards->empty(); ++supportedCards)\n        {\n            if (StringUtil::match(str, *supportedCards))\n            {\n                return true;\n            }\n        }\n\n        return false;\n    }\n\n}\n<commit_msg>Fixed OpenGL not loading properly if OGRE_THREAD_MODE = 1 (Initialization order problem)<commit_after>\/*\n-----------------------------------------------------------------------------\nThis source file is part of OGRE\n    (Object-oriented Graphics Rendering Engine)\nFor the latest info, see http:\/\/www.ogre3d.org\/\n\nCopyright (c) 2000-2012 Torus Knot Software Ltd\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 \"OgreGLTextureManager.h\"\n#include \"OgreRoot.h\"\n#include \"OgreRenderSystem.h\"\n#include \"OgreGLRenderTexture.h\"\n\nnamespace Ogre {\n    \/\/-----------------------------------------------------------------------------\n    GLTextureManager::GLTextureManager(GLSupport& support)\n        : TextureManager(), mGLSupport(support), mWarningTextureID(0)\n    {\n        \/\/ register with group manager\n        ResourceGroupManager::getSingleton()._registerResourceManager(mResourceType, this);\n    }\n    \/\/-----------------------------------------------------------------------------\n    GLTextureManager::~GLTextureManager()\n    {\n        \/\/ unregister with group manager\n        ResourceGroupManager::getSingleton()._unregisterResourceManager(mResourceType);\n\n        \/\/ Delete warning texture\n        if (mWarningTextureID != 0)\n        {\n            glDeleteTextures(1, &mWarningTextureID);\n        }\n    }\n    \/\/-----------------------------------------------------------------------------\n    Resource* GLTextureManager::createImpl(const String& name, ResourceHandle handle, \n        const String& group, bool isManual, ManualResourceLoader* loader, \n        const NameValuePairList* createParams)\n    {\n        if (mWarningTextureID == 0)\n        {\n            createWarningTexture();\n        }\n        return new GLTexture(this, name, handle, group, isManual, loader, mGLSupport);\n    }\n\n\t\/\/-----------------------------------------------------------------------------\n\tvoid GLTextureManager::createWarningTexture()\n\t{\n\t\t\/\/ Generate warning texture\n\t\tsize_t width = 8;\n\t\tsize_t height = 8;\n\t\tuint32 *data = new uint32[width*height];\t\t\/\/ 0xXXRRGGBB\n\t\t\/\/ Yellow\/black stripes\n\t\tfor(size_t y=0; y<height; ++y)\n\t\t{\n\t\t\tfor(size_t x=0; x<width; ++x)\n\t\t\t{\n\t\t\t\tdata[y*width+x] = (((x+y)%8)<4)?0x000000:0xFFFF00;\n\t\t\t}\n\t\t}\n\t\t\/\/ Create GL resource\n        glGenTextures(1, &mWarningTextureID);\n\t\tglBindTexture(GL_TEXTURE_2D, mWarningTextureID);\n\t\tif (GLEW_VERSION_1_2)\n\t\t{\n\t\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAX_LEVEL, 0);\n\t\t\tglTexImage2D(GL_TEXTURE_2D, 0, GL_RGB8, width, height, 0, GL_BGRA, GL_UNSIGNED_INT_8_8_8_8_REV, (void*)data);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tglTexImage2D(GL_TEXTURE_2D, 0, GL_RGB8, width, height, 0, GL_BGRA, GL_UNSIGNED_INT, (void*)data);\n\t\t}\n\t\t\/\/ Free memory\n\t\tdelete [] data;\n\t}\n\t\/\/-----------------------------------------------------------------------------\n\tPixelFormat GLTextureManager::getNativeFormat(TextureType ttype, PixelFormat format, int usage)\n\t{\n\t\t\/\/ Adjust requested parameters to capabilities\n        const RenderSystemCapabilities *caps = Root::getSingleton().getRenderSystem()->getCapabilities();\n\n\t\t\/\/ Check compressed texture support\n\t\t\/\/ if a compressed format not supported, revert to PF_A8R8G8B8\n\t\tif(PixelUtil::isCompressed(format) &&\n            !caps->hasCapability( RSC_TEXTURE_COMPRESSION_DXT ))\n\t\t{\n\t\t\treturn PF_A8R8G8B8;\n\t\t}\n\t\t\/\/ if floating point textures not supported, revert to PF_A8R8G8B8\n\t\tif(PixelUtil::isFloatingPoint(format) &&\n            !caps->hasCapability( RSC_TEXTURE_FLOAT ))\n\t\t{\n\t\t\treturn PF_A8R8G8B8;\n\t\t}\n        \n        \/\/ Check if this is a valid rendertarget format\n\t\tif( usage & TU_RENDERTARGET )\n        {\n            \/\/\/ Get closest supported alternative\n            \/\/\/ If mFormat is supported it's returned\n            return GLRTTManager::getSingleton().getSupportedAlternative(format);\n        }\n\n\t\t\/\/ Supported\n\t\treturn format;\n\n\t\t\n\t}\n\t\/\/-----------------------------------------------------------------------------\n    bool GLTextureManager::isHardwareFilteringSupported(TextureType ttype, PixelFormat format, int usage,\n            bool preciseFormatOnly)\n    {\n        if (format == PF_UNKNOWN)\n            return false;\n\n        \/\/ Check native format\n        PixelFormat nativeFormat = getNativeFormat(ttype, format, usage);\n        if (preciseFormatOnly && format != nativeFormat)\n            return false;\n\n        \/\/ Assume non-floating point is supported always\n        if (!PixelUtil::isFloatingPoint(nativeFormat))\n            return true;\n\n        \/\/ Hack: there are no elegant GL API to detects texture filtering supported,\n        \/\/ just hard code for cards based on vendor specifications.\n\n        \/\/ TODO: Add cards that 16 bits floating point flitering supported by\n        \/\/ hardware below\n        static const String sFloat16SupportedCards[] =\n        {\n            \/\/ GeForce 8 Series\n            \"*GeForce*8800*\",\n\n            \/\/ GeForce 7 Series\n            \"*GeForce*7950*\",\n            \"*GeForce*7900*\",\n            \"*GeForce*7800*\",\n            \"*GeForce*7600*\",\n            \"*GeForce*7500*\",\n            \"*GeForce*7300*\",\n\n            \/\/ GeForce 6 Series\n            \"*GeForce*6800*\",\n            \"*GeForce*6700*\",\n            \"*GeForce*6600*\",\n            \"*GeForce*6500*\",\n\n            \"\"                      \/\/ Empty string means end of list\n        };\n\n        \/\/ TODO: Add cards that 32 bits floating point flitering supported by\n        \/\/ hardware below\n        static const String sFloat32SupportedCards[] =\n        {\n            \/\/ GeForce 8 Series\n            \"*GeForce*8800*\",\n\n            \"\"                      \/\/ Empty string means end of list\n        };\n\n        PixelComponentType pct = PixelUtil::getComponentType(nativeFormat);\n        const String* supportedCards;\n        switch (pct)\n        {\n        case PCT_FLOAT16:\n            supportedCards = sFloat16SupportedCards;\n            break;\n        case PCT_FLOAT32:\n            supportedCards = sFloat32SupportedCards;\n            break;\n        default:\n            return false;\n        }\n\n        const GLubyte* pcRenderer = glGetString(GL_RENDERER);\n        String str = (const char*)pcRenderer;\n\n        for (; !supportedCards->empty(); ++supportedCards)\n        {\n            if (StringUtil::match(str, *supportedCards))\n            {\n                return true;\n            }\n        }\n\n        return false;\n    }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <string>\n#include <queue>\n\n#include \"tpunit++.hpp\"\n#include \"fakeit.h\"\n#include \"fakeit\/Exceptions.h\"\n\nusing namespace fakeit;\n\nclass AbstractType {\npublic:\n\tvirtual void foo() = 0;\n};\n\nclass ConcreteType: public AbstractType {\npublic:\n\tint state;\n\tConcreteType() :\n\t\t\tstate(10) {\n\t}\n\tvirtual void foo() override {\n\t}\n\n\tbool operator==(const ConcreteType& other) {\n\t\treturn (other.state == this->state);\n\t}\n\n};\n\nstruct ReferenceInterface {\n\tvirtual int& returnIntByRef() = 0;\n\tvirtual AbstractType& returnAbstractTypeByRef() = 0;\n\tvirtual ConcreteType& returnConcreteTypeByRef() = 0;\n};\n\n\/\/static bool operator==(const ReferenceInterface& a, const ReferenceInterface& b) {\n\/\/\treturn (&a == &b);\n\/\/}\n\nstruct ReferenceTypesTests: tpunit::TestFixture {\n\tReferenceTypesTests() :\n\t\t\ttpunit::TestFixture(\n\t\t\t\/\/\n\t\t\t\t\tTEST(ReferenceTypesTests::implicitStubbingDefaultReturnValues),\n\t\t\t\t\tTEST(ReferenceTypesTests::explicitStubbingDefualtReturnValues),\n\t\t\t\t\tTEST(ReferenceTypesTests::explicitStubbingDefualtReturnValues_with_AlwaysReturn),\n\t\t\t\t\tTEST(ReferenceTypesTests::explicitStubbingReturnValues)\n\t\t\t\t\t\/\/\n\t\t\t\t\t\t\t) \/\/\n\t{\n\t}\n\n\tvoid implicitStubbingDefaultReturnValues() {\n\t\tMock<ReferenceInterface> mock;\n\t\tFake( \/\/\n\t\t\t\tmock[&ReferenceInterface::returnIntByRef], \/\/\n\t\t\t\tmock[&ReferenceInterface::returnAbstractTypeByRef], \/\/\n\t\t\t\tmock[&ReferenceInterface::returnConcreteTypeByRef] \/\/\n\t\t\t\t);\n\n\t\tReferenceInterface & i = mock.get();\n\n\t\t\/\/ Fundamental types are initiated to 0.\n\t\t\/\/ Return a reference to the default value.\n\t\tASSERT_EQUAL(0, i.returnIntByRef());\n\n\t\t\/\/ Concrete types types are initiated by default ctor.\n\t\t\/\/ Return a reference to the default value.\n\t\tASSERT_EQUAL(ConcreteType(), i.returnConcreteTypeByRef());\n\n\t\t\/\/ For abstract types return a reference to nullptr.\n\t\tASSERT_EQUAL(nullptr, &i.returnAbstractTypeByRef());\n\t}\n\n\tvoid explicitStubbingDefualtReturnValues() {\n\t\tMock<ReferenceInterface> mock;\n\t\tWhen(mock[&ReferenceInterface::returnIntByRef]).Return(); \/\/\n\t\tWhen(mock[&ReferenceInterface::returnAbstractTypeByRef]).Return(); \/\/\n\t\tWhen(mock[&ReferenceInterface::returnConcreteTypeByRef]).Return(); \/\/\n\n\n\t\tReferenceInterface & i = mock.get();\n\n\t\t\/\/ Fundamental types are initiated to 0.\n\t\t\/\/ Return a reference to the default value.\n\t\tASSERT_EQUAL(0, i.returnIntByRef());\n\n\t\t\/\/ Concrete types types are initiated by default ctor.\n\t\t\/\/ Return a reference to the default value.\n\t\tASSERT_EQUAL(ConcreteType(), i.returnConcreteTypeByRef());\n\n\t\t\/\/ For abstract types return a reference to nullptr.\n\t\tASSERT_EQUAL(nullptr, &i.returnAbstractTypeByRef());\n\t}\n\n\tvoid explicitStubbingReturnValues() {\n\t\tMock<ReferenceInterface> mock;\/\/\n\n\t\tint num{1};\n\t\tConcreteType c;\n\t\tAbstractType& a = c;\n\t\tWhen(mock[&ReferenceInterface::returnIntByRef]).Return(num); \/\/\n\t\tWhen(mock[&ReferenceInterface::returnConcreteTypeByRef]).Return(c); \/\/\n\t\tWhen(mock[&ReferenceInterface::returnAbstractTypeByRef]).Return(a); \/\/\n\n\n\t\tReferenceInterface & i = mock.get();\n\n\t\t\/\/ Fundamental types are initiated to 0.\n\t\t\/\/ Return a reference to the default value.\n\t\tASSERT_EQUAL(1, i.returnIntByRef());\n\n\t\t\/\/ Concrete types types are initiated by default ctor.\n\t\t\/\/ Return a reference to the default value.\n\t\tASSERT_EQUAL(&c, &i.returnConcreteTypeByRef());\n\n\t\t\/\/ For abstract types return a reference to nullptr.\n\t\tASSERT_EQUAL(&c, &i.returnAbstractTypeByRef());\n\t}\n\n\tvoid explicitStubbingDefualtReturnValues_with_AlwaysReturn() {\n\t\tMock<ReferenceInterface> mock;\n\t\tWhen(mock[&ReferenceInterface::returnIntByRef]).AlwaysReturn();\n\t\tWhen(mock[&ReferenceInterface::returnAbstractTypeByRef]).AlwaysReturn(); \/\/\n\t\tWhen(mock[&ReferenceInterface::returnConcreteTypeByRef]).AlwaysReturn(); \/\/\n\n\t\tReferenceInterface & i = mock.get();\n\n\t\t\/\/ Fundamental types are initiated to 0.\n\t\t\/\/ Return a reference to the default value.\n\t\tASSERT_EQUAL(0, i.returnIntByRef());\n\n\t\t\/\/ Concrete types types are initiated by default ctor.\n\t\t\/\/ Return a reference to the default value.\n\t\tASSERT_EQUAL(ConcreteType(), i.returnConcreteTypeByRef());\n\n\t\t\/\/ For abstract types return a reference to nullptr.\n\t\tASSERT_EQUAL(nullptr, &i.returnAbstractTypeByRef());\n\t}\n\n} __ReferenceTypesTests;\n<commit_msg>cleanup tests<commit_after>#include <string>\n#include <queue>\n\n#include \"tpunit++.hpp\"\n#include \"fakeit.h\"\n#include \"fakeit\/Exceptions.h\"\n\nusing namespace fakeit;\n\n\nstruct ReferenceTypesTests: tpunit::TestFixture {\n\n\tclass AbstractType {\n\tpublic:\n\t\tvirtual void foo() = 0;\n\t};\n\n\tclass ConcreteType: public AbstractType {\n\tpublic:\n\t\tint state;\n\t\tConcreteType() :\n\t\t\t\tstate(10) {\n\t\t}\n\t\tvirtual void foo() override {\n\t\t}\n\n\t\tbool operator==(const ConcreteType& other) {\n\t\t\treturn (other.state == this->state);\n\t\t}\n\n\t};\n\n\tstruct ReferenceInterface {\n\t\tvirtual int& returnIntByRef() = 0;\n\t\tvirtual AbstractType& returnAbstractTypeByRef() = 0;\n\t\tvirtual ConcreteType& returnConcreteTypeByRef() = 0;\n\t};\n\n\tReferenceTypesTests() :\n\t\t\ttpunit::TestFixture(\n\t\t\t\/\/\n\t\t\t\t\tTEST(ReferenceTypesTests::implicitStubbingDefaultReturnValues),\n\t\t\t\t\tTEST(ReferenceTypesTests::explicitStubbingDefualtReturnValues),\n\t\t\t\t\tTEST(ReferenceTypesTests::explicitStubbingDefualtReturnValues_with_AlwaysReturn),\n\t\t\t\t\tTEST(ReferenceTypesTests::explicitStubbingReturnValues)\n\t\t\t\t\t\/\/\n\t\t\t\t\t\t\t) \/\/\n\t{\n\t}\n\n\tvoid implicitStubbingDefaultReturnValues() {\n\t\tMock<ReferenceInterface> mock;\n\t\tFake( \/\/\n\t\t\t\tmock[&ReferenceInterface::returnIntByRef], \/\/\n\t\t\t\tmock[&ReferenceInterface::returnAbstractTypeByRef], \/\/\n\t\t\t\tmock[&ReferenceInterface::returnConcreteTypeByRef] \/\/\n\t\t\t\t);\n\n\t\tReferenceInterface & i = mock.get();\n\n\t\t\/\/ Fundamental types are initiated to 0.\n\t\t\/\/ Return a reference to the default value.\n\t\tASSERT_EQUAL(0, i.returnIntByRef());\n\n\t\t\/\/ Concrete types types are initiated by default ctor.\n\t\t\/\/ Return a reference to the default value.\n\t\tASSERT_EQUAL(ConcreteType(), i.returnConcreteTypeByRef());\n\n\t\t\/\/ For abstract types return a reference to nullptr.\n\t\tASSERT_EQUAL(nullptr, &i.returnAbstractTypeByRef());\n\t}\n\n\tvoid explicitStubbingDefualtReturnValues() {\n\t\tMock<ReferenceInterface> mock;\n\t\tWhen(mock[&ReferenceInterface::returnIntByRef]).Return(); \/\/\n\t\tWhen(mock[&ReferenceInterface::returnAbstractTypeByRef]).Return(); \/\/\n\t\tWhen(mock[&ReferenceInterface::returnConcreteTypeByRef]).Return(); \/\/\n\n\n\t\tReferenceInterface & i = mock.get();\n\n\t\t\/\/ Fundamental types are initiated to 0.\n\t\t\/\/ Return a reference to the default value.\n\t\tASSERT_EQUAL(0, i.returnIntByRef());\n\n\t\t\/\/ Concrete types types are initiated by default ctor.\n\t\t\/\/ Return a reference to the default value.\n\t\tASSERT_EQUAL(ConcreteType(), i.returnConcreteTypeByRef());\n\n\t\t\/\/ For abstract types return a reference to nullptr.\n\t\tASSERT_EQUAL(nullptr, &i.returnAbstractTypeByRef());\n\t}\n\n\tvoid explicitStubbingReturnValues() {\n\t\tMock<ReferenceInterface> mock;\/\/\n\n\t\tint num{1};\n\t\tConcreteType c;\n\t\tAbstractType& a = c;\n\t\tWhen(mock[&ReferenceInterface::returnIntByRef]).Return(num); \/\/\n\t\tWhen(mock[&ReferenceInterface::returnConcreteTypeByRef]).Return(c); \/\/\n\t\tWhen(mock[&ReferenceInterface::returnAbstractTypeByRef]).Return(a); \/\/\n\n\n\t\tReferenceInterface & i = mock.get();\n\n\t\t\/\/ Fundamental types are initiated to 0.\n\t\t\/\/ Return a reference to the default value.\n\t\tASSERT_EQUAL(1, i.returnIntByRef());\n\n\t\t\/\/ Concrete types types are initiated by default ctor.\n\t\t\/\/ Return a reference to the default value.\n\t\tASSERT_EQUAL(&c, &i.returnConcreteTypeByRef());\n\n\t\t\/\/ For abstract types return a reference to nullptr.\n\t\tASSERT_EQUAL(&c, &i.returnAbstractTypeByRef());\n\t}\n\n\tvoid explicitStubbingDefualtReturnValues_with_AlwaysReturn() {\n\t\tMock<ReferenceInterface> mock;\n\t\tWhen(mock[&ReferenceInterface::returnIntByRef]).AlwaysReturn();\n\t\tWhen(mock[&ReferenceInterface::returnAbstractTypeByRef]).AlwaysReturn(); \/\/\n\t\tWhen(mock[&ReferenceInterface::returnConcreteTypeByRef]).AlwaysReturn(); \/\/\n\n\t\tReferenceInterface & i = mock.get();\n\n\t\t\/\/ Fundamental types are initiated to 0.\n\t\t\/\/ Return a reference to the default value.\n\t\tASSERT_EQUAL(0, i.returnIntByRef());\n\n\t\t\/\/ Concrete types types are initiated by default ctor.\n\t\t\/\/ Return a reference to the default value.\n\t\tASSERT_EQUAL(ConcreteType(), i.returnConcreteTypeByRef());\n\n\t\t\/\/ For abstract types return a reference to nullptr.\n\t\tASSERT_EQUAL(nullptr, &i.returnAbstractTypeByRef());\n\t}\n\n} __ReferenceTypesTests;\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Benchmark concurrent stats and links\/unlinks.  Ideally, this will\n\/\/ move a single cache line between stat and link: the cache line for\n\/\/ the link count.  Our hypothesis is that this is sufficient to limit\n\/\/ scalability, while tweaking stat to not return the link count will\n\/\/ lead to perfect scalability of stat.\n\n#include <fcntl.h>\n#include <stdint.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <sys\/utsname.h>\n#include <sys\/wait.h>\n\n#include <stdexcept>\n\n#include \"amd64.h\"\n#include \"histogram.hh\"\n#include \"libutil.h\"\n#include \"xsys.h\"\n#include \"pmcdb.hh\"\n\n#if defined(XV6_USER)\n#include \"pthread.h\"\n#include <xv6\/perf.h>\n#else\n#include <pthread.h>\n#endif\n\n#define RECORD_PMC 0\n\n#if MTRACE\n#include \"mtrace.h\"\n#endif\n\nenum { warmup_secs = 1 };\nenum { duration = 5 };\n\nstatic bool omit_nlink, record_pmc;\nstatic pthread_barrier_t bar, bar2;\nstatic int filefd;\nstatic uint64_t start_tsc[256], stop_tsc[256];\nstatic uint64_t start_usec[256], stop_usec[256];\nstatic uint64_t tsc_stat[256], tsc_link[256], pmc_stat[256];\nstatic uint64_t count[256];\nstatic volatile bool stop __mpalign__;\nstatic volatile bool warmup;\nstatic __padout__ __attribute__((unused));\n\nstatic histogram_log2<uint64_t, 1<<20> tsc_hist[256];\n\nvoid\nmystat()\n{\n  struct stat st;\n#if defined(XV6_USER)\n  fstatx(filefd, &st, omit_nlink ? STAT_OMIT_NLINK : STAT_NO_FLAGS);\n#else\n  fstat(filefd, &st);\n#endif\n}\n\nvoid*\ntimer_thread(void *)\n{\n  warmup = true;\n  pthread_barrier_wait(&bar);\n  pthread_barrier_wait(&bar2);\n  sleep(warmup_secs);\n  warmup = false;\n  sleep(duration);\n  stop = true;\n  return NULL;\n}\n\nvoid*\ndo_stat(void *opaque)\n{\n  uintptr_t cpu = (uintptr_t)opaque;\n  setaffinity(cpu);\n\n  pthread_barrier_wait(&bar);\n  pthread_barrier_wait(&bar2);\n\n  bool mywarmup = true;\n  uint64_t mycount = 0;\n  uint64_t pmc1 = 0, pmc2 = 0;\n  while (!stop) {\n    if (__builtin_expect(warmup != mywarmup, 0)) {\n      mywarmup = warmup;\n      mycount = 0;\n      start_usec[cpu] = now_usec();\n      start_tsc[cpu] = rdtsc();\n      if (record_pmc)\n        pmc1 = rdpmc(RECORD_PMC);\n    }\n    mystat();\n    ++mycount;\n  }\n  if (record_pmc)\n    pmc2 = rdpmc(RECORD_PMC);\n\n  stop_usec[cpu] = now_usec();\n  stop_tsc[cpu] = rdtsc();\n  count[cpu] = mycount;\n  tsc_stat[cpu] = stop_tsc[cpu] - start_tsc[cpu];\n  pmc_stat[cpu] = pmc2 - pmc1;\n  return NULL;\n}\n\nvoid*\ndo_link(void *opaque)\n{\n  uintptr_t cpu = (uintptr_t)opaque;\n  setaffinity(cpu);\n\n  char path[32];\n  snprintf(path, sizeof(path), \"%d\", (int)cpu);\n  mkdir(path, 0777);\n  snprintf(path, sizeof(path), \"%d\/link\", (int)cpu);\n\n  pthread_barrier_wait(&bar);\n  pthread_barrier_wait(&bar2);\n\n  bool mywarmup = true;\n  uint64_t mycount = 0;\n  while (!stop) {\n    if (__builtin_expect(warmup != mywarmup, 0)) {\n      mywarmup = warmup;\n      mycount = 0;\n      start_usec[cpu] = now_usec();\n      start_tsc[cpu] = rdtsc();\n    }\n    link(\"0\/file\", path);\n    unlink(path);\n    ++mycount;\n  }\n\n  stop_usec[cpu] = now_usec();\n  stop_tsc[cpu] = rdtsc();\n  count[cpu] = mycount;\n  tsc_link[cpu] = stop_tsc[cpu] - start_tsc[cpu];\n  return NULL;\n}\n\n#ifdef LINUX\nstatic inline uint64_t\nrdpmc(uint32_t ecx)\n{\n  uint32_t hi, lo;\n  __asm volatile(\"rdpmc\" : \"=a\" (lo), \"=d\" (hi) : \"c\" (ecx));\n  return ((uint64_t) lo) | (((uint64_t) hi) << 32);\n}\n#endif\n\nvoid*\ndo_both(void *opaque)\n{\n  uintptr_t cpu = (uintptr_t)opaque;\n  setaffinity(cpu);\n\n  char path[32];\n  snprintf(path, sizeof(path), \"%d\", (int)cpu);\n  mkdir(path, 0777);\n  snprintf(path, sizeof(path), \"%d\/link\", (int)cpu);\n\n  pthread_barrier_wait(&bar);\n  pthread_barrier_wait(&bar2);\n\n  bool mywarmup = true;\n  uint64_t mycount = 0, ltsc_stat = 0, ltsc_link = 0, lpmc_stat = 0;\n  while (!stop) {\n    if (__builtin_expect(warmup != mywarmup, 0)) {\n      mywarmup = warmup;\n      mycount = ltsc_stat = ltsc_link = lpmc_stat = 0;\n      start_usec[cpu] = now_usec();\n      start_tsc[cpu] = rdtsc();\n    }\n    uint64_t pmc1 = record_pmc ? rdpmc(RECORD_PMC) : 0;\n    uint64_t tsc1 = rdtsc();\n    mystat();\n    uint64_t tsc2 = rdtsc();\n    uint64_t pmc2 = record_pmc ? rdpmc(RECORD_PMC) : 0;\n    lpmc_stat += pmc2 - pmc1;\n    ltsc_stat += tsc2 - tsc1;\n    tsc_hist[cpu] += tsc2 - tsc1;\n    link(\"0\/file\", path);\n    unlink(path);\n    uint64_t tsc3 = rdtsc();\n    ltsc_link += tsc3 - tsc2;\n    ++mycount;\n  }\n\n  stop_usec[cpu] = now_usec();\n  stop_tsc[cpu] = rdtsc();\n  count[cpu] = mycount;\n  tsc_stat[cpu] = ltsc_stat;\n  tsc_link[cpu] = ltsc_link;\n  pmc_stat[cpu] = lpmc_stat;\n  return NULL;\n}\n\nuint64_t\nsummarize_ts(const char *label, uint64_t ts[], unsigned count)\n{\n  uint64_t min = ts[0], max = ts[0], total = 0;\n  for (unsigned i = 0; i < count; ++i) {\n    if (ts[i] < min)\n      min = ts[i];\n    if (ts[i] > max)\n      max = ts[i];\n    total += ts[i];\n  }\n  printf(\"%lu %s skew\\n\", max - min, label);\n  return total\/count;\n}\n\ntemplate<class T>\nT\nsum(T v[], unsigned count)\n{\n  T res{};\n  for (unsigned i = 0; i < count; ++i)\n    res += v[i];\n  return res;\n}\n\nvoid\nusage(const char *argv0)\n{\n  fprintf(stderr, \"Usage: %s [options] {-b nthreads|nstat nlink}\\n\", argv0);\n  fprintf(stderr, \"  -e perfevent  Measure perfevent\\n\");\n  fprintf(stderr, \"  -l true       Get st_nlink\\n\");\n  fprintf(stderr, \"     false      Omit st_nlink\\n\");\n  fprintf(stderr, \"  -b            Alternate between stat and link\\n\");\n  exit(2);\n}\n\nint\nmain(int argc, char **argv)\n{\n  char *pmc = nullptr;\n  bool both = false;\n  omit_nlink = false;\n\n  int opt;\n  while ((opt = getopt(argc, argv, \"e:l:b\")) != -1) {\n    switch (opt) {\n    case 'e':\n      pmc = optarg;\n      break;\n    case 'l':\n      if (strcmp(optarg, \"true\") == 0)\n        omit_nlink = false;\n      else if (strcmp(optarg, \"false\") == 0)\n        omit_nlink = true;\n      else\n        usage(argv[0]);\n      break;\n    case 'b':\n      both = true;\n      break;\n    default:\n      usage(argv[0]);\n    }\n  }\n\n  if ((both && argc - optind != 1) ||\n      (!both && argc - optind != 2))\n    usage(argv[0]);\n\n  int nstats = atoi(argv[optind]);\n  int nlinks = both ? 0 : atoi(argv[optind+1]);\n#if !defined(XV6_USER)\n  if (omit_nlink)\n    die(\"-l false not supported on Linux\");\n  if (pmc)\n    die(\"-e not supported on Linux\");\n#endif\n\n  printf(\"# --cores=%d --duration=%ds --st_nlink=%s\", nstats+nlinks, duration,\n         omit_nlink ? \"false\" : \"true\");\n  if (both)\n    printf(\"\\n\");\n  else\n    printf(\" --stats=%d --links=%d\\n\", nstats, nlinks);\n\n#if defined(XV6_USER)\n  \/\/ Configure PMC\n  if (pmc) {\n    try {\n      perf_start(pmcdb_parse_selector(pmc), 0);\n    } catch (std::invalid_argument &e) {\n      die(\"%s\", e.what());\n    }\n    record_pmc = true;\n  }\n#endif\n\n  \/\/ Set up file system\n  mkdir(\"linkbench-d\", 0777);\n  chdir(\"linkbench-d\");\n  mkdir(\"0\", 0777);\n  filefd = openat(AT_FDCWD, \"0\/file\", O_CREAT|O_RDWR, 0666);\n  if (filefd < 0)\n    die(\"openat failed\");\n\n  pthread_barrier_init(&bar, 0, nstats + nlinks + 2);\n  pthread_barrier_init(&bar2, 0, nstats + nlinks + 2);\n\n  \/\/ Run benchmark\n  pthread_t timer;\n  pthread_create(&timer, NULL, timer_thread, NULL);\n\n  pthread_t *threads = (pthread_t*)malloc(sizeof(*threads) * (nstats + nlinks));\n  for (uintptr_t i = 0; i < nstats + nlinks; ++i)\n    pthread_create(&threads[i], NULL,\n                   both ? do_both :\n                   i < nstats ? do_stat :\n                   do_link, (void*)i);\n\n  pthread_barrier_wait(&bar);\n\n#if MTRACE\n  mtenable_type(mtrace_record_ascope, \"xv6-linkbench\");\n#endif\n\n  pthread_barrier_wait(&bar2);\n\n  \/\/ Wait\n  xpthread_join(timer);\n  for (int i = 0; i < nstats + nlinks; ++i)\n    xpthread_join(threads[i]);\n\n#if MTRACE\n  mtdisable(\"xv6-linkbench\");\n#endif\n\n#if defined(XV6_USER)\n  if (record_pmc)\n    perf_stop();\n#endif\n\n  \/\/ Summarize\n  uint64_t start_tsc_avg = summarize_ts(\"start cycles\", start_tsc, nstats + nlinks);\n  uint64_t stop_tsc_avg = summarize_ts(\"stop cycles\", stop_tsc, nstats + nlinks);\n  printf(\"%lu cycles\\n\", stop_tsc_avg - start_tsc_avg);\n\n  uint64_t start_usec_avg = summarize_ts(\"start usec\", start_usec, nstats + nlinks);\n  uint64_t stop_usec_avg = summarize_ts(\"stop usec\", stop_usec, nstats + nlinks);\n  uint64_t usec = stop_usec_avg - start_usec_avg;\n  printf(\"%f secs\\n\", (double)usec \/ 1e6);\n\n  uint64_t stats, links;\n  if (both)\n    stats = links = sum(count, nstats + nlinks);\n  else\n    stats = sum(count, nstats), links = sum(count + nstats, nlinks);\n  printf(\"%lu stats\\n\", stats);\n  if (stats) {\n    printf(\"%lu cycles\/stat\\n\", sum(tsc_stat, nstats + nlinks) \/ stats);\n    printf(\"%lu stats\/sec\\n\", stats * 1000000 \/ usec);\n    if (record_pmc) {\n      printf(\"%lu %s\\n\", sum(pmc_stat, nstats + nlinks), pmc);\n      printf(\"%f %s\/stat\\n\", sum(pmc_stat, nstats + nlinks) \/ (double)stats, pmc);\n    }\n  }\n  printf(\"%lu links\\n\", links);\n  if (links) {\n    printf(\"%lu cycles\/link\\n\", sum(tsc_link, nstats + nlinks) \/ links);\n    printf(\"%lu links\/sec\\n\", links * 1000000 \/ usec);\n  }\n\n  \/\/ printf(\"stat tsc histogram: \");\n  \/\/ auto hist = sum(tsc_hist, nstats + nlinks);\n  \/\/ hist.print_stats();\n  \/\/ hist.print_bars();\n  \/\/ printf(\"\\n\");\n  \/\/ hist.print();\n\n  printf(\"\\n\");\n}\n<commit_msg>linkbench: Remove do_both mode<commit_after>\/\/ Benchmark concurrent stats and links\/unlinks.  Ideally, this will\n\/\/ move a single cache line between stat and link: the cache line for\n\/\/ the link count.  Our hypothesis is that this is sufficient to limit\n\/\/ scalability, while tweaking stat to not return the link count will\n\/\/ lead to perfect scalability of stat.\n\n#include <fcntl.h>\n#include <stdint.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <sys\/utsname.h>\n#include <sys\/wait.h>\n\n#include <stdexcept>\n\n#include \"amd64.h\"\n#include \"histogram.hh\"\n#include \"libutil.h\"\n#include \"xsys.h\"\n#include \"pmcdb.hh\"\n\n#if defined(XV6_USER)\n#include \"pthread.h\"\n#include <xv6\/perf.h>\n#else\n#include <pthread.h>\n#endif\n\n#define RECORD_PMC 0\n\n#if MTRACE\n#include \"mtrace.h\"\n#endif\n\nenum { warmup_secs = 1 };\nenum { duration = 5 };\n\nstatic bool omit_nlink, record_pmc;\nstatic pthread_barrier_t bar, bar2;\nstatic int filefd;\nstatic uint64_t start_tsc[256], stop_tsc[256];\nstatic uint64_t start_usec[256], stop_usec[256];\nstatic uint64_t tsc_stat[256], tsc_link[256], pmc_stat[256];\nstatic uint64_t count[256];\nstatic volatile bool stop __mpalign__;\nstatic volatile bool warmup;\nstatic __padout__ __attribute__((unused));\n\nstatic histogram_log2<uint64_t, 1<<20> tsc_hist[256];\n\nvoid\nmystat()\n{\n  struct stat st;\n#if defined(XV6_USER)\n  fstatx(filefd, &st, omit_nlink ? STAT_OMIT_NLINK : STAT_NO_FLAGS);\n#else\n  fstat(filefd, &st);\n#endif\n}\n\nvoid*\ntimer_thread(void *)\n{\n  warmup = true;\n  pthread_barrier_wait(&bar);\n  pthread_barrier_wait(&bar2);\n  sleep(warmup_secs);\n  warmup = false;\n  sleep(duration);\n  stop = true;\n  return NULL;\n}\n\nvoid*\ndo_stat(void *opaque)\n{\n  uintptr_t cpu = (uintptr_t)opaque;\n  setaffinity(cpu);\n\n  pthread_barrier_wait(&bar);\n  pthread_barrier_wait(&bar2);\n\n  bool mywarmup = true;\n  uint64_t mycount = 0;\n  uint64_t pmc1 = 0, pmc2 = 0;\n  while (!stop) {\n    if (__builtin_expect(warmup != mywarmup, 0)) {\n      mywarmup = warmup;\n      mycount = 0;\n      start_usec[cpu] = now_usec();\n      start_tsc[cpu] = rdtsc();\n      if (record_pmc)\n        pmc1 = rdpmc(RECORD_PMC);\n    }\n    mystat();\n    ++mycount;\n  }\n  if (record_pmc)\n    pmc2 = rdpmc(RECORD_PMC);\n\n  stop_usec[cpu] = now_usec();\n  stop_tsc[cpu] = rdtsc();\n  count[cpu] = mycount;\n  tsc_stat[cpu] = stop_tsc[cpu] - start_tsc[cpu];\n  pmc_stat[cpu] = pmc2 - pmc1;\n  return NULL;\n}\n\nvoid*\ndo_link(void *opaque)\n{\n  uintptr_t cpu = (uintptr_t)opaque;\n  setaffinity(cpu);\n\n  char path[32];\n  snprintf(path, sizeof(path), \"%d\", (int)cpu);\n  mkdir(path, 0777);\n  snprintf(path, sizeof(path), \"%d\/link\", (int)cpu);\n\n  pthread_barrier_wait(&bar);\n  pthread_barrier_wait(&bar2);\n\n  bool mywarmup = true;\n  uint64_t mycount = 0;\n  while (!stop) {\n    if (__builtin_expect(warmup != mywarmup, 0)) {\n      mywarmup = warmup;\n      mycount = 0;\n      start_usec[cpu] = now_usec();\n      start_tsc[cpu] = rdtsc();\n    }\n    link(\"0\/file\", path);\n    unlink(path);\n    ++mycount;\n  }\n\n  stop_usec[cpu] = now_usec();\n  stop_tsc[cpu] = rdtsc();\n  count[cpu] = mycount;\n  tsc_link[cpu] = stop_tsc[cpu] - start_tsc[cpu];\n  return NULL;\n}\n\n#ifdef LINUX\nstatic inline uint64_t\nrdpmc(uint32_t ecx)\n{\n  uint32_t hi, lo;\n  __asm volatile(\"rdpmc\" : \"=a\" (lo), \"=d\" (hi) : \"c\" (ecx));\n  return ((uint64_t) lo) | (((uint64_t) hi) << 32);\n}\n#endif\n\nuint64_t\nsummarize_ts(const char *label, uint64_t ts[], unsigned count)\n{\n  uint64_t min = ts[0], max = ts[0], total = 0;\n  for (unsigned i = 0; i < count; ++i) {\n    if (ts[i] < min)\n      min = ts[i];\n    if (ts[i] > max)\n      max = ts[i];\n    total += ts[i];\n  }\n  printf(\"%lu %s skew\\n\", max - min, label);\n  return total\/count;\n}\n\ntemplate<class T>\nT\nsum(T v[], unsigned count)\n{\n  T res{};\n  for (unsigned i = 0; i < count; ++i)\n    res += v[i];\n  return res;\n}\n\nvoid\nusage(const char *argv0)\n{\n  fprintf(stderr, \"Usage: %s [options] nstat nlink\\n\", argv0);\n  fprintf(stderr, \"  -e perfevent  Measure perfevent\\n\");\n  fprintf(stderr, \"  -l true       Get st_nlink\\n\");\n  fprintf(stderr, \"     false      Omit st_nlink\\n\");\n  exit(2);\n}\n\nint\nmain(int argc, char **argv)\n{\n  char *pmc = nullptr;\n  omit_nlink = false;\n\n  int opt;\n  while ((opt = getopt(argc, argv, \"e:l:\")) != -1) {\n    switch (opt) {\n    case 'e':\n      pmc = optarg;\n      break;\n    case 'l':\n      if (strcmp(optarg, \"true\") == 0)\n        omit_nlink = false;\n      else if (strcmp(optarg, \"false\") == 0)\n        omit_nlink = true;\n      else\n        usage(argv[0]);\n      break;\n    default:\n      usage(argv[0]);\n    }\n  }\n\n  if (argc - optind != 2)\n    usage(argv[0]);\n\n  int nstats = atoi(argv[optind]);\n  int nlinks = atoi(argv[optind+1]);\n#if !defined(XV6_USER)\n  if (omit_nlink)\n    die(\"-l false not supported on Linux\");\n  if (pmc)\n    die(\"-e not supported on Linux\");\n#endif\n\n  printf(\"# --cores=%d --duration=%ds --st_nlink=%s\", nstats+nlinks, duration,\n         omit_nlink ? \"false\" : \"true\");\n  printf(\" --stats=%d --links=%d\\n\", nstats, nlinks);\n\n#if defined(XV6_USER)\n  \/\/ Configure PMC\n  if (pmc) {\n    try {\n      perf_start(pmcdb_parse_selector(pmc), 0);\n    } catch (std::invalid_argument &e) {\n      die(\"%s\", e.what());\n    }\n    record_pmc = true;\n  }\n#endif\n\n  \/\/ Set up file system\n  mkdir(\"linkbench-d\", 0777);\n  chdir(\"linkbench-d\");\n  mkdir(\"0\", 0777);\n  filefd = openat(AT_FDCWD, \"0\/file\", O_CREAT|O_RDWR, 0666);\n  if (filefd < 0)\n    die(\"openat failed\");\n\n  pthread_barrier_init(&bar, 0, nstats + nlinks + 2);\n  pthread_barrier_init(&bar2, 0, nstats + nlinks + 2);\n\n  \/\/ Run benchmark\n  pthread_t timer;\n  pthread_create(&timer, NULL, timer_thread, NULL);\n\n  pthread_t *threads = (pthread_t*)malloc(sizeof(*threads) * (nstats + nlinks));\n  for (uintptr_t i = 0; i < nstats + nlinks; ++i)\n    pthread_create(&threads[i], NULL,\n                   i < nstats ? do_stat : do_link, (void*)i);\n\n  pthread_barrier_wait(&bar);\n\n#if MTRACE\n  mtenable_type(mtrace_record_ascope, \"xv6-linkbench\");\n#endif\n\n  pthread_barrier_wait(&bar2);\n\n  \/\/ Wait\n  xpthread_join(timer);\n  for (int i = 0; i < nstats + nlinks; ++i)\n    xpthread_join(threads[i]);\n\n#if MTRACE\n  mtdisable(\"xv6-linkbench\");\n#endif\n\n#if defined(XV6_USER)\n  if (record_pmc)\n    perf_stop();\n#endif\n\n  \/\/ Summarize\n  uint64_t start_tsc_avg = summarize_ts(\"start cycles\", start_tsc, nstats + nlinks);\n  uint64_t stop_tsc_avg = summarize_ts(\"stop cycles\", stop_tsc, nstats + nlinks);\n  printf(\"%lu cycles\\n\", stop_tsc_avg - start_tsc_avg);\n\n  uint64_t start_usec_avg = summarize_ts(\"start usec\", start_usec, nstats + nlinks);\n  uint64_t stop_usec_avg = summarize_ts(\"stop usec\", stop_usec, nstats + nlinks);\n  uint64_t usec = stop_usec_avg - start_usec_avg;\n  printf(\"%f secs\\n\", (double)usec \/ 1e6);\n\n  uint64_t stats, links;\n  stats = sum(count, nstats), links = sum(count + nstats, nlinks);\n  printf(\"%lu stats\\n\", stats);\n  if (stats) {\n    printf(\"%lu cycles\/stat\\n\", sum(tsc_stat, nstats + nlinks) \/ stats);\n    printf(\"%lu stats\/sec\\n\", stats * 1000000 \/ usec);\n    if (record_pmc) {\n      printf(\"%lu %s\\n\", sum(pmc_stat, nstats + nlinks), pmc);\n      printf(\"%f %s\/stat\\n\", sum(pmc_stat, nstats + nlinks) \/ (double)stats, pmc);\n    }\n  }\n  printf(\"%lu links\\n\", links);\n  if (links) {\n    printf(\"%lu cycles\/link\\n\", sum(tsc_link, nstats + nlinks) \/ links);\n    printf(\"%lu links\/sec\\n\", links * 1000000 \/ usec);\n  }\n\n  \/\/ printf(\"stat tsc histogram: \");\n  \/\/ auto hist = sum(tsc_hist, nstats + nlinks);\n  \/\/ hist.print_stats();\n  \/\/ hist.print_bars();\n  \/\/ printf(\"\\n\");\n  \/\/ hist.print();\n\n  printf(\"\\n\");\n}\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 \"flutter\/benchmarking\/benchmarking.h\"\n#include \"flutter\/display_list\/display_list_test_utils.h\"\n\nnamespace flutter {\nnamespace {\n\nstatic std::vector<testing::DisplayListInvocationGroup> allRenderingOps =\n    testing::CreateAllRenderingOps();\n\nenum class DisplayListBuilderBenchmarkType {\n  kDefault,\n  kBounds,\n  kRtree,\n  kBoundsAndRtree,\n};\n\nstatic void InvokeAllRenderingOps(DisplayListBuilder& builder) {\n  for (auto& group : allRenderingOps) {\n    for (size_t i = 0; i < group.variants.size(); i++) {\n      auto& invocation = group.variants[i];\n      invocation.Invoke(builder);\n    }\n  }\n}\n\nstatic void Complete(DisplayListBuilder& builder,\n                     DisplayListBuilderBenchmarkType type) {\n  auto display_list = builder.Build();\n  switch (type) {\n    case DisplayListBuilderBenchmarkType::kBounds:\n      display_list->bounds();\n      break;\n    case DisplayListBuilderBenchmarkType::kRtree:\n      display_list->rtree();\n      break;\n    case DisplayListBuilderBenchmarkType::kBoundsAndRtree:\n      display_list->bounds();\n      display_list->rtree();\n      break;\n    case DisplayListBuilderBenchmarkType::kDefault:\n      break;\n  }\n}\n\n}  \/\/ namespace\n\nstatic void BM_DisplayListBuilderDefault(benchmark::State& state,\n                                         DisplayListBuilderBenchmarkType type) {\n  while (state.KeepRunning()) {\n    DisplayListBuilder builder;\n    InvokeAllRenderingOps(builder);\n    Complete(builder, type);\n  }\n}\n\nstatic void BM_DisplayListBuilderWithScaleAndTranslate(\n    benchmark::State& state,\n    DisplayListBuilderBenchmarkType type) {\n  while (state.KeepRunning()) {\n    DisplayListBuilder builder;\n    builder.scale(3.5, 3.5);\n    builder.translate(10.3, 6.9);\n    InvokeAllRenderingOps(builder);\n    Complete(builder, type);\n  }\n}\n\nstatic void BM_DisplayListBuilderWithPerspective(\n    benchmark::State& state,\n    DisplayListBuilderBenchmarkType type) {\n  while (state.KeepRunning()) {\n    DisplayListBuilder builder;\n    builder.transformFullPerspective(0, 1, 0, 12, 1, 0, 0, 33, 3, 2, 5, 29, 0,\n                                     0, 0, 12);\n    InvokeAllRenderingOps(builder);\n    Complete(builder, type);\n  }\n}\n\nstatic void BM_DisplayListBuilderWithClipRect(\n    benchmark::State& state,\n    DisplayListBuilderBenchmarkType type) {\n  SkRect clip_bounds = SkRect::MakeLTRB(6.5, 7.3, 90.2, 85.7);\n  while (state.KeepRunning()) {\n    DisplayListBuilder builder;\n    builder.clipRect(clip_bounds, SkClipOp::kIntersect, true);\n    InvokeAllRenderingOps(builder);\n    Complete(builder, type);\n  }\n}\n\nstatic void BM_DisplayListBuilderWithSaveLayer(\n    benchmark::State& state,\n    DisplayListBuilderBenchmarkType type) {\n  while (state.KeepRunning()) {\n    DisplayListBuilder builder;\n    for (auto& group : allRenderingOps) {\n      for (size_t i = 0; i < group.variants.size(); i++) {\n        auto& invocation = group.variants[i];\n        builder.saveLayer(nullptr, false);\n        invocation.Invoke(builder);\n        builder.restore();\n      }\n    }\n    Complete(builder, type);\n  }\n}\n\nstatic void BM_DisplayListBuilderWithSaveLayerAndImageFilter(\n    benchmark::State& state,\n    DisplayListBuilderBenchmarkType type) {\n  DlPaint layer_paint;\n  layer_paint.setImageFilter(&testing::kTestBlurImageFilter1);\n  SkRect layer_bounds = SkRect::MakeLTRB(6.5, 7.3, 35.2, 42.7);\n  while (state.KeepRunning()) {\n    DisplayListBuilder builder;\n    for (auto& group : allRenderingOps) {\n      for (size_t i = 0; i < group.variants.size(); i++) {\n        auto& invocation = group.variants[i];\n        builder.saveLayer(&layer_bounds, &layer_paint);\n        invocation.Invoke(builder);\n        builder.restore();\n      }\n    }\n    Complete(builder, type);\n  }\n}\n\nBENCHMARK_CAPTURE(BM_DisplayListBuilderDefault,\n                  kDefault,\n                  DisplayListBuilderBenchmarkType::kDefault)\n    ->Unit(benchmark::kMillisecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderDefault,\n                  kBounds,\n                  DisplayListBuilderBenchmarkType::kBounds)\n    ->Unit(benchmark::kMillisecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderDefault,\n                  kRtree,\n                  DisplayListBuilderBenchmarkType::kRtree)\n    ->Unit(benchmark::kMillisecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderDefault,\n                  kBoundsAndRtree,\n                  DisplayListBuilderBenchmarkType::kBoundsAndRtree)\n    ->Unit(benchmark::kMillisecond);\n\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithScaleAndTranslate,\n                  kDefault,\n                  DisplayListBuilderBenchmarkType::kDefault)\n    ->Unit(benchmark::kMillisecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithScaleAndTranslate,\n                  kBounds,\n                  DisplayListBuilderBenchmarkType::kBounds)\n    ->Unit(benchmark::kMillisecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithScaleAndTranslate,\n                  kRtree,\n                  DisplayListBuilderBenchmarkType::kRtree)\n    ->Unit(benchmark::kMillisecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithScaleAndTranslate,\n                  kBoundsAndRtree,\n                  DisplayListBuilderBenchmarkType::kBoundsAndRtree)\n    ->Unit(benchmark::kMillisecond);\n\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithPerspective,\n                  kDefault,\n                  DisplayListBuilderBenchmarkType::kDefault)\n    ->Unit(benchmark::kMillisecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithPerspective,\n                  kBounds,\n                  DisplayListBuilderBenchmarkType::kBounds)\n    ->Unit(benchmark::kMillisecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithPerspective,\n                  kRtree,\n                  DisplayListBuilderBenchmarkType::kRtree)\n    ->Unit(benchmark::kMillisecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithPerspective,\n                  kBoundsAndRtree,\n                  DisplayListBuilderBenchmarkType::kBoundsAndRtree)\n    ->Unit(benchmark::kMillisecond);\n\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithClipRect,\n                  kDefault,\n                  DisplayListBuilderBenchmarkType::kDefault)\n    ->Unit(benchmark::kMillisecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithClipRect,\n                  kBounds,\n                  DisplayListBuilderBenchmarkType::kBounds)\n    ->Unit(benchmark::kMillisecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithClipRect,\n                  kRtree,\n                  DisplayListBuilderBenchmarkType::kRtree)\n    ->Unit(benchmark::kMillisecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithClipRect,\n                  kBoundsAndRtree,\n                  DisplayListBuilderBenchmarkType::kBoundsAndRtree)\n    ->Unit(benchmark::kMillisecond);\n\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithSaveLayer,\n                  kDefault,\n                  DisplayListBuilderBenchmarkType::kDefault)\n    ->Unit(benchmark::kMillisecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithSaveLayer,\n                  kBounds,\n                  DisplayListBuilderBenchmarkType::kBounds)\n    ->Unit(benchmark::kMillisecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithSaveLayer,\n                  kRtree,\n                  DisplayListBuilderBenchmarkType::kRtree)\n    ->Unit(benchmark::kMillisecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithSaveLayer,\n                  kBoundsAndRtree,\n                  DisplayListBuilderBenchmarkType::kBoundsAndRtree)\n    ->Unit(benchmark::kMillisecond);\n\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithSaveLayerAndImageFilter,\n                  kDefault,\n                  DisplayListBuilderBenchmarkType::kDefault)\n    ->Unit(benchmark::kMillisecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithSaveLayerAndImageFilter,\n                  kBounds,\n                  DisplayListBuilderBenchmarkType::kBounds)\n    ->Unit(benchmark::kMillisecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithSaveLayerAndImageFilter,\n                  kRtree,\n                  DisplayListBuilderBenchmarkType::kRtree)\n    ->Unit(benchmark::kMillisecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithSaveLayerAndImageFilter,\n                  kBoundsAndRtree,\n                  DisplayListBuilderBenchmarkType::kBoundsAndRtree)\n    ->Unit(benchmark::kMillisecond);\n\n}  \/\/ namespace flutter\n<commit_msg>Change the time unit of 'DisplayListBuilderBenchmarks' to 'kMicrosecond' (#35228)<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 \"flutter\/benchmarking\/benchmarking.h\"\n#include \"flutter\/display_list\/display_list_test_utils.h\"\n\nnamespace flutter {\nnamespace {\n\nstatic std::vector<testing::DisplayListInvocationGroup> allRenderingOps =\n    testing::CreateAllRenderingOps();\n\nenum class DisplayListBuilderBenchmarkType {\n  kDefault,\n  kBounds,\n  kRtree,\n  kBoundsAndRtree,\n};\n\nstatic void InvokeAllRenderingOps(DisplayListBuilder& builder) {\n  for (auto& group : allRenderingOps) {\n    for (size_t i = 0; i < group.variants.size(); i++) {\n      auto& invocation = group.variants[i];\n      invocation.Invoke(builder);\n    }\n  }\n}\n\nstatic void Complete(DisplayListBuilder& builder,\n                     DisplayListBuilderBenchmarkType type) {\n  auto display_list = builder.Build();\n  switch (type) {\n    case DisplayListBuilderBenchmarkType::kBounds:\n      display_list->bounds();\n      break;\n    case DisplayListBuilderBenchmarkType::kRtree:\n      display_list->rtree();\n      break;\n    case DisplayListBuilderBenchmarkType::kBoundsAndRtree:\n      display_list->bounds();\n      display_list->rtree();\n      break;\n    case DisplayListBuilderBenchmarkType::kDefault:\n      break;\n  }\n}\n\n}  \/\/ namespace\n\nstatic void BM_DisplayListBuilderDefault(benchmark::State& state,\n                                         DisplayListBuilderBenchmarkType type) {\n  while (state.KeepRunning()) {\n    DisplayListBuilder builder;\n    InvokeAllRenderingOps(builder);\n    Complete(builder, type);\n  }\n}\n\nstatic void BM_DisplayListBuilderWithScaleAndTranslate(\n    benchmark::State& state,\n    DisplayListBuilderBenchmarkType type) {\n  while (state.KeepRunning()) {\n    DisplayListBuilder builder;\n    builder.scale(3.5, 3.5);\n    builder.translate(10.3, 6.9);\n    InvokeAllRenderingOps(builder);\n    Complete(builder, type);\n  }\n}\n\nstatic void BM_DisplayListBuilderWithPerspective(\n    benchmark::State& state,\n    DisplayListBuilderBenchmarkType type) {\n  while (state.KeepRunning()) {\n    DisplayListBuilder builder;\n    builder.transformFullPerspective(0, 1, 0, 12, 1, 0, 0, 33, 3, 2, 5, 29, 0,\n                                     0, 0, 12);\n    InvokeAllRenderingOps(builder);\n    Complete(builder, type);\n  }\n}\n\nstatic void BM_DisplayListBuilderWithClipRect(\n    benchmark::State& state,\n    DisplayListBuilderBenchmarkType type) {\n  SkRect clip_bounds = SkRect::MakeLTRB(6.5, 7.3, 90.2, 85.7);\n  while (state.KeepRunning()) {\n    DisplayListBuilder builder;\n    builder.clipRect(clip_bounds, SkClipOp::kIntersect, true);\n    InvokeAllRenderingOps(builder);\n    Complete(builder, type);\n  }\n}\n\nstatic void BM_DisplayListBuilderWithSaveLayer(\n    benchmark::State& state,\n    DisplayListBuilderBenchmarkType type) {\n  while (state.KeepRunning()) {\n    DisplayListBuilder builder;\n    for (auto& group : allRenderingOps) {\n      for (size_t i = 0; i < group.variants.size(); i++) {\n        auto& invocation = group.variants[i];\n        builder.saveLayer(nullptr, false);\n        invocation.Invoke(builder);\n        builder.restore();\n      }\n    }\n    Complete(builder, type);\n  }\n}\n\nstatic void BM_DisplayListBuilderWithSaveLayerAndImageFilter(\n    benchmark::State& state,\n    DisplayListBuilderBenchmarkType type) {\n  DlPaint layer_paint;\n  layer_paint.setImageFilter(&testing::kTestBlurImageFilter1);\n  SkRect layer_bounds = SkRect::MakeLTRB(6.5, 7.3, 35.2, 42.7);\n  while (state.KeepRunning()) {\n    DisplayListBuilder builder;\n    for (auto& group : allRenderingOps) {\n      for (size_t i = 0; i < group.variants.size(); i++) {\n        auto& invocation = group.variants[i];\n        builder.saveLayer(&layer_bounds, &layer_paint);\n        invocation.Invoke(builder);\n        builder.restore();\n      }\n    }\n    Complete(builder, type);\n  }\n}\n\nBENCHMARK_CAPTURE(BM_DisplayListBuilderDefault,\n                  kDefault,\n                  DisplayListBuilderBenchmarkType::kDefault)\n    ->Unit(benchmark::kMicrosecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderDefault,\n                  kBounds,\n                  DisplayListBuilderBenchmarkType::kBounds)\n    ->Unit(benchmark::kMicrosecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderDefault,\n                  kRtree,\n                  DisplayListBuilderBenchmarkType::kRtree)\n    ->Unit(benchmark::kMicrosecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderDefault,\n                  kBoundsAndRtree,\n                  DisplayListBuilderBenchmarkType::kBoundsAndRtree)\n    ->Unit(benchmark::kMicrosecond);\n\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithScaleAndTranslate,\n                  kDefault,\n                  DisplayListBuilderBenchmarkType::kDefault)\n    ->Unit(benchmark::kMicrosecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithScaleAndTranslate,\n                  kBounds,\n                  DisplayListBuilderBenchmarkType::kBounds)\n    ->Unit(benchmark::kMicrosecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithScaleAndTranslate,\n                  kRtree,\n                  DisplayListBuilderBenchmarkType::kRtree)\n    ->Unit(benchmark::kMicrosecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithScaleAndTranslate,\n                  kBoundsAndRtree,\n                  DisplayListBuilderBenchmarkType::kBoundsAndRtree)\n    ->Unit(benchmark::kMicrosecond);\n\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithPerspective,\n                  kDefault,\n                  DisplayListBuilderBenchmarkType::kDefault)\n    ->Unit(benchmark::kMicrosecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithPerspective,\n                  kBounds,\n                  DisplayListBuilderBenchmarkType::kBounds)\n    ->Unit(benchmark::kMicrosecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithPerspective,\n                  kRtree,\n                  DisplayListBuilderBenchmarkType::kRtree)\n    ->Unit(benchmark::kMicrosecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithPerspective,\n                  kBoundsAndRtree,\n                  DisplayListBuilderBenchmarkType::kBoundsAndRtree)\n    ->Unit(benchmark::kMicrosecond);\n\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithClipRect,\n                  kDefault,\n                  DisplayListBuilderBenchmarkType::kDefault)\n    ->Unit(benchmark::kMicrosecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithClipRect,\n                  kBounds,\n                  DisplayListBuilderBenchmarkType::kBounds)\n    ->Unit(benchmark::kMicrosecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithClipRect,\n                  kRtree,\n                  DisplayListBuilderBenchmarkType::kRtree)\n    ->Unit(benchmark::kMicrosecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithClipRect,\n                  kBoundsAndRtree,\n                  DisplayListBuilderBenchmarkType::kBoundsAndRtree)\n    ->Unit(benchmark::kMicrosecond);\n\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithSaveLayer,\n                  kDefault,\n                  DisplayListBuilderBenchmarkType::kDefault)\n    ->Unit(benchmark::kMicrosecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithSaveLayer,\n                  kBounds,\n                  DisplayListBuilderBenchmarkType::kBounds)\n    ->Unit(benchmark::kMicrosecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithSaveLayer,\n                  kRtree,\n                  DisplayListBuilderBenchmarkType::kRtree)\n    ->Unit(benchmark::kMicrosecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithSaveLayer,\n                  kBoundsAndRtree,\n                  DisplayListBuilderBenchmarkType::kBoundsAndRtree)\n    ->Unit(benchmark::kMicrosecond);\n\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithSaveLayerAndImageFilter,\n                  kDefault,\n                  DisplayListBuilderBenchmarkType::kDefault)\n    ->Unit(benchmark::kMicrosecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithSaveLayerAndImageFilter,\n                  kBounds,\n                  DisplayListBuilderBenchmarkType::kBounds)\n    ->Unit(benchmark::kMicrosecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithSaveLayerAndImageFilter,\n                  kRtree,\n                  DisplayListBuilderBenchmarkType::kRtree)\n    ->Unit(benchmark::kMicrosecond);\nBENCHMARK_CAPTURE(BM_DisplayListBuilderWithSaveLayerAndImageFilter,\n                  kBoundsAndRtree,\n                  DisplayListBuilderBenchmarkType::kBoundsAndRtree)\n    ->Unit(benchmark::kMicrosecond);\n\n}  \/\/ namespace flutter\n<|endoftext|>"}
{"text":"<commit_before>#ifndef ecmdSharedUtils_h\n#define ecmdSharedUtils_h\n\/\/ Copyright **********************************************************\n\/\/\n\/\/ File ecmdSharedUtils.H\n\/\/\n\/\/ IBM Confidential\n\/\/ OCO Source Materials\n\/\/ 9400 Licensed Internal Code\n\/\/ (C) COPYRIGHT IBM CORP. 1996\n\/\/\n\/\/ The source code for this program is not published or otherwise\n\/\/ divested of its trade secrets, irrespective of what has been\n\/\/ deposited with the U.S. Copyright Office.\n\/\/\n\/\/ End Copyright ******************************************************\n\n\/* $Header$ *\/\n\n\/**\n * @file ecmdSharedUtils.H\n * @brief Useful functions for use throughout the ecmd C API and Plugin\n *\n *\/\n\n\n\/\/--------------------------------------------------------------------\n\/\/ Includes\n\/\/--------------------------------------------------------------------\n#include <string>\n#include <vector>\n#include <inttypes.h>\n\n#include <ecmdDefines.H>\n#include <ecmdDataBuffer.H>\n#include <ecmdStructs.H>\n\n\/\/--------------------------------------------------------------------\n\/\/ ENUM Definitions\n\/\/--------------------------------------------------------------------\n\/**\n @brief Used by ecmdSetTargetDepth\n*\/\ntypedef enum {\n  ECMD_DEPTH_CAGE = 0,\n  ECMD_DEPTH_NODE,\n  ECMD_DEPTH_SLOT,\n  ECMD_DEPTH_CHIP,\n  ECMD_DEPTH_CORE,  \/\/ Re-added on 9\/27\/07 by JTA.  We need both CORE and CHIPUNIT for ecmdSetTargetDepth\n  ECMD_DEPTH_CHIPUNIT,\n  ECMD_DEPTH_THREAD\n} ecmdTargetDepth_t;\n\n\/\/--------------------------------------------------------------------\n\/\/  Forward References\n\/\/--------------------------------------------------------------------\n\/* The following two functions are overridden in ecmdClientPerlapi.H to remove io_argc *\/\n#ifndef ECMD_PERLAPI\n\n\/** @name Command Line Parsing Functions *\/\n\/\/@{\n\n\/**\n * @brief Iterates over argv, looking for given option string, removes it if found\n * @retval 1 if option found, 0 otherwise\n * @param io_argc Pointer to number of elements in io_argv array\n * @param io_argv Array of strings passed in from command line\n * @param i_option Option to look for\n * @see ecmdParseOptionWithArgs\n\n *\/\nbool ecmdParseOption (int * io_argc, char ** io_argv[], const char * i_option);\n\n\/**\n * @brief Iterates over argv, looking for given option string, removes it if found\n * @retval Value of option arg if found, NULL otherwise\n * @param io_argc Pointer to number of elements in io_argv array\n * @param io_argv Array of strings passed in from command line\n * @param i_option Option to look for\n * @see ecmdParseOptionWithArgs\n\n *\/\nchar * ecmdParseOptionWithArgs(int * io_argc, char ** io_argv[], const char * i_option);\n\n\/\/@}\n#endif\n\n\/**\n * @brief Breaks the string line into tokens based on all chars in seperators\n * @param line String to tokenize\n * @param seperators String of characters to use as seperators\n * @param tokens Vector of strings that contain all the tokens\n*\/\nvoid ecmdParseTokens(std::string line, const char* seperators, std::vector<std::string> & tokens);\n\n\/** @name Gen Functions *\/\n\/\/@{\n\n\/**\n * @brief Turns the data in the buffer into ebcdic text\n * @param i_data Data to convert\n * @param start Bit to start at\n * @param bitLen Number of bits\n*\/\nstd::string ecmdGenEbcdic(ecmdDataBuffer &i_data, int start, int bitLen);\n\n\n\/**\n * @brief Default function for converting hex strings to unsigned int arrays\n * @retval First element of the parsed data, or 0xFFFFFFFF if error\n * @param o_numPtr The array that stores the data parsed from the input string\n * @param i_hexChars input string of hex data- alignment stuff handled by Left and Right functions\n * @param startPos\n * @see ecmdGenB32FromHexRight\n * @see ecmdGenB32FromHexLeft\n *\/\nuint32_t ecmdGenB32FromHex(uint32_t * o_numPtr, const char * i_hexChars, int startPos);\n\n\/**\n * @brief Convert a string of left-aligned Hex chars into a left-aligned unsigned int array\n * @retval The first element of the parsed string data, or 0xFFFFFFFF if error\n * @param o_numPtr The array that stores the data parsed from the input string\n * @param i_hexChars A string of hex characters\n * @see ecmdGenB32FromHexRight\n * @see ecmdGenB32FromHex\n *\/\nuint32_t ecmdGenB32FromHexLeft(uint32_t * o_numPtr, const char * i_hexChars);\n\n\/**\n * @brief Convert a string of right-aligned Hex chars into a left-aligned unsigned int array\n * @retval The first element of the parsed string data, or 0xFFFFFFFF if error\n * @param o_numPtr The array that stores the data parsed from the input string\n * @param i_hexChars A string of hex characters\n * @param i_expectBits The number of defined bits in the o_numPtr array returned\n * @see ecmdGenB32FromHex\n * @see ecmdGenB32FromHexLeft\n *\/\nuint32_t ecmdGenB32FromHexRight(uint32_t * o_numPtr, const char * i_hexChars, int i_expectBits = 0);\n\n\/\/@}\n\n\n\/**\n * @brief Converts strings to unsigned int values. The input format is 0xABCDEF.\n * @param i_str String in hexadecimal notation\n * @date Tue Sep 21 13:22:33 2004\n * @retval uint32_t value of converted input string\n *\/\nuint32_t ecmdHexToUInt32(const char* i_str);\n\n\/**\n * @brief Calculates a 32bit hash value for a given string.\n *\n * LICENSE:\n * By Bob Jenkins, 1996.  bob_jenkins@burtleburtle.net.  You may use this\n * code any way you wish, private, educational, or commercial.  It's free.\n * See http:\/\/burtleburtle.net\/bob\/hash\/doobs.html\n *\n * @param i_str String to convert to hash\n * @param i_c Start value for hash.\n * @retval Hash value\n *\/\nuint32_t ecmdHashString32(const char *i_str, uint32_t i_c);\n\n\/**\n *  @brief Sets State Fields of Chip Target based on depth\n *  @param io_target an ecmdChipTarget struct representing a specific eCmd target\n *  @param i_depth an ecmdTargetDepth_t enum representing depth to be set valid\n *  @retval ECMD_SUCCESS if setting successful\n *  @retval ECMD_INVALID_ARGS if unsuccessful in finding a matching depth\n *  @post State Fields of Chip Target are set to either ECMD_TARGET_FIELD VALID or ECMD_TARGET_FIELD_UNUSED\n\n TARGET DEPTH  : Input To This Function\n TARGET STATES : Gets Set By This Function\n\n *\/\nuint32_t ecmdSetTargetDepth(ecmdChipTarget & io_target, ecmdTargetDepth_t i_depth);\n\n\/**\n *  @brief Sets Fields of ecmdMemoryEntry_t from the DCard data in the file\n *  @param i_filename file to read the d-card data from\n *  @param o_data list to be updated with the d-card data\n *  @retval ECMD_SUCCESS if setting successful\n *  @retval ECMD_INVALID_ARGS if unsuccessful in finding a matching depth\n *\/\nuint32_t ecmdReadDcard(const char *i_filename, std::list<ecmdMemoryEntry> &o_data);\n\n\/**\n @brief Returns a formatted string containing the data in the given ecmdChipTarget\n @return String with formatted target data\n @param i_target ecmdChipTarget containing data to format into string\n @param i_displayMode Mode to format data\n\n TARGET DEPTH  : cage, node, slot, pos, chipUnit\/core, thread\n TARGET STATES : Must be Initialized\n *\/\nstd::string ecmdWriteTarget(ecmdChipTarget & i_target, ecmdTargetDisplayMode_t i_displayMode = ECMD_DISPLAY_TARGET_PLUGIN_MODE);\n\n\/**\n @brief Called by the plugin to set the preferred outputmode of @see ecmdWriteTarget\n @param i_displayMode The display mode returned by the plugin\n*\/\nvoid ecmdSetTargetDisplayMode(ecmdTargetDisplayMode_t i_displayMode);\n\n\/**\n @brief Reads in a target string, returns a filled in target\n @return String with formatted target data\n @param i_targetStr String in a \"k0:nall:s0:pu:p0\" format to be turned into a target\n @param o_target ecmdChipTarget initialized based upon i_targetStr\n *\/\nuint32_t ecmdReadTarget(std::string i_targetStr, ecmdChipTarget & o_target);\n\n\/**\n @brief Parse the chip field and look for the chipUnit\n @param i_chipField The chip field from the command line to be parsed\n @param o_chipType The chip type from the field\n @param o_chipUnitType The chipUnit type from the field (if one was found)\n @retval ECMD_SUCCESS if successful\n @retval nonzero if failure\n*\/\nuint32_t ecmdParseChipField(std::string i_chipField, std::string &o_chipType, std::string &o_chipUnitType);\n\n#endif \/* ecmdSharedUtils_h *\/\n\n\/\/ Change Log *********************************************************\n\/\/\n\/\/  Flag Reason   Vers Date     Coder  Description\n\/\/  ---- -------- ---- -------- -----  -------------------------------\n\/\/                              cengel Initial Creation\n\/\/                              kloss  added hash functions: hashString32, hexToUInt32\n\/\/                              baiocchi Added ecmdSetTargetDepth()\n\/\/ End Change Log *****************************************************\n\nvoid setTestValue(uint32_t testNum);\n<commit_msg>STGC00348817 - fix for ecmdWriteTarget<commit_after>#ifndef ecmdSharedUtils_h\n#define ecmdSharedUtils_h\n\/\/ Copyright **********************************************************\n\/\/\n\/\/ File ecmdSharedUtils.H\n\/\/\n\/\/ IBM Confidential\n\/\/ OCO Source Materials\n\/\/ 9400 Licensed Internal Code\n\/\/ (C) COPYRIGHT IBM CORP. 1996\n\/\/\n\/\/ The source code for this program is not published or otherwise\n\/\/ divested of its trade secrets, irrespective of what has been\n\/\/ deposited with the U.S. Copyright Office.\n\/\/\n\/\/ End Copyright ******************************************************\n\n\/* $Header$ *\/\n\n\/**\n * @file ecmdSharedUtils.H\n * @brief Useful functions for use throughout the ecmd C API and Plugin\n *\n *\/\n\n\n\/\/--------------------------------------------------------------------\n\/\/ Includes\n\/\/--------------------------------------------------------------------\n#include <string>\n#include <vector>\n#include <inttypes.h>\n\n#include <ecmdDefines.H>\n#include <ecmdDataBuffer.H>\n#include <ecmdStructs.H>\n\n\/\/--------------------------------------------------------------------\n\/\/ ENUM Definitions\n\/\/--------------------------------------------------------------------\n\/**\n @brief Used by ecmdSetTargetDepth\n*\/\ntypedef enum {\n  ECMD_DEPTH_CAGE = 0,\n  ECMD_DEPTH_NODE,\n  ECMD_DEPTH_SLOT,\n  ECMD_DEPTH_CHIP,\n  ECMD_DEPTH_CORE,  \/\/ Re-added on 9\/27\/07 by JTA.  We need both CORE and CHIPUNIT for ecmdSetTargetDepth\n  ECMD_DEPTH_CHIPUNIT,\n  ECMD_DEPTH_THREAD\n} ecmdTargetDepth_t;\n\n\/\/--------------------------------------------------------------------\n\/\/  Forward References\n\/\/--------------------------------------------------------------------\n\/* The following two functions are overridden in ecmdClientPerlapi.H to remove io_argc *\/\n#ifndef ECMD_PERLAPI\n\n\/** @name Command Line Parsing Functions *\/\n\/\/@{\n\n\/**\n * @brief Iterates over argv, looking for given option string, removes it if found\n * @retval 1 if option found, 0 otherwise\n * @param io_argc Pointer to number of elements in io_argv array\n * @param io_argv Array of strings passed in from command line\n * @param i_option Option to look for\n * @see ecmdParseOptionWithArgs\n\n *\/\nbool ecmdParseOption (int * io_argc, char ** io_argv[], const char * i_option);\n\n\/**\n * @brief Iterates over argv, looking for given option string, removes it if found\n * @retval Value of option arg if found, NULL otherwise\n * @param io_argc Pointer to number of elements in io_argv array\n * @param io_argv Array of strings passed in from command line\n * @param i_option Option to look for\n * @see ecmdParseOptionWithArgs\n\n *\/\nchar * ecmdParseOptionWithArgs(int * io_argc, char ** io_argv[], const char * i_option);\n\n\/\/@}\n#endif\n\n\/**\n * @brief Breaks the string line into tokens based on all chars in seperators\n * @param line String to tokenize\n * @param seperators String of characters to use as seperators\n * @param tokens Vector of strings that contain all the tokens\n*\/\nvoid ecmdParseTokens(std::string line, const char* seperators, std::vector<std::string> & tokens);\n\n\/** @name Gen Functions *\/\n\/\/@{\n\n\/**\n * @brief Turns the data in the buffer into ebcdic text\n * @param i_data Data to convert\n * @param start Bit to start at\n * @param bitLen Number of bits\n*\/\nstd::string ecmdGenEbcdic(ecmdDataBuffer &i_data, int start, int bitLen);\n\n\n\/**\n * @brief Default function for converting hex strings to unsigned int arrays\n * @retval First element of the parsed data, or 0xFFFFFFFF if error\n * @param o_numPtr The array that stores the data parsed from the input string\n * @param i_hexChars input string of hex data- alignment stuff handled by Left and Right functions\n * @param startPos\n * @see ecmdGenB32FromHexRight\n * @see ecmdGenB32FromHexLeft\n *\/\nuint32_t ecmdGenB32FromHex(uint32_t * o_numPtr, const char * i_hexChars, int startPos);\n\n\/**\n * @brief Convert a string of left-aligned Hex chars into a left-aligned unsigned int array\n * @retval The first element of the parsed string data, or 0xFFFFFFFF if error\n * @param o_numPtr The array that stores the data parsed from the input string\n * @param i_hexChars A string of hex characters\n * @see ecmdGenB32FromHexRight\n * @see ecmdGenB32FromHex\n *\/\nuint32_t ecmdGenB32FromHexLeft(uint32_t * o_numPtr, const char * i_hexChars);\n\n\/**\n * @brief Convert a string of right-aligned Hex chars into a left-aligned unsigned int array\n * @retval The first element of the parsed string data, or 0xFFFFFFFF if error\n * @param o_numPtr The array that stores the data parsed from the input string\n * @param i_hexChars A string of hex characters\n * @param i_expectBits The number of defined bits in the o_numPtr array returned\n * @see ecmdGenB32FromHex\n * @see ecmdGenB32FromHexLeft\n *\/\nuint32_t ecmdGenB32FromHexRight(uint32_t * o_numPtr, const char * i_hexChars, int i_expectBits = 0);\n\n\/\/@}\n\n\n\/**\n * @brief Converts strings to unsigned int values. The input format is 0xABCDEF.\n * @param i_str String in hexadecimal notation\n * @date Tue Sep 21 13:22:33 2004\n * @retval uint32_t value of converted input string\n *\/\nuint32_t ecmdHexToUInt32(const char* i_str);\n\n\/**\n * @brief Calculates a 32bit hash value for a given string.\n *\n * LICENSE:\n * By Bob Jenkins, 1996.  bob_jenkins@burtleburtle.net.  You may use this\n * code any way you wish, private, educational, or commercial.  It's free.\n * See http:\/\/burtleburtle.net\/bob\/hash\/doobs.html\n *\n * @param i_str String to convert to hash\n * @param i_c Start value for hash.\n * @retval Hash value\n *\/\nuint32_t ecmdHashString32(const char *i_str, uint32_t i_c);\n\n\/**\n *  @brief Sets State Fields of Chip Target based on depth\n *  @param io_target an ecmdChipTarget struct representing a specific eCmd target\n *  @param i_depth an ecmdTargetDepth_t enum representing depth to be set valid\n *  @retval ECMD_SUCCESS if setting successful\n *  @retval ECMD_INVALID_ARGS if unsuccessful in finding a matching depth\n *  @post State Fields of Chip Target are set to either ECMD_TARGET_FIELD VALID or ECMD_TARGET_FIELD_UNUSED\n\n TARGET DEPTH  : Input To This Function\n TARGET STATES : Gets Set By This Function\n\n *\/\nuint32_t ecmdSetTargetDepth(ecmdChipTarget & io_target, ecmdTargetDepth_t i_depth);\n\n\/**\n *  @brief Sets Fields of ecmdMemoryEntry_t from the DCard data in the file\n *  @param i_filename file to read the d-card data from\n *  @param o_data list to be updated with the d-card data\n *  @retval ECMD_SUCCESS if setting successful\n *  @retval ECMD_INVALID_ARGS if unsuccessful in finding a matching depth\n *\/\nuint32_t ecmdReadDcard(const char *i_filename, std::list<ecmdMemoryEntry> &o_data);\n\n\/**\n @brief Returns a formatted string containing the data in the given ecmdChipTarget\n @return String with formatted target data\n @param i_target ecmdChipTarget containing data to format into string\n @param i_displayMode Mode to format data\n\n TARGET DEPTH  : cage, node, slot, pos, chipUnit\/core, thread\n TARGET STATES : Must be Initialized\n *\/\nstd::string ecmdWriteTarget(ecmdChipTarget & i_target, ecmdTargetDisplayMode_t i_displayMode = ECMD_DISPLAY_TARGET_PLUGIN_MODE);\n\n\/**\n @brief Called by the plugin to set the preferred outputmode of @see ecmdWriteTarget\n @param i_displayMode The display mode returned by the plugin\n*\/\nvoid ecmdSetTargetDisplayMode(ecmdTargetDisplayMode_t i_displayMode);\n\n\/**\n @brief Reads in a target string, returns a filled in target\n @return String with formatted target data\n @param i_targetStr String in a \"k0:nall:s0:pu:p0\" format to be turned into a target\n @param o_target ecmdChipTarget initialized based upon i_targetStr\n *\/\nuint32_t ecmdReadTarget(std::string i_targetStr, ecmdChipTarget & o_target);\n\n\/**\n @brief Parse the chip field and look for the chipUnit\n @param i_chipField The chip field from the command line to be parsed\n @param o_chipType The chip type from the field\n @param o_chipUnitType The chipUnit type from the field (if one was found)\n @retval ECMD_SUCCESS if successful\n @retval nonzero if failure\n*\/\nuint32_t ecmdParseChipField(std::string i_chipField, std::string &o_chipType, std::string &o_chipUnitType);\n\n#endif \/* ecmdSharedUtils_h *\/\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- mode: C++; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- *\/\n\/\/ vim:sts=8:sw=8:ts=8:noet:sr:cino=>s,f0,{0,g0,(0,\\:0,t0,+0,=s\n\/* fflas\/fflas_bounds.inl\n * Copyright (C) 2013 Jean-Guillaume Dumas\n *\n * Written by Jean-Guillaume Dumas <Jean-Guillaume.Dumas@imag.fr>\n *\n *\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\n#ifndef __FFLASFFPACK_fflas_blockcuts_INL\n#define __FFLASFFPACK_fflas_blockcuts_INL\n\n\n#define __FFLASFFPACK_MINBLOCKCUTS 256\n\nnamespace FFLAS {\n\n    template<CuttingStrategy Method>\n    void BlockCuts(size_t& RBLOCKSIZE, size_t& CBLOCKSIZE,\n                   const size_t m, const size_t n,\n                   const size_t numthreads);\n\n    template<>\n    void BlockCuts<ROW_FIXED>(size_t& RBLOCKSIZE,\n                              size_t& CBLOCKSIZE,\n                              const size_t m, const size_t n,\n                              const size_t numthreads) {\n        RBLOCKSIZE = std::min(m,__FFLASFFPACK_MINBLOCKCUTS);\n        CBLOCKSIZE = n;\n    }\n\n\n    template<>\n    void BlockCuts<COLUMN_FIXED>(size_t& RBLOCKSIZE,\n                                 size_t& CBLOCKSIZE,\n                                 const size_t m, const size_t n,\n                                 const size_t numthreads) {\n        RBLOCKSIZE = m;\n        CBLOCKSIZE = std::min(n,__FFLASFFPACK_MINBLOCKCUTS);\n    }\n\n\n    template<>\n    void BlockCuts<BLOCK_FIXED>(size_t& RBLOCKSIZE,\n                                size_t& CBLOCKSIZE,\n                                const size_t m, const size_t n,\n                                const size_t numthreads) {\n        RBLOCKSIZE = std::min(m,__FFLASFFPACK_MINBLOCKCUTS);\n        CBLOCKSIZE = std::min(n,__FFLASFFPACK_MINBLOCKCUTS);\n    }\n\n    template<>\n    void BlockCuts<ROW_THREADS>(size_t& RBLOCKSIZE,\n                                size_t& CBLOCKSIZE,\n                                const size_t m, const size_t n,\n                                const size_t numthreads) {\n        RBLOCKSIZE = std::max(m\/numthreads,(size_t)1);\n        CBLOCKSIZE = n;\n    }\n\n\n    template<>\n    void BlockCuts<COLUMN_THREADS>(size_t& RBLOCKSIZE,\n                                   size_t& CBLOCKSIZE,\n                                   const size_t m, const size_t n,\n                                   const size_t numthreads) {\n        RBLOCKSIZE = m;\n        CBLOCKSIZE = std::max(n\/numthreads,(size_t)1);\n    }\n\n    template<>\n    void BlockCuts<BLOCK_THREADS>(size_t& RBLOCKSIZE,\n                                  size_t& CBLOCKSIZE,\n                                  const size_t m, const size_t n,\n                                  const size_t numthreads) {\n        if (numthreads<65) {\n                \/\/CP: Let's not compute these values all the time\n            const short maxtc[64] = {1,2,3,2,5,3,7,4,3,5,11,4,13,7,5,4,17,6,19,5,7,11,23,6,5,13,9,7,29,6,31,8,11,17,7,6,37,19,13,8,41,7,43,11,9,23,47,8,7,10,17,13,53,9,11,8,19,29,59,10,61,31,9,8};\n            const short maxtr[64] = {1,1,1,2,1,2,1,2,3,2,1,3,1,2,3,4,1,3,1,4,3,2,1,4,5,2,3,4,1,5,1,4,3,2,5,6,1,2,3,5,1,6,1,4,5,2,1,6,7,5,3,4,1,6,5,7,3,2,1,6,1,2,7,8};\n\n            RBLOCKSIZE=std::max(m\/(size_t)maxtr[numthreads-1],(size_t)1);\n            CBLOCKSIZE=std::max(n\/(size_t)maxtc[numthreads-1],(size_t)1);\n        } else {\n            const size_t maxt = (size_t)sqrt((double)numthreads);\n            size_t maxtr=maxt,maxtc=maxt;\n            for(size_t i=maxt; i>=1; --i) {\n                size_t j=maxt;\n                size_t newpr = i*j;\n                for( ; newpr < numthreads; ++j, newpr+=i ) {}\n                if (newpr == numthreads) {\n                    maxtc = j;\n                    maxtr = i;\n                    break;\n                }\n            }\n            RBLOCKSIZE=std::max(m\/maxtr,(size_t)1);\n            CBLOCKSIZE=std::max(n\/maxtc,(size_t)1);\n        }\n    }\n\n    void BlockCuts(size_t& r, size_t& c,\n                   size_t m, size_t n,\n                   const CuttingStrategy method,\n                   const size_t t) {\n        switch(method) {\n            case BLOCK_THREADS: BlockCuts<BLOCK_THREADS>(r,c,m,n,t); break;\n            case ROW_THREADS: BlockCuts<ROW_THREADS>(r,c,m,n,t); break;\n            case ROW_FIXED: BlockCuts<ROW_FIXED>(r,c,m,n,t); break;\n            case BLOCK_FIXED: BlockCuts<BLOCK_FIXED>(r,c,m,n,t); break;\n            case COLUMN_THREADS: BlockCuts<COLUMN_THREADS>(r,c,m,n,t); break;\n            case COLUMN_FIXED: BlockCuts<COLUMN_FIXED>(r,c,m,n,t); break;\n            default: BlockCuts<BLOCK_THREADS>(r,c,m,n,t);\n        };\n\n    }\n\n\n\n    void BlockCuts(size_t& rowBlockSize, size_t& colBlockSize,\n                   size_t& lastRBS, size_t& lastCBS,\n                   size_t& changeRBS, size_t& changeCBS,\n                   size_t& numRowBlock, size_t& numColBlock,\n                   size_t m, size_t n,\n                   const CuttingStrategy method,\n                   const size_t numthreads) {\n        BlockCuts(rowBlockSize, colBlockSize, m, n, method, numthreads);\n        numRowBlock = m\/rowBlockSize;\n        numColBlock = n\/colBlockSize;\n\n        changeRBS = m-rowBlockSize*numRowBlock;\n        lastRBS = rowBlockSize;\n        if (changeRBS) ++rowBlockSize;\n\n        changeCBS = n-colBlockSize*numColBlock;\n        lastCBS = colBlockSize;\n        if (changeCBS) ++colBlockSize;\n\n\n\t\/*\n            \/\/ Better preserve numRowBlock and numColBlock\n        if (lastRBS) {\n            lastRBS = m-rowBlockSize*numRowBlock;\n            ++rowBlockSize;\n        } else lastRBS = rowBlockSize;\n        if (lastCBS) {\n            lastCBS = n-colBlockSize*numColBlock;\n            ++colBlockSize;\n        } else lastCBS = colBlockSize;\n*\/\n\n\n\n\/\/             \/\/ Better preserve rowBlockSize and colBlockSize\n\/\/         lastRBS = m % rowBlockSize;\n\/\/         lastCBS = n % colBlockSize;\n\/\/          if (lastRBS) ++numRowBlock; else lastRBS = rowBlockSize;\n\/\/          if (lastCBS) ++numColBlock; else lastCBS = colBlockSize;\n    }\n\n\n}\n\n\n\nnamespace FFLAS {\n\n    struct ForStrategy1D {\n        ForStrategy1D(const size_t n, const CuttingStrategy method, const size_t numthreads) {\n\/\/             std::cout<<\"FS1D n : \"<<n<<std::endl;\n\/\/             std::cout<<\"FS1D method    : \"<<method<<std::endl;\n\/\/             std::cout<<\"FS1D numthreads : \"<<numthreads<<std::endl;\n\n            if ( method == BLOCK_THREADS || method == ROW_THREADS || method == COLUMN_THREADS) {\n                numBlock = std::max(numthreads,(size_t)1);\n            } else {\n                numBlock = std::max(n\/__FFLASFFPACK_MINBLOCKCUTS,(size_t)1);\n            }\n            firstBlockSize = n\/numBlock;\n            if (firstBlockSize<1) {\n                firstBlockSize = (size_t)1;\n                numBlock = n;\n            }\n            changeBS = n - numBlock*firstBlockSize;\n            lastBlockSize = firstBlockSize;\n            if (changeBS) ++firstBlockSize;\n\n\/\/             std::cout<<\"FS1D 1BLOCKSIZE : \"<<firstBlockSize<<std::endl;\n\/\/             std::cout<<\"FS1D 2BLOCKSIZE : \"<<lastBlockSize<<std::endl;\n\/\/             std::cout<<\"FS1D changeBS : \"<<changeBS<<std::endl;\n\/\/             std::cout<<\"FS1D NBlocks : \"<<numBlock<<std::endl;\n        }\n\n        size_t begin() {\n            ibeg = 0; iend = firstBlockSize;\n\/\/             std::cout << \"FS1D 0   : \" << 0 << std::endl;\n\/\/             std::cout << \"FS1D ibeg: \" << ibeg << std::endl;\n\/\/             std::cout << \"FS1D iend: \" << iend << std::endl;\n\n            return current = 0;\n        }\n        bool end() const { return current == numBlock; }\n        size_t operator++() {\n            ibeg = iend;\n            iend += (++current<changeBS?firstBlockSize:lastBlockSize);\n\n\/\/             std::cout << \"FS1D i   : \" << current << std::endl;\n\/\/             std::cout << \"FS1D ibeg: \" << ibeg << std::endl;\n\/\/             std::cout << \"FS1D iend: \" << iend << std::endl;\n\n\n            return current;\n        }\n\n        size_t ibeg, iend;\n\n    protected:\n        size_t current;\n        size_t firstBlockSize,lastBlockSize;\n        size_t changeBS;\n        size_t numBlock;\n\n    };\n\n\n    struct ForStrategy2D {\n        ForStrategy2D(const size_t m, const size_t n, const CuttingStrategy method, const size_t numthreads) {\n            BlockCuts(rowBlockSize, colBlockSize,\n                      lastRBS, lastCBS,\n                      changeRBS, changeCBS,\n                      numRowBlock, numColBlock,\n                      m, n, method, numthreads);\n\n            BLOCKS = numRowBlock * numColBlock;\n        }\n\n\n        size_t begin() {\n            ibeg = 0; iend = rowBlockSize;\n            jbeg = 0; jend = colBlockSize;\n            return current = 0;\n        }\n        bool end() const { return current == BLOCKS; }\n\n        size_t operator++() {\n            ++current;\n            size_t icurr = current\/numColBlock;\n            size_t jcurr = current%numColBlock;\n            if (jcurr) {\n                jbeg = jend;\n                jend += (jcurr<changeCBS?colBlockSize:lastCBS);\n            } else {\n                ibeg = iend;\n                iend += (icurr<changeRBS?rowBlockSize:lastRBS);\n                jbeg = 0;\n                jend = colBlockSize;\n            }\n            return current;\n        }\n\n        friend std::ostream& operator<<(std::ostream& out, const ForStrategy2D& FS2D) {\n            out<<\"RBLOCKSIZE: \"<<FS2D.rowBlockSize<<std::endl;\n            out<<\"CBLOCKSIZE: \"<<FS2D.colBlockSize<<std::endl;\n            out<<\"changeRBS : \"<<FS2D.changeRBS<<std::endl;\n            out<<\"changeCBS : \"<<FS2D.changeCBS<<std::endl;\n            out<<\"lastRBS   : \"<<FS2D.lastRBS<<std::endl;\n            out<<\"lastCBS   : \"<<FS2D.lastCBS<<std::endl;\n            out<<\"NrowBlocks: \"<<FS2D.numRowBlock<<std::endl;\n            out<<\"NcolBlocks: \"<<FS2D.numColBlock<<std::endl;\n            out<<\"curr: \" << FS2D.current << '\/' << FS2D.BLOCKS << std::endl;\n            out<<\"ibeg: \" << FS2D.ibeg << std::endl;\n            out<<\"iend: \" << FS2D.iend << std::endl;\n            out<<\"jbeg: \" << FS2D.jbeg << std::endl;\n            out<<\"jend: \" << FS2D.jend << std::endl;\n            return out;\n        }\n                \n\n\n\/\/         size_t begin() { current = 0; return setCurrentBlock(); }\n\/\/         bool end() const { return current == BLOCKS; }\n\/\/         size_t setCurrentBlock() {\n\/\/ \t\t\tibeg = current \/ numColBlock;\n\/\/ \t\t\tjbeg = current % numColBlock;\n\/\/ \t\t\tsize_t BlockRowDim = rowBlockSize;\n\/\/ \t\t\tif (ibeg == numRowBlock-1)\n\/\/ \t\t\t\tBlockRowDim = lastRBS;\n\/\/ \t\t\tsize_t BlockColDim = colBlockSize;\n\/\/ \t\t\tif (jbeg == numColBlock-1)\n\/\/ \t\t\t\tBlockColDim = lastCBS;\n\/\/             ibeg *= rowBlockSize;\n\/\/             jbeg *= colBlockSize;\n\/\/             iend = ibeg + BlockRowDim;\n\/\/             jend = jbeg + BlockColDim;\n\/\/             return current;\n\/\/         }\n\n\/\/         size_t operator++() { ++current; return setCurrentBlock(); }\n\n        size_t ibeg, iend, jbeg, jend;\n        size_t rowBlockSize, colBlockSize;\n\n    protected:\n        size_t current;\n        size_t lastRBS; size_t lastCBS;\n        size_t changeRBS; size_t changeCBS;\n        size_t numRowBlock; size_t numColBlock;\n        size_t BLOCKS;\n\n   };\n\n}\n\n\n\n#endif\n\n<commit_msg>std::min replaced by explit ( ? : )<commit_after>\/* -*- mode: C++; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- *\/\n\/\/ vim:sts=8:sw=8:ts=8:noet:sr:cino=>s,f0,{0,g0,(0,\\:0,t0,+0,=s\n\/* fflas\/fflas_bounds.inl\n * Copyright (C) 2013 Jean-Guillaume Dumas\n *\n * Written by Jean-Guillaume Dumas <Jean-Guillaume.Dumas@imag.fr>\n *\n *\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\n#ifndef __FFLASFFPACK_fflas_blockcuts_INL\n#define __FFLASFFPACK_fflas_blockcuts_INL\n\n\n#define __FFLASFFPACK_MINBLOCKCUTS 256\n\nnamespace FFLAS {\n\n    template<CuttingStrategy Method>\n    void BlockCuts(size_t& RBLOCKSIZE, size_t& CBLOCKSIZE,\n                   const size_t m, const size_t n,\n                   const size_t numthreads);\n\n    template<>\n    void BlockCuts<ROW_FIXED>(size_t& RBLOCKSIZE,\n                              size_t& CBLOCKSIZE,\n                              const size_t m, const size_t n,\n                              const size_t numthreads) {\n        RBLOCKSIZE =  (m>__FFLASFFPACK_MINBLOCKCUTS)?__FFLASFFPACK_MINBLOCKCUTS:m;\n        CBLOCKSIZE = n;\n    }\n\n\n    template<>\n    void BlockCuts<COLUMN_FIXED>(size_t& RBLOCKSIZE,\n                                 size_t& CBLOCKSIZE,\n                                 const size_t m, const size_t n,\n                                 const size_t numthreads) {\n        RBLOCKSIZE = m;\n        CBLOCKSIZE = (n>__FFLASFFPACK_MINBLOCKCUTS)?__FFLASFFPACK_MINBLOCKCUTS:n;\n    }\n\n\n    template<>\n    void BlockCuts<BLOCK_FIXED>(size_t& RBLOCKSIZE,\n                                size_t& CBLOCKSIZE,\n                                const size_t m, const size_t n,\n                                const size_t numthreads) {\n        RBLOCKSIZE = (m>__FFLASFFPACK_MINBLOCKCUTS)?__FFLASFFPACK_MINBLOCKCUTS:m;\n        CBLOCKSIZE = (n>__FFLASFFPACK_MINBLOCKCUTS)?__FFLASFFPACK_MINBLOCKCUTS:n;\n    }\n\n    template<>\n    void BlockCuts<ROW_THREADS>(size_t& RBLOCKSIZE,\n                                size_t& CBLOCKSIZE,\n                                const size_t m, const size_t n,\n                                const size_t numthreads) {\n        RBLOCKSIZE = std::max(m\/numthreads,(size_t)1);\n        CBLOCKSIZE = n;\n    }\n\n\n    template<>\n    void BlockCuts<COLUMN_THREADS>(size_t& RBLOCKSIZE,\n                                   size_t& CBLOCKSIZE,\n                                   const size_t m, const size_t n,\n                                   const size_t numthreads) {\n        RBLOCKSIZE = m;\n        CBLOCKSIZE = std::max(n\/numthreads,(size_t)1);\n    }\n\n    template<>\n    void BlockCuts<BLOCK_THREADS>(size_t& RBLOCKSIZE,\n                                  size_t& CBLOCKSIZE,\n                                  const size_t m, const size_t n,\n                                  const size_t numthreads) {\n        if (numthreads<65) {\n                \/\/CP: Let's not compute these values all the time\n            const short maxtc[64] = {1,2,3,2,5,3,7,4,3,5,11,4,13,7,5,4,17,6,19,5,7,11,23,6,5,13,9,7,29,6,31,8,11,17,7,6,37,19,13,8,41,7,43,11,9,23,47,8,7,10,17,13,53,9,11,8,19,29,59,10,61,31,9,8};\n            const short maxtr[64] = {1,1,1,2,1,2,1,2,3,2,1,3,1,2,3,4,1,3,1,4,3,2,1,4,5,2,3,4,1,5,1,4,3,2,5,6,1,2,3,5,1,6,1,4,5,2,1,6,7,5,3,4,1,6,5,7,3,2,1,6,1,2,7,8};\n\n            RBLOCKSIZE=std::max(m\/(size_t)maxtr[numthreads-1],(size_t)1);\n            CBLOCKSIZE=std::max(n\/(size_t)maxtc[numthreads-1],(size_t)1);\n        } else {\n            const size_t maxt = (size_t)sqrt((double)numthreads);\n            size_t maxtr=maxt,maxtc=maxt;\n            for(size_t i=maxt; i>=1; --i) {\n                size_t j=maxt;\n                size_t newpr = i*j;\n                for( ; newpr < numthreads; ++j, newpr+=i ) {}\n                if (newpr == numthreads) {\n                    maxtc = j;\n                    maxtr = i;\n                    break;\n                }\n            }\n            RBLOCKSIZE=std::max(m\/maxtr,(size_t)1);\n            CBLOCKSIZE=std::max(n\/maxtc,(size_t)1);\n        }\n    }\n\n    void BlockCuts(size_t& r, size_t& c,\n                   size_t m, size_t n,\n                   const CuttingStrategy method,\n                   const size_t t) {\n        switch(method) {\n            case BLOCK_THREADS: BlockCuts<BLOCK_THREADS>(r,c,m,n,t); break;\n            case ROW_THREADS: BlockCuts<ROW_THREADS>(r,c,m,n,t); break;\n            case ROW_FIXED: BlockCuts<ROW_FIXED>(r,c,m,n,t); break;\n            case BLOCK_FIXED: BlockCuts<BLOCK_FIXED>(r,c,m,n,t); break;\n            case COLUMN_THREADS: BlockCuts<COLUMN_THREADS>(r,c,m,n,t); break;\n            case COLUMN_FIXED: BlockCuts<COLUMN_FIXED>(r,c,m,n,t); break;\n            default: BlockCuts<BLOCK_THREADS>(r,c,m,n,t);\n        };\n\n    }\n\n\n\n    void BlockCuts(size_t& rowBlockSize, size_t& colBlockSize,\n                   size_t& lastRBS, size_t& lastCBS,\n                   size_t& changeRBS, size_t& changeCBS,\n                   size_t& numRowBlock, size_t& numColBlock,\n                   size_t m, size_t n,\n                   const CuttingStrategy method,\n                   const size_t numthreads) {\n        BlockCuts(rowBlockSize, colBlockSize, m, n, method, numthreads);\n        numRowBlock = m\/rowBlockSize;\n        numColBlock = n\/colBlockSize;\n\n        changeRBS = m-rowBlockSize*numRowBlock;\n        lastRBS = rowBlockSize;\n        if (changeRBS) ++rowBlockSize;\n\n        changeCBS = n-colBlockSize*numColBlock;\n        lastCBS = colBlockSize;\n        if (changeCBS) ++colBlockSize;\n\n\n\t\/*\n            \/\/ Better preserve numRowBlock and numColBlock\n        if (lastRBS) {\n            lastRBS = m-rowBlockSize*numRowBlock;\n            ++rowBlockSize;\n        } else lastRBS = rowBlockSize;\n        if (lastCBS) {\n            lastCBS = n-colBlockSize*numColBlock;\n            ++colBlockSize;\n        } else lastCBS = colBlockSize;\n*\/\n\n\n\n\/\/             \/\/ Better preserve rowBlockSize and colBlockSize\n\/\/         lastRBS = m % rowBlockSize;\n\/\/         lastCBS = n % colBlockSize;\n\/\/          if (lastRBS) ++numRowBlock; else lastRBS = rowBlockSize;\n\/\/          if (lastCBS) ++numColBlock; else lastCBS = colBlockSize;\n    }\n\n\n}\n\n\n\nnamespace FFLAS {\n\n    struct ForStrategy1D {\n        ForStrategy1D(const size_t n, const CuttingStrategy method, const size_t numthreads) {\n\/\/             std::cout<<\"FS1D n : \"<<n<<std::endl;\n\/\/             std::cout<<\"FS1D method    : \"<<method<<std::endl;\n\/\/             std::cout<<\"FS1D numthreads : \"<<numthreads<<std::endl;\n\n            if ( method == BLOCK_THREADS || method == ROW_THREADS || method == COLUMN_THREADS) {\n                numBlock = std::max(numthreads,(size_t)1);\n            } else {\n                numBlock = std::max(n\/__FFLASFFPACK_MINBLOCKCUTS,(size_t)1);\n            }\n            firstBlockSize = n\/numBlock;\n            if (firstBlockSize<1) {\n                firstBlockSize = (size_t)1;\n                numBlock = n;\n            }\n            changeBS = n - numBlock*firstBlockSize;\n            lastBlockSize = firstBlockSize;\n            if (changeBS) ++firstBlockSize;\n\n\/\/             std::cout<<\"FS1D 1BLOCKSIZE : \"<<firstBlockSize<<std::endl;\n\/\/             std::cout<<\"FS1D 2BLOCKSIZE : \"<<lastBlockSize<<std::endl;\n\/\/             std::cout<<\"FS1D changeBS : \"<<changeBS<<std::endl;\n\/\/             std::cout<<\"FS1D NBlocks : \"<<numBlock<<std::endl;\n        }\n\n        size_t begin() {\n            ibeg = 0; iend = firstBlockSize;\n\/\/             std::cout << \"FS1D 0   : \" << 0 << std::endl;\n\/\/             std::cout << \"FS1D ibeg: \" << ibeg << std::endl;\n\/\/             std::cout << \"FS1D iend: \" << iend << std::endl;\n\n            return current = 0;\n        }\n        bool end() const { return current == numBlock; }\n        size_t operator++() {\n            ibeg = iend;\n            iend += (++current<changeBS?firstBlockSize:lastBlockSize);\n\n\/\/             std::cout << \"FS1D i   : \" << current << std::endl;\n\/\/             std::cout << \"FS1D ibeg: \" << ibeg << std::endl;\n\/\/             std::cout << \"FS1D iend: \" << iend << std::endl;\n\n\n            return current;\n        }\n\n        size_t ibeg, iend;\n\n    protected:\n        size_t current;\n        size_t firstBlockSize,lastBlockSize;\n        size_t changeBS;\n        size_t numBlock;\n\n    };\n\n\n    struct ForStrategy2D {\n        ForStrategy2D(const size_t m, const size_t n, const CuttingStrategy method, const size_t numthreads) {\n            BlockCuts(rowBlockSize, colBlockSize,\n                      lastRBS, lastCBS,\n                      changeRBS, changeCBS,\n                      numRowBlock, numColBlock,\n                      m, n, method, numthreads);\n\n            BLOCKS = numRowBlock * numColBlock;\n        }\n\n\n        size_t begin() {\n            ibeg = 0; iend = rowBlockSize;\n            jbeg = 0; jend = colBlockSize;\n            return current = 0;\n        }\n        bool end() const { return current == BLOCKS; }\n\n        size_t operator++() {\n            ++current;\n            size_t icurr = current\/numColBlock;\n            size_t jcurr = current%numColBlock;\n            if (jcurr) {\n                jbeg = jend;\n                jend += (jcurr<changeCBS?colBlockSize:lastCBS);\n            } else {\n                ibeg = iend;\n                iend += (icurr<changeRBS?rowBlockSize:lastRBS);\n                jbeg = 0;\n                jend = colBlockSize;\n            }\n            return current;\n        }\n\n        friend std::ostream& operator<<(std::ostream& out, const ForStrategy2D& FS2D) {\n            out<<\"RBLOCKSIZE: \"<<FS2D.rowBlockSize<<std::endl;\n            out<<\"CBLOCKSIZE: \"<<FS2D.colBlockSize<<std::endl;\n            out<<\"changeRBS : \"<<FS2D.changeRBS<<std::endl;\n            out<<\"changeCBS : \"<<FS2D.changeCBS<<std::endl;\n            out<<\"lastRBS   : \"<<FS2D.lastRBS<<std::endl;\n            out<<\"lastCBS   : \"<<FS2D.lastCBS<<std::endl;\n            out<<\"NrowBlocks: \"<<FS2D.numRowBlock<<std::endl;\n            out<<\"NcolBlocks: \"<<FS2D.numColBlock<<std::endl;\n            out<<\"curr: \" << FS2D.current << '\/' << FS2D.BLOCKS << std::endl;\n            out<<\"ibeg: \" << FS2D.ibeg << std::endl;\n            out<<\"iend: \" << FS2D.iend << std::endl;\n            out<<\"jbeg: \" << FS2D.jbeg << std::endl;\n            out<<\"jend: \" << FS2D.jend << std::endl;\n            return out;\n        }\n                \n\n\n\/\/         size_t begin() { current = 0; return setCurrentBlock(); }\n\/\/         bool end() const { return current == BLOCKS; }\n\/\/         size_t setCurrentBlock() {\n\/\/ \t\t\tibeg = current \/ numColBlock;\n\/\/ \t\t\tjbeg = current % numColBlock;\n\/\/ \t\t\tsize_t BlockRowDim = rowBlockSize;\n\/\/ \t\t\tif (ibeg == numRowBlock-1)\n\/\/ \t\t\t\tBlockRowDim = lastRBS;\n\/\/ \t\t\tsize_t BlockColDim = colBlockSize;\n\/\/ \t\t\tif (jbeg == numColBlock-1)\n\/\/ \t\t\t\tBlockColDim = lastCBS;\n\/\/             ibeg *= rowBlockSize;\n\/\/             jbeg *= colBlockSize;\n\/\/             iend = ibeg + BlockRowDim;\n\/\/             jend = jbeg + BlockColDim;\n\/\/             return current;\n\/\/         }\n\n\/\/         size_t operator++() { ++current; return setCurrentBlock(); }\n\n        size_t ibeg, iend, jbeg, jend;\n        size_t rowBlockSize, colBlockSize;\n\n    protected:\n        size_t current;\n        size_t lastRBS; size_t lastCBS;\n        size_t changeRBS; size_t changeCBS;\n        size_t numRowBlock; size_t numColBlock;\n        size_t BLOCKS;\n\n   };\n\n}\n\n\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Created by mathias on 6\/4\/16.\n\/\/\n\n#include \"FlightController.h\"\n\n#define DEBUG 1\n\nvoid* startNavdata(void *thread_args);\nvoid* startCV(void *thread_args);\nvoid* startController(void *thread_arg);\n\nstruct thread_data{\n    Nav *navData;\n    CV_Handler *cvHandler;\n    FlightController *controller;\n    ros::MultiThreadedSpinner spinner;\n    ros::NodeHandle *n;\n} myThreadData;\n\nFlightController::FlightController(){\n    baseSpeed = 0.1;\n    LOOP_RATE = 0;\n    takeoff_time = 3;\n    cmd.linear.x = 0.0;\n    cmd.linear.y = 0.0;\n    cmd.linear.z = 0.0;\n    cmd.angular.x = 0.0;\n    cmd.angular.y = 0.0;\n    cmd.angular.z = 0.0;\n    straightFlight = false;\n}\n\nFlightController::FlightController(int loopRate, ros::NodeHandle *nh, ros::MultiThreadedSpinner spinner) {\n    baseSpeed = 0.1;\n    LOOP_RATE = loopRate;\n    takeoff_time = 3;\n    straightFlight = false;\n    pub_land = nh->advertise<std_msgs::Empty>(\"\/ardrone\/land\", 1);\n    pub_takeoff = nh->advertise<std_msgs::Empty>(\"\/ardrone\/takeoff\", 1);\n    pub_control = nh->advertise<geometry_msgs::Twist>(\"cmd_vel\", 1);\n    pub_reset = nh->advertise<std_msgs::Empty>(\"\/ardrone\/reset\", 1);\n\n    precision = 50;\n    maxSpeed = 0.5;\n\n    cvHandler = new CV_Handler();\n\n    myThreadData.cvHandler = cvHandler;\n    navData = new Nav();\n    myThreadData.navData = navData;\n    myThreadData.spinner = spinner;\n    myThreadData.n = nh;\n\n    pthread_t threads[2];\n    pthread_create(&threads[0], NULL, startCV, &myThreadData);\n    pthread_create(&threads[1], NULL, startNavdata, &myThreadData);\n\n\n    cmd.linear.x = 0.0;\n    cmd.linear.y = 0.0;\n    cmd.linear.z = 0.0;\n    cmd.angular.x = 0.0;\n    cmd.angular.y = 0.0;\n    cmd.angular.z = 0.0;\n}\n\n\/\/ Destructor\nFlightController::~FlightController() {\n    delete(cvHandler);\n}\n\nvoid FlightController::run(){\n    Route myRoute;\n    myRoute.initRoute(true);\n\n\n    ros::Rate loop_rate(LOOP_RATE);\n    setStraightFlight(true);\n\n    while (ros::ok()) {\n\n        takeOff();\n        ROS_INFO(\"BEFORE TAKEOFF\");\n        while (!myRoute.hasAllBeenVisited()) {\n            ROS_INFO(\"HI THERE\");\n            Command currentCommand = myRoute.nextCommand();\n\n            if (currentCommand.commandType == Command::goTo) {\n                goToWaypoint(currentCommand);\n            } else if (currentCommand.commandType == Command::hover) {\n                hover(currentCommand.timeToHover);\n            } else if (currentCommand.commandType == Command::turn) {\n               \/\/   urnDrone(currentCommand.degrees);\n            }\n        }\n\n        land();\n\n        break;\n    }\n\n\n\n    return;\n}\n\nvoid FlightController::goToWaypoint(Command newWaypoint) {\n    double dx = newWaypoint.x - navData->position.x;\n    double dy = newWaypoint.y - navData->position.y;\n    double dz = newWaypoint.z - navData->position.z;\n\n\n\n    bool moved = false;\n\n    while(abs(dz) > precision){\n        cmd.linear.z = getSpeed(dz);\n\n        pub_control.publish(cmd);\n        dz = newWaypoint.z - navData->position.z;\n\n#ifdef DEBUG\n        ROS_INFO(\"dz = %F\", dz);\n#endif\n        ros::Rate(LOOP_RATE).sleep();\n        moved = true;\n    }\n\n    if(moved)\n        hover(1);\n\n    moved = false;\n    if (!straightFlight) {\n        \/\/ TODO decide if this should be implemented or not\n    } else{\n        while(abs(dx) > precision){\n            cmd.linear.x = getSpeed(dx);\n\n            pub_control.publish(cmd);\n            dx = newWaypoint.x - navData->position.x;\n\n        #ifdef DEBUG\n            ROS_INFO(\"newpoint = %F\", newWaypoint.x);\n            ROS_INFO(\"navData = %F\", navData->position.x);\n            ROS_INFO(\"dx = %F\", dx);\n            ROS_INFO(\"Speed = %F\", cmd.linear.x);\n            ROS_INFO(\"rotation = %F\", navData->rotation);\n        #endif\n            ros::Rate(LOOP_RATE).sleep();\n            moved = true;\n        }\n\n        if(moved)\n            hover(1);\n\n        moved = false;\n        while(abs(dy) > precision){\n\n            cmd.linear.y = getSpeed(dy);\n\n            pub_control.publish(cmd);\n            dy = newWaypoint.y - navData->position.y;\n\n        #ifdef DEBUG\n            ROS_INFO(\"dy = %F\", dy);\n        #endif\n            ros::Rate(LOOP_RATE).sleep();\n            moved = true;\n        }\n\n        if(moved)\n            hover(1);\n    }\n}\n\ndouble FlightController::getSpeed(double distance) {\n    double speed = baseSpeed*(distance\/150);\n    if(speed > maxSpeed)\n        speed = maxSpeed;\n\n    return speed;\n}\n\nvoid FlightController::turnTowardsPoint(Command waypoint) {\n\n    double target_angle = atan2(waypoint.y, waypoint.x); \/\/ angle towards waypoint position\n    double target_deg = target_angle * 180 \/ M_PI;\n\n    double ori_deg;\n\n    float offset = 0.5;\n    do{\n        ori_deg = navData->rotation;\n        if(ori_deg < 0)\n            ori_deg = 360 + ori_deg;\n\n    } while(ori_deg < target_deg-offset or ori_deg > target_deg+offset);\n}\n\ndouble FlightController::getRotationalSpeed(double target_deg, double ori_deg){\n    double dir; \/\/ direction\n    double rot_speed; \/\/ calculated rotational speed\n\n\n\n\n    double diff_deg = target_deg - ori_deg;\n\n    if ( diff_deg < 0 )\n        diff_deg = 360 + diff_deg;\n\n    printf(\"target_deg:\\t%6.2f deg\\n\", diff_deg);\n\n\n    if (diff_deg < 180){\n        dir = -1;\n        printf(\"Turn left\");\n    } else{\n        dir = 1;\n        diff_deg = 360 -diff_deg;\n        printf(\"Turn right\");\n    }\n\n    rot_speed = (diff_deg*diff_deg)\/200; \/\/ speed to rotate with\n\n    if(rot_speed > 0.5)\n        rot_speed = 0.5;\n\n    rot_speed *= dir;\n\n    return rot_speed;\n}\n\nvoid FlightController::hover(int time){\n    cmd.linear.x = 0.0;\n    cmd.linear.y = 0.0;\n    cmd.linear.z = 0.0;\n    cmd.angular.x = 0.0;\n    cmd.angular.y = 0.0;\n    cmd.angular.z = 0.0;\n    ROS_INFO(\"HOVER\");\n\n    for(int i = 0; i < 3; i++)\n        pub_control.publish(cmd);\n}\n\nvoid FlightController::takeOff() {\n\n    std_msgs::Empty empty_msg;\n    pub_takeoff.publish(empty_msg);\n\n    for(int i = 0; i < takeoff_time*LOOP_RATE; i++){\n        ros::Rate(LOOP_RATE).sleep();\n    }\n\n    hover(1);\n}\n\nvoid FlightController::land() {\n    std_msgs::Empty empty_msg;\n    pub_land.publish(empty_msg);\n\n    for (int j = 0; j < LOOP_RATE; j++) {\n        ros::Rate(LOOP_RATE).sleep();\n    }\n}\n\nvoid FlightController::reset(){\n    std_msgs::Empty empty_msg;\n    pub_reset.publish(empty_msg);\n}\n\nvoid FlightController::setStraightFlight(bool newState) {\n    straightFlight = newState;\n}\n\nMyVector FlightController::transformCoordinates(MyVector incomingVector) {\n   \/* MyVector rotationMatrix[3];\n    rotationMatrix[0] = MyVector(cos(rotation), -sin(rotation), 0);\n    rotationMatrix[1] = MyVector(sin(rotation), cos(rotation), 0);\n    rotationMatrix[2] = MyVector(0, 0, 1);\n\n    MyVector tempVector(incomingVector.x-navData->position.x, incomingVector.y-navData->position.y, incomingVector.z-navData->position.z);\n\n    MyVector resultVector(rotationMatrix[0].x*tempVector.x+rotationMatrix[0].y*tempVector.y+rotationMatrix[0].z*tempVector.z,\n                        rotationMatrix[1].x*tempVector.x+rotationMatrix[1].y*tempVector.y+rotationMatrix[1].z*tempVector.z,\n                        rotationMatrix[2].x*tempVector.x+rotationMatrix[2].y*tempVector.y+rotationMatrix[2].z*tempVector.z);\n\n\n    resultVector.x += navData->position.x;\n    resultVector.y += navData->position.y;\n    resultVector.z += navData->position.z;\n\n    ROS_INFO(\"Incoming vector;\");\n    ROS_INFO(\"X = %F\", incomingVector.x);\n    ROS_INFO(\"Y = %F\", incomingVector.y);\n    ROS_INFO(\"Z = %F\", incomingVector.z);\n\n    ROS_INFO(\"Outgoing vector\");\n    ROS_INFO(\"X = %F\", resultVector.x);\n    ROS_INFO(\"Y = %F\", resultVector.y);\n    ROS_INFO(\"Z = %F\", resultVector.z);\n*\/\n    return incomingVector;\n\n}\n\nvoid FlightController::startProgram() {\n    if (!started) {\n        ROS_INFO(\"STARTING!\");\n        pthread_t thread;\n        myThreadData.controller = this;\n        pthread_create(&thread, NULL, startController, &myThreadData);\n        started = true;\n    }\n}\n\nvoid FlightController::resetProgram(){\n    ROS_INFO(\"MANUEL RESET!\");\n    reset();\n}\n\nvoid FlightController::abortProgram(){\n    ROS_INFO(\"MANUEL ABORT!\");\n    land();\n}\n\nvoid* startNavdata(void *thread_arg){\n    struct thread_data *thread_data;\n    thread_data = (struct thread_data *) thread_arg;\n\n\n    thread_data->navData->run(thread_data->n, thread_data->spinner);\n    pthread_exit(NULL);\n}\n\nvoid* startCV(void *thread_arg) {\n    struct thread_data *thread_data;\n    thread_data = (struct thread_data *) thread_arg;\n\n    thread_data->cvHandler->run();\n    pthread_exit(NULL);\n}\n\nvoid* startController(void *thread_arg){\n    struct thread_data *thread_data;\n    thread_data = (struct thread_data *) thread_arg;\n\n    thread_data->controller->run();\n    pthread_exit(NULL);\n}<commit_msg>formatting<commit_after>\/\/\n\/\/ Created by mathias on 6\/4\/16.\n\/\/\n\n#include \"FlightController.h\"\n\n#define DEBUG 1\n\nvoid* startNavdata(void *thread_args);\nvoid* startCV(void *thread_args);\nvoid* startController(void *thread_arg);\n\nstruct thread_data{\n    Nav *navData;\n    CV_Handler *cvHandler;\n    FlightController *controller;\n    ros::MultiThreadedSpinner spinner;\n    ros::NodeHandle *n;\n} myThreadData;\n\nFlightController::FlightController(){\n    baseSpeed = 0.1;\n    LOOP_RATE = 0;\n    takeoff_time = 3;\n    cmd.linear.x = 0.0;\n    cmd.linear.y = 0.0;\n    cmd.linear.z = 0.0;\n    cmd.angular.x = 0.0;\n    cmd.angular.y = 0.0;\n    cmd.angular.z = 0.0;\n    straightFlight = false;\n}\n\nFlightController::FlightController(int loopRate, ros::NodeHandle *nh, ros::MultiThreadedSpinner spinner) {\n    baseSpeed = 0.1;\n    LOOP_RATE = loopRate;\n    takeoff_time = 3;\n    straightFlight = false;\n    pub_land = nh->advertise<std_msgs::Empty>(\"\/ardrone\/land\", 1);\n    pub_takeoff = nh->advertise<std_msgs::Empty>(\"\/ardrone\/takeoff\", 1);\n    pub_control = nh->advertise<geometry_msgs::Twist>(\"cmd_vel\", 1);\n    pub_reset = nh->advertise<std_msgs::Empty>(\"\/ardrone\/reset\", 1);\n\n    precision = 50;\n    maxSpeed = 0.5;\n\n    cvHandler = new CV_Handler();\n\n    myThreadData.cvHandler = cvHandler;\n    navData = new Nav();\n    myThreadData.navData = navData;\n    myThreadData.spinner = spinner;\n    myThreadData.n = nh;\n\n    pthread_t threads[2];\n    pthread_create(&threads[0], NULL, startCV, &myThreadData);\n    pthread_create(&threads[1], NULL, startNavdata, &myThreadData);\n\n\n    cmd.linear.x = 0.0;\n    cmd.linear.y = 0.0;\n    cmd.linear.z = 0.0;\n    cmd.angular.x = 0.0;\n    cmd.angular.y = 0.0;\n    cmd.angular.z = 0.0;\n}\n\n\/\/ Destructor\nFlightController::~FlightController() {\n    delete(cvHandler);\n}\n\nvoid FlightController::run(){\n    Route myRoute;\n    myRoute.initRoute(true);\n\n\n    ros::Rate loop_rate(LOOP_RATE);\n    setStraightFlight(true);\n\n    while (ros::ok()) {\n\n        takeOff();\n        ROS_INFO(\"BEFORE TAKEOFF\");\n        while (!myRoute.hasAllBeenVisited()) {\n            ROS_INFO(\"HI THERE\");\n            Command currentCommand = myRoute.nextCommand();\n\n            if (currentCommand.commandType == Command::goTo) {\n                goToWaypoint(currentCommand);\n            } else if (currentCommand.commandType == Command::hover) {\n                hover(currentCommand.timeToHover);\n            } else if (currentCommand.commandType == Command::turn) {\n               \/\/   urnDrone(currentCommand.degrees);\n            }\n        }\n\n        land();\n\n        break;\n    }\n\n\n\n    return;\n}\n\nvoid FlightController::goToWaypoint(Command newWaypoint) {\n    double dx = newWaypoint.x - navData->position.x;\n    double dy = newWaypoint.y - navData->position.y;\n    double dz = newWaypoint.z - navData->position.z;\n\n\n\n    bool moved = false;\n\n    while(abs(dz) > precision){\n        cmd.linear.z = getSpeed(dz);\n\n        pub_control.publish(cmd);\n        dz = newWaypoint.z - navData->position.z;\n\n#ifdef DEBUG\n        ROS_INFO(\"dz = %F\", dz);\n#endif\n        ros::Rate(LOOP_RATE).sleep();\n        moved = true;\n    }\n\n    if(moved)\n        hover(1);\n\n    moved = false;\n    if (!straightFlight) {\n        \/\/ TODO decide if this should be implemented or not\n    } else{\n        while(abs(dx) > precision){\n            cmd.linear.x = getSpeed(dx);\n\n            pub_control.publish(cmd);\n            dx = newWaypoint.x - navData->position.x;\n\n        #ifdef DEBUG\n            ROS_INFO(\"newpoint = %F\", newWaypoint.x);\n            ROS_INFO(\"navData = %F\", navData->position.x);\n            ROS_INFO(\"dx = %F\", dx);\n            ROS_INFO(\"Speed = %F\", cmd.linear.x);\n            ROS_INFO(\"rotation = %F\", navData->rotation);\n        #endif\n            ros::Rate(LOOP_RATE).sleep();\n            moved = true;\n        }\n\n        if(moved)\n            hover(1);\n\n        moved = false;\n        while(abs(dy) > precision){\n\n            cmd.linear.y = getSpeed(dy);\n\n            pub_control.publish(cmd);\n            dy = newWaypoint.y - navData->position.y;\n\n        #ifdef DEBUG\n            ROS_INFO(\"dy = %F\", dy);\n        #endif\n            ros::Rate(LOOP_RATE).sleep();\n            moved = true;\n        }\n\n        if(moved)\n            hover(1);\n    }\n}\n\ndouble FlightController::getSpeed(double distance) {\n    double speed = baseSpeed*(distance\/150);\n    if(speed > maxSpeed)\n        speed = maxSpeed;\n\n    return speed;\n}\n\nvoid FlightController::turnTowardsPoint(Command waypoint) {\n\n    double target_angle = atan2(waypoint.y, waypoint.x); \/\/ angle towards waypoint position\n    double target_deg = target_angle * 180 \/ M_PI;\n\n    double ori_deg;\n\n    float offset = 0.5;\n    do{\n        ori_deg = navData->rotation;\n        if(ori_deg < 0)\n            ori_deg = 360 + ori_deg;\n\n    } while(ori_deg < target_deg-offset or ori_deg > target_deg+offset);\n}\n\ndouble FlightController::getRotationalSpeed(double target_deg, double ori_deg){\n    double dir; \/\/ direction\n    double rot_speed; \/\/ calculated rotational speed\n\n    double diff_deg = target_deg - ori_deg; \/\/ calculate difference\n\n    if ( diff_deg < 0 )\n        diff_deg = 360 + diff_deg;\n\n    printf(\"target_deg:\\t%6.2f deg\\n\", diff_deg);\n    \n    if (diff_deg < 180){\n        dir = -1;\n        printf(\"Turn left\");\n    } else{\n        dir = 1;\n        diff_deg = 360 -diff_deg;\n        printf(\"Turn right\");\n    }\n\n    rot_speed = (diff_deg*diff_deg)\/200; \/\/ speed to rotate with\n\n    if(rot_speed > 0.5)\n        rot_speed = 0.5;\n\n    rot_speed *= dir; \/\/ make sure to rotate the correct way\n\n    return rot_speed;\n}\n\nvoid FlightController::hover(int time){\n    cmd.linear.x = 0.0;\n    cmd.linear.y = 0.0;\n    cmd.linear.z = 0.0;\n    cmd.angular.x = 0.0;\n    cmd.angular.y = 0.0;\n    cmd.angular.z = 0.0;\n    ROS_INFO(\"HOVER\");\n\n    for(int i = 0; i < 3; i++)\n        pub_control.publish(cmd);\n}\n\nvoid FlightController::takeOff() {\n\n    std_msgs::Empty empty_msg;\n    pub_takeoff.publish(empty_msg);\n\n    for(int i = 0; i < takeoff_time*LOOP_RATE; i++){\n        ros::Rate(LOOP_RATE).sleep();\n    }\n\n    hover(1);\n}\n\nvoid FlightController::land() {\n    std_msgs::Empty empty_msg;\n    pub_land.publish(empty_msg);\n\n    for (int j = 0; j < LOOP_RATE; j++) {\n        ros::Rate(LOOP_RATE).sleep();\n    }\n}\n\nvoid FlightController::reset(){\n    std_msgs::Empty empty_msg;\n    pub_reset.publish(empty_msg);\n}\n\nvoid FlightController::setStraightFlight(bool newState) {\n    straightFlight = newState;\n}\n\nMyVector FlightController::transformCoordinates(MyVector incomingVector) {\n   \/* MyVector rotationMatrix[3];\n    rotationMatrix[0] = MyVector(cos(rotation), -sin(rotation), 0);\n    rotationMatrix[1] = MyVector(sin(rotation), cos(rotation), 0);\n    rotationMatrix[2] = MyVector(0, 0, 1);\n\n    MyVector tempVector(incomingVector.x-navData->position.x, incomingVector.y-navData->position.y, incomingVector.z-navData->position.z);\n\n    MyVector resultVector(rotationMatrix[0].x*tempVector.x+rotationMatrix[0].y*tempVector.y+rotationMatrix[0].z*tempVector.z,\n                        rotationMatrix[1].x*tempVector.x+rotationMatrix[1].y*tempVector.y+rotationMatrix[1].z*tempVector.z,\n                        rotationMatrix[2].x*tempVector.x+rotationMatrix[2].y*tempVector.y+rotationMatrix[2].z*tempVector.z);\n\n\n    resultVector.x += navData->position.x;\n    resultVector.y += navData->position.y;\n    resultVector.z += navData->position.z;\n\n    ROS_INFO(\"Incoming vector;\");\n    ROS_INFO(\"X = %F\", incomingVector.x);\n    ROS_INFO(\"Y = %F\", incomingVector.y);\n    ROS_INFO(\"Z = %F\", incomingVector.z);\n\n    ROS_INFO(\"Outgoing vector\");\n    ROS_INFO(\"X = %F\", resultVector.x);\n    ROS_INFO(\"Y = %F\", resultVector.y);\n    ROS_INFO(\"Z = %F\", resultVector.z);\n*\/\n    return incomingVector;\n\n}\n\nvoid FlightController::startProgram() {\n    if (!started) {\n        ROS_INFO(\"STARTING!\");\n        pthread_t thread;\n        myThreadData.controller = this;\n        pthread_create(&thread, NULL, startController, &myThreadData);\n        started = true;\n    }\n}\n\nvoid FlightController::resetProgram(){\n    ROS_INFO(\"MANUEL RESET!\");\n    reset();\n}\n\nvoid FlightController::abortProgram(){\n    ROS_INFO(\"MANUEL ABORT!\");\n    land();\n}\n\nvoid* startNavdata(void *thread_arg){\n    struct thread_data *thread_data;\n    thread_data = (struct thread_data *) thread_arg;\n\n\n    thread_data->navData->run(thread_data->n, thread_data->spinner);\n    pthread_exit(NULL);\n}\n\nvoid* startCV(void *thread_arg) {\n    struct thread_data *thread_data;\n    thread_data = (struct thread_data *) thread_arg;\n\n    thread_data->cvHandler->run();\n    pthread_exit(NULL);\n}\n\nvoid* startController(void *thread_arg){\n    struct thread_data *thread_data;\n    thread_data = (struct thread_data *) thread_arg;\n\n    thread_data->controller->run();\n    pthread_exit(NULL);\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#include \"loader-png.h\"\n\n#include <cstring>\n#include <cstdlib>\n\n#include <zlib.h>\n#include <png.h>\n\n#include <dali\/integration-api\/bitmap.h>\n#include <dali\/integration-api\/debug.h>\n#include <dali\/public-api\/images\/image.h>\n#include \"dali\/public-api\/math\/math-utils.h\"\n#include \"dali\/public-api\/math\/vector2.h\"\n#include \"platform-capabilities.h\"\n\nnamespace Dali\n{\n\nusing Integration::Bitmap;\nusing Dali::Integration::PixelBuffer;\n\nnamespace TizenPlatform\n{\n\nnamespace\n{\n\n\/\/ simple class to enforce clean-up of PNG structures\nstruct auto_png\n{\n  auto_png(png_structp& _png, png_infop& _info)\n  : png(_png),\n    info(_info)\n  {\n  }\n\n  ~auto_png()\n  {\n    if(NULL != png)\n    {\n      png_destroy_read_struct(&png, &info, NULL);\n    }\n  }\n\n  png_structp& png;\n  png_infop& info;\n}; \/\/ struct auto_png;\n\nbool LoadPngHeader(FILE *fp, unsigned int &width, unsigned int &height, png_structp &png, png_infop &info)\n{\n  png_byte header[8] = { 0 };\n\n  \/\/ Check header to see if it is a PNG file\n  size_t size = fread(header, 1, 8, fp);\n  if(size != 8)\n  {\n    return false;\n  }\n\n  if(png_sig_cmp(header, 0, 8))\n  {\n    return false;\n  }\n\n  png = png_create_read_struct(PNG_LIBPNG_VER_STRING, NULL, NULL, NULL);\n\n  if(!png)\n  {\n    DALI_LOG_WARNING(\"Can't create PNG read structure\\n\");\n    return false;\n  }\n\n  info = png_create_info_struct(png);\n  if(!info)\n  {\n    DALI_LOG_WARNING(\"png_create_info_struct failed\\n\");\n    return false;\n  }\n\n  png_set_expand(png);\n\n  if(setjmp(png_jmpbuf(png)))\n  {\n    DALI_LOG_WARNING(\"error during png_init_io\\n\");\n    return false;\n  }\n\n  png_init_io(png, fp);\n  png_set_sig_bytes(png, 8);\n\n  \/\/ read image info\n  png_read_info(png, info);\n\n  \/\/ dimensions\n  width = png_get_image_width(png, info);\n  height = png_get_image_height(png, info);\n\n  return true;\n}\n\n} \/\/ namespace - anonymous\n\nbool LoadPngHeader( const ImageLoader::Input& input, unsigned int& width, unsigned int& height )\n{\n  png_structp png = NULL;\n  png_infop info = NULL;\n  auto_png autoPng(png, info);\n\n  bool success = LoadPngHeader( input.file, width, height, png, info );\n\n  return success;\n}\n\nbool LoadBitmapFromPng( const ResourceLoadingClient& client, const ImageLoader::Input& input, Integration::Bitmap& bitmap )\n{\n  png_structp png = NULL;\n  png_infop info = NULL;\n  auto_png autoPng(png, info);\n\n  \/\/\/ @todo: consider parameters\n  unsigned int y;\n  unsigned int width, height;\n  unsigned char *pixels;\n  png_bytep *rows;\n  unsigned int bpp = 0; \/\/ bytes per pixel\n  bool valid = false;\n\n  \/\/ Load info from the header\n  if( !LoadPngHeader( input.file, width, height, png, info ) )\n  {\n    return false;\n  }\n\n  Pixel::Format pixelFormat = Pixel::RGBA8888;\n\n  \/\/ decide pixel format\n  unsigned int colordepth = png_get_bit_depth(png, info);\n\n  \/\/ Ask PNGLib to convert high precision images into something we can use:\n  if (colordepth == 16)\n  {\n    png_set_strip_16(png);\n    colordepth = 8;\n  }\n\n  png_byte colortype = png_get_color_type(png, info);\n\n  if(colortype == PNG_COLOR_TYPE_GRAY)\n  {\n    switch( colordepth )\n    {\n      case 8:\n      {\n        pixelFormat = Pixel::L8;\n        valid = true;\n        break;\n      }\n      default:\n      {\n        break;\n      }\n    }\n  }\n  else if(colortype == PNG_COLOR_TYPE_GRAY_ALPHA)\n  {\n    switch(colordepth)\n    {\n      case 8:\n      {\n        pixelFormat = Pixel::LA88;\n        valid = true;\n        break;\n      }\n      default:\n      {\n        break;\n      }\n    }\n  }\n  else if(colortype == PNG_COLOR_TYPE_RGB )\n  {\n    switch(colordepth)\n    {\n      case 8:\n      {\n        pixelFormat = Pixel::RGB888;\n        valid = true;\n        break;\n      }\n      case 5:      \/\/\/ @todo is this correct for RGB16 5-6-5 ?\n      {\n        pixelFormat = Pixel::RGB565;\n        valid = true;\n        break;\n      }\n      default:\n      {\n        break;\n      }\n    }\n  }\n  else if(colortype == PNG_COLOR_TYPE_RGBA)\n  {\n    switch(colordepth)\n    {\n      case 8:\n      {\n        pixelFormat = Pixel::RGBA8888;\n        valid = true;\n        break;\n      }\n      default:\n      {\n        break;\n      }\n    }\n  }\n  else if(colortype == PNG_COLOR_TYPE_PALETTE)\n  {\n    switch(colordepth)\n    {\n      case 2:\n      case 4:\n      case 8:\n      {\n        \/* Expand paletted or RGB images with transparency to full alpha channels\n         * so the data will be available as RGBA quartets. PNG_INFO_tRNS = 0x10\n         *\/\n        if(png_get_valid(png, info, PNG_INFO_tRNS) == 0x10)\n        {\n          pixelFormat = Pixel::RGBA8888;\n          valid = true;\n        }\n        else\n        {\n          pixelFormat = Pixel::RGB888;\n          png_set_packing(png);\n          png_set_packswap(png);\n          png_set_palette_to_rgb(png);\n          valid = true;\n        }\n        break;\n      }\n      default:\n      {\n        break;\n      }\n    }\n  }\n\n  if( !valid )\n  {\n    DALI_LOG_WARNING( \"Unsupported png format\\n\" );\n    return false;\n  }\n\n  \/\/ bytes per pixel\n  bpp = Pixel::GetBytesPerPixel(pixelFormat);\n\n  png_read_update_info(png, info);\n\n  if(setjmp(png_jmpbuf(png)))\n  {\n    DALI_LOG_WARNING(\"error during png_read_image\\n\");\n    return false;\n  }\n\n  unsigned int rowBytes = png_get_rowbytes(png, info);\n\n  unsigned int bufferWidth   = GetTextureDimension(width);\n  unsigned int bufferHeight  = GetTextureDimension(height);\n  unsigned int stride        = bufferWidth*bpp;\n\n  \/\/ not sure if this ever happens\n  if( rowBytes > stride )\n  {\n    stride = GetTextureDimension(rowBytes);\n    bufferWidth = stride \/ bpp;\n  }\n\n  \/\/ decode the whole image into bitmap buffer\n  pixels = bitmap.GetPackedPixelsProfile()->ReserveBuffer(pixelFormat, width, height, bufferWidth, bufferHeight);\n\n  DALI_ASSERT_DEBUG(pixels);\n  rows = (png_bytep*) malloc(sizeof(png_bytep) * height);\n  for(y=0; y<height; y++)\n  {\n    rows[y] = (png_byte*) (pixels + y * stride);\n  }\n\n  \/\/ decode image\n  png_read_image(png, rows);\n\n  free(rows);\n\n  return true;\n}\n\n\/\/ simple class to enforce clean-up of PNG structures\nstruct AutoPngWrite\n{\n  AutoPngWrite(png_structp& _png, png_infop& _info)\n  : png(_png),\n    info(_info)\n  {\n    DALI_ASSERT_DEBUG(&_png != 0 && &_info != 0);\n  }\n\n  ~AutoPngWrite()\n  {\n    if(NULL != png)\n    {\n      png_destroy_write_struct(&png, &info);\n    }\n  }\n\n  png_structp& png;\n  png_infop& info;\n}; \/\/ struct AutoPngWrite;\n\nnamespace\n{\n  \/\/ Custom libpng write callbacks that buffer to a vector instead of a file:\n\n  \/**\n   * extern \"C\" linkage is used because this is a callback that we pass to a C\n   * library which is part of the underlying platform and so potentially compiled\n   * as C rather than C++.\n   * @see http:\/\/stackoverflow.com\/a\/2594222\n   * *\/\n  extern \"C\" void WriteData(png_structp png_ptr, png_bytep data, png_size_t length)\n  {\n    DALI_ASSERT_DEBUG(png_ptr && data);\n    if(!png_ptr || !data)\n    {\n      return;\n    }\n    \/\/ Make sure we don't try to propagate a C++ exception up the call stack of a pure C library:\n    try\n    {\n      \/\/ Recover our buffer for writing into:\n      Vector<unsigned char>* const encoded_img = static_cast< Vector<unsigned char>* >( png_get_io_ptr(png_ptr) );\n      if(encoded_img)\n      {\n        const Vector<unsigned char>::SizeType bufferSize = encoded_img->Count();\n        encoded_img->Reserve( bufferSize + length ); \/\/< Can throw OOM.\n        unsigned char* const bufferBack = encoded_img->Begin() + bufferSize;\n        memcpy(bufferBack, data, length);\n      }\n      else\n      {\n        DALI_LOG_ERROR(\"PNG buffer for write to memory was passed from libpng as null.\");\n      }\n    }\n    catch(...)\n    {\n      DALI_LOG_ERROR(\"C++ Exception caught\");\n    }\n  }\n\n  \/** Override the flush with a NOP to prevent libpng trying cstdlib file io. *\/\n  extern \"C\" void FlushData(png_structp png_ptr)\n  {\n#ifdef DEBUG_ENABLED\n    Debug::LogMessage(Debug::DebugInfo, \"PNG Flush\");\n#endif \/\/ DEBUG_ENABLED\n  }\n}\n\n\/**\n * Potential improvements:\n * 1. Detect <= 256 colours and write in palette mode.\n * 2. Detect grayscale (will early-out quickly for colour images).\n * 3. Store colour space \/ gamma correction info related to the device screen?\n *    http:\/\/www.libpng.org\/pub\/png\/book\/chapter10.html\n * 4. Refactor with callers to write straight through to disk and save keeping a big buffer around.\n * 5. Prealloc buffer (reserve) to input size \/ <A number greater than 2 (expexcted few realloc but without using lots of memory) | 1 (expected zero reallocs but using a lot of memory)>.\n * 6. Set the modification time with png_set_tIME(png_ptr, info_ptr, mod_time);\n * 7. If caller asks for no compression, bypass libpng and blat raw data to\n *    disk, topped and tailed with header\/tail blocks.\n *\/\nbool EncodeToPng( const unsigned char* const pixelBuffer, Vector<unsigned char>& encodedPixels, std::size_t width, std::size_t height, Pixel::Format pixelFormat )\n{\n  \/\/ Translate pixel format enum:\n  int pngPixelFormat = -1;\n  unsigned pixelBytes = 0;\n  bool rgbaOrder = true;\n\n  \/\/ Account for RGB versus BGR and presence of alpha in input pixels:\n  switch( pixelFormat )\n  {\n    case Pixel::RGB888:\n    {\n      pngPixelFormat = PNG_COLOR_TYPE_RGB;\n      pixelBytes = 3;\n      break;\n    }\n    case Pixel::BGRA8888:\n    {\n      rgbaOrder = false;\n      \/\/\/! No break: fall through:\n    }\n    case Pixel::RGBA8888:\n    {\n      pngPixelFormat = PNG_COLOR_TYPE_RGB_ALPHA;\n      pixelBytes = 4;\n      break;\n    }\n    default:\n    {\n      DALI_LOG_ERROR( \"Unsupported pixel format for encoding to PNG.\" );\n      return false;\n    }\n  }\n\n  const int interlace = PNG_INTERLACE_NONE;\n\n  png_structp png_ptr = png_create_write_struct(PNG_LIBPNG_VER_STRING, NULL, NULL, NULL);\n  if(!png_ptr)\n  {\n    return false;\n  }\n  \/* Allocate\/initialize the image information data.  REQUIRED *\/\n  png_infop info_ptr = png_create_info_struct( png_ptr );\n  if(!info_ptr)\n  {\n    png_destroy_write_struct(&png_ptr, NULL);\n    return false;\n  }\n\n  \/* Set error handling.  REQUIRED if you aren't supplying your own\n   * error handling functions in the png_create_write_struct() call.\n   *\/\n  if(setjmp(png_jmpbuf(png_ptr)))\n  {\n    png_destroy_write_struct(&png_ptr, &info_ptr);\n    return false;\n  }\n\n  \/\/ Since we are going to write to memory instead of a file, lets provide\n  \/\/ libpng with a custom write function and ask it to pass back our\n  \/\/ Vector buffer each time it calls back to flush data to \"file\":\n  png_set_write_fn(png_ptr, &encodedPixels, WriteData, FlushData);\n\n  \/\/ png_set_compression_level( png_ptr, Z_BEST_COMPRESSION);\n  png_set_compression_level(png_ptr, Z_BEST_SPEED);\n  \/\/ png_set_compression_level( png_ptr, Z_NO_COMPRESSION); \/\/! We could just generate png directly without libpng in this case.\n\n  \/\/ Explicitly limit the number of filters used per scanline to speed us up:\n  \/\/ png_set_filter(png_ptr, 0, PNG_FILTER_NONE); \/\/\/!ToDo: Try this once baseline profile is in place.\n       \/\/ PNG_FILTER_SUB   |\n       \/\/ PNG_FILTER_UP    |\n       \/\/ PNG_FILTER_AVE   |\n       \/\/ PNG_FILTER_PAETH |\n       \/\/ PNG_ALL_FILTERS);\n  \/\/ Play with Zlib parameters in optimisation phase:\n    \/\/ png_set_compression_mem_level(png_ptr, 8);\n    \/\/ png_set_compression_strategy(png_ptr,\n        \/\/ Z_DEFAULT_STRATEGY);\n    \/\/ png_set_compression_window_bits(png_ptr, 15);\n    \/\/ png_set_compression_method(png_ptr, 8);\n    \/\/ png_set_compression_buffer_size(png_ptr, 8192)\n\n  \/\/ Let lib_png know if the pixel bytes are in BGR(A) order:\n  if(!rgbaOrder)\n  {\n    png_set_bgr( png_ptr );\n  }\n\n  \/\/ Set the image information:\n  png_set_IHDR(png_ptr, info_ptr, width, height, 8,\n     pngPixelFormat, interlace,\n     PNG_COMPRESSION_TYPE_BASE, PNG_FILTER_TYPE_BASE);\n\n  \/\/ Start to output the PNG data to our buffer:\n  png_write_info(png_ptr, info_ptr);\n\n  \/\/ Walk the rows:\n  const unsigned row_step = width * pixelBytes;\n  png_bytep row_ptr = const_cast<png_bytep>(pixelBuffer);\n  const png_bytep row_end = row_ptr + height * row_step;\n  for(; row_ptr < row_end; row_ptr += row_step)\n  {\n    png_write_row(png_ptr, row_ptr);\n  }\n\n  \/* It is REQUIRED to call this to finish writing the rest of the file *\/\n  png_write_end(png_ptr, info_ptr);\n  \/* Clean up after the write, and free any memory allocated *\/\n  png_destroy_write_struct(&png_ptr, &info_ptr);\n  return true;\n}\n\n} \/\/ namespace TizenPlatform\n\n} \/\/ namespace Dali\n<commit_msg>Fix to support PNG image which is indexed color type and depth 1<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#include \"loader-png.h\"\n\n#include <cstring>\n#include <cstdlib>\n\n#include <zlib.h>\n#include <png.h>\n\n#include <dali\/integration-api\/bitmap.h>\n#include <dali\/integration-api\/debug.h>\n#include <dali\/public-api\/images\/image.h>\n#include \"dali\/public-api\/math\/math-utils.h\"\n#include \"dali\/public-api\/math\/vector2.h\"\n#include \"platform-capabilities.h\"\n\nnamespace Dali\n{\n\nusing Integration::Bitmap;\nusing Dali::Integration::PixelBuffer;\n\nnamespace TizenPlatform\n{\n\nnamespace\n{\n\n\/\/ simple class to enforce clean-up of PNG structures\nstruct auto_png\n{\n  auto_png(png_structp& _png, png_infop& _info)\n  : png(_png),\n    info(_info)\n  {\n  }\n\n  ~auto_png()\n  {\n    if(NULL != png)\n    {\n      png_destroy_read_struct(&png, &info, NULL);\n    }\n  }\n\n  png_structp& png;\n  png_infop& info;\n}; \/\/ struct auto_png;\n\nbool LoadPngHeader(FILE *fp, unsigned int &width, unsigned int &height, png_structp &png, png_infop &info)\n{\n  png_byte header[8] = { 0 };\n\n  \/\/ Check header to see if it is a PNG file\n  size_t size = fread(header, 1, 8, fp);\n  if(size != 8)\n  {\n    return false;\n  }\n\n  if(png_sig_cmp(header, 0, 8))\n  {\n    return false;\n  }\n\n  png = png_create_read_struct(PNG_LIBPNG_VER_STRING, NULL, NULL, NULL);\n\n  if(!png)\n  {\n    DALI_LOG_WARNING(\"Can't create PNG read structure\\n\");\n    return false;\n  }\n\n  info = png_create_info_struct(png);\n  if(!info)\n  {\n    DALI_LOG_WARNING(\"png_create_info_struct failed\\n\");\n    return false;\n  }\n\n  png_set_expand(png);\n\n  if(setjmp(png_jmpbuf(png)))\n  {\n    DALI_LOG_WARNING(\"error during png_init_io\\n\");\n    return false;\n  }\n\n  png_init_io(png, fp);\n  png_set_sig_bytes(png, 8);\n\n  \/\/ read image info\n  png_read_info(png, info);\n\n  \/\/ dimensions\n  width = png_get_image_width(png, info);\n  height = png_get_image_height(png, info);\n\n  return true;\n}\n\n} \/\/ namespace - anonymous\n\nbool LoadPngHeader( const ImageLoader::Input& input, unsigned int& width, unsigned int& height )\n{\n  png_structp png = NULL;\n  png_infop info = NULL;\n  auto_png autoPng(png, info);\n\n  bool success = LoadPngHeader( input.file, width, height, png, info );\n\n  return success;\n}\n\nbool LoadBitmapFromPng( const ResourceLoadingClient& client, const ImageLoader::Input& input, Integration::Bitmap& bitmap )\n{\n  png_structp png = NULL;\n  png_infop info = NULL;\n  auto_png autoPng(png, info);\n\n  \/\/\/ @todo: consider parameters\n  unsigned int y;\n  unsigned int width, height;\n  unsigned char *pixels;\n  png_bytep *rows;\n  unsigned int bpp = 0; \/\/ bytes per pixel\n  bool valid = false;\n\n  \/\/ Load info from the header\n  if( !LoadPngHeader( input.file, width, height, png, info ) )\n  {\n    return false;\n  }\n\n  Pixel::Format pixelFormat = Pixel::RGBA8888;\n\n  \/\/ decide pixel format\n  unsigned int colordepth = png_get_bit_depth(png, info);\n\n  \/\/ Ask PNGLib to convert high precision images into something we can use:\n  if (colordepth == 16)\n  {\n    png_set_strip_16(png);\n    colordepth = 8;\n  }\n\n  png_byte colortype = png_get_color_type(png, info);\n\n  if(colortype == PNG_COLOR_TYPE_GRAY)\n  {\n    switch( colordepth )\n    {\n      case 8:\n      {\n        pixelFormat = Pixel::L8;\n        valid = true;\n        break;\n      }\n      default:\n      {\n        break;\n      }\n    }\n  }\n  else if(colortype == PNG_COLOR_TYPE_GRAY_ALPHA)\n  {\n    switch(colordepth)\n    {\n      case 8:\n      {\n        pixelFormat = Pixel::LA88;\n        valid = true;\n        break;\n      }\n      default:\n      {\n        break;\n      }\n    }\n  }\n  else if(colortype == PNG_COLOR_TYPE_RGB )\n  {\n    switch(colordepth)\n    {\n      case 8:\n      {\n        pixelFormat = Pixel::RGB888;\n        valid = true;\n        break;\n      }\n      case 5:      \/\/\/ @todo is this correct for RGB16 5-6-5 ?\n      {\n        pixelFormat = Pixel::RGB565;\n        valid = true;\n        break;\n      }\n      default:\n      {\n        break;\n      }\n    }\n  }\n  else if(colortype == PNG_COLOR_TYPE_RGBA)\n  {\n    switch(colordepth)\n    {\n      case 8:\n      {\n        pixelFormat = Pixel::RGBA8888;\n        valid = true;\n        break;\n      }\n      default:\n      {\n        break;\n      }\n    }\n  }\n  else if(colortype == PNG_COLOR_TYPE_PALETTE)\n  {\n    switch(colordepth)\n    {\n      case 1:\n      {\n        pixelFormat = Pixel::LA88;\n        valid = true;\n        break;\n      }\n\n      case 2:\n      case 4:\n      case 8:\n      {\n        \/* Expand paletted or RGB images with transparency to full alpha channels\n         * so the data will be available as RGBA quartets. PNG_INFO_tRNS = 0x10\n         *\/\n        if(png_get_valid(png, info, PNG_INFO_tRNS) == 0x10)\n        {\n          pixelFormat = Pixel::RGBA8888;\n          valid = true;\n        }\n        else\n        {\n          pixelFormat = Pixel::RGB888;\n          png_set_packing(png);\n          png_set_packswap(png);\n          png_set_palette_to_rgb(png);\n          valid = true;\n        }\n        break;\n      }\n      default:\n      {\n        break;\n      }\n    }\n  }\n\n  if( !valid )\n  {\n    DALI_LOG_WARNING( \"Unsupported png format\\n\" );\n    return false;\n  }\n\n  \/\/ bytes per pixel\n  bpp = Pixel::GetBytesPerPixel(pixelFormat);\n\n  png_read_update_info(png, info);\n\n  if(setjmp(png_jmpbuf(png)))\n  {\n    DALI_LOG_WARNING(\"error during png_read_image\\n\");\n    return false;\n  }\n\n  unsigned int rowBytes = png_get_rowbytes(png, info);\n\n  unsigned int bufferWidth   = GetTextureDimension(width);\n  unsigned int bufferHeight  = GetTextureDimension(height);\n  unsigned int stride        = bufferWidth*bpp;\n\n  \/\/ not sure if this ever happens\n  if( rowBytes > stride )\n  {\n    stride = GetTextureDimension(rowBytes);\n    bufferWidth = stride \/ bpp;\n  }\n\n  \/\/ decode the whole image into bitmap buffer\n  pixels = bitmap.GetPackedPixelsProfile()->ReserveBuffer(pixelFormat, width, height, bufferWidth, bufferHeight);\n\n  DALI_ASSERT_DEBUG(pixels);\n  rows = (png_bytep*) malloc(sizeof(png_bytep) * height);\n  for(y=0; y<height; y++)\n  {\n    rows[y] = (png_byte*) (pixels + y * stride);\n  }\n\n  \/\/ decode image\n  png_read_image(png, rows);\n\n  free(rows);\n\n  return true;\n}\n\n\/\/ simple class to enforce clean-up of PNG structures\nstruct AutoPngWrite\n{\n  AutoPngWrite(png_structp& _png, png_infop& _info)\n  : png(_png),\n    info(_info)\n  {\n    DALI_ASSERT_DEBUG(&_png != 0 && &_info != 0);\n  }\n\n  ~AutoPngWrite()\n  {\n    if(NULL != png)\n    {\n      png_destroy_write_struct(&png, &info);\n    }\n  }\n\n  png_structp& png;\n  png_infop& info;\n}; \/\/ struct AutoPngWrite;\n\nnamespace\n{\n  \/\/ Custom libpng write callbacks that buffer to a vector instead of a file:\n\n  \/**\n   * extern \"C\" linkage is used because this is a callback that we pass to a C\n   * library which is part of the underlying platform and so potentially compiled\n   * as C rather than C++.\n   * @see http:\/\/stackoverflow.com\/a\/2594222\n   * *\/\n  extern \"C\" void WriteData(png_structp png_ptr, png_bytep data, png_size_t length)\n  {\n    DALI_ASSERT_DEBUG(png_ptr && data);\n    if(!png_ptr || !data)\n    {\n      return;\n    }\n    \/\/ Make sure we don't try to propagate a C++ exception up the call stack of a pure C library:\n    try\n    {\n      \/\/ Recover our buffer for writing into:\n      Vector<unsigned char>* const encoded_img = static_cast< Vector<unsigned char>* >( png_get_io_ptr(png_ptr) );\n      if(encoded_img)\n      {\n        const Vector<unsigned char>::SizeType bufferSize = encoded_img->Count();\n        encoded_img->Reserve( bufferSize + length ); \/\/< Can throw OOM.\n        unsigned char* const bufferBack = encoded_img->Begin() + bufferSize;\n        memcpy(bufferBack, data, length);\n      }\n      else\n      {\n        DALI_LOG_ERROR(\"PNG buffer for write to memory was passed from libpng as null.\");\n      }\n    }\n    catch(...)\n    {\n      DALI_LOG_ERROR(\"C++ Exception caught\");\n    }\n  }\n\n  \/** Override the flush with a NOP to prevent libpng trying cstdlib file io. *\/\n  extern \"C\" void FlushData(png_structp png_ptr)\n  {\n#ifdef DEBUG_ENABLED\n    Debug::LogMessage(Debug::DebugInfo, \"PNG Flush\");\n#endif \/\/ DEBUG_ENABLED\n  }\n}\n\n\/**\n * Potential improvements:\n * 1. Detect <= 256 colours and write in palette mode.\n * 2. Detect grayscale (will early-out quickly for colour images).\n * 3. Store colour space \/ gamma correction info related to the device screen?\n *    http:\/\/www.libpng.org\/pub\/png\/book\/chapter10.html\n * 4. Refactor with callers to write straight through to disk and save keeping a big buffer around.\n * 5. Prealloc buffer (reserve) to input size \/ <A number greater than 2 (expexcted few realloc but without using lots of memory) | 1 (expected zero reallocs but using a lot of memory)>.\n * 6. Set the modification time with png_set_tIME(png_ptr, info_ptr, mod_time);\n * 7. If caller asks for no compression, bypass libpng and blat raw data to\n *    disk, topped and tailed with header\/tail blocks.\n *\/\nbool EncodeToPng( const unsigned char* const pixelBuffer, Vector<unsigned char>& encodedPixels, std::size_t width, std::size_t height, Pixel::Format pixelFormat )\n{\n  \/\/ Translate pixel format enum:\n  int pngPixelFormat = -1;\n  unsigned pixelBytes = 0;\n  bool rgbaOrder = true;\n\n  \/\/ Account for RGB versus BGR and presence of alpha in input pixels:\n  switch( pixelFormat )\n  {\n    case Pixel::RGB888:\n    {\n      pngPixelFormat = PNG_COLOR_TYPE_RGB;\n      pixelBytes = 3;\n      break;\n    }\n    case Pixel::BGRA8888:\n    {\n      rgbaOrder = false;\n      \/\/\/! No break: fall through:\n    }\n    case Pixel::RGBA8888:\n    {\n      pngPixelFormat = PNG_COLOR_TYPE_RGB_ALPHA;\n      pixelBytes = 4;\n      break;\n    }\n    default:\n    {\n      DALI_LOG_ERROR( \"Unsupported pixel format for encoding to PNG.\" );\n      return false;\n    }\n  }\n\n  const int interlace = PNG_INTERLACE_NONE;\n\n  png_structp png_ptr = png_create_write_struct(PNG_LIBPNG_VER_STRING, NULL, NULL, NULL);\n  if(!png_ptr)\n  {\n    return false;\n  }\n  \/* Allocate\/initialize the image information data.  REQUIRED *\/\n  png_infop info_ptr = png_create_info_struct( png_ptr );\n  if(!info_ptr)\n  {\n    png_destroy_write_struct(&png_ptr, NULL);\n    return false;\n  }\n\n  \/* Set error handling.  REQUIRED if you aren't supplying your own\n   * error handling functions in the png_create_write_struct() call.\n   *\/\n  if(setjmp(png_jmpbuf(png_ptr)))\n  {\n    png_destroy_write_struct(&png_ptr, &info_ptr);\n    return false;\n  }\n\n  \/\/ Since we are going to write to memory instead of a file, lets provide\n  \/\/ libpng with a custom write function and ask it to pass back our\n  \/\/ Vector buffer each time it calls back to flush data to \"file\":\n  png_set_write_fn(png_ptr, &encodedPixels, WriteData, FlushData);\n\n  \/\/ png_set_compression_level( png_ptr, Z_BEST_COMPRESSION);\n  png_set_compression_level(png_ptr, Z_BEST_SPEED);\n  \/\/ png_set_compression_level( png_ptr, Z_NO_COMPRESSION); \/\/! We could just generate png directly without libpng in this case.\n\n  \/\/ Explicitly limit the number of filters used per scanline to speed us up:\n  \/\/ png_set_filter(png_ptr, 0, PNG_FILTER_NONE); \/\/\/!ToDo: Try this once baseline profile is in place.\n       \/\/ PNG_FILTER_SUB   |\n       \/\/ PNG_FILTER_UP    |\n       \/\/ PNG_FILTER_AVE   |\n       \/\/ PNG_FILTER_PAETH |\n       \/\/ PNG_ALL_FILTERS);\n  \/\/ Play with Zlib parameters in optimisation phase:\n    \/\/ png_set_compression_mem_level(png_ptr, 8);\n    \/\/ png_set_compression_strategy(png_ptr,\n        \/\/ Z_DEFAULT_STRATEGY);\n    \/\/ png_set_compression_window_bits(png_ptr, 15);\n    \/\/ png_set_compression_method(png_ptr, 8);\n    \/\/ png_set_compression_buffer_size(png_ptr, 8192)\n\n  \/\/ Let lib_png know if the pixel bytes are in BGR(A) order:\n  if(!rgbaOrder)\n  {\n    png_set_bgr( png_ptr );\n  }\n\n  \/\/ Set the image information:\n  png_set_IHDR(png_ptr, info_ptr, width, height, 8,\n     pngPixelFormat, interlace,\n     PNG_COMPRESSION_TYPE_BASE, PNG_FILTER_TYPE_BASE);\n\n  \/\/ Start to output the PNG data to our buffer:\n  png_write_info(png_ptr, info_ptr);\n\n  \/\/ Walk the rows:\n  const unsigned row_step = width * pixelBytes;\n  png_bytep row_ptr = const_cast<png_bytep>(pixelBuffer);\n  const png_bytep row_end = row_ptr + height * row_step;\n  for(; row_ptr < row_end; row_ptr += row_step)\n  {\n    png_write_row(png_ptr, row_ptr);\n  }\n\n  \/* It is REQUIRED to call this to finish writing the rest of the file *\/\n  png_write_end(png_ptr, info_ptr);\n  \/* Clean up after the write, and free any memory allocated *\/\n  png_destroy_write_struct(&png_ptr, &info_ptr);\n  return true;\n}\n\n} \/\/ namespace TizenPlatform\n\n} \/\/ namespace Dali\n<|endoftext|>"}
{"text":"<commit_before>#include <sstream>\n#include <iomanip>\n\n#include \"ExpressionTree.h\"\n\nExpressionTree::ExpressionTree()\n{ }\n\nExpressionTree::ExpressionTree(const ExpressionTree&)\n{ }\n\nExpressionTree::~ExpressionTree()\n{ }\n\nUnaryOperator::UnaryOperator(ExpressionTree* child)\n\t: m_tree(child)\n{\n\tif (!child) \n\t{\n\t\tdelete m_tree;\n\n\t\tthrow ExpressionTreeError(\"Operator can't operate\");\n\t}\n}\n\nUnaryOperator::UnaryOperator(const UnaryOperator& operatorNode)\n\t: ExpressionTree(operatorNode), m_tree(operatorNode.m_tree->Clone())\n{ }\n\nUnaryOperator::~UnaryOperator()\n{\n\tdelete m_tree;\n}\n\nstd::string UnaryOperator::GetPostfix() const\n{\n\treturn (m_tree->GetPostfix() + ToString() + \" \");\n}\n\nstd::string UnaryOperator::GetInfix(bool isFirst) const\n{\n\treturn ((isFirst) ? \"\" : \"(\") + \n\t\tToString() + m_tree->GetInfix() + \" \" +\n\t\t((isFirst) ? \"\" : \")\");\n}\n\nvoid UnaryOperator::Print(std::ostream& os, int depth) const\n{\n\tm_tree->Print(os, depth + 3);\n\n\tos << std::setw(depth + 2) << \"\/\" << std::endl\n\t\t<< std::setw(depth) << ToString() << std::endl\n\t\t<< std::setw(depth + 2) << \"\\\\\" << std::endl;\n}\n\nBinaryOperator::BinaryOperator(ExpressionTree* left, ExpressionTree* right)\n\t: m_leftTree(left), m_rightTree(right)\n{\n\tif (!(left && right)) \n\t{\n\t\tdelete m_leftTree;\n\t\tdelete m_rightTree;\n\t\tthrow ExpressionTreeError(\"Operator can't operate\");\n\t}\n}\n\nBinaryOperator::BinaryOperator(const BinaryOperator& operatorNode)\n\t: ExpressionTree(operatorNode), m_leftTree(operatorNode.m_leftTree->Clone()), m_rightTree(operatorNode.m_rightTree->Clone())\n{ }\n\nBinaryOperator::~BinaryOperator()\n{\n\tdelete m_leftTree;\n\tdelete m_rightTree;\n}\n\nstd::string BinaryOperator::GetPostfix() const\n{\n\treturn (m_leftTree->GetPostfix() + m_rightTree->GetPostfix() + ToString() + \" \");\n}\n\nstd::string BinaryOperator::GetInfix(bool isFirst) const\n{\n\treturn ((isFirst) ? \"\" : \"(\") + \n\t\tm_leftTree->GetInfix() + \" \" + ToString() + \" \" + m_rightTree->GetInfix() +\n\t\t((isFirst) ? \"\" : \")\");\n}\n\nvoid BinaryOperator::Print(std::ostream& os, int depth) const\n{\n\tm_rightTree->Print(os, depth + 3);\n\n\tos << std::setw(depth + 2) << \"\/\" << std::endl\n\t\t<< std::setw(depth) << ToString() << std::endl\n\t\t<< std::setw(depth + 2) << \"\\\\\" << std::endl;\n\n\tm_leftTree->Print(os, depth + 3);\n}\n\nOperand::Operand()\n{ }\n\nOperand::Operand(const Operand& operandNode) \n\t: ExpressionTree(operandNode)\n{ }\n\nstd::string Operand::GetPostfix() const\n{\n\treturn (ToString() + \" \");\n}\n\nstd::string Operand::GetInfix(bool) const\n{\n\treturn ToString();\n}\n\nvoid Operand::Print(std::ostream& os, int depth) const\n{\n\tos << std::setw(depth) << ToString() << std::endl;\n}\n\nUnaryMinus::UnaryMinus(ExpressionTree* child)\n\t: UnaryOperator(child)\n{ }\n\nUnaryMinus::UnaryMinus(const UnaryMinus& minusNode)\n\t: UnaryOperator(minusNode)\n{ }\n\nExpressionTree* UnaryMinus::Clone() const\n{\n\treturn new UnaryMinus(*this);\n}\n\nstd::string UnaryMinus::ToString() const\n{\n\treturn \"-\";\n}\n\ndouble UnaryMinus::Evaluate() const\n{\n\treturn -1 * m_tree->Evaluate();\n}\n\nSine::Sine(ExpressionTree* child)\n\t: UnaryOperator(child)\n{ }\n\nSine::Sine(const Sine& sineNode)\n\t: UnaryOperator(sineNode)\n{ }\n\nExpressionTree* Sine::Clone() const\n{\n\treturn new Sine(*this);\n}\n\nstd::string Sine::ToString() const\n{\n\treturn \"sin\";\n}\n\ndouble Sine::Evaluate() const\n{\n\treturn std::sin(m_tree->Evaluate());\n}\n\nCosine::Cosine(ExpressionTree* child)\n\t: UnaryOperator(child)\n{ }\n\nCosine::Cosine(const Cosine& cosineNode)\n\t: UnaryOperator(cosineNode)\n{ }\n\nExpressionTree* Cosine::Clone() const\n{\n\treturn new Cosine(*this);\n}\n\nstd::string Cosine::ToString() const\n{\n\treturn \"cos\";\n}\n\ndouble Cosine::Evaluate() const\n{\n\treturn std::cos(m_tree->Evaluate());\n}\n\nTangent::Tangent(ExpressionTree* child)\n\t: UnaryOperator(child)\n{ }\n\nTangent::Tangent(const Tangent& tangentNode)\n\t: UnaryOperator(tangentNode)\n{ }\n\nExpressionTree* Tangent::Clone() const\n{\n\treturn new Tangent(*this);\n}\n\nstd::string Tangent::ToString() const\n{\n\treturn \"tan\";\n}\n\ndouble Tangent::Evaluate() const\n{\n\treturn std::tan(m_tree->Evaluate());\n}\n\nPlus::Plus(ExpressionTree* left, ExpressionTree* right)\n\t: BinaryOperator(left, right)\n{ }\n\nPlus::Plus(const Plus& plusNode)\n\t: BinaryOperator(plusNode)\n{ }\n\nExpressionTree* Plus::Clone() const\n{\n\treturn new Plus(*this);\n}\n\nstd::string Plus::ToString() const\n{\n\treturn \"+\";\n}\n\ndouble Plus::Evaluate() const\n{\n\treturn m_leftTree->Evaluate() + m_rightTree->Evaluate();\n}\n\nBinaryMinus::BinaryMinus(ExpressionTree* left, ExpressionTree* right)\n\t: BinaryOperator(left, right)\n{ }\n\nBinaryMinus::BinaryMinus(const BinaryMinus& minusNode)\n\t: BinaryOperator(minusNode)\n{ }\n\nExpressionTree* BinaryMinus::Clone() const\n{\n\treturn new BinaryMinus(*this);\n}\n\nstd::string BinaryMinus::ToString() const\n{\n\treturn \"-\";\n}\n\ndouble BinaryMinus::Evaluate() const\n{\n\treturn m_leftTree->Evaluate() - m_rightTree->Evaluate();\n}\n\nMultiply::Multiply(ExpressionTree* left, ExpressionTree* right)\n\t: BinaryOperator(left, right)\n{ }\n\nMultiply::Multiply(const Multiply& multiplyNode)\n\t: BinaryOperator(multiplyNode)\n{ }\n\nExpressionTree* Multiply::Clone() const\n{\n\treturn new Multiply(*this);\n}\n\nstd::string Multiply::ToString() const\n{\n\treturn \"*\";\n}\n\ndouble Multiply::Evaluate() const\n{\n\treturn m_leftTree->Evaluate() * m_rightTree->Evaluate();\n}\n\nDivide::Divide(ExpressionTree* left, ExpressionTree* right)\n\t: BinaryOperator(left, right)\n{ }\n\nDivide::Divide(const Divide& divideNode)\n\t: BinaryOperator(divideNode)\n{ }\n\nExpressionTree* Divide::Clone() const\n{\n\treturn new Divide(*this);\n}\n\nstd::string Divide::ToString() const\n{\n\treturn \"\/\";\n}\n\ndouble Divide::Evaluate() const\n{\n\tdouble tempEval = m_rightTree->Evaluate();\n\n\tif (tempEval == 0)\n\t{\n\t\tthrow ExpressionTreeError(\"Divide by 0\");\n\t}\n\n\treturn m_leftTree->Evaluate() \/ tempEval;\n}\n\nPower::Power(ExpressionTree* left, ExpressionTree* right)\n\t: BinaryOperator(left, right)\n{ }\n\nPower::Power(const Power& powerNode)\n\t: BinaryOperator(powerNode)\n{ }\n\nExpressionTree* Power::Clone() const\n{\n\treturn new Power(*this);\n}\n\nstd::string Power::ToString() const\n{\n\treturn \"^\";\n}\n\ndouble Power::Evaluate() const\n{\n\treturn pow(m_leftTree->Evaluate(), m_rightTree->Evaluate());\n}\n\nAssign::Assign(ExpressionTree* left, ExpressionTree* right, VariableTable& varTable)\n\t: BinaryOperator(left, right), m_varTable(varTable)\n{ }\n\nAssign::Assign(const Assign& assignNode)\n\t: BinaryOperator(assignNode), m_varTable(assignNode.m_varTable)\n{ }\n\nExpressionTree* Assign::Clone() const\n{\n\treturn new Assign(*this);\n}\n\nstd::string Assign::ToString() const\n{\n\treturn \"=\";\n}\n\nstd::string Assign::GetInfix(bool) const\n{\n\treturn m_leftTree->GetInfix(true) + \" \" + ToString() + \" \" + m_rightTree->GetInfix(true);\n}\n\ndouble Assign::Evaluate() const\n{\n\tdouble rightTreeValue = m_rightTree->Evaluate();\n\tVariable* varPointer = dynamic_cast<Variable*>(m_leftTree);\n\n\tif (varPointer)\n\t{\n\t\tif (m_varTable.Find(varPointer->ToString()))\n\t\t{\n\t\t\tvarPointer->SetValue(rightTreeValue);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_varTable.Insert(varPointer->ToString(), rightTreeValue);\n\t\t}\n\t}\n\telse\n\t{\n\t\tthrow ExpressionTreeError(\"Invalid Assign\");\n\t}\n\n\treturn rightTreeValue;\n}\n\nInteger::Integer(int value)\n\t: m_value(value)\n{ }\n\nInteger::Integer(const Integer& integerNode)\n\t: Operand(integerNode), m_value(integerNode.m_value)\n{ }\n\nstd::string Integer::ToString() const\n{\n\tstd::ostringstream oss;\n\toss << m_value;\n\treturn oss.str();\n}\n\nExpressionTree* Integer::Clone() const\n{\n\treturn new Integer(*this);\n}\n\ndouble Integer::Evaluate() const\n{\n\treturn m_value;\n}\n\nReal::Real(double value)\n\t: m_value(value)\n{ }\n\nReal::Real(const Real& realNode)\n\t: Operand(realNode), m_value(realNode.m_value)\n{ }\n\nstd::string Real::ToString() const\n{\n\tstd::ostringstream oss;\n\toss << m_value;\n\treturn oss.str();\n}\n\ndouble Real::Evaluate() const\n{\n\treturn m_value;\n}\n\nExpressionTree* Real::Clone() const\n{\n\treturn new Real(*this);\n}\n\nVariable::Variable(const std::string& token, VariableTable& varTable)\n\t: m_token(token), m_varTable(varTable)\n{ }\n\nVariable::Variable(const Variable& variableNode)\n\t: Operand(variableNode), m_token(variableNode.m_token), m_varTable(variableNode.m_varTable)\n{ }\n\ndouble Variable::Evaluate() const\n{\n\treturn GetValue();\n}\n\nExpressionTree* Variable::Clone() const\n{\n\treturn new Variable(*this);\n}\n\ndouble Variable::GetValue() const\n{\n\treturn m_varTable.GetValue(m_token);\n}\n\nvoid Variable::SetValue(const double& value)\n{\n\tm_varTable.SetValue(m_token, value);\n}\n\nstd::string Variable::ToString() const\n{\n\treturn m_token;\n}<commit_msg>Implement sine, cosine, tangent class<commit_after>#include <sstream>\n#include <iomanip>\n\n#include \"ExpressionTree.h\"\n\nExpressionTree::ExpressionTree()\n{ }\n\nExpressionTree::ExpressionTree(const ExpressionTree&)\n{ }\n\nExpressionTree::~ExpressionTree()\n{ }\n\nUnaryOperator::UnaryOperator(ExpressionTree* child)\n\t: m_tree(child)\n{\n\tif (!child) \n\t{\n\t\tdelete m_tree;\n\n\t\tthrow ExpressionTreeError(\"Operator can't operate\");\n\t}\n}\n\nUnaryOperator::UnaryOperator(const UnaryOperator& operatorNode)\n\t: ExpressionTree(operatorNode), m_tree(operatorNode.m_tree->Clone())\n{ }\n\nUnaryOperator::~UnaryOperator()\n{\n\tdelete m_tree;\n}\n\nstd::string UnaryOperator::GetPostfix() const\n{\n\treturn (m_tree->GetPostfix() + ToString() + \" \");\n}\n\nstd::string UnaryOperator::GetInfix(bool isFirst) const\n{\n\treturn ((isFirst) ? \"\" : \"(\") + \n\t\tToString() + m_tree->GetInfix() + \" \" +\n\t\t((isFirst) ? \"\" : \")\");\n}\n\nvoid UnaryOperator::Print(std::ostream& os, int depth) const\n{\n\tm_tree->Print(os, depth + 3);\n\n\tos << std::setw(depth + 2) << \"\/\" << std::endl\n\t\t<< std::setw(depth) << ToString() << std::endl\n\t\t<< std::setw(depth + 2) << \"\\\\\" << std::endl;\n}\n\nBinaryOperator::BinaryOperator(ExpressionTree* left, ExpressionTree* right)\n\t: m_leftTree(left), m_rightTree(right)\n{\n\tif (!(left && right)) \n\t{\n\t\tdelete m_leftTree;\n\t\tdelete m_rightTree;\n\t\tthrow ExpressionTreeError(\"Operator can't operate\");\n\t}\n}\n\nBinaryOperator::BinaryOperator(const BinaryOperator& operatorNode)\n\t: ExpressionTree(operatorNode), m_leftTree(operatorNode.m_leftTree->Clone()), m_rightTree(operatorNode.m_rightTree->Clone())\n{ }\n\nBinaryOperator::~BinaryOperator()\n{\n\tdelete m_leftTree;\n\tdelete m_rightTree;\n}\n\nstd::string BinaryOperator::GetPostfix() const\n{\n\treturn (m_leftTree->GetPostfix() + m_rightTree->GetPostfix() + ToString() + \" \");\n}\n\nstd::string BinaryOperator::GetInfix(bool isFirst) const\n{\n\treturn ((isFirst) ? \"\" : \"(\") + \n\t\tm_leftTree->GetInfix() + \" \" + ToString() + \" \" + m_rightTree->GetInfix() +\n\t\t((isFirst) ? \"\" : \")\");\n}\n\nvoid BinaryOperator::Print(std::ostream& os, int depth) const\n{\n\tm_rightTree->Print(os, depth + 3);\n\n\tos << std::setw(depth + 2) << \"\/\" << std::endl\n\t\t<< std::setw(depth) << ToString() << std::endl\n\t\t<< std::setw(depth + 2) << \"\\\\\" << std::endl;\n\n\tm_leftTree->Print(os, depth + 3);\n}\n\nOperand::Operand()\n{ }\n\nOperand::Operand(const Operand& operandNode) \n\t: ExpressionTree(operandNode)\n{ }\n\nstd::string Operand::GetPostfix() const\n{\n\treturn (ToString() + \" \");\n}\n\nstd::string Operand::GetInfix(bool) const\n{\n\treturn ToString();\n}\n\nvoid Operand::Print(std::ostream& os, int depth) const\n{\n\tos << std::setw(depth) << ToString() << std::endl;\n}\n\nUnaryMinus::UnaryMinus(ExpressionTree* child)\n\t: UnaryOperator(child)\n{ }\n\nUnaryMinus::UnaryMinus(const UnaryMinus& minusNode)\n\t: UnaryOperator(minusNode)\n{ }\n\nExpressionTree* UnaryMinus::Clone() const\n{\n\treturn new UnaryMinus(*this);\n}\n\nstd::string UnaryMinus::ToString() const\n{\n\treturn \"-\";\n}\n\ndouble UnaryMinus::Evaluate() const\n{\n\treturn -1 * m_tree->Evaluate();\n}\n\nSine::Sine(ExpressionTree* child)\n\t: UnaryOperator(child)\n{ }\n\nSine::Sine(const Sine& sineNode)\n\t: UnaryOperator(sineNode)\n{ }\n\nExpressionTree* Sine::Clone() const\n{\n\treturn new Sine(*this);\n}\n\nstd::string Sine::ToString() const\n{\n\treturn \"sin\";\n}\n\ndouble Sine::Evaluate() const\n{\n\treturn std::sin(m_tree->Evaluate());\n}\n\nCosine::Cosine(ExpressionTree* child)\n\t: UnaryOperator(child)\n{ }\n\nCosine::Cosine(const Cosine& cosineNode)\n\t: UnaryOperator(cosineNode)\n{ }\n\nExpressionTree* Cosine::Clone() const\n{\n\treturn new Cosine(*this);\n}\n\nstd::string Cosine::ToString() const\n{\n\treturn \"cos\";\n}\n\ndouble Cosine::Evaluate() const\n{\n\treturn std::cos(m_tree->Evaluate());\n}\n\nTangent::Tangent(ExpressionTree* child)\n\t: UnaryOperator(child)\n{ }\n\nTangent::Tangent(const Tangent& tangentNode)\n\t: UnaryOperator(tangentNode)\n{ }\n\nExpressionTree* Tangent::Clone() const\n{\n\treturn new Tangent(*this);\n}\n\nstd::string Tangent::ToString() const\n{\n\treturn \"tan\";\n}\n\ndouble Tangent::Evaluate() const\n{\n\treturn std::tan(m_tree->Evaluate());\n}\n\nPlus::Plus(ExpressionTree* left, ExpressionTree* right)\n\t: BinaryOperator(left, right)\n{ }\n\nPlus::Plus(const Plus& plusNode)\n\t: BinaryOperator(plusNode)\n{ }\n\nExpressionTree* Plus::Clone() const\n{\n\treturn new Plus(*this);\n}\n\nstd::string Plus::ToString() const\n{\n\treturn \"+\";\n}\n\ndouble Plus::Evaluate() const\n{\n\treturn m_leftTree->Evaluate() + m_rightTree->Evaluate();\n}\n\nBinaryMinus::BinaryMinus(ExpressionTree* left, ExpressionTree* right)\n\t: BinaryOperator(left, right)\n{ }\n\nBinaryMinus::BinaryMinus(const BinaryMinus& minusNode)\n\t: BinaryOperator(minusNode)\n{ }\n\nExpressionTree* BinaryMinus::Clone() const\n{\n\treturn new BinaryMinus(*this);\n}\n\nstd::string BinaryMinus::ToString() const\n{\n\treturn \"-\";\n}\n\ndouble BinaryMinus::Evaluate() const\n{\n\treturn m_leftTree->Evaluate() - m_rightTree->Evaluate();\n}\n\nMultiply::Multiply(ExpressionTree* left, ExpressionTree* right)\n\t: BinaryOperator(left, right)\n{ }\n\nMultiply::Multiply(const Multiply& multiplyNode)\n\t: BinaryOperator(multiplyNode)\n{ }\n\nExpressionTree* Multiply::Clone() const\n{\n\treturn new Multiply(*this);\n}\n\nstd::string Multiply::ToString() const\n{\n\treturn \"*\";\n}\n\ndouble Multiply::Evaluate() const\n{\n\treturn m_leftTree->Evaluate() * m_rightTree->Evaluate();\n}\n\nDivide::Divide(ExpressionTree* left, ExpressionTree* right)\n\t: BinaryOperator(left, right)\n{ }\n\nDivide::Divide(const Divide& divideNode)\n\t: BinaryOperator(divideNode)\n{ }\n\nExpressionTree* Divide::Clone() const\n{\n\treturn new Divide(*this);\n}\n\nstd::string Divide::ToString() const\n{\n\treturn \"\/\";\n}\n\ndouble Divide::Evaluate() const\n{\n\tdouble tempEval = m_rightTree->Evaluate();\n\n\tif (tempEval == 0)\n\t{\n\t\tthrow ExpressionTreeError(\"Divided by 0\");\n\t}\n\n\treturn m_leftTree->Evaluate() \/ tempEval;\n}\n\nPower::Power(ExpressionTree* left, ExpressionTree* right)\n\t: BinaryOperator(left, right)\n{ }\n\nPower::Power(const Power& powerNode)\n\t: BinaryOperator(powerNode)\n{ }\n\nExpressionTree* Power::Clone() const\n{\n\treturn new Power(*this);\n}\n\nstd::string Power::ToString() const\n{\n\treturn \"^\";\n}\n\ndouble Power::Evaluate() const\n{\n\treturn pow(m_leftTree->Evaluate(), m_rightTree->Evaluate());\n}\n\nAssign::Assign(ExpressionTree* left, ExpressionTree* right, VariableTable& varTable)\n\t: BinaryOperator(left, right), m_varTable(varTable)\n{ }\n\nAssign::Assign(const Assign& assignNode)\n\t: BinaryOperator(assignNode), m_varTable(assignNode.m_varTable)\n{ }\n\nExpressionTree* Assign::Clone() const\n{\n\treturn new Assign(*this);\n}\n\nstd::string Assign::ToString() const\n{\n\treturn \"=\";\n}\n\nstd::string Assign::GetInfix(bool) const\n{\n\treturn m_leftTree->GetInfix(true) + \" \" + ToString() + \" \" + m_rightTree->GetInfix(true);\n}\n\ndouble Assign::Evaluate() const\n{\n\tdouble rightTreeValue = m_rightTree->Evaluate();\n\tVariable* varPointer = dynamic_cast<Variable*>(m_leftTree);\n\n\tif (varPointer)\n\t{\n\t\tif (m_varTable.Find(varPointer->ToString()))\n\t\t{\n\t\t\tvarPointer->SetValue(rightTreeValue);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_varTable.Insert(varPointer->ToString(), rightTreeValue);\n\t\t}\n\t}\n\telse\n\t{\n\t\tthrow ExpressionTreeError(\"Invalid Assign\");\n\t}\n\n\treturn rightTreeValue;\n}\n\nInteger::Integer(int value)\n\t: m_value(value)\n{ }\n\nInteger::Integer(const Integer& integerNode)\n\t: Operand(integerNode), m_value(integerNode.m_value)\n{ }\n\nstd::string Integer::ToString() const\n{\n\tstd::ostringstream oss;\n\toss << m_value;\n\treturn oss.str();\n}\n\nExpressionTree* Integer::Clone() const\n{\n\treturn new Integer(*this);\n}\n\ndouble Integer::Evaluate() const\n{\n\treturn m_value;\n}\n\nReal::Real(double value)\n\t: m_value(value)\n{ }\n\nReal::Real(const Real& realNode)\n\t: Operand(realNode), m_value(realNode.m_value)\n{ }\n\nstd::string Real::ToString() const\n{\n\tstd::ostringstream oss;\n\toss << m_value;\n\treturn oss.str();\n}\n\ndouble Real::Evaluate() const\n{\n\treturn m_value;\n}\n\nExpressionTree* Real::Clone() const\n{\n\treturn new Real(*this);\n}\n\nVariable::Variable(const std::string& token, VariableTable& varTable)\n\t: m_token(token), m_varTable(varTable)\n{ }\n\nVariable::Variable(const Variable& variableNode)\n\t: Operand(variableNode), m_token(variableNode.m_token), m_varTable(variableNode.m_varTable)\n{ }\n\ndouble Variable::Evaluate() const\n{\n\treturn GetValue();\n}\n\nExpressionTree* Variable::Clone() const\n{\n\treturn new Variable(*this);\n}\n\ndouble Variable::GetValue() const\n{\n\treturn m_varTable.GetValue(m_token);\n}\n\nvoid Variable::SetValue(const double& value)\n{\n\tm_varTable.SetValue(m_token, value);\n}\n\nstd::string Variable::ToString() const\n{\n\treturn m_token;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"Axis2D.h\"\n#include <kvs\/OpenGL>\n#include <kvs\/Camera>\n#include <kvs\/Light>\n#include <kvs\/ObjectBase>\n#include <kvs\/String>\n#include <kvs\/RGBColor>\n#include <kvs\/RGBAColor>\n#include <kvs\/TableObject>\n\n\nnamespace kvs\n{\n\n\/*===========================================================================*\/\n\/**\n *  @brief  Constructs a new Axis2D class.\n *\/\n\/*===========================================================================*\/\nAxis2D::Axis2D():\n    m_top_margin( 30 ),\n    m_bottom_margin( 30 ),\n    m_left_margin( 30 ),\n    m_right_margin( 30 ),\n    m_axis_width( 2.0f ),\n    m_axis_color( 0, 0, 0 ),\n    m_value_color( 0, 0, 0 ),\n    m_label_color( 0, 0, 0 ),\n    m_background_color( kvs::RGBAColor::White() ),\n    m_x_label( \"\" ),\n    m_y_label( \"\" )\n{\n}\n\n\/*===========================================================================*\/\n\/**\n *  @brief  Render 2D axis.\n *  @param  object [in] pointer to object\n *  @param  camera [in] pointer to camera\n *  @param  light [in] pointer ot light\n *\/\n\/*===========================================================================*\/\nvoid Axis2D::exec( kvs::ObjectBase* object, kvs::Camera* camera, kvs::Light* light )\n{\n    kvs::TableObject* table = kvs::TableObject::DownCast( object );\n\n    BaseClass::startTimer();\n\n    kvs::OpenGL::WithPushedAttrib attrib( GL_CURRENT_BIT | GL_ENABLE_BIT );\n    m_painter.begin( screen() );\n    {\n        const float dpr = camera->devicePixelRatio();\n        const int x0 = m_left_margin;\n        const int x1 = camera->windowWidth() - m_right_margin;\n        const int y0 = m_top_margin;\n        const int y1 = camera->windowHeight() - m_bottom_margin;\n        const kvs::FontMetrics metrics = m_painter.fontMetrics();\n\n        \/\/ Draw background.\n        if ( m_background_color.a() > 0.0f )\n        {\n            kvs::OpenGL::Begin( GL_QUADS );\n            kvs::OpenGL::Color( m_background_color );\n            kvs::OpenGL::Vertex( kvs::Vec2( x0, y0 ) * dpr );\n            kvs::OpenGL::Vertex( kvs::Vec2( x1, y0 ) * dpr );\n            kvs::OpenGL::Vertex( kvs::Vec2( x1, y1 ) * dpr );\n            kvs::OpenGL::Vertex( kvs::Vec2( x0, y1 ) * dpr );\n            kvs::OpenGL::End();\n        }\n\n        \/\/ Draw axes.\n        const int d = int( m_axis_width * 0.5 );\n        kvs::OpenGL::SetLineWidth( m_axis_width * dpr );\n        kvs::OpenGL::Begin( GL_LINES );\n        kvs::OpenGL::Color( m_axis_color );\n        kvs::OpenGL::Vertices( kvs::Vec2( x0 - d, y1 ) * dpr, kvs::Vec2( x1 + d, y1 ) * dpr ); \/\/ X axis (bottom)\n        kvs::OpenGL::Vertices( kvs::Vec2( x0, y1 + d ) * dpr, kvs::Vec2( x0, y0 - d ) * dpr ); \/\/ Y axis (left)\n        kvs::OpenGL::Vertices( kvs::Vec2( x0 - d, y0 ) * dpr, kvs::Vec2( x1 + d, y0 ) * dpr ); \/\/ X axis (top)\n        kvs::OpenGL::Vertices( kvs::Vec2( x1, y1 + d ) * dpr, kvs::Vec2( x1, y0 - d ) * dpr ); \/\/ Y axis (right)\n        kvs::OpenGL::End();\n\n        \/\/ Draw min\/max values.\n        const std::string x_min_value = kvs::String::ToString( table->minValue(0) );\n        const std::string x_max_value = kvs::String::ToString( table->maxValue(0) );\n        const kvs::Vec2 x_min_position( x0, y1 + metrics.height() + 5 );\n        const kvs::Vec2 x_max_position( x1 - metrics.width( x_max_value ), y1 + metrics.height() + 5 );\n\n        m_painter.drawText( x_min_position, x_min_value );\n        m_painter.drawText( x_max_position, x_max_value );\n\n        const std::string y_min_value = kvs::String::ToString( table->minValue(1) );\n        const std::string y_max_value = kvs::String::ToString( table->maxValue(1) );\n        const kvs::Vec2 y_min_position( x0 - metrics.width( y_min_value ) - 5, y1 );\n        const kvs::Vec2 y_max_position( x0 - metrics.width( y_max_value ) - 5, y0 + metrics.height() );\n\n        m_painter.drawText( y_min_position, y_min_value );\n        m_painter.drawText( y_max_position, y_max_value );\n\n        \/\/ Draw x label.\n        const std::string x_label = m_x_label.empty() ? table->label(0) : m_x_label;\n        if ( x_label.size() > 0 )\n        {\n            const float x_label_position_x = ( x0 + x1 - metrics.width( x_label ) ) * 0.5f;\n            const float x_label_position_y = y1 + metrics.height() * 2.0f + 5.0f;\n            m_painter.drawText( kvs::Vec2( x_label_position_x, x_label_position_y ), x_label );\n        }\n\n        \/\/ Draw y label.\n        const std::string y_label = m_y_label.empty() ? table->label(1) : m_y_label;\n        if ( y_label.size() > 0 )\n        {\n            kvs::OpenGL::PushMatrix();\n            const float y_value_position = kvs::Math::Min( y_min_position.x(), y_max_position.x() );\n\/\/            kvs::OpenGL::Translate( y_value_position - 5.0f, ( y0 + y1 + metrics.width( y_label ) ) * 0.5f, 0.0f );\n            kvs::OpenGL::Translate( y_value_position * dpr - 5.0f, ( y0 + y1 + metrics.width( y_label ) ) * 0.5f * dpr, 0.0f );\n            kvs::OpenGL::Rotate( -90.0, 0, 0, 1 );\n            m_painter.drawText( kvs::Vec2( 0, 0 ), y_label );\n            kvs::OpenGL::PopMatrix();\n        }\n    }\n    m_painter.end();\n\n    BaseClass::stopTimer();\n}\n\n} \/\/ end of namespace kvs\n<commit_msg>Update Axis2D.cpp<commit_after>#include \"Axis2D.h\"\n#include <kvs\/OpenGL>\n#include <kvs\/Camera>\n#include <kvs\/Light>\n#include <kvs\/ObjectBase>\n#include <kvs\/String>\n#include <kvs\/RGBColor>\n#include <kvs\/RGBAColor>\n#include <kvs\/TableObject>\n\n\nnamespace kvs\n{\n\n\/*===========================================================================*\/\n\/**\n *  @brief  Constructs a new Axis2D class.\n *\/\n\/*===========================================================================*\/\nAxis2D::Axis2D():\n    m_top_margin( 30 ),\n    m_bottom_margin( 30 ),\n    m_left_margin( 30 ),\n    m_right_margin( 30 ),\n    m_axis_width( 2.0f ),\n    m_axis_color( 0, 0, 0 ),\n    m_value_color( 0, 0, 0 ),\n    m_label_color( 0, 0, 0 ),\n    m_background_color( kvs::RGBAColor::White() ),\n    m_x_label( \"\" ),\n    m_y_label( \"\" )\n{\n}\n\n\/*===========================================================================*\/\n\/**\n *  @brief  Render 2D axis.\n *  @param  object [in] pointer to object\n *  @param  camera [in] pointer to camera\n *  @param  light [in] pointer ot light\n *\/\n\/*===========================================================================*\/\nvoid Axis2D::exec( kvs::ObjectBase* object, kvs::Camera* camera, kvs::Light* light )\n{\n    kvs::TableObject* table = kvs::TableObject::DownCast( object );\n\n    BaseClass::startTimer();\n\n    kvs::OpenGL::WithPushedAttrib attrib( GL_CURRENT_BIT | GL_ENABLE_BIT );\n    m_painter.begin( screen() );\n    {\n        const float dpr = camera->devicePixelRatio();\n        const int x0 = m_left_margin;\n        const int x1 = camera->windowWidth() - m_right_margin;\n        const int y0 = m_top_margin;\n        const int y1 = camera->windowHeight() - m_bottom_margin;\n        const kvs::FontMetrics metrics = m_painter.fontMetrics();\n\n        \/\/ Draw background.\n        if ( m_background_color.a() > 0.0f )\n        {\n            kvs::OpenGL::Begin( GL_QUADS );\n            kvs::OpenGL::Color( m_background_color );\n            kvs::OpenGL::Vertex( kvs::Vec2( x0, y0 ) * dpr );\n            kvs::OpenGL::Vertex( kvs::Vec2( x1, y0 ) * dpr );\n            kvs::OpenGL::Vertex( kvs::Vec2( x1, y1 ) * dpr );\n            kvs::OpenGL::Vertex( kvs::Vec2( x0, y1 ) * dpr );\n            kvs::OpenGL::End();\n        }\n\n        \/\/ Draw axes.\n        const int d = int( m_axis_width * 0.5 );\n        kvs::OpenGL::SetLineWidth( m_axis_width * dpr );\n        kvs::OpenGL::Begin( GL_LINES );\n        kvs::OpenGL::Color( m_axis_color );\n        kvs::OpenGL::Vertices( kvs::Vec2( x0 - d, y1 ) * dpr, kvs::Vec2( x1 + d, y1 ) * dpr ); \/\/ X axis (bottom)\n        kvs::OpenGL::Vertices( kvs::Vec2( x0, y1 + d ) * dpr, kvs::Vec2( x0, y0 - d ) * dpr ); \/\/ Y axis (left)\n        kvs::OpenGL::Vertices( kvs::Vec2( x0 - d, y0 ) * dpr, kvs::Vec2( x1 + d, y0 ) * dpr ); \/\/ X axis (top)\n        kvs::OpenGL::Vertices( kvs::Vec2( x1, y1 + d ) * dpr, kvs::Vec2( x1, y0 - d ) * dpr ); \/\/ Y axis (right)\n        kvs::OpenGL::End();\n\n        \/\/ Draw min\/max values.\n        const std::string x_min_value = kvs::String::ToString( table->minValue(0) );\n        const std::string x_max_value = kvs::String::ToString( table->maxValue(0) );\n        const kvs::Vec2 x_min_position( x0, y1 + metrics.height() + 5 );\n        const kvs::Vec2 x_max_position( x1 - metrics.width( x_max_value ), y1 + metrics.height() + 5 );\n\n        m_painter.drawText( x_min_position, x_min_value );\n        m_painter.drawText( x_max_position, x_max_value );\n\n        const std::string y_min_value = kvs::String::ToString( table->minValue(1) );\n        const std::string y_max_value = kvs::String::ToString( table->maxValue(1) );\n        const kvs::Vec2 y_min_position( x0 - metrics.width( y_min_value ) - 5, y1 );\n        const kvs::Vec2 y_max_position( x0 - metrics.width( y_max_value ) - 5, y0 + metrics.height() );\n\n        m_painter.drawText( y_min_position, y_min_value );\n        m_painter.drawText( y_max_position, y_max_value );\n\n        \/\/ Draw x label.\n        const std::string x_label = m_x_label.empty() ? table->label(0) : m_x_label;\n        if ( x_label.size() > 0 )\n        {\n            const float x_label_position_x = ( x0 + x1 - metrics.width( x_label ) ) * 0.5f;\n            const float x_label_position_y = y1 + metrics.height() * 2.0f + 5.0f;\n            m_painter.drawText( kvs::Vec2( x_label_position_x, x_label_position_y ), x_label );\n        }\n\n        \/\/ Draw y label.\n        const std::string y_label = m_y_label.empty() ? table->label(1) : m_y_label;\n        if ( y_label.size() > 0 )\n        {\n            const float y_value_position = kvs::Math::Min( y_min_position.x(), y_max_position.x() );\n            const float y_label_position_x = y_value_position - 5.0f;\n            const float y_label_position_y = ( y0 + y1 + metrics.width( y_label ) ) * 0.5f;\n            kvs::OpenGL::PushMatrix();\n            kvs::OpenGL::Translate( y_label_position_x * dpr, y_label_position_y * dpr, 0.0f );\n            kvs::OpenGL::Rotate( -90.0, 0, 0, 1 );\n            m_painter.drawText( kvs::Vec2( 0, 0 ), y_label );\n            kvs::OpenGL::PopMatrix();\n        }\n    }\n    m_painter.end();\n\n    BaseClass::stopTimer();\n}\n\n} \/\/ end of namespace kvs\n<|endoftext|>"}
{"text":"<commit_before>\/***************************Copyright-DO-NOT-REMOVE-THIS-LINE**\n  *\n  * Condor Software Copyright Notice\n  * Copyright (C) 1990-2006, Condor Team, Computer Sciences Department,\n  * University of Wisconsin-Madison, WI.\n  *\n  * This source code is covered by the Condor Public License, which can\n  * be found in the accompanying LICENSE.TXT file, or online at\n  * www.condorproject.org.\n  *\n  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n  * AND THE UNIVERSITY OF WISCONSIN-MADISON \"AS IS\" AND ANY EXPRESS OR\n  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n  * WARRANTIES OF MERCHANTABILITY, OF SATISFACTORY QUALITY, AND FITNESS\n  * FOR A PARTICULAR PURPOSE OR USE ARE DISCLAIMED. THE COPYRIGHT\n  * HOLDERS AND CONTRIBUTORS AND THE UNIVERSITY OF WISCONSIN-MADISON\n  * MAKE NO MAKE NO REPRESENTATION THAT THE SOFTWARE, MODIFICATIONS,\n  * ENHANCEMENTS OR DERIVATIVE WORKS THEREOF, WILL NOT INFRINGE ANY\n  * PATENT, COPYRIGHT, TRADEMARK, TRADE SECRET OR OTHER PROPRIETARY\n  * RIGHT.\n  *\n  ****************************Copyright-DO-NOT-REMOVE-THIS-LINE**\/\n\n \n\n#define _POSIX_SOURCE\n\n#include \"condor_common.h\"\n#include \"condor_debug.h\"\n#include \"condor_constants.h\"\n#include \"name_tab.h\"\n#include \"event_handler.h\"\n\n\n\n static NAME_VALUE SigNameArray[] = {\n\t{ SIGABRT, \"SIGABRT\" },\n\t{ SIGALRM, \"SIGALRM\" },\n\t{ SIGFPE, \"SIGFPE\" },\n\t{ SIGHUP, \"SIGHUP\" },\n\t{ SIGILL, \"SIGILL\" },\n\t{ SIGINT, \"SIGINT\" },\n\t{ SIGKILL, \"SIGKILL\" },\n\t{ SIGPIPE, \"SIGPIPE\" },\n\t{ SIGQUIT, \"SIGQUIT\" },\n\t{ SIGSEGV, \"SIGSEGV\" },\n\t{ SIGTERM, \"SIGTERM\" },\n\t{ SIGUSR1, \"SIGUSR1\" },\n\t{ SIGUSR2, \"SIGUSR2\" },\n\t{ SIGCHLD, \"SIGCHLD\" },\n\t{ SIGCONT, \"SIGCONT\" },\n\t{ SIGSTOP, \"SIGSTOP\" },\n\t{ SIGTSTP, \"SIGTSTP\" },\n\t{ SIGTTIN, \"SIGTTIN\" },\n\t{ SIGTTOU, \"SIGTTOU\" },\n\t{ -1, 0 }\n};\nNameTable SigNames( SigNameArray );\n\n\nEventHandler::EventHandler( void (*f)(int), sigset_t m )\n{\n\tfunc = f;\n\tmask = m;\n\tis_installed = FALSE;\n}\n\nvoid\nEventHandler::display()\n{\n\tdprintf( D_ALWAYS, \"EventHandler {\\n\" );\n\n\tdprintf( D_ALWAYS, \"\\tfunc = %p\\n\", func );\n\tdisplay_sigset( \"\\tmask = \", &mask );\n\n\tdprintf( D_ALWAYS, \"}\\n\" );\n}\n\nvoid\ndisplay_sigset( char *msg, sigset_t *mask )\n{\n\tint\t\t\t\t\tsigno;\n\tNameTableIterator\tnext_sig( SigNames );\n\n\tif( msg ) {\n\t\tdprintf( D_ALWAYS, msg );\n\t}\n\twhile( (signo = next_sig()) != -1 ) {\n\t\tif( sigismember(mask,signo) ) {\n\t\t\tdprintf( D_ALWAYS | D_NOHEADER, \"%s \", SigNames.get_name(signo) );\n\t\t}\n\t}\n\tdprintf( D_ALWAYS | D_NOHEADER, \"\\n\" );\n}\n\n\nvoid\nEventHandler::install()\n{\n\tNameTableIterator next_sig( SigNames );\n\tstruct sigaction action;\n\tint\t\ti;\n\tint\t\tsigno;\n\n\tdprintf( D_FULLDEBUG, \"EventHandler::install() {\\n\" );\n\n\tif( is_installed ) {\n\t\tEXCEPT( \"ERROR EventHandler::install(), already installed\" );\n\t}\n\n\n\tfor( i=0; i<N_POSIX_SIGS; i++ ) {\n\t\tsigno = next_sig();\n\t\tif( sigismember(&mask,signo) ) {\n\t\t\t\/\/ explicit type cast to eliminate type check warning  -- Rajesh\n\t\t\t\/\/ we should move this to be a #define symbol...\n#if (defined(LINUX) && !defined(GLIBC20) && !defined(GLIBC21)) || defined(AIX) || defined(HPUX11) || defined(CONDOR_FREEBSD) || (defined(Darwin) && defined(CONDOR_HAD_GNUC_4))\n\t\t\t\/\/ bad craziness with the type cast --psilord\n\t\t\taction.sa_handler = func;\n#else\n\t\t\taction.sa_handler = (void *) func;\n#endif\n\n\t\t\taction.sa_mask = mask;\n\t\t\taction.sa_flags = SA_NOCLDSTOP;\n\t\t\tif( sigaction(signo,&action,&o_action[i]) < 0 ) {\n\t\t\t\tperror( \"sigaction\" );\n\t\t\t\texit( 1 );\n\t\t\t}\n\t\t\tdprintf( D_FULLDEBUG,\n\t\t\t\t\"\\t*FSM* Installed handler %p for signal %s, flags = 0x%x\\n\",\n\t\t\t\taction.sa_handler, SigNames.get_name(signo), action.sa_flags\n\t\t\t);\n\t\t}\n\t}\n\tis_installed = TRUE;\n\n\tdprintf( D_FULLDEBUG, \"}\\n\" );\n}\n\nvoid\nEventHandler::de_install()\n{\n\tNameTableIterator next_sig( SigNames );\n\t\/\/struct sigaction action;\/\/unused variable, avoiding warning.\n\tint\t\tsigno;\n\tint\t\ti;\n\n\tdprintf( D_FULLDEBUG, \"EventHandler::de_install() {\\n\" );\n\n\tif( !is_installed ) {\n\t\tEXCEPT( \"ERROR EventHandler::de_install(), not installed\" );\n\t}\n\n\tfor( i=0; i<N_POSIX_SIGS; i++ ) {\n\t\tsigno = next_sig();\n\t\tif( sigismember(&mask,signo) ) {\n\t\t\tif( sigaction(signo,&o_action[i],0) < 0 ) {\n\t\t\t\tperror( \"sigaction\" );\n\t\t\t\texit( 1 );\n\t\t\t}\n\t\t\tdprintf( D_FULLDEBUG,\n\t\t\t\t\"\\t*FSM* Installed handler %p for signal %s\\n\",\n\t\t\t\to_action[i].sa_handler, SigNames.get_name(signo)\n\t\t\t);\n\t\t}\n\t}\n\n\tis_installed = FALSE;\n\n\tdprintf( D_FULLDEBUG, \"}\\n\" );\n}\n\nvoid\nEventHandler::allow_events( sigset_t &sigset )\n{\n\tif( !is_installed ) {\n\t\tEXCEPT( \"ERROR EventHandler::allow_events(), not installed\");\n\t} \n\tsigprocmask( SIG_UNBLOCK, &sigset, 0 );\n\t\/\/ display_sigset( \"\\t*FSM* Unblocked: \", &sigset );\n}\n\nvoid\nEventHandler::block_events( sigset_t &sigset )\n{\n\tif( !is_installed ) {\n\t\tEXCEPT( \"ERROR EventHandler::block_events(), not installed\");\n\t}\n\tsigprocmask( SIG_BLOCK, &sigset, 0 );\n\t\/\/ display_sigset( \"\\t*FSM* Blocked: \", &sigset );\n}\n\n#if 0\nCriticalSection::CriticalSection()\n{\n\tis_critical = FALSE;\n}\n\n\/*\n  Block all signals, saving the current mask.\n*\/\nvoid\nCriticalSection::begin()\n{\n\tsigset_t\tall_mask;\n\n\tif( is_critical ) {\n\t\tEXCEPT( \"CriticalSection.begin() - already in critical section\");\n\t}\n\tsigfillset( &all_mask );\n\tsigprocmask( SIG_BLOCK, &all_mask, &save_mask );\n\tis_critical = TRUE;\n}\n\n\/*\n  Restore the previously saved mask.\n*\/\nvoid\nCriticalSection::end();\n{\n\tif( !is_critical ) {\n\t\tEXCEPT( \"CriticalSection.end() - not in critical section\" );\n\t}\n\tis_critical = FALSE;\n\tsigprocmask( SIG_SETMASK, &save_mask );\n}\n\n\/*\n  Allow delivery of exactly one signal which is included in the saved mask.\n*\/\nvoid\nCriticalSection::deliver_one()\n{\n\tif( !is_critical ) {\n\t\tEXCEPT( \"CricicalSection.deliver_one() - not it critical section\" );\n\t}\n\tsigsuspend( &save_mask );\n}\n#endif\n<commit_msg>fix compiler error caused by previous two commits<commit_after>\/***************************Copyright-DO-NOT-REMOVE-THIS-LINE**\n  *\n  * Condor Software Copyright Notice\n  * Copyright (C) 1990-2006, Condor Team, Computer Sciences Department,\n  * University of Wisconsin-Madison, WI.\n  *\n  * This source code is covered by the Condor Public License, which can\n  * be found in the accompanying LICENSE.TXT file, or online at\n  * www.condorproject.org.\n  *\n  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n  * AND THE UNIVERSITY OF WISCONSIN-MADISON \"AS IS\" AND ANY EXPRESS OR\n  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n  * WARRANTIES OF MERCHANTABILITY, OF SATISFACTORY QUALITY, AND FITNESS\n  * FOR A PARTICULAR PURPOSE OR USE ARE DISCLAIMED. THE COPYRIGHT\n  * HOLDERS AND CONTRIBUTORS AND THE UNIVERSITY OF WISCONSIN-MADISON\n  * MAKE NO MAKE NO REPRESENTATION THAT THE SOFTWARE, MODIFICATIONS,\n  * ENHANCEMENTS OR DERIVATIVE WORKS THEREOF, WILL NOT INFRINGE ANY\n  * PATENT, COPYRIGHT, TRADEMARK, TRADE SECRET OR OTHER PROPRIETARY\n  * RIGHT.\n  *\n  ****************************Copyright-DO-NOT-REMOVE-THIS-LINE**\/\n\n \n\n#define _POSIX_SOURCE\n\n#include \"condor_common.h\"\n#include \"condor_debug.h\"\n#include \"condor_constants.h\"\n#include \"name_tab.h\"\n#include \"event_handler.h\"\n\n\n\n static NAME_VALUE SigNameArray[] = {\n\t{ SIGABRT, \"SIGABRT\" },\n\t{ SIGALRM, \"SIGALRM\" },\n\t{ SIGFPE, \"SIGFPE\" },\n\t{ SIGHUP, \"SIGHUP\" },\n\t{ SIGILL, \"SIGILL\" },\n\t{ SIGINT, \"SIGINT\" },\n\t{ SIGKILL, \"SIGKILL\" },\n\t{ SIGPIPE, \"SIGPIPE\" },\n\t{ SIGQUIT, \"SIGQUIT\" },\n\t{ SIGSEGV, \"SIGSEGV\" },\n\t{ SIGTERM, \"SIGTERM\" },\n\t{ SIGUSR1, \"SIGUSR1\" },\n\t{ SIGUSR2, \"SIGUSR2\" },\n\t{ SIGCHLD, \"SIGCHLD\" },\n\t{ SIGCONT, \"SIGCONT\" },\n\t{ SIGSTOP, \"SIGSTOP\" },\n\t{ SIGTSTP, \"SIGTSTP\" },\n\t{ SIGTTIN, \"SIGTTIN\" },\n\t{ SIGTTOU, \"SIGTTOU\" },\n\t{ -1, 0 }\n};\nNameTable SigNames( SigNameArray );\n\n\nEventHandler::EventHandler( void (*f)(int), sigset_t m )\n{\n\tfunc = f;\n\tmask = m;\n\tis_installed = FALSE;\n}\n\nvoid\nEventHandler::display()\n{\n\tdprintf( D_ALWAYS, \"EventHandler {\\n\" );\n\n\tdprintf( D_ALWAYS, \"\\tfunc = %p\\n\", func );\n\tdisplay_sigset( \"\\tmask = \", &mask );\n\n\tdprintf( D_ALWAYS, \"}\\n\" );\n}\n\nvoid\ndisplay_sigset( char *msg, sigset_t *mask )\n{\n\tint\t\t\t\t\tsigno;\n\tNameTableIterator\tnext_sig( SigNames );\n\n\tif( msg ) {\n\t\tdprintf( D_ALWAYS, msg );\n\t}\n\twhile( (signo = next_sig()) != -1 ) {\n\t\tif( sigismember(mask,signo) ) {\n\t\t\tdprintf( D_ALWAYS | D_NOHEADER, \"%s \", SigNames.get_name(signo) );\n\t\t}\n\t}\n\tdprintf( D_ALWAYS | D_NOHEADER, \"\\n\" );\n}\n\n\nvoid\nEventHandler::install()\n{\n\tNameTableIterator next_sig( SigNames );\n\tstruct sigaction action;\n\tint\t\ti;\n\tint\t\tsigno;\n\n\tdprintf( D_FULLDEBUG, \"EventHandler::install() {\\n\" );\n\n\tif( is_installed ) {\n\t\tEXCEPT( \"ERROR EventHandler::install(), already installed\" );\n\t}\n\n\n\tfor( i=0; i<N_POSIX_SIGS; i++ ) {\n\t\tsigno = next_sig();\n\t\tif( sigismember(&mask,signo) ) {\n\t\t\t\/\/ explicit type cast to eliminate type check warning  -- Rajesh\n\t\t\t\/\/ we should move this to be a #define symbol...\n#if (defined(LINUX) && !defined(GLIBC20) && !defined(GLIBC21)) || defined(AIX) || defined(HPUX11) || defined(CONDOR_FREEBSD) || (defined(Darwin) && defined(CONDOR_HAD_GNUC_4))\n\t\t\t\/\/ bad craziness with the type cast --psilord\n\t\t\taction.sa_handler = func;\n#else\n\t\t\taction.sa_handler = (void (*)(...)) func;\n#endif\n\n\t\t\taction.sa_mask = mask;\n\t\t\taction.sa_flags = SA_NOCLDSTOP;\n\t\t\tif( sigaction(signo,&action,&o_action[i]) < 0 ) {\n\t\t\t\tperror( \"sigaction\" );\n\t\t\t\texit( 1 );\n\t\t\t}\n\t\t\tdprintf( D_FULLDEBUG,\n\t\t\t\t\"\\t*FSM* Installed handler %p for signal %s, flags = 0x%x\\n\",\n\t\t\t\taction.sa_handler, SigNames.get_name(signo), action.sa_flags\n\t\t\t);\n\t\t}\n\t}\n\tis_installed = TRUE;\n\n\tdprintf( D_FULLDEBUG, \"}\\n\" );\n}\n\nvoid\nEventHandler::de_install()\n{\n\tNameTableIterator next_sig( SigNames );\n\t\/\/struct sigaction action;\/\/unused variable, avoiding warning.\n\tint\t\tsigno;\n\tint\t\ti;\n\n\tdprintf( D_FULLDEBUG, \"EventHandler::de_install() {\\n\" );\n\n\tif( !is_installed ) {\n\t\tEXCEPT( \"ERROR EventHandler::de_install(), not installed\" );\n\t}\n\n\tfor( i=0; i<N_POSIX_SIGS; i++ ) {\n\t\tsigno = next_sig();\n\t\tif( sigismember(&mask,signo) ) {\n\t\t\tif( sigaction(signo,&o_action[i],0) < 0 ) {\n\t\t\t\tperror( \"sigaction\" );\n\t\t\t\texit( 1 );\n\t\t\t}\n\t\t\tdprintf( D_FULLDEBUG,\n\t\t\t\t\"\\t*FSM* Installed handler %p for signal %s\\n\",\n\t\t\t\to_action[i].sa_handler, SigNames.get_name(signo)\n\t\t\t);\n\t\t}\n\t}\n\n\tis_installed = FALSE;\n\n\tdprintf( D_FULLDEBUG, \"}\\n\" );\n}\n\nvoid\nEventHandler::allow_events( sigset_t &sigset )\n{\n\tif( !is_installed ) {\n\t\tEXCEPT( \"ERROR EventHandler::allow_events(), not installed\");\n\t} \n\tsigprocmask( SIG_UNBLOCK, &sigset, 0 );\n\t\/\/ display_sigset( \"\\t*FSM* Unblocked: \", &sigset );\n}\n\nvoid\nEventHandler::block_events( sigset_t &sigset )\n{\n\tif( !is_installed ) {\n\t\tEXCEPT( \"ERROR EventHandler::block_events(), not installed\");\n\t}\n\tsigprocmask( SIG_BLOCK, &sigset, 0 );\n\t\/\/ display_sigset( \"\\t*FSM* Blocked: \", &sigset );\n}\n\n#if 0\nCriticalSection::CriticalSection()\n{\n\tis_critical = FALSE;\n}\n\n\/*\n  Block all signals, saving the current mask.\n*\/\nvoid\nCriticalSection::begin()\n{\n\tsigset_t\tall_mask;\n\n\tif( is_critical ) {\n\t\tEXCEPT( \"CriticalSection.begin() - already in critical section\");\n\t}\n\tsigfillset( &all_mask );\n\tsigprocmask( SIG_BLOCK, &all_mask, &save_mask );\n\tis_critical = TRUE;\n}\n\n\/*\n  Restore the previously saved mask.\n*\/\nvoid\nCriticalSection::end();\n{\n\tif( !is_critical ) {\n\t\tEXCEPT( \"CriticalSection.end() - not in critical section\" );\n\t}\n\tis_critical = FALSE;\n\tsigprocmask( SIG_SETMASK, &save_mask );\n}\n\n\/*\n  Allow delivery of exactly one signal which is included in the saved mask.\n*\/\nvoid\nCriticalSection::deliver_one()\n{\n\tif( !is_critical ) {\n\t\tEXCEPT( \"CricicalSection.deliver_one() - not it critical section\" );\n\t}\n\tsigsuspend( &save_mask );\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: datatypes_impl.hxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: obo $ $Date: 2004-11-16 10:51:39 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef DATATYPES_INCLUDED_BY_MASTER_HEADER\n    #error \"not to be included directly!\"\n#endif\n\n\/\/--------------------------------------------------------------------\ntemplate< typename CONCRETE_DATA_TYPE_IMPL, typename SUPERCLASS >\nODerivedDataType< CONCRETE_DATA_TYPE_IMPL, SUPERCLASS >::ODerivedDataType( const ::rtl::OUString& _rName, sal_Int16 _nTypeClass )\n    :SUPERCLASS( _rName, _nTypeClass )\n    ,m_bPropertiesRegistered( false )\n{\n}\n\n\/\/--------------------------------------------------------------------\ntemplate< typename CONCRETE_DATA_TYPE_IMPL, typename SUPERCLASS >\n::cppu::IPropertyArrayHelper* ODerivedDataType< CONCRETE_DATA_TYPE_IMPL, SUPERCLASS >::createArrayHelper( ) const\n{\n    ::com::sun::star::uno::Sequence< ::com::sun::star::beans::Property > aProps;\n    ODerivedDataType< CONCRETE_DATA_TYPE_IMPL, SUPERCLASS >::describeProperties( aProps );\n    return new ::cppu::OPropertyArrayHelper( aProps );\n}\n\n\/\/--------------------------------------------------------------------\ntemplate< typename CONCRETE_DATA_TYPE_IMPL, typename SUPERCLASS >\n::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySetInfo > SAL_CALL ODerivedDataType< CONCRETE_DATA_TYPE_IMPL, SUPERCLASS >::getPropertySetInfo() throw( ::com::sun::star::uno::RuntimeException )\n{\n    return createPropertySetInfo( getInfoHelper() );\n}\n\n\/\/--------------------------------------------------------------------\ntemplate< typename CONCRETE_DATA_TYPE_IMPL, typename SUPERCLASS >\n::cppu::IPropertyArrayHelper& SAL_CALL ODerivedDataType< CONCRETE_DATA_TYPE_IMPL, SUPERCLASS >::getInfoHelper()\n{\n    if ( !m_bPropertiesRegistered )\n    {\n        const_cast< ODerivedDataType* >( this )->registerProperties();\n        const_cast< ODerivedDataType* >( this )->m_bPropertiesRegistered = true;\n    }\n\n    return *ODerivedDataType< CONCRETE_DATA_TYPE_IMPL, SUPERCLASS >::getArrayHelper();\n}\n\n\n\/\/--------------------------------------------------------------------\ntemplate< typename VALUE_TYPE >\nOComparableType< VALUE_TYPE >::OComparableType( const ::rtl::OUString& _rName, sal_Int16 _nTypeClass )\n    :OXSDDataType( _rName, _nTypeClass )\n{\n}\n\n\/\/--------------------------------------------------------------------\ntemplate< typename VALUE_TYPE >\nvoid OComparableType< VALUE_TYPE >::initializeClone( const OXSDDataType& _rCloneSource )\n{\n    OXSDDataType::initializeClone( _rCloneSource );\n    initializeTypedClone( static_cast< const OComparableType& >( _rCloneSource ) );\n}\n\n\/\/--------------------------------------------------------------------\ntemplate< typename VALUE_TYPE >\nvoid OComparableType< VALUE_TYPE >::initializeTypedClone( const OComparableType& _rCloneSource )\n{\n    m_aMaxInclusive   = _rCloneSource.m_aMaxInclusive;\n    m_aMaxExclusive   = _rCloneSource.m_aMaxExclusive;\n    m_aMinInclusive   = _rCloneSource.m_aMinInclusive;\n    m_aMinExclusive   = _rCloneSource.m_aMinExclusive;\n}\n\n\/\/--------------------------------------------------------------------\ntemplate< typename VALUE_TYPE >\nvoid OComparableType< VALUE_TYPE >::registerProperties()\n{\n    OXSDDataType::registerProperties();\n\n    REGISTER_VOID_PROP( XSD_MAX_INCLUSIVE,   m_aMaxInclusive,   VALUE_TYPE );\n    REGISTER_VOID_PROP( XSD_MAX_EXCLUSIVE,   m_aMaxExclusive,   VALUE_TYPE );\n    REGISTER_VOID_PROP( XSD_MIN_INCLUSIVE,   m_aMinInclusive,   VALUE_TYPE );\n    REGISTER_VOID_PROP( XSD_MIN_EXCLUSIVE,   m_aMinExclusive,   VALUE_TYPE );\n}\n\n\/\/--------------------------------------------------------------------\ntemplate< typename VALUE_TYPE >\nbool OComparableType< VALUE_TYPE >::_getValue( const ::rtl::OUString& rValue, double& fValue )\n{\n    \/\/ convert to double\n    rtl_math_ConversionStatus eStatus;\n    sal_Int32 nEnd;\n    double f = ::rtl::math::stringToDouble(\n        rValue, sal_Unicode('.'), sal_Unicode(0), &eStatus, &nEnd );\n\n    \/\/ error checking...\n    bool bReturn = false;\n    if( eStatus == rtl_math_ConversionStatus_Ok\n        && nEnd == rValue.getLength() )\n    {\n        bReturn = true;\n        fValue = f;\n    }\n    return bReturn;\n}\n\n\/\/--------------------------------------------------------------------\n\/\/ validate min-\/max facets\n\/\/ to be used by validate(..) and explainInvalid(..) methods\ntemplate< typename VALUE_TYPE >\nsal_uInt16 OComparableType< VALUE_TYPE >::_validate( const ::rtl::OUString& rValue )\n{\n    sal_uInt16 nReason = OXSDDataType::_validate( rValue );\n    if( nReason == 0 )\n    {\n\n        \/\/ convert value and check format\n        double nDoubleLimit = 0;\n        double f;\n        if( ! _getValue( rValue, f ) )\n            nReason = RID_STR_XFORMS_VALUE_IS_NOT_A;\n\n        \/\/ check range\n        else if( ( m_aMaxInclusive >>= nDoubleLimit ) && f > nDoubleLimit )\n            nReason = RID_STR_XFORMS_VALUE_MAX_INCL;\n        else if( ( m_aMaxExclusive >>= nDoubleLimit ) && f >= nDoubleLimit)\n            nReason = RID_STR_XFORMS_VALUE_MAX_EXCL;\n        else if( ( m_aMinInclusive >>= nDoubleLimit ) && f < nDoubleLimit )\n            nReason = RID_STR_XFORMS_VALUE_MIN_INCL;\n        else if( ( m_aMinExclusive >>= nDoubleLimit ) && f <= nDoubleLimit)\n            nReason = RID_STR_XFORMS_VALUE_MIN_EXCL;\n    }\n    return nReason;\n}\n\n\/\/--------------------------------------------------------------------\ntemplate< typename VALUE_TYPE >\n::rtl::OUString OComparableType< VALUE_TYPE >::_explainInvalid( sal_uInt16 nReason )\n{\n    ::rtl::OUStringBuffer sInfo;\n    switch( nReason )\n    {\n    case 0:\n        \/\/ nothing to do!\n        break;\n\n    case RID_STR_XFORMS_VALUE_IS_NOT_A:\n        sInfo.append( getName() );\n        break;\n\n    case RID_STR_XFORMS_VALUE_MAX_INCL:\n        sInfo.append( typedValueAsString( m_aMaxInclusive ) );\n        break;\n\n    case RID_STR_XFORMS_VALUE_MAX_EXCL:\n        sInfo.append( typedValueAsString( m_aMaxExclusive ) );\n        break;\n\n    case RID_STR_XFORMS_VALUE_MIN_INCL:\n        sInfo.append( typedValueAsString( m_aMinInclusive ) );\n        break;\n\n    case RID_STR_XFORMS_VALUE_MIN_EXCL:\n        sInfo.append( typedValueAsString( m_aMinExclusive ) );\n        break;\n\n    default:\n        OSL_ENSURE( false, \"OComparableType::_explainInvalid: unknown reason!\" );\n        break;\n    }\n\n    return sInfo.makeStringAndClear();\n}\n\n<commit_msg>INTEGRATION: CWS eforms4 (1.2.6); FILE MERGED 2004\/12\/27 15:30:23 fs 1.2.6.3: #i10000# template specializations moved to datatyperepository.cxx - unxlngi6 complained when they were herein 2004\/12\/23 14:08:46 dvo 1.2.6.2: #i38666# change Datatype property names to reflect their types 2004\/12\/08 16:17:49 fs 1.2.6.1: #i36359# #i36303# split (and renamed) OComparableType, so that we have a base class which does not depend on a template argument<commit_after>\/*************************************************************************\n *\n *  $RCSfile: datatypes_impl.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: vg $ $Date: 2005-03-23 11:36:22 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef DATATYPES_INCLUDED_BY_MASTER_HEADER\n    #error \"not to be included directly!\"\n#endif\n\n\/\/--------------------------------------------------------------------\ntemplate< typename CONCRETE_DATA_TYPE_IMPL, typename SUPERCLASS >\nODerivedDataType< CONCRETE_DATA_TYPE_IMPL, SUPERCLASS >::ODerivedDataType( const ::rtl::OUString& _rName, sal_Int16 _nTypeClass )\n    :SUPERCLASS( _rName, _nTypeClass )\n    ,m_bPropertiesRegistered( false )\n{\n}\n\n\/\/--------------------------------------------------------------------\ntemplate< typename CONCRETE_DATA_TYPE_IMPL, typename SUPERCLASS >\n::cppu::IPropertyArrayHelper* ODerivedDataType< CONCRETE_DATA_TYPE_IMPL, SUPERCLASS >::createArrayHelper( ) const\n{\n    ::com::sun::star::uno::Sequence< ::com::sun::star::beans::Property > aProps;\n    ODerivedDataType< CONCRETE_DATA_TYPE_IMPL, SUPERCLASS >::describeProperties( aProps );\n    return new ::cppu::OPropertyArrayHelper( aProps );\n}\n\n\/\/--------------------------------------------------------------------\ntemplate< typename CONCRETE_DATA_TYPE_IMPL, typename SUPERCLASS >\n::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySetInfo > SAL_CALL ODerivedDataType< CONCRETE_DATA_TYPE_IMPL, SUPERCLASS >::getPropertySetInfo() throw( ::com::sun::star::uno::RuntimeException )\n{\n    return createPropertySetInfo( getInfoHelper() );\n}\n\n\/\/--------------------------------------------------------------------\ntemplate< typename CONCRETE_DATA_TYPE_IMPL, typename SUPERCLASS >\n::cppu::IPropertyArrayHelper& SAL_CALL ODerivedDataType< CONCRETE_DATA_TYPE_IMPL, SUPERCLASS >::getInfoHelper()\n{\n    if ( !m_bPropertiesRegistered )\n    {\n        const_cast< ODerivedDataType* >( this )->registerProperties();\n        const_cast< ODerivedDataType* >( this )->m_bPropertiesRegistered = true;\n    }\n\n    return *ODerivedDataType< CONCRETE_DATA_TYPE_IMPL, SUPERCLASS >::getArrayHelper();\n}\n\n\n\/\/--------------------------------------------------------------------\ntemplate< typename VALUE_TYPE >\nOValueLimitedType< VALUE_TYPE >::OValueLimitedType( const ::rtl::OUString& _rName, sal_Int16 _nTypeClass )\n    :OValueLimitedType_Base( _rName, _nTypeClass )\n{\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"acmacs-base\/debug.hh\"\n\n#include \"time-series-draw.hh\"\n#include \"tree.hh\"\n#include \"tree-draw.hh\"\n#include \"coloring.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\nvoid TimeSeriesDraw::prepare()\n{\n    std::map<date::year_month_day, size_t> sequences_per_month;\n    mTree.sequences_per_month(sequences_per_month);\n    if (!sequences_per_month.empty()) {\n        std::cout << \"INFO: Sequences per month:\" << '\\n';\n        for (const auto& e: sequences_per_month) {\n            std::cout << \"  \" << e.first << \" \" << e.second << '\\n';\n        }\n\n        const auto today = date::today();\n        auto end_of_ts = today;\n        if (mSettings.end.empty()) {\n            for (auto ms = sequences_per_month.crbegin(); ms != sequences_per_month.crend(); ++ms) {\n                if (ms->second && ms->first <= today) {\n                    end_of_ts = ms->first;\n                    mSettings.end = date::display(date::end_of_month(ms->first));\n                    break;\n                }\n            }\n        }\n\n        if (mSettings.begin.empty()) {\n            for (const auto& entry : sequences_per_month) {\n                fmt::print(stderr, \"DEBUG: entry.first {}\\n\", entry.first);\n                if (entry.second && months_between_dates(entry.first, end_of_ts) < 25) {\n                    mSettings.begin = date::display(entry.first);\n                    break;\n                }\n            }\n        }\n\n        fmt::print(stderr, \"DEBUG: dates {} .. {}\\n\", *mSettings.begin, *mSettings.end);\n        mNumberOfMonths = static_cast<size_t>(calendar_months_between_dates_inclusive(date::from_string(*mSettings.begin), date::from_string(*mSettings.end)));\n        std::cout << \"INFO: dates to show: \" << mSettings.begin << \" .. \" << mSettings.end << \"  months: \" << mNumberOfMonths << DEBUG_LINE_FUNC << '\\n';\n    }\n    else {\n        std::cout << \"WARNING: no dates found for sequences\" << DEBUG_LINE_FUNC << '\\n';\n        mNumberOfMonths = 0;\n    }\n\n} \/\/ TimeSeriesDraw::prepare\n\n\/\/ ----------------------------------------------------------------------\n\nstd::vector<std::string> TimeSeriesDraw::all_months() const\n{\n    std::vector<std::string> result;\n    auto current_month{date::from_string(*mSettings.begin)};\n    for (size_t month_no = 0; month_no < mNumberOfMonths; ++month_no, date::increment_month(current_month))\n        result.push_back(date::year4_month2(current_month));\n    return result;\n\n} \/\/ TimeSeriesDraw::all_months\n\n\/\/ ----------------------------------------------------------------------\n\nvoid TimeSeriesDraw::init_settings(const SettingsInitializer& \/*settings_initilizer*\/)\n{\n\n} \/\/ TimeSeriesDraw::init_settings\n\n\/\/ ----------------------------------------------------------------------\n\nvoid TimeSeriesDraw::draw()\n{\n    if (mNumberOfMonths) {\n          \/\/ mSurface.border(\"green3\", 1);\n        const double month_width = mSurface.viewport().size.width \/ mNumberOfMonths;\n        draw_labels(month_width);\n        draw_month_separators(month_width);\n        draw_dashes(month_width);\n        draw_hz_section_lines();\n    }\n\n} \/\/ TimeSeriesDraw::draw\n\n\/\/ ----------------------------------------------------------------------\n\nvoid TimeSeriesDraw::draw_labels(double month_width)\n{\n    const acmacs::Size& surface_size = mSurface.viewport().size;\n    const double month_max_height = mSurface.text_size(\"May \", Pixels{mSettings.label_size}, mSettings.label_style).width;\n    double x_bearing;\n    const auto big_label_size = mSurface.text_size(\"May 99\", Pixels{mSettings.label_size}, mSettings.label_style, &x_bearing);\n    const auto text_up = (month_width - big_label_size.height) * 0.5;\n    const double month_year_to_timeseries_gap = mSurface.convert(Pixels{mSettings.month_year_to_timeseries_gap}).value();\n\n    draw_labels_at_side({text_up, - big_label_size.width - x_bearing - 2 \/*month_year_to_timeseries_gap*\/}, month_width, month_max_height);\n    draw_labels_at_side({text_up, surface_size.height + x_bearing + month_year_to_timeseries_gap}, month_width, month_max_height);\n\n} \/\/ TimeSeriesDraw::draw_labels\n\n\/\/ ----------------------------------------------------------------------\n\nvoid TimeSeriesDraw::draw_labels_at_side(const acmacs::PointCoordinates& aOrigin, double month_width, double month_max_height)\n{\n    try {\n        auto current_month{date::from_string(*mSettings.begin)};\n        for (size_t month_no = 0; month_no < mNumberOfMonths; ++month_no, date::increment_month(current_month)) {\n            const double left = aOrigin.x() + month_no * month_width;\n            mSurface.text({left, aOrigin.y()}, date::month_3(current_month), 0, Pixels{mSettings.label_size}, mSettings.label_style, Rotation{M_PI_2});\n            mSurface.text({left, aOrigin.y() + month_max_height}, date::year_2(current_month), 0, Pixels{mSettings.label_size}, mSettings.label_style, Rotation{M_PI_2});\n        }\n    }\n    catch (std::exception& err) {\n        std::cerr << \"WARNING: \" << err.what() << \" (TimeSeriesDraw::draw_labels_at_side)\\n\";\n    }\n\n} \/\/ TimeSeriesDraw::draw_labels_at_side\n\n\/\/ ----------------------------------------------------------------------\n\n\/\/ for tracked antigens in antigenic maps colored by date\nvoid TimeSeriesDraw::draw_color_scale(const std::map<std::string, Color, std::less<>>& aTrackedAntigenColorByMonth)\n{\n    const acmacs::Size& surface_size = mSurface.viewport().size;\n    const double month_width = mSurface.viewport().size.width \/ mNumberOfMonths;\n    const auto top = surface_size.height;\n    auto current_month{date::from_string(*mSettings.begin)};\n    for (size_t month_no = 0; month_no < mNumberOfMonths; ++month_no, date::increment_month(current_month)) {\n        const auto left = month_no * month_width;\n        mSurface.rectangle_filled({left, top}, acmacs::Size{10, 10}, PINK, Pixels{0}, aTrackedAntigenColorByMonth.find(date::year4_month2(current_month))->second);\n    }\n\n} \/\/ TimeSeriesDraw::draw_color_scale\n\n\/\/ ----------------------------------------------------------------------\n\nvoid TimeSeriesDraw::draw_month_separators(double month_width)\n{\n    const double bottom = mSurface.viewport().size.height;\n    for (size_t month_no = 0; month_no <= mNumberOfMonths; ++month_no) {\n        const double left = month_no * month_width;\n        mSurface.line({left, 0}, {left, bottom}, mSettings.month_separator_color, Pixels{mSettings.month_separator_width});\n    }\n\n} \/\/ TimeSeriesDraw::draw_month_separators\n\n\/\/ ----------------------------------------------------------------------\n\nvoid TimeSeriesDraw::draw_dashes(double month_width)\n{\n    const double base_x = month_width * (1.0 - mSettings.dash_width) \/ 2;\n    const Coloring& coloring = mTreeDraw.coloring();\n\n    const auto begin{date::from_string(*mSettings.begin)}, end{date::from_string(*mSettings.end)};\n    auto draw_dash = [&](const Node& aNode) {\n        if (aNode.draw.shown && !aNode.data.date().empty()) {\n            if (const auto node_date_s = aNode.data.date(); node_date_s.size() > 3 && node_date_s.substr(node_date_s.size() - 3) != \"-00\") { \/\/ ignore incomplete dates\n                try {\n                    if (const auto node_date{date::from_string(node_date_s)}; node_date >= begin && node_date <= end) {\n                        const int month_no = date::months_between_dates(begin, node_date);\n                        const acmacs::PointCoordinates a(base_x + month_width * month_no, aNode.draw.vertical_pos);\n                        mSurface.line(a, {a.x() + month_width * mSettings.dash_width, a.y()}, coloring.color(aNode), Pixels{mSettings.dash_line_width}, acmacs::surface::LineCap::Round);\n                    }\n                }\n                catch (std::exception& err) {\n                    std::cerr << \"WARNING: \" << err.what() << \" (TimeSeriesDraw::draw_dashes) Date: \" << aNode.data.date() << \"\\n\";\n                }\n            }\n        }\n    };\n\n    try {\n        tree::iterate_leaf(mTree, draw_dash);\n    }\n    catch (std::exception& err) {\n        std::cerr << \"WARNING: \" << err.what() << \" (TimeSeriesDraw::draw_dashes)\\n\";\n    }\n\n} \/\/ TimeSeriesDraw::draw_dashes\n\n\/\/ ----------------------------------------------------------------------\n\nvoid TimeSeriesDraw::draw_hz_section_lines()\n{\n    double previous_vertical_pos = -1e-8;\n    auto draw = [&](const Node& aNode) {\n        if (aNode.draw.shown) {\n            if (aNode.draw.hz_section_index != NodeDrawData::HzSectionNoIndex) {\n                const auto section_settings = mHzSections.sections[aNode.draw.hz_section_index];\n                double y = aNode.draw.vertical_pos;\n                if (section_settings->show_line) {\n                    y = (previous_vertical_pos + aNode.draw.vertical_pos) \/ 2;\n                    mSurface.line({0, y}, {mSurface.viewport().size.width, y}, mHzSections.line_color, Pixels{mHzSections.line_width});\n                }\n                if ((!mTreeMode || mHzSections.show_labels_in_time_series_in_tree_mode) && section_settings->show_label_in_time_series) {\n                    draw_hz_section_label(aNode.draw.hz_section_index, y);\n                }\n            }\n            previous_vertical_pos = aNode.draw.vertical_pos;\n        }\n    };\n    tree::iterate_leaf(mTree, draw);\n\n} \/\/ TimeSeriesDraw::draw_hz_section_lines\n\n\/\/ ----------------------------------------------------------------------\n\nvoid TimeSeriesDraw::draw_hz_section_label(size_t aSectionIndex, double aY)\n{\n    const auto section_settings = mHzSections.sections[aSectionIndex];\n    if (section_settings->show && section_settings->show_map) {\n        std::string label = mHzSections.node_refs[aSectionIndex].index; \/\/ (1, 'A' + static_cast<char>(aSectionNo));\n        const acmacs::Size tsize = mSurface.text_size(label, Pixels{mHzSections.ts_label_size}, mHzSections.ts_label_style);\n        mSurface.text({mSurface.viewport().size.width - tsize.width * 1.2, aY + tsize.height * 1.2}, label, mHzSections.ts_label_color, Pixels{mHzSections.ts_label_size}, mHzSections.ts_label_style);\n    }\n\n} \/\/ TimeSeriesDraw::draw_hz_section_label\n\n\/\/ ----------------------------------------------------------------------\n\n\/\/ void TimeSeriesDraw::hide_hz_section_labels_in_time_series()\n\/\/ {\n\/\/     for (auto& section: mHzSections.sections)\n\/\/         section.show_label_in_time_series = false;\n\n\/\/ } \/\/ TimeSeriesDraw::hide_hz_section_labels_in_time_series\n\n\/\/ ----------------------------------------------------------------------\n\nvoid TimeSeriesDrawSettings::remove_for_tree_settings()\n{\n    label_style.remove();\n\n} \/\/ TimeSeriesDrawSettings::remove_for_tree_settings\n\n\/\/ ----------------------------------------------------------------------\n\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<commit_msg>bug fix in detecting default time series boundaries<commit_after>#include \"acmacs-base\/debug.hh\"\n\n#include \"time-series-draw.hh\"\n#include \"tree.hh\"\n#include \"tree-draw.hh\"\n#include \"coloring.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\nvoid TimeSeriesDraw::prepare()\n{\n    std::map<date::year_month_day, size_t> sequences_per_month;\n    mTree.sequences_per_month(sequences_per_month);\n    if (!sequences_per_month.empty()) {\n        std::cout << \"INFO: Sequences per month:\" << '\\n';\n        for (const auto& e: sequences_per_month) {\n            std::cout << \"  \" << e.first << \" \" << e.second << '\\n';\n        }\n\n        const auto today = date::today();\n        auto end_of_ts = today;\n        if (mSettings.end.empty()) {\n            for (auto ms = sequences_per_month.crbegin(); ms != sequences_per_month.crend(); ++ms) {\n                if (ms->second && ms->first <= today) {\n                    end_of_ts = ms->first;\n                    mSettings.end = date::display(date::end_of_month(ms->first));\n                    break;\n                }\n            }\n        }\n\n        if (mSettings.begin.empty()) {\n            for (const auto& entry : sequences_per_month) {\n                if (entry.second && months_between_dates(entry.first, end_of_ts) < 25) {\n                    mSettings.begin = date::display(entry.first);\n                    break;\n                }\n            }\n        }\n\n        mNumberOfMonths = static_cast<size_t>(calendar_months_between_dates_inclusive(date::from_string(*mSettings.begin), date::from_string(*mSettings.end)));\n        std::cout << \"INFO: dates to show: \" << mSettings.begin << \" .. \" << mSettings.end << \"  months: \" << mNumberOfMonths << DEBUG_LINE_FUNC << '\\n';\n    }\n    else {\n        std::cout << \"WARNING: no dates found for sequences\" << DEBUG_LINE_FUNC << '\\n';\n        mNumberOfMonths = 0;\n    }\n\n} \/\/ TimeSeriesDraw::prepare\n\n\/\/ ----------------------------------------------------------------------\n\nstd::vector<std::string> TimeSeriesDraw::all_months() const\n{\n    std::vector<std::string> result;\n    auto current_month{date::from_string(*mSettings.begin)};\n    for (size_t month_no = 0; month_no < mNumberOfMonths; ++month_no, date::increment_month(current_month))\n        result.push_back(date::year4_month2(current_month));\n    return result;\n\n} \/\/ TimeSeriesDraw::all_months\n\n\/\/ ----------------------------------------------------------------------\n\nvoid TimeSeriesDraw::init_settings(const SettingsInitializer& \/*settings_initilizer*\/)\n{\n\n} \/\/ TimeSeriesDraw::init_settings\n\n\/\/ ----------------------------------------------------------------------\n\nvoid TimeSeriesDraw::draw()\n{\n    if (mNumberOfMonths) {\n          \/\/ mSurface.border(\"green3\", 1);\n        const double month_width = mSurface.viewport().size.width \/ mNumberOfMonths;\n        draw_labels(month_width);\n        draw_month_separators(month_width);\n        draw_dashes(month_width);\n        draw_hz_section_lines();\n    }\n\n} \/\/ TimeSeriesDraw::draw\n\n\/\/ ----------------------------------------------------------------------\n\nvoid TimeSeriesDraw::draw_labels(double month_width)\n{\n    const acmacs::Size& surface_size = mSurface.viewport().size;\n    const double month_max_height = mSurface.text_size(\"May \", Pixels{mSettings.label_size}, mSettings.label_style).width;\n    double x_bearing;\n    const auto big_label_size = mSurface.text_size(\"May 99\", Pixels{mSettings.label_size}, mSettings.label_style, &x_bearing);\n    const auto text_up = (month_width - big_label_size.height) * 0.5;\n    const double month_year_to_timeseries_gap = mSurface.convert(Pixels{mSettings.month_year_to_timeseries_gap}).value();\n\n    draw_labels_at_side({text_up, - big_label_size.width - x_bearing - 2 \/*month_year_to_timeseries_gap*\/}, month_width, month_max_height);\n    draw_labels_at_side({text_up, surface_size.height + x_bearing + month_year_to_timeseries_gap}, month_width, month_max_height);\n\n} \/\/ TimeSeriesDraw::draw_labels\n\n\/\/ ----------------------------------------------------------------------\n\nvoid TimeSeriesDraw::draw_labels_at_side(const acmacs::PointCoordinates& aOrigin, double month_width, double month_max_height)\n{\n    try {\n        auto current_month{date::from_string(*mSettings.begin)};\n        for (size_t month_no = 0; month_no < mNumberOfMonths; ++month_no, date::increment_month(current_month)) {\n            const double left = aOrigin.x() + month_no * month_width;\n            mSurface.text({left, aOrigin.y()}, date::month_3(current_month), 0, Pixels{mSettings.label_size}, mSettings.label_style, Rotation{M_PI_2});\n            mSurface.text({left, aOrigin.y() + month_max_height}, date::year_2(current_month), 0, Pixels{mSettings.label_size}, mSettings.label_style, Rotation{M_PI_2});\n        }\n    }\n    catch (std::exception& err) {\n        std::cerr << \"WARNING: \" << err.what() << \" (TimeSeriesDraw::draw_labels_at_side)\\n\";\n    }\n\n} \/\/ TimeSeriesDraw::draw_labels_at_side\n\n\/\/ ----------------------------------------------------------------------\n\n\/\/ for tracked antigens in antigenic maps colored by date\nvoid TimeSeriesDraw::draw_color_scale(const std::map<std::string, Color, std::less<>>& aTrackedAntigenColorByMonth)\n{\n    const acmacs::Size& surface_size = mSurface.viewport().size;\n    const double month_width = mSurface.viewport().size.width \/ mNumberOfMonths;\n    const auto top = surface_size.height;\n    auto current_month{date::from_string(*mSettings.begin)};\n    for (size_t month_no = 0; month_no < mNumberOfMonths; ++month_no, date::increment_month(current_month)) {\n        const auto left = month_no * month_width;\n        mSurface.rectangle_filled({left, top}, acmacs::Size{10, 10}, PINK, Pixels{0}, aTrackedAntigenColorByMonth.find(date::year4_month2(current_month))->second);\n    }\n\n} \/\/ TimeSeriesDraw::draw_color_scale\n\n\/\/ ----------------------------------------------------------------------\n\nvoid TimeSeriesDraw::draw_month_separators(double month_width)\n{\n    const double bottom = mSurface.viewport().size.height;\n    for (size_t month_no = 0; month_no <= mNumberOfMonths; ++month_no) {\n        const double left = month_no * month_width;\n        mSurface.line({left, 0}, {left, bottom}, mSettings.month_separator_color, Pixels{mSettings.month_separator_width});\n    }\n\n} \/\/ TimeSeriesDraw::draw_month_separators\n\n\/\/ ----------------------------------------------------------------------\n\nvoid TimeSeriesDraw::draw_dashes(double month_width)\n{\n    const double base_x = month_width * (1.0 - mSettings.dash_width) \/ 2;\n    const Coloring& coloring = mTreeDraw.coloring();\n\n    const auto begin{date::from_string(*mSettings.begin)}, end{date::from_string(*mSettings.end)};\n    auto draw_dash = [&](const Node& aNode) {\n        if (aNode.draw.shown && !aNode.data.date().empty()) {\n            if (const auto node_date_s = aNode.data.date(); node_date_s.size() > 3 && node_date_s.substr(node_date_s.size() - 3) != \"-00\") { \/\/ ignore incomplete dates\n                try {\n                    if (const auto node_date{date::from_string(node_date_s)}; node_date >= begin && node_date <= end) {\n                        const int month_no = date::months_between_dates(begin, node_date);\n                        const acmacs::PointCoordinates a(base_x + month_width * month_no, aNode.draw.vertical_pos);\n                        mSurface.line(a, {a.x() + month_width * mSettings.dash_width, a.y()}, coloring.color(aNode), Pixels{mSettings.dash_line_width}, acmacs::surface::LineCap::Round);\n                    }\n                }\n                catch (std::exception& err) {\n                    std::cerr << \"WARNING: \" << err.what() << \" (TimeSeriesDraw::draw_dashes) Date: \" << aNode.data.date() << \"\\n\";\n                }\n            }\n        }\n    };\n\n    try {\n        tree::iterate_leaf(mTree, draw_dash);\n    }\n    catch (std::exception& err) {\n        std::cerr << \"WARNING: \" << err.what() << \" (TimeSeriesDraw::draw_dashes)\\n\";\n    }\n\n} \/\/ TimeSeriesDraw::draw_dashes\n\n\/\/ ----------------------------------------------------------------------\n\nvoid TimeSeriesDraw::draw_hz_section_lines()\n{\n    double previous_vertical_pos = -1e-8;\n    auto draw = [&](const Node& aNode) {\n        if (aNode.draw.shown) {\n            if (aNode.draw.hz_section_index != NodeDrawData::HzSectionNoIndex) {\n                const auto section_settings = mHzSections.sections[aNode.draw.hz_section_index];\n                double y = aNode.draw.vertical_pos;\n                if (section_settings->show_line) {\n                    y = (previous_vertical_pos + aNode.draw.vertical_pos) \/ 2;\n                    mSurface.line({0, y}, {mSurface.viewport().size.width, y}, mHzSections.line_color, Pixels{mHzSections.line_width});\n                }\n                if ((!mTreeMode || mHzSections.show_labels_in_time_series_in_tree_mode) && section_settings->show_label_in_time_series) {\n                    draw_hz_section_label(aNode.draw.hz_section_index, y);\n                }\n            }\n            previous_vertical_pos = aNode.draw.vertical_pos;\n        }\n    };\n    tree::iterate_leaf(mTree, draw);\n\n} \/\/ TimeSeriesDraw::draw_hz_section_lines\n\n\/\/ ----------------------------------------------------------------------\n\nvoid TimeSeriesDraw::draw_hz_section_label(size_t aSectionIndex, double aY)\n{\n    const auto section_settings = mHzSections.sections[aSectionIndex];\n    if (section_settings->show && section_settings->show_map) {\n        std::string label = mHzSections.node_refs[aSectionIndex].index; \/\/ (1, 'A' + static_cast<char>(aSectionNo));\n        const acmacs::Size tsize = mSurface.text_size(label, Pixels{mHzSections.ts_label_size}, mHzSections.ts_label_style);\n        mSurface.text({mSurface.viewport().size.width - tsize.width * 1.2, aY + tsize.height * 1.2}, label, mHzSections.ts_label_color, Pixels{mHzSections.ts_label_size}, mHzSections.ts_label_style);\n    }\n\n} \/\/ TimeSeriesDraw::draw_hz_section_label\n\n\/\/ ----------------------------------------------------------------------\n\n\/\/ void TimeSeriesDraw::hide_hz_section_labels_in_time_series()\n\/\/ {\n\/\/     for (auto& section: mHzSections.sections)\n\/\/         section.show_label_in_time_series = false;\n\n\/\/ } \/\/ TimeSeriesDraw::hide_hz_section_labels_in_time_series\n\n\/\/ ----------------------------------------------------------------------\n\nvoid TimeSeriesDrawSettings::remove_for_tree_settings()\n{\n    label_style.remove();\n\n} \/\/ TimeSeriesDrawSettings::remove_for_tree_settings\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>\/***************************************************************\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_config.h\"\n#include \"directory_util.h\"\n\n\/*\n  Returns a path to subdirectory to use for temporary files.\n  The pointer returned must be de-allocated by the caller w\/ free().\n*\/\nchar*\ntemp_dir_path()\n{\n\tchar *prefix = param(\"TMP_DIR\");\n\tif  (!prefix) {\n\t\tprefix = param(\"TEMP_DIR\");\n\t}\n\tif (!prefix) {\n#ifndef WIN32\n\t\tprefix = strdup(\"\/tmp\");\n#else\n\t\t\t\/\/ try to get the temp dir, then try SPOOL,\n\t\t\t\/\/ then use the root directory\n\t\tchar buf[MAX_PATH];\n\t\tint len;\n\t\tif ((len = GetTempPath(sizeof(buf), buf)) <= sizeof(buf)) {\n\t\t\tbuf[len - 1] = '\\0';\n\t\t\tprefix = strdup(buf);\n\t\t} else {\n\t\t\tdprintf(D_ALWAYS, \"GetTempPath: buffer of size %d too small\\n\", sizeof(buf));\n\n\t\t\tprefix = param(\"SPOOL\");\n\t\t\tif (!prefix) {\n\t\t\t\tprefix = strdup(\"\\\\\");\n\t\t\t}\n\t\t}\n#endif\n\t}\n\treturn prefix;\n}\n\n\/*\n  Concatenates a given directory path and filename into a single\n  string, stored in space allocated with new[].  This function makes\n  sure that if the given directory path doesn't end with the\n  appropriate directory delimiter for this platform, that the new\n  string includes that.  Delete return string with delete[].\n*\/\nchar*\ndircat( const char *dirpath, const char *filename )\n{\n\tASSERT(dirpath);\n\tASSERT(filename);\n\tbool needs_delim = true;\n\tint extra = 2, dirlen = strlen(dirpath);\n\tchar* rval;\n\tif( dirpath[dirlen - 1] == DIR_DELIM_CHAR ) {\n\t\tneeds_delim = false;\n\t\textra = 1;\n\t}\n\trval = new char[ extra + dirlen + strlen(filename)];\n\tif( needs_delim ) {\n\t\tsprintf( rval, \"%s%c%s\", dirpath, DIR_DELIM_CHAR, filename );\n\t} else {\n\t\tsprintf( rval, \"%s%s\", dirpath, filename );\n\t}\n\treturn rval;\n}\n\n\/*\n  Concatenates a given directory path and subdirectory path into a single\n  string, stored in space allocated with new[].  This function makes\n  sure that if the given directory path doesn't end with the\n  appropriate directory delimiter for this platform, that the new\n  string includes that -- it will contain the trailing delimiter too.  \n  Delete return string with delete[].\n*\/\nchar*\ndirscat( const char *dirpath, const char *subdir )\n{\n\tASSERT(dirpath);\n\tASSERT(subdir);\n\tbool needs_delim1 = true, needs_delim2 = true;\n\tint extra = 3, dirlen = strlen(dirpath), subdirlen = strlen(subdir);\n\tchar* rval;\n\tif( dirpath[dirlen - 1] == DIR_DELIM_CHAR ) {\n\t\tneeds_delim1 = false;\n\t\t--extra;\n\t}\n\tif (subdir[subdirlen - 1] == DIR_DELIM_CHAR ) {\n\t\t--extra;\n\t\tneeds_delim2 = false;\n\t}\n\trval = new char[ extra + dirlen + strlen(subdir)];\n\tif( needs_delim1 ) {\n\t\tif ( needs_delim2 ) {\n\t\t\tsprintf( rval, \"%s%c%s%c\", dirpath, DIR_DELIM_CHAR, subdir, DIR_DELIM_CHAR );\n\t\t} else {\n\t\t\tsprintf( rval, \"%s%c%s\", dirpath, DIR_DELIM_CHAR, subdir );\n\t\t}\n\t} else {\n\t\tif ( needs_delim2 ) {\n\t\t\tsprintf( rval, \"%s%s%c\", dirpath, subdir, DIR_DELIM_CHAR );\n\t\t} else {\n\t\t\tsprintf( rval, \"%s%s\", dirpath, subdir );\n\t\t}\n\t}\n\treturn rval;\n}\n\nint \nrec_touch_file(char *path, mode_t file_mode, mode_t directory_mode , int pos) \n{\n\tint m_fd = safe_open_wrapper(path, O_CREAT | O_RDWR, file_mode);\n\tif (m_fd > 0) {\n\t\treturn m_fd;\n\t}\t\n\tif (errno == 2) {\n\t\tint size = strlen(path);\n\t\twhile (pos < size){\n\t\t\tif (path[pos] == DIR_DELIM_CHAR && pos > 0){\n\t\t\t\tchar *dir = new char[pos+1];\n\t\t\t\tdir[pos] = '\\0';\n\t\t\t\tstrncpy(dir, path, pos);\n\t\t\t\tdprintf(D_FULLDEBUG, \"directory_util::rec_touch_file: Creating directory %s \\n\", dir);\n\t\t\t\tint err = mkdir(dir, directory_mode);\n\n\t\t\t\tif (err != 0) {\n\t\t\t\t\tif (errno != EEXIST) {\n\t\t\t\t\t\tdprintf(D_ALWAYS, \"directory_util::rec_touch_file: Directory %s cannot be created (%s) \\n\", dir, strerror(errno));\n\t\t\t\t\t\tdelete []dir;\n\t\t\t\t\t\treturn -1;\n\t\t\t\t\t}\n\t\t\t\t} \n\t\t\t\tdelete []dir;\n\t\t\t\t++pos;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t++pos;\n\t\t}\n\t\twhile (pos < size && path[pos] == DIR_DELIM_CHAR){\n\t\t\t++pos;\n\t\t}\n\t\treturn rec_touch_file(path, file_mode, directory_mode, pos);\n\t\t\n\t} else {\n\t\tdprintf(D_ALWAYS, \"directory_util::rec_touch_file: File %s cannot be created (%s) \\n\", path, strerror(errno));\n\t\treturn -1;\n\t}\n\treturn -1;\n} \n\nint \nrec_clean_up(char *path, int depth, int pos ) \n{\n\tif (depth == -1)\n\t\treturn 0;\n\tint deleted;\n\tif (pos < 0) {\n\t\tdeleted =  unlink(path);\n\t\tif (deleted == 0){ \n\t\t\tdprintf(D_FULLDEBUG, \"directory_util::rec_clean_up: file %s has been deleted. \\n\", path);\n\t\t\tif (depth == 0)\n\t\t\t\treturn 0;\n\t\t} else{\n\t\t\tdprintf(D_FULLDEBUG, \"directory_util::rec_clean_up: file %s cannot be deleted. \\n\", path);\n\t\t\treturn -1;\n\t\t}\n\t\tpos = strlen(path);\n\t} else {\n\t\tchar *dirpath = new char[pos+1];\n\t\tdirpath[pos] = '\\0';\n\t\tstrncpy(dirpath, path, pos);\n\t\tdeleted = rmdir(dirpath);\n\t\tif (deleted != 0) {\n\t\t\tdprintf(D_FULLDEBUG, \"directory_util::rec_clean_up: directory %s cannot be deleted -- it may not \\\n\t\t\t\tbe empty and therefore this is not necessarily an error or problem. (Error: %s) \\n\", dirpath, strerror(errno));\n\t\t\tdelete []dirpath;\n\t\t\treturn -1;\n\t\t}\n\t\tdelete []dirpath;\n\t}\n\twhile (path[pos] == DIR_DELIM_CHAR && pos > 0)\n\t\t\t--pos;\n\twhile (pos > 0){\n\t\tif (path[pos] == DIR_DELIM_CHAR ){\n\t\t\treturn rec_clean_up(path, --depth, pos);\n\t\t}\n\t\t--pos; \t\n\t}\n\treturn 0; \t\n}\n\n\n\n<commit_msg>Turn file touch function into an iterative one If a process deletes parts of the directory structure while loop is going, it will restart from scratch and retry up to three times (#2047)<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_config.h\"\n#include \"directory_util.h\"\n\n\/*\n  Returns a path to subdirectory to use for temporary files.\n  The pointer returned must be de-allocated by the caller w\/ free().\n*\/\nchar*\ntemp_dir_path()\n{\n\tchar *prefix = param(\"TMP_DIR\");\n\tif  (!prefix) {\n\t\tprefix = param(\"TEMP_DIR\");\n\t}\n\tif (!prefix) {\n#ifndef WIN32\n\t\tprefix = strdup(\"\/tmp\");\n#else\n\t\t\t\/\/ try to get the temp dir, then try SPOOL,\n\t\t\t\/\/ then use the root directory\n\t\tchar buf[MAX_PATH];\n\t\tint len;\n\t\tif ((len = GetTempPath(sizeof(buf), buf)) <= sizeof(buf)) {\n\t\t\tbuf[len - 1] = '\\0';\n\t\t\tprefix = strdup(buf);\n\t\t} else {\n\t\t\tdprintf(D_ALWAYS, \"GetTempPath: buffer of size %d too small\\n\", sizeof(buf));\n\n\t\t\tprefix = param(\"SPOOL\");\n\t\t\tif (!prefix) {\n\t\t\t\tprefix = strdup(\"\\\\\");\n\t\t\t}\n\t\t}\n#endif\n\t}\n\treturn prefix;\n}\n\n\/*\n  Concatenates a given directory path and filename into a single\n  string, stored in space allocated with new[].  This function makes\n  sure that if the given directory path doesn't end with the\n  appropriate directory delimiter for this platform, that the new\n  string includes that.  Delete return string with delete[].\n*\/\nchar*\ndircat( const char *dirpath, const char *filename )\n{\n\tASSERT(dirpath);\n\tASSERT(filename);\n\tbool needs_delim = true;\n\tint extra = 2, dirlen = strlen(dirpath);\n\tchar* rval;\n\tif( dirpath[dirlen - 1] == DIR_DELIM_CHAR ) {\n\t\tneeds_delim = false;\n\t\textra = 1;\n\t}\n\trval = new char[ extra + dirlen + strlen(filename)];\n\tif( needs_delim ) {\n\t\tsprintf( rval, \"%s%c%s\", dirpath, DIR_DELIM_CHAR, filename );\n\t} else {\n\t\tsprintf( rval, \"%s%s\", dirpath, filename );\n\t}\n\treturn rval;\n}\n\n\/*\n  Concatenates a given directory path and subdirectory path into a single\n  string, stored in space allocated with new[].  This function makes\n  sure that if the given directory path doesn't end with the\n  appropriate directory delimiter for this platform, that the new\n  string includes that -- it will contain the trailing delimiter too.  \n  Delete return string with delete[].\n*\/\nchar*\ndirscat( const char *dirpath, const char *subdir )\n{\n\tASSERT(dirpath);\n\tASSERT(subdir);\n\tbool needs_delim1 = true, needs_delim2 = true;\n\tint extra = 3, dirlen = strlen(dirpath), subdirlen = strlen(subdir);\n\tchar* rval;\n\tif( dirpath[dirlen - 1] == DIR_DELIM_CHAR ) {\n\t\tneeds_delim1 = false;\n\t\t--extra;\n\t}\n\tif (subdir[subdirlen - 1] == DIR_DELIM_CHAR ) {\n\t\t--extra;\n\t\tneeds_delim2 = false;\n\t}\n\trval = new char[ extra + dirlen + strlen(subdir)];\n\tif( needs_delim1 ) {\n\t\tif ( needs_delim2 ) {\n\t\t\tsprintf( rval, \"%s%c%s%c\", dirpath, DIR_DELIM_CHAR, subdir, DIR_DELIM_CHAR );\n\t\t} else {\n\t\t\tsprintf( rval, \"%s%c%s\", dirpath, DIR_DELIM_CHAR, subdir );\n\t\t}\n\t} else {\n\t\tif ( needs_delim2 ) {\n\t\t\tsprintf( rval, \"%s%s%c\", dirpath, subdir, DIR_DELIM_CHAR );\n\t\t} else {\n\t\t\tsprintf( rval, \"%s%s\", dirpath, subdir );\n\t\t}\n\t}\n\treturn rval;\n}\n\nint \nrec_touch_file(char *path, mode_t file_mode, mode_t directory_mode , int pos) \n{\n\t\/\/ in case a process deletes parts of the directory tree, retry up to three times \n\tint retry_value = 4;\n\tint retry = retry_value;\n\tint m_fd = -1;\n\tint size = strlen(path);\n\twhile (m_fd <= 0 && retry > 0 ){\n\t\tm_fd = safe_open_wrapper(path, O_CREAT | O_RDWR, file_mode);\n\t\tif (m_fd > 0)\n\t\t\treturn m_fd;\n\t\tif (errno == 2) {\n\t\t\tif (retry < retry_value) {\n\t\t\t\tdprintf(D_ALWAYS, \"directory_util::rec_touch_file: Directory creation completed successfully but \\\n\t\t\t\t\tstill cannot touch file. Likely another process deleted parts of the directory structure. \\\n\t\t\t\t\tWill retry now to recover (retry attempt %i)\\n\", (retry_value-retry));\n\t\t\t}\n\t\t\tpos = 0;\n\t\t\t--retry;\n\t\t\twhile (pos < size){\n\t\t\t\tif (path[pos] == DIR_DELIM_CHAR && pos > 0){\n\t\t\t\t\tchar *dir = new char[pos+1];\n\t\t\t\t\tdir[pos] = '\\0';\n\t\t\t\t\tstrncpy(dir, path, pos);\n\t\t\t\t\tdprintf(D_FULLDEBUG, \"directory_util::rec_touch_file: Creating directory %s \\n\", dir);\n\t\t\t\t\tint err = mkdir(dir, directory_mode);\n\t\t\t\t\tif (err != 0) {\n\t\t\t\t\t\tif (errno != EEXIST) {\n\t\t\t\t\t\t\tdprintf(D_ALWAYS, \"directory_util::rec_touch_file: Directory %s cannot be created (%s) \\n\", dir, strerror(errno));\n\t\t\t\t\t\t\tdelete []dir;\n\t\t\t\t\t\t\treturn -1;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tdelete []dir;\n\t\t\t\t\t++pos;\n\t\t\t\t}\n\t\t\t\t++pos;\n\t\t\t}\n\t\t} else {\n\t\t\tdprintf(D_ALWAYS, \"directory_util::rec_touch_file: File %s cannot be created (%s) \\n\", path, strerror(errno));\n\t\t\treturn -1;\n\t\t}\n\t}\n\tdprintf(D_ALWAYS, \"Tried to recover from problems but failed. Path to lock file %s cannot be created. Giving up.\\n\", path);\n\treturn -1;\n} \n\n\nint \nrec_clean_up(char *path, int depth, int pos ) \n{\n\tif (depth == -1)\n\t\treturn 0;\n\tint deleted;\n\tif (pos < 0) {\n\t\tdeleted =  unlink(path);\n\t\tif (deleted == 0){ \n\t\t\tdprintf(D_FULLDEBUG, \"directory_util::rec_clean_up: file %s has been deleted. \\n\", path);\n\t\t\tif (depth == 0)\n\t\t\t\treturn 0;\n\t\t} else{\n\t\t\tdprintf(D_FULLDEBUG, \"directory_util::rec_clean_up: file %s cannot be deleted. \\n\", path);\n\t\t\treturn -1;\n\t\t}\n\t\tpos = strlen(path);\n\t} else {\n\t\tchar *dirpath = new char[pos+1];\n\t\tdirpath[pos] = '\\0';\n\t\tstrncpy(dirpath, path, pos);\n\t\tdeleted = rmdir(dirpath);\n\t\tif (deleted != 0) {\n\t\t\tdprintf(D_FULLDEBUG, \"directory_util::rec_clean_up: directory %s cannot be deleted -- it may not \\\n\t\t\t\tbe empty and therefore this is not necessarily an error or problem. (Error: %s) \\n\", dirpath, strerror(errno));\n\t\t\tdelete []dirpath;\n\t\t\treturn -1;\n\t\t}\n\t\tdelete []dirpath;\n\t}\n\twhile (path[pos] == DIR_DELIM_CHAR && pos > 0)\n\t\t\t--pos;\n\twhile (pos > 0){\n\t\tif (path[pos] == DIR_DELIM_CHAR ){\n\t\t\treturn rec_clean_up(path, --depth, pos);\n\t\t}\n\t\t--pos; \t\n\t}\n\treturn 0; \t\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\n\/************************************************************************\n**\n**\tSet up the various dprintf variables based on the configuration file.\n**\n************************************************************************\/\n#define _FILE_OFFSET_BITS 64\n#include \"condor_common.h\"\n#include \"condor_debug.h\"\n#include \"condor_string.h\" \n#include \"condor_sys_types.h\"\n\n#if HAVE_BACKTRACE\n#include \"sig_install.h\"\n#endif\n\nint\t\tTermlog = 0;\n\nextern int\t\tDebugFlags;\nextern FILE\t\t*DebugFPs[D_NUMLEVELS+1];\nextern off_t\t\tMaxLog[D_NUMLEVELS+1];\nextern int \t\t\tMaxLogNum[D_NUMLEVELS+1];\nextern char\t\t*DebugFile[D_NUMLEVELS+1];\nextern char\t\t*DebugLock;\nextern const char\t\t*_condor_DebugFlagNames[];\nextern int\t\t_condor_dprintf_works;\nextern time_t\tDebugLastMod;\nextern int\t\tDebugUseTimestamps;\nextern int      DebugContinueOnOpenFailure;\nextern int\t\tlog_keep_open;\n\nextern void\t\t_condor_set_debug_flags( const char *strflags );\nextern void\t\t_condor_dprintf_saved_lines( void );\n\n#if HAVE_EXT_GCB\nvoid\t_condor_gcb_dprintf_va( int flags, char* fmt, va_list args );\nextern \"C\" void Generic_set_log_va(void(*app_log_va)(int level, char *fmt, va_list args));\n#endif\n\n#if HAVE_BACKTRACE\nstatic void\nsig_backtrace_handler(int signum)\n{\n\tdprintf_dump_stack();\n\n\t\t\/\/ terminate for the same reason.\n\tstruct sigaction sa;\n\tsa.sa_handler = SIG_DFL;\n\tsigemptyset(&sa.sa_mask);\n\tsa.sa_flags = 0;\n\tsigaction(signum, &sa, NULL);\n\tsigprocmask(SIG_SETMASK, &sa.sa_mask, NULL);\n\n\traise(signum);\n}\n\nstatic void\ninstall_backtrace_handler(void)\n{\n\tsigset_t fullset;\n\tsigfillset( &fullset );\n\tinstall_sig_handler_with_mask(SIGSEGV, &fullset, sig_backtrace_handler);\n\tinstall_sig_handler_with_mask(SIGABRT, &fullset, sig_backtrace_handler);\n\tinstall_sig_handler_with_mask(SIGILL, &fullset, sig_backtrace_handler);\n\tinstall_sig_handler_with_mask(SIGFPE, &fullset, sig_backtrace_handler);\n\tinstall_sig_handler_with_mask(SIGBUS, &fullset, sig_backtrace_handler);\n}\n#endif\n\nint\ndprintf_config_ContinueOnFailure ( int fContinue )\n{\n    int fOld = DebugContinueOnOpenFailure;\n\tDebugContinueOnOpenFailure = fContinue;\n\treturn fOld;\n}\n\nvoid\ndprintf_config( const char *subsys )\n{\n\tchar pname[ BUFSIZ ];\n\tchar *pval;\n\tstatic int first_time = 1;\n\tint want_truncate;\n\tint debug_level;\n\tFILE *debug_file_fp;\n\tint log_open_default = TRUE;\n\n\t\/*  \n\t**  We want to initialize this here so if we reconfig and the\n\t**\tdebug flags have changed, we actually use the new\n\t**  flags.  -Derek Wright 12\/8\/97 \n\t*\/\n\tDebugFlags = D_ALWAYS;\n\n\t\/*\n\t** First, add the debug flags that are shared by everyone.\n\t*\/\n\tpval = param(\"ALL_DEBUG\");\n\tif( pval ) {\n\t\t_condor_set_debug_flags( pval );\n\t\tfree( pval );\n\t}\n\n\t\/*\n\t**  Then, pick up the subsys_DEBUG parameters.   Note: if we don't have\n\t**  anything set, we just leave it as D_ALWAYS.\n\t*\/\n\t(void)sprintf(pname, \"%s_DEBUG\", subsys);\n\tpval = param(pname);\n\tif( pval ) {\n\t\t_condor_set_debug_flags( pval );\n\t\tfree( pval );\n\t}\n\n#ifdef WIN32\n\t\t\/* Two reasons why we need to lock the log in Windows\n\t\t * (when a lock is configured)\n\t\t * 1) File rotation requires exclusive access in Windows.\n\t\t * 2) O_APPEND doesn't guarantee atomic writes in Windows\n\t\t *\/\n\tDebugShouldLockToAppend = 1;\n#else\n\tDebugShouldLockToAppend = param_boolean_int(\"LOCK_DEBUG_LOG_TO_APPEND\",0);\n#endif\n\n\t\/*\n\t**\tIf this is not going to the terminal, pick up the name\n\t**\tof the log file, maximum log size, and the name of the\n\t**\tlock file (if it is specified).\n\t*\/\n\tif( !( Termlog) ) {\n\t\tfor (debug_level = 0; debug_level <= D_NUMLEVELS; debug_level++) {\n\t\t\twant_truncate = 0;\n\t\t\tif (debug_level == 0) {\n\t\t\t\t\/*\n\t\t\t\t** the level 0 file gets all debug messages; thus, the\n\t\t\t\t** offset into DebugFlagNames is off by one, since the\n\t\t\t\t** first level-specific file goes into the other arrays at\n\t\t\t\t** index 1\n\t\t\t\t*\/\n\t\t\t\t(void)sprintf(pname, \"%s_LOG\", subsys);\n\t\t\t} else {\n\t\t\t\t(void)sprintf(pname, \"%s_%s_LOG\", subsys,\n\t\t\t\t\t\t\t  _condor_DebugFlagNames[debug_level-1]+2);\n\t\t\t}\n\n\t\t\t\/\/ Hold a temporary copy of the old file pointer until\n\t\t\t\/\/ *after* the param -- param can dprintf() in some cases\n\t\t\t{\n\t\t\t\tchar\t*tmp = DebugFile[debug_level];\n\n\t\t\t\t\/\/ NEGOTIATOR_MATCH_LOG is necessary by default, but debug_level\n\t\t\t\t\/\/ is not 0\n\t\t\t\tif(debug_level == 0)\n\t\t\t\t{\n\t\t\t\t\tchar\t*tmp2 = param(pname);\n\n\t\t\t\t\t\/\/ No default value found, so use $(LOG)\/$(SUBSYSTEM)Log\n\t\t\t\t\tif(!tmp2) {\n\t\t\t\t\t\t\/\/ This char* will never be freed, but as long as\n\t\t\t\t\t\t\/\/ defaults are defined in condor_c++_util\/param_info.in\n\t\t\t\t\t\t\/\/ we will never get here.\n\t\t\t\t\t\tchar *str;\n\t\t\t\t\t\tchar *log = param(\"LOG\");\n\t\t\t\t\t\tchar *lsubsys = param(\"SUBSYSTEM\");\n\t\t\t\t\t\tif(!log || !lsubsys) {\n\t\t\t\t\t\t\tEXCEPT(\"Unable to find LOG or SUBSYSTEM.\\n\");\n\t\t\t\t\t\t}\n\t\t\t\t\t\t\n\t\t\t\t\t\tstr = (char*)malloc(strlen(log) + strlen(lsubsys) + 5);\n\t\t\t\t\t\tsprintf(str, \"%s%c%sLog\", log, DIR_DELIM_CHAR, lsubsys);\n\t\t\t\t\t\t\n\t\t\t\t\t\tDebugFile[debug_level] = str;\n\n\t\t\t\t\t\tfree(log);\n\t\t\t\t\t\tfree(lsubsys);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tDebugFile[debug_level] = tmp2;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\t\/\/ This is looking up configuration options that I can't\n\t\t\t\t\t\/\/ find documentation for, so intead of coding in an\n\t\t\t\t\t\/\/ incorrect default value, I'm gonna use \n\t\t\t\t\t\/\/ param_without_default.\n\t\t\t\t\t\/\/ tristan 5\/29\/09\n\t\t\t\t\tDebugFile[debug_level] = param_without_default(pname);\n\t\t\t\t}\n\t\t\t\tif ( tmp ) {\n\t\t\t\t\tfree( tmp );\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif( debug_level == 0 && DebugFile[0] == NULL ) {\n\t\t\t\tEXCEPT(\"No '%s' parameter specified.\", pname);\n\t\t\t} else if ( DebugFile[debug_level] != NULL ) {\n\n\t\t\t\tif (debug_level == 0 && first_time) {\n\t\t\t\t\tstruct stat stat_buf;\n\t\t\t\t\tif ( stat( DebugFile[debug_level], &stat_buf ) >= 0 ) {\n\t\t\t\t\t\tDebugLastMod = stat_buf.st_mtime > stat_buf.st_ctime ? stat_buf.st_mtime : stat_buf.st_ctime;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tDebugLastMod = -errno;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif (debug_level == 0) {\n\t\t\t\t\t(void)sprintf(pname, \"TRUNC_%s_LOG_ON_OPEN\", subsys);\n\t\t\t\t} else {\n\t\t\t\t\t(void)sprintf(pname, \"TRUNC_%s_%s_LOG_ON_OPEN\", subsys,\n\t\t\t\t\t\t\t\t  _condor_DebugFlagNames[debug_level-1]+2);\n\t\t\t\t}\n\t\t\t\tpval = param(pname);\n\t\t\t\tif( pval ) {\n\t\t\t\t\tif( *pval == 't' || *pval == 'T' ) {\n\t\t\t\t\t\twant_truncate = 1;\n\t\t\t\t\t} \n\t\t\t\t\tfree(pval);\n\t\t\t\t}\n\n\t\t\t\tif (debug_level == 0) {\n\t\t\t\t\t(void)sprintf(pname, \"%s_LOCK\", subsys);\n\t\t\t\t\tif (DebugLock) {\n\t\t\t\t\t\tfree(DebugLock);\n\t\t\t\t\t}\n\t\t\t\t\tDebugLock = param(pname);\n\t\t\t\t}\n\n\t\t\t\tif( first_time && want_truncate ) {\n\t\t\t\t\tdebug_file_fp = debug_lock(debug_level, \"w\", 0);\n\t\t\t\t} else {\n\t\t\t\t\tdebug_file_fp = debug_lock(debug_level, \"a\", 0);\n\t\t\t\t}\n\n\t\t\t\tif( debug_file_fp == NULL && debug_level == 0 ) {\n                   #ifdef WIN32\n\t\t\t\t\t\/*\n\t\t\t\t\t** If we could not open the log file, we might want to keep running anyway.\n\t\t\t\t\t** If we do, then set the log filename to NUL so we don't keep trying\n\t\t\t\t\t** (and failing) to open the file.\n\t\t\t\t\t*\/\n\t\t\t\t\tif (DebugContinueOnOpenFailure) {\n\n\t\t\t\t\t\t\/\/ change the debug file to point to the NUL device.\n\t\t\t\t\t\tstatic const char strDevNull[] = \"NUL\";\/\/\"\\\\\\\\.\\\\Device\\\\Null\";\n\t\t\t\t\t\tchar * psz = (char*)malloc(sizeof(strDevNull));\n\t\t\t\t\t\tstrcpy(psz, strDevNull);\n\t\t\t\t\t\tif (DebugFile[debug_level]) \n\t\t\t\t\t\t\tfree(DebugFile[debug_level]);\n\t\t\t\t\t\tDebugFile[debug_level] = psz;\n\n\t\t\t\t\t} else\n                   #endif\n\t\t\t\t\t{\n\t\t\t\t\t    EXCEPT(\"Cannot open log file '%s'\",\n\t\t\t\t\t\t       DebugFile[debug_level]);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif (debug_file_fp) (void)debug_unlock( debug_level );\n\t\t\t\tdebug_file_fp = NULL;\n\n\t\t\t\tif (debug_level == 0) {\n\t\t\t\t\t(void)sprintf(pname, \"MAX_%s_LOG\", subsys);\n\t\t\t\t} else {\n\t\t\t\t\t(void)sprintf(pname, \"MAX_%s_%s_LOG\", subsys,\n\t\t\t\t\t\t\t\t  _condor_DebugFlagNames[debug_level-1]+2);\n\t\t\t\t}\n\t\t\t\tpval = param(pname);\n\t\t\t\tif( pval != NULL ) {\n\t\t\t\t\tMaxLog[debug_level] = atoi( pval );\n\t\t\t\t\tfree(pval);\n\t\t\t\t} else {\n\t\t\t\t\tMaxLog[debug_level] = 1024*1024;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif (debug_level == 0) {\n\t\t\t\t\t(void)sprintf(pname, \"MAX_NUM_%s_LOG\", subsys);\n\t\t\t\t} else {\n\t\t\t\t\t(void)sprintf(pname, \"MAX_NUM_%s_%s_LOG\", subsys,\n\t\t\t\t\t\t\t\t  _condor_DebugFlagNames[debug_level-1]+2);\n\t\t\t\t}\n\t\t\t\tpval = param(pname);\n\t\t\t\tif (pval != NULL) {\n\t\t\t\t\tMaxLogNum[debug_level] = atoi(pval);\n\t\t\t\t\tfree(pval);\n\t\t\t\t} else {\n\t\t\t\t\tMaxLogNum[debug_level] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t} else {\n\n#if !defined(WIN32)\n\t\tsetlinebuf( stderr );\n#endif\n\n\t\t(void)fflush( stderr );\t\/* Don't know why we need this, but if not here\n\t\t\t\t\t\t\t   the first couple dprintf don't come out right *\/\n\t}\n\n#ifndef WIN32\n\tif((strcmp(subsys, \"SHADOW\") == 0) || (strcmp(subsys, \"GRIDMANAGER\") == 0))\n\t{\n\t\tlog_open_default = FALSE;\n\t}\n#endif\n\n\tif(!DebugLock) {\n\t\tsprintf(pname, \"%s_LOG_KEEP_OPEN\", subsys);\n\t\tlog_keep_open = param_boolean_int(pname, log_open_default);\n\t}\n\n\tfirst_time = 0;\n\t_condor_dprintf_works = 1;\n#if HAVE_EXT_GCB\n\t\t\/*\n\t\t  this method currently only lives in libGCB.a, so don't even\n\t\t  try to param() or call this function unless we're on a\n\t\t  platform where we're using the GCB external\n\t\t*\/\n    if ( param_boolean_int(\"NET_REMAP_ENABLE\", 0) ) {\n        Generic_set_log_va(_condor_gcb_dprintf_va);\n    }\n#endif\n\n\t\t\/*\n\t\t  If LOGS_USE_TIMESTAMP is enabled, we will print out Unix timestamps\n\t\t  instead of the standard date format in all the log messages\n\t\t*\/\n\tDebugUseTimestamps = param_boolean_int( \"LOGS_USE_TIMESTAMP\", FALSE );\n\n#if HAVE_BACKTRACE\n\tinstall_backtrace_handler();\n#endif\n\n\t_condor_dprintf_saved_lines();\n}\n\n\n#if HAVE_EXT_GCB\nvoid\n_condor_gcb_dprintf_va( int flags, char* fmt, va_list args )\n{\n\tchar* new_fmt;\n\tint len;\n\n\tlen = strlen(fmt);\n\tnew_fmt = (char*) malloc( (len + 6) * sizeof(char) );\n\tif( ! new_fmt ) {\n\t\tEXCEPT( \"_condor_gcb_dprintf_va() out of memory!\" );\n\t}\n\tsnprintf( new_fmt, len + 6, \"GCB: %s\", fmt );\n\t_condor_dprintf_va( flags, new_fmt, args );\n\tfree( new_fmt );\n}\n#endif \/* HAVE_EXT_GCB *\/\n<commit_msg>param+char check -> param_boolean_crufty for TRUNC_..._LOG_ON_OPEN<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\/************************************************************************\n**\n**\tSet up the various dprintf variables based on the configuration file.\n**\n************************************************************************\/\n#define _FILE_OFFSET_BITS 64\n#include \"condor_common.h\"\n#include \"condor_debug.h\"\n#include \"condor_string.h\" \n#include \"condor_sys_types.h\"\n\n#if HAVE_BACKTRACE\n#include \"sig_install.h\"\n#endif\n\nint\t\tTermlog = 0;\n\nextern int\t\tDebugFlags;\nextern FILE\t\t*DebugFPs[D_NUMLEVELS+1];\nextern off_t\t\tMaxLog[D_NUMLEVELS+1];\nextern int \t\t\tMaxLogNum[D_NUMLEVELS+1];\nextern char\t\t*DebugFile[D_NUMLEVELS+1];\nextern char\t\t*DebugLock;\nextern const char\t\t*_condor_DebugFlagNames[];\nextern int\t\t_condor_dprintf_works;\nextern time_t\tDebugLastMod;\nextern int\t\tDebugUseTimestamps;\nextern int      DebugContinueOnOpenFailure;\nextern int\t\tlog_keep_open;\n\nextern void\t\t_condor_set_debug_flags( const char *strflags );\nextern void\t\t_condor_dprintf_saved_lines( void );\n\n#if HAVE_EXT_GCB\nvoid\t_condor_gcb_dprintf_va( int flags, char* fmt, va_list args );\nextern \"C\" void Generic_set_log_va(void(*app_log_va)(int level, char *fmt, va_list args));\n#endif\n\n#if HAVE_BACKTRACE\nstatic void\nsig_backtrace_handler(int signum)\n{\n\tdprintf_dump_stack();\n\n\t\t\/\/ terminate for the same reason.\n\tstruct sigaction sa;\n\tsa.sa_handler = SIG_DFL;\n\tsigemptyset(&sa.sa_mask);\n\tsa.sa_flags = 0;\n\tsigaction(signum, &sa, NULL);\n\tsigprocmask(SIG_SETMASK, &sa.sa_mask, NULL);\n\n\traise(signum);\n}\n\nstatic void\ninstall_backtrace_handler(void)\n{\n\tsigset_t fullset;\n\tsigfillset( &fullset );\n\tinstall_sig_handler_with_mask(SIGSEGV, &fullset, sig_backtrace_handler);\n\tinstall_sig_handler_with_mask(SIGABRT, &fullset, sig_backtrace_handler);\n\tinstall_sig_handler_with_mask(SIGILL, &fullset, sig_backtrace_handler);\n\tinstall_sig_handler_with_mask(SIGFPE, &fullset, sig_backtrace_handler);\n\tinstall_sig_handler_with_mask(SIGBUS, &fullset, sig_backtrace_handler);\n}\n#endif\n\nint\ndprintf_config_ContinueOnFailure ( int fContinue )\n{\n    int fOld = DebugContinueOnOpenFailure;\n\tDebugContinueOnOpenFailure = fContinue;\n\treturn fOld;\n}\n\nvoid\ndprintf_config( const char *subsys )\n{\n\tchar pname[ BUFSIZ ];\n\tchar *pval;\n\tstatic int first_time = 1;\n\tint want_truncate;\n\tint debug_level;\n\tFILE *debug_file_fp;\n\tint log_open_default = TRUE;\n\n\t\/*  \n\t**  We want to initialize this here so if we reconfig and the\n\t**\tdebug flags have changed, we actually use the new\n\t**  flags.  -Derek Wright 12\/8\/97 \n\t*\/\n\tDebugFlags = D_ALWAYS;\n\n\t\/*\n\t** First, add the debug flags that are shared by everyone.\n\t*\/\n\tpval = param(\"ALL_DEBUG\");\n\tif( pval ) {\n\t\t_condor_set_debug_flags( pval );\n\t\tfree( pval );\n\t}\n\n\t\/*\n\t**  Then, pick up the subsys_DEBUG parameters.   Note: if we don't have\n\t**  anything set, we just leave it as D_ALWAYS.\n\t*\/\n\t(void)sprintf(pname, \"%s_DEBUG\", subsys);\n\tpval = param(pname);\n\tif( pval ) {\n\t\t_condor_set_debug_flags( pval );\n\t\tfree( pval );\n\t}\n\n#ifdef WIN32\n\t\t\/* Two reasons why we need to lock the log in Windows\n\t\t * (when a lock is configured)\n\t\t * 1) File rotation requires exclusive access in Windows.\n\t\t * 2) O_APPEND doesn't guarantee atomic writes in Windows\n\t\t *\/\n\tDebugShouldLockToAppend = 1;\n#else\n\tDebugShouldLockToAppend = param_boolean_int(\"LOCK_DEBUG_LOG_TO_APPEND\",0);\n#endif\n\n\t\/*\n\t**\tIf this is not going to the terminal, pick up the name\n\t**\tof the log file, maximum log size, and the name of the\n\t**\tlock file (if it is specified).\n\t*\/\n\tif( !( Termlog) ) {\n\t\tfor (debug_level = 0; debug_level <= D_NUMLEVELS; debug_level++) {\n\t\t\twant_truncate = 0;\n\t\t\tif (debug_level == 0) {\n\t\t\t\t\/*\n\t\t\t\t** the level 0 file gets all debug messages; thus, the\n\t\t\t\t** offset into DebugFlagNames is off by one, since the\n\t\t\t\t** first level-specific file goes into the other arrays at\n\t\t\t\t** index 1\n\t\t\t\t*\/\n\t\t\t\t(void)sprintf(pname, \"%s_LOG\", subsys);\n\t\t\t} else {\n\t\t\t\t(void)sprintf(pname, \"%s_%s_LOG\", subsys,\n\t\t\t\t\t\t\t  _condor_DebugFlagNames[debug_level-1]+2);\n\t\t\t}\n\n\t\t\t\/\/ Hold a temporary copy of the old file pointer until\n\t\t\t\/\/ *after* the param -- param can dprintf() in some cases\n\t\t\t{\n\t\t\t\tchar\t*tmp = DebugFile[debug_level];\n\n\t\t\t\t\/\/ NEGOTIATOR_MATCH_LOG is necessary by default, but debug_level\n\t\t\t\t\/\/ is not 0\n\t\t\t\tif(debug_level == 0)\n\t\t\t\t{\n\t\t\t\t\tchar\t*tmp2 = param(pname);\n\n\t\t\t\t\t\/\/ No default value found, so use $(LOG)\/$(SUBSYSTEM)Log\n\t\t\t\t\tif(!tmp2) {\n\t\t\t\t\t\t\/\/ This char* will never be freed, but as long as\n\t\t\t\t\t\t\/\/ defaults are defined in condor_c++_util\/param_info.in\n\t\t\t\t\t\t\/\/ we will never get here.\n\t\t\t\t\t\tchar *str;\n\t\t\t\t\t\tchar *log = param(\"LOG\");\n\t\t\t\t\t\tchar *lsubsys = param(\"SUBSYSTEM\");\n\t\t\t\t\t\tif(!log || !lsubsys) {\n\t\t\t\t\t\t\tEXCEPT(\"Unable to find LOG or SUBSYSTEM.\\n\");\n\t\t\t\t\t\t}\n\t\t\t\t\t\t\n\t\t\t\t\t\tstr = (char*)malloc(strlen(log) + strlen(lsubsys) + 5);\n\t\t\t\t\t\tsprintf(str, \"%s%c%sLog\", log, DIR_DELIM_CHAR, lsubsys);\n\t\t\t\t\t\t\n\t\t\t\t\t\tDebugFile[debug_level] = str;\n\n\t\t\t\t\t\tfree(log);\n\t\t\t\t\t\tfree(lsubsys);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tDebugFile[debug_level] = tmp2;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\t\/\/ This is looking up configuration options that I can't\n\t\t\t\t\t\/\/ find documentation for, so intead of coding in an\n\t\t\t\t\t\/\/ incorrect default value, I'm gonna use \n\t\t\t\t\t\/\/ param_without_default.\n\t\t\t\t\t\/\/ tristan 5\/29\/09\n\t\t\t\t\tDebugFile[debug_level] = param_without_default(pname);\n\t\t\t\t}\n\t\t\t\tif ( tmp ) {\n\t\t\t\t\tfree( tmp );\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif( debug_level == 0 && DebugFile[0] == NULL ) {\n\t\t\t\tEXCEPT(\"No '%s' parameter specified.\", pname);\n\t\t\t} else if ( DebugFile[debug_level] != NULL ) {\n\n\t\t\t\tif (debug_level == 0 && first_time) {\n\t\t\t\t\tstruct stat stat_buf;\n\t\t\t\t\tif ( stat( DebugFile[debug_level], &stat_buf ) >= 0 ) {\n\t\t\t\t\t\tDebugLastMod = stat_buf.st_mtime > stat_buf.st_ctime ? stat_buf.st_mtime : stat_buf.st_ctime;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tDebugLastMod = -errno;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif (debug_level == 0) {\n\t\t\t\t\t(void)sprintf(pname, \"TRUNC_%s_LOG_ON_OPEN\", subsys);\n\t\t\t\t} else {\n\t\t\t\t\t(void)sprintf(pname, \"TRUNC_%s_%s_LOG_ON_OPEN\", subsys,\n\t\t\t\t\t\t\t\t  _condor_DebugFlagNames[debug_level-1]+2);\n\t\t\t\t}\n\t\t\t\twant_truncate = param_boolean_crufty(pname, false) ? 1 : 0;\n\n\t\t\t\tif (debug_level == 0) {\n\t\t\t\t\t(void)sprintf(pname, \"%s_LOCK\", subsys);\n\t\t\t\t\tif (DebugLock) {\n\t\t\t\t\t\tfree(DebugLock);\n\t\t\t\t\t}\n\t\t\t\t\tDebugLock = param(pname);\n\t\t\t\t}\n\n\t\t\t\tif( first_time && want_truncate ) {\n\t\t\t\t\tdebug_file_fp = debug_lock(debug_level, \"w\", 0);\n\t\t\t\t} else {\n\t\t\t\t\tdebug_file_fp = debug_lock(debug_level, \"a\", 0);\n\t\t\t\t}\n\n\t\t\t\tif( debug_file_fp == NULL && debug_level == 0 ) {\n                   #ifdef WIN32\n\t\t\t\t\t\/*\n\t\t\t\t\t** If we could not open the log file, we might want to keep running anyway.\n\t\t\t\t\t** If we do, then set the log filename to NUL so we don't keep trying\n\t\t\t\t\t** (and failing) to open the file.\n\t\t\t\t\t*\/\n\t\t\t\t\tif (DebugContinueOnOpenFailure) {\n\n\t\t\t\t\t\t\/\/ change the debug file to point to the NUL device.\n\t\t\t\t\t\tstatic const char strDevNull[] = \"NUL\";\/\/\"\\\\\\\\.\\\\Device\\\\Null\";\n\t\t\t\t\t\tchar * psz = (char*)malloc(sizeof(strDevNull));\n\t\t\t\t\t\tstrcpy(psz, strDevNull);\n\t\t\t\t\t\tif (DebugFile[debug_level]) \n\t\t\t\t\t\t\tfree(DebugFile[debug_level]);\n\t\t\t\t\t\tDebugFile[debug_level] = psz;\n\n\t\t\t\t\t} else\n                   #endif\n\t\t\t\t\t{\n\t\t\t\t\t    EXCEPT(\"Cannot open log file '%s'\",\n\t\t\t\t\t\t       DebugFile[debug_level]);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif (debug_file_fp) (void)debug_unlock( debug_level );\n\t\t\t\tdebug_file_fp = NULL;\n\n\t\t\t\tif (debug_level == 0) {\n\t\t\t\t\t(void)sprintf(pname, \"MAX_%s_LOG\", subsys);\n\t\t\t\t} else {\n\t\t\t\t\t(void)sprintf(pname, \"MAX_%s_%s_LOG\", subsys,\n\t\t\t\t\t\t\t\t  _condor_DebugFlagNames[debug_level-1]+2);\n\t\t\t\t}\n\t\t\t\tpval = param(pname);\n\t\t\t\tif( pval != NULL ) {\n\t\t\t\t\tMaxLog[debug_level] = atoi( pval );\n\t\t\t\t\tfree(pval);\n\t\t\t\t} else {\n\t\t\t\t\tMaxLog[debug_level] = 1024*1024;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif (debug_level == 0) {\n\t\t\t\t\t(void)sprintf(pname, \"MAX_NUM_%s_LOG\", subsys);\n\t\t\t\t} else {\n\t\t\t\t\t(void)sprintf(pname, \"MAX_NUM_%s_%s_LOG\", subsys,\n\t\t\t\t\t\t\t\t  _condor_DebugFlagNames[debug_level-1]+2);\n\t\t\t\t}\n\t\t\t\tpval = param(pname);\n\t\t\t\tif (pval != NULL) {\n\t\t\t\t\tMaxLogNum[debug_level] = atoi(pval);\n\t\t\t\t\tfree(pval);\n\t\t\t\t} else {\n\t\t\t\t\tMaxLogNum[debug_level] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t} else {\n\n#if !defined(WIN32)\n\t\tsetlinebuf( stderr );\n#endif\n\n\t\t(void)fflush( stderr );\t\/* Don't know why we need this, but if not here\n\t\t\t\t\t\t\t   the first couple dprintf don't come out right *\/\n\t}\n\n#ifndef WIN32\n\tif((strcmp(subsys, \"SHADOW\") == 0) || (strcmp(subsys, \"GRIDMANAGER\") == 0))\n\t{\n\t\tlog_open_default = FALSE;\n\t}\n#endif\n\n\tif(!DebugLock) {\n\t\tsprintf(pname, \"%s_LOG_KEEP_OPEN\", subsys);\n\t\tlog_keep_open = param_boolean_int(pname, log_open_default);\n\t}\n\n\tfirst_time = 0;\n\t_condor_dprintf_works = 1;\n#if HAVE_EXT_GCB\n\t\t\/*\n\t\t  this method currently only lives in libGCB.a, so don't even\n\t\t  try to param() or call this function unless we're on a\n\t\t  platform where we're using the GCB external\n\t\t*\/\n    if ( param_boolean_int(\"NET_REMAP_ENABLE\", 0) ) {\n        Generic_set_log_va(_condor_gcb_dprintf_va);\n    }\n#endif\n\n\t\t\/*\n\t\t  If LOGS_USE_TIMESTAMP is enabled, we will print out Unix timestamps\n\t\t  instead of the standard date format in all the log messages\n\t\t*\/\n\tDebugUseTimestamps = param_boolean_int( \"LOGS_USE_TIMESTAMP\", FALSE );\n\n#if HAVE_BACKTRACE\n\tinstall_backtrace_handler();\n#endif\n\n\t_condor_dprintf_saved_lines();\n}\n\n\n#if HAVE_EXT_GCB\nvoid\n_condor_gcb_dprintf_va( int flags, char* fmt, va_list args )\n{\n\tchar* new_fmt;\n\tint len;\n\n\tlen = strlen(fmt);\n\tnew_fmt = (char*) malloc( (len + 6) * sizeof(char) );\n\tif( ! new_fmt ) {\n\t\tEXCEPT( \"_condor_gcb_dprintf_va() out of memory!\" );\n\t}\n\tsnprintf( new_fmt, len + 6, \"GCB: %s\", fmt );\n\t_condor_dprintf_va( flags, new_fmt, args );\n\tfree( new_fmt );\n}\n#endif \/* HAVE_EXT_GCB *\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"ClientHelpOperation.hpp\"\n\n#include \"DataStorage.hpp\"\n#include \"ClientBackend.hpp\"\n#include \"ClientConnection.hpp\"\n#include \"ClientRpcLayer.hpp\"\n#include \"ClientRpcHelpLayer.hpp\"\n#include \"PendingRpcOperation.hpp\"\n\n#include \"RpcError.hpp\"\n\n#ifdef DEVELOPER_BUILD\n#include \"MTProto\/TLTypesDebug.hpp\"\n#endif\n\n#include <QLoggingCategory>\n\nnamespace Telegram {\n\nnamespace Client {\n\nHelpOperation::HelpOperation(QObject *parent) :\n    PendingOperation(parent)\n{\n}\n\nvoid HelpOperation::setBackend(Backend *backend)\n{\n    m_backend = backend;\n}\n\nvoid HelpOperation::setRunMethod(HelpOperation::RunMethod method)\n{\n    m_runMethod = method;\n}\n\nvoid HelpOperation::startImplementation()\n{\n    if (m_runMethod) {\n        callMember<>(this, m_runMethod);\n    }\n}\n\nPendingOperation *HelpOperation::requestDcConfig()\n{\n    PendingRpcOperation *requestCodeOperation = helpLayer()->getConfig();\n    connect(requestCodeOperation, &PendingRpcOperation::finished, this, &HelpOperation::onGetDcConfigurationFinished);\n    return requestCodeOperation;\n}\n\nHelpRpcLayer *HelpOperation::helpLayer() const\n{\n    return m_backend->helpLayer();\n}\n\nvoid HelpOperation::onGetDcConfigurationFinished(PendingRpcOperation *operation)\n{\n    if (operation->isFailed()) {\n        setFinishedWithError(operation->errorDetails());\n        return;\n    }\n    TLConfig result;\n    helpLayer()->processReply(operation, &result);\n    if (!result.isValid()) {\n        setFinishedWithError(operation->errorDetails());\n        return;\n    }\n    DcConfiguration config;\n    for (const TLDcOption &opt : result.dcOptions) {\n        DcOption o;\n        o.id = opt.id;\n        o.flags = opt.flags;\n        o.address = opt.ipAddress;\n        o.port = opt.port;\n        config.dcOptions.append(o);\n    }\n    Connection *c = Connection::fromOperation(operation);\n    DcOption thisOpt = c->dcOption();\n    thisOpt.id = result.thisDc;\n    c->setDcOption(thisOpt);\n    config.testMode = result.testMode;\n    config.chatSizeMax = result.chatSizeMax;\n    config.megagroupSizeMax = result.megagroupSizeMax;\n    config.forwardedCountMax = result.forwardedCountMax;\n    config.meUrlPrefix = result.meUrlPrefix;\n    m_backend->dataStorage()->setServerConfiguration(config);\n    setFinished();\n}\n\n} \/\/ Client\n\n} \/\/ Telegram namespace\n<commit_msg>Client: Add missing value processing on got DC config<commit_after>#include \"ClientHelpOperation.hpp\"\n\n#include \"DataStorage.hpp\"\n#include \"ClientBackend.hpp\"\n#include \"ClientConnection.hpp\"\n#include \"ClientRpcLayer.hpp\"\n#include \"ClientRpcHelpLayer.hpp\"\n#include \"PendingRpcOperation.hpp\"\n\n#include \"RpcError.hpp\"\n\n#ifdef DEVELOPER_BUILD\n#include \"MTProto\/TLTypesDebug.hpp\"\n#endif\n\n#include <QLoggingCategory>\n\nnamespace Telegram {\n\nnamespace Client {\n\nHelpOperation::HelpOperation(QObject *parent) :\n    PendingOperation(parent)\n{\n}\n\nvoid HelpOperation::setBackend(Backend *backend)\n{\n    m_backend = backend;\n}\n\nvoid HelpOperation::setRunMethod(HelpOperation::RunMethod method)\n{\n    m_runMethod = method;\n}\n\nvoid HelpOperation::startImplementation()\n{\n    if (m_runMethod) {\n        callMember<>(this, m_runMethod);\n    }\n}\n\nPendingOperation *HelpOperation::requestDcConfig()\n{\n    PendingRpcOperation *requestCodeOperation = helpLayer()->getConfig();\n    connect(requestCodeOperation, &PendingRpcOperation::finished, this, &HelpOperation::onGetDcConfigurationFinished);\n    return requestCodeOperation;\n}\n\nHelpRpcLayer *HelpOperation::helpLayer() const\n{\n    return m_backend->helpLayer();\n}\n\nvoid HelpOperation::onGetDcConfigurationFinished(PendingRpcOperation *operation)\n{\n    if (operation->isFailed()) {\n        setFinishedWithError(operation->errorDetails());\n        return;\n    }\n    TLConfig result;\n    helpLayer()->processReply(operation, &result);\n    if (!result.isValid()) {\n        setFinishedWithError(operation->errorDetails());\n        return;\n    }\n    DcConfiguration config;\n    for (const TLDcOption &opt : result.dcOptions) {\n        DcOption o;\n        o.id = opt.id;\n        o.flags = opt.flags;\n        o.address = opt.ipAddress;\n        o.port = opt.port;\n        config.dcOptions.append(o);\n    }\n    Connection *c = Connection::fromOperation(operation);\n    DcOption thisOpt = c->dcOption();\n    thisOpt.id = result.thisDc;\n    c->setDcOption(thisOpt);\n    config.testMode = result.testMode;\n    config.chatSizeMax = result.chatSizeMax;\n    config.megagroupSizeMax = result.megagroupSizeMax;\n    config.forwardedCountMax = result.forwardedCountMax;\n    config.onlineCloudTimeoutMs = result.onlineCloudTimeoutMs;\n    config.onlineUpdatePeriodMs = result.onlineUpdatePeriodMs;\n    config.offlineBlurTimeoutMs = result.offlineBlurTimeoutMs;\n    config.offlineIdleTimeoutMs = result.offlineIdleTimeoutMs;\n    config.meUrlPrefix = result.meUrlPrefix;\n    m_backend->dataStorage()->setServerConfiguration(config);\n    setFinished();\n}\n\n} \/\/ Client\n\n} \/\/ Telegram namespace\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Licensed GNU LGPL v2.1 or later: http:\/\/www.gnu.org\/licenses\/lgpl.html\n#include \"monitor.hh\"\n#include \"bseengine.hh\"\n#include \"bseserver.hh\"\n\nnamespace Bse {\n\nSignalMonitorImpl::SignalMonitorImpl (SourceImplP source, uint ochannel) :\n  source_ (source), ochannel_ (ochannel)\n{\n  assert_return (source != NULL);\n  assert_return (ochannel < size_t (source->n_ochannels()));\n}\n\nSignalMonitorImpl::~SignalMonitorImpl ()\n{\n  source_->cmon_sub_probe (ochannel_, probe_features_); \/\/ potentially deletes module\n  probe_features_ = ProbeFeatures();\n}\n\nSourceIfaceP\nSignalMonitorImpl::get_osource ()\n{\n  return source_;\n}\n\nint32\nSignalMonitorImpl::get_ochannel()\n{\n  return ochannel_;\n}\n\nint64\nSignalMonitorImpl::get_shm_id ()\n{\n  SharedBlock sb = source_->cmon_get_block();\n  return sb.shm_id;\n}\n\nint64\nSignalMonitorImpl::get_shm_offset()\n{\n  SharedBlock sb = source_->cmon_get_block();\n  MonitorFields *fields0 = source_->cmon_get_fields (0);\n  assert_return (sb.mem_start == (void*) fields0, 0);\n  MonitorFields *fieldsn = source_->cmon_get_fields (ochannel_);\n  const size_t channel_offset = ((char*) fieldsn) - ((char*) fields0);\n  return sb.mem_offset + channel_offset;\n  static_assert (sizeof (Bse::MonitorFields) == sizeof (double) * 4 + sizeof (int64));\n}\n\nint64\nSignalMonitorImpl::get_mix_freq ()\n{\n  return 0;\n}\n\nint64\nSignalMonitorImpl::get_frame_duration ()\n{\n  return 0;\n}\n\nvoid\nSignalMonitorImpl::set_probe_features (const ProbeFeatures &pf)\n{\n  return_unless (pf != probe_features_);\n  source_->cmon_add_probe (ochannel_, pf);              \/\/ potentially creates new module\n  source_->cmon_sub_probe (ochannel_, probe_features_); \/\/ potentially deletes module\n  probe_features_ = pf;\n}\n\nProbeFeatures\nSignalMonitorImpl::get_probe_features ()\n{\n  return probe_features_;\n}\n\n\/\/ == SourceImpl ==\nstruct SourceImpl::ChannelMonitor {\n  uint          probe_range = 0;\n  uint          probe_energie = 0;\n  uint          probe_samples = 0;\n  uint          probe_fft = 0;\n  BseModule    *module = NULL;\n  bool          needs_module ()  { return probe_range || probe_energie || probe_samples || probe_fft; }\n  \/*des*\/      ~ChannelMonitor()\n  {\n    assert_return (module == NULL);\n  }\n};\n\nSourceImpl::ChannelMonitor&\nSourceImpl::cmon_get (uint ochannel)\n{\n  assert_return (ochannel < size_t (n_ochannels()), *(ChannelMonitor*) NULL);\n  if (!cmons_)\n    cmons_ = new ChannelMonitor[n_ochannels()];\n  return cmons_[ochannel];\n}\n\nstatic constexpr const size_t aligned_sizeof_MonitorFields = BSE_ALIGN (sizeof (MonitorFields), BSE_CACHE_LINE_ALIGNMENT);\n\nSharedBlock\nSourceImpl::cmon_get_block ()\n{\n  if (!cmon_block_.mem_length)\n    {\n      const size_t size_needed = aligned_sizeof_MonitorFields * n_ochannels();\n      cmon_block_ = BSE_SERVER.allocate_shared_block (size_needed);\n    }\n  return cmon_block_;\n}\n\nMonitorFields*\nSourceImpl::cmon_get_fields (uint ochannel)\n{\n  assert_return (ochannel < size_t (n_ochannels()), NULL);\n  const SharedBlock sb = cmon_get_block();\n  MonitorFields *mfields = (MonitorFields*) sb.mem_start;\n  return &mfields[ochannel];\n}\n\nvoid\nSourceImpl::cmon_delete ()\n{\n  if (cmons_)\n    {\n      delete[] cmons_;\n      cmons_ = NULL;\n    }\n  if (cmon_block_.mem_length)\n    {\n      const SharedBlock sb = cmon_block_;\n      cmon_block_ = SharedBlock();\n      BSE_SERVER.release_shared_block (sb);\n    }\n}\n\nvoid\nSourceImpl::cmon_add_probe (uint ochannel, const ProbeFeatures &pf)\n{\n  assert_return (ochannel < size_t (n_ochannels()));\n  ChannelMonitor &cmon = cmon_get (ochannel);\n  const bool needed_module = cmon.needs_module();\n  if (pf.probe_range)\n    cmon.probe_range += 1;\n  if (pf.probe_energie)\n    cmon.probe_energie += 1;\n  if (pf.probe_samples)\n    cmon.probe_samples += 1;\n  if (pf.probe_fft)\n    cmon.probe_fft += 1;\n  if (needed_module != cmon.needs_module())\n    {\n      \/\/ add module\n    }\n}\n\nvoid\nSourceImpl::cmon_sub_probe (uint ochannel, const ProbeFeatures &pf)\n{\n  assert_return (ochannel < size_t (n_ochannels()));\n  ChannelMonitor &cmon = cmon_get (ochannel);\n  const bool needed_module = cmon.needs_module();\n  if (pf.probe_range)\n    cmon.probe_range -= 1;\n  if (pf.probe_energie)\n    cmon.probe_energie -= 1;\n  if (pf.probe_samples)\n    cmon.probe_samples -= 1;\n  if (pf.probe_fft)\n    cmon.probe_fft -= 1;\n  if (needed_module != cmon.needs_module())\n    {\n      \/\/ kill module\n    }\n}\n\nSignalMonitorIfaceP\nSourceImpl::create_signal_monitor (int32 ochannel)\n{\n  assert_return (ochannel >= 0, NULL);\n  assert_return (ochannel < n_ochannels(), NULL);\n  SignalMonitorImplP mon = FriendAllocator<SignalMonitorImpl>::make_shared (this->as<SourceImplP>(), ochannel);\n  return mon;\n}\n\nbool\nSourceImpl::cmon_needed ()\n{\n  return_unless (cmons_ != NULL, false);\n  BseSource *self = as<BseSource*>();\n  return_unless (BSE_SOURCE_PREPARED (self), false);\n  const uint noc = n_ochannels();\n  for (size_t i = 0; i < noc; i++)\n    if (cmons_[i].needs_module())\n      return true;\n  return false;\n}\n\nstatic const BseModuleClass monitor_module_class = {\n  0,                            \/\/ n_istreams\n  1,                            \/\/ n_jstreams\n  0,                            \/\/ n_ostreams\n  NULL,                         \/\/ process\n  NULL,                         \/\/ process_defer\n  NULL,                         \/\/ reset\n  NULL,                         \/\/ free\n  Bse::ModuleFlag::NORMAL,      \/\/ mflags\n};\n\nclass MonitorModule : public Bse::Module {\n  MonitorFields *mfields_ = NULL;\npublic:\n  MonitorModule (MonitorFields *fields) : Module (monitor_module_class), mfields_ (fields) {}\n  virtual void\n  reset () override\n  {}\n  virtual void\n  process (uint n_values) override\n  {\n    const BseJStream &jstream = BSE_MODULE_JSTREAM (this, 0);\n    if (jstream.n_connections)\n      {\n        const float *wave_in = jstream.values[0];\n        float min = wave_in[0], max = wave_in[0];\n        float avg = wave_in[0], first = wave_in[0], last = wave_in[n_values - 1];\n        bool seen_nan = false, seen_pinf = false, seen_ninf = false, seen_subn = false;\n        for (uint j = 0; j < jstream.n_connections; j++)\n          for (uint i = 0; i < n_values; i++)\n            {\n              const float v = wave_in[i];\n              max = max > v ? max : v;\n              min = min < v ? min : v;\n              avg += v;\n              if (UNLIKELY (BSE_FLOAT_IS_NANINF (v)))\n                {\n                  seen_nan |= BSE_FLOAT_IS_NAN (v);\n                  seen_pinf |= BSE_FLOAT_IS_INF_POSITIVE (v);\n                  seen_ninf |= BSE_FLOAT_IS_INF_NEGATIVE (v);\n                }\n              else if (UNLIKELY (BSE_FLOAT_IS_SUBNORMAL (v)))\n                seen_subn = true;\n            }\n        avg \/= double (n_values) * jstream.n_connections;\n        mfields_->min = min;\n        mfields_->max = max;\n        mfields_->energy = avg; \/\/ FIXME: calc energy properly\n        mfields_->tip = MAX (mfields_->tip * 0.98, avg);\n        __sync_fetch_and_add (&mfields_->gen, 1);\n        if (0)\n          Bse::printout (\"Monitor: max=%+1.5f min=%+1.5f avg=%+1.5f cons=%u values=%u [%+1.5f,..,%+1.5f] freq=%+1.2f %s%s%s%s\\r\",\n                         max, min, avg,\n                         jstream.n_connections, n_values,\n                         first, last,\n                         BSE_FREQ_FROM_VALUE (avg),\n                         seen_nan ? \" +NAN\" : \"\",\n                         seen_pinf ? \" +PINF\" : \"\",\n                         seen_ninf ? \" +NINF\" : \"\",\n                         seen_subn ? \" +SUBNORM\" : \"\");\n      }\n  }\n};\n\nvoid \/\/ called on BseSource.prepare\nSourceImpl::cmon_activate ()\n{\n  return_unless (cmon_needed());\n  BseSource *self = as<BseSource*>();\n  BseTrans *trans = bse_trans_open ();\n  std::vector<BseModule*> omodules;\n  bse_source_list_omodules (self, omodules);\n  const uint noc = n_ochannels();\n  for (size_t i = 0; i < noc; i++)\n    if (cmons_[i].needs_module() && !cmons_[i].module)\n      {\n        cmons_[i].module = new MonitorModule (cmon_get_fields (i));\n        bse_trans_add (trans, bse_job_integrate (cmons_[i].module));\n        bse_trans_add (trans, bse_job_set_consumer (cmons_[i].module, TRUE));\n        for (auto omodule : omodules)\n          bse_trans_add (trans, bse_job_jconnect (omodule, i, cmons_[i].module, 0));\n      }\n  bse_trans_commit (trans);\n}\n\nvoid\nSourceImpl::cmon_omodule_changed (BseModule *module, bool added, BseTrans *trans)\n{\n  return_unless (cmons_ != NULL);\n  const uint noc = n_ochannels();\n  for (size_t i = 0; i < noc; i++)\n    if (cmons_[i].module)\n      {\n        if (added)\n          bse_trans_add (trans, bse_job_jconnect (module, i, cmons_[i].module, 0));\n        else\n          bse_trans_add (trans, bse_job_jdisconnect (cmons_[i].module, 0, module, i));\n      }\n}\n\nvoid \/\/ called on BseSource.reset\nSourceImpl::cmon_deactivate ()\n{\n  return_unless (cmons_ != NULL);\n  BseTrans *trans = NULL;\n  const uint noc = n_ochannels();\n  for (size_t i = 0; i < noc; i++)\n    if (cmons_[i].module)\n      {\n        if (!trans)\n          trans = bse_trans_open ();\n\tbse_trans_add (trans, bse_job_discard (cmons_[i].module));\n        cmons_[i].module = NULL;\n      }\n  if (trans)\n    bse_trans_commit (trans);\n}\n\n} \/\/ Bse\n<commit_msg>BSE: monitor: fix static_assert() for gcc-4.8.4<commit_after>\/\/ Licensed GNU LGPL v2.1 or later: http:\/\/www.gnu.org\/licenses\/lgpl.html\n#include \"monitor.hh\"\n#include \"bseengine.hh\"\n#include \"bseserver.hh\"\n\nnamespace Bse {\n\nSignalMonitorImpl::SignalMonitorImpl (SourceImplP source, uint ochannel) :\n  source_ (source), ochannel_ (ochannel)\n{\n  assert_return (source != NULL);\n  assert_return (ochannel < size_t (source->n_ochannels()));\n}\n\nSignalMonitorImpl::~SignalMonitorImpl ()\n{\n  source_->cmon_sub_probe (ochannel_, probe_features_); \/\/ potentially deletes module\n  probe_features_ = ProbeFeatures();\n}\n\nSourceIfaceP\nSignalMonitorImpl::get_osource ()\n{\n  return source_;\n}\n\nint32\nSignalMonitorImpl::get_ochannel()\n{\n  return ochannel_;\n}\n\nint64\nSignalMonitorImpl::get_shm_id ()\n{\n  SharedBlock sb = source_->cmon_get_block();\n  return sb.shm_id;\n}\n\nint64\nSignalMonitorImpl::get_shm_offset()\n{\n  SharedBlock sb = source_->cmon_get_block();\n  MonitorFields *fields0 = source_->cmon_get_fields (0);\n  assert_return (sb.mem_start == (void*) fields0, 0);\n  MonitorFields *fieldsn = source_->cmon_get_fields (ochannel_);\n  const size_t channel_offset = ((char*) fieldsn) - ((char*) fields0);\n  return sb.mem_offset + channel_offset;\n  static_assert (sizeof (Bse::MonitorFields) == sizeof (double) * 4 + sizeof (int64), \"\");\n}\n\nint64\nSignalMonitorImpl::get_mix_freq ()\n{\n  return 0;\n}\n\nint64\nSignalMonitorImpl::get_frame_duration ()\n{\n  return 0;\n}\n\nvoid\nSignalMonitorImpl::set_probe_features (const ProbeFeatures &pf)\n{\n  return_unless (pf != probe_features_);\n  source_->cmon_add_probe (ochannel_, pf);              \/\/ potentially creates new module\n  source_->cmon_sub_probe (ochannel_, probe_features_); \/\/ potentially deletes module\n  probe_features_ = pf;\n}\n\nProbeFeatures\nSignalMonitorImpl::get_probe_features ()\n{\n  return probe_features_;\n}\n\n\/\/ == SourceImpl ==\nstruct SourceImpl::ChannelMonitor {\n  uint          probe_range = 0;\n  uint          probe_energie = 0;\n  uint          probe_samples = 0;\n  uint          probe_fft = 0;\n  BseModule    *module = NULL;\n  bool          needs_module ()  { return probe_range || probe_energie || probe_samples || probe_fft; }\n  \/*des*\/      ~ChannelMonitor()\n  {\n    assert_return (module == NULL);\n  }\n};\n\nSourceImpl::ChannelMonitor&\nSourceImpl::cmon_get (uint ochannel)\n{\n  assert_return (ochannel < size_t (n_ochannels()), *(ChannelMonitor*) NULL);\n  if (!cmons_)\n    cmons_ = new ChannelMonitor[n_ochannels()];\n  return cmons_[ochannel];\n}\n\nstatic constexpr const size_t aligned_sizeof_MonitorFields = BSE_ALIGN (sizeof (MonitorFields), BSE_CACHE_LINE_ALIGNMENT);\n\nSharedBlock\nSourceImpl::cmon_get_block ()\n{\n  if (!cmon_block_.mem_length)\n    {\n      const size_t size_needed = aligned_sizeof_MonitorFields * n_ochannels();\n      cmon_block_ = BSE_SERVER.allocate_shared_block (size_needed);\n    }\n  return cmon_block_;\n}\n\nMonitorFields*\nSourceImpl::cmon_get_fields (uint ochannel)\n{\n  assert_return (ochannel < size_t (n_ochannels()), NULL);\n  const SharedBlock sb = cmon_get_block();\n  MonitorFields *mfields = (MonitorFields*) sb.mem_start;\n  return &mfields[ochannel];\n}\n\nvoid\nSourceImpl::cmon_delete ()\n{\n  if (cmons_)\n    {\n      delete[] cmons_;\n      cmons_ = NULL;\n    }\n  if (cmon_block_.mem_length)\n    {\n      const SharedBlock sb = cmon_block_;\n      cmon_block_ = SharedBlock();\n      BSE_SERVER.release_shared_block (sb);\n    }\n}\n\nvoid\nSourceImpl::cmon_add_probe (uint ochannel, const ProbeFeatures &pf)\n{\n  assert_return (ochannel < size_t (n_ochannels()));\n  ChannelMonitor &cmon = cmon_get (ochannel);\n  const bool needed_module = cmon.needs_module();\n  if (pf.probe_range)\n    cmon.probe_range += 1;\n  if (pf.probe_energie)\n    cmon.probe_energie += 1;\n  if (pf.probe_samples)\n    cmon.probe_samples += 1;\n  if (pf.probe_fft)\n    cmon.probe_fft += 1;\n  if (needed_module != cmon.needs_module())\n    {\n      \/\/ add module\n    }\n}\n\nvoid\nSourceImpl::cmon_sub_probe (uint ochannel, const ProbeFeatures &pf)\n{\n  assert_return (ochannel < size_t (n_ochannels()));\n  ChannelMonitor &cmon = cmon_get (ochannel);\n  const bool needed_module = cmon.needs_module();\n  if (pf.probe_range)\n    cmon.probe_range -= 1;\n  if (pf.probe_energie)\n    cmon.probe_energie -= 1;\n  if (pf.probe_samples)\n    cmon.probe_samples -= 1;\n  if (pf.probe_fft)\n    cmon.probe_fft -= 1;\n  if (needed_module != cmon.needs_module())\n    {\n      \/\/ kill module\n    }\n}\n\nSignalMonitorIfaceP\nSourceImpl::create_signal_monitor (int32 ochannel)\n{\n  assert_return (ochannel >= 0, NULL);\n  assert_return (ochannel < n_ochannels(), NULL);\n  SignalMonitorImplP mon = FriendAllocator<SignalMonitorImpl>::make_shared (this->as<SourceImplP>(), ochannel);\n  return mon;\n}\n\nbool\nSourceImpl::cmon_needed ()\n{\n  return_unless (cmons_ != NULL, false);\n  BseSource *self = as<BseSource*>();\n  return_unless (BSE_SOURCE_PREPARED (self), false);\n  const uint noc = n_ochannels();\n  for (size_t i = 0; i < noc; i++)\n    if (cmons_[i].needs_module())\n      return true;\n  return false;\n}\n\nstatic const BseModuleClass monitor_module_class = {\n  0,                            \/\/ n_istreams\n  1,                            \/\/ n_jstreams\n  0,                            \/\/ n_ostreams\n  NULL,                         \/\/ process\n  NULL,                         \/\/ process_defer\n  NULL,                         \/\/ reset\n  NULL,                         \/\/ free\n  Bse::ModuleFlag::NORMAL,      \/\/ mflags\n};\n\nclass MonitorModule : public Bse::Module {\n  MonitorFields *mfields_ = NULL;\npublic:\n  MonitorModule (MonitorFields *fields) : Module (monitor_module_class), mfields_ (fields) {}\n  virtual void\n  reset () override\n  {}\n  virtual void\n  process (uint n_values) override\n  {\n    const BseJStream &jstream = BSE_MODULE_JSTREAM (this, 0);\n    if (jstream.n_connections)\n      {\n        const float *wave_in = jstream.values[0];\n        float min = wave_in[0], max = wave_in[0];\n        float avg = wave_in[0], first = wave_in[0], last = wave_in[n_values - 1];\n        bool seen_nan = false, seen_pinf = false, seen_ninf = false, seen_subn = false;\n        for (uint j = 0; j < jstream.n_connections; j++)\n          for (uint i = 0; i < n_values; i++)\n            {\n              const float v = wave_in[i];\n              max = max > v ? max : v;\n              min = min < v ? min : v;\n              avg += v;\n              if (UNLIKELY (BSE_FLOAT_IS_NANINF (v)))\n                {\n                  seen_nan |= BSE_FLOAT_IS_NAN (v);\n                  seen_pinf |= BSE_FLOAT_IS_INF_POSITIVE (v);\n                  seen_ninf |= BSE_FLOAT_IS_INF_NEGATIVE (v);\n                }\n              else if (UNLIKELY (BSE_FLOAT_IS_SUBNORMAL (v)))\n                seen_subn = true;\n            }\n        avg \/= double (n_values) * jstream.n_connections;\n        mfields_->min = min;\n        mfields_->max = max;\n        mfields_->energy = avg; \/\/ FIXME: calc energy properly\n        mfields_->tip = MAX (mfields_->tip * 0.98, avg);\n        __sync_fetch_and_add (&mfields_->gen, 1);\n        if (0)\n          Bse::printout (\"Monitor: max=%+1.5f min=%+1.5f avg=%+1.5f cons=%u values=%u [%+1.5f,..,%+1.5f] freq=%+1.2f %s%s%s%s\\r\",\n                         max, min, avg,\n                         jstream.n_connections, n_values,\n                         first, last,\n                         BSE_FREQ_FROM_VALUE (avg),\n                         seen_nan ? \" +NAN\" : \"\",\n                         seen_pinf ? \" +PINF\" : \"\",\n                         seen_ninf ? \" +NINF\" : \"\",\n                         seen_subn ? \" +SUBNORM\" : \"\");\n      }\n  }\n};\n\nvoid \/\/ called on BseSource.prepare\nSourceImpl::cmon_activate ()\n{\n  return_unless (cmon_needed());\n  BseSource *self = as<BseSource*>();\n  BseTrans *trans = bse_trans_open ();\n  std::vector<BseModule*> omodules;\n  bse_source_list_omodules (self, omodules);\n  const uint noc = n_ochannels();\n  for (size_t i = 0; i < noc; i++)\n    if (cmons_[i].needs_module() && !cmons_[i].module)\n      {\n        cmons_[i].module = new MonitorModule (cmon_get_fields (i));\n        bse_trans_add (trans, bse_job_integrate (cmons_[i].module));\n        bse_trans_add (trans, bse_job_set_consumer (cmons_[i].module, TRUE));\n        for (auto omodule : omodules)\n          bse_trans_add (trans, bse_job_jconnect (omodule, i, cmons_[i].module, 0));\n      }\n  bse_trans_commit (trans);\n}\n\nvoid\nSourceImpl::cmon_omodule_changed (BseModule *module, bool added, BseTrans *trans)\n{\n  return_unless (cmons_ != NULL);\n  const uint noc = n_ochannels();\n  for (size_t i = 0; i < noc; i++)\n    if (cmons_[i].module)\n      {\n        if (added)\n          bse_trans_add (trans, bse_job_jconnect (module, i, cmons_[i].module, 0));\n        else\n          bse_trans_add (trans, bse_job_jdisconnect (cmons_[i].module, 0, module, i));\n      }\n}\n\nvoid \/\/ called on BseSource.reset\nSourceImpl::cmon_deactivate ()\n{\n  return_unless (cmons_ != NULL);\n  BseTrans *trans = NULL;\n  const uint noc = n_ochannels();\n  for (size_t i = 0; i < noc; i++)\n    if (cmons_[i].module)\n      {\n        if (!trans)\n          trans = bse_trans_open ();\n\tbse_trans_add (trans, bse_job_discard (cmons_[i].module));\n        cmons_[i].module = NULL;\n      }\n  if (trans)\n    bse_trans_commit (trans);\n}\n\n} \/\/ Bse\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\/wm\/session_state_controller_impl2.h\"\n\n#include \"ash\/ash_switches.h\"\n#include \"ash\/shell.h\"\n#include \"ash\/shell_delegate.h\"\n#include \"ash\/shell_window_ids.h\"\n#include \"ash\/wm\/session_state_animator.h\"\n#include \"base\/command_line.h\"\n#include \"ui\/aura\/root_window.h\"\n#include \"ui\/aura\/shared\/compound_event_filter.h\"\n\n#if defined(OS_CHROMEOS)\n#include \"base\/chromeos\/chromeos_version.h\"\n#endif\n\nnamespace ash {\n\nSessionStateControllerImpl2::TestApi::TestApi(\n    SessionStateControllerImpl2* controller)\n    : controller_(controller) {\n}\n\nSessionStateControllerImpl2::TestApi::~TestApi() {\n}\n\nSessionStateControllerImpl2::SessionStateControllerImpl2()\n    : login_status_(user::LOGGED_IN_NONE),\n      system_is_locked_(false),\n      shutting_down_(false),\n      shutdown_after_lock_(false) {\n  Shell::GetPrimaryRootWindow()->AddRootWindowObserver(this);\n}\n\nSessionStateControllerImpl2::~SessionStateControllerImpl2() {\n  Shell::GetPrimaryRootWindow()->RemoveRootWindowObserver(this);\n}\n\nvoid SessionStateControllerImpl2::OnLoginStateChanged(\n    user::LoginStatus status) {\n  if (status != user::LOGGED_IN_LOCKED)\n    login_status_ = status;\n  system_is_locked_ = (status == user::LOGGED_IN_LOCKED);\n}\n\nvoid SessionStateControllerImpl2::OnAppTerminating() {\n  \/\/ If we hear that Chrome is exiting but didn't request it ourselves, all we\n  \/\/ can really hope for is that we'll have time to clear the screen.\n  if (!shutting_down_) {\n    shutting_down_ = true;\n    Shell* shell = ash::Shell::GetInstance();\n    shell->env_filter()->set_cursor_hidden_by_filter(false);\n    shell->cursor_manager()->ShowCursor(false);\n    animator_->StartAnimation(\n        internal::SessionStateAnimator::kAllContainersMask,\n        internal::SessionStateAnimator::ANIMATION_HIDE);\n  }\n}\n\nvoid SessionStateControllerImpl2::OnLockStateChanged(bool locked) {\n  if (shutting_down_ || (IsLocked()) == locked)\n    return;\n\n  system_is_locked_ = locked;\n\n  if (locked) {\n    animator_->StartAnimation(\n        internal::SessionStateAnimator::LOCK_SCREEN_CONTAINERS,\n        internal::SessionStateAnimator::ANIMATION_LOWER);\n    lock_timer_.Stop();\n    lock_fail_timer_.Stop();\n\n    if (shutdown_after_lock_) {\n      shutdown_after_lock_ = false;\n      StartLockToShutdownTimer();\n    }\n  } else {\n    animator_->StartAnimation(\n        internal::SessionStateAnimator::NON_LOCK_SCREEN_CONTAINERS |\n        internal::SessionStateAnimator::LAUNCHER,\n        internal::SessionStateAnimator::ANIMATION_LOWER);\n  }\n}\n\nvoid SessionStateControllerImpl2::OnStartingLock() {\n  if (shutting_down_ || system_is_locked_)\n    return;\n\n  animator_->StartAnimation(\n      internal::SessionStateAnimator::NON_LOCK_SCREEN_CONTAINERS |\n      internal::SessionStateAnimator::LAUNCHER,\n      internal::SessionStateAnimator::ANIMATION_RAISE);\n\n  \/\/ Hide the screen locker containers so we can raise them later.\n  animator_->StartAnimation(\n      internal::SessionStateAnimator::LOCK_SCREEN_CONTAINERS,\n      internal::SessionStateAnimator::ANIMATION_HIDE);\n}\n\nvoid SessionStateControllerImpl2::StartLockAnimationAndLockImmediately() {\n  animator_->StartAnimation(\n      internal::SessionStateAnimator::NON_LOCK_SCREEN_CONTAINERS |\n      internal::SessionStateAnimator::LAUNCHER,\n      internal::SessionStateAnimator::ANIMATION_RAISE);\n  OnLockTimeout();\n}\n\nvoid SessionStateControllerImpl2::StartLockAnimation(bool shutdown_after_lock) {\n  shutdown_after_lock_ = shutdown_after_lock;\n\n  animator_->StartAnimation(\n      internal::SessionStateAnimator::NON_LOCK_SCREEN_CONTAINERS |\n      internal::SessionStateAnimator::LAUNCHER,\n      internal::SessionStateAnimator::ANIMATION_RAISE);\n  StartLockTimer();\n}\n\nvoid SessionStateControllerImpl2::StartShutdownAnimation() {\n  animator_->CreateForeground();\n  animator_->StartAnimation(\n      internal::SessionStateAnimator::LOCK_SCREEN_SYSTEM_FOREGROUND,\n      internal::SessionStateAnimator::ANIMATION_PARTIAL_FADE_IN);\n  StartPreShutdownAnimationTimer();\n}\n\nbool SessionStateControllerImpl2::IsEligibleForLock() {\n  return IsLoggedInAsNonGuest() && !IsLocked() && !LockRequested();\n}\n\nbool SessionStateControllerImpl2::IsLocked() {\n  return system_is_locked_;\n}\n\nbool SessionStateControllerImpl2::LockRequested() {\n  return lock_fail_timer_.IsRunning();\n}\n\nbool SessionStateControllerImpl2::ShutdownRequested() {\n  return shutting_down_;\n}\n\nbool SessionStateControllerImpl2::CanCancelLockAnimation() {\n  return lock_timer_.IsRunning();\n}\n\nvoid SessionStateControllerImpl2::CancelLockAnimation() {\n  if (!CanCancelLockAnimation())\n    return;\n  shutdown_after_lock_ = false;\n  animator_->StartAnimation(\n      internal::SessionStateAnimator::NON_LOCK_SCREEN_CONTAINERS,\n      internal::SessionStateAnimator::ANIMATION_LOWER);\n  lock_timer_.Stop();\n}\n\nbool SessionStateControllerImpl2::CanCancelShutdownAnimation() {\n  return pre_shutdown_timer_.IsRunning() ||\n         shutdown_after_lock_ ||\n         lock_to_shutdown_timer_.IsRunning();\n}\n\nvoid SessionStateControllerImpl2::CancelShutdownAnimation() {\n  if (!CanCancelShutdownAnimation())\n    return;\n  if (lock_to_shutdown_timer_.IsRunning()) {\n    lock_to_shutdown_timer_.Stop();\n    return;\n  }\n  if (shutdown_after_lock_) {\n    shutdown_after_lock_ = false;\n    return;\n  }\n  animator_->CreateForeground();\n  animator_->StartAnimation(\n      internal::SessionStateAnimator::LOCK_SCREEN_SYSTEM_FOREGROUND,\n      internal::SessionStateAnimator::ANIMATION_UNDO_PARTIAL_FADE_IN);\n\n  pre_shutdown_timer_.Stop();\n}\n\nvoid SessionStateControllerImpl2::RequestShutdown() {\n  if (!shutting_down_)\n    RequestShutdownImpl();\n}\n\nvoid SessionStateControllerImpl2::RequestShutdownImpl() {\n  DCHECK(!shutting_down_);\n  shutting_down_ = true;\n\n  Shell* shell = ash::Shell::GetInstance();\n  shell->env_filter()->set_cursor_hidden_by_filter(false);\n  shell->cursor_manager()->ShowCursor(false);\n\n  animator_->CreateForeground();\n  animator_->StartAnimation(\n      internal::SessionStateAnimator::LOCK_SCREEN_SYSTEM_FOREGROUND,\n      internal::SessionStateAnimator::ANIMATION_FULL_FADE_IN);\n  StartRealShutdownTimer();\n}\n\nvoid SessionStateControllerImpl2::OnRootWindowHostCloseRequested(\n                                                const aura::RootWindow*) {\n  if(Shell::GetInstance() && Shell::GetInstance()->delegate())\n    Shell::GetInstance()->delegate()->Exit();\n}\n\nbool SessionStateControllerImpl2::IsLoggedInAsNonGuest() const {\n  \/\/ TODO(mukai): think about kiosk mode.\n  return (login_status_ != user::LOGGED_IN_NONE) &&\n         (login_status_ != user::LOGGED_IN_GUEST);\n}\n\nvoid SessionStateControllerImpl2::StartLockTimer() {\n  lock_timer_.Stop();\n  lock_timer_.Start(FROM_HERE,\n                    base::TimeDelta::FromMilliseconds(kSlowCloseAnimMs),\n                    this, &SessionStateControllerImpl2::OnLockTimeout);\n}\n\nvoid SessionStateControllerImpl2::OnLockTimeout() {\n  delegate_->RequestLockScreen();\n  lock_fail_timer_.Start(\n      FROM_HERE,\n      base::TimeDelta::FromMilliseconds(kLockFailTimeoutMs),\n      this, &SessionStateControllerImpl2::OnLockFailTimeout);\n}\n\nvoid SessionStateControllerImpl2::OnLockFailTimeout() {\n  DCHECK(!system_is_locked_);\n  \/\/ Undo lock animation.\n  animator_->StartAnimation(\n      internal::SessionStateAnimator::LAUNCHER |\n      internal::SessionStateAnimator::NON_LOCK_SCREEN_CONTAINERS,\n      internal::SessionStateAnimator::ANIMATION_LOWER);\n}\n\nvoid SessionStateControllerImpl2::StartLockToShutdownTimer() {\n  shutdown_after_lock_ = false;\n  lock_to_shutdown_timer_.Stop();\n  lock_to_shutdown_timer_.Start(\n      FROM_HERE,\n      base::TimeDelta::FromMilliseconds(kLockToShutdownTimeoutMs),\n      this, &SessionStateControllerImpl2::OnLockToShutdownTimeout);\n}\n\n\nvoid SessionStateControllerImpl2::OnLockToShutdownTimeout() {\n  DCHECK(system_is_locked_);\n  StartShutdownAnimation();\n}\n\nvoid SessionStateControllerImpl2::StartPreShutdownAnimationTimer() {\n  pre_shutdown_timer_.Stop();\n  pre_shutdown_timer_.Start(\n      FROM_HERE,\n      base::TimeDelta::FromMilliseconds(kShutdownTimeoutMs),\n      this, &SessionStateControllerImpl2::OnPreShutdownAnimationTimeout);\n}\n\nvoid SessionStateControllerImpl2::OnPreShutdownAnimationTimeout() {\n  if (!shutting_down_)\n    RequestShutdownImpl();\n}\n\nvoid SessionStateControllerImpl2::StartRealShutdownTimer() {\n  real_shutdown_timer_.Start(\n      FROM_HERE,\n      base::TimeDelta::FromMilliseconds(kFastCloseAnimMs +\n          kShutdownRequestDelayMs),\n      this, &SessionStateControllerImpl2::OnRealShutdownTimeout);\n}\n\nvoid SessionStateControllerImpl2::OnRealShutdownTimeout() {\n  DCHECK(shutting_down_);\n#if defined(OS_CHROMEOS)\n  if (!base::chromeos::IsRunningOnChromeOS()) {\n    ShellDelegate* delegate = Shell::GetInstance()->delegate();\n    if (delegate) {\n      delegate->Exit();\n      return;\n    }\n  }\n#endif\n  delegate_->RequestShutdown();\n}\n\n}  \/\/ namespace ash\n<commit_msg>One missed case for shutdown transition animation.<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\/wm\/session_state_controller_impl2.h\"\n\n#include \"ash\/ash_switches.h\"\n#include \"ash\/shell.h\"\n#include \"ash\/shell_delegate.h\"\n#include \"ash\/shell_window_ids.h\"\n#include \"ash\/wm\/session_state_animator.h\"\n#include \"base\/command_line.h\"\n#include \"ui\/aura\/root_window.h\"\n#include \"ui\/aura\/shared\/compound_event_filter.h\"\n\n#if defined(OS_CHROMEOS)\n#include \"base\/chromeos\/chromeos_version.h\"\n#endif\n\nnamespace ash {\n\nSessionStateControllerImpl2::TestApi::TestApi(\n    SessionStateControllerImpl2* controller)\n    : controller_(controller) {\n}\n\nSessionStateControllerImpl2::TestApi::~TestApi() {\n}\n\nSessionStateControllerImpl2::SessionStateControllerImpl2()\n    : login_status_(user::LOGGED_IN_NONE),\n      system_is_locked_(false),\n      shutting_down_(false),\n      shutdown_after_lock_(false) {\n  Shell::GetPrimaryRootWindow()->AddRootWindowObserver(this);\n}\n\nSessionStateControllerImpl2::~SessionStateControllerImpl2() {\n  Shell::GetPrimaryRootWindow()->RemoveRootWindowObserver(this);\n}\n\nvoid SessionStateControllerImpl2::OnLoginStateChanged(\n    user::LoginStatus status) {\n  if (status != user::LOGGED_IN_LOCKED)\n    login_status_ = status;\n  system_is_locked_ = (status == user::LOGGED_IN_LOCKED);\n}\n\nvoid SessionStateControllerImpl2::OnAppTerminating() {\n  \/\/ If we hear that Chrome is exiting but didn't request it ourselves, all we\n  \/\/ can really hope for is that we'll have time to clear the screen.\n  if (!shutting_down_) {\n    shutting_down_ = true;\n    Shell* shell = ash::Shell::GetInstance();\n    shell->env_filter()->set_cursor_hidden_by_filter(false);\n    shell->cursor_manager()->ShowCursor(false);\n    animator_->CreateForeground();\n    animator_->StartAnimation(\n        internal::SessionStateAnimator::LOCK_SCREEN_SYSTEM_FOREGROUND,\n        internal::SessionStateAnimator::ANIMATION_FULL_FADE_IN);\n  }\n}\n\nvoid SessionStateControllerImpl2::OnLockStateChanged(bool locked) {\n  if (shutting_down_ || (IsLocked()) == locked)\n    return;\n\n  system_is_locked_ = locked;\n\n  if (locked) {\n    animator_->StartAnimation(\n        internal::SessionStateAnimator::LOCK_SCREEN_CONTAINERS,\n        internal::SessionStateAnimator::ANIMATION_LOWER);\n    lock_timer_.Stop();\n    lock_fail_timer_.Stop();\n\n    if (shutdown_after_lock_) {\n      shutdown_after_lock_ = false;\n      StartLockToShutdownTimer();\n    }\n  } else {\n    animator_->StartAnimation(\n        internal::SessionStateAnimator::NON_LOCK_SCREEN_CONTAINERS |\n        internal::SessionStateAnimator::LAUNCHER,\n        internal::SessionStateAnimator::ANIMATION_LOWER);\n  }\n}\n\nvoid SessionStateControllerImpl2::OnStartingLock() {\n  if (shutting_down_ || system_is_locked_)\n    return;\n\n  animator_->StartAnimation(\n      internal::SessionStateAnimator::NON_LOCK_SCREEN_CONTAINERS |\n      internal::SessionStateAnimator::LAUNCHER,\n      internal::SessionStateAnimator::ANIMATION_RAISE);\n\n  \/\/ Hide the screen locker containers so we can raise them later.\n  animator_->StartAnimation(\n      internal::SessionStateAnimator::LOCK_SCREEN_CONTAINERS,\n      internal::SessionStateAnimator::ANIMATION_HIDE);\n}\n\nvoid SessionStateControllerImpl2::StartLockAnimationAndLockImmediately() {\n  animator_->StartAnimation(\n      internal::SessionStateAnimator::NON_LOCK_SCREEN_CONTAINERS |\n      internal::SessionStateAnimator::LAUNCHER,\n      internal::SessionStateAnimator::ANIMATION_RAISE);\n  OnLockTimeout();\n}\n\nvoid SessionStateControllerImpl2::StartLockAnimation(bool shutdown_after_lock) {\n  shutdown_after_lock_ = shutdown_after_lock;\n\n  animator_->StartAnimation(\n      internal::SessionStateAnimator::NON_LOCK_SCREEN_CONTAINERS |\n      internal::SessionStateAnimator::LAUNCHER,\n      internal::SessionStateAnimator::ANIMATION_RAISE);\n  StartLockTimer();\n}\n\nvoid SessionStateControllerImpl2::StartShutdownAnimation() {\n  animator_->CreateForeground();\n  animator_->StartAnimation(\n      internal::SessionStateAnimator::LOCK_SCREEN_SYSTEM_FOREGROUND,\n      internal::SessionStateAnimator::ANIMATION_PARTIAL_FADE_IN);\n  StartPreShutdownAnimationTimer();\n}\n\nbool SessionStateControllerImpl2::IsEligibleForLock() {\n  return IsLoggedInAsNonGuest() && !IsLocked() && !LockRequested();\n}\n\nbool SessionStateControllerImpl2::IsLocked() {\n  return system_is_locked_;\n}\n\nbool SessionStateControllerImpl2::LockRequested() {\n  return lock_fail_timer_.IsRunning();\n}\n\nbool SessionStateControllerImpl2::ShutdownRequested() {\n  return shutting_down_;\n}\n\nbool SessionStateControllerImpl2::CanCancelLockAnimation() {\n  return lock_timer_.IsRunning();\n}\n\nvoid SessionStateControllerImpl2::CancelLockAnimation() {\n  if (!CanCancelLockAnimation())\n    return;\n  shutdown_after_lock_ = false;\n  animator_->StartAnimation(\n      internal::SessionStateAnimator::NON_LOCK_SCREEN_CONTAINERS,\n      internal::SessionStateAnimator::ANIMATION_LOWER);\n  lock_timer_.Stop();\n}\n\nbool SessionStateControllerImpl2::CanCancelShutdownAnimation() {\n  return pre_shutdown_timer_.IsRunning() ||\n         shutdown_after_lock_ ||\n         lock_to_shutdown_timer_.IsRunning();\n}\n\nvoid SessionStateControllerImpl2::CancelShutdownAnimation() {\n  if (!CanCancelShutdownAnimation())\n    return;\n  if (lock_to_shutdown_timer_.IsRunning()) {\n    lock_to_shutdown_timer_.Stop();\n    return;\n  }\n  if (shutdown_after_lock_) {\n    shutdown_after_lock_ = false;\n    return;\n  }\n  animator_->CreateForeground();\n  animator_->StartAnimation(\n      internal::SessionStateAnimator::LOCK_SCREEN_SYSTEM_FOREGROUND,\n      internal::SessionStateAnimator::ANIMATION_UNDO_PARTIAL_FADE_IN);\n\n  pre_shutdown_timer_.Stop();\n}\n\nvoid SessionStateControllerImpl2::RequestShutdown() {\n  if (!shutting_down_)\n    RequestShutdownImpl();\n}\n\nvoid SessionStateControllerImpl2::RequestShutdownImpl() {\n  DCHECK(!shutting_down_);\n  shutting_down_ = true;\n\n  Shell* shell = ash::Shell::GetInstance();\n  shell->env_filter()->set_cursor_hidden_by_filter(false);\n  shell->cursor_manager()->ShowCursor(false);\n\n  animator_->CreateForeground();\n  animator_->StartAnimation(\n      internal::SessionStateAnimator::LOCK_SCREEN_SYSTEM_FOREGROUND,\n      internal::SessionStateAnimator::ANIMATION_FULL_FADE_IN);\n  StartRealShutdownTimer();\n}\n\nvoid SessionStateControllerImpl2::OnRootWindowHostCloseRequested(\n                                                const aura::RootWindow*) {\n  if(Shell::GetInstance() && Shell::GetInstance()->delegate())\n    Shell::GetInstance()->delegate()->Exit();\n}\n\nbool SessionStateControllerImpl2::IsLoggedInAsNonGuest() const {\n  \/\/ TODO(mukai): think about kiosk mode.\n  return (login_status_ != user::LOGGED_IN_NONE) &&\n         (login_status_ != user::LOGGED_IN_GUEST);\n}\n\nvoid SessionStateControllerImpl2::StartLockTimer() {\n  lock_timer_.Stop();\n  lock_timer_.Start(FROM_HERE,\n                    base::TimeDelta::FromMilliseconds(kSlowCloseAnimMs),\n                    this, &SessionStateControllerImpl2::OnLockTimeout);\n}\n\nvoid SessionStateControllerImpl2::OnLockTimeout() {\n  delegate_->RequestLockScreen();\n  lock_fail_timer_.Start(\n      FROM_HERE,\n      base::TimeDelta::FromMilliseconds(kLockFailTimeoutMs),\n      this, &SessionStateControllerImpl2::OnLockFailTimeout);\n}\n\nvoid SessionStateControllerImpl2::OnLockFailTimeout() {\n  DCHECK(!system_is_locked_);\n  \/\/ Undo lock animation.\n  animator_->StartAnimation(\n      internal::SessionStateAnimator::LAUNCHER |\n      internal::SessionStateAnimator::NON_LOCK_SCREEN_CONTAINERS,\n      internal::SessionStateAnimator::ANIMATION_LOWER);\n}\n\nvoid SessionStateControllerImpl2::StartLockToShutdownTimer() {\n  shutdown_after_lock_ = false;\n  lock_to_shutdown_timer_.Stop();\n  lock_to_shutdown_timer_.Start(\n      FROM_HERE,\n      base::TimeDelta::FromMilliseconds(kLockToShutdownTimeoutMs),\n      this, &SessionStateControllerImpl2::OnLockToShutdownTimeout);\n}\n\n\nvoid SessionStateControllerImpl2::OnLockToShutdownTimeout() {\n  DCHECK(system_is_locked_);\n  StartShutdownAnimation();\n}\n\nvoid SessionStateControllerImpl2::StartPreShutdownAnimationTimer() {\n  pre_shutdown_timer_.Stop();\n  pre_shutdown_timer_.Start(\n      FROM_HERE,\n      base::TimeDelta::FromMilliseconds(kShutdownTimeoutMs),\n      this, &SessionStateControllerImpl2::OnPreShutdownAnimationTimeout);\n}\n\nvoid SessionStateControllerImpl2::OnPreShutdownAnimationTimeout() {\n  if (!shutting_down_)\n    RequestShutdownImpl();\n}\n\nvoid SessionStateControllerImpl2::StartRealShutdownTimer() {\n  real_shutdown_timer_.Start(\n      FROM_HERE,\n      base::TimeDelta::FromMilliseconds(kFastCloseAnimMs +\n          kShutdownRequestDelayMs),\n      this, &SessionStateControllerImpl2::OnRealShutdownTimeout);\n}\n\nvoid SessionStateControllerImpl2::OnRealShutdownTimeout() {\n  DCHECK(shutting_down_);\n#if defined(OS_CHROMEOS)\n  if (!base::chromeos::IsRunningOnChromeOS()) {\n    ShellDelegate* delegate = Shell::GetInstance()->delegate();\n    if (delegate) {\n      delegate->Exit();\n      return;\n    }\n  }\n#endif\n  delegate_->RequestShutdown();\n}\n\n}  \/\/ namespace ash\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\n * copyright: (c) RDO-Team, 2011\r\n * filename : main.cpp\r\n * author   :  , Evgeny Proydakov\r\n * date     : 10.05.2009\r\n * bref     :  common-\r\n * indent   : 4T\r\n *\/\r\n\r\n\/\/ ====================================================================== PCH\r\n\/\/ ====================================================================== INCLUDES\r\n#include <boost\/regex.hpp>\r\n#define BOOST_TEST_MODULE RDOCommon_Test\r\n#include <boost\/test\/included\/unit_test.hpp>\r\n\/\/ ====================================================================== SYNOPSIS\r\n#include \"rdo_common\/rdocommon.h\"\r\n#include \"rdo_common\/rdofile.h\"\r\n#include \"rdo_common\/rdotime.h\"\r\n#include \"rdo_common\/test\/rdo_common_test\/resource.h\"\r\n\/\/ ===============================================================================\r\n\r\nconst tstring s_testFileName(_T(\"test_file\"));\r\nconst tstring s_resourceStr1(_T(\"test_101\"));\r\nconst tstring s_resourceStr2(_T(\"test_102 22\"));\r\nconst tstring s_resourceStr3(_T(\"test_103 test_101 33 test_102 22\"));\r\nconst ruint64 s_createTestLocalTime = 129557633912040000;\r\n\r\nBOOST_AUTO_TEST_SUITE(RDOCommon_Test)\r\n\r\nBOOST_AUTO_TEST_CASE(RDOCommon_ResourceFormat)\r\n{\r\n\ttstring str1 = rdo::format(IDS_STRING101);\r\n\tBOOST_CHECK(str1 == s_resourceStr1);\r\n\ttstring str2 = rdo::format(IDS_STRING102, 22);\r\n\tBOOST_CHECK(str2 == s_resourceStr2);\r\n\ttstring str3 = rdo::format(IDS_STRING103, str1.c_str(), 33, str2.c_str());\r\n\tBOOST_CHECK(str3 == s_resourceStr3);\r\n}\r\n\r\nBOOST_AUTO_TEST_CASE(RDOCommon_FileCreate)\r\n{\r\n\tBOOST_CHECK(rdo::File::create(s_testFileName));\r\n}\r\n\r\nBOOST_AUTO_TEST_CASE(RDOCommon_FileExist)\r\n{\r\n\tBOOST_CHECK(rdo::File::exist(s_testFileName));\r\n}\r\n\r\nBOOST_AUTO_TEST_CASE(RDOCommon_FileReadOnly)\r\n{\r\n\tBOOST_CHECK(!rdo::File::read_only(s_testFileName));\r\n}\r\n\r\nBOOST_AUTO_TEST_CASE(RDOCommon_FileRemove)\r\n{\r\n\tBOOST_CHECK(rdo::File::unlink(s_testFileName));\r\n}\r\n\r\nBOOST_AUTO_TEST_CASE(RDOCommon_Time)\r\n{\r\n\trdo::Time timeValue = rdo::Time::local();\r\n\tBOOST_CHECK(timeValue > s_createTestLocalTime);\r\n\tstd::cout << _T(\"Today:  \") << timeValue.asString() << _T(\"  is not it?\");\r\n}\r\n\r\nBOOST_AUTO_TEST_SUITE_END()\r\n<commit_msg> - fixed compile gcc associated with running the test, which prednachnachen to work exclusively under WIN32<commit_after>\/*\r\n * copyright: (c) RDO-Team, 2011\r\n * filename : main.cpp\r\n * author   :  , Evgeny Proydakov\r\n * date     : 10.05.2009\r\n * bref     :  common-\r\n * indent   : 4T\r\n *\/\r\n\r\n\/\/ ====================================================================== PCH\r\n\/\/ ====================================================================== INCLUDES\r\n#include <boost\/regex.hpp>\r\n#define BOOST_TEST_MODULE RDOCommon_Test\r\n#include <boost\/test\/included\/unit_test.hpp>\r\n\/\/ ====================================================================== SYNOPSIS\r\n#include \"rdo_common\/rdocommon.h\"\r\n#include \"rdo_common\/rdofile.h\"\r\n#include \"rdo_common\/rdotime.h\"\r\n#include \"rdo_common\/test\/rdo_common_test\/resource.h\"\r\n\/\/ ===============================================================================\r\n\r\nconst tstring s_testFileName(_T(\"test_file\"));\r\nconst tstring s_resourceStr1(_T(\"test_101\"));\r\nconst tstring s_resourceStr2(_T(\"test_102 22\"));\r\nconst tstring s_resourceStr3(_T(\"test_103 test_101 33 test_102 22\"));\r\nconst ruint64 s_createTestLocalTime = 129557633912040000;\r\n\r\nBOOST_AUTO_TEST_SUITE(RDOCommon_Test)\r\n\r\n#ifdef WIN32\r\nBOOST_AUTO_TEST_CASE(RDOCommon_ResourceFormat)\r\n{\r\n\ttstring str1 = rdo::format(IDS_STRING101);\r\n\tBOOST_CHECK(str1 == s_resourceStr1);\r\n\ttstring str2 = rdo::format(IDS_STRING102, 22);\r\n\tBOOST_CHECK(str2 == s_resourceStr2);\r\n\ttstring str3 = rdo::format(IDS_STRING103, str1.c_str(), 33, str2.c_str());\r\n\tBOOST_CHECK(str3 == s_resourceStr3);\r\n}\r\n#endif\r\n\r\nBOOST_AUTO_TEST_CASE(RDOCommon_FileCreate)\r\n{\r\n\tBOOST_CHECK(rdo::File::create(s_testFileName));\r\n}\r\n\r\nBOOST_AUTO_TEST_CASE(RDOCommon_FileExist)\r\n{\r\n\tBOOST_CHECK(rdo::File::exist(s_testFileName));\r\n}\r\n\r\nBOOST_AUTO_TEST_CASE(RDOCommon_FileReadOnly)\r\n{\r\n\tBOOST_CHECK(!rdo::File::read_only(s_testFileName));\r\n}\r\n\r\nBOOST_AUTO_TEST_CASE(RDOCommon_FileRemove)\r\n{\r\n\tBOOST_CHECK(rdo::File::unlink(s_testFileName));\r\n}\r\n\r\nBOOST_AUTO_TEST_CASE(RDOCommon_Time)\r\n{\r\n\trdo::Time timeValue = rdo::Time::local();\r\n\tBOOST_CHECK(timeValue > s_createTestLocalTime);\r\n\tstd::cout << _T(\"Today:  \") << timeValue.asString() << _T(\"  is not it?\");\r\n}\r\n\r\nBOOST_AUTO_TEST_SUITE_END()\r\n<|endoftext|>"}
{"text":"<commit_before>#include \"DebugHandler.h\"\n#include \"..\/ConnectionService\/I_ConnectionService.h\"\n#include \"..\/DataParser\/I_DataParser.h\"\n#include \"..\/DataPopulator\/DataPopulator.h\"\n\nDebugHandler::DebugHandler(I_ConnectionService& connectionService, I_DataParser& dataParser, QString filename)\n: logTxtFile_(filename)\n, logCsvFile_(filename)\n, connectionService_(connectionService)\n, dataParser_(dataParser)\n{\n    \/********************Connections********************\/\n    connect(&connectionService, SIGNAL(sendDebugMessage(QString)),\n            this, SLOT (receivedConnectionService(QString)));\n    \/\/RAW String\n    connect(&dataParser, SIGNAL(sendDebugMessage(QString)),\n            this, SLOT (receivedDebugDataParser(QString)));                 \/\/notes, RAW string ends with a \\n\n    \/\/PARSED values\n    connect(&dataParser, SIGNAL(dataReceived(int,double)),\n            this, SLOT (receivedParsedDataParser(int, double)));\n\n    \/********************File Initializing********************\/\n    QDateTime date = QDateTime::currentDateTime();\n    QString DebugFilePath(\"DebugLogs\/\"); \/\/can only create ONE NEW folder.\n    if(!QDir(DebugFilePath).exists())\n        QDir().mkdir(DebugFilePath);\n\n\n    filename.prepend(date.toString(\"yyyy.MM.dd_hh.mm.ss\")); \/\/following Canadian Standard 'ISO 8601'\n    filename.prepend(DebugFilePath);\n\n    \/*Log Csv File*\/\n    logCsvFile_.setFileName(filename + \".csv\");\n    if(logCsvFile_.open(QIODevice::WriteOnly | QIODevice::Text))    \/\/optional text can go be initialized here\n    {\n\n    }\n\n\n    \/*Log Text File*\/\n    logTxtFile_.setFileName(filename + \".txt\");\n    if(logTxtFile_.open(QIODevice::WriteOnly | QIODevice::Text))\n    {\n        QTextStream writer(&logTxtFile_);\n        writer << \"|======================\";\n        writer << date.toString(\"ddd MMM d yyyy\");\n        writer << \"======================|\" << endl;\n        writer <<  \"                     SOLARCAR  DEBUG  LOG\" << endl;\n        writer << \"|===========================================================|\" << endl;\n    }\n    \/*\n    storeCsv2DArray(5,5);\n    storeCsv2DArray(5,5);\n    storeCsv2DArray(5,5);\n    storeCsv2DArray(5,5);\n    storeCsv2DArray(22,22);\n    storeCsv2DArray(24,24);\n    storeCsv2DArray(24,24);\n    storeCsv2DArray(25,25);\n    storeCsv2DArray(25,25);\n    storeCsv2DArray(25,25);\n    int temp = (csv2DArray_[5][0]);\n    printf(\"csv2DArray_[0].at(0) = %d\\n\",temp);\n    *\/\n\n}\n\nDebugHandler::~DebugHandler()\n{\n    \/*write to file before closing*\/\n    printf(\"Writing to File\\n\");\n    printToDebuglogCsvFile();\n    logTxtFile_.close();\n    logCsvFile_.close();\n}\n\n\n\/** public functions **\/\nvoid DebugHandler::receivedConnectionService(QString debugMessage)\n{\n   emit sendDebugMessageToPresenter(debugMessage);\n}\n\n\/\/gets the original RAW string that dataparse receieves (this will just be sent to the debuglogTxtFile)\nvoid DebugHandler::receivedDebugDataParser(QString debugMessage)\n{\n    QString messageToFile(\"             | RAW-STRING   : \"); \/\/Optional String prepending Message\n    messageToFile.append(debugMessage);\n    printlnToDebuglogTxtFile(messageToFile);\n}\n\n\/\/gets the parsed values that dataparser emits and translates it to a human readable format\n\/\/and sends it to the debuglogTxtFile\nvoid DebugHandler::receivedParsedDataParser(int id, double value)\n{\n    QDateTime date = QDateTime::currentDateTime();\n    QString messageToFile(\" | PARSED-STRING: \"); \/\/Optional String prepending Message.\n    messageToFile.prepend(date.toString(\"hh:mm:ss:zzz\"));\n\n    messageToFile.append(convertIDtoString(id));\n    messageToFile.append(QString::number(value)); \/\/May need to change this if we don't want raw 'value' going in.\n\n    printlnToDebuglogTxtFile(messageToFile);\n\n    storeCsv2DArray(id, value);\n}\n\n\n\/** private **\/\n\n\/\/Orientation of the Vectors is Vectors pointing downwards. Each Vector represents a columnn\nvoid DebugHandler::storeCsv2DArray(int id, int value)\n{\n    int currentMaxId = csv2DArray_.length(); \/\/Number of Columns there are.\n    int missing = id - currentMaxId + 1;\n\n    if(missing > 0)    \/\/if missing is postive, id doesn't have a spot within the array yet\n    {\n        for(int i = 0; i < missing; i++)\n        {\n            QVector<int> newColumn;\n            csv2DArray_.push_back(newColumn);\n        }\n    }\n\n    csv2DArray_[id].push_back(value);\n}\n\nvoid DebugHandler::printlnToDebuglogTxtFile(QString debugMessage)\n{\n    QTextStream writer(&logTxtFile_);\n    writer << debugMessage << endl;\n}\n\nvoid DebugHandler::printToDebuglogCsvFile(void)\n{\n\n    QTextStream writer(&logCsvFile_);\n    QString messageToFile(\"\"); \/\/Optional String prepending Message.\n    int numOfColumns = csv2DArray_.length();\n    int longestColumnLength = 0;\n\n    messageToFile.clear();\n    for(int i = 0; i < numOfColumns; i++)\n    {\n       \/\/ messageToFile.append(QString::number(i));\n       messageToFile.append(convertIDtoString(i));\n       messageToFile.append(\",\");\n    }\n    messageToFile.append(\"\\n\");\n    writer << messageToFile;\n\n    \/*finds longest column*\/\n    for(int i = 0; i < numOfColumns; i++)\n    {\n        if(longestColumnLength < csv2DArray_.at(i).length())\n            longestColumnLength = csv2DArray_.at(i).length();\n\n    }\n    printf(\"The Longest Length was: %d\\n\",longestColumnLength);\n    for(int currentRow = 0; currentRow < longestColumnLength; currentRow++)\n    {\n        messageToFile.clear();\n        for(int index = 0; index < numOfColumns; index++)\n        {\n            if(csv2DArray_[index].length() > currentRow) \/\/if true,[index].at(currentRow) exists\n            {\n                printf(\"Value found at: csv2DArray[%d][%d] = %d\\n\",index, currentRow,csv2DArray_[index][currentRow] );\n                messageToFile.append(QString::number(csv2DArray_[index].at(currentRow)));\n            }\n            messageToFile.append(\",\");\n        }\n        messageToFile.append(\"\\n\");\n        printf(\"writing string: %s\\n\", messageToFile.toStdString().c_str());\n        writer << messageToFile;\n    }\n}\n\nQString DebugHandler::convertIDtoString(int id)\n{\n   QString convertedID(\"\");\/\/Optional String prepending Converted ID.\n\n   switch(id)\n   {\n   case DataPopulator::DriverSetSpeedRPM:\n      convertedID.append(\"DriverSetSpeedRPM:\");\n      break;\n   case DataPopulator::DriverSetCurrent:\n      convertedID.append(\"DriverSetCurrent:\");\n      break;\n   case DataPopulator::VehicleVelocity:\n      convertedID.append(\"VehicleVelocity:\");\n      break;\n   case DataPopulator::BusCurrentA:\n      convertedID.append(\"BusCurrentA:\");\n      break;\n   case DataPopulator::BusVoltage:\n      convertedID.append(\"BusVoltage:\");\n      break;\n   case DataPopulator::MotorVelocityRpm:\n      convertedID.append(\"MotorVelocityRpm:\");\n      break;\n   case DataPopulator::MotorVoltageReal:\n      convertedID.append(\"MotorVoltageReal:\");\n      break;\n   case DataPopulator::MotorCurrentReal:\n      convertedID.append(\"MotorCurrentReal:\");\n      break;\n   case DataPopulator::BackEmfImaginary:\n      convertedID.append(\"BackEmfImaginary:\");\n      break;\n   case DataPopulator::IpmHeatSinkTemp:\n      convertedID.append(\"IpmHeatSinkTemp:\");\n      break;\n   case DataPopulator::DspBoardTemp:\n      convertedID.append(\"DspBoardTemp:\");\n      break;\n   case DataPopulator::DcBusAmpHours:\n      convertedID.append(\"DcBusAmpHours:\");\n      break;\n   case DataPopulator::ReceivedErrorCount:\n      convertedID.append(\"ReceivedErrorCount:\");\n      break;\n   case DataPopulator::TransmittedErrorCount:\n      convertedID.append(\"TransmittedErrorCount:\");\n      break;\n\n   case DataPopulator::Mod0PcbTemperature:\n      convertedID.append(\"Mod0PcbTemperature:\");\n      break;\n   case DataPopulator::Mod0CellTemperature:\n      convertedID.append(\"Mod0CellTemperature:\");\n      break;\n   case DataPopulator::Mod0CellVoltage0:\n      convertedID.append(\"Mod0CellVoltage0:\");\n      break;\n   case DataPopulator::Mod0CellVoltage1:\n      convertedID.append(\"Mod0CellVoltage1:\");\n      break;\n   case DataPopulator::Mod0CellVoltage2:\n      convertedID.append(\"Mod0CellVoltage2:\");\n      break;\n   case DataPopulator::Mod0CellVoltage3:\n      convertedID.append(\"Mod0PcbTemperature:\");\n      break;\n   case DataPopulator::Mod0CellVoltage4:\n      convertedID.append(\"Mod0CellVoltage4:\");\n      break;\n   case DataPopulator::Mod0CellVoltage5:\n      convertedID.append(\"Mod0CellVoltage5:\");\n      break;\n   case DataPopulator::Mod0CellVoltage6:\n      convertedID.append(\"Mod0CellVoltage6:\");\n      break;\n   case DataPopulator::Mod0CellVoltage7:\n      convertedID.append(\"Mod0CellVoltage7:\");\n      break;\n\n   case DataPopulator::Mod1PcbTemperature:\n      convertedID.append(\"Mod1PcbTemperature:\");\n      break;\n   case DataPopulator::Mod1CellTemperature:\n      convertedID.append(\"Mod1CellTemperature:\");\n      break;\n   case DataPopulator::Mod1CellVoltage0:\n      convertedID.append(\"Mod1CellVoltage0:\");\n      break;\n   case DataPopulator::Mod1CellVoltage1:\n      convertedID.append(\"Mod1CellVoltage1:\");\n      break;\n   case DataPopulator::Mod1CellVoltage2:\n      convertedID.append(\"Mod1CellVoltage2:\");\n      break;\n   case DataPopulator::Mod1CellVoltage3:\n      convertedID.append(\"Mod1CellVoltage3:\");\n      break;\n   case DataPopulator::Mod1CellVoltage4:\n      convertedID.append(\"Mod1CellVoltage4:\");\n      break;\n   case DataPopulator::Mod1CellVoltage5:\n      convertedID.append(\"Mod1CellVoltage5:\");\n      break;\n   case DataPopulator::Mod1CellVoltage6:\n      convertedID.append(\"Mod1CellVoltage6:\");\n      break;\n   case DataPopulator::Mod1CellVoltage7:\n      convertedID.append(\"Mod1CellVoltage7:\");\n      break;\n\n   case DataPopulator::Mod2PcbTemperature:\n       convertedID.append(\"Mod2PcbTemperature:\");\n       break;\n   case DataPopulator::Mod2CellTemperature:\n        convertedID.append(\"Mod2CellTemperature:\");\n      break;\n   case DataPopulator::Mod2CellVoltage0:\n        convertedID.append(\"Mod2CellVoltage0:\");\n      break;\n   case DataPopulator::Mod2CellVoltage1:\n        convertedID.append(\"Mod2CellVoltage1:\");\n      break;\n   case DataPopulator::Mod2CellVoltage2:\n        convertedID.append(\"Mod2CellVoltage2:\");\n      break;\n   case DataPopulator::Mod2CellVoltage3:\n        convertedID.append(\"Mod2CellVoltage3:\");\n      break;\n   case DataPopulator::Mod2CellVoltage4:\n        convertedID.append(\"Mod2CellVoltage4:\");\n      break;\n   case DataPopulator::Mod2CellVoltage5:\n        convertedID.append(\"Mod2CellVoltage5:\");\n      break;\n   case DataPopulator::Mod2CellVoltage6:\n        convertedID.append(\"Mod2CellVoltage6:\");\n      break;\n   case DataPopulator::Mod2CellVoltage7:\n        convertedID.append(\"Mod2CellVoltage7:\");\n      break;\n\n   case DataPopulator::Mod3PcbTemperature:\n        convertedID.append(\"Mod3PcbTemperature:\");\n      break;\n   case DataPopulator::Mod3CellTemperature:\n        convertedID.append(\"Mod3CellTemperature:\");\n      break;\n   case DataPopulator::Mod3CellVoltage0:\n        convertedID.append(\"Mod3CellVoltage0:\");\n      break;\n   case DataPopulator::Mod3CellVoltage1:\n        convertedID.append(\"Mod3CellVoltage1:\");\n      break;\n   case DataPopulator::Mod3CellVoltage2:\n        convertedID.append(\"Mod3CellVoltage2:\");\n      break;\n   case DataPopulator::Mod3CellVoltage3:\n        convertedID.append(\"Mod3CellVoltage3:\");\n      break;\n   case DataPopulator::Mod3CellVoltage4:\n        convertedID.append(\"Mod3CellVoltage4:\");\n      break;\n   case DataPopulator::Mod3CellVoltage5:\n        convertedID.append(\"Mod3CellVoltage5:\");\n      break;\n   case DataPopulator::Mod3CellVoltage6:\n        convertedID.append(\"Mod3CellVoltage6:\");\n      break;\n   case DataPopulator::Mod3CellVoltage7:\n        convertedID.append(\"Mod3CellVoltage7:\");\n      break;\n\n   case DataPopulator::BatteryVoltage:\n        convertedID.append(\"BatteryVoltage:\");\n      break;\n   case DataPopulator::BatteryCurrent:\n        convertedID.append(\"BatteryCurrent:\");\n      break;\n   case DataPopulator::BatteryVoltageThresholdRising:\n        convertedID.append(\"BatteryVoltageThresholdRising:\");\n      break;\n   case DataPopulator::BatteryVoltageThresholdFalling:\n        convertedID.append(\"BatteryVoltageThresholdFalling:\");\n      break;\n   }\n\nreturn convertedID;\n}\n<commit_msg>Cleaned up DebugHandler.cpp and took out unneccesary comments<commit_after>#include \"DebugHandler.h\"\n#include \"..\/ConnectionService\/I_ConnectionService.h\"\n#include \"..\/DataParser\/I_DataParser.h\"\n#include \"..\/DataPopulator\/DataPopulator.h\"\n\nDebugHandler::DebugHandler(I_ConnectionService& connectionService, I_DataParser& dataParser, QString filename)\n: logTxtFile_(filename)\n, logCsvFile_(filename)\n, connectionService_(connectionService)\n, dataParser_(dataParser)\n{\n    \/********************Connections********************\/\n    connect(&connectionService, SIGNAL(sendDebugMessage(QString)),\n            this, SLOT (receivedConnectionService(QString)));\n    \/\/RAW String\n    connect(&dataParser, SIGNAL(sendDebugMessage(QString)),\n            this, SLOT (receivedDebugDataParser(QString)));                 \/\/notes, RAW string ends with a \\n\n    \/\/PARSED values\n    connect(&dataParser, SIGNAL(dataReceived(int,double)),\n            this, SLOT (receivedParsedDataParser(int, double)));\n\n    \/********************File Initializing********************\/\n    QDateTime date = QDateTime::currentDateTime();\n    QString DebugFilePath(\"DebugLogs\/\"); \/\/can only create ONE NEW folder.\n    if(!QDir(DebugFilePath).exists())\n        QDir().mkdir(DebugFilePath);\n\n\n    filename.prepend(date.toString(\"yyyy.MM.dd_hh.mm.ss\")); \/\/following Canadian Standard 'ISO 8601'\n    filename.prepend(DebugFilePath);\n\n    \/*Log Csv File*\/\n    logCsvFile_.setFileName(filename + \".csv\");\n    if(logCsvFile_.open(QIODevice::WriteOnly | QIODevice::Text))    \/\/optional text can go be initialized here\n    {\n\n    }\n\n    \/*Log Text File*\/\n    logTxtFile_.setFileName(filename + \".txt\");\n    if(logTxtFile_.open(QIODevice::WriteOnly | QIODevice::Text))\n    {\n        QTextStream writer(&logTxtFile_);\n        writer << \"|======================\";\n        writer << date.toString(\"ddd MMM d yyyy\");\n        writer << \"======================|\" << endl;\n        writer <<  \"                     SOLARCAR  DEBUG  LOG\" << endl;\n        writer << \"|===========================================================|\" << endl;\n    }\n}\n\nDebugHandler::~DebugHandler()\n{\n    \/*write to file before closing*\/\n    printToDebuglogCsvFile();\n    logTxtFile_.close();\n    logCsvFile_.close();\n}\n\n\n\/** public functions **\/\nvoid DebugHandler::receivedConnectionService(QString debugMessage)\n{\n   emit sendDebugMessageToPresenter(debugMessage);\n}\n\n\/\/gets the original RAW string that dataparse receieves (this will just be sent to the debuglogTxtFile)\nvoid DebugHandler::receivedDebugDataParser(QString debugMessage)\n{\n    QString messageToFile(\"             | RAW-STRING   : \"); \/\/Optional String prepending Message\n    messageToFile.append(debugMessage);\n    printlnToDebuglogTxtFile(messageToFile);\n}\n\n\/\/gets the parsed values that dataparser emits and translates it to a human readable format\n\/\/and sends it to the debuglogTxtFile\nvoid DebugHandler::receivedParsedDataParser(int id, double value)\n{\n    QDateTime date = QDateTime::currentDateTime();\n    QString messageToFile(\" | PARSED-STRING: \"); \/\/Optional String prepending Message.\n    messageToFile.prepend(date.toString(\"hh:mm:ss:zzz\"));\n\n    messageToFile.append(convertIDtoString(id));\n    messageToFile.append(QString::number(value)); \/\/May need to change this if we don't want raw 'value' going in.\n\n    printlnToDebuglogTxtFile(messageToFile);\n\n    storeCsv2DArray(id, value);\n}\n\n\n\/** private **\/\n\n\/\/Orientation of the Vectors is Vectors pointing downwards. Each Vector represents a columnn\nvoid DebugHandler::storeCsv2DArray(int id, int value)\n{\n    int currentMaxId = csv2DArray_.length(); \/\/Number of Columns there are.\n    int missing = id - currentMaxId + 1;\n\n    if(missing > 0)    \/\/if missing is postive, id doesn't have a spot within the array yet\n    {\n        for(int i = 0; i < missing; i++)\n        {\n            QVector<int> newColumn;\n            csv2DArray_.push_back(newColumn);\n        }\n    }\n\n    csv2DArray_[id].push_back(value);\n}\n\nvoid DebugHandler::printlnToDebuglogTxtFile(QString debugMessage)\n{\n    QTextStream writer(&logTxtFile_);\n    writer << debugMessage << endl;\n}\n\nvoid DebugHandler::printToDebuglogCsvFile(void)\n{\n\n    QTextStream writer(&logCsvFile_);\n    QString messageToFile;\n\n    int numOfColumns = csv2DArray_.length();\n    int longestColumnLength = 0;\n\n    messageToFile.clear();\n    for(int i = 0; i < numOfColumns; i++)\n    {\n       messageToFile.append(convertIDtoString(i));\n       messageToFile.append(\",\");\n    }\n\n    messageToFile.append(\"\\n\");\n    writer << messageToFile;\n\n    \/*finds longest column*\/\n    for(int i = 0; i < numOfColumns; i++)\n    {\n        if(longestColumnLength < csv2DArray_.at(i).length())\n            longestColumnLength = csv2DArray_.at(i).length();\n\n    }\n    \/*write the values into the csv*\/\n    for(int currentRow = 0; currentRow < longestColumnLength; currentRow++)\n    {\n        messageToFile.clear();\n        for(int index = 0; index < numOfColumns; index++)\n        {\n            if(csv2DArray_[index].length() > currentRow) \/\/if true,[index].at(currentRow) exists\n            {\n                messageToFile.append(QString::number(csv2DArray_[index].at(currentRow)));\n            }\n            messageToFile.append(\",\");\n        }\n        messageToFile.append(\"\\n\");\n        writer << messageToFile;\n    }\n}\n\nQString DebugHandler::convertIDtoString(int id)\n{\n   QString convertedID(\"\");\/\/Optional String prepending Converted ID.\n\n   switch(id)\n   {\n   case DataPopulator::DriverSetSpeedRPM:\n      convertedID.append(\"DriverSetSpeedRPM:\");\n      break;\n   case DataPopulator::DriverSetCurrent:\n      convertedID.append(\"DriverSetCurrent:\");\n      break;\n   case DataPopulator::VehicleVelocity:\n      convertedID.append(\"VehicleVelocity:\");\n      break;\n   case DataPopulator::BusCurrentA:\n      convertedID.append(\"BusCurrentA:\");\n      break;\n   case DataPopulator::BusVoltage:\n      convertedID.append(\"BusVoltage:\");\n      break;\n   case DataPopulator::MotorVelocityRpm:\n      convertedID.append(\"MotorVelocityRpm:\");\n      break;\n   case DataPopulator::MotorVoltageReal:\n      convertedID.append(\"MotorVoltageReal:\");\n      break;\n   case DataPopulator::MotorCurrentReal:\n      convertedID.append(\"MotorCurrentReal:\");\n      break;\n   case DataPopulator::BackEmfImaginary:\n      convertedID.append(\"BackEmfImaginary:\");\n      break;\n   case DataPopulator::IpmHeatSinkTemp:\n      convertedID.append(\"IpmHeatSinkTemp:\");\n      break;\n   case DataPopulator::DspBoardTemp:\n      convertedID.append(\"DspBoardTemp:\");\n      break;\n   case DataPopulator::DcBusAmpHours:\n      convertedID.append(\"DcBusAmpHours:\");\n      break;\n   case DataPopulator::ReceivedErrorCount:\n      convertedID.append(\"ReceivedErrorCount:\");\n      break;\n   case DataPopulator::TransmittedErrorCount:\n      convertedID.append(\"TransmittedErrorCount:\");\n      break;\n\n   case DataPopulator::Mod0PcbTemperature:\n      convertedID.append(\"Mod0PcbTemperature:\");\n      break;\n   case DataPopulator::Mod0CellTemperature:\n      convertedID.append(\"Mod0CellTemperature:\");\n      break;\n   case DataPopulator::Mod0CellVoltage0:\n      convertedID.append(\"Mod0CellVoltage0:\");\n      break;\n   case DataPopulator::Mod0CellVoltage1:\n      convertedID.append(\"Mod0CellVoltage1:\");\n      break;\n   case DataPopulator::Mod0CellVoltage2:\n      convertedID.append(\"Mod0CellVoltage2:\");\n      break;\n   case DataPopulator::Mod0CellVoltage3:\n      convertedID.append(\"Mod0PcbTemperature:\");\n      break;\n   case DataPopulator::Mod0CellVoltage4:\n      convertedID.append(\"Mod0CellVoltage4:\");\n      break;\n   case DataPopulator::Mod0CellVoltage5:\n      convertedID.append(\"Mod0CellVoltage5:\");\n      break;\n   case DataPopulator::Mod0CellVoltage6:\n      convertedID.append(\"Mod0CellVoltage6:\");\n      break;\n   case DataPopulator::Mod0CellVoltage7:\n      convertedID.append(\"Mod0CellVoltage7:\");\n      break;\n\n   case DataPopulator::Mod1PcbTemperature:\n      convertedID.append(\"Mod1PcbTemperature:\");\n      break;\n   case DataPopulator::Mod1CellTemperature:\n      convertedID.append(\"Mod1CellTemperature:\");\n      break;\n   case DataPopulator::Mod1CellVoltage0:\n      convertedID.append(\"Mod1CellVoltage0:\");\n      break;\n   case DataPopulator::Mod1CellVoltage1:\n      convertedID.append(\"Mod1CellVoltage1:\");\n      break;\n   case DataPopulator::Mod1CellVoltage2:\n      convertedID.append(\"Mod1CellVoltage2:\");\n      break;\n   case DataPopulator::Mod1CellVoltage3:\n      convertedID.append(\"Mod1CellVoltage3:\");\n      break;\n   case DataPopulator::Mod1CellVoltage4:\n      convertedID.append(\"Mod1CellVoltage4:\");\n      break;\n   case DataPopulator::Mod1CellVoltage5:\n      convertedID.append(\"Mod1CellVoltage5:\");\n      break;\n   case DataPopulator::Mod1CellVoltage6:\n      convertedID.append(\"Mod1CellVoltage6:\");\n      break;\n   case DataPopulator::Mod1CellVoltage7:\n      convertedID.append(\"Mod1CellVoltage7:\");\n      break;\n\n   case DataPopulator::Mod2PcbTemperature:\n       convertedID.append(\"Mod2PcbTemperature:\");\n       break;\n   case DataPopulator::Mod2CellTemperature:\n        convertedID.append(\"Mod2CellTemperature:\");\n      break;\n   case DataPopulator::Mod2CellVoltage0:\n        convertedID.append(\"Mod2CellVoltage0:\");\n      break;\n   case DataPopulator::Mod2CellVoltage1:\n        convertedID.append(\"Mod2CellVoltage1:\");\n      break;\n   case DataPopulator::Mod2CellVoltage2:\n        convertedID.append(\"Mod2CellVoltage2:\");\n      break;\n   case DataPopulator::Mod2CellVoltage3:\n        convertedID.append(\"Mod2CellVoltage3:\");\n      break;\n   case DataPopulator::Mod2CellVoltage4:\n        convertedID.append(\"Mod2CellVoltage4:\");\n      break;\n   case DataPopulator::Mod2CellVoltage5:\n        convertedID.append(\"Mod2CellVoltage5:\");\n      break;\n   case DataPopulator::Mod2CellVoltage6:\n        convertedID.append(\"Mod2CellVoltage6:\");\n      break;\n   case DataPopulator::Mod2CellVoltage7:\n        convertedID.append(\"Mod2CellVoltage7:\");\n      break;\n\n   case DataPopulator::Mod3PcbTemperature:\n        convertedID.append(\"Mod3PcbTemperature:\");\n      break;\n   case DataPopulator::Mod3CellTemperature:\n        convertedID.append(\"Mod3CellTemperature:\");\n      break;\n   case DataPopulator::Mod3CellVoltage0:\n        convertedID.append(\"Mod3CellVoltage0:\");\n      break;\n   case DataPopulator::Mod3CellVoltage1:\n        convertedID.append(\"Mod3CellVoltage1:\");\n      break;\n   case DataPopulator::Mod3CellVoltage2:\n        convertedID.append(\"Mod3CellVoltage2:\");\n      break;\n   case DataPopulator::Mod3CellVoltage3:\n        convertedID.append(\"Mod3CellVoltage3:\");\n      break;\n   case DataPopulator::Mod3CellVoltage4:\n        convertedID.append(\"Mod3CellVoltage4:\");\n      break;\n   case DataPopulator::Mod3CellVoltage5:\n        convertedID.append(\"Mod3CellVoltage5:\");\n      break;\n   case DataPopulator::Mod3CellVoltage6:\n        convertedID.append(\"Mod3CellVoltage6:\");\n      break;\n   case DataPopulator::Mod3CellVoltage7:\n        convertedID.append(\"Mod3CellVoltage7:\");\n      break;\n\n   case DataPopulator::BatteryVoltage:\n        convertedID.append(\"BatteryVoltage:\");\n      break;\n   case DataPopulator::BatteryCurrent:\n        convertedID.append(\"BatteryCurrent:\");\n      break;\n   case DataPopulator::BatteryVoltageThresholdRising:\n        convertedID.append(\"BatteryVoltageThresholdRising:\");\n      break;\n   case DataPopulator::BatteryVoltageThresholdFalling:\n        convertedID.append(\"BatteryVoltageThresholdFalling:\");\n      break;\n   default:\n       convertedID.append(\"**NO ID**\");\n       break;\n   }\n\nreturn convertedID;\n}\n\n    \/*\n     * tester to put into constructor\n    storeCsv2DArray(0,5);\n    storeCsv2DArray(5,5);\n    storeCsv2DArray(5,5);\n    storeCsv2DArray(5,5);\n    storeCsv2DArray(22,22);\n    storeCsv2DArray(24,24);\n    storeCsv2DArray(24,24);\n    storeCsv2DArray(25,25);\n    storeCsv2DArray(25,25);\n    storeCsv2DArray(25,25);\n    int temp = (csv2DArray_[5][0]);\n    printf(\"csv2DArray_[0].at(0) = %d\\n\",temp);\n    *\/\n<|endoftext|>"}
{"text":"<commit_before>#include <stdio.h>\n#include <stdlib.h>\n#include <string>\n#include <algorithm>\n\n#include <iostream>\n#include <GCanvas.hpp>\n#include <lodepng.h>\n#include <fstream>\n#define CONTEXT_ES20\n\n#include \"GBenchMark.h\"\nconst static GLuint renderBufferHeight = 300;\nconst static GLuint renderBufferWidth = 300;\n\nclass CaseOne:public GBenchMarkCase{\npublic:\n    CaseOne(std::string name):GBenchMarkCase(name){}\n    void draw(std::shared_ptr<gcanvas::GCanvas> canvas,int width,int height) override  {\n                if(canvas){\n                    canvas->mCanvasContext->SetFillStyle(\"#ff0000\");\n                    canvas->mCanvasContext->FillRect(0, 0, width, height);\n                }\n    }\n};\n\n   \n\nint main(int argc, char *argv[])\n{\n   std::shared_ptr<gcanvas::GCanvas> p(new gcanvas::GCanvas (\"benchMark\", {false, true}, nullptr));\n   GBenchMark mbench(renderBufferWidth,renderBufferHeight,p);\n   mbench.intilGLOffScreenEnviroment();\n\n   std::shared_ptr<GBenchMarkCase> case1(new CaseOne(\"fillRect\"));\n   mbench.run(case1);\n   float ratio = mbench.computeRatioWithW3C(case1->getCaseName());\n   std::cout << \"------------------\"<< \"the case name is \"<<case1->getCaseName() << std::endl;\n   std::cout << \"------------------\" << \"the correct ratio is  \" << ratio << std::endl;\n   case1->ratio=ratio;\n    \n    \n   std:: ofstream myfile;\n   myfile.open (\"result.txt\");\n   myfile << case1->getCaseName();\n   myfile << \"#\";\n   myfile << case1->ratio;\n   myfile.close();\n}<commit_msg>m:完成benchmark测试过程打印<commit_after>#include <stdio.h>\n#include <stdlib.h>\n#include <string>\n#include <algorithm>\n\n#include <iostream>\n#include <GCanvas.hpp>\n#include <lodepng.h>\n#include <fstream>\n#define CONTEXT_ES20\n\n#include \"GBenchMark.h\"\nconst static GLuint renderBufferHeight = 300;\nconst static GLuint renderBufferWidth = 300;\n\nclass CaseOne:public GBenchMarkCase{\npublic:\n    CaseOne(std::string name):GBenchMarkCase(name){}\n    void draw(std::shared_ptr<gcanvas::GCanvas> canvas,int width,int height) override  {\n                if(canvas){\n                    canvas->mCanvasContext->SetFillStyle(\"#ff0000\");\n                    canvas->mCanvasContext->FillRect(0, 0, width, height);\n                }\n    }\n};\n\n   \n\nint main(int argc, char *argv[])\n{\n   std::shared_ptr<gcanvas::GCanvas> p(new gcanvas::GCanvas (\"benchMark\", {false, true}, nullptr));\n   GBenchMark mbench(renderBufferWidth,renderBufferHeight,p);\n   mbench.intilGLOffScreenEnviroment();\n\n   std::shared_ptr<GBenchMarkCase> case1(new CaseOne(\"fillRect\"));\n   mbench.run(case1);\n   float ratio = mbench.computeRatioWithW3C(case1->getCaseName());\n   std::cout << \"------------------\"<< std::endl;\n   std::cout << \"the case name is \"<<case1->getCaseName() << std::endl;\n   std::cout << \"------------------\" << std::endl;\n   std::cout << \"the correct ratio is \" << ratio << std::endl;\n   case1->ratio=ratio;\n    \n    \n   std:: ofstream myfile;\n   myfile.open (\"result.txt\");\n   myfile << case1->getCaseName();\n   myfile << \"#\";\n   myfile << case1->ratio;\n   myfile.close();\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n** Copyright 2012-2013 Merethis\n**\n** This file is part of Centreon Broker.\n**\n** Centreon Broker is free software: you can redistribute it and\/or\n** modify it under the terms of the GNU General Public License version 2\n** as published by the Free Software Foundation.\n**\n** Centreon Broker is distributed in the hope that it will be useful,\n** but WITHOUT ANY WARRANTY; without even the implied warranty of\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n** General Public License for more details.\n**\n** You should have received a copy of the GNU General Public License\n** along with Centreon Broker. If not, see\n** <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <cerrno>\n#include <cstdlib>\n#include <cstring>\n#include <fcntl.h>\n#include <iomanip>\n#include <QFileInfo>\n#include <QMutexLocker>\n#include <poll.h>\n#include <sstream>\n#include <time.h>\n#include <unistd.h>\n#include \"com\/centreon\/broker\/config\/applier\/endpoint.hh\"\n#include \"com\/centreon\/broker\/config\/applier\/modules.hh\"\n#include \"com\/centreon\/broker\/exceptions\/msg.hh\"\n#include \"com\/centreon\/broker\/logging\/logging.hh\"\n#include \"com\/centreon\/broker\/stats\/worker.hh\"\n\nusing namespace com::centreon::broker::stats;\n\n\/**************************************\n*                                     *\n*           Public Methods            *\n*                                     *\n**************************************\/\n\n\/**\n *  Default constructor.\n *\/\nworker::worker() : _fd(-1) {}\n\n\/**\n *  Destructor.\n *\/\nworker::~worker() throw () {}\n\n\/**\n *  Set the exit flag.\n *\/\nvoid worker::exit() {\n  _should_exit = true;\n  return ;\n}\n\n\/**\n *  Run the statistics thread.\n *\n *  @param[in] fifo_file Path to the FIFO file.\n *\/\nvoid worker::run(QString const& fifo_file) {\n  \/\/ Close FD.\n  _close();\n\n  \/\/ Set FIFO file.\n  _fifo = fifo_file.toStdString();\n\n  \/\/ Set exit flag.\n  _should_exit = false;\n\n  \/\/ Launch thread.\n  start();\n\n  return ;\n}\n\n\/**************************************\n*                                     *\n*           Private Methods           *\n*                                     *\n**************************************\/\n\n\/**\n *  Close FIFO fd.\n *\/\nvoid worker::_close() {\n  if (_fd >= 0) {\n    close(_fd);\n    _fd = -1;\n  }\n  return ;\n}\n\n\/**\n *  Generate statistics.\n *\/\nvoid worker::_generate_stats() {\n  \/\/ General.\n  {\n    std::ostringstream oss;\n    oss << \"broker\\n\"\n      \"version=\" CENTREON_BROKER_VERSION \"\\n\"\n      \"pid=\" << getpid() << \"\\n\"\n      \"now=\" << time(NULL) << \"\\n\"\n      \"compiled with qt=\" << QT_VERSION_STR << \"\\n\"\n      \"running with qt=\" << qVersion() << \"\\n\"\n      \"\\n\";\n    _buffer.append(oss.str());\n  }\n\n  \/\/ Modules.\n  config::applier::modules&\n    mod_applier(config::applier::modules::instance());\n  for (config::applier::modules::iterator\n         it(mod_applier.begin()),\n         end(mod_applier.end());\n       it != end;\n       ++it) {\n    std::ostringstream oss;\n    QFileInfo fi(it.key());\n    oss << \"module \" << it.key().toStdString() << \"\\n\"\n      \"state=loaded\\n\"\n      \"size=\" << fi.size() << \"B\\n\"\n      \"\\n\";\n    _buffer.append(oss.str());\n  }\n\n  \/\/ Endpoint applier.\n  config::applier::endpoint&\n    endp_applier(config::applier::endpoint::instance());\n\n  \/\/ Print input endpoints.\n  {\n    bool locked(endp_applier.input_mutex().tryLock(100));\n    try {\n      if (locked)\n        for (config::applier::endpoint::iterator\n               it = endp_applier.input_begin(),\n               end = endp_applier.input_end();\n             it != end;\n             ++it) {\n          _generate_stats_for_endpoint(*it, _buffer, false);\n          _buffer.append(\"\\n\");\n        }\n      else\n        _buffer.append(\n          \"inputs=could not fetch list, configuration update in progress ?\\n\");\n    }\n    catch (...) {\n      if (locked)\n        endp_applier.input_mutex().unlock();\n      throw ;\n    }\n    if (locked)\n      endp_applier.input_mutex().unlock();\n  }\n\n  \/\/ Print output endpoints.\n  {\n    bool locked(endp_applier.output_mutex().tryLock(100));\n    try {\n      if (locked)\n        for (config::applier::endpoint::iterator\n               it(endp_applier.output_begin()),\n               end(endp_applier.output_end());\n             it != end;\n             ++it) {\n          _generate_stats_for_endpoint(*it, _buffer, true);\n          _buffer.append(\"\\n\");\n        }\n      else\n        _buffer.append(\n          \"outputs=could not fetch list, configuration update in progress ?\\n\");\n    }\n    catch (...) {\n      if (locked)\n        endp_applier.output_mutex().unlock();\n      throw ;\n    }\n    if (locked)\n      endp_applier.output_mutex().unlock();\n  }\n\n  return ;\n}\n\n\/**\n *  Generate statistics for an endpoint.\n *\n *  @param[in]  fo     Failover thread of the endpoint.\n *  @param[out] buffer Buffer in which data will be printed.\n *  @param[in]  is_out true if fo manage an output endpoint.\n *\/\nvoid worker::_generate_stats_for_endpoint(\n               processing::failover* fo,\n               std::string& buffer,\n               bool is_out) {\n  \/\/ Header.\n  buffer.append(is_out ? \"output \" : \"input \");\n  buffer.append(fo->_name.toStdString());\n  buffer.append(\"\\n\");\n\n  \/\/ Choose stream we will work on.\n  QReadWriteLock* first_rwl;\n  misc::shared_ptr<io::stream>* first_s;\n  QReadWriteLock* second_rwl;\n  misc::shared_ptr<io::stream>* second_s;\n  if (is_out) {\n    first_rwl = &fo->_tom;\n    first_s = &fo->_to;\n    second_rwl = &fo->_fromm;\n    second_s = &fo->_from;\n  }\n  else {\n    first_rwl = &fo->_fromm;\n    first_s = &fo->_from;\n    second_rwl = &fo->_tom;\n    second_s = &fo->_to;\n  }\n\n  {\n    \/\/ Get primary state.\n    buffer.append(\"state=\");\n    bool locked(first_rwl->tryLockForRead(10));\n    try {\n      \/\/ Could lock RWL.\n      if (locked) {\n        if (first_s->isNull()) {\n          if (!fo->_last_error.isEmpty()) {\n            buffer.append(\"disconnected\");\n            buffer.append(\" (\");\n            buffer.append(fo->_last_error.toStdString());\n            buffer.append(\")\\n\");\n          }\n          else if (!fo->_endpoint.isNull()\n                   && !fo->_endpoint->is_acceptor())\n            buffer.append(\"connecting\\n\");\n          else\n            buffer.append(\"listening\\n\");\n        }\n        else if (!fo->_failover.isNull() && fo->_failover->isRunning()) {\n          buffer.append(\"replaying\\n\");\n          (*first_s)->statistics(buffer);\n        }\n        else {\n          buffer.append(\"connected\\n\");\n          (*first_s)->statistics(buffer);\n        }\n      }\n      \/\/ Could not lock RWL.\n      else\n        buffer.append(\"blocked\\n\");\n    }\n    catch (...) {\n      if (locked)\n        first_rwl->unlock();\n      throw ;\n    }\n    if (locked)\n      first_rwl->unlock();\n  }\n\n  {\n    \/\/ Get secondary state.\n    QReadLocker rl(second_rwl);\n    if (!second_s->isNull())\n      (*second_s)->statistics(buffer);\n  }\n\n  {\n    \/\/ Event processing stats.\n    std::ostringstream oss;\n    oss << \"last event at=\" << fo->get_last_event() << \"\\n\"\n      \"event processing speed=\" << std::fixed\n        << std::setprecision(1) << fo->get_event_processing_speed()\n        << \" events\/s\\n\";\n    buffer.append(oss.str());\n  }\n\n  \/\/ Endpoint stats.\n  if (!fo->_endpoint.isNull())\n    fo->_endpoint->stats(buffer);\n\n  {\n    \/\/ Last connection times.\n    std::ostringstream oss;\n    oss << \"last connection attempt=\" << fo->_last_connect_attempt\n        << \"\\n\" << \"last connection success=\"\n        << fo->_last_connect_success << \"\\n\";\n    buffer.append(oss.str());\n  }\n\n  \/\/ Failover.\n  if (!fo->_failover.isNull() && fo->_failover->isRunning()) {\n    buffer.append(\"failover\\n\");\n    std::string subbuffer;\n    _generate_stats_for_endpoint(\n      fo->_failover.data(),\n      subbuffer,\n      is_out);\n    subbuffer.insert(0, \"  \");\n    size_t pos(subbuffer.find('\\n'));\n    while ((pos != subbuffer.size() - 1)\n           && (pos != std::string::npos)) {\n      subbuffer.replace(pos, 1, \"\\n  \");\n      pos = subbuffer.find('\\n', pos + 3);\n    }\n    buffer.append(subbuffer);\n  }\n\n  return ;\n}\n\n\/**\n *  Open FIFO.\n *\n *  @return true on success.\n *\/\nbool worker::_open() {\n  bool retval;\n  _fd = open(_fifo.c_str(), O_WRONLY | O_NONBLOCK);\n  if (_fd < 0) {\n    if (errno != ENXIO) {\n      char const* msg(strerror(errno));\n      throw (exceptions::msg() << \"cannot open FIFO file: \" << msg);\n    }\n    else\n      retval = false;\n  }\n  else\n    retval = true;\n  return (retval);\n}\n\n\/**\n *  Thread entry point.\n *\/\nvoid worker::run() {\n  try {\n    while (!_should_exit) {\n      \/\/ Check file opening.\n      if (_buffer.empty()) {\n        _close();\n        usleep(100000);\n        if (!_open())\n          continue ;\n      }\n\n      \/\/ FD sets.\n      pollfd fds;\n      fds.fd = _fd;\n      fds.events = POLLOUT;\n      fds.revents = 0;\n\n      \/\/ Multiplexing.\n      int flagged(poll(&fds, 1, 1000));\n\n      \/\/ Error.\n      if (flagged < 0) {\n        \/\/ Unrecoverable.\n        if (errno != EINTR) {\n          char const* msg(strerror(errno));\n          throw (exceptions::msg() << \"multiplexing failure: \" << msg);\n        }\n      }\n      else if (flagged > 0) {\n        \/\/ FD error.\n        if ((fds.revents & (POLLERR | POLLNVAL | POLLHUP)))\n          throw (exceptions::msg() << \"FIFO fd has pending error\");\n        \/\/ Readable.\n        else if ((fds.revents & POLLOUT)) {\n          if (_buffer.empty())\n            \/\/ Generate statistics.\n            _generate_stats();\n\n          \/\/ Write data.\n          ssize_t wb(write(_fd, _buffer.c_str(), _buffer.size()));\n          if (wb > 0)\n            _buffer.erase(0, wb);\n          else\n            _buffer.clear();\n        }\n      }\n    }\n  }\n  catch (std::exception const& e) {\n    logging::error(logging::high)\n      << \"stats: thread will exit due to the following error: \"\n      << e.what();\n  }\n  catch (...) {\n    logging::error(logging::high)\n      << \"stats: thread will exit due to an unknown error\";\n  }\n  ::unlink(_fifo.c_str());\n  return ;\n}\n<commit_msg>stats: print all failovers. This fixes #5091.<commit_after>\/*\n** Copyright 2012-2014 Merethis\n**\n** This file is part of Centreon Broker.\n**\n** Centreon Broker is free software: you can redistribute it and\/or\n** modify it under the terms of the GNU General Public License version 2\n** as published by the Free Software Foundation.\n**\n** Centreon Broker is distributed in the hope that it will be useful,\n** but WITHOUT ANY WARRANTY; without even the implied warranty of\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n** General Public License for more details.\n**\n** You should have received a copy of the GNU General Public License\n** along with Centreon Broker. If not, see\n** <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <cerrno>\n#include <cstdlib>\n#include <cstring>\n#include <fcntl.h>\n#include <iomanip>\n#include <QFileInfo>\n#include <QMutexLocker>\n#include <poll.h>\n#include <sstream>\n#include <time.h>\n#include <unistd.h>\n#include \"com\/centreon\/broker\/config\/applier\/endpoint.hh\"\n#include \"com\/centreon\/broker\/config\/applier\/modules.hh\"\n#include \"com\/centreon\/broker\/exceptions\/msg.hh\"\n#include \"com\/centreon\/broker\/logging\/logging.hh\"\n#include \"com\/centreon\/broker\/stats\/worker.hh\"\n\nusing namespace com::centreon::broker::stats;\n\n\/**************************************\n*                                     *\n*           Public Methods            *\n*                                     *\n**************************************\/\n\n\/**\n *  Default constructor.\n *\/\nworker::worker() : _fd(-1) {}\n\n\/**\n *  Destructor.\n *\/\nworker::~worker() throw () {}\n\n\/**\n *  Set the exit flag.\n *\/\nvoid worker::exit() {\n  _should_exit = true;\n  return ;\n}\n\n\/**\n *  Run the statistics thread.\n *\n *  @param[in] fifo_file Path to the FIFO file.\n *\/\nvoid worker::run(QString const& fifo_file) {\n  \/\/ Close FD.\n  _close();\n\n  \/\/ Set FIFO file.\n  _fifo = fifo_file.toStdString();\n\n  \/\/ Set exit flag.\n  _should_exit = false;\n\n  \/\/ Launch thread.\n  start();\n\n  return ;\n}\n\n\/**************************************\n*                                     *\n*           Private Methods           *\n*                                     *\n**************************************\/\n\n\/**\n *  Close FIFO fd.\n *\/\nvoid worker::_close() {\n  if (_fd >= 0) {\n    close(_fd);\n    _fd = -1;\n  }\n  return ;\n}\n\n\/**\n *  Generate statistics.\n *\/\nvoid worker::_generate_stats() {\n  \/\/ General.\n  {\n    std::ostringstream oss;\n    oss << \"broker\\n\"\n      \"version=\" CENTREON_BROKER_VERSION \"\\n\"\n      \"pid=\" << getpid() << \"\\n\"\n      \"now=\" << time(NULL) << \"\\n\"\n      \"compiled with qt=\" << QT_VERSION_STR << \"\\n\"\n      \"running with qt=\" << qVersion() << \"\\n\"\n      \"\\n\";\n    _buffer.append(oss.str());\n  }\n\n  \/\/ Modules.\n  config::applier::modules&\n    mod_applier(config::applier::modules::instance());\n  for (config::applier::modules::iterator\n         it(mod_applier.begin()),\n         end(mod_applier.end());\n       it != end;\n       ++it) {\n    std::ostringstream oss;\n    QFileInfo fi(it.key());\n    oss << \"module \" << it.key().toStdString() << \"\\n\"\n      \"state=loaded\\n\"\n      \"size=\" << fi.size() << \"B\\n\"\n      \"\\n\";\n    _buffer.append(oss.str());\n  }\n\n  \/\/ Endpoint applier.\n  config::applier::endpoint&\n    endp_applier(config::applier::endpoint::instance());\n\n  \/\/ Print input endpoints.\n  {\n    bool locked(endp_applier.input_mutex().tryLock(100));\n    try {\n      if (locked)\n        for (config::applier::endpoint::iterator\n               it = endp_applier.input_begin(),\n               end = endp_applier.input_end();\n             it != end;\n             ++it) {\n          _generate_stats_for_endpoint(*it, _buffer, false);\n          _buffer.append(\"\\n\");\n        }\n      else\n        _buffer.append(\n          \"inputs=could not fetch list, configuration update in progress ?\\n\");\n    }\n    catch (...) {\n      if (locked)\n        endp_applier.input_mutex().unlock();\n      throw ;\n    }\n    if (locked)\n      endp_applier.input_mutex().unlock();\n  }\n\n  \/\/ Print output endpoints.\n  {\n    bool locked(endp_applier.output_mutex().tryLock(100));\n    try {\n      if (locked)\n        for (config::applier::endpoint::iterator\n               it(endp_applier.output_begin()),\n               end(endp_applier.output_end());\n             it != end;\n             ++it) {\n          _generate_stats_for_endpoint(*it, _buffer, true);\n          _buffer.append(\"\\n\");\n        }\n      else\n        _buffer.append(\n          \"outputs=could not fetch list, configuration update in progress ?\\n\");\n    }\n    catch (...) {\n      if (locked)\n        endp_applier.output_mutex().unlock();\n      throw ;\n    }\n    if (locked)\n      endp_applier.output_mutex().unlock();\n  }\n\n  return ;\n}\n\n\/**\n *  Generate statistics for an endpoint.\n *\n *  @param[in]  fo     Failover thread of the endpoint.\n *  @param[out] buffer Buffer in which data will be printed.\n *  @param[in]  is_out true if fo manage an output endpoint.\n *\/\nvoid worker::_generate_stats_for_endpoint(\n               processing::failover* fo,\n               std::string& buffer,\n               bool is_out) {\n  \/\/ Header.\n  buffer.append(is_out ? \"output \" : \"input \");\n  buffer.append(fo->_name.toStdString());\n  buffer.append(\"\\n\");\n\n  \/\/ Choose stream we will work on.\n  QReadWriteLock* first_rwl;\n  misc::shared_ptr<io::stream>* first_s;\n  QReadWriteLock* second_rwl;\n  misc::shared_ptr<io::stream>* second_s;\n  if (is_out) {\n    first_rwl = &fo->_tom;\n    first_s = &fo->_to;\n    second_rwl = &fo->_fromm;\n    second_s = &fo->_from;\n  }\n  else {\n    first_rwl = &fo->_fromm;\n    first_s = &fo->_from;\n    second_rwl = &fo->_tom;\n    second_s = &fo->_to;\n  }\n\n  \/\/ Should we generate more stats ?\n  bool more_stats(true);\n  {\n    \/\/ Get primary state.\n    buffer.append(\"state=\");\n    bool locked(first_rwl->tryLockForRead(10));\n    try {\n      \/\/ Could lock RWL.\n      if (locked) {\n        if (first_s->isNull()) {\n          if (!fo->_last_error.isEmpty()) {\n            buffer.append(\"disconnected\");\n            buffer.append(\" (\");\n            buffer.append(fo->_last_error.toStdString());\n            buffer.append(\")\\n\");\n          }\n          else if (!fo->isRunning()) {\n            buffer.append(\"unused\\n\");\n            more_stats = false;\n          }\n          else if (!fo->_endpoint.isNull()\n                   && !fo->_endpoint->is_acceptor()) {\n            buffer.append(\"connecting\\n\");\n          }\n          else {\n            buffer.append(\"listening\\n\");\n          }\n        }\n        else if (!fo->_failover.isNull() && fo->_failover->isRunning()) {\n          buffer.append(\"replaying\\n\");\n          (*first_s)->statistics(buffer);\n        }\n        else {\n          buffer.append(\"connected\\n\");\n          (*first_s)->statistics(buffer);\n        }\n      }\n      \/\/ Could not lock RWL.\n      else\n        buffer.append(\"blocked\\n\");\n    }\n    catch (...) {\n      if (locked)\n        first_rwl->unlock();\n      throw ;\n    }\n    if (locked)\n      first_rwl->unlock();\n  }\n\n  \/\/ More statistics.\n  if (more_stats) {\n    {\n      \/\/ Get secondary state.\n      QReadLocker rl(second_rwl);\n      if (!second_s->isNull())\n        (*second_s)->statistics(buffer);\n    }\n\n    {\n      \/\/ Event processing stats.\n      std::ostringstream oss;\n      oss << \"last event at=\" << fo->get_last_event() << \"\\n\"\n        \"event processing speed=\" << std::fixed\n          << std::setprecision(1) << fo->get_event_processing_speed()\n          << \" events\/s\\n\";\n      buffer.append(oss.str());\n    }\n\n    \/\/ Endpoint stats.\n    if (!fo->_endpoint.isNull())\n      fo->_endpoint->stats(buffer);\n\n    {\n      \/\/ Last connection times.\n      std::ostringstream oss;\n      oss << \"last connection attempt=\" << fo->_last_connect_attempt\n          << \"\\n\" << \"last connection success=\"\n          << fo->_last_connect_success << \"\\n\";\n      buffer.append(oss.str());\n    }\n  }\n\n  \/\/ Failover.\n  if (!fo->_failover.isNull()) {\n    buffer.append(\"failover\\n\");\n    std::string subbuffer;\n    _generate_stats_for_endpoint(\n      fo->_failover.data(),\n      subbuffer,\n      is_out);\n    subbuffer.insert(0, \"  \");\n    size_t pos(subbuffer.find('\\n'));\n    while ((pos != subbuffer.size() - 1)\n           && (pos != std::string::npos)) {\n      subbuffer.replace(pos, 1, \"\\n  \");\n      pos = subbuffer.find('\\n', pos + 3);\n    }\n    buffer.append(subbuffer);\n  }\n\n  return ;\n}\n\n\/**\n *  Open FIFO.\n *\n *  @return true on success.\n *\/\nbool worker::_open() {\n  bool retval;\n  _fd = open(_fifo.c_str(), O_WRONLY | O_NONBLOCK);\n  if (_fd < 0) {\n    if (errno != ENXIO) {\n      char const* msg(strerror(errno));\n      throw (exceptions::msg() << \"cannot open FIFO file: \" << msg);\n    }\n    else\n      retval = false;\n  }\n  else\n    retval = true;\n  return (retval);\n}\n\n\/**\n *  Thread entry point.\n *\/\nvoid worker::run() {\n  try {\n    while (!_should_exit) {\n      \/\/ Check file opening.\n      if (_buffer.empty()) {\n        _close();\n        usleep(100000);\n        if (!_open())\n          continue ;\n      }\n\n      \/\/ FD sets.\n      pollfd fds;\n      fds.fd = _fd;\n      fds.events = POLLOUT;\n      fds.revents = 0;\n\n      \/\/ Multiplexing.\n      int flagged(poll(&fds, 1, 1000));\n\n      \/\/ Error.\n      if (flagged < 0) {\n        \/\/ Unrecoverable.\n        if (errno != EINTR) {\n          char const* msg(strerror(errno));\n          throw (exceptions::msg() << \"multiplexing failure: \" << msg);\n        }\n      }\n      else if (flagged > 0) {\n        \/\/ FD error.\n        if ((fds.revents & (POLLERR | POLLNVAL | POLLHUP)))\n          throw (exceptions::msg() << \"FIFO fd has pending error\");\n        \/\/ Readable.\n        else if ((fds.revents & POLLOUT)) {\n          if (_buffer.empty())\n            \/\/ Generate statistics.\n            _generate_stats();\n\n          \/\/ Write data.\n          ssize_t wb(write(_fd, _buffer.c_str(), _buffer.size()));\n          if (wb > 0)\n            _buffer.erase(0, wb);\n          else\n            _buffer.clear();\n        }\n      }\n    }\n  }\n  catch (std::exception const& e) {\n    logging::error(logging::high)\n      << \"stats: thread will exit due to the following error: \"\n      << e.what();\n  }\n  catch (...) {\n    logging::error(logging::high)\n      << \"stats: thread will exit due to an unknown error\";\n  }\n  ::unlink(_fifo.c_str());\n  return ;\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\/chromeos\/extensions\/bluetooth_event_router.h\"\n\n#include <map>\n\n#include \"base\/json\/json_writer.h\"\n#include \"base\/memory\/ref_counted.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/chromeos\/bluetooth\/bluetooth_adapter.h\"\n#include \"chrome\/browser\/chromeos\/bluetooth\/bluetooth_device.h\"\n#include \"chrome\/browser\/chromeos\/bluetooth\/bluetooth_socket.h\"\n#include \"chrome\/browser\/extensions\/api\/bluetooth\/bluetooth_api_utils.h\"\n#include \"chrome\/browser\/extensions\/event_names.h\"\n#include \"chrome\/browser\/extensions\/event_router.h\"\n#include \"chrome\/common\/extensions\/api\/experimental_bluetooth.h\"\n\nnamespace chromeos {\n\nExtensionBluetoothEventRouter::ExtensionBluetoothEventRouter(Profile* profile)\n    : profile_(profile),\n      adapter_(chromeos::BluetoothAdapter::DefaultAdapter()),\n      next_socket_id_(1) {\n  DCHECK(profile_);\n  DCHECK(adapter_.get());\n  adapter_->AddObserver(this);\n}\n\nExtensionBluetoothEventRouter::~ExtensionBluetoothEventRouter() {\n  adapter_->RemoveObserver(this);\n  socket_map_.clear();\n}\n\nint ExtensionBluetoothEventRouter::RegisterSocket(\n    scoped_refptr<BluetoothSocket> socket) {\n  \/\/ If there is a socket registered with the same fd, just return it's id\n  for (SocketMap::const_iterator i = socket_map_.begin();\n      i != socket_map_.end(); ++i) {\n    if (i->second->fd() == socket->fd()) {\n      return i->first;\n    }\n  }\n  int return_id = next_socket_id_++;\n  socket_map_[return_id] = socket;\n  return return_id;\n}\n\nbool ExtensionBluetoothEventRouter::ReleaseSocket(int id) {\n  SocketMap::iterator socket_entry = socket_map_.find(id);\n  if (socket_entry == socket_map_.end())\n    return false;\n  socket_map_.erase(socket_entry);\n  return true;\n}\n\nscoped_refptr<BluetoothSocket> ExtensionBluetoothEventRouter::GetSocket(\n    int id) {\n  SocketMap::iterator socket_entry = socket_map_.find(id);\n  if (socket_entry == socket_map_.end())\n    return NULL;\n  return socket_entry->second;\n}\n\nvoid ExtensionBluetoothEventRouter::SetSendDiscoveryEvents(bool should_send) {\n  send_discovery_events_ = should_send;\n}\n\nvoid ExtensionBluetoothEventRouter::AdapterPresentChanged(\n    chromeos::BluetoothAdapter* adapter, bool present) {\n  DCHECK(adapter == adapter_.get());\n  DispatchBooleanValueEvent(\n      extensions::event_names::kBluetoothOnAvailabilityChanged,\n      present);\n}\n\nvoid ExtensionBluetoothEventRouter::AdapterPoweredChanged(\n    chromeos::BluetoothAdapter* adapter, bool has_power) {\n  DCHECK(adapter == adapter_.get());\n  DispatchBooleanValueEvent(\n      extensions::event_names::kBluetoothOnPowerChanged,\n      has_power);\n}\n\nvoid ExtensionBluetoothEventRouter::AdapterDiscoveringChanged(\n    chromeos::BluetoothAdapter* adapter, bool discovering) {\n  DCHECK(adapter == adapter_.get());\n  DispatchBooleanValueEvent(\n      extensions::event_names::kBluetoothOnDiscoveringChanged,\n      discovering);\n}\n\nvoid ExtensionBluetoothEventRouter::DeviceAdded(\n    chromeos::BluetoothAdapter* adapter, chromeos::BluetoothDevice* device) {\n  if (!send_discovery_events_)\n    return;\n\n  DCHECK(adapter == adapter_.get());\n\n  extensions::api::experimental_bluetooth::Device extension_device;\n  extensions::api::experimental_bluetooth::BluetoothDeviceToApiDevice(\n      *device, &extension_device);\n\n  ListValue args;\n  args.Append(extension_device.ToValue().release());\n  std::string json_args;\n  base::JSONWriter::Write(&args, &json_args);\n\n  profile_->GetExtensionEventRouter()->DispatchEventToRenderers(\n      extensions::event_names::kBluetoothOnDeviceDiscovered,\n      json_args,\n      NULL,\n      GURL());\n}\n\nvoid ExtensionBluetoothEventRouter::DispatchBooleanValueEvent(\n    const char* event_name, bool value) {\n  ListValue args;\n  args.Append(Value::CreateBooleanValue(value));\n  std::string json_args;\n  base::JSONWriter::Write(&args, &json_args);\n\n  \/\/ TODO(bryeung): only dispatch the event to interested renderers\n  \/\/ crbug.com\/133179\n  profile_->GetExtensionEventRouter()->DispatchEventToRenderers(\n      event_name, json_args, NULL, GURL());\n}\n\n}  \/\/ namespace chromeos\n<commit_msg>BluetoothAPI: ignore events for other adapters<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\/extensions\/bluetooth_event_router.h\"\n\n#include <map>\n\n#include \"base\/json\/json_writer.h\"\n#include \"base\/memory\/ref_counted.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/chromeos\/bluetooth\/bluetooth_adapter.h\"\n#include \"chrome\/browser\/chromeos\/bluetooth\/bluetooth_device.h\"\n#include \"chrome\/browser\/chromeos\/bluetooth\/bluetooth_socket.h\"\n#include \"chrome\/browser\/extensions\/api\/bluetooth\/bluetooth_api_utils.h\"\n#include \"chrome\/browser\/extensions\/event_names.h\"\n#include \"chrome\/browser\/extensions\/event_router.h\"\n#include \"chrome\/common\/extensions\/api\/experimental_bluetooth.h\"\n\nnamespace chromeos {\n\nExtensionBluetoothEventRouter::ExtensionBluetoothEventRouter(Profile* profile)\n    : profile_(profile),\n      adapter_(chromeos::BluetoothAdapter::DefaultAdapter()),\n      next_socket_id_(1) {\n  DCHECK(profile_);\n  DCHECK(adapter_.get());\n  adapter_->AddObserver(this);\n}\n\nExtensionBluetoothEventRouter::~ExtensionBluetoothEventRouter() {\n  adapter_->RemoveObserver(this);\n  socket_map_.clear();\n}\n\nint ExtensionBluetoothEventRouter::RegisterSocket(\n    scoped_refptr<BluetoothSocket> socket) {\n  \/\/ If there is a socket registered with the same fd, just return it's id\n  for (SocketMap::const_iterator i = socket_map_.begin();\n      i != socket_map_.end(); ++i) {\n    if (i->second->fd() == socket->fd()) {\n      return i->first;\n    }\n  }\n  int return_id = next_socket_id_++;\n  socket_map_[return_id] = socket;\n  return return_id;\n}\n\nbool ExtensionBluetoothEventRouter::ReleaseSocket(int id) {\n  SocketMap::iterator socket_entry = socket_map_.find(id);\n  if (socket_entry == socket_map_.end())\n    return false;\n  socket_map_.erase(socket_entry);\n  return true;\n}\n\nscoped_refptr<BluetoothSocket> ExtensionBluetoothEventRouter::GetSocket(\n    int id) {\n  SocketMap::iterator socket_entry = socket_map_.find(id);\n  if (socket_entry == socket_map_.end())\n    return NULL;\n  return socket_entry->second;\n}\n\nvoid ExtensionBluetoothEventRouter::SetSendDiscoveryEvents(bool should_send) {\n  send_discovery_events_ = should_send;\n}\n\nvoid ExtensionBluetoothEventRouter::AdapterPresentChanged(\n    chromeos::BluetoothAdapter* adapter, bool present) {\n  if (adapter != adapter_.get()) {\n    DVLOG(1) << \"Ignoring event for adapter \" << adapter->address();\n    return;\n  }\n\n  DispatchBooleanValueEvent(\n      extensions::event_names::kBluetoothOnAvailabilityChanged,\n      present);\n}\n\nvoid ExtensionBluetoothEventRouter::AdapterPoweredChanged(\n    chromeos::BluetoothAdapter* adapter, bool has_power) {\n  if (adapter != adapter_.get()) {\n    DVLOG(1) << \"Ignoring event for adapter \" << adapter->address();\n    return;\n  }\n\n  DispatchBooleanValueEvent(\n      extensions::event_names::kBluetoothOnPowerChanged,\n      has_power);\n}\n\nvoid ExtensionBluetoothEventRouter::AdapterDiscoveringChanged(\n    chromeos::BluetoothAdapter* adapter, bool discovering) {\n  if (adapter != adapter_.get()) {\n    DVLOG(1) << \"Ignoring event for adapter \" << adapter->address();\n    return;\n  }\n\n  DispatchBooleanValueEvent(\n      extensions::event_names::kBluetoothOnDiscoveringChanged,\n      discovering);\n}\n\nvoid ExtensionBluetoothEventRouter::DeviceAdded(\n    chromeos::BluetoothAdapter* adapter, chromeos::BluetoothDevice* device) {\n  if (!send_discovery_events_)\n    return;\n\n  DCHECK(adapter == adapter_.get());\n\n  extensions::api::experimental_bluetooth::Device extension_device;\n  extensions::api::experimental_bluetooth::BluetoothDeviceToApiDevice(\n      *device, &extension_device);\n\n  ListValue args;\n  args.Append(extension_device.ToValue().release());\n  std::string json_args;\n  base::JSONWriter::Write(&args, &json_args);\n\n  profile_->GetExtensionEventRouter()->DispatchEventToRenderers(\n      extensions::event_names::kBluetoothOnDeviceDiscovered,\n      json_args,\n      NULL,\n      GURL());\n}\n\nvoid ExtensionBluetoothEventRouter::DispatchBooleanValueEvent(\n    const char* event_name, bool value) {\n  ListValue args;\n  args.Append(Value::CreateBooleanValue(value));\n  std::string json_args;\n  base::JSONWriter::Write(&args, &json_args);\n\n  \/\/ TODO(bryeung): only dispatch the event to interested renderers\n  \/\/ crbug.com\/133179\n  profile_->GetExtensionEventRouter()->DispatchEventToRenderers(\n      event_name, json_args, NULL, GURL());\n}\n\n}  \/\/ namespace chromeos\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"webkit\/plugins\/ppapi\/ppb_flash_impl.h\"\n\n#include <string>\n\n#include \"base\/message_loop.h\"\n#include \"base\/time.h\"\n#include \"googleurl\/src\/gurl.h\"\n#include \"ppapi\/c\/private\/ppb_flash.h\"\n#include \"webkit\/plugins\/ppapi\/common.h\"\n#include \"webkit\/plugins\/ppapi\/plugin_delegate.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_tracker.h\"\n#include \"webkit\/plugins\/ppapi\/var.h\"\n\nnamespace webkit {\nnamespace ppapi {\n\nnamespace {\n\nvoid SetInstanceAlwaysOnTop(PP_Instance pp_instance, PP_Bool on_top) {\n  PluginInstance* instance = ResourceTracker::Get()->GetInstance(pp_instance);\n  if (!instance)\n    return;\n  instance->set_always_on_top(PPBoolToBool(on_top));\n}\n\nPP_Var GetProxyForURL(PP_Instance pp_instance, const char* url) {\n  PluginInstance* instance = ResourceTracker::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(instance->module(), proxy_host);\n}\n\nint32_t Navigate(PP_Resource request_id,\n                 const char* target,\n                 bool from_user_action) {\n  scoped_refptr<PPB_URLRequestInfo_Impl> request(\n      Resource::GetAs<PPB_URLRequestInfo_Impl>(request_id));\n  if (!request)\n    return PP_ERROR_BADRESOURCE;\n\n  if (!target)\n    return PP_ERROR_BADARGUMENT;\n\n  PluginInstance* instance = request->instance();\n  if (!instance)\n    return PP_ERROR_FAILED;\n\n  return instance->Navigate(request, target, 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 = ResourceTracker::Get()->GetInstance(pp_instance);\n  if (!instance)\n    return 0.0;\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(\n      base::Time::FromDoubleT(t));\n}\n\nconst PPB_Flash ppb_flash = {\n  &SetInstanceAlwaysOnTop,\n  &PPB_Flash_Impl::DrawGlyphs,\n  &GetProxyForURL,\n  &Navigate,\n  &RunMessageLoop,\n  &QuitMessageLoop,\n  &GetLocalTimeZoneOffset\n};\n\n}  \/\/ namespace\n\n\/\/ static\nconst PPB_Flash* PPB_Flash_Impl::GetInterface() {\n  return &ppb_flash;\n}\n\n}  \/\/ namespace ppapi\n}  \/\/ namespace webkit\n<commit_msg>Work around the special-case handling of 0 time values (see comment).<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\n#include \"base\/message_loop.h\"\n#include \"base\/time.h\"\n#include \"googleurl\/src\/gurl.h\"\n#include \"ppapi\/c\/private\/ppb_flash.h\"\n#include \"webkit\/plugins\/ppapi\/common.h\"\n#include \"webkit\/plugins\/ppapi\/plugin_delegate.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_tracker.h\"\n#include \"webkit\/plugins\/ppapi\/var.h\"\n\nnamespace webkit {\nnamespace ppapi {\n\nnamespace {\n\nvoid SetInstanceAlwaysOnTop(PP_Instance pp_instance, PP_Bool on_top) {\n  PluginInstance* instance = ResourceTracker::Get()->GetInstance(pp_instance);\n  if (!instance)\n    return;\n  instance->set_always_on_top(PPBoolToBool(on_top));\n}\n\nPP_Var GetProxyForURL(PP_Instance pp_instance, const char* url) {\n  PluginInstance* instance = ResourceTracker::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(instance->module(), proxy_host);\n}\n\nint32_t Navigate(PP_Resource request_id,\n                 const char* target,\n                 bool from_user_action) {\n  scoped_refptr<PPB_URLRequestInfo_Impl> request(\n      Resource::GetAs<PPB_URLRequestInfo_Impl>(request_id));\n  if (!request)\n    return PP_ERROR_BADRESOURCE;\n\n  if (!target)\n    return PP_ERROR_BADARGUMENT;\n\n  PluginInstance* instance = request->instance();\n  if (!instance)\n    return PP_ERROR_FAILED;\n\n  return instance->Navigate(request, target, 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 = ResourceTracker::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(\n      base::Time::FromDoubleT(t));\n}\n\nconst PPB_Flash ppb_flash = {\n  &SetInstanceAlwaysOnTop,\n  &PPB_Flash_Impl::DrawGlyphs,\n  &GetProxyForURL,\n  &Navigate,\n  &RunMessageLoop,\n  &QuitMessageLoop,\n  &GetLocalTimeZoneOffset\n};\n\n}  \/\/ namespace\n\n\/\/ static\nconst PPB_Flash* PPB_Flash_Impl::GetInterface() {\n  return &ppb_flash;\n}\n\n}  \/\/ namespace ppapi\n}  \/\/ namespace webkit\n<|endoftext|>"}
{"text":"<commit_before>\n\n\/\/ Test Macro, shows how to load Digits and Geometry, and how can we get \n\/\/ some of the parameters and variables.\n\/\/ Author: Gustavo Conesa\n\nvoid TestEMCALDigit()\n{\n   \n  \/\/ Getting EMCAL Detector and Geometry.\n  \n  AliRunLoader *rl = AliRunLoader::Open(\"galice.root\",AliConfig::GetDefaultEventFolderName(),\n\t\t\t  \"read\");\n \n  if (rl == 0x0)\n      cout<<\"Can not instatiate the Run Loader\"<<endl;\n\n  rl->LoadgAlice();\/\/Needed to get geometry\n\n  AliEMCALLoader *emcalLoader = dynamic_cast<AliEMCALLoader*>\n    (rl->GetDetectorLoader(\"EMCAL\"));\n\n  \/\/AliEMCALGeometry * geom = AliEMCALGeometry::GetInstance();\n  \/\/AliEMCALGeometry *geom = dynamic_cast<AliEMCAL*>(rl->GetAliRun()->GetDetector(\"EMCAL\"))->GetGeometry();\n\n  AliRun * alirun   = rl->GetAliRun(); \/\/ Needed to get Geometry\n  AliEMCAL * emcal  = (AliEMCAL*)alirun->GetDetector(\"EMCAL\");\n  AliEMCALGeometry * geom = emcal->GetGeometry();\n  \n  if (geom==0)\n    cout<<\"Did not get geometry from EMCALLoader\"<<endl;\n\n  \/\/Load Digits\n  rl->LoadDigits(\"EMCAL\");\n\n  \/\/Get maximum number of events\n  Int_t maxevent =  rl->GetNumberOfEvents();\n  cout<<\"Number of events \"<<maxevent<<endl;\n  \/\/maxevent = 1 ;\n\n  Int_t iEvent  = -1 ;\n  Float_t amp   = -1 ;\n  Float_t time  = -1 ;\n  Int_t id      = -1 ;\n  Int_t iSupMod =  0 ;\n  Int_t iTower  =  0 ;\n  Int_t iIphi   =  0 ;\n  Int_t iIeta   =  0 ;\n  Int_t iphi    =  0 ;\n  Int_t ieta    =  0 ;\n\n\n  AliEMCALDigit * dig;\n  \n  for ( iEvent=0; iEvent<maxevent; iEvent++)\n    {\n      cout <<  \" ======> Event \" << iEvent << endl ;\n      \/\/Load Event\n      rl->GetEvent(iEvent);\n\n      \/\/Fill array of digits\n      TClonesArray *digits = emcalLoader->Digits();\t\n\n      \/\/Get digits from the list      \n      for(Int_t idig = 0; idig< digits->GetEntries();idig++){\n\t\/\/cout<<\">> idig \"<<idig<<endl;\n\tdig = static_cast<AliEMCALDigit *>(digits->At(idig)) ;\n\n\tif(dig != 0){\n\t  id   = dig->GetId() ; \/\/cell (digit) label\n\t  amp  = dig->GetAmp(); \/\/amplitude in cell (digit)\n\t  time = dig->GetTime();\/\/time of creation of digit after collision\n\n\t  cout<<\"Cell ID \"<<id<<\" Amp \"<<amp<<endl;\/\/\" time \"<<time<<endl;\n\n\t  \/\/Geometry methods  \n \t  geom->GetCellIndex(id,iSupMod,iTower,iIphi,iIeta); \n\t  \/\/Gives SuperModule and Tower numbers\n \t  geom->GetCellPhiEtaIndexInSModule(iSupMod,iTower,\n\t\t\t\t\t    iIphi, iIeta,iphi,ieta);\n\t  \/\/Gives label of cell in eta-phi position per each supermodule\n\n\t  cout<< \"SModule \"<<iSupMod<<\"; Tower \"<<iTower\n\t      <<\"; Eta \"<<iIeta<<\"; Phi \"<<iIphi\n \t      <<\"; Cell Eta \"<<ieta<<\"; Cell Phi \"<<iphi<<endl;\n\t}\n\telse\n\t  cout<<\"Digit pointer 0x0\"<<endl;\n      }\n      \n    }\n}\n\n<commit_msg>add geometry import<commit_after>\n\n\/\/ Test Macro, shows how to load Digits and Geometry, and how can we get \n\/\/ some of the parameters and variables.\n\/\/ Author: Gustavo Conesa\n\nvoid TestEMCALDigit()\n{\n   \n  \/\/ Getting EMCAL Detector and Geometry.\n  \n  AliRunLoader *rl = AliRunLoader::Open(\"galice.root\",AliConfig::GetDefaultEventFolderName(),\n\t\t\t  \"read\");\n \n  if (rl == 0x0)\n      cout<<\"Can not instatiate the Run Loader\"<<endl;\n\n  rl->LoadgAlice();\/\/Needed to get geometry\n\n  AliEMCALLoader *emcalLoader = dynamic_cast<AliEMCALLoader*>\n    (rl->GetDetectorLoader(\"EMCAL\"));\n\n  \/\/AliEMCALGeometry * geom = AliEMCALGeometry::GetInstance();\n  \/\/AliEMCALGeometry *geom = dynamic_cast<AliEMCAL*>(rl->GetAliRun()->GetDetector(\"EMCAL\"))->GetGeometry();\n  TGeoManager::Import(\"geometry.root\");\n\n  AliRun * alirun   = rl->GetAliRun(); \/\/ Needed to get Geometry\n  AliEMCAL * emcal  = (AliEMCAL*)alirun->GetDetector(\"EMCAL\");\n  AliEMCALGeometry * geom = emcal->GetGeometry();\n  \n  if (geom==0)\n    cout<<\"Did not get geometry from EMCALLoader\"<<endl;\n\n  \/\/  geom->PrintGeometry();\n\n  \/\/Load Digits\n  rl->LoadDigits(\"EMCAL\");\n\n  \/\/Get maximum number of events\n  Int_t maxevent =  rl->GetNumberOfEvents();\n  cout<<\"Number of events \"<<maxevent<<endl;\n  \/\/maxevent = 1 ;\n\n  Int_t iEvent  = -1 ;\n  Float_t amp   = -1 ;\n  Float_t time  = -1 ;\n  Int_t id      = -1 ;\n  Int_t iSupMod =  0 ;\n  Int_t iTower  =  0 ;\n  Int_t iIphi   =  0 ;\n  Int_t iIeta   =  0 ;\n  Int_t iphi    =  0 ;\n  Int_t ieta    =  0 ;\n\n\n  AliEMCALDigit * dig;\n  \n  for ( iEvent=0; iEvent<maxevent; iEvent++)\n    {\n      cout <<  \" ======> Event \" << iEvent << endl ;\n      \/\/Load Event\n      rl->GetEvent(iEvent);\n\n      \/\/Fill array of digits\n      TClonesArray *digits = emcalLoader->Digits();\t\n\n      \/\/Get digits from the list      \n      for(Int_t idig = 0; idig< digits->GetEntries();idig++){\n\t\/\/cout<<\">> idig \"<<idig<<endl;\n\tdig = static_cast<AliEMCALDigit *>(digits->At(idig)) ;\n\n\tif(dig != 0){\n\t  id   = dig->GetId() ; \/\/cell (digit) label\n\t  amp  = dig->GetAmp(); \/\/amplitude in cell (digit)\n\t  time = dig->GetTime();\/\/time of creation of digit after collision\n\n\t  cout<<\"Cell ID \"<<id<<\" Amp \"<<amp<<endl;\/\/\" time \"<<time<<endl;\n\n\t  \/\/Geometry methods  \n \t  geom->GetCellIndex(id,iSupMod,iTower,iIphi,iIeta); \n\t  \/\/Gives SuperModule and Tower numbers\n \t  geom->GetCellPhiEtaIndexInSModule(iSupMod,iTower,\n\t\t\t\t\t    iIphi, iIeta,iphi,ieta);\n\t  \/\/Gives label of cell in eta-phi position per each supermodule\n\n\t  cout<< \"SModule \"<<iSupMod<<\"; Tower \"<<iTower\n\t      <<\"; Eta \"<<iIeta<<\"; Phi \"<<iIphi\n \t      <<\"; Cell Eta \"<<ieta<<\"; Cell Phi \"<<iphi<<endl;\n\t}\n\telse\n\t  cout<<\"Digit pointer 0x0\"<<endl;\n      }\n      \n    }\n\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/===--- CppCoreGuidelinesModule.cpp - clang-tidy -------------------------===\/\/\n\/\/\n\/\/                     The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"..\/ClangTidy.h\"\n#include \"..\/ClangTidyModule.h\"\n#include \"..\/ClangTidyModuleRegistry.h\"\n#include \"ProTypeConstCastCheck.h\"\n#include \"ProTypeReinterpretCastCheck.h\"\n\nnamespace clang {\nnamespace tidy {\nnamespace cppcoreguidelines {\n\nclass CppCoreGuidelinesModule : public ClangTidyModule {\npublic:\n  void addCheckFactories(ClangTidyCheckFactories &CheckFactories) override {\n    CheckFactories.registerCheck<ProTypeConstCastCheck>(\n        \"cppcoreguidelines-pro-type-const-cast\");\n    CheckFactories.registerCheck<ProTypeReinterpretCastCheck>(\n        \"cppcoreguidelines-pro-type-reinterpret-cast\");\n  }\n};\n\n\/\/ Register the LLVMTidyModule using this statically initialized variable.\nstatic ClangTidyModuleRegistry::Add<CppCoreGuidelinesModule>\n    X(\"cppcoreguidelines-module\", \"Adds checks for the C++ Core Guidelines.\");\n\n} \/\/ namespace cppcoreguidelines\n\n\/\/ This anchor is used to force the linker to link in the generated object file\n\/\/ and thus register the CppCoreGuidelinesModule.\nvolatile int CppCoreGuidelinesModuleAnchorSource = 0;\n\n} \/\/ namespace tidy\n} \/\/ namespace clang\n<commit_msg>Test commit<commit_after>\/\/===--- CppCoreGuidelinesModule.cpp - clang-tidy -------------------------===\/\/\n\/\/\n\/\/                     The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"..\/ClangTidy.h\"\n#include \"..\/ClangTidyModule.h\"\n#include \"..\/ClangTidyModuleRegistry.h\"\n#include \"ProTypeConstCastCheck.h\"\n#include \"ProTypeReinterpretCastCheck.h\"\n\nnamespace clang {\nnamespace tidy {\nnamespace cppcoreguidelines {\n\n\/\/\/ A module containing checks of the C++ Core Guidelines\nclass CppCoreGuidelinesModule : public ClangTidyModule {\npublic:\n  void addCheckFactories(ClangTidyCheckFactories &CheckFactories) override {\n    CheckFactories.registerCheck<ProTypeConstCastCheck>(\n        \"cppcoreguidelines-pro-type-const-cast\");\n    CheckFactories.registerCheck<ProTypeReinterpretCastCheck>(\n        \"cppcoreguidelines-pro-type-reinterpret-cast\");\n  }\n};\n\n\/\/ Register the LLVMTidyModule using this statically initialized variable.\nstatic ClangTidyModuleRegistry::Add<CppCoreGuidelinesModule>\n    X(\"cppcoreguidelines-module\", \"Adds checks for the C++ Core Guidelines.\");\n\n} \/\/ namespace cppcoreguidelines\n\n\/\/ This anchor is used to force the linker to link in the generated object file\n\/\/ and thus register the CppCoreGuidelinesModule.\nvolatile int CppCoreGuidelinesModuleAnchorSource = 0;\n\n} \/\/ namespace tidy\n} \/\/ namespace clang\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright (c) 2018 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 <memory>\n\n#include \"paddle\/fluid\/operators\/concat_op.h\"\n#include \"paddle\/fluid\/operators\/utils.h\"\n#include \"paddle\/fluid\/platform\/mkldnn_helper.h\"\n#include \"paddle\/fluid\/platform\/mkldnn_reuse.h\"\n\nnamespace paddle {\nnamespace operators {\n\nusing dnnl::concat;\nusing dnnl::memory;\nusing dnnl::primitive;\nusing dnnl::stream;\nusing framework::DataLayout;\nusing framework::LoDTensor;\nusing framework::Tensor;\nusing platform::to_void_cast;\n\ntemplate <typename T>\nclass ConcatMKLDNNHandler\n    : public platform::MKLDNNHandlerNoCachingT<T, dnnl::concat> {\n public:\n  ConcatMKLDNNHandler(const framework::ExecutionContext& ctx,\n                      const dnnl::engine mkldnn_engine,\n                      const std::vector<const Tensor*>& inputs,\n                      Tensor* output)\n      : platform::MKLDNNHandlerNoCachingT<T, dnnl::concat>(mkldnn_engine,\n                                                           ctx.GetPlace()) {\n    int concat_axis = ctx.Attr<int>(\"axis\");\n    const int rank = inputs[0]->dims().size();\n    PADDLE_ENFORCE_EQ(\n        concat_axis >= -rank && concat_axis < rank,\n        true,\n        platform::errors::InvalidArgument(\n            \"The axis is expected to be in range of [%d, %d), but got %d\",\n            -rank,\n            rank,\n            concat_axis));\n\n    if (ctx.HasInput(\"AxisTensor\")) {\n      auto* axis_tensor = ctx.Input<Tensor>(\"AxisTensor\");\n      concat_axis = GetDataFromTensor(axis_tensor)[0];\n      auto out_dims = inputs[0]->dims();\n      for (size_t i = 1; i < inputs.size(); ++i) {\n        out_dims[concat_axis] += inputs[i]->dims()[concat_axis];\n      }\n      output->Resize(out_dims);\n    }\n\n    if (concat_axis < 0) {\n      concat_axis = concat_axis + rank;\n    }\n\n    memory::data_type dt = framework::ToMKLDNNDataType(\n        framework::TransToProtoVarType(inputs[0]->dtype()));\n    std::vector<memory::desc> srcs_md;\n    srcs_md.reserve(inputs.size());\n\n    \/\/ Create memory descriptors for each of inputs\n    for (size_t i = 0; i < inputs.size(); ++i) {\n      srcs_md.push_back(inputs[i]->mem_desc());\n    }\n\n    auto dst_dims = phi::vectorize<int64_t>(output->dims());\n\n    dnnl::memory::desc dst_md;\n\n    \/\/ if concat is being used as a stack op(all source memories dims on\n    \/\/ concat_axis are equal to 1), then it may choose a non-optimal memory\n    \/\/ format tag for destination, because concat primitive is chosing it based\n    \/\/ on source memory descriptors and f.e.200x1x10 can be described as both\n    \/\/ abc and bac and both would be using exact same physical layout, but in\n    \/\/ that scenario bac will be chosen for destination no matter which\n    \/\/ formats are being set in inputs. In that scenario we are enforcing using\n    \/\/ a dense format, because it is the most common one and should be the best\n    \/\/ in terms of the performance\n    const auto src0_tz = srcs_md[0].dims();\n    if (std::find(src0_tz.begin(), src0_tz.end(), 1) != src0_tz.end()) {\n      dst_md = memory::desc(\n          dst_dims, dt, platform::GetPlainMKLDNNFormat(dst_dims.size()));\n    } else {\n      dst_md = memory::desc(dst_dims, dt, MKLDNNMemoryFormat::any);\n    }\n\n    this->AcquireForwardPrimitiveDescriptor(dst_md, concat_axis, srcs_md);\n  }\n\n  \/\/ (jczaja) concat oneDNN prim is not having .desc attribute so\n  \/\/ we cannot use base AcquireForwardPrimitiveDescriptor\n  void AcquireForwardPrimitiveDescriptor(\n      const memory::desc& dst_md,\n      const int concat_axis,\n      const std::vector<memory::desc>& srcs_md) {\n    this->fwd_pd_.reset(new dnnl::concat::primitive_desc(\n        dst_md, concat_axis, srcs_md, this->engine_));\n  }\n\n  std::shared_ptr<dnnl::memory> AcquireSrcMemory(const Tensor& input, int i) {\n    const T* input_data = input.data<T>();\n    return this->AcquireMemoryFromPrimitive(this->fwd_pd_->src_desc(i),\n                                            to_void_cast<T>(input_data));\n  }\n};\n\nstatic void EnforceLayouts(const std::vector<const Tensor*> inputs) {\n  for (auto* input : inputs) {\n    PADDLE_ENFORCE_EQ(\n        input->layout(),\n        DataLayout::kMKLDNN,\n        platform::errors::InvalidArgument(\"Wrong layout set for Input tensor\"));\n  }\n}\n\n\/\/ From a multi-input, gather only nonempty inputs\nstatic const std::vector<const Tensor*> ReduceMultiInput(\n    const std::vector<const Tensor*>& inputs) {\n  std::vector<const Tensor*> reduced(inputs.size());\n  auto end_it = std::copy_if(\n      inputs.begin(), inputs.end(), reduced.begin(), [](const Tensor* t) {\n        return t->numel() > 0;\n      });\n  reduced.resize(std::distance(reduced.begin(), end_it));\n  return reduced;\n}\n\ntemplate <typename T>\nclass ConcatMKLDNNOpKernel : public paddle::framework::OpKernel<T> {\n public:\n  void Compute(const paddle::framework::ExecutionContext& ctx) const override {\n    auto& dev_ctx =\n        ctx.template device_context<platform::MKLDNNDeviceContext>();\n    const auto& mkldnn_engine = dev_ctx.GetEngine();\n    \/\/ If any of the multiple inputs of concat has an input size of 0, the\n    \/\/ actual size of the multi_input will change\n    auto multi_input = ReduceMultiInput(ctx.MultiInput<Tensor>(\"X\"));\n    EnforceLayouts(multi_input);\n    Tensor* output = ctx.Output<Tensor>(\"Out\");\n\n    ConcatMKLDNNHandler<T> handler(ctx, mkldnn_engine, multi_input, output);\n\n    std::vector<std::shared_ptr<memory>> srcs;\n    srcs.reserve(multi_input.size());\n\n    auto dst_mem = handler.AcquireDstMemory(output);\n    auto concat_p = handler.AcquireForwardPrimitive();\n\n    auto& astream = platform::MKLDNNDeviceContext::tls().get_stream();\n    std::unordered_map<int, memory> args;\n    for (size_t i = 0; i < multi_input.size(); ++i) {\n      srcs.push_back(handler.AcquireSrcMemory(*(multi_input[i]), i));\n      args.insert({DNNL_ARG_MULTIPLE_SRC + i, *(srcs.at(i))});\n    }\n    args.insert({DNNL_ARG_DST, *dst_mem});\n\n    concat_p->execute(astream, args);\n    astream.wait();\n\n    output->set_mem_desc(dst_mem->get_desc());\n  }\n};\n\ntemplate <typename T>\nclass ConcatGradMKLDNNOpKernel : public paddle::framework::OpKernel<T> {\n public:\n  void Compute(const paddle::framework::ExecutionContext& ctx) const override {\n    const auto& dev_ctx =\n        ctx.template device_context<platform::MKLDNNDeviceContext>();\n    const auto& onednn_engine = dev_ctx.GetEngine();\n\n    auto& astream = platform::MKLDNNDeviceContext::tls().get_stream();\n\n    auto out_var_names = ctx.OutputNames(framework::GradVarName(\"X\"));\n\n    const auto x = ctx.MultiInput<LoDTensor>(\"X\");\n    const auto* dout = ctx.Input<Tensor>(framework::GradVarName(\"Out\"));\n    auto dx = ctx.MultiOutput<LoDTensor>(framework::GradVarName(\"X\"));\n\n    for (size_t i = 0; i < dx.size(); ++i) {\n      if (dx[i] != nullptr) {\n        dx[i]->set_lod(x[i]->lod());\n      }\n    }\n\n    int axis = ctx.Attr<int>(\"axis\");\n    if (ctx.HasInput(\"AxisTensor\")) {\n      auto* axis_tensor = ctx.Input<Tensor>(\"AxisTensor\");\n      axis = GetDataFromTensor<int>(axis_tensor)[0];\n    }\n\n    auto dout_vec_dims = phi::vectorize(dout->dims());\n\n    axis = ComputeAxis(axis, dout_vec_dims.size());\n\n    std::vector<int64_t> offset(dout_vec_dims.size(), 0);\n\n    dnnl::memory::data_type dout_type = framework::ToMKLDNNDataType(\n        framework::TransToProtoVarType(dout->dtype()));\n    platform::ReorderMKLDNNHandler reorder_handler(\n        dout_vec_dims,\n        framework::TransToProtoVarType(dout->dtype()),\n        dout_type,\n        onednn_engine);\n    auto reorder_src_memory_p = reorder_handler.AcquireSrcMemory(\n        dout->mem_desc(), platform::to_void_cast(dout->data<T>()));\n\n    for (size_t i = 0; i < dx.size(); ++i) {\n      if (out_var_names[i] != framework::kEmptyVarName &&\n          dx[i]->numel() != 0UL) {\n        auto dx_vec_dims = phi::vectorize(dx[i]->dims());\n        auto slice_mem_p = reorder_handler.AcquireSubmemory(\n            dx_vec_dims, offset, reorder_src_memory_p);\n\n        auto reorder_dst_memory_p = reorder_handler.AcquireDstMemory(\n            dx[i],\n            dx_vec_dims,\n            platform::GetPlainMKLDNNFormat(dx_vec_dims.size()),\n            ctx.GetPlace());\n        auto reorder_p =\n            reorder_handler.AcquireReorder(reorder_dst_memory_p, slice_mem_p);\n\n        reorder_p->execute(astream, *slice_mem_p, *reorder_dst_memory_p);\n\n        offset[axis] += dx[i]->dims()[axis];\n\n        dx[i]->set_mem_desc(reorder_dst_memory_p->get_desc());\n      }\n    }\n    astream.wait();\n  }\n};\n\n}  \/\/ namespace operators\n}  \/\/ namespace paddle\n\nnamespace ops = paddle::operators;\n\nREGISTER_OP_KERNEL(concat,\n                   MKLDNN,\n                   ::paddle::platform::CPUPlace,\n                   ops::ConcatMKLDNNOpKernel<float>,\n                   ops::ConcatMKLDNNOpKernel<paddle::platform::bfloat16>,\n                   ops::ConcatMKLDNNOpKernel<int8_t>,\n                   ops::ConcatMKLDNNOpKernel<uint8_t>);\n\nREGISTER_OP_KERNEL(concat_grad,\n                   MKLDNN,\n                   ::paddle::platform::CPUPlace,\n                   ops::ConcatGradMKLDNNOpKernel<float>,\n                   ops::ConcatGradMKLDNNOpKernel<paddle::platform::bfloat16>);\n<commit_msg>reverted changes (#46254)<commit_after>\/* Copyright (c) 2018 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 <memory>\n\n#include \"paddle\/fluid\/operators\/concat_op.h\"\n#include \"paddle\/fluid\/operators\/utils.h\"\n#include \"paddle\/fluid\/platform\/mkldnn_helper.h\"\n#include \"paddle\/fluid\/platform\/mkldnn_reuse.h\"\n\nnamespace paddle {\nnamespace operators {\n\nusing dnnl::concat;\nusing dnnl::memory;\nusing dnnl::primitive;\nusing dnnl::stream;\nusing framework::DataLayout;\nusing framework::LoDTensor;\nusing framework::Tensor;\nusing platform::to_void_cast;\n\ntemplate <typename T>\nclass ConcatMKLDNNHandler\n    : public platform::MKLDNNHandlerNoCachingT<T, dnnl::concat> {\n public:\n  ConcatMKLDNNHandler(const framework::ExecutionContext& ctx,\n                      const dnnl::engine mkldnn_engine,\n                      const std::vector<const Tensor*>& inputs,\n                      Tensor* output)\n      : platform::MKLDNNHandlerNoCachingT<T, dnnl::concat>(mkldnn_engine,\n                                                           ctx.GetPlace()) {\n    int concat_axis = ctx.Attr<int>(\"axis\");\n    const int rank = inputs[0]->dims().size();\n    PADDLE_ENFORCE_EQ(\n        concat_axis >= -rank && concat_axis < rank,\n        true,\n        platform::errors::InvalidArgument(\n            \"The axis is expected to be in range of [%d, %d), but got %d\",\n            -rank,\n            rank,\n            concat_axis));\n\n    if (ctx.HasInput(\"AxisTensor\")) {\n      auto* axis_tensor = ctx.Input<Tensor>(\"AxisTensor\");\n      concat_axis = GetDataFromTensor(axis_tensor)[0];\n      auto out_dims = inputs[0]->dims();\n      for (size_t i = 1; i < inputs.size(); ++i) {\n        out_dims[concat_axis] += inputs[i]->dims()[concat_axis];\n      }\n      output->Resize(out_dims);\n    }\n\n    if (concat_axis < 0) {\n      concat_axis = concat_axis + rank;\n    }\n\n    memory::data_type dt = framework::ToMKLDNNDataType(\n        framework::TransToProtoVarType(inputs[0]->dtype()));\n    std::vector<memory::desc> srcs_md;\n    srcs_md.reserve(inputs.size());\n\n    \/\/ Create memory descriptors for each of inputs\n    for (size_t i = 0; i < inputs.size(); ++i) {\n      srcs_md.push_back(inputs[i]->mem_desc());\n    }\n\n    auto dst_dims = phi::vectorize<int64_t>(output->dims());\n    dnnl::memory::desc dst_md =\n        memory::desc(dst_dims, dt, MKLDNNMemoryFormat::any);\n\n    this->AcquireForwardPrimitiveDescriptor(dst_md, concat_axis, srcs_md);\n  }\n\n  \/\/ (jczaja) concat oneDNN prim is not having .desc attribute so\n  \/\/ we cannot use base AcquireForwardPrimitiveDescriptor\n  void AcquireForwardPrimitiveDescriptor(\n      const memory::desc& dst_md,\n      const int concat_axis,\n      const std::vector<memory::desc>& srcs_md) {\n    this->fwd_pd_.reset(new dnnl::concat::primitive_desc(\n        dst_md, concat_axis, srcs_md, this->engine_));\n  }\n\n  std::shared_ptr<dnnl::memory> AcquireSrcMemory(const Tensor& input, int i) {\n    const T* input_data = input.data<T>();\n    return this->AcquireMemoryFromPrimitive(this->fwd_pd_->src_desc(i),\n                                            to_void_cast<T>(input_data));\n  }\n};\n\nstatic void EnforceLayouts(const std::vector<const Tensor*> inputs) {\n  for (auto* input : inputs) {\n    PADDLE_ENFORCE_EQ(\n        input->layout(),\n        DataLayout::kMKLDNN,\n        platform::errors::InvalidArgument(\"Wrong layout set for Input tensor\"));\n  }\n}\n\n\/\/ From a multi-input, gather only nonempty inputs\nstatic const std::vector<const Tensor*> ReduceMultiInput(\n    const std::vector<const Tensor*>& inputs) {\n  std::vector<const Tensor*> reduced(inputs.size());\n  auto end_it = std::copy_if(\n      inputs.begin(), inputs.end(), reduced.begin(), [](const Tensor* t) {\n        return t->numel() > 0;\n      });\n  reduced.resize(std::distance(reduced.begin(), end_it));\n  return reduced;\n}\n\ntemplate <typename T>\nclass ConcatMKLDNNOpKernel : public paddle::framework::OpKernel<T> {\n public:\n  void Compute(const paddle::framework::ExecutionContext& ctx) const override {\n    auto& dev_ctx =\n        ctx.template device_context<platform::MKLDNNDeviceContext>();\n    const auto& mkldnn_engine = dev_ctx.GetEngine();\n    \/\/ If any of the multiple inputs of concat has an input size of 0, the\n    \/\/ actual size of the multi_input will change\n    auto multi_input = ReduceMultiInput(ctx.MultiInput<Tensor>(\"X\"));\n    EnforceLayouts(multi_input);\n    Tensor* output = ctx.Output<Tensor>(\"Out\");\n\n    ConcatMKLDNNHandler<T> handler(ctx, mkldnn_engine, multi_input, output);\n\n    std::vector<std::shared_ptr<memory>> srcs;\n    srcs.reserve(multi_input.size());\n\n    auto dst_mem = handler.AcquireDstMemory(output);\n    auto concat_p = handler.AcquireForwardPrimitive();\n\n    auto& astream = platform::MKLDNNDeviceContext::tls().get_stream();\n    std::unordered_map<int, memory> args;\n    for (size_t i = 0; i < multi_input.size(); ++i) {\n      srcs.push_back(handler.AcquireSrcMemory(*(multi_input[i]), i));\n      args.insert({DNNL_ARG_MULTIPLE_SRC + i, *(srcs.at(i))});\n    }\n    args.insert({DNNL_ARG_DST, *dst_mem});\n\n    concat_p->execute(astream, args);\n    astream.wait();\n\n    output->set_mem_desc(dst_mem->get_desc());\n  }\n};\n\ntemplate <typename T>\nclass ConcatGradMKLDNNOpKernel : public paddle::framework::OpKernel<T> {\n public:\n  void Compute(const paddle::framework::ExecutionContext& ctx) const override {\n    const auto& dev_ctx =\n        ctx.template device_context<platform::MKLDNNDeviceContext>();\n    const auto& onednn_engine = dev_ctx.GetEngine();\n\n    auto& astream = platform::MKLDNNDeviceContext::tls().get_stream();\n\n    auto out_var_names = ctx.OutputNames(framework::GradVarName(\"X\"));\n\n    const auto x = ctx.MultiInput<LoDTensor>(\"X\");\n    const auto* dout = ctx.Input<Tensor>(framework::GradVarName(\"Out\"));\n    auto dx = ctx.MultiOutput<LoDTensor>(framework::GradVarName(\"X\"));\n\n    for (size_t i = 0; i < dx.size(); ++i) {\n      if (dx[i] != nullptr) {\n        dx[i]->set_lod(x[i]->lod());\n      }\n    }\n\n    int axis = ctx.Attr<int>(\"axis\");\n    if (ctx.HasInput(\"AxisTensor\")) {\n      auto* axis_tensor = ctx.Input<Tensor>(\"AxisTensor\");\n      axis = GetDataFromTensor<int>(axis_tensor)[0];\n    }\n\n    auto dout_vec_dims = phi::vectorize(dout->dims());\n\n    axis = ComputeAxis(axis, dout_vec_dims.size());\n\n    std::vector<int64_t> offset(dout_vec_dims.size(), 0);\n\n    dnnl::memory::data_type dout_type = framework::ToMKLDNNDataType(\n        framework::TransToProtoVarType(dout->dtype()));\n    platform::ReorderMKLDNNHandler reorder_handler(\n        dout_vec_dims,\n        framework::TransToProtoVarType(dout->dtype()),\n        dout_type,\n        onednn_engine);\n    auto reorder_src_memory_p = reorder_handler.AcquireSrcMemory(\n        dout->mem_desc(), platform::to_void_cast(dout->data<T>()));\n\n    for (size_t i = 0; i < dx.size(); ++i) {\n      if (out_var_names[i] != framework::kEmptyVarName &&\n          dx[i]->numel() != 0UL) {\n        auto dx_vec_dims = phi::vectorize(dx[i]->dims());\n        auto slice_mem_p = reorder_handler.AcquireSubmemory(\n            dx_vec_dims, offset, reorder_src_memory_p);\n\n        auto reorder_dst_memory_p = reorder_handler.AcquireDstMemory(\n            dx[i],\n            dx_vec_dims,\n            platform::GetPlainMKLDNNFormat(dx_vec_dims.size()),\n            ctx.GetPlace());\n        auto reorder_p =\n            reorder_handler.AcquireReorder(reorder_dst_memory_p, slice_mem_p);\n\n        reorder_p->execute(astream, *slice_mem_p, *reorder_dst_memory_p);\n\n        offset[axis] += dx[i]->dims()[axis];\n\n        dx[i]->set_mem_desc(reorder_dst_memory_p->get_desc());\n      }\n    }\n    astream.wait();\n  }\n};\n\n}  \/\/ namespace operators\n}  \/\/ namespace paddle\n\nnamespace ops = paddle::operators;\n\nREGISTER_OP_KERNEL(concat,\n                   MKLDNN,\n                   ::paddle::platform::CPUPlace,\n                   ops::ConcatMKLDNNOpKernel<float>,\n                   ops::ConcatMKLDNNOpKernel<paddle::platform::bfloat16>,\n                   ops::ConcatMKLDNNOpKernel<int8_t>,\n                   ops::ConcatMKLDNNOpKernel<uint8_t>);\n\nREGISTER_OP_KERNEL(concat_grad,\n                   MKLDNN,\n                   ::paddle::platform::CPUPlace,\n                   ops::ConcatGradMKLDNNOpKernel<float>,\n                   ops::ConcatGradMKLDNNOpKernel<paddle::platform::bfloat16>);\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright The OpenTelemetry Authors\n\/\/ SPDX-License-Identifier: Apache-2.0\n#ifdef ENABLE_LOGS_PREVIEW\n#  include <map>\n#  include <string>\n#  include \"opentelemetry\/logs\/provider.h\"\n#  include \"opentelemetry\/sdk\/version\/version.h\"\n#  include \"opentelemetry\/trace\/provider.h\"\n\nnamespace logs  = opentelemetry::logs;\nnamespace trace = opentelemetry::trace;\nnamespace nostd = opentelemetry::nostd;\n\nnamespace\n{\nnostd::shared_ptr<trace::Tracer> get_tracer()\n{\n  auto provider = trace::Provider::GetTracerProvider();\n  return provider->GetTracer(\"foo_library\", OPENTELEMETRY_SDK_VERSION);\n}\n\nnostd::shared_ptr<logs::Logger> get_logger()\n{\n  auto provider = logs::Provider::GetLoggerProvider();\n  return provider->GetLogger(\"foo_library_logger\", \"\", \"foo_library\");\n}\n}  \/\/ namespace\n\nvoid foo_library()\n{\n  auto span        = get_tracer()->StartSpan(\"span 1\");\n  auto scoped_span = trace::Scope(get_tracer()->StartSpan(\"foo_library\"));\n  auto ctx         = span->GetContext();\n  auto logger      = get_logger();\n  logger->Log(opentelemetry::logs::Severity::kDebug, \"body\", {}, ctx.trace_id(), ctx.span_id(),\n              ctx.trace_flags(), opentelemetry::common::SystemTimestamp());\n}\n#endif\n<commit_msg>Log current timestamp instead of epoch time (#1434)<commit_after>\/\/ Copyright The OpenTelemetry Authors\n\/\/ SPDX-License-Identifier: Apache-2.0\n#ifdef ENABLE_LOGS_PREVIEW\n#  include <map>\n#  include <string>\n#  include \"opentelemetry\/logs\/provider.h\"\n#  include \"opentelemetry\/sdk\/version\/version.h\"\n#  include \"opentelemetry\/trace\/provider.h\"\n\nnamespace logs  = opentelemetry::logs;\nnamespace trace = opentelemetry::trace;\nnamespace nostd = opentelemetry::nostd;\n\nnamespace\n{\nnostd::shared_ptr<trace::Tracer> get_tracer()\n{\n  auto provider = trace::Provider::GetTracerProvider();\n  return provider->GetTracer(\"foo_library\", OPENTELEMETRY_SDK_VERSION);\n}\n\nnostd::shared_ptr<logs::Logger> get_logger()\n{\n  auto provider = logs::Provider::GetLoggerProvider();\n  return provider->GetLogger(\"foo_library_logger\", \"\", \"foo_library\");\n}\n}  \/\/ namespace\n\nvoid foo_library()\n{\n  auto span        = get_tracer()->StartSpan(\"span 1\");\n  auto scoped_span = trace::Scope(get_tracer()->StartSpan(\"foo_library\"));\n  auto ctx         = span->GetContext();\n  auto logger      = get_logger();\n  logger->Log(opentelemetry::logs::Severity::kDebug, \"body\", {}, ctx.trace_id(), ctx.span_id(),\n              ctx.trace_flags(),\n              opentelemetry::common::SystemTimestamp(std::chrono::system_clock::now()));\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/ @file\n\/\/\/ @author uentity\n\/\/\/ @date 18.08.2016\t\n\/\/\/ @brief Contains implimentations of BlueSky exceptions\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\/error.h>\n#include <bs\/misc.h>\n#include <bs\/log.h>\n#include <bs\/kernel_tools.h>\n\n#include <cstring>\n#include <iostream>\n\nusing namespace std;\n\nNAMESPACE_BEGIN(blue_sky)\n\/*-----------------------------------------------------------------------------\n *  hidden details\n *-----------------------------------------------------------------------------*\/\nnamespace {\n\n\/\/ not throwing error message formatter\ninline std::string format_errmsg(const std::string ec_message, const std::string custom_message) {\n\treturn ec_message.size() ?\n\t\t(custom_message.size() ? ec_message + \": \" + custom_message : ec_message)\n\t\t: custom_message;\n};\n\n} \/\/ hidden namespace\n\n\/*-----------------------------------------------------------------------------\n *  Default error category for generic exception\n *-----------------------------------------------------------------------------*\/\nstd::error_code make_error_code(Error e) {\n\t\/\/ implement error categiry for default error code\n\tstatic const struct : std::error_category {\n\t\tconst char* name() const noexcept override {\n\t\t\treturn \"blue-sky\";\n\t\t}\n\n\t\tstd::string message(int ec) const override {\n\t\t\t\/\/ in any case we should just substitute custom error message\n\t\t\t\treturn \"\";\n\t\t}\n\t} default_category;\n\n\treturn { static_cast<int>(e), default_category };\n}\n\n\/*-----------------------------------------------------------------------------\n *  error implementation\n *-----------------------------------------------------------------------------*\/\nerror::error(IsQuiet quiet, const std::string message, const std::error_code ec)\n\t: runtime_error(format_errmsg(ec.message(), std::move(message))),\n\t  code(ec == Error::Undefined ? (quiet == IsQuiet::Yes ? Error::OK : Error::Happened) : std::move(ec))\n{\n\tif(quiet == IsQuiet::No) dump();\n}\n\nerror::error(IsQuiet quiet, const std::error_code ec)\n\t: runtime_error(ec.message()),\n\t  code(ec == Error::Undefined ? (quiet == IsQuiet::Yes ? Error::OK : Error::Happened) : std::move(ec))\n{\n\tif(quiet == IsQuiet::No) dump();\n}\n\nerror::error(IsQuiet quiet, int ec)\n\t: runtime_error(\"\"), code(static_cast<Error>(ec))\n{\n\t\/\/BSOUT << \"error: from int!\" << log::end;\n\tif(quiet == IsQuiet::No) dump();\n}\n\n\/\/ copy & move ctors are default\nerror::error(const error& rhs) noexcept = default;\nerror::error(error&& rhs) noexcept = default;\n\nconst char* error::domain() const noexcept {\n\treturn code.category().name();\n}\n\nstd::string error::to_string() const {\n\tstd::string s = fmt::format(\"[{}] [{}] {}\", domain(), code.value(), what());\n#ifdef _DEBUG\n\tif(!ok()) s += kernel_tools::get_backtrace(20, 4);\n#endif\n\treturn s;\n}\n\nvoid error::dump() const {\n\t\/\/const auto msg = fmt::format(\"[{}] [{}] {}\", domain(), code.value(), what());\n\tif(code)\n\t\tbserr() << log::E(to_string()) << log::end;\n\telse\n\t\tbsout() << log::I(to_string()) << log::end;\n}\n\nbool error::ok() const {\n\treturn !(bool)code;\n}\n\n\/\/ error printing\nBS_API std::ostream& operator <<(std::ostream& os, const error& ec) {\n\treturn os << ec.to_string();\n}\n\nNAMESPACE_END(blue_sky)\n\n<commit_msg>error: temp disable debug backtrace collection on VS -- needs fixing<commit_after>\/\/\/ @file\n\/\/\/ @author uentity\n\/\/\/ @date 18.08.2016\t\n\/\/\/ @brief Contains implimentations of BlueSky exceptions\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\/error.h>\n#include <bs\/misc.h>\n#include <bs\/log.h>\n#include <bs\/kernel_tools.h>\n\n#include <cstring>\n#include <iostream>\n\nusing namespace std;\n\nNAMESPACE_BEGIN(blue_sky)\n\/*-----------------------------------------------------------------------------\n *  hidden details\n *-----------------------------------------------------------------------------*\/\nnamespace {\n\n\/\/ not throwing error message formatter\ninline std::string format_errmsg(const std::string ec_message, const std::string custom_message) {\n\treturn ec_message.size() ?\n\t\t(custom_message.size() ? ec_message + \": \" + custom_message : ec_message)\n\t\t: custom_message;\n};\n\n} \/\/ hidden namespace\n\n\/*-----------------------------------------------------------------------------\n *  Default error category for generic exception\n *-----------------------------------------------------------------------------*\/\nstd::error_code make_error_code(Error e) {\n\t\/\/ implement error categiry for default error code\n\tstatic const struct : std::error_category {\n\t\tconst char* name() const noexcept override {\n\t\t\treturn \"blue-sky\";\n\t\t}\n\n\t\tstd::string message(int ec) const override {\n\t\t\t\/\/ in any case we should just substitute custom error message\n\t\t\t\treturn \"\";\n\t\t}\n\t} default_category;\n\n\treturn { static_cast<int>(e), default_category };\n}\n\n\/*-----------------------------------------------------------------------------\n *  error implementation\n *-----------------------------------------------------------------------------*\/\nerror::error(IsQuiet quiet, const std::string message, const std::error_code ec)\n\t: runtime_error(format_errmsg(ec.message(), std::move(message))),\n\t  code(ec == Error::Undefined ? (quiet == IsQuiet::Yes ? Error::OK : Error::Happened) : std::move(ec))\n{\n\tif(quiet == IsQuiet::No) dump();\n}\n\nerror::error(IsQuiet quiet, const std::error_code ec)\n\t: runtime_error(ec.message()),\n\t  code(ec == Error::Undefined ? (quiet == IsQuiet::Yes ? Error::OK : Error::Happened) : std::move(ec))\n{\n\tif(quiet == IsQuiet::No) dump();\n}\n\nerror::error(IsQuiet quiet, int ec)\n\t: runtime_error(\"\"), code(static_cast<Error>(ec))\n{\n\t\/\/BSOUT << \"error: from int!\" << log::end;\n\tif(quiet == IsQuiet::No) dump();\n}\n\n\/\/ copy & move ctors are default\nerror::error(const error& rhs) noexcept = default;\nerror::error(error&& rhs) noexcept = default;\n\nconst char* error::domain() const noexcept {\n\treturn code.category().name();\n}\n\nstd::string error::to_string() const {\n\tstd::string s = fmt::format(\"[{}] [{}] {}\", domain(), code.value(), what());\n#if defined(_DEBUG) && !defined(_MSC_VER)\n\tif(!ok()) s += kernel_tools::get_backtrace(20, 4);\n#endif\n\treturn s;\n}\n\nvoid error::dump() const {\n\t\/\/const auto msg = fmt::format(\"[{}] [{}] {}\", domain(), code.value(), what());\n\tif(code)\n\t\tbserr() << log::E(to_string()) << log::end;\n\telse\n\t\tbsout() << log::I(to_string()) << log::end;\n}\n\nbool error::ok() const {\n\treturn !(bool)code;\n}\n\n\/\/ error printing\nBS_API std::ostream& operator <<(std::ostream& os, const error& ec) {\n\treturn os << ec.to_string();\n}\n\nNAMESPACE_END(blue_sky)\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * SessionProjects.cpp\n *\n * Copyright (C) 2009-11 by RStudio, Inc.\n *\n * This program is licensed to you under the terms of version 3 of the\n * GNU Affero General Public License. This program is distributed WITHOUT\n * ANY EXPRESS OR IMPLIED WARRANTY, INCLUDING THOSE OF NON-INFRINGEMENT,\n * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Please refer to the\n * AGPL (http:\/\/www.gnu.org\/licenses\/agpl-3.0.txt) for more details.\n *\n *\/\n\n\/\/ TODO: plot restoration doesn't work in server mode\n\n\/\/ TODO: when switching from hidden source to project with source docs\n\/\/       need to show the source view\n\n\/\/ TODO: analyze plots, client_state, and source_database scoped scratch case\n\n\/\/ TODO: analyze other things in scratch path to see where they belong and\n\/\/       how they will behave\n\n\/\/ TODO: post a bug for some way to expose\/cleanup project caches\n\/\/       (could implement source database optimization)\n\n\/\/ TODO: detecting copy\/move\/network:\n\/*\n    - read INDEX\n    - read id file\n\n    - if INDEX contains id mapped to correct path then use\n\n    - if INDEX doesn't not contain id or path then create new\n\n    - if INDEX has id but path doesn't match then may have been\n      a move or a copy so create a copy of the scratch dir and\n      associate it with a new id\n\n    - if has an id file but nothing in the index at all then\n      create a brand new entry\/dir using that id\n*\/\n\n\n\n#include \"SessionProjects.hpp\"\n\n#include <core\/FilePath.hpp>\n#include <core\/Settings.hpp>\n#include <core\/Exec.hpp>\n#include <core\/FileSerializer.hpp>\n#include <core\/system\/System.hpp>\n#include <core\/FileSerializer.hpp>\n#include <core\/r_util\/RProjectFile.hpp>\n\n#include <session\/SessionModuleContext.hpp>\n#include <session\/SessionUserSettings.hpp>\n\n#include \"SessionPersistentState.hpp\"\n\nusing namespace core;\n\nnamespace session {\n\nnamespace {\n\nFilePath s_activeProjectPath;\nFilePath s_activeProjectScratchPath;\n\nvoid onSuspend(Settings*)\n{\n   \/\/ on suspend write out current project path as the one to use\n   \/\/ on resume. we read this back in initalize (rather than in\n   \/\/ the onResume handler) becuase we need it very early in the\n   \/\/ processes lifetime and onResume happens too late\n   persistentState().setNextSessionProjectPath(s_activeProjectPath);\n}\n\nvoid onResume(const Settings&) {}\n\nFilePath determineActiveProjectScratchPath()\n{\n   \/\/ projects dir\n   FilePath projDir = module_context::userScratchPath().complete(\"projects\");\n   Error error = projDir.ensureDirectory();\n   if (error)\n   {\n      LOG_ERROR(error);\n      return FilePath();\n   }\n\n   \/\/ read index file\n   std::map<std::string,std::string> projectIndex;\n   FilePath indexFilePath = projDir.complete(\"INDEX\");\n   if (indexFilePath.exists())\n   {\n      error = core::readStringMapFromFile(indexFilePath, &projectIndex);\n      if (error)\n      {\n         LOG_ERROR(error);\n         return FilePath();\n      }\n   }\n\n   \/\/ look for this directory in the index file\n   std::string projectId;\n   FilePath projectDir = module_context::activeProjectDirectory();\n   for (std::map<std::string,std::string>::const_iterator\n         it = projectIndex.begin(); it != projectIndex.end(); ++it)\n   {\n      if (it->second == projectDir.absolutePath())\n      {\n         projectId = it->first;\n         break;\n      }\n   }\n\n   \/\/ if it wasn't found then generate a new entry and re-write the index\n   if (projectId.empty())\n   {\n      std::string newId = core::system::generateUuid(false);\n      projectIndex[newId] = projectDir.absolutePath();\n      error = core::writeStringMapToFile(indexFilePath, projectIndex);\n      if (error)\n      {\n         LOG_ERROR(error);\n         return FilePath();\n      }\n\n      projectId = newId;\n   }\n\n   \/\/ now we have the id, use it to get the directory\n   FilePath projectScratchPath = projDir.complete(projectId);\n   error = projectScratchPath.ensureDirectory();\n   if (error)\n   {\n      LOG_ERROR(error);\n      return FilePath();\n   }\n\n   \/\/ return the path\n   return projectScratchPath;\n}\n\n}  \/\/ anonymous namespace\n\n\nnamespace module_context {\n\nFilePath activeProjectDirectory()\n{\n   if (!s_activeProjectPath.empty())\n   {\n      if (s_activeProjectPath.parent().exists())\n         return s_activeProjectPath.parent();\n      else\n         return FilePath();\n   }\n   else\n   {\n      return FilePath();\n   }\n}\n\n\nFilePath activeProjectFilePath()\n{\n   return s_activeProjectPath;\n}\n\nFilePath activeProjectScratchPath()\n{\n   if (s_activeProjectPath.empty())\n   {\n      return module_context::userScratchPath();\n   }\n   else\n   {\n      \/\/ one-time on-demand calculation of active project scratch path\n      if (s_activeProjectScratchPath.empty())\n      {\n         FilePath projectScratchPath = determineActiveProjectScratchPath();\n         if (!projectScratchPath.empty())\n            s_activeProjectScratchPath = projectScratchPath;\n         else\n            s_activeProjectScratchPath = module_context::userScratchPath();\n      }\n\n      \/\/ return the path\n      return s_activeProjectScratchPath;\n   }\n}\n\n} \/\/ namespace module_context\n\n\nnamespace projects {\n\nnamespace {\n\nconst int kStatusOk = 0;\nconst int kStatusNotExists = 1;\nconst int kStatusAlreadyExists = 2;\nconst int kStatusNoWriteAccess = 3;\n\njson::Object createProjectResult(int status, const FilePath& projectFilePath)\n{\n   json::Object result;\n   result[\"status\"] = status;\n   if (!projectFilePath.empty())\n   {\n      result[\"project_file_path\"] = module_context::createAliasedPath(\n                                                            projectFilePath);\n   }\n   else\n   {\n      result[\"project_file_path\"] = json::Value();\n   }\n   return result;\n}\n\njson::Object createProjectResult(int status)\n{\n   return createProjectResult(status, FilePath());\n}\n\nbool canWriteToProjectDir(const FilePath& projectDirPath)\n{\n   FilePath testFile = projectDirPath.complete(core::system::generateUuid());\n   Error error = core::writeStringToFile(testFile, \"test\");\n   if (error)\n   {\n      return false;\n   }\n   else\n   {\n      error = testFile.removeIfExists();\n      if (error)\n         LOG_ERROR(error);\n\n      return true;\n   }\n}\n\nError createProject(const json::JsonRpcRequest& request,\n                    json::JsonRpcResponse* pResponse)\n{\n   \/\/ determine project dir path\n   std::string projectDir;\n   Error error = json::readParam(request.params, 0, &projectDir);\n   if (error)\n      return error;\n   FilePath projectDirPath = module_context::resolveAliasedPath(projectDir);\n\n   \/\/ NOTE: currently we assume that the specified directory already\n   \/\/ exists (because it was chosen with the choose folder dialog). if\n   \/\/ our client ui changes and it doesn't exist (likely) then this\n   \/\/ code needs to auto-create it\n\n   \/\/ verify that it doesn't already have a project\n   FilePath existingProjFile = r_util::projectFromDirectory(projectDirPath);\n   if (!existingProjFile.empty())\n   {\n      pResponse->setResult(createProjectResult(kStatusAlreadyExists));\n      return Success();\n   }\n\n   \/\/ verify that we can write to the directory\n   if (!canWriteToProjectDir(projectDirPath))\n   {\n      pResponse->setResult(createProjectResult(kStatusNoWriteAccess));\n      return Success();\n   }\n\n   \/\/ create the project file\n   FilePath projectFilePath = projectDirPath.complete(\n                                    projectDirPath.filename() + \".Rproj\");\n   error = r_util::writeDefaultProjectFile(projectFilePath);\n   if (error)\n      return error;\n\n   \/\/ return it\n   pResponse->setResult(createProjectResult(kStatusOk, projectFilePath));\n   return Success();\n}\n\n\nError openProject(const json::JsonRpcRequest& request,\n                 json::JsonRpcResponse* pResponse)\n{\n   \/\/ determine project dir path\n   std::string projectDir;\n   Error error = json::readParam(request.params, 0, &projectDir);\n   if (error)\n      return error;\n   FilePath projectDirPath = module_context::resolveAliasedPath(projectDir);\n\n   \/\/ verify that the directory exists\n   if (!projectDirPath.exists())\n   {\n      pResponse->setResult(createProjectResult(kStatusNotExists));\n      return Success();\n   }\n\n   \/\/ see if there is project file\n   FilePath projectFilePath = r_util::projectFromDirectory(projectDirPath);\n   if (projectFilePath.empty())\n   {\n      pResponse->setResult(createProjectResult(kStatusNotExists));\n      return Success();\n   }\n\n   \/\/ test for write access\n   if (!canWriteToProjectDir(projectDirPath))\n   {\n      pResponse->setResult(createProjectResult(kStatusNoWriteAccess));\n      return Success();\n   }\n\n   \/\/ return the project file\n   pResponse->setResult(createProjectResult(kStatusOk, projectFilePath));\n   return Success();\n}\n\n}  \/\/ anonymous namespace\n\n\nError startup()\n{\n   \/\/ register suspend handler\n   using namespace module_context;\n   addSuspendHandler(SuspendHandler(onSuspend, onResume));\n\n   \/\/ see if there is a project path hard-wired for the next session\n   \/\/ (this would be used for a switch to project or for the resuming of\n   \/\/ a suspended session)\n   FilePath nextSessionProjectPath = persistentState().nextSessionProjectPath();\n   if (!nextSessionProjectPath.empty())\n   {\n      \/\/ reset next session project path so its a one shot deal\n      persistentState().setNextSessionProjectPath(FilePath());\n\n      \/\/ clear any initial context settings which may be leftover\n      \/\/ by a re-instatiation of rsession by desktop\n      session::options().clearInitialContextSettings();\n\n      \/\/ check for existence and set\n      if (nextSessionProjectPath.exists())\n      {\n         s_activeProjectPath = nextSessionProjectPath;\n      }\n      else\n      {\n         LOG_WARNING_MESSAGE(\"Next session project path doesn't exist: \" +\n                             nextSessionProjectPath.absolutePath());\n         s_activeProjectPath = FilePath();\n      }\n   }\n\n   \/\/ check for envrionment variable (file association)\n   else if (!session::options().initialProjectPath().empty())\n   {\n      s_activeProjectPath = session::options().initialProjectPath();\n   }\n\n   \/\/ check for other working dir override (implies a launch of a file\n   \/\/ but not of a project)\n   else if (!session::options().initialWorkingDirOverride().empty())\n   {\n      s_activeProjectPath = FilePath();\n   }\n\n   \/\/ check for restore based on settings\n   else if (userSettings().alwaysRestoreLastProject() &&\n            userSettings().lastProjectPath().exists())\n   {\n      s_activeProjectPath = userSettings().lastProjectPath();\n   }\n\n   \/\/ else no active project for this session\n   else\n   {\n      s_activeProjectPath = FilePath();\n   }\n\n   \/\/ last ditch check for writeabilty of the project directory\n   if (!s_activeProjectPath.empty() &&\n       !canWriteToProjectDir(s_activeProjectPath.parent()))\n   {\n      \/\/ enque a warning\n      json::Object warningBarEvent;\n      warningBarEvent[\"severe\"] = false;\n      warningBarEvent[\"message\"] =\n        \"Project '\" + s_activeProjectPath.parent().absolutePath() + \"' \"\n        \"could not be opened because it is located in a read-only directory.\";\n      ClientEvent event(client_events::kShowWarningBar, warningBarEvent);\n      module_context::enqueClientEvent(event);\n\n      \/\/ no project\n      s_activeProjectPath = FilePath();\n   }\n\n\n   \/\/ save the active project path for the next session\n   userSettings().setLastProjectPath(s_activeProjectPath);\n\n   return Success();\n}\n\nError initialize()\n{\n   using boost::bind;\n   using namespace module_context;\n   ExecBlock initBlock ;\n   initBlock.addFunctions()\n      (bind(registerRpcMethod, \"create_project\", createProject))\n      (bind(registerRpcMethod, \"open_project\", openProject))\n   ;\n   return initBlock.execute();\n}\n\n} \/\/ namespace projects\n} \/\/ namesapce session\n\n<commit_msg>update project todo comments<commit_after>\/*\n * SessionProjects.cpp\n *\n * Copyright (C) 2009-11 by RStudio, Inc.\n *\n * This program is licensed to you under the terms of version 3 of the\n * GNU Affero General Public License. This program is distributed WITHOUT\n * ANY EXPRESS OR IMPLIED WARRANTY, INCLUDING THOSE OF NON-INFRINGEMENT,\n * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Please refer to the\n * AGPL (http:\/\/www.gnu.org\/licenses\/agpl-3.0.txt) for more details.\n *\n *\/\n\n\/\/ TODO: when switching from hidden source to project with source docs\n\/\/       need to show the source view\n\n\/\/ TODO: detecting copy\/move\/network:\n\/*\n    - read INDEX\n    - read id file\n\n    - if INDEX contains id mapped to correct path then use\n\n    - if INDEX doesn't not contain id or path then create new\n\n    - if INDEX has id but path doesn't match then may have been\n      a move or a copy so create a copy of the scratch dir and\n      associate it with a new id\n\n    - if has an id file but nothing in the index at all then\n      create a brand new entry\/dir using that id\n*\/\n\n\n\n#include \"SessionProjects.hpp\"\n\n#include <core\/FilePath.hpp>\n#include <core\/Settings.hpp>\n#include <core\/Exec.hpp>\n#include <core\/FileSerializer.hpp>\n#include <core\/system\/System.hpp>\n#include <core\/FileSerializer.hpp>\n#include <core\/r_util\/RProjectFile.hpp>\n\n#include <session\/SessionModuleContext.hpp>\n#include <session\/SessionUserSettings.hpp>\n\n#include \"SessionPersistentState.hpp\"\n\nusing namespace core;\n\nnamespace session {\n\nnamespace {\n\nFilePath s_activeProjectPath;\nFilePath s_activeProjectScratchPath;\n\nvoid onSuspend(Settings*)\n{\n   \/\/ on suspend write out current project path as the one to use\n   \/\/ on resume. we read this back in initalize (rather than in\n   \/\/ the onResume handler) becuase we need it very early in the\n   \/\/ processes lifetime and onResume happens too late\n   persistentState().setNextSessionProjectPath(s_activeProjectPath);\n}\n\nvoid onResume(const Settings&) {}\n\nFilePath determineActiveProjectScratchPath()\n{\n   \/\/ projects dir\n   FilePath projDir = module_context::userScratchPath().complete(\"projects\");\n   Error error = projDir.ensureDirectory();\n   if (error)\n   {\n      LOG_ERROR(error);\n      return FilePath();\n   }\n\n   \/\/ read index file\n   std::map<std::string,std::string> projectIndex;\n   FilePath indexFilePath = projDir.complete(\"INDEX\");\n   if (indexFilePath.exists())\n   {\n      error = core::readStringMapFromFile(indexFilePath, &projectIndex);\n      if (error)\n      {\n         LOG_ERROR(error);\n         return FilePath();\n      }\n   }\n\n   \/\/ look for this directory in the index file\n   std::string projectId;\n   FilePath projectDir = module_context::activeProjectDirectory();\n   for (std::map<std::string,std::string>::const_iterator\n         it = projectIndex.begin(); it != projectIndex.end(); ++it)\n   {\n      if (it->second == projectDir.absolutePath())\n      {\n         projectId = it->first;\n         break;\n      }\n   }\n\n   \/\/ if it wasn't found then generate a new entry and re-write the index\n   if (projectId.empty())\n   {\n      std::string newId = core::system::generateUuid(false);\n      projectIndex[newId] = projectDir.absolutePath();\n      error = core::writeStringMapToFile(indexFilePath, projectIndex);\n      if (error)\n      {\n         LOG_ERROR(error);\n         return FilePath();\n      }\n\n      projectId = newId;\n   }\n\n   \/\/ now we have the id, use it to get the directory\n   FilePath projectScratchPath = projDir.complete(projectId);\n   error = projectScratchPath.ensureDirectory();\n   if (error)\n   {\n      LOG_ERROR(error);\n      return FilePath();\n   }\n\n   \/\/ return the path\n   return projectScratchPath;\n}\n\n}  \/\/ anonymous namespace\n\n\nnamespace module_context {\n\nFilePath activeProjectDirectory()\n{\n   if (!s_activeProjectPath.empty())\n   {\n      if (s_activeProjectPath.parent().exists())\n         return s_activeProjectPath.parent();\n      else\n         return FilePath();\n   }\n   else\n   {\n      return FilePath();\n   }\n}\n\n\nFilePath activeProjectFilePath()\n{\n   return s_activeProjectPath;\n}\n\nFilePath activeProjectScratchPath()\n{\n   if (s_activeProjectPath.empty())\n   {\n      return module_context::userScratchPath();\n   }\n   else\n   {\n      \/\/ one-time on-demand calculation of active project scratch path\n      if (s_activeProjectScratchPath.empty())\n      {\n         FilePath projectScratchPath = determineActiveProjectScratchPath();\n         if (!projectScratchPath.empty())\n            s_activeProjectScratchPath = projectScratchPath;\n         else\n            s_activeProjectScratchPath = module_context::userScratchPath();\n      }\n\n      \/\/ return the path\n      return s_activeProjectScratchPath;\n   }\n}\n\n} \/\/ namespace module_context\n\n\nnamespace projects {\n\nnamespace {\n\nconst int kStatusOk = 0;\nconst int kStatusNotExists = 1;\nconst int kStatusAlreadyExists = 2;\nconst int kStatusNoWriteAccess = 3;\n\njson::Object createProjectResult(int status, const FilePath& projectFilePath)\n{\n   json::Object result;\n   result[\"status\"] = status;\n   if (!projectFilePath.empty())\n   {\n      result[\"project_file_path\"] = module_context::createAliasedPath(\n                                                            projectFilePath);\n   }\n   else\n   {\n      result[\"project_file_path\"] = json::Value();\n   }\n   return result;\n}\n\njson::Object createProjectResult(int status)\n{\n   return createProjectResult(status, FilePath());\n}\n\nbool canWriteToProjectDir(const FilePath& projectDirPath)\n{\n   FilePath testFile = projectDirPath.complete(core::system::generateUuid());\n   Error error = core::writeStringToFile(testFile, \"test\");\n   if (error)\n   {\n      return false;\n   }\n   else\n   {\n      error = testFile.removeIfExists();\n      if (error)\n         LOG_ERROR(error);\n\n      return true;\n   }\n}\n\nError createProject(const json::JsonRpcRequest& request,\n                    json::JsonRpcResponse* pResponse)\n{\n   \/\/ determine project dir path\n   std::string projectDir;\n   Error error = json::readParam(request.params, 0, &projectDir);\n   if (error)\n      return error;\n   FilePath projectDirPath = module_context::resolveAliasedPath(projectDir);\n\n   \/\/ NOTE: currently we assume that the specified directory already\n   \/\/ exists (because it was chosen with the choose folder dialog). if\n   \/\/ our client ui changes and it doesn't exist (likely) then this\n   \/\/ code needs to auto-create it\n\n   \/\/ verify that it doesn't already have a project\n   FilePath existingProjFile = r_util::projectFromDirectory(projectDirPath);\n   if (!existingProjFile.empty())\n   {\n      pResponse->setResult(createProjectResult(kStatusAlreadyExists));\n      return Success();\n   }\n\n   \/\/ verify that we can write to the directory\n   if (!canWriteToProjectDir(projectDirPath))\n   {\n      pResponse->setResult(createProjectResult(kStatusNoWriteAccess));\n      return Success();\n   }\n\n   \/\/ create the project file\n   FilePath projectFilePath = projectDirPath.complete(\n                                    projectDirPath.filename() + \".Rproj\");\n   error = r_util::writeDefaultProjectFile(projectFilePath);\n   if (error)\n      return error;\n\n   \/\/ return it\n   pResponse->setResult(createProjectResult(kStatusOk, projectFilePath));\n   return Success();\n}\n\n\nError openProject(const json::JsonRpcRequest& request,\n                 json::JsonRpcResponse* pResponse)\n{\n   \/\/ determine project dir path\n   std::string projectDir;\n   Error error = json::readParam(request.params, 0, &projectDir);\n   if (error)\n      return error;\n   FilePath projectDirPath = module_context::resolveAliasedPath(projectDir);\n\n   \/\/ verify that the directory exists\n   if (!projectDirPath.exists())\n   {\n      pResponse->setResult(createProjectResult(kStatusNotExists));\n      return Success();\n   }\n\n   \/\/ see if there is project file\n   FilePath projectFilePath = r_util::projectFromDirectory(projectDirPath);\n   if (projectFilePath.empty())\n   {\n      pResponse->setResult(createProjectResult(kStatusNotExists));\n      return Success();\n   }\n\n   \/\/ test for write access\n   if (!canWriteToProjectDir(projectDirPath))\n   {\n      pResponse->setResult(createProjectResult(kStatusNoWriteAccess));\n      return Success();\n   }\n\n   \/\/ return the project file\n   pResponse->setResult(createProjectResult(kStatusOk, projectFilePath));\n   return Success();\n}\n\n}  \/\/ anonymous namespace\n\n\nError startup()\n{\n   \/\/ register suspend handler\n   using namespace module_context;\n   addSuspendHandler(SuspendHandler(onSuspend, onResume));\n\n   \/\/ see if there is a project path hard-wired for the next session\n   \/\/ (this would be used for a switch to project or for the resuming of\n   \/\/ a suspended session)\n   FilePath nextSessionProjectPath = persistentState().nextSessionProjectPath();\n   if (!nextSessionProjectPath.empty())\n   {\n      \/\/ reset next session project path so its a one shot deal\n      persistentState().setNextSessionProjectPath(FilePath());\n\n      \/\/ clear any initial context settings which may be leftover\n      \/\/ by a re-instatiation of rsession by desktop\n      session::options().clearInitialContextSettings();\n\n      \/\/ check for existence and set\n      if (nextSessionProjectPath.exists())\n      {\n         s_activeProjectPath = nextSessionProjectPath;\n      }\n      else\n      {\n         LOG_WARNING_MESSAGE(\"Next session project path doesn't exist: \" +\n                             nextSessionProjectPath.absolutePath());\n         s_activeProjectPath = FilePath();\n      }\n   }\n\n   \/\/ check for envrionment variable (file association)\n   else if (!session::options().initialProjectPath().empty())\n   {\n      s_activeProjectPath = session::options().initialProjectPath();\n   }\n\n   \/\/ check for other working dir override (implies a launch of a file\n   \/\/ but not of a project)\n   else if (!session::options().initialWorkingDirOverride().empty())\n   {\n      s_activeProjectPath = FilePath();\n   }\n\n   \/\/ check for restore based on settings\n   else if (userSettings().alwaysRestoreLastProject() &&\n            userSettings().lastProjectPath().exists())\n   {\n      s_activeProjectPath = userSettings().lastProjectPath();\n   }\n\n   \/\/ else no active project for this session\n   else\n   {\n      s_activeProjectPath = FilePath();\n   }\n\n   \/\/ last ditch check for writeabilty of the project directory\n   if (!s_activeProjectPath.empty() &&\n       !canWriteToProjectDir(s_activeProjectPath.parent()))\n   {\n      \/\/ enque a warning\n      json::Object warningBarEvent;\n      warningBarEvent[\"severe\"] = false;\n      warningBarEvent[\"message\"] =\n        \"Project '\" + s_activeProjectPath.parent().absolutePath() + \"' \"\n        \"could not be opened because it is located in a read-only directory.\";\n      ClientEvent event(client_events::kShowWarningBar, warningBarEvent);\n      module_context::enqueClientEvent(event);\n\n      \/\/ no project\n      s_activeProjectPath = FilePath();\n   }\n\n\n   \/\/ save the active project path for the next session\n   userSettings().setLastProjectPath(s_activeProjectPath);\n\n   return Success();\n}\n\nError initialize()\n{\n   using boost::bind;\n   using namespace module_context;\n   ExecBlock initBlock ;\n   initBlock.addFunctions()\n      (bind(registerRpcMethod, \"create_project\", createProject))\n      (bind(registerRpcMethod, \"open_project\", openProject))\n   ;\n   return initBlock.execute();\n}\n\n} \/\/ namespace projects\n} \/\/ namesapce session\n\n<|endoftext|>"}
{"text":"<commit_before>#include <cppunit\/TestFailure.h>\n#include <cppunit\/TestResultCollector.h>\n\n\nCPPUNIT_NS_BEGIN\n\n\nTestResultCollector::TestResultCollector( SynchronizationObject *syncObject )\n    : TestSuccessListener( syncObject )\n{\n  reset();\n}\n\n\nTestResultCollector::~TestResultCollector()\n{\n}\n\n\nvoid \nTestResultCollector::freeFailures()\n{\n  TestFailures::iterator itFailure = m_failures.begin();\n  while ( itFailure != m_failures.end() )\n    delete *itFailure++;\n}\n\n\nvoid \nTestResultCollector::reset()\n{\n  TestSuccessListener::reset();\n\n  ExclusiveZone zone( m_syncObject ); \n  freeFailures();\n  m_testErrors = 0;\n  m_tests.clear();\n  m_failures.clear();\n}\n\n\nvoid \nTestResultCollector::startTest( Test *test )\n{\n  ExclusiveZone zone (m_syncObject); \n  m_tests.push_back( test );\n}\n\n\nvoid \nTestResultCollector::addFailure( const TestFailure &failure )\n{\n  TestSuccessListener::addFailure( failure );\n\n  ExclusiveZone zone( m_syncObject ); \n  if ( failure.isError() )\n    ++m_testErrors;\n  m_failures.push_back( failure.clone() );\n}\n\n\n\/\/\/ Gets the number of run tests.\nint \nTestResultCollector::runTests() const\n{ \n  ExclusiveZone zone( m_syncObject ); \n  return m_tests.size(); \n}\n\n\n\/\/\/ Gets the number of detected errors (uncaught exception).\nint \nTestResultCollector::testErrors() const\n{ \n  ExclusiveZone zone( m_syncObject );\n  return m_testErrors;\n}\n\n\n\/\/\/ Gets the number of detected failures (failed assertion).\nint \nTestResultCollector::testFailures() const\n{ \n  ExclusiveZone zone( m_syncObject ); \n  return m_failures.size() - m_testErrors;\n}\n\n\n\/\/\/ Gets the total number of detected failures.\nint \nTestResultCollector::testFailuresTotal() const\n{\n  ExclusiveZone zone( m_syncObject ); \n  return m_failures.size();\n}\n\n\n\/\/\/ Returns a the list failures (random access collection).\nconst TestResultCollector::TestFailures & \nTestResultCollector::failures() const\n{ \n  ExclusiveZone zone( m_syncObject );\n  return m_failures; \n}\n\n\nconst TestResultCollector::Tests &\nTestResultCollector::tests() const\n{\n  ExclusiveZone zone( m_syncObject );\n  return m_tests;\n}\n\n\nCPPUNIT_NS_END\n\n<commit_msg>src\/cppunit\/TestResultCollector.cpp: fixed memory leak in destructor.<commit_after>#include <cppunit\/TestFailure.h>\n#include <cppunit\/TestResultCollector.h>\n\n\nCPPUNIT_NS_BEGIN\n\n\nTestResultCollector::TestResultCollector( SynchronizationObject *syncObject )\n    : TestSuccessListener( syncObject )\n{\n  reset();\n}\n\n\nTestResultCollector::~TestResultCollector()\n{\n  freeFailures();\n}\n\n\nvoid \nTestResultCollector::freeFailures()\n{\n  TestFailures::iterator itFailure = m_failures.begin();\n  while ( itFailure != m_failures.end() )\n    delete *itFailure++;\n  m_failures.clear();\n}\n\n\nvoid \nTestResultCollector::reset()\n{\n  TestSuccessListener::reset();\n\n  ExclusiveZone zone( m_syncObject ); \n  freeFailures();\n  m_testErrors = 0;\n  m_tests.clear();\n}\n\n\nvoid \nTestResultCollector::startTest( Test *test )\n{\n  ExclusiveZone zone (m_syncObject); \n  m_tests.push_back( test );\n}\n\n\nvoid \nTestResultCollector::addFailure( const TestFailure &failure )\n{\n  TestSuccessListener::addFailure( failure );\n\n  ExclusiveZone zone( m_syncObject ); \n  if ( failure.isError() )\n    ++m_testErrors;\n  m_failures.push_back( failure.clone() );\n}\n\n\n\/\/\/ Gets the number of run tests.\nint \nTestResultCollector::runTests() const\n{ \n  ExclusiveZone zone( m_syncObject ); \n  return m_tests.size(); \n}\n\n\n\/\/\/ Gets the number of detected errors (uncaught exception).\nint \nTestResultCollector::testErrors() const\n{ \n  ExclusiveZone zone( m_syncObject );\n  return m_testErrors;\n}\n\n\n\/\/\/ Gets the number of detected failures (failed assertion).\nint \nTestResultCollector::testFailures() const\n{ \n  ExclusiveZone zone( m_syncObject ); \n  return m_failures.size() - m_testErrors;\n}\n\n\n\/\/\/ Gets the total number of detected failures.\nint \nTestResultCollector::testFailuresTotal() const\n{\n  ExclusiveZone zone( m_syncObject ); \n  return m_failures.size();\n}\n\n\n\/\/\/ Returns a the list failures (random access collection).\nconst TestResultCollector::TestFailures & \nTestResultCollector::failures() const\n{ \n  ExclusiveZone zone( m_syncObject );\n  return m_failures; \n}\n\n\nconst TestResultCollector::Tests &\nTestResultCollector::tests() const\n{\n  ExclusiveZone zone( m_syncObject );\n  return m_tests;\n}\n\n\nCPPUNIT_NS_END\n\n<|endoftext|>"}
{"text":"<commit_before>\/* * This file is part of meego-keyboard *\n *\n * Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n * All rights reserved.\n * Contact: Nokia Corporation (directui@nokia.com)\n *\n * If you have questions regarding the use of this file, please contact\n * Nokia at directui@nokia.com.\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1 as published by the Free Software Foundation\n * and appearing in the file LICENSE.LGPL included in the packaging\n * of this file.\n *\/\n\n\n\n#include \"mreactionmaptester.h\"\n\n#include \"mgconfitem_stub.h\"\n#include \"mvirtualkeyboard.h\"\n#include \"mvirtualkeyboardstyle.h\"\n#include \"horizontalswitcher.h\"\n#include \"keyevent.h\"\n#include \"mimabstractkeyarea.h\"\n#include \"layoutsmanager.h\"\n#include \"regiontracker.h\"\n#include \"reactionmappainter.h\"\n#include \"symbolview.h\"\n#include \"ut_symbolview.h\"\n#include \"mplainwindow.h\"\n#include \"utils.h\"\n\n#include <MApplication>\n#include <MButton>\n#include <MScene>\n#include <MSceneManager>\n#include <MSceneWindow>\n#include <MTheme>\n\n#include <QDir>\n#include <QGraphicsLinearLayout>\n#include <QSignalSpy>\n\nnamespace\n{\n    const QString InputMethodSettingName(\"\/meegotouch\/inputmethods\/virtualkeyboard\/layouts\");\n    const QString LocalTestLayout(TESTLAYOUTFILEPATH_LOCAL);\n    const QString InstalledTestLayout(TESTLAYOUTFILEPATH_INSTALLED);\n\n    const QString TargetSettingsName(\"\/meegotouch\/target\/name\");\n    const QString DefaultTargetName(\"Default\");\n\n    const int SceneRotationTime = 1400;\n} \/\/ namespace\n\nQ_DECLARE_METATYPE(QList<QPoint>)\nQ_DECLARE_METATYPE(HorizontalSwitcher::SwitchDirection)\n\nvoid Ut_SymbolView::initTestCase()\n{\n    static int argc = 2;\n    static char *app_name[2] = { (char *) \"ut_symbolview\",\n                                 (char *) \"-software\" };\n\n    if (QFile::exists(LocalTestLayout)) {\n        testLayoutFile = LocalTestLayout;\n    } else if (QFile::exists(InstalledTestLayout)) {\n        testLayoutFile = InstalledTestLayout;\n    } else {\n        QFAIL(QString(\"Test symbol layout does not exist.\\n\"\n                      \"Checked \" + LocalTestLayout + \" and \" + InstalledTestLayout + \".\").toAscii().data());\n    }\n\n    qDebug() << \"Using test symbol layout from file: \" << testLayoutFile;\n\n    disableQtPlugins();\n\n    MGConfItem target(TargetSettingsName);\n    target.set(DefaultTargetName); \/\/ this value is required by the theme daemon\n\n    app = new MApplication(argc, app_name);\n    style = new MVirtualKeyboardStyleContainer;\n    style->initialize(\"MVirtualKeyboard\", \"MVirtualKeyboardView\", 0);\n\n    ReactionMapPainter::createInstance();\n\n    MGConfItem inputMethodSetting(InputMethodSettingName);\n\n    QStringList langlist;\n    langlist << testLayoutFile;\n    inputMethodSetting.set(QVariant(langlist));\n\n    LayoutsManager::createInstance();\n\n    qRegisterMetaType<KeyEvent>(\"KeyEvent\");\n\n    new MPlainWindow;\n    RegionTracker::createInstance();\n}\n\nvoid Ut_SymbolView::cleanupTestCase()\n{\n    RegionTracker::destroyInstance();\n    ReactionMapPainter::destroyInstance();\n    delete MPlainWindow::instance();\n    LayoutsManager::destroyInstance();\n    delete style;\n    style = 0;\n    delete app;\n    app = 0;\n}\n\nvoid Ut_SymbolView::init()\n{\n    subject = new SymbolView(LayoutsManager::instance(), style, testLayoutFile);\n\n    \/\/ Add to scene so reaction maps are drawn.\n    \/\/ SymView needs scene window as parent so positions itself correctly\n    \/\/ in the scene in portrait mode.\n    parent = new MSceneWindow;\n    MPlainWindow::instance()->sceneManager()->appearSceneWindowNow(parent);\n    subject->setParentItem(parent);\n}\n\nvoid Ut_SymbolView::cleanup()\n{\n    \/\/ Make sure default stub is restored.\n    gMReactionMapStub = &gDefaultMReactionMapStub;\n\n    MPlainWindow::instance()->sceneManager()->appearSceneWindowNow(parent);\n    subject->setParentItem(0);\n    delete parent;\n    delete subject;\n    subject = 0;\n}\n\nvoid Ut_SymbolView::testReactiveButtonAreas_data()\n{\n    QTest::addColumn<int>(\"orientationAngle\");\n\n    QTest::newRow(\"Angle 0\") << 0;\n    QTest::newRow(\"Angle 90\") << 90;\n}\n\nvoid Ut_SymbolView::testReactiveButtonAreas()\n{\n    QFETCH(int, orientationAngle);;\n\n    rotateToAngle(static_cast<M::OrientationAngle>(orientationAngle));\n\n    MReactionMapTester tester;\n    gMReactionMapStub = &tester;\n\n    QGraphicsView *view = MPlainWindow::instance();\n\n    \/\/ Clear with transparent color\n    gMReactionMapStub->setTransparentDrawingValue();\n    gMReactionMapStub->setTransform(QTransform());\n    gMReactionMapStub->fillRectangle(0, 0, gMReactionMapStub->width(), gMReactionMapStub->height());\n\n    subject->showSymbolView();\n\n    subject->paintReactionMap(MReactionMap::instance(view), view);\n\n    \/\/ Check that all buttons are covered by reactive area\n    QVERIFY(tester.testChildButtonReactiveAreas(view, subject));\n\n    \/\/ Test the next tab also.\n    subject->switchToNextPage();\n    QTest::qWait(600);\n    QVERIFY(!subject->pageSwitcher->isRunning());\n\n    \/\/ However since we don't have MKeyboardHost here we call this directly again.\n    gMReactionMapStub->setTransparentDrawingValue();\n    gMReactionMapStub->setTransform(QTransform());\n    gMReactionMapStub->fillRectangle(0, 0, gMReactionMapStub->width(), gMReactionMapStub->height());\n    subject->paintReactionMap(MReactionMap::instance(view), view);\n\n    \/\/ Check that all buttons are covered by reactive area\n    QVERIFY(tester.testChildButtonReactiveAreas(view, subject));\n\n    \/\/ Following coordinates will be given in subject coordinates.\n    gMReactionMapStub->setTransform(subject, view);\n\n    \/\/ Check locations that should be inactive. This test is really only for\n    \/\/ testing that at least something is drawn inactive, and not only reactive\n    \/\/ areas are drawn.\n    \/\/ Inactive areas should be drawn because second page in testsymbols.xml\n    \/\/ has second row with spacers at the beginning and at the end of the row.\n    const QRectF br(subject->boundingRect());\n    QList<QPoint> inactiveLocations;\n    inactiveLocations\n            << QPoint(br.left(), br.bottom() - 1) \/\/ Left margin, second row\n            << QPoint(br.right() - 1, br.bottom() - 1); \/\/ Right margin, second row\n\n    foreach(const QPointF & pos, inactiveLocations) {\n        QCOMPARE(tester.colorAt(pos), MReactionMapTester::Inactive);\n    }\n}\n\nvoid Ut_SymbolView::testReactiveWholeScreen_data()\n{\n    QTest::addColumn<int>(\"orientationAngle\");\n\n    QTest::newRow(\"Angle 0\") << 0;\n    QTest::newRow(\"Angle 90\") << 90;\n    QTest::newRow(\"Angle 180\") << 180;\n    QTest::newRow(\"Angle 270\") << 270;\n}\n\nvoid Ut_SymbolView::testReactiveWholeScreen()\n{\n    QFETCH(int, orientationAngle);\n\n    rotateToAngle(static_cast<M::OrientationAngle>(orientationAngle));\n\n    MReactionMapTester tester;\n    gMReactionMapStub = &tester;\n    \/\/ Clear with transparent\n    gMReactionMapStub->setTransparentDrawingValue();\n    gMReactionMapStub->setTransform(QTransform());\n    gMReactionMapStub->fillRectangle(0, 0, gMReactionMapStub->width(), gMReactionMapStub->height());\n\n    subject->showSymbolView();\n\n    subject->paintReactionMap(MReactionMap::instance(MPlainWindow::instance()), MPlainWindow::instance());\n\n    const bool gridpass = tester.testReactionMapGrid(\n                              MPlainWindow::instance(),\n                              20, 50, subject->interactiveRegion(),\n                              subject);\n\n    QVERIFY(gridpass);\n\n    gMReactionMapStub = &gDefaultMReactionMapStub;\n}\n\n\nvoid Ut_SymbolView::testOthers()\n{\n    \/\/at least we should not crash\n    subject->organizeContent();\n\n    subject->hideSymbolView();\n    subject->showSymbolView();\n}\n\nvoid Ut_SymbolView::testChangeToOpenMode()\n{\n    subject->showSymbolView();\n    QVERIFY(subject->isActive() == true);\n    subject->hideSymbolView();\n    QVERIFY(subject->isActive() == false);\n}\n\nvoid Ut_SymbolView::testChangeTab_data()\n{\n    QTest::addColumn<int>(\"initialTabIndex\");\n    QTest::addColumn<HorizontalSwitcher::SwitchDirection>(\"direction\");\n    QTest::addColumn<int>(\"finalTabIndex\"); \/\/ expected\n\n    QTest::newRow(\"Next tab\")   << 0 << HorizontalSwitcher::Right << 1;\n    QTest::newRow(\"Prev tab\")   << 1 << HorizontalSwitcher::Left << 0;\n}\n\nvoid Ut_SymbolView::testChangeTab()\n{\n    QFETCH(int, initialTabIndex);\n    QFETCH(HorizontalSwitcher::SwitchDirection, direction);\n    QFETCH(int, finalTabIndex);\n\n    subject->pageSwitcher->setDuration(0);\n    subject->pageSwitcher->setCurrent(initialTabIndex);\n\n    QCOMPARE(subject->activePage, subject->pageSwitcher->current());\n\n    if (direction == HorizontalSwitcher::Right) {\n        subject->switchToNextPage();\n    } else if (direction == HorizontalSwitcher::Left){\n        subject->switchToPrevPage();\n    }\n\n    QCOMPARE(subject->activePage, finalTabIndex);\n}\n\nvoid Ut_SymbolView::testHideWithFlick_data()\n{\n    QTest::addColumn<int>(\"tabIndex\");\n    QTest::newRow(\"Sym tab\") << 0;\n    QTest::newRow(\"Ace tab\") << 1;\n}\n\n\nvoid Ut_SymbolView::testHideWithFlick()\n{\n    QFETCH(int, tabIndex);\n    QVERIFY(subject->pageSwitcher && subject->pageSwitcher->count() >= tabIndex);\n    MImAbstractKeyArea *page = static_cast<MImAbstractKeyArea *>(subject->pageSwitcher->widget(tabIndex));\n\n    \/\/ Using qtest rows we dont need to worry about symbol view's show\/hide timers\n    \/\/ ignoring the call because subject is re-created every time.\n    subject->showSymbolView();\n    QCOMPARE(subject->isActive(), true);\n    emit page->flickDown();\n    QCOMPARE(subject->isActive(), false);\n}\n\n\nvoid Ut_SymbolView::testSetLayout()\n{\n    \/\/ set an invalid layout, at least it won't crash\n    \/\/ and still has the laste valid layout.\n    QString oldLayout = subject->currentLayout;\n    subject->setLayout(\"ThisLayoutShouldNotExist\");\n    QVERIFY(subject->currentLayout != \"ThisLayoutShouldNotExist\");\n    QCOMPARE(subject->currentLayout, oldLayout);\n}\n\nvoid Ut_SymbolView::testHardwareState()\n{\n    subject->setKeyboardState(MInputMethod::OnScreen);\n    QCOMPARE(subject->activeState, MInputMethod::OnScreen);\n\n    \/\/ Make sure were in landscape mode when in hardware state\n    rotateToAngle(M::Angle0);\n\n    subject->setKeyboardState(MInputMethod::Hardware);\n    QCOMPARE(subject->activeState, MInputMethod::Hardware);\n}\n\nvoid Ut_SymbolView::testSetTemporarilyHidden()\n{\n    QCOMPARE(subject->activity, SymbolView::Inactive);\n\n    subject->setTemporarilyHidden(true);\n    QCOMPARE(subject->activity, SymbolView::Inactive);\n\n    subject->setTemporarilyHidden(false);\n    QCOMPARE(subject->activity, SymbolView::Inactive);\n\n    subject->showSymbolView();\n\n    QTest::qWait(200);\n\n    QCOMPARE(subject->activity, SymbolView::Active);\n\n    subject->setTemporarilyHidden(false);\n    QCOMPARE(subject->activity, SymbolView::Active);\n\n    subject->setTemporarilyHidden(true);\n    QCOMPARE(subject->activity, SymbolView::TemporarilyInactive);\n\n    QTest::qWait(200);\n\n    subject->setTemporarilyHidden(false);\n    QCOMPARE(subject->activity, SymbolView::Active);\n}\n\nvoid Ut_SymbolView::testQuickPick_data()\n{\n    typedef QList<QPoint> KeyList;\n    QTest::addColumn<KeyList>(\"keyList\");\n    QTest::addColumn<bool>(\"expectedIsActive\");\n\n    const QPoint quickPickKey(0, 0); \/\/ '@'\n    const QPoint normalKey(1, 0);\n\n    QTest::newRow(\"Normal key click, symbol view stays open.\")\n        << (KeyList() << normalKey) << true;\n\n    QTest::newRow(\"Quick key click, symbol view closes\")\n        << (KeyList() << quickPickKey) << false;\n\n    \/\/ Symbol view doesn't close if quick pick key is not the first\n    \/\/ to be clicked.\n    QTest::newRow(\"Quick pick not first 1\") << (KeyList() << normalKey << quickPickKey) << true;\n    QTest::newRow(\"Quick pick not first 2\") << (KeyList() << normalKey << normalKey << quickPickKey) << true;\n}\n\nvoid Ut_SymbolView::testQuickPick()\n{\n    QFETCH(QList<QPoint>, keyList);\n    QFETCH(bool, expectedIsActive);\n\n    MImAbstractKeyArea *page = static_cast<MImAbstractKeyArea *>(subject->pageSwitcher->widget(0));\n\n    subject->showSymbolView();\n    QCOMPARE(subject->isActive(), true);\n\n    foreach (QPoint keyLocation, keyList) {\n        MImAbstractKey *key = keyAt(page, keyLocation.y(), keyLocation.x());\n        QVERIFY(key);\n\n        page->click(key);\n    }\n\n    QCOMPARE(subject->isActive(), expectedIsActive);\n}\n\nvoid Ut_SymbolView::rotateToAngle(M::OrientationAngle angle)\n{\n    subject->prepareToOrientationChange();\n    MPlainWindow::instance()->setOrientationAngle(angle);\n    QTest::qWait(SceneRotationTime);\/\/ wait until MSceneManager::orientationAngle() is updated.\n    subject->finalizeOrientationChange();\n}\n\n\/\/ Helper method to get key in certain row and column from current subject.\nMImAbstractKey *Ut_SymbolView::keyAt(MImAbstractKeyArea *symPage,\n                                     unsigned int row,\n                                     unsigned int column) const\n{\n    Q_ASSERT(symPage\n             && (row < static_cast<unsigned int>(symPage->rowCount()))\n             && (column < static_cast<unsigned int>(symPage->sectionModel()->columnsAt(row))));\n\n    MImAbstractKey *key = 0;\n\n    MImKeyArea *buttonArea = dynamic_cast<MImKeyArea *>(symPage);\n    if (buttonArea) {\n        key = buttonArea->rowList[row].keys[column];\n    }\n\n    return key;\n}\n\n\nQTEST_APPLESS_MAIN(Ut_SymbolView);\n<commit_msg>Changes: Fix the ut_symbolview test<commit_after>\/* * This file is part of meego-keyboard *\n *\n * Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n * All rights reserved.\n * Contact: Nokia Corporation (directui@nokia.com)\n *\n * If you have questions regarding the use of this file, please contact\n * Nokia at directui@nokia.com.\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1 as published by the Free Software Foundation\n * and appearing in the file LICENSE.LGPL included in the packaging\n * of this file.\n *\/\n\n\n\n#include \"mreactionmaptester.h\"\n\n#include \"mgconfitem_stub.h\"\n#include \"mvirtualkeyboard.h\"\n#include \"mvirtualkeyboardstyle.h\"\n#include \"horizontalswitcher.h\"\n#include \"keyevent.h\"\n#include \"mimabstractkeyarea.h\"\n#include \"layoutsmanager.h\"\n#include \"regiontracker.h\"\n#include \"reactionmappainter.h\"\n#include \"symbolview.h\"\n#include \"ut_symbolview.h\"\n#include \"mplainwindow.h\"\n#include \"utils.h\"\n\n#include <MApplication>\n#include <MButton>\n#include <MScene>\n#include <MSceneManager>\n#include <MSceneWindow>\n#include <MTheme>\n\n#include <QDir>\n#include <QGraphicsLinearLayout>\n#include <QSignalSpy>\n\nnamespace\n{\n    const QString InputMethodSettingName(\"\/meegotouch\/inputmethods\/virtualkeyboard\/layouts\");\n    const QString LocalTestLayout(TESTLAYOUTFILEPATH_LOCAL);\n    const QString InstalledTestLayout(TESTLAYOUTFILEPATH_INSTALLED);\n\n    const QString TargetSettingsName(\"\/meegotouch\/target\/name\");\n    const QString DefaultTargetName(\"Default\");\n\n    const int SceneRotationTime = 1400;\n} \/\/ namespace\n\nQ_DECLARE_METATYPE(QList<QPoint>)\nQ_DECLARE_METATYPE(HorizontalSwitcher::SwitchDirection)\n\nvoid Ut_SymbolView::initTestCase()\n{\n    static int argc = 2;\n    static char *app_name[2] = { (char *) \"ut_symbolview\",\n                                 (char *) \"-software\" };\n\n    if (QFile::exists(LocalTestLayout)) {\n        testLayoutFile = LocalTestLayout;\n    } else if (QFile::exists(InstalledTestLayout)) {\n        testLayoutFile = InstalledTestLayout;\n    } else {\n        QFAIL(QString(\"Test symbol layout does not exist.\\n\"\n                      \"Checked \" + LocalTestLayout + \" and \" + InstalledTestLayout + \".\").toAscii().data());\n    }\n\n    qDebug() << \"Using test symbol layout from file: \" << testLayoutFile;\n\n    disableQtPlugins();\n\n    MGConfItem target(TargetSettingsName);\n    target.set(DefaultTargetName); \/\/ this value is required by the theme daemon\n\n    app = new MApplication(argc, app_name);\n    style = new MVirtualKeyboardStyleContainer;\n    style->initialize(\"MVirtualKeyboard\", \"MVirtualKeyboardView\", 0);\n\n    ReactionMapPainter::createInstance();\n\n    MGConfItem inputMethodSetting(InputMethodSettingName);\n\n    QStringList langlist;\n    langlist << testLayoutFile;\n    inputMethodSetting.set(QVariant(langlist));\n\n    LayoutsManager::createInstance();\n\n    qRegisterMetaType<KeyEvent>(\"KeyEvent\");\n\n    new MPlainWindow;\n    RegionTracker::createInstance();\n}\n\nvoid Ut_SymbolView::cleanupTestCase()\n{\n    RegionTracker::destroyInstance();\n    ReactionMapPainter::destroyInstance();\n    delete MPlainWindow::instance();\n    LayoutsManager::destroyInstance();\n    delete style;\n    style = 0;\n    delete app;\n    app = 0;\n}\n\nvoid Ut_SymbolView::init()\n{\n    subject = new SymbolView(LayoutsManager::instance(), style, testLayoutFile);\n\n    \/\/ Add to scene so reaction maps are drawn.\n    \/\/ SymView needs scene window as parent so positions itself correctly\n    \/\/ in the scene in portrait mode.\n    parent = new MSceneWindow;\n    MPlainWindow::instance()->sceneManager()->appearSceneWindowNow(parent);\n    subject->setParentItem(parent);\n}\n\nvoid Ut_SymbolView::cleanup()\n{\n    \/\/ Make sure default stub is restored.\n    gMReactionMapStub = &gDefaultMReactionMapStub;\n\n    MPlainWindow::instance()->sceneManager()->appearSceneWindowNow(parent);\n    subject->setParentItem(0);\n    delete parent;\n    delete subject;\n    subject = 0;\n}\n\nvoid Ut_SymbolView::testReactiveButtonAreas_data()\n{\n    QTest::addColumn<int>(\"orientationAngle\");\n\n    QTest::newRow(\"Angle 0\") << 0;\n    QTest::newRow(\"Angle 90\") << 90;\n}\n\nvoid Ut_SymbolView::testReactiveButtonAreas()\n{\n    QFETCH(int, orientationAngle);;\n\n    rotateToAngle(static_cast<M::OrientationAngle>(orientationAngle));\n\n    MReactionMapTester tester;\n    gMReactionMapStub = &tester;\n\n    QGraphicsView *view = MPlainWindow::instance();\n\n    \/\/ Clear with transparent color\n    gMReactionMapStub->setTransparentDrawingValue();\n    gMReactionMapStub->setTransform(QTransform());\n    gMReactionMapStub->fillRectangle(0, 0, gMReactionMapStub->width(), gMReactionMapStub->height());\n\n    subject->showSymbolView();\n\n    subject->paintReactionMap(MReactionMap::instance(view), view);\n\n    \/\/ Check that all buttons are covered by reactive area\n    QVERIFY(tester.testChildButtonReactiveAreas(view, subject));\n\n    \/\/ Check if the symbol view is aware about the right orientation\n    if ((orientationAngle == M::Angle0\n        && subject->boundingRect().width() != view->width())\n        || (orientationAngle == M::Angle90\n            && subject->boundingRect().width() != view->height())) {\n        QSKIP(\"The orientation of the symbol view is wrong (MWindow is broken)\", SkipSingle);\n    }\n    \/\/ Test the next tab also.\n    subject->switchToNextPage();\n    QTest::qWait(600);\n    QVERIFY(!subject->pageSwitcher->isRunning());\n\n    \/\/ However since we don't have MKeyboardHost here we call this directly again.\n    gMReactionMapStub->setTransparentDrawingValue();\n    gMReactionMapStub->setTransform(QTransform());\n    gMReactionMapStub->fillRectangle(0, 0, gMReactionMapStub->width(), gMReactionMapStub->height());\n    subject->paintReactionMap(MReactionMap::instance(view), view);\n\n    \/\/ Check that all buttons are covered by reactive area\n    QVERIFY(tester.testChildButtonReactiveAreas(view, subject));\n\n    \/\/ Following coordinates will be given in subject coordinates.\n    gMReactionMapStub->setTransform(subject, view);\n\n    \/\/ Check locations that should be inactive. This test is really only for\n    \/\/ testing that at least something is drawn inactive, and not only reactive\n    \/\/ areas are drawn.\n    \/\/ Inactive areas should be drawn because second page in testsymbols.xml\n    \/\/ has second row with spacers at the beginning and at the end of the row.\n    const QRectF br(subject->boundingRect());\n    QList<QPoint> inactiveLocations;\n    inactiveLocations\n            << QPoint(br.left(), br.bottom() - 1) \/\/ Left margin, second row\n            << QPoint(br.right() - 1, br.bottom() - 1); \/\/ Right margin, second row\n\n    foreach(const QPointF & pos, inactiveLocations) {\n        QCOMPARE(tester.colorAt(pos), MReactionMapTester::Inactive);\n    }\n}\n\nvoid Ut_SymbolView::testReactiveWholeScreen_data()\n{\n    QTest::addColumn<int>(\"orientationAngle\");\n\n    QTest::newRow(\"Angle 0\") << 0;\n    QTest::newRow(\"Angle 90\") << 90;\n    QTest::newRow(\"Angle 180\") << 180;\n    QTest::newRow(\"Angle 270\") << 270;\n}\n\nvoid Ut_SymbolView::testReactiveWholeScreen()\n{\n    QFETCH(int, orientationAngle);\n\n    rotateToAngle(static_cast<M::OrientationAngle>(orientationAngle));\n\n    MReactionMapTester tester;\n    gMReactionMapStub = &tester;\n    \/\/ Clear with transparent\n    gMReactionMapStub->setTransparentDrawingValue();\n    gMReactionMapStub->setTransform(QTransform());\n    gMReactionMapStub->fillRectangle(0, 0, gMReactionMapStub->width(), gMReactionMapStub->height());\n\n    subject->showSymbolView();\n\n    subject->paintReactionMap(MReactionMap::instance(MPlainWindow::instance()), MPlainWindow::instance());\n\n    const bool gridpass = tester.testReactionMapGrid(\n                              MPlainWindow::instance(),\n                              20, 50, subject->interactiveRegion(),\n                              subject);\n\n    QVERIFY(gridpass);\n\n    gMReactionMapStub = &gDefaultMReactionMapStub;\n}\n\n\nvoid Ut_SymbolView::testOthers()\n{\n    \/\/at least we should not crash\n    subject->organizeContent();\n\n    subject->hideSymbolView();\n    subject->showSymbolView();\n}\n\nvoid Ut_SymbolView::testChangeToOpenMode()\n{\n    subject->showSymbolView();\n    QVERIFY(subject->isActive() == true);\n    subject->hideSymbolView();\n    QVERIFY(subject->isActive() == false);\n}\n\nvoid Ut_SymbolView::testChangeTab_data()\n{\n    QTest::addColumn<int>(\"initialTabIndex\");\n    QTest::addColumn<HorizontalSwitcher::SwitchDirection>(\"direction\");\n    QTest::addColumn<int>(\"finalTabIndex\"); \/\/ expected\n\n    QTest::newRow(\"Next tab\")   << 0 << HorizontalSwitcher::Right << 1;\n    QTest::newRow(\"Prev tab\")   << 1 << HorizontalSwitcher::Left << 0;\n}\n\nvoid Ut_SymbolView::testChangeTab()\n{\n    QFETCH(int, initialTabIndex);\n    QFETCH(HorizontalSwitcher::SwitchDirection, direction);\n    QFETCH(int, finalTabIndex);\n\n    subject->pageSwitcher->setDuration(0);\n    subject->pageSwitcher->setCurrent(initialTabIndex);\n\n    QCOMPARE(subject->activePage, subject->pageSwitcher->current());\n\n    if (direction == HorizontalSwitcher::Right) {\n        subject->switchToNextPage();\n    } else if (direction == HorizontalSwitcher::Left){\n        subject->switchToPrevPage();\n    }\n\n    QCOMPARE(subject->activePage, finalTabIndex);\n}\n\nvoid Ut_SymbolView::testHideWithFlick_data()\n{\n    QTest::addColumn<int>(\"tabIndex\");\n    QTest::newRow(\"Sym tab\") << 0;\n    QTest::newRow(\"Ace tab\") << 1;\n}\n\n\nvoid Ut_SymbolView::testHideWithFlick()\n{\n    QFETCH(int, tabIndex);\n    QVERIFY(subject->pageSwitcher && subject->pageSwitcher->count() >= tabIndex);\n    MImAbstractKeyArea *page = static_cast<MImAbstractKeyArea *>(subject->pageSwitcher->widget(tabIndex));\n\n    \/\/ Using qtest rows we dont need to worry about symbol view's show\/hide timers\n    \/\/ ignoring the call because subject is re-created every time.\n    subject->showSymbolView();\n    QCOMPARE(subject->isActive(), true);\n    emit page->flickDown();\n    QCOMPARE(subject->isActive(), false);\n}\n\n\nvoid Ut_SymbolView::testSetLayout()\n{\n    \/\/ set an invalid layout, at least it won't crash\n    \/\/ and still has the laste valid layout.\n    QString oldLayout = subject->currentLayout;\n    subject->setLayout(\"ThisLayoutShouldNotExist\");\n    QVERIFY(subject->currentLayout != \"ThisLayoutShouldNotExist\");\n    QCOMPARE(subject->currentLayout, oldLayout);\n}\n\nvoid Ut_SymbolView::testHardwareState()\n{\n    subject->setKeyboardState(MInputMethod::OnScreen);\n    QCOMPARE(subject->activeState, MInputMethod::OnScreen);\n\n    \/\/ Make sure were in landscape mode when in hardware state\n    rotateToAngle(M::Angle0);\n\n    subject->setKeyboardState(MInputMethod::Hardware);\n    QCOMPARE(subject->activeState, MInputMethod::Hardware);\n}\n\nvoid Ut_SymbolView::testSetTemporarilyHidden()\n{\n    QCOMPARE(subject->activity, SymbolView::Inactive);\n\n    subject->setTemporarilyHidden(true);\n    QCOMPARE(subject->activity, SymbolView::Inactive);\n\n    subject->setTemporarilyHidden(false);\n    QCOMPARE(subject->activity, SymbolView::Inactive);\n\n    subject->showSymbolView();\n\n    QTest::qWait(200);\n\n    QCOMPARE(subject->activity, SymbolView::Active);\n\n    subject->setTemporarilyHidden(false);\n    QCOMPARE(subject->activity, SymbolView::Active);\n\n    subject->setTemporarilyHidden(true);\n    QCOMPARE(subject->activity, SymbolView::TemporarilyInactive);\n\n    QTest::qWait(200);\n\n    subject->setTemporarilyHidden(false);\n    QCOMPARE(subject->activity, SymbolView::Active);\n}\n\nvoid Ut_SymbolView::testQuickPick_data()\n{\n    typedef QList<QPoint> KeyList;\n    QTest::addColumn<KeyList>(\"keyList\");\n    QTest::addColumn<bool>(\"expectedIsActive\");\n\n    const QPoint quickPickKey(0, 0); \/\/ '@'\n    const QPoint normalKey(1, 0);\n\n    QTest::newRow(\"Normal key click, symbol view stays open.\")\n        << (KeyList() << normalKey) << true;\n\n    QTest::newRow(\"Quick key click, symbol view closes\")\n        << (KeyList() << quickPickKey) << false;\n\n    \/\/ Symbol view doesn't close if quick pick key is not the first\n    \/\/ to be clicked.\n    QTest::newRow(\"Quick pick not first 1\") << (KeyList() << normalKey << quickPickKey) << true;\n    QTest::newRow(\"Quick pick not first 2\") << (KeyList() << normalKey << normalKey << quickPickKey) << true;\n}\n\nvoid Ut_SymbolView::testQuickPick()\n{\n    QFETCH(QList<QPoint>, keyList);\n    QFETCH(bool, expectedIsActive);\n\n    MImAbstractKeyArea *page = static_cast<MImAbstractKeyArea *>(subject->pageSwitcher->widget(0));\n\n    subject->showSymbolView();\n    QCOMPARE(subject->isActive(), true);\n\n    foreach (QPoint keyLocation, keyList) {\n        MImAbstractKey *key = keyAt(page, keyLocation.y(), keyLocation.x());\n        QVERIFY(key);\n\n        page->click(key);\n    }\n\n    QCOMPARE(subject->isActive(), expectedIsActive);\n}\n\nvoid Ut_SymbolView::rotateToAngle(M::OrientationAngle angle)\n{\n    subject->prepareToOrientationChange();\n    MPlainWindow::instance()->setOrientationAngle(angle);\n    QTest::qWait(SceneRotationTime);\/\/ wait until MSceneManager::orientationAngle() is updated.\n    subject->finalizeOrientationChange();\n}\n\n\/\/ Helper method to get key in certain row and column from current subject.\nMImAbstractKey *Ut_SymbolView::keyAt(MImAbstractKeyArea *symPage,\n                                     unsigned int row,\n                                     unsigned int column) const\n{\n    Q_ASSERT(symPage\n             && (row < static_cast<unsigned int>(symPage->rowCount()))\n             && (column < static_cast<unsigned int>(symPage->sectionModel()->columnsAt(row))));\n\n    MImAbstractKey *key = 0;\n\n    MImKeyArea *buttonArea = dynamic_cast<MImKeyArea *>(symPage);\n    if (buttonArea) {\n        key = buttonArea->rowList[row].keys[column];\n    }\n\n    return key;\n}\n\n\nQTEST_APPLESS_MAIN(Ut_SymbolView);\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * datasetscalar.cpp\n *\n *  Created on: May 4, 2012\n *      Author: schurade\n *\/\n#include <QtCore\/QDebug>\n\n#include \"datasetscalar.h\"\n\nDatasetScalar::DatasetScalar( QString filename, QVector<float> data, nifti_image* header ) :\n        DatasetNifti( filename, FNDT_NIFTI_SCALAR, header ), m_data( data )\n{\n    m_properties.set( FNPROP_COLORMAP, 0, 0, 4, true );\n    m_properties.set( FNPROP_INTERPOLATION, false, true );\n    m_properties.set( FNPROP_ALPHA, 1.0f, 0.0, 1.0, true );\n    m_properties.set( FNPROP_DIM, 1 );\n\n    examineDataset();\n}\n\nDatasetScalar::~DatasetScalar()\n{\n    m_data.clear();\n    glDeleteTextures( 1, &m_textureGLuint );\n}\n\nQVector<float>* DatasetScalar::getData()\n{\n    return &m_data;\n}\n\n\nvoid DatasetScalar::examineDataset()\n{\n    int nx = m_properties.get( FNPROP_NX ).toInt();\n    int ny = m_properties.get( FNPROP_NY ).toInt();\n    int nz = m_properties.get( FNPROP_NZ ).toInt();\n\n    float min = std::numeric_limits<float>::max();\n    float max = 0;\n\n    int size = nx * ny * nz;\n    for ( int i = 0; i < size; ++i )\n    {\n        min = qMin( min, m_data[i] );\n        max = qMax( max, m_data[i] );\n    }\n\n    m_properties.set( FNPROP_SIZE, static_cast<int>( size * sizeof(float) ) );\n    m_properties.set( FNPROP_MIN, min );\n    m_properties.set( FNPROP_MAX, max );\n\n    m_properties.set( FNPROP_LOWER_THRESHOLD, min, min, max, true );\n    m_properties.set( FNPROP_UPPER_THRESHOLD, max, min, max, true );\n\n    if ( m_qform( 1, 1 ) < 0 || m_sform( 1, 1 ) < 0 )\n    {\n        qDebug() << m_properties.get( FNPROP_NAME ).toString() << \": RADIOLOGICAL orientation detected. Flipping voxels on X-Axis\";\n        flipX();\n    }\n}\n\nvoid DatasetScalar::createTexture()\n{\n    glPixelStorei( GL_UNPACK_ALIGNMENT, 1 );\n\n    glGenTextures( 1, &m_textureGLuint );\n\n    glBindTexture( GL_TEXTURE_3D, m_textureGLuint );\n\n    glTexParameteri( GL_TEXTURE_3D, GL_TEXTURE_MIN_FILTER, GL_NEAREST );\n    glTexParameteri( GL_TEXTURE_3D, GL_TEXTURE_MAG_FILTER, GL_NEAREST );\n    glTexParameteri( GL_TEXTURE_3D, GL_TEXTURE_WRAP_S, GL_CLAMP );\n    glTexParameteri( GL_TEXTURE_3D, GL_TEXTURE_WRAP_T, GL_CLAMP );\n    glTexParameteri( GL_TEXTURE_3D, GL_TEXTURE_WRAP_R, GL_CLAMP );\n\n    int nx = m_properties.get( FNPROP_NX ).toInt();\n    int ny = m_properties.get( FNPROP_NY ).toInt();\n    int nz = m_properties.get( FNPROP_NZ ).toInt();\n\n    float max = m_properties.get( FNPROP_MAX ).toFloat();\n\n    unsigned char* tmpData = new unsigned char[nx * ny * nz * 4];\n    for ( int i = 0; i < nx * ny * nz; ++i )\n    {\n        \/\/unsigned int tmp = (double)i \/ (double)(nx * ny * nz) * 256 * 256 * 256 * 256;\n        unsigned int tmp = ( m_data[i] \/ max ) * 256 * 256 * 256 * 256;\n        tmpData[4 * i + 3 ] = (tmp \/ (256 * 256 * 256)) % 256;\n        tmpData[4 * i + 2 ] = (tmp \/ (256 * 256)) % 256;\n        tmpData[4 * i + 1 ] = (tmp \/ (256)) % 256;\n        tmpData[4 * i + 0 ] = tmp % 256 ;\n    }\n\n    glTexImage3D( GL_TEXTURE_3D, 0, GL_RGBA, nx, ny, nz, 0, GL_RGBA, GL_UNSIGNED_BYTE, tmpData );\n    delete[] tmpData;\n\n}\n\nvoid DatasetScalar::flipX()\n{\n    int nx = m_properties.get( FNPROP_NX ).toInt();\n    int ny = m_properties.get( FNPROP_NY ).toInt();\n    int nz = m_properties.get( FNPROP_NZ ).toInt();\n\n    QVector<float> newData;\n\n    for ( int z = 0; z < nz; ++z )\n    {\n        for ( int y = 0; y < ny; ++y )\n        {\n            for ( int x = nx - 1; x >= 0; --x )\n            {\n                newData.push_back( m_data[x + y * nx + z * nx * ny] );\n            }\n        }\n    }\n\n    m_header->qoffset_x = 0.0;\n\n    m_header->qto_xyz.m[0][0] = qMax( m_header->qto_xyz.m[0][0], m_header->qto_xyz.m[0][0] * -1.0f );\n    m_header->sto_xyz.m[0][0] = qMax( m_header->sto_xyz.m[0][0], m_header->sto_xyz.m[0][0] * -1.0f );\n    m_header->qto_xyz.m[0][3] = 0.0;\n    m_header->sto_xyz.m[0][3] = 0.0;\n\n    m_data.clear();\n    m_data = newData;\n}\n\nvoid DatasetScalar::draw( QMatrix4x4 mvpMatrix, QMatrix4x4 mvMatrixInverse, DataStore* datastore )\n{\n}\n\nQString DatasetScalar::getValueAsString( int x, int y, int z )\n{\n    int nx = m_properties.get( FNPROP_NX ).toInt();\n    int ny = m_properties.get( FNPROP_NY ).toInt();\n    float data = m_data[x + y * nx + z * nx * ny];\n    return QString::number( data );\n}\n<commit_msg>only show viable colormaps<commit_after>\/*\n * datasetscalar.cpp\n *\n *  Created on: May 4, 2012\n *      Author: schurade\n *\/\n#include <QtCore\/QDebug>\n\n#include \"datasetscalar.h\"\n\nDatasetScalar::DatasetScalar( QString filename, QVector<float> data, nifti_image* header ) :\n        DatasetNifti( filename, FNDT_NIFTI_SCALAR, header ), m_data( data )\n{\n    m_properties.set( FNPROP_COLORMAP, 0, 0, 3, true );\n    m_properties.set( FNPROP_INTERPOLATION, false, true );\n    m_properties.set( FNPROP_ALPHA, 1.0f, 0.0, 1.0, true );\n    m_properties.set( FNPROP_DIM, 1 );\n\n    examineDataset();\n}\n\nDatasetScalar::~DatasetScalar()\n{\n    m_data.clear();\n    glDeleteTextures( 1, &m_textureGLuint );\n}\n\nQVector<float>* DatasetScalar::getData()\n{\n    return &m_data;\n}\n\n\nvoid DatasetScalar::examineDataset()\n{\n    int nx = m_properties.get( FNPROP_NX ).toInt();\n    int ny = m_properties.get( FNPROP_NY ).toInt();\n    int nz = m_properties.get( FNPROP_NZ ).toInt();\n\n    float min = std::numeric_limits<float>::max();\n    float max = 0;\n\n    int size = nx * ny * nz;\n    for ( int i = 0; i < size; ++i )\n    {\n        min = qMin( min, m_data[i] );\n        max = qMax( max, m_data[i] );\n    }\n\n    m_properties.set( FNPROP_SIZE, static_cast<int>( size * sizeof(float) ) );\n    m_properties.set( FNPROP_MIN, min );\n    m_properties.set( FNPROP_MAX, max );\n\n    m_properties.set( FNPROP_LOWER_THRESHOLD, min, min, max, true );\n    m_properties.set( FNPROP_UPPER_THRESHOLD, max, min, max, true );\n\n    if ( m_qform( 1, 1 ) < 0 || m_sform( 1, 1 ) < 0 )\n    {\n        qDebug() << m_properties.get( FNPROP_NAME ).toString() << \": RADIOLOGICAL orientation detected. Flipping voxels on X-Axis\";\n        flipX();\n    }\n}\n\nvoid DatasetScalar::createTexture()\n{\n    glPixelStorei( GL_UNPACK_ALIGNMENT, 1 );\n\n    glGenTextures( 1, &m_textureGLuint );\n\n    glBindTexture( GL_TEXTURE_3D, m_textureGLuint );\n\n    glTexParameteri( GL_TEXTURE_3D, GL_TEXTURE_MIN_FILTER, GL_NEAREST );\n    glTexParameteri( GL_TEXTURE_3D, GL_TEXTURE_MAG_FILTER, GL_NEAREST );\n    glTexParameteri( GL_TEXTURE_3D, GL_TEXTURE_WRAP_S, GL_CLAMP );\n    glTexParameteri( GL_TEXTURE_3D, GL_TEXTURE_WRAP_T, GL_CLAMP );\n    glTexParameteri( GL_TEXTURE_3D, GL_TEXTURE_WRAP_R, GL_CLAMP );\n\n    int nx = m_properties.get( FNPROP_NX ).toInt();\n    int ny = m_properties.get( FNPROP_NY ).toInt();\n    int nz = m_properties.get( FNPROP_NZ ).toInt();\n\n    float max = m_properties.get( FNPROP_MAX ).toFloat();\n\n    unsigned char* tmpData = new unsigned char[nx * ny * nz * 4];\n    for ( int i = 0; i < nx * ny * nz; ++i )\n    {\n        \/\/unsigned int tmp = (double)i \/ (double)(nx * ny * nz) * 256 * 256 * 256 * 256;\n        unsigned int tmp = ( m_data[i] \/ max ) * 256 * 256 * 256 * 256;\n        tmpData[4 * i + 3 ] = (tmp \/ (256 * 256 * 256)) % 256;\n        tmpData[4 * i + 2 ] = (tmp \/ (256 * 256)) % 256;\n        tmpData[4 * i + 1 ] = (tmp \/ (256)) % 256;\n        tmpData[4 * i + 0 ] = tmp % 256 ;\n    }\n\n    glTexImage3D( GL_TEXTURE_3D, 0, GL_RGBA, nx, ny, nz, 0, GL_RGBA, GL_UNSIGNED_BYTE, tmpData );\n    delete[] tmpData;\n\n}\n\nvoid DatasetScalar::flipX()\n{\n    int nx = m_properties.get( FNPROP_NX ).toInt();\n    int ny = m_properties.get( FNPROP_NY ).toInt();\n    int nz = m_properties.get( FNPROP_NZ ).toInt();\n\n    QVector<float> newData;\n\n    for ( int z = 0; z < nz; ++z )\n    {\n        for ( int y = 0; y < ny; ++y )\n        {\n            for ( int x = nx - 1; x >= 0; --x )\n            {\n                newData.push_back( m_data[x + y * nx + z * nx * ny] );\n            }\n        }\n    }\n\n    m_header->qoffset_x = 0.0;\n\n    m_header->qto_xyz.m[0][0] = qMax( m_header->qto_xyz.m[0][0], m_header->qto_xyz.m[0][0] * -1.0f );\n    m_header->sto_xyz.m[0][0] = qMax( m_header->sto_xyz.m[0][0], m_header->sto_xyz.m[0][0] * -1.0f );\n    m_header->qto_xyz.m[0][3] = 0.0;\n    m_header->sto_xyz.m[0][3] = 0.0;\n\n    m_data.clear();\n    m_data = newData;\n}\n\nvoid DatasetScalar::draw( QMatrix4x4 mvpMatrix, QMatrix4x4 mvMatrixInverse, DataStore* datastore )\n{\n}\n\nQString DatasetScalar::getValueAsString( int x, int y, int z )\n{\n    int nx = m_properties.get( FNPROP_NX ).toInt();\n    int ny = m_properties.get( FNPROP_NY ).toInt();\n    float data = m_data[x + y * nx + z * nx * ny];\n    return QString::number( data );\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <cmath>\n\ntemplate <typename T>\ninline Vec2<T>::Vec2() :\nx(0),\ny(0)\n{ }\n\ntemplate <typename T>\ninline Vec2<T>::Vec2(T value) :\nx(value),\ny(value)\n{ }\n\ntemplate <typename T>\ninline Vec2<T>::Vec2(T x, T y) :\nx(x),\ny(y)\n{ }\n\ntemplate <typename T>\ntemplate <typename U>\ninline Vec2<T>::Vec2(const Vec2<U>& vector) :\nx(static_cast<T>(vector.x)),\ny(static_cast<T>(vector.y))\n{ }\n\ntemplate <typename T>\ninline Vec2<T> Vec2<T>::min(const Vec2<T>& left, const Vec2<T>& right)\n{\n    Vec2<T> result;\n    result.x = left.x < right.x ? left.x : right.x;\n    result.y = left.y < right.y ? left.y : right.y;\n    return result;\n}\n\ntemplate <typename T>\ninline Vec2<T> Vec2<T>::max(const Vec2<T>& left, const Vec2<T>& right)\n{\n    Vec2<T> result;\n    result.x = left.x > right.x ? left.x : right.x;\n    result.y = left.y > right.y ? left.y : right.y;\n    return result;\n}\n\ntemplate <typename T>\ninline Vec2<T> Vec2<T>::clamp(const Vec2<T>& value, const Vec2<T>& min, const Vec2<T>& max)\n{\n    const T valueX = value.x;\n    const T clampX = valueX > max.x ? max.x : valueX;\n    const T resultX = clampX < min.x ? min.x : clampX;\n\n    const T valueY = value.y;\n    const T clampY = valueY > max.y ? max.y : valueY;\n    const T resultY = clampY < min.y ? min.y : clampY;\n\n    return Vec2<T>(resultX, resultY);\n}\n\ntemplate <typename T>\ninline void Vec2<T>::normalize()\n{\n    const T l = static_cast<T>(1.0) \/ length();\n    x *= l;\n    y *= l;\n}\n\ntemplate <typename T>\ninline Vec2<T> Vec2<T>::normalize(const Vec2<T>& value)\n{\n    const T l = static_cast<T>(1.0) \/ value.length();\n\n    return Vec2<T>(value.x * l,\n                   value.y * l);\n}\n\ntemplate <typename T>\ninline Vec2<T> Vec2<T>::reflect(const Vec2<T>& vector, const Vec2<T>& normal)\n{\n    const T distance = (vector.x * normal.x) + (vector.y * normal.y);\n    Vec2<T> result;\n    result.x = vector.x - static_cast<T>(2.0) * distance * normal.x;\n    result.y = vector.y - static_cast<T>(2.0) * distance * normal.y;\n    return result;\n}\n\ntemplate <typename T>\ninline T Vec2<T>::length() const\n{\n    return static_cast<T>(std::sqrt(lengthSquared()));\n}\n\ntemplate <typename T>\ninline T Vec2<T>::lengthSquared() const\n{\n    return static_cast<T>((x * x) + (y * y));\n}\n\ntemplate <typename T>\ninline T Vec2<T>::distance(const Vec2<T>& other) const\n{\n    const T deltaX = x - other.x;\n    const T deltaY = y - other.y;\n\n    return static_cast<T>(std::sqrt((deltaX * deltaX) + (deltaY * deltaY)));\n}\n\ntemplate <typename T>\ninline T Vec2<T>::distance(const Vec2<T>& left, const Vec2<T>& right)\n{\n    const T deltaX = left.x - right.x;\n    const T deltaY = left.y - right.y;\n\n    return static_cast<T>(std::sqrt((deltaX * deltaX) + (deltaY * deltaY)));\n}\n\ntemplate <typename T>\ninline T Vec2<T>::distanceSquared(const Vec2<T>& left, const Vec2<T>& right)\n{\n    const T deltaX = left.x - right.x;\n    const T deltaY = left.y - left.y;\n\n    return static_cast<T>((deltaX * deltaX) + (deltaY * deltaY));\n}\n\ntemplate <typename T>\ninline T Vec2<T>::distanceSquared(const Vec2<T>& other) const\n{\n    const T deltaX = x - other.x;\n    const T deltaY = y - other.y;\n\n    return static_cast<T>((deltaX * deltaX) + (deltaY * deltaY));\n}\n\ntemplate <typename T>\ninline T Vec2<T>::dot(const Vec2<T>& left, const Vec2<T>& right)\n{\n    return (left.x * right.x) + (left.y * right.y);\n}\n\ntemplate <typename T>\ninline T Vec2<T>::dot(const Vec2<T>& other)\n{\n    return x * other.x + y * other.y;\n}\n\ntemplate <typename T>\ninline Vec2<T> Vec2<T>::lerp(const Vec2<T>& previous, const Vec2<T>& current, const T amount)\n{\n    Vec2<T> result;\n    result.x = previous.x + (current.x - previous.x) * amount;\n    result.y = previous.y + (current.y - previous.y) * amount;\n    return result;\n}\n\ntemplate <typename T>\ninline Vec2<T> Vec2<T>::barycentric(const Vec2<T>& vertexA, const Vec2<T>& vertexB, const Vec2<T>& vertexC, const T weightA, const T weightB)\n{\n    Vec2<T> result;\n    result.X = (vertexA.X + weightA * (vertexB.X - vertexA.X) + weightB * (vertexC.X - vertexA.X));\n    result.Y = (vertexA.Y + weightA * (vertexB.Y - vertexA.Y) + weightB * (vertexC.Y - vertexA.Y));\n    return result;\n}\n\ntemplate <typename T>\ninline Vec2<T> Vec2<T>::smoothStep(const Vec2<T>& previous, const Vec2<T>& current, T amount)\n{\n    amount =  amount > static_cast<T>(1.0) ? static_cast<T>(1.0): (amount < static_cast<T>(0.0) ? static_cast<T>(0.0) : amount);\n    amount = (amount * amount * (static_cast<T>(3.0) - static_cast<T>(2.0) * amount));\n\n    Vec2<T> result;\n    result.x = previous.x + (current.x - previous.x) * amount;\n    result.y = previous.y + (current.y - previous.y) * amount;\n    return result;\n}\n\ntemplate <typename T>\ninline Vec2<T> Vec2<T>::catmullRom(const Vec2<T>& vertexA, const Vec2<T>& vertexB,\n                                   const Vec2<T>& vertexC, const Vec2<T>& vertexD, const T amount)\n{\n    const T square = amount * amount;\n    const T cube = amount * square;\n\n    Vec2<T> result;\n\n    const T half = static_cast<T>(0.5);\n    const T dbl = static_cast<T>(2.0);\n    const T five = static_cast<T>(5.0);\n    const T four = static_cast<T>(4.0);\n    const T three = static_cast<T>(3.0);\n\n    result.x = (half * (dbl * vertexB.x + (-vertexA.x + vertexC.x) * amount +\n                       (dbl * vertexA.x - five * vertexB.x + four * vertexC.x - vertexD.x) * square +\n                       (- vertexA.x + three * vertexB.x - three * vertexC.x + vertexD.x) * cube));\n    result.y = (half * (dbl * vertexB.y + (-vertexA.y + vertexC.y) * amount +\n                       (dbl * vertexA.y - five * vertexB.y + four * vertexC.y - vertexD.y) * square +\n                       (- vertexA.y + three * vertexB.y - three * vertexC.y + vertexD.y) * cube));\n    return result;\n}\n\ntemplate <typename T>\ninline Vec2<T> Vec2<T>::hermite(const Vec2<T>& vertexA, const Vec2<T>& tangentA, const Vec2<T>& vertexB, const Vec2<T>& tangentB, const T amount)\n{\n    const T square = amount * amount;\n    const T cube = amount * square;\n\n    \/\/calculate the basis function 1\n    const T h1 = (static_cast<T>(2.0) *  cube - static_cast<T>(3.0) * square + static_cast<T>(1.0));\n\n    \/\/calculate the basis function 2\n    const T h2 = (-static_cast<T>(2.0) * cube + static_cast<T>(3.0) * square);\n\n    \/\/calculate the basis function 3\n    const T h3 = cube - static_cast<T>(2.f) * square + amount;\n\n    \/\/calculate the basis function 4\n    const T h4 = cube - square;\n\n    Vec2<T> results;\n    results.x = (vertexA.x * h1 + vertexB.x * h2 + tangentA.x * h3 + tangentB.x * h4);\n    results.y = (vertexA.y * h1 + vertexB.y * h2 + tangentA.y * h3 + tangentB.y * h4);\n    return results;\n}\n\ntemplate <typename T>\ninline Vec2<T> operator -(const Vec2<T>& right)\n{\n    return Vec2<T>(-right.x, -right.y);\n}\n\ntemplate <typename T>\ninline Vec2<T>& operator +=(Vec2<T>& left, const Vec2<T>& right)\n{\n    left.x += right.x;\n    left.y += right.y;\n\n    return left;\n}\n\ntemplate <typename T>\ninline Vec2<T>& operator -=(Vec2<T>& left, const Vec2<T>& right)\n{\n    left.x -= right.x;\n    left.y -= right.y;\n\n    return left;\n}\n\ntemplate <typename T>\ninline Vec2<T> operator +(const Vec2<T>& left, const Vec2<T>& right)\n{\n    return Vec2<T>(left.x + right.x,\n                   left.y + right.y);\n}\n\ntemplate <typename T>\ninline Vec2<T> operator -(const Vec2<T>& left, const Vec2<T>& right)\n{\n    return Vec2<T>(left.x - right.x,\n                   left.y - right.y);\n}\n\ntemplate <typename T>\ninline Vec2<T> operator *(const Vec2<T>& left, T right)\n{\n    return Vec2<T>(left.x * right,\n                   left.y * right);\n}\n\ntemplate <typename T>\ninline Vec2<T> operator *(const Vec2<T>& left, const Vec2<T>& right)\n{\n    return Vec2<T>(left.x * right.x,\n                   left.y * right.y);\n}\n\ntemplate <typename T>\ninline Vec2<T> operator *(T left, const Vec2<T>& right)\n{\n    return Vec2<T>(right.x * left,\n                   right.y * left);\n}\n\ntemplate <typename T>\ninline Vec2<T>& operator *=(Vec2<T>& left, T right)\n{\n    left.x *= right;\n    left.y *= right;\n\n    return left;\n}\n\ntemplate <typename T>\ninline Vec2<T>& operator *=(Vec2<T>& left, const Vec2<T>& right)\n{\n    left.x *= right.x;\n    left.y *= right.y;\n\n    return left;\n}\n\ntemplate <typename T>\ninline Vec2<T> operator \/(const Vec2<T>& left, const Vec2<T>& right)\n{\n    return Vec2<T>(left.x \/ right.x,\n                   left.y \/ right.y);\n}\n\ntemplate <typename T>\ninline Vec2<T> operator \/(const Vec2<T>& left, T right)\n{\n    return Vec2<T>(left.x \/ right,\n                   left.y \/ right);\n}\n\ntemplate <typename T>\ninline Vec2<T>& operator \/=(Vec2<T>& left, T right)\n{\n    left.x \/= right;\n    left.y \/= right;\n\n    return left;\n}\n\ntemplate <typename T>\ninline Vec2<T>& operator \/=(Vec2<T>& left, const Vec2<T>& right)\n{\n    left.x \/= right.x;\n    left.y \/= right.y;\n\n    return left;\n}\n\ntemplate <typename T>\ninline bool operator ==(const Vec2<T>& left, const Vec2<T>& right)\n{\n    return (left.x == right.x) && (left.y == right.y);\n}\n\ntemplate <typename T>\ninline bool operator !=(const Vec2<T>& left, const Vec2<T>& right)\n{\n    return (left.x != right.x) || (left.y != right.y);\n}\n<commit_msg>Updated the hermite transform in the vec2 class.<commit_after>#include <cmath>\n\ntemplate <typename T>\ninline Vec2<T>::Vec2() :\nx(0),\ny(0)\n{ }\n\ntemplate <typename T>\ninline Vec2<T>::Vec2(T value) :\nx(value),\ny(value)\n{ }\n\ntemplate <typename T>\ninline Vec2<T>::Vec2(T x, T y) :\nx(x),\ny(y)\n{ }\n\ntemplate <typename T>\ntemplate <typename U>\ninline Vec2<T>::Vec2(const Vec2<U>& vector) :\nx(static_cast<T>(vector.x)),\ny(static_cast<T>(vector.y))\n{ }\n\ntemplate <typename T>\ninline Vec2<T> Vec2<T>::min(const Vec2<T>& left, const Vec2<T>& right)\n{\n    Vec2<T> result;\n    result.x = left.x < right.x ? left.x : right.x;\n    result.y = left.y < right.y ? left.y : right.y;\n    return result;\n}\n\ntemplate <typename T>\ninline Vec2<T> Vec2<T>::max(const Vec2<T>& left, const Vec2<T>& right)\n{\n    Vec2<T> result;\n    result.x = left.x > right.x ? left.x : right.x;\n    result.y = left.y > right.y ? left.y : right.y;\n    return result;\n}\n\ntemplate <typename T>\ninline Vec2<T> Vec2<T>::clamp(const Vec2<T>& value, const Vec2<T>& min, const Vec2<T>& max)\n{\n    const T valueX = value.x;\n    const T clampX = valueX > max.x ? max.x : valueX;\n    const T resultX = clampX < min.x ? min.x : clampX;\n\n    const T valueY = value.y;\n    const T clampY = valueY > max.y ? max.y : valueY;\n    const T resultY = clampY < min.y ? min.y : clampY;\n\n    return Vec2<T>(resultX, resultY);\n}\n\ntemplate <typename T>\ninline void Vec2<T>::normalize()\n{\n    const T l = static_cast<T>(1.0) \/ length();\n    x *= l;\n    y *= l;\n}\n\ntemplate <typename T>\ninline Vec2<T> Vec2<T>::normalize(const Vec2<T>& value)\n{\n    const T l = static_cast<T>(1.0) \/ value.length();\n\n    return Vec2<T>(value.x * l,\n                   value.y * l);\n}\n\ntemplate <typename T>\ninline Vec2<T> Vec2<T>::reflect(const Vec2<T>& vector, const Vec2<T>& normal)\n{\n    const T distance = (vector.x * normal.x) + (vector.y * normal.y);\n    Vec2<T> result;\n    result.x = vector.x - static_cast<T>(2.0) * distance * normal.x;\n    result.y = vector.y - static_cast<T>(2.0) * distance * normal.y;\n    return result;\n}\n\ntemplate <typename T>\ninline T Vec2<T>::length() const\n{\n    return static_cast<T>(std::sqrt(lengthSquared()));\n}\n\ntemplate <typename T>\ninline T Vec2<T>::lengthSquared() const\n{\n    return static_cast<T>((x * x) + (y * y));\n}\n\ntemplate <typename T>\ninline T Vec2<T>::distance(const Vec2<T>& other) const\n{\n    const T deltaX = x - other.x;\n    const T deltaY = y - other.y;\n\n    return static_cast<T>(std::sqrt((deltaX * deltaX) + (deltaY * deltaY)));\n}\n\ntemplate <typename T>\ninline T Vec2<T>::distance(const Vec2<T>& left, const Vec2<T>& right)\n{\n    const T deltaX = left.x - right.x;\n    const T deltaY = left.y - right.y;\n\n    return static_cast<T>(std::sqrt((deltaX * deltaX) + (deltaY * deltaY)));\n}\n\ntemplate <typename T>\ninline T Vec2<T>::distanceSquared(const Vec2<T>& left, const Vec2<T>& right)\n{\n    const T deltaX = left.x - right.x;\n    const T deltaY = left.y - left.y;\n\n    return static_cast<T>((deltaX * deltaX) + (deltaY * deltaY));\n}\n\ntemplate <typename T>\ninline T Vec2<T>::distanceSquared(const Vec2<T>& other) const\n{\n    const T deltaX = x - other.x;\n    const T deltaY = y - other.y;\n\n    return static_cast<T>((deltaX * deltaX) + (deltaY * deltaY));\n}\n\ntemplate <typename T>\ninline T Vec2<T>::dot(const Vec2<T>& left, const Vec2<T>& right)\n{\n    return (left.x * right.x) + (left.y * right.y);\n}\n\ntemplate <typename T>\ninline T Vec2<T>::dot(const Vec2<T>& other)\n{\n    return x * other.x + y * other.y;\n}\n\ntemplate <typename T>\ninline Vec2<T> Vec2<T>::lerp(const Vec2<T>& previous, const Vec2<T>& current, const T amount)\n{\n    Vec2<T> result;\n    result.x = previous.x + (current.x - previous.x) * amount;\n    result.y = previous.y + (current.y - previous.y) * amount;\n    return result;\n}\n\ntemplate <typename T>\ninline Vec2<T> Vec2<T>::barycentric(const Vec2<T>& vertexA, const Vec2<T>& vertexB, const Vec2<T>& vertexC, const T weightA, const T weightB)\n{\n    Vec2<T> result;\n    result.X = (vertexA.X + weightA * (vertexB.X - vertexA.X) + weightB * (vertexC.X - vertexA.X));\n    result.Y = (vertexA.Y + weightA * (vertexB.Y - vertexA.Y) + weightB * (vertexC.Y - vertexA.Y));\n    return result;\n}\n\ntemplate <typename T>\ninline Vec2<T> Vec2<T>::smoothStep(const Vec2<T>& previous, const Vec2<T>& current, T amount)\n{\n    amount =  amount > static_cast<T>(1.0) ? static_cast<T>(1.0): (amount < static_cast<T>(0.0) ? static_cast<T>(0.0) : amount);\n    amount = (amount * amount * (static_cast<T>(3.0) - static_cast<T>(2.0) * amount));\n\n    Vec2<T> result;\n    result.x = previous.x + (current.x - previous.x) * amount;\n    result.y = previous.y + (current.y - previous.y) * amount;\n    return result;\n}\n\ntemplate <typename T>\ninline Vec2<T> Vec2<T>::catmullRom(const Vec2<T>& vertexA, const Vec2<T>& vertexB,\n                                   const Vec2<T>& vertexC, const Vec2<T>& vertexD, const T amount)\n{\n    const T square = amount * amount;\n    const T cube = amount * square;\n\n    Vec2<T> result;\n\n    const T half = static_cast<T>(0.5);\n    const T dbl = static_cast<T>(2.0);\n    const T five = static_cast<T>(5.0);\n    const T four = static_cast<T>(4.0);\n    const T three = static_cast<T>(3.0);\n\n    result.x = (half * (dbl * vertexB.x + (-vertexA.x + vertexC.x) * amount +\n                       (dbl * vertexA.x - five * vertexB.x + four * vertexC.x - vertexD.x) * square +\n                       (- vertexA.x + three * vertexB.x - three * vertexC.x + vertexD.x) * cube));\n    result.y = (half * (dbl * vertexB.y + (-vertexA.y + vertexC.y) * amount +\n                       (dbl * vertexA.y - five * vertexB.y + four * vertexC.y - vertexD.y) * square +\n                       (- vertexA.y + three * vertexB.y - three * vertexC.y + vertexD.y) * cube));\n    return result;\n}\n\ntemplate <typename T>\ninline Vec2<T> Vec2<T>::hermite(const Vec2<T>& vertexA, const Vec2<T>& tangentA, const Vec2<T>& vertexB, const Vec2<T>& tangentB, const T amount)\n{\n    const T square = amount * amount;\n    const T cube = amount * square;\n\n    const T one = static_cast<T>(1.0f);\n    const T two = static_cast<T>(2.0);\n    const T three = static_cast<T>(3.0);\n\n    \/\/calculate the basis function 1\n    const T h1 = (two *  cube - three * square + one);\n\n    \/\/calculate the basis function 2\n    const T h2 = (-two * cube + three * square);\n\n    \/\/calculate the basis function 3\n    const T h3 = cube - two * square + amount;\n\n    \/\/calculate the basis function 4\n    const T h4 = cube - square;\n\n    Vec2<T> results;\n    results.x = (vertexA.x * h1 + vertexB.x * h2 + tangentA.x * h3 + tangentB.x * h4);\n    results.y = (vertexA.y * h1 + vertexB.y * h2 + tangentA.y * h3 + tangentB.y * h4);\n    return results;\n}\n\ntemplate <typename T>\ninline Vec2<T> operator -(const Vec2<T>& right)\n{\n    return Vec2<T>(-right.x, -right.y);\n}\n\ntemplate <typename T>\ninline Vec2<T>& operator +=(Vec2<T>& left, const Vec2<T>& right)\n{\n    left.x += right.x;\n    left.y += right.y;\n\n    return left;\n}\n\ntemplate <typename T>\ninline Vec2<T>& operator -=(Vec2<T>& left, const Vec2<T>& right)\n{\n    left.x -= right.x;\n    left.y -= right.y;\n\n    return left;\n}\n\ntemplate <typename T>\ninline Vec2<T> operator +(const Vec2<T>& left, const Vec2<T>& right)\n{\n    return Vec2<T>(left.x + right.x,\n                   left.y + right.y);\n}\n\ntemplate <typename T>\ninline Vec2<T> operator -(const Vec2<T>& left, const Vec2<T>& right)\n{\n    return Vec2<T>(left.x - right.x,\n                   left.y - right.y);\n}\n\ntemplate <typename T>\ninline Vec2<T> operator *(const Vec2<T>& left, T right)\n{\n    return Vec2<T>(left.x * right,\n                   left.y * right);\n}\n\ntemplate <typename T>\ninline Vec2<T> operator *(const Vec2<T>& left, const Vec2<T>& right)\n{\n    return Vec2<T>(left.x * right.x,\n                   left.y * right.y);\n}\n\ntemplate <typename T>\ninline Vec2<T> operator *(T left, const Vec2<T>& right)\n{\n    return Vec2<T>(right.x * left,\n                   right.y * left);\n}\n\ntemplate <typename T>\ninline Vec2<T>& operator *=(Vec2<T>& left, T right)\n{\n    left.x *= right;\n    left.y *= right;\n\n    return left;\n}\n\ntemplate <typename T>\ninline Vec2<T>& operator *=(Vec2<T>& left, const Vec2<T>& right)\n{\n    left.x *= right.x;\n    left.y *= right.y;\n\n    return left;\n}\n\ntemplate <typename T>\ninline Vec2<T> operator \/(const Vec2<T>& left, const Vec2<T>& right)\n{\n    return Vec2<T>(left.x \/ right.x,\n                   left.y \/ right.y);\n}\n\ntemplate <typename T>\ninline Vec2<T> operator \/(const Vec2<T>& left, T right)\n{\n    return Vec2<T>(left.x \/ right,\n                   left.y \/ right);\n}\n\ntemplate <typename T>\ninline Vec2<T>& operator \/=(Vec2<T>& left, T right)\n{\n    left.x \/= right;\n    left.y \/= right;\n\n    return left;\n}\n\ntemplate <typename T>\ninline Vec2<T>& operator \/=(Vec2<T>& left, const Vec2<T>& right)\n{\n    left.x \/= right.x;\n    left.y \/= right.y;\n\n    return left;\n}\n\ntemplate <typename T>\ninline bool operator ==(const Vec2<T>& left, const Vec2<T>& right)\n{\n    return (left.x == right.x) && (left.y == right.y);\n}\n\ntemplate <typename T>\ninline bool operator !=(const Vec2<T>& left, const Vec2<T>& right)\n{\n    return (left.x != right.x) || (left.y != right.y);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ X509LS\n\/\/ Copyright 2013 Tom Harwood\n\n#include \"x509ls\/cli\/certificate_list_control.h\"\n\n#include <assert.h>\n#include <ncurses.h>\n#include <stddef.h>\n\n#include <algorithm>\n#include <sstream>\n#include <string>\n\n#include \"x509ls\/base\/openssl\/openssl_environment.h\"\n#include \"x509ls\/certificate\/certificate_list.h\"\n#include \"x509ls\/cli\/base\/list_model.h\"\n\nusing std::max;\nusing std::string;\n\nnamespace x509ls {\nCertificateListControl::CertificateListControl(CliControl* parent,\n    ListType list_type,\n    const CertificateList* model)\n  :\n  ListControl(parent, model),\n  model_(model),\n  list_type_(list_type) {\n}\n\n\/\/ virtual\nCertificateListControl::~CertificateListControl() {\n}\n\n\/\/ virtual\nvoid CertificateListControl::PaintLine(unsigned int index, unsigned int row,\n    bool selected) {\n  const Certificate& cert = (*model_)[index];\n\n  WINDOW* window = Window();\n\n  if (selected) {\n    wattron(window, Colours::Get(Colours::kColourHighlighted));\n  }\n\n  wmove(window, row, 0);\n  wprintw(window, \"%s\", string(Cols(), ' ').c_str());\n  wmove(window, row, 0);\n\n  \/\/ Displays certificates in list or hierarchy format, based on |list_type_|.\n  \/\/ stpc   1 GlobalSign Root CA                                      2024-01-02\n  \/\/ stpc   1 + GlobalSign Root CA                                    2024-01-02\n#ifdef X509LS_OLD_OPENSSL_NO_TRUST_STORE_LOOKUP\n  \/\/ OpenSSL <v1 doesn't have the X509_STORE_get1_certs function needed for the\n  \/\/ 't' (in trust store) flag. Omit showing it.\n  const int kFlagsSize = 3;\n#else\n  const int kFlagsSize = 4;\n#endif\n\n  bool show_expiry = false;\n  int cols_for_common_name = Cols();\n  cols_for_common_name -= kFlagsSize + 1;  \/\/ Flags column + sp char.\n  cols_for_common_name -= 2 + 1;  \/\/ Row number column + sp char.\n\n  \/\/ Validation paths are shown in a hierarchical representation.\n  \/\/ 01234\n  \/\/ + xxx\n  \/\/  + xxx\n  \/\/   + xxx\n  string hierarchy_diagram;\n  if (list_type_ == kTypeValidationPath) {\n    cols_for_common_name -= 2 + index;\n    hierarchy_diagram = string(index, ' ');\n    hierarchy_diagram.append(\"+ \");\n  }\n\n  \/\/ Enough space to show the expiry column?\n  const int kExpiryColSize = 11;\n  if (cols_for_common_name > 2 * kExpiryColSize + 1) {\n    show_expiry = true;\n    cols_for_common_name -= kExpiryColSize + 1;  \/\/ Expiry date & sp char.\n  }\n\n  string common_name = cert.CommonNames();\n  if (common_name.empty()) {\n    common_name = cert.Subject();\n  }\n\n  if (static_cast<int>(common_name.size()) > cols_for_common_name) {\n    common_name.erase(max(0, cols_for_common_name - 3));\n    common_name.append(\"...\");\n  }\n\n  PrintFlag(cert.IsSelfSigned(), 's',\n      selected ? Colours::kColourRedHighlighted : Colours::kColourRed);\n\n#ifndef X509LS_OLD_OPENSSL_NO_TRUST_STORE_LOOKUP\n  PrintFlag(cert.IsInTrustStore(), 't',\n      selected ? Colours::kColourYellowHighlighted : Colours::kColourYellow);\n#endif\n\n  PrintFlag(cert.IsInValidationPath(), 'v',\n      selected ? Colours::kColourGreenHighlighted : Colours::kColourGreen);\n\n  PrintFlag(cert.IsInPeerChain(), 'c',\n      selected ? Colours::kColourPurpleHighlighted : Colours::kColourPurple);\n\n  wattrset(Window(), Colours::Get(\n      selected ? Colours::kColourHighlighted : Colours::kColourDefault));\n\n  wattron(Window(), A_BOLD);\n\n  wprintw(window, \" %2d \",\n      index + 1);  \/\/ Convert from zero-indexed to one-indexed for humans.\n\n  if (!hierarchy_diagram.empty()) {\n    wprintw(window, \"%s\", hierarchy_diagram.c_str());\n  }\n\n  wattroff(Window(), A_BOLD);\n\n  wprintw(window, \"%s\",\n      common_name.c_str());\n\n  if (show_expiry) {\n    wmove(window, row, Cols() - kExpiryColSize);\n    wattron(Window(), A_BOLD);\n    wprintw(window, \"%s\", cert.NotAfterDate().c_str());\n    wattroff(Window(), A_BOLD);\n  }\n\n  if (selected) {\n    wattroff(window, Colours::Get(Colours::kColourHighlighted));\n  }\n}\n\nvoid CertificateListControl::PrintFlag(bool flag, char symbol,\n    Colours::ColourType colour_type) {\n  wattron(Window(), Colours::Get(colour_type));\n  wprintw(Window(), \"%c\", flag ? symbol : '.');\n}\n\n\/\/ virtual\nvoid CertificateListControl::SetModel(const CertificateList* model) {\n  model_ = model;\n  ListControl::SetModel(model);\n}\n\nconst Certificate* CertificateListControl::CurrentCertificate() const {\n  const int index = SelectedIndex();\n  if (index == -1) {\n    return NULL;\n  }\n\n  return &(*model_)[index];\n}\n}  \/\/ namespace x509ls\n\n<commit_msg>Fix inconsistencies referencing the certificate list control's ncurses window.<commit_after>\/\/ X509LS\n\/\/ Copyright 2013 Tom Harwood\n\n#include \"x509ls\/cli\/certificate_list_control.h\"\n\n#include <assert.h>\n#include <ncurses.h>\n#include <stddef.h>\n\n#include <algorithm>\n#include <sstream>\n#include <string>\n\n#include \"x509ls\/base\/openssl\/openssl_environment.h\"\n#include \"x509ls\/certificate\/certificate_list.h\"\n#include \"x509ls\/cli\/base\/list_model.h\"\n\nusing std::max;\nusing std::string;\n\nnamespace x509ls {\nCertificateListControl::CertificateListControl(CliControl* parent,\n    ListType list_type,\n    const CertificateList* model)\n  :\n  ListControl(parent, model),\n  model_(model),\n  list_type_(list_type) {\n}\n\n\/\/ virtual\nCertificateListControl::~CertificateListControl() {\n}\n\n\/\/ virtual\nvoid CertificateListControl::PaintLine(unsigned int index, unsigned int row,\n    bool selected) {\n  const Certificate& cert = (*model_)[index];\n\n  WINDOW* window = Window();\n\n  if (selected) {\n    wattron(window, Colours::Get(Colours::kColourHighlighted));\n  }\n\n  wmove(window, row, 0);\n  wprintw(window, \"%s\", string(Cols(), ' ').c_str());\n  wmove(window, row, 0);\n\n  \/\/ Displays certificates in list or hierarchy format, based on |list_type_|.\n  \/\/ stpc   1 GlobalSign Root CA                                      2024-01-02\n  \/\/ stpc   1 + GlobalSign Root CA                                    2024-01-02\n#ifdef X509LS_OLD_OPENSSL_NO_TRUST_STORE_LOOKUP\n  \/\/ OpenSSL <v1 doesn't have the X509_STORE_get1_certs function needed for the\n  \/\/ 't' (in trust store) flag. Omit showing it.\n  const int kFlagsSize = 3;\n#else\n  const int kFlagsSize = 4;\n#endif\n\n  bool show_expiry = false;\n  int cols_for_common_name = Cols();\n  cols_for_common_name -= kFlagsSize + 1;  \/\/ Flags column + sp char.\n  cols_for_common_name -= 2 + 1;  \/\/ Row number column + sp char.\n\n  \/\/ Validation paths are shown in a hierarchical representation.\n  \/\/ 01234\n  \/\/ + xxx\n  \/\/  + xxx\n  \/\/   + xxx\n  string hierarchy_diagram;\n  if (list_type_ == kTypeValidationPath) {\n    cols_for_common_name -= 2 + index;\n    hierarchy_diagram = string(index, ' ');\n    hierarchy_diagram.append(\"+ \");\n  }\n\n  \/\/ Enough space to show the expiry column?\n  const int kExpiryColSize = 11;\n  if (cols_for_common_name > 2 * kExpiryColSize + 1) {\n    show_expiry = true;\n    cols_for_common_name -= kExpiryColSize + 1;  \/\/ Expiry date & sp char.\n  }\n\n  string common_name = cert.CommonNames();\n  if (common_name.empty()) {\n    common_name = cert.Subject();\n  }\n\n  if (static_cast<int>(common_name.size()) > cols_for_common_name) {\n    common_name.erase(max(0, cols_for_common_name - 3));\n    common_name.append(\"...\");\n  }\n\n  PrintFlag(cert.IsSelfSigned(), 's',\n      selected ? Colours::kColourRedHighlighted : Colours::kColourRed);\n\n#ifndef X509LS_OLD_OPENSSL_NO_TRUST_STORE_LOOKUP\n  PrintFlag(cert.IsInTrustStore(), 't',\n      selected ? Colours::kColourYellowHighlighted : Colours::kColourYellow);\n#endif\n\n  PrintFlag(cert.IsInValidationPath(), 'v',\n      selected ? Colours::kColourGreenHighlighted : Colours::kColourGreen);\n\n  PrintFlag(cert.IsInPeerChain(), 'c',\n      selected ? Colours::kColourPurpleHighlighted : Colours::kColourPurple);\n\n  wattrset(window, Colours::Get(\n      selected ? Colours::kColourHighlighted : Colours::kColourDefault));\n\n  wattron(window, A_BOLD);\n\n  wprintw(window, \" %2d \",\n      index + 1);  \/\/ Convert from zero-indexed to one-indexed for humans.\n\n  if (!hierarchy_diagram.empty()) {\n    wprintw(window, \"%s\", hierarchy_diagram.c_str());\n  }\n\n  wattroff(window, A_BOLD);\n\n  wprintw(window, \"%s\",\n      common_name.c_str());\n\n  if (show_expiry) {\n    wmove(window, row, Cols() - kExpiryColSize);\n    wattron(window, A_BOLD);\n    wprintw(window, \"%s\", cert.NotAfterDate().c_str());\n    wattroff(window, A_BOLD);\n  }\n\n  if (selected) {\n    wattroff(window, Colours::Get(Colours::kColourHighlighted));\n  }\n}\n\nvoid CertificateListControl::PrintFlag(bool flag, char symbol,\n    Colours::ColourType colour_type) {\n  wattron(Window(), Colours::Get(colour_type));\n  wprintw(Window(), \"%c\", flag ? symbol : '.');\n}\n\n\/\/ virtual\nvoid CertificateListControl::SetModel(const CertificateList* model) {\n  model_ = model;\n  ListControl::SetModel(model);\n}\n\nconst Certificate* CertificateListControl::CurrentCertificate() const {\n  const int index = SelectedIndex();\n  if (index == -1) {\n    return NULL;\n  }\n\n  return &(*model_)[index];\n}\n}  \/\/ namespace x509ls\n\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * \\file\n * \\brief PendSV_Handler() for ARMv6-M and ARMv7-M\n *\n * \\author Copyright (C) 2014-2016 Kamil Szczygiel http:\/\/www.distortec.com http:\/\/www.freddiechopin.info\n *\n * \\par License\n * This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0. If a copy of the MPL was not\n * distributed with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#include \"distortos\/internal\/scheduler\/getScheduler.hpp\"\n#include \"distortos\/internal\/scheduler\/Scheduler.hpp\"\n\n#include \"distortos\/chip\/CMSIS-proxy.h\"\n\n#ifdef CONFIG_CHECK_STACK_POINTER_RANGE_ENABLE\n\n#include \"distortos\/FATAL_ERROR.h\"\n\n#endif\t\/\/ def CONFIG_CHECK_STACK_POINTER_RANGE_ENABLE\n\nnamespace distortos\n{\n\nnamespace\n{\n\n\/*---------------------------------------------------------------------------------------------------------------------+\n| local functions\n+---------------------------------------------------------------------------------------------------------------------*\/\n\n#ifdef CONFIG_CHECK_STACK_POINTER_RANGE_ENABLE\n\n\/**\n * \\brief Wrapper for check of stack pointer range\n *\n * If the check fails, FATAL_ERROR() is called.\n *\n * \\param [in] stackPointer is the current thread's stack pointer value, including the frame which will be stacked\n *\/\n\nvoid checkStackPointerWrapper(void* const stackPointer)\n{\n\tif (internal::getScheduler().getCurrentThreadControlBlock().getStack().checkStackPointer(stackPointer) == false)\n\t\tFATAL_ERROR(\"Stack overflow detected!\");\n}\n\n#endif\t\/\/ def CONFIG_CHECK_STACK_POINTER_RANGE_ENABLE\n\n\/**\n * \\brief Wrapper for void* distortos::internal::getScheduler().switchContext(void*)\n *\n * \\param [in] stackPointer is the current value of current thread's stack pointer\n *\n * \\return new thread's stack pointer\n *\/\n\nvoid* schedulerSwitchContextWrapper(void* const stackPointer)\n{\n\treturn internal::getScheduler().switchContext(stackPointer);\n}\n\n}\t\/\/ namespace\n\n\/*---------------------------------------------------------------------------------------------------------------------+\n| global functions\n+---------------------------------------------------------------------------------------------------------------------*\/\n\n\/**\n * \\brief PendSV_Handler() for ARMv6-M and ARMv7-M\n *\n * Performs the context switch.\n *\/\n\nextern \"C\" __attribute__ ((naked)) void PendSV_Handler()\n{\n#if CONFIG_ARCHITECTURE_ARMV7_M_KERNEL_BASEPRI != 0\n\n\tconstexpr auto basepriValue = CONFIG_ARCHITECTURE_ARMV7_M_KERNEL_BASEPRI << (8 - __NVIC_PRIO_BITS);\n\tstatic_assert(basepriValue > 0 && basepriValue <= UINT8_MAX,\n\t\t\t\"Invalid CONFIG_ARCHITECTURE_ARMV7_M_KERNEL_BASEPRI value!\");\n\n#endif\t\/\/ CONFIG_ARCHITECTURE_ARMV7_M_KERNEL_BASEPRI != 0\n\n\tasm volatile\n\t(\n#if CONFIG_ARCHITECTURE_ARMV7_M_KERNEL_BASEPRI != 0\n\t\t\t\"\tmov\t\t\tr0, %[basepriValue]\t\t\t\t\t\\n\"\n\t\t\t\"\tmsr\t\t\tbasepri, r0\t\t\t\t\t\t\t\\n\"\t\/\/ enable interrupt masking\n#else\t\/\/ CONFIG_ARCHITECTURE_ARMV7_M_KERNEL_BASEPRI == 0\n\t\t\t\"\tcpsid\t\ti\t\t\t\t\t\t\t\t\t\\n\"\t\/\/ disable interrupts\n#endif\t\/\/ CONFIG_ARCHITECTURE_ARMV7_M_KERNEL_BASEPRI == 0\n\t\t\t\"\t\t\t\t\t\t\t\t\t\t\t\t\t\\n\"\n#ifdef __ARM_ARCH_6M__\n\t\t\t\"\tmrs\t\t\tr0, psp\t\t\t\t\t\t\t\t\\n\"\n#ifdef CONFIG_CHECK_STACK_POINTER_RANGE_ENABLE\n\t\t\t\"\tpush\t\t{r0, lr}\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tsub\t\t\tr0, r0, #0x20\t\t\t\t\t\t\\n\"\n\t\t\t\"\tldr\t\t\tr1, =%[checkStackPointerWrapper]\t\\n\"\n\t\t\t\"\tblx\t\t\tr1\t\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tpop\t\t\t{r0, r1}\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tmov\t\t\tlr, r1\t\t\t\t\t\t\t\t\\n\"\n#endif\t\/\/ def CONFIG_CHECK_STACK_POINTER_RANGE_ENABLE\n\t\t\t\"\tsub\t\t\tr0, #0x10\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tstmia\t\tr0!, {r4-r7}\t\t\t\t\t\t\\n\"\t\/\/ save lower half of current thread's context\n\t\t\t\"\tmov\t\t\tr4, r8\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tmov\t\t\tr5, r9\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tmov\t\t\tr6, r10\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tmov\t\t\tr7, r11\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tsub\t\t\tr0, #0x20\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tstmia\t\tr0!, {r4-r7}\t\t\t\t\t\t\\n\"\t\/\/ save upper half of current thread's context\n\t\t\t\"\tsub\t\t\tr0, #0x10\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tmov\t\t\tr4, lr\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\t\t\t\t\t\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tldr\t\t\tr1, =%[schedulerSwitchContext]\t\t\\n\"\n\t\t\t\"\tblx\t\t\tr1\t\t\t\t\t\t\t\t\t\\n\"\t\/\/ switch context\n\t\t\t\"\t\t\t\t\t\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tmov\t\t\tlr, r4\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tldmia\t\tr0!, {r4-r7}\t\t\t\t\t\t\\n\"\t\/\/ load upper half of new thread's context\n\t\t\t\"\tmov\t\t\tr8, r4\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tmov\t\t\tr9, r5\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tmov\t\t\tr10, r6\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tmov\t\t\tr11, r7\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tldmia\t\tr0!, {r4-r7}\t\t\t\t\t\t\\n\"\t\/\/ load lower half of new thread's context\n\t\t\t\"\tmsr\t\t\tpsp, r0\t\t\t\t\t\t\t\t\\n\"\n#else\t\/\/ !def __ARM_ARCH_6M__\n\t\t\t\"\tmrs\t\t\tr0, psp\t\t\t\t\t\t\t\t\\n\"\n#ifdef CONFIG_CHECK_STACK_POINTER_RANGE_ENABLE\n\t\t\t\"\tpush\t\t{r0, lr}\t\t\t\t\t\t\t\\n\"\n#if __FPU_PRESENT == 1 && __FPU_USED == 1\n\t\t\t\"\ttst\t\t\tlr, #(1 << 4)\t\t\t\t\t\t\\n\"\t\/\/ was floating-point used by the thread?\n\t\t\t\"\tit\t\t\teq\t\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tsubeq\t\tr0, r0, #0x40\t\t\t\t\t\t\\n\"\t\/\/ account for size of \"floating-pont\" context\n\t\t\t\"\tsub\t\t\tr0, r0, #0x28\t\t\t\t\t\t\\n\"\n#else\t\/\/ __FPU_PRESENT != 1 || __FPU_USED != 1\n\t\t\t\"\tsub\t\t\tr0, r0, #0x20\t\t\t\t\t\t\\n\"\n#endif\t\/\/ __FPU_PRESENT != 1 || __FPU_USED != 1\n\t\t\t\"\tbl\t\t\t%[checkStackPointerWrapper]\t\t\t\\n\"\n\t\t\t\"\tpop\t\t\t{r0, lr}\t\t\t\t\t\t\t\\n\"\n#endif\t\/\/ def CONFIG_CHECK_STACK_POINTER_RANGE_ENABLE\n#if __FPU_PRESENT == 1 && __FPU_USED == 1\n\t\t\t\"\ttst\t\t\tlr, #(1 << 4)\t\t\t\t\t\t\\n\"\t\/\/ was floating-point used by the thread?\n\t\t\t\"\tit\t\t\teq\t\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tvstmdbeq\tr0!, {s16-s31}\t\t\t\t\t\t\\n\"\t\/\/ save \"floating-point\" context of current thread\n\t\t\t\/\/ save \"regular\" context of current thread (r12 is saved just to keep double-word alignment)\n\t\t\t\"\tstmdb\t\tr0!, {r4-r12, lr}\t\t\t\t\t\\n\"\n#else\t\/\/ __FPU_PRESENT != 1 || __FPU_USED != 1\n\t\t\t\"\tstmdb\t\tr0!, {r4-r11}\t\t\t\t\t\t\\n\"\t\/\/ save context of current thread\n\t\t\t\"\tmov\t\t\tr4, lr\t\t\t\t\t\t\t\t\\n\"\n#endif\t\/\/ __FPU_PRESENT != 1 || __FPU_USED != 1\n\t\t\t\"\t\t\t\t\t\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tbl\t\t\t%[schedulerSwitchContext]\t\t\t\\n\"\t\/\/ switch context\n\t\t\t\"\t\t\t\t\t\t\t\t\t\t\t\t\t\\n\"\n#if __FPU_PRESENT == 1 && __FPU_USED == 1\n\t\t\t\"\tldmia\t\tr0!, {r4-r12, lr}\t\t\t\t\t\\n\"\t\/\/ load \"regular\" context of new thread\n\t\t\t\"\ttst\t\t\tlr, #(1 << 4)\t\t\t\t\t\t\\n\"\t\/\/ was floating-point used by the thread?\n\t\t\t\"\tit\t\t\teq\t\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tvldmiaeq\tr0!, {s16-s31}\t\t\t\t\t\t\\n\"\t\/\/ load \"floating-point\" context of new thread\n#else\t\/\/ __FPU_PRESENT != 1 || __FPU_USED != 1\n\t\t\t\"\tmov\t\t\tlr, r4\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tldmia\t\tr0!, {r4-r11}\t\t\t\t\t\t\\n\"\t\/\/ load context of new thread\n#endif\t\/\/ __FPU_PRESENT != 1 || __FPU_USED != 1\n\t\t\t\"\tmsr\t\t\tpsp, r0\t\t\t\t\t\t\t\t\\n\"\n#endif\t\/\/ !def __ARM_ARCH_6M__\n\t\t\t\"\t\t\t\t\t\t\t\t\t\t\t\t\t\\n\"\n#if CONFIG_ARCHITECTURE_ARMV7_M_KERNEL_BASEPRI != 0\n\t\t\t\"\tmov\t\t\tr0, #0\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tmsr\t\t\tbasepri, r0\t\t\t\t\t\t\t\\n\"\t\/\/ disable interrupt masking\n#else\t\/\/ CONFIG_ARCHITECTURE_ARMV7_M_KERNEL_BASEPRI == 0\n\t\t\t\"\tcpsie\t\ti\t\t\t\t\t\t\t\t\t\\n\"\t\/\/ enable interrupts\n#endif\t\/\/ CONFIG_ARCHITECTURE_ARMV7_M_KERNEL_BASEPRI == 0\n\t\t\t\"\t\t\t\t\t\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tbx\t\t\tlr\t\t\t\t\t\t\t\t\t\\n\"\t\/\/ return to new thread\n\n\t\t\t::\n#if CONFIG_ARCHITECTURE_ARMV7_M_KERNEL_BASEPRI != 0\n\t\t\t\t[basepriValue] \"i\" (basepriValue),\n#endif\t\/\/ CONFIG_ARCHITECTURE_ARMV7_M_KERNEL_BASEPRI != 0\n#ifdef CONFIG_CHECK_STACK_POINTER_RANGE_ENABLE\n\t\t\t\t[checkStackPointerWrapper] \"i\" (checkStackPointerWrapper),\n#endif\t\/\/ def CONFIG_CHECK_STACK_POINTER_RANGE_ENABLE\n\t\t\t\t[schedulerSwitchContext] \"i\" (schedulerSwitchContextWrapper)\n\t);\n\n\t__builtin_unreachable();\n}\n\n}\t\/\/ namespace distortos\n<commit_msg>Constify pointer passed to local checkStackPointerWrapper()<commit_after>\/**\n * \\file\n * \\brief PendSV_Handler() for ARMv6-M and ARMv7-M\n *\n * \\author Copyright (C) 2014-2016 Kamil Szczygiel http:\/\/www.distortec.com http:\/\/www.freddiechopin.info\n *\n * \\par License\n * This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0. If a copy of the MPL was not\n * distributed with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#include \"distortos\/internal\/scheduler\/getScheduler.hpp\"\n#include \"distortos\/internal\/scheduler\/Scheduler.hpp\"\n\n#include \"distortos\/chip\/CMSIS-proxy.h\"\n\n#ifdef CONFIG_CHECK_STACK_POINTER_RANGE_ENABLE\n\n#include \"distortos\/FATAL_ERROR.h\"\n\n#endif\t\/\/ def CONFIG_CHECK_STACK_POINTER_RANGE_ENABLE\n\nnamespace distortos\n{\n\nnamespace\n{\n\n\/*---------------------------------------------------------------------------------------------------------------------+\n| local functions\n+---------------------------------------------------------------------------------------------------------------------*\/\n\n#ifdef CONFIG_CHECK_STACK_POINTER_RANGE_ENABLE\n\n\/**\n * \\brief Wrapper for check of stack pointer range\n *\n * If the check fails, FATAL_ERROR() is called.\n *\n * \\param [in] stackPointer is the current thread's stack pointer value, including the frame which will be stacked\n *\/\n\nvoid checkStackPointerWrapper(const void* const stackPointer)\n{\n\tif (internal::getScheduler().getCurrentThreadControlBlock().getStack().checkStackPointer(stackPointer) == false)\n\t\tFATAL_ERROR(\"Stack overflow detected!\");\n}\n\n#endif\t\/\/ def CONFIG_CHECK_STACK_POINTER_RANGE_ENABLE\n\n\/**\n * \\brief Wrapper for void* distortos::internal::getScheduler().switchContext(void*)\n *\n * \\param [in] stackPointer is the current value of current thread's stack pointer\n *\n * \\return new thread's stack pointer\n *\/\n\nvoid* schedulerSwitchContextWrapper(void* const stackPointer)\n{\n\treturn internal::getScheduler().switchContext(stackPointer);\n}\n\n}\t\/\/ namespace\n\n\/*---------------------------------------------------------------------------------------------------------------------+\n| global functions\n+---------------------------------------------------------------------------------------------------------------------*\/\n\n\/**\n * \\brief PendSV_Handler() for ARMv6-M and ARMv7-M\n *\n * Performs the context switch.\n *\/\n\nextern \"C\" __attribute__ ((naked)) void PendSV_Handler()\n{\n#if CONFIG_ARCHITECTURE_ARMV7_M_KERNEL_BASEPRI != 0\n\n\tconstexpr auto basepriValue = CONFIG_ARCHITECTURE_ARMV7_M_KERNEL_BASEPRI << (8 - __NVIC_PRIO_BITS);\n\tstatic_assert(basepriValue > 0 && basepriValue <= UINT8_MAX,\n\t\t\t\"Invalid CONFIG_ARCHITECTURE_ARMV7_M_KERNEL_BASEPRI value!\");\n\n#endif\t\/\/ CONFIG_ARCHITECTURE_ARMV7_M_KERNEL_BASEPRI != 0\n\n\tasm volatile\n\t(\n#if CONFIG_ARCHITECTURE_ARMV7_M_KERNEL_BASEPRI != 0\n\t\t\t\"\tmov\t\t\tr0, %[basepriValue]\t\t\t\t\t\\n\"\n\t\t\t\"\tmsr\t\t\tbasepri, r0\t\t\t\t\t\t\t\\n\"\t\/\/ enable interrupt masking\n#else\t\/\/ CONFIG_ARCHITECTURE_ARMV7_M_KERNEL_BASEPRI == 0\n\t\t\t\"\tcpsid\t\ti\t\t\t\t\t\t\t\t\t\\n\"\t\/\/ disable interrupts\n#endif\t\/\/ CONFIG_ARCHITECTURE_ARMV7_M_KERNEL_BASEPRI == 0\n\t\t\t\"\t\t\t\t\t\t\t\t\t\t\t\t\t\\n\"\n#ifdef __ARM_ARCH_6M__\n\t\t\t\"\tmrs\t\t\tr0, psp\t\t\t\t\t\t\t\t\\n\"\n#ifdef CONFIG_CHECK_STACK_POINTER_RANGE_ENABLE\n\t\t\t\"\tpush\t\t{r0, lr}\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tsub\t\t\tr0, r0, #0x20\t\t\t\t\t\t\\n\"\n\t\t\t\"\tldr\t\t\tr1, =%[checkStackPointerWrapper]\t\\n\"\n\t\t\t\"\tblx\t\t\tr1\t\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tpop\t\t\t{r0, r1}\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tmov\t\t\tlr, r1\t\t\t\t\t\t\t\t\\n\"\n#endif\t\/\/ def CONFIG_CHECK_STACK_POINTER_RANGE_ENABLE\n\t\t\t\"\tsub\t\t\tr0, #0x10\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tstmia\t\tr0!, {r4-r7}\t\t\t\t\t\t\\n\"\t\/\/ save lower half of current thread's context\n\t\t\t\"\tmov\t\t\tr4, r8\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tmov\t\t\tr5, r9\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tmov\t\t\tr6, r10\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tmov\t\t\tr7, r11\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tsub\t\t\tr0, #0x20\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tstmia\t\tr0!, {r4-r7}\t\t\t\t\t\t\\n\"\t\/\/ save upper half of current thread's context\n\t\t\t\"\tsub\t\t\tr0, #0x10\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tmov\t\t\tr4, lr\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\t\t\t\t\t\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tldr\t\t\tr1, =%[schedulerSwitchContext]\t\t\\n\"\n\t\t\t\"\tblx\t\t\tr1\t\t\t\t\t\t\t\t\t\\n\"\t\/\/ switch context\n\t\t\t\"\t\t\t\t\t\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tmov\t\t\tlr, r4\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tldmia\t\tr0!, {r4-r7}\t\t\t\t\t\t\\n\"\t\/\/ load upper half of new thread's context\n\t\t\t\"\tmov\t\t\tr8, r4\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tmov\t\t\tr9, r5\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tmov\t\t\tr10, r6\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tmov\t\t\tr11, r7\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tldmia\t\tr0!, {r4-r7}\t\t\t\t\t\t\\n\"\t\/\/ load lower half of new thread's context\n\t\t\t\"\tmsr\t\t\tpsp, r0\t\t\t\t\t\t\t\t\\n\"\n#else\t\/\/ !def __ARM_ARCH_6M__\n\t\t\t\"\tmrs\t\t\tr0, psp\t\t\t\t\t\t\t\t\\n\"\n#ifdef CONFIG_CHECK_STACK_POINTER_RANGE_ENABLE\n\t\t\t\"\tpush\t\t{r0, lr}\t\t\t\t\t\t\t\\n\"\n#if __FPU_PRESENT == 1 && __FPU_USED == 1\n\t\t\t\"\ttst\t\t\tlr, #(1 << 4)\t\t\t\t\t\t\\n\"\t\/\/ was floating-point used by the thread?\n\t\t\t\"\tit\t\t\teq\t\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tsubeq\t\tr0, r0, #0x40\t\t\t\t\t\t\\n\"\t\/\/ account for size of \"floating-pont\" context\n\t\t\t\"\tsub\t\t\tr0, r0, #0x28\t\t\t\t\t\t\\n\"\n#else\t\/\/ __FPU_PRESENT != 1 || __FPU_USED != 1\n\t\t\t\"\tsub\t\t\tr0, r0, #0x20\t\t\t\t\t\t\\n\"\n#endif\t\/\/ __FPU_PRESENT != 1 || __FPU_USED != 1\n\t\t\t\"\tbl\t\t\t%[checkStackPointerWrapper]\t\t\t\\n\"\n\t\t\t\"\tpop\t\t\t{r0, lr}\t\t\t\t\t\t\t\\n\"\n#endif\t\/\/ def CONFIG_CHECK_STACK_POINTER_RANGE_ENABLE\n#if __FPU_PRESENT == 1 && __FPU_USED == 1\n\t\t\t\"\ttst\t\t\tlr, #(1 << 4)\t\t\t\t\t\t\\n\"\t\/\/ was floating-point used by the thread?\n\t\t\t\"\tit\t\t\teq\t\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tvstmdbeq\tr0!, {s16-s31}\t\t\t\t\t\t\\n\"\t\/\/ save \"floating-point\" context of current thread\n\t\t\t\/\/ save \"regular\" context of current thread (r12 is saved just to keep double-word alignment)\n\t\t\t\"\tstmdb\t\tr0!, {r4-r12, lr}\t\t\t\t\t\\n\"\n#else\t\/\/ __FPU_PRESENT != 1 || __FPU_USED != 1\n\t\t\t\"\tstmdb\t\tr0!, {r4-r11}\t\t\t\t\t\t\\n\"\t\/\/ save context of current thread\n\t\t\t\"\tmov\t\t\tr4, lr\t\t\t\t\t\t\t\t\\n\"\n#endif\t\/\/ __FPU_PRESENT != 1 || __FPU_USED != 1\n\t\t\t\"\t\t\t\t\t\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tbl\t\t\t%[schedulerSwitchContext]\t\t\t\\n\"\t\/\/ switch context\n\t\t\t\"\t\t\t\t\t\t\t\t\t\t\t\t\t\\n\"\n#if __FPU_PRESENT == 1 && __FPU_USED == 1\n\t\t\t\"\tldmia\t\tr0!, {r4-r12, lr}\t\t\t\t\t\\n\"\t\/\/ load \"regular\" context of new thread\n\t\t\t\"\ttst\t\t\tlr, #(1 << 4)\t\t\t\t\t\t\\n\"\t\/\/ was floating-point used by the thread?\n\t\t\t\"\tit\t\t\teq\t\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tvldmiaeq\tr0!, {s16-s31}\t\t\t\t\t\t\\n\"\t\/\/ load \"floating-point\" context of new thread\n#else\t\/\/ __FPU_PRESENT != 1 || __FPU_USED != 1\n\t\t\t\"\tmov\t\t\tlr, r4\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tldmia\t\tr0!, {r4-r11}\t\t\t\t\t\t\\n\"\t\/\/ load context of new thread\n#endif\t\/\/ __FPU_PRESENT != 1 || __FPU_USED != 1\n\t\t\t\"\tmsr\t\t\tpsp, r0\t\t\t\t\t\t\t\t\\n\"\n#endif\t\/\/ !def __ARM_ARCH_6M__\n\t\t\t\"\t\t\t\t\t\t\t\t\t\t\t\t\t\\n\"\n#if CONFIG_ARCHITECTURE_ARMV7_M_KERNEL_BASEPRI != 0\n\t\t\t\"\tmov\t\t\tr0, #0\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tmsr\t\t\tbasepri, r0\t\t\t\t\t\t\t\\n\"\t\/\/ disable interrupt masking\n#else\t\/\/ CONFIG_ARCHITECTURE_ARMV7_M_KERNEL_BASEPRI == 0\n\t\t\t\"\tcpsie\t\ti\t\t\t\t\t\t\t\t\t\\n\"\t\/\/ enable interrupts\n#endif\t\/\/ CONFIG_ARCHITECTURE_ARMV7_M_KERNEL_BASEPRI == 0\n\t\t\t\"\t\t\t\t\t\t\t\t\t\t\t\t\t\\n\"\n\t\t\t\"\tbx\t\t\tlr\t\t\t\t\t\t\t\t\t\\n\"\t\/\/ return to new thread\n\n\t\t\t::\n#if CONFIG_ARCHITECTURE_ARMV7_M_KERNEL_BASEPRI != 0\n\t\t\t\t[basepriValue] \"i\" (basepriValue),\n#endif\t\/\/ CONFIG_ARCHITECTURE_ARMV7_M_KERNEL_BASEPRI != 0\n#ifdef CONFIG_CHECK_STACK_POINTER_RANGE_ENABLE\n\t\t\t\t[checkStackPointerWrapper] \"i\" (checkStackPointerWrapper),\n#endif\t\/\/ def CONFIG_CHECK_STACK_POINTER_RANGE_ENABLE\n\t\t\t\t[schedulerSwitchContext] \"i\" (schedulerSwitchContextWrapper)\n\t);\n\n\t__builtin_unreachable();\n}\n\n}\t\/\/ namespace distortos\n<|endoftext|>"}
{"text":"<commit_before>\/* This file is part of the KDE libraries\n   Copyright (C) 2006 Hamish Rodda <rodda@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#include \"katecompletiontree.h\"\n\n#include <QtGui\/QHeaderView>\n#include <QtGui\/QScrollBar>\n#include <QVector>\n#include <QTimer>\n#include <QApplication>\n#include <QDesktopWidget>\n\n#include \"kateview.h\"\n#include \"katerenderer.h\"\n#include \"kateconfig.h\"\n\n#include \"katecompletionwidget.h\"\n#include \"katecompletiondelegate.h\"\n#include \"katecompletionmodel.h\"\n\nKateCompletionTree::KateCompletionTree(KateCompletionWidget* parent)\n  : ExpandingTree(parent), m_needResize(false)\n{\n  setUniformRowHeights(false);\n  header()->hide();\n  setRootIsDecorated(false);\n  setIndentation(0);\n  setFrameStyle(QFrame::NoFrame);\n  setAllColumnsShowFocus(true);\n  setAlternatingRowColors(true);\n\n  m_resizeTimer = new QTimer(this);\n  m_resizeTimer->setSingleShot(true);\n\n  connect(m_resizeTimer, SIGNAL(timeout()), this, SLOT(resizeColumnsSlot()));\n  \n  \/\/ Provide custom highlighting to completion entries\n  setItemDelegate(new KateCompletionDelegate(widget()->model(), widget()));\n\n  \/\/ Prevent user from expanding \/ collapsing with the mouse\n  setItemsExpandable(false);\n}\n\nvoid KateCompletionTree::currentChanged ( const QModelIndex & current, const QModelIndex & previous ) {\n  widget()->model()->rowSelected(current);\n  QTreeView::currentChanged(current, previous);\n}\n\nvoid KateCompletionTree::scrollContentsBy( int dx, int dy )\n{\n  QTreeView::scrollContentsBy(dx, dy);\n\n  if (isVisible())\n    m_resizeTimer->start(300);\n}\n\nKateCompletionWidget * KateCompletionTree::widget( ) const\n{\n  return static_cast<KateCompletionWidget*>(const_cast<QObject*>(parent()));\n}\n\nvoid KateCompletionTree::resizeColumnsSlot()\n{\n  resizeColumns();\n}\n\nvoid KateCompletionTree::resizeColumns(bool fromResizeEvent, bool firstShow)\n{\n  static bool firstCall = false;\n  if (firstCall)\n    return;\n\n  if( firstShow ) { \/\/\/@todo This might make some flickering, but is needed because visualRect(..) for group child-indices returns invalid rects before the widget is shown\n    m_resizeTimer->start(100);\n    m_needResize = true;\n  } else if( m_needResize ) {\n    m_needResize = false;\n    firstShow = true;\n  }\n\n  firstCall = true;\n\n  widget()->setUpdatesEnabled(false);\n\n  int modelIndexOfName = kateModel()->translateColumn(KTextEditor::CodeCompletionModel::Name);\n  int oldIndentWidth = columnViewportPosition(modelIndexOfName);\n\n  \/\/\/Step 1: Compute the needed column-sizes for the visible content\n  QRect visibleViewportRect(0, 0, width(), height());\n\n  int numColumns = model()->columnCount();\n  \n  QVector<int> columnSize(numColumns, 5);\n  columnSize[0] = 50;\n\n  QModelIndex current = indexAt(QPoint(1,1));\n\n  if( current.child(0,0).isValid() ) \/\/If the index has children, it is a group-label. Then we should start with it's first child.\n    current = current.child(0,0);\n\n  int num = 0;\n  bool changed = false;\n  while( current.isValid() && visualRect(current).isValid() && visualRect(current).intersects(visibleViewportRect) )\n  {\n    changed = true;\n    num++;\n    for( int a = 0; a < numColumns; a++ )\n    {\n      QSize s = sizeHintForIndex (current.sibling(current.row(), a));\n      if( s.width() > columnSize[a] && s.width() < 700 )\n        columnSize[a] = s.width();\n      else if( s.width() > 700 )\n        kDebug() << \"got invalid size-hint of width \" << s.width();\n    }\n\n    QModelIndex oldCurrent = current;\n    current = current.sibling(current.row()+1, 0);\n    \n    \/\/Are we at the end of a group? If yes, move on into the next group\n    if( !current.isValid() && oldCurrent.parent().isValid() ) {\n      current = oldCurrent.parent().sibling( oldCurrent.parent().row()+1, 0 );\n      if( current.isValid() && current.child(0,0).isValid() )\n        current = current.child(0,0);\n    }\n  }\n\n  int totalColumnsWidth = 0;\n\n  \/\/\/Step 2: Update column-sizes\n  if( changed ) {\n\n    int minimumResize = 0;\n    int maximumResize = 0;\n    for( int n = 0; n < numColumns; n++ ) {\n      totalColumnsWidth += columnSize[n];\n      \n      int diff = columnSize[n] - columnWidth(n);\n      if( diff < minimumResize )\n        minimumResize = diff;\n      if( diff > maximumResize )\n        maximumResize = diff;\n    }\n\n    if( minimumResize > -40 && maximumResize == 0 ) {\n      \/\/No column needs to be exanded, and no column needs to be reduced by more then 40 pixels.\n      \/\/To prevent flashing, do not resize at all.\n      totalColumnsWidth = 0;\n      for( int n = 0; n < numColumns; n++ ) {\n        columnSize[n] = columnWidth(n);\n        totalColumnsWidth += columnSize[n];\n      }\n    } else {\n      \/\/It may happen that while initial showing, no visual rectangles can be retrieved.\n      for( int n = 0; n < numColumns; n++ )\n        setColumnWidth(n, columnSize[n]);\n    }\n  }\n\n  \/\/\/Step 3: Update widget-size and -position\n  \n  int newIndentWidth = columnViewportPosition(modelIndexOfName);\n\n  int scrollBarWidth = verticalScrollBar()->width();\n  int newMinWidth = totalColumnsWidth \/*+ scrollBarWidth*\/;\n\n  int minWidth = qMax(500, newMinWidth);\n\n  \/\/kDebug() << \"New min width: \" << minWidth << \" Old min: \" << minimumWidth() << \" width \" << width();\n  setMinimumWidth(minWidth);\n\n  if (!fromResizeEvent && (firstShow || oldIndentWidth != newIndentWidth))\n  {\n    \/\/Never allow a completion-widget to be wider than 2\/3 of the screen\n    int maxWidth = (QApplication::desktop()->screenGeometry(widget()->view()).width()*3) \/ 4;\n    int newWidth = qMin(maxWidth, minWidth); \n    \/\/kDebug() << \"fromResize \" << fromResizeEvent << \" indexOfName \" << modelIndexOfName << \" oldI \" << oldIndentWidth << \" newI \" << newIndentWidth << \" minw \" << minWidth << \" w \" << widget()->width() << \" newW \" << newWidth;\n    widget()->resize(newWidth + scrollBarWidth, widget()->height());\n  }\n\n  if( totalColumnsWidth ) \/\/Set the size of the last column to fill the whole rest of the widget\n    setColumnWidth(numColumns-1, width() - totalColumnsWidth + columnSize[numColumns-1]);\n  \n  if (oldIndentWidth != newIndentWidth)\n    widget()->updatePosition();\n\n  widget()->setUpdatesEnabled(true);\n\n  firstCall = false;\n}\n\nQStyleOptionViewItem KateCompletionTree::viewOptions( ) const\n{\n  QStyleOptionViewItem opt = QTreeView::viewOptions();\n\n  opt.font = widget()->view()->renderer()->config()->font();\n\n  return opt;\n}\n\nKateCompletionModel * KateCompletionTree::kateModel( ) const\n{\n  return static_cast<KateCompletionModel*>(model());\n}\n\nbool KateCompletionTree::nextCompletion()\n{\n  QModelIndex current;\n  QModelIndex firstCurrent = currentIndex();\n\n  do {\n    QModelIndex oldCurrent = currentIndex();\n\n    current = moveCursor(MoveDown, Qt::NoModifier);\n\n    if (current != oldCurrent && current.isValid()) {\n      setCurrentIndex(current);\n\n    } else {\n      if (firstCurrent.isValid())\n        setCurrentIndex(firstCurrent);\n      return false;\n    }\n\n  } while (!kateModel()->indexIsItem(current));\n\n  return true;\n}\n\nbool KateCompletionTree::previousCompletion()\n{\n  QModelIndex current;\n  QModelIndex firstCurrent = currentIndex();\n\n  do {\n    QModelIndex oldCurrent = currentIndex();\n\n    current = moveCursor(MoveUp, Qt::NoModifier);\n\n    if (current != oldCurrent && current.isValid()) {\n      setCurrentIndex(current);\n\n    } else {\n      if (firstCurrent.isValid())\n        setCurrentIndex(firstCurrent);\n      return false;\n    }\n\n  } while (!kateModel()->indexIsItem(current));\n\n  return true;\n}\n\nbool KateCompletionTree::pageDown( )\n{\n  QModelIndex old = currentIndex();\n  QModelIndex current = moveCursor(MovePageDown, Qt::NoModifier);\n\n  if (current.isValid()) {\n    setCurrentIndex(current);\n    if (!kateModel()->indexIsItem(current))\n      if (!nextCompletion())\n        previousCompletion();\n  }\n\n  return current != old;\n}\n\nbool KateCompletionTree::pageUp( )\n{\n  QModelIndex old = currentIndex();\n  QModelIndex current = moveCursor(MovePageUp, Qt::NoModifier);\n\n  if (current.isValid()) {\n    setCurrentIndex(current);\n    if (!kateModel()->indexIsItem(current))\n      if (!previousCompletion())\n        nextCompletion();\n  }\n  return current != old;\n}\n\nvoid KateCompletionTree::top( )\n{\n  QModelIndex current = moveCursor(MoveHome, Qt::NoModifier);\n  setCurrentIndex(current);\n\n  if (current.isValid()) {\n    setCurrentIndex(current);\n    if (!kateModel()->indexIsItem(current))\n      nextCompletion();\n  }\n}\n\nvoid KateCompletionTree::bottom( )\n{\n  QModelIndex current = moveCursor(MoveEnd, Qt::NoModifier);\n  setCurrentIndex(current);\n\n  if (current.isValid()) {\n    setCurrentIndex(current);\n    if (!kateModel()->indexIsItem(current))\n      previousCompletion();\n  }\n}\n\n#include \"katecompletiontree.moc\"\n<commit_msg>Move the invalid-width threshold up, so the widget is resized nicely for a function with very long signature<commit_after>\/* This file is part of the KDE libraries\n   Copyright (C) 2006 Hamish Rodda <rodda@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#include \"katecompletiontree.h\"\n\n#include <QtGui\/QHeaderView>\n#include <QtGui\/QScrollBar>\n#include <QVector>\n#include <QTimer>\n#include <QApplication>\n#include <QDesktopWidget>\n\n#include \"kateview.h\"\n#include \"katerenderer.h\"\n#include \"kateconfig.h\"\n\n#include \"katecompletionwidget.h\"\n#include \"katecompletiondelegate.h\"\n#include \"katecompletionmodel.h\"\n\nKateCompletionTree::KateCompletionTree(KateCompletionWidget* parent)\n  : ExpandingTree(parent), m_needResize(false)\n{\n  setUniformRowHeights(false);\n  header()->hide();\n  setRootIsDecorated(false);\n  setIndentation(0);\n  setFrameStyle(QFrame::NoFrame);\n  setAllColumnsShowFocus(true);\n  setAlternatingRowColors(true);\n\n  m_resizeTimer = new QTimer(this);\n  m_resizeTimer->setSingleShot(true);\n\n  connect(m_resizeTimer, SIGNAL(timeout()), this, SLOT(resizeColumnsSlot()));\n  \n  \/\/ Provide custom highlighting to completion entries\n  setItemDelegate(new KateCompletionDelegate(widget()->model(), widget()));\n\n  \/\/ Prevent user from expanding \/ collapsing with the mouse\n  setItemsExpandable(false);\n}\n\nvoid KateCompletionTree::currentChanged ( const QModelIndex & current, const QModelIndex & previous ) {\n  widget()->model()->rowSelected(current);\n  QTreeView::currentChanged(current, previous);\n}\n\nvoid KateCompletionTree::scrollContentsBy( int dx, int dy )\n{\n  QTreeView::scrollContentsBy(dx, dy);\n\n  if (isVisible())\n    m_resizeTimer->start(300);\n}\n\nKateCompletionWidget * KateCompletionTree::widget( ) const\n{\n  return static_cast<KateCompletionWidget*>(const_cast<QObject*>(parent()));\n}\n\nvoid KateCompletionTree::resizeColumnsSlot()\n{\n  resizeColumns();\n}\n\nvoid KateCompletionTree::resizeColumns(bool fromResizeEvent, bool firstShow)\n{\n  static bool firstCall = false;\n  if (firstCall)\n    return;\n\n  if( firstShow ) { \/\/\/@todo This might make some flickering, but is needed because visualRect(..) for group child-indices returns invalid rects before the widget is shown\n    m_resizeTimer->start(100);\n    m_needResize = true;\n  } else if( m_needResize ) {\n    m_needResize = false;\n    firstShow = true;\n  }\n\n  firstCall = true;\n\n  widget()->setUpdatesEnabled(false);\n\n  int modelIndexOfName = kateModel()->translateColumn(KTextEditor::CodeCompletionModel::Name);\n  int oldIndentWidth = columnViewportPosition(modelIndexOfName);\n\n  \/\/\/Step 1: Compute the needed column-sizes for the visible content\n  QRect visibleViewportRect(0, 0, width(), height());\n\n  int numColumns = model()->columnCount();\n  \n  QVector<int> columnSize(numColumns, 5);\n  columnSize[0] = 50;\n\n  QModelIndex current = indexAt(QPoint(1,1));\n\n  if( current.child(0,0).isValid() ) \/\/If the index has children, it is a group-label. Then we should start with it's first child.\n    current = current.child(0,0);\n\n  int num = 0;\n  bool changed = false;\n  while( current.isValid() && visualRect(current).isValid() && visualRect(current).intersects(visibleViewportRect) )\n  {\n    changed = true;\n    num++;\n    for( int a = 0; a < numColumns; a++ )\n    {\n      QSize s = sizeHintForIndex (current.sibling(current.row(), a));\n      if( s.width() > columnSize[a] && s.width() < 2000 )\n        columnSize[a] = s.width();\n      else if( s.width() > 2000 )\n        kDebug() << \"got invalid size-hint of width \" << s.width();\n    }\n\n    QModelIndex oldCurrent = current;\n    current = current.sibling(current.row()+1, 0);\n    \n    \/\/Are we at the end of a group? If yes, move on into the next group\n    if( !current.isValid() && oldCurrent.parent().isValid() ) {\n      current = oldCurrent.parent().sibling( oldCurrent.parent().row()+1, 0 );\n      if( current.isValid() && current.child(0,0).isValid() )\n        current = current.child(0,0);\n    }\n  }\n\n  int totalColumnsWidth = 0;\n\n  \/\/\/Step 2: Update column-sizes\n  if( changed ) {\n\n    int minimumResize = 0;\n    int maximumResize = 0;\n    for( int n = 0; n < numColumns; n++ ) {\n      totalColumnsWidth += columnSize[n];\n      \n      int diff = columnSize[n] - columnWidth(n);\n      if( diff < minimumResize )\n        minimumResize = diff;\n      if( diff > maximumResize )\n        maximumResize = diff;\n    }\n\n    if( minimumResize > -40 && maximumResize == 0 ) {\n      \/\/No column needs to be exanded, and no column needs to be reduced by more then 40 pixels.\n      \/\/To prevent flashing, do not resize at all.\n      totalColumnsWidth = 0;\n      for( int n = 0; n < numColumns; n++ ) {\n        columnSize[n] = columnWidth(n);\n        totalColumnsWidth += columnSize[n];\n      }\n    } else {\n      \/\/It may happen that while initial showing, no visual rectangles can be retrieved.\n      for( int n = 0; n < numColumns; n++ )\n        setColumnWidth(n, columnSize[n]);\n    }\n  }\n\n  \/\/\/Step 3: Update widget-size and -position\n  \n  int newIndentWidth = columnViewportPosition(modelIndexOfName);\n\n  int scrollBarWidth = verticalScrollBar()->width();\n  int newMinWidth = totalColumnsWidth \/*+ scrollBarWidth*\/;\n\n  int minWidth = qMax(500, newMinWidth);\n\n  \/\/kDebug() << \"New min width: \" << minWidth << \" Old min: \" << minimumWidth() << \" width \" << width();\n  setMinimumWidth(minWidth);\n\n  if (!fromResizeEvent && (firstShow || oldIndentWidth != newIndentWidth))\n  {\n    \/\/Never allow a completion-widget to be wider than 2\/3 of the screen\n    int maxWidth = (QApplication::desktop()->screenGeometry(widget()->view()).width()*3) \/ 4;\n    int newWidth = qMin(maxWidth, minWidth); \n    \/\/kDebug() << \"fromResize \" << fromResizeEvent << \" indexOfName \" << modelIndexOfName << \" oldI \" << oldIndentWidth << \" newI \" << newIndentWidth << \" minw \" << minWidth << \" w \" << widget()->width() << \" newW \" << newWidth;\n    widget()->resize(newWidth + scrollBarWidth, widget()->height());\n  }\n\n  if( totalColumnsWidth ) \/\/Set the size of the last column to fill the whole rest of the widget\n    setColumnWidth(numColumns-1, width() - totalColumnsWidth + columnSize[numColumns-1]);\n  \n  if (oldIndentWidth != newIndentWidth)\n    widget()->updatePosition();\n\n  widget()->setUpdatesEnabled(true);\n\n  firstCall = false;\n}\n\nQStyleOptionViewItem KateCompletionTree::viewOptions( ) const\n{\n  QStyleOptionViewItem opt = QTreeView::viewOptions();\n\n  opt.font = widget()->view()->renderer()->config()->font();\n\n  return opt;\n}\n\nKateCompletionModel * KateCompletionTree::kateModel( ) const\n{\n  return static_cast<KateCompletionModel*>(model());\n}\n\nbool KateCompletionTree::nextCompletion()\n{\n  QModelIndex current;\n  QModelIndex firstCurrent = currentIndex();\n\n  do {\n    QModelIndex oldCurrent = currentIndex();\n\n    current = moveCursor(MoveDown, Qt::NoModifier);\n\n    if (current != oldCurrent && current.isValid()) {\n      setCurrentIndex(current);\n\n    } else {\n      if (firstCurrent.isValid())\n        setCurrentIndex(firstCurrent);\n      return false;\n    }\n\n  } while (!kateModel()->indexIsItem(current));\n\n  return true;\n}\n\nbool KateCompletionTree::previousCompletion()\n{\n  QModelIndex current;\n  QModelIndex firstCurrent = currentIndex();\n\n  do {\n    QModelIndex oldCurrent = currentIndex();\n\n    current = moveCursor(MoveUp, Qt::NoModifier);\n\n    if (current != oldCurrent && current.isValid()) {\n      setCurrentIndex(current);\n\n    } else {\n      if (firstCurrent.isValid())\n        setCurrentIndex(firstCurrent);\n      return false;\n    }\n\n  } while (!kateModel()->indexIsItem(current));\n\n  return true;\n}\n\nbool KateCompletionTree::pageDown( )\n{\n  QModelIndex old = currentIndex();\n  QModelIndex current = moveCursor(MovePageDown, Qt::NoModifier);\n\n  if (current.isValid()) {\n    setCurrentIndex(current);\n    if (!kateModel()->indexIsItem(current))\n      if (!nextCompletion())\n        previousCompletion();\n  }\n\n  return current != old;\n}\n\nbool KateCompletionTree::pageUp( )\n{\n  QModelIndex old = currentIndex();\n  QModelIndex current = moveCursor(MovePageUp, Qt::NoModifier);\n\n  if (current.isValid()) {\n    setCurrentIndex(current);\n    if (!kateModel()->indexIsItem(current))\n      if (!previousCompletion())\n        nextCompletion();\n  }\n  return current != old;\n}\n\nvoid KateCompletionTree::top( )\n{\n  QModelIndex current = moveCursor(MoveHome, Qt::NoModifier);\n  setCurrentIndex(current);\n\n  if (current.isValid()) {\n    setCurrentIndex(current);\n    if (!kateModel()->indexIsItem(current))\n      nextCompletion();\n  }\n}\n\nvoid KateCompletionTree::bottom( )\n{\n  QModelIndex current = moveCursor(MoveEnd, Qt::NoModifier);\n  setCurrentIndex(current);\n\n  if (current.isValid()) {\n    setCurrentIndex(current);\n    if (!kateModel()->indexIsItem(current))\n      previousCompletion();\n  }\n}\n\n#include \"katecompletiontree.moc\"\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <gcl\/mp\/type_traits.hpp>\n\n#include <array>\n#include <algorithm>\n#include <type_traits>\n#include <ranges>\n\nnamespace gcl::cx::concepts\n{\n    template <typename T>\n    concept array_value = gcl::mp::type_traits::is_std_array_v<T> or std::is_array_v<T>;\n}\nnamespace gcl::cx::array\n{\n    template <concepts::array_value auto arg>\n    consteval static auto remove_duplicates()\n    {\n        using argument_type = decltype(arg);\n        using value_type = typename argument_type::value_type;\n\n        constexpr auto size = []() consteval\n        {\n            auto copy = arg;\n            std::ranges::sort(copy);\n            return std::ranges::size(arg) - std::ranges::size(std::ranges::unique(copy));\n        }\n        ();\n\n        auto copy = arg;\n        std::ranges::sort(copy);\n        auto last_not_duplicate = std::unique(std::begin(copy), std::end(copy));\n\n        using return_type = std::array<value_type, size>;\n        return_type return_value;\n        std::copy(std::begin(copy), last_not_duplicate, std::begin(return_value));\n        return return_value;\n    };\n    template <concepts::array_value auto arg>\n    constexpr static auto remove_duplicates_v = remove_duplicates<arg>();\n    template <concepts::array_value auto arg>\n    using remove_duplicates_t = typename std::decay_t<decltype(remove_duplicates_v<arg>)>;\n\n    template <typename... Ts>\n    consteval auto to_array(Ts&&... values)\n    {\n        using element_type = std::common_type_t<Ts...>;\n        using array_type = std::array<element_type, sizeof...(values)>;\n        return array_type{std::forward<decltype(values)>(values)...};\n    }\n    template <auto... values>\n    consteval auto to_array()\n    {\n        using element_type = std::common_type_t<decltype(values)...>;\n        using array_type = std::array<element_type, sizeof...(values)>;\n        return array_type{std::forward<decltype(values)>(values)...};\n    }\n    template <typename T, std::size_t N, typename FunctionType>\n    consteval auto to_parameter_pack(std::array<T, N> values, FunctionType&& function)\n    {\n        return [&]<std::size_t... indexes>(std::index_sequence<indexes...>) consteval\n        {\n            return function(values.at(indexes)...);\n        }\n        (std::make_index_sequence<N>{});\n    }\n}\n\nnamespace gcl::cx::tests::array\n{\n    constexpr auto datas = std::array{'a', 'b', 'a', 'c', 'a'};\n    static_assert(std::is_same_v<std::array<char, 3>, gcl::cx::array::remove_duplicates_t<datas>>);\n    static_assert(gcl::cx::array::remove_duplicates_v<datas> == std::array{'a', 'b', 'c'});\n    static_assert(gcl::cx::array::to_array('a', 'b', 'c') == std::array{'a', 'b', 'c'});\n    static_assert(gcl::cx::array::to_array<'a', 'b', 'c'>() == std::array{'a', 'b', 'c'});\n}<commit_msg>[gcl::cx::array] remove to_parameter_pack for now, as not really useful<commit_after>#pragma once\n\n#include <gcl\/mp\/type_traits.hpp>\n\n#include <array>\n#include <algorithm>\n#include <type_traits>\n#include <ranges>\n\nnamespace gcl::cx::concepts\n{\n    template <typename T>\n    concept array_value = gcl::mp::type_traits::is_std_array_v<T> or std::is_array_v<T>;\n}\nnamespace gcl::cx::array\n{\n    template <concepts::array_value auto arg>\n    consteval static auto remove_duplicates()\n    {\n        using argument_type = decltype(arg);\n        using value_type = typename argument_type::value_type;\n\n        constexpr auto size = []() consteval\n        {\n            auto copy = arg;\n            std::ranges::sort(copy);\n            return std::ranges::size(arg) - std::ranges::size(std::ranges::unique(copy));\n        }\n        ();\n\n        auto copy = arg;\n        std::ranges::sort(copy);\n        auto last_not_duplicate = std::unique(std::begin(copy), std::end(copy));\n\n        using return_type = std::array<value_type, size>;\n        return_type return_value;\n        std::copy(std::begin(copy), last_not_duplicate, std::begin(return_value));\n        return return_value;\n    };\n    template <concepts::array_value auto arg>\n    constexpr static auto remove_duplicates_v = remove_duplicates<arg>();\n    template <concepts::array_value auto arg>\n    using remove_duplicates_t = typename std::decay_t<decltype(remove_duplicates_v<arg>)>;\n\n    template <typename... Ts>\n    consteval auto to_array(Ts&&... values)\n    {\n        using element_type = std::common_type_t<Ts...>;\n        using array_type = std::array<element_type, sizeof...(values)>;\n        return array_type{std::forward<decltype(values)>(values)...};\n    }\n    template <auto... values>\n    consteval auto to_array()\n    {\n        using element_type = std::common_type_t<decltype(values)...>;\n        using array_type = std::array<element_type, sizeof...(values)>;\n        return array_type{std::forward<decltype(values)>(values)...};\n    }\n\n    \/\/ WIP\n    \/\/ template <typename T, std::size_t N, typename FunctionType>\n    \/\/ requires(std::invocable<FunctionType, )\n    \/\/ consteval auto to_parameter_pack(std::array<T, N> values, FunctionType&& function)\n    \/\/ {\n    \/\/     return [&]<std::size_t... indexes>(std::index_sequence<indexes...>) consteval\n    \/\/     {\n    \/\/         return function(values.at(indexes)...);\n    \/\/     }\n    \/\/     (std::make_index_sequence<N>{});\n    \/\/ }\n}\n\nnamespace gcl::cx::tests::array\n{\n    constexpr auto datas = std::array{'a', 'b', 'a', 'c', 'a'};\n    static_assert(std::is_same_v<std::array<char, 3>, gcl::cx::array::remove_duplicates_t<datas>>);\n    static_assert(gcl::cx::array::remove_duplicates_v<datas> == std::array{'a', 'b', 'c'});\n    static_assert(gcl::cx::array::to_array('a', 'b', 'c') == std::array{'a', 'b', 'c'});\n    static_assert(gcl::cx::array::to_array<'a', 'b', 'c'>() == std::array{'a', 'b', 'c'});\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: xmlstreamio.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#include \"diagnose.hxx\"\n#include <stdio.h>\n#include <stdarg.h>\n#include \"rtl\/instance.hxx\"\n#include \"rtl\/bootstrap.hxx\"\n\nnamespace xmlsecurity {\n\nstruct UseDiagnose : public rtl::StaticWithInit<\n    const bool, UseDiagnose>\n{\n    const bool operator () ()\n    {\n        ::rtl::OUString value;\n        sal_Bool res = rtl::Bootstrap::get(\n            ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"XMLSECURITY_TRACE\")), value);\n        return res == sal_True ? true : false;\n    }\n};\n\n\/* the function will print the string when\n   - build with debug\n   - the bootstrap variable XMLSECURITY_TRACE is set.\n *\/\nvoid xmlsec_trace(const char* pszFormat, ...)\n{\n    bool bDebug = false;\n\n#if OSL_DEBUG_LEVEL > 1\n    bDebug = true;\n#endif\n    if (bDebug || UseDiagnose::get())\n    {\n        va_list args;\n        fprintf(stderr, \"[xmlsecurity] \");\n        va_start(args, pszFormat);\n        vfprintf(stderr, pszFormat, args);\n        va_end(args);\n\n        fprintf(stderr,\"\\n\");\n        fflush(stderr);\n    }\n}\n\n\n\n}\n<commit_msg>CWS-TOOLING: integrate CWS cmcfixes73<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: xmlstreamio.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#include \"diagnose.hxx\"\n#include <stdio.h>\n#include <stdarg.h>\n#include \"rtl\/instance.hxx\"\n#include \"rtl\/bootstrap.hxx\"\n\nnamespace xmlsecurity {\n\nstruct UseDiagnose : public rtl::StaticWithInit<\n    const bool, UseDiagnose>\n{\n    bool operator () () const\n    {\n        ::rtl::OUString value;\n        sal_Bool res = rtl::Bootstrap::get(\n            ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"XMLSECURITY_TRACE\")), value);\n        return res == sal_True ? true : false;\n    }\n};\n\n\/* the function will print the string when\n   - build with debug\n   - the bootstrap variable XMLSECURITY_TRACE is set.\n *\/\nvoid xmlsec_trace(const char* pszFormat, ...)\n{\n    bool bDebug = false;\n\n#if OSL_DEBUG_LEVEL > 1\n    bDebug = true;\n#endif\n    if (bDebug || UseDiagnose::get())\n    {\n        va_list args;\n        fprintf(stderr, \"[xmlsecurity] \");\n        va_start(args, pszFormat);\n        vfprintf(stderr, pszFormat, args);\n        va_end(args);\n\n        fprintf(stderr,\"\\n\");\n        fflush(stderr);\n    }\n}\n\n\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"dcptimezoneconf.h\"\n#include \"dcptimezonedata.h\"\n\n#include <unicode\/timezone.h>\n#include \"dcpicuconversions.h\"\n#include <QDebug>\n\nDcpTimeZoneConf *DcpTimeZoneConf::sm_Instance = 0;\n\nDcpTimeZoneConf* DcpTimeZoneConf::instance()\n{\n    if (!sm_Instance) {\n        sm_Instance = new DcpTimeZoneConf();\n    }\n\n    return sm_Instance;\n}\n\nDcpTimeZoneConf::~DcpTimeZoneConf()\n{\n    if (sm_Instance) {\n        delete sm_Instance;\n    }\n\n    m_ItemMap.clear();\n}\n\nQMap<int, DcpTimeZoneData*> DcpTimeZoneConf::getMap() const\n{\n    return m_ItemMap;\n}\n\nDcpTimeZoneData DcpTimeZoneConf::defaultTimeZone() const\n{\n    UnicodeString defaultZone;\n    icu::TimeZone::createDefault()->getDisplayName(defaultZone);\n    QString zoneId = unicodeStringToQString(defaultZone);\n    qDebug() << \"DEFAULT TIME ZONE : \" << zoneId;\n    DcpTimeZoneData timeZone(zoneId);\n    return timeZone;\n}\n\n\/\/! protected constructor\nDcpTimeZoneConf::DcpTimeZoneConf()\n                :QObject()\n{\n    \/\/ fill up m_ItemMap\n    QStringList list = this->supportedTimeZones();\n    QStringListIterator iter(list);\n    int count = 1;\n    while (iter.hasNext()) {\n        QString item = iter.next();\n        if (item.contains(\"Europe\") || item.contains(\"America\") || \n            item.contains(\"Asia\") || item.contains(\"Australia\") ||\n            item.contains(\"Indian\") || item.contains(\"Africa\") ||\n            item.contains(\"Pacific\") || item.contains(\"Mideast\") ||\n            item.contains(\"Brazil\") || item.contains(\"Atlantic\") ||\n            item.contains(\"Arctic\") || item.contains(\"Antarctica\"))\n            m_ItemMap[count++] = new DcpTimeZoneData(iter.next());\n    }\n}\n\nQStringList DcpTimeZoneConf::supportedTimeZones()\n{\n    icu::StringEnumeration *stringEnum = icu::TimeZone::createEnumeration();\n    QStringList result;\n    UErrorCode status = U_ZERO_ERROR;\n    const UnicodeString *next = stringEnum->snext(status);\n    while (next != 0) {\n        result << unicodeStringToQString(*next);\n        next = stringEnum->snext(status);\n    }\n\n    delete stringEnum;\n    return result;\n}\n\n<commit_msg>Missing include from the previous commit<commit_after>#include \"dcptimezoneconf.h\"\n#include \"dcptimezonedata.h\"\n\n#include <unicode\/timezone.h>\n#include <unicode\/strenum.h>\n#include \"dcpicuconversions.h\"\n#include <QDebug>\n\nDcpTimeZoneConf *DcpTimeZoneConf::sm_Instance = 0;\n\nDcpTimeZoneConf* DcpTimeZoneConf::instance()\n{\n    if (!sm_Instance) {\n        sm_Instance = new DcpTimeZoneConf();\n    }\n\n    return sm_Instance;\n}\n\nDcpTimeZoneConf::~DcpTimeZoneConf()\n{\n    if (sm_Instance) {\n        delete sm_Instance;\n    }\n\n    m_ItemMap.clear();\n}\n\nQMap<int, DcpTimeZoneData*> DcpTimeZoneConf::getMap() const\n{\n    return m_ItemMap;\n}\n\nDcpTimeZoneData DcpTimeZoneConf::defaultTimeZone() const\n{\n    UnicodeString defaultZone;\n    icu::TimeZone::createDefault()->getDisplayName(defaultZone);\n    QString zoneId = unicodeStringToQString(defaultZone);\n    qDebug() << \"DEFAULT TIME ZONE : \" << zoneId;\n    DcpTimeZoneData timeZone(zoneId);\n    return timeZone;\n}\n\n\/\/! protected constructor\nDcpTimeZoneConf::DcpTimeZoneConf()\n                :QObject()\n{\n    \/\/ fill up m_ItemMap\n    QStringList list = this->supportedTimeZones();\n    QStringListIterator iter(list);\n    int count = 1;\n    while (iter.hasNext()) {\n        QString item = iter.next();\n        if (item.contains(\"Europe\") || item.contains(\"America\") || \n            item.contains(\"Asia\") || item.contains(\"Australia\") ||\n            item.contains(\"Indian\") || item.contains(\"Africa\") ||\n            item.contains(\"Pacific\") || item.contains(\"Mideast\") ||\n            item.contains(\"Brazil\") || item.contains(\"Atlantic\") ||\n            item.contains(\"Arctic\") || item.contains(\"Antarctica\"))\n            m_ItemMap[count++] = new DcpTimeZoneData(iter.next());\n    }\n}\n\nQStringList DcpTimeZoneConf::supportedTimeZones()\n{\n    icu::StringEnumeration *stringEnum = icu::TimeZone::createEnumeration();\n    QStringList result;\n    UErrorCode status = U_ZERO_ERROR;\n    const UnicodeString *next = stringEnum->snext(status);\n    while (next != 0) {\n        result << unicodeStringToQString(*next);\n        next = stringEnum->snext(status);\n    }\n\n    delete stringEnum;\n    return result;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2000, 2010 Oracle and\/or its affiliates.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org.  If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#ifndef _TOOLKIT_HELPER_MACROS_HXX_\n#define _TOOLKIT_HELPER_MACROS_HXX_\n\n#include <comphelper\/servicehelper.hxx>\n\n#define IMPL_XUNOTUNNEL_MINIMAL( ClassName ) \\\nsal_Int64 ClassName::getSomething( const ::com::sun::star::uno::Sequence< sal_Int8 >& rIdentifier ) throw(::com::sun::star::uno::RuntimeException) \\\n{ \\\n    if( ( rIdentifier.getLength() == 16 ) && ( 0 == rtl_compareMemory( ClassName::GetUnoTunnelId().getConstArray(), rIdentifier.getConstArray(), 16 ) ) ) \\\n    { \\\n        return sal::static_int_cast< sal_Int64 >(reinterpret_cast< sal_IntPtr >(this)); \\\n    } \\\n    return 0; \\\n} \\\nnamespace \\\n{ \\\n    class the##ClassName##UnoTunnelId : public rtl::Static< UnoTunnelIdInit, the##ClassName##UnoTunnelId> {}; \\\n} \\\nconst ::com::sun::star::uno::Sequence< sal_Int8 >& ClassName::GetUnoTunnelId() throw() \\\n{ \\\n    return the##ClassName##UnoTunnelId::get().getSeq(); \\\n}\n\n#define IMPL_XUNOTUNNEL( ClassName ) \\\nIMPL_XUNOTUNNEL_MINIMAL( ClassName ) \\\nClassName* ClassName::GetImplementation( const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& rxIFace ) throw() \\\n{ \\\n    ::com::sun::star::uno::Reference< ::com::sun::star::lang::XUnoTunnel > xUT( rxIFace, ::com::sun::star::uno::UNO_QUERY ); \\\n    return xUT.is() ? reinterpret_cast<ClassName*>(sal::static_int_cast<sal_IntPtr>(xUT->getSomething( ClassName::GetUnoTunnelId() ))) : NULL; \\\n}\n\n#define IMPL_XUNOTUNNEL2( ClassName, BaseClass ) \\\nsal_Int64 ClassName::getSomething( const ::com::sun::star::uno::Sequence< sal_Int8 >& rIdentifier ) throw(::com::sun::star::uno::RuntimeException) \\\n{ \\\n    if( ( rIdentifier.getLength() == 16 ) && ( 0 == rtl_compareMemory( ClassName::GetUnoTunnelId().getConstArray(), rIdentifier.getConstArray(), 16 ) ) ) \\\n    { \\\n        return sal::static_int_cast< sal_Int64 >(reinterpret_cast< sal_IntPtr >(this)); \\\n    } \\\n    return BaseClass::getSomething( rIdentifier ); \\\n} \\\nnamespace \\\n{ \\\n    class the##ClassName##UnoTunnelId : public rtl::Static< UnoTunnelIdInit, the##ClassName##UnoTunnelId> {}; \\\n} \\\nconst ::com::sun::star::uno::Sequence< sal_Int8 >& ClassName::GetUnoTunnelId() throw() \\\n{ \\\n    return the##ClassName##UnoTunnelId::get().getSeq(); \\\n} \\\nClassName* ClassName::GetImplementation( const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& rxIFace ) throw() \\\n{ \\\n    ::com::sun::star::uno::Reference< ::com::sun::star::lang::XUnoTunnel > xUT( rxIFace, ::com::sun::star::uno::UNO_QUERY ); \\\n    return xUT.is() ? reinterpret_cast<ClassName*>(sal::static_int_cast<sal_IntPtr>(xUT->getSomething( ClassName::GetUnoTunnelId() ))) : NULL; \\\n}\n\n\/\/ -------------------------------------------------------------------------------------\n\n#define IMPL_IMPLEMENTATION_ID( ClassName ) \\\n::com::sun::star::uno::Sequence< sal_Int8 > ClassName::getImplementationId() throw(::com::sun::star::uno::RuntimeException) \\\n{ \\\n    static ::cppu::OImplementationId* pId = NULL; \\\n    if( !pId ) \\\n    { \\\n        ::osl::Guard< ::osl::Mutex > aGuard( ::osl::Mutex::getGlobalMutex() ); \\\n        if( ! pId ) \\\n        { \\\n            static ::cppu::OImplementationId id( sal_False ); \\\n            pId = &id; \\\n        } \\\n    } \\\n    return (*pId).getImplementationId(); \\\n}\n\n#define IMPL_XTYPEPROVIDER_START( ClassName )   \\\nIMPL_IMPLEMENTATION_ID( ClassName ) \\\n::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > ClassName::getTypes() throw(::com::sun::star::uno::RuntimeException) \\\n{ \\\n    static ::cppu::OTypeCollection* pCollection = NULL; \\\n    if( !pCollection ) \\\n    { \\\n        ::osl::Guard< ::osl::Mutex > aGuard( ::osl::Mutex::getGlobalMutex() ); \\\n        if( !pCollection ) \\\n        { \\\n            static ::cppu::OTypeCollection collection( \\\n            getCppuType( ( ::com::sun::star::uno::Reference< ::com::sun::star::lang::XTypeProvider>* ) NULL ),\n\n\/\/ -------------------------------------------------------------------------------------\n\n#define IMPL_XTYPEPROVIDER_END \\\n            ); \\\n            pCollection = &collection; \\\n        } \\\n    } \\\n    return (*pCollection).getTypes(); \\\n}\n\n\/\/ -------------------------------------------------------------------------------------\n\n#define DECL_LISTENERMULTIPLEXER_START( ClassName, InterfaceName ) \\\nclass ClassName : public ListenerMultiplexerBase, public InterfaceName \\\n{ \\\npublic: \\\n    ClassName( ::cppu::OWeakObject& rSource ); \\\n    ::com::sun::star::uno::Any  SAL_CALL queryInterface( const ::com::sun::star::uno::Type & rType ) throw(::com::sun::star::uno::RuntimeException); \\\n    void                        SAL_CALL acquire() throw()  { ListenerMultiplexerBase::acquire(); } \\\n    void                        SAL_CALL release() throw()  { ListenerMultiplexerBase::release(); } \\\n    void                        SAL_CALL disposing( const ::com::sun::star::lang::EventObject& Source ) throw(::com::sun::star::uno::RuntimeException);\n\n\/\/ -------------------------------------------------------------------------------------\n\n#define DECL_LISTENERMULTIPLEXER_START_DLLPUB( ClassName, InterfaceName ) \\\nclass TOOLKIT_DLLPUBLIC ClassName : public ListenerMultiplexerBase, public InterfaceName \\\n{ \\\npublic: \\\n    ClassName( ::cppu::OWeakObject& rSource ); \\\n    ::com::sun::star::uno::Any  SAL_CALL queryInterface( const ::com::sun::star::uno::Type & rType ) throw(::com::sun::star::uno::RuntimeException); \\\n    void                        SAL_CALL acquire() throw()  { ListenerMultiplexerBase::acquire(); } \\\n    void                        SAL_CALL release() throw()  { ListenerMultiplexerBase::release(); } \\\n    void                        SAL_CALL disposing( const ::com::sun::star::lang::EventObject& Source ) throw(::com::sun::star::uno::RuntimeException);\n\n\/\/ -------------------------------------------------------------------------------------\n\n#define DECL_LISTENERMULTIPLEXER_END \\\n};\n\n\/\/ -------------------------------------------------------------------------------------\n\n#define IMPL_LISTENERMULTIPLEXER_BASEMETHODS( ClassName, InterfaceName ) \\\nClassName::ClassName( ::cppu::OWeakObject& rSource ) \\\n    : ListenerMultiplexerBase( rSource ) \\\n{ \\\n} \\\n::com::sun::star::uno::Any ClassName::queryInterface( const ::com::sun::star::uno::Type & rType ) throw(::com::sun::star::uno::RuntimeException) \\\n{ \\\n    ::com::sun::star::uno::Any aRet = ::cppu::queryInterface( rType, \\\n                                        SAL_STATIC_CAST( ::com::sun::star::lang::XEventListener*, this ), \\\n                                        SAL_STATIC_CAST( InterfaceName*, this ) ); \\\n    return (aRet.hasValue() ? aRet : ListenerMultiplexerBase::queryInterface( rType )); \\\n} \\\nvoid ClassName::disposing( const ::com::sun::star::lang::EventObject& ) throw(::com::sun::star::uno::RuntimeException) \\\n{ \\\n}\n\n\/\/ -------------------------------------------------------------------------------------\n\n#if OSL_DEBUG_LEVEL > 0\n    #define DISPLAY_EXCEPTION( ClassName, MethodName, e )    \\\n        ::rtl::OString sMessage( #ClassName \"::\" #MethodName \": caught an exception!\\n\" ); \\\n        sMessage += ::rtl::OString( e.Message.getStr(), e.Message.getLength(), RTL_TEXTENCODING_ASCII_US ); \\\n        OSL_FAIL( sMessage.getStr() );\n#else\n    #define DISPLAY_EXCEPTION( ClassName, MethodName, e )\n#endif\n\n#define IMPL_TABLISTENERMULTIPLEXER_LISTENERMETHOD_BODY_2PARAM( ClassName, InterfaceName, MethodName, ParamType1, ParamType2 ) \\\n{ \\\n    ParamType1 aMulti( evt ); \\\n    ParamType2 aMulti2( evt2 ); \\\n    ::cppu::OInterfaceIteratorHelper aIt( *this ); \\\n    while( aIt.hasMoreElements() ) \\\n    { \\\n        ::com::sun::star::uno::Reference< InterfaceName > xListener( \\\n            static_cast< InterfaceName* >( aIt.next() ) ); \\\n        try \\\n        { \\\n            xListener->MethodName( aMulti, aMulti2 ); \\\n        } \\\n        catch(const ::com::sun::star::lang::DisposedException& e) \\\n        { \\\n            OSL_ENSURE( e.Context.is(), \"caught DisposedException with empty Context field\" ); \\\n            if ( e.Context == xListener || !e.Context.is() ) \\\n                aIt.remove(); \\\n        } \\\n        catch(const ::com::sun::star::uno::RuntimeException& e) \\\n        { \\\n            DISPLAY_EXCEPTION( ClassName, MethodName, e ) \\\n        } \\\n    } \\\n}\n\n#define IMPL_TABLISTENERMULTIPLEXER_LISTENERMETHOD_BODY_1PARAM( ClassName, InterfaceName, MethodName, ParamType1 ) \\\n{ \\\n    ParamType1 aMulti( evt ); \\\n    ::cppu::OInterfaceIteratorHelper aIt( *this ); \\\n    while( aIt.hasMoreElements() ) \\\n    { \\\n        ::com::sun::star::uno::Reference< InterfaceName > xListener( \\\n            static_cast< InterfaceName* >( aIt.next() ) ); \\\n        try \\\n        { \\\n            xListener->MethodName( aMulti ); \\\n        } \\\n        catch(const ::com::sun::star::lang::DisposedException& e) \\\n        { \\\n            OSL_ENSURE( e.Context.is(), \"caught DisposedException with empty Context field\" ); \\\n            if ( e.Context == xListener || !e.Context.is() ) \\\n                aIt.remove(); \\\n        } \\\n        catch(const ::com::sun::star::uno::RuntimeException& e) \\\n        { \\\n            DISPLAY_EXCEPTION( ClassName, MethodName, e ) \\\n        } \\\n    } \\\n}\n\n#define IMPL_LISTENERMULTIPLEXER_LISTENERMETHOD_BODY( ClassName, InterfaceName, MethodName, EventType ) \\\n{ \\\n    EventType aMulti( evt ); \\\n    aMulti.Source = &GetContext(); \\\n    ::cppu::OInterfaceIteratorHelper aIt( *this ); \\\n    while( aIt.hasMoreElements() ) \\\n    { \\\n        ::com::sun::star::uno::Reference< InterfaceName > xListener( \\\n            static_cast< InterfaceName* >( aIt.next() ) ); \\\n        try \\\n        { \\\n            xListener->MethodName( aMulti ); \\\n        } \\\n        catch(const ::com::sun::star::lang::DisposedException& e) \\\n        { \\\n            OSL_ENSURE( e.Context.is(), \"caught DisposedException with empty Context field\" ); \\\n            if ( e.Context == xListener || !e.Context.is() ) \\\n                aIt.remove(); \\\n        } \\\n        catch(const ::com::sun::star::uno::RuntimeException& e) \\\n        { \\\n            DISPLAY_EXCEPTION( ClassName, MethodName, e ) \\\n        } \\\n    } \\\n}\n\n#define IMPL_LISTENERMULTIPLEXER_LISTENERMETHOD_EXCEPTION( ClassName, InterfaceName, MethodName, EventType, Exception ) \\\nvoid ClassName::MethodName( const EventType& evt ) throw(::com::sun::star::uno::RuntimeException, Exception) \\\nIMPL_LISTENERMULTIPLEXER_LISTENERMETHOD_BODY( ClassName, InterfaceName, MethodName, EventType )\n\n#define IMPL_LISTENERMULTIPLEXER_LISTENERMETHOD( ClassName, InterfaceName, MethodName, EventType ) \\\nvoid ClassName::MethodName( const EventType& evt ) throw(::com::sun::star::uno::RuntimeException) \\\nIMPL_LISTENERMULTIPLEXER_LISTENERMETHOD_BODY( ClassName, InterfaceName, MethodName, EventType )\n\n\/\/ -------------------------------------------------------------------------------------\n\n#define DECLIMPL_SUPPORTS_SERVICE( ) \\\n    sal_Bool SAL_CALL supportsService( const ::rtl::OUString& rServiceName ) throw(::com::sun::star::uno::RuntimeException) \\\n    { \\\n        ::com::sun::star::uno::Sequence< ::rtl::OUString > aServiceNames( getSupportedServiceNames() ); \\\n        const ::rtl::OUString* pSupported = aServiceNames.getConstArray(); \\\n        const ::rtl::OUString* pSupportedEnd = pSupported + aServiceNames.getLength(); \\\n        for ( ; pSupported != pSupportedEnd; ++pSupported ) \\\n            if ( *pSupported == rServiceName ) \\\n                return sal_True; \\\n        return sal_False; \\\n    }\n\n\/\/ -------------------------------------------------------------------------------------\n\n#define DECLIMPL_SERVICEINFO_DERIVED( ImplName, BaseClass, ServiceName ) \\\n    ::rtl::OUString SAL_CALL getImplementationName(  ) throw(::com::sun::star::uno::RuntimeException) { return ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM( \"stardiv.Toolkit.\" #ImplName )); } \\\n    ::com::sun::star::uno::Sequence< ::rtl::OUString > SAL_CALL getSupportedServiceNames() throw(::com::sun::star::uno::RuntimeException)   \\\n                            { \\\n                                ::com::sun::star::uno::Sequence< ::rtl::OUString > aNames = BaseClass::getSupportedServiceNames( ); \\\n                                aNames.realloc( aNames.getLength() + 1 ); \\\n                                aNames[ aNames.getLength() - 1 ] = ::rtl::OUString::createFromAscii( ServiceName ); \\\n                                return aNames; \\\n                            } \\\n\n\/\/ -------------------------------------------------------------------------------------\n\n#define DECLIMPL_SERVICEINFO( ImplName, ServiceName ) \\\n    ::rtl::OUString SAL_CALL getImplementationName(  ) throw(::com::sun::star::uno::RuntimeException) { return ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM( \"stardiv.Toolkit.\" #ImplName )); } \\\n    ::com::sun::star::uno::Sequence< ::rtl::OUString > SAL_CALL getSupportedServiceNames() throw(::com::sun::star::uno::RuntimeException)   \\\n                            { \\\n                                ::com::sun::star::uno::Sequence< ::rtl::OUString > aNames( 1 ); \\\n                                aNames[ 0 ] = ::rtl::OUString::createFromAscii( ServiceName ); \\\n                                return aNames; \\\n                            } \\\n    DECLIMPL_SUPPORTS_SERVICE( )\n\n\n\n\n\n\n#endif \/\/ _TOOLKIT_HELPER_MACROS_HXX_\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>WaE: MSVC20082 unreferenced argument<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 _TOOLKIT_HELPER_MACROS_HXX_\n#define _TOOLKIT_HELPER_MACROS_HXX_\n\n#include <comphelper\/servicehelper.hxx>\n\n#define IMPL_XUNOTUNNEL_MINIMAL( ClassName ) \\\nsal_Int64 ClassName::getSomething( const ::com::sun::star::uno::Sequence< sal_Int8 >& rIdentifier ) throw(::com::sun::star::uno::RuntimeException) \\\n{ \\\n    if( ( rIdentifier.getLength() == 16 ) && ( 0 == rtl_compareMemory( ClassName::GetUnoTunnelId().getConstArray(), rIdentifier.getConstArray(), 16 ) ) ) \\\n    { \\\n        return sal::static_int_cast< sal_Int64 >(reinterpret_cast< sal_IntPtr >(this)); \\\n    } \\\n    return 0; \\\n} \\\nnamespace \\\n{ \\\n    class the##ClassName##UnoTunnelId : public rtl::Static< UnoTunnelIdInit, the##ClassName##UnoTunnelId> {}; \\\n} \\\nconst ::com::sun::star::uno::Sequence< sal_Int8 >& ClassName::GetUnoTunnelId() throw() \\\n{ \\\n    return the##ClassName##UnoTunnelId::get().getSeq(); \\\n}\n\n#define IMPL_XUNOTUNNEL( ClassName ) \\\nIMPL_XUNOTUNNEL_MINIMAL( ClassName ) \\\nClassName* ClassName::GetImplementation( const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& rxIFace ) throw() \\\n{ \\\n    ::com::sun::star::uno::Reference< ::com::sun::star::lang::XUnoTunnel > xUT( rxIFace, ::com::sun::star::uno::UNO_QUERY ); \\\n    return xUT.is() ? reinterpret_cast<ClassName*>(sal::static_int_cast<sal_IntPtr>(xUT->getSomething( ClassName::GetUnoTunnelId() ))) : NULL; \\\n}\n\n#define IMPL_XUNOTUNNEL2( ClassName, BaseClass ) \\\nsal_Int64 ClassName::getSomething( const ::com::sun::star::uno::Sequence< sal_Int8 >& rIdentifier ) throw(::com::sun::star::uno::RuntimeException) \\\n{ \\\n    if( ( rIdentifier.getLength() == 16 ) && ( 0 == rtl_compareMemory( ClassName::GetUnoTunnelId().getConstArray(), rIdentifier.getConstArray(), 16 ) ) ) \\\n    { \\\n        return sal::static_int_cast< sal_Int64 >(reinterpret_cast< sal_IntPtr >(this)); \\\n    } \\\n    return BaseClass::getSomething( rIdentifier ); \\\n} \\\nnamespace \\\n{ \\\n    class the##ClassName##UnoTunnelId : public rtl::Static< UnoTunnelIdInit, the##ClassName##UnoTunnelId> {}; \\\n} \\\nconst ::com::sun::star::uno::Sequence< sal_Int8 >& ClassName::GetUnoTunnelId() throw() \\\n{ \\\n    return the##ClassName##UnoTunnelId::get().getSeq(); \\\n} \\\nClassName* ClassName::GetImplementation( const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& rxIFace ) throw() \\\n{ \\\n    ::com::sun::star::uno::Reference< ::com::sun::star::lang::XUnoTunnel > xUT( rxIFace, ::com::sun::star::uno::UNO_QUERY ); \\\n    return xUT.is() ? reinterpret_cast<ClassName*>(sal::static_int_cast<sal_IntPtr>(xUT->getSomething( ClassName::GetUnoTunnelId() ))) : NULL; \\\n}\n\n\/\/ -------------------------------------------------------------------------------------\n\n#define IMPL_IMPLEMENTATION_ID( ClassName ) \\\n::com::sun::star::uno::Sequence< sal_Int8 > ClassName::getImplementationId() throw(::com::sun::star::uno::RuntimeException) \\\n{ \\\n    static ::cppu::OImplementationId* pId = NULL; \\\n    if( !pId ) \\\n    { \\\n        ::osl::Guard< ::osl::Mutex > aGuard( ::osl::Mutex::getGlobalMutex() ); \\\n        if( ! pId ) \\\n        { \\\n            static ::cppu::OImplementationId id( sal_False ); \\\n            pId = &id; \\\n        } \\\n    } \\\n    return (*pId).getImplementationId(); \\\n}\n\n#define IMPL_XTYPEPROVIDER_START( ClassName )   \\\nIMPL_IMPLEMENTATION_ID( ClassName ) \\\n::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > ClassName::getTypes() throw(::com::sun::star::uno::RuntimeException) \\\n{ \\\n    static ::cppu::OTypeCollection* pCollection = NULL; \\\n    if( !pCollection ) \\\n    { \\\n        ::osl::Guard< ::osl::Mutex > aGuard( ::osl::Mutex::getGlobalMutex() ); \\\n        if( !pCollection ) \\\n        { \\\n            static ::cppu::OTypeCollection collection( \\\n            getCppuType( ( ::com::sun::star::uno::Reference< ::com::sun::star::lang::XTypeProvider>* ) NULL ),\n\n\/\/ -------------------------------------------------------------------------------------\n\n#define IMPL_XTYPEPROVIDER_END \\\n            ); \\\n            pCollection = &collection; \\\n        } \\\n    } \\\n    return (*pCollection).getTypes(); \\\n}\n\n\/\/ -------------------------------------------------------------------------------------\n\n#define DECL_LISTENERMULTIPLEXER_START( ClassName, InterfaceName ) \\\nclass ClassName : public ListenerMultiplexerBase, public InterfaceName \\\n{ \\\npublic: \\\n    ClassName( ::cppu::OWeakObject& rSource ); \\\n    ::com::sun::star::uno::Any  SAL_CALL queryInterface( const ::com::sun::star::uno::Type & rType ) throw(::com::sun::star::uno::RuntimeException); \\\n    void                        SAL_CALL acquire() throw()  { ListenerMultiplexerBase::acquire(); } \\\n    void                        SAL_CALL release() throw()  { ListenerMultiplexerBase::release(); } \\\n    void                        SAL_CALL disposing( const ::com::sun::star::lang::EventObject& Source ) throw(::com::sun::star::uno::RuntimeException);\n\n\/\/ -------------------------------------------------------------------------------------\n\n#define DECL_LISTENERMULTIPLEXER_START_DLLPUB( ClassName, InterfaceName ) \\\nclass TOOLKIT_DLLPUBLIC ClassName : public ListenerMultiplexerBase, public InterfaceName \\\n{ \\\npublic: \\\n    ClassName( ::cppu::OWeakObject& rSource ); \\\n    ::com::sun::star::uno::Any  SAL_CALL queryInterface( const ::com::sun::star::uno::Type & rType ) throw(::com::sun::star::uno::RuntimeException); \\\n    void                        SAL_CALL acquire() throw()  { ListenerMultiplexerBase::acquire(); } \\\n    void                        SAL_CALL release() throw()  { ListenerMultiplexerBase::release(); } \\\n    void                        SAL_CALL disposing( const ::com::sun::star::lang::EventObject& Source ) throw(::com::sun::star::uno::RuntimeException);\n\n\/\/ -------------------------------------------------------------------------------------\n\n#define DECL_LISTENERMULTIPLEXER_END \\\n};\n\n\/\/ -------------------------------------------------------------------------------------\n\n#define IMPL_LISTENERMULTIPLEXER_BASEMETHODS( ClassName, InterfaceName ) \\\nClassName::ClassName( ::cppu::OWeakObject& rSource ) \\\n    : ListenerMultiplexerBase( rSource ) \\\n{ \\\n} \\\n::com::sun::star::uno::Any ClassName::queryInterface( const ::com::sun::star::uno::Type & rType ) throw(::com::sun::star::uno::RuntimeException) \\\n{ \\\n    ::com::sun::star::uno::Any aRet = ::cppu::queryInterface( rType, \\\n                                        SAL_STATIC_CAST( ::com::sun::star::lang::XEventListener*, this ), \\\n                                        SAL_STATIC_CAST( InterfaceName*, this ) ); \\\n    return (aRet.hasValue() ? aRet : ListenerMultiplexerBase::queryInterface( rType )); \\\n} \\\nvoid ClassName::disposing( const ::com::sun::star::lang::EventObject& ) throw(::com::sun::star::uno::RuntimeException) \\\n{ \\\n}\n\n\/\/ -------------------------------------------------------------------------------------\n\n#if OSL_DEBUG_LEVEL > 0\n    #define DISPLAY_EXCEPTION( ClassName, MethodName, e )    \\\n        ::rtl::OString sMessage( #ClassName \"::\" #MethodName \": caught an exception!\\n\" ); \\\n        sMessage += ::rtl::OString( e.Message.getStr(), e.Message.getLength(), RTL_TEXTENCODING_ASCII_US ); \\\n        OSL_FAIL( sMessage.getStr() );\n#else\n    #define DISPLAY_EXCEPTION( ClassName, MethodName, e ) (void)e;\n#endif\n\n#define IMPL_TABLISTENERMULTIPLEXER_LISTENERMETHOD_BODY_2PARAM( ClassName, InterfaceName, MethodName, ParamType1, ParamType2 ) \\\n{ \\\n    ParamType1 aMulti( evt ); \\\n    ParamType2 aMulti2( evt2 ); \\\n    ::cppu::OInterfaceIteratorHelper aIt( *this ); \\\n    while( aIt.hasMoreElements() ) \\\n    { \\\n        ::com::sun::star::uno::Reference< InterfaceName > xListener( \\\n            static_cast< InterfaceName* >( aIt.next() ) ); \\\n        try \\\n        { \\\n            xListener->MethodName( aMulti, aMulti2 ); \\\n        } \\\n        catch(const ::com::sun::star::lang::DisposedException& e) \\\n        { \\\n            OSL_ENSURE( e.Context.is(), \"caught DisposedException with empty Context field\" ); \\\n            if ( e.Context == xListener || !e.Context.is() ) \\\n                aIt.remove(); \\\n        } \\\n        catch(const ::com::sun::star::uno::RuntimeException& e) \\\n        { \\\n            DISPLAY_EXCEPTION( ClassName, MethodName, e ) \\\n        } \\\n    } \\\n}\n\n#define IMPL_TABLISTENERMULTIPLEXER_LISTENERMETHOD_BODY_1PARAM( ClassName, InterfaceName, MethodName, ParamType1 ) \\\n{ \\\n    ParamType1 aMulti( evt ); \\\n    ::cppu::OInterfaceIteratorHelper aIt( *this ); \\\n    while( aIt.hasMoreElements() ) \\\n    { \\\n        ::com::sun::star::uno::Reference< InterfaceName > xListener( \\\n            static_cast< InterfaceName* >( aIt.next() ) ); \\\n        try \\\n        { \\\n            xListener->MethodName( aMulti ); \\\n        } \\\n        catch(const ::com::sun::star::lang::DisposedException& e) \\\n        { \\\n            OSL_ENSURE( e.Context.is(), \"caught DisposedException with empty Context field\" ); \\\n            if ( e.Context == xListener || !e.Context.is() ) \\\n                aIt.remove(); \\\n        } \\\n        catch(const ::com::sun::star::uno::RuntimeException& e) \\\n        { \\\n            DISPLAY_EXCEPTION( ClassName, MethodName, e ) \\\n        } \\\n    } \\\n}\n\n#define IMPL_LISTENERMULTIPLEXER_LISTENERMETHOD_BODY( ClassName, InterfaceName, MethodName, EventType ) \\\n{ \\\n    EventType aMulti( evt ); \\\n    aMulti.Source = &GetContext(); \\\n    ::cppu::OInterfaceIteratorHelper aIt( *this ); \\\n    while( aIt.hasMoreElements() ) \\\n    { \\\n        ::com::sun::star::uno::Reference< InterfaceName > xListener( \\\n            static_cast< InterfaceName* >( aIt.next() ) ); \\\n        try \\\n        { \\\n            xListener->MethodName( aMulti ); \\\n        } \\\n        catch(const ::com::sun::star::lang::DisposedException& e) \\\n        { \\\n            OSL_ENSURE( e.Context.is(), \"caught DisposedException with empty Context field\" ); \\\n            if ( e.Context == xListener || !e.Context.is() ) \\\n                aIt.remove(); \\\n        } \\\n        catch(const ::com::sun::star::uno::RuntimeException& e) \\\n        { \\\n            DISPLAY_EXCEPTION( ClassName, MethodName, e ) \\\n        } \\\n    } \\\n}\n\n#define IMPL_LISTENERMULTIPLEXER_LISTENERMETHOD_EXCEPTION( ClassName, InterfaceName, MethodName, EventType, Exception ) \\\nvoid ClassName::MethodName( const EventType& evt ) throw(::com::sun::star::uno::RuntimeException, Exception) \\\nIMPL_LISTENERMULTIPLEXER_LISTENERMETHOD_BODY( ClassName, InterfaceName, MethodName, EventType )\n\n#define IMPL_LISTENERMULTIPLEXER_LISTENERMETHOD( ClassName, InterfaceName, MethodName, EventType ) \\\nvoid ClassName::MethodName( const EventType& evt ) throw(::com::sun::star::uno::RuntimeException) \\\nIMPL_LISTENERMULTIPLEXER_LISTENERMETHOD_BODY( ClassName, InterfaceName, MethodName, EventType )\n\n\/\/ -------------------------------------------------------------------------------------\n\n#define DECLIMPL_SUPPORTS_SERVICE( ) \\\n    sal_Bool SAL_CALL supportsService( const ::rtl::OUString& rServiceName ) throw(::com::sun::star::uno::RuntimeException) \\\n    { \\\n        ::com::sun::star::uno::Sequence< ::rtl::OUString > aServiceNames( getSupportedServiceNames() ); \\\n        const ::rtl::OUString* pSupported = aServiceNames.getConstArray(); \\\n        const ::rtl::OUString* pSupportedEnd = pSupported + aServiceNames.getLength(); \\\n        for ( ; pSupported != pSupportedEnd; ++pSupported ) \\\n            if ( *pSupported == rServiceName ) \\\n                return sal_True; \\\n        return sal_False; \\\n    }\n\n\/\/ -------------------------------------------------------------------------------------\n\n#define DECLIMPL_SERVICEINFO_DERIVED( ImplName, BaseClass, ServiceName ) \\\n    ::rtl::OUString SAL_CALL getImplementationName(  ) throw(::com::sun::star::uno::RuntimeException) { return ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM( \"stardiv.Toolkit.\" #ImplName )); } \\\n    ::com::sun::star::uno::Sequence< ::rtl::OUString > SAL_CALL getSupportedServiceNames() throw(::com::sun::star::uno::RuntimeException)   \\\n                            { \\\n                                ::com::sun::star::uno::Sequence< ::rtl::OUString > aNames = BaseClass::getSupportedServiceNames( ); \\\n                                aNames.realloc( aNames.getLength() + 1 ); \\\n                                aNames[ aNames.getLength() - 1 ] = ::rtl::OUString::createFromAscii( ServiceName ); \\\n                                return aNames; \\\n                            } \\\n\n\/\/ -------------------------------------------------------------------------------------\n\n#define DECLIMPL_SERVICEINFO( ImplName, ServiceName ) \\\n    ::rtl::OUString SAL_CALL getImplementationName(  ) throw(::com::sun::star::uno::RuntimeException) { return ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM( \"stardiv.Toolkit.\" #ImplName )); } \\\n    ::com::sun::star::uno::Sequence< ::rtl::OUString > SAL_CALL getSupportedServiceNames() throw(::com::sun::star::uno::RuntimeException)   \\\n                            { \\\n                                ::com::sun::star::uno::Sequence< ::rtl::OUString > aNames( 1 ); \\\n                                aNames[ 0 ] = ::rtl::OUString::createFromAscii( ServiceName ); \\\n                                return aNames; \\\n                            } \\\n    DECLIMPL_SUPPORTS_SERVICE( )\n\n\n\n\n\n\n#endif \/\/ _TOOLKIT_HELPER_MACROS_HXX_\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before>#include <sofa\/helper\/Utils.h>\n#include <sofa\/helper\/system\/FileRepository.h>\n#include <sofa\/helper\/system\/FileSystem.h>\n#include <sofa\/simulation\/config.h> \/\/ #defines SOFA_HAVE_DAG (or not)\n#ifdef SOFA_HAVE_DAG\n#  include <SofaSimulationGraph\/init.h>\n#endif\n#include <SofaSimulationTree\/init.h>\n\n#include <gtest\/gtest.h>\n\nusing sofa::helper::system::PluginRepository;\nusing sofa::helper::system::DataRepository;\nusing sofa::helper::system::FileSystem;\nusing sofa::helper::Utils;\n\nint main(int argc, char **argv)\n{\n    testing::InitGoogleTest(&argc, argv);\n\n    sofa::simulation::tree::init();\n#ifdef SOFA_HAVE_DAG\n    sofa::simulation::graph::init();\n#endif\n\n#ifdef WIN32\n    const std::string pluginDirectory = Utils::getExecutableDirectory();\n#else\n    const std::string pluginDirectory = Utils::getSofaPathPrefix() + \"\/lib\";\n#endif\n    sofa::helper::system::PluginRepository.addFirstPath(pluginDirectory);\n    DataRepository.addFirstPath(std::string(SOFA_SRC_DIR) + \"\/share\");\n\n    int ret =  RUN_ALL_TESTS();\n\n#ifdef SOFA_HAVE_DAG\n    sofa::simulation::graph::cleanup();\n#endif\n    sofa::simulation::tree::cleanup();\n\n    return ret;\n}\n<commit_msg>[SofaTest] cleaning the way to get plugin and share directories + do not try to load plugin's gui libraries (as test does not have gui, it could crashes when closing the test executable).<commit_after>#include <sofa\/helper\/Utils.h>\n#include <sofa\/helper\/system\/FileRepository.h>\n#include <sofa\/helper\/system\/FileSystem.h>\n#include <sofa\/helper\/system\/PluginManager.h>\n#include <sofa\/simulation\/config.h> \/\/ #defines SOFA_HAVE_DAG (or not)\n#ifdef SOFA_HAVE_DAG\n#  include <SofaSimulationGraph\/init.h>\n#endif\n#include <SofaSimulationTree\/init.h>\n\n#include <gtest\/gtest.h>\n\nusing sofa::helper::system::PluginManager;\nusing sofa::helper::system::PluginRepository;\nusing sofa::helper::system::DataRepository;\nusing sofa::helper::system::FileSystem;\nusing sofa::helper::Utils;\n\nint main(int argc, char **argv)\n{\n    testing::InitGoogleTest(&argc, argv);\n\n    sofa::simulation::tree::init();\n#ifdef SOFA_HAVE_DAG\n    sofa::simulation::graph::init();\n#endif\n\n    \/\/ do not try to load plugin's gui libraries\n    PluginManager::s_gui_postfix = \"\";\n\n    PluginRepository.addFirstPath(Utils::getPluginDirectory());\n\n    \/\/ default DataRepository\n    \/\/ Read the paths to the share\/ directory from etc\/sofa.ini,\n    const std::string etcDir = Utils::getSofaPathPrefix() + \"\/etc\";\n    const std::string sofaIniFilePath = etcDir + \"\/sofa.ini\";\n    std::map<std::string, std::string> iniFileValues = Utils::readBasicIniFile(sofaIniFilePath);\n    \/\/ and add them to DataRepository\n    if (iniFileValues.find(\"SHARE_DIR\") != iniFileValues.end())\n    {\n        std::string shareDir = iniFileValues[\"SHARE_DIR\"];\n        if (!FileSystem::isAbsolute(shareDir))\n            shareDir = etcDir + \"\/\" + shareDir;\n        DataRepository.addFirstPath(shareDir);\n    }\n\n\n    int ret =  RUN_ALL_TESTS();\n\n#ifdef SOFA_HAVE_DAG\n    sofa::simulation::graph::cleanup();\n#endif\n    sofa::simulation::tree::cleanup();\n\n    return ret;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"kontsevich_graph.hpp\"\n#include \"util\/sort_pairs.hpp\"\n#include <algorithm>\n\nKontsevichGraph::KontsevichGraph()\n: d_sign(1)\n{}\n\nKontsevichGraph::KontsevichGraph(size_t internal, size_t external, std::vector< std::pair<size_t, size_t> > targets, int sign, bool normalized)\n: d_internal(internal), d_external(external), d_targets(targets), d_sign(sign)\n{\n    if (!normalized)\n    {\n        std::vector< std::pair<size_t, size_t> > global_minimum = d_targets;\n        std::vector<size_t> vertices(d_external + d_internal);\n        std::iota(vertices.begin(), vertices.end(), 0);\n        size_t exchanges = 0;\n        while (std::next_permutation(vertices.begin() + d_external, vertices.end()))\n        {\n            std::vector< std::pair<size_t, size_t> > local_minimum = d_targets;\n            \/\/ Relabel elements of target pairs\n            for (size_t i = 0; i != d_internal; ++i) {\n                local_minimum[i].first = vertices[local_minimum[i].first];\n                local_minimum[i].second = vertices[local_minimum[i].second];\n            }\n            \/\/ Reorder target pairs\n            for (size_t i = 0; i != d_internal; ++i) {\n                std::swap(local_minimum[i], local_minimum[vertices[d_external + i] - d_external]);\n            }\n            size_t local_exchanges = sort_pairs(local_minimum.begin(), local_minimum.end());\n            if (local_minimum < global_minimum) {\n                global_minimum = local_minimum;\n                exchanges = local_exchanges;\n            }\n        }\n        d_targets = global_minimum;\n        d_sign *= (exchanges % 2 == 0) ? 1 : -1;\n    }\n}\n\nstd::vector<size_t> KontsevichGraph::internal_vertices() const\n{\n    std::vector<size_t> vertices(d_internal);\n    std::iota(vertices.begin(), vertices.end(), d_external);\n    return vertices;\n}\n\nstd::vector< std::pair<size_t, size_t> > KontsevichGraph::targets() const\n{\n    return d_targets;\n}\n\nstd::pair<size_t, size_t> KontsevichGraph::targets(size_t internal_vertex) const\n{\n    return d_targets[internal_vertex - d_external];\n}\n\nint KontsevichGraph::sign() const\n{\n    return d_sign;\n}\n\nint KontsevichGraph::sign(int new_sign)\n{\n    return d_sign = new_sign;\n}\n\nstd::pair< size_t, std::vector< std::pair<size_t, size_t> > > KontsevichGraph::abs() const\n{\n    return { d_external, d_targets };\n}\n\nsize_t KontsevichGraph::internal() const\n{\n    return d_internal;\n}\n\nsize_t KontsevichGraph::external() const\n{\n    return d_external;\n}\n\nsize_t KontsevichGraph::vertices() const\n{\n    return d_internal + d_external;\n}\n\nstd::vector<size_t> KontsevichGraph::in_degrees() const\n{\n    std::vector<size_t> indegrees(d_external);\n    for (auto& target_pair : d_targets)\n    {\n        if (target_pair.first < d_external)\n            indegrees[target_pair.first]++;\n        if (target_pair.second < d_external)\n            indegrees[target_pair.second]++;\n    }\n    return indegrees;\n}\n\nstd::vector<size_t> KontsevichGraph::neighbors_in(size_t vertex) const\n{\n    std::vector<size_t> neighbors;\n    for (size_t idx = 0; idx < d_internal; ++idx)\n    {\n        if (d_targets[idx].first == vertex || d_targets[idx].second == vertex)\n            neighbors.push_back(d_external + idx);\n    }\n    return neighbors;\n}\n\nbool operator==(const KontsevichGraph &lhs, const KontsevichGraph &rhs)\n{\n    return (lhs.d_external == rhs.d_external) && (lhs.d_sign == rhs.d_sign) && (lhs.d_targets == rhs.d_targets);\n}\n\nbool operator!=(const KontsevichGraph &lhs, const KontsevichGraph &rhs)\n{\n    return !(lhs == rhs);\n}\n\nstd::ostream& operator<<(std::ostream &os, const KontsevichGraph& g)\n{\n    return os << \"Kontsevich graph with \" << g.d_internal << \" vertices on \" << g.d_external << \" ground vertices\";\n}\n\nstd::istream& operator>>(std::istream& is, KontsevichGraph& g)\n{\n    is >> g.d_external;\n    is >> g.d_internal;\n    is >> g.d_sign;\n    std::string line;\n    std::pair<size_t, size_t> target_pair;\n    size_t pair_count = 0;\n    while (is >> target_pair.first >> target_pair.second && pair_count++ < g.d_internal)\n        g.d_targets.push_back(target_pair);\n    g.d_internal = g.d_targets.size();\n    return is;\n}\n<commit_msg>Fix KontsevichGraph's extraction operator: now we don't forget to clear existing targets, and don't read too much.<commit_after>#include \"kontsevich_graph.hpp\"\n#include \"util\/sort_pairs.hpp\"\n#include <algorithm>\n\nKontsevichGraph::KontsevichGraph()\n: d_sign(1)\n{}\n\nKontsevichGraph::KontsevichGraph(size_t internal, size_t external, std::vector< std::pair<size_t, size_t> > targets, int sign, bool normalized)\n: d_internal(internal), d_external(external), d_targets(targets), d_sign(sign)\n{\n    if (!normalized)\n    {\n        std::vector< std::pair<size_t, size_t> > global_minimum = d_targets;\n        std::vector<size_t> vertices(d_external + d_internal);\n        std::iota(vertices.begin(), vertices.end(), 0);\n        size_t exchanges = 0;\n        while (std::next_permutation(vertices.begin() + d_external, vertices.end()))\n        {\n            std::vector< std::pair<size_t, size_t> > local_minimum = d_targets;\n            \/\/ Relabel elements of target pairs\n            for (size_t i = 0; i != d_internal; ++i) {\n                local_minimum[i].first = vertices[local_minimum[i].first];\n                local_minimum[i].second = vertices[local_minimum[i].second];\n            }\n            \/\/ Reorder target pairs\n            for (size_t i = 0; i != d_internal; ++i) {\n                std::swap(local_minimum[i], local_minimum[vertices[d_external + i] - d_external]);\n            }\n            size_t local_exchanges = sort_pairs(local_minimum.begin(), local_minimum.end());\n            if (local_minimum < global_minimum) {\n                global_minimum = local_minimum;\n                exchanges = local_exchanges;\n            }\n        }\n        d_targets = global_minimum;\n        d_sign *= (exchanges % 2 == 0) ? 1 : -1;\n    }\n}\n\nstd::vector<size_t> KontsevichGraph::internal_vertices() const\n{\n    std::vector<size_t> vertices(d_internal);\n    std::iota(vertices.begin(), vertices.end(), d_external);\n    return vertices;\n}\n\nstd::vector< std::pair<size_t, size_t> > KontsevichGraph::targets() const\n{\n    return d_targets;\n}\n\nstd::pair<size_t, size_t> KontsevichGraph::targets(size_t internal_vertex) const\n{\n    return d_targets[internal_vertex - d_external];\n}\n\nint KontsevichGraph::sign() const\n{\n    return d_sign;\n}\n\nint KontsevichGraph::sign(int new_sign)\n{\n    return d_sign = new_sign;\n}\n\nstd::pair< size_t, std::vector< std::pair<size_t, size_t> > > KontsevichGraph::abs() const\n{\n    return { d_external, d_targets };\n}\n\nsize_t KontsevichGraph::internal() const\n{\n    return d_internal;\n}\n\nsize_t KontsevichGraph::external() const\n{\n    return d_external;\n}\n\nsize_t KontsevichGraph::vertices() const\n{\n    return d_internal + d_external;\n}\n\nstd::vector<size_t> KontsevichGraph::in_degrees() const\n{\n    std::vector<size_t> indegrees(d_external);\n    for (auto& target_pair : d_targets)\n    {\n        if (target_pair.first < d_external)\n            indegrees[target_pair.first]++;\n        if (target_pair.second < d_external)\n            indegrees[target_pair.second]++;\n    }\n    return indegrees;\n}\n\nstd::vector<size_t> KontsevichGraph::neighbors_in(size_t vertex) const\n{\n    std::vector<size_t> neighbors;\n    for (size_t idx = 0; idx < d_internal; ++idx)\n    {\n        if (d_targets[idx].first == vertex || d_targets[idx].second == vertex)\n            neighbors.push_back(d_external + idx);\n    }\n    return neighbors;\n}\n\nbool operator==(const KontsevichGraph &lhs, const KontsevichGraph &rhs)\n{\n    return (lhs.d_external == rhs.d_external) && (lhs.d_sign == rhs.d_sign) && (lhs.d_targets == rhs.d_targets);\n}\n\nbool operator!=(const KontsevichGraph &lhs, const KontsevichGraph &rhs)\n{\n    return !(lhs == rhs);\n}\n\nstd::ostream& operator<<(std::ostream &os, const KontsevichGraph& g)\n{\n    return os << \"Kontsevich graph with \" << g.d_internal << \" vertices on \" << g.d_external << \" ground vertices\";\n}\n\nstd::istream& operator>>(std::istream& is, KontsevichGraph& g)\n{\n    is >> g.d_external;\n    is >> g.d_internal;\n    is >> g.d_sign;\n    g.d_targets.clear();\n    std::string line;\n    std::pair<size_t, size_t> target_pair;\n    size_t pair_count = 0;\n    while (pair_count++ < g.d_internal && is >> target_pair.first >> target_pair.second)\n        g.d_targets.push_back(target_pair);\n    g.d_internal = g.d_targets.size();\n    return is;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: typeselectionpage.cxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: vg $ $Date: 2003-06-02 08:04: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 EXPRESS OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc..\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef EXTENSIONS_ABP_TYPESELECTIONPAGE_HXX\n#include \"typeselectionpage.hxx\"\n#endif\n#ifndef EXTENSIONS_ABP_ADDRESSSETTINGS_HXX\n#include \"addresssettings.hxx\"\n#endif\n#ifndef EXTENSIONS_ABSPILOT_HXX\n#include \"abspilot.hxx\"\n#endif\n#ifndef _SV_MSGBOX_HXX\n#include <vcl\/msgbox.hxx>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XDRIVERACCESS_HPP_\n#include <com\/sun\/star\/sdbc\/XDriverAccess.hpp>\n#endif\n\n\/\/.........................................................................\nnamespace abp\n{\n    using namespace ::com::sun::star::uno;\n\/\/.........................................................................\n\n    \/\/=====================================================================\n    \/\/= TypeSelectionPage\n    \/\/=====================================================================\n    \/\/---------------------------------------------------------------------\n    TypeSelectionPage::TypeSelectionPage( OAddessBookSourcePilot* _pParent )\n        :AddressBookSourcePage(_pParent, ModuleRes(RID_PAGE_SELECTABTYPE))\n        ,m_aHint            (this,  ResId(FT_TYPE_HINTS))\n        ,m_aTypeSep         (this,  ResId(FL_TYPE))\n        ,m_aMORK            (this,  ResId(RB_MORK))\n        ,m_aEvolution       (this,  ResId(RB_EVOLUTION))\n        ,m_aLDAP            (this,  ResId(RB_LDAP))\n        ,m_aOutlook         (this,  ResId(RB_OUTLOOK))\n        ,m_aOE              (this,  ResId(RB_OUTLOOKEXPRESS))\n        ,m_aOther           (this,  ResId(RB_OTHER))\n    {\n        FreeResource();\n\n        Link aTypeSelectionHandler = LINK(this, TypeSelectionPage, OnTypeSelected );\n        m_aMORK.SetClickHdl( aTypeSelectionHandler );\n        m_aEvolution.SetClickHdl( aTypeSelectionHandler );\n        m_aLDAP.SetClickHdl( aTypeSelectionHandler );\n        m_aOutlook.SetClickHdl( aTypeSelectionHandler );\n        m_aOE.SetClickHdl( aTypeSelectionHandler );\n        m_aOther.SetClickHdl( aTypeSelectionHandler );\n\n#ifndef UNX\n        sal_Int32 nMoveControlsUp = m_aLDAP.GetPosPixel().Y() - m_aEvolution.GetPosPixel().Y();\n        m_aEvolution.Hide();\n\n        Point aPos = m_aLDAP.GetPosPixel();\n        aPos.Y() -= nMoveControlsUp;\n        m_aLDAP.SetPosPixel( aPos );\n\n        aPos = m_aOutlook.GetPosPixel();\n        aPos.Y() -= nMoveControlsUp;\n        m_aOutlook.SetPosPixel( aPos );\n\n        aPos = m_aOE.GetPosPixel();\n        aPos.Y() -= nMoveControlsUp;\n        m_aOE.SetPosPixel( aPos );\n\n        aPos = m_aOther.GetPosPixel();\n        aPos.Y() -= nMoveControlsUp;\n        m_aOther.SetPosPixel( aPos );\n#endif\n\n#ifdef UNX\n        \/\/ no Outlook \/ Outlook Express for ~NIX systems\n        sal_Int32 nMoveControlsUp = m_aOther.GetPosPixel().Y() - m_aOutlook.GetPosPixel().Y();\n\n        m_aOutlook.Hide();\n        m_aOE.Hide();\n\n        Point aPos = m_aOther.GetPosPixel();\n        aPos.Y() -= nMoveControlsUp;\n        m_aOther.SetPosPixel( aPos );\n\n        Reference< ::com::sun::star::sdbc::XDriverAccess> xManager(_pParent->getORB()->createInstance(::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"com.sun.star.sdbc.DriverManager\"))), UNO_QUERY);\n        if(!(xManager->getDriverByURL(::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"sdbc:address:evolution\"))).is()))\n        {\n            nMoveControlsUp = m_aLDAP.GetPosPixel().Y() - m_aEvolution.GetPosPixel().Y();\n            m_aEvolution.Hide();\n\n            aPos = m_aLDAP.GetPosPixel();\n            aPos.Y() -= nMoveControlsUp;\n            m_aLDAP.SetPosPixel( aPos );\n\n            aPos = m_aOther.GetPosPixel();\n            aPos.Y() -= nMoveControlsUp;\n            m_aOther.SetPosPixel( aPos );\n        }\n#endif\n    }\n\n    \/\/---------------------------------------------------------------------\n    void TypeSelectionPage::ActivatePage()\n    {\n        AddressBookSourcePage::ActivatePage();\n\n        if (m_aMORK.IsChecked())\n            m_aMORK.GrabFocus();\n        else if (m_aEvolution.IsChecked())\n            m_aEvolution.GrabFocus();\n        else if (m_aLDAP.IsChecked())\n            m_aLDAP.GrabFocus();\n        else if (m_aOutlook.IsChecked())\n            m_aOutlook.GrabFocus();\n        else if (m_aOE.IsChecked())\n            m_aOE.GrabFocus();\n        else if (m_aOther.IsChecked())\n            m_aOther.GrabFocus();\n\n        getDialog()->enableButtons(WZB_PREVIOUS, sal_False);\n    }\n\n    \/\/---------------------------------------------------------------------\n    void TypeSelectionPage::DeactivatePage()\n    {\n        AddressBookSourcePage::DeactivatePage();\n        getDialog()->enableButtons(WZB_PREVIOUS, sal_True);\n    }\n\n    \/\/---------------------------------------------------------------------\n    void TypeSelectionPage::selectType( AddressSourceType _eType )\n    {\n        m_aMORK.Check(AST_MORK == _eType);\n        m_aEvolution.Check(AST_EVOLUTION == _eType);\n        m_aLDAP.Check(AST_LDAP == _eType);\n        m_aOutlook.Check(AST_OUTLOOK == _eType);\n        m_aOE.Check(AST_OE == _eType);\n        m_aOther.Check(AST_OTHER == _eType);\n    }\n\n    \/\/---------------------------------------------------------------------\n    AddressSourceType TypeSelectionPage::getSelectedType( )\n    {\n        if (m_aMORK.IsChecked())\n            return AST_MORK;\n        else if (m_aEvolution.IsChecked())\n            return AST_EVOLUTION;\n        else if (m_aLDAP.IsChecked())\n            return AST_LDAP;\n        else if (m_aOutlook.IsChecked())\n            return AST_OUTLOOK;\n        else if (m_aOE.IsChecked())\n            return AST_OE;\n        else if (m_aOther.IsChecked())\n            return AST_OTHER;\n\n        return AST_INVALID;\n    }\n\n    \/\/---------------------------------------------------------------------\n    void TypeSelectionPage::initializePage()\n    {\n        AddressBookSourcePage::initializePage();\n\n        const AddressSettings& rSettings = getSettings();\n        selectType(rSettings.eType);\n    }\n\n    \/\/---------------------------------------------------------------------\n    sal_Bool TypeSelectionPage::commitPage(COMMIT_REASON _eReason)\n    {\n        if (!AddressBookSourcePage::commitPage(_eReason))\n            return sal_False;\n\n        if (AST_INVALID == getSelectedType( ))\n        {\n            if (_eReason != CR_VALIDATE_NOUI)\n            {\n                ErrorBox aError(this, ModuleRes(RID_ERR_NEEDTYPESELECTION));\n                aError.Execute();\n            }\n            return sal_False;\n        }\n\n        AddressSettings& rSettings = getSettings();\n        rSettings.eType = getSelectedType();\n\n        return sal_True;\n    }\n\n    \/\/---------------------------------------------------------------------\n    sal_Bool TypeSelectionPage::determineNextButtonState()\n    {\n        return  AddressBookSourcePage::determineNextButtonState()\n            &&  (AST_INVALID != getSelectedType());\n    }\n\n    \/\/---------------------------------------------------------------------\n    IMPL_LINK( TypeSelectionPage, OnTypeSelected, void*, NOTINTERESTEDIN )\n    {\n        implCheckNextButton();\n        return 0L;\n    }\n\n\/\/.........................................................................\n}   \/\/ namespace abp\n\/\/.........................................................................\n\n<commit_msg>INTEGRATION: CWS qwizards1 (1.4.54); FILE MERGED 2004\/04\/05 12:50:06 fs 1.4.54.1: #i27457# must changes in the base class<commit_after>\/*************************************************************************\n *\n *  $RCSfile: typeselectionpage.cxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: kz $ $Date: 2004-05-19 13:38: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 EXPRESS OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc..\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef EXTENSIONS_ABP_TYPESELECTIONPAGE_HXX\n#include \"typeselectionpage.hxx\"\n#endif\n#ifndef EXTENSIONS_ABP_ADDRESSSETTINGS_HXX\n#include \"addresssettings.hxx\"\n#endif\n#ifndef EXTENSIONS_ABSPILOT_HXX\n#include \"abspilot.hxx\"\n#endif\n#ifndef _SV_MSGBOX_HXX\n#include <vcl\/msgbox.hxx>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XDRIVERACCESS_HPP_\n#include <com\/sun\/star\/sdbc\/XDriverAccess.hpp>\n#endif\n\n\/\/.........................................................................\nnamespace abp\n{\n    using namespace ::com::sun::star::uno;\n\/\/.........................................................................\n\n    \/\/=====================================================================\n    \/\/= TypeSelectionPage\n    \/\/=====================================================================\n    \/\/---------------------------------------------------------------------\n    TypeSelectionPage::TypeSelectionPage( OAddessBookSourcePilot* _pParent )\n        :AddressBookSourcePage(_pParent, ModuleRes(RID_PAGE_SELECTABTYPE))\n        ,m_aHint            (this,  ResId(FT_TYPE_HINTS))\n        ,m_aTypeSep         (this,  ResId(FL_TYPE))\n        ,m_aMORK            (this,  ResId(RB_MORK))\n        ,m_aEvolution       (this,  ResId(RB_EVOLUTION))\n        ,m_aLDAP            (this,  ResId(RB_LDAP))\n        ,m_aOutlook         (this,  ResId(RB_OUTLOOK))\n        ,m_aOE              (this,  ResId(RB_OUTLOOKEXPRESS))\n        ,m_aOther           (this,  ResId(RB_OTHER))\n    {\n        FreeResource();\n\n        Link aTypeSelectionHandler = LINK(this, TypeSelectionPage, OnTypeSelected );\n        m_aMORK.SetClickHdl( aTypeSelectionHandler );\n        m_aEvolution.SetClickHdl( aTypeSelectionHandler );\n        m_aLDAP.SetClickHdl( aTypeSelectionHandler );\n        m_aOutlook.SetClickHdl( aTypeSelectionHandler );\n        m_aOE.SetClickHdl( aTypeSelectionHandler );\n        m_aOther.SetClickHdl( aTypeSelectionHandler );\n\n#ifndef UNX\n        sal_Int32 nMoveControlsUp = m_aLDAP.GetPosPixel().Y() - m_aEvolution.GetPosPixel().Y();\n        m_aEvolution.Hide();\n\n        Point aPos = m_aLDAP.GetPosPixel();\n        aPos.Y() -= nMoveControlsUp;\n        m_aLDAP.SetPosPixel( aPos );\n\n        aPos = m_aOutlook.GetPosPixel();\n        aPos.Y() -= nMoveControlsUp;\n        m_aOutlook.SetPosPixel( aPos );\n\n        aPos = m_aOE.GetPosPixel();\n        aPos.Y() -= nMoveControlsUp;\n        m_aOE.SetPosPixel( aPos );\n\n        aPos = m_aOther.GetPosPixel();\n        aPos.Y() -= nMoveControlsUp;\n        m_aOther.SetPosPixel( aPos );\n#endif\n\n#ifdef UNX\n        \/\/ no Outlook \/ Outlook Express for ~NIX systems\n        sal_Int32 nMoveControlsUp = m_aOther.GetPosPixel().Y() - m_aOutlook.GetPosPixel().Y();\n\n        m_aOutlook.Hide();\n        m_aOE.Hide();\n\n        Point aPos = m_aOther.GetPosPixel();\n        aPos.Y() -= nMoveControlsUp;\n        m_aOther.SetPosPixel( aPos );\n\n        Reference< ::com::sun::star::sdbc::XDriverAccess> xManager(_pParent->getORB()->createInstance(::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"com.sun.star.sdbc.DriverManager\"))), UNO_QUERY);\n        if(!(xManager->getDriverByURL(::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"sdbc:address:evolution\"))).is()))\n        {\n            nMoveControlsUp = m_aLDAP.GetPosPixel().Y() - m_aEvolution.GetPosPixel().Y();\n            m_aEvolution.Hide();\n\n            aPos = m_aLDAP.GetPosPixel();\n            aPos.Y() -= nMoveControlsUp;\n            m_aLDAP.SetPosPixel( aPos );\n\n            aPos = m_aOther.GetPosPixel();\n            aPos.Y() -= nMoveControlsUp;\n            m_aOther.SetPosPixel( aPos );\n        }\n#endif\n    }\n\n    \/\/---------------------------------------------------------------------\n    void TypeSelectionPage::ActivatePage()\n    {\n        AddressBookSourcePage::ActivatePage();\n\n        if (m_aMORK.IsChecked())\n            m_aMORK.GrabFocus();\n        else if (m_aEvolution.IsChecked())\n            m_aEvolution.GrabFocus();\n        else if (m_aLDAP.IsChecked())\n            m_aLDAP.GrabFocus();\n        else if (m_aOutlook.IsChecked())\n            m_aOutlook.GrabFocus();\n        else if (m_aOE.IsChecked())\n            m_aOE.GrabFocus();\n        else if (m_aOther.IsChecked())\n            m_aOther.GrabFocus();\n\n        getDialog()->enableButtons(WZB_PREVIOUS, sal_False);\n    }\n\n    \/\/---------------------------------------------------------------------\n    void TypeSelectionPage::DeactivatePage()\n    {\n        AddressBookSourcePage::DeactivatePage();\n        getDialog()->enableButtons(WZB_PREVIOUS, sal_True);\n    }\n\n    \/\/---------------------------------------------------------------------\n    void TypeSelectionPage::selectType( AddressSourceType _eType )\n    {\n        m_aMORK.Check(AST_MORK == _eType);\n        m_aEvolution.Check(AST_EVOLUTION == _eType);\n        m_aLDAP.Check(AST_LDAP == _eType);\n        m_aOutlook.Check(AST_OUTLOOK == _eType);\n        m_aOE.Check(AST_OE == _eType);\n        m_aOther.Check(AST_OTHER == _eType);\n    }\n\n    \/\/---------------------------------------------------------------------\n    AddressSourceType TypeSelectionPage::getSelectedType( )\n    {\n        if (m_aMORK.IsChecked())\n            return AST_MORK;\n        else if (m_aEvolution.IsChecked())\n            return AST_EVOLUTION;\n        else if (m_aLDAP.IsChecked())\n            return AST_LDAP;\n        else if (m_aOutlook.IsChecked())\n            return AST_OUTLOOK;\n        else if (m_aOE.IsChecked())\n            return AST_OE;\n        else if (m_aOther.IsChecked())\n            return AST_OTHER;\n\n        return AST_INVALID;\n    }\n\n    \/\/---------------------------------------------------------------------\n    void TypeSelectionPage::initializePage()\n    {\n        AddressBookSourcePage::initializePage();\n\n        const AddressSettings& rSettings = getSettings();\n        selectType(rSettings.eType);\n    }\n\n    \/\/---------------------------------------------------------------------\n    sal_Bool TypeSelectionPage::commitPage(COMMIT_REASON _eReason)\n    {\n        if (!AddressBookSourcePage::commitPage(_eReason))\n            return sal_False;\n\n        if (AST_INVALID == getSelectedType( ))\n        {\n            if (_eReason != CR_VALIDATE_NOUI)\n            {\n                ErrorBox aError(this, ModuleRes(RID_ERR_NEEDTYPESELECTION));\n                aError.Execute();\n            }\n            return sal_False;\n        }\n\n        AddressSettings& rSettings = getSettings();\n        rSettings.eType = getSelectedType();\n\n        return sal_True;\n    }\n\n    \/\/---------------------------------------------------------------------\n    sal_Bool TypeSelectionPage::determineNextButtonState()\n    {\n        return  AddressBookSourcePage::determineNextButtonState()\n            &&  (AST_INVALID != getSelectedType());\n    }\n\n    \/\/---------------------------------------------------------------------\n    IMPL_LINK( TypeSelectionPage, OnTypeSelected, void*, NOTINTERESTEDIN )\n    {\n        getDialog()->typeSelectionChanged( getSelectedType() );\n        implCheckNextButton();\n        return 0L;\n    }\n\n\/\/.........................................................................\n}   \/\/ namespace abp\n\/\/.........................................................................\n\n<|endoftext|>"}
{"text":"<commit_before>#include <cstdlib>\n#include <gtest\/gtest.h>\n#include <aikido\/util\/CatkinResourceRetriever.hpp>\n\n#define STR_EXPAND(tok) #tok\n#define STR(tok) STR_EXPAND(tok)\n\nusing aikido::util::CatkinResourceRetriever;\nusing dart::common::Uri;\nusing dart::common::ResourcePtr;\n\nstatic constexpr auto WORKSPACE_PATH = STR(AIKIDO_TEST_WORKSPACE_PATH);\n\n\/\/\/ gtest predicate for asserting that the content of a Resource equals a\n\/\/\/ string value. This predicate assumes that the ResourcePtr has its position\n\/\/\/ indicator at the beginning of the file. After calling this function, the\n\/\/\/ final location of the position indicator is undefined.\nstatic testing::AssertionResult CompareResourceContents(\n  const std::string& _expectedContent, const ResourcePtr& _resource)\n{\n  if (!_resource)\n    return testing::AssertionFailure() << \"Resource is nullptr\";\n\n  const size_t length = _resource->getSize();\n  std::vector<char> content_buffer(length, '\\0');\n  const size_t read_length = _resource->read(content_buffer.data(), length, 1);\n  if (read_length != 1)\n    return testing::AssertionFailure() << \"Failed reading Resource.\";\n\n  const std::string content(\n    std::begin(content_buffer), std::end(content_buffer));\n  if (content != _expectedContent)\n    return testing::AssertionFailure() << \"Got content \\\"\" << content\n      << \"\\\", expected \\\"\" << _expectedContent << \"\\\".\";\n\n  return testing::AssertionSuccess();\n}\n\nclass CatkinResourceRetrieverTests : public testing::Test\n{\n  void SetUp() override\n  {\n  }\n};\n\nTEST_F(CatkinResourceRetrieverTests, ExistsInDevelOnly)\n{\n  setenv(\"CMAKE_PREFIX_PATH\", WORKSPACE_PATH, 1);\n\n  const Uri uri = Uri::getUri(\"package:\/\/my_package1\/devel_only.txt\");\n  const std::string content = \"my_package1_devel_only\\n\";\n\n  CatkinResourceRetriever retriever;\n  EXPECT_TRUE(retriever.exists(uri));\n  EXPECT_TRUE(CompareResourceContents(content, retriever.retrieve(uri)));\n}\n\nTEST_F(CatkinResourceRetrieverTests, ExistsInSourceOnly)\n{\n  setenv(\"CMAKE_PREFIX_PATH\", WORKSPACE_PATH, 1);\n\n  const Uri uri = Uri::getUri(\"package:\/\/my_package1\/source_only.txt\");\n  const std::string content = \"my_package1_source_only\\n\";\n\n  CatkinResourceRetriever retriever;\n  EXPECT_TRUE(retriever.exists(uri));\n  EXPECT_TRUE(CompareResourceContents(content, retriever.retrieve(uri)));\n}\n\nTEST_F(CatkinResourceRetrieverTests, ExistsInDevelAndSource)\n{\n  setenv(\"CMAKE_PREFIX_PATH\", WORKSPACE_PATH, 1);\n\n  const Uri uri = Uri::getUri(\"package:\/\/my_package1\/devel_and_source.txt\");\n  const std::string content = \"my_package1_devel_and_source:devel\\n\";\n\n  CatkinResourceRetriever retriever;\n  EXPECT_TRUE(retriever.exists(uri));\n  EXPECT_TRUE(CompareResourceContents(content, retriever.retrieve(uri)));\n}\n\nTEST_F(CatkinResourceRetrieverTests, CatkinIgnore)\n{\n  setenv(\"CMAKE_PREFIX_PATH\", WORKSPACE_PATH, 1);\n\n  const Uri uri = Uri::getUri(\"package:\/\/my_package3\/ignored_file.txt\");\n\n  CatkinResourceRetriever retriever;\n  EXPECT_FALSE(retriever.exists(uri));\n  EXPECT_EQ(nullptr, retriever.retrieve(uri));\n}\n\nTEST_F(CatkinResourceRetrieverTests, NestedPackage)\n{\n  setenv(\"CMAKE_PREFIX_PATH\", WORKSPACE_PATH, 1);\n\n  const Uri uri = Uri::getUri(\"package:\/\/nested_package\/nested_file.txt\");\n\n  CatkinResourceRetriever retriever;\n  EXPECT_FALSE(retriever.exists(uri));\n  EXPECT_EQ(nullptr, retriever.retrieve(uri));\n}\n\nTEST_F(CatkinResourceRetrieverTests, FileDoesNotExist)\n{\n  setenv(\"CMAKE_PREFIX_PATH\", WORKSPACE_PATH, 1);\n\n  const Uri uri = Uri::getUri(\"package:\/\/my_package1\/does_not_exist.txt\");\n\n  CatkinResourceRetriever retriever;\n  EXPECT_FALSE(retriever.exists(uri));\n  EXPECT_EQ(nullptr, retriever.retrieve(uri));\n}\n\nTEST_F(CatkinResourceRetrieverTests, PackageDoesNotExist)\n{\n  setenv(\"CMAKE_PREFIX_PATH\", WORKSPACE_PATH, 1);\n\n  const Uri uri = Uri::getUri(\"package:\/\/does_not_exist\/devel_only.txt\");\n\n  CatkinResourceRetriever retriever;\n  EXPECT_FALSE(retriever.exists(uri));\n  EXPECT_EQ(nullptr, retriever.retrieve(uri));\n}\n\nTEST_F(CatkinResourceRetrieverTests, DoesNotUseDirectoryName)\n{\n  setenv(\"CMAKE_PREFIX_PATH\", WORKSPACE_PATH, 1);\n\n  const Uri uri = Uri::getUri(\"package:\/\/my_package2\/other_package.txt\");\n\n  CatkinResourceRetriever retriever;\n  EXPECT_FALSE(retriever.exists(uri));\n  EXPECT_EQ(nullptr, retriever.retrieve(uri));\n}\n\nTEST_F(CatkinResourceRetrieverTests, UsesPackageName)\n{\n  setenv(\"CMAKE_PREFIX_PATH\", WORKSPACE_PATH, 1);\n\n  const Uri uri = Uri::getUri(\"package:\/\/my_package2_actual\/other_package.txt\");\n  const std::string content = \"other_package\\n\";\n\n  CatkinResourceRetriever retriever;\n  EXPECT_TRUE(retriever.exists(uri));\n  EXPECT_TRUE(CompareResourceContents(content, retriever.retrieve(uri)));\n}\n\nTEST_F(CatkinResourceRetrieverTests, WorkspaceDoesNotExist)\n{\n  setenv(\"CMAKE_PREFIX_PATH\", \"\", 1);\n\n  const Uri uri = Uri::getUri(\"package:\/\/my_package1\/does_not_exist.txt\");\n\n  CatkinResourceRetriever retriever;\n  EXPECT_FALSE(retriever.exists(uri));\n  EXPECT_EQ(nullptr, retriever.retrieve(uri));\n}\n<commit_msg>Removed unnecessary test fixture.<commit_after>#include <cstdlib>\n#include <gtest\/gtest.h>\n#include <aikido\/util\/CatkinResourceRetriever.hpp>\n\n#define STR_EXPAND(tok) #tok\n#define STR(tok) STR_EXPAND(tok)\n\nusing aikido::util::CatkinResourceRetriever;\nusing dart::common::Uri;\nusing dart::common::ResourcePtr;\n\nstatic constexpr auto WORKSPACE_PATH = STR(AIKIDO_TEST_WORKSPACE_PATH);\n\n\/\/\/ gtest predicate for asserting that the content of a Resource equals a\n\/\/\/ string value. This predicate assumes that the ResourcePtr has its position\n\/\/\/ indicator at the beginning of the file. After calling this function, the\n\/\/\/ final location of the position indicator is undefined.\nstatic testing::AssertionResult CompareResourceContents(\n  const std::string& _expectedContent, const ResourcePtr& _resource)\n{\n  if (!_resource)\n    return testing::AssertionFailure() << \"Resource is nullptr\";\n\n  const size_t length = _resource->getSize();\n  std::vector<char> content_buffer(length, '\\0');\n  const size_t read_length = _resource->read(content_buffer.data(), length, 1);\n  if (read_length != 1)\n    return testing::AssertionFailure() << \"Failed reading Resource.\";\n\n  const std::string content(\n    std::begin(content_buffer), std::end(content_buffer));\n  if (content != _expectedContent)\n    return testing::AssertionFailure() << \"Got content \\\"\" << content\n      << \"\\\", expected \\\"\" << _expectedContent << \"\\\".\";\n\n  return testing::AssertionSuccess();\n}\n\nTEST(CatkinResourceRetrieverTests, ExistsInDevelOnly)\n{\n  setenv(\"CMAKE_PREFIX_PATH\", WORKSPACE_PATH, 1);\n\n  const Uri uri = Uri::getUri(\"package:\/\/my_package1\/devel_only.txt\");\n  const std::string content = \"my_package1_devel_only\\n\";\n\n  CatkinResourceRetriever retriever;\n  EXPECT_TRUE(retriever.exists(uri));\n  EXPECT_TRUE(CompareResourceContents(content, retriever.retrieve(uri)));\n}\n\nTEST(CatkinResourceRetrieverTests, ExistsInSourceOnly)\n{\n  setenv(\"CMAKE_PREFIX_PATH\", WORKSPACE_PATH, 1);\n\n  const Uri uri = Uri::getUri(\"package:\/\/my_package1\/source_only.txt\");\n  const std::string content = \"my_package1_source_only\\n\";\n\n  CatkinResourceRetriever retriever;\n  EXPECT_TRUE(retriever.exists(uri));\n  EXPECT_TRUE(CompareResourceContents(content, retriever.retrieve(uri)));\n}\n\nTEST(CatkinResourceRetrieverTests, ExistsInDevelAndSource)\n{\n  setenv(\"CMAKE_PREFIX_PATH\", WORKSPACE_PATH, 1);\n\n  const Uri uri = Uri::getUri(\"package:\/\/my_package1\/devel_and_source.txt\");\n  const std::string content = \"my_package1_devel_and_source:devel\\n\";\n\n  CatkinResourceRetriever retriever;\n  EXPECT_TRUE(retriever.exists(uri));\n  EXPECT_TRUE(CompareResourceContents(content, retriever.retrieve(uri)));\n}\n\nTEST(CatkinResourceRetrieverTests, CatkinIgnore)\n{\n  setenv(\"CMAKE_PREFIX_PATH\", WORKSPACE_PATH, 1);\n\n  const Uri uri = Uri::getUri(\"package:\/\/my_package3\/ignored_file.txt\");\n\n  CatkinResourceRetriever retriever;\n  EXPECT_FALSE(retriever.exists(uri));\n  EXPECT_EQ(nullptr, retriever.retrieve(uri));\n}\n\nTEST(CatkinResourceRetrieverTests, NestedPackage)\n{\n  setenv(\"CMAKE_PREFIX_PATH\", WORKSPACE_PATH, 1);\n\n  const Uri uri = Uri::getUri(\"package:\/\/nested_package\/nested_file.txt\");\n\n  CatkinResourceRetriever retriever;\n  EXPECT_FALSE(retriever.exists(uri));\n  EXPECT_EQ(nullptr, retriever.retrieve(uri));\n}\n\nTEST(CatkinResourceRetrieverTests, FileDoesNotExist)\n{\n  setenv(\"CMAKE_PREFIX_PATH\", WORKSPACE_PATH, 1);\n\n  const Uri uri = Uri::getUri(\"package:\/\/my_package1\/does_not_exist.txt\");\n\n  CatkinResourceRetriever retriever;\n  EXPECT_FALSE(retriever.exists(uri));\n  EXPECT_EQ(nullptr, retriever.retrieve(uri));\n}\n\nTEST(CatkinResourceRetrieverTests, PackageDoesNotExist)\n{\n  setenv(\"CMAKE_PREFIX_PATH\", WORKSPACE_PATH, 1);\n\n  const Uri uri = Uri::getUri(\"package:\/\/does_not_exist\/devel_only.txt\");\n\n  CatkinResourceRetriever retriever;\n  EXPECT_FALSE(retriever.exists(uri));\n  EXPECT_EQ(nullptr, retriever.retrieve(uri));\n}\n\nTEST(CatkinResourceRetrieverTests, DoesNotUseDirectoryName)\n{\n  setenv(\"CMAKE_PREFIX_PATH\", WORKSPACE_PATH, 1);\n\n  const Uri uri = Uri::getUri(\"package:\/\/my_package2\/other_package.txt\");\n\n  CatkinResourceRetriever retriever;\n  EXPECT_FALSE(retriever.exists(uri));\n  EXPECT_EQ(nullptr, retriever.retrieve(uri));\n}\n\nTEST(CatkinResourceRetrieverTests, UsesPackageName)\n{\n  setenv(\"CMAKE_PREFIX_PATH\", WORKSPACE_PATH, 1);\n\n  const Uri uri = Uri::getUri(\"package:\/\/my_package2_actual\/other_package.txt\");\n  const std::string content = \"other_package\\n\";\n\n  CatkinResourceRetriever retriever;\n  EXPECT_TRUE(retriever.exists(uri));\n  EXPECT_TRUE(CompareResourceContents(content, retriever.retrieve(uri)));\n}\n\nTEST(CatkinResourceRetrieverTests, WorkspaceDoesNotExist)\n{\n  setenv(\"CMAKE_PREFIX_PATH\", \"\", 1);\n\n  const Uri uri = Uri::getUri(\"package:\/\/my_package1\/does_not_exist.txt\");\n\n  CatkinResourceRetriever retriever;\n  EXPECT_FALSE(retriever.exists(uri));\n  EXPECT_EQ(nullptr, retriever.retrieve(uri));\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* This source file is part of ArkGameFrame\n* For the latest info, see https:\/\/github.com\/ArkGame\n*\n* Copyright (c) 2013-2017 ArkGame 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#pragma once\n\n#include \"AFPlatform.hpp\"\n#include \"AFMacros.hpp\"\n#include \"AFArrayPod.hpp\"\n#include \"AFStringPod.hpp\"\n\ntemplate<typename T>\nclass IsBuildinType\n{\npublic:\n    enum {YES = 1, NO = 0};\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ntemplate<typename KEY, typename NODE>\nclass AFArrayMap {};\n\n\/\/TODO:partial template specialization for KEY=BUILDIN types\n\n\n\/\/partial template specialization for KEY=std::string\ntemplate<typename NODE>\nclass AFArrayMap<std::string, NODE>\n{\npublic:\n    AFArrayMap()\n    {\n\n    }\n\n    ~AFArrayMap()\n    {\n        ReleaseAll();\n        mxIndices.Clear();\n    }\n\n    void Clear()\n    {\n        ReleaseAll();\n        mxIndices.Clear();\n    }\n\n    bool AddElement(const std::string& name, NODE* data)\n    {\n        mxIndices.Add(name.c_str(), mxNodes.size());\n        mxNodes.push_back(data);\n        return true;\n    }\n\n    NODE* GetElement(const std::string& name)\n    {\n        size_t index;\n        if (!mxIndices.GetData(name.c_str(), index))\n        {\n            return false;\n        }\n\n        return mxNodes[index];\n    }\n\n    NODE* operator[](size_t index)\n    {\n        ARK_ASSERT_RET_VAL(index < GetCount(), NULL);\n\n        return mxNodes[index];\n    }\n\n    bool RemoveElement(const std::string& name)\n    {\n        size_t index;\n        if (!mxIndices.GetData(name.c_str(), index))\n        {\n            return false;\n        }\n        \n        \/\/ͷڴ\n        if (NULL != mxNodes[index])\n        {\n            delete mxNodes[index];\n            mxNodes[index] = NULL;\n        }\n\n        mxNodes.remove(index);\n        mxIndices.Remove(name.c_str());\n        return true;\n    }\n\n    size_t GetCount() const\n    {\n        return mxNodes.size();\n    }\n\nprotected:\n    void ReleaseAll()\n    {\n        for (size_t i = 0; i < GetCount(); ++i)\n        {\n            delete mxNodes[i];\n            mxNodes[i] = NULL;\n        }\n\n        mxNodes.clear();\n    }\n\nprivate:\n    ArraryPod<NODE*, 1, CoreAlloc> mxNodes;\n    StringPod<char, size_t, StringTraits<char>> mxIndices;\n};<commit_msg>Add build-in type AFArrayMap(not finished yet)<commit_after>\/*\n* This source file is part of ArkGameFrame\n* For the latest info, see https:\/\/github.com\/ArkGame\n*\n* Copyright (c) 2013-2017 ArkGame 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#pragma once\n\n#include \"AFPlatform.hpp\"\n#include \"AFMacros.hpp\"\n#include \"AFArrayPod.hpp\"\n#include \"AFStringPod.hpp\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename T>\nclass IsBuildinType\n{\npublic:\n    enum {YES = false, NO = true};\n};\n\n#define MAKE_BUILDIN_TYPE(T)                \\\n    template<> class IsBuildinType<T>       \\\n    {                                       \\\n    public:                                 \\\n        enum { YES = true, NO = false };    \\\n    };\n\ntemplate <typename T>\nbool CheckBuildinType(const T& t)\n{\n    return IsBuildinType<T>::YES ? true : false;\n\n    \/\/if (IsBuildinType<T>::YES)\n    \/\/{\n    \/\/    std::cout << typename(T)  << \" is BuildIn type\" << std::endl;\n    \/\/}\n    \/\/else\n    \/\/{\n    \/\/    std::cout << typename(T) << \" is BuildIn type\" << std::endl;\n    \/\/}\n}\n\nMAKE_BUILDIN_TYPE(uint16_t)\nMAKE_BUILDIN_TYPE(uint32_t)\nMAKE_BUILDIN_TYPE(uint64_t)\nMAKE_BUILDIN_TYPE(int16_t)\nMAKE_BUILDIN_TYPE(int32_t)\nMAKE_BUILDIN_TYPE(int64_t)\nMAKE_BUILDIN_TYPE(AFGUID)\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ntemplate<typename KEY, typename NODE>\nclass AFArrayMap {};\n\n\/\/partial template specialization for KEY=BUILD-IN types\n\/\/build-in type is defined above\ntemplate<typename T, typename NODE>\nclass AFArrayMap<T, NODE>\n{\npublic:\nprotected:\nprivate:\n    ArraryPod<NODE*, 1, CoreAlloc> mxNodes;\n    \/\/StringPod<char, size_t, StringTraits<char>> mxIndices;\n};\n\n\/\/partial template specialization for KEY=std::string\ntemplate<typename NODE>\nclass AFArrayMap<std::string, NODE>\n{\npublic:\n    AFArrayMap()\n    {\n\n    }\n\n    ~AFArrayMap()\n    {\n        ReleaseAll();\n        mxIndices.Clear();\n    }\n\n    void Clear()\n    {\n        ReleaseAll();\n        mxIndices.Clear();\n    }\n\n    bool AddElement(const std::string& name, NODE* data)\n    {\n        mxIndices.Add(name.c_str(), mxNodes.size());\n        mxNodes.push_back(data);\n        return true;\n    }\n\n    NODE* GetElement(const std::string& name)\n    {\n        size_t index;\n        if (!mxIndices.GetData(name.c_str(), index))\n        {\n            return false;\n        }\n\n        return mxNodes[index];\n    }\n\n    NODE* operator[](size_t index)\n    {\n        ARK_ASSERT_RET_VAL(index < GetCount(), NULL);\n\n        return mxNodes[index];\n    }\n\n    bool RemoveElement(const std::string& name)\n    {\n        size_t index;\n        if (!mxIndices.GetData(name.c_str(), index))\n        {\n            return false;\n        }\n        \n        \/\/ͷڴ\n        if (NULL != mxNodes[index])\n        {\n            delete mxNodes[index];\n            mxNodes[index] = NULL;\n        }\n\n        mxNodes.remove(index);\n        mxIndices.Remove(name.c_str());\n        return true;\n    }\n\n    size_t GetCount() const\n    {\n        return mxNodes.size();\n    }\n\nprotected:\n    void ReleaseAll()\n    {\n        for (size_t i = 0; i < GetCount(); ++i)\n        {\n            delete mxNodes[i];\n            mxNodes[i] = NULL;\n        }\n\n        mxNodes.clear();\n    }\n\nprivate:\n    ArraryPod<NODE*, 1, CoreAlloc> mxNodes;\n    StringPod<char, size_t, StringTraits<char>> mxIndices;\n};<|endoftext|>"}
{"text":"<commit_before>#include \"..\/Atomic.h\"\n#include <assert.h>\n\nint main()\n{\n  muduo::AtomicInt64 a0;\n  assert(a0.get() == 0);\n  assert(a0.getAndAdd(1) == 0);\n  assert(a0.get() == 1);\n  assert(a0.addAndGet(2) == 3);\n  assert(a0.get() == 3);\n  assert(a0.incrementAndGet() == 4);\n  assert(a0.get() == 4);\n  a0.increment();\n  assert(a0.get() == 5);\n  assert(a0.addAndGet(-3) == 2);\n  assert(a0.getAndSet(100) == 2);\n  assert(a0.get() == 100);\n}\n\n<commit_msg>add AtomicInt32 unittest<commit_after>#include \"..\/Atomic.h\"\n#include <assert.h>\n\nint main()\n{\n  {\n  muduo::AtomicInt64 a0;\n  assert(a0.get() == 0);\n  assert(a0.getAndAdd(1) == 0);\n  assert(a0.get() == 1);\n  assert(a0.addAndGet(2) == 3);\n  assert(a0.get() == 3);\n  assert(a0.incrementAndGet() == 4);\n  assert(a0.get() == 4);\n  a0.increment();\n  assert(a0.get() == 5);\n  assert(a0.addAndGet(-3) == 2);\n  assert(a0.getAndSet(100) == 2);\n  assert(a0.get() == 100);\n  }\n\n  {\n  muduo::AtomicInt32 a1;\n  assert(a1.get() == 0);\n  assert(a1.getAndAdd(1) == 0);\n  assert(a1.get() == 1);\n  assert(a1.addAndGet(2) == 3);\n  assert(a1.get() == 3);\n  assert(a1.incrementAndGet() == 4);\n  assert(a1.get() == 4);\n  a1.increment();\n  assert(a1.get() == 5);\n  assert(a1.addAndGet(-3) == 2);\n  assert(a1.getAndSet(100) == 2);\n  assert(a1.get() == 100);\n  }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*  This file is part of the KDE project\n    Copyright (C) 2005-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 \"bytestream.h\"\n#include \"bytestream_p.h\"\n#include \"factory.h\"\n#include \"bytestreaminterface.h\"\n\n#define PHONON_CLASSNAME ByteStream\n#define PHONON_INTERFACENAME ByteStreamInterface\nnamespace Phonon\n{\nPHONON_HEIR_IMPL( AbstractMediaProducer )\n\nPHONON_GETTER( qint64, totalTime, -1 )\nPHONON_GETTER( qint32, aboutToFinishTime, d->aboutToFinishTime )\nPHONON_GETTER( qint64, streamSize, d->streamSize )\nPHONON_GETTER( bool, streamSeekable, d->streamSeekable )\n\nqint64 ByteStream::remainingTime() const\n{\n\tK_D( const ByteStream );\n\tif( !d->backendObject )\n\t\treturn -1;\n\tqint64 ret;\n\tif( BACKEND_GET( qint64, ret, \"remainingTime\" ) )\n\t\treturn ret;\n\treturn totalTime() - currentTime();\n}\n\nPHONON_SETTER( setStreamSeekable, streamSeekable, bool )\nPHONON_SETTER( setStreamSize, streamSize, qint64 )\nPHONON_SETTER( setAboutToFinishTime, aboutToFinishTime, qint32 )\n\n\/*inline void** ByteStreamPrivate::writeDataParameters( const QByteArray& data )\n{\n\tvoid* param[] = { 0, static_cast<const void*>( &data ), 0, 0, 0, 0, 0, 0, 0, 0, 0 };\n\treturn param;\n}*\/\n\nvoid ByteStream::writeData( const QByteArray& data )\n{\n\tK_D( ByteStream );\n\tif( iface() )\n\t{\n\t\tByteStreamInterface* bs = qobject_cast<ByteStreamInterface*>( d->backendObject );\n\t\tbs->writeData( data );\n\t}\n}\n\nvoid ByteStream::endOfData()\n{\n\tK_D( ByteStream );\n\tif( iface() )\n\t\tBACKEND_CALL( \"endOfData\" );\n}\n\nbool ByteStreamPrivate::aboutToDeleteIface()\n{\n\tif( backendObject )\n\t{\n\t\tpBACKEND_GET( qint32, aboutToFinishTime, \"aboutToFinishTime\" );\n\t\tpBACKEND_GET( qint64, streamSize, \"streamSize\" );\n\t\tpBACKEND_GET( bool, streamSeekable, \"streamSeekable\" );\n\t}\n\treturn AbstractMediaProducerPrivate::aboutToDeleteIface();\n}\n\nvoid ByteStream::setupIface()\n{\n\tK_D( ByteStream );\n\tQ_ASSERT( d->backendObject );\n\tAbstractMediaProducer::setupIface();\n\n\tconnect( d->backendObject, SIGNAL( finished() ), SIGNAL( finished() ) );\n\tconnect( d->backendObject, SIGNAL( aboutToFinish( qint32 ) ), SIGNAL( aboutToFinish( qint32 ) ) );\n\tconnect( d->backendObject, SIGNAL( length( qint64 ) ), SIGNAL( length( qint64 ) ) );\n\tconnect( d->backendObject, SIGNAL( needData() ), SIGNAL( needData() ) );\n\tconnect( d->backendObject, SIGNAL( enoughData() ), SIGNAL( enoughData() ) );\n\tconnect( d->backendObject, SIGNAL( seekStream( qint64 ) ), SIGNAL( seekStream( qint64 ) ) );\n\n\tBACKEND_CALL1( \"setAboutToFinishTime\", qint32, d->aboutToFinishTime );\n}\n\n} \/\/namespace Phonon\n\n#include \"bytestream.moc\"\n\n\/\/ vim: sw=4 ts=4 tw=80 noet\n<commit_msg>use the interface in the ByteStream frontend as well<commit_after>\/*  This file is part of the KDE project\n    Copyright (C) 2005-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 \"bytestream.h\"\n#include \"bytestream_p.h\"\n#include \"factory.h\"\n#include \"bytestreaminterface.h\"\n\n#define PHONON_CLASSNAME ByteStream\n#define PHONON_INTERFACENAME ByteStreamInterface\nnamespace Phonon\n{\nPHONON_HEIR_IMPL( AbstractMediaProducer )\n\nPHONON_INTERFACE_GETTER( qint64, totalTime, -1 )\nPHONON_GETTER( qint32, aboutToFinishTime, d->aboutToFinishTime )\nPHONON_GETTER( qint64, streamSize, d->streamSize )\nPHONON_GETTER( bool, streamSeekable, d->streamSeekable )\n\nqint64 ByteStream::remainingTime() const\n{\n\tK_D( const ByteStream );\n\tif( !d->backendObject )\n\t\treturn -1;\n\tqint64 ret;\n\tif( BACKEND_GET( qint64, ret, \"remainingTime\" ) )\n\t\treturn ret;\n\treturn totalTime() - currentTime();\n}\n\nPHONON_SETTER( setStreamSeekable, streamSeekable, bool )\nPHONON_SETTER( setStreamSize, streamSize, qint64 )\nPHONON_SETTER( setAboutToFinishTime, aboutToFinishTime, qint32 )\n\n\/*inline void** ByteStreamPrivate::writeDataParameters( const QByteArray& data )\n{\n\tvoid* param[] = { 0, static_cast<const void*>( &data ), 0, 0, 0, 0, 0, 0, 0, 0, 0 };\n\treturn param;\n}*\/\n\nvoid ByteStream::writeData( const QByteArray& data )\n{\n\tK_D( ByteStream );\n\tif( iface() )\n\t{\n\t\tByteStreamInterface* bs = qobject_cast<ByteStreamInterface*>( d->backendObject );\n\t\tbs->writeData( data );\n\t}\n}\n\nvoid ByteStream::endOfData()\n{\n\tK_D( ByteStream );\n\tif( iface() )\n\t\tBACKEND_CALL( \"endOfData\" );\n}\n\nbool ByteStreamPrivate::aboutToDeleteIface()\n{\n\tif( backendObject )\n\t{\n\t\tpBACKEND_GET( qint32, aboutToFinishTime, \"aboutToFinishTime\" );\n\t\tpBACKEND_GET( qint64, streamSize, \"streamSize\" );\n\t\tpBACKEND_GET( bool, streamSeekable, \"streamSeekable\" );\n\t}\n\treturn AbstractMediaProducerPrivate::aboutToDeleteIface();\n}\n\nvoid ByteStream::setupIface()\n{\n\tK_D( ByteStream );\n\tQ_ASSERT( d->backendObject );\n\tAbstractMediaProducer::setupIface();\n\n\tconnect( d->backendObject, SIGNAL( finished() ), SIGNAL( finished() ) );\n\tconnect( d->backendObject, SIGNAL( aboutToFinish( qint32 ) ), SIGNAL( aboutToFinish( qint32 ) ) );\n\tconnect( d->backendObject, SIGNAL( length( qint64 ) ), SIGNAL( length( qint64 ) ) );\n\tconnect( d->backendObject, SIGNAL( needData() ), SIGNAL( needData() ) );\n\tconnect( d->backendObject, SIGNAL( enoughData() ), SIGNAL( enoughData() ) );\n\tconnect( d->backendObject, SIGNAL( seekStream( qint64 ) ), SIGNAL( seekStream( qint64 ) ) );\n\n\tBACKEND_CALL1( \"setAboutToFinishTime\", qint32, d->aboutToFinishTime );\n}\n\n} \/\/namespace Phonon\n\n#include \"bytestream.moc\"\n\n\/\/ vim: sw=4 ts=4 tw=80 noet\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2014-2016, imec\n * All rights reserved.\n *\/\n\n\n#include <random>\n#include <memory>\n#include <cstdio>\n#include <iostream>\n#include <climits>\n#include <stdexcept>\n\n#include \"error.h\"\n#include \"bpmf.h\"\n#include \"io.h\"\n\nstatic const bool measure_perf = false;\n\nstd::ostream *Sys::os;\nint Sys::procid = -1;\nint Sys::nprocs = -1;\n\nint Sys::nsims;\nint Sys::burnin;\nint Sys::update_freq;\ndouble Sys::alpha = 2.0;\n\nstd::string Sys::odirname = \"\";\n\nbool Sys::permute = true;\nbool Sys::verbose = false;\n\nunsigned Sys::grain_size;\n\n\/\/ verifies that A has the same non-zero structure as B\nvoid assert_same_struct(SparseMatrixD &A, SparseMatrixD &B)\n{\n    assert(A.cols() == B.cols());\n    assert(A.rows() == B.rows());\n    for(int i=0; i<A.cols(); ++i) assert(A.col(i).nonZeros() == B.col(i).nonZeros());\n}\n\n\/\/\n\/\/ Does predictions for prediction matrix T\n\/\/ Computes RMSE (Root Means Square Error)\n\/\/\nvoid Sys::predict(Sys& other, bool all)\n{\n    int n = (iter < burnin) ? 0 : (iter - burnin);\n   \n    double se(0.0); \/\/ squared err\n    double se_avg(0.0); \/\/ squared avg err\n    unsigned nump(0); \/\/ number of predictions\n\n    int lo = all ? 0 : from();\n    int hi = all ? num() : to();\n    #pragma omp parallel for reduction(+:se,se_avg,nump)\n    for(int k = lo; k<hi; k++) {\n        for (Eigen::SparseMatrix<double>::InnerIterator it(T,k); it; ++it)\n        {\n            auto m = items().col(it.col());\n            auto u = other.items().col(it.row());\n\n            assert(m.norm() > 0.0);\n            assert(u.norm() > 0.0);\n\n            const double pred = m.dot(u) + mean_rating;\n            se += sqr(it.value() - pred);\n\n            \/\/ update average prediction\n            double &avg = Pavg.coeffRef(it.row(), it.col());\n            double delta = pred - avg;\n            avg = (n == 0) ? pred : (avg + delta\/n);\n            double &m2 = Pm2.coeffRef(it.row(), it.col());\n            m2 = (n == 0) ? 0 : m2 + delta * (pred - avg);\n            se_avg += sqr(it.value() - avg);\n\n            nump++;\n        }\n    }\n\n    rmse = sqrt( se \/ nump );\n    rmse_avg = sqrt( se_avg \/ nump );\n}\n\n\/\/\n\/\/ Prints sampling progress\n\/\/\nvoid Sys::print(double items_per_sec, double ratings_per_sec, double norm_u, double norm_m) {\n  char buf[1024];\n  std::string phase = (iter < Sys::burnin) ? \"Burnin\" : \"Sampling\";\n  sprintf(buf, \"%d: %s iteration %d:\\t RMSE: %3.4f\\tavg RMSE: %3.4f\\tFU(%6.2f)\\tFM(%6.2f)\\titems\/sec: %6.2f\\tratings\/sec: %6.2fM\\n\",\n                    Sys::procid, phase.c_str(), iter, rmse, rmse_avg, norm_u, norm_m, items_per_sec, ratings_per_sec \/ 1e6);\n  Sys::cout() << buf;\n}\n\n\/\/\n\/\/ Constructor with that reads MTX files\n\/\/ \nSys::Sys(std::string name, std::string fname, std::string probename)\n    : name(name), iter(-1), assigned(false), dom(nprocs+1)\n{\n\n    read_matrix(fname, M);\n    read_matrix(probename, T);\n\n    auto rows = std::max(M.rows(), T.rows());\n    auto cols = std::max(M.cols(), T.cols());\n    M.conservativeResize(rows,cols);\n    T.conservativeResize(rows,cols);\n    Pm2 = Pavg = Torig = T; \/\/ reference ratings and predicted ratings\n    assert(M.rows() == Pavg.rows());\n    assert(M.cols() == Pavg.cols());\n    assert(Sys::nprocs <= (int)Sys::max_procs);\n}\n\n\/\/\n\/\/ Constructs Sys as transpose of existing Sys\n\/\/\nSys::Sys(std::string name, const SparseMatrixD &Mt, const SparseMatrixD &Pt) : name(name), iter(-1), assigned(false), dom(nprocs+1) {\n    M = Mt.transpose();\n    Pm2 = Pavg = T = Torig = Pt.transpose(); \/\/ reference ratings and predicted ratings\n    assert(M.rows() == Pavg.rows());\n    assert(M.cols() == Pavg.cols());\n}\n\nSys::~Sys() \n{\n    if (measure_perf) {\n        Sys::cout() << \" --------------------\\n\";\n        Sys::cout() << name << \": sampling times on \" << procid << \"\\n\";\n        for(int i = from(); i<to(); ++i) \n        {\n            Sys::cout() << \"\\t\" << nnz(i) << \"\\t\" << sample_time.at(i) \/ nsims  << \"\\n\";\n        }\n        Sys::cout() << \" --------------------\\n\\n\";\n    }\n}\n\n\/\/\n\/\/ Intializes internal Matrices and Vectors\n\/\/\nvoid Sys::init()\n{\n    \/\/-- M\n    assert(M.rows() > 0 && M.cols() > 0);\n    mean_rating = M.sum() \/ M.nonZeros();\n    items().setZero();\n    sum_map().setZero();\n    cov_map().setZero();\n    norm_map().setZero();\n    col_permutation.setIdentity(num());\n\n#ifdef BPMF_REDUCE\n    precMu = std::vector<VectorNd>(num(), VectorNd::Zero());\n    precLambda = std::vector<MatrixNNd>(num(), MatrixNNd::Zero());\n#endif\n\n    Sys::cout() << \"mean rating: \" << mean_rating << std::endl;\n    Sys::cout() << \"total number of ratings in train: \" << M.nonZeros() << std::endl;\n    Sys::cout() << \"total number of ratings in test: \" << T.nonZeros() << std::endl;\n    Sys::cout() << \"average ratings per row: \" << (double)M.nonZeros() \/ (double)M.cols() << std::endl;\n    Sys::cout() << \"num \" << name << \": \" << num() << std::endl;\n\n    if (measure_perf) sample_time.resize(num(), .0);\n}\n\nclass PrecomputedLLT : public Eigen::LLT<MatrixNNd>\n{\n  public:\n    void operator=(const MatrixNNd &m) { m_matrix = m; m_isInitialized = true; m_info = Eigen::Success; }\n};\n\n\n\/\/\n\/\/ Update ONE movie or one user\n\/\/\nVectorNd Sys::sample(long idx, Sys &other)\n{\n    auto start = tick();\n\n    VectorNd rr = hp.LambdaF * hp.mu;                \/\/ vector num_latent x 1, we will use it in formula (14) from the paper\n    PrecomputedLLT chol;                             \/\/ matrix num_latent x num_latent, chol=\"lambda_i with *\" from formula (14)\n\n    MatrixNNd MM(MatrixNNd::Zero());\n\n#ifdef BPMF_REDUCE\n    rr += precMu.at(idx);\n    MM += precLambda.at(idx);\n#else\n    for (SparseMatrixD::InnerIterator it(M, idx); it; ++it)\n    {\n        auto col = other.items().col(it.row());\n        MM.triangularView<Eigen::Upper>() += col * col.transpose();\n        rr.noalias() += col * ((it.value() - mean_rating) * alpha);\n    }\n#endif\n    \n    \/\/ copy upper -> lower part, matrix is symmetric.\n    MM.triangularView<Eigen::Lower>() = MM.transpose();\n\n    chol.compute(hp.LambdaF + alpha * MM);\n\n    if(chol.info() != Eigen::Success) THROWERROR(\"Cholesky failed\");\n\n    \/\/ now we should calculate formula (14) from the paper\n    \/\/ u_i for k-th iteration = Gaussian distribution N(u_i | mu_i with *, [lambda_i with *]^-1) =\n    \/\/                        = mu_i with * + s * [U]^-1, \n    \/\/                        where \n    \/\/                              s is a random vector with N(0, I),\n    \/\/                              mu_i with * is a vector num_latent x 1, \n    \/\/                              mu_i with * = [lambda_i with *]^-1 * rr,\n    \/\/                              lambda_i with * = L * U       \n\n    \/\/ Expression u_i = U \\ (s + (L \\ rr)) in Matlab looks for Eigen library like: \n\n    chol.matrixL().solveInPlace(rr);                    \/\/ L*Y=rr => Y=L\\rr, we store Y result again in rr vector  \n    rr += nrandn();                                     \/\/ rr=s+(L\\rr), we store result again in rr vector\n    chol.matrixU().solveInPlace(rr);                    \/\/ u_i=U\\rr \n    items().col(idx) = rr;                              \/\/ we save rr vector in items matrix (it is user features matrix)\n\n#ifdef BPMF_REDUCE\n    SHOW(\"Adding\");\n    SHOW(rr.transpose());\n    for (SparseMatrixD::InnerIterator it(M, idx); it; ++it)\n    {\n        other.precLambda.at(it.row()).triangularView<Eigen::Upper>() += rr * rr.transpose();\n        other.precMu.at(it.row()).noalias() += rr * (it.value() - mean_rating) * alpha;\n    }\n#endif\n\n    auto stop = tick();\n    register_time(idx, 1e6 * (stop - start));\n    \/\/Sys::cout() << \"  \" << count << \": \" << 1e6*(stop - start) << std::endl;\n\n    assert(rr.norm() > .0);\n\n    return rr;\n}\n\n\/\/ \n\/\/ update ALL movies \/ users in parallel\n\/\/\nvoid Sys::sample(Sys &other) \n{\n    iter++;\n    thread_vector<VectorNd>  sums(VectorNd::Zero()); \/\/ sum\n    thread_vector<double>    norms(0.0); \/\/ squared norm\n    thread_vector<MatrixNNd> prods(MatrixNNd::Zero()); \/\/ outer prod\n\n#ifdef BPMF_REDUCE\n    other.precMu = std::vector<VectorNd>(other.num(), VectorNd::Zero());\n    other.precLambda = std::vector<MatrixNNd>(other.num(), MatrixNNd::Zero());\n#endif\n\n#pragma omp parallel for schedule(guided)\n    for (int i = from(); i < to(); ++i)\n    {\n#pragma omp task\n        {\n            auto r = sample(i, other);\n\n            MatrixNNd cov = (r * r.transpose());\n            prods.local() += cov;\n            sums.local() += r;\n            norms.local() += r.squaredNorm();\n            send_item(i);\n        }\n    }\n#pragma omp taskwait\n\n    VectorNd sum = sums.combine();\n    MatrixNNd prod = prods.combine();   \n    double norm = norms.combine();\n\n    const int N = num();\n    local_sum() = sum;\n    local_cov() = (prod - (sum * sum.transpose() \/ N)) \/ (N-1);\n    local_norm() = norm;\n}\n\nvoid Sys::register_time(int i, double t)\n{\n    if (measure_perf) sample_time.at(i) += t;\n}<commit_msg>WIP: added omp critical when updating precMu\/precLambda<commit_after>\/*\n * Copyright (c) 2014-2016, imec\n * All rights reserved.\n *\/\n\n\n#include <random>\n#include <memory>\n#include <cstdio>\n#include <iostream>\n#include <climits>\n#include <stdexcept>\n\n#include \"error.h\"\n#include \"bpmf.h\"\n#include \"io.h\"\n\nstatic const bool measure_perf = false;\n\nstd::ostream *Sys::os;\nint Sys::procid = -1;\nint Sys::nprocs = -1;\n\nint Sys::nsims;\nint Sys::burnin;\nint Sys::update_freq;\ndouble Sys::alpha = 2.0;\n\nstd::string Sys::odirname = \"\";\n\nbool Sys::permute = true;\nbool Sys::verbose = false;\n\nunsigned Sys::grain_size;\n\n\/\/ verifies that A has the same non-zero structure as B\nvoid assert_same_struct(SparseMatrixD &A, SparseMatrixD &B)\n{\n    assert(A.cols() == B.cols());\n    assert(A.rows() == B.rows());\n    for(int i=0; i<A.cols(); ++i) assert(A.col(i).nonZeros() == B.col(i).nonZeros());\n}\n\n\/\/\n\/\/ Does predictions for prediction matrix T\n\/\/ Computes RMSE (Root Means Square Error)\n\/\/\nvoid Sys::predict(Sys& other, bool all)\n{\n    int n = (iter < burnin) ? 0 : (iter - burnin);\n   \n    double se(0.0); \/\/ squared err\n    double se_avg(0.0); \/\/ squared avg err\n    unsigned nump(0); \/\/ number of predictions\n\n    int lo = all ? 0 : from();\n    int hi = all ? num() : to();\n    #pragma omp parallel for reduction(+:se,se_avg,nump)\n    for(int k = lo; k<hi; k++) {\n        for (Eigen::SparseMatrix<double>::InnerIterator it(T,k); it; ++it)\n        {\n            auto m = items().col(it.col());\n            auto u = other.items().col(it.row());\n\n            assert(m.norm() > 0.0);\n            assert(u.norm() > 0.0);\n\n            const double pred = m.dot(u) + mean_rating;\n            se += sqr(it.value() - pred);\n\n            \/\/ update average prediction\n            double &avg = Pavg.coeffRef(it.row(), it.col());\n            double delta = pred - avg;\n            avg = (n == 0) ? pred : (avg + delta\/n);\n            double &m2 = Pm2.coeffRef(it.row(), it.col());\n            m2 = (n == 0) ? 0 : m2 + delta * (pred - avg);\n            se_avg += sqr(it.value() - avg);\n\n            nump++;\n        }\n    }\n\n    rmse = sqrt( se \/ nump );\n    rmse_avg = sqrt( se_avg \/ nump );\n}\n\n\/\/\n\/\/ Prints sampling progress\n\/\/\nvoid Sys::print(double items_per_sec, double ratings_per_sec, double norm_u, double norm_m) {\n  char buf[1024];\n  std::string phase = (iter < Sys::burnin) ? \"Burnin\" : \"Sampling\";\n  sprintf(buf, \"%d: %s iteration %d:\\t RMSE: %3.4f\\tavg RMSE: %3.4f\\tFU(%6.2f)\\tFM(%6.2f)\\titems\/sec: %6.2f\\tratings\/sec: %6.2fM\\n\",\n                    Sys::procid, phase.c_str(), iter, rmse, rmse_avg, norm_u, norm_m, items_per_sec, ratings_per_sec \/ 1e6);\n  Sys::cout() << buf;\n}\n\n\/\/\n\/\/ Constructor with that reads MTX files\n\/\/ \nSys::Sys(std::string name, std::string fname, std::string probename)\n    : name(name), iter(-1), assigned(false), dom(nprocs+1)\n{\n\n    read_matrix(fname, M);\n    read_matrix(probename, T);\n\n    auto rows = std::max(M.rows(), T.rows());\n    auto cols = std::max(M.cols(), T.cols());\n    M.conservativeResize(rows,cols);\n    T.conservativeResize(rows,cols);\n    Pm2 = Pavg = Torig = T; \/\/ reference ratings and predicted ratings\n    assert(M.rows() == Pavg.rows());\n    assert(M.cols() == Pavg.cols());\n    assert(Sys::nprocs <= (int)Sys::max_procs);\n}\n\n\/\/\n\/\/ Constructs Sys as transpose of existing Sys\n\/\/\nSys::Sys(std::string name, const SparseMatrixD &Mt, const SparseMatrixD &Pt) : name(name), iter(-1), assigned(false), dom(nprocs+1) {\n    M = Mt.transpose();\n    Pm2 = Pavg = T = Torig = Pt.transpose(); \/\/ reference ratings and predicted ratings\n    assert(M.rows() == Pavg.rows());\n    assert(M.cols() == Pavg.cols());\n}\n\nSys::~Sys() \n{\n    if (measure_perf) {\n        Sys::cout() << \" --------------------\\n\";\n        Sys::cout() << name << \": sampling times on \" << procid << \"\\n\";\n        for(int i = from(); i<to(); ++i) \n        {\n            Sys::cout() << \"\\t\" << nnz(i) << \"\\t\" << sample_time.at(i) \/ nsims  << \"\\n\";\n        }\n        Sys::cout() << \" --------------------\\n\\n\";\n    }\n}\n\n\/\/\n\/\/ Intializes internal Matrices and Vectors\n\/\/\nvoid Sys::init()\n{\n    \/\/-- M\n    assert(M.rows() > 0 && M.cols() > 0);\n    mean_rating = M.sum() \/ M.nonZeros();\n    items().setZero();\n    sum_map().setZero();\n    cov_map().setZero();\n    norm_map().setZero();\n    col_permutation.setIdentity(num());\n\n#ifdef BPMF_REDUCE\n    precMu = std::vector<VectorNd>(num(), VectorNd::Zero());\n    precLambda = std::vector<MatrixNNd>(num(), MatrixNNd::Zero());\n#endif\n\n    Sys::cout() << \"mean rating: \" << mean_rating << std::endl;\n    Sys::cout() << \"total number of ratings in train: \" << M.nonZeros() << std::endl;\n    Sys::cout() << \"total number of ratings in test: \" << T.nonZeros() << std::endl;\n    Sys::cout() << \"average ratings per row: \" << (double)M.nonZeros() \/ (double)M.cols() << std::endl;\n    Sys::cout() << \"num \" << name << \": \" << num() << std::endl;\n\n    if (measure_perf) sample_time.resize(num(), .0);\n}\n\nclass PrecomputedLLT : public Eigen::LLT<MatrixNNd>\n{\n  public:\n    void operator=(const MatrixNNd &m) { m_matrix = m; m_isInitialized = true; m_info = Eigen::Success; }\n};\n\n\n\/\/\n\/\/ Update ONE movie or one user\n\/\/\nVectorNd Sys::sample(long idx, Sys &other)\n{\n    auto start = tick();\n\n    VectorNd rr = hp.LambdaF * hp.mu;                \/\/ vector num_latent x 1, we will use it in formula (14) from the paper\n    PrecomputedLLT chol;                             \/\/ matrix num_latent x num_latent, chol=\"lambda_i with *\" from formula (14)\n\n    MatrixNNd MM(MatrixNNd::Zero());\n\n#ifdef BPMF_REDUCE\n    rr += precMu.at(idx);\n    MM += precLambda.at(idx);\n#else\n    for (SparseMatrixD::InnerIterator it(M, idx); it; ++it)\n    {\n        auto col = other.items().col(it.row());\n        MM.triangularView<Eigen::Upper>() += col * col.transpose();\n        rr.noalias() += col * ((it.value() - mean_rating) * alpha);\n    }\n#endif\n    \n    \/\/ copy upper -> lower part, matrix is symmetric.\n    MM.triangularView<Eigen::Lower>() = MM.transpose();\n\n    chol.compute(hp.LambdaF + alpha * MM);\n\n    if(chol.info() != Eigen::Success) THROWERROR(\"Cholesky failed\");\n\n    \/\/ now we should calculate formula (14) from the paper\n    \/\/ u_i for k-th iteration = Gaussian distribution N(u_i | mu_i with *, [lambda_i with *]^-1) =\n    \/\/                        = mu_i with * + s * [U]^-1, \n    \/\/                        where \n    \/\/                              s is a random vector with N(0, I),\n    \/\/                              mu_i with * is a vector num_latent x 1, \n    \/\/                              mu_i with * = [lambda_i with *]^-1 * rr,\n    \/\/                              lambda_i with * = L * U       \n\n    \/\/ Expression u_i = U \\ (s + (L \\ rr)) in Matlab looks for Eigen library like: \n\n    chol.matrixL().solveInPlace(rr);                    \/\/ L*Y=rr => Y=L\\rr, we store Y result again in rr vector  \n    rr += nrandn();                                     \/\/ rr=s+(L\\rr), we store result again in rr vector\n    chol.matrixU().solveInPlace(rr);                    \/\/ u_i=U\\rr \n    items().col(idx) = rr;                              \/\/ we save rr vector in items matrix (it is user features matrix)\n\n#ifdef BPMF_REDUCE\n    #pragma omp critical\n    for (SparseMatrixD::InnerIterator it(M, idx); it; ++it)\n    {\n        other.precLambda.at(it.row()).triangularView<Eigen::Upper>() += rr * rr.transpose();\n        other.precMu.at(it.row()).noalias() += rr * (it.value() - mean_rating) * alpha;\n    }\n#endif\n\n    auto stop = tick();\n    register_time(idx, 1e6 * (stop - start));\n    \/\/Sys::cout() << \"  \" << count << \": \" << 1e6*(stop - start) << std::endl;\n\n    assert(rr.norm() > .0);\n\n    return rr;\n}\n\n\/\/ \n\/\/ update ALL movies \/ users in parallel\n\/\/\nvoid Sys::sample(Sys &other) \n{\n    iter++;\n    thread_vector<VectorNd>  sums(VectorNd::Zero()); \/\/ sum\n    thread_vector<double>    norms(0.0); \/\/ squared norm\n    thread_vector<MatrixNNd> prods(MatrixNNd::Zero()); \/\/ outer prod\n\n#ifdef BPMF_REDUCE\n    other.precMu = std::vector<VectorNd>(other.num(), VectorNd::Zero());\n    other.precLambda = std::vector<MatrixNNd>(other.num(), MatrixNNd::Zero());\n#endif\n\n#pragma omp parallel for schedule(guided)\n    for (int i = from(); i < to(); ++i)\n    {\n#pragma omp task\n        {\n            auto r = sample(i, other);\n\n            MatrixNNd cov = (r * r.transpose());\n            prods.local() += cov;\n            sums.local() += r;\n            norms.local() += r.squaredNorm();\n            send_item(i);\n        }\n    }\n#pragma omp taskwait\n\n    VectorNd sum = sums.combine();\n    MatrixNNd prod = prods.combine();   \n    double norm = norms.combine();\n\n    const int N = num();\n    local_sum() = sum;\n    local_cov() = (prod - (sum * sum.transpose() \/ N)) \/ (N-1);\n    local_norm() = norm;\n}\n\nvoid Sys::register_time(int i, double t)\n{\n    if (measure_perf) sample_time.at(i) += t;\n}<|endoftext|>"}
{"text":"<commit_before>\/* Okay, so this is highly objectionable, but it saves a huge amount of work.\n * Provide appropriate #defineitions for PARTITION_*, #include this and voila,\n * an enum with indices, an array for name lookup, and mappings between indices\n * and bitboards.\n *\/\n#if !defined(PARTITION_NAMESPACE) || !defined(PARTITION_CARDINALITY) || !defined(PARTITION_KEYWORDS) || !defined(PARTITION_BITBOARD)\n#error \"not all template variables defined\"\n#endif\n\n  const size_t cardinality = PARTITION_CARDINALITY;\n\n#define _(key) key,\n  enum Index {\n    PARTITION_KEYWORDS\n  };\n  const std::array<Index, cardinality> indices = {\n    PARTITION_KEYWORDS\n  };\n#undef _\n\n#define _(key) #key,\n  const std::array<std::string, cardinality> keywords = {\n    PARTITION_KEYWORDS\n  };\n#undef _\n\n#define _(key) { #key, key },\n  const std::map<std::string, Index> _by_keyword = {\n    PARTITION_KEYWORDS\n  };\n#undef _\n\n  inline Index by_keyword(std::string keyword) {\n    return _by_keyword.at(keyword);\n  }\n\n  inline Bitboard bitboard(Index i) {\n    static auto bitboards = [](){\n      std::array<Bitboard, cardinality> bitboards;\n      for (Index i: indices)\n        bitboards[i] = PARTITION_BITBOARD(i);\n      return bitboards;\n    }();\n    return bitboards[i];\n  }\n\n  namespace bitboards {\n#define _(key) const Bitboard key = bitboard(PARTITION_NAMESPACE::key);\n      PARTITION_KEYWORDS\n#undef _\n  }\n\n#undef PARTITION_CARDINALITY\n#undef PARTITION_KEYWORDS\n#undef PARTITION_BITBOARD\n<commit_msg>these were intended to be inlined<commit_after>\/* Okay, so this is highly objectionable, but it saves a huge amount of work.\n * Provide appropriate #defineitions for PARTITION_*, #include this and voila,\n * an enum with indices, an array for name lookup, and mappings between indices\n * and bitboards.\n *\/\n#if !defined(PARTITION_NAMESPACE) || !defined(PARTITION_CARDINALITY) || !defined(PARTITION_KEYWORDS) || !defined(PARTITION_BITBOARD)\n#error \"not all template variables defined\"\n#endif\n\n  const size_t cardinality = PARTITION_CARDINALITY;\n\n#define _(key) key,\n  enum Index {\n    PARTITION_KEYWORDS\n  };\n  const std::array<Index, cardinality> indices = {\n    PARTITION_KEYWORDS\n  };\n#undef _\n\n#define _(key) #key,\n  const std::array<std::string, cardinality> keywords = {\n    PARTITION_KEYWORDS\n  };\n#undef _\n\n#define _(key) { #key, key },\n  const std::map<std::string, Index> _by_keyword = {\n    PARTITION_KEYWORDS\n  };\n#undef _\n\n  inline Index by_keyword(std::string keyword) {\n    return _by_keyword.at(keyword);\n  }\n\n  __attribute__((always_inline))\n  inline Bitboard bitboard(Index i) {\n    static auto bitboards = [](){\n      std::array<Bitboard, cardinality> bitboards;\n      for (Index i: indices)\n        bitboards[i] = PARTITION_BITBOARD(i);\n      return bitboards;\n    }();\n    return bitboards[i];\n  }\n\n  namespace bitboards {\n#define _(key) const Bitboard key = bitboard(PARTITION_NAMESPACE::key);\n      PARTITION_KEYWORDS\n#undef _\n  }\n\n#undef PARTITION_CARDINALITY\n#undef PARTITION_KEYWORDS\n#undef PARTITION_BITBOARD\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2017-present Facebook, Inc.\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,\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 <iostream>\n#include <signal.h>\n\n#include <folly\/Random.h>\n#include <folly\/String.h>\n\n#include <thrift\/perf\/cpp\/AsyncLoadHandler2.h>\n#include <thrift\/lib\/cpp2\/server\/ThriftServer.h>\n#include <thrift\/lib\/cpp\/transport\/TSSLSocket.h>\n\n#include \"common\/init\/Init.h\"\n#include \"common\/services\/cpp\/ServiceFramework.h\"\n\nusing std::cout;\nusing namespace boost;\nusing namespace apache::thrift::async;\nusing namespace apache::thrift;\nusing namespace apache::thrift::protocol;\nusing namespace apache::thrift::transport;\nusing namespace apache::thrift::concurrency;\n\nDEFINE_bool(enable_service_framework, false,\n            \"Run ServiceFramework to track service stats\");\nDEFINE_int32(port, 1234, \"server port\");\nDEFINE_int64(num_threads, 4, \"number of worker threads\");\nDEFINE_int64(num_queue_threads, 4, \"number of task queue threads\");\nDEFINE_int32(max_conn_pool_size, 0, \"maximum size of idle connection pool\");\nDEFINE_int32(idle_timeout, 0, \"idle timeout (in milliseconds)\");\nDEFINE_int32(task_timeout, 0, \"task timeout (in milliseconds)\");\nDEFINE_int32(max_connections, 0, \"max active connections\");\nDEFINE_int32(max_requests, 0, \"max active requests\");\nDEFINE_string(cert, \"\", \"server SSL certificate file\");\nDEFINE_string(key, \"\", \"server SSL private key file\");\nDEFINE_string(client_ca_list, \"\", \"file pointing to a client CA or list\");\nDEFINE_string(ticket_seeds, \"\", \"server Ticket seeds file\");\nDEFINE_bool(queue_sends, true, \"Queue sends for better throughput\");\nDEFINE_string(ecc_curve, \"prime256v1\",\n    \"The ECC curve to use for EC handshakes\");\nDEFINE_bool(enable_tfo, true, \"Enable TFO\");\nDEFINE_int32(tfo_queue_size, 1000, \"TFO queue size\");\n\nvoid setTunables(ThriftServer* server) {\n  if (FLAGS_idle_timeout > 0) {\n    server->setIdleTimeout(std::chrono::milliseconds(FLAGS_idle_timeout));\n  }\n  if (FLAGS_task_timeout > 0) {\n    server->setTaskExpireTime(std::chrono::milliseconds(FLAGS_task_timeout));\n  }\n}\n\nThriftServer *g_server = nullptr;\n\nvoid sigHandler(int \/* signo *\/) {\n  g_server->stop();\n  exit(0);\n}\n\nint main(int argc, char* argv[]) {\n  facebook::initFacebook(&argc, &argv);\n\n  if (argc != 1) {\n    fprintf(stderr, \"error: unhandled arguments:\");\n    for (int n = 1; n < argc; ++n) {\n      fprintf(stderr, \" %s\", argv[n]);\n    }\n    fprintf(stderr, \"\\n\");\n    return 1;\n  }\n\n  auto handler = std::make_shared<AsyncLoadHandler2>();\n\n  folly::SSLContext::setSSLLockTypes({\n    {CRYPTO_LOCK_EVP_PKEY, SSLContext::LOCK_NONE},\n    {CRYPTO_LOCK_SSL_SESSION, SSLContext::LOCK_SPINLOCK},\n    {CRYPTO_LOCK_SSL_CTX, SSLContext::LOCK_NONE},\n    {CRYPTO_LOCK_ERR, SSLContext::LOCK_SPINLOCK}});\n\n  std::shared_ptr<ThriftServer> server;\n  server.reset(new ThriftServer());\n  server->setInterface(handler);\n  server->setPort(FLAGS_port);\n  server->setNumIOWorkerThreads(FLAGS_num_threads);\n  server->setNumCPUWorkerThreads(FLAGS_num_queue_threads);\n  server->setMaxConnections(FLAGS_max_connections);\n  server->setMaxRequests(FLAGS_max_requests);\n  server->setQueueSends(FLAGS_queue_sends);\n  server->setFastOpenOptions(FLAGS_enable_tfo, FLAGS_tfo_queue_size);\n\n  if (FLAGS_cert.length() > 0 && FLAGS_key.length() > 0) {\n    auto sslContext = std::make_shared<wangle::SSLContextConfig>();\n    sslContext->setCertificate(FLAGS_cert, FLAGS_key, \"\");\n    sslContext->clientCAFile = FLAGS_client_ca_list;\n    sslContext->eccCurveName = FLAGS_ecc_curve;\n    server->setSSLConfig(sslContext);\n    server->watchCertForChanges(FLAGS_cert);\n  }\n  if (!FLAGS_ticket_seeds.empty()) {\n    server->watchTicketPathForChanges(FLAGS_ticket_seeds, true);\n  } else {\n    \/\/ Generate random seeds to use for all workers.  If no seeds are set, then\n    \/\/ each worker gets its own random seeds, so session resumptions fail across\n    \/\/ workers.\n    wangle::TLSTicketKeySeeds seeds;\n    for (auto* seed : {&seeds.oldSeeds, &seeds.currentSeeds, &seeds.newSeeds}) {\n      auto randomData = folly::Random::secureRandom<uint64_t>();\n      auto asHex = folly::hexlify(\n        folly::ByteRange((const unsigned char*) &randomData, sizeof(uint64_t)));\n      seed->push_back(std::move(asHex));\n    }\n    server->setTicketSeeds(std::move(seeds));\n  }\n\n  \/\/ Set tunable server parameters\n  setTunables(server.get());\n\n  g_server = server.get();\n  signal(SIGINT, sigHandler);\n\n  cout << \"Serving requests on port \" << FLAGS_port << \"...\\n\";\n  \/\/ Optionally run under ServiceFramework to enable testing stats handlers\n  \/\/ Once ServiceFramework is running, it will hook any new thrift services that\n  \/\/ get created, and attach a collect\/report their fb303 stats.\n  std::unique_ptr<facebook::services::ServiceFramework> fwk;\n  if (FLAGS_enable_service_framework) {\n    fwk.reset(\n        new facebook::services::ServiceFramework(\"ThriftServer Load Tester\"));\n    fwk->addThriftService(server, handler.get(), FLAGS_port);\n    fwk->go();\n  } else {\n    server->serve();\n  }\n\n  cout << \"Exiting normally\" << std::endl;\n  fwk->stop();\n\n  return 0;\n}\n<commit_msg>More OpenSSL 1.1.0 compatibility fixes<commit_after>\/*\n * Copyright 2017-present Facebook, Inc.\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,\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 <iostream>\n#include <signal.h>\n\n#include <folly\/Random.h>\n#include <folly\/String.h>\n\n#include <thrift\/perf\/cpp\/AsyncLoadHandler2.h>\n#include <thrift\/lib\/cpp2\/server\/ThriftServer.h>\n#include <thrift\/lib\/cpp\/transport\/TSSLSocket.h>\n\n#include \"common\/init\/Init.h\"\n#include \"common\/services\/cpp\/ServiceFramework.h\"\n\nusing std::cout;\nusing namespace boost;\nusing namespace apache::thrift::async;\nusing namespace apache::thrift;\nusing namespace apache::thrift::protocol;\nusing namespace apache::thrift::transport;\nusing namespace apache::thrift::concurrency;\n\nDEFINE_bool(enable_service_framework, false,\n            \"Run ServiceFramework to track service stats\");\nDEFINE_int32(port, 1234, \"server port\");\nDEFINE_int64(num_threads, 4, \"number of worker threads\");\nDEFINE_int64(num_queue_threads, 4, \"number of task queue threads\");\nDEFINE_int32(max_conn_pool_size, 0, \"maximum size of idle connection pool\");\nDEFINE_int32(idle_timeout, 0, \"idle timeout (in milliseconds)\");\nDEFINE_int32(task_timeout, 0, \"task timeout (in milliseconds)\");\nDEFINE_int32(max_connections, 0, \"max active connections\");\nDEFINE_int32(max_requests, 0, \"max active requests\");\nDEFINE_string(cert, \"\", \"server SSL certificate file\");\nDEFINE_string(key, \"\", \"server SSL private key file\");\nDEFINE_string(client_ca_list, \"\", \"file pointing to a client CA or list\");\nDEFINE_string(ticket_seeds, \"\", \"server Ticket seeds file\");\nDEFINE_bool(queue_sends, true, \"Queue sends for better throughput\");\nDEFINE_string(ecc_curve, \"prime256v1\",\n    \"The ECC curve to use for EC handshakes\");\nDEFINE_bool(enable_tfo, true, \"Enable TFO\");\nDEFINE_int32(tfo_queue_size, 1000, \"TFO queue size\");\n\nvoid setTunables(ThriftServer* server) {\n  if (FLAGS_idle_timeout > 0) {\n    server->setIdleTimeout(std::chrono::milliseconds(FLAGS_idle_timeout));\n  }\n  if (FLAGS_task_timeout > 0) {\n    server->setTaskExpireTime(std::chrono::milliseconds(FLAGS_task_timeout));\n  }\n}\n\nThriftServer *g_server = nullptr;\n\nvoid sigHandler(int \/* signo *\/) {\n  g_server->stop();\n  exit(0);\n}\n\nint main(int argc, char* argv[]) {\n  facebook::initFacebook(&argc, &argv);\n\n  if (argc != 1) {\n    fprintf(stderr, \"error: unhandled arguments:\");\n    for (int n = 1; n < argc; ++n) {\n      fprintf(stderr, \" %s\", argv[n]);\n    }\n    fprintf(stderr, \"\\n\");\n    return 1;\n  }\n\n  auto handler = std::make_shared<AsyncLoadHandler2>();\n\n  folly::SSLContext::setSSLLockTypes({\n#ifdef CRYPTO_LOCK_EVP_PKEY\n      {CRYPTO_LOCK_EVP_PKEY, SSLContext::LOCK_NONE},\n#endif\n#ifdef CRYPTO_LOCK_SSL_SESSION\n      {CRYPTO_LOCK_SSL_SESSION, SSLContext::LOCK_SPINLOCK},\n#endif\n#ifdef CRYPTO_LOCK_SSL_CTX\n      {CRYPTO_LOCK_SSL_CTX, SSLContext::LOCK_NONE},\n#endif\n#ifdef CRYPTO_LOCK_ERR\n      {CRYPTO_LOCK_ERR, SSLContext::LOCK_SPINLOCK}\n#endif\n  });\n\n  std::shared_ptr<ThriftServer> server;\n  server.reset(new ThriftServer());\n  server->setInterface(handler);\n  server->setPort(FLAGS_port);\n  server->setNumIOWorkerThreads(FLAGS_num_threads);\n  server->setNumCPUWorkerThreads(FLAGS_num_queue_threads);\n  server->setMaxConnections(FLAGS_max_connections);\n  server->setMaxRequests(FLAGS_max_requests);\n  server->setQueueSends(FLAGS_queue_sends);\n  server->setFastOpenOptions(FLAGS_enable_tfo, FLAGS_tfo_queue_size);\n\n  if (FLAGS_cert.length() > 0 && FLAGS_key.length() > 0) {\n    auto sslContext = std::make_shared<wangle::SSLContextConfig>();\n    sslContext->setCertificate(FLAGS_cert, FLAGS_key, \"\");\n    sslContext->clientCAFile = FLAGS_client_ca_list;\n    sslContext->eccCurveName = FLAGS_ecc_curve;\n    server->setSSLConfig(sslContext);\n    server->watchCertForChanges(FLAGS_cert);\n  }\n  if (!FLAGS_ticket_seeds.empty()) {\n    server->watchTicketPathForChanges(FLAGS_ticket_seeds, true);\n  } else {\n    \/\/ Generate random seeds to use for all workers.  If no seeds are set, then\n    \/\/ each worker gets its own random seeds, so session resumptions fail across\n    \/\/ workers.\n    wangle::TLSTicketKeySeeds seeds;\n    for (auto* seed : {&seeds.oldSeeds, &seeds.currentSeeds, &seeds.newSeeds}) {\n      auto randomData = folly::Random::secureRandom<uint64_t>();\n      auto asHex = folly::hexlify(\n        folly::ByteRange((const unsigned char*) &randomData, sizeof(uint64_t)));\n      seed->push_back(std::move(asHex));\n    }\n    server->setTicketSeeds(std::move(seeds));\n  }\n\n  \/\/ Set tunable server parameters\n  setTunables(server.get());\n\n  g_server = server.get();\n  signal(SIGINT, sigHandler);\n\n  cout << \"Serving requests on port \" << FLAGS_port << \"...\\n\";\n  \/\/ Optionally run under ServiceFramework to enable testing stats handlers\n  \/\/ Once ServiceFramework is running, it will hook any new thrift services that\n  \/\/ get created, and attach a collect\/report their fb303 stats.\n  std::unique_ptr<facebook::services::ServiceFramework> fwk;\n  if (FLAGS_enable_service_framework) {\n    fwk.reset(\n        new facebook::services::ServiceFramework(\"ThriftServer Load Tester\"));\n    fwk->addThriftService(server, handler.get(), FLAGS_port);\n    fwk->go();\n  } else {\n    server->serve();\n  }\n\n  cout << \"Exiting normally\" << std::endl;\n  fwk->stop();\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * strings.cpp\n *\n *  Created on: Jan 27, 2011\n *      Author: Craig Rasmussen\n *\/\n\n#include <stdlib.h>\n\n#include \"StringImage.hpp\"\n#include <src\/columns\/HyPerCol.hpp>\n#include <src\/layers\/LIF.hpp>\n#include <src\/connections\/HyPerConn.hpp>\n\nusing namespace PV;\n\nint main(int argc, char* argv[])\n{\n   \/\/ create the managing hypercolumn\n   HyPerCol * hc = new HyPerCol(\"column\", argc, argv);\n\n   \/\/ create the layers\n   HyPerLayer * strings = new StringImage(\"Strings\", hc);\n   HyPerLayer * complex = new LIF(\"Complex\", hc);\n\n   \/\/ connect the layers\n   new HyPerConn(\"Strings to Complex\", hc, strings, complex, CHANNEL_EXC);\n\n   \/\/ run the simulation\n   hc->initFinish();\n   hc->run();\n\n   \/* clean up (HyPerCol owns layers and connections, don't delete them) *\/\n   delete hc;\n\n   return 0;\n}\n<commit_msg>Added probes and changed naming convention for layers.<commit_after>\/*\n * strings.cpp\n *\n *  Created on: Jan 27, 2011\n *      Author: Craig Rasmussen\n *\/\n\n#include <stdlib.h>\n\n#include \"StringImage.hpp\"\n#include <src\/columns\/HyPerCol.hpp>\n#include <src\/layers\/LIF.hpp>\n#include <src\/connections\/HyPerConn.hpp>\n#include <src\/io\/PointProbe.hpp>\n#include <src\/io\/PointLIFProbe.hpp>\n#include <src\/io\/PointJunkProbe.hpp>\n#include <src\/io\/StatsProbe.hpp>\n#include <src\/io\/PostConnProbe.hpp>\n\nusing namespace PV;\n\nint main(int argc, char* argv[])\n{\n   \/\/ create the managing hypercolumn\n   HyPerCol * hc = new HyPerCol(\"column\", argc, argv);\n\n   \/\/ create the layers\n   HyPerLayer * S1  = new StringImage(\"S1\", hc);\n   HyPerLayer * C1  = new LIF(\"C1\", hc);\n   HyPerLayer * C1i = new LIF(\"C1i\", hc);\n\n   \/\/ connect the layers\n   HyPerConn * S1_to_C1  = new HyPerConn(\"S1 to C1\",  hc, S1, C1,  CHANNEL_EXC);\n   HyPerConn * C1_to_C1i = new HyPerConn(\"C1 to C1i\", hc, C1, C1i, CHANNEL_EXC);\n   HyPerConn * C1i_to_C1 = new HyPerConn(\"C1i to C1\", hc, C1i, C1, CHANNEL_EXC);\n\n   \/\/ probes\n   \/\/\n   const PVLayerLoc * loc = C1->getLayerLoc();\n   int x = (loc->nx + 2*loc->nb) \/ 2;\n   LayerProbe * lifProbe = new PointLIFProbe(x, 0, 0, \"complex\");\n   PostConnProbe * cProbe = new PostConnProbe(x, 0, 0);\n   cProbe->setOutputIndices(false);\n\n   \/\/C1->insertProbe(lifProbe);\n   \/\/S1_to_C1->insertProbe(cProbe);\n\n   \/\/ run the simulation\n   hc->initFinish();\n   hc->run();\n\n   \/* clean up (HyPerCol owns layers and connections, don't delete them) *\/\n   delete hc;\n\n   return 0;\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\/\/ This is heavily inspired by the signal handler from google-glog\n\n#include <folly\/experimental\/symbolizer\/SignalHandler.h>\n\n#include <signal.h>\n#include <sys\/types.h>\n\n#include <algorithm>\n#include <atomic>\n#include <cerrno>\n#include <ctime>\n#include <mutex>\n#include <vector>\n\n#include <glog\/logging.h>\n\n#include <folly\/Conv.h>\n#include <folly\/ScopeGuard.h>\n#include <folly\/experimental\/symbolizer\/ElfCache.h>\n#include <folly\/experimental\/symbolizer\/Symbolizer.h>\n#include <folly\/portability\/SysSyscall.h>\n#include <folly\/portability\/Unistd.h>\n\nnamespace folly {\nnamespace symbolizer {\n\nnamespace {\n\n\/**\n * Fatal signal handler registry.\n *\/\nclass FatalSignalCallbackRegistry {\n public:\n  FatalSignalCallbackRegistry();\n\n  void add(SignalCallback func);\n  void markInstalled();\n  void run();\n\n private:\n  std::atomic<bool> installed_;\n  std::mutex mutex_;\n  std::vector<SignalCallback> handlers_;\n};\n\nFatalSignalCallbackRegistry::FatalSignalCallbackRegistry()\n    : installed_(false) {}\n\nvoid FatalSignalCallbackRegistry::add(SignalCallback func) {\n  std::lock_guard<std::mutex> lock(mutex_);\n  CHECK(!installed_) << \"FatalSignalCallbackRegistry::add may not be used \"\n                        \"after installing the signal handlers.\";\n  handlers_.push_back(func);\n}\n\nvoid FatalSignalCallbackRegistry::markInstalled() {\n  std::lock_guard<std::mutex> lock(mutex_);\n  CHECK(!installed_.exchange(true))\n      << \"FatalSignalCallbackRegistry::markInstalled must be called \"\n      << \"at most once\";\n}\n\nvoid FatalSignalCallbackRegistry::run() {\n  if (!installed_) {\n    return;\n  }\n\n  for (auto& fn : handlers_) {\n    fn();\n  }\n}\n\n\/\/ Leak it so we don't have to worry about destruction order\nFatalSignalCallbackRegistry* gFatalSignalCallbackRegistry =\n    new FatalSignalCallbackRegistry;\n\nstruct {\n  int number;\n  const char* name;\n  struct sigaction oldAction;\n} kFatalSignals[] = {\n    {SIGSEGV, \"SIGSEGV\", {}},\n    {SIGILL, \"SIGILL\", {}},\n    {SIGFPE, \"SIGFPE\", {}},\n    {SIGABRT, \"SIGABRT\", {}},\n    {SIGBUS, \"SIGBUS\", {}},\n    {SIGTERM, \"SIGTERM\", {}},\n    {SIGQUIT, \"SIGQUIT\", {}},\n    {0, nullptr, {}},\n};\n\nvoid callPreviousSignalHandler(int signum) {\n  \/\/ Restore disposition to old disposition, then kill ourselves with the same\n  \/\/ signal. The signal will be blocked until we return from our handler,\n  \/\/ then it will invoke the default handler and abort.\n  for (auto p = kFatalSignals; p->name; ++p) {\n    if (p->number == signum) {\n      sigaction(signum, &p->oldAction, nullptr);\n      raise(signum);\n      return;\n    }\n  }\n\n  \/\/ Not one of the signals we know about. Oh well. Reset to default.\n  struct sigaction sa;\n  memset(&sa, 0, sizeof(sa));\n  sa.sa_handler = SIG_DFL;\n  sigaction(signum, &sa, nullptr);\n  raise(signum);\n}\n\n\/\/ Note: not thread-safe, but that's okay, as we only let one thread\n\/\/ in our signal handler at a time.\n\/\/\n\/\/ Leak it so we don't have to worry about destruction order\n\/\/\n\/\/ Initialized by installFatalSignalHandler\nSafeStackTracePrinter* gStackTracePrinter;\n\nvoid printDec(uint64_t val) {\n  char buf[20];\n  uint32_t n = uint64ToBufferUnsafe(val, buf);\n  gStackTracePrinter->print(StringPiece(buf, n));\n}\n\nconst char kHexChars[] = \"0123456789abcdef\";\nvoid printHex(uint64_t val) {\n  \/\/ TODO(tudorb): Add this to folly\/Conv.h\n  char buf[2 + 2 * sizeof(uint64_t)]; \/\/ \"0x\" prefix, 2 digits for each byte\n\n  char* end = buf + sizeof(buf);\n  char* p = end;\n  do {\n    *--p = kHexChars[val & 0x0f];\n    val >>= 4;\n  } while (val != 0);\n  *--p = 'x';\n  *--p = '0';\n\n  gStackTracePrinter->print(StringPiece(p, end));\n}\n\nvoid print(StringPiece sp) {\n  gStackTracePrinter->print(sp);\n}\n\nvoid flush() {\n  gStackTracePrinter->flush();\n}\n\nvoid dumpTimeInfo() {\n  SCOPE_EXIT {\n    flush();\n  };\n  time_t now = time(nullptr);\n  print(\"*** Aborted at \");\n  printDec(now);\n  print(\" (Unix time, try 'date -d @\");\n  printDec(now);\n  print(\"') ***\\n\");\n}\n\nconst char* sigill_reason(int si_code) {\n  switch (si_code) {\n    case ILL_ILLOPC:\n      return \"illegal opcode\";\n    case ILL_ILLOPN:\n      return \"illegal operand\";\n    case ILL_ILLADR:\n      return \"illegal addressing mode\";\n    case ILL_ILLTRP:\n      return \"illegal trap\";\n    case ILL_PRVOPC:\n      return \"privileged opcode\";\n    case ILL_PRVREG:\n      return \"privileged register\";\n    case ILL_COPROC:\n      return \"coprocessor error\";\n    case ILL_BADSTK:\n      return \"internal stack error\";\n\n    default:\n      return nullptr;\n  }\n}\n\nconst char* sigfpe_reason(int si_code) {\n  switch (si_code) {\n    case FPE_INTDIV:\n      return \"integer divide by zero\";\n    case FPE_INTOVF:\n      return \"integer overflow\";\n    case FPE_FLTDIV:\n      return \"floating-point divide by zero\";\n    case FPE_FLTOVF:\n      return \"floating-point overflow\";\n    case FPE_FLTUND:\n      return \"floating-point underflow\";\n    case FPE_FLTRES:\n      return \"floating-point inexact result\";\n    case FPE_FLTINV:\n      return \"floating-point invalid operation\";\n    case FPE_FLTSUB:\n      return \"subscript out of range\";\n\n    default:\n      return nullptr;\n  }\n}\n\nconst char* sigsegv_reason(int si_code) {\n  switch (si_code) {\n    case SEGV_MAPERR:\n      return \"address not mapped to object\";\n    case SEGV_ACCERR:\n      return \"invalid permissions for mapped object\";\n\n    default:\n      return nullptr;\n  }\n}\n\nconst char* sigbus_reason(int si_code) {\n  switch (si_code) {\n    case BUS_ADRALN:\n      return \"invalid address alignment\";\n    case BUS_ADRERR:\n      return \"nonexistent physical address\";\n    case BUS_OBJERR:\n      return \"object-specific hardware error\";\n\n      \/\/ MCEERR_AR and MCEERR_AO: in sigaction(2) but not in headers.\n\n    default:\n      return nullptr;\n  }\n}\n\nconst char* sigtrap_reason(int si_code) {\n  switch (si_code) {\n    case TRAP_BRKPT:\n      return \"process breakpoint\";\n    case TRAP_TRACE:\n      return \"process trace trap\";\n\n      \/\/ TRAP_BRANCH and TRAP_HWBKPT: in sigaction(2) but not in headers.\n\n    default:\n      return nullptr;\n  }\n}\n\nconst char* sigchld_reason(int si_code) {\n  switch (si_code) {\n    case CLD_EXITED:\n      return \"child has exited\";\n    case CLD_KILLED:\n      return \"child was killed\";\n    case CLD_DUMPED:\n      return \"child terminated abnormally\";\n    case CLD_TRAPPED:\n      return \"traced child has trapped\";\n    case CLD_STOPPED:\n      return \"child has stopped\";\n    case CLD_CONTINUED:\n      return \"stopped child has continued\";\n\n    default:\n      return nullptr;\n  }\n}\n\nconst char* sigio_reason(int si_code) {\n  switch (si_code) {\n    case POLL_IN:\n      return \"data input available\";\n    case POLL_OUT:\n      return \"output buffers available\";\n    case POLL_MSG:\n      return \"input message available\";\n    case POLL_ERR:\n      return \"I\/O error\";\n    case POLL_PRI:\n      return \"high priority input available\";\n    case POLL_HUP:\n      return \"device disconnected\";\n\n    default:\n      return nullptr;\n  }\n}\n\nconst char* signal_reason(int signum, int si_code) {\n  switch (signum) {\n    case SIGILL:\n      return sigill_reason(si_code);\n    case SIGFPE:\n      return sigfpe_reason(si_code);\n    case SIGSEGV:\n      return sigsegv_reason(si_code);\n    case SIGBUS:\n      return sigbus_reason(si_code);\n    case SIGTRAP:\n      return sigtrap_reason(si_code);\n    case SIGCHLD:\n      return sigchld_reason(si_code);\n    case SIGIO:\n      return sigio_reason(si_code); \/\/ aka SIGPOLL\n\n    default:\n      return nullptr;\n  }\n}\n\nvoid dumpSignalInfo(int signum, siginfo_t* siginfo) {\n  SCOPE_EXIT {\n    flush();\n  };\n  \/\/ Get the signal name, if possible.\n  const char* name = nullptr;\n  for (auto p = kFatalSignals; p->name; ++p) {\n    if (p->number == signum) {\n      name = p->name;\n      break;\n    }\n  }\n\n  print(\"*** Signal \");\n  printDec(signum);\n  if (name) {\n    print(\" (\");\n    print(name);\n    print(\")\");\n  }\n\n  print(\" (\");\n  printHex(reinterpret_cast<uint64_t>(siginfo->si_addr));\n  print(\") received by PID \");\n  printDec(getpid());\n  print(\" (pthread TID \");\n  printHex((uint64_t)pthread_self());\n  print(\") (linux TID \");\n  printDec(syscall(__NR_gettid));\n\n  \/\/ Kernel-sourced signals don't give us useful info for pid\/uid.\n  if (siginfo->si_code != SI_KERNEL) {\n    print(\") (maybe from PID \");\n    printDec(siginfo->si_pid);\n    print(\", UID \");\n    printDec(siginfo->si_uid);\n  }\n\n  auto reason = signal_reason(signum, siginfo->si_code);\n\n  if (reason != nullptr) {\n    print(\") (code: \");\n    print(reason);\n  }\n\n  print(\"), stack trace: ***\\n\");\n}\n\n\/\/ On Linux, pthread_t is a pointer, so 0 is an invalid value, which we\n\/\/ take to indicate \"no thread in the signal handler\".\n\/\/\n\/\/ POSIX defines PTHREAD_NULL for this purpose, but that's not available.\nconstexpr pthread_t kInvalidThreadId = 0;\n\nstd::atomic<pthread_t> gSignalThread(kInvalidThreadId);\nstd::atomic<bool> gInRecursiveSignalHandler(false);\n\n\/\/ Here be dragons.\nvoid innerSignalHandler(int signum, siginfo_t* info, void* \/* uctx *\/) {\n  \/\/ First, let's only let one thread in here at a time.\n  pthread_t myId = pthread_self();\n\n  pthread_t prevSignalThread = kInvalidThreadId;\n  while (!gSignalThread.compare_exchange_strong(prevSignalThread, myId)) {\n    if (pthread_equal(prevSignalThread, myId)) {\n      \/\/ First time here. Try to dump the stack trace without symbolization.\n      \/\/ If we still fail, well, we're mightily screwed, so we do nothing the\n      \/\/ next time around.\n      if (!gInRecursiveSignalHandler.exchange(true)) {\n        print(\"Entered fatal signal handler recursively. We're in trouble.\\n\");\n        gStackTracePrinter->printStackTrace(false); \/\/ no symbolization\n      }\n      return;\n    }\n\n    \/\/ Wait a while, try again.\n    timespec ts;\n    ts.tv_sec = 0;\n    ts.tv_nsec = 100L * 1000 * 1000; \/\/ 100ms\n    nanosleep(&ts, nullptr);\n\n    prevSignalThread = kInvalidThreadId;\n  }\n\n  dumpTimeInfo();\n  dumpSignalInfo(signum, info);\n  gStackTracePrinter->printStackTrace(true); \/\/ with symbolization\n\n  \/\/ Run user callbacks\n  gFatalSignalCallbackRegistry->run();\n}\n\nvoid signalHandler(int signum, siginfo_t* info, void* uctx) {\n  int savedErrno = errno;\n  SCOPE_EXIT {\n    flush();\n    errno = savedErrno;\n  };\n  innerSignalHandler(signum, info, uctx);\n\n  gSignalThread = kInvalidThreadId;\n  \/\/ Kill ourselves with the previous handler.\n  callPreviousSignalHandler(signum);\n}\n\n} \/\/ namespace\n\nvoid addFatalSignalCallback(SignalCallback cb) {\n  gFatalSignalCallbackRegistry->add(cb);\n}\n\nvoid installFatalSignalCallbacks() {\n  gFatalSignalCallbackRegistry->markInstalled();\n}\n\nnamespace {\n\nstd::atomic<bool> gAlreadyInstalled;\n\n\/\/ Small sigaltstack size threshold.\n\/\/ 8931 is known to cause the signal handler to stack overflow during\n\/\/ symbolization even for a simple one-liner \"kill(getpid(), SIGTERM)\".\nconst size_t kSmallSigAltStackSize = 8931;\n\nbool isSmallSigAltStackEnabled() {\n  stack_t ss;\n  if (sigaltstack(nullptr, &ss) != 0) {\n    return false;\n  }\n  if ((ss.ss_flags & SS_DISABLE) != 0) {\n    return false;\n  }\n  return ss.ss_size <= kSmallSigAltStackSize;\n}\n\n} \/\/ namespace\n\nvoid installFatalSignalHandler() {\n  if (gAlreadyInstalled.exchange(true)) {\n    \/\/ Already done.\n    return;\n  }\n\n  \/\/ If a small sigaltstack is enabled (ex. Rust stdlib might use sigaltstack\n  \/\/ to set a small stack), the default SafeStackTracePrinter would likely\n  \/\/ stack overflow. Replace it with the unsafe self-allocate printer.\n  bool useUnsafePrinter = isSmallSigAltStackEnabled();\n  if (useUnsafePrinter) {\n    gStackTracePrinter = new UnsafeSelfAllocateStackTracePrinter();\n  } else {\n    gStackTracePrinter = new SafeStackTracePrinter();\n  }\n\n  struct sigaction sa;\n  memset(&sa, 0, sizeof(sa));\n  if (useUnsafePrinter) {\n    \/\/ The signal handler is not async-signal-safe. Block all signals to\n    \/\/ make it safer. But it's still unsafe.\n    sigfillset(&sa.sa_mask);\n  } else {\n    sigemptyset(&sa.sa_mask);\n  }\n  \/\/ By default signal handlers are run on the signaled thread's stack.\n  \/\/ In case of stack overflow running the SIGSEGV signal handler on\n  \/\/ the same stack leads to another SIGSEGV and crashes the program.\n  \/\/ Use SA_ONSTACK, so alternate stack is used (only if configured via\n  \/\/ sigaltstack).\n  \/\/ Golang also requires SA_ONSTACK. See:\n  \/\/ https:\/\/golang.org\/pkg\/os\/signal\/#hdr-Go_programs_that_use_cgo_or_SWIG\n  sa.sa_flags |= SA_SIGINFO | SA_ONSTACK;\n  sa.sa_sigaction = &signalHandler;\n\n  for (auto p = kFatalSignals; p->name; ++p) {\n    CHECK_ERR(sigaction(p->number, &sa, &p->oldAction));\n  }\n}\n} \/\/ namespace symbolizer\n} \/\/ namespace folly\n<commit_msg>Fix gFatalSignalCallbackRegistry SIOF issue<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\/\/ This is heavily inspired by the signal handler from google-glog\n\n#include <folly\/experimental\/symbolizer\/SignalHandler.h>\n\n#include <signal.h>\n#include <sys\/types.h>\n\n#include <algorithm>\n#include <atomic>\n#include <cerrno>\n#include <ctime>\n#include <mutex>\n#include <vector>\n\n#include <glog\/logging.h>\n\n#include <folly\/Conv.h>\n#include <folly\/ScopeGuard.h>\n#include <folly\/experimental\/symbolizer\/ElfCache.h>\n#include <folly\/experimental\/symbolizer\/Symbolizer.h>\n#include <folly\/portability\/SysSyscall.h>\n#include <folly\/portability\/Unistd.h>\n\nnamespace folly {\nnamespace symbolizer {\n\nnamespace {\n\n\/**\n * Fatal signal handler registry.\n *\/\nclass FatalSignalCallbackRegistry {\n public:\n  FatalSignalCallbackRegistry();\n\n  void add(SignalCallback func);\n  void markInstalled();\n  void run();\n\n private:\n  std::atomic<bool> installed_;\n  std::mutex mutex_;\n  std::vector<SignalCallback> handlers_;\n};\n\nFatalSignalCallbackRegistry::FatalSignalCallbackRegistry()\n    : installed_(false) {}\n\nvoid FatalSignalCallbackRegistry::add(SignalCallback func) {\n  std::lock_guard<std::mutex> lock(mutex_);\n  CHECK(!installed_) << \"FatalSignalCallbackRegistry::add may not be used \"\n                        \"after installing the signal handlers.\";\n  handlers_.push_back(func);\n}\n\nvoid FatalSignalCallbackRegistry::markInstalled() {\n  std::lock_guard<std::mutex> lock(mutex_);\n  CHECK(!installed_.exchange(true))\n      << \"FatalSignalCallbackRegistry::markInstalled must be called \"\n      << \"at most once\";\n}\n\nvoid FatalSignalCallbackRegistry::run() {\n  if (!installed_) {\n    return;\n  }\n\n  for (auto& fn : handlers_) {\n    fn();\n  }\n}\n\nstatic FatalSignalCallbackRegistry* getFatalSignalCallbackRegistry() {\n  \/\/ Leak it so we don't have to worry about destruction order\n  static FatalSignalCallbackRegistry* gFatalSignalCallbackRegistry =\n      new FatalSignalCallbackRegistry();\n\n  return gFatalSignalCallbackRegistry;\n}\n\nstruct {\n  int number;\n  const char* name;\n  struct sigaction oldAction;\n} kFatalSignals[] = {\n    {SIGSEGV, \"SIGSEGV\", {}},\n    {SIGILL, \"SIGILL\", {}},\n    {SIGFPE, \"SIGFPE\", {}},\n    {SIGABRT, \"SIGABRT\", {}},\n    {SIGBUS, \"SIGBUS\", {}},\n    {SIGTERM, \"SIGTERM\", {}},\n    {SIGQUIT, \"SIGQUIT\", {}},\n    {0, nullptr, {}},\n};\n\nvoid callPreviousSignalHandler(int signum) {\n  \/\/ Restore disposition to old disposition, then kill ourselves with the same\n  \/\/ signal. The signal will be blocked until we return from our handler,\n  \/\/ then it will invoke the default handler and abort.\n  for (auto p = kFatalSignals; p->name; ++p) {\n    if (p->number == signum) {\n      sigaction(signum, &p->oldAction, nullptr);\n      raise(signum);\n      return;\n    }\n  }\n\n  \/\/ Not one of the signals we know about. Oh well. Reset to default.\n  struct sigaction sa;\n  memset(&sa, 0, sizeof(sa));\n  sa.sa_handler = SIG_DFL;\n  sigaction(signum, &sa, nullptr);\n  raise(signum);\n}\n\n\/\/ Note: not thread-safe, but that's okay, as we only let one thread\n\/\/ in our signal handler at a time.\n\/\/\n\/\/ Leak it so we don't have to worry about destruction order\n\/\/\n\/\/ Initialized by installFatalSignalHandler\nSafeStackTracePrinter* gStackTracePrinter;\n\nvoid printDec(uint64_t val) {\n  char buf[20];\n  uint32_t n = uint64ToBufferUnsafe(val, buf);\n  gStackTracePrinter->print(StringPiece(buf, n));\n}\n\nconst char kHexChars[] = \"0123456789abcdef\";\nvoid printHex(uint64_t val) {\n  \/\/ TODO(tudorb): Add this to folly\/Conv.h\n  char buf[2 + 2 * sizeof(uint64_t)]; \/\/ \"0x\" prefix, 2 digits for each byte\n\n  char* end = buf + sizeof(buf);\n  char* p = end;\n  do {\n    *--p = kHexChars[val & 0x0f];\n    val >>= 4;\n  } while (val != 0);\n  *--p = 'x';\n  *--p = '0';\n\n  gStackTracePrinter->print(StringPiece(p, end));\n}\n\nvoid print(StringPiece sp) {\n  gStackTracePrinter->print(sp);\n}\n\nvoid flush() {\n  gStackTracePrinter->flush();\n}\n\nvoid dumpTimeInfo() {\n  SCOPE_EXIT {\n    flush();\n  };\n  time_t now = time(nullptr);\n  print(\"*** Aborted at \");\n  printDec(now);\n  print(\" (Unix time, try 'date -d @\");\n  printDec(now);\n  print(\"') ***\\n\");\n}\n\nconst char* sigill_reason(int si_code) {\n  switch (si_code) {\n    case ILL_ILLOPC:\n      return \"illegal opcode\";\n    case ILL_ILLOPN:\n      return \"illegal operand\";\n    case ILL_ILLADR:\n      return \"illegal addressing mode\";\n    case ILL_ILLTRP:\n      return \"illegal trap\";\n    case ILL_PRVOPC:\n      return \"privileged opcode\";\n    case ILL_PRVREG:\n      return \"privileged register\";\n    case ILL_COPROC:\n      return \"coprocessor error\";\n    case ILL_BADSTK:\n      return \"internal stack error\";\n\n    default:\n      return nullptr;\n  }\n}\n\nconst char* sigfpe_reason(int si_code) {\n  switch (si_code) {\n    case FPE_INTDIV:\n      return \"integer divide by zero\";\n    case FPE_INTOVF:\n      return \"integer overflow\";\n    case FPE_FLTDIV:\n      return \"floating-point divide by zero\";\n    case FPE_FLTOVF:\n      return \"floating-point overflow\";\n    case FPE_FLTUND:\n      return \"floating-point underflow\";\n    case FPE_FLTRES:\n      return \"floating-point inexact result\";\n    case FPE_FLTINV:\n      return \"floating-point invalid operation\";\n    case FPE_FLTSUB:\n      return \"subscript out of range\";\n\n    default:\n      return nullptr;\n  }\n}\n\nconst char* sigsegv_reason(int si_code) {\n  switch (si_code) {\n    case SEGV_MAPERR:\n      return \"address not mapped to object\";\n    case SEGV_ACCERR:\n      return \"invalid permissions for mapped object\";\n\n    default:\n      return nullptr;\n  }\n}\n\nconst char* sigbus_reason(int si_code) {\n  switch (si_code) {\n    case BUS_ADRALN:\n      return \"invalid address alignment\";\n    case BUS_ADRERR:\n      return \"nonexistent physical address\";\n    case BUS_OBJERR:\n      return \"object-specific hardware error\";\n\n      \/\/ MCEERR_AR and MCEERR_AO: in sigaction(2) but not in headers.\n\n    default:\n      return nullptr;\n  }\n}\n\nconst char* sigtrap_reason(int si_code) {\n  switch (si_code) {\n    case TRAP_BRKPT:\n      return \"process breakpoint\";\n    case TRAP_TRACE:\n      return \"process trace trap\";\n\n      \/\/ TRAP_BRANCH and TRAP_HWBKPT: in sigaction(2) but not in headers.\n\n    default:\n      return nullptr;\n  }\n}\n\nconst char* sigchld_reason(int si_code) {\n  switch (si_code) {\n    case CLD_EXITED:\n      return \"child has exited\";\n    case CLD_KILLED:\n      return \"child was killed\";\n    case CLD_DUMPED:\n      return \"child terminated abnormally\";\n    case CLD_TRAPPED:\n      return \"traced child has trapped\";\n    case CLD_STOPPED:\n      return \"child has stopped\";\n    case CLD_CONTINUED:\n      return \"stopped child has continued\";\n\n    default:\n      return nullptr;\n  }\n}\n\nconst char* sigio_reason(int si_code) {\n  switch (si_code) {\n    case POLL_IN:\n      return \"data input available\";\n    case POLL_OUT:\n      return \"output buffers available\";\n    case POLL_MSG:\n      return \"input message available\";\n    case POLL_ERR:\n      return \"I\/O error\";\n    case POLL_PRI:\n      return \"high priority input available\";\n    case POLL_HUP:\n      return \"device disconnected\";\n\n    default:\n      return nullptr;\n  }\n}\n\nconst char* signal_reason(int signum, int si_code) {\n  switch (signum) {\n    case SIGILL:\n      return sigill_reason(si_code);\n    case SIGFPE:\n      return sigfpe_reason(si_code);\n    case SIGSEGV:\n      return sigsegv_reason(si_code);\n    case SIGBUS:\n      return sigbus_reason(si_code);\n    case SIGTRAP:\n      return sigtrap_reason(si_code);\n    case SIGCHLD:\n      return sigchld_reason(si_code);\n    case SIGIO:\n      return sigio_reason(si_code); \/\/ aka SIGPOLL\n\n    default:\n      return nullptr;\n  }\n}\n\nvoid dumpSignalInfo(int signum, siginfo_t* siginfo) {\n  SCOPE_EXIT {\n    flush();\n  };\n  \/\/ Get the signal name, if possible.\n  const char* name = nullptr;\n  for (auto p = kFatalSignals; p->name; ++p) {\n    if (p->number == signum) {\n      name = p->name;\n      break;\n    }\n  }\n\n  print(\"*** Signal \");\n  printDec(signum);\n  if (name) {\n    print(\" (\");\n    print(name);\n    print(\")\");\n  }\n\n  print(\" (\");\n  printHex(reinterpret_cast<uint64_t>(siginfo->si_addr));\n  print(\") received by PID \");\n  printDec(getpid());\n  print(\" (pthread TID \");\n  printHex((uint64_t)pthread_self());\n  print(\") (linux TID \");\n  printDec(syscall(__NR_gettid));\n\n  \/\/ Kernel-sourced signals don't give us useful info for pid\/uid.\n  if (siginfo->si_code != SI_KERNEL) {\n    print(\") (maybe from PID \");\n    printDec(siginfo->si_pid);\n    print(\", UID \");\n    printDec(siginfo->si_uid);\n  }\n\n  auto reason = signal_reason(signum, siginfo->si_code);\n\n  if (reason != nullptr) {\n    print(\") (code: \");\n    print(reason);\n  }\n\n  print(\"), stack trace: ***\\n\");\n}\n\n\/\/ On Linux, pthread_t is a pointer, so 0 is an invalid value, which we\n\/\/ take to indicate \"no thread in the signal handler\".\n\/\/\n\/\/ POSIX defines PTHREAD_NULL for this purpose, but that's not available.\nconstexpr pthread_t kInvalidThreadId = 0;\n\nstd::atomic<pthread_t> gSignalThread(kInvalidThreadId);\nstd::atomic<bool> gInRecursiveSignalHandler(false);\n\n\/\/ Here be dragons.\nvoid innerSignalHandler(int signum, siginfo_t* info, void* \/* uctx *\/) {\n  \/\/ First, let's only let one thread in here at a time.\n  pthread_t myId = pthread_self();\n\n  pthread_t prevSignalThread = kInvalidThreadId;\n  while (!gSignalThread.compare_exchange_strong(prevSignalThread, myId)) {\n    if (pthread_equal(prevSignalThread, myId)) {\n      \/\/ First time here. Try to dump the stack trace without symbolization.\n      \/\/ If we still fail, well, we're mightily screwed, so we do nothing the\n      \/\/ next time around.\n      if (!gInRecursiveSignalHandler.exchange(true)) {\n        print(\"Entered fatal signal handler recursively. We're in trouble.\\n\");\n        gStackTracePrinter->printStackTrace(false); \/\/ no symbolization\n      }\n      return;\n    }\n\n    \/\/ Wait a while, try again.\n    timespec ts;\n    ts.tv_sec = 0;\n    ts.tv_nsec = 100L * 1000 * 1000; \/\/ 100ms\n    nanosleep(&ts, nullptr);\n\n    prevSignalThread = kInvalidThreadId;\n  }\n\n  dumpTimeInfo();\n  dumpSignalInfo(signum, info);\n  gStackTracePrinter->printStackTrace(true); \/\/ with symbolization\n\n  \/\/ Run user callbacks\n  getFatalSignalCallbackRegistry()->run();\n}\n\nvoid signalHandler(int signum, siginfo_t* info, void* uctx) {\n  int savedErrno = errno;\n  SCOPE_EXIT {\n    flush();\n    errno = savedErrno;\n  };\n  innerSignalHandler(signum, info, uctx);\n\n  gSignalThread = kInvalidThreadId;\n  \/\/ Kill ourselves with the previous handler.\n  callPreviousSignalHandler(signum);\n}\n\n} \/\/ namespace\n\nvoid addFatalSignalCallback(SignalCallback cb) {\n  getFatalSignalCallbackRegistry()->add(cb);\n}\n\nvoid installFatalSignalCallbacks() {\n  getFatalSignalCallbackRegistry()->markInstalled();\n}\n\nnamespace {\n\nstd::atomic<bool> gAlreadyInstalled;\n\n\/\/ Small sigaltstack size threshold.\n\/\/ 8931 is known to cause the signal handler to stack overflow during\n\/\/ symbolization even for a simple one-liner \"kill(getpid(), SIGTERM)\".\nconst size_t kSmallSigAltStackSize = 8931;\n\nbool isSmallSigAltStackEnabled() {\n  stack_t ss;\n  if (sigaltstack(nullptr, &ss) != 0) {\n    return false;\n  }\n  if ((ss.ss_flags & SS_DISABLE) != 0) {\n    return false;\n  }\n  return ss.ss_size <= kSmallSigAltStackSize;\n}\n\n} \/\/ namespace\n\nvoid installFatalSignalHandler() {\n  if (gAlreadyInstalled.exchange(true)) {\n    \/\/ Already done.\n    return;\n  }\n\n  \/\/ make sure gFatalSignalCallbackRegistry is created before we\n  \/\/ install the fatal signal handler\n  getFatalSignalCallbackRegistry();\n\n  \/\/ If a small sigaltstack is enabled (ex. Rust stdlib might use sigaltstack\n  \/\/ to set a small stack), the default SafeStackTracePrinter would likely\n  \/\/ stack overflow. Replace it with the unsafe self-allocate printer.\n  bool useUnsafePrinter = isSmallSigAltStackEnabled();\n  if (useUnsafePrinter) {\n    gStackTracePrinter = new UnsafeSelfAllocateStackTracePrinter();\n  } else {\n    gStackTracePrinter = new SafeStackTracePrinter();\n  }\n\n  struct sigaction sa;\n  memset(&sa, 0, sizeof(sa));\n  if (useUnsafePrinter) {\n    \/\/ The signal handler is not async-signal-safe. Block all signals to\n    \/\/ make it safer. But it's still unsafe.\n    sigfillset(&sa.sa_mask);\n  } else {\n    sigemptyset(&sa.sa_mask);\n  }\n  \/\/ By default signal handlers are run on the signaled thread's stack.\n  \/\/ In case of stack overflow running the SIGSEGV signal handler on\n  \/\/ the same stack leads to another SIGSEGV and crashes the program.\n  \/\/ Use SA_ONSTACK, so alternate stack is used (only if configured via\n  \/\/ sigaltstack).\n  \/\/ Golang also requires SA_ONSTACK. See:\n  \/\/ https:\/\/golang.org\/pkg\/os\/signal\/#hdr-Go_programs_that_use_cgo_or_SWIG\n  sa.sa_flags |= SA_SIGINFO | SA_ONSTACK;\n  sa.sa_sigaction = &signalHandler;\n\n  for (auto p = kFatalSignals; p->name; ++p) {\n    CHECK_ERR(sigaction(p->number, &sa, &p->oldAction));\n  }\n}\n} \/\/ namespace symbolizer\n} \/\/ namespace folly\n<|endoftext|>"}
{"text":"<commit_before>#include <cstdlib>\n#include <iostream>\n\n#include <GL\/gl.h>\n#include <GL\/glu.h>\n#include <GL\/glut.h>\n\n#include \"sstream\"\n#include \"vector\"\n#include \"time.h\"\n#include \"math.h\"\n#include \"iostream\"\n\nusing namespace std;\n\nint XX = 800;\nint YY = 600;\nbool teljes = false;\n\nconst double maximumsebesseg = 10;\n\nstruct Skoordinatak\n{\n\tdouble x;\n\tdouble y;\n\n\tSkoordinatak (double ux, double uy) \n\t{\n\t\tx=ux;\n\t\ty=uy;\n\t};\n\n\tSkoordinatak () \n\t{};\n\n};\n\nvoid kor(Skoordinatak pozicio, double sugar)\n{\n    glTranslated(pozicio.x,pozicio.y,0);\n    GLUquadricObj *qobj = gluNewQuadric();\n    gluDisk(qobj, 0,sugar,30,30);\n    glTranslated(-pozicio.x,-pozicio.y,0);\n}\n\nstruct Sgolyo\n{\n\tprivate:\n\tdouble sugar;\n\tSkoordinatak pozicio;\n\tSkoordinatak sebesseg;\n\tunsigned char R,G,B;\n\n\tpublic:\n\tSgolyo (double usugar, Skoordinatak upozicio, Skoordinatak usebesseg) \n\t{\n\t\tsugar = usugar;\n\t\tpozicio = upozicio;\n\t\tsebesseg = usebesseg;\n\t\tR = rand()%255;\n\t\tG = rand()%255;\n\t\tB = rand()%255;\n\t};\n\n\tvoid rajzol()\n\t{\n\t\tglColor3d(R\/255.0, G\/255.0, B\/255.0);\n\t\tkor(pozicio,sugar);\n\t}\n\n\tvoid update(vector<Sgolyo> &labdak, double surlodas)\n\t{\n\t\tfor (int i = 0; i < labdak.size(); i++) { \/\/ Megvizsgálom mindegyikkel, hogy ütközött-e\n\t \t\tdouble dx = labdak[i].pozicio.x - pozicio.x; \/\/ Vektort képzek\n\t\t\tdouble dy = labdak[i].pozicio.y - pozicio.y;\n\t\t\tdouble distance = sqrt(dx*dx + dy*dy); \/\/ távolság\n\t\t\tdouble minDist = labdak[i].sugar + sugar; \/\/ Legkisebb távolság hogy még nem ütközik\n\t  \t\tif (distance < minDist) { \/\/ ütközött-e\n\t\t\t\tdouble angle = atan2(dy, dx); \/\/ ütközés szöge\n\n\t\t\t\tdouble targetX = pozicio.x + cos(angle) * minDist; \/\/ sebesség vektor számolás (előkészület)\n\t\t\t\tdouble targetY = pozicio.y + sin(angle) * minDist;\n\n\t\t\t\tdouble ax = (targetX - labdak[i].pozicio.x) * 0.9; \/\/ sebesség vektor számolás (befejezés)\n\t\t\t\tdouble ay = (targetY - labdak[i].pozicio.y) * 0.9; \/\/ A 0.9es szorzó azért van hogy szétjöjjenek ha egyberakjuk őket. (Ugyanakkor rugalmatlanabb lesz az ütközés) \n\n\t\t\t\tsebesseg.x -= ax; \/\/ Sebességvektorok megváltozatása\n\t\t\t\tsebesseg.y -= ay;\n\t\t\t\tlabdak[i].sebesseg.x += ax;\n\t\t\t\tlabdak[i].sebesseg.y += ay;\n\t\t\t}\n\t\t}\n\n\t\tif (sebesseg.x>maximumsebesseg) sebesseg.x=maximumsebesseg; else if (sebesseg.x<-maximumsebesseg) sebesseg.x=-maximumsebesseg; \/\/ Ha túl gyorsak lennének (ami csak akkor lehet ha egyberakjuk őket)\n        if (sebesseg.y>maximumsebesseg) sebesseg.y=maximumsebesseg; else if (sebesseg.y<-maximumsebesseg) sebesseg.y=-maximumsebesseg; \/\/ Maximum sebességre állítjuk őket\n\n\t\tpozicio.x+=sebesseg.x; \/\/ Mozgatás\n\t\tpozicio.y+=sebesseg.y;\n\n\t\tif (pozicio.x-sugar<0) { \/\/ Fallakkal való ütközés\n\t\t\tsebesseg.x=-sebesseg.x;\n\t\t\tpozicio.x=0+sugar;\n\t\t}\n\t\tif (pozicio.x+sugar>XX){\n\t\t\tsebesseg.x=-sebesseg.x;\n\t\t\tpozicio.x=XX-sugar;\n\t\t}\n\t\tif (pozicio.y-sugar<0) {\n\t\t\tsebesseg.y=-sebesseg.y;\n\t\t\tpozicio.y=0+sugar;\n\t\t}\n\t\tif (pozicio.y+sugar>YY){\n\t\t\tsebesseg.y=-sebesseg.y;\n\t\t\tpozicio.y=YY-sugar;\n\t\t}\n\n\t\tsebesseg.x\/=surlodas;\n\t\tsebesseg.y\/=surlodas;\n\t\tcout << surlodas << \"\t\" << int(sebesseg.x*100)\/100.0 << \"\t\" << int(sebesseg.y*100)\/100.0 << endl;\n\n\t}\n};\n\nvector<Sgolyo> labdak;\ndouble surlodas = 1;\n\nvoid MouseFunction(int button, int state, int x,int y)\n{\n    \/\/bal gomb lenyomására\n    if (button == GLUT_LEFT_BUTTON) {\n        if  (state == GLUT_DOWN) { \/\/le\n            Sgolyo labda(rand()%20+3,Skoordinatak(x,y),Skoordinatak((rand()%int(maximumsebesseg*200)-maximumsebesseg*100)\/100.0,(rand()%int(maximumsebesseg*200)-maximumsebesseg*100)\/100.0));\n            \/\/ rand()%int(maximumsebesseg*200)-maximumsebesseg*100)\/100.0) -nek az értékei ha maximumsebesseg=3: -3.00-tól +3.00-ig\n            labdak.push_back(labda);\n        } else { \/\/fel \n        }\n    }\n}\n\nvoid Init()\n{\n    glViewport(0, 0, XX, YY);\n    glMatrixMode(GL_MODELVIEW);\n    glLoadIdentity( );\n    glMatrixMode(GL_PROJECTION);\n    glLoadIdentity( );\n    gluOrtho2D(0.0, XX, YY, 0.0);\n}\n\nvoid ReDraw( ) { \n\n    glMatrixMode(GL_MODELVIEW);\n    glLoadIdentity();\n\n\n    glClearColor(0.0, 0.0, 0.0, 0.0); \/\/háttérszín\n    glClear(GL_COLOR_BUFFER_BIT); \n    \n\n    for (int i = 0; i < labdak.size(); ++i)\n    {\n        labdak[i].rajzol();\n    }\n    \n    glFlush( ); \/\/Azonnal jelenítse meg\n    glutSwapBuffers();\n    \n}\n\nvoid Step() \n{\n    \n    for (int i = 0; i < labdak.size(); ++i)\n    {\n        labdak[i].update(labdak, surlodas);\n    }\n\n  glutPostRedisplay();   \/\/display scene\n}\n\nvoid reshape(int w, int h) {\n    glViewport(0,0,(GLsizei)w,(GLsizei)h);\n    glMatrixMode(GL_PROJECTION);\n    glLoadIdentity();\n    gluOrtho2D(0.0, w, h, 0.0);\n    XX=w;\n    YY=h;\n}\n\n\nint main(int argc, char* argv[])\n{\n\tsrand (time(NULL));\n\n\tglutInitWindowSize(XX, YY);\n    glutInitWindowPosition(500, 100);\n    glutInit(&argc, argv);\n    glutInitDisplayMode(GLUT_DOUBLE | GLUT_RGBA);\n    glutCreateWindow(\"Utkozes\");\n    Init();\n    glutDisplayFunc(ReDraw);\n    glutMouseFunc(MouseFunction);\n    glutReshapeFunc(reshape);   \n    \n    glutIdleFunc(Step);\n\n    glutMainLoop();\n    \n\treturn 0;\n}<commit_msg>Laptop Grafika 4.5 tab->space<commit_after>#include <cstdlib>\n#include <iostream>\n\n#include <GL\/gl.h>\n#include <GL\/glu.h>\n#include <GL\/glut.h>\n\n#include \"sstream\"\n#include \"vector\"\n#include \"time.h\"\n#include \"math.h\"\n#include \"iostream\"\n\nusing namespace std;\n\nint XX = 800;\nint YY = 600;\nbool teljes = false;\n\nconst double maximumsebesseg = 10;\n\nstruct Skoordinatak\n{\n    double x;\n    double y;\n\n    Skoordinatak (double ux, double uy) \n    {\n        x=ux;\n        y=uy;\n    };\n\n    Skoordinatak () \n    {};\n\n};\n\nvoid kor(Skoordinatak pozicio, double sugar)\n{\n    glTranslated(pozicio.x,pozicio.y,0);\n    GLUquadricObj *qobj = gluNewQuadric();\n    gluDisk(qobj, 0,sugar,30,30);\n    glTranslated(-pozicio.x,-pozicio.y,0);\n}\n\nstruct Sgolyo\n{\n    private:\n    double sugar;\n    Skoordinatak pozicio;\n    Skoordinatak sebesseg;\n    unsigned char R,G,B;\n\n    public:\n    Sgolyo (double usugar, Skoordinatak upozicio, Skoordinatak usebesseg) \n    {\n        sugar = usugar;\n        pozicio = upozicio;\n        sebesseg = usebesseg;\n        R = rand()%255;\n        G = rand()%255;\n        B = rand()%255;\n    };\n\n    void rajzol()\n    {\n        glColor3d(R\/255.0, G\/255.0, B\/255.0);\n        kor(pozicio,sugar);\n    }\n\n    void update(vector<Sgolyo> &labdak, double surlodas)\n    {\n        for (int i = 0; i < labdak.size(); i++) { \/\/ Megvizsgálom mindegyikkel, hogy ütközött-e\n            double dx = labdak[i].pozicio.x - pozicio.x; \/\/ Vektort képzek\n            double dy = labdak[i].pozicio.y - pozicio.y;\n            double distance = sqrt(dx*dx + dy*dy); \/\/ távolság\n            double minDist = labdak[i].sugar + sugar; \/\/ Legkisebb távolság hogy még nem ütközik\n            if (distance < minDist) { \/\/ ütközött-e\n                double angle = atan2(dy, dx); \/\/ ütközés szöge\n\n                double targetX = pozicio.x + cos(angle) * minDist; \/\/ sebesség vektor számolás (előkészület)\n                double targetY = pozicio.y + sin(angle) * minDist;\n\n                double ax = (targetX - labdak[i].pozicio.x) * 0.9; \/\/ sebesség vektor számolás (befejezés)\n                double ay = (targetY - labdak[i].pozicio.y) * 0.9; \/\/ A 0.9es szorzó azért van hogy szétjöjjenek ha egyberakjuk őket. (Ugyanakkor rugalmatlanabb lesz az ütközés) \n\n                sebesseg.x -= ax; \/\/ Sebességvektorok megváltozatása\n                sebesseg.y -= ay;\n                labdak[i].sebesseg.x += ax;\n                labdak[i].sebesseg.y += ay;\n            }\n        }\n\n        if (sebesseg.x>maximumsebesseg) sebesseg.x=maximumsebesseg; else if (sebesseg.x<-maximumsebesseg) sebesseg.x=-maximumsebesseg; \/\/ Ha túl gyorsak lennének (ami csak akkor lehet ha egyberakjuk őket)\n        if (sebesseg.y>maximumsebesseg) sebesseg.y=maximumsebesseg; else if (sebesseg.y<-maximumsebesseg) sebesseg.y=-maximumsebesseg; \/\/ Maximum sebességre állítjuk őket\n\n        pozicio.x+=sebesseg.x; \/\/ Mozgatás\n        pozicio.y+=sebesseg.y;\n\n        if (pozicio.x-sugar<0) { \/\/ Fallakkal való ütközés\n            sebesseg.x=-sebesseg.x;\n            pozicio.x=0+sugar;\n        }\n        if (pozicio.x+sugar>XX){\n            sebesseg.x=-sebesseg.x;\n            pozicio.x=XX-sugar;\n        }\n        if (pozicio.y-sugar<0) {\n            sebesseg.y=-sebesseg.y;\n            pozicio.y=0+sugar;\n        }\n        if (pozicio.y+sugar>YY){\n            sebesseg.y=-sebesseg.y;\n            pozicio.y=YY-sugar;\n        }\n\n        sebesseg.x\/=surlodas;\n        sebesseg.y\/=surlodas;\n        cout << surlodas << \"   \" << int(sebesseg.x*100)\/100.0 << \" \" << int(sebesseg.y*100)\/100.0 << endl;\n\n    }\n};\n\nvector<Sgolyo> labdak;\ndouble surlodas = 1;\n\nvoid MouseFunction(int button, int state, int x,int y)\n{\n    \/\/bal gomb lenyomására\n    if (button == GLUT_LEFT_BUTTON) {\n        if  (state == GLUT_DOWN) { \/\/le\n            Sgolyo labda(rand()%20+3,Skoordinatak(x,y),Skoordinatak((rand()%int(maximumsebesseg*200)-maximumsebesseg*100)\/100.0,(rand()%int(maximumsebesseg*200)-maximumsebesseg*100)\/100.0));\n            \/\/ rand()%int(maximumsebesseg*200)-maximumsebesseg*100)\/100.0) -nek az értékei ha maximumsebesseg=3: -3.00-tól +3.00-ig\n            labdak.push_back(labda);\n        } else { \/\/fel \n        }\n    }\n}\n\nvoid Init()\n{\n    glViewport(0, 0, XX, YY);\n    glMatrixMode(GL_MODELVIEW);\n    glLoadIdentity( );\n    glMatrixMode(GL_PROJECTION);\n    glLoadIdentity( );\n    gluOrtho2D(0.0, XX, YY, 0.0);\n}\n\nvoid ReDraw( ) { \n\n    glMatrixMode(GL_MODELVIEW);\n    glLoadIdentity();\n\n\n    glClearColor(0.0, 0.0, 0.0, 0.0); \/\/háttérszín\n    glClear(GL_COLOR_BUFFER_BIT); \n    \n\n    for (int i = 0; i < labdak.size(); ++i)\n    {\n        labdak[i].rajzol();\n    }\n    \n    glFlush( ); \/\/Azonnal jelenítse meg\n    glutSwapBuffers();\n    \n}\n\nvoid Step() \n{\n    \n    for (int i = 0; i < labdak.size(); ++i)\n    {\n        labdak[i].update(labdak, surlodas);\n    }\n\n  glutPostRedisplay();   \/\/display scene\n}\n\nvoid reshape(int w, int h) {\n    glViewport(0,0,(GLsizei)w,(GLsizei)h);\n    glMatrixMode(GL_PROJECTION);\n    glLoadIdentity();\n    gluOrtho2D(0.0, w, h, 0.0);\n    XX=w;\n    YY=h;\n}\n\n\nint main(int argc, char* argv[])\n{\n    srand (time(NULL));\n\n    glutInitWindowSize(XX, YY);\n    glutInitWindowPosition(500, 100);\n    glutInit(&argc, argv);\n    glutInitDisplayMode(GLUT_DOUBLE | GLUT_RGBA);\n    glutCreateWindow(\"Utkozes\");\n    Init();\n    glutDisplayFunc(ReDraw);\n    glutMouseFunc(MouseFunction);\n    glutReshapeFunc(reshape);   \n    \n    glutIdleFunc(Step);\n\n    glutMainLoop();\n    \n    return 0;\n}<|endoftext|>"}
{"text":"<commit_before>\/* \n * Copyright 2009 The VOTCA Development Team (http:\/\/www.votca.org)\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n#include <iostream>\n#include <fstream>\n#include <boost\/program_options.hpp>\n#include <cgengine.h>\n#include \"version.h\"\n#include \"imc.h\"\n\nusing namespace std;\nusing namespace votca::csg;\nusing namespace votca::tools;\n\n\n#include <stdlib.h>\n#include <csgapplication.h>\n\n\/\/using namespace votca::tools;\nusing namespace std;\nusing namespace votca::csg;\n\nclass CsgStatApp\n    : public CsgApplication\n{\npublic:\n    CsgStatApp() : _write_every(0) {}\n    \n    string ProgramName() { return \"csg_stat\"; }\n    void HelpText(ostream &out);\n\n    bool DoTrajectory() {return true;}\n    bool DoMapping() {return true;}\n    bool DoMappingDefault(void) { return false; }\n    bool DoThreaded() {return true; }\n    bool SynchronizeThreads() {return true;}\n    void Initialize();\n    bool EvaluateOptions();\n\n    void BeginEvaluate(Topology *top, Topology *top_ref);\n    void EndEvaluate();\n\n    CsgApplication::Worker *ForkWorker() {\n        return _imc.ForkWorker();\n    }\n\n    void MergeWorker(CsgApplication::Worker *worker) {\n        _imc.MergeWorker(worker);\n    }\n\npublic:\n    Imc _imc;\n    int _write_every;\n};\n\nvoid CsgStatApp::HelpText(ostream &out)\n{\n    out << \"Calculate all distributions (bonded and non-bonded) specified in options file.\\n\"\n            \"Optionally calculates update matrix for invere Monte Carlo. This program\\n\"\n            \"is called inside the inverse scripts. Unlike csg_boltzmann, big systems\\n\"\n            \"can be treated as well as non-bonded interactions can be evaluated.\";\n}\n\nvoid CsgStatApp::Initialize()\n{\n    CsgApplication::Initialize();\n    AddProgramOptions(\"Specific options\")\n            (\"options\", boost::program_options::value<string>(), \"  options file for coarse graining\")\n            (\"do-imc\", \"  write out Inverse Monte Carlo data\")\n            (\"write-every\", boost::program_options::value<int>(&_write_every), \"  write after every block of this length, \" \\\n                \"if --blocking   is set, the averages are cleared after every output\")\n            (\"do-blocks\", \"  write output for blocking analysis\");\n}\n\nbool CsgStatApp::EvaluateOptions()\n{\n    CsgApplication::EvaluateOptions();\n    CheckRequired(\"options\");\n    CheckRequired(\"trj\", \"no trajectory file specified\");\n    \n    _imc.LoadOptions(OptionsMap()[\"options\"].as<string>());\n\n    _imc.WriteEvery(_write_every);\n    if(OptionsMap().count(\"do-blocks\"))\n        _imc.DoBlocks(true);\n    if(OptionsMap().count(\"do-imc\"))\n    _imc.DoImc(true);\n\n    _imc.Initialize();\n    return true;\n}\n\nvoid CsgStatApp::BeginEvaluate(Topology *top, Topology *top_ref)\n{\n    _imc.BeginEvaluate(top, top_ref);\n}\n\nvoid CsgStatApp::EndEvaluate()\n{\n    _imc.EndEvaluate();\n}\n\nint main(int argc, char** argv)\n{\n    CsgStatApp app;\n    app.Exec(argc, argv);\n}\n\n<commit_msg>csg_stat: return correct exit code<commit_after>\/* \n * Copyright 2009 The VOTCA Development Team (http:\/\/www.votca.org)\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n#include <iostream>\n#include <fstream>\n#include <boost\/program_options.hpp>\n#include <cgengine.h>\n#include \"version.h\"\n#include \"imc.h\"\n\nusing namespace std;\nusing namespace votca::csg;\nusing namespace votca::tools;\n\n\n#include <stdlib.h>\n#include <csgapplication.h>\n\n\/\/using namespace votca::tools;\nusing namespace std;\nusing namespace votca::csg;\n\nclass CsgStatApp\n    : public CsgApplication\n{\npublic:\n    CsgStatApp() : _write_every(0) {}\n    \n    string ProgramName() { return \"csg_stat\"; }\n    void HelpText(ostream &out);\n\n    bool DoTrajectory() {return true;}\n    bool DoMapping() {return true;}\n    bool DoMappingDefault(void) { return false; }\n    bool DoThreaded() {return true; }\n    bool SynchronizeThreads() {return true;}\n    void Initialize();\n    bool EvaluateOptions();\n\n    void BeginEvaluate(Topology *top, Topology *top_ref);\n    void EndEvaluate();\n\n    CsgApplication::Worker *ForkWorker() {\n        return _imc.ForkWorker();\n    }\n\n    void MergeWorker(CsgApplication::Worker *worker) {\n        _imc.MergeWorker(worker);\n    }\n\npublic:\n    Imc _imc;\n    int _write_every;\n};\n\nvoid CsgStatApp::HelpText(ostream &out)\n{\n    out << \"Calculate all distributions (bonded and non-bonded) specified in options file.\\n\"\n            \"Optionally calculates update matrix for invere Monte Carlo. This program\\n\"\n            \"is called inside the inverse scripts. Unlike csg_boltzmann, big systems\\n\"\n            \"can be treated as well as non-bonded interactions can be evaluated.\";\n}\n\nvoid CsgStatApp::Initialize()\n{\n    CsgApplication::Initialize();\n    AddProgramOptions(\"Specific options\")\n            (\"options\", boost::program_options::value<string>(), \"  options file for coarse graining\")\n            (\"do-imc\", \"  write out Inverse Monte Carlo data\")\n            (\"write-every\", boost::program_options::value<int>(&_write_every), \"  write after every block of this length, \" \\\n                \"if --blocking   is set, the averages are cleared after every output\")\n            (\"do-blocks\", \"  write output for blocking analysis\");\n}\n\nbool CsgStatApp::EvaluateOptions()\n{\n    CsgApplication::EvaluateOptions();\n    CheckRequired(\"options\");\n    CheckRequired(\"trj\", \"no trajectory file specified\");\n    \n    _imc.LoadOptions(OptionsMap()[\"options\"].as<string>());\n\n    _imc.WriteEvery(_write_every);\n    if(OptionsMap().count(\"do-blocks\"))\n        _imc.DoBlocks(true);\n    if(OptionsMap().count(\"do-imc\"))\n    _imc.DoImc(true);\n\n    _imc.Initialize();\n    return true;\n}\n\nvoid CsgStatApp::BeginEvaluate(Topology *top, Topology *top_ref)\n{\n    _imc.BeginEvaluate(top, top_ref);\n}\n\nvoid CsgStatApp::EndEvaluate()\n{\n    _imc.EndEvaluate();\n}\n\nint main(int argc, char** argv)\n{\n    CsgStatApp app;\n    return app.Exec(argc, argv);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ This file is part of Parsito <http:\/\/github.com\/ufal\/parsito\/>.\n\/\/\n\/\/ Copyright 2015 Institute of Formal and Applied Linguistics, Faculty of\n\/\/ Mathematics and Physics, Charles University in Prague, Czech Republic.\n\/\/\n\/\/ This Source Code Form is subject to the terms of the Mozilla Public\n\/\/ License, v. 2.0. If a copy of the MPL was not distributed with this\n\/\/ file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#include <fstream>\n\n#include \"common.h\"\n#include \"network\/network_parameters.h\"\n#include \"parser\/parser_nn_trainer.h\"\n#include \"tree\/tree_format.h\"\n#include \"utils\/compressor.h\"\n#include \"utils\/iostream_init.h\"\n#include \"utils\/options.h\"\n#include \"utils\/parse_double.h\"\n#include \"utils\/parse_int.h\"\n#include \"version\/version.h\"\n\nusing namespace ufal::parsito;\n\nint main(int argc, char* argv[]) {\n  iostream_init();\n\n  if (argc < 2) runtime_failure(\"Usage: \" << argv[0] << \" parser_model_identifier [options]\");\n\n  if (argv[1] != string(\"nn\"))\n    runtime_failure(\"Unknown parser_model_identifier '\" << argv[1] << \"'.!\");\n\n  options::map options;\n  if (!options::parse({{\"direct_connections\", options::value{\"0\", \"1\"}},\n                       {\"embeddings\", options::value::any},\n                       {\"heldout\", options::value::any},\n                       {\"hidden_layer\", options::value::any},\n                       {\"hidden_layer_type\", options::value{\"cubic\",\"tanh\"}},\n                       {\"initialization_range\", options::value::any},\n                       {\"input\", options::value{\"conllu\"}},\n                       {\"iterations\", options::value::any},\n                       {\"learning_rate\", options::value::any},\n                       {\"learning_rate_final\", options::value::any},\n                       {\"l1_regularization\", options::value::any},\n                       {\"l2_regularization\", options::value::any},\n                       {\"nodes\", options::value::any},\n                       {\"threads\", options::value::any},\n                       {\"transition_oracle\", options::value{\"static\"}},\n                       {\"transition_system\", options::value{\"projective\"}},\n                       {\"version\", options::value::none},\n                       {\"help\", options::value::none}}, argc, argv, options) ||\n      options.count(\"help\") ||\n      (argc < 2 && !options.count(\"version\")))\n    runtime_failure(\"Usage: \" << argv[0] << \" nn [options]\\n\"\n                    \"Options: --direct_connections=0|1 (should_nn_contain_direct_connections)\\n\"\n                    \"         --embeddings=embedding description file\\n\"\n                    \"         --heldout=heldout data file\\n\"\n                    \"         --hidden_layer=hidden layer size\\n\"\n                    \"         --hidden_layer_type=cubic|tanh (hidden layer activation function)\\n\"\n                    \"         --initialization_range=initialization range\\n\"\n                    \"         --input=conllu (input format)\\n\"\n                    \"         --iterations=number of training iterations\\n\"\n                    \"         --learning_rate=initial learning rate\\n\"\n                    \"         --learning_rate_final=final learning rate\\n\"\n                    \"         --l1_regularization=l1 regularization factor\\n\"\n                    \"         --l2_regularization=l2 regularization factor\\n\"\n                    \"         --nodes=node selector file\\n\"\n                    \"         --threads=number of training threads\\n\"\n                    \"         --transition_oracle=static\\n\"\n                    \"         --transition_system=projective\\n\"\n                    \"         --version\\n\"\n                    \"         --help\");\n  if (options.count(\"version\"))\n    return cout << version::version_and_copyright() << endl, 0;\n\n  \/\/ Use binary standard output\n  iostream_init_binary_output();\n\n  \/\/ Process options\n  network_parameters parameters;\n  if (!options.count(\"iterations\")) runtime_failure(\"Number of iterations must be specified!\");\n  parameters.iterations = parse_int(options[\"iterations\"], \"number of iterations\");\n  parameters.direct_connections = options.count(\"direct_connections\") ? options[\"direct_connections\"] == \"1\" : false;\n  parameters.hidden_layer = options.count(\"hidden_layer\") ? parse_int(options[\"hidden_layer\"], \"hidden layer size\") : 0;\n  if (!parameters.direct_connections && !parameters.hidden_layer) runtime_failure(\"The neural networks cannot have no direct connections nor hidden layer!\");\n  if (!activation_function::create(options.count(\"hidden_layer_type\") ? options[\"hidden_layer_type\"] : \"cubic\", parameters.hidden_layer_type))\n    runtime_failure(\"Unknown hidden layer type '\" << options[\"hidden_layer_type\"] << \"'!\");\n  parameters.learning_rate = options.count(\"learning_rate\") ? parse_double(options[\"learning_rate\"], \"learning rate\") : 0.1;\n  parameters.learning_rate_final = options.count(\"learning_rate_final\") ? parse_double(options[\"learning_rate_final\"], \"final learning rate\") : 0;\n  parameters.initialization_range = options.count(\"initialization_range\") ? parse_double(options[\"initialization_range\"], \"initialiation range\") : 0.1;\n  parameters.l1_regularization = options.count(\"l1_regularization\") ? parse_double(options[\"l1_regularization\"], \"l1 regularization\") : 0;\n  parameters.l2_regularization = options.count(\"l2_regularization\") ? parse_double(options[\"l2_regularization\"], \"l2 regularization\") : 0;\n\n  int threads = options.count(\"threads\") ? parse_int(options[\"threads\"], \"number of threads\") : 1;\n  if (threads <= 0) runtime_failure(\"The number of threads must be positive!\");\n\n  if (!options.count(\"transition_system\")) runtime_failure(\"The transition system must be specified!\");\n  if (!options.count(\"transition_oracle\")) runtime_failure(\"The transition oracle must be specified!\");\n\n  \/\/ Load embeddings description\n  if (!options.count(\"embeddings\")) runtime_failure(\"The embedding description file is required!\");\n  string embeddings;\n  {\n    ifstream in(options[\"embeddings\"]);\n    if (!in.is_open()) runtime_failure(\"Cannot open embedding description file '\" << options[\"embeddings\"] << \"'!\");\n    for (string line; getline(in, line);)\n      embeddings.append(line).push_back('\\n');\n  }\n\n  \/\/ Load node selector description\n  if (!options.count(\"nodes\")) runtime_failure(\"The node selector file is required!\");\n  string nodes;\n  {\n    ifstream in(options[\"nodes\"]);\n    if (!in.is_open()) runtime_failure(\"Cannot open node selector file '\" << options[\"nodes\"] << \"'!\");\n    for (string line; getline(in, line);)\n      nodes.append(line).push_back('\\n');\n  }\n\n  \/\/ Load training data\n  string input = options.count(\"input\") ? options[\"count\"] : \"conllu\";\n  unique_ptr<tree_input_format> input_format(tree_input_format::new_input_format(input));\n  if (!input_format)\n    runtime_failure(\"Unknown input format '\" << input << \"'!\");\n\n  string block, error;\n  tree t;\n  vector<tree> train;\n  unsigned train_words = 0;\n  cerr << \"Loading training data: \";\n  while (input_format->read_block(cin, block)) {\n    input_format->set_block(block);\n    while (input_format->next_tree(t, error)) {\n      train.push_back(t);\n      train_words += t.nodes.size() - 1;\n    }\n    if (!error.empty()) runtime_failure(error);\n  }\n  cerr << train.size() << \" sentences with \" << train_words << \" words.\" << endl;\n\n  \/\/ Load heldout data if present\n  vector<tree> heldout;\n  if (options.count(\"heldout\")) {\n    ifstream in(options[\"heldout\"]);\n    if (!in.is_open()) runtime_failure(\"Cannot open heldout file '\" << options[\"heldout\"] << \"'!\");\n\n    unsigned heldout_words = 0;\n    cerr << \"Loading heldout data: \";\n    while (input_format->read_block(in, block)) {\n      input_format->set_block(block);\n      while (input_format->next_tree(t, error)) {\n        heldout.push_back(t);\n        heldout_words += t.nodes.size() - 1;\n      }\n      if (!error.empty()) runtime_failure(error);\n    }\n    cerr << heldout.size() << \" sentences with \" << train_words << \" words.\" << endl;\n  }\n\n  \/\/ Prepare the binary encoder\n  binary_encoder enc;\n  enc.add_str(\"nn\");\n\n  \/\/ Train the parser_nn\n  cerr << \"Training the parser\" << endl;\n  parser_nn_trainer::train(options[\"transition_system\"], options[\"transition_oracle\"],\n                           embeddings, nodes, parameters, threads, train, heldout, enc);\n\n  \/\/ Encode the parser\n  cerr << \"Encoding the parser: \";\n  compressor::save(cout, enc);\n  cerr << \"done\" << endl;\n\n  return 0;\n}\n<commit_msg>Make direct_connection a flag instead of 0|1 argument.<commit_after>\/\/ This file is part of Parsito <http:\/\/github.com\/ufal\/parsito\/>.\n\/\/\n\/\/ Copyright 2015 Institute of Formal and Applied Linguistics, Faculty of\n\/\/ Mathematics and Physics, Charles University in Prague, Czech Republic.\n\/\/\n\/\/ This Source Code Form is subject to the terms of the Mozilla Public\n\/\/ License, v. 2.0. If a copy of the MPL was not distributed with this\n\/\/ file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#include <fstream>\n\n#include \"common.h\"\n#include \"network\/network_parameters.h\"\n#include \"parser\/parser_nn_trainer.h\"\n#include \"tree\/tree_format.h\"\n#include \"utils\/compressor.h\"\n#include \"utils\/iostream_init.h\"\n#include \"utils\/options.h\"\n#include \"utils\/parse_double.h\"\n#include \"utils\/parse_int.h\"\n#include \"version\/version.h\"\n\nusing namespace ufal::parsito;\n\nint main(int argc, char* argv[]) {\n  iostream_init();\n\n  if (argc < 2) runtime_failure(\"Usage: \" << argv[0] << \" parser_model_identifier [options]\");\n\n  if (argv[1] != string(\"nn\"))\n    runtime_failure(\"Unknown parser_model_identifier '\" << argv[1] << \"'.!\");\n\n  options::map options;\n  if (!options::parse({{\"direct_connections\", options::value::none},\n                       {\"embeddings\", options::value::any},\n                       {\"heldout\", options::value::any},\n                       {\"hidden_layer\", options::value::any},\n                       {\"hidden_layer_type\", options::value{\"cubic\",\"tanh\"}},\n                       {\"initialization_range\", options::value::any},\n                       {\"input\", options::value{\"conllu\"}},\n                       {\"iterations\", options::value::any},\n                       {\"learning_rate\", options::value::any},\n                       {\"learning_rate_final\", options::value::any},\n                       {\"l1_regularization\", options::value::any},\n                       {\"l2_regularization\", options::value::any},\n                       {\"nodes\", options::value::any},\n                       {\"threads\", options::value::any},\n                       {\"transition_oracle\", options::value{\"static\"}},\n                       {\"transition_system\", options::value{\"projective\"}},\n                       {\"version\", options::value::none},\n                       {\"help\", options::value::none}}, argc, argv, options) ||\n      options.count(\"help\") ||\n      (argc < 2 && !options.count(\"version\")))\n    runtime_failure(\"Usage: \" << argv[0] << \" nn [options]\\n\"\n                    \"Options: --direct_connections (should nn contain direct connections)\\n\"\n                    \"         --embeddings=embedding description file\\n\"\n                    \"         --heldout=heldout data file\\n\"\n                    \"         --hidden_layer=hidden layer size\\n\"\n                    \"         --hidden_layer_type=cubic|tanh (hidden layer activation function)\\n\"\n                    \"         --initialization_range=initialization range\\n\"\n                    \"         --input=conllu (input format)\\n\"\n                    \"         --iterations=number of training iterations\\n\"\n                    \"         --learning_rate=initial learning rate\\n\"\n                    \"         --learning_rate_final=final learning rate\\n\"\n                    \"         --l1_regularization=l1 regularization factor\\n\"\n                    \"         --l2_regularization=l2 regularization factor\\n\"\n                    \"         --nodes=node selector file\\n\"\n                    \"         --threads=number of training threads\\n\"\n                    \"         --transition_oracle=static\\n\"\n                    \"         --transition_system=projective\\n\"\n                    \"         --version\\n\"\n                    \"         --help\");\n  if (options.count(\"version\"))\n    return cout << version::version_and_copyright() << endl, 0;\n\n  \/\/ Use binary standard output\n  iostream_init_binary_output();\n\n  \/\/ Process options\n  network_parameters parameters;\n  if (!options.count(\"iterations\")) runtime_failure(\"Number of iterations must be specified!\");\n  parameters.iterations = parse_int(options[\"iterations\"], \"number of iterations\");\n  parameters.direct_connections = options.count(\"direct_connections\");\n  parameters.hidden_layer = options.count(\"hidden_layer\") ? parse_int(options[\"hidden_layer\"], \"hidden layer size\") : 0;\n  if (!parameters.direct_connections && !parameters.hidden_layer) runtime_failure(\"The neural networks cannot have no direct connections nor hidden layer!\");\n  if (!activation_function::create(options.count(\"hidden_layer_type\") ? options[\"hidden_layer_type\"] : \"cubic\", parameters.hidden_layer_type))\n    runtime_failure(\"Unknown hidden layer type '\" << options[\"hidden_layer_type\"] << \"'!\");\n  parameters.learning_rate = options.count(\"learning_rate\") ? parse_double(options[\"learning_rate\"], \"learning rate\") : 0.1;\n  parameters.learning_rate_final = options.count(\"learning_rate_final\") ? parse_double(options[\"learning_rate_final\"], \"final learning rate\") : 0;\n  parameters.initialization_range = options.count(\"initialization_range\") ? parse_double(options[\"initialization_range\"], \"initialiation range\") : 0.1;\n  parameters.l1_regularization = options.count(\"l1_regularization\") ? parse_double(options[\"l1_regularization\"], \"l1 regularization\") : 0;\n  parameters.l2_regularization = options.count(\"l2_regularization\") ? parse_double(options[\"l2_regularization\"], \"l2 regularization\") : 0;\n\n  int threads = options.count(\"threads\") ? parse_int(options[\"threads\"], \"number of threads\") : 1;\n  if (threads <= 0) runtime_failure(\"The number of threads must be positive!\");\n\n  if (!options.count(\"transition_system\")) runtime_failure(\"The transition system must be specified!\");\n  if (!options.count(\"transition_oracle\")) runtime_failure(\"The transition oracle must be specified!\");\n\n  \/\/ Load embeddings description\n  if (!options.count(\"embeddings\")) runtime_failure(\"The embedding description file is required!\");\n  string embeddings;\n  {\n    ifstream in(options[\"embeddings\"]);\n    if (!in.is_open()) runtime_failure(\"Cannot open embedding description file '\" << options[\"embeddings\"] << \"'!\");\n    for (string line; getline(in, line);)\n      embeddings.append(line).push_back('\\n');\n  }\n\n  \/\/ Load node selector description\n  if (!options.count(\"nodes\")) runtime_failure(\"The node selector file is required!\");\n  string nodes;\n  {\n    ifstream in(options[\"nodes\"]);\n    if (!in.is_open()) runtime_failure(\"Cannot open node selector file '\" << options[\"nodes\"] << \"'!\");\n    for (string line; getline(in, line);)\n      nodes.append(line).push_back('\\n');\n  }\n\n  \/\/ Load training data\n  string input = options.count(\"input\") ? options[\"count\"] : \"conllu\";\n  unique_ptr<tree_input_format> input_format(tree_input_format::new_input_format(input));\n  if (!input_format)\n    runtime_failure(\"Unknown input format '\" << input << \"'!\");\n\n  string block, error;\n  tree t;\n  vector<tree> train;\n  unsigned train_words = 0;\n  cerr << \"Loading training data: \";\n  while (input_format->read_block(cin, block)) {\n    input_format->set_block(block);\n    while (input_format->next_tree(t, error)) {\n      train.push_back(t);\n      train_words += t.nodes.size() - 1;\n    }\n    if (!error.empty()) runtime_failure(error);\n  }\n  cerr << train.size() << \" sentences with \" << train_words << \" words.\" << endl;\n\n  \/\/ Load heldout data if present\n  vector<tree> heldout;\n  if (options.count(\"heldout\")) {\n    ifstream in(options[\"heldout\"]);\n    if (!in.is_open()) runtime_failure(\"Cannot open heldout file '\" << options[\"heldout\"] << \"'!\");\n\n    unsigned heldout_words = 0;\n    cerr << \"Loading heldout data: \";\n    while (input_format->read_block(in, block)) {\n      input_format->set_block(block);\n      while (input_format->next_tree(t, error)) {\n        heldout.push_back(t);\n        heldout_words += t.nodes.size() - 1;\n      }\n      if (!error.empty()) runtime_failure(error);\n    }\n    cerr << heldout.size() << \" sentences with \" << train_words << \" words.\" << endl;\n  }\n\n  \/\/ Prepare the binary encoder\n  binary_encoder enc;\n  enc.add_str(\"nn\");\n\n  \/\/ Train the parser_nn\n  cerr << \"Training the parser\" << endl;\n  parser_nn_trainer::train(options[\"transition_system\"], options[\"transition_oracle\"],\n                           embeddings, nodes, parameters, threads, train, heldout, enc);\n\n  \/\/ Encode the parser\n  cerr << \"Encoding the parser: \";\n  compressor::save(cout, enc);\n  cerr << \"done\" << endl;\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Tunnel.cpp\n *\n *  Created on: Apr 2, 2014\n *      Author: joao\n *\/\n\n#include \"Tunnel.hpp\"\n#include <unistd.h>\n#include <string.h>\nusing namespace std;\nint authenticate_kbdint(ssh_session session, const char *password);\n\nTunnel::Tunnel(struct event_base *base, int localPort, Address destination, Address middle, User middleUser):\n\tbase(base),\n\tlocalPort(localPort),\n\tdestination(destination),\n\tmiddle(middle),\n\tmiddleUser(middleUser),\n\tthr(nullptr),\n\ttunnel_session(ssh_new()){\n}\n\nbool\nTunnel::start(){\n\tcout << \"Starting tunnel\"<< endl;\n\tthr = new thread(&Tunnel::run, *this);\n}\n\nint\nTunnel::run(){\n\tstruct sockaddr_in sin;\n\tbase = event_base_new();\n\tif (!base)\n\t\treturn false; \/*XXXerr*\/\n\n\tsin.sin_family = AF_INET;\n\tsin.sin_addr.s_addr = 0;\n\tsin.sin_port = htons(localPort);\n#if !USE_LISTENER\n\tlistener = socket(AF_INET, SOCK_STREAM, 0);\n\n\tevutil_make_socket_nonblocking(listener);\n\n\tif (bind(listener, (struct sockaddr*)&sin, sizeof(sin)) < 0) {\n\t\tperror(\"bind\");\n\t\treturn false;\n\t}\n\n\tif (listen(listener, 16)<0) {\n\t\tperror(\"listen\");\n\t\treturn false;\n\t}\n\n\t\/\/listener_event = event_new(base, listener, EV_READ|EV_PERSIST, do_accept, (void*)this);\n\t\/*XXX check it *\/\n\t\/\/event_add(listener_event, NULL);\n\t\/* We now have a listening socket, we create a read event to\n\t * be notified when a client connects. *\/\n\tevent_set(&listener_event, listener, EV_READ|EV_PERSIST, do_accept, (void *)this);\n\tevent_base_set(base, &listener_event);\n\tevent_add(&listener_event, NULL);\n#else\n\tlistener = evconnlistener_new_bind(base, accept_conn_cb, (void*)this,\n\t\t\tLEV_OPT_CLOSE_ON_FREE|LEV_OPT_REUSEABLE, -1,\n\t\t\t(struct sockaddr*)&sin, sizeof(sin));\n\t\tif (!listener) {\n\t\t\t\tperror(\"Couldn't create listener\");\n\t\t\t\treturn false;\n\t\t}\n\t\tevconnlistener_set_error_cb(listener, accept_error_cb);\n#endif\n\ttunnel_session = ssh_new();\n\tif( SSH_OK != connect_tunnel() ){\n\t\t cout << \"Error connecting.....\" << endl;\n\t\t return false;\n\t }\n\n\n\n\n\n\tevent_base_dispatch(base);\n\treturn true;\n}\n\nbool\nTunnel::stop(){\n\n\treturn false;\n}\n#if !USE_LISTENER\nvoid\nTunnel::do_accept(int errcode, short int addr, void *ptr) {\n\tcout << \"Entered do_accept\"<<endl;\n    Tunnel *ctx = static_cast<Tunnel *>(ptr);\n\n\tstruct sockaddr_storage ss;\n\tsocklen_t slen = sizeof(ss);\n\tint fd = accept(ctx->listener, (struct sockaddr*)&ss, &slen);\n\tif (fd < 0) {\n\t\tperror(\"accept\");\n\t} else if (fd > FD_SETSIZE) {\n\t\tclose(fd);\n\t} else {\n\t\tstruct bufferevent *bev;\n\t\tevutil_make_socket_nonblocking(fd);\n\t\tConnection *con = new Connection(ctx, fd);\n\t\tbev = bufferevent_socket_new(ctx->base, fd, BEV_OPT_CLOSE_ON_FREE);\n\t\tbufferevent_setcb(bev, Connection::socket_to_ssh, NULL, Connection::errorcb, (void*)con);\n\t\tbufferevent_setwatermark(bev, EV_READ, 0, 2048);\n\t\tbufferevent_enable(bev, EV_READ|EV_WRITE);\n\t}\n\n}\n#else\n\nvoid\nTunnel::accept_conn_cb(struct evconnlistener *listener,\n    evutil_socket_t fd, struct sockaddr *address, int socklen,\n    void *ptr)\n{\n\tTunnel *ctx = static_cast<Tunnel *>(ptr);\n\tssh_channel forwarding_channel;\n\tstruct timeval tv;\n\n\ttv.tv_sec = 0;\n\ttv.tv_usec = 10;\n\tforwarding_channel = ssh_channel_new(ctx->tunnel_session);\n\tif (forwarding_channel == NULL) {\n\t\treturn;\n\t}\n\tint rc = ssh_channel_open_forward(forwarding_channel,\n\t\t\t\t\t\t\t\t\tctx->destination.getHost().c_str(), ctx->destination.getPort(),\n\t\t\t\t\t\t\t\t\t\"localhost\", ctx->localPort);\n\tif (rc != SSH_OK)\n\t{\n\t\tssh_channel_free(forwarding_channel);\n\t\treturn;\n\t}\n\n\n\t\/* We got a new connection! Set up a bufferevent for it. *\/\n\tstruct event_base *base = evconnlistener_get_base(listener);\n\tConnection *con = new Connection(ctx, fd, forwarding_channel);\n\tcon->socket_event = bufferevent_socket_new(\n\t\t\tctx->base, fd, BEV_OPT_CLOSE_ON_FREE);\n\n\tbufferevent_setcb(con->socket_event, Connection::socket_to_ssh, NULL, Connection::errorcb, (void*)con);\n\t\/\/bufferevent_setcb(ssh_get_fd(ctx->tunnel_session), Connection::socket_to_ssh, NULL, Connection::errorcb, (void*)con);\n\n\tbufferevent_enable(con->socket_event, EV_READ|EV_WRITE);\n\tcon->ssh_event = evtimer_new(base, Connection::ssh_to_socket, (void*)con);\n\t\/\/evtimer_add(con->ssh_event, static_cast<const timeval*>(&tv));\n\t\/\/con->closed = false;\n\n\tstruct ssh_channel_callbacks_struct *channel_cb = new struct ssh_channel_callbacks_struct();\n\n\tchannel_cb->channel_data_function = &Connection::copy_chan_to_fd;\n\tchannel_cb->userdata = con;\n\tssh_callbacks_init(channel_cb);\n\tssh_set_channel_callbacks(forwarding_channel, channel_cb);\n\n\n\t\/\/con->ssh_event = event_new(base, -1, EV_PERSIST, Connection::ssh_to_socket, (void*)con);\n\t\/\/event_add(con->ssh_event, static_cast<const timeval*>(&tv));\n\n}\nvoid\nTunnel::accept_error_cb(struct evconnlistener *listener, void *ptr)\n{\n\tTunnel *ctx = static_cast<Tunnel *>(ptr);\n        struct event_base *base = evconnlistener_get_base(listener);\n        int err = EVUTIL_SOCKET_ERROR();\n        fprintf(stderr, \"Got an error %d (%s) on the listener. \"\n                \"Shutting down.\\n\", err, evutil_socket_error_to_string(err));\n\n        event_base_loopexit(ctx->base, NULL);\n}\n#endif\nTunnel::~Tunnel() {\n\t\/\/ TODO Auto-generated destructor stub\n}\n\nint Tunnel::connect_tunnel(){\n\tcout << \"Entered connect_tunnel\"<<endl;\n\t  int rc = 0;\n\t  ssh_options_set(tunnel_session, SSH_OPTIONS_HOST, middle.getHost().c_str());\n\t  ssh_options_set(tunnel_session, SSH_OPTIONS_USER, middleUser.getUsername().c_str());\n\t  rc = ssh_connect(tunnel_session);\n\t  if (rc != SSH_OK){\n\t\t  cout <<\"Error connecting to \" <<  middle.getHost() << \": \"<< ssh_get_error(tunnel_session)<<endl;\n\t\t  return 1;\n\t  }\n\t  cout <<\"Trying to connect!!!!\" << endl;\n\t  rc = ssh_userauth_none(tunnel_session, NULL);\n\t  if(rc == SSH_AUTH_SUCCESS){\n\t\t  cout << \"Authenticated using method none\" << endl;\n\t  } else {\n\t\t  cout << \"Authentication console with password: '\"<<middleUser.getPassword()<<\"'\"<<endl;\n\t\t  rc = authenticate_kbdint(tunnel_session, middleUser.getPassword().c_str());\n\t\t  if(rc != SSH_AUTH_SUCCESS){\n\t\t\t  cerr << \"Authentication failed: \" << ssh_get_error(tunnel_session) << endl;\n\t\t\t  return 1;\n\t\t  }\n\t  }\n\t  return SSH_OK;\n}\n\nint authenticate_kbdint(ssh_session session, const char *password) {\n     int err;\n\n     err = ssh_userauth_kbdint(session, NULL, NULL);\n     while (err == SSH_AUTH_INFO) {\n         const char *instruction;\n         const char *name;\n         char buffer[128];\n         int i, n;\n\n         name = ssh_userauth_kbdint_getname(session);\n         instruction = ssh_userauth_kbdint_getinstruction(session);\n         n = ssh_userauth_kbdint_getnprompts(session);\n\n         if (name && strlen(name) > 0) {\n             cout <<name << endl;\n         }\n\n         if (instruction && strlen(instruction) > 0) {\n             cout <<instruction << endl;\n         }\n\n         for (i = 0; i < n; i++) {\n             const char *answer;\n             const char *prompt;\n             char echo;\n\n             prompt = ssh_userauth_kbdint_getprompt(session, i, &echo);\n             if (prompt == NULL) {\n                 break;\n             }\n\n             if (echo) {\n                 char *p;\n\n                 if (fgets(buffer, sizeof(buffer), stdin) == NULL) {\n                     return SSH_AUTH_ERROR;\n                 }\n\n                 buffer[sizeof(buffer) - 1] = '\\0';\n                 if ((p = strchr(buffer, '\\n'))) {\n                     *p = '\\0';\n                 }\n\n                 if (ssh_userauth_kbdint_setanswer(session, i, buffer) < 0) {\n                     return SSH_AUTH_ERROR;\n                 }\n\n                 memset(buffer, 0, strlen(buffer));\n             } else {\n                 if (password && strstr(prompt, \"Password:\")) {\n                     answer = password;\n                 } else {\n                     buffer[0] = '\\0';\n\n                     if (ssh_getpass(prompt, buffer, sizeof(buffer), 0, 0) < 0) {\n                         return SSH_AUTH_ERROR;\n                     }\n                     answer = buffer;\n                 }\n                 err = ssh_userauth_kbdint_setanswer(session, i, answer);\n                 memset(buffer, 0, sizeof(buffer));\n                 if (err < 0) {\n                     return SSH_AUTH_ERROR;\n                 }\n             }\n         }\n         err=ssh_userauth_kbdint(session,NULL,NULL);\n     }\n\n     return err;\n}\nint Connection::MAX_READ = 2048;\nConnection::Connection(Tunnel* parent, int socket, ssh_channel forwarding_channel):\n\tparent(parent),\n\tsocket(socket),\n\tfw_channel(forwarding_channel){\n\tcout << \"Create connection!!\"<<endl;\n\t\/\/ TODO Auto-generated constructor stub\n\n}\n\nConnection::~Connection() {\n\t\/\/ TODO Auto-generated destructor stub\n}\n\nvoid\nConnection::socket_to_ssh(struct bufferevent *bev, void *ctx){\n\tcout << \"Entered socket_to_ssh\"<<endl;\n\n\tConnection * con = static_cast<Connection *>(ctx);\n\tchar readBuff[MAX_READ];\n\tint readLen;\n\tstruct evbuffer *input = bufferevent_get_input(bev);\n\twhile ((readLen = evbuffer_remove(input, readBuff, sizeof(readBuff))) > 0) {\n\t\treadBuff[readLen] = 0;\n\t\tssh_channel_write(con->fw_channel, readBuff, readLen);\n\t}\n\n\n\tcout << \"Exit socket_to_ssh\"<<endl;\n}\nvoid\nConnection::ssh_to_socket2(struct bufferevent *bev, void *ctx){\n\tcout << \"Entered ssh_to_socket\"<<endl;\n\tConnection * con = static_cast<Connection *>(ctx);\n\tchar readBuff[MAX_READ];\n\tint r;\n\tint lus;\n\twhile(con->fw_channel && ssh_channel_is_open(con->fw_channel) && (r = ssh_channel_poll(con->fw_channel,0))!=0){\n\t        lus=ssh_channel_read(con->fw_channel,readBuff,sizeof(readBuff) > r ? r : sizeof(readBuff),0);\n\t        if(lus==-1){\n\t            fprintf(stderr, \"Error reading channel: %s\\n\",\n\t                    ssh_get_error(con->fw_channel));\n\t            return;\n\t        }\n\t        if(lus!=0){\n\t        \tevbuffer_add_printf(bufferevent_get_output(bev), \"%s\", readBuff);\n\t        }\n\t}\n\tcout << \"Exit ssh_to_socket\"<<endl;\n}\nvoid\nConnection::ssh_to_socket(int fd, short event, void *arg){\n\tcout << \"Entered ssh_to_socket\"<<endl;\n\tConnection * con = static_cast<Connection *>(arg);\n\tchar readBuff[MAX_READ];\n\tint r;\n\tint lus;\n\twhile(con->fw_channel && ssh_channel_is_open(con->fw_channel) && (r = ssh_channel_poll(con->fw_channel,0))!=0){\n\t        lus=ssh_channel_read(con->fw_channel,readBuff,sizeof(readBuff) > r ? r : sizeof(readBuff),0);\n\t        if(lus==-1){\n\t            fprintf(stderr, \"Error reading channel: %s\\n\",\n\t                    ssh_get_error(con->fw_channel));\n\t            goto RETRIGGER_TIMER;\n\t        }\n\t        if(lus!=0){\n\t        \t\/\/evbuffer_add_printf(bufferevent_get_output(con->socket_event), \"%s\", readBuff);\n\t        \twrite(con->socket, readBuff, lus);\n\t        }\n\t}\n\tcout << \"Exit ssh_to_socket\"<<endl;\nRETRIGGER_TIMER:\n\tif( con->closed )\n\t\treturn;\n\tevtimer_del(con->ssh_event);\n\tstruct timeval tv;\n\n\ttv.tv_sec = 0;\n\ttv.tv_usec = 10;\n\tcon->ssh_event = evtimer_new(con->parent->base, Connection::ssh_to_socket, (void*)con);\n\tevtimer_add(con->ssh_event, static_cast<const timeval*>(&tv));\n}\n\n\nvoid\nConnection::errorcb(struct bufferevent *bev, short events, void *ctx)\n{\n\tConnection * con = static_cast<Connection *>(ctx);\n\tint finished = 0;\n    if (events & BEV_EVENT_EOF) {\n        \/* connection has been closed, do any clean up here *\/\n    \tcout << \"Closing connection with:\" << con->parent->destination.getHost()<<endl;\n    \tfinished = 1;\n    \tevtimer_del(con->ssh_event);\n\n    } else if (events & BEV_EVENT_ERROR) {\n        \/* check errno to see what error occurred *\/\n    \tcout << \"Closing connection with:\" << evutil_socket_error_to_string(EVUTIL_SOCKET_ERROR())<<endl;\n\t\tfinished = 1;\n    } else if (events & BEV_EVENT_TIMEOUT) {\n        \/* must be a timeout event handle, handle it *\/\n        \/* ... *\/\n    \tevtimer_del(con->ssh_event);\n    }\n\n    if (finished) {\n        free(ctx);\n        bufferevent_free(bev);\n    }\n    bufferevent_free(bev);\n}\nint\nConnection::copy_chan_to_fd(ssh_session session,\n                                           ssh_channel channel,\n                                           void *data,\n                                           uint32_t len,\n                                           int is_stderr,\n                                           void *userdata) {\n    Connection* con = static_cast<Connection *>(userdata);\n    int sz;\n    (void)session;\n    (void)channel;\n    (void)is_stderr;\n\n    sz = write(con->socket, data, len);\n    cout << \"Copy_chan called\"<<endl;\n    return sz;\n}\n<commit_msg>Working tunnel<commit_after>\/*\n * Tunnel.cpp\n *\n *  Created on: Apr 2, 2014\n *      Author: joao\n *\/\n\n#include \"Tunnel.hpp\"\n#include <unistd.h>\n#include <string.h>\nusing namespace std;\nint authenticate_kbdint(ssh_session session, const char *password);\n\nTunnel::Tunnel(struct event_base *base, int localPort, Address destination, Address middle, User middleUser):\n\tbase(base),\n\tlocalPort(localPort),\n\tdestination(destination),\n\tmiddle(middle),\n\tmiddleUser(middleUser),\n\tthr(nullptr),\n\ttunnel_session(ssh_new()){\n}\n\nbool\nTunnel::start(){\n\tcout << \"Starting tunnel\"<< endl;\n\tthr = new thread(&Tunnel::run, *this);\n}\n\nint\nTunnel::run(){\n\tstruct sockaddr_in sin;\n\tbase = event_base_new();\n\tif (!base)\n\t\treturn false; \/*XXXerr*\/\n\n\tsin.sin_family = AF_INET;\n\tsin.sin_addr.s_addr = 0;\n\tsin.sin_port = htons(localPort);\n#if !USE_LISTENER\n\tlistener = socket(AF_INET, SOCK_STREAM, 0);\n\n\tevutil_make_socket_nonblocking(listener);\n\n\tif (bind(listener, (struct sockaddr*)&sin, sizeof(sin)) < 0) {\n\t\tperror(\"bind\");\n\t\treturn false;\n\t}\n\n\tif (listen(listener, 16)<0) {\n\t\tperror(\"listen\");\n\t\treturn false;\n\t}\n\n\t\/\/listener_event = event_new(base, listener, EV_READ|EV_PERSIST, do_accept, (void*)this);\n\t\/*XXX check it *\/\n\t\/\/event_add(listener_event, NULL);\n\t\/* We now have a listening socket, we create a read event to\n\t * be notified when a client connects. *\/\n\tevent_set(&listener_event, listener, EV_READ|EV_PERSIST, do_accept, (void *)this);\n\tevent_base_set(base, &listener_event);\n\tevent_add(&listener_event, NULL);\n#else\n\tlistener = evconnlistener_new_bind(base, accept_conn_cb, (void*)this,\n\t\t\tLEV_OPT_CLOSE_ON_FREE|LEV_OPT_REUSEABLE, -1,\n\t\t\t(struct sockaddr*)&sin, sizeof(sin));\n\t\tif (!listener) {\n\t\t\t\tperror(\"Couldn't create listener\");\n\t\t\t\treturn false;\n\t\t}\n\t\tevconnlistener_set_error_cb(listener, accept_error_cb);\n#endif\n\ttunnel_session = ssh_new();\n\tif( SSH_OK != connect_tunnel() ){\n\t\t cout << \"Error connecting.....\" << endl;\n\t\t return false;\n\t }\n\n\n\n\n\n\tevent_base_dispatch(base);\n\treturn true;\n}\n\nbool\nTunnel::stop(){\n\n\treturn false;\n}\n#if !USE_LISTENER\nvoid\nTunnel::do_accept(int errcode, short int addr, void *ptr) {\n\tcout << \"Entered do_accept\"<<endl;\n    Tunnel *ctx = static_cast<Tunnel *>(ptr);\n\n\tstruct sockaddr_storage ss;\n\tsocklen_t slen = sizeof(ss);\n\tint fd = accept(ctx->listener, (struct sockaddr*)&ss, &slen);\n\tif (fd < 0) {\n\t\tperror(\"accept\");\n\t} else if (fd > FD_SETSIZE) {\n\t\tclose(fd);\n\t} else {\n\t\tstruct bufferevent *bev;\n\t\tevutil_make_socket_nonblocking(fd);\n\t\tConnection *con = new Connection(ctx, fd);\n\t\tbev = bufferevent_socket_new(ctx->base, fd, BEV_OPT_CLOSE_ON_FREE);\n\t\tbufferevent_setcb(bev, Connection::socket_to_ssh, NULL, Connection::errorcb, (void*)con);\n\t\tbufferevent_setwatermark(bev, EV_READ, 0, 2048);\n\t\tbufferevent_enable(bev, EV_READ|EV_WRITE);\n\t}\n\n}\n#else\n\nvoid\nTunnel::accept_conn_cb(struct evconnlistener *listener,\n    evutil_socket_t fd, struct sockaddr *address, int socklen,\n    void *ptr)\n{\n\tTunnel *ctx = static_cast<Tunnel *>(ptr);\n\tssh_channel forwarding_channel;\n\tstruct timeval tv;\n\n\ttv.tv_sec = 0;\n\ttv.tv_usec = 10;\n\tforwarding_channel = ssh_channel_new(ctx->tunnel_session);\n\tssh_set_log_level( SSH_LOG_TRACE );\n\tif (forwarding_channel == NULL) {\n\t\treturn;\n\t}\n\tint rc = ssh_channel_open_forward(forwarding_channel,\n\t\t\t\t\t\t\t\t\tctx->destination.getHost().c_str(), ctx->destination.getPort(),\n\t\t\t\t\t\t\t\t\t\"localhost\", ctx->localPort);\n\tif (rc != SSH_OK)\n\t{\n\t\tssh_channel_free(forwarding_channel);\n\t\treturn;\n\t}\n\n\n\t\/* We got a new connection! Set up a bufferevent for it. *\/\n\tstruct event_base *base = evconnlistener_get_base(listener);\n\tConnection *con = new Connection(ctx, fd, forwarding_channel);\n\tcon->socket_event = bufferevent_socket_new(\n\t\t\tctx->base, fd, BEV_OPT_CLOSE_ON_FREE);\n\n\tbufferevent_setcb(con->socket_event, Connection::socket_to_ssh, NULL, Connection::errorcb, (void*)con);\n\t\/\/bufferevent_setcb(ssh_get_fd(ctx->tunnel_session), Connection::socket_to_ssh, NULL, Connection::errorcb, (void*)con);\n\n\tbufferevent_enable(con->socket_event, EV_READ|EV_WRITE);\n\tcon->ssh_event = evtimer_new(base, Connection::ssh_to_socket, (void*)con);\n\tevtimer_add(con->ssh_event, static_cast<const timeval*>(&tv));\n\t\/\/con->closed = false;\n\n\tstruct ssh_channel_callbacks_struct *channel_cb = new struct ssh_channel_callbacks_struct();\n\n\tchannel_cb->channel_data_function = &Connection::copy_chan_to_fd;\n\tchannel_cb->userdata = con;\n\tssh_callbacks_init(channel_cb);\n\tssh_set_channel_callbacks(con->fw_channel, channel_cb);\n\n\n\t\/\/con->ssh_event = event_new(base, -1, EV_PERSIST, Connection::ssh_to_socket, (void*)con);\n\t\/\/event_add(con->ssh_event, static_cast<const timeval*>(&tv));\n\n}\nvoid\nTunnel::accept_error_cb(struct evconnlistener *listener, void *ptr)\n{\n\tTunnel *ctx = static_cast<Tunnel *>(ptr);\n        struct event_base *base = evconnlistener_get_base(listener);\n        int err = EVUTIL_SOCKET_ERROR();\n        fprintf(stderr, \"Got an error %d (%s) on the listener. \"\n                \"Shutting down.\\n\", err, evutil_socket_error_to_string(err));\n\n        event_base_loopexit(ctx->base, NULL);\n}\n#endif\nTunnel::~Tunnel() {\n\t\/\/ TODO Auto-generated destructor stub\n}\n\nint Tunnel::connect_tunnel(){\n\tcout << \"Entered connect_tunnel\"<<endl;\n\t  int rc = 0;\n\t  ssh_options_set(tunnel_session, SSH_OPTIONS_HOST, middle.getHost().c_str());\n\t  ssh_options_set(tunnel_session, SSH_OPTIONS_USER, middleUser.getUsername().c_str());\n\t  rc = ssh_connect(tunnel_session);\n\t  if (rc != SSH_OK){\n\t\t  cout <<\"Error connecting to \" <<  middle.getHost() << \": \"<< ssh_get_error(tunnel_session)<<endl;\n\t\t  return 1;\n\t  }\n\t  cout <<\"Trying to connect!!!!\" << endl;\n\t  rc = ssh_userauth_none(tunnel_session, NULL);\n\t  if(rc == SSH_AUTH_SUCCESS){\n\t\t  cout << \"Authenticated using method none\" << endl;\n\t  } else {\n\t\t  cout << \"Authentication console with password: '\"<<middleUser.getPassword()<<\"'\"<<endl;\n\t\t  rc = authenticate_kbdint(tunnel_session, middleUser.getPassword().c_str());\n\t\t  if(rc != SSH_AUTH_SUCCESS){\n\t\t\t  cerr << \"Authentication failed: \" << ssh_get_error(tunnel_session) << endl;\n\t\t\t  return 1;\n\t\t  }\n\t  }\n\t  return SSH_OK;\n}\n\nint authenticate_kbdint(ssh_session session, const char *password) {\n     int err;\n\n     err = ssh_userauth_kbdint(session, NULL, NULL);\n     while (err == SSH_AUTH_INFO) {\n         const char *instruction;\n         const char *name;\n         char buffer[128];\n         int i, n;\n\n         name = ssh_userauth_kbdint_getname(session);\n         instruction = ssh_userauth_kbdint_getinstruction(session);\n         n = ssh_userauth_kbdint_getnprompts(session);\n\n         if (name && strlen(name) > 0) {\n             cout <<name << endl;\n         }\n\n         if (instruction && strlen(instruction) > 0) {\n             cout <<instruction << endl;\n         }\n\n         for (i = 0; i < n; i++) {\n             const char *answer;\n             const char *prompt;\n             char echo;\n\n             prompt = ssh_userauth_kbdint_getprompt(session, i, &echo);\n             if (prompt == NULL) {\n                 break;\n             }\n\n             if (echo) {\n                 char *p;\n\n                 if (fgets(buffer, sizeof(buffer), stdin) == NULL) {\n                     return SSH_AUTH_ERROR;\n                 }\n\n                 buffer[sizeof(buffer) - 1] = '\\0';\n                 if ((p = strchr(buffer, '\\n'))) {\n                     *p = '\\0';\n                 }\n\n                 if (ssh_userauth_kbdint_setanswer(session, i, buffer) < 0) {\n                     return SSH_AUTH_ERROR;\n                 }\n\n                 memset(buffer, 0, strlen(buffer));\n             } else {\n                 if (password && strstr(prompt, \"Password:\")) {\n                     answer = password;\n                 } else {\n                     buffer[0] = '\\0';\n\n                     if (ssh_getpass(prompt, buffer, sizeof(buffer), 0, 0) < 0) {\n                         return SSH_AUTH_ERROR;\n                     }\n                     answer = buffer;\n                 }\n                 err = ssh_userauth_kbdint_setanswer(session, i, answer);\n                 memset(buffer, 0, sizeof(buffer));\n                 if (err < 0) {\n                     return SSH_AUTH_ERROR;\n                 }\n             }\n         }\n         err=ssh_userauth_kbdint(session,NULL,NULL);\n     }\n\n     return err;\n}\nint Connection::MAX_READ = 2048;\nConnection::Connection(Tunnel* parent, int socket, ssh_channel forwarding_channel):\n\tparent(parent),\n\tsocket(socket),\n\tfw_channel(forwarding_channel){\n\tcout << \"Create connection!!\"<<endl;\n\t\/\/ TODO Auto-generated constructor stub\n\n}\n\nConnection::~Connection() {\n\t\/\/ TODO Auto-generated destructor stub\n}\n\nvoid\nConnection::socket_to_ssh(struct bufferevent *bev, void *ctx){\n\tcout << \"Entered socket_to_ssh\"<<endl;\n\n\tConnection * con = static_cast<Connection *>(ctx);\n\tchar readBuff[MAX_READ];\n\tint readLen;\n\tstruct evbuffer *input = bufferevent_get_input(bev);\n\twhile ((readLen = evbuffer_remove(input, readBuff, sizeof(readBuff))) > 0) {\n\t\treadBuff[readLen] = 0;\n\t\tssh_channel_write(con->fw_channel, readBuff, readLen);\n\t}\n\n\n\tcout << \"Exit socket_to_ssh\"<<endl;\n}\nvoid\nConnection::ssh_to_socket2(struct bufferevent *bev, void *ctx){\n\tcout << \"Entered ssh_to_socket\"<<endl;\n\tConnection * con = static_cast<Connection *>(ctx);\n\tchar readBuff[MAX_READ];\n\tint r;\n\tint lus;\n\twhile(con->fw_channel && ssh_channel_is_open(con->fw_channel) && (r = ssh_channel_poll(con->fw_channel,0))!=0){\n\t        lus=ssh_channel_read(con->fw_channel,readBuff,sizeof(readBuff) > r ? r : sizeof(readBuff),0);\n\t        if(lus==-1){\n\t            fprintf(stderr, \"Error reading channel: %s\\n\",\n\t                    ssh_get_error(con->fw_channel));\n\t            return;\n\t        }\n\t        if(lus!=0){\n\t        \tevbuffer_add_printf(bufferevent_get_output(bev), \"%s\", readBuff);\n\t        }\n\t}\n\tcout << \"Exit ssh_to_socket\"<<endl;\n}\nvoid\nConnection::ssh_to_socket(int fd, short event, void *arg){\n\t\/\/cout << \"Entered ssh_to_socket\"<<endl;\n\tConnection * con = static_cast<Connection *>(arg);\n\t\/*char readBuff[MAX_READ];\n\tint r;\n\tint lus;\n\twhile(con->fw_channel && ssh_channel_is_open(con->fw_channel) && (r = ssh_channel_poll(con->fw_channel,0))!=0){\n\t        lus=ssh_channel_read(con->fw_channel,readBuff,sizeof(readBuff) > r ? r : sizeof(readBuff),0);\n\t        if(lus==-1){\n\t            fprintf(stderr, \"Error reading channel: %s\\n\",\n\t                    ssh_get_error(con->fw_channel));\n\t            goto RETRIGGER_TIMER;\n\t        }\n\t        if(lus!=0){\n\t        \t\/\/evbuffer_add_printf(bufferevent_get_output(con->socket_event), \"%s\", readBuff);\n\t        \twrite(con->socket, readBuff, lus);\n\t        }\n\t}\n\tcout << \"Exit ssh_to_socket\"<<endl;\nRETRIGGER_TIMER:*\/\n\tssh_channel_poll(con->fw_channel,0);\n\tif( con->closed )\n\t\treturn;\n\tevtimer_del(con->ssh_event);\n\tstruct timeval tv;\n\n\ttv.tv_sec = 0;\n\ttv.tv_usec = 10;\n\tcon->ssh_event = evtimer_new(con->parent->base, Connection::ssh_to_socket, (void*)con);\n\tevtimer_add(con->ssh_event, static_cast<const timeval*>(&tv));\n}\n\n\nvoid\nConnection::errorcb(struct bufferevent *bev, short events, void *ctx)\n{\n\tConnection * con = static_cast<Connection *>(ctx);\n\tint finished = 0;\n    if (events & BEV_EVENT_EOF) {\n        \/* connection has been closed, do any clean up here *\/\n    \tcout << \"Closing connection with:\" << con->parent->destination.getHost()<<endl;\n    \tfinished = 1;\n    \tevtimer_del(con->ssh_event);\n\n    } else if (events & BEV_EVENT_ERROR) {\n        \/* check errno to see what error occurred *\/\n    \tcout << \"Closing connection with:\" << evutil_socket_error_to_string(EVUTIL_SOCKET_ERROR())<<endl;\n\t\tfinished = 1;\n    } else if (events & BEV_EVENT_TIMEOUT) {\n        \/* must be a timeout event handle, handle it *\/\n        \/* ... *\/\n    \tevtimer_del(con->ssh_event);\n    }\n\n    if (finished) {\n        free(ctx);\n        bufferevent_free(bev);\n    }\n    bufferevent_free(bev);\n}\nint\nConnection::copy_chan_to_fd(ssh_session session,\n                                           ssh_channel channel,\n                                           void *data,\n                                           uint32_t len,\n                                           int is_stderr,\n                                           void *userdata) {\n    Connection* con = static_cast<Connection *>(userdata);\n    int sz;\n    (void)session;\n    (void)channel;\n    (void)is_stderr;\n\n    sz = write(con->socket, data, len);\n    cout << \"Copy_chan called\"<<endl;\n    return sz;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>WebGL: Fix assertion hit of gpu tests.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ $Id$\n\n\/\/**************************************************************************\n\/\/* This file is property of and copyright by the ALICE HLT Project        * \n\/\/* ALICE Experiment at CERN, All rights reserved.                         *\n\/\/*                                                                        *\n\/\/* Primary Authors: Matthias Richter <Matthias.Richter@ift.uib.no>        *\n\/\/*                  for The ALICE HLT Project.                            *\n\/\/*                                                                        *\n\/\/* Permission to use, copy, modify and distribute this software and its   *\n\/\/* documentation strictly for non-commercial purposes is hereby granted   *\n\/\/* without fee, provided that the above copyright notice appears in all   *\n\/\/* copies and that both the copyright notice and this permission notice   *\n\/\/* appear in the supporting documentation. The authors make no claims     *\n\/\/* about the suitability of this software for any purpose. It is          *\n\/\/* provided \"as is\" without express or implied warranty.                  *\n\/\/**************************************************************************\n\n\/** @file   AliHLTPluginBase.cxx\n    @author Matthias Richter\n    @date   \n    @brief  Base class for AliRoot HLT plugins.\n*\/\n\n#include \"AliHLTPluginBase.h\"\n#include \"AliHLTSystem.h\"\n#include \"AliHLTDataBuffer.h\"\n\n\/** ROOT macro for the implementation of ROOT specific class methods *\/\nClassImp(AliHLTPluginBase)\n\nAliHLTPluginBase::AliHLTPluginBase()\n{\n  \/\/ see header file for class documentation\n  \/\/ or\n  \/\/ refer to README to build package\n  \/\/ or\n  \/\/ visit http:\/\/web.ift.uib.no\/~kjeks\/doc\/alice-hlt\n  fNofInstances++;\n}\n\nAliHLTPluginBase::~AliHLTPluginBase()\n{\n  \/\/ see header file for class documentation\n  if (--fNofInstances<=0) {\n    delete fpSystem;\n    fpSystem=NULL;\n\n    \/\/ 2010-04-07 not sure whether this is the best place for\n    \/\/ the global cleanup of memory pages. In case of AliReconstruction\n    \/\/ there is no cleanup method for the reconstructor plugins. They\n    \/\/ are just deleted at the end.\n    \/\/ However, here we can assume that some global cleanup takes place\n    \/\/ when we arrive at this point.\n    AliHLTDataBuffer::AliHLTRawPage::GlobalClean();\n  }\n}\n\nvoid AliHLTPluginBase::InitInstance()\n{\n  \/\/ see header file for class documentation\n  if (!fpSystem) fpSystem=new AliHLTSystem;\n}\n\nAliHLTSystem* AliHLTPluginBase::GetInstance()\n{\n  \/\/ see header file for class documentation\n  if (!fpSystem) InitInstance();\n  return fpSystem;\n}\n\n\nAliHLTSystem* AliHLTPluginBase::fpSystem=NULL;\n\nint AliHLTPluginBase::fNofInstances=0;\n<commit_msg>In case AliHLTPluginBase is used from a macro (through static InitInstance() function), AliReconstruction is possibly loaded only later, in which case libHLTbase and libHLTrec are loaded from AliHLTSystem via dlopen and not from AliReconstruction via gSystem->load, in which case the Deconstructor of AliHLTSystem will unload it, which results in a segmentation fault because the deconstructor of AliHLTReconstructor is then no longer present afterward.<commit_after>\/\/ $Id$\n\n\/\/**************************************************************************\n\/\/* This file is property of and copyright by the ALICE HLT Project        * \n\/\/* ALICE Experiment at CERN, All rights reserved.                         *\n\/\/*                                                                        *\n\/\/* Primary Authors: Matthias Richter <Matthias.Richter@ift.uib.no>        *\n\/\/*                  for The ALICE HLT Project.                            *\n\/\/*                                                                        *\n\/\/* Permission to use, copy, modify and distribute this software and its   *\n\/\/* documentation strictly for non-commercial purposes is hereby granted   *\n\/\/* without fee, provided that the above copyright notice appears in all   *\n\/\/* copies and that both the copyright notice and this permission notice   *\n\/\/* appear in the supporting documentation. The authors make no claims     *\n\/\/* about the suitability of this software for any purpose. It is          *\n\/\/* provided \"as is\" without express or implied warranty.                  *\n\/\/**************************************************************************\n\n\/** @file   AliHLTPluginBase.cxx\n    @author Matthias Richter\n    @date   \n    @brief  Base class for AliRoot HLT plugins.\n*\/\n\n#include \"AliHLTPluginBase.h\"\n#include \"AliHLTSystem.h\"\n#include \"AliHLTDataBuffer.h\"\n#include \"TSystem.h\"\n\n\/** ROOT macro for the implementation of ROOT specific class methods *\/\nClassImp(AliHLTPluginBase)\n\nAliHLTPluginBase::AliHLTPluginBase()\n{\n  \/\/ see header file for class documentation\n  \/\/ or\n  \/\/ refer to README to build package\n  \/\/ or\n  \/\/ visit http:\/\/web.ift.uib.no\/~kjeks\/doc\/alice-hlt\n  fNofInstances++;\n}\n\nAliHLTPluginBase::~AliHLTPluginBase()\n{\n  \/\/ see header file for class documentation\n  if (--fNofInstances<=0) {\n    delete fpSystem;\n    fpSystem=NULL;\n\n    \/\/ 2010-04-07 not sure whether this is the best place for\n    \/\/ the global cleanup of memory pages. In case of AliReconstruction\n    \/\/ there is no cleanup method for the reconstructor plugins. They\n    \/\/ are just deleted at the end.\n    \/\/ However, here we can assume that some global cleanup takes place\n    \/\/ when we arrive at this point.\n    AliHLTDataBuffer::AliHLTRawPage::GlobalClean();\n  }\n}\n\nvoid AliHLTPluginBase::InitInstance()\n{\n  \/\/ see header file for class documentation\n  if (fNofInstances == 0)\n  {\n    gSystem->Load(\"libHLTbase\");\n    gSystem->Load(\"libHLTrec\");\n  }\n  if (!fpSystem) fpSystem=new AliHLTSystem;\n}\n\nAliHLTSystem* AliHLTPluginBase::GetInstance()\n{\n  \/\/ see header file for class documentation\n  if (!fpSystem) InitInstance();\n  return fpSystem;\n}\n\n\nAliHLTSystem* AliHLTPluginBase::fpSystem=NULL;\n\nint AliHLTPluginBase::fNofInstances=0;\n<|endoftext|>"}
{"text":"<commit_before>\/**************************************************************************\n * This file is property of and copyright by the ALICE HLT Project        *\n * All rights reserved.                                                   *\n *                                                                        *\n * Primary Authors:                                                       *\n *   Artur Szostak <artursz@iafrica.com>                                  *\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\/\/\/ \\ingroup macros\n\/\/\/ \\file ExtractDDLs.C\n\/\/\/ \\brief Macro for extracting DDL raw data from different AliRawReaders.\n\/\/\/\n\/\/\/ \\author Artur Szostak <artursz@iafrica.com>\n\/\/\/\n\/\/\/ This macro is used to extract DDL raw data files for the muon spectrometer\n\/\/\/ from different data sources using an AliRawReader. This macro will generate\n\/\/\/ directories in the form rawX where X is an integer. This is the typical\n\/\/\/ directory layout generated by AliRoot simulations.\n\/\/\/\n\n#if !defined(__CINT__) || defined(__MAKECINT__)\n#include \"TSystem.h\"\n#include \"TString.h\"\n#include \"AliRawReader.h\"\n#include \"AliRawDataHeader.h\"\n#include \"Riostream.h\"\n#include <fstream>\nusing std::fstream;\n#else\n#error This macro must be compiled.\n#endif\n\n\/**\n * Writes all DDL files for the current event from the AliRawReader.\n *\/\nvoid WriteDDLs(AliRawReader* rawReader, const TString& dir, const char* detector)\n{\n\twhile (rawReader->ReadHeader())\n\t{\n\t\t\/\/ Allocate memory for the DDL.\n\t\tUInt_t bufferSize = rawReader->GetDataSize() + sizeof(AliRawDataHeader);\n\t\tUChar_t* buffer = new UChar_t[bufferSize];\n\t\tif (buffer == NULL)\n\t\t{\n\t\t\tcerr << \"ERROR: Out of memory!\" << endl;\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\t\/\/ Copy the CDH header.\n\t\tmemcpy(buffer, rawReader->GetDataHeader(), sizeof(AliRawDataHeader));\n\t\t\n\t\tUChar_t* payload = buffer + sizeof(AliRawDataHeader);\n\t\tUInt_t payloadSize = bufferSize - sizeof(AliRawDataHeader);\n\t\t\n\t\t\/\/ Now copy the DDL payload.\n\t\tif (! rawReader->ReadNext(payload, payloadSize))\n\t\t{\n\t\t\tcerr << \"ERROR: Failed to read from AliRawReader.\" << endl;\n\t\t\tdelete [] buffer;\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\t\/\/ Write the file.\n\t\tTString filename = dir;\n\t\tfilename += \"\/\";\n\t\tfilename += detector;\n\t\tfilename += \"_\";\n\t\tchar num[32];\n\t\tsprintf(num, \"%d\", rawReader->GetEquipmentId());\n\t\tfilename += num;\n\t\tfilename += \".ddl\";\n\t\t\n\t\tfstream file(filename.Data(), fstream::out | fstream::binary);\n\t\tfile.write((char*)buffer, bufferSize);\n\t\tfile.close();\n\t}\n}\n\n\/**\n * Extracts muon spectrometer raw DDL data files from a data source.\n * \\param dataSource  This is the raw data to use. It can either be a directory name\n *      containing rawX directories with raw DDL files, a .root file containing raw\n *      data or a DATE raw data file.\n * \\param firstEvent The first event number to extract.\n * \\param lastEvent The last event number to extract. If set to a negative number then\n *      all events from <i>firstEvent<\/i> to the end of the data stream is extracted.\n * \\param outputDir  This is the output directory to write the raw data to. The default\n *      is to use the current directory.\n *\/\nvoid ExtractDDLs(\n\t\tconst char* dataSource = \"raw.root\",\n\t\tInt_t firstEvent = 0, Int_t lastEvent = -1,\n\t\tconst char* outputDir = \".\"\n\t)\n{\n\tAliRawReader* rawReader = AliRawReader::Create(dataSource);\n\tif (rawReader == NULL)\n\t{\n\t\tcerr << \"ERROR: Could not create AliRawReader.\" << endl;\n\t\treturn;\n\t}\n\t\n\tInt_t count = 0;\n\tif (lastEvent < 0) lastEvent = rawReader->GetNumberOfEvents() - 1;\n\tInt_t event = firstEvent;\n\trawReader->GotoEvent(firstEvent);\n\twhile (event <= lastEvent)\n\t{\n\t\tchar num[32];\n\t\tsprintf(num, \"%d\", count);\n\t\tTString dir = outputDir;\n\t\tdir += \"\/raw\";\n\t\tdir += num;\n\t\tgSystem->MakeDirectory(dir.Data());\n\t\t\n\t\trawReader->Select(\"MUONTRK\", 0, 19);\n\t\tWriteDDLs(rawReader, dir, \"MUONTRK\");\n\t\trawReader->Select(\"MUONTRG\", 0, 1);\n\t\tWriteDDLs(rawReader, dir, \"MUONTRG\");\n\t\t\n\t\t++count;\n\t\t++event;\n\t\trawReader->NextEvent();\n\t}\n\n\tdelete rawReader;\n}\n\n<commit_msg>Adding missing checks to macro.<commit_after>\/**************************************************************************\n * This file is property of and copyright by the ALICE HLT Project        *\n * All rights reserved.                                                   *\n *                                                                        *\n * Primary Authors:                                                       *\n *   Artur Szostak <artursz@iafrica.com>                                  *\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\/\/\/ \\ingroup macros\n\/\/\/ \\file ExtractDDLs.C\n\/\/\/ \\brief Macro for extracting DDL raw data from different AliRawReaders.\n\/\/\/\n\/\/\/ \\author Artur Szostak <artursz@iafrica.com>\n\/\/\/\n\/\/\/ This macro is used to extract DDL raw data files for the muon spectrometer\n\/\/\/ from different data sources using an AliRawReader. This macro will generate\n\/\/\/ directories in the form rawX where X is an integer. This is the typical\n\/\/\/ directory layout generated by AliRoot simulations.\n\/\/\/\n\n#if !defined(__CINT__) || defined(__MAKECINT__)\n#include \"TSystem.h\"\n#include \"TString.h\"\n#include \"AliRawReader.h\"\n#include \"AliRawDataHeader.h\"\n#include \"Riostream.h\"\n#include <fstream>\nusing std::fstream;\n#else\n#error This macro must be compiled.\n#endif\n\n\/**\n * Writes all DDL files for the current event from the AliRawReader.\n *\/\nvoid WriteDDLs(AliRawReader* rawReader, const TString& dir, const char* detector)\n{\n\twhile (rawReader->ReadHeader())\n\t{\n\t\t\/\/ Allocate memory for the DDL.\n\t\tUInt_t bufferSize = rawReader->GetDataSize() + sizeof(AliRawDataHeader);\n\t\tUChar_t* buffer = new UChar_t[bufferSize];\n\t\tif (buffer == NULL)\n\t\t{\n\t\t\tcerr << \"ERROR: Out of memory!\" << endl;\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\t\/\/ Copy the CDH header.\n\t\tmemcpy(buffer, rawReader->GetDataHeader(), sizeof(AliRawDataHeader));\n\t\t\n\t\tUChar_t* payload = buffer + sizeof(AliRawDataHeader);\n\t\tUInt_t payloadSize = bufferSize - sizeof(AliRawDataHeader);\n\t\t\n\t\t\/\/ Now copy the DDL payload.\n\t\tif (! rawReader->ReadNext(payload, payloadSize))\n\t\t{\n\t\t\tcerr << \"ERROR: Failed to read from AliRawReader.\" << endl;\n\t\t\tdelete [] buffer;\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\t\/\/ Write the file.\n\t\tTString filename = dir;\n\t\tfilename += \"\/\";\n\t\tfilename += detector;\n\t\tfilename += \"_\";\n\t\tchar num[32];\n\t\tsprintf(num, \"%d\", rawReader->GetEquipmentId());\n\t\tfilename += num;\n\t\tfilename += \".ddl\";\n\t\t\n\t\tfstream file(filename.Data(), fstream::out | fstream::binary);\n\t\tif (! file)\n\t\t{\n\t\t\tcerr << \"ERROR: Could not create file: \" << filename.Data() << endl;\n\t\t\tdelete [] buffer;\n\t\t\tcontinue;\n\t\t}\n\t\tfile.write((char*)buffer, bufferSize);\n\t\tif (! file)\n\t\t{\n\t\t\tcerr << \"ERROR: Failed to write to file: \" << filename.Data() << endl;\n\t\t\tfile.close();\n\t\t\tdelete [] buffer;\n\t\t\tcontinue;\n\t\t}\n\t\tfile.close();\n\t\t\n\t\tdelete [] buffer;\n\t}\n}\n\n\/**\n * Extracts muon spectrometer raw DDL data files from a data source.\n * \\param dataSource  This is the raw data to use. It can either be a directory name\n *      containing rawX directories with raw DDL files, a .root file containing raw\n *      data or a DATE raw data file.\n * \\param firstEvent The first event number to extract.\n * \\param lastEvent The last event number to extract. If set to a negative number then\n *      all events from <i>firstEvent<\/i> to the end of the data stream is extracted.\n * \\param outputDir  This is the output directory to write the raw data to. The default\n *      is to use the current directory.\n *\/\nvoid ExtractDDLs(\n\t\tconst char* dataSource = \"raw.root\",\n\t\tInt_t firstEvent = 0, Int_t lastEvent = -1,\n\t\tconst char* outputDir = \".\"\n\t)\n{\n\tAliRawReader* rawReader = AliRawReader::Create(dataSource);\n\tif (rawReader == NULL)\n\t{\n\t\tcerr << \"ERROR: Could not create AliRawReader.\" << endl;\n\t\treturn;\n\t}\n\t\n\tInt_t count = 0;\n\tif (lastEvent < 0) lastEvent = rawReader->GetNumberOfEvents() - 1;\n\tInt_t event = firstEvent;\n\trawReader->GotoEvent(firstEvent);\n\twhile (event <= lastEvent)\n\t{\n\t\tchar num[32];\n\t\tsprintf(num, \"%d\", count);\n\t\tTString dir = outputDir;\n\t\tdir += \"\/raw\";\n\t\tdir += num;\n\t\tif (gSystem->MakeDirectory(dir.Data()) != 0)\n\t\t{\n\t\t\tcerr << \"ERROR: Could not create directory: \" << dir.Data() << endl;\n\t\t}\n\t\telse\n\t\t{\n\t\t\trawReader->Select(\"MUONTRK\", 0, 19);\n\t\t\tWriteDDLs(rawReader, dir, \"MUONTRK\");\n\t\t\trawReader->Select(\"MUONTRG\", 0, 1);\n\t\t\tWriteDDLs(rawReader, dir, \"MUONTRG\");\n\t\t}\n\t\t++count;\n\t\t++event;\n\t\trawReader->NextEvent();\n\t}\n\n\tdelete rawReader;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <algorithm>\n#include <array>\n#include <cassert>\n#include <cstdint>\n#include <vector>\n\n#include \"hash.hpp\"\n#include \"slice.hpp\"\n\nuint64_t readVI (Slice& data) {\n\tconst auto i = data.read<uint8_t>();\n\n\tif (i < 253) return static_cast<uint64_t>(i);\n\tif (i < 254) return static_cast<uint64_t>(data.read<uint16_t>());\n\tif (i < 255) return static_cast<uint64_t>(data.read<uint32_t>());\n\treturn data.read<uint64_t>();\n}\n\nstruct Transaction {\n\tstruct Input {\n\t\tSlice data;\n\n\t\tSlice hash;\n\t\tuint32_t vout;\n\t\tSlice script;\n\t\tuint32_t sequence;\n\n\t\tInput () {}\n\t\tInput (\n\t\t\tSlice data,\n\t\t\tSlice hash,\n\t\t\tuint32_t vout,\n\t\t\tSlice script,\n\t\t\tuint32_t sequence\n\t\t) :\n\t\t\tdata(data),\n\t\t\thash(hash),\n\t\t\tvout(vout),\n\t\t\tscript(script),\n\t\t\tsequence(sequence) {}\n\t};\n\n\tstruct Output {\n\t\tSlice data;\n\n\t\tSlice script;\n\t\tuint64_t value;\n\n\t\tOutput () {}\n\t\tOutput (\n\t\t\tSlice data,\n\t\t\tSlice script,\n\t\t\tuint64_t value\n\t\t) :\n\t\t\tdata(data),\n\t\t\tscript(script),\n\t\t\tvalue(value) {}\n\t};\n\n\tSlice data;\n\tuint32_t version;\n\n\tstd::vector<Input> inputs;\n\tstd::vector<Output> outputs;\n\n\tuint32_t locktime;\n\n\tTransaction () {}\n\tTransaction (\n\t\tSlice data,\n\t\tuint32_t version,\n\t\tstd::vector<Input> inputs,\n\t\tstd::vector<Output> outputs,\n\t\tuint32_t locktime\n\t) :\n\t\tdata(data),\n\t\tversion(version),\n\t\tinputs(inputs),\n\t\toutputs(outputs),\n\t\tlocktime(locktime) {}\n};\n\nnamespace {\n\tauto readSlice (Slice& data, uint64_t n) {\n\t\tauto slice = data.take(n);\n\t\tdata.popFrontN(n);\n\t\treturn slice;\n\t}\n}\n\nstruct TransactionRange {\nprivate:\n\tuint64_t n;\n\tSlice data;\n\n\tTransaction current;\n\tbool lazy = true;\n\n\tauto readTransaction () {\n\t\tconst auto source = this->data;\n\t\tconst auto version = this->data.read<uint32_t>();\n\n\t\tconst auto nInputs = readVI(this->data);\n\n\t\tstd::vector<Transaction::Input> inputs;\n\t\tfor (size_t i = 0; i < nInputs; ++i) {\n\t\t\tconst auto idataSource = this->data;\n\t\t\tauto hash = readSlice(this->data, 32);\n\t\t\tauto vout = this->data.read<uint32_t>();\n\n\t\t\tauto SL = readVI(this->data);\n\t\t\tauto script = readSlice(this->data, SL);\n\t\t\tauto sequence = this->data.read<uint32_t>();\n\n\t\t\tconst auto idata = Slice(idataSource.begin, this->data.begin);\n\t\t\tinputs.emplace_back(\n\t\t\t\tTransaction::Input(idata, hash, vout, script, sequence)\n\t\t\t);\n\t\t}\n\n\t\tconst auto nOutputs = readVI(this->data);\n\n\t\tstd::vector<Transaction::Output> outputs;\n\t\tfor (size_t i = 0; i < nOutputs; ++i) {\n\t\t\tconst auto odataSource = this->data;\n\t\t\tauto value = this->data.read<uint64_t>();\n\n\t\t\tauto SL = readVI(this->data);\n\t\t\tauto script = readSlice(this->data, SL);\n\n\t\t\tconst auto odata = Slice(odataSource.begin, this->data.begin);\n\t\t\toutputs.emplace_back(Transaction::Output(odata, script, value));\n\t\t}\n\n\t\tconst auto locktime = this->data.read<uint32_t>();\n\t\tauto tdata = source.take(source.length() - this->data.length());\n\n\t\tthis->current = Transaction(tdata, version, inputs, outputs, locktime);\n\t\tthis->lazy = false;\n\t}\n\npublic:\n\tTransactionRange(size_t n, Slice data) : n(n), data(data) {}\n\n\tauto empty () const { return this->n == 0; }\n\tauto length () const { return this->n; }\n\tauto front () {\n\t\tif (this->lazy) {\n\t\t\tthis->readTransaction();\n\t\t}\n\n\t\treturn this->current;\n\t}\n\n\tvoid popFront () {\n\t\tthis->n--;\n\n\t\tif (this->n > 0) {\n\t\t\tthis->readTransaction();\n\t\t}\n\t}\n};\n\nstruct Block {\n\tSlice header, data;\n\n\tBlock(Slice header) : header(header) {\n\t\tassert(header.length() == 80);\n\t}\n\n\tBlock(Slice header, Slice data) : header(header), data(data) {\n\t\tassert(header.length() == 80);\n\t}\n\n\tstatic void calculateTarget (uint8_t* dest, uint32_t bits) {\n\t\tconst auto exponent = ((bits & 0xff000000) >> 24) - 3;\n\t\tconst auto mantissa = bits & 0x007fffff;\n\t\tconst auto i = static_cast<size_t>(31 - exponent);\n\t\tif (i > 31) return;\n\n\t\tdest[i] = static_cast<uint8_t>(mantissa & 0xff);\n\t\tdest[i - 1] = static_cast<uint8_t>(mantissa >> 8);\n\t\tdest[i - 2] = static_cast<uint8_t>(mantissa >> 16);\n\t\tdest[i - 3] = static_cast<uint8_t>(mantissa >> 24);\n\t}\n\n\tauto transactions () const {\n\t\tauto _data = this->data;\n\t\tconst auto n = readVI(_data);\n\n\t\treturn TransactionRange(n, _data);\n\t}\n\n\tauto verify () const {\n\t\tuint8_t hash[32];\n\t\tuint8_t target[32] = {};\n\n\t\thash256(hash, this->header);\n\t\tstd::reverse(hash, hash + 32);\n\n\t\tconst auto bits = *(reinterpret_cast<uint32_t*>(this->header.begin + 72));\n\t\tBlock::calculateTarget(target, bits);\n\n\t\treturn memcmp(hash, target, 32) <= 0;\n\t}\n};\n<commit_msg>block: add TODO to verify more laziness for range popFront<commit_after>#pragma once\n\n#include <algorithm>\n#include <array>\n#include <cassert>\n#include <cstdint>\n#include <vector>\n\n#include \"hash.hpp\"\n#include \"slice.hpp\"\n\nuint64_t readVI (Slice& data) {\n\tconst auto i = data.read<uint8_t>();\n\n\tif (i < 253) return static_cast<uint64_t>(i);\n\tif (i < 254) return static_cast<uint64_t>(data.read<uint16_t>());\n\tif (i < 255) return static_cast<uint64_t>(data.read<uint32_t>());\n\treturn data.read<uint64_t>();\n}\n\nstruct Transaction {\n\tstruct Input {\n\t\tSlice data;\n\n\t\tSlice hash;\n\t\tuint32_t vout;\n\t\tSlice script;\n\t\tuint32_t sequence;\n\n\t\tInput () {}\n\t\tInput (\n\t\t\tSlice data,\n\t\t\tSlice hash,\n\t\t\tuint32_t vout,\n\t\t\tSlice script,\n\t\t\tuint32_t sequence\n\t\t) :\n\t\t\tdata(data),\n\t\t\thash(hash),\n\t\t\tvout(vout),\n\t\t\tscript(script),\n\t\t\tsequence(sequence) {}\n\t};\n\n\tstruct Output {\n\t\tSlice data;\n\n\t\tSlice script;\n\t\tuint64_t value;\n\n\t\tOutput () {}\n\t\tOutput (\n\t\t\tSlice data,\n\t\t\tSlice script,\n\t\t\tuint64_t value\n\t\t) :\n\t\t\tdata(data),\n\t\t\tscript(script),\n\t\t\tvalue(value) {}\n\t};\n\n\tSlice data;\n\tuint32_t version;\n\n\tstd::vector<Input> inputs;\n\tstd::vector<Output> outputs;\n\n\tuint32_t locktime;\n\n\tTransaction () {}\n\tTransaction (\n\t\tSlice data,\n\t\tuint32_t version,\n\t\tstd::vector<Input> inputs,\n\t\tstd::vector<Output> outputs,\n\t\tuint32_t locktime\n\t) :\n\t\tdata(data),\n\t\tversion(version),\n\t\tinputs(inputs),\n\t\toutputs(outputs),\n\t\tlocktime(locktime) {}\n};\n\nnamespace {\n\tauto readSlice (Slice& data, uint64_t n) {\n\t\tauto slice = data.take(n);\n\t\tdata.popFrontN(n);\n\t\treturn slice;\n\t}\n}\n\nstruct TransactionRange {\nprivate:\n\tuint64_t n;\n\tSlice data;\n\n\tTransaction current;\n\tbool lazy = true;\n\n\tauto readTransaction () {\n\t\tconst auto source = this->data;\n\t\tconst auto version = this->data.read<uint32_t>();\n\n\t\tconst auto nInputs = readVI(this->data);\n\n\t\tstd::vector<Transaction::Input> inputs;\n\t\tfor (size_t i = 0; i < nInputs; ++i) {\n\t\t\tconst auto idataSource = this->data;\n\t\t\tauto hash = readSlice(this->data, 32);\n\t\t\tauto vout = this->data.read<uint32_t>();\n\n\t\t\tauto SL = readVI(this->data);\n\t\t\tauto script = readSlice(this->data, SL);\n\t\t\tauto sequence = this->data.read<uint32_t>();\n\n\t\t\tconst auto idata = Slice(idataSource.begin, this->data.begin);\n\t\t\tinputs.emplace_back(\n\t\t\t\tTransaction::Input(idata, hash, vout, script, sequence)\n\t\t\t);\n\t\t}\n\n\t\tconst auto nOutputs = readVI(this->data);\n\n\t\tstd::vector<Transaction::Output> outputs;\n\t\tfor (size_t i = 0; i < nOutputs; ++i) {\n\t\t\tconst auto odataSource = this->data;\n\t\t\tauto value = this->data.read<uint64_t>();\n\n\t\t\tauto SL = readVI(this->data);\n\t\t\tauto script = readSlice(this->data, SL);\n\n\t\t\tconst auto odata = Slice(odataSource.begin, this->data.begin);\n\t\t\toutputs.emplace_back(Transaction::Output(odata, script, value));\n\t\t}\n\n\t\tconst auto locktime = this->data.read<uint32_t>();\n\t\tauto tdata = source.take(source.length() - this->data.length());\n\n\t\tthis->current = Transaction(tdata, version, inputs, outputs, locktime);\n\t\tthis->lazy = false;\n\t}\n\npublic:\n\tTransactionRange(size_t n, Slice data) : n(n), data(data) {}\n\n\tauto empty () const { return this->n == 0; }\n\tauto length () const { return this->n; }\n\tauto front () {\n\t\tif (this->lazy) {\n\t\t\tthis->readTransaction();\n\t\t}\n\n\t\treturn this->current;\n\t}\n\n\t\/\/ TODO: verify\n\/\/ \tvoid popFront () {\n\/\/ \t\tthis->lazy = true;\n\/\/ \t\tthis->n--;\n\/\/ \t}\n\n\tvoid popFront () {\n\t\tthis->n--;\n\n\t\tif (this->n > 0) {\n\t\t\tthis->readTransaction();\n\t\t}\n\t}\n};\n\nstruct Block {\n\tSlice header, data;\n\n\tBlock(Slice header) : header(header) {\n\t\tassert(header.length() == 80);\n\t}\n\n\tBlock(Slice header, Slice data) : header(header), data(data) {\n\t\tassert(header.length() == 80);\n\t}\n\n\tstatic void calculateTarget (uint8_t* dest, uint32_t bits) {\n\t\tconst auto exponent = ((bits & 0xff000000) >> 24) - 3;\n\t\tconst auto mantissa = bits & 0x007fffff;\n\t\tconst auto i = static_cast<size_t>(31 - exponent);\n\t\tif (i > 31) return;\n\n\t\tdest[i] = static_cast<uint8_t>(mantissa & 0xff);\n\t\tdest[i - 1] = static_cast<uint8_t>(mantissa >> 8);\n\t\tdest[i - 2] = static_cast<uint8_t>(mantissa >> 16);\n\t\tdest[i - 3] = static_cast<uint8_t>(mantissa >> 24);\n\t}\n\n\tauto transactions () const {\n\t\tauto _data = this->data;\n\t\tconst auto n = readVI(_data);\n\n\t\treturn TransactionRange(n, _data);\n\t}\n\n\tauto verify () const {\n\t\tuint8_t hash[32];\n\t\tuint8_t target[32] = {};\n\n\t\thash256(hash, this->header);\n\t\tstd::reverse(hash, hash + 32);\n\n\t\tconst auto bits = *(reinterpret_cast<uint32_t*>(this->header.begin + 72));\n\t\tBlock::calculateTarget(target, bits);\n\n\t\treturn memcmp(hash, target, 32) <= 0;\n\t}\n};\n<|endoftext|>"}
{"text":"<commit_before>#include \"ntuple_test.hxx\"\n\n#if __cplusplus >= 201703L\nTEST(RNTuple, ReconstructModel)\n{\n   FileRaii fileGuard(\"test_ntuple_reconstruct.root\");\n   auto model = RNTupleModel::Create();\n   auto fieldPt = model->MakeField<float>(\"pt\", 42.0);\n   auto fieldNnlo = model->MakeField<std::vector<std::vector<float>>>(\"nnlo\");\n   auto fieldKlass = model->MakeField<CustomStruct>(\"klass\");\n   auto fieldArray = model->MakeField<std::array<double, 2>>(\"array\");\n   auto fieldVariant = model->MakeField<std::variant<double, std::variant<std::string, double>>>(\"variant\");\n   {\n      RPageSinkFile sink(\"myNTuple\", fileGuard.GetPath(), RNTupleWriteOptions());\n      sink.Create(*model.get());\n      sink.CommitDataset();\n      model = nullptr;\n   }\n\n   RPageSourceFile source(\"myNTuple\", fileGuard.GetPath(), RNTupleReadOptions());\n   source.Attach();\n\n   auto modelReconstructed = source.GetDescriptor().GenerateModel();\n   EXPECT_EQ(nullptr, modelReconstructed->GetDefaultEntry()->Get<float>(\"xyz\"));\n   auto vecPtr = modelReconstructed->GetDefaultEntry()->Get<std::vector<std::vector<float>>>(\"nnlo\");\n   EXPECT_TRUE(vecPtr != nullptr);\n   \/\/ Don't crash\n   vecPtr->push_back(std::vector<float>{1.0});\n   auto array = modelReconstructed->GetDefaultEntry()->Get<std::array<double, 2>>(\"array\");\n   EXPECT_TRUE(array != nullptr);\n   auto variant = modelReconstructed->GetDefaultEntry()->Get<\n      std::variant<double, std::variant<std::string, double>>>(\"variant\");\n   EXPECT_TRUE(variant != nullptr);\n}\n#endif \/\/ __cplusplus >= 201703L\n\nTEST(RNTuple, MultipleInFile)\n{\n   FileRaii fileGuard(\"test_ntuple_multi.root\");\n   auto file = TFile::Open(fileGuard.GetPath().c_str(), \"RECREATE\");\n   {\n      auto model = RNTupleModel::Create();\n      auto fieldPt = model->MakeField<float>(\"pt\", 42.0);\n      RNTupleWriter ntuple(std::move(model), std::make_unique<RPageSinkFile>(\"first\", *file, RNTupleWriteOptions()));\n      ntuple.Fill();\n   }\n   {\n      auto model = RNTupleModel::Create();\n      auto fieldPt = model->MakeField<float>(\"E\", 1.0);\n      RNTupleWriter ntuple(std::move(model), std::make_unique<RPageSinkFile>(\"second\", *file, RNTupleWriteOptions()));\n      ntuple.Fill();\n   }\n   file->Close();\n   delete file;\n\n   RNTupleReader ntupleFirst(std::make_unique<RPageSourceFile>(\"first\", fileGuard.GetPath(), RNTupleReadOptions()));\n   auto viewPt = ntupleFirst.GetView<float>(\"pt\");\n   int n = 0;\n   for (auto i : ntupleFirst.GetEntryRange()) {\n      EXPECT_EQ(42.0, viewPt(i));\n      n++;\n   }\n   EXPECT_EQ(1, n);\n\n   RNTupleReader ntupleSecond(std::make_unique<RPageSourceFile>(\"second\", fileGuard.GetPath(), RNTupleReadOptions()));\n   auto viewE = ntupleSecond.GetView<float>(\"E\");\n   n = 0;\n   for (auto i : ntupleSecond.GetEntryRange()) {\n      EXPECT_EQ(1.0, viewE(i));\n      n++;\n   }\n   EXPECT_EQ(1, n);\n}\n\n\nTEST(RNTuple, WriteRead)\n{\n   FileRaii fileGuard(\"test_ntuple_writeread.root\");\n\n   auto modelWrite = RNTupleModel::Create();\n   auto wrSignal = modelWrite->MakeField<bool>(\"signal\", true);\n   auto wrPt = modelWrite->MakeField<float>(\"pt\", 42.0);\n   auto wrEnergy = modelWrite->MakeField<float>(\"energy\", 7.0);\n   auto wrTag = modelWrite->MakeField<std::string>(\"tag\", \"xyz\");\n   auto wrJets = modelWrite->MakeField<std::vector<float>>(\"jets\");\n   wrJets->push_back(1.0);\n   wrJets->push_back(2.0);\n   auto wrNnlo = modelWrite->MakeField<std::vector<std::vector<float>>>(\"nnlo\");\n   wrNnlo->push_back(std::vector<float>());\n   wrNnlo->push_back(std::vector<float>{1.0});\n   wrNnlo->push_back(std::vector<float>{1.0, 2.0, 4.0, 8.0});\n   auto wrKlass = modelWrite->MakeField<CustomStruct>(\"klass\");\n   wrKlass->s = \"abc\";\n\n   auto modelRead = std::unique_ptr<RNTupleModel>(modelWrite->Clone());\n\n   {\n      RNTupleWriter ntuple(std::move(modelWrite),\n         std::make_unique<RPageSinkFile>(\"myNTuple\", fileGuard.GetPath(), RNTupleWriteOptions()));\n      ntuple.Fill();\n   }\n\n   auto rdSignal = modelRead->Get<bool>(\"signal\");\n   auto rdPt = modelRead->Get<float>(\"pt\");\n   auto rdEnergy = modelRead->Get<float>(\"energy\");\n   auto rdTag = modelRead->Get<std::string>(\"tag\");\n   auto rdJets = modelRead->Get<std::vector<float>>(\"jets\");\n   auto rdNnlo = modelRead->Get<std::vector<std::vector<float>>>(\"nnlo\");\n   auto rdKlass = modelRead->Get<CustomStruct>(\"klass\");\n\n   RNTupleReader ntuple(std::move(modelRead),\n      std::make_unique<RPageSourceFile>(\"myNTuple\", fileGuard.GetPath(), RNTupleReadOptions()));\n   EXPECT_EQ(1U, ntuple.GetNEntries());\n   ntuple.LoadEntry(0);\n\n   EXPECT_TRUE(*rdSignal);\n   EXPECT_EQ(42.0, *rdPt);\n   EXPECT_EQ(7.0, *rdEnergy);\n   EXPECT_STREQ(\"xyz\", rdTag->c_str());\n\n   EXPECT_EQ(2U, rdJets->size());\n   EXPECT_EQ(1.0, (*rdJets)[0]);\n   EXPECT_EQ(2.0, (*rdJets)[1]);\n\n   EXPECT_EQ(3U, rdNnlo->size());\n   EXPECT_EQ(0U, (*rdNnlo)[0].size());\n   EXPECT_EQ(1U, (*rdNnlo)[1].size());\n   EXPECT_EQ(4U, (*rdNnlo)[2].size());\n   EXPECT_EQ(1.0, (*rdNnlo)[1][0]);\n   EXPECT_EQ(1.0, (*rdNnlo)[2][0]);\n   EXPECT_EQ(2.0, (*rdNnlo)[2][1]);\n   EXPECT_EQ(4.0, (*rdNnlo)[2][2]);\n   EXPECT_EQ(8.0, (*rdNnlo)[2][3]);\n\n   EXPECT_STREQ(\"abc\", rdKlass->s.c_str());\n}\n\nTEST(RNTuple, Clusters)\n{\n   FileRaii fileGuard(\"test_ntuple_clusters.root\");\n\n   auto modelWrite = RNTupleModel::Create();\n   auto wrPt = modelWrite->MakeField<float>(\"pt\", 42.0);\n   auto wrTag = modelWrite->MakeField<std::string>(\"tag\", \"xyz\");\n   auto wrNnlo = modelWrite->MakeField<std::vector<std::vector<float>>>(\"nnlo\");\n   auto wrFourVec = modelWrite->MakeField<std::array<float, 4>>(\"fourVec\");\n   wrNnlo->push_back(std::vector<float>());\n   wrNnlo->push_back(std::vector<float>{1.0});\n   wrNnlo->push_back(std::vector<float>{1.0, 2.0, 4.0, 8.0});\n   wrFourVec->at(0) = 0.0;\n   wrFourVec->at(1) = 1.0;\n   wrFourVec->at(2) = 2.0;\n   wrFourVec->at(3) = 3.0;\n\n   auto modelRead = std::unique_ptr<RNTupleModel>(modelWrite->Clone());\n\n   {\n      RNTupleWriter ntuple(std::move(modelWrite),\n         std::make_unique<RPageSinkFile>(\"myNTuple\", fileGuard.GetPath(), RNTupleWriteOptions()));\n      ntuple.Fill();\n      ntuple.CommitCluster();\n      *wrPt = 24.0;\n      wrNnlo->clear();\n      *wrTag = \"\";\n      wrFourVec->at(2) = 42.0;\n      ntuple.Fill();\n      *wrPt = 12.0;\n      wrNnlo->push_back(std::vector<float>{42.0});\n      *wrTag = \"12345\";\n      wrFourVec->at(1) = 24.0;\n      ntuple.Fill();\n   }\n\n   auto rdPt = modelRead->Get<float>(\"pt\");\n   auto rdTag = modelRead->Get<std::string>(\"tag\");\n   auto rdNnlo = modelRead->Get<std::vector<std::vector<float>>>(\"nnlo\");\n   auto rdFourVec = modelRead->Get<std::array<float, 4>>(\"fourVec\");\n\n   RNTupleReader ntuple(std::move(modelRead),\n      std::make_unique<RPageSourceFile>(\"myNTuple\", fileGuard.GetPath(), RNTupleReadOptions()));\n   EXPECT_EQ(3U, ntuple.GetNEntries());\n\n   ntuple.LoadEntry(0);\n   EXPECT_EQ(42.0, *rdPt);\n   EXPECT_STREQ(\"xyz\", rdTag->c_str());\n   EXPECT_EQ(3U, rdNnlo->size());\n   EXPECT_EQ(0U, (*rdNnlo)[0].size());\n   EXPECT_EQ(1U, (*rdNnlo)[1].size());\n   EXPECT_EQ(4U, (*rdNnlo)[2].size());\n   EXPECT_EQ(1.0, (*rdNnlo)[1][0]);\n   EXPECT_EQ(1.0, (*rdNnlo)[2][0]);\n   EXPECT_EQ(2.0, (*rdNnlo)[2][1]);\n   EXPECT_EQ(4.0, (*rdNnlo)[2][2]);\n   EXPECT_EQ(8.0, (*rdNnlo)[2][3]);\n   EXPECT_EQ(0.0, (*rdFourVec)[0]);\n   EXPECT_EQ(1.0, (*rdFourVec)[1]);\n   EXPECT_EQ(2.0, (*rdFourVec)[2]);\n   EXPECT_EQ(3.0, (*rdFourVec)[3]);\n\n   ntuple.LoadEntry(1);\n   EXPECT_EQ(24.0, *rdPt);\n   EXPECT_STREQ(\"\", rdTag->c_str());\n   EXPECT_TRUE(rdNnlo->empty());\n   EXPECT_EQ(42.0, (*rdFourVec)[2]);\n\n   ntuple.LoadEntry(2);\n   EXPECT_EQ(12.0, *rdPt);\n   EXPECT_STREQ(\"12345\", rdTag->c_str());\n   EXPECT_EQ(1U, rdNnlo->size());\n   EXPECT_EQ(1U, (*rdNnlo)[0].size());\n   EXPECT_EQ(42.0, (*rdNnlo)[0][0]);\n   EXPECT_EQ(24.0, (*rdFourVec)[1]);\n}\n\n\nTEST(RNTupleModel, EnforceValidFieldNames)\n{\n   auto model = RNTupleModel::Create();\n   auto field = model->MakeField<float>(\"pt\", 42.0);\n\n   try {\n      auto field2 = model->MakeField<float>(\"pt\", 42.0);\n      FAIL() << \"repeated field names should throw\";\n   } catch (const RException& err) {\n      EXPECT_THAT(err.what(), testing::HasSubstr(\"field name 'pt' already exists\"));\n   }\n\n   try {\n      auto field3 = model->MakeField<float>(\"\", 42.0);\n      FAIL() << \"empty string as field name should throw\";\n   } catch (const RException& err) {\n      EXPECT_THAT(err.what(), testing::HasSubstr(\"field name cannot be empty string\"));\n   }\n\n   try {\n      auto field3 = model->MakeField<float>(\"pt.pt\", 42.0);\n      FAIL() << \"field name with periods should throw\";\n   } catch (const RException& err) {\n      EXPECT_THAT(err.what(), testing::HasSubstr(\"field name 'pt.pt' cannot contain periods '.'\"));\n   }\n}\n<commit_msg>[ntuple] add field name validity tests for RNTupleModel::AddField<commit_after>#include \"ntuple_test.hxx\"\n\n#if __cplusplus >= 201703L\nTEST(RNTuple, ReconstructModel)\n{\n   FileRaii fileGuard(\"test_ntuple_reconstruct.root\");\n   auto model = RNTupleModel::Create();\n   auto fieldPt = model->MakeField<float>(\"pt\", 42.0);\n   auto fieldNnlo = model->MakeField<std::vector<std::vector<float>>>(\"nnlo\");\n   auto fieldKlass = model->MakeField<CustomStruct>(\"klass\");\n   auto fieldArray = model->MakeField<std::array<double, 2>>(\"array\");\n   auto fieldVariant = model->MakeField<std::variant<double, std::variant<std::string, double>>>(\"variant\");\n   {\n      RPageSinkFile sink(\"myNTuple\", fileGuard.GetPath(), RNTupleWriteOptions());\n      sink.Create(*model.get());\n      sink.CommitDataset();\n      model = nullptr;\n   }\n\n   RPageSourceFile source(\"myNTuple\", fileGuard.GetPath(), RNTupleReadOptions());\n   source.Attach();\n\n   auto modelReconstructed = source.GetDescriptor().GenerateModel();\n   EXPECT_EQ(nullptr, modelReconstructed->GetDefaultEntry()->Get<float>(\"xyz\"));\n   auto vecPtr = modelReconstructed->GetDefaultEntry()->Get<std::vector<std::vector<float>>>(\"nnlo\");\n   EXPECT_TRUE(vecPtr != nullptr);\n   \/\/ Don't crash\n   vecPtr->push_back(std::vector<float>{1.0});\n   auto array = modelReconstructed->GetDefaultEntry()->Get<std::array<double, 2>>(\"array\");\n   EXPECT_TRUE(array != nullptr);\n   auto variant = modelReconstructed->GetDefaultEntry()->Get<\n      std::variant<double, std::variant<std::string, double>>>(\"variant\");\n   EXPECT_TRUE(variant != nullptr);\n}\n#endif \/\/ __cplusplus >= 201703L\n\nTEST(RNTuple, MultipleInFile)\n{\n   FileRaii fileGuard(\"test_ntuple_multi.root\");\n   auto file = TFile::Open(fileGuard.GetPath().c_str(), \"RECREATE\");\n   {\n      auto model = RNTupleModel::Create();\n      auto fieldPt = model->MakeField<float>(\"pt\", 42.0);\n      RNTupleWriter ntuple(std::move(model), std::make_unique<RPageSinkFile>(\"first\", *file, RNTupleWriteOptions()));\n      ntuple.Fill();\n   }\n   {\n      auto model = RNTupleModel::Create();\n      auto fieldPt = model->MakeField<float>(\"E\", 1.0);\n      RNTupleWriter ntuple(std::move(model), std::make_unique<RPageSinkFile>(\"second\", *file, RNTupleWriteOptions()));\n      ntuple.Fill();\n   }\n   file->Close();\n   delete file;\n\n   RNTupleReader ntupleFirst(std::make_unique<RPageSourceFile>(\"first\", fileGuard.GetPath(), RNTupleReadOptions()));\n   auto viewPt = ntupleFirst.GetView<float>(\"pt\");\n   int n = 0;\n   for (auto i : ntupleFirst.GetEntryRange()) {\n      EXPECT_EQ(42.0, viewPt(i));\n      n++;\n   }\n   EXPECT_EQ(1, n);\n\n   RNTupleReader ntupleSecond(std::make_unique<RPageSourceFile>(\"second\", fileGuard.GetPath(), RNTupleReadOptions()));\n   auto viewE = ntupleSecond.GetView<float>(\"E\");\n   n = 0;\n   for (auto i : ntupleSecond.GetEntryRange()) {\n      EXPECT_EQ(1.0, viewE(i));\n      n++;\n   }\n   EXPECT_EQ(1, n);\n}\n\n\nTEST(RNTuple, WriteRead)\n{\n   FileRaii fileGuard(\"test_ntuple_writeread.root\");\n\n   auto modelWrite = RNTupleModel::Create();\n   auto wrSignal = modelWrite->MakeField<bool>(\"signal\", true);\n   auto wrPt = modelWrite->MakeField<float>(\"pt\", 42.0);\n   auto wrEnergy = modelWrite->MakeField<float>(\"energy\", 7.0);\n   auto wrTag = modelWrite->MakeField<std::string>(\"tag\", \"xyz\");\n   auto wrJets = modelWrite->MakeField<std::vector<float>>(\"jets\");\n   wrJets->push_back(1.0);\n   wrJets->push_back(2.0);\n   auto wrNnlo = modelWrite->MakeField<std::vector<std::vector<float>>>(\"nnlo\");\n   wrNnlo->push_back(std::vector<float>());\n   wrNnlo->push_back(std::vector<float>{1.0});\n   wrNnlo->push_back(std::vector<float>{1.0, 2.0, 4.0, 8.0});\n   auto wrKlass = modelWrite->MakeField<CustomStruct>(\"klass\");\n   wrKlass->s = \"abc\";\n\n   auto modelRead = std::unique_ptr<RNTupleModel>(modelWrite->Clone());\n\n   {\n      RNTupleWriter ntuple(std::move(modelWrite),\n         std::make_unique<RPageSinkFile>(\"myNTuple\", fileGuard.GetPath(), RNTupleWriteOptions()));\n      ntuple.Fill();\n   }\n\n   auto rdSignal = modelRead->Get<bool>(\"signal\");\n   auto rdPt = modelRead->Get<float>(\"pt\");\n   auto rdEnergy = modelRead->Get<float>(\"energy\");\n   auto rdTag = modelRead->Get<std::string>(\"tag\");\n   auto rdJets = modelRead->Get<std::vector<float>>(\"jets\");\n   auto rdNnlo = modelRead->Get<std::vector<std::vector<float>>>(\"nnlo\");\n   auto rdKlass = modelRead->Get<CustomStruct>(\"klass\");\n\n   RNTupleReader ntuple(std::move(modelRead),\n      std::make_unique<RPageSourceFile>(\"myNTuple\", fileGuard.GetPath(), RNTupleReadOptions()));\n   EXPECT_EQ(1U, ntuple.GetNEntries());\n   ntuple.LoadEntry(0);\n\n   EXPECT_TRUE(*rdSignal);\n   EXPECT_EQ(42.0, *rdPt);\n   EXPECT_EQ(7.0, *rdEnergy);\n   EXPECT_STREQ(\"xyz\", rdTag->c_str());\n\n   EXPECT_EQ(2U, rdJets->size());\n   EXPECT_EQ(1.0, (*rdJets)[0]);\n   EXPECT_EQ(2.0, (*rdJets)[1]);\n\n   EXPECT_EQ(3U, rdNnlo->size());\n   EXPECT_EQ(0U, (*rdNnlo)[0].size());\n   EXPECT_EQ(1U, (*rdNnlo)[1].size());\n   EXPECT_EQ(4U, (*rdNnlo)[2].size());\n   EXPECT_EQ(1.0, (*rdNnlo)[1][0]);\n   EXPECT_EQ(1.0, (*rdNnlo)[2][0]);\n   EXPECT_EQ(2.0, (*rdNnlo)[2][1]);\n   EXPECT_EQ(4.0, (*rdNnlo)[2][2]);\n   EXPECT_EQ(8.0, (*rdNnlo)[2][3]);\n\n   EXPECT_STREQ(\"abc\", rdKlass->s.c_str());\n}\n\nTEST(RNTuple, Clusters)\n{\n   FileRaii fileGuard(\"test_ntuple_clusters.root\");\n\n   auto modelWrite = RNTupleModel::Create();\n   auto wrPt = modelWrite->MakeField<float>(\"pt\", 42.0);\n   auto wrTag = modelWrite->MakeField<std::string>(\"tag\", \"xyz\");\n   auto wrNnlo = modelWrite->MakeField<std::vector<std::vector<float>>>(\"nnlo\");\n   auto wrFourVec = modelWrite->MakeField<std::array<float, 4>>(\"fourVec\");\n   wrNnlo->push_back(std::vector<float>());\n   wrNnlo->push_back(std::vector<float>{1.0});\n   wrNnlo->push_back(std::vector<float>{1.0, 2.0, 4.0, 8.0});\n   wrFourVec->at(0) = 0.0;\n   wrFourVec->at(1) = 1.0;\n   wrFourVec->at(2) = 2.0;\n   wrFourVec->at(3) = 3.0;\n\n   auto modelRead = std::unique_ptr<RNTupleModel>(modelWrite->Clone());\n\n   {\n      RNTupleWriter ntuple(std::move(modelWrite),\n         std::make_unique<RPageSinkFile>(\"myNTuple\", fileGuard.GetPath(), RNTupleWriteOptions()));\n      ntuple.Fill();\n      ntuple.CommitCluster();\n      *wrPt = 24.0;\n      wrNnlo->clear();\n      *wrTag = \"\";\n      wrFourVec->at(2) = 42.0;\n      ntuple.Fill();\n      *wrPt = 12.0;\n      wrNnlo->push_back(std::vector<float>{42.0});\n      *wrTag = \"12345\";\n      wrFourVec->at(1) = 24.0;\n      ntuple.Fill();\n   }\n\n   auto rdPt = modelRead->Get<float>(\"pt\");\n   auto rdTag = modelRead->Get<std::string>(\"tag\");\n   auto rdNnlo = modelRead->Get<std::vector<std::vector<float>>>(\"nnlo\");\n   auto rdFourVec = modelRead->Get<std::array<float, 4>>(\"fourVec\");\n\n   RNTupleReader ntuple(std::move(modelRead),\n      std::make_unique<RPageSourceFile>(\"myNTuple\", fileGuard.GetPath(), RNTupleReadOptions()));\n   EXPECT_EQ(3U, ntuple.GetNEntries());\n\n   ntuple.LoadEntry(0);\n   EXPECT_EQ(42.0, *rdPt);\n   EXPECT_STREQ(\"xyz\", rdTag->c_str());\n   EXPECT_EQ(3U, rdNnlo->size());\n   EXPECT_EQ(0U, (*rdNnlo)[0].size());\n   EXPECT_EQ(1U, (*rdNnlo)[1].size());\n   EXPECT_EQ(4U, (*rdNnlo)[2].size());\n   EXPECT_EQ(1.0, (*rdNnlo)[1][0]);\n   EXPECT_EQ(1.0, (*rdNnlo)[2][0]);\n   EXPECT_EQ(2.0, (*rdNnlo)[2][1]);\n   EXPECT_EQ(4.0, (*rdNnlo)[2][2]);\n   EXPECT_EQ(8.0, (*rdNnlo)[2][3]);\n   EXPECT_EQ(0.0, (*rdFourVec)[0]);\n   EXPECT_EQ(1.0, (*rdFourVec)[1]);\n   EXPECT_EQ(2.0, (*rdFourVec)[2]);\n   EXPECT_EQ(3.0, (*rdFourVec)[3]);\n\n   ntuple.LoadEntry(1);\n   EXPECT_EQ(24.0, *rdPt);\n   EXPECT_STREQ(\"\", rdTag->c_str());\n   EXPECT_TRUE(rdNnlo->empty());\n   EXPECT_EQ(42.0, (*rdFourVec)[2]);\n\n   ntuple.LoadEntry(2);\n   EXPECT_EQ(12.0, *rdPt);\n   EXPECT_STREQ(\"12345\", rdTag->c_str());\n   EXPECT_EQ(1U, rdNnlo->size());\n   EXPECT_EQ(1U, (*rdNnlo)[0].size());\n   EXPECT_EQ(42.0, (*rdNnlo)[0][0]);\n   EXPECT_EQ(24.0, (*rdFourVec)[1]);\n}\n\n\nTEST(RNTupleModel, EnforceValidFieldNames)\n{\n   auto model = RNTupleModel::Create();\n\n   auto field = model->MakeField<float>(\"pt\", 42.0);\n\n   \/\/ MakeField\n   try {\n      auto field2 = model->MakeField<float>(\"pt\", 42.0);\n      FAIL() << \"repeated field names should throw\";\n   } catch (const RException& err) {\n      EXPECT_THAT(err.what(), testing::HasSubstr(\"field name 'pt' already exists\"));\n   }\n   try {\n      auto field3 = model->MakeField<float>(\"\", 42.0);\n      FAIL() << \"empty string as field name should throw\";\n   } catch (const RException& err) {\n      EXPECT_THAT(err.what(), testing::HasSubstr(\"field name cannot be empty string\"));\n   }\n   try {\n      auto field3 = model->MakeField<float>(\"pt.pt\", 42.0);\n      FAIL() << \"field name with periods should throw\";\n   } catch (const RException& err) {\n      EXPECT_THAT(err.what(), testing::HasSubstr(\"field name 'pt.pt' cannot contain periods '.'\"));\n   }\n\n   \/\/ AddField\n   try {\n      model->AddField(std::make_unique<RField<float>>(RField<float>(\"pt\")));\n      FAIL() << \"repeated field names should throw\";\n   } catch (const RException& err) {\n      EXPECT_THAT(err.what(), testing::HasSubstr(\"field name 'pt' already exists\"));\n   }\n   try {\n      float num = 10.0;\n      model->AddField(\"pt\", &num);\n      FAIL() << \"repeated field names should throw\";\n   } catch (const RException& err) {\n      EXPECT_THAT(err.what(), testing::HasSubstr(\"field name 'pt' already exists\"));\n   }\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef SOLAIRE_HEX_HPP\n#define SOLAIRE_HEX_HPP\n\n\/\/Copyright 2015 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\/\/ Contact :\n\/\/ Email             : solairelibrary@mail.com\n\/\/ GitHub repository : https:\/\/github.com\/SolaireLibrary\/SolaireCPP\n\n\/*!\n\t\\file Hex.hpp\n\t\\brief\n\t\\author\n\tCreated\t\t\t: Adam Smith\n\tLast modified\t: Adam Smith\n\t\\date\n\tCreated\t\t\t: 9th January 2016\n\tLast Modified\t: 9th January 2016\n*\/\n\n#include <cstdint>\n#include \"Solaire\/Core\/Maths.hpp\"\n\nnamespace Solaire {\n\n    typedef char HexChar;\n\n    namespace HexImplementation {\n        static constexpr HexChar BIN2HEX_LOOKUP[17] = \"0123456789ABCDEF\";   \/\/!< Lookup table for conversion of binary (nybble) to hexadecimal.\n\n        static constexpr uint8_t HEX2BIN_LOOKUP[256] = {\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t1,\n            2,\t3,\t4,\t5,\t6,\t7,\t8,\t9,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t10,\t11,\t12,\t13,\t14,\n            15,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t10,\t11,\t12,\n            13,\t14,\t15,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0\n        } \/\/!< Lookup table for conversion of hexadecimal to binary.\n    }\n\n    \/*!\n        \\brief Convert a hexadecimal character into 4 bits of binary data.\n        \\param aHex The hex character to convert.\n        \\return The binary value of the character.\n    *\/\n    static constexpr uint8_t HexToNybble(const HexChar aHex) {\n        return HexImplementation::HEX2BIN_LOOKUP[aHex];\n    }\n\n    \/*!\n        \\brief Convert two hexadecimal characters into 8 bits of binary data.\n        \\param aHex0 The first character.\n        \\param aHex1 The second character.\n        \\return The binary data.\n    *\/\n    static constexpr uint8_t HexToByte(const HexChar aHex0, const HexChar aHex1) {\n        return (HexToNybble(aHex0) << 4 )| HexToNybble(aHex1);\n    }\n\n    \/*!\n        \\brief Convert 4 bits of binary data into a hexadecimal character.\n        \\param aNybble The binary data.\n        \\return The hexadecimal representation of the binary data.\n    *\/\n    static constexpr HexChar NybbleToHex(const uint8_t aNybble) {\n        return HexImplementation::BIN2HEX_LOOKUP[aNybble];\n    }\n\n    \/*!\n        \\brief Convert 8 bits of binary data into two hexadecimal characters.\n        \\param aByte The binary data.\n        \\param aChars The address to write the hex characters into.\n    *\/\n    static void ByteToHex(const uint8_t aByte, HexChar* const aChars) {\n        aChars[0] = NybbleToHex(aByte >> 4);\n        aChars[1] = NybbleToHex(aByte & NYBBLE_0);\n    }\n\n    \/*!\n        \\brief Calculate the number of characters required to store a hexadecimal representation.\n        \\param aBinaryLength The number of bytes to represent.\n        \\return The number of characters required.\n    *\/\n    static constexpr uint32_t BinaryToHexLength(const uint32_t aBinaryLength) {\n        return aBinaryLength * 2;\n    }\n\n    \/*!\n        \\brief Calculate the number of bytes required to store a binary representation of hexadecimal data.\n        \\param aBinaryLength The number of characters to represent.\n        \\return The number of bytes required.\n    *\/\n    static constexpr uint32_t HexToBinaryLength(const uint32_t aHexLength) {\n        return (aHexLength >> 1) + (aHexLength & BIT_0);\n    }\n\n    \/*!\n        \\brief Convert binary data into it's hexadecimal representation.\n        \\param aBinary The starting address of the binary data.\n        \\param aBinaryLength The number of bytes to convert.\n        \\param aHex The starting address to write the hexadecimal data into.\n        \\param aHexLength The number of writeable chars pointed to be \\a aHex.\n        \\return False if \\a aHexLength is not long enough to contain the hexadecimal representation.\n    *\/\n    static bool BinaryToHex(const void* const aBinary, const uint32_t aBinaryLength, HexChar* const aHex, const uint32_t aHexLength) {\n        if(aHexLength < BinaryToHexLength(aBinaryLength)) return false;\n        const uint8_t* const bin = static_cast<const uint8_t*>(aBinary);\n        for(uint32_t i = 0; i < aBinaryLength; ++i) {\n            ByteToHex(bin[aBinaryLength - (i + 1)], aHex + i * 2);\n        }\n        return true;\n    }\n\n    \/*!\n        \\brief Convert binary data into it's hexadecimal representation.\n        \\param aHex The hexadecimal characters to convert.\n        \\param aHexLength The number of characters to convert.\n        \\param aBinary The starting address to write binary data into.\n        \\param aBinaryLength The number of bytes pointed to by \\a aBinary.\n        \\return False if aBinaryLength is too small to store the binary representation.\n    *\/\n    static bool HexToBinary(const HexChar* const aHex, const uint32_t aHexLength, void* const aBinary, const uint32_t aBinaryLength) {\n        if(aHexLength < HexToBinaryLength(aHexLength)) return false;\n        const HexChar* hex = aHex;\n        const HexChar* end = hex + aHexLength;\n        uint8_t* bin = static_cast<uint8_t*>(aBinary) + (aBinaryLength - 1);\n\n        \/\/ Convert all paired characters\n        while((end - hex) >= 2){\n            *bin = HexToByte(hex[0], hex[1]);\n            hex += 2;\n            --bin;\n        }\n\n        \/\/ Convert trailing character, if present\n        if((end - hex) == 1) {\n            *bin = HexToNybble(*hex) << 4;\n        }\n        return true;\n    }\n\n}\n\n#endif\n<commit_msg>Added helper functions for hex conversion<commit_after>#ifndef SOLAIRE_HEX_HPP\n#define SOLAIRE_HEX_HPP\n\n\/\/Copyright 2015 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\/\/ Contact :\n\/\/ Email             : solairelibrary@mail.com\n\/\/ GitHub repository : https:\/\/github.com\/SolaireLibrary\/SolaireCPP\n\n\/*!\n\t\\file Hex.hpp\n\t\\brief\n\t\\author\n\tCreated\t\t\t: Adam Smith\n\tLast modified\t: Adam Smith\n\t\\date\n\tCreated\t\t\t: 9th January 2016\n\tLast Modified\t: 9th January 2016\n*\/\n\n#include <cstdint>\n#include \"Solaire\/Core\/Maths.hpp\"\n\nnamespace Solaire {\n\n    typedef char HexChar;\n\n    namespace HexImplementation {\n        static constexpr HexChar BIN2HEX_LOOKUP[17] = \"0123456789ABCDEF\";   \/\/!< Lookup table for conversion of binary (nybble) to hexadecimal.\n\n        static constexpr uint8_t HEX2BIN_LOOKUP[256] = {\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t1,\n            2,\t3,\t4,\t5,\t6,\t7,\t8,\t9,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t10,\t11,\t12,\t13,\t14,\n            15,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t10,\t11,\t12,\n            13,\t14,\t15,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\t0,\n            0,\t0,\t0,\t0,\t0,\t0\n        }; \/\/!< Lookup table for conversion of hexadecimal to binary.\n    }\n\n    \/*!\n        \\brief Convert a hexadecimal character into 4 bits of binary data.\n        \\param aHex The hex character to convert.\n        \\return The binary value of the character.\n    *\/\n    static constexpr uint8_t HexToBin4(const HexChar aHex) {\n        return HexImplementation::HEX2BIN_LOOKUP[aHex];\n    }\n\n    \/*!\n        \\brief Convert two hexadecimal characters into 8 bits of binary data.\n        \\param aHex The characters to convert.\n        \\return The binary data.\n    *\/\n    static constexpr uint8_t HexToBin8(const HexChar* const aHex) {\n        return (HexToBin4(aHex[0]) << 4 )| HexToBin4(aHex[1]);\n    }\n\n    \/*!\n        \\brief Convert four hexadecimal characters into 16 bits of binary data.\n        \\param aHex The characters to convert.\n        \\return The binary data.\n    *\/\n    static constexpr uint16_t HexToBin16(const HexChar* const aHex) {\n        return\n            static_cast<uint16_t>(HexToBin8(aHex) << 4) |\n            static_cast<uint16_t>(HexToBin8(aHex + 4));\n    }\n\n    \/*!\n        \\brief Convert 8 hexadecimal characters into 32 bits of binary data.\n        \\param aHex The characters to convert.\n        \\return The binary data.\n    *\/\n    static constexpr uint32_t HexToBin32(const HexChar* const aHex) {\n        return\n            static_cast<uint32_t>(HexToBin16(aHex) << 16) |\n            static_cast<uint32_t>(HexToBin16(aHex + 4));\n    }\n\n    \/*!\n        \\brief Convert 16 hexadecimal characters into 64 bits of binary data.\n        \\param aHex The characters to convert.\n        \\return The binary data.\n    *\/\n    static constexpr uint64_t HexToBin64(const HexChar* const aHex) {\n        return\n            static_cast<uint64_t>(HexToBin32(aHex) << 32L) |\n            static_cast<uint64_t>(HexToBin32(aHex + 8));\n    }\n\n    \/*!\n        \\brief Convert 4 bits of binary data into a hexadecimal character.\n        \\param aNybble The binary data.\n        \\return The hexadecimal representation of the binary data.\n    *\/\n    static constexpr HexChar Bin4ToHex(const uint8_t aNybble) {\n        return HexImplementation::BIN2HEX_LOOKUP[aNybble];\n    }\n\n    \/*!\n        \\brief Convert 8 bits of binary data into two hexadecimal characters.\n        \\param aByte The binary data.\n        \\param aChars The address to write the hex characters into.\n    *\/\n    static void Bin8ToHex(const uint8_t aByte, HexChar* const aChars) {\n        aChars[0] = Bin4ToHex(aByte >> 4);\n        aChars[1] = Bin4ToHex(aByte & NYBBLE_0);\n    }\n\n    \/*!\n        \\brief Convert 16 bits of binary data into four hexadecimal characters.\n        \\param aByte The binary data.\n        \\param aChars The address to write the hex characters into.\n    *\/\n    static void Bin16ToHex(const uint16_t aByte, HexChar* const aChars) {\n        aChars[0] = Bin4ToHex((aByte >> 12) & NYBBLE_0);\n        aChars[1] = Bin4ToHex((aByte >> 8) & NYBBLE_0);\n        aChars[2] = Bin4ToHex((aByte >> 4) & NYBBLE_0);\n        aChars[3] = Bin4ToHex(aByte & NYBBLE_0);\n    }\n\n    \/*!\n        \\brief Convert 32 bits of binary data into eight hexadecimal characters.\n        \\param aByte The binary data.\n        \\param aChars The address to write the hex characters into.\n    *\/\n    static void Bin32ToHex(const uint32_t aByte, HexChar* const aChars) {\n        aChars[0] = Bin4ToHex((aByte >> 28) & NYBBLE_0);\n        aChars[1] = Bin4ToHex((aByte >> 24) & NYBBLE_0);\n        aChars[2] = Bin4ToHex((aByte >> 20) & NYBBLE_0);\n        aChars[3] = Bin4ToHex((aByte >> 16) & NYBBLE_0);\n        aChars[4] = Bin4ToHex((aByte >> 12) & NYBBLE_0);\n        aChars[5] = Bin4ToHex((aByte >> 8) & NYBBLE_0);\n        aChars[6] = Bin4ToHex((aByte >> 4) & NYBBLE_0);\n        aChars[7] = Bin4ToHex(aByte & NYBBLE_0);\n    }\n\n    \/*!\n        \\brief Convert 64 bits of binary data into sixteen hexadecimal characters.\n        \\param aByte The binary data.\n        \\param aChars The address to write the hex characters into.\n    *\/\n    static void Bin64ToHex(const uint32_t aByte, HexChar* const aChars) {\n        aChars[0] = Bin4ToHex((aByte >> 60L) & NYBBLE_0);\n        aChars[1] = Bin4ToHex((aByte >> 56L) & NYBBLE_0);\n        aChars[2] = Bin4ToHex((aByte >> 52L) & NYBBLE_0);\n        aChars[3] = Bin4ToHex((aByte >> 48L) & NYBBLE_0);\n        aChars[4] = Bin4ToHex((aByte >> 44L) & NYBBLE_0);\n        aChars[5] = Bin4ToHex((aByte >> 40L) & NYBBLE_0);\n        aChars[6] = Bin4ToHex((aByte >> 36L) & NYBBLE_0);\n        aChars[7] = Bin4ToHex((aByte >> 32L) & NYBBLE_0);\n        aChars[8] = Bin4ToHex((aByte >> 28L) & NYBBLE_0);\n        aChars[9] = Bin4ToHex((aByte >> 24L) & NYBBLE_0);\n        aChars[10] = Bin4ToHex((aByte >> 20L) & NYBBLE_0);\n        aChars[11] = Bin4ToHex((aByte >> 16L) & NYBBLE_0);\n        aChars[12] = Bin4ToHex((aByte >> 12L) & NYBBLE_0);\n        aChars[13] = Bin4ToHex((aByte >> 8L) & NYBBLE_0);\n        aChars[14] = Bin4ToHex((aByte >> 4L) & NYBBLE_0);\n        aChars[15] = Bin4ToHex(aByte & NYBBLE_0);\n    }\n\n    \/*!\n        \\brief Calculate the number of characters required to store a hexadecimal representation.\n        \\param aBinaryLength The number of bytes to represent.\n        \\return The number of characters required.\n    *\/\n    static constexpr uint32_t BinaryToHexLength(const uint32_t aBinaryLength) {\n        return aBinaryLength * 2;\n    }\n\n    \/*!\n        \\brief Calculate the number of bytes required to store a binary representation of hexadecimal data.\n        \\param aBinaryLength The number of characters to represent.\n        \\return The number of bytes required.\n    *\/\n    static constexpr uint32_t HexToBinaryLength(const uint32_t aHexLength) {\n        return (aHexLength >> 1) + (aHexLength & BIT_0);\n    }\n\n    \/*!\n        \\brief Convert binary data into it's hexadecimal representation.\n        \\param aBinary The starting address of the binary data.\n        \\param aBinaryLength The number of bytes to convert.\n        \\param aHex The starting address to write the hexadecimal data into.\n        \\param aHexLength The number of writeable chars pointed to be \\a aHex.\n        \\return False if \\a aHexLength is not long enough to contain the hexadecimal representation.\n    *\/\n    static bool BinaryToHex(const void* const aBinary, const uint32_t aBinaryLength, HexChar* const aHex, const uint32_t aHexLength) {\n        if(aHexLength < BinaryToHexLength(aBinaryLength)) return false;\n        const uint8_t* const bin = static_cast<const uint8_t*>(aBinary);\n        for(uint32_t i = 0; i < aBinaryLength; ++i) {\n            Bin8ToHex(bin[aBinaryLength - (i + 1)], aHex + i * 2);\n        }\n        return true;\n    }\n\n    \/*!\n        \\brief Convert binary data into it's hexadecimal representation.\n        \\param aHex The hexadecimal characters to convert.\n        \\param aHexLength The number of characters to convert.\n        \\param aBinary The starting address to write binary data into.\n        \\param aBinaryLength The number of bytes pointed to by \\a aBinary.\n        \\return False if aBinaryLength is too small to store the binary representation.\n    *\/\n    static bool HexToBinary(const HexChar* const aHex, const uint32_t aHexLength, void* const aBinary, const uint32_t aBinaryLength) {\n        if(aHexLength < HexToBinaryLength(aHexLength)) return false;\n        const HexChar* hex = aHex;\n        const HexChar* end = hex + aHexLength;\n        uint8_t* bin = static_cast<uint8_t*>(aBinary) + (aBinaryLength - 1);\n\n        \/\/ Convert all paired characters\n        while((end - hex) >= 2){\n            *bin = HexToBin8(hex);\n            hex += 2;\n            --bin;\n        }\n\n        \/\/ Convert trailing character, if present\n        if((end - hex) == 1) {\n            *bin = HexToBin4(*hex) << 4;\n        }\n        return true;\n    }\n\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2018 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 HEARTHSTONEPP_HAND_HPP\n#define HEARTHSTONEPP_HAND_HPP\n\n#include <hspp\/Cards\/Entity.hpp>\n#include <hspp\/Commons\/Constants.hpp>\n\n#include <array>\n\nnamespace Hearthstonepp\n{\n\/\/!\n\/\/! \\brief Hand class.\n\/\/!\n\/\/! This class is where  each player keeps the cards currently available to\n\/\/! them. The player can see their hand face-up at the bottom of the screen,\n\/\/! while the opponent's hand is shown face-down at the top of the screen.\n\/\/!\nclass Hand\n{\n public:\n    \/\/! Default constructor.\n    Hand();\n\n    \/\/! Returns the owner of hand.\n    \/\/! \\return The owner of hand.\n    Player& GetOwner() const;\n\n    \/\/! Sets the owner of hand.\n    \/\/! \\param owner The owner of hand.\n    void SetOwner(Player& owner);\n\n    \/\/! Finds out if hand is empty.\n    \/\/! \\return true if hand is empty, and false otherwise.\n    bool IsEmpty() const;\n\n    \/\/! Returns the number of cards in hand.\n    \/\/! \\return The number of cards in hand.\n    std::size_t GetNumOfCards() const;\n\n    \/\/! Returns card in hand.\n    \/\/! \\param pos The position of card in hand.\n    \/\/! \\return A card in hand at \\p pos.\n    Entity* GetCard(std::size_t pos);\n\n    \/\/! Returns all cards in hand.\n    \/\/! \\return A list of cards in hand.\n    std::vector<Entity*> GetAllCards();\n\n    \/\/! Returns the position of card in hand.\n    \/\/! \\return The position of card in hand.\n    optional<std::size_t> FindCardPos(Entity& card);\n\n    \/\/! Adds a card to hand.\n    \/\/! \\param card The card to add to hand.\n    void AddCard(Entity& card);\n\n    \/\/! Removes a card from hand.\n    \/\/! \\param card The card to remove from hand.\n    void RemoveCard(Entity& card);\n\n private:\n    Player* m_owner = nullptr;\n    std::array<Entity*, HAND_SIZE> m_cards{};\n\n    int m_numCard = 0;\n};\n}  \/\/ namespace Hearthstonepp\n\n#endif  \/\/ HEARTHSTONEPP_HAND_HPP<commit_msg>[ci skip] fix: Change the type of 'm_numCard' (int to std::size_t)<commit_after>\/\/ Copyright (c) 2018 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 HEARTHSTONEPP_HAND_HPP\n#define HEARTHSTONEPP_HAND_HPP\n\n#include <hspp\/Cards\/Entity.hpp>\n#include <hspp\/Commons\/Constants.hpp>\n\n#include <array>\n\nnamespace Hearthstonepp\n{\n\/\/!\n\/\/! \\brief Hand class.\n\/\/!\n\/\/! This class is where  each player keeps the cards currently available to\n\/\/! them. The player can see their hand face-up at the bottom of the screen,\n\/\/! while the opponent's hand is shown face-down at the top of the screen.\n\/\/!\nclass Hand\n{\n public:\n    \/\/! Default constructor.\n    Hand();\n\n    \/\/! Returns the owner of hand.\n    \/\/! \\return The owner of hand.\n    Player& GetOwner() const;\n\n    \/\/! Sets the owner of hand.\n    \/\/! \\param owner The owner of hand.\n    void SetOwner(Player& owner);\n\n    \/\/! Finds out if hand is empty.\n    \/\/! \\return true if hand is empty, and false otherwise.\n    bool IsEmpty() const;\n\n    \/\/! Returns the number of cards in hand.\n    \/\/! \\return The number of cards in hand.\n    std::size_t GetNumOfCards() const;\n\n    \/\/! Returns card in hand.\n    \/\/! \\param pos The position of card in hand.\n    \/\/! \\return A card in hand at \\p pos.\n    Entity* GetCard(std::size_t pos);\n\n    \/\/! Returns all cards in hand.\n    \/\/! \\return A list of cards in hand.\n    std::vector<Entity*> GetAllCards();\n\n    \/\/! Returns the position of card in hand.\n    \/\/! \\return The position of card in hand.\n    optional<std::size_t> FindCardPos(Entity& card);\n\n    \/\/! Adds a card to hand.\n    \/\/! \\param card The card to add to hand.\n    void AddCard(Entity& card);\n\n    \/\/! Removes a card from hand.\n    \/\/! \\param card The card to remove from hand.\n    void RemoveCard(Entity& card);\n\n private:\n    Player* m_owner = nullptr;\n    std::array<Entity*, HAND_SIZE> m_cards{};\n\n    std::size_t m_numCard = 0;\n};\n}  \/\/ namespace Hearthstonepp\n\n#endif  \/\/ HEARTHSTONEPP_HAND_HPP<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: checkerboardwipe.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-07 20:49: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#if ! defined INCLUDED_SLIDESHOW_CHECKERBOARDWIPE_HXX\n#define INCLUDED_SLIDESHOW_CHECKERBOARDWIPE_HXX\n\n#include \"osl\/diagnose.h\"\n#include \"transitiontools.hxx\"\n#include \"parametricpolypolygon.hxx\"\n\n\nnamespace presentation {\nnamespace internal {\n\n\/\/\/ Generate a check board wipe (across)\nclass CheckerBoardWipe : public ParametricPolyPolygon\n{\npublic:\n    CheckerBoardWipe( sal_Int32 unitsPerEdge = 10 )\n        : m_unitsPerEdge(unitsPerEdge),\n          m_unitRect( createUnitRect() )\n        { OSL_ASSERT( (unitsPerEdge % 2) == 0 ); }\n    virtual ::basegfx::B2DPolyPolygon operator () ( double x );\nprivate:\n    const sal_Int32 m_unitsPerEdge;\n    const ::basegfx::B2DPolyPolygon m_unitRect;\n};\n\n}\n}\n\n#endif \/* INCLUDED_SLIDESHOW_CHECKERBOARDWIPE_HXX *\/\n<commit_msg>INTEGRATION: CWS presfixes09 (1.3.18); FILE MERGED 2006\/04\/24 13:25:30 thb 1.3.18.2: #i53194# Unified include statements (local headers always have double quotes; external headers angle brackets); reverted EventMultiplexer pause events to shared_ptr; removed EventMultiplexer::removeViewHandler(), since the handler is held weakly, anyway. 2006\/03\/24 18:23:21 thb 1.3.18.1: #i37778# Moved whole slideshow engine from namespace presentation (which conflicts with one of the UNO subnamespaces) to slideshow<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: checkerboardwipe.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: kz $ $Date: 2006-12-13 15:38: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#if ! defined INCLUDED_SLIDESHOW_CHECKERBOARDWIPE_HXX\n#define INCLUDED_SLIDESHOW_CHECKERBOARDWIPE_HXX\n\n#include <osl\/diagnose.h>\n\n#include \"transitiontools.hxx\"\n#include \"parametricpolypolygon.hxx\"\n\n\nnamespace slideshow {\nnamespace internal {\n\n\/\/\/ Generate a check board wipe (across)\nclass CheckerBoardWipe : public ParametricPolyPolygon\n{\npublic:\n    CheckerBoardWipe( sal_Int32 unitsPerEdge = 10 )\n        : m_unitsPerEdge(unitsPerEdge),\n          m_unitRect( createUnitRect() )\n        { OSL_ASSERT( (unitsPerEdge % 2) == 0 ); }\n    virtual ::basegfx::B2DPolyPolygon operator () ( double x );\nprivate:\n    const sal_Int32 m_unitsPerEdge;\n    const ::basegfx::B2DPolyPolygon m_unitRect;\n};\n\n}\n}\n\n#endif \/* INCLUDED_SLIDESHOW_CHECKERBOARDWIPE_HXX *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- EmulateInstructionARM.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 \"EmulateInstructionARM.h\"\n\nusing namespace lldb;\nusing namespace lldb_private;\n\n\/\/ ARM constants used during decoding\n#define REG_RD          0\n#define LDM_REGLIST     1\n#define PC_REG          15\n#define PC_REGLIST_BIT  0x8000\n\n\/\/ ARM conditions\n#define COND_EQ     0x0\n#define COND_NE     0x1\n#define COND_CS     0x2\n#define COND_HS     0x2\n#define COND_CC     0x3\n#define COND_LO     0x3\n#define COND_MI     0x4\n#define COND_PL     0x5\n#define COND_VS     0x6\n#define COND_VC     0x7\n#define COND_HI     0x8\n#define COND_LS     0x9\n#define COND_GE     0xA\n#define COND_LT     0xB\n#define COND_GT     0xC\n#define COND_LE     0xD\n#define COND_AL     0xE\n#define COND_UNCOND 0xF\n\n\n#define MASK_CPSR_MODE_MASK\t(0x0000001fu)\n#define MASK_CPSR_T         (1u << 5)\n#define MASK_CPSR_F         (1u << 6)\n#define MASK_CPSR_I         (1u << 7)\n#define MASK_CPSR_A         (1u << 8)\n#define MASK_CPSR_E         (1u << 9)\n#define MASK_CPSR_GE_MASK   (0x000f0000u)\n#define MASK_CPSR_J         (1u << 24)\n#define MASK_CPSR_Q         (1u << 27)\n#define MASK_CPSR_V         (1u << 28)\n#define MASK_CPSR_C         (1u << 29)\n#define MASK_CPSR_Z         (1u << 30)\n#define MASK_CPSR_N         (1u << 31)\n\n\n#define ARMv4\t  (1u << 0)\n#define ARMv4T    (1u << 1)\n#define ARMv5T    (1u << 2)\n#define ARMv5TE   (1u << 3)\n#define ARMv5TEJ  (1u << 4)\n#define ARMv6\t  (1u << 5)\n#define ARMv6K    (1u << 6)\n#define ARMv6T2   (1u << 7)\n#define ARMv7\t  (1u << 8)\n#define ARMv8\t  (1u << 8)\n#define ARMvAll   (0xffffffffu)\n\ntypedef bool (*EmulateCallback) (EmulateInstructionARM *emulator);\n    \n\ntypedef enum ARMEncoding\n{\n    eEncodingA1,\n    eEncodingA2,\n    eEncodingA3,\n    eEncodingA4,\n    eEncodingA5,\n    eEncodingT1,\n    eEncodingT2,\n    eEncodingT3,\n    eEncodingT4,\n    eEncodingT5,\n} ARMEncoding;\n\n\ntypedef struct ARMOpcode\n{\n    uint32_t mask;\n    uint32_t value;\n    uint32_t variants;\n    ARMEncoding encoding;\n    const char *name;\n    EmulateCallback callback;\n};\n\nstatic bool \nEmulateARMPushEncodingA1 (EmulateInstructionARM *emulator)\n{\n#if 0\n    \/\/ ARM pseudo code...\n    if (ConditionPassed())\n    {\n        EncodingSpecificOperations(); \n        NullCheckIfThumbEE(13); \n        address = SP - 4*BitCount(registers);\n\n        for (i = 0 to 14)\n        {\n            if (registers<i> == ’1’)\n            {\n                if i == 13 && i != LowestSetBit(registers) \/\/ Only possible for encoding A1 \n                    MemA[address,4] = bits(32) UNKNOWN;\n                else \n                    MemA[address,4] = R[i];\n                address = address + 4;\n            }\n        }\n\n        if (registers<15> == ’1’) \/\/ Only possible for encoding A1 or A2 \n            MemA[address,4] = PCStoreValue();\n        \n        SP = SP - 4*BitCount(registers);\n    }\n#endif\n\n    bool success = false;\n    const uint32_t opcode = emulator->OpcodeAsUnsigned (&success);\n    if (!success)\n        return false;\n\n    if (emulator->ConditionPassed())\n    {\n        const uint32_t addr_byte_size = emulator->GetAddressByteSize();\n        const addr_t sp = emulator->ReadRegisterUnsigned (eRegisterKindGeneric, LLDB_REGNUM_GENERIC_SP, 0, &success);\n        if (!success)\n            return false;\n        const uint32_t registers = EmulateInstruction::UnsignedBits (opcode, 15, 0);\n        addr_t sp_offset = addr_byte_size * EmulateInstruction::BitCount (registers);\n        addr_t addr = sp - sp_offset;\n        uint32_t i;\n        \n        EmulateInstruction::Context context = { EmulateInstruction::eContextPushRegisterOnStack, eRegisterKindDWARF, 0, 0 };\n        for (i=0; i<15; ++i)\n        {\n            if (EmulateInstruction::BitIsSet (registers, 1u << i))\n            {\n                context.arg1 = dwarf_r0 + i;    \/\/ arg1 in the context is the DWARF register number\n                context.arg2 = addr - sp;       \/\/ arg2 in the context is the stack pointer offset\n                uint32_t reg_value = emulator->ReadRegisterUnsigned(eRegisterKindDWARF, context.arg1, 0, &success);\n                if (!success)\n                    return false;\n                if (!emulator->WriteMemoryUnsigned (context, addr, reg_value, addr_byte_size))\n                    return false;\n                addr += addr_byte_size;\n            }\n        }\n        \n        if (EmulateInstruction::BitIsSet (registers, 1u << 15))\n        {\n            context.arg1 = dwarf_pc;    \/\/ arg1 in the context is the DWARF register number\n            context.arg2 = addr - sp;       \/\/ arg2 in the context is the stack pointer offset\n            const uint32_t pc = emulator->ReadRegisterUnsigned(eRegisterKindGeneric, LLDB_REGNUM_GENERIC_PC, 0, &success);\n            if (!success)\n                return false;\n            if (!emulator->WriteMemoryUnsigned (context, addr, pc + 8, addr_byte_size))\n                return false;\n        }\n        \n        context.type = EmulateInstruction::eContextAdjustStackPointer;\n        context.arg0 = eRegisterKindGeneric;\n        context.arg1 = LLDB_REGNUM_GENERIC_SP;\n        context.arg2 = sp_offset;\n    \n        if (!emulator->WriteRegisterUnsigned (context, eRegisterKindGeneric, LLDB_REGNUM_GENERIC_SP, sp - sp_offset))\n            return false;\n    }\n    return true;\n}\n\nstatic ARMOpcode g_arm_opcodes[] =\n{\n    { 0x0fff0000, 0x092d0000, ARMvAll, eEncodingA1, \"PUSH<c> <registers>\", EmulateARMPushEncodingA1 }\n};\n\nstatic const size_t k_num_arm_opcodes = sizeof(g_arm_opcodes)\/sizeof(ARMOpcode);\n\nbool \nEmulateInstructionARM::ReadInstruction ()\n{\n    bool success = false;\n    m_inst_cpsr = ReadRegisterUnsigned (eRegisterKindGeneric, LLDB_REGNUM_GENERIC_FLAGS, 0, &success);\n    if (success)\n    {\n        addr_t pc = ReadRegisterUnsigned (eRegisterKindGeneric, LLDB_REGNUM_GENERIC_PC, LLDB_INVALID_ADDRESS, &success);\n        if (success)\n        {\n            Context read_inst_context = {eContextReadOpcode, 0, 0};\n            if (m_inst_cpsr & MASK_CPSR_T)\n            {\n                m_inst_mode = eModeThumb;\n                uint32_t thumb_opcode = ReadMemoryUnsigned(read_inst_context, pc, 2, 0, &success);\n                \n                if (success)\n                {\n                    if ((m_inst.opcode.inst16 & 0xe000) != 0xe000 || ((m_inst.opcode.inst16 & 0x1800u) == 0))\n                    {\n                        m_inst.opcode_type = eOpcode16;\n                        m_inst.opcode.inst16 = thumb_opcode;\n                    }\n                    else\n                    {\n                        m_inst.opcode_type = eOpcode32;\n                        m_inst.opcode.inst32 = (thumb_opcode << 16) | ReadMemoryUnsigned(read_inst_context, pc + 2, 2, 0, &success);\n                    }\n                }\n            }\n            else\n            {\n                m_inst_mode = eModeARM;\n                m_inst.opcode_type = eOpcode32;\n                m_inst.opcode.inst32 = ReadMemoryUnsigned(read_inst_context, pc, 4, 0, &success);\n            }\n        }\n    }\n    if (!success)\n    {\n        m_inst_mode = eModeInvalid;\n        m_inst_pc = LLDB_INVALID_ADDRESS;\n    }\n    return success;\n}\n\nuint32_t\nEmulateInstructionARM::CurrentCond ()\n{\n    switch (m_inst_mode)\n    {\n    default:\n    case eModeInvalid:\n        break;\n\n    case eModeARM:\n        return UnsignedBits(m_inst.opcode.inst32, 31, 28);\n    \n    case eModeThumb:\n        return 0x0000000Eu; \/\/ Return always for now, we need to handl IT instructions later\n    }\n    return UINT32_MAX;  \/\/ Return invalid value\n}\nbool\nEmulateInstructionARM::ConditionPassed ()\n{\n    if (m_inst_cpsr == 0)\n        return false;\n\n    const uint32_t cond = CurrentCond ();\n    \n    if (cond == UINT32_MAX)\n        return false;\n    \n    bool result = false;\n    switch (UnsignedBits(cond, 3, 1))\n    {\n    case 0: result = (m_inst_cpsr & MASK_CPSR_Z) != 0; break;\n    case 1: result = (m_inst_cpsr & MASK_CPSR_C) != 0; break;\n    case 2: result = (m_inst_cpsr & MASK_CPSR_N) != 0; break;\n    case 3: result = (m_inst_cpsr & MASK_CPSR_V) != 0; break;\n    case 4: result = ((m_inst_cpsr & MASK_CPSR_C) != 0) && ((m_inst_cpsr & MASK_CPSR_Z) == 0); break;\n    case 5: \n        {\n            bool n = (m_inst_cpsr & MASK_CPSR_N);\n            bool v = (m_inst_cpsr & MASK_CPSR_V);\n            result = n == v;\n        }\n        break;\n    case 6: \n        {\n            bool n = (m_inst_cpsr & MASK_CPSR_N);\n            bool v = (m_inst_cpsr & MASK_CPSR_V);\n            result = n == v && ((m_inst_cpsr & MASK_CPSR_Z) == 0);\n        }\n        break;\n    case 7: \n        result = true; \n        break;\n    }\n\n    if (cond & 1)\n        result = !result;\n    return result;\n}\n\n\nbool\nEmulateInstructionARM::EvaluateInstruction ()\n{\n    return false;\n}\n<commit_msg>Untabify the file.<commit_after>\/\/===-- EmulateInstructionARM.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 \"EmulateInstructionARM.h\"\n\nusing namespace lldb;\nusing namespace lldb_private;\n\n\/\/ ARM constants used during decoding\n#define REG_RD          0\n#define LDM_REGLIST     1\n#define PC_REG          15\n#define PC_REGLIST_BIT  0x8000\n\n\/\/ ARM conditions\n#define COND_EQ     0x0\n#define COND_NE     0x1\n#define COND_CS     0x2\n#define COND_HS     0x2\n#define COND_CC     0x3\n#define COND_LO     0x3\n#define COND_MI     0x4\n#define COND_PL     0x5\n#define COND_VS     0x6\n#define COND_VC     0x7\n#define COND_HI     0x8\n#define COND_LS     0x9\n#define COND_GE     0xA\n#define COND_LT     0xB\n#define COND_GT     0xC\n#define COND_LE     0xD\n#define COND_AL     0xE\n#define COND_UNCOND 0xF\n\n\n#define MASK_CPSR_MODE_MASK     (0x0000001fu)\n#define MASK_CPSR_T         (1u << 5)\n#define MASK_CPSR_F         (1u << 6)\n#define MASK_CPSR_I         (1u << 7)\n#define MASK_CPSR_A         (1u << 8)\n#define MASK_CPSR_E         (1u << 9)\n#define MASK_CPSR_GE_MASK   (0x000f0000u)\n#define MASK_CPSR_J         (1u << 24)\n#define MASK_CPSR_Q         (1u << 27)\n#define MASK_CPSR_V         (1u << 28)\n#define MASK_CPSR_C         (1u << 29)\n#define MASK_CPSR_Z         (1u << 30)\n#define MASK_CPSR_N         (1u << 31)\n\n\n#define ARMv4     (1u << 0)\n#define ARMv4T    (1u << 1)\n#define ARMv5T    (1u << 2)\n#define ARMv5TE   (1u << 3)\n#define ARMv5TEJ  (1u << 4)\n#define ARMv6     (1u << 5)\n#define ARMv6K    (1u << 6)\n#define ARMv6T2   (1u << 7)\n#define ARMv7     (1u << 8)\n#define ARMv8     (1u << 8)\n#define ARMvAll   (0xffffffffu)\n\ntypedef bool (*EmulateCallback) (EmulateInstructionARM *emulator);\n    \n\ntypedef enum ARMEncoding\n{\n    eEncodingA1,\n    eEncodingA2,\n    eEncodingA3,\n    eEncodingA4,\n    eEncodingA5,\n    eEncodingT1,\n    eEncodingT2,\n    eEncodingT3,\n    eEncodingT4,\n    eEncodingT5,\n} ARMEncoding;\n\n\ntypedef struct ARMOpcode\n{\n    uint32_t mask;\n    uint32_t value;\n    uint32_t variants;\n    ARMEncoding encoding;\n    const char *name;\n    EmulateCallback callback;\n};\n\nstatic bool \nEmulateARMPushEncodingA1 (EmulateInstructionARM *emulator)\n{\n#if 0\n    \/\/ ARM pseudo code...\n    if (ConditionPassed())\n    {\n        EncodingSpecificOperations(); \n        NullCheckIfThumbEE(13); \n        address = SP - 4*BitCount(registers);\n\n        for (i = 0 to 14)\n        {\n            if (registers<i> == ’1’)\n            {\n                if i == 13 && i != LowestSetBit(registers) \/\/ Only possible for encoding A1 \n                    MemA[address,4] = bits(32) UNKNOWN;\n                else \n                    MemA[address,4] = R[i];\n                address = address + 4;\n            }\n        }\n\n        if (registers<15> == ’1’) \/\/ Only possible for encoding A1 or A2 \n            MemA[address,4] = PCStoreValue();\n        \n        SP = SP - 4*BitCount(registers);\n    }\n#endif\n\n    bool success = false;\n    const uint32_t opcode = emulator->OpcodeAsUnsigned (&success);\n    if (!success)\n        return false;\n\n    if (emulator->ConditionPassed())\n    {\n        const uint32_t addr_byte_size = emulator->GetAddressByteSize();\n        const addr_t sp = emulator->ReadRegisterUnsigned (eRegisterKindGeneric, LLDB_REGNUM_GENERIC_SP, 0, &success);\n        if (!success)\n            return false;\n        const uint32_t registers = EmulateInstruction::UnsignedBits (opcode, 15, 0);\n        addr_t sp_offset = addr_byte_size * EmulateInstruction::BitCount (registers);\n        addr_t addr = sp - sp_offset;\n        uint32_t i;\n        \n        EmulateInstruction::Context context = { EmulateInstruction::eContextPushRegisterOnStack, eRegisterKindDWARF, 0, 0 };\n        for (i=0; i<15; ++i)\n        {\n            if (EmulateInstruction::BitIsSet (registers, 1u << i))\n            {\n                context.arg1 = dwarf_r0 + i;    \/\/ arg1 in the context is the DWARF register number\n                context.arg2 = addr - sp;       \/\/ arg2 in the context is the stack pointer offset\n                uint32_t reg_value = emulator->ReadRegisterUnsigned(eRegisterKindDWARF, context.arg1, 0, &success);\n                if (!success)\n                    return false;\n                if (!emulator->WriteMemoryUnsigned (context, addr, reg_value, addr_byte_size))\n                    return false;\n                addr += addr_byte_size;\n            }\n        }\n        \n        if (EmulateInstruction::BitIsSet (registers, 1u << 15))\n        {\n            context.arg1 = dwarf_pc;    \/\/ arg1 in the context is the DWARF register number\n            context.arg2 = addr - sp;       \/\/ arg2 in the context is the stack pointer offset\n            const uint32_t pc = emulator->ReadRegisterUnsigned(eRegisterKindGeneric, LLDB_REGNUM_GENERIC_PC, 0, &success);\n            if (!success)\n                return false;\n            if (!emulator->WriteMemoryUnsigned (context, addr, pc + 8, addr_byte_size))\n                return false;\n        }\n        \n        context.type = EmulateInstruction::eContextAdjustStackPointer;\n        context.arg0 = eRegisterKindGeneric;\n        context.arg1 = LLDB_REGNUM_GENERIC_SP;\n        context.arg2 = sp_offset;\n    \n        if (!emulator->WriteRegisterUnsigned (context, eRegisterKindGeneric, LLDB_REGNUM_GENERIC_SP, sp - sp_offset))\n            return false;\n    }\n    return true;\n}\n\nstatic ARMOpcode g_arm_opcodes[] =\n{\n    { 0x0fff0000, 0x092d0000, ARMvAll, eEncodingA1, \"PUSH<c> <registers>\", EmulateARMPushEncodingA1 }\n};\n\nstatic const size_t k_num_arm_opcodes = sizeof(g_arm_opcodes)\/sizeof(ARMOpcode);\n\nbool \nEmulateInstructionARM::ReadInstruction ()\n{\n    bool success = false;\n    m_inst_cpsr = ReadRegisterUnsigned (eRegisterKindGeneric, LLDB_REGNUM_GENERIC_FLAGS, 0, &success);\n    if (success)\n    {\n        addr_t pc = ReadRegisterUnsigned (eRegisterKindGeneric, LLDB_REGNUM_GENERIC_PC, LLDB_INVALID_ADDRESS, &success);\n        if (success)\n        {\n            Context read_inst_context = {eContextReadOpcode, 0, 0};\n            if (m_inst_cpsr & MASK_CPSR_T)\n            {\n                m_inst_mode = eModeThumb;\n                uint32_t thumb_opcode = ReadMemoryUnsigned(read_inst_context, pc, 2, 0, &success);\n                \n                if (success)\n                {\n                    if ((m_inst.opcode.inst16 & 0xe000) != 0xe000 || ((m_inst.opcode.inst16 & 0x1800u) == 0))\n                    {\n                        m_inst.opcode_type = eOpcode16;\n                        m_inst.opcode.inst16 = thumb_opcode;\n                    }\n                    else\n                    {\n                        m_inst.opcode_type = eOpcode32;\n                        m_inst.opcode.inst32 = (thumb_opcode << 16) | ReadMemoryUnsigned(read_inst_context, pc + 2, 2, 0, &success);\n                    }\n                }\n            }\n            else\n            {\n                m_inst_mode = eModeARM;\n                m_inst.opcode_type = eOpcode32;\n                m_inst.opcode.inst32 = ReadMemoryUnsigned(read_inst_context, pc, 4, 0, &success);\n            }\n        }\n    }\n    if (!success)\n    {\n        m_inst_mode = eModeInvalid;\n        m_inst_pc = LLDB_INVALID_ADDRESS;\n    }\n    return success;\n}\n\nuint32_t\nEmulateInstructionARM::CurrentCond ()\n{\n    switch (m_inst_mode)\n    {\n    default:\n    case eModeInvalid:\n        break;\n\n    case eModeARM:\n        return UnsignedBits(m_inst.opcode.inst32, 31, 28);\n    \n    case eModeThumb:\n        return 0x0000000Eu; \/\/ Return always for now, we need to handl IT instructions later\n    }\n    return UINT32_MAX;  \/\/ Return invalid value\n}\nbool\nEmulateInstructionARM::ConditionPassed ()\n{\n    if (m_inst_cpsr == 0)\n        return false;\n\n    const uint32_t cond = CurrentCond ();\n    \n    if (cond == UINT32_MAX)\n        return false;\n    \n    bool result = false;\n    switch (UnsignedBits(cond, 3, 1))\n    {\n    case 0: result = (m_inst_cpsr & MASK_CPSR_Z) != 0; break;\n    case 1: result = (m_inst_cpsr & MASK_CPSR_C) != 0; break;\n    case 2: result = (m_inst_cpsr & MASK_CPSR_N) != 0; break;\n    case 3: result = (m_inst_cpsr & MASK_CPSR_V) != 0; break;\n    case 4: result = ((m_inst_cpsr & MASK_CPSR_C) != 0) && ((m_inst_cpsr & MASK_CPSR_Z) == 0); break;\n    case 5: \n        {\n            bool n = (m_inst_cpsr & MASK_CPSR_N);\n            bool v = (m_inst_cpsr & MASK_CPSR_V);\n            result = n == v;\n        }\n        break;\n    case 6: \n        {\n            bool n = (m_inst_cpsr & MASK_CPSR_N);\n            bool v = (m_inst_cpsr & MASK_CPSR_V);\n            result = n == v && ((m_inst_cpsr & MASK_CPSR_Z) == 0);\n        }\n        break;\n    case 7: \n        result = true; \n        break;\n    }\n\n    if (cond & 1)\n        result = !result;\n    return result;\n}\n\n\nbool\nEmulateInstructionARM::EvaluateInstruction ()\n{\n    return false;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- DebugNamesDWARFIndex.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 \"Plugins\/SymbolFile\/DWARF\/DebugNamesDWARFIndex.h\"\n#include \"Plugins\/SymbolFile\/DWARF\/DWARFDebugInfo.h\"\n#include \"Plugins\/SymbolFile\/DWARF\/DWARFDeclContext.h\"\n#include \"Plugins\/SymbolFile\/DWARF\/SymbolFileDWARFDwo.h\"\n#include \"lldb\/Utility\/RegularExpression.h\"\n#include \"lldb\/Utility\/Stream.h\"\n\nusing namespace lldb_private;\nusing namespace lldb;\n\nllvm::Expected<std::unique_ptr<DebugNamesDWARFIndex>>\nDebugNamesDWARFIndex::Create(Module &module, DWARFDataExtractor debug_names,\n                             DWARFDataExtractor debug_str,\n                             DWARFDebugInfo *debug_info) {\n  if (!debug_info) {\n    return llvm::make_error<llvm::StringError>(\"debug info null\",\n                                               llvm::inconvertibleErrorCode());\n  }\n  auto index_up = llvm::make_unique<DebugNames>(debug_names.GetAsLLVM(),\n                                                debug_str.GetAsLLVM());\n  if (llvm::Error E = index_up->extract())\n    return std::move(E);\n\n  return std::unique_ptr<DebugNamesDWARFIndex>(new DebugNamesDWARFIndex(\n      module, std::move(index_up), debug_names, debug_str, *debug_info));\n}\n\nllvm::DenseSet<dw_offset_t>\nDebugNamesDWARFIndex::GetUnits(const DebugNames &debug_names) {\n  llvm::DenseSet<dw_offset_t> result;\n  for (const DebugNames::NameIndex &ni : debug_names) {\n    for (uint32_t cu = 0; cu < ni.getCUCount(); ++cu)\n      result.insert(ni.getCUOffset(cu));\n  }\n  return result;\n}\n\nllvm::Optional<DIERef>\nDebugNamesDWARFIndex::ToDIERef(const DebugNames::Entry &entry) {\n  llvm::Optional<uint64_t> cu_offset = entry.getCUOffset();\n  if (!cu_offset)\n    return llvm::None;\n\n  DWARFUnit *cu = m_debug_info.GetUnitAtOffset(DIERef::Section::DebugInfo, *cu_offset);\n  if (!cu)\n    return llvm::None;\n\n  \/\/ This initializes the DWO symbol file. It's not possible for\n  \/\/ GetDwoSymbolFile to call this automatically because of mutual recursion\n  \/\/ between this and DWARFDebugInfoEntry::GetAttributeValue.\n  cu->ExtractUnitDIEIfNeeded();\n  cu = &cu->GetNonSkeletonUnit();\n\n  if (llvm::Optional<uint64_t> die_offset = entry.getDIEUnitOffset())\n    return DIERef(cu->GetSymbolFileDWARF().GetDwoNum(),\n                  DIERef::Section::DebugInfo, cu->GetOffset() + *die_offset);\n\n  return llvm::None;\n}\n\nvoid DebugNamesDWARFIndex::Append(const DebugNames::Entry &entry,\n                                  DIEArray &offsets) {\n  if (llvm::Optional<DIERef> ref = ToDIERef(entry))\n    offsets.push_back(*ref);\n}\n\nvoid DebugNamesDWARFIndex::MaybeLogLookupError(llvm::Error error,\n                                               const DebugNames::NameIndex &ni,\n                                               llvm::StringRef name) {\n  \/\/ Ignore SentinelErrors, log everything else.\n  LLDB_LOG_ERROR(\n      LogChannelDWARF::GetLogIfAll(DWARF_LOG_LOOKUPS),\n      handleErrors(std::move(error), [](const DebugNames::SentinelError &) {}),\n      \"Failed to parse index entries for index at {1:x}, name {2}: {0}\",\n      ni.getUnitOffset(), name);\n}\n\nvoid DebugNamesDWARFIndex::GetGlobalVariables(ConstString basename,\n                                              DIEArray &offsets) {\n  m_fallback.GetGlobalVariables(basename, offsets);\n\n  for (const DebugNames::Entry &entry :\n       m_debug_names_up->equal_range(basename.GetStringRef())) {\n    if (entry.tag() != DW_TAG_variable)\n      continue;\n\n    Append(entry, offsets);\n  }\n}\n\nvoid DebugNamesDWARFIndex::GetGlobalVariables(const RegularExpression &regex,\n                                              DIEArray &offsets) {\n  m_fallback.GetGlobalVariables(regex, offsets);\n\n  for (const DebugNames::NameIndex &ni: *m_debug_names_up) {\n    for (DebugNames::NameTableEntry nte: ni) {\n      if (!regex.Execute(nte.getString()))\n        continue;\n\n      uint32_t entry_offset = nte.getEntryOffset();\n      llvm::Expected<DebugNames::Entry> entry_or = ni.getEntry(&entry_offset);\n      for (; entry_or; entry_or = ni.getEntry(&entry_offset)) {\n        if (entry_or->tag() != DW_TAG_variable)\n          continue;\n\n        Append(*entry_or, offsets);\n      }\n      MaybeLogLookupError(entry_or.takeError(), ni, nte.getString());\n    }\n  }\n}\n\nvoid DebugNamesDWARFIndex::GetGlobalVariables(const DWARFUnit &cu,\n                                              DIEArray &offsets) {\n  m_fallback.GetGlobalVariables(cu, offsets);\n\n  uint64_t cu_offset = cu.GetOffset();\n  for (const DebugNames::NameIndex &ni: *m_debug_names_up) {\n    for (DebugNames::NameTableEntry nte: ni) {\n      uint32_t entry_offset = nte.getEntryOffset();\n      llvm::Expected<DebugNames::Entry> entry_or = ni.getEntry(&entry_offset);\n      for (; entry_or; entry_or = ni.getEntry(&entry_offset)) {\n        if (entry_or->tag() != DW_TAG_variable)\n          continue;\n        if (entry_or->getCUOffset() != cu_offset)\n          continue;\n\n        Append(*entry_or, offsets);\n      }\n      MaybeLogLookupError(entry_or.takeError(), ni, nte.getString());\n    }\n  }\n}\n\nvoid DebugNamesDWARFIndex::GetCompleteObjCClass(ConstString class_name,\n                                                bool must_be_implementation,\n                                                DIEArray &offsets) {\n  m_fallback.GetCompleteObjCClass(class_name, must_be_implementation, offsets);\n\n  \/\/ Keep a list of incomplete types as fallback for when we don't find the\n  \/\/ complete type.\n  DIEArray incomplete_types;\n\n  for (const DebugNames::Entry &entry :\n       m_debug_names_up->equal_range(class_name.GetStringRef())) {\n    if (entry.tag() != DW_TAG_structure_type &&\n        entry.tag() != DW_TAG_class_type)\n      continue;\n\n    llvm::Optional<DIERef> ref = ToDIERef(entry);\n    if (!ref)\n      continue;\n\n    DWARFUnit *cu = m_debug_info.GetUnit(*ref);\n    if (!cu || !cu->Supports_DW_AT_APPLE_objc_complete_type()) {\n      incomplete_types.push_back(*ref);\n      continue;\n    }\n\n    \/\/ FIXME: We should return DWARFDIEs so we don't have to resolve it twice.\n    DWARFDIE die = m_debug_info.GetDIE(*ref);\n    if (!die)\n      continue;\n\n    if (die.GetAttributeValueAsUnsigned(DW_AT_APPLE_objc_complete_type, 0)) {\n      \/\/ If we find the complete version we're done.\n      offsets.push_back(*ref);\n      return;\n    } else {\n      incomplete_types.push_back(*ref);\n    }\n  }\n\n  offsets.insert(offsets.end(), incomplete_types.begin(),\n                 incomplete_types.end());\n}\n\nvoid DebugNamesDWARFIndex::GetTypes(ConstString name, DIEArray &offsets) {\n  m_fallback.GetTypes(name, offsets);\n\n  for (const DebugNames::Entry &entry :\n       m_debug_names_up->equal_range(name.GetStringRef())) {\n    if (isType(entry.tag()))\n      Append(entry, offsets);\n  }\n}\n\nvoid DebugNamesDWARFIndex::GetTypes(const DWARFDeclContext &context,\n                                    DIEArray &offsets) {\n  m_fallback.GetTypes(context, offsets);\n\n  for (const DebugNames::Entry &entry :\n       m_debug_names_up->equal_range(context[0].name)) {\n    if (entry.tag() == context[0].tag)\n      Append(entry, offsets);\n  }\n}\n\nvoid DebugNamesDWARFIndex::GetNamespaces(ConstString name, DIEArray &offsets) {\n  m_fallback.GetNamespaces(name, offsets);\n\n  for (const DebugNames::Entry &entry :\n       m_debug_names_up->equal_range(name.GetStringRef())) {\n    if (entry.tag() == DW_TAG_namespace)\n      Append(entry, offsets);\n  }\n}\n\nvoid DebugNamesDWARFIndex::GetFunctions(\n    ConstString name, SymbolFileDWARF &dwarf,\n    const CompilerDeclContext &parent_decl_ctx, uint32_t name_type_mask,\n    std::vector<DWARFDIE> &dies) {\n\n  std::vector<DWARFDIE> v;\n  m_fallback.GetFunctions(name, dwarf, parent_decl_ctx, name_type_mask, v);\n\n  for (const DebugNames::Entry &entry :\n       m_debug_names_up->equal_range(name.GetStringRef())) {\n    Tag tag = entry.tag();\n    if (tag != DW_TAG_subprogram && tag != DW_TAG_inlined_subroutine)\n      continue;\n\n    if (llvm::Optional<DIERef> ref = ToDIERef(entry))\n      ProcessFunctionDIE(name.GetStringRef(), *ref, dwarf, parent_decl_ctx,\n                         name_type_mask, v);\n  }\n\n  std::set<DWARFDebugInfoEntry *> seen;\n  for (DWARFDIE die : v)\n    if (seen.insert(die.GetDIE()).second)\n      dies.push_back(die);\n}\n\nvoid DebugNamesDWARFIndex::GetFunctions(const RegularExpression &regex,\n                                        DIEArray &offsets) {\n  m_fallback.GetFunctions(regex, offsets);\n\n  for (const DebugNames::NameIndex &ni: *m_debug_names_up) {\n    for (DebugNames::NameTableEntry nte: ni) {\n      if (!regex.Execute(nte.getString()))\n        continue;\n\n      uint32_t entry_offset = nte.getEntryOffset();\n      llvm::Expected<DebugNames::Entry> entry_or = ni.getEntry(&entry_offset);\n      for (; entry_or; entry_or = ni.getEntry(&entry_offset)) {\n        Tag tag = entry_or->tag();\n        if (tag != DW_TAG_subprogram && tag != DW_TAG_inlined_subroutine)\n          continue;\n\n        Append(*entry_or, offsets);\n      }\n      MaybeLogLookupError(entry_or.takeError(), ni, nte.getString());\n    }\n  }\n}\n\nvoid DebugNamesDWARFIndex::Dump(Stream &s) {\n  m_fallback.Dump(s);\n\n  std::string data;\n  llvm::raw_string_ostream os(data);\n  m_debug_names_up->dump(os);\n  s.PutCString(os.str());\n}\n<commit_msg>Update LLDB to follow changes in llvm::DWARFDebugNames::NameIndex (4\/5)<commit_after>\/\/===-- DebugNamesDWARFIndex.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 \"Plugins\/SymbolFile\/DWARF\/DebugNamesDWARFIndex.h\"\n#include \"Plugins\/SymbolFile\/DWARF\/DWARFDebugInfo.h\"\n#include \"Plugins\/SymbolFile\/DWARF\/DWARFDeclContext.h\"\n#include \"Plugins\/SymbolFile\/DWARF\/SymbolFileDWARFDwo.h\"\n#include \"lldb\/Utility\/RegularExpression.h\"\n#include \"lldb\/Utility\/Stream.h\"\n\nusing namespace lldb_private;\nusing namespace lldb;\n\nllvm::Expected<std::unique_ptr<DebugNamesDWARFIndex>>\nDebugNamesDWARFIndex::Create(Module &module, DWARFDataExtractor debug_names,\n                             DWARFDataExtractor debug_str,\n                             DWARFDebugInfo *debug_info) {\n  if (!debug_info) {\n    return llvm::make_error<llvm::StringError>(\"debug info null\",\n                                               llvm::inconvertibleErrorCode());\n  }\n  auto index_up = llvm::make_unique<DebugNames>(debug_names.GetAsLLVM(),\n                                                debug_str.GetAsLLVM());\n  if (llvm::Error E = index_up->extract())\n    return std::move(E);\n\n  return std::unique_ptr<DebugNamesDWARFIndex>(new DebugNamesDWARFIndex(\n      module, std::move(index_up), debug_names, debug_str, *debug_info));\n}\n\nllvm::DenseSet<dw_offset_t>\nDebugNamesDWARFIndex::GetUnits(const DebugNames &debug_names) {\n  llvm::DenseSet<dw_offset_t> result;\n  for (const DebugNames::NameIndex &ni : debug_names) {\n    for (uint32_t cu = 0; cu < ni.getCUCount(); ++cu)\n      result.insert(ni.getCUOffset(cu));\n  }\n  return result;\n}\n\nllvm::Optional<DIERef>\nDebugNamesDWARFIndex::ToDIERef(const DebugNames::Entry &entry) {\n  llvm::Optional<uint64_t> cu_offset = entry.getCUOffset();\n  if (!cu_offset)\n    return llvm::None;\n\n  DWARFUnit *cu = m_debug_info.GetUnitAtOffset(DIERef::Section::DebugInfo, *cu_offset);\n  if (!cu)\n    return llvm::None;\n\n  \/\/ This initializes the DWO symbol file. It's not possible for\n  \/\/ GetDwoSymbolFile to call this automatically because of mutual recursion\n  \/\/ between this and DWARFDebugInfoEntry::GetAttributeValue.\n  cu->ExtractUnitDIEIfNeeded();\n  cu = &cu->GetNonSkeletonUnit();\n\n  if (llvm::Optional<uint64_t> die_offset = entry.getDIEUnitOffset())\n    return DIERef(cu->GetSymbolFileDWARF().GetDwoNum(),\n                  DIERef::Section::DebugInfo, cu->GetOffset() + *die_offset);\n\n  return llvm::None;\n}\n\nvoid DebugNamesDWARFIndex::Append(const DebugNames::Entry &entry,\n                                  DIEArray &offsets) {\n  if (llvm::Optional<DIERef> ref = ToDIERef(entry))\n    offsets.push_back(*ref);\n}\n\nvoid DebugNamesDWARFIndex::MaybeLogLookupError(llvm::Error error,\n                                               const DebugNames::NameIndex &ni,\n                                               llvm::StringRef name) {\n  \/\/ Ignore SentinelErrors, log everything else.\n  LLDB_LOG_ERROR(\n      LogChannelDWARF::GetLogIfAll(DWARF_LOG_LOOKUPS),\n      handleErrors(std::move(error), [](const DebugNames::SentinelError &) {}),\n      \"Failed to parse index entries for index at {1:x}, name {2}: {0}\",\n      ni.getUnitOffset(), name);\n}\n\nvoid DebugNamesDWARFIndex::GetGlobalVariables(ConstString basename,\n                                              DIEArray &offsets) {\n  m_fallback.GetGlobalVariables(basename, offsets);\n\n  for (const DebugNames::Entry &entry :\n       m_debug_names_up->equal_range(basename.GetStringRef())) {\n    if (entry.tag() != DW_TAG_variable)\n      continue;\n\n    Append(entry, offsets);\n  }\n}\n\nvoid DebugNamesDWARFIndex::GetGlobalVariables(const RegularExpression &regex,\n                                              DIEArray &offsets) {\n  m_fallback.GetGlobalVariables(regex, offsets);\n\n  for (const DebugNames::NameIndex &ni: *m_debug_names_up) {\n    for (DebugNames::NameTableEntry nte: ni) {\n      if (!regex.Execute(nte.getString()))\n        continue;\n\n      uint64_t entry_offset = nte.getEntryOffset();\n      llvm::Expected<DebugNames::Entry> entry_or = ni.getEntry(&entry_offset);\n      for (; entry_or; entry_or = ni.getEntry(&entry_offset)) {\n        if (entry_or->tag() != DW_TAG_variable)\n          continue;\n\n        Append(*entry_or, offsets);\n      }\n      MaybeLogLookupError(entry_or.takeError(), ni, nte.getString());\n    }\n  }\n}\n\nvoid DebugNamesDWARFIndex::GetGlobalVariables(const DWARFUnit &cu,\n                                              DIEArray &offsets) {\n  m_fallback.GetGlobalVariables(cu, offsets);\n\n  uint64_t cu_offset = cu.GetOffset();\n  for (const DebugNames::NameIndex &ni: *m_debug_names_up) {\n    for (DebugNames::NameTableEntry nte: ni) {\n      uint64_t entry_offset = nte.getEntryOffset();\n      llvm::Expected<DebugNames::Entry> entry_or = ni.getEntry(&entry_offset);\n      for (; entry_or; entry_or = ni.getEntry(&entry_offset)) {\n        if (entry_or->tag() != DW_TAG_variable)\n          continue;\n        if (entry_or->getCUOffset() != cu_offset)\n          continue;\n\n        Append(*entry_or, offsets);\n      }\n      MaybeLogLookupError(entry_or.takeError(), ni, nte.getString());\n    }\n  }\n}\n\nvoid DebugNamesDWARFIndex::GetCompleteObjCClass(ConstString class_name,\n                                                bool must_be_implementation,\n                                                DIEArray &offsets) {\n  m_fallback.GetCompleteObjCClass(class_name, must_be_implementation, offsets);\n\n  \/\/ Keep a list of incomplete types as fallback for when we don't find the\n  \/\/ complete type.\n  DIEArray incomplete_types;\n\n  for (const DebugNames::Entry &entry :\n       m_debug_names_up->equal_range(class_name.GetStringRef())) {\n    if (entry.tag() != DW_TAG_structure_type &&\n        entry.tag() != DW_TAG_class_type)\n      continue;\n\n    llvm::Optional<DIERef> ref = ToDIERef(entry);\n    if (!ref)\n      continue;\n\n    DWARFUnit *cu = m_debug_info.GetUnit(*ref);\n    if (!cu || !cu->Supports_DW_AT_APPLE_objc_complete_type()) {\n      incomplete_types.push_back(*ref);\n      continue;\n    }\n\n    \/\/ FIXME: We should return DWARFDIEs so we don't have to resolve it twice.\n    DWARFDIE die = m_debug_info.GetDIE(*ref);\n    if (!die)\n      continue;\n\n    if (die.GetAttributeValueAsUnsigned(DW_AT_APPLE_objc_complete_type, 0)) {\n      \/\/ If we find the complete version we're done.\n      offsets.push_back(*ref);\n      return;\n    } else {\n      incomplete_types.push_back(*ref);\n    }\n  }\n\n  offsets.insert(offsets.end(), incomplete_types.begin(),\n                 incomplete_types.end());\n}\n\nvoid DebugNamesDWARFIndex::GetTypes(ConstString name, DIEArray &offsets) {\n  m_fallback.GetTypes(name, offsets);\n\n  for (const DebugNames::Entry &entry :\n       m_debug_names_up->equal_range(name.GetStringRef())) {\n    if (isType(entry.tag()))\n      Append(entry, offsets);\n  }\n}\n\nvoid DebugNamesDWARFIndex::GetTypes(const DWARFDeclContext &context,\n                                    DIEArray &offsets) {\n  m_fallback.GetTypes(context, offsets);\n\n  for (const DebugNames::Entry &entry :\n       m_debug_names_up->equal_range(context[0].name)) {\n    if (entry.tag() == context[0].tag)\n      Append(entry, offsets);\n  }\n}\n\nvoid DebugNamesDWARFIndex::GetNamespaces(ConstString name, DIEArray &offsets) {\n  m_fallback.GetNamespaces(name, offsets);\n\n  for (const DebugNames::Entry &entry :\n       m_debug_names_up->equal_range(name.GetStringRef())) {\n    if (entry.tag() == DW_TAG_namespace)\n      Append(entry, offsets);\n  }\n}\n\nvoid DebugNamesDWARFIndex::GetFunctions(\n    ConstString name, SymbolFileDWARF &dwarf,\n    const CompilerDeclContext &parent_decl_ctx, uint32_t name_type_mask,\n    std::vector<DWARFDIE> &dies) {\n\n  std::vector<DWARFDIE> v;\n  m_fallback.GetFunctions(name, dwarf, parent_decl_ctx, name_type_mask, v);\n\n  for (const DebugNames::Entry &entry :\n       m_debug_names_up->equal_range(name.GetStringRef())) {\n    Tag tag = entry.tag();\n    if (tag != DW_TAG_subprogram && tag != DW_TAG_inlined_subroutine)\n      continue;\n\n    if (llvm::Optional<DIERef> ref = ToDIERef(entry))\n      ProcessFunctionDIE(name.GetStringRef(), *ref, dwarf, parent_decl_ctx,\n                         name_type_mask, v);\n  }\n\n  std::set<DWARFDebugInfoEntry *> seen;\n  for (DWARFDIE die : v)\n    if (seen.insert(die.GetDIE()).second)\n      dies.push_back(die);\n}\n\nvoid DebugNamesDWARFIndex::GetFunctions(const RegularExpression &regex,\n                                        DIEArray &offsets) {\n  m_fallback.GetFunctions(regex, offsets);\n\n  for (const DebugNames::NameIndex &ni: *m_debug_names_up) {\n    for (DebugNames::NameTableEntry nte: ni) {\n      if (!regex.Execute(nte.getString()))\n        continue;\n\n      uint64_t entry_offset = nte.getEntryOffset();\n      llvm::Expected<DebugNames::Entry> entry_or = ni.getEntry(&entry_offset);\n      for (; entry_or; entry_or = ni.getEntry(&entry_offset)) {\n        Tag tag = entry_or->tag();\n        if (tag != DW_TAG_subprogram && tag != DW_TAG_inlined_subroutine)\n          continue;\n\n        Append(*entry_or, offsets);\n      }\n      MaybeLogLookupError(entry_or.takeError(), ni, nte.getString());\n    }\n  }\n}\n\nvoid DebugNamesDWARFIndex::Dump(Stream &s) {\n  m_fallback.Dump(s);\n\n  std::string data;\n  llvm::raw_string_ostream os(data);\n  m_debug_names_up->dump(os);\n  s.PutCString(os.str());\n}\n<|endoftext|>"}
{"text":"<commit_before> \/*\n    yahooconferencemessagemanager.cpp\n\n    Copyright (c) 2003 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\n#include <kdebug.h>\n \n#include \"kopetecontact.h\"\n#include \"kopetemessagemanager.h\"\n#include \"kopetemessagemanagerfactory.h\"\n#include \"yahooprotocol.h\"\n#include \"yahoocontact.h\"\n#include \"yahooconferencemessagemanager.h\"\n#include \"yahooconferencemessagemanager.moc\"\n\nYahooConferenceMessageManager::YahooConferenceMessageManager(const KopeteContact *user,\n\t\t\t\t\t\t\t\t\t\t   KopeteContactPtrList others,\n\t\t\t\t\t\t\t\t\t\t   const KopeteMessageManager::WidgetType type,\n\t\t\t\t\t\t\t\t\t\t   const char *name)\n\t\t\t\t\t: KopeteMessageManager(user, others, YahooProtocol::protocol(), 0,\n\t\t\t\t\t\t\t\t\t\t   type, YahooProtocol::protocol(), name )\n{\n\n\t\/\/ let Kopete's factory know about us\n\tKopeteMessageManagerFactory::factory()->addKopeteMessageManager(this);\n\n\t\/\/ this slot will forward messages to the protocol\n\tconnect( this, SIGNAL( messageSent( const KopeteMessage&,\n\t\tKopeteMessageManager* ) ),\n\t\tthis, SLOT( slotMessageSent( const KopeteMessage&,\n\t\tKopeteMessageManager* ) ) );\n\n\t\/\/ in order to use auto-deletion, we have to create a chat window\n\t\/\/ first or we will self-destruct ourselves right away\n\tnewChatWindow();\n\tsetCanBeDeleted(true);\n\n}\n\nvoid YahooConferenceMessageManager::slotMessageSent(const KopeteMessage &message, KopeteMessageManager *)\n{\n\tkdDebug(14130) << \"[YahooImMessageManager] slotMessageSent called: \" << message.body() << endl;\n\n}\n\nYahooConferenceMessageManager::~YahooConferenceMessageManager()\n{\n}\n<commit_msg>Changed newChatWindow for newChatView in the two files so it would compile. Don't know if it gives the desired behaviour yet though...<commit_after> \/*\n    yahooconferencemessagemanager.cpp\n\n    Copyright (c) 2003 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\n#include <kdebug.h>\n \n#include \"kopetecontact.h\"\n#include \"kopetemessagemanager.h\"\n#include \"kopetemessagemanagerfactory.h\"\n#include \"yahooprotocol.h\"\n#include \"yahoocontact.h\"\n#include \"yahooconferencemessagemanager.h\"\n#include \"yahooconferencemessagemanager.moc\"\n\nYahooConferenceMessageManager::YahooConferenceMessageManager(const KopeteContact *user,\n\t\t\t\t\t\t\t\t\t\t   KopeteContactPtrList others,\n\t\t\t\t\t\t\t\t\t\t   const KopeteMessageManager::WidgetType type,\n\t\t\t\t\t\t\t\t\t\t   const char *name)\n\t\t\t\t\t: KopeteMessageManager(user, others, YahooProtocol::protocol(), 0,\n\t\t\t\t\t\t\t\t\t\t   type, YahooProtocol::protocol(), name )\n{\n\n\t\/\/ let Kopete's factory know about us\n\tKopeteMessageManagerFactory::factory()->addKopeteMessageManager(this);\n\n\t\/\/ this slot will forward messages to the protocol\n\tconnect( this, SIGNAL( messageSent( const KopeteMessage&,\n\t\tKopeteMessageManager* ) ),\n\t\tthis, SLOT( slotMessageSent( const KopeteMessage&,\n\t\tKopeteMessageManager* ) ) );\n\n\t\/\/ in order to use auto-deletion, we have to create a chat window\n\t\/\/ first or we will self-destruct ourselves right away\n\tnewChatView();\n\tsetCanBeDeleted(true);\n\n}\n\nvoid YahooConferenceMessageManager::slotMessageSent(const KopeteMessage &message, KopeteMessageManager *)\n{\n\tkdDebug(14130) << \"[YahooImMessageManager] slotMessageSent called: \" << message.body() << endl;\n\n}\n\nYahooConferenceMessageManager::~YahooConferenceMessageManager()\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\/* $Id$ *\/\n#include <Riostream.h> \n#include <TROOT.h>\n#include <TSystem.h>\n#include <TInterpreter.h>\n#include <TChain.h>\n#include <TFile.h>\n#include <TList.h>\n#include <TH1.h>\n\n#include \"AliAnalysisTaskJets.h\"\n#include \"AliAnalysisManager.h\"\n#include \"AliJetFinder.h\"\n#include \"AliJetHeader.h\"\n#include \"AliJetReader.h\"\n#include \"AliJetReaderHeader.h\"\n#include \"AliJetHistos.h\"\n#include \"AliESDEvent.h\"\n#include \"AliESD.h\"\n#include \"AliAODEvent.h\"\n#include \"AliAODJetEventBackground.h\"\n#include \"AliAODHandler.h\"\n#include \"AliAODExtension.h\"\n#include \"AliMCEventHandler.h\"\n#include \"AliESDInputHandler.h\"\n#include \"AliMCEvent.h\"\n#include \"AliStack.h\"\n\n\nClassImp(AliAnalysisTaskJets)\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nAliAnalysisTaskJets::AliAnalysisTaskJets():\n  AliAnalysisTaskSE(),\n  fConfigFile(\"ConfigJetAnalysis.C\"),\n  fNonStdBranch(\"\"), \n  fNonStdFile(\"\"),\n  fJetFinder(0x0),\n  fHistos(0x0),\n  fAODExtension(0x0),\n  fListOfHistos(0x0),\n  fChain(0x0),\n  fOpt(0),\n  fReadAODFromOutput(0),\n  fUseAODBackground(kFALSE),\n  fFilterPt(0.)\n{\n  \/\/ Default constructor\n}\n\nAliAnalysisTaskJets::AliAnalysisTaskJets(const char* name):\n  AliAnalysisTaskSE(name),\n  fConfigFile(\"ConfigJetAnalysis.C\"),\n  fNonStdBranch(\"\"),\n  fNonStdFile(\"\"),\n  fJetFinder(0x0),\n  fHistos(0x0),\n  fAODExtension(0x0),\n  fListOfHistos(0x0),\n  fChain(0x0),\n  fOpt(0),\n  fReadAODFromOutput(0),\n  fUseAODBackground(kFALSE),\n  fFilterPt(0.)\n{\n  \/\/ Default constructor\n  DefineOutput(1, TList::Class());\n}\n\nAliAnalysisTaskJets::AliAnalysisTaskJets(const char* name, TChain* chain):\n  AliAnalysisTaskSE(name),\n  fConfigFile(\"ConfigJetAnalysis.C\"),\n  fNonStdBranch(\"\"),\n  fNonStdFile(\"\"),\n  fJetFinder(0x0),\n  fHistos(0x0),\n  fAODExtension(0x0),\n  fListOfHistos(0x0),\n  fChain(chain),\n  fOpt(0),\n  fReadAODFromOutput(0),\n  fUseAODBackground(kFALSE),\n  fFilterPt(0.)\n{\n  \/\/ Default constructor\n  DefineOutput(1, TList::Class());\n}\n\n\/\/----------------------------------------------------------------\nvoid AliAnalysisTaskJets::UserCreateOutputObjects()\n{\n  \/\/ Create the output container\n  \/\/\n  if (fDebug > 1) printf(\"AnalysisTaskJets::CreateOutPutData() \\n\");\n\n  AliJetHeader *fH = fJetFinder->GetHeader();\n\n  if(fNonStdBranch.Length()==0)\n    {\n      \/\/  Connec default AOD to jet finder\n      \/\/ create a new branch for the background\n\n      if(fUseAODBackground){\n\tif(!AODEvent()->FindListObject(AliAODJetEventBackground::StdBranchName())){\n\t  AliAODJetEventBackground* evBkg = new AliAODJetEventBackground();\n\t  evBkg->SetName(AliAODJetEventBackground::StdBranchName());\n\t  AddAODBranch(\"AliAODJetEventBackground\",&evBkg);\n\t}\n      }\n      fJetFinder->ConnectAOD(AODEvent());\n    }\n  else\n    {\n      \/\/ Create a new branch for jets...\n      \/\/ how is this reset? -> cleared in the UserExec....\n      \/\/ Can this be handled by the framework?\n      \/\/ here we can also have the case that the brnaches are written to a separate file\n\n      TClonesArray *tca = new TClonesArray(\"AliAODJet\", 0);\n      tca->SetName(fNonStdBranch.Data());\n      AddAODBranch(\"TClonesArray\",&tca,fNonStdFile.Data());\n      if(fUseAODBackground){\n\tif(!AODEvent() || !AODEvent()->FindListObject(Form(\"%s_%s\",AliAODJetEventBackground::StdBranchName(),fNonStdBranch.Data()))){\n\t  AliAODJetEventBackground* evBkg = new AliAODJetEventBackground();\n\t  evBkg->SetName(Form(\"%s_%s\",AliAODJetEventBackground::StdBranchName(),fNonStdBranch.Data()));\n\t  AddAODBranch(\"AliAODJetEventBackground\",&evBkg,fNonStdFile.Data());\n\t}\n      }\n      if(fNonStdFile.Length()!=0){\n\t\/\/ \n\t\/\/ case that we have an AOD extension we need to fetch the jets from the extended output\n\t\/\/ we identifay the extension aod event by looking for the branchname\n\tAliAODHandler *aodH = dynamic_cast<AliAODHandler*>(AliAnalysisManager::GetAnalysisManager()->GetOutputEventHandler());\n\tfAODExtension = 0;\n\tif(aodH){\n\t  TObjArray* extArray = aodH->GetExtensions();\n\t  if (extArray) {\n\t    TIter next(extArray);\n\t    while ((fAODExtension=(AliAODExtension*)next())){\n\t      TObject *obj = fAODExtension->GetAOD()->FindListObject(fNonStdBranch.Data());\n\t      if(fDebug>10){\n\t\tPrintf(\"%s:%d Dumping..\",(char*)__FILE__,__LINE__);\n\t\tfAODExtension->GetAOD()->Dump();\n\t      }\n\t      if(obj){\n\t      if(fDebug>1)Printf(\"AODExtension found for %s\",fNonStdBranch.Data());\n\t      break;\n\t      }\n\t      fAODExtension = 0;\n\t    }\n\t  }\n\t}\n\tif(fAODExtension)fJetFinder->ConnectAODNonStd(fAODExtension->GetAOD(), fNonStdBranch.Data()); \n      }\n      else{\n\tif (fDebug > 1) printf(\"Connecting Non Std Branch AOD %p %s \\n\",AODEvent(),fNonStdBranch.Data());\n\tfJetFinder->ConnectAODNonStd(AODEvent(), fNonStdBranch.Data()); \n      }\n    }\n\n  \/\/ do not add the histograms in the directory\n  \/\/ all handled by the list\n  Bool_t oldStatus = TH1::AddDirectoryStatus();\n  TH1::AddDirectory(kFALSE);\n\n\n  \/\/ Histograms\n  fListOfHistos = new TList();\n  fHistos       = new AliJetHistos();\n  fHistos->AddHistosToList(fListOfHistos);\n  \n  \/\/ Add the JetFinderInformation to the Outputlist\n  \n  \/\/ Compose a characteristic output name\n  \/\/ with the name of the output branch\n  if(fH) {\n    if(fNonStdBranch.Length()==0) {\n      fH->SetName(\"AliJetHeader_jets\");\n    }\n    else {\n      fH->SetName(Form(\"AliJetHeader_%s\",fNonStdBranch.Data()));\n    }\n  }\n\n  TH1::AddDirectory(oldStatus);\n  \n  \n  if(!fAODExtension)OutputTree()->GetUserInfo()->Add(fH);\n  else fAODExtension->GetTree()->GetUserInfo()->Add(fH);\n}\n\n\/\/----------------------------------------------------------------\nvoid AliAnalysisTaskJets::Init()\n{\n  \/\/ Initialization\n  if (fDebug > 1) printf(\"AnalysisTaskJets::Init() \\n\");\n  \n  \/\/ Call configuration file\n  if (fConfigFile.Length()) {\n    gROOT->LoadMacro(fConfigFile);\n    fJetFinder = (AliJetFinder*) gInterpreter->ProcessLine(\"ConfigJetAnalysis()\");\n  }\n  AliJetReaderHeader *header = (AliJetReaderHeader*)fJetFinder->GetReader()->GetReaderHeader();\n  fOpt = header->GetDetector();\n\n\/\/ AODB path for Jetan Analysis... if not alread defined, use the standard one\nif ((!(((AliJetReader*) fJetFinder->GetReader())->GetJetanOADBPath()).Length())) {\n((AliJetReader*) fJetFinder->GetReader())->SetJetanOADBPath(AliAnalysisManager::GetOADBPath());\n}\nelse Info( \"Init\",\" OADBPath for Jetan was already defined (config file?) as %s\",(char*)((fJetFinder->GetReader()->GetJetanOADBPath()).Data()));\n\t\n  \/\/ Initialise Jet Analysis\n  if(fOpt == 0) fJetFinder->Init();\n  else fJetFinder->InitTask(fChain); \/\/ V2\n}\n\n\n\/\/----------------------------------------------------------------\nvoid AliAnalysisTaskJets::UserExec(Option_t *\/*option*\/)\n{\n  \/\/ Execute analysis for current event\n  \/\/\n  \/\/ Fill control histos\n  TClonesArray* jarray = 0;\n  AliAODJetEventBackground*  evBkg = 0;\n\n  \/\/ only need this once\n  static AliAODHandler *aodH = dynamic_cast<AliAODHandler*>(AliAnalysisManager::GetAnalysisManager()->GetOutputEventHandler());\n\n  if(fNonStdBranch.Length()==0) {\n    jarray = AODEvent()->GetJets();\n    if(fUseAODBackground){\n      evBkg = (AliAODJetEventBackground*)(AODEvent()->FindListObject(AliAODJetEventBackground::StdBranchName()));\n      evBkg->Reset();\n    }\n  }\n  else {\n    if(AODEvent())jarray = (TClonesArray*)(AODEvent()->FindListObject(fNonStdBranch.Data()));\n    if(!jarray)jarray = (TClonesArray*)(fAODExtension->GetAOD()->FindListObject(fNonStdBranch.Data()));\n    if(jarray)jarray->Delete();    \/\/ this is our responsibility, clear before filling again\n    if(fUseAODBackground){\n      if(AODEvent())evBkg = (AliAODJetEventBackground*)(AODEvent()->FindListObject(Form(\"%s_%s\",AliAODJetEventBackground::StdBranchName(),fNonStdBranch.Data())));\n      if(!evBkg)  evBkg = (AliAODJetEventBackground*)(fAODExtension->GetAOD()->FindListObject(Form(\"%s_%s\",AliAODJetEventBackground::StdBranchName(),fNonStdBranch.Data())));\n      if(evBkg)evBkg->Reset();\n    }\n  }\n\n  if (dynamic_cast<AliAODEvent*>(InputEvent()) !=  0 && !fReadAODFromOutput) {\n\/\/ AOD is input event..........................................V                                       \n      fJetFinder->GetReader()->SetInputEvent(InputEvent(), InputEvent(), MCEvent());\n  } else {\n\/\/ AOD is read from output ....................................V      \n      fJetFinder->GetReader()->SetInputEvent(InputEvent(), AODEvent(), MCEvent());\n  }\n  \n  \n\n  if(fOpt==0) fJetFinder->ProcessEvent();\n  else fJetFinder->ProcessEvent2();    \/\/ V2\n \n  \/\/ Fill control histos\n  if(jarray)fHistos->FillHistos(jarray);\n\n\n  if(jarray&&aodH&&fFilterPt>0){\n    if(jarray->GetEntries()>0){\n      AliAODJet *jet = (AliAODJet*)jarray->At(0);\n      if(jet->Pt()>fFilterPt){\n\t\/\/\taodH->EnableFillAODforEvent();\n\taodH->SetFillAOD(kTRUE);\n      }\n    }\n  }\n\n  \/\/ Post the data\n  PostData(1, fListOfHistos);\n  return;\n}\n\n\n\/\/*************************************************************\n\nvoid AliAnalysisTaskJets::Terminate(Option_t *\/*option*\/)\n{\n\/\/ Terminate analysis\n\/\/\n    if (fDebug > 1) printf(\"AnalysisJets: Terminate() \\n\");\n\/\/    if (fJetFinder) fJetFinder->FinishRun();\n}\n\n<commit_msg>Addedin post data to UserCreateOutputObjects<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#include <Riostream.h> \n#include <TROOT.h>\n#include <TSystem.h>\n#include <TInterpreter.h>\n#include <TChain.h>\n#include <TFile.h>\n#include <TList.h>\n#include <TH1.h>\n\n#include \"AliAnalysisTaskJets.h\"\n#include \"AliAnalysisManager.h\"\n#include \"AliJetFinder.h\"\n#include \"AliJetHeader.h\"\n#include \"AliJetReader.h\"\n#include \"AliJetReaderHeader.h\"\n#include \"AliJetHistos.h\"\n#include \"AliESDEvent.h\"\n#include \"AliESD.h\"\n#include \"AliAODEvent.h\"\n#include \"AliAODJetEventBackground.h\"\n#include \"AliAODHandler.h\"\n#include \"AliAODExtension.h\"\n#include \"AliMCEventHandler.h\"\n#include \"AliESDInputHandler.h\"\n#include \"AliMCEvent.h\"\n#include \"AliStack.h\"\n\n\nClassImp(AliAnalysisTaskJets)\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nAliAnalysisTaskJets::AliAnalysisTaskJets():\n  AliAnalysisTaskSE(),\n  fConfigFile(\"ConfigJetAnalysis.C\"),\n  fNonStdBranch(\"\"), \n  fNonStdFile(\"\"),\n  fJetFinder(0x0),\n  fHistos(0x0),\n  fAODExtension(0x0),\n  fListOfHistos(0x0),\n  fChain(0x0),\n  fOpt(0),\n  fReadAODFromOutput(0),\n  fUseAODBackground(kFALSE),\n  fFilterPt(0.)\n{\n  \/\/ Default constructor\n}\n\nAliAnalysisTaskJets::AliAnalysisTaskJets(const char* name):\n  AliAnalysisTaskSE(name),\n  fConfigFile(\"ConfigJetAnalysis.C\"),\n  fNonStdBranch(\"\"),\n  fNonStdFile(\"\"),\n  fJetFinder(0x0),\n  fHistos(0x0),\n  fAODExtension(0x0),\n  fListOfHistos(0x0),\n  fChain(0x0),\n  fOpt(0),\n  fReadAODFromOutput(0),\n  fUseAODBackground(kFALSE),\n  fFilterPt(0.)\n{\n  \/\/ Default constructor\n  DefineOutput(1, TList::Class());\n}\n\nAliAnalysisTaskJets::AliAnalysisTaskJets(const char* name, TChain* chain):\n  AliAnalysisTaskSE(name),\n  fConfigFile(\"ConfigJetAnalysis.C\"),\n  fNonStdBranch(\"\"),\n  fNonStdFile(\"\"),\n  fJetFinder(0x0),\n  fHistos(0x0),\n  fAODExtension(0x0),\n  fListOfHistos(0x0),\n  fChain(chain),\n  fOpt(0),\n  fReadAODFromOutput(0),\n  fUseAODBackground(kFALSE),\n  fFilterPt(0.)\n{\n  \/\/ Default constructor\n  DefineOutput(1, TList::Class());\n}\n\n\/\/----------------------------------------------------------------\nvoid AliAnalysisTaskJets::UserCreateOutputObjects()\n{\n  \/\/ Create the output container\n  \/\/\n  if (fDebug > 1) printf(\"AnalysisTaskJets::CreateOutPutData() \\n\");\n\n  AliJetHeader *fH = fJetFinder->GetHeader();\n\n  if(fNonStdBranch.Length()==0)\n    {\n      \/\/  Connec default AOD to jet finder\n      \/\/ create a new branch for the background\n\n      if(fUseAODBackground){\n\tif(!AODEvent()->FindListObject(AliAODJetEventBackground::StdBranchName())){\n\t  AliAODJetEventBackground* evBkg = new AliAODJetEventBackground();\n\t  evBkg->SetName(AliAODJetEventBackground::StdBranchName());\n\t  AddAODBranch(\"AliAODJetEventBackground\",&evBkg);\n\t}\n      }\n      fJetFinder->ConnectAOD(AODEvent());\n    }\n  else\n    {\n      \/\/ Create a new branch for jets...\n      \/\/ how is this reset? -> cleared in the UserExec....\n      \/\/ Can this be handled by the framework?\n      \/\/ here we can also have the case that the brnaches are written to a separate file\n\n      TClonesArray *tca = new TClonesArray(\"AliAODJet\", 0);\n      tca->SetName(fNonStdBranch.Data());\n      AddAODBranch(\"TClonesArray\",&tca,fNonStdFile.Data());\n      if(fUseAODBackground){\n\tif(!AODEvent() || !AODEvent()->FindListObject(Form(\"%s_%s\",AliAODJetEventBackground::StdBranchName(),fNonStdBranch.Data()))){\n\t  AliAODJetEventBackground* evBkg = new AliAODJetEventBackground();\n\t  evBkg->SetName(Form(\"%s_%s\",AliAODJetEventBackground::StdBranchName(),fNonStdBranch.Data()));\n\t  AddAODBranch(\"AliAODJetEventBackground\",&evBkg,fNonStdFile.Data());\n\t}\n      }\n      if(fNonStdFile.Length()!=0){\n\t\/\/ \n\t\/\/ case that we have an AOD extension we need to fetch the jets from the extended output\n\t\/\/ we identifay the extension aod event by looking for the branchname\n\tAliAODHandler *aodH = dynamic_cast<AliAODHandler*>(AliAnalysisManager::GetAnalysisManager()->GetOutputEventHandler());\n\tfAODExtension = 0;\n\tif(aodH){\n\t  TObjArray* extArray = aodH->GetExtensions();\n\t  if (extArray) {\n\t    TIter next(extArray);\n\t    while ((fAODExtension=(AliAODExtension*)next())){\n\t      TObject *obj = fAODExtension->GetAOD()->FindListObject(fNonStdBranch.Data());\n\t      if(fDebug>10){\n\t\tPrintf(\"%s:%d Dumping..\",(char*)__FILE__,__LINE__);\n\t\tfAODExtension->GetAOD()->Dump();\n\t      }\n\t      if(obj){\n\t      if(fDebug>1)Printf(\"AODExtension found for %s\",fNonStdBranch.Data());\n\t      break;\n\t      }\n\t      fAODExtension = 0;\n\t    }\n\t  }\n\t}\n\tif(fAODExtension)fJetFinder->ConnectAODNonStd(fAODExtension->GetAOD(), fNonStdBranch.Data()); \n      }\n      else{\n\tif (fDebug > 1) printf(\"Connecting Non Std Branch AOD %p %s \\n\",AODEvent(),fNonStdBranch.Data());\n\tfJetFinder->ConnectAODNonStd(AODEvent(), fNonStdBranch.Data()); \n      }\n    }\n\n  \/\/ do not add the histograms in the directory\n  \/\/ all handled by the list\n  Bool_t oldStatus = TH1::AddDirectoryStatus();\n  TH1::AddDirectory(kFALSE);\n\n\n  \/\/ Histograms\n  fListOfHistos = new TList();\n  fHistos       = new AliJetHistos();\n  fHistos->AddHistosToList(fListOfHistos);\n  \n  \/\/ Add the JetFinderInformation to the Outputlist\n  \n  \/\/ Compose a characteristic output name\n  \/\/ with the name of the output branch\n  if(fH) {\n    if(fNonStdBranch.Length()==0) {\n      fH->SetName(\"AliJetHeader_jets\");\n    }\n    else {\n      fH->SetName(Form(\"AliJetHeader_%s\",fNonStdBranch.Data()));\n    }\n  }\n\n  TH1::AddDirectory(oldStatus);\n  \n  \n  if(!fAODExtension)OutputTree()->GetUserInfo()->Add(fH);\n  else fAODExtension->GetTree()->GetUserInfo()->Add(fH);\n\n  \/\/ post\n  PostData(1, fListOfHistos);\n\n}\n\n\/\/----------------------------------------------------------------\nvoid AliAnalysisTaskJets::Init()\n{\n  \/\/ Initialization\n  if (fDebug > 1) printf(\"AnalysisTaskJets::Init() \\n\");\n  \n  \/\/ Call configuration file\n  if (fConfigFile.Length()) {\n    gROOT->LoadMacro(fConfigFile);\n    fJetFinder = (AliJetFinder*) gInterpreter->ProcessLine(\"ConfigJetAnalysis()\");\n  }\n  AliJetReaderHeader *header = (AliJetReaderHeader*)fJetFinder->GetReader()->GetReaderHeader();\n  fOpt = header->GetDetector();\n\n\/\/ AODB path for Jetan Analysis... if not alread defined, use the standard one\nif ((!(((AliJetReader*) fJetFinder->GetReader())->GetJetanOADBPath()).Length())) {\n((AliJetReader*) fJetFinder->GetReader())->SetJetanOADBPath(AliAnalysisManager::GetOADBPath());\n}\nelse Info( \"Init\",\" OADBPath for Jetan was already defined (config file?) as %s\",(char*)((fJetFinder->GetReader()->GetJetanOADBPath()).Data()));\n\t\n  \/\/ Initialise Jet Analysis\n  if(fOpt == 0) fJetFinder->Init();\n  else fJetFinder->InitTask(fChain); \/\/ V2\n}\n\n\n\/\/----------------------------------------------------------------\nvoid AliAnalysisTaskJets::UserExec(Option_t *\/*option*\/)\n{\n  \/\/ Execute analysis for current event\n  \/\/\n  \/\/ Fill control histos\n  TClonesArray* jarray = 0;\n  AliAODJetEventBackground*  evBkg = 0;\n\n  \/\/ only need this once\n  static AliAODHandler *aodH = dynamic_cast<AliAODHandler*>(AliAnalysisManager::GetAnalysisManager()->GetOutputEventHandler());\n\n  if(fNonStdBranch.Length()==0) {\n    jarray = AODEvent()->GetJets();\n    if(fUseAODBackground){\n      evBkg = (AliAODJetEventBackground*)(AODEvent()->FindListObject(AliAODJetEventBackground::StdBranchName()));\n      evBkg->Reset();\n    }\n  }\n  else {\n    if(AODEvent())jarray = (TClonesArray*)(AODEvent()->FindListObject(fNonStdBranch.Data()));\n    if(!jarray)jarray = (TClonesArray*)(fAODExtension->GetAOD()->FindListObject(fNonStdBranch.Data()));\n    if(jarray)jarray->Delete();    \/\/ this is our responsibility, clear before filling again\n    if(fUseAODBackground){\n      if(AODEvent())evBkg = (AliAODJetEventBackground*)(AODEvent()->FindListObject(Form(\"%s_%s\",AliAODJetEventBackground::StdBranchName(),fNonStdBranch.Data())));\n      if(!evBkg)  evBkg = (AliAODJetEventBackground*)(fAODExtension->GetAOD()->FindListObject(Form(\"%s_%s\",AliAODJetEventBackground::StdBranchName(),fNonStdBranch.Data())));\n      if(evBkg)evBkg->Reset();\n    }\n  }\n\n  if (dynamic_cast<AliAODEvent*>(InputEvent()) !=  0 && !fReadAODFromOutput) {\n\/\/ AOD is input event..........................................V                                       \n      fJetFinder->GetReader()->SetInputEvent(InputEvent(), InputEvent(), MCEvent());\n  } else {\n\/\/ AOD is read from output ....................................V      \n      fJetFinder->GetReader()->SetInputEvent(InputEvent(), AODEvent(), MCEvent());\n  }\n  \n  \n\n  if(fOpt==0) fJetFinder->ProcessEvent();\n  else fJetFinder->ProcessEvent2();    \/\/ V2\n \n  \/\/ Fill control histos\n  if(jarray)fHistos->FillHistos(jarray);\n\n\n  if(jarray&&aodH&&fFilterPt>0){\n    if(jarray->GetEntries()>0){\n      AliAODJet *jet = (AliAODJet*)jarray->At(0);\n      if(jet->Pt()>fFilterPt){\n\t\/\/\taodH->EnableFillAODforEvent();\n\taodH->SetFillAOD(kTRUE);\n      }\n    }\n  }\n\n  \/\/ Post the data\n  PostData(1, fListOfHistos);\n  return;\n}\n\n\n\/\/*************************************************************\n\nvoid AliAnalysisTaskJets::Terminate(Option_t *\/*option*\/)\n{\n\/\/ Terminate analysis\n\/\/\n    if (fDebug > 1) printf(\"AnalysisJets: Terminate() \\n\");\n\/\/    if (fJetFinder) fJetFinder->FinishRun();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Time:  O((|E| + |V|) * log|V|) = O(|E| * log|V|)\n\/\/ Space: O(|E| + |V|) = O(|E|)\n\nclass Solution {\npublic:\n    int findCheapestPrice(int n, vector<vector<int>>& flights, int src, int dst, int K) {\n        using P = pair<int, int>;\n        unordered_map<int, vector<P>> adj;\n        for (const auto& flight : flights) {\n            int u, v, w;\n            tie(u, v, w) = make_tuple(flight[0], flight[1], flight[2]);\n            adj[u].emplace_back(v, w);\n        }\n        \n        unordered_map<int, unordered_map<int, int>> best;\n        using T = tuple<int, int, int>;\n        priority_queue<T, vector<T>, greater<T>> min_heap;\n        min_heap.emplace(0, K + 1, src);\n        while (!min_heap.empty()) {\n            int result, k, u;\n            tie(result, k, u) = min_heap.top(); min_heap.pop();\n            if (k < 0 ||\n                (best.count(k) && best[k].count(u) &&  best[k][u] < result)) {\n                continue;\n            }\n            if (u == dst) {\n                return result;\n            }\n            for (const auto& kvp : adj[u]) {\n                int v, w;\n                tie(v, w) = kvp;\n                if (!best.count(k - 1) ||\n                    !best[k - 1].count(v) ||\n                    result + w < best[k - 1][v]) {\n                    best[k - 1][v] = result + w;\n                    min_heap.emplace(result + w, k - 1, v);\n                }\n            }\n        }\n        return -1;\n    }\n};\n<commit_msg>Update cheapest-flights-within-k-stops.cpp<commit_after>\/\/ Time:  O((|E| + |V|) * log|V|) = O(|E| * log|V|)\n\/\/ Space: O(|E| + |V|) = O(|E|)\n\nclass Solution {\npublic:\n    int findCheapestPrice(int n, vector<vector<int>>& flights, int src, int dst, int K) {\n        using P = pair<int, int>;\n        unordered_map<int, vector<P>> adj;\n        for (const auto& flight : flights) {\n            int u, v, w;\n            tie(u, v, w) = make_tuple(flight[0], flight[1], flight[2]);\n            adj[u].emplace_back(v, w);\n        }\n        \n        unordered_map<int, unordered_map<int, int>> best;\n        using T = tuple<int, int, int>;\n        priority_queue<T, vector<T>, greater<T>> min_heap;\n        min_heap.emplace(0, src, K + 1);\n        while (!min_heap.empty()) {\n            int result, u, k;\n            tie(result, u, k) = min_heap.top(); min_heap.pop();\n            if (k < 0 ||\n                (best.count(u) && best[u].count(k) &&  best[u][k] < result)) {\n                continue;\n            }\n            if (u == dst) {\n                return result;\n            }\n            for (const auto& kvp : adj[u]) {\n                int v, w;\n                tie(v, w) = kvp;\n                if (!best.count(v) ||\n                    !best[v].count(k - 1) ||\n                    result + w < best[v][k - 1]) {\n                    best[v][k - 1] = result + w;\n                    min_heap.emplace(result + w, v, k - 1);\n                }\n            }\n        }\n        return -1;\n    }\n};\n<|endoftext|>"}
{"text":"<commit_before>\n#pragma once\n\n#include <type_traits>\n#include <memory>\n#include <functional>\n\n#include <string>\n#include <vector>\n\n#include <boost\/coroutine\/asymmetric_coroutine.hpp>\n#include <boost\/signals2\/signal.hpp>\n#include <boost\/proto\/traits.hpp>\n\n#ifdef _MSC_VER\n#\tdefine noexcept throw()\n#endif\n\nnamespace html{\n\n\ttemplate<typename CharType>\n\tclass basic_dom;\n\tnamespace detail { template<typename CharType> class basic_dom_node_parser;}\n\n\ttemplate<typename CharType>\n\tclass basic_selector\n\t{\n\tpublic:\n\t\tbasic_selector(const std::basic_string<CharType>&);\n\t\tbasic_selector(std::basic_string<CharType>&&);\n\n\t\tbasic_selector(const CharType* s)\n\t\t\t: basic_selector(std::basic_string<CharType>(s))\n\t\t{}\n\n\t\ttemplate<int N>\n\t\tbasic_selector(const CharType s[N])\n\t\t\t: basic_selector(std::basic_string<CharType>(s))\n\t\t{};\n\n\t\tfriend class basic_dom<CharType>;\n\t\tfriend class detail::basic_dom_node_parser<CharType>;\n\n\tprotected:\n\t\tstruct condition\n\t\t{\n\t\t\tstd::basic_string<CharType> matching_tag_name;\n\t\t\tstd::basic_string<CharType> matching_id;\n\t\t\tstd::basic_string<CharType> matching_class;\n\t\t\tstd::basic_string<CharType> matching_name;\n\t\t\tstd::basic_string<CharType> matching_index;\n\t\t\tstd::basic_string<CharType> matching_attr;\n\t\t\tbool operator()(const basic_dom<CharType>&) const;\n\t\t};\n\n\t\tstruct selector_matcher{\n\t\t\tbool operator()(const basic_dom<CharType>&) const;\n\n\t\tprivate:\n\t\t\tbool all_match = false;\n\t\t\tstd::vector<condition> m_conditions;\n\n\t\t\tfriend class basic_selector;\n\t\t};\n\t\ttypedef typename std::vector<selector_matcher>::const_iterator selector_matcher_iterator;\n\n\t\tselector_matcher_iterator begin() const {\n\t\t\treturn m_matchers.begin();\n\t\t}\n\n\t\tselector_matcher_iterator end() const {\n\t\t\treturn m_matchers.end();\n\t\t}\n\n\tprivate:\n\t\tvoid build_matchers();\n\n\t\tstd::vector<selector_matcher> m_matchers;\n\n\t\tstd::basic_string<CharType> m_select_string;\n\t};\n\n\tenum tag_stage{\n\t\ttag_open,\n\t\ttag_close,\n\t};\n\n\tnamespace detail {\n\t\ttemplate<typename CharType>\n\t\tclass basic_dom_node_parser\n\t\t{\n\t\t\tbasic_dom_node_parser& operator = (basic_dom_node_parser&&)  = delete;\n\t\t\tbasic_dom_node_parser& operator = (const basic_dom_node_parser&) = delete;\n\n\t\t\tbasic_dom_node_parser(html::basic_dom<CharType>* domer, const std::basic_string<CharType>& str);\n\t\t\tbasic_dom_node_parser(basic_dom_node_parser&& other);\n\n\t\tpublic: \/\/ only for signals2\n\t\t\tbasic_dom_node_parser(const basic_dom_node_parser&);\n\t\t\t\/\/ called from dom\n\t\t\tvoid operator()(tag_stage, std::shared_ptr<basic_dom<CharType>>);\n\n\t\tpublic: \/\/ interface\n\t\t\ttemplate<typename Handler>\n\t\t\ttypename std::enable_if<\n\t\t\t\tstd::is_same<typename std::result_of<Handler(tag_stage, std::shared_ptr<basic_dom<CharType>>)>::type, void>::value\n\t\t\t>::type\n\t\t\toperator |(const Handler& node_reciver)\n\t\t\t{\n\t\t\t\tset_callback_fuction(decltype(m_callback)(node_reciver));\n\t\t\t}\n\n\t\t\ttemplate<typename Handler>\n\t\t\ttypename std::enable_if<std::is_function<Handler>::value>::type\n\t\t\toperator |(const Handler& node_reciver)\n\t\t\t{\n\t\t\t\tset_callback_fuction(decltype(m_callback)(node_reciver));\n\t\t\t}\n\n\t\t\tbasic_dom_node_parser& operator |(const basic_selector<CharType>&);\n\n\t\tpublic:\n\t\t\t~basic_dom_node_parser();\n\n\t\t\tfriend class basic_dom<CharType>;\n\t\tprivate:\n\n\t\t\tvoid set_callback_fuction(std::function<void(tag_stage, std::shared_ptr<basic_dom<CharType>>)>&& cb);\n\n\t\t\tbasic_dom<CharType>* m_dom;\n\t\t\tconst basic_selector<CharType>* m_selector;\n\n\t\t\tconst std::basic_string<CharType>& m_str;\n\n\t\t\tstd::function<void(tag_stage, std::shared_ptr<basic_dom<CharType>>)> m_callback;\n\t\t\tboost::signals2::scoped_connection m_sig_connection;\n\t\t};\n\t}\n\n\n\ttemplate<typename CharType>\n\tclass basic_dom : public std::enable_shared_from_this<basic_dom<CharType>>\n\t{\n\tpublic:\n\n\t\t\/\/ 默认构造.\n\t\tbasic_dom(basic_dom<CharType>* parent = nullptr) noexcept;\n\n\t\t\/\/ 从html构造 DOM.\n\t\texplicit basic_dom(const std::basic_string<CharType>& html_page, basic_dom<CharType>* parent = nullptr);\n\n\t\texplicit basic_dom(const basic_dom<CharType>& d);\n\t\tbasic_dom(basic_dom<CharType>&& d);\n\t\tbasic_dom<CharType>& operator = (const basic_dom<CharType>& d);\n\t\tbasic_dom<CharType>& operator = (basic_dom<CharType>&& d);\n\n\tpublic:\n\t\t\/\/ 喂入一html片段.\n\t\tdetail::basic_dom_node_parser<CharType> append_partial_html(const std::basic_string<CharType>&);\n\n\tpublic:\n\t\tbasic_dom<CharType>  operator[](const basic_selector<CharType>&) const;\n\n\t\tstd::basic_string<CharType> to_html() const;\n\n\t\tstd::basic_string<CharType> to_plain_text() const;\n\n\t\t\/\/ return charset of the page if page contain meta http-equiv= content=\"charset=\"\n\t\ttemplate<typename... Dummy, typename U = CharType>\n\t\ttypename std::enable_if<std::is_same<U, char>::value, std::basic_string<CharType>>::type\n\t\tcharset(const std::string& default_charset = \"UTF-8\") const\n\t\t{\n\t\t\tstatic_assert(sizeof...(Dummy)==0, \"Do not specify template arguments!\");\n\t\t\treturn basic_charset(default_charset);\n\t\t}\n\n\t\tstd::vector<std::shared_ptr<basic_dom<CharType>>> get_children(){\n\t\t\treturn children;\n\t\t}\n\n\t\tstd::basic_string<CharType> get_attr(const std::basic_string<CharType>& attr)\n\t\t{\n\t\t\tauto it = attributes.find(attr);\n\n\t\t\tif (it==attributes.end())\n\t\t\t{\n\t\t\t\treturn std::basic_string<CharType>();\n\t\t\t}\n\n\t\t\treturn it->second;\n\t\t}\n\n\tprivate:\n\t\tvoid html_parser(typename boost::coroutines::asymmetric_coroutine<const std::basic_string<CharType>*>::pull_type & html_page_source);\n\t\ttypename boost::coroutines::asymmetric_coroutine<const std::basic_string<CharType>*>::push_type html_parser_feeder;\n\t\tbool html_parser_feeder_inialized = false;\n\n\t\ttypedef std::shared_ptr<basic_dom<CharType>> basic_dom_ptr;\n\t\tboost::signals2::signal<void(tag_stage, basic_dom_ptr)> m_new_node_signal;\n\n \t\tstd::basic_string<CharType> basic_charset(const std::string& default_charset) const;\n\n\tprotected:\n\n\t\tvoid to_html(std::basic_ostream<CharType>*, int deep) const;\n\n\n\t\tstd::map<std::basic_string<CharType>, std::basic_string<CharType>> attributes;\n\t\tstd::basic_string<CharType> tag_name;\n\n\t\tstd::basic_string<CharType> content_text;\n\t\tstd::vector<basic_dom_ptr> children;\n\t\tbasic_dom<CharType>* m_parent;\n\n\t\ttemplate<class T>\n\t\tstatic void dom_walk(basic_dom_ptr d, T handler);\n\n\t\tfriend class basic_selector<CharType>;\n\t\tfriend class detail::basic_dom_node_parser<CharType>;\n\t};\n\n\ttypedef basic_dom<char> dom;\n\ttypedef basic_dom<wchar_t> wdom;\n\n} \/\/ namespace html\n<commit_msg>增加部分注释。方便修改<commit_after>\n#pragma once\n\n#include <type_traits>\n#include <memory>\n#include <functional>\n\n#include <string>\n#include <vector>\n\n#include <boost\/coroutine\/asymmetric_coroutine.hpp>\n#include <boost\/signals2\/signal.hpp>\n#include <boost\/proto\/traits.hpp>\n\n#ifdef _MSC_VER\n#\tdefine noexcept throw()\n#endif\n\nnamespace html{\n\n\ttemplate<typename CharType>\n\tclass basic_dom;\n\tnamespace detail { template<typename CharType> class basic_dom_node_parser;}\n\n\ttemplate<typename CharType>\n\tclass basic_selector\n\t{\n\tpublic:\n\t\tbasic_selector(const std::basic_string<CharType>&);\n\t\tbasic_selector(std::basic_string<CharType>&&);\n\n\t\tbasic_selector(const CharType* s)\n\t\t\t: basic_selector(std::basic_string<CharType>(s))\n\t\t{}\n\n\t\ttemplate<int N>\n\t\tbasic_selector(const CharType s[N])\n\t\t\t: basic_selector(std::basic_string<CharType>(s))\n\t\t{};\n\n\t\tfriend class basic_dom<CharType>;\n\t\tfriend class detail::basic_dom_node_parser<CharType>;\n\n\tprotected:\n\t\tstruct condition\n\t\t{\n\t\t\tstd::basic_string<CharType> matching_tag_name;\n\t\t\tstd::basic_string<CharType> matching_id;\n\t\t\tstd::basic_string<CharType> matching_class;\n\t\t\tstd::basic_string<CharType> matching_name;\n\t\t\tstd::basic_string<CharType> matching_index;\n\t\t\tstd::basic_string<CharType> matching_attr;\n\t\t\t\/\/ 判断 basic_dom<CharType> 是否与当前的 condition 一致\n\t\t\tbool operator()(const basic_dom<CharType>&) const;\n\t\t};\n\n\t\tstruct selector_matcher{\n\t\t\t\/\/ 轮询 m_conditions ，判断是否存在与该 basic_dom 对象一致的 condition\n\t\t\tbool operator()(const basic_dom<CharType>&) const;\n\n\t\tprivate:\n\t\t\tbool all_match = false;\n\t\t\tstd::vector<condition> m_conditions;\n\n\t\t\tfriend class basic_selector;\n\t\t};\n\t\ttypedef typename std::vector<selector_matcher>::const_iterator selector_matcher_iterator;\n\n\t\tselector_matcher_iterator begin() const {\n\t\t\treturn m_matchers.begin();\n\t\t}\n\n\t\tselector_matcher_iterator end() const {\n\t\t\treturn m_matchers.end();\n\t\t}\n\n\tprivate:\n\t\tvoid build_matchers();\n\n\t\tstd::vector<selector_matcher> m_matchers;\n\n\t\tstd::basic_string<CharType> m_select_string;\n\t};\n\n\tenum tag_stage{\n\t\ttag_open,\n\t\ttag_close,\n\t};\n\n\tnamespace detail {\n\t\ttemplate<typename CharType>\n\t\tclass basic_dom_node_parser\n\t\t{\n\t\t\tbasic_dom_node_parser& operator = (basic_dom_node_parser&&)  = delete;\n\t\t\tbasic_dom_node_parser& operator = (const basic_dom_node_parser&) = delete;\n\n\t\t\tbasic_dom_node_parser(html::basic_dom<CharType>* domer, const std::basic_string<CharType>& str);\n\t\t\tbasic_dom_node_parser(basic_dom_node_parser&& other);\n\n\t\tpublic: \/\/ only for signals2\n\t\t\tbasic_dom_node_parser(const basic_dom_node_parser&);\n\t\t\t\/\/ called from dom\n\t\t\tvoid operator()(tag_stage, std::shared_ptr<basic_dom<CharType>>);\n\n\t\tpublic: \/\/ interface\n\t\t\ttemplate<typename Handler>\n\t\t\ttypename std::enable_if<\n\t\t\t\tstd::is_same<typename std::result_of<Handler(tag_stage, std::shared_ptr<basic_dom<CharType>>)>::type, void>::value\n\t\t\t>::type\n\t\t\toperator |(const Handler& node_reciver)\n\t\t\t{\n\t\t\t\tset_callback_fuction(decltype(m_callback)(node_reciver));\n\t\t\t}\n\n\t\t\ttemplate<typename Handler>\n\t\t\ttypename std::enable_if<std::is_function<Handler>::value>::type\n\t\t\toperator |(const Handler& node_reciver)\n\t\t\t{\n\t\t\t\tset_callback_fuction(decltype(m_callback)(node_reciver));\n\t\t\t}\n\n\t\t\tbasic_dom_node_parser& operator |(const basic_selector<CharType>&);\n\n\t\tpublic:\n\t\t\t~basic_dom_node_parser();\n\n\t\t\tfriend class basic_dom<CharType>;\n\t\tprivate:\n\n\t\t\tvoid set_callback_fuction(std::function<void(tag_stage, std::shared_ptr<basic_dom<CharType>>)>&& cb);\n\n\t\t\tbasic_dom<CharType>* m_dom;\n\t\t\tconst basic_selector<CharType>* m_selector;\n\n\t\t\tconst std::basic_string<CharType>& m_str;\n\n\t\t\tstd::function<void(tag_stage, std::shared_ptr<basic_dom<CharType>>)> m_callback;\n\t\t\tboost::signals2::scoped_connection m_sig_connection;\n\t\t};\n\t}\n\n\n\ttemplate<typename CharType>\n\tclass basic_dom : public std::enable_shared_from_this<basic_dom<CharType>>\n\t{\n\tpublic:\n\n\t\t\/\/ 默认构造.\n\t\tbasic_dom(basic_dom<CharType>* parent = nullptr) noexcept;\n\n\t\t\/\/ 从html构造 DOM.\n\t\texplicit basic_dom(const std::basic_string<CharType>& html_page, basic_dom<CharType>* parent = nullptr);\n\n\t\texplicit basic_dom(const basic_dom<CharType>& d);\n\t\tbasic_dom(basic_dom<CharType>&& d);\n\t\tbasic_dom<CharType>& operator = (const basic_dom<CharType>& d);\n\t\tbasic_dom<CharType>& operator = (basic_dom<CharType>&& d);\n\n\tpublic:\n\t\t\/\/ 喂入一html片段.\n\t\tdetail::basic_dom_node_parser<CharType> append_partial_html(const std::basic_string<CharType>&);\n\n\tpublic:\n\t\t\/*\n\t\t传入的 select 语法，先是通过 basic_selector 的构造函数，生成一个 basic_selector 对象\n\t\t解析完毕后，根据 basic_selector 的 condition 对象进行匹配。\n\t\t只有解析成功以后。dom 对象这个容器才会被填充进对应的内容，否则全部都为空\n\t\t*\/\n\t\tbasic_dom<CharType>  operator[](const basic_selector<CharType>&) const;\n\n\t\tstd::basic_string<CharType> to_html() const;\n\n\t\tstd::basic_string<CharType> to_plain_text() const;\n\n\t\t\/\/ return charset of the page if page contain meta http-equiv= content=\"charset=\"\n\t\ttemplate<typename... Dummy, typename U = CharType>\n\t\ttypename std::enable_if<std::is_same<U, char>::value, std::basic_string<CharType>>::type\n\t\tcharset(const std::string& default_charset = \"UTF-8\") const\n\t\t{\n\t\t\tstatic_assert(sizeof...(Dummy)==0, \"Do not specify template arguments!\");\n\t\t\treturn basic_charset(default_charset);\n\t\t}\n\n\t\tstd::vector<std::shared_ptr<basic_dom<CharType>>> get_children(){\n\t\t\treturn children;\n\t\t}\n\n\t\tstd::basic_string<CharType> get_attr(const std::basic_string<CharType>& attr)\n\t\t{\n\t\t\tauto it = attributes.find(attr);\n\n\t\t\tif (it==attributes.end())\n\t\t\t{\n\t\t\t\treturn std::basic_string<CharType>();\n\t\t\t}\n\n\t\t\treturn it->second;\n\t\t}\n\n\tprivate:\n\t\tvoid html_parser(typename boost::coroutines::asymmetric_coroutine<const std::basic_string<CharType>*>::pull_type & html_page_source);\n\t\ttypename boost::coroutines::asymmetric_coroutine<const std::basic_string<CharType>*>::push_type html_parser_feeder;\n\t\tbool html_parser_feeder_inialized = false;\n\n\t\ttypedef std::shared_ptr<basic_dom<CharType>> basic_dom_ptr;\n\t\tboost::signals2::signal<void(tag_stage, basic_dom_ptr)> m_new_node_signal;\n\n \t\tstd::basic_string<CharType> basic_charset(const std::string& default_charset) const;\n\n\tprotected:\n\n\t\tvoid to_html(std::basic_ostream<CharType>*, int deep) const;\n\n\n\t\tstd::map<std::basic_string<CharType>, std::basic_string<CharType>> attributes;\n\t\tstd::basic_string<CharType> tag_name;\n\n\t\tstd::basic_string<CharType> content_text;\n\t\tstd::vector<basic_dom_ptr> children;\n\t\tbasic_dom<CharType>* m_parent;\n\n\t\ttemplate<class T>\n\t\tstatic void dom_walk(basic_dom_ptr d, T handler);\n\n\t\tfriend class basic_selector<CharType>;\n\t\tfriend class detail::basic_dom_node_parser<CharType>;\n\t};\n\n\ttypedef basic_dom<char> dom;\n\ttypedef basic_dom<wchar_t> wdom;\n\n} \/\/ namespace html\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\n\/\/\/ @file  imath.hpp\n\/\/\/ @brief Integer math functions\n\/\/\/\n\/\/\/ Copyright (C) 2020 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 IMATH_HPP\n#define IMATH_HPP\n\n#include <isqrt.hpp>\n\n#include <stdint.h>\n#include <cmath>\n#include <limits>\n\nnamespace {\n\ninline int64_t isquare(int64_t x)\n{\n  return x * x;\n}\n\ntemplate <typename A, typename B>\ninline A ceil_div(A a, B b)\n{\n  return (A) ((a + b - 1) \/ b);\n}\n\ntemplate <typename T>\ninline T number_of_bits(T)\n{\n  return (T) std::numeric_limits<T>::digits;\n}\n\ntemplate <typename T>\ninline T next_power_of_2(T x)\n{\n  if (x == 0)\n    return 1;\n\n  x--;\n  for (T i = 1; i < number_of_bits(x); i += i)\n    x |= (x >> i);\n\n  return ++x;\n}\n\ntemplate <typename T>\ninline T prev_power_of_2(T x)\n{\n  for (T i = 1; i < number_of_bits(x); i += i)\n    x |= (x >> i);\n\n  return x - (x >> 1);\n}\n\ntemplate <typename T>\ninline int ilog(T x)\n{\n  return (int) std::log((double) x);\n}\n\ntemplate <typename T>\ninline T ilog2(T x)\n{\n  T log2 = 0;\n  T bits = number_of_bits(x);\n\n  for (T i = bits \/ 2; i > 0; i \/= 2)\n  {\n    T one = 1;\n    if (x >= (one << i))\n    {\n      x >>= i;\n      log2 += i;\n    }\n  }\n\n  return log2;\n}\n\ntemplate <typename T>\ninline T ipow(T x, int n)\n{\n  T r = 1;\n  for (int i = 0; i < n; i++)\n    r *= x;\n\n  return r;\n}\n\n\/\/\/ Integer nth root\ntemplate <int N, typename T>\ninline T iroot(T x)\n{\n  if (N == 0)\n    return 0;\n\n  T r = (T) std::pow((double) x, 1.0 \/ N);\n\n  \/\/ fix root too large\n  for (; r > 0; r--)\n  {\n    if (ipow(r, N - 1) <= x \/ r)\n      break;\n  }\n\n  \/\/ fix root too small\n  while (ipow(r + 1, N - 1) <= x \/ (r + 1))\n    r += 1;\n\n  return r;\n}\n\n} \/\/ namespace\n\n#endif\n<commit_msg>Refactor<commit_after>\/\/\/\n\/\/\/ @file  imath.hpp\n\/\/\/ @brief Integer math functions\n\/\/\/\n\/\/\/ Copyright (C) 2020 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 IMATH_HPP\n#define IMATH_HPP\n\n#include <isqrt.hpp>\n\n#include <stdint.h>\n#include <cmath>\n#include <limits>\n\nnamespace {\n\ninline int64_t isquare(int64_t x)\n{\n  return x * x;\n}\n\ntemplate <typename A, typename B>\ninline A ceil_div(A a, B b)\n{\n  return (A) ((a + b - 1) \/ b);\n}\n\ntemplate <typename T>\ninline T number_of_bits(T)\n{\n  return (T) std::numeric_limits<T>::digits;\n}\n\ntemplate <typename T>\ninline T next_power_of_2(T x)\n{\n  if (x == 0)\n    return 1;\n\n  x--;\n  for (T i = 1; i < number_of_bits(x); i += i)\n    x |= (x >> i);\n\n  return ++x;\n}\n\ntemplate <typename T>\ninline T prev_power_of_2(T x)\n{\n  for (T i = 1; i < number_of_bits(x); i += i)\n    x |= (x >> i);\n\n  return x - (x >> 1);\n}\n\ntemplate <typename T>\ninline int ilog(T x)\n{\n  return (int) std::log((double) x);\n}\n\ntemplate <typename T>\ninline T ilog2(T x)\n{\n  T log2 = 0;\n  T bits = number_of_bits(x);\n\n  for (T i = bits \/ 2; i > 0; i \/= 2)\n  {\n    T one = 1;\n    if (x >= (one << i))\n    {\n      x >>= i;\n      log2 += i;\n    }\n  }\n\n  return log2;\n}\n\ntemplate <typename T>\ninline T ipow(T x, int n)\n{\n  T r = 1;\n  for (int i = 0; i < n; i++)\n    r *= x;\n\n  return r;\n}\n\n\/\/\/ Integer nth root\ntemplate <int N, typename T>\ninline T iroot(T x)\n{\n  T r;\n\n  if (N == 3)\n    r = (T) std::cbrt((double) x);\n  else\n    r = (T) std::pow((double) x, 1.0 \/ N);\n\n  \/\/ fix root too large\n  for (; r > 0; r--)\n  {\n    if (ipow(r, N - 1) <= x \/ r)\n      break;\n  }\n\n  \/\/ fix root too small\n  while (ipow(r + 1, N - 1) <= x \/ (r + 1))\n    r += 1;\n\n  return r;\n}\n\n} \/\/ namespace\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/ 6.exericise.09.cpp\n\/\/\n\/\/ Write a program that reads digits and composes them into integers. For\n\/\/ example, 123 is read as the characters 1, 2 and 3. The program should output\n\/\/ 123 is 1 hundred and 2 tens and 3 ones. The number should be output as an\n\/\/ int value. Handle numbers with one, two, three, or four digits. Hint: to get\n\/\/ the integer value 5 from the character '5' substract '0', that is,\n\/\/ '5'-'0'==5.\n\/\/\n\/\/ Comments:\n\/\/\n\/\/  This is the kind of exercise that makes me feel unconfortable; there is\n\/\/  a simpler way of doing it. Why not read an integer and decompose it\n\/\/  instead? The output will be the same without the user noticing it.\n\/\/  Whatever, the requisites are clear so let's go for it.\n\/\/\n\/\/  We must read the input as a string. It's very much like I do in\n\/\/  5.exercise.12.cpp, so let's borrow some functions from it (check_input()\n\/\/  and parse_input()) and do some slight modifications to accomodate.\n\/\/\n\/\/  We must compose the integer and somehow retain the original digit by digit\n\/\/  data to do the verbose output. For the output we will do a trick with \n\/\/  a predefined vector of strings named powers; see print_output() for\n\/\/  details.\n\n#include \"std_lib_facilities.h\"\n\nstatic const string ex_msg_greater_than =\n        \"Your input is greater than I can manage.\";\nstatic const string ex_msg_not_only_digits =\n        \"Your input is not an integer number.\";\n\nstatic const vector<string> powers = {\"thousand\", \"hundred\", \"ten\", \"one\"};\n\nbool check_input(const string& input)\n\/\/ Checks input to be equal or less digits than we're able to manage .\n\/\/ Pre-conditions:\n\/\/  The length of the string must be less or equal to powers.size()\n\/\/  Each character of the string must be an ASCII (or compatible, as ISO or UTF8)\n\/\/      value for chars from '0' to '9' (they are consecutive).\ntry\n{\n    if (input.length() > powers.size()) throw runtime_error(ex_msg_greater_than);\n\n    for (char c : input)\n        if (c < '0' || c > '9')\n            throw runtime_error(ex_msg_not_only_digits);\n\n    return true;\n}\ncatch (exception& e)\n{\n    cout << e.what() << '\\n';\n    return false;\n}\n\nvector<int> parse_input(const string& input)\n\/\/ Converts a digits string to a vector of ints \n\/\/ Pre-condition:\n\/\/  input has to have been checked by check_input()\n{\n    vector<int> parse;\n\n    for (char d : input) {\n        \/\/ Ignore leading 0's\n        if (parse.size() != 0 || d != '0')\n            parse.push_back(d - '0');\n    }\n    \/\/ manage case where user has introduced 0 as a number\n    \/\/ We can do it in the former for if we change it with to\n    \/\/ a classical form to inspect the current index to input.\n    if (parse.size() == 0)\n        parse.push_back(0);\n\n    return parse;\n}\n\nint compose_integer(const vector<int>& digits)\n\/\/ Compose an integer number out of its digits\n\/\/ I could do this on parse_input, but let's enforce the principle of\n\/\/ a function doing just one thing.\n{\n    int result = 0;\n\n    for (int d: digits)\n        result = result*10 + d;\n\n    return result;\n}\n\nvoid print_output(int result, const vector<int>& digits)\n\/\/ Print composed integer result and do verbose output based on digits and\n\/\/ powers.\n{\n    cout << result << \" is \";\n    \/\/ index to start the walk on powers vector, so number of digits\n    \/\/ tell us if we have thousands or not, hundreds or not, and so on.\n    size_t idx = powers.size() - digits.size();\n    for (int d : digits) {\n        \/\/ We manage plurals with the ternary operator\n        cout << d << ' ' << powers[idx] << ( d == 1 ? \" \" : \"s \" );\n        ++idx;\n        if (idx < powers.size())\n            cout << \"and \";\n    }\n    cout << '\\n';\n}\n\nint main()\ntry{\n    string input = \"\";\n    vector<int> digits;\n    int composed = 0;\n\n    cout << \"Integer number composer.\\n\"\n         << \"Introduce an integer number of \" << powers.size() << \" or less digits.\\n\"\n         << \"Terminate the program with Ctrl+D (or Ctrl+Z).\\n\";\n\n    while (cin >> input) {\n        if (check_input(input)) {\n            digits = parse_input(input);\n            composed = compose_integer(digits);\n            print_output(composed, digits);\n        }\n    }\n    if (cin.eof()) {\n        cout << \"Bye!\\n\";\n    }\n\n    return 0;\n}\ncatch(exception& e)\n{\n    cerr << \"Error: \" << e.what() << '\\n';\n    return 1;\n}\ncatch(...)\n{\n    cerr << \"Oops! Unknown exception!\\n\";\n    return 2;\n}\n<commit_msg>Typos.<commit_after>\/\/ 6.exericise.09.cpp\n\/\/\n\/\/ Write a program that reads digits and composes them into integers. For\n\/\/ example, 123 is read as the characters 1, 2 and 3. The program should output\n\/\/ 123 is 1 hundred and 2 tens and 3 ones. The number should be output as an\n\/\/ int value. Handle numbers with one, two, three, or four digits. Hint: to get\n\/\/ the integer value 5 from the character '5' substract '0', that is,\n\/\/ '5'-'0'==5.\n\/\/\n\/\/ Comments:\n\/\/\n\/\/  This is the kind of exercise that makes me feel unconfortable; there is\n\/\/  a simpler way of doing it. Why not read an integer and decompose it\n\/\/  instead? The output will be the same without the user noticing it.\n\/\/  Whatever, the requisites are clear so let's go for it.\n\/\/\n\/\/  We must read the input as a string. It's very much like I do in\n\/\/  5.exercise.12.cpp, so let's borrow some functions from it (check_input()\n\/\/  and parse_input()) and do some slight modifications to accomodate.\n\/\/\n\/\/  We must compose the integer and somehow retain the original digit by digit\n\/\/  data to do the verbose output. For the output we will do a trick with \n\/\/  a predefined vector of strings named powers; see print_output() for\n\/\/  details.\n\n#include \"std_lib_facilities.h\"\n\nstatic const string ex_msg_greater_than =\n        \"Your input is greater than I can manage.\";\nstatic const string ex_msg_not_only_digits =\n        \"Your input is not an integer number.\";\n\nstatic const vector<string> powers = {\"thousand\", \"hundred\", \"ten\", \"one\"};\n\nbool check_input(const string& input)\n\/\/ Checks input to be equal or less digits than we're able to manage .\n\/\/ Pre-conditions:\n\/\/  The length of the string must be less or equal to powers.size()\n\/\/  Each character of the string must be an ASCII (or compatible, as ISO or UTF8)\n\/\/      value for chars from '0' to '9' (they are consecutive).\ntry\n{\n    if (input.length() > powers.size()) throw runtime_error(ex_msg_greater_than);\n\n    for (char c : input)\n        if (c < '0' || c > '9')\n            throw runtime_error(ex_msg_not_only_digits);\n\n    return true;\n}\ncatch (exception& e)\n{\n    cout << e.what() << '\\n';\n    return false;\n}\n\nvector<int> parse_input(const string& input)\n\/\/ Converts a digits string to a vector of ints \n\/\/ Pre-condition:\n\/\/  input has to have been checked by check_input()\n{\n    vector<int> parse;\n\n    for (char d : input) {\n        \/\/ Ignore leading 0's\n        if (parse.size() != 0 || d != '0')\n            parse.push_back(d - '0');\n    }\n    \/\/ Manage the case where user has introduced 0 as a number\n    \/\/ We can do it in the former for if we change it to\n    \/\/ a classical form to inspect the current index to input.\n    if (parse.size() == 0)\n        parse.push_back(0);\n\n    return parse;\n}\n\nint compose_integer(const vector<int>& digits)\n\/\/ Compose an integer number out of its digits\n\/\/ I could do this on parse_input, but let's enforce the principle of\n\/\/ a function doing just one thing.\n{\n    int result = 0;\n\n    for (int d: digits)\n        result = result*10 + d;\n\n    return result;\n}\n\nvoid print_output(int result, const vector<int>& digits)\n\/\/ Print composed integer result and do verbose output based on digits and\n\/\/ powers.\n{\n    cout << result << \" is \";\n    \/\/ index to start the walk on powers vector, so number of digits\n    \/\/ tell us if we have thousands or not, hundreds or not, and so on.\n    size_t idx = powers.size() - digits.size();\n    for (int d : digits) {\n        \/\/ We manage plurals with the ternary operator\n        cout << d << ' ' << powers[idx] << ( d == 1 ? \" \" : \"s \" );\n        ++idx;\n        if (idx < powers.size())\n            cout << \"and \";\n    }\n    cout << '\\n';\n}\n\nint main()\ntry{\n    string input = \"\";\n    vector<int> digits;\n    int composed = 0;\n\n    cout << \"Integer number composer.\\n\"\n         << \"Introduce an integer number of \" << powers.size() << \" or less digits.\\n\"\n         << \"Terminate the program with Ctrl+D (or Ctrl+Z).\\n\";\n\n    while (cin >> input) {\n        if (check_input(input)) {\n            digits = parse_input(input);\n            composed = compose_integer(digits);\n            print_output(composed, digits);\n        }\n    }\n    if (cin.eof()) {\n        cout << \"Bye!\\n\";\n    }\n\n    return 0;\n}\ncatch(exception& e)\n{\n    cerr << \"Error: \" << e.what() << '\\n';\n    return 1;\n}\ncatch(...)\n{\n    cerr << \"Oops! Unknown exception!\\n\";\n    return 2;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: ftpstrcont.hxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: abi $ $Date: 2002-08-28 07:29:51 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n\/**************************************************************************\n                                TODO\n **************************************************************************\n\n *************************************************************************\/\n#ifndef _FTP_STRCONT_HXX_\n#define _FTP_STRCONT_HXX_\n\n#include <com\/sun\/star\/io\/XInputStream.hpp>\n#include <com\/sun\/star\/io\/XOutputStream.hpp>\n#include \"ftpcfunc.hxx\"\n\n\nnamespace ftp {\n\n\n    class FTPInputStream;\n\n\n    class FTPOutputStreamContainer\n        : public FTPStreamContainer\n    {\n    public:\n\n        FTPOutputStreamContainer(const com::sun::star::uno::Reference<\n                                 com::sun::star::io::XOutputStream>& out);\n\n        virtual write(void *buffer,size_t size,size_t nmemb);\n\n\n    private:\n\n        com::sun::star::uno::Reference<\n        com::sun::star::io::XOutputStream> m_out;\n    };\n\n\n    class FTPInputStreamContainer\n        : public FTPStreamContainer\n    {\n    public:\n\n        FTPInputStreamContainer(FTPInputStream* out);\n\n        virtual write(void *buffer,size_t size,size_t nmemb);\n\n        com::sun::star::uno::Reference<\n        com::sun::star::io::XInputStream> operator()();\n\n    private:\n\n        FTPInputStream* m_out;\n    };\n\n\n}\n\n\n#endif\n<commit_msg>INTEGRATION: CWS ooo20031110 (1.2.94); FILE MERGED 2003\/11\/04 00:13:56 waratah 1.2.94.1: #21906# add size_t to function definitions, implicitly int also add class keyword to friend definition<commit_after>\/*************************************************************************\n *\n *  $RCSfile: ftpstrcont.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2003-12-01 15:56:22 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n\/**************************************************************************\n                                TODO\n **************************************************************************\n\n *************************************************************************\/\n#ifndef _FTP_STRCONT_HXX_\n#define _FTP_STRCONT_HXX_\n\n#include <com\/sun\/star\/io\/XInputStream.hpp>\n#include <com\/sun\/star\/io\/XOutputStream.hpp>\n#include \"ftpcfunc.hxx\"\n\n\nnamespace ftp {\n\n\n    class FTPInputStream;\n\n\n    class FTPOutputStreamContainer\n        : public FTPStreamContainer\n    {\n    public:\n\n        FTPOutputStreamContainer(const com::sun::star::uno::Reference<\n                                 com::sun::star::io::XOutputStream>& out);\n\n        virtual size_t write(void *buffer,size_t size,size_t nmemb);\n\n\n    private:\n\n        com::sun::star::uno::Reference<\n        com::sun::star::io::XOutputStream> m_out;\n    };\n\n\n    class FTPInputStreamContainer\n        : public FTPStreamContainer\n    {\n    public:\n\n        FTPInputStreamContainer(FTPInputStream* out);\n\n        virtual size_t write(void *buffer,size_t size,size_t nmemb);\n\n        com::sun::star::uno::Reference<\n        com::sun::star::io::XInputStream> operator()();\n\n    private:\n\n        FTPInputStream* m_out;\n    };\n\n\n}\n\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: NeonUri.cxx,v $\n *\n *  $Revision: 1.23 $\n *\n *  last change: $Author: rt $ $Date: 2008-02-19 12:35: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_ucb.hxx\"\n\n#include <string.h>\n\n#ifndef _RTL_URI_HXX_\n#include <rtl\/uri.hxx>\n#endif\n#ifndef _RTL_OUSTRING_HXX_\n#include <rtl\/ustring.hxx>\n#endif\n#ifndef _RTL_USTRBUF_HXX_\n#include <rtl\/ustrbuf.hxx>\n#endif\n\n#ifndef _NEONURI_HXX_\n#include \"NeonUri.hxx\"\n#endif\n#ifndef _DAVEXCEPTION_HXX_\n#include \"DAVException.hxx\"\n#endif\n\n#include \"..\/inc\/urihelper.hxx\"\n\nusing namespace webdav_ucp;\n\n    char *scheme;\n    char *host, *userinfo;\n    unsigned int port;\n    char *path, *query, *fragment;\n\n# if defined __SUNPRO_CC\n\/\/ FIXME: not sure whether initializing a ne_uri statically is supposed to work\n\/\/ the string fields of ne_uri are char*, not const char*\n# pragma disable_warn\n# endif\n\nnamespace {\n\nconst ne_uri g_sUriDefaultsHTTP  = { \"http\",\n#if NEON_VERSION >= 0x0260\n                                     NULL,\n#endif\n                                     NULL,\n                                     DEFAULT_HTTP_PORT,\n#if NEON_VERSION >= 0x0260\n                                     NULL,\n#endif\n                                     NULL,\n                                     NULL };\nconst ne_uri g_sUriDefaultsHTTPS = { \"https\",\n#if NEON_VERSION >= 0x0260\n                                     NULL,\n#endif\n                                     NULL,\n                                     DEFAULT_HTTPS_PORT,\n#if NEON_VERSION >= 0x0260\n                                     NULL,\n#endif\n                                     NULL,\n                                     NULL };\nconst ne_uri g_sUriDefaultsFTP   = { \"ftp\",\n#if NEON_VERSION >= 0x0260\n                                     NULL,\n#endif\n                                     NULL,\n                                     DEFAULT_FTP_PORT,\n#if NEON_VERSION >= 0x0260\n                                     NULL,\n#endif\n                                     NULL,\n                                     NULL };\n} \/\/ namespace\n\n# if defined __SUNPRO_CC\n# pragma enable_warn\n#endif\n\n\/\/ -------------------------------------------------------------------\n\/\/ Constructor\n\/\/ -------------------------------------------------------------------\n\nnamespace {\n\n\/\/TODO! rtl::OString::matchIgnoreAsciiCaseAsciiL() missing\ninline bool matchIgnoreAsciiCase(rtl::OString const & rStr1,\n                                 sal_Char const * pStr2,\n                                 sal_Int32 nStr2Len) SAL_THROW(())\n{\n    return\n        rtl_str_shortenedCompareIgnoreAsciiCase_WithLength(\n                rStr1.getStr(), rStr1.getLength(), pStr2, nStr2Len, nStr2Len)\n            == 0;\n}\n\n}\n\nNeonUri::NeonUri( const ne_uri * inUri )\n    throw ( DAVException )\n{\n    if ( inUri == 0 )\n        throw DAVException( DAVException::DAV_INVALID_ARG );\n\n    char * uri = ne_uri_unparse( inUri );\n\n    if ( uri == 0 )\n        throw DAVException( DAVException::DAV_INVALID_ARG );\n\n    init( rtl::OString( uri ), inUri );\n    free( uri );\n\n    calculateURI();\n}\n\nNeonUri::NeonUri( const rtl::OUString & inUri )\n    throw ( DAVException )\n{\n    if ( inUri.getLength() <= 0 )\n        throw DAVException( DAVException::DAV_INVALID_ARG );\n\n    \/\/ #i77023#\n    rtl::OUString aEscapedUri( ucb_impl::urihelper::encodeURI( inUri ) );\n\n    rtl::OString theInputUri(\n        aEscapedUri.getStr(), aEscapedUri.getLength(), RTL_TEXTENCODING_UTF8 );\n\n    ne_uri theUri;\n    if ( ne_uri_parse( theInputUri.getStr(), &theUri ) != 0 )\n    {\n        ne_uri_free( &theUri );\n        throw DAVException( DAVException::DAV_INVALID_ARG );\n    }\n\n    init( theInputUri, &theUri );\n    ne_uri_free( &theUri );\n\n    calculateURI();\n}\n\nvoid NeonUri::init( const rtl::OString & rUri, const ne_uri * pUri )\n{\n    \/\/ Complete URI.\n    const ne_uri * pUriDefs\n        = matchIgnoreAsciiCase( rUri,\n                                RTL_CONSTASCII_STRINGPARAM( \"ftp:\" ) ) ?\n              &g_sUriDefaultsFTP :\n          matchIgnoreAsciiCase( rUri,\n                                RTL_CONSTASCII_STRINGPARAM( \"https:\" ) ) ?\n              &g_sUriDefaultsHTTPS :\n              &g_sUriDefaultsHTTP;\n\n    mScheme   = rtl::OStringToOUString(\n                    pUri->scheme ? pUri->scheme : pUriDefs->scheme,\n                    RTL_TEXTENCODING_UTF8 );\n    mUserInfo = rtl::OStringToOUString(\n#if NEON_VERSION >= 0x0260\n                    pUri->userinfo ? pUri->userinfo : pUriDefs->userinfo,\n#else\n                    pUri->authinfo ? pUri->authinfo : pUriDefs->authinfo,\n#endif\n                    RTL_TEXTENCODING_UTF8 );\n    mHostName = rtl::OStringToOUString(\n                    pUri->host ? pUri->host : pUriDefs->host,\n                    RTL_TEXTENCODING_UTF8 );\n    mPort     = pUri->port > 0 ? pUri->port : pUriDefs->port;\n    mPath     = rtl::OStringToOUString(\n                    pUri->path ? pUri->path : pUriDefs->path,\n                    RTL_TEXTENCODING_UTF8 );\n\n#if NEON_VERSION >= 0x0260\n    if ( pUri->query )\n    {\n        mPath += rtl::OUString::createFromAscii( \"?\" );\n        mPath += rtl::OStringToOUString(\n            pUri->query,  RTL_TEXTENCODING_UTF8 );\n    }\n\n    if ( pUri->fragment )\n    {\n        mPath += rtl::OUString::createFromAscii( \"#\" );\n        mPath += rtl::OStringToOUString(\n            pUri->fragment,  RTL_TEXTENCODING_UTF8 );\n    }\n#endif\n}\n\n\/\/ -------------------------------------------------------------------\n\/\/ Destructor\n\/\/ -------------------------------------------------------------------\nNeonUri::~NeonUri( )\n{\n}\n\nvoid NeonUri::calculateURI ()\n{\n    rtl::OUStringBuffer aBuf( mScheme );\n    aBuf.appendAscii( \":\/\/\" );\n    if ( mUserInfo.getLength() > 0 )\n    {\n        \/\/TODO! differentiate between empty and missing userinfo\n        aBuf.append( mUserInfo );\n        aBuf.appendAscii( \"@\" );\n    }\n    \/\/ Is host a numeric IPv6 address?\n    if ( ( mHostName.indexOf( ':' ) != -1 ) &&\n         ( mHostName[ 0 ] != sal_Unicode( '[' ) ) )\n    {\n        aBuf.appendAscii( \"[\" );\n        aBuf.append( mHostName );\n        aBuf.appendAscii( \"]\" );\n    }\n    else\n    {\n        aBuf.append( mHostName );\n    }\n\n    \/\/ append port, but only, if not default port.\n    bool bAppendPort = true;\n    switch ( mPort )\n    {\n    case DEFAULT_HTTP_PORT:\n        bAppendPort\n            = !mScheme.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM( \"http\" ) );\n        break;\n\n    case DEFAULT_HTTPS_PORT:\n        bAppendPort\n            = !mScheme.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM( \"https\" ) );\n        break;\n\n    case DEFAULT_FTP_PORT:\n        bAppendPort\n            = !mScheme.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM( \"ftp\" ) );\n        break;\n    }\n    if ( bAppendPort )\n    {\n        aBuf.appendAscii( \":\" );\n        aBuf.append( rtl::OUString::valueOf( mPort ) );\n    }\n    aBuf.append( mPath );\n\n    mURI = aBuf.makeStringAndClear();\n}\n\n::rtl::OUString NeonUri::GetPathBaseName () const\n{\n    sal_Int32 nPos = mPath.lastIndexOf ('\/');\n    sal_Int32 nTrail = 0;\n    if (nPos == mPath.getLength () - 1)\n    {\n        \/\/ Trailing slash found. Skip.\n        nTrail = 1;\n        nPos = mPath.lastIndexOf ('\/', nPos);\n    }\n    if (nPos != -1)\n    {\n        rtl::OUString aTemp(\n            mPath.copy (nPos + 1, mPath.getLength () - nPos - 1 - nTrail) );\n\n        \/\/ query, fragment present?\n        nPos = aTemp.indexOf( '?' );\n        if ( nPos == -1 )\n            nPos = aTemp.indexOf( '#' );\n\n        if ( nPos != -1 )\n            aTemp = aTemp.copy( 0, nPos );\n\n        return aTemp;\n    }\n    else\n        return rtl::OUString::createFromAscii (\"\/\");\n}\n\nbool NeonUri::operator== ( const NeonUri & rOther ) const\n{\n    return ( mURI == rOther.mURI );\n}\n\n::rtl::OUString NeonUri::GetPathBaseNameUnescaped () const\n{\n    return unescape( GetPathBaseName() );\n}\n\n::rtl::OUString NeonUri::GetPathDirName () const\n{\n    sal_Int32 nPos = mPath.lastIndexOf ('\/');\n    if (nPos == mPath.getLength () - 1)\n    {\n        \/\/ Trailing slash found. Skip.\n        nPos = mPath.lastIndexOf ('\/', nPos);\n    }\n    if (nPos != -1)\n        return mPath.copy (0, nPos + 1);\n    else\n        return rtl::OUString::createFromAscii (\"\/\");\n}\n\nvoid NeonUri::AppendPath (const rtl::OUString& rPath)\n{\n    if (mPath.lastIndexOf ('\/') != mPath.getLength () - 1)\n        mPath += rtl::OUString::createFromAscii (\"\/\");\n\n    mPath += rPath;\n    calculateURI ();\n};\n\n\/\/ static\nrtl::OUString NeonUri::escapeSegment( const rtl::OUString& segment )\n{\n    return rtl::Uri::encode( segment,\n                             rtl_UriCharClassPchar,\n                             rtl_UriEncodeIgnoreEscapes,\n                             RTL_TEXTENCODING_UTF8 );\n}\n\n\/\/ static\nrtl::OUString NeonUri::unescape( const rtl::OUString& segment )\n{\n    return rtl::Uri::decode( segment,\n                             rtl_UriDecodeWithCharset,\n                             RTL_TEXTENCODING_UTF8 );\n}\n\n\/\/ static\nrtl::OUString NeonUri::makeConnectionEndPointString(\n                                const rtl::OUString & rHostName, int nPort )\n{\n    rtl::OUStringBuffer aBuf;\n\n    \/\/ Is host a numeric IPv6 address?\n    if ( ( rHostName.indexOf( ':' ) != -1 ) &&\n         ( rHostName[ 0 ] != sal_Unicode( '[' ) ) )\n    {\n        aBuf.appendAscii( \"[\" );\n        aBuf.append( rHostName );\n        aBuf.appendAscii( \"]\" );\n    }\n    else\n    {\n        aBuf.append( rHostName );\n    }\n\n    if ( ( nPort != DEFAULT_HTTP_PORT ) && ( nPort != DEFAULT_HTTPS_PORT ) )\n    {\n        aBuf.appendAscii( \":\" );\n        aBuf.append( rtl::OUString::valueOf( sal_Int32( nPort ) ) );\n    }\n    return aBuf.makeStringAndClear();\n}\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.23.16); FILE MERGED 2008\/04\/01 16:02:27 thb 1.23.16.3: #i85898# Stripping all external header guards 2008\/04\/01 12:58:27 thb 1.23.16.2: #i85898# Stripping all external header guards 2008\/03\/31 15:30:31 rt 1.23.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: NeonUri.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_ucb.hxx\"\n\n#include <string.h>\n#include <rtl\/uri.hxx>\n#include <rtl\/ustring.hxx>\n#include <rtl\/ustrbuf.hxx>\n#include \"NeonUri.hxx\"\n#include \"DAVException.hxx\"\n\n#include \"..\/inc\/urihelper.hxx\"\n\nusing namespace webdav_ucp;\n\n    char *scheme;\n    char *host, *userinfo;\n    unsigned int port;\n    char *path, *query, *fragment;\n\n# if defined __SUNPRO_CC\n\/\/ FIXME: not sure whether initializing a ne_uri statically is supposed to work\n\/\/ the string fields of ne_uri are char*, not const char*\n# pragma disable_warn\n# endif\n\nnamespace {\n\nconst ne_uri g_sUriDefaultsHTTP  = { \"http\",\n#if NEON_VERSION >= 0x0260\n                                     NULL,\n#endif\n                                     NULL,\n                                     DEFAULT_HTTP_PORT,\n#if NEON_VERSION >= 0x0260\n                                     NULL,\n#endif\n                                     NULL,\n                                     NULL };\nconst ne_uri g_sUriDefaultsHTTPS = { \"https\",\n#if NEON_VERSION >= 0x0260\n                                     NULL,\n#endif\n                                     NULL,\n                                     DEFAULT_HTTPS_PORT,\n#if NEON_VERSION >= 0x0260\n                                     NULL,\n#endif\n                                     NULL,\n                                     NULL };\nconst ne_uri g_sUriDefaultsFTP   = { \"ftp\",\n#if NEON_VERSION >= 0x0260\n                                     NULL,\n#endif\n                                     NULL,\n                                     DEFAULT_FTP_PORT,\n#if NEON_VERSION >= 0x0260\n                                     NULL,\n#endif\n                                     NULL,\n                                     NULL };\n} \/\/ namespace\n\n# if defined __SUNPRO_CC\n# pragma enable_warn\n#endif\n\n\/\/ -------------------------------------------------------------------\n\/\/ Constructor\n\/\/ -------------------------------------------------------------------\n\nnamespace {\n\n\/\/TODO! rtl::OString::matchIgnoreAsciiCaseAsciiL() missing\ninline bool matchIgnoreAsciiCase(rtl::OString const & rStr1,\n                                 sal_Char const * pStr2,\n                                 sal_Int32 nStr2Len) SAL_THROW(())\n{\n    return\n        rtl_str_shortenedCompareIgnoreAsciiCase_WithLength(\n                rStr1.getStr(), rStr1.getLength(), pStr2, nStr2Len, nStr2Len)\n            == 0;\n}\n\n}\n\nNeonUri::NeonUri( const ne_uri * inUri )\n    throw ( DAVException )\n{\n    if ( inUri == 0 )\n        throw DAVException( DAVException::DAV_INVALID_ARG );\n\n    char * uri = ne_uri_unparse( inUri );\n\n    if ( uri == 0 )\n        throw DAVException( DAVException::DAV_INVALID_ARG );\n\n    init( rtl::OString( uri ), inUri );\n    free( uri );\n\n    calculateURI();\n}\n\nNeonUri::NeonUri( const rtl::OUString & inUri )\n    throw ( DAVException )\n{\n    if ( inUri.getLength() <= 0 )\n        throw DAVException( DAVException::DAV_INVALID_ARG );\n\n    \/\/ #i77023#\n    rtl::OUString aEscapedUri( ucb_impl::urihelper::encodeURI( inUri ) );\n\n    rtl::OString theInputUri(\n        aEscapedUri.getStr(), aEscapedUri.getLength(), RTL_TEXTENCODING_UTF8 );\n\n    ne_uri theUri;\n    if ( ne_uri_parse( theInputUri.getStr(), &theUri ) != 0 )\n    {\n        ne_uri_free( &theUri );\n        throw DAVException( DAVException::DAV_INVALID_ARG );\n    }\n\n    init( theInputUri, &theUri );\n    ne_uri_free( &theUri );\n\n    calculateURI();\n}\n\nvoid NeonUri::init( const rtl::OString & rUri, const ne_uri * pUri )\n{\n    \/\/ Complete URI.\n    const ne_uri * pUriDefs\n        = matchIgnoreAsciiCase( rUri,\n                                RTL_CONSTASCII_STRINGPARAM( \"ftp:\" ) ) ?\n              &g_sUriDefaultsFTP :\n          matchIgnoreAsciiCase( rUri,\n                                RTL_CONSTASCII_STRINGPARAM( \"https:\" ) ) ?\n              &g_sUriDefaultsHTTPS :\n              &g_sUriDefaultsHTTP;\n\n    mScheme   = rtl::OStringToOUString(\n                    pUri->scheme ? pUri->scheme : pUriDefs->scheme,\n                    RTL_TEXTENCODING_UTF8 );\n    mUserInfo = rtl::OStringToOUString(\n#if NEON_VERSION >= 0x0260\n                    pUri->userinfo ? pUri->userinfo : pUriDefs->userinfo,\n#else\n                    pUri->authinfo ? pUri->authinfo : pUriDefs->authinfo,\n#endif\n                    RTL_TEXTENCODING_UTF8 );\n    mHostName = rtl::OStringToOUString(\n                    pUri->host ? pUri->host : pUriDefs->host,\n                    RTL_TEXTENCODING_UTF8 );\n    mPort     = pUri->port > 0 ? pUri->port : pUriDefs->port;\n    mPath     = rtl::OStringToOUString(\n                    pUri->path ? pUri->path : pUriDefs->path,\n                    RTL_TEXTENCODING_UTF8 );\n\n#if NEON_VERSION >= 0x0260\n    if ( pUri->query )\n    {\n        mPath += rtl::OUString::createFromAscii( \"?\" );\n        mPath += rtl::OStringToOUString(\n            pUri->query,  RTL_TEXTENCODING_UTF8 );\n    }\n\n    if ( pUri->fragment )\n    {\n        mPath += rtl::OUString::createFromAscii( \"#\" );\n        mPath += rtl::OStringToOUString(\n            pUri->fragment,  RTL_TEXTENCODING_UTF8 );\n    }\n#endif\n}\n\n\/\/ -------------------------------------------------------------------\n\/\/ Destructor\n\/\/ -------------------------------------------------------------------\nNeonUri::~NeonUri( )\n{\n}\n\nvoid NeonUri::calculateURI ()\n{\n    rtl::OUStringBuffer aBuf( mScheme );\n    aBuf.appendAscii( \":\/\/\" );\n    if ( mUserInfo.getLength() > 0 )\n    {\n        \/\/TODO! differentiate between empty and missing userinfo\n        aBuf.append( mUserInfo );\n        aBuf.appendAscii( \"@\" );\n    }\n    \/\/ Is host a numeric IPv6 address?\n    if ( ( mHostName.indexOf( ':' ) != -1 ) &&\n         ( mHostName[ 0 ] != sal_Unicode( '[' ) ) )\n    {\n        aBuf.appendAscii( \"[\" );\n        aBuf.append( mHostName );\n        aBuf.appendAscii( \"]\" );\n    }\n    else\n    {\n        aBuf.append( mHostName );\n    }\n\n    \/\/ append port, but only, if not default port.\n    bool bAppendPort = true;\n    switch ( mPort )\n    {\n    case DEFAULT_HTTP_PORT:\n        bAppendPort\n            = !mScheme.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM( \"http\" ) );\n        break;\n\n    case DEFAULT_HTTPS_PORT:\n        bAppendPort\n            = !mScheme.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM( \"https\" ) );\n        break;\n\n    case DEFAULT_FTP_PORT:\n        bAppendPort\n            = !mScheme.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM( \"ftp\" ) );\n        break;\n    }\n    if ( bAppendPort )\n    {\n        aBuf.appendAscii( \":\" );\n        aBuf.append( rtl::OUString::valueOf( mPort ) );\n    }\n    aBuf.append( mPath );\n\n    mURI = aBuf.makeStringAndClear();\n}\n\n::rtl::OUString NeonUri::GetPathBaseName () const\n{\n    sal_Int32 nPos = mPath.lastIndexOf ('\/');\n    sal_Int32 nTrail = 0;\n    if (nPos == mPath.getLength () - 1)\n    {\n        \/\/ Trailing slash found. Skip.\n        nTrail = 1;\n        nPos = mPath.lastIndexOf ('\/', nPos);\n    }\n    if (nPos != -1)\n    {\n        rtl::OUString aTemp(\n            mPath.copy (nPos + 1, mPath.getLength () - nPos - 1 - nTrail) );\n\n        \/\/ query, fragment present?\n        nPos = aTemp.indexOf( '?' );\n        if ( nPos == -1 )\n            nPos = aTemp.indexOf( '#' );\n\n        if ( nPos != -1 )\n            aTemp = aTemp.copy( 0, nPos );\n\n        return aTemp;\n    }\n    else\n        return rtl::OUString::createFromAscii (\"\/\");\n}\n\nbool NeonUri::operator== ( const NeonUri & rOther ) const\n{\n    return ( mURI == rOther.mURI );\n}\n\n::rtl::OUString NeonUri::GetPathBaseNameUnescaped () const\n{\n    return unescape( GetPathBaseName() );\n}\n\n::rtl::OUString NeonUri::GetPathDirName () const\n{\n    sal_Int32 nPos = mPath.lastIndexOf ('\/');\n    if (nPos == mPath.getLength () - 1)\n    {\n        \/\/ Trailing slash found. Skip.\n        nPos = mPath.lastIndexOf ('\/', nPos);\n    }\n    if (nPos != -1)\n        return mPath.copy (0, nPos + 1);\n    else\n        return rtl::OUString::createFromAscii (\"\/\");\n}\n\nvoid NeonUri::AppendPath (const rtl::OUString& rPath)\n{\n    if (mPath.lastIndexOf ('\/') != mPath.getLength () - 1)\n        mPath += rtl::OUString::createFromAscii (\"\/\");\n\n    mPath += rPath;\n    calculateURI ();\n};\n\n\/\/ static\nrtl::OUString NeonUri::escapeSegment( const rtl::OUString& segment )\n{\n    return rtl::Uri::encode( segment,\n                             rtl_UriCharClassPchar,\n                             rtl_UriEncodeIgnoreEscapes,\n                             RTL_TEXTENCODING_UTF8 );\n}\n\n\/\/ static\nrtl::OUString NeonUri::unescape( const rtl::OUString& segment )\n{\n    return rtl::Uri::decode( segment,\n                             rtl_UriDecodeWithCharset,\n                             RTL_TEXTENCODING_UTF8 );\n}\n\n\/\/ static\nrtl::OUString NeonUri::makeConnectionEndPointString(\n                                const rtl::OUString & rHostName, int nPort )\n{\n    rtl::OUStringBuffer aBuf;\n\n    \/\/ Is host a numeric IPv6 address?\n    if ( ( rHostName.indexOf( ':' ) != -1 ) &&\n         ( rHostName[ 0 ] != sal_Unicode( '[' ) ) )\n    {\n        aBuf.appendAscii( \"[\" );\n        aBuf.append( rHostName );\n        aBuf.appendAscii( \"]\" );\n    }\n    else\n    {\n        aBuf.append( rHostName );\n    }\n\n    if ( ( nPort != DEFAULT_HTTP_PORT ) && ( nPort != DEFAULT_HTTPS_PORT ) )\n    {\n        aBuf.appendAscii( \":\" );\n        aBuf.append( rtl::OUString::valueOf( sal_Int32( nPort ) ) );\n    }\n    return aBuf.makeStringAndClear();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: extinput.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: jp $ $Date: 2000-11-28 18:49: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#ifndef _EXTINPUT_HXX\n#define _EXTINPUT_HXX\n\n#ifndef _SVSTDARR_HXX\n#define _SVSTDARR_USHORTS\n#include <svtools\/svstdarr.hxx>\n#endif\n#ifndef _PAM_HXX\n#include <pam.hxx>\n#endif\n\nclass CommandExtTextInputData;\nclass Font;\n\nclass SwExtTextInput : public SwPaM\n{\n    SvUShorts aAttrs;\n    BOOL bInsText : 1;\n    BOOL bIsOverwriteCursor : 1;\npublic:\n    SwExtTextInput( const SwPaM& rPam, Ring* pRing = 0 );\n    virtual ~SwExtTextInput();\n\n    void SetInputData( const CommandExtTextInputData& rData );\n    void InvalidateRange();\n    void SetFontForPos( USHORT nPos, Font& rFont );\n    const SvUShorts& GetAttrs() const   { return aAttrs; }\n    BOOL IsInsText() const              { return bInsText; }\n    void SetInsText( BOOL bFlag )       { bInsText = bFlag; }\n    BOOL IsOverwriteCursor() const      { return bIsOverwriteCursor; }\n    void SetOverwriteCursor( BOOL bFlag ) { bIsOverwriteCursor = bFlag; }\n};\n\n#endif  \/\/_EXTINPUT_HXX\n\n<commit_msg>Bug #86377#: cache the original string for overwrite mode<commit_after>\/*************************************************************************\n *\n *  $RCSfile: extinput.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: jp $ $Date: 2001-06-08 13:35:48 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef _EXTINPUT_HXX\n#define _EXTINPUT_HXX\n\n#ifndef _SVSTDARR_HXX\n#define _SVSTDARR_USHORTS\n#include <svtools\/svstdarr.hxx>\n#endif\n#ifndef _PAM_HXX\n#include <pam.hxx>\n#endif\n\nclass CommandExtTextInputData;\nclass Font;\n\nclass SwExtTextInput : public SwPaM\n{\n    SvUShorts aAttrs;\n    String sOverwriteText;\n    BOOL bInsText : 1;\n    BOOL bIsOverwriteCursor : 1;\npublic:\n    SwExtTextInput( const SwPaM& rPam, Ring* pRing = 0 );\n    virtual ~SwExtTextInput();\n\n    void SetInputData( const CommandExtTextInputData& rData );\n    void InvalidateRange();\n    void SetFontForPos( USHORT nPos, Font& rFont );\n    const SvUShorts& GetAttrs() const   { return aAttrs; }\n    BOOL IsInsText() const              { return bInsText; }\n    void SetInsText( BOOL bFlag )       { bInsText = bFlag; }\n    BOOL IsOverwriteCursor() const      { return bIsOverwriteCursor; }\n    void SetOverwriteCursor( BOOL bFlag );\n};\n\n#endif  \/\/_EXTINPUT_HXX\n\n<|endoftext|>"}
{"text":"<commit_before>#include <QApplication>\n#include <QSettings>\n#include <QLocale>\n#include <QTranslator>\n#include <QLibraryInfo>\n\n#include \"trayicon.h\"\n\n\n\nint main(int argc, char **argv)\n{\n    QApplication app(argc, argv);\n    QApplication::setOrganizationName(\"Restnotifier\");\n    app.setQuitOnLastWindowClosed(false);\n\n    \/\/ Set language\n    QSettings settings;\n    QString lang;\n    QTranslator translator, qtTranslator;\n    if (settings.contains(\"lang\"))\n        lang = settings.value(\"lang\").toString();\n    else\n        lang = QLocale::languageToString(QLocale::system().language());\n    if (lang == \"ru\")\n    {\n        QLocale::setDefault(QLocale(\"ru\"));\n\n        \/\/ install qt translator\n#if defined Q_WS_X11\n        const QString loc = QLibraryInfo::location(QLibraryInfo::TranslationsPath);\n#elif defined Q_WS_WIN\n        const QString loc();\n#endif\n        qtTranslator.load(\"qt_ru\", loc);\n        app.installTranslator(&qtTranslator);\n\n        \/\/ install app translator\n        translator.load(\"restnotifier_ru\");\n        app.installTranslator(&translator);\n    }\n\n    TrayIcon *trayIcon = new TrayIcon();\n    trayIcon->show();\n    QObject::connect(trayIcon, SIGNAL(quitScheduled()), &app, SLOT(quit()));\n    int code = app.exec();\n    delete trayIcon;\n    return code;\n}\n<commit_msg>Allow to change path to translations<commit_after>#include <QApplication>\n#include <QSettings>\n#include <QLocale>\n#include <QTranslator>\n#include <QLibraryInfo>\n\n#include \"trayicon.h\"\n\n\n\nint main(int argc, char **argv)\n{\n    QApplication app(argc, argv);\n    QApplication::setOrganizationName(\"Restnotifier\");\n    app.setQuitOnLastWindowClosed(false);\n\n    \/\/ Set language\n    QSettings settings;\n    QString lang;\n    QTranslator translator, qtTranslator;\n    if (settings.contains(\"lang\"))\n        lang = settings.value(\"lang\").toString();\n    else\n        lang = QLocale::languageToString(QLocale::system().language());\n    if (lang == \"ru\")\n    {\n        QLocale::setDefault(QLocale(\"ru\"));\n\n        \/\/ install qt translator\n#if defined Q_WS_X11\n        const QString loc = QLibraryInfo::location(QLibraryInfo::TranslationsPath);\n#elif defined Q_WS_WIN\n        const QString loc();\n#endif\n        qtTranslator.load(\"qt_ru\", loc);\n        app.installTranslator(&qtTranslator);\n\n        \/\/ install app translator\n        QString translationsPath = settings.value(\"tr_path\", QString()).toString();\n        translator.load(\"restnotifier_ru\", translationsPath);\n        app.installTranslator(&translator);\n    }\n\n    TrayIcon *trayIcon = new TrayIcon();\n    trayIcon->show();\n    QObject::connect(trayIcon, SIGNAL(quitScheduled()), &app, SLOT(quit()));\n    int code = app.exec();\n    delete trayIcon;\n    return code;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n  Q Light Controller\n  monitorfixture.cpp\n\n  Copyright (c) Heikki Junnila\n\n  Licensed under the Apache License, Version 2.0 (the \"License\");\n  you may not use this file except in 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 <QGridLayout>\n#include <QByteArray>\n#include <QString>\n#include <QFrame>\n#include <QLabel>\n#include <QDebug>\n#include <QFont>\n#include <cmath>\n\n#include \"monitorfixture.h\"\n#include \"outputpatch.h\"\n#include \"qlcmacros.h\"\n#include \"fixture.h\"\n#include \"doc.h\"\n#include \"qlccapability.h\"\n\nMonitorFixture::MonitorFixture(QWidget* parent, Doc* doc)\n    : QFrame(parent)\n    , m_doc(doc)\n{\n    Q_ASSERT(doc != NULL);\n\n    m_fixtureLabel = NULL;\n    m_fixture = Fixture::invalidId();\n    m_channelStyle = MonitorProperties::DMXChannels;\n    m_valueStyle = MonitorProperties::DMXValues;\n\n    new QGridLayout(this);\n    layout()->setMargin(3);\n\n    setFrameStyle(QFrame::StyledPanel | QFrame::Sunken);\n    setAutoFillBackground(true);\n    setBackgroundRole(QPalette::Window);\n}\n\nMonitorFixture::~MonitorFixture()\n{\n    if (m_fixture != Fixture::invalidId())\n    {\n        Fixture* fxi = m_doc->fixture(m_fixture);\n        if (fxi != NULL)\n            disconnect(fxi, SIGNAL(valuesChanged()), this, SLOT(slotValuesChanged()));\n    }\n\n    if (m_fixtureLabel != NULL)\n        delete m_fixtureLabel;\n\n    while (m_iconsLabels.isEmpty() == false)\n        delete m_iconsLabels.takeFirst();\n    while (m_channelLabels.isEmpty() == false)\n        delete m_channelLabels.takeFirst();\n    while (m_valueLabels.isEmpty() == false)\n        delete m_valueLabels.takeFirst();\n}\n\nbool MonitorFixture::operator<(const MonitorFixture& mof)\n{\n    Fixture* fxi;\n    Fixture* mof_fxi;\n\n    fxi = m_doc->fixture(m_fixture);\n    if (fxi == NULL)\n        return false;\n\n    mof_fxi = m_doc->fixture(mof.fixture());\n    if (mof_fxi == NULL)\n        return false;\n\n    if ((*fxi) < (*mof_fxi))\n        return true;\n    else\n        return false;\n}\n\nvoid MonitorFixture::updateLabelStyles()\n{\n    slotChannelStyleChanged(m_channelStyle);\n    slotValueStyleChanged(m_valueStyle);\n}\n\n\/****************************************************************************\n * Fixture\n ****************************************************************************\/\n\nvoid MonitorFixture::setFixture(quint32 fxi_id)\n{\n    Fixture* fxi;\n\n    \/* Get rid of old stuff first, if such exists *\/\n    if (m_fixtureLabel != NULL)\n        delete m_fixtureLabel;\n    while (m_iconsLabels.isEmpty() == false)\n        delete m_iconsLabels.takeFirst();\n    while (m_channelLabels.isEmpty() == false)\n        delete m_channelLabels.takeFirst();\n    while (m_valueLabels.isEmpty() == false)\n        delete m_valueLabels.takeFirst();\n\n    m_fixture = fxi_id;\n    fxi = m_doc->fixture(m_fixture);\n    if (fxi != NULL)\n    {\n        \/* The grid layout uses columns and rows. The first row is for\n           the fixture name, second row for channel numbers and the\n           third row for channel values. Each channel is in its own\n           column. *\/\n        QGridLayout* lay = qobject_cast<QGridLayout*> (layout());\n        lay->setVerticalSpacing(1);\n\n        \/* Create a new fixture label and set the fixture name there *\/\n        m_fixtureLabel = new QLabel(this);\n        m_fixtureLabel->setText(QString(\"<B>%1<\/B>\").arg(fxi->name()));\n\n        \/* Set the fixture name to span all channels horizontally *\/\n        lay->addWidget(m_fixtureLabel, 0, 0, 1, fxi->channels(),\n                       Qt::AlignLeft);\n\n        QByteArray fxValues = fxi->channelValues();\n\n        \/* Create channel numbers and value labels *\/\n        for (quint32 i = 0; i < fxi->channels(); i++)\n        {\n            const QLCChannel * channel = fxi->channel(i);\n            \/* Create the icon over the channel number *\/\n            QLabel *icon = new QLabel(this);\n            icon->setFixedSize(22, 22);\n\n            \/* Create a label for channel number *\/\n            QLabel *label = new QLabel(this);\n\n            if (channel != NULL)\n            {\n                icon->setToolTip(channel->name());\n                label->setToolTip(channel->name());\n                QString resStr = channel->getIconNameFromGroup(channel->group());\n\n                if (resStr.startsWith(\":\"))\n                    icon->setStyleSheet(\"QLabel { border-image: url(\" + resStr + \") 0 0 0 0 stretch stretch; }\");\n                else\n                    icon->setStyleSheet(\"QLabel { background: \" + resStr + \"; }\");\n            }\n            lay->addWidget(icon, 1, i, Qt::AlignHCenter);\n            lay->addWidget(label, 2, i, Qt::AlignHCenter);\n            m_iconsLabels.append(icon);\n            m_channelLabels.append(label);\n\n            \/* Create a label for value *\/\n            QString str;\n            str.asprintf(\"%.3d\", uchar(fxValues.at(i)));\n            label = new QLabel(str, this);\n            lay->addWidget(label, 3, i, Qt::AlignHCenter);\n            m_valueLabels.append(label);\n        }\n        connect(fxi, SIGNAL(valuesChanged()), this, SLOT(slotValuesChanged()));\n    }\n}\n\nquint32 MonitorFixture::fixture() const\n{\n    return m_fixture;\n}\n\nvoid MonitorFixture::slotChannelStyleChanged(MonitorProperties::ChannelStyle style)\n{\n    QString str;\n    int i = 0;\n\n    m_channelStyle = style;\n\n    \/* Check that this MonitorFixture represents a fixture *\/\n    if (m_fixture == Fixture::invalidId())\n        return;\n\n    Fixture* fxi = m_doc->fixture(m_fixture);\n    Q_ASSERT(fxi != NULL);\n\n    \/* Start channel numbering from this fixture's address *\/\n    if (style == MonitorProperties::DMXChannels)\n        i = fxi->address() + 1;\n    else\n        i = 1;\n\n    QListIterator <QLabel*> it(m_channelLabels);\n    while (it.hasNext() == true)\n        it.next()->setText(str.asprintf(\"<B>%.3d<\/B>\", i++));\n}\n\n\/****************************************************************************\n * Values\n ****************************************************************************\/\n\nvoid MonitorFixture::slotValueStyleChanged(MonitorProperties::ValueStyle style)\n{\n    if (m_valueStyle == style)\n        return;\n\n    m_valueStyle = style;\n\n    QListIterator <QLabel*> it(m_valueLabels);\n    while (it.hasNext() == true)\n    {\n        QLabel* label;\n        QString str;\n        int value;\n\n        label = it.next();\n        Q_ASSERT(label != NULL);\n\n        value = label->text().toInt();\n\n        if (style == MonitorProperties::DMXValues)\n        {\n            value = int(ceil(SCALE(qreal(value),\n                                   qreal(0), qreal(100),\n                                   qreal(0), qreal(UCHAR_MAX))));\n        }\n        else\n        {\n            value = int(ceil(SCALE(qreal(value),\n                                   qreal(0), qreal(UCHAR_MAX),\n                                   qreal(0), qreal(100))));\n        }\n\n        label->setText(str.asprintf(\"%.3d\", value));\n    }\n}\n\nvoid MonitorFixture::slotValuesChanged()\n{\n    \/* Check that this MonitorFixture represents a fixture *\/\n    if (m_fixture == Fixture::invalidId())\n        return;\n\n    \/* Check that this MonitorFixture's fixture really exists *\/\n    Fixture* fxi = m_doc->fixture(m_fixture);\n    if (fxi == NULL)\n        return;\n\n    QByteArray fxValues = fxi->channelValues();\n    int i = 0;\n\n    QListIterator <QLabel*> it(m_valueLabels);\n    while (it.hasNext() == true)\n    {\n        QLabel* label = it.next();\n        Q_ASSERT(label != NULL);\n        QString str;\n\n        \/* Set the label's text to reflect the changed value *\/\n        if (m_valueStyle == MonitorProperties::DMXValues)\n        {\n            label->setText(str.asprintf(\"%.3d\", uchar(fxValues.at(i))));\n        }\n        else\n        {\n            label->setText(str.asprintf(\"%.3d\", int(ceil(SCALE(qreal(uchar(fxValues.at(i))),\n                                                               qreal(0), qreal(UCHAR_MAX),\n                                                               qreal(0), qreal(100))))));\n        }\n        i++;\n    }\n}\n<commit_msg>ui: fix monitor fixture value label initialization<commit_after>\/*\n  Q Light Controller\n  monitorfixture.cpp\n\n  Copyright (c) Heikki Junnila\n\n  Licensed under the Apache License, Version 2.0 (the \"License\");\n  you may not use this file except in 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 <QGridLayout>\n#include <QByteArray>\n#include <QString>\n#include <QFrame>\n#include <QLabel>\n#include <QDebug>\n#include <QFont>\n#include <cmath>\n\n#include \"monitorfixture.h\"\n#include \"outputpatch.h\"\n#include \"qlcmacros.h\"\n#include \"fixture.h\"\n#include \"doc.h\"\n#include \"qlccapability.h\"\n\nMonitorFixture::MonitorFixture(QWidget* parent, Doc* doc)\n    : QFrame(parent)\n    , m_doc(doc)\n{\n    Q_ASSERT(doc != NULL);\n\n    m_fixtureLabel = NULL;\n    m_fixture = Fixture::invalidId();\n    m_channelStyle = MonitorProperties::DMXChannels;\n    m_valueStyle = MonitorProperties::DMXValues;\n\n    new QGridLayout(this);\n    layout()->setMargin(3);\n\n    setFrameStyle(QFrame::StyledPanel | QFrame::Sunken);\n    setAutoFillBackground(true);\n    setBackgroundRole(QPalette::Window);\n}\n\nMonitorFixture::~MonitorFixture()\n{\n    if (m_fixture != Fixture::invalidId())\n    {\n        Fixture* fxi = m_doc->fixture(m_fixture);\n        if (fxi != NULL)\n            disconnect(fxi, SIGNAL(valuesChanged()), this, SLOT(slotValuesChanged()));\n    }\n\n    if (m_fixtureLabel != NULL)\n        delete m_fixtureLabel;\n\n    while (m_iconsLabels.isEmpty() == false)\n        delete m_iconsLabels.takeFirst();\n    while (m_channelLabels.isEmpty() == false)\n        delete m_channelLabels.takeFirst();\n    while (m_valueLabels.isEmpty() == false)\n        delete m_valueLabels.takeFirst();\n}\n\nbool MonitorFixture::operator<(const MonitorFixture& mof)\n{\n    Fixture* fxi;\n    Fixture* mof_fxi;\n\n    fxi = m_doc->fixture(m_fixture);\n    if (fxi == NULL)\n        return false;\n\n    mof_fxi = m_doc->fixture(mof.fixture());\n    if (mof_fxi == NULL)\n        return false;\n\n    if ((*fxi) < (*mof_fxi))\n        return true;\n    else\n        return false;\n}\n\nvoid MonitorFixture::updateLabelStyles()\n{\n    slotChannelStyleChanged(m_channelStyle);\n    slotValueStyleChanged(m_valueStyle);\n}\n\n\/****************************************************************************\n * Fixture\n ****************************************************************************\/\n\nvoid MonitorFixture::setFixture(quint32 fxi_id)\n{\n    Fixture* fxi;\n\n    \/* Get rid of old stuff first, if such exists *\/\n    if (m_fixtureLabel != NULL)\n        delete m_fixtureLabel;\n    while (m_iconsLabels.isEmpty() == false)\n        delete m_iconsLabels.takeFirst();\n    while (m_channelLabels.isEmpty() == false)\n        delete m_channelLabels.takeFirst();\n    while (m_valueLabels.isEmpty() == false)\n        delete m_valueLabels.takeFirst();\n\n    m_fixture = fxi_id;\n    fxi = m_doc->fixture(m_fixture);\n    if (fxi != NULL)\n    {\n        \/* The grid layout uses columns and rows. The first row is for\n           the fixture name, second row for channel numbers and the\n           third row for channel values. Each channel is in its own\n           column. *\/\n        QGridLayout* lay = qobject_cast<QGridLayout*> (layout());\n        lay->setVerticalSpacing(1);\n\n        \/* Create a new fixture label and set the fixture name there *\/\n        m_fixtureLabel = new QLabel(this);\n        m_fixtureLabel->setText(QString(\"<B>%1<\/B>\").arg(fxi->name()));\n\n        \/* Set the fixture name to span all channels horizontally *\/\n        lay->addWidget(m_fixtureLabel, 0, 0, 1, fxi->channels(),\n                       Qt::AlignLeft);\n\n        QByteArray fxValues = fxi->channelValues();\n\n        \/* Create channel numbers and value labels *\/\n        for (quint32 i = 0; i < fxi->channels(); i++)\n        {\n            const QLCChannel * channel = fxi->channel(i);\n            \/* Create the icon over the channel number *\/\n            QLabel *icon = new QLabel(this);\n            icon->setFixedSize(22, 22);\n\n            \/* Create a label for channel number *\/\n            QLabel *label = new QLabel(this);\n\n            if (channel != NULL)\n            {\n                icon->setToolTip(channel->name());\n                label->setToolTip(channel->name());\n                QString resStr = channel->getIconNameFromGroup(channel->group());\n\n                if (resStr.startsWith(\":\"))\n                    icon->setStyleSheet(\"QLabel { border-image: url(\" + resStr + \") 0 0 0 0 stretch stretch; }\");\n                else\n                    icon->setStyleSheet(\"QLabel { background: \" + resStr + \"; }\");\n            }\n            lay->addWidget(icon, 1, i, Qt::AlignHCenter);\n            lay->addWidget(label, 2, i, Qt::AlignHCenter);\n            m_iconsLabels.append(icon);\n            m_channelLabels.append(label);\n\n            \/* Create a label for value *\/\n            QString str;\n            label = new QLabel(this);\n            lay->addWidget(label, 3, i, Qt::AlignHCenter);\n            label->setText(str.asprintf(\"%.3d\", uchar(fxValues.at(i))));\n            m_valueLabels.append(label);\n        }\n        connect(fxi, SIGNAL(valuesChanged()), this, SLOT(slotValuesChanged()));\n    }\n}\n\nquint32 MonitorFixture::fixture() const\n{\n    return m_fixture;\n}\n\nvoid MonitorFixture::slotChannelStyleChanged(MonitorProperties::ChannelStyle style)\n{\n    QString str;\n    int i = 0;\n\n    m_channelStyle = style;\n\n    \/* Check that this MonitorFixture represents a fixture *\/\n    if (m_fixture == Fixture::invalidId())\n        return;\n\n    Fixture* fxi = m_doc->fixture(m_fixture);\n    Q_ASSERT(fxi != NULL);\n\n    \/* Start channel numbering from this fixture's address *\/\n    if (style == MonitorProperties::DMXChannels)\n        i = fxi->address() + 1;\n    else\n        i = 1;\n\n    QListIterator <QLabel*> it(m_channelLabels);\n    while (it.hasNext() == true)\n        it.next()->setText(str.asprintf(\"<B>%.3d<\/B>\", i++));\n}\n\n\/****************************************************************************\n * Values\n ****************************************************************************\/\n\nvoid MonitorFixture::slotValueStyleChanged(MonitorProperties::ValueStyle style)\n{\n    if (m_valueStyle == style)\n        return;\n\n    m_valueStyle = style;\n\n    QListIterator <QLabel*> it(m_valueLabels);\n    while (it.hasNext() == true)\n    {\n        QLabel* label;\n        QString str;\n        int value;\n\n        label = it.next();\n        Q_ASSERT(label != NULL);\n\n        value = label->text().toInt();\n\n        if (style == MonitorProperties::DMXValues)\n        {\n            value = int(ceil(SCALE(qreal(value),\n                                   qreal(0), qreal(100),\n                                   qreal(0), qreal(UCHAR_MAX))));\n        }\n        else\n        {\n            value = int(ceil(SCALE(qreal(value),\n                                   qreal(0), qreal(UCHAR_MAX),\n                                   qreal(0), qreal(100))));\n        }\n\n        label->setText(str.asprintf(\"%.3d\", value));\n    }\n}\n\nvoid MonitorFixture::slotValuesChanged()\n{\n    \/* Check that this MonitorFixture represents a fixture *\/\n    if (m_fixture == Fixture::invalidId())\n        return;\n\n    \/* Check that this MonitorFixture's fixture really exists *\/\n    Fixture* fxi = m_doc->fixture(m_fixture);\n    if (fxi == NULL)\n        return;\n\n    QByteArray fxValues = fxi->channelValues();\n    int i = 0;\n\n    QListIterator <QLabel*> it(m_valueLabels);\n    while (it.hasNext() == true)\n    {\n        QLabel* label = it.next();\n        Q_ASSERT(label != NULL);\n        QString str;\n\n        \/* Set the label's text to reflect the changed value *\/\n        if (m_valueStyle == MonitorProperties::DMXValues)\n        {\n            label->setText(str.asprintf(\"%.3d\", uchar(fxValues.at(i))));\n        }\n        else\n        {\n            label->setText(str.asprintf(\"%.3d\", int(ceil(SCALE(qreal(uchar(fxValues.at(i))),\n                                                               qreal(0), qreal(UCHAR_MAX),\n                                                               qreal(0), qreal(100))))));\n        }\n        i++;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/IBM_PROLOG_BEGIN_TAG\n\/* \n * Copyright 2003,2016 IBM International Business Machines Corp.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * \thttp:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, 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.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\/\/IBM_PROLOG_END_TAG\n\n\n\n\/\/--------------------------------------------------------------------\n\/\/ Includes\n\/\/--------------------------------------------------------------------\n#include <inttypes.h>\n#include <stdio.h>\n\n#include <ecmdDllCapi.H>\n#include <ecmdStructs.H>\n#include <ecmdReturnCodes.H>\n#include <ecmdDataBuffer.H>\n\n\/\/--------------------------------------------------------------------\n\/\/  Forward References                                                \n\/\/--------------------------------------------------------------------\n\n\/\/--------------------------------------------------------------------\n\/\/  Function Definitions                                               \n\/\/--------------------------------------------------------------------\n\/* For use by dllQueryConfig and dllQueryExist *\/\nuint32_t queryConfigExist(ecmdChipTarget & target, ecmdQueryData & queryData, ecmdQueryDetail_t detail, bool allowDisabled);\n\n\/\/--------------------------------------------------------------------\n\/\/  Function Definitions                                               \n\/\/--------------------------------------------------------------------\n\/\/\n\/\/   These are just stubs, used for testing the out the DLL\n\nuint32_t dllInitDll() {\n  \/* This is where we would init any local variables to the dll *\/\n  return ECMD_SUCCESS;\n}\n\nuint32_t dllFreeDll() {\n  return ECMD_SUCCESS;\n}\n\nuint32_t dllSpecificCommandArgs(int* argc, char** argv[]) {\n  return ECMD_SUCCESS;\n}\n\n\/* Dll Specific Return Codes *\/\nstd::string dllSpecificParseReturnCode(uint32_t i_returnCode) { return \"\"; }\n\nuint32_t dllGetRing (ecmdChipTarget & target, const char * ringName, ecmdDataBuffer & data) { return ECMD_SUCCESS; }\n\nuint32_t dllPutRing (ecmdChipTarget & target, const char * ringName, ecmdDataBuffer & data) { return ECMD_SUCCESS; }\n\nuint32_t dllGetRingSparse(ecmdChipTarget & i_target, const char * i_ringName, ecmdDataBuffer & o_data, ecmdDataBuffer & i_mask, uint32_t i_flags) \n{ \n    return ECMD_SUCCESS; \n} \n\nuint32_t dllPutRingSparse(ecmdChipTarget & i_target, const char * i_ringName, ecmdDataBuffer & i_data, ecmdDataBuffer & i_mask, uint32_t i_flags) \n{ \n    return ECMD_SUCCESS; \n} \n\nuint32_t dllGetRingHidden(ecmdChipTarget & i_target, const char * i_ringName, ecmdDataBuffer & o_data, uint32_t i_mode)\n{ \n    return ECMD_SUCCESS; \n} \n\nuint32_t dllPutRingHidden(ecmdChipTarget & i_target, const char * i_ringName, ecmdDataBuffer & i_data, uint32_t i_mode) \n{ \n    return ECMD_SUCCESS; \n} \n\nuint32_t dllGetScom (ecmdChipTarget & target, uint64_t address, ecmdDataBuffer & data) {\n\n  return ECMD_SUCCESS;\n}\n\nuint32_t dllPutScom (ecmdChipTarget & target, uint64_t address, ecmdDataBuffer & data) { return ECMD_SUCCESS; }\n\n\nuint32_t dllGetArray (ecmdChipTarget & target, const char * arrayName, uint32_t * address, ecmdDataBuffer & data) { return ECMD_SUCCESS; }\n\nuint32_t dllPutArray (ecmdChipTarget & target, const char * arrayName, uint32_t * address, ecmdDataBuffer & data) { return ECMD_SUCCESS; }\n\n\/* ##################################################################### *\/\n\/* Query Functions - Query Functions - Query Functions - Query Functions *\/\n\/* ##################################################################### *\/\nuint32_t dllQueryConfig(ecmdChipTarget & i_target, ecmdQueryData & o_queryData, ecmdQueryDetail_t i_detail ) {\n  return queryConfigExist(i_target, o_queryData, i_detail, false);\n}\n\nuint32_t dllQueryExist(ecmdChipTarget & i_target, ecmdQueryData & o_queryData, ecmdQueryDetail_t i_detail ) {\n  return queryConfigExist(i_target, o_queryData, i_detail, true);\n}\n\nuint32_t queryConfigExist(ecmdChipTarget & target, ecmdQueryData & queryData, ecmdQueryDetail_t detail, bool allowDisabled) {\n  ecmdChipUnitData chipUnitData;\n  ecmdChipData chipData;\n  ecmdNodeData nodeData;\n  ecmdSlotData slotData;\n  ecmdCageData cageData;\n  ecmdThreadData threadData;\n\n  threadData.threadId = 0;\n\n  \/* Let's return some dummy info , we will return a proc with cores and threads *\/\n  chipUnitData.chipUnitType = \"core\";\n  chipUnitData.chipUnitNum = 0;\n  chipUnitData.numThreads = 2;\n  chipUnitData.threadData.push_front(threadData);\n\n  chipData.chipUnitData.push_front(chipUnitData);\n  chipData.chipType = \"pu\";\n  chipData.pos = 0;\n  slotData.chipData.push_front(chipData);\n\n  ecmdChipData cd2;\n  cd2.chipUnitData.clear();\n  cd2.chipType = \"pu\";\n  cd2.pos = 1;\n  slotData.chipData.push_back(cd2);\n\n  cd2.pos = 2;\n  slotData.chipData.push_back(cd2);\n\n  cd2.pos = 3;\n  slotData.chipData.push_back(cd2);\n\n  slotData.slotId = 0;\n\n  nodeData.slotData.push_front(slotData);\n\n  nodeData.nodeId = 0;\n\n  cageData.cageId = 0;\n  cageData.nodeData.push_front(nodeData);\n\n  queryData.cageData.push_front(cageData);\n  \n  return ECMD_SUCCESS;\n} \n\nuint32_t dllQueryRing(ecmdChipTarget & i_target, std::list<ecmdRingData> & o_queryData, const char * i_ringName, ecmdQueryDetail_t i_detail) {\n\n  ecmdRingData ringData;\n\n  ringData.ringNames.push_back(\"ring1\");\n  ringData.address = 0x80000001;\n  ringData.bitLength = 100;\n  ringData.isCheckable = false;\n  ringData.clockState = ECMD_CLOCKSTATE_ON;\n\n  o_queryData.push_back(ringData);\n\n  ringData.ringNames.clear();\n  ringData.ringNames.push_back(\"ring2\");\n  ringData.ringNames.push_back(\"ring2long\");\n  ringData.address = 0x80000002;\n  ringData.bitLength = 2000;\n  ringData.isCheckable = true;\n  ringData.clockState = ECMD_CLOCKSTATE_NA;\n\n  o_queryData.push_back(ringData);\n\n  return ECMD_SUCCESS;\n}\n\nuint32_t dllQueryArray(ecmdChipTarget & target, ecmdArrayData & queryData, const char * arrayName){ return ECMD_SUCCESS; } \n\nuint32_t dllQueryFileLocation(ecmdChipTarget & i_target, ecmdFileType_t i_fileType, std::string & o_fileLocation, std::string & io_version){ return ECMD_SUCCESS; } \n\n\nuint32_t dllFlushSys () { return ECMD_SUCCESS; } \n\nuint32_t dllIplSys () { return ECMD_SUCCESS; }\n\n\nvoid dllOutputError(const char* message) {\n  printf(\"DLLSTUBERROR : %s\\n\",message);\n}\n\nvoid dllOutputWarning(const char* message) {\n  printf(\"DLLSTUBWARNING : %s\\n\",message);\n}\n\nvoid dllOutput(const char* message) {\n  printf(\"%s\", message);\n}\n\nuint32_t dllGetChipData(ecmdChipTarget & i_target, ecmdChipData & o_data) { return ECMD_SUCCESS; }\n\nuint32_t dllEnableRingCache(ecmdChipTarget & i_target) { return ECMD_SUCCESS; }\n\nuint32_t dllDisableRingCache(ecmdChipTarget & i_target) { return ECMD_SUCCESS; }\n\nuint32_t dllFlushRingCache(ecmdChipTarget & i_target) { return ECMD_SUCCESS; }\n\nbool dllIsRingCacheEnabled(ecmdChipTarget & i_target) { return false; }\n\nuint32_t dllGetArray(ecmdChipTarget & i_target, const char * i_arrayName, ecmdDataBuffer & i_address, ecmdDataBuffer & o_data) { return ECMD_SUCCESS; }\n\nuint32_t dllPutArray(ecmdChipTarget & i_target, const char * i_arrayName, ecmdDataBuffer & i_address, ecmdDataBuffer & i_data) { return ECMD_SUCCESS; }\n\n\/* ################################################################# *\/\n\/* Misc Functions - Misc Functions - Misc Functions - Misc Functions *\/\n\/* ################################################################# *\/\nuint32_t dllGetScandefOrder(ecmdChipTarget & i_target, uint32_t & o_mode) {\n  uint32_t rc = ECMD_SUCCESS;\n  ecmdChipData chipData;\n\n  \/* Just get the chip data, we get extra data but this has never been a performance problem for us *\/\n  rc = dllGetChipData(i_target, chipData);\n  if (rc) return rc;\n\n  o_mode = chipData.chipFlags & ECMD_CHIPFLAG_BUSMASK;\n\n  return rc;\n}\n\nvoid dllSetTraceMode(ecmdTraceType_t i_type, bool i_enable) {\n  dllOutputError(\"Not supported: dllSetTraceMode\");\n}\n\nbool dllQueryTraceMode(ecmdTraceType_t i_type) {\n  return false;\n}\n\nuint32_t dllTargetTranslateNormalToFused(ecmdChipTarget & i_target, uint32_t & o_core, uint32_t & o_thread) {\n  uint32_t rc = ECMD_SUCCESS;\n  return rc;\n}\n\n\/* ######################################################################### *\/\n\/* UnitID Functions - UnitID Functions - UnitID Functions - UnitID Functions *\/\n\/* ######################################################################### *\/\n\/* Added to fix symbol errors - JTA 06\/28\/14 *\/\nuint32_t dllTargetToUnitId(ecmdChipTarget & io_target) {\n  uint32_t rc = ECMD_SUCCESS;\n  return rc;\n}\n\nuint32_t dllUnitIdStringToTarget(std::string i_unitId, std::list<ecmdChipTarget> & o_target) {\n  uint32_t rc = ECMD_SUCCESS;\n  return rc;\n}\n\nuint32_t dllUnitIdToTarget(uint32_t i_unitId, std::list<ecmdChipTarget> & o_target) {\n  uint32_t rc = ECMD_SUCCESS;\n  return rc;\n}\n\nuint32_t dllUnitIdToString(uint32_t i_unitId, std::string & o_unitIdStr) {\n  uint32_t rc = ECMD_SUCCESS;\n  return rc;\n}\n\nuint32_t dllSequenceIdToTarget(uint32_t i_core_seq_num, ecmdChipTarget & io_target, uint32_t i_thread_seq_num) {\n  uint32_t rc = ECMD_SUCCESS;\n  return rc;\n}\n\nuint32_t dllTargetToSequenceId(ecmdChipTarget i_target, uint32_t & o_core_seq_num, uint32_t & o_thread_seq_num) {\n  uint32_t rc = ECMD_SUCCESS;\n  return rc;\n}\n\nuint32_t dllGetUnitIdVersion(uint32_t & o_unitIdVersion) {\n  uint32_t rc = ECMD_SUCCESS;\n  return rc;\n}\n<commit_msg>Cleanup of the dllStub code<commit_after>\/\/IBM_PROLOG_BEGIN_TAG\n\/* \n * Copyright 2003,2016 IBM International Business Machines Corp.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * \thttp:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, 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.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\/\/IBM_PROLOG_END_TAG\n\n\n\n\/\/--------------------------------------------------------------------\n\/\/ Includes\n\/\/--------------------------------------------------------------------\n#include <inttypes.h>\n#include <stdio.h>\n\n#include <ecmdDllCapi.H>\n#include <ecmdStructs.H>\n#include <ecmdReturnCodes.H>\n#include <ecmdDataBuffer.H>\n\n\/\/--------------------------------------------------------------------\n\/\/  Forward References                                                \n\/\/--------------------------------------------------------------------\n\n\/\/--------------------------------------------------------------------\n\/\/  Function Definitions                                               \n\/\/--------------------------------------------------------------------\n\/* For use by dllQueryConfig and dllQueryExist *\/\nuint32_t queryConfigExist(ecmdChipTarget & target, ecmdQueryData & queryData, ecmdQueryDetail_t detail, bool allowDisabled);\n\n\/\/--------------------------------------------------------------------\n\/\/  Function Definitions                                               \n\/\/--------------------------------------------------------------------\n\/\/\n\/\/   These are just stubs, used for testing the out the DLL\n\nuint32_t dllInitDll() {\n  \/* This is where we would init any local variables to the dll *\/\n  return ECMD_SUCCESS;\n}\n\nuint32_t dllFreeDll() {\n  return ECMD_SUCCESS;\n}\n\nuint32_t dllSpecificCommandArgs(int* argc, char** argv[]) {\n  return ECMD_SUCCESS;\n}\n\n\/* Dll Specific Return Codes *\/\nstd::string dllSpecificParseReturnCode(uint32_t i_returnCode) {\n  return \"\"; \n}\n\nuint32_t dllGetRing (ecmdChipTarget & target, const char * ringName, ecmdDataBuffer & data) {\n  return ECMD_SUCCESS;\n}\n\nuint32_t dllGetRingSparse(ecmdChipTarget & i_target, const char * i_ringName, ecmdDataBuffer & o_data, ecmdDataBuffer & i_mask, uint32_t i_flags) \n{ \n    return ECMD_SUCCESS; \n} \n\nuint32_t dllPutRingSparse(ecmdChipTarget & i_target, const char * i_ringName, ecmdDataBuffer & i_data, ecmdDataBuffer & i_mask, uint32_t i_flags) \n{ \n    return ECMD_SUCCESS; \n} \n\nuint32_t dllGetRingHidden(ecmdChipTarget & i_target, const char * i_ringName, ecmdDataBuffer & o_data, uint32_t i_mode)\n{ \n    return ECMD_SUCCESS; \n} \n\nuint32_t dllPutRingHidden(ecmdChipTarget & i_target, const char * i_ringName, ecmdDataBuffer & i_data, uint32_t i_mode) \n{ \n    return ECMD_SUCCESS; \n} \n\nuint32_t dllPutRing (ecmdChipTarget & target, const char * ringName, ecmdDataBuffer & data) {\n  return ECMD_SUCCESS;\n}\n\nuint32_t dllGetScom (ecmdChipTarget & target, uint64_t address, ecmdDataBuffer & data) {\n  return ECMD_SUCCESS;\n}\n\nuint32_t dllPutScom (ecmdChipTarget & target, uint64_t address, ecmdDataBuffer & data) {\n  return ECMD_SUCCESS;\n}\n\nuint32_t dllGetArray (ecmdChipTarget & target, const char * arrayName, uint32_t * address, ecmdDataBuffer & data) {\n  return ECMD_SUCCESS;\n}\n\nuint32_t dllPutArray (ecmdChipTarget & target, const char * arrayName, uint32_t * address, ecmdDataBuffer & data) {\n  return ECMD_SUCCESS;\n}\n\n\/* ##################################################################### *\/\n\/* Query Functions - Query Functions - Query Functions - Query Functions *\/\n\/* ##################################################################### *\/\nuint32_t dllQueryConfig(ecmdChipTarget & i_target, ecmdQueryData & o_queryData, ecmdQueryDetail_t i_detail) {\n  return queryConfigExist(i_target, o_queryData, i_detail, false);\n}\n\nuint32_t dllQueryExist(ecmdChipTarget & i_target, ecmdQueryData & o_queryData, ecmdQueryDetail_t i_detail) {\n  return queryConfigExist(i_target, o_queryData, i_detail, true);\n}\n\nuint32_t queryConfigExist(ecmdChipTarget & target, ecmdQueryData & queryData, ecmdQueryDetail_t detail, bool allowDisabled) {\n\n  \/\/ queryConfig is a central function of any eCMD plugin.  The data from this function drives\n  \/\/ the eCMD chip loopers in the cmdline or any other eCMD program.\n  \/\/ This creates a complex set of nested structures that represents all the available targets in a system\n  \/\/ It can be filted down by the state variables of the target passed in\n\n  \/\/ This version for the stub just creates a small set of fake data\n\n  \/\/ The stack of target data variables\n  ecmdThreadData threadData;\n  ecmdChipUnitData chipUnitData;\n  ecmdChipData chipData;\n  ecmdNodeData nodeData;\n  ecmdSlotData slotData;\n  ecmdCageData cageData;\n\n  \/* Let's return some dummy info, we will return a proc with cores and threads *\/\n\n  \/\/ Setup the threadData\n  threadData.threadId = 0;\n\n  \/\/ Setup the chipUnitData\n  chipUnitData.chipUnitType = \"core\";\n  chipUnitData.chipUnitNum = 0;\n  chipUnitData.numThreads = 2;\n  chipUnitData.threadData.push_front(threadData);\n\n  \/\/ Setup the chipData\n  chipData.chipUnitData.push_front(chipUnitData);\n  chipData.chipType = \"pu\";\n  chipData.pos = 0;\n  slotData.chipData.push_front(chipData);\n\n  \/\/ Create positions 1-3 without any chipunit data\n  ecmdChipData cdReplicate;\n  cdReplicate.chipUnitData.clear();\n  cdReplicate.chipType = \"pu\";\n  cdReplicate.pos = 1;\n  slotData.chipData.push_back(cdReplicate);\n\n  cdReplicate.pos = 2;\n  slotData.chipData.push_back(cdReplicate);\n\n  cdReplicate.pos = 3;\n  slotData.chipData.push_back(cdReplicate);\n\n  \/\/ Define slot 0\n  slotData.slotId = 0;\n\n  \/\/ Setup the node\n  nodeData.nodeId = 0;\n  nodeData.slotData.push_front(slotData);\n\n  \/\/ Setup the cage\n  cageData.cageId = 0;\n  cageData.nodeData.push_front(nodeData);\n\n  \/\/ Add it all to the return structs\n  queryData.cageData.push_front(cageData);\n  \n  return ECMD_SUCCESS;\n} \n\nuint32_t dllQueryRing(ecmdChipTarget & i_target, std::list<ecmdRingData> & o_queryData, const char * i_ringName, ecmdQueryDetail_t i_detail) {\n\n  ecmdRingData ringData;\n\n  ringData.ringNames.push_back(\"ring1\");\n  ringData.address = 0x80000001;\n  ringData.bitLength = 100;\n  ringData.isCheckable = false;\n  ringData.clockState = ECMD_CLOCKSTATE_ON;\n\n  o_queryData.push_back(ringData);\n\n  ringData.ringNames.clear();\n  ringData.ringNames.push_back(\"ring2\");\n  ringData.ringNames.push_back(\"ring2long\");\n  ringData.address = 0x80000002;\n  ringData.bitLength = 2000;\n  ringData.isCheckable = true;\n  ringData.clockState = ECMD_CLOCKSTATE_NA;\n\n  o_queryData.push_back(ringData);\n\n  return ECMD_SUCCESS;\n}\n\nuint32_t dllQueryArray(ecmdChipTarget & target, ecmdArrayData & queryData, const char * arrayName) {\n  return ECMD_SUCCESS;\n} \n\nuint32_t dllQueryFileLocation(ecmdChipTarget & i_target, ecmdFileType_t i_fileType, std::string & o_fileLocation, std::string & io_version) {\n  return ECMD_SUCCESS;\n} \n\nuint32_t dllFlushSys () {\n  return ECMD_SUCCESS;\n} \n\nuint32_t dllIplSys () {\n  return ECMD_SUCCESS;\n}\n\nvoid dllOutputError(const char* message) {\n  printf(\"DLLSTUBERROR : %s\\n\",message);\n}\n\nvoid dllOutputWarning(const char* message) {\n  printf(\"DLLSTUBWARNING : %s\\n\",message);\n}\n\nvoid dllOutput(const char* message) {\n  printf(\"%s\", message);\n}\n\nuint32_t dllGetChipData(ecmdChipTarget & i_target, ecmdChipData & o_data) {\n  return ECMD_SUCCESS;\n}\n\nuint32_t dllEnableRingCache(ecmdChipTarget & i_target) {\n  return ECMD_SUCCESS;\n}\n\nuint32_t dllDisableRingCache(ecmdChipTarget & i_target) {\n  return ECMD_SUCCESS;\n}\n\nuint32_t dllFlushRingCache(ecmdChipTarget & i_target) {\n  return ECMD_SUCCESS;\n}\n\nbool dllIsRingCacheEnabled(ecmdChipTarget & i_target) {\n  return false;\n}\n\nuint32_t dllGetArray(ecmdChipTarget & i_target, const char * i_arrayName, ecmdDataBuffer & i_address, ecmdDataBuffer & o_data) {\n  return ECMD_SUCCESS;\n}\n\nuint32_t dllPutArray(ecmdChipTarget & i_target, const char * i_arrayName, ecmdDataBuffer & i_address, ecmdDataBuffer & i_data) {\n  return ECMD_SUCCESS;\n}\n\n\/* ################################################################# *\/\n\/* Misc Functions - Misc Functions - Misc Functions - Misc Functions *\/\n\/* ################################################################# *\/\nuint32_t dllGetScandefOrder(ecmdChipTarget & i_target, uint32_t & o_mode) {\n  uint32_t rc = ECMD_SUCCESS;\n  ecmdChipData chipData;\n\n  \/* Just get the chip data, we get extra data but this has never been a performance problem for us *\/\n  rc = dllGetChipData(i_target, chipData);\n  if (rc) return rc;\n\n  o_mode = chipData.chipFlags & ECMD_CHIPFLAG_BUSMASK;\n\n  return rc;\n}\n\nvoid dllSetTraceMode(ecmdTraceType_t i_type, bool i_enable) {\n  dllOutputError(\"Not supported: dllSetTraceMode\");\n}\n\nbool dllQueryTraceMode(ecmdTraceType_t i_type) {\n  return false;\n}\n\nuint32_t dllTargetTranslateNormalToFused(ecmdChipTarget & i_target, uint32_t & o_core, uint32_t & o_thread) {\n  uint32_t rc = ECMD_SUCCESS;\n  return rc;\n}\n\n\/* ######################################################################### *\/\n\/* UnitID Functions - UnitID Functions - UnitID Functions - UnitID Functions *\/\n\/* ######################################################################### *\/\n\/* Added to fix symbol errors - JTA 06\/28\/14 *\/\nuint32_t dllTargetToUnitId(ecmdChipTarget & io_target) {\n  uint32_t rc = ECMD_SUCCESS;\n  return rc;\n}\n\nuint32_t dllUnitIdStringToTarget(std::string i_unitId, std::list<ecmdChipTarget> & o_target) {\n  uint32_t rc = ECMD_SUCCESS;\n  return rc;\n}\n\nuint32_t dllUnitIdToTarget(uint32_t i_unitId, std::list<ecmdChipTarget> & o_target) {\n  uint32_t rc = ECMD_SUCCESS;\n  return rc;\n}\n\nuint32_t dllUnitIdToString(uint32_t i_unitId, std::string & o_unitIdStr) {\n  uint32_t rc = ECMD_SUCCESS;\n  return rc;\n}\n\nuint32_t dllSequenceIdToTarget(uint32_t i_core_seq_num, ecmdChipTarget & io_target, uint32_t i_thread_seq_num) {\n  uint32_t rc = ECMD_SUCCESS;\n  return rc;\n}\n\nuint32_t dllTargetToSequenceId(ecmdChipTarget i_target, uint32_t & o_core_seq_num, uint32_t & o_thread_seq_num) {\n  uint32_t rc = ECMD_SUCCESS;\n  return rc;\n}\n\nuint32_t dllGetUnitIdVersion(uint32_t & o_unitIdVersion) {\n  uint32_t rc = ECMD_SUCCESS;\n  return rc;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"utils\/blacklist-fix\/blacklist-fix-2.h\"\n#include <QFile>\n#include <ui_blacklist-fix-2.h>\n#include \"loader\/token.h\"\n#include \"models\/filtering\/post-filter.h\"\n\n\nBlacklistFix2::BlacklistFix2(QList<QMap<QString, QString>> details, Blacklist blacklist, QWidget *parent)\n\t: QDialog(parent), ui(new Ui::BlacklistFix2), m_details(std::move(details)), m_blacklist(std::move(blacklist))\n{\n\tui->setupUi(this);\n\n\tui->tableWidget->setRowCount(m_details.size());\n\tm_previews.reserve(m_details.count());\n\tfor (int i = 0; i < m_details.size(); i++) {\n\t\tQStringList found;\n\t\tQString color = \"blue\";\n\t\tif (m_details[i].contains(\"tags\")) {\n\t\t\tQMap<QString, Token> tokens;\n\t\t\ttokens.insert(\"allos\", Token(m_details[i][\"tags\"].split(' ')));\n\t\t\tfound = m_blacklist.match(tokens);\n\t\t\tcolor = found.empty() ? \"green\" : \"red\";\n\t\t}\n\t\tQTableWidgetItem *id = new QTableWidgetItem(QString::number(i + 1));\n\t\tid->setIcon(QIcon(\":\/images\/colors\/\" + color + \".png\"));\n\t\tui->tableWidget->setItem(i, 0, id);\n\t\tQLabel *preview = new QLabel();\n\t\tpreview->setPixmap(QPixmap(m_details.at(i).value(\"path_full\")).scaledToHeight(50, Qt::SmoothTransformation));\n\t\tm_previews.append(preview);\n\t\tui->tableWidget->setCellWidget(i, 1, preview);\n\t\tui->tableWidget->setItem(i, 2, new QTableWidgetItem(m_details.at(i).value(\"path\")));\n\t\tui->tableWidget->setItem(i, 3, new QTableWidgetItem(found.join(\" \")));\n\t\tui->tableWidget->resizeColumnToContents(0);\n\t}\n\tQHeaderView *headerView = ui->tableWidget->horizontalHeader();\n\theaderView->setSectionResizeMode(QHeaderView::Interactive);\n\theaderView->resizeSection(1, 50);\n\theaderView->setSectionResizeMode(2, QHeaderView::Stretch);\n}\nBlacklistFix2::~BlacklistFix2()\n{\n\tdelete ui;\n}\n\nvoid BlacklistFix2::on_buttonSelectBlacklisted_clicked()\n{\n\tfor (int i = 0; i < ui->tableWidget->rowCount(); i++) {\n\t\tif (!ui->tableWidget->item(i, 3)->text().isEmpty()) {\n\t\t\tui->tableWidget->selectRow(i);\n\t\t}\n\t}\n}\nvoid BlacklistFix2::on_buttonCancel_clicked()\n{\n\temit rejected();\n\tclose();\n}\nvoid BlacklistFix2::on_buttonOk_clicked()\n{\n\t\/\/ Delete selected images\n\tQList<QTableWidgetItem *> selected = ui->tableWidget->selectedItems();\n\tconst int count = selected.size();\n\tQSet<int> toDelete = QSet<int>();\n\tfor (int i = 0; i < count; i++) {\n\t\ttoDelete.insert(selected.at(i)->row());\n\t}\n\tint rem = 0;\n\tfor (int i : toDelete) {\n\t\tQFile::remove(m_details.at(ui->tableWidget->item(i - rem, 0)->text().toInt() - 1).value(\"path_full\"));\n\t\tui->tableWidget->removeRow(i - rem);\n\t\trem++;\n\t}\n\n\t\/\/ Close\n\temit accepted();\n\tclose();\n}\n<commit_msg>Fix crash when deleting images in blacklist fixer (fix #1684)<commit_after>#include \"utils\/blacklist-fix\/blacklist-fix-2.h\"\n#include <QFile>\n#include <ui_blacklist-fix-2.h>\n#include \"loader\/token.h\"\n#include \"models\/filtering\/post-filter.h\"\n#include \"helpers.h\"\n\n\nBlacklistFix2::BlacklistFix2(QList<QMap<QString, QString>> details, Blacklist blacklist, QWidget *parent)\n\t: QDialog(parent), ui(new Ui::BlacklistFix2), m_details(std::move(details)), m_blacklist(std::move(blacklist))\n{\n\tui->setupUi(this);\n\n\tui->tableWidget->setRowCount(m_details.size());\n\tm_previews.reserve(m_details.count());\n\tfor (int i = 0; i < m_details.size(); i++) {\n\t\tQStringList found;\n\t\tQString color = \"blue\";\n\t\tif (m_details[i].contains(\"tags\")) {\n\t\t\tQMap<QString, Token> tokens;\n\t\t\ttokens.insert(\"allos\", Token(m_details[i][\"tags\"].split(' ')));\n\t\t\tfound = m_blacklist.match(tokens);\n\t\t\tcolor = found.empty() ? \"green\" : \"red\";\n\t\t}\n\t\tQTableWidgetItem *id = new QTableWidgetItem(QString::number(i + 1));\n\t\tid->setIcon(QIcon(\":\/images\/colors\/\" + color + \".png\"));\n\t\tui->tableWidget->setItem(i, 0, id);\n\t\tQLabel *preview = new QLabel();\n\t\tpreview->setPixmap(QPixmap(m_details.at(i).value(\"path_full\")).scaledToHeight(50, Qt::SmoothTransformation));\n\t\tm_previews.append(preview);\n\t\tui->tableWidget->setCellWidget(i, 1, preview);\n\t\tui->tableWidget->setItem(i, 2, new QTableWidgetItem(m_details.at(i).value(\"path\")));\n\t\tui->tableWidget->setItem(i, 3, new QTableWidgetItem(found.join(\" \")));\n\t\tui->tableWidget->resizeColumnToContents(0);\n\t}\n\tQHeaderView *headerView = ui->tableWidget->horizontalHeader();\n\theaderView->setSectionResizeMode(QHeaderView::Interactive);\n\theaderView->resizeSection(1, 50);\n\theaderView->setSectionResizeMode(2, QHeaderView::Stretch);\n}\nBlacklistFix2::~BlacklistFix2()\n{\n\tdelete ui;\n}\n\nvoid BlacklistFix2::on_buttonSelectBlacklisted_clicked()\n{\n\tfor (int i = 0; i < ui->tableWidget->rowCount(); i++) {\n\t\tif (!ui->tableWidget->item(i, 3)->text().isEmpty()) {\n\t\t\tui->tableWidget->selectRow(i);\n\t\t}\n\t}\n}\nvoid BlacklistFix2::on_buttonCancel_clicked()\n{\n\temit rejected();\n\tclose();\n}\nvoid BlacklistFix2::on_buttonOk_clicked()\n{\n\t\/\/ Delete selected images\n\tQList<QTableWidgetItem *> selected = ui->tableWidget->selectedItems();\n\tif (selected.isEmpty()) {\n\t\terror(this, \"You didn't select any image do delete.\");\n\t\treturn;\n\t}\n\n\t\/\/ List all rows to be deleted\n\tQList<int> rows;\n\tfor (QTableWidgetItem *item : selected) {\n\t\tint row = item->row();\n\t\tif (!rows.contains(row)) {\n\t\t\trows.append(row);\n\t\t}\n\t}\n\n\t\/\/ Sort in ascending order to help the following foreach with deletion\n\tstd::sort(rows.begin(), rows.end());\n\n\t\/\/ Delete files and their associated rows\n\tint rem = 0;\n\tfor (int i : qAsConst(rows)) {\n\t\tint pos = i - rem;\n\t\tQFile::remove(m_details.at(ui->tableWidget->item(pos, 0)->text().toInt() - 1).value(\"path_full\"));\n\t\tui->tableWidget->removeRow(pos);\n\t\trem++;\n\t}\n\n\t\/\/ Close\n\temit accepted();\n\tclose();\n}\n<|endoftext|>"}
{"text":"<commit_before>\n\/\/ Copyright (c) 2012, 2013 Pierre MOULON.\n\n\/\/ This Source Code Form is subject to the terms of the Mozilla Public\n\/\/ License, v. 2.0. If a copy of the MPL was not distributed with this\n\/\/ file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#ifndef OPENMVG_ROBUST_ESTIMATOR_ACRANSAC_KERNEL_ADAPTATOR_H_\n#define OPENMVG_ROBUST_ESTIMATOR_ACRANSAC_KERNEL_ADAPTATOR_H_\n\n\/\/ Here a collection of A contrario Kernel adaptor.\n\/\/  - See \/\/ [1] \"Robust and accurate calibration of camera networks\". PhD.\n\/\/  - Authors: Pierre MOULON\n\/\/\n\/\/ACKernelAdaptor\n\/\/  i.e. general two view estimation (affine, homography, fundamental)\n\/\/ACKernelAdaptorResection\n\/\/  For pose\/resection estimation\n\/\/ACKernelAdaptorResection_K\n\/\/  For pose\/resection with known camera intrinsic\n\/\/ACKernelAdaptorEssential\n\/\/  For essential matrix estimation\n\/\/ACKernelAdaptor_AngularRadianError\n\/\/  i.e. essential matrix estimation between spherical camera\n\/\/\n\/\/ Mainly it add correct data normalization and define the function required\n\/\/  by the generic ACRANSAC routine.\n\/\/\n\nnamespace openMVG {\nnamespace robust{\n\n\/\/\/ Two view Kernel adapter for the A contrario model estimator\n\/\/\/ Handle data normalization and compute the corresponding logalpha 0\n\/\/\/  that depends of the error model (point to line, or point to point)\n\/\/\/ This kernel adapter is working for affine, homography, fundamental matrix\n\/\/\/  estimation.\ntemplate <typename SolverArg,\n          typename ErrorArg,\n          typename UnnormalizerArg,\n          typename ModelArg = Mat3>\nclass ACKernelAdaptor\n{\npublic:\n  typedef SolverArg Solver;\n  typedef ModelArg  Model;\n  typedef ErrorArg ErrorT;\n\n  ACKernelAdaptor(\n    const Mat &x1, int w1, int h1,\n    const Mat &x2, int w2, int h2, bool bPointToLine = true)\n    : x1_(x1.rows(), x1.cols()), x2_(x2.rows(), x2.cols()),\n    N1_(3,3), N2_(3,3), logalpha0_(0.0), bPointToLine_(bPointToLine)\n  {\n    assert(2 == x1_.rows());\n    assert(x1_.rows() == x2_.rows());\n    assert(x1_.cols() == x2_.cols());\n\n    NormalizePoints(x1, &x1_, &N1_, w1, h1);\n    NormalizePoints(x2, &x2_, &N2_, w2, h2);\n\n    \/\/ LogAlpha0 is used to make error data scale invariant\n    if(bPointToLine)  {\n      \/\/ Ratio of containing diagonal image rectangle over image area\n      double D = sqrt(w2*(double)w2 + h2*(double)h2); \/\/ diameter\n      double A = w2*(double)h2; \/\/ area\n      logalpha0_ = log10(2.0*D\/A \/N2_(0,0));\n    }\n    else  {\n      \/\/ ratio of area : unit circle over image area\n      logalpha0_ = log10(M_PI\/(w2*(double)h2) \/(N2_(0,0)*N2_(0,0)));\n    }\n  }\n\n  enum { MINIMUM_SAMPLES = Solver::MINIMUM_SAMPLES };\n  enum { MAX_MODELS = Solver::MAX_MODELS };\n\n  void Fit(const std::vector<size_t> &samples, std::vector<Model> *models) const {\n    const Mat x1 = ExtractColumns(x1_, samples);\n    const Mat x2 = ExtractColumns(x2_, samples);\n    Solver::Solve(x1, x2, models);\n  }\n\n  double Error(size_t sample, const Model &model) const {\n    return ErrorT::Error(model, x1_.col(sample), x2_.col(sample));\n  }\n\n  void Errors(const Model & model, std::vector<double> & vec_errors) const\n  {\n    vec_errors.resize(x1_.cols());\n    for (size_t sample = 0; sample < x1_.cols(); ++sample)\n      vec_errors[sample] = ErrorT::Error(model, x1_.col(sample), x2_.col(sample));\n  }\n\n  size_t NumSamples() const {\n    return static_cast<size_t>(x1_.cols());\n  }\n\n  void Unnormalize(Model * model) const {\n    \/\/ Unnormalize model from the computed conditioning.\n    UnnormalizerArg::Unnormalize(N1_, N2_, &(*model));\n  }\n\n  double logalpha0() const {return logalpha0_;}\n\n  double multError() const {return (bPointToLine_)? 0.5 : 1.0;}\n\n  Mat3 normalizer1() const {return N1_;}\n  Mat3 normalizer2() const {return N2_;}\n  double unormalizeError(double val) const {return sqrt(val) \/ N2_(0,0);}\n\nprivate:\n  Mat x1_, x2_;       \/\/ Normalized input data\n  Mat3 N1_, N2_;      \/\/ Matrix used to normalize data\n  double logalpha0_; \/\/ Alpha0 is used to make the error adaptive to the image size\n  bool bPointToLine_;\/\/ Store if error model is pointToLine or point to point\n};\n\nstruct UnnormalizerResection {\n  static void Unnormalize(const Mat &T, const Mat &U, Mat34 *P){\n    *P = T.inverse() * (*P);\n  }\n};\n\n\/\/\/ Pose\/Resection Kernel adapter for the A contrario model estimator\ntemplate <typename SolverArg,\n  typename ErrorArg,\n  typename UnnormalizerArg,\n  typename ModelArg = Mat34>\nclass ACKernelAdaptorResection\n{\npublic:\n  typedef SolverArg Solver;\n  typedef ModelArg  Model;\n  typedef ErrorArg ErrorT;\n\n  ACKernelAdaptorResection(const Mat &x2d, int w, int h, const Mat &x3D)\n    : x2d_(x2d.rows(), x2d.cols()), x3D_(x3D),\n    N1_(3,3), logalpha0_(log10(M_PI))\n  {\n    assert(2 == x2d_.rows());\n    assert(3 == x3D_.rows());\n    assert(x2d_.cols() == x3D_.cols());\n\n    NormalizePoints(x2d, &x2d_, &N1_, w, h);\n  }\n\n  enum { MINIMUM_SAMPLES = Solver::MINIMUM_SAMPLES };\n  enum { MAX_MODELS = Solver::MAX_MODELS };\n\n  void Fit(const std::vector<size_t> &samples, std::vector<Model> *models) const {\n    const Mat x1 = ExtractColumns(x2d_, samples);\n    const Mat x2 = ExtractColumns(x3D_, samples);\n    Solver::Solve(x1, x2, models);\n  }\n\n  double Error(int sample, const Model &model) const {\n    return ErrorT::Error(model, x2d_.col(sample), x3D_.col(sample));\n  }\n\n  void Errors(const Model & model, std::vector<double> & vec_errors) const\n  {\n    vec_errors.resize(x2d_.cols());\n    for (size_t sample = 0; sample < x2d_.cols(); ++sample)\n      vec_errors[sample] = ErrorT::Error(model, x2d_.col(sample), x3D_.col(sample));\n  }\n\n  size_t NumSamples() const { return x2d_.cols(); }\n\n  void Unnormalize(Model * model) const {\n    \/\/ Unnormalize model from the computed conditioning.\n    UnnormalizerArg::Unnormalize(N1_, Mat3::Identity(), &(*model));\n  }\n\n  double logalpha0() const {return logalpha0_;}\n  double multError() const {return 1.0;} \/\/ point to point error\n  Mat3 normalizer1() const {return Mat3::Identity();}\n  Mat3 normalizer2() const {return N1_;}\n  double unormalizeError(double val) const {return sqrt(val) \/ N1_(0,0);}\n\nprivate:\n  Mat x2d_, x3D_;\n  Mat3 N1_;      \/\/ Matrix used to normalize data\n  double logalpha0_; \/\/ Alpha0 is used to make the error adaptive to the image size\n};\n\n\/\/\/ Pose\/Resection Kernel adapter for the A contrario model estimator with\n\/\/\/  known Intrinsic\ntemplate <typename SolverArg,\n  typename ErrorArg,\n  typename UnnormalizerArg,\n  typename ModelArg = Mat34>\nclass ACKernelAdaptorResection_K\n{\npublic:\n  typedef SolverArg Solver;\n  typedef ModelArg  Model;\n  typedef ErrorArg ErrorT;\n\n  ACKernelAdaptorResection_K(const Mat &x2d, const Mat &x3D, const Mat3 & K)\n    : x2d_(x2d.rows(), x2d.cols()), x3D_(x3D),\n    N1_(K.inverse()),\n    logalpha0_(log10(M_PI)), K_(K)\n  {\n    assert(2 == x2d_.rows());\n    assert(3 == x3D_.rows());\n    assert(x2d_.cols() == x3D_.cols());\n\n    \/\/ Normalize points by inverse(K)\n    ApplyTransformationToPoints(x2d, N1_, &x2d_);\n  }\n\n  enum { MINIMUM_SAMPLES = Solver::MINIMUM_SAMPLES };\n  enum { MAX_MODELS = Solver::MAX_MODELS };\n\n  void Fit(const std::vector<size_t> &samples, std::vector<Model> *models) const {\n    const Mat x1 = ExtractColumns(x2d_, samples);\n    const Mat x2 = ExtractColumns(x3D_, samples);\n    Solver::Solve(x1, x2, models);\n  }\n\n  double Error(size_t sample, const Model &model) const {\n    return ErrorT::Error(model, x2d_.col(sample), x3D_.col(sample));\n  }\n\n  void Errors(const Model & model, std::vector<double> & vec_errors) const\n  {\n    vec_errors.resize(x2d_.cols());\n    for (size_t sample = 0; sample < x2d_.cols(); ++sample)\n      vec_errors[sample] = ErrorT::Error(model, x2d_.col(sample), x3D_.col(sample));\n  }\n\n  size_t NumSamples() const { return x2d_.cols(); }\n\n  void Unnormalize(Model * model) const {\n    \/\/ Unnormalize model from the computed conditioning.\n    (*model) = K_ * (*model);\n  }\n\n  double logalpha0() const {return logalpha0_;}\n  double multError() const {return 1.0;} \/\/ point to point error\n  Mat3 normalizer1() const {return Mat3::Identity();}\n  Mat3 normalizer2() const {return N1_;}\n  double unormalizeError(double val) const {return sqrt(val) \/ N1_(0,0);}\n\nprivate:\n  Mat x2d_, x3D_;\n  Mat3 N1_;      \/\/ Matrix used to normalize data\n  double logalpha0_; \/\/ Alpha0 is used to make the error adaptive to the image size\n  Mat3 K_;            \/\/ Intrinsic camera parameter\n};\n\n\/\/\/ Essential matrix Kernel adaptor for the A contrario model estimator\ntemplate <typename SolverArg,\n  typename ErrorArg,\n  typename UnnormalizerArg,\n  typename ModelArg = Mat3>\nclass ACKernelAdaptorEssential\n{\npublic:\n  typedef SolverArg Solver;\n  typedef ModelArg  Model;\n  typedef ErrorArg ErrorT;\n\n  ACKernelAdaptorEssential(\n    const Mat &x1, int w1, int h1,\n    const Mat &x2, int w2, int h2,\n    const Mat3 & K1, const Mat3 & K2)\n    : x1_(x1), x3D_(x2),\n    N1_(Mat3::Identity()), N2_(Mat3::Identity()), logalpha0_(0.0),\n    K1_(K1), K2_(K2)\n{\n    assert(2 == x1_.rows());\n    assert(x1_.rows() == x3D_.rows());\n    assert(x1_.cols() == x3D_.cols());\n\n    ApplyTransformationToPoints(x1_, K1_.inverse(), &x1k_);\n    ApplyTransformationToPoints(x3D_, K2_.inverse(), &x2k_);\n\n    \/\/Point to line probability (line is the epipolar line)\n    double D = sqrt(w2*(double)w2 + h2*(double)h2); \/\/ diameter\n    double A = w2*(double)h2; \/\/ area\n    logalpha0_ = log10(2.0*D\/A * .5);\n  }\n\n  enum { MINIMUM_SAMPLES = Solver::MINIMUM_SAMPLES };\n  enum { MAX_MODELS = Solver::MAX_MODELS };\n\n  void Fit(const std::vector<size_t> &samples, std::vector<Model> *models) const {\n    const Mat x1 = ExtractColumns(x1k_, samples);\n    const Mat x2 = ExtractColumns(x2k_, samples);\n    Solver::Solve(x1, x2, models);\n  }\n\n  double Error(size_t sample, const Model &model) const {\n    Mat3 F;\n    FundamentalFromEssential(model, K1_, K2_, &F);\n    return ErrorT::Error(F, this->x1_.col(sample), this->x3D_.col(sample));\n  }\n\n  void Errors(const Model & model, std::vector<double> & vec_errors) const\n  {\n    Mat3 F;\n    FundamentalFromEssential(model, K1_, K2_, &F);\n    vec_errors.resize(x1_.cols());\n    for (size_t sample = 0; sample < x1_.cols(); ++sample)\n      vec_errors[sample] = ErrorT::Error(F, this->x1_.col(sample), this->x3D_.col(sample));\n  }\n\n  size_t NumSamples() const { return x1_.cols(); }\n  void Unnormalize(Model * model) const {}\n  double logalpha0() const {return logalpha0_;}\n  double multError() const {return 0.5;} \/\/ point to line error\n  Mat3 normalizer1() const {return N1_;}\n  Mat3 normalizer2() const {return N2_;}\n  double unormalizeError(double val) const { return val; }\n\nprivate:\n  Mat x1_, x3D_, x1k_, x2k_; \/\/ image point and camera plane point.\n  Mat3 N1_, N2_;      \/\/ Matrix used to normalize data\n  double logalpha0_; \/\/ Alpha0 is used to make the error adaptive to the image size\n  Mat3 K1_, K2_;      \/\/ Intrinsic camera parameter\n};\n\n\/\/\/ Two view Kernel adapter for the A contrario model estimator.\n\/\/\/ Specialization to handle radian angular residual error.\ntemplate <typename SolverArg,\n          typename ErrorArg,\n          typename UnnormalizerArg,\n          typename ModelArg = Mat3>\nclass ACKernelAdaptor_AngularRadianError\n{\npublic:\n  typedef SolverArg Solver;\n  typedef ModelArg  Model;\n  typedef ErrorArg ErrorT;\n\n  ACKernelAdaptor_AngularRadianError(\n    const Mat & xA,\n    const Mat & xB):\n    x1_(xA), x2_(xB),\n    logalpha0_(log10(1.0\/2.0))\n  {\n    assert(3 == x1_.rows());\n    assert(x1_.rows() == x2_.rows());\n    assert(x1_.cols() == x2_.cols());\n  }\n\n  enum { MINIMUM_SAMPLES = Solver::MINIMUM_SAMPLES };\n  enum { MAX_MODELS = Solver::MAX_MODELS };\n\n  void Fit(const std::vector<size_t> &samples, std::vector<Model> *models) const {\n    const Mat x1 = ExtractColumns(x1_, samples);\n    const Mat x2 = ExtractColumns(x2_, samples);\n    Solver::Solve(x1, x2, models);\n  }\n\n  double Error(size_t sample, const Model &model) const {\n    return Square(ErrorT::Error(model, x1_.col(sample), x2_.col(sample)));\n  }\n\n  void Errors(const Model & model, std::vector<double> & vec_errors) const\n  {\n    vec_errors.resize(x1_.cols());\n    for (size_t sample = 0; sample < x1_.cols(); ++sample)\n      vec_errors[sample] = Square(ErrorT::Error(model, x1_.col(sample), x2_.col(sample)));\n  }\n\n  size_t NumSamples() const {\n    return static_cast<size_t>(x1_.cols());\n  }\n\n  void Unnormalize(Model * model) const {\n    \/\/-- Do nothing, no normalization in the angular case\n  }\n\n  double logalpha0() const {return logalpha0_;}\n\n  double multError() const {return 1.\/4.;}\n\n  Mat3 normalizer1() const {return Mat3::Identity();}\n  Mat3 normalizer2() const {return Mat3::Identity();}\n  double unormalizeError(double val) const {return sqrt(val);}\n\nprivate:\n  Mat x1_, x2_;       \/\/ Normalized input data\n  double logalpha0_; \/\/ Alpha0 is used to make the error scale invariant\n};\n\n} \/\/ namespace robust\n} \/\/ namespace openMVG\n#endif \/\/ OPENMVG_ROBUST_ESTIMATOR_ACRANSAC_KERNEL_ADAPTATOR_H_\n<commit_msg>cosmetic<commit_after>\n\/\/ Copyright (c) 2012, 2013 Pierre MOULON.\n\n\/\/ This Source Code Form is subject to the terms of the Mozilla Public\n\/\/ License, v. 2.0. If a copy of the MPL was not distributed with this\n\/\/ file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#ifndef OPENMVG_ROBUST_ESTIMATOR_ACRANSAC_KERNEL_ADAPTATOR_H_\n#define OPENMVG_ROBUST_ESTIMATOR_ACRANSAC_KERNEL_ADAPTATOR_H_\n\n\/\/ Here a collection of A contrario Kernel adaptor.\n\/\/  - See \/\/ [1] \"Robust and accurate calibration of camera networks\". PhD.\n\/\/  - Authors: Pierre MOULON\n\/\/\n\/\/ACKernelAdaptor\n\/\/  i.e. general two view estimation (affine, homography, fundamental)\n\/\/ACKernelAdaptorResection\n\/\/  For pose\/resection estimation\n\/\/ACKernelAdaptorResection_K\n\/\/  For pose\/resection with known camera intrinsic\n\/\/ACKernelAdaptorEssential\n\/\/  For essential matrix estimation\n\/\/ACKernelAdaptor_AngularRadianError\n\/\/  i.e. essential matrix estimation between spherical camera\n\/\/\n\/\/ Mainly it add correct data normalization and define the function required\n\/\/  by the generic ACRANSAC routine.\n\/\/\n\nnamespace openMVG {\nnamespace robust{\n\n\/\/\/ Two view Kernel adapter for the A contrario model estimator\n\/\/\/ Handle data normalization and compute the corresponding logalpha 0\n\/\/\/  that depends of the error model (point to line, or point to point)\n\/\/\/ This kernel adapter is working for affine, homography, fundamental matrix\n\/\/\/  estimation.\ntemplate <typename SolverArg,\n          typename ErrorArg,\n          typename UnnormalizerArg,\n          typename ModelArg = Mat3>\nclass ACKernelAdaptor\n{\npublic:\n  typedef SolverArg Solver;\n  typedef ModelArg  Model;\n  typedef ErrorArg ErrorT;\n\n  ACKernelAdaptor(\n    const Mat &x1, int w1, int h1,\n    const Mat &x2, int w2, int h2, bool bPointToLine = true)\n    : x1_(x1.rows(), x1.cols()), x2_(x2.rows(), x2.cols()),\n    N1_(3,3), N2_(3,3), logalpha0_(0.0), bPointToLine_(bPointToLine)\n  {\n    assert(2 == x1_.rows());\n    assert(x1_.rows() == x2_.rows());\n    assert(x1_.cols() == x2_.cols());\n\n    NormalizePoints(x1, &x1_, &N1_, w1, h1);\n    NormalizePoints(x2, &x2_, &N2_, w2, h2);\n\n    \/\/ LogAlpha0 is used to make error data scale invariant\n    if(bPointToLine)  {\n      \/\/ Ratio of containing diagonal image rectangle over image area\n      double D = sqrt(w2*(double)w2 + h2*(double)h2); \/\/ diameter\n      double A = w2*(double)h2; \/\/ area\n      logalpha0_ = log10(2.0*D\/A \/N2_(0,0));\n    }\n    else  {\n      \/\/ ratio of area : unit circle over image area\n      logalpha0_ = log10(M_PI\/(w2*(double)h2) \/(N2_(0,0)*N2_(0,0)));\n    }\n  }\n\n  enum { MINIMUM_SAMPLES = Solver::MINIMUM_SAMPLES };\n  enum { MAX_MODELS = Solver::MAX_MODELS };\n\n  void Fit(const std::vector<size_t> &samples, std::vector<Model> *models) const {\n    const Mat x1 = ExtractColumns(x1_, samples);\n    const Mat x2 = ExtractColumns(x2_, samples);\n    Solver::Solve(x1, x2, models);\n  }\n\n  double Error(size_t sample, const Model &model) const {\n    return ErrorT::Error(model, x1_.col(sample), x2_.col(sample));\n  }\n\n  void Errors(const Model & model, std::vector<double> & vec_errors) const\n  {\n    vec_errors.resize(x1_.cols());\n    for (size_t sample = 0; sample < x1_.cols(); ++sample)\n      vec_errors[sample] = ErrorT::Error(model, x1_.col(sample), x2_.col(sample));\n  }\n\n  size_t NumSamples() const {\n    return static_cast<size_t>(x1_.cols());\n  }\n\n  void Unnormalize(Model * model) const {\n    \/\/ Unnormalize model from the computed conditioning.\n    UnnormalizerArg::Unnormalize(N1_, N2_, &(*model));\n  }\n\n  double logalpha0() const {return logalpha0_;}\n\n  double multError() const {return (bPointToLine_)? 0.5 : 1.0;}\n\n  Mat3 normalizer1() const {return N1_;}\n  Mat3 normalizer2() const {return N2_;}\n  double unormalizeError(double val) const {return sqrt(val) \/ N2_(0,0);}\n\nprivate:\n  Mat x1_, x2_;       \/\/ Normalized input data\n  Mat3 N1_, N2_;      \/\/ Matrix used to normalize data\n  double logalpha0_; \/\/ Alpha0 is used to make the error adaptive to the image size\n  bool bPointToLine_;\/\/ Store if error model is pointToLine or point to point\n};\n\nstruct UnnormalizerResection {\n  static void Unnormalize(const Mat &T, const Mat &U, Mat34 *P){\n    *P = T.inverse() * (*P);\n  }\n};\n\n\/\/\/ Pose\/Resection Kernel adapter for the A contrario model estimator\ntemplate <typename SolverArg,\n  typename ErrorArg,\n  typename UnnormalizerArg,\n  typename ModelArg = Mat34>\nclass ACKernelAdaptorResection\n{\npublic:\n  typedef SolverArg Solver;\n  typedef ModelArg  Model;\n  typedef ErrorArg ErrorT;\n\n  ACKernelAdaptorResection(const Mat &x2d, int w, int h, const Mat &x3D)\n    : x2d_(x2d.rows(), x2d.cols()), x3D_(x3D),\n    N1_(3,3), logalpha0_(log10(M_PI))\n  {\n    assert(2 == x2d_.rows());\n    assert(3 == x3D_.rows());\n    assert(x2d_.cols() == x3D_.cols());\n\n    NormalizePoints(x2d, &x2d_, &N1_, w, h);\n  }\n\n  enum { MINIMUM_SAMPLES = Solver::MINIMUM_SAMPLES };\n  enum { MAX_MODELS = Solver::MAX_MODELS };\n\n  void Fit(const std::vector<size_t> &samples, std::vector<Model> *models) const {\n    const Mat x1 = ExtractColumns(x2d_, samples);\n    const Mat x2 = ExtractColumns(x3D_, samples);\n    Solver::Solve(x1, x2, models);\n  }\n\n  double Error(int sample, const Model &model) const {\n    return ErrorT::Error(model, x2d_.col(sample), x3D_.col(sample));\n  }\n\n  void Errors(const Model & model, std::vector<double> & vec_errors) const\n  {\n    vec_errors.resize(x2d_.cols());\n    for (size_t sample = 0; sample < x2d_.cols(); ++sample)\n      vec_errors[sample] = ErrorT::Error(model, x2d_.col(sample), x3D_.col(sample));\n  }\n\n  size_t NumSamples() const { return x2d_.cols(); }\n\n  void Unnormalize(Model * model) const {\n    \/\/ Unnormalize model from the computed conditioning.\n    UnnormalizerArg::Unnormalize(N1_, Mat3::Identity(), &(*model));\n  }\n\n  double logalpha0() const {return logalpha0_;}\n  double multError() const {return 1.0;} \/\/ point to point error\n  Mat3 normalizer1() const {return Mat3::Identity();}\n  Mat3 normalizer2() const {return N1_;}\n  double unormalizeError(double val) const {return sqrt(val) \/ N1_(0,0);}\n\nprivate:\n  Mat x2d_, x3D_;\n  Mat3 N1_;      \/\/ Matrix used to normalize data\n  double logalpha0_; \/\/ Alpha0 is used to make the error adaptive to the image size\n};\n\n\/\/\/ Pose\/Resection Kernel adapter for the A contrario model estimator with\n\/\/\/  known Intrinsic\ntemplate <typename SolverArg,\n  typename ErrorArg,\n  typename UnnormalizerArg,\n  typename ModelArg = Mat34>\nclass ACKernelAdaptorResection_K\n{\npublic:\n  typedef SolverArg Solver;\n  typedef ModelArg  Model;\n  typedef ErrorArg ErrorT;\n\n  ACKernelAdaptorResection_K(const Mat &x2d, const Mat &x3D, const Mat3 & K)\n    : x2d_(x2d.rows(), x2d.cols()), x3D_(x3D),\n    N1_(K.inverse()),\n    logalpha0_(log10(M_PI)), K_(K)\n  {\n    assert(2 == x2d_.rows());\n    assert(3 == x3D_.rows());\n    assert(x2d_.cols() == x3D_.cols());\n\n    \/\/ Normalize points by inverse(K)\n    ApplyTransformationToPoints(x2d, N1_, &x2d_);\n  }\n\n  enum { MINIMUM_SAMPLES = Solver::MINIMUM_SAMPLES };\n  enum { MAX_MODELS = Solver::MAX_MODELS };\n\n  void Fit(const std::vector<size_t> &samples, std::vector<Model> *models) const {\n    const Mat x1 = ExtractColumns(x2d_, samples);\n    const Mat x2 = ExtractColumns(x3D_, samples);\n    Solver::Solve(x1, x2, models);\n  }\n\n  double Error(size_t sample, const Model &model) const {\n    return ErrorT::Error(model, x2d_.col(sample), x3D_.col(sample));\n  }\n\n  void Errors(const Model & model, std::vector<double> & vec_errors) const\n  {\n    vec_errors.resize(x2d_.cols());\n    for (size_t sample = 0; sample < x2d_.cols(); ++sample)\n      vec_errors[sample] = ErrorT::Error(model, x2d_.col(sample), x3D_.col(sample));\n  }\n\n  size_t NumSamples() const { return x2d_.cols(); }\n\n  void Unnormalize(Model * model) const {\n    \/\/ Unnormalize model from the computed conditioning.\n    (*model) = K_ * (*model);\n  }\n\n  double logalpha0() const {return logalpha0_;}\n  double multError() const {return 1.0;} \/\/ point to point error\n  Mat3 normalizer1() const {return Mat3::Identity();}\n  Mat3 normalizer2() const {return N1_;}\n  double unormalizeError(double val) const {return sqrt(val) \/ N1_(0,0);}\n\nprivate:\n  Mat x2d_, x3D_;\n  Mat3 N1_;      \/\/ Matrix used to normalize data\n  double logalpha0_; \/\/ Alpha0 is used to make the error adaptive to the image size\n  Mat3 K_;            \/\/ Intrinsic camera parameter\n};\n\n\/\/\/ Essential matrix Kernel adaptor for the A contrario model estimator\ntemplate <typename SolverArg,\n  typename ErrorArg,\n  typename UnnormalizerArg,\n  typename ModelArg = Mat3>\nclass ACKernelAdaptorEssential\n{\npublic:\n  typedef SolverArg Solver;\n  typedef ModelArg  Model;\n  typedef ErrorArg ErrorT;\n\n  ACKernelAdaptorEssential(\n    const Mat &x1, int w1, int h1,\n    const Mat &x2, int w2, int h2,\n    const Mat3 & K1, const Mat3 & K2)\n    : x1_(x1), x2_(x2),\n    N1_(Mat3::Identity()), N2_(Mat3::Identity()), logalpha0_(0.0),\n    K1_(K1), K2_(K2)\n{\n    assert(2 == x1_.rows());\n    assert(x1_.rows() == x2_.rows());\n    assert(x1_.cols() == x2_.cols());\n\n    ApplyTransformationToPoints(x1_, K1_.inverse(), &x1k_);\n    ApplyTransformationToPoints(x2_, K2_.inverse(), &x2k_);\n\n    \/\/Point to line probability (line is the epipolar line)\n    double D = sqrt(w2*(double)w2 + h2*(double)h2); \/\/ diameter\n    double A = w2*(double)h2; \/\/ area\n    logalpha0_ = log10(2.0*D\/A * .5);\n  }\n\n  enum { MINIMUM_SAMPLES = Solver::MINIMUM_SAMPLES };\n  enum { MAX_MODELS = Solver::MAX_MODELS };\n\n  void Fit(const std::vector<size_t> &samples, std::vector<Model> *models) const {\n    const Mat x1 = ExtractColumns(x1k_, samples);\n    const Mat x2 = ExtractColumns(x2k_, samples);\n    Solver::Solve(x1, x2, models);\n  }\n\n  double Error(size_t sample, const Model &model) const {\n    Mat3 F;\n    FundamentalFromEssential(model, K1_, K2_, &F);\n    return ErrorT::Error(F, this->x1_.col(sample), this->x2_.col(sample));\n  }\n\n  void Errors(const Model & model, std::vector<double> & vec_errors) const\n  {\n    Mat3 F;\n    FundamentalFromEssential(model, K1_, K2_, &F);\n    vec_errors.resize(x1_.cols());\n    for (size_t sample = 0; sample < x1_.cols(); ++sample)\n      vec_errors[sample] = ErrorT::Error(F, this->x1_.col(sample), this->x2_.col(sample));\n  }\n\n  size_t NumSamples() const { return x1_.cols(); }\n  void Unnormalize(Model * model) const {}\n  double logalpha0() const {return logalpha0_;}\n  double multError() const {return 0.5;} \/\/ point to line error\n  Mat3 normalizer1() const {return N1_;}\n  Mat3 normalizer2() const {return N2_;}\n  double unormalizeError(double val) const { return val; }\n\nprivate:\n  Mat x1_, x2_, x1k_, x2k_; \/\/ image point and camera plane point.\n  Mat3 N1_, N2_;      \/\/ Matrix used to normalize data\n  double logalpha0_; \/\/ Alpha0 is used to make the error adaptive to the image size\n  Mat3 K1_, K2_;      \/\/ Intrinsic camera parameter\n};\n\n\/\/\/ Two view Kernel adapter for the A contrario model estimator.\n\/\/\/ Specialization to handle radian angular residual error.\ntemplate <typename SolverArg,\n          typename ErrorArg,\n          typename UnnormalizerArg,\n          typename ModelArg = Mat3>\nclass ACKernelAdaptor_AngularRadianError\n{\npublic:\n  typedef SolverArg Solver;\n  typedef ModelArg  Model;\n  typedef ErrorArg ErrorT;\n\n  ACKernelAdaptor_AngularRadianError(\n    const Mat & xA,\n    const Mat & xB):\n    x1_(xA), x2_(xB),\n    logalpha0_(log10(1.0\/2.0))\n  {\n    assert(3 == x1_.rows());\n    assert(x1_.rows() == x2_.rows());\n    assert(x1_.cols() == x2_.cols());\n  }\n\n  enum { MINIMUM_SAMPLES = Solver::MINIMUM_SAMPLES };\n  enum { MAX_MODELS = Solver::MAX_MODELS };\n\n  void Fit(const std::vector<size_t> &samples, std::vector<Model> *models) const {\n    const Mat x1 = ExtractColumns(x1_, samples);\n    const Mat x2 = ExtractColumns(x2_, samples);\n    Solver::Solve(x1, x2, models);\n  }\n\n  double Error(size_t sample, const Model &model) const {\n    return Square(ErrorT::Error(model, x1_.col(sample), x2_.col(sample)));\n  }\n\n  void Errors(const Model & model, std::vector<double> & vec_errors) const\n  {\n    vec_errors.resize(x1_.cols());\n    for (size_t sample = 0; sample < x1_.cols(); ++sample)\n      vec_errors[sample] = Square(ErrorT::Error(model, x1_.col(sample), x2_.col(sample)));\n  }\n\n  size_t NumSamples() const {\n    return static_cast<size_t>(x1_.cols());\n  }\n\n  void Unnormalize(Model * model) const {\n    \/\/-- Do nothing, no normalization in the angular case\n  }\n\n  double logalpha0() const {return logalpha0_;}\n\n  double multError() const {return 1.\/4.;}\n\n  Mat3 normalizer1() const {return Mat3::Identity();}\n  Mat3 normalizer2() const {return Mat3::Identity();}\n  double unormalizeError(double val) const {return sqrt(val);}\n\nprivate:\n  Mat x1_, x2_;       \/\/ Normalized input data\n  double logalpha0_; \/\/ Alpha0 is used to make the error scale invariant\n};\n\n} \/\/ namespace robust\n} \/\/ namespace openMVG\n#endif \/\/ OPENMVG_ROBUST_ESTIMATOR_ACRANSAC_KERNEL_ADAPTATOR_H_\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- unittests\/AST\/StmtPrinterTest.cpp --- Statement printer tests ------===\/\/\n\/\/\n\/\/                     The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file contains tests for Stmt::printPretty() and related methods.\n\/\/\n\/\/ Search this file for WRONG to see test cases that are producing something\n\/\/ completely wrong, invalid C++ or just misleading.\n\/\/\n\/\/ These tests have a coding convention:\n\/\/ * statements to be printed should be contained within a function named 'A'\n\/\/   unless it should have some special name (e.g., 'operator+');\n\/\/ * additional helper declarations are 'Z', 'Y', 'X' and so on.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/ASTMatchers\/ASTMatchFinder.h\"\n#include \"clang\/Tooling\/Tooling.h\"\n#include \"llvm\/ADT\/SmallString.h\"\n#include \"gtest\/gtest.h\"\n\nusing namespace clang;\nusing namespace ast_matchers;\nusing namespace tooling;\n\nnamespace {\n\nusing PolicyAdjusterType =\n    Optional<llvm::function_ref<void(PrintingPolicy &Policy)>>;\n\nvoid PrintStmt(raw_ostream &Out, const ASTContext *Context, const Stmt *S,\n               PolicyAdjusterType PolicyAdjuster) {\n  assert(S != nullptr && \"Expected non-null Stmt\");\n  PrintingPolicy Policy = Context->getPrintingPolicy();\n  if (PolicyAdjuster)\n    (*PolicyAdjuster)(Policy);\n  S->printPretty(Out, \/*Helper*\/ nullptr, Policy);\n}\n\nclass PrintMatch : public MatchFinder::MatchCallback {\n  SmallString<1024> Printed;\n  unsigned NumFoundStmts;\n  PolicyAdjusterType PolicyAdjuster;\n\npublic:\n  PrintMatch(PolicyAdjusterType PolicyAdjuster)\n      : NumFoundStmts(0), PolicyAdjuster(PolicyAdjuster) {}\n\n  void run(const MatchFinder::MatchResult &Result) override {\n    const Stmt *S = Result.Nodes.getNodeAs<Stmt>(\"id\");\n    if (!S)\n      return;\n    NumFoundStmts++;\n    if (NumFoundStmts > 1)\n      return;\n\n    llvm::raw_svector_ostream Out(Printed);\n    PrintStmt(Out, Result.Context, S, PolicyAdjuster);\n  }\n\n  StringRef getPrinted() const {\n    return Printed;\n  }\n\n  unsigned getNumFoundStmts() const {\n    return NumFoundStmts;\n  }\n};\n\ntemplate <typename T>\n::testing::AssertionResult\nPrintedStmtMatches(StringRef Code, const std::vector<std::string> &Args,\n                   const T &NodeMatch, StringRef ExpectedPrinted,\n                   PolicyAdjusterType PolicyAdjuster = None) {\n\n  PrintMatch Printer(PolicyAdjuster);\n  MatchFinder Finder;\n  Finder.addMatcher(NodeMatch, &Printer);\n  std::unique_ptr<FrontendActionFactory> Factory(\n      newFrontendActionFactory(&Finder));\n\n  if (!runToolOnCodeWithArgs(Factory->create(), Code, Args))\n    return testing::AssertionFailure()\n      << \"Parsing error in \\\"\" << Code.str() << \"\\\"\";\n\n  if (Printer.getNumFoundStmts() == 0)\n    return testing::AssertionFailure()\n        << \"Matcher didn't find any statements\";\n\n  if (Printer.getNumFoundStmts() > 1)\n    return testing::AssertionFailure()\n        << \"Matcher should match only one statement \"\n           \"(found \" << Printer.getNumFoundStmts() << \")\";\n\n  if (Printer.getPrinted() != ExpectedPrinted)\n    return ::testing::AssertionFailure()\n      << \"Expected \\\"\" << ExpectedPrinted.str() << \"\\\", \"\n         \"got \\\"\" << Printer.getPrinted().str() << \"\\\"\";\n\n  return ::testing::AssertionSuccess();\n}\n\n::testing::AssertionResult\nPrintedStmtCXX98Matches(StringRef Code, const StatementMatcher &NodeMatch,\n                        StringRef ExpectedPrinted) {\n  std::vector<std::string> Args;\n  Args.push_back(\"-std=c++98\");\n  Args.push_back(\"-Wno-unused-value\");\n  return PrintedStmtMatches(Code, Args, NodeMatch, ExpectedPrinted);\n}\n\n::testing::AssertionResult PrintedStmtCXX98Matches(\n                                              StringRef Code,\n                                              StringRef ContainingFunction,\n                                              StringRef ExpectedPrinted) {\n  std::vector<std::string> Args;\n  Args.push_back(\"-std=c++98\");\n  Args.push_back(\"-Wno-unused-value\");\n  return PrintedStmtMatches(Code,\n                            Args,\n                            functionDecl(hasName(ContainingFunction),\n                                         has(compoundStmt(has(stmt().bind(\"id\"))))),\n                            ExpectedPrinted);\n}\n\n::testing::AssertionResult\nPrintedStmtCXX11Matches(StringRef Code, const StatementMatcher &NodeMatch,\n                        StringRef ExpectedPrinted,\n                        PolicyAdjusterType PolicyAdjuster = None) {\n  std::vector<std::string> Args;\n  Args.push_back(\"-std=c++11\");\n  Args.push_back(\"-Wno-unused-value\");\n  return PrintedStmtMatches(Code, Args, NodeMatch, ExpectedPrinted,\n                            PolicyAdjuster);\n}\n\n::testing::AssertionResult PrintedStmtMSMatches(\n                                              StringRef Code,\n                                              StringRef ContainingFunction,\n                                              StringRef ExpectedPrinted) {\n  std::vector<std::string> Args;\n  Args.push_back(\"-target\");\n  Args.push_back(\"i686-pc-win32\");\n  Args.push_back(\"-std=c++98\");\n  Args.push_back(\"-fms-extensions\");\n  Args.push_back(\"-Wno-unused-value\");\n  return PrintedStmtMatches(Code,\n                            Args,\n                            functionDecl(hasName(ContainingFunction),\n                                         has(compoundStmt(has(stmt().bind(\"id\"))))),\n                            ExpectedPrinted);\n}\n\n::testing::AssertionResult\nPrintedStmtObjCMatches(StringRef Code, const StatementMatcher &NodeMatch,\n                       StringRef ExpectedPrinted,\n                       PolicyAdjusterType PolicyAdjuster = None) {\n  std::vector<std::string> Args;\n  Args.push_back(\"-ObjC\");\n  Args.push_back(\"-fobjc-runtime=macosx-10.12.0\");\n  return PrintedStmtMatches(Code, Args, NodeMatch, ExpectedPrinted,\n                            PolicyAdjuster);\n}\n\n} \/\/ unnamed namespace\n\nTEST(StmtPrinter, TestIntegerLiteral) {\n  ASSERT_TRUE(PrintedStmtCXX98Matches(\n    \"void A() {\"\n    \"  1, -1, 1U, 1u,\"\n    \"  1L, 1l, -1L, 1UL, 1ul,\"\n    \"  1LL, -1LL, 1ULL;\"\n    \"}\",\n    \"A\",\n    \"1 , -1 , 1U , 1U , \"\n    \"1L , 1L , -1L , 1UL , 1UL , \"\n    \"1LL , -1LL , 1ULL\"));\n    \/\/ Should be: with semicolon\n}\n\nTEST(StmtPrinter, TestMSIntegerLiteral) {\n  ASSERT_TRUE(PrintedStmtMSMatches(\n    \"void A() {\"\n    \"  1i8, -1i8, 1ui8, \"\n    \"  1i16, -1i16, 1ui16, \"\n    \"  1i32, -1i32, 1ui32, \"\n    \"  1i64, -1i64, 1ui64;\"\n    \"}\",\n    \"A\",\n    \"1i8 , -1i8 , 1Ui8 , \"\n    \"1i16 , -1i16 , 1Ui16 , \"\n    \"1 , -1 , 1U , \"\n    \"1LL , -1LL , 1ULL\"));\n    \/\/ Should be: with semicolon\n}\n\nTEST(StmtPrinter, TestFloatingPointLiteral) {\n  ASSERT_TRUE(PrintedStmtCXX98Matches(\n    \"void A() { 1.0f, -1.0f, 1.0, -1.0, 1.0l, -1.0l; }\",\n    \"A\",\n    \"1.F , -1.F , 1. , -1. , 1.L , -1.L\"));\n    \/\/ Should be: with semicolon\n}\n\nTEST(StmtPrinter, TestCXXConversionDeclImplicit) {\n  ASSERT_TRUE(PrintedStmtCXX98Matches(\n    \"struct A {\"\n      \"operator void *();\"\n      \"A operator&(A);\"\n    \"};\"\n    \"void bar(void *);\"\n    \"void foo(A a, A b) {\"\n    \"  bar(a & b);\"\n    \"}\",\n    cxxMemberCallExpr(anything()).bind(\"id\"),\n    \"a & b\"));\n}\n\nTEST(StmtPrinter, TestCXXConversionDeclExplicit) {\n  ASSERT_TRUE(PrintedStmtCXX11Matches(\n    \"struct A {\"\n      \"operator void *();\"\n      \"A operator&(A);\"\n    \"};\"\n    \"void bar(void *);\"\n    \"void foo(A a, A b) {\"\n    \"  auto x = (a & b).operator void *();\"\n    \"}\",\n    cxxMemberCallExpr(anything()).bind(\"id\"),\n    \"(a & b)\"));\n    \/\/ WRONG; Should be: (a & b).operator void *()\n}\n\nTEST(StmtPrinter, TestNoImplicitBases) {\n  const char *CPPSource = R\"(\nclass A {\n  int field;\n  int member() { return field; }\n};\n)\";\n  \/\/ No implicit 'this'.\n  ASSERT_TRUE(PrintedStmtCXX11Matches(\n      CPPSource, memberExpr(anything()).bind(\"id\"), \"field\",\n      PolicyAdjusterType(\n          [](PrintingPolicy &PP) { PP.SuppressImplicitBase = true; })));\n  \/\/ Print implicit 'this'.\n  ASSERT_TRUE(PrintedStmtCXX11Matches(\n      CPPSource, memberExpr(anything()).bind(\"id\"), \"this->field\"));\n\n  const char *ObjCSource = R\"(\n@interface I {\n   int ivar;\n}\n@end\n@implementation I\n- (int) method {\n  return ivar;\n}\n@end\n      )\";\n  \/\/ No implicit 'self'.\n  ASSERT_TRUE(PrintedStmtObjCMatches(ObjCSource, returnStmt().bind(\"id\"),\n                                     \"return ivar;\\n\",\n                                     PolicyAdjusterType([](PrintingPolicy &PP) {\n                                       PP.SuppressImplicitBase = true;\n                                     })));\n  \/\/ Print implicit 'self'.\n  ASSERT_TRUE(PrintedStmtObjCMatches(ObjCSource, returnStmt().bind(\"id\"),\n                                     \"return self->ivar;\\n\"));\n}\n<commit_msg>[unittests] Merge the PrintedStmtCXX..Matches functions (NFC)<commit_after>\/\/===- unittests\/AST\/StmtPrinterTest.cpp --- Statement printer tests ------===\/\/\n\/\/\n\/\/                     The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file contains tests for Stmt::printPretty() and related methods.\n\/\/\n\/\/ Search this file for WRONG to see test cases that are producing something\n\/\/ completely wrong, invalid C++ or just misleading.\n\/\/\n\/\/ These tests have a coding convention:\n\/\/ * statements to be printed should be contained within a function named 'A'\n\/\/   unless it should have some special name (e.g., 'operator+');\n\/\/ * additional helper declarations are 'Z', 'Y', 'X' and so on.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/ASTMatchers\/ASTMatchFinder.h\"\n#include \"clang\/Tooling\/Tooling.h\"\n#include \"llvm\/ADT\/SmallString.h\"\n#include \"gtest\/gtest.h\"\n\nusing namespace clang;\nusing namespace ast_matchers;\nusing namespace tooling;\n\nnamespace {\n\nusing PolicyAdjusterType =\n    Optional<llvm::function_ref<void(PrintingPolicy &Policy)>>;\n\nvoid PrintStmt(raw_ostream &Out, const ASTContext *Context, const Stmt *S,\n               PolicyAdjusterType PolicyAdjuster) {\n  assert(S != nullptr && \"Expected non-null Stmt\");\n  PrintingPolicy Policy = Context->getPrintingPolicy();\n  if (PolicyAdjuster)\n    (*PolicyAdjuster)(Policy);\n  S->printPretty(Out, \/*Helper*\/ nullptr, Policy);\n}\n\nclass PrintMatch : public MatchFinder::MatchCallback {\n  SmallString<1024> Printed;\n  unsigned NumFoundStmts;\n  PolicyAdjusterType PolicyAdjuster;\n\npublic:\n  PrintMatch(PolicyAdjusterType PolicyAdjuster)\n      : NumFoundStmts(0), PolicyAdjuster(PolicyAdjuster) {}\n\n  void run(const MatchFinder::MatchResult &Result) override {\n    const Stmt *S = Result.Nodes.getNodeAs<Stmt>(\"id\");\n    if (!S)\n      return;\n    NumFoundStmts++;\n    if (NumFoundStmts > 1)\n      return;\n\n    llvm::raw_svector_ostream Out(Printed);\n    PrintStmt(Out, Result.Context, S, PolicyAdjuster);\n  }\n\n  StringRef getPrinted() const {\n    return Printed;\n  }\n\n  unsigned getNumFoundStmts() const {\n    return NumFoundStmts;\n  }\n};\n\ntemplate <typename T>\n::testing::AssertionResult\nPrintedStmtMatches(StringRef Code, const std::vector<std::string> &Args,\n                   const T &NodeMatch, StringRef ExpectedPrinted,\n                   PolicyAdjusterType PolicyAdjuster = None) {\n\n  PrintMatch Printer(PolicyAdjuster);\n  MatchFinder Finder;\n  Finder.addMatcher(NodeMatch, &Printer);\n  std::unique_ptr<FrontendActionFactory> Factory(\n      newFrontendActionFactory(&Finder));\n\n  if (!runToolOnCodeWithArgs(Factory->create(), Code, Args))\n    return testing::AssertionFailure()\n      << \"Parsing error in \\\"\" << Code.str() << \"\\\"\";\n\n  if (Printer.getNumFoundStmts() == 0)\n    return testing::AssertionFailure()\n        << \"Matcher didn't find any statements\";\n\n  if (Printer.getNumFoundStmts() > 1)\n    return testing::AssertionFailure()\n        << \"Matcher should match only one statement \"\n           \"(found \" << Printer.getNumFoundStmts() << \")\";\n\n  if (Printer.getPrinted() != ExpectedPrinted)\n    return ::testing::AssertionFailure()\n      << \"Expected \\\"\" << ExpectedPrinted.str() << \"\\\", \"\n         \"got \\\"\" << Printer.getPrinted().str() << \"\\\"\";\n\n  return ::testing::AssertionSuccess();\n}\n\nenum class StdVer { CXX98, CXX11, CXX14, CXX17, CXX2a };\n\nDeclarationMatcher FunctionBodyMatcher(StringRef ContainingFunction) {\n  return functionDecl(hasName(ContainingFunction),\n                      has(compoundStmt(has(stmt().bind(\"id\")))));\n}\n\ntemplate <typename T>\n::testing::AssertionResult\nPrintedStmtCXXMatches(StdVer Standard, StringRef Code, const T &NodeMatch,\n                      StringRef ExpectedPrinted,\n                      PolicyAdjusterType PolicyAdjuster = None) {\n  const char *StdOpt;\n  switch (Standard) {\n  case StdVer::CXX98: StdOpt = \"-std=c++98\"; break;\n  case StdVer::CXX11: StdOpt = \"-std=c++11\"; break;\n  case StdVer::CXX14: StdOpt = \"-std=c++14\"; break;\n  case StdVer::CXX17: StdOpt = \"-std=c++17\"; break;\n  case StdVer::CXX2a: StdOpt = \"-std=c++2a\"; break;\n  }\n\n  std::vector<std::string> Args = {\n    StdOpt,\n    \"-Wno-unused-value\",\n  };\n  return PrintedStmtMatches(Code, Args, NodeMatch, ExpectedPrinted,\n                            PolicyAdjuster);\n}\n\ntemplate <typename T>\n::testing::AssertionResult\nPrintedStmtMSMatches(StringRef Code, const T &NodeMatch,\n                     StringRef ExpectedPrinted,\n                     PolicyAdjusterType PolicyAdjuster = None) {\n  std::vector<std::string> Args = {\n    \"-std=c++98\",\n    \"-target\", \"i686-pc-win32\",\n    \"-fms-extensions\",\n    \"-Wno-unused-value\",\n  };\n  return PrintedStmtMatches(Code, Args, NodeMatch, ExpectedPrinted,\n                            PolicyAdjuster);\n}\n\ntemplate <typename T>\n::testing::AssertionResult\nPrintedStmtObjCMatches(StringRef Code, const T &NodeMatch,\n                       StringRef ExpectedPrinted,\n                       PolicyAdjusterType PolicyAdjuster = None) {\n  std::vector<std::string> Args = {\n    \"-ObjC\",\n    \"-fobjc-runtime=macosx-10.12.0\",\n  };\n  return PrintedStmtMatches(Code, Args, NodeMatch, ExpectedPrinted,\n                            PolicyAdjuster);\n}\n\n} \/\/ unnamed namespace\n\nTEST(StmtPrinter, TestIntegerLiteral) {\n  ASSERT_TRUE(PrintedStmtCXXMatches(StdVer::CXX98,\n    \"void A() {\"\n    \"  1, -1, 1U, 1u,\"\n    \"  1L, 1l, -1L, 1UL, 1ul,\"\n    \"  1LL, -1LL, 1ULL;\"\n    \"}\",\n    FunctionBodyMatcher(\"A\"),\n    \"1 , -1 , 1U , 1U , \"\n    \"1L , 1L , -1L , 1UL , 1UL , \"\n    \"1LL , -1LL , 1ULL\"));\n    \/\/ Should be: with semicolon\n}\n\nTEST(StmtPrinter, TestMSIntegerLiteral) {\n  ASSERT_TRUE(PrintedStmtMSMatches(\n    \"void A() {\"\n    \"  1i8, -1i8, 1ui8, \"\n    \"  1i16, -1i16, 1ui16, \"\n    \"  1i32, -1i32, 1ui32, \"\n    \"  1i64, -1i64, 1ui64;\"\n    \"}\",\n    FunctionBodyMatcher(\"A\"),\n    \"1i8 , -1i8 , 1Ui8 , \"\n    \"1i16 , -1i16 , 1Ui16 , \"\n    \"1 , -1 , 1U , \"\n    \"1LL , -1LL , 1ULL\"));\n    \/\/ Should be: with semicolon\n}\n\nTEST(StmtPrinter, TestFloatingPointLiteral) {\n  ASSERT_TRUE(PrintedStmtCXXMatches(StdVer::CXX98,\n    \"void A() { 1.0f, -1.0f, 1.0, -1.0, 1.0l, -1.0l; }\",\n    FunctionBodyMatcher(\"A\"),\n    \"1.F , -1.F , 1. , -1. , 1.L , -1.L\"));\n    \/\/ Should be: with semicolon\n}\n\nTEST(StmtPrinter, TestCXXConversionDeclImplicit) {\n  ASSERT_TRUE(PrintedStmtCXXMatches(StdVer::CXX98,\n    \"struct A {\"\n      \"operator void *();\"\n      \"A operator&(A);\"\n    \"};\"\n    \"void bar(void *);\"\n    \"void foo(A a, A b) {\"\n    \"  bar(a & b);\"\n    \"}\",\n    cxxMemberCallExpr(anything()).bind(\"id\"),\n    \"a & b\"));\n}\n\nTEST(StmtPrinter, TestCXXConversionDeclExplicit) {\n  ASSERT_TRUE(PrintedStmtCXXMatches(StdVer::CXX11,\n    \"struct A {\"\n      \"operator void *();\"\n      \"A operator&(A);\"\n    \"};\"\n    \"void bar(void *);\"\n    \"void foo(A a, A b) {\"\n    \"  auto x = (a & b).operator void *();\"\n    \"}\",\n    cxxMemberCallExpr(anything()).bind(\"id\"),\n    \"(a & b)\"));\n    \/\/ WRONG; Should be: (a & b).operator void *()\n}\n\nTEST(StmtPrinter, TestNoImplicitBases) {\n  const char *CPPSource = R\"(\nclass A {\n  int field;\n  int member() { return field; }\n};\n)\";\n  \/\/ No implicit 'this'.\n  ASSERT_TRUE(PrintedStmtCXXMatches(StdVer::CXX11,\n      CPPSource, memberExpr(anything()).bind(\"id\"), \"field\",\n      PolicyAdjusterType(\n          [](PrintingPolicy &PP) { PP.SuppressImplicitBase = true; })));\n  \/\/ Print implicit 'this'.\n  ASSERT_TRUE(PrintedStmtCXXMatches(StdVer::CXX11,\n      CPPSource, memberExpr(anything()).bind(\"id\"), \"this->field\"));\n\n  const char *ObjCSource = R\"(\n@interface I {\n   int ivar;\n}\n@end\n@implementation I\n- (int) method {\n  return ivar;\n}\n@end\n      )\";\n  \/\/ No implicit 'self'.\n  ASSERT_TRUE(PrintedStmtObjCMatches(ObjCSource, returnStmt().bind(\"id\"),\n                                     \"return ivar;\\n\",\n                                     PolicyAdjusterType([](PrintingPolicy &PP) {\n                                       PP.SuppressImplicitBase = true;\n                                     })));\n  \/\/ Print implicit 'self'.\n  ASSERT_TRUE(PrintedStmtObjCMatches(ObjCSource, returnStmt().bind(\"id\"),\n                                     \"return self->ivar;\\n\"));\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n# =============================================================================\n# Rtree spatial index. Copyright (C) 2007 Sean C. Gillies\n#\n# This library 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\n# Software Foundation; either version 2.1 of the License, or (at your option)\n# 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 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 \n# along with this library; if not, write to the Free Software Foundation, Inc.,\n# 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA\n#\n# Contact email: sgillies@frii.com\n# =============================================================================\n*\/\n\n#include <Python.h>\n#include \"wrapper.h\"\n\ntypedef struct {\n    PyObject_HEAD\n    RtreeIndex index;\n} Rtree;\n\n\/* Alloc\/dealloc *\/\n\nstatic void\nRtree_dealloc(Rtree *self)\n{\n    RtreeIndex_del(self->index);\n\n    self->ob_type->tp_free((PyObject*) self);\n}\n\nstatic int\nRtree_init(Rtree *self, PyObject *args, PyObject *kwds)\n{\n    char* basename = NULL;\n    char filename[256];\n    unsigned long nPageLength = 0;\n    int overwrite = 0;\n    int load = -1;\n    PyObject *os_module;\n    PyObject *path_module;\n    PyObject *abspath, *dirname;\n    PyObject *func;\n\n    static char *kwlist[] = {\"basename\", \"pagesize\", \"overwrite\", NULL};\n\n    if (!PyArg_ParseTupleAndKeywords(\n            args, kwds, \"|sii\", kwlist,\n            &basename, (unsigned long)&nPageLength, &overwrite\n            )\n        )\n        return -1;\n\n    \/\/ Import os and os.path\n    os_module = PyImport_ImportModule(\"os\");\n    path_module = PyImport_ImportModule(\"os.path\");\n\n    if (basename)\n    {\n        snprintf(filename, 256, \"%s.dat\", basename);\n \n        \/\/ Bail out if we don't have write access\n        func = PyObject_GetAttrString(path_module, \"abspath\");\n        abspath = PyObject_CallFunction(func, \"s\", filename);\n        func = PyObject_GetAttrString(path_module, \"dirname\");\n        dirname = PyObject_CallFunctionObjArgs(func, abspath, NULL);\n\n        func = PyObject_GetAttrString(os_module, \"access\");\n        if (!PyObject_IsTrue(PyObject_CallFunctionObjArgs(func, dirname, PyObject_GetAttrString(os_module, \"W_OK\"), NULL)))\n        {\n            PyErr_Format(PyExc_IOError,\n                \"Unable to open file '%s' for index storage\",\n                basename\n                );\n            return -1;\n        }\n\n        \/\/ Check for existence with os.path.exists\n        func = PyObject_GetAttrString(path_module, \"exists\");\n        if (PyObject_IsTrue(PyObject_CallFunction(func, \"s\", filename)))\n        {\n            if (overwrite == 0)\n                load = 1;\n            else\n                load = 0;\n        }\n        else\n            load = 0;\n    }\n\n    self->index = RtreeIndex_new(basename, nPageLength, load);\n    \n    if (RtreeIndex_isValid(self->index) != 1) {\n        PyErr_Format(PyExc_IOError,\n            \"Index layout is invalid\"\n            );\n        return -1;\n\t}\n    return 0;\n}\n\n\/* Methods *\/\n\nstatic PyObject *\nRtree_add(Rtree *self, PyObject *args)\n{\n    double min[2], max[2];\n    long id;\n    int size;\n    PyObject *bounds=NULL;\n\n    if (!PyArg_ParseTuple(args, \"lO\", &id, &bounds))\n        return NULL;\n\n    \/* Check length of the bounds argument *\/\n    if (!PySequence_Check(bounds))\n    {\n        PyErr_SetString(PyExc_TypeError, \"Bounds must be a sequence\");\n        return NULL;\n    }\n\n    size = (int) PySequence_Size(bounds);\n    if (size == 2)\n    {\n        min[0] = max[0] = PyFloat_AsDouble(PySequence_ITEM(bounds, 0));\n        min[1] = max[1] = PyFloat_AsDouble(PySequence_ITEM(bounds, 1));\n    }\n    else if (size == 4)\n    {\n        min[0] = PyFloat_AsDouble(PySequence_ITEM(bounds, 0));\n        min[1] = PyFloat_AsDouble(PySequence_ITEM(bounds, 1));\n        max[0] = PyFloat_AsDouble(PySequence_ITEM(bounds, 2));\n        max[1] = PyFloat_AsDouble(PySequence_ITEM(bounds, 3));\n    }\n    else\n    {\n        PyErr_Format(PyExc_TypeError,\n            \"Bounds argument must be sequence of length 2 or 4, not %d\",\n            size);\n        return NULL;\n    }\n  \n    if (RtreeIndex_insertData(self->index, id, min, max) ) {\n        Py_INCREF(Py_None);\n        return Py_None;        \n    } else {\n        return NULL;\n    }\n    \n    \n\n}\n\nstatic PyObject *\nRtree_deleteData(Rtree *self, PyObject *args)\n{\n    double min[2], max[2];\n    long id;\n    int size;\n    PyObject *bounds=NULL;\n\n    if (!PyArg_ParseTuple(args, \"lO\", &id, &bounds))\n        return NULL;\n\n    \/* Check length of the bounds argument *\/\n    if (!PySequence_Check(bounds))\n    {\n        PyErr_SetString(PyExc_TypeError, \"Bounds must be a sequence\");\n        return NULL;\n    }\n\n    size = (int) PySequence_Size(bounds);\n    if (size == 2)\n    {\n        min[0] = max[0] = PyFloat_AsDouble(PySequence_ITEM(bounds, 0));\n        min[1] = max[1] = PyFloat_AsDouble(PySequence_ITEM(bounds, 1));\n    }\n    else if (size == 4)\n    {\n        min[0] = PyFloat_AsDouble(PySequence_ITEM(bounds, 0));\n        min[1] = PyFloat_AsDouble(PySequence_ITEM(bounds, 1));\n        max[0] = PyFloat_AsDouble(PySequence_ITEM(bounds, 2));\n        max[1] = PyFloat_AsDouble(PySequence_ITEM(bounds, 3));\n    }\n    else\n    {\n        PyErr_Format(PyExc_TypeError,\n            \"Bounds argument must be sequence of length 2 or 4, not %d\",\n            size);\n        return NULL;\n    }\n  \n    \n    if (RtreeIndex_deleteData(self->index, id, min, max) ) {\n        Py_INCREF(Py_None);\n        return Py_None;        \n    } else {\n        return NULL;\n    }    \n\n}\n\nstatic PyObject *\nRtree_intersection(Rtree *self, PyObject *args)\n{\n    double min[2], max[2];\n\n    if (!PyArg_ParseTuple(args, \"(dddd)\", &min[0], &min[1], &max[0], &max[1]))\n        return NULL;\n    \n    return RtreeIndex_intersects(self->index, min, max);\n}\n\nstatic PyObject *\nRtree_nearsetNeighbors(Rtree *self, PyObject *args)\n{\n\n    double min[2], max[2];\n    uint32_t num_results;\n    int size;\n    \n    PyObject *bounds=NULL;\n\n    if (!PyArg_ParseTuple(args, \"Ol\", &bounds, &num_results))\n        return NULL;\n\n        \n    \/* Check length of the bounds argument *\/\n    if (!PySequence_Check(bounds))\n    {\n        PyErr_SetString(PyExc_TypeError, \"Bounds must be a sequence\");\n        return NULL;\n    }\n\n    size = (int) PySequence_Size(bounds);\n    if (size == 2)\n    {\n        min[0] = max[0] = PyFloat_AsDouble(PySequence_ITEM(bounds, 0));\n        min[1] = max[1] = PyFloat_AsDouble(PySequence_ITEM(bounds, 1));\n    }\n    else if (size == 4)\n    {\n        min[0] = PyFloat_AsDouble(PySequence_ITEM(bounds, 0));\n        min[1] = PyFloat_AsDouble(PySequence_ITEM(bounds, 1));\n        max[0] = PyFloat_AsDouble(PySequence_ITEM(bounds, 2));\n        max[1] = PyFloat_AsDouble(PySequence_ITEM(bounds, 3));\n    }\n    else\n    {\n        PyErr_Format(PyExc_TypeError,\n            \"Bounds argument must be sequence of length 2 or 4, not %d\",\n            size);\n        return NULL;\n    }\n\n    return RtreeIndex_nearestNeighbors(self->index, num_results, min, max);\n}\n\n\/* Define Methods *\/\n\nstatic PyMethodDef module_methods[] = {\n    {\"add\", (PyCFunction)Rtree_add, METH_VARARGS, \"Add an item to an index, specifying an integer id and a bounding box\"},\n    {\"intersection\", (PyCFunction)Rtree_intersection, METH_VARARGS, \"Return an iterator over integer ids of items that are likely to intersect with the specified bounding box.\"},\n    {\"nearest\", (PyCFunction)Rtree_nearsetNeighbors, METH_VARARGS, \"Return an iterator over integer ids of items that are near the specified bounding box.\"},\n    {\"delete\", (PyCFunction)Rtree_deleteData, METH_VARARGS, \"Deletes a member from the index with a given id and bounding box.\"},\n    {NULL}\n};\n\n\/* Define Type *\/\n\nstatic PyTypeObject RtreeType = {\n    PyObject_HEAD_INIT(NULL)\n    0,                              \/*ob_size*\/\n    \"Rtree\",                        \/*tp_name*\/\n    sizeof(Rtree),                  \/*tp_basicsize*\/\n    0,                              \/*tp_itemsize*\/\n    (destructor)Rtree_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    0,                              \/*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 | Py_TPFLAGS_BASETYPE, \/*tp_flags*\/\n    \"R-tree spatial index\",       \/* tp_doc *\/\n    0,\t\t               \/* tp_traverse *\/\n    0,\t\t               \/* tp_clear *\/\n    0,\t\t               \/* tp_richcompare *\/\n    0,\t\t               \/* tp_weaklistoffset *\/\n    0,\t\t               \/* tp_iter *\/\n    0,\t\t               \/* tp_iternext *\/\n    module_methods,             \/* 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    (initproc)Rtree_init,       \/* tp_init *\/\n    0,                         \/* tp_alloc *\/\n    PyType_GenericNew,         \/* tp_new *\/\n};\n\n\/* Initialization *\/\n\n#ifndef PyMODINIT_FUNC\t\/* declarations for DLL import\/export *\/\n#define PyMODINIT_FUNC void\n#endif\nPyMODINIT_FUNC\ninit_rtree(void) \n{\n    PyObject* m;\n    if (PyType_Ready(&RtreeType) < 0)\n        return;\n    m = Py_InitModule3(\"_rtree\", module_methods,\n                       \"R-tree spatial index.\");\n    if (m == NULL)\n      return;\n\n    Py_INCREF(&RtreeType);\n    PyModule_AddObject(m, \"Rtree\", (PyObject *)&RtreeType);\n\n}\n\n<commit_msg>turn off index validation, as it seems to be inconsistent<commit_after>\/*\n# =============================================================================\n# Rtree spatial index. Copyright (C) 2007 Sean C. Gillies\n#\n# This library 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\n# Software Foundation; either version 2.1 of the License, or (at your option)\n# 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 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 \n# along with this library; if not, write to the Free Software Foundation, Inc.,\n# 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA\n#\n# Contact email: sgillies@frii.com\n# =============================================================================\n*\/\n\n#include <Python.h>\n#include \"wrapper.h\"\n\ntypedef struct {\n    PyObject_HEAD\n    RtreeIndex index;\n} Rtree;\n\n\/* Alloc\/dealloc *\/\n\nstatic void\nRtree_dealloc(Rtree *self)\n{\n    RtreeIndex_del(self->index);\n\n    self->ob_type->tp_free((PyObject*) self);\n}\n\nstatic int\nRtree_init(Rtree *self, PyObject *args, PyObject *kwds)\n{\n    char* basename = NULL;\n    char filename[256];\n    unsigned long nPageLength = 0;\n    int overwrite = 0;\n    int load = -1;\n    PyObject *os_module;\n    PyObject *path_module;\n    PyObject *abspath, *dirname;\n    PyObject *func;\n\n    static char *kwlist[] = {\"basename\", \"pagesize\", \"overwrite\", NULL};\n\n    if (!PyArg_ParseTupleAndKeywords(\n            args, kwds, \"|sii\", kwlist,\n            &basename, (unsigned long)&nPageLength, &overwrite\n            )\n        )\n        return -1;\n\n    \/\/ Import os and os.path\n    os_module = PyImport_ImportModule(\"os\");\n    path_module = PyImport_ImportModule(\"os.path\");\n\n    if (basename)\n    {\n        snprintf(filename, 256, \"%s.dat\", basename);\n \n        \/\/ Bail out if we don't have write access\n        func = PyObject_GetAttrString(path_module, \"abspath\");\n        abspath = PyObject_CallFunction(func, \"s\", filename);\n        func = PyObject_GetAttrString(path_module, \"dirname\");\n        dirname = PyObject_CallFunctionObjArgs(func, abspath, NULL);\n\n        func = PyObject_GetAttrString(os_module, \"access\");\n        if (!PyObject_IsTrue(PyObject_CallFunctionObjArgs(func, dirname, PyObject_GetAttrString(os_module, \"W_OK\"), NULL)))\n        {\n            PyErr_Format(PyExc_IOError,\n                \"Unable to open file '%s' for index storage\",\n                basename\n                );\n            return -1;\n        }\n\n        \/\/ Check for existence with os.path.exists\n        func = PyObject_GetAttrString(path_module, \"exists\");\n        if (PyObject_IsTrue(PyObject_CallFunction(func, \"s\", filename)))\n        {\n            if (overwrite == 0)\n                load = 1;\n            else\n                load = 0;\n        }\n        else\n            load = 0;\n    }\n\n    self->index = RtreeIndex_new(basename, nPageLength, load);\n    \n\/\/    if (RtreeIndex_isValid(self->index) != 1) {\n\/\/        PyErr_Format(PyExc_IOError,\n\/\/            \"Index layout is invalid\"\n\/\/            );\n\/\/        return -1;\n\/\/\t}\n    return 0;\n}\n\n\/* Methods *\/\n\nstatic PyObject *\nRtree_add(Rtree *self, PyObject *args)\n{\n    double min[2], max[2];\n    long id;\n    int size;\n    PyObject *bounds=NULL;\n\n    if (!PyArg_ParseTuple(args, \"lO\", &id, &bounds))\n        return NULL;\n\n    \/* Check length of the bounds argument *\/\n    if (!PySequence_Check(bounds))\n    {\n        PyErr_SetString(PyExc_TypeError, \"Bounds must be a sequence\");\n        return NULL;\n    }\n\n    size = (int) PySequence_Size(bounds);\n    if (size == 2)\n    {\n        min[0] = max[0] = PyFloat_AsDouble(PySequence_ITEM(bounds, 0));\n        min[1] = max[1] = PyFloat_AsDouble(PySequence_ITEM(bounds, 1));\n    }\n    else if (size == 4)\n    {\n        min[0] = PyFloat_AsDouble(PySequence_ITEM(bounds, 0));\n        min[1] = PyFloat_AsDouble(PySequence_ITEM(bounds, 1));\n        max[0] = PyFloat_AsDouble(PySequence_ITEM(bounds, 2));\n        max[1] = PyFloat_AsDouble(PySequence_ITEM(bounds, 3));\n    }\n    else\n    {\n        PyErr_Format(PyExc_TypeError,\n            \"Bounds argument must be sequence of length 2 or 4, not %d\",\n            size);\n        return NULL;\n    }\n  \n    if (RtreeIndex_insertData(self->index, id, min, max) ) {\n        Py_INCREF(Py_None);\n        return Py_None;        \n    } else {\n        return NULL;\n    }\n    \n    \n\n}\n\nstatic PyObject *\nRtree_deleteData(Rtree *self, PyObject *args)\n{\n    double min[2], max[2];\n    long id;\n    int size;\n    PyObject *bounds=NULL;\n\n    if (!PyArg_ParseTuple(args, \"lO\", &id, &bounds))\n        return NULL;\n\n    \/* Check length of the bounds argument *\/\n    if (!PySequence_Check(bounds))\n    {\n        PyErr_SetString(PyExc_TypeError, \"Bounds must be a sequence\");\n        return NULL;\n    }\n\n    size = (int) PySequence_Size(bounds);\n    if (size == 2)\n    {\n        min[0] = max[0] = PyFloat_AsDouble(PySequence_ITEM(bounds, 0));\n        min[1] = max[1] = PyFloat_AsDouble(PySequence_ITEM(bounds, 1));\n    }\n    else if (size == 4)\n    {\n        min[0] = PyFloat_AsDouble(PySequence_ITEM(bounds, 0));\n        min[1] = PyFloat_AsDouble(PySequence_ITEM(bounds, 1));\n        max[0] = PyFloat_AsDouble(PySequence_ITEM(bounds, 2));\n        max[1] = PyFloat_AsDouble(PySequence_ITEM(bounds, 3));\n    }\n    else\n    {\n        PyErr_Format(PyExc_TypeError,\n            \"Bounds argument must be sequence of length 2 or 4, not %d\",\n            size);\n        return NULL;\n    }\n  \n    \n    if (RtreeIndex_deleteData(self->index, id, min, max) ) {\n        Py_INCREF(Py_None);\n        return Py_None;        \n    } else {\n        return NULL;\n    }    \n\n}\n\nstatic PyObject *\nRtree_intersection(Rtree *self, PyObject *args)\n{\n    double min[2], max[2];\n\n    if (!PyArg_ParseTuple(args, \"(dddd)\", &min[0], &min[1], &max[0], &max[1]))\n        return NULL;\n    \n    return RtreeIndex_intersects(self->index, min, max);\n}\n\nstatic PyObject *\nRtree_nearsetNeighbors(Rtree *self, PyObject *args)\n{\n\n    double min[2], max[2];\n    uint32_t num_results;\n    int size;\n    \n    PyObject *bounds=NULL;\n\n    if (!PyArg_ParseTuple(args, \"Ol\", &bounds, &num_results))\n        return NULL;\n\n        \n    \/* Check length of the bounds argument *\/\n    if (!PySequence_Check(bounds))\n    {\n        PyErr_SetString(PyExc_TypeError, \"Bounds must be a sequence\");\n        return NULL;\n    }\n\n    size = (int) PySequence_Size(bounds);\n    if (size == 2)\n    {\n        min[0] = max[0] = PyFloat_AsDouble(PySequence_ITEM(bounds, 0));\n        min[1] = max[1] = PyFloat_AsDouble(PySequence_ITEM(bounds, 1));\n    }\n    else if (size == 4)\n    {\n        min[0] = PyFloat_AsDouble(PySequence_ITEM(bounds, 0));\n        min[1] = PyFloat_AsDouble(PySequence_ITEM(bounds, 1));\n        max[0] = PyFloat_AsDouble(PySequence_ITEM(bounds, 2));\n        max[1] = PyFloat_AsDouble(PySequence_ITEM(bounds, 3));\n    }\n    else\n    {\n        PyErr_Format(PyExc_TypeError,\n            \"Bounds argument must be sequence of length 2 or 4, not %d\",\n            size);\n        return NULL;\n    }\n\n    return RtreeIndex_nearestNeighbors(self->index, num_results, min, max);\n}\n\n\/* Define Methods *\/\n\nstatic PyMethodDef module_methods[] = {\n    {\"add\", (PyCFunction)Rtree_add, METH_VARARGS, \"Add an item to an index, specifying an integer id and a bounding box\"},\n    {\"intersection\", (PyCFunction)Rtree_intersection, METH_VARARGS, \"Return an iterator over integer ids of items that are likely to intersect with the specified bounding box.\"},\n    {\"nearest\", (PyCFunction)Rtree_nearsetNeighbors, METH_VARARGS, \"Return an iterator over integer ids of items that are near the specified bounding box.\"},\n    {\"delete\", (PyCFunction)Rtree_deleteData, METH_VARARGS, \"Deletes a member from the index with a given id and bounding box.\"},\n    {NULL}\n};\n\n\/* Define Type *\/\n\nstatic PyTypeObject RtreeType = {\n    PyObject_HEAD_INIT(NULL)\n    0,                              \/*ob_size*\/\n    \"Rtree\",                        \/*tp_name*\/\n    sizeof(Rtree),                  \/*tp_basicsize*\/\n    0,                              \/*tp_itemsize*\/\n    (destructor)Rtree_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    0,                              \/*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 | Py_TPFLAGS_BASETYPE, \/*tp_flags*\/\n    \"R-tree spatial index\",       \/* tp_doc *\/\n    0,\t\t               \/* tp_traverse *\/\n    0,\t\t               \/* tp_clear *\/\n    0,\t\t               \/* tp_richcompare *\/\n    0,\t\t               \/* tp_weaklistoffset *\/\n    0,\t\t               \/* tp_iter *\/\n    0,\t\t               \/* tp_iternext *\/\n    module_methods,             \/* 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    (initproc)Rtree_init,       \/* tp_init *\/\n    0,                         \/* tp_alloc *\/\n    PyType_GenericNew,         \/* tp_new *\/\n};\n\n\/* Initialization *\/\n\n#ifndef PyMODINIT_FUNC\t\/* declarations for DLL import\/export *\/\n#define PyMODINIT_FUNC void\n#endif\nPyMODINIT_FUNC\ninit_rtree(void) \n{\n    PyObject* m;\n    if (PyType_Ready(&RtreeType) < 0)\n        return;\n    m = Py_InitModule3(\"_rtree\", module_methods,\n                       \"R-tree spatial index.\");\n    if (m == NULL)\n      return;\n\n    Py_INCREF(&RtreeType);\n    PyModule_AddObject(m, \"Rtree\", (PyObject *)&RtreeType);\n\n}\n\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\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  m_NavigationContext(),\n  m_MouseContext(),\n  m_IsotropicZoom(1)\n{\n  \/\/ TODO: Remove later because initialized in struct's default constructor and resizeEvent().\n  this->InitializeContext(1,1);\n}\n\n\/*****************************************************************************\/\nImageViewManipulator\n::~ImageViewManipulator()\n{\n}\n\n\/*******************************************************************************\/\nvoid\nImageViewManipulator\n::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.m_ViewportImageRegion.SetSize(initialSize);\n}\n\n\/******************************************************************************\/\nvoid\nImageViewManipulator\n::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  \/\/ Update the context with the pressed position for the mouseMoveEvent\n  m_MouseContext.xMove = event->x();\n  m_MouseContext.yMove = event->y();\n}\n\n\/******************************************************************************\/\nvoid\nImageViewManipulator\n::mouseMoveEvent( QMouseEvent * event)\n{\n  \/\/ Update the mouse context\n  m_MouseContext.dx = -event->x() + m_MouseContext.xMove;\n  m_MouseContext.dy = -event->y() + m_MouseContext.yMove;\n\n  \/\/ Update the navigation context\n  ImageRegionType & currentRegion = m_NavigationContext.m_ViewportImageRegion;\n\n  \/\/ Apply the offset to the (start) index of the stored region\n  ImageRegionType::OffsetType offset;\n  offset[0] = m_MouseContext.dx\/ m_IsotropicZoom;\n  offset[1] = m_MouseContext.dy\/m_IsotropicZoom;\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  \/\/ Constraint the region to the largestPossibleRegion\n  this->ConstrainRegion(currentRegion, m_NavigationContext.m_ModelImageRegion);\n\n  \/\/ Update the position of the first press to take into account the\n  \/\/ last drag\n  m_MouseContext.xMove -=  m_MouseContext.dx;\n  m_MouseContext.yMove -=  m_MouseContext.dy;\n}\n\n\/******************************************************************************\/\nvoid\nImageViewManipulator\n::mouseReleaseEvent(  QMouseEvent * event)\n{\n  \/\/TODO: Implement mouseReleaseEvent.\n  \/\/std::cout <<\" Not Implemented yet ...\" << std::endl;\n}\n\n\/******************************************************************************\/\nvoid ImageViewManipulator\n::resizeEvent( QResizeEvent * event )\n{\n  \/\/ Update the navigation context\n  ImageRegionType & currentRegion = m_NavigationContext.m_ViewportImageRegion;\n\n  \/\/ Get the new widget size\n  ImageRegionType::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\n  \/\/ Recompute the size before\n  m_NavigationContext.m_SizeXBeforeConstrain = (double)size[0] \/ this->GetIsotropicZoom();\n  m_NavigationContext.m_SizeYBeforeConstrain = (double)size[1] \/ this->GetIsotropicZoom();\n  \n  \/\/ Constraint this region to the LargestPossibleRegion\n  this->ConstrainRegion(currentRegion, m_NavigationContext.m_ModelImageRegion);\n\n  \/\/ call the rescale method with the same zoom as before (scale = 1)\n  this->Zoom(1.);\n}\n\n\/******************************************************************************\/\nvoid\nImageViewManipulator\n::wheelEvent(  QWheelEvent * event)\n{\n  \/\/ Compute the new scale\n  double scaleRatio = 2;\n  double numDegrees = event->delta() \/ 8.;\n  int    nbSteps    = static_cast<int>(numDegrees \/ 15.);\n\n  double scale = vcl_pow(scaleRatio, nbSteps);\n\n  \/\/ rescale the viewport region\n  this->Zoom(scale);\n}\n\n\/******************************************************************************\/\nvoid\nImageViewManipulator\n::Zoom(const double scale)\n{\n  \/\/ compute the new size\n  double sizeX = m_NavigationContext.m_SizeXBeforeConstrain \/ scale;\n  double sizeY = m_NavigationContext.m_SizeYBeforeConstrain \/ scale;\n  \n  \/\/ check that the new size is greater than 30x30\n  \/\/ check that the new isoZoom is not too low and not too large\n  \/\/ TODO : compute automatically the minSize and the isoZoom range ???\n  if (sizeX > 30 && sizeY > 30  &&\n      m_IsotropicZoom * scale > 0.2 &&\n      m_IsotropicZoom * scale < 10.)\n    {\n    \/\/ Update the the sizeBeforeConstrain\n    m_NavigationContext.m_SizeXBeforeConstrain = sizeX;\n    m_NavigationContext.m_SizeYBeforeConstrain = sizeY;\n\n    \/\/ Update the viewort region with the new size\n    ImageRegionType::SizeType size;\n    size[0] = static_cast<unsigned int>(sizeX);\n    size[1] = static_cast<unsigned int>(sizeY);\n\n    \/\/ The viewPort Region must be adapted to this zoom ratio\n    ImageRegionType & currentRegion = m_NavigationContext.m_ViewportImageRegion;\n \n    \/\/ Update the stored region with the new size\n    currentRegion.SetSize(size);\n    \n    \/\/ Constraint this region to the LargestPossibleRegion\n    this->ConstrainRegion(currentRegion, m_NavigationContext.m_ModelImageRegion);\n\n    \/\/ Update the isotropicZoom\n    m_IsotropicZoom *= scale;\n    }\n}\n\n\/******************************************************************************\/\nvoid\nImageViewManipulator\n::ConstrainRegion( ImageRegionType& region, const ImageRegionType& largest)\n{\n  ImageRegionType::SizeType zeroSize;\n  zeroSize.Fill(0);\n  \n  if (largest.GetSize() != zeroSize)\n    {\n    \/\/ Else we can constrain it\n    IndexType                     index = region.GetIndex();\n    ImageRegionType::SizeType size = region.GetSize();\n\n    \/\/ If region is larger than big, then crop\n    if (region.GetSize()[0] > largest.GetSize()[0])\n      {\n      size[0] = largest.GetSize()[0];\n      }\n    if (region.GetSize()[1] > largest.GetSize()[1])\n      {\n      size[1] = largest.GetSize()[1];\n      }\n\n    \/\/ Else we can constrain it\n    \/\/ For each dimension\n    for (unsigned int dim = 0; dim < ImageRegionType::ImageDimension; ++dim)\n      {\n      \/\/ push left if necessary\n      if (region.GetIndex()[dim] < largest.GetIndex()[dim])\n        {\n        index[dim] = largest.GetIndex()[dim];\n        }\n      \/\/ push right if necessary\n      if (index[dim] + size[dim] >= largest.GetIndex()[dim] + largest.GetSize()[dim])\n        {\n        index[dim] = largest.GetIndex()[dim] + largest.GetSize()[dim] - size[dim];\n        }\n      }\n    region.SetSize(size);\n    region.SetIndex(index);\n    }\n}\n\n\/*****************************************************************************\/\n\/* SLOTS                                                                     *\/\n\/*****************************************************************************\/\n\n\/*****************************************************************************\/\n\n} \/\/ end namespace 'mvd'\n<commit_msg>ENH: change the scale ratio steps<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  m_NavigationContext(),\n  m_MouseContext(),\n  m_IsotropicZoom(1)\n{\n  \/\/ TODO: Remove later because initialized in struct's default constructor and resizeEvent().\n  this->InitializeContext(1,1);\n}\n\n\/*****************************************************************************\/\nImageViewManipulator\n::~ImageViewManipulator()\n{\n}\n\n\/*******************************************************************************\/\nvoid\nImageViewManipulator\n::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.m_ViewportImageRegion.SetSize(initialSize);\n}\n\n\/******************************************************************************\/\nvoid\nImageViewManipulator\n::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  \/\/ Update the context with the pressed position for the mouseMoveEvent\n  m_MouseContext.xMove = event->x();\n  m_MouseContext.yMove = event->y();\n}\n\n\/******************************************************************************\/\nvoid\nImageViewManipulator\n::mouseMoveEvent( QMouseEvent * event)\n{\n  \/\/ Update the mouse context\n  m_MouseContext.dx = -event->x() + m_MouseContext.xMove;\n  m_MouseContext.dy = -event->y() + m_MouseContext.yMove;\n\n  \/\/ Update the navigation context\n  ImageRegionType & currentRegion = m_NavigationContext.m_ViewportImageRegion;\n\n  \/\/ Apply the offset to the (start) index of the stored region\n  ImageRegionType::OffsetType offset;\n  offset[0] = m_MouseContext.dx\/ m_IsotropicZoom;\n  offset[1] = m_MouseContext.dy\/m_IsotropicZoom;\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  \/\/ Constraint the region to the largestPossibleRegion\n  this->ConstrainRegion(currentRegion, m_NavigationContext.m_ModelImageRegion);\n\n  \/\/ Update the position of the first press to take into account the\n  \/\/ last drag\n  m_MouseContext.xMove -=  m_MouseContext.dx;\n  m_MouseContext.yMove -=  m_MouseContext.dy;\n}\n\n\/******************************************************************************\/\nvoid\nImageViewManipulator\n::mouseReleaseEvent(  QMouseEvent * event)\n{\n  \/\/TODO: Implement mouseReleaseEvent.\n  \/\/std::cout <<\" Not Implemented yet ...\" << std::endl;\n}\n\n\/******************************************************************************\/\nvoid ImageViewManipulator\n::resizeEvent( QResizeEvent * event )\n{\n  \/\/ Update the navigation context\n  ImageRegionType & currentRegion = m_NavigationContext.m_ViewportImageRegion;\n\n  \/\/ Get the new widget size\n  ImageRegionType::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\n  \/\/ Recompute the size before\n  m_NavigationContext.m_SizeXBeforeConstrain = (double)size[0] \/ this->GetIsotropicZoom();\n  m_NavigationContext.m_SizeYBeforeConstrain = (double)size[1] \/ this->GetIsotropicZoom();\n  \n  \/\/ Constraint this region to the LargestPossibleRegion\n  this->ConstrainRegion(currentRegion, m_NavigationContext.m_ModelImageRegion);\n\n  \/\/ call the rescale method with the same zoom as before (scale = 1)\n  this->Zoom(1.);\n}\n\n\/******************************************************************************\/\nvoid\nImageViewManipulator\n::wheelEvent(  QWheelEvent * event)\n{\n  \/\/ Compute the new scale\n  double scaleRatio = 1.25;\n  double numDegrees = event->delta() \/ 8.;\n  int    nbSteps    = static_cast<int>(numDegrees \/ 15.);\n\n  double scale = vcl_pow(scaleRatio, nbSteps);\n\n  \/\/ rescale the viewport region\n  this->Zoom(scale);\n}\n\n\/******************************************************************************\/\nvoid\nImageViewManipulator\n::Zoom(const double scale)\n{\n  \/\/ compute the new size\n  double sizeX = m_NavigationContext.m_SizeXBeforeConstrain \/ scale;\n  double sizeY = m_NavigationContext.m_SizeYBeforeConstrain \/ scale;\n  \n  \/\/ check that the new size is greater than 30x30\n  \/\/ check that the new isoZoom is not too low and not too large\n  \/\/ TODO : compute automatically the minSize and the isoZoom range ???\n  if (sizeX > 30 && sizeY > 30  &&\n      m_IsotropicZoom * scale > 0.01 &&\n      m_IsotropicZoom * scale < 10.)\n    {\n    \/\/ Update the the sizeBeforeConstrain\n    m_NavigationContext.m_SizeXBeforeConstrain = sizeX;\n    m_NavigationContext.m_SizeYBeforeConstrain = sizeY;\n\n    \/\/ Update the viewort region with the new size\n    ImageRegionType::SizeType size;\n    size[0] = static_cast<unsigned int>(sizeX);\n    size[1] = static_cast<unsigned int>(sizeY);\n\n    \/\/ The viewPort Region must be adapted to this zoom ratio\n    ImageRegionType & currentRegion = m_NavigationContext.m_ViewportImageRegion;\n \n    \/\/ Update the stored region with the new size\n    currentRegion.SetSize(size);\n    \n    \/\/ Constraint this region to the LargestPossibleRegion\n    this->ConstrainRegion(currentRegion, m_NavigationContext.m_ModelImageRegion);\n\n    \/\/ Update the isotropicZoom\n    m_IsotropicZoom *= scale;\n    }\n}\n\n\/******************************************************************************\/\nvoid\nImageViewManipulator\n::ConstrainRegion( ImageRegionType& region, const ImageRegionType& largest)\n{\n  ImageRegionType::SizeType zeroSize;\n  zeroSize.Fill(0);\n  \n  if (largest.GetSize() != zeroSize)\n    {\n    \/\/ Else we can constrain it\n    IndexType                     index = region.GetIndex();\n    ImageRegionType::SizeType size = region.GetSize();\n\n    \/\/ If region is larger than big, then crop\n    if (region.GetSize()[0] > largest.GetSize()[0])\n      {\n      size[0] = largest.GetSize()[0];\n      }\n    if (region.GetSize()[1] > largest.GetSize()[1])\n      {\n      size[1] = largest.GetSize()[1];\n      }\n\n    \/\/ Else we can constrain it\n    \/\/ For each dimension\n    for (unsigned int dim = 0; dim < ImageRegionType::ImageDimension; ++dim)\n      {\n      \/\/ push left if necessary\n      if (region.GetIndex()[dim] < largest.GetIndex()[dim])\n        {\n        index[dim] = largest.GetIndex()[dim];\n        }\n      \/\/ push right if necessary\n      if (index[dim] + size[dim] >= largest.GetIndex()[dim] + largest.GetSize()[dim])\n        {\n        index[dim] = largest.GetIndex()[dim] + largest.GetSize()[dim] - size[dim];\n        }\n      }\n    region.SetSize(size);\n    region.SetIndex(index);\n    }\n}\n\n\/*****************************************************************************\/\n\/* SLOTS                                                                     *\/\n\/*****************************************************************************\/\n\n\/*****************************************************************************\/\n\n} \/\/ end namespace 'mvd'\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#include \"stdafx.h\"\n\n#include <sstream>\n\n#include <zorba\/zorba_exception.h>\n#include <zorba\/xquery_warning.h>\n\n#include \"util\/indent.h\"\n#include \"util\/omanip.h\"\n#include \"zorbamisc\/ns_consts.h\"\n\n#include \"dict.h\"\n\n#ifndef NDEBUG\n#include <cstdlib>                      \/* for abort() *\/\nZORBA_DLL_PUBLIC bool g_abort_on_error;\n#endif \/* NDEBUG *\/\n\n#define if_inc_indent if_do( do_indent, inc_indent )\n#define if_dec_indent if_do( do_indent, dec_indent )\n\n#undef if_nl\n#define if_nl if_emit( do_indent, '\\n' )\n\nusing namespace std;\n\nnamespace zorba {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ninline bool is_warning( Diagnostic const &d ) {\n  return !!dynamic_cast<ZorbaWarningCode const*>( &d );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nZorbaException::ZorbaException( Diagnostic const &diagnostic,\n                                char const *raise_file, line_type raise_line,\n                                char const *message ) :\n  diagnostic_( diagnostic.clone() ),\n  raise_file_( raise_file ),\n  raise_line_( raise_line ),\n  message_( message )\n{\n#ifndef NDEBUG\n  if ( g_abort_on_error )\n    abort();\n#endif \/* NDEBUG *\/\n}\n\nZorbaException::ZorbaException( ZorbaException const &from ) :\n  std::exception( from ),\n  diagnostic_( from.diagnostic_->clone() ),\n  raise_file_( from.raise_file_ ),\n  raise_line_( from.raise_line_ ),\n  message_( from.message_ )\n{\n}\n\nZorbaException::ZorbaException( serialization::Archiver& ) \n{\n}\n\nZorbaException::~ZorbaException() throw() {\n  diagnostic_->destroy();\n}\n\nZorbaException& ZorbaException::operator=( ZorbaException const &from ) {\n  if ( &from != this ) {\n    std::exception::operator=( from );\n    diagnostic_->destroy();\n    diagnostic_ = from.diagnostic_->clone();\n    raise_file_ = from.raise_file_;\n    raise_line_ = from.raise_line_;\n    message_    = from.message_;\n  }\n  return *this;\n}\n\nunique_ptr<ZorbaException> ZorbaException::clone() const {\n  return unique_ptr<ZorbaException>( new ZorbaException( *this ) );\n}\n\nint ZorbaException::get_ios_format_index() {\n  static int const index = ios_base::xalloc();\n  return index;\n}\n\nvoid ZorbaException::polymorphic_throw() const {\n  throw *this;\n}\n\nostream& ZorbaException::print( ostream& o ) const {\n  print_format const format = get_print_format( o );\n  bool const as_xml = format != format_text;\n  bool const do_indent = format == format_xml_indented;\n  if ( as_xml ) {\n    o << \"<exception xmlns=\\\"\"\n      << (is_warning( diagnostic() ) ? ZORBA_WARN_NS : ZORBA_ERR_NS)\n      << \"\\\">\" << if_nl << if_inc_indent;\n  }\n  print_impl( o );\n  if ( as_xml )\n    o << if_dec_indent << \"<\/exception>\";\n  return o;\n}\n\nostream& ZorbaException::print_impl( ostream &o ) const {\n  Diagnostic const &d = diagnostic();\n  print_format const format = get_print_format( o );\n  bool const as_xml = format != format_text;\n  bool const do_indent = format == format_xml_indented;\n\n  if ( as_xml ) {\n    diagnostic::QName const &q = d.qname();\n    o << indent << \"<kind>\" << d.kind() << \"<\/kind>\" << if_nl\n      << indent << \"<code>\" << q.ns() << '#' << q.localname() << \"<\/code>\"\n      << if_nl;\n  } else {\n    \/\/\n    \/\/ We need to create an error phrase (e.g., \"static error\") and look that\n    \/\/ up as a unit rather than looking up the error kind word and \"error\"\n    \/\/ separately because many languages have the word order reversed (e.g.,\n    \/\/ \"static error\" becomes \"erreur statique\" in French).\n    \/\/\n    ostringstream oss;\n    oss << ZED_PREFIX;\n\n    streampos pos = oss.tellp();\n    oss << d.category();\n    if ( oss.tellp() != pos )           \/\/ emit ' ' only if non-empty category\n      oss << ' ';\n\n    if ( diagnostic::kind const k = d.kind() )\n      oss << k << ' ';\n\n    oss << (is_warning( d ) ? \"warning\" : \"error\");\n    o << diagnostic::dict::lookup( oss.str() ) << \" [\" << d.qname() << ']';\n  }\n\n  if ( char const *const w = what() )\n    if ( *w ) {\n      if ( as_xml )\n        o << indent << \"<message>\" << w << \"<\/message>\" << if_nl;\n      else\n        o << \": \" << w;\n    }\n\n#ifndef NDEBUG\n  if ( as_xml )\n    o << indent << \"<raised-at file=\\\"\" << raise_file()\n      << \"\\\" line=\\\"\" << raise_line() << \"\\\"\/>\" << if_nl;\n  else\n    o << \"; raised at \" << raise_file() << ':' << raise_line();\n#endif\n\n  return o;\n}\n\nchar const* ZorbaException::what() const throw() {\n  return message_.c_str();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nZorbaException\nmake_zorba_exception( char const *raise_file,\n                      ZorbaException::line_type raise_line,\n                      Diagnostic const &diagnostic,\n                      internal::diagnostic::parameters const &params ) {\n  internal::diagnostic::parameters::value_type message( diagnostic.message() );\n  params.substitute( &message );\n  return ZorbaException( diagnostic, raise_file, raise_line, message.c_str() );\n}\n\nZorbaException*\nnew_zorba_exception( char const *raise_file,\n                     ZorbaException::line_type raise_line,\n                     Diagnostic const &diagnostic,\n                     internal::diagnostic::parameters const &params ) {\n  internal::diagnostic::parameters::value_type message( diagnostic.message() );\n  params.substitute( &message );\n  return new ZorbaException(\n    diagnostic, raise_file, raise_line, message.c_str()\n  );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n} \/\/ namespace zorba\n\/* vim:set et sw=2 ts=2: *\/\n<commit_msg>Now using \"namespace\" and \"local-name\".<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#include \"stdafx.h\"\n\n#include <sstream>\n\n#include <zorba\/zorba_exception.h>\n#include <zorba\/xquery_warning.h>\n\n#include \"util\/indent.h\"\n#include \"util\/omanip.h\"\n#include \"zorbamisc\/ns_consts.h\"\n\n#include \"dict.h\"\n\n#ifndef NDEBUG\n#include <cstdlib>                      \/* for abort() *\/\nZORBA_DLL_PUBLIC bool g_abort_on_error;\n#endif \/* NDEBUG *\/\n\n#define if_inc_indent if_do( do_indent, inc_indent )\n#define if_dec_indent if_do( do_indent, dec_indent )\n\n#undef if_nl\n#define if_nl if_emit( do_indent, '\\n' )\n\nusing namespace std;\n\nnamespace zorba {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ninline bool is_warning( Diagnostic const &d ) {\n  return !!dynamic_cast<ZorbaWarningCode const*>( &d );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nZorbaException::ZorbaException( Diagnostic const &diagnostic,\n                                char const *raise_file, line_type raise_line,\n                                char const *message ) :\n  diagnostic_( diagnostic.clone() ),\n  raise_file_( raise_file ),\n  raise_line_( raise_line ),\n  message_( message )\n{\n#ifndef NDEBUG\n  if ( g_abort_on_error )\n    abort();\n#endif \/* NDEBUG *\/\n}\n\nZorbaException::ZorbaException( ZorbaException const &from ) :\n  std::exception( from ),\n  diagnostic_( from.diagnostic_->clone() ),\n  raise_file_( from.raise_file_ ),\n  raise_line_( from.raise_line_ ),\n  message_( from.message_ )\n{\n}\n\nZorbaException::ZorbaException( serialization::Archiver& ) \n{\n}\n\nZorbaException::~ZorbaException() throw() {\n  diagnostic_->destroy();\n}\n\nZorbaException& ZorbaException::operator=( ZorbaException const &from ) {\n  if ( &from != this ) {\n    std::exception::operator=( from );\n    diagnostic_->destroy();\n    diagnostic_ = from.diagnostic_->clone();\n    raise_file_ = from.raise_file_;\n    raise_line_ = from.raise_line_;\n    message_    = from.message_;\n  }\n  return *this;\n}\n\nunique_ptr<ZorbaException> ZorbaException::clone() const {\n  return unique_ptr<ZorbaException>( new ZorbaException( *this ) );\n}\n\nint ZorbaException::get_ios_format_index() {\n  static int const index = ios_base::xalloc();\n  return index;\n}\n\nvoid ZorbaException::polymorphic_throw() const {\n  throw *this;\n}\n\nostream& ZorbaException::print( ostream& o ) const {\n  print_format const format = get_print_format( o );\n  bool const as_xml = format != format_text;\n  bool const do_indent = format == format_xml_indented;\n  if ( as_xml ) {\n    o << \"<exception xmlns=\\\"\"\n      << (is_warning( diagnostic() ) ? ZORBA_WARN_NS : ZORBA_ERR_NS)\n      << \"\\\">\" << if_nl << if_inc_indent;\n  }\n  print_impl( o );\n  if ( as_xml )\n    o << if_dec_indent << \"<\/exception>\";\n  return o;\n}\n\nostream& ZorbaException::print_impl( ostream &o ) const {\n  Diagnostic const &d = diagnostic();\n  print_format const format = get_print_format( o );\n  bool const as_xml = format != format_text;\n  bool const do_indent = format == format_xml_indented;\n\n  if ( as_xml ) {\n    diagnostic::QName const &q = d.qname();\n    o << indent << \"<kind>\" << d.kind() << \"<\/kind>\" << if_nl\n      << indent << \"<code namespace=\\\"\" << q.ns()\n      << \"\\\" local-name=\\\"\" << q.localname() << \"\\\"\/>\"\n      << if_nl;\n  } else {\n    \/\/\n    \/\/ We need to create an error phrase (e.g., \"static error\") and look that\n    \/\/ up as a unit rather than looking up the error kind word and \"error\"\n    \/\/ separately because many languages have the word order reversed (e.g.,\n    \/\/ \"static error\" becomes \"erreur statique\" in French).\n    \/\/\n    ostringstream oss;\n    oss << ZED_PREFIX;\n\n    streampos pos = oss.tellp();\n    oss << d.category();\n    if ( oss.tellp() != pos )           \/\/ emit ' ' only if non-empty category\n      oss << ' ';\n\n    if ( diagnostic::kind const k = d.kind() )\n      oss << k << ' ';\n\n    oss << (is_warning( d ) ? \"warning\" : \"error\");\n    o << diagnostic::dict::lookup( oss.str() ) << \" [\" << d.qname() << ']';\n  }\n\n  if ( char const *const w = what() )\n    if ( *w ) {\n      if ( as_xml )\n        o << indent << \"<message>\" << w << \"<\/message>\" << if_nl;\n      else\n        o << \": \" << w;\n    }\n\n#ifndef NDEBUG\n  if ( as_xml )\n    o << indent << \"<raised-at file=\\\"\" << raise_file()\n      << \"\\\" line=\\\"\" << raise_line() << \"\\\"\/>\" << if_nl;\n  else\n    o << \"; raised at \" << raise_file() << ':' << raise_line();\n#endif\n\n  return o;\n}\n\nchar const* ZorbaException::what() const throw() {\n  return message_.c_str();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nZorbaException\nmake_zorba_exception( char const *raise_file,\n                      ZorbaException::line_type raise_line,\n                      Diagnostic const &diagnostic,\n                      internal::diagnostic::parameters const &params ) {\n  internal::diagnostic::parameters::value_type message( diagnostic.message() );\n  params.substitute( &message );\n  return ZorbaException( diagnostic, raise_file, raise_line, message.c_str() );\n}\n\nZorbaException*\nnew_zorba_exception( char const *raise_file,\n                     ZorbaException::line_type raise_line,\n                     Diagnostic const &diagnostic,\n                     internal::diagnostic::parameters const &params ) {\n  internal::diagnostic::parameters::value_type message( diagnostic.message() );\n  params.substitute( &message );\n  return new ZorbaException(\n    diagnostic, raise_file, raise_line, message.c_str()\n  );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n} \/\/ namespace zorba\n\/* vim:set et sw=2 ts=2: *\/\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Enable reordering unit tests for 32-bit builds.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/tree:$Id$\n\/\/ Author: Rene Brun   14\/01\/2001\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 TLeaf for a general object derived from TObject.                   \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"TLeafElement.h\"\n\/\/#include \"TMethodCall.h\"\n\n\nClassImp(TLeafElement)\n\n\/\/______________________________________________________________________________\nTLeafElement::TLeafElement(): TLeaf()\n{\n   \/\/ Default constructor for LeafObject.\n\n   fAbsAddress = 0;\n   fID   = -1;\n   fType = -1;\n}\n\n\/\/______________________________________________________________________________\nTLeafElement::TLeafElement(TBranch *parent, const char *name, Int_t id, Int_t type)\n   :TLeaf(parent, name,name)\n{\n   \/\/ Create a LeafObject.\n   \n   fAbsAddress = 0;\n   fID         = id;\n   fType       = type;\n}\n\n\/\/______________________________________________________________________________\nTLeafElement::~TLeafElement()\n{\n   \/\/ Default destructor for a LeafObject.\n\n}\n\n\/\/______________________________________________________________________________\nTMethodCall *TLeafElement::GetMethodCall(const char * \/*name*\/)\n{\n   \/\/ Returns pointer to method corresponding to name name is a string\n   \/\/ with the general form \"method(list of params)\" If list of params is\n   \/\/ omitted, () is assumed;\n\n   return 0;\n}\n\n\n\/\/______________________________________________________________________________\nBool_t TLeafElement::IsOnTerminalBranch() const\n{\n   \/\/ Return true if this leaf is does not have any sub-branch\/leaf.\n\n   if (fBranch->GetListOfBranches()->GetEntriesFast()) return kFALSE;\n   return kTRUE;\n}\n<commit_msg>Correct documentation<commit_after>\/\/ @(#)root\/tree:$Id$\n\/\/ Author: Rene Brun   14\/01\/2001\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 TLeaf for the general case when using the branches created via     \/\/\n\/\/ a TStreamerInfo (i.e. using TBranchElement).                         \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"TLeafElement.h\"\n\/\/#include \"TMethodCall.h\"\n\n\nClassImp(TLeafElement)\n\n\/\/______________________________________________________________________________\nTLeafElement::TLeafElement(): TLeaf()\n{\n   \/\/ Default constructor for LeafObject.\n\n   fAbsAddress = 0;\n   fID   = -1;\n   fType = -1;\n}\n\n\/\/______________________________________________________________________________\nTLeafElement::TLeafElement(TBranch *parent, const char *name, Int_t id, Int_t type)\n   :TLeaf(parent, name,name)\n{\n   \/\/ Create a LeafObject.\n   \n   fAbsAddress = 0;\n   fID         = id;\n   fType       = type;\n}\n\n\/\/______________________________________________________________________________\nTLeafElement::~TLeafElement()\n{\n   \/\/ Default destructor for a LeafObject.\n\n}\n\n\/\/______________________________________________________________________________\nTMethodCall *TLeafElement::GetMethodCall(const char * \/*name*\/)\n{\n   \/\/ Returns pointer to method corresponding to name name is a string\n   \/\/ with the general form \"method(list of params)\" If list of params is\n   \/\/ omitted, () is assumed;\n\n   return 0;\n}\n\n\n\/\/______________________________________________________________________________\nBool_t TLeafElement::IsOnTerminalBranch() const\n{\n   \/\/ Return true if this leaf is does not have any sub-branch\/leaf.\n\n   if (fBranch->GetListOfBranches()->GetEntriesFast()) return kFALSE;\n   return kTRUE;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"ROOT\/RMakeUnique.hxx\"\n#include \"TInterpreter.h\"\n#include \"TTree.h\"\n#include \"TTreeReader.h\"\n#include \"TTreeReaderValue.h\"\n#include \"TTreeReaderArray.h\"\n\n#include \"gtest\/gtest.h\"\n\n#include \"data.h\"\n\n#include \"RErrorIgnoreRAII.hxx\"\n\nTEST(TTreeReaderLeafs, LeafListCaseA) {\n   \/\/ From \"Case A\" of the TTree class doc:\n   const char* str = \"This is a null-terminated string literal\";\n   signed char SChar = 2;\n   unsigned char UChar = 3;\n   signed short SShort = 4;\n   unsigned short UShort = 5;\n   signed int SInt = 6;\n   unsigned int UInt = 7;\n   float Float = 8.;\n   double Double = 9.;\n   long long SLL = 10;\n   unsigned long long ULL = 11;\n   long SL = 12;\n   unsigned long UL = 13;\n   bool Bool = true;\n\n   auto tree = std::make_unique<TTree>(\"T\", \"In-memory test tree\");\n   tree->Branch(\"C\", &str, \"C\/C\");\n   tree->Branch(\"B\", &SChar, \"B\/B\");\n   tree->Branch(\"b\", &UChar, \"b\/b\");\n   tree->Branch(\"S\", &SShort, \"S\/S\");\n   tree->Branch(\"s\", &UShort, \"s\/s\");\n   tree->Branch(\"I\", &SInt, \"I\/I\");\n   tree->Branch(\"i\", &UInt, \"i\/i\");\n   tree->Branch(\"F\", &Float, \"F\/F\");\n   tree->Branch(\"D\", &Double, \"D\/D\");\n   tree->Branch(\"L\", &SLL, \"L\/L\");\n   tree->Branch(\"l\", &ULL, \"l\/l\");\n   tree->Branch(\"G\", &SL, \"G\/G\");\n   tree->Branch(\"g\", &UL, \"g\/g\");\n   tree->Branch(\"O\", &Bool, \"O\/O\");\n\n   tree->Fill();\n   tree->Fill();\n   tree->Fill();\n\n   TTreeReader TR(tree.get());\n   \/\/TTreeReaderValue<const char*> trStr(TR, \"C\");\n   TTreeReaderValue<signed char> trSChar(TR, \"B\");\n   TTreeReaderValue<unsigned char> trUChar(TR, \"b\");\n   TTreeReaderValue<signed short> trSShort(TR, \"S\");\n   TTreeReaderValue<unsigned short> trUShort(TR, \"s\");\n   TTreeReaderValue<signed int> trSInt(TR, \"I\");\n   TTreeReaderValue<unsigned int> trUInt(TR, \"i\");\n   TTreeReaderValue<float> trFloat(TR, \"F\");\n   TTreeReaderValue<double> trDouble(TR, \"D\");\n   TTreeReaderValue<signed long long> trSLL(TR, \"L\");\n   TTreeReaderValue<unsigned long long> trULL(TR, \"l\");\n   TTreeReaderValue<signed long> trSL(TR, \"G\");\n   TTreeReaderValue<unsigned long> trUL(TR, \"g\");\n   TTreeReaderValue<bool> trBool(TR, \"O\");\n\n   TR.SetEntry(1);\n\n   \/\/EXPECT_STREQ(str, *trStr);\n   EXPECT_EQ(SChar, *trSChar);\n   EXPECT_EQ(UChar, *trUChar);\n   EXPECT_EQ(SShort, *trSShort);\n   EXPECT_EQ(UShort, *trUShort);\n   EXPECT_EQ(SInt, *trSInt);\n   EXPECT_EQ(UInt, *trUInt);\n   EXPECT_FLOAT_EQ(Float, *trFloat);\n   EXPECT_DOUBLE_EQ(Double, *trDouble);\n   EXPECT_EQ(SLL, *trSLL);\n   EXPECT_EQ(ULL, *trULL);\n   EXPECT_EQ(SL, *trSL);\n   EXPECT_EQ(UL, *trUL);\n   EXPECT_EQ(Bool, *trBool);\n}\n\n\n\nstd::unique_ptr<TTree> CreateTree() {\n   TInterpreter::EErrorCode error = TInterpreter::kNoError;\n   gInterpreter->ProcessLine(\"#include \\\"data.h\\\"\", &error);\n   if (error != TInterpreter::kNoError)\n      return {};\n\n   Data data;\n   auto tree = std::make_unique<TTree>(\"T\", \"test tree\");\n   tree->Branch(\"Data\", &data);\n   data.fArray = new double[4]{12., 13., 14., 15.};\n   data.fSize = 4;\n   data.fUArray = new float[2]{42., 43.};\n   data.fUSize = 2;\n   data.fVec = { 17., 18., 19., 20., 21., 22.};\n   data.fDouble32 = 17.;\n   data.fFloat16 = 44.;\n   tree->Fill();\n\n   data.fVec.clear();\n   data.fVec.resize(3210, 1001.f); \/\/ ROOT-8747\n   tree->Fill();\n\n   data.fVec.clear();\n   data.fVec.resize(2, 42.f); \/\/ ROOT-8747\n   tree->Fill();\n\n   tree->ResetBranchAddresses();\n   return tree;\n}\n\nTEST(TTreeReaderLeafs, LeafList) {\n   auto tree = CreateTree();\n   ASSERT_NE(nullptr, tree.get());\n\n   TTreeReader tr(tree.get());\n   TTreeReaderArray<double> arr(tr, \"fArray\");\n   TTreeReaderArray<float> arrU(tr, \"fUArray\");\n   TTreeReaderArray<double> vec(tr, \"fVec\");\n   TTreeReaderValue<Double32_t> d32(tr, \"fDouble32\");\n   TTreeReaderValue<Float16_t> f16(tr, \"fFloat16\");\n\n   tr.Next();\n   EXPECT_EQ(4u, arr.GetSize());\n   EXPECT_EQ(2u, arrU.GetSize());\n   EXPECT_EQ(6u, vec.GetSize());\n   \/\/FAILS EXPECT_FLOAT_EQ(13., arr[1]);\n   \/\/FAILS EXPECT_DOUBLE_EQ(43., arrU[1]);\n   EXPECT_DOUBLE_EQ(19., vec[2]);\n   EXPECT_DOUBLE_EQ(17., vec[0]);\n   \/\/ T->Scan(\"fUArray\") claims fUArray only has one instance per row.\n\n   EXPECT_FLOAT_EQ(17, *d32);\n   EXPECT_FLOAT_EQ(44, *f16);\n\n   tr.Next();\n   EXPECT_FLOAT_EQ(1001.f, vec[1]); \/\/ ROOT-8747\n   EXPECT_EQ(3210u, vec.GetSize());\n\n   tr.Next();\n   EXPECT_FLOAT_EQ(42.f, vec[1]); \/\/ ROOT-8747\n   EXPECT_EQ(2u, vec.GetSize());\n   tree.release();\n}\n\nTEST(TTreeReaderLeafs, TArrayD) {\n   \/\/ https:\/\/root-forum.cern.ch\/t\/tarrayd-in-ttreereadervalue\/24495\n   auto tree = std::make_unique<TTree>(\"TTreeReaderLeafsTArrayD\", \"In-memory test tree\");\n   TArrayD arrD(7);\n   for (int i = 0; i < arrD.GetSize(); ++i)\n      arrD.SetAt(i + 2., i);\n   tree->Branch(\"arrD\", &arrD);\n\n   tree->Fill();\n   tree->Fill();\n   tree->Fill();\n\n   tree->ResetBranchAddresses();\n\n   TTreeReader tr(tree.get());\n   TTreeReaderValue<TArrayD> arr(tr, \"arrD\");\n\n   tr.SetEntry(1);\n\n   EXPECT_EQ(7, arr->GetSize());\n   EXPECT_DOUBLE_EQ(4., (*arr)[2]);\n   EXPECT_DOUBLE_EQ(2., (*arr)[0]);\n}\n\nTEST(TTreeReaderLeafs, ArrayWithReaderValue)\n{\n   \/\/ reading a float[] with a TTreeReaderValue should cause an error\n\n   auto tree = std::make_unique<TTree>(\"arraywithreadervaluetree\", \"test tree\");\n   std::vector<double> arr = {42., 84.};\n   tree->Branch(\"arr\", arr.data(), \"arr[2]\/D\");\n   tree->Fill();\n   tree->ResetBranchAddresses();\n\n   TTreeReader tr(tree.get());\n   TTreeReaderValue<double> valueOfArr(tr, \"arr\");\n   {\n      RErrorIgnoreRAII errorIgnRAII;\n      tr.Next();\n      *valueOfArr;\n   }\n   EXPECT_FALSE(valueOfArr.IsValid());\n}\n\n\nTEST(TTreeReaderLeafs, NamesWithDots)\n{\n   gInterpreter->ProcessLine(\".L data.h+\");\n\n   TTree tree(\"t\", \"t\");\n   V v;\n   v.a = 64;\n   tree.Branch(\"v\", &v, \"a\/I\");\n   W w;\n   w.v.a = 132;\n   tree.Branch(\"w\", &w);\n   tree.Fill();\n\n   TTreeReader tr(&tree);\n   TTreeReaderValue<int> rv(tr, \"v.a\");\n   tr.Next();\n   EXPECT_EQ(*rv, 64) << \"The wrong leaf has been read!\";\n}\n\n\/\/ This is ROOT-9743\nstruct Event {\n   float bla = 3.14f;\n   int truth_type = 1;\n};\n\nTEST(TTreeReaderLeafs, MultipleReaders)\n{\n   TTree t(\"t\", \"t\");\n   Event event;\n   t.Branch(\"event\", &event, \"bla\/F:truth_type\/I\");\n   t.Fill();\n\n   TTreeReader r(&t);\n   TTreeReaderValue<int> v1(r, \"event.truth_type\");\n   TTreeReaderValue<int> v2(r, \"event.truth_type\");\n   TTreeReaderValue<int> v3(r, \"event.truth_type\");\n\n   r.Next();\n   EXPECT_EQ(*v1, 1) << \"Wrong value read for rv1!\";\n   EXPECT_EQ(*v2, 1) << \"Wrong value read for rv2!\";\n   EXPECT_EQ(*v3, 1) << \"Wrong value read for rv3!\";\n}\n\n\/\/ Test for https:\/\/github.com\/root-project\/root\/issues\/6881\nTEST(TTreeReaderLeafs, BranchAndLeafWithDifferentNames)\n{\n   TTree t(\"t\", \"t\");\n   int x = 42;\n   t.Branch(\"x\", &x, \"y\/I\");\n   t.Fill();\n\n   TTreeReader r(&t);\n   TTreeReaderValue<int> rv(r, \"x\");\n   ASSERT_TRUE(r.Next());\n   EXPECT_EQ(*rv, 42);\n   EXPECT_FALSE(r.Next());\n}\n<commit_msg>[treereader] Add a bit more test coverage<commit_after>#include \"ROOT\/RMakeUnique.hxx\"\n#include \"TInterpreter.h\"\n#include \"TTree.h\"\n#include \"TTreeReader.h\"\n#include \"TTreeReaderValue.h\"\n#include \"TTreeReaderArray.h\"\n\n#include \"gtest\/gtest.h\"\n\n#include \"data.h\"\n\n#include \"RErrorIgnoreRAII.hxx\"\n\nTEST(TTreeReaderLeafs, LeafListCaseA) {\n   \/\/ From \"Case A\" of the TTree class doc:\n   const char* str = \"This is a null-terminated string literal\";\n   signed char SChar = 2;\n   unsigned char UChar = 3;\n   signed short SShort = 4;\n   unsigned short UShort = 5;\n   signed int SInt = 6;\n   unsigned int UInt = 7;\n   float Float = 8.;\n   double Double = 9.;\n   long long SLL = 10;\n   unsigned long long ULL = 11;\n   long SL = 12;\n   unsigned long UL = 13;\n   bool Bool = true;\n\n   auto tree = std::make_unique<TTree>(\"T\", \"In-memory test tree\");\n   tree->Branch(\"C\", &str, \"C\/C\");\n   tree->Branch(\"B\", &SChar, \"B\/B\");\n   tree->Branch(\"b\", &UChar, \"b\/b\");\n   tree->Branch(\"S\", &SShort, \"S\/S\");\n   tree->Branch(\"s\", &UShort, \"s\/s\");\n   tree->Branch(\"I\", &SInt, \"I\/I\");\n   tree->Branch(\"i\", &UInt, \"i\/i\");\n   tree->Branch(\"F\", &Float, \"F\/F\");\n   tree->Branch(\"D\", &Double, \"D\/D\");\n   tree->Branch(\"L\", &SLL, \"L\/L\");\n   tree->Branch(\"l\", &ULL, \"l\/l\");\n   tree->Branch(\"G\", &SL, \"G\/G\");\n   tree->Branch(\"g\", &UL, \"g\/g\");\n   tree->Branch(\"O\", &Bool, \"O\/O\");\n\n   tree->Fill();\n   tree->Fill();\n   tree->Fill();\n\n   TTreeReader TR(tree.get());\n   \/\/TTreeReaderValue<const char*> trStr(TR, \"C\");\n   TTreeReaderValue<signed char> trSChar(TR, \"B\");\n   TTreeReaderValue<unsigned char> trUChar(TR, \"b\");\n   TTreeReaderValue<signed short> trSShort(TR, \"S\");\n   TTreeReaderValue<unsigned short> trUShort(TR, \"s\");\n   TTreeReaderValue<signed int> trSInt(TR, \"I\");\n   TTreeReaderValue<unsigned int> trUInt(TR, \"i\");\n   TTreeReaderValue<float> trFloat(TR, \"F\");\n   TTreeReaderValue<double> trDouble(TR, \"D\");\n   TTreeReaderValue<signed long long> trSLL(TR, \"L\");\n   TTreeReaderValue<unsigned long long> trULL(TR, \"l\");\n   TTreeReaderValue<signed long> trSL(TR, \"G\");\n   TTreeReaderValue<unsigned long> trUL(TR, \"g\");\n   TTreeReaderValue<bool> trBool(TR, \"O\");\n\n   TR.SetEntry(1);\n\n   \/\/EXPECT_STREQ(str, *trStr);\n   EXPECT_EQ(SChar, *trSChar);\n   EXPECT_EQ(UChar, *trUChar);\n   EXPECT_EQ(SShort, *trSShort);\n   EXPECT_EQ(UShort, *trUShort);\n   EXPECT_EQ(SInt, *trSInt);\n   EXPECT_EQ(UInt, *trUInt);\n   EXPECT_FLOAT_EQ(Float, *trFloat);\n   EXPECT_DOUBLE_EQ(Double, *trDouble);\n   EXPECT_EQ(SLL, *trSLL);\n   EXPECT_EQ(ULL, *trULL);\n   EXPECT_EQ(SL, *trSL);\n   EXPECT_EQ(UL, *trUL);\n   EXPECT_EQ(Bool, *trBool);\n}\n\n\n\nstd::unique_ptr<TTree> CreateTree() {\n   TInterpreter::EErrorCode error = TInterpreter::kNoError;\n   gInterpreter->ProcessLine(\"#include \\\"data.h\\\"\", &error);\n   if (error != TInterpreter::kNoError)\n      return {};\n\n   Data data;\n   auto tree = std::make_unique<TTree>(\"T\", \"test tree\");\n   tree->Branch(\"Data\", &data);\n   data.fArray = new double[4]{12., 13., 14., 15.};\n   data.fSize = 4;\n   data.fUArray = new float[2]{42., 43.};\n   data.fUSize = 2;\n   data.fVec = { 17., 18., 19., 20., 21., 22.};\n   data.fDouble32 = 17.;\n   data.fFloat16 = 44.;\n   tree->Fill();\n\n   data.fVec.clear();\n   data.fVec.resize(3210, 1001.f); \/\/ ROOT-8747\n   tree->Fill();\n\n   data.fVec.clear();\n   data.fVec.resize(2, 42.f); \/\/ ROOT-8747\n   tree->Fill();\n\n   tree->ResetBranchAddresses();\n   return tree;\n}\n\nTEST(TTreeReaderLeafs, LeafList) {\n   auto tree = CreateTree();\n   ASSERT_NE(nullptr, tree.get());\n\n   TTreeReader tr(tree.get());\n   TTreeReaderArray<double> arr(tr, \"fArray\");\n   TTreeReaderArray<float> arrU(tr, \"fUArray\");\n   TTreeReaderArray<double> vec(tr, \"fVec\");\n   TTreeReaderValue<Double32_t> d32(tr, \"fDouble32\");\n   TTreeReaderValue<Float16_t> f16(tr, \"fFloat16\");\n\n   tr.Next();\n   EXPECT_EQ(4u, arr.GetSize());\n   EXPECT_EQ(2u, arrU.GetSize());\n   EXPECT_EQ(6u, vec.GetSize());\n   \/\/FAILS EXPECT_FLOAT_EQ(13., arr[1]);\n   \/\/FAILS EXPECT_DOUBLE_EQ(43., arrU[1]);\n   EXPECT_DOUBLE_EQ(19., vec[2]);\n   EXPECT_DOUBLE_EQ(17., vec[0]);\n   \/\/ T->Scan(\"fUArray\") claims fUArray only has one instance per row.\n\n   EXPECT_FLOAT_EQ(17, *d32);\n   EXPECT_FLOAT_EQ(44, *f16);\n\n   tr.Next();\n   EXPECT_FLOAT_EQ(1001.f, vec[1]); \/\/ ROOT-8747\n   EXPECT_EQ(3210u, vec.GetSize());\n\n   tr.Next();\n   EXPECT_FLOAT_EQ(42.f, vec[1]); \/\/ ROOT-8747\n   EXPECT_EQ(2u, vec.GetSize());\n   tree.release();\n}\n\nTEST(TTreeReaderLeafs, TArrayD) {\n   \/\/ https:\/\/root-forum.cern.ch\/t\/tarrayd-in-ttreereadervalue\/24495\n   auto tree = std::make_unique<TTree>(\"TTreeReaderLeafsTArrayD\", \"In-memory test tree\");\n   TArrayD arrD(7);\n   for (int i = 0; i < arrD.GetSize(); ++i)\n      arrD.SetAt(i + 2., i);\n   tree->Branch(\"arrD\", &arrD);\n\n   tree->Fill();\n   tree->Fill();\n   tree->Fill();\n\n   tree->ResetBranchAddresses();\n\n   TTreeReader tr(tree.get());\n   TTreeReaderValue<TArrayD> arr(tr, \"arrD\");\n\n   tr.SetEntry(1);\n\n   EXPECT_EQ(7, arr->GetSize());\n   EXPECT_DOUBLE_EQ(4., (*arr)[2]);\n   EXPECT_DOUBLE_EQ(2., (*arr)[0]);\n}\n\nTEST(TTreeReaderLeafs, ArrayWithReaderValue)\n{\n   \/\/ reading a float[] with a TTreeReaderValue should cause an error\n\n   auto tree = std::make_unique<TTree>(\"arraywithreadervaluetree\", \"test tree\");\n   std::vector<double> arr = {42., 84.};\n   tree->Branch(\"arr\", arr.data(), \"arr[2]\/D\");\n   tree->Fill();\n   tree->ResetBranchAddresses();\n\n   TTreeReader tr(tree.get());\n   TTreeReaderValue<double> valueOfArr(tr, \"arr\");\n   {\n      RErrorIgnoreRAII errorIgnRAII;\n      tr.Next();\n      *valueOfArr;\n   }\n   EXPECT_FALSE(valueOfArr.IsValid());\n}\n\n\nTEST(TTreeReaderLeafs, NamesWithDots)\n{\n   gInterpreter->ProcessLine(\".L data.h+\");\n\n   TTree tree(\"t\", \"t\");\n   V v;\n   v.a = 64;\n   tree.Branch(\"v\", &v, \"a\/I\");\n   W w;\n   w.v.a = 132;\n   tree.Branch(\"w\", &w);\n   tree.Fill();\n\n   TTreeReader tr(&tree);\n   TTreeReaderValue<int> rv(tr, \"v.a\");\n   tr.Next();\n   EXPECT_EQ(*rv, 64) << \"The wrong leaf has been read!\";\n}\n\n\/\/ This is ROOT-9743\nstruct Event {\n   float bla = 3.14f;\n   int truth_type = 1;\n};\n\nTEST(TTreeReaderLeafs, MultipleReaders)\n{\n   TTree t(\"t\", \"t\");\n   Event event;\n   t.Branch(\"event\", &event, \"bla\/F:truth_type\/I\");\n   t.Fill();\n\n   TTreeReader r(&t);\n   TTreeReaderValue<int> v1(r, \"event.truth_type\");\n   TTreeReaderValue<int> v2(r, \"event.truth_type\");\n   TTreeReaderValue<int> v3(r, \"event.truth_type\");\n\n   r.Next();\n   EXPECT_EQ(*v1, 1) << \"Wrong value read for rv1!\";\n   EXPECT_EQ(*v2, 1) << \"Wrong value read for rv2!\";\n   EXPECT_EQ(*v3, 1) << \"Wrong value read for rv3!\";\n}\n\n\/\/ Test for https:\/\/github.com\/root-project\/root\/issues\/6881\nTEST(TTreeReaderLeafs, BranchAndLeafWithDifferentNames)\n{\n   TTree t(\"t\", \"t\");\n   int x = 42;\n   t.Branch(\"x\", &x, \"y\/I\");\n   t.Fill();\n\n   TTreeReader r(&t);\n   TTreeReaderValue<int> rv(r, \"x\");\n   TTreeReaderValue<int> rvwithdot(r, \"x.y\");\n   ASSERT_TRUE(r.Next());\n   EXPECT_EQ(*rv, 42);\n   EXPECT_EQ(*rvwithdot, 42);\n   EXPECT_FALSE(r.Next());\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright 2013 - 2016 Yurii Litvinov, Anastasiia Kornilova and CyberTech Labs Ltd.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License. *\/\n\n#include \"powerMotor.h\"\n\n#include <trikKernel\/configurer.h>\n#include <trikKernel\/exceptions\/malformedConfigException.h>\n#include <trikKernel\/exceptions\/internalErrorException.h>\n\n#include \"mspI2cCommunicator.h\"\n#include \"configurerHelper.h\"\n\nusing namespace trikControl;\n\nstatic const int maxControlValue = 100;\nstatic const int minControlValue = -100;\n\nPowerMotor::PowerMotor(const QString &port, const trikKernel::Configurer &configurer\n\t\t, MspCommunicatorInterface &communicator)\n\t: mCommunicator(communicator)\n\t, mInvert(configurer.attributeByPort(port, \"invert\") == \"false\")\n\t, mCurrentPower(0)\n\t, mState(\"Power Motor on\" + port)\n{\n\tmMspCommandNumber = ConfigurerHelper::configureInt(configurer, mState, port, \"i2cCommandNumber\");\n\n\tmCurrentPeriod = ConfigurerHelper::configureInt(configurer, mState, port, \"period\");\n\tsetPeriod(mCurrentPeriod);\n\n\tmPowerMap.reserve(maxControlValue + 1);\n\tlineariseMotor(port, configurer);\n\n\tmState.ready();\n}\n\nPowerMotor::~PowerMotor()\n{\n}\n\nPowerMotor::Status PowerMotor::status() const\n{\n\treturn combine(mCommunicator, mState.status());\n}\n\nvoid PowerMotor::setPower(int power, bool constrain)\n{\n\tif (!constrain) {\n\t\tthrow trikKernel::InternalErrorException(\"Invalid argument\");\n\t}\n\n\tif (power > maxControlValue) {\n\t\tpower = maxControlValue;\n\t} else if (power < minControlValue) {\n\t\tpower = minControlValue;\n\t}\n\n\tmCurrentPower = power;\n\n\tpower = power <= 0 ? -mPowerMap[-power] : mPowerMap[power];\n\n\tpower = mInvert ? -power : power;\n\n\tQByteArray command(3, '\\0');\n\tcommand[0] = static_cast<char>(mMspCommandNumber & 0xFF);\n\tcommand[1] = static_cast<char>((mMspCommandNumber >> 8) & 0xFF);\n\tcommand[2] = static_cast<char>(power & 0xFF);\n\n\tmCommunicator.send(command);\n}\n\nint PowerMotor::power() const\n{\n\treturn mCurrentPower;\n}\n\nint PowerMotor::period() const\n{\n\treturn mCurrentPeriod;\n}\n\nvoid PowerMotor::powerOff()\n{\n\tsetPower(0);\n}\n\nvoid PowerMotor::setPeriod(int period)\n{\n\tmCurrentPeriod = period;\n\tQByteArray command(4, '\\0');\n\tcommand[0] = static_cast<char>((mMspCommandNumber - 4) & 0xFF);\n\tcommand[2] = static_cast<char>(period & 0xFF);\n\tcommand[3] = static_cast<char>(period >> 8);\n\tmCommunicator.send(command);\n}\n\nvoid PowerMotor::lineariseMotor(const QString &port, const trikKernel::Configurer &configurer)\n{\n\tQVector<QPair<double, double>> powerGraph;\n\tfor (const QString &str : configurer.attributeByPort(port, \"measures\").split(\")\")) {\n\t\tif (!str.isEmpty()) {\n\t\t\tQPair<double, double> temp;\n\t\t\ttemp.first = str.mid(1).split(\";\").at(0).toInt();\n\t\t\ttemp.second = str.mid(1).split(\";\").at(1).toInt();\n\t\t\tpowerGraph.append(temp);\n\t\t}\n\t}\n\n\tconst int graphLength = powerGraph.size();\n\tconst int maxValue = powerGraph[graphLength - 1].second;\n\n\tfor (int i = 0; i < graphLength; i++) {\n\t\tpowerGraph[i].second *= maxControlValue;\n\t\tpowerGraph[i].second \/= maxValue;\n\t}\n\n\tfor (int i = 0; i < maxControlValue; i++) {\n\t\tint k = 0;\n\t\twhile (i >= powerGraph[k].second) {\n\t\t\tk++;\n\t\t}\n\n\t\tk--;\n\n\t\tconst double measureDifference = powerGraph[k + 1].second - powerGraph[k].second;\n\t\tconst double axeDifferenece = powerGraph[k + 1].first - powerGraph[k].first;\n\n\t\tif (measureDifference < 0 || axeDifferenece < 0) {\n\t\t\tthrow trikKernel::MalformedConfigException(\"Nonmonotonic function\");\n\t\t}\n\n\t\tconst double coef = axeDifferenece \/ measureDifference;\n\t\tconst int power = powerGraph[k].first + coef * (i - powerGraph[k].second);\n\t\tmPowerMap.append(power);\n\t}\n\n\tmPowerMap.append(maxControlValue);\n}\n\nint PowerMotor::minControl() const\n{\n\treturn minControlValue;\n}\n\nint PowerMotor::maxControl() const\n{\n\treturn maxControlValue;\n}\n<commit_msg>setPower(some, false) for PowerMotor to pass raw value to device<commit_after>\/* Copyright 2013 - 2016 Yurii Litvinov, Anastasiia Kornilova and CyberTech Labs Ltd.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License. *\/\n\n#include \"powerMotor.h\"\n\n#include <trikKernel\/configurer.h>\n#include <trikKernel\/exceptions\/malformedConfigException.h>\n#include <trikKernel\/exceptions\/internalErrorException.h>\n\n#include \"mspI2cCommunicator.h\"\n#include \"configurerHelper.h\"\n\nusing namespace trikControl;\n\nstatic const int maxControlValue = 100;\nstatic const int minControlValue = -100;\n\nPowerMotor::PowerMotor(const QString &port, const trikKernel::Configurer &configurer\n\t\t, MspCommunicatorInterface &communicator)\n\t: mCommunicator(communicator)\n\t, mInvert(configurer.attributeByPort(port, \"invert\") == \"false\")\n\t, mCurrentPower(0)\n\t, mState(\"Power Motor on\" + port)\n{\n\tmMspCommandNumber = ConfigurerHelper::configureInt(configurer, mState, port, \"i2cCommandNumber\");\n\n\tmCurrentPeriod = ConfigurerHelper::configureInt(configurer, mState, port, \"period\");\n\tsetPeriod(mCurrentPeriod);\n\n\tmPowerMap.reserve(maxControlValue + 1);\n\tlineariseMotor(port, configurer);\n\n\tmState.ready();\n}\n\nPowerMotor::~PowerMotor()\n{\n}\n\nPowerMotor::Status PowerMotor::status() const\n{\n\treturn combine(mCommunicator, mState.status());\n}\n\nvoid PowerMotor::setPower(int power, bool constrain)\n{\n\tif (constrain) {\n\t\tif (power > maxControlValue) {\n\t\t\tpower = maxControlValue;\n\t\t} else if (power < minControlValue) {\n\t\t\tpower = minControlValue;\n\t\t}\n\t\tpower = power <= 0 ? -mPowerMap[-power] : mPowerMap[power];\n\t}\n\n\tmCurrentPower = power;\n\n\n\tpower = mInvert ? -power : power;\n\n\tQByteArray command(3, '\\0');\n\tcommand[0] = static_cast<char>(mMspCommandNumber & 0xFF);\n\tcommand[1] = static_cast<char>((mMspCommandNumber >> 8) & 0xFF);\n\tcommand[2] = static_cast<char>(power & 0xFF);\n\n\tmCommunicator.send(command);\n}\n\nint PowerMotor::power() const\n{\n\treturn mCurrentPower;\n}\n\nint PowerMotor::period() const\n{\n\treturn mCurrentPeriod;\n}\n\nvoid PowerMotor::powerOff()\n{\n\tsetPower(0);\n}\n\nvoid PowerMotor::setPeriod(int period)\n{\n\tmCurrentPeriod = period;\n\tQByteArray command(4, '\\0');\n\tcommand[0] = static_cast<char>((mMspCommandNumber - 4) & 0xFF);\n\tcommand[2] = static_cast<char>(period & 0xFF);\n\tcommand[3] = static_cast<char>(period >> 8);\n\tmCommunicator.send(command);\n}\n\nvoid PowerMotor::lineariseMotor(const QString &port, const trikKernel::Configurer &configurer)\n{\n\tQVector<QPair<double, double>> powerGraph;\n\tfor (const QString &str : configurer.attributeByPort(port, \"measures\").split(\")\")) {\n\t\tif (!str.isEmpty()) {\n\t\t\tQPair<double, double> temp;\n\t\t\ttemp.first = str.mid(1).split(\";\").at(0).toInt();\n\t\t\ttemp.second = str.mid(1).split(\";\").at(1).toInt();\n\t\t\tpowerGraph.append(temp);\n\t\t}\n\t}\n\n\tconst int graphLength = powerGraph.size();\n\tconst int maxValue = powerGraph[graphLength - 1].second;\n\n\tfor (int i = 0; i < graphLength; i++) {\n\t\tpowerGraph[i].second *= maxControlValue;\n\t\tpowerGraph[i].second \/= maxValue;\n\t}\n\n\tfor (int i = 0; i < maxControlValue; i++) {\n\t\tint k = 0;\n\t\twhile (i >= powerGraph[k].second) {\n\t\t\tk++;\n\t\t}\n\n\t\tk--;\n\n\t\tconst double measureDifference = powerGraph[k + 1].second - powerGraph[k].second;\n\t\tconst double axeDifferenece = powerGraph[k + 1].first - powerGraph[k].first;\n\n\t\tif (measureDifference < 0 || axeDifferenece < 0) {\n\t\t\tthrow trikKernel::MalformedConfigException(\"Nonmonotonic function\");\n\t\t}\n\n\t\tconst double coef = axeDifferenece \/ measureDifference;\n\t\tconst int power = powerGraph[k].first + coef * (i - powerGraph[k].second);\n\t\tmPowerMap.append(power);\n\t}\n\n\tmPowerMap.append(maxControlValue);\n}\n\nint PowerMotor::minControl() const\n{\n\treturn minControlValue;\n}\n\nint PowerMotor::maxControl() const\n{\n\treturn maxControlValue;\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\/window\/dialog_client_view.h\"\n\n#include <algorithm>\n\n#include \"ui\/base\/keycodes\/keyboard_codes.h\"\n#include \"ui\/views\/controls\/button\/text_button.h\"\n#include \"ui\/views\/layout\/layout_constants.h\"\n#include \"ui\/views\/widget\/widget.h\"\n#include \"ui\/views\/window\/dialog_delegate.h\"\n\nnamespace views {\n\nnamespace {\n\n\/\/ The group used by the buttons.  This name is chosen voluntarily big not to\n\/\/ conflict with other groups that could be in the dialog content.\nconst int kButtonGroup = 6666;\n\n\/\/ Update |button|'s text and enabled state according to |delegate|'s state.\nvoid UpdateButton(TextButton* button,\n                  DialogDelegate* dialog,\n                  ui::DialogButton type) {\n  button->SetText(dialog->GetDialogButtonLabel(type));\n  button->SetEnabled(dialog->IsDialogButtonEnabled(type));\n}\n\n}  \/\/ namespace\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ DialogClientView, public:\n\nDialogClientView::DialogClientView(Widget* owner, View* contents_view)\n    : ClientView(owner, contents_view),\n      ok_button_(NULL),\n      cancel_button_(NULL),\n      default_button_(NULL),\n      focus_manager_(NULL),\n      extra_view_(NULL),\n      footnote_view_(NULL),\n      notified_delegate_(false) {\n  const SkColor color = owner->GetNativeTheme()->GetSystemColor(\n      ui::NativeTheme::kColorId_DialogBackground);\n  set_background(views::Background::CreateSolidBackground(color));\n}\n\nDialogClientView::~DialogClientView() {\n  if (focus_manager_)\n    focus_manager_->RemoveFocusChangeListener(this);\n  focus_manager_ = NULL;\n}\n\nvoid DialogClientView::AcceptWindow() {\n  \/\/ Only notify the delegate once. See |notified_delegate_|'s comment.\n  if (!notified_delegate_ && GetDialogDelegate()->Accept(false)) {\n    notified_delegate_ = true;\n    Close();\n  }\n}\n\nvoid DialogClientView::CancelWindow() {\n  \/\/ Call the standard Close handler, which checks with the delegate before\n  \/\/ proceeding. This checking _isn't_ done here, but in the WM_CLOSE handler,\n  \/\/ so that the close box on the window also shares this code path.\n  Close();\n}\n\nvoid DialogClientView::UpdateDialogButtons() {\n  DialogDelegate* dialog = GetDialogDelegate();\n  const int buttons = dialog->GetDialogButtons();\n  \/\/ Ensure no buttons were added or removed; that isn't currently supported.\n  DCHECK_EQ((buttons & ui::DIALOG_BUTTON_CANCEL) == 0, cancel_button_ == NULL);\n  DCHECK_EQ((buttons & ui::DIALOG_BUTTON_OK) == 0, ok_button_ == NULL);\n  if (cancel_button_)\n    UpdateButton(cancel_button_, dialog, ui::DIALOG_BUTTON_CANCEL);\n  if (ok_button_)\n    UpdateButton(ok_button_, dialog, ui::DIALOG_BUTTON_OK);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ DialogClientView, ClientView overrides:\n\nbool DialogClientView::CanClose() {\n  if (notified_delegate_)\n    return true;\n\n  DialogDelegate* dialog = GetDialogDelegate();\n  int buttons = dialog->GetDialogButtons();\n  bool close = true;\n  if ((buttons & ui::DIALOG_BUTTON_CANCEL) ||\n      (buttons == ui::DIALOG_BUTTON_NONE))\n    close = dialog->Cancel();\n  else if (buttons & ui::DIALOG_BUTTON_OK)\n    close = dialog->Accept(true);\n  notified_delegate_ = close;\n  return close;\n}\n\nDialogClientView* DialogClientView::AsDialogClientView() {\n  return this;\n}\n\nconst DialogClientView* DialogClientView::AsDialogClientView() const {\n  return this;\n}\n\nvoid DialogClientView::OnWillChangeFocus(View* focused_before,\n                                         View* focused_now) {\n  \/\/ New style dialogs do not move the default button with the focus.\n  \/\/ TODO(msw|wittman): Remove this functionality once the new style had landed.\n  if (DialogDelegate::UseNewStyle())\n    return;\n\n  \/\/ Make the newly focused button default or restore the dialog's default.\n  const int default_button = GetDialogDelegate()->GetDefaultDialogButton();\n  TextButton* new_default_button = NULL;\n  if (focused_now &&\n      (focused_now->GetClassName() == TextButton::kViewClassName ||\n       focused_now->GetClassName() == NativeTextButton::kViewClassName)) {\n    new_default_button = static_cast<TextButton*>(focused_now);\n  } else if (default_button == ui::DIALOG_BUTTON_OK && ok_button_) {\n    new_default_button = ok_button_;\n  } else if (default_button == ui::DIALOG_BUTTON_CANCEL && cancel_button_) {\n    new_default_button = cancel_button_;\n  }\n\n  if (default_button_ && default_button_ != new_default_button)\n    default_button_->SetIsDefault(false);\n  default_button_ = new_default_button;\n  if (default_button_ && !default_button_->is_default())\n    default_button_->SetIsDefault(true);\n}\n\nvoid DialogClientView::OnDidChangeFocus(View* focused_before,\n                                        View* focused_now) {\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ DialogClientView, View overrides:\n\ngfx::Insets DialogClientView::GetInsets() const {\n  \/\/ NOTE: The insets only apply to the buttons, extra view, and footnote view.\n  return DialogDelegate::UseNewStyle() ? gfx::Insets() :\n      gfx::Insets(kButtonVEdgeMargin, kButtonHEdgeMargin,\n                  kButtonVEdgeMargin, kButtonHEdgeMargin);\n}\n\ngfx::Size DialogClientView::GetPreferredSize() {\n  \/\/ Initialize the size to fit the buttons and extra view row.\n  gfx::Size size(\n      (ok_button_ ? ok_button_->GetPreferredSize().width() : 0) +\n      (cancel_button_ ? cancel_button_->GetPreferredSize().width() : 0) +\n      (cancel_button_ && ok_button_ ? kRelatedButtonHSpacing : 0) +\n      (extra_view_ ? extra_view_->GetPreferredSize().width() : 0) +\n      (extra_view_ && has_dialog_buttons() ? kRelatedButtonHSpacing : 0),\n      GetButtonsAndExtraViewRowHeight() + kRelatedControlVerticalSpacing);\n\n  \/\/ Increase the size as needed to fit the footnote view.\n  if (footnote_view_) {\n    gfx::Size footnote_size = footnote_view_->GetPreferredSize();\n    size.Enlarge(0, footnote_size.height() + kRelatedControlVerticalSpacing);\n    size.set_width(std::max(size.width(), footnote_size.width()));\n  }\n\n  \/\/ Inset the buttons, extra view, and footnote view.\n  const gfx::Insets insets = GetInsets();\n  size.Enlarge(insets.width(), insets.bottom());\n\n  \/\/ Increase the size as needed to fit the contents view.\n  \/\/ NOTE: The contents view is not inset on the top or side client view edges.\n  gfx::Size contents_size = contents_view()->GetPreferredSize();\n  size.Enlarge(0, contents_size.height());\n  size.set_width(std::max(size.width(), contents_size.width()));\n  return size;\n}\n\nvoid DialogClientView::Layout() {\n  gfx::Rect bounds = GetContentsBounds();\n  bounds.Inset(GetInsets());\n\n  \/\/ Layout the footnote view.\n  if (footnote_view_) {\n    const int height = footnote_view_->GetPreferredSize().height();\n    footnote_view_->SetBounds(bounds.x(), bounds.bottom() - height,\n                              bounds.width(), height);\n    bounds.Inset(0, 0, 0, height + kRelatedControlVerticalSpacing);\n  }\n\n  \/\/ Layout the row containing the buttons and the extra view.\n  if (has_dialog_buttons() || extra_view_) {\n    const int height = GetButtonsAndExtraViewRowHeight();\n    gfx::Rect row_bounds(bounds.x(), bounds.bottom() - height,\n                         bounds.width(), height);\n    if (cancel_button_) {\n      const gfx::Size size = cancel_button_->GetPreferredSize();\n      row_bounds.set_width(row_bounds.width() - size.width());\n      cancel_button_->SetBounds(row_bounds.right(), row_bounds.y(),\n                                size.width(), height);\n      row_bounds.set_width(row_bounds.width() - kRelatedButtonHSpacing);\n    }\n    if (ok_button_) {\n      const gfx::Size size = ok_button_->GetPreferredSize();\n        row_bounds.set_width(row_bounds.width() - size.width());\n      ok_button_->SetBounds(row_bounds.right(), row_bounds.y(),\n                            size.width(), height);\n      row_bounds.set_width(row_bounds.width() - kRelatedButtonHSpacing);\n    }\n    if (extra_view_) {\n      row_bounds.set_width(std::min(row_bounds.width(),\n          extra_view_->GetPreferredSize().width()));\n      extra_view_->SetBoundsRect(row_bounds);\n    }\n    bounds.Inset(0, 0, 0, height + kRelatedControlVerticalSpacing);\n  }\n\n  \/\/ Layout the contents view to the top and side edges of the contents bounds.\n  \/\/ NOTE: The local insets do not apply to the contents view sides or top.\n  const gfx::Rect contents_bounds = GetContentsBounds();\n  contents_view()->SetBounds(contents_bounds.x(), contents_bounds.y(),\n      contents_bounds.width(), bounds.bottom() - contents_bounds.y());\n}\n\nbool DialogClientView::AcceleratorPressed(const ui::Accelerator& accelerator) {\n  DCHECK_EQ(accelerator.key_code(), ui::VKEY_ESCAPE);\n  Close();\n  return true;\n}\n\nvoid DialogClientView::ViewHierarchyChanged(bool is_add,\n                                            View* parent,\n                                            View* child) {\n  ClientView::ViewHierarchyChanged(is_add, parent, child);\n  if (is_add && child == this) {\n    focus_manager_ = GetFocusManager();\n    if (focus_manager_)\n      GetFocusManager()->AddFocusChangeListener(this);\n\n    CreateDialogButtons();\n    CreateExtraView();\n    CreateFootnoteView();\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ DialogClientView, ButtonListener implementation:\n\nvoid DialogClientView::ButtonPressed(Button* sender, const ui::Event& event) {\n  \/\/ Check for a valid delegate to avoid handling events after destruction.\n  if (!GetDialogDelegate())\n    return;\n\n  if (sender == ok_button_)\n    AcceptWindow();\n  else if (sender == cancel_button_)\n    CancelWindow();\n  else\n    NOTREACHED();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ DialogClientView, private:\n\nvoid DialogClientView::CreateDialogButtons() {\n  DCHECK(!cancel_button_ && !ok_button_);\n  const int buttons = GetDialogDelegate()->GetDialogButtons();\n  ui::Accelerator escape(ui::VKEY_ESCAPE, ui::EF_NONE);\n\n  if (buttons & ui::DIALOG_BUTTON_OK) {\n    ok_button_ = CreateDialogButton(ui::DIALOG_BUTTON_OK);\n    if (buttons & ui::DIALOG_BUTTON_CANCEL)\n      ok_button_->AddAccelerator(escape);\n    AddChildView(ok_button_);\n  }\n  if (buttons & ui::DIALOG_BUTTON_CANCEL) {\n    cancel_button_ = CreateDialogButton(ui::DIALOG_BUTTON_CANCEL);\n    cancel_button_->AddAccelerator(escape);\n    AddChildView(cancel_button_);\n  }\n  UpdateDialogButtons();\n\n  \/\/ Use the escape key to close the window if there are no dialog buttons.\n  if (!has_dialog_buttons())\n    AddAccelerator(escape);\n}\n\nTextButton* DialogClientView::CreateDialogButton(ui::DialogButton type) {\n  const string16 title = GetDialogDelegate()->GetDialogButtonLabel(type);\n  TextButton* button = NULL;\n  if (DialogDelegate::UseNewStyle())\n    button = new TextButton(this, title);\n  else\n    button = new NativeTextButton(this, title);\n  const int kDialogMinButtonWidth = 75;\n  button->set_min_width(kDialogMinButtonWidth);\n  button->SetGroup(kButtonGroup);\n  if (type == GetDialogDelegate()->GetDefaultDialogButton()) {\n    default_button_ = button;\n    button->SetIsDefault(true);\n  }\n  return button;\n}\n\nint DialogClientView::GetButtonsAndExtraViewRowHeight() const {\n  return std::max(extra_view_ ? extra_view_->GetPreferredSize().height() : 0,\n      std::max(ok_button_ ? ok_button_->GetPreferredSize().height() : 0,\n          cancel_button_ ? cancel_button_->GetPreferredSize().height() : 0));\n}\n\nvoid DialogClientView::CreateExtraView() {\n  if (extra_view_)\n    return;\n\n  extra_view_ = GetDialogDelegate()->CreateExtraView();\n  if (extra_view_) {\n    extra_view_->SetGroup(kButtonGroup);\n    AddChildView(extra_view_);\n  }\n}\n\nvoid DialogClientView::CreateFootnoteView() {\n  if (footnote_view_)\n    return;\n\n  footnote_view_ = GetDialogDelegate()->CreateFootnoteView();\n  if (footnote_view_)\n    AddChildView(footnote_view_);\n}\n\nDialogDelegate* DialogClientView::GetDialogDelegate() const {\n  return GetWidget()->widget_delegate()->AsDialogDelegate();\n}\n\nvoid DialogClientView::Close() {\n  GetWidget()->Close();\n  GetDialogDelegate()->OnClose();\n}\n\n}  \/\/ namespace views\n<commit_msg>Restore 'Chrome Style' buttons for --enable-new-dialog-style dialogs. My recent http:\/\/crrev.com\/183286 mistakenly removed this styling. (this only affects dialogs with the experimental --enable-new-dialog-style)<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\/window\/dialog_client_view.h\"\n\n#include <algorithm>\n\n#include \"ui\/base\/keycodes\/keyboard_codes.h\"\n#include \"ui\/views\/controls\/button\/chrome_style.h\"\n#include \"ui\/views\/controls\/button\/text_button.h\"\n#include \"ui\/views\/layout\/layout_constants.h\"\n#include \"ui\/views\/widget\/widget.h\"\n#include \"ui\/views\/window\/dialog_delegate.h\"\n\nnamespace views {\n\nnamespace {\n\n\/\/ The group used by the buttons.  This name is chosen voluntarily big not to\n\/\/ conflict with other groups that could be in the dialog content.\nconst int kButtonGroup = 6666;\n\n\/\/ Update |button|'s text and enabled state according to |delegate|'s state.\nvoid UpdateButton(TextButton* button,\n                  DialogDelegate* dialog,\n                  ui::DialogButton type) {\n  button->SetText(dialog->GetDialogButtonLabel(type));\n  button->SetEnabled(dialog->IsDialogButtonEnabled(type));\n}\n\n}  \/\/ namespace\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ DialogClientView, public:\n\nDialogClientView::DialogClientView(Widget* owner, View* contents_view)\n    : ClientView(owner, contents_view),\n      ok_button_(NULL),\n      cancel_button_(NULL),\n      default_button_(NULL),\n      focus_manager_(NULL),\n      extra_view_(NULL),\n      footnote_view_(NULL),\n      notified_delegate_(false) {\n  const SkColor color = owner->GetNativeTheme()->GetSystemColor(\n      ui::NativeTheme::kColorId_DialogBackground);\n  set_background(views::Background::CreateSolidBackground(color));\n}\n\nDialogClientView::~DialogClientView() {\n  if (focus_manager_)\n    focus_manager_->RemoveFocusChangeListener(this);\n  focus_manager_ = NULL;\n}\n\nvoid DialogClientView::AcceptWindow() {\n  \/\/ Only notify the delegate once. See |notified_delegate_|'s comment.\n  if (!notified_delegate_ && GetDialogDelegate()->Accept(false)) {\n    notified_delegate_ = true;\n    Close();\n  }\n}\n\nvoid DialogClientView::CancelWindow() {\n  \/\/ Call the standard Close handler, which checks with the delegate before\n  \/\/ proceeding. This checking _isn't_ done here, but in the WM_CLOSE handler,\n  \/\/ so that the close box on the window also shares this code path.\n  Close();\n}\n\nvoid DialogClientView::UpdateDialogButtons() {\n  DialogDelegate* dialog = GetDialogDelegate();\n  const int buttons = dialog->GetDialogButtons();\n  \/\/ Ensure no buttons were added or removed; that isn't currently supported.\n  DCHECK_EQ((buttons & ui::DIALOG_BUTTON_CANCEL) == 0, cancel_button_ == NULL);\n  DCHECK_EQ((buttons & ui::DIALOG_BUTTON_OK) == 0, ok_button_ == NULL);\n  if (cancel_button_)\n    UpdateButton(cancel_button_, dialog, ui::DIALOG_BUTTON_CANCEL);\n  if (ok_button_)\n    UpdateButton(ok_button_, dialog, ui::DIALOG_BUTTON_OK);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ DialogClientView, ClientView overrides:\n\nbool DialogClientView::CanClose() {\n  if (notified_delegate_)\n    return true;\n\n  DialogDelegate* dialog = GetDialogDelegate();\n  int buttons = dialog->GetDialogButtons();\n  bool close = true;\n  if ((buttons & ui::DIALOG_BUTTON_CANCEL) ||\n      (buttons == ui::DIALOG_BUTTON_NONE))\n    close = dialog->Cancel();\n  else if (buttons & ui::DIALOG_BUTTON_OK)\n    close = dialog->Accept(true);\n  notified_delegate_ = close;\n  return close;\n}\n\nDialogClientView* DialogClientView::AsDialogClientView() {\n  return this;\n}\n\nconst DialogClientView* DialogClientView::AsDialogClientView() const {\n  return this;\n}\n\nvoid DialogClientView::OnWillChangeFocus(View* focused_before,\n                                         View* focused_now) {\n  \/\/ New style dialogs do not move the default button with the focus.\n  \/\/ TODO(msw|wittman): Remove this functionality once the new style had landed.\n  if (DialogDelegate::UseNewStyle())\n    return;\n\n  \/\/ Make the newly focused button default or restore the dialog's default.\n  const int default_button = GetDialogDelegate()->GetDefaultDialogButton();\n  TextButton* new_default_button = NULL;\n  if (focused_now &&\n      (focused_now->GetClassName() == TextButton::kViewClassName ||\n       focused_now->GetClassName() == NativeTextButton::kViewClassName)) {\n    new_default_button = static_cast<TextButton*>(focused_now);\n  } else if (default_button == ui::DIALOG_BUTTON_OK && ok_button_) {\n    new_default_button = ok_button_;\n  } else if (default_button == ui::DIALOG_BUTTON_CANCEL && cancel_button_) {\n    new_default_button = cancel_button_;\n  }\n\n  if (default_button_ && default_button_ != new_default_button)\n    default_button_->SetIsDefault(false);\n  default_button_ = new_default_button;\n  if (default_button_ && !default_button_->is_default())\n    default_button_->SetIsDefault(true);\n}\n\nvoid DialogClientView::OnDidChangeFocus(View* focused_before,\n                                        View* focused_now) {\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ DialogClientView, View overrides:\n\ngfx::Insets DialogClientView::GetInsets() const {\n  \/\/ NOTE: The insets only apply to the buttons, extra view, and footnote view.\n  return DialogDelegate::UseNewStyle() ? gfx::Insets() :\n      gfx::Insets(kButtonVEdgeMargin, kButtonHEdgeMargin,\n                  kButtonVEdgeMargin, kButtonHEdgeMargin);\n}\n\ngfx::Size DialogClientView::GetPreferredSize() {\n  \/\/ Initialize the size to fit the buttons and extra view row.\n  gfx::Size size(\n      (ok_button_ ? ok_button_->GetPreferredSize().width() : 0) +\n      (cancel_button_ ? cancel_button_->GetPreferredSize().width() : 0) +\n      (cancel_button_ && ok_button_ ? kRelatedButtonHSpacing : 0) +\n      (extra_view_ ? extra_view_->GetPreferredSize().width() : 0) +\n      (extra_view_ && has_dialog_buttons() ? kRelatedButtonHSpacing : 0),\n      GetButtonsAndExtraViewRowHeight() + kRelatedControlVerticalSpacing);\n\n  \/\/ Increase the size as needed to fit the footnote view.\n  if (footnote_view_) {\n    gfx::Size footnote_size = footnote_view_->GetPreferredSize();\n    size.Enlarge(0, footnote_size.height() + kRelatedControlVerticalSpacing);\n    size.set_width(std::max(size.width(), footnote_size.width()));\n  }\n\n  \/\/ Inset the buttons, extra view, and footnote view.\n  const gfx::Insets insets = GetInsets();\n  size.Enlarge(insets.width(), insets.bottom());\n\n  \/\/ Increase the size as needed to fit the contents view.\n  \/\/ NOTE: The contents view is not inset on the top or side client view edges.\n  gfx::Size contents_size = contents_view()->GetPreferredSize();\n  size.Enlarge(0, contents_size.height());\n  size.set_width(std::max(size.width(), contents_size.width()));\n  return size;\n}\n\nvoid DialogClientView::Layout() {\n  gfx::Rect bounds = GetContentsBounds();\n  bounds.Inset(GetInsets());\n\n  \/\/ Layout the footnote view.\n  if (footnote_view_) {\n    const int height = footnote_view_->GetPreferredSize().height();\n    footnote_view_->SetBounds(bounds.x(), bounds.bottom() - height,\n                              bounds.width(), height);\n    bounds.Inset(0, 0, 0, height + kRelatedControlVerticalSpacing);\n  }\n\n  \/\/ Layout the row containing the buttons and the extra view.\n  if (has_dialog_buttons() || extra_view_) {\n    const int height = GetButtonsAndExtraViewRowHeight();\n    gfx::Rect row_bounds(bounds.x(), bounds.bottom() - height,\n                         bounds.width(), height);\n    if (cancel_button_) {\n      const gfx::Size size = cancel_button_->GetPreferredSize();\n      row_bounds.set_width(row_bounds.width() - size.width());\n      cancel_button_->SetBounds(row_bounds.right(), row_bounds.y(),\n                                size.width(), height);\n      row_bounds.set_width(row_bounds.width() - kRelatedButtonHSpacing);\n    }\n    if (ok_button_) {\n      const gfx::Size size = ok_button_->GetPreferredSize();\n        row_bounds.set_width(row_bounds.width() - size.width());\n      ok_button_->SetBounds(row_bounds.right(), row_bounds.y(),\n                            size.width(), height);\n      row_bounds.set_width(row_bounds.width() - kRelatedButtonHSpacing);\n    }\n    if (extra_view_) {\n      row_bounds.set_width(std::min(row_bounds.width(),\n          extra_view_->GetPreferredSize().width()));\n      extra_view_->SetBoundsRect(row_bounds);\n    }\n    bounds.Inset(0, 0, 0, height + kRelatedControlVerticalSpacing);\n  }\n\n  \/\/ Layout the contents view to the top and side edges of the contents bounds.\n  \/\/ NOTE: The local insets do not apply to the contents view sides or top.\n  const gfx::Rect contents_bounds = GetContentsBounds();\n  contents_view()->SetBounds(contents_bounds.x(), contents_bounds.y(),\n      contents_bounds.width(), bounds.bottom() - contents_bounds.y());\n}\n\nbool DialogClientView::AcceleratorPressed(const ui::Accelerator& accelerator) {\n  DCHECK_EQ(accelerator.key_code(), ui::VKEY_ESCAPE);\n  Close();\n  return true;\n}\n\nvoid DialogClientView::ViewHierarchyChanged(bool is_add,\n                                            View* parent,\n                                            View* child) {\n  ClientView::ViewHierarchyChanged(is_add, parent, child);\n  if (is_add && child == this) {\n    focus_manager_ = GetFocusManager();\n    if (focus_manager_)\n      GetFocusManager()->AddFocusChangeListener(this);\n\n    CreateDialogButtons();\n    CreateExtraView();\n    CreateFootnoteView();\n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ DialogClientView, ButtonListener implementation:\n\nvoid DialogClientView::ButtonPressed(Button* sender, const ui::Event& event) {\n  \/\/ Check for a valid delegate to avoid handling events after destruction.\n  if (!GetDialogDelegate())\n    return;\n\n  if (sender == ok_button_)\n    AcceptWindow();\n  else if (sender == cancel_button_)\n    CancelWindow();\n  else\n    NOTREACHED();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ DialogClientView, private:\n\nvoid DialogClientView::CreateDialogButtons() {\n  DCHECK(!cancel_button_ && !ok_button_);\n  const int buttons = GetDialogDelegate()->GetDialogButtons();\n  ui::Accelerator escape(ui::VKEY_ESCAPE, ui::EF_NONE);\n\n  if (buttons & ui::DIALOG_BUTTON_OK) {\n    ok_button_ = CreateDialogButton(ui::DIALOG_BUTTON_OK);\n    if (buttons & ui::DIALOG_BUTTON_CANCEL)\n      ok_button_->AddAccelerator(escape);\n    AddChildView(ok_button_);\n  }\n  if (buttons & ui::DIALOG_BUTTON_CANCEL) {\n    cancel_button_ = CreateDialogButton(ui::DIALOG_BUTTON_CANCEL);\n    cancel_button_->AddAccelerator(escape);\n    AddChildView(cancel_button_);\n  }\n  UpdateDialogButtons();\n\n  \/\/ Use the escape key to close the window if there are no dialog buttons.\n  if (!has_dialog_buttons())\n    AddAccelerator(escape);\n}\n\nTextButton* DialogClientView::CreateDialogButton(ui::DialogButton type) {\n  const string16 title = GetDialogDelegate()->GetDialogButtonLabel(type);\n  TextButton* button = NULL;\n  if (DialogDelegate::UseNewStyle()) {\n    button = new TextButton(this, title);\n    ApplyChromeStyle(button);\n  } else {\n    button = new NativeTextButton(this, title);\n  }\n  const int kDialogMinButtonWidth = 75;\n  button->set_min_width(kDialogMinButtonWidth);\n  button->SetGroup(kButtonGroup);\n  if (type == GetDialogDelegate()->GetDefaultDialogButton()) {\n    default_button_ = button;\n    button->SetIsDefault(true);\n  }\n  return button;\n}\n\nint DialogClientView::GetButtonsAndExtraViewRowHeight() const {\n  return std::max(extra_view_ ? extra_view_->GetPreferredSize().height() : 0,\n      std::max(ok_button_ ? ok_button_->GetPreferredSize().height() : 0,\n          cancel_button_ ? cancel_button_->GetPreferredSize().height() : 0));\n}\n\nvoid DialogClientView::CreateExtraView() {\n  if (extra_view_)\n    return;\n\n  extra_view_ = GetDialogDelegate()->CreateExtraView();\n  if (extra_view_) {\n    extra_view_->SetGroup(kButtonGroup);\n    AddChildView(extra_view_);\n  }\n}\n\nvoid DialogClientView::CreateFootnoteView() {\n  if (footnote_view_)\n    return;\n\n  footnote_view_ = GetDialogDelegate()->CreateFootnoteView();\n  if (footnote_view_)\n    AddChildView(footnote_view_);\n}\n\nDialogDelegate* DialogClientView::GetDialogDelegate() const {\n  return GetWidget()->widget_delegate()->AsDialogDelegate();\n}\n\nvoid DialogClientView::Close() {\n  GetWidget()->Close();\n  GetDialogDelegate()->OnClose();\n}\n\n}  \/\/ namespace views\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\\\n* File:          dialog.cpp\n* Purpose:       Implementation of wxExDialog 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\/extension\/dialog.h>\n\n#if wxUSE_GUI\nBEGIN_EVENT_TABLE(wxExDialog, wxDialog)\n  EVT_CHAR_HOOK(wxExDialog::OnKeyDown)\r\nEND_EVENT_TABLE()\n\nwxExDialog::wxExDialog(wxWindow* parent,\n  const wxString& title,\n  long button_flags,\n  wxWindowID id,\n  const wxPoint& pos,\n  const wxSize& size,\n  long style,\n  const wxString& name)\n  : wxDialog(parent, id, title, pos, size, style, name)\n  , m_ButtonFlags(button_flags)\n  , m_TopSizer(new wxFlexGridSizer(1, 0, 0))\n  , m_UserSizer(new wxFlexGridSizer(1, 0, 0))\n{\n}\n\nwxSizerItem* wxExDialog::AddUserSizer(\n  wxWindow* window,\n  const wxSizerFlags& flags)\n{\n  wxSizerItem* item = m_UserSizer->Add(window, flags);\n\n  if (flags.GetFlags() & wxEXPAND)\n  {\n    m_UserSizer->AddGrowableRow(m_UserSizer->GetChildren().GetCount() - 1);\n  }\n\n  return item;\n}\n\nwxSizerItem* wxExDialog::AddUserSizer(\n  wxSizer* sizer,\n  const wxSizerFlags& flags)\n{\n  wxSizerItem* item = m_UserSizer->Add(sizer, flags);\n\n  if (flags.GetFlags() & wxEXPAND)\n  {\n    m_UserSizer->AddGrowableRow(m_UserSizer->GetChildren().GetCount() - 1);\n  }\n\n  return item;\n}\n\nvoid wxExDialog::LayoutSizers()\n{\n  m_TopSizer->AddGrowableCol(0);\n  m_UserSizer->AddGrowableCol(0);\n\n  wxSizerFlags flag;\n  flag.Expand().Center().Border();\n\n  \/\/ The top sizer starts with a spacer, for a nice border.\n  m_TopSizer->AddSpacer(wxSizerFlags::GetDefaultBorder());\n\n  \/\/ Then place the growable user sizer.\n  m_TopSizer->Add(m_UserSizer, flag);\n  m_TopSizer->AddGrowableRow(m_TopSizer->GetChildren().GetCount() - 1); \/\/ so this is the user sizer\n\n  \/\/ Then the button sizer.\n  if (m_ButtonFlags != 0)\n  {\n    wxSizer* sbz = CreateSeparatedButtonSizer(m_ButtonFlags);\n\n    if (sbz != NULL)\n    {\n      m_TopSizer->Add(sbz, flag);\n    }\n  }\n\n  \/\/ The top sizer ends with a spacer as well.\n  m_TopSizer->AddSpacer(wxSizerFlags::GetDefaultBorder());\n\n  SetSizerAndFit(m_TopSizer);\n}\n\nvoid wxExDialog::OnKeyDown(wxKeyEvent& event)\n{\n  if (event.GetKeyCode() == WXK_RETURN)\n  {\n    wxCommandEvent event(wxEVT_COMMAND_BUTTON_CLICKED, wxID_OK);\n    wxPostEvent(this, event);\n  }\n  if (event.GetKeyCode() == WXK_ESCAPE)\n  {\n    wxCommandEvent event(wxEVT_COMMAND_BUTTON_CLICKED, wxID_CANCEL);\n    wxPostEvent(this, event);\n  }\n  else\n  {\n    event.Skip();\n  }\n}\n\n#endif \/\/ wxUSE_GUI\n<commit_msg>added check on button flags inside OnKeyDown<commit_after>\/******************************************************************************\\\n* File:          dialog.cpp\n* Purpose:       Implementation of wxExDialog 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\/extension\/dialog.h>\n\n#if wxUSE_GUI\nBEGIN_EVENT_TABLE(wxExDialog, wxDialog)\n  EVT_CHAR_HOOK(wxExDialog::OnKeyDown)\r\nEND_EVENT_TABLE()\n\nwxExDialog::wxExDialog(wxWindow* parent,\n  const wxString& title,\n  long button_flags,\n  wxWindowID id,\n  const wxPoint& pos,\n  const wxSize& size,\n  long style,\n  const wxString& name)\n  : wxDialog(parent, id, title, pos, size, style, name)\n  , m_ButtonFlags(button_flags)\n  , m_TopSizer(new wxFlexGridSizer(1, 0, 0))\n  , m_UserSizer(new wxFlexGridSizer(1, 0, 0))\n{\n}\n\nwxSizerItem* wxExDialog::AddUserSizer(\n  wxWindow* window,\n  const wxSizerFlags& flags)\n{\n  wxSizerItem* item = m_UserSizer->Add(window, flags);\n\n  if (flags.GetFlags() & wxEXPAND)\n  {\n    m_UserSizer->AddGrowableRow(m_UserSizer->GetChildren().GetCount() - 1);\n  }\n\n  return item;\n}\n\nwxSizerItem* wxExDialog::AddUserSizer(\n  wxSizer* sizer,\n  const wxSizerFlags& flags)\n{\n  wxSizerItem* item = m_UserSizer->Add(sizer, flags);\n\n  if (flags.GetFlags() & wxEXPAND)\n  {\n    m_UserSizer->AddGrowableRow(m_UserSizer->GetChildren().GetCount() - 1);\n  }\n\n  return item;\n}\n\nvoid wxExDialog::LayoutSizers()\n{\n  m_TopSizer->AddGrowableCol(0);\n  m_UserSizer->AddGrowableCol(0);\n\n  wxSizerFlags flag;\n  flag.Expand().Center().Border();\n\n  \/\/ The top sizer starts with a spacer, for a nice border.\n  m_TopSizer->AddSpacer(wxSizerFlags::GetDefaultBorder());\n\n  \/\/ Then place the growable user sizer.\n  m_TopSizer->Add(m_UserSizer, flag);\n  m_TopSizer->AddGrowableRow(m_TopSizer->GetChildren().GetCount() - 1); \/\/ so this is the user sizer\n\n  \/\/ Then, if buttons were specified, the button sizer.\n  if (m_ButtonFlags != 0)\n  {\n    wxSizer* sbz = CreateSeparatedButtonSizer(m_ButtonFlags);\n\n    if (sbz != NULL)\n    {\n      m_TopSizer->Add(sbz, flag);\n    }\n  }\n\n  \/\/ The top sizer ends with a spacer as well.\n  m_TopSizer->AddSpacer(wxSizerFlags::GetDefaultBorder());\n\n  SetSizerAndFit(m_TopSizer);\n}\n\nvoid wxExDialog::OnKeyDown(wxKeyEvent& event)\n{\n  \/\/ If we did not specify any buttons, then \n  \/\/ use the RETURN key as OK and ESCAPE key as CANCEL.\n  if (m_ButtonFlags == 0)\n  {\n    if (event.GetKeyCode() == WXK_RETURN)\n    {\n      wxCommandEvent event(wxEVT_COMMAND_BUTTON_CLICKED, wxID_OK);\n      wxPostEvent(this, event);\n    }\n    if (event.GetKeyCode() == WXK_ESCAPE)\n    {\n      wxCommandEvent event(wxEVT_COMMAND_BUTTON_CLICKED, wxID_CANCEL);\n      wxPostEvent(this, event);\n    }\n    else\n    {\n      event.Skip();\n    }\n  }\n  else\n  {\n    event.Skip();\n  }\n}\n\n#endif \/\/ wxUSE_GUI\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\\\n* File:          dialog.cpp\n* Purpose:       Implementation of wxExDialog 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\/persist\/toplevel.h>\n#include <wx\/extension\/dialog.h>\n\n#if wxUSE_GUI\nBEGIN_EVENT_TABLE(wxExDialog, wxDialog)\n  EVT_CHAR_HOOK(wxExDialog::OnKeyDown)\nEND_EVENT_TABLE()\n\nwxExDialog::wxExDialog(wxWindow* parent,\n  const wxString& title,\n  long button_flags,\n  wxWindowID id,\n  const wxPoint& pos,\n  const wxSize& size, \n  long style)\n  : wxDialog(parent, id, title, pos, size, style)\n  , m_ButtonFlags(button_flags)\n  , m_TopSizer(new wxFlexGridSizer(1, 0, 0))\n  , m_UserSizer(new wxFlexGridSizer(1, 0, 0))\n{\n  SetName(title);\n}\n\nwxSizerItem* wxExDialog::AddUserSizer(\n  wxWindow* window,\n  const wxSizerFlags& flags)\n{\n  wxSizerItem* item = m_UserSizer->Add(window, flags);\n\n  if (flags.GetFlags() & wxEXPAND)\n  {\n    m_UserSizer->AddGrowableRow(m_UserSizer->GetChildren().GetCount() - 1);\n  }\n\n  return item;\n}\n\nwxSizerItem* wxExDialog::AddUserSizer(\n  wxSizer* sizer,\n  const wxSizerFlags& flags)\n{\n  wxSizerItem* item = m_UserSizer->Add(sizer, flags);\n\n  if (flags.GetFlags() & wxEXPAND)\n  {\n    m_UserSizer->AddGrowableRow(m_UserSizer->GetChildren().GetCount() - 1);\n  }\n\n  return item;\n}\n\nvoid wxExDialog::LayoutSizers(bool add_separator_line)\n{\n  m_TopSizer->AddGrowableCol(0);\n  m_UserSizer->AddGrowableCol(0);\n\n  wxSizerFlags flag;\n  flag.Expand().Center().Border();\n\n  \/\/ The top sizer starts with a spacer, for a nice border.\n  m_TopSizer->AddSpacer(wxSizerFlags::GetDefaultBorder());\n\n  \/\/ Then place the growable user sizer.\n  m_TopSizer->Add(m_UserSizer, flag);\n  m_TopSizer->AddGrowableRow(m_TopSizer->GetChildren().GetCount() - 1); \/\/ so this is the user sizer\n\n  \/\/ Then, if buttons were specified, the button sizer.\n  if (m_ButtonFlags != 0)\n  {\n    wxSizer* sbz;\n\n    if (add_separator_line)\n    {\n      sbz = CreateSeparatedButtonSizer(m_ButtonFlags);\n    }\n    else\n    {\n      sbz = CreateButtonSizer(m_ButtonFlags);\n    }\n\n    if (sbz != NULL)\n    {\n      m_TopSizer->Add(sbz, flag);\n    }\n  }\n\n  \/\/ The top sizer ends with a spacer as well.\n  m_TopSizer->AddSpacer(wxSizerFlags::GetDefaultBorder());\n\n  SetSizerAndFit(m_TopSizer);\n\n  wxPersistentRegisterAndRestore(this);\n}\n\nvoid wxExDialog::OnKeyDown(wxKeyEvent& event)\n{\n  \/\/ If we did not specify any buttons, then \n  \/\/ use the RETURN key as OK and ESCAPE key as CANCEL.\n  if (m_ButtonFlags == 0)\n  {\n    if (event.GetKeyCode() == WXK_RETURN)\n    {\n      wxCommandEvent event(wxEVT_COMMAND_BUTTON_CLICKED, wxID_OK);\n      wxPostEvent(this, event);\n    }\n    if (event.GetKeyCode() == WXK_ESCAPE)\n    {\n      wxCommandEvent event(wxEVT_COMMAND_BUTTON_CLICKED, wxID_CANCEL);\n      wxPostEvent(this, event);\n    }\n    else\n    {\n      event.Skip();\n    }\n  }\n  else\n  {\n    event.Skip();\n  }\n}\n\n#endif \/\/ wxUSE_GUI\n<commit_msg>added missing else<commit_after>\/******************************************************************************\\\n* File:          dialog.cpp\n* Purpose:       Implementation of wxExDialog 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\/persist\/toplevel.h>\n#include <wx\/extension\/dialog.h>\n\n#if wxUSE_GUI\nBEGIN_EVENT_TABLE(wxExDialog, wxDialog)\n  EVT_CHAR_HOOK(wxExDialog::OnKeyDown)\nEND_EVENT_TABLE()\n\nwxExDialog::wxExDialog(wxWindow* parent,\n  const wxString& title,\n  long button_flags,\n  wxWindowID id,\n  const wxPoint& pos,\n  const wxSize& size, \n  long style)\n  : wxDialog(parent, id, title, pos, size, style)\n  , m_ButtonFlags(button_flags)\n  , m_TopSizer(new wxFlexGridSizer(1, 0, 0))\n  , m_UserSizer(new wxFlexGridSizer(1, 0, 0))\n{\n  SetName(title);\n}\n\nwxSizerItem* wxExDialog::AddUserSizer(\n  wxWindow* window,\n  const wxSizerFlags& flags)\n{\n  wxSizerItem* item = m_UserSizer->Add(window, flags);\n\n  if (flags.GetFlags() & wxEXPAND)\n  {\n    m_UserSizer->AddGrowableRow(m_UserSizer->GetChildren().GetCount() - 1);\n  }\n\n  return item;\n}\n\nwxSizerItem* wxExDialog::AddUserSizer(\n  wxSizer* sizer,\n  const wxSizerFlags& flags)\n{\n  wxSizerItem* item = m_UserSizer->Add(sizer, flags);\n\n  if (flags.GetFlags() & wxEXPAND)\n  {\n    m_UserSizer->AddGrowableRow(m_UserSizer->GetChildren().GetCount() - 1);\n  }\n\n  return item;\n}\n\nvoid wxExDialog::LayoutSizers(bool add_separator_line)\n{\n  m_TopSizer->AddGrowableCol(0);\n  m_UserSizer->AddGrowableCol(0);\n\n  wxSizerFlags flag;\n  flag.Expand().Center().Border();\n\n  \/\/ The top sizer starts with a spacer, for a nice border.\n  m_TopSizer->AddSpacer(wxSizerFlags::GetDefaultBorder());\n\n  \/\/ Then place the growable user sizer.\n  m_TopSizer->Add(m_UserSizer, flag);\n  \/\/ So this is the user sizer, make the row growable.\n  m_TopSizer->AddGrowableRow(m_TopSizer->GetChildren().GetCount() - 1);\n\n  \/\/ Then, if buttons were specified, the button sizer.\n  if (m_ButtonFlags != 0)\n  {\n    wxSizer* sbz;\n\n    if (add_separator_line)\n    {\n      sbz = CreateSeparatedButtonSizer(m_ButtonFlags);\n    }\n    else\n    {\n      sbz = CreateButtonSizer(m_ButtonFlags);\n    }\n\n    if (sbz != NULL)\n    {\n      m_TopSizer->Add(sbz, flag);\n    }\n  }\n\n  \/\/ The top sizer ends with a spacer as well.\n  m_TopSizer->AddSpacer(wxSizerFlags::GetDefaultBorder());\n\n  SetSizerAndFit(m_TopSizer);\n\n  wxPersistentRegisterAndRestore(this);\n}\n\nvoid wxExDialog::OnKeyDown(wxKeyEvent& event)\n{\n  \/\/ If we did not specify any buttons, then \n  \/\/ use the RETURN key as OK and ESCAPE key as CANCEL.\n  if (m_ButtonFlags == 0)\n  {\n    if (event.GetKeyCode() == WXK_RETURN)\n    {\n      wxCommandEvent event(wxEVT_COMMAND_BUTTON_CLICKED, wxID_OK);\n      wxPostEvent(this, event);\n    }\n    else if (event.GetKeyCode() == WXK_ESCAPE)\n    {\n      wxCommandEvent event(wxEVT_COMMAND_BUTTON_CLICKED, wxID_CANCEL);\n      wxPostEvent(this, event);\n    }\n    else\n    {\n      event.Skip();\n    }\n  }\n  else\n  {\n    event.Skip();\n  }\n}\n\n#endif \/\/ wxUSE_GUI\n<|endoftext|>"}
{"text":"<commit_before>\/*\nThe MIT License (MIT)\n\nCopyright (c) 2013-2017 SRS(ossrs)\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#include <srs_app_dash.hpp>\n\n#include <srs_kernel_error.hpp>\n#include <srs_app_source.hpp>\n#include <srs_app_config.hpp>\n#include <srs_rtmp_stack.hpp>\n#include <srs_kernel_codec.hpp>\n#include <srs_kernel_utility.hpp>\n#include <srs_app_utility.hpp>\n#include <srs_kernel_file.hpp>\n\n#include <sstream>\nusing namespace std;\n\nSrsFragmentedMp4::SrsFragmentedMp4()\n{\n}\n\nSrsFragmentedMp4::~SrsFragmentedMp4()\n{\n}\n\nSrsMpdWriter::SrsMpdWriter()\n{\n    req = NULL;\n    timeshit = update_period = fragment = 0;\n    last_update_mpd = -1;\n}\n\nSrsMpdWriter::~SrsMpdWriter()\n{\n}\n\nint SrsMpdWriter::initialize(SrsRequest* r)\n{\n    int ret = ERROR_SUCCESS;\n    \n    req = r;\n    fragment = _srs_config->get_dash_fragment(r->vhost);\n    update_period = _srs_config->get_dash_update_period(r->vhost);\n    timeshit = _srs_config->get_dash_timeshift(r->vhost);\n    home = _srs_config->get_dash_path(r->vhost);\n    mpd_file = _srs_config->get_dash_mpd_file(r->vhost);\n    \n    return ret;\n}\n\nint SrsMpdWriter::write(SrsFormat* format)\n{\n    int ret = ERROR_SUCCESS;\n    \n    \/\/ MPD is not expired?\n    if (last_update_mpd != -1 && srs_get_system_time_ms() - last_update_mpd < update_period) {\n        return ret;\n    }\n    last_update_mpd = srs_get_system_time_ms();\n    \n    string mpd_path = srs_path_build_stream(mpd_file, req->vhost, req->app, req->stream);\n    string full_path = home + \"\/\" + mpd_path;\n    string full_home = srs_path_dirname(full_path);\n    \n    if ((ret = srs_create_dir_recursively(full_home)) != ERROR_SUCCESS) {\n        srs_error(\"DASH: create MPD home failed, home=%s, ret=%d\", full_home.c_str(), ret);\n        return ret;\n    }\n    \n    stringstream ss;\n    ss << \"<?xml version=\\\"1.0\\\" encoding=\\\"utf-8\\\"?>\" << endl\n        << \"<MPD profiles=\\\"urn:mpeg:dash:profile:isoff-live:2011,http:\/\/dashif.org\/guidelines\/dash-if-simple\\\" \" << endl\n        << \"    ns1:schemaLocation=\\\"urn:mpeg:dash:schema:mpd:2011 DASH-MPD.xsd\\\" \" << endl\n        << \"    xmlns=\\\"urn:mpeg:dash:schema:mpd:2011\\\" xmlns:ns1=\\\"http:\/\/www.w3.org\/2001\/XMLSchema-instance\\\" \" << endl\n        << \"    type=\\\"dynamic\\\" minimumUpdatePeriod=\\\"PT\" << update_period \/ 1000 << \"S\\\" \" << endl\n        << \"    timeShiftBufferDepth=\\\"PT\" << timeshit \/ 1000 << \"S\\\" availabilityStartTime=\\\"1970-01-01T00:00:00Z\\\" \" << endl\n        << \"    maxSegmentDuration=\\\"PT\" << fragment \/ 1000 << \"S\\\" minBufferTime=\\\"PT\" << fragment \/ 1000 << \"S\\\" >\" << endl\n        << \"    <BaseURL>\" << req->stream << \"\/\" << \"<\/BaseURL>\" << endl\n        << \"    <Period start=\\\"PT0S\\\">\" << endl;\n    if (format->acodec) {\n        ss  << \"        <AdaptationSet mimeType=\\\"audio\/mp4\\\" segmentAlignment=\\\"true\\\" startWithSAP=\\\"1\\\">\" << endl;\n        ss  << \"            <SegmentTemplate duration=\\\"\" << fragment \/ 1000 << \"\\\" \"\n                                << \"initialization=\\\"$RepresentationID$-init.mp4\\\" \"\n                                << \"media=\\\"$RepresentationID$-$Number$.m4s\\\" \/>\" << endl;\n        ss  << \"            <Representation id=\\\"audio\\\" bandwidth=\\\"48000\\\" codecs=\\\"mp4a.40.2\\\" \/>\" << endl;\n        ss  << \"        <\/AdaptationSet>\" << endl;\n    }\n    if (format->vcodec) {\n        int w = format->vcodec->width;\n        int h = format->vcodec->height;\n        ss  << \"        <AdaptationSet mimeType=\\\"video\/mp4\\\" segmentAlignment=\\\"true\\\" startWithSAP=\\\"1\\\">\" << endl;\n        ss  << \"            <SegmentTemplate duration=\\\"\" << fragment \/ 1000 << \"\\\" \"\n                                << \"initialization=\\\"$RepresentationID$-init.mp4\\\" \"\n                                << \"media=\\\"$RepresentationID$-$Number$.m4s\\\" \/>\" << endl;\n        ss  << \"            <Representation id=\\\"video\\\" bandwidth=\\\"800000\\\" codecs=\\\"avc1.64001e\\\" \"\n                                << \"width=\\\"\" << w << \"\\\" height=\\\"\" << h << \"\\\"\/>\" << endl;\n        ss  << \"        <\/AdaptationSet>\" << endl;\n    }\n    ss  << \"    <\/Period>\" << endl\n        << \"<\/MPD>\" << endl;\n    \n    SrsFileWriter fw;\n    string full_path_tmp = full_path + \".tmp\";\n    if ((ret = fw.open(full_path_tmp)) != ERROR_SUCCESS) {\n        srs_error(\"DASH: open MPD file=%s failed, ret=%d\", full_path_tmp.c_str(), ret);\n        return ret;\n    }\n    \n    string content = ss.str();\n    if ((ret = fw.write((void*)content.data(), content.length(), NULL)) != ERROR_SUCCESS) {\n        srs_error(\"DASH: write MPD file=%s failed, ret=%d\", full_path.c_str(), ret);\n        return ret;\n    }\n    \n    if (::rename(full_path_tmp.c_str(), full_path.c_str()) < 0) {\n        ret = ERROR_DASH_WRITE_FAILED;\n        srs_error(\"DASH: rename %s to %s failed, ret=%d\", full_path_tmp.c_str(), full_path.c_str(), ret);\n        return ret;\n    }\n    \n    srs_trace(\"DASH: refresh MPD successed, size=%dB, file=%s\", content.length(), full_path.c_str());\n    \n    return ret;\n}\n\nSrsDashController::SrsDashController()\n{\n    mpd = new SrsMpdWriter();\n}\n\nSrsDashController::~SrsDashController()\n{\n    srs_freep(mpd);\n}\n\nint SrsDashController::initialize(SrsRequest* r)\n{\n    int ret = ERROR_SUCCESS;\n    \n    if ((ret = mpd->initialize(r)) != ERROR_SUCCESS) {\n        return ret;\n    }\n    \n    return ret;\n}\n\nint SrsDashController::on_audio(SrsSharedPtrMessage* shared_audio, SrsFormat* format)\n{\n    int ret = ERROR_SUCCESS;\n    \n    if ((ret = refresh_mpd(format)) != ERROR_SUCCESS) {\n        srs_error(\"DASH: refresh the MPD failed. ret=%d\", ret);\n        return ret;\n    }\n    \n    return ret;\n}\n\nint SrsDashController::on_video(SrsSharedPtrMessage* shared_video, SrsFormat* format)\n{\n    int ret = ERROR_SUCCESS;\n    \n    if ((ret = refresh_mpd(format)) != ERROR_SUCCESS) {\n        srs_error(\"DASH: refresh the MPD failed. ret=%d\", ret);\n        return ret;\n    }\n    \n    return ret;\n}\n\nint SrsDashController::refresh_mpd(SrsFormat* format)\n{\n    int ret = ERROR_SUCCESS;\n    \n    \/\/ TODO: FIXME: Support pure audio streaming.\n    if (!format->acodec || !format->vcodec) {\n        return ret;\n    }\n    \n    if ((ret = mpd->write(format)) != ERROR_SUCCESS) {\n        return ret;\n    }\n    \n    return ret;\n}\n\nSrsDash::SrsDash()\n{\n    hub = NULL;\n    req = NULL;\n    controller = new SrsDashController();\n    \n    enabled = false;\n}\n\nSrsDash::~SrsDash()\n{\n    srs_freep(controller);\n}\n\nint SrsDash::initialize(SrsOriginHub* h, SrsRequest* r)\n{\n    int ret = ERROR_SUCCESS;\n    \n    hub = h;\n    req = r;\n    \n    if ((ret = controller->initialize(req)) != ERROR_SUCCESS) {\n        srs_error(\"DASH: initialize controller failed. ret=%d\", ret);\n        return ret;\n    }\n    \n    return ret;\n}\n\nint SrsDash::on_publish()\n{\n    int ret = ERROR_SUCCESS;\n    \n    \/\/ Prevent duplicated publish.\n    if (enabled) {\n        return ret;\n    }\n    \n    if (!_srs_config->get_dash_enabled(req->vhost)) {\n        return ret;\n    }\n    enabled = true;\n    \n    return ret;\n}\n\nint SrsDash::on_audio(SrsSharedPtrMessage* shared_audio, SrsFormat* format)\n{\n    int ret = ERROR_SUCCESS;\n    \n    if (!enabled) {\n        return ret;\n    }\n    \n    if ((ret = controller->on_audio(shared_audio, format)) != ERROR_SUCCESS) {\n        srs_error(\"DASH: consume audio failed. ret=%d\", ret);\n        return ret;\n    }\n    \n    return ret;\n}\n\nint SrsDash::on_video(SrsSharedPtrMessage* shared_video, SrsFormat* format)\n{\n    int ret = ERROR_SUCCESS;\n    \n    if (!enabled) {\n        return ret;\n    }\n    \n    if ((ret = controller->on_video(shared_video, format)) != ERROR_SUCCESS) {\n        srs_error(\"DASH: consume video failed. ret=%d\", ret);\n        return ret;\n    }\n    \n    return ret;\n}\n\nvoid SrsDash::on_unpublish()\n{\n    \/\/ Prevent duplicated unpublish.\n    if (!enabled) {\n        return;\n    }\n    \n    enabled = false;\n}\n\n<commit_msg>For #299, refine the comments.<commit_after>\/*\nThe MIT License (MIT)\n\nCopyright (c) 2013-2017 SRS(ossrs)\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#include <srs_app_dash.hpp>\n\n#include <srs_kernel_error.hpp>\n#include <srs_app_source.hpp>\n#include <srs_app_config.hpp>\n#include <srs_rtmp_stack.hpp>\n#include <srs_kernel_codec.hpp>\n#include <srs_kernel_utility.hpp>\n#include <srs_app_utility.hpp>\n#include <srs_kernel_file.hpp>\n\n#include <sstream>\nusing namespace std;\n\nSrsFragmentedMp4::SrsFragmentedMp4()\n{\n}\n\nSrsFragmentedMp4::~SrsFragmentedMp4()\n{\n}\n\nSrsMpdWriter::SrsMpdWriter()\n{\n    req = NULL;\n    timeshit = update_period = fragment = 0;\n    last_update_mpd = -1;\n}\n\nSrsMpdWriter::~SrsMpdWriter()\n{\n}\n\nint SrsMpdWriter::initialize(SrsRequest* r)\n{\n    int ret = ERROR_SUCCESS;\n    \n    req = r;\n    fragment = _srs_config->get_dash_fragment(r->vhost);\n    update_period = _srs_config->get_dash_update_period(r->vhost);\n    timeshit = _srs_config->get_dash_timeshift(r->vhost);\n    home = _srs_config->get_dash_path(r->vhost);\n    mpd_file = _srs_config->get_dash_mpd_file(r->vhost);\n    \n    return ret;\n}\n\nint SrsMpdWriter::write(SrsFormat* format)\n{\n    int ret = ERROR_SUCCESS;\n    \n    \/\/ MPD is not expired?\n    if (last_update_mpd != -1 && srs_get_system_time_ms() - last_update_mpd < update_period) {\n        return ret;\n    }\n    last_update_mpd = srs_get_system_time_ms();\n    \n    string mpd_path = srs_path_build_stream(mpd_file, req->vhost, req->app, req->stream);\n    string full_path = home + \"\/\" + mpd_path;\n    string full_home = srs_path_dirname(full_path);\n    \n    if ((ret = srs_create_dir_recursively(full_home)) != ERROR_SUCCESS) {\n        srs_error(\"DASH: Create MPD home failed, home=%s, ret=%d\", full_home.c_str(), ret);\n        return ret;\n    }\n    \n    stringstream ss;\n    ss << \"<?xml version=\\\"1.0\\\" encoding=\\\"utf-8\\\"?>\" << endl\n        << \"<MPD profiles=\\\"urn:mpeg:dash:profile:isoff-live:2011,http:\/\/dashif.org\/guidelines\/dash-if-simple\\\" \" << endl\n        << \"    ns1:schemaLocation=\\\"urn:mpeg:dash:schema:mpd:2011 DASH-MPD.xsd\\\" \" << endl\n        << \"    xmlns=\\\"urn:mpeg:dash:schema:mpd:2011\\\" xmlns:ns1=\\\"http:\/\/www.w3.org\/2001\/XMLSchema-instance\\\" \" << endl\n        << \"    type=\\\"dynamic\\\" minimumUpdatePeriod=\\\"PT\" << update_period \/ 1000 << \"S\\\" \" << endl\n        << \"    timeShiftBufferDepth=\\\"PT\" << timeshit \/ 1000 << \"S\\\" availabilityStartTime=\\\"1970-01-01T00:00:00Z\\\" \" << endl\n        << \"    maxSegmentDuration=\\\"PT\" << fragment \/ 1000 << \"S\\\" minBufferTime=\\\"PT\" << fragment \/ 1000 << \"S\\\" >\" << endl\n        << \"    <BaseURL>\" << req->stream << \"\/\" << \"<\/BaseURL>\" << endl\n        << \"    <Period start=\\\"PT0S\\\">\" << endl;\n    if (format->acodec) {\n        ss  << \"        <AdaptationSet mimeType=\\\"audio\/mp4\\\" segmentAlignment=\\\"true\\\" startWithSAP=\\\"1\\\">\" << endl;\n        ss  << \"            <SegmentTemplate duration=\\\"\" << fragment \/ 1000 << \"\\\" \"\n                                << \"initialization=\\\"$RepresentationID$-init.mp4\\\" \"\n                                << \"media=\\\"$RepresentationID$-$Number$.m4s\\\" \/>\" << endl;\n        ss  << \"            <Representation id=\\\"audio\\\" bandwidth=\\\"48000\\\" codecs=\\\"mp4a.40.2\\\" \/>\" << endl;\n        ss  << \"        <\/AdaptationSet>\" << endl;\n    }\n    if (format->vcodec) {\n        int w = format->vcodec->width;\n        int h = format->vcodec->height;\n        ss  << \"        <AdaptationSet mimeType=\\\"video\/mp4\\\" segmentAlignment=\\\"true\\\" startWithSAP=\\\"1\\\">\" << endl;\n        ss  << \"            <SegmentTemplate duration=\\\"\" << fragment \/ 1000 << \"\\\" \"\n                                << \"initialization=\\\"$RepresentationID$-init.mp4\\\" \"\n                                << \"media=\\\"$RepresentationID$-$Number$.m4s\\\" \/>\" << endl;\n        ss  << \"            <Representation id=\\\"video\\\" bandwidth=\\\"800000\\\" codecs=\\\"avc1.64001e\\\" \"\n                                << \"width=\\\"\" << w << \"\\\" height=\\\"\" << h << \"\\\"\/>\" << endl;\n        ss  << \"        <\/AdaptationSet>\" << endl;\n    }\n    ss  << \"    <\/Period>\" << endl\n        << \"<\/MPD>\" << endl;\n    \n    SrsFileWriter fw;\n    string full_path_tmp = full_path + \".tmp\";\n    if ((ret = fw.open(full_path_tmp)) != ERROR_SUCCESS) {\n        srs_error(\"DASH: Open MPD file=%s failed, ret=%d\", full_path_tmp.c_str(), ret);\n        return ret;\n    }\n    \n    string content = ss.str();\n    if ((ret = fw.write((void*)content.data(), content.length(), NULL)) != ERROR_SUCCESS) {\n        srs_error(\"DASH: Write MPD file=%s failed, ret=%d\", full_path.c_str(), ret);\n        return ret;\n    }\n    \n    if (::rename(full_path_tmp.c_str(), full_path.c_str()) < 0) {\n        ret = ERROR_DASH_WRITE_FAILED;\n        srs_error(\"DASH: Rename %s to %s failed, ret=%d\", full_path_tmp.c_str(), full_path.c_str(), ret);\n        return ret;\n    }\n    \n    srs_trace(\"DASH: Refresh MPD successed, size=%dB, file=%s\", content.length(), full_path.c_str());\n    \n    return ret;\n}\n\nSrsDashController::SrsDashController()\n{\n    mpd = new SrsMpdWriter();\n}\n\nSrsDashController::~SrsDashController()\n{\n    srs_freep(mpd);\n}\n\nint SrsDashController::initialize(SrsRequest* r)\n{\n    int ret = ERROR_SUCCESS;\n    \n    if ((ret = mpd->initialize(r)) != ERROR_SUCCESS) {\n        return ret;\n    }\n    \n    return ret;\n}\n\nint SrsDashController::on_audio(SrsSharedPtrMessage* shared_audio, SrsFormat* format)\n{\n    int ret = ERROR_SUCCESS;\n    \n    if ((ret = refresh_mpd(format)) != ERROR_SUCCESS) {\n        srs_error(\"DASH: Refresh the MPD failed. ret=%d\", ret);\n        return ret;\n    }\n    \n    return ret;\n}\n\nint SrsDashController::on_video(SrsSharedPtrMessage* shared_video, SrsFormat* format)\n{\n    int ret = ERROR_SUCCESS;\n    \n    if ((ret = refresh_mpd(format)) != ERROR_SUCCESS) {\n        srs_error(\"DASH: Refresh the MPD failed. ret=%d\", ret);\n        return ret;\n    }\n    \n    return ret;\n}\n\nint SrsDashController::refresh_mpd(SrsFormat* format)\n{\n    int ret = ERROR_SUCCESS;\n    \n    \/\/ TODO: FIXME: Support pure audio streaming.\n    if (!format->acodec || !format->vcodec) {\n        return ret;\n    }\n    \n    if ((ret = mpd->write(format)) != ERROR_SUCCESS) {\n        return ret;\n    }\n    \n    return ret;\n}\n\nSrsDash::SrsDash()\n{\n    hub = NULL;\n    req = NULL;\n    controller = new SrsDashController();\n    \n    enabled = false;\n}\n\nSrsDash::~SrsDash()\n{\n    srs_freep(controller);\n}\n\nint SrsDash::initialize(SrsOriginHub* h, SrsRequest* r)\n{\n    int ret = ERROR_SUCCESS;\n    \n    hub = h;\n    req = r;\n    \n    if ((ret = controller->initialize(req)) != ERROR_SUCCESS) {\n        srs_error(\"DASH: Initialize controller failed. ret=%d\", ret);\n        return ret;\n    }\n    \n    return ret;\n}\n\nint SrsDash::on_publish()\n{\n    int ret = ERROR_SUCCESS;\n    \n    \/\/ Prevent duplicated publish.\n    if (enabled) {\n        return ret;\n    }\n    \n    if (!_srs_config->get_dash_enabled(req->vhost)) {\n        return ret;\n    }\n    enabled = true;\n    \n    return ret;\n}\n\nint SrsDash::on_audio(SrsSharedPtrMessage* shared_audio, SrsFormat* format)\n{\n    int ret = ERROR_SUCCESS;\n    \n    if (!enabled) {\n        return ret;\n    }\n    \n    if ((ret = controller->on_audio(shared_audio, format)) != ERROR_SUCCESS) {\n        srs_error(\"DASH: Consume audio failed. ret=%d\", ret);\n        return ret;\n    }\n    \n    return ret;\n}\n\nint SrsDash::on_video(SrsSharedPtrMessage* shared_video, SrsFormat* format)\n{\n    int ret = ERROR_SUCCESS;\n    \n    if (!enabled) {\n        return ret;\n    }\n    \n    if ((ret = controller->on_video(shared_video, format)) != ERROR_SUCCESS) {\n        srs_error(\"DASH: Consume video failed. ret=%d\", ret);\n        return ret;\n    }\n    \n    return ret;\n}\n\nvoid SrsDash::on_unpublish()\n{\n    \/\/ Prevent duplicated unpublish.\n    if (!enabled) {\n        return;\n    }\n    \n    enabled = false;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/   ChCCollisionSystemGPU->cpp\n\/\/\n\/\/ ------------------------------------------------\n\/\/       Copyright:Alessandro Tasora \/ DeltaKnowledge\n\/\/             www.deltaknowledge.com\n\/\/ ------------------------------------------------\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"chrono_parallel\/collision\/ChCCollisionSystemParallel.h\"\n\nnamespace chrono {\nnamespace collision {\n\nChCollisionSystemParallel::ChCollisionSystemParallel(ChParallelDataManager* dc) : data_container(dc) {\n  broadphase = new ChCBroadphase;\n  narrowphase = new ChCNarrowphaseDispatch;\n  narrowphase->data_container = dc;\n}\n\nChCollisionSystemParallel::~ChCollisionSystemParallel() {\n  delete narrowphase;\n  delete broadphase;\n}\n\nvoid ChCollisionSystemParallel::Add(ChCollisionModel* model) {\n  if (model->GetPhysicsItem()->GetCollide() == true) {\n    ChCollisionModelParallel* pmodel = static_cast<ChCollisionModelParallel*>(model);\n    int body_id = pmodel->GetBody()->GetId();\n    short2 fam = S2(pmodel->GetFamilyGroup(), pmodel->GetFamilyMask());\n\n    for (int j = 0; j < pmodel->GetNObjects(); j++) {\n      real3 obB = pmodel->mData[j].B;\n\n      int convex_data_offset = data_container->host_data.convex_data.size();\n      data_container->host_data.convex_data.insert(data_container->host_data.convex_data.end(),\n                                                   pmodel->local_convex_data.begin(),\n                                                   pmodel->local_convex_data.end());\n\n      \/\/ Compute the global offset of the convex data structure based on the number of points\n      \/\/ already present\n      if (pmodel->mData[j].type == CONVEX) {\n        obB.y += convex_data_offset;  \/\/ update to get the global offset\n      }\n\n      data_container->host_data.ObA_rigid.push_back(pmodel->mData[j].A);\n      data_container->host_data.ObB_rigid.push_back(obB);\n      data_container->host_data.ObC_rigid.push_back(pmodel->mData[j].C);\n      data_container->host_data.ObR_rigid.push_back(pmodel->mData[j].R);\n      data_container->host_data.fam_rigid.push_back(fam);\n      data_container->host_data.margin_rigid.push_back(pmodel->mData[j].margin);\n      data_container->host_data.typ_rigid.push_back(pmodel->mData[j].type);\n      data_container->host_data.id_rigid.push_back(body_id);\n      data_container->num_shapes++;\n    }\n  }\n}\n\nvoid ChCollisionSystemParallel::Remove(ChCollisionModel* model) {\n  \/\/            ChCollisionModelGPU *body = (ChCollisionModelGPU *) model;\n  \/\/            int body_id = ((ChBodyGPU *) body->GetBody())->id;\n  \/\/\n  \/\/            \/\/for (int j = 0; j < body->GetNObjects(); j++) {\n  \/\/            for (int i = 0; i < data_container->host_typ_data.size(); i++) {\n  \/\/                if (data_container->host_typ_data[i].z == body_id) {\n  \/\/                    data_container->host_ObA_data.erase(data_container->host_ObA_data.begin() + i);\n  \/\/                    data_container->host_ObB_data.erase(data_container->host_ObB_data.begin() + i);\n  \/\/                    data_container->host_ObC_data.erase(data_container->host_ObC_data.begin() + i);\n  \/\/                    data_container->host_ObR_data.erase(data_container->host_ObR_data.begin() + i);\n  \/\/                    data_container->host_fam_data.erase(data_container->host_fam_data.begin() + i);\n  \/\/                    data_container->host_typ_data.erase(data_container->host_typ_data.begin() + i);\n  \/\/                    data_container->num_models--;\n  \/\/                    return;\n  \/\/                }\n  \/\/            }\n  \/\/\n  \/\/            \/\/}\n}\n\nvoid ChCollisionSystemParallel::Run() {\n  if (data_container->settings.collision.use_aabb_active) {\n    custom_vector<bool> body_active(data_container->num_bodies, false);\n    GetOverlappingAABB(\n        body_active, data_container->settings.collision.aabb_min, data_container->settings.collision.aabb_max);\n    for (int i = 0; i < data_container->host_data.active_data.size(); i++) {\n      if (data_container->host_data.active_data[i] == true && data_container->host_data.collide_data[i] == true) {\n        data_container->host_data.active_data[i] = body_active[i];\n      }\n    }\n  }\n\n  if (data_container->num_shapes <= 0) {\n    return;\n  }\n\n  data_container->old_num_contacts = data_container->num_contacts;\n  data_container->system_timer.start(\"collision_broad\");\n\n  aabb_generator.GenerateAABB(data_container->host_data.typ_rigid,\n                              data_container->host_data.ObA_rigid,\n                              data_container->host_data.ObB_rigid,\n                              data_container->host_data.ObC_rigid,\n                              data_container->host_data.ObR_rigid,\n                              data_container->host_data.id_rigid,\n                              data_container->host_data.convex_data,\n                              data_container->host_data.pos_data,\n                              data_container->host_data.rot_data,\n                              data_container->settings.collision.collision_envelope,\n                              data_container->host_data.aabb_rigid);\n\n  \/\/ aabb_generator.GenerateAABBFluid(data_container->host_data.fluid_pos, data_container->fluid_rad,\n  \/\/ data_container->host_data.aabb_fluid);\n  broadphase->setBinsPerAxis(data_container->settings.collision.bins_per_axis);\n  broadphase->detectPossibleCollisions(data_container);\n  data_container->system_timer.stop(\"collision_broad\");\n\n  data_container->measures.collision.bin_size_vec = broadphase->bin_size_vec;\n  data_container->measures.collision.global_origin = broadphase->global_origin;\n  data_container->measures.collision.grid_size = broadphase->grid_size;\n  data_container->measures.collision.max_aabb_per_bin = broadphase->max_body_per_bin;\n  data_container->measures.collision.max_bounding_point = broadphase->max_bounding_point;\n  data_container->measures.collision.min_bounding_point = broadphase->min_bounding_point;\n  data_container->measures.collision.numAABB = broadphase->numAABB;\n\n  data_container->system_timer.start(\"collision_narrow\");\n  narrowphase->Process();\n  data_container->system_timer.stop(\"collision_narrow\");\n}\n\nvoid ChCollisionSystemParallel::GetOverlappingAABB(custom_vector<bool>& active_id, real3 Amin, real3 Amax) {\n  ChCAABBGenerator aabb_generator;\n\n  aabb_generator.GenerateAABB(data_container->host_data.typ_rigid,\n                              data_container->host_data.ObA_rigid,\n                              data_container->host_data.ObB_rigid,\n                              data_container->host_data.ObC_rigid,\n                              data_container->host_data.ObR_rigid,\n                              data_container->host_data.id_rigid,\n                              data_container->host_data.convex_data,\n                              data_container->host_data.pos_data,\n                              data_container->host_data.rot_data,\n                              data_container->settings.collision.collision_envelope,\n                              data_container->host_data.aabb_rigid);\n#pragma omp parallel for\n  for (int i = 0; i < data_container->host_data.typ_rigid.size(); i++) {\n    real3 Bmin = data_container->host_data.aabb_rigid[i];\n    real3 Bmax = data_container->host_data.aabb_rigid[i + data_container->host_data.typ_rigid.size()];\n\n    bool inContact = (Amin.x <= Bmax.x && Bmin.x <= Amax.x) && (Amin.y <= Bmax.y && Bmin.y <= Amax.y) &&\n                     (Amin.z <= Bmax.z && Bmin.z <= Amax.z);\n    if (inContact) {\n      active_id[data_container->host_data.id_rigid[i]] = true;\n    }\n  }\n}\n\nstd::vector<int2> ChCollisionSystemParallel::GetOverlappingPairs() {\n  std::vector<int2> pairs;\n  pairs.resize(data_container->host_data.pair_rigid_rigid.size());\n  for (int i = 0; i < data_container->host_data.pair_rigid_rigid.size(); i++) {\n    int2 pair = I2(int(data_container->host_data.pair_rigid_rigid[i] >> 32),\n                   int(data_container->host_data.pair_rigid_rigid[i] & 0xffffffff));\n    pairs[i] = pair;\n  }\n  return pairs;\n}\n\n}  \/\/ END_OF_NAMESPACE____\n}  \/\/ END_OF_NAMESPACE____\n<commit_msg>Convex data points need to be added once for the collision model<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/   ChCCollisionSystemGPU->cpp\n\/\/\n\/\/ ------------------------------------------------\n\/\/       Copyright:Alessandro Tasora \/ DeltaKnowledge\n\/\/             www.deltaknowledge.com\n\/\/ ------------------------------------------------\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"chrono_parallel\/collision\/ChCCollisionSystemParallel.h\"\n\nnamespace chrono {\nnamespace collision {\n\nChCollisionSystemParallel::ChCollisionSystemParallel(ChParallelDataManager* dc) : data_container(dc) {\n  broadphase = new ChCBroadphase;\n  narrowphase = new ChCNarrowphaseDispatch;\n  narrowphase->data_container = dc;\n}\n\nChCollisionSystemParallel::~ChCollisionSystemParallel() {\n  delete narrowphase;\n  delete broadphase;\n}\n\nvoid ChCollisionSystemParallel::Add(ChCollisionModel* model) {\n  if (model->GetPhysicsItem()->GetCollide() == true) {\n    ChCollisionModelParallel* pmodel = static_cast<ChCollisionModelParallel*>(model);\n    int body_id = pmodel->GetBody()->GetId();\n    short2 fam = S2(pmodel->GetFamilyGroup(), pmodel->GetFamilyMask());\n    \/\/ The offset for this shape will the current total number of points in\n    \/\/ the convex data list\n    int convex_data_offset = data_container->host_data.convex_data.size();\n    \/\/Insert the points into the global convex list\n    data_container->host_data.convex_data.insert(data_container->host_data.convex_data.end(),\n                                                 pmodel->local_convex_data.begin(),\n                                                 pmodel->local_convex_data.end());\n\n    for (int j = 0; j < pmodel->GetNObjects(); j++) {\n      real3 obB = pmodel->mData[j].B;\n\n      \/\/ Compute the global offset of the convex data structure based on the number of points\n      \/\/ already present\n      if (pmodel->mData[j].type == CONVEX) {\n        obB.y += convex_data_offset;  \/\/ update to get the global offset\n      }\n\n      data_container->host_data.ObA_rigid.push_back(pmodel->mData[j].A);\n      data_container->host_data.ObB_rigid.push_back(obB);\n      data_container->host_data.ObC_rigid.push_back(pmodel->mData[j].C);\n      data_container->host_data.ObR_rigid.push_back(pmodel->mData[j].R);\n      data_container->host_data.fam_rigid.push_back(fam);\n      data_container->host_data.margin_rigid.push_back(pmodel->mData[j].margin);\n      data_container->host_data.typ_rigid.push_back(pmodel->mData[j].type);\n      data_container->host_data.id_rigid.push_back(body_id);\n      data_container->num_shapes++;\n    }\n  }\n}\n\nvoid ChCollisionSystemParallel::Remove(ChCollisionModel* model) {\n  \/\/            ChCollisionModelGPU *body = (ChCollisionModelGPU *) model;\n  \/\/            int body_id = ((ChBodyGPU *) body->GetBody())->id;\n  \/\/\n  \/\/            \/\/for (int j = 0; j < body->GetNObjects(); j++) {\n  \/\/            for (int i = 0; i < data_container->host_typ_data.size(); i++) {\n  \/\/                if (data_container->host_typ_data[i].z == body_id) {\n  \/\/                    data_container->host_ObA_data.erase(data_container->host_ObA_data.begin() + i);\n  \/\/                    data_container->host_ObB_data.erase(data_container->host_ObB_data.begin() + i);\n  \/\/                    data_container->host_ObC_data.erase(data_container->host_ObC_data.begin() + i);\n  \/\/                    data_container->host_ObR_data.erase(data_container->host_ObR_data.begin() + i);\n  \/\/                    data_container->host_fam_data.erase(data_container->host_fam_data.begin() + i);\n  \/\/                    data_container->host_typ_data.erase(data_container->host_typ_data.begin() + i);\n  \/\/                    data_container->num_models--;\n  \/\/                    return;\n  \/\/                }\n  \/\/            }\n  \/\/\n  \/\/            \/\/}\n}\n\nvoid ChCollisionSystemParallel::Run() {\n  if (data_container->settings.collision.use_aabb_active) {\n    custom_vector<bool> body_active(data_container->num_bodies, false);\n    GetOverlappingAABB(\n        body_active, data_container->settings.collision.aabb_min, data_container->settings.collision.aabb_max);\n    for (int i = 0; i < data_container->host_data.active_data.size(); i++) {\n      if (data_container->host_data.active_data[i] == true && data_container->host_data.collide_data[i] == true) {\n        data_container->host_data.active_data[i] = body_active[i];\n      }\n    }\n  }\n\n  if (data_container->num_shapes <= 0) {\n    return;\n  }\n\n  data_container->old_num_contacts = data_container->num_contacts;\n  data_container->system_timer.start(\"collision_broad\");\n\n  aabb_generator.GenerateAABB(data_container->host_data.typ_rigid,\n                              data_container->host_data.ObA_rigid,\n                              data_container->host_data.ObB_rigid,\n                              data_container->host_data.ObC_rigid,\n                              data_container->host_data.ObR_rigid,\n                              data_container->host_data.id_rigid,\n                              data_container->host_data.convex_data,\n                              data_container->host_data.pos_data,\n                              data_container->host_data.rot_data,\n                              data_container->settings.collision.collision_envelope,\n                              data_container->host_data.aabb_rigid);\n\n  \/\/ aabb_generator.GenerateAABBFluid(data_container->host_data.fluid_pos, data_container->fluid_rad,\n  \/\/ data_container->host_data.aabb_fluid);\n  broadphase->setBinsPerAxis(data_container->settings.collision.bins_per_axis);\n  broadphase->detectPossibleCollisions(data_container);\n  data_container->system_timer.stop(\"collision_broad\");\n\n  data_container->measures.collision.bin_size_vec = broadphase->bin_size_vec;\n  data_container->measures.collision.global_origin = broadphase->global_origin;\n  data_container->measures.collision.grid_size = broadphase->grid_size;\n  data_container->measures.collision.max_aabb_per_bin = broadphase->max_body_per_bin;\n  data_container->measures.collision.max_bounding_point = broadphase->max_bounding_point;\n  data_container->measures.collision.min_bounding_point = broadphase->min_bounding_point;\n  data_container->measures.collision.numAABB = broadphase->numAABB;\n\n  data_container->system_timer.start(\"collision_narrow\");\n  narrowphase->Process();\n  data_container->system_timer.stop(\"collision_narrow\");\n}\n\nvoid ChCollisionSystemParallel::GetOverlappingAABB(custom_vector<bool>& active_id, real3 Amin, real3 Amax) {\n  ChCAABBGenerator aabb_generator;\n\n  aabb_generator.GenerateAABB(data_container->host_data.typ_rigid,\n                              data_container->host_data.ObA_rigid,\n                              data_container->host_data.ObB_rigid,\n                              data_container->host_data.ObC_rigid,\n                              data_container->host_data.ObR_rigid,\n                              data_container->host_data.id_rigid,\n                              data_container->host_data.convex_data,\n                              data_container->host_data.pos_data,\n                              data_container->host_data.rot_data,\n                              data_container->settings.collision.collision_envelope,\n                              data_container->host_data.aabb_rigid);\n#pragma omp parallel for\n  for (int i = 0; i < data_container->host_data.typ_rigid.size(); i++) {\n    real3 Bmin = data_container->host_data.aabb_rigid[i];\n    real3 Bmax = data_container->host_data.aabb_rigid[i + data_container->host_data.typ_rigid.size()];\n\n    bool inContact = (Amin.x <= Bmax.x && Bmin.x <= Amax.x) && (Amin.y <= Bmax.y && Bmin.y <= Amax.y) &&\n                     (Amin.z <= Bmax.z && Bmin.z <= Amax.z);\n    if (inContact) {\n      active_id[data_container->host_data.id_rigid[i]] = true;\n    }\n  }\n}\n\nstd::vector<int2> ChCollisionSystemParallel::GetOverlappingPairs() {\n  std::vector<int2> pairs;\n  pairs.resize(data_container->host_data.pair_rigid_rigid.size());\n  for (int i = 0; i < data_container->host_data.pair_rigid_rigid.size(); i++) {\n    int2 pair = I2(int(data_container->host_data.pair_rigid_rigid[i] >> 32),\n                   int(data_container->host_data.pair_rigid_rigid[i] & 0xffffffff));\n    pairs[i] = pair;\n  }\n  return pairs;\n}\n\n}  \/\/ END_OF_NAMESPACE____\n}  \/\/ END_OF_NAMESPACE____\n<|endoftext|>"}
{"text":"<commit_before>#include \"TUDPSocket.h\"\n#include \"TString.h\"\n\n\/\/\n\/\/ As test echo server use udpserver.c in the same directory.\n\/\/ To compile it do:\n\/\/    clang udpserver.c -o udpserver\n\/\/\n\n\/\/ int createTServerSocket(){\n\/\/    printf(\"testTSocket: Creating TSocket\\n\");\n\/\/    TServerSocket * fServerSocket = new TServerSocket(1501, 0, 0, -1, \"UDP\");\n\/\/ \n\/\/    TMonitor *mon = new TMonitor;\n\/\/ \n\/\/    mon->Add(fServerSocket);\n\/\/ \n\/\/    TSocket *s0 = 0;\n\/\/ \n\/\/  \/\/  while (1) {\n\/\/       char msgRaw[1024] = {0};\n\/\/       TSocket  *s;\n\/\/ \n\/\/       s = mon->Select();\n\/\/ \n\/\/       if (s->IsA() == TServerSocket::Class()) {\n\/\/          if (!s0) {\n\/\/             s0 = ((TServerSocket *)s)->Accept();\n\/\/             s0->Send(\"go 0\");\n\/\/             mon->Add(s0);\n\/\/          }\n\/\/ \n\/\/          if (s0) {\n\/\/             mon->Remove(ss);\n\/\/             ss->Close();\n\/\/          }\n\/\/          continue;\n\/\/       }\n\/\/ \n\/\/       s->RecvRaw((void *) msgRaw, 1024);\n\/\/       printf(\"Server Message Received %s\\n\", msgRaw);\n\/\/       s->SendRaw(msgRaw, 1024);\n\/\/ \n\/\/ \/\/ }\/* end of server infinite loop *\/  \n\/\/    \n\/\/    s0->Close();\n\/\/    \n\/\/    return 1;\n\/\/ }\n\nint testTUDPSocket()\n{\t\n\tprintf(\"testTSocket: Creating TUDPSocket\\n\");\n\tTUDPSocket * fSocket = new TUDPSocket(\"localhost\", 1500);\n\t\n\tif(!fSocket || !fSocket->IsValid()){\n\t\tError(\"testTSocket\",\"cannot connect to localhost\");\n\t\treturn -1;\n\t}\n\n\tTString msg = \"testTSocket: Testing TSocket with UDP\";\n\t\n\tprintf(\"%s\\n\",msg.Data());\n\n\tif(fSocket->SendRaw(msg.Data(), msg.Length()) == -1) {\n    \tError(\"testTSocket\", \"error sending command to host %s\", fServer.GetHost());\n    \treturn -1;\n   \t}\n\n\tchar msgRaw[1024] = {0};\n\n\tfSocket->SetOption(kNoBlock, 1);\n\tfSocket->Select();\n\n\tInt_t recvBytes = fSocket->RecvRaw(msgRaw, 1024);\n\n\tif(recvBytes == -1){\n\t\tError(\"testTSocket\", \"error receiving data from host %s\", fServer.GetHost());\n\t\treturn -1;\n\t}\n\n\tprintf(\"Received Message: \\n%s\\n\",msgRaw);\n\t\n\treturn 1;\n}\n<commit_msg>white space and formatting.<commit_after>#include \"TUDPSocket.h\"\n#include \"TString.h\"\n\n\/\/\n\/\/ As test echo server use udpserver.c in the same directory.\n\/\/ To compile it do:\n\/\/    clang udpserver.c -o udpserver\n\/\/\n\n\/\/ int createTServerSocket(){\n\/\/    printf(\"testTSocket: Creating TSocket\\n\");\n\/\/    TServerSocket * fServerSocket = new TServerSocket(1501, 0, 0, -1, \"UDP\");\n\/\/\n\/\/    TMonitor *mon = new TMonitor;\n\/\/\n\/\/    mon->Add(fServerSocket);\n\/\/\n\/\/    TSocket *s0 = 0;\n\/\/\n\/\/  \/\/  while (1) {\n\/\/       char msgRaw[1024] = {0};\n\/\/       TSocket  *s;\n\/\/\n\/\/       s = mon->Select();\n\/\/\n\/\/       if (s->IsA() == TServerSocket::Class()) {\n\/\/          if (!s0) {\n\/\/             s0 = ((TServerSocket *)s)->Accept();\n\/\/             s0->Send(\"go 0\");\n\/\/             mon->Add(s0);\n\/\/          }\n\/\/\n\/\/          if (s0) {\n\/\/             mon->Remove(ss);\n\/\/             ss->Close();\n\/\/          }\n\/\/          continue;\n\/\/       }\n\/\/\n\/\/       s->RecvRaw((void *) msgRaw, 1024);\n\/\/       printf(\"Server Message Received %s\\n\", msgRaw);\n\/\/       s->SendRaw(msgRaw, 1024);\n\/\/\n\/\/ \/\/ }\/* end of server infinite loop *\/\n\/\/\n\/\/    s0->Close();\n\/\/\n\/\/    return 1;\n\/\/ }\n\nint testTUDPSocket()\n{\n   printf(\"testTSocket: Creating TUDPSocket\\n\");\n   TUDPSocket * fSocket = new TUDPSocket(\"localhost\", 1500);\n\n   if (!fSocket || !fSocket->IsValid()) {\n      Error(\"testTSocket\",\"cannot connect to localhost\");\n      return -1;\n   }\n\n   TString msg = \"testTSocket: Testing TSocket with UDP\";\n\n   printf(\"%s\\n\",msg.Data());\n\n   if (fSocket->SendRaw(msg.Data(), msg.Length()) == -1) {\n      Error(\"testTSocket\", \"error sending command to host %s\", fServer.GetHost());\n      return -1;\n   }\n\n   char msgRaw[1024] = {0};\n\n   fSocket->SetOption(kNoBlock, 1);\n   fSocket->Select();\n\n   Int_t recvBytes = fSocket->RecvRaw(msgRaw, 1024);\n\n   if (recvBytes == -1){\n      Error(\"testTSocket\", \"error receiving data from host %s\", fServer.GetHost());\n      return -1;\n   }\n\n   printf(\"Received Message: \\n%s\\n\",msgRaw);\n\n   return 1;\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) 2010 Manuel Yguel <manuel.yguel@gmail.com>\n\/\/\n\/\/ This Source Code Form is subject to the terms of the Mozilla\n\/\/ Public License v. 2.0. If a copy of the MPL was not distributed\n\/\/ with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#include \"main.h\"\n#include <unsupported\/Eigen\/Polynomials>\n#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n\nnamespace Eigen {\nnamespace internal {\ntemplate<int Size>\nstruct increment_if_fixed_size\n{\n  enum {\n    ret = (Size == Dynamic) ? Dynamic : Size+1\n  };\n};\n}\n}\n\n\ntemplate<int Deg, typename POLYNOMIAL, typename SOLVER>\nbool aux_evalSolver( const POLYNOMIAL& pols, SOLVER& psolve )\n{\n  typedef typename POLYNOMIAL::Index Index;\n  typedef typename POLYNOMIAL::Scalar Scalar;\n\n  typedef typename SOLVER::RootsType    RootsType;\n  typedef Matrix<Scalar,Deg,1>          EvalRootsType;\n\n  const Index deg = pols.size()-1;\n\n  psolve.compute( pols );\n  const RootsType& roots( psolve.roots() );\n  EvalRootsType evr( deg );\n  for( int i=0; i<roots.size(); ++i ){\n    evr[i] = std::abs( poly_eval( pols, roots[i] ) ); }\n\n  bool evalToZero = evr.isZero( test_precision<Scalar>() );\n  if( !evalToZero )\n  {\n    cerr << \"WRONG root: \" << endl;\n    cerr << \"Polynomial: \" << pols.transpose() << endl;\n    cerr << \"Roots found: \" << roots.transpose() << endl;\n    cerr << \"Abs value of the polynomial at the roots: \" << evr.transpose() << endl;\n    cerr << endl;\n  }\n\n  std::vector<Scalar> rootModuli( roots.size() );\n  Map< EvalRootsType > aux( &rootModuli[0], roots.size() );\n  aux = roots.array().abs();\n  std::sort( rootModuli.begin(), rootModuli.end() );\n  bool distinctModuli=true;\n  for( size_t i=1; i<rootModuli.size() && distinctModuli; ++i )\n  {\n    if( internal::isApprox( rootModuli[i], rootModuli[i-1] ) ){\n      distinctModuli = false; }\n  }\n  VERIFY( evalToZero || !distinctModuli );\n\n  return distinctModuli;\n}\n\n\n\n\n\n\n\ntemplate<int Deg, typename POLYNOMIAL>\nvoid evalSolver( const POLYNOMIAL& pols )\n{\n  typedef typename POLYNOMIAL::Scalar Scalar;\n\n  typedef PolynomialSolver<Scalar, Deg >              PolynomialSolverType;\n\n  PolynomialSolverType psolve;\n  aux_evalSolver<Deg, POLYNOMIAL, PolynomialSolverType>( pols, psolve );\n}\n\n\n\n\ntemplate< int Deg, typename POLYNOMIAL, typename ROOTS, typename REAL_ROOTS >\nvoid evalSolverSugarFunction( const POLYNOMIAL& pols, const ROOTS& roots, const REAL_ROOTS& real_roots )\n{\n  using std::sqrt;\n  typedef typename POLYNOMIAL::Scalar Scalar;\n\n  typedef PolynomialSolver<Scalar, Deg >              PolynomialSolverType;\n\n  PolynomialSolverType psolve;\n  if( aux_evalSolver<Deg, POLYNOMIAL, PolynomialSolverType>( pols, psolve ) )\n  {\n    \/\/It is supposed that\n    \/\/ 1) the roots found are correct\n    \/\/ 2) the roots have distinct moduli\n\n    typedef typename POLYNOMIAL::Scalar                 Scalar;\n    typedef typename REAL_ROOTS::Scalar                 Real;\n\n    \/\/Test realRoots\n    std::vector< Real > calc_realRoots;\n    psolve.realRoots( calc_realRoots );\n    VERIFY( calc_realRoots.size() == (size_t)real_roots.size() );\n\n    const Scalar psPrec = sqrt( test_precision<Scalar>() );\n\n    for( size_t i=0; i<calc_realRoots.size(); ++i )\n    {\n      bool found = false;\n      for( size_t j=0; j<calc_realRoots.size()&& !found; ++j )\n      {\n        if( internal::isApprox( calc_realRoots[i], real_roots[j], psPrec ) ){\n          found = true; }\n      }\n      VERIFY( found );\n    }\n\n    \/\/Test greatestRoot\n    VERIFY( internal::isApprox( roots.array().abs().maxCoeff(),\n          abs( psolve.greatestRoot() ), psPrec ) );\n\n    \/\/Test smallestRoot\n    VERIFY( internal::isApprox( roots.array().abs().minCoeff(),\n          abs( psolve.smallestRoot() ), psPrec ) );\n\n    bool hasRealRoot;\n    \/\/Test absGreatestRealRoot\n    Real r = psolve.absGreatestRealRoot( hasRealRoot );\n    VERIFY( hasRealRoot == (real_roots.size() > 0 ) );\n    if( hasRealRoot ){\n      VERIFY( internal::isApprox( real_roots.array().abs().maxCoeff(), abs(r), psPrec ) );  }\n\n    \/\/Test absSmallestRealRoot\n    r = psolve.absSmallestRealRoot( hasRealRoot );\n    VERIFY( hasRealRoot == (real_roots.size() > 0 ) );\n    if( hasRealRoot ){\n      VERIFY( internal::isApprox( real_roots.array().abs().minCoeff(), abs( r ), psPrec ) ); }\n\n    \/\/Test greatestRealRoot\n    r = psolve.greatestRealRoot( hasRealRoot );\n    VERIFY( hasRealRoot == (real_roots.size() > 0 ) );\n    if( hasRealRoot ){\n      VERIFY( internal::isApprox( real_roots.array().maxCoeff(), r, psPrec ) ); }\n\n    \/\/Test smallestRealRoot\n    r = psolve.smallestRealRoot( hasRealRoot );\n    VERIFY( hasRealRoot == (real_roots.size() > 0 ) );\n    if( hasRealRoot ){\n    VERIFY( internal::isApprox( real_roots.array().minCoeff(), r, psPrec ) ); }\n  }\n}\n\n\ntemplate<typename _Scalar, int _Deg>\nvoid polynomialsolver(int deg)\n{\n  typedef internal::increment_if_fixed_size<_Deg>            Dim;\n  typedef Matrix<_Scalar,Dim::ret,1>                  PolynomialType;\n  typedef Matrix<_Scalar,_Deg,1>                      EvalRootsType;\n\n  cout << \"Standard cases\" << endl;\n  PolynomialType pols = PolynomialType::Random(deg+1);\n  evalSolver<_Deg,PolynomialType>( pols );\n\n  cout << \"Hard cases\" << endl;\n  _Scalar multipleRoot = internal::random<_Scalar>();\n  EvalRootsType allRoots = EvalRootsType::Constant(deg,multipleRoot);\n  roots_to_monicPolynomial( allRoots, pols );\n  evalSolver<_Deg,PolynomialType>( pols );\n\n  cout << \"Test sugar\" << endl;\n  EvalRootsType realRoots = EvalRootsType::Random(deg);\n  roots_to_monicPolynomial( realRoots, pols );\n  evalSolverSugarFunction<_Deg>(\n      pols,\n      realRoots.template cast <\n                    std::complex<\n                         typename NumTraits<_Scalar>::Real\n                         >\n                    >(),\n      realRoots );\n}\n\nvoid test_polynomialsolver()\n{\n  for(int i = 0; i < g_repeat; i++)\n  {\n    CALL_SUBTEST_1( (polynomialsolver<float,1>(1)) );\n    CALL_SUBTEST_2( (polynomialsolver<double,2>(2)) );\n    CALL_SUBTEST_3( (polynomialsolver<double,3>(3)) );\n    CALL_SUBTEST_4( (polynomialsolver<float,4>(4)) );\n    CALL_SUBTEST_5( (polynomialsolver<double,5>(5)) );\n    CALL_SUBTEST_6( (polynomialsolver<float,6>(6)) );\n    CALL_SUBTEST_7( (polynomialsolver<float,7>(7)) );\n    CALL_SUBTEST_8( (polynomialsolver<double,8>(8)) );\n\n    CALL_SUBTEST_9( (polynomialsolver<float,Dynamic>(\n            internal::random<int>(9,13)\n            )) );\n    CALL_SUBTEST_10((polynomialsolver<double,Dynamic>(\n            internal::random<int>(9,13)\n            )) );\n    CALL_SUBTEST_11((polynomialsolver<float,Dynamic>(1)) );\n  }\n}\n<commit_msg>PolynomialSolver: test template constructor in test suite.<commit_after>\/\/ This file is part of Eigen, a lightweight C++ template library\n\/\/ for linear algebra.\n\/\/\n\/\/ Copyright (C) 2010 Manuel Yguel <manuel.yguel@gmail.com>\n\/\/\n\/\/ This Source Code Form is subject to the terms of the Mozilla\n\/\/ Public License v. 2.0. If a copy of the MPL was not distributed\n\/\/ with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#include \"main.h\"\n#include <unsupported\/Eigen\/Polynomials>\n#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n\nnamespace Eigen {\nnamespace internal {\ntemplate<int Size>\nstruct increment_if_fixed_size\n{\n  enum {\n    ret = (Size == Dynamic) ? Dynamic : Size+1\n  };\n};\n}\n}\n\n\ntemplate<int Deg, typename POLYNOMIAL, typename SOLVER>\nbool aux_evalSolver( const POLYNOMIAL& pols, SOLVER& psolve )\n{\n  typedef typename POLYNOMIAL::Index Index;\n  typedef typename POLYNOMIAL::Scalar Scalar;\n\n  typedef typename SOLVER::RootsType    RootsType;\n  typedef Matrix<Scalar,Deg,1>          EvalRootsType;\n\n  const Index deg = pols.size()-1;\n\n  \/\/ Test template constructor from coefficient vector\n  SOLVER solve_constr (pols);\n\n  psolve.compute( pols );\n  const RootsType& roots( psolve.roots() );\n  EvalRootsType evr( deg );\n  for( int i=0; i<roots.size(); ++i ){\n    evr[i] = std::abs( poly_eval( pols, roots[i] ) ); }\n\n  bool evalToZero = evr.isZero( test_precision<Scalar>() );\n  if( !evalToZero )\n  {\n    cerr << \"WRONG root: \" << endl;\n    cerr << \"Polynomial: \" << pols.transpose() << endl;\n    cerr << \"Roots found: \" << roots.transpose() << endl;\n    cerr << \"Abs value of the polynomial at the roots: \" << evr.transpose() << endl;\n    cerr << endl;\n  }\n\n  std::vector<Scalar> rootModuli( roots.size() );\n  Map< EvalRootsType > aux( &rootModuli[0], roots.size() );\n  aux = roots.array().abs();\n  std::sort( rootModuli.begin(), rootModuli.end() );\n  bool distinctModuli=true;\n  for( size_t i=1; i<rootModuli.size() && distinctModuli; ++i )\n  {\n    if( internal::isApprox( rootModuli[i], rootModuli[i-1] ) ){\n      distinctModuli = false; }\n  }\n  VERIFY( evalToZero || !distinctModuli );\n\n  return distinctModuli;\n}\n\n\n\n\n\n\n\ntemplate<int Deg, typename POLYNOMIAL>\nvoid evalSolver( const POLYNOMIAL& pols )\n{\n  typedef typename POLYNOMIAL::Scalar Scalar;\n\n  typedef PolynomialSolver<Scalar, Deg >              PolynomialSolverType;\n\n  PolynomialSolverType psolve;\n  aux_evalSolver<Deg, POLYNOMIAL, PolynomialSolverType>( pols, psolve );\n}\n\n\n\n\ntemplate< int Deg, typename POLYNOMIAL, typename ROOTS, typename REAL_ROOTS >\nvoid evalSolverSugarFunction( const POLYNOMIAL& pols, const ROOTS& roots, const REAL_ROOTS& real_roots )\n{\n  using std::sqrt;\n  typedef typename POLYNOMIAL::Scalar Scalar;\n\n  typedef PolynomialSolver<Scalar, Deg >              PolynomialSolverType;\n\n  PolynomialSolverType psolve;\n  if( aux_evalSolver<Deg, POLYNOMIAL, PolynomialSolverType>( pols, psolve ) )\n  {\n    \/\/It is supposed that\n    \/\/ 1) the roots found are correct\n    \/\/ 2) the roots have distinct moduli\n\n    typedef typename POLYNOMIAL::Scalar                 Scalar;\n    typedef typename REAL_ROOTS::Scalar                 Real;\n\n    \/\/Test realRoots\n    std::vector< Real > calc_realRoots;\n    psolve.realRoots( calc_realRoots );\n    VERIFY( calc_realRoots.size() == (size_t)real_roots.size() );\n\n    const Scalar psPrec = sqrt( test_precision<Scalar>() );\n\n    for( size_t i=0; i<calc_realRoots.size(); ++i )\n    {\n      bool found = false;\n      for( size_t j=0; j<calc_realRoots.size()&& !found; ++j )\n      {\n        if( internal::isApprox( calc_realRoots[i], real_roots[j], psPrec ) ){\n          found = true; }\n      }\n      VERIFY( found );\n    }\n\n    \/\/Test greatestRoot\n    VERIFY( internal::isApprox( roots.array().abs().maxCoeff(),\n          abs( psolve.greatestRoot() ), psPrec ) );\n\n    \/\/Test smallestRoot\n    VERIFY( internal::isApprox( roots.array().abs().minCoeff(),\n          abs( psolve.smallestRoot() ), psPrec ) );\n\n    bool hasRealRoot;\n    \/\/Test absGreatestRealRoot\n    Real r = psolve.absGreatestRealRoot( hasRealRoot );\n    VERIFY( hasRealRoot == (real_roots.size() > 0 ) );\n    if( hasRealRoot ){\n      VERIFY( internal::isApprox( real_roots.array().abs().maxCoeff(), abs(r), psPrec ) );  }\n\n    \/\/Test absSmallestRealRoot\n    r = psolve.absSmallestRealRoot( hasRealRoot );\n    VERIFY( hasRealRoot == (real_roots.size() > 0 ) );\n    if( hasRealRoot ){\n      VERIFY( internal::isApprox( real_roots.array().abs().minCoeff(), abs( r ), psPrec ) ); }\n\n    \/\/Test greatestRealRoot\n    r = psolve.greatestRealRoot( hasRealRoot );\n    VERIFY( hasRealRoot == (real_roots.size() > 0 ) );\n    if( hasRealRoot ){\n      VERIFY( internal::isApprox( real_roots.array().maxCoeff(), r, psPrec ) ); }\n\n    \/\/Test smallestRealRoot\n    r = psolve.smallestRealRoot( hasRealRoot );\n    VERIFY( hasRealRoot == (real_roots.size() > 0 ) );\n    if( hasRealRoot ){\n    VERIFY( internal::isApprox( real_roots.array().minCoeff(), r, psPrec ) ); }\n  }\n}\n\n\ntemplate<typename _Scalar, int _Deg>\nvoid polynomialsolver(int deg)\n{\n  typedef internal::increment_if_fixed_size<_Deg>            Dim;\n  typedef Matrix<_Scalar,Dim::ret,1>                  PolynomialType;\n  typedef Matrix<_Scalar,_Deg,1>                      EvalRootsType;\n\n  cout << \"Standard cases\" << endl;\n  PolynomialType pols = PolynomialType::Random(deg+1);\n  evalSolver<_Deg,PolynomialType>( pols );\n\n  cout << \"Hard cases\" << endl;\n  _Scalar multipleRoot = internal::random<_Scalar>();\n  EvalRootsType allRoots = EvalRootsType::Constant(deg,multipleRoot);\n  roots_to_monicPolynomial( allRoots, pols );\n  evalSolver<_Deg,PolynomialType>( pols );\n\n  cout << \"Test sugar\" << endl;\n  EvalRootsType realRoots = EvalRootsType::Random(deg);\n  roots_to_monicPolynomial( realRoots, pols );\n  evalSolverSugarFunction<_Deg>(\n      pols,\n      realRoots.template cast <\n                    std::complex<\n                         typename NumTraits<_Scalar>::Real\n                         >\n                    >(),\n      realRoots );\n}\n\nvoid test_polynomialsolver()\n{\n  for(int i = 0; i < g_repeat; i++)\n  {\n    CALL_SUBTEST_1( (polynomialsolver<float,1>(1)) );\n    CALL_SUBTEST_2( (polynomialsolver<double,2>(2)) );\n    CALL_SUBTEST_3( (polynomialsolver<double,3>(3)) );\n    CALL_SUBTEST_4( (polynomialsolver<float,4>(4)) );\n    CALL_SUBTEST_5( (polynomialsolver<double,5>(5)) );\n    CALL_SUBTEST_6( (polynomialsolver<float,6>(6)) );\n    CALL_SUBTEST_7( (polynomialsolver<float,7>(7)) );\n    CALL_SUBTEST_8( (polynomialsolver<double,8>(8)) );\n\n    CALL_SUBTEST_9( (polynomialsolver<float,Dynamic>(\n            internal::random<int>(9,13)\n            )) );\n    CALL_SUBTEST_10((polynomialsolver<double,Dynamic>(\n            internal::random<int>(9,13)\n            )) );\n    CALL_SUBTEST_11((polynomialsolver<float,Dynamic>(1)) );\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\r\n\/\/=====================================================================\/\/\r\n\/*!\t@file\r\n\t@brief\tNTC サーミスタ 温度計算 クラス @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 <cmath>\r\n\r\nnamespace chip {\r\n\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\/*!\r\n\t\t@brief  NTCTH テンプレートクラス\r\n\t\t@param[in]\tADNUM\tA\/D 変換値の量子化最大値\r\n\t\t@param[in]\tREFR\t分圧基準抵抗（10K オームなら 10.0f）\r\n\t\t@param[in]\tTHB\t\tサーミスタ B 定数\r\n\t\t@param[in]\tthup\tサーミスタが VCC 側の場合「true」、GND 側の場合「false」\r\n\t*\/\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\ttemplate <uint16_t ADNUM, bool thup>\r\n\tclass NTCTH {\r\n\r\n\t\t\/\/ サーミスターが VCC 側\r\n\t\tstatic float thermistor_upper_(uint16_t raw)\r\n\t\t{\r\n\t\t\tstatic const float THB  = 3452.0f;   \/\/\/< サーミスタＢ定数\r\n\t\t\tstatic const float T0   = 298.15f;   \/\/\/< 絶対温度\r\n\t\t\tstatic const float TR25 = 10.0f;     \/\/\/< R25 サーミスタ２５℃基準抵抗値\r\n\t\t\tstatic const float REFR = 10.0f;     \/\/\/< 分圧抵抗 \r\n\r\n\t\t\tfloat thr = (REFR * static_cast<float>(ADNUM) * (1.0f \/ static_cast<float>(raw))) - REFR;\r\n\t\t\tfloat t = 1.0f \/ (std::log(thr \/ TR25) \/ THB + (1.0f \/ T0));\r\n\t\t\treturn t - 273.15f;\r\n\t\t}\r\n\r\n\t\t\/\/ サーミスターが GND 側\r\n\t\tstatic float thermistor_lower_(uint16_t raw)\r\n\t\t{\r\n\t\t\tstatic const float THB  = 3452.0f;   \/\/\/< サーミスタＢ定数\r\n\t\t\tstatic const float T0   = 298.15f;   \/\/\/< 絶対温度\r\n\t\t\tstatic const float TR25 = 10.0f;     \/\/\/< R25 サーミスタ２５℃基準抵抗値\r\n\t\t\tstatic const float REFR = 10.0f;     \/\/\/< 分圧抵抗 \r\n\r\n\t\t\tfloat thr = REFR * static_cast<float>(raw) \/ static_cast<float>(ADNUM - raw);\r\n\t\t\tfloat t = 1.0f \/ (std::log(thr \/ TR25) \/ THB + (1.0f \/ T0));\r\n\t\t\treturn t - 273.15f;\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]\tadn\t\tA\/D 変換値\r\n\t\t *\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tfloat operator () (uint16_t adn) const {\r\n\t\t\tif(thup) return thermistor_upper_(adn);\r\n\t\t\treturn thermistor_lower_(adn);\r\n\t\t}\r\n\t};\r\n}\r\n<commit_msg>update thermistor type<commit_after>#pragma once\r\n\/\/=====================================================================\/\/\r\n\/*!\t@file\r\n\t@brief\tNTC サーミスタ 温度計算 クラス @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 <cmath>\r\n\r\nnamespace chip {\r\n\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\/*!\r\n\t\t@brief  サーミスタ型\r\n\t*\/\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\tenum class thermistor {\r\n\t\tNT103,\t\/\/\/< THB:4126, TR25:10K\r\n\t};\r\n\r\n\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\/*!\r\n\t\t@brief  NTCTH テンプレートクラス\r\n\t\t@param[in]\tADNUM\tA\/D 変換値の量子化最大値\r\n\t\t@param[in]\tTHM\t\tサーミスタの型\r\n\t\t@param[in]\tREFR\t分圧抵抗値\r\n\t\t@param[in]\tthup\tサーミスタが VCC 側の場合「true」、GND 側の場合「false」\r\n\t*\/\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\ttemplate <uint16_t ADNUM, thermistor THM, uint16_t REFR, bool thup>\r\n\tclass NTCTH {\r\n\r\n\t\t\/\/ サーミスタの型に応じたパラメーター\r\n\t\t\/\/ THB:  B 定数\r\n\t\t\/\/ TR25: ２５度における基準抵抗値\r\n\t\tstatic void get_para_(float& THB, float& TR25)\r\n\t\t{\r\n\t\t\tswitch(THM) {\r\n\t\t\tcase thermistor::NT103:\r\n\t\t\t\tTHB  = 4126.0f;  \/\/\/< サーミスタＢ定数\r\n\t\t\t\tTR25 = 10e3;     \/\/\/< R25 サーミスタ２５℃基準抵抗値\r\n\t\t\t\tbreak;\r\n\t\t\tdefault:\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t\/\/ サーミスターが VCC 側\r\n\t\tstatic float thermistor_upper_(uint16_t raw)\r\n\t\t{\r\n\t\t\tfloat thr = (static_cast<float>(REFR * ADNUM) \/ static_cast<float>(raw)) - static_cast<float>(REFR);\r\n\t\t\treturn thr;\r\n\t\t}\r\n\r\n\t\t\/\/ サーミスターが GND 側\r\n\t\tstatic float thermistor_lower_(uint16_t raw)\r\n\t\t{\r\n\t\t\tfloat thr = static_cast<float>(REFR * raw) \/ static_cast<float>(ADNUM - raw);\r\n\t\t\treturn thr;\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]\tadn\t\tA\/D 変換値\r\n\t\t *\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tfloat operator () (uint16_t adn) const\r\n\t\t{\r\n\t\t\tfloat thr;\r\n\t\t\tif(thup) {\r\n\t\t\t\tthr = thermistor_upper_(adn);\r\n\t\t\t} else {\r\n\t\t\t\tthr = thermistor_lower_(adn);\r\n\t\t\t}\r\n\t\t\tfloat THB;\r\n\t\t\tfloat TR25;\r\n\t\t\tget_para_(THB, TR25);\r\n\t\t\tstatic const float T0   = 298.15f;   \/\/\/< 絶対温度\r\n\t\t\tfloat t = 1.0f \/ (std::log(thr \/ TR25) \/ THB + (1.0f \/ T0));\r\n\t\t\treturn t - 273.15f;\r\n\t\t}\r\n\t};\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>#include \"connectiontester.h\"\n\n#include <QNetworkConfigurationManager>\n#include <QNetworkConfiguration>\n#include <QNetworkSession>\n\n#include <QNetworkInterface>\n#include <QCoreApplication>\n#include <QByteArray>\n#include <QFile>\n#include <QTextStream>\n#include <QStringList>\n#include <QProcess>\n#include <QDebug>\n\n#ifdef Q_OS_LINUX\n#include <netinet\/in.h>\n#include <arpa\/nameser.h>\n#include <arpa\/inet.h>\n#include <resolv.h>\n#elif defined(Q_OS_WIN)\n#include <WinSock2.h>\n#include <IPHlpApi.h>\n#pragma comment(lib, \"IPHLPAPI.lib\")\n#undef interface\n#endif \/\/ Q_OS_LINUX\n\nclass ConnectionTester::Private\n{\n    Q_DECLARE_TR_FUNCTIONS(ConnectionTester::Private)\n\npublic:\n    Private(ConnectionTester* q)\n    : q(q)\n    , result(ConnectionTester::Offline)\n    {\n    }\n\n    ConnectionTester* q;\n\n    ConnectionTester::ResultType result;\n\n    void checkInterfaces();\n    void checkSlow();\n\n    QString findDefaultGateway() const;\n    QString findDefaultDNS() const;\n    bool canPing(const QString& host) const;\n};\n\nvoid ConnectionTester::Private::checkInterfaces()\n{\n    QNetworkConfigurationManager mgr;\n\n    if ( !mgr.isOnline() ) {\n        qDebug() << \"Offline. Checking why ...\";\n\n        emit q->message(tr(\"Offline.\"), ConnectionTester::Info);\n\n        QList<QNetworkConfiguration> configs;\n        foreach(const QNetworkConfiguration config, mgr.allConfigurations(QNetworkConfiguration::Active)) {\n            QNetworkSession session(config);\n            QNetworkInterface iface = session.interface();\n            if ( !iface.isValid() )\n                qDebug() << config.name() << \"invalid interface\";\n            else {\n                \/\/ Ignore loopback devices\n                if ( !iface.flags().testFlag(QNetworkInterface::IsLoopBack) )\n                    configs.append(config);\n            }\n        }\n\n        if ( configs.isEmpty() )\n            emit q->message(tr(\"There are no active network devices. Please check your cables!\"), ConnectionTester::Info);\n        else {\n            \/\/ There is some interface, now we have to check routings and dns\n            \/\/ TODO: What now?\n        }\n    } else {\n        \/\/emit q->message(tr(\"Some interface is online. Checking ...\"), ConnectionTester::Info);\n\n        QString gw = findDefaultGateway();\n        if ( gw.isEmpty() || gw == \"0.0.0.0\" )\n            q->message(tr(\"You don't have a default gateway defined. Please check your DHCP\/network settings!\"), ConnectionTester::Info);\n        else {\n            if (!canPing(gw))\n                q->message(tr(\"You can't access your default gateway!\"), ConnectionTester::Info);\n            else if (!canPing(\"8.8.8.8\"))\n                q->message(tr(\"Your default gateway does not forward your connections!\"), ConnectionTester::Info);\n            else if (!canPing(\"google.com\"))\n                q->message(tr(\"Your DNS resolution seems broken. Internet access works without DNS.\"), ConnectionTester::Info);\n            else\n                q->message(tr(\"Your connection seems to be fine\"), ConnectionTester::Info);\n        }\n\n        QString dns = findDefaultDNS();\n        if ( dns.isEmpty() )\n            q->message(tr(\"You don't have a default dns server defined. Please check your DHCP\/network settings!\"), ConnectionTester::Info);\n    }\n\n    \/*\n    foreach(const QNetworkConfiguration& config, mgr.allConfigurations()) {\n        \/\/ Ignore unknown and bluetooth devices\n        if (config.bearerType() == QNetworkConfiguration::BearerUnknown ||\n            config.bearerType() == QNetworkConfiguration::BearerBluetooth )\n        {\n            continue;\n        }\n\n        qDebug() << config.bearerTypeName() << config.name() << config.state();\n    }*\/\n}\n\nvoid ConnectionTester::Private::checkSlow()\n{\n    QNetworkConfigurationManager mgr;\n\n    QNetworkConfiguration config = mgr.defaultConfiguration();\n}\n\nQString ConnectionTester::Private::findDefaultGateway() const\n{\n    \/\/ Inspiration: https:\/\/github.com\/xbmc\/xbmc\/blob\/8edff7ead55f1a31e55425d47885dc96d3d55105\/xbmc\/network\/linux\/NetworkLinux.cpp#L165\n    QString gw;\n\n#ifdef Q_OS_LINUX\n    QFile file(\"\/proc\/net\/route\");\n    if ( !file.open(QIODevice::ReadOnly) ) {\n        qDebug() << \"Failed to open kernel route\" << file.errorString();\n        return QString();\n    }\n\n    QTextStream stream(&file);\n    QString line = stream.readLine();\n    while (!line.isEmpty()) {\n        QStringList parts = line.split('\\t');\n        if ( !parts.isEmpty() ) {\n            if ( parts.at(1) == \"00000000\" ) { \/\/ Find the default route\n                QString ip = parts.at(2);\n                QStringList realIp;\n\n                for(int pos=0; pos < ip.size(); pos += 2) {\n                    QString block = ip.mid(pos, 2);\n\n                    realIp.prepend( QString::number(block.toInt(NULL, 16)) );\n                }\n\n                return realIp.join(\".\");\n            }\n        }\n\n        line = stream.readLine();\n    }\n#elif defined(Q_OS_MAC)\n    FILE* pipe = popen(\"echo \\\"show State:\/Network\/Global\/IPv4\\\" | scutil | grep Router\", \"r\");\n    if (pipe)\n    {\n        char buffer[256] = {'\\0'};\n        if (fread(buffer, sizeof(char), sizeof(buffer), pipe) > 0 && !ferror(pipe))\n        {\n            gw = QString::fromLatin1(buffer).mid(11);\n        }\n        else\n        {\n            qDebug() << \"Unable to determine gateway\";\n        }\n        pclose(pipe);\n    }\n#elif defined(Q_OS_WIN)\n    IP_ADAPTER_INFO* pAdapterInfo = new IP_ADAPTER_INFO;\n\n    ULONG outbufferLength = sizeof(IP_ADAPTER_INFO);\n    if ( ::GetAdaptersInfo(pAdapterInfo, &outbufferLength) == ERROR_BUFFER_OVERFLOW ) {\n        delete pAdapterInfo;\n        pAdapterInfo = (IP_ADAPTER_INFO*)malloc(outbufferLength);\n    }\n\n    if ( ::GetAdaptersInfo(pAdapterInfo, &outbufferLength) == NO_ERROR ) {\n        IP_ADAPTER_INFO* pAdapter = pAdapterInfo;\n        while (pAdapter) {\n            QString temp = QString::fromLatin1(pAdapter->GatewayList.IpAddress.String);\n            if ( temp != \"0.0.0.0\" )\n                gw = temp;\n\n            pAdapter = pAdapter->Next;\n        }\n    }\n\n    delete pAdapterInfo;\n#elif defined(Q_OS_MAC)\n#error implementation!\n#endif\n\n    return gw;\n}\n\nQString ConnectionTester::Private::findDefaultDNS() const\n{\n    \/\/ Inspiration: https:\/\/github.com\/xbmc\/xbmc\/blob\/8edff7ead55f1a31e55425d47885dc96d3d55105\/xbmc\/network\/linux\/NetworkLinux.cpp#L411\n#ifdef Q_OS_LINUX\n    res_init();\n\n    for(int i=0; i < _res.nscount; ++i) {\n        return QString::fromLatin1(inet_ntoa( ((sockaddr_in*)&_res.nsaddr_list[0])->sin_addr ));\n    }\n#elif defined(Q_OS_WIN)\n\n#endif\n    return QString();\n}\n\nbool ConnectionTester::Private::canPing(const QString &host) const\n{\n    QProcess process;\n    QStringList args;\n    args << host;\n\n#ifdef Q_OS_LINUX\n    process.setStandardOutputFile(\"\/dev\/null\");\n    process.setStandardErrorFile(\"\/dev\/null\");\n\n    args << \"-c\" << \"1\" \/\/ Amount of pings\n         << \"-n\" \/\/ Don't resolve hostnames\n         << \"-W\" << \"1\"; \/\/ Timeout\n#elif defined(Q_OS_MAC)\n    args << \"-c\" << \"1\" \/\/ Amount of pings\n         << \"-t\" << \"1\"; \/\/ Timeout\n#elif defined(Q_OS_WIN)\n    args << \"-n\" << \"1\" \/\/ Amount of pings\n         << \"-4\" \/\/ Stay with IPv4 for now\n         << \"-w\" << \"1000\"; \/\/ Timeout\n#endif\n\n    process.start(\"ping\", args);\n    process.waitForFinished();\n\n    return process.exitCode() == 0;\n}\n\nConnectionTester::ConnectionTester(QObject *parent)\n: QObject(parent)\n, d(new Private(this))\n{\n}\n\nConnectionTester::~ConnectionTester()\n{\n    delete d;\n}\n\nvoid ConnectionTester::start()\n{\n    d->checkInterfaces();\n}\n\nConnectionTester::ResultType ConnectionTester::result() const\n{\n    return d->result;\n}\n<commit_msg>Better osx compatibility.<commit_after>#include \"connectiontester.h\"\n\n#include <QNetworkConfigurationManager>\n#include <QNetworkConfiguration>\n#include <QNetworkSession>\n\n#include <QNetworkInterface>\n#include <QCoreApplication>\n#include <QByteArray>\n#include <QFile>\n#include <QTextStream>\n#include <QStringList>\n#include <QProcess>\n#include <QDebug>\n\n#ifdef Q_OS_LINUX\n#include <netinet\/in.h>\n#include <arpa\/nameser.h>\n#include <arpa\/inet.h>\n#include <resolv.h>\n#elif defined(Q_OS_WIN)\n#include <WinSock2.h>\n#include <IPHlpApi.h>\n#pragma comment(lib, \"IPHLPAPI.lib\")\n#undef interface\n#endif \/\/ Q_OS_LINUX\n\nclass ConnectionTester::Private\n{\n    Q_DECLARE_TR_FUNCTIONS(ConnectionTester::Private)\n\npublic:\n    Private(ConnectionTester* q)\n    : q(q)\n    , result(ConnectionTester::Offline)\n    {\n    }\n\n    ConnectionTester* q;\n\n    ConnectionTester::ResultType result;\n\n    void checkInterfaces();\n    void checkSlow();\n\n    QString findDefaultGateway() const;\n    QString findDefaultDNS() const;\n    bool canPing(const QString& host) const;\n};\n\nvoid ConnectionTester::Private::checkInterfaces()\n{\n    QNetworkConfigurationManager mgr;\n\n    if ( !mgr.isOnline() ) {\n        qDebug() << \"Offline. Checking why ...\";\n\n        emit q->message(tr(\"Offline.\"), ConnectionTester::Info);\n\n        QList<QNetworkConfiguration> configs;\n        foreach(const QNetworkConfiguration config, mgr.allConfigurations(QNetworkConfiguration::Active)) {\n            QNetworkSession session(config);\n            QNetworkInterface iface = session.interface();\n            if ( !iface.isValid() )\n                qDebug() << config.name() << \"invalid interface\";\n            else {\n                \/\/ Ignore loopback devices\n                if ( !iface.flags().testFlag(QNetworkInterface::IsLoopBack) )\n                    configs.append(config);\n            }\n        }\n\n        if ( configs.isEmpty() )\n            emit q->message(tr(\"There are no active network devices. Please check your cables!\"), ConnectionTester::Info);\n        else {\n            \/\/ There is some interface, now we have to check routings and dns\n            \/\/ TODO: What now?\n        }\n    } else {\n        \/\/emit q->message(tr(\"Some interface is online. Checking ...\"), ConnectionTester::Info);\n\n        QString gw = findDefaultGateway();\n        if ( gw.isEmpty() || gw == \"0.0.0.0\" )\n            q->message(tr(\"You don't have a default gateway defined. Please check your DHCP\/network settings!\"), ConnectionTester::Info);\n        else {\n            if (!canPing(gw))\n                q->message(tr(\"You can't access your default gateway!\"), ConnectionTester::Info);\n            else if (!canPing(\"8.8.8.8\"))\n                q->message(tr(\"Your default gateway does not forward your connections!\"), ConnectionTester::Info);\n            else if (!canPing(\"google.com\"))\n                q->message(tr(\"Your DNS resolution seems broken. Internet access works without DNS.\"), ConnectionTester::Info);\n            else\n                q->message(tr(\"Your connection seems to be fine\"), ConnectionTester::Info);\n        }\n\n        QString dns = findDefaultDNS();\n        if ( dns.isEmpty() )\n            q->message(tr(\"You don't have a default dns server defined. Please check your DHCP\/network settings!\"), ConnectionTester::Info);\n    }\n\n    \/*\n    foreach(const QNetworkConfiguration& config, mgr.allConfigurations()) {\n        \/\/ Ignore unknown and bluetooth devices\n        if (config.bearerType() == QNetworkConfiguration::BearerUnknown ||\n            config.bearerType() == QNetworkConfiguration::BearerBluetooth )\n        {\n            continue;\n        }\n\n        qDebug() << config.bearerTypeName() << config.name() << config.state();\n    }*\/\n}\n\nvoid ConnectionTester::Private::checkSlow()\n{\n    QNetworkConfigurationManager mgr;\n\n    QNetworkConfiguration config = mgr.defaultConfiguration();\n}\n\nQString ConnectionTester::Private::findDefaultGateway() const\n{\n    \/\/ Inspiration: https:\/\/github.com\/xbmc\/xbmc\/blob\/8edff7ead55f1a31e55425d47885dc96d3d55105\/xbmc\/network\/linux\/NetworkLinux.cpp#L165\n    QString gw;\n\n#ifdef Q_OS_LINUX\n    QFile file(\"\/proc\/net\/route\");\n    if ( !file.open(QIODevice::ReadOnly) ) {\n        qDebug() << \"Failed to open kernel route\" << file.errorString();\n        return QString();\n    }\n\n    QTextStream stream(&file);\n    QString line = stream.readLine();\n    while (!line.isEmpty()) {\n        QStringList parts = line.split('\\t');\n        if ( !parts.isEmpty() ) {\n            if ( parts.at(1) == \"00000000\" ) { \/\/ Find the default route\n                QString ip = parts.at(2);\n                QStringList realIp;\n\n                for(int pos=0; pos < ip.size(); pos += 2) {\n                    QString block = ip.mid(pos, 2);\n\n                    realIp.prepend( QString::number(block.toInt(NULL, 16)) );\n                }\n\n                return realIp.join(\".\");\n            }\n        }\n\n        line = stream.readLine();\n    }\n#elif defined(Q_OS_MAC)\n    QProcess sc;\n    QTextStream stream(&sc);\n    sc.start(\"scutil\");\n    sc.waitForStarted();\n    sc.write(\"show State:\/Network\/Global\/IPv4\\n\");\n    sc.waitForReadyRead();\n\n    QString line = stream.readLine();\n    while (!line.isEmpty()) {\n        QStringList parts = line.split(':');\n        if ( parts.size() == 2 ) {\n            if ( parts.at(0).trimmed() == \"Router\" )\n                gw = parts.at(1).trimmed();\n        }\n\n        line = stream.readLine();\n    }\n\n    sc.write(\"exit\\n\");\n    sc.waitForFinished();\n#elif defined(Q_OS_WIN)\n    IP_ADAPTER_INFO* pAdapterInfo = new IP_ADAPTER_INFO;\n\n    ULONG outbufferLength = sizeof(IP_ADAPTER_INFO);\n    if ( ::GetAdaptersInfo(pAdapterInfo, &outbufferLength) == ERROR_BUFFER_OVERFLOW ) {\n        delete pAdapterInfo;\n        pAdapterInfo = (IP_ADAPTER_INFO*)malloc(outbufferLength);\n    }\n\n    if ( ::GetAdaptersInfo(pAdapterInfo, &outbufferLength) == NO_ERROR ) {\n        IP_ADAPTER_INFO* pAdapter = pAdapterInfo;\n        while (pAdapter) {\n            QString temp = QString::fromLatin1(pAdapter->GatewayList.IpAddress.String);\n            if ( temp != \"0.0.0.0\" )\n                gw = temp;\n\n            pAdapter = pAdapter->Next;\n        }\n    }\n\n    delete pAdapterInfo;\n#elif defined(Q_OS_MAC)\n#error implementation!\n#endif\n\n    return gw;\n}\n\nQString ConnectionTester::Private::findDefaultDNS() const\n{\n    \/\/ Inspiration: https:\/\/github.com\/xbmc\/xbmc\/blob\/8edff7ead55f1a31e55425d47885dc96d3d55105\/xbmc\/network\/linux\/NetworkLinux.cpp#L411\n#ifdef Q_OS_LINUX\n    res_init();\n\n    for(int i=0; i < _res.nscount; ++i) {\n        return QString::fromLatin1(inet_ntoa( ((sockaddr_in*)&_res.nsaddr_list[0])->sin_addr ));\n    }\n#elif defined(Q_OS_WIN)\n\n#endif\n    return QString();\n}\n\nbool ConnectionTester::Private::canPing(const QString &host) const\n{\n    QProcess process;\n    QStringList args;\n\n#ifdef Q_OS_LINUX\n    process.setStandardOutputFile(\"\/dev\/null\");\n    process.setStandardErrorFile(\"\/dev\/null\");\n\n    args << \"-c\" << \"1\" \/\/ Amount of pings\n         << \"-n\" \/\/ Don't resolve hostnames\n         << \"-W\" << \"1\"; \/\/ Timeout\n#elif defined(Q_OS_MAC)\n    args.clear(); \/\/ Apple needs the host name at last\n    args << \"-c\" << \"1\" \/\/ Amount of pings\n         << \"-t\" << \"1\"; \/\/ Timeout\n#elif defined(Q_OS_WIN)\n    args << \"-n\" << \"1\" \/\/ Amount of pings\n         << \"-4\" \/\/ Stay with IPv4 for now\n         << \"-w\" << \"1000\"; \/\/ Timeout\n#endif\n\n    \/\/ Hostname is always the last parameter (necessary on osx\/android!)\n    args << host;\n\n    process.start(\"ping\", args);\n    process.waitForFinished();\n\n    return process.exitCode() == 0;\n}\n\nConnectionTester::ConnectionTester(QObject *parent)\n: QObject(parent)\n, d(new Private(this))\n{\n}\n\nConnectionTester::~ConnectionTester()\n{\n    delete d;\n}\n\nvoid ConnectionTester::start()\n{\n    d->checkInterfaces();\n}\n\nConnectionTester::ResultType ConnectionTester::result() const\n{\n    return d->result;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\n\/\/\/ @file  pmath.hpp\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#ifndef PMATH_HPP\n#define PMATH_HPP\n\n#include <stdint.h>\n#include <algorithm>\n#include <limits>\n#include <cassert>\n#include <cmath>\n#include <vector>\n\nnamespace primecount {\n\ninline int64_t isquare(int32_t x)\n{\n  return x * (int64_t) x;\n}\n\ntemplate <typename T>\ninline T max3(T a, T b, T c)\n{\n  return std::max(std::max(a, b), c);\n}\n\n\/\/\/ Convenience min function for different types.\ntemplate <typename A, typename B>\ninline B min(A a, B b)\n{\n  return (a < b) ? (B) a : b;\n}\n\ntemplate <typename A, typename B>\ninline A ceil_div(A a, B b)\n{\n  assert(b > 0);\n  return (A) ((a + b - 1) \/ b);\n}\n\ntemplate <typename T>\ninline T number_of_bits(T)\n{\n  return (T) (sizeof(T) * 8);\n}\n\n\/\/\/ @brief  Check if an integer is a power of 2.\n\/\/\/ @see    Book \"Hacker's Delight\".\n\/\/\/\ntemplate <typename T>\ninline bool is_power_of_2(T x)\n{\n  return (x != 0 && (x & (x - 1)) == 0);\n}\n\n\/\/\/ @brief  Round up to the next power of 2.\n\/\/\/ @see    Book \"Hacker's Delight\".\n\/\/\/\ntemplate <typename T>\ninline T next_power_of_2(T x)\n{\n  if (x == 0)\n    return 1;\n\n  x--;\n  for (T i = 1; i < number_of_bits(x); i += i)\n    x |= (x >> i);\n\n  return ++x;\n}\n\ntemplate <typename T>\ninline int ilog(T x)\n{\n  return (int) std::log((double) x);\n}\n\n\/\/\/ Raise to power\ntemplate <typename T>\ninline T ipow(T x, int n)\n{\n  T r = 1;\n  for (int i = 0; i < n; i++)\n    r *= x;\n\n  return r;\n}\n\n\/\/\/ Integer suare root\ntemplate <typename T>\ninline T isqrt(T x)\n{\n  T r = (T) std::sqrt((double) x);\n  T max_r = std::numeric_limits<T>::max() >> (sizeof(T) \/ 2);\n  r = std::min(r, max_r);\n  while (r * r > x)\n    r--;\n  while (x - r * r > r * 2)\n    r++;\n  return r;\n}\n\n\/\/\/ Check if ipow(x, n) <= limit\ntemplate <typename T>\ninline bool ipow_less_equal(T x, int n, T limit)\n{\n  if (limit <= 0)\n    return false;\n\n  for (T r = 1; n > 0; n--, r *= x)\n    if (r > limit \/ x)\n      return false;\n\n  return true;\n}\n\n\/\/\/ Integer nth root\ntemplate <int N, typename T>\ninline T iroot(T x)\n{\n  T r = (T) std::pow((double) x, 1.0 \/ N);\n  while (ipow(r, N) > x)\n    r--;\n  while (ipow_less_equal(r + 1, N, x))\n    r++;\n  return r;\n}\n\n\/\/\/ Calculate the number of primes below x using binary search.\n\/\/\/ @pre primes[1] = 2, primes[3] = 3, ...\n\/\/\/ @pre x <= primes.back()\n\/\/\/\ntemplate <typename T1, typename T2>\ninline T2 pi_bsearch(const std::vector<T1>& primes, T2 x)\n{\n  \/\/ primecount uses 1-indexing\n  assert(primes[0] == 0);\n  return (T2) (std::upper_bound(primes.begin() + 1, primes.end(), x) \n      - (primes.begin() + 1));\n}\n\n\/\/\/ Calculate the number of primes below x using binary search.\n\/\/\/ @pre primes[1] = 2, primes[3] = 3, ...\n\/\/\/ @pre x <= primes.back()\n\/\/\/\ntemplate <typename T1, typename T2, typename T3>\ninline T3 pi_bsearch(const std::vector<T1>& primes, T2 len, T3 x)\n{\n  \/\/ primecount uses 1-indexing\n  assert(primes[0] == 0);\n  return (T3) (std::upper_bound(primes.begin() + 1, primes.begin() + len + 1, x) \n      - (primes.begin() + 1));\n}\n\ntemplate <typename T1, typename T2, typename T3>\ninline T2 in_between(T1 min, T2 x, T3 max)\n{\n  if (x < min)\n    return (T2) min;\n  if (x > max)\n    return (T2) max;\n\n  return x;\n}\n\n} \/\/ namespace\n\n#endif\n<commit_msg>Add min3(a, b, c)<commit_after>\/\/\/\n\/\/\/ @file  pmath.hpp\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#ifndef PMATH_HPP\n#define PMATH_HPP\n\n#include <stdint.h>\n#include <algorithm>\n#include <limits>\n#include <cassert>\n#include <cmath>\n#include <vector>\n\nnamespace primecount {\n\ninline int64_t isquare(int32_t x)\n{\n  return x * (int64_t) x;\n}\n\ntemplate <typename T>\ninline T max3(T a, T b, T c)\n{\n  return std::max(std::max(a, b), c);\n}\n\ntemplate <typename T>\ninline T min3(T a, T b, T c)\n{\n  return std::min(std::min(a, b), c);\n}\n\n\/\/\/ Convenience min function for different types.\ntemplate <typename A, typename B>\ninline B min(A a, B b)\n{\n  return (a < b) ? (B) a : b;\n}\n\ntemplate <typename A, typename B>\ninline A ceil_div(A a, B b)\n{\n  assert(b > 0);\n  return (A) ((a + b - 1) \/ b);\n}\n\ntemplate <typename T>\ninline T number_of_bits(T)\n{\n  return (T) (sizeof(T) * 8);\n}\n\n\/\/\/ @brief  Check if an integer is a power of 2.\n\/\/\/ @see    Book \"Hacker's Delight\".\n\/\/\/\ntemplate <typename T>\ninline bool is_power_of_2(T x)\n{\n  return (x != 0 && (x & (x - 1)) == 0);\n}\n\n\/\/\/ @brief  Round up to the next power of 2.\n\/\/\/ @see    Book \"Hacker's Delight\".\n\/\/\/\ntemplate <typename T>\ninline T next_power_of_2(T x)\n{\n  if (x == 0)\n    return 1;\n\n  x--;\n  for (T i = 1; i < number_of_bits(x); i += i)\n    x |= (x >> i);\n\n  return ++x;\n}\n\ntemplate <typename T>\ninline int ilog(T x)\n{\n  return (int) std::log((double) x);\n}\n\n\/\/\/ Raise to power\ntemplate <typename T>\ninline T ipow(T x, int n)\n{\n  T r = 1;\n  for (int i = 0; i < n; i++)\n    r *= x;\n\n  return r;\n}\n\n\/\/\/ Integer suare root\ntemplate <typename T>\ninline T isqrt(T x)\n{\n  T r = (T) std::sqrt((double) x);\n  T max_r = std::numeric_limits<T>::max() >> (sizeof(T) \/ 2);\n  r = std::min(r, max_r);\n  while (r * r > x)\n    r--;\n  while (x - r * r > r * 2)\n    r++;\n  return r;\n}\n\n\/\/\/ Check if ipow(x, n) <= limit\ntemplate <typename T>\ninline bool ipow_less_equal(T x, int n, T limit)\n{\n  if (limit <= 0)\n    return false;\n\n  for (T r = 1; n > 0; n--, r *= x)\n    if (r > limit \/ x)\n      return false;\n\n  return true;\n}\n\n\/\/\/ Integer nth root\ntemplate <int N, typename T>\ninline T iroot(T x)\n{\n  T r = (T) std::pow((double) x, 1.0 \/ N);\n  while (ipow(r, N) > x)\n    r--;\n  while (ipow_less_equal(r + 1, N, x))\n    r++;\n  return r;\n}\n\n\/\/\/ Calculate the number of primes below x using binary search.\n\/\/\/ @pre primes[1] = 2, primes[3] = 3, ...\n\/\/\/ @pre x <= primes.back()\n\/\/\/\ntemplate <typename T1, typename T2>\ninline T2 pi_bsearch(const std::vector<T1>& primes, T2 x)\n{\n  \/\/ primecount uses 1-indexing\n  assert(primes[0] == 0);\n  return (T2) (std::upper_bound(primes.begin() + 1, primes.end(), x) \n      - (primes.begin() + 1));\n}\n\n\/\/\/ Calculate the number of primes below x using binary search.\n\/\/\/ @pre primes[1] = 2, primes[3] = 3, ...\n\/\/\/ @pre x <= primes.back()\n\/\/\/\ntemplate <typename T1, typename T2, typename T3>\ninline T3 pi_bsearch(const std::vector<T1>& primes, T2 len, T3 x)\n{\n  \/\/ primecount uses 1-indexing\n  assert(primes[0] == 0);\n  return (T3) (std::upper_bound(primes.begin() + 1, primes.begin() + len + 1, x) \n      - (primes.begin() + 1));\n}\n\ntemplate <typename T1, typename T2, typename T3>\ninline T2 in_between(T1 min, T2 x, T3 max)\n{\n  if (x < min)\n    return (T2) min;\n  if (x > max)\n    return (T2) max;\n\n  return x;\n}\n\n} \/\/ namespace\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\n\/\/\/ @file  print.hpp\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#ifndef PRINT_HPP\n#define PRINT_HPP\n\n#include <int128.hpp>\n#include <stdint.h>\n\n#include <string>\n\nnamespace primecount {\n\nvoid set_partial_computation(bool partial_computation);\n\nbool print_result();\n\nbool print_status();\n\nbool partial_computation();\n\nvoid print(const std::string& str);\n\nvoid print(maxint_t x, int64_t y, int threads);\n\nvoid print(maxint_t x, int64_t y, int64_t c, int threads);\n\nvoid print(maxint_t x, int64_t y, int64_t z, int64_t c, double alpha, int threads);\n\nvoid print(const std::string& res_name, maxint_t res, double time);\n\nvoid print_seconds(double seconds);\n\n} \/\/ namespace\n\n#endif\n<commit_msg>Refactoring<commit_after>\/\/\/\n\/\/\/ @file  print.hpp\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 PRINT_HPP\n#define PRINT_HPP\n\n#include <int128.hpp>\n#include <stdint.h>\n\n#include <string>\n\nnamespace primecount {\n\nvoid set_print_variables(bool print_variables);\n\nbool print_result();\n\nbool print_status();\n\nbool print_variables();\n\nvoid print(const std::string& str);\n\nvoid print(maxint_t x, int64_t y, int threads);\n\nvoid print(maxint_t x, int64_t y, int64_t c, int threads);\n\nvoid print(maxint_t x, int64_t y, int64_t z, int64_t c, double alpha, int threads);\n\nvoid print(const std::string& res_name, maxint_t res, double time);\n\nvoid print_seconds(double seconds);\n\n} \/\/ namespace\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>[Analyzer] Fix introduced regression: properly check for nullable attribute.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2017 Dariusz Stojaczyk. All Rights Reserved.\n * The following source code is released under an MIT-style license,\n * that can be found in the LICENSE file.\n *\/\n\n#include <iostream>\n\n#include \"MenuRender.h\"\n#include \"window\/Window.h\"\n#include \"window\/Menu.h\"\n#include \"render\/opengl.h\"\n#include \"render\/RenderContext.h\"\n#include \"render\/gui\/GuiElementRender.h\"\n#include \"util\/log.h\"\n\nMenuRender::MenuRender()\n    : m_viewMatrix(glm::lookAt(glm::vec3(0, 0, 0.0f), glm::vec3(0, 0, 1.0f), glm::vec3(0.0f, 1.0f, 0.0f))) {\n\n}\n\nvoid MenuRender::reinit() {\n    m_projectionMatrix = glm::ortho(0.0f, static_cast<float>(m_applicationContext->windowWidth()), 0.0f, static_cast<float>(m_applicationContext->windowHeight()));\n\n    m_guiRender = std::make_unique<GuiElementRender>(*m_applicationContext, *m_renderContext);\n}\n\nvoid MenuRender::reload() {\n    glViewport(0, 0,\n               (GLsizei) m_applicationContext->windowWidth(),\n               (GLsizei) m_applicationContext->windowHeight());\n    \n    glEnable(GL_BLEND);\n    glBlendFunc(GL_ONE, GL_ONE_MINUS_SRC_ALPHA);\n    \n    m_projectionMatrix = glm::ortho(0.0f, static_cast<float>(m_applicationContext->windowWidth()), 0.0f, static_cast<float>(m_applicationContext->windowHeight()));\n\n    m_debugOverlayElements.emplace_back((GuiElement) {6, (int)m_applicationContext->windowHeight() - 35 - 8, 35, 35, 0.0, 0, 0xFFFFFFFF});\n}\n\nvoid MenuRender::render(const Window &window) {\n    const Menu &menu = static_cast<const Menu &>(window);\n\n    glClearColor(0.7, 0.7, 0.7, 0.0);\n    glClear(GL_COLOR_BUFFER_BIT);\n    \n    for (auto &guiElement : menu.guiElements()) {\n        m_guiRender->render(*guiElement, m_projectionMatrix, m_viewMatrix);\n    }\n\n    for (auto &guiElement : m_debugOverlayElements) {\n        m_guiRender->render(guiElement, m_projectionMatrix, m_viewMatrix);\n    }\n\n    GLenum err;\n    while ((err = glGetError()) != GL_NO_ERROR) {\n        Log::error(\"OpenGL error: %d\", err);\n    }\n}\n\nMenuRender::~MenuRender() = default;\n<commit_msg>Remove previous debug overlay elements in MenuRender::reload()<commit_after>\/*\n * Copyright (c) 2017 Dariusz Stojaczyk. All Rights Reserved.\n * The following source code is released under an MIT-style license,\n * that can be found in the LICENSE file.\n *\/\n\n#include <iostream>\n\n#include \"MenuRender.h\"\n#include \"window\/Window.h\"\n#include \"window\/Menu.h\"\n#include \"render\/opengl.h\"\n#include \"render\/RenderContext.h\"\n#include \"render\/gui\/GuiElementRender.h\"\n#include \"util\/log.h\"\n\nMenuRender::MenuRender()\n    : m_viewMatrix(glm::lookAt(glm::vec3(0, 0, 0.0f), glm::vec3(0, 0, 1.0f), glm::vec3(0.0f, 1.0f, 0.0f))) {\n\n}\n\nvoid MenuRender::reinit() {\n    m_projectionMatrix = glm::ortho(0.0f, static_cast<float>(m_applicationContext->windowWidth()), 0.0f, static_cast<float>(m_applicationContext->windowHeight()));\n\n    m_guiRender = std::make_unique<GuiElementRender>(*m_applicationContext, *m_renderContext);\n}\n\nvoid MenuRender::reload() {\n    glViewport(0, 0,\n               (GLsizei) m_applicationContext->windowWidth(),\n               (GLsizei) m_applicationContext->windowHeight());\n    \n    glEnable(GL_BLEND);\n    glBlendFunc(GL_ONE, GL_ONE_MINUS_SRC_ALPHA);\n    \n    m_projectionMatrix = glm::ortho(0.0f, static_cast<float>(m_applicationContext->windowWidth()), 0.0f, static_cast<float>(m_applicationContext->windowHeight()));\n\n    m_debugOverlayElements.clear();\n    m_debugOverlayElements.emplace_back((GuiElement) {6, 6, 35, 35, 0.0, 0, 0xFFFFFFFF});\n    m_debugOverlayElements.emplace_back((GuiElement) {6, (int)m_applicationContext->windowHeight() - 35 - 8, 35, 35, 0.0, 0, 0xFFFFFFFF});\n}\n\nvoid MenuRender::render(const Window &window) {\n    const Menu &menu = static_cast<const Menu &>(window);\n\n    glClearColor(0.7, 0.7, 0.7, 0.0);\n    glClear(GL_COLOR_BUFFER_BIT);\n    \n    for (auto &guiElement : menu.guiElements()) {\n        m_guiRender->render(*guiElement, m_projectionMatrix, m_viewMatrix);\n    }\n\n    for (auto &guiElement : m_debugOverlayElements) {\n        m_guiRender->render(guiElement, m_projectionMatrix, m_viewMatrix);\n    }\n\n    GLenum err;\n    while ((err = glGetError()) != GL_NO_ERROR) {\n        Log::error(\"OpenGL error: %d\", err);\n    }\n}\n\nMenuRender::~MenuRender() = default;\n<|endoftext|>"}
{"text":"<commit_before>template <typename T>\nclass stack\n{\npublic:\n\tstack() : array_(nullptr), array_size_(0), count_(0) {}\n\tstack(const stack & _stack);\n\tstack& operator=(const stack & _stack);\n\tsize_t count() const;\n\tvoid push(T const &);\n\tT pop();\n\t~stack();\nprivate:\n\tT* array_;\n\tsize_t array_size_;\n\tsize_t count_;\n\tvoid rereserve(size_t new_size, size_t n_elements_to_copy);\n};\n\ntemplate<typename T>\nstack<T>::stack(const stack & _stack)\n\t: array_(new T[_stack.array_size_]),\n\tarray_size_(_stack.array_size_), count_(_stack.count_) {\n\tstd::copy(_stack.array_, _stack.array_ + _stack.count_, array_);\n}\n\n\ntemplate<typename T>\nstack<T>& stack<T>::operator=(const stack & _stack) {\n\tif (this == &_stack) {\n\t\treturn *this;\n\t}\n\tif (array_size_ < _stack.count_) {\n\t\tdelete[] array_;\n\t\tarray_ = new T[_stack.array_size_];\n\t\tarray_size_ = _stack.array_size_;\n\t}\n\tstd::copy(_stack.array_, _stack.array_ + _stack.count_, array_);\n\tcount_ = _stack.count_;\n\treturn *this;\n}\n\ntemplate<typename T>\nsize_t stack<T>::count() const\n{\n\treturn count_;\n}\n\ntemplate<typename T>\nvoid stack<T>::push(T const & new_element)\n{\n\tif (count_ >= array_size_) {\n\t\trereserve((array_size_ * 3) \/ 2 + 1, count_);\n\t}\n\tarray_[count_] = new_element;\n\tcount_++;\n}\n\ntemplate<typename T>\nT stack<T>::pop()\n{\n\tif (count_ == 0) {\n\t\tthrow (\"count_ == 0\");\n\t}\n\telse {\n\t\tcount_--;\n\t}\n\treturn array_[count_];\n}\n\ntemplate<typename T>\nstack<T>::~stack()\n{\n\tdelete[] array_;\n}\n\ntemplate<typename T>\nvoid stack<T>::rereserve(size_t new_size, size_t n_elements_to_copy) {\n\tT* new_array = new T[new_size];\n\tstd::copy(array_, array_ + count_, new_array);\n\tdelete[] array_;\n\tarray_ = new_array;\n\tarray_size_ = new_size;\n}\n<commit_msg>(new + copy) duplication liquidation by newCopiedArray<commit_after>template <typename T>\nclass stack\n{\npublic:\n\tstack() : array_(nullptr), array_size_(0), count_(0) {}\n\tstack(const stack & _stack);\n\tstack& operator=(const stack & _stack);\n\tsize_t count() const;\n\tvoid push(T const &);\n\tT pop();\n\t~stack();\nprivate:\n\tT* array_;\n\tsize_t array_size_;\n\tsize_t count_;\n\tvoid rereserve(size_t new_size, size_t n_elements_to_copy);\n\tT* newCopiedArray(const T* source, size_t source_size, size_t destination_size);\n};\n\ntemplate<typename T>\nstack<T>::stack(const stack & _stack)\n\t: array_(newCopiedArray(_stack.array_, _stack.count_, _stack.array_size_)),\n\tarray_size_(_stack.array_size_), count_(_stack.count_) {\n\t;\n}\n\ntemplate<typename T>\nstack<T>& stack<T>::operator=(const stack & _stack) {\n\tif (this == &_stack) {\n\t\treturn *this;\n\t}\n\tif (array_size_ < _stack.count_) {\n\t\tdelete[] array_;\n\t\tarray_ = new T[_stack.array_size_];\n\t\tarray_size_ = _stack.array_size_;\n\t}\n\tstd::copy(_stack.array_, _stack.array_ + _stack.count_, array_);\n\tcount_ = _stack.count_;\n\treturn *this;\n}\n\ntemplate<typename T>\nsize_t stack<T>::count() const\n{\n\treturn count_;\n}\n\ntemplate<typename T>\nvoid stack<T>::push(T const & new_element)\n{\n\tif (count_ >= array_size_) {\n\t\trereserve((array_size_ * 3) \/ 2 + 1, count_);\n\t}\n\tarray_[count_] = new_element;\n\tcount_++;\n}\n\ntemplate<typename T>\nT stack<T>::pop()\n{\n\tif (count_ == 0) {\n\t\tthrow (\"count_ == 0\");\n\t}\n\telse {\n\t\tcount_--;\n\t}\n\treturn array_[count_];\n}\n\ntemplate<typename T>\nstack<T>::~stack()\n{\n\tdelete[] array_;\n}\n\ntemplate<typename T>\nvoid stack<T>::rereserve(size_t new_size, size_t n_elements_to_copy) {\n\tT* new_array = newCopiedArray(array_, count_, new_size);\n\tdelete[] array_;\n\tarray_ = new_array;\n\tarray_size_ = new_size;\n}\n\ntemplate<typename T>\nT* stack<T>::newCopiedArray(const T* source, size_t source_count, size_t destination_size)\n{\n\tT* new_array = new T[destination_size];\n\tstd::copy(source, source + source_count, new_array);\n\treturn new_array;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"util\/funcs.h\"\n#include \"util\/bitmap.h\"\n#include \"rain_atmosphere.h\"\n#include \"level\/scene.h\"\n\nusing namespace std;\n\nstatic int screenX(){\n\treturn 320;\n}\n\nstatic int screenY(){\n\treturn 240;\n}\n\nRainAtmosphere::RainAtmosphere():\nAtmosphere(),\nplaying( false ){\n\n\train_sound = Sound( Util::getDataPath() + \"sounds\/rain.wav\" );\n\n\tint colors[ 2 ];\n\tcolors[ 0 ] = Bitmap::makeColor( 0x22, 0x66, 0x66 );\n\tcolors[ 1 ] = Bitmap::makeColor( 0x11, 0x44, 0x77 );\n\tfor ( int i = 0; i < 100; i++ ){\n\t\tDrop * d = new Drop( Util::rnd( screenX() * 2 ) - screenX() \/ 2, Util::rnd( screenY() ), Util::rnd( 4 ) + 3, colors[ Util::rnd( 2 ) ] );\n\t\train_drops.push_back( d );\n\t}\n}\n\nRainAtmosphere::~RainAtmosphere(){\n\tfor ( vector< Drop * >::iterator it = rain_drops.begin(); it != rain_drops.end(); it++ ){\n\t\tdelete *it;\n\t}\n\tfor ( vector<Puddle *>::iterator it = puddles.begin(); it != puddles.end(); it++ ){\n\t\tdelete *it;\n\t}\n}\n\nvoid RainAtmosphere::drawBackground(Bitmap * work, int x){\n    const int bluish = Bitmap::makeColor(106, 184, 225);\n    Bitmap::transBlender(0, 0, 0, 192);\n    Bitmap::drawingMode(Bitmap::MODE_TRANS);\n    for (vector<Puddle*>::iterator it = puddles.begin(); it != puddles.end(); it++){\n        Puddle * puddle = *it;\n        work->circle(puddle->x, puddle->y, (int)puddle->current, bluish);\n    }\n    Bitmap::drawingMode(Bitmap::MODE_SOLID);\n}\n\nvoid RainAtmosphere::drawForeground(Bitmap * work, int x){\n}\n\t\nvoid RainAtmosphere::drawFront(Bitmap * work, int x){\n}\n\nvoid RainAtmosphere::drawScreen(Bitmap * work, int x){\n    for ( vector< Drop * >::iterator it = rain_drops.begin(); it != rain_drops.end(); it++ ){\n        Drop * d = *it;\n        work->line( d->x, d->y, d->x + d->length * 2 \/ 3, d->y + d->length, d->color );\n    }\n}\n\nvoid RainAtmosphere::act(const Scene & level){\n\n\tif ( ! playing ){\n\t\train_sound.playLoop();\n\t\tplaying = true;\n\t}\n\n        for (vector<Puddle*>::iterator it = puddles.begin(); it != puddles.end(); ){\n            Puddle * puddle = *it;\n            puddle->current += 0.3;\n            if (puddle->current >= puddle->size){\n                delete puddle;\n                it = puddles.erase(it);\n            } else {\n                it++;\n            }\n        }\n\n        while (puddles.size() < 20){\n            int x = Util::rnd(screenX());\n            int y = Util::rnd(level.getMinimumZ(), level.getMaximumZ());\n            int size = Util::rnd(4) + 2;\n            puddles.push_back(new Puddle(x, y, size));\n        }\n\n\tfor ( vector< Drop * >::iterator it = rain_drops.begin(); it != rain_drops.end(); it++ ){\n\t\tDrop * d = *it;\n\t\td->y += 7;\n\t\td->x += 3;\n\t\tif ( d->y > screenY() ){\n\t\t\td->y = -Util::rnd( 100 ) - 20;\n\t\t}\n\t\tif ( d->x > screenX() ){\n\t\t\td->x -= screenX();\n\t\t}\n\t}\n\n}\n<commit_msg>make puddles look better<commit_after>#include \"util\/funcs.h\"\n#include \"util\/bitmap.h\"\n#include \"rain_atmosphere.h\"\n#include \"level\/scene.h\"\n\nusing namespace std;\n\nstatic int screenX(){\n\treturn 320;\n}\n\nstatic int screenY(){\n\treturn 240;\n}\n\nRainAtmosphere::RainAtmosphere():\nAtmosphere(),\nplaying( false ){\n\n\train_sound = Sound( Util::getDataPath() + \"sounds\/rain.wav\" );\n\n\tint colors[ 2 ];\n\tcolors[ 0 ] = Bitmap::makeColor( 0x22, 0x66, 0x66 );\n\tcolors[ 1 ] = Bitmap::makeColor( 0x11, 0x44, 0x77 );\n\tfor ( int i = 0; i < 100; i++ ){\n\t\tDrop * d = new Drop( Util::rnd( screenX() * 2 ) - screenX() \/ 2, Util::rnd( screenY() ), Util::rnd( 4 ) + 3, colors[ Util::rnd( 2 ) ] );\n\t\train_drops.push_back( d );\n\t}\n}\n\nRainAtmosphere::~RainAtmosphere(){\n\tfor ( vector< Drop * >::iterator it = rain_drops.begin(); it != rain_drops.end(); it++ ){\n\t\tdelete *it;\n\t}\n\tfor ( vector<Puddle *>::iterator it = puddles.begin(); it != puddles.end(); it++ ){\n\t\tdelete *it;\n\t}\n}\n\nvoid RainAtmosphere::drawBackground(Bitmap * work, int x){\n    const int bluish = Bitmap::makeColor(106, 184, 225);\n    Bitmap::transBlender(0, 0, 0, 64);\n    Bitmap::drawingMode(Bitmap::MODE_TRANS);\n    for (vector<Puddle*>::iterator it = puddles.begin(); it != puddles.end(); it++){\n        Puddle * puddle = *it;\n        if (puddle->x == -1000){\n            puddle->x = x + Util::rnd(screenX() + 30) - 15;\n        }\n        \/\/ work->circle(puddle->x, puddle->y, (int)puddle->current, bluish);\n        int rx = (int) puddle->current;\n        int ry = (int)(puddle->current * 0.8);\n        work->ellipse(puddle->x - x, puddle->y, rx, ry < 1 ? 1 : ry, bluish);\n    }\n    Bitmap::drawingMode(Bitmap::MODE_SOLID);\n}\n\nvoid RainAtmosphere::drawForeground(Bitmap * work, int x){\n}\n\t\nvoid RainAtmosphere::drawFront(Bitmap * work, int x){\n}\n\nvoid RainAtmosphere::drawScreen(Bitmap * work, int x){\n    for ( vector< Drop * >::iterator it = rain_drops.begin(); it != rain_drops.end(); it++ ){\n        Drop * d = *it;\n        work->line( d->x, d->y, d->x + d->length * 2 \/ 3, d->y + d->length, d->color );\n    }\n}\n\nvoid RainAtmosphere::act(const Scene & level){\n\n\tif ( ! playing ){\n\t\train_sound.playLoop();\n\t\tplaying = true;\n\t}\n\n        for (vector<Puddle*>::iterator it = puddles.begin(); it != puddles.end(); ){\n            Puddle * puddle = *it;\n            puddle->current += 0.3;\n            if (puddle->current >= puddle->size){\n                delete puddle;\n                it = puddles.erase(it);\n            } else {\n                it++;\n            }\n        }\n\n        while (puddles.size() < 20){\n            \/\/ int x = Util::rnd(screenX());\n            int y = Util::rnd(level.getMinimumZ(), level.getMaximumZ());\n            int size = Util::rnd(4) + 2;\n            \/* supreme hack! set x to nothing and later on in the draw routine\n             * update x\n             *\/\n            puddles.push_back(new Puddle(-1000, y, size));\n        }\n\n\tfor ( vector< Drop * >::iterator it = rain_drops.begin(); it != rain_drops.end(); it++ ){\n\t\tDrop * d = *it;\n\t\td->y += 7;\n\t\td->x += 3;\n\t\tif ( d->y > screenY() ){\n\t\t\td->y = -Util::rnd( 100 ) - 20;\n\t\t}\n\t\tif ( d->x > screenX() ){\n\t\t\td->x -= screenX();\n\t\t}\n\t}\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(\"tracker_maximum_response_length\", &session_settings::tracker_maximum_response_length)\n        .def_readwrite(\"piece_timeout\", &session_settings::piece_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(\"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(\"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::auto_manage_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(\"auto_scraped_interval\", &session_settings::auto_scrape_interval)\n        .def_readwrite(\"peer_tos\", &session_settings::peer_tos)\n        .def_readwrite(\"rate_limit_ip_overhead\", &session_settings::rate_limit_ip_overhead)\n        .def_readwrite(\"outgoing_ports\", &session_settings::outgoing_ports)\n#ifndef TORRENT_DISABLE_DHT\n        .def_readwrite(\"use_dht_as_fallback\", &session_settings::use_dht_as_fallback)\n#endif\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    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_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>Add 'cache_size' and 'cache_expiry' session settings to the python bindings<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(\"tracker_maximum_response_length\", &session_settings::tracker_maximum_response_length)\n        .def_readwrite(\"piece_timeout\", &session_settings::piece_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(\"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(\"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::auto_manage_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(\"auto_scraped_interval\", &session_settings::auto_scrape_interval)\n        .def_readwrite(\"peer_tos\", &session_settings::peer_tos)\n        .def_readwrite(\"rate_limit_ip_overhead\", &session_settings::rate_limit_ip_overhead)\n        .def_readwrite(\"outgoing_ports\", &session_settings::outgoing_ports)\n        .def_readwrite(\"cache_size\", &session_settings::cache_size)\n        .def_readwrite(\"cache_expiry\", &session_settings::cache_expiry)\n#ifndef TORRENT_DISABLE_DHT\n        .def_readwrite(\"use_dht_as_fallback\", &session_settings::use_dht_as_fallback)\n#endif\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    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_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>\/**\n * Copyright (c) 2016 zScale Technology GmbH <legal@zscale.io>\n * Authors:\n *   - Paul Asmuth <paul@zscale.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 \"unistd.h\"\n#include <eventql\/util\/logging.h>\n#include <eventql\/util\/wallclock.h>\n#include <eventql\/util\/application.h>\n#include <eventql\/db\/ReplicationWorker.h>\n#include <eventql\/db\/Partition.h>\n#include <eventql\/server\/server_stats.h>\n\n#include \"eventql\/eventql.h\"\n\nnamespace eventql {\n\nReplicationInfo::ReplicationInfo() {\n  reset();\n}\n\nvoid ReplicationInfo::reset() {\n  std::unique_lock<std::mutex> lk(mutex_);\n  is_idle_ = true;\n  cur_partition_.clear();\n  cur_target_host_.clear();\n  cur_partition_since_ = UnixTime(0);\n  cur_target_host_since_ = UnixTime(0);\n  cur_target_host_bytes_sent_ = 0;\n  cur_target_host_records_sent_ = 0;\n}\n\nvoid ReplicationInfo::setPartition(String name) {\n  std::unique_lock<std::mutex> lk(mutex_);\n  is_idle_ = false;\n  cur_partition_ = name;\n  cur_partition_since_ = WallClock::now();\n}\n\nvoid ReplicationInfo::setTargetHost(String host_name) {\n  std::unique_lock<std::mutex> lk(mutex_);\n  cur_target_host_ = host_name;\n  cur_target_host_since_ = WallClock::now();\n  cur_target_host_bytes_sent_ = 0;\n  cur_target_host_records_sent_ = 0;\n}\n\nvoid ReplicationInfo::setTargetHostStatus(\n    size_t bytes_sent,\n    size_t records_sent) {\n  cur_target_host_bytes_sent_ = bytes_sent;\n  cur_target_host_records_sent_ = records_sent;\n}\n\nString ReplicationInfo::toString() const {\n  std::unique_lock<std::mutex> lk(mutex_);\n  if (is_idle_) {\n    return \"Idle\";\n  }\n\n  if (cur_target_host_.empty()) {\n    return StringUtil::format(\n        \"Replicating partition $0 (since $1s)\",\n        cur_partition_,\n        (WallClock::unixMicros() - cur_partition_since_.unixMicros()) \/ kMicrosPerSecond);\n\n  } else {\n    auto duration = (WallClock::unixMicros() - cur_target_host_since_.unixMicros()) \/ kMicrosPerSecond;\n    return StringUtil::format(\n        \"Replicating partition $0 (since $1s) to host $2 (since $3s); records_sent=$4 bytes_sent=$5MB bw=$6kb\/s\",\n        cur_partition_,\n        (WallClock::unixMicros() - cur_partition_since_.unixMicros()) \/ kMicrosPerSecond,\n        cur_target_host_,\n        duration,\n        cur_target_host_records_sent_,\n        cur_target_host_bytes_sent_ \/ double(1024 * 1024),\n        (cur_target_host_bytes_sent_ \/ (duration < 1 ? 1 : duration)) \/ 1024);\n  }\n}\n\nReplicationWorker::ReplicationWorker(\n    RefPtr<ReplicationScheme> repl_scheme,\n    PartitionMap* pmap,\n    http::HTTPConnectionPool* http) :\n    repl_scheme_(repl_scheme),\n    pmap_(pmap),\n    http_(http),\n    queue_([] (\n        const Pair<uint64_t, RefPtr<Partition>>& a,\n        const Pair<uint64_t, RefPtr<Partition>>& b) {\n      return a.first < b.first;\n    }),\n    running_(false),\n    num_replication_threads_(8),\n    replication_infos_(num_replication_threads_) {\n  pmap->subscribeToPartitionChanges([this] (\n      RefPtr<eventql::PartitionChangeNotification> change) {\n    enqueuePartition(change->partition);\n  });\n\n  start();\n}\n\nReplicationWorker::~ReplicationWorker() {\n  stop();\n}\n\nvoid ReplicationWorker::enqueuePartition(\n    RefPtr<Partition> partition,\n    uint64_t flags \/* = ReplicationOptions::CORK *\/) {\n  std::unique_lock<std::mutex> lk(mutex_);\n  enqueuePartitionWithLock(partition, flags);\n}\n\nvoid ReplicationWorker::enqueuePartitionWithLock(\n    RefPtr<Partition> partition,\n    uint64_t flags) {\n  if (partition->getTable()->config().config().disable_replication()) {\n    return;\n  }\n\n  if (partition->isSplitting()) {\n    flags &= ~(uint64_t) ReplicationOptions::CORK;\n    flags |= (uint64_t) ReplicationOptions::URGENT;\n  }\n\n  uint64_t enqueue_at = WallClock::unixMicros();\n  if (flags & (uint64_t) ReplicationOptions::CORK) {\n    enqueue_at += kReplicationCorkWindowMicros;\n  }\n\n  if (flags & (uint64_t) ReplicationOptions::URGENT) {\n    enqueue_at = 0;\n  }\n\n  auto uuid = partition->uuid();\n  if (waitset_.count(uuid) > 0) {\n    return;\n  }\n\n  queue_.emplace(enqueue_at, partition);\n  waitset_.emplace(uuid);\n  cv_.notify_all();\n\n  z1stats()->replication_queue_length.set(queue_.size());\n}\n\nvoid ReplicationWorker::start() {\n  running_ = true;\n\n  for (int i = 0; i < num_replication_threads_; ++i) {\n    threads_.emplace_back(std::bind(&ReplicationWorker::work, this, i));\n  }\n}\n\nvoid ReplicationWorker::stop() {\n  if (!running_) {\n    return;\n  }\n\n  running_ = false;\n  cv_.notify_all();\n\n  for (auto& t : threads_) {\n    t.join();\n  }\n}\n\nvoid ReplicationWorker::work(size_t thread_id) {\n  Application::setCurrentThreadName(\"z1d-replication\");\n  auto replication_info = &replication_infos_[thread_id];\n\n  std::unique_lock<std::mutex> lk(mutex_);\n\n  while (running_) {\n    if (queue_.size() == 0) {\n      cv_.wait(lk);\n    }\n\n    if (queue_.size() == 0) {\n      continue;\n    }\n\n    auto now = WallClock::unixMicros();\n    if (now < queue_.begin()->first) {\n      cv_.wait_for(\n          lk,\n          std::chrono::microseconds(queue_.begin()->first - now));\n\n      continue;\n    }\n\n    auto partition = queue_.begin()->second;\n    queue_.erase(queue_.begin());\n    auto repl_scheme = repl_scheme_;\n\n    RefPtr<PartitionReplication> repl;\n    bool success = true;\n    {\n      lk.unlock();\n\n      auto snap = partition->getSnapshot();\n      replication_info->setPartition(StringUtil::format(\n          \"$0\/$1\/$2\",\n          snap->state.tsdb_namespace(),\n          snap->state.table_key(),\n          snap->key));\n\n      try {\n        repl = partition->getReplicationStrategy(repl_scheme, http_);\n        success = repl->replicate(replication_info);\n      } catch (const StandardException& e) {\n        logError(\"evqld\", e, \"ReplicationWorker error\");\n        success = false;\n      }\n\n      replication_info->reset();\n      lk.lock();\n    }\n\n    if (success) {\n      waitset_.erase(partition->uuid());\n\n      repl = partition->getReplicationStrategy(repl_scheme, http_);\n      if (repl->needsReplication()) {\n        enqueuePartitionWithLock(\n            partition,\n            (uint64_t) ReplicationOptions::CORK);\n      } else {\n        repl = partition->getReplicationStrategy(repl_scheme, http_);\n        if (repl->shouldDropPartition()) {\n          auto snap = partition->getSnapshot();\n          auto dropped =\n              pmap_->dropLocalPartition(\n                  snap->state.tsdb_namespace(),\n                  snap->state.table_key(),\n                  snap->key);\n\n          if (!dropped) {\n            enqueuePartitionWithLock(\n                partition,\n                (uint64_t) ReplicationOptions::CORK);\n          }\n        }\n      }\n    } else {\n      auto delay = 30 * kMicrosPerSecond; \/\/ FIXPAUL increasing delay..\n      queue_.emplace(now + delay, partition);\n    }\n\n    z1stats()->replication_queue_length.set(queue_.size());\n  }\n}\n\nsize_t ReplicationWorker::getNumThreads() const {\n  return num_replication_threads_;\n}\n\nconst ReplicationInfo* ReplicationWorker::getReplicationInfo(\n    size_t thread_id) const {\n  if (thread_id >= num_replication_threads_) {\n    return nullptr;\n  }\n\n  return &replication_infos_[thread_id];\n}\n\n\n} \/\/ namespace eventql\n<commit_msg>don't hang in replication worker dtor<commit_after>\/**\n * Copyright (c) 2016 zScale Technology GmbH <legal@zscale.io>\n * Authors:\n *   - Paul Asmuth <paul@zscale.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 \"unistd.h\"\n#include \"eventql\/eventql.h\"\n#include <eventql\/util\/logging.h>\n#include <eventql\/util\/wallclock.h>\n#include <eventql\/util\/application.h>\n#include <eventql\/db\/ReplicationWorker.h>\n#include <eventql\/db\/Partition.h>\n#include <eventql\/server\/server_stats.h>\n#include <assert.h>\n\nnamespace eventql {\n\nReplicationInfo::ReplicationInfo() {\n  reset();\n}\n\nvoid ReplicationInfo::reset() {\n  std::unique_lock<std::mutex> lk(mutex_);\n  is_idle_ = true;\n  cur_partition_.clear();\n  cur_target_host_.clear();\n  cur_partition_since_ = UnixTime(0);\n  cur_target_host_since_ = UnixTime(0);\n  cur_target_host_bytes_sent_ = 0;\n  cur_target_host_records_sent_ = 0;\n}\n\nvoid ReplicationInfo::setPartition(String name) {\n  std::unique_lock<std::mutex> lk(mutex_);\n  is_idle_ = false;\n  cur_partition_ = name;\n  cur_partition_since_ = WallClock::now();\n}\n\nvoid ReplicationInfo::setTargetHost(String host_name) {\n  std::unique_lock<std::mutex> lk(mutex_);\n  cur_target_host_ = host_name;\n  cur_target_host_since_ = WallClock::now();\n  cur_target_host_bytes_sent_ = 0;\n  cur_target_host_records_sent_ = 0;\n}\n\nvoid ReplicationInfo::setTargetHostStatus(\n    size_t bytes_sent,\n    size_t records_sent) {\n  cur_target_host_bytes_sent_ = bytes_sent;\n  cur_target_host_records_sent_ = records_sent;\n}\n\nString ReplicationInfo::toString() const {\n  std::unique_lock<std::mutex> lk(mutex_);\n  if (is_idle_) {\n    return \"Idle\";\n  }\n\n  if (cur_target_host_.empty()) {\n    return StringUtil::format(\n        \"Replicating partition $0 (since $1s)\",\n        cur_partition_,\n        (WallClock::unixMicros() - cur_partition_since_.unixMicros()) \/ kMicrosPerSecond);\n\n  } else {\n    auto duration = (WallClock::unixMicros() - cur_target_host_since_.unixMicros()) \/ kMicrosPerSecond;\n    return StringUtil::format(\n        \"Replicating partition $0 (since $1s) to host $2 (since $3s); records_sent=$4 bytes_sent=$5MB bw=$6kb\/s\",\n        cur_partition_,\n        (WallClock::unixMicros() - cur_partition_since_.unixMicros()) \/ kMicrosPerSecond,\n        cur_target_host_,\n        duration,\n        cur_target_host_records_sent_,\n        cur_target_host_bytes_sent_ \/ double(1024 * 1024),\n        (cur_target_host_bytes_sent_ \/ (duration < 1 ? 1 : duration)) \/ 1024);\n  }\n}\n\nReplicationWorker::ReplicationWorker(\n    RefPtr<ReplicationScheme> repl_scheme,\n    PartitionMap* pmap,\n    http::HTTPConnectionPool* http) :\n    repl_scheme_(repl_scheme),\n    pmap_(pmap),\n    http_(http),\n    queue_([] (\n        const Pair<uint64_t, RefPtr<Partition>>& a,\n        const Pair<uint64_t, RefPtr<Partition>>& b) {\n      return a.first < b.first;\n    }),\n    running_(false),\n    num_replication_threads_(8),\n    replication_infos_(num_replication_threads_) {\n  pmap->subscribeToPartitionChanges([this] (\n      RefPtr<eventql::PartitionChangeNotification> change) {\n    enqueuePartition(change->partition);\n  });\n\n  start();\n}\n\nReplicationWorker::~ReplicationWorker() {\n  assert(running_ == false);\n}\n\nvoid ReplicationWorker::enqueuePartition(\n    RefPtr<Partition> partition,\n    uint64_t flags \/* = ReplicationOptions::CORK *\/) {\n  std::unique_lock<std::mutex> lk(mutex_);\n  enqueuePartitionWithLock(partition, flags);\n}\n\nvoid ReplicationWorker::enqueuePartitionWithLock(\n    RefPtr<Partition> partition,\n    uint64_t flags) {\n  if (partition->getTable()->config().config().disable_replication()) {\n    return;\n  }\n\n  if (partition->isSplitting()) {\n    flags &= ~(uint64_t) ReplicationOptions::CORK;\n    flags |= (uint64_t) ReplicationOptions::URGENT;\n  }\n\n  uint64_t enqueue_at = WallClock::unixMicros();\n  if (flags & (uint64_t) ReplicationOptions::CORK) {\n    enqueue_at += kReplicationCorkWindowMicros;\n  }\n\n  if (flags & (uint64_t) ReplicationOptions::URGENT) {\n    enqueue_at = 0;\n  }\n\n  auto uuid = partition->uuid();\n  if (waitset_.count(uuid) > 0) {\n    return;\n  }\n\n  queue_.emplace(enqueue_at, partition);\n  waitset_.emplace(uuid);\n  cv_.notify_all();\n\n  z1stats()->replication_queue_length.set(queue_.size());\n}\n\nvoid ReplicationWorker::start() {\n  running_ = true;\n\n  for (int i = 0; i < num_replication_threads_; ++i) {\n    threads_.emplace_back(std::bind(&ReplicationWorker::work, this, i));\n  }\n}\n\nvoid ReplicationWorker::stop() {\n  if (!running_) {\n    return;\n  }\n\n  running_ = false;\n  cv_.notify_all();\n\n  for (auto& t : threads_) {\n    t.join();\n  }\n}\n\nvoid ReplicationWorker::work(size_t thread_id) {\n  Application::setCurrentThreadName(\"z1d-replication\");\n  auto replication_info = &replication_infos_[thread_id];\n\n  std::unique_lock<std::mutex> lk(mutex_);\n\n  while (running_) {\n    if (queue_.size() == 0) {\n      cv_.wait(lk);\n    }\n\n    if (queue_.size() == 0) {\n      continue;\n    }\n\n    auto now = WallClock::unixMicros();\n    if (now < queue_.begin()->first) {\n      cv_.wait_for(\n          lk,\n          std::chrono::microseconds(queue_.begin()->first - now));\n\n      continue;\n    }\n\n    auto partition = queue_.begin()->second;\n    queue_.erase(queue_.begin());\n    auto repl_scheme = repl_scheme_;\n\n    RefPtr<PartitionReplication> repl;\n    bool success = true;\n    {\n      lk.unlock();\n\n      auto snap = partition->getSnapshot();\n      replication_info->setPartition(StringUtil::format(\n          \"$0\/$1\/$2\",\n          snap->state.tsdb_namespace(),\n          snap->state.table_key(),\n          snap->key));\n\n      try {\n        repl = partition->getReplicationStrategy(repl_scheme, http_);\n        success = repl->replicate(replication_info);\n      } catch (const StandardException& e) {\n        logError(\"evqld\", e, \"ReplicationWorker error\");\n        success = false;\n      }\n\n      replication_info->reset();\n      lk.lock();\n    }\n\n    if (success) {\n      waitset_.erase(partition->uuid());\n\n      repl = partition->getReplicationStrategy(repl_scheme, http_);\n      if (repl->needsReplication()) {\n        enqueuePartitionWithLock(\n            partition,\n            (uint64_t) ReplicationOptions::CORK);\n      } else {\n        repl = partition->getReplicationStrategy(repl_scheme, http_);\n        if (repl->shouldDropPartition()) {\n          auto snap = partition->getSnapshot();\n          auto dropped =\n              pmap_->dropLocalPartition(\n                  snap->state.tsdb_namespace(),\n                  snap->state.table_key(),\n                  snap->key);\n\n          if (!dropped) {\n            enqueuePartitionWithLock(\n                partition,\n                (uint64_t) ReplicationOptions::CORK);\n          }\n        }\n      }\n    } else {\n      auto delay = 30 * kMicrosPerSecond; \/\/ FIXPAUL increasing delay..\n      queue_.emplace(now + delay, partition);\n    }\n\n    z1stats()->replication_queue_length.set(queue_.size());\n  }\n}\n\nsize_t ReplicationWorker::getNumThreads() const {\n  return num_replication_threads_;\n}\n\nconst ReplicationInfo* ReplicationWorker::getReplicationInfo(\n    size_t thread_id) const {\n  if (thread_id >= num_replication_threads_) {\n    return nullptr;\n  }\n\n  return &replication_infos_[thread_id];\n}\n\n\n} \/\/ namespace eventql\n<|endoftext|>"}
{"text":"<commit_before>#include <QMessageBox>\n#include <QLabel>\n#include <QVBoxLayout>\n#include <QHBoxLayout>\n#include <QProgressBar>\n#include <QPushButton>\n#include <QDesktopServices>\n#include <QDebug>\n#include <climits>\n\n#include \"utils\/utils.h\"\n#include \"progress-dialog.h\"\n#include \"seafile-applet.h\"\n#include \"transfer-mgr.h\"\n\nnamespace\n{\nconst char* kQueryIndexUrl = \"idx_progress\";\n} \/\/ namespace\n\n\nFileBrowserProgressDialog::FileBrowserProgressDialog(FileNetworkTask *task, QWidget *parent)\n        : QProgressDialog(parent),\n          task_(task),\n          progress_request_(NULL),\n          index_progress_timer_(new QTimer(this)),\n          task_finished_(false)\n{\n    initUI();\n    initTaskInfo();\n\n    connect(task_, SIGNAL(progressUpdate(qint64, qint64)),\n            this, SLOT(onProgressUpdate(qint64, qint64)));\n    connect(task_, SIGNAL(nameUpdate(QString)),\n            this, SLOT(onCurrentNameUpdate(QString)));\n    connect(task_, SIGNAL(finished(bool)), this, SLOT(onTaskFinished(bool)));\n    connect(task_, SIGNAL(retried(int)), this, SLOT(initTaskInfo()));\n    connect(this, SIGNAL(canceled()), this, SLOT(cancel()));\n\n    if (task_->type() == FileNetworkTask::Upload) {\n        FileUploadTask *upload_task = (FileUploadTask *)task_;\n        connect(upload_task, SIGNAL(oneFileFailed(const QString&, bool)),\n                this, SLOT(onOneFileUploadFailed(const QString&, bool)));\n    }\n}\n\nvoid FileBrowserProgressDialog::initUI()\n{\n    setWindowModality(Qt::NonModal);\n    setWindowFlags(windowFlags() & ~Qt::WindowContextHelpButtonHint);\n    setWindowIcon(QIcon(\":\/images\/seafile.png\"));\n\n    QVBoxLayout *layout_ = new QVBoxLayout;\n    progress_bar_ = new QProgressBar;\n    description_label_ = new QLabel;\n\n    layout_->addWidget(description_label_);\n    layout_->addWidget(progress_bar_);\n\n    QHBoxLayout *hlayout_ = new QHBoxLayout;\n    more_details_label_ = new QLabel;\n    more_details_label_->setText(tr(\"Pending\"));\n    cancel_button_ = new QPushButton(tr(\"Cancel\"));\n    QWidget *spacer = new QWidget;\n    spacer->setSizePolicy(QSizePolicy::Expanding, QSizePolicy::Preferred);\n\n    hlayout_->addWidget(more_details_label_);\n    hlayout_->addWidget(spacer);\n    hlayout_->addWidget(cancel_button_);\n    hlayout_->setContentsMargins(-1, 0, -1, 6);\n    layout_->setContentsMargins(-1, 0, -1, 6);\n    layout_->addLayout(hlayout_);\n\n    setLayout(layout_);\n    setLabel(description_label_);\n    setBar(progress_bar_);\n    setCancelButton(cancel_button_);\n}\n\nFileBrowserProgressDialog::~FileBrowserProgressDialog()\n{\n    if (progress_request_ != NULL)\n        progress_request_->deleteLater();\n}\n\nvoid FileBrowserProgressDialog::initTaskInfo()\n{\n    task_finished_ = false;\n    if (task_->canceled()) {\n        return;\n    }\n    QString title, label;\n    if (task_->type() == FileNetworkTask::Upload) {\n        title = tr(\"Upload\");\n        label = tr(\"Uploading %1\");\n    } else {\n        title = tr(\"Download\");\n        label = tr(\"Downloading %1\");\n    }\n    setWindowTitle(title);\n    setLabelText(label.arg(QFileInfo(task_->localFilePath()).fileName()));\n\n    more_details_label_->setText(\"\");\n\n    setMaximum(0);\n    setValue(0);\n}\n\nvoid FileBrowserProgressDialog::onCurrentNameUpdate(QString current_name)\n{\n    QString label = tr(\"Uploading %1\");\n    setLabelText(label.arg(current_name));\n}\n\nvoid FileBrowserProgressDialog::onProgressUpdate(qint64 processed_bytes, qint64 total_bytes)\n{\n    \/\/ Skip the updates if the task has been cancelled, because we may already\n    \/\/ have already rejected this dialog.\n    if (task_->canceled()) {\n        return;\n    }\n    \/\/ if the value is less than the maxmium, this dialog will close itself\n    \/\/ add this guard for safety\n    if (processed_bytes >= total_bytes)\n        total_bytes = processed_bytes + 1;\n\n    if (total_bytes > INT_MAX) {\n        if (maximum() != INT_MAX)\n            setMaximum(INT_MAX);\n\n        \/\/ Avoid overflow\n        double progress = double(processed_bytes) * INT_MAX \/ total_bytes;\n        setValue((int)progress);\n    } else {\n        if (maximum() != total_bytes)\n            setMaximum(total_bytes);\n\n        setValue(processed_bytes);\n    }\n\n    more_details_label_->setText(tr(\"%1 of %2\")\n                            .arg(::readableFileSizeV2(processed_bytes))\n                            .arg(::readableFileSizeV2(total_bytes)));\n}\n\nvoid FileBrowserProgressDialog::onTaskFinished(bool success)\n{\n    task_finished_ = true;\n    \/\/ printf (\"FileBrowserProgressDialog: onTaskFinished\\n\");\n    if (task_->canceled()) {\n        return;\n    }\n\n    cancel_button_->setVisible(false);\n\n    progerss_id_ = task_->oid();\n\n    \/\/https:\/\/dev.seafile.com\/seafhttp\/upload-api\/b7443978-42cf-4cc6-87bf-add0fc7ad6e3\n    \/\/https:\/\/dev.seafile.com\/seafhttp\/idx_progress\n    progress_url_ = ::urlJoin(QUrl(task_->url().toString(QUrl::PrettyDecoded).\n                                   section(\"upload\", 0, 0)), kQueryIndexUrl);\n    if (success) {\n        \/\/ printf (\"progress dialog: task success\\n\");\n\n        \/\/Judge \"-\" as a task id or a file id\n        \/\/Compatible with new and old server versions\n        if (progerss_id_.contains(\"-\")) {\n            onQueryUpdate();\n            index_progress_timer_->start(3000);\n        } else {\n            accept();\n        }\n    } else {\n        \/\/ printf (\"progress dialog: task failed\\n\");\n        reject();\n    }\n}\n\nvoid FileBrowserProgressDialog::onQueryUpdate()\n{\n    if (progress_request_) {\n        progress_request_->deleteLater();\n        progress_request_ = NULL;\n    }\n\n    progress_request_ = new GetIndexProgressRequest(progress_url_, progerss_id_);\n    connect(progress_request_, SIGNAL(success(const ServerIndexProgress&)),\n            this, SLOT(onQuerySuccess(const ServerIndexProgress&)));\n\n    progress_request_->send();\n}\n\nvoid FileBrowserProgressDialog::onQuerySuccess(const ServerIndexProgress &result)\n{\n    setLabelText(tr(\"Saving\"));\n    more_details_label_->setText(tr(\"%1 of %2\")\n                            .arg(::readableFileSizeV2(result.indexed))\n                            .arg(::readableFileSizeV2(result.total)));\n    if (result.status == 0) {\n        index_progress_timer_->stop();\n        accept();\n    } else if (result.status == -1) {\n        index_progress_timer_->stop();\n        seafApplet->warningBox(tr(\"File save failed\"), this);\n        reject();\n    }\n}\n\nvoid FileBrowserProgressDialog::cancel()\n{\n    if (task_finished_ || task_->canceled()) {\n        return;\n    }\n    if (task_->type() == FileNetworkTask::Upload) {\n        task_->cancel();\n    } else {\n        \/\/ For download tasks we need to go through the transfer manager\n        TransferManager::instance()->cancelDownload(task_->repoId(), task_->path());\n    }\n    reject();\n}\n\nvoid FileBrowserProgressDialog::onOneFileUploadFailed(const QString &filename,\n                                                      bool single_file)\n{\n    if (task_->canceled()) {\n        return;\n    }\n\n    FileUploadTask *upload_task = (FileUploadTask *)task_;\n\n    QString msg =\n        tr(\"Failed to upload file \\\"%1\\\", do you want to retry?\").arg(filename);\n    ActionOnFailure choice = retryOrSkipOrAbort(msg, single_file);\n\n    switch (choice) {\n        case ActionRetry:\n            upload_task->continueWithFailedFile(true);\n            break;\n        case ActionSkip:\n            upload_task->continueWithFailedFile(false);\n            break;\n        case ActionAbort:\n            cancel();\n            break;\n    }\n}\n\nFileBrowserProgressDialog::ActionOnFailure\nFileBrowserProgressDialog::retryOrSkipOrAbort(const QString& msg, bool single_file)\n{\n    QMessageBox box(this);\n    box.setText(msg);\n    box.setWindowTitle(getBrand());\n    box.setIcon(QMessageBox::Question);\n\n    QPushButton *yes_btn = box.addButton(tr(\"Retry\"), QMessageBox::YesRole);\n    QPushButton *no_btn = nullptr;\n    if (!single_file) {\n        \/\/ If this is single file upload\/update, we only show \"retry\" and\n        \/\/ \"abort\".\n        no_btn = box.addButton(tr(\"Skip\"), QMessageBox::NoRole);\n    }\n    box.addButton(tr(\"Abort\"), QMessageBox::RejectRole);\n\n\n    box.setDefaultButton(yes_btn);\n    box.exec();\n    QAbstractButton *btn = box.clickedButton();\n    if (btn == yes_btn) {\n        return ActionRetry;\n    } else if (btn == no_btn) {\n        return ActionSkip;\n    }\n\n    return ActionAbort;\n}\n<commit_msg>Fixed upload with async index<commit_after>#include <QMessageBox>\n#include <QLabel>\n#include <QVBoxLayout>\n#include <QHBoxLayout>\n#include <QProgressBar>\n#include <QPushButton>\n#include <QDesktopServices>\n#include <QDebug>\n#include <climits>\n\n#include \"utils\/utils.h\"\n#include \"progress-dialog.h\"\n#include \"seafile-applet.h\"\n#include \"transfer-mgr.h\"\n\nnamespace\n{\nconst char* kQueryIndexUrl = \"idx_progress\";\n} \/\/ namespace\n\n\nFileBrowserProgressDialog::FileBrowserProgressDialog(FileNetworkTask *task, QWidget *parent)\n        : QProgressDialog(parent),\n          task_(task),\n          progress_request_(NULL),\n          index_progress_timer_(new QTimer(this)),\n          task_finished_(false)\n{\n    initUI();\n    initTaskInfo();\n\n    connect(index_progress_timer_, SIGNAL(timeout()), this, SLOT(onQueryUpdate()));\n\n    connect(task_, SIGNAL(progressUpdate(qint64, qint64)),\n            this, SLOT(onProgressUpdate(qint64, qint64)));\n    connect(task_, SIGNAL(nameUpdate(QString)),\n            this, SLOT(onCurrentNameUpdate(QString)));\n    connect(task_, SIGNAL(finished(bool)), this, SLOT(onTaskFinished(bool)));\n    connect(task_, SIGNAL(retried(int)), this, SLOT(initTaskInfo()));\n    connect(this, SIGNAL(canceled()), this, SLOT(cancel()));\n\n    if (task_->type() == FileNetworkTask::Upload) {\n        FileUploadTask *upload_task = (FileUploadTask *)task_;\n        connect(upload_task, SIGNAL(oneFileFailed(const QString&, bool)),\n                this, SLOT(onOneFileUploadFailed(const QString&, bool)));\n    }\n}\n\nvoid FileBrowserProgressDialog::initUI()\n{\n    setWindowModality(Qt::NonModal);\n    setWindowFlags(windowFlags() & ~Qt::WindowContextHelpButtonHint);\n    setWindowIcon(QIcon(\":\/images\/seafile.png\"));\n\n    QVBoxLayout *layout_ = new QVBoxLayout;\n    progress_bar_ = new QProgressBar;\n    description_label_ = new QLabel;\n\n    layout_->addWidget(description_label_);\n    layout_->addWidget(progress_bar_);\n\n    QHBoxLayout *hlayout_ = new QHBoxLayout;\n    more_details_label_ = new QLabel;\n    more_details_label_->setText(tr(\"Pending\"));\n    cancel_button_ = new QPushButton(tr(\"Cancel\"));\n    QWidget *spacer = new QWidget;\n    spacer->setSizePolicy(QSizePolicy::Expanding, QSizePolicy::Preferred);\n\n    hlayout_->addWidget(more_details_label_);\n    hlayout_->addWidget(spacer);\n    hlayout_->addWidget(cancel_button_);\n    hlayout_->setContentsMargins(-1, 0, -1, 6);\n    layout_->setContentsMargins(-1, 0, -1, 6);\n    layout_->addLayout(hlayout_);\n\n    setLayout(layout_);\n    setLabel(description_label_);\n    setBar(progress_bar_);\n    setCancelButton(cancel_button_);\n}\n\nFileBrowserProgressDialog::~FileBrowserProgressDialog()\n{\n    if (progress_request_ != NULL)\n        progress_request_->deleteLater();\n}\n\nvoid FileBrowserProgressDialog::initTaskInfo()\n{\n    task_finished_ = false;\n    if (task_->canceled()) {\n        return;\n    }\n    QString title, label;\n    if (task_->type() == FileNetworkTask::Upload) {\n        title = tr(\"Upload\");\n        label = tr(\"Uploading %1\");\n    } else {\n        title = tr(\"Download\");\n        label = tr(\"Downloading %1\");\n    }\n    setWindowTitle(title);\n    setLabelText(label.arg(QFileInfo(task_->localFilePath()).fileName()));\n\n    more_details_label_->setText(\"\");\n\n    setMaximum(0);\n    setValue(0);\n}\n\nvoid FileBrowserProgressDialog::onCurrentNameUpdate(QString current_name)\n{\n    QString label = tr(\"Uploading %1\");\n    setLabelText(label.arg(current_name));\n}\n\nvoid FileBrowserProgressDialog::onProgressUpdate(qint64 processed_bytes, qint64 total_bytes)\n{\n    \/\/ Skip the updates if the task has been cancelled, because we may already\n    \/\/ have already rejected this dialog.\n    if (task_->canceled()) {\n        return;\n    }\n    \/\/ if the value is less than the maxmium, this dialog will close itself\n    \/\/ add this guard for safety\n    if (processed_bytes >= total_bytes)\n        total_bytes = processed_bytes + 1;\n\n    if (total_bytes > INT_MAX) {\n        if (maximum() != INT_MAX)\n            setMaximum(INT_MAX);\n\n        \/\/ Avoid overflow\n        double progress = double(processed_bytes) * INT_MAX \/ total_bytes;\n        setValue((int)progress);\n    } else {\n        if (maximum() != total_bytes)\n            setMaximum(total_bytes);\n\n        setValue(processed_bytes);\n    }\n\n    more_details_label_->setText(tr(\"%1 of %2\")\n                            .arg(::readableFileSizeV2(processed_bytes))\n                            .arg(::readableFileSizeV2(total_bytes)));\n}\n\nvoid FileBrowserProgressDialog::onTaskFinished(bool success)\n{\n    task_finished_ = true;\n    \/\/ printf (\"FileBrowserProgressDialog: onTaskFinished\\n\");\n    if (task_->canceled()) {\n        return;\n    }\n\n    cancel_button_->setVisible(false);\n\n    progerss_id_ = task_->oid();\n\n    \/\/https:\/\/dev.seafile.com\/seafhttp\/upload-api\/b7443978-42cf-4cc6-87bf-add0fc7ad6e3\n    \/\/https:\/\/dev.seafile.com\/seafhttp\/idx_progress\n    progress_url_ = ::urlJoin(QUrl(task_->url().toString(QUrl::PrettyDecoded).\n                                   section(\"upload\", 0, 0)), kQueryIndexUrl);\n    if (success) {\n        \/\/ printf (\"progress dialog: task success\\n\");\n\n        \/\/Judge \"-\" as a task id or a file id\n        \/\/Compatible with new and old server versions\n        if (progerss_id_.contains(\"-\")) {\n            onQueryUpdate();\n            index_progress_timer_->start(3000);\n        } else {\n            accept();\n        }\n    } else {\n        \/\/ printf (\"progress dialog: task failed\\n\");\n        reject();\n    }\n}\n\nvoid FileBrowserProgressDialog::onQueryUpdate()\n{\n    if (progress_request_) {\n        progress_request_->deleteLater();\n        progress_request_ = NULL;\n    }\n\n    progress_request_ = new GetIndexProgressRequest(progress_url_, progerss_id_);\n    connect(progress_request_, SIGNAL(success(const ServerIndexProgress&)),\n            this, SLOT(onQuerySuccess(const ServerIndexProgress&)));\n\n    progress_request_->send();\n}\n\nvoid FileBrowserProgressDialog::onQuerySuccess(const ServerIndexProgress &result)\n{\n    setLabelText(tr(\"Saving\"));\n    more_details_label_->setText(tr(\"%1 of %2\")\n                            .arg(::readableFileSizeV2(result.indexed))\n                            .arg(::readableFileSizeV2(result.total)));\n    if (result.status == 0) {\n        index_progress_timer_->stop();\n        accept();\n    } else if (result.status == -1) {\n        index_progress_timer_->stop();\n        seafApplet->warningBox(tr(\"File save failed\"), this);\n        reject();\n    }\n}\n\nvoid FileBrowserProgressDialog::cancel()\n{\n    if (task_finished_ || task_->canceled()) {\n        return;\n    }\n    if (task_->type() == FileNetworkTask::Upload) {\n        task_->cancel();\n    } else {\n        \/\/ For download tasks we need to go through the transfer manager\n        TransferManager::instance()->cancelDownload(task_->repoId(), task_->path());\n    }\n    reject();\n}\n\nvoid FileBrowserProgressDialog::onOneFileUploadFailed(const QString &filename,\n                                                      bool single_file)\n{\n    if (task_->canceled()) {\n        return;\n    }\n\n    FileUploadTask *upload_task = (FileUploadTask *)task_;\n\n    QString msg =\n        tr(\"Failed to upload file \\\"%1\\\", do you want to retry?\").arg(filename);\n    ActionOnFailure choice = retryOrSkipOrAbort(msg, single_file);\n\n    switch (choice) {\n        case ActionRetry:\n            upload_task->continueWithFailedFile(true);\n            break;\n        case ActionSkip:\n            upload_task->continueWithFailedFile(false);\n            break;\n        case ActionAbort:\n            cancel();\n            break;\n    }\n}\n\nFileBrowserProgressDialog::ActionOnFailure\nFileBrowserProgressDialog::retryOrSkipOrAbort(const QString& msg, bool single_file)\n{\n    QMessageBox box(this);\n    box.setText(msg);\n    box.setWindowTitle(getBrand());\n    box.setIcon(QMessageBox::Question);\n\n    QPushButton *yes_btn = box.addButton(tr(\"Retry\"), QMessageBox::YesRole);\n    QPushButton *no_btn = nullptr;\n    if (!single_file) {\n        \/\/ If this is single file upload\/update, we only show \"retry\" and\n        \/\/ \"abort\".\n        no_btn = box.addButton(tr(\"Skip\"), QMessageBox::NoRole);\n    }\n    box.addButton(tr(\"Abort\"), QMessageBox::RejectRole);\n\n\n    box.setDefaultButton(yes_btn);\n    box.exec();\n    QAbstractButton *btn = box.clickedButton();\n    if (btn == yes_btn) {\n        return ActionRetry;\n    } else if (btn == no_btn) {\n        return ActionSkip;\n    }\n\n    return ActionAbort;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Copyright (C) 2002 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 \"cssysdef.h\"\n#include \"cssys\/sysfunc.h\"\n#include \"csgeom\/math3d.h\"\n#include \"csutil\/parser.h\"\n#include \"csutil\/scanstr.h\"\n#include \"csutil\/cscolor.h\"\n#include \"starldr.h\"\n#include \"imesh\/object.h\"\n#include \"imesh\/stars.h\"\n#include \"iengine\/mesh.h\"\n#include \"iengine\/engine.h\"\n#include \"iutil\/plugin.h\"\n#include \"ivideo\/graph3d.h\"\n#include \"qint.h\"\n#include \"iutil\/strvec.h\"\n#include \"csutil\/util.h\"\n#include \"iutil\/object.h\"\n#include \"iengine\/material.h\"\n#include \"ivaria\/reporter.h\"\n#include \"iutil\/objreg.h\"\n#include \"iutil\/eventh.h\"\n#include \"iutil\/comp.h\"\n#include \"imap\/services.h\"\n\nCS_IMPLEMENT_PLUGIN\n\nCS_TOKEN_DEF_START\n  CS_TOKEN_DEF (BOX)\n  CS_TOKEN_DEF (COLOR)\n  CS_TOKEN_DEF (MAXCOLOR)\n  CS_TOKEN_DEF (DENSITY)\n  CS_TOKEN_DEF (MAXDISTANCE)\n  CS_TOKEN_DEF (FACTORY)\nCS_TOKEN_DEF_END\n\nSCF_IMPLEMENT_IBASE (csStarFactoryLoader)\n  SCF_IMPLEMENTS_INTERFACE (iLoaderPlugin)\n  SCF_IMPLEMENTS_EMBEDDED_INTERFACE (iComponent)\nSCF_IMPLEMENT_IBASE_END\n\nSCF_IMPLEMENT_EMBEDDED_IBASE (csStarFactoryLoader::eiComponent)\n  SCF_IMPLEMENTS_INTERFACE (iComponent)\nSCF_IMPLEMENT_EMBEDDED_IBASE_END\n\nSCF_IMPLEMENT_IBASE (csStarFactorySaver)\n  SCF_IMPLEMENTS_INTERFACE (iSaverPlugin)\n  SCF_IMPLEMENTS_EMBEDDED_INTERFACE (iComponent)\nSCF_IMPLEMENT_IBASE_END\n\nSCF_IMPLEMENT_EMBEDDED_IBASE (csStarFactorySaver::eiComponent)\n  SCF_IMPLEMENTS_INTERFACE (iComponent)\nSCF_IMPLEMENT_EMBEDDED_IBASE_END\n\nSCF_IMPLEMENT_IBASE (csStarLoader)\n  SCF_IMPLEMENTS_INTERFACE (iLoaderPlugin)\n  SCF_IMPLEMENTS_EMBEDDED_INTERFACE (iComponent)\nSCF_IMPLEMENT_IBASE_END\n\nSCF_IMPLEMENT_EMBEDDED_IBASE (csStarLoader::eiComponent)\n  SCF_IMPLEMENTS_INTERFACE (iComponent)\nSCF_IMPLEMENT_EMBEDDED_IBASE_END\n\nSCF_IMPLEMENT_IBASE (csStarSaver)\n  SCF_IMPLEMENTS_INTERFACE (iSaverPlugin)\n  SCF_IMPLEMENTS_EMBEDDED_INTERFACE (iComponent)\nSCF_IMPLEMENT_IBASE_END\n\nSCF_IMPLEMENT_EMBEDDED_IBASE (csStarSaver::eiComponent)\n  SCF_IMPLEMENTS_INTERFACE (iComponent)\nSCF_IMPLEMENT_EMBEDDED_IBASE_END\n\nSCF_IMPLEMENT_FACTORY (csStarFactoryLoader)\nSCF_IMPLEMENT_FACTORY (csStarFactorySaver)\nSCF_IMPLEMENT_FACTORY (csStarLoader)\nSCF_IMPLEMENT_FACTORY (csStarSaver)\n\nSCF_EXPORT_CLASS_TABLE (starldr)\n  SCF_EXPORT_CLASS (csStarFactoryLoader,\n    \"crystalspace.mesh.loader.factory.stars\",\n    \"Crystal Space Star Factory Loader\")\n  SCF_EXPORT_CLASS (csStarFactorySaver, \"crystalspace.mesh.saver.factory.stars\",\n    \"Crystal Space Star Factory Saver\")\n  SCF_EXPORT_CLASS (csStarLoader, \"crystalspace.mesh.loader.stars\",\n\t\t    \"Crystal Space Star Mesh Loader\")\n  SCF_EXPORT_CLASS (csStarSaver, \"crystalspace.mesh.saver.stars\",\n    \"Crystal Space Star Mesh Saver\")\nSCF_EXPORT_CLASS_TABLE_END\n\nstatic void ReportError (iReporter* reporter, const char* id,\n\tconst char* description, ...)\n{\n  va_list arg;\n  va_start (arg, description);\n\n  if (reporter)\n  {\n    reporter->ReportV (CS_REPORTER_SEVERITY_ERROR, id, description, arg);\n  }\n  else\n  {\n    char buf[1024];\n    vsprintf (buf, description, arg);\n    csPrintf (\"Error ID: %s\\n\", id);\n    csPrintf (\"Description: %s\\n\", buf);\n  }\n  va_end (arg);\n}\n\ncsStarFactoryLoader::csStarFactoryLoader (iBase* pParent)\n{\n  SCF_CONSTRUCT_IBASE (pParent);\n  SCF_CONSTRUCT_EMBEDDED_IBASE(scfiComponent);\n  reporter = NULL;\n  plugin_mgr = NULL;\n}\n\ncsStarFactoryLoader::~csStarFactoryLoader ()\n{\n  if (reporter) reporter->DecRef ();\n  if (plugin_mgr) plugin_mgr->DecRef ();\n}\n\nbool csStarFactoryLoader::Initialize (iObjectRegistry* object_reg)\n{\n  csStarFactoryLoader::object_reg = object_reg;\n  plugin_mgr = CS_QUERY_REGISTRY (object_reg, iPluginManager);\n  reporter = CS_QUERY_REGISTRY (object_reg, iReporter);\n  return true;\n}\n\niBase* csStarFactoryLoader::Parse (const char* \/*string*\/,\n\tiMaterialList*, iMeshFactoryList*, iBase* \/* context *\/)\n{\n  iMeshObjectType* type = CS_QUERY_PLUGIN_CLASS (plugin_mgr,\n  \t\"crystalspace.mesh.object.stars\", iMeshObjectType);\n  if (!type)\n  {\n    type = CS_LOAD_PLUGIN (plugin_mgr, \"crystalspace.mesh.object.stars\",\n    \tiMeshObjectType);\n  }\n  if (!type)\n  {\n    ReportError (reporter,\n\t\t\"crystalspace.starfactoryloader.setup.objecttype\",\n\t\t\"Could not load the stars mesh object plugin!\");\n    return NULL;\n  }\n  iMeshObjectFactory* fact = type->NewFactory ();\n  type->DecRef ();\n  return fact;\n}\n\n\/\/---------------------------------------------------------------------------\n\ncsStarFactorySaver::csStarFactorySaver (iBase* pParent)\n{\n  SCF_CONSTRUCT_IBASE (pParent);\n  SCF_CONSTRUCT_EMBEDDED_IBASE(scfiComponent);\n  reporter = NULL;\n  plugin_mgr = NULL;\n}\n\ncsStarFactorySaver::~csStarFactorySaver ()\n{\n  if (reporter) reporter->DecRef ();\n  if (plugin_mgr) plugin_mgr->DecRef ();\n}\n\nbool csStarFactorySaver::Initialize (iObjectRegistry* object_reg)\n{\n  csStarFactorySaver::object_reg = object_reg;\n  plugin_mgr = CS_QUERY_REGISTRY (object_reg, iPluginManager);\n  reporter = CS_QUERY_REGISTRY (object_reg, iReporter);\n  return true;\n}\n\n#define MAXLINE 100 \/* max number of chars per line... *\/\n\nvoid csStarFactorySaver::WriteDown (iBase* \/*obj*\/, iStrVector * \/*str*\/)\n{\n  \/\/ no params\n}\n\n\/\/---------------------------------------------------------------------------\n\ncsStarLoader::csStarLoader (iBase* pParent)\n{\n  SCF_CONSTRUCT_IBASE (pParent);\n  SCF_CONSTRUCT_EMBEDDED_IBASE(scfiComponent);\n  reporter = NULL;\n  synldr = NULL;\n  plugin_mgr = NULL;\n}\n\ncsStarLoader::~csStarLoader ()\n{\n  SCF_DEC_REF (reporter);\n  SCF_DEC_REF (synldr);\n  SCF_DEC_REF (plugin_mgr);\n}\n\nbool csStarLoader::Initialize (iObjectRegistry* object_reg)\n{\n  csStarLoader::object_reg = object_reg;\n  plugin_mgr = CS_QUERY_REGISTRY (object_reg, iPluginManager);\n  reporter = CS_QUERY_REGISTRY (object_reg, iReporter);\n  synldr = CS_QUERY_REGISTRY (object_reg, iSyntaxService);\n  if (!synldr)\n  {\n    synldr = CS_LOAD_PLUGIN (plugin_mgr,\n    \t\"crystalspace.syntax.loader.service.text\", iSyntaxService);\n    if (!synldr)\n    {\n      ReportError (reporter,\n\t\"crystalspace.starloader.parse.initialize\",\n\t\"Could not load the syntax services!\");\n      return false;\n    }\n    if (!object_reg->Register (synldr, \"iSyntaxService\"))\n    {\n      ReportError (reporter,\n\t\"crystalspace.starloader.parse.initialize\",\n\t\"Could not register the syntax services!\");\n      return false;\n    }\n  }\n  return true;\n}\n\niBase* csStarLoader::Parse (const char* string, iMaterialList* matlist,\n\tiMeshFactoryList* factlist,\n\tiBase*)\n{\n  CS_TOKEN_TABLE_START (commands)\n    CS_TOKEN_TABLE (BOX)\n    CS_TOKEN_TABLE (COLOR)\n    CS_TOKEN_TABLE (MAXCOLOR)\n    CS_TOKEN_TABLE (DENSITY)\n    CS_TOKEN_TABLE (MAXDISTANCE)\n    CS_TOKEN_TABLE (FACTORY)\n  CS_TOKEN_TABLE_END\n\n  char* name;\n  long cmd;\n  char* params;\n  char str[255];\n\n  iMeshObject* mesh = NULL;\n  iStarsState* starstate = NULL;\n\n  char* buf = (char*)string;\n  while ((cmd = csGetObject (&buf, commands, &name, &params)) > 0)\n  {\n    if (!params)\n    {\n      ReportError (reporter,\n\t\t\"crystalspace.starloader.parse.badformat\",\n\t\t\"Bad format while parsing star object!\");\n      if (starstate) starstate->DecRef ();\n      return NULL;\n    }\n    switch (cmd)\n    {\n      case CS_TOKEN_BOX:\n\t{\n\t  csVector3 v1, v2;\n\t  csScanStr (params, \"%f,%f,%f,%f,%f,%f\",\n\t    &v1.x, &v1.y, &v1.z,\n\t    &v2.x, &v2.y, &v2.z);\n\t  starstate->SetBox (csBox3 (v1, v2));\n\t}\n\tbreak;\n      case CS_TOKEN_COLOR:\n\t{\n\t  csColor col;\n\t  csScanStr (params, \"%f,%f,%f\", &col.red, &col.green, &col.blue);\n\t  starstate->SetColor (col);\n\t}\n\tbreak;\n      case CS_TOKEN_MAXCOLOR:\n\t{\n\t  csColor col;\n\t  csScanStr (params, \"%f,%f,%f\", &col.red, &col.green, &col.blue);\n\t  starstate->SetMaxColor (col);\n\t}\n\tbreak;\n      case CS_TOKEN_DENSITY:\n\t{\n\t  float d;\n\t  csScanStr (params, \"%f\", &d);\n\t  starstate->SetDensity (d);\n\t}\n\tbreak;\n      case CS_TOKEN_MAXDISTANCE:\n\t{\n\t  float d;\n\t  csScanStr (params, \"%f\", &d);\n\t  starstate->SetMaxDistance (d);\n\t}\n\tbreak;\n      case CS_TOKEN_FACTORY:\n\t{\n          csScanStr (params, \"%s\", str);\n\t  iMeshFactoryWrapper* fact = factlist->FindByName (str);\n\t  if (!fact)\n\t  {\n      \t    ReportError (reporter,\n\t\t\"crystalspace.starloader.parse.unknownfactory\",\n\t\t\"Couldn't find factory '%s'!\", str);\n\t    if (starstate) starstate->DecRef ();\n\t    return NULL;\n\t  }\n\t  mesh = fact->GetMeshObjectFactory ()->NewInstance ();\n          starstate = SCF_QUERY_INTERFACE (mesh, iStarsState);\n\t}\n\tbreak;\n    }\n  }\n\n  if (starstate) starstate->DecRef ();\n  return mesh;\n}\n\n\/\/---------------------------------------------------------------------------\n\ncsStarSaver::csStarSaver (iBase* pParent)\n{\n  SCF_CONSTRUCT_IBASE (pParent);\n  SCF_CONSTRUCT_EMBEDDED_IBASE(scfiComponent);\n  reporter = NULL;\n  synldr = NULL;\n  plugin_mgr = NULL;\n}\n\ncsStarSaver::~csStarSaver ()\n{\n  SCF_DEC_REF (reporter);\n  SCF_DEC_REF (synldr);\n  SCF_DEC_REF (plugin_mgr);\n}\n\nbool csStarSaver::Initialize (iObjectRegistry* object_reg)\n{\n  csStarSaver::object_reg = object_reg;\n  plugin_mgr = CS_QUERY_REGISTRY (object_reg, iPluginManager);\n  reporter = CS_QUERY_REGISTRY (object_reg, iReporter);\n  synldr = CS_QUERY_REGISTRY (object_reg, iSyntaxService);\n  if (!synldr)\n  {\n    synldr = CS_LOAD_PLUGIN (plugin_mgr,\n    \t\"crystalspace.syntax.loader.service.text\", iSyntaxService);\n    if (!synldr)\n    {\n      ReportError (reporter,\n\t\"crystalspace.starsaver.parse.initialize\",\n\t\"Could not load the syntax services!\");\n      return false;\n    }\n    if (!object_reg->Register (synldr, \"iSyntaxService\"))\n    {\n      ReportError (reporter,\n\t\"crystalspace.starsaver.parse.initialize\",\n\t\"Could not register the syntax services!\");\n      return false;\n    }\n  }\n  return true;\n}\n\nvoid csStarSaver::WriteDown (iBase* \/*obj*\/, iStrVector *\/*str*\/)\n{\n  \/\/ @@@ Not implemented yet.\n}\n<commit_msg>Eliminated MSVC compiler warning.<commit_after>\/*\n    Copyright (C) 2002 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 \"cssysdef.h\"\n#include \"cssys\/sysfunc.h\"\n#include \"csgeom\/math3d.h\"\n#include \"csutil\/parser.h\"\n#include \"csutil\/scanstr.h\"\n#include \"csutil\/cscolor.h\"\n#include \"starldr.h\"\n#include \"imesh\/object.h\"\n#include \"imesh\/stars.h\"\n#include \"iengine\/mesh.h\"\n#include \"iengine\/engine.h\"\n#include \"iutil\/plugin.h\"\n#include \"ivideo\/graph3d.h\"\n#include \"qint.h\"\n#include \"iutil\/strvec.h\"\n#include \"csutil\/util.h\"\n#include \"iutil\/object.h\"\n#include \"iengine\/material.h\"\n#include \"ivaria\/reporter.h\"\n#include \"iutil\/objreg.h\"\n#include \"iutil\/eventh.h\"\n#include \"iutil\/comp.h\"\n#include \"imap\/services.h\"\n\nCS_IMPLEMENT_PLUGIN\n\nCS_TOKEN_DEF_START\n  CS_TOKEN_DEF (BOX)\n  CS_TOKEN_DEF (COLOR)\n  CS_TOKEN_DEF (MAXCOLOR)\n  CS_TOKEN_DEF (DENSITY)\n  CS_TOKEN_DEF (MAXDISTANCE)\n  CS_TOKEN_DEF (FACTORY)\nCS_TOKEN_DEF_END\n\nSCF_IMPLEMENT_IBASE (csStarFactoryLoader)\n  SCF_IMPLEMENTS_INTERFACE (iLoaderPlugin)\n  SCF_IMPLEMENTS_EMBEDDED_INTERFACE (iComponent)\nSCF_IMPLEMENT_IBASE_END\n\nSCF_IMPLEMENT_EMBEDDED_IBASE (csStarFactoryLoader::eiComponent)\n  SCF_IMPLEMENTS_INTERFACE (iComponent)\nSCF_IMPLEMENT_EMBEDDED_IBASE_END\n\nSCF_IMPLEMENT_IBASE (csStarFactorySaver)\n  SCF_IMPLEMENTS_INTERFACE (iSaverPlugin)\n  SCF_IMPLEMENTS_EMBEDDED_INTERFACE (iComponent)\nSCF_IMPLEMENT_IBASE_END\n\nSCF_IMPLEMENT_EMBEDDED_IBASE (csStarFactorySaver::eiComponent)\n  SCF_IMPLEMENTS_INTERFACE (iComponent)\nSCF_IMPLEMENT_EMBEDDED_IBASE_END\n\nSCF_IMPLEMENT_IBASE (csStarLoader)\n  SCF_IMPLEMENTS_INTERFACE (iLoaderPlugin)\n  SCF_IMPLEMENTS_EMBEDDED_INTERFACE (iComponent)\nSCF_IMPLEMENT_IBASE_END\n\nSCF_IMPLEMENT_EMBEDDED_IBASE (csStarLoader::eiComponent)\n  SCF_IMPLEMENTS_INTERFACE (iComponent)\nSCF_IMPLEMENT_EMBEDDED_IBASE_END\n\nSCF_IMPLEMENT_IBASE (csStarSaver)\n  SCF_IMPLEMENTS_INTERFACE (iSaverPlugin)\n  SCF_IMPLEMENTS_EMBEDDED_INTERFACE (iComponent)\nSCF_IMPLEMENT_IBASE_END\n\nSCF_IMPLEMENT_EMBEDDED_IBASE (csStarSaver::eiComponent)\n  SCF_IMPLEMENTS_INTERFACE (iComponent)\nSCF_IMPLEMENT_EMBEDDED_IBASE_END\n\nSCF_IMPLEMENT_FACTORY (csStarFactoryLoader)\nSCF_IMPLEMENT_FACTORY (csStarFactorySaver)\nSCF_IMPLEMENT_FACTORY (csStarLoader)\nSCF_IMPLEMENT_FACTORY (csStarSaver)\n\nSCF_EXPORT_CLASS_TABLE (starldr)\n  SCF_EXPORT_CLASS (csStarFactoryLoader,\n    \"crystalspace.mesh.loader.factory.stars\",\n    \"Crystal Space Star Factory Loader\")\n  SCF_EXPORT_CLASS (csStarFactorySaver, \"crystalspace.mesh.saver.factory.stars\",\n    \"Crystal Space Star Factory Saver\")\n  SCF_EXPORT_CLASS (csStarLoader, \"crystalspace.mesh.loader.stars\",\n\t\t    \"Crystal Space Star Mesh Loader\")\n  SCF_EXPORT_CLASS (csStarSaver, \"crystalspace.mesh.saver.stars\",\n    \"Crystal Space Star Mesh Saver\")\nSCF_EXPORT_CLASS_TABLE_END\n\nstatic void ReportError (iReporter* reporter, const char* id,\n\tconst char* description, ...)\n{\n  va_list arg;\n  va_start (arg, description);\n\n  if (reporter)\n  {\n    reporter->ReportV (CS_REPORTER_SEVERITY_ERROR, id, description, arg);\n  }\n  else\n  {\n    char buf[1024];\n    vsprintf (buf, description, arg);\n    csPrintf (\"Error ID: %s\\n\", id);\n    csPrintf (\"Description: %s\\n\", buf);\n  }\n  va_end (arg);\n}\n\ncsStarFactoryLoader::csStarFactoryLoader (iBase* pParent)\n{\n  SCF_CONSTRUCT_IBASE (pParent);\n  SCF_CONSTRUCT_EMBEDDED_IBASE(scfiComponent);\n  reporter = NULL;\n  plugin_mgr = NULL;\n}\n\ncsStarFactoryLoader::~csStarFactoryLoader ()\n{\n  if (reporter) reporter->DecRef ();\n  if (plugin_mgr) plugin_mgr->DecRef ();\n}\n\nbool csStarFactoryLoader::Initialize (iObjectRegistry* object_reg)\n{\n  csStarFactoryLoader::object_reg = object_reg;\n  plugin_mgr = CS_QUERY_REGISTRY (object_reg, iPluginManager);\n  reporter = CS_QUERY_REGISTRY (object_reg, iReporter);\n  return true;\n}\n\niBase* csStarFactoryLoader::Parse (const char* \/*string*\/,\n\tiMaterialList*, iMeshFactoryList*, iBase* \/* context *\/)\n{\n  iMeshObjectType* type = CS_QUERY_PLUGIN_CLASS (plugin_mgr,\n  \t\"crystalspace.mesh.object.stars\", iMeshObjectType);\n  if (!type)\n  {\n    type = CS_LOAD_PLUGIN (plugin_mgr, \"crystalspace.mesh.object.stars\",\n    \tiMeshObjectType);\n  }\n  if (!type)\n  {\n    ReportError (reporter,\n\t\t\"crystalspace.starfactoryloader.setup.objecttype\",\n\t\t\"Could not load the stars mesh object plugin!\");\n    return NULL;\n  }\n  iMeshObjectFactory* fact = type->NewFactory ();\n  type->DecRef ();\n  return fact;\n}\n\n\/\/---------------------------------------------------------------------------\n\ncsStarFactorySaver::csStarFactorySaver (iBase* pParent)\n{\n  SCF_CONSTRUCT_IBASE (pParent);\n  SCF_CONSTRUCT_EMBEDDED_IBASE(scfiComponent);\n  reporter = NULL;\n  plugin_mgr = NULL;\n}\n\ncsStarFactorySaver::~csStarFactorySaver ()\n{\n  if (reporter) reporter->DecRef ();\n  if (plugin_mgr) plugin_mgr->DecRef ();\n}\n\nbool csStarFactorySaver::Initialize (iObjectRegistry* object_reg)\n{\n  csStarFactorySaver::object_reg = object_reg;\n  plugin_mgr = CS_QUERY_REGISTRY (object_reg, iPluginManager);\n  reporter = CS_QUERY_REGISTRY (object_reg, iReporter);\n  return true;\n}\n\n#define MAXLINE 100 \/* max number of chars per line... *\/\n\nvoid csStarFactorySaver::WriteDown (iBase* \/*obj*\/, iStrVector * \/*str*\/)\n{\n  \/\/ no params\n}\n\n\/\/---------------------------------------------------------------------------\n\ncsStarLoader::csStarLoader (iBase* pParent)\n{\n  SCF_CONSTRUCT_IBASE (pParent);\n  SCF_CONSTRUCT_EMBEDDED_IBASE(scfiComponent);\n  reporter = NULL;\n  synldr = NULL;\n  plugin_mgr = NULL;\n}\n\ncsStarLoader::~csStarLoader ()\n{\n  SCF_DEC_REF (reporter);\n  SCF_DEC_REF (synldr);\n  SCF_DEC_REF (plugin_mgr);\n}\n\nbool csStarLoader::Initialize (iObjectRegistry* object_reg)\n{\n  csStarLoader::object_reg = object_reg;\n  plugin_mgr = CS_QUERY_REGISTRY (object_reg, iPluginManager);\n  reporter = CS_QUERY_REGISTRY (object_reg, iReporter);\n  synldr = CS_QUERY_REGISTRY (object_reg, iSyntaxService);\n  if (!synldr)\n  {\n    synldr = CS_LOAD_PLUGIN (plugin_mgr,\n    \t\"crystalspace.syntax.loader.service.text\", iSyntaxService);\n    if (!synldr)\n    {\n      ReportError (reporter,\n\t\"crystalspace.starloader.parse.initialize\",\n\t\"Could not load the syntax services!\");\n      return false;\n    }\n    if (!object_reg->Register (synldr, \"iSyntaxService\"))\n    {\n      ReportError (reporter,\n\t\"crystalspace.starloader.parse.initialize\",\n\t\"Could not register the syntax services!\");\n      return false;\n    }\n  }\n  return true;\n}\n\niBase* csStarLoader::Parse (const char* string, iMaterialList* matlist,\n\tiMeshFactoryList* factlist,\n\tiBase*)\n{\n  CS_TOKEN_TABLE_START (commands)\n    CS_TOKEN_TABLE (BOX)\n    CS_TOKEN_TABLE (COLOR)\n    CS_TOKEN_TABLE (MAXCOLOR)\n    CS_TOKEN_TABLE (DENSITY)\n    CS_TOKEN_TABLE (MAXDISTANCE)\n    CS_TOKEN_TABLE (FACTORY)\n  CS_TOKEN_TABLE_END\n\n  char* name;\n  long cmd;\n  char* params;\n  char str[255];\n\n  iMeshObject* mesh = NULL;\n  iStarsState* starstate = NULL;\n\n  char* buf = (char*)string;\n  while ((cmd = csGetObject (&buf, commands, &name, &params)) > 0)\n  {\n    if (!params)\n    {\n      ReportError (reporter,\n\t\t\"crystalspace.starloader.parse.badformat\",\n\t\t\"Bad format while parsing star object!\");\n      if (starstate) starstate->DecRef ();\n      return NULL;\n    }\n    switch (cmd)\n    {\n      case CS_TOKEN_BOX:\n\t{\n\t  csVector3 v1, v2;\n\t  csScanStr (params, \"%f,%f,%f,%f,%f,%f\",\n\t    &v1.x, &v1.y, &v1.z,\n\t    &v2.x, &v2.y, &v2.z);\n\t  starstate->SetBox (csBox3 (v1, v2));\n\t}\n\tbreak;\n      case CS_TOKEN_COLOR:\n\t{\n\t  csColor col;\n\t  csScanStr (params, \"%f,%f,%f\", &col.red, &col.green, &col.blue);\n\t  starstate->SetColor (col);\n\t}\n\tbreak;\n      case CS_TOKEN_MAXCOLOR:\n\t{\n\t  csColor col;\n\t  csScanStr (params, \"%f,%f,%f\", &col.red, &col.green, &col.blue);\n\t  starstate->SetMaxColor (col);\n\t}\n\tbreak;\n      case CS_TOKEN_DENSITY:\n\t{\n\t  float d;\n\t  csScanStr (params, \"%f\", &d);\n\t  starstate->SetDensity (d);\n\t}\n\tbreak;\n      case CS_TOKEN_MAXDISTANCE:\n\t{\n\t  float d;\n\t  csScanStr (params, \"%f\", &d);\n\t  starstate->SetMaxDistance (d);\n\t}\n\tbreak;\n      case CS_TOKEN_FACTORY:\n\t{\n          csScanStr (params, \"%s\", str);\n\t  iMeshFactoryWrapper* fact = factlist->FindByName (str);\n\t  if (!fact)\n\t  {\n      \t    ReportError (reporter,\n\t\t\"crystalspace.starloader.parse.unknownfactory\",\n\t\t\"Couldn't find factory '%s'!\", str);\n\t    if (starstate) starstate->DecRef ();\n\t    return NULL;\n\t  }\n\t  mesh = fact->GetMeshObjectFactory ()->NewInstance ();\n          starstate = SCF_QUERY_INTERFACE (mesh, iStarsState);\n\t}\n\tbreak;\n    }\n  }\n\n  if (starstate) starstate->DecRef ();\n  return mesh;\n}\n\n\/\/---------------------------------------------------------------------------\n\ncsStarSaver::csStarSaver (iBase* pParent)\n{\n  SCF_CONSTRUCT_IBASE (pParent);\n  SCF_CONSTRUCT_EMBEDDED_IBASE(scfiComponent);\n  reporter = NULL;\n  synldr = NULL;\n  plugin_mgr = NULL;\n}\n\ncsStarSaver::~csStarSaver ()\n{\n  SCF_DEC_REF (reporter);\n  SCF_DEC_REF (synldr);\n  SCF_DEC_REF (plugin_mgr);\n}\n\nbool csStarSaver::Initialize (iObjectRegistry* object_reg)\n{\n  csStarSaver::object_reg = object_reg;\n  plugin_mgr = CS_QUERY_REGISTRY (object_reg, iPluginManager);\n  reporter = CS_QUERY_REGISTRY (object_reg, iReporter);\n  synldr = CS_QUERY_REGISTRY (object_reg, iSyntaxService);\n  if (!synldr)\n  {\n    synldr = CS_LOAD_PLUGIN (plugin_mgr,\n    \t\"crystalspace.syntax.loader.service.text\", iSyntaxService);\n    if (!synldr)\n    {\n      ReportError (reporter,\n\t\"crystalspace.starsaver.parse.initialize\",\n\t\"Could not load the syntax services!\");\n      return false;\n    }\n    if (!object_reg->Register (synldr, \"iSyntaxService\"))\n    {\n      ReportError (reporter,\n\t\"crystalspace.starsaver.parse.initialize\",\n\t\"Could not register the syntax services!\");\n      return false;\n    }\n  }\n  return true;\n}\n\nvoid csStarSaver::WriteDown (iBase* \/*obj*\/, iStrVector* \/*str*\/)\n{\n  \/\/ @@@ Not implemented yet.\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*********************************************************************\n* Software License Agreement (BSD License)\n* \n*  Copyright (c) 2008, Willow Garage, Inc.\n*  All rights reserved.\n* \n*  Redistribution and use in source and binary forms, with or without\n*  modification, are permitted provided that the following conditions\n*  are met:\n* \n*   * Redistributions of source code must retain the above copyright\n*     notice, this list of conditions and the following disclaimer.\n*   * Redistributions in binary form must reproduce the above\n*     copyright notice, this list of conditions and the following\n*     disclaimer in the documentation and\/or other materials provided\n*     with the distribution.\n*   * Neither the name of the Willow Garage nor the names of its\n*     contributors may be used to endorse or promote products derived\n*     from this software without specific prior written permission.\n* \n*  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n*  \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n*  LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n*  FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n*  COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n*  INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n*  BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n*  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n*  CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n*  LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n*  ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n*  POSSIBILITY OF SUCH DAMAGE.\n*********************************************************************\/\n\n\/* \\author Ioan Sucan *\/\n\n#include \"ompl\/extension\/kinematic\/extension\/kpiece\/KPIECE1.h\"\n\nbool ompl::kinematic::KPIECE1::solve(double solveTime)\n{\n    SpaceInformationKinematic *si = dynamic_cast<SpaceInformationKinematic*>(m_si); \n    base::GoalRegion      *goal_r = dynamic_cast<base::GoalRegion*>(si->getGoal());\n    GoalRegionKinematic   *goal_k = dynamic_cast<GoalRegionKinematic*>(si->getGoal());\n    base::GoalState       *goal_s = dynamic_cast<base::GoalState*>(si->getGoal());\n    unsigned int              dim = si->getStateDimension();\n    \n    if (!goal_s && !goal_r)\n    {\n\tm_msg.error(\"KPIECE1: Unknown type of goal (or goal undefined)\");\n\treturn false;\n    }\n    \n    time_utils::Time endTime = time_utils::Time::now() + time_utils::Duration(solveTime);\n\n    if (m_tree.grid.size() == 0)\n    {\n\tfor (unsigned int i = 0 ; i < m_si->getStartStateCount() ; ++i)\n\t{\n\t    Motion *motion = new Motion(dim);\n\t    si->copyState(motion->state, si->getStartState(i));\n\t    if (si->satisfiesBounds(motion->state) && si->isValid(motion->state))\n\t\taddMotion(motion, 1.0);\n\t    else\n\t    {\n\t\tm_msg.error(\"KPIECE1: Initial state is invalid!\");\n\t\tdelete motion;\n\t    }\t\n\t}\n    }\n    \n    if (m_tree.grid.size() == 0)\n    {\n\tm_msg.error(\"KPIECE1: There are no valid initial states!\");\n\treturn false;\t\n    }    \n\n    m_msg.inform(\"KPIECE1: Starting with %u states\", m_tree.size);\n    \n    std::vector<double> range(dim);\n    for (unsigned int i = 0 ; i < dim ; ++i)\n\trange[i] = m_rho * (si->getStateComponent(i).maxValue - si->getStateComponent(i).minValue);\n    \n    Motion *solution  = NULL;\n    Motion *approxsol = NULL;\n    double  approxdif = INFINITY;\n    base::State *xstate = new base::State(dim);\n\n    double improveValue = 0.01;\n\n    while (time_utils::Time::now() < endTime)\n    {\n\tm_tree.iteration++;\n\tif (m_tree.iteration %10 == 0)\n\t  m_msg.inform(\"KPIECE1: iteration %u\", m_tree.iteration);\n\n\t\/* Decide on a state to expand from *\/\n\tMotion     *existing = NULL;\n\tGrid::Cell *ecell = NULL;\n\tselectMotion(existing, ecell);\n\tassert(existing);\n\t\n\t\/* sample random state (with goal biasing) *\/\n\tif (m_rng.uniform(0.0, 1.0) < m_goalBias)\n\t{\n\t    if (goal_s)\n\t\tsi->copyState(xstate, goal_s->state);\n\t    else\n\t\tif (goal_k)\n\t\t    goal_k->sampleNearGoal(xstate);\n\t\telse\n\t\t{\n\t\t    if (approxsol)\n\t\t    {\n\t\t\tsi->copyState(xstate, approxsol->state);\n\t\t\tif (!m_hcik.tryToImprove(xstate, improveValue))\n\t\t\t{\n\t\t\t    m_sCore.sampleNear(xstate, existing->state, range);\n\t\t\t    improveValue \/= 2.0;\n\t\t\t}\n\t\t    }\n\t\t    else\n\t\t\tm_sCore.sampleNear(xstate, existing->state, range);\n\t\t}\n\t}\n\telse\n\t    m_sCore.sampleNear(xstate, existing->state, range);\n\t\n\tdouble failTime = 0.0;\n\tbool keep = si->checkMotionIncremental(existing->state, xstate, xstate, &failTime);\n\tif (!keep && failTime > m_minValidPathPercentage)\n\t    keep = true;\n\t\n\tif (keep)\n\t{\n\t    \/* create a motion *\/\n\t    Motion *motion = new Motion(dim);\n\t    si->copyState(motion->state, xstate);\n\t    motion->parent = existing;\n\n\t    double dist = 0.0;\n\t    bool solved = goal_r->isSatisfied(motion->state, &dist);\n\t    addMotion(motion, dist);\n\t    \n\t    if (solved)\n\t    {\n\t\tapproxdif = dist;\n\t\tsolution = motion;    \n\t\tbreak;\n\t    }\n\t    if (dist < approxdif)\n\t    {\n\t\tapproxdif = dist;\n\t\tapproxsol = motion;\n\t    }\n\t    ecell->data->score *= m_goodScoreFactor;\n\t}\n\telse\n\t    ecell->data->score *= m_badScoreFactor;\n\t\n\tm_tree.grid.update(ecell);\n    }\n    m_msg.inform(\"KPIECE1: done time\");    \n    bool approximate = false;\n    if (solution == NULL)\n    {\t\n\tsolution = approxsol;\n\tapproximate = true;\n    }\n    \n    if (solution != NULL)\n    {\n\n      m_msg.inform(\"KPIECE1: build path\");    \n\n\t\/* construct the solution path *\/\n\tstd::vector<Motion*> mpath;\n\twhile (solution != NULL)\n\t{\n\t    mpath.push_back(solution);\n\t    solution = solution->parent;\n\t}\n\n\t\/* set the solution path *\/\n\tPathKinematic *path = new PathKinematic(m_si);\n   \tfor (int i = mpath.size() - 1 ; i >= 0 ; --i)\n\t{   \n\t    base::State *st = new base::State(dim);\n\t    si->copyState(st, mpath[i]->state);\n\t    path->states.push_back(st);\n\t}\n\tgoal_r->setDifference(approxdif);\n\tgoal_r->setSolutionPath(path, approximate);\n\n\tif (approximate)\n\t    m_msg.warn(\"KPIECE1: Found approximate solution\");\n    }\n\n    delete xstate;\n    \n    m_msg.inform(\"KPIECE1: Created %u states in %u cells (%u internal + %u external)\", m_tree.size, m_tree.grid.size(),\n\t\t m_tree.grid.countInternal(), m_tree.grid.countExternal());\n    \n    return goal_r->isAchieved();\n}\n\nbool ompl::kinematic::KPIECE1::selectMotion(Motion* &smotion, Grid::Cell* &scell)\n{\n    scell = m_rng.uniform() < std::max(m_selectBorderPercentage, m_tree.grid.fracExternal()) ?\n\tm_tree.grid.topExternal() : m_tree.grid.topInternal();\n    if (scell && !scell->data->motions.empty())\n    {\n\tscell->data->selections++;\n\tsmotion = scell->data->motions[m_rng.halfNormalInt(0, scell->data->motions.size() - 1)];\n\treturn true;\n    }\n    else\n\treturn false;\n}\n\nunsigned int ompl::kinematic::KPIECE1::addMotion(Motion *motion, double dist)\n{\n    Grid::Coord coord;\n    m_projectionEvaluator->computeCoordinates(motion->state, coord);\n    Grid::Cell* cell = m_tree.grid.getCell(coord);\n    unsigned int created = 0;\n    if (cell)\n    {\n\tcell->data->motions.push_back(motion);\n\tcell->data->coverage += 1.0;\n\tm_tree.grid.update(cell);\n    }\n    else\n    {\n\tcell = m_tree.grid.createCell(coord);\n\tcell->data = new CellData();\n\tcell->data->motions.push_back(motion);\n\tcell->data->coverage = 1.0;\n\tcell->data->iteration = m_tree.iteration;\n\tcell->data->selections = 1;\n\tcell->data->score = 1.0 \/ (1e-3 + dist);\n\tm_tree.grid.add(cell);\n\tcreated = 1;\n    }\n    m_tree.size++;\n    return created;\n}\n\nvoid ompl::kinematic::KPIECE1::getStates(std::vector<const base::State*> &states) const\n{\n    states.resize(0);\n    states.reserve(m_tree.size);\n    \n    std::vector<CellData*> cdata;\n    m_tree.grid.getContent(cdata);\n    for (unsigned int i = 0 ; i < cdata.size() ; ++i)\n\tfor (unsigned int j = 0 ; j < cdata[i]->motions.size() ; ++j)\n\t    states.push_back(cdata[i]->motions[j]->state); \n}\n<commit_msg>removing accidental commit<commit_after>\/*********************************************************************\n* Software License Agreement (BSD License)\n* \n*  Copyright (c) 2008, Willow Garage, Inc.\n*  All rights reserved.\n* \n*  Redistribution and use in source and binary forms, with or without\n*  modification, are permitted provided that the following conditions\n*  are met:\n* \n*   * Redistributions of source code must retain the above copyright\n*     notice, this list of conditions and the following disclaimer.\n*   * Redistributions in binary form must reproduce the above\n*     copyright notice, this list of conditions and the following\n*     disclaimer in the documentation and\/or other materials provided\n*     with the distribution.\n*   * Neither the name of the Willow Garage nor the names of its\n*     contributors may be used to endorse or promote products derived\n*     from this software without specific prior written permission.\n* \n*  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n*  \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n*  LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n*  FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n*  COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n*  INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n*  BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n*  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n*  CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n*  LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n*  ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n*  POSSIBILITY OF SUCH DAMAGE.\n*********************************************************************\/\n\n\/* \\author Ioan Sucan *\/\n\n#include \"ompl\/extension\/kinematic\/extension\/kpiece\/KPIECE1.h\"\n\nbool ompl::kinematic::KPIECE1::solve(double solveTime)\n{\n    SpaceInformationKinematic *si = dynamic_cast<SpaceInformationKinematic*>(m_si); \n    base::GoalRegion      *goal_r = dynamic_cast<base::GoalRegion*>(si->getGoal());\n    GoalRegionKinematic   *goal_k = dynamic_cast<GoalRegionKinematic*>(si->getGoal());\n    base::GoalState       *goal_s = dynamic_cast<base::GoalState*>(si->getGoal());\n    unsigned int              dim = si->getStateDimension();\n    \n    if (!goal_s && !goal_r)\n    {\n\tm_msg.error(\"KPIECE1: Unknown type of goal (or goal undefined)\");\n\treturn false;\n    }\n    \n    time_utils::Time endTime = time_utils::Time::now() + time_utils::Duration(solveTime);\n\n    if (m_tree.grid.size() == 0)\n    {\n\tfor (unsigned int i = 0 ; i < m_si->getStartStateCount() ; ++i)\n\t{\n\t    Motion *motion = new Motion(dim);\n\t    si->copyState(motion->state, si->getStartState(i));\n\t    if (si->satisfiesBounds(motion->state) && si->isValid(motion->state))\n\t\taddMotion(motion, 1.0);\n\t    else\n\t    {\n\t\tm_msg.error(\"KPIECE1: Initial state is invalid!\");\n\t\tdelete motion;\n\t    }\t\n\t}\n    }\n    \n    if (m_tree.grid.size() == 0)\n    {\n\tm_msg.error(\"KPIECE1: There are no valid initial states!\");\n\treturn false;\t\n    }    \n\n    m_msg.inform(\"KPIECE1: Starting with %u states\", m_tree.size);\n    \n    std::vector<double> range(dim);\n    for (unsigned int i = 0 ; i < dim ; ++i)\n\trange[i] = m_rho * (si->getStateComponent(i).maxValue - si->getStateComponent(i).minValue);\n    \n    Motion *solution  = NULL;\n    Motion *approxsol = NULL;\n    double  approxdif = INFINITY;\n    base::State *xstate = new base::State(dim);\n\n    double improveValue = 0.01;\n\n    while (time_utils::Time::now() < endTime)\n    {\n\tm_tree.iteration++;\n\t\n\t\/* Decide on a state to expand from *\/\n\tMotion     *existing = NULL;\n\tGrid::Cell *ecell = NULL;\n\tselectMotion(existing, ecell);\n\tassert(existing);\n\t\n\t\/* sample random state (with goal biasing) *\/\n\tif (m_rng.uniform(0.0, 1.0) < m_goalBias)\n\t{\n\t    if (goal_s)\n\t\tsi->copyState(xstate, goal_s->state);\n\t    else\n\t\tif (goal_k)\n\t\t    goal_k->sampleNearGoal(xstate);\n\t\telse\n\t\t{\n\t\t    if (approxsol)\n\t\t    {\n\t\t\tsi->copyState(xstate, approxsol->state);\n\t\t\tif (!m_hcik.tryToImprove(xstate, improveValue))\n\t\t\t{\n\t\t\t    m_sCore.sampleNear(xstate, existing->state, range);\n\t\t\t    improveValue \/= 2.0;\n\t\t\t}\n\t\t    }\n\t\t    else\n\t\t\tm_sCore.sampleNear(xstate, existing->state, range);\n\t\t}\n\t}\n\telse\n\t    m_sCore.sampleNear(xstate, existing->state, range);\n\t\n\tdouble failTime = 0.0;\n\tbool keep = si->checkMotionIncremental(existing->state, xstate, xstate, &failTime);\n\tif (!keep && failTime > m_minValidPathPercentage)\n\t    keep = true;\n\t\n\tif (keep)\n\t{\n\t    \/* create a motion *\/\n\t    Motion *motion = new Motion(dim);\n\t    si->copyState(motion->state, xstate);\n\t    motion->parent = existing;\n\n\t    double dist = 0.0;\n\t    bool solved = goal_r->isSatisfied(motion->state, &dist);\n\t    addMotion(motion, dist);\n\t    \n\t    if (solved)\n\t    {\n\t\tapproxdif = dist;\n\t\tsolution = motion;    \n\t\tbreak;\n\t    }\n\t    if (dist < approxdif)\n\t    {\n\t\tapproxdif = dist;\n\t\tapproxsol = motion;\n\t    }\n\t    ecell->data->score *= m_goodScoreFactor;\n\t}\n\telse\n\t    ecell->data->score *= m_badScoreFactor;\n\t\n\tm_tree.grid.update(ecell);\n    }\n    \n    bool approximate = false;\n    if (solution == NULL)\n    {\t\n\tsolution = approxsol;\n\tapproximate = true;\n    }\n    \n    if (solution != NULL)\n    {\n\t\/* construct the solution path *\/\n\tstd::vector<Motion*> mpath;\n\twhile (solution != NULL)\n\t{\n\t    mpath.push_back(solution);\n\t    solution = solution->parent;\n\t}\n\n\t\/* set the solution path *\/\n\tPathKinematic *path = new PathKinematic(m_si);\n   \tfor (int i = mpath.size() - 1 ; i >= 0 ; --i)\n\t{   \n\t    base::State *st = new base::State(dim);\n\t    si->copyState(st, mpath[i]->state);\n\t    path->states.push_back(st);\n\t}\n\tgoal_r->setDifference(approxdif);\n\tgoal_r->setSolutionPath(path, approximate);\n\n\tif (approximate)\n\t    m_msg.warn(\"KPIECE1: Found approximate solution\");\n    }\n\n    delete xstate;\n    \n    m_msg.inform(\"KPIECE1: Created %u states in %u cells (%u internal + %u external)\", m_tree.size, m_tree.grid.size(),\n\t\t m_tree.grid.countInternal(), m_tree.grid.countExternal());\n    \n    return goal_r->isAchieved();\n}\n\nbool ompl::kinematic::KPIECE1::selectMotion(Motion* &smotion, Grid::Cell* &scell)\n{\n    scell = m_rng.uniform() < std::max(m_selectBorderPercentage, m_tree.grid.fracExternal()) ?\n\tm_tree.grid.topExternal() : m_tree.grid.topInternal();\n    if (scell && !scell->data->motions.empty())\n    {\n\tscell->data->selections++;\n\tsmotion = scell->data->motions[m_rng.halfNormalInt(0, scell->data->motions.size() - 1)];\n\treturn true;\n    }\n    else\n\treturn false;\n}\n\nunsigned int ompl::kinematic::KPIECE1::addMotion(Motion *motion, double dist)\n{\n    Grid::Coord coord;\n    m_projectionEvaluator->computeCoordinates(motion->state, coord);\n    Grid::Cell* cell = m_tree.grid.getCell(coord);\n    unsigned int created = 0;\n    if (cell)\n    {\n\tcell->data->motions.push_back(motion);\n\tcell->data->coverage += 1.0;\n\tm_tree.grid.update(cell);\n    }\n    else\n    {\n\tcell = m_tree.grid.createCell(coord);\n\tcell->data = new CellData();\n\tcell->data->motions.push_back(motion);\n\tcell->data->coverage = 1.0;\n\tcell->data->iteration = m_tree.iteration;\n\tcell->data->selections = 1;\n\tcell->data->score = 1.0 \/ (1e-3 + dist);\n\tm_tree.grid.add(cell);\n\tcreated = 1;\n    }\n    m_tree.size++;\n    return created;\n}\n\nvoid ompl::kinematic::KPIECE1::getStates(std::vector<const base::State*> &states) const\n{\n    states.resize(0);\n    states.reserve(m_tree.size);\n    \n    std::vector<CellData*> cdata;\n    m_tree.grid.getContent(cdata);\n    for (unsigned int i = 0 ; i < cdata.size() ; ++i)\n\tfor (unsigned int j = 0 ; j < cdata[i]->motions.size() ; ++j)\n\t    states.push_back(cdata[i]->motions[j]->state); \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#include \"mitkSetRegionTool.h\"\n\n#include \"mitkToolManager.h\"\n#include \"mitkOverwriteSliceImageFilter.h\"\n\n#include \"ipSegmentation.h\"\n\n#include \"mitkBaseRenderer.h\"\n\nmitk::SetRegionTool::SetRegionTool(int paintingPixelValue)\n:SegTool2D(\"PressMoveReleaseWithCTRLInversion\"),\n m_PaintingPixelValue(paintingPixelValue),\n m_FillContour(false),\n m_StatusFillWholeSlice(false)\n{\n}\n\nmitk::SetRegionTool::~SetRegionTool()\n{\n}\n\nvoid mitk::SetRegionTool::Activated()\n{\n  Superclass::Activated();\n}\n\nvoid mitk::SetRegionTool::Deactivated()\n{\n  Superclass::Deactivated();\n}\n\nbool mitk::SetRegionTool::OnMousePressed (Action* action, const StateEvent* stateEvent)\n{\n  if (!SegTool2D::OnMousePressed( action, stateEvent )) return false;\n\n  const PositionEvent* positionEvent = dynamic_cast<const PositionEvent*>(stateEvent->GetEvent());\n  if (!positionEvent) return false;\n\n  \/\/ 1. Get the working image\n  Image::Pointer workingSlice   = SegTool2D::GetAffectedWorkingSlice( positionEvent );\n  if ( workingSlice.IsNull() ) return false; \/\/ can't do anything without the segmentation\n \n  \/\/ if click was outside the image, don't continue\n  const Geometry3D* sliceGeometry = workingSlice->GetGeometry();\n  itk::Index<2> projectedPointIn2D;\n  sliceGeometry->WorldToIndex( positionEvent->GetWorldPosition(), projectedPointIn2D );\n  if ( !sliceGeometry->IsIndexInside( projectedPointIn2D ) )\n  {\n    std::cout << \"point apparently not inside segmentation slice\" << std::endl;\n    return false; \/\/ can't use that as a seed point\n  }\n\n    \/\/ Convert to ipMITKSegmentationTYPE (because ipMITKSegmentationGetContour8N relys on that data type)\n    itk::Image< ipMITKSegmentationTYPE, 2 >::Pointer correctPixelTypeImage;\n    CastToItkImage( workingSlice, correctPixelTypeImage );\n    assert (correctPixelTypeImage.IsNotNull() );\n\n  \/\/ possible bug in CastToItkImage ?\n  \/\/ direction maxtrix is wrong\/broken\/not working after CastToItkImage, leading to a failed assertion in\n  \/\/ mitk\/Core\/DataStructures\/mitkSlicedGeometry3D.cpp, 479:\n  \/\/ virtual void mitk::SlicedGeometry3D::SetSpacing(const mitk::Vector3D&): Assertion `aSpacing[0]>0 && aSpacing[1]>0 && aSpacing[2]>0' failed\n  \/\/ solution here: we overwrite it with an unity matrix\n  itk::Image< ipMITKSegmentationTYPE, 2 >::DirectionType imageDirection;\n  imageDirection.SetIdentity();\n  correctPixelTypeImage->SetDirection(imageDirection);\n\n    Image::Pointer temporarySlice = Image::New();\n  \/\/  temporarySlice = ImportItkImage( correctPixelTypeImage );\n    CastToMitkImage( correctPixelTypeImage, temporarySlice );\n\n\n  \/\/ check index positions\n  ipPicDescriptor* originalPicSlice = temporarySlice->GetSliceData()->GetPicDescriptor();\n \n  int m_SeedPointMemoryOffset = projectedPointIn2D[1] * originalPicSlice->n[0] + projectedPointIn2D[0];\n\n  if ( m_SeedPointMemoryOffset >= static_cast<int>( originalPicSlice->n[0] * originalPicSlice->n[1] ) ||\n       m_SeedPointMemoryOffset < 0 )\n  {\n    std::cerr << \"Memory offset calculation if mitk::SetRegionTool has some serious flaw! Aborting..\" << std::endl;\n    return false;\n  }\n  \n  \/\/ 2. Determine the contour that surronds the selected \"piece of the image\"\n  \n  \/\/ find a contour seed point\n  unsigned int oneContourOffset = static_cast<unsigned int>( m_SeedPointMemoryOffset ); \/\/ safe because of earlier check if m_SeedPointMemoryOffset < 0\n\n  \/** \n    * The logic of finding a starting point for the contour is the following:\n    * \n    *  - If the initial seed point is 0, we are either inside a hole or outside of every segmentation.\n    *    We move to the right until we hit a 1, which must be part of a contour. \n    *\n    *  - If the initial seed point is 1, then ...\n    *    we now do the same (running to the right) until we hit a 1\n    *\n    *  In both cases the found contour point is used to extract a contour and\n    *  then a test is applied to find out if the initial seed point is contained\n    *  in the contour. If this is the case, filling should be applied, otherwise\n    *  nothing is done.\n    *\/\n  unsigned int size = originalPicSlice->n[0] * originalPicSlice->n[1];\n\/*\n  unsigned int rowSize = originalPicSlice->n[0];\n*\/\n  ipMITKSegmentationTYPE* data = static_cast<ipMITKSegmentationTYPE*>(originalPicSlice->data);\n\n  if ( data[oneContourOffset] == 0 ) \/\/ initial seed 0\n  {\n    for ( ; oneContourOffset < size; ++oneContourOffset )\n    {\n      if ( data[oneContourOffset] > 0 ) break;\n    }\n  }\n  else if ( data[oneContourOffset] == 1 ) \/\/ initial seed 1\n  {\n    unsigned int lastValidPixel = size-1; \/\/ initialization, will be changed lateron\n    bool inSeg = true;    \/\/ inside segmentation?\n    unsigned int lineStart = 0;\n    for ( ; oneContourOffset < size; ++oneContourOffset )\n    {\n      if ( ( data[oneContourOffset] == 0 ) && inSeg ) \/\/ pixel 0 and inside-flag set: this happens at the first pixel outside a filled region\n      {\n        inSeg = false;\n        lineStart = 0;\n        lastValidPixel = oneContourOffset - 1; \/\/ store the last pixel position inside a filled region\n        break;\n      }\n      else \/\/ pixel 1, inside-flag doesn't matter: this happens while we are inside a filled region\n      {\n        inSeg = true; \/\/ first iteration lands here\n        lineStart = 0;\n      }\n      \n    }\n    oneContourOffset = lastValidPixel;\n  }\n  else\n  {\n    std::cerr << \"Fill\/Erase was never intended to work with other than binary images.\" << std::endl;\n    m_FillContour = false;\n    return false;\n  }\n \n  int numberOfContourPoints( 0 );\n  int newBufferSize( 0 );\n  float* contourPoints = ipMITKSegmentationGetContour8N( originalPicSlice, oneContourOffset, numberOfContourPoints, newBufferSize ); \/\/ memory allocated with malloc\n\n  bool cursorInsideContour = ipMITKSegmentationIsInsideContour( contourPoints, numberOfContourPoints, projectedPointIn2D[0], projectedPointIn2D[1]);\n\n  \/\/ decide if contour should be filled or not\n  m_FillContour = cursorInsideContour;\n\n  if (m_FillContour)\n  {\n    \/\/ copy point from float* to mitk::Contour \n    Contour::Pointer contourInImageIndexCoordinates = Contour::New();\n    contourInImageIndexCoordinates->Initialize();\n    Point3D newPoint;\n    for (int index = 0; index < numberOfContourPoints; ++index)\n    {\n      newPoint[0] = contourPoints[ 2 * index + 0 ];\n      newPoint[1] = contourPoints[ 2 * index + 1];\n      newPoint[2] = 0;\n\n      contourInImageIndexCoordinates->AddVertex( newPoint );\n    }\n\n    m_SegmentationContourInWorldCoordinates = SegTool2D::BackProjectContourFrom2DSlice( workingSlice, contourInImageIndexCoordinates, true ); \/\/ true, correct the result from ipMITKSegmentationGetContour8N\n\n    \/\/ 3. Show the contour\n    SegTool2D::SetFeedbackContour( *m_SegmentationContourInWorldCoordinates );\n    \n    SegTool2D::SetFeedbackContourVisible(true);\n    mitk::RenderingManager::GetInstance()->RequestUpdate(positionEvent->GetSender()->GetRenderWindow());\n  }\n\n  \/\/ always generate a second contour, containing the whole image (used when CTRL is pressed)\n  {\n    \/\/ copy point from float* to mitk::Contour \n    Contour::Pointer contourInImageIndexCoordinates = Contour::New();\n    contourInImageIndexCoordinates->Initialize();\n    Point3D newPoint;\n    newPoint[0] = 0; newPoint[1] = 0; newPoint[2] = 0;\n    contourInImageIndexCoordinates->AddVertex( newPoint );\n    newPoint[0] = originalPicSlice->n[0]; newPoint[1] = 0; newPoint[2] = 0;\n    contourInImageIndexCoordinates->AddVertex( newPoint );\n    newPoint[0] = originalPicSlice->n[0]; newPoint[1] = originalPicSlice->n[1]; newPoint[2] = 0;\n    contourInImageIndexCoordinates->AddVertex( newPoint );\n    newPoint[0] = 0; newPoint[1] = originalPicSlice->n[1]; newPoint[2] = 0;\n    contourInImageIndexCoordinates->AddVertex( newPoint );\n\n    m_WholeImageContourInWorldCoordinates = SegTool2D::BackProjectContourFrom2DSlice( workingSlice, contourInImageIndexCoordinates, true ); \/\/ true, correct the result from ipMITKSegmentationGetContour8N\n\n    \/\/ 3. Show the contour\n    SegTool2D::SetFeedbackContour( *m_SegmentationContourInWorldCoordinates );\n    \n    SegTool2D::SetFeedbackContourVisible(true);\n    mitk::RenderingManager::GetInstance()->RequestUpdate(positionEvent->GetSender()->GetRenderWindow());\n  }\n\n\n  free(contourPoints);\n\n  return true;\n}\n\nbool mitk::SetRegionTool::OnMouseReleased(Action* action, const StateEvent* stateEvent)\n{\n  \/\/ 1. Hide the feedback contour, find out which slice the user clicked, find out which slice of the toolmanager's working image corresponds to that\n  SegTool2D::SetFeedbackContourVisible(false);\n  \n  const PositionEvent* positionEvent = dynamic_cast<const PositionEvent*>(stateEvent->GetEvent());\n  if (!positionEvent) return false;\n\n  assert( positionEvent->GetSender()->GetRenderWindow() );\n  mitk::RenderingManager::GetInstance()->RequestUpdate(positionEvent->GetSender()->GetRenderWindow());\n  \n  if (!m_FillContour && !m_StatusFillWholeSlice) return true;\n  \n  if (!SegTool2D::OnMouseReleased( action, stateEvent )) return false;\n\n  DataTreeNode* workingNode( m_ToolManager->GetWorkingData(0) );\n  if (!workingNode) return false;\n\n  Image* image = dynamic_cast<Image*>(workingNode->GetData());\n  const PlaneGeometry* planeGeometry( dynamic_cast<const PlaneGeometry*> (positionEvent->GetSender()->GetCurrentWorldGeometry2D() ) );\n  if ( !image || !planeGeometry ) return false;\n\n  int affectedDimension( -1 );\n  int affectedSlice( -1 );\n  if ( SegTool2D::DetermineAffectedImageSlice( image, planeGeometry, affectedDimension, affectedSlice ) )\n  {\n    \/\/ 2. Slice is known, now we try to get it as a 2D image and project the contour into index coordinates of this slice\n    Image::Pointer slice = SegTool2D::GetAffectedImageSliceAs2DImage( positionEvent, image );\n\n    if ( slice.IsNull() )\n    {\n      std::cerr << \"Unable to extract slice.\" << std::endl;\n      return false;\n    }\n      \n    Contour* feedbackContour( SegTool2D::GetFeedbackContour() );\n    Contour::Pointer projectedContour = SegTool2D::ProjectContourTo2DSlice( slice, feedbackContour, false, false ); \/\/ false: don't add 0.5 (done by FillContourInSlice)\n                                                                                                                   \/\/ false: don't constrain the contour to the image's inside\n    if (projectedContour.IsNull()) return false;\n\n    SegTool2D::FillContourInSlice( projectedContour, slice, m_PaintingPixelValue );\n\n    \/\/ 5. Write the modified 2D working data slice back into the image\n    OverwriteSliceImageFilter::Pointer slicewriter = OverwriteSliceImageFilter::New();\n    slicewriter->SetInput( image );\n    slicewriter->SetCreateUndoInformation( true );\n    slicewriter->SetSliceImage( slice );\n    slicewriter->SetSliceDimension( affectedDimension );\n    slicewriter->SetSliceIndex( affectedSlice );\n    slicewriter->Update();\n\n    \/\/ 6. Make sure the result is drawn again --> is visible then. \n    assert( positionEvent->GetSender()->GetRenderWindow() );\n    mitk::RenderingManager::GetInstance()->RequestUpdate(positionEvent->GetSender()->GetRenderWindow());\n  }\n  else\n  {\n    std::cout << \"SegTool2D could not determine which slice of the image you are drawing on.\" << std::endl;\n  }\n\n  m_WholeImageContourInWorldCoordinates = NULL;\n  m_SegmentationContourInWorldCoordinates = NULL;\n\n  return true;\n}\n\n\/**\n  Called when the CTRL key is pressed. Will change the painting pixel value from 0 to 1 or from 1 to 0. \n*\/\nbool mitk::SetRegionTool::OnInvertLogic(Action* action, const StateEvent* stateEvent)\n{\n  if (!SegTool2D::OnInvertLogic(action, stateEvent)) return false;\n  \n  const PositionEvent* positionEvent = dynamic_cast<const PositionEvent*>(stateEvent->GetEvent());\n  if (!positionEvent) return false;\n\n  if (m_StatusFillWholeSlice)\n  {\n    \/\/ use contour extracted from image data\n    if (m_SegmentationContourInWorldCoordinates.IsNotNull())\n      SegTool2D::SetFeedbackContour( *m_SegmentationContourInWorldCoordinates );\n    mitk::RenderingManager::GetInstance()->RequestUpdate(positionEvent->GetSender()->GetRenderWindow());\n  } \n  else\n  {\n    \/\/ use some artificial contour\n    if (m_WholeImageContourInWorldCoordinates.IsNotNull())\n      SegTool2D::SetFeedbackContour( *m_WholeImageContourInWorldCoordinates );\n    mitk::RenderingManager::GetInstance()->RequestUpdate(positionEvent->GetSender()->GetRenderWindow());\n  }\n\n  m_StatusFillWholeSlice = !m_StatusFillWholeSlice;\n\n  return true;\n}\n\n<commit_msg>FIX (#1185): Tests for SliceBasedSegmentation crash sometimes<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#include \"mitkSetRegionTool.h\"\n\n#include \"mitkToolManager.h\"\n#include \"mitkOverwriteSliceImageFilter.h\"\n\n#include \"ipSegmentation.h\"\n\n#include \"mitkBaseRenderer.h\"\n\nmitk::SetRegionTool::SetRegionTool(int paintingPixelValue)\n:SegTool2D(\"PressMoveReleaseWithCTRLInversion\"),\n m_PaintingPixelValue(paintingPixelValue),\n m_FillContour(false),\n m_StatusFillWholeSlice(false)\n{\n}\n\nmitk::SetRegionTool::~SetRegionTool()\n{\n}\n\nvoid mitk::SetRegionTool::Activated()\n{\n  Superclass::Activated();\n}\n\nvoid mitk::SetRegionTool::Deactivated()\n{\n  Superclass::Deactivated();\n}\n\nbool mitk::SetRegionTool::OnMousePressed (Action* action, const StateEvent* stateEvent)\n{\n  if (!SegTool2D::OnMousePressed( action, stateEvent )) return false;\n\n  const PositionEvent* positionEvent = dynamic_cast<const PositionEvent*>(stateEvent->GetEvent());\n  if (!positionEvent) return false;\n\n  \/\/ 1. Get the working image\n  Image::Pointer workingSlice   = SegTool2D::GetAffectedWorkingSlice( positionEvent );\n  if ( workingSlice.IsNull() ) return false; \/\/ can't do anything without the segmentation\n \n  \/\/ if click was outside the image, don't continue\n  const Geometry3D* sliceGeometry = workingSlice->GetGeometry();\n  itk::Index<2> projectedPointIn2D;\n  sliceGeometry->WorldToIndex( positionEvent->GetWorldPosition(), projectedPointIn2D );\n  if ( !sliceGeometry->IsIndexInside( projectedPointIn2D ) )\n  {\n    std::cout << \"point apparently not inside segmentation slice\" << std::endl;\n    return false; \/\/ can't use that as a seed point\n  }\n\n    \/\/ Convert to ipMITKSegmentationTYPE (because ipMITKSegmentationGetContour8N relys on that data type)\n    itk::Image< ipMITKSegmentationTYPE, 2 >::Pointer correctPixelTypeImage;\n    CastToItkImage( workingSlice, correctPixelTypeImage );\n    assert (correctPixelTypeImage.IsNotNull() );\n\n  \/\/ possible bug in CastToItkImage ?\n  \/\/ direction maxtrix is wrong\/broken\/not working after CastToItkImage, leading to a failed assertion in\n  \/\/ mitk\/Core\/DataStructures\/mitkSlicedGeometry3D.cpp, 479:\n  \/\/ virtual void mitk::SlicedGeometry3D::SetSpacing(const mitk::Vector3D&): Assertion `aSpacing[0]>0 && aSpacing[1]>0 && aSpacing[2]>0' failed\n  \/\/ solution here: we overwrite it with an unity matrix\n  itk::Image< ipMITKSegmentationTYPE, 2 >::DirectionType imageDirection;\n  imageDirection.SetIdentity();\n  correctPixelTypeImage->SetDirection(imageDirection);\n\n    Image::Pointer temporarySlice = Image::New();\n  \/\/  temporarySlice = ImportItkImage( correctPixelTypeImage );\n    CastToMitkImage( correctPixelTypeImage, temporarySlice );\n\n\n  \/\/ check index positions\n  ipPicDescriptor* originalPicSlice = temporarySlice->GetSliceData()->GetPicDescriptor();\n \n  int m_SeedPointMemoryOffset = projectedPointIn2D[1] * originalPicSlice->n[0] + projectedPointIn2D[0];\n\n  if ( m_SeedPointMemoryOffset >= static_cast<int>( originalPicSlice->n[0] * originalPicSlice->n[1] ) ||\n       m_SeedPointMemoryOffset < 0 )\n  {\n    std::cerr << \"Memory offset calculation if mitk::SetRegionTool has some serious flaw! Aborting..\" << std::endl;\n    return false;\n  }\n  \n  \/\/ 2. Determine the contour that surronds the selected \"piece of the image\"\n  \n  \/\/ find a contour seed point\n  unsigned int oneContourOffset = static_cast<unsigned int>( m_SeedPointMemoryOffset ); \/\/ safe because of earlier check if m_SeedPointMemoryOffset < 0\n\n  \/** \n    * The logic of finding a starting point for the contour is the following:\n    * \n    *  - If the initial seed point is 0, we are either inside a hole or outside of every segmentation.\n    *    We move to the right until we hit a 1, which must be part of a contour. \n    *\n    *  - If the initial seed point is 1, then ...\n    *    we now do the same (running to the right) until we hit a 1\n    *\n    *  In both cases the found contour point is used to extract a contour and\n    *  then a test is applied to find out if the initial seed point is contained\n    *  in the contour. If this is the case, filling should be applied, otherwise\n    *  nothing is done.\n    *\/\n  unsigned int size = originalPicSlice->n[0] * originalPicSlice->n[1];\n\/*\n  unsigned int rowSize = originalPicSlice->n[0];\n*\/\n  ipMITKSegmentationTYPE* data = static_cast<ipMITKSegmentationTYPE*>(originalPicSlice->data);\n\n  if ( data[oneContourOffset] == 0 ) \/\/ initial seed 0\n  {\n    for ( ; oneContourOffset < size; ++oneContourOffset )\n    {\n      if ( data[oneContourOffset] > 0 ) break;\n    }\n  }\n  else if ( data[oneContourOffset] == 1 ) \/\/ initial seed 1\n  {\n    unsigned int lastValidPixel = size-1; \/\/ initialization, will be changed lateron\n    bool inSeg = true;    \/\/ inside segmentation?\n    for ( ; oneContourOffset < size; ++oneContourOffset )\n    {\n      if ( ( data[oneContourOffset] == 0 ) && inSeg ) \/\/ pixel 0 and inside-flag set: this happens at the first pixel outside a filled region\n      {\n        inSeg = false;\n        lastValidPixel = oneContourOffset - 1; \/\/ store the last pixel position inside a filled region\n        break;\n      }\n      else \/\/ pixel 1, inside-flag doesn't matter: this happens while we are inside a filled region\n      {\n        inSeg = true; \/\/ first iteration lands here\n      }\n      \n    }\n    oneContourOffset = lastValidPixel;\n  }\n  else\n  {\n    std::cerr << \"Fill\/Erase was never intended to work with other than binary images.\" << std::endl;\n    m_FillContour = false;\n    return false;\n  }\n\n  if (oneContourOffset == size) \/\/ nothing found until end of slice\n  {\n    m_FillContour = false;\n    return false;\n  }\n  \n  int numberOfContourPoints( 0 );\n  int newBufferSize( 0 );\n  float* contourPoints = ipMITKSegmentationGetContour8N( originalPicSlice, oneContourOffset, numberOfContourPoints, newBufferSize ); \/\/ memory allocated with malloc\n\n  bool cursorInsideContour = ipMITKSegmentationIsInsideContour( contourPoints, numberOfContourPoints, projectedPointIn2D[0], projectedPointIn2D[1]);\n\n  \/\/ decide if contour should be filled or not\n  m_FillContour = cursorInsideContour;\n\n  if (m_FillContour)\n  {\n    \/\/ copy point from float* to mitk::Contour \n    Contour::Pointer contourInImageIndexCoordinates = Contour::New();\n    contourInImageIndexCoordinates->Initialize();\n    Point3D newPoint;\n    for (int index = 0; index < numberOfContourPoints; ++index)\n    {\n      newPoint[0] = contourPoints[ 2 * index + 0 ];\n      newPoint[1] = contourPoints[ 2 * index + 1];\n      newPoint[2] = 0;\n\n      contourInImageIndexCoordinates->AddVertex( newPoint );\n    }\n\n    m_SegmentationContourInWorldCoordinates = SegTool2D::BackProjectContourFrom2DSlice( workingSlice, contourInImageIndexCoordinates, true ); \/\/ true, correct the result from ipMITKSegmentationGetContour8N\n\n    \/\/ 3. Show the contour\n    SegTool2D::SetFeedbackContour( *m_SegmentationContourInWorldCoordinates );\n    \n    SegTool2D::SetFeedbackContourVisible(true);\n    mitk::RenderingManager::GetInstance()->RequestUpdate(positionEvent->GetSender()->GetRenderWindow());\n  }\n\n  \/\/ always generate a second contour, containing the whole image (used when CTRL is pressed)\n  {\n    \/\/ copy point from float* to mitk::Contour \n    Contour::Pointer contourInImageIndexCoordinates = Contour::New();\n    contourInImageIndexCoordinates->Initialize();\n    Point3D newPoint;\n    newPoint[0] = 0; newPoint[1] = 0; newPoint[2] = 0;\n    contourInImageIndexCoordinates->AddVertex( newPoint );\n    newPoint[0] = originalPicSlice->n[0]; newPoint[1] = 0; newPoint[2] = 0;\n    contourInImageIndexCoordinates->AddVertex( newPoint );\n    newPoint[0] = originalPicSlice->n[0]; newPoint[1] = originalPicSlice->n[1]; newPoint[2] = 0;\n    contourInImageIndexCoordinates->AddVertex( newPoint );\n    newPoint[0] = 0; newPoint[1] = originalPicSlice->n[1]; newPoint[2] = 0;\n    contourInImageIndexCoordinates->AddVertex( newPoint );\n\n    m_WholeImageContourInWorldCoordinates = SegTool2D::BackProjectContourFrom2DSlice( workingSlice, contourInImageIndexCoordinates, true ); \/\/ true, correct the result from ipMITKSegmentationGetContour8N\n\n    \/\/ 3. Show the contour\n    SegTool2D::SetFeedbackContour( *m_SegmentationContourInWorldCoordinates );\n    \n    SegTool2D::SetFeedbackContourVisible(true);\n    mitk::RenderingManager::GetInstance()->RequestUpdate(positionEvent->GetSender()->GetRenderWindow());\n  }\n\n\n  free(contourPoints);\n\n  return true;\n}\n\nbool mitk::SetRegionTool::OnMouseReleased(Action* action, const StateEvent* stateEvent)\n{\n  \/\/ 1. Hide the feedback contour, find out which slice the user clicked, find out which slice of the toolmanager's working image corresponds to that\n  SegTool2D::SetFeedbackContourVisible(false);\n  \n  const PositionEvent* positionEvent = dynamic_cast<const PositionEvent*>(stateEvent->GetEvent());\n  if (!positionEvent) return false;\n\n  assert( positionEvent->GetSender()->GetRenderWindow() );\n  mitk::RenderingManager::GetInstance()->RequestUpdate(positionEvent->GetSender()->GetRenderWindow());\n  \n  if (!m_FillContour && !m_StatusFillWholeSlice) return true;\n  \n  if (!SegTool2D::OnMouseReleased( action, stateEvent )) return false;\n\n  DataTreeNode* workingNode( m_ToolManager->GetWorkingData(0) );\n  if (!workingNode) return false;\n\n  Image* image = dynamic_cast<Image*>(workingNode->GetData());\n  const PlaneGeometry* planeGeometry( dynamic_cast<const PlaneGeometry*> (positionEvent->GetSender()->GetCurrentWorldGeometry2D() ) );\n  if ( !image || !planeGeometry ) return false;\n\n  int affectedDimension( -1 );\n  int affectedSlice( -1 );\n  if ( SegTool2D::DetermineAffectedImageSlice( image, planeGeometry, affectedDimension, affectedSlice ) )\n  {\n    \/\/ 2. Slice is known, now we try to get it as a 2D image and project the contour into index coordinates of this slice\n    Image::Pointer slice = SegTool2D::GetAffectedImageSliceAs2DImage( positionEvent, image );\n\n    if ( slice.IsNull() )\n    {\n      std::cerr << \"Unable to extract slice.\" << std::endl;\n      return false;\n    }\n      \n    Contour* feedbackContour( SegTool2D::GetFeedbackContour() );\n    Contour::Pointer projectedContour = SegTool2D::ProjectContourTo2DSlice( slice, feedbackContour, false, false ); \/\/ false: don't add 0.5 (done by FillContourInSlice)\n                                                                                                                   \/\/ false: don't constrain the contour to the image's inside\n    if (projectedContour.IsNull()) return false;\n\n    SegTool2D::FillContourInSlice( projectedContour, slice, m_PaintingPixelValue );\n\n    \/\/ 5. Write the modified 2D working data slice back into the image\n    OverwriteSliceImageFilter::Pointer slicewriter = OverwriteSliceImageFilter::New();\n    slicewriter->SetInput( image );\n    slicewriter->SetCreateUndoInformation( true );\n    slicewriter->SetSliceImage( slice );\n    slicewriter->SetSliceDimension( affectedDimension );\n    slicewriter->SetSliceIndex( affectedSlice );\n    slicewriter->Update();\n\n    \/\/ 6. Make sure the result is drawn again --> is visible then. \n    assert( positionEvent->GetSender()->GetRenderWindow() );\n    mitk::RenderingManager::GetInstance()->RequestUpdate(positionEvent->GetSender()->GetRenderWindow());\n  }\n  else\n  {\n    std::cout << \"SegTool2D could not determine which slice of the image you are drawing on.\" << std::endl;\n  }\n\n  m_WholeImageContourInWorldCoordinates = NULL;\n  m_SegmentationContourInWorldCoordinates = NULL;\n\n  return true;\n}\n\n\/**\n  Called when the CTRL key is pressed. Will change the painting pixel value from 0 to 1 or from 1 to 0. \n*\/\nbool mitk::SetRegionTool::OnInvertLogic(Action* action, const StateEvent* stateEvent)\n{\n  if (!SegTool2D::OnInvertLogic(action, stateEvent)) return false;\n  \n  const PositionEvent* positionEvent = dynamic_cast<const PositionEvent*>(stateEvent->GetEvent());\n  if (!positionEvent) return false;\n\n  if (m_StatusFillWholeSlice)\n  {\n    \/\/ use contour extracted from image data\n    if (m_SegmentationContourInWorldCoordinates.IsNotNull())\n      SegTool2D::SetFeedbackContour( *m_SegmentationContourInWorldCoordinates );\n    mitk::RenderingManager::GetInstance()->RequestUpdate(positionEvent->GetSender()->GetRenderWindow());\n  } \n  else\n  {\n    \/\/ use some artificial contour\n    if (m_WholeImageContourInWorldCoordinates.IsNotNull())\n      SegTool2D::SetFeedbackContour( *m_WholeImageContourInWorldCoordinates );\n    mitk::RenderingManager::GetInstance()->RequestUpdate(positionEvent->GetSender()->GetRenderWindow());\n  }\n\n  m_StatusFillWholeSlice = !m_StatusFillWholeSlice;\n\n  return true;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef FIXED_BASIC_ALLOCATION_PATTERN_HPP\n#define FIXED_BASIC_ALLOCATION_PATTERN_HPP\n\n#include <type_traits>\n#include <memory>\n#include \"fixed_def.hpp\"\n#include \"basic_allocation_sources.hpp\"\n\nnamespace fixed\n{\n\tnamespace _impl\n\t{\n\t\tstruct allocation_pattern_tag\n\t\t{};\n\n\t\ttemplate <typename T, class = void>\n\t\tstruct is_allocation_pattern : public std::bool_constant<false>\n\t\t{};\n\n\t\ttemplate <typename T>\n\t\tstruct is_allocation_pattern<T, std::void_t<typename T::allocation_pattern>> : public std::bool_constant<true>\n\t\t{};\n\n\t\t\/\/Allocate your container on the stack\n\t\ttemplate <typename T, size_type SIZE>\n\t\tstruct basic_stack_allocator\n\t\t{\n\t\t\tstatic_assert(SIZE > 0, \"zero sized container not allowed !\");\n\n\t\t\tbasic_stack_allocator() = default;\n\t\t\tbasic_stack_allocator(const basic_stack_allocator&) = default;\n\t\t\tbasic_stack_allocator& operator=(const basic_stack_allocator&) = default;\n\t\t\tbasic_stack_allocator(basic_stack_allocator&&) noexcept= default;\n\t\t\tbasic_stack_allocator& operator=(basic_stack_allocator&&) noexcept= default;\n\n\t\t\tbasic_stack_allocator(const empty_source&): basic_stack_allocator() {}\n\n\t\t\ttypedef T value_type;\n\t\t\ttypedef T* pointer;\n\t\t\ttypedef T& reference;\n\t\t\ttypedef const T* const_pointer;\n\t\t\ttypedef const T& const_reference;\n\t\t\ttypedef allocation_pattern_tag allocation_pattern;\n\n\t\t\tpointer data() { return reinterpret_cast<T*>(_data); }\n\t\t\tconst_pointer data() const { return reinterpret_cast<const T*>(_data); }\n\t\t\treference operator[](size_type i) { assert(i < SIZE); return data()[i]; }\n\t\t\tconst_reference operator[](size_type i) const { assert(i < SIZE); return data()[i]; }\n\n\t\t\tbool valid_pointer(const T* ptr) { return ptr >= data() && ptr < data() + max_size(); }\n\t\t\tconstexpr size_type max_size() const { return SIZE; }\n\t\tprivate:\n\t\t\ttypename std::aligned_storage<sizeof(T), alignof(T)>::type _data[SIZE];\n\t\t};\n\n\t\t\/\/When your size is too big to being correctly stored on the stack\n\t\ttemplate <typename T, size_type SIZE>\n\t\tstruct basic_heap_allocator\n\t\t{\n\t\t\tstatic_assert(SIZE > 0, \"zero sized container not allowed !\");\n\n\t\t\tbasic_heap_allocator() = default;\n\t\t\tbasic_heap_allocator(basic_heap_allocator&&) = default;\n\t\t\tbasic_heap_allocator& operator=(basic_heap_allocator&&) = default;\n\n\t\t\tbasic_heap_allocator(const empty_source& ) : basic_heap_allocator() {}\n\n\t\t\ttypedef T value_type;\n\t\t\ttypedef T* pointer;\n\t\t\ttypedef T& reference;\n\t\t\ttypedef const T* const_pointer;\n\t\t\ttypedef const T& const_reference;\n\t\t\ttypedef allocation_pattern_tag allocation_pattern;\n\n\t\t\tpointer data() { return reinterpret_cast<T*>(_data.get()); }\n\t\t\tconst_pointer data() const { return reinterpret_cast<const T*>(_data.get()); }\n\t\t\treference operator[](size_type i) { assert(i < SIZE); return data()[i]; }\n\t\t\tconst_reference operator[](size_type i) const { assert(i < SIZE); return data()[i]; }\n\n\t\t\tbool valid_pointer(const T* ptr) { return ptr >= data() && ptr < data() + max_size(); }\n\t\t\tconstexpr size_type max_size() const { return SIZE; }\n\t\tprivate:\n\t\t\tstd::unique_ptr<typename std::aligned_storage<sizeof(T), alignof(T)>::type[]> _data = std::make_unique<typename std::aligned_storage<sizeof(T), alignof(T)>::type[]>(SIZE);\n \t\t};\n\t}\n}\n\n#endif \/\/!FIXED_BASIC_ALLOCATION_PATTERN_HPP\n<commit_msg>Adding missing header found by gcc<commit_after>#ifndef FIXED_BASIC_ALLOCATION_PATTERN_HPP\n#define FIXED_BASIC_ALLOCATION_PATTERN_HPP\n\n#include <type_traits>\n#include <memory>\n#include <cassert>\n#include \"fixed_def.hpp\"\n#include \"basic_allocation_sources.hpp\"\n\nnamespace fixed\n{\n\tnamespace _impl\n\t{\n\t\tstruct allocation_pattern_tag\n\t\t{};\n\n\t\ttemplate <typename T, class = void>\n\t\tstruct is_allocation_pattern : public std::bool_constant<false>\n\t\t{};\n\n\t\ttemplate <typename T>\n\t\tstruct is_allocation_pattern<T, std::void_t<typename T::allocation_pattern>> : public std::bool_constant<true>\n\t\t{};\n\n\t\t\/\/Allocate your container on the stack\n\t\ttemplate <typename T, size_type SIZE>\n\t\tstruct basic_stack_allocator\n\t\t{\n\t\t\tstatic_assert(SIZE > 0, \"zero sized container not allowed !\");\n\n\t\t\tbasic_stack_allocator() = default;\n\t\t\tbasic_stack_allocator(const basic_stack_allocator&) = default;\n\t\t\tbasic_stack_allocator& operator=(const basic_stack_allocator&) = default;\n\t\t\tbasic_stack_allocator(basic_stack_allocator&&) noexcept= default;\n\t\t\tbasic_stack_allocator& operator=(basic_stack_allocator&&) noexcept= default;\n\n\t\t\tbasic_stack_allocator(const empty_source&): basic_stack_allocator() {}\n\n\t\t\ttypedef T value_type;\n\t\t\ttypedef T* pointer;\n\t\t\ttypedef T& reference;\n\t\t\ttypedef const T* const_pointer;\n\t\t\ttypedef const T& const_reference;\n\t\t\ttypedef allocation_pattern_tag allocation_pattern;\n\n\t\t\tpointer data() { return reinterpret_cast<T*>(_data); }\n\t\t\tconst_pointer data() const { return reinterpret_cast<const T*>(_data); }\n\t\t\treference operator[](size_type i) { assert(i < SIZE); return data()[i]; }\n\t\t\tconst_reference operator[](size_type i) const { assert(i < SIZE); return data()[i]; }\n\n\t\t\tbool valid_pointer(const T* ptr) { return ptr >= data() && ptr < data() + max_size(); }\n\t\t\tconstexpr size_type max_size() const { return SIZE; }\n\t\tprivate:\n\t\t\ttypename std::aligned_storage<sizeof(T), alignof(T)>::type _data[SIZE];\n\t\t};\n\n\t\t\/\/When your size is too big to being correctly stored on the stack\n\t\ttemplate <typename T, size_type SIZE>\n\t\tstruct basic_heap_allocator\n\t\t{\n\t\t\tstatic_assert(SIZE > 0, \"zero sized container not allowed !\");\n\n\t\t\tbasic_heap_allocator() = default;\n\t\t\tbasic_heap_allocator(basic_heap_allocator&&) = default;\n\t\t\tbasic_heap_allocator& operator=(basic_heap_allocator&&) = default;\n\n\t\t\tbasic_heap_allocator(const empty_source& ) : basic_heap_allocator() {}\n\n\t\t\ttypedef T value_type;\n\t\t\ttypedef T* pointer;\n\t\t\ttypedef T& reference;\n\t\t\ttypedef const T* const_pointer;\n\t\t\ttypedef const T& const_reference;\n\t\t\ttypedef allocation_pattern_tag allocation_pattern;\n\n\t\t\tpointer data() { return reinterpret_cast<T*>(_data.get()); }\n\t\t\tconst_pointer data() const { return reinterpret_cast<const T*>(_data.get()); }\n\t\t\treference operator[](size_type i) { assert(i < SIZE); return data()[i]; }\n\t\t\tconst_reference operator[](size_type i) const { assert(i < SIZE); return data()[i]; }\n\n\t\t\tbool valid_pointer(const T* ptr) { return ptr >= data() && ptr < data() + max_size(); }\n\t\t\tconstexpr size_type max_size() const { return SIZE; }\n\t\tprivate:\n\t\t\tstd::unique_ptr<typename std::aligned_storage<sizeof(T), alignof(T)>::type[]> _data = std::make_unique<typename std::aligned_storage<sizeof(T), alignof(T)>::type[]>(SIZE);\n \t\t};\n\t}\n}\n\n#endif \/\/!FIXED_BASIC_ALLOCATION_PATTERN_HPP\n<|endoftext|>"}
{"text":"<commit_before>#include \"common\/application_info.h\"\n\n#include \"base\/file_version_info.h\"\n#include \"base\/memory\/scoped_ptr.h\"\n#include \"base\/strings\/utf_string_conversions.h\"\n\nnamespace brightray {\n\nstd::string GetApplicationName() {\n  auto module = GetModuleHandle(nullptr);\n  auto info = make_scoped_ptr(\n      FileVersionInfo::CreateFileVersionInfoForModule(module));\n  return UTF16ToUTF8(info->product_name());\n}\n\nstd::string GetApplicationVersion() {\n  auto module = GetModuleHandle(nullptr);\n  auto info = make_scoped_ptr(\n      FileVersionInfo::CreateFileVersionInfoForModule(module));\n  return UTF16ToUTF8(info->product_version());\n}\n\n}  \/\/ namespace brightray\n<commit_msg>Update for move of string conversion functions into base::<commit_after>#include \"common\/application_info.h\"\n\n#include \"base\/file_version_info.h\"\n#include \"base\/memory\/scoped_ptr.h\"\n#include \"base\/strings\/utf_string_conversions.h\"\n\nnamespace brightray {\n\nstd::string GetApplicationName() {\n  auto module = GetModuleHandle(nullptr);\n  auto info = make_scoped_ptr(\n      FileVersionInfo::CreateFileVersionInfoForModule(module));\n  return base::UTF16ToUTF8(info->product_name());\n}\n\nstd::string GetApplicationVersion() {\n  auto module = GetModuleHandle(nullptr);\n  auto info = make_scoped_ptr(\n      FileVersionInfo::CreateFileVersionInfoForModule(module));\n  return base::UTF16ToUTF8(info->product_version());\n}\n\n}  \/\/ namespace brightray\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>ValueExpressionBuilder...<commit_after><|endoftext|>"}
{"text":"<commit_before>#ifdef JOEDB_HAS_SSH\n\n#include \"joedb\/server\/SSH_Connection.h\"\n#include \"joedb\/Exception.h\"\n\n#include <fcntl.h>\n#include <thread>\n#include <chrono>\n#include <iostream>\n\n\/\/\n\/\/ Windows does not define those\n\/\/\n#ifndef S_IRUSR\n#define\tS_IRUSR\t0000400\n#endif\n\n#ifndef S_IWUSR\n#define\tS_IWUSR\t0000200\n#endif\n\nnamespace joedb\n{\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n void SSH_Connection::lock()\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n {\n  if (trace)\n   std::cerr << full_remote_name << \": lock()... \";\n\n  while (true)\n  {\n   sftp_file file = sftp_open\n   (\n    sftp.get(),\n    mutex_file_name.c_str(),\n    O_CREAT | O_EXCL,\n    S_IRUSR\n   );\n\n   if (file)\n   {\n    sftp_close(file);\n    break;\n   }\n   else\n    std::this_thread::sleep_for(std::chrono::seconds(1));\n  }\n\n  if (trace)\n   std::cerr << \"done.\\n\";\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n void SSH_Connection::unlock()\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n {\n  if (trace)\n   std::cerr << full_remote_name << \": unlock()\\n\";\n\n  if (sftp_unlink(sftp.get(), mutex_file_name.c_str()) < 0)\n   throw Exception(\"Error removing remote mutex\");\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n void SSH_Connection::raw_pull(Journal_File &client_journal)\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n {\n  if (trace)\n   std::cerr << full_remote_name << \": pull()... \";\n\n  server_position = 0;\n\n  try\n  {\n   ssh::SFTP_Attributes attributes\n   (\n    sftp_stat(sftp.get(), remote_file_name.c_str())\n   );\n\n   server_position = int64_t(attributes.get()->size);\n  }\n  catch (const joedb::Exception &)\n  {\n  }\n\n  const int64_t client_position = client_journal.get_checkpoint_position();\n\n  if (client_position < server_position)\n  {\n   std::vector<char> v(size_t(server_position - client_position));\n\n   if (trace)\n    std::cerr << v.size() << \" bytes... \";\n\n   sftp_file file = sftp_open\n   (\n    sftp.get(),\n    remote_file_name.c_str(),\n    O_RDONLY,\n    S_IRUSR | S_IWUSR\n   );\n\n   if (file)\n   {\n    int seek_result = sftp_seek64(file, uint64_t(client_position));\n    ssize_t read_result = sftp_read(file, v.data(), v.size());\n    sftp_close(file);\n\n    if (seek_result < 0 || read_result != ssize_t(v.size()))\n     throw Exception(\"Error during sftp_read\");\n\n    client_journal.append_raw_tail(v);\n   }\n   else\n    throw Exception(\"Could not open remote file for reading\");\n  }\n  else if (server_position > 0 && client_position > server_position)\n   throw Exception(\"Trying to pull when ahead of server\");\n\n  if (trace)\n   std::cerr << \"done\\n\";\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n void SSH_Connection::raw_push(Readonly_Journal &client_journal)\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n {\n  if (trace)\n   std::cerr << full_remote_name << \": push()... \";\n\n  const int64_t client_position = client_journal.get_checkpoint_position();\n  if (client_position > server_position)\n  {\n   std::vector<char> v(client_journal.get_raw_tail(server_position));\n\n   if (trace)\n    std::cerr << v.size() << \" bytes... \";\n\n   sftp_file file = sftp_open\n   (\n    sftp.get(),\n    remote_file_name.c_str(),\n    O_WRONLY | O_APPEND | O_CREAT,\n    S_IRUSR | S_IWUSR\n   );\n\n   if (file)\n   {\n    ssize_t written = sftp_write(file, v.data(), v.size());\n    sftp_close(file);\n    if (written < ssize_t(v.size()))\n     throw Exception(\"Incomplete write during push\");\n   }\n   else\n    throw Exception(\"Could not open remote file for writing\");\n  }\n\n  if (trace)\n   std::cerr << \"done\\n\";\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n SSH_Connection::SSH_Connection\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n (\n  std::string user,\n  std::string host,\n  int port,\n  std::string remote_file_name,\n  bool trace,\n  int ssh_log_level\n ):\n  remote_file_name(remote_file_name),\n  trace(trace),\n  mutex_file_name(remote_file_name + \".mutex\"),\n  full_remote_name(user + \"@\" + host + \":\" + remote_file_name),\n  session\n  (\n   user,\n   host,\n   port,\n   ssh_log_level\n  ),\n  sftp(session),\n  server_position(0)\n {\n }\n\n#define RETRY(x, n)\\\n for (int i = n; --i >= 0;)\\\n  try\\\n  {\\\n   x;\\\n   return;\\\n  }\\\n  catch (const Exception &e)\\\n  {\\\n   if (trace)\\\n    std::cerr << \"Error: \" << e.what() << '\\n';\\\n   reset();\\\n  }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n void SSH_Robust_Connection::pull(Journal_File &client_journal)\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n {\n  RETRY(connection->pull(client_journal), 2);\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n void SSH_Robust_Connection::lock_pull(Journal_File &client_journal)\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n {\n  RETRY(connection->lock_pull(client_journal), 2);\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n void SSH_Robust_Connection::push_unlock(Readonly_Journal &client_journal)\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n {\n  RETRY(connection->push_unlock(client_journal), 2);\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n void SSH_Robust_Connection::reset()\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n {\n  if (trace && connection)\n  {\n   std::cerr << \"An error occurred, trying to reset the connection...\\n\";\n   std::this_thread::sleep_for(std::chrono::seconds(10));\n  }\n\n  for (int i = 100; --i >= 0;)\n   try\n   {\n    connection.reset\n    (\n     new SSH_Connection\n     (\n      user,\n      host,\n      port,\n      remote_file_name,\n      trace,\n      ssh_log_level\n     )\n    );\n    return;\n   }\n   catch (const Exception &e)\n   {\n    if (trace)\n    {\n     std::cerr << \"Connection failed: \" << e.what() << '\\n';\n     std::cerr << \"Will retry after a pause...\\n\";\n    }\n    std::this_thread::sleep_for(std::chrono::seconds(10));\n   }\n\n  throw Exception(\"Impossible to connect. Giving up\");\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n SSH_Robust_Connection::SSH_Robust_Connection\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n (\n  std::string user,\n  std::string host,\n  int port,\n  std::string remote_file_name,\n  bool trace,\n  int ssh_log_level\n ):\n  user(user),\n  host(host),\n  port(port),\n  remote_file_name(remote_file_name),\n  trace(trace),\n  ssh_log_level(ssh_log_level)\n {\n  reset();\n }\n}\n\n#endif\n<commit_msg>sftp_write must be split into smaller buffers<commit_after>#ifdef JOEDB_HAS_SSH\n\n#include \"joedb\/server\/SSH_Connection.h\"\n#include \"joedb\/Exception.h\"\n\n#include <fcntl.h>\n#include <thread>\n#include <chrono>\n#include <iostream>\n\n\/\/\n\/\/ Windows does not define those\n\/\/\n#ifndef S_IRUSR\n#define\tS_IRUSR\t0000400\n#endif\n\n#ifndef S_IWUSR\n#define\tS_IWUSR\t0000200\n#endif\n\nnamespace joedb\n{\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n void SSH_Connection::lock()\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n {\n  if (trace)\n   std::cerr << full_remote_name << \": lock()... \";\n\n  while (true)\n  {\n   sftp_file file = sftp_open\n   (\n    sftp.get(),\n    mutex_file_name.c_str(),\n    O_CREAT | O_EXCL,\n    S_IRUSR\n   );\n\n   if (file)\n   {\n    sftp_close(file);\n    break;\n   }\n   else\n    std::this_thread::sleep_for(std::chrono::seconds(1));\n  }\n\n  if (trace)\n   std::cerr << \"done.\\n\";\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n void SSH_Connection::unlock()\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n {\n  if (trace)\n   std::cerr << full_remote_name << \": unlock()\\n\";\n\n  if (sftp_unlink(sftp.get(), mutex_file_name.c_str()) < 0)\n   throw Exception(\"Error removing remote mutex\");\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n void SSH_Connection::raw_pull(Journal_File &client_journal)\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n {\n  if (trace)\n   std::cerr << full_remote_name << \": pull()... \";\n\n  server_position = 0;\n\n  try\n  {\n   ssh::SFTP_Attributes attributes\n   (\n    sftp_stat(sftp.get(), remote_file_name.c_str())\n   );\n\n   server_position = int64_t(attributes.get()->size);\n  }\n  catch (const joedb::Exception &)\n  {\n  }\n\n  const int64_t client_position = client_journal.get_checkpoint_position();\n\n  if (client_position < server_position)\n  {\n   std::vector<char> v(size_t(server_position - client_position));\n\n   if (trace)\n    std::cerr << v.size() << \" bytes... \";\n\n   sftp_file file = sftp_open\n   (\n    sftp.get(),\n    remote_file_name.c_str(),\n    O_RDONLY,\n    S_IRUSR | S_IWUSR\n   );\n\n   if (file)\n   {\n    int seek_result = sftp_seek64(file, uint64_t(client_position));\n    ssize_t read_result = sftp_read(file, v.data(), v.size());\n    sftp_close(file);\n\n    if (seek_result < 0 || read_result != ssize_t(v.size()))\n     throw Exception(\"Error during sftp_read\");\n\n    client_journal.append_raw_tail(v);\n   }\n   else\n    throw Exception(\"Could not open remote file for reading\");\n  }\n  else if (server_position > 0 && client_position > server_position)\n   throw Exception(\"Trying to pull when ahead of server\");\n\n  if (trace)\n   std::cerr << \"done\\n\";\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n void SSH_Connection::raw_push(Readonly_Journal &client_journal)\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n {\n  if (trace)\n   std::cerr << full_remote_name << \": push()... \";\n\n  const int64_t client_position = client_journal.get_checkpoint_position();\n  if (client_position > server_position)\n  {\n   std::vector<char> v(client_journal.get_raw_tail(server_position));\n\n   if (trace)\n    std::cerr << v.size() << \" bytes... \";\n\n   sftp_file file = sftp_open\n   (\n    sftp.get(),\n    remote_file_name.c_str(),\n    O_WRONLY | O_APPEND | O_CREAT,\n    S_IRUSR | S_IWUSR\n   );\n\n   if (file)\n   {\n    \/\/\n    \/\/ https:\/\/tools.ietf.org\/html\/draft-ietf-secsh-filexfer-00\n    \/\/\n    \/\/ The maximum size of a packet is in practise determined by the client\n    \/\/ (the maximum size of read or write requests that it sends, plus a few\n    \/\/ bytes of packet overhead).  All servers SHOULD support packets of at\n    \/\/ least 34000 bytes (where the packet size refers to the full length,\n    \/\/ including the header above).  This should allow for reads and writes of\n    \/\/ at most 32768 bytes.\n    \/\/\n    const size_t max_block_size = 32768;\n    const size_t size = v.size();\n    size_t written = 0;\n\n    while (written < size)\n    {\n     size_t block_size = size - written;\n\n     if (block_size > max_block_size)\n      block_size = max_block_size;\n\n     const ssize_t result = sftp_write(file, v.data() + written, block_size);\n\n     if (result <= 0)\n      break;\n\n     written += size_t(result);\n    }\n\n    sftp_close(file);\n\n    if (written < size)\n     throw Exception(\"Incomplete write during push\");\n   }\n   else\n    throw Exception(\"Could not open remote file for writing\");\n  }\n\n  if (trace)\n   std::cerr << \"done\\n\";\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n SSH_Connection::SSH_Connection\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n (\n  std::string user,\n  std::string host,\n  int port,\n  std::string remote_file_name,\n  bool trace,\n  int ssh_log_level\n ):\n  remote_file_name(remote_file_name),\n  trace(trace),\n  mutex_file_name(remote_file_name + \".mutex\"),\n  full_remote_name(user + \"@\" + host + \":\" + remote_file_name),\n  session\n  (\n   user,\n   host,\n   port,\n   ssh_log_level\n  ),\n  sftp(session),\n  server_position(0)\n {\n }\n\n#define RETRY(x, n)\\\n for (int i = n; --i >= 0;)\\\n  try\\\n  {\\\n   x;\\\n   return;\\\n  }\\\n  catch (const Exception &e)\\\n  {\\\n   if (trace)\\\n    std::cerr << \"Error: \" << e.what() << '\\n';\\\n   reset();\\\n  }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n void SSH_Robust_Connection::pull(Journal_File &client_journal)\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n {\n  RETRY(connection->pull(client_journal), 2);\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n void SSH_Robust_Connection::lock_pull(Journal_File &client_journal)\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n {\n  RETRY(connection->lock_pull(client_journal), 2);\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n void SSH_Robust_Connection::push_unlock(Readonly_Journal &client_journal)\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n {\n  RETRY(connection->push_unlock(client_journal), 2);\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n void SSH_Robust_Connection::reset()\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n {\n  if (trace && connection)\n  {\n   std::cerr << \"An error occurred, trying to reset the connection...\\n\";\n   std::this_thread::sleep_for(std::chrono::seconds(10));\n  }\n\n  for (int i = 100; --i >= 0;)\n   try\n   {\n    connection.reset\n    (\n     new SSH_Connection\n     (\n      user,\n      host,\n      port,\n      remote_file_name,\n      trace,\n      ssh_log_level\n     )\n    );\n    return;\n   }\n   catch (const Exception &e)\n   {\n    if (trace)\n    {\n     std::cerr << \"Connection failed: \" << e.what() << '\\n';\n     std::cerr << \"Will retry after a pause...\\n\";\n    }\n    std::this_thread::sleep_for(std::chrono::seconds(10));\n   }\n\n  throw Exception(\"Impossible to connect. Giving up\");\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n SSH_Robust_Connection::SSH_Robust_Connection\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n (\n  std::string user,\n  std::string host,\n  int port,\n  std::string remote_file_name,\n  bool trace,\n  int ssh_log_level\n ):\n  user(user),\n  host(host),\n  port(port),\n  remote_file_name(remote_file_name),\n  trace(trace),\n  ssh_log_level(ssh_log_level)\n {\n  reset();\n }\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/--------------------------------------------------------------------*- C++ -*-\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\n\/\/ version: $Id$\n\/\/ author:  Axel Naumann <axel@cern.ch>\n\/\/------------------------------------------------------------------------------\n\n#include \"cling\/Interpreter\/CIFactory.h\"\n\n#include \"DeclCollector.h\"\n\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/Basic\/TargetInfo.h\"\n#include \"clang\/Basic\/Version.h\"\n#include \"clang\/Driver\/ArgList.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\/TextDiagnosticPrinter.h\"\n#include \"clang\/Lex\/Preprocessor.h\"\n\n#include \"llvm\/LLVMContext.h\"\n#include \"llvm\/Target\/TargetOptions.h\"\n#include \"llvm\/Support\/Host.h\"\n#include \"llvm\/Support\/TargetSelect.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include \"llvm\/Support\/Path.h\"\n\nusing namespace clang;\n\nnamespace cling {\n  \/\/\n  \/\/  Dummy function so we can use dladdr to find the executable path.\n  \/\/\n  void locate_cling_executable()\n  {\n  }\n\n  \/\/\/ \\brief Retrieves the clang CC1 specific flags out of the compilation's\n  \/\/\/ jobs. Returns NULL on error.\n  static const clang::driver::ArgStringList\n  *GetCC1Arguments(clang::DiagnosticsEngine *Diagnostics,\n                   clang::driver::Compilation *Compilation) {\n    \/\/ We expect to get back exactly one Command job, if we didn't something\n    \/\/ failed. Extract that job from the Compilation.\n    const clang::driver::JobList &Jobs = Compilation->getJobs();\n    if (!Jobs.size() || !isa<clang::driver::Command>(*Jobs.begin())) {\n      \/\/ diagnose this...\n      return NULL;\n    }\n\n    \/\/ The one job we find should be to invoke clang again.\n    const clang::driver::Command *Cmd\n      = cast<clang::driver::Command>(*Jobs.begin());\n    if (llvm::StringRef(Cmd->getCreator().getName()) != \"clang\") {\n      \/\/ diagnose this...\n      return NULL;\n    }\n\n    return &Cmd->getArguments();\n  }\n\n  CompilerInstance* CIFactory::createCI(llvm::StringRef code,\n                                        int argc,\n                                        const char* const *argv,\n                                        const char* llvmdir) {\n    return createCI(llvm::MemoryBuffer::getMemBuffer(code), argc, argv,\n                    llvmdir);\n  }\n\n  CompilerInstance* CIFactory::createCI(llvm::MemoryBuffer* buffer,\n                                        int argc,\n                                        const char* const *argv,\n                                        const char* llvmdir) {\n    \/\/ Create an instance builder, passing the llvmdir and arguments.\n    \/\/\n    \/\/  Initialize the llvm library.\n    llvm::InitializeNativeTarget();\n    llvm::InitializeAllAsmPrinters();\n    llvm::sys::Path resource_path;\n    if (llvmdir) {\n      resource_path = llvmdir;\n      resource_path.appendComponent(\"lib\");\n      resource_path.appendComponent(\"clang\");\n      resource_path.appendComponent(CLANG_VERSION_STRING);\n    } else {\n      \/\/ FIXME: The first arg really does need to be argv[0] on FreeBSD.\n      \/\/\n      \/\/ Note: The second arg is not used for Apple, FreeBSD, Linux,\n      \/\/       or cygwin, and can only be used on systems which support\n      \/\/       the use of dladdr().\n      \/\/\n      \/\/ Note: On linux and cygwin this uses \/proc\/self\/exe to find the path.\n      \/\/\n      \/\/ Note: On Apple it uses _NSGetExecutablePath().\n      \/\/\n      \/\/ Note: On FreeBSD it uses getprogpath().\n      \/\/\n      \/\/ Note: Otherwise it uses dladdr().\n      \/\/\n      resource_path\n        = CompilerInvocation::GetResourcesPath(\"cling\",\n                                       (void*)(intptr_t) locate_cling_executable\n                                               );\n    }\n    if (!resource_path.canRead()) {\n      llvm::errs()\n        << \"ERROR in cling::CIFactory::createCI():\\n  resource directory \"\n        << resource_path.str() << \" not found!\\n\";\n      resource_path = \"\";\n    }\n\n    \/\/______________________________________\n    DiagnosticOptions DefaultDiagnosticOptions;\n    DefaultDiagnosticOptions.ShowColors = 1;\n    TextDiagnosticPrinter* DiagnosticPrinter\n      = new TextDiagnosticPrinter(llvm::errs(), DefaultDiagnosticOptions);\n    llvm::IntrusiveRefCntPtr<clang::DiagnosticIDs> DiagIDs(new DiagnosticIDs());\n    DiagnosticsEngine* Diagnostics\n      = new DiagnosticsEngine(DiagIDs, DiagnosticPrinter,\n                              \/*Owns it*\/ true); \/\/ LEAKS!\n\n    std::vector<const char*> argvCompile(argv, argv + argc);\n    \/\/ We do C++ by default; append right after argv[0] name\n    \/\/ Only insert it if there is no other \"-x\":\n    bool haveMinusX = false;\n    for (const char* const* iarg = argv; !haveMinusX && iarg < argv + argc;\n         ++iarg) {\n      haveMinusX = !strcmp(*iarg, \"-x\");\n    }\n    if (!haveMinusX) {\n      argvCompile.insert(argvCompile.begin() + 1,\"-x\");\n      argvCompile.insert(argvCompile.begin() + 2, \"c++\");\n    }\n    argvCompile.push_back(\"-c\");\n    argvCompile.push_back(\"-\");\n\n    bool IsProduction = false;\n    assert(IsProduction = true && \"set IsProduction if asserts are on.\");\n    clang::driver::Driver Driver(argv[0], llvm::sys::getDefaultTargetTriple(),\n                                 \"cling.out\",\n                                 IsProduction,\n                                 *Diagnostics);\n    \/\/Driver.setWarnMissingInput(false);\n    Driver.setCheckInputsExist(false); \/\/ think foo.C(12)\n    llvm::ArrayRef<const char*>RF(&(argvCompile[0]), argvCompile.size());\n    llvm::OwningPtr<clang::driver::Compilation>\n      Compilation(Driver.BuildCompilation(RF));\n    const clang::driver::ArgStringList* CC1Args\n      = GetCC1Arguments(Diagnostics, Compilation.get());\n    if (CC1Args == NULL) {\n      return 0;\n    }\n    clang::CompilerInvocation*\n      Invocation = new clang::CompilerInvocation;\n    clang::CompilerInvocation::CreateFromArgs(*Invocation, CC1Args->data() + 1,\n                                              CC1Args->data() + CC1Args->size(),\n                                              *Diagnostics);\n    Invocation->getFrontendOpts().DisableFree = true;\n\n    if (Invocation->getHeaderSearchOpts().UseBuiltinIncludes &&\n        !resource_path.empty()) {\n      \/\/ Update ResourceDir\n      \/\/ header search opts' entry for resource_path\/include isn't\n      \/\/ updated by providing a new resource path; update it manually.\n      clang::HeaderSearchOptions& Opts = Invocation->getHeaderSearchOpts();\n      llvm::sys::Path oldResInc(Opts.ResourceDir);\n      oldResInc.appendComponent(\"include\");\n      llvm::sys::Path newResInc(resource_path);\n      newResInc.appendComponent(\"include\");\n      bool foundOldResInc = false;\n      for (unsigned i = 0, e = Opts.UserEntries.size();\n           !foundOldResInc && i != e; ++i) {\n        HeaderSearchOptions::Entry &E = Opts.UserEntries[i];\n        if (!E.IsUserSupplied && !E.IsFramework\n            && E.Group == clang::frontend::System && E.IgnoreSysRoot\n            && E.IsInternal && !E.ImplicitExternC\n            && oldResInc.str() == E.Path) {\n          E.Path = newResInc.str();\n          foundOldResInc = true;\n        }\n      }\n\n      Opts.ResourceDir = resource_path.str();\n    }\n\n    \/\/ Create and setup a compiler instance.\n    CompilerInstance* CI = new CompilerInstance();\n    CI->setInvocation(Invocation);\n\n    CI->createDiagnostics(CC1Args->size(), CC1Args->data() + 1);\n    {\n      \/\/\n      \/\/  Buffer the error messages while we process\n      \/\/  the compiler options.\n      \/\/\n\n      \/\/ Set the language options, which cling needs\n      SetClingCustomLangOpts(CI->getLangOpts());\n\n      CI->getInvocation().getPreprocessorOpts().addMacroDef(\"__CLING__\");\n      if (CI->getTarget().getTriple().getOS() == llvm::Triple::Cygwin) {\n        \/\/ clang \"forgets\" the basic arch part needed by winnt.h:\n        if (CI->getTarget().getTriple().getArch() == llvm::Triple::x86) {\n          CI->getInvocation().getPreprocessorOpts().addMacroDef(\"_X86_=1\");\n        } else if (CI->getTarget().getTriple().getArch()\n                   == llvm::Triple::x86_64) {\n          CI->getInvocation().getPreprocessorOpts().addMacroDef(\"__x86_64=1\");\n        } else {\n           llvm::errs() << \"Warning: unhandled target architecture \"\n                        << CI->getTarget().getTriple().getArchName() << '\\n';\n        }\n      }\n\n      if (CI->getDiagnostics().hasErrorOccurred()) {\n        delete CI;\n        CI = 0;\n        return 0;\n      }\n    }\n    CI->setTarget(TargetInfo::CreateTargetInfo(CI->getDiagnostics(),\n                                               Invocation->getTargetOpts()));\n    if (!CI->hasTarget()) {\n      delete CI;\n      CI = 0;\n      return 0;\n    }\n    CI->getTarget().setForcedLangOptions(CI->getLangOpts());\n    SetClingTargetLangOpts(CI->getLangOpts(), CI->getTarget());\n\n    \/\/ Set up source and file managers\n    CI->createFileManager();\n    CI->createSourceManager(CI->getFileManager());\n\n    \/\/ Set up the memory buffer\n    if (buffer)\n      CI->getSourceManager().createMainFileIDForMemBuffer(buffer);\n\n    \/\/ Set up the preprocessor\n    CI->createPreprocessor();\n    Preprocessor& PP = CI->getPreprocessor();\n    PP.getBuiltinInfo().InitializeBuiltins(PP.getIdentifierTable(),\n                                           PP.getLangOpts());\n\n    \/\/ Set up the ASTContext\n    ASTContext *Ctx = new ASTContext(CI->getLangOpts(),\n                                     PP.getSourceManager(), &CI->getTarget(),\n                                     PP.getIdentifierTable(),\n                                     PP.getSelectorTable(), PP.getBuiltinInfo(),\n                                     \/*size_reserve*\/0, \/*DelayInit*\/false);\n    CI->setASTContext(Ctx);\n\n    \/\/ Set up the ASTConsumers\n    CI->setASTConsumer(new DeclCollector());\n\n    \/\/ Set up Sema\n    CodeCompleteConsumer* CCC = 0;\n    CI->createSema(TU_Complete, CCC);\n\n    \/\/ Set CodeGen options\n    \/\/ CI->getCodeGenOpts().DebugInfo = 1; \/\/ want debug info\n    \/\/ CI->getCodeGenOpts().EmitDeclMetadata = 1; \/\/ For unloading, for later\n    CI->getCodeGenOpts().OptimizationLevel = 0; \/\/ see pure SSA, that comes out\n    CI->getCodeGenOpts().CXXCtorDtorAliases = 0; \/\/ aliasing the complete\n                                                 \/\/ ctor to the base ctor causes\n                                                 \/\/ the JIT to crash\n    \/\/ When asserts are on, TURN ON not compare the VerifyModule\n    assert(CI->getCodeGenOpts().VerifyModule = 1);\n    return CI;\n  }\n\n  void CIFactory::SetClingCustomLangOpts(LangOptions& Opts) {\n    Opts.EmitAllDecls = 1;\n    Opts.Exceptions = 1;\n    Opts.CXXExceptions = 1;\n    Opts.Deprecated = 1;\n    Opts.Modules = 1;\n  }\n\n  void CIFactory::SetClingTargetLangOpts(LangOptions& Opts,\n                                         const TargetInfo& Target) {\n    if (Target.getTriple().getOS() == llvm::Triple::Win32) {\n      Opts.MicrosoftExt = 1;\n      Opts.MSCVersion = 1300;\n      \/\/ Should fix http:\/\/llvm.org\/bugs\/show_bug.cgi?id=10528\n      Opts.DelayedTemplateParsing = 1;\n    } else {\n      Opts.MicrosoftExt = 0;\n    }\n  }\n} \/\/ end namespace\n<commit_msg>Move target-specific -D after the definition of the target!<commit_after>\/\/--------------------------------------------------------------------*- C++ -*-\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\n\/\/ version: $Id$\n\/\/ author:  Axel Naumann <axel@cern.ch>\n\/\/------------------------------------------------------------------------------\n\n#include \"cling\/Interpreter\/CIFactory.h\"\n\n#include \"DeclCollector.h\"\n\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/Basic\/TargetInfo.h\"\n#include \"clang\/Basic\/Version.h\"\n#include \"clang\/Driver\/ArgList.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\/TextDiagnosticPrinter.h\"\n#include \"clang\/Lex\/Preprocessor.h\"\n\n#include \"llvm\/LLVMContext.h\"\n#include \"llvm\/Target\/TargetOptions.h\"\n#include \"llvm\/Support\/Host.h\"\n#include \"llvm\/Support\/TargetSelect.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include \"llvm\/Support\/Path.h\"\n\nusing namespace clang;\n\nnamespace cling {\n  \/\/\n  \/\/  Dummy function so we can use dladdr to find the executable path.\n  \/\/\n  void locate_cling_executable()\n  {\n  }\n\n  \/\/\/ \\brief Retrieves the clang CC1 specific flags out of the compilation's\n  \/\/\/ jobs. Returns NULL on error.\n  static const clang::driver::ArgStringList\n  *GetCC1Arguments(clang::DiagnosticsEngine *Diagnostics,\n                   clang::driver::Compilation *Compilation) {\n    \/\/ We expect to get back exactly one Command job, if we didn't something\n    \/\/ failed. Extract that job from the Compilation.\n    const clang::driver::JobList &Jobs = Compilation->getJobs();\n    if (!Jobs.size() || !isa<clang::driver::Command>(*Jobs.begin())) {\n      \/\/ diagnose this...\n      return NULL;\n    }\n\n    \/\/ The one job we find should be to invoke clang again.\n    const clang::driver::Command *Cmd\n      = cast<clang::driver::Command>(*Jobs.begin());\n    if (llvm::StringRef(Cmd->getCreator().getName()) != \"clang\") {\n      \/\/ diagnose this...\n      return NULL;\n    }\n\n    return &Cmd->getArguments();\n  }\n\n  CompilerInstance* CIFactory::createCI(llvm::StringRef code,\n                                        int argc,\n                                        const char* const *argv,\n                                        const char* llvmdir) {\n    return createCI(llvm::MemoryBuffer::getMemBuffer(code), argc, argv,\n                    llvmdir);\n  }\n\n  CompilerInstance* CIFactory::createCI(llvm::MemoryBuffer* buffer,\n                                        int argc,\n                                        const char* const *argv,\n                                        const char* llvmdir) {\n    \/\/ Create an instance builder, passing the llvmdir and arguments.\n    \/\/\n    \/\/  Initialize the llvm library.\n    llvm::InitializeNativeTarget();\n    llvm::InitializeAllAsmPrinters();\n    llvm::sys::Path resource_path;\n    if (llvmdir) {\n      resource_path = llvmdir;\n      resource_path.appendComponent(\"lib\");\n      resource_path.appendComponent(\"clang\");\n      resource_path.appendComponent(CLANG_VERSION_STRING);\n    } else {\n      \/\/ FIXME: The first arg really does need to be argv[0] on FreeBSD.\n      \/\/\n      \/\/ Note: The second arg is not used for Apple, FreeBSD, Linux,\n      \/\/       or cygwin, and can only be used on systems which support\n      \/\/       the use of dladdr().\n      \/\/\n      \/\/ Note: On linux and cygwin this uses \/proc\/self\/exe to find the path.\n      \/\/\n      \/\/ Note: On Apple it uses _NSGetExecutablePath().\n      \/\/\n      \/\/ Note: On FreeBSD it uses getprogpath().\n      \/\/\n      \/\/ Note: Otherwise it uses dladdr().\n      \/\/\n      resource_path\n        = CompilerInvocation::GetResourcesPath(\"cling\",\n                                       (void*)(intptr_t) locate_cling_executable\n                                               );\n    }\n    if (!resource_path.canRead()) {\n      llvm::errs()\n        << \"ERROR in cling::CIFactory::createCI():\\n  resource directory \"\n        << resource_path.str() << \" not found!\\n\";\n      resource_path = \"\";\n    }\n\n    \/\/______________________________________\n    DiagnosticOptions DefaultDiagnosticOptions;\n    DefaultDiagnosticOptions.ShowColors = 1;\n    TextDiagnosticPrinter* DiagnosticPrinter\n      = new TextDiagnosticPrinter(llvm::errs(), DefaultDiagnosticOptions);\n    llvm::IntrusiveRefCntPtr<clang::DiagnosticIDs> DiagIDs(new DiagnosticIDs());\n    DiagnosticsEngine* Diagnostics\n      = new DiagnosticsEngine(DiagIDs, DiagnosticPrinter,\n                              \/*Owns it*\/ true); \/\/ LEAKS!\n\n    std::vector<const char*> argvCompile(argv, argv + argc);\n    \/\/ We do C++ by default; append right after argv[0] name\n    \/\/ Only insert it if there is no other \"-x\":\n    bool haveMinusX = false;\n    for (const char* const* iarg = argv; !haveMinusX && iarg < argv + argc;\n         ++iarg) {\n      haveMinusX = !strcmp(*iarg, \"-x\");\n    }\n    if (!haveMinusX) {\n      argvCompile.insert(argvCompile.begin() + 1,\"-x\");\n      argvCompile.insert(argvCompile.begin() + 2, \"c++\");\n    }\n    argvCompile.push_back(\"-c\");\n    argvCompile.push_back(\"-\");\n\n    bool IsProduction = false;\n    assert(IsProduction = true && \"set IsProduction if asserts are on.\");\n    clang::driver::Driver Driver(argv[0], llvm::sys::getDefaultTargetTriple(),\n                                 \"cling.out\",\n                                 IsProduction,\n                                 *Diagnostics);\n    \/\/Driver.setWarnMissingInput(false);\n    Driver.setCheckInputsExist(false); \/\/ think foo.C(12)\n    llvm::ArrayRef<const char*>RF(&(argvCompile[0]), argvCompile.size());\n    llvm::OwningPtr<clang::driver::Compilation>\n      Compilation(Driver.BuildCompilation(RF));\n    const clang::driver::ArgStringList* CC1Args\n      = GetCC1Arguments(Diagnostics, Compilation.get());\n    if (CC1Args == NULL) {\n      return 0;\n    }\n    clang::CompilerInvocation*\n      Invocation = new clang::CompilerInvocation;\n    clang::CompilerInvocation::CreateFromArgs(*Invocation, CC1Args->data() + 1,\n                                              CC1Args->data() + CC1Args->size(),\n                                              *Diagnostics);\n    Invocation->getFrontendOpts().DisableFree = true;\n\n    if (Invocation->getHeaderSearchOpts().UseBuiltinIncludes &&\n        !resource_path.empty()) {\n      \/\/ Update ResourceDir\n      \/\/ header search opts' entry for resource_path\/include isn't\n      \/\/ updated by providing a new resource path; update it manually.\n      clang::HeaderSearchOptions& Opts = Invocation->getHeaderSearchOpts();\n      llvm::sys::Path oldResInc(Opts.ResourceDir);\n      oldResInc.appendComponent(\"include\");\n      llvm::sys::Path newResInc(resource_path);\n      newResInc.appendComponent(\"include\");\n      bool foundOldResInc = false;\n      for (unsigned i = 0, e = Opts.UserEntries.size();\n           !foundOldResInc && i != e; ++i) {\n        HeaderSearchOptions::Entry &E = Opts.UserEntries[i];\n        if (!E.IsUserSupplied && !E.IsFramework\n            && E.Group == clang::frontend::System && E.IgnoreSysRoot\n            && E.IsInternal && !E.ImplicitExternC\n            && oldResInc.str() == E.Path) {\n          E.Path = newResInc.str();\n          foundOldResInc = true;\n        }\n      }\n\n      Opts.ResourceDir = resource_path.str();\n    }\n\n    \/\/ Create and setup a compiler instance.\n    CompilerInstance* CI = new CompilerInstance();\n    CI->setInvocation(Invocation);\n\n    CI->createDiagnostics(CC1Args->size(), CC1Args->data() + 1);\n    {\n      \/\/\n      \/\/  Buffer the error messages while we process\n      \/\/  the compiler options.\n      \/\/\n\n      \/\/ Set the language options, which cling needs\n      SetClingCustomLangOpts(CI->getLangOpts());\n\n      CI->getInvocation().getPreprocessorOpts().addMacroDef(\"__CLING__\");\n      if (CI->getDiagnostics().hasErrorOccurred()) {\n        delete CI;\n        CI = 0;\n        return 0;\n      }\n    }\n    CI->setTarget(TargetInfo::CreateTargetInfo(CI->getDiagnostics(),\n                                               Invocation->getTargetOpts()));\n    if (!CI->hasTarget()) {\n      delete CI;\n      CI = 0;\n      return 0;\n    }\n    CI->getTarget().setForcedLangOptions(CI->getLangOpts());\n    SetClingTargetLangOpts(CI->getLangOpts(), CI->getTarget());\n    if (CI->getTarget().getTriple().getOS() == llvm::Triple::Cygwin) {\n      \/\/ clang \"forgets\" the basic arch part needed by winnt.h:\n      if (CI->getTarget().getTriple().getArch() == llvm::Triple::x86) {\n        CI->getInvocation().getPreprocessorOpts().addMacroDef(\"_X86_=1\");\n      } else if (CI->getTarget().getTriple().getArch()\n                 == llvm::Triple::x86_64) {\n        CI->getInvocation().getPreprocessorOpts().addMacroDef(\"__x86_64=1\");\n      } else {\n        llvm::errs() << \"Warning: unhandled target architecture \"\n                     << CI->getTarget().getTriple().getArchName() << '\\n';\n      }\n    }\n\n    \/\/ Set up source and file managers\n    CI->createFileManager();\n    CI->createSourceManager(CI->getFileManager());\n\n    \/\/ Set up the memory buffer\n    if (buffer)\n      CI->getSourceManager().createMainFileIDForMemBuffer(buffer);\n\n    \/\/ Set up the preprocessor\n    CI->createPreprocessor();\n    Preprocessor& PP = CI->getPreprocessor();\n    PP.getBuiltinInfo().InitializeBuiltins(PP.getIdentifierTable(),\n                                           PP.getLangOpts());\n\n    \/\/ Set up the ASTContext\n    ASTContext *Ctx = new ASTContext(CI->getLangOpts(),\n                                     PP.getSourceManager(), &CI->getTarget(),\n                                     PP.getIdentifierTable(),\n                                     PP.getSelectorTable(), PP.getBuiltinInfo(),\n                                     \/*size_reserve*\/0, \/*DelayInit*\/false);\n    CI->setASTContext(Ctx);\n\n    \/\/ Set up the ASTConsumers\n    CI->setASTConsumer(new DeclCollector());\n\n    \/\/ Set up Sema\n    CodeCompleteConsumer* CCC = 0;\n    CI->createSema(TU_Complete, CCC);\n\n    \/\/ Set CodeGen options\n    \/\/ CI->getCodeGenOpts().DebugInfo = 1; \/\/ want debug info\n    \/\/ CI->getCodeGenOpts().EmitDeclMetadata = 1; \/\/ For unloading, for later\n    CI->getCodeGenOpts().OptimizationLevel = 0; \/\/ see pure SSA, that comes out\n    CI->getCodeGenOpts().CXXCtorDtorAliases = 0; \/\/ aliasing the complete\n                                                 \/\/ ctor to the base ctor causes\n                                                 \/\/ the JIT to crash\n    \/\/ When asserts are on, TURN ON not compare the VerifyModule\n    assert(CI->getCodeGenOpts().VerifyModule = 1);\n    return CI;\n  }\n\n  void CIFactory::SetClingCustomLangOpts(LangOptions& Opts) {\n    Opts.EmitAllDecls = 1;\n    Opts.Exceptions = 1;\n    Opts.CXXExceptions = 1;\n    Opts.Deprecated = 1;\n    Opts.Modules = 1;\n  }\n\n  void CIFactory::SetClingTargetLangOpts(LangOptions& Opts,\n                                         const TargetInfo& Target) {\n    if (Target.getTriple().getOS() == llvm::Triple::Win32) {\n      Opts.MicrosoftExt = 1;\n      Opts.MSCVersion = 1300;\n      \/\/ Should fix http:\/\/llvm.org\/bugs\/show_bug.cgi?id=10528\n      Opts.DelayedTemplateParsing = 1;\n    } else {\n      Opts.MicrosoftExt = 0;\n    }\n  }\n} \/\/ end namespace\n<|endoftext|>"}
{"text":"<commit_before>#include \"gl\/vao.h\"\n#include \"gl\/glError.h\"\n#include \"gl\/renderState.h\"\n#include \"gl\/shaderProgram.h\"\n#include \"gl\/vertexLayout.h\"\n#include <unordered_map>\n\nnamespace Tangram {\n\nvoid Vao::initialize(RenderState& rs, ShaderProgram& _program, const VertexOffsets& _vertexOffsets,\n                     VertexLayout& _layout, GLuint _vertexBuffer, GLuint _indexBuffer) {\n\n    m_glVAOs.resize(_vertexOffsets.size());\n\n    GL::genVertexArrays(m_glVAOs.size(), m_glVAOs.data());\n\n    fastmap<std::string, GLuint> locations;\n\n    \/\/ FIXME (use a bindAttrib instead of getLocation) to make those locations shader independent\n    for (auto& attrib : _layout.getAttribs()) {\n        GLint location = _program.getAttribLocation(attrib.name);\n        locations[attrib.name] = location;\n    }\n\n    int vertexOffset = 0;\n    for (size_t i = 0; i < _vertexOffsets.size(); ++i) {\n        auto vertexIndexOffset = _vertexOffsets[i];\n        int nVerts = vertexIndexOffset.second;\n        GL::bindVertexArray(m_glVAOs[i]);\n\n        rs.vertexBufferUnset(_vertexBuffer);\n        rs.vertexBuffer(_vertexBuffer);\n\n        if (_indexBuffer != 0) {\n            rs.indexBufferUnset(_indexBuffer);\n            rs.indexBuffer(_indexBuffer);\n        }\n\n        \/\/ Enable vertex layout on the specified locations\n        _layout.enable(locations, vertexOffset * _layout.getStride());\n\n        vertexOffset += nVerts;\n    }\n\n    GL::bindVertexArray(0);\n}\n\nbool Vao::isInitialized() {\n    return !m_glVAOs.empty();\n}\n\nvoid Vao::bind(unsigned int _index) {\n    if (_index < m_glVAOs.size()) {\n        GL::bindVertexArray(m_glVAOs[_index]);\n    }\n}\n\nvoid Vao::unbind() {\n    GL::bindVertexArray(0);\n}\n\nvoid Vao::dispose() {\n    if (!m_glVAOs.empty()) {\n        GL::deleteVertexArrays(m_glVAOs.size(), m_glVAOs.data());\n        m_glVAOs.clear();\n    }\n}\n\n}\n<commit_msg>Only index buffer needs to be re-bound for each VAO (#1462)<commit_after>#include \"gl\/vao.h\"\n#include \"gl\/glError.h\"\n#include \"gl\/renderState.h\"\n#include \"gl\/shaderProgram.h\"\n#include \"gl\/vertexLayout.h\"\n#include <unordered_map>\n\nnamespace Tangram {\n\nvoid Vao::initialize(RenderState& rs, ShaderProgram& _program, const VertexOffsets& _vertexOffsets,\n                     VertexLayout& _layout, GLuint _vertexBuffer, GLuint _indexBuffer) {\n\n    m_glVAOs.resize(_vertexOffsets.size());\n\n    GL::genVertexArrays(m_glVAOs.size(), m_glVAOs.data());\n\n    fastmap<std::string, GLuint> locations;\n\n    \/\/ FIXME (use a bindAttrib instead of getLocation) to make those locations shader independent\n    for (auto& attrib : _layout.getAttribs()) {\n        GLint location = _program.getAttribLocation(attrib.name);\n        locations[attrib.name] = location;\n    }\n\n    rs.vertexBuffer(_vertexBuffer);\n\n    int vertexOffset = 0;\n    for (size_t i = 0; i < _vertexOffsets.size(); ++i) {\n        auto vertexIndexOffset = _vertexOffsets[i];\n        int nVerts = vertexIndexOffset.second;\n        GL::bindVertexArray(m_glVAOs[i]);\n\n        \/\/ ELEMENT_ARRAY_BUFFER must be bound after bindVertexArray to be used by VAO\n        if (_indexBuffer != 0) {\n            rs.indexBufferUnset(_indexBuffer);\n            rs.indexBuffer(_indexBuffer);\n        }\n\n        \/\/ Enable vertex layout on the specified locations\n        _layout.enable(locations, vertexOffset * _layout.getStride());\n\n        vertexOffset += nVerts;\n    }\n\n    GL::bindVertexArray(0);\n\n    rs.vertexBuffer(0);\n    rs.indexBuffer(0);\n}\n\nbool Vao::isInitialized() {\n    return !m_glVAOs.empty();\n}\n\nvoid Vao::bind(unsigned int _index) {\n    if (_index < m_glVAOs.size()) {\n        GL::bindVertexArray(m_glVAOs[_index]);\n    }\n}\n\nvoid Vao::unbind() {\n    GL::bindVertexArray(0);\n}\n\nvoid Vao::dispose() {\n    if (!m_glVAOs.empty()) {\n        GL::deleteVertexArrays(m_glVAOs.size(), m_glVAOs.data());\n        m_glVAOs.clear();\n    }\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"aquila\/global.h\"\n#include \"aquila\/functions.h\"\n#include \"aquila\/source\/generator\/SineGenerator.h\"\n#include \"aquila\/source\/FramesCollection.h\"\n#include \"aquila\/transform\/Spectrogram.h\"\n#include <QApplication>\n#include <QMainWindow>\n#include <qwt_plot.h>\n#include <qwt_plot_spectrogram.h>\n#include <qwt_raster_data.h>\n\nclass SpectrogramData : public QwtRasterData\n{\npublic:\n    SpectrogramData(const Aquila::Spectrogram& spectrogram):\n        m_spectrogram(spectrogram)\n    {\n        setInterval(Qt::XAxis, QwtInterval(0.0, m_spectrogram.getFrameCount()));\n        setInterval(Qt::YAxis, QwtInterval(0.0, m_spectrogram.getSpectrumSize() \/ 2));\n        setInterval(Qt::ZAxis, QwtInterval(0.0, 50));\n    }\n\n    double value(double x, double y) const\n    {\n        std::size_t frame = Aquila::clamp(0ul, static_cast<std::size_t>(x), m_spectrogram.getFrameCount() - 1ul);\n        std::size_t peak = Aquila::clamp(0ul, static_cast<std::size_t>(y), m_spectrogram.getSpectrumSize() - 1ul);\n        return 20.0 * std::log10(std::abs(m_spectrogram.getPoint(frame, peak)));\n    }\n\nprivate:\n    const Aquila::Spectrogram& m_spectrogram;\n};\n\n\nint main(int argc, char *argv[])\n{\n    const Aquila::FrequencyType sampleFrequency = 44100;\n    const std::size_t SIZE = sampleFrequency * 2;\n\n    Aquila::SineGenerator generator(sampleFrequency);\n    generator.setAmplitude(5).setFrequency(1000).generate(SIZE);\n    Aquila::FramesCollection frames(generator, 1024);\n    Aquila::Spectrogram spectrogram(frames);\n\n    QApplication a(argc, argv);\n    auto plot = new QwtPlot();\n    plot->setTitle(\"Spectrogram\");\n\n    auto plotSpectrogram = new QwtPlotSpectrogram();\n    auto data = new SpectrogramData(spectrogram);\n    plotSpectrogram->setData(data);\n    plotSpectrogram->attach(plot);\n\n    plot->show();\n    return a.exec();\n}\n<commit_msg>Prettier color map.<commit_after>#include \"aquila\/global.h\"\n#include \"aquila\/functions.h\"\n#include \"aquila\/source\/generator\/SineGenerator.h\"\n#include \"aquila\/source\/FramesCollection.h\"\n#include \"aquila\/transform\/Spectrogram.h\"\n#include <QApplication>\n#include <QMainWindow>\n#include <qwt_color_map.h>\n#include <qwt_plot.h>\n#include <qwt_plot_spectrogram.h>\n#include <qwt_raster_data.h>\n\nclass SpectrogramData : public QwtRasterData\n{\npublic:\n    SpectrogramData(const Aquila::Spectrogram& spectrogram):\n        m_spectrogram(spectrogram)\n    {\n        setInterval(Qt::XAxis, QwtInterval(0.0, m_spectrogram.getFrameCount()));\n        setInterval(Qt::YAxis, QwtInterval(0.0, m_spectrogram.getSpectrumSize() \/ 2));\n        setInterval(Qt::ZAxis, QwtInterval(0.0, 50));\n    }\n\n    double value(double x, double y) const\n    {\n        std::size_t frame = Aquila::clamp(0ul, static_cast<std::size_t>(x), m_spectrogram.getFrameCount() - 1ul);\n        std::size_t peak = Aquila::clamp(0ul, static_cast<std::size_t>(y), m_spectrogram.getSpectrumSize() - 1ul);\n        return 20.0 * std::log10(std::abs(m_spectrogram.getPoint(frame, peak)));\n    }\n\nprivate:\n    const Aquila::Spectrogram& m_spectrogram;\n};\n\n\nint main(int argc, char *argv[])\n{\n    const Aquila::FrequencyType sampleFrequency = 44100;\n    const std::size_t SIZE = sampleFrequency * 2;\n\n    Aquila::SineGenerator generator(sampleFrequency);\n    generator.setAmplitude(5).setFrequency(1000).generate(SIZE);\n    Aquila::FramesCollection frames(generator, 1024);\n    Aquila::Spectrogram spectrogram(frames);\n\n    QApplication a(argc, argv);\n    auto plot = new QwtPlot();\n    plot->setTitle(\"Spectrogram\");\n\n    auto plotSpectrogram = new QwtPlotSpectrogram();\n    QwtLinearColorMap colorMap(Qt::black, Qt::red);\n    colorMap.addColorStop(0.3, Qt::darkBlue);\n    colorMap.addColorStop(0.4, Qt::blue);\n    colorMap.addColorStop(0.65, Qt::green);\n    colorMap.addColorStop(0.85, Qt::yellow);\n    plotSpectrogram->setColorMap(&colorMap);\n    auto data = new SpectrogramData(spectrogram);\n    plotSpectrogram->setData(data);\n    plotSpectrogram->attach(plot);\n\n    plot->show();\n    return a.exec();\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\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  \\brief   Implements RAII for the Lua stack.\n           For internal LuaScripting uses only. Requires an unshared pointer to\n           LuaScripting, and is only meant to exist for the lifetime of one\n           block.\n*\/\n\n#include <vector>\n\n#include \"LuaScripting.h\"\n#include \"LuaStackRAII.h\"\n\nusing namespace std;\n\n\/\/#define TUVOK_LUARAII_ASSERT\n\nnamespace tuvok\n{\n\n\/\/-----------------------------------------------------------------------------\nLuaStackRAII::LuaStackRAII(lua_State* L, int valsConsumed, int valsReturned)\n{\n  mL = L;\n\n  mInitialStackTop      = lua_gettop(mL);\n  mValsConsumed         = valsConsumed;\n  mValsReturned         = valsReturned;\n\n  if (valsConsumed < 0)\n    throw LuaError(\"LuaStackRAII valsConsumed must be >= 0.\");\n  if (valsReturned < 0)\n    throw LuaError(\"LuaStackRAII valsReturned must be >= 0.\");\n}\n\n\/\/-----------------------------------------------------------------------------\nstatic void luaStackRAIIInternalDoString(lua_State* mL, std::string str)\n{\n  luaL_dostring(mL, str.c_str());\n}\n\n\/\/-----------------------------------------------------------------------------\nLuaStackRAII::~LuaStackRAII()\n{\n  int stackTop = lua_gettop(mL);\n  int stackTarget = mInitialStackTop - mValsConsumed + mValsReturned;\n\n  if (stackTop != stackTarget)\n  {\n    lua_getfield(mL, LUA_REGISTRYINDEX,\n                 LuaScripting::REG_EXPECTED_EXCEPTION_FLAG);\n    bool expected = lua_toboolean(mL, -1) ? true : false;\n    lua_pop(mL, 1);\n\n    \/\/ Pull value out of the Lua register to see if this is really an\n    \/\/ error, or an expected event (in the case of unit testing this would\n    \/\/ likely be an expected exception)\n    if (expected == false)\n    {\n      \/\/ Take advantage of the fact that this class will be used in conjunction\n      \/\/ with LuaScripting.\n      ostringstream os;\n      os << \"log.error([==[LuaStackRAII: unexpected stack size. Expected: \";\n      os << stackTarget << \". Actual: \" << stackTop << \".\";\n\n      \/\/ To ensure we don't wipe out Lua error messages (generally, these will\n      \/\/ be caught by lua_atpanic).\n      if (lua_isstring(mL, -1))\n      {\n        std::string str = lua_tostring(mL, -1);\n        os << \" String on the top of the stack: \" << str;\n      }\n\n      os << \"]==])\";\n\n      \/\/luaL_dostring(mL, os.str().c_str());\n      luaStackRAIIInternalDoString(mL, os.str());\n\n#ifdef TUVOK_LUARAII_ASSERT\n      assert(stackTop == stackTarget);\n#endif\n    }\n\n    \/\/ Ensure stack ends up at the stack target (RAII)\n    if (mValsReturned == 0)\n    {\n      \/\/ Simply set the top to the stack target.\n      lua_settop(mL, stackTarget);\n    }\n    else\n    {\n      \/\/ NOTE: In this case, we can't just set the top to stack target. \n      \/\/       Doing that will wipe out any potential return values.\n\n      \/\/ Calculate absolute position removal index.\n      int curTop = lua_gettop(mL);\n\n      \/\/ Keep removing values from the stack until we get to the stack target.\n      while (curTop > stackTarget)\n      {\n        lua_remove(mL, lua_gettop(mL) - mValsReturned);\n        curTop = lua_gettop(mL);\n      }\n    }\n\n  }\n}\n\n}\n<commit_msg>Changing LuaStackRAII error to warnings.<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\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  \\brief   Implements RAII for the Lua stack.\n           For internal LuaScripting uses only. Requires an unshared pointer to\n           LuaScripting, and is only meant to exist for the lifetime of one\n           block.\n*\/\n\n#include <vector>\n\n#include \"LuaScripting.h\"\n#include \"LuaStackRAII.h\"\n\nusing namespace std;\n\n\/\/#define TUVOK_LUARAII_ASSERT\n\nnamespace tuvok\n{\n\n\/\/-----------------------------------------------------------------------------\nLuaStackRAII::LuaStackRAII(lua_State* L, int valsConsumed, int valsReturned)\n{\n  mL = L;\n\n  mInitialStackTop      = lua_gettop(mL);\n  mValsConsumed         = valsConsumed;\n  mValsReturned         = valsReturned;\n\n  if (valsConsumed < 0)\n    throw LuaError(\"LuaStackRAII valsConsumed must be >= 0.\");\n  if (valsReturned < 0)\n    throw LuaError(\"LuaStackRAII valsReturned must be >= 0.\");\n}\n\n\/\/-----------------------------------------------------------------------------\nstatic void luaStackRAIIInternalDoString(lua_State* mL, std::string str)\n{\n  luaL_dostring(mL, str.c_str());\n}\n\n\/\/-----------------------------------------------------------------------------\nLuaStackRAII::~LuaStackRAII()\n{\n  int stackTop = lua_gettop(mL);\n  int stackTarget = mInitialStackTop - mValsConsumed + mValsReturned;\n\n  if (stackTop != stackTarget)\n  {\n    lua_getfield(mL, LUA_REGISTRYINDEX,\n                 LuaScripting::REG_EXPECTED_EXCEPTION_FLAG);\n    bool expected = lua_toboolean(mL, -1) ? true : false;\n    lua_pop(mL, 1);\n\n    \/\/ Pull value out of the Lua register to see if this is really an\n    \/\/ error, or an expected event (in the case of unit testing this would\n    \/\/ likely be an expected exception)\n    if (expected == false)\n    {\n      \/\/ Take advantage of the fact that this class will be used in conjunction\n      \/\/ with LuaScripting.\n      ostringstream os;\n      os << \"log.warn([==[LuaStackRAII: unexpected stack size. Expected: \";\n      os << stackTarget << \". Actual: \" << stackTop << \".\";\n\n      \/\/ To ensure we don't wipe out Lua error messages (generally, these will\n      \/\/ be caught by lua_atpanic).\n      if (lua_isstring(mL, -1))\n      {\n        std::string str = lua_tostring(mL, -1);\n        os << \" String on the top of the stack: \" << str;\n      }\n\n      os << \"]==])\";\n\n      \/\/luaL_dostring(mL, os.str().c_str());\n      luaStackRAIIInternalDoString(mL, os.str());\n\n#ifdef TUVOK_LUARAII_ASSERT\n      assert(stackTop == stackTarget);\n#endif\n    }\n\n    \/\/ Ensure stack ends up at the stack target (RAII)\n    if (mValsReturned == 0)\n    {\n      \/\/ Simply set the top to the stack target.\n      lua_settop(mL, stackTarget);\n    }\n    else\n    {\n      \/\/ NOTE: In this case, we can't just set the top to stack target. \n      \/\/       Doing that will wipe out any potential return values.\n\n      \/\/ Calculate absolute position removal index.\n      int curTop = lua_gettop(mL);\n\n      \/\/ Keep removing values from the stack until we get to the stack target.\n      while (curTop > stackTarget)\n      {\n        lua_remove(mL, lua_gettop(mL) - mValsReturned);\n        curTop = lua_gettop(mL);\n      }\n    }\n\n  }\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Created by Vadim N. on 04\/04\/2015.\n\/\/\n\n\n\/**\n * \\brief Main function of a script for the statistical inference of marginal probabilities. It has\n * a strict order of input arguments in console:\n * - path to a file with immune receptors\n * - path to a basic model\n * - path to an output model folder\n * - which algorithm to use\n * - algorithms parameters\n *\/\nint main() {\n    return 0;\n}<commit_msg>add a bit of C++ code for inference<commit_after>\/\/\n\/\/ Created by Vadim N. on 04\/04\/2015.\n\/\/\n\n\n#include <ostream>\n\n#include \"statisticalinferencealgorithm.h\"\n\n\nusing namespace ymir;\n\n\/**\n * \\brief Main function of a script for the statistical inference of marginal probabilities. It has\n * a strict order of input arguments in console:\n * argv[0] - name of the script (default);\n * argv[1] - path to a file with immune receptors\n * argv[2] - path to a basic model\n * argv[3] - path to an output model folder\n * argv[4] - which algorithm to use\n * argv[5], argv[6], ... - algorithms parameters in a form \"name\" - \"value\"\n *\/\nint main(int argc, char* argv[]) {\n    std::string in_file_path(argv[1]),\n            model_path(argv[2]),\n            out_model_path(argv[3]),\n            algo_id(argv[4]);\n\n    ProbabilisticAssemblingModel model(model_path);\n    StatisticalInferenceAlgorithm *infer_algo;\n    StatisticalInferenceAlgorithm::AlgorithmParameters params;\n\n    if (algo_id == \"em\") {\n        params = params.set(\"niter\", std::stoi(argv[6]));  \/\/ argv[5] == \"niter\"\n    }\n\n    RepertoireParser parser;\n    Cloneset cloneset;\n    parser.parse(in_file_path, &cloneset, model.gene_segments(),\n                 RepertoireParser::AlignmentColumnOptions()\n                         .setV(RepertoireParser::MAKE_IF_NOT_FOUND)\n                         .setJ(RepertoireParser::MAKE_IF_NOT_FOUND)\n                         .setD(RepertoireParser::OVERWRITE));\n\n    infer_algo->statisticalInference(cloneset, model, params);\n\n    model.save(out_model_path);\n\n    return 0;\n}<|endoftext|>"}
{"text":"<commit_before>\/**************************************************************************\n**\n** This file is part of Qt Creator\n**\n** Copyright (c) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n**\n** Contact: 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#include \"MatchingText.h\"\n#include \"BackwardsScanner.h\"\n\n#include <Token.h>\n\n#include <QtGui\/QTextDocument>\n#include <QtCore\/QtDebug>\n\nusing namespace CPlusPlus;\n\nenum { MAX_NUM_LINES = 20 };\n\nstatic bool shouldOverrideChar(const QChar &ch)\n{\n    switch (ch.unicode()) {\n    case ')': case ']': case ';': case '\"': case '\\'':\n        return true;\n\n    default:\n        return false;\n    }\n}\n\nstatic bool isCompleteStringLiteral(const BackwardsScanner &tk, int index)\n{\n    const QStringRef text = tk.textRef(index);\n\n    if (text.length() < 2)\n        return false;\n\n    else if (text.at(text.length() - 1) == QLatin1Char('\"'))\n        return text.at(text.length() - 2) != QLatin1Char('\\\\'); \/\/ ### not exactly.\n\n    return false;\n}\n\nstatic bool isCompleteCharLiteral(const BackwardsScanner &tk, int index)\n{\n    const QStringRef text = tk.textRef(index);\n\n    if (text.length() < 2)\n        return false;\n\n    else if (text.at(text.length() - 1) == QLatin1Char('\\''))\n        return text.at(text.length() - 2) != QLatin1Char('\\\\'); \/\/ ### not exactly.\n\n    return false;\n}\n\nMatchingText::MatchingText()\n{ }\n\nbool MatchingText::shouldInsertMatchingText(const QTextCursor &tc)\n{\n    QTextDocument *doc = tc.document();\n    return shouldInsertMatchingText(doc->characterAt(tc.selectionEnd()));\n}\n\nbool MatchingText::shouldInsertMatchingText(const QChar &lookAhead)\n{\n    switch (lookAhead.unicode()) {\n    case '{': case '}':\n    case ']': case ')':\n    case ';': case ',':\n        return true;\n\n    default:\n        if (lookAhead.isSpace())\n            return true;\n\n        return false;\n    } \/\/ switch\n}\n\nQString MatchingText::insertMatchingBrace(const QTextCursor &cursor, const QString &textToProcess,\n                                          const QChar &la, int *skippedChars) const\n{\n    QTextCursor tc = cursor;\n    QTextDocument *doc = tc.document();\n    QString text = textToProcess;\n\n    const QString blockText = tc.block().text().mid(tc.columnNumber());\n    const int length = qMin(blockText.length(), textToProcess.length());\n\n    const QChar previousChar = doc->characterAt(tc.selectionEnd() - 1);\n\n    bool escape = false;\n\n    if (! text.isEmpty() && (text.at(0) == QLatin1Char('\"') ||\n                             text.at(0) == QLatin1Char('\\''))) {\n        if (previousChar == QLatin1Char('\\\\')) {\n            int escapeCount = 0;\n            int index = tc.selectionEnd() - 1;\n            do {\n                ++escapeCount;\n                --index;\n            } while (doc->characterAt(index) == QLatin1Char('\\\\'));\n\n            if ((escapeCount % 2) != 0)\n                escape = true;\n        }\n    }\n\n    if (! escape) {\n        for (int i = 0; i < length; ++i) {\n            const QChar ch1 = blockText.at(i);\n            const QChar ch2 = textToProcess.at(i);\n\n            if (ch1 != ch2)\n                break;\n            else if (! shouldOverrideChar(ch1))\n                break;\n\n            ++*skippedChars;\n        }\n    }\n\n    if (*skippedChars != 0) {\n        tc.movePosition(QTextCursor::NextCharacter, QTextCursor::MoveAnchor, *skippedChars);\n        text = textToProcess.mid(*skippedChars);\n    }\n\n    if (text.isEmpty() || !shouldInsertMatchingText(la))\n        return QString();\n\n    BackwardsScanner tk(tc, textToProcess.left(*skippedChars), MAX_NUM_LINES);\n    const int startToken = tk.startToken();\n    int index = startToken;\n\n    const SimpleToken &token = tk[index - 1];\n\n    if (text.at(0) == QLatin1Char('\"') && (token.is(T_STRING_LITERAL) || token.is(T_WIDE_STRING_LITERAL))) {\n        if (text.length() != 1)\n            qWarning() << Q_FUNC_INFO << \"handle event compression\";\n\n        if (isCompleteStringLiteral(tk, index - 1))\n            return QLatin1String(\"\\\"\");\n\n        return QString();\n    } else if (text.at(0) == QLatin1Char('\\'') && (token.is(T_CHAR_LITERAL) || token.is(T_WIDE_CHAR_LITERAL))) {\n        if (text.length() != 1)\n            qWarning() << Q_FUNC_INFO << \"handle event compression\";\n\n        if (isCompleteCharLiteral(tk, index - 1))\n            return QLatin1String(\"'\");\n\n        return QString();\n    }\n\n    QString result;\n\n    foreach (const QChar &ch, text) {\n        if      (ch == QLatin1Char('('))  result += ')';\n        else if (ch == QLatin1Char('['))  result += ']';\n        else if (ch == QLatin1Char('\"'))  result += '\"';\n        else if (ch == QLatin1Char('\\'')) result += '\\'';\n    }\n\n    return result;\n}\n\nbool MatchingText::shouldInsertNewline(const QTextCursor &tc) const\n{\n    QTextDocument *doc = tc.document();\n    int pos = tc.selectionEnd();\n\n    \/\/ count the number of empty lines.\n    int newlines = 0;\n    for (int e = doc->characterCount(); pos != e; ++pos) {\n        const QChar ch = doc->characterAt(pos);\n\n        if (! ch.isSpace())\n            break;\n        else if (ch == QChar::ParagraphSeparator)\n            ++newlines;\n    }\n\n    if (newlines <= 1 && doc->characterAt(pos) != QLatin1Char('}'))\n        return true;\n\n    return false;\n}\n\nQString MatchingText::insertParagraphSeparator(const QTextCursor &tc) const\n{\n    BackwardsScanner tk(tc, QString(), MAX_NUM_LINES);\n    int index = tk.startToken();\n\n    if (tk[index - 1].isNot(T_LBRACE))\n        return QString(); \/\/ nothing to do.\n\n    const QString textBlock = tc.block().text().mid(tc.columnNumber()).trimmed();\n    if (! textBlock.isEmpty())\n        return QString();\n\n    --index; \/\/ consume the `{'\n\n    const SimpleToken &token = tk[index - 1];\n\n    if (token.is(T_STRING_LITERAL) && tk[index - 2].is(T_EXTERN)) {\n        \/\/ recognized extern \"C\"\n        return QLatin1String(\"}\");\n\n    } else if (token.is(T_IDENTIFIER)) {\n        int i = index - 1;\n\n        forever {\n            const SimpleToken &current = tk[i - 1];\n\n            if (current.is(T_EOF_SYMBOL))\n                break;\n\n            else if (current.is(T_CLASS) || current.is(T_STRUCT) || current.is(T_UNION) || current.is(T_ENUM)) {\n                \/\/ found a class key.\n                QString str = QLatin1String(\"};\");\n\n                if (shouldInsertNewline(tc))\n                    str += QLatin1Char('\\n');\n\n                return str;\n            }\n\n            else if (current.is(T_NAMESPACE))\n                return QLatin1String(\"}\"); \/\/ found a namespace declaration\n\n            else if (current.is(T_SEMICOLON))\n                break; \/\/ found the `;' sync token\n\n            else if (current.is(T_LBRACE) || current.is(T_RBRACE))\n                break; \/\/ braces are considered sync tokens\n\n            else if (current.is(T_LPAREN) || current.is(T_RPAREN))\n                break; \/\/ sync token\n\n            else if (current.is(T_LBRACKET) || current.is(T_RBRACKET))\n                break; \/\/ sync token\n\n            --i;\n        }\n    }\n\n    if (token.is(T_NAMESPACE)) {\n        \/\/ anonymous namespace\n        return QLatin1String(\"}\");\n\n    } else if (token.is(T_CLASS) || token.is(T_STRUCT) || token.is(T_UNION)) {\n        if (tk[index - 2].is(T_TYPEDEF)) {\n            \/\/ recognized:\n            \/\/   typedef struct {\n            \/\/\n            \/\/ in this case we don't want to insert the extra semicolon+newline.\n            return QLatin1String(\"}\");\n        }\n\n        \/\/ anonymous class\n        return QLatin1String(\"};\");\n\n    } else if (token.is(T_RPAREN)) {\n        \/\/ search the matching brace.\n        const int lparenIndex = tk.startOfMatchingBrace(index);\n\n        if (lparenIndex == index) {\n            \/\/ found an unmatched brace. We don't really know to do in this case.\n            return QString();\n        }\n\n        \/\/ look at the token before the matched brace\n        const SimpleToken &tokenBeforeBrace = tk[lparenIndex - 1];\n\n        if (tokenBeforeBrace.is(T_IF)) {\n            \/\/ recognized an if statement\n            return QLatin1String(\"}\");\n\n        } else if (tokenBeforeBrace.is(T_FOR) || tokenBeforeBrace.is(T_WHILE)) {\n            \/\/ recognized a for-like statement\n            return QLatin1String(\"}\");\n\n        }\n\n        \/\/ if we reached this point there is a good chance that we are parsing a function definition\n        QString str = QLatin1String(\"}\");\n\n        if (shouldInsertNewline(tc))\n            str += QLatin1Char('\\n');\n\n        return str;\n    }\n\n    \/\/ match the block\n    return QLatin1String(\"}\");\n}\n<commit_msg>Added semicolon after } when creating unnamed enumeration<commit_after>\/**************************************************************************\n**\n** This file is part of Qt Creator\n**\n** Copyright (c) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n**\n** Contact: 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#include \"MatchingText.h\"\n#include \"BackwardsScanner.h\"\n\n#include <Token.h>\n\n#include <QtGui\/QTextDocument>\n#include <QtCore\/QtDebug>\n\nusing namespace CPlusPlus;\n\nenum { MAX_NUM_LINES = 20 };\n\nstatic bool shouldOverrideChar(const QChar &ch)\n{\n    switch (ch.unicode()) {\n    case ')': case ']': case ';': case '\"': case '\\'':\n        return true;\n\n    default:\n        return false;\n    }\n}\n\nstatic bool isCompleteStringLiteral(const BackwardsScanner &tk, int index)\n{\n    const QStringRef text = tk.textRef(index);\n\n    if (text.length() < 2)\n        return false;\n\n    else if (text.at(text.length() - 1) == QLatin1Char('\"'))\n        return text.at(text.length() - 2) != QLatin1Char('\\\\'); \/\/ ### not exactly.\n\n    return false;\n}\n\nstatic bool isCompleteCharLiteral(const BackwardsScanner &tk, int index)\n{\n    const QStringRef text = tk.textRef(index);\n\n    if (text.length() < 2)\n        return false;\n\n    else if (text.at(text.length() - 1) == QLatin1Char('\\''))\n        return text.at(text.length() - 2) != QLatin1Char('\\\\'); \/\/ ### not exactly.\n\n    return false;\n}\n\nMatchingText::MatchingText()\n{ }\n\nbool MatchingText::shouldInsertMatchingText(const QTextCursor &tc)\n{\n    QTextDocument *doc = tc.document();\n    return shouldInsertMatchingText(doc->characterAt(tc.selectionEnd()));\n}\n\nbool MatchingText::shouldInsertMatchingText(const QChar &lookAhead)\n{\n    switch (lookAhead.unicode()) {\n    case '{': case '}':\n    case ']': case ')':\n    case ';': case ',':\n        return true;\n\n    default:\n        if (lookAhead.isSpace())\n            return true;\n\n        return false;\n    } \/\/ switch\n}\n\nQString MatchingText::insertMatchingBrace(const QTextCursor &cursor, const QString &textToProcess,\n                                          const QChar &la, int *skippedChars) const\n{\n    QTextCursor tc = cursor;\n    QTextDocument *doc = tc.document();\n    QString text = textToProcess;\n\n    const QString blockText = tc.block().text().mid(tc.columnNumber());\n    const int length = qMin(blockText.length(), textToProcess.length());\n\n    const QChar previousChar = doc->characterAt(tc.selectionEnd() - 1);\n\n    bool escape = false;\n\n    if (! text.isEmpty() && (text.at(0) == QLatin1Char('\"') ||\n                             text.at(0) == QLatin1Char('\\''))) {\n        if (previousChar == QLatin1Char('\\\\')) {\n            int escapeCount = 0;\n            int index = tc.selectionEnd() - 1;\n            do {\n                ++escapeCount;\n                --index;\n            } while (doc->characterAt(index) == QLatin1Char('\\\\'));\n\n            if ((escapeCount % 2) != 0)\n                escape = true;\n        }\n    }\n\n    if (! escape) {\n        for (int i = 0; i < length; ++i) {\n            const QChar ch1 = blockText.at(i);\n            const QChar ch2 = textToProcess.at(i);\n\n            if (ch1 != ch2)\n                break;\n            else if (! shouldOverrideChar(ch1))\n                break;\n\n            ++*skippedChars;\n        }\n    }\n\n    if (*skippedChars != 0) {\n        tc.movePosition(QTextCursor::NextCharacter, QTextCursor::MoveAnchor, *skippedChars);\n        text = textToProcess.mid(*skippedChars);\n    }\n\n    if (text.isEmpty() || !shouldInsertMatchingText(la))\n        return QString();\n\n    BackwardsScanner tk(tc, textToProcess.left(*skippedChars), MAX_NUM_LINES);\n    const int startToken = tk.startToken();\n    int index = startToken;\n\n    const SimpleToken &token = tk[index - 1];\n\n    if (text.at(0) == QLatin1Char('\"') && (token.is(T_STRING_LITERAL) || token.is(T_WIDE_STRING_LITERAL))) {\n        if (text.length() != 1)\n            qWarning() << Q_FUNC_INFO << \"handle event compression\";\n\n        if (isCompleteStringLiteral(tk, index - 1))\n            return QLatin1String(\"\\\"\");\n\n        return QString();\n    } else if (text.at(0) == QLatin1Char('\\'') && (token.is(T_CHAR_LITERAL) || token.is(T_WIDE_CHAR_LITERAL))) {\n        if (text.length() != 1)\n            qWarning() << Q_FUNC_INFO << \"handle event compression\";\n\n        if (isCompleteCharLiteral(tk, index - 1))\n            return QLatin1String(\"'\");\n\n        return QString();\n    }\n\n    QString result;\n\n    foreach (const QChar &ch, text) {\n        if      (ch == QLatin1Char('('))  result += ')';\n        else if (ch == QLatin1Char('['))  result += ']';\n        else if (ch == QLatin1Char('\"'))  result += '\"';\n        else if (ch == QLatin1Char('\\'')) result += '\\'';\n    }\n\n    return result;\n}\n\nbool MatchingText::shouldInsertNewline(const QTextCursor &tc) const\n{\n    QTextDocument *doc = tc.document();\n    int pos = tc.selectionEnd();\n\n    \/\/ count the number of empty lines.\n    int newlines = 0;\n    for (int e = doc->characterCount(); pos != e; ++pos) {\n        const QChar ch = doc->characterAt(pos);\n\n        if (! ch.isSpace())\n            break;\n        else if (ch == QChar::ParagraphSeparator)\n            ++newlines;\n    }\n\n    if (newlines <= 1 && doc->characterAt(pos) != QLatin1Char('}'))\n        return true;\n\n    return false;\n}\n\nQString MatchingText::insertParagraphSeparator(const QTextCursor &tc) const\n{\n    BackwardsScanner tk(tc, QString(), MAX_NUM_LINES);\n    int index = tk.startToken();\n\n    if (tk[index - 1].isNot(T_LBRACE))\n        return QString(); \/\/ nothing to do.\n\n    const QString textBlock = tc.block().text().mid(tc.columnNumber()).trimmed();\n    if (! textBlock.isEmpty())\n        return QString();\n\n    --index; \/\/ consume the `{'\n\n    const SimpleToken &token = tk[index - 1];\n\n    if (token.is(T_STRING_LITERAL) && tk[index - 2].is(T_EXTERN)) {\n        \/\/ recognized extern \"C\"\n        return QLatin1String(\"}\");\n\n    } else if (token.is(T_IDENTIFIER)) {\n        int i = index - 1;\n\n        forever {\n            const SimpleToken &current = tk[i - 1];\n\n            if (current.is(T_EOF_SYMBOL))\n                break;\n\n            else if (current.is(T_CLASS) || current.is(T_STRUCT) || current.is(T_UNION) || current.is(T_ENUM)) {\n                \/\/ found a class key.\n                QString str = QLatin1String(\"};\");\n\n                if (shouldInsertNewline(tc))\n                    str += QLatin1Char('\\n');\n\n                return str;\n            }\n\n            else if (current.is(T_NAMESPACE))\n                return QLatin1String(\"}\"); \/\/ found a namespace declaration\n\n            else if (current.is(T_SEMICOLON))\n                break; \/\/ found the `;' sync token\n\n            else if (current.is(T_LBRACE) || current.is(T_RBRACE))\n                break; \/\/ braces are considered sync tokens\n\n            else if (current.is(T_LPAREN) || current.is(T_RPAREN))\n                break; \/\/ sync token\n\n            else if (current.is(T_LBRACKET) || current.is(T_RBRACKET))\n                break; \/\/ sync token\n\n            --i;\n        }\n    }\n\n    if (token.is(T_NAMESPACE)) {\n        \/\/ anonymous namespace\n        return QLatin1String(\"}\");\n\n    } else if (token.is(T_CLASS) || token.is(T_STRUCT) || token.is(T_UNION) || token.is(T_ENUM)) {\n        if (tk[index - 2].is(T_TYPEDEF)) {\n            \/\/ recognized:\n            \/\/   typedef struct {\n            \/\/\n            \/\/ in this case we don't want to insert the extra semicolon+newline.\n            return QLatin1String(\"}\");\n        }\n\n        \/\/ anonymous class\n        return QLatin1String(\"};\");\n\n    } else if (token.is(T_RPAREN)) {\n        \/\/ search the matching brace.\n        const int lparenIndex = tk.startOfMatchingBrace(index);\n\n        if (lparenIndex == index) {\n            \/\/ found an unmatched brace. We don't really know to do in this case.\n            return QString();\n        }\n\n        \/\/ look at the token before the matched brace\n        const SimpleToken &tokenBeforeBrace = tk[lparenIndex - 1];\n\n        if (tokenBeforeBrace.is(T_IF)) {\n            \/\/ recognized an if statement\n            return QLatin1String(\"}\");\n\n        } else if (tokenBeforeBrace.is(T_FOR) || tokenBeforeBrace.is(T_WHILE)) {\n            \/\/ recognized a for-like statement\n            return QLatin1String(\"}\");\n\n        }\n\n        \/\/ if we reached this point there is a good chance that we are parsing a function definition\n        QString str = QLatin1String(\"}\");\n\n        if (shouldInsertNewline(tc))\n            str += QLatin1Char('\\n');\n\n        return str;\n    }\n\n    \/\/ match the block\n    return QLatin1String(\"}\");\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\n*\/\n\n#include \"lineFollowing.h\"\n#include \"..\/control.h\"\n\nusing namespace std;\nusing namespace cv;\n\nvoid detect_lines(Mat &original_frame, double scale_factor);\n\n\nvoid compress_lines(vector<Vec2f> &condensed, const vector<Vec2f> &tmp_list);\n\n#pragma clang diagnostic push\n#pragma ide diagnostic ignored \"OCUnusedGlobalDeclarationInspection\"\n\nvoid line_main() {\n\/\/  printf(\"Hello, this is Caleb\\n\");\n\/\/  no this is patric\n\n  VideoCapture cap(\"..\/..\/tests\/videos\/top_down_1.m4v\");\n  if (!cap.isOpened())  \/\/ check if we succeeded\n    return;\n\n\/\/  Mat edges;\n  for (; ;) {\n    Mat frame;\n    cap >> frame; \/\/ get a new frame from camera\n\n    detect_lines(frame, .2);\n\n\n    if (waitKey(30) >= 0) break;\n\n  }\n  \/\/ the camera will be deinitialized automatically in VideoCapture destructor\n\n  return;\n}\n\n#pragma clang diagnostic pop\n\nvoid detect_lines(Mat &original_frame, double scale_factor) {\n\n  Mat hsv;\n  Mat mask;\n  Mat image;\n\n  \/\/ resize(original_frame, image, Size(), scale_factor, scale_factor); \/\/Potentially scale down the frame\n\n  cvtColor(original_frame, hsv, CV_BGR2HSV); \/\/ Image is now HSV\n\n  double minH = 50;\n  double minS = 20;\n  double minV = 150;\n  double maxH = 125;\n  double maxS = 100;\n  double maxV = 255;\n\n\n  Scalar lower(minH, minS, minV);\n  Scalar upper(maxH, maxS, maxV);\n  inRange(hsv, lower, upper, mask); \/\/ Create a mask of only the desired color\n  Canny(mask, mask, 50, 200, 3);\n\n  vector<Vec2f> lines, condensed, tmp_list;\n  HoughLines(mask, lines, 1, CV_PI \/ 180, 100, 0, 0);\n\/\/  HoughLinesP(mask, lines, 1, CV_PI \/ 180.0, 10, 50, 10); \/\/ Find all lines in the image\n\n  printf(\"Adding in %d lines\\n\", (int) lines.size());\n\n  \n  \/\/Flipping any backwards lines\n  for (int i = 0; i < lines.size(); i++) {\n    if (lines[i][1] > CV_PI \/ 2) {\n      lines[i][1] -= CV_PI;\n      lines[i][0] *= -1;\n    }\n    else if (lines[i][1] < ((CV_PI \/ 2) * -1)) {\n      lines[i][1] += CV_PI;\n      lines[i][0] *= -1;\n    }\n\n    \/\/put in order of theta, rho\n    swap(lines[i][0], lines[i][1]);\n  }\n\n  \/\/Order from least to greatest theta\n  std::sort(lines.begin(), lines.end(),\n            [](const Vec2f &a, const Vec2f &b) {\n              return a[0] < b[0];\n            });\n\n  while (!lines.empty()) {\n    Vec2f to_manipulate = lines.front();\n    lines.erase(lines.begin());\n\n    if (tmp_list.empty()) {\n      tmp_list.push_back(to_manipulate);\n      continue;\n    } else {\n      if (abs(to_manipulate[0] - tmp_list.front()[0]) < 20 * (CV_PI \/ 180.0)) {\n        \/\/The angles are similar\n        if (abs(to_manipulate[1] - tmp_list.front()[1]) < 50) {\n          \/\/the distances are similar\n          tmp_list.push_back(to_manipulate);\n          continue;\n        }\n      } else {\n        \/\/Need to clear out the tmp_list\n        compress_lines(condensed, tmp_list);\n\n        tmp_list.clear();\n        tmp_list.push_back(to_manipulate);\n\n      }\n    }\n  }\n  if (!tmp_list.empty()) {\n    compress_lines(condensed, tmp_list);\n  }\n\n  printf(\"Compressed down to %d lines\\n\", (int) condensed.size()); \n  \n\n  \/\/ Undoing work:\n  \/\/ condensed = lines;\n\n  for (size_t i = 0; i < condensed.size(); i++) {\n    float theta = condensed[i][0], rho = condensed[i][1];\n    \/\/ float rho = lines[i][0], theta = lines[i][1];\n    Point pt1, pt2;\n    double a = cos(theta), b = sin(theta);\n    double x0 = a * rho, y0 = b * rho;\n    pt1.x = cvRound(x0 + 1000 * (-b));\n    pt1.y = cvRound(y0 + 1000 * (a));\n    pt2.x = cvRound(x0 - 1000 * (-b));\n    pt2.y = cvRound(y0 - 1000 * (a));\n    line(original_frame, pt1, pt2, Scalar(0, 0, 255), 3, CV_AA);\n  }\n\n\/\/  imshow(\"line_window\", image);\n  \/\/ resize(image, original_frame, Size(), 1 \/ scale_factor, 1 \/ scale_factor);\n  \/\/ original_frame = image;\n}\n\nvoid compress_lines(vector<Vec2f> &condensed, const vector<Vec2f> &tmp_list) {\n  Vec2f new_point;\n  float angle_sum = 0;\n  float rho_sum = 0;\n  for (int j = 0; j < tmp_list.size(); ++j) {\n    angle_sum += tmp_list[j][0];\n    rho_sum += tmp_list[j][1];\n  }\n  angle_sum \/= tmp_list.size();\n  rho_sum \/= tmp_list.size();\n\n  new_point[0] = angle_sum;\n  new_point[1] = rho_sum;\n\n  condensed.push_back(new_point);\n}\n\nLineFollowing::LineFollowing(Control *control) {\n  namedWindow(\"line_window\", CV_WINDOW_NORMAL);\n  control_ptr = control;\n  return;\n}\n\nvoid LineFollowing::close() {\n  return;\n}\n\nvoid LineFollowing::fly() {\n\n  control_ptr->velocities.vx = 0;\n  control_ptr->velocities.vy = 0;\n  control_ptr->velocities.vz = 0;\n  control_ptr->velocities.vr = 0;\n\n  detect_lines(control_ptr->image, 1);\n\n  return;\n}\n<commit_msg>refactoring<commit_after>\/*\n\n*\/\n\n#include \"lineFollowing.h\"\n#include \"..\/control.h\"\n\nusing namespace std;\nusing namespace cv;\n\nvoid detect_lines(Mat &original_frame, double scale_factor);\n\n\nvoid compress_lines(vector<Vec2f> &condensed, const vector<Vec2f> &tmp_list);\n\nvoid draw_lines(const Mat &image, const vector<Vec2f> &lines);\n\nvector<Vec2f> condense_lines(vector<Vec2f> &lines);\n\n#pragma clang diagnostic push\n#pragma ide diagnostic ignored \"OCUnusedGlobalDeclarationInspection\"\n\nvoid line_main() {\n\/\/  printf(\"Hello, this is Caleb\\n\");\n\/\/  no this is patric\n\n  VideoCapture cap(\"..\/..\/tests\/videos\/top_down_1.m4v\");\n  if (!cap.isOpened())  \/\/ check if we succeeded\n    return;\n\n\/\/  Mat edges;\n  for (; ;) {\n    Mat frame;\n    cap >> frame; \/\/ get a new frame from camera\n\n    detect_lines(frame, .2);\n\n\n    if (waitKey(30) >= 0) break;\n\n  }\n  \/\/ the camera will be deinitialized automatically in VideoCapture destructor\n\n  return;\n}\n\n#pragma clang diagnostic pop\n\nvoid detect_lines(Mat &original_frame, double scale_factor) {\n\n  Mat hsv;\n  Mat mask;\n  Mat image;\n\n  \/\/ resize(original_frame, image, Size(), scale_factor, scale_factor); \/\/Potentially scale down the frame\n\n  cvtColor(original_frame, hsv, CV_BGR2HSV); \/\/ Image is now HSV\n\n  double minH = 50;\n  double minS = 20;\n  double minV = 150;\n  double maxH = 125;\n  double maxS = 100;\n  double maxV = 255;\n\n\n  Scalar lower(minH, minS, minV);\n  Scalar upper(maxH, maxS, maxV);\n  inRange(hsv, lower, upper, mask); \/\/ Create a mask of only the desired color\n  Canny(mask, mask, 50, 200, 3);\n\n  vector<Vec2f> lines;\n  HoughLines(mask, lines, 1, CV_PI \/ 180, 100, 0, 0);\n\/\/  HoughLinesP(mask, lines, 1, CV_PI \/ 180.0, 10, 50, 10); \/\/ Find all lines in the image\n\n  printf(\"Adding in %d lines\\n\", (int) lines.size());\n\n\n  \/\/Flipping any backwards lines\n  vector<Vec2f> condensed = condense_lines(lines);\n\n  \/\/  printf(\"Compressed down to %d lines\\n\", (int) condensed.size());\n\n\n\n  draw_lines(original_frame, condensed);\n\n\n}\n\nvector<Vec2f> condense_lines(vector<Vec2f> lines) {\n  vector<Vec2f> condensed;\n  vector<Vec2f> tmp_list;\n  for (int i = 0; i < lines.size(); i++) {\n    if (lines[i][1] > CV_PI \/ 2) {\n      lines[i][1] -= CV_PI;\n      lines[i][0] *= -1;\n    }\n    else if (lines[i][1] < ((CV_PI \/ 2) * -1)) {\n      lines[i][1] += CV_PI;\n      lines[i][0] *= -1;\n    }\n\n    \/\/put in order of theta, rho\n    swap(lines[i][0], lines[i][1]);\n  }\n\n  \/\/Order from least to greatest theta\n  sort(lines.begin(), lines.end(),\n       [](const Vec2f &a, const Vec2f &b) {\n         return a[0] < b[0];\n       });\n\n  while (!lines.empty()) {\n    Vec2f to_manipulate = lines.front();\n    lines.erase(lines.begin());\n\n    if (tmp_list.empty()) {\n      tmp_list.push_back(to_manipulate);\n      continue;\n    } else {\n      if (abs(to_manipulate[0] - tmp_list.front()[0]) < 20 * (CV_PI \/ 180.0)) {\n        \/\/The angles are similar\n        if (abs(to_manipulate[1] - tmp_list.front()[1]) < 50) {\n          \/\/the distances are similar\n          tmp_list.push_back(to_manipulate);\n          continue;\n        }\n      } else {\n        \/\/Need to clear out the tmp_list\n        compress_lines(condensed, tmp_list);\n\n        tmp_list.clear();\n        tmp_list.push_back(to_manipulate);\n\n      }\n    }\n  }\n  if (!tmp_list.empty()) {\n    compress_lines(condensed, tmp_list);\n  }\n  return condensed;\n}\n\nvoid draw_lines(const Mat &image, const vector<Vec2f> &lines) {\n  for (size_t i = 0; i < lines.size(); i++) {\n    float theta = lines[i][0], rho = lines[i][1];\n    \/\/ float rho = lines[i][0], theta = lines[i][1];\n    Point pt1, pt2;\n    double a = cos(theta), b = sin(theta);\n    double x0 = a * rho, y0 = b * rho;\n    pt1.x = cvRound(x0 + 1000 * (-b));\n    pt1.y = cvRound(y0 + 1000 * (a));\n    pt2.x = cvRound(x0 - 1000 * (-b));\n    pt2.y = cvRound(y0 - 1000 * (a));\n    line(image, pt1, pt2, Scalar(0, 0, 255), 3, CV_AA);\n  }\n}\n\nvoid compress_lines(vector<Vec2f> &condensed, const vector<Vec2f> &tmp_list) {\n  Vec2f new_point;\n  float angle_sum = 0;\n  float rho_sum = 0;\n  for (int j = 0; j < tmp_list.size(); ++j) {\n    angle_sum += tmp_list[j][0];\n    rho_sum += tmp_list[j][1];\n  }\n  angle_sum \/= tmp_list.size();\n  rho_sum \/= tmp_list.size();\n\n  new_point[0] = angle_sum;\n  new_point[1] = rho_sum;\n\n  condensed.push_back(new_point);\n}\n\nLineFollowing::LineFollowing(Control *control) {\n  namedWindow(\"line_window\", CV_WINDOW_NORMAL);\n  control_ptr = control;\n  return;\n}\n\nvoid LineFollowing::close() {\n  return;\n}\n\nvoid LineFollowing::fly() {\n\n  control_ptr->velocities.vx = 0;\n  control_ptr->velocities.vy = 0;\n  control_ptr->velocities.vz = 0;\n  control_ptr->velocities.vr = 0;\n\n  detect_lines(control_ptr->image, 1);\n\n  return;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\n*\/\n\n#include \"lineFollowing.h\"\n#include \"line_utilities.h\"\n#include \"..\/control.h\"\n#include \"line_simplification.h\"\n\nusing namespace std;\nusing namespace cv;\n\n\nvoid LineFollowing::detect_lines(Mat &original_frame) {\n\n  Mat hsv;\n  Mat mask;\n  width = original_frame.cols;\n  height = original_frame.rows;\n\n  cvtColor(original_frame, hsv, CV_BGR2HSV); \/\/ Image is now HSV\n\n  Scalar lower(minH, minS, minV);\n  Scalar upper(maxH, maxS, maxV);\n  inRange(hsv, lower, upper, mask); \/\/ Create a mask of only the desired color\n  Canny(mask, mask, 50, 200, 3);\n\n  vector<Vec2f> lines;\n  HoughLines(mask, lines, 1, CV_PI \/ 180, 100, 0, 0);\n\n  \/\/ printf(\"Adding in %d lines\\n\", (int) lines.size());\n\n  vector<Vec2f> tmp = condense_lines(lines, true);\n  sort(tmp.begin(), tmp.end(),\n       [](const Vec2f &a, const Vec2f &b) {\n         return a[0] < b[0];\n       });\n  if (tmp.size() > 0) {\n    found_lines = tmp;\n  }\n\n  draw_lines(original_frame, found_lines);\n\n}\n\nLineFollowing::LineFollowing(Control *control) {\n  namedWindow(\"line_window\", CV_WINDOW_NORMAL);\n  control_ptr = control;\n  minH = 50;\n  minS = 20;\n  minV = 150;\n  maxH = 125;\n  maxS = 100;\n  maxV = 255;\n  return;\n}\n\nvoid LineFollowing::close() {\n  return;\n}\n\nvoid LineFollowing::fly() {\n  \/\/ cout << \"line following\\n\";\n  detect_lines(control_ptr->image);\n\n\n  control_ptr->velocities.vx = 0;\n  control_ptr->velocities.vy = 0;\n  control_ptr->velocities.vz = 0;\n  control_ptr->velocities.vr = 0;\n\n  if (found_lines.size() < 1) {\n    \/\/I found no lines\n    \/\/ printf(\"Found nothing\\n\");\n    return;\n  }\n  double calculated_distance = distance_from_center(found_lines[0][1], found_lines[0][0], control_ptr->image.cols,\n                                                    control_ptr->image.rows);\n\n  \/\/ printf(\"calc dist of %f \", calculated_distance);\n  int origin_x = 0 + (control_ptr->image.cols \/ 2);\n  int origin_y = 0 + (control_ptr->image.rows \/ 2);\n  Point pt1 = cvPoint(origin_x, origin_y);\n  Point pt2 = cvPoint(origin_x + cvRound(calculated_distance), origin_y);\n  line(control_ptr->image, pt1, pt2, Scalar(255, 255, 255), 3, CV_AA);\n\n  if (found_lines.size() > 1) {\n    \/\/ I need to turn\n    \/\/TODO: move until line is centered\n    \/\/TODO: look for symbol, and turn\n    origin_x = 0;\n    origin_y = 0;\n    Vec2i point = find_intersection(found_lines[0], found_lines[1]);\n\n    line(control_ptr->image, cvPoint(origin_x + point[0] + 10, origin_y + point[1]),\n         cvPoint(origin_x + point[0] - 10, origin_y + point[1]), Scalar(255, 255, 255), 3, CV_AA);\n    line(control_ptr->image, cvPoint(origin_x + point[0], origin_y + point[1] + 10),\n         cvPoint(origin_x + point[0], origin_y + point[1] - 10), Scalar(255, 255, 255), 3, CV_AA);\n    if (found_lines.size() >= 3) {\n      for (int j = 0; j < (int) found_lines.size(); j++) {\n        printf(\"(%.1f, %.0f) \", rad2deg(found_lines[j][0]) + 90, found_lines[j][1]);\n      }\n      printf(\"\\n\");\n    }\n    return;\n  }\n\n  else {\n    \/\/ I need to snap myself to the line\n    if (found_lines[0][0] >= deg2rad(5)) {\n      control_ptr->velocities.vr = -.2;\n      \/\/ printf(\"Turning Right\\n\");\n    }\n    else if (found_lines[0][0] <= deg2rad(-1 * 5)) {\n      control_ptr->velocities.vr = .2;\n      \/\/ printf(\"Turning Left\\n\");\n    } else {\n      \/\/ printf(\"Checking Distance\\n\");\n\n      double offset = calculated_distance;\n      \/\/ printf(\"Offset is: %5.2f with a distance of %5.2f and width of %5.2f halved to %5.2f\\n\", offset,\n      \/\/ found_lines[0][1],\n      \/\/ (double) control_ptr->image.cols, (control_ptr->image.cols \/ 2.0));\n      if (-100 <= offset && offset <= 100) {\n        \/\/ printf(\"No need to move\\n\");\n      } else if (offset < 0) {\n        \/\/we are to the right of the line\n        \/\/we need to move left\n        control_ptr->velocities.vy = 1;\n        \/\/ printf(\"Move left\\n\");\n      } else {\n        \/\/we need to move right\n        control_ptr->velocities.vy = -1;\n        \/\/ printf(\"Move right\\n\");\n      }\n    }\n  }\n\n\n  return;\n}\n\ncv::Point LineFollowing::find_intersection(Vec2f a, Vec2f b) {\n  Point rv;\n  bool do_intersect = parametricIntersect(a[1], a[0], b[1], b[0], rv.x, rv.y);\n  if (!do_intersect) {\n    printf(\"No intersection!\\n\");\n  }\n\n  return rv;\n}\n\n<commit_msg>pretty printing<commit_after>\/*\n\n*\/\n\n#include \"lineFollowing.h\"\n#include \"line_utilities.h\"\n#include \"..\/control.h\"\n#include \"line_simplification.h\"\n\nusing namespace std;\nusing namespace cv;\n\n\nvoid LineFollowing::detect_lines(Mat &original_frame) {\n\n  Mat hsv;\n  Mat mask;\n  width = original_frame.cols;\n  height = original_frame.rows;\n\n  cvtColor(original_frame, hsv, CV_BGR2HSV); \/\/ Image is now HSV\n\n  Scalar lower(minH, minS, minV);\n  Scalar upper(maxH, maxS, maxV);\n  inRange(hsv, lower, upper, mask); \/\/ Create a mask of only the desired color\n  Canny(mask, mask, 50, 200, 3);\n\n  vector<Vec2f> lines;\n  HoughLines(mask, lines, 1, CV_PI \/ 180, 100, 0, 0);\n\n  \/\/ printf(\"Adding in %d lines\\n\", (int) lines.size());\n\n  vector<Vec2f> tmp = condense_lines(lines, true);\n  sort(tmp.begin(), tmp.end(),\n       [](const Vec2f &a, const Vec2f &b) {\n         return a[0] < b[0];\n       });\n  if (tmp.size() > 0) {\n    found_lines = tmp;\n  }\n\n  draw_lines(original_frame, found_lines);\n\n}\n\nLineFollowing::LineFollowing(Control *control) {\n  namedWindow(\"line_window\", CV_WINDOW_NORMAL);\n  control_ptr = control;\n  minH = 50;\n  minS = 20;\n  minV = 150;\n  maxH = 125;\n  maxS = 100;\n  maxV = 255;\n  return;\n}\n\nvoid LineFollowing::close() {\n  return;\n}\n\nvoid LineFollowing::fly() {\n  \/\/ cout << \"line following\\n\";\n  detect_lines(control_ptr->image);\n\n\n  control_ptr->velocities.vx = 0;\n  control_ptr->velocities.vy = 0;\n  control_ptr->velocities.vz = 0;\n  control_ptr->velocities.vr = 0;\n\n  if (found_lines.size() < 1) {\n    \/\/I found no lines\n    \/\/ printf(\"Found nothing\\n\");\n    return;\n  }\n  double calculated_distance = distance_from_center(found_lines[0][1], found_lines[0][0], control_ptr->image.cols,\n                                                    control_ptr->image.rows);\n\n  \/\/ printf(\"calc dist of %f \", calculated_distance);\n  int origin_x = 0 + (control_ptr->image.cols \/ 2);\n  int origin_y = 0 + (control_ptr->image.rows \/ 2);\n  Point pt1 = cvPoint(origin_x, origin_y);\n  Point pt2 = cvPoint(origin_x + cvRound(calculated_distance), origin_y);\n  line(control_ptr->image, pt1, pt2, Scalar(255, 255, 255), 3, CV_AA);\n\n  if (found_lines.size() > 1) {\n    \/\/ I need to turn\n    \/\/TODO: move until line is centered\n    \/\/TODO: look for symbol, and turn\n    origin_x = 0;\n    origin_y = 0;\n    Vec2i point = find_intersection(found_lines[0], found_lines[1]);\n\n    line(control_ptr->image, cvPoint(origin_x + point[0] + 10, origin_y + point[1]),\n         cvPoint(origin_x + point[0] - 10, origin_y + point[1]), Scalar(255, 255, 255), 3, CV_AA);\n    line(control_ptr->image, cvPoint(origin_x + point[0], origin_y + point[1] + 10),\n         cvPoint(origin_x + point[0], origin_y + point[1] - 10), Scalar(255, 255, 255), 3, CV_AA);\n    if (found_lines.size() >= 3) {\n      for (int j = 0; j < (int) found_lines.size(); j++) {\n        printf(\"(%5.1f, %5.0f) \", rad2deg(found_lines[j][0]) + 180, found_lines[j][1]);\n      }\n      printf(\"\\n\");\n    }\n    return;\n  }\n\n  else {\n    \/\/ I need to snap myself to the line\n    if (found_lines[0][0] >= deg2rad(5)) {\n      control_ptr->velocities.vr = -.2;\n      \/\/ printf(\"Turning Right\\n\");\n    }\n    else if (found_lines[0][0] <= deg2rad(-1 * 5)) {\n      control_ptr->velocities.vr = .2;\n      \/\/ printf(\"Turning Left\\n\");\n    } else {\n      \/\/ printf(\"Checking Distance\\n\");\n\n      double offset = calculated_distance;\n      \/\/ printf(\"Offset is: %5.2f with a distance of %5.2f and width of %5.2f halved to %5.2f\\n\", offset,\n      \/\/ found_lines[0][1],\n      \/\/ (double) control_ptr->image.cols, (control_ptr->image.cols \/ 2.0));\n      if (-100 <= offset && offset <= 100) {\n        \/\/ printf(\"No need to move\\n\");\n      } else if (offset < 0) {\n        \/\/we are to the right of the line\n        \/\/we need to move left\n        control_ptr->velocities.vy = 1;\n        \/\/ printf(\"Move left\\n\");\n      } else {\n        \/\/we need to move right\n        control_ptr->velocities.vy = -1;\n        \/\/ printf(\"Move right\\n\");\n      }\n    }\n  }\n\n\n  return;\n}\n\ncv::Point LineFollowing::find_intersection(Vec2f a, Vec2f b) {\n  Point rv;\n  bool do_intersect = parametricIntersect(a[1], a[0], b[1], b[0], rv.x, rv.y);\n  if (!do_intersect) {\n    printf(\"No intersection!\\n\");\n  }\n\n  return rv;\n}\n\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 <memory>\n#include <vector>\n\n#include <gmock\/gmock.h>\n#include <gtest\/gtest.h>\n\n#include \"caffe2\/operators\/batch_matmul_op.h\"\n\nnamespace caffe2 {\nnamespace {\n\nusing testing::ElementsAreArray;\nusing testing::Test;\n\nclass BatchMatMulOpTest : public Test {\n protected:\n  void SetUp() override {\n    cpu_context_ = make_unique<CPUContext>(option_);\n    def_.set_name(\"test\");\n    def_.set_type(\"BatchMatMul\");\n    def_.add_input(\"A\");\n    def_.add_input(\"B\");\n    def_.add_output(\"Y\");\n  }\n\n  void AddConstInput(\n      const std::vector<TIndex>& dims,\n      const float value,\n      const string& name) {\n    Blob* blob = ws_.CreateBlob(name);\n    auto* tensor = blob->GetMutable<TensorCPU>();\n    tensor->Resize(dims);\n    math::Set<float, CPUContext>(\n        tensor->size(),\n        value,\n        tensor->mutable_data<float>(),\n        cpu_context_.get());\n  }\n\n  void VerifyOutput(const std::vector<TIndex>& dims, const float value) const {\n    const Blob* Y_blob = ws_.GetBlob(\"Y\");\n    ASSERT_NE(nullptr, Y_blob);\n    const auto& Y = Y_blob->Get<TensorCPU>();\n    ASSERT_THAT(Y.dims(), ElementsAreArray(dims));\n    for (int i = 0; i < Y.size(); ++i) {\n      EXPECT_FLOAT_EQ(value, Y.data<float>()[i]);\n    }\n  }\n\n  DeviceOption option_;\n  std::unique_ptr<CPUContext> cpu_context_;\n  Workspace ws_;\n  OperatorDef def_;\n};\n\nTEST_F(BatchMatMulOpTest, BatchMatMulOpNormalTest) {\n  AddConstInput(std::vector<TIndex>{3, 5, 10}, 1.0f, \"A\");\n  AddConstInput(std::vector<TIndex>{3, 10, 6}, 1.0f, \"B\");\n  std::unique_ptr<OperatorBase> op(CreateOperator(def_, &ws_));\n  ASSERT_NE(nullptr, op);\n  ASSERT_TRUE(op->Run());\n  VerifyOutput(std::vector<TIndex>{3, 5, 6}, 10.0f);\n}\n\nTEST_F(BatchMatMulOpTest, BatchMatMulOpBroadcastTest) {\n  auto* arg = def_.add_arg();\n  arg->set_name(\"broadcast\");\n  arg->set_i(1);\n  AddConstInput(std::vector<TIndex>{3, 5, 10}, 1.0f, \"A\");\n  AddConstInput(std::vector<TIndex>{2, 3, 10, 6}, 1.0f, \"B\");\n  std::unique_ptr<OperatorBase> op(CreateOperator(def_, &ws_));\n  ASSERT_NE(nullptr, op);\n  ASSERT_TRUE(op->Run());\n  VerifyOutput(std::vector<TIndex>{2, 3, 5, 6}, 10.0f);\n}\n\n} \/\/ namespace\n} \/\/ namespace caffe2\n<commit_msg>Remove gmock dependency<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 <memory>\n#include <vector>\n\n#include <gtest\/gtest.h>\n\n#include \"caffe2\/operators\/batch_matmul_op.h\"\n\nnamespace caffe2 {\nnamespace {\n\nclass BatchMatMulOpTest : public testing::Test {\n protected:\n  void SetUp() override {\n    cpu_context_ = make_unique<CPUContext>(option_);\n    def_.set_name(\"test\");\n    def_.set_type(\"BatchMatMul\");\n    def_.add_input(\"A\");\n    def_.add_input(\"B\");\n    def_.add_output(\"Y\");\n  }\n\n  void AddConstInput(\n      const std::vector<TIndex>& dims,\n      const float value,\n      const string& name) {\n    Blob* blob = ws_.CreateBlob(name);\n    auto* tensor = blob->GetMutable<TensorCPU>();\n    tensor->Resize(dims);\n    math::Set<float, CPUContext>(\n        tensor->size(),\n        value,\n        tensor->mutable_data<float>(),\n        cpu_context_.get());\n  }\n\n  void VerifyOutput(const std::vector<TIndex>& dims, const float value) const {\n    const Blob* Y_blob = ws_.GetBlob(\"Y\");\n    ASSERT_NE(nullptr, Y_blob);\n    const auto& Y = Y_blob->Get<TensorCPU>();\n    const auto& Y_dims = Y.dims();\n    ASSERT_EQ(dims.size(), Y_dims.size());\n    for (std::size_t i = 0; i < dims.size(); ++i) {\n      ASSERT_EQ(dims[i], Y_dims[i]);\n    }\n    for (int i = 0; i < Y.size(); ++i) {\n      EXPECT_FLOAT_EQ(value, Y.data<float>()[i]);\n    }\n  }\n\n  DeviceOption option_;\n  std::unique_ptr<CPUContext> cpu_context_;\n  Workspace ws_;\n  OperatorDef def_;\n};\n\nTEST_F(BatchMatMulOpTest, BatchMatMulOpNormalTest) {\n  AddConstInput(std::vector<TIndex>{3, 5, 10}, 1.0f, \"A\");\n  AddConstInput(std::vector<TIndex>{3, 10, 6}, 1.0f, \"B\");\n  std::unique_ptr<OperatorBase> op(CreateOperator(def_, &ws_));\n  ASSERT_NE(nullptr, op);\n  ASSERT_TRUE(op->Run());\n  VerifyOutput(std::vector<TIndex>{3, 5, 6}, 10.0f);\n}\n\nTEST_F(BatchMatMulOpTest, BatchMatMulOpBroadcastTest) {\n  auto* arg = def_.add_arg();\n  arg->set_name(\"broadcast\");\n  arg->set_i(1);\n  AddConstInput(std::vector<TIndex>{3, 5, 10}, 1.0f, \"A\");\n  AddConstInput(std::vector<TIndex>{2, 3, 10, 6}, 1.0f, \"B\");\n  std::unique_ptr<OperatorBase> op(CreateOperator(def_, &ws_));\n  ASSERT_NE(nullptr, op);\n  ASSERT_TRUE(op->Run());\n  VerifyOutput(std::vector<TIndex>{2, 3, 5, 6}, 10.0f);\n}\n\n} \/\/ namespace\n} \/\/ namespace caffe2\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#include \"itkThreadPool.h\"\n#include \"itksys\/SystemTools.hxx\"\n\n#include <algorithm>\n\nnamespace itk\n{\nSimpleFastMutexLock ThreadPool::m_Mutex;\n\nThreadPool::Pointer ThreadPool::m_ThreadPoolInstance;\n\nThreadPool::Pointer\nThreadPool\n::New()\n{\n  return Self::GetInstance();\n}\n\n\nThreadPool::Pointer\nThreadPool\n::GetInstance()\n{\n  MutexLockHolder<SimpleFastMutexLock> mutexHolder(m_Mutex);\n  if( m_ThreadPoolInstance.IsNull() )\n    {\n    m_ThreadPoolInstance  = ObjectFactory< Self >::Create();\n    if ( m_ThreadPoolInstance.IsNull() )\n      {\n      new ThreadPool(); \/\/constructor sets m_ThreadPoolInstance\n      }\n    }\n  return m_ThreadPoolInstance;\n}\n\nThreadPool\n::ThreadPool() :\n  m_ExceptionOccurred(false)\n{\n  MutexLockHolder<SimpleFastMutexLock> mutexHolder(m_Mutex);\n  m_ThreadPoolInstance = this; \/\/threads need this\n  m_ThreadPoolInstance->UnRegister(); \/\/ Remove extra reference\n  PlatformCreate(m_ThreadsSemaphore);\n}\n\nThreadIdType\nThreadPool\n::GetGlobalDefaultNumberOfThreads()\n{\n  ThreadIdType threadCount = 0;\n  \/* The ITK_NUMBER_OF_THREADS_ENV_LIST contains is an\n   * environmental variable that holds a ':' separated\n   * list of environmental variables that whould be\n   * queried in order for setting the m_GlobalMaximumNumberOfThreads.\n   *\n   * This is intended to be a mechanism suitable to easy\n   * runtime modification to ease using the proper number\n   * of threads for load balancing batch processing\n   * systems where the number of threads\n   * authorized for use may be less than the number\n   * of physical processors on the computer.\n   *\n   * This list contains the Sun|Oracle Grid Engine\n   * environmental variable \"NSLOTS\" by default\n   *\/\n  std::vector<std::string> ITK_NUMBER_OF_THREADS_ENV_LIST;\n  std::string       itkNumberOfThreadsEvnListString = \"\";\n  if( itksys::SystemTools::GetEnv(\"ITK_NUMBER_OF_THREADS_ENV_LIST\",\n                                  itkNumberOfThreadsEvnListString) )\n    {\n    \/\/ NOTE: We always put \"ITK_GLOBAL_DEFAULT_NUMBER_OF_THREADS\" at the end\n    \/\/ unconditionally.\n    itkNumberOfThreadsEvnListString += \":ITK_GLOBAL_DEFAULT_NUMBER_OF_THREADS\";\n    }\n  else\n    {\n    itkNumberOfThreadsEvnListString = \"NSLOTS:ITK_GLOBAL_DEFAULT_NUMBER_OF_THREADS\";\n    }\n    {\n    std::stringstream numberOfThreadsEnvListStream(itkNumberOfThreadsEvnListString);\n    std::string       item;\n    while( std::getline(numberOfThreadsEnvListStream, item, ':') )\n      {\n      if( item.size() > 0 ) \/\/ Do not add empty items.\n        {\n        ITK_NUMBER_OF_THREADS_ENV_LIST.push_back(item);\n        }\n      }\n    }\n  \/\/ first, check for environment variable\n  std::string itkGlobalDefaultNumberOfThreadsEnv = \"0\";\n  for( std::vector<std::string>::const_iterator lit = ITK_NUMBER_OF_THREADS_ENV_LIST.begin();\n       lit != ITK_NUMBER_OF_THREADS_ENV_LIST.end();\n       ++lit )\n    {\n    if( itksys::SystemTools::GetEnv(lit->c_str(), itkGlobalDefaultNumberOfThreadsEnv) )\n      {\n      threadCount = static_cast<ThreadIdType>( atoi( itkGlobalDefaultNumberOfThreadsEnv.c_str() ) );\n      }\n    }\n\n  \/\/ otherwise, set number of threads based on system information\n  if( threadCount <= 0 )\n    {\n    threadCount = GetGlobalDefaultNumberOfThreadsByPlatform();\n    }\n\n  \/\/ limit the number of threads to m_GlobalMaximumNumberOfThreads\n  threadCount  = std::min( threadCount, ThreadIdType(ITK_MAX_THREADS) );\n\n  \/\/ verify that the default number of threads is larger than zero\n  threadCount  = std::max( threadCount, NumericTraits<ThreadIdType>::OneValue() );\n\n  return threadCount;\n}\n\nvoid\nThreadPool\n::AddThreads(ThreadIdType count)\n{\n  MutexLockHolder<SimpleFastMutexLock> mutexHolder(m_Mutex);\n  m_Threads.reserve(m_Threads.size() + count);\n  for( unsigned int i = 0; i < count; ++i )\n    {\n    AddThread();\n    }\n}\n\nvoid\nThreadPool\n::DeleteThreads()\n{\n  MutexLockHolder<SimpleFastMutexLock> mutexHolder(m_Mutex);\n  for (auto & thread : m_Threads)\n    {\n    if (!PlatformClose(thread))\n      {\n      m_ExceptionOccurred = true;\n      }\n    }\n}\n\nint\nThreadPool\n::GetNumberOfCurrentlyIdleThreads() const\n{\n  MutexLockHolder<SimpleFastMutexLock> mutexHolder(m_Mutex);\n  if ( m_Threads.empty() ) \/\/not yet initialized\n    {\n    const_cast<ThreadPool *>(this)->AddThreads(ThreadPool::GetGlobalDefaultNumberOfThreads());\n    }\n  return int(m_Threads.size()) - int(m_WorkQueue.size()); \/\/ lousy approximation\n}\n\nITK_THREAD_RETURN_TYPE\nnoOperation(void *)\n{\n  return ITK_THREAD_RETURN_VALUE;\n}\n\nThreadPool\n::~ThreadPool()\n{\n  bool waitForThreads = true;\n#if defined(WIN32) && defined(ITKCommon_EXPORTS)\n  \/\/this destructor is called during DllMain's DLL_PROCESS_DETACH.\n  \/\/Because ITKCommon-4.X.dll is usually being detached due to process termination,\n  \/\/lpvReserved is non-NULL meaning that \"all threads in the process\n  \/\/except the current thread either have exited already or have been\n  \/\/explicitly terminated by a call to the ExitProcess function\".\n  if ( !m_Threads.empty() ) \/\/thread pool was used\n    {\n    DWORD dwWaitResult = WaitForSingleObject(m_Threads[0], 1);\n    if (dwWaitResult == WAIT_OBJECT_0) \/\/thread has finished\n      {\n      waitForThreads = false;\n      }\n    }\n#endif\n\n  if (waitForThreads) \/\/add dummy jobs for clean thread exit\n    {\n    std::vector<Semaphore> jobSem(m_Threads.size());\n    for (ThreadIdType i = 0; i < m_Threads.size(); i++)\n      {\n      ThreadJob dummy;\n      dummy.m_ThreadFunction = &noOperation;\n      dummy.m_Semaphore = &jobSem[i];\n      dummy.m_UserData = nullptr; \/\/makes dummy jobs easier to spot while debugging\n      AddWork(dummy);\n      }\n\n    for (ThreadIdType i = 0; i < m_Threads.size(); i++)\n      {\n      WaitForJob(jobSem[i]);\n      }\n    }\n\n  DeleteThreads();\n  PlatformDelete(m_ThreadsSemaphore);\n}\n\nvoid\nThreadPool\n::WaitForJob(Semaphore& jobSemaphore)\n{\n  PlatformWait(jobSemaphore);\n  PlatformDelete(jobSemaphore);\n}\n\nvoid\nThreadPool\n::AddWork(const ThreadJob& threadJob)\n{\n  {\n    MutexLockHolder<SimpleFastMutexLock> mutexHolder(m_Mutex);\n    if ( m_Threads.empty() ) \/\/first job\n      {\n      AddThreads(ThreadPool::GetGlobalDefaultNumberOfThreads());\n      }\n    m_WorkQueue.push_back(threadJob);\n  }\n\n  PlatformCreate(*threadJob.m_Semaphore);\n  PlatformSignal(m_ThreadsSemaphore);\n}\n\n\nITK_THREAD_RETURN_TYPE\nThreadPool\n::ThreadExecute(void *)\n{\n  \/\/plain pointer does not increase reference count\n  ThreadPool* threadPool = m_ThreadPoolInstance.GetPointer();\n  try\n    {\n    while (true)\n      {\n      threadPool->PlatformWait(threadPool->m_ThreadsSemaphore);\n\n      ThreadJob job;\n      {\n      MutexLockHolder<SimpleFastMutexLock> mutexHolder(m_Mutex);\n      if (threadPool->m_WorkQueue.empty()) \/\/another thread stole work meant for me\n        {\n        itkGenericExceptionMacro(<< \"Work queue is empty!\");\n        }\n      job = threadPool->m_WorkQueue.front();\n      threadPool->m_WorkQueue.pop_front();\n      } \/\/releases the lock\n\n      if (job.m_ThreadFunction == &noOperation)\n        {\n        PlatformSignal(*job.m_Semaphore);\n        break; \/\/exit infinite while loop\n        }\n      job.m_ThreadFunction(job.m_UserData); \/\/execute the job, lock has been released\n      PlatformSignal(*job.m_Semaphore);\n      }\n    }\n  catch (ExceptionObject& exc)\n    {\n    std::cerr << exc << std::endl;\n    threadPool->m_ExceptionOccurred = true;\n    throw;\n    }\n  return ITK_THREAD_RETURN_VALUE;\n}\n\n}\n<commit_msg>BUG: more reliably detect Windows+DLLs case<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#include \"itkThreadPool.h\"\n#include \"itksys\/SystemTools.hxx\"\n\n#include <algorithm>\n\nnamespace itk\n{\nSimpleFastMutexLock ThreadPool::m_Mutex;\n\nThreadPool::Pointer ThreadPool::m_ThreadPoolInstance;\n\nThreadPool::Pointer\nThreadPool\n::New()\n{\n  return Self::GetInstance();\n}\n\n\nThreadPool::Pointer\nThreadPool\n::GetInstance()\n{\n  MutexLockHolder<SimpleFastMutexLock> mutexHolder(m_Mutex);\n  if( m_ThreadPoolInstance.IsNull() )\n    {\n    m_ThreadPoolInstance  = ObjectFactory< Self >::Create();\n    if ( m_ThreadPoolInstance.IsNull() )\n      {\n      new ThreadPool(); \/\/constructor sets m_ThreadPoolInstance\n      }\n    }\n  return m_ThreadPoolInstance;\n}\n\nThreadPool\n::ThreadPool() :\n  m_ExceptionOccurred(false)\n{\n  MutexLockHolder<SimpleFastMutexLock> mutexHolder(m_Mutex);\n  m_ThreadPoolInstance = this; \/\/threads need this\n  m_ThreadPoolInstance->UnRegister(); \/\/ Remove extra reference\n  PlatformCreate(m_ThreadsSemaphore);\n}\n\nThreadIdType\nThreadPool\n::GetGlobalDefaultNumberOfThreads()\n{\n  ThreadIdType threadCount = 0;\n  \/* The ITK_NUMBER_OF_THREADS_ENV_LIST contains is an\n   * environmental variable that holds a ':' separated\n   * list of environmental variables that whould be\n   * queried in order for setting the m_GlobalMaximumNumberOfThreads.\n   *\n   * This is intended to be a mechanism suitable to easy\n   * runtime modification to ease using the proper number\n   * of threads for load balancing batch processing\n   * systems where the number of threads\n   * authorized for use may be less than the number\n   * of physical processors on the computer.\n   *\n   * This list contains the Sun|Oracle Grid Engine\n   * environmental variable \"NSLOTS\" by default\n   *\/\n  std::vector<std::string> ITK_NUMBER_OF_THREADS_ENV_LIST;\n  std::string       itkNumberOfThreadsEvnListString = \"\";\n  if( itksys::SystemTools::GetEnv(\"ITK_NUMBER_OF_THREADS_ENV_LIST\",\n                                  itkNumberOfThreadsEvnListString) )\n    {\n    \/\/ NOTE: We always put \"ITK_GLOBAL_DEFAULT_NUMBER_OF_THREADS\" at the end\n    \/\/ unconditionally.\n    itkNumberOfThreadsEvnListString += \":ITK_GLOBAL_DEFAULT_NUMBER_OF_THREADS\";\n    }\n  else\n    {\n    itkNumberOfThreadsEvnListString = \"NSLOTS:ITK_GLOBAL_DEFAULT_NUMBER_OF_THREADS\";\n    }\n    {\n    std::stringstream numberOfThreadsEnvListStream(itkNumberOfThreadsEvnListString);\n    std::string       item;\n    while( std::getline(numberOfThreadsEnvListStream, item, ':') )\n      {\n      if( item.size() > 0 ) \/\/ Do not add empty items.\n        {\n        ITK_NUMBER_OF_THREADS_ENV_LIST.push_back(item);\n        }\n      }\n    }\n  \/\/ first, check for environment variable\n  std::string itkGlobalDefaultNumberOfThreadsEnv = \"0\";\n  for( std::vector<std::string>::const_iterator lit = ITK_NUMBER_OF_THREADS_ENV_LIST.begin();\n       lit != ITK_NUMBER_OF_THREADS_ENV_LIST.end();\n       ++lit )\n    {\n    if( itksys::SystemTools::GetEnv(lit->c_str(), itkGlobalDefaultNumberOfThreadsEnv) )\n      {\n      threadCount = static_cast<ThreadIdType>( atoi( itkGlobalDefaultNumberOfThreadsEnv.c_str() ) );\n      }\n    }\n\n  \/\/ otherwise, set number of threads based on system information\n  if( threadCount <= 0 )\n    {\n    threadCount = GetGlobalDefaultNumberOfThreadsByPlatform();\n    }\n\n  \/\/ limit the number of threads to m_GlobalMaximumNumberOfThreads\n  threadCount  = std::min( threadCount, ThreadIdType(ITK_MAX_THREADS) );\n\n  \/\/ verify that the default number of threads is larger than zero\n  threadCount  = std::max( threadCount, NumericTraits<ThreadIdType>::OneValue() );\n\n  return threadCount;\n}\n\nvoid\nThreadPool\n::AddThreads(ThreadIdType count)\n{\n  MutexLockHolder<SimpleFastMutexLock> mutexHolder(m_Mutex);\n  m_Threads.reserve(m_Threads.size() + count);\n  for( unsigned int i = 0; i < count; ++i )\n    {\n    AddThread();\n    }\n}\n\nvoid\nThreadPool\n::DeleteThreads()\n{\n  MutexLockHolder<SimpleFastMutexLock> mutexHolder(m_Mutex);\n  for (auto & thread : m_Threads)\n    {\n    if (!PlatformClose(thread))\n      {\n      m_ExceptionOccurred = true;\n      }\n    }\n}\n\nint\nThreadPool\n::GetNumberOfCurrentlyIdleThreads() const\n{\n  MutexLockHolder<SimpleFastMutexLock> mutexHolder(m_Mutex);\n  if ( m_Threads.empty() ) \/\/not yet initialized\n    {\n    const_cast<ThreadPool *>(this)->AddThreads(ThreadPool::GetGlobalDefaultNumberOfThreads());\n    }\n  return int(m_Threads.size()) - int(m_WorkQueue.size()); \/\/ lousy approximation\n}\n\nITK_THREAD_RETURN_TYPE\nnoOperation(void *)\n{\n  return ITK_THREAD_RETURN_VALUE;\n}\n\nThreadPool\n::~ThreadPool()\n{\n  unsigned waitCount = m_Threads.size();\n#if defined(_WIN32) && defined(ITKCommon_EXPORTS)\n  \/\/this destructor is called during DllMain's DLL_PROCESS_DETACH.\n  \/\/Because ITKCommon-4.X.dll is usually being detached due to process termination,\n  \/\/lpvReserved is non-NULL meaning that \"all threads in the process\n  \/\/except the current thread either have exited already or have been\n  \/\/explicitly terminated by a call to the ExitProcess function\".\n  Sleep(1); \/\/give some time to other threads to completely clean up\n  for (ThreadIdType i = 0; i < m_Threads.size(); i++)\n    {\n    DWORD dwWaitResult = WaitForSingleObject(m_Threads[i], 0);\n    if (dwWaitResult == WAIT_OBJECT_0) \/\/thread has finished!\n      {\n      waitCount--;\n      }\n    }\n#endif\n\n  if (waitCount == m_Threads.size()) \/\/add dummy jobs for clean thread exit\n    {\n    std::vector<Semaphore> jobSem(waitCount);\n    for (ThreadIdType i = 0; i < waitCount; i++)\n      {\n      ThreadJob dummy;\n      dummy.m_ThreadFunction = &noOperation;\n      dummy.m_Semaphore = &jobSem[i];\n      dummy.m_UserData = nullptr; \/\/makes dummy jobs easier to spot while debugging\n      AddWork(dummy);\n      }\n\n    for (ThreadIdType i = 0; i < waitCount; i++)\n      {\n      WaitForJob(jobSem[i]);\n      }\n    }\n\n  DeleteThreads();\n  PlatformDelete(m_ThreadsSemaphore);\n}\n\nvoid\nThreadPool\n::WaitForJob(Semaphore& jobSemaphore)\n{\n  PlatformWait(jobSemaphore);\n  PlatformDelete(jobSemaphore);\n}\n\nvoid\nThreadPool\n::AddWork(const ThreadJob& threadJob)\n{\n  {\n    MutexLockHolder<SimpleFastMutexLock> mutexHolder(m_Mutex);\n    if ( m_Threads.empty() ) \/\/first job\n      {\n      AddThreads(ThreadPool::GetGlobalDefaultNumberOfThreads());\n      }\n    m_WorkQueue.push_back(threadJob);\n  }\n\n  PlatformCreate(*threadJob.m_Semaphore);\n  PlatformSignal(m_ThreadsSemaphore);\n}\n\n\nITK_THREAD_RETURN_TYPE\nThreadPool\n::ThreadExecute(void *)\n{\n  \/\/plain pointer does not increase reference count\n  ThreadPool* threadPool = m_ThreadPoolInstance.GetPointer();\n  try\n    {\n    while (true)\n      {\n      threadPool->PlatformWait(threadPool->m_ThreadsSemaphore);\n\n      ThreadJob job;\n      {\n      MutexLockHolder<SimpleFastMutexLock> mutexHolder(m_Mutex);\n      if (threadPool->m_WorkQueue.empty()) \/\/another thread stole work meant for me\n        {\n        itkGenericExceptionMacro(<< \"Work queue is empty!\");\n        }\n      job = threadPool->m_WorkQueue.front();\n      threadPool->m_WorkQueue.pop_front();\n      } \/\/releases the lock\n\n      if (job.m_ThreadFunction == &noOperation)\n        {\n        PlatformSignal(*job.m_Semaphore);\n        break; \/\/exit infinite while loop\n        }\n      job.m_ThreadFunction(job.m_UserData); \/\/execute the job, lock has been released\n      PlatformSignal(*job.m_Semaphore);\n      }\n    }\n  catch (ExceptionObject& exc)\n    {\n    std::cerr << exc << std::endl;\n    threadPool->m_ExceptionOccurred = true;\n    throw;\n    }\n  return ITK_THREAD_RETURN_VALUE;\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2018 Smirnov Vladimir mapron1@gmail.com\n * Source code licensed under the Apache License, Version 2.0 (the \"License\");\n * You may not use this file except in compliance with the License.\n * You may obtain a copy of the License at http:\/\/www.apache.org\/licenses\/LICENSE-2.0 or in file COPYING-APACHE-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.h\n *\/\n\n#include \"VersionChecker.h\"\n#include \"MsvcEnvironment.h\"\n\n#include <FileUtils.h>\n#include <Syslogger.h>\n\n#include <regex>\n\nnamespace Wuild\n{\n\nVersionChecker::VersionChecker(ILocalExecutor::Ptr localExecutor, IInvocationRewriter::Ptr rewriter)\n\t: m_localExecutor(std::move(localExecutor))\n\t, m_rewriter(std::move(rewriter))\n{\n\n}\n\nIVersionChecker::ToolType VersionChecker::GuessToolType(const ToolInvocation::Id &toolId) const\n{\n\tif (toolId.m_toolExecutable.empty())\n\t\tthrow std::logic_error(\"Tool id should be resolved before use.\");\n\n\tconst std::string executableName = FileInfo(toolId.m_toolExecutable).GetFullname();\n\n\tif (executableName.find(\"cl.exe\") != std::string::npos)\n\t\treturn ToolType::MSVC;\n\n\tif (executableName.find(\"clang\") != std::string::npos)\n\t\treturn ToolType::Clang;\n\n\tstatic const std::vector<std::string> s_gccNames {\"gcc\", \"g++\", \"mingw\", \"g__~1\"}; \/\/ \"g__~1\" is Windows short name.\n\tfor (const auto & gccName : s_gccNames)\n\t{\n\t\tif (executableName.find(gccName) != std::string::npos)\n\t\t\treturn ToolType::GCC;\n\t}\n\treturn ToolType::Unknown;\n}\n\nIVersionChecker::VersionMap VersionChecker::DetermineToolVersions(const std::vector<std::string> & toolIds) const\n{\n\tVersionMap result;\n\tfor (const InvocationRewriterConfig::Tool & tool : m_rewriter->GetConfig().m_tools)\n\t{\n\t\tif (!toolIds.empty() && std::find(toolIds.cbegin(), toolIds.cend(), tool.m_id) == toolIds.cend())\n\t\t\tcontinue;\n\n\t\tif (!tool.m_version.empty())\n\t\t{\n\t\t\tresult[tool.m_id] = tool.m_version;\n\t\t\tcontinue;\n\t\t}\n\t\tToolInvocation::Id id;\n\t\tid.m_toolId = tool.m_id;\n\t\tid = m_rewriter->CompleteToolId(id);\n\t\tif (id.m_toolExecutable.empty())\n\t\t{\n\t\t\tresult[tool.m_id] = \"\";\n\t\t\tcontinue;\n\t\t}\n\n\t\tconst auto toolType = GuessToolType(id);\n\t\tconst auto version = GetToolVersion(id, tool.m_envCommand, toolType);\n\t\tresult[tool.m_id] = version;\n\t}\n\treturn result;\n}\n\n\nIVersionChecker::Version VersionChecker::GetToolVersion(const ToolInvocation::Id &toolId, const std::string & envCommand, IVersionChecker::ToolType type) const\n{\n\tif (type == ToolType::Unknown)\n\t\treturn IVersionChecker::Version();\n\n\tstatic const std::regex versionRegexGnu(\"\\\\d+\\\\.[0-9.]+\");\n\tstatic const std::regex versionRegexCl(R\"(\\d+\\.\\d+\\.\\d+\\.\\d+ for \\w+)\");\n\n\tauto versionCheckTask = std::make_shared<LocalExecutorTask>();\n\tversionCheckTask->m_readOutput = versionCheckTask->m_writeInput = false;\n\tversionCheckTask->m_invocation.m_id = toolId;\n\tif (!envCommand.empty())\n\t\tversionCheckTask->m_invocation.SetEnvironment(ExtractVsVars(envCommand, m_localExecutor));\n\n\tIVersionChecker::Version result;\n\n\tversionCheckTask->m_callback = [&result, type](LocalExecutorResult::Ptr taskResult){\n\t\tstd::smatch match;\n\t\tif (std::regex_search(taskResult->m_stdOut, match, type == ToolType::MSVC ? versionRegexCl : versionRegexGnu))\n\t\t{\n\t\t\tresult = match[0].str();\n\t\t}\n\t};\n\n\tif (type == ToolType::Clang)\n\t\tversionCheckTask->m_invocation.m_args = {\"--version\"};\n\telse if (type == ToolType::GCC)\n\t\tversionCheckTask->m_invocation.m_args = {\"-dumpfullversion\", \"-dumpversion\"};\n\n\tm_localExecutor->SyncExecTask(versionCheckTask);\n\n\treturn result;\n}\n\n}\n<commit_msg>Fixed cl.exe version regexp<commit_after>\/*\n * Copyright (C) 2018 Smirnov Vladimir mapron1@gmail.com\n * Source code licensed under the Apache License, Version 2.0 (the \"License\");\n * You may not use this file except in compliance with the License.\n * You may obtain a copy of the License at http:\/\/www.apache.org\/licenses\/LICENSE-2.0 or in file COPYING-APACHE-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.h\n *\/\n\n#include \"VersionChecker.h\"\n#include \"MsvcEnvironment.h\"\n\n#include <FileUtils.h>\n#include <Syslogger.h>\n\n#include <regex>\n\nnamespace Wuild\n{\n\nVersionChecker::VersionChecker(ILocalExecutor::Ptr localExecutor, IInvocationRewriter::Ptr rewriter)\n\t: m_localExecutor(std::move(localExecutor))\n\t, m_rewriter(std::move(rewriter))\n{\n\n}\n\nIVersionChecker::ToolType VersionChecker::GuessToolType(const ToolInvocation::Id &toolId) const\n{\n\tif (toolId.m_toolExecutable.empty())\n\t\tthrow std::logic_error(\"Tool id should be resolved before use.\");\n\n\tconst std::string executableName = FileInfo(toolId.m_toolExecutable).GetFullname();\n\n\tif (executableName.find(\"cl.exe\") != std::string::npos)\n\t\treturn ToolType::MSVC;\n\n\tif (executableName.find(\"clang\") != std::string::npos)\n\t\treturn ToolType::Clang;\n\n\tstatic const std::vector<std::string> s_gccNames {\"gcc\", \"g++\", \"mingw\", \"g__~1\"}; \/\/ \"g__~1\" is Windows short name.\n\tfor (const auto & gccName : s_gccNames)\n\t{\n\t\tif (executableName.find(gccName) != std::string::npos)\n\t\t\treturn ToolType::GCC;\n\t}\n\treturn ToolType::Unknown;\n}\n\nIVersionChecker::VersionMap VersionChecker::DetermineToolVersions(const std::vector<std::string> & toolIds) const\n{\n\tVersionMap result;\n\tfor (const InvocationRewriterConfig::Tool & tool : m_rewriter->GetConfig().m_tools)\n\t{\n\t\tif (!toolIds.empty() && std::find(toolIds.cbegin(), toolIds.cend(), tool.m_id) == toolIds.cend())\n\t\t\tcontinue;\n\n\t\tif (!tool.m_version.empty())\n\t\t{\n\t\t\tresult[tool.m_id] = tool.m_version;\n\t\t\tcontinue;\n\t\t}\n\t\tToolInvocation::Id id;\n\t\tid.m_toolId = tool.m_id;\n\t\tid = m_rewriter->CompleteToolId(id);\n\t\tif (id.m_toolExecutable.empty())\n\t\t{\n\t\t\tresult[tool.m_id] = \"\";\n\t\t\tcontinue;\n\t\t}\n\n\t\tconst auto toolType = GuessToolType(id);\n\t\tconst auto version = GetToolVersion(id, tool.m_envCommand, toolType);\n\t\tresult[tool.m_id] = version;\n\t}\n\treturn result;\n}\n\n\nIVersionChecker::Version VersionChecker::GetToolVersion(const ToolInvocation::Id &toolId, const std::string & envCommand, IVersionChecker::ToolType type) const\n{\n\tif (type == ToolType::Unknown)\n\t\treturn IVersionChecker::Version();\n\n\tstatic const std::regex versionRegexGnu(\"\\\\d+\\\\.[0-9.]+\");\n\tstatic const std::regex versionRegexCl(R\"(\\d+\\.\\d+\\.\\d+(\\.\\d+)? for \\w+)\");\n\n\tauto versionCheckTask = std::make_shared<LocalExecutorTask>();\n\tversionCheckTask->m_readOutput = versionCheckTask->m_writeInput = false;\n\tversionCheckTask->m_invocation.m_id = toolId;\n\tif (!envCommand.empty())\n\t\tversionCheckTask->m_invocation.SetEnvironment(ExtractVsVars(envCommand, m_localExecutor));\n\n\tIVersionChecker::Version result;\n\n\tversionCheckTask->m_callback = [&result, type](LocalExecutorResult::Ptr taskResult){\n\t\tstd::smatch match;\n\t\tif (std::regex_search(taskResult->m_stdOut, match, type == ToolType::MSVC ? versionRegexCl : versionRegexGnu))\n\t\t{\n\t\t\tresult = match[0].str();\n\t\t}\n\t};\n\n\tif (type == ToolType::Clang)\n\t\tversionCheckTask->m_invocation.m_args = {\"--version\"};\n\telse if (type == ToolType::GCC)\n\t\tversionCheckTask->m_invocation.m_args = {\"-dumpfullversion\", \"-dumpversion\"};\n\n\tm_localExecutor->SyncExecTask(versionCheckTask);\n\n\treturn result;\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: mnemonic.cxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: pl $ $Date: 2002-03-25 15: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#define _SV_MNEMONIC_CXX\n\n#include <string.h>\n#include <svapp.hxx>\n#include <settings.hxx>\n#include <mnemonic.hxx>\n\n#include <unohelp.hxx>\n\n#ifndef _COM_SUN_STAR_I18N_XCHARACTERCLASSIFICATION_HPP_\n#include <com\/sun\/star\/i18n\/XCharacterClassification.hpp>\n#endif\n\nusing namespace ::com::sun::star;\n\n\n\/\/ =======================================================================\n\nImplMnemonicGenerator::ImplMnemonicGenerator()\n{\n    memset( maMnemonics, 1, sizeof( maMnemonics ) );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nUSHORT ImplMnemonicGenerator::ImplGetMnemonicIndex( sal_Unicode c )\n{\n    static USHORT const aImplMnemonicRangeTab[MNEMONIC_RANGES*2] =\n    {\n        MNEMONIC_RANGE_1_START, MNEMONIC_RANGE_1_END,\n        MNEMONIC_RANGE_2_START, MNEMONIC_RANGE_2_END,\n        MNEMONIC_RANGE_3_START, MNEMONIC_RANGE_3_END,\n        MNEMONIC_RANGE_4_START, MNEMONIC_RANGE_4_END\n    };\n\n    USHORT nMnemonicIndex = 0;\n    for ( USHORT i = 0; i < MNEMONIC_RANGES; i++ )\n    {\n        if ( (c >= aImplMnemonicRangeTab[i*2]) &&\n             (c <= aImplMnemonicRangeTab[i*2+1]) )\n            return nMnemonicIndex+c-aImplMnemonicRangeTab[i*2];\n\n        nMnemonicIndex += aImplMnemonicRangeTab[i*2+1]-aImplMnemonicRangeTab[i*2];\n    }\n\n    return MNEMONIC_INDEX_NOTFOUND;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nsal_Unicode ImplMnemonicGenerator::ImplFindMnemonic( const XubString& rKey )\n{\n    xub_StrLen nIndex = 0;\n    while ( (nIndex = rKey.Search( MNEMONIC_CHAR, nIndex )) != STRING_NOTFOUND )\n    {\n        sal_Unicode cMnemonic = rKey.GetChar( nIndex+1 );\n        if ( cMnemonic != MNEMONIC_CHAR )\n            return cMnemonic;\n        nIndex += 2;\n    }\n\n    return 0;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid ImplMnemonicGenerator::RegisterMnemonic( const XubString& rKey )\n{\n    const ::com::sun::star::lang::Locale& rLocale = Application::GetSettings().GetUILocale();\n    uno::Reference < i18n::XCharacterClassification > xCharClass = GetCharClass();\n\n    XubString aKey = xCharClass->toUpper( rKey, 0, rKey.Len(), rLocale );\n\n    \/\/ If we find a Mnemonic, set the flag. In other case count the\n    \/\/ characters, because we need this to set most as possible\n    \/\/ Mnemonics\n    sal_Unicode cMnemonic = ImplFindMnemonic( aKey );\n    if ( cMnemonic )\n    {\n        USHORT nMnemonicIndex = ImplGetMnemonicIndex( cMnemonic );\n        if ( nMnemonicIndex != MNEMONIC_INDEX_NOTFOUND )\n            maMnemonics[nMnemonicIndex] = 0;\n    }\n    else\n    {\n        xub_StrLen nIndex = 0;\n        xub_StrLen nLen = aKey.Len();\n        while ( nIndex < nLen )\n        {\n            sal_Unicode c = aKey.GetChar( nIndex );\n\n            USHORT nMnemonicIndex = ImplGetMnemonicIndex( c );\n            if ( nMnemonicIndex != MNEMONIC_INDEX_NOTFOUND )\n            {\n                if ( maMnemonics[nMnemonicIndex] && (maMnemonics[nMnemonicIndex] < 0xFF) )\n                    maMnemonics[nMnemonicIndex]++;\n            }\n\n            nIndex++;\n        }\n    }\n}\n\n\/\/ -----------------------------------------------------------------------\n\nBOOL ImplMnemonicGenerator::CreateMnemonic( XubString& rKey )\n{\n    if ( !rKey.Len() || ImplFindMnemonic( rKey ) )\n        return FALSE;\n\n    const ::com::sun::star::lang::Locale& rLocale = Application::GetSettings().GetUILocale();\n    uno::Reference < i18n::XCharacterClassification > xCharClass = GetCharClass();\n\n    XubString aKey = xCharClass->toUpper( rKey, 0, rKey.Len(), rLocale );\n\n    BOOL bChanged = FALSE;\n    xub_StrLen nLen = aKey.Len();\n\n    \/\/ 1) first try the first character of a word\n    int             nCJK = 0;\n    USHORT          nMnemonicIndex;\n    sal_Unicode     c;\n    xub_StrLen      nIndex = 0;\n    do\n    {\n        c = aKey.GetChar( nIndex );\n\n        if ( nCJK != 2 )\n        {\n            if ( ((c >= 0x3000) && (c <= 0xD7FF)) ||\n                 ((c >= 0xFF61) && (c <= 0xFFDC)) )\n                nCJK = 1;\n            else if ( ((c >= 0x0030) && (c <= 0x0039)) ||\n                      ((c >= 0x0041) && (c <= 0x005A)) ||\n                      ((c >= 0x0061) && (c <= 0x007A)) ||\n                      ((c >= 0x0370) && (c <= 0x037F)) ||\n                      ((c >= 0x0400) && (c <= 0x04FF)) )\n                nCJK = 2;\n        }\n\n        nMnemonicIndex = ImplGetMnemonicIndex( c );\n        if ( nMnemonicIndex != MNEMONIC_INDEX_NOTFOUND )\n        {\n            if ( maMnemonics[nMnemonicIndex] )\n            {\n                maMnemonics[nMnemonicIndex] = 0;\n                rKey.Insert( MNEMONIC_CHAR, nIndex );\n                bChanged = TRUE;\n                break;\n            }\n        }\n\n        \/\/ Search for next word\n        do\n        {\n            nIndex++;\n            c = aKey.GetChar( nIndex );\n            if ( c == ' ' )\n                break;\n        }\n        while ( nIndex < nLen );\n        nIndex++;\n    }\n    while ( nIndex < nLen );\n\n    \/\/ 2) search for a unique\/uncommon character\n    if ( !bChanged )\n    {\n        USHORT      nBestCount = 0xFFFF;\n        USHORT      nBestMnemonicIndex;\n        xub_StrLen  nBestIndex;\n        nIndex = 0;\n        do\n        {\n            c = aKey.GetChar( nIndex );\n            nMnemonicIndex = ImplGetMnemonicIndex( c );\n            if ( nMnemonicIndex != MNEMONIC_INDEX_NOTFOUND )\n            {\n                if ( maMnemonics[nMnemonicIndex] )\n                {\n                    if ( maMnemonics[nMnemonicIndex] < nBestCount )\n                    {\n                        nBestCount = maMnemonics[nMnemonicIndex];\n                        nBestIndex = nIndex;\n                        nBestMnemonicIndex = nMnemonicIndex;\n                        if ( nBestCount == 2 )\n                            break;\n                    }\n                }\n            }\n\n            nIndex++;\n        }\n        while ( nIndex < nLen );\n\n        if ( nBestCount != 0xFFFF )\n        {\n            maMnemonics[nBestMnemonicIndex] = 0;\n            rKey.Insert( MNEMONIC_CHAR, nBestIndex );\n            bChanged = TRUE;\n        }\n    }\n\n    \/\/ 3) Add English Mnemonic for CJK Text\n    if ( !bChanged && (nCJK == 1) && rKey.Len() )\n    {\n        \/\/ Append Ascii Mnemonic\n        for ( c = MNEMONIC_RANGE_2_START; c <= MNEMONIC_RANGE_2_END; c++ )\n        {\n            nMnemonicIndex = ImplGetMnemonicIndex( c );\n            if ( nMnemonicIndex != MNEMONIC_INDEX_NOTFOUND )\n            {\n                if ( maMnemonics[nMnemonicIndex] )\n                {\n                    maMnemonics[nMnemonicIndex] = 0;\n                    UniString aStr( '(' );\n                    aStr += MNEMONIC_CHAR;\n                    aStr += c;\n                    aStr += ')';\n                    nIndex = rKey.Len();\n                    static sal_Unicode cGreaterGreater[] = { 0xFF1E, 0xFF1E };\n                    if ( rKey.EqualsAscii( \">>\", nIndex-2, 2 ) ||\n                         rKey.Equals( cGreaterGreater, nIndex-2, 2 ) )\n                        nIndex -= 2;\n                    static sal_Unicode cDotDotDot[] = { 0xFF0E, 0xFF0E, 0xFF0E };\n                    if ( rKey.EqualsAscii( \"...\", nIndex-3, 3 ) ||\n                         rKey.Equals( cDotDotDot, nIndex-3, 3 ) )\n                        nIndex -= 3;\n                    sal_Unicode cLastChar = rKey.GetChar( nIndex-1 );\n                    if ( (cLastChar == ':') || (cLastChar == 0xFF1A) ||\n                         (cLastChar == '.') || (cLastChar == 0xFF0E) ||\n                         (cLastChar == '?') || (cLastChar == 0xFF1F) ||\n                         (cLastChar == ' ') )\n                        nIndex--;\n                    rKey.Insert( aStr, nIndex );\n                    bChanged = TRUE;\n                    break;\n                }\n            }\n        }\n    }\n\n    \/*\n     *  #97809# if all else fails use the first character of a word\n     *  anyway and live with duplicate mnemonics\n     *\/\n    nIndex = 0;\n    do\n    {\n        c = aKey.GetChar( nIndex );\n\n        nMnemonicIndex = ImplGetMnemonicIndex( c );\n        if ( nMnemonicIndex != MNEMONIC_INDEX_NOTFOUND )\n        {\n            maMnemonics[nMnemonicIndex] = 0;\n            rKey.Insert( MNEMONIC_CHAR, nIndex );\n            bChanged = TRUE;\n            break;\n        }\n\n        \/\/ Search for next word\n        do\n        {\n            nIndex++;\n            c = aKey.GetChar( nIndex );\n            if ( c == ' ' )\n                break;\n        }\n        while ( nIndex < nLen );\n        nIndex++;\n    }\n    while ( nIndex < nLen );\n\n    return bChanged;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nuno::Reference< i18n::XCharacterClassification > ImplMnemonicGenerator::GetCharClass()\n{\n    if ( !xCharClass.is() )\n        xCharClass = vcl::unohelper::CreateCharacterClassification();\n    return xCharClass;\n}\n<commit_msg>#97809# do not insert mnemonic twice<commit_after>\/*************************************************************************\n *\n *  $RCSfile: mnemonic.cxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: pl $ $Date: 2002-03-26 11:58: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#define _SV_MNEMONIC_CXX\n\n#include <string.h>\n#include <svapp.hxx>\n#include <settings.hxx>\n#include <mnemonic.hxx>\n\n#include <unohelp.hxx>\n\n#ifndef _COM_SUN_STAR_I18N_XCHARACTERCLASSIFICATION_HPP_\n#include <com\/sun\/star\/i18n\/XCharacterClassification.hpp>\n#endif\n\nusing namespace ::com::sun::star;\n\n\n\/\/ =======================================================================\n\nImplMnemonicGenerator::ImplMnemonicGenerator()\n{\n    memset( maMnemonics, 1, sizeof( maMnemonics ) );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nUSHORT ImplMnemonicGenerator::ImplGetMnemonicIndex( sal_Unicode c )\n{\n    static USHORT const aImplMnemonicRangeTab[MNEMONIC_RANGES*2] =\n    {\n        MNEMONIC_RANGE_1_START, MNEMONIC_RANGE_1_END,\n        MNEMONIC_RANGE_2_START, MNEMONIC_RANGE_2_END,\n        MNEMONIC_RANGE_3_START, MNEMONIC_RANGE_3_END,\n        MNEMONIC_RANGE_4_START, MNEMONIC_RANGE_4_END\n    };\n\n    USHORT nMnemonicIndex = 0;\n    for ( USHORT i = 0; i < MNEMONIC_RANGES; i++ )\n    {\n        if ( (c >= aImplMnemonicRangeTab[i*2]) &&\n             (c <= aImplMnemonicRangeTab[i*2+1]) )\n            return nMnemonicIndex+c-aImplMnemonicRangeTab[i*2];\n\n        nMnemonicIndex += aImplMnemonicRangeTab[i*2+1]-aImplMnemonicRangeTab[i*2];\n    }\n\n    return MNEMONIC_INDEX_NOTFOUND;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nsal_Unicode ImplMnemonicGenerator::ImplFindMnemonic( const XubString& rKey )\n{\n    xub_StrLen nIndex = 0;\n    while ( (nIndex = rKey.Search( MNEMONIC_CHAR, nIndex )) != STRING_NOTFOUND )\n    {\n        sal_Unicode cMnemonic = rKey.GetChar( nIndex+1 );\n        if ( cMnemonic != MNEMONIC_CHAR )\n            return cMnemonic;\n        nIndex += 2;\n    }\n\n    return 0;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid ImplMnemonicGenerator::RegisterMnemonic( const XubString& rKey )\n{\n    const ::com::sun::star::lang::Locale& rLocale = Application::GetSettings().GetUILocale();\n    uno::Reference < i18n::XCharacterClassification > xCharClass = GetCharClass();\n\n    XubString aKey = xCharClass->toUpper( rKey, 0, rKey.Len(), rLocale );\n\n    \/\/ If we find a Mnemonic, set the flag. In other case count the\n    \/\/ characters, because we need this to set most as possible\n    \/\/ Mnemonics\n    sal_Unicode cMnemonic = ImplFindMnemonic( aKey );\n    if ( cMnemonic )\n    {\n        USHORT nMnemonicIndex = ImplGetMnemonicIndex( cMnemonic );\n        if ( nMnemonicIndex != MNEMONIC_INDEX_NOTFOUND )\n            maMnemonics[nMnemonicIndex] = 0;\n    }\n    else\n    {\n        xub_StrLen nIndex = 0;\n        xub_StrLen nLen = aKey.Len();\n        while ( nIndex < nLen )\n        {\n            sal_Unicode c = aKey.GetChar( nIndex );\n\n            USHORT nMnemonicIndex = ImplGetMnemonicIndex( c );\n            if ( nMnemonicIndex != MNEMONIC_INDEX_NOTFOUND )\n            {\n                if ( maMnemonics[nMnemonicIndex] && (maMnemonics[nMnemonicIndex] < 0xFF) )\n                    maMnemonics[nMnemonicIndex]++;\n            }\n\n            nIndex++;\n        }\n    }\n}\n\n\/\/ -----------------------------------------------------------------------\n\nBOOL ImplMnemonicGenerator::CreateMnemonic( XubString& rKey )\n{\n    if ( !rKey.Len() || ImplFindMnemonic( rKey ) )\n        return FALSE;\n\n    const ::com::sun::star::lang::Locale& rLocale = Application::GetSettings().GetUILocale();\n    uno::Reference < i18n::XCharacterClassification > xCharClass = GetCharClass();\n\n    XubString aKey = xCharClass->toUpper( rKey, 0, rKey.Len(), rLocale );\n\n    BOOL bChanged = FALSE;\n    xub_StrLen nLen = aKey.Len();\n\n    \/\/ 1) first try the first character of a word\n    int             nCJK = 0;\n    USHORT          nMnemonicIndex;\n    sal_Unicode     c;\n    xub_StrLen      nIndex = 0;\n    do\n    {\n        c = aKey.GetChar( nIndex );\n\n        if ( nCJK != 2 )\n        {\n            if ( ((c >= 0x3000) && (c <= 0xD7FF)) ||\n                 ((c >= 0xFF61) && (c <= 0xFFDC)) )\n                nCJK = 1;\n            else if ( ((c >= 0x0030) && (c <= 0x0039)) ||\n                      ((c >= 0x0041) && (c <= 0x005A)) ||\n                      ((c >= 0x0061) && (c <= 0x007A)) ||\n                      ((c >= 0x0370) && (c <= 0x037F)) ||\n                      ((c >= 0x0400) && (c <= 0x04FF)) )\n                nCJK = 2;\n        }\n\n        nMnemonicIndex = ImplGetMnemonicIndex( c );\n        if ( nMnemonicIndex != MNEMONIC_INDEX_NOTFOUND )\n        {\n            if ( maMnemonics[nMnemonicIndex] )\n            {\n                maMnemonics[nMnemonicIndex] = 0;\n                rKey.Insert( MNEMONIC_CHAR, nIndex );\n                bChanged = TRUE;\n                break;\n            }\n        }\n\n        \/\/ Search for next word\n        do\n        {\n            nIndex++;\n            c = aKey.GetChar( nIndex );\n            if ( c == ' ' )\n                break;\n        }\n        while ( nIndex < nLen );\n        nIndex++;\n    }\n    while ( nIndex < nLen );\n\n    \/\/ 2) search for a unique\/uncommon character\n    if ( !bChanged )\n    {\n        USHORT      nBestCount = 0xFFFF;\n        USHORT      nBestMnemonicIndex;\n        xub_StrLen  nBestIndex;\n        nIndex = 0;\n        do\n        {\n            c = aKey.GetChar( nIndex );\n            nMnemonicIndex = ImplGetMnemonicIndex( c );\n            if ( nMnemonicIndex != MNEMONIC_INDEX_NOTFOUND )\n            {\n                if ( maMnemonics[nMnemonicIndex] )\n                {\n                    if ( maMnemonics[nMnemonicIndex] < nBestCount )\n                    {\n                        nBestCount = maMnemonics[nMnemonicIndex];\n                        nBestIndex = nIndex;\n                        nBestMnemonicIndex = nMnemonicIndex;\n                        if ( nBestCount == 2 )\n                            break;\n                    }\n                }\n            }\n\n            nIndex++;\n        }\n        while ( nIndex < nLen );\n\n        if ( nBestCount != 0xFFFF )\n        {\n            maMnemonics[nBestMnemonicIndex] = 0;\n            rKey.Insert( MNEMONIC_CHAR, nBestIndex );\n            bChanged = TRUE;\n        }\n    }\n\n    \/\/ 3) Add English Mnemonic for CJK Text\n    if ( !bChanged && (nCJK == 1) && rKey.Len() )\n    {\n        \/\/ Append Ascii Mnemonic\n        for ( c = MNEMONIC_RANGE_2_START; c <= MNEMONIC_RANGE_2_END; c++ )\n        {\n            nMnemonicIndex = ImplGetMnemonicIndex( c );\n            if ( nMnemonicIndex != MNEMONIC_INDEX_NOTFOUND )\n            {\n                if ( maMnemonics[nMnemonicIndex] )\n                {\n                    maMnemonics[nMnemonicIndex] = 0;\n                    UniString aStr( '(' );\n                    aStr += MNEMONIC_CHAR;\n                    aStr += c;\n                    aStr += ')';\n                    nIndex = rKey.Len();\n                    static sal_Unicode cGreaterGreater[] = { 0xFF1E, 0xFF1E };\n                    if ( rKey.EqualsAscii( \">>\", nIndex-2, 2 ) ||\n                         rKey.Equals( cGreaterGreater, nIndex-2, 2 ) )\n                        nIndex -= 2;\n                    static sal_Unicode cDotDotDot[] = { 0xFF0E, 0xFF0E, 0xFF0E };\n                    if ( rKey.EqualsAscii( \"...\", nIndex-3, 3 ) ||\n                         rKey.Equals( cDotDotDot, nIndex-3, 3 ) )\n                        nIndex -= 3;\n                    sal_Unicode cLastChar = rKey.GetChar( nIndex-1 );\n                    if ( (cLastChar == ':') || (cLastChar == 0xFF1A) ||\n                         (cLastChar == '.') || (cLastChar == 0xFF0E) ||\n                         (cLastChar == '?') || (cLastChar == 0xFF1F) ||\n                         (cLastChar == ' ') )\n                        nIndex--;\n                    rKey.Insert( aStr, nIndex );\n                    bChanged = TRUE;\n                    break;\n                }\n            }\n        }\n    }\n\n    if( ! bChanged )\n    {\n        \/*\n         *  #97809# if all else fails use the first character of a word\n         *  anyway and live with duplicate mnemonics\n         *\/\n        nIndex = 0;\n        do\n        {\n            c = aKey.GetChar( nIndex );\n\n            nMnemonicIndex = ImplGetMnemonicIndex( c );\n            if ( nMnemonicIndex != MNEMONIC_INDEX_NOTFOUND )\n            {\n                maMnemonics[nMnemonicIndex] = 0;\n                rKey.Insert( MNEMONIC_CHAR, nIndex );\n                bChanged = TRUE;\n                break;\n            }\n\n            \/\/ Search for next word\n            do\n            {\n                nIndex++;\n                c = aKey.GetChar( nIndex );\n                if ( c == ' ' )\n                    break;\n            }\n            while ( nIndex < nLen );\n            nIndex++;\n        }\n        while ( nIndex < nLen );\n    }\n\n    return bChanged;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nuno::Reference< i18n::XCharacterClassification > ImplMnemonicGenerator::GetCharClass()\n{\n    if ( !xCharClass.is() )\n        xCharClass = vcl::unohelper::CreateCharacterClassification();\n    return xCharClass;\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 \"views\/controls\/textfield\/textfield.h\"\n\n#if defined(OS_LINUX)\n#include <gdk\/gdkkeysyms.h>\n#endif\n\n#include \"app\/gfx\/insets.h\"\n#if defined(OS_WIN)\n#include \"app\/win_util.h\"\n#include \"base\/win_util.h\"\n#endif\n\n#include \"base\/keyboard_codes.h\"\n#include \"base\/string_util.h\"\n#include \"views\/controls\/textfield\/native_textfield_wrapper.h\"\n#include \"views\/widget\/widget.h\"\n\n#if defined(OS_WIN)\n\/\/ TODO(beng): this should be removed when the OS_WIN hack from\n\/\/ ViewHierarchyChanged is removed.\n#include \"views\/controls\/textfield\/native_textfield_win.h\"\n#endif\n\nnamespace views {\n\n\/\/ static\nconst char Textfield::kViewClassName[] = \"views\/Textfield\";\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Textfield\n\nTextfield::Textfield()\n    : native_wrapper_(NULL),\n      controller_(NULL),\n      style_(STYLE_DEFAULT),\n      read_only_(false),\n      default_width_in_chars_(0),\n      draw_border_(true),\n      text_color_(SK_ColorBLACK),\n      use_default_text_color_(true),\n      background_color_(SK_ColorWHITE),\n      use_default_background_color_(true),\n      num_lines_(1),\n      initialized_(false) {\n  SetFocusable(true);\n}\n\nTextfield::Textfield(StyleFlags style)\n    : native_wrapper_(NULL),\n      controller_(NULL),\n      style_(style),\n      read_only_(false),\n      default_width_in_chars_(0),\n      draw_border_(true),\n      text_color_(SK_ColorBLACK),\n      use_default_text_color_(true),\n      background_color_(SK_ColorWHITE),\n      use_default_background_color_(true),\n      num_lines_(1),\n      initialized_(false) {\n  SetFocusable(true);\n}\n\nTextfield::~Textfield() {\n}\n\nvoid Textfield::SetController(Controller* controller) {\n  controller_ = controller;\n}\n\nTextfield::Controller* Textfield::GetController() const {\n  return controller_;\n}\n\nvoid Textfield::SetReadOnly(bool read_only) {\n  read_only_ = read_only;\n  if (native_wrapper_) {\n    native_wrapper_->UpdateReadOnly();\n    native_wrapper_->UpdateTextColor();\n    native_wrapper_->UpdateBackgroundColor();\n  }\n}\n\nbool Textfield::IsPassword() const {\n  return style_ & STYLE_PASSWORD;\n}\n\nbool Textfield::IsMultiLine() const {\n  return !!(style_ & STYLE_MULTILINE);\n}\n\nvoid Textfield::SetText(const string16& text) {\n  text_ = text;\n  if (native_wrapper_)\n    native_wrapper_->UpdateText();\n}\n\nvoid Textfield::AppendText(const string16& text) {\n  text_ += text;\n  if (native_wrapper_)\n    native_wrapper_->AppendText(text);\n}\n\nvoid Textfield::SelectAll() {\n  if (native_wrapper_)\n    native_wrapper_->SelectAll();\n}\n\nstring16 Textfield::GetSelectedText() const {\n  if (native_wrapper_)\n    return native_wrapper_->GetSelectedText();\n  return string16();\n}\n\nvoid Textfield::ClearSelection() const {\n  if (native_wrapper_)\n    native_wrapper_->ClearSelection();\n}\n\nvoid Textfield::SetTextColor(SkColor color) {\n  text_color_ = color;\n  use_default_text_color_ = false;\n  if (native_wrapper_)\n    native_wrapper_->UpdateTextColor();\n}\n\nvoid Textfield::UseDefaultTextColor() {\n  use_default_text_color_ = true;\n  if (native_wrapper_)\n    native_wrapper_->UpdateTextColor();\n}\n\nvoid Textfield::SetBackgroundColor(SkColor color) {\n  background_color_ = color;\n  use_default_background_color_ = false;\n  if (native_wrapper_)\n    native_wrapper_->UpdateBackgroundColor();\n}\n\nvoid Textfield::UseDefaultBackgroundColor() {\n  use_default_background_color_ = true;\n  if (native_wrapper_)\n    native_wrapper_->UpdateBackgroundColor();\n}\n\nvoid Textfield::SetFont(const gfx::Font& font) {\n  font_ = font;\n  if (native_wrapper_)\n    native_wrapper_->UpdateFont();\n}\n\nvoid Textfield::SetHorizontalMargins(int left, int right) {\n  if (native_wrapper_)\n    native_wrapper_->SetHorizontalMargins(left, right);\n}\n\nvoid Textfield::SetHeightInLines(int num_lines) {\n  DCHECK(IsMultiLine());\n  num_lines_ = num_lines;\n}\n\nvoid Textfield::RemoveBorder() {\n  if (!draw_border_)\n    return;\n\n  draw_border_ = false;\n  if (native_wrapper_)\n    native_wrapper_->UpdateBorder();\n}\n\n\nvoid Textfield::SyncText() {\n  if (native_wrapper_)\n    text_ = native_wrapper_->GetText();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Textfield, View overrides:\n\nvoid Textfield::Layout() {\n  if (native_wrapper_) {\n    native_wrapper_->GetView()->SetBounds(GetLocalBounds(true));\n    native_wrapper_->GetView()->Layout();\n  }\n}\n\ngfx::Size Textfield::GetPreferredSize() {\n  gfx::Insets insets;\n  if (draw_border_ && native_wrapper_)\n    insets = native_wrapper_->CalculateInsets();\n  return gfx::Size(font_.GetExpectedTextWidth(default_width_in_chars_) +\n                       insets.width(),\n                   num_lines_ * font_.height() + insets.height());\n}\n\nbool Textfield::IsFocusable() const {\n  return IsEnabled() && !read_only_;\n}\n\nvoid Textfield::AboutToRequestFocusFromTabTraversal(bool reverse) {\n  SelectAll();\n}\n\nbool Textfield::SkipDefaultKeyEventProcessing(const KeyEvent& e) {\n#if defined(OS_WIN)\n  \/\/ TODO(hamaji): Figure out which keyboard combinations we need to add here,\n  \/\/               similar to LocationBarView::SkipDefaultKeyEventProcessing.\n  base::KeyboardCode key = e.GetKeyCode();\n  if (key == base::VKEY_BACK)\n    return true;  \/\/ We'll handle BackSpace ourselves.\n\n  \/\/ We don't translate accelerators for ALT + NumPad digit, they are used for\n  \/\/ entering special characters.  We do translate alt-home.\n  if (e.IsAltDown() && (key != base::VKEY_HOME) &&\n      win_util::IsNumPadDigit(key, e.IsExtendedKey()))\n    return true;\n#endif\n  return false;\n}\n\nvoid Textfield::SetEnabled(bool enabled) {\n  View::SetEnabled(enabled);\n  if (native_wrapper_)\n    native_wrapper_->UpdateEnabled();\n}\n\nvoid Textfield::Focus() {\n  if (native_wrapper_) {\n    \/\/ Forward the focus to the wrapper if it exists.\n    native_wrapper_->SetFocus();\n  } else {\n    \/\/ If there is no wrapper, cause the RootView to be focused so that we still\n    \/\/ get keyboard messages.\n    View::Focus();\n  }\n}\n\nvoid Textfield::ViewHierarchyChanged(bool is_add, View* parent, View* child) {\n  if (is_add && !native_wrapper_ && GetWidget() && !initialized_) {\n    initialized_ = true;\n\n    \/\/ The native wrapper's lifetime will be managed by the view hierarchy after\n    \/\/ we call AddChildView.\n    native_wrapper_ = NativeTextfieldWrapper::CreateWrapper(this);\n    AddChildView(native_wrapper_->GetView());\n    \/\/ TODO(beng): Move this initialization to NativeTextfieldWin once it\n    \/\/             subclasses NativeControlWin.\n    native_wrapper_->UpdateText();\n    native_wrapper_->UpdateTextColor();\n    native_wrapper_->UpdateBackgroundColor();\n    native_wrapper_->UpdateReadOnly();\n    native_wrapper_->UpdateFont();\n    native_wrapper_->UpdateEnabled();\n    native_wrapper_->UpdateBorder();\n\n#if defined(OS_WIN)\n    \/\/ TODO(beng): remove this once NativeTextfieldWin subclasses\n    \/\/ NativeControlWin. This is currently called to perform post-AddChildView\n    \/\/ initialization for the wrapper. The GTK version subclasses things\n    \/\/ correctly and doesn't need this.\n    \/\/\n    \/\/ Remove the include for native_textfield_win.h above when you fix this.\n    static_cast<NativeTextfieldWin*>(native_wrapper_)->AttachHack();\n#endif\n  }\n}\n\nstd::string Textfield::GetClassName() const {\n  return kViewClassName;\n}\n\nNativeTextfieldWrapper* Textfield::CreateWrapper() {\n  NativeTextfieldWrapper* native_wrapper =\n      NativeTextfieldWrapper::CreateWrapper(this);\n\n  native_wrapper->UpdateText();\n  native_wrapper->UpdateBackgroundColor();\n  native_wrapper->UpdateReadOnly();\n  native_wrapper->UpdateFont();\n  native_wrapper->UpdateEnabled();\n  native_wrapper->UpdateBorder();\n\n  return native_wrapper;\n}\n\nbase::KeyboardCode Textfield::Keystroke::GetKeyboardCode() const {\n#if defined(OS_WIN)\n  return static_cast<base::KeyboardCode>(key_);\n#else\n  return static_cast<base::KeyboardCode>(event_.keyval);\n#endif\n}\n\n#if defined(OS_WIN)\nbool Textfield::Keystroke::IsControlHeld() const {\n  return win_util::IsCtrlPressed();\n}\n\nbool Textfield::Keystroke::IsShiftHeld() const {\n  return win_util::IsShiftPressed();\n}\n#else\nbool Textfield::Keystroke::IsControlHeld() const {\n  return (event_.state & gtk_accelerator_get_default_mod_mask()) ==\n      GDK_CONTROL_MASK;\n}\n\nbool Textfield::Keystroke::IsShiftHeld() const {\n  return (event_.state & gtk_accelerator_get_default_mod_mask()) ==\n      GDK_SHIFT_MASK;\n}\n#endif\n\n}  \/\/ namespace views\n<commit_msg>Backspace should not be processed as an accelerator in textfield, so it really removes the previous character.<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\/textfield\/textfield.h\"\n\n#if defined(OS_LINUX)\n#include <gdk\/gdkkeysyms.h>\n#endif\n\n#include \"app\/gfx\/insets.h\"\n#if defined(OS_WIN)\n#include \"app\/win_util.h\"\n#include \"base\/win_util.h\"\n#endif\n\n#include \"base\/keyboard_codes.h\"\n#include \"base\/string_util.h\"\n#include \"views\/controls\/textfield\/native_textfield_wrapper.h\"\n#include \"views\/widget\/widget.h\"\n\n#if defined(OS_WIN)\n\/\/ TODO(beng): this should be removed when the OS_WIN hack from\n\/\/ ViewHierarchyChanged is removed.\n#include \"views\/controls\/textfield\/native_textfield_win.h\"\n#endif\n\nnamespace views {\n\n\/\/ static\nconst char Textfield::kViewClassName[] = \"views\/Textfield\";\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Textfield\n\nTextfield::Textfield()\n    : native_wrapper_(NULL),\n      controller_(NULL),\n      style_(STYLE_DEFAULT),\n      read_only_(false),\n      default_width_in_chars_(0),\n      draw_border_(true),\n      text_color_(SK_ColorBLACK),\n      use_default_text_color_(true),\n      background_color_(SK_ColorWHITE),\n      use_default_background_color_(true),\n      num_lines_(1),\n      initialized_(false) {\n  SetFocusable(true);\n}\n\nTextfield::Textfield(StyleFlags style)\n    : native_wrapper_(NULL),\n      controller_(NULL),\n      style_(style),\n      read_only_(false),\n      default_width_in_chars_(0),\n      draw_border_(true),\n      text_color_(SK_ColorBLACK),\n      use_default_text_color_(true),\n      background_color_(SK_ColorWHITE),\n      use_default_background_color_(true),\n      num_lines_(1),\n      initialized_(false) {\n  SetFocusable(true);\n}\n\nTextfield::~Textfield() {\n}\n\nvoid Textfield::SetController(Controller* controller) {\n  controller_ = controller;\n}\n\nTextfield::Controller* Textfield::GetController() const {\n  return controller_;\n}\n\nvoid Textfield::SetReadOnly(bool read_only) {\n  read_only_ = read_only;\n  if (native_wrapper_) {\n    native_wrapper_->UpdateReadOnly();\n    native_wrapper_->UpdateTextColor();\n    native_wrapper_->UpdateBackgroundColor();\n  }\n}\n\nbool Textfield::IsPassword() const {\n  return style_ & STYLE_PASSWORD;\n}\n\nbool Textfield::IsMultiLine() const {\n  return !!(style_ & STYLE_MULTILINE);\n}\n\nvoid Textfield::SetText(const string16& text) {\n  text_ = text;\n  if (native_wrapper_)\n    native_wrapper_->UpdateText();\n}\n\nvoid Textfield::AppendText(const string16& text) {\n  text_ += text;\n  if (native_wrapper_)\n    native_wrapper_->AppendText(text);\n}\n\nvoid Textfield::SelectAll() {\n  if (native_wrapper_)\n    native_wrapper_->SelectAll();\n}\n\nstring16 Textfield::GetSelectedText() const {\n  if (native_wrapper_)\n    return native_wrapper_->GetSelectedText();\n  return string16();\n}\n\nvoid Textfield::ClearSelection() const {\n  if (native_wrapper_)\n    native_wrapper_->ClearSelection();\n}\n\nvoid Textfield::SetTextColor(SkColor color) {\n  text_color_ = color;\n  use_default_text_color_ = false;\n  if (native_wrapper_)\n    native_wrapper_->UpdateTextColor();\n}\n\nvoid Textfield::UseDefaultTextColor() {\n  use_default_text_color_ = true;\n  if (native_wrapper_)\n    native_wrapper_->UpdateTextColor();\n}\n\nvoid Textfield::SetBackgroundColor(SkColor color) {\n  background_color_ = color;\n  use_default_background_color_ = false;\n  if (native_wrapper_)\n    native_wrapper_->UpdateBackgroundColor();\n}\n\nvoid Textfield::UseDefaultBackgroundColor() {\n  use_default_background_color_ = true;\n  if (native_wrapper_)\n    native_wrapper_->UpdateBackgroundColor();\n}\n\nvoid Textfield::SetFont(const gfx::Font& font) {\n  font_ = font;\n  if (native_wrapper_)\n    native_wrapper_->UpdateFont();\n}\n\nvoid Textfield::SetHorizontalMargins(int left, int right) {\n  if (native_wrapper_)\n    native_wrapper_->SetHorizontalMargins(left, right);\n}\n\nvoid Textfield::SetHeightInLines(int num_lines) {\n  DCHECK(IsMultiLine());\n  num_lines_ = num_lines;\n}\n\nvoid Textfield::RemoveBorder() {\n  if (!draw_border_)\n    return;\n\n  draw_border_ = false;\n  if (native_wrapper_)\n    native_wrapper_->UpdateBorder();\n}\n\n\nvoid Textfield::SyncText() {\n  if (native_wrapper_)\n    text_ = native_wrapper_->GetText();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Textfield, View overrides:\n\nvoid Textfield::Layout() {\n  if (native_wrapper_) {\n    native_wrapper_->GetView()->SetBounds(GetLocalBounds(true));\n    native_wrapper_->GetView()->Layout();\n  }\n}\n\ngfx::Size Textfield::GetPreferredSize() {\n  gfx::Insets insets;\n  if (draw_border_ && native_wrapper_)\n    insets = native_wrapper_->CalculateInsets();\n  return gfx::Size(font_.GetExpectedTextWidth(default_width_in_chars_) +\n                       insets.width(),\n                   num_lines_ * font_.height() + insets.height());\n}\n\nbool Textfield::IsFocusable() const {\n  return IsEnabled() && !read_only_;\n}\n\nvoid Textfield::AboutToRequestFocusFromTabTraversal(bool reverse) {\n  SelectAll();\n}\n\nbool Textfield::SkipDefaultKeyEventProcessing(const KeyEvent& e) {\n  \/\/ TODO(hamaji): Figure out which keyboard combinations we need to add here,\n  \/\/               similar to LocationBarView::SkipDefaultKeyEventProcessing.\n  base::KeyboardCode key = e.GetKeyCode();\n  if (key == base::VKEY_BACK)\n    return true;  \/\/ We'll handle BackSpace ourselves.\n\n#if defined(OS_WIN)\n  \/\/ We don't translate accelerators for ALT + NumPad digit on Windows, they are\n  \/\/ used for entering special characters.  We do translate alt-home.\n  if (e.IsAltDown() && (key != base::VKEY_HOME) &&\n      win_util::IsNumPadDigit(key, e.IsExtendedKey()))\n    return true;\n#endif\n  return false;\n}\n\nvoid Textfield::SetEnabled(bool enabled) {\n  View::SetEnabled(enabled);\n  if (native_wrapper_)\n    native_wrapper_->UpdateEnabled();\n}\n\nvoid Textfield::Focus() {\n  if (native_wrapper_) {\n    \/\/ Forward the focus to the wrapper if it exists.\n    native_wrapper_->SetFocus();\n  } else {\n    \/\/ If there is no wrapper, cause the RootView to be focused so that we still\n    \/\/ get keyboard messages.\n    View::Focus();\n  }\n}\n\nvoid Textfield::ViewHierarchyChanged(bool is_add, View* parent, View* child) {\n  if (is_add && !native_wrapper_ && GetWidget() && !initialized_) {\n    initialized_ = true;\n\n    \/\/ The native wrapper's lifetime will be managed by the view hierarchy after\n    \/\/ we call AddChildView.\n    native_wrapper_ = NativeTextfieldWrapper::CreateWrapper(this);\n    AddChildView(native_wrapper_->GetView());\n    \/\/ TODO(beng): Move this initialization to NativeTextfieldWin once it\n    \/\/             subclasses NativeControlWin.\n    native_wrapper_->UpdateText();\n    native_wrapper_->UpdateTextColor();\n    native_wrapper_->UpdateBackgroundColor();\n    native_wrapper_->UpdateReadOnly();\n    native_wrapper_->UpdateFont();\n    native_wrapper_->UpdateEnabled();\n    native_wrapper_->UpdateBorder();\n\n#if defined(OS_WIN)\n    \/\/ TODO(beng): remove this once NativeTextfieldWin subclasses\n    \/\/ NativeControlWin. This is currently called to perform post-AddChildView\n    \/\/ initialization for the wrapper. The GTK version subclasses things\n    \/\/ correctly and doesn't need this.\n    \/\/\n    \/\/ Remove the include for native_textfield_win.h above when you fix this.\n    static_cast<NativeTextfieldWin*>(native_wrapper_)->AttachHack();\n#endif\n  }\n}\n\nstd::string Textfield::GetClassName() const {\n  return kViewClassName;\n}\n\nNativeTextfieldWrapper* Textfield::CreateWrapper() {\n  NativeTextfieldWrapper* native_wrapper =\n      NativeTextfieldWrapper::CreateWrapper(this);\n\n  native_wrapper->UpdateText();\n  native_wrapper->UpdateBackgroundColor();\n  native_wrapper->UpdateReadOnly();\n  native_wrapper->UpdateFont();\n  native_wrapper->UpdateEnabled();\n  native_wrapper->UpdateBorder();\n\n  return native_wrapper;\n}\n\nbase::KeyboardCode Textfield::Keystroke::GetKeyboardCode() const {\n#if defined(OS_WIN)\n  return static_cast<base::KeyboardCode>(key_);\n#else\n  return static_cast<base::KeyboardCode>(event_.keyval);\n#endif\n}\n\n#if defined(OS_WIN)\nbool Textfield::Keystroke::IsControlHeld() const {\n  return win_util::IsCtrlPressed();\n}\n\nbool Textfield::Keystroke::IsShiftHeld() const {\n  return win_util::IsShiftPressed();\n}\n#else\nbool Textfield::Keystroke::IsControlHeld() const {\n  return (event_.state & gtk_accelerator_get_default_mod_mask()) ==\n      GDK_CONTROL_MASK;\n}\n\nbool Textfield::Keystroke::IsShiftHeld() const {\n  return (event_.state & gtk_accelerator_get_default_mod_mask()) ==\n      GDK_SHIFT_MASK;\n}\n#endif\n\n}  \/\/ namespace views\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: syschild.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: vg $ $Date: 2004-01-06 14:16:59 $\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 _SV_SVSYS_HXX\n#include <svsys.h>\n#endif\n#ifndef _SV_SALINST_HXX\n#include <salinst.hxx>\n#endif\n#ifndef _SV_SALFRAME_HXX\n#include <salframe.hxx>\n#endif\n#include <window.hxx>\n#ifndef _SV_SALOBJ_HXX\n#include <salobj.hxx>\n#endif\n\n#ifndef _SV_RC_H\n#include <tools\/rc.h>\n#endif\n#ifndef _SV_SVDATA_HXX\n#include <svdata.hxx>\n#endif\n#ifndef _SV_WIDNOW_H\n#include <window.h>\n#endif\n#ifndef _SV_SVAPP_HXX\n#include <svapp.hxx>\n#endif\n#ifndef _SV_SYSCHILD_HXX\n#include <syschild.hxx>\n#endif\n\n\n\n\/\/ =======================================================================\n\nlong ImplSysChildProc( void* pInst, SalObject* \/* pObject *\/,\n                       USHORT nEvent, const void* \/* pEvent *\/ )\n{\n    SystemChildWindow* pWindow = (SystemChildWindow*)pInst;\n    long nRet = 0;\n\n    switch ( nEvent )\n    {\n        case SALOBJ_EVENT_GETFOCUS:\n            \/\/ Focus holen und zwar so, das alle Handler gerufen\n            \/\/ werden, als ob dieses Fenster den Focus bekommt,\n            \/\/ ohne das der Frame den Focus wieder klaut\n            pWindow->ImplGetFrameData()->mbSysObjFocus = TRUE;\n            pWindow->ImplGetFrameData()->mbInSysObjToTopHdl = TRUE;\n            pWindow->ToTop( TOTOP_NOGRABFOCUS );\n            pWindow->ImplGetFrameData()->mbInSysObjToTopHdl = FALSE;\n            pWindow->ImplGetFrameData()->mbInSysObjFocusHdl = TRUE;\n            pWindow->GrabFocus();\n            pWindow->ImplGetFrameData()->mbInSysObjFocusHdl = FALSE;\n            break;\n\n        case SALOBJ_EVENT_LOSEFOCUS:\n            \/\/ Hintenrum einen LoseFocus ausloesen, das der Status\n            \/\/ der Fenster dem entsprechenden Activate-Status\n            \/\/ entspricht\n            pWindow->ImplGetFrameData()->mbSysObjFocus = FALSE;\n            if ( !pWindow->ImplGetFrameData()->mnFocusId )\n            {\n                pWindow->ImplGetFrameData()->mbStartFocusState = TRUE;\n                Application::PostUserEvent( pWindow->ImplGetFrameData()->mnFocusId, LINK( pWindow->ImplGetFrameWindow(), Window, ImplAsyncFocusHdl ) );\n            }\n            break;\n\n        case SALOBJ_EVENT_TOTOP:\n            pWindow->ImplGetFrameData()->mbInSysObjToTopHdl = TRUE;\n            if ( !Application::GetFocusWindow() || pWindow->HasChildPathFocus() )\n                pWindow->ToTop( TOTOP_NOGRABFOCUS );\n            else\n                pWindow->ToTop();\n            pWindow->GrabFocus();\n            pWindow->ImplGetFrameData()->mbInSysObjToTopHdl = FALSE;\n            break;\n    }\n\n    return nRet;\n}\n\n\/\/ =======================================================================\n\nvoid SystemChildWindow::ImplInit( Window* pParent, WinBits nStyle )\n{\n    mpSysObj = ImplGetSVData()->mpDefInst->CreateObject( pParent->ImplGetFrame() );\n\n    Window::ImplInit( pParent, nStyle, NULL );\n\n    \/\/ Wenn es ein richtiges SysChild ist, dann painten wir auch nicht\n    if ( GetSystemData() )\n    {\n        mpSysObj->SetCallback( this, ImplSysChildProc );\n        SetParentClipMode( PARENTCLIPMODE_CLIP );\n        SetBackground();\n    }\n}\n\n\/\/ -----------------------------------------------------------------------\n\nSystemChildWindow::SystemChildWindow( Window* pParent, WinBits nStyle ) :\n    Window( WINDOW_SYSTEMCHILDWINDOW )\n{\n    ImplInit( pParent, nStyle );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nSystemChildWindow::SystemChildWindow( Window* pParent, const ResId& rResId ) :\n    Window( WINDOW_SYSTEMCHILDWINDOW )\n{\n    rResId.SetRT( RSC_WINDOW );\n    WinBits nStyle = ImplInitRes( rResId );\n    ImplInit( pParent, nStyle );\n    ImplLoadRes( rResId );\n\n    if ( !(nStyle & WB_HIDE) )\n        Show();\n}\n\n\/\/ -----------------------------------------------------------------------\n\nSystemChildWindow::~SystemChildWindow()\n{\n    Hide();\n    if ( mpSysObj )\n    {\n        ImplGetSVData()->mpDefInst->DestroyObject( mpSysObj );\n        mpSysObj = NULL;\n    }\n}\n\n\/\/ -----------------------------------------------------------------------\n\nconst SystemEnvData* SystemChildWindow::GetSystemData() const\n{\n    if ( mpSysObj )\n        return mpSysObj->GetSystemData();\n    else\n        return NULL;\n}\n\n<commit_msg>INTEGRATION: CWS vclcompact (1.3.260); FILE MERGED 2004\/12\/14 16:32:41 ssa 1.3.260.1: hide Window members (pImpl)<commit_after>\/*************************************************************************\n *\n *  $RCSfile: syschild.cxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: kz $ $Date: 2005-01-13 18:05: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 _SV_SVSYS_HXX\n#include <svsys.h>\n#endif\n#ifndef _SV_SALINST_HXX\n#include <salinst.hxx>\n#endif\n#ifndef _SV_SALFRAME_HXX\n#include <salframe.hxx>\n#endif\n#include <window.hxx>\n#ifndef _SV_SALOBJ_HXX\n#include <salobj.hxx>\n#endif\n\n#ifndef _SV_RC_H\n#include <tools\/rc.h>\n#endif\n#ifndef _SV_SVDATA_HXX\n#include <svdata.hxx>\n#endif\n#ifndef _SV_WIDNOW_H\n#include <window.h>\n#endif\n#ifndef _SV_SVAPP_HXX\n#include <svapp.hxx>\n#endif\n#ifndef _SV_SYSCHILD_HXX\n#include <syschild.hxx>\n#endif\n\n\n\n\/\/ =======================================================================\n\nlong ImplSysChildProc( void* pInst, SalObject* \/* pObject *\/,\n                       USHORT nEvent, const void* \/* pEvent *\/ )\n{\n    SystemChildWindow* pWindow = (SystemChildWindow*)pInst;\n    long nRet = 0;\n\n    switch ( nEvent )\n    {\n        case SALOBJ_EVENT_GETFOCUS:\n            \/\/ Focus holen und zwar so, das alle Handler gerufen\n            \/\/ werden, als ob dieses Fenster den Focus bekommt,\n            \/\/ ohne das der Frame den Focus wieder klaut\n            pWindow->ImplGetFrameData()->mbSysObjFocus = TRUE;\n            pWindow->ImplGetFrameData()->mbInSysObjToTopHdl = TRUE;\n            pWindow->ToTop( TOTOP_NOGRABFOCUS );\n            pWindow->ImplGetFrameData()->mbInSysObjToTopHdl = FALSE;\n            pWindow->ImplGetFrameData()->mbInSysObjFocusHdl = TRUE;\n            pWindow->GrabFocus();\n            pWindow->ImplGetFrameData()->mbInSysObjFocusHdl = FALSE;\n            break;\n\n        case SALOBJ_EVENT_LOSEFOCUS:\n            \/\/ Hintenrum einen LoseFocus ausloesen, das der Status\n            \/\/ der Fenster dem entsprechenden Activate-Status\n            \/\/ entspricht\n            pWindow->ImplGetFrameData()->mbSysObjFocus = FALSE;\n            if ( !pWindow->ImplGetFrameData()->mnFocusId )\n            {\n                pWindow->ImplGetFrameData()->mbStartFocusState = TRUE;\n                Application::PostUserEvent( pWindow->ImplGetFrameData()->mnFocusId, LINK( pWindow->ImplGetFrameWindow(), Window, ImplAsyncFocusHdl ) );\n            }\n            break;\n\n        case SALOBJ_EVENT_TOTOP:\n            pWindow->ImplGetFrameData()->mbInSysObjToTopHdl = TRUE;\n            if ( !Application::GetFocusWindow() || pWindow->HasChildPathFocus() )\n                pWindow->ToTop( TOTOP_NOGRABFOCUS );\n            else\n                pWindow->ToTop();\n            pWindow->GrabFocus();\n            pWindow->ImplGetFrameData()->mbInSysObjToTopHdl = FALSE;\n            break;\n    }\n\n    return nRet;\n}\n\n\/\/ =======================================================================\n\nvoid SystemChildWindow::ImplInit( Window* pParent, WinBits nStyle )\n{\n    mpWindowImpl->mpSysObj = ImplGetSVData()->mpDefInst->CreateObject( pParent->ImplGetFrame() );\n\n    Window::ImplInit( pParent, nStyle, NULL );\n\n    \/\/ Wenn es ein richtiges SysChild ist, dann painten wir auch nicht\n    if ( GetSystemData() )\n    {\n        mpWindowImpl->mpSysObj->SetCallback( this, ImplSysChildProc );\n        SetParentClipMode( PARENTCLIPMODE_CLIP );\n        SetBackground();\n    }\n}\n\n\/\/ -----------------------------------------------------------------------\n\nSystemChildWindow::SystemChildWindow( Window* pParent, WinBits nStyle ) :\n    Window( WINDOW_SYSTEMCHILDWINDOW )\n{\n    ImplInit( pParent, nStyle );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nSystemChildWindow::SystemChildWindow( Window* pParent, const ResId& rResId ) :\n    Window( WINDOW_SYSTEMCHILDWINDOW )\n{\n    rResId.SetRT( RSC_WINDOW );\n    WinBits nStyle = ImplInitRes( rResId );\n    ImplInit( pParent, nStyle );\n    ImplLoadRes( rResId );\n\n    if ( !(nStyle & WB_HIDE) )\n        Show();\n}\n\n\/\/ -----------------------------------------------------------------------\n\nSystemChildWindow::~SystemChildWindow()\n{\n    Hide();\n    if ( mpWindowImpl->mpSysObj )\n    {\n        ImplGetSVData()->mpDefInst->DestroyObject( mpWindowImpl->mpSysObj );\n        mpWindowImpl->mpSysObj = NULL;\n    }\n}\n\n\/\/ -----------------------------------------------------------------------\n\nconst SystemEnvData* SystemChildWindow::GetSystemData() const\n{\n    if ( mpWindowImpl->mpSysObj )\n        return mpWindowImpl->mpSysObj->GetSystemData();\n    else\n        return NULL;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n-----------------------------------------------------------------------------\nThis source file is part of OGRE\n    (Object-oriented Graphics Rendering Engine)\nFor the latest info, see http:\/\/www.ogre3d.org\/\n\nCopyright (c) 2000-2013 Torus Knot Software Ltd\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n-----------------------------------------------------------------------------\n*\/\n#include \"OgreStableHeaders.h\"\n#include \"OgreWindowEventUtilities.h\"\n#include \"OgreRenderWindow.h\"\n#include \"OgreLogManager.h\"\n#include \"OgreRoot.h\"\n#include \"OgreException.h\"\n#include \"OgreStringConverter.h\"\n#if OGRE_PLATFORM == OGRE_PLATFORM_LINUX\n#include <X11\/Xlib.h>\nvoid GLXProc( Ogre::RenderWindow *win, const XEvent &event );\n#endif\n\n\/\/using namespace Ogre;\n\nOgre::WindowEventUtilities::WindowEventListeners Ogre::WindowEventUtilities::_msListeners;\nOgre::RenderWindowList Ogre::WindowEventUtilities::_msWindows;\n\nnamespace Ogre {\n\/\/--------------------------------------------------------------------------------\/\/\nvoid WindowEventUtilities::messagePump()\n{\n#if OGRE_PLATFORM == OGRE_PLATFORM_WIN32\n\t\/\/ Windows Message Loop (NULL means check all HWNDs belonging to this context)\n\tMSG  msg;\n\twhile( PeekMessage( &msg, NULL, 0U, 0U, PM_REMOVE ) )\n\t{\n\t\tTranslateMessage( &msg );\n\t\tDispatchMessage( &msg );\n\t}\n#elif OGRE_PLATFORM == OGRE_PLATFORM_LINUX\n\t\/\/GLX Message Pump\n\tWindows::iterator win = _msWindows.begin();\n\tWindows::iterator end = _msWindows.end();\n\n\tDisplay* xDisplay = 0; \/\/ same for all windows\n\t\n\tfor (; win != end; win++)\n\t{\n\t    XID xid;\n\t    XEvent event;\n\n\t    if (!xDisplay)\n\t\t(*win)->getCustomAttribute(\"XDISPLAY\", &xDisplay);\n\n\t    (*win)->getCustomAttribute(\"WINDOW\", &xid);\n\n\t    while (XCheckWindowEvent (xDisplay, xid, StructureNotifyMask | VisibilityChangeMask | FocusChangeMask, &event))\n\t    {\n\t\tGLXProc(*win, event);\n\t    }\n\n\t    \/\/ The ClientMessage event does not appear under any Event Mask\n\t    while (XCheckTypedWindowEvent (xDisplay, xid, ClientMessage, &event))\n\t    {\n\t\tGLXProc(*win, event);\n\t    }\n\t}\n#elif OGRE_PLATFORM == OGRE_PLATFORM_APPLE && !defined __OBJC__ && !defined __LP64__\n\t\/\/ OSX Message Pump\n\tEventRef event = NULL;\n\tEventTargetRef targetWindow;\n\ttargetWindow = GetEventDispatcherTarget();\n    \n    \/\/ If we are unable to get the target then we no longer care about events.\n    if( !targetWindow ) return;\n    \n    \/\/ Grab the next event, process it if it is a window event\n\twhile( ReceiveNextEvent( 0, NULL, kEventDurationNoWait, true, &event ) == noErr )\n\t{\n        \/\/ Dispatch the event\n\t\tSendEventToEventTarget( event, targetWindow );\n   \t\tReleaseEvent( event );\n\t}\n#endif\n}\n\n\/\/--------------------------------------------------------------------------------\/\/\nvoid WindowEventUtilities::addWindowEventListener( RenderWindow* window, WindowEventListener* listener )\n{\n\t_msListeners.insert(std::make_pair(window, listener));\n}\n\n\/\/--------------------------------------------------------------------------------\/\/\nvoid WindowEventUtilities::removeWindowEventListener( RenderWindow* window, WindowEventListener* listener )\n{\n\tWindowEventListeners::iterator i = _msListeners.begin(), e = _msListeners.end();\n\n\tfor( ; i != e; ++i )\n\t{\n\t\tif( i->first == window && i->second == listener )\n\t\t{\n\t\t\t_msListeners.erase(i);\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\/\/--------------------------------------------------------------------------------\/\/\nvoid WindowEventUtilities::_addRenderWindow(RenderWindow* window)\n{\n\t_msWindows.push_back(window);\n}\n\n\/\/--------------------------------------------------------------------------------\/\/\nvoid WindowEventUtilities::_removeRenderWindow(RenderWindow* window)\n{\n\tRenderWindowList::iterator i = std::find(_msWindows.begin(), _msWindows.end(), window);\n\tif( i != _msWindows.end() )\n\t\t_msWindows.erase( i );\n}\n\n}\n#if OGRE_PLATFORM == OGRE_PLATFORM_WIN32\n\/\/--------------------------------------------------------------------------------\/\/\nnamespace Ogre {\nLRESULT CALLBACK WindowEventUtilities::_WndProc(HWND hWnd, UINT uMsg, WPARAM wParam, LPARAM lParam)\n{\n\tif (uMsg == WM_CREATE)\n\t{\t\/\/ Store pointer to Win32Window in user data area\n\t\tSetWindowLongPtr(hWnd, GWLP_USERDATA, (LONG_PTR)(((LPCREATESTRUCT)lParam)->lpCreateParams));\n\t\treturn 0;\n\t}\n\n\t\/\/ look up window instance\n\t\/\/ note: it is possible to get a WM_SIZE before WM_CREATE\n\tRenderWindow* win = (RenderWindow*)GetWindowLongPtr(hWnd, GWLP_USERDATA);\n\tif (!win)\n\t\treturn DefWindowProc(hWnd, uMsg, wParam, lParam);\n\n\t\/\/LogManager* log = LogManager::getSingletonPtr();\n\t\/\/Iterator of all listeners registered to this RenderWindow\n\tWindowEventListeners::iterator index,\n        start = _msListeners.lower_bound(win),\n        end = _msListeners.upper_bound(win);\n\n\tswitch( uMsg )\n\t{\n\tcase WM_ACTIVATE:\n\t{\n        bool active = (LOWORD(wParam) != WA_INACTIVE);\n        if( active )\n        {\n\t\t    win->setActive( true );\n        }\n        else\n        {\n            if( win->isDeactivatedOnFocusChange() )\n            {\n    \t\t    win->setActive( false );\n            }\n        }\n\n\t    for( ; start != end; ++start )\n\t\t    (start->second)->windowFocusChange(win);\n\t\tbreak;\n\t}\n\tcase WM_SYSKEYDOWN:\n\t\tswitch( wParam )\n\t\t{\n\t\tcase VK_CONTROL:\n\t\tcase VK_SHIFT:\n\t\tcase VK_MENU: \/\/ALT\n\t\t\t\/\/return zero to bypass defProc and signal we processed the message\n\t\t\treturn 0;\n\t\t}\n\t\tbreak;\n\tcase WM_SYSKEYUP:\n\t\tswitch( wParam )\n\t\t{\n\t\tcase VK_CONTROL:\n\t\tcase VK_SHIFT:\n\t\tcase VK_MENU: \/\/ALT\n\t\tcase VK_F10:\n\t\t\t\/\/return zero to bypass defProc and signal we processed the message\n\t\t\treturn 0;\n\t\t}\n\t\tbreak;\n\tcase WM_SYSCHAR:\n\t\t\/\/ return zero to bypass defProc and signal we processed the message, unless it's an ALT-space\n\t\tif (wParam != VK_SPACE)\n\t\t\treturn 0;\n\t\tbreak;\n\tcase WM_ENTERSIZEMOVE:\n\t\t\/\/log->logMessage(\"WM_ENTERSIZEMOVE\");\n\t\tbreak;\n\tcase WM_EXITSIZEMOVE:\n\t\t\/\/log->logMessage(\"WM_EXITSIZEMOVE\");\n\t\tbreak;\n\tcase WM_MOVE:\n\t\t\/\/log->logMessage(\"WM_MOVE\");\n\t\twin->windowMovedOrResized();\n\t\tfor(index = start; index != end; ++index)\n\t\t\t(index->second)->windowMoved(win);\n\t\tbreak;\n\tcase WM_DISPLAYCHANGE:\n\t\twin->windowMovedOrResized();\n\t\tfor(index = start; index != end; ++index)\n\t\t\t(index->second)->windowResized(win);\n\t\tbreak;\n\tcase WM_SIZE:\n\t\t\/\/log->logMessage(\"WM_SIZE\");\n\t\twin->windowMovedOrResized();\n\t\tfor(index = start; index != end; ++index)\n\t\t\t(index->second)->windowResized(win);\n\t\tbreak;\n\tcase WM_GETMINMAXINFO:\n\t\t\/\/ Prevent the window from going smaller than some minimu size\n\t\t((MINMAXINFO*)lParam)->ptMinTrackSize.x = 100;\n\t\t((MINMAXINFO*)lParam)->ptMinTrackSize.y = 100;\n\t\tbreak;\n\tcase WM_CLOSE:\n\t{\n\t\t\/\/log->logMessage(\"WM_CLOSE\");\n\t\tbool close = true;\n\t\tfor(index = start; index != end; ++index)\n\t\t{\n\t\t\tif (!(index->second)->windowClosing(win))\n\t\t\t\tclose = false;\n\t\t}\n\t\tif (!close) return 0;\n\n\t\tfor(index = _msListeners.lower_bound(win); index != end; ++index)\n\t\t\t(index->second)->windowClosed(win);\n\t\twin->destroy();\n\t\treturn 0;\n\t}\n\t}\n\n\treturn DefWindowProc( hWnd, uMsg, wParam, lParam );\n}\n}\n#elif OGRE_PLATFORM == OGRE_PLATFORM_LINUX\n\/\/--------------------------------------------------------------------------------\/\/\nvoid GLXProc( Ogre::RenderWindow *win, const XEvent &event )\n{\n\t\/\/An iterator for the window listeners\n  Ogre::WindowEventUtilities::WindowEventListeners::iterator index,\n\t\tstart = Ogre::WindowEventUtilities::_msListeners.lower_bound(win),\n\t\tend   = Ogre::WindowEventUtilities::_msListeners.upper_bound(win);\n\n\tswitch(event.type)\n\t{\n\tcase ClientMessage:\n\t{\n\t\t::Atom atom;\n\t\twin->getCustomAttribute(\"ATOM\", &atom);\n\t\tif(event.xclient.format == 32 && event.xclient.data.l[0] == (long)atom)\n\t\t{\t\/\/Window closed by window manager\n\t\t\t\/\/Send message first, to allow app chance to unregister things that need done before\n\t\t\t\/\/window is shutdown\n\t\t\tbool close = true;\n            for(index = start ; index != end; ++index)\n\t\t\t{\n\t\t\t\tif (!(index->second)->windowClosing(win))\n\t\t\t\t\tclose = false;\n\t\t\t}\n\t\t\tif (!close) return;\n\n            for(index = start ; index != end; ++index)\n                (index->second)->windowClosed(win);\n\t\t\twin->destroy();\n\t\t}\n\t\tbreak;\n\t}\n\tcase DestroyNotify:\n\t{\n\t\tif (!win->isClosed())\n\t\t{\n\t\t\t\/\/ Window closed without window manager warning.\n            for(index = start ; index != end; ++index)\n                (index->second)->windowClosed(win);\n\t\t\twin->destroy();\n\t\t}\n\t\tbreak;\n\t}\n\tcase ConfigureNotify:\n\t{    \n        \/\/ This could be slightly more efficient if windowMovedOrResized took arguments:\n\t\tunsigned int oldWidth, oldHeight, oldDepth;\n\t\tint oldLeft, oldTop;\n\t\twin->getMetrics(oldWidth, oldHeight, oldDepth, oldLeft, oldTop);\n\t\twin->windowMovedOrResized();\n\n\t\tunsigned int newWidth, newHeight, newDepth;\n\t\tint newLeft, newTop;\n\t\twin->getMetrics(newWidth, newHeight, newDepth, newLeft, newTop);\n\n\t\tif (newLeft != oldLeft || newTop != oldTop)\n\t\t{\n            for(index = start ; index != end; ++index)\n                (index->second)->windowMoved(win);\n\t\t}\n\n\t\tif (newWidth != oldWidth || newHeight != oldHeight)\n\t\t{\n            for(index = start ; index != end; ++index)\n                (index->second)->windowResized(win);\n\t\t}\n\t\tbreak;\n\t}\n\tcase FocusIn:     \/\/ Gained keyboard focus\n\tcase FocusOut:    \/\/ Lost keyboard focus\n        for(index = start ; index != end; ++index)\n            (index->second)->windowFocusChange(win);\n\t\tbreak;\n\tcase MapNotify:   \/\/Restored\n\t\twin->setActive( true );\n        for(index = start ; index != end; ++index)\n            (index->second)->windowFocusChange(win);\n\t\tbreak;\n\tcase UnmapNotify: \/\/Minimised\n\t\twin->setActive( false );\n\t\twin->setVisible( false );\n        for(index = start ; index != end; ++index)\n            (index->second)->windowFocusChange(win);\n\t\tbreak;\n\tcase VisibilityNotify:\n\t\tswitch(event.xvisibility.state)\n\t\t{\n\t\tcase VisibilityUnobscured:\n\t\t\twin->setActive( true );\n\t\t\twin->setVisible( true );\n\t\t\tbreak;\n\t\tcase VisibilityPartiallyObscured:\n\t\t\twin->setActive( true );\n\t\t\twin->setVisible( true );\n\t\t\tbreak;\n\t\tcase VisibilityFullyObscured:\n\t\t\twin->setActive( false );\n\t\t\twin->setVisible( false );\n\t\t\tbreak;\n\t\t}\n        for(index = start ; index != end; ++index)\n            (index->second)->windowFocusChange(win);\n\t\tbreak;\n\tdefault:\n\t\tbreak;\n\t} \/\/End switch event.type\n}\n#elif OGRE_PLATFORM == OGRE_PLATFORM_APPLE && !defined __OBJC__ && !defined __LP64__\n\/\/--------------------------------------------------------------------------------\/\/\nnamespace Ogre {\nOSStatus WindowEventUtilities::_CarbonWindowHandler(EventHandlerCallRef nextHandler, EventRef event, void* wnd)\n{\n    OSStatus status = noErr;\n\n    \/\/ Only events from our window should make it here\n    \/\/ This ensures that our user data is our WindowRef\n    RenderWindow* curWindow = (RenderWindow*)wnd;\n    if(!curWindow) return eventNotHandledErr;\n    \n    \/\/Iterator of all listeners registered to this RenderWindow\n\tWindowEventListeners::iterator index,\n        start = _msListeners.lower_bound(curWindow),\n        end = _msListeners.upper_bound(curWindow);\n    \n    \/\/ We only get called if a window event happens\n    UInt32 eventKind = GetEventKind( event );\n\n    switch( eventKind )\n    {\n        case kEventWindowActivated:\n            curWindow->setActive( true );\n            for( ; start != end; ++start )\n                (start->second)->windowFocusChange(curWindow);\n            break;\n        case kEventWindowDeactivated:\n            if( curWindow->isDeactivatedOnFocusChange() )\n            {\n                curWindow->setActive( false );\n            }\n\n            for( ; start != end; ++start )\n                (start->second)->windowFocusChange(curWindow);\n\n            break;\n        case kEventWindowShown:\n        case kEventWindowExpanded:\n            curWindow->setActive( true );\n            curWindow->setVisible( true );\n            for( ; start != end; ++start )\n                (start->second)->windowFocusChange(curWindow);\n            break;\n        case kEventWindowHidden:\n        case kEventWindowCollapsed:\n            curWindow->setActive( false );\n            curWindow->setVisible( false );\n            for( ; start != end; ++start )\n                (start->second)->windowFocusChange(curWindow);\n            break;            \n        case kEventWindowDragCompleted:\n            curWindow->windowMovedOrResized();\n            for( ; start != end; ++start )\n\t\t\t\t(start->second)->windowMoved(curWindow);\n            break;\n        case kEventWindowBoundsChanged:\n            curWindow->windowMovedOrResized();\n            for( ; start != end; ++start )\n\t\t\t\t(start->second)->windowResized(curWindow);\n            break;\n\t\tcase kEventWindowClose:\n\t\t{\n\t\t\tbool close = true;\n\t\t\tfor( ; start != end; ++start )\n\t\t\t{\n\t\t\t\tif (!(start->second)->windowClosing(curWindow))\n\t\t\t\t\tclose = false;\n\t\t\t}\n\t\t\tif (close)\n\t\t\t\t\/\/ This will cause event handling to continue on to the standard handler, which calls\n\t\t\t\t\/\/ DisposeWindow(), which leads to the 'kEventWindowClosed' event\n\t\t\t\tstatus = eventNotHandledErr;\n\t\t\tbreak;\n\t\t}\n        case kEventWindowClosed:\n            curWindow->destroy();\n            for( ; start != end; ++start )\n\t\t\t\t(start->second)->windowClosed(curWindow);\n            break;\n        default:\n            status = eventNotHandledErr;\n            break;\n    }\n    \n    return status;\n}\n}\n#endif\n<commit_msg>[OGRE-122] Fix the build.<commit_after>\/*\n-----------------------------------------------------------------------------\nThis source file is part of OGRE\n    (Object-oriented Graphics Rendering Engine)\nFor the latest info, see http:\/\/www.ogre3d.org\/\n\nCopyright (c) 2000-2013 Torus Knot Software Ltd\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n-----------------------------------------------------------------------------\n*\/\n#include \"OgreStableHeaders.h\"\n#include \"OgreCommon.h\"\n#include \"OgreWindowEventUtilities.h\"\n#include \"OgreRenderWindow.h\"\n#include \"OgreLogManager.h\"\n#include \"OgreRoot.h\"\n#include \"OgreException.h\"\n#include \"OgreStringConverter.h\"\n#if OGRE_PLATFORM == OGRE_PLATFORM_LINUX\n#include <X11\/Xlib.h>\nvoid GLXProc( Ogre::RenderWindow *win, const XEvent &event );\n#endif\n\n\/\/using namespace Ogre;\n\nOgre::WindowEventUtilities::WindowEventListeners Ogre::WindowEventUtilities::_msListeners;\nOgre::RenderWindowList Ogre::WindowEventUtilities::_msWindows;\n\nnamespace Ogre {\n\/\/--------------------------------------------------------------------------------\/\/\nvoid WindowEventUtilities::messagePump()\n{\n#if OGRE_PLATFORM == OGRE_PLATFORM_WIN32\n\t\/\/ Windows Message Loop (NULL means check all HWNDs belonging to this context)\n\tMSG  msg;\n\twhile( PeekMessage( &msg, NULL, 0U, 0U, PM_REMOVE ) )\n\t{\n\t\tTranslateMessage( &msg );\n\t\tDispatchMessage( &msg );\n\t}\n#elif OGRE_PLATFORM == OGRE_PLATFORM_LINUX\n\t\/\/GLX Message Pump\n\tRenderWindowList::iterator win = _msWindows.begin();\n\tRenderWindowList::iterator end = _msWindows.end();\n\n\tDisplay* xDisplay = 0; \/\/ same for all windows\n\t\n\tfor (; win != end; win++)\n\t{\n\t    XID xid;\n\t    XEvent event;\n\n\t    if (!xDisplay)\n\t\t(*win)->getCustomAttribute(\"XDISPLAY\", &xDisplay);\n\n\t    (*win)->getCustomAttribute(\"WINDOW\", &xid);\n\n\t    while (XCheckWindowEvent (xDisplay, xid, StructureNotifyMask | VisibilityChangeMask | FocusChangeMask, &event))\n\t    {\n\t\tGLXProc(*win, event);\n\t    }\n\n\t    \/\/ The ClientMessage event does not appear under any Event Mask\n\t    while (XCheckTypedWindowEvent (xDisplay, xid, ClientMessage, &event))\n\t    {\n\t\tGLXProc(*win, event);\n\t    }\n\t}\n#elif OGRE_PLATFORM == OGRE_PLATFORM_APPLE && !defined __OBJC__ && !defined __LP64__\n\t\/\/ OSX Message Pump\n\tEventRef event = NULL;\n\tEventTargetRef targetWindow;\n\ttargetWindow = GetEventDispatcherTarget();\n    \n    \/\/ If we are unable to get the target then we no longer care about events.\n    if( !targetWindow ) return;\n    \n    \/\/ Grab the next event, process it if it is a window event\n\twhile( ReceiveNextEvent( 0, NULL, kEventDurationNoWait, true, &event ) == noErr )\n\t{\n        \/\/ Dispatch the event\n\t\tSendEventToEventTarget( event, targetWindow );\n   \t\tReleaseEvent( event );\n\t}\n#endif\n}\n\n\/\/--------------------------------------------------------------------------------\/\/\nvoid WindowEventUtilities::addWindowEventListener( RenderWindow* window, WindowEventListener* listener )\n{\n\t_msListeners.insert(std::make_pair(window, listener));\n}\n\n\/\/--------------------------------------------------------------------------------\/\/\nvoid WindowEventUtilities::removeWindowEventListener( RenderWindow* window, WindowEventListener* listener )\n{\n\tWindowEventListeners::iterator i = _msListeners.begin(), e = _msListeners.end();\n\n\tfor( ; i != e; ++i )\n\t{\n\t\tif( i->first == window && i->second == listener )\n\t\t{\n\t\t\t_msListeners.erase(i);\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\/\/--------------------------------------------------------------------------------\/\/\nvoid WindowEventUtilities::_addRenderWindow(RenderWindow* window)\n{\n\t_msWindows.push_back(window);\n}\n\n\/\/--------------------------------------------------------------------------------\/\/\nvoid WindowEventUtilities::_removeRenderWindow(RenderWindow* window)\n{\n\tRenderWindowList::iterator i = std::find(_msWindows.begin(), _msWindows.end(), window);\n\tif( i != _msWindows.end() )\n\t\t_msWindows.erase( i );\n}\n\n}\n#if OGRE_PLATFORM == OGRE_PLATFORM_WIN32\n\/\/--------------------------------------------------------------------------------\/\/\nnamespace Ogre {\nLRESULT CALLBACK WindowEventUtilities::_WndProc(HWND hWnd, UINT uMsg, WPARAM wParam, LPARAM lParam)\n{\n\tif (uMsg == WM_CREATE)\n\t{\t\/\/ Store pointer to Win32Window in user data area\n\t\tSetWindowLongPtr(hWnd, GWLP_USERDATA, (LONG_PTR)(((LPCREATESTRUCT)lParam)->lpCreateParams));\n\t\treturn 0;\n\t}\n\n\t\/\/ look up window instance\n\t\/\/ note: it is possible to get a WM_SIZE before WM_CREATE\n\tRenderWindow* win = (RenderWindow*)GetWindowLongPtr(hWnd, GWLP_USERDATA);\n\tif (!win)\n\t\treturn DefWindowProc(hWnd, uMsg, wParam, lParam);\n\n\t\/\/LogManager* log = LogManager::getSingletonPtr();\n\t\/\/Iterator of all listeners registered to this RenderWindow\n\tWindowEventListeners::iterator index,\n        start = _msListeners.lower_bound(win),\n        end = _msListeners.upper_bound(win);\n\n\tswitch( uMsg )\n\t{\n\tcase WM_ACTIVATE:\n\t{\n        bool active = (LOWORD(wParam) != WA_INACTIVE);\n        if( active )\n        {\n\t\t    win->setActive( true );\n        }\n        else\n        {\n            if( win->isDeactivatedOnFocusChange() )\n            {\n    \t\t    win->setActive( false );\n            }\n        }\n\n\t    for( ; start != end; ++start )\n\t\t    (start->second)->windowFocusChange(win);\n\t\tbreak;\n\t}\n\tcase WM_SYSKEYDOWN:\n\t\tswitch( wParam )\n\t\t{\n\t\tcase VK_CONTROL:\n\t\tcase VK_SHIFT:\n\t\tcase VK_MENU: \/\/ALT\n\t\t\t\/\/return zero to bypass defProc and signal we processed the message\n\t\t\treturn 0;\n\t\t}\n\t\tbreak;\n\tcase WM_SYSKEYUP:\n\t\tswitch( wParam )\n\t\t{\n\t\tcase VK_CONTROL:\n\t\tcase VK_SHIFT:\n\t\tcase VK_MENU: \/\/ALT\n\t\tcase VK_F10:\n\t\t\t\/\/return zero to bypass defProc and signal we processed the message\n\t\t\treturn 0;\n\t\t}\n\t\tbreak;\n\tcase WM_SYSCHAR:\n\t\t\/\/ return zero to bypass defProc and signal we processed the message, unless it's an ALT-space\n\t\tif (wParam != VK_SPACE)\n\t\t\treturn 0;\n\t\tbreak;\n\tcase WM_ENTERSIZEMOVE:\n\t\t\/\/log->logMessage(\"WM_ENTERSIZEMOVE\");\n\t\tbreak;\n\tcase WM_EXITSIZEMOVE:\n\t\t\/\/log->logMessage(\"WM_EXITSIZEMOVE\");\n\t\tbreak;\n\tcase WM_MOVE:\n\t\t\/\/log->logMessage(\"WM_MOVE\");\n\t\twin->windowMovedOrResized();\n\t\tfor(index = start; index != end; ++index)\n\t\t\t(index->second)->windowMoved(win);\n\t\tbreak;\n\tcase WM_DISPLAYCHANGE:\n\t\twin->windowMovedOrResized();\n\t\tfor(index = start; index != end; ++index)\n\t\t\t(index->second)->windowResized(win);\n\t\tbreak;\n\tcase WM_SIZE:\n\t\t\/\/log->logMessage(\"WM_SIZE\");\n\t\twin->windowMovedOrResized();\n\t\tfor(index = start; index != end; ++index)\n\t\t\t(index->second)->windowResized(win);\n\t\tbreak;\n\tcase WM_GETMINMAXINFO:\n\t\t\/\/ Prevent the window from going smaller than some minimu size\n\t\t((MINMAXINFO*)lParam)->ptMinTrackSize.x = 100;\n\t\t((MINMAXINFO*)lParam)->ptMinTrackSize.y = 100;\n\t\tbreak;\n\tcase WM_CLOSE:\n\t{\n\t\t\/\/log->logMessage(\"WM_CLOSE\");\n\t\tbool close = true;\n\t\tfor(index = start; index != end; ++index)\n\t\t{\n\t\t\tif (!(index->second)->windowClosing(win))\n\t\t\t\tclose = false;\n\t\t}\n\t\tif (!close) return 0;\n\n\t\tfor(index = _msListeners.lower_bound(win); index != end; ++index)\n\t\t\t(index->second)->windowClosed(win);\n\t\twin->destroy();\n\t\treturn 0;\n\t}\n\t}\n\n\treturn DefWindowProc( hWnd, uMsg, wParam, lParam );\n}\n}\n#elif OGRE_PLATFORM == OGRE_PLATFORM_LINUX\n\/\/--------------------------------------------------------------------------------\/\/\nvoid GLXProc( Ogre::RenderWindow *win, const XEvent &event )\n{\n\t\/\/An iterator for the window listeners\n  Ogre::WindowEventUtilities::WindowEventListeners::iterator index,\n\t\tstart = Ogre::WindowEventUtilities::_msListeners.lower_bound(win),\n\t\tend   = Ogre::WindowEventUtilities::_msListeners.upper_bound(win);\n\n\tswitch(event.type)\n\t{\n\tcase ClientMessage:\n\t{\n\t\t::Atom atom;\n\t\twin->getCustomAttribute(\"ATOM\", &atom);\n\t\tif(event.xclient.format == 32 && event.xclient.data.l[0] == (long)atom)\n\t\t{\t\/\/Window closed by window manager\n\t\t\t\/\/Send message first, to allow app chance to unregister things that need done before\n\t\t\t\/\/window is shutdown\n\t\t\tbool close = true;\n            for(index = start ; index != end; ++index)\n\t\t\t{\n\t\t\t\tif (!(index->second)->windowClosing(win))\n\t\t\t\t\tclose = false;\n\t\t\t}\n\t\t\tif (!close) return;\n\n            for(index = start ; index != end; ++index)\n                (index->second)->windowClosed(win);\n\t\t\twin->destroy();\n\t\t}\n\t\tbreak;\n\t}\n\tcase DestroyNotify:\n\t{\n\t\tif (!win->isClosed())\n\t\t{\n\t\t\t\/\/ Window closed without window manager warning.\n            for(index = start ; index != end; ++index)\n                (index->second)->windowClosed(win);\n\t\t\twin->destroy();\n\t\t}\n\t\tbreak;\n\t}\n\tcase ConfigureNotify:\n\t{    \n        \/\/ This could be slightly more efficient if windowMovedOrResized took arguments:\n\t\tunsigned int oldWidth, oldHeight, oldDepth;\n\t\tint oldLeft, oldTop;\n\t\twin->getMetrics(oldWidth, oldHeight, oldDepth, oldLeft, oldTop);\n\t\twin->windowMovedOrResized();\n\n\t\tunsigned int newWidth, newHeight, newDepth;\n\t\tint newLeft, newTop;\n\t\twin->getMetrics(newWidth, newHeight, newDepth, newLeft, newTop);\n\n\t\tif (newLeft != oldLeft || newTop != oldTop)\n\t\t{\n            for(index = start ; index != end; ++index)\n                (index->second)->windowMoved(win);\n\t\t}\n\n\t\tif (newWidth != oldWidth || newHeight != oldHeight)\n\t\t{\n            for(index = start ; index != end; ++index)\n                (index->second)->windowResized(win);\n\t\t}\n\t\tbreak;\n\t}\n\tcase FocusIn:     \/\/ Gained keyboard focus\n\tcase FocusOut:    \/\/ Lost keyboard focus\n        for(index = start ; index != end; ++index)\n            (index->second)->windowFocusChange(win);\n\t\tbreak;\n\tcase MapNotify:   \/\/Restored\n\t\twin->setActive( true );\n        for(index = start ; index != end; ++index)\n            (index->second)->windowFocusChange(win);\n\t\tbreak;\n\tcase UnmapNotify: \/\/Minimised\n\t\twin->setActive( false );\n\t\twin->setVisible( false );\n        for(index = start ; index != end; ++index)\n            (index->second)->windowFocusChange(win);\n\t\tbreak;\n\tcase VisibilityNotify:\n\t\tswitch(event.xvisibility.state)\n\t\t{\n\t\tcase VisibilityUnobscured:\n\t\t\twin->setActive( true );\n\t\t\twin->setVisible( true );\n\t\t\tbreak;\n\t\tcase VisibilityPartiallyObscured:\n\t\t\twin->setActive( true );\n\t\t\twin->setVisible( true );\n\t\t\tbreak;\n\t\tcase VisibilityFullyObscured:\n\t\t\twin->setActive( false );\n\t\t\twin->setVisible( false );\n\t\t\tbreak;\n\t\t}\n        for(index = start ; index != end; ++index)\n            (index->second)->windowFocusChange(win);\n\t\tbreak;\n\tdefault:\n\t\tbreak;\n\t} \/\/End switch event.type\n}\n#elif OGRE_PLATFORM == OGRE_PLATFORM_APPLE && !defined __OBJC__ && !defined __LP64__\n\/\/--------------------------------------------------------------------------------\/\/\nnamespace Ogre {\nOSStatus WindowEventUtilities::_CarbonWindowHandler(EventHandlerCallRef nextHandler, EventRef event, void* wnd)\n{\n    OSStatus status = noErr;\n\n    \/\/ Only events from our window should make it here\n    \/\/ This ensures that our user data is our WindowRef\n    RenderWindow* curWindow = (RenderWindow*)wnd;\n    if(!curWindow) return eventNotHandledErr;\n    \n    \/\/Iterator of all listeners registered to this RenderWindow\n\tWindowEventListeners::iterator index,\n        start = _msListeners.lower_bound(curWindow),\n        end = _msListeners.upper_bound(curWindow);\n    \n    \/\/ We only get called if a window event happens\n    UInt32 eventKind = GetEventKind( event );\n\n    switch( eventKind )\n    {\n        case kEventWindowActivated:\n            curWindow->setActive( true );\n            for( ; start != end; ++start )\n                (start->second)->windowFocusChange(curWindow);\n            break;\n        case kEventWindowDeactivated:\n            if( curWindow->isDeactivatedOnFocusChange() )\n            {\n                curWindow->setActive( false );\n            }\n\n            for( ; start != end; ++start )\n                (start->second)->windowFocusChange(curWindow);\n\n            break;\n        case kEventWindowShown:\n        case kEventWindowExpanded:\n            curWindow->setActive( true );\n            curWindow->setVisible( true );\n            for( ; start != end; ++start )\n                (start->second)->windowFocusChange(curWindow);\n            break;\n        case kEventWindowHidden:\n        case kEventWindowCollapsed:\n            curWindow->setActive( false );\n            curWindow->setVisible( false );\n            for( ; start != end; ++start )\n                (start->second)->windowFocusChange(curWindow);\n            break;            \n        case kEventWindowDragCompleted:\n            curWindow->windowMovedOrResized();\n            for( ; start != end; ++start )\n\t\t\t\t(start->second)->windowMoved(curWindow);\n            break;\n        case kEventWindowBoundsChanged:\n            curWindow->windowMovedOrResized();\n            for( ; start != end; ++start )\n\t\t\t\t(start->second)->windowResized(curWindow);\n            break;\n\t\tcase kEventWindowClose:\n\t\t{\n\t\t\tbool close = true;\n\t\t\tfor( ; start != end; ++start )\n\t\t\t{\n\t\t\t\tif (!(start->second)->windowClosing(curWindow))\n\t\t\t\t\tclose = false;\n\t\t\t}\n\t\t\tif (close)\n\t\t\t\t\/\/ This will cause event handling to continue on to the standard handler, which calls\n\t\t\t\t\/\/ DisposeWindow(), which leads to the 'kEventWindowClosed' event\n\t\t\t\tstatus = eventNotHandledErr;\n\t\t\tbreak;\n\t\t}\n        case kEventWindowClosed:\n            curWindow->destroy();\n            for( ; start != end; ++start )\n\t\t\t\t(start->second)->windowClosed(curWindow);\n            break;\n        default:\n            status = eventNotHandledErr;\n            break;\n    }\n    \n    return status;\n}\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: saldata.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: ssa $ $Date: 2002-12-06 16:50:01 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _SVWIN_H\n#include <tools\/svwin.h>\n#endif\n\n#define _SV_SALDATA_CXX\n\n#ifndef _SV_SALDATA_HXX\n#include <saldata.hxx>\n#endif\n#include <svapp.hxx>\n\n\n\/\/ =======================================================================\n\nrtl_TextEncoding ImplSalGetSystemEncoding()\n{\n    static UINT nOldAnsiCodePage = 0;\n    static rtl_TextEncoding eEncoding = RTL_TEXTENCODING_MS_1252;\n\n    UINT nAnsiCodePage = GetACP();\n    if ( nAnsiCodePage != nOldAnsiCodePage )\n    {\n        switch ( nAnsiCodePage )\n        {\n            case 1252:\n                eEncoding = RTL_TEXTENCODING_MS_1252;\n                break;\n            case 1250:\n                eEncoding = RTL_TEXTENCODING_MS_1250;\n                break;\n            case 1251:\n                eEncoding = RTL_TEXTENCODING_MS_1251;\n                break;\n            case 1253:\n                eEncoding = RTL_TEXTENCODING_MS_1253;\n                break;\n            case 1254:\n                eEncoding = RTL_TEXTENCODING_MS_1254;\n                break;\n            case 1255:\n                eEncoding = RTL_TEXTENCODING_MS_1255;\n                break;\n            case 1256:\n                eEncoding = RTL_TEXTENCODING_MS_1256;\n                break;\n            case 1257:\n                eEncoding = RTL_TEXTENCODING_MS_1257;\n                break;\n            case 1258:\n                eEncoding = RTL_TEXTENCODING_MS_1258;\n                break;\n            case 874:\n                eEncoding = RTL_TEXTENCODING_MS_874;\n                break;\n            case 932:\n                eEncoding = RTL_TEXTENCODING_MS_932;\n                break;\n            case 936:\n                eEncoding = RTL_TEXTENCODING_MS_936;\n                break;\n            case 949:\n                eEncoding = RTL_TEXTENCODING_MS_949;\n                break;\n            case 950:\n                eEncoding = RTL_TEXTENCODING_MS_950;\n                break;\n\/\/            case 1381:\n\/\/                eEncoding = RTL_TEXTENCODING_MS_1381;\n\/\/                break;\n        }\n    }\n\n    return eEncoding;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nByteString ImplSalGetWinAnsiString( const UniString& rStr, BOOL bFileName )\n{\n    rtl_TextEncoding eEncoding = ImplSalGetSystemEncoding();\n    if ( bFileName )\n    {\n        return ByteString( rStr, eEncoding,\n                           RTL_UNICODETOTEXT_FLAGS_UNDEFINED_UNDERLINE |\n                           RTL_UNICODETOTEXT_FLAGS_INVALID_UNDERLINE |\n                           RTL_UNICODETOTEXT_FLAGS_UNDEFINED_REPLACE |\n                           RTL_UNICODETOTEXT_FLAGS_UNDEFINED_REPLACESTR |\n                           RTL_UNICODETOTEXT_FLAGS_PRIVATE_MAPTO0 );\n    }\n    else\n    {\n        return ByteString( rStr, eEncoding,\n                           RTL_UNICODETOTEXT_FLAGS_UNDEFINED_DEFAULT |\n                           RTL_UNICODETOTEXT_FLAGS_INVALID_DEFAULT |\n                           RTL_UNICODETOTEXT_FLAGS_UNDEFINED_REPLACE |\n                           RTL_UNICODETOTEXT_FLAGS_UNDEFINED_REPLACESTR |\n                           RTL_UNICODETOTEXT_FLAGS_PRIVATE_MAPTO0 );\n    }\n}\n\n\/\/ -----------------------------------------------------------------------\n\nUniString ImplSalGetUniString( const sal_Char* pStr, xub_StrLen nLen )\n{\n    return UniString( pStr, nLen, ImplSalGetSystemEncoding(),\n                      RTL_TEXTTOUNICODE_FLAGS_UNDEFINED_DEFAULT |\n                      RTL_TEXTTOUNICODE_FLAGS_MBUNDEFINED_DEFAULT |\n                      RTL_TEXTTOUNICODE_FLAGS_INVALID_DEFAULT );\n}\n\n\/\/ =======================================================================\n\nint ImplSalWICompareAscii( const wchar_t* pStr1, const char* pStr2 )\n{\n    int         nRet;\n    wchar_t     c1;\n    char       c2;\n    do\n    {\n        \/\/ Ist das Zeichen zwischen 'A' und 'Z' dann umwandeln\n        c1 = *pStr1;\n        c2 = *pStr2;\n        if ( (c1 >= 65) && (c1 <= 90) )\n            c1 += 32;\n        if ( (c2 >= 65) && (c2 <= 90) )\n            c2 += 32;\n        nRet = ((sal_Int32)c1)-((sal_Int32)((unsigned char)c2));\n        if ( nRet != 0 )\n            break;\n\n        pStr1++;\n        pStr2++;\n    }\n    while ( c2 );\n\n    return nRet;\n}\n\n\/\/ =======================================================================\n\nLONG ImplSetWindowLong( HWND hWnd, int nIndex, DWORD dwNewLong )\n{\n    if ( aSalShlData.mbWNT )\n        return SetWindowLongW( hWnd, nIndex, dwNewLong );\n    else\n        return SetWindowLongA( hWnd, nIndex, dwNewLong );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nLONG ImplGetWindowLong( HWND hWnd, int nIndex )\n{\n    if ( aSalShlData.mbWNT )\n        return GetWindowLongW( hWnd, nIndex );\n    else\n        return GetWindowLongA( hWnd, nIndex );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nWIN_BOOL ImplPostMessage( HWND hWnd, UINT nMsg, WPARAM wParam, LPARAM lParam )\n{\n    if ( aSalShlData.mbWNT )\n        return PostMessageW( hWnd, nMsg, wParam, lParam );\n    else\n        return PostMessageA( hWnd, nMsg, wParam, lParam );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nWIN_BOOL ImplSendMessage( HWND hWnd, UINT nMsg, WPARAM wParam, LPARAM lParam )\n{\n    WIN_BOOL bRet;\n    if ( aSalShlData.mbWNT )\n        bRet = SendMessageW( hWnd, nMsg, wParam, lParam );\n    else\n        bRet = SendMessageA( hWnd, nMsg, wParam, lParam );\n\n    return bRet;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nWIN_BOOL ImplGetMessage( LPMSG lpMsg, HWND hWnd, UINT wMsgFilterMin, UINT wMsgFilterMax )\n{\n    if ( aSalShlData.mbWNT )\n        return GetMessageW( lpMsg, hWnd, wMsgFilterMin, wMsgFilterMax );\n    else\n        return GetMessageA( lpMsg, hWnd, wMsgFilterMin, wMsgFilterMax );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nWIN_BOOL ImplPeekMessage( LPMSG lpMsg, HWND hWnd, UINT wMsgFilterMin, UINT wMsgFilterMax, UINT wRemoveMsg )\n{\n    if ( aSalShlData.mbWNT )\n        return PeekMessageW( lpMsg, hWnd, wMsgFilterMin, wMsgFilterMax, wRemoveMsg );\n    else\n        return PeekMessageA( lpMsg, hWnd, wMsgFilterMin, wMsgFilterMax, wRemoveMsg );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nLONG ImplDispatchMessage( CONST MSG *lpMsg )\n{\n    if ( aSalShlData.mbWNT )\n        return DispatchMessageW( lpMsg );\n    else\n        return DispatchMessageA( lpMsg );\n}\n\n<commit_msg>INTEGRATION: CWS sb3 (1.3.86); FILE MERGED 2003\/03\/03 16:08:14 sb 1.3.86.1: #107718# Use new rtl\/tencinfo.h functionality to convert between Windows code pages and rtl_TextEncoding.<commit_after>\/*************************************************************************\n *\n *  $RCSfile: saldata.cxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: vg $ $Date: 2003-04-01 14:07:44 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _SVWIN_H\n#include <tools\/svwin.h>\n#endif\n#include \"rtl\/tencinfo.h\"\n\n#define _SV_SALDATA_CXX\n\n#ifndef _SV_SALDATA_HXX\n#include <saldata.hxx>\n#endif\n#include <svapp.hxx>\n\n\n\/\/ =======================================================================\n\nrtl_TextEncoding ImplSalGetSystemEncoding()\n{\n    static UINT nOldAnsiCodePage = 0;\n    static rtl_TextEncoding eEncoding = RTL_TEXTENCODING_MS_1252;\n\n    UINT nAnsiCodePage = GetACP();\n    if ( nAnsiCodePage != nOldAnsiCodePage )\n    {\n        rtl_TextEncoding nEnc\n            = rtl_getTextEncodingFromWindowsCodePage(nAnsiCodePage);\n        if (nEnc != RTL_TEXTENCODING_DONTKNOW)\n            eEncoding = nEnc;\n    }\n\n    return eEncoding;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nByteString ImplSalGetWinAnsiString( const UniString& rStr, BOOL bFileName )\n{\n    rtl_TextEncoding eEncoding = ImplSalGetSystemEncoding();\n    if ( bFileName )\n    {\n        return ByteString( rStr, eEncoding,\n                           RTL_UNICODETOTEXT_FLAGS_UNDEFINED_UNDERLINE |\n                           RTL_UNICODETOTEXT_FLAGS_INVALID_UNDERLINE |\n                           RTL_UNICODETOTEXT_FLAGS_UNDEFINED_REPLACE |\n                           RTL_UNICODETOTEXT_FLAGS_UNDEFINED_REPLACESTR |\n                           RTL_UNICODETOTEXT_FLAGS_PRIVATE_MAPTO0 );\n    }\n    else\n    {\n        return ByteString( rStr, eEncoding,\n                           RTL_UNICODETOTEXT_FLAGS_UNDEFINED_DEFAULT |\n                           RTL_UNICODETOTEXT_FLAGS_INVALID_DEFAULT |\n                           RTL_UNICODETOTEXT_FLAGS_UNDEFINED_REPLACE |\n                           RTL_UNICODETOTEXT_FLAGS_UNDEFINED_REPLACESTR |\n                           RTL_UNICODETOTEXT_FLAGS_PRIVATE_MAPTO0 );\n    }\n}\n\n\/\/ -----------------------------------------------------------------------\n\nUniString ImplSalGetUniString( const sal_Char* pStr, xub_StrLen nLen )\n{\n    return UniString( pStr, nLen, ImplSalGetSystemEncoding(),\n                      RTL_TEXTTOUNICODE_FLAGS_UNDEFINED_DEFAULT |\n                      RTL_TEXTTOUNICODE_FLAGS_MBUNDEFINED_DEFAULT |\n                      RTL_TEXTTOUNICODE_FLAGS_INVALID_DEFAULT );\n}\n\n\/\/ =======================================================================\n\nint ImplSalWICompareAscii( const wchar_t* pStr1, const char* pStr2 )\n{\n    int         nRet;\n    wchar_t     c1;\n    char       c2;\n    do\n    {\n        \/\/ Ist das Zeichen zwischen 'A' und 'Z' dann umwandeln\n        c1 = *pStr1;\n        c2 = *pStr2;\n        if ( (c1 >= 65) && (c1 <= 90) )\n            c1 += 32;\n        if ( (c2 >= 65) && (c2 <= 90) )\n            c2 += 32;\n        nRet = ((sal_Int32)c1)-((sal_Int32)((unsigned char)c2));\n        if ( nRet != 0 )\n            break;\n\n        pStr1++;\n        pStr2++;\n    }\n    while ( c2 );\n\n    return nRet;\n}\n\n\/\/ =======================================================================\n\nLONG ImplSetWindowLong( HWND hWnd, int nIndex, DWORD dwNewLong )\n{\n    if ( aSalShlData.mbWNT )\n        return SetWindowLongW( hWnd, nIndex, dwNewLong );\n    else\n        return SetWindowLongA( hWnd, nIndex, dwNewLong );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nLONG ImplGetWindowLong( HWND hWnd, int nIndex )\n{\n    if ( aSalShlData.mbWNT )\n        return GetWindowLongW( hWnd, nIndex );\n    else\n        return GetWindowLongA( hWnd, nIndex );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nWIN_BOOL ImplPostMessage( HWND hWnd, UINT nMsg, WPARAM wParam, LPARAM lParam )\n{\n    if ( aSalShlData.mbWNT )\n        return PostMessageW( hWnd, nMsg, wParam, lParam );\n    else\n        return PostMessageA( hWnd, nMsg, wParam, lParam );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nWIN_BOOL ImplSendMessage( HWND hWnd, UINT nMsg, WPARAM wParam, LPARAM lParam )\n{\n    WIN_BOOL bRet;\n    if ( aSalShlData.mbWNT )\n        bRet = SendMessageW( hWnd, nMsg, wParam, lParam );\n    else\n        bRet = SendMessageA( hWnd, nMsg, wParam, lParam );\n\n    return bRet;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nWIN_BOOL ImplGetMessage( LPMSG lpMsg, HWND hWnd, UINT wMsgFilterMin, UINT wMsgFilterMax )\n{\n    if ( aSalShlData.mbWNT )\n        return GetMessageW( lpMsg, hWnd, wMsgFilterMin, wMsgFilterMax );\n    else\n        return GetMessageA( lpMsg, hWnd, wMsgFilterMin, wMsgFilterMax );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nWIN_BOOL ImplPeekMessage( LPMSG lpMsg, HWND hWnd, UINT wMsgFilterMin, UINT wMsgFilterMax, UINT wRemoveMsg )\n{\n    if ( aSalShlData.mbWNT )\n        return PeekMessageW( lpMsg, hWnd, wMsgFilterMin, wMsgFilterMax, wRemoveMsg );\n    else\n        return PeekMessageA( lpMsg, hWnd, wMsgFilterMin, wMsgFilterMax, wRemoveMsg );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nLONG ImplDispatchMessage( CONST MSG *lpMsg )\n{\n    if ( aSalShlData.mbWNT )\n        return DispatchMessageW( lpMsg );\n    else\n        return DispatchMessageA( lpMsg );\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/* ---------------------------------------------------------------------\n * Numenta Platform for Intelligent Computing (NuPIC)\n * Copyright (C) 2014, 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 * Definitions for the Connections class in C++\n *\/\n\n#ifndef NTA_CONNECTIONS_HPP\n#define NTA_CONNECTIONS_HPP\n\n#include <vector>\n#include <utility>\n#include <nta\/types\/Types.hpp>\n#include <nta\/math\/Math.hpp>\n\nnamespace nta\n{\n\n  namespace algorithms\n  {\n\n    namespace connections\n    {\n      typedef UInt32 CellIdx;\n      typedef Byte SegmentIdx;\n      typedef Byte SynapseIdx;\n      typedef Real32 Permanence;\n\n      \/**\n       * Cell class used in Connections.\n       *\n       * @b Description\n       * The Cell class is a data structure that points to a particular cell.\n       *\n       * @param idx Index of cell.\n       * \n       *\/\n      struct Cell\n      {\n        CellIdx idx;\n\n        Cell(CellIdx idx) : idx(idx) {}\n        Cell() {}\n\n        bool operator==(const Cell &other) const;\n        bool operator<=(const Cell &other) const;\n        bool operator<(const Cell &other) const;\n        bool operator>=(const Cell &other) const;\n        bool operator>(const Cell &other) const;\n      };\n\n      \/**\n       * Segment class used in Connections.\n       *\n       * @b Description\n       * The Segment class is a data structure that points to a particular\n       * segment on a particular cell.\n       *\n       * @param idx     Index of segment.\n       * @param cellIdx Index of cell.\n       * \n       *\/\n      struct Segment\n      {\n        SegmentIdx idx;\n        Cell cell;\n\n        Segment(SegmentIdx idx, Cell cell) : idx(idx), cell(cell) {}\n        Segment() {}\n\n        bool operator==(const Segment &other) const;\n        bool operator<=(const Segment &other) const;\n        bool operator<(const Segment &other) const;\n        bool operator>=(const Segment &other) const;\n        bool operator>(const Segment &other) const;\n      };\n\n      \/**\n       * Synapse class used in Connections.\n       *\n       * @b Description\n       * The Synapse class is a data structure that points to a particular\n       * synapse on a particular segment on a particular cell.\n       *\n       * @param idx        Index of synapse in segment.\n       * @param segmentIdx Index of segment in cell.\n       * @param cellIdx    Index of cell.\n       * \n       *\/\n      struct Synapse\n      {\n        SynapseIdx idx;\n        Segment segment;\n\n        Synapse(SynapseIdx idx, Segment segment) : idx(idx), segment(segment) {}\n        Synapse() {}\n\n        bool operator==(const Synapse &other) const;\n      };\n\n      \/**\n       * SynapseData class used in Connections.\n       *\n       * @b Description\n       * The SynapseData class is a data structure that contains the data for a\n       * synapse on a segment.\n       *\n       * @param presynapticCellIdx Cell that this synapse gets input from.\n       * @param permanence         Permanence of synapse.\n       * \n       *\/\n      struct SynapseData\n      {\n        Cell presynapticCell;\n        Permanence permanence;\n      };\n\n      \/**\n       * SegmentData class used in Connections.\n       *\n       * @b Description\n       * The SegmentData class is a data structure that contains the data for a\n       * segment on a cell.\n       *\n       * @param synapses Data for synapses that this segment contains.\n       * \n       *\/\n      struct SegmentData\n      {\n        std::vector<SynapseData> synapses;\n      };\n\n      \/**\n       * CellData class used in Connections.\n       *\n       * @b Description\n       * The CellData class is a data structure that contains the data for a\n       * cell.\n       *\n       * @param segments Data for segments that this cell contains.\n       * \n       *\/\n      struct CellData\n      {\n        std::vector<SegmentData> segments;\n      };\n\n      \/**\n       * Activity class used in Connections.\n       *\n       * @b Description\n       * The Activity class is a data structure that represents the\n       * activity of a collection of cells, as computed by propagating\n       * input through connections.\n       * \n       *\/\n      struct Activity\n      {\n        std::map< Cell, std::vector<Segment> > activeSegmentsForCell;\n        std::map<Segment, UInt> numActiveSynapsesForSegment;\n      };\n\n      \/**\n       * Connections implementation in C++.\n       *\n       * @b Description\n       * The Connections class is a data structure that represents the\n       * connections of a collection of cells. It is used in the HTM\n       * learning algorithms to store and access data related to the\n       * connectivity of cells.\n       * \n       *\/\n      class Connections\n      {\n      public:\n        Connections(CellIdx numCells);\n\n        virtual ~Connections() {}\n\n        \/**\n         Creates a segment on the specified cell.\n\n         @param cell Cell to create segment on.\n\n         @retval Created segment.\n        *\/\n        Segment createSegment(const Cell& cell);\n\n        \/**\n         Creates a synapse on the specified segment.\n\n         @param segment         Segment to create synapse on.\n         @param presynapticCell Cell to synapse on.\n         @param permanence      Initial permanence of new synapse.\n\n         @reval Created synapse.\n        *\/\n        Synapse createSynapse(const Segment& segment,\n                              const Cell& presynapticCell,\n                              Permanence permanence);\n\n        \/**\n         Updates a synapse's permanence.\n\n         @param synapse    Synapse to update.\n         @param permanence New permanence.\n        *\/\n        void updateSynapsePermanence(const Synapse& synapse,\n                                     Permanence permanence);\n\n        \/**\n         Gets the segments for a cell.\n\n         @param cell Cell to get segments for.\n\n         @retval Segments on cell.\n        *\/\n        std::vector<Segment> segmentsForCell(const Cell& cell);\n\n        \/**\n         Gets the synapses for a segment.\n\n         @param segment Segment to get synapses for.\n\n         @retval Synapses on segment.\n        *\/\n        std::vector<Synapse> synapsesForSegment(const Segment& segment);\n\n        \/**\n         Gets the data for a synapse.\n\n         @param synapse Synapse to get data for.\n\n         @retval Synapse data.\n        *\/\n        SynapseData dataForSynapse(const Synapse& synapse) const;\n\n        \/**\n         Gets the segment with the most active synapses due to given input,\n         from among all the segments on all the given cells.\n\n         @param cells            Cells to look among.\n         @param input            Active cells in the input.\n         @param synapseThreshold Only consider segments with number of active synapses greater than this threshold.\n         @param segment          Segment to return.\n\n         @retval Segment found?\n        *\/\n        bool mostActiveSegmentForCells(const std::vector<Cell>& cells,\n                                       std::vector<Cell> input,\n                                       UInt synapseThreshold,\n                                       Segment& retSegment) const;\n\n        \/**\n         Forward-propagates input to synapses, dendrites, and cells, to\n         compute their activity.\n\n         @param input               Active cells in the input.\n         @param permanenceThreshold Only consider synapses with permanences greater than this threshold.\n         @param synapseThreshold    Only consider segments with number of active synapses greater than this threshold.\n\n         @retval Activity to return.\n        *\/\n        Activity computeActivity(const std::vector<Cell>& input,\n                                 Permanence permanenceThreshold,\n                                 UInt synapseThreshold) const;\n\n        \/**\n         Gets the active segments from activity.\n\n         @param activity Activity.\n\n         @retval Active segments.\n        *\/\n        std::vector<Segment> activeSegments(const Activity& activity);\n\n        \/**\n         Gets the active cells from activity.\n\n         @param activity Activity.\n\n         @retval Active cells.\n        *\/\n        std::vector<Cell> activeCells(const Activity& activity);\n\n      private:\n        std::vector<CellData> cells_;\n        \/\/ Mapping (presynaptic cell => synapses) used in forward propagation\n        std::map< Cell, std::vector<Synapse> > synapsesForPresynapticCell_;\n      }; \/\/ end class Connections\n\n    } \/\/ end namespace connections\n\n  } \/\/ end namespace algorithms\n\n} \/\/ end namespace nta\n\n#endif \/\/ NTA_CONNECTIONS_HPP\n<commit_msg>Added verbose documentation about Connections class<commit_after>\/* ---------------------------------------------------------------------\n * Numenta Platform for Intelligent Computing (NuPIC)\n * Copyright (C) 2014, 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 * Definitions for the Connections class in C++\n *\/\n\n#ifndef NTA_CONNECTIONS_HPP\n#define NTA_CONNECTIONS_HPP\n\n#include <vector>\n#include <utility>\n#include <nta\/types\/Types.hpp>\n#include <nta\/math\/Math.hpp>\n\nnamespace nta\n{\n\n  namespace algorithms\n  {\n\n    namespace connections\n    {\n      typedef UInt32 CellIdx;\n      typedef Byte SegmentIdx;\n      typedef Byte SynapseIdx;\n      typedef Real32 Permanence;\n\n      \/**\n       * Cell class used in Connections.\n       *\n       * @b Description\n       * The Cell class is a data structure that points to a particular cell.\n       *\n       * @param idx Index of cell.\n       * \n       *\/\n      struct Cell\n      {\n        CellIdx idx;\n\n        Cell(CellIdx idx) : idx(idx) {}\n        Cell() {}\n\n        bool operator==(const Cell &other) const;\n        bool operator<=(const Cell &other) const;\n        bool operator<(const Cell &other) const;\n        bool operator>=(const Cell &other) const;\n        bool operator>(const Cell &other) const;\n      };\n\n      \/**\n       * Segment class used in Connections.\n       *\n       * @b Description\n       * The Segment class is a data structure that points to a particular\n       * segment on a particular cell.\n       *\n       * @param idx     Index of segment.\n       * @param cellIdx Index of cell.\n       * \n       *\/\n      struct Segment\n      {\n        SegmentIdx idx;\n        Cell cell;\n\n        Segment(SegmentIdx idx, Cell cell) : idx(idx), cell(cell) {}\n        Segment() {}\n\n        bool operator==(const Segment &other) const;\n        bool operator<=(const Segment &other) const;\n        bool operator<(const Segment &other) const;\n        bool operator>=(const Segment &other) const;\n        bool operator>(const Segment &other) const;\n      };\n\n      \/**\n       * Synapse class used in Connections.\n       *\n       * @b Description\n       * The Synapse class is a data structure that points to a particular\n       * synapse on a particular segment on a particular cell.\n       *\n       * @param idx        Index of synapse in segment.\n       * @param segmentIdx Index of segment in cell.\n       * @param cellIdx    Index of cell.\n       * \n       *\/\n      struct Synapse\n      {\n        SynapseIdx idx;\n        Segment segment;\n\n        Synapse(SynapseIdx idx, Segment segment) : idx(idx), segment(segment) {}\n        Synapse() {}\n\n        bool operator==(const Synapse &other) const;\n      };\n\n      \/**\n       * SynapseData class used in Connections.\n       *\n       * @b Description\n       * The SynapseData class is a data structure that contains the data for a\n       * synapse on a segment.\n       *\n       * @param presynapticCellIdx Cell that this synapse gets input from.\n       * @param permanence         Permanence of synapse.\n       * \n       *\/\n      struct SynapseData\n      {\n        Cell presynapticCell;\n        Permanence permanence;\n      };\n\n      \/**\n       * SegmentData class used in Connections.\n       *\n       * @b Description\n       * The SegmentData class is a data structure that contains the data for a\n       * segment on a cell.\n       *\n       * @param synapses Data for synapses that this segment contains.\n       * \n       *\/\n      struct SegmentData\n      {\n        std::vector<SynapseData> synapses;\n      };\n\n      \/**\n       * CellData class used in Connections.\n       *\n       * @b Description\n       * The CellData class is a data structure that contains the data for a\n       * cell.\n       *\n       * @param segments Data for segments that this cell contains.\n       * \n       *\/\n      struct CellData\n      {\n        std::vector<SegmentData> segments;\n      };\n\n      \/**\n       * Activity class used in Connections.\n       *\n       * @b Description\n       * The Activity class is a data structure that represents the\n       * activity of a collection of cells, as computed by propagating\n       * input through connections.\n       * \n       *\/\n      struct Activity\n      {\n        std::map< Cell, std::vector<Segment> > activeSegmentsForCell;\n        std::map<Segment, UInt> numActiveSynapsesForSegment;\n      };\n\n      \/**\n       * Connections implementation in C++.\n       *\n       * @b Description\n       * The Connections class is a data structure that represents the\n       * connections of a collection of cells. It is used in the HTM\n       * learning algorithms to store and access data related to the\n       * connectivity of cells.\n       *\n       * It's main utility is to provide a common, optimized data structure\n       * that all HTM learning algorithms can use. It is flexible enough to\n       * support any learning algorithm that operates on a collection of cells.\n       *\n       * Each type of connection (proximal, distal, apical) should be\n       * represented by a different instantiation of this class. This class\n       * will help compute the activity along those connections due to active\n       * input cells. The responsibility for what effect that activity has on\n       * the cells and connections lies in the user of this class.\n       *\n       * This class is optimized to store connections between cells, and\n       * compute the activity of cells due to input over the connections.\n       * \n       *\/\n      class Connections\n      {\n      public:\n        Connections(CellIdx numCells);\n\n        virtual ~Connections() {}\n\n        \/**\n         Creates a segment on the specified cell.\n\n         @param cell Cell to create segment on.\n\n         @retval Created segment.\n        *\/\n        Segment createSegment(const Cell& cell);\n\n        \/**\n         Creates a synapse on the specified segment.\n\n         @param segment         Segment to create synapse on.\n         @param presynapticCell Cell to synapse on.\n         @param permanence      Initial permanence of new synapse.\n\n         @reval Created synapse.\n        *\/\n        Synapse createSynapse(const Segment& segment,\n                              const Cell& presynapticCell,\n                              Permanence permanence);\n\n        \/**\n         Updates a synapse's permanence.\n\n         @param synapse    Synapse to update.\n         @param permanence New permanence.\n        *\/\n        void updateSynapsePermanence(const Synapse& synapse,\n                                     Permanence permanence);\n\n        \/**\n         Gets the segments for a cell.\n\n         @param cell Cell to get segments for.\n\n         @retval Segments on cell.\n        *\/\n        std::vector<Segment> segmentsForCell(const Cell& cell);\n\n        \/**\n         Gets the synapses for a segment.\n\n         @param segment Segment to get synapses for.\n\n         @retval Synapses on segment.\n        *\/\n        std::vector<Synapse> synapsesForSegment(const Segment& segment);\n\n        \/**\n         Gets the data for a synapse.\n\n         @param synapse Synapse to get data for.\n\n         @retval Synapse data.\n        *\/\n        SynapseData dataForSynapse(const Synapse& synapse) const;\n\n        \/**\n         Gets the segment with the most active synapses due to given input,\n         from among all the segments on all the given cells.\n\n         @param cells            Cells to look among.\n         @param input            Active cells in the input.\n         @param synapseThreshold Only consider segments with number of active synapses greater than this threshold.\n         @param segment          Segment to return.\n\n         @retval Segment found?\n        *\/\n        bool mostActiveSegmentForCells(const std::vector<Cell>& cells,\n                                       std::vector<Cell> input,\n                                       UInt synapseThreshold,\n                                       Segment& retSegment) const;\n\n        \/**\n         Forward-propagates input to synapses, dendrites, and cells, to\n         compute their activity.\n\n         @param input               Active cells in the input.\n         @param permanenceThreshold Only consider synapses with permanences greater than this threshold.\n         @param synapseThreshold    Only consider segments with number of active synapses greater than this threshold.\n\n         @retval Activity to return.\n        *\/\n        Activity computeActivity(const std::vector<Cell>& input,\n                                 Permanence permanenceThreshold,\n                                 UInt synapseThreshold) const;\n\n        \/**\n         Gets the active segments from activity.\n\n         @param activity Activity.\n\n         @retval Active segments.\n        *\/\n        std::vector<Segment> activeSegments(const Activity& activity);\n\n        \/**\n         Gets the active cells from activity.\n\n         @param activity Activity.\n\n         @retval Active cells.\n        *\/\n        std::vector<Cell> activeCells(const Activity& activity);\n\n      private:\n        std::vector<CellData> cells_;\n        \/\/ Mapping (presynaptic cell => synapses) used in forward propagation\n        std::map< Cell, std::vector<Synapse> > synapsesForPresynapticCell_;\n      }; \/\/ end class Connections\n\n    } \/\/ end namespace connections\n\n  } \/\/ end namespace algorithms\n\n} \/\/ end namespace nta\n\n#endif \/\/ NTA_CONNECTIONS_HPP\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>INTEGRATION: CWS geordi2q10 (1.13.162); FILE MERGED 2003\/11\/28 09:43:05 rt 1.13.162.1: #111934#: join CWS dba01pp1<commit_after><|endoftext|>"}
{"text":"<commit_before>\/* -------------------------------------------------------------------------- *\n *                          OpenSim:  LogManager.cpp                          *\n * -------------------------------------------------------------------------- *\n * The OpenSim API is a toolkit for musculoskeletal modeling and simulation.  *\n * See http:\/\/opensim.stanford.edu and the NOTICE file for more information.  *\n * OpenSim is developed at Stanford University and supported by the US        *\n * National Institutes of Health (U54 GM072970, R24 HD065690) and by DARPA    *\n * through the Warrior Web program.                                           *\n *                                                                            *\n * Copyright (c) 2005-2017 Stanford University and the Authors                *\n *                                                                            *\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#include \"LogManager.h\"\n#include <fstream>\n\nusing namespace OpenSim;\n\n\/\/ Initialize static members\nLogBuffer LogManager::out;\nLogBuffer LogManager::err;\nstd::ostream LogManager::cout(std::cout.rdbuf()); \/\/ This cout writes to the actual standard out\nstd::ostream LogManager::cerr(std::cerr.rdbuf()); \/\/ This cerr writes to the actual standard error\n\n\/\/ Initialize a static log manager to force the constructor to be called\nLogManager logManager;\n\n\/\/=============================================================================\n\/\/ FileLogCallback\n\/\/=============================================================================\nStreamLogCallback::StreamLogCallback(const std::string &filename)\n    : _out(new std::ofstream(filename.c_str())), _ownsStream(true)\n{}\n\nStreamLogCallback::StreamLogCallback(std::ostream *aOut, bool aOwnsStream)\n    : _out(aOut), _ownsStream(aOwnsStream)\n{}\n\nStreamLogCallback::~StreamLogCallback()\n{\n    if(_ownsStream) delete _out;\n}\n\nvoid StreamLogCallback::log(const std::string &str)\n{\n    *_out << str << std::flush;\n}\n\n\/\/=============================================================================\n\/\/ LogBuffer\n\/\/=============================================================================\nLogBuffer::LogBuffer()\n{\n}\n\nLogBuffer::~LogBuffer()\n{\n    for(int i = 0; i < _logCallbacks.size(); i++) {\n        delete _logCallbacks[i];\n    }\n}\n\n\/\/ Assumes caller owns this output stream (will never be deleted)\nbool LogBuffer::\naddLogCallback(LogCallback *aLogCallback)\n{\n    if(_logCallbacks.findIndex(aLogCallback) >= 0) return false;\n    _logCallbacks.append(aLogCallback); \n    return true;\n}\n\nbool LogBuffer::\nremoveLogCallback(LogCallback *aLogCallback)\n{\n    int index = _logCallbacks.findIndex(aLogCallback);\n    if(index < 0) return false;\n    _logCallbacks.remove(index); \n    return true;\n}\n\nint LogBuffer::\nsync()\n{\n    \/\/ Pass current string to all log callbacks\n    for(int i=0; i<_logCallbacks.getSize(); i++) _logCallbacks[i]->log(str());\n    \/\/ Reset current buffer contents\n    str(\"\");\n    return std::stringbuf::sync();\n}\n\n\/\/=============================================================================\n\/\/ LogManager\n\/\/=============================================================================\nLogManager::LogManager()\n{\n    \/\/ Seems to be causing crashes in the GUI... maybe a multithreading issue.\n\n    \/\/ Change the underlying streambuf for the standard cout\/cerr to our custom buffers\n    std::cout.rdbuf(&out);\n    std::cerr.rdbuf(&err);\n\n    \/\/ Redirect output to both the terminal and an output file\n    out.addLogCallback(new StreamLogCallback(&cout,false));\n    err.addLogCallback(new StreamLogCallback(&cerr,false));\n\n#if OPENSIM_LOG_TO_FILE\n    out.addLogCallback(new StreamLogCallback(\"out.log\"));\n    err.addLogCallback(new StreamLogCallback(\"err.log\"));\n#endif\n}\n\nLogManager::~LogManager()\n{\n    std::cout << std::flush;\n    std::cerr << std::flush;\n}\n\nLogManager *LogManager::getInstance()\n{\n    return &logManager;\n}\n\nLogBuffer *LogManager::getOutBuffer()\n{\n    return &out;\n}\n\nLogBuffer *LogManager::getErrBuffer()\n{\n    return &err;\n}\n<commit_msg>LogManager: Clarified comments.<commit_after>\/* -------------------------------------------------------------------------- *\n *                          OpenSim:  LogManager.cpp                          *\n * -------------------------------------------------------------------------- *\n * The OpenSim API is a toolkit for musculoskeletal modeling and simulation.  *\n * See http:\/\/opensim.stanford.edu and the NOTICE file for more information.  *\n * OpenSim is developed at Stanford University and supported by the US        *\n * National Institutes of Health (U54 GM072970, R24 HD065690) and by DARPA    *\n * through the Warrior Web program.                                           *\n *                                                                            *\n * Copyright (c) 2005-2017 Stanford University and the Authors                *\n *                                                                            *\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#include \"LogManager.h\"\n#include <fstream>\n\nusing namespace OpenSim;\n\n\/\/ Initialize static members\nLogBuffer LogManager::out;\nLogBuffer LogManager::err;\nstd::ostream LogManager::cout(std::cout.rdbuf()); \/\/ This cout writes to the actual standard out\nstd::ostream LogManager::cerr(std::cerr.rdbuf()); \/\/ This cerr writes to the actual standard error\n\n\/\/ Initialize a static log manager to force the constructor to be called\nLogManager logManager;\n\n\/\/=============================================================================\n\/\/ FileLogCallback\n\/\/=============================================================================\nStreamLogCallback::StreamLogCallback(const std::string &filename)\n    : _out(new std::ofstream(filename.c_str())), _ownsStream(true)\n{}\n\nStreamLogCallback::StreamLogCallback(std::ostream *aOut, bool aOwnsStream)\n    : _out(aOut), _ownsStream(aOwnsStream)\n{}\n\nStreamLogCallback::~StreamLogCallback()\n{\n    if(_ownsStream) delete _out;\n}\n\nvoid StreamLogCallback::log(const std::string &str)\n{\n    *_out << str << std::flush;\n}\n\n\/\/=============================================================================\n\/\/ LogBuffer\n\/\/=============================================================================\nLogBuffer::LogBuffer()\n{\n}\n\nLogBuffer::~LogBuffer()\n{\n    for(int i = 0; i < _logCallbacks.size(); i++) {\n        delete _logCallbacks[i];\n    }\n}\n\n\/\/ Assumes caller owns this output stream (will never be deleted)\nbool LogBuffer::\naddLogCallback(LogCallback *aLogCallback)\n{\n    if(_logCallbacks.findIndex(aLogCallback) >= 0) return false;\n    _logCallbacks.append(aLogCallback); \n    return true;\n}\n\nbool LogBuffer::\nremoveLogCallback(LogCallback *aLogCallback)\n{\n    int index = _logCallbacks.findIndex(aLogCallback);\n    if(index < 0) return false;\n    _logCallbacks.remove(index); \n    return true;\n}\n\nint LogBuffer::\nsync()\n{\n    \/\/ Pass current string to all log callbacks\n    for(int i=0; i<_logCallbacks.getSize(); i++) _logCallbacks[i]->log(str());\n    \/\/ Reset current buffer contents\n    str(\"\");\n    return std::stringbuf::sync();\n}\n\n\/\/=============================================================================\n\/\/ LogManager\n\/\/=============================================================================\nLogManager::LogManager()\n{\n    \/\/ Seems to be causing crashes in the GUI... maybe a multithreading issue.\n\n    \/\/ Change the underlying streambuf for the standard cout\/cerr to our custom buffers\n    std::cout.rdbuf(&out);\n    std::cerr.rdbuf(&err);\n\n    \/\/ Redirect output to the terminal\n    out.addLogCallback(new StreamLogCallback(&cout,false));\n    err.addLogCallback(new StreamLogCallback(&cerr,false));\n\n    \/\/ Optional: Redirect output to file\n#if OPENSIM_LOG_TO_FILE\n    out.addLogCallback(new StreamLogCallback(\"out.log\"));\n    err.addLogCallback(new StreamLogCallback(\"err.log\"));\n#endif\n}\n\nLogManager::~LogManager()\n{\n    std::cout << std::flush;\n    std::cerr << std::flush;\n}\n\nLogManager *LogManager::getInstance()\n{\n    return &logManager;\n}\n\nLogBuffer *LogManager::getOutBuffer()\n{\n    return &out;\n}\n\nLogBuffer *LogManager::getErrBuffer()\n{\n    return &err;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Module:    itkContourDirectedMeanDistanceImageFilterTest.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 \"itkContourDirectedMeanDistanceImageFilter.h\"\n#include \"itkImageRegionIterator.h\"\n#include \"itkFilterWatcher.h\"\n\nint itkContourDirectedMeanDistanceImageFilterTest(int, char* [] )\n{\n\n  typedef unsigned int Pixel1Type;\n  typedef float Pixel2Type;\n  enum { ImageDimension = 3 };\n\n  typedef itk::Image<Pixel1Type,ImageDimension> Image1Type;\n  typedef itk::Image<Pixel2Type,ImageDimension> Image2Type;\n\n  Image1Type::Pointer image1 = Image1Type::New();\n  Image2Type::Pointer image2 = Image2Type::New();\n\n  Image1Type::SizeType size;\n  size.Fill( 50 );\n  \n  image1->SetRegions( size );\n  image2->SetRegions( size );\n\n  image1->Allocate();\n  image2->Allocate();\n\n  image1->FillBuffer( itk::NumericTraits<Pixel1Type>::Zero );\n  image2->FillBuffer( itk::NumericTraits<Pixel2Type>::Zero );\n\n  typedef Image1Type::RegionType RegionType;\n  RegionType region1;\n  RegionType region2;\n\n  typedef Image1Type::IndexType IndexType;\n  IndexType index;\n\n  size.Fill( 20 );\n  index.Fill( 10 );\n  region1.SetSize( size );\n  region1.SetIndex( index );\n\n  size.Fill( 15 );\n  index.Fill( 20 );\n  region2.SetSize( size );\n  region2.SetIndex( index );\n\n  itk::ImageRegionIterator<Image1Type> it1( image1, region1 );\n  Pixel1Type count = itk::NumericTraits<Pixel1Type>::Zero;\n  while ( !it1.IsAtEnd() )\n    {\n    it1.Set( ++count );\n    ++it1;\n    }\n\n  itk::ImageRegionIterator<Image2Type> it2( image2, region2 );\n  while ( !it2.IsAtEnd() )\n    {\n    it2.Set( 7.2 );\n    ++it2;\n    }\n\n\n  \/\/ compute the directed Mean distance h(image1,image2)\n  {\n  typedef itk::ContourDirectedMeanDistanceImageFilter<Image1Type,Image2Type> FilterType;\n  FilterType::Pointer filter = FilterType::New();\n  FilterWatcher watcher(filter, \"filter\");\n\n  filter->SetInput1( image1 );\n  filter->SetInput2( image2 );\n  filter->Update();\n  filter->Print( std::cout );\n\n\n  \/\/ check results\n  \n  FilterType::RealType trueDistance = 13.8527;\n    vcl_sqrt( static_cast<double>(ImageDimension) );\n  FilterType::RealType distance = filter->GetContourDirectedMeanDistance();\n\n  std::cout << \" True     distance: \" << trueDistance << std::endl;\n  std::cout << \" Computed distance: \" << distance << std::endl;\n\n  if ( vnl_math_abs( trueDistance - distance ) > 0.1 )\n    {\n    std::cout << \"Test failed. \" << std::endl;\n    return EXIT_FAILURE;\n    }\n  }\n\n  \/\/ compute the directed Mean distance h(image2,image1)\n  {\n  typedef itk::ContourDirectedMeanDistanceImageFilter<Image2Type,Image1Type> FilterType;\n  FilterType::Pointer filter = FilterType::New();\n\n  filter->SetInput1( image2 );\n  filter->SetInput2( image1 );\n  filter->Update();\n\n\n  \/\/ check results\n  FilterType::RealType trueDistance = 12.1997;\n  FilterType::RealType distance = filter->GetContourDirectedMeanDistance();\n\n  std::cout << \" True     distance: \" << trueDistance << std::endl;\n  std::cout << \" Computed distance: \" << distance << std::endl;\n\n  if ( vnl_math_abs( trueDistance - distance ) > 0.1 )\n    {\n    std::cout << \"Test failed. \" << std::endl;\n    return EXIT_FAILURE;\n    }\n  }\n\n  std::cout << \"Test passed. \" << std::endl;\n  return EXIT_SUCCESS;\n  \n}\n<commit_msg>BUG: true distances were wrong.<commit_after>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit\n  Module:    itkContourDirectedMeanDistanceImageFilterTest.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 \"itkContourDirectedMeanDistanceImageFilter.h\"\n#include \"itkImageRegionIterator.h\"\n#include \"itkFilterWatcher.h\"\n\nint itkContourDirectedMeanDistanceImageFilterTest(int, char* [] )\n{\n\n  typedef unsigned int Pixel1Type;\n  typedef float Pixel2Type;\n  enum { ImageDimension = 3 };\n\n  typedef itk::Image<Pixel1Type,ImageDimension> Image1Type;\n  typedef itk::Image<Pixel2Type,ImageDimension> Image2Type;\n\n  Image1Type::Pointer image1 = Image1Type::New();\n  Image2Type::Pointer image2 = Image2Type::New();\n\n  Image1Type::SizeType size;\n  size.Fill( 50 );\n  \n  image1->SetRegions( size );\n  image2->SetRegions( size );\n\n  image1->Allocate();\n  image2->Allocate();\n\n  image1->FillBuffer( itk::NumericTraits<Pixel1Type>::Zero );\n  image2->FillBuffer( itk::NumericTraits<Pixel2Type>::Zero );\n\n  typedef Image1Type::RegionType RegionType;\n  RegionType region1;\n  RegionType region2;\n\n  typedef Image1Type::IndexType IndexType;\n  IndexType index;\n\n  size.Fill( 20 );\n  index.Fill( 10 );\n  region1.SetSize( size );\n  region1.SetIndex( index );\n\n  size.Fill( 15 );\n  index.Fill( 20 );\n  region2.SetSize( size );\n  region2.SetIndex( index );\n\n  itk::ImageRegionIterator<Image1Type> it1( image1, region1 );\n  Pixel1Type count = itk::NumericTraits<Pixel1Type>::Zero;\n  while ( !it1.IsAtEnd() )\n    {\n    it1.Set( ++count );\n    ++it1;\n    }\n\n  itk::ImageRegionIterator<Image2Type> it2( image2, region2 );\n  while ( !it2.IsAtEnd() )\n    {\n    it2.Set( 7.2 );\n    ++it2;\n    }\n\n\n  \/\/ compute the directed Mean distance h(image1,image2)\n  {\n  typedef itk::ContourDirectedMeanDistanceImageFilter<Image1Type,Image2Type> FilterType;\n  FilterType::Pointer filter = FilterType::New();\n  FilterWatcher watcher(filter, \"filter\");\n\n  filter->SetInput1( image1 );\n  filter->SetInput2( image2 );\n  filter->Update();\n  filter->Print( std::cout );\n\n\n  \/\/ check results\n  \n  FilterType::RealType trueDistance = 8.07158;\n    vcl_sqrt( static_cast<double>(ImageDimension) );\n  FilterType::RealType distance = filter->GetContourDirectedMeanDistance();\n\n  std::cout << \" True     distance: \" << trueDistance << std::endl;\n  std::cout << \" Computed distance: \" << distance << std::endl;\n\n  if ( vnl_math_abs( trueDistance - distance ) > 0.1 )\n    {\n    std::cout << \"Test failed. \" << std::endl;\n    return EXIT_FAILURE;\n    }\n  }\n\n  \/\/ compute the directed Mean distance h(image2,image1)\n  {\n  typedef itk::ContourDirectedMeanDistanceImageFilter<Image2Type,Image1Type> FilterType;\n  FilterType::Pointer filter = FilterType::New();\n\n  filter->SetInput1( image2 );\n  filter->SetInput2( image1 );\n  filter->Update();\n\n\n  \/\/ check results\n  FilterType::RealType trueDistance = 3.58646;\n  FilterType::RealType distance = filter->GetContourDirectedMeanDistance();\n\n  std::cout << \" True     distance: \" << trueDistance << std::endl;\n  std::cout << \" Computed distance: \" << distance << std::endl;\n\n  if ( vnl_math_abs( trueDistance - distance ) > 0.1 )\n    {\n    std::cout << \"Test failed. \" << std::endl;\n    return EXIT_FAILURE;\n    }\n  }\n\n  std::cout << \"Test passed. \" << std::endl;\n  return EXIT_SUCCESS;\n  \n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef STAN_MATH_GPU_ADD_HPP\n#define STAN_MATH_GPU_ADD_HPP\n#ifdef STAN_OPENCL\n#include <stan\/math\/gpu\/matrix_gpu.hpp>\n#include <stan\/math\/gpu\/kernels\/add.hpp>\n#include <stan\/math\/gpu\/err\/check_matching_dims.hpp>\n#include <CL\/cl.hpp>\n\nnamespace stan {\nnamespace math {\n\n\/**\n * Matrix addition on the GPU\n *\n * @param A first matrix\n * @param B second matrix\n *\n * @return sum of A and B\n *\n * @throw <code>std::invalid_argument<\/code> if the\n * input matrices do not have matching dimensions\n *\n *\/\ninline auto add(const matrix_gpu& A, const matrix_gpu& B) {\n  check_matching_dims(\"add\", \"A\", A, \"B\", B);\n  matrix_gpu C(A.rows(), A.cols());\n  if (C.size() == 0) {\n    return C;\n  }\n  cl::CommandQueue cmdQueue = opencl_context.queue();\n  try {\n    opencl_kernels::add(cl::NDRange(A.rows(), A.cols()), C.buffer(), A.buffer(),\n                        B.buffer(), A.rows(), A.cols());\n  } catch (const cl::Error& e) {\n    check_opencl_error(\"add\", e);\n  }\n  return C;\n}\n\n\/**\n * Matrix addition on the GPU\n *\n * @param A first matrix\n * @param B second matrix\n *\n * @return sum of A and B\n *\n * @throw <code>std::invalid_argument<\/code> if the\n * input matrices do not have matching dimensions\n *\n *\/\ninline auto operator+(const matrix_gpu& A, const matrix_gpu& B) {\n    return add(A, B);\n}\n}  \/\/ namespace math\n}  \/\/ namespace stan\n\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_GPU_ADD_HPP\n#define STAN_MATH_GPU_ADD_HPP\n#ifdef STAN_OPENCL\n#include <stan\/math\/gpu\/matrix_gpu.hpp>\n#include <stan\/math\/gpu\/kernels\/add.hpp>\n#include <stan\/math\/gpu\/err\/check_matching_dims.hpp>\n#include <CL\/cl.hpp>\n\nnamespace stan {\nnamespace math {\n\n\/**\n * Matrix addition on the GPU\n *\n * @param A first matrix\n * @param B second matrix\n *\n * @return sum of A and B\n *\n * @throw <code>std::invalid_argument<\/code> if the\n * input matrices do not have matching dimensions\n *\n *\/\ninline auto add(const matrix_gpu& A, const matrix_gpu& B) {\n  check_matching_dims(\"add\", \"A\", A, \"B\", B);\n  matrix_gpu C(A.rows(), A.cols());\n  if (C.size() == 0) {\n    return C;\n  }\n  cl::CommandQueue cmdQueue = opencl_context.queue();\n  try {\n    opencl_kernels::add(cl::NDRange(A.rows(), A.cols()), C.buffer(), A.buffer(),\n                        B.buffer(), A.rows(), A.cols());\n  } catch (const cl::Error& e) {\n    check_opencl_error(\"add\", e);\n  }\n  return C;\n}\n\n\/**\n * Matrix addition on the GPU\n *\n * @param A first matrix\n * @param B second matrix\n *\n * @return sum of A and B\n *\n * @throw <code>std::invalid_argument<\/code> if the\n * input matrices do not have matching dimensions\n *\n *\/\ninline auto operator+(const matrix_gpu& A, const matrix_gpu& B) {\n  return add(A, B);\n}\n}  \/\/ namespace math\n}  \/\/ namespace stan\n\n#endif\n#endif\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Add a fake appearance dictionary to Sig object.<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>PDFWriterImpl::finalizeSignature: -Werror=unused-variable<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: CachedDataSequence.hxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: kz $ $Date: 2008-03-05 17:14: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#ifndef _CHART_CACHEDDATASEQUENCE_HXX\n#define _CHART_CACHEDDATASEQUENCE_HXX\n\n\/\/ helper classes\n#ifndef _CPPUHELPER_COMPBASE7_HXX_\n#include <cppuhelper\/compbase7.hxx>\n#endif\n#ifndef _COMPHELPER_UNO3_HXX_\n#include <comphelper\/uno3.hxx>\n#endif\n#ifndef _COMPHELPER_BROADCASTHELPER_HXX_\n#include <comphelper\/broadcasthelper.hxx>\n#endif\n#ifndef _COMPHELPER_PROPERTYCONTAINER_HXX_\n#include <comphelper\/propertycontainer.hxx>\n#endif\n#ifndef _COMPHELPER_PROPERTY_ARRAY_HELPER_HXX_\n#include <comphelper\/proparrhlp.hxx>\n#endif\n#include \"ServiceMacros.hxx\"\n\n\/\/ interfaces and types\n#ifndef _COM_SUN_STAR_LANG_XSERVICEINFO_HPP_\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#endif\n#include <com\/sun\/star\/lang\/XInitialization.hpp>\n#ifndef _COM_SUN_STAR_BEANS_XPROPERTYSET_HPP_\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UNO_XCOMPONENTCONTEXT_HPP_\n#include <com\/sun\/star\/uno\/XComponentContext.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_CHART2_DATA_XDATASEQUENCE_HPP_\n#include <com\/sun\/star\/chart2\/data\/XDataSequence.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CHART2_DATA_XNUMERICALDATASEQUENCE_HPP_\n#include <com\/sun\/star\/chart2\/data\/XNumericalDataSequence.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CHART2_DATA_XTEXTUALDATASEQUENCE_HPP_\n#include <com\/sun\/star\/chart2\/data\/XTextualDataSequence.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UTIL_XCLONEABLE_HPP_\n#include <com\/sun\/star\/util\/XCloneable.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UTIL_XMODIFYBROADCASTER_HPP_\n#include <com\/sun\/star\/util\/XModifyBroadcaster.hpp>\n#endif\n\n#include <vector>\n\n\/\/ ____________________\nnamespace chart\n{\n\nnamespace impl\n{\ntypedef ::cppu::WeakComponentImplHelper7<\n    ::com::sun::star::chart2::data::XDataSequence,\n    ::com::sun::star::chart2::data::XNumericalDataSequence,\n    ::com::sun::star::chart2::data::XTextualDataSequence,\n    ::com::sun::star::util::XCloneable,\n    ::com::sun::star::util::XModifyBroadcaster,\n    ::com::sun::star::lang::XInitialization,\n    ::com::sun::star::lang::XServiceInfo >\n    CachedDataSequence_Base;\n}\n\nclass CachedDataSequence :\n        public ::comphelper::OMutexAndBroadcastHelper,\n        public ::comphelper::OPropertyContainer,\n        public ::comphelper::OPropertyArrayUsageHelper< CachedDataSequence >,\n        public impl::CachedDataSequence_Base\n{\npublic:\n    \/** constructs an empty sequence\n     *\/\n    CachedDataSequence();\n\n    explicit CachedDataSequence(\n        const ::com::sun::star::uno::Reference<\n            ::com::sun::star::uno::XComponentContext > & xContext );\n\n    \/** creates a sequence and initializes it with the given vector of floating\n        point numbers\n     *\/\n    explicit CachedDataSequence( const ::std::vector< double > & rVector );\n\n    \/** creates a sequence and initializes it with the given vector of strings\n     *\/\n    explicit CachedDataSequence( const ::std::vector< ::rtl::OUString > & rVector );\n\n    \/** creates a sequence and initializes it with the given string.  This is\n        especially useful for labels, which only have one element.\n     *\/\n    explicit CachedDataSequence( const ::rtl::OUString & rSingleText );\n\n    \/** creates a sequence and initializes it with the given vector of arbitrary\n        content\n     *\/\n    explicit CachedDataSequence( const ::std::vector< ::com::sun::star::uno::Any > & rVector );\n\n    \/\/\/ Copy CTOR\n    explicit CachedDataSequence( const CachedDataSequence & rSource );\n\n    virtual ~CachedDataSequence();\n\n    \/** optimizes internal storage such that getData() is the fastest method for\n        retrieving data.\n    *\/\n    void PreferMixedData();\n    \/** optimizes internal storage such that getNumericalData() is the fastest\n        method for retrieving data.\n     *\/\n    void PreferNumericalData();\n    \/** optimizes internal storage such that getTextualData() is the fastest\n        method for retrieving data.\n     *\/\n    void PreferTextualData();\n\n    \/** Allows setting the source-identifier.  This should only be called once.\n        (Late initialization)\n     *\/\n\/\/     void SetSourceIdentifier( const ::rtl::OUString & aId );\n\n    \/\/\/ establish methods for factory instatiation\n    APPHELPER_SERVICE_FACTORY_HELPER( CachedDataSequence )\n    \/\/\/ declare XServiceInfo methods\n    APPHELPER_XSERVICEINFO_DECL()\n\n    \/\/\/ merge XInterface implementations\n    DECLARE_XINTERFACE()\n    \/\/\/ merge XTypeProvider implementations\n    DECLARE_XTYPEPROVIDER()\n\nprotected:\n    \/\/ ____ XPropertySet ____\n    \/\/\/ @see ::com::sun::star::beans::XPropertySet\n    virtual ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySetInfo > SAL_CALL getPropertySetInfo()\n        throw (::com::sun::star::uno::RuntimeException);\n    \/\/\/ @see ::comphelper::OPropertySetHelper\n    virtual ::cppu::IPropertyArrayHelper& SAL_CALL getInfoHelper();\n    \/\/\/ @see ::comphelper::OPropertyArrayUsageHelper\n    virtual ::cppu::IPropertyArrayHelper* createArrayHelper() const;\n\n    \/\/ ____ XDataSequence ____\n    virtual ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any > SAL_CALL getData()\n        throw (::com::sun::star::uno::RuntimeException);\n    virtual ::rtl::OUString SAL_CALL getSourceRangeRepresentation()\n        throw (::com::sun::star::uno::RuntimeException);\n    virtual ::com::sun::star::uno::Sequence< ::rtl::OUString > SAL_CALL generateLabel(\n        ::com::sun::star::chart2::data::LabelOrigin nLabelOrigin )\n        throw (::com::sun::star::uno::RuntimeException);\n    virtual ::sal_Int32 SAL_CALL getNumberFormatKeyByIndex( ::sal_Int32 nIndex )\n        throw (::com::sun::star::lang::IndexOutOfBoundsException,\n               ::com::sun::star::uno::RuntimeException);\n\n    \/\/ ____ XNumericalDataSequence ____\n    \/\/\/ @see ::com::sun::star::chart::data::XNumericalDataSequence\n    virtual ::com::sun::star::uno::Sequence< double > SAL_CALL getNumericalData() throw (::com::sun::star::uno::RuntimeException);\n\n    \/\/ ____ XTextualDataSequence ____\n    \/\/\/ @see ::com::sun::star::chart::data::XTextualDataSequence\n    virtual ::com::sun::star::uno::Sequence< ::rtl::OUString > SAL_CALL getTextualData() throw (::com::sun::star::uno::RuntimeException);\n\n    \/\/ ____ XCloneable ____\n    virtual ::com::sun::star::uno::Reference< ::com::sun::star::util::XCloneable > SAL_CALL createClone()\n        throw (::com::sun::star::uno::RuntimeException);\n\n    \/\/ ____ XModifyBroadcaster ____\n    virtual void SAL_CALL addModifyListener(\n        const ::com::sun::star::uno::Reference< ::com::sun::star::util::XModifyListener >& aListener )\n        throw (::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL removeModifyListener(\n        const ::com::sun::star::uno::Reference< ::com::sun::star::util::XModifyListener >& aListener )\n        throw (::com::sun::star::uno::RuntimeException);\n\n    \/\/ ::com::sun::star::lang::XInitialization:\n    virtual void SAL_CALL initialize(const ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any > & aArguments)\n        throw (::com::sun::star::uno::RuntimeException, ::com::sun::star::uno::Exception);\n\n    void fireModifyEvent();\n\n    \/\/ <properties>\n    sal_Int32                                       m_nNumberFormatKey;\n    ::rtl::OUString                                 m_sRole;\n    sal_Bool                                        m_bIsHidden;\n    ::com::sun::star::uno::Sequence< sal_Int32 >    m_aHiddenValues;\n    \/\/ <\/properties>\n\n    enum DataType\n    {\n        NUMERICAL,\n        TEXTUAL,\n        MIXED\n    };\n\n    \/** This method registers all properties.  It should be called by all\n        constructors.\n     *\/\n    void registerProperties();\n\n    \/** is used by interface method getNumericalData() as well as\n        PreferNumericalData().\n     *\/\n    ::com::sun::star::uno::Sequence< double > Impl_getNumericalData() const;\n    \/** is used by interface method getTextualData() as well as\n        PreferTextualData().\n     *\/\n    ::com::sun::star::uno::Sequence< ::rtl::OUString > Impl_getTextualData() const;\n    \/** is used by interface method getData() as well as PreferMixedData().\n     *\/\n    ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any > Impl_getMixedData() const;\n\n    \/** is used by PreferNumericalData().\n     *\/\n    void Impl_setNumericalData( const ::com::sun::star::uno::Sequence< double > & rSeq );\n    \/** is used by PreferTextualData().\n     *\/\n    void Impl_setTextualData( const ::com::sun::star::uno::Sequence< ::rtl::OUString > & rSeq );\n    \/** is used by PreferMixedData().\n     *\/\n    void Impl_setMixedData( const ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any > & rSeq );\n\nprivate:\n    enum DataType                                       m_eCurrentDataType;\n\n    ::com::sun::star::uno::Sequence< double >           m_aNumericalSequence;\n    ::com::sun::star::uno::Sequence< ::rtl::OUString >  m_aTextualSequence;\n    ::com::sun::star::uno::Sequence<\n        ::com::sun::star::uno::Any >                    m_aMixedSequence;\n    ::com::sun::star::uno::Reference< ::com::sun::star::util::XModifyListener >\n        m_xModifyEventForwarder;\n};\n\n}  \/\/ namespace chart\n\n\n\/\/ _CHART_CACHEDDATASEQUENCE_HXX\n#endif\n<commit_msg>INTEGRATION: CWS changefileheader (1.5.20); FILE MERGED 2008\/04\/01 15:04:11 thb 1.5.20.3: #i85898# Stripping all external header guards 2008\/04\/01 10:50:27 thb 1.5.20.2: #i85898# Stripping all external header guards 2008\/03\/28 16:43:52 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: CachedDataSequence.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#ifndef _CHART_CACHEDDATASEQUENCE_HXX\n#define _CHART_CACHEDDATASEQUENCE_HXX\n\n\/\/ helper classes\n#include <cppuhelper\/compbase7.hxx>\n#include <comphelper\/uno3.hxx>\n#include <comphelper\/broadcasthelper.hxx>\n#include <comphelper\/propertycontainer.hxx>\n#include <comphelper\/proparrhlp.hxx>\n#include \"ServiceMacros.hxx\"\n\n\/\/ interfaces and types\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#include <com\/sun\/star\/lang\/XInitialization.hpp>\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#include <com\/sun\/star\/uno\/XComponentContext.hpp>\n#include <com\/sun\/star\/chart2\/data\/XDataSequence.hpp>\n#include <com\/sun\/star\/chart2\/data\/XNumericalDataSequence.hpp>\n#include <com\/sun\/star\/chart2\/data\/XTextualDataSequence.hpp>\n#include <com\/sun\/star\/util\/XCloneable.hpp>\n#include <com\/sun\/star\/util\/XModifyBroadcaster.hpp>\n\n#include <vector>\n\n\/\/ ____________________\nnamespace chart\n{\n\nnamespace impl\n{\ntypedef ::cppu::WeakComponentImplHelper7<\n    ::com::sun::star::chart2::data::XDataSequence,\n    ::com::sun::star::chart2::data::XNumericalDataSequence,\n    ::com::sun::star::chart2::data::XTextualDataSequence,\n    ::com::sun::star::util::XCloneable,\n    ::com::sun::star::util::XModifyBroadcaster,\n    ::com::sun::star::lang::XInitialization,\n    ::com::sun::star::lang::XServiceInfo >\n    CachedDataSequence_Base;\n}\n\nclass CachedDataSequence :\n        public ::comphelper::OMutexAndBroadcastHelper,\n        public ::comphelper::OPropertyContainer,\n        public ::comphelper::OPropertyArrayUsageHelper< CachedDataSequence >,\n        public impl::CachedDataSequence_Base\n{\npublic:\n    \/** constructs an empty sequence\n     *\/\n    CachedDataSequence();\n\n    explicit CachedDataSequence(\n        const ::com::sun::star::uno::Reference<\n            ::com::sun::star::uno::XComponentContext > & xContext );\n\n    \/** creates a sequence and initializes it with the given vector of floating\n        point numbers\n     *\/\n    explicit CachedDataSequence( const ::std::vector< double > & rVector );\n\n    \/** creates a sequence and initializes it with the given vector of strings\n     *\/\n    explicit CachedDataSequence( const ::std::vector< ::rtl::OUString > & rVector );\n\n    \/** creates a sequence and initializes it with the given string.  This is\n        especially useful for labels, which only have one element.\n     *\/\n    explicit CachedDataSequence( const ::rtl::OUString & rSingleText );\n\n    \/** creates a sequence and initializes it with the given vector of arbitrary\n        content\n     *\/\n    explicit CachedDataSequence( const ::std::vector< ::com::sun::star::uno::Any > & rVector );\n\n    \/\/\/ Copy CTOR\n    explicit CachedDataSequence( const CachedDataSequence & rSource );\n\n    virtual ~CachedDataSequence();\n\n    \/** optimizes internal storage such that getData() is the fastest method for\n        retrieving data.\n    *\/\n    void PreferMixedData();\n    \/** optimizes internal storage such that getNumericalData() is the fastest\n        method for retrieving data.\n     *\/\n    void PreferNumericalData();\n    \/** optimizes internal storage such that getTextualData() is the fastest\n        method for retrieving data.\n     *\/\n    void PreferTextualData();\n\n    \/** Allows setting the source-identifier.  This should only be called once.\n        (Late initialization)\n     *\/\n\/\/     void SetSourceIdentifier( const ::rtl::OUString & aId );\n\n    \/\/\/ establish methods for factory instatiation\n    APPHELPER_SERVICE_FACTORY_HELPER( CachedDataSequence )\n    \/\/\/ declare XServiceInfo methods\n    APPHELPER_XSERVICEINFO_DECL()\n\n    \/\/\/ merge XInterface implementations\n    DECLARE_XINTERFACE()\n    \/\/\/ merge XTypeProvider implementations\n    DECLARE_XTYPEPROVIDER()\n\nprotected:\n    \/\/ ____ XPropertySet ____\n    \/\/\/ @see ::com::sun::star::beans::XPropertySet\n    virtual ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySetInfo > SAL_CALL getPropertySetInfo()\n        throw (::com::sun::star::uno::RuntimeException);\n    \/\/\/ @see ::comphelper::OPropertySetHelper\n    virtual ::cppu::IPropertyArrayHelper& SAL_CALL getInfoHelper();\n    \/\/\/ @see ::comphelper::OPropertyArrayUsageHelper\n    virtual ::cppu::IPropertyArrayHelper* createArrayHelper() const;\n\n    \/\/ ____ XDataSequence ____\n    virtual ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any > SAL_CALL getData()\n        throw (::com::sun::star::uno::RuntimeException);\n    virtual ::rtl::OUString SAL_CALL getSourceRangeRepresentation()\n        throw (::com::sun::star::uno::RuntimeException);\n    virtual ::com::sun::star::uno::Sequence< ::rtl::OUString > SAL_CALL generateLabel(\n        ::com::sun::star::chart2::data::LabelOrigin nLabelOrigin )\n        throw (::com::sun::star::uno::RuntimeException);\n    virtual ::sal_Int32 SAL_CALL getNumberFormatKeyByIndex( ::sal_Int32 nIndex )\n        throw (::com::sun::star::lang::IndexOutOfBoundsException,\n               ::com::sun::star::uno::RuntimeException);\n\n    \/\/ ____ XNumericalDataSequence ____\n    \/\/\/ @see ::com::sun::star::chart::data::XNumericalDataSequence\n    virtual ::com::sun::star::uno::Sequence< double > SAL_CALL getNumericalData() throw (::com::sun::star::uno::RuntimeException);\n\n    \/\/ ____ XTextualDataSequence ____\n    \/\/\/ @see ::com::sun::star::chart::data::XTextualDataSequence\n    virtual ::com::sun::star::uno::Sequence< ::rtl::OUString > SAL_CALL getTextualData() throw (::com::sun::star::uno::RuntimeException);\n\n    \/\/ ____ XCloneable ____\n    virtual ::com::sun::star::uno::Reference< ::com::sun::star::util::XCloneable > SAL_CALL createClone()\n        throw (::com::sun::star::uno::RuntimeException);\n\n    \/\/ ____ XModifyBroadcaster ____\n    virtual void SAL_CALL addModifyListener(\n        const ::com::sun::star::uno::Reference< ::com::sun::star::util::XModifyListener >& aListener )\n        throw (::com::sun::star::uno::RuntimeException);\n    virtual void SAL_CALL removeModifyListener(\n        const ::com::sun::star::uno::Reference< ::com::sun::star::util::XModifyListener >& aListener )\n        throw (::com::sun::star::uno::RuntimeException);\n\n    \/\/ ::com::sun::star::lang::XInitialization:\n    virtual void SAL_CALL initialize(const ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any > & aArguments)\n        throw (::com::sun::star::uno::RuntimeException, ::com::sun::star::uno::Exception);\n\n    void fireModifyEvent();\n\n    \/\/ <properties>\n    sal_Int32                                       m_nNumberFormatKey;\n    ::rtl::OUString                                 m_sRole;\n    sal_Bool                                        m_bIsHidden;\n    ::com::sun::star::uno::Sequence< sal_Int32 >    m_aHiddenValues;\n    \/\/ <\/properties>\n\n    enum DataType\n    {\n        NUMERICAL,\n        TEXTUAL,\n        MIXED\n    };\n\n    \/** This method registers all properties.  It should be called by all\n        constructors.\n     *\/\n    void registerProperties();\n\n    \/** is used by interface method getNumericalData() as well as\n        PreferNumericalData().\n     *\/\n    ::com::sun::star::uno::Sequence< double > Impl_getNumericalData() const;\n    \/** is used by interface method getTextualData() as well as\n        PreferTextualData().\n     *\/\n    ::com::sun::star::uno::Sequence< ::rtl::OUString > Impl_getTextualData() const;\n    \/** is used by interface method getData() as well as PreferMixedData().\n     *\/\n    ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any > Impl_getMixedData() const;\n\n    \/** is used by PreferNumericalData().\n     *\/\n    void Impl_setNumericalData( const ::com::sun::star::uno::Sequence< double > & rSeq );\n    \/** is used by PreferTextualData().\n     *\/\n    void Impl_setTextualData( const ::com::sun::star::uno::Sequence< ::rtl::OUString > & rSeq );\n    \/** is used by PreferMixedData().\n     *\/\n    void Impl_setMixedData( const ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any > & rSeq );\n\nprivate:\n    enum DataType                                       m_eCurrentDataType;\n\n    ::com::sun::star::uno::Sequence< double >           m_aNumericalSequence;\n    ::com::sun::star::uno::Sequence< ::rtl::OUString >  m_aTextualSequence;\n    ::com::sun::star::uno::Sequence<\n        ::com::sun::star::uno::Any >                    m_aMixedSequence;\n    ::com::sun::star::uno::Reference< ::com::sun::star::util::XModifyListener >\n        m_xModifyEventForwarder;\n};\n\n}  \/\/ namespace chart\n\n\n\/\/ _CHART_CACHEDDATASEQUENCE_HXX\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Copyright 2008 Brain Research Institute, Melbourne, Australia\n\n    Written by J-Donald Tournier, 27\/11\/09.\n\n    This file is part of MRtrix.\n\n    MRtrix is free software: you can redistribute it and\/or modify\n    it under the terms of the GNU General Public License as published by\n    the Free Software Foundation, either version 3 of the License, or\n    (at your option) any later version.\n\n    MRtrix is distributed in the hope that it will be useful,\n    but WITHOUT ANY WARRANTY; without even the implied warranty of\n    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n    GNU General Public License for more details.\n\n    You should have received a copy of the GNU General Public License\n    along with MRtrix.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n#include \"command.h\"\n#include \"progressbar.h\"\n#include \"memory.h\"\n#include \"image\/buffer.h\"\n#include \"image\/buffer_preload.h\"\n#include \"image\/buffer_scratch.h\"\n#include \"image\/iterator.h\"\n#include \"image\/threaded_loop.h\"\n#include \"image\/utils.h\"\n#include \"image\/voxel.h\"\n#include \"math\/math.h\"\n#include \"math\/median.h\"\n\n#include <limits>\n#include <vector>\n\n\nusing namespace MR;\nusing namespace App;\n\nconst char* operations[] = {\n  \"mean\",\n  \"median\",\n  \"sum\",\n  \"product\",\n  \"rms\",\n  \"var\",\n  \"std\",\n  \"min\",\n  \"max\",\n  \"absmax\", \/\/ Maximum of absolute values\n  \"magmax\", \/\/ Value for which the magnitude is the maximum (i.e. preserves signed-ness)\n  NULL\n};\n\nvoid usage ()\n{\n  DESCRIPTION\n    + \"compute summary statistic on image intensities either across images, \"\n    \"or along a specified axis for a single image. Supported operations are:\"\n\n    + \"mean, median, sum, product, rms (root-mean-square value), var (unbiased variance), \"\n    \"std (unbiased standard deviation), min, max, absmax (maximum absolute value), \"\n    \"magmax (value with maximum absolute value, preserving its sign).\"\n\n    + \"See also 'mrcalc' to compute per-voxel operations.\";\n\n  ARGUMENTS\n  + Argument (\"input\", \"the input image.\").type_image_in ().allow_multiple()\n  + Argument (\"operation\", \"the operation to apply, one of: \" + join(operations, \", \") + \".\").type_choice (operations)\n  + Argument (\"output\", \"the output image.\").type_image_out ();\n\n  OPTIONS\n  + Option (\"axis\", \"perform operation along a specified axis of a single input image\")\n    + Argument (\"index\").type_integer();\n\n}\n\n\ntypedef float value_type;\n\ntypedef Image::BufferPreload<value_type> PreloadBufferType;\ntypedef PreloadBufferType::voxel_type PreloadVoxelType;\n\ntypedef Image::Buffer<value_type> BufferType;\ntypedef BufferType::voxel_type VoxelType;\n\n\n\nclass Mean {\n  public:\n    Mean () : sum (0.0), count (0) { }\n    void operator() (value_type val) { \n      if (std::isfinite (val)) {\n        sum += val;\n        ++count;\n      }\n    }\n    value_type result () const { \n      if (!count)\n        return NAN;\n      return sum \/ count; \n    }\n    double sum;\n    size_t count;\n};\n\nclass Median {\n  public:\n    Median () { }\n    void operator() (value_type val) { \n      if (!std::isnan (val))\n        values.push_back(val);\n    }\n    value_type result () { \n      return Math::median(values);\n    }\n    std::vector<value_type> values; \n};\n\nclass Sum {\n  public:\n    Sum () : sum (0.0) { }\n    void operator() (value_type val) { \n      if (std::isfinite (val)) \n        sum += val;\n    }\n    value_type result () const { \n      return sum; \n    }\n    double sum;\n};\n\n\nclass Product {\n  public:\n    Product () : product (0.0) { }\n    void operator() (value_type val) {\n      if (std::isfinite (val))\n        product += val;\n    }\n    value_type result () const {\n      return product;\n    }\n    double product;\n};\n\n\nclass RMS {\n  public:\n    RMS() : sum (0.0), count (0) { }\n    void operator() (value_type val) {\n      if (std::isfinite (val)) {\n        sum += Math::pow2 (val);\n        ++count;\n      }\n    }\n    value_type result() const {\n      if (!count)\n        return NAN;\n      return std::sqrt(sum \/ count);\n    }\n    double sum;\n    size_t count;\n};\n\n\nclass Var {\n  public:\n    Var () : sum (0.0), sum_sqr (0.0), count (0) { }\n    void operator() (value_type val) { \n      if (std::isfinite (val)) {\n        sum += val;\n        sum_sqr += Math::pow2 (val);\n        ++count;\n      }\n    }\n    value_type result () const { \n      if (count < 2) \n        return NAN;\n      return  (sum_sqr - Math::pow2 (sum) \/ static_cast<double> (count)) \/ (static_cast<double> (count) - 1.0);\n    }\n    double sum, sum_sqr;\n    size_t count;\n};\n\n\nclass Std : public Var {\n  public:\n    Std() : Var() { }\n    value_type result () const { return std::sqrt (Var::result()); }\n};\n\n\nclass Min {\n  public:\n    Min () : min (std::numeric_limits<value_type>::infinity()) { }\n    void operator() (value_type val) { \n      if (std::isfinite (val) && val < min) \n        min = val;\n    }\n    value_type result () const { return std::isfinite (min) ? min : NAN; }\n    value_type min;\n};\n\n\nclass Max {\n  public:\n    Max () : max (-std::numeric_limits<value_type>::infinity()) { }\n    void operator() (value_type val) { \n      if (std::isfinite (val) && val > max) \n        max = val;\n    }\n    value_type result () const { return std::isfinite (max) ? max : NAN; }\n    value_type max;\n};\n\n\nclass AbsMax {\n  public:\n    AbsMax () : max (-std::numeric_limits<value_type>::infinity()) { }\n    void operator() (value_type val) { \n      if (std::isfinite (val) && std::abs(val) > max) \n        max = std::abs(val);\n    }\n    value_type result () const { return std::isfinite (max) ? max : NAN; }\n    value_type max;\n};\n\nclass MagMax {\n  public:\n    MagMax () : max (-std::numeric_limits<value_type>::infinity()) { }\n    MagMax (const int i) : max (-std::numeric_limits<value_type>::infinity()) { }\n    void operator() (value_type val) { \n      if (std::isfinite (val) && (!std::isfinite (max) || std::abs(val) > std::abs (max)))\n        max = val;\n    }\n    value_type result () const { return std::isfinite (max) ? max : NAN; }\n    value_type max;\n};\n\n\n\n\n\ntemplate <class Operation>\nclass AxisKernel {\n  public:\n    AxisKernel (size_t axis) : axis (axis) { }\n\n    template <class InputVoxelType, class OutputVoxelType>\n      void operator() (InputVoxelType& in, OutputVoxelType& out) {\n        Operation op;\n        for (in[axis] = 0; in[axis] < in.dim(axis); ++in[axis])\n          op (in.value());\n        out.value() = op.result();\n      }\n  protected:\n    const size_t axis;\n};\n\n\n\n\n\nclass ImageKernelBase {\n  public:\n    ImageKernelBase (const std::string& path) :\n      output_path (path) { }\n    virtual ~ImageKernelBase() { }\n    virtual void process (const Image::Header& image_in) = 0;\n  protected:\n    const std::string output_path;\n};\n\n\n\ntemplate <class Operation>\nclass ImageKernel : public ImageKernelBase {\n  protected:\n    class InitFunctor { \n      public: \n        template <class VoxelType> \n          void operator() (VoxelType& out) const { out.value() = Operation(); } \n    };\n    class ProcessFunctor { \n      public: \n        template <class VoxelType1, class VoxelType2>\n          void operator() (VoxelType1& out, VoxelType2& in) const { \n            Operation op = out.value(); \n            op (in.value()); \n            out.value() = op;\n          } \n    };\n    class ResultFunctor {\n      public: \n        template <class VoxelType1, class VoxelType2>\n          void operator() (VoxelType1& out, VoxelType2& in) const {\n            Operation op = in.value(); \n            out.value() = op.result(); \n          } \n    };\n\n  public:\n    ImageKernel (const Image::Header& header, const std::string& path) :\n      ImageKernelBase (path),\n      header (header),\n      buffer (header) {\n        Image::ThreadedLoop (buffer).run (InitFunctor(), buffer.voxel());\n      }\n\n    ~ImageKernel()\n    {\n      Image::Buffer<value_type> out (output_path, header);\n      Image::ThreadedLoop (buffer).run (ResultFunctor(), out.voxel(), buffer.voxel());\n    }\n\n    void process (const Image::Header& image_in)\n    {\n      Image::Buffer<value_type> in (image_in);\n      Image::ThreadedLoop (buffer).run (ProcessFunctor(), buffer.voxel(), in.voxel());\n    }\n\n  protected:\n    const Image::Header& header;\n    Image::BufferScratch<Operation> buffer;\n\n};\n\n\n\n\nvoid run ()\n{\n  const size_t num_inputs = argument.size() - 2;\n  const int op = argument[num_inputs];\n  const std::string& output_path = argument.back();\n\n  Options opt = get_options (\"axis\");\n  if (opt.size()) {\n\n    if (num_inputs != 1)\n      throw Exception (\"Option -axis only applies if a single input image is used\");\n\n    const size_t axis = opt[0][0];\n\n    PreloadBufferType buffer_in (argument[0], Image::Stride::contiguous_along_axis (axis));\n\n    if (axis >= buffer_in.ndim())\n      throw Exception (\"Cannot perform operation along axis \" + str (axis) + \"; image only has \" + str(buffer_in.ndim()) + \" axes\");\n\n    Image::Header header_out (buffer_in);\n    header_out.datatype() = DataType::Float32;\n    header_out.dim(axis) = 1;\n    Image::squeeze_dim (header_out);\n\n    BufferType buffer_out (output_path, header_out);\n\n    auto vox_in = buffer_in.voxel();\n    auto vox_out = buffer_out.voxel();\n\n\n    Image::ThreadedLoop loop (std::string(\"computing \") + operations[op] + \" along axis \" + str(axis) + \"...\", buffer_out);\n\n    switch (op) {\n      case 0: loop.run  (AxisKernel<Mean>   (axis), vox_in, vox_out); return;\n      case 1: loop.run  (AxisKernel<Median> (axis), vox_in, vox_out); return;\n      case 2: loop.run  (AxisKernel<Sum>    (axis), vox_in, vox_out); return;\n      case 3: loop.run  (AxisKernel<Product>(axis), vox_in, vox_out); return;\n      case 4: loop.run  (AxisKernel<RMS>    (axis), vox_in, vox_out); return;\n      case 5: loop.run  (AxisKernel<Var>    (axis), vox_in, vox_out); return;\n      case 6: loop.run  (AxisKernel<Std>    (axis), vox_in, vox_out); return;\n      case 7: loop.run  (AxisKernel<Min>    (axis), vox_in, vox_out); return;\n      case 8: loop.run  (AxisKernel<Max>    (axis), vox_in, vox_out); return;\n      case 9: loop.run  (AxisKernel<AbsMax> (axis), vox_in, vox_out); return;\n      case 10: loop.run (AxisKernel<MagMax> (axis), vox_in, vox_out); return;\n      default: assert (0);\n    }\n\n  } else {\n\n    if (num_inputs < 2)\n      throw Exception (\"mrmath requires either multiple input images, or the -axis option to be provided\");\n\n    \/\/ Pre-load all image headers\n    std::vector<std::unique_ptr<Image::Header>> headers_in;\n\n    \/\/ Header of first input image is the template to which all other input images are compared\n    headers_in.push_back (std::unique_ptr<Image::Header> (new Image::Header (argument[0])));\n    Image::Header header (*headers_in[0]);\n\n    \/\/ Wipe any excess unary-dimensional axes\n    while (header.dim (header.ndim() - 1) == 1)\n      header.set_ndim (header.ndim() - 1);\n\n    \/\/ Verify that dimensions of all input images adequately match\n    for (size_t i = 1; i != num_inputs; ++i) {\n      const std::string path = argument[i];\n      headers_in.push_back (std::unique_ptr<Image::Header> (new Image::Header (path)));\n      const Image::Header& temp (*headers_in[i]);\n      if (temp.ndim() < header.ndim())\n        throw Exception (\"Image \" + path + \" has fewer axes than first imput image \" + header.name());\n      for (size_t axis = 0; axis != header.ndim(); ++axis) {\n        if (temp.dim(axis) != header.dim(axis))\n          throw Exception (\"Dimensions of image \" + path + \" do not match those of first input image \" + header.name());\n      }\n      for (size_t axis = header.ndim(); axis != temp.ndim(); ++axis) {\n        if (temp.dim(axis) != 1)\n          throw Exception (\"Image \" + path + \" has axis with non-unary dimension beyond first input image \" + header.name());\n      }\n    }\n\n    \/\/ Instantiate a kernel depending on the operation requested\n    std::unique_ptr<ImageKernelBase> kernel;\n    switch (op) {\n      case 0:  kernel.reset (new ImageKernel<Mean>    (header, output_path)); break;\n      case 1:  kernel.reset (new ImageKernel<Median>  (header, output_path)); break;\n      case 2:  kernel.reset (new ImageKernel<Sum>     (header, output_path)); break;\n      case 3:  kernel.reset (new ImageKernel<Product> (header, output_path)); break;\n      case 4:  kernel.reset (new ImageKernel<RMS>     (header, output_path)); break;\n      case 5:  kernel.reset (new ImageKernel<Var>     (header, output_path)); break;\n      case 6:  kernel.reset (new ImageKernel<Std>     (header, output_path)); break;\n      case 7:  kernel.reset (new ImageKernel<Min>     (header, output_path)); break;\n      case 8:  kernel.reset (new ImageKernel<Max>     (header, output_path)); break;\n      case 9:  kernel.reset (new ImageKernel<AbsMax>  (header, output_path)); break;\n      case 10: kernel.reset (new ImageKernel<MagMax>  (header, output_path)); break;\n      default: assert (0);\n    }\n\n    \/\/ Feed the input images to the kernel one at a time\n    {\n      ProgressBar progress (std::string(\"computing \") + operations[op] + \" across \" \n          + str(headers_in.size()) + \" images...\", num_inputs);\n      for (size_t i = 0; i != headers_in.size(); ++i) {\n        kernel->process (*headers_in[i]);\n        ++progress;\n      }\n    }\n\n    \/\/ Image output is handled by the kernel destructor\n\n  }\n\n}\n\n<commit_msg>syntax overhaul: mrmath: incomplete<commit_after>\/*\n    Copyright 2008 Brain Research Institute, Melbourne, Australia\n\n    Written by J-Donald Tournier, 27\/11\/09.\n\n    This file is part of MRtrix.\n\n    MRtrix is free software: you can redistribute it and\/or modify\n    it under the terms of the GNU General Public License as published by\n    the Free Software Foundation, either version 3 of the License, or\n    (at your option) any later version.\n\n    MRtrix is distributed in the hope that it will be useful,\n    but WITHOUT ANY WARRANTY; without even the implied warranty of\n    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n    GNU General Public License for more details.\n\n    You should have received a copy of the GNU General Public License\n    along with MRtrix.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n#include \"command.h\"\n#include \"progressbar.h\"\n#include \"memory.h\"\n#include \"image.h\"\n\/\/ #include \"header.h\"\n#include \"algo\/threaded_loop.h\"\n#include \"math\/math.h\"\n#include \"math\/median.h\"\n\n#include <limits>\n#include <vector>\n\n\nusing namespace MR;\nusing namespace App;\n\nconst char* operations[] = {\n  \"mean\",\n  \"median\",\n  \"sum\",\n  \"product\",\n  \"rms\",\n  \"var\",\n  \"std\",\n  \"min\",\n  \"max\",\n  \"absmax\", \/\/ Maximum of absolute values\n  \"magmax\", \/\/ Value for which the magnitude is the maximum (i.e. preserves signed-ness)\n  NULL\n};\n\nvoid usage ()\n{\n  DESCRIPTION\n    + \"compute summary statistic on image intensities either across images, \"\n    \"or along a specified axis for a single image. Supported operations are:\"\n\n    + \"mean, median, sum, product, rms (root-mean-square value), var (unbiased variance), \"\n    \"std (unbiased standard deviation), min, max, absmax (maximum absolute value), \"\n    \"magmax (value with maximum absolute value, preserving its sign).\"\n\n    + \"See also 'mrcalc' to compute per-voxel operations.\";\n\n  ARGUMENTS\n  + Argument (\"input\", \"the input image.\").type_image_in ().allow_multiple()\n  + Argument (\"operation\", \"the operation to apply, one of: \" + join(operations, \", \") + \".\").type_choice (operations)\n  + Argument (\"output\", \"the output image.\").type_image_out ();\n\n  OPTIONS\n  + Option (\"axis\", \"perform operation along a specified axis of a single input image\")\n    + Argument (\"index\").type_integer();\n\n}\n\n\ntypedef float value_type;\n\n\nclass Mean {\n  public:\n    Mean () : sum (0.0), count (0) { }\n    void operator() (value_type val) { \n      if (std::isfinite (val)) {\n        sum += val;\n        ++count;\n      }\n    }\n    value_type result () const { \n      if (!count)\n        return NAN;\n      return sum \/ count; \n    }\n    double sum;\n    size_t count;\n};\n\nclass Median {\n  public:\n    Median () { }\n    void operator() (value_type val) { \n      if (!std::isnan (val))\n        values.push_back(val);\n    }\n    value_type result () { \n      return Math::median(values);\n    }\n    std::vector<value_type> values; \n};\n\nclass Sum {\n  public:\n    Sum () : sum (0.0) { }\n    void operator() (value_type val) { \n      if (std::isfinite (val)) \n        sum += val;\n    }\n    value_type result () const { \n      return sum; \n    }\n    double sum;\n};\n\n\nclass Product {\n  public:\n    Product () : product (0.0) { }\n    void operator() (value_type val) {\n      if (std::isfinite (val))\n        product += val;\n    }\n    value_type result () const {\n      return product;\n    }\n    double product;\n};\n\n\nclass RMS {\n  public:\n    RMS() : sum (0.0), count (0) { }\n    void operator() (value_type val) {\n      if (std::isfinite (val)) {\n        sum += Math::pow2 (val);\n        ++count;\n      }\n    }\n    value_type result() const {\n      if (!count)\n        return NAN;\n      return std::sqrt(sum \/ count);\n    }\n    double sum;\n    size_t count;\n};\n\n\nclass Var {\n  public:\n    Var () : sum (0.0), sum_sqr (0.0), count (0) { }\n    void operator() (value_type val) { \n      if (std::isfinite (val)) {\n        sum += val;\n        sum_sqr += Math::pow2 (val);\n        ++count;\n      }\n    }\n    value_type result () const { \n      if (count < 2) \n        return NAN;\n      return  (sum_sqr - Math::pow2 (sum) \/ static_cast<double> (count)) \/ (static_cast<double> (count) - 1.0);\n    }\n    double sum, sum_sqr;\n    size_t count;\n};\n\n\nclass Std : public Var {\n  public:\n    Std() : Var() { }\n    value_type result () const { return std::sqrt (Var::result()); }\n};\n\n\nclass Min {\n  public:\n    Min () : min (std::numeric_limits<value_type>::infinity()) { }\n    void operator() (value_type val) { \n      if (std::isfinite (val) && val < min) \n        min = val;\n    }\n    value_type result () const { return std::isfinite (min) ? min : NAN; }\n    value_type min;\n};\n\n\nclass Max {\n  public:\n    Max () : max (-std::numeric_limits<value_type>::infinity()) { }\n    void operator() (value_type val) { \n      if (std::isfinite (val) && val > max) \n        max = val;\n    }\n    value_type result () const { return std::isfinite (max) ? max : NAN; }\n    value_type max;\n};\n\n\nclass AbsMax {\n  public:\n    AbsMax () : max (-std::numeric_limits<value_type>::infinity()) { }\n    void operator() (value_type val) { \n      if (std::isfinite (val) && std::abs(val) > max) \n        max = std::abs(val);\n    }\n    value_type result () const { return std::isfinite (max) ? max : NAN; }\n    value_type max;\n};\n\nclass MagMax {\n  public:\n    MagMax () : max (-std::numeric_limits<value_type>::infinity()) { }\n    MagMax (const int i) : max (-std::numeric_limits<value_type>::infinity()) { }\n    void operator() (value_type val) { \n      if (std::isfinite (val) && (!std::isfinite (max) || std::abs(val) > std::abs (max)))\n        max = val;\n    }\n    value_type result () const { return std::isfinite (max) ? max : NAN; }\n    value_type max;\n};\n\n\n\n\n\ntemplate <class Operation>\nclass AxisKernel {\n  public:\n    AxisKernel (size_t axis) : axis (axis) { }\n\n    template <class InputImageType, class OutputImageType>\n      void operator() (InputImageType& in, OutputImageType& out) {\n        Operation op;\n        for (in[axis] = 0; in[axis] < in.size(axis); ++in[axis])\n          op (in.value());\n        out.value() = op.result();\n      }\n  protected:\n    const size_t axis;\n};\n\n\n\n\n\nclass ImageKernelBase {\n  public:\n    ImageKernelBase (const std::string& path) :\n      output_path (path) { }\n    virtual ~ImageKernelBase() { }\n    virtual void process (const Header& image_in) = 0;\n  protected:\n    const std::string output_path;\n};\n\n\n\ntemplate <class Operation>\nclass ImageKernel : public ImageKernelBase {\n  protected:\n    class InitFunctor { \n      public: \n        template <class ImageType> \n          void operator() (ImageType& out) const { out.value() = Operation(); } \n    };\n    class ProcessFunctor { \n      public: \n        template <class ImageType1, class ImageType2>\n          void operator() (ImageType1& out, ImageType2& in) const { \n            Operation op = out.value(); \n            op (in.value()); \n            out.value() = op;\n          } \n    };\n    class ResultFunctor {\n      public: \n        template <class ImageType1, class ImageType2>\n          void operator() (ImageType1& out, ImageType2& in) const {\n            Operation op = in.value(); \n            out.value() = op.result(); \n          } \n    };\n\n  public:\n    ImageKernel (const Header& header, const std::string& path) :\n      ImageKernelBase (path),\n      header (header),\n      image (header) {\n        ThreadedLoop (image).run (InitFunctor(), image);\n      }\n\n    ~ImageKernel()\n    {\n      Image<value_type> out (output_path, header);\n      ThreadedLoop (image).run (ResultFunctor(), out, image);\n    }\n\n    void process (const Header& image_in)\n    {\n      Image<value_type> in (image_in);\n      ThreadedLoop (image).run (ProcessFunctor(), image, in);\n    }\n\n  protected:\n    const Header& header;\n    Image<Operation> image;\n\n};\n\n\n\n\nvoid run ()\n{\n  const size_t num_inputs = argument.size() - 2;\n  const int op = argument[num_inputs];\n  const std::string& output_path = argument.back();\n\n  Options opt = get_options (\"axis\");\n  if (opt.size()) {\n\n    if (num_inputs != 1)\n      throw Exception (\"Option -axis only applies if a single input image is used\");\n\n    const size_t axis = opt[0][0];\n\n    auto image_in = Header::open (argument[0]).get_image<value_type>().with_direct_io (Stride::contiguous_along_axis (axis));\n\n    if (axis >= image_in.ndim())\n      throw Exception (\"Cannot perform operation along axis \" + str (axis) + \"; image only has \" + str(image_in.ndim()) + \" axes\");\n\n\n    Header header_out (image_in.header());\n\n    header_out.datatype() = DataType::Float32;\n    header_out.size(axis) = 1;\n    squeeze_dim (header_out);\n\n    auto image_out = Header::create (output_path, header_out).get_image<float>();\n    \/\/ auto image_out = Header::allocate (header_out).get_image<float>();\n    \/\/ Image image_out (output_path, header_out);\n\n    ThreadedLoop loop (std::string(\"computing \") + operations[op] + \" along axis \" + str(axis) + \"...\", image_out);\n\n    switch (op) {\n      case 0: loop.run  (AxisKernel<Mean>   (axis), image_in, image_out); return;\n      case 1: loop.run  (AxisKernel<Median> (axis), image_in, image_out); return;\n      case 2: loop.run  (AxisKernel<Sum>    (axis), image_in, image_out); return;\n      case 3: loop.run  (AxisKernel<Product>(axis), image_in, image_out); return;\n      case 4: loop.run  (AxisKernel<RMS>    (axis), image_in, image_out); return;\n      case 5: loop.run  (AxisKernel<Var>    (axis), image_in, image_out); return;\n      case 6: loop.run  (AxisKernel<Std>    (axis), image_in, image_out); return;\n      case 7: loop.run  (AxisKernel<Min>    (axis), image_in, image_out); return;\n      case 8: loop.run  (AxisKernel<Max>    (axis), image_in, image_out); return;\n      case 9: loop.run  (AxisKernel<AbsMax> (axis), image_in, image_out); return;\n      case 10: loop.run (AxisKernel<MagMax> (axis), image_in, image_out); return;\n      default: assert (0);\n    }\n\n  } else {\n\n    if (num_inputs < 2)\n      throw Exception (\"mrmath requires either multiple input images, or the -axis option to be provided\");\n\n    \/\/ Pre-load all image headers\n    std::vector<std::unique_ptr<Header>> headers_in;\n\n    \/\/ Header of first input image is the template to which all other input images are compared\n    \/\/ auto header = Header::open (argument[0]);\n    headers_in.push_back (std::unique_ptr<Header> (new Header::open (argument[0])));\n    Header header (*headers_in[0]);\n\n    \/\/ Wipe any excess unary-dimensional axes\n    while (header.dim (header.ndim() - 1) == 1)\n      header.set_ndim (header.ndim() - 1);\n\n    \/\/ Verify that dimensions of all input images adequately match\n    for (size_t i = 1; i != num_inputs; ++i) {\n      const std::string path = argument[i];\n      headers_in.push_back (std::unique_ptr<Header> (new Header::open (path)));\n      const Header& temp (*headers_in[i]);\n      if (temp.ndim() < header.ndim())\n        throw Exception (\"Image \" + path + \" has fewer axes than first imput image \" + header.name());\n      for (size_t axis = 0; axis != header.ndim(); ++axis) {\n        if (temp.dim(axis) != header.dim(axis))\n          throw Exception (\"Dimensions of image \" + path + \" do not match those of first input image \" + header.name());\n      }\n      for (size_t axis = header.ndim(); axis != temp.ndim(); ++axis) {\n        if (temp.dim(axis) != 1)\n          throw Exception (\"Image \" + path + \" has axis with non-unary dimension beyond first input image \" + header.name());\n      }\n    }\n\n    \/\/ Instantiate a kernel depending on the operation requested\n    std::unique_ptr<ImageKernelBase> kernel;\n    switch (op) {\n      case 0:  kernel.reset (new ImageKernel<Mean>    (header, output_path)); break;\n      case 1:  kernel.reset (new ImageKernel<Median>  (header, output_path)); break;\n      case 2:  kernel.reset (new ImageKernel<Sum>     (header, output_path)); break;\n      case 3:  kernel.reset (new ImageKernel<Product> (header, output_path)); break;\n      case 4:  kernel.reset (new ImageKernel<RMS>     (header, output_path)); break;\n      case 5:  kernel.reset (new ImageKernel<Var>     (header, output_path)); break;\n      case 6:  kernel.reset (new ImageKernel<Std>     (header, output_path)); break;\n      case 7:  kernel.reset (new ImageKernel<Min>     (header, output_path)); break;\n      case 8:  kernel.reset (new ImageKernel<Max>     (header, output_path)); break;\n      case 9:  kernel.reset (new ImageKernel<AbsMax>  (header, output_path)); break;\n      case 10: kernel.reset (new ImageKernel<MagMax>  (header, output_path)); break;\n      default: assert (0);\n    }\n\n    \/\/ Feed the input images to the kernel one at a time\n    {\n      ProgressBar progress (std::string(\"computing \") + operations[op] + \" across \" \n          + str(headers_in.size()) + \" images...\", num_inputs);\n      for (size_t i = 0; i != headers_in.size(); ++i) {\n        kernel->process (*headers_in[i]);\n        ++progress;\n      }\n    }\n\n    \/\/ Image output is handled by the kernel destructor\n\n  }\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/** \\file    add_synonyms.cc\n *  \\brief   Generic version for augmenting title data with synonyms found\n             in the authority data\n *  \\author  Johannes Riedl\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\/*  We offer a list of tags and subfields where the primary data resides along\n    with a list of tags and subfields where the synonym data is found and\n    a list of unused fields in the title data where the synonyms can be stored \n*\/\n\n#include <iostream>\n#include <map>\n#include <vector>\n#include <cstdlib>\n#include \"Compiler.h\"\n#include \"FileUtil.h\"\n#include \"MarcReader.h\"\n#include \"MarcRecord.h\"\n#include \"MarcWriter.h\"\n#include \"MediaTypeUtil.h\"\n#include \"RegexMatcher.h\"\n#include \"StringUtil.h\"\n#include \"Subfields.h\"\n#include \"util.h\"\n\n\nstatic unsigned modified_count(0);\nstatic unsigned record_count(0);\n\n\nvoid Usage() {\n    std::cerr << \"Usage: \" << ::progname << \" master_marc_input norm_data_marc_input marc_output\\n\";\n    std::exit(EXIT_FAILURE);\n}\n\n\nstd::string GetTag(const std::string &tag_and_subfields_spec) {\n    return tag_and_subfields_spec.substr(0, 3);\n}\n\n\nstd::string GetSubfieldCodes(const std::string &tag_and_subfields_spec) {\n    return tag_and_subfields_spec.substr(3);\n}\n\n\nbool FilterPasses(const MarcRecord &record, const std::map<std::string, std::pair<std::string, std::string>> &filter_specs, const std::string &field_spec) {\n      auto filter_spec(filter_specs.find(field_spec));\n      if (filter_spec == filter_specs.cend())\n          return true;\n\n      auto rule(filter_spec->second);\n      \/\/ We have field_spec in key and rule to match in value\n      std::string subfield_codes(GetSubfieldCodes(rule.first));\n      if (subfield_codes.length() != 1)\n         Error(\"Invalid subfield specification \"  + subfield_codes + \" for filter\");\n\n      std::string subfield_value;\n      if ((subfield_value = record.extractFirstSubfield(GetTag(rule.first), subfield_codes.c_str()[0])).empty())\n          return false;\n\n      return subfield_value == rule.second;\n}\n\n\nvoid ExtractSynonyms(MarcReader * const authority_reader,\n                     const std::set<std::string> &primary_tags_and_subfield_codes,\n                     const std::set<std::string> &synonym_tags_and_subfield_codes,\n                     std::vector<std::map<std::string, std::string>> * const synonym_maps,\n                     const std::map<std::string, std::pair<std::string, std::string>> &filter_spec)\n{\n    while (const MarcRecord record = authority_reader->read()) {\n        std::set<std::string>::const_iterator primary;\n        std::set<std::string>::const_iterator synonym;\n        unsigned int i(0);\n        for (primary = primary_tags_and_subfield_codes.begin(), synonym = synonym_tags_and_subfield_codes.begin();  \n            primary != primary_tags_and_subfield_codes.end();\n            ++primary, ++synonym, ++i) \n        {\n            \/\/ Fill maps with synonyms\n            std::vector<std::string> primary_values; \n            std::vector<std::string> synonym_values;              \n\n            if (FilterPasses(record, filter_spec, *primary) and\n                record.extractSubfields(GetTag(*primary), GetSubfieldCodes(*primary), &primary_values) and \n                record.extractSubfields(GetTag(*synonym), GetSubfieldCodes(*synonym), &synonym_values)) \n                    (*synonym_maps)[i].emplace(StringUtil::Join(primary_values, ','),\n                                               StringUtil::Join(synonym_values, ','));\n        }\n    }\n}\n\n\ninline std::string GetMapValueOrEmptyString(const std::map<std::string, std::string> &map,\n                                            const std::string &searchterm)\n{\n    auto value(map.find(searchterm));\n    return (value != map.cend()) ? value->second : \"\";\n}\n\n\nvoid ProcessRecord(MarcRecord * const record, const std::vector<std::map<std::string, std::string>> &synonym_maps,\n                   const std::set<std::string> &primary_tags_and_subfield_codes,\n                   const std::set<std::string> &output_tags_and_subfield_codes) \n{\n    std::set<std::string>::const_iterator primary;\n    std::set<std::string>::const_iterator output;\n    unsigned int i(0);\n\n    if (primary_tags_and_subfield_codes.size() == output_tags_and_subfield_codes.size()) {\n        for (primary = primary_tags_and_subfield_codes.begin(), output = output_tags_and_subfield_codes.begin();\n            primary != primary_tags_and_subfield_codes.end();\n            ++primary, ++output, ++i) \n        {\n            std::vector<std::string> primary_values;\n            std::set<std::string> synonym_values;\n            std::vector<size_t> field_indices;\n            if (record->getFieldIndices(GetTag(*primary), &field_indices) != MarcRecord::FIELD_NOT_FOUND) {\n                for (auto field_index : field_indices) {\n                     primary_values.clear();\n                     if (record->getSubfields(field_index).extractSubfields(GetSubfieldCodes(*primary), &primary_values)) {\n                        std::string searchterm = StringUtil::Join(primary_values, ',');\n                        \/\/ First case: Look up synonyms only in one category\n                        if (i < synonym_maps.size()) {\n                            const auto &synonym_map(synonym_maps[i]);\n                            const auto &synonym(GetMapValueOrEmptyString(synonym_map, searchterm));\n                            if (not synonym.empty())\n                                synonym_values.insert(synonym);\n                        }\n                       \n                        \/\/ Second case: Look up synonyms in all categories\n                        else {\n                            for (auto &synonym_map : synonym_maps) {\n                                const auto &synonym(GetMapValueOrEmptyString(synonym_map, searchterm));\n                                if (not synonym.empty())\n                                   synonym_values.insert(synonym);\n                            }\n                        }\n                    }\n                 }\n\n                if (synonym_values.empty())\n                     continue;\n                \n                const std::string synonyms(StringUtil::Join(synonym_values, ','));\n \n                \/\/ Insert synonyms\n                \/\/ Abort if field is already populated\n                std::string tag(GetTag(*output));\n                if (record->getFieldIndex(tag) != MarcRecord::FIELD_NOT_FOUND)\n                    Error(\"Field with tag \" + tag + \" is not empty for PPN \" + record->getControlNumber() + '\\n');\n                std::string subfield_spec = GetSubfieldCodes(*output);\n                if (subfield_spec.size() != 1)\n                    Error(\"We currently only support a single subfield and thus specifying \" + subfield_spec\n                          + \" as output subfield is not valid\\n\");\n                Subfields subfields(' ', ' '); \/\/ <- indicators must be set explicitly although empty\n                subfields.addSubfield(subfield_spec.at(0), synonyms);\n                if (not(record->insertField(tag, subfields.toString())))\n                    Warning(\"Could not insert field \" + tag + \" for PPN \" + record->getControlNumber() + '\\n');\n                ++modified_count;\n            }   \n        }\n    }\n}   \n\n\nvoid InsertSynonyms(MarcReader * const marc_reader, MarcWriter * const marc_writer,\n                    const std::set<std::string> &primary_tags_and_subfield_codes,\n                    const std::set<std::string> &output_tags_and_subfield_codes,\n                    std::vector<std::map<std::string, std::string>> &synonym_maps) \n{\n    while (MarcRecord record = marc_reader->read()) {\n        ProcessRecord(&record, synonym_maps, primary_tags_and_subfield_codes, output_tags_and_subfield_codes);\n        marc_writer->write(record);\n        ++record_count;\n    }\n\n    std::cerr << \"Modified \" << modified_count << \" of \" << record_count << \" record(s).\\n\";\n}\n\n\nint ParseSpec(std::string spec_str, std::set<std::string> * const field_specs, std::map<std::string, std::pair<std::string, std::string>> * filter_specs = nullptr) {\n    std::set<std::string> raw_field_specs;\n\n    if (unlikely(StringUtil::Split(spec_str, \":\", &raw_field_specs) < 1)){\n        Error(\"Need at least one field\");\n        return -1;\n    }\n\n    if (filter_specs == nullptr) {\n        *field_specs = raw_field_specs;\n\treturn 0;\n    }\n\n    \/\/ Iterate over all Field-specs and extract possible filters\n    static RegexMatcher * const matcher(RegexMatcher::RegexMatcherFactory(\"(\\\\d{1,3}[a-z]+)\\\\[(\\\\d{1,3}[a-z])=(.*)\\\\]\"));\n\n    for (auto field_spec : raw_field_specs) {\n        if (matcher->matched(field_spec)) {\n            filter_specs->emplace((*matcher)[1], std::make_pair((*matcher)[2], (*matcher)[3]));  \n            auto bracket = field_spec.find(\"[\");\n            field_spec = (bracket != std::string::npos) ? field_spec.erase(bracket, field_spec.length()) : field_spec;\n        }\n        field_specs->insert(field_spec);\n    }\n    return 0;\n}\n\n\nint main(int argc, char **argv) {\n    ::progname = argv[0];\n\n    if (argc != 4)\n        Usage();\n\n    const std::string marc_input_filename(argv[1]);\n    const std::string authority_data_marc_input_filename(argv[2]);\n    const std::string marc_output_filename(argv[3]);\n    if (unlikely(marc_input_filename == marc_output_filename))\n        Error(\"Title data input file name equals output file name!\");\n    if (unlikely(authority_data_marc_input_filename == marc_output_filename))\n        Error(\"Authority data input file name equals output file name!\");\n\n\n    std::unique_ptr<MarcReader> marc_reader(MarcReader::Factory(marc_input_filename, MarcReader::BINARY));\n    std::unique_ptr<MarcReader> authority_reader(MarcReader::Factory(authority_data_marc_input_filename,\n                                                                     MarcReader::BINARY));\n    std::unique_ptr<MarcWriter> marc_writer(MarcWriter::Factory(marc_output_filename, MarcWriter::BINARY));\n\n    try {\n        \/\/ Determine possible mappings\n        \/\/ Values in square brackets specify a positive criterion for values to be taken into account\n        const std::string AUTHORITY_DATA_PRIMARY_SPEC(\"100abcd[079v=piz]:110abcd:111abcd:130abcd:150abcd:151abcd\");\n        const std::string AUTHORITY_DATA_SYNONYM_SPEC(\"400abcd:410abcd:411abcd:430abcd:450abcd:451abcd\");\n        const std::string TITLE_DATA_PRIMARY_SPEC(\"600abcd:610abcd:611abcd:630abcd:650abcd:651abcd:689abcd\");\n        const std::string TITLE_DATA_UNUSED_FIELDS_FOR_SYNONYMS(\"180a:181a:182a:183a:184a:185a:186a\");\n\n        \/\/ Determine fields to handle\n        std::set<std::string> primary_tags_and_subfield_codes;\n        std::set<std::string> synonym_tags_and_subfield_codes;\n        std::set<std::string> input_tags_and_subfield_codes;\n        std::set<std::string> output_tags_and_subfield_codes;\n\n        std::map<std::string, std::pair<std::string, std::string>> filter_specs;\n\n        if (unlikely(ParseSpec(AUTHORITY_DATA_PRIMARY_SPEC, &primary_tags_and_subfield_codes, &filter_specs) < 0))\n            Error(\"Could not properly parse \" + AUTHORITY_DATA_PRIMARY_SPEC);\n\n        if (unlikely(StringUtil::Split(AUTHORITY_DATA_SYNONYM_SPEC, \":\", &synonym_tags_and_subfield_codes) < 1))\n            Error(\"Need at least one synonym field\");\n\n        if (unlikely(StringUtil::Split(TITLE_DATA_PRIMARY_SPEC, \":\", &input_tags_and_subfield_codes) < 1))\n            Error(\"Need at least one input field\");\n\n        if (unlikely(StringUtil::Split(TITLE_DATA_UNUSED_FIELDS_FOR_SYNONYMS, \":\", &output_tags_and_subfield_codes)\n                     < 1))\n            Error(\"Need at least one output field\");\n\n        unsigned num_of_authority_entries(primary_tags_and_subfield_codes.size());\n\n        if (synonym_tags_and_subfield_codes.size() != num_of_authority_entries)\n            Error(\"Number of authority primary specs must match number of synonym specs\");\n        if (input_tags_and_subfield_codes.size() != output_tags_and_subfield_codes.size())\n            Error(\"Number of fields title entry specs must match number of output specs\");\n             \n        std::vector<std::map<std::string, std::string>> synonym_maps(num_of_authority_entries,\n                                                                     std::map<std::string, std::string>());\n        \n        \/\/ Extract the synonyms from authority data\n        ExtractSynonyms(authority_reader.get(), primary_tags_and_subfield_codes, synonym_tags_and_subfield_codes,\n                        &synonym_maps, filter_specs);\n\n        \/\/ Iterate over the title data\n        InsertSynonyms(marc_reader.get(), marc_writer.get(), input_tags_and_subfield_codes,\n                       output_tags_and_subfield_codes, synonym_maps);\n\n    } catch (const std::exception &x) {\n        Error(\"caught exception: \" + std::string(x.what()));\n    }\n}\n<commit_msg>Required changes<commit_after>\/** \\file    add_synonyms.cc\n *  \\brief   Generic version for augmenting title data with synonyms found\n             in the authority data\n *  \\author  Johannes Riedl\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\/*  We offer a list of tags and subfields where the primary data resides along\n    with a list of tags and subfields where the synonym data is found and\n    a list of unused fields in the title data where the synonyms can be stored \n*\/\n\n#include <iostream>\n#include <map>\n#include <vector>\n#include <cstdlib>\n#include \"Compiler.h\"\n#include \"FileUtil.h\"\n#include \"MarcReader.h\"\n#include \"MarcRecord.h\"\n#include \"MarcWriter.h\"\n#include \"MediaTypeUtil.h\"\n#include \"RegexMatcher.h\"\n#include \"StringUtil.h\"\n#include \"Subfields.h\"\n#include \"util.h\"\n\n\nstatic unsigned modified_count(0);\nstatic unsigned record_count(0);\n\n\nvoid Usage() {\n    std::cerr << \"Usage: \" << ::progname << \" master_marc_input norm_data_marc_input marc_output\\n\";\n    std::exit(EXIT_FAILURE);\n}\n\n\nstd::string GetTag(const std::string &tag_and_subfields_spec) {\n    return tag_and_subfields_spec.substr(0, 3);\n}\n\n\nstd::string GetSubfieldCodes(const std::string &tag_and_subfields_spec) {\n    return tag_and_subfields_spec.substr(3);\n}\n\n\nbool FilterPasses(const MarcRecord &record, const std::map<std::string, std::pair<std::string, std::string>> &filter_specs, const std::string &field_spec) {\n      auto filter_spec(filter_specs.find(field_spec));\n      if (filter_spec == filter_specs.cend())\n          return true;\n\n      auto rule(filter_spec->second);\n      \/\/ We have field_spec in key and rule to match in value\n      std::string subfield_codes(GetSubfieldCodes(rule.first));\n      if (subfield_codes.length() != 1)\n         Error(\"Invalid subfield specification \"  + subfield_codes + \" for filter\");\n\n      std::string subfield_value;\n      if ((subfield_value = record.extractFirstSubfield(GetTag(rule.first), subfield_codes.c_str()[0])).empty())\n          return false;\n\n      return subfield_value == rule.second;\n}\n\n\nvoid ExtractSynonyms(MarcReader * const authority_reader,\n                     const std::set<std::string> &primary_tags_and_subfield_codes,\n                     const std::set<std::string> &synonym_tags_and_subfield_codes,\n                     std::vector<std::map<std::string, std::string>> * const synonym_maps,\n                     const std::map<std::string, std::pair<std::string, std::string>> &filter_spec)\n{\n    while (const MarcRecord record = authority_reader->read()) {\n        std::set<std::string>::const_iterator primary;\n        std::set<std::string>::const_iterator synonym;\n        unsigned int i(0);\n        for (primary = primary_tags_and_subfield_codes.begin(), synonym = synonym_tags_and_subfield_codes.begin();  \n            primary != primary_tags_and_subfield_codes.end();\n            ++primary, ++synonym, ++i) \n        {\n            \/\/ Fill maps with synonyms\n            std::vector<std::string> primary_values; \n            std::vector<std::string> synonym_values;              \n\n            if (FilterPasses(record, filter_spec, *primary) and\n                record.extractSubfields(GetTag(*primary), GetSubfieldCodes(*primary), &primary_values) and \n                record.extractSubfields(GetTag(*synonym), GetSubfieldCodes(*synonym), &synonym_values)) \n                    (*synonym_maps)[i].emplace(StringUtil::Join(primary_values, ','),\n                                               StringUtil::Join(synonym_values, ','));\n        }\n    }\n}\n\n\ninline std::string GetMapValueOrEmptyString(const std::map<std::string, std::string> &map,\n                                            const std::string &searchterm)\n{\n    auto value(map.find(searchterm));\n    return (value != map.cend()) ? value->second : \"\";\n}\n\n\nvoid ProcessRecord(MarcRecord * const record, const std::vector<std::map<std::string, std::string>> &synonym_maps,\n                   const std::set<std::string> &primary_tags_and_subfield_codes,\n                   const std::set<std::string> &output_tags_and_subfield_codes) \n{\n    std::set<std::string>::const_iterator primary;\n    std::set<std::string>::const_iterator output;\n    unsigned int i(0);\n\n    if (primary_tags_and_subfield_codes.size() == output_tags_and_subfield_codes.size()) {\n        for (primary = primary_tags_and_subfield_codes.begin(), output = output_tags_and_subfield_codes.begin();\n            primary != primary_tags_and_subfield_codes.end();\n            ++primary, ++output, ++i) \n        {\n            std::vector<std::string> primary_values;\n            std::set<std::string> synonym_values;\n            std::vector<size_t> field_indices;\n            if (record->getFieldIndices(GetTag(*primary), &field_indices) != MarcRecord::FIELD_NOT_FOUND) {\n                for (auto field_index : field_indices) {\n                     primary_values.clear();\n                     if (record->getSubfields(field_index).extractSubfields(GetSubfieldCodes(*primary), &primary_values)) {\n                        std::string searchterm = StringUtil::Join(primary_values, ',');\n                        \/\/ First case: Look up synonyms only in one category\n                        if (i < synonym_maps.size()) {\n                            const auto &synonym_map(synonym_maps[i]);\n                            const auto &synonym(GetMapValueOrEmptyString(synonym_map, searchterm));\n                            if (not synonym.empty())\n                                synonym_values.insert(synonym);\n                        }\n                       \n                        \/\/ Second case: Look up synonyms in all categories\n                        else {\n                            for (auto &synonym_map : synonym_maps) {\n                                const auto &synonym(GetMapValueOrEmptyString(synonym_map, searchterm));\n                                if (not synonym.empty())\n                                   synonym_values.insert(synonym);\n                            }\n                        }\n                    }\n                 }\n\n                if (synonym_values.empty())\n                     continue;\n                \n                const std::string synonyms(StringUtil::Join(synonym_values, ','));\n \n                \/\/ Insert synonyms\n                \/\/ Abort if field is already populated\n                std::string tag(GetTag(*output));\n                if (record->getFieldIndex(tag) != MarcRecord::FIELD_NOT_FOUND)\n                    Error(\"Field with tag \" + tag + \" is not empty for PPN \" + record->getControlNumber() + '\\n');\n                std::string subfield_spec = GetSubfieldCodes(*output);\n                if (subfield_spec.size() != 1)\n                    Error(\"We currently only support a single subfield and thus specifying \" + subfield_spec\n                          + \" as output subfield is not valid\\n\");\n                Subfields subfields(' ', ' '); \/\/ <- indicators must be set explicitly although empty\n                subfields.addSubfield(subfield_spec.at(0), synonyms);\n                if (not(record->insertField(tag, subfields.toString())))\n                    Warning(\"Could not insert field \" + tag + \" for PPN \" + record->getControlNumber() + '\\n');\n                ++modified_count;\n            }   \n        }\n    }\n}   \n\n\nvoid InsertSynonyms(MarcReader * const marc_reader, MarcWriter * const marc_writer,\n                    const std::set<std::string> &primary_tags_and_subfield_codes,\n                    const std::set<std::string> &output_tags_and_subfield_codes,\n                    std::vector<std::map<std::string, std::string>> &synonym_maps) \n{\n    while (MarcRecord record = marc_reader->read()) {\n        ProcessRecord(&record, synonym_maps, primary_tags_and_subfield_codes, output_tags_and_subfield_codes);\n        marc_writer->write(record);\n        ++record_count;\n    }\n\n    std::cerr << \"Modified \" << modified_count << \" of \" << record_count << \" record(s).\\n\";\n}\n\n\nint ParseSpec(std::string spec_str, std::set<std::string> * const field_specs, std::map<std::string, std::pair<std::string, std::string>> * filter_specs = nullptr) {\n    std::set<std::string> raw_field_specs;\n\n    if (unlikely(StringUtil::Split(spec_str, ':', &raw_field_specs) < 1)) {\n        Error(\"Need at least one field\");\n        return -1;\n    }\n\n    if (filter_specs == nullptr) {\n        *field_specs = raw_field_specs;\n\treturn 0;\n    }\n\n    \/\/ Iterate over all Field-specs and extract possible filters\n    static RegexMatcher * const matcher(RegexMatcher::RegexMatcherFactory(\"(\\\\d{1,3}[a-z]+)\\\\[(\\\\d{1,3}[a-z])=(.*)\\\\]\"));\n\n    for (auto field_spec : raw_field_specs) {\n        if (matcher->matched(field_spec)) {\n            filter_specs->emplace((*matcher)[1], std::make_pair((*matcher)[2], (*matcher)[3]));  \n            auto bracket = field_spec.find(\"[\");\n            field_spec = (bracket != std::string::npos) ? field_spec.erase(bracket, field_spec.length()) : field_spec;\n        }\n        field_specs->insert(field_spec);\n    }\n    return 0;\n}\n\n\nint main(int argc, char **argv) {\n    ::progname = argv[0];\n\n    if (argc != 4)\n        Usage();\n\n    const std::string marc_input_filename(argv[1]);\n    const std::string authority_data_marc_input_filename(argv[2]);\n    const std::string marc_output_filename(argv[3]);\n    if (unlikely(marc_input_filename == marc_output_filename))\n        Error(\"Title data input file name equals output file name!\");\n    if (unlikely(authority_data_marc_input_filename == marc_output_filename))\n        Error(\"Authority data input file name equals output file name!\");\n\n\n    std::unique_ptr<MarcReader> marc_reader(MarcReader::Factory(marc_input_filename, MarcReader::BINARY));\n    std::unique_ptr<MarcReader> authority_reader(MarcReader::Factory(authority_data_marc_input_filename,\n                                                                     MarcReader::BINARY));\n    std::unique_ptr<MarcWriter> marc_writer(MarcWriter::Factory(marc_output_filename, MarcWriter::BINARY));\n\n    try {\n        \/\/ Determine possible mappings\n        \/\/ Values in square brackets specify a positive criterion for values to be taken into account\n        const std::string AUTHORITY_DATA_PRIMARY_SPEC(\"100abcd[079v=piz]:110abcd:111abcd:130abcd:150abcd:151abcd\");\n        const std::string AUTHORITY_DATA_SYNONYM_SPEC(\"400abcd:410abcd:411abcd:430abcd:450abcd:451abcd\");\n        const std::string TITLE_DATA_PRIMARY_SPEC(\"600abcd:610abcd:611abcd:630abcd:650abcd:651abcd:689abcd\");\n        const std::string TITLE_DATA_UNUSED_FIELDS_FOR_SYNONYMS(\"180a:181a:182a:183a:184a:185a:186a\");\n\n        \/\/ Determine fields to handle\n        std::set<std::string> primary_tags_and_subfield_codes;\n        std::set<std::string> synonym_tags_and_subfield_codes;\n        std::set<std::string> input_tags_and_subfield_codes;\n        std::set<std::string> output_tags_and_subfield_codes;\n\n        std::map<std::string, std::pair<std::string, std::string>> filter_specs;\n\n        if (unlikely(ParseSpec(AUTHORITY_DATA_PRIMARY_SPEC, &primary_tags_and_subfield_codes, &filter_specs) < 0))\n            Error(\"Could not properly parse \" + AUTHORITY_DATA_PRIMARY_SPEC);\n\n        if (unlikely(StringUtil::Split(AUTHORITY_DATA_SYNONYM_SPEC, \":\", &synonym_tags_and_subfield_codes) == 0))\n            Error(\"Need at least one synonym field\");\n\n        if (unlikely(StringUtil::Split(TITLE_DATA_PRIMARY_SPEC, \":\", &input_tags_and_subfield_codes) == 0))\n            Error(\"Need at least one input field\");\n\n        if (unlikely(StringUtil::Split(TITLE_DATA_UNUSED_FIELDS_FOR_SYNONYMS, \":\", &output_tags_and_subfield_codes)\n                     == 0))\n            Error(\"Need at least one output field\");\n\n        unsigned num_of_authority_entries(primary_tags_and_subfield_codes.size());\n\n        if (synonym_tags_and_subfield_codes.size() != num_of_authority_entries)\n            Error(\"Number of authority primary specs must match number of synonym specs\");\n        if (input_tags_and_subfield_codes.size() != output_tags_and_subfield_codes.size())\n            Error(\"Number of fields title entry specs must match number of output specs\");\n             \n        std::vector<std::map<std::string, std::string>> synonym_maps(num_of_authority_entries,\n                                                                     std::map<std::string, std::string>());\n        \n        \/\/ Extract the synonyms from authority data\n        ExtractSynonyms(authority_reader.get(), primary_tags_and_subfield_codes, synonym_tags_and_subfield_codes,\n                        &synonym_maps, filter_specs);\n\n        \/\/ Iterate over the title data\n        InsertSynonyms(marc_reader.get(), marc_writer.get(), input_tags_and_subfield_codes,\n                       output_tags_and_subfield_codes, synonym_maps);\n\n    } catch (const std::exception &x) {\n        Error(\"caught exception: \" + std::string(x.what()));\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"tangram.h\"\n\n#include <memory>\n#include <utility>\n#include <cmath>\n#include <set>\n\n#include \"platform.h\"\n#include \"tile\/tileManager.h\"\n#include \"view\/view.h\"\n#include \"data\/geoJsonSource.h\"\n#include \"data\/protobufSource.h\"\n\n#include \"style\/polygonStyle.h\"\n#include \"style\/polylineStyle.h\"\n#include \"style\/textStyle.h\"\n#include \"style\/debugTextStyle.h\"\n#include \"style\/debugStyle.h\"\n#include \"style\/spriteStyle.h\"\n#include \"scene\/scene.h\"\n#include \"scene\/lights.h\"\n#include \"util\/error.h\"\n#include \"stl_util.hpp\"\n\nnamespace Tangram {\n\n    std::unique_ptr<TileManager> m_tileManager;\n    std::shared_ptr<Scene> m_scene;\n    std::shared_ptr<View> m_view;\n    std::shared_ptr<LabelContainer> m_labelContainer;\n    std::shared_ptr<FontContext> m_ftContext;\n    std::shared_ptr<DebugStyle> m_debugStyle;\n\n    static float g_time = 0.0;\n    static unsigned long g_flags = 0;\n\n    void initialize() {\n        \n        logMsg(\"initialize\\n\");\n\n        \/\/ Create view\n        if (!m_view) {\n            m_view = std::make_shared<View>();\n            \n            \/\/ Move the view to coordinates in Manhattan so we have something interesting to test\n            glm::dvec2 target = m_view->getMapProjection().LonLatToMeters(glm::dvec2(-74.00796, 40.70361));\n            m_view->setPosition(target.x, target.y);\n        }\n\n        \/\/ Create a scene object\n        if (!m_scene) {\n            m_scene = std::make_shared<Scene>();\n            \n            \/\/ Load style(s); hard-coded for now\n            std::unique_ptr<Style> polyStyle(new PolygonStyle(\"Polygon\"));\n            polyStyle->setLighting(LightingType::vertex);\n            polyStyle->addLayers({\n                \"buildings\",\n                \"water\",\n                \"earth\",\n                \"landuse\"\n            });\n            m_scene->addStyle(std::move(polyStyle));\n            \n            std::unique_ptr<Style> linesStyle(new PolylineStyle(\"Polyline\"));\n            linesStyle->addLayers({\"roads\"});\n            m_scene->addStyle(std::move(linesStyle));\n\n            m_ftContext = std::make_shared<FontContext>();\n            m_ftContext->addFont(\"FiraSans-Medium.ttf\", \"FiraSans\");\n            m_ftContext->addFont(\"FuturaStd-Condensed.ttf\", \"Futura\");\n            m_labelContainer = LabelContainer::GetInstance();\n            m_labelContainer->setFontContext(m_ftContext);\n\n            std::unique_ptr<Style> textStyle0(new TextStyle(\"FiraSans\", \"Textstyle0\", 15.0f, 0xF7F0E1, true, true));\n            textStyle0->addLayers({\n                \"roads\",\n                \"places\",\n                \"pois\"\n            });\n            m_scene->addStyle(std::move(textStyle0));\n            std::unique_ptr<Style> textStyle1(new TextStyle(\"Futura\", \"Textstyle1\", 18.0f, 0x26241F, true, true));\n            textStyle1->addLayers({\n                \"landuse\",\n            });\n            m_scene->addStyle(std::move(textStyle1));\n            \n            std::unique_ptr<Style> debugTextStyle(new DebugTextStyle(\"FiraSans\", \"DebugTextStyle\", 30.0f, 0xDC3522, true));\n            m_scene->addStyle(std::move(debugTextStyle));\n\n            std::unique_ptr<DebugStyle> debugStyle(new DebugStyle(\"Debug\"));\n            m_scene->addStyle(std::move(debugStyle));\n\n            \/\/ Directional light with white diffuse color pointing Northeast and down\n             \n            std::unique_ptr<DirectionalLight> directionalLight(new DirectionalLight(\"dLight\"));\n            directionalLight->setAmbientColor({0.3, 0.3, 0.3, 1.0});\n            directionalLight->setDiffuseColor({0.7, 0.7, 0.7, 1.0});\n            directionalLight->setDirection({1.0, 1.0, -1.0});\n            m_scene->addLight(std::move(directionalLight));\n\n            \/\/  Directional light with white diffuse color pointing Northeast and down\n            \n            \/*std::unique_ptr<PointLight> pointLight(new PointLight(\"pLight\"));\n            pointLight->setAmbientColor({0.2, 0.2, 0.2, 1.0});\n            pointLight->setDiffuseColor({0.7, 0.7, 0.7, 1.0});\n            pointLight->setPosition({0.0, 0.0, -100.0});\n            pointLight->setRadius(200);\n            m_scene->addLight(std::move(pointLight));*\/\n\n            \/\/ Testing loading image\n\t\t\t\/\/ std::unique_ptr<Style> spriteStyle(new SpriteStyle(\"Sprite\"));\n            \/\/ m_scene->addStyle(std::move(spriteStyle));\n        }\n\n        \/\/ Create a tileManager\n        if (!m_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            m_tileManager->setScene(m_scene);\n            \n            \/\/ Add a tile data source\n            \/\/ json tile source\n            \/\/ std::unique_ptr<DataSource> dataSource(new GeoJsonTile());\n            \/\/ protobuf tile source\n            std::unique_ptr<DataSource> dataSource(new ProtobufSource());\n            m_tileManager->addDataSource(std::move(dataSource));\n        }\n\n        \/\/ Set up openGL state\n        glDisable(GL_BLEND);\n        glDisable(GL_STENCIL_TEST);\n        glEnable(GL_DEPTH_TEST);\n        glClearDepthf(1.0);\n        glDepthRangef(0.0, 1.0);\n        glDepthMask(GL_TRUE);\n        glDepthFunc(GL_LEQUAL);\n        glEnable(GL_CULL_FACE);\n        glFrontFace(GL_CCW);\n        glCullFace(GL_BACK);\n        glClearColor(0.3f, 0.3f, 0.3f, 1.0f);\n\n        while (Error::hadGlError(\"Tangram::initialize()\")) {}\n\n        logMsg(\"finish initialize\\n\");\n\n    }\n\n    void resize(int _newWidth, int _newHeight) {\n        \n        logMsg(\"resize: %d x %d\\n\", _newWidth, _newHeight);\n\n        glViewport(0, 0, _newWidth, _newHeight);\n\n        if (m_view) {\n            m_view->setSize(_newWidth, _newHeight);\n        }\n        \n        if (m_ftContext) {\n            m_ftContext->setScreenSize(m_view->getWidth(), m_view->getHeight());\n            m_labelContainer->setScreenSize(m_view->getWidth(), m_view->getHeight());\n        }\n\n        while (Error::hadGlError(\"Tangram::resize()\")) {}\n\n    }\n\n    void update(float _dt) {\n\n        g_time += _dt;\n\n        if (m_view) {\n            m_view->update();\n\n            m_tileManager->updateTileSet();\n\n            if (m_view->changedOnLastUpdate()) {\n                m_labelContainer->setViewProjectionMatrix(m_view->getViewProjectionMatrix());\n                \n                for (const auto& mapIDandTile : m_tileManager->getVisibleTiles()) {\n                    const std::shared_ptr<MapTile>& tile = mapIDandTile.second;\n                    tile->update(_dt, *m_view);\n                }\n            }\n\n            if(m_view->changedOnLastUpdate() || m_tileManager->hasTileSetChanged()) {\n                \/\/ update labels for specific style\n                for (const auto& style : m_scene->getStyles()) {\n                    for (const auto& mapIDandTile : m_tileManager->getVisibleTiles()) {\n                        const std::shared_ptr<MapTile>& tile = mapIDandTile.second;\n                        tile->updateLabels(_dt, *style, *m_view, m_labelContainer);\n                    }\n                }\n                \n                \/\/ manage occlusions\n                m_labelContainer->updateOcclusions();\n                \n                for (const auto& style : m_scene->getStyles()) {\n                    for (const auto& mapIDandTile : m_tileManager->getVisibleTiles()) {\n                        const std::shared_ptr<MapTile>& tile = mapIDandTile.second;\n                        tile->pushLabelTransforms(*style, m_labelContainer);\n                    }\n                }\n            }\n        }\n        \n        if(m_scene) {\n            \/\/ Update lights and styles\n        }   \n    }\n\n    void render() {\n        \n        \/\/ Set up openGL for new frame\n        glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n        \/\/ Loop over all styles\n        for (const auto& style : m_scene->getStyles()) {\n            style->setupFrame(m_view, m_scene);\n\n            \/\/ Loop over all tiles in m_tileSet\n            for (const auto& mapIDandTile : m_tileManager->getVisibleTiles()) {\n                const std::shared_ptr<MapTile>& tile = mapIDandTile.second;\n                if (tile->hasGeometry()) {\n                    \/\/ Draw tile!\n                    style->setupTile(tile);\n                    tile->draw(*style, *m_view);\n                }\n            }\n\n            style->teardown();\n        }\n        \n        while (Error::hadGlError(\"Tangram::render()\")) {}\n    }\n\n    void setPixelScale(float _pixelsPerPoint) {\n        \n        if (m_view) {\n            m_view->setPixelScale(_pixelsPerPoint);\n        }\n\n        for (auto& style : m_scene->getStyles()) {\n            style->setPixelScale(_pixelsPerPoint);\n        }\n        \n    }\n        \n    void handleTapGesture(float _posX, float _posY) {\n        \n        float viewCenterX = 0.5f * m_view->getWidth();\n        float viewCenterY = 0.5f * m_view->getHeight();\n        \n        m_view->screenToGroundPlane(viewCenterX, viewCenterY);\n        m_view->screenToGroundPlane(_posX, _posY);\n\n        m_view->translate((_posX - viewCenterX), (_posY - viewCenterY));\n\n    }\n\n    void handleDoubleTapGesture(float _posX, float _posY) {\n        \n        handlePinchGesture(_posX, _posY, 2.f);\n        \n    }\n\n    void handlePanGesture(float _startX, float _startY, float _endX, float _endY) {\n        \n        m_view->screenToGroundPlane(_startX, _startY);\n        m_view->screenToGroundPlane(_endX, _endY);\n\n        m_view->translate(_startX - _endX, _startY - _endY);\n\n    }\n\n    void handlePinchGesture(float _posX, float _posY, float _scale) {\n        \n        float viewCenterX = 0.5f * m_view->getWidth();\n        float viewCenterY = 0.5f * m_view->getHeight();\n        \n        m_view->screenToGroundPlane(viewCenterX, viewCenterY);\n        m_view->screenToGroundPlane(_posX, _posY);\n        \n        m_view->translate((_posX - viewCenterX)*(1-1\/_scale), (_posY - viewCenterY)*(1-1\/_scale));\n        \n        m_view->zoom(log2f(_scale));\n    }\n        \n    void handleRotateGesture(float _posX, float _posY, float _radians) {\n        \n        m_view->screenToGroundPlane(_posX, _posY);\n        m_view->orbit(_posX, _posY, _radians);\n        \n    }\n\n    void handleShoveGesture(float _distance) {\n        \n        m_view->pitch(_distance);\n        \n    }\n    \n    void setDebugFlag(DebugFlags _flag, bool _on) {\n        \n        if (_on) {\n            g_flags |= (1 << _flag); \/\/ |ing with a bitfield that is 0 everywhere except index _flag; sets index _flag to 1\n        } else {\n            g_flags &= ~(1 << _flag); \/\/ &ing with a bitfield that is 1 everywhere except index _flag; sets index _flag to 0\n        }\n\n        m_view->setZoom(m_view->getZoom()); \/\/ Force the view to refresh\n        \n    }\n    \n    bool getDebugFlag(DebugFlags _flag) {\n        \n        return (g_flags & (1 << _flag)) != 0; \/\/ &ing with a bitfield that is 0 everywhere except index _flag will yield 0 iff index _flag is 0\n        \n    }\n\n    void teardown() {\n        \/\/ Release resources!\n        logMsg(\"teardown\\n\");\n        m_tileManager.reset();\n        m_scene.reset();\n        m_view.reset();\n    }\n\n    void onContextDestroyed() {\n        \n        logMsg(\"context destroyed\\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    }\n    \n}\n<commit_msg>update the tile when tile set has changed Tiles sometimes are not updated transformed to the right position, in order to solve this update the tile also when the tile set has changed, and not only when the view has<commit_after>#include \"tangram.h\"\n\n#include <memory>\n#include <utility>\n#include <cmath>\n#include <set>\n\n#include \"platform.h\"\n#include \"tile\/tileManager.h\"\n#include \"view\/view.h\"\n#include \"data\/geoJsonSource.h\"\n#include \"data\/protobufSource.h\"\n\n#include \"style\/polygonStyle.h\"\n#include \"style\/polylineStyle.h\"\n#include \"style\/textStyle.h\"\n#include \"style\/debugTextStyle.h\"\n#include \"style\/debugStyle.h\"\n#include \"style\/spriteStyle.h\"\n#include \"scene\/scene.h\"\n#include \"scene\/lights.h\"\n#include \"util\/error.h\"\n#include \"stl_util.hpp\"\n\nnamespace Tangram {\n\n    std::unique_ptr<TileManager> m_tileManager;\n    std::shared_ptr<Scene> m_scene;\n    std::shared_ptr<View> m_view;\n    std::shared_ptr<LabelContainer> m_labelContainer;\n    std::shared_ptr<FontContext> m_ftContext;\n    std::shared_ptr<DebugStyle> m_debugStyle;\n\n    static float g_time = 0.0;\n    static unsigned long g_flags = 0;\n\n    void initialize() {\n        \n        logMsg(\"initialize\\n\");\n\n        \/\/ Create view\n        if (!m_view) {\n            m_view = std::make_shared<View>();\n            \n            \/\/ Move the view to coordinates in Manhattan so we have something interesting to test\n            glm::dvec2 target = m_view->getMapProjection().LonLatToMeters(glm::dvec2(-74.00796, 40.70361));\n            m_view->setPosition(target.x, target.y);\n        }\n\n        \/\/ Create a scene object\n        if (!m_scene) {\n            m_scene = std::make_shared<Scene>();\n            \n            \/\/ Load style(s); hard-coded for now\n            std::unique_ptr<Style> polyStyle(new PolygonStyle(\"Polygon\"));\n            polyStyle->setLighting(LightingType::vertex);\n            polyStyle->addLayers({\n                \"buildings\",\n                \"water\",\n                \"earth\",\n                \"landuse\"\n            });\n            m_scene->addStyle(std::move(polyStyle));\n            \n            std::unique_ptr<Style> linesStyle(new PolylineStyle(\"Polyline\"));\n            linesStyle->addLayers({\"roads\"});\n            m_scene->addStyle(std::move(linesStyle));\n\n            m_ftContext = std::make_shared<FontContext>();\n            m_ftContext->addFont(\"FiraSans-Medium.ttf\", \"FiraSans\");\n            m_ftContext->addFont(\"FuturaStd-Condensed.ttf\", \"Futura\");\n            m_labelContainer = LabelContainer::GetInstance();\n            m_labelContainer->setFontContext(m_ftContext);\n\n            std::unique_ptr<Style> textStyle0(new TextStyle(\"FiraSans\", \"Textstyle0\", 15.0f, 0xF7F0E1, true, true));\n            textStyle0->addLayers({\n                \"roads\",\n                \"places\",\n                \"pois\"\n            });\n            m_scene->addStyle(std::move(textStyle0));\n            std::unique_ptr<Style> textStyle1(new TextStyle(\"Futura\", \"Textstyle1\", 18.0f, 0x26241F, true, true));\n            textStyle1->addLayers({\n                \"landuse\",\n            });\n            m_scene->addStyle(std::move(textStyle1));\n            \n            std::unique_ptr<Style> debugTextStyle(new DebugTextStyle(\"FiraSans\", \"DebugTextStyle\", 30.0f, 0xDC3522, true));\n            m_scene->addStyle(std::move(debugTextStyle));\n\n            std::unique_ptr<DebugStyle> debugStyle(new DebugStyle(\"Debug\"));\n            m_scene->addStyle(std::move(debugStyle));\n\n            \/\/ Directional light with white diffuse color pointing Northeast and down\n             \n            std::unique_ptr<DirectionalLight> directionalLight(new DirectionalLight(\"dLight\"));\n            directionalLight->setAmbientColor({0.3, 0.3, 0.3, 1.0});\n            directionalLight->setDiffuseColor({0.7, 0.7, 0.7, 1.0});\n            directionalLight->setDirection({1.0, 1.0, -1.0});\n            m_scene->addLight(std::move(directionalLight));\n\n            \/\/  Directional light with white diffuse color pointing Northeast and down\n            \n            \/*std::unique_ptr<PointLight> pointLight(new PointLight(\"pLight\"));\n            pointLight->setAmbientColor({0.2, 0.2, 0.2, 1.0});\n            pointLight->setDiffuseColor({0.7, 0.7, 0.7, 1.0});\n            pointLight->setPosition({0.0, 0.0, -100.0});\n            pointLight->setRadius(200);\n            m_scene->addLight(std::move(pointLight));*\/\n\n            \/\/ Testing loading image\n\t\t\t\/\/ std::unique_ptr<Style> spriteStyle(new SpriteStyle(\"Sprite\"));\n            \/\/ m_scene->addStyle(std::move(spriteStyle));\n        }\n\n        \/\/ Create a tileManager\n        if (!m_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            m_tileManager->setScene(m_scene);\n            \n            \/\/ Add a tile data source\n            \/\/ json tile source\n            \/\/ std::unique_ptr<DataSource> dataSource(new GeoJsonTile());\n            \/\/ protobuf tile source\n            std::unique_ptr<DataSource> dataSource(new ProtobufSource());\n            m_tileManager->addDataSource(std::move(dataSource));\n        }\n\n        \/\/ Set up openGL state\n        glDisable(GL_BLEND);\n        glDisable(GL_STENCIL_TEST);\n        glEnable(GL_DEPTH_TEST);\n        glClearDepthf(1.0);\n        glDepthRangef(0.0, 1.0);\n        glDepthMask(GL_TRUE);\n        glDepthFunc(GL_LEQUAL);\n        glEnable(GL_CULL_FACE);\n        glFrontFace(GL_CCW);\n        glCullFace(GL_BACK);\n        glClearColor(0.3f, 0.3f, 0.3f, 1.0f);\n\n        while (Error::hadGlError(\"Tangram::initialize()\")) {}\n\n        logMsg(\"finish initialize\\n\");\n\n    }\n\n    void resize(int _newWidth, int _newHeight) {\n        \n        logMsg(\"resize: %d x %d\\n\", _newWidth, _newHeight);\n\n        glViewport(0, 0, _newWidth, _newHeight);\n\n        if (m_view) {\n            m_view->setSize(_newWidth, _newHeight);\n        }\n        \n        if (m_ftContext) {\n            m_ftContext->setScreenSize(m_view->getWidth(), m_view->getHeight());\n            m_labelContainer->setScreenSize(m_view->getWidth(), m_view->getHeight());\n        }\n\n        while (Error::hadGlError(\"Tangram::resize()\")) {}\n\n    }\n\n    void update(float _dt) {\n\n        g_time += _dt;\n\n        if (m_view) {\n            m_view->update();\n\n            m_tileManager->updateTileSet();\n\n            if(m_view->changedOnLastUpdate() || m_tileManager->hasTileSetChanged()) {\n                m_labelContainer->setViewProjectionMatrix(m_view->getViewProjectionMatrix());\n                \n                for (const auto& mapIDandTile : m_tileManager->getVisibleTiles()) {\n                    const std::shared_ptr<MapTile>& tile = mapIDandTile.second;\n                    tile->update(_dt, *m_view);\n                }\n                \n                \/\/ update labels for specific style\n                for (const auto& style : m_scene->getStyles()) {\n                    for (const auto& mapIDandTile : m_tileManager->getVisibleTiles()) {\n                        const std::shared_ptr<MapTile>& tile = mapIDandTile.second;\n                        tile->updateLabels(_dt, *style, *m_view, m_labelContainer);\n                    }\n                }\n                \n                \/\/ manage occlusions\n                m_labelContainer->updateOcclusions();\n                \n                for (const auto& style : m_scene->getStyles()) {\n                    for (const auto& mapIDandTile : m_tileManager->getVisibleTiles()) {\n                        const std::shared_ptr<MapTile>& tile = mapIDandTile.second;\n                        tile->pushLabelTransforms(*style, m_labelContainer);\n                    }\n                }\n            }\n        }\n        \n        if(m_scene) {\n            \/\/ Update lights and styles\n        }   \n    }\n\n    void render() {\n        \n        \/\/ Set up openGL for new frame\n        glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n        \/\/ Loop over all styles\n        for (const auto& style : m_scene->getStyles()) {\n            style->setupFrame(m_view, m_scene);\n\n            \/\/ Loop over all tiles in m_tileSet\n            for (const auto& mapIDandTile : m_tileManager->getVisibleTiles()) {\n                const std::shared_ptr<MapTile>& tile = mapIDandTile.second;\n                if (tile->hasGeometry()) {\n                    \/\/ Draw tile!\n                    style->setupTile(tile);\n                    tile->draw(*style, *m_view);\n                }\n            }\n\n            style->teardown();\n        }\n        \n        while (Error::hadGlError(\"Tangram::render()\")) {}\n    }\n\n    void setPixelScale(float _pixelsPerPoint) {\n        \n        if (m_view) {\n            m_view->setPixelScale(_pixelsPerPoint);\n        }\n\n        for (auto& style : m_scene->getStyles()) {\n            style->setPixelScale(_pixelsPerPoint);\n        }\n        \n    }\n        \n    void handleTapGesture(float _posX, float _posY) {\n        \n        float viewCenterX = 0.5f * m_view->getWidth();\n        float viewCenterY = 0.5f * m_view->getHeight();\n        \n        m_view->screenToGroundPlane(viewCenterX, viewCenterY);\n        m_view->screenToGroundPlane(_posX, _posY);\n\n        m_view->translate((_posX - viewCenterX), (_posY - viewCenterY));\n\n    }\n\n    void handleDoubleTapGesture(float _posX, float _posY) {\n        \n        handlePinchGesture(_posX, _posY, 2.f);\n        \n    }\n\n    void handlePanGesture(float _startX, float _startY, float _endX, float _endY) {\n        \n        m_view->screenToGroundPlane(_startX, _startY);\n        m_view->screenToGroundPlane(_endX, _endY);\n\n        m_view->translate(_startX - _endX, _startY - _endY);\n\n    }\n\n    void handlePinchGesture(float _posX, float _posY, float _scale) {\n        \n        float viewCenterX = 0.5f * m_view->getWidth();\n        float viewCenterY = 0.5f * m_view->getHeight();\n        \n        m_view->screenToGroundPlane(viewCenterX, viewCenterY);\n        m_view->screenToGroundPlane(_posX, _posY);\n        \n        m_view->translate((_posX - viewCenterX)*(1-1\/_scale), (_posY - viewCenterY)*(1-1\/_scale));\n        \n        m_view->zoom(log2f(_scale));\n    }\n        \n    void handleRotateGesture(float _posX, float _posY, float _radians) {\n        \n        m_view->screenToGroundPlane(_posX, _posY);\n        m_view->orbit(_posX, _posY, _radians);\n        \n    }\n\n    void handleShoveGesture(float _distance) {\n        \n        m_view->pitch(_distance);\n        \n    }\n    \n    void setDebugFlag(DebugFlags _flag, bool _on) {\n        \n        if (_on) {\n            g_flags |= (1 << _flag); \/\/ |ing with a bitfield that is 0 everywhere except index _flag; sets index _flag to 1\n        } else {\n            g_flags &= ~(1 << _flag); \/\/ &ing with a bitfield that is 1 everywhere except index _flag; sets index _flag to 0\n        }\n\n        m_view->setZoom(m_view->getZoom()); \/\/ Force the view to refresh\n        \n    }\n    \n    bool getDebugFlag(DebugFlags _flag) {\n        \n        return (g_flags & (1 << _flag)) != 0; \/\/ &ing with a bitfield that is 0 everywhere except index _flag will yield 0 iff index _flag is 0\n        \n    }\n\n    void teardown() {\n        \/\/ Release resources!\n        logMsg(\"teardown\\n\");\n        m_tileManager.reset();\n        m_scene.reset();\n        m_view.reset();\n    }\n\n    void onContextDestroyed() {\n        \n        logMsg(\"context destroyed\\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    }\n    \n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"core\/stringmerger.h\"\n\n#include \"core\/str.h\"\n\n#include <string>\n#include <sstream>\n#include <vector>\n\nstd::string\nStringMerger::Generate(const std::vector<std::string>& strings) const\n{\n  if(strings.empty())\n  {\n    return Str() << start_ << empty_ << end_;\n  }\n\n  std::ostringstream ss;\n\n  ss << start_;\n\n  const auto count = strings.size();\n  for(std::vector<std::string>::size_type index = 0; index < count; ++index)\n  {\n    ss << strings[index];\n\n    if(count != index + 1)\n    {  \/\/ if this item isn't the last one in the list\n      if(count == index + 2)\n      {\n        ss << final_separator_;\n      }\n      else\n      {\n        ss << separator_;\n      }\n    }\n  }\n\n  ss << end_;\n\n  return ss.str();\n}\n\nconst StringMerger&\nStringMerger::EnglishAnd()\n{\n  static const StringMerger s_EnglishAnd =\n      StringMerger().SetSeparator(\", \", \" and \").SetSeparator(\"\", \"\");\n  return s_EnglishAnd;\n}\n\nconst StringMerger&\nStringMerger::EnglishOr()\n{\n  static const StringMerger s_EnglishOr =\n      StringMerger().SetSeparator(\", \", \" or \").SetSeparator(\"\", \"\");\n  return s_EnglishOr;\n}\n\nconst StringMerger&\nStringMerger::Array()\n{\n  static const StringMerger s_Array =\n      StringMerger().SetSeparator(\", \").SetSeparator(\"[\", \"]\");\n  return s_Array;\n}\n\nStringMerger&\nStringMerger::SetSeparator(const std::string& separator,\n                           const std::string& final_separator)\n{\n  separator_       = separator;\n  final_separator_ = final_separator;\n  return *this;\n}\n\nStringMerger&\nStringMerger::SetSeparator(const std::string& separator)\n{\n  separator_       = separator;\n  final_separator_ = separator;\n  return *this;\n}\n\nStringMerger&\nStringMerger::SetEmpty(const std::string& empty)\n{\n  empty_ = empty;\n  return *this;\n}\n\nStringMerger&\nStringMerger::SetStartAndEnd(const std::string& start, const std::string& end)\n{\n  start_ = start;\n  end_   = end;\n  return *this;\n}\n<commit_msg>fixed stringmerger bug<commit_after>#include \"core\/stringmerger.h\"\n\n#include \"core\/str.h\"\n\n#include <string>\n#include <sstream>\n#include <vector>\n\nstd::string\nStringMerger::Generate(const std::vector<std::string>& strings) const\n{\n  if(strings.empty())\n  {\n    return Str() << start_ << empty_ << end_;\n  }\n\n  std::ostringstream ss;\n\n  ss << start_;\n\n  const auto count = strings.size();\n  for(std::vector<std::string>::size_type index = 0; index < count; ++index)\n  {\n    ss << strings[index];\n\n    if(count != index + 1)\n    {  \/\/ if this item isn't the last one in the list\n      if(count == index + 2)\n      {\n        ss << final_separator_;\n      }\n      else\n      {\n        ss << separator_;\n      }\n    }\n  }\n\n  ss << end_;\n\n  return ss.str();\n}\n\nconst StringMerger&\nStringMerger::EnglishAnd()\n{\n  static const StringMerger s_EnglishAnd =\n      StringMerger().SetSeparator(\", \", \" and \");\n  return s_EnglishAnd;\n}\n\nconst StringMerger&\nStringMerger::EnglishOr()\n{\n  static const StringMerger s_EnglishOr =\n      StringMerger().SetSeparator(\", \", \" or \");\n  return s_EnglishOr;\n}\n\nconst StringMerger&\nStringMerger::Array()\n{\n  static const StringMerger s_Array =\n      StringMerger().SetSeparator(\", \").SetSeparator(\"[\", \"]\");\n  return s_Array;\n}\n\nStringMerger&\nStringMerger::SetSeparator(const std::string& separator,\n                           const std::string& final_separator)\n{\n  separator_       = separator;\n  final_separator_ = final_separator;\n  return *this;\n}\n\nStringMerger&\nStringMerger::SetSeparator(const std::string& separator)\n{\n  separator_       = separator;\n  final_separator_ = separator;\n  return *this;\n}\n\nStringMerger&\nStringMerger::SetEmpty(const std::string& empty)\n{\n  empty_ = empty;\n  return *this;\n}\n\nStringMerger&\nStringMerger::SetStartAndEnd(const std::string& start, const std::string& end)\n{\n  start_ = start;\n  end_   = end;\n  return *this;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>fix CCTAGG mean<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/===- CompleteBottomUp.cpp - Complete Bottom-Up Data Structure Graphs ----===\/\/\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 is the exact same as the bottom-up graphs, but we use take a completed\n\/\/ call graph and inline all indirect callees into their callers graphs, making\n\/\/ the result more useful for things like pool allocation.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Analysis\/DataStructure.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/Analysis\/DSGraph.h\"\n#include \"Support\/SCCIterator.h\"\n#include \"Support\/STLExtras.h\"\nusing namespace llvm;\n\nnamespace {\n  RegisterAnalysis<CompleteBUDataStructures>\n  X(\"cbudatastructure\", \"'Complete' Bottom-up Data Structure Analysis\");\n}\n\n\n\/\/ run - Calculate the bottom up data structure graphs for each function in the\n\/\/ program.\n\/\/\nbool CompleteBUDataStructures::run(Module &M) {\n  BUDataStructures &BU = getAnalysis<BUDataStructures>();\n  GlobalsGraph = new DSGraph(BU.getGlobalsGraph());\n  GlobalsGraph->setPrintAuxCalls();\n\n  \/\/ Our call graph is the same as the BU data structures call graph\n  ActualCallees = BU.getActualCallees();\n\n#if 1   \/\/ REMOVE ME EVENTUALLY\n  \/\/ FIXME: TEMPORARY (remove once finalization of indirect call sites in the\n  \/\/ globals graph has been implemented in the BU pass)\n  TDDataStructures &TD = getAnalysis<TDDataStructures>();\n\n  \/\/ The call graph extractable from the TD pass is _much more complete_ and\n  \/\/ trustable than that generated by the BU pass so far.  Until this is fixed,\n  \/\/ we hack it like this:\n  for (Module::iterator MI = M.begin(), ME = M.end(); MI != ME; ++MI) {\n    if (MI->isExternal()) continue;\n    const std::vector<DSCallSite> &CSs = TD.getDSGraph(*MI).getFunctionCalls();\n\n    for (unsigned CSi = 0, e = CSs.size(); CSi != e; ++CSi) {\n      if (CSs[CSi].isIndirectCall()) {\n        Instruction *TheCall = CSs[CSi].getCallSite().getInstruction();\n\n        const std::vector<GlobalValue*> &Callees =\n          CSs[CSi].getCalleeNode()->getGlobals();\n        for (unsigned i = 0, e = Callees.size(); i != e; ++i)\n          if (Function *F = dyn_cast<Function>(Callees[i]))\n            ActualCallees.insert(std::make_pair(TheCall, F));\n      }\n    }\n  }\n#endif\n\n  std::vector<DSGraph*> Stack;\n  hash_map<DSGraph*, unsigned> ValMap;\n  unsigned NextID = 1;\n\n  if (Function *Main = M.getMainFunction()) {\n    calculateSCCGraphs(getOrCreateGraph(*Main), Stack, NextID, ValMap);\n  } else {\n    std::cerr << \"CBU-DSA: No 'main' function found!\\n\";\n  }\n  \n  for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)\n    if (!I->isExternal() && !DSInfo.count(I))\n      calculateSCCGraphs(getOrCreateGraph(*I), Stack, NextID, ValMap);\n\n  GlobalsGraph->removeTriviallyDeadNodes();\n  return false;\n}\n\nDSGraph &CompleteBUDataStructures::getOrCreateGraph(Function &F) {\n  \/\/ Has the graph already been created?\n  DSGraph *&Graph = DSInfo[&F];\n  if (Graph) return *Graph;\n\n  \/\/ Copy the BU graph...\n  Graph = new DSGraph(getAnalysis<BUDataStructures>().getDSGraph(F));\n  Graph->setGlobalsGraph(GlobalsGraph);\n  Graph->setPrintAuxCalls();\n\n  \/\/ Make sure to update the DSInfo map for all of the functions currently in\n  \/\/ this graph!\n  for (DSGraph::ReturnNodesTy::iterator I = Graph->getReturnNodes().begin();\n       I != Graph->getReturnNodes().end(); ++I)\n    DSInfo[I->first] = Graph;\n\n  return *Graph;\n}\n\n\n\nunsigned CompleteBUDataStructures::calculateSCCGraphs(DSGraph &FG,\n                                                  std::vector<DSGraph*> &Stack,\n                                                  unsigned &NextID, \n                                         hash_map<DSGraph*, unsigned> &ValMap) {\n  assert(!ValMap.count(&FG) && \"Shouldn't revisit functions!\");\n  unsigned Min = NextID++, MyID = Min;\n  ValMap[&FG] = Min;\n  Stack.push_back(&FG);\n\n  \/\/ The edges out of the current node are the call site targets...\n  for (unsigned i = 0, e = FG.getFunctionCalls().size(); i != e; ++i) {\n    Instruction *Call = FG.getFunctionCalls()[i].getCallSite().getInstruction();\n\n    \/\/ Loop over all of the actually called functions...\n    ActualCalleesTy::iterator I, E;\n    for (tie(I, E) = ActualCallees.equal_range(Call); I != E; ++I)\n      if (!I->second->isExternal()) {\n        DSGraph &Callee = getOrCreateGraph(*I->second);\n        unsigned M;\n        \/\/ Have we visited the destination function yet?\n        hash_map<DSGraph*, unsigned>::iterator It = ValMap.find(&Callee);\n        if (It == ValMap.end())  \/\/ No, visit it now.\n          M = calculateSCCGraphs(Callee, Stack, NextID, ValMap);\n        else                    \/\/ Yes, get it's number.\n          M = It->second;\n        if (M < Min) Min = M;\n      }\n  }\n\n  assert(ValMap[&FG] == MyID && \"SCC construction assumption wrong!\");\n  if (Min != MyID)\n    return Min;         \/\/ This is part of a larger SCC!\n\n  \/\/ If this is a new SCC, process it now.\n  bool IsMultiNodeSCC = false;\n  while (Stack.back() != &FG) {\n    DSGraph *NG = Stack.back();\n    ValMap[NG] = ~0U;\n\n    DSGraph::NodeMapTy NodeMap;\n    FG.cloneInto(*NG, FG.getScalarMap(), FG.getReturnNodes(), NodeMap);\n\n    \/\/ Update the DSInfo map and delete the old graph...\n    for (DSGraph::ReturnNodesTy::iterator I = NG->getReturnNodes().begin();\n         I != NG->getReturnNodes().end(); ++I)\n      DSInfo[I->first] = &FG;\n    delete NG;\n    \n    Stack.pop_back();\n    IsMultiNodeSCC = true;\n  }\n\n  \/\/ Clean up the graph before we start inlining a bunch again...\n  if (IsMultiNodeSCC)\n    FG.removeTriviallyDeadNodes();\n  \n  Stack.pop_back();\n  processGraph(FG);\n  ValMap[&FG] = ~0U;\n  return MyID;\n}\n\n\n\/\/\/ processGraph - Process the BU graphs for the program in bottom-up order on\n\/\/\/ the SCC of the __ACTUAL__ call graph.  This builds \"complete\" BU graphs.\nvoid CompleteBUDataStructures::processGraph(DSGraph &G) {\n\n  \/\/ The edges out of the current node are the call site targets...\n  for (unsigned i = 0, e = G.getFunctionCalls().size(); i != e; ++i) {\n    const DSCallSite &CS = G.getFunctionCalls()[i];\n    Instruction *TheCall = CS.getCallSite().getInstruction();\n\n    \/\/ The Normal BU pass will have taken care of direct calls well already,\n    \/\/ don't worry about them.\n    if (!CS.getCallSite().getCalledFunction()) {\n      \/\/ Loop over all of the actually called functions...\n      ActualCalleesTy::iterator I, E;\n      for (tie(I, E) = ActualCallees.equal_range(TheCall); I != E; ++I) {\n        Function *CalleeFunc = I->second;\n        if (!CalleeFunc->isExternal()) {\n          \/\/ Merge the callee's graph into this graph.  This works for normal\n          \/\/ calls or for self recursion within an SCC.\n          G.mergeInGraph(CS, *CalleeFunc, getOrCreateGraph(*CalleeFunc),\n                         DSGraph::KeepModRefBits |\n                         DSGraph::StripAllocaBit |\n                         DSGraph::DontCloneCallNodes);\n        }\n      }\n    }\n  }\n\n  \/\/ Recompute the Incomplete markers\n  assert(G.getInlinedGlobals().empty());\n  G.maskIncompleteMarkers();\n  G.markIncompleteNodes(DSGraph::MarkFormalArgs);\n\n  \/\/ Delete dead nodes.  Treat globals that are unreachable but that can\n  \/\/ reach live nodes as live.\n  G.removeDeadNodes(DSGraph::KeepUnreachableGlobals);\n}\n<commit_msg>Speed up the cbu pass from taking somewhere near the age of the universe to about 90s on povray<commit_after>\/\/===- CompleteBottomUp.cpp - Complete Bottom-Up Data Structure Graphs ----===\/\/\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 is the exact same as the bottom-up graphs, but we use take a completed\n\/\/ call graph and inline all indirect callees into their callers graphs, making\n\/\/ the result more useful for things like pool allocation.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Analysis\/DataStructure.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/Analysis\/DSGraph.h\"\n#include \"Support\/Debug.h\"\n#include \"Support\/SCCIterator.h\"\n#include \"Support\/Statistic.h\"\n#include \"Support\/STLExtras.h\"\nusing namespace llvm;\n\nnamespace {\n  RegisterAnalysis<CompleteBUDataStructures>\n  X(\"cbudatastructure\", \"'Complete' Bottom-up Data Structure Analysis\");\n  Statistic<> NumCBUInlines(\"cbudatastructures\", \"Number of graphs inlined\");\n}\n\n\n\/\/ run - Calculate the bottom up data structure graphs for each function in the\n\/\/ program.\n\/\/\nbool CompleteBUDataStructures::run(Module &M) {\n  BUDataStructures &BU = getAnalysis<BUDataStructures>();\n  GlobalsGraph = new DSGraph(BU.getGlobalsGraph());\n  GlobalsGraph->setPrintAuxCalls();\n\n  \/\/ Our call graph is the same as the BU data structures call graph\n  ActualCallees = BU.getActualCallees();\n\n#if 1   \/\/ REMOVE ME EVENTUALLY\n  \/\/ FIXME: TEMPORARY (remove once finalization of indirect call sites in the\n  \/\/ globals graph has been implemented in the BU pass)\n  TDDataStructures &TD = getAnalysis<TDDataStructures>();\n\n  \/\/ The call graph extractable from the TD pass is _much more complete_ and\n  \/\/ trustable than that generated by the BU pass so far.  Until this is fixed,\n  \/\/ we hack it like this:\n  for (Module::iterator MI = M.begin(), ME = M.end(); MI != ME; ++MI) {\n    if (MI->isExternal()) continue;\n    const std::vector<DSCallSite> &CSs = TD.getDSGraph(*MI).getFunctionCalls();\n\n    for (unsigned CSi = 0, e = CSs.size(); CSi != e; ++CSi) {\n      if (CSs[CSi].isIndirectCall()) {\n        Instruction *TheCall = CSs[CSi].getCallSite().getInstruction();\n\n        const std::vector<GlobalValue*> &Callees =\n          CSs[CSi].getCalleeNode()->getGlobals();\n        for (unsigned i = 0, e = Callees.size(); i != e; ++i)\n          if (Function *F = dyn_cast<Function>(Callees[i]))\n            ActualCallees.insert(std::make_pair(TheCall, F));\n      }\n    }\n  }\n#endif\n\n  std::vector<DSGraph*> Stack;\n  hash_map<DSGraph*, unsigned> ValMap;\n  unsigned NextID = 1;\n\n  if (Function *Main = M.getMainFunction()) {\n    calculateSCCGraphs(getOrCreateGraph(*Main), Stack, NextID, ValMap);\n  } else {\n    std::cerr << \"CBU-DSA: No 'main' function found!\\n\";\n  }\n  \n  for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)\n    if (!I->isExternal() && !DSInfo.count(I))\n      calculateSCCGraphs(getOrCreateGraph(*I), Stack, NextID, ValMap);\n\n  GlobalsGraph->removeTriviallyDeadNodes();\n  return false;\n}\n\nDSGraph &CompleteBUDataStructures::getOrCreateGraph(Function &F) {\n  \/\/ Has the graph already been created?\n  DSGraph *&Graph = DSInfo[&F];\n  if (Graph) return *Graph;\n\n  \/\/ Copy the BU graph...\n  Graph = new DSGraph(getAnalysis<BUDataStructures>().getDSGraph(F));\n  Graph->setGlobalsGraph(GlobalsGraph);\n  Graph->setPrintAuxCalls();\n\n  \/\/ Make sure to update the DSInfo map for all of the functions currently in\n  \/\/ this graph!\n  for (DSGraph::ReturnNodesTy::iterator I = Graph->getReturnNodes().begin();\n       I != Graph->getReturnNodes().end(); ++I)\n    DSInfo[I->first] = Graph;\n\n  return *Graph;\n}\n\n\n\nunsigned CompleteBUDataStructures::calculateSCCGraphs(DSGraph &FG,\n                                                  std::vector<DSGraph*> &Stack,\n                                                  unsigned &NextID, \n                                         hash_map<DSGraph*, unsigned> &ValMap) {\n  assert(!ValMap.count(&FG) && \"Shouldn't revisit functions!\");\n  unsigned Min = NextID++, MyID = Min;\n  ValMap[&FG] = Min;\n  Stack.push_back(&FG);\n\n  \/\/ The edges out of the current node are the call site targets...\n  for (unsigned i = 0, e = FG.getFunctionCalls().size(); i != e; ++i) {\n    Instruction *Call = FG.getFunctionCalls()[i].getCallSite().getInstruction();\n\n    \/\/ Loop over all of the actually called functions...\n    ActualCalleesTy::iterator I, E;\n    for (tie(I, E) = ActualCallees.equal_range(Call); I != E; ++I)\n      if (!I->second->isExternal()) {\n        DSGraph &Callee = getOrCreateGraph(*I->second);\n        unsigned M;\n        \/\/ Have we visited the destination function yet?\n        hash_map<DSGraph*, unsigned>::iterator It = ValMap.find(&Callee);\n        if (It == ValMap.end())  \/\/ No, visit it now.\n          M = calculateSCCGraphs(Callee, Stack, NextID, ValMap);\n        else                    \/\/ Yes, get it's number.\n          M = It->second;\n        if (M < Min) Min = M;\n      }\n  }\n\n  assert(ValMap[&FG] == MyID && \"SCC construction assumption wrong!\");\n  if (Min != MyID)\n    return Min;         \/\/ This is part of a larger SCC!\n\n  \/\/ If this is a new SCC, process it now.\n  bool IsMultiNodeSCC = false;\n  while (Stack.back() != &FG) {\n    DSGraph *NG = Stack.back();\n    ValMap[NG] = ~0U;\n\n    DSGraph::NodeMapTy NodeMap;\n    FG.cloneInto(*NG, FG.getScalarMap(), FG.getReturnNodes(), NodeMap);\n\n    \/\/ Update the DSInfo map and delete the old graph...\n    for (DSGraph::ReturnNodesTy::iterator I = NG->getReturnNodes().begin();\n         I != NG->getReturnNodes().end(); ++I)\n      DSInfo[I->first] = &FG;\n    delete NG;\n    \n    Stack.pop_back();\n    IsMultiNodeSCC = true;\n  }\n\n  \/\/ Clean up the graph before we start inlining a bunch again...\n  if (IsMultiNodeSCC)\n    FG.removeTriviallyDeadNodes();\n  \n  Stack.pop_back();\n  processGraph(FG);\n  ValMap[&FG] = ~0U;\n  return MyID;\n}\n\n\n\/\/\/ processGraph - Process the BU graphs for the program in bottom-up order on\n\/\/\/ the SCC of the __ACTUAL__ call graph.  This builds \"complete\" BU graphs.\nvoid CompleteBUDataStructures::processGraph(DSGraph &G) {\n  hash_set<Instruction*> calls;\n\n  \/\/ The edges out of the current node are the call site targets...\n  for (unsigned i = 0, e = G.getFunctionCalls().size(); i != e; ++i) {\n    const DSCallSite &CS = G.getFunctionCalls()[i];\n    Instruction *TheCall = CS.getCallSite().getInstruction();\n\n    assert(calls.insert(TheCall).second &&\n           \"Call instruction occurs multiple times in graph??\");\n      \n\n    \/\/ The Normal BU pass will have taken care of direct calls well already,\n    \/\/ don't worry about them.\n\n    \/\/ FIXME: if a direct callee had indirect callees, it seems like they could\n    \/\/ be updated and we would have to reinline even direct calls!\n\n    if (!CS.getCallSite().getCalledFunction()) {\n      \/\/ Loop over all of the actually called functions...\n      ActualCalleesTy::iterator I, E;\n      tie(I, E) = ActualCallees.equal_range(TheCall);\n      unsigned TNum = 0, Num = std::distance(I, E);\n      for (; I != E; ++I, ++TNum) {\n        Function *CalleeFunc = I->second;\n        if (!CalleeFunc->isExternal()) {\n          \/\/ Merge the callee's graph into this graph.  This works for normal\n          \/\/ calls or for self recursion within an SCC.\n          DSGraph &GI = getOrCreateGraph(*CalleeFunc);\n          ++NumCBUInlines;\n          G.mergeInGraph(CS, *CalleeFunc, GI, DSGraph::KeepModRefBits |\n                         DSGraph::StripAllocaBit | DSGraph::DontCloneCallNodes |\n                         DSGraph::DontCloneAuxCallNodes);\n          DEBUG(std::cerr << \"    Inlining graph [\" << i << \"\/\" << e-1\n                << \":\" << TNum << \"\/\" << Num-1 << \"] for \"\n                << CalleeFunc->getName() << \"[\"\n                << GI.getGraphSize() << \"+\" << GI.getAuxFunctionCalls().size()\n                << \"] into '\" \/*<< G.getFunctionNames()*\/ << \"' [\"\n                << G.getGraphSize() << \"+\" << G.getAuxFunctionCalls().size()\n                << \"]\\n\");\n        }\n      }\n    }\n  }\n\n  \/\/ Recompute the Incomplete markers\n  assert(G.getInlinedGlobals().empty());\n  G.maskIncompleteMarkers();\n  G.markIncompleteNodes(DSGraph::MarkFormalArgs);\n\n  \/\/ Delete dead nodes.  Treat globals that are unreachable but that can\n  \/\/ reach live nodes as live.\n  G.removeDeadNodes(DSGraph::RemoveUnreachableGlobals);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"vtrc-call-context.h\"\n\nnamespace vtrc { namespace common {\n\n    struct call_context::impl {\n\n    };\n\n    call_context::call_context( )\n        :impl_(new impl)\n    {}\n\n    call_context::call_context( const call_context &other )\n        :impl_(new impl(*other.impl_))\n    {}\n\n    call_context &call_context::operator = ( const call_context &other )\n    {\n        *impl_ = *other.impl_;\n    }\n\n    call_context::~call_context( )\n    {\n        delete impl_;\n    }\n\n}}\n\n<commit_msg>protocol<commit_after>#include \"vtrc-call-context.h\"\n\nnamespace vtrc { namespace common {\n\n    struct call_context::impl {\n\n    };\n\n    call_context::call_context( )\n        :impl_(new impl)\n    {}\n\n    call_context::call_context( const call_context &other )\n        :impl_(new impl(*other.impl_))\n    {}\n\n    call_context &call_context::operator = ( const call_context &other )\n    {\n        *impl_ = *other.impl_;\n        return *this;\n    }\n\n    call_context::~call_context( )\n    {\n        delete impl_;\n    }\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 \"qstringuneededheapallocations.h\"\n#include \"Utils.h\"\n#include \"StringUtils.h\"\n#include \"MethodSignatureUtils.h\"\n\n#include <clang\/AST\/DeclCXX.h>\n#include <clang\/AST\/ExprCXX.h>\n#include <clang\/AST\/Expr.h>\n#include <clang\/Basic\/Diagnostic.h>\n#include <clang\/Rewrite\/Frontend\/FixItRewriter.h>\n#include <clang\/Lex\/Lexer.h>\n#include <clang\/AST\/ParentMap.h>\n\n#include <iostream>\n\nusing namespace clang;\nusing namespace std;\n\nQStringUneededHeapAllocations::QStringUneededHeapAllocations(clang::CompilerInstance &ci)\n    : CheckBase(ci)\n{\n}\n\nvoid QStringUneededHeapAllocations::VisitStmt(clang::Stmt *stm)\n{\n    VisitCtor(stm);\n    VisitOperatorCall(stm);\n    VisitFromLatin1OrUtf8(stm);\n    VisitAssignOperatorQLatin1String(stm);\n}\n\nstd::string QStringUneededHeapAllocations::name() const\n{\n    return \"qstring-uneeded-heap-allocations\";\n}\n\nstatic bool betterTakeQLatin1String(CXXMethodDecl *method)\n{\n    \/\/ contains() is slower, don't include it\n    static const vector<string> methods = {\"append\", \"compare\", \"endsWith\", \"startsWith\", \"indexOf\", \"insert\", \"lastIndexOf\", \"prepend\", \"replace\" };\n\n    if (!isOfClass(method, \"QString\"))\n        return false;\n\n    return std::find(methods.cbegin(), methods.cend(), method->getNameAsString()) != methods.cend();\n}\n\n\/\/ Returns the first occurrence of a QLatin1String(char*) CTOR call\nstatic Stmt *qlatin1CtorExpr(Stmt *stm, ConditionalOperator * &ternary)\n{\n    if (stm == nullptr)\n        return nullptr;\n\n    CXXConstructExpr *constructExpr = dyn_cast<CXXConstructExpr>(stm);\n    if (constructExpr != nullptr) {\n        CXXConstructorDecl *ctor = constructExpr->getConstructor();\n        if (isOfClass(ctor, \"QLatin1String\") && hasCharPtrArgument(ctor, 1)) {\n            if (Utils::containsStringLiteral(constructExpr, \/*allowEmpty=*\/ false, 2))\n                return constructExpr;\n        }\n    }\n\n    if (ternary == nullptr) {\n        ternary = dyn_cast<ConditionalOperator>(stm);\n    }\n\n    auto it = stm->child_begin();\n    auto end = stm->child_end();\n\n    for (; it != end; ++it) {\n        auto expr = qlatin1CtorExpr(*it, ternary);\n        if (expr != nullptr)\n            return expr;\n    }\n\n    return nullptr;\n}\n\n\/\/ Returns true if there's a literal in the hierarchy, but aborts if it's parented on CallExpr\n\/\/ so, returns true for: QLatin1String(\"foo\") but false for QLatin1String(indirection(\"foo\"));\n\/\/\nstatic bool containsStringLiteralNoCallExpr(Stmt *stmt)\n{\n    if (stmt == nullptr)\n        return false;\n\n    StringLiteral *sl = dyn_cast<StringLiteral>(stmt);\n    if (sl != nullptr)\n        return true;\n\n    auto it = stmt->child_begin();\n    auto end = stmt->child_end();\n\n    for (; it != end; ++it) {\n        if (*it == nullptr)\n            continue;\n        CallExpr *callExpr = dyn_cast<CallExpr>(*it);\n        if (callExpr)\n            continue;\n\n        if (containsStringLiteralNoCallExpr(*it))\n            return true;\n    }\n\n    return false;\n}\n\n\/\/ For QString::fromLatin1(\"foo\") returns \"foo\"\nstatic StringLiteral* stringLiteralForCall(CallExpr *call)\n{\n    if (!call)\n        return nullptr;\n\n    vector<StringLiteral*> literals;\n    Utils::getChilds2(call, literals, 2);\n    return literals.empty() ? nullptr : literals[0];\n}\n\nvoid QStringUneededHeapAllocations::VisitCtor(Stmt *stm)\n{\n    CXXConstructExpr *ctorExpr = dyn_cast<CXXConstructExpr>(stm);\n    if (!Utils::containsStringLiteral(ctorExpr, \/**allowEmpty=*\/ true))\n        return;\n\n    CXXConstructorDecl *ctorDecl = ctorExpr->getConstructor();\n    if (!isOfClass(ctorDecl, \"QString\"))\n        return;\n\n    bool isQLatin1String = false;\n    string paramType;\n    if (hasCharPtrArgument(ctorDecl, 1)) {\n        paramType = \"const char*\";\n    } else if (hasArgumentOfType(ctorDecl, \"class QLatin1String\", 1)) {\n        paramType = \"QLatin1String\";\n        isQLatin1String = true;\n    } else {\n        return;\n    }\n\n    string msg = string(\"QString(\") + paramType + string(\") being called\");\n\n    if (isQLatin1String) {\n        ConditionalOperator *ternary = nullptr;\n        Stmt *begin = qlatin1CtorExpr(stm, ternary);\n        if (begin == nullptr) {\n            emitManualFixitWarning(stm->getLocStart());\n            return;\n        }\n\n        vector<FixItHint> fixits = ternary == nullptr ? fixItReplaceQLatin1StringWithQStringLiteral(begin)\n                                                      : fixItReplaceQLatin1StringWithQStringLiteralInTernary(ternary);\n\n        emitWarning(stm->getLocStart(), msg, fixits);\n    } else {\n        emitWarning(stm->getLocStart(), msg);\n    }\n}\n\nvector<FixItHint> QStringUneededHeapAllocations::fixItReplaceQLatin1StringWithQStringLiteral(clang::Stmt *begin)\n{\n    vector<FixItHint> fixits;\n    SourceLocation rangeStart = begin->getLocStart();\n    SourceLocation rangeEnd = Lexer::getLocForEndOfToken(rangeStart, -1, m_ci.getSourceManager(), m_ci.getLangOpts());\n\n    if (rangeEnd.isInvalid()) {\n        \/\/ Fallback. Have seen a case in the wild where the above would fail, it's very rare\n        rangeEnd = rangeStart.getLocWithOffset(sizeof(\"QLatin1String\") - 2);\n        if (rangeEnd.isInvalid()) {\n            StringUtils::printLocation(rangeStart);\n            StringUtils::printLocation(rangeEnd);\n            StringUtils::printLocation(Lexer::getLocForEndOfToken(rangeStart, 0, m_ci.getSourceManager(), m_ci.getLangOpts()));\n            emitManualFixitWarning(begin->getLocStart());\n        }\n    }\n\n    fixits.push_back(FixItHint::CreateReplacement(SourceRange(rangeStart, rangeEnd), \"QStringLiteral\"));\n\n    return fixits;\n}\n\nvector<FixItHint> QStringUneededHeapAllocations::fixItReplaceQLatin1StringWithQStringLiteralInTernary(clang::ConditionalOperator *ternary)\n{\n    vector<CXXConstructExpr*> constructExprs;\n    Utils::getChilds2<CXXConstructExpr>(ternary, constructExprs, 1); \/\/ depth = 1, only the two immediate expressions\n\n    vector<FixItHint> fixits;\n    fixits.reserve(2);\n    if (constructExprs.size() != 2) {\n        llvm::errs() << \"Weird ternary operator with \" << constructExprs.size() << \" at \" << ternary->getLocStart().printToString(m_ci.getSourceManager()) << \"\\n\";\n        assert(false);\n        return fixits;\n    }\n\n    for (int i = 0; i < 2; ++i) {\n        SourceLocation rangeStart = constructExprs[i]->getLocStart();\n        SourceLocation rangeEnd = Lexer::getLocForEndOfToken(rangeStart, -1, m_ci.getSourceManager(), m_ci.getLangOpts());\n        fixits.push_back(FixItHint::CreateReplacement(SourceRange(rangeStart, rangeEnd), \"QStringLiteral\"));\n    }\n\n    return fixits;}\n\n\n\/\/ true for: QString::fromLatin1().arg()\n\/\/ false for: QString::fromLatin1()\n\/\/ true for: QString s = QString::fromLatin1(\"foo\")\n\/\/ false for: s += QString::fromLatin1(\"foo\"), etc.\nstatic bool isQStringLiteralCandidate(Stmt *s, ParentMap *map, int currentCall = 0)\n{\n    if (s == nullptr)\n        return false;\n\n    MemberExpr *memberExpr = dyn_cast<MemberExpr>(s);\n    if (memberExpr) {\n        return true;\n    }\n\n    auto constructExpr = dyn_cast<CXXConstructExpr>(s);\n    if (constructExpr && isOfClass(constructExpr, \"QString\"))\n        return true;\n\n    if (Utils::isAssignOperator(dyn_cast<CXXOperatorCallExpr>(s), \"QString\", \"class QLatin1String\"))\n        return true;\n\n    if (Utils::isAssignOperator(dyn_cast<CXXOperatorCallExpr>(s), \"QString\", \"class QString &&\"))\n        return true;\n\n    CXXOperatorCallExpr *op = dyn_cast<CXXOperatorCallExpr>(s);\n    if (op)\n        return false;\n\n    CallExpr *callExpr = dyn_cast<CallExpr>(s);\n    if (currentCall > 0 && callExpr) {\n\n        auto fDecl = callExpr->getDirectCallee();\n        if (fDecl && betterTakeQLatin1String(dyn_cast<CXXMethodDecl>(fDecl)))\n            return false;\n\n        return true;\n    }\n\n    if (currentCall == 0 || dyn_cast<ImplicitCastExpr>(s) || dyn_cast<CXXBindTemporaryExpr>(s) || dyn_cast<MaterializeTemporaryExpr>(s)) \/\/ skip this cruft\n        return isQStringLiteralCandidate(Utils::parent(map, s), map, currentCall + 1);\n\n    return false;\n}\n\nstd::vector<FixItHint> QStringUneededHeapAllocations::fixItReplaceFromLatin1OrFromUtf8(CallExpr *callExpr)\n{\n    vector<FixItHint> fixits;\n\n    const std::string replacement = isQStringLiteralCandidate(callExpr, m_parentMap) ? \"QStringLiteral\"\n                                                                                     : \"QLatin1String\";\n\n    StringLiteral *literal = stringLiteralForCall(callExpr);\n    if (literal) {\n        auto classNameLoc = Lexer::getLocForEndOfToken(callExpr->getLocStart(), 0, m_ci.getSourceManager(), m_ci.getLangOpts());\n        auto scopeOperatorLoc = Lexer::getLocForEndOfToken(classNameLoc, 0, m_ci.getSourceManager(), m_ci.getLangOpts());\n        auto methodNameLoc = Lexer::getLocForEndOfToken(scopeOperatorLoc, -1, m_ci.getSourceManager(), m_ci.getLangOpts());\n        \/\/ llvm::errs() << \"end location would be \"; StringUtils::printLocation(methodNameLoc);\n\n        SourceRange range(callExpr->getLocStart(), methodNameLoc);\n        fixits.push_back(FixItHint::CreateReplacement(range, replacement));\n    } else {\n        emitManualFixitWarning(callExpr->getLocStart());\n    }\n\n    return fixits;\n}\n\nvoid QStringUneededHeapAllocations::VisitOperatorCall(Stmt *stm)\n{\n    CXXOperatorCallExpr *operatorCall = dyn_cast<CXXOperatorCallExpr>(stm);\n    if (operatorCall == nullptr)\n        return;\n\n    std::vector<StringLiteral*> stringLiterals;\n    Utils::getChilds2<StringLiteral>(operatorCall, stringLiterals);\n\n    \/\/  We're only after string literals, str.contains(some_method_returning_const_char_is_fine())\n    if (stringLiterals.empty())\n        return;\n\n    FunctionDecl *funcDecl = operatorCall->getDirectCallee();\n    if (funcDecl == nullptr)\n        return;\n\n    CXXMethodDecl *methodDecl = dyn_cast<CXXMethodDecl>(funcDecl);\n    if (!isOfClass(methodDecl, \"QString\"))\n        return;\n\n    if (!hasCharPtrArgument(methodDecl))\n        return;\n\n    string msg = string(\"QString(const char*) being called\");\n    emitWarning(stm->getLocStart(), msg);\n}\n\nvoid QStringUneededHeapAllocations::VisitFromLatin1OrUtf8(Stmt *stmt)\n{\n    CallExpr *callExpr = dyn_cast<CallExpr>(stmt);\n    if (callExpr == nullptr)\n        return;\n\n    FunctionDecl *functionDecl = callExpr->getDirectCallee();\n    if (!StringUtils::functionIsOneOf(functionDecl, {\"fromLatin1\", \"fromUtf8\"}))\n        return;\n\n    CXXMethodDecl *methodDecl = dyn_cast<CXXMethodDecl>(functionDecl);\n    if (!isOfClass(methodDecl, \"QString\"))\n        return;\n\n    if (!Utils::callHasDefaultArguments(callExpr) || !hasCharPtrArgument(functionDecl, 2)) \/\/ QString::fromLatin1(\"foo\", 1) is ok\n        return;\n\n    if (!containsStringLiteralNoCallExpr(callExpr))\n        return;\n\n    vector<ConditionalOperator*> ternaries;\n    Utils::getChilds2(callExpr, ternaries, 2);\n    if (!ternaries.empty()) {\n        auto ternary = ternaries[0];\n        if (Utils::ternaryOperatorIsOfStringLiteral(ternary)) {\n            emitWarning(stmt->getLocStart(), string(\"QString::fromLatin1() being passed a literal\"));\n        }\n\n        return;\n    }\n\n    std::vector<FixItHint> fixits = fixItReplaceFromLatin1OrFromUtf8(callExpr);\n\n    if (functionDecl->getNameAsString() == \"fromLatin1\") {\n        emitWarning(stmt->getLocStart(), string(\"QString::fromLatin1() being passed a literal\"), fixits);\n    } else {\n        emitWarning(stmt->getLocStart(), string(\"QString::fromUtf8() being passed a literal\"), fixits);\n    }\n}\n\nvoid QStringUneededHeapAllocations::VisitAssignOperatorQLatin1String(Stmt *stmt)\n{\n    CXXOperatorCallExpr *callExpr = dyn_cast<CXXOperatorCallExpr>(stmt);\n    if (!Utils::isAssignOperator(callExpr, \"QString\", \"class QLatin1String\"))\n        return;\n\n\n    if (!containsStringLiteralNoCallExpr(stmt))\n        return;\n\n    ConditionalOperator *ternary = nullptr;\n    Stmt *begin = qlatin1CtorExpr(stmt, ternary);\n\n    if (begin == nullptr)\n        return;\n\n    vector<FixItHint> fixits = ternary == nullptr ? fixItReplaceQLatin1StringWithQStringLiteral(begin)\n                                                  : fixItReplaceQLatin1StringWithQStringLiteralInTernary(ternary);\n\n    emitWarning(stmt->getLocStart(), string(\"QString::operator=(QLatin1String(\\\"literal\\\")\"), fixits);\n}\n<commit_msg>qstring-uneeded-heap-allocations: Remove false warning<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 \"qstringuneededheapallocations.h\"\n#include \"Utils.h\"\n#include \"StringUtils.h\"\n#include \"MethodSignatureUtils.h\"\n\n#include <clang\/AST\/DeclCXX.h>\n#include <clang\/AST\/ExprCXX.h>\n#include <clang\/AST\/Expr.h>\n#include <clang\/Basic\/Diagnostic.h>\n#include <clang\/Rewrite\/Frontend\/FixItRewriter.h>\n#include <clang\/Lex\/Lexer.h>\n#include <clang\/AST\/ParentMap.h>\n\n#include <iostream>\n\nusing namespace clang;\nusing namespace std;\n\nQStringUneededHeapAllocations::QStringUneededHeapAllocations(clang::CompilerInstance &ci)\n    : CheckBase(ci)\n{\n}\n\nvoid QStringUneededHeapAllocations::VisitStmt(clang::Stmt *stm)\n{\n    VisitCtor(stm);\n    VisitOperatorCall(stm);\n    VisitFromLatin1OrUtf8(stm);\n    VisitAssignOperatorQLatin1String(stm);\n}\n\nstd::string QStringUneededHeapAllocations::name() const\n{\n    return \"qstring-uneeded-heap-allocations\";\n}\n\nstatic bool betterTakeQLatin1String(CXXMethodDecl *method)\n{\n    \/\/ contains() is slower, don't include it\n    static const vector<string> methods = {\"append\", \"compare\", \"endsWith\", \"startsWith\", \"indexOf\", \"insert\", \"lastIndexOf\", \"prepend\", \"replace\" };\n\n    if (!isOfClass(method, \"QString\"))\n        return false;\n\n    return std::find(methods.cbegin(), methods.cend(), method->getNameAsString()) != methods.cend();\n}\n\n\/\/ Returns the first occurrence of a QLatin1String(char*) CTOR call\nstatic Stmt *qlatin1CtorExpr(Stmt *stm, ConditionalOperator * &ternary)\n{\n    if (stm == nullptr)\n        return nullptr;\n\n    CXXConstructExpr *constructExpr = dyn_cast<CXXConstructExpr>(stm);\n    if (constructExpr != nullptr) {\n        CXXConstructorDecl *ctor = constructExpr->getConstructor();\n        if (isOfClass(ctor, \"QLatin1String\") && hasCharPtrArgument(ctor, 1)) {\n            if (Utils::containsStringLiteral(constructExpr, \/*allowEmpty=*\/ false, 2))\n                return constructExpr;\n        }\n    }\n\n    if (ternary == nullptr) {\n        ternary = dyn_cast<ConditionalOperator>(stm);\n    }\n\n    auto it = stm->child_begin();\n    auto end = stm->child_end();\n\n    for (; it != end; ++it) {\n        auto expr = qlatin1CtorExpr(*it, ternary);\n        if (expr != nullptr)\n            return expr;\n    }\n\n    return nullptr;\n}\n\n\/\/ Returns true if there's a literal in the hierarchy, but aborts if it's parented on CallExpr\n\/\/ so, returns true for: QLatin1String(\"foo\") but false for QLatin1String(indirection(\"foo\"));\n\/\/\nstatic bool containsStringLiteralNoCallExpr(Stmt *stmt)\n{\n    if (stmt == nullptr)\n        return false;\n\n    StringLiteral *sl = dyn_cast<StringLiteral>(stmt);\n    if (sl != nullptr)\n        return true;\n\n    auto it = stmt->child_begin();\n    auto end = stmt->child_end();\n\n    for (; it != end; ++it) {\n        if (*it == nullptr)\n            continue;\n        CallExpr *callExpr = dyn_cast<CallExpr>(*it);\n        if (callExpr)\n            continue;\n\n        if (containsStringLiteralNoCallExpr(*it))\n            return true;\n    }\n\n    return false;\n}\n\n\/\/ For QString::fromLatin1(\"foo\") returns \"foo\"\nstatic StringLiteral* stringLiteralForCall(CallExpr *call)\n{\n    if (!call)\n        return nullptr;\n\n    vector<StringLiteral*> literals;\n    Utils::getChilds2(call, literals, 2);\n    return literals.empty() ? nullptr : literals[0];\n}\n\nvoid QStringUneededHeapAllocations::VisitCtor(Stmt *stm)\n{\n    CXXConstructExpr *ctorExpr = dyn_cast<CXXConstructExpr>(stm);\n    if (!Utils::containsStringLiteral(ctorExpr, \/**allowEmpty=*\/ true))\n        return;\n\n    CXXConstructorDecl *ctorDecl = ctorExpr->getConstructor();\n    if (!isOfClass(ctorDecl, \"QString\"))\n        return;\n\n    bool isQLatin1String = false;\n    string paramType;\n    if (hasCharPtrArgument(ctorDecl, 1)) {\n        paramType = \"const char*\";\n    } else if (hasArgumentOfType(ctorDecl, \"class QLatin1String\", 1)) {\n        paramType = \"QLatin1String\";\n        isQLatin1String = true;\n    } else {\n        return;\n    }\n\n    string msg = string(\"QString(\") + paramType + string(\") being called\");\n\n    if (isQLatin1String) {\n        ConditionalOperator *ternary = nullptr;\n        Stmt *begin = qlatin1CtorExpr(stm, ternary);\n        if (begin == nullptr) {\n            return;\n        }\n\n        vector<FixItHint> fixits = ternary == nullptr ? fixItReplaceQLatin1StringWithQStringLiteral(begin)\n                                                      : fixItReplaceQLatin1StringWithQStringLiteralInTernary(ternary);\n\n        emitWarning(stm->getLocStart(), msg, fixits);\n    } else {\n        emitWarning(stm->getLocStart(), msg);\n    }\n}\n\nvector<FixItHint> QStringUneededHeapAllocations::fixItReplaceQLatin1StringWithQStringLiteral(clang::Stmt *begin)\n{\n    vector<FixItHint> fixits;\n    SourceLocation rangeStart = begin->getLocStart();\n    SourceLocation rangeEnd = Lexer::getLocForEndOfToken(rangeStart, -1, m_ci.getSourceManager(), m_ci.getLangOpts());\n\n    if (rangeEnd.isInvalid()) {\n        \/\/ Fallback. Have seen a case in the wild where the above would fail, it's very rare\n        rangeEnd = rangeStart.getLocWithOffset(sizeof(\"QLatin1String\") - 2);\n        if (rangeEnd.isInvalid()) {\n            StringUtils::printLocation(rangeStart);\n            StringUtils::printLocation(rangeEnd);\n            StringUtils::printLocation(Lexer::getLocForEndOfToken(rangeStart, 0, m_ci.getSourceManager(), m_ci.getLangOpts()));\n            emitManualFixitWarning(begin->getLocStart());\n        }\n    }\n\n    fixits.push_back(FixItHint::CreateReplacement(SourceRange(rangeStart, rangeEnd), \"QStringLiteral\"));\n\n    return fixits;\n}\n\nvector<FixItHint> QStringUneededHeapAllocations::fixItReplaceQLatin1StringWithQStringLiteralInTernary(clang::ConditionalOperator *ternary)\n{\n    vector<CXXConstructExpr*> constructExprs;\n    Utils::getChilds2<CXXConstructExpr>(ternary, constructExprs, 1); \/\/ depth = 1, only the two immediate expressions\n\n    vector<FixItHint> fixits;\n    fixits.reserve(2);\n    if (constructExprs.size() != 2) {\n        llvm::errs() << \"Weird ternary operator with \" << constructExprs.size() << \" at \" << ternary->getLocStart().printToString(m_ci.getSourceManager()) << \"\\n\";\n        assert(false);\n        return fixits;\n    }\n\n    for (int i = 0; i < 2; ++i) {\n        SourceLocation rangeStart = constructExprs[i]->getLocStart();\n        SourceLocation rangeEnd = Lexer::getLocForEndOfToken(rangeStart, -1, m_ci.getSourceManager(), m_ci.getLangOpts());\n        fixits.push_back(FixItHint::CreateReplacement(SourceRange(rangeStart, rangeEnd), \"QStringLiteral\"));\n    }\n\n    return fixits;}\n\n\n\/\/ true for: QString::fromLatin1().arg()\n\/\/ false for: QString::fromLatin1()\n\/\/ true for: QString s = QString::fromLatin1(\"foo\")\n\/\/ false for: s += QString::fromLatin1(\"foo\"), etc.\nstatic bool isQStringLiteralCandidate(Stmt *s, ParentMap *map, int currentCall = 0)\n{\n    if (s == nullptr)\n        return false;\n\n    MemberExpr *memberExpr = dyn_cast<MemberExpr>(s);\n    if (memberExpr) {\n        return true;\n    }\n\n    auto constructExpr = dyn_cast<CXXConstructExpr>(s);\n    if (constructExpr && isOfClass(constructExpr, \"QString\"))\n        return true;\n\n    if (Utils::isAssignOperator(dyn_cast<CXXOperatorCallExpr>(s), \"QString\", \"class QLatin1String\"))\n        return true;\n\n    if (Utils::isAssignOperator(dyn_cast<CXXOperatorCallExpr>(s), \"QString\", \"class QString &&\"))\n        return true;\n\n    CXXOperatorCallExpr *op = dyn_cast<CXXOperatorCallExpr>(s);\n    if (op)\n        return false;\n\n    CallExpr *callExpr = dyn_cast<CallExpr>(s);\n    if (currentCall > 0 && callExpr) {\n\n        auto fDecl = callExpr->getDirectCallee();\n        if (fDecl && betterTakeQLatin1String(dyn_cast<CXXMethodDecl>(fDecl)))\n            return false;\n\n        return true;\n    }\n\n    if (currentCall == 0 || dyn_cast<ImplicitCastExpr>(s) || dyn_cast<CXXBindTemporaryExpr>(s) || dyn_cast<MaterializeTemporaryExpr>(s)) \/\/ skip this cruft\n        return isQStringLiteralCandidate(Utils::parent(map, s), map, currentCall + 1);\n\n    return false;\n}\n\nstd::vector<FixItHint> QStringUneededHeapAllocations::fixItReplaceFromLatin1OrFromUtf8(CallExpr *callExpr)\n{\n    vector<FixItHint> fixits;\n\n    const std::string replacement = isQStringLiteralCandidate(callExpr, m_parentMap) ? \"QStringLiteral\"\n                                                                                     : \"QLatin1String\";\n\n    StringLiteral *literal = stringLiteralForCall(callExpr);\n    if (literal) {\n        auto classNameLoc = Lexer::getLocForEndOfToken(callExpr->getLocStart(), 0, m_ci.getSourceManager(), m_ci.getLangOpts());\n        auto scopeOperatorLoc = Lexer::getLocForEndOfToken(classNameLoc, 0, m_ci.getSourceManager(), m_ci.getLangOpts());\n        auto methodNameLoc = Lexer::getLocForEndOfToken(scopeOperatorLoc, -1, m_ci.getSourceManager(), m_ci.getLangOpts());\n        \/\/ llvm::errs() << \"end location would be \"; StringUtils::printLocation(methodNameLoc);\n\n        SourceRange range(callExpr->getLocStart(), methodNameLoc);\n        fixits.push_back(FixItHint::CreateReplacement(range, replacement));\n    } else {\n        emitManualFixitWarning(callExpr->getLocStart());\n    }\n\n    return fixits;\n}\n\nvoid QStringUneededHeapAllocations::VisitOperatorCall(Stmt *stm)\n{\n    CXXOperatorCallExpr *operatorCall = dyn_cast<CXXOperatorCallExpr>(stm);\n    if (operatorCall == nullptr)\n        return;\n\n    std::vector<StringLiteral*> stringLiterals;\n    Utils::getChilds2<StringLiteral>(operatorCall, stringLiterals);\n\n    \/\/  We're only after string literals, str.contains(some_method_returning_const_char_is_fine())\n    if (stringLiterals.empty())\n        return;\n\n    FunctionDecl *funcDecl = operatorCall->getDirectCallee();\n    if (funcDecl == nullptr)\n        return;\n\n    CXXMethodDecl *methodDecl = dyn_cast<CXXMethodDecl>(funcDecl);\n    if (!isOfClass(methodDecl, \"QString\"))\n        return;\n\n    if (!hasCharPtrArgument(methodDecl))\n        return;\n\n    string msg = string(\"QString(const char*) being called\");\n    emitWarning(stm->getLocStart(), msg);\n}\n\nvoid QStringUneededHeapAllocations::VisitFromLatin1OrUtf8(Stmt *stmt)\n{\n    CallExpr *callExpr = dyn_cast<CallExpr>(stmt);\n    if (callExpr == nullptr)\n        return;\n\n    FunctionDecl *functionDecl = callExpr->getDirectCallee();\n    if (!StringUtils::functionIsOneOf(functionDecl, {\"fromLatin1\", \"fromUtf8\"}))\n        return;\n\n    CXXMethodDecl *methodDecl = dyn_cast<CXXMethodDecl>(functionDecl);\n    if (!isOfClass(methodDecl, \"QString\"))\n        return;\n\n    if (!Utils::callHasDefaultArguments(callExpr) || !hasCharPtrArgument(functionDecl, 2)) \/\/ QString::fromLatin1(\"foo\", 1) is ok\n        return;\n\n    if (!containsStringLiteralNoCallExpr(callExpr))\n        return;\n\n    vector<ConditionalOperator*> ternaries;\n    Utils::getChilds2(callExpr, ternaries, 2);\n    if (!ternaries.empty()) {\n        auto ternary = ternaries[0];\n        if (Utils::ternaryOperatorIsOfStringLiteral(ternary)) {\n            emitWarning(stmt->getLocStart(), string(\"QString::fromLatin1() being passed a literal\"));\n        }\n\n        return;\n    }\n\n    std::vector<FixItHint> fixits = fixItReplaceFromLatin1OrFromUtf8(callExpr);\n\n    if (functionDecl->getNameAsString() == \"fromLatin1\") {\n        emitWarning(stmt->getLocStart(), string(\"QString::fromLatin1() being passed a literal\"), fixits);\n    } else {\n        emitWarning(stmt->getLocStart(), string(\"QString::fromUtf8() being passed a literal\"), fixits);\n    }\n}\n\nvoid QStringUneededHeapAllocations::VisitAssignOperatorQLatin1String(Stmt *stmt)\n{\n    CXXOperatorCallExpr *callExpr = dyn_cast<CXXOperatorCallExpr>(stmt);\n    if (!Utils::isAssignOperator(callExpr, \"QString\", \"class QLatin1String\"))\n        return;\n\n\n    if (!containsStringLiteralNoCallExpr(stmt))\n        return;\n\n    ConditionalOperator *ternary = nullptr;\n    Stmt *begin = qlatin1CtorExpr(stmt, ternary);\n\n    if (begin == nullptr)\n        return;\n\n    vector<FixItHint> fixits = ternary == nullptr ? fixItReplaceQLatin1StringWithQStringLiteral(begin)\n                                                  : fixItReplaceQLatin1StringWithQStringLiteralInTernary(ternary);\n\n    emitWarning(stmt->getLocStart(), string(\"QString::operator=(QLatin1String(\\\"literal\\\")\"), fixits);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\r\n\/\/ Use of this source code is governed by a BSD-style license that can be\r\n\/\/ found in the LICENSE file.\r\n\r\n#include \"chrome\/browser\/dom_ui\/new_tab_ui.h\"\r\n#include \"chrome\/browser\/renderer_host\/test_render_view_host.h\"\r\n#include \"chrome\/common\/url_constants.h\"\r\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\r\n\r\nclass DOMUITest : public RenderViewHostTestHarness {\r\n public:\r\n  DOMUITest() {}\r\n\r\n private:\r\n  DISALLOW_COPY_AND_ASSIGN(DOMUITest);\r\n};\r\n\r\n\/\/ Tests that the New Tab Page flags are correctly set and propogated by\r\n\/\/ WebContents when we first navigate to a DOM UI page, then to a standard\r\n\/\/ non-DOM-UI page.\r\nTEST_F(DOMUITest, DOMUIToStandard) {\r\n  \/\/ Start a pending load.\r\n  GURL new_tab_url(chrome::kChromeUINewTabURL);\r\n  controller()->LoadURL(new_tab_url, GURL(), PageTransition::LINK);\r\n\r\n  \/\/ The navigation entry should be pending with no committed entry.\r\n  ASSERT_TRUE(controller()->GetPendingEntry());\r\n  ASSERT_FALSE(controller()->GetLastCommittedEntry());\r\n\r\n  \/\/ Check the things the pending DOM UI should have set.\r\n  EXPECT_FALSE(contents()->ShouldDisplayURL());\r\n  EXPECT_FALSE(contents()->ShouldDisplayFavIcon());\r\n  EXPECT_TRUE(contents()->IsBookmarkBarAlwaysVisible());\r\n  EXPECT_TRUE(contents()->FocusLocationBarByDefault());\r\n\r\n  \/\/ Now commit the load.\r\n  rvh()->SendNavigate(1, new_tab_url);\r\n\r\n  \/\/ The same flags should be set as before now that the load has committed.\r\n  \/\/ Note that the location bar isn't focused now. Once the load commits, we\r\n  \/\/ don't care about this flag, so this value is OK.\r\n  EXPECT_FALSE(contents()->ShouldDisplayURL());\r\n  EXPECT_FALSE(contents()->ShouldDisplayFavIcon());\r\n  EXPECT_TRUE(contents()->IsBookmarkBarAlwaysVisible());\r\n  EXPECT_FALSE(contents()->FocusLocationBarByDefault());\r\n\r\n  \/\/ Start a pending navigation to a regular page.\r\n  GURL next_url(\"http:\/\/google.com\/\");\r\n  controller()->LoadURL(next_url, GURL(), PageTransition::LINK);\r\n\r\n  \/\/ Check the flags. Some should reflect the new page (URL, title), some should\r\n  \/\/ reflect the old one (bookmark bar) until it has committed.\r\n  EXPECT_TRUE(contents()->ShouldDisplayURL());\r\n  EXPECT_TRUE(contents()->ShouldDisplayFavIcon());\r\n  EXPECT_TRUE(contents()->IsBookmarkBarAlwaysVisible());\r\n  EXPECT_FALSE(contents()->FocusLocationBarByDefault());\r\n\r\n  \/\/ Commit the regular page load. Note that we must send it to the \"pending\"\r\n  \/\/ RenderViewHost, since this transition will also cause a process transition,\r\n  \/\/ and our RVH pointer will be the \"committed\" one.\r\n  static_cast<TestRenderViewHost*>(\r\n      contents()->render_manager()->pending_render_view_host())->SendNavigate(\r\n          2, next_url);\r\n\r\n  \/\/ The state should now reflect a regular page.\r\n  EXPECT_TRUE(contents()->ShouldDisplayURL());\r\n  EXPECT_TRUE(contents()->ShouldDisplayFavIcon());\r\n  EXPECT_FALSE(contents()->IsBookmarkBarAlwaysVisible());\r\n  EXPECT_FALSE(contents()->FocusLocationBarByDefault());\r\n}\r\n\r\nTEST_F(DOMUITest, DOMUIToDOMUI) {\r\n  \/\/ Do a load (this state is tested above).\r\n  GURL new_tab_url(chrome::kChromeUINewTabURL);\r\n  controller()->LoadURL(new_tab_url, GURL(), PageTransition::LINK);\r\n  rvh()->SendNavigate(1, new_tab_url);\r\n\r\n  \/\/ Start another pending load of the new tab page.\r\n  controller()->LoadURL(new_tab_url, GURL(), PageTransition::LINK);\r\n  rvh()->SendNavigate(2, new_tab_url);\r\n\r\n  \/\/ The flags should be the same as the non-pending state.\r\n  EXPECT_FALSE(contents()->ShouldDisplayURL());\r\n  EXPECT_FALSE(contents()->ShouldDisplayFavIcon());\r\n  EXPECT_TRUE(contents()->IsBookmarkBarAlwaysVisible());\r\n  EXPECT_FALSE(contents()->FocusLocationBarByDefault());\r\n}\r\n\r\nTEST_F(DOMUITest, StandardToDOMUI) {\r\n  \/\/ Start a pending navigation to a regular page.\r\n  GURL std_url(\"http:\/\/google.com\/\");\r\n  controller()->LoadURL(std_url, GURL(), PageTransition::LINK);\r\n\r\n  \/\/ The state should now reflect the default.\r\n  EXPECT_TRUE(contents()->ShouldDisplayURL());\r\n  EXPECT_TRUE(contents()->ShouldDisplayFavIcon());\r\n  EXPECT_FALSE(contents()->IsBookmarkBarAlwaysVisible());\r\n  EXPECT_FALSE(contents()->FocusLocationBarByDefault());\r\n\r\n  \/\/ Commit the load, the state should be the same.\r\n  rvh()->SendNavigate(1, std_url);\r\n  EXPECT_TRUE(contents()->ShouldDisplayURL());\r\n  EXPECT_TRUE(contents()->ShouldDisplayFavIcon());\r\n  EXPECT_FALSE(contents()->IsBookmarkBarAlwaysVisible());\r\n  EXPECT_FALSE(contents()->FocusLocationBarByDefault());\r\n\r\n  \/\/ Start a pending load for a DOMUI.\r\n  GURL new_tab_url(chrome::kChromeUINewTabURL);\r\n  controller()->LoadURL(new_tab_url, GURL(), PageTransition::LINK);\r\n  EXPECT_FALSE(contents()->ShouldDisplayURL());\r\n  EXPECT_FALSE(contents()->ShouldDisplayFavIcon());\r\n  EXPECT_FALSE(contents()->IsBookmarkBarAlwaysVisible());\r\n  EXPECT_TRUE(contents()->FocusLocationBarByDefault());\r\n\r\n  \/\/ Committing DOM UI is tested above.\r\n}\r\n<commit_msg>Fix lineendings for dom ui unittest. Review URL: http:\/\/codereview.chromium.org\/55037<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\/dom_ui\/new_tab_ui.h\"\n#include \"chrome\/browser\/renderer_host\/test_render_view_host.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nclass DOMUITest : public RenderViewHostTestHarness {\n public:\n  DOMUITest() {}\n\n private:\n  DISALLOW_COPY_AND_ASSIGN(DOMUITest);\n};\n\n\/\/ Tests that the New Tab Page flags are correctly set and propogated by\n\/\/ WebContents when we first navigate to a DOM UI page, then to a standard\n\/\/ non-DOM-UI page.\nTEST_F(DOMUITest, DOMUIToStandard) {\n  \/\/ Start a pending load.\n  GURL new_tab_url(chrome::kChromeUINewTabURL);\n  controller()->LoadURL(new_tab_url, GURL(), PageTransition::LINK);\n\n  \/\/ The navigation entry should be pending with no committed entry.\n  ASSERT_TRUE(controller()->GetPendingEntry());\n  ASSERT_FALSE(controller()->GetLastCommittedEntry());\n\n  \/\/ Check the things the pending DOM UI should have set.\n  EXPECT_FALSE(contents()->ShouldDisplayURL());\n  EXPECT_FALSE(contents()->ShouldDisplayFavIcon());\n  EXPECT_TRUE(contents()->IsBookmarkBarAlwaysVisible());\n  EXPECT_TRUE(contents()->FocusLocationBarByDefault());\n\n  \/\/ Now commit the load.\n  rvh()->SendNavigate(1, new_tab_url);\n\n  \/\/ The same flags should be set as before now that the load has committed.\n  \/\/ Note that the location bar isn't focused now. Once the load commits, we\n  \/\/ don't care about this flag, so this value is OK.\n  EXPECT_FALSE(contents()->ShouldDisplayURL());\n  EXPECT_FALSE(contents()->ShouldDisplayFavIcon());\n  EXPECT_TRUE(contents()->IsBookmarkBarAlwaysVisible());\n  EXPECT_FALSE(contents()->FocusLocationBarByDefault());\n\n  \/\/ Start a pending navigation to a regular page.\n  GURL next_url(\"http:\/\/google.com\/\");\n  controller()->LoadURL(next_url, GURL(), PageTransition::LINK);\n\n  \/\/ Check the flags. Some should reflect the new page (URL, title), some should\n  \/\/ reflect the old one (bookmark bar) until it has committed.\n  EXPECT_TRUE(contents()->ShouldDisplayURL());\n  EXPECT_TRUE(contents()->ShouldDisplayFavIcon());\n  EXPECT_TRUE(contents()->IsBookmarkBarAlwaysVisible());\n  EXPECT_FALSE(contents()->FocusLocationBarByDefault());\n\n  \/\/ Commit the regular page load. Note that we must send it to the \"pending\"\n  \/\/ RenderViewHost, since this transition will also cause a process transition,\n  \/\/ and our RVH pointer will be the \"committed\" one.\n  static_cast<TestRenderViewHost*>(\n      contents()->render_manager()->pending_render_view_host())->SendNavigate(\n          2, next_url);\n\n  \/\/ The state should now reflect a regular page.\n  EXPECT_TRUE(contents()->ShouldDisplayURL());\n  EXPECT_TRUE(contents()->ShouldDisplayFavIcon());\n  EXPECT_FALSE(contents()->IsBookmarkBarAlwaysVisible());\n  EXPECT_FALSE(contents()->FocusLocationBarByDefault());\n}\n\nTEST_F(DOMUITest, DOMUIToDOMUI) {\n  \/\/ Do a load (this state is tested above).\n  GURL new_tab_url(chrome::kChromeUINewTabURL);\n  controller()->LoadURL(new_tab_url, GURL(), PageTransition::LINK);\n  rvh()->SendNavigate(1, new_tab_url);\n\n  \/\/ Start another pending load of the new tab page.\n  controller()->LoadURL(new_tab_url, GURL(), PageTransition::LINK);\n  rvh()->SendNavigate(2, new_tab_url);\n\n  \/\/ The flags should be the same as the non-pending state.\n  EXPECT_FALSE(contents()->ShouldDisplayURL());\n  EXPECT_FALSE(contents()->ShouldDisplayFavIcon());\n  EXPECT_TRUE(contents()->IsBookmarkBarAlwaysVisible());\n  EXPECT_FALSE(contents()->FocusLocationBarByDefault());\n}\n\nTEST_F(DOMUITest, StandardToDOMUI) {\n  \/\/ Start a pending navigation to a regular page.\n  GURL std_url(\"http:\/\/google.com\/\");\n  controller()->LoadURL(std_url, GURL(), PageTransition::LINK);\n\n  \/\/ The state should now reflect the default.\n  EXPECT_TRUE(contents()->ShouldDisplayURL());\n  EXPECT_TRUE(contents()->ShouldDisplayFavIcon());\n  EXPECT_FALSE(contents()->IsBookmarkBarAlwaysVisible());\n  EXPECT_FALSE(contents()->FocusLocationBarByDefault());\n\n  \/\/ Commit the load, the state should be the same.\n  rvh()->SendNavigate(1, std_url);\n  EXPECT_TRUE(contents()->ShouldDisplayURL());\n  EXPECT_TRUE(contents()->ShouldDisplayFavIcon());\n  EXPECT_FALSE(contents()->IsBookmarkBarAlwaysVisible());\n  EXPECT_FALSE(contents()->FocusLocationBarByDefault());\n\n  \/\/ Start a pending load for a DOMUI.\n  GURL new_tab_url(chrome::kChromeUINewTabURL);\n  controller()->LoadURL(new_tab_url, GURL(), PageTransition::LINK);\n  EXPECT_FALSE(contents()->ShouldDisplayURL());\n  EXPECT_FALSE(contents()->ShouldDisplayFavIcon());\n  EXPECT_FALSE(contents()->IsBookmarkBarAlwaysVisible());\n  EXPECT_TRUE(contents()->FocusLocationBarByDefault());\n\n  \/\/ Committing DOM UI is tested above.\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ $Id: mesh_refinement_flagging.C,v 1.12 2004-11-08 00:11:05 jwpeterson Exp $\n\n\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2004  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 \"libmesh_config.h\"\n\n\/\/ only compile these functions if the user requests AMR support\n#ifdef ENABLE_AMR\n\n\/\/ C++ includes\n#include <algorithm> \/\/ for std::sort\n\n\/\/ Local includes\n#include \"error_vector.h\"\n#include \"mesh_refinement.h\"\n#include \"mesh_base.h\"\n#include \"elem.h\"\n\n\n\n\/\/-----------------------------------------------------------------\n\/\/ Mesh refinement methods\nvoid MeshRefinement::flag_elements_by_error_fraction (const ErrorVector& error_per_cell_in,\n\t\t\t\t\t\t      const Real refine_fraction,\n\t\t\t\t\t\t      const Real coarsen_fraction,\n\t\t\t\t\t\t      const unsigned int max_level)\n{\n  \/\/ Copy the input error_per_cell so that we can modify it\n  ErrorVector error_per_cell (error_per_cell_in);\n  \n  \/\/ Check for valid fractions..\n  \/\/ The fraction values must be in [0,1]\n  assert (refine_fraction  >= 0.);  assert (refine_fraction  <= 1.);\n  assert (coarsen_fraction >= 0.);  assert (coarsen_fraction <= 1.);\n\n  \/\/ Clean up the refinement flags.  These could be left\n  \/\/ over from previous refinement steps.\n  this->clean_refinement_flags();\n  \n\n\/\/   \/\/ Set the error_per_cell to zero for elements at the\n\/\/   \/\/ maximum allowable refinement level\n\/\/   {\n\/\/     active_elem_iterator       elem_it (_mesh.elements_begin());\n\/\/     const active_elem_iterator elem_end(_mesh.elements_end());\n\n\/\/     for (; elem_it != elem_end; ++elem_it)\n\/\/       {\n\/\/ \tElem* elem               = *elem_it;\n\/\/ \tconst unsigned int id    = elem->id();\n\/\/ \tconst unsigned int level = elem->level();\n\n\/\/ \tassert (id < error_per_cell.size());\n      \n\/\/ \tif (level >= max_level)\n\/\/ \t  error_per_cell[id] = 0.;\n\/\/       }\n\/\/   }\n  \n  \/\/ Get the minimum, maximum, and delta error values\n  \/\/ for the elements\n  const Real error_max   = error_per_cell.maximum();\n  const Real error_min   = error_per_cell.minimum();\n  const Real error_delta = (error_max - error_min);\n\n\n  \/\/ Compute the cutoff values for coarsening and refinement\n  const Real refine_cutoff  = (1.- refine_fraction)*error_max;\n  const Real coarsen_cutoff = coarsen_fraction*error_delta + error_min;\n\n\/\/   \/\/ Print information about the error\n\/\/   std::cout << \" Error Information:\"                     << std::endl\n\/\/ \t    << \" ------------------\"                     << std::endl\n\/\/ \t    << \"   min:              \" << error_min      << std::endl\n\/\/ \t    << \"   max:              \" << error_max      << std::endl\n\/\/ \t    << \"   delta:            \" << error_delta    << std::endl\n\/\/ \t    << \"     refine_cutoff:  \" << refine_cutoff  << std::endl\n\/\/ \t    << \"     coarsen_cutoff: \" << coarsen_cutoff << std::endl;\n  \n  \n\n  \/\/ Loop over the elements and flag them for coarsening or\n  \/\/ refinement based on the element error\n\/\/   active_elem_iterator       elem_it (_mesh.elements_begin());\n\/\/   const active_elem_iterator elem_end(_mesh.elements_end());\n\n  MeshBase::element_iterator       elem_it  = _mesh.active_elements_begin();\n  const MeshBase::element_iterator elem_end = _mesh.active_elements_end(); \n\n  for (; elem_it != elem_end; ++elem_it)\n    {\n      Elem* elem             = *elem_it;\n      const unsigned int id  = elem->id();\n\n      assert (id < error_per_cell.size());\n      \n      const float elem_error = error_per_cell[id];\n\n      \/\/ Flag the element for coarsening if its error\n      \/\/ is <= coarsen_fraction*delta + error_min\n      if (elem_error <= coarsen_cutoff)\n\t{\n\t  elem->set_refinement_flag(Elem::COARSEN);\n\t}\n      \n      \/\/ Flag the element for refinement if its error\n      \/\/ is >= refinement_cutoff.\n      if (elem_error >= refine_cutoff)\n\tif (elem->level() < max_level)\n\t  elem->set_refinement_flag(Elem::REFINE);\n    }\n}\n\n\n\nvoid MeshRefinement::flag_elements_by_elem_fraction (const ErrorVector& error_per_cell_in,\n\t\t\t\t\t\t     const Real refine_fraction,\n\t\t\t\t\t\t     const Real coarsen_fraction,\n\t\t\t\t\t\t     const unsigned int max_level)\n{\n  \/\/ Copy the input error_per_cell so that we can modify it\n  ErrorVector error_per_cell (error_per_cell_in);\n  \n  \/\/ Check for valid fractions..\n  \/\/ The fraction values must be in [0,1]\n  assert (refine_fraction  >= 0.);  assert (refine_fraction  <= 1.);\n  assert (coarsen_fraction >= 0.);  assert (coarsen_fraction <= 1.);\n\n  \/\/ The number of active elements in the mesh\n  const unsigned int n_active_elem  = _mesh.n_elem();\n\n  \/\/ The number of elements to flag for coarsening\n  const unsigned int n_elem_coarsen = static_cast<unsigned int>(coarsen_fraction * n_active_elem);\n\n  \/\/ The number of elements to flag for refinement\n  const unsigned int n_elem_refine  = static_cast<unsigned int>(refine_fraction  * n_active_elem);\n\n\n  \n  \/\/ Clean up the refinement flags.  These could be left\n  \/\/ over from previous refinement steps.\n  this->clean_refinement_flags();\n\n\n\n\/\/   \/\/ Set the error_per_cell to zero for elements at the\n\/\/   \/\/ maximum allowable refinement level\n\/\/   {\n\/\/     active_elem_iterator       elem_it (_mesh.elements_begin());\n\/\/     const active_elem_iterator elem_end(_mesh.elements_end());\n\n\/\/     for (; elem_it != elem_end; ++elem_it)\n\/\/       {\n\/\/ \tElem* elem               = *elem_it;\n\/\/ \tconst unsigned int id    = elem->id();\n\/\/ \tconst unsigned int level = elem->level();\n\n\/\/ \tassert (id < error_per_cell.size());\n      \n\/\/ \tif (level >= max_level)\n\/\/ \t  error_per_cell[id] = 0.;\n\/\/       }\n\/\/   }\n  \n  \/\/ This vector stores the error and element number for all the\n  \/\/ active elements.  It will be sorted and the top & bottom\n  \/\/ elements will then be flagged for coarsening & refinement\n  std::vector<float> sorted_error;\n\n  sorted_error.reserve (n_active_elem);\n\n  \/\/ Loop over the active elements and create the entry\n  \/\/ in the sorted_error vector\n\/\/   const_active_elem_iterator       elem_it (_mesh.const_elements_begin());\n\/\/   const const_active_elem_iterator elem_end(_mesh.const_elements_end());\n\n  MeshBase::element_iterator       elem_it  = _mesh.active_elements_begin();\n  const MeshBase::element_iterator elem_end = _mesh.active_elements_end(); \n\n  for (; elem_it != elem_end; ++elem_it)\n    {\n      const Elem* elem = *elem_it;\n      const unsigned int elem_number = elem->id();\n      const float        elem_error  = error_per_cell[elem_number];\n\n      sorted_error.push_back (elem_error);\n    }\n\n  \/\/ Now sort the sorted_error vector\n  std::sort (sorted_error.begin(), sorted_error.end());\n  \n\n  float\n    top_error= 0., bottom_error = 0.,\n    min_error= 0., max_error    = 0.;\n\n  \/\/ Get the maximum error value corresponding to the\n  \/\/ bottom n_elem_coarsen elements\n  {\n    std::vector<float>::iterator\n      it  = sorted_error.begin();\n\n    min_error = *it;\n    \n    std::advance (it, n_elem_coarsen);\n\n    bottom_error = *it;\n  }\n\n  \n  \/\/ Get the minimum error value corresponding to the\n  \/\/ top n_elem_refine elements\n  {\n    std::vector<float>::reverse_iterator\n      it  = sorted_error.rbegin();\n\n    max_error = *it;\n    \n    std::advance (it, n_elem_refine);\n\n    top_error = *it;\n  }\n\n  assert (max_error >= min_error);\n  const Real delta       = max_error - min_error;  \n  const Real top_frac    = (max_error    - top_error)\/max_error;\n  const Real bottom_frac = (bottom_error - min_error)\/delta;\n    \n  \n\n  \/\/ Call the other refinement scheme\n  this->flag_elements_by_error_fraction  (error_per_cell, top_frac,\n\t\t\t\t\t  bottom_frac, max_level);\n}\n\n\n\nvoid MeshRefinement::flag_elements_by_mean_stddev (const ErrorVector& error_per_cell_in,\n\t\t\t\t\t\t   const Real refine_fraction,\n\t\t\t\t\t\t   const Real coarsen_fraction,\n\t\t\t\t\t\t   const unsigned int max_level)\n{\n  \/\/ Copy the input error_per_cell so that we can modify it\n  ErrorVector error_per_cell (error_per_cell_in);\n  \n\/\/   \/\/ Set the error_per_cell to zero for elements at the\n\/\/   \/\/ maximum allowable refinement level\n\/\/   {\n\/\/     active_elem_iterator       elem_it (_mesh.elements_begin());\n\/\/     const active_elem_iterator elem_end(_mesh.elements_end());\n\n\/\/     for (; elem_it != elem_end; ++elem_it)\n\/\/       {\n\/\/ \tElem* elem               = *elem_it;\n\/\/ \tconst unsigned int id    = elem->id();\n\/\/ \tconst unsigned int level = elem->level();\n\n\/\/ \tassert (id < error_per_cell.size());\n      \n\/\/ \tif (level >= max_level)\n\/\/ \t  error_per_cell[id] = 0.;\n\/\/       }\n\/\/   }\n  \n  \/\/ Get the mean value from the error vector\n  const Real mean = error_per_cell.mean();\n  \n  \/\/ Get the standard deviation.  This equals the\n  \/\/ square-root of the variance\n  const Real stddev = sqrt (error_per_cell.variance());\n  \n  \/\/ Check for valid fractions\n  assert (refine_fraction  >= 0.);\n  assert (coarsen_fraction >= 0.);\n\n  \/\/ The refine and coarsen cutoff\n  const Real refine_cutoff  =  mean + refine_fraction * stddev;\n  const Real coarsen_cutoff = ((coarsen_fraction == 0.) ? 0. :\n\t\t\t       mean - coarsen_fraction * stddev);\n\n  \n\n  \/\/ Loop over the elements and flag them for coarsening or\n  \/\/ refinement based on the element error\n\/\/   active_elem_iterator       elem_it (_mesh.elements_begin());\n\/\/   const active_elem_iterator elem_end(_mesh.elements_end());\n\n  MeshBase::element_iterator       elem_it  = _mesh.active_elements_begin();\n  const MeshBase::element_iterator elem_end = _mesh.active_elements_end(); \n\n  for (; elem_it != elem_end; ++elem_it)\n    {\n      Elem* elem             = *elem_it;\n      const unsigned int id  = elem->id();\n\n      assert (id < error_per_cell.size());\n      \n      const float elem_error = error_per_cell[id];\n\n      \/\/ Flag the element for coarsening if its error\n      \/\/ is <= coarsen_fraction*delta + error_min\n      if (elem_error <= coarsen_cutoff)\n\t{\n\t  elem->set_refinement_flag(Elem::COARSEN);\n\t}\n      \n      \/\/ Flag the element for refinement if its error\n      \/\/ is >= refinement_cutoff.\n      if (elem_error >= refine_cutoff)\n\tif (elem->level() < max_level)\n\t  elem->set_refinement_flag(Elem::REFINE);\n    }\n}\n\n\n\nvoid MeshRefinement::clean_refinement_flags ()\n{\n  \/\/ Possibly clean up the refinement flags from\n  \/\/ a previous step\n\/\/   elem_iterator       elem_it (_mesh.elements_begin());\n\/\/   const elem_iterator elem_end(_mesh.elements_end());\n\n  MeshBase::element_iterator       elem_it  = _mesh.elements_begin();\n  const MeshBase::element_iterator elem_end = _mesh.elements_end(); \n\n  for ( ; elem_it != elem_end; ++elem_it)\n    (*elem_it)->set_refinement_flag(Elem::DO_NOTHING);\n}\n\n#endif\n<commit_msg>Fixed a bug which prevented coarsening in the mean_stddev flagging routine.<commit_after>\/\/ $Id: mesh_refinement_flagging.C,v 1.13 2004-12-06 00:48:01 jwpeterson Exp $\n\n\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2004  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 \"libmesh_config.h\"\n\n\/\/ only compile these functions if the user requests AMR support\n#ifdef ENABLE_AMR\n\n\/\/ C++ includes\n#include <algorithm> \/\/ for std::sort\n\n\/\/ Local includes\n#include \"error_vector.h\"\n#include \"mesh_refinement.h\"\n#include \"mesh_base.h\"\n#include \"elem.h\"\n\n\n\n\/\/-----------------------------------------------------------------\n\/\/ Mesh refinement methods\nvoid MeshRefinement::flag_elements_by_error_fraction (const ErrorVector& error_per_cell_in,\n\t\t\t\t\t\t      const Real refine_fraction,\n\t\t\t\t\t\t      const Real coarsen_fraction,\n\t\t\t\t\t\t      const unsigned int max_level)\n{\n  \/\/ Copy the input error_per_cell so that we can modify it\n  ErrorVector error_per_cell (error_per_cell_in);\n  \n  \/\/ Check for valid fractions..\n  \/\/ The fraction values must be in [0,1]\n  assert (refine_fraction  >= 0.);  assert (refine_fraction  <= 1.);\n  assert (coarsen_fraction >= 0.);  assert (coarsen_fraction <= 1.);\n\n  \/\/ Clean up the refinement flags.  These could be left\n  \/\/ over from previous refinement steps.\n  this->clean_refinement_flags();\n  \n\n\/\/   \/\/ Set the error_per_cell to zero for elements at the\n\/\/   \/\/ maximum allowable refinement level\n\/\/   {\n\/\/     active_elem_iterator       elem_it (_mesh.elements_begin());\n\/\/     const active_elem_iterator elem_end(_mesh.elements_end());\n\n\/\/     for (; elem_it != elem_end; ++elem_it)\n\/\/       {\n\/\/ \tElem* elem               = *elem_it;\n\/\/ \tconst unsigned int id    = elem->id();\n\/\/ \tconst unsigned int level = elem->level();\n\n\/\/ \tassert (id < error_per_cell.size());\n      \n\/\/ \tif (level >= max_level)\n\/\/ \t  error_per_cell[id] = 0.;\n\/\/       }\n\/\/   }\n  \n  \/\/ Get the minimum, maximum, and delta error values\n  \/\/ for the elements\n  const Real error_max   = error_per_cell.maximum();\n  const Real error_min   = error_per_cell.minimum();\n  const Real error_delta = (error_max - error_min);\n\n\n  \/\/ Compute the cutoff values for coarsening and refinement\n  const Real refine_cutoff  = (1.- refine_fraction)*error_max;\n  const Real coarsen_cutoff = coarsen_fraction*error_delta + error_min;\n\n\/\/   \/\/ Print information about the error\n\/\/   std::cout << \" Error Information:\"                     << std::endl\n\/\/ \t    << \" ------------------\"                     << std::endl\n\/\/ \t    << \"   min:              \" << error_min      << std::endl\n\/\/ \t    << \"   max:              \" << error_max      << std::endl\n\/\/ \t    << \"   delta:            \" << error_delta    << std::endl\n\/\/ \t    << \"     refine_cutoff:  \" << refine_cutoff  << std::endl\n\/\/ \t    << \"     coarsen_cutoff: \" << coarsen_cutoff << std::endl;\n  \n  \n\n  \/\/ Loop over the elements and flag them for coarsening or\n  \/\/ refinement based on the element error\n\/\/   active_elem_iterator       elem_it (_mesh.elements_begin());\n\/\/   const active_elem_iterator elem_end(_mesh.elements_end());\n\n  MeshBase::element_iterator       elem_it  = _mesh.active_elements_begin();\n  const MeshBase::element_iterator elem_end = _mesh.active_elements_end(); \n\n  for (; elem_it != elem_end; ++elem_it)\n    {\n      Elem* elem             = *elem_it;\n      const unsigned int id  = elem->id();\n\n      assert (id < error_per_cell.size());\n      \n      const float elem_error = error_per_cell[id];\n\n      \/\/ Flag the element for coarsening if its error\n      \/\/ is <= coarsen_fraction*delta + error_min\n      if (elem_error <= coarsen_cutoff)\n\t{\n\t  elem->set_refinement_flag(Elem::COARSEN);\n\t}\n      \n      \/\/ Flag the element for refinement if its error\n      \/\/ is >= refinement_cutoff.\n      if (elem_error >= refine_cutoff)\n\tif (elem->level() < max_level)\n\t  elem->set_refinement_flag(Elem::REFINE);\n    }\n}\n\n\n\nvoid MeshRefinement::flag_elements_by_elem_fraction (const ErrorVector& error_per_cell_in,\n\t\t\t\t\t\t     const Real refine_fraction,\n\t\t\t\t\t\t     const Real coarsen_fraction,\n\t\t\t\t\t\t     const unsigned int max_level)\n{\n  \/\/ Copy the input error_per_cell so that we can modify it\n  ErrorVector error_per_cell (error_per_cell_in);\n  \n  \/\/ Check for valid fractions..\n  \/\/ The fraction values must be in [0,1]\n  assert (refine_fraction  >= 0.);  assert (refine_fraction  <= 1.);\n  assert (coarsen_fraction >= 0.);  assert (coarsen_fraction <= 1.);\n\n  \/\/ The number of active elements in the mesh\n  const unsigned int n_active_elem  = _mesh.n_elem();\n\n  \/\/ The number of elements to flag for coarsening\n  const unsigned int n_elem_coarsen = static_cast<unsigned int>(coarsen_fraction * n_active_elem);\n\n  \/\/ The number of elements to flag for refinement\n  const unsigned int n_elem_refine  = static_cast<unsigned int>(refine_fraction  * n_active_elem);\n\n\n  \n  \/\/ Clean up the refinement flags.  These could be left\n  \/\/ over from previous refinement steps.\n  this->clean_refinement_flags();\n\n\n\n\/\/   \/\/ Set the error_per_cell to zero for elements at the\n\/\/   \/\/ maximum allowable refinement level\n\/\/   {\n\/\/     active_elem_iterator       elem_it (_mesh.elements_begin());\n\/\/     const active_elem_iterator elem_end(_mesh.elements_end());\n\n\/\/     for (; elem_it != elem_end; ++elem_it)\n\/\/       {\n\/\/ \tElem* elem               = *elem_it;\n\/\/ \tconst unsigned int id    = elem->id();\n\/\/ \tconst unsigned int level = elem->level();\n\n\/\/ \tassert (id < error_per_cell.size());\n      \n\/\/ \tif (level >= max_level)\n\/\/ \t  error_per_cell[id] = 0.;\n\/\/       }\n\/\/   }\n  \n  \/\/ This vector stores the error and element number for all the\n  \/\/ active elements.  It will be sorted and the top & bottom\n  \/\/ elements will then be flagged for coarsening & refinement\n  std::vector<float> sorted_error;\n\n  sorted_error.reserve (n_active_elem);\n\n  \/\/ Loop over the active elements and create the entry\n  \/\/ in the sorted_error vector\n\/\/   const_active_elem_iterator       elem_it (_mesh.const_elements_begin());\n\/\/   const const_active_elem_iterator elem_end(_mesh.const_elements_end());\n\n  MeshBase::element_iterator       elem_it  = _mesh.active_elements_begin();\n  const MeshBase::element_iterator elem_end = _mesh.active_elements_end(); \n\n  for (; elem_it != elem_end; ++elem_it)\n    {\n      const Elem* elem = *elem_it;\n      const unsigned int elem_number = elem->id();\n      const float        elem_error  = error_per_cell[elem_number];\n\n      sorted_error.push_back (elem_error);\n    }\n\n  \/\/ Now sort the sorted_error vector\n  std::sort (sorted_error.begin(), sorted_error.end());\n  \n\n  float\n    top_error= 0., bottom_error = 0.,\n    min_error= 0., max_error    = 0.;\n\n  \/\/ Get the maximum error value corresponding to the\n  \/\/ bottom n_elem_coarsen elements\n  {\n    std::vector<float>::iterator\n      it  = sorted_error.begin();\n\n    min_error = *it;\n    \n    std::advance (it, n_elem_coarsen);\n\n    bottom_error = *it;\n  }\n\n  \n  \/\/ Get the minimum error value corresponding to the\n  \/\/ top n_elem_refine elements\n  {\n    std::vector<float>::reverse_iterator\n      it  = sorted_error.rbegin();\n\n    max_error = *it;\n    \n    std::advance (it, n_elem_refine);\n\n    top_error = *it;\n  }\n\n  assert (max_error >= min_error);\n  const Real delta       = max_error - min_error;  \n  const Real top_frac    = (max_error    - top_error)\/max_error;\n  const Real bottom_frac = (bottom_error - min_error)\/delta;\n    \n  \n\n  \/\/ Call the other refinement scheme\n  this->flag_elements_by_error_fraction  (error_per_cell, top_frac,\n\t\t\t\t\t  bottom_frac, max_level);\n}\n\n\n\nvoid MeshRefinement::flag_elements_by_mean_stddev (const ErrorVector& error_per_cell_in,\n\t\t\t\t\t\t   const Real refine_fraction,\n\t\t\t\t\t\t   const Real coarsen_fraction,\n\t\t\t\t\t\t   const unsigned int max_level)\n{\n  \/\/ Copy the input error_per_cell so that we can modify it\n  ErrorVector error_per_cell (error_per_cell_in);\n  \n\/\/   \/\/ Set the error_per_cell to zero for elements at the\n\/\/   \/\/ maximum allowable refinement level\n\/\/   {\n\/\/     active_elem_iterator       elem_it (_mesh.elements_begin());\n\/\/     const active_elem_iterator elem_end(_mesh.elements_end());\n\n\/\/     for (; elem_it != elem_end; ++elem_it)\n\/\/       {\n\/\/ \tElem* elem               = *elem_it;\n\/\/ \tconst unsigned int id    = elem->id();\n\/\/ \tconst unsigned int level = elem->level();\n\n\/\/ \tassert (id < error_per_cell.size());\n      \n\/\/ \tif (level >= max_level)\n\/\/ \t  error_per_cell[id] = 0.;\n\/\/       }\n\/\/   }\n  \n  \/\/ Get the mean value from the error vector\n  const Real mean = error_per_cell.mean();\n  \n  \/\/ Get the standard deviation.  This equals the\n  \/\/ square-root of the variance\n  const Real stddev = sqrt (error_per_cell.variance());\n  \n  \/\/ Check for valid fractions\n  assert (refine_fraction  >= 0.);\n  assert (coarsen_fraction >= 0.);\n\n  \/\/ The refine and coarsen cutoff\n  const Real refine_cutoff  =  mean + refine_fraction  * stddev;\n  const Real coarsen_cutoff =  std::max(mean - coarsen_fraction * stddev, 0.);\n      \n  \/\/ Loop over the elements and flag them for coarsening or\n  \/\/ refinement based on the element error\n  MeshBase::element_iterator       elem_it  = _mesh.active_elements_begin();\n  const MeshBase::element_iterator elem_end = _mesh.active_elements_end(); \n\n  for (; elem_it != elem_end; ++elem_it)\n    {\n      Elem* elem             = *elem_it;\n      const unsigned int id  = elem->id();\n\n      assert (id < error_per_cell.size());\n      \n      const float elem_error = error_per_cell[id];\n\n      \/\/ Possibly flag the element for coarsening ...\n      if (elem_error <= coarsen_cutoff)\n\telem->set_refinement_flag(Elem::COARSEN);\n      \n      \/\/ ... or refinement\n      if ((elem_error >= refine_cutoff) && (elem->level() < max_level))\n\telem->set_refinement_flag(Elem::REFINE);\n    }\n}\n\n\n\nvoid MeshRefinement::clean_refinement_flags ()\n{\n  \/\/ Possibly clean up the refinement flags from\n  \/\/ a previous step\n\/\/   elem_iterator       elem_it (_mesh.elements_begin());\n\/\/   const elem_iterator elem_end(_mesh.elements_end());\n\n  MeshBase::element_iterator       elem_it  = _mesh.elements_begin();\n  const MeshBase::element_iterator elem_end = _mesh.elements_end(); \n\n  for ( ; elem_it != elem_end; ++elem_it)\n    (*elem_it)->set_refinement_flag(Elem::DO_NOTHING);\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- asan_win.cc -------------------------------------------------------===\/\/\n\/\/\n\/\/                     The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file is a part of AddressSanitizer, an address sanity checker.\n\/\/\n\/\/ Windows-specific details.\n\/\/===----------------------------------------------------------------------===\/\/\n#ifdef _WIN32\n#include <windows.h>\n\n#include <dbghelp.h>\n#include <stdlib.h>\n\n#include <new>  \/\/ FIXME: temporarily needed for placement new in AsanLock.\n\n#include \"asan_interceptors.h\"\n#include \"asan_internal.h\"\n#include \"asan_lock.h\"\n#include \"asan_procmaps.h\"\n#include \"asan_thread.h\"\n\n\/\/ Should not add dependency on libstdc++,\n\/\/ since most of the stuff here is inlinable.\n#include <algorithm>\n\nnamespace __asan {\n\n\/\/ ---------------------- Memory management ---------------- {{{1\nvoid *AsanMmapFixedNoReserve(uintptr_t fixed_addr, size_t size) {\n  return VirtualAlloc((LPVOID)fixed_addr, size,\n                      MEM_RESERVE | MEM_COMMIT, PAGE_READWRITE);\n}\n\nvoid *AsanMmapSomewhereOrDie(size_t size, const char *mem_type) {\n  void *rv = VirtualAlloc(NULL, size, MEM_RESERVE | MEM_COMMIT, PAGE_READWRITE);\n  if (rv == NULL)\n    OutOfMemoryMessageAndDie(mem_type, size);\n  return rv;\n}\n\nvoid *AsanMprotect(uintptr_t fixed_addr, size_t size) {\n  return VirtualAlloc((LPVOID)fixed_addr, size,\n                      MEM_RESERVE | MEM_COMMIT, PAGE_NOACCESS);\n}\n\nvoid AsanUnmapOrDie(void *addr, size_t size) {\n  CHECK(VirtualFree(addr, size, MEM_DECOMMIT));\n}\n\n\/\/ ---------------------- IO ---------------- {{{1\nsize_t AsanWrite(int fd, const void *buf, size_t count) {\n  if (fd != 2)\n    UNIMPLEMENTED();\n\n  HANDLE err = GetStdHandle(STD_ERROR_HANDLE);\n  if (err == NULL)\n    return 0;  \/\/ FIXME: this might not work on some apps.\n  DWORD ret;\n  if (!WriteFile(err, buf, count, &ret, NULL))\n    return 0;\n  return ret;\n}\n\n\/\/ FIXME: Looks like these functions are not needed and are linked in by the\n\/\/ code unreachable on Windows. We should clean this up.\nint AsanOpenReadonly(const char* filename) {\n  UNIMPLEMENTED();\n}\n\nsize_t AsanRead(int fd, void *buf, size_t count) {\n  UNIMPLEMENTED();\n}\n\nint AsanClose(int fd) {\n  UNIMPLEMENTED();\n}\n\n\/\/ ---------------------- Stacktraces, symbols, etc. ---------------- {{{1\nstatic AsanLock dbghelp_lock(LINKER_INITIALIZED);\nstatic bool dbghelp_initialized = false;\n#pragma comment(lib, \"dbghelp.lib\")\n\nvoid AsanThread::SetThreadStackTopAndBottom() {\n  MEMORY_BASIC_INFORMATION mbi;\n  CHECK(VirtualQuery(&mbi \/* on stack *\/,\n                    &mbi, sizeof(mbi)) != 0);\n  \/\/ FIXME: is it possible for the stack to not be a single allocation?\n  \/\/ Are these values what ASan expects to get (reserved, not committed;\n  \/\/ including stack guard page) ?\n  stack_top_ = (uintptr_t)mbi.BaseAddress + mbi.RegionSize;\n  stack_bottom_ = (uintptr_t)mbi.AllocationBase;\n}\n\nvoid AsanStackTrace::GetStackTrace(size_t max_s, uintptr_t pc, uintptr_t bp) {\n  max_size = max_s;\n  void *tmp[kStackTraceMax];\n\n  \/\/ FIXME: CaptureStackBackTrace might be too slow for us.\n  \/\/ FIXME: Compare with StackWalk64.\n  \/\/ FIXME: Look at LLVMUnhandledExceptionFilter in Signals.inc\n  size_t cs_ret = CaptureStackBackTrace(1, max_size, tmp, NULL),\n         offset = 0;\n  \/\/ Skip the RTL frames by searching for the PC in the stacktrace.\n  \/\/ FIXME: this doesn't work well for the malloc\/free stacks yet.\n  for (size_t i = 0; i < cs_ret; i++) {\n    if (pc != (uintptr_t)tmp[i])\n      continue;\n    offset = i;\n    break;\n  }\n\n  size = cs_ret - offset;\n  for (size_t i = 0; i < size; i++)\n    trace[i] = (uintptr_t)tmp[i + offset];\n}\n\nbool WinSymbolize(const void *addr, char *out_buffer, int buffer_size) {\n  ScopedLock lock(&dbghelp_lock);\n  if (!dbghelp_initialized) {\n    SymSetOptions(SYMOPT_DEFERRED_LOADS |\n                  SYMOPT_UNDNAME |\n                  SYMOPT_LOAD_LINES);\n    CHECK(SymInitialize(GetCurrentProcess(), NULL, TRUE));\n    \/\/ FIXME: We don't call SymCleanup() on exit yet - should we?\n    dbghelp_initialized = true;\n  }\n\n  \/\/ See http:\/\/msdn.microsoft.com\/en-us\/library\/ms680578(VS.85).aspx\n  char buffer[sizeof(SYMBOL_INFO) + MAX_SYM_NAME * sizeof(CHAR)];\n  PSYMBOL_INFO symbol = (PSYMBOL_INFO)buffer;\n  symbol->SizeOfStruct = sizeof(SYMBOL_INFO);\n  symbol->MaxNameLen = MAX_SYM_NAME;\n  DWORD64 offset = 0;\n  BOOL got_objname = SymFromAddr(GetCurrentProcess(),\n                                 (DWORD64)addr, &offset, symbol);\n  if (!got_objname)\n    return false;\n\n  DWORD  unused;\n  IMAGEHLP_LINE64 info;\n  info.SizeOfStruct = sizeof(IMAGEHLP_LINE64);\n  BOOL got_fileline = SymGetLineFromAddr64(GetCurrentProcess(),\n                                           (DWORD64)addr, &unused, &info);\n  int written = 0;\n  out_buffer[0] = '\\0';\n  \/\/ FIXME: it might be useful to print out 'obj' or 'obj+offset' info too.\n  if (got_fileline) {\n    written += SNPrintf(out_buffer + written, buffer_size - written,\n                        \" %s %s:%d\", symbol->Name,\n                        info.FileName, info.LineNumber);\n  } else {\n    written += SNPrintf(out_buffer + written, buffer_size - written,\n                        \" %s+0x%p\", symbol->Name, offset);\n  }\n  return true;\n}\n\n\/\/ ---------------------- AsanLock ---------------- {{{1\nenum LockState {\n  LOCK_UNINITIALIZED = 0,\n  LOCK_READY = -1,\n};\n\nAsanLock::AsanLock(LinkerInitialized li) {\n  \/\/ FIXME: see comments in AsanLock::Lock() for the details.\n  CHECK(li == LINKER_INITIALIZED || owner_ == LOCK_UNINITIALIZED);\n\n  CHECK(sizeof(CRITICAL_SECTION) <= sizeof(opaque_storage_));\n  InitializeCriticalSection((LPCRITICAL_SECTION)opaque_storage_);\n  owner_ = LOCK_READY;\n}\n\nvoid AsanLock::Lock() {\n  if (owner_ == LOCK_UNINITIALIZED) {\n    \/\/ FIXME: hm, global AsanLock objects are not initialized?!?\n    \/\/ This might be a side effect of the clang+cl+link Frankenbuild...\n    new(this) AsanLock((LinkerInitialized)(LINKER_INITIALIZED + 1));\n\n    \/\/ FIXME: If it turns out the linker doesn't invoke our\n    \/\/ constructors, we should probably manually Lock\/Unlock all the global\n    \/\/ locks while we're starting in one thread to avoid double-init races.\n  }\n  EnterCriticalSection((LPCRITICAL_SECTION)opaque_storage_);\n  CHECK(owner_ == LOCK_READY);\n  owner_ = GetThreadSelf();\n}\n\nvoid AsanLock::Unlock() {\n  CHECK(owner_ == GetThreadSelf());\n  owner_ = LOCK_READY;\n  LeaveCriticalSection((LPCRITICAL_SECTION)opaque_storage_);\n}\n\n\/\/ ---------------------- TSD ---------------- {{{1\nstatic bool tsd_key_inited = false;\n\nstatic __declspec(thread) void *fake_tsd = NULL;\n\nvoid AsanTSDInit(void (*destructor)(void *tsd)) {\n  \/\/ FIXME: we're ignoring the destructor for now.\n  tsd_key_inited = true;\n}\n\nvoid *AsanTSDGet() {\n  CHECK(tsd_key_inited);\n  return fake_tsd;\n}\n\nvoid AsanTSDSet(void *tsd) {\n  CHECK(tsd_key_inited);\n  fake_tsd = tsd;\n}\n\n\/\/ ---------------------- Various stuff ---------------- {{{1\nvoid *AsanDoesNotSupportStaticLinkage() {\n#if defined(_DEBUG)\n#error Please build the runtime with a non-debug CRT: \/MD or \/MT\n#endif\n  return NULL;\n}\n\nbool AsanShadowRangeIsAvailable() {\n  \/\/ FIXME: shall we do anything here on Windows?\n  return true;\n}\n\nint AtomicInc(int *a) {\n  return InterlockedExchangeAdd((LONG*)a, 1) + 1;\n}\n\nuint16_t AtomicExchange(uint16_t *a, uint16_t new_val) {\n  return InterlockedExchange16(a, new_val);\n}\n\nconst char* AsanGetEnv(const char* name) {\n  static char env_buffer[32767] = {};\n\n  \/\/ Note: this implementation stores the result in a static buffer so we only\n  \/\/ allow it to be called just once.\n  static bool called_once = false;\n  if (called_once)\n    UNIMPLEMENTED();\n  called_once = true;\n\n  DWORD rv = GetEnvironmentVariableA(name, env_buffer, sizeof(env_buffer));\n  if (rv > 0 && rv < sizeof(env_buffer))\n    return env_buffer;\n  return NULL;\n}\n\nvoid AsanDumpProcessMap() {\n  UNIMPLEMENTED();\n}\n\nint GetPid() {\n  return GetProcessId(GetCurrentProcess());\n}\n\nuintptr_t GetThreadSelf() {\n  return GetCurrentThreadId();\n}\n\nvoid SetAlternateSignalStack() {\n  \/\/ FIXME: Decide what to do on Windows.\n}\n\nvoid UnsetAlternateSignalStack() {\n  \/\/ FIXME: Decide what to do on Windows.\n}\n\nvoid InstallSignalHandlers() {\n  \/\/ FIXME: Decide what to do on Windows.\n}\n\nvoid AsanDisableCoreDumper() {\n  UNIMPLEMENTED();\n}\n\nvoid SleepForSeconds(int seconds) {\n  Sleep(seconds * 1000);\n}\n\nvoid Exit(int exitcode) {\n  _exit(exitcode);\n}\n\nint Atexit(void (*function)(void)) {\n  return atexit(function);\n}\n\nvoid SortArray(uintptr_t *array, size_t size) {\n  std::sort(array, array + size);\n}\n\n}  \/\/ namespace __asan\n\n#endif  \/\/ _WIN32\n<commit_msg>[ASan\/Win] Fix build by using inline assembly instead of an unavailable intrinsic function<commit_after>\/\/===-- asan_win.cc -------------------------------------------------------===\/\/\n\/\/\n\/\/                     The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file is a part of AddressSanitizer, an address sanity checker.\n\/\/\n\/\/ Windows-specific details.\n\/\/===----------------------------------------------------------------------===\/\/\n#ifdef _WIN32\n#include <windows.h>\n\n#include <dbghelp.h>\n#include <stdlib.h>\n\n#include <new>  \/\/ FIXME: temporarily needed for placement new in AsanLock.\n\n#include \"asan_interceptors.h\"\n#include \"asan_internal.h\"\n#include \"asan_lock.h\"\n#include \"asan_procmaps.h\"\n#include \"asan_thread.h\"\n\n\/\/ Should not add dependency on libstdc++,\n\/\/ since most of the stuff here is inlinable.\n#include <algorithm>\n\nnamespace __asan {\n\n\/\/ ---------------------- Memory management ---------------- {{{1\nvoid *AsanMmapFixedNoReserve(uintptr_t fixed_addr, size_t size) {\n  return VirtualAlloc((LPVOID)fixed_addr, size,\n                      MEM_RESERVE | MEM_COMMIT, PAGE_READWRITE);\n}\n\nvoid *AsanMmapSomewhereOrDie(size_t size, const char *mem_type) {\n  void *rv = VirtualAlloc(NULL, size, MEM_RESERVE | MEM_COMMIT, PAGE_READWRITE);\n  if (rv == NULL)\n    OutOfMemoryMessageAndDie(mem_type, size);\n  return rv;\n}\n\nvoid *AsanMprotect(uintptr_t fixed_addr, size_t size) {\n  return VirtualAlloc((LPVOID)fixed_addr, size,\n                      MEM_RESERVE | MEM_COMMIT, PAGE_NOACCESS);\n}\n\nvoid AsanUnmapOrDie(void *addr, size_t size) {\n  CHECK(VirtualFree(addr, size, MEM_DECOMMIT));\n}\n\n\/\/ ---------------------- IO ---------------- {{{1\nsize_t AsanWrite(int fd, const void *buf, size_t count) {\n  if (fd != 2)\n    UNIMPLEMENTED();\n\n  HANDLE err = GetStdHandle(STD_ERROR_HANDLE);\n  if (err == NULL)\n    return 0;  \/\/ FIXME: this might not work on some apps.\n  DWORD ret;\n  if (!WriteFile(err, buf, count, &ret, NULL))\n    return 0;\n  return ret;\n}\n\n\/\/ FIXME: Looks like these functions are not needed and are linked in by the\n\/\/ code unreachable on Windows. We should clean this up.\nint AsanOpenReadonly(const char* filename) {\n  UNIMPLEMENTED();\n}\n\nsize_t AsanRead(int fd, void *buf, size_t count) {\n  UNIMPLEMENTED();\n}\n\nint AsanClose(int fd) {\n  UNIMPLEMENTED();\n}\n\n\/\/ ---------------------- Stacktraces, symbols, etc. ---------------- {{{1\nstatic AsanLock dbghelp_lock(LINKER_INITIALIZED);\nstatic bool dbghelp_initialized = false;\n#pragma comment(lib, \"dbghelp.lib\")\n\nvoid AsanThread::SetThreadStackTopAndBottom() {\n  MEMORY_BASIC_INFORMATION mbi;\n  CHECK(VirtualQuery(&mbi \/* on stack *\/,\n                    &mbi, sizeof(mbi)) != 0);\n  \/\/ FIXME: is it possible for the stack to not be a single allocation?\n  \/\/ Are these values what ASan expects to get (reserved, not committed;\n  \/\/ including stack guard page) ?\n  stack_top_ = (uintptr_t)mbi.BaseAddress + mbi.RegionSize;\n  stack_bottom_ = (uintptr_t)mbi.AllocationBase;\n}\n\nvoid AsanStackTrace::GetStackTrace(size_t max_s, uintptr_t pc, uintptr_t bp) {\n  max_size = max_s;\n  void *tmp[kStackTraceMax];\n\n  \/\/ FIXME: CaptureStackBackTrace might be too slow for us.\n  \/\/ FIXME: Compare with StackWalk64.\n  \/\/ FIXME: Look at LLVMUnhandledExceptionFilter in Signals.inc\n  size_t cs_ret = CaptureStackBackTrace(1, max_size, tmp, NULL),\n         offset = 0;\n  \/\/ Skip the RTL frames by searching for the PC in the stacktrace.\n  \/\/ FIXME: this doesn't work well for the malloc\/free stacks yet.\n  for (size_t i = 0; i < cs_ret; i++) {\n    if (pc != (uintptr_t)tmp[i])\n      continue;\n    offset = i;\n    break;\n  }\n\n  size = cs_ret - offset;\n  for (size_t i = 0; i < size; i++)\n    trace[i] = (uintptr_t)tmp[i + offset];\n}\n\nbool WinSymbolize(const void *addr, char *out_buffer, int buffer_size) {\n  ScopedLock lock(&dbghelp_lock);\n  if (!dbghelp_initialized) {\n    SymSetOptions(SYMOPT_DEFERRED_LOADS |\n                  SYMOPT_UNDNAME |\n                  SYMOPT_LOAD_LINES);\n    CHECK(SymInitialize(GetCurrentProcess(), NULL, TRUE));\n    \/\/ FIXME: We don't call SymCleanup() on exit yet - should we?\n    dbghelp_initialized = true;\n  }\n\n  \/\/ See http:\/\/msdn.microsoft.com\/en-us\/library\/ms680578(VS.85).aspx\n  char buffer[sizeof(SYMBOL_INFO) + MAX_SYM_NAME * sizeof(CHAR)];\n  PSYMBOL_INFO symbol = (PSYMBOL_INFO)buffer;\n  symbol->SizeOfStruct = sizeof(SYMBOL_INFO);\n  symbol->MaxNameLen = MAX_SYM_NAME;\n  DWORD64 offset = 0;\n  BOOL got_objname = SymFromAddr(GetCurrentProcess(),\n                                 (DWORD64)addr, &offset, symbol);\n  if (!got_objname)\n    return false;\n\n  DWORD  unused;\n  IMAGEHLP_LINE64 info;\n  info.SizeOfStruct = sizeof(IMAGEHLP_LINE64);\n  BOOL got_fileline = SymGetLineFromAddr64(GetCurrentProcess(),\n                                           (DWORD64)addr, &unused, &info);\n  int written = 0;\n  out_buffer[0] = '\\0';\n  \/\/ FIXME: it might be useful to print out 'obj' or 'obj+offset' info too.\n  if (got_fileline) {\n    written += SNPrintf(out_buffer + written, buffer_size - written,\n                        \" %s %s:%d\", symbol->Name,\n                        info.FileName, info.LineNumber);\n  } else {\n    written += SNPrintf(out_buffer + written, buffer_size - written,\n                        \" %s+0x%p\", symbol->Name, offset);\n  }\n  return true;\n}\n\n\/\/ ---------------------- AsanLock ---------------- {{{1\nenum LockState {\n  LOCK_UNINITIALIZED = 0,\n  LOCK_READY = -1,\n};\n\nAsanLock::AsanLock(LinkerInitialized li) {\n  \/\/ FIXME: see comments in AsanLock::Lock() for the details.\n  CHECK(li == LINKER_INITIALIZED || owner_ == LOCK_UNINITIALIZED);\n\n  CHECK(sizeof(CRITICAL_SECTION) <= sizeof(opaque_storage_));\n  InitializeCriticalSection((LPCRITICAL_SECTION)opaque_storage_);\n  owner_ = LOCK_READY;\n}\n\nvoid AsanLock::Lock() {\n  if (owner_ == LOCK_UNINITIALIZED) {\n    \/\/ FIXME: hm, global AsanLock objects are not initialized?!?\n    \/\/ This might be a side effect of the clang+cl+link Frankenbuild...\n    new(this) AsanLock((LinkerInitialized)(LINKER_INITIALIZED + 1));\n\n    \/\/ FIXME: If it turns out the linker doesn't invoke our\n    \/\/ constructors, we should probably manually Lock\/Unlock all the global\n    \/\/ locks while we're starting in one thread to avoid double-init races.\n  }\n  EnterCriticalSection((LPCRITICAL_SECTION)opaque_storage_);\n  CHECK(owner_ == LOCK_READY);\n  owner_ = GetThreadSelf();\n}\n\nvoid AsanLock::Unlock() {\n  CHECK(owner_ == GetThreadSelf());\n  owner_ = LOCK_READY;\n  LeaveCriticalSection((LPCRITICAL_SECTION)opaque_storage_);\n}\n\n\/\/ ---------------------- TSD ---------------- {{{1\nstatic bool tsd_key_inited = false;\n\nstatic __declspec(thread) void *fake_tsd = NULL;\n\nvoid AsanTSDInit(void (*destructor)(void *tsd)) {\n  \/\/ FIXME: we're ignoring the destructor for now.\n  tsd_key_inited = true;\n}\n\nvoid *AsanTSDGet() {\n  CHECK(tsd_key_inited);\n  return fake_tsd;\n}\n\nvoid AsanTSDSet(void *tsd) {\n  CHECK(tsd_key_inited);\n  fake_tsd = tsd;\n}\n\n\/\/ ---------------------- Various stuff ---------------- {{{1\nvoid *AsanDoesNotSupportStaticLinkage() {\n#if defined(_DEBUG)\n#error Please build the runtime with a non-debug CRT: \/MD or \/MT\n#endif\n  return NULL;\n}\n\nbool AsanShadowRangeIsAvailable() {\n  \/\/ FIXME: shall we do anything here on Windows?\n  return true;\n}\n\nint AtomicInc(int *a) {\n  return InterlockedExchangeAdd((LONG*)a, 1) + 1;\n}\n\nuint16_t AtomicExchange(uint16_t *a, uint16_t new_val) {\n  \/\/ InterlockedExchange16 seems unavailable on some MSVS installations.\n  \/\/ Everybody stand back, I pretend to know inline assembly!\n  \/\/ FIXME: I assume VC is smart enough to save\/restore eax\/ecx?\n  __asm {\n    mov eax, a\n    mov cx, new_val\n    xchg [eax], cx\n    mov new_val, cx\n  }\n  return new_val;\n}\n\nconst char* AsanGetEnv(const char* name) {\n  static char env_buffer[32767] = {};\n\n  \/\/ Note: this implementation stores the result in a static buffer so we only\n  \/\/ allow it to be called just once.\n  static bool called_once = false;\n  if (called_once)\n    UNIMPLEMENTED();\n  called_once = true;\n\n  DWORD rv = GetEnvironmentVariableA(name, env_buffer, sizeof(env_buffer));\n  if (rv > 0 && rv < sizeof(env_buffer))\n    return env_buffer;\n  return NULL;\n}\n\nvoid AsanDumpProcessMap() {\n  UNIMPLEMENTED();\n}\n\nint GetPid() {\n  return GetProcessId(GetCurrentProcess());\n}\n\nuintptr_t GetThreadSelf() {\n  return GetCurrentThreadId();\n}\n\nvoid SetAlternateSignalStack() {\n  \/\/ FIXME: Decide what to do on Windows.\n}\n\nvoid UnsetAlternateSignalStack() {\n  \/\/ FIXME: Decide what to do on Windows.\n}\n\nvoid InstallSignalHandlers() {\n  \/\/ FIXME: Decide what to do on Windows.\n}\n\nvoid AsanDisableCoreDumper() {\n  UNIMPLEMENTED();\n}\n\nvoid SleepForSeconds(int seconds) {\n  Sleep(seconds * 1000);\n}\n\nvoid Exit(int exitcode) {\n  _exit(exitcode);\n}\n\nint Atexit(void (*function)(void)) {\n  return atexit(function);\n}\n\nvoid SortArray(uintptr_t *array, size_t size) {\n  std::sort(array, array + size);\n}\n\n}  \/\/ namespace __asan\n\n#endif  \/\/ _WIN32\n<|endoftext|>"}
{"text":"<commit_before>#include <glibmm.h>\n#include <glibmm\/private\/interface_p.h>\n#include <glibmm\/private\/object_p.h>\n#include <iostream>\n#include <stdlib.h>\n\n\/\/ A basic derived GInterface, just to test Glib::Interface\n\nG_DECLARE_INTERFACE(TestIface, test_Iface, TEST, IFACE, GObject)\n\nstruct _TestIface\n{\n  GTypeInterface g_iface;\n};\n\nstatic void test_Iface_init(gpointer)\n{\n}\n\nGType\ntest_Iface_get_type(void)\n{\n  static GType type = 0;\n\n  if (!type)\n  {\n    const GTypeInfo info = {\n      sizeof(TestIface), \/\/ class_size\n      test_Iface_init, \/\/ base_init\n      nullptr, \/\/ base_finalize\n      nullptr, \/\/ class_init\n      nullptr, \/\/ class_finalize\n      nullptr, \/\/ class_data\n      0, \/\/ instance_size\n      0, \/\/ n_preallocs\n      nullptr, \/\/ instance_init\n      nullptr \/\/ value_table\n    };\n\n    type = g_type_register_static(G_TYPE_INTERFACE, \"TestIface\", &info, GTypeFlags(0));\n  }\n\n  return type;\n}\n\n#define TEST_TYPE_IFACE (test_Iface_get_type())\n\n\/\/ A basic derived GObject, just to test Glib::Object.\ntypedef struct\n{\n  GObject parent;\n} TestDerived;\n\ntypedef struct\n{\n  GObjectClass parent;\n} TestDerivedClass;\n\n#define TEST_TYPE_DERIVED (test_derived_get_type())\n#define TEST_DERIVED(obj) (G_TYPE_CHECK_INSTANCE_CAST((obj), TEST_TYPE_DERIVED, TestDerived))\n#define TEST_DERIVED_CLASS(cls) \\\n  (G_TYPE_CHECK_CLASS_CAST((cls), TEST_TYPE_DERIVED, TestDerivedClass))\n#define TEST_DERIVED_GET_CLASS(obj) \\\n  (G_TYPE_INSTANCE_GET_CLASS((obj), TEST_TYPE_DERIVED, TestDerivedClass))\n\nstatic void\ntest_derived_class_init(TestDerivedClass*)\n{\n}\nstatic void\ntest_derived_init(TestDerived*)\n{\n}\n\nG_DEFINE_TYPE_EXTENDED(TestDerived, test_derived, G_TYPE_OBJECT, 0,\n  G_IMPLEMENT_INTERFACE(TEST_TYPE_IFACE, test_Iface_init))\n\nclass TestInterface;\n\nclass TestInterface_Class : public Glib::Interface_Class\n{\npublic:\n  using BaseClassType = TestInterface;\n\n  friend class TestInterface;\n\n  const Glib::Interface_Class& init()\n  {\n    if (!gtype_) \/\/ create the GType if necessary\n    {\n      \/\/ Glib::Interface_Class has to know the interface init function\n      \/\/ in order to add interfaces to implementing types.\n      class_init_func_ = &TestInterface_Class::iface_init_function;\n\n      \/\/ We can not derive from another interface, and it is not necessary anyway.\n      gtype_ = test_Iface_get_type();\n    }\n\n    return *this;\n  }\n\n  static void iface_init_function(void* \/* g_iface *\/, void* \/* iface_data *\/) {}\n\n  \/\/ static Glib::ObjectBase* wrap_new(GObject*);\n};\n\nclass TestInterface : public Glib::Interface\n{\nprotected:\n  using CppClassType = TestInterface_Class;\n\n  TestInterface() : Glib::Interface(derived_interface_class_.init()), i_(0) {}\n\npublic:\n  \/\/ A real application would never make the constructor public.\n  \/\/ It would instead have a protected constructor and a public create() method.\n  TestInterface(GObject* gobject, int i) : Glib::Interface(gobject), i_(i) {}\n\n  static void add_interface(GType gtype_implementer)\n  {\n    derived_interface_class_.init().add_interface(gtype_implementer);\n  }\n\n  TestInterface(const TestInterface& src) = delete;\n  TestInterface& operator=(const TestInterface& src) = delete;\n\n  TestInterface(TestInterface&& src) noexcept : Glib::Interface(std::move(src)),\n                                                i_(std::move(src.i_))\n  {\n  }\n\n  TestInterface& operator=(TestInterface&& src) noexcept\n  {\n    Glib::Interface::operator=(std::move(src));\n    i_ = std::move(src.i_);\n\n    return *this;\n  }\n\n  int i_;\n\nprivate:\n  friend class TestInterface_Class;\n  static CppClassType derived_interface_class_;\n};\n\nclass DerivedObject_Class : public Glib::Class\n{\npublic:\n  using BaseClassType = GObjectClass;\n  using CppClassParent = Glib::Object_Class;\n\n  static void class_init_function(void* g_class, void* class_data)\n  {\n    const auto klass = static_cast<BaseClassType*>(g_class);\n    CppClassParent::class_init_function(klass, class_data);\n  }\n\n  const Glib::Class& init()\n  {\n    if (!gtype_) \/\/ create the GType if necessary\n    {\n      \/\/ Glib::Class has to know the class init function to clone custom types.\n      class_init_func_ = &DerivedObject_Class::class_init_function;\n\n      \/\/ This is actually just optimized away, apparently with no harm.\n      \/\/ Make sure that the parent type has been created.\n      \/\/ CppClassParent::CppObjectType::get_type();\n\n      \/\/ Create the wrapper type, with the same class\/instance size as the base type.\n      register_derived_type(test_derived_get_type());\n\n      \/\/ Add derived versions of interfaces, if the C type implements any interfaces:\n      TestInterface::add_interface(get_type());\n    }\n\n    return *this;\n  }\n};\n\nTestInterface::CppClassType TestInterface::derived_interface_class_; \/\/ initialize static member\n\nclass DerivedObject : public Glib::Object, public TestInterface\n{\npublic:\n  using CppClassType = DerivedObject_Class;\n\n  \/\/ A real application would never make the constructor public.\n  \/\/ It would instead have a protected constructor and a public create() method.\n  explicit DerivedObject(int i)\n  : Glib::ObjectBase(nullptr),\n    Glib::Object(Glib::ConstructParams(derived_object_class_.init())),\n    i_(i)\n  {\n  }\n\n  DerivedObject(const DerivedObject& src) = delete;\n  DerivedObject& operator=(const DerivedObject& src) = delete;\n\n  DerivedObject(DerivedObject&& src) noexcept : Glib::Object(std::move(src)),\n                                                TestInterface(std::move(src)),\n                                                i_(std::move(src.i_))\n  {\n  }\n\n  DerivedObject& operator=(DerivedObject&& src) noexcept\n  {\n    Glib::Object::operator=(std::move(src));\n    TestInterface::operator=(std::move(src));\n    i_ = std::move(src.i_);\n\n    return *this;\n  }\n\n  int i_;\n\nprivate:\n  friend class DerivedObject_Class;\n  static CppClassType derived_object_class_;\n};\n\nDerivedObject::CppClassType DerivedObject::derived_object_class_; \/\/ initialize static member\n\n\/* Shouldn't this work too?\n * No, because Glib::Interface::Interface(Interface&& src) does not call\n * Glib::ObjectBase::initialize_move(), and Glib::Interface::operator=(Interface&& src)\n * does not call Glib::ObjectBase::operator=(std::move(src)).\nstatic\nvoid test_interface_move_constructor()\n{\n  GObject *gobject = G_OBJECT(g_object_new(TEST_TYPE_DERIVED, nullptr));\n  g_object_ref(gobject);\n\n  TestInterface derived(gobject, 5);\n  std::cout << \"debug: gobj(): \" << derived.gobj() << std::endl;\n  g_assert(derived.gobj() == gobject);\n  TestInterface derived2(std::move(derived));\n  g_assert_cmpint(derived2.i_, ==, 5);\n  std::cout << \"debug: gobj(): \" << derived2.gobj() << std::endl;\n  g_assert(derived2.gobj() == gobject);\n}\n\nstatic\nvoid test_interface_move_assignment_operator()\n{\n  GObject *gobject = G_OBJECT(g_object_new(TEST_TYPE_DERIVED, nullptr));\n  g_object_ref(gobject);\n\n  TestInterface derived(gobject, 5);\n  \/\/std::cout << \"debug: gobj(): \" << derived.gobj() << std::endl;\n  g_assert(derived.gobj() == gobject);\n  TestInterface derived2 = std::move(derived);\n  g_assert_cmpint(derived2.i_, ==, 5);\n  \/\/std::cout << \"debug: gobj(): \" << derived2.gobj() << std::endl;\n  g_assert(derived2.gobj() == gobject);\n}\n*\/\n\nstatic void\ntest_object_with_interface_move_constructor()\n{\n  DerivedObject derived(5);\n  g_assert_cmpint(derived.i_, ==, 5);\n  GObject* gobject = derived.gobj();\n  g_assert(derived.gobj() == gobject);\n\n  DerivedObject derived2(std::move(derived));\n  g_assert_cmpint(derived2.i_, ==, 5);\n  g_assert(derived2.gobj() == gobject);\n  g_assert(derived.gobj() == nullptr);\n}\n\nstatic void\ntest_object_with_interface_move_assignment_operator()\n{\n  DerivedObject derived(5);\n  g_assert_cmpint(derived.i_, ==, 5);\n  GObject* gobject = derived.gobj();\n  g_assert(derived.gobj() == gobject);\n\n  DerivedObject derived2(6);\n  derived2 = std::move(derived);\n  g_assert_cmpint(derived2.i_, ==, 5);\n  g_assert(derived2.gobj() == gobject);\n  g_assert(derived.gobj() == nullptr);\n}\n\nint\nmain(int, char**)\n{\n  Glib::init();\n\n  \/\/ test_interface_move_constructor();\n  \/\/ test_interface_move_assignment_operator();\n\n  test_object_with_interface_move_constructor();\n  test_object_with_interface_move_assignment_operator();\n\n  return EXIT_SUCCESS;\n}\n<commit_msg>tests: Avoid an unused function warnings from G_DECLARE_INTERFACE().<commit_after>#include <glibmm.h>\n#include <glibmm\/private\/interface_p.h>\n#include <glibmm\/private\/object_p.h>\n#include <iostream>\n#include <stdlib.h>\n\n\/\/ A basic derived GInterface, just to test Glib::Interface\n\nG_DECLARE_INTERFACE(TestIface, test_Iface, TEST, IFACE, GObject)\n\nstruct _TestIface\n{\n  GTypeInterface g_iface;\n};\n\nstatic void test_Iface_init(gpointer)\n{\n}\n\nGType\ntest_Iface_get_type(void)\n{\n  \/\/ Avoid compiler warnings about unused functions.\n  \/\/ TODO: With C++17, use [[maybe unused]].\n  (void)TEST_IFACE;\n  (void)TEST_IS_IFACE;\n  (void)TEST_IFACE_GET_IFACE;\n  (void)glib_autoptr_cleanup_TestIface;\n\n  static GType type = 0;\n\n  if (!type)\n  {\n    const GTypeInfo info = {\n      sizeof(TestIface), \/\/ class_size\n      test_Iface_init, \/\/ base_init\n      nullptr, \/\/ base_finalize\n      nullptr, \/\/ class_init\n      nullptr, \/\/ class_finalize\n      nullptr, \/\/ class_data\n      0, \/\/ instance_size\n      0, \/\/ n_preallocs\n      nullptr, \/\/ instance_init\n      nullptr \/\/ value_table\n    };\n\n    type = g_type_register_static(G_TYPE_INTERFACE, \"TestIface\", &info, GTypeFlags(0));\n  }\n\n  return type;\n}\n\n#define TEST_TYPE_IFACE (test_Iface_get_type())\n\n\/\/ A basic derived GObject, just to test Glib::Object.\ntypedef struct\n{\n  GObject parent;\n} TestDerived;\n\ntypedef struct\n{\n  GObjectClass parent;\n} TestDerivedClass;\n\n#define TEST_TYPE_DERIVED (test_derived_get_type())\n#define TEST_DERIVED(obj) (G_TYPE_CHECK_INSTANCE_CAST((obj), TEST_TYPE_DERIVED, TestDerived))\n#define TEST_DERIVED_CLASS(cls) \\\n  (G_TYPE_CHECK_CLASS_CAST((cls), TEST_TYPE_DERIVED, TestDerivedClass))\n#define TEST_DERIVED_GET_CLASS(obj) \\\n  (G_TYPE_INSTANCE_GET_CLASS((obj), TEST_TYPE_DERIVED, TestDerivedClass))\n\nstatic void\ntest_derived_class_init(TestDerivedClass*)\n{\n}\nstatic void\ntest_derived_init(TestDerived*)\n{\n}\n\nG_DEFINE_TYPE_EXTENDED(TestDerived, test_derived, G_TYPE_OBJECT, 0,\n  G_IMPLEMENT_INTERFACE(TEST_TYPE_IFACE, test_Iface_init))\n\nclass TestInterface;\n\nclass TestInterface_Class : public Glib::Interface_Class\n{\npublic:\n  using BaseClassType = TestInterface;\n\n  friend class TestInterface;\n\n  const Glib::Interface_Class& init()\n  {\n    if (!gtype_) \/\/ create the GType if necessary\n    {\n      \/\/ Glib::Interface_Class has to know the interface init function\n      \/\/ in order to add interfaces to implementing types.\n      class_init_func_ = &TestInterface_Class::iface_init_function;\n\n      \/\/ We can not derive from another interface, and it is not necessary anyway.\n      gtype_ = test_Iface_get_type();\n    }\n\n    return *this;\n  }\n\n  static void iface_init_function(void* \/* g_iface *\/, void* \/* iface_data *\/) {}\n\n  \/\/ static Glib::ObjectBase* wrap_new(GObject*);\n};\n\nclass TestInterface : public Glib::Interface\n{\nprotected:\n  using CppClassType = TestInterface_Class;\n\n  TestInterface() : Glib::Interface(derived_interface_class_.init()), i_(0) {}\n\npublic:\n  \/\/ A real application would never make the constructor public.\n  \/\/ It would instead have a protected constructor and a public create() method.\n  TestInterface(GObject* gobject, int i) : Glib::Interface(gobject), i_(i) {}\n\n  static void add_interface(GType gtype_implementer)\n  {\n    derived_interface_class_.init().add_interface(gtype_implementer);\n  }\n\n  TestInterface(const TestInterface& src) = delete;\n  TestInterface& operator=(const TestInterface& src) = delete;\n\n  TestInterface(TestInterface&& src) noexcept : Glib::Interface(std::move(src)),\n                                                i_(std::move(src.i_))\n  {\n  }\n\n  TestInterface& operator=(TestInterface&& src) noexcept\n  {\n    Glib::Interface::operator=(std::move(src));\n    i_ = std::move(src.i_);\n\n    return *this;\n  }\n\n  int i_;\n\nprivate:\n  friend class TestInterface_Class;\n  static CppClassType derived_interface_class_;\n};\n\nclass DerivedObject_Class : public Glib::Class\n{\npublic:\n  using BaseClassType = GObjectClass;\n  using CppClassParent = Glib::Object_Class;\n\n  static void class_init_function(void* g_class, void* class_data)\n  {\n    const auto klass = static_cast<BaseClassType*>(g_class);\n    CppClassParent::class_init_function(klass, class_data);\n  }\n\n  const Glib::Class& init()\n  {\n    if (!gtype_) \/\/ create the GType if necessary\n    {\n      \/\/ Glib::Class has to know the class init function to clone custom types.\n      class_init_func_ = &DerivedObject_Class::class_init_function;\n\n      \/\/ This is actually just optimized away, apparently with no harm.\n      \/\/ Make sure that the parent type has been created.\n      \/\/ CppClassParent::CppObjectType::get_type();\n\n      \/\/ Create the wrapper type, with the same class\/instance size as the base type.\n      register_derived_type(test_derived_get_type());\n\n      \/\/ Add derived versions of interfaces, if the C type implements any interfaces:\n      TestInterface::add_interface(get_type());\n    }\n\n    return *this;\n  }\n};\n\nTestInterface::CppClassType TestInterface::derived_interface_class_; \/\/ initialize static member\n\nclass DerivedObject : public Glib::Object, public TestInterface\n{\npublic:\n  using CppClassType = DerivedObject_Class;\n\n  \/\/ A real application would never make the constructor public.\n  \/\/ It would instead have a protected constructor and a public create() method.\n  explicit DerivedObject(int i)\n  : Glib::ObjectBase(nullptr),\n    Glib::Object(Glib::ConstructParams(derived_object_class_.init())),\n    i_(i)\n  {\n  }\n\n  DerivedObject(const DerivedObject& src) = delete;\n  DerivedObject& operator=(const DerivedObject& src) = delete;\n\n  DerivedObject(DerivedObject&& src) noexcept : Glib::Object(std::move(src)),\n                                                TestInterface(std::move(src)),\n                                                i_(std::move(src.i_))\n  {\n  }\n\n  DerivedObject& operator=(DerivedObject&& src) noexcept\n  {\n    Glib::Object::operator=(std::move(src));\n    TestInterface::operator=(std::move(src));\n    i_ = std::move(src.i_);\n\n    return *this;\n  }\n\n  int i_;\n\nprivate:\n  friend class DerivedObject_Class;\n  static CppClassType derived_object_class_;\n};\n\nDerivedObject::CppClassType DerivedObject::derived_object_class_; \/\/ initialize static member\n\n\/* Shouldn't this work too?\n * No, because Glib::Interface::Interface(Interface&& src) does not call\n * Glib::ObjectBase::initialize_move(), and Glib::Interface::operator=(Interface&& src)\n * does not call Glib::ObjectBase::operator=(std::move(src)).\nstatic\nvoid test_interface_move_constructor()\n{\n  GObject *gobject = G_OBJECT(g_object_new(TEST_TYPE_DERIVED, nullptr));\n  g_object_ref(gobject);\n\n  TestInterface derived(gobject, 5);\n  std::cout << \"debug: gobj(): \" << derived.gobj() << std::endl;\n  g_assert(derived.gobj() == gobject);\n  TestInterface derived2(std::move(derived));\n  g_assert_cmpint(derived2.i_, ==, 5);\n  std::cout << \"debug: gobj(): \" << derived2.gobj() << std::endl;\n  g_assert(derived2.gobj() == gobject);\n}\n\nstatic\nvoid test_interface_move_assignment_operator()\n{\n  GObject *gobject = G_OBJECT(g_object_new(TEST_TYPE_DERIVED, nullptr));\n  g_object_ref(gobject);\n\n  TestInterface derived(gobject, 5);\n  \/\/std::cout << \"debug: gobj(): \" << derived.gobj() << std::endl;\n  g_assert(derived.gobj() == gobject);\n  TestInterface derived2 = std::move(derived);\n  g_assert_cmpint(derived2.i_, ==, 5);\n  \/\/std::cout << \"debug: gobj(): \" << derived2.gobj() << std::endl;\n  g_assert(derived2.gobj() == gobject);\n}\n*\/\n\nstatic void\ntest_object_with_interface_move_constructor()\n{\n  DerivedObject derived(5);\n  g_assert_cmpint(derived.i_, ==, 5);\n  GObject* gobject = derived.gobj();\n  g_assert(derived.gobj() == gobject);\n\n  DerivedObject derived2(std::move(derived));\n  g_assert_cmpint(derived2.i_, ==, 5);\n  g_assert(derived2.gobj() == gobject);\n  g_assert(derived.gobj() == nullptr);\n}\n\nstatic void\ntest_object_with_interface_move_assignment_operator()\n{\n  DerivedObject derived(5);\n  g_assert_cmpint(derived.i_, ==, 5);\n  GObject* gobject = derived.gobj();\n  g_assert(derived.gobj() == gobject);\n\n  DerivedObject derived2(6);\n  derived2 = std::move(derived);\n  g_assert_cmpint(derived2.i_, ==, 5);\n  g_assert(derived2.gobj() == gobject);\n  g_assert(derived.gobj() == nullptr);\n}\n\nint\nmain(int, char**)\n{\n  Glib::init();\n\n  \/\/ test_interface_move_constructor();\n  \/\/ test_interface_move_assignment_operator();\n\n  test_object_with_interface_move_constructor();\n  test_object_with_interface_move_assignment_operator();\n\n  return EXIT_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===--- AST.cpp - Utility AST functions  -----------------------*- 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 \"AST.h\"\n\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/AST\/Decl.h\"\n#include \"clang\/AST\/DeclTemplate.h\"\n#include \"clang\/AST\/TemplateBase.h\"\n#include \"clang\/Basic\/SourceLocation.h\"\n#include \"clang\/Basic\/SourceManager.h\"\n#include \"clang\/Index\/USRGeneration.h\"\n#include \"llvm\/ADT\/Optional.h\"\n#include \"llvm\/Support\/Casting.h\"\n#include \"llvm\/Support\/ScopedPrinter.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\nnamespace clang {\nnamespace clangd {\n\nnamespace {\nllvm::Optional<llvm::ArrayRef<TemplateArgumentLoc>>\ngetTemplateSpecializationArgLocs(const NamedDecl &ND) {\n  if (auto *Func = llvm::dyn_cast<FunctionDecl>(&ND)) {\n    if (const ASTTemplateArgumentListInfo *Args =\n            Func->getTemplateSpecializationArgsAsWritten())\n      return Args->arguments();\n  } else if (auto *Cls =\n                 llvm::dyn_cast<ClassTemplatePartialSpecializationDecl>(&ND)) {\n    if (auto *Args = Cls->getTemplateArgsAsWritten())\n      return Args->arguments();\n  } else if (auto *Var = llvm::dyn_cast<VarTemplateSpecializationDecl>(&ND))\n    return Var->getTemplateArgsInfo().arguments();\n  \/\/ We return None for ClassTemplateSpecializationDecls because it does not\n  \/\/ contain TemplateArgumentLoc information.\n  return llvm::None;\n}\n} \/\/ namespace\n\n\/\/ Returns true if the complete name of decl \\p D is spelled in the source code.\n\/\/ This is not the case for:\n\/\/   * symbols formed via macro concatenation, the spelling location will\n\/\/     be \"<scratch space>\"\n\/\/   * symbols controlled and defined by a compile command-line option\n\/\/     `-DName=foo`, the spelling location will be \"<command line>\".\nbool isSpelledInSourceCode(const Decl *D) {\n  const auto &SM = D->getASTContext().getSourceManager();\n  auto Loc = D->getLocation();\n  \/\/ FIXME: Revisit the strategy, the heuristic is limitted when handling\n  \/\/ macros, we should use the location where the whole definition occurs.\n  if (Loc.isMacroID()) {\n    std::string PrintLoc = SM.getSpellingLoc(Loc).printToString(SM);\n    if (llvm::StringRef(PrintLoc).startswith(\"<scratch\") ||\n        llvm::StringRef(PrintLoc).startswith(\"<command line>\"))\n      return false;\n  }\n  return true;\n}\n\nbool isImplementationDetail(const Decl *D) { return !isSpelledInSourceCode(D); }\n\nSourceLocation findNameLoc(const clang::Decl *D) {\n  const auto &SM = D->getASTContext().getSourceManager();\n  if (!isSpelledInSourceCode(D))\n    \/\/ Use the expansion location as spelling location is not interesting.\n    return SM.getExpansionRange(D->getLocation()).getBegin();\n  return SM.getSpellingLoc(D->getLocation());\n}\n\nstd::string printQualifiedName(const NamedDecl &ND) {\n  std::string QName;\n  llvm::raw_string_ostream OS(QName);\n  PrintingPolicy Policy(ND.getASTContext().getLangOpts());\n  \/\/ Note that inline namespaces are treated as transparent scopes. This\n  \/\/ reflects the way they're most commonly used for lookup. Ideally we'd\n  \/\/ include them, but at query time it's hard to find all the inline\n  \/\/ namespaces to query: the preamble doesn't have a dedicated list.\n  Policy.SuppressUnwrittenScope = true;\n  ND.printQualifiedName(OS, Policy);\n  OS.flush();\n  assert(!StringRef(QName).startswith(\"::\"));\n  return QName;\n}\n\nstd::string printName(const ASTContext &Ctx, const NamedDecl &ND) {\n  std::string Name;\n  llvm::raw_string_ostream Out(Name);\n  PrintingPolicy PP(Ctx.getLangOpts());\n  \/\/ Handle 'using namespace'. They all have the same name - <using-directive>.\n  if (auto *UD = llvm::dyn_cast<UsingDirectiveDecl>(&ND)) {\n    Out << \"using namespace \";\n    if (auto *Qual = UD->getQualifier())\n      Qual->print(Out, PP);\n    UD->getNominatedNamespaceAsWritten()->printName(Out);\n    return Out.str();\n  }\n  ND.getDeclName().print(Out, PP);\n  if (!Out.str().empty()) {\n    Out << printTemplateSpecializationArgs(ND);\n    return Out.str();\n  }\n  \/\/ The name was empty, so present an anonymous entity.\n  if (isa<NamespaceDecl>(ND))\n    return \"(anonymous namespace)\";\n  if (auto *Cls = llvm::dyn_cast<RecordDecl>(&ND))\n    return (\"(anonymous \" + Cls->getKindName() + \")\").str();\n  if (isa<EnumDecl>(ND))\n    return \"(anonymous enum)\";\n  return \"(anonymous)\";\n}\n\nstd::string printTemplateSpecializationArgs(const NamedDecl &ND) {\n  std::string TemplateArgs;\n  llvm::raw_string_ostream OS(TemplateArgs);\n  PrintingPolicy Policy(ND.getASTContext().getLangOpts());\n  if (llvm::Optional<llvm::ArrayRef<TemplateArgumentLoc>> Args =\n          getTemplateSpecializationArgLocs(ND)) {\n    printTemplateArgumentList(OS, *Args, Policy);\n  } else if (auto *Cls = llvm::dyn_cast<ClassTemplateSpecializationDecl>(&ND)) {\n    if (const TypeSourceInfo *TSI = Cls->getTypeAsWritten()) {\n      \/\/ ClassTemplateSpecializationDecls do not contain\n      \/\/ TemplateArgumentTypeLocs, they only have TemplateArgumentTypes. So we\n      \/\/ create a new argument location list from TypeSourceInfo.\n      auto STL = TSI->getTypeLoc().getAs<TemplateSpecializationTypeLoc>();\n      llvm::SmallVector<TemplateArgumentLoc, 8> ArgLocs;\n      ArgLocs.reserve(STL.getNumArgs());\n      for (unsigned I = 0; I < STL.getNumArgs(); ++I)\n        ArgLocs.push_back(STL.getArgLoc(I));\n      printTemplateArgumentList(OS, ArgLocs, Policy);\n    } else {\n      \/\/ FIXME: Fix cases when getTypeAsWritten returns null inside clang AST,\n      \/\/ e.g. friend decls. Currently we fallback to Template Arguments without\n      \/\/ location information.\n      printTemplateArgumentList(OS, Cls->getTemplateArgs().asArray(), Policy);\n    }\n  }\n  OS.flush();\n  return TemplateArgs;\n}\n\nstd::string printNamespaceScope(const DeclContext &DC) {\n  for (const auto *Ctx = &DC; Ctx != nullptr; Ctx = Ctx->getParent())\n    if (const auto *NS = dyn_cast<NamespaceDecl>(Ctx))\n      if (!NS->isAnonymousNamespace() && !NS->isInlineNamespace())\n        return printQualifiedName(*NS) + \"::\";\n  return \"\";\n}\n\nllvm::Optional<SymbolID> getSymbolID(const Decl *D) {\n  llvm::SmallString<128> USR;\n  if (index::generateUSRForDecl(D, USR))\n    return None;\n  return SymbolID(USR);\n}\n\nllvm::Optional<SymbolID> getSymbolID(const IdentifierInfo &II,\n                                     const MacroInfo *MI,\n                                     const SourceManager &SM) {\n  if (MI == nullptr)\n    return None;\n  llvm::SmallString<128> USR;\n  if (index::generateUSRForMacro(II.getName(), MI->getDefinitionLoc(), SM, USR))\n    return None;\n  return SymbolID(USR);\n}\n\nstd::string shortenNamespace(const llvm::StringRef OriginalName,\n                             const llvm::StringRef CurrentNamespace) {\n  llvm::SmallVector<llvm::StringRef, 8> OriginalParts;\n  llvm::SmallVector<llvm::StringRef, 8> CurrentParts;\n  llvm::SmallVector<llvm::StringRef, 8> Result;\n  OriginalName.split(OriginalParts, \"::\");\n  CurrentNamespace.split(CurrentParts, \"::\");\n  auto MinLength = std::min(CurrentParts.size(), OriginalParts.size());\n\n  unsigned DifferentAt = 0;\n  while (DifferentAt < MinLength &&\n      CurrentParts[DifferentAt] == OriginalParts[DifferentAt]) {\n    DifferentAt++;\n  }\n\n  for (u_int i = DifferentAt; i < OriginalParts.size(); ++i) {\n    Result.push_back(OriginalParts[i]);\n  }\n  return join(Result, \"::\");\n}\n\nstd::string printType(const QualType QT, const DeclContext & Context){\n  PrintingPolicy PP(Context.getParentASTContext().getPrintingPolicy());\n  PP.SuppressTagKeyword = 1;\n  return shortenNamespace(\n      QT.getAsString(PP),\n      printNamespaceScope(Context) );\n}\n\n\n} \/\/ namespace clangd\n} \/\/ namespace clang\n<commit_msg>[clangd] Fix MSVC build failure.<commit_after>\/\/===--- AST.cpp - Utility AST functions  -----------------------*- 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 \"AST.h\"\n\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/AST\/Decl.h\"\n#include \"clang\/AST\/DeclTemplate.h\"\n#include \"clang\/AST\/TemplateBase.h\"\n#include \"clang\/Basic\/SourceLocation.h\"\n#include \"clang\/Basic\/SourceManager.h\"\n#include \"clang\/Index\/USRGeneration.h\"\n#include \"llvm\/ADT\/Optional.h\"\n#include \"llvm\/Support\/Casting.h\"\n#include \"llvm\/Support\/ScopedPrinter.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\nnamespace clang {\nnamespace clangd {\n\nnamespace {\nllvm::Optional<llvm::ArrayRef<TemplateArgumentLoc>>\ngetTemplateSpecializationArgLocs(const NamedDecl &ND) {\n  if (auto *Func = llvm::dyn_cast<FunctionDecl>(&ND)) {\n    if (const ASTTemplateArgumentListInfo *Args =\n            Func->getTemplateSpecializationArgsAsWritten())\n      return Args->arguments();\n  } else if (auto *Cls =\n                 llvm::dyn_cast<ClassTemplatePartialSpecializationDecl>(&ND)) {\n    if (auto *Args = Cls->getTemplateArgsAsWritten())\n      return Args->arguments();\n  } else if (auto *Var = llvm::dyn_cast<VarTemplateSpecializationDecl>(&ND))\n    return Var->getTemplateArgsInfo().arguments();\n  \/\/ We return None for ClassTemplateSpecializationDecls because it does not\n  \/\/ contain TemplateArgumentLoc information.\n  return llvm::None;\n}\n} \/\/ namespace\n\n\/\/ Returns true if the complete name of decl \\p D is spelled in the source code.\n\/\/ This is not the case for:\n\/\/   * symbols formed via macro concatenation, the spelling location will\n\/\/     be \"<scratch space>\"\n\/\/   * symbols controlled and defined by a compile command-line option\n\/\/     `-DName=foo`, the spelling location will be \"<command line>\".\nbool isSpelledInSourceCode(const Decl *D) {\n  const auto &SM = D->getASTContext().getSourceManager();\n  auto Loc = D->getLocation();\n  \/\/ FIXME: Revisit the strategy, the heuristic is limitted when handling\n  \/\/ macros, we should use the location where the whole definition occurs.\n  if (Loc.isMacroID()) {\n    std::string PrintLoc = SM.getSpellingLoc(Loc).printToString(SM);\n    if (llvm::StringRef(PrintLoc).startswith(\"<scratch\") ||\n        llvm::StringRef(PrintLoc).startswith(\"<command line>\"))\n      return false;\n  }\n  return true;\n}\n\nbool isImplementationDetail(const Decl *D) { return !isSpelledInSourceCode(D); }\n\nSourceLocation findNameLoc(const clang::Decl *D) {\n  const auto &SM = D->getASTContext().getSourceManager();\n  if (!isSpelledInSourceCode(D))\n    \/\/ Use the expansion location as spelling location is not interesting.\n    return SM.getExpansionRange(D->getLocation()).getBegin();\n  return SM.getSpellingLoc(D->getLocation());\n}\n\nstd::string printQualifiedName(const NamedDecl &ND) {\n  std::string QName;\n  llvm::raw_string_ostream OS(QName);\n  PrintingPolicy Policy(ND.getASTContext().getLangOpts());\n  \/\/ Note that inline namespaces are treated as transparent scopes. This\n  \/\/ reflects the way they're most commonly used for lookup. Ideally we'd\n  \/\/ include them, but at query time it's hard to find all the inline\n  \/\/ namespaces to query: the preamble doesn't have a dedicated list.\n  Policy.SuppressUnwrittenScope = true;\n  ND.printQualifiedName(OS, Policy);\n  OS.flush();\n  assert(!StringRef(QName).startswith(\"::\"));\n  return QName;\n}\n\nstd::string printName(const ASTContext &Ctx, const NamedDecl &ND) {\n  std::string Name;\n  llvm::raw_string_ostream Out(Name);\n  PrintingPolicy PP(Ctx.getLangOpts());\n  \/\/ Handle 'using namespace'. They all have the same name - <using-directive>.\n  if (auto *UD = llvm::dyn_cast<UsingDirectiveDecl>(&ND)) {\n    Out << \"using namespace \";\n    if (auto *Qual = UD->getQualifier())\n      Qual->print(Out, PP);\n    UD->getNominatedNamespaceAsWritten()->printName(Out);\n    return Out.str();\n  }\n  ND.getDeclName().print(Out, PP);\n  if (!Out.str().empty()) {\n    Out << printTemplateSpecializationArgs(ND);\n    return Out.str();\n  }\n  \/\/ The name was empty, so present an anonymous entity.\n  if (isa<NamespaceDecl>(ND))\n    return \"(anonymous namespace)\";\n  if (auto *Cls = llvm::dyn_cast<RecordDecl>(&ND))\n    return (\"(anonymous \" + Cls->getKindName() + \")\").str();\n  if (isa<EnumDecl>(ND))\n    return \"(anonymous enum)\";\n  return \"(anonymous)\";\n}\n\nstd::string printTemplateSpecializationArgs(const NamedDecl &ND) {\n  std::string TemplateArgs;\n  llvm::raw_string_ostream OS(TemplateArgs);\n  PrintingPolicy Policy(ND.getASTContext().getLangOpts());\n  if (llvm::Optional<llvm::ArrayRef<TemplateArgumentLoc>> Args =\n          getTemplateSpecializationArgLocs(ND)) {\n    printTemplateArgumentList(OS, *Args, Policy);\n  } else if (auto *Cls = llvm::dyn_cast<ClassTemplateSpecializationDecl>(&ND)) {\n    if (const TypeSourceInfo *TSI = Cls->getTypeAsWritten()) {\n      \/\/ ClassTemplateSpecializationDecls do not contain\n      \/\/ TemplateArgumentTypeLocs, they only have TemplateArgumentTypes. So we\n      \/\/ create a new argument location list from TypeSourceInfo.\n      auto STL = TSI->getTypeLoc().getAs<TemplateSpecializationTypeLoc>();\n      llvm::SmallVector<TemplateArgumentLoc, 8> ArgLocs;\n      ArgLocs.reserve(STL.getNumArgs());\n      for (unsigned I = 0; I < STL.getNumArgs(); ++I)\n        ArgLocs.push_back(STL.getArgLoc(I));\n      printTemplateArgumentList(OS, ArgLocs, Policy);\n    } else {\n      \/\/ FIXME: Fix cases when getTypeAsWritten returns null inside clang AST,\n      \/\/ e.g. friend decls. Currently we fallback to Template Arguments without\n      \/\/ location information.\n      printTemplateArgumentList(OS, Cls->getTemplateArgs().asArray(), Policy);\n    }\n  }\n  OS.flush();\n  return TemplateArgs;\n}\n\nstd::string printNamespaceScope(const DeclContext &DC) {\n  for (const auto *Ctx = &DC; Ctx != nullptr; Ctx = Ctx->getParent())\n    if (const auto *NS = dyn_cast<NamespaceDecl>(Ctx))\n      if (!NS->isAnonymousNamespace() && !NS->isInlineNamespace())\n        return printQualifiedName(*NS) + \"::\";\n  return \"\";\n}\n\nllvm::Optional<SymbolID> getSymbolID(const Decl *D) {\n  llvm::SmallString<128> USR;\n  if (index::generateUSRForDecl(D, USR))\n    return None;\n  return SymbolID(USR);\n}\n\nllvm::Optional<SymbolID> getSymbolID(const IdentifierInfo &II,\n                                     const MacroInfo *MI,\n                                     const SourceManager &SM) {\n  if (MI == nullptr)\n    return None;\n  llvm::SmallString<128> USR;\n  if (index::generateUSRForMacro(II.getName(), MI->getDefinitionLoc(), SM, USR))\n    return None;\n  return SymbolID(USR);\n}\n\nstd::string shortenNamespace(const llvm::StringRef OriginalName,\n                             const llvm::StringRef CurrentNamespace) {\n  llvm::SmallVector<llvm::StringRef, 8> OriginalParts;\n  llvm::SmallVector<llvm::StringRef, 8> CurrentParts;\n  llvm::SmallVector<llvm::StringRef, 8> Result;\n  OriginalName.split(OriginalParts, \"::\");\n  CurrentNamespace.split(CurrentParts, \"::\");\n  auto MinLength = std::min(CurrentParts.size(), OriginalParts.size());\n\n  unsigned DifferentAt = 0;\n  while (DifferentAt < MinLength &&\n      CurrentParts[DifferentAt] == OriginalParts[DifferentAt]) {\n    DifferentAt++;\n  }\n\n  for (unsigned i = DifferentAt; i < OriginalParts.size(); ++i) {\n    Result.push_back(OriginalParts[i]);\n  }\n  return join(Result, \"::\");\n}\n\nstd::string printType(const QualType QT, const DeclContext & Context){\n  PrintingPolicy PP(Context.getParentASTContext().getPrintingPolicy());\n  PP.SuppressTagKeyword = 1;\n  return shortenNamespace(\n      QT.getAsString(PP),\n      printNamespaceScope(Context) );\n}\n\n\n} \/\/ namespace clangd\n} \/\/ namespace clang\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkTDxWinDevice.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 \"vtkTDxWinDevice.h\"\n\n\/\/ Most of the code is derived from the SDK with sample code\n\/\/ Cube3dPolling.cpp from archive Cube3Dpolling.zip from 3DConnexion.\n\n#include <assert.h>\n\n#include \"vtkTDxMotionEventInfo.h\"\n#include \"vtkCommand.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkRenderWindowInteractor.h\"\n\nvtkCxxRevisionMacro(vtkTDxWinDevice,\"1.3\");\nvtkStandardNewMacro(vtkTDxWinDevice);\n\n#include \"atlbase.h\" \/\/ for CComPtr<> (a smart pointer)\n\n\/\/ for ISensor and IKeyboard\n#import \"progid:TDxInput.Device.1\" no_namespace\n\nVOID CALLBACK vtkTDxWinDeviceTimerProc(HWND hwnd,\n                                       UINT uMsg,\n                                       UINT_PTR idEvent,\n                                       DWORD dwTime);\n\n\/\/ It would be better to have the following variables as member of variable\n\/\/ but the SetTimer on windows is only initialized with a function pointer\n\/\/ without calldata.\n\nclass vtkTDxWinDevicePrivate\n{\npublic:\n  vtkTDxWinDevicePrivate()\n    {\n      this->Sensor=0;\n      this->Keyboard=0;\n      this->KeyStates=0;\n      this->LastTimeStamp=0;\n      this->Interactor=0;\n    }\n  CComPtr<ISensor> Sensor;\n  CComPtr<IKeyboard> Keyboard;\n  __int64 KeyStates;\n  DWORD LastTimeStamp;\n  vtkRenderWindowInteractor *Interactor;\n};\n\nvtkTDxWinDevicePrivate vtkTDxWinDevicePrivateObject;\n\nHRESULT HresultCodes[13]={S_OK,\n                          REGDB_E_CLASSNOTREG,\n                          CLASS_E_NOAGGREGATION,\n                          E_NOINTERFACE,\n                          E_POINTER,\n                          E_ABORT,\n                          E_ACCESSDENIED,\n                          E_FAIL,\n                          E_HANDLE,\n                          E_INVALIDARG,\n                          E_NOTIMPL,\n                          E_OUTOFMEMORY,\n                          E_UNEXPECTED};\n\nconst char *HresultStrings[13]={\"S_OK\",\n                                \"REGDB_E_CLASSNOTREG\",\n                                \"CLASS_E_NOAGGREGATION\",\n                                \"E_NOINTERFACE\",\n                                \"E_POINTER\",\n                                \"E_ABORT\",\n                                \"E_ACCESSDENIED\",\n                                \"E_FAIL\",\n                                \"E_HANDLE\",\n                                \"E_INVALIDARG\",\n                                \"E_NOTIMPL\",\n                                \"E_OUTOFMEMORY\",\n                                \"E_UNEXPECTED\"};\n\n\/\/ ----------------------------------------------------------------------------\n\/\/ Description:\n\/\/ Return a human readable version of an HRESULT.\nconst char *HresultCodeToString(HRESULT hr)\n{\n  int i=0;\n  bool found=false;\n  while(!found && i<13)\n    {\n    found=HresultCodes[i]==hr;\n    ++i;\n    }\n  const char *result;\n  if(found)\n    {\n    result=HresultStrings[i-1];\n    }\n  else\n    {\n    result=\"unknown\";\n    }\n  return result;\n}\n\n\/\/ ----------------------------------------------------------------------------\n\/\/ Description:\n\/\/ Default constructor.\nvtkTDxWinDevice::vtkTDxWinDevice()\n{\n\/\/  this->DebugOn();\n}\n  \n\/\/ ----------------------------------------------------------------------------\n\/\/ Description:\n\/\/ Destructor. If the device is not initialized, do nothing. If the device\n\/\/ is initialized, close the device.\nvtkTDxWinDevice::~vtkTDxWinDevice()\n{\n  if(this->Initialized)\n    {\n    this->Close();\n    }\n}\n  \n\/\/ ----------------------------------------------------------------------------\n\/\/ Description:\n\/\/ Initialize the device with the current display and window ids.\n\/\/ It updates the value of GetInitialized().\n\/\/ Initialization can fail. You must look for the value of\n\/\/ GetInitialized() before processing further.\n\/\/ \\pre not_yet_initialized: !GetInitialized()\nvoid vtkTDxWinDevice::Initialize()\n{\n  assert(\"pre: not_yet_initialized\" && !this->GetInitialized());\n  \n  bool status=false;\n  \n  HRESULT hr=0;\n  CComPtr<IUnknown> device;\n\n   hr=::CoInitializeEx(NULL, COINIT_APARTMENTTHREADED );\n   if (!SUCCEEDED(hr))\n   {\n   vtkWarningMacro( << \"CoInitializeEx failed. hresult=0x\" << hex << hr << dec << HresultCodeToString(hr));\n   this->Initialized=status;\n   return;\n   }\n\n  \/\/ Create the device object\n  hr=device.CoCreateInstance(__uuidof(Device));\n  status=SUCCEEDED(hr);\n  if(status)\n    {\n    CComPtr<ISimpleDevice> d;\n    \n    hr=device.QueryInterface(&d);\n    status=SUCCEEDED(hr);\n    if(status)\n      {\n      vtkTDxWinDevicePrivate *o=&vtkTDxWinDevicePrivateObject;\n      \n      \/\/ Get the interfaces to the sensor and the keyboard;\n      o->Sensor=d->Sensor;\n      o->Keyboard=d->Keyboard;\n      o->Interactor=this->Interactor;\n      \n      \/\/ Connect to the driver\n      d->Connect();\n      \/\/ Create timer used to poll the 3dconnexion device\n      this->TimerId =::SetTimer(NULL,0,25,vtkTDxWinDeviceTimerProc);\n      vtkDebugMacro(<< \"Connected to COM-object for 3dConnexion device.\");\n      }\n    else\n      {\n      vtkWarningMacro(<<\"Could not get the device interface. hresult=0x\" << hex << hr << dec << HresultCodeToString(hr));\n      }\n    }\n  else\n    {\n    vtkWarningMacro( << \"CoCreateInstance failed. hresult=0x\" << hex << hr << dec << HresultCodeToString(hr));\n    }\n  this->Initialized=status;\n}\n\n\/\/ ----------------------------------------------------------------------------\n\/\/ Description:\n\/\/ Close the device. This is called by the destructor.\n\/\/ You don't have to close the device explicitly, as the destructor do it\n\/\/ automatically, but you can.\n\/\/ \\pre initialized: GetInitialized().\n\/\/ \\post restored: !GetInitialized()\nvoid vtkTDxWinDevice::Close()\n{\n  assert(\"pre: initialized\" && this->GetInitialized());\n  \n  vtkDebugMacro(<< \"Close()\" );\n  \n  CComPtr<ISimpleDevice> d;\n  \n  \/\/ Kill the timer used to poll the sensor and keyboard\n  if(this->TimerId!=0)\n    {\n    ::KillTimer(NULL,this->TimerId);\n    this->TimerId=0;\n    }\n  \n  \/\/ Release the sensor and keyboard interfaces\n  vtkTDxWinDevicePrivate *o=&vtkTDxWinDevicePrivateObject;\n  if(o->Sensor!=0)\n    {\n    o->Sensor->get_Device(reinterpret_cast<IDispatch**>(&d));\n    o->Sensor.Release();\n    }\n  \n  if(o->Keyboard!=0)\n    {\n    o->Keyboard.Release();\n    }\n  \n  if(d!=0)\n    {\n    \/\/ Disconnect it from the driver\n    d->Disconnect();\n    d.Release();\n    }\n  \n  this->Initialized=false;\n  \n  assert(\"post: restored\" && !this->GetInitialized());\n}\n\n\/\/ ----------------------------------------------------------------------------\nvoid vtkTDxWinDevice::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os,indent);\n}\n\n\/\/ ----------------------------------------------------------------------------\n\/\/ The timer callback is used to poll the 3d input device for change of\n\/\/ keystates and the cap displacement values.\nVOID CALLBACK vtkTDxWinDeviceTimerProc(HWND vtkNotUsed(hwnd),\n                                       UINT vtkNotUsed(uMsg),\n                                       UINT_PTR vtkNotUsed(idEvent),\n                                       DWORD vtkNotUsed(dwTime))\n{ \n  vtkTDxWinDevicePrivate *o=&vtkTDxWinDevicePrivateObject;\n  \n  if(o->Keyboard!=0)\n    {\n    \/\/ Check if any change to the keyboard state\n    try\n      {\n      long nKeys;\n      nKeys = o->Keyboard->Keys;\n      long i;\n      for (i=1; i<=nKeys; i++)\n        {\n        __int64 mask = (__int64)1<<(i-1);\n        VARIANT_BOOL isPressed;\n        isPressed = o->Keyboard->IsKeyDown(i);\n        if (isPressed == VARIANT_TRUE)\n          {\n          if (!(o->KeyStates & mask))\n            {\n            o->KeyStates |= mask;\n            int buttonInfo=static_cast<int>(i);\n            o->Interactor->InvokeEvent(vtkCommand::TDxButtonPressEvent,\n                                          &buttonInfo);\n            }\n          }\n        else\n          {\n          o->KeyStates &= ~mask;\n          }\n        }\n      \/\/ Test the special keys\n      for (i=30; i<=31; i++)\n        {\n        __int64 mask = (__int64)1<<(i-1);\n        VARIANT_BOOL isPressed;\n        isPressed = o->Keyboard->IsKeyDown(i);\n        if (isPressed == VARIANT_TRUE)\n          {\n          if (!(o->KeyStates & mask))\n            {\n            o->KeyStates |= mask;\n            int buttonInfo=static_cast<int>(i);\n            o->Interactor->InvokeEvent(vtkCommand::TDxButtonPressEvent,\n                                          &buttonInfo);\n            }\n          }\n        else\n          {\n          o->KeyStates &= ~mask;\n          }\n        }\n      }\n    catch (...)\n      {\n      \/\/ Some sort of exception handling\n      }\n    }\n  if(o->Sensor!=0)\n    {\n    try\n      {\n      CComPtr<IAngleAxis> r=o->Sensor->Rotation;\n      CComPtr<IVector3D> t=o->Sensor->Translation;\n      \n      \/\/ On Windows, The angle\/axis object is\n      \/\/ the instant rotation with the vector of rotation+one angle.\n      \/\/ which is different from the Mac and Unix API...\n      \n      \/\/ Check if the cap is still displaced\n      if(r->Angle > 0. || t->Length > 0.)\n        {\n        double timeFactor=1.0;\n        DWORD currentTime=::GetTickCount();\n        if(o->LastTimeStamp!=0)\n          {\n          timeFactor=static_cast<double>(currentTime-o->LastTimeStamp)\n            \/o->Sensor->Period;\n          }\n        o->LastTimeStamp=currentTime;\n        \n        double ScaleRotation=1024.0;\n        double ScaleTranslation=512.0;\n        double Sensitivity=1.0;\n        \n        t->Length \/= ScaleTranslation*Sensitivity;\n        r->Angle \/= ScaleRotation*Sensitivity;\n        \n#if 0\n        MathFrame FrameTransRot;\n        MathFrameTranslation(&FrameTransRot, pTranslation->X, pTranslation->Y, pTranslation->Z);\n        \n        \n        MathFrameRotation( &FrameTransRot, \n                           pRotation->X * pRotation->Angle, \n                           pRotation->Y * pRotation->Angle,\n                           pRotation->Z * pRotation->Angle );\n        \n        MathFrameMultiplication( &FrameTransRot, &FrameCube, &FrameCube );\n        if ( FrameCube.MathTranslation[2] > NearPosition )\n          {\n          FrameCube.MathTranslation[2] = NearPosition;\n          }\n        \n        if (MainhWnd)\n          {\n          DisplayCube( MainhWnd, &FrameCube, &VGAVideo );\n          }\n#endif\n        vtkTDxMotionEventInfo motionInfo;\n        motionInfo.X=t->X;\n        motionInfo.Y=t->Y;\n        motionInfo.Z=t->Z;\n        motionInfo.A=r->Angle*r->X; \/\/ yes, this is wrong, TODO\n        motionInfo.B=100.0*r->Angle*r->Y;\n        motionInfo.C=r->Angle*r->Z;\n        o->Interactor->InvokeEvent(vtkCommand::TDxMotionEvent,\n                                   &motionInfo);\n        }\n      else\n        {\n        o->LastTimeStamp=0;\n        }\n      r.Release();\n      t.Release();\n      }\n    catch (...)\n      {\n      \/\/ Some sort of exception handling\n      }\n    }\n}\n<commit_msg>COMP:Fixing missing header file for COInitializeEx. Depending on the build configuration, this header might be required<commit_after>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkTDxWinDevice.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 \"vtkTDxWinDevice.h\"\n\n\/\/ Most of the code is derived from the SDK with sample code\n\/\/ Cube3dPolling.cpp from archive Cube3Dpolling.zip from 3DConnexion.\n\n#include <assert.h>\n\n#include \"vtkTDxMotionEventInfo.h\"\n#include \"vtkCommand.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkRenderWindowInteractor.h\"\n\nvtkCxxRevisionMacro(vtkTDxWinDevice,\"1.4\");\nvtkStandardNewMacro(vtkTDxWinDevice);\n\n#include \"atlbase.h\" \/\/ for CComPtr<> (a smart pointer)\n#include <Objbase.h> \/\/ for CoInitializeEx\n\n\/\/ for ISensor and IKeyboard\n#import \"progid:TDxInput.Device.1\" no_namespace\n\nVOID CALLBACK vtkTDxWinDeviceTimerProc(HWND hwnd,\n                                       UINT uMsg,\n                                       UINT_PTR idEvent,\n                                       DWORD dwTime);\n\n\/\/ It would be better to have the following variables as member of variable\n\/\/ but the SetTimer on windows is only initialized with a function pointer\n\/\/ without calldata.\n\nclass vtkTDxWinDevicePrivate\n{\npublic:\n  vtkTDxWinDevicePrivate()\n    {\n      this->Sensor=0;\n      this->Keyboard=0;\n      this->KeyStates=0;\n      this->LastTimeStamp=0;\n      this->Interactor=0;\n    }\n  CComPtr<ISensor> Sensor;\n  CComPtr<IKeyboard> Keyboard;\n  __int64 KeyStates;\n  DWORD LastTimeStamp;\n  vtkRenderWindowInteractor *Interactor;\n};\n\nvtkTDxWinDevicePrivate vtkTDxWinDevicePrivateObject;\n\nHRESULT HresultCodes[13]={S_OK,\n                          REGDB_E_CLASSNOTREG,\n                          CLASS_E_NOAGGREGATION,\n                          E_NOINTERFACE,\n                          E_POINTER,\n                          E_ABORT,\n                          E_ACCESSDENIED,\n                          E_FAIL,\n                          E_HANDLE,\n                          E_INVALIDARG,\n                          E_NOTIMPL,\n                          E_OUTOFMEMORY,\n                          E_UNEXPECTED};\n\nconst char *HresultStrings[13]={\"S_OK\",\n                                \"REGDB_E_CLASSNOTREG\",\n                                \"CLASS_E_NOAGGREGATION\",\n                                \"E_NOINTERFACE\",\n                                \"E_POINTER\",\n                                \"E_ABORT\",\n                                \"E_ACCESSDENIED\",\n                                \"E_FAIL\",\n                                \"E_HANDLE\",\n                                \"E_INVALIDARG\",\n                                \"E_NOTIMPL\",\n                                \"E_OUTOFMEMORY\",\n                                \"E_UNEXPECTED\"};\n\n\/\/ ----------------------------------------------------------------------------\n\/\/ Description:\n\/\/ Return a human readable version of an HRESULT.\nconst char *HresultCodeToString(HRESULT hr)\n{\n  int i=0;\n  bool found=false;\n  while(!found && i<13)\n    {\n    found=HresultCodes[i]==hr;\n    ++i;\n    }\n  const char *result;\n  if(found)\n    {\n    result=HresultStrings[i-1];\n    }\n  else\n    {\n    result=\"unknown\";\n    }\n  return result;\n}\n\n\/\/ ----------------------------------------------------------------------------\n\/\/ Description:\n\/\/ Default constructor.\nvtkTDxWinDevice::vtkTDxWinDevice()\n{\n\/\/  this->DebugOn();\n}\n  \n\/\/ ----------------------------------------------------------------------------\n\/\/ Description:\n\/\/ Destructor. If the device is not initialized, do nothing. If the device\n\/\/ is initialized, close the device.\nvtkTDxWinDevice::~vtkTDxWinDevice()\n{\n  if(this->Initialized)\n    {\n    this->Close();\n    }\n}\n  \n\/\/ ----------------------------------------------------------------------------\n\/\/ Description:\n\/\/ Initialize the device with the current display and window ids.\n\/\/ It updates the value of GetInitialized().\n\/\/ Initialization can fail. You must look for the value of\n\/\/ GetInitialized() before processing further.\n\/\/ \\pre not_yet_initialized: !GetInitialized()\nvoid vtkTDxWinDevice::Initialize()\n{\n  assert(\"pre: not_yet_initialized\" && !this->GetInitialized());\n  \n  bool status=false;\n  \n  HRESULT hr=0;\n  CComPtr<IUnknown> device;\n\n   hr=::CoInitializeEx(NULL, COINIT_APARTMENTTHREADED );\n   if (!SUCCEEDED(hr))\n   {\n   vtkWarningMacro( << \"CoInitializeEx failed. hresult=0x\" << hex << hr << dec << HresultCodeToString(hr));\n   this->Initialized=status;\n   return;\n   }\n\n  \/\/ Create the device object\n  hr=device.CoCreateInstance(__uuidof(Device));\n  status=SUCCEEDED(hr);\n  if(status)\n    {\n    CComPtr<ISimpleDevice> d;\n    \n    hr=device.QueryInterface(&d);\n    status=SUCCEEDED(hr);\n    if(status)\n      {\n      vtkTDxWinDevicePrivate *o=&vtkTDxWinDevicePrivateObject;\n      \n      \/\/ Get the interfaces to the sensor and the keyboard;\n      o->Sensor=d->Sensor;\n      o->Keyboard=d->Keyboard;\n      o->Interactor=this->Interactor;\n      \n      \/\/ Connect to the driver\n      d->Connect();\n      \/\/ Create timer used to poll the 3dconnexion device\n      this->TimerId =::SetTimer(NULL,0,25,vtkTDxWinDeviceTimerProc);\n      vtkDebugMacro(<< \"Connected to COM-object for 3dConnexion device.\");\n      }\n    else\n      {\n      vtkWarningMacro(<<\"Could not get the device interface. hresult=0x\" << hex << hr << dec << HresultCodeToString(hr));\n      }\n    }\n  else\n    {\n    vtkWarningMacro( << \"CoCreateInstance failed. hresult=0x\" << hex << hr << dec << HresultCodeToString(hr));\n    }\n  this->Initialized=status;\n}\n\n\/\/ ----------------------------------------------------------------------------\n\/\/ Description:\n\/\/ Close the device. This is called by the destructor.\n\/\/ You don't have to close the device explicitly, as the destructor do it\n\/\/ automatically, but you can.\n\/\/ \\pre initialized: GetInitialized().\n\/\/ \\post restored: !GetInitialized()\nvoid vtkTDxWinDevice::Close()\n{\n  assert(\"pre: initialized\" && this->GetInitialized());\n  \n  vtkDebugMacro(<< \"Close()\" );\n  \n  CComPtr<ISimpleDevice> d;\n  \n  \/\/ Kill the timer used to poll the sensor and keyboard\n  if(this->TimerId!=0)\n    {\n    ::KillTimer(NULL,this->TimerId);\n    this->TimerId=0;\n    }\n  \n  \/\/ Release the sensor and keyboard interfaces\n  vtkTDxWinDevicePrivate *o=&vtkTDxWinDevicePrivateObject;\n  if(o->Sensor!=0)\n    {\n    o->Sensor->get_Device(reinterpret_cast<IDispatch**>(&d));\n    o->Sensor.Release();\n    }\n  \n  if(o->Keyboard!=0)\n    {\n    o->Keyboard.Release();\n    }\n  \n  if(d!=0)\n    {\n    \/\/ Disconnect it from the driver\n    d->Disconnect();\n    d.Release();\n    }\n  \n  this->Initialized=false;\n  \n  assert(\"post: restored\" && !this->GetInitialized());\n}\n\n\/\/ ----------------------------------------------------------------------------\nvoid vtkTDxWinDevice::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os,indent);\n}\n\n\/\/ ----------------------------------------------------------------------------\n\/\/ The timer callback is used to poll the 3d input device for change of\n\/\/ keystates and the cap displacement values.\nVOID CALLBACK vtkTDxWinDeviceTimerProc(HWND vtkNotUsed(hwnd),\n                                       UINT vtkNotUsed(uMsg),\n                                       UINT_PTR vtkNotUsed(idEvent),\n                                       DWORD vtkNotUsed(dwTime))\n{ \n  vtkTDxWinDevicePrivate *o=&vtkTDxWinDevicePrivateObject;\n  \n  if(o->Keyboard!=0)\n    {\n    \/\/ Check if any change to the keyboard state\n    try\n      {\n      long nKeys;\n      nKeys = o->Keyboard->Keys;\n      long i;\n      for (i=1; i<=nKeys; i++)\n        {\n        __int64 mask = (__int64)1<<(i-1);\n        VARIANT_BOOL isPressed;\n        isPressed = o->Keyboard->IsKeyDown(i);\n        if (isPressed == VARIANT_TRUE)\n          {\n          if (!(o->KeyStates & mask))\n            {\n            o->KeyStates |= mask;\n            int buttonInfo=static_cast<int>(i);\n            o->Interactor->InvokeEvent(vtkCommand::TDxButtonPressEvent,\n                                          &buttonInfo);\n            }\n          }\n        else\n          {\n          o->KeyStates &= ~mask;\n          }\n        }\n      \/\/ Test the special keys\n      for (i=30; i<=31; i++)\n        {\n        __int64 mask = (__int64)1<<(i-1);\n        VARIANT_BOOL isPressed;\n        isPressed = o->Keyboard->IsKeyDown(i);\n        if (isPressed == VARIANT_TRUE)\n          {\n          if (!(o->KeyStates & mask))\n            {\n            o->KeyStates |= mask;\n            int buttonInfo=static_cast<int>(i);\n            o->Interactor->InvokeEvent(vtkCommand::TDxButtonPressEvent,\n                                          &buttonInfo);\n            }\n          }\n        else\n          {\n          o->KeyStates &= ~mask;\n          }\n        }\n      }\n    catch (...)\n      {\n      \/\/ Some sort of exception handling\n      }\n    }\n  if(o->Sensor!=0)\n    {\n    try\n      {\n      CComPtr<IAngleAxis> r=o->Sensor->Rotation;\n      CComPtr<IVector3D> t=o->Sensor->Translation;\n      \n      \/\/ On Windows, The angle\/axis object is\n      \/\/ the instant rotation with the vector of rotation+one angle.\n      \/\/ which is different from the Mac and Unix API...\n      \n      \/\/ Check if the cap is still displaced\n      if(r->Angle > 0. || t->Length > 0.)\n        {\n        double timeFactor=1.0;\n        DWORD currentTime=::GetTickCount();\n        if(o->LastTimeStamp!=0)\n          {\n          timeFactor=static_cast<double>(currentTime-o->LastTimeStamp)\n            \/o->Sensor->Period;\n          }\n        o->LastTimeStamp=currentTime;\n        \n        double ScaleRotation=1024.0;\n        double ScaleTranslation=512.0;\n        double Sensitivity=1.0;\n        \n        t->Length \/= ScaleTranslation*Sensitivity;\n        r->Angle \/= ScaleRotation*Sensitivity;\n        \n#if 0\n        MathFrame FrameTransRot;\n        MathFrameTranslation(&FrameTransRot, pTranslation->X, pTranslation->Y, pTranslation->Z);\n        \n        \n        MathFrameRotation( &FrameTransRot, \n                           pRotation->X * pRotation->Angle, \n                           pRotation->Y * pRotation->Angle,\n                           pRotation->Z * pRotation->Angle );\n        \n        MathFrameMultiplication( &FrameTransRot, &FrameCube, &FrameCube );\n        if ( FrameCube.MathTranslation[2] > NearPosition )\n          {\n          FrameCube.MathTranslation[2] = NearPosition;\n          }\n        \n        if (MainhWnd)\n          {\n          DisplayCube( MainhWnd, &FrameCube, &VGAVideo );\n          }\n#endif\n        vtkTDxMotionEventInfo motionInfo;\n        motionInfo.X=t->X;\n        motionInfo.Y=t->Y;\n        motionInfo.Z=t->Z;\n        motionInfo.A=r->Angle*r->X; \/\/ yes, this is wrong, TODO\n        motionInfo.B=100.0*r->Angle*r->Y;\n        motionInfo.C=r->Angle*r->Z;\n        o->Interactor->InvokeEvent(vtkCommand::TDxMotionEvent,\n                                   &motionInfo);\n        }\n      else\n        {\n        o->LastTimeStamp=0;\n        }\n      r.Release();\n      t.Release();\n      }\n    catch (...)\n      {\n      \/\/ Some sort of exception handling\n      }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include <jni.h>\n\n\nextern \"C\" {\n  void init(JNIEnv *env, jobject ad_engine_java, jobject local_store_java, jobject asset_manager,\n            int width, int height);\n  void update();\n  void touch(int touch_id, int action, double x, double y);\n}\n\n\n#include <android\/asset_manager.h>\n#include <android\/asset_manager_jni.h>\n#include <GLES\/gl.h>\n\n#include \"gameengine\/android\/modules\/ad_engine_android.h\"\n#include \"gameengine\/android\/modules\/analytics_engine_android.h\"\n#include \"gameengine\/android\/modules\/game_engine_factory_android.h\"\n#include \"gameengine\/android\/modules\/local_store_android.h\"\n#include \"gameengine\/game_engine.h\"\n#include \"gameengine\/game_engine.h\"\n#include \"soundengine\/sound_player.h\"\n\n\nstatic sp<GameEngine> game_engine_;\n\nvoid init(JNIEnv *env, jobject ad_engine_java, jobject local_store_java, jobject asset_manager,\n          int width, int height) {\n  glBlendFunc(GL_ONE, GL_ONE_MINUS_SRC_ALPHA);\n  glDepthMask(false);\n  glEnable(GL_CULL_FACE);\n  glEnable(GL_BLEND);\n  glEnable(GL_TEXTURE_2D);\n  glTexEnvi(GL_TEXTURE_ENV, GL_TEXTURE_ENV_MODE, GL_REPLACE);\n  glEnableClientState(GL_VERTEX_ARRAY);\n  glEnableClientState(GL_TEXTURE_COORD_ARRAY);\n\n  \/\/ TODO This shouldn't be hardcoded. Rethink this anyways.\n\n  game_engine_.reset(new GameEngine());\n\n  Texture2D::SetScreenHeight(height);\n  game_engine_->set_screen_size(screen_size_make(width, height));\n\n  game_engine_->set_platform_type(kPlatformTypePhone);\n  game_engine_->set_platform_resolution(kPlatformResolutionHigh);\n\n  sp<GameEngineFactory> factory = sp<GameEngineFactory>(new GameEngineFactoryAndroid());\n  game_engine_->set_factory(factory);\n\n  sp<LocalStore> local_store = sp<LocalStore>(new LocalStoreAndroid(env, local_store_java));\n  game_engine_->set_local_store(local_store);\n\n  sp<AdEngine> ad_engine = sp<AdEngine>(new AdEngineAndroid(env, ad_engine_java));\n  game_engine_->set_ad_engine(ad_engine);\n\n  sp<AnalyticsEngine> analytics_engine = sp<AnalyticsEngine>(new AnalyticsEngineAndroid(env));\n  game_engine_->set_analytics_engine(analytics_engine);\n\n  AAssetManager *mgr = AAssetManager_fromJava(env, asset_manager);\n  assert(NULL != mgr);\n  \/\/ TODO casting is bad\n  ((SoundPlayerImpl *)SoundPlayer::instance())->setAssetManager(mgr);\n\n  sharkengine_init(game_engine_);\n}\n\nvoid update() {\n  game_engine_->Update();\n\n    int backingWidth_ = 640;\n    int backingHeight_ = 1138;\n\n    glViewport(0, 0, backingWidth_, backingHeight_);\n\n    glMatrixMode(GL_PROJECTION);\n    glLoadIdentity();\n    glOrthof(0, backingWidth_, 0, backingHeight_, -1, 1);\n\n    glMatrixMode(GL_MODELVIEW);\n    glLoadIdentity();\n    glClearColor(0.0f, 0.0f, 0.0f, 1.0f);\n    glClear(GL_COLOR_BUFFER_BIT);\n\n  game_engine_->Render();\n}\n\n#include \"gameengine\/touch.h\"\n#include <vector>\nusing std::vector;\n\nvoid touch(int touch_id, int action, double x, double y) {\n  Touch touch;\n  touch.set_location(game_engine_->screen_point_to_game_point(screen_point_make(x, y)));\n  touch.set_identifier((void *)(touch_id + 100));  \/\/ We don't want NULL identifiers, so add 100.\n  if (action == 0) {\n    game_engine_->AddTouchBegan(touch);\n  } else if (action == 1) {\n    game_engine_->AddTouchEnded(touch);\n  } else if (action == 2) {\n    game_engine_->AddTouchMoved(touch);\n  }\n}\n<commit_msg>[Android] Support for low-res texures.<commit_after>\n#include <jni.h>\n\n\nextern \"C\" {\n  void init(JNIEnv *env, jobject ad_engine_java, jobject local_store_java, jobject asset_manager,\n            int width, int height);\n  void update();\n  void touch(int touch_id, int action, double x, double y);\n}\n\n\n#include <android\/asset_manager.h>\n#include <android\/asset_manager_jni.h>\n#include <GLES\/gl.h>\n\n#include \"gameengine\/android\/modules\/ad_engine_android.h\"\n#include \"gameengine\/android\/modules\/analytics_engine_android.h\"\n#include \"gameengine\/android\/modules\/game_engine_factory_android.h\"\n#include \"gameengine\/android\/modules\/local_store_android.h\"\n#include \"gameengine\/game_engine.h\"\n#include \"gameengine\/game_engine.h\"\n#include \"soundengine\/sound_player.h\"\n\n\nstatic sp<GameEngine> game_engine_;\n\nint backing_width__;\nint backing_height__;\n\nvoid init(JNIEnv *env, jobject ad_engine_java, jobject local_store_java, jobject asset_manager,\n          int width, int height) {\n  glBlendFunc(GL_ONE, GL_ONE_MINUS_SRC_ALPHA);\n  glDepthMask(false);\n  glEnable(GL_CULL_FACE);\n  glEnable(GL_BLEND);\n  glEnable(GL_TEXTURE_2D);\n  glTexEnvi(GL_TEXTURE_ENV, GL_TEXTURE_ENV_MODE, GL_REPLACE);\n  glEnableClientState(GL_VERTEX_ARRAY);\n  glEnableClientState(GL_TEXTURE_COORD_ARRAY);\n\n  backing_width__ = width;\n  backing_height__ = height;\n\n  game_engine_.reset(new GameEngine());\n\n  Texture2D::SetScreenHeight(height);\n  game_engine_->set_screen_size(screen_size_make(width, height));\n\n  game_engine_->set_platform_type(kPlatformTypePhone);\n  game_engine_->set_platform_resolution(\n      width >= 640 ? kPlatformResolutionHigh : kPlatformResolutionLow);\n\n  sp<GameEngineFactory> factory = sp<GameEngineFactory>(new GameEngineFactoryAndroid());\n  game_engine_->set_factory(factory);\n\n  sp<LocalStore> local_store = sp<LocalStore>(new LocalStoreAndroid(env, local_store_java));\n  game_engine_->set_local_store(local_store);\n\n  sp<AdEngine> ad_engine = sp<AdEngine>(new AdEngineAndroid(env, ad_engine_java));\n  game_engine_->set_ad_engine(ad_engine);\n\n  sp<AnalyticsEngine> analytics_engine = sp<AnalyticsEngine>(new AnalyticsEngineAndroid(env));\n  game_engine_->set_analytics_engine(analytics_engine);\n\n  AAssetManager *mgr = AAssetManager_fromJava(env, asset_manager);\n  assert(NULL != mgr);\n  \/\/ TODO casting is bad\n  ((SoundPlayerImpl *)SoundPlayer::instance())->setAssetManager(mgr);\n\n  sharkengine_init(game_engine_);\n}\n\nvoid update() {\n  game_engine_->Update();\n\n  glViewport(0, 0, backing_width__, backing_height__);\n\n  glMatrixMode(GL_PROJECTION);\n  glLoadIdentity();\n  glOrthof(0, backing_width__, 0, backing_height__, -1, 1);\n\n  glMatrixMode(GL_MODELVIEW);\n  glLoadIdentity();\n  glClearColor(0.0f, 0.0f, 0.0f, 1.0f);\n  glClear(GL_COLOR_BUFFER_BIT);\n\n  game_engine_->Render();\n}\n\n#include \"gameengine\/touch.h\"\n#include <vector>\nusing std::vector;\n\nvoid touch(int touch_id, int action, double x, double y) {\n  Touch touch;\n  touch.set_location(game_engine_->screen_point_to_game_point(screen_point_make(x, y)));\n  touch.set_identifier((void *)(touch_id + 100));  \/\/ We don't want NULL identifiers, so add 100.\n  if (action == 0) {\n    game_engine_->AddTouchBegan(touch);\n  } else if (action == 1) {\n    game_engine_->AddTouchEnded(touch);\n  } else if (action == 2) {\n    game_engine_->AddTouchMoved(touch);\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* BEGIN_COMMON_COPYRIGHT_HEADER\n * (c)LGPL2+\n *\n * LXDE-Qt - a lightweight, Qt based, desktop toolset\n * http:\/\/razor-qt.org\n *\n * Copyright: 2010-2012 Razor team\n * Authors:\n *   Petr Vanek <petr@scribus.info>\n *   Kuzma Shapran <kuzma.shapran@gmail.com>\n *\n * This program or library is free software; you can redistribute it\n * and\/or modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n * Lesser General Public License for more details.\n\n * You should have received a copy of the GNU Lesser General\n * Public License along with this library; if not, write to the\n * Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,\n * Boston, MA 02110-1301 USA\n *\n * END_COMMON_COPYRIGHT_HEADER *\/\n\n#include \"lxqtquicklaunch.h\"\n#include \"quicklaunchbutton.h\"\n#include <LXQt\/GridLayout>\n#include \"quicklaunchaction.h\"\n#include \"..\/panel\/ilxqtpanelplugin.h\"\n\n#include <XdgDesktopFile>\n#include <XdgIcon>\n#include <XdgMime>\n\n#include <QtDebug>\n#include <QSettings>\n#include <QUrl>\n#include <QFileInfo>\n#include <QDragEnterEvent>\n#include <QToolButton>\n#include <QMessageBox>\n#include <QDesktopServices>\n#include <QFileIconProvider>\n#include <QSettings>\n#include <QLabel>\n\nLxQtQuickLaunch::LxQtQuickLaunch(ILxQtPanelPlugin *plugin, QWidget* parent) :\n    QFrame(parent),\n    mPlugin(plugin),\n    mPlaceHolder(0)\n{\n    setAcceptDrops(true);\n\n    mLayout = new LxQt::GridLayout(this);\n    setLayout(mLayout);\n\n    QSettings *settings = mPlugin->settings();\n    int count = settings->beginReadArray(\"apps\");\n\n    QString desktop;\n    QString file;\n    QString execname;\n    QString exec;\n    QString icon;\n    for (int i = 0; i < count; ++i)\n    {\n        settings->setArrayIndex(i);\n        desktop = settings->value(\"desktop\", \"\").toString();\n        file = settings->value(\"file\", \"\").toString();\n        if (! desktop.isEmpty())\n        {\n            XdgDesktopFile * xdg = XdgDesktopFileCache::getFile(desktop);\n            if (!xdg->isValid())\n            {\n                qDebug() << \"XdgDesktopFile\" << desktop << \"is not valid\";\n                continue;\n            }\n            if (!xdg->isSuitable())\n            {\n                qDebug() << \"XdgDesktopFile\" << desktop << \"is not applicable\";\n                continue;\n            }\n\n            addButton(new QuickLaunchAction(xdg, this));\n        }\n        else if (! file.isEmpty())\n        {\n            addButton(new QuickLaunchAction(file, this));\n        }\n        else\n        {\n            execname = settings->value(\"name\", \"\").toString();\n            exec = settings->value(\"exec\", \"\").toString();\n            icon = settings->value(\"icon\", \"\").toString();\n            if (icon.isNull())\n            {\n                qDebug() << \"Icon\" << icon << \"is not valid (isNull). Skipped.\";\n                continue;\n            }\n            addButton(new QuickLaunchAction(execname, exec, icon, this));\n        }\n    } \/\/ for\n\n    settings->endArray();\n\n    if (mLayout->isEmpty())\n        showPlaceHolder();\n\n    realign();\n}\n\nLxQtQuickLaunch::~LxQtQuickLaunch()\n{\n}\n\nint LxQtQuickLaunch::indexOfButton(QuickLaunchButton* button) const\n{\n    return mLayout->indexOf(button);\n}\n\nint LxQtQuickLaunch::countOfButtons() const\n{\n    return mLayout->count();\n}\n\nvoid LxQtQuickLaunch::realign()\n{\n    mLayout->setEnabled(false);\n    ILxQtPanel *panel = mPlugin->panel();\n\n    if (mPlaceHolder)\n    {\n        mLayout->setColumnCount(1);\n        mLayout->setRowCount(1);\n    }\n    else\n    {\n        if (panel->isHorizontal())\n        {\n            mLayout->setRowCount(panel->lineCount());\n            mLayout->setColumnCount(0);\n        }\n        else\n        {\n            mLayout->setColumnCount(panel->lineCount());\n            mLayout->setRowCount(0);\n        }\n    }\n    mLayout->setEnabled(true);\n}\n\nvoid LxQtQuickLaunch::addButton(QuickLaunchAction* action)\n{\n    mLayout->setEnabled(false);\n    QuickLaunchButton* btn = new QuickLaunchButton(action, this);\n    mLayout->addWidget(btn);\n\n    connect(btn, SIGNAL(switchButtons(QuickLaunchButton*,QuickLaunchButton*)), this, SLOT(switchButtons(QuickLaunchButton*,QuickLaunchButton*)));\n    connect(btn, SIGNAL(buttonDeleted()), this, SLOT(buttonDeleted()));\n    connect(btn, SIGNAL(movedLeft()), this, SLOT(buttonMoveLeft()));\n    connect(btn, SIGNAL(movedRight()), this, SLOT(buttonMoveRight()));\n\n    mLayout->removeWidget(mPlaceHolder);\n    delete mPlaceHolder;\n    mPlaceHolder = 0;\n    mLayout->setEnabled(true);\n    realign();\n}\n\nvoid LxQtQuickLaunch::dragEnterEvent(QDragEnterEvent *e)\n{\n    \/\/ Getting URL from mainmenu...\n    if (e->mimeData()->hasUrls())\n    {\n        e->acceptProposedAction();\n        return;\n    }\n\n    if (e->source() && e->source()->parent() == this)\n    {\n        e->acceptProposedAction();\n    }\n}\n\nvoid LxQtQuickLaunch::dropEvent(QDropEvent *e)\n{\n    const QMimeData *mime = e->mimeData();\n    \/\/ duplicates storage: [quicklaunch] issue dragging from qtfm, #252\n    QList<QUrl> duplicates;\n    \/\/ urls from mainmenu\n    foreach (QUrl url, mime->urls())\n    {\n    if (duplicates.contains(url))\n            continue;\n    else\n        duplicates << url;\n\n        QString fileName(url.toLocalFile());\n        XdgDesktopFile * xdg = XdgDesktopFileCache::getFile(fileName);\n        QFileInfo fi(fileName);\n\n        if (xdg->isValid())\n        {\n            if (xdg->isSuitable())\n                addButton(new QuickLaunchAction(xdg, this));\n        }\n        else if (fi.exists() && fi.isExecutable() && !fi.isDir())\n        {\n            addButton(new QuickLaunchAction(fileName, fileName, \"\", this));\n        }\n        else if (fi.exists())\n        {\n            addButton(new QuickLaunchAction(fileName, this));\n        }\n        else\n        {\n            qWarning() << \"XdgDesktopFile\" << fileName << \"is not valid\";\n            QMessageBox::information(this, tr(\"Drop Error\"),\n                              tr(\"File\/URL '%1' cannot be embedded into QuickLaunch for now\").arg(fileName)\n                            );\n        }\n    }\n    saveSettings();\n}\n\nvoid LxQtQuickLaunch::switchButtons(QuickLaunchButton *button1, QuickLaunchButton *button2)\n{\n    if (button1 == button2)\n        return;\n\n    int n1 = mLayout->indexOf(button1);\n    int n2 = mLayout->indexOf(button2);\n\n    int l = qMin(n1, n2);\n    int m = qMax(n1, n2);\n\n    mLayout->moveItem(l, m);\n    mLayout->moveItem(m-1, l);\n    saveSettings();\n}\n\nvoid LxQtQuickLaunch::buttonDeleted()\n{\n    QuickLaunchButton *btn = qobject_cast<QuickLaunchButton*>(sender());\n    if (!btn)\n        return;\n\n    mLayout->removeWidget(btn);\n    btn->deleteLater();\n    saveSettings();\n\n    if (mLayout->isEmpty())\n        showPlaceHolder();\n\n    realign();\n}\n\nvoid LxQtQuickLaunch::buttonMoveLeft()\n{\n    QuickLaunchButton *btn = qobject_cast<QuickLaunchButton*>(sender());\n    if (!btn)\n        return;\n\n    int index = indexOfButton(btn);\n    if (index > 0)\n    {\n        mLayout->moveItem(index, index - 1);\n        saveSettings();\n    }\n}\n\n\nvoid LxQtQuickLaunch::buttonMoveRight()\n{\n    QuickLaunchButton *btn1 = qobject_cast<QuickLaunchButton*>(sender());\n    if (!btn1)\n        return;\n\n    int index = indexOfButton(btn1);\n    if (index < countOfButtons() - 1)\n    {\n        mLayout->moveItem(index, index + 1);\n        saveSettings();\n    }\n}\n\n\nvoid LxQtQuickLaunch::saveSettings()\n{\n    QSettings *settings = mPlugin->settings();\n    settings->remove(\"apps\");\n    settings->beginWriteArray(\"apps\");\n    int i = 0;\n\n    for(int j=0; j<mLayout->count(); ++j)\n    {\n        QuickLaunchButton *b = qobject_cast<QuickLaunchButton*>(mLayout->itemAt(j)->widget());\n        if(!b)\n            continue;\n\n        settings->setArrayIndex(i);\n\n        QHashIterator<QString,QString> it(b->settingsMap());\n        while (it.hasNext())\n        {\n            it.next();\n            settings->setValue(it.key(), it.value());\n        }\n\n        ++i;\n    }\n\n    settings->endArray();\n}\n\nvoid LxQtQuickLaunch::showPlaceHolder()\n{\n    if (!mPlaceHolder)\n    {\n        mPlaceHolder = new QLabel(this);\n        mPlaceHolder->setAlignment(Qt::AlignCenter);\n        mPlaceHolder->setObjectName(\"QuickLaunchPlaceHolder\");\n        mPlaceHolder->setText(tr(\"Drop application\\nicons here\"));\n    }\n\n    mLayout->addWidget(mPlaceHolder);\n}\n<commit_msg>Fix dropping an action from menu<commit_after>\/* BEGIN_COMMON_COPYRIGHT_HEADER\n * (c)LGPL2+\n *\n * LXDE-Qt - a lightweight, Qt based, desktop toolset\n * http:\/\/razor-qt.org\n *\n * Copyright: 2010-2012 Razor team\n * Authors:\n *   Petr Vanek <petr@scribus.info>\n *   Kuzma Shapran <kuzma.shapran@gmail.com>\n *\n * This program or library is free software; you can redistribute it\n * and\/or modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n * Lesser General Public License for more details.\n\n * You should have received a copy of the GNU Lesser General\n * Public License along with this library; if not, write to the\n * Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,\n * Boston, MA 02110-1301 USA\n *\n * END_COMMON_COPYRIGHT_HEADER *\/\n\n#include \"lxqtquicklaunch.h\"\n#include \"quicklaunchbutton.h\"\n#include <LXQt\/GridLayout>\n#include \"quicklaunchaction.h\"\n#include \"..\/panel\/ilxqtpanelplugin.h\"\n\n#include <XdgDesktopFile>\n#include <XdgIcon>\n#include <XdgMime>\n\n#include <QtDebug>\n#include <QSettings>\n#include <QUrl>\n#include <QFileInfo>\n#include <QDragEnterEvent>\n#include <QToolButton>\n#include <QMessageBox>\n#include <QDesktopServices>\n#include <QFileIconProvider>\n#include <QSettings>\n#include <QLabel>\n\nLxQtQuickLaunch::LxQtQuickLaunch(ILxQtPanelPlugin *plugin, QWidget* parent) :\n    QFrame(parent),\n    mPlugin(plugin),\n    mPlaceHolder(0)\n{\n    setAcceptDrops(true);\n\n    mLayout = new LxQt::GridLayout(this);\n    setLayout(mLayout);\n\n    QSettings *settings = mPlugin->settings();\n    int count = settings->beginReadArray(\"apps\");\n\n    QString desktop;\n    QString file;\n    QString execname;\n    QString exec;\n    QString icon;\n    for (int i = 0; i < count; ++i)\n    {\n        settings->setArrayIndex(i);\n        desktop = settings->value(\"desktop\", \"\").toString();\n        file = settings->value(\"file\", \"\").toString();\n        if (! desktop.isEmpty())\n        {\n            XdgDesktopFile * xdg = XdgDesktopFileCache::getFile(desktop);\n            if (!xdg->isValid())\n            {\n                qDebug() << \"XdgDesktopFile\" << desktop << \"is not valid\";\n                continue;\n            }\n            if (!xdg->isSuitable())\n            {\n                qDebug() << \"XdgDesktopFile\" << desktop << \"is not applicable\";\n                continue;\n            }\n\n            addButton(new QuickLaunchAction(xdg, this));\n        }\n        else if (! file.isEmpty())\n        {\n            addButton(new QuickLaunchAction(file, this));\n        }\n        else\n        {\n            execname = settings->value(\"name\", \"\").toString();\n            exec = settings->value(\"exec\", \"\").toString();\n            icon = settings->value(\"icon\", \"\").toString();\n            if (icon.isNull())\n            {\n                qDebug() << \"Icon\" << icon << \"is not valid (isNull). Skipped.\";\n                continue;\n            }\n            addButton(new QuickLaunchAction(execname, exec, icon, this));\n        }\n    } \/\/ for\n\n    settings->endArray();\n\n    if (mLayout->isEmpty())\n        showPlaceHolder();\n\n    realign();\n}\n\nLxQtQuickLaunch::~LxQtQuickLaunch()\n{\n}\n\nint LxQtQuickLaunch::indexOfButton(QuickLaunchButton* button) const\n{\n    return mLayout->indexOf(button);\n}\n\nint LxQtQuickLaunch::countOfButtons() const\n{\n    return mLayout->count();\n}\n\nvoid LxQtQuickLaunch::realign()\n{\n    mLayout->setEnabled(false);\n    ILxQtPanel *panel = mPlugin->panel();\n\n    if (mPlaceHolder)\n    {\n        mLayout->setColumnCount(1);\n        mLayout->setRowCount(1);\n    }\n    else\n    {\n        if (panel->isHorizontal())\n        {\n            mLayout->setRowCount(panel->lineCount());\n            mLayout->setColumnCount(0);\n        }\n        else\n        {\n            mLayout->setColumnCount(panel->lineCount());\n            mLayout->setRowCount(0);\n        }\n    }\n    mLayout->setEnabled(true);\n}\n\nvoid LxQtQuickLaunch::addButton(QuickLaunchAction* action)\n{\n    mLayout->setEnabled(false);\n    QuickLaunchButton* btn = new QuickLaunchButton(action, this);\n    mLayout->addWidget(btn);\n\n    connect(btn, SIGNAL(switchButtons(QuickLaunchButton*,QuickLaunchButton*)), this, SLOT(switchButtons(QuickLaunchButton*,QuickLaunchButton*)));\n    connect(btn, SIGNAL(buttonDeleted()), this, SLOT(buttonDeleted()));\n    connect(btn, SIGNAL(movedLeft()), this, SLOT(buttonMoveLeft()));\n    connect(btn, SIGNAL(movedRight()), this, SLOT(buttonMoveRight()));\n\n    mLayout->removeWidget(mPlaceHolder);\n    delete mPlaceHolder;\n    mPlaceHolder = 0;\n    mLayout->setEnabled(true);\n    realign();\n}\n\nvoid LxQtQuickLaunch::dragEnterEvent(QDragEnterEvent *e)\n{\n    \/\/ Getting URL from mainmenu...\n    if (e->mimeData()->hasUrls())\n    {\n        e->acceptProposedAction();\n        return;\n    }\n\n    if (e->source() && e->source()->parent() == this)\n    {\n        e->acceptProposedAction();\n    }\n}\n\nvoid LxQtQuickLaunch::dropEvent(QDropEvent *e)\n{\n    const QMimeData *mime = e->mimeData();\n    \/\/ duplicates storage: [quicklaunch] issue dragging from qtfm, #252\n    QList<QUrl> duplicates;\n    \/\/ urls from mainmenu\n    foreach (QUrl url, mime->urls())\n    {\n        if (duplicates.contains(url))\n                continue;\n        else\n            duplicates << url;\n\n        #if QT_VERSION >= QT_VERSION_CHECK(5, 0, 0)\n        QString fileName(url.url());\n        #else\n        QString fileName(url.toLocalFile());\n        #endif\n\n        XdgDesktopFile * xdg = XdgDesktopFileCache::getFile(fileName);\n        QFileInfo fi(fileName);\n\n        if (xdg->isValid())\n        {\n            if (xdg->isSuitable())\n                addButton(new QuickLaunchAction(xdg, this));\n        }\n        else if (fi.exists() && fi.isExecutable() && !fi.isDir())\n        {\n            addButton(new QuickLaunchAction(fileName, fileName, \"\", this));\n        }\n        else if (fi.exists())\n        {\n            addButton(new QuickLaunchAction(fileName, this));\n        }\n        else\n        {\n            qWarning() << \"XdgDesktopFile\" << fileName << \"is not valid\";\n            QMessageBox::information(this, tr(\"Drop Error\"),\n                              tr(\"File\/URL '%1' cannot be embedded into QuickLaunch for now\").arg(fileName)\n                            );\n        }\n    }\n    saveSettings();\n}\n\nvoid LxQtQuickLaunch::switchButtons(QuickLaunchButton *button1, QuickLaunchButton *button2)\n{\n    if (button1 == button2)\n        return;\n\n    int n1 = mLayout->indexOf(button1);\n    int n2 = mLayout->indexOf(button2);\n\n    int l = qMin(n1, n2);\n    int m = qMax(n1, n2);\n\n    mLayout->moveItem(l, m);\n    mLayout->moveItem(m-1, l);\n    saveSettings();\n}\n\nvoid LxQtQuickLaunch::buttonDeleted()\n{\n    QuickLaunchButton *btn = qobject_cast<QuickLaunchButton*>(sender());\n    if (!btn)\n        return;\n\n    mLayout->removeWidget(btn);\n    btn->deleteLater();\n    saveSettings();\n\n    if (mLayout->isEmpty())\n        showPlaceHolder();\n\n    realign();\n}\n\nvoid LxQtQuickLaunch::buttonMoveLeft()\n{\n    QuickLaunchButton *btn = qobject_cast<QuickLaunchButton*>(sender());\n    if (!btn)\n        return;\n\n    int index = indexOfButton(btn);\n    if (index > 0)\n    {\n        mLayout->moveItem(index, index - 1);\n        saveSettings();\n    }\n}\n\n\nvoid LxQtQuickLaunch::buttonMoveRight()\n{\n    QuickLaunchButton *btn1 = qobject_cast<QuickLaunchButton*>(sender());\n    if (!btn1)\n        return;\n\n    int index = indexOfButton(btn1);\n    if (index < countOfButtons() - 1)\n    {\n        mLayout->moveItem(index, index + 1);\n        saveSettings();\n    }\n}\n\n\nvoid LxQtQuickLaunch::saveSettings()\n{\n    QSettings *settings = mPlugin->settings();\n    settings->remove(\"apps\");\n    settings->beginWriteArray(\"apps\");\n    int i = 0;\n\n    for(int j=0; j<mLayout->count(); ++j)\n    {\n        QuickLaunchButton *b = qobject_cast<QuickLaunchButton*>(mLayout->itemAt(j)->widget());\n        if(!b)\n            continue;\n\n        settings->setArrayIndex(i);\n\n        QHashIterator<QString,QString> it(b->settingsMap());\n        while (it.hasNext())\n        {\n            it.next();\n            settings->setValue(it.key(), it.value());\n        }\n\n        ++i;\n    }\n\n    settings->endArray();\n}\n\nvoid LxQtQuickLaunch::showPlaceHolder()\n{\n    if (!mPlaceHolder)\n    {\n        mPlaceHolder = new QLabel(this);\n        mPlaceHolder->setAlignment(Qt::AlignCenter);\n        mPlaceHolder->setObjectName(\"QuickLaunchPlaceHolder\");\n        mPlaceHolder->setText(tr(\"Drop application\\nicons here\"));\n    }\n\n    mLayout->addWidget(mPlaceHolder);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <math.h>\n#include <GL\/glew.h>\n#include <GLFW\/glfw3.h>\n#include \"openglapp.h\"\n#include \"util.h\"\n\nclass PixelApp : public OpenGLApp {\nprivate:\n\n    void setup() {\n        GLuint vertex_shader = create_shader(\"vertex.shd\", GL_VERTEX_SHADER);\n        GLuint fragment_shader = create_shader(\"fragment.shd\", GL_FRAGMENT_SHADER);\n\n        program = glCreateProgram();\n        glAttachShader(program, vertex_shader);\n        glAttachShader(program, fragment_shader);\n        glLinkProgram(program);\n\n        glDeleteShader(vertex_shader);\n        glDeleteShader(fragment_shader);\n\n        \n\n        glGenVertexArrays(1, &vertex_array_object);\n        glBindVertexArray(vertex_array_object);\n\n        generate_data_to_buffer();\n\n        \n        \n    }\n\n    void generate_data_to_buffer() {\n        static const GLfloat data[] = {\n             0.25, -0.25, 0.5, 1.0,\n            -0.25, -0.25, 0.5, 1.0,\n             0.25,  0.25, 0.5, 1.0,\n        };\n\n        static const GLfloat colors[] = {\n            0.5, 0.1, 0.5, 1.0, \n            0.7, 0.2, 0.0, 1.0,\n            0.1, 1.0, 0.9, 1.0\n        };\n\n        GLuint buffers[2];\n        \/\/ Generate name for two buffers\n        glGenBuffers(2, buffers);\n        \/\/ Bind it to the context using GL_ARRAY_BUFFER binding point\n        glBindBuffer(GL_ARRAY_BUFFER, buffers[0]);\n        glBufferData(GL_ARRAY_BUFFER, sizeof(data), data, GL_STATIC_DRAW);\n\n        \/\/ Tell the opengl where the data is and turn automatic vertex fetching on for\n        \/\/ specified attribute\n        glVertexAttribPointer(0,        \/\/ Attribute 0\n                              4,        \/\/ 4 components,\n                              GL_FLOAT, \/\/ Float data\n                              GL_FALSE, \/\/ Not normalized\n                              0,        \/\/ Tightly packed\n                              NULL);    \/\/ offset 0\n        glEnableVertexAttribArray(0);\n\n        glBindBuffer(GL_ARRAY_BUFFER, buffers[1]);\n        glBufferData(GL_ARRAY_BUFFER, sizeof(colors), data, GL_STATIC_DRAW);\n        \n        glVertexAttribPointer(glGetAttribLocation(program, \"color\"),        \/\/ Attribute from opengl\n                              4,        \/\/ 4 components,\n                              GL_FLOAT, \/\/ Float data\n                              GL_FALSE, \/\/ Not normalized\n                              0,        \/\/ Tightly packed\n                              NULL);    \/\/ offset 0\n        glEnableVertexAttribArray(1);\n    }\n\n    void render(double current_time) {\n        GLfloat color[] = {\n            (float)sin(current_time) * 0.5f + 0.5f,\n            (float)cos(current_time) * 0.5f + 0.5f,\n            0.0f, \n            1.0f\n        };\n        glClearBufferfv(GL_COLOR, 0, color);\n\n        glUseProgram(program);\n        glDrawArrays(GL_TRIANGLES, 0, 3);\n    }\n\n    void cleanup() {\n        glDeleteVertexArrays(1, &vertex_array_object);\n        glDeleteProgram(program);\n    }\n\nprivate:\n    GLuint program;\n    GLuint vertex_array_object;\n};\n\n\nint main(void)\n{\n    PixelApp app;\n    app.run();\n   \n    return 0;\n}<commit_msg>use colors buffer<commit_after>#include <iostream>\n#include <math.h>\n#include <GL\/glew.h>\n#include <GLFW\/glfw3.h>\n#include \"openglapp.h\"\n#include \"util.h\"\n\nclass PixelApp : public OpenGLApp {\nprivate:\n\n    void setup() {\n        GLuint vertex_shader = create_shader(\"vertex.shd\", GL_VERTEX_SHADER);\n        GLuint fragment_shader = create_shader(\"fragment.shd\", GL_FRAGMENT_SHADER);\n\n        program = glCreateProgram();\n        glAttachShader(program, vertex_shader);\n        glAttachShader(program, fragment_shader);\n        glLinkProgram(program);\n\n        glDeleteShader(vertex_shader);\n        glDeleteShader(fragment_shader);\n\n        \n\n        glGenVertexArrays(1, &vertex_array_object);\n        glBindVertexArray(vertex_array_object);\n\n        generate_data_to_buffer();\n\n        \n        \n    }\n\n    void generate_data_to_buffer() {\n        static const GLfloat data[] = {\n             0.25, -0.25, 0.5, 1.0,\n            -0.25, -0.25, 0.5, 1.0,\n             0.25,  0.25, 0.5, 1.0,\n        };\n\n        static const GLfloat colors[] = {\n            0.5, 0.1, 0.5, 1.0, \n            0.7, 0.2, 0.0, 1.0,\n            0.1, 1.0, 0.9, 1.0\n        };\n\n        GLuint buffers[2];\n        \/\/ Generate name for two buffers\n        glGenBuffers(2, buffers);\n        \/\/ Bind it to the context using GL_ARRAY_BUFFER binding point\n        glBindBuffer(GL_ARRAY_BUFFER, buffers[0]);\n        glBufferData(GL_ARRAY_BUFFER, sizeof(data), data, GL_STATIC_DRAW);\n\n        \/\/ Tell the opengl where the data is and turn automatic vertex fetching on for\n        \/\/ specified attribute\n        glVertexAttribPointer(0,        \/\/ Attribute 0\n                              4,        \/\/ 4 components,\n                              GL_FLOAT, \/\/ Float data\n                              GL_FALSE, \/\/ Not normalized\n                              0,        \/\/ Tightly packed\n                              NULL);    \/\/ offset 0\n        glEnableVertexAttribArray(0);\n\n        glBindBuffer(GL_ARRAY_BUFFER, buffers[1]);\n        glBufferData(GL_ARRAY_BUFFER, sizeof(colors), colors, GL_STATIC_DRAW);\n        \n        glVertexAttribPointer(glGetAttribLocation(program, \"color\"),        \/\/ Attribute from opengl\n                              4,        \/\/ 4 components,\n                              GL_FLOAT, \/\/ Float data\n                              GL_FALSE, \/\/ Not normalized\n                              0,        \/\/ Tightly packed\n                              NULL);    \/\/ offset 0\n        glEnableVertexAttribArray(1);\n    }\n\n    void render(double current_time) {\n        GLfloat color[] = {\n            (float)sin(current_time) * 0.5f + 0.5f,\n            (float)cos(current_time) * 0.5f + 0.5f,\n            0.0f, \n            1.0f\n        };\n        glClearBufferfv(GL_COLOR, 0, color);\n\n        glUseProgram(program);\n        glDrawArrays(GL_TRIANGLES, 0, 3);\n    }\n\n    void cleanup() {\n        glDeleteVertexArrays(1, &vertex_array_object);\n        glDeleteProgram(program);\n    }\n\nprivate:\n    GLuint program;\n    GLuint vertex_array_object;\n};\n\n\nint main(void)\n{\n    PixelApp app;\n    app.run();\n   \n    return 0;\n}<|endoftext|>"}
{"text":"<commit_before>\/*********************************************************************\n* Software License Agreement (BSD License)\n*\n*  Copyright (c) 2008, Willow Garage, Inc.\n*  All rights reserved.\n*\n*  Redistribution and use in source and binary forms, with or without\n*  modification, are permitted provided that the following conditions\n*  are met:\n*\n*   * Redistributions of source code must retain the above copyright\n*     notice, this list of conditions and the following disclaimer.\n*   * Redistributions in binary form must reproduce the above\n*     copyright notice, this list of conditions and the following\n*     disclaimer in the documentation and\/or other materials provided\n*     with the distribution.\n*   * Neither the name of the Willow Garage nor the names of its\n*     contributors may be used to endorse or promote products derived\n*     from this software without specific prior written permission.\n*\n*  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n*  \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n*  LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n*  FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n*  COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n*  INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n*  BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n*  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n*  CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n*  LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n*  ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n*  POSSIBILITY OF SUCH DAMAGE.\n*********************************************************************\/\n\n\/* Author: Ioan Sucan *\/\n\n#include \"ompl\/util\/RandomNumbers.h\"\n#include \"ompl\/util\/Exception.h\"\n#include \"ompl\/util\/Console.h\"\n#include <boost\/random\/lagged_fibonacci.hpp>\n#include <boost\/random\/uniform_int.hpp>\n#include <boost\/thread\/mutex.hpp>\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n#include <boost\/math\/constants\/constants.hpp>\n\n\/\/\/ The seed the user asked for (cannot be 0)\nstatic boost::uint32_t userSetSeed = 0;\n\n\/\/\/ Flag indicating whether the first seed has already been generated or not\nstatic bool            firstSeedGenerated = false;\n\n\/\/\/ The value of the first seed\nstatic boost::uint32_t firstSeedValue = 0;\n\n\/\/\/ Compute the first seed to be used; this function should be called only once\nstatic boost::uint32_t firstSeed(void)\n{\n    static boost::mutex fsLock;\n    boost::mutex::scoped_lock slock(fsLock);\n\n    if (firstSeedGenerated)\n        return firstSeedValue;\n\n    if (userSetSeed != 0)\n        firstSeedValue = userSetSeed;\n    else\n        firstSeedValue =\n            (boost::uint32_t)(boost::posix_time::microsec_clock::universal_time() -\n                              boost::posix_time::ptime(boost::date_time::min_date_time)).total_microseconds();\n    firstSeedGenerated = true;\n\n    return firstSeedValue;\n}\n\n\/\/\/ We use a different random number generator for the seeds of the\n\/\/\/ Other random generators. The root seed is from the number of\n\/\/\/ nano-seconds in the current time.\nstatic boost::uint32_t nextSeed(void)\n{\n    static boost::mutex rngMutex;\n    boost::mutex::scoped_lock slock(rngMutex);\n    static boost::lagged_fibonacci607 sGen(firstSeed());\n    static boost::uniform_int<>       sDist(1, 1000000000);\n    static boost::variate_generator<boost::lagged_fibonacci607&, boost::uniform_int<> > s(sGen, sDist);\n    return s();\n}\n\nboost::uint32_t ompl::RNG::getSeed(void)\n{\n    return firstSeed();\n}\n\nvoid ompl::RNG::setSeed(boost::uint32_t seed)\n{\n    if (firstSeedGenerated)\n    {\n        msg::Interface msg;\n        msg.error(\"Random number generation already started. Changing seed now will not lead to deterministic sampling.\");\n    }\n    if (seed == 0)\n    {\n        msg::Interface msg;\n        msg.warn(\"Random generator seed cannot be 0. Using 1 instead.\");\n        userSetSeed = 1;\n    }\n    else\n        userSetSeed = seed;\n}\n\nompl::RNG::RNG(void) : generator_(nextSeed()),\n                       uniDist_(0, 1),\n                       normalDist_(0, 1),\n                       uni_(generator_, uniDist_),\n                       normal_(generator_, normalDist_)\n{\n}\n\ndouble ompl::RNG::halfNormalReal(double r_min, double r_max, double focus)\n{\n    assert(r_min <= r_max);\n\n    const double mean = r_max - r_min;\n    double       v    = gaussian(mean, mean\/focus);\n\n    if (v > mean) v = 2.0 * mean - v;\n    double r = v >= 0.0 ? v + r_min : r_min;\n    return r > r_max ? r_max : r;\n}\n\nint ompl::RNG::halfNormalInt(int r_min, int r_max, double focus)\n{\n    int r = (int)floor(halfNormalReal((double)r_min, (double)(r_max) + 1.0, focus));\n    return (r > r_max) ? r_max : r;\n}\n\n\/\/ From: \"Uniform Random Rotations\", Ken Shoemake, Graphics Gems III,\n\/\/       pg. 124-132\nvoid ompl::RNG::quaternion(double value[4])\n{\n    double x0 = uni_();\n    double r1 = sqrt(1.0 - x0), r2 = sqrt(x0);\n    double t1 = 2.0 * boost::math::constants::pi<double>() * uni_(), t2 = 2.0 * boost::math::constants::pi<double>() * uni_();\n    double c1 = cos(t1), s1 = sin(t1);\n    double c2 = cos(t2), s2 = sin(t2);\n    value[0] = s1 * r1;\n    value[1] = c1 * r1;\n    value[2] = s2 * r2;\n    value[3] = c2 * r2;\n}\n\n\/\/ From Effective Sampling and Distance Metrics for 3D Rigid Body Path Planning, by James Kuffner, ICRA 2004\nvoid ompl::RNG::eulerRPY(double value[3])\n{\n    value[0] = boost::math::constants::pi<double>() * (2.0 * uni_() - 1.0);\n    value[1] = acos(1.0 - 2.0 * uni_()) - boost::math::constants::pi<double>() \/ 2.0;\n    value[2] = boost::math::constants::pi<double>() * (2.0 * uni_() - 1.0);\n}\n<commit_msg>more static init fixes<commit_after>\/*********************************************************************\n* Software License Agreement (BSD License)\n*\n*  Copyright (c) 2008, Willow Garage, Inc.\n*  All rights reserved.\n*\n*  Redistribution and use in source and binary forms, with or without\n*  modification, are permitted provided that the following conditions\n*  are met:\n*\n*   * Redistributions of source code must retain the above copyright\n*     notice, this list of conditions and the following disclaimer.\n*   * Redistributions in binary form must reproduce the above\n*     copyright notice, this list of conditions and the following\n*     disclaimer in the documentation and\/or other materials provided\n*     with the distribution.\n*   * Neither the name of the Willow Garage nor the names of its\n*     contributors may be used to endorse or promote products derived\n*     from this software without specific prior written permission.\n*\n*  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n*  \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n*  LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n*  FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n*  COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n*  INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n*  BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n*  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n*  CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n*  LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n*  ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n*  POSSIBILITY OF SUCH DAMAGE.\n*********************************************************************\/\n\n\/* Author: Ioan Sucan *\/\n\n#include \"ompl\/util\/RandomNumbers.h\"\n#include \"ompl\/util\/Exception.h\"\n#include \"ompl\/util\/Console.h\"\n#include <boost\/random\/lagged_fibonacci.hpp>\n#include <boost\/random\/uniform_int.hpp>\n#include <boost\/thread\/mutex.hpp>\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n#include <boost\/math\/constants\/constants.hpp>\n\n\/\/\/ The seed the user asked for (cannot be 0)\nstatic boost::uint32_t& getUserSetSeed(void)\n{\n    static boost::uint32_t userSetSeed = 0;\n    return userSetSeed;\n}\n\n\/\/\/ Flag indicating whether the first seed has already been generated or not\nstatic bool& getFirstSeedGenerated(void)\n{\n    static bool firstSeedGenerated = false;\n    return firstSeedGenerated;\n}\n\n\/\/\/ Compute the first seed to be used; this function should be called only once\nstatic boost::uint32_t firstSeed(void)\n{\n    \/\/\/ The value of the first seed\n    static boost::uint32_t firstSeedValue = 0;\n\n    static boost::mutex fsLock;\n    boost::mutex::scoped_lock slock(fsLock);\n\n    if (getFirstSeedGenerated())\n        return firstSeedValue;\n\n    if (getUserSetSeed() != 0)\n        firstSeedValue = getUserSetSeed();\n    else\n        firstSeedValue =\n            (boost::uint32_t)(boost::posix_time::microsec_clock::universal_time() -\n                              boost::posix_time::ptime(boost::date_time::min_date_time)).total_microseconds();\n    getFirstSeedGenerated() = true;\n\n    return firstSeedValue;\n}\n\n\/\/\/ We use a different random number generator for the seeds of the\n\/\/\/ Other random generators. The root seed is from the number of\n\/\/\/ nano-seconds in the current time.\nstatic boost::uint32_t nextSeed(void)\n{\n    static boost::mutex rngMutex;\n    boost::mutex::scoped_lock slock(rngMutex);\n    static boost::lagged_fibonacci607 sGen(firstSeed());\n    static boost::uniform_int<>       sDist(1, 1000000000);\n    static boost::variate_generator<boost::lagged_fibonacci607&, boost::uniform_int<> > s(sGen, sDist);\n    return s();\n}\n\nboost::uint32_t ompl::RNG::getSeed(void)\n{\n    return firstSeed();\n}\n\nvoid ompl::RNG::setSeed(boost::uint32_t seed)\n{\n    if (getFirstSeedGenerated())\n    {\n        msg::Interface msg;\n        msg.error(\"Random number generation already started. Changing seed now will not lead to deterministic sampling.\");\n    }\n    if (seed == 0)\n    {\n        msg::Interface msg;\n        msg.warn(\"Random generator seed cannot be 0. Using 1 instead.\");\n        getUserSetSeed() = 1;\n    }\n    else\n        getUserSetSeed() = seed;\n}\n\nompl::RNG::RNG(void) : generator_(nextSeed()),\n                       uniDist_(0, 1),\n                       normalDist_(0, 1),\n                       uni_(generator_, uniDist_),\n                       normal_(generator_, normalDist_)\n{\n}\n\ndouble ompl::RNG::halfNormalReal(double r_min, double r_max, double focus)\n{\n    assert(r_min <= r_max);\n\n    const double mean = r_max - r_min;\n    double       v    = gaussian(mean, mean\/focus);\n\n    if (v > mean) v = 2.0 * mean - v;\n    double r = v >= 0.0 ? v + r_min : r_min;\n    return r > r_max ? r_max : r;\n}\n\nint ompl::RNG::halfNormalInt(int r_min, int r_max, double focus)\n{\n    int r = (int)floor(halfNormalReal((double)r_min, (double)(r_max) + 1.0, focus));\n    return (r > r_max) ? r_max : r;\n}\n\n\/\/ From: \"Uniform Random Rotations\", Ken Shoemake, Graphics Gems III,\n\/\/       pg. 124-132\nvoid ompl::RNG::quaternion(double value[4])\n{\n    double x0 = uni_();\n    double r1 = sqrt(1.0 - x0), r2 = sqrt(x0);\n    double t1 = 2.0 * boost::math::constants::pi<double>() * uni_(), t2 = 2.0 * boost::math::constants::pi<double>() * uni_();\n    double c1 = cos(t1), s1 = sin(t1);\n    double c2 = cos(t2), s2 = sin(t2);\n    value[0] = s1 * r1;\n    value[1] = c1 * r1;\n    value[2] = s2 * r2;\n    value[3] = c2 * r2;\n}\n\n\/\/ From Effective Sampling and Distance Metrics for 3D Rigid Body Path Planning, by James Kuffner, ICRA 2004\nvoid ompl::RNG::eulerRPY(double value[3])\n{\n    value[0] = boost::math::constants::pi<double>() * (2.0 * uni_() - 1.0);\n    value[1] = acos(1.0 - 2.0 * uni_()) - boost::math::constants::pi<double>() \/ 2.0;\n    value[2] = boost::math::constants::pi<double>() * (2.0 * uni_() - 1.0);\n}\n<|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 \"FileDescriptorsFeature.h\"\n\n#include \"Logger\/Logger.h\"\n#include \"ProgramOptions\/ProgramOptions.h\"\n#include \"ProgramOptions\/Section.h\"\n#include \"Scheduler\/SchedulerFeature.h\"\n\nusing namespace arangodb;\nusing namespace arangodb::application_features;\nusing namespace arangodb::basics;\nusing namespace arangodb::options;\n\nuint64_t const FileDescriptorsFeature::RECOMMENDED = 8192;\n\nFileDescriptorsFeature::FileDescriptorsFeature(\n    application_features::ApplicationServer* server)\n    : ApplicationFeature(server, \"FileDescriptors\"), _descriptorsMinimum(0) {\n  setOptional(false);\n  requiresElevatedPrivileges(false);\n  startsAfter(\"Logger\");\n}\n\nvoid FileDescriptorsFeature::collectOptions(\n    std::shared_ptr<ProgramOptions> options) {\n#ifdef TRI_HAVE_GETRLIMIT\n  options->addSection(\"server\", \"Server features\");\n\n  options->addOption(\"--server.descriptors-minimum\",\n                     \"minimum number of file descriptors needed to start\",\n                     new UInt64Parameter(&_descriptorsMinimum));\n#endif\n}\n\nvoid FileDescriptorsFeature::prepare() { adjustFileDescriptors(); }\n\n#ifdef TRI_HAVE_GETRLIMIT\ntemplate <typename T>\nstatic std::string StringifyLimitValue(T value) {\n  auto max = std::numeric_limits<decltype(value)>::max();\n  if (value == max || value == max \/ 2) {\n    return \"unlimited\";\n  }\n  return std::to_string(value);\n}\n#endif\n\nvoid FileDescriptorsFeature::start() {\n#ifdef TRI_HAVE_GETRLIMIT\n  struct rlimit rlim;\n  int res = getrlimit(RLIMIT_NOFILE, &rlim);\n\n  if (res == 0) {\n    LOG(INFO) << \"file-descriptors (nofiles) hard limit is \"\n              << StringifyLimitValue(rlim.rlim_max) << \", soft limit is \"\n              << StringifyLimitValue(rlim.rlim_cur);\n  }\n\n  if (rlim.rlim_cur < RECOMMENDED) {\n    LOG(WARN) << \"file-descriptors limit is too low, currently \"\n              << StringifyLimitValue(rlim.rlim_cur) << \", raise to at least \"\n              << RECOMMENDED;\n  }\n#endif\n}\n\nvoid FileDescriptorsFeature::adjustFileDescriptors() {\n#ifdef TRI_HAVE_GETRLIMIT\n  struct rlimit rlim;\n  int res = getrlimit(RLIMIT_NOFILE, &rlim);\n\n  if (res != 0) {\n    LOG(FATAL) << \"cannot get the file descriptor limit: \" << strerror(errno);\n    FATAL_ERROR_EXIT();\n  }\n\n  LOG(DEBUG) << \"file-descriptors (nofiles) hard limit is \"\n             << StringifyLimitValue(rlim.rlim_max) << \", soft limit is \"\n             << StringifyLimitValue(rlim.rlim_cur);\n\n  uint64_t recommended = RECOMMENDED;\n  uint64_t minimum = _descriptorsMinimum;\n\n  if (recommended < minimum) {\n    recommended = minimum;\n  }\n\n  if (rlim.rlim_max < recommended) {\n    LOG(DEBUG) << \"hard limit \" << rlim.rlim_max\n               << \" is too small, trying to raise\";\n\n    rlim.rlim_max = recommended;\n    rlim.rlim_cur = recommended;\n\n    res = setrlimit(RLIMIT_NOFILE, &rlim);\n\n    if (0 < minimum && minimum < recommended && res < 0) {\n      rlim.rlim_max = minimum;\n      rlim.rlim_cur = minimum;\n\n      res = setrlimit(RLIMIT_NOFILE, &rlim);\n    }\n\n    if (0 < minimum && res < 0) {\n      LOG(FATAL) << \"cannot raise the file descriptor limit to \" << minimum\n                 << \": \" << strerror(errno);\n      FATAL_ERROR_EXIT();\n    }\n  } else if (rlim.rlim_cur < recommended) {\n    LOG(DEBUG) << \"soft limit \" << rlim.rlim_cur\n               << \" is too small, trying to raise\";\n\n    if (recommended < rlim.rlim_max) {\n      recommended = rlim.rlim_max;\n    }\n    \n    rlim.rlim_cur = recommended;\n\n    res = setrlimit(RLIMIT_NOFILE, &rlim);\n\n    if (0 < minimum && minimum < recommended && res < 0) {\n      rlim.rlim_cur = minimum;\n\n      res = setrlimit(RLIMIT_NOFILE, &rlim);\n    }\n\n    if (0 < minimum && res < 0) {\n      LOG(FATAL) << \"cannot raise the file descriptor limit to \" << minimum\n                 << \": \" << strerror(errno);\n      FATAL_ERROR_EXIT();\n    }\n  }\n#endif\n}\n<commit_msg>added ulimit example<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 \"FileDescriptorsFeature.h\"\n\n#include \"Logger\/Logger.h\"\n#include \"ProgramOptions\/ProgramOptions.h\"\n#include \"ProgramOptions\/Section.h\"\n#include \"Scheduler\/SchedulerFeature.h\"\n\nusing namespace arangodb;\nusing namespace arangodb::application_features;\nusing namespace arangodb::basics;\nusing namespace arangodb::options;\n\nuint64_t const FileDescriptorsFeature::RECOMMENDED = 8192;\n\nFileDescriptorsFeature::FileDescriptorsFeature(\n    application_features::ApplicationServer* server)\n    : ApplicationFeature(server, \"FileDescriptors\"), _descriptorsMinimum(0) {\n  setOptional(false);\n  requiresElevatedPrivileges(false);\n  startsAfter(\"Logger\");\n}\n\nvoid FileDescriptorsFeature::collectOptions(\n    std::shared_ptr<ProgramOptions> options) {\n#ifdef TRI_HAVE_GETRLIMIT\n  options->addSection(\"server\", \"Server features\");\n\n  options->addOption(\"--server.descriptors-minimum\",\n                     \"minimum number of file descriptors needed to start\",\n                     new UInt64Parameter(&_descriptorsMinimum));\n#endif\n}\n\nvoid FileDescriptorsFeature::prepare() { adjustFileDescriptors(); }\n\n#ifdef TRI_HAVE_GETRLIMIT\ntemplate <typename T>\nstatic std::string StringifyLimitValue(T value) {\n  auto max = std::numeric_limits<decltype(value)>::max();\n  if (value == max || value == max \/ 2) {\n    return \"unlimited\";\n  }\n  return std::to_string(value);\n}\n#endif\n\nvoid FileDescriptorsFeature::start() {\n#ifdef TRI_HAVE_GETRLIMIT\n  struct rlimit rlim;\n  int res = getrlimit(RLIMIT_NOFILE, &rlim);\n\n  if (res == 0) {\n    LOG(INFO) << \"file-descriptors (nofiles) hard limit is \"\n              << StringifyLimitValue(rlim.rlim_max) << \", soft limit is \"\n              << StringifyLimitValue(rlim.rlim_cur);\n  }\n\n  if (rlim.rlim_cur < RECOMMENDED) {\n    LOG(WARN) << \"file-descriptors limit is too low, currently \"\n              << StringifyLimitValue(rlim.rlim_cur) << \", please raise to at least \"\n              << RECOMMENDED << \" (e.g. ulimit -n \" << RECOMMENDED << \")\";\n  }\n#endif\n}\n\nvoid FileDescriptorsFeature::adjustFileDescriptors() {\n#ifdef TRI_HAVE_GETRLIMIT\n  struct rlimit rlim;\n  int res = getrlimit(RLIMIT_NOFILE, &rlim);\n\n  if (res != 0) {\n    LOG(FATAL) << \"cannot get the file descriptor limit: \" << strerror(errno);\n    FATAL_ERROR_EXIT();\n  }\n\n  LOG(DEBUG) << \"file-descriptors (nofiles) hard limit is \"\n             << StringifyLimitValue(rlim.rlim_max) << \", soft limit is \"\n             << StringifyLimitValue(rlim.rlim_cur);\n\n  uint64_t recommended = RECOMMENDED;\n  uint64_t minimum = _descriptorsMinimum;\n\n  if (recommended < minimum) {\n    recommended = minimum;\n  }\n\n  if (rlim.rlim_max < recommended) {\n    LOG(DEBUG) << \"hard limit \" << rlim.rlim_max\n               << \" is too small, trying to raise\";\n\n    rlim.rlim_max = recommended;\n    rlim.rlim_cur = recommended;\n\n    res = setrlimit(RLIMIT_NOFILE, &rlim);\n\n    if (0 < minimum && minimum < recommended && res < 0) {\n      rlim.rlim_max = minimum;\n      rlim.rlim_cur = minimum;\n\n      res = setrlimit(RLIMIT_NOFILE, &rlim);\n    }\n\n    if (0 < minimum && res < 0) {\n      LOG(FATAL) << \"cannot raise the file descriptor limit to \" << minimum\n                 << \": \" << strerror(errno);\n      FATAL_ERROR_EXIT();\n    }\n  } else if (rlim.rlim_cur < recommended) {\n    LOG(DEBUG) << \"soft limit \" << rlim.rlim_cur\n               << \" is too small, trying to raise\";\n\n    if (recommended < rlim.rlim_max) {\n      recommended = rlim.rlim_max;\n    }\n    \n    rlim.rlim_cur = recommended;\n\n    res = setrlimit(RLIMIT_NOFILE, &rlim);\n\n    if (0 < minimum && minimum < recommended && res < 0) {\n      rlim.rlim_cur = minimum;\n\n      res = setrlimit(RLIMIT_NOFILE, &rlim);\n    }\n\n    if (0 < minimum && res < 0) {\n      LOG(FATAL) << \"cannot raise the file descriptor limit to \" << minimum\n                 << \": \" << strerror(errno);\n      FATAL_ERROR_EXIT();\n    }\n  }\n#endif\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>7d30df82-2e4e-11e5-9284-b827eb9e62be<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"global_include.h\"\n#include \"math_conversions.h\"\n#include <cmath>\n\nnamespace dronecode_sdk {\n\n\/\/ TODO: this needs to be unit tested.\n\nTelemetry::EulerAngle to_euler_angle_from_quaternion(Telemetry::Quaternion quaternion)\n{\n    auto &q = quaternion;\n\n    Telemetry::EulerAngle euler_angle{\n        to_deg_from_rad(\n            atan2f(2.0f * (q.w * q.x + q.y * q.z), 1.0f - 2.0f * (q.x * q.x + q.y * q.y))),\n        to_deg_from_rad(asinf(2.0f * (q.w * q.y - q.z * q.x))),\n        to_deg_from_rad(\n            atan2f(2.0f * (q.w * q.z + q.x * q.y), 1.0f - 2.0f * (q.y * q.y + q.z * q.z)))};\n    return euler_angle;\n}\n\nTelemetry::Quaternion to_quaternion_from_euler_angle(Telemetry::EulerAngle euler_angle)\n{\n    const double cos_phi_2 = cos(double(euler_angle.roll_deg) \/ 2.0);\n    const double sin_phi_2 = sin(double(euler_angle.roll_deg) \/ 2.0);\n    const double cos_theta_2 = cos(double(euler_angle.pitch_deg) \/ 2.0);\n    const double sin_theta_2 = sin(double(euler_angle.pitch_deg) \/ 2.0);\n    const double cos_psi_2 = cos(double(euler_angle.yaw_deg) \/ 2.0);\n    const double sin_psi_2 = sin(double(euler_angle.yaw_deg) \/ 2.0);\n\n    \/\/ Need to disable astyle for this block.\n    \/\/ *INDENT-OFF*\n    Telemetry::Quaternion quaternion{\n        (float(cos_phi_2 * cos_theta_2 * cos_psi_2 + sin_phi_2 * sin_theta_2 * sin_psi_2)),\n        (float(sin_phi_2 * cos_theta_2 * cos_psi_2 - cos_phi_2 * sin_theta_2 * sin_psi_2)),\n        (float(cos_phi_2 * sin_theta_2 * cos_psi_2 + sin_phi_2 * cos_theta_2 * sin_psi_2)),\n        (float(cos_phi_2 * cos_theta_2 * sin_psi_2 - sin_phi_2 * sin_theta_2 * cos_psi_2))};\n    \/\/ *INDENT-ON*\n\n    return quaternion;\n}\n\n} \/\/ namespace dronecode_sdk\n<commit_msg>telemetry: remove comments about astyle<commit_after>#include \"global_include.h\"\n#include \"math_conversions.h\"\n#include <cmath>\n\nnamespace dronecode_sdk {\n\n\/\/ TODO: this needs to be unit tested.\n\nTelemetry::EulerAngle to_euler_angle_from_quaternion(Telemetry::Quaternion quaternion)\n{\n    auto &q = quaternion;\n\n    Telemetry::EulerAngle euler_angle{\n        to_deg_from_rad(\n            atan2f(2.0f * (q.w * q.x + q.y * q.z), 1.0f - 2.0f * (q.x * q.x + q.y * q.y))),\n        to_deg_from_rad(asinf(2.0f * (q.w * q.y - q.z * q.x))),\n        to_deg_from_rad(\n            atan2f(2.0f * (q.w * q.z + q.x * q.y), 1.0f - 2.0f * (q.y * q.y + q.z * q.z)))};\n    return euler_angle;\n}\n\nTelemetry::Quaternion to_quaternion_from_euler_angle(Telemetry::EulerAngle euler_angle)\n{\n    const double cos_phi_2 = cos(double(euler_angle.roll_deg) \/ 2.0);\n    const double sin_phi_2 = sin(double(euler_angle.roll_deg) \/ 2.0);\n    const double cos_theta_2 = cos(double(euler_angle.pitch_deg) \/ 2.0);\n    const double sin_theta_2 = sin(double(euler_angle.pitch_deg) \/ 2.0);\n    const double cos_psi_2 = cos(double(euler_angle.yaw_deg) \/ 2.0);\n    const double sin_psi_2 = sin(double(euler_angle.yaw_deg) \/ 2.0);\n\n    Telemetry::Quaternion quaternion{\n        (float(cos_phi_2 * cos_theta_2 * cos_psi_2 + sin_phi_2 * sin_theta_2 * sin_psi_2)),\n        (float(sin_phi_2 * cos_theta_2 * cos_psi_2 - cos_phi_2 * sin_theta_2 * sin_psi_2)),\n        (float(cos_phi_2 * sin_theta_2 * cos_psi_2 + sin_phi_2 * cos_theta_2 * sin_psi_2)),\n        (float(cos_phi_2 * cos_theta_2 * sin_psi_2 - sin_phi_2 * sin_theta_2 * cos_psi_2))};\n\n    return quaternion;\n}\n\n} \/\/ namespace dronecode_sdk\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: WrappedSeriesOrDiagramProperty.hxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: ihi $ $Date: 2007-08-17 12:12: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 CHART_WRAPPED_SERIES_OR_DIAGRAM_PROPERTY_HXX\n#define CHART_WRAPPED_SERIES_OR_DIAGRAM_PROPERTY_HXX\n\n#include \"WrappedProperty.hxx\"\n#include \"Chart2ModelContact.hxx\"\n#include \"macros.hxx\"\n#include \"DiagramHelper.hxx\"\n\n#ifndef _COM_SUN_STAR_CHART2_XDATASERIES_HPP_\n#include <com\/sun\/star\/chart2\/XDataSeries.hpp>\n#endif\n\n#include <boost\/shared_ptr.hpp>\n#include <vector>\n\n\/\/.............................................................................\nnamespace chart\n{\nnamespace wrapper\n{\n\n\/\/PROPERTYTYPE is the type of the outer property\n\ntemplate< typename PROPERTYTYPE >\nclass WrappedSeriesOrDiagramProperty : public WrappedProperty\n{\npublic:\n    virtual PROPERTYTYPE getValueFromSeries( const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& xSeriesPropertySet ) const =0;\n    virtual void setValueToSeries( const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& xSeriesPropertySet, PROPERTYTYPE aNewValue ) const =0;\n\n    explicit WrappedSeriesOrDiagramProperty( const ::rtl::OUString& rName, const ::com::sun::star::uno::Any& rDefaulValue\n        , ::boost::shared_ptr< Chart2ModelContact > spChart2ModelContact )\/\/if !spChart2ModelContact.get() this property does belong to a single series and not to the whole diagram\n            : WrappedProperty(rName,::rtl::OUString())\n            , m_spChart2ModelContact(spChart2ModelContact)\n            , m_aOuterValue(rDefaulValue)\n            , m_aDefaultValue(rDefaulValue)\n    {\n    }\n    virtual ~WrappedSeriesOrDiagramProperty() {};\n\n    bool detectInnerValue( PROPERTYTYPE& rValue, bool& rHasAmbiguousValue ) const\n    {\n        bool bHasDetectableInnerValue = false;\n        rHasAmbiguousValue = false;\n        if( m_spChart2ModelContact.get() )\n        {\n            ::std::vector< ::com::sun::star::uno::Reference< ::com::sun::star::chart2::XDataSeries > > aSeriesVector(\n                ::chart::DiagramHelper::getDataSeriesFromDiagram( m_spChart2ModelContact->getChart2Diagram() ) );\n            ::std::vector< ::com::sun::star::uno::Reference< ::com::sun::star::chart2::XDataSeries > >::const_iterator aIter =\n                    aSeriesVector.begin();\n            for( ; aIter != aSeriesVector.end(); aIter++ )\n            {\n                PROPERTYTYPE aCurValue = getValueFromSeries( ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >::query( *aIter ) );\n                if( !bHasDetectableInnerValue )\n                    rValue = aCurValue;\n                else\n                {\n                    if( rValue != aCurValue )\n                    {\n                        rHasAmbiguousValue = true;\n                        break;\n                    }\n                    else\n                        rValue = aCurValue;\n                }\n                bHasDetectableInnerValue = true;\n            }\n        }\n        return bHasDetectableInnerValue;\n    }\n    void setInnerValue( PROPERTYTYPE aNewValue ) const\n    {\n        if( m_spChart2ModelContact.get() )\n        {\n            ::std::vector< ::com::sun::star::uno::Reference< ::com::sun::star::chart2::XDataSeries > > aSeriesVector(\n                ::chart::DiagramHelper::getDataSeriesFromDiagram( m_spChart2ModelContact->getChart2Diagram() ) );\n            ::std::vector< ::com::sun::star::uno::Reference< ::com::sun::star::chart2::XDataSeries > >::const_iterator aIter =\n                    aSeriesVector.begin();\n            for( ; aIter != aSeriesVector.end(); aIter++ )\n            {\n                ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet > xSeriesPropertySet( *aIter, ::com::sun::star::uno::UNO_QUERY );\n                if( xSeriesPropertySet.is() )\n                {\n                    setValueToSeries( xSeriesPropertySet, aNewValue );\n                }\n            }\n        }\n    }\n    virtual void setPropertyValue( const ::com::sun::star::uno::Any& rOuterValue, const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& xInnerPropertySet ) const\n                    throw (::com::sun::star::beans::UnknownPropertyException, ::com::sun::star::beans::PropertyVetoException, ::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException)\n    {\n        PROPERTYTYPE aNewValue = PROPERTYTYPE();\n        if( ! (rOuterValue >>= aNewValue) )\n            throw ::com::sun::star::lang::IllegalArgumentException( C2U(\"statistic property requires different type\"), 0, 0 );\n\n        if( m_spChart2ModelContact.get() )\n        {\n            m_aOuterValue = rOuterValue;\n\n            bool bHasAmbiguousValue = false;\n            PROPERTYTYPE aOldValue = PROPERTYTYPE();\n            if( detectInnerValue( aOldValue, bHasAmbiguousValue ) )\n            {\n                if( bHasAmbiguousValue || aNewValue != aOldValue )\n                    setInnerValue( aNewValue );\n            }\n        }\n        else\n        {\n            setValueToSeries( xInnerPropertySet, aNewValue );\n        }\n    }\n\n    virtual ::com::sun::star::uno::Any getPropertyValue( const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& xInnerPropertySet ) const\n                            throw (::com::sun::star::beans::UnknownPropertyException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException)\n    {\n        if( m_spChart2ModelContact.get() )\n        {\n            bool bHasAmbiguousValue = false;\n            PROPERTYTYPE aValue;\n            if( detectInnerValue( aValue, bHasAmbiguousValue ) )\n            {\n                if(bHasAmbiguousValue)\n                    m_aOuterValue <<= m_aDefaultValue;\n                else\n                    m_aOuterValue <<= aValue;\n            }\n            return m_aOuterValue;\n        }\n        else\n        {\n            ::com::sun::star::uno::Any aRet( m_aDefaultValue );\n            aRet <<= getValueFromSeries( xInnerPropertySet );\n            return aRet;\n        }\n    }\n\n    virtual ::com::sun::star::uno::Any getPropertyDefault( const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertyState >& \/* xInnerPropertyState *\/ ) const\n                            throw (::com::sun::star::beans::UnknownPropertyException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException)\n    {\n        return m_aDefaultValue;\n    }\n\nprotected:\n    ::boost::shared_ptr< Chart2ModelContact >   m_spChart2ModelContact;\n    mutable ::com::sun::star::uno::Any     m_aOuterValue;\n    ::com::sun::star::uno::Any             m_aDefaultValue;\n};\n\n} \/\/namespace wrapper\n} \/\/namespace chart\n\/\/.............................................................................\n\n\/\/ CHART_WRAPPED_SERIES_OR_DIAGRAM_PROPERTY_HXX\n#endif\n<commit_msg>INTEGRATION: CWS chart20_DEV300 (1.5.56); FILE MERGED 2008\/02\/21 15:59:25 bm 1.5.56.1: #i366# error bars from ranges<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: WrappedSeriesOrDiagramProperty.hxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: kz $ $Date: 2008-03-06 16:17: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#ifndef CHART_WRAPPED_SERIES_OR_DIAGRAM_PROPERTY_HXX\n#define CHART_WRAPPED_SERIES_OR_DIAGRAM_PROPERTY_HXX\n\n#include \"WrappedProperty.hxx\"\n#include \"Chart2ModelContact.hxx\"\n#include \"macros.hxx\"\n#include \"DiagramHelper.hxx\"\n\n#ifndef _COM_SUN_STAR_CHART2_XDATASERIES_HPP_\n#include <com\/sun\/star\/chart2\/XDataSeries.hpp>\n#endif\n\n#include <boost\/shared_ptr.hpp>\n#include <vector>\n\n\/\/.............................................................................\nnamespace chart\n{\nnamespace wrapper\n{\n\nenum tSeriesOrDiagramPropertyType\n{\n    DATA_SERIES,\n    DIAGRAM\n};\n\n\/\/PROPERTYTYPE is the type of the outer property\n\ntemplate< typename PROPERTYTYPE >\nclass WrappedSeriesOrDiagramProperty : public WrappedProperty\n{\npublic:\n    virtual PROPERTYTYPE getValueFromSeries( const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& xSeriesPropertySet ) const =0;\n    virtual void setValueToSeries( const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& xSeriesPropertySet, PROPERTYTYPE aNewValue ) const =0;\n\n    explicit WrappedSeriesOrDiagramProperty( const ::rtl::OUString& rName, const ::com::sun::star::uno::Any& rDefaulValue\n        , ::boost::shared_ptr< Chart2ModelContact > spChart2ModelContact\n        , tSeriesOrDiagramPropertyType ePropertyType )\n            : WrappedProperty(rName,::rtl::OUString())\n            , m_spChart2ModelContact(spChart2ModelContact)\n            , m_aOuterValue(rDefaulValue)\n            , m_aDefaultValue(rDefaulValue)\n            , m_ePropertyType( ePropertyType )\n    {\n    }\n    virtual ~WrappedSeriesOrDiagramProperty() {};\n\n    bool detectInnerValue( PROPERTYTYPE& rValue, bool& rHasAmbiguousValue ) const\n    {\n        bool bHasDetectableInnerValue = false;\n        rHasAmbiguousValue = false;\n        if( m_ePropertyType == DIAGRAM &&\n            m_spChart2ModelContact.get() )\n        {\n            ::std::vector< ::com::sun::star::uno::Reference< ::com::sun::star::chart2::XDataSeries > > aSeriesVector(\n                ::chart::DiagramHelper::getDataSeriesFromDiagram( m_spChart2ModelContact->getChart2Diagram() ) );\n            ::std::vector< ::com::sun::star::uno::Reference< ::com::sun::star::chart2::XDataSeries > >::const_iterator aIter =\n                    aSeriesVector.begin();\n            for( ; aIter != aSeriesVector.end(); aIter++ )\n            {\n                PROPERTYTYPE aCurValue = getValueFromSeries( ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >::query( *aIter ) );\n                if( !bHasDetectableInnerValue )\n                    rValue = aCurValue;\n                else\n                {\n                    if( rValue != aCurValue )\n                    {\n                        rHasAmbiguousValue = true;\n                        break;\n                    }\n                    else\n                        rValue = aCurValue;\n                }\n                bHasDetectableInnerValue = true;\n            }\n        }\n        return bHasDetectableInnerValue;\n    }\n    void setInnerValue( PROPERTYTYPE aNewValue ) const\n    {\n        if( m_ePropertyType == DIAGRAM &&\n            m_spChart2ModelContact.get() )\n        {\n            ::std::vector< ::com::sun::star::uno::Reference< ::com::sun::star::chart2::XDataSeries > > aSeriesVector(\n                ::chart::DiagramHelper::getDataSeriesFromDiagram( m_spChart2ModelContact->getChart2Diagram() ) );\n            ::std::vector< ::com::sun::star::uno::Reference< ::com::sun::star::chart2::XDataSeries > >::const_iterator aIter =\n                    aSeriesVector.begin();\n            for( ; aIter != aSeriesVector.end(); aIter++ )\n            {\n                ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet > xSeriesPropertySet( *aIter, ::com::sun::star::uno::UNO_QUERY );\n                if( xSeriesPropertySet.is() )\n                {\n                    setValueToSeries( xSeriesPropertySet, aNewValue );\n                }\n            }\n        }\n    }\n    virtual void setPropertyValue( const ::com::sun::star::uno::Any& rOuterValue, const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& xInnerPropertySet ) const\n                    throw (::com::sun::star::beans::UnknownPropertyException, ::com::sun::star::beans::PropertyVetoException, ::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException)\n    {\n        PROPERTYTYPE aNewValue = PROPERTYTYPE();\n        if( ! (rOuterValue >>= aNewValue) )\n            throw ::com::sun::star::lang::IllegalArgumentException( C2U(\"statistic property requires different type\"), 0, 0 );\n\n        if( m_ePropertyType == DIAGRAM )\n        {\n            m_aOuterValue = rOuterValue;\n\n            bool bHasAmbiguousValue = false;\n            PROPERTYTYPE aOldValue = PROPERTYTYPE();\n            if( detectInnerValue( aOldValue, bHasAmbiguousValue ) )\n            {\n                if( bHasAmbiguousValue || aNewValue != aOldValue )\n                    setInnerValue( aNewValue );\n            }\n        }\n        else\n        {\n            setValueToSeries( xInnerPropertySet, aNewValue );\n        }\n    }\n\n    virtual ::com::sun::star::uno::Any getPropertyValue( const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& xInnerPropertySet ) const\n                            throw (::com::sun::star::beans::UnknownPropertyException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException)\n    {\n        if( m_ePropertyType == DIAGRAM )\n        {\n            bool bHasAmbiguousValue = false;\n            PROPERTYTYPE aValue;\n            if( detectInnerValue( aValue, bHasAmbiguousValue ) )\n            {\n                if(bHasAmbiguousValue)\n                    m_aOuterValue <<= m_aDefaultValue;\n                else\n                    m_aOuterValue <<= aValue;\n            }\n            return m_aOuterValue;\n        }\n        else\n        {\n            ::com::sun::star::uno::Any aRet( m_aDefaultValue );\n            aRet <<= getValueFromSeries( xInnerPropertySet );\n            return aRet;\n        }\n    }\n\n    virtual ::com::sun::star::uno::Any getPropertyDefault( const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertyState >& \/* xInnerPropertyState *\/ ) const\n                            throw (::com::sun::star::beans::UnknownPropertyException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException)\n    {\n        return m_aDefaultValue;\n    }\n\nprotected:\n    ::boost::shared_ptr< Chart2ModelContact >  m_spChart2ModelContact;\n    mutable ::com::sun::star::uno::Any         m_aOuterValue;\n    ::com::sun::star::uno::Any                 m_aDefaultValue;\n    tSeriesOrDiagramPropertyType               m_ePropertyType;\n};\n\n} \/\/namespace wrapper\n} \/\/namespace chart\n\/\/.............................................................................\n\n\/\/ CHART_WRAPPED_SERIES_OR_DIAGRAM_PROPERTY_HXX\n#endif\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>7156eeea-2e4e-11e5-9284-b827eb9e62be<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>aaa73fa8-2e4c-11e5-9284-b827eb9e62be<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>60d56638-2e4d-11e5-9284-b827eb9e62be<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>70b6e2ec-2e4e-11e5-9284-b827eb9e62be<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>ffcd3364-2e4e-11e5-9284-b827eb9e62be<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>45e15ca6-2e4d-11e5-9284-b827eb9e62be<commit_after><|endoftext|>"}
{"text":"<commit_before>\/********************************************************************************\n  libvideogfx\/containers\/symmatrix.hh\n\n  purpose:\n    Memory efficient symmetric matrix.\n\n  notes:\n\n  to do:\n\n  author(s):\n   - Dirk Farin, dirk.farin@gmx.de\n\n  modifications:\n   25\/Feb\/2004 - Dirk Farin\n     - first implementation\n ********************************************************************************\n    LibVideoGfx - video processing library\n    Copyright (C) 2004  Dirk Farin\n\n    This 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#ifndef LIBVIDEOGFX_CONTAINERS_SYMMATRIX_HH\n#define LIBVIDEOGFX_CONTAINERS_SYMMATRIX_HH\n\n#include \"libvideogfx\/types.hh\"\n#include <assert.h>\n#include <algorithm>\n\nnamespace videogfx {\n\n  template <class T> class SymMatrix\n  {\n  public:\n    SymMatrix() : d_array(NULL), d_size(0) { }\n    SymMatrix(int size) : d_array(NULL) { Create(size); }\n    ~SymMatrix() { if (d_array) delete[] d_array; }\n\n    void Create(int size)\n    {\n      if (d_array) delete[] d_array;\n\n      d_array = new T[ size*(size+1)\/2 ];\n      d_size  = size;\n    }\n\n    bool IsInitialized() const { return d_array != NULL; }\n\n    int AskSize()  const { return d_size; }\n\n    T& Ask(int y,int x)\n    {\n      \/* Memory layout:\n\t 0123      0123\n\t .456 ---> 456.\n\t ..78      78..\n\t ...9      9...\n\n\t -> 0 1 2 3|4 5 6|7 8|9\n\n\t Number of dots to skip before row 'i': i*(i-1)\/2\n      *\/\n\n      if (x<y) return Ask(x,y);\n      return d_array[y*d_size - y*(y-1)\/2 + x];\n    }\n\n    const T& Ask(int y,int x) const\n    {\n      if (x<y) return Ask(x,y);\n      return d_array[y*d_size - y*(y-1)\/2 + x];\n    }\n\n    const SymMatrix& operator=(const SymMatrix& a)\n    {\n      int s = a.AskSize();\n      Create(s);\n\n      int len = s*(s+1)\/2;\n\n      for (int i=0;i<s;i++)\n\td_array[i] = a.d_array[i];\n\n      return *this;\n    }\n\n  private:\n    int  d_size;\n    T*   d_array;\n  };\n}\n\n#endif\n<commit_msg>reduced number of computations for calculating array index<commit_after>\/********************************************************************************\n  libvideogfx\/containers\/symmatrix.hh\n\n  purpose:\n    Memory efficient symmetric matrix.\n\n  notes:\n\n  to do:\n\n  author(s):\n   - Dirk Farin, dirk.farin@gmx.de\n\n  modifications:\n   25\/Feb\/2004 - Dirk Farin\n     - first implementation\n ********************************************************************************\n    LibVideoGfx - video processing library\n    Copyright (C) 2004  Dirk Farin\n\n    This 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#ifndef LIBVIDEOGFX_CONTAINERS_SYMMATRIX_HH\n#define LIBVIDEOGFX_CONTAINERS_SYMMATRIX_HH\n\n#include \"libvideogfx\/types.hh\"\n#include <assert.h>\n#include <algorithm>\n\nnamespace videogfx {\n\n  template <class T> class SymMatrix\n  {\n  public:\n    SymMatrix() : d_array(NULL), d_size(0) { }\n    SymMatrix(int size) : d_array(NULL) { Create(size); }\n    ~SymMatrix() { if (d_array) delete[] d_array; }\n\n    void Create(int size)\n    {\n      if (d_array) delete[] d_array;\n\n      d_array = new T[ size*(size+1)\/2 ];\n      d_size  = size;\n      d_c = 2*d_size-1;\n    }\n\n    bool IsInitialized() const { return d_array != NULL; }\n\n    int AskSize()  const { return d_size; }\n\n    T& Ask(int y,int x)\n    {\n      \/* Memory layout:\n\t 0123      0123\n\t .456 ---> 456.\n\t ..78      78..\n\t ...9      9...\n\n\t -> 0 1 2 3|4 5 6|7 8|9\n\n\t Number of dots to skip before row 'i': i*(i-1)\/2\n\n\t Calculation of array index:\n\t Idx = y*d_size - y*(y-1)\/2 + x\n\t .   = y*(c-y)\/2 + x     with c = 2*d_size-1\n\n\t Last equation should be a bit faster since c is constant.\n      *\/\n\n      if (x<y) return Ask(x,y);\n      return d_array[y*(d_c-y)\/2 + x];\n    }\n\n    const T& Ask(int y,int x) const\n    {\n      if (x<y) return Ask(x,y);\n      return d_array[y*(d_c-y)\/2 + x];\n    }\n\n    const SymMatrix& operator=(const SymMatrix& a)\n    {\n      int s = a.AskSize();\n      Create(s);\n\n      int len = s*(s+1)\/2;\n\n      for (int i=0;i<s;i++)\n\td_array[i] = a.d_array[i];\n\n      return *this;\n    }\n\n  private:\n    int  d_size;\n    T*   d_array;\n    int  d_c;  \/\/ constant for faster array index computation\n  };\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>04904f76-2e4f-11e5-9284-b827eb9e62be<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>dc78e756-2e4d-11e5-9284-b827eb9e62be<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   ORFEO Toolbox\n  Language:  C++\n  Date:      $Date$\n  Version:   $Revision$\n\n\n  Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n  See OTBCopyright.txt for details.\n\n\n     This software is distributed WITHOUT ANY WARRANTY; without even \n     the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR \n     PURPOSE.  See the above copyright notices for more information.\n\n=========================================================================*\/\n\n#if defined(_MSC_VER)\n#pragma warning ( disable : 4786 )\n#endif\n\n#define MAIN\n\n#include \"otbImage.h\"\n#include \"otbImageFileReader.h\"\n#include \"otbImageFileWriter.h\"\n#include \"otbForwardFourierMellinTransformImageFilter.h\"\n#include \"itkLinearInterpolateImageFunction.h\"\n#include \"itkComplexToImaginaryImageFilter.h\"\n#include \"itkComplexToRealImageFilter.h\"\n#include \"itkImageRegionConstIteratorWithIndex.h\"\n#include \"itkImageRegionIterator.h\"\n#include \"itkRescaleIntensityImageFilter.h\"\n\nint otbFourierMellinImageFilter(int argc, char* argv[])\n{\n  try \n    {\n\n        const char * inputFilename  = argv[1];\n        const char * outputRealFilename = argv[2];\n\tconst char * outputImaginaryFilename = argv[3];\n        typedef double                                          InputPixelType;\n        typedef std::complex<double>                            OutputPixelType;\n  \tconst   unsigned int        \t                        Dimension = 2;\n\n  \ttypedef otb::Image< InputPixelType, Dimension >         InputImageType;\n        typedef otb::ImageFileReader< InputImageType  >         ReaderType;\n        typedef otb::ImageFileWriter< InputImageType> WriterType;\n   \n  \ttypedef itk::LinearInterpolateImageFunction< InputImageType, double >\tInterpolatorType;\n        typedef otb::ForwardFourierMellinTransformImageFilter<InputPixelType,InterpolatorType,Dimension> FourierMellinTransformType;\n\ttypedef FourierMellinTransformType::OutputImageType OutputImageType;\n\ttypedef itk::ComplexToRealImageFilter<OutputImageType,InputImageType> RealFilterType;\n\ttypedef itk::ComplexToImaginaryImageFilter<OutputImageType,InputImageType> ImaginaryFilterType;\n\ttypedef itk::RescaleIntensityImageFilter<InputImageType,InputImageType> RescalerType;\n\n     \tFourierMellinTransformType::Pointer FourierMellinTransform = FourierMellinTransformType::New();\n\tRealFilterType::Pointer real = RealFilterType::New();\n\tImaginaryFilterType::Pointer imaginary = ImaginaryFilterType::New();\n\tRescalerType::Pointer realRescaler = RescalerType::New();\n\tRescalerType::Pointer imaginaryRescaler = RescalerType::New();\n\n        ReaderType::Pointer reader = ReaderType::New();\n        WriterType::Pointer realWriter = WriterType::New();\n\tWriterType::Pointer imaginaryWriter = WriterType::New();\n\n        reader->SetFileName( inputFilename  );\n        realWriter->SetFileName( outputRealFilename );\n\timaginaryWriter->SetFileName(outputImaginaryFilename);\n\n\tOutputImageType::SizeType size;\n\tsize[0]=512;\n\tsize[1]=256;\n\t\n\tFourierMellinTransform->SetInput( reader->GetOutput() );\n\tFourierMellinTransform->SetOutputSize(size);\n\n \treal->SetInput(FourierMellinTransform->GetOutput());\n\trealRescaler->SetInput(real->GetOutput());\n\trealRescaler->SetOutputMinimum(-1);\n\trealRescaler->SetOutputMaximum(1);\n\n        realWriter->SetInput( realRescaler->GetOutput() );       \n        realWriter->Update();\n\n\timaginary->SetInput(FourierMellinTransform->GetOutput());\n\timaginaryRescaler->SetInput(imaginary->GetOutput());\n\timaginaryRescaler->SetOutputMinimum(-1);\n\timaginaryRescaler->SetOutputMaximum(1);\n\n\n\tstd::cout<<vcl_acos(-1)<<std::endl;\n\n        imaginaryWriter->SetInput( imaginaryRescaler->GetOutput() );       \n        imaginaryWriter->Update();\n\t\n    } \n  catch( itk::ExceptionObject & err ) \n    { \n    std::cerr << \"itk::Exception detected: \"  << err.GetDescription();\n    return EXIT_FAILURE;\n    } \n  catch( ... ) \n    { \n    std::cout << \"unknown exception detected !\" << std::endl; \n    return EXIT_FAILURE;\n    } \n  \n  return EXIT_SUCCESS;\n}\n<commit_msg>oubli message debug.<commit_after>\/*=========================================================================\n\n  Program:   ORFEO Toolbox\n  Language:  C++\n  Date:      $Date$\n  Version:   $Revision$\n\n\n  Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n  See OTBCopyright.txt for details.\n\n\n     This software is distributed WITHOUT ANY WARRANTY; without even \n     the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR \n     PURPOSE.  See the above copyright notices for more information.\n\n=========================================================================*\/\n\n#if defined(_MSC_VER)\n#pragma warning ( disable : 4786 )\n#endif\n\n#define MAIN\n\n#include \"otbImage.h\"\n#include \"otbImageFileReader.h\"\n#include \"otbImageFileWriter.h\"\n#include \"otbForwardFourierMellinTransformImageFilter.h\"\n#include \"itkLinearInterpolateImageFunction.h\"\n#include \"itkComplexToImaginaryImageFilter.h\"\n#include \"itkComplexToRealImageFilter.h\"\n#include \"itkImageRegionConstIteratorWithIndex.h\"\n#include \"itkImageRegionIterator.h\"\n#include \"itkRescaleIntensityImageFilter.h\"\n\nint otbFourierMellinImageFilter(int argc, char* argv[])\n{\n  try \n    {\n\n        const char * inputFilename  = argv[1];\n        const char * outputRealFilename = argv[2];\n\tconst char * outputImaginaryFilename = argv[3];\n        typedef double                                          InputPixelType;\n        typedef std::complex<double>                            OutputPixelType;\n  \tconst   unsigned int        \t                        Dimension = 2;\n\n  \ttypedef otb::Image< InputPixelType, Dimension >         InputImageType;\n        typedef otb::ImageFileReader< InputImageType  >         ReaderType;\n        typedef otb::ImageFileWriter< InputImageType> WriterType;\n   \n  \ttypedef itk::LinearInterpolateImageFunction< InputImageType, double >\tInterpolatorType;\n        typedef otb::ForwardFourierMellinTransformImageFilter<InputPixelType,InterpolatorType,Dimension> FourierMellinTransformType;\n\ttypedef FourierMellinTransformType::OutputImageType OutputImageType;\n\ttypedef itk::ComplexToRealImageFilter<OutputImageType,InputImageType> RealFilterType;\n\ttypedef itk::ComplexToImaginaryImageFilter<OutputImageType,InputImageType> ImaginaryFilterType;\n\ttypedef itk::RescaleIntensityImageFilter<InputImageType,InputImageType> RescalerType;\n\n     \tFourierMellinTransformType::Pointer FourierMellinTransform = FourierMellinTransformType::New();\n\tRealFilterType::Pointer real = RealFilterType::New();\n\tImaginaryFilterType::Pointer imaginary = ImaginaryFilterType::New();\n\tRescalerType::Pointer realRescaler = RescalerType::New();\n\tRescalerType::Pointer imaginaryRescaler = RescalerType::New();\n\n        ReaderType::Pointer reader = ReaderType::New();\n        WriterType::Pointer realWriter = WriterType::New();\n\tWriterType::Pointer imaginaryWriter = WriterType::New();\n\n        reader->SetFileName( inputFilename  );\n        realWriter->SetFileName( outputRealFilename );\n\timaginaryWriter->SetFileName(outputImaginaryFilename);\n\n\tOutputImageType::SizeType size;\n\tsize[0]=512;\n\tsize[1]=256;\n\t\n\tFourierMellinTransform->SetInput( reader->GetOutput() );\n\tFourierMellinTransform->SetOutputSize(size);\n\n \treal->SetInput(FourierMellinTransform->GetOutput());\n\trealRescaler->SetInput(real->GetOutput());\n\trealRescaler->SetOutputMinimum(-1);\n\trealRescaler->SetOutputMaximum(1);\n\n        realWriter->SetInput( realRescaler->GetOutput() );       \n        realWriter->Update();\n\n\timaginary->SetInput(FourierMellinTransform->GetOutput());\n\timaginaryRescaler->SetInput(imaginary->GetOutput());\n\timaginaryRescaler->SetOutputMinimum(-1);\n\timaginaryRescaler->SetOutputMaximum(1);\n\n    imaginaryWriter->SetInput( imaginaryRescaler->GetOutput() );       \n    imaginaryWriter->Update();\n\t\n    } \n  catch( itk::ExceptionObject & err ) \n    { \n    std::cerr << \"itk::Exception detected: \"  << err.GetDescription();\n    return EXIT_FAILURE;\n    } \n  catch( ... ) \n    { \n    std::cout << \"unknown exception detected !\" << std::endl; \n    return EXIT_FAILURE;\n    } \n  \n  return EXIT_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>e5736e26-2e4d-11e5-9284-b827eb9e62be<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/\/ @file\n\/\/\/ @author  Boris Mikic\n\/\/\/ @version 2.4\n\/\/\/ \n\/\/\/ @section LICENSE\n\/\/\/ \n\/\/\/ This program is free software; you can redistribute it and\/or modify it under\n\/\/\/ the terms of the BSD license: http:\/\/www.opensource.org\/licenses\/bsd-license.php\n\/\/\/ \n\/\/\/ @section DESCRIPTION\n\/\/\/ \n\/\/\/ Represents an implementation of the AudioManager for Android.\n\n#ifdef HAVE_ANDROID\n#include <string.h>\n\n#include <hltypes\/exception.h>\n#include <hltypes\/hdir.h>\n#include <hltypes\/hltypesUtil.h>\n#include <hltypes\/hmap.h>\n#include <hltypes\/hstring.h>\n\n#include <AL\/al.h>\n#include <AL\/alc.h>\n\n#include \"Buffer.h\"\n#include \"Category.h\"\n#include \"Android_AudioManager.h\"\n#include \"Android_Player.h\"\n#include \"xal.h\"\n\nextern \"C\" int __openal__JNI_OnLoad(void* vm);\n\nnamespace xal\n{\n\tAndroid_AudioManager::Android_AudioManager(chstr systemName, void* backendId, bool threaded, float updateTime, chstr deviceName) :\n\t\tAudioManager(systemName, backendId, threaded, updateTime, deviceName), device(NULL), context(NULL)\n\t{\n\t\t__openal__JNI_OnLoad(backendId);\n\t\txal::log(\"initializing OpenAL\");\n\t\tALCdevice* currentDevice = alcOpenDevice(deviceName.c_str());\n\t\tif (alcGetError(currentDevice) != ALC_NO_ERROR)\n\t\t{\n\t\t\txal::log(\"could not create device\");\n\t\t\treturn;\n\t\t}\n\t\tthis->deviceName = alcGetString(currentDevice, ALC_DEVICE_SPECIFIER);\n\t\txal::log(\"audio device: \" + this->deviceName);\n\t\tALCcontext* currentContext = alcCreateContext(currentDevice, NULL);\n\t\tif (alcGetError(currentDevice) != ALC_NO_ERROR)\n\t\t{\n\t\t\txal::log(\"could not create context\");\n\t\t\treturn;\n\t\t}\n\t\talcMakeContextCurrent(currentContext);\n\t\tif (alcGetError(currentDevice) != ALC_NO_ERROR)\n\t\t{\n\t\t\txal::log(\"could not set context as current\");\n\t\t\treturn;\n\t\t}\n\t\tthis->device = currentDevice;\n\t\tthis->context = currentContext;\n\t\tthis->enabled = true;\n\t}\n\n\tAndroid_AudioManager::~Android_AudioManager()\n\t{\n\t\txal::log(\"destroying OpenAL\");\n\t\tif (this->device != NULL)\n\t\t{\n\t\t\talcMakeContextCurrent(NULL);\n\t\t\talcDestroyContext(this->context);\n\t\t\talcCloseDevice(this->device);\n\t\t}\n\t}\n\t\n\tPlayer* Android_AudioManager::_createSystemPlayer(Sound* sound, Buffer* buffer)\n\t{\n\t\treturn new Android_Player(sound, buffer);\n\t}\n\t\n\tunsigned int Android_AudioManager::_allocateSourceId()\n\t{\n\t\tunsigned int id = 0;\n\t\talGenSources(1, &id);\n\t\tif (alGetError() != AL_NO_ERROR)\n\t\t{\n\t\t\txal::log(\"unable to allocate audio source!\");\n\t\t\treturn 0;\n\t\t}\n\t\treturn id;\n\t}\n\n\tvoid Android_AudioManager::_releaseSourceId(unsigned int sourceId)\n\t{\n\t\talDeleteSources(1, &sourceId);\n\t}\n\t\n}\n#endif\n<commit_msg>- small update<commit_after>\/\/\/ @file\n\/\/\/ @author  Boris Mikic\n\/\/\/ @version 2.4\n\/\/\/ \n\/\/\/ @section LICENSE\n\/\/\/ \n\/\/\/ This program is free software; you can redistribute it and\/or modify it under\n\/\/\/ the terms of the BSD license: http:\/\/www.opensource.org\/licenses\/bsd-license.php\n\/\/\/ \n\/\/\/ @section DESCRIPTION\n\/\/\/ \n\/\/\/ Represents an implementation of the AudioManager for Android.\n\n#ifdef HAVE_ANDROID\n#include <string.h>\n\n#include <hltypes\/exception.h>\n#include <hltypes\/hdir.h>\n#include <hltypes\/hltypesUtil.h>\n#include <hltypes\/hmap.h>\n#include <hltypes\/hstring.h>\n\n#include <AL\/al.h>\n#include <AL\/alc.h>\n\n#include \"Buffer.h\"\n#include \"Category.h\"\n#include \"Android_AudioManager.h\"\n#include \"Android_Player.h\"\n#include \"xal.h\"\n\nextern \"C\" int __openal__JNI_OnLoad(void* vm);\n\nnamespace xal\n{\n\tAndroid_AudioManager::Android_AudioManager(chstr systemName, void* backendId, bool threaded, float updateTime, chstr deviceName) :\n\t\tAudioManager(systemName, backendId, threaded, updateTime, deviceName), device(NULL), context(NULL)\n\t{\n\t\t__openal__JNI_OnLoad(backendId);\n\t\txal::log(\"initializing Android Audio\");\n\t\tALCdevice* currentDevice = alcOpenDevice(deviceName.c_str());\n\t\tif (alcGetError(currentDevice) != ALC_NO_ERROR)\n\t\t{\n\t\t\txal::log(\"could not create device\");\n\t\t\treturn;\n\t\t}\n\t\tthis->deviceName = alcGetString(currentDevice, ALC_DEVICE_SPECIFIER);\n\t\txal::log(\"audio device: \" + this->deviceName);\n\t\tALCcontext* currentContext = alcCreateContext(currentDevice, NULL);\n\t\tif (alcGetError(currentDevice) != ALC_NO_ERROR)\n\t\t{\n\t\t\txal::log(\"could not create context\");\n\t\t\treturn;\n\t\t}\n\t\talcMakeContextCurrent(currentContext);\n\t\tif (alcGetError(currentDevice) != ALC_NO_ERROR)\n\t\t{\n\t\t\txal::log(\"could not set context as current\");\n\t\t\treturn;\n\t\t}\n\t\tthis->device = currentDevice;\n\t\tthis->context = currentContext;\n\t\tthis->enabled = true;\n\t}\n\n\tAndroid_AudioManager::~Android_AudioManager()\n\t{\n\t\txal::log(\"destroying Android Audio\");\n\t\tif (this->device != NULL)\n\t\t{\n\t\t\talcMakeContextCurrent(NULL);\n\t\t\talcDestroyContext(this->context);\n\t\t\talcCloseDevice(this->device);\n\t\t}\n\t}\n\t\n\tPlayer* Android_AudioManager::_createSystemPlayer(Sound* sound, Buffer* buffer)\n\t{\n\t\treturn new Android_Player(sound, buffer);\n\t}\n\t\n\tunsigned int Android_AudioManager::_allocateSourceId()\n\t{\n\t\tunsigned int id = 0;\n\t\talGenSources(1, &id);\n\t\tif (alGetError() != AL_NO_ERROR)\n\t\t{\n\t\t\txal::log(\"unable to allocate audio source!\");\n\t\t\treturn 0;\n\t\t}\n\t\treturn id;\n\t}\n\n\tvoid Android_AudioManager::_releaseSourceId(unsigned int sourceId)\n\t{\n\t\talDeleteSources(1, &sourceId);\n\t}\n\t\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include <Arduino.h>\n#include \"Lights.h\"\n#include \"Adafruit_NeoPixel.h\"\n\ntypedef uint32_t color;\nAdafruit_NeoPixel *stripA;\nAdafruit_NeoPixel *stripB;\n\nLights::Lights( int pA, int pB, int countLights )\n{\n  \/\/ initialize variables\n  pinA = pA;\n  pinB = pB;\n  numLights = countLights;\n  numLights_perStrip = numLights * 2;\n\n  stripA = new Adafruit_NeoPixel(60, pinA, NEO_GRB + NEO_KHZ800);\n  stripB = new Adafruit_NeoPixel(60, pinB, NEO_GRB + NEO_KHZ800);\n  \n  stripA->begin();\n  stripB->begin();\n  \n  isOn = 0; \n\n  \/\/ run = 0;\n  \/\/ last_changed = millis();\n\n\n  \/\/ \/\/ initialize physical objects\n  \/\/ pinMode( pin, OUTPUT );\n\n  \/\/ \/\/ don't forget that we don't know the state of the pin\n  \/\/ \/\/ so give it one\n  \/\/ digitalWrite( pin, Lights_OFF );\n}\n\nvoid Lights::loop() {   \n}\n\n\nvoid Lights::setPixelColor(uint16_t n, uint32_t c) {\n  if ( n >= numLights_perStrip ) { \n    stripB->setPixelColor( n - numLights_perStrip, c);\n  } else {\n    stripA->setPixelColor( n, c);\n  }\n}\n\nvoid Lights::show() { \n  if ( isOn ) {\n    stripA->show();\n    stripB->show();\n  }\n}\n\nvoid Lights::test() {  \n}\n\nvoid Lights::on() { \n  isOn = 1;\n}\n\nvoid Lights::off()\n{\n  for ( int i = 0; i < numLights; i++ ) {\n    color c = stripA->Color(0,0,0);\n    setPixelColor(i, c);\n  }\n  isOn = 0;\n  show();\n}\n\nvoid Lights::shoot( int direction ) {  \n}\n\n\n<commit_msg>set # pixels correctly<commit_after>#include <Arduino.h>\n#include \"Lights.h\"\n#include \"Adafruit_NeoPixel.h\"\n\ntypedef uint32_t color;\nAdafruit_NeoPixel *stripA;\nAdafruit_NeoPixel *stripB;\n\n\nLights::Lights( int pA, int pB, int countLights )\n{\n  \/\/ initialize variables\n  pinA = pA;\n  pinB = pB;\n  numLights = countLights;\n  numLights_perStrip = numLights * 2;\n\n  stripA = new Adafruit_NeoPixel(numLights, pinA, NEO_GRB + NEO_KHZ800);\n  stripB = new Adafruit_NeoPixel(numLights, pinB, NEO_GRB + NEO_KHZ800);\n  \n  stripA->begin();\n  stripB->begin();\n  \n  isOn = 0; \n\n  \/\/ run = 0;\n  \/\/ last_changed = millis();\n\n\n  \/\/ \/\/ initialize physical objects\n  \/\/ pinMode( pin, OUTPUT );\n\n  \/\/ \/\/ don't forget that we don't know the state of the pin\n  \/\/ \/\/ so give it one\n  \/\/ digitalWrite( pin, Lights_OFF );\n}\n\nvoid Lights::loop() {   \n}\n\n\nvoid Lights::setPixelColor(uint16_t n, uint32_t c) {\n  if ( n >= numLights_perStrip ) { \n    stripB->setPixelColor( n - numLights_perStrip, c);\n  } else {\n    stripA->setPixelColor( n, c);\n  }\n}\n\nvoid Lights::show() { \n  if ( isOn ) {\n    stripA->show();\n    stripB->show();\n  }\n}\n\nvoid Lights::test() {  \n}\n\nvoid Lights::on() { \n  isOn = 1;\n}\n\nvoid Lights::off()\n{\n  for ( int i = 0; i < numLights; i++ ) {\n    color c = stripA->Color(0,0,0);\n    setPixelColor(i, c);\n  }\n  isOn = 0;\n  stripA->show();\n  stripB->show();\n}\n\nvoid Lights::shoot( int direction ) {  \n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <vector>\n\nusing namespace std;\n\ntemplate<class T>\ninline void swapMy(T &a, T &b)\n{\n    T temp;\n    temp = a;\n    a = b;\n    b = temp;\n}\n\nclass myPoly\n{\nprivate:\n    vector<int> powMy;\n    vector<double> coeMy;\n    string name;\npublic:\n    myPoly(string namein)\n    {\n        name = namein;\n        powMy.push_back(0);\n        coeMy.push_back(0);\n    }\n\n    myPoly &showAll();\n\n    myPoly &assign(int pow, double coe);\n\n    myPoly operator+(myPoly other);\n\n\n    myPoly setname(string namein)\n    {\n        name = namein;\n        return *this;\n    }\n\n    myPoly &operator*(myPoly other);\n};\n\n\nint main()\n{\n    myPoly m1(\"m1\"), m2(\"m2\");\n\n    m1.assign(1, 1.1).assign(3, 3.3).assign(5, 5.5).showAll();\n    m2.assign(2, 2.2).assign(4, 4.4).assign(6, 6.6).showAll();\n\n    cout << \"========\" << endl;\n\n\n    m1.showAll();\n    m2.showAll();\n    m2 = m2 + m1;\n    return 0;\n}\n\nmyPoly &myPoly::showAll()\n{\n    cout << name << \": \";\n\n    for (auto it = powMy.begin(); it != powMy.end(); ++it)\n    {\n        auto dev = it - powMy.begin();\n\n\n        if (*(it) != 0)\n        {\n            if ((coeMy[dev] > 0) && (dev != 0))\n            {\n                cout << \" +\";\n            }\n\n            if ((coeMy[dev] < 0) && (dev != 0))\n            {\n                cout << \" \";\n            }\n            cout << coeMy[dev] << \"x^\" << powMy[dev];\n        }\n        else\n        {\n            if ((powMy.size() == 1) && (coeMy[0] == 0))\n            {\n                cout << coeMy[0] << endl;\n                return *this;\n            }\n            cout << \" +\" << coeMy[dev];\n        }\n    }\n    cout << endl;\n    return *this;\n}\n\nmyPoly &myPoly::assign(int pow, double coe)\n{\n\n    if (pow < 0)\n    {\n        cout << \"\\nerror! negative power\\n\";\n        return *this;\n    }\n\n    int FLAG = 1;\/\/FlAG=1   no this coefficent\n    \/\/ append one\n\n\n\n    for (int i = 0; i < powMy.size(); ++i)\n    {\n        if (powMy[i] == pow)\n        {\n            FLAG = 0;\n\n            if (coe == 0)\n            {\n                powMy.erase(powMy.begin() + i);\n                coeMy.erase(coeMy.begin() + i);\n            }\n            else\n            {\n                coeMy[i] = coe;\n            }\n\n        }\n    }\n\n    if ((FLAG == 1) && (coe != 0))\n    {\n        powMy.push_back(pow);\n        coeMy.push_back(coe);\n\n        \/\/ sort\n        for (int i = 0; i < powMy.size(); ++i)\n        {\n            for (int j = 0; j < powMy.size() - i - 1; ++j)\n            {\n                if (powMy[j] < powMy[j + 1])\n                {\n                    swapMy(powMy[j], powMy[j + 1]);\n                    swapMy(coeMy[j], coeMy[j + 1]);\n                }\n            }\n        }\n        \/\/ end sort\n\n    }\n\n    return *this;\n\n}\n\nmyPoly myPoly::operator+(const myPoly other)\n{\n    for (int i = 0; i < other.powMy.size(); i++)\n    {\n        int has_assigned = 0;\n        int temppow = other.powMy[i];\n        double tempcoe = other.coeMy[i];\n\n        for (int j = 0; j < this->powMy.size(); ++j)\n        {\n            if (this->powMy[j] == temppow)\n            {\n\/\/                coeMy[j] += tempcoe;\n                tempcoe += coeMy[j];\n                assign(other.powMy[i], tempcoe);\n                has_assigned = 1;\n            }\n\n        }\n\n        if (has_assigned == 0)\n        {\n            assign(other.powMy[i], other.coeMy[i]);\n        }\n\n    }\n\n\n    return *this;\n\n}\n\nmyPoly &myPoly::operator*(myPoly other)\n{\n    return myPoly(__1::basic_string<char, char_traits<char>, allocator<char>>());\n}\n\n\n\n\n\n<commit_msg>Ploy has some problems<commit_after>#include <iostream>\n#include <vector>\n\nusing namespace std;\n\ntemplate<class T>\ninline void swapMy(T &a, T &b)\n{\n    T temp;\n    temp = a;\n    a = b;\n    b = temp;\n}\n\nclass myPoly\n{\nprivate:\n    vector<int> powMy;\n    vector<double> coeMy;\npublic:\n    myPoly()\n    {\n        powMy.push_back(0);\n        coeMy.push_back(0);\n    }\n\n    myPoly &showAll();\n\n    myPoly &assign(int pow, double coe);\n\n    myPoly operator+(myPoly other) const;\n\n    myPoly &add(int pow, double coe);\n\n    myPoly operator*(myPoly other)const ;\n};\n\n\nint main()\n{\n    myPoly m1, m2;\n\n    m1.assign(1, 1.1).assign(3, 3.3).assign(5, 5.5).showAll();\n    m2.assign(2, 2.2).assign(4, 4.4).assign(6, 6.6).showAll();\n\n    cout << \"========\" << endl;\n\n\n    m1.showAll();\n    m2.showAll();\n    m2 = m2 + m1;\n\n    m2.showAll();\n\n    cout << \"----------------\\n\";\n\n    myPoly mm1, mm2, mm3;\n\n    mm1.assign(1, 1).add(0, -1).showAll();\n    mm2.add(1, 1).add(0, -2).showAll();\n\n\/\/    mm3 = mm1 * mm2;\n    mm3 = mm1 + mm2;\n    mm3.showAll();\n\n    return 0;\n}\n\nmyPoly &myPoly::showAll()\n{\n\n    for (auto it = powMy.begin(); it != powMy.end(); ++it)\n    {\n        auto dev = it - powMy.begin();\n\n\n        if (*(it) != 0)\n        {\n            if ((coeMy[dev] > 0) && (dev != 0))\n            {\n                cout << \" +\";\n            }\n\n            if ((coeMy[dev] < 0) && (dev != 0))\n            {\n                cout << \" \";\n            }\n            cout << coeMy[dev] << \"x^\" << powMy[dev];\n        }\n        else\n        {\n            if ((powMy.size() == 1) && (coeMy[0] == 0))\n            {\n                cout << coeMy[0] << endl;\n                return *this;\n            }\n            if (coeMy[dev] >= 0) cout << \" +\";\n            else cout << \" \";\n            cout << coeMy[dev];\n        }\n    }\n    cout << endl;\n    return *this;\n}\n\nmyPoly &myPoly::assign(int pow, double coe)\n{\n\n    if (pow < 0)\n    {\n        cout << \"\\nerror! negative power\\n\";\n        return *this;\n    }\n\n    int FLAG = 1;\/\/FlAG=1   no this coefficent\n    \/\/ append one\n\n\n\n    for (int i = 0; i < powMy.size(); ++i)\n    {\n        if (powMy[i] == pow)\n        {\n            FLAG = 0;\n\n            if (coe == 0)\n            {\n                powMy.erase(powMy.begin() + i);\n                coeMy.erase(coeMy.begin() + i);\n            }\n            else\n            {\n                coeMy[i] = coe;\n            }\n\n        }\n    }\n\n    if ((FLAG == 1) && (coe != 0))\n    {\n        powMy.push_back(pow);\n        coeMy.push_back(coe);\n\n        \/\/ sort\n        for (int i = 0; i < powMy.size(); ++i)\n        {\n            for (int j = 0; j < powMy.size() - i - 1; ++j)\n            {\n                if (powMy[j] < powMy[j + 1])\n                {\n                    swapMy(powMy[j], powMy[j + 1]);\n                    swapMy(coeMy[j], coeMy[j + 1]);\n                }\n            }\n        }\n        \/\/ end sort\n\n    }\n\n    return *this;\n\n}\n\nmyPoly myPoly::operator+(const myPoly other) const\n{\n    myPoly tempmp;\n\n    for (int i = 0; i < other.powMy.size(); i++)\n    {\n        int has_assigned = 0;\n        int temppow = other.powMy[i];\n        double tempcoe = other.coeMy[i];\n\n        for (int j = 0; j < this->powMy.size(); ++j)\n        {\n            if (this->powMy[j] == temppow)\n            {\n                tempcoe += this->coeMy[j];\n                tempmp.assign(other.powMy[i], tempcoe);\n                has_assigned = 1;\n            }\n\n        }\n\n        if (has_assigned == 0)\n        {\n            tempmp.assign(other.powMy[i], other.coeMy[i]);\n        }\n\n    }\n\n\n    return tempmp;\n\n}\n\nmyPoly myPoly::operator*(myPoly other)const\n{\n    myPoly temp;\n    for (int i = 0; i < other.powMy.size(); i++)\n    {\n        for (int j = 0; j < this->powMy.size(); ++j)\n        {\n            int temppow = other.powMy[i] + this->powMy[j];\n            double tempcoe = other.coeMy[i] * this->coeMy[j];\n            temp.add(temppow, tempcoe);\n        }\n    }\n\n    return temp;\n}\n\nmyPoly &myPoly::add(int pow, double coe)\n{\n    myPoly temp;\n    temp.assign(pow, coe);\n    *this = *this + temp;\n    return *this;\n}\n\n\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2003-2015, GameDuell GmbH\n * All 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 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\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 <types\/NativeData.h>\n#include <string>\n\n#include <hx\/CFFI.h>\n\nclass NativeData_Impl : public NativeData\n{\n\tpublic:\n\t\tvoid setup(int lengthInBytes);\n\n\t\tvoid setupWithExistingPointer(uint8_t* existingPtr, int lengthInBytes);\n\t\tvoid cleanUp();\n\n\t\tvoid writeData(const NativeData *d);\n\t\tvoid writePointer(const void* pointer, int lengthInBytes);\n\n\t\tvoid resize(int newSize);\n\t\tvoid trim();\n\n\t\t~NativeData_Impl();\n\t\tNativeData_Impl();\n};\n\nvoid NativeData_Impl::setup(int lengthInBytes)\n{\n\tcleanUp();\n\tptr = (uint8_t *)calloc(lengthInBytes, 1);\n\tallocedLength = lengthInBytes;\n\n\toffset = 0;\n\toffsetLength = lengthInBytes;\n\texternalPtr = false;\n}\n\nvoid NativeData_Impl::setupWithExistingPointer(uint8_t* existingPtr, int lengthInBytes)\n{\n\tcleanUp();\n\tptr = existingPtr;\n\tallocedLength = lengthInBytes;\n\n\toffset = 0;\n\toffsetLength = lengthInBytes;\n\texternalPtr = true;\n}\n\nvoid NativeData_Impl::cleanUp()\n{\n\tif(allocedLength > 0 && !externalPtr)\n\t\tfree(ptr);\n\n\tptr = 0;\n\tallocedLength = 0;\n\toffset = 0;\n\toffsetLength = 0;\n\texternalPtr = false;\n}\n\nNativeData_Impl::NativeData_Impl()\n{\n\tptr = 0;\n\tallocedLength = 0;\n\toffset = 0;\n\toffsetLength = 0;\n\texternalPtr = false;\n}\n\nvoid NativeData_Impl::writeData(const NativeData *d)\n{\n\tmemcpy(ptr + offset, d->ptr + d->offset, d->offsetLength);\n}\n\nvoid NativeData_Impl::writePointer(const void* pointer, int lengthInBytes)\n{\n\tmemcpy(ptr + offset, pointer, lengthInBytes);\n}\n\nvoid NativeData_Impl::resize(int newSize)\n{\n\tif(externalPtr)\n\t{\n\t\tuint8_t* prevPtr = ptr;\n\t\tptr = (uint8_t*)calloc(newSize, 1);\n\t\tmemcpy(ptr, prevPtr, allocedLength);\n\t\texternalPtr = false;\n\t}\n\telse\n\t{\n\t\tptr = (uint8_t*)realloc(ptr, newSize);\n\t\tint extraSizeToZeroOut = newSize - allocedLength;\n\t\tif(extraSizeToZeroOut > 0)\n\t\t\tmemset(ptr + allocedLength, 0, extraSizeToZeroOut);\n\t}\n\n\tallocedLength = newSize;\n}\n\nvoid NativeData_Impl::trim()\n{\n\tuint8_t* prevPtr = ptr;\n\tptr = (uint8_t*)calloc(offsetLength, 1);\n\tmemcpy(ptr, prevPtr + offset, offsetLength);\n\n\tif (externalPtr)\n\t{\n\t\texternalPtr = false;\n\t}\n\telse\n\t{\n\t\tfree(prevPtr);\n\t}\n\n\tallocedLength = offsetLength;\n\toffset = 0;\n}\n\nNativeData_Impl::~NativeData_Impl()\n{\n\tcleanUp();\n}\n\nstatic void finalizer(value abstract_object)\n{\n     NativeData_Impl* data = (NativeData_Impl *)val_data(abstract_object);\n     data->cleanUp();\n     delete data;\n}\n\nDEFINE_KIND(k_NativeData)\n\nvoid* NativeData::createHaxePointer()\n{\n\tvalue v;\n\tv = alloc_abstract(k_NativeData, new NativeData_Impl());\n\tval_gc(v, (hxFinalizer) &finalizer);\n\treturn (void*)v;\n}\n<commit_msg>Fixed leak, if resize to 0<commit_after>\/*\n * Copyright (c) 2003-2015, GameDuell GmbH\n * All 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 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\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 <types\/NativeData.h>\n#include <string>\n\n#include <hx\/CFFI.h>\n\nclass NativeData_Impl : public NativeData\n{\n\tpublic:\n\t\tvoid setup(int lengthInBytes);\n\n\t\tvoid setupWithExistingPointer(uint8_t* existingPtr, int lengthInBytes);\n\t\tvoid cleanUp();\n\n\t\tvoid writeData(const NativeData *d);\n\t\tvoid writePointer(const void* pointer, int lengthInBytes);\n\n\t\tvoid resize(int newSize);\n\t\tvoid trim();\n\n\t\t~NativeData_Impl();\n\t\tNativeData_Impl();\n};\n\nvoid NativeData_Impl::setup(int lengthInBytes)\n{\n\tcleanUp();\n\tptr = (uint8_t *)calloc(lengthInBytes, 1);\n\tallocedLength = lengthInBytes;\n\n\toffset = 0;\n\toffsetLength = lengthInBytes;\n\texternalPtr = false;\n}\n\nvoid NativeData_Impl::setupWithExistingPointer(uint8_t* existingPtr, int lengthInBytes)\n{\n\tcleanUp();\n\tptr = existingPtr;\n\tallocedLength = lengthInBytes;\n\n\toffset = 0;\n\toffsetLength = lengthInBytes;\n\texternalPtr = true;\n}\n\nvoid NativeData_Impl::cleanUp()\n{\n\tif(allocedLength > 0 && !externalPtr)\n\t\tfree(ptr);\n\n\tptr = 0;\n\tallocedLength = 0;\n\toffset = 0;\n\toffsetLength = 0;\n\texternalPtr = false;\n}\n\nNativeData_Impl::NativeData_Impl()\n{\n\tptr = 0;\n\tallocedLength = 0;\n\toffset = 0;\n\toffsetLength = 0;\n\texternalPtr = false;\n}\n\nvoid NativeData_Impl::writeData(const NativeData *d)\n{\n\tmemcpy(ptr + offset, d->ptr + d->offset, d->offsetLength);\n}\n\nvoid NativeData_Impl::writePointer(const void* pointer, int lengthInBytes)\n{\n\tmemcpy(ptr + offset, pointer, lengthInBytes);\n}\n\nvoid NativeData_Impl::resize(int newSize)\n{\n\tif(externalPtr)\n\t{\n\t\tuint8_t* prevPtr = ptr;\n\t\tptr = (uint8_t*)calloc(newSize, 1);\n\t\tmemcpy(ptr, prevPtr, allocedLength);\n\t\texternalPtr = false;\n\t}\n\telse\n\t{\n\t    if (newSize == 0)\n\t    {\n\t        cleanUp();\n\t    }\n\t    else\n\t    {\n\t        ptr = (uint8_t*)realloc(ptr, newSize);\n            int extraSizeToZeroOut = newSize - allocedLength;\n            if(extraSizeToZeroOut > 0)\n            {\n                memset(ptr + allocedLength, 0, extraSizeToZeroOut);\n            }\n\t    }\n\t}\n\n\tallocedLength = newSize;\n}\n\nvoid NativeData_Impl::trim()\n{\n\tuint8_t* prevPtr = ptr;\n\tptr = (uint8_t*)calloc(offsetLength, 1);\n\tmemcpy(ptr, prevPtr + offset, offsetLength);\n\n\tif (externalPtr)\n\t{\n\t\texternalPtr = false;\n\t}\n\telse\n\t{\n\t\tfree(prevPtr);\n\t}\n\n\tallocedLength = offsetLength;\n\toffset = 0;\n}\n\nNativeData_Impl::~NativeData_Impl()\n{\n\tcleanUp();\n}\n\nstatic void finalizer(value abstract_object)\n{\n     NativeData_Impl* data = (NativeData_Impl *)val_data(abstract_object);\n     data->cleanUp();\n     delete data;\n}\n\nDEFINE_KIND(k_NativeData)\n\nvoid* NativeData::createHaxePointer()\n{\n\tvalue v;\n\tv = alloc_abstract(k_NativeData, new NativeData_Impl());\n\tval_gc(v, (hxFinalizer) &finalizer);\n\treturn (void*)v;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/chips\/common\/utils\/imageProcs\/common_ringId.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#ifndef _COMMON_RINGID_H_\n#define _COMMON_RINGID_H_\n\n#include <stdint.h>\n#include <stddef.h>\n\n\/\/\n\/\/ Various data typedefs for enums. Serves following purposes:\n\/\/ - Reduces space since enum defaults to an int type.\n\/\/ - Enables using these types without the scope operator for\n\/\/   those enums that are namespaced, e.g. RingID.\n\/\/ NB! DO NOT CHANGE THESE DEFS W\/O EXPLICIT CONSENT FROM\n\/\/     INFRASTRUCT TEAM. (These defs affect packing assumptions\n\/\/     of ring structures that go into the image ringSections.)\ntypedef uint16_t  RingId_t;         \/\/ Type for RingID enum\ntypedef uint8_t   ChipletType_t;    \/\/ Type for CHIPLET_TYPE enum\ntypedef uint8_t   PpeType_t;        \/\/ Type for PpeType\ntypedef uint8_t   ChipType_t;       \/\/ Type for ChipType enum\ntypedef uint8_t   RingType_t;       \/\/ Type for RingType enum\ntypedef uint8_t   RingVariant_t;    \/\/ Type for RingVariant enum\n\n#define  INVALID_RING_ID  (RingId_t)0xffff\n#define  INVALID_RING_TYPE  (RingType_t)0xff\n#define  INVALID_CHIP_TYPE  (ChipType_t)0xff\n#define  INVALID_CHIPLET_TYPE  (ChipletType_t)0xff\n\n\/\/\n\/\/ Chip types and List to represent p9n, p9c, cen (centaur)\n\/\/ NB! There's a matching CHIP_TYPE_LIST definition in common_ringId.C\n\/\/\nenum ChipType\n{\n    CT_P9N,  \/\/ ==P9 for now\n    CT_P9C,  \/\/ ==P9 for now\n    CT_CEN,\n    NUM_CHIP_TYPES\n};\n\ntypedef struct\n{\n    const char*  name;\n    ChipType_t   type;\n} ChipTypeList_t;\n\nstatic const ChipTypeList_t CHIP_TYPE_LIST[] =\n{\n    {\"p9n\", CT_P9N},\n    {\"p9c\", CT_P9C},\n    {\"cen\", CT_CEN},\n};\n\n\n\/\/\n\/\/ Ring related data structs and types\n\/\/\ntypedef enum RingClass\n{\n    EKB_RING,\n    EKB_FSM_RING,\n    EKB_STUMPED_RING,\n    EKB_CMSK_RING,\n    VPD_RING,\n    CEN_RING,\n    NUM_RING_CLASSES\n} RingClass_t;\n\n\/\/\n\/\/ General Ring ID list structure\n\/\/\ntypedef struct\n{\n    const char*  ringName;\n    RingId_t     ringId;\n    uint8_t      instanceIdMin;\n    uint8_t      instanceIdMax;\n    RingClass_t  ringClass;\n    uint32_t     scanScomAddress;\n} GenRingIdList;\n\nenum RingVariant\n{\n    BASE     = 0x00,\n    CC       = 0x01,\n    RL       = 0x02,\n    OVERRIDE = 0x03,   \/\/@FIXME We should remove this. Its own image now.\n    OVERLAY  = 0x04,   \/\/@FIXME Not supported.\n    NUM_RING_VARIANTS = 0x05,\n    NOT_VALID = 0xff\n};\n\ntypedef struct\n{\n    RingVariant_t  variant[3];\n} RingVariantOrder;\n\n\nenum RingType\n{\n    COMMON_RING = 0,\n    INSTANCE_RING = 1,\n    ALLRING = 2\n};\n\nstruct CHIPLET_DATA\n{\n    \/\/ This is the chiplet-ID of the first instance of the Chiplet\n    uint8_t iv_base_chiplet_number;\n\n    \/\/ The no.of common rings for the Chiplet\n    uint8_t iv_num_common_rings;\n\n    \/\/ The no.of instance rings for the Chiplet (w\/different ringId values)\n    uint8_t iv_num_instance_rings;\n\n    \/\/ The no.of instance rings for the Chiplet (w\/different ringId values\n    \/\/ AND different scanAddress values)\n    uint8_t iv_num_instance_rings_scan_addrs;\n};\n\n\/\/ This is used to Set (Mark) the left-most bit\n#define  INSTANCE_RING_MARK  (uint8_t)0x80\n\/\/\n\/\/ This is used to Set (Mark) the left-most bit\n#define  INSTANCE_RING_MASK  (uint8_t)0x7F\n\n\/\/ This is used to mark an invalid ring in the ring properties list\n#define INVALID_RING_OFFSET  (uint8_t)0xFF\n\n\/\/ This structure is needed for mapping a RingID to it's corresponding name.\n\/\/ The names will be used by the build scripts when generating the TOR.\n#ifndef __PPE__\nstruct ringProperties_t\n{\n    uint8_t       iv_torOffSet;\n    char          iv_name[50];\n    ChipletType_t iv_type;\n};\n#else\nstruct ringProperties_t\n{\n    uint8_t       iv_torOffSet;\n    ChipletType_t iv_type;\n};\n#endif\n\n#endif  \/\/ _COMMON_RINGID_H_\n<commit_msg>Centaur ring support - TOR API<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/chips\/common\/utils\/imageProcs\/common_ringId.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#ifndef _COMMON_RINGID_H_\n#define _COMMON_RINGID_H_\n\n#include <stdint.h>\n#include <stddef.h>\n\n\/\/\n\/\/ Various data typedefs for enums. Serves following purposes:\n\/\/ - Reduces space since enum defaults to an int type.\n\/\/ - Enables using these types without the scope operator for\n\/\/   those enums that are namespaced, e.g. RingID.\n\/\/ NB! DO NOT CHANGE THESE DEFS W\/O EXPLICIT CONSENT FROM\n\/\/     INFRASTRUCT TEAM. (These defs affect packing assumptions\n\/\/     of ring structures that go into the image ringSections.)\ntypedef uint16_t  RingId_t;         \/\/ Type for RingID enum\ntypedef uint8_t   ChipletType_t;    \/\/ Type for CHIPLET_TYPE enum\ntypedef uint8_t   PpeType_t;        \/\/ Type for PpeType\ntypedef uint8_t   ChipType_t;       \/\/ Type for ChipType enum\ntypedef uint8_t   RingType_t;       \/\/ Type for RingType enum\ntypedef uint8_t   RingVariant_t;    \/\/ Type for RingVariant enum\n\n#define  INVALID_RING_ID  (RingId_t)0xffff\n#define  INVALID_RING_TYPE  (RingType_t)0xff\n#define  INVALID_CHIP_TYPE  (ChipType_t)0xff\n#define  INVALID_CHIPLET_TYPE  (ChipletType_t)0xff\n\n\/\/\n\/\/ Chip types and List to represent p9n, p9c, cen (centaur)\n\/\/ NB! There's a matching CHIP_TYPE_LIST definition in common_ringId.C\n\/\/\nenum ChipType\n{\n    CT_P9N,  \/\/ ==P9 for now\n    CT_P9C,  \/\/ ==P9 for now\n    CT_CEN,\n    NUM_CHIP_TYPES\n};\n\ntypedef struct\n{\n    const char*  name;\n    ChipType_t   type;\n} ChipTypeList_t;\n\nstatic const ChipTypeList_t CHIP_TYPE_LIST[] =\n{\n    {\"p9n\", CT_P9N},\n    {\"p9c\", CT_P9C},\n    {\"cen\", CT_CEN},\n};\n\n\n\/\/\n\/\/ Ring related data structs and types\n\/\/\ntypedef enum RingClass\n{\n    EKB_RING,\n    EKB_FSM_RING,\n    EKB_STUMPED_RING,\n    EKB_CMSK_RING,\n    VPD_RING,\n    CEN_RING,\n    NUM_RING_CLASSES\n} RingClass_t;\n\n\/\/\n\/\/ General Ring ID list structure\n\/\/\ntypedef struct\n{\n    const char*  ringName;\n    RingId_t     ringId;\n    uint8_t      instanceIdMin;\n    uint8_t      instanceIdMax;\n    RingClass_t  ringClass;\n    uint32_t     scanScomAddress;\n} GenRingIdList;\n\nenum RingVariant\n{\n    BASE     = 0x00,\n    CC       = 0x01,\n    RL       = 0x02,\n    OVERRIDE = 0x03,   \/\/@FIXME We should remove this. Its own image now.\n    OVERLAY  = 0x04,   \/\/@FIXME Not supported.\n    NUM_RING_VARIANTS = 0x05,\n    NOT_VALID = 0xff\n};\n\ntypedef struct\n{\n    RingVariant_t  variant[3];\n} RingVariantOrder;\n\n\nenum RingType\n{\n    COMMON_RING = 0,\n    INSTANCE_RING = 1,\n    ALLRING = 2\n};\n\ntypedef struct\n{\n    \/\/ This is the chiplet-ID of the first instance of the Chiplet\n    uint8_t iv_base_chiplet_number;\n\n    \/\/ The no.of common rings for the Chiplet\n    uint8_t iv_num_common_rings;\n\n    \/\/ The no.of instance rings for the Chiplet (w\/different ringId values)\n    uint8_t iv_num_instance_rings;\n\n    \/\/ The no.of instance rings for the Chiplet (w\/different ringId values\n    \/\/ AND different scanAddress values)\n    uint8_t iv_num_instance_rings_scan_addrs;\n\n    \/\/ The no.of ring variants\n    uint8_t iv_num_ring_variants;\n} ChipletData_t;\n\n\/\/ This is used to Set (Mark) the left-most bit\n#define  INSTANCE_RING_MARK  (uint8_t)0x80\n\/\/\n\/\/ This is used to Set (Mark) the left-most bit\n#define  INSTANCE_RING_MASK  (uint8_t)0x7F\n\n\/\/ This is used to mark an invalid ring in the ring properties list\n#define INVALID_RING_OFFSET  (uint8_t)0xFF\n\n\/\/ This structure is needed for mapping a RingID to it's corresponding name.\n\/\/ The names will be used by the build scripts when generating the TOR.\n#ifndef __PPE__\nstruct RingProperties_t\n{\n    uint8_t       iv_torOffSet;\n    char          iv_name[50];\n    ChipletType_t iv_type;\n};\n#else\nstruct RingProperties_t\n{\n    uint8_t       iv_torOffSet;\n    ChipletType_t iv_type;\n};\n#endif\n\n#endif  \/\/ _COMMON_RINGID_H_\n<|endoftext|>"}
{"text":"<commit_before>\/**************************************************************************\n * Copyright(c) 1998-2014, ALICE Experiment at CERN, All rights reserved. *\n *                                                                        *\n * Author: The ALICE Off-line Project.                                    *\n * Contributors are mentioned in the code where appropriate.              *\n *                                                                        *\n * Permission to use, copy, modify and distribute this software and its   *\n * documentation strictly for non-commercial purposes is hereby granted   *\n * without fee, provided that the above copyright notice appears in all   *\n * copies and that both the copyright notice and this permission notice   *\n * appear in the supporting documentation. The authors make no claims     *\n * about the suitability of this software for any purpose. It is          *\n * provided \"as is\" without express or implied warranty.                  *\n **************************************************************************\/\n\/*\n * Track analysis component: Loops over tracks from the EMCal track container and\n * counts the tracks in histograms\n *\n *   Author: Markus Fasel\n *\/\n#include <map>\n#include <string>\n#include <vector>\n\n#include <TAxis.h>\n#include <TClonesArray.h>\n#include <TMath.h>\n#include <TString.h>\n\n#include \"AliLog.h\"\n#include \"AliMCEvent.h\"\n#include \"AliPicoTrack.h\"\n#include \"AliVCluster.h\"\n#include \"AliVEvent.h\"\n#include \"AliVParticle.h\"\n#include \"AliVTrack.h\"\n\n#include \"AliEMCalTriggerAnaTriggerDecision.h\"\n#include \"AliEMCalTriggerBinningComponent.h\"\n#include \"AliEMCalTriggerEventData.h\"\n#include \"AliEMCalTriggerKineCuts.h\"\n#include \"AliEMCalPtTaskVTrackSelection.h\"\n#include \"AliEMCalTriggerRecTrackAnalysisComponent.h\"\n\nClassImp(EMCalTriggerPtAnalysis::AliEMCalTriggerRecTrackAnalysisComponent)\n\nnamespace EMCalTriggerPtAnalysis {\n\n\/\/______________________________________________________________________________\nAliEMCalTriggerRecTrackAnalysisComponent::AliEMCalTriggerRecTrackAnalysisComponent() :\n  AliEMCalTriggerTracksAnalysisComponent(),\n  fTrackSelection(NULL),\n  fSwapEta(kFALSE),\n  fUsePatches(kFALSE),\n  fRequestMCtrue(kFALSE)\n{\n  \/*\n   * Dummy (I\/O) constructor\n   *\/\n}\n\n\/\/______________________________________________________________________________\nAliEMCalTriggerRecTrackAnalysisComponent::AliEMCalTriggerRecTrackAnalysisComponent(const char *name) :\n  AliEMCalTriggerTracksAnalysisComponent(name),\n  fTrackSelection(NULL),\n  fSwapEta(kFALSE),\n  fUsePatches(kFALSE),\n  fRequestMCtrue(kFALSE)\n{\n  \/*\n   * Main constructor\n   *\/\n}\n\n\/\/______________________________________________________________________________\nAliEMCalTriggerRecTrackAnalysisComponent::~AliEMCalTriggerRecTrackAnalysisComponent() {\n  \/*\n   * Destructor, taking care of the track selection\n   *\/\n  if(fTrackSelection) delete fTrackSelection;\n}\n\n\/\/______________________________________________________________________________\nvoid AliEMCalTriggerRecTrackAnalysisComponent::CreateHistos() {\n  \/*\n   * Create histograms of the track analysis component. For each trigger class we have\n   * - tracks with esd information\n   * - tracks with MC information\n   * - tracks with clusters and esd information\n   * - tracks with clusters and MC information\n   *\/\n  AliEMCalTriggerTracksAnalysisComponent::CreateHistos();\n\n  \/\/ Create trigger definitions\n  std::map<std::string, std::string> triggerCombinations;\n  const char *triggernames[11] = {\"MinBias\", \"EMCJHigh\", \"EMCJLow\", \"EMCGHigh\",\n      \"EMCGLow\", \"EMCHighBoth\", \"EMCHighGammaOnly\", \"EMCHighJetOnly\",\n      \"EMCLowBoth\", \"EMCLowGammaOnly\", \"EMCLowJetOnly\"};\n  \/\/ Define names and titles for different triggers in the histogram container\n  triggerCombinations.insert(std::pair<std::string,std::string>(triggernames[0], \"min. bias events\"));\n  triggerCombinations.insert(std::pair<std::string,std::string>(triggernames[1], \"jet-triggered events (high threshold)\"));\n  triggerCombinations.insert(std::pair<std::string,std::string>(triggernames[2], \"jet-triggered events (low threshold)\"));\n  triggerCombinations.insert(std::pair<std::string,std::string>(triggernames[3], \"gamma-triggered events (high threshold)\"));\n  triggerCombinations.insert(std::pair<std::string,std::string>(triggernames[4], \"gamma-triggered events (low threshold)\"));\n  triggerCombinations.insert(std::pair<std::string,std::string>(triggernames[5], \"jet and gamma triggered events (high threshold)\"));\n  triggerCombinations.insert(std::pair<std::string,std::string>(triggernames[6], \"exclusively gamma-triggered events (high threshold)\"));\n  triggerCombinations.insert(std::pair<std::string,std::string>(triggernames[7], \"exclusively jet-triggered events (high threshold)\"));\n  triggerCombinations.insert(std::pair<std::string,std::string>(triggernames[8], \"jet and gamma triggered events (low threshold)\"));\n  triggerCombinations.insert(std::pair<std::string,std::string>(triggernames[9], \"exclusively gamma-triggered events (low threshold)\"));\n  triggerCombinations.insert(std::pair<std::string,std::string>(triggernames[10], \"exclusively-triggered events (low threshold)\"));\n\n  \/\/ Create axis definitions\n  const AliEMCalTriggerBinningDimension *ptbinning = fBinning->GetBinning(\"pt\"),\n      *etabinning = fBinning->GetBinning(\"eta\"),\n      *phibinning = fBinning->GetBinning(\"phi\"),\n      *vertexbinning = fBinning->GetBinning(\"zvertex\");\n\n  const TAxis *trackaxes[5] = {\n      DefineAxis(\"pt\", ptbinning),\n      DefineAxis(\"eta\", etabinning),\n      DefineAxis(\"phi\", phibinning),\n      DefineAxis(\"zvertex\", vertexbinning),\n      DefineAxis(\"mbtrigger\", 2, -0.5, 1.5)\n  };\n\n  \/\/ Build histograms\n  for(std::map<std::string,std::string>::iterator it = triggerCombinations.begin(); it != triggerCombinations.end(); ++it){\n    const std::string name = it->first, &title = it->second;\n    fHistos->CreateTHnSparse(Form(\"hTrackHist%s\", name.c_str()), Form(\"Track-based data for %s events\", title.c_str()), 5, trackaxes, \"s\");\n    fHistos->CreateTHnSparse(Form(\"hTrackInAcceptanceHist%s\", name.c_str()), Form(\"Track-based data for %s events  for tracks matched to EMCal clusters\", title.c_str()), 5, trackaxes, \"s\");\n    fHistos->CreateTHnSparse(Form(\"hMCTrackHist%s\", name.c_str()), Form(\"Track-based data for %s events with MC kinematics\", title.c_str()), 5, trackaxes, \"s\");\n    fHistos->CreateTHnSparse(Form(\"hMCTrackInAcceptanceHist%s\", name.c_str()), Form(\"Track-based data for %s events with MC kinematics for tracks matched to EMCal clusters\", title.c_str()), 5, trackaxes, \"s\");\n  }\n\n  for(int iaxis = 0; iaxis < 5; iaxis++) delete trackaxes[iaxis];\n}\n\n\/\/______________________________________________________________________________\nvoid AliEMCalTriggerRecTrackAnalysisComponent::Process(const AliEMCalTriggerEventData* const data) {\n  \/*\n   * Run track loop on list of matching tracks\n   *\n   * @param data: the event data\n   *\/\n  AliDebug(1, Form(\"Number of matched tracks: %d\", data->GetMatchedTrackContainer()->GetEntries()));\n\n  std::vector<std::string> triggernames;\n  this->GetMachingTriggerNames(triggernames, fUsePatches);\n\n  AliVTrack *track(NULL);\n  AliVParticle *assocMC(NULL);\n  TIter trackIter(data->GetMatchedTrackContainer());\n  while((track = dynamic_cast<AliVTrack *>(trackIter()))){\n    \/\/ Apply track selection\n    assocMC = NULL;\n    if(fKineCuts && !fKineCuts->IsSelected(track)) continue;\n    if(fTrackSelection && !fTrackSelection->IsTrackAccepted(track)) continue;\n\n    if(fRequestMCtrue && data->GetMCEvent() && !(assocMC = IsMCTrueTrack(track, data->GetMCEvent()))) continue;\n    \/\/ Try to match the cluster\n    Bool_t hasCluster = kFALSE;\n    AliVCluster *clust(NULL);\n    AliVTrack *testtrack = track;\n    AliPicoTrack *pictrack = dynamic_cast<AliPicoTrack *>(track);\n    if(pictrack) testtrack = pictrack->GetTrack();\n    if(testtrack->GetEMCALcluster() >= 0 && (clust = dynamic_cast<AliVCluster *>(data->GetClusterContainer()->At(testtrack->GetEMCALcluster()))))\n      hasCluster = kTRUE;\n\n    \/\/ Fill histograms\n    for(std::vector<std::string>::iterator name = triggernames.begin(); name != triggernames.end(); name++){\n      FillHistogram(Form(\"hTrackHist%s\", name->c_str()), track, NULL, data->GetRecEvent(), kFALSE);\n      if(hasCluster) FillHistogram(Form(\"hTrackInAcceptanceHist%s\", name->c_str()), track, NULL, data->GetRecEvent(), kFALSE);\n      if(assocMC){\n        FillHistogram(Form(\"hMCTrackHist%s\", name->c_str()), track, NULL, data->GetRecEvent(), kTRUE);\n        if(hasCluster) FillHistogram(Form(\"hMCTrackInAcceptanceHist%s\", name->c_str()), track, NULL, data->GetRecEvent(), kTRUE);\n      }\n    }\n  }\n}\n\n\/\/______________________________________________________________________________\nAliVParticle * AliEMCalTriggerRecTrackAnalysisComponent::IsMCTrueTrack(\n    const AliVTrack* const trk, const AliMCEvent* evnt) const {\n  \/*\n   * Check according to the associated MC information whether the track is a MC true track,\n   * and whether it is physical primary\n   *\n   * @param trk: track to check\n   * @param evnt: MC event information necessary for the check\n   *\n   * @return: the associated MC particle (NULL if not MC true)\n   *\/\n  int label = TMath::Abs(trk->GetLabel());\n  AliVParticle *mcpart = evnt->GetTrack(label);\n  if(!mcpart) return NULL;\n  if(!evnt->IsPhysicalPrimary(label)) return NULL;\n  return mcpart;\n}\n\n\/\/______________________________________________________________________________\nvoid AliEMCalTriggerRecTrackAnalysisComponent::FillHistogram(\n    const TString& histname, const AliVTrack* const trk,\n    const AliVParticle* assocMC, const AliVEvent* const recev,\n    Bool_t useMCkine) {\n  \/*\n   *\n   *\/\n  if(useMCkine && !assocMC) return;\n  double data[5];\n  data[0] = useMCkine ? TMath::Abs(assocMC->Pt()) : TMath::Abs(trk->Pt());\n  data[1] = (fSwapEta ? -1. : 1.) * (useMCkine ? assocMC->Eta() : trk->Eta());\n  data[2] = useMCkine ? assocMC->Phi() : trk->Phi();\n  data[3] = recev->GetPrimaryVertex()->GetZ();\n  data[4] = fTriggerDecision->IsMinBias();\n  fHistos->FillTHnSparse(histname.Data(), data);\n}\n\n} \/* namespace EMCalTriggerPtAnalysis *\/\n<commit_msg>Fix histograms filled with MC-truth information<commit_after>\/**************************************************************************\n * Copyright(c) 1998-2014, ALICE Experiment at CERN, All rights reserved. *\n *                                                                        *\n * Author: The ALICE Off-line Project.                                    *\n * Contributors are mentioned in the code where appropriate.              *\n *                                                                        *\n * Permission to use, copy, modify and distribute this software and its   *\n * documentation strictly for non-commercial purposes is hereby granted   *\n * without fee, provided that the above copyright notice appears in all   *\n * copies and that both the copyright notice and this permission notice   *\n * appear in the supporting documentation. The authors make no claims     *\n * about the suitability of this software for any purpose. It is          *\n * provided \"as is\" without express or implied warranty.                  *\n **************************************************************************\/\n\/*\n * Track analysis component: Loops over tracks from the EMCal track container and\n * counts the tracks in histograms\n *\n *   Author: Markus Fasel\n *\/\n#include <map>\n#include <string>\n#include <vector>\n\n#include <TAxis.h>\n#include <TClonesArray.h>\n#include <TMath.h>\n#include <TString.h>\n\n#include \"AliLog.h\"\n#include \"AliMCEvent.h\"\n#include \"AliPicoTrack.h\"\n#include \"AliVCluster.h\"\n#include \"AliVEvent.h\"\n#include \"AliVParticle.h\"\n#include \"AliVTrack.h\"\n\n#include \"AliEMCalTriggerAnaTriggerDecision.h\"\n#include \"AliEMCalTriggerBinningComponent.h\"\n#include \"AliEMCalTriggerEventData.h\"\n#include \"AliEMCalTriggerKineCuts.h\"\n#include \"AliEMCalPtTaskVTrackSelection.h\"\n#include \"AliEMCalTriggerRecTrackAnalysisComponent.h\"\n\nClassImp(EMCalTriggerPtAnalysis::AliEMCalTriggerRecTrackAnalysisComponent)\n\nnamespace EMCalTriggerPtAnalysis {\n\n\/\/______________________________________________________________________________\nAliEMCalTriggerRecTrackAnalysisComponent::AliEMCalTriggerRecTrackAnalysisComponent() :\n  AliEMCalTriggerTracksAnalysisComponent(),\n  fTrackSelection(NULL),\n  fSwapEta(kFALSE),\n  fUsePatches(kFALSE),\n  fRequestMCtrue(kFALSE)\n{\n  \/*\n   * Dummy (I\/O) constructor\n   *\/\n}\n\n\/\/______________________________________________________________________________\nAliEMCalTriggerRecTrackAnalysisComponent::AliEMCalTriggerRecTrackAnalysisComponent(const char *name) :\n  AliEMCalTriggerTracksAnalysisComponent(name),\n  fTrackSelection(NULL),\n  fSwapEta(kFALSE),\n  fUsePatches(kFALSE),\n  fRequestMCtrue(kFALSE)\n{\n  \/*\n   * Main constructor\n   *\/\n}\n\n\/\/______________________________________________________________________________\nAliEMCalTriggerRecTrackAnalysisComponent::~AliEMCalTriggerRecTrackAnalysisComponent() {\n  \/*\n   * Destructor, taking care of the track selection\n   *\/\n  if(fTrackSelection) delete fTrackSelection;\n}\n\n\/\/______________________________________________________________________________\nvoid AliEMCalTriggerRecTrackAnalysisComponent::CreateHistos() {\n  \/*\n   * Create histograms of the track analysis component. For each trigger class we have\n   * - tracks with esd information\n   * - tracks with MC information\n   * - tracks with clusters and esd information\n   * - tracks with clusters and MC information\n   *\/\n  AliEMCalTriggerTracksAnalysisComponent::CreateHistos();\n\n  \/\/ Create trigger definitions\n  std::map<std::string, std::string> triggerCombinations;\n  const char *triggernames[11] = {\"MinBias\", \"EMCJHigh\", \"EMCJLow\", \"EMCGHigh\",\n      \"EMCGLow\", \"EMCHighBoth\", \"EMCHighGammaOnly\", \"EMCHighJetOnly\",\n      \"EMCLowBoth\", \"EMCLowGammaOnly\", \"EMCLowJetOnly\"};\n  \/\/ Define names and titles for different triggers in the histogram container\n  triggerCombinations.insert(std::pair<std::string,std::string>(triggernames[0], \"min. bias events\"));\n  triggerCombinations.insert(std::pair<std::string,std::string>(triggernames[1], \"jet-triggered events (high threshold)\"));\n  triggerCombinations.insert(std::pair<std::string,std::string>(triggernames[2], \"jet-triggered events (low threshold)\"));\n  triggerCombinations.insert(std::pair<std::string,std::string>(triggernames[3], \"gamma-triggered events (high threshold)\"));\n  triggerCombinations.insert(std::pair<std::string,std::string>(triggernames[4], \"gamma-triggered events (low threshold)\"));\n  triggerCombinations.insert(std::pair<std::string,std::string>(triggernames[5], \"jet and gamma triggered events (high threshold)\"));\n  triggerCombinations.insert(std::pair<std::string,std::string>(triggernames[6], \"exclusively gamma-triggered events (high threshold)\"));\n  triggerCombinations.insert(std::pair<std::string,std::string>(triggernames[7], \"exclusively jet-triggered events (high threshold)\"));\n  triggerCombinations.insert(std::pair<std::string,std::string>(triggernames[8], \"jet and gamma triggered events (low threshold)\"));\n  triggerCombinations.insert(std::pair<std::string,std::string>(triggernames[9], \"exclusively gamma-triggered events (low threshold)\"));\n  triggerCombinations.insert(std::pair<std::string,std::string>(triggernames[10], \"exclusively-triggered events (low threshold)\"));\n\n  \/\/ Create axis definitions\n  const AliEMCalTriggerBinningDimension *ptbinning = fBinning->GetBinning(\"pt\"),\n      *etabinning = fBinning->GetBinning(\"eta\"),\n      *phibinning = fBinning->GetBinning(\"phi\"),\n      *vertexbinning = fBinning->GetBinning(\"zvertex\");\n\n  const TAxis *trackaxes[5] = {\n      DefineAxis(\"pt\", ptbinning),\n      DefineAxis(\"eta\", etabinning),\n      DefineAxis(\"phi\", phibinning),\n      DefineAxis(\"zvertex\", vertexbinning),\n      DefineAxis(\"mbtrigger\", 2, -0.5, 1.5)\n  };\n\n  \/\/ Build histograms\n  for(std::map<std::string,std::string>::iterator it = triggerCombinations.begin(); it != triggerCombinations.end(); ++it){\n    const std::string name = it->first, &title = it->second;\n    fHistos->CreateTHnSparse(Form(\"hTrackHist%s\", name.c_str()), Form(\"Track-based data for %s events\", title.c_str()), 5, trackaxes, \"s\");\n    fHistos->CreateTHnSparse(Form(\"hTrackInAcceptanceHist%s\", name.c_str()), Form(\"Track-based data for %s events  for tracks matched to EMCal clusters\", title.c_str()), 5, trackaxes, \"s\");\n    fHistos->CreateTHnSparse(Form(\"hMCTrackHist%s\", name.c_str()), Form(\"Track-based data for %s events with MC kinematics\", title.c_str()), 5, trackaxes, \"s\");\n    fHistos->CreateTHnSparse(Form(\"hMCTrackInAcceptanceHist%s\", name.c_str()), Form(\"Track-based data for %s events with MC kinematics for tracks matched to EMCal clusters\", title.c_str()), 5, trackaxes, \"s\");\n  }\n\n  for(int iaxis = 0; iaxis < 5; iaxis++) delete trackaxes[iaxis];\n}\n\n\/\/______________________________________________________________________________\nvoid AliEMCalTriggerRecTrackAnalysisComponent::Process(const AliEMCalTriggerEventData* const data) {\n  \/*\n   * Run track loop on list of matching tracks\n   *\n   * @param data: the event data\n   *\/\n  AliDebug(1, Form(\"Number of matched tracks: %d\", data->GetMatchedTrackContainer()->GetEntries()));\n\n  std::vector<std::string> triggernames;\n  this->GetMachingTriggerNames(triggernames, fUsePatches);\n\n  AliVTrack *track(NULL);\n  AliVParticle *assocMC(NULL);\n  TIter trackIter(data->GetMatchedTrackContainer());\n  while((track = dynamic_cast<AliVTrack *>(trackIter()))){\n    \/\/ Apply track selection\n    assocMC = NULL;\n    if(fKineCuts && !fKineCuts->IsSelected(track)) continue;\n    if(fTrackSelection && !fTrackSelection->IsTrackAccepted(track)) continue;\n\n    if(fRequestMCtrue && data->GetMCEvent() && !(assocMC = IsMCTrueTrack(track, data->GetMCEvent()))) continue;\n    \/\/ Try to match the cluster\n    Bool_t hasCluster = kFALSE;\n    AliVCluster *clust(NULL);\n    AliVTrack *testtrack = track;\n    AliPicoTrack *pictrack = dynamic_cast<AliPicoTrack *>(track);\n    if(pictrack) testtrack = pictrack->GetTrack();\n    if(testtrack->GetEMCALcluster() >= 0 && (clust = dynamic_cast<AliVCluster *>(data->GetClusterContainer()->At(testtrack->GetEMCALcluster()))))\n      hasCluster = kTRUE;\n\n    \/\/ Fill histograms\n    for(std::vector<std::string>::iterator name = triggernames.begin(); name != triggernames.end(); name++){\n      FillHistogram(Form(\"hTrackHist%s\", name->c_str()), track, NULL, data->GetRecEvent(), kFALSE);\n      if(hasCluster) FillHistogram(Form(\"hTrackInAcceptanceHist%s\", name->c_str()), track, NULL, data->GetRecEvent(), kFALSE);\n      if(assocMC){\n        FillHistogram(Form(\"hMCTrackHist%s\", name->c_str()), track, assocMC, data->GetRecEvent(), kTRUE);\n        if(hasCluster) FillHistogram(Form(\"hMCTrackInAcceptanceHist%s\", name->c_str()), track, assocMC, data->GetRecEvent(), kTRUE);\n      }\n    }\n  }\n}\n\n\/\/______________________________________________________________________________\nAliVParticle * AliEMCalTriggerRecTrackAnalysisComponent::IsMCTrueTrack(\n    const AliVTrack* const trk, const AliMCEvent* evnt) const {\n  \/*\n   * Check according to the associated MC information whether the track is a MC true track,\n   * and whether it is physical primary\n   *\n   * @param trk: track to check\n   * @param evnt: MC event information necessary for the check\n   *\n   * @return: the associated MC particle (NULL if not MC true)\n   *\/\n  int label = TMath::Abs(trk->GetLabel());\n  AliVParticle *mcpart = evnt->GetTrack(label);\n  if(!mcpart) return NULL;\n  if(!evnt->IsPhysicalPrimary(label)) return NULL;\n  return mcpart;\n}\n\n\/\/______________________________________________________________________________\nvoid AliEMCalTriggerRecTrackAnalysisComponent::FillHistogram(\n    const TString& histname, const AliVTrack* const trk,\n    const AliVParticle* assocMC, const AliVEvent* const recev,\n    Bool_t useMCkine) {\n  \/*\n   *\n   *\/\n  if(useMCkine && !assocMC) return;\n  double data[5];\n  data[0] = useMCkine ? TMath::Abs(assocMC->Pt()) : TMath::Abs(trk->Pt());\n  data[1] = (fSwapEta ? -1. : 1.) * (useMCkine ? assocMC->Eta() : trk->Eta());\n  data[2] = useMCkine ? assocMC->Phi() : trk->Phi();\n  data[3] = recev->GetPrimaryVertex()->GetZ();\n  data[4] = fTriggerDecision->IsMinBias();\n  fHistos->FillTHnSparse(histname.Data(), data);\n}\n\n} \/* namespace EMCalTriggerPtAnalysis *\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"cmbNucExportDialog.h\"\n#include \"cmbNucAssembly.h\"\n#include \"ui_qExporterDialog.h\"\n#include \"ui_qProgress.h\"\n\n#include <QFileDialog>\n#include <QDebug>\n#include <QSettings>\n\n#include \"cmbNucMainWindow.h\"\n\ncmbNucExportDialog::cmbNucExportDialog(cmbNucMainWindow *mainWindow)\n: QDialog(mainWindow)\n{\n  this->ui = new Ui_qExporterDialog;\n  this->ui->setupUi(this);\n  this->Progress = new cmbProgressDialog(this);\n\n  Exporter = new cmbNucExport();\n  Exporter->moveToThread(&Thread);\n\n  connect( this->Exporter, SIGNAL(progress(int)),\n           this->Progress->ui->status, SLOT(setValue(int)));\n  connect( this->Exporter, SIGNAL(currentProcess(QString)),\n           this->Progress->ui->command, SLOT(setText(const QString &)));\n  connect( );\n  connect( this->ui->buttonBox, SIGNAL(accepted()),\n           this, SLOT(sendSignalToProcess() ));\n  connect( this, SIGNAL(process( const QString, const QStringList &,\n                                 const QString, const QString,\n                                 const QString)),\n           this->Exporter, SLOT(run( const QString, const QStringList &,\n                                     const QString, const QString,\n                                     const QString)));\n  Thread.start();\n}\n\ncmbNucExportDialog::~cmbNucExportDialog()\n{\n  delete this->ui;\n  delete this->Progress;\n  Thread.quit();\n  Thread.wait();\n}\n\nvoid cmbNucExportDialog::exportFile(cmbNucCore * core)\n{\n  this->hide();\n  if (core == NULL)\n  {\n    emit error(\"core was null\");\n    return;\n  }\n  Core = core;\n  QSettings settings(\"CMBNuclear\", \"CMBNuclear\");\n  QString assygenexe = settings.value(\"EXPORTER\/assygen_exe\").toString();\n  this->ui->assygenExecutable->setText(assygenexe);\n  QString coregenexe = settings.value(\"EXPORTER\/coregen_exe\").toString();\n  this->ui->coregenExecutable->setText(coregenexe);\n  QString cubitexe = settings.value(\"EXPORTER\/cubit_exe\").toString();\n  this->ui->cubitExecutable->setText(cubitexe);\n  CoregenFile = core->FileName.c_str();\n  this->ui->coregenInputFile->setText(CoregenFile);\n  this->AssygenFileList.clear();\n  for (size_t i = 0; i < core->numberOfAssemblies(); ++i)\n    {\n    this->AssygenFileList.append(QString(core->GetAssembly(i)->FileName.c_str()));\n    }\n  this->ui->assygenFileList->clear();\n  this->ui->assygenFileList->addItems(AssygenFileList);\n  this->show();\n}\n\nvoid cmbNucExportDialog::sendSignalToProcess()\n{\n  qDebug() << \"SENDING TO THREAD\";\n  \/\/void run( const QString &assygenExe,\n  \/\/          const QStringList & assygenFile,\n  \/\/          const QString &cubitExe,\n  \/\/          const QString &coregenExe,\n  \/\/          const QString &coregenFile);\n  QString assygenExe = ui->assygenExecutable->text();\n  if(assygenExe.isEmpty())\n  {\n    qDebug() << \"Failed assygen is empty\";\n    emit error(\"Failed assygen is empty\");\n    return;\n  }\n  QString cubitExe = ui->cubitExecutable->text();\n  if(cubitExe.isEmpty())\n  {\n    qDebug() << \"Failed cubit is empty\";\n    emit error(\"Failed cubit is empty\");\n    return;\n  }\n  QString coregenExe = ui->coregenExecutable->text();\n  if(coregenExe.isEmpty())\n  {\n    qDebug() << \"Failed coregen is empty\";\n    emit error(\"Failed coregen is empty\");\n    return;\n  }\n  if(this->AssygenFileList.empty())\n  {\n    qDebug() << \"Failed assygen File list is empty\";\n    emit error(\"Failed assygen File list is empty\");\n    return;\n  }\n  if(CoregenFile.isEmpty())\n  {\n    qDebug() << \"Failed coregen file is empty\";\n    emit error(\"Failed coregen file is empty\");\n    return;\n  }\n  \/\/SAVE FILES TO OUTPUT DIRECTORY\n  \/\/TODO!!!!!!!!!!\n  this->Progress->show();\n\n  emit process(assygenExe, this->AssygenFileList,\n               cubitExe, coregenExe, CoregenFile);\n}\n\nvoid cmbNucExportDialog::cancel()\n{\n  Exporter->cancel()\n  this->Progress->hide();\n\n}\n\nvoid cmbNucExportDialog::done()\n{\n\n}\n<commit_msg>fix comp error<commit_after>#include \"cmbNucExportDialog.h\"\n#include \"cmbNucAssembly.h\"\n#include \"ui_qExporterDialog.h\"\n#include \"ui_qProgress.h\"\n\n#include <QFileDialog>\n#include <QDebug>\n#include <QSettings>\n\n#include \"cmbNucMainWindow.h\"\n\ncmbNucExportDialog::cmbNucExportDialog(cmbNucMainWindow *mainWindow)\n: QDialog(mainWindow)\n{\n  this->ui = new Ui_qExporterDialog;\n  this->ui->setupUi(this);\n  this->Progress = new cmbProgressDialog(this);\n\n  Exporter = new cmbNucExport();\n  Exporter->moveToThread(&Thread);\n\n  connect( this->Exporter, SIGNAL(progress(int)),\n           this->Progress->ui->status, SLOT(setValue(int)));\n  connect( this->Exporter, SIGNAL(currentProcess(QString)),\n           this->Progress->ui->command, SLOT(setText(const QString &)));\n  \/\/connect( );\n  connect( this->ui->buttonBox, SIGNAL(accepted()),\n           this, SLOT(sendSignalToProcess() ));\n  connect( this, SIGNAL(process( const QString, const QStringList &,\n                                 const QString, const QString,\n                                 const QString)),\n           this->Exporter, SLOT(run( const QString, const QStringList &,\n                                     const QString, const QString,\n                                     const QString)));\n  Thread.start();\n}\n\ncmbNucExportDialog::~cmbNucExportDialog()\n{\n  delete this->ui;\n  delete this->Progress;\n  Thread.quit();\n  Thread.wait();\n}\n\nvoid cmbNucExportDialog::exportFile(cmbNucCore * core)\n{\n  this->hide();\n  if (core == NULL)\n  {\n    emit error(\"core was null\");\n    return;\n  }\n  Core = core;\n  QSettings settings(\"CMBNuclear\", \"CMBNuclear\");\n  QString assygenexe = settings.value(\"EXPORTER\/assygen_exe\").toString();\n  this->ui->assygenExecutable->setText(assygenexe);\n  QString coregenexe = settings.value(\"EXPORTER\/coregen_exe\").toString();\n  this->ui->coregenExecutable->setText(coregenexe);\n  QString cubitexe = settings.value(\"EXPORTER\/cubit_exe\").toString();\n  this->ui->cubitExecutable->setText(cubitexe);\n  CoregenFile = core->FileName.c_str();\n  this->ui->coregenInputFile->setText(CoregenFile);\n  this->AssygenFileList.clear();\n  for (size_t i = 0; i < core->numberOfAssemblies(); ++i)\n    {\n    this->AssygenFileList.append(QString(core->GetAssembly(i)->FileName.c_str()));\n    }\n  this->ui->assygenFileList->clear();\n  this->ui->assygenFileList->addItems(AssygenFileList);\n  this->show();\n}\n\nvoid cmbNucExportDialog::sendSignalToProcess()\n{\n  qDebug() << \"SENDING TO THREAD\";\n  \/\/void run( const QString &assygenExe,\n  \/\/          const QStringList & assygenFile,\n  \/\/          const QString &cubitExe,\n  \/\/          const QString &coregenExe,\n  \/\/          const QString &coregenFile);\n  QString assygenExe = ui->assygenExecutable->text();\n  if(assygenExe.isEmpty())\n  {\n    qDebug() << \"Failed assygen is empty\";\n    emit error(\"Failed assygen is empty\");\n    return;\n  }\n  QString cubitExe = ui->cubitExecutable->text();\n  if(cubitExe.isEmpty())\n  {\n    qDebug() << \"Failed cubit is empty\";\n    emit error(\"Failed cubit is empty\");\n    return;\n  }\n  QString coregenExe = ui->coregenExecutable->text();\n  if(coregenExe.isEmpty())\n  {\n    qDebug() << \"Failed coregen is empty\";\n    emit error(\"Failed coregen is empty\");\n    return;\n  }\n  if(this->AssygenFileList.empty())\n  {\n    qDebug() << \"Failed assygen File list is empty\";\n    emit error(\"Failed assygen File list is empty\");\n    return;\n  }\n  if(CoregenFile.isEmpty())\n  {\n    qDebug() << \"Failed coregen file is empty\";\n    emit error(\"Failed coregen file is empty\");\n    return;\n  }\n  \/\/SAVE FILES TO OUTPUT DIRECTORY\n  \/\/TODO!!!!!!!!!!\n  this->Progress->show();\n\n  emit process(assygenExe, this->AssygenFileList,\n               cubitExe, coregenExe, CoregenFile);\n}\n\nvoid cmbNucExportDialog::cancel()\n{\n  Exporter->cancel();\n  this->Progress->hide();\n\n}\n\nvoid cmbNucExportDialog::done()\n{\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef ANIMATIONS_HPP\n#define ANIMATIONS_HPP\n\n#include \"leds.hpp\"\n#include <xpcc\/ui\/animation.hpp>\n\n\/\/ apply some animations to the leds\nxpcc::ui::Pulse<uint8_t> pulse(red.animation);\nxpcc::ui::Indicator<uint8_t> indicator(blue.animation);\nxpcc::ui::Strobe<uint8_t> strobe(green.animation);\n\/\/ ----------------------------------------------------------------------------\n\n\/\/ Now for some custom animators\n\n\/\/ custom keyframes (time, value) for the orange led\nxpcc::ui::KeyFrame<uint8_t> frames[] =\n{\n\t\txpcc::ui::KeyFrame<uint8_t>(1000, 50),\n\t\txpcc::ui::KeyFrame<uint8_t>(900, 0),\n\t\txpcc::ui::KeyFrame<uint8_t>(800, 100),\n\t\txpcc::ui::KeyFrame<uint8_t>(700, 0),\n\t\txpcc::ui::KeyFrame<uint8_t>(600, 150),\n\t\txpcc::ui::KeyFrame<uint8_t>(500, 0),\n\t\txpcc::ui::KeyFrame<uint8_t>(400, 200),\n\t\txpcc::ui::KeyFrame<uint8_t>(300, 0),\n\t\txpcc::ui::KeyFrame<uint8_t>(200, 250),\n\t\txpcc::ui::KeyFrame<uint8_t>(100, 0),\n};\n\/\/ create a new keyframe animator for the orange led\nxpcc::ui::KeyFrameAnimation<uint8_t> animator(frames, 10, orange.animation);\n\n\/\/ animate the period of the red pulse (Aniception?)\nuint16_t period = 500;\nxpcc::ui::Animation<uint16_t> periodAnimator(period);\n\/\/ wrap it in a pulse\nxpcc::ui::Pulse<uint16_t> pulsePeriod(periodAnimator);\n\n#endif \/\/ ANIMATIONS_HPP\n<commit_msg>Example: STM32 Timer: Use array size macro.<commit_after>#ifndef ANIMATIONS_HPP\n#define ANIMATIONS_HPP\n\n#include \"leds.hpp\"\n#include <xpcc\/ui\/animation.hpp>\n\n\/\/ apply some animations to the leds\nxpcc::ui::Pulse<uint8_t> pulse(red.animation);\nxpcc::ui::Indicator<uint8_t> indicator(blue.animation);\nxpcc::ui::Strobe<uint8_t> strobe(green.animation);\n\/\/ ----------------------------------------------------------------------------\n\n\/\/ Now for some custom animators\n\n\/\/ custom keyframes (time, value) for the orange led\nxpcc::ui::KeyFrame<uint8_t> frames[] =\n{\n\txpcc::ui::KeyFrame<uint8_t>(1000, 50),\n\txpcc::ui::KeyFrame<uint8_t>(900, 0),\n\txpcc::ui::KeyFrame<uint8_t>(800, 100),\n\txpcc::ui::KeyFrame<uint8_t>(700, 0),\n\txpcc::ui::KeyFrame<uint8_t>(600, 150),\n\txpcc::ui::KeyFrame<uint8_t>(500, 0),\n\txpcc::ui::KeyFrame<uint8_t>(400, 200),\n\txpcc::ui::KeyFrame<uint8_t>(300, 0),\n\txpcc::ui::KeyFrame<uint8_t>(200, 250),\n\txpcc::ui::KeyFrame<uint8_t>(100, 0),\n};\n\/\/ create a new keyframe animator for the orange led\nxpcc::ui::KeyFrameAnimation<uint8_t> animator(frames, XPCC__ARRAY_SIZE(frames), orange.animation);\n\n\/\/ animate the period of the red pulse (Aniception?)\nuint16_t period = 500;\nxpcc::ui::Animation<uint16_t> periodAnimator(period);\n\/\/ wrap it in a pulse\nxpcc::ui::Pulse<uint16_t> pulsePeriod(periodAnimator);\n\n#endif \/\/ ANIMATIONS_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/ \\file RVirtualCanvasPainter.cxx\n\/\/\/ \\ingroup Gpad ROOT7\n\/\/\/ \\author Axel Naumann <axel@cern.ch>\n\/\/\/ \\date 2017-05-31\n\/\/\/ \\warning This is part of the ROOT 7 prototype! It will change without notice. It might trigger earthquakes. Feedback is welcome!\n\n\n\/*************************************************************************\n * Copyright (C) 1995-2017, 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\/RVirtualCanvasPainter.hxx>\n\n#include <ROOT\/TLogger.hxx>\n#include <TSystem.h> \/\/ TSystem::Load\n\n#include <exception>\n\nnamespace {\nstatic void LoadCanvasPainterLibrary() {\n  if (gSystem->Load(\"libROOTCanvasPainter\") != 0)\n    R__ERROR_HERE(\"Gpad\") << \"Loading of libROOTCanvasPainter failed!\";\n}\n} \/\/ unnamed namespace\n\n\n\/\/\/ The implementation is here to pin the vtable.\nROOT::Experimental::Internal::RVirtualCanvasPainter::~RVirtualCanvasPainter() = default;\n\nstd::unique_ptr<ROOT::Experimental::Internal::RVirtualCanvasPainter::Generator>\n   &ROOT::Experimental::Internal::RVirtualCanvasPainter::GetGenerator()\n{\n   \/\/\/ The generator for implementations.\n   static std::unique_ptr<Generator> generator;\n   return generator;\n}\n\nstd::unique_ptr<ROOT::Experimental::Internal::RVirtualCanvasPainter> ROOT::Experimental::Internal::\n   RVirtualCanvasPainter::Create(const RCanvas &canv)\n{\n   if (!GetGenerator()) {\n      LoadCanvasPainterLibrary();\n      if (!GetGenerator()) {\n         R__ERROR_HERE(\"Gpad\") << \"RVirtualCanvasPainter::Generator failed to register!\";\n         throw std::runtime_error(\"RVirtualCanvasPainter::Generator failed to initialize\");\n      }\n   }\n   return GetGenerator()->Create(canv);\n}\n\n\/\/\/ The implementation is here to pin the vtable.\nROOT::Experimental::Internal::RVirtualCanvasPainter::Generator::~Generator() = default;\n\n<commit_msg>[gpadv7] Only load pointer lib once.<commit_after>\/\/\/ \\file RVirtualCanvasPainter.cxx\n\/\/\/ \\ingroup Gpad ROOT7\n\/\/\/ \\author Axel Naumann <axel@cern.ch>\n\/\/\/ \\date 2017-05-31\n\/\/\/ \\warning This is part of the ROOT 7 prototype! It will change without notice. It might trigger earthquakes. Feedback is welcome!\n\n\n\/*************************************************************************\n * Copyright (C) 1995-2017, 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\/RVirtualCanvasPainter.hxx>\n\n#include <ROOT\/TLogger.hxx>\n#include <TSystem.h> \/\/ TSystem::Load\n\n#include <exception>\n\nnamespace {\nstatic int LoadCanvasPainterLibraryOnce() {\n  static int loadResult = gSystem->Load(\"libROOTCanvasPainter\");\n  if (loadResult != 0)\n     R__ERROR_HERE(\"Gpad\") << \"Loading of libROOTCanvasPainter failed!\";\n  return loadResult;\n}\nstatic void LoadCanvasPainterLibrary() {\n  static int loadResult = LoadCanvasPainterLibraryOnce();\n  (void) loadResult;\n}\n} \/\/ unnamed namespace\n\n\n\/\/\/ The implementation is here to pin the vtable.\nROOT::Experimental::Internal::RVirtualCanvasPainter::~RVirtualCanvasPainter() = default;\n\nstd::unique_ptr<ROOT::Experimental::Internal::RVirtualCanvasPainter::Generator>\n   &ROOT::Experimental::Internal::RVirtualCanvasPainter::GetGenerator()\n{\n   \/\/\/ The generator for implementations.\n   static std::unique_ptr<Generator> generator;\n   return generator;\n}\n\nstd::unique_ptr<ROOT::Experimental::Internal::RVirtualCanvasPainter> ROOT::Experimental::Internal::\n   RVirtualCanvasPainter::Create(const RCanvas &canv)\n{\n   if (!GetGenerator()) {\n      LoadCanvasPainterLibrary();\n      if (!GetGenerator()) {\n         R__ERROR_HERE(\"Gpad\") << \"RVirtualCanvasPainter::Generator failed to register!\";\n         throw std::runtime_error(\"RVirtualCanvasPainter::Generator failed to initialize\");\n      }\n   }\n   return GetGenerator()->Create(canv);\n}\n\n\/\/\/ The implementation is here to pin the vtable.\nROOT::Experimental::Internal::RVirtualCanvasPainter::Generator::~Generator() = default;\n\n<|endoftext|>"}
{"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/memory\/p9_mss_scrub.C $    *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2015,2019                        *\/\n\/* [+] International Business Machines Corp.                              *\/\n\/*                                                                        *\/\n\/*                                                                        *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\");        *\/\n\/* you may not use this file except in compliance with the License.       *\/\n\/* You may obtain a copy of the License at                                *\/\n\/*                                                                        *\/\n\/*     http:\/\/www.apache.org\/licenses\/LICENSE-2.0                         *\/\n\/*                                                                        *\/\n\/* Unless required by applicable law or agreed to in writing, software    *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS,      *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or        *\/\n\/* implied. See the License for the specific language governing           *\/\n\/* permissions and limitations under the License.                         *\/\n\/*                                                                        *\/\n\/* IBM_PROLOG_END_TAG                                                     *\/\n\n\/\/\/\n\/\/\/ @file p9_mss_scrub.C\n\/\/\/ @brief Begin background scrub\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: 1\n\/\/ *HWP Consumed by: FSP:HB\n\n#include <fapi2.H>\n#include \"p9_mss_scrub.H\"\n\nusing fapi2::TARGET_TYPE_MCBIST;\nusing fapi2::FAPI2_RC_SUCCESS;\n\n\/\/\/\n\/\/\/ @brief Begin background scrub\n\/\/\/ @param[in] i_target MCBIST\n\/\/\/ @return FAPI2_RC_SUCCESS iff ok\n\/\/\/\nfapi2::ReturnCode p9_mss_scrub( const fapi2::Target<TARGET_TYPE_MCBIST>& i_target )\n{\n    FAPI_INF(\"Start mss scrub\");\n    FAPI_INF(\"End mss scrub\");\n    return FAPI2_RC_SUCCESS;\n}\n<commit_msg>Change procedure include paths<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/memory\/p9_mss_scrub.C $    *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2015,2019                        *\/\n\/* [+] International Business Machines Corp.                              *\/\n\/*                                                                        *\/\n\/*                                                                        *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\");        *\/\n\/* you may not use this file except in compliance with the License.       *\/\n\/* You may obtain a copy of the License at                                *\/\n\/*                                                                        *\/\n\/*     http:\/\/www.apache.org\/licenses\/LICENSE-2.0                         *\/\n\/*                                                                        *\/\n\/* Unless required by applicable law or agreed to in writing, software    *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS,      *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or        *\/\n\/* implied. See the License for the specific language governing           *\/\n\/* permissions and limitations under the License.                         *\/\n\/*                                                                        *\/\n\/* IBM_PROLOG_END_TAG                                                     *\/\n\n\/\/\/\n\/\/\/ @file p9_mss_scrub.C\n\/\/\/ @brief Begin background scrub\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: 1\n\/\/ *HWP Consumed by: FSP:HB\n\n#include <fapi2.H>\n#include <p9_mss_scrub.H>\n\nusing fapi2::TARGET_TYPE_MCBIST;\nusing fapi2::FAPI2_RC_SUCCESS;\n\n\/\/\/\n\/\/\/ @brief Begin background scrub\n\/\/\/ @param[in] i_target MCBIST\n\/\/\/ @return FAPI2_RC_SUCCESS iff ok\n\/\/\/\nfapi2::ReturnCode p9_mss_scrub( const fapi2::Target<TARGET_TYPE_MCBIST>& i_target )\n{\n    FAPI_INF(\"Start mss scrub\");\n    FAPI_INF(\"End mss scrub\");\n    return FAPI2_RC_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: typeselectionpage.hxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: kz $ $Date: 2006-02-28 10:39: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 EXTENSIONS_ABP_TYPESELECTIONPAGE_HXX\n#define EXTENSIONS_ABP_TYPESELECTIONPAGE_HXX\n\n#ifndef EXTENSIONS_ABP_ABSPAGE_HXX\n#include \"abspage.hxx\"\n#endif\n#ifndef EXTENSIONS_ABP_ADDRESSSETTINGS_HXX\n#include \"addresssettings.hxx\"\n#endif\n#ifndef _SV_EDIT_HXX\n#include <vcl\/edit.hxx>\n#endif\n\n\/\/.........................................................................\nnamespace abp\n{\n\/\/.........................................................................\n\n    \/\/=====================================================================\n    \/\/= TypeSelectionPage\n    \/\/=====================================================================\n    class TypeSelectionPage : public AddressBookSourcePage\n    {\n    protected:\n        FixedText       m_aHint;\n        FixedLine       m_aTypeSep;\n        RadioButton     m_aMORK;\n        RadioButton     m_aThunderbird;\n        RadioButton     m_aEvolutionGroupwise;\n        RadioButton     m_aEvolutionLdap;\n        RadioButton     m_aEvolution;\n        RadioButton     m_aKab;\n        RadioButton     m_aLDAP;\n        RadioButton     m_aOutlook;\n        RadioButton     m_aOE;\n        RadioButton     m_aOther;\n\n        struct ButtonItem {\n            RadioButton *m_pItem;\n            AddressSourceType m_eType;\n            bool         m_bVisible;\n\n            ButtonItem( RadioButton *pItem,\n                        AddressSourceType eType,\n                        bool         bVisible ) :\n                    m_pItem( pItem ),\n                    m_eType( eType ),\n                    m_bVisible( bVisible )\n            {}\n        };\n\n        ::std::vector< ButtonItem > m_aAllTypes;\n\n    public:\n        TypeSelectionPage( OAddessBookSourcePilot* _pParent );\n\n        \/\/ retrieves the currently selected type\n        AddressSourceType   getSelectedType();\n\n    protected:\n        \/\/ OWizardPage overridables\n        virtual void        initializePage();\n        virtual sal_Bool    commitPage(COMMIT_REASON _eReason);\n\n        \/\/ TabDialog overridables\n        virtual void        ActivatePage();\n        virtual void        DeactivatePage();\n\n        \/\/ OImportPage overridables\n        virtual sal_Bool    determineNextButtonState();\n\n    private:\n        DECL_LINK( OnTypeSelected, void* );\n\n        void                selectType( AddressSourceType _eType );\n    };\n\n\/\/.........................................................................\n}   \/\/ namespace abp\n\/\/.........................................................................\n\n#endif \/\/ EXTENSIONS_ABP_TYPESELECTIONPAGE_HXX\n\n<commit_msg>INTEGRATION: CWS macaddressbook01 (1.9.272); FILE MERGED 2007\/07\/08 19:06:32 msicotte 1.9.272.1: #i77591# initial commit<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: typeselectionpage.hxx,v $\n *\n *  $Revision: 1.10 $\n *\n *  last change: $Author: ihi $ $Date: 2007-09-13 18:02:14 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n#ifndef EXTENSIONS_ABP_TYPESELECTIONPAGE_HXX\n#define EXTENSIONS_ABP_TYPESELECTIONPAGE_HXX\n\n#ifndef EXTENSIONS_ABP_ABSPAGE_HXX\n#include \"abspage.hxx\"\n#endif\n#ifndef EXTENSIONS_ABP_ADDRESSSETTINGS_HXX\n#include \"addresssettings.hxx\"\n#endif\n#ifndef _SV_EDIT_HXX\n#include <vcl\/edit.hxx>\n#endif\n\n\/\/.........................................................................\nnamespace abp\n{\n\/\/.........................................................................\n\n    \/\/=====================================================================\n    \/\/= TypeSelectionPage\n    \/\/=====================================================================\n    class TypeSelectionPage : public AddressBookSourcePage\n    {\n    protected:\n        FixedText       m_aHint;\n        FixedLine       m_aTypeSep;\n        RadioButton     m_aMORK;\n        RadioButton     m_aThunderbird;\n        RadioButton     m_aEvolutionGroupwise;\n        RadioButton     m_aEvolutionLdap;\n        RadioButton     m_aEvolution;\n        RadioButton     m_aKab;\n        RadioButton     m_aMacab;\n        RadioButton     m_aLDAP;\n        RadioButton     m_aOutlook;\n        RadioButton     m_aOE;\n        RadioButton     m_aOther;\n\n        struct ButtonItem {\n            RadioButton *m_pItem;\n            AddressSourceType m_eType;\n            bool         m_bVisible;\n\n            ButtonItem( RadioButton *pItem,\n                        AddressSourceType eType,\n                        bool         bVisible ) :\n                    m_pItem( pItem ),\n                    m_eType( eType ),\n                    m_bVisible( bVisible )\n            {}\n        };\n\n        ::std::vector< ButtonItem > m_aAllTypes;\n\n    public:\n        TypeSelectionPage( OAddessBookSourcePilot* _pParent );\n\n        \/\/ retrieves the currently selected type\n        AddressSourceType   getSelectedType();\n\n    protected:\n        \/\/ OWizardPage overridables\n        virtual void        initializePage();\n        virtual sal_Bool    commitPage(COMMIT_REASON _eReason);\n\n        \/\/ TabDialog overridables\n        virtual void        ActivatePage();\n        virtual void        DeactivatePage();\n\n        \/\/ OImportPage overridables\n        virtual sal_Bool    determineNextButtonState();\n\n    private:\n        DECL_LINK( OnTypeSelected, void* );\n\n        void                selectType( AddressSourceType _eType );\n    };\n\n\/\/.........................................................................\n}   \/\/ namespace abp\n\/\/.........................................................................\n\n#endif \/\/ EXTENSIONS_ABP_TYPESELECTIONPAGE_HXX\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef _BM1383GLV_CPP\r\n#define _BM1383GLV_CPP\r\n\r\n\/\/BM1383GLV register map\r\n#define BM1383GLV_REG_ID                              0x10\r\n#define BM1383GLV_REG_RESET_CONTROL                   0x11\r\n#define BM1383GLV_REG_POWER_DOWN                      0x12\r\n#define BM1383GLV_REG_RESET                           0x13\r\n#define BM1383GLV_REG_MODE_CONTROL                    0x14\r\n#define BM1383GLV_REG_INT_H_TH_MSB                    0x15\r\n#define BM1383GLV_REG_INT_H_TH_LSB                    0x16\r\n#define BM1383GLV_REG_INT_L_TH_MSB                    0x17\r\n#define BM1383GLV_REG_INT_L_TH_LSB                    0x18\r\n#define BM1383GLV_REG_INT_CONTROL                     0x19\r\n#define BM1383GLV_REG_PRESSURE_MSB                    0x1C\r\n#define BM1383GLV_REG_PRESSURE_MID                    0x1D\r\n#define BM1383GLV_REG_PRESSURE_LSB                    0x1F\r\n\r\n\/\/BM1383GLV default values\r\n#define BM1383GLV_DEVICE_ADDRESS                      0x5D\r\n#define BM1383GLV_ID                                  0x31\r\n\r\n\/\/BM1383GLV settings\r\n\/\/BM1383GLV_REG_RESET                                                 MSB   LSB   DESCRIPTION\r\n#define BM1383GLV_RSTB_RESET                          0b00000000  \/\/  0     0     measurement control block reset\r\n#define BM1383GLV_RSTB_ACTIVE                         0b00000001  \/\/  0     0     measurement control block active\r\n\/\/BM1383GLV_REG_POWER_DOWN\r\n#define BM1383GLV_POWER_DOWN                          0b00000000  \/\/  0     0     power down\r\n#define BM1383GLV_ACTIVE                              0b00000001  \/\/  0     0     active\r\n\/\/BM1383GLV_REG_MODE_CONTROL\r\n#define BM1383GLV_AVERAGE_1                           0b00000000  \/\/  7     5     number of pressure measurements to average: 1\r\n#define BM1383GLV_AVERAGE_2                           0b00100000  \/\/  7     5                                                 2\r\n#define BM1383GLV_AVERAGE_4                           0b01000000  \/\/  7     5                                                 4\r\n#define BM1383GLV_AVERAGE_8                           0b01100000  \/\/  7     5                                                 8\r\n#define BM1383GLV_AVERAGE_16                          0b10000000  \/\/  7     5                                                 16\r\n#define BM1383GLV_AVERAGE_32                          0b10100000  \/\/  7     5                                                 32\r\n#define BM1383GLV_AVERAGE_64                          0b11000000  \/\/  7     5                                                 64\r\n#define BM1383GLV_LESS_TEMP_OFF                       0b00000000  \/\/  3     3     temperature will be measured as often as pressure\r\n#define BM1383GLV_LESS_TEMP_ON                        0b00001000  \/\/  3     3     temperature will be measured 4 times less frequently than pressure\r\n#define BM1383GLV_STANDBY                             0b00000000  \/\/  2     0     measurement mode: standby\r\n#define BM1383GLV_ONE_SHOT                            0b00000001  \/\/  2     0                       one-shot\r\n#define BM1383GLV_CONTINUOUS_50_MS                    0b00000010  \/\/  2     0                       continuous over 50 ms\r\n#define BM1383GLV_CONTINUOUS_100_MS                   0b00000011  \/\/  2     0                       continuous over 100 ms\r\n#define BM1383GLV_CONTINUOUS_200_MS                   0b00000100  \/\/  2     0                       continuous over 200 ms\r\n\r\nclass BM1383GLV {\r\n  public:\r\n    BM1383GLV(uint8_t address = BM1383GLV_DEVICE_ADDRESS) {\r\n      _address = address;\r\n    }\r\n    \r\n    int init(uint8_t mode = BM1383GLV_CONTINUOUS_200_MS, uint8_t avg = BM1383GLV_AVERAGE_64, uint8_t tempAvg = BM1383GLV_LESS_TEMP_ON) {\r\n      if(_utils.getRegValue(_address, BM1383GLV_REG_ID) != BM1383GLV_ID) {\r\n        return(-1);\r\n      }\r\n      _utils.setRegValue(_address, BM1383GLV_REG_POWER_DOWN, BM1383GLV_ACTIVE, 0, 0);\r\n      _utils.setRegValue(_address, BM1383GLV_REG_RESET, BM1383GLV_RSTB_ACTIVE, 0, 0);\r\n      _utils.setRegValue(_address, BM1383GLV_REG_MODE_CONTROL, avg | tempAvg | mode);\r\n      return(0);\r\n    }\r\n    \r\n    float measure(void) {\r\n      uint32_t rawValue;\r\n      float value;\r\n      rawValue = (((uint32_t)_utils.getRegValue(_address, BM1383GLV_REG_PRESSURE_MSB) << 16) | ((uint32_t)_utils.getRegValue(_address, BM1383GLV_REG_PRESSURE_MID) << 8) | _utils.getRegValue(_address, BM1383GLV_REG_PRESSURE_LSB, 7, 2)) >> 2;\r\n      value = rawValue \/ 2048.0;\r\n      return(value);\r\n    }\r\n  private:\r\n    utilities _utils;\r\n    uint8_t _address;\r\n};\r\n\r\n#endif<commit_msg>init method fix<commit_after>#ifndef _BM1383GLV_CPP\r\n#define _BM1383GLV_CPP\r\n\r\n\/\/BM1383GLV register map\r\n#define BM1383GLV_REG_ID                              0x10\r\n#define BM1383GLV_REG_RESET_CONTROL                   0x11\r\n#define BM1383GLV_REG_POWER_DOWN                      0x12\r\n#define BM1383GLV_REG_RESET                           0x13\r\n#define BM1383GLV_REG_MODE_CONTROL                    0x14\r\n#define BM1383GLV_REG_INT_H_TH_MSB                    0x15\r\n#define BM1383GLV_REG_INT_H_TH_LSB                    0x16\r\n#define BM1383GLV_REG_INT_L_TH_MSB                    0x17\r\n#define BM1383GLV_REG_INT_L_TH_LSB                    0x18\r\n#define BM1383GLV_REG_INT_CONTROL                     0x19\r\n#define BM1383GLV_REG_PRESSURE_MSB                    0x1C\r\n#define BM1383GLV_REG_PRESSURE_MID                    0x1D\r\n#define BM1383GLV_REG_PRESSURE_LSB                    0x1F\r\n\r\n\/\/BM1383GLV default values\r\n#define BM1383GLV_DEVICE_ADDRESS                      0x5D\r\n#define BM1383GLV_ID                                  0x31\r\n\r\n\/\/BM1383GLV settings\r\n\/\/BM1383GLV_REG_RESET                                                 MSB   LSB   DESCRIPTION\r\n#define BM1383GLV_RSTB_RESET                          0b00000000  \/\/  0     0     measurement control block reset\r\n#define BM1383GLV_RSTB_ACTIVE                         0b00000001  \/\/  0     0     measurement control block active\r\n\/\/BM1383GLV_REG_POWER_DOWN\r\n#define BM1383GLV_POWER_DOWN                          0b00000000  \/\/  0     0     power down\r\n#define BM1383GLV_ACTIVE                              0b00000001  \/\/  0     0     active\r\n\/\/BM1383GLV_REG_MODE_CONTROL\r\n#define BM1383GLV_AVERAGE_1                           0b00000000  \/\/  7     5     number of pressure measurements to average: 1\r\n#define BM1383GLV_AVERAGE_2                           0b00100000  \/\/  7     5                                                 2\r\n#define BM1383GLV_AVERAGE_4                           0b01000000  \/\/  7     5                                                 4\r\n#define BM1383GLV_AVERAGE_8                           0b01100000  \/\/  7     5                                                 8\r\n#define BM1383GLV_AVERAGE_16                          0b10000000  \/\/  7     5                                                 16\r\n#define BM1383GLV_AVERAGE_32                          0b10100000  \/\/  7     5                                                 32\r\n#define BM1383GLV_AVERAGE_64                          0b11000000  \/\/  7     5                                                 64\r\n#define BM1383GLV_LESS_TEMP_OFF                       0b00000000  \/\/  3     3     temperature will be measured as often as pressure\r\n#define BM1383GLV_LESS_TEMP_ON                        0b00001000  \/\/  3     3     temperature will be measured 4 times less frequently than pressure\r\n#define BM1383GLV_STANDBY                             0b00000000  \/\/  2     0     measurement mode: standby\r\n#define BM1383GLV_ONE_SHOT                            0b00000001  \/\/  2     0                       one-shot\r\n#define BM1383GLV_CONTINUOUS_50_MS                    0b00000010  \/\/  2     0                       continuous over 50 ms\r\n#define BM1383GLV_CONTINUOUS_100_MS                   0b00000011  \/\/  2     0                       continuous over 100 ms\r\n#define BM1383GLV_CONTINUOUS_200_MS                   0b00000100  \/\/  2     0                       continuous over 200 ms\r\n\r\nclass BM1383GLV {\r\n  public:\r\n    BM1383GLV(uint8_t address = BM1383GLV_DEVICE_ADDRESS) {\r\n      _address = address;\r\n    }\r\n    \r\n    uint8_t init(uint8_t mode = BM1383GLV_CONTINUOUS_200_MS, uint8_t avg = BM1383GLV_AVERAGE_64, uint8_t tempAvg = BM1383GLV_LESS_TEMP_ON) {\r\n      if(_utils.getRegValue(_address, BM1383GLV_REG_ID) != BM1383GLV_ID) {\r\n        return(1);\r\n      }\r\n      _utils.setRegValue(_address, BM1383GLV_REG_POWER_DOWN, BM1383GLV_ACTIVE, 0, 0);\r\n      _utils.setRegValue(_address, BM1383GLV_REG_RESET, BM1383GLV_RSTB_ACTIVE, 0, 0);\r\n      _utils.setRegValue(_address, BM1383GLV_REG_MODE_CONTROL, avg | tempAvg | mode);\r\n      return(0);\r\n    }\r\n    \r\n    float measure(void) {\r\n      uint32_t rawValue;\r\n      float value;\r\n      rawValue = (((uint32_t)_utils.getRegValue(_address, BM1383GLV_REG_PRESSURE_MSB) << 16) | ((uint32_t)_utils.getRegValue(_address, BM1383GLV_REG_PRESSURE_MID) << 8) | _utils.getRegValue(_address, BM1383GLV_REG_PRESSURE_LSB, 7, 2)) >> 2;\r\n      value = rawValue \/ 2048.0;\r\n      return(value);\r\n    }\r\n  private:\r\n    utilities _utils;\r\n    uint8_t _address;\r\n};\r\n\r\n#endif\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Sponge: hash sha-3 (keccak)\n *\/\n\n#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n\n#include \"keccak.H\"\n#include \"action_sponge.H\"\n\n#define HASH_SIZE 64\n#define RESULT_SIZE 8\n\n#undef TEST \/* get faster turn-around time *\/\n#ifdef NO_SYNTH \/* TEST *\/\n#  define NB_SLICES   (4)\n#  define NB_ROUND    (1 << 10)\n#else\n#  ifndef NB_SLICES\n#    define NB_SLICES (65536) \t\/* for real benchmark *\/\n#  endif\n#  ifndef NB_ROUND\n#    define NB_ROUND  (1 << 16) \/* (1 << 24) *\/ \/* for real benchmark *\/\n#  endif\n#endif\n\nuint64_t sponge (const uint64_t rank)\n{\n  uint64_t magic[8] = {0x0123456789abcdeful,0x13579bdf02468aceul,\n\t\t       0xfdecba9876543210ul,0xeca86420fdb97531ul,\n                       0x571e30cf4b29a86dul,0xd48f0c376e1b29a5ul,\n\t\t       0xc5301e9f6b2ad748ul,0x3894d02e5ba71c6ful};\n  uint64_t odd[8],even[8],result;\n  int i,j;\n  int rnd_nb;\n\n   for(i=0;i<RESULT_SIZE;i++) {\n#pragma HLS UNROLL \n    even[i] = magic[i] + rank;\n  }\n\n  \/\/keccak((uint8_t*)even,HASH_SIZE,(uint8_t*)odd,HASH_SIZE);\n  keccak((uint64_t*)even,HASH_SIZE,(uint64_t*)odd,HASH_SIZE);\n\n   for(rnd_nb=0;rnd_nb<NB_ROUND;rnd_nb++) {\n#pragma HLS UNROLL factor=4 \n\n    for(j=0;j<4;j++) {\n#pragma HLS UNROLL \n      odd[2*j] ^= ROTL64( even[2*j] , 4*j+1);\n      odd[2*j+1] = ROTL64( even[2*j+1] + odd[2*j+1], 4*j+3);\n    }\n\n    \/\/keccak((uint8_t*)odd,HASH_SIZE,(uint8_t*)even,HASH_SIZE);\n    keccak((uint64_t*)odd,HASH_SIZE,(uint64_t*)even,HASH_SIZE);\n\n     for(j=0;j<4;j++) {\n#pragma HLS UNROLL \n      even[2*j] += ROTL64( odd[2*j] , 4*j+5);\n      even[2*j+1] = ROTL64( even[2*j+1] ^ odd[2*j+1], 4*j+7);\n    }\n\n    \/\/keccak((uint8_t*)even,HASH_SIZE,(uint8_t*)odd,HASH_SIZE);\n    keccak((uint64_t*)even,HASH_SIZE,(uint64_t*)odd,HASH_SIZE);\n  }\n  result=0;\n  \n   for(i=0;i<RESULT_SIZE;i++) {\n#pragma HLS UNROLL \n    result += (even[i] ^ odd[i]);\n  }\n  return result;\n}\n\n\/*\n * WRITE RESULTS IN MMIO REGS\n *\n * Always check that ALL Outputs are tied to a value or HLS will generate a\n * Action_Output_i and a Action_Output_o registers and address to read results\n * will be shifted ...and wrong\n * => easy checking in generated files:\n *   grep 0x184 action_wrapper_ctrl_reg_s_axi.vhd\n * this grep should return nothing if no duplication of registers\n * (which is expected)\n *\/\nstatic void write_results(action_output_reg *Action_Output,\n\t\t\t  action_input_reg *Action_Input,\n\t\t\t  snapu32_t ReturnCode,\n\t\t\t  snapu64_t field1,\n\t\t\t  snapu64_t field2)\n{\n\tAction_Output->Retc = (snapu32_t)ReturnCode;\n\tAction_Output->Data.chk_out = field1;\n\tAction_Output->Data.timer_ticks = field2;\n\tAction_Output->Data.action_version =  RELEASE_VERSION;\n\tAction_Output->Reserved = 0;\n\tAction_Output->Data.in = Action_Input->Data.in;\n\tAction_Output->Data.chk_type = Action_Input->Data.chk_type;\n\tAction_Output->Data.chk_in = Action_Input->Data.chk_in;\n\tAction_Output->Data.pe = Action_Input->Data.pe;\n\tAction_Output->Data.nb_pe = Action_Input->Data.nb_pe;\n\tAction_Output->Data.nb_slices = NB_SLICES;\n\tAction_Output->Data.nb_round = NB_ROUND;\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/--- MAIN PROGRAM ------------------------------------------------------------\n\/\/-----------------------------------------------------------------------------\n\n\/**\n * Remarks: Using pointers for the din_gmem, ... parameters is requiring to\n * to set the depth=... parameter via the pragma below. If missing to do this\n * the cosimulation will not work, since the width of the interface cannot\n * be determined. Using an array din_gmem[...] works too to fix that.\n *\/\nvoid action_wrapper(snap_membus_t *din_gmem,\n\t\t    snap_membus_t *dout_gmem,\n\t\t    snap_membus_t *d_ddrmem,\n\t\t    action_input_reg *Action_Input,\n\t\t    action_output_reg *Action_Output)\n{\n\t\/\/ Host Memory AXI Interface\n#pragma HLS INTERFACE m_axi depth=256 port=din_gmem bundle=host_mem\n#pragma HLS INTERFACE m_axi depth=256 port=dout_gmem bundle=host_mem\n\n#pragma HLS INTERFACE s_axilite depth=256 port=din_gmem bundle=ctrl_reg\n#pragma HLS INTERFACE s_axilite depth=256 port=dout_gmem bundle=ctrl_reg\n\n\t\/\/DDR memory Interface\n#pragma HLS INTERFACE m_axi depth=256 port=d_ddrmem offset=slave bundle=card_mem0\n#pragma HLS INTERFACE s_axilite depth=256 port=d_ddrmem bundle=ctrl_reg\n\n\t\/\/ Host Memory AXI Lite Master Interface\n#pragma HLS DATA_PACK variable=Action_Input\n#pragma HLS INTERFACE s_axilite port=Action_Input offset=0x080 bundle=ctrl_reg\n#pragma HLS DATA_PACK variable=Action_Output\n#pragma HLS INTERFACE s_axilite port=Action_Output offset=0x104 bundle=ctrl_reg\n#pragma HLS INTERFACE s_axilite port=return bundle=ctrl_reg\n\n\tuint64_t checksum = 0;\n\tuint32_t slice = 0;\n\tuint32_t pe, nb_pe;\n\tuint64_t timer_ticks = 42;\n\n\tpe = Action_Input->Data.pe;\n\tnb_pe = Action_Input->Data.nb_pe;\n\n\t\/* Intermediate result display *\/\n\twrite_results(Action_Output, Action_Input, RET_CODE_OK,\n\t\t      checksum, timer_ticks);\n\n\t\/* Check if the data alignment matches the expectations *\/\n\tif (Action_Input->Control.action != SPONGE_ACTION_TYPE) {\n\t\twrite_results(Action_Output, Action_Input, RET_CODE_FAILURE,\n\t\t\t      checksum, timer_ticks);\n\t\treturn;\n\t}\n\n\tfor (slice = 0; slice < NB_SLICES; slice++) {\n#pragma HLS UNROLL factor=4\n\t\tif (pe == (slice % nb_pe))\n\t\t\tchecksum ^= sponge(slice);\n\n\t\t\/* Intermediate result display *\/\n\t\twrite_results(Action_Output, Action_Input, RET_CODE_OK,\n\t\t\t      0xfffffffffffffffful, slice);\n\t}\n\n\t\/* Final output register writes *\/\n\twrite_results(Action_Output, Action_Input, RET_CODE_OK,\n\t\t      checksum, timer_ticks);\n}\n\n#ifdef NO_SYNTH\n\n\/**\n * FIXME We need to use action_wrapper from here to get the real thing\n * simulated. For now let's take the short path and try without it.\n *\/\nint main(void)\n{\n\tuint64_t slice;\n\tuint64_t checksum=0;\n\tshort i, rc=0;\n\n\ttypedef struct {\n\t\tuint32_t  pe;\n\t\tuint32_t  nb_pe;\n\t\tuint64_t checksum;\n\t} arguments_t;\n\n\tstatic arguments_t sequence[] = {\n\t\t{ 0, \/*nb_pe =*\/  1, \/*expected checksum =*\/ 0x948dd5b0109342d4 },\n\t\t{ 0, \/*nb_pe =*\/  2, \/*expected checksum =*\/ 0x0bca19b17df64085 },\n\t\t{ 1, \/*nb_pe =*\/  2, \/*expected checksum =*\/ 0x9f47cc016d650251 },\n\t\t{ 0, \/*nb_pe =*\/  4, \/*expected checksum =*\/ 0x7f13a4a377a2c4fe },\n\t\t{ 1, \/*nb_pe =*\/  4, \/*expected checksum =*\/ 0xee0710b96b0748fb },\n\t\t{ 2, \/*nb_pe =*\/  4, \/*expected checksum =*\/ 0x74d9bd120a54847b },\n\t\t{ 3, \/*nb_pe =*\/  4, \/*expected checksum =*\/ 0x7140dcb806624aaa },\n\t};\n\n\tfor(i=0; i < 7; i++) {\n\t\tchecksum = 0;\n\t\tfor(slice=0;slice<NB_SLICES;slice++) {\n\t\t\tif(sequence[i].pe == (slice % sequence[i].nb_pe))\n\t\t\t\tchecksum ^= sponge(slice);\n\t\t}\n\t\tprintf(\"pe=%d - nb_pe=%d - processed checksum=%016llx \",\n\t\t       sequence[i].pe,\n\t\t       sequence[i].nb_pe,\n\t\t       (unsigned long long) checksum);\n\n\t\tif (sequence[i].checksum == checksum) {\n\t\t\tprintf(\" ==> CORRECT\\n\");\n\t\t\trc |= 0;\n\t\t}\n\t\telse {\n\t\t\tprintf(\" ==> ERROR: expected checksum=%016llx\\n\",\n\t\t\t       (unsigned long long) sequence[i].checksum);\n\t\t\trc |= 1;\n\t\t}\n\t}\n\tif (rc != 0)\n\t\tprintf(\"\\n\\t Checksums are given with use of -DTEST \"\n\t\t       \"flag. Please check you have set it!\\n\\n\");\n\n\treturn rc;\n}\n\n#endif \/\/ end of NO_SYNTH flag\n\n\n<commit_msg>HLS Sponge: Beautify castings and parameter names<commit_after>\/*\n * Sponge: hash sha-3 (keccak)\n *\/\n\n#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n\n#include \"keccak.H\"\n#include \"action_sponge.H\"\n\n#define HASH_SIZE 64\n#define RESULT_SIZE 8\n\n#undef TEST \/* get faster turn-around time *\/\n#ifdef NO_SYNTH \/* TEST *\/\n#  define NB_SLICES   (4)\n#  define NB_ROUND    (1 << 10)\n#else\n#  ifndef NB_SLICES\n#    define NB_SLICES (65536) \t\/* for real benchmark *\/\n#  endif\n#  ifndef NB_ROUND\n#    define NB_ROUND  (1 << 16) \/* (1 << 24) *\/ \/* for real benchmark *\/\n#  endif\n#endif\n\nuint64_t sponge (const uint64_t rank)\n{\n  uint64_t magic[8] = {0x0123456789abcdeful,0x13579bdf02468aceul,\n\t\t       0xfdecba9876543210ul,0xeca86420fdb97531ul,\n                       0x571e30cf4b29a86dul,0xd48f0c376e1b29a5ul,\n\t\t       0xc5301e9f6b2ad748ul,0x3894d02e5ba71c6ful};\n  uint64_t odd[8],even[8],result;\n  int i,j;\n  int rnd_nb;\n\n   for(i=0;i<RESULT_SIZE;i++) {\n#pragma HLS UNROLL \n    even[i] = magic[i] + rank;\n  }\n\n  \/\/keccak((uint8_t*)even,HASH_SIZE,(uint8_t*)odd,HASH_SIZE);\n  keccak((uint64_t*)even,HASH_SIZE,(uint64_t*)odd,HASH_SIZE);\n\n   for(rnd_nb=0;rnd_nb<NB_ROUND;rnd_nb++) {\n#pragma HLS UNROLL factor=4 \n\n    for(j=0;j<4;j++) {\n#pragma HLS UNROLL \n      odd[2*j] ^= ROTL64( even[2*j] , 4*j+1);\n      odd[2*j+1] = ROTL64( even[2*j+1] + odd[2*j+1], 4*j+3);\n    }\n\n    \/\/keccak((uint8_t*)odd,HASH_SIZE,(uint8_t*)even,HASH_SIZE);\n    keccak((uint64_t*)odd,HASH_SIZE,(uint64_t*)even,HASH_SIZE);\n\n     for(j=0;j<4;j++) {\n#pragma HLS UNROLL \n      even[2*j] += ROTL64( odd[2*j] , 4*j+5);\n      even[2*j+1] = ROTL64( even[2*j+1] ^ odd[2*j+1], 4*j+7);\n    }\n\n    \/\/keccak((uint8_t*)even,HASH_SIZE,(uint8_t*)odd,HASH_SIZE);\n    keccak((uint64_t*)even,HASH_SIZE,(uint64_t*)odd,HASH_SIZE);\n  }\n  result=0;\n  \n   for(i=0;i<RESULT_SIZE;i++) {\n#pragma HLS UNROLL \n    result += (even[i] ^ odd[i]);\n  }\n  return result;\n}\n\n\/*\n * WRITE RESULTS IN MMIO REGS\n *\n * Always check that ALL Outputs are tied to a value or HLS will generate a\n * Action_Output_i and a Action_Output_o registers and address to read results\n * will be shifted ...and wrong\n * => easy checking in generated files:\n *   grep 0x184 action_wrapper_ctrl_reg_s_axi.vhd\n * this grep should return nothing if no duplication of registers\n * (which is expected)\n *\/\nstatic void write_results(action_output_reg *Action_Output,\n\t\t\t  action_input_reg *Action_Input,\n\t\t\t  snapu32_t ReturnCode,\n\t\t\t  snapu64_t chk_out,\n\t\t\t  snapu64_t timer_ticks)\n{\n\tAction_Output->Retc = ReturnCode;\n\tAction_Output->Data.chk_out = chk_out;\n\tAction_Output->Data.timer_ticks = timer_ticks;\n\tAction_Output->Data.action_version =  RELEASE_VERSION;\n\tAction_Output->Reserved = 0;\n\tAction_Output->Data.in = Action_Input->Data.in;\n\tAction_Output->Data.chk_type = Action_Input->Data.chk_type;\n\tAction_Output->Data.chk_in = Action_Input->Data.chk_in;\n\tAction_Output->Data.pe = Action_Input->Data.pe;\n\tAction_Output->Data.nb_pe = Action_Input->Data.nb_pe;\n\tAction_Output->Data.nb_slices = NB_SLICES;\n\tAction_Output->Data.nb_round = NB_ROUND;\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/--- MAIN PROGRAM ------------------------------------------------------------\n\/\/-----------------------------------------------------------------------------\n\n\/**\n * Remarks: Using pointers for the din_gmem, ... parameters is requiring to\n * to set the depth=... parameter via the pragma below. If missing to do this\n * the cosimulation will not work, since the width of the interface cannot\n * be determined. Using an array din_gmem[...] works too to fix that.\n *\/\nvoid action_wrapper(snap_membus_t *din_gmem,\n\t\t    snap_membus_t *dout_gmem,\n\t\t    snap_membus_t *d_ddrmem,\n\t\t    action_input_reg *Action_Input,\n\t\t    action_output_reg *Action_Output)\n{\n\t\/\/ Host Memory AXI Interface\n#pragma HLS INTERFACE m_axi depth=256 port=din_gmem bundle=host_mem\n#pragma HLS INTERFACE m_axi depth=256 port=dout_gmem bundle=host_mem\n\n#pragma HLS INTERFACE s_axilite depth=256 port=din_gmem bundle=ctrl_reg\n#pragma HLS INTERFACE s_axilite depth=256 port=dout_gmem bundle=ctrl_reg\n\n\t\/\/DDR memory Interface\n#pragma HLS INTERFACE m_axi depth=256 port=d_ddrmem offset=slave bundle=card_mem0\n#pragma HLS INTERFACE s_axilite depth=256 port=d_ddrmem bundle=ctrl_reg\n\n\t\/\/ Host Memory AXI Lite Master Interface\n#pragma HLS DATA_PACK variable=Action_Input\n#pragma HLS INTERFACE s_axilite port=Action_Input offset=0x080 bundle=ctrl_reg\n#pragma HLS DATA_PACK variable=Action_Output\n#pragma HLS INTERFACE s_axilite port=Action_Output offset=0x104 bundle=ctrl_reg\n#pragma HLS INTERFACE s_axilite port=return bundle=ctrl_reg\n\n\tuint64_t checksum = 0;\n\tuint32_t slice = 0;\n\tuint32_t pe, nb_pe;\n\tuint64_t timer_ticks = 42;\n\n\tpe = Action_Input->Data.pe;\n\tnb_pe = Action_Input->Data.nb_pe;\n\n\t\/* Intermediate result display *\/\n\twrite_results(Action_Output, Action_Input, RET_CODE_OK,\n\t\t      checksum, timer_ticks);\n\n\t\/* Check if the data alignment matches the expectations *\/\n\tif (Action_Input->Control.action != SPONGE_ACTION_TYPE) {\n\t\twrite_results(Action_Output, Action_Input, RET_CODE_FAILURE,\n\t\t\t      checksum, timer_ticks);\n\t\treturn;\n\t}\n\n\tfor (slice = 0; slice < NB_SLICES; slice++) {\n#pragma HLS UNROLL factor=4\n\t\tif (pe == (slice % nb_pe))\n\t\t\tchecksum ^= sponge(slice);\n\n\t\t\/* Intermediate result display *\/\n\t\twrite_results(Action_Output, Action_Input, RET_CODE_OK,\n\t\t\t      0xfffffffffffffffful, slice);\n\t}\n\n\t\/* Final output register writes *\/\n\twrite_results(Action_Output, Action_Input, RET_CODE_OK,\n\t\t      checksum, timer_ticks);\n}\n\n#ifdef NO_SYNTH\n\n\/**\n * FIXME We need to use action_wrapper from here to get the real thing\n * simulated. For now let's take the short path and try without it.\n *\/\nint main(void)\n{\n\tuint64_t slice;\n\tuint64_t checksum=0;\n\tshort i, rc=0;\n\n\ttypedef struct {\n\t\tuint32_t  pe;\n\t\tuint32_t  nb_pe;\n\t\tuint64_t checksum;\n\t} arguments_t;\n\n\tstatic arguments_t sequence[] = {\n\t\t{ 0, \/*nb_pe =*\/  1, \/*expected checksum =*\/ 0x948dd5b0109342d4 },\n\t\t{ 0, \/*nb_pe =*\/  2, \/*expected checksum =*\/ 0x0bca19b17df64085 },\n\t\t{ 1, \/*nb_pe =*\/  2, \/*expected checksum =*\/ 0x9f47cc016d650251 },\n\t\t{ 0, \/*nb_pe =*\/  4, \/*expected checksum =*\/ 0x7f13a4a377a2c4fe },\n\t\t{ 1, \/*nb_pe =*\/  4, \/*expected checksum =*\/ 0xee0710b96b0748fb },\n\t\t{ 2, \/*nb_pe =*\/  4, \/*expected checksum =*\/ 0x74d9bd120a54847b },\n\t\t{ 3, \/*nb_pe =*\/  4, \/*expected checksum =*\/ 0x7140dcb806624aaa },\n\t};\n\n\tfor(i=0; i < 7; i++) {\n\t\tchecksum = 0;\n\t\tfor(slice=0;slice<NB_SLICES;slice++) {\n\t\t\tif(sequence[i].pe == (slice % sequence[i].nb_pe))\n\t\t\t\tchecksum ^= sponge(slice);\n\t\t}\n\t\tprintf(\"pe=%d - nb_pe=%d - processed checksum=%016llx \",\n\t\t       sequence[i].pe,\n\t\t       sequence[i].nb_pe,\n\t\t       (unsigned long long) checksum);\n\n\t\tif (sequence[i].checksum == checksum) {\n\t\t\tprintf(\" ==> CORRECT\\n\");\n\t\t\trc |= 0;\n\t\t}\n\t\telse {\n\t\t\tprintf(\" ==> ERROR: expected checksum=%016llx\\n\",\n\t\t\t       (unsigned long long) sequence[i].checksum);\n\t\t\trc |= 1;\n\t\t}\n\t}\n\tif (rc != 0)\n\t\tprintf(\"\\n\\t Checksums are given with use of -DTEST \"\n\t\t       \"flag. Please check you have set it!\\n\\n\");\n\n\treturn rc;\n}\n\n#endif \/\/ end of NO_SYNTH flag\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2015 Nicolas Pope\n *\/\n\n#include \"fdsb\/harc.hpp\"\n\n#include <thread>\n#include <vector>\n#include <future>\n#include <iostream>\n\n#include \"fdsb\/nid.hpp\"\n\nusing fdsb::Harc;\nusing fdsb::Nid;\n\nstd::unordered_multimap<unsigned long long, Harc*> Harc::s_fabric;\n\nHarc::Harc(const Nid &a, const Nid &b) :\n\tm_head(null_n),\n\tm_def(nullptr) {\n\tm_tail[0] = a;\n\tm_tail[1] = b;\n}\n\nvoid Harc::add_dependant(Harc &h) {\n\tm_dependants.push_back(&h);\n}\n\nconst Nid &Harc::query() {\n\twhile (m_def && m_def->outofdate) {\n\t\t\/\/ Can we update the definition\n\t\tif (!m_def->lock.test_and_set()) {\n\t\t\tm_head = path(m_def->def, this);\n\t\t\tm_def->outofdate = false;\n\t\t\tm_def->lock.clear();\n\t\t\/\/ Or must we wait on some other thread\n\t\t} else {\n\t\t\t\/\/ Do something else or yield\n\t\t\tstd::this_thread::yield();\n\t\t}\n\t}\n\treturn m_head;\n}\n\nvoid Harc::dirty() {\n\tif (m_def) m_def->outofdate = true;\n\tfor (auto i : m_dependants) {\n\t\ti->dirty();\n\t}\n\tm_dependants.clear();\n}\n\nvoid Harc::define(const Nid &n) {\n\tm_head = n;\n\tif (m_def) {\n\t\tdelete m_def;\n\t\tm_def = nullptr;\n\t}\n\tfor (auto i : m_dependants) {\n\t\ti->dirty();\n\t}\n\tm_dependants.clear();\n}\n\nvoid Harc::define(const std::vector<std::vector<Nid>> &p) {\n\tif (m_def) delete m_def;\n\tm_def = new Definition(p);\n\tdirty();\n}\n\nHarc &Harc::operator=(const Nid &n) {\n\tdefine(n);\n\treturn *this;\n}\n\nbool Harc::operator==(const Nid &n) {\n\treturn query() == n;\n}\n\nHarc &Nid::operator[](const Nid &n) {\n\treturn Harc::get(*this, n);\n}\n\nHarc &Harc::operator[](const Nid &n) {\n\treturn get(query(), n);\n}\n\nHarc &Harc::get(const Nid &a, const Nid &b) {\n\tHarc *h;\n\tauto range = s_fabric.equal_range(Nid::dual_hash(a, b));\n\n\tfor (auto i = range.first; i != range.second; i++) {\n\t\th = i->second;\n\t\tif (h->equal_tail(a, b)) {\n\t\t\treturn *h;\n\t\t}\n\t}\n\n\th = new Harc(a, b);\n\ts_fabric.insert({{Nid::dual_hash(a, b), h}});\n\treturn *h;\n}\n\nNid Harc::path_s(const std::vector<Nid> &p, Harc *dep) {\n\tif (p.size() > 1) {\n\t\tNid temp = p[0];\n\t\tfor (auto i = ++p.begin(); i != p.end(); ++i) {\n\t\t\tHarc &h = Harc::get(temp, *i);\n\t\t\tif (dep) {\n\t\t\t\th.add_dependant(*dep);\n\t\t\t}\n\t\t\ttemp = h.query();\n\t\t}\n\t\treturn temp;\n\t} else if (p.size() == 1) {\n\t\treturn p[0];\n\t} else {\n\t\treturn null_n;\n\t}\n}\n\nstd::atomic<int> pool_count(4);\n\nNid Harc::path(const std::vector<std::vector<Nid>> &p, Harc *dep) {\n\tstd::vector<Nid> res(p.size());\n\n\tif (p.size() > 1 && pool_count > 0) {\n\t\t--pool_count;\n\n\t\t\/\/ Divide paths into 2 parts.\n\t\tauto middle = p.size() \/ 2;\n\n\t\t\/\/ Asynchronously perform first half\n\t\tstd::future<bool> fa = std::async(\n\t\t\tstd::launch::async,\n\t\t\t[](const std::vector<std::vector<Nid>> &p, Nid *res,\n\t\t\t\t\tint s, int e, Harc *dep) {\n\t\t\t\tfor (auto i = s; i < e; ++i) {\n\t\t\t\t\tres[i] = Harc::path_s(p[i], dep);\n\t\t\t\t}\n\t\t\t\treturn true;\n\t\t\t}, p, res.data(), 0, middle, dep);\n\n\t\tfor (auto i = middle; i < p.size(); ++i) {\n\t\t\tres[i] = Harc::path_s(p[i], dep);\n\t\t}\n\t\tfa.get();\n\t\t++pool_count;\n\t} else {\n\t\tint ix = 0;\n\n\t\tfor (auto i : p) {\n\t\t\tres[ix++] = path_s(i, dep);\n\t\t}\n\t}\n\n\t\/\/ Final recombination\n\treturn Harc::path_s(res, dep);\n}\n<commit_msg>On fly lookup of divided results<commit_after>\/*\n * Copyright 2015 Nicolas Pope\n *\/\n\n#include \"fdsb\/harc.hpp\"\n\n#include <thread>\n#include <vector>\n#include <future>\n#include <iostream>\n\n#include \"fdsb\/nid.hpp\"\n\nusing fdsb::Harc;\nusing fdsb::Nid;\n\nstd::unordered_multimap<unsigned long long, Harc*> Harc::s_fabric;\n\nHarc::Harc(const Nid &a, const Nid &b) :\n\tm_head(null_n),\n\tm_def(nullptr) {\n\tm_tail[0] = a;\n\tm_tail[1] = b;\n}\n\nvoid Harc::add_dependant(Harc &h) {\n\tm_dependants.push_back(&h);\n}\n\nconst Nid &Harc::query() {\n\twhile (m_def && m_def->outofdate) {\n\t\t\/\/ Can we update the definition\n\t\tif (!m_def->lock.test_and_set()) {\n\t\t\tm_head = path(m_def->def, this);\n\t\t\tm_def->outofdate = false;\n\t\t\tm_def->lock.clear();\n\t\t\/\/ Or must we wait on some other thread\n\t\t} else {\n\t\t\t\/\/ Do something else or yield\n\t\t\tstd::this_thread::yield();\n\t\t}\n\t}\n\treturn m_head;\n}\n\nvoid Harc::dirty() {\n\tif (m_def) m_def->outofdate = true;\n\tfor (auto i : m_dependants) {\n\t\ti->dirty();\n\t}\n\tm_dependants.clear();\n}\n\nvoid Harc::define(const Nid &n) {\n\tm_head = n;\n\tif (m_def) {\n\t\tdelete m_def;\n\t\tm_def = nullptr;\n\t}\n\tfor (auto i : m_dependants) {\n\t\ti->dirty();\n\t}\n\tm_dependants.clear();\n}\n\nvoid Harc::define(const std::vector<std::vector<Nid>> &p) {\n\tif (m_def) delete m_def;\n\tm_def = new Definition(p);\n\tdirty();\n}\n\nHarc &Harc::operator=(const Nid &n) {\n\tdefine(n);\n\treturn *this;\n}\n\nbool Harc::operator==(const Nid &n) {\n\treturn query() == n;\n}\n\nHarc &Nid::operator[](const Nid &n) {\n\treturn Harc::get(*this, n);\n}\n\nHarc &Harc::operator[](const Nid &n) {\n\treturn get(query(), n);\n}\n\nHarc &Harc::get(const Nid &a, const Nid &b) {\n\tHarc *h;\n\tauto range = s_fabric.equal_range(Nid::dual_hash(a, b));\n\n\tfor (auto i = range.first; i != range.second; i++) {\n\t\th = i->second;\n\t\tif (h->equal_tail(a, b)) {\n\t\t\treturn *h;\n\t\t}\n\t}\n\n\th = new Harc(a, b);\n\ts_fabric.insert({{Nid::dual_hash(a, b), h}});\n\treturn *h;\n}\n\nNid Harc::path_s(const std::vector<Nid> &p, Harc *dep) {\n\tif (p.size() > 1) {\n\t\tNid temp = p[0];\n\t\tfor (auto i = ++p.begin(); i != p.end(); ++i) {\n\t\t\tHarc &h = Harc::get(temp, *i);\n\t\t\tif (dep) {\n\t\t\t\th.add_dependant(*dep);\n\t\t\t}\n\t\t\ttemp = h.query();\n\t\t}\n\t\treturn temp;\n\t} else if (p.size() == 1) {\n\t\treturn p[0];\n\t} else {\n\t\treturn null_n;\n\t}\n}\n\nstd::atomic<int> pool_count(4);\n\nNid Harc::path(const std::vector<std::vector<Nid>> &p, Harc *dep) {\n\tstd::vector<Nid> res(p.size());\n\n\t\/\/ Should we attempt to split the load?\n\tif (p.size() > 2 && pool_count > 0) {\n\t\t--pool_count;\n\n\t\t\/\/ Divide paths into 2 parts.\n\t\tauto middle = p.size() \/ 2;\n\n\t\t\/\/ Asynchronously perform second half\n\t\tstd::future<bool> fa = std::async(\n\t\t\tstd::launch::async,\n\t\t\t[](const std::vector<std::vector<Nid>> &p, Nid *res,\n\t\t\t\t\tint s, int e, Harc *dep) {\n\t\t\t\tfor (auto i = s; i < e; ++i) {\n\t\t\t\t\tres[i] = Harc::path_s(p[i], dep);\n\t\t\t\t}\n\t\t\t\treturn true;\n\t\t\t}, p, res.data(), middle, p.size(), dep);\n\n\t\t\/\/ Calculate first half\n\t\tNid cur = Harc::path_s(p[0], dep);\n\t\tfor (unsigned int i = 1; i < middle; ++i) {\n\t\t\tHarc &h = Harc::get(cur, Harc::path_s(p[i], dep));\n\t\t\tif (dep) {\n\t\t\t\th.add_dependant(*dep);\n\t\t\t}\n\t\t\tcur = h.query();\n\t\t}\n\n\t\t\/\/ Sync with other thread.\n\t\tfa.get();\n\t\t++pool_count;\n\n\t\t\/\/ Combine async results with first half\n\t\tfor (unsigned int i = middle; i < p.size(); ++i) {\n\t\t\tHarc &h = Harc::get(cur, res[i]);\n\t\t\tif (dep) {\n\t\t\t\th.add_dependant(*dep);\n\t\t\t}\n\t\t\tcur = h.query();\n\t\t}\n\t\treturn cur;\n\t} else {\n\t\tint ix = 0;\n\n\t\tfor (auto i : p) {\n\t\t\tres[ix++] = path_s(i, dep);\n\t\t}\n\n\t\t\/\/ Final recombination\n\t\treturn Harc::path_s(res, dep);\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef FIXED_VECTOR_HPP\n#define FIXED_VECTOR_HPP\n#include<algorithm>\n#include<type_traits>\n#include<utility>\n\nnamespace nContainer\n{\n\ttemplate<class T,auto N>\n\tclass Fixed_vector\n\t{\n\tpublic:\n\t\tusing value_type=T;\n\t\tusing size_type=std::remove_cv_t<decltype(N)>;\n\t\tusing pointer=T*;\n\t\tusing const_pointer=const T*;\n\t\tusing reference=T&;\n\t\tusing const_reference=const T&;\n\t\tusing iterator=T*;\n\t\tusing const_iterator=const T*;\n\tprivate:\n\t\tvalue_type data_[N];\n\t\tpointer end_;\n\tpublic:\n\t\tconstexpr Fixed_vector() noexcept(std::is_nothrow_default_constructible_v<T>)\n\t\t\t:end_(data_){}\n\t\tFixed_vector(const Fixed_vector &rhs)\n\t\t\t:Fixed_vector(rhs.begin(),rhs.end()){}\n\t\tFixed_vector(Fixed_vector &&rhs)\n\t\t{\n\t\t\tend_=std::move(rhs.begin(),rhs.end(),data_);\n\t\t}\n\t\ttemplate<class InIter>\n\t\tconstexpr Fixed_vector(InIter begin,InIter end)\n\t\t{\n\t\t\tend_=std::copy(begin,end,data_);\n\t\t}\n\t\tconstexpr reference back() noexcept\n\t\t{\n\t\t\treturn *(end_-1);\n\t\t}\n\t\tconstexpr const_reference back() const noexcept\n\t\t{\n\t\t\treturn *(end_-1);\n\t\t}\n\t\tconstexpr iterator begin() noexcept\n\t\t{\n\t\t\treturn data_;\n\t\t}\n\t\tconstexpr const_iterator begin() const noexcept\n\t\t{\n\t\t\treturn data_;\n\t\t}\n\t\tconstexpr size_type capacity() const noexcept\n\t\t{\n\t\t\treturn N;\n\t\t}\n\t\tconstexpr void clear() noexcept\n\t\t{\n\t\t\tend_=data_;\n\t\t}\n\t\tconstexpr iterator end() noexcept\n\t\t{\n\t\t\treturn end_;\n\t\t}\n\t\tconstexpr const_iterator end() const noexcept\n\t\t{\n\t\t\treturn end_;\n\t\t}\n\t\tconstexpr bool empty() const noexcept\n\t\t{\n\t\t\treturn data_==end_;\n\t\t}\n\t\tinline void erase(const iterator pos)\n\t\t{\n\t\t\tstd::move(pos+1,end_--,pos);\n\t\t}\n\t\tinline void erase(const iterator first,const iterator last)\n\t\t{\n\t\t\tend_=std::move(last,end_,first);\n\t\t}\n\t\tconstexpr pointer data() noexcept\n\t\t{\n\t\t\treturn data_;\n\t\t}\n\t\tconstexpr const_pointer data() const noexcept\n\t\t{\n\t\t\treturn data_;\n\t\t}\n\t\tconstexpr reference front() noexcept\n\t\t{\n\t\t\treturn data_[0];\n\t\t}\n\t\tconstexpr const_reference front() const noexcept\n\t\t{\n\t\t\treturn data_[0];\n\t\t}\n\t\tvoid insert(const iterator pos,const_reference val)\n\t\t{\n\t\t\tstd::move_backward(pos,end_,end_+1);\n\t\t\t++end_;\n\t\t\t*pos=val;\n\t\t}\n\t\tvoid insert(const iterator pos,value_type &&val)\n\t\t{\n\t\t\tstd::move_backward(pos,end_,end_+1);\n\t\t\t++end_;\n\t\t\t*pos=std::move(val);\n\t\t}\n\t\tconstexpr void pop_back() noexcept\n\t\t{\n\t\t\t--end_;\n\t\t}\n\t\tconstexpr void push_back(const_reference val) noexcept(std::is_nothrow_copy_assignable_v<value_type>)\n\t\t{\n\t\t\t*(end_++)=val;\n\t\t}\n\t\tconstexpr void push_back(value_type &&val) noexcept(std::is_nothrow_move_assignable_v<value_type>)\n\t\t{\n\t\t\t*(end_++)=std::move(val);\n\t\t}\n\t\tconstexpr void resize(const size_type new_size) noexcept\n\t\t{\n\t\t\tend_=data_+new_size;\n\t\t}\n\t\tconstexpr size_type size() const noexcept\n\t\t{\n\t\t\treturn end_-data_;\n\t\t}\n\t\tconstexpr reference operator[](const size_type pos)\n\t\t{\n\t\t\treturn data_[pos];\n\t\t}\n\t\tconstexpr const_reference operator[](const size_type pos) const\n\t\t{\n\t\t\treturn data_[pos];\n\t\t}\n\t\tFixed_vector& operator=(const Fixed_vector &rhs)\n\t\t{\n\t\t\tif(this!=&rhs)\n\t\t\t\tend_=std::copy(rhs.begin(),rhs.end(),data_);\n\t\t\treturn *this;\n\t\t}\n\t\tFixed_vector& operator=(Fixed_vector &&rhs)\n\t\t{\n\t\t\tif(this!=&rhs)\n\t\t\t\tend_=std::move(rhs.begin(),rhs.end(),data_);\n\t\t\treturn *this;\n\t\t}\n\t};\n}\n\n#endif<commit_msg>add insert<commit_after>#ifndef FIXED_VECTOR_HPP\n#define FIXED_VECTOR_HPP\n#include<algorithm>\n#include<type_traits>\n#include<utility>\n\nnamespace nContainer\n{\n\ttemplate<class T,auto N>\n\tclass Fixed_vector\n\t{\n\tpublic:\n\t\tusing value_type=T;\n\t\tusing size_type=std::remove_cv_t<decltype(N)>;\n\t\tusing pointer=T*;\n\t\tusing const_pointer=const T*;\n\t\tusing reference=T&;\n\t\tusing const_reference=const T&;\n\t\tusing iterator=T*;\n\t\tusing const_iterator=const T*;\n\tprivate:\n\t\tvalue_type data_[N];\n\t\tpointer end_;\n\tpublic:\n\t\tconstexpr Fixed_vector() noexcept(std::is_nothrow_default_constructible_v<T>)\n\t\t\t:end_(data_){}\n\t\tFixed_vector(const Fixed_vector &rhs)\n\t\t\t:Fixed_vector(rhs.begin(),rhs.end()){}\n\t\tFixed_vector(Fixed_vector &&rhs)\n\t\t{\n\t\t\tend_=std::move(rhs.begin(),rhs.end(),data_);\n\t\t}\n\t\ttemplate<class InIter>\n\t\tconstexpr Fixed_vector(InIter begin,InIter end)\n\t\t{\n\t\t\tend_=std::copy(begin,end,data_);\n\t\t}\n\t\tconstexpr reference back() noexcept\n\t\t{\n\t\t\treturn *(end_-1);\n\t\t}\n\t\tconstexpr const_reference back() const noexcept\n\t\t{\n\t\t\treturn *(end_-1);\n\t\t}\n\t\tconstexpr iterator begin() noexcept\n\t\t{\n\t\t\treturn data_;\n\t\t}\n\t\tconstexpr const_iterator begin() const noexcept\n\t\t{\n\t\t\treturn data_;\n\t\t}\n\t\tconstexpr size_type capacity() const noexcept\n\t\t{\n\t\t\treturn N;\n\t\t}\n\t\tconstexpr void clear() noexcept\n\t\t{\n\t\t\tend_=data_;\n\t\t}\n\t\tconstexpr iterator end() noexcept\n\t\t{\n\t\t\treturn end_;\n\t\t}\n\t\tconstexpr const_iterator end() const noexcept\n\t\t{\n\t\t\treturn end_;\n\t\t}\n\t\tconstexpr bool empty() const noexcept\n\t\t{\n\t\t\treturn data_==end_;\n\t\t}\n\t\tinline void erase(const iterator pos)\n\t\t{\n\t\t\tstd::move(pos+1,end_--,pos);\n\t\t}\n\t\tinline void erase(const iterator first,const iterator last)\n\t\t{\n\t\t\tend_=std::move(last,end_,first);\n\t\t}\n\t\tconstexpr pointer data() noexcept\n\t\t{\n\t\t\treturn data_;\n\t\t}\n\t\tconstexpr const_pointer data() const noexcept\n\t\t{\n\t\t\treturn data_;\n\t\t}\n\t\tconstexpr reference front() noexcept\n\t\t{\n\t\t\treturn data_[0];\n\t\t}\n\t\tconstexpr const_reference front() const noexcept\n\t\t{\n\t\t\treturn data_[0];\n\t\t}\n\t\tvoid insert(const iterator pos,const_reference val)\n\t\t{\n\t\t\tstd::move_backward(pos,end_,end_+1);\n\t\t\t++end_;\n\t\t\t*pos=val;\n\t\t}\n\t\tvoid insert(const iterator pos,value_type &&val)\n\t\t{\n\t\t\tstd::move_backward(pos,end_,end_+1);\n\t\t\t++end_;\n\t\t\t*pos=std::move(val);\n\t\t}\n\t\ttemplate<class InIter>\n\t\tvoid insert(const iterator pos,const InIter begin,const InIter end)\n\t\t{\n\t\t\tconst auto dis(std::distance(begin,end));\n\t\t\tstd::move_backward(pos,end_,end_+dis);\n\t\t\tend_+=dis;\n\t\t\tstd::copy(begin,end,pos);\n\t\t}\n\t\tconstexpr void pop_back() noexcept\n\t\t{\n\t\t\t--end_;\n\t\t}\n\t\tconstexpr void push_back(const_reference val) noexcept(std::is_nothrow_copy_assignable_v<value_type>)\n\t\t{\n\t\t\t*(end_++)=val;\n\t\t}\n\t\tconstexpr void push_back(value_type &&val) noexcept(std::is_nothrow_move_assignable_v<value_type>)\n\t\t{\n\t\t\t*(end_++)=std::move(val);\n\t\t}\n\t\tconstexpr void resize(const size_type new_size) noexcept\n\t\t{\n\t\t\tend_=data_+new_size;\n\t\t}\n\t\tconstexpr size_type size() const noexcept\n\t\t{\n\t\t\treturn end_-data_;\n\t\t}\n\t\tconstexpr reference operator[](const size_type pos)\n\t\t{\n\t\t\treturn data_[pos];\n\t\t}\n\t\tconstexpr const_reference operator[](const size_type pos) const\n\t\t{\n\t\t\treturn data_[pos];\n\t\t}\n\t\tFixed_vector& operator=(const Fixed_vector &rhs)\n\t\t{\n\t\t\tif(this!=&rhs)\n\t\t\t\tend_=std::copy(rhs.begin(),rhs.end(),data_);\n\t\t\treturn *this;\n\t\t}\n\t\tFixed_vector& operator=(Fixed_vector &&rhs)\n\t\t{\n\t\t\tif(this!=&rhs)\n\t\t\t\tend_=std::move(rhs.begin(),rhs.end(),data_);\n\t\t\treturn *this;\n\t\t}\n\t};\n}\n\n#endif<|endoftext|>"}
{"text":"<commit_before>\/\/ For conditions of distribution and use, see copyright notice in license.txt\n\n#include \"StableHeaders.h\"\n#include \"AssetEvents.h\"\n#include \"AssetManager.h\"\n#include \"AssetModule.h\"\n#include \"RexAsset.h\"\n#include \"RexTypes.h\"\n#include \"LocalAssetProvider.h\"\n#include \"AssetServiceInterface.h\"\n#include \"Framework.h\"\n#include \"EventManager.h\"\n#include \"ServiceManager.h\"\n#include \"ConfigurationManager.h\"\n#include \"LocalAssetStorage.h\"\n#include \"IAssetUploadTransfer.h\"\n#include \"IAssetTransfer.h\"\n#include \"AssetAPI.h\"\n#include <QByteArray>\n#include <QFile>\n#include <QFileInfo>\n#include <QFileSystemWatcher>\n\nnamespace Asset\n{\n\nLocalAssetProvider::LocalAssetProvider(Foundation::Framework* framework) :\n    framework_(framework)\n{\n    EventManagerPtr event_manager = framework_->GetEventManager();\n    event_category_ = event_manager->QueryEventCategory(\"Asset\");\n\n    ProcessCommandLineOptions();\n}\n\nLocalAssetProvider::~LocalAssetProvider()\n{\n}\n\nconst std::string& LocalAssetProvider::Name()\n{\n    static const std::string name(\"Local\");\n    \n    return name;\n}\n\nbool LocalAssetProvider::IsValidRef(const std::string& asset_id, const std::string& asset_type)\n{\n    QString ref = asset_id.c_str();\n    ref = ref.trimmed();\n    if (ref.length() == 0)\n        return false;\n    if (ref.startsWith(\"file:\/\/\") || ref.startsWith(\"local:\/\/\"))\n        return true;\n\n    if (!ref.contains(\":\/\/\")) \/\/ If the ref doesn't contain a protocol specifier (we do this simple check for it), try to directly find the given local file.\n    {\n        QString path = GetPathForAsset(ref);\n        return path.length() > 0;\n    }\n    else\n        return false;\n}\n\n\/\/\/\\todo This function call is deprecated, and used in conjunction with the old code flow for asset requests. Use the AssetAPI and\n\/\/\/ AssetTransferPtr LocalAssetProvider::RequestAsset(QString assetRef, QString assetType) instead.\nbool LocalAssetProvider::RequestAsset(const std::string& asset_id, const std::string& asset_type, request_tag_t tag)\n{\n    \/\/ Complete any file uploads before processing any download requests. (a total hack, but this function will be removed in the future)\n    CompletePendingFileUploads();\n\n    if (!IsValidRef(asset_id, asset_type))\n        return false;\n    \n    ServiceManagerPtr service_manager = framework_->GetServiceManager();\n    boost::shared_ptr<Foundation::AssetServiceInterface> asset_service =\n        service_manager->GetService<Foundation::AssetServiceInterface>(Service::ST_Asset).lock();\n    if (!asset_service)\n        return false;\n    \n    AssetModule::LogDebug(\"New local asset request for ref \\\"\" + asset_id + \"\\\"\");\n        \n    \/\/ Strip file: trims asset provider id (f.ex. 'file:\/\/') and potential mesh name inside the file (everything after last slash)\n    std::string filename = QString(asset_id.c_str()).trimmed().toStdString();\n    if (filename.find(\"file:\/\/\") != std::string::npos)\n        filename = filename.substr(7);\n    else if (filename.find(\"local:\/\/\") != std::string::npos)\n        filename = filename.substr(8);\n    size_t lastSlash = filename.find_last_of('\/');\n    if (lastSlash != std::string::npos)\n        filename = filename.substr(0, lastSlash);\n    \n    std::string assetpath = GetPathForAsset(filename.c_str()).toStdString(); \/\/ Look up all known local file asset storages for this asset.\n    if (assetpath.empty())\n    {\n        AssetModule::LogInfo(\"Failed to load local asset \\\"\" + filename + \"\\\"\");\n        return true;\n    }\n    \n    boost::filesystem::path file_path(assetpath + \"\/\" + filename);\n    std::ifstream filestr(file_path.native_directory_string().c_str(), std::ios::in | std::ios::binary);\n    if (filestr.good())\n    {\n        filestr.seekg(0, std::ios::end);\n        uint length = filestr.tellg();\n        filestr.seekg(0, std::ios::beg);\n        \n        if (length > 0)\n        {\n            RexAsset* new_asset = new RexAsset(asset_id, asset_type);\n            Foundation::AssetInterfacePtr asset_ptr(new_asset);\n            \n            RexAsset::AssetDataVector& data = new_asset->GetDataInternal();\n            data.resize(length);\n            filestr.read((char *)&data[0], length);\n            filestr.close();\n            \n            \/\/ Store to memory cache only\n            asset_service->StoreAsset(asset_ptr, false);\n            \/\/ Send asset_ready event as delayed\n            Events::AssetReady* event_data = new Events::AssetReady(asset_ptr->GetId(), asset_ptr->GetType(), asset_ptr, tag);\n            framework_->GetEventManager()->SendDelayedEvent(event_category_, Events::ASSET_READY, EventDataPtr(event_data));\n            \n            return true;\n        }\n        else\n            filestr.close();\n    }\n    \n    AssetModule::LogInfo(\"Failed to load local asset \\\"\" + filename + \"\\\"\");\n    return true;\n}\n\nAssetTransferPtr LocalAssetProvider::RequestAsset(QString assetRef, QString assetType)\n{\n    AssetTransferPtr transfer = AssetTransferPtr(new IAssetTransfer);\n    transfer->source.ref = assetRef.trimmed();\n    transfer->assetType = assetType;\n\n    pendingDownloads.push_back(transfer);\n\n    return transfer;\n}\n\nQString LocalAssetProvider::GetPathForAsset(const QString &assetname)\n{\n    \/\/ Check first all subdirs without recursion, because recursion is potentially slow\n    for(size_t i = 0; i < storages.size(); ++i)\n    {\n        QString path = storages[i]->GetFullPathForAsset(assetname.toStdString().c_str(), false);\n        if (path != \"\")\n            return path;\n    }\n\n    for(size_t i = 0; i < storages.size(); ++i)\n    {\n        QString path = storages[i]->GetFullPathForAsset(assetname.toStdString().c_str(), true);\n        if (path != \"\")\n            return path;\n    }\n    \n    return \"\";\n}\n\nbool LocalAssetProvider::InProgress(const std::string& asset_id)\n{\n    return false;\n}\n\nFoundation::AssetInterfacePtr LocalAssetProvider::GetIncompleteAsset(const std::string& asset_id, const std::string& asset_type, uint received)\n{\n    \/\/ Not supported\n    return Foundation::AssetInterfacePtr();\n}\n\nbool LocalAssetProvider::QueryAssetStatus(const std::string& asset_id, uint& size, uint& received, uint& received_continuous)\n{\n    \/\/ Not supported\n    return false;\n}\n\nvoid LocalAssetProvider::Update(f64 frametime)\n{\n    \/\/\/\\note It is *very* important that below we first complete all uploads, and then the downloads.\n    \/\/\/ This is because it is a rather common code flow to upload an asset for an entity, and immediately after that\n    \/\/\/ generate a entity in the scene that refers to that asset, which means we do both an upload and a download of the\n    \/\/\/ asset into the same asset storage. If the download request was processed before the upload request, the download\n    \/\/\/ request would fail on missing file, and the entity would erroneously get an \"asset not found\" result.\n    CompletePendingFileUploads();\n    CompletePendingFileDownloads();\n}\n\nvoid LocalAssetProvider::AddStorageDirectory(const std::string &directory, const std::string &storageName, bool recursive)\n{\n    \/\/\/\\todo Check first if the given directory exists as a storage, and don't add it as a duplicate if so.\n\n    LocalAssetStoragePtr storage = LocalAssetStoragePtr(new LocalAssetStorage());\n    storage->directory = directory.c_str();\n    storage->name = storageName.c_str();\n    storage->recursive = recursive;\n    storage->provider = shared_from_this();\n    storage->SetupWatcher(); \/\/ Start listening on file change notifications.\n\/\/    connect(storage->changeWatcher, SIGNAL(directoryChanged(QString)), this, SLOT(FileChanged(QString)));\n    connect(storage->changeWatcher, SIGNAL(fileChanged(QString)), this, SLOT(FileChanged(QString)));\n\n    storages.push_back(storage);\n}\n\nstd::vector<AssetStoragePtr> LocalAssetProvider::GetStorages() const\n{\n    std::vector<AssetStoragePtr> stores;\n    for(size_t i = 0; i < storages.size(); ++i)\n        stores.push_back(storages[i]);\n    return stores;\n}\n\nIAssetUploadTransfer *LocalAssetProvider::UploadAssetFromFile(const char *filename, AssetStoragePtr destination, const char *assetName)\n{\n    LocalAssetStorage *storage = dynamic_cast<LocalAssetStorage*>(destination.get());\n    if (!storage)\n    {\n        AssetModule::LogError(\"LocalAssetProvider::UploadAssetFromFile: Invalid destination asset storage type! Was not of type LocalAssetStorage!\");\n        return 0;\n    }\n\n    AssetUploadTransferPtr transfer = AssetUploadTransferPtr(new IAssetUploadTransfer());\n    transfer->sourceFilename = filename;\n    transfer->destinationName = assetName;\n    transfer->destinationStorage = destination;\n\n    pendingUploads.push_back(transfer);\n\n    return transfer.get();\n}\n\nIAssetUploadTransfer *LocalAssetProvider::UploadAssetFromFileInMemory(const u8 *data, size_t numBytes, AssetStoragePtr destination, const char *assetName)\n{\n    assert(data);\n    if (!data)\n    {\n        AssetModule::LogError(\"LocalAssetProvider::UploadAssetFromFileInMemory: Null source data pointer passed to function!\");\n        return 0;\n    }\n\n    LocalAssetStorage *storage = dynamic_cast<LocalAssetStorage*>(destination.get());\n    if (!storage)\n    {\n        AssetModule::LogError(\"LocalAssetProvider::UploadAssetFromFileInMemory: Invalid destination asset storage type! Was not of type LocalAssetStorage!\");\n        return 0;\n    }\n\n    AssetUploadTransferPtr transfer = AssetUploadTransferPtr(new IAssetUploadTransfer());\n    transfer->sourceFilename = \"\";\n    transfer->destinationName = assetName;\n    transfer->destinationStorage = destination;\n    transfer->assetData.insert(transfer->assetData.end(), data, data + numBytes);\n\n    pendingUploads.push_back(transfer);\n\n    return transfer.get();\n}\n\nvoid LocalAssetProvider::ProcessCommandLineOptions()\n{\n    assert(framework_);\n\n    const boost::program_options::variables_map &options = framework_->ProgramOptions();\n\n    if (options.count(\"file\") > 0)\n    {\n        std::string startup_scene_ = QString(options[\"file\"].as<std::string>().c_str()).trimmed().toStdString();\n        if (!startup_scene_.empty())\n        {\n            \/\/ If scene name is expressed as a full path, add it as a recursive asset source for localassetprovider\n            boost::filesystem::path scenepath(startup_scene_);\n            std::string dirname = scenepath.branch_path().string();\n            if (!dirname.empty())\n                AddStorageDirectory(dirname, \"Scene Local\", true);\n        }\n    }\n\n    if (options.count(\"storage\") > 0)\n    {\n        std::string startup_scene_ = QString(options[\"storage\"].as<std::string>().c_str()).trimmed().toStdString();\n        if (!startup_scene_.empty())\n        {\n            \/\/ If scene name is expressed as a full path, add it as a recursive asset source for localassetprovider\n            boost::filesystem::path scenepath(startup_scene_);\n            std::string dirname = scenepath.branch_path().string();\n            if (!dirname.empty())\n                AddStorageDirectory(dirname, \"Scene Local\", true);\n        }\n    }\n}\n\nnamespace\n{\nbool CopyAsset(const char *sourceFile, const char *destFile)\n{\n    assert(sourceFile);\n    assert(destFile);\n\n    QFile asset_in(sourceFile);\n    if (!asset_in.open(QFile::ReadOnly))\n    {\n        AssetModule::LogError(\"Could not open input asset file \\\"\" + std::string(sourceFile) + \"\\\"\");\n        return false;\n    }\n\n    QByteArray bytes = asset_in.readAll();\n    asset_in.close();\n    \n    QFile asset_out(destFile);\n    if (!asset_out.open(QFile::WriteOnly))\n    {\n        AssetModule::LogError(\"Could not open output asset file \\\"\" + std::string(destFile) + \"\\\"\");\n        return false;\n    }\n\n    asset_out.write(bytes);\n    asset_out.close();\n    \n    return true;\n}\n\nbool SaveAssetFromMemoryToFile(const u8 *data, size_t numBytes, const char *destFile)\n{\n    assert(data);\n    assert(destFile);\n\n    QFile asset_out(destFile);\n    if (!asset_out.open(QFile::WriteOnly))\n    {\n        AssetModule::LogError(\"Could not open output asset file \\\"\" + std::string(destFile) + \"\\\"\");\n        return false;\n    }\n\n    asset_out.write((const char *)data, numBytes);\n    asset_out.close();\n    \n    return true;\n}\n\n} \/\/ ~unnamed namespace\n\nvoid LocalAssetProvider::CompletePendingFileDownloads()\n{\n    while(pendingDownloads.size() > 0)\n    {\n        AssetTransferPtr transfer = pendingDownloads.back();\n        pendingDownloads.pop_back();\n\n        QString ref = transfer->source.ref;\n\n        AssetModule::LogDebug(\"New local asset request: \" + ref.toStdString());\n\n        \/\/ Strip file: trims asset provider id (f.ex. 'file:\/\/') and potential mesh name inside the file (everything after last slash)\n        if (ref.startsWith(\"file:\/\/\"))\n            ref = ref.mid(7);\n        if (ref.startsWith(\"local:\/\/\"))\n            ref = ref.mid(8);\n\n        int lastSlash = ref.lastIndexOf('\/');\n        if (lastSlash != -1)\n            ref = ref.left(lastSlash);\n\n        QString path = GetPathForAsset(ref);\n        if (path.isEmpty())\n        {\n            AssetModule::LogWarning(\"Failed to find local asset with filename \\\"\" + ref.toStdString() + \"\\\"!\");\n            continue;\n        }\n    \n        QFileInfo file(GuaranteeTrailingSlash(path) + ref);\n        QString absoluteFilename = file.absoluteFilePath();\n\n        bool success = LoadFileToVector(absoluteFilename.toStdString().c_str(), transfer->rawAssetData);\n        if (!success)\n        {\n            AssetModule::LogError(\"Failed to read asset data from file \\\"\" + absoluteFilename.toStdString() + \"\\\"\");\n            continue;\n        }\n        \n        AssetModule::LogInfo(\"Loaded asset \" + absoluteFilename.toStdString());\n        transfer->EmitAssetDownloaded();\n    }\n}\n\nvoid LocalAssetProvider::CompletePendingFileUploads()\n{\n    while(pendingUploads.size() > 0)\n    {\n        AssetUploadTransferPtr transfer = pendingUploads.back();\n        pendingUploads.pop_back();\n\n        LocalAssetStorage *storage = dynamic_cast<LocalAssetStorage *>(transfer->destinationStorage.lock().get());\n        if (!storage)\n        {\n            AssetModule::LogError(\"Invalid IAssetStorage specified for file upload in LocalAssetProvider!\");\n            transfer->EmitTransferFailed();\n            continue;\n        }\n\n        if (transfer->sourceFilename.length() == 0 && transfer->assetData.size() == 0)\n        {\n            AssetModule::LogError(\"No source data present when trying to upload asset to LocalAssetProvider!\");\n            continue;\n        }\n\n        QString fromFile = transfer->sourceFilename;\n        QString toFile = GuaranteeTrailingSlash(storage->directory) + transfer->destinationName;\n\n        bool success;\n        if (fromFile.length() == 0)\n            success = SaveAssetFromMemoryToFile(&transfer->assetData[0], transfer->assetData.size(), toFile.toStdString().c_str());\n        else\n            success = CopyAsset(fromFile.toStdString().c_str(), toFile.toStdString().c_str());\n\n        if (!success)\n        {\n            AssetModule::LogError((\"Asset upload failed in LocalAssetProvider: CopyAsset from \\\"\" + fromFile + \"\\\" to \\\"\" + toFile + \"\\\" failed!\").toStdString());\n            transfer->EmitTransferFailed();\n        }\n        else\n            transfer->EmitTransferCompleted();\n    }\n}\n\nvoid LocalAssetProvider::FileChanged(const QString &path)\n{\n    AssetModule::LogInfo((\"File \" + path + \" changed.\").toStdString());\n}\n\n} \/\/ ~Asset\n<commit_msg>Temporary fix for LocalAssetProvider crash.<commit_after>\/\/ For conditions of distribution and use, see copyright notice in license.txt\n\n#include \"StableHeaders.h\"\n#include \"AssetEvents.h\"\n#include \"AssetManager.h\"\n#include \"AssetModule.h\"\n#include \"RexAsset.h\"\n#include \"RexTypes.h\"\n#include \"LocalAssetProvider.h\"\n#include \"AssetServiceInterface.h\"\n#include \"Framework.h\"\n#include \"EventManager.h\"\n#include \"ServiceManager.h\"\n#include \"ConfigurationManager.h\"\n#include \"LocalAssetStorage.h\"\n#include \"IAssetUploadTransfer.h\"\n#include \"IAssetTransfer.h\"\n#include \"AssetAPI.h\"\n#include <QByteArray>\n#include <QFile>\n#include <QFileInfo>\n#include <QFileSystemWatcher>\n\nnamespace Asset\n{\n\nLocalAssetProvider::LocalAssetProvider(Foundation::Framework* framework) :\n    framework_(framework)\n{\n    EventManagerPtr event_manager = framework_->GetEventManager();\n    event_category_ = event_manager->QueryEventCategory(\"Asset\");\n\n    ProcessCommandLineOptions();\n}\n\nLocalAssetProvider::~LocalAssetProvider()\n{\n}\n\nconst std::string& LocalAssetProvider::Name()\n{\n    static const std::string name(\"Local\");\n    \n    return name;\n}\n\nbool LocalAssetProvider::IsValidRef(const std::string& asset_id, const std::string& asset_type)\n{\n    QString ref = asset_id.c_str();\n    ref = ref.trimmed();\n    if (ref.length() == 0)\n        return false;\n    if (ref.startsWith(\"file:\/\/\") || ref.startsWith(\"local:\/\/\"))\n        return true;\n\n    if (!ref.contains(\":\/\/\")) \/\/ If the ref doesn't contain a protocol specifier (we do this simple check for it), try to directly find the given local file.\n    {\n        QString path = GetPathForAsset(ref);\n        return path.length() > 0;\n    }\n    else\n        return false;\n}\n\n\/\/\/\\todo This function call is deprecated, and used in conjunction with the old code flow for asset requests. Use the AssetAPI and\n\/\/\/ AssetTransferPtr LocalAssetProvider::RequestAsset(QString assetRef, QString assetType) instead.\nbool LocalAssetProvider::RequestAsset(const std::string& asset_id, const std::string& asset_type, request_tag_t tag)\n{\n    \/\/ Complete any file uploads before processing any download requests. (a total hack, but this function will be removed in the future)\n    CompletePendingFileUploads();\n\n    if (!IsValidRef(asset_id, asset_type))\n        return false;\n    \n    ServiceManagerPtr service_manager = framework_->GetServiceManager();\n    boost::shared_ptr<Foundation::AssetServiceInterface> asset_service =\n        service_manager->GetService<Foundation::AssetServiceInterface>(Service::ST_Asset).lock();\n    if (!asset_service)\n        return false;\n    \n    AssetModule::LogDebug(\"New local asset request for ref \\\"\" + asset_id + \"\\\"\");\n        \n    \/\/ Strip file: trims asset provider id (f.ex. 'file:\/\/') and potential mesh name inside the file (everything after last slash)\n    std::string filename = QString(asset_id.c_str()).trimmed().toStdString();\n    if (filename.find(\"file:\/\/\") != std::string::npos)\n        filename = filename.substr(7);\n    else if (filename.find(\"local:\/\/\") != std::string::npos)\n        filename = filename.substr(8);\n    size_t lastSlash = filename.find_last_of('\/');\n    if (lastSlash != std::string::npos)\n        filename = filename.substr(0, lastSlash);\n    \n    std::string assetpath = GetPathForAsset(filename.c_str()).toStdString(); \/\/ Look up all known local file asset storages for this asset.\n    if (assetpath.empty())\n    {\n        AssetModule::LogInfo(\"Failed to load local asset \\\"\" + filename + \"\\\"\");\n        return true;\n    }\n    \n    boost::filesystem::path file_path(assetpath + \"\/\" + filename);\n    std::ifstream filestr(file_path.native_directory_string().c_str(), std::ios::in | std::ios::binary);\n    if (filestr.good())\n    {\n        filestr.seekg(0, std::ios::end);\n        uint length = filestr.tellg();\n        filestr.seekg(0, std::ios::beg);\n        \n        if (length > 0)\n        {\n            RexAsset* new_asset = new RexAsset(asset_id, asset_type);\n            Foundation::AssetInterfacePtr asset_ptr(new_asset);\n            \n            RexAsset::AssetDataVector& data = new_asset->GetDataInternal();\n            data.resize(length);\n            filestr.read((char *)&data[0], length);\n            filestr.close();\n            \n            \/\/ Store to memory cache only\n            asset_service->StoreAsset(asset_ptr, false);\n            \/\/ Send asset_ready event as delayed\n            Events::AssetReady* event_data = new Events::AssetReady(asset_ptr->GetId(), asset_ptr->GetType(), asset_ptr, tag);\n            framework_->GetEventManager()->SendDelayedEvent(event_category_, Events::ASSET_READY, EventDataPtr(event_data));\n            \n            return true;\n        }\n        else\n            filestr.close();\n    }\n    \n    AssetModule::LogInfo(\"Failed to load local asset \\\"\" + filename + \"\\\"\");\n    return true;\n}\n\nAssetTransferPtr LocalAssetProvider::RequestAsset(QString assetRef, QString assetType)\n{\n    AssetTransferPtr transfer = AssetTransferPtr(new IAssetTransfer);\n    transfer->source.ref = assetRef.trimmed();\n    transfer->assetType = assetType;\n\n    pendingDownloads.push_back(transfer);\n\n    return transfer;\n}\n\nQString LocalAssetProvider::GetPathForAsset(const QString &assetname)\n{\n    \/\/ Check first all subdirs without recursion, because recursion is potentially slow\n    for(size_t i = 0; i < storages.size(); ++i)\n    {\n        QString path = storages[i]->GetFullPathForAsset(assetname.toStdString().c_str(), false);\n        if (path != \"\")\n            return path;\n    }\n\n    for(size_t i = 0; i < storages.size(); ++i)\n    {\n        QString path = storages[i]->GetFullPathForAsset(assetname.toStdString().c_str(), true);\n        if (path != \"\")\n            return path;\n    }\n    \n    return \"\";\n}\n\nbool LocalAssetProvider::InProgress(const std::string& asset_id)\n{\n    return false;\n}\n\nFoundation::AssetInterfacePtr LocalAssetProvider::GetIncompleteAsset(const std::string& asset_id, const std::string& asset_type, uint received)\n{\n    \/\/ Not supported\n    return Foundation::AssetInterfacePtr();\n}\n\nbool LocalAssetProvider::QueryAssetStatus(const std::string& asset_id, uint& size, uint& received, uint& received_continuous)\n{\n    \/\/ Not supported\n    return false;\n}\n\nvoid LocalAssetProvider::Update(f64 frametime)\n{\n    \/\/\/\\note It is *very* important that below we first complete all uploads, and then the downloads.\n    \/\/\/ This is because it is a rather common code flow to upload an asset for an entity, and immediately after that\n    \/\/\/ generate a entity in the scene that refers to that asset, which means we do both an upload and a download of the\n    \/\/\/ asset into the same asset storage. If the download request was processed before the upload request, the download\n    \/\/\/ request would fail on missing file, and the entity would erroneously get an \"asset not found\" result.\n    CompletePendingFileUploads();\n    CompletePendingFileDownloads();\n}\n\nvoid LocalAssetProvider::AddStorageDirectory(const std::string &directory, const std::string &storageName, bool recursive)\n{\n    \/\/\/\\todo Check first if the given directory exists as a storage, and don't add it as a duplicate if so.\n\n    LocalAssetStoragePtr storage = LocalAssetStoragePtr(new LocalAssetStorage());\n    storage->directory = directory.c_str();\n    storage->name = storageName.c_str();\n    storage->recursive = recursive;\n    \/\/storage->provider = shared_from_this();\n    storage->SetupWatcher(); \/\/ Start listening on file change notifications.\n\/\/    connect(storage->changeWatcher, SIGNAL(directoryChanged(QString)), this, SLOT(FileChanged(QString)));\n    connect(storage->changeWatcher, SIGNAL(fileChanged(QString)), this, SLOT(FileChanged(QString)));\n\n    storages.push_back(storage);\n}\n\nstd::vector<AssetStoragePtr> LocalAssetProvider::GetStorages() const\n{\n    std::vector<AssetStoragePtr> stores;\n    for(size_t i = 0; i < storages.size(); ++i)\n        stores.push_back(storages[i]);\n    return stores;\n}\n\nIAssetUploadTransfer *LocalAssetProvider::UploadAssetFromFile(const char *filename, AssetStoragePtr destination, const char *assetName)\n{\n    LocalAssetStorage *storage = dynamic_cast<LocalAssetStorage*>(destination.get());\n    if (!storage)\n    {\n        AssetModule::LogError(\"LocalAssetProvider::UploadAssetFromFile: Invalid destination asset storage type! Was not of type LocalAssetStorage!\");\n        return 0;\n    }\n\n    AssetUploadTransferPtr transfer = AssetUploadTransferPtr(new IAssetUploadTransfer());\n    transfer->sourceFilename = filename;\n    transfer->destinationName = assetName;\n    transfer->destinationStorage = destination;\n\n    pendingUploads.push_back(transfer);\n\n    return transfer.get();\n}\n\nIAssetUploadTransfer *LocalAssetProvider::UploadAssetFromFileInMemory(const u8 *data, size_t numBytes, AssetStoragePtr destination, const char *assetName)\n{\n    assert(data);\n    if (!data)\n    {\n        AssetModule::LogError(\"LocalAssetProvider::UploadAssetFromFileInMemory: Null source data pointer passed to function!\");\n        return 0;\n    }\n\n    LocalAssetStorage *storage = dynamic_cast<LocalAssetStorage*>(destination.get());\n    if (!storage)\n    {\n        AssetModule::LogError(\"LocalAssetProvider::UploadAssetFromFileInMemory: Invalid destination asset storage type! Was not of type LocalAssetStorage!\");\n        return 0;\n    }\n\n    AssetUploadTransferPtr transfer = AssetUploadTransferPtr(new IAssetUploadTransfer());\n    transfer->sourceFilename = \"\";\n    transfer->destinationName = assetName;\n    transfer->destinationStorage = destination;\n    transfer->assetData.insert(transfer->assetData.end(), data, data + numBytes);\n\n    pendingUploads.push_back(transfer);\n\n    return transfer.get();\n}\n\nvoid LocalAssetProvider::ProcessCommandLineOptions()\n{\n    assert(framework_);\n\n    const boost::program_options::variables_map &options = framework_->ProgramOptions();\n\n    if (options.count(\"file\") > 0)\n    {\n        std::string startup_scene_ = QString(options[\"file\"].as<std::string>().c_str()).trimmed().toStdString();\n        if (!startup_scene_.empty())\n        {\n            \/\/ If scene name is expressed as a full path, add it as a recursive asset source for localassetprovider\n            boost::filesystem::path scenepath(startup_scene_);\n            std::string dirname = scenepath.branch_path().string();\n            if (!dirname.empty())\n                AddStorageDirectory(dirname, \"Scene Local\", true);\n        }\n    }\n\n    if (options.count(\"storage\") > 0)\n    {\n        std::string startup_scene_ = QString(options[\"storage\"].as<std::string>().c_str()).trimmed().toStdString();\n        if (!startup_scene_.empty())\n        {\n            \/\/ If scene name is expressed as a full path, add it as a recursive asset source for localassetprovider\n            boost::filesystem::path scenepath(startup_scene_);\n            std::string dirname = scenepath.branch_path().string();\n            if (!dirname.empty())\n                AddStorageDirectory(dirname, \"Scene Local\", true);\n        }\n    }\n}\n\nnamespace\n{\nbool CopyAsset(const char *sourceFile, const char *destFile)\n{\n    assert(sourceFile);\n    assert(destFile);\n\n    QFile asset_in(sourceFile);\n    if (!asset_in.open(QFile::ReadOnly))\n    {\n        AssetModule::LogError(\"Could not open input asset file \\\"\" + std::string(sourceFile) + \"\\\"\");\n        return false;\n    }\n\n    QByteArray bytes = asset_in.readAll();\n    asset_in.close();\n    \n    QFile asset_out(destFile);\n    if (!asset_out.open(QFile::WriteOnly))\n    {\n        AssetModule::LogError(\"Could not open output asset file \\\"\" + std::string(destFile) + \"\\\"\");\n        return false;\n    }\n\n    asset_out.write(bytes);\n    asset_out.close();\n    \n    return true;\n}\n\nbool SaveAssetFromMemoryToFile(const u8 *data, size_t numBytes, const char *destFile)\n{\n    assert(data);\n    assert(destFile);\n\n    QFile asset_out(destFile);\n    if (!asset_out.open(QFile::WriteOnly))\n    {\n        AssetModule::LogError(\"Could not open output asset file \\\"\" + std::string(destFile) + \"\\\"\");\n        return false;\n    }\n\n    asset_out.write((const char *)data, numBytes);\n    asset_out.close();\n    \n    return true;\n}\n\n} \/\/ ~unnamed namespace\n\nvoid LocalAssetProvider::CompletePendingFileDownloads()\n{\n    while(pendingDownloads.size() > 0)\n    {\n        AssetTransferPtr transfer = pendingDownloads.back();\n        pendingDownloads.pop_back();\n\n        QString ref = transfer->source.ref;\n\n        AssetModule::LogDebug(\"New local asset request: \" + ref.toStdString());\n\n        \/\/ Strip file: trims asset provider id (f.ex. 'file:\/\/') and potential mesh name inside the file (everything after last slash)\n        if (ref.startsWith(\"file:\/\/\"))\n            ref = ref.mid(7);\n        if (ref.startsWith(\"local:\/\/\"))\n            ref = ref.mid(8);\n\n        int lastSlash = ref.lastIndexOf('\/');\n        if (lastSlash != -1)\n            ref = ref.left(lastSlash);\n\n        QString path = GetPathForAsset(ref);\n        if (path.isEmpty())\n        {\n            AssetModule::LogWarning(\"Failed to find local asset with filename \\\"\" + ref.toStdString() + \"\\\"!\");\n            continue;\n        }\n    \n        QFileInfo file(GuaranteeTrailingSlash(path) + ref);\n        QString absoluteFilename = file.absoluteFilePath();\n\n        bool success = LoadFileToVector(absoluteFilename.toStdString().c_str(), transfer->rawAssetData);\n        if (!success)\n        {\n            AssetModule::LogError(\"Failed to read asset data from file \\\"\" + absoluteFilename.toStdString() + \"\\\"\");\n            continue;\n        }\n        \n        AssetModule::LogInfo(\"Loaded asset \" + absoluteFilename.toStdString());\n        transfer->EmitAssetDownloaded();\n    }\n}\n\nvoid LocalAssetProvider::CompletePendingFileUploads()\n{\n    while(pendingUploads.size() > 0)\n    {\n        AssetUploadTransferPtr transfer = pendingUploads.back();\n        pendingUploads.pop_back();\n\n        LocalAssetStorage *storage = dynamic_cast<LocalAssetStorage *>(transfer->destinationStorage.lock().get());\n        if (!storage)\n        {\n            AssetModule::LogError(\"Invalid IAssetStorage specified for file upload in LocalAssetProvider!\");\n            transfer->EmitTransferFailed();\n            continue;\n        }\n\n        if (transfer->sourceFilename.length() == 0 && transfer->assetData.size() == 0)\n        {\n            AssetModule::LogError(\"No source data present when trying to upload asset to LocalAssetProvider!\");\n            continue;\n        }\n\n        QString fromFile = transfer->sourceFilename;\n        QString toFile = GuaranteeTrailingSlash(storage->directory) + transfer->destinationName;\n\n        bool success;\n        if (fromFile.length() == 0)\n            success = SaveAssetFromMemoryToFile(&transfer->assetData[0], transfer->assetData.size(), toFile.toStdString().c_str());\n        else\n            success = CopyAsset(fromFile.toStdString().c_str(), toFile.toStdString().c_str());\n\n        if (!success)\n        {\n            AssetModule::LogError((\"Asset upload failed in LocalAssetProvider: CopyAsset from \\\"\" + fromFile + \"\\\" to \\\"\" + toFile + \"\\\" failed!\").toStdString());\n            transfer->EmitTransferFailed();\n        }\n        else\n            transfer->EmitTransferCompleted();\n    }\n}\n\nvoid LocalAssetProvider::FileChanged(const QString &path)\n{\n    AssetModule::LogInfo((\"File \" + path + \" changed.\").toStdString());\n}\n\n} \/\/ ~Asset\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    int i;\n    int len;\n    int i2;\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    len = recipeScopes.size();\n    printf(\"There are %d recipes\\n\", len);\n    for (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        printf(\"\\nRecipe \\\"%s\\\":\\n\", name);\n        int len2 = ingredients.size();\n        printf(\"\\tThis recipe has %d ingredients:\\n\", len2);\n        for (i2 = 0; i2 < len2; i2++)\n        {\n            printf(\"\\t\\t\\\"%s\\\"\\n\", ingredients[i2].c_str());\n        }\n        len2 = steps.size();\n        printf(\"\\tThis recipe has %d steps:\\n\", len2);\n        for (i2 = 0; i2 < len2; i2++)\n        {\n            printf(\"\\t\\t\\\"%s\\\"\\n\", steps[i2].c_str());\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    fprintf(stderr,\n        \"\\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>Refactoring.<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 <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<|endoftext|>"}
{"text":"<commit_before>#ifndef DUNE_DETAILED_SOLVERS_LINEARELLIPTIC_MODEL_AFFINEPARAMETRIC_THERMALBLOCK_HH\n#define DUNE_DETAILED_SOLVERS_LINEARELLIPTIC_MODEL_AFFINEPARAMETRIC_THERMALBLOCK_HH\n\n#include <memory>\n#include <vector>\n\n#include <dune\/stuff\/common\/parameter\/tree.hh>\n#include <dune\/stuff\/common\/string.hh>\n#include <dune\/stuff\/function\/affineparametric\/checkerboard.hh>\n#include <dune\/stuff\/function.hh>\n\n#include \"..\/default.hh\"\n#include \"default.hh\"\n\nnamespace Dune {\nnamespace DetailedSolvers {\nnamespace LinearElliptic {\n\n\n\/\/ forward, to allow for specialization\ntemplate< class DomainFieldImp, int domainDim, class RangeFieldImp, int rangeDim >\nclass ModelAffineParametricThermalblock;\n\n\ntemplate< class DomainFieldImp, int domainDim, class RangeFieldImp >\nclass ModelAffineParametricThermalblock< DomainFieldImp, domainDim, RangeFieldImp, 1 >\n  : public ModelAffineParametricDefault< DomainFieldImp, domainDim, RangeFieldImp, 1 >\n{\npublic:\n  typedef ModelAffineParametricThermalblock< DomainFieldImp, domainDim, RangeFieldImp, 1 > ThisType;\n  typedef ModelAffineParametricDefault< DomainFieldImp, domainDim, RangeFieldImp, 1 >      BaseType;\n\n  typedef typename BaseType::DomainFieldType  DomainFieldType;\n  static const int                            dimDomain = BaseType::dimDomain;\n  typedef typename BaseType::RangeFieldType   RangeFieldType;\n  static const int                            dimRange = BaseType::dimRange;\n  typedef typename BaseType::ParamFieldType   ParamFieldType;\n  static const int                            maxParamDim = BaseType::maxParamDim;\n\n  typedef typename Dune::Stuff::FunctionAffineParametricCheckerboard< DomainFieldType, dimDomain,\n                                                                      RangeFieldType, dimRange >\n                                          CheckerboardFunctionType;\n  typedef typename BaseType::FunctionType FunctionType;\n\n  static const std::string id()\n  {\n    return BaseType::BaseType::id() + \".affineparametric.thermalblock\";\n  }\n\n  ModelAffineParametricThermalblock(const Dune::shared_ptr< const CheckerboardFunctionType > _diffusion,\n                                    const Dune::shared_ptr< const FunctionType > _force,\n                                    const Dune::shared_ptr< const FunctionType > _dirichlet,\n                                    const Dune::shared_ptr< const FunctionType > _neumann)\n    : BaseType(_diffusion, _force, _dirichlet, _neumann)\n  {}\n\n  ModelAffineParametricThermalblock(const ThisType& other)\n    : BaseType(other.diffusion(),\n               other.force(),\n               other.dirichlet(),\n               other.neumann())\n  {}\n\n  ThisType& operator=(const ThisType& other)\n  {\n    if (this != &other) {\n      BaseType::operator=(other);\n    }\n    return *this;\n  }\n\n  static Dune::ParameterTree createSampleDescription(const std::string subName = \"\")\n  {\n    Dune::Stuff::Common::ExtendedParameterTree description;\n    description.add(Dune::Stuff::Functions< DomainFieldType, dimDomain,\n                                            RangeFieldType, dimRange >::createSampleDescription(\"function.affineparametric.checkerboard\"),\n                    \"diffusion\");\n    description[\"diffusion.name\"] = \"diffusion\";\n    description.add(Dune::Stuff::Functions< DomainFieldType, dimDomain,\n                                            RangeFieldType, dimRange >::createSampleDescription(\"function.expression\"),\n                    \"force\");\n    description[\"force.name\"] = \"force\";\n    description[\"force.expression\"] = \"1.0\";\n    description[\"force.order\"] = \"0\";\n    description.add(Dune::Stuff::Functions< DomainFieldType, dimDomain,\n                                            RangeFieldType, dimRange >::createSampleDescription(\"function.expression\"),\n                    \"neumann\");\n    description[\"neumann.name\"] = \"neumann\";\n    description[\"neumann.expression\"] = \"0.1\";\n    description[\"neumann.order\"] = \"0\";\n    description.add(Dune::Stuff::Functions< DomainFieldType, dimDomain,\n                                            RangeFieldType, dimRange >::createSampleDescription(\"function.expression\"),\n                    \"dirichlet\");\n    description[\"dirichlet.name\"] = \"dirichlet\";\n    description[\"dirichlet.expression\"] = \"0.1*x[0]\";\n    description[\"dirichlet.order\"] = \"1\";\n    if (subName.empty())\n      return description;\n    else {\n      Dune::Stuff::Common::ExtendedParameterTree extendedDescription;\n      extendedDescription.add(description, subName);\n      return extendedDescription;\n    }\n  }\n\n  static ThisType* create(const Dune::ParameterTree& _description, const std::string _subName = id())\n  {\n    \/\/ get correct description\n    typedef Stuff::Common::ExtendedParameterTree DescriptionType;\n    DescriptionType description;\n    if (_description.hasSub(_subName))\n      description = _description.sub(_subName);\n    else\n      description = _description;\n    \/\/ create the checkerboard diffusion\n    DescriptionType diffusionDescription = description.sub(\"diffusion\");\n    diffusionDescription[\"diffusion.name\"] = \"checkerboard diffusion\";\n    const shared_ptr< const CheckerboardFunctionType >\n        diffusion(CheckerboardFunctionType::create(diffusionDescription));\n    \/\/ create the rest of the functions\n    \/\/   * therefore create a fake diffusion subdescription,\n    description.sub(\"diffusion\") = CheckerboardFunctionType::createSampleDescription();\n    description[\"diffusion.type\"] = \"function.affineparametric.checkerboard\";\n    description[\"diffusion.name\"] = \"checkerboard diffusion\";\n    \/\/   * create a default model\n    const std::shared_ptr< const BaseType > baseModel(BaseType::create(description));\n    \/\/ create and return\n    return new ThisType(diffusion,\n                        baseModel->force(),\n                        baseModel->dirichlet(),\n                        baseModel->neumann());\n  } \/\/ static ThisType createFromParamTree(const Dune::ParameterTree& paramTree, const std::string subName = id())\n}; \/\/ class ModelAffineParametricThermalblock\n\n\n} \/\/ namespace LinearElliptic\n} \/\/ namespace DetailedSolvers\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_DETAILED_SOLVERS_LINEARELLIPTIC_MODEL_AFFINEPARAMETRIC_THERMALBLOCK_HH\n<commit_msg>[linearelliptic.model.affineparametric.thermalblock] updated to new layout<commit_after>#ifndef DUNE_DETAILED_SOLVERS_LINEARELLIPTIC_MODEL_AFFINEPARAMETRIC_THERMALBLOCK_HH\n#define DUNE_DETAILED_SOLVERS_LINEARELLIPTIC_MODEL_AFFINEPARAMETRIC_THERMALBLOCK_HH\n\n#include <memory>\n#include <vector>\n\n#include <dune\/stuff\/common\/parameter\/tree.hh>\n#include <dune\/stuff\/common\/string.hh>\n#include <dune\/stuff\/function\/affineparametric\/checkerboard.hh>\n#include <dune\/stuff\/function.hh>\n\n#include \"..\/default.hh\"\n#include \"default.hh\"\n\nnamespace Dune {\nnamespace DetailedSolvers {\nnamespace LinearElliptic {\n\n\n\/\/ forward, to allow for specialization\ntemplate< class DomainFieldImp, int domainDim, class RangeFieldImp, int rangeDim, bool scalarDiffusion = true >\nclass ModelAffineParametricThermalblock;\n\n\ntemplate< class DomainFieldImp, int domainDim, class RangeFieldImp >\nclass ModelAffineParametricThermalblock< DomainFieldImp, domainDim, RangeFieldImp, 1, true >\n  : public ModelAffineParametricDefault< DomainFieldImp, domainDim, RangeFieldImp, 1, true >\n{\n  typedef ModelAffineParametricDefault< DomainFieldImp, domainDim, RangeFieldImp, 1, true >       BaseType;\npublic:\n  typedef ModelAffineParametricThermalblock< DomainFieldImp, domainDim, RangeFieldImp, 1, true >  ThisType;\n\n  typedef typename BaseType::DomainFieldType  DomainFieldType;\n  static const int                            dimDomain = BaseType::dimDomain;\n  typedef typename BaseType::RangeFieldType   RangeFieldType;\n  static const int                            dimRange = BaseType::dimRange;\n  typedef typename BaseType::ParamFieldType   ParamFieldType;\n  static const int                            maxParamDim = BaseType::maxParamDim;\n\n  typedef typename Dune::Stuff::AffineParametricFunctionCheckerboard< DomainFieldType, dimDomain,\n                                                                      RangeFieldType, dimRange >\n                                          CheckerboardFunctionType;\n  typedef typename BaseType::ForceType      ForceType;\n  typedef typename BaseType::DirichletType  DirichletType;\n  typedef typename BaseType::NeumannType    NeumannType;\n\n  static const std::string id()\n  {\n    return BaseType::BaseType::id() + \".affineparametric.thermalblock\";\n  }\n\n  ModelAffineParametricThermalblock(const Dune::shared_ptr< const CheckerboardFunctionType > _diffusion,\n                                    const Dune::shared_ptr< const ForceType > _force,\n                                    const Dune::shared_ptr< const DirichletType > _dirichlet,\n                                    const Dune::shared_ptr< const NeumannType > _neumann)\n    : BaseType(_diffusion, _force, _dirichlet, _neumann)\n  {}\n\n  static Dune::ParameterTree defaultSettings(const std::string subName = \"\")\n  {\n    Dune::Stuff::Common::ExtendedParameterTree description;\n    description.add(Dune::Stuff::AffineParametricFunctions< DomainFieldType, dimDomain,\n                                                            RangeFieldType, dimRange >::defaultSettings(\"function.affineparametric.checkerboard\"),\n                    \"diffusion\");\n    description[\"diffusion.name\"] = \"diffusion\";\n    description.add(Dune::Stuff::Functions< DomainFieldType, dimDomain,\n                                            RangeFieldType, dimRange >::defaultSettings(\"function.expression\"),\n                    \"force\");\n    description[\"force.name\"] = \"force\";\n    description[\"force.expression\"] = \"1.0\";\n    description[\"force.order\"] = \"0\";\n    description.add(Dune::Stuff::Functions< DomainFieldType, dimDomain,\n                                            RangeFieldType, dimRange >::defaultSettings(\"function.expression\"),\n                    \"neumann\");\n    description[\"neumann.name\"] = \"neumann\";\n    description[\"neumann.expression\"] = \"0.1\";\n    description[\"neumann.order\"] = \"0\";\n    description.add(Dune::Stuff::Functions< DomainFieldType, dimDomain,\n                                            RangeFieldType, dimRange >::defaultSettings(\"function.expression\"),\n                    \"dirichlet\");\n    description[\"dirichlet.name\"] = \"dirichlet\";\n    description[\"dirichlet.expression\"] = \"0.1*x[0]\";\n    description[\"dirichlet.order\"] = \"1\";\n    if (subName.empty())\n      return description;\n    else {\n      Dune::Stuff::Common::ExtendedParameterTree extendedDescription;\n      extendedDescription.add(description, subName);\n      return extendedDescription;\n    }\n  } \/\/ ... defaultSettings(...)\n\n  static ThisType* create(const Dune::ParameterTree& _settings, const std::string _subName = id())\n  {\n    \/\/ get correct settings\n    typedef Stuff::Common::ExtendedParameterTree SettingsType;\n    SettingsType settings;\n    if (_settings.hasSub(_subName))\n      settings = _settings.sub(_subName);\n    else\n      settings = _settings;\n    \/\/ create the checkerboard diffusion\n    SettingsType diffusionSettings = settings.sub(\"diffusion\");\n    diffusionSettings[\"diffusion.name\"] = \"checkerboard diffusion\";\n    const shared_ptr< const CheckerboardFunctionType >\n        diffusion(CheckerboardFunctionType::create(diffusionSettings));\n    \/\/ create the rest of the functions\n    \/\/   * therefore create a fake diffusion subSettings,\n    settings.sub(\"diffusion\") = CheckerboardFunctionType::defaultSettings();\n    settings[\"diffusion.type\"] = \"function.affineparametric.checkerboard\";\n    settings[\"diffusion.name\"] = \"checkerboard diffusion\";\n    \/\/   * create a default model\n    const std::shared_ptr< const BaseType > baseModel(BaseType::create(settings));\n    \/\/ create and return\n    return new ThisType(diffusion,\n                        baseModel->force(),\n                        baseModel->dirichlet(),\n                        baseModel->neumann());\n  } \/\/ static ThisType create(...)\n}; \/\/ class ModelAffineParametricThermalblock\n\n\n} \/\/ namespace LinearElliptic\n} \/\/ namespace DetailedSolvers\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_DETAILED_SOLVERS_LINEARELLIPTIC_MODEL_AFFINEPARAMETRIC_THERMALBLOCK_HH\n<|endoftext|>"}
{"text":"<commit_before>#include <tchar.h>\r\n\r\n#pragma once\r\n\r\nTCHAR szMitLicenseRaw[]=_T(\"\\n\\\r\nThe MIT License(MIT)(redefined)\\n\\\r\n\\n\\\r\nCopyright(c) 2016 Too-Naive E-mail:sweheartiii@hotmail.com\\n\\\r\n\\n\\\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\\r\nof this software and associated documentation files(the \\\"Software\\\"), to deal\\n\\\r\nin the Software without restriction, including without limitation the rights\\n\\\r\nto use, copy, modify, merge, publish, distribute, and to permit persons to \\n\\\r\nwhom the Software is furnished to do so, BUT DO NOT SUBLICENSE, AND \/ OR SELL\\n\\\r\nOF THE SOFTWARE,subject to the following conditions :\\n\\\r\n\\n\\\r\nThe above copyright notice and this permission notice shall be included in\\n\\\r\nall copies or substantial portions of the Software.\\n\\\r\n\\n\\\r\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\\n\\\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\\n\\\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\\n\\\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\\n\\\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\\n\\\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\\n\\\r\nSOFTWARE.\\n\\\r\n\");\r\n<commit_msg>Fix eoln.<commit_after>#include <tchar.h>\n\n#pragma once\n\nTCHAR szMitLicenseRaw[]=_T(\"\\n\\\nThe MIT License(MIT)(redefined)\\n\\\n\\n\\\nCopyright(c) 2016 Too-Naive E-mail:sweheartiii@hotmail.com\\n\\\n\\n\\\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\\nof this software and associated documentation files(the \\\"Software\\\"), to deal\\n\\\nin the Software without restriction, including without limitation the rights\\n\\\nto use, copy, modify, merge, publish, distribute, and to permit persons to \\n\\\nwhom the Software is furnished to do so, BUT DO NOT SUBLICENSE, AND \/ OR SELL\\n\\\nOF THE SOFTWARE,subject to the following conditions :\\n\\\n\\n\\\nThe above copyright notice and this permission notice shall be included in\\n\\\nall copies or substantial portions of the Software.\\n\\\n\\n\\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\\n\\\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\\n\\\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\\n\\\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\\n\\\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\\n\\\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\\n\\\nSOFTWARE.\\n\\\n\");\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2008, Google Inc.\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/    * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/    * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following disclaimer\n\/\/ in the documentation and\/or other materials provided with the\n\/\/ distribution.\n\/\/    * Neither the name of Google Inc. nor the names of its\n\/\/ contributors may be used to endorse or promote products derived from\n\/\/ this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include \"chrome\/app\/breakpad.h\"\n\n#include <windows.h>\n#include <process.h>\n#include <tchar.h>\n\n#include \"base\/base_switches.h\"\n#include \"base\/command_line.h\"\n#include \"base\/file_util.h\"\n#include \"base\/file_version_info.h\"\n#include \"base\/registry.h\"\n#include \"base\/string_util.h\"\n#include \"base\/win_util.h\"\n#include \"chrome\/app\/google_update_client.h\"\n#include \"chrome\/app\/google_update_settings.h\"\n#include \"breakpad\/src\/client\/windows\/handler\/exception_handler.h\"\n\nnamespace {\n\nconst wchar_t kGoogleUpdatePipeName[] = L\"\\\\\\\\.\\\\pipe\\\\GoogleCrashServices\\\\\";\nconst wchar_t kChromePipeName[] = L\"\\\\\\\\.\\\\pipe\\\\ChromeCrashServices\";\n\ngoogle_breakpad::ExceptionHandler* g_breakpad = NULL;\n\n\/\/ Dumps the current process memory.\n extern \"C\" void __declspec(dllexport) __cdecl DumpProcess() {\n  if (g_breakpad)\n    g_breakpad->WriteMinidump();\n}\n\n\/\/ Returns the custom info structure based on the dll in parameter and the\n\/\/ process type.\nstatic google_breakpad::CustomClientInfo* custom_info = NULL;\ngoogle_breakpad::CustomClientInfo* GetCustomInfo(const std::wstring& dll_path,\n                                                 const std::wstring& type) {\n  scoped_ptr<FileVersionInfo>\n      version_info(FileVersionInfo::CreateFileVersionInfo(dll_path));\n\n  std::wstring version, product;\n  if (version_info.get()) {\n    \/\/ Get the information from the file.\n    product = version_info->product_short_name();\n    version = version_info->product_version();\n    if (!version_info->is_official_build())\n      version.append(L\"-devel\");\n  } else {\n    \/\/ No version info found. Make up the values.\n     product = L\"Chrome\";\n     version = L\"0.0.0.0-devel\";\n  }\n\n  static google_breakpad::CustomInfoEntry ver_entry(L\"ver\", version.c_str());\n  static google_breakpad::CustomInfoEntry prod_entry(L\"prod\", product.c_str());\n  static google_breakpad::CustomInfoEntry plat_entry(L\"plat\", L\"Win32\");\n  static google_breakpad::CustomInfoEntry type_entry(L\"ptype\", type.c_str());\n  static google_breakpad::CustomInfoEntry entries[] = {ver_entry,\n                                                       prod_entry,\n                                                       plat_entry,\n                                                       type_entry};\n\n  static google_breakpad::CustomClientInfo custom_info = {entries,\n                                                          arraysize(entries)};\n\n  return &custom_info;\n}\n\n\/\/ Contains the information needed by the worker thread.\nstruct CrashReporterInfo {\n  google_breakpad::CustomClientInfo* custom_info;\n  std::wstring dll_path;\n  std::wstring process_type;\n};\n\n\/\/ Environment variable name that has the actual dialog strings.\nconst wchar_t kEnvRestartInfo[] = L\"CHROME_RESTART\";\n\/\/ If this environment variable is present, chrome has crashed.\nconst wchar_t kEnvShowRestart[] = L\"CHROME_CRASHED\";\n\/\/ The following two names correspond to the text directionality for the\n\/\/ current locale.\nconst wchar_t kRtlLocaleDirection[] = L\"RIGHT_TO_LEFT\";\nconst wchar_t kLtrLocaleDirection[] = L\"LEFT_TO_RIGHT\";\n\n\/\/ This callback is executed when the browser process has crashed, after\n\/\/ the crash dump has been created. We need to minimize the amount of work\n\/\/ done here since we have potentially corrupted process. Our job is to\n\/\/ spawn another instance of chrome which will show a 'chrome has crashed'\n\/\/ dialog. This code needs to live in the exe and thus has no access to\n\/\/ facilities such as the i18n helpers.\nbool DumpDoneCallback(const wchar_t*, const wchar_t*, void*,\n                      EXCEPTION_POINTERS* ex_info,\n                      MDRawAssertionInfo*, bool) {\n  \/\/ We set CHROME_CRASHED env var. If the CHROME_RESTART is present.\n  \/\/ This signals the child process to show the 'chrome has crashed' dialog.\n  if (!::GetEnvironmentVariableW(kEnvRestartInfo, NULL, 0))\n    return true;\n  ::SetEnvironmentVariableW(kEnvShowRestart, L\"1\");\n  \/\/ Now we just start chrome browser with the same command line.\n  STARTUPINFOW si = {sizeof(si)};\n  PROCESS_INFORMATION pi;\n  if (::CreateProcessW(NULL, ::GetCommandLineW(), NULL, NULL, FALSE,\n                       CREATE_UNICODE_ENVIRONMENT, NULL, NULL, &si, &pi)) {\n    ::CloseHandle(pi.hProcess);\n    ::CloseHandle(pi.hThread);\n  }\n  \/\/ After this return we will be terminated. The actual return value is\n  \/\/ not used at all.\n  return true;\n}\n\n\/\/ Previous unhandled filter. Will be called if not null when we\n\/\/ intercept a crash.\nLPTOP_LEVEL_EXCEPTION_FILTER previous_filter = NULL;\n\n\/\/ Exception filter used when breakpad is not enabled. We just display\n\/\/ the \"Do you want to restart\" message and then we call the previous filter.\nlong WINAPI ChromeExceptionFilter(EXCEPTION_POINTERS* info) {\n  DumpDoneCallback(NULL, NULL, NULL, info, NULL, false);\n\n  if (previous_filter)\n    return previous_filter(info);\n\n  return EXCEPTION_EXECUTE_HANDLER;\n}\n\n}  \/\/ namespace\n\n\/\/ This function is executed by the child process that DumpDoneCallback()\n\/\/ spawned and basically just shows the 'chrome has crashed' dialog if\n\/\/ the CHROME_CRASHED environment variable is present.\nbool ShowRestartDialogIfCrashed(bool* exit_now) {\n  if (!::GetEnvironmentVariableW(kEnvShowRestart, NULL, 0))\n    return false;\n  DWORD len = ::GetEnvironmentVariableW(kEnvRestartInfo, NULL, 0);\n  if (!len)\n    return false;\n  wchar_t* restart_data = new wchar_t[len + 1];\n  ::GetEnvironmentVariableW(kEnvRestartInfo, restart_data, len);\n  restart_data[len] = 0;\n  \/\/ The CHROME_RESTART var contains the dialog strings separated by '|'.\n  \/\/ See PrepareRestartOnCrashEnviroment() function for details.\n  std::vector<std::wstring> dlg_strings;\n  SplitString(restart_data, L'|', &dlg_strings);\n  delete[] restart_data;\n  if (dlg_strings.size() < 3)\n    return false;\n\n  \/\/ If the UI layout is right-to-left, we need to pass the appropriate MB_XXX\n  \/\/ flags so that an RTL message box is displayed.\n  UINT flags = MB_OKCANCEL | MB_ICONWARNING;\n  if (dlg_strings[2] == kRtlLocaleDirection)\n    flags |= MB_RIGHT | MB_RTLREADING;\n\n  \/\/ Show the dialog now. It is ok if another chrome is started by the\n  \/\/ user since we have not initialized the databases.\n  *exit_now = (IDOK != ::MessageBoxW(NULL, dlg_strings[1].c_str(),\n                                     dlg_strings[0].c_str(), flags));\n  return true;\n}\n\nunsigned __stdcall InitCrashReporterThread(void* param)  {\n  CrashReporterInfo* info = reinterpret_cast<CrashReporterInfo*>(param);\n\n  CommandLine command;\n  bool full_dump = command.HasSwitch(switches::kFullMemoryCrashReport);\n  bool use_crash_service = command.HasSwitch(switches::kNoErrorDialogs) ||\n                           GetEnvironmentVariable(L\"CHROME_HEADLESS\", NULL, 0);\n\n  google_breakpad::ExceptionHandler::MinidumpCallback callback = NULL;\n\n  if (info->process_type == L\"browser\") {\n    \/\/ We install the post-dump callback only for the browser process. It\n    \/\/ spawns a new browser process.\n    callback = &DumpDoneCallback;\n  }\n\n  std::wstring pipe_name;\n  if (use_crash_service) {\n    pipe_name = kChromePipeName;\n  } else {\n    \/\/ We want to use the Google Update crash reporting. We need to check if the\n    \/\/ user allows it first.\n    if (!GoogleUpdateSettings::GetCollectStatsConsent()) {\n      \/\/ The user did not allow Google Update to send crashes, we need to use\n      \/\/ our default crash handler instead.\n      InitDefaultCrashCallback();\n      return 0;\n    }\n\n    \/\/ Build the pipe name.\n    std::wstring user_sid;\n    if (!win_util::GetUserSidString(&user_sid)) {\n      delete info;\n      return -1;\n    }\n\n    pipe_name = kGoogleUpdatePipeName;\n    pipe_name += user_sid;\n  }\n\n  \/\/ Get the alternate dump directory. We use the temp path.\n  wchar_t temp_dir[MAX_PATH] = {0};\n  ::GetTempPathW(MAX_PATH, temp_dir);\n\n  MINIDUMP_TYPE dump_type = full_dump ? MiniDumpWithFullMemory : MiniDumpNormal;\n\n  g_breakpad = new google_breakpad::ExceptionHandler(temp_dir, NULL, callback,\n                   NULL, google_breakpad::ExceptionHandler::HANDLER_ALL,\n                   dump_type, pipe_name.c_str(), info->custom_info);\n\n  \/\/ Tells breakpad to handle breakpoint and single step exceptions.\n  \/\/ This might break JIT debuggers, but at least it will always\n  \/\/ generate a crashdump for these exceptions.\n  g_breakpad->set_handle_debug_exceptions(true);\n\n  delete info;\n\n  return 0;\n}\n\nvoid InitDefaultCrashCallback() {\n  previous_filter = SetUnhandledExceptionFilter(ChromeExceptionFilter);\n}\n\nvoid InitCrashReporter(std::wstring dll_path) {\n  CommandLine command;\n  if (!command.HasSwitch(switches::kDisableBreakpad)) {\n    \/\/ Disable the message box for assertions.\n    _CrtSetReportMode(_CRT_ASSERT, 0);\n\n    \/\/ Query the custom_info now because if we do it in the thread it's going to\n    \/\/ fail in the sandbox. The thread will delete this object.\n    CrashReporterInfo* info = new CrashReporterInfo;\n    info->process_type = command.GetSwitchValue(switches::kProcessType);\n    if (info->process_type.empty())\n      info->process_type = L\"browser\";\n\n    info->custom_info = GetCustomInfo(dll_path, info->process_type);\n    info->dll_path = dll_path;\n\n    \/\/ If this is not the browser, we can't be sure that we will be able to\n    \/\/ initialize the crash_handler in another thread, so we run it right away.\n    \/\/ This is important to keep the thread for the browser process because\n    \/\/ it may take some times to initialize the crash_service process.\n    if (info->process_type != L\"browser\") {\n      InitCrashReporterThread(info);\n    } else {\n      uintptr_t thread = _beginthreadex(NULL, 0, &InitCrashReporterThread,\n                                        info, 0, NULL);\n      HANDLE thread_handle = reinterpret_cast<HANDLE>(thread);\n      if (thread_handle != INVALID_HANDLE_VALUE)\n        ::CloseHandle(thread_handle);\n    }\n  }\n}\n<commit_msg>We should not initialize the crash callback for non-browser processes since it's used only to display the \"Whoa, chrome has crashed\".<commit_after>\/\/ Copyright 2008, Google Inc.\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/    * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/    * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following disclaimer\n\/\/ in the documentation and\/or other materials provided with the\n\/\/ distribution.\n\/\/    * Neither the name of Google Inc. nor the names of its\n\/\/ contributors may be used to endorse or promote products derived from\n\/\/ this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include \"chrome\/app\/breakpad.h\"\n\n#include <windows.h>\n#include <process.h>\n#include <tchar.h>\n\n#include \"base\/base_switches.h\"\n#include \"base\/command_line.h\"\n#include \"base\/file_util.h\"\n#include \"base\/file_version_info.h\"\n#include \"base\/registry.h\"\n#include \"base\/string_util.h\"\n#include \"base\/win_util.h\"\n#include \"chrome\/app\/google_update_client.h\"\n#include \"chrome\/app\/google_update_settings.h\"\n#include \"breakpad\/src\/client\/windows\/handler\/exception_handler.h\"\n\nnamespace {\n\nconst wchar_t kGoogleUpdatePipeName[] = L\"\\\\\\\\.\\\\pipe\\\\GoogleCrashServices\\\\\";\nconst wchar_t kChromePipeName[] = L\"\\\\\\\\.\\\\pipe\\\\ChromeCrashServices\";\n\ngoogle_breakpad::ExceptionHandler* g_breakpad = NULL;\n\n\/\/ Dumps the current process memory.\n extern \"C\" void __declspec(dllexport) __cdecl DumpProcess() {\n  if (g_breakpad)\n    g_breakpad->WriteMinidump();\n}\n\n\/\/ Returns the custom info structure based on the dll in parameter and the\n\/\/ process type.\nstatic google_breakpad::CustomClientInfo* custom_info = NULL;\ngoogle_breakpad::CustomClientInfo* GetCustomInfo(const std::wstring& dll_path,\n                                                 const std::wstring& type) {\n  scoped_ptr<FileVersionInfo>\n      version_info(FileVersionInfo::CreateFileVersionInfo(dll_path));\n\n  std::wstring version, product;\n  if (version_info.get()) {\n    \/\/ Get the information from the file.\n    product = version_info->product_short_name();\n    version = version_info->product_version();\n    if (!version_info->is_official_build())\n      version.append(L\"-devel\");\n  } else {\n    \/\/ No version info found. Make up the values.\n     product = L\"Chrome\";\n     version = L\"0.0.0.0-devel\";\n  }\n\n  static google_breakpad::CustomInfoEntry ver_entry(L\"ver\", version.c_str());\n  static google_breakpad::CustomInfoEntry prod_entry(L\"prod\", product.c_str());\n  static google_breakpad::CustomInfoEntry plat_entry(L\"plat\", L\"Win32\");\n  static google_breakpad::CustomInfoEntry type_entry(L\"ptype\", type.c_str());\n  static google_breakpad::CustomInfoEntry entries[] = {ver_entry,\n                                                       prod_entry,\n                                                       plat_entry,\n                                                       type_entry};\n\n  static google_breakpad::CustomClientInfo custom_info = {entries,\n                                                          arraysize(entries)};\n\n  return &custom_info;\n}\n\n\/\/ Contains the information needed by the worker thread.\nstruct CrashReporterInfo {\n  google_breakpad::CustomClientInfo* custom_info;\n  std::wstring dll_path;\n  std::wstring process_type;\n};\n\n\/\/ Environment variable name that has the actual dialog strings.\nconst wchar_t kEnvRestartInfo[] = L\"CHROME_RESTART\";\n\/\/ If this environment variable is present, chrome has crashed.\nconst wchar_t kEnvShowRestart[] = L\"CHROME_CRASHED\";\n\/\/ The following two names correspond to the text directionality for the\n\/\/ current locale.\nconst wchar_t kRtlLocaleDirection[] = L\"RIGHT_TO_LEFT\";\nconst wchar_t kLtrLocaleDirection[] = L\"LEFT_TO_RIGHT\";\n\n\/\/ This callback is executed when the browser process has crashed, after\n\/\/ the crash dump has been created. We need to minimize the amount of work\n\/\/ done here since we have potentially corrupted process. Our job is to\n\/\/ spawn another instance of chrome which will show a 'chrome has crashed'\n\/\/ dialog. This code needs to live in the exe and thus has no access to\n\/\/ facilities such as the i18n helpers.\nbool DumpDoneCallback(const wchar_t*, const wchar_t*, void*,\n                      EXCEPTION_POINTERS* ex_info,\n                      MDRawAssertionInfo*, bool) {\n  \/\/ We set CHROME_CRASHED env var. If the CHROME_RESTART is present.\n  \/\/ This signals the child process to show the 'chrome has crashed' dialog.\n  if (!::GetEnvironmentVariableW(kEnvRestartInfo, NULL, 0))\n    return true;\n  ::SetEnvironmentVariableW(kEnvShowRestart, L\"1\");\n  \/\/ Now we just start chrome browser with the same command line.\n  STARTUPINFOW si = {sizeof(si)};\n  PROCESS_INFORMATION pi;\n  if (::CreateProcessW(NULL, ::GetCommandLineW(), NULL, NULL, FALSE,\n                       CREATE_UNICODE_ENVIRONMENT, NULL, NULL, &si, &pi)) {\n    ::CloseHandle(pi.hProcess);\n    ::CloseHandle(pi.hThread);\n  }\n  \/\/ After this return we will be terminated. The actual return value is\n  \/\/ not used at all.\n  return true;\n}\n\n\/\/ Previous unhandled filter. Will be called if not null when we\n\/\/ intercept a crash.\nLPTOP_LEVEL_EXCEPTION_FILTER previous_filter = NULL;\n\n\/\/ Exception filter used when breakpad is not enabled. We just display\n\/\/ the \"Do you want to restart\" message and then we call the previous filter.\nlong WINAPI ChromeExceptionFilter(EXCEPTION_POINTERS* info) {\n  DumpDoneCallback(NULL, NULL, NULL, info, NULL, false);\n\n  if (previous_filter)\n    return previous_filter(info);\n\n  return EXCEPTION_EXECUTE_HANDLER;\n}\n\n}  \/\/ namespace\n\n\/\/ This function is executed by the child process that DumpDoneCallback()\n\/\/ spawned and basically just shows the 'chrome has crashed' dialog if\n\/\/ the CHROME_CRASHED environment variable is present.\nbool ShowRestartDialogIfCrashed(bool* exit_now) {\n  if (!::GetEnvironmentVariableW(kEnvShowRestart, NULL, 0))\n    return false;\n  DWORD len = ::GetEnvironmentVariableW(kEnvRestartInfo, NULL, 0);\n  if (!len)\n    return false;\n  wchar_t* restart_data = new wchar_t[len + 1];\n  ::GetEnvironmentVariableW(kEnvRestartInfo, restart_data, len);\n  restart_data[len] = 0;\n  \/\/ The CHROME_RESTART var contains the dialog strings separated by '|'.\n  \/\/ See PrepareRestartOnCrashEnviroment() function for details.\n  std::vector<std::wstring> dlg_strings;\n  SplitString(restart_data, L'|', &dlg_strings);\n  delete[] restart_data;\n  if (dlg_strings.size() < 3)\n    return false;\n\n  \/\/ If the UI layout is right-to-left, we need to pass the appropriate MB_XXX\n  \/\/ flags so that an RTL message box is displayed.\n  UINT flags = MB_OKCANCEL | MB_ICONWARNING;\n  if (dlg_strings[2] == kRtlLocaleDirection)\n    flags |= MB_RIGHT | MB_RTLREADING;\n\n  \/\/ Show the dialog now. It is ok if another chrome is started by the\n  \/\/ user since we have not initialized the databases.\n  *exit_now = (IDOK != ::MessageBoxW(NULL, dlg_strings[1].c_str(),\n                                     dlg_strings[0].c_str(), flags));\n  return true;\n}\n\nunsigned __stdcall InitCrashReporterThread(void* param)  {\n  CrashReporterInfo* info = reinterpret_cast<CrashReporterInfo*>(param);\n\n  CommandLine command;\n  bool full_dump = command.HasSwitch(switches::kFullMemoryCrashReport);\n  bool use_crash_service = command.HasSwitch(switches::kNoErrorDialogs) ||\n                           GetEnvironmentVariable(L\"CHROME_HEADLESS\", NULL, 0);\n\n  google_breakpad::ExceptionHandler::MinidumpCallback callback = NULL;\n\n  if (info->process_type == L\"browser\") {\n    \/\/ We install the post-dump callback only for the browser process. It\n    \/\/ spawns a new browser process.\n    callback = &DumpDoneCallback;\n  }\n\n  std::wstring pipe_name;\n  if (use_crash_service) {\n    pipe_name = kChromePipeName;\n  } else {\n    \/\/ We want to use the Google Update crash reporting. We need to check if the\n    \/\/ user allows it first.\n    if (!GoogleUpdateSettings::GetCollectStatsConsent()) {\n      \/\/ The user did not allow Google Update to send crashes, we need to use\n      \/\/ our default crash handler instead, but only for the browser process.\n      if (callback)\n        InitDefaultCrashCallback();\n      return 0;\n    }\n\n    \/\/ Build the pipe name.\n    std::wstring user_sid;\n    if (!win_util::GetUserSidString(&user_sid)) {\n      delete info;\n      return -1;\n    }\n\n    pipe_name = kGoogleUpdatePipeName;\n    pipe_name += user_sid;\n  }\n\n  \/\/ Get the alternate dump directory. We use the temp path.\n  wchar_t temp_dir[MAX_PATH] = {0};\n  ::GetTempPathW(MAX_PATH, temp_dir);\n\n  MINIDUMP_TYPE dump_type = full_dump ? MiniDumpWithFullMemory : MiniDumpNormal;\n\n  g_breakpad = new google_breakpad::ExceptionHandler(temp_dir, NULL, callback,\n                   NULL, google_breakpad::ExceptionHandler::HANDLER_ALL,\n                   dump_type, pipe_name.c_str(), info->custom_info);\n\n  \/\/ Tells breakpad to handle breakpoint and single step exceptions.\n  \/\/ This might break JIT debuggers, but at least it will always\n  \/\/ generate a crashdump for these exceptions.\n  g_breakpad->set_handle_debug_exceptions(true);\n\n  delete info;\n\n  return 0;\n}\n\nvoid InitDefaultCrashCallback() {\n  previous_filter = SetUnhandledExceptionFilter(ChromeExceptionFilter);\n}\n\nvoid InitCrashReporter(std::wstring dll_path) {\n  CommandLine command;\n  if (!command.HasSwitch(switches::kDisableBreakpad)) {\n    \/\/ Disable the message box for assertions.\n    _CrtSetReportMode(_CRT_ASSERT, 0);\n\n    \/\/ Query the custom_info now because if we do it in the thread it's going to\n    \/\/ fail in the sandbox. The thread will delete this object.\n    CrashReporterInfo* info = new CrashReporterInfo;\n    info->process_type = command.GetSwitchValue(switches::kProcessType);\n    if (info->process_type.empty())\n      info->process_type = L\"browser\";\n\n    info->custom_info = GetCustomInfo(dll_path, info->process_type);\n    info->dll_path = dll_path;\n\n    \/\/ If this is not the browser, we can't be sure that we will be able to\n    \/\/ initialize the crash_handler in another thread, so we run it right away.\n    \/\/ This is important to keep the thread for the browser process because\n    \/\/ it may take some times to initialize the crash_service process.\n    if (info->process_type != L\"browser\") {\n      InitCrashReporterThread(info);\n    } else {\n      uintptr_t thread = _beginthreadex(NULL, 0, &InitCrashReporterThread,\n                                        info, 0, NULL);\n      HANDLE thread_handle = reinterpret_cast<HANDLE>(thread);\n      if (thread_handle != INVALID_HANDLE_VALUE)\n        ::CloseHandle(thread_handle);\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/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    \"page-info-bubble\",  \/\/ Do not change; see above.\n    IDS_LABS_PAGE_INFO_BUBBLE_NAME,\n    IDS_LABS_PAGE_INFO_BUBBLE_DESCRIPTION,\n    kOsAll,\n    switches::kEnableNewPageInfoBubble\n  },\n  {\n    \"disable-outdated-plugins\",  \/\/ Do not change; see above.\n    IDS_LABS_DISABLE_OUTDATED_PLUGINS_NAME,\n    IDS_LABS_DISABLE_OUTDATED_PLUGINS_DESCRIPTION,\n    kOsAll,\n    switches::kDisableOutdatedPlugins\n  },\n  {\n    \"xss-auditor\",  \/\/ Do not change; see above.\n    IDS_LABS_XSS_AUDITOR_NAME,\n    IDS_LABS_XSS_AUDITOR_DESCRIPTION,\n    kOsAll,\n    switches::kEnableXSSAuditor\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>Enable about:labs on the stable channel as well. It's now enabled on all channels.<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\/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    \"page-info-bubble\",  \/\/ Do not change; see above.\n    IDS_LABS_PAGE_INFO_BUBBLE_NAME,\n    IDS_LABS_PAGE_INFO_BUBBLE_DESCRIPTION,\n    kOsAll,\n    switches::kEnableNewPageInfoBubble\n  },\n  {\n    \"disable-outdated-plugins\",  \/\/ Do not change; see above.\n    IDS_LABS_DISABLE_OUTDATED_PLUGINS_NAME,\n    IDS_LABS_DISABLE_OUTDATED_PLUGINS_DESCRIPTION,\n    kOsAll,\n    switches::kDisableOutdatedPlugins\n  },\n  {\n    \"xss-auditor\",  \/\/ Do not change; see above.\n    IDS_LABS_XSS_AUDITOR_NAME,\n    IDS_LABS_XSS_AUDITOR_DESCRIPTION,\n    kOsAll,\n    switches::kEnableXSSAuditor\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  \/\/ TODO(thakis): Port about:labs to chromeos -- http:\/\/crbug.com\/57634\n  return false;\n#else\n  return true;\n#endif\n}\n\nvoid ConvertLabsToSwitches(Profile* profile, CommandLine* command_line) {\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>\/*===================================================================\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 \"mitkSurfaceInterpolationController.h\"\n#include \"mitkMemoryUtilities.h\"\n\nmitk::SurfaceInterpolationController::SurfaceInterpolationController()\n: m_CurrentContourListID (0)\n{\n  m_ReduceFilter = ReduceContourSetFilter::New();\n  m_NormalsFilter = ComputeContourSetNormalsFilter::New();\n  m_InterpolateSurfaceFilter = CreateDistanceImageFromSurfaceFilter::New();\n\n  m_ReduceFilter->SetUseProgressBar(true);\n  m_NormalsFilter->SetUseProgressBar(true);\n  m_InterpolateSurfaceFilter->SetUseProgressBar(true);\n\n  m_Contours = Surface::New();\n\n  m_PolyData = vtkSmartPointer<vtkPolyData>::New();\n  m_PolyData->SetPoints(vtkPoints::New());\n\n  m_InterpolationResult = 0;\n}\n\nmitk::SurfaceInterpolationController::~SurfaceInterpolationController()\n{\n  for (unsigned int i = 0; i < m_ListOfContourLists.size(); ++i)\n  {\n      for (unsigned int j = 0; j < m_ListOfContourLists.at(i).size(); ++j)\n      {\n          delete(m_ListOfContourLists.at(i).at(j).position);\n      }\n  }\n}\n\nmitk::SurfaceInterpolationController* mitk::SurfaceInterpolationController::GetInstance()\n{\n  static mitk::SurfaceInterpolationController* m_Instance;\n\n  if ( m_Instance == 0)\n  {\n    m_Instance = new SurfaceInterpolationController();\n  }\n\n  return m_Instance;\n}\n\nvoid mitk::SurfaceInterpolationController::AddNewContour (mitk::Surface::Pointer newContour ,RestorePlanePositionOperation* op)\n{\n  AffineTransform3D::Pointer transform = AffineTransform3D::New();\n  transform = op->GetTransform();\n\n  mitk::Vector3D direction = op->GetDirectionVector();\n  int pos (-1);\n\n  for (unsigned int i = 0; i < m_ListOfContourLists.at(m_CurrentContourListID).size(); i++)\n  {\n      itk::Matrix<float> diffM = transform->GetMatrix()-m_ListOfContourLists.at(m_CurrentContourListID).at(i).position->GetTransform()->GetMatrix();\n      bool isSameMatrix(true);\n      for (unsigned int j = 0; j < 3; j++)\n      {\n        if (fabs(diffM[j][0]) > 0.0001 && fabs(diffM[j][1]) > 0.0001 && fabs(diffM[j][2]) > 0.0001)\n        {\n          isSameMatrix = false;\n          break;\n        }\n      }\n      itk::Vector<float> diffV = m_ListOfContourLists.at(m_CurrentContourListID).at(i).position->GetTransform()->GetOffset()-transform->GetOffset();\n      if ( isSameMatrix && m_ListOfContourLists.at(m_CurrentContourListID).at(i).position->GetPos() == op->GetPos() && (fabs(diffV[0]) < 0.0001 && fabs(diffV[1]) < 0.0001 && fabs(diffV[2]) < 0.0001) )\n      {\n        pos = i;\n        break;\n      }\n    \n  }\n\n  if (pos == -1)\n  {\n    \/\/MITK_INFO<<\"New Contour\";\n    mitk::RestorePlanePositionOperation* newOp = new mitk::RestorePlanePositionOperation (OpRESTOREPLANEPOSITION, op->GetWidth(), \n      op->GetHeight(), op->GetSpacing(), op->GetPos(), direction, transform);\n    ContourPositionPair newData;\n    newData.contour = newContour;\n    newData.position = newOp;\n\n    m_ReduceFilter->SetInput(m_ListOfContourLists.at(m_CurrentContourListID).size(), newContour);\n    m_ListOfContourLists.at(m_CurrentContourListID).push_back(newData);\n  }\n  else\n  {\n    \/\/MITK_INFO<<\"Modified Contour\";\n    m_ListOfContourLists.at(m_CurrentContourListID).at(pos).contour = newContour;\n    m_ReduceFilter->SetInput(pos, newContour);\n  }\n\n  m_ReduceFilter->Update();\n  m_CurrentNumberOfReducedContours = m_ReduceFilter->GetNumberOfOutputs();\n\n  for (unsigned int i = 0; i < m_CurrentNumberOfReducedContours; i++)\n  {\n    m_NormalsFilter->SetInput(i, m_ReduceFilter->GetOutput(i));\n    m_InterpolateSurfaceFilter->SetInput(i, m_NormalsFilter->GetOutput(i));\n  }\n\n  this->Modified();\n}\n\nvoid mitk::SurfaceInterpolationController::Interpolate()\n{\n  if (m_CurrentNumberOfReducedContours< 2)\n    return;\n\n  \/\/Setting up progress bar\n  mitk::ProgressBar::GetInstance()->AddStepsToDo(8);\n\n  m_InterpolateSurfaceFilter->Update();\n\n  Image::Pointer distanceImage = m_InterpolateSurfaceFilter->GetOutput();\n\n  vtkSmartPointer<vtkMarchingCubes> mcFilter = vtkMarchingCubes::New();\n  mcFilter->SetInput(distanceImage->GetVtkImageData());\n  mcFilter->SetValue(0,0);\n  mcFilter->Update();\n\n  m_InterpolationResult = 0;\n  m_InterpolationResult = mitk::Surface::New();\n  m_InterpolationResult->SetVtkPolyData(mcFilter->GetOutput());\n  m_InterpolationResult->GetGeometry()->SetOrigin(distanceImage->GetGeometry()->GetOrigin());\n\n  vtkSmartPointer<vtkAppendPolyData> polyDataAppender = vtkSmartPointer<vtkAppendPolyData>::New();\n  for (unsigned int i = 0; i < m_ReduceFilter->GetNumberOfOutputs(); i++)\n  {\n    polyDataAppender->AddInput(m_ReduceFilter->GetOutput(i)->GetVtkPolyData());\n  }\n  polyDataAppender->Update();\n  m_Contours->SetVtkPolyData(polyDataAppender->GetOutput());\n\n  \/\/Last progress step\n  mitk::ProgressBar::GetInstance()->Progress(8);\n\n  m_InterpolationResult->DisconnectPipeline();\n}\n\nmitk::Surface::Pointer mitk::SurfaceInterpolationController::GetInterpolationResult()\n{\n    return m_InterpolationResult;\n}\n\nmitk::Surface* mitk::SurfaceInterpolationController::GetContoursAsSurface()\n{\n  return m_Contours;\n}\n\nvoid mitk::SurfaceInterpolationController::SetDataStorage(DataStorage &ds)\n{\n  m_DataStorage = &ds;\n}\n\nunsigned int mitk::SurfaceInterpolationController::CreateNewContourList()\n{\n  unsigned int newID =  m_ListOfContourLists.size();\n  ContourPositionPairList newList;\n  m_ListOfContourLists.push_back(newList);\n  this->SetCurrentListID(newID);\n  m_InterpolationResult = 0;\n  return m_CurrentContourListID;\n}\n\nvoid mitk::SurfaceInterpolationController::SetCurrentListID ( unsigned int ID )\n{\n  if (ID == m_CurrentContourListID )\n    return;\n\n  m_CurrentContourListID = ID;\n\n  m_ReduceFilter->Reset();\n  m_NormalsFilter->Reset();\n  m_InterpolateSurfaceFilter->Reset();\n  \n  for (unsigned int i = 0; i < m_ListOfContourLists.at(m_CurrentContourListID).size(); i++)\n  {\n    m_ReduceFilter->SetInput(i, m_ListOfContourLists.at(m_CurrentContourListID).at(i).contour);\n\/\/    m_NormalsFilter->SetInput(i,m_ReduceFilter->GetOutput(i));\n\/\/    m_InterpolateSurfaceFilter->SetInput(i,m_NormalsFilter->GetOutput(i));\n  }\n\n  m_ReduceFilter->Update();\n\n  m_CurrentNumberOfReducedContours = m_ReduceFilter->GetNumberOfOutputs();\n\n  for (unsigned int i = 0; i < m_CurrentNumberOfReducedContours; i++)\n  {\n    m_NormalsFilter->SetInput(i, m_ReduceFilter->GetOutput(i));\n    m_InterpolateSurfaceFilter->SetInput(i, m_NormalsFilter->GetOutput(i));\n  }\n}\n\nvoid mitk::SurfaceInterpolationController::SetMinSpacing(double minSpacing)\n{\n  m_ReduceFilter->SetMinSpacing(minSpacing);\n}\n\nvoid mitk::SurfaceInterpolationController::SetMaxSpacing(double maxSpacing)\n{\n  m_ReduceFilter->SetMaxSpacing(maxSpacing);\n  m_NormalsFilter->SetMaxSpacing(maxSpacing);\n}\n\nvoid mitk::SurfaceInterpolationController::SetDistanceImageVolume(unsigned int distImgVolume)\n{\n  m_InterpolateSurfaceFilter->SetDistanceImageVolume(distImgVolume);\n}\n\nvoid mitk::SurfaceInterpolationController::SetWorkingImage(Image* workingImage)\n{\n  m_NormalsFilter->SetSegmentationBinaryImage(workingImage);\n}\n\nmitk::Image* mitk::SurfaceInterpolationController::GetImage()\n{\n  return m_InterpolateSurfaceFilter->GetOutput();\n}\n\ndouble mitk::SurfaceInterpolationController::EstimatePortionOfNeededMemory()\n{\n  double numberOfPointsAfterReduction = m_ReduceFilter->GetNumberOfPointsAfterReduction()*3;\n  double sizeOfPoints = pow(numberOfPointsAfterReduction,2)*sizeof(double);\n  double totalMem = mitk::MemoryUtilities::GetTotalSizeOfPhysicalRam();\n  double percentage = sizeOfPoints\/totalMem;\n  return percentage;\n}\n<commit_msg>fixed segmentation crash on start up<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 \"mitkSurfaceInterpolationController.h\"\n#include \"mitkMemoryUtilities.h\"\n\nmitk::SurfaceInterpolationController::SurfaceInterpolationController()\n: m_CurrentContourListID (0)\n{\n  m_ReduceFilter = ReduceContourSetFilter::New();\n  m_NormalsFilter = ComputeContourSetNormalsFilter::New();\n  m_InterpolateSurfaceFilter = CreateDistanceImageFromSurfaceFilter::New();\n\n  m_ReduceFilter->SetUseProgressBar(true);\n  m_NormalsFilter->SetUseProgressBar(true);\n  m_InterpolateSurfaceFilter->SetUseProgressBar(true);\n\n  m_Contours = Surface::New();\n\n  m_PolyData = vtkSmartPointer<vtkPolyData>::New();\n  m_PolyData->SetPoints(vtkPoints::New());\n\n  m_InterpolationResult = 0;\n  m_CurrentNumberOfReducedContours = 0;\n}\n\nmitk::SurfaceInterpolationController::~SurfaceInterpolationController()\n{\n  for (unsigned int i = 0; i < m_ListOfContourLists.size(); ++i)\n  {\n      for (unsigned int j = 0; j < m_ListOfContourLists.at(i).size(); ++j)\n      {\n          delete(m_ListOfContourLists.at(i).at(j).position);\n      }\n  }\n}\n\nmitk::SurfaceInterpolationController* mitk::SurfaceInterpolationController::GetInstance()\n{\n  static mitk::SurfaceInterpolationController* m_Instance;\n\n  if ( m_Instance == 0)\n  {\n    m_Instance = new SurfaceInterpolationController();\n  }\n\n  return m_Instance;\n}\n\nvoid mitk::SurfaceInterpolationController::AddNewContour (mitk::Surface::Pointer newContour ,RestorePlanePositionOperation* op)\n{\n  AffineTransform3D::Pointer transform = AffineTransform3D::New();\n  transform = op->GetTransform();\n\n  mitk::Vector3D direction = op->GetDirectionVector();\n  int pos (-1);\n\n  for (unsigned int i = 0; i < m_ListOfContourLists.at(m_CurrentContourListID).size(); i++)\n  {\n      itk::Matrix<float> diffM = transform->GetMatrix()-m_ListOfContourLists.at(m_CurrentContourListID).at(i).position->GetTransform()->GetMatrix();\n      bool isSameMatrix(true);\n      for (unsigned int j = 0; j < 3; j++)\n      {\n        if (fabs(diffM[j][0]) > 0.0001 && fabs(diffM[j][1]) > 0.0001 && fabs(diffM[j][2]) > 0.0001)\n        {\n          isSameMatrix = false;\n          break;\n        }\n      }\n      itk::Vector<float> diffV = m_ListOfContourLists.at(m_CurrentContourListID).at(i).position->GetTransform()->GetOffset()-transform->GetOffset();\n      if ( isSameMatrix && m_ListOfContourLists.at(m_CurrentContourListID).at(i).position->GetPos() == op->GetPos() && (fabs(diffV[0]) < 0.0001 && fabs(diffV[1]) < 0.0001 && fabs(diffV[2]) < 0.0001) )\n      {\n        pos = i;\n        break;\n      }\n    \n  }\n\n  if (pos == -1)\n  {\n    \/\/MITK_INFO<<\"New Contour\";\n    mitk::RestorePlanePositionOperation* newOp = new mitk::RestorePlanePositionOperation (OpRESTOREPLANEPOSITION, op->GetWidth(), \n      op->GetHeight(), op->GetSpacing(), op->GetPos(), direction, transform);\n    ContourPositionPair newData;\n    newData.contour = newContour;\n    newData.position = newOp;\n\n    m_ReduceFilter->SetInput(m_ListOfContourLists.at(m_CurrentContourListID).size(), newContour);\n    m_ListOfContourLists.at(m_CurrentContourListID).push_back(newData);\n  }\n  else\n  {\n    \/\/MITK_INFO<<\"Modified Contour\";\n    m_ListOfContourLists.at(m_CurrentContourListID).at(pos).contour = newContour;\n    m_ReduceFilter->SetInput(pos, newContour);\n  }\n\n  m_ReduceFilter->Update();\n  m_CurrentNumberOfReducedContours = m_ReduceFilter->GetNumberOfOutputs();\n\n  for (unsigned int i = 0; i < m_CurrentNumberOfReducedContours; i++)\n  {\n    m_NormalsFilter->SetInput(i, m_ReduceFilter->GetOutput(i));\n    m_InterpolateSurfaceFilter->SetInput(i, m_NormalsFilter->GetOutput(i));\n  }\n\n  this->Modified();\n}\n\nvoid mitk::SurfaceInterpolationController::Interpolate()\n{\n  if (m_CurrentNumberOfReducedContours< 2)\n    return;\n\n  \/\/Setting up progress bar\n  mitk::ProgressBar::GetInstance()->AddStepsToDo(8);\n\n  m_InterpolateSurfaceFilter->Update();\n\n  Image::Pointer distanceImage = m_InterpolateSurfaceFilter->GetOutput();\n\n  vtkSmartPointer<vtkMarchingCubes> mcFilter = vtkMarchingCubes::New();\n  mcFilter->SetInput(distanceImage->GetVtkImageData());\n  mcFilter->SetValue(0,0);\n  mcFilter->Update();\n\n  m_InterpolationResult = 0;\n  m_InterpolationResult = mitk::Surface::New();\n  m_InterpolationResult->SetVtkPolyData(mcFilter->GetOutput());\n  m_InterpolationResult->GetGeometry()->SetOrigin(distanceImage->GetGeometry()->GetOrigin());\n\n  vtkSmartPointer<vtkAppendPolyData> polyDataAppender = vtkSmartPointer<vtkAppendPolyData>::New();\n  for (unsigned int i = 0; i < m_ReduceFilter->GetNumberOfOutputs(); i++)\n  {\n    polyDataAppender->AddInput(m_ReduceFilter->GetOutput(i)->GetVtkPolyData());\n  }\n  polyDataAppender->Update();\n  m_Contours->SetVtkPolyData(polyDataAppender->GetOutput());\n\n  \/\/Last progress step\n  mitk::ProgressBar::GetInstance()->Progress(8);\n\n  m_InterpolationResult->DisconnectPipeline();\n}\n\nmitk::Surface::Pointer mitk::SurfaceInterpolationController::GetInterpolationResult()\n{\n    return m_InterpolationResult;\n}\n\nmitk::Surface* mitk::SurfaceInterpolationController::GetContoursAsSurface()\n{\n  return m_Contours;\n}\n\nvoid mitk::SurfaceInterpolationController::SetDataStorage(DataStorage &ds)\n{\n  m_DataStorage = &ds;\n}\n\nunsigned int mitk::SurfaceInterpolationController::CreateNewContourList()\n{\n  unsigned int newID =  m_ListOfContourLists.size();\n  ContourPositionPairList newList;\n  m_ListOfContourLists.push_back(newList);\n  this->SetCurrentListID(newID);\n  m_InterpolationResult = 0;\n  return m_CurrentContourListID;\n}\n\nvoid mitk::SurfaceInterpolationController::SetCurrentListID ( unsigned int ID )\n{\n  if (ID == m_CurrentContourListID )\n    return;\n\n  m_CurrentContourListID = ID;\n\n  m_ReduceFilter->Reset();\n  m_NormalsFilter->Reset();\n  m_InterpolateSurfaceFilter->Reset();\n  \n  for (unsigned int i = 0; i < m_ListOfContourLists.at(m_CurrentContourListID).size(); i++)\n  {\n    m_ReduceFilter->SetInput(i, m_ListOfContourLists.at(m_CurrentContourListID).at(i).contour);\n\/\/    m_NormalsFilter->SetInput(i,m_ReduceFilter->GetOutput(i));\n\/\/    m_InterpolateSurfaceFilter->SetInput(i,m_NormalsFilter->GetOutput(i));\n  }\n\n  m_ReduceFilter->Update();\n\n  m_CurrentNumberOfReducedContours = m_ReduceFilter->GetNumberOfOutputs();\n\n  for (unsigned int i = 0; i < m_CurrentNumberOfReducedContours; i++)\n  {\n    m_NormalsFilter->SetInput(i, m_ReduceFilter->GetOutput(i));\n    m_InterpolateSurfaceFilter->SetInput(i, m_NormalsFilter->GetOutput(i));\n  }\n}\n\nvoid mitk::SurfaceInterpolationController::SetMinSpacing(double minSpacing)\n{\n  m_ReduceFilter->SetMinSpacing(minSpacing);\n}\n\nvoid mitk::SurfaceInterpolationController::SetMaxSpacing(double maxSpacing)\n{\n  m_ReduceFilter->SetMaxSpacing(maxSpacing);\n  m_NormalsFilter->SetMaxSpacing(maxSpacing);\n}\n\nvoid mitk::SurfaceInterpolationController::SetDistanceImageVolume(unsigned int distImgVolume)\n{\n  m_InterpolateSurfaceFilter->SetDistanceImageVolume(distImgVolume);\n}\n\nvoid mitk::SurfaceInterpolationController::SetWorkingImage(Image* workingImage)\n{\n  m_NormalsFilter->SetSegmentationBinaryImage(workingImage);\n}\n\nmitk::Image* mitk::SurfaceInterpolationController::GetImage()\n{\n  return m_InterpolateSurfaceFilter->GetOutput();\n}\n\ndouble mitk::SurfaceInterpolationController::EstimatePortionOfNeededMemory()\n{\n  double numberOfPointsAfterReduction = m_ReduceFilter->GetNumberOfPointsAfterReduction()*3;\n  double sizeOfPoints = pow(numberOfPointsAfterReduction,2)*sizeof(double);\n  double totalMem = mitk::MemoryUtilities::GetTotalSizeOfPhysicalRam();\n  double percentage = sizeOfPoints\/totalMem;\n  return percentage;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <string>\n#include <iostream>\n#include <mutex>\n#include <condition_variable>\n#include <atomic>\n#include <list>\n#include <thread>\n\n#include <boost\/asio\/serial_port.hpp>\n#include <boost\/asio\/write.hpp>\n#include <boost\/asio\/read.hpp>\nusing namespace::boost::asio;\n\n\n#define DUMP_VAR(x) std::cout << __func__ << #x << \"=<\" << x <<\">\" << std::endl;\n\nstd::list<std::string> gCarCommand;\n\nstd::mutex mtx;\nstd::condition_variable cv;\n\nvoid push_command(const std::string &cmd)\n{\n   std::unique_lock<std::mutex> lock(mtx);\n   if(\"init\"==cmd) {\n      gCarCommand.clear();\n   }\n   if(\"top\"==cmd) {\n      gCarCommand.push_back(\"a.speed:40000\");\n      gCarCommand.push_back(\"a.turn:fwd\");\n      gCarCommand.push_back(\"b.speed:40000\");\n      gCarCommand.push_back(\"b.turn:fwd\");\n      gCarCommand.push_back(\"c.speed:40000\");\n      gCarCommand.push_back(\"c.turn:fwd\");\n      gCarCommand.push_back(\"d.speed:40000\");\n      gCarCommand.push_back(\"d.turn:fwd\");\n   }\n   cv.notify_one();\n}\n\nvoid read_dummy()\n{\n  ::system(\"cat \/dev\/ttyUSB0\");\n}\n\n\n\n\n\n\nvoid car_uart_main(void)\n{\n    io_service io_;\n    serial_port port_( io_, \"\/dev\/ttyUSB0\" );\n    port_.set_option( serial_port_base::baud_rate( 9600 ) );\n    std::thread thr_read(read_dummy);\n    thr_read.detach();\n    while(true) {\n        std::unique_lock<std::mutex> lock(mtx);\n        cv.wait(lock);\n        if(false == gCarCommand.empty()) {\n           for(auto cmd:gCarCommand) {\n            boost::asio::write(port_, boost::asio::buffer(cmd.c_str(), cmd.size()));\n           }\n           gCarCommand.clear();\n        }\n    }\n}\n\n\n<commit_msg>Update car.entry.cpp<commit_after>#include <string>\n#include <iostream>\n#include <mutex>\n#include <condition_variable>\n#include <atomic>\n#include <list>\n#include <thread>\n\n#include <boost\/asio\/serial_port.hpp>\n#include <boost\/asio\/write.hpp>\n#include <boost\/asio\/read.hpp>\nusing namespace::boost::asio;\n\n\n#define DUMP_VAR(x) std::cout << __func__ << #x << \"=<\" << x <<\">\" << std::endl;\n\nstd::list<std::string> gCarCommand;\n\nstd::mutex mtx;\nstd::condition_variable cv;\n\nvoid push_command(const std::string &cmd)\n{\n   std::unique_lock<std::mutex> lock(mtx);\n   if(\"init\"==cmd) {\n      gCarCommand.clear();\n   }\n   if(\"top\"==cmd) {\n      gCarCommand.push_back(\"a.speed:40000\");\n      gCarCommand.push_back(\"a.turn:fwd\");\n      gCarCommand.push_back(\"b.speed:40000\");\n      gCarCommand.push_back(\"b.turn:fwd\");\n      gCarCommand.push_back(\"c.speed:40000\");\n      gCarCommand.push_back(\"c.turn:fwd\");\n      gCarCommand.push_back(\"d.speed:40000\");\n      gCarCommand.push_back(\"d.turn:fwd\");\n      gCarCommand.push_back(\"run\");\n   }\n   cv.notify_one();\n}\n\nvoid read_dummy()\n{\n  ::system(\"cat \/dev\/ttyUSB0\");\n}\n\n\n\n\n\n\nvoid car_uart_main(void)\n{\n    io_service io_;\n    serial_port port_( io_, \"\/dev\/ttyUSB0\" );\n    port_.set_option( serial_port_base::baud_rate( 9600 ) );\n    std::thread thr_read(read_dummy);\n    thr_read.detach();\n    while(true) {\n        std::unique_lock<std::mutex> lock(mtx);\n        cv.wait(lock);\n        if(false == gCarCommand.empty()) {\n           for(auto cmd:gCarCommand) {\n            boost::asio::write(port_, boost::asio::buffer(cmd.c_str(), cmd.size()));\n           }\n           gCarCommand.clear();\n        }\n    }\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef __COMMON_SHADER_HPP_INCLUDED\n#define __COMMON_SHADER_HPP_INCLUDED\n\n#include \"shader_loader.hpp\"\n\n\/\/ Include GLEW\n#ifndef __GL_GLEW_H_INCLUDED\n#define __GL_GLEW_H_INCLUDED\n#include <GL\/glew.h> \/\/ GLfloat, GLuint etc.\n#endif\n\n\/\/ Include standard headers\n#include <algorithm> \/\/ std::find\n#include <cstdio>    \/\/ std::FILE, std::fclose, std::fopen, std::fread, std::getchar, std::printf etc.\n#include <fstream>   \/\/ std::ifstream\n#include <ios>       \/\/ std::ios\n#include <string>    \/\/ std::string\n#include <vector>    \/\/ std::vector\n\nnamespace loaders\n{\n    GLuint load_shaders(const char* const vertex_file_path, const char* const fragment_file_path)\n    {\n        \/\/ Create the shaders\n        GLuint VertexShaderID = glCreateShader(GL_VERTEX_SHADER);\n        GLuint FragmentShaderID = glCreateShader(GL_FRAGMENT_SHADER);\n\n        \/\/ Read the Vertex Shader code from the file\n        std::string VertexShaderCode;\n        std::ifstream VertexShaderStream(vertex_file_path, std::ios::in);\n        if (VertexShaderStream.is_open())\n        {\n            std::string Line = \"\";\n            while (getline(VertexShaderStream, Line))\n            {\n                VertexShaderCode += \"\\n\" + Line;\n            }\n            VertexShaderStream.close();\n        }\n        else\n        {\n            std::printf(\"Impossible to open %s. Are you in the right directory ? Don't forget to read the FAQ !\\n\", vertex_file_path);\n            std::getchar();\n            return 0;\n        }\n\n        \/\/ Read the Fragment Shader code from the file\n        std::string FragmentShaderCode;\n        std::ifstream FragmentShaderStream(fragment_file_path, std::ios::in);\n        if (FragmentShaderStream.is_open())\n        {\n            std::string Line = \"\";\n            while(getline(FragmentShaderStream, Line))\n            {\n                FragmentShaderCode += \"\\n\" + Line;\n            }\n            FragmentShaderStream.close();\n        }\n\n        GLint Result = GL_FALSE;\n        int InfoLogLength;\n\n        \/\/ Compile Vertex Shader\n        std::printf(\"Compiling shader : %s\\n\", vertex_file_path);\n        char const *VertexSourcePointer = VertexShaderCode.c_str();\n        glShaderSource(VertexShaderID, 1, &VertexSourcePointer , nullptr);\n        glCompileShader(VertexShaderID);\n\n        \/\/ Check Vertex Shader\n        glGetShaderiv(VertexShaderID, GL_COMPILE_STATUS, &Result);\n        glGetShaderiv(VertexShaderID, GL_INFO_LOG_LENGTH, &InfoLogLength);\n        if (InfoLogLength > 0)\n        {\n            std::vector<char> VertexShaderErrorMessage(InfoLogLength+1);\n            glGetShaderInfoLog(VertexShaderID, InfoLogLength, nullptr, &VertexShaderErrorMessage[0]);\n            std::printf(\"%s\\n\", &VertexShaderErrorMessage[0]);\n        }\n\n        \/\/ Compile Fragment Shader\n        std::printf(\"Compiling shader : %s\\n\", fragment_file_path);\n        char const *FragmentSourcePointer = FragmentShaderCode.c_str();\n        glShaderSource(FragmentShaderID, 1, &FragmentSourcePointer , nullptr);\n        glCompileShader(FragmentShaderID);\n\n        \/\/ Check Fragment Shader\n        glGetShaderiv(FragmentShaderID, GL_COMPILE_STATUS, &Result);\n        glGetShaderiv(FragmentShaderID, GL_INFO_LOG_LENGTH, &InfoLogLength);\n        if (InfoLogLength > 0)\n        {\n            std::vector<char> FragmentShaderErrorMessage(InfoLogLength+1);\n            glGetShaderInfoLog(FragmentShaderID, InfoLogLength, nullptr, &FragmentShaderErrorMessage[0]);\n            std::printf(\"%s\\n\", &FragmentShaderErrorMessage[0]);\n        }\n\n        \/\/ Link the program\n        std::printf(\"Linking program\\n\");\n        GLuint ProgramID = glCreateProgram();\n        glAttachShader(ProgramID, VertexShaderID);\n        glAttachShader(ProgramID, FragmentShaderID);\n        glLinkProgram(ProgramID);\n\n        \/\/ Check the program\n        glGetProgramiv(ProgramID, GL_LINK_STATUS, &Result);\n        glGetProgramiv(ProgramID, GL_INFO_LOG_LENGTH, &InfoLogLength);\n        if (InfoLogLength > 0)\n        {\n            std::vector<char> ProgramErrorMessage(InfoLogLength+1);\n            glGetProgramInfoLog(ProgramID, InfoLogLength, nullptr, &ProgramErrorMessage[0]);\n            std::printf(\"%s\\n\", &ProgramErrorMessage[0]);\n        }\n\n        glDeleteShader(VertexShaderID);\n        glDeleteShader(FragmentShaderID);\n\n        return ProgramID;\n    }\n}\n#endif\n<commit_msg>`loaders::load_shaders`: do not call `getchar()` in error handling code.<commit_after>#ifndef __COMMON_SHADER_HPP_INCLUDED\n#define __COMMON_SHADER_HPP_INCLUDED\n\n#include \"shader_loader.hpp\"\n\n\/\/ Include GLEW\n#ifndef __GL_GLEW_H_INCLUDED\n#define __GL_GLEW_H_INCLUDED\n#include <GL\/glew.h> \/\/ GLfloat, GLuint etc.\n#endif\n\n\/\/ Include standard headers\n#include <algorithm> \/\/ std::find\n#include <cstdio>    \/\/ std::FILE, std::fclose, std::fopen, std::fread, std::getchar, std::printf etc.\n#include <fstream>   \/\/ std::ifstream\n#include <ios>       \/\/ std::ios\n#include <string>    \/\/ std::string\n#include <vector>    \/\/ std::vector\n\nnamespace loaders\n{\n    GLuint load_shaders(const char* const vertex_file_path, const char* const fragment_file_path)\n    {\n        \/\/ Create the shaders\n        GLuint VertexShaderID = glCreateShader(GL_VERTEX_SHADER);\n        GLuint FragmentShaderID = glCreateShader(GL_FRAGMENT_SHADER);\n\n        \/\/ Read the Vertex Shader code from the file\n        std::string VertexShaderCode;\n        std::ifstream VertexShaderStream(vertex_file_path, std::ios::in);\n        if (VertexShaderStream.is_open())\n        {\n            std::string Line = \"\";\n            while (getline(VertexShaderStream, Line))\n            {\n                VertexShaderCode += \"\\n\" + Line;\n            }\n            VertexShaderStream.close();\n        }\n        else\n        {\n            std::printf(\"Impossible to open %s. Are you in the right directory ? Don't forget to read the FAQ !\\n\", vertex_file_path);\n            return 0;\n        }\n\n        \/\/ Read the Fragment Shader code from the file\n        std::string FragmentShaderCode;\n        std::ifstream FragmentShaderStream(fragment_file_path, std::ios::in);\n        if (FragmentShaderStream.is_open())\n        {\n            std::string Line = \"\";\n            while(getline(FragmentShaderStream, Line))\n            {\n                FragmentShaderCode += \"\\n\" + Line;\n            }\n            FragmentShaderStream.close();\n        }\n\n        GLint Result = GL_FALSE;\n        int InfoLogLength;\n\n        \/\/ Compile Vertex Shader\n        std::printf(\"Compiling shader : %s\\n\", vertex_file_path);\n        char const *VertexSourcePointer = VertexShaderCode.c_str();\n        glShaderSource(VertexShaderID, 1, &VertexSourcePointer , nullptr);\n        glCompileShader(VertexShaderID);\n\n        \/\/ Check Vertex Shader\n        glGetShaderiv(VertexShaderID, GL_COMPILE_STATUS, &Result);\n        glGetShaderiv(VertexShaderID, GL_INFO_LOG_LENGTH, &InfoLogLength);\n        if (InfoLogLength > 0)\n        {\n            std::vector<char> VertexShaderErrorMessage(InfoLogLength+1);\n            glGetShaderInfoLog(VertexShaderID, InfoLogLength, nullptr, &VertexShaderErrorMessage[0]);\n            std::printf(\"%s\\n\", &VertexShaderErrorMessage[0]);\n        }\n\n        \/\/ Compile Fragment Shader\n        std::printf(\"Compiling shader : %s\\n\", fragment_file_path);\n        char const *FragmentSourcePointer = FragmentShaderCode.c_str();\n        glShaderSource(FragmentShaderID, 1, &FragmentSourcePointer , nullptr);\n        glCompileShader(FragmentShaderID);\n\n        \/\/ Check Fragment Shader\n        glGetShaderiv(FragmentShaderID, GL_COMPILE_STATUS, &Result);\n        glGetShaderiv(FragmentShaderID, GL_INFO_LOG_LENGTH, &InfoLogLength);\n        if (InfoLogLength > 0)\n        {\n            std::vector<char> FragmentShaderErrorMessage(InfoLogLength+1);\n            glGetShaderInfoLog(FragmentShaderID, InfoLogLength, nullptr, &FragmentShaderErrorMessage[0]);\n            std::printf(\"%s\\n\", &FragmentShaderErrorMessage[0]);\n        }\n\n        \/\/ Link the program\n        std::printf(\"Linking program\\n\");\n        GLuint ProgramID = glCreateProgram();\n        glAttachShader(ProgramID, VertexShaderID);\n        glAttachShader(ProgramID, FragmentShaderID);\n        glLinkProgram(ProgramID);\n\n        \/\/ Check the program\n        glGetProgramiv(ProgramID, GL_LINK_STATUS, &Result);\n        glGetProgramiv(ProgramID, GL_INFO_LOG_LENGTH, &InfoLogLength);\n        if (InfoLogLength > 0)\n        {\n            std::vector<char> ProgramErrorMessage(InfoLogLength+1);\n            glGetProgramInfoLog(ProgramID, InfoLogLength, nullptr, &ProgramErrorMessage[0]);\n            std::printf(\"%s\\n\", &ProgramErrorMessage[0]);\n        }\n\n        glDeleteShader(VertexShaderID);\n        glDeleteShader(FragmentShaderID);\n\n        return ProgramID;\n    }\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>complete MJ::checkAABBCCDDEEFFPai(...)<commit_after><|endoftext|>"}
{"text":"<commit_before>#pragma once\r\n\/\/=====================================================================\/\/\r\n\/*!\t@file\r\n\t@brief\t固定サイズ・スタック・クラス\r\n    @author 平松邦仁 (hira@rvf-rc45.net)\r\n\t@copyright\tCopyright (C) 2017, 2018 Kunihito Hiramatsu @n\r\n\t\t\t\tReleased under the MIT license @n\r\n\t\t\t\thttps:\/\/github.com\/hirakuni45\/RX\/blob\/master\/LICENSE\r\n*\/\r\n\/\/=====================================================================\/\/\r\n#include <cstdint>\r\n\r\nnamespace utils {\r\n\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\/*!\r\n\t\t@brief  fixed_stack class\r\n\t\t@param[in]\tUNIT\tユニット型\r\n\t\t@param[in]\tSIZE\tサイズ\r\n\t*\/\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\ttemplate <typename UNIT, uint32_t SIZE>\r\n\tclass fixed_stack {\r\n\tpublic:\r\n\t\ttypedef UNIT\tvalue_type;\r\n\r\n\tprivate:\r\n\t\tUNIT\t\tstack_[SIZE];\r\n\t\tuint32_t\tpos_;\r\n\r\n\tpublic:\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief  コンストラクタ\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tfixed_stack() noexcept : pos_(0) { }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief  格納可能な最大サイズを返す\r\n\t\t\t@return 格納可能な最大サイズ\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tuint32_t capacity() const noexcept { return SIZE; }\r\n\r\n\r\n        \/\/-----------------------------------------------------------------\/\/\r\n        \/*!\r\n            @brief  クリア\r\n        *\/\r\n        \/\/-----------------------------------------------------------------\/\/\r\n\t\tvoid clear() noexcept { pos_ = 0; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief  要素数を返す\r\n\t\t\t@return 要素数\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tuint32_t size() const noexcept { return pos_; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief  コンテナが空か？\r\n\t\t\t@return 空なら「true」\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tbool empty() const noexcept { return pos_ == 0; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief  先頭の要素参照\r\n\t\t\t@return 先頭の要素\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tconst UNIT& top() const noexcept { return stack_[0]; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief  プッシュ\r\n\t\t\t@return 成功なら「true」\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tbool push(const UNIT& u) noexcept\r\n\t\t{\r\n\t\t\tif(pos_ >= SIZE) {\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\r\n\t\t\tstack_[pos_] = u;\r\n\t\t\t++pos_;\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  ポップ @n\r\n\t\t\t\t\t※格納要素が無い場合、要素型の初期値が返される。\r\n\t\t\t@return 要素を返す\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tconst UNIT& pop() noexcept\r\n\t\t{\r\n\t\t\tif(pos_ == 0) {\r\n\t\t\t\tstatic const UNIT u;\r\n\t\t\t\treturn u;\r\n\t\t\t}\r\n\t\t\t--pos_;\r\n\t\t\treturn stack_[pos_];\r\n\t\t}\r\n\t};\r\n}\r\n<commit_msg>update: access at<commit_after>#pragma once\r\n\/\/=====================================================================\/\/\r\n\/*!\t@file\r\n\t@brief\t固定サイズ・スタック・クラス\r\n    @author 平松邦仁 (hira@rvf-rc45.net)\r\n\t@copyright\tCopyright (C) 2017, 2018 Kunihito Hiramatsu @n\r\n\t\t\t\tReleased under the MIT license @n\r\n\t\t\t\thttps:\/\/github.com\/hirakuni45\/RX\/blob\/master\/LICENSE\r\n*\/\r\n\/\/=====================================================================\/\/\r\n#include <cstdint>\r\n\r\nnamespace utils {\r\n\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\/*!\r\n\t\t@brief  fixed_stack class\r\n\t\t@param[in]\tUNIT\tユニット型\r\n\t\t@param[in]\tSIZE\tサイズ\r\n\t*\/\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\ttemplate <typename UNIT, uint32_t SIZE>\r\n\tclass fixed_stack {\r\n\tpublic:\r\n\t\ttypedef UNIT\tvalue_type;\r\n\r\n\tprivate:\r\n\t\tUNIT\t\tstack_[SIZE];\r\n\t\tuint32_t\tpos_;\r\n\r\n\tpublic:\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief  コンストラクタ\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tfixed_stack() noexcept : pos_(0) { }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief  格納可能な最大サイズを返す\r\n\t\t\t@return 格納可能な最大サイズ\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tuint32_t capacity() const noexcept { return SIZE; }\r\n\r\n\r\n        \/\/-----------------------------------------------------------------\/\/\r\n        \/*!\r\n            @brief  クリア\r\n        *\/\r\n        \/\/-----------------------------------------------------------------\/\/\r\n\t\tvoid clear() noexcept { pos_ = 0; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief  要素数を返す\r\n\t\t\t@return 要素数\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tuint32_t size() const noexcept { return pos_; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief  コンテナが空か？\r\n\t\t\t@return 空なら「true」\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tbool empty() const noexcept { return pos_ == 0; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief  先頭の要素参照\r\n\t\t\t@return 先頭の要素\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tconst UNIT& top() const noexcept { return stack_[0]; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief  要素の参照\r\n\t\t\t@return 要素\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tconst UNIT& at() const noexcept { return stack_[pos_]; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief  プッシュ\r\n\t\t\t@return 成功なら「true」\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tbool push(const UNIT& u) noexcept\r\n\t\t{\r\n\t\t\tif(pos_ >= SIZE) {\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\r\n\t\t\tstack_[pos_] = u;\r\n\t\t\t++pos_;\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  ポップ @n\r\n\t\t\t\t\t※格納要素が無い場合、要素型の初期値が返される。\r\n\t\t\t@return 要素を返す\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tconst UNIT& pop() noexcept\r\n\t\t{\r\n\t\t\tif(pos_ == 0) {\r\n\t\t\t\tstatic const UNIT u;\r\n\t\t\t\treturn u;\r\n\t\t\t}\r\n\t\t\t--pos_;\r\n\t\t\treturn stack_[pos_];\r\n\t\t}\r\n\t};\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/\/ -*- coding: us-ascii-unix -*-\n#include <type_traits>\n#include \"test-sys\/test.hh\"\n#include \"tests\/test-util\/print-objects.hh\"\n#include \"geo\/int-point.hh\"\n\nvoid test_int_point(){\n  using namespace faint;\n\n  static_assert(std::is_literal_type<IntPoint>::value, \"IntPoint not literal\");\n\n  IntPoint p0;\n  EQUAL(p0, IntPoint(0,0));\n  VERIFY(fully_positive(p0));\n  EQUAL(max_coords(IntPoint(-1,-2), IntPoint(0,0)), IntPoint(0,0));\n}\n<commit_msg>Added check for int-point trivially_copyable<commit_after>\/\/ -*- coding: us-ascii-unix -*-\n#include <type_traits>\n#include \"test-sys\/test.hh\"\n#include \"tests\/test-util\/print-objects.hh\"\n#include \"geo\/int-point.hh\"\n\nvoid test_int_point(){\n  using namespace faint;\n\n  static_assert(std::is_literal_type<IntPoint>::value,\n    \"IntPoint not literal\");\n  static_assert(std::is_trivially_copyable<IntPoint>::value,\n    \"IntPoint not trivially copyable\");\n\n  IntPoint p0;\n  EQUAL(p0, IntPoint(0,0));\n  VERIFY(fully_positive(p0));\n  EQUAL(max_coords(IntPoint(-1,-2), IntPoint(0,0)), IntPoint(0,0));\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <shogun\/lib\/SGVector.h>\n#include <shogun\/mathematics\/Math.h>\n#include <gtest\/gtest.h>\n\nusing namespace shogun;\n\nstatic float64_t a_sample[] = {0,1,2,3,4,5,6,7,8,9};\n\nTEST(SGVectorTest,ctor)\n{\n\tSGVector<float64_t> a(10);\n\tEXPECT_EQ(a.vlen, 10);\n\n\ta.zero();\n\tfor (int i=0; i < 10; ++i)\n\t{\n\t\tEXPECT_EQ(0, a[i]);\n\t}\n\n\ta.set_const(3.3);\n\tfor (int i=0; i < 10; ++i)\n\t{\n\t\tEXPECT_EQ(3.3, a[i]);\n\t}\n\n\tfloat64_t* a_clone = SGVector<float64_t>::clone_vector(a_sample, 10);\n\tfor (int i=0; i < 10; ++i)\n\t{\n\t\tEXPECT_EQ(a_clone[i], a_sample[i]);\n\t}\n\n\tSGVector<float64_t> b(a_clone, 10);\n\tEXPECT_EQ(b.vlen, 10);\n\tfor (int i=0; i < 10; ++i)\n\t{\n\t\tEXPECT_EQ(b[i], a_sample[i]);\n\t}\n}\n\nTEST(SGVectorTest,add)\n{\n\tfloat64_t* a_clone = SGVector<float64_t>::clone_vector(a_sample, 10);\n\tSGVector<float64_t> a(a_clone, 10);\n\tSGVector<float64_t> b(10);\n\tb.zero();\n\n\ta.add(b);\n\tfor (int i=0; i < 10; ++i)\n\t{\n\t\tEXPECT_EQ(a[i], a_sample[i]);\n\t}\n\n\tSGVector<float64_t> c = a + a;\n\tEXPECT_EQ(c.vlen, 10);\n\tfor (int i=0; i < 10; ++i)\n\t{\n\t\tEXPECT_EQ(c[i], 2*a_sample[i]);\n\t}\n}\n\nTEST(SGVectorTest,dot)\n{\n\tfloat64_t* a_clone = SGVector<float64_t>::clone_vector(a_sample, 10);\n\tSGVector<float64_t> a(a_clone, 10);\n\n\tEXPECT_EQ(285, a.dot(a.vector,a.vector, a.vlen));\n}\n\nTEST(SGVectorTest,norm)\n{\n\tEXPECT_EQ(CMath::sqrt(285.0),SGVector<float64_t>::twonorm(a_sample, 10));\n\n\tEXPECT_EQ(45,SGVector<float64_t>::onenorm(a_sample, 10));\n\n\tSGVector<float64_t> b(10);\n\tb.set_const(1.0);\n\tEXPECT_EQ(10.0,SGVector<float64_t>::qsq(b.vector, 10, 0.5));\n\n\tEXPECT_EQ(100,SGVector<float64_t>::qnorm(b.vector, 10, 0.5));\n}\n\nTEST(SGVectorTest,misc)\n{\n\tEXPECT_EQ(0.0, SGVector<float64_t>::min(a_sample,10));\n\tEXPECT_EQ(9.0, SGVector<float64_t>::max(a_sample,10));\n\tEXPECT_EQ(45.0, SGVector<float64_t>::sum(a_sample,10));\n\n\tfloat64_t* a_clone = SGVector<float64_t>::clone_vector(a_sample, 10);\n\tSGVector<float64_t> a(a_clone, 10);\n\tSGVector<float64_t> c(10);\n\tSGVector<float64_t>::vector_multiply(c.vector, a.vector, a.vector, 10);\n\tfor (int32_t i = 0; i < a.vlen; ++i)\n\t{\n\t\tEXPECT_EQ(c[i],a_sample[i]*a_sample[i]);\n\t}\n\n\tSGVector<float64_t>::add(c.vector, 1.5, a.vector, 1.3, a.vector, 10);\n\tfor (int32_t i = 0; i < a.vlen; ++i)\n\t{\n\t\tEXPECT_EQ(c[i],1.5*a_sample[i]+1.3*a_sample[i]);\n\t}\n\n\tSGVector<float64_t>::scale_vector(-1.0,a.vector,a.vlen);\n\tEXPECT_EQ(45.0, SGVector<float64_t>::sum_abs(a.vector,a.vlen));\n\n\tSGVector<float64_t>::scale_vector(-1.0,a.vector,a.vlen);\n\tSGVector<float64_t>::add_scalar(1.1, a.vector, a.vlen);\n\tfor (int32_t i = 0; i < a.vlen; ++i)\n\t{\n\t\tEXPECT_EQ(a[i],a_sample[i]+1.1);\n\t}\n\n\tfloat64_t* b_clone = SGVector<float64_t>::clone_vector(a_sample, 10);\n\tSGVector<float64_t> b(b_clone,10);\n\tSGVector<float64_t>::vec1_plus_scalar_times_vec2(b.vector, 1.3, b.vector, 10);\n\tfor (int32_t i = 0; i < a.vlen; ++i)\n\t{\n\t\tEXPECT_EQ(b[i],a_sample[i]+1.3*a_sample[i]);\n\t}\n}\n<commit_msg>Use random vectors instead of predefined ones<commit_after>#include <shogun\/lib\/SGVector.h>\n#include <shogun\/mathematics\/Math.h>\n#include <gtest\/gtest.h>\n\nusing namespace shogun;\n\nTEST(SGVectorTest,ctor)\n{\n\tSGVector<float64_t> a(10);\n\tEXPECT_EQ(a.vlen, 10);\n\n\ta.zero();\n\tfor (int i=0; i < 10; ++i)\n\t\tEXPECT_EQ(0, a[i]);\n\n\ta.set_const(3.3);\n\tfor (int i=0; i < 10; ++i)\n\t\tEXPECT_EQ(3.3, a[i]);\n\n\tfloat64_t* a_clone = SGVector<float64_t>::clone_vector(a.vector, a.vlen);\n\tfor (int i=0; i < 10; ++i)\n\t\tEXPECT_EQ(a_clone[i], a[i]);\n\n\tSGVector<float64_t> b(a_clone, 10);\n\tEXPECT_EQ(b.vlen, 10);\n\tfor (int i=0; i < 10; ++i)\n\t\tEXPECT_EQ(b[i], a[i]);\n\n\t\/* test copy ctor *\/\n\tSGVector<float64_t> c(b);\n\tEXPECT_EQ(c.vlen, b.vlen);\n\tfor (int i=0; i < c.vlen; ++i)\n\t\tEXPECT_EQ(b[i], c[i]);\n\n}\n\nTEST(SGVectorTest,add)\n{\n\tSGVector<float64_t> a(10);\n\tSGVector<float64_t> b(10);\n\ta.random(0.0, 1024.0);\n\tb.random(0.0, 1024.0);\n\tfloat64_t* b_clone = SGVector<float64_t>::clone_vector(b.vector, b.vlen);\n\tSGVector<float64_t> c(b_clone, 10);\n\n\tc.add(a);\n\tfor (int i=0; i < c.vlen; ++i)\n\t\tEXPECT_EQ(c[i], a[i]+b[i]);\n\n\tc = a + a;\n\tEXPECT_EQ(c.vlen, 10);\n\tfor (int i=0; i < c.vlen; ++i)\n\t\tEXPECT_EQ(c[i], 2*a[i]);\n}\n\nTEST(SGVectorTest,dot)\n{\n\tSGVector<float64_t> a(10);\n\ta.random(0.0, 1024.0);\n\tfloat64_t dot_val = 0.0;\n\n\tfor (int32_t i = 0; i < a.vlen; ++i)\n\t\tdot_val += a[i]*a[i];\n\n\tfloat64_t error = CMath::abs (dot_val - a.dot(a.vector,a.vector, a.vlen));\n\tEXPECT_TRUE(error < 10E-10);\n}\n\nTEST(SGVectorTest,norm)\n{\n\tSGVector<float64_t> a(10);\n\ta.random(-50.0, 1024.0);\n\n\t\/* check l-2 norm *\/\n\tfloat64_t l2_norm = CMath::sqrt(a.dot(a.vector,a.vector, a.vlen));\n\tfloat64_t error = CMath::abs(l2_norm - SGVector<float64_t>::twonorm(a.vector, a.vlen));\n\tEXPECT_TRUE(error < 10E-12);\n\n\tfloat64_t l1_norm = 0.0;\n\tfor (int32_t i = 0; i < a.vlen; ++i)\n\t\tl1_norm += CMath::abs(a[i]);\n\tEXPECT_EQ(l1_norm, SGVector<float64_t>::onenorm(a.vector, a.vlen));\n\n\tSGVector<float64_t> b(10);\n\tb.set_const(1.0);\n\tEXPECT_EQ(10.0,SGVector<float64_t>::qsq(b.vector, b.vlen, 0.5));\n\n\tEXPECT_EQ(100,SGVector<float64_t>::qnorm(b.vector, b.vlen, 0.5));\n}\n\nTEST(SGVectorTest,misc)\n{\n\tSGVector<float64_t> a(10);\n\ta.random(-1024.0, 1024.0);\n\t\n\t\/* test, min, max, sum *\/\n\tfloat64_t min = 1025, max = -1025, sum = 0.0, sum_abs = 0.0;\n\tfor (int32_t i = 0; i < a.vlen; ++i)\n\t{\n\t\tsum += a[i];\n\t\tsum_abs += CMath::abs(a[i]);\n\t\tif (a[i] > max)\n\t\t\tmax = a[i];\n\t\tif (a[i] < min)\n\t\t\tmin = a[i];\n\t}\n\t\n\tEXPECT_EQ(min, SGVector<float64_t>::min(a.vector,a.vlen));\n\tEXPECT_EQ(max, SGVector<float64_t>::max(a.vector,a.vlen));\n\tEXPECT_EQ(sum, SGVector<float64_t>::sum(a.vector,a.vlen));\n\tEXPECT_EQ(sum_abs, SGVector<float64_t>::sum_abs(a.vector, a.vlen));\n\n\t\/* test ::vector_multiply(...) *\/\n\tSGVector<float64_t> c(10);\n\tSGVector<float64_t>::vector_multiply(c.vector, a.vector, a.vector, a.vlen);\n\tfor (int32_t i = 0; i < c.vlen; ++i)\n\t\tEXPECT_EQ(c[i], a[i]*a[i]);\n\n\t\/* test ::add(...) *\/\n\tSGVector<float64_t>::add(c.vector, 1.5, a.vector, 1.3, a.vector, a.vlen);\n\tfor (int32_t i = 0; i < a.vlen; ++i)\n\t\tEXPECT_EQ(c[i],1.5*a[i]+1.3*a[i]);\n\n\t\/* tests ::add_scalar *\/\n\tSGVector<float64_t>::scale_vector(-1.0,a.vector, a.vlen);\n\tfloat64_t* a_clone = SGVector<float64_t>::clone_vector(a.vector, a.vlen);\n\tSGVector<float64_t> b(a_clone, 10);\n\tSGVector<float64_t>::add_scalar(1.1, b.vector, b.vlen);\n\tfor (int32_t i = 0; i < b.vlen; ++i)\n\t\tEXPECT_EQ(b[i],a[i]+1.1);\n\n\tfloat64_t* b_clone = SGVector<float64_t>::clone_vector(b.vector, b.vlen);\n\tSGVector<float64_t> d(b_clone, b.vlen);\n\tSGVector<float64_t>::vec1_plus_scalar_times_vec2(d.vector, 1.3, d.vector, b.vlen);\n\tfor (int32_t i = 0; i < d.vlen; ++i)\n\t\tEXPECT_EQ(d[i],b[i]+1.3*b[i]);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n* Copyright 2016 BitTorrent 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 <scraps\/net\/NAT64Adapter.h>\n#include <scraps\/net\/UDPService.h>\n#include <scraps\/net\/UDPSocket.h>\n#include <scraps\/net\/utility.h>\n\n#include <gtest\/gtest.h>\n\n#include <future>\n\nusing namespace scraps;\n\nTEST(NAT64Adapter, basics) {\n    if (net::DefaultIPv6Interface().is_loopback()) {\n        fprintf(stderr,\n            \"*************************************************\\n\"\n            \"* Warning! No IPv6 connectivity. Skipping test. *\\n\"\n            \"*************************************************\\n\"\n        );\n        return;\n    }\n\n    struct Receiver : net::UDPReceiver {\n        virtual void receiveUDP(const net::Endpoint& sender, const void* data, size_t length) override {\n            EXPECT_TRUE(sender.address().is_v4());\n            auto begin = reinterpret_cast<const uint8_t*>(data);\n            response.set_value(std::vector<uint8_t>(begin, begin + length));\n        }\n        std::promise<std::vector<uint8_t>> response;\n    };\n\n    net::UDPService service;\n\n    auto receiver = std::make_shared<Receiver>();\n    auto socket = service.openSocket(net::Address::Protocol::kIPv6, 10100, receiver);\n\n    const uint8_t packet[] = {\n        0xf3, 0x84, 0x01, 0x00, 0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x08, 0x69, 0x70,\n        0x76, 0x34, 0x6f, 0x6e, 0x6c, 0x79, 0x04, 0x61, 0x72, 0x70, 0x61, 0x00, 0x00, 0x01, 0x00,\n        0x01\n    };\n    auto destination = net::Endpoint(net::Address::from_string(\"8.8.8.8\"), 53);\n\n    \/\/ sending to the ipv4 endpoint directly shouldn't work\n    EXPECT_FALSE(socket->send(destination, packet, sizeof(packet)));\n\n    auto prefix = net::NAT64Adapter::QueryPrefix();\n    EXPECT_TRUE(prefix);\n\n    auto nat64 = std::make_shared<net::NAT64Adapter>(*prefix, socket, receiver);\n    socket->setReceiver(nat64);\n    EXPECT_TRUE(nat64->send(destination, packet, sizeof(packet)));\n\n    auto futureResponse = receiver->response.get_future();\n    auto status = futureResponse.wait_for(std::chrono::seconds(1));\n\n    ASSERT_EQ(std::future_status::ready, status);\n    auto response = futureResponse.get();\n\n    const uint8_t expectedHeader[] = { 0xf3, 0x84, 0x81, 0x80, 0x00, 0x01 };\n\n    ASSERT_GT(response.size(), 0x20);\n    EXPECT_TRUE(std::equal(expectedHeader, expectedHeader + sizeof(expectedHeader), response.begin()));\n}\n\nTEST(NAT64Adapter, addressConversion) {\n    net::NAT64Adapter::Prefix prefix{{1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2}};\n\n    auto ipv4 = net::Address::from_string(\"8.8.8.8\");\n    auto mapped = net::NAT64Adapter::IPv4ToIPv6(prefix, ipv4);\n    EXPECT_EQ(net::Address::from_string(\"0102:0304:0506:0708:0900:0102:0808:0808\"), mapped);\n    EXPECT_EQ(std::make_tuple(prefix, ipv4), net::NAT64Adapter::IPv6ToIPv4(mapped));\n}\n<commit_msg>Fix static analysis warnings<commit_after>\/**\n* Copyright 2016 BitTorrent 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 <scraps\/net\/NAT64Adapter.h>\n#include <scraps\/net\/UDPService.h>\n#include <scraps\/net\/UDPSocket.h>\n#include <scraps\/net\/utility.h>\n\n#include <gtest\/gtest.h>\n\n#include <future>\n\nusing namespace scraps;\n\nTEST(NAT64Adapter, basics) {\n    if (net::DefaultIPv6Interface().is_loopback()) {\n        fprintf(stderr,\n            \"*************************************************\\n\"\n            \"* Warning! No IPv6 connectivity. Skipping test. *\\n\"\n            \"*************************************************\\n\"\n        );\n        return;\n    }\n\n    struct Receiver : net::UDPReceiver {\n        virtual void receiveUDP(const net::Endpoint& sender, const void* data, size_t length) override {\n            EXPECT_TRUE(sender.address().is_v4());\n            auto begin = reinterpret_cast<const uint8_t*>(data);\n            response.set_value(std::vector<uint8_t>(begin, begin + length));\n        }\n        std::promise<std::vector<uint8_t>> response;\n    };\n\n    net::UDPService service;\n\n    auto receiver = std::make_shared<Receiver>();\n    auto socket = service.openSocket(net::Address::Protocol::kIPv6, 10100, receiver);\n\n    const uint8_t packet[] = {\n        0xf3, 0x84, 0x01, 0x00, 0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x08, 0x69, 0x70,\n        0x76, 0x34, 0x6f, 0x6e, 0x6c, 0x79, 0x04, 0x61, 0x72, 0x70, 0x61, 0x00, 0x00, 0x01, 0x00,\n        0x01\n    };\n    auto destination = net::Endpoint(net::Address::from_string(\"8.8.8.8\"), 53);\n\n    \/\/ sending to the ipv4 endpoint directly shouldn't work\n    EXPECT_FALSE(socket->send(destination, packet, sizeof(packet)));\n\n    auto prefix = net::NAT64Adapter::QueryPrefix();\n    EXPECT_TRUE(prefix);\n\n    auto nat64 = std::make_shared<net::NAT64Adapter>(*prefix, socket, receiver);\n    socket->setReceiver(nat64);\n    EXPECT_TRUE(nat64->send(destination, packet, sizeof(packet)));\n\n    auto futureResponse = receiver->response.get_future();\n    auto status = futureResponse.wait_for(std::chrono::seconds(1));\n\n    ASSERT_EQ(std::future_status::ready, status);\n    auto response = futureResponse.get();\n\n    const std::array<uint8_t, 6> expectedHeader{ 0xf3, 0x84, 0x81, 0x80, 0x00, 0x01 };\n\n    ASSERT_GT(response.size(), 0x20);\n    EXPECT_TRUE(std::equal(expectedHeader.begin(), expectedHeader.end(), response.begin()));\n}\n\nTEST(NAT64Adapter, addressConversion) {\n    net::NAT64Adapter::Prefix prefix{{1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2}};\n\n    auto ipv4 = net::Address::from_string(\"8.8.8.8\");\n    auto mapped = net::NAT64Adapter::IPv4ToIPv6(prefix, ipv4);\n    EXPECT_EQ(net::Address::from_string(\"0102:0304:0506:0708:0900:0102:0808:0808\"), mapped);\n    EXPECT_EQ(std::make_tuple(prefix, ipv4), net::NAT64Adapter::IPv6ToIPv4(mapped));\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* Copyright (C) 2016 German Aerospace Center (DLR\/SC)\n*\n* Created: 2016-12-23 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\n\n#include \"test.h\" \/\/ Brings in the GTest framework\n#include \"tigl.h\"\n#include \"CTiglPoint.h\"\n#include \"CTiglPointTranslator.h\"\n\n#include \"CNamedShape.h\"\n#include \"CCPACSConfigurationManager.h\"\n\n#include <string.h>\n#include <ctime>\n\n\n\/******************************************************************************\/\n\nclass TestPerformance : public ::testing::Test\n{\nprotected:\n    static void SetUpTestCase()\n    {\n        const char* filename = \"TestData\/CPACS_30_D150.xml\";\n        ReturnCode tixiRet;\n        TiglReturnCode tiglRet;\n\n        tiglHandle = -1;\n        tixiHandle = -1;\n\n        tixiRet = tixiOpenDocument(filename, &tixiHandle);\n        ASSERT_TRUE (tixiRet == SUCCESS);\n        tiglRet = tiglOpenCPACSConfiguration(tixiHandle, \"D150_VAMP\", &tiglHandle);\n        ASSERT_TRUE(tiglRet == TIGL_SUCCESS);\n    }\n\n    static void TearDownTestCase()\n    {\n        ASSERT_TRUE(tiglCloseCPACSConfiguration(tiglHandle) == TIGL_SUCCESS);\n        ASSERT_TRUE(tixiCloseDocument(tixiHandle) == SUCCESS);\n        tiglHandle = -1;\n        tixiHandle = -1;\n    }\n\n    void SetUp() override {}\n    void TearDown() override {}\n\n\n    static TixiDocumentHandle           tixiHandle;\n    static TiglCPACSConfigurationHandle tiglHandle;\n};\n\nTixiDocumentHandle TestPerformance::tixiHandle = 0;\nTiglCPACSConfigurationHandle TestPerformance::tiglHandle = 0;\n\nTEST_F(TestPerformance, wingGetPoint)\n{\n    int nruns = 500;\n    double number = 0.;\n\n    clock_t start = clock();\n\n    for (int irun = 0; irun < nruns; ++irun) {\n        int segIndex = rand() % 3 + 1;\n        double px, py, pz;\n        double eta = static_cast <double> (rand()) \/ static_cast <double> (RAND_MAX);\n        double xsi = static_cast <double> (rand()) \/ static_cast <double> (RAND_MAX);\n\n        ASSERT_EQ(TIGL_SUCCESS, tiglWingGetUpperPoint(tiglHandle, 1, segIndex, eta, xsi, &px, &py, &pz));\n        ASSERT_EQ(TIGL_SUCCESS, tiglWingGetLowerPoint(tiglHandle, 1, segIndex, eta, xsi, &px, &py, &pz));\n\n        \/\/ prevent compiler optimization\n        number += 1.0;\n    }\n\n    clock_t stop = clock();\n    if (fabs(number - nruns) < 1e-10) {\n        double time_elapsed = (double)(stop - start)\/(double)CLOCKS_PER_SEC\/(2.*number) * 1000000.;\n        std::cout << \"Time wingGetPoint [us]: \" << time_elapsed << std::endl;\n    }\n}\n\nTEST_F(TestPerformance, fuselageGetPoint)\n{\n    int nruns = 100;\n    double number = 0.;\n\n    int nsegs = 0;\n    ASSERT_EQ(TIGL_SUCCESS, tiglFuselageGetSegmentCount(tiglHandle, 1, &nsegs));\n\n    \/\/ we are using a cached version, we must activat the cache\n    double px, py, pz;\n    ASSERT_EQ(TIGL_SUCCESS, tiglFuselageGetPoint(tiglHandle, 1, 1, 0.2, 0.5, &px, &py, &pz));\n\n\n    clock_t start = clock();\n\n    for (int irun = 0; irun < nruns; ++irun) {\n        int segIndex = 1;\n        double eta = static_cast <double> (rand()) \/ static_cast <double> (RAND_MAX);\n        double xsi = static_cast <double> (rand()) \/ static_cast <double> (RAND_MAX);\n\n        ASSERT_EQ(TIGL_SUCCESS, tiglFuselageGetPoint(tiglHandle, 1, segIndex, eta, xsi, &px, &py, &pz));\n\n        \/\/ prevent compiler optimization\n        number += 1.0;\n    }\n\n    clock_t stop = clock();\n    if (fabs(number - nruns) < 1e-10) {\n        double time_elapsed = (double)(stop - start)\/(double)CLOCKS_PER_SEC\/number * 1000000.;\n        std::cout << \"Time fuselageGetPoint [us]: \" << time_elapsed << std::endl;\n    }\n}\n\nTEST_F(TestPerformance, pointTranslator)\n{\n    int nruns = 10000;\n    double abs_error = 1e-6;\n\n    tigl::CTiglPoint x1(0,4,0);\n    tigl::CTiglPoint x2(8,4,0);\n    tigl::CTiglPoint x3(0,0,0);\n    tigl::CTiglPoint x4(4,0,0);\n\n    tigl::CTiglPoint p(3,2,1);\n\n    double eta, xsi;\n    double x = 0.;\n\n    tigl::CTiglPointTranslator trans(x1, x2, x3, x4 );\n\n    clock_t start = clock();\n\n    for(int i = 0; i < nruns; ++i){\n        trans.translate(p, &eta, &xsi) ;\n        \/\/just some dummy to prevent compiler optimization\n        x = x + 1.0;\n    }\n\n    clock_t stop = clock();\n\n    ASSERT_EQ((double)nruns, x);\n    ASSERT_NEAR(0.5, eta, abs_error);\n    ASSERT_NEAR(0.5, xsi, abs_error);\n\n    double time_elapsed = (double)(stop - start)\/(double)CLOCKS_PER_SEC\/(double)nruns * 1000000.;\n    std::cout << \"Time PointTranslator [us]: \" << time_elapsed << std::endl;\n\n    ASSERT_TRUE(true);\n}\n\n\nTEST_F(TestPerformance, tiglCheckPointInside)\n{\n    const tigl::CCPACSConfigurationManager& manager = tigl::CCPACSConfigurationManager::GetInstance();\n    tigl::CCPACSConfiguration& config = manager.GetConfiguration(tiglHandle);\n\n    \/\/ pre-build some geometries to warm start performance tests\n    tigl::CTiglAbstractGeometricComponent& wing\n            = static_cast<tigl::CTiglAbstractGeometricComponent&>(config.GetUIDManager().GetGeometricComponent(\"D150_VAMP_W1\"));\n    TopoDS_Shape wing_loft = wing.GetLoft()->Shape();\n    Bnd_Box const& wing_bb = wing.GetBoundingBox();\n\n    tigl::CTiglAbstractGeometricComponent& vtp\n            = static_cast<tigl::CTiglAbstractGeometricComponent&>(config.GetUIDManager().GetGeometricComponent(\"D150_VAMP_SL1\"));\n    TopoDS_Shape vtp_loft = vtp.GetLoft()->Shape();\n    Bnd_Box const& vtp_bb = vtp.GetBoundingBox();\n\n    tigl::CTiglAbstractGeometricComponent& fuselage\n            = static_cast<tigl::CTiglAbstractGeometricComponent&>(config.GetUIDManager().GetGeometricComponent(\"D150_VAMP_FL1\"));\n    TopoDS_Shape fuselage_loft = fuselage.GetLoft()->Shape();\n    Bnd_Box const& fuselage_bb = fuselage.GetBoundingBox();\n\n    \/\/ define some points that are exclusively in one component\n    tigl::CTiglPoint pointInFuselage(5., 0., 0.);\n    tigl::CTiglPoint pointInWing(16., 6., -1.);\n    tigl::CTiglPoint pointInVTP(34., 0., 4.);\n    tigl::CTiglPoint pointInSpace(1000., 1000., 1000.);\n\n    TiglBoolean fusePointInside  = TIGL_FALSE;\n    TiglBoolean wingPointInside  = TIGL_FALSE;\n    TiglBoolean vtpPointInside   = TIGL_FALSE;\n    TiglBoolean spacePointInside = TIGL_FALSE;\n\n    int nruns = 50;\n    double n;\n\n    clock_t start, stop;\n    double time_elapsed;\n\n    \/\/ test the four points against the wing\n    n = 0.;\n    start = clock();\n    for(int i = 0; i < nruns; ++i){\n        ASSERT_EQ(TIGL_SUCCESS, tiglCheckPointInside(tiglHandle, pointInFuselage.x, pointInFuselage.y, pointInFuselage.z, \"D150_VAMP_W1\", &fusePointInside));\n        ASSERT_EQ(TIGL_SUCCESS, tiglCheckPointInside(tiglHandle, pointInWing.x    , pointInWing.y    , pointInWing.z    , \"D150_VAMP_W1\", &wingPointInside));\n        ASSERT_EQ(TIGL_SUCCESS, tiglCheckPointInside(tiglHandle, pointInVTP.x     , pointInVTP.y     , pointInVTP.z     , \"D150_VAMP_W1\", &vtpPointInside));\n        ASSERT_EQ(TIGL_SUCCESS, tiglCheckPointInside(tiglHandle, pointInSpace.x   , pointInSpace.y   , pointInSpace.z   , \"D150_VAMP_W1\", &spacePointInside));\n        n += 1.;  \/\/dummy to prevent compiler optimization\n    }\n    stop = clock();\n\n    ASSERT_FALSE(fusePointInside);\n    ASSERT_TRUE(wingPointInside);\n    ASSERT_FALSE(vtpPointInside);\n    ASSERT_FALSE(spacePointInside);\n\n    time_elapsed = (double)(stop - start)\/(double)CLOCKS_PER_SEC\/(double)nruns * 1000000.;\n    std::cout << \"Time tiglCheckPointInside wing [us]: \" << time_elapsed << std::endl;\n\n    \/\/ test the four points against the vtp\n    n = 0.;\n    start = clock();\n    for(int i = 0; i < nruns; ++i){\n        ASSERT_EQ(TIGL_SUCCESS, tiglCheckPointInside(tiglHandle, pointInFuselage.x, pointInFuselage.y, pointInFuselage.z, \"D150_VAMP_SL1\", &fusePointInside));\n        ASSERT_EQ(TIGL_SUCCESS, tiglCheckPointInside(tiglHandle, pointInWing.x    , pointInWing.y    , pointInWing.z    , \"D150_VAMP_SL1\", &wingPointInside));\n        ASSERT_EQ(TIGL_SUCCESS, tiglCheckPointInside(tiglHandle, pointInVTP.x     , pointInVTP.y     , pointInVTP.z     , \"D150_VAMP_SL1\", &vtpPointInside));\n        ASSERT_EQ(TIGL_SUCCESS, tiglCheckPointInside(tiglHandle, pointInSpace.x   , pointInSpace.y   , pointInSpace.z   , \"D150_VAMP_SL1\", &spacePointInside));\n        n += 1.;  \/\/dummy to prevent compiler optimization\n    }\n    stop = clock();\n\n    ASSERT_FALSE(fusePointInside);\n    ASSERT_FALSE(wingPointInside);\n    ASSERT_TRUE(vtpPointInside);\n    ASSERT_FALSE(spacePointInside);\n\n    time_elapsed = (double)(stop - start)\/(double)CLOCKS_PER_SEC\/(double)nruns * 1000000.;\n    std::cout << \"Time tiglCheckPointInside vtp [us]: \" << time_elapsed << std::endl;\n\n\n    \/\/ test the four points against the fuselage\n    n = 0.;\n    start = clock();\n    for(int i = 0; i < nruns; ++i){\n        ASSERT_EQ(TIGL_SUCCESS, tiglCheckPointInside(tiglHandle, pointInFuselage.x, pointInFuselage.y, pointInFuselage.z, \"D150_VAMP_FL1\", &fusePointInside));\n        ASSERT_EQ(TIGL_SUCCESS, tiglCheckPointInside(tiglHandle, pointInWing.x    , pointInWing.y    , pointInWing.z    , \"D150_VAMP_FL1\", &wingPointInside));\n        ASSERT_EQ(TIGL_SUCCESS, tiglCheckPointInside(tiglHandle, pointInVTP.x     , pointInVTP.y     , pointInVTP.z     , \"D150_VAMP_FL1\", &vtpPointInside));\n        ASSERT_EQ(TIGL_SUCCESS, tiglCheckPointInside(tiglHandle, pointInSpace.x   , pointInSpace.y   , pointInSpace.z   , \"D150_VAMP_FL1\", &spacePointInside));\n        n += 1.;  \/\/dummy to prevent compiler optimization\n    }\n    stop = clock();\n\n    ASSERT_TRUE(fusePointInside);\n    ASSERT_FALSE(wingPointInside);\n    ASSERT_FALSE(vtpPointInside);\n    ASSERT_FALSE(spacePointInside);\n\n    time_elapsed = (double)(stop - start)\/(double)CLOCKS_PER_SEC\/(double)nruns * 1000000.;\n    std::cout << \"Time tiglCheckPointInside fuselage [us]: \" << time_elapsed << std::endl;\n}\n<commit_msg>test tiglCheckPointInside with outside point only<commit_after>\/*\n* Copyright (C) 2016 German Aerospace Center (DLR\/SC)\n*\n* Created: 2016-12-23 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\n\n#include \"test.h\" \/\/ Brings in the GTest framework\n#include \"tigl.h\"\n#include \"CTiglPoint.h\"\n#include \"CTiglPointTranslator.h\"\n\n#include \"CNamedShape.h\"\n#include \"CCPACSConfigurationManager.h\"\n\n#include <string.h>\n#include <ctime>\n\n\n\/******************************************************************************\/\n\nclass TestPerformance : public ::testing::Test\n{\nprotected:\n    static void SetUpTestCase()\n    {\n        const char* filename = \"TestData\/CPACS_30_D150.xml\";\n        ReturnCode tixiRet;\n        TiglReturnCode tiglRet;\n\n        tiglHandle = -1;\n        tixiHandle = -1;\n\n        tixiRet = tixiOpenDocument(filename, &tixiHandle);\n        ASSERT_TRUE (tixiRet == SUCCESS);\n        tiglRet = tiglOpenCPACSConfiguration(tixiHandle, \"D150_VAMP\", &tiglHandle);\n        ASSERT_TRUE(tiglRet == TIGL_SUCCESS);\n    }\n\n    static void TearDownTestCase()\n    {\n        ASSERT_TRUE(tiglCloseCPACSConfiguration(tiglHandle) == TIGL_SUCCESS);\n        ASSERT_TRUE(tixiCloseDocument(tixiHandle) == SUCCESS);\n        tiglHandle = -1;\n        tixiHandle = -1;\n    }\n\n    void SetUp() override {}\n    void TearDown() override {}\n\n\n    static TixiDocumentHandle           tixiHandle;\n    static TiglCPACSConfigurationHandle tiglHandle;\n};\n\nTixiDocumentHandle TestPerformance::tixiHandle = 0;\nTiglCPACSConfigurationHandle TestPerformance::tiglHandle = 0;\n\nTEST_F(TestPerformance, wingGetPoint)\n{\n    int nruns = 500;\n    double number = 0.;\n\n    clock_t start = clock();\n\n    for (int irun = 0; irun < nruns; ++irun) {\n        int segIndex = rand() % 3 + 1;\n        double px, py, pz;\n        double eta = static_cast <double> (rand()) \/ static_cast <double> (RAND_MAX);\n        double xsi = static_cast <double> (rand()) \/ static_cast <double> (RAND_MAX);\n\n        ASSERT_EQ(TIGL_SUCCESS, tiglWingGetUpperPoint(tiglHandle, 1, segIndex, eta, xsi, &px, &py, &pz));\n        ASSERT_EQ(TIGL_SUCCESS, tiglWingGetLowerPoint(tiglHandle, 1, segIndex, eta, xsi, &px, &py, &pz));\n\n        \/\/ prevent compiler optimization\n        number += 1.0;\n    }\n\n    clock_t stop = clock();\n    if (fabs(number - nruns) < 1e-10) {\n        double time_elapsed = (double)(stop - start)\/(double)CLOCKS_PER_SEC\/(2.*number) * 1000000.;\n        std::cout << \"Time wingGetPoint [us]: \" << time_elapsed << std::endl;\n    }\n}\n\nTEST_F(TestPerformance, fuselageGetPoint)\n{\n    int nruns = 100;\n    double number = 0.;\n\n    int nsegs = 0;\n    ASSERT_EQ(TIGL_SUCCESS, tiglFuselageGetSegmentCount(tiglHandle, 1, &nsegs));\n\n    \/\/ we are using a cached version, we must activat the cache\n    double px, py, pz;\n    ASSERT_EQ(TIGL_SUCCESS, tiglFuselageGetPoint(tiglHandle, 1, 1, 0.2, 0.5, &px, &py, &pz));\n\n\n    clock_t start = clock();\n\n    for (int irun = 0; irun < nruns; ++irun) {\n        int segIndex = 1;\n        double eta = static_cast <double> (rand()) \/ static_cast <double> (RAND_MAX);\n        double xsi = static_cast <double> (rand()) \/ static_cast <double> (RAND_MAX);\n\n        ASSERT_EQ(TIGL_SUCCESS, tiglFuselageGetPoint(tiglHandle, 1, segIndex, eta, xsi, &px, &py, &pz));\n\n        \/\/ prevent compiler optimization\n        number += 1.0;\n    }\n\n    clock_t stop = clock();\n    if (fabs(number - nruns) < 1e-10) {\n        double time_elapsed = (double)(stop - start)\/(double)CLOCKS_PER_SEC\/number * 1000000.;\n        std::cout << \"Time fuselageGetPoint [us]: \" << time_elapsed << std::endl;\n    }\n}\n\nTEST_F(TestPerformance, pointTranslator)\n{\n    int nruns = 10000;\n    double abs_error = 1e-6;\n\n    tigl::CTiglPoint x1(0,4,0);\n    tigl::CTiglPoint x2(8,4,0);\n    tigl::CTiglPoint x3(0,0,0);\n    tigl::CTiglPoint x4(4,0,0);\n\n    tigl::CTiglPoint p(3,2,1);\n\n    double eta, xsi;\n    double x = 0.;\n\n    tigl::CTiglPointTranslator trans(x1, x2, x3, x4 );\n\n    clock_t start = clock();\n\n    for(int i = 0; i < nruns; ++i){\n        trans.translate(p, &eta, &xsi) ;\n        \/\/just some dummy to prevent compiler optimization\n        x = x + 1.0;\n    }\n\n    clock_t stop = clock();\n\n    ASSERT_EQ((double)nruns, x);\n    ASSERT_NEAR(0.5, eta, abs_error);\n    ASSERT_NEAR(0.5, xsi, abs_error);\n\n    double time_elapsed = (double)(stop - start)\/(double)CLOCKS_PER_SEC\/(double)nruns * 1000000.;\n    std::cout << \"Time PointTranslator [us]: \" << time_elapsed << std::endl;\n\n    ASSERT_TRUE(true);\n}\n\n\nTEST_F(TestPerformance, tiglCheckPointInside_false)\n{\n\n    \/\/ define some points that are exclusively in one component\n    tigl::CTiglPoint point(1000., 1000., 1000.);\n    TiglBoolean point_inside = TIGL_FALSE;\n\n    \/\/ pre-build some geometries to warm start performance tests\n    ASSERT_EQ(TIGL_SUCCESS, tiglCheckPointInside(tiglHandle, point.x, point.y, point.z, \"D150_VAMP_W1\" , &point_inside));\n    ASSERT_EQ(TIGL_SUCCESS, tiglCheckPointInside(tiglHandle, point.x, point.y, point.z, \"D150_VAMP_SL1\", &point_inside));\n    ASSERT_EQ(TIGL_SUCCESS, tiglCheckPointInside(tiglHandle, point.x, point.y, point.z, \"D150_VAMP_FL1\", &point_inside));\n\n\n    int nruns = 100000;\n    double n;\n\n    clock_t start, stop;\n    double time_elapsed;\n\n    \/\/ test the four points against the wing\n    n = 0.;\n    start = clock();\n    for(int i = 0; i < nruns; ++i){\n        ASSERT_EQ(TIGL_SUCCESS, tiglCheckPointInside(tiglHandle, point.x, point.y, point.z, \"D150_VAMP_W1\", &point_inside));\n        n += 1.;  \/\/dummy to prevent compiler optimization\n    }\n    stop = clock();\n    ASSERT_FALSE(point_inside);\n\n    time_elapsed = (double)(stop - start)\/(double)CLOCKS_PER_SEC\/(double)nruns * 1000000.;\n    std::cout << \"Time tiglCheckPointInside wing [us]: \" << time_elapsed << std::endl;\n\n    \/\/ test the four points against the vtp\n    n = 0.;\n    start = clock();\n    for(int i = 0; i < nruns; ++i){\n        ASSERT_EQ(TIGL_SUCCESS, tiglCheckPointInside(tiglHandle, point.x, point.y, point.z, \"D150_VAMP_SL1\", &point_inside));\n        n += 1.;  \/\/dummy to prevent compiler optimization\n    }\n    stop = clock();\n    ASSERT_FALSE(point_inside);\n\n    time_elapsed = (double)(stop - start)\/(double)CLOCKS_PER_SEC\/(double)nruns * 1000000.;\n    std::cout << \"Time tiglCheckPointInside vtp [us]: \" << time_elapsed << std::endl;\n\n\n    \/\/ test the four points against the fuselage\n    n = 0.;\n    start = clock();\n    for(int i = 0; i < nruns; ++i){\n        ASSERT_EQ(TIGL_SUCCESS, tiglCheckPointInside(tiglHandle, point.x, point.y, point.z, \"D150_VAMP_FL1\", &point_inside));\n        n += 1.;  \/\/dummy to prevent compiler optimization\n    }\n    stop = clock();\n    ASSERT_FALSE(point_inside);\n\n    time_elapsed = (double)(stop - start)\/(double)CLOCKS_PER_SEC\/(double)nruns * 1000000.;\n    std::cout << \"Time tiglCheckPointInside fuselage [us]: \" << time_elapsed << std::endl;\n}\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 <atomic>\n#include <memory>\n\n#include <boost\/lexical_cast.hpp>\n\n#include <folly\/io\/async\/AsyncSocket.h>\n#include <folly\/io\/async\/AsyncTransport.h>\n#include <folly\/io\/async\/EventBase.h>\n#include <folly\/portability\/GTest.h>\n\n#include <folly\/io\/async\/AsyncSocket.h>\n#include <thrift\/lib\/cpp2\/async\/DuplexChannel.h>\n#include <thrift\/lib\/cpp2\/async\/FutureRequest.h>\n#include <thrift\/lib\/cpp2\/async\/HeaderClientChannel.h>\n#include <thrift\/lib\/cpp2\/async\/RequestChannel.h>\n#include <thrift\/lib\/cpp2\/server\/ThriftServer.h>\n#include <thrift\/lib\/cpp2\/test\/gen-cpp2\/DuplexClient.h>\n#include <thrift\/lib\/cpp2\/test\/gen-cpp2\/DuplexService.h>\n#include <thrift\/lib\/cpp2\/test\/util\/TestThriftServerFactory.h>\n#include <thrift\/lib\/cpp2\/util\/ScopedServerThread.h>\n\nusing namespace apache::thrift;\nusing namespace apache::thrift::test;\nusing namespace apache::thrift::util;\nusing namespace folly;\nusing std::make_shared;\nusing std::shared_ptr;\nusing std::unique_ptr;\n\nclass DuplexClientInterface : public DuplexClientSvIf {\n public:\n  DuplexClientInterface(int32_t first, int32_t count, bool& success)\n      : expectIndex_(first), lastIndex_(first + count), success_(success) {}\n\n  void async_tm_update(\n      unique_ptr<HandlerCallback<int32_t>> callback,\n      int32_t currentIndex) override {\n    EXPECT_EQ(currentIndex, expectIndex_);\n    expectIndex_++;\n    EventBase* eb = callback->getEventBase();\n    callback->result(currentIndex);\n    if (expectIndex_ == lastIndex_) {\n      success_ = true;\n      eb->runInEventBaseThread([eb] { eb->terminateLoopSoon(); });\n    }\n  }\n\n private:\n  int32_t expectIndex_;\n  int32_t lastIndex_;\n  bool& success_;\n};\n\nclass Updater {\n public:\n  Updater(\n      shared_ptr<DuplexClientAsyncClient> client,\n      EventBase* eb,\n      int32_t startIndex,\n      int32_t numUpdates,\n      int32_t interval)\n      : client_(client),\n        eb_(eb),\n        startIndex_(startIndex),\n        numUpdates_(numUpdates),\n        interval_(interval) {}\n\n  void update() {\n    int32_t si = startIndex_;\n    client_->update(\n        [si](ClientReceiveState&& state) {\n          EXPECT_FALSE(state.isException());\n          int32_t res = DuplexClientAsyncClient::recv_update(state);\n          EXPECT_EQ(res, si);\n        },\n        startIndex_);\n    startIndex_++;\n    numUpdates_--;\n    if (numUpdates_ > 0) {\n      Updater updater(*this);\n      eb_->tryRunAfterDelay(\n          [updater]() mutable { updater.update(); }, interval_);\n    }\n  }\n\n private:\n  shared_ptr<DuplexClientAsyncClient> client_;\n  EventBase* eb_;\n  int32_t startIndex_;\n  int32_t numUpdates_;\n  int32_t interval_;\n};\n\nclass DuplexServiceInterface : public DuplexServiceSvIf {\n  void async_tm_registerForUpdates(\n      unique_ptr<HandlerCallback<bool>> callback,\n      int32_t startIndex,\n      int32_t numUpdates,\n      int32_t interval) override {\n    auto ctx = callback->getConnectionContext()->getConnectionContext();\n    CHECK(ctx != nullptr);\n    auto client = ctx->getDuplexClient<DuplexClientAsyncClient>();\n    auto eb = callback->getEventBase();\n    CHECK(eb != nullptr);\n    if (numUpdates > 0) {\n      Updater updater(client, eb, startIndex, numUpdates, interval);\n      eb->runInEventBaseThread([updater]() mutable { updater.update(); });\n    };\n    callback->result(true);\n  }\n\n  void async_tm_regularMethod(\n      unique_ptr<HandlerCallback<int32_t>> callback,\n      int32_t val) override {\n    callback->result(val * 2);\n  }\n};\n\nTEST(Duplex, DuplexTest) {\n  enum { START = 1, COUNT = 10, INTERVAL = 5 };\n  apache::thrift::TestThriftServerFactory<DuplexServiceInterface> factory;\n  factory.duplex(true);\n  ScopedServerThread sst(factory.create());\n  EventBase base;\n\n  std::shared_ptr<AsyncSocket> socket(\n      AsyncSocket::newSocket(&base, *sst.getAddress()));\n\n  auto duplexChannel =\n      std::make_shared<DuplexChannel>(DuplexChannel::Who::CLIENT, socket);\n  DuplexServiceAsyncClient client(duplexChannel->getClientChannel());\n\n  bool success = false;\n  ThriftServer clients_server(duplexChannel->getServerChannel());\n  clients_server.setInterface(\n      std::make_shared<DuplexClientInterface>(START, COUNT, success));\n  clients_server.serve();\n\n  client.registerForUpdates(\n      [](ClientReceiveState&& state) {\n        EXPECT_FALSE(state.isException());\n        bool res = DuplexServiceAsyncClient::recv_registerForUpdates(state);\n        EXPECT_TRUE(res);\n      },\n      START,\n      COUNT,\n      INTERVAL);\n\n  \/\/ fail on time out\n  base.tryRunAfterDelay([] { ADD_FAILURE(); }, 5000);\n\n  base.loopForever();\n\n  EXPECT_TRUE(success);\n}\n\nvoid testNonHeader(CLIENT_TYPE type) {\n  apache::thrift::TestThriftServerFactory<DuplexServiceInterface> factory;\n  factory.duplex(true);\n  ScopedServerThread sst(factory.create());\n  EventBase base;\n\n  std::shared_ptr<AsyncSocket> socket(\n      AsyncSocket::newSocket(&base, *sst.getAddress()));\n\n  auto duplexChannel =\n      std::make_shared<DuplexChannel>(DuplexChannel::Who::CLIENT, socket);\n  duplexChannel->getClientChannel()->setClientType(type);\n  DuplexServiceAsyncClient client(duplexChannel->getClientChannel());\n\n  int res = client.sync_regularMethod(5);\n  EXPECT_EQ(10, res);\n}\n\nTEST(Duplex, TestFramed) {\n  testNonHeader(THRIFT_FRAMED_DEPRECATED);\n}\n\nTEST(Duplex, TestUnframed) {\n  testNonHeader(THRIFT_UNFRAMED_DEPRECATED);\n}\n<commit_msg>Relax DuplexTest ordering expectations<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 <algorithm>\n#include <atomic>\n#include <memory>\n#include <vector>\n\n#include <boost\/lexical_cast.hpp>\n\n#include <folly\/io\/async\/AsyncSocket.h>\n#include <folly\/io\/async\/AsyncTransport.h>\n#include <folly\/io\/async\/EventBase.h>\n#include <folly\/portability\/GTest.h>\n\n#include <folly\/io\/async\/AsyncSocket.h>\n#include <thrift\/lib\/cpp2\/async\/DuplexChannel.h>\n#include <thrift\/lib\/cpp2\/async\/FutureRequest.h>\n#include <thrift\/lib\/cpp2\/async\/HeaderClientChannel.h>\n#include <thrift\/lib\/cpp2\/async\/RequestChannel.h>\n#include <thrift\/lib\/cpp2\/server\/ThriftServer.h>\n#include <thrift\/lib\/cpp2\/test\/gen-cpp2\/DuplexClient.h>\n#include <thrift\/lib\/cpp2\/test\/gen-cpp2\/DuplexService.h>\n#include <thrift\/lib\/cpp2\/test\/util\/TestThriftServerFactory.h>\n#include <thrift\/lib\/cpp2\/util\/ScopedServerThread.h>\n\nusing namespace apache::thrift;\nusing namespace apache::thrift::test;\nusing namespace apache::thrift::util;\nusing namespace folly;\nusing std::make_shared;\nusing std::shared_ptr;\nusing std::unique_ptr;\n\nclass DuplexClientInterface : public DuplexClientSvIf {\n public:\n  DuplexClientInterface(int32_t first, int32_t count, bool& success)\n      : firstIndex_(first), indexesSeen_(count, false), success_(success) {}\n\n  void async_tm_update(\n      unique_ptr<HandlerCallback<int32_t>> callback,\n      int32_t currentIndex) override {\n    \/\/ The order we see the values for currentIndex is not defined, but we do\n    \/\/ expect to see each possible value once.\n    EXPECT_FALSE(indexesSeen_[currentIndex - firstIndex_]);\n    indexesSeen_[currentIndex - firstIndex_] = true;\n    EventBase* eb = callback->getEventBase();\n    callback->result(currentIndex);\n    if (std::find(indexesSeen_.begin(), indexesSeen_.end(), false) ==\n        indexesSeen_.end()) {\n      success_ = true;\n      eb->runInEventBaseThread([eb] { eb->terminateLoopSoon(); });\n    }\n  }\n\n private:\n  int32_t firstIndex_;\n  std::vector<bool> indexesSeen_;\n  bool& success_;\n};\n\nclass Updater {\n public:\n  Updater(\n      shared_ptr<DuplexClientAsyncClient> client,\n      EventBase* eb,\n      int32_t startIndex,\n      int32_t numUpdates,\n      int32_t interval)\n      : client_(client),\n        eb_(eb),\n        startIndex_(startIndex),\n        numUpdates_(numUpdates),\n        interval_(interval) {}\n\n  void update() {\n    int32_t si = startIndex_;\n    client_->update(\n        [si](ClientReceiveState&& state) {\n          EXPECT_FALSE(state.isException());\n          int32_t res = DuplexClientAsyncClient::recv_update(state);\n          EXPECT_EQ(res, si);\n        },\n        startIndex_);\n    startIndex_++;\n    numUpdates_--;\n    if (numUpdates_ > 0) {\n      Updater updater(*this);\n      eb_->tryRunAfterDelay(\n          [updater]() mutable { updater.update(); }, interval_);\n    }\n  }\n\n private:\n  shared_ptr<DuplexClientAsyncClient> client_;\n  EventBase* eb_;\n  int32_t startIndex_;\n  int32_t numUpdates_;\n  int32_t interval_;\n};\n\nclass DuplexServiceInterface : public DuplexServiceSvIf {\n  void async_tm_registerForUpdates(\n      unique_ptr<HandlerCallback<bool>> callback,\n      int32_t startIndex,\n      int32_t numUpdates,\n      int32_t interval) override {\n    auto ctx = callback->getConnectionContext()->getConnectionContext();\n    CHECK(ctx != nullptr);\n    auto client = ctx->getDuplexClient<DuplexClientAsyncClient>();\n    auto eb = callback->getEventBase();\n    CHECK(eb != nullptr);\n    if (numUpdates > 0) {\n      Updater updater(client, eb, startIndex, numUpdates, interval);\n      eb->runInEventBaseThread([updater]() mutable { updater.update(); });\n    };\n    callback->result(true);\n  }\n\n  void async_tm_regularMethod(\n      unique_ptr<HandlerCallback<int32_t>> callback,\n      int32_t val) override {\n    callback->result(val * 2);\n  }\n};\n\nTEST(Duplex, DuplexTest) {\n  enum { START = 1, COUNT = 10, INTERVAL = 5 };\n  apache::thrift::TestThriftServerFactory<DuplexServiceInterface> factory;\n  factory.duplex(true);\n  ScopedServerThread sst(factory.create());\n  EventBase base;\n\n  std::shared_ptr<AsyncSocket> socket(\n      AsyncSocket::newSocket(&base, *sst.getAddress()));\n\n  auto duplexChannel =\n      std::make_shared<DuplexChannel>(DuplexChannel::Who::CLIENT, socket);\n  DuplexServiceAsyncClient client(duplexChannel->getClientChannel());\n\n  bool success = false;\n  ThriftServer clients_server(duplexChannel->getServerChannel());\n  clients_server.setInterface(\n      std::make_shared<DuplexClientInterface>(START, COUNT, success));\n  clients_server.serve();\n\n  client.registerForUpdates(\n      [](ClientReceiveState&& state) {\n        EXPECT_FALSE(state.isException());\n        bool res = DuplexServiceAsyncClient::recv_registerForUpdates(state);\n        EXPECT_TRUE(res);\n      },\n      START,\n      COUNT,\n      INTERVAL);\n\n  \/\/ fail on time out\n  base.tryRunAfterDelay([] { ADD_FAILURE(); }, 5000);\n\n  base.loopForever();\n\n  EXPECT_TRUE(success);\n}\n\nvoid testNonHeader(CLIENT_TYPE type) {\n  apache::thrift::TestThriftServerFactory<DuplexServiceInterface> factory;\n  factory.duplex(true);\n  ScopedServerThread sst(factory.create());\n  EventBase base;\n\n  std::shared_ptr<AsyncSocket> socket(\n      AsyncSocket::newSocket(&base, *sst.getAddress()));\n\n  auto duplexChannel =\n      std::make_shared<DuplexChannel>(DuplexChannel::Who::CLIENT, socket);\n  duplexChannel->getClientChannel()->setClientType(type);\n  DuplexServiceAsyncClient client(duplexChannel->getClientChannel());\n\n  int res = client.sync_regularMethod(5);\n  EXPECT_EQ(10, res);\n}\n\nTEST(Duplex, TestFramed) {\n  testNonHeader(THRIFT_FRAMED_DEPRECATED);\n}\n\nTEST(Duplex, TestUnframed) {\n  testNonHeader(THRIFT_UNFRAMED_DEPRECATED);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"TMVA\/mvasMulticlass.h\"\n#include \"TMVA\/Types.h\"\n#include \"TLegend.h\"\n#include \"TText.h\"\n#include \"TH2.h\"\n\n\n\n\/\/ this macro plots the resulting MVA distributions (Signal and\n\/\/ Background overlayed) of different MVA methods run in TMVA\n\/\/ (e.g. running TMVAnalysis.C).\n\n\n\/\/ input: - Input file (result from TMVA)\n\/\/        - use of TMVA plotting TStyle\nvoid TMVA::mvasMulticlass(TString dataset, TString fin , HistType htype , Bool_t useTMVAStyle  )\n{\n   \/\/ set style and remove existing canvas'\n   TMVAGlob::Initialize( useTMVAStyle );\n\n   \/\/ switches\n   const Bool_t Save_Images = kTRUE;\n\n   \/\/ checks if file with name \"fin\" is already open, and if not opens one\n   TFile *file = TMVAGlob::OpenFile(fin);\n\n   \/\/ find directory from input variable transformation and extract class names\n   TIter keys_dir = file->GetDirectory(dataset.Data())->GetListOfKeys();\n   TKey *key;\n   TDirectory *tempdir = 0;\n   while ((key = (TKey *)keys_dir())) {\n      TString name = key->GetName();\n      if (name.BeginsWith(\"InputVariables_\")) {\n         tempdir = (TDirectory *)(file->GetDirectory(dataset.Data())->Get(name));\n         break;\n      }\n   }\n   std::vector<TString> classnames(TMVAGlob::GetClassNames(tempdir));\n\n   \/\/ define Canvas layout here!\n   \/\/ Int_t xPad = 1; \/\/ no of plots in x\n   \/\/ Int_t yPad = 1; \/\/ no of plots in y\n   \/\/   Int_t noPad = xPad * yPad ;\n   const Int_t width = 600;   \/\/ size of canvas\n\n   \/\/ this defines how many canvases we need\n   TCanvas *c = 0;\n\n   \/\/ counter variables\n   Int_t countCanvas = 0;\n\n   \/\/ search for the right histograms in full list of keys\n   TIter next(file->GetDirectory(dataset.Data())->GetListOfKeys());\n   key = 0;\n   while ((key = (TKey*)next())) {\n\n      if (!TString(key->GetName()).BeginsWith(\"Method_\")) continue;\n      if (!gROOT->GetClass(key->GetClassName())->InheritsFrom(\"TDirectory\")) continue;\n\n      TString methodName;\n      TMVAGlob::GetMethodName(methodName,key);\n\n      TDirectory* mDir = (TDirectory*)key->ReadObj();\n\n      TIter keyIt(mDir->GetListOfKeys());\n      TKey *titkey;\n      while ((titkey = (TKey*)keyIt())) {\n\n         if (!gROOT->GetClass(titkey->GetClassName())->InheritsFrom(\"TDirectory\")) continue;\n\n         TDirectory *titDir = (TDirectory *)titkey->ReadObj();\n         TString methodTitle;\n         TMVAGlob::GetMethodTitle(methodTitle,titDir);\n\n         cout << \"--- Found directory for method: \" << methodName << \"::\" << methodTitle << endl;\n         TString hname = \"MVA_\" + methodTitle;\n         for(UInt_t icls = 0; icls < classnames.size(); ++icls){\n            TObjArray hists;\n\n            std::vector<TString>::iterator classiter = classnames.begin();\n            for(; classiter!=classnames.end(); ++classiter){\n               TString name(hname+\"_Test_\"+ classnames.at(icls)\n                            + \"_prob_for_\" + *classiter);\n               TH1 *hist = (TH1*)titDir->Get(name);\n               if (hist==0){\n                  cout << \":\\t mva distribution not available (this is normal for Cut classifier)\" << endl;\n                  continue;\n               }\n               hists.Add(hist);\n            }\n\n\n            \/\/ chop off useless stuff\n            ((TH1*)hists.First())->SetTitle( Form(\"TMVA response for classifier: %s\", methodTitle.Data() ));\n\n            \/\/ create new canvas\n            \/\/cout << \"Create canvas...\" << endl;\n            TString ctitle = ((htype == kMVAType) ?\n                              Form(\"TMVA response for class %s %s\", classnames.at(icls).Data(),methodTitle.Data()) :\n                              Form(\"TMVA comparison for class %s %s\", classnames.at(icls).Data(),methodTitle.Data())) ;\n\n            c = new TCanvas( Form(\"canvas%d\", countCanvas+1), ctitle,\n                             countCanvas*50+200, countCanvas*20, width, (Int_t)width*0.78 );\n\n            \/\/ set the histogram style\n            \/\/cout << \"Set histogram style...\" << endl;\n            TMVAGlob::SetMultiClassStyle( &hists );\n\n            \/\/ normalise all histograms and find maximum\n            Float_t histmax = -1;\n            for(Int_t i=0; i<hists.GetEntriesFast(); ++i){\n               TMVAGlob::NormalizeHist((TH1*)hists[i] );\n               if(((TH1*)hists[i])->GetMaximum() > histmax)\n                  histmax = ((TH1*)hists[i])->GetMaximum();\n            }\n\n            \/\/ frame limits (between 0 and 1 per definition)\n            Float_t xmin = 0;\n            Float_t xmax = 1;\n            Float_t ymin = 0;\n            Float_t maxMult = (htype == kCompareType) ? 1.3 : 1.2;\n            Float_t ymax = histmax*maxMult;\n            \/\/ build a frame\n            Int_t nb = 500;\n            TString hFrameName(TString::Format(\"frame_class%d_\",icls) + methodTitle);\n            TObject *o = gROOT->FindObject(hFrameName);\n            if(o) delete o;\n            TH2F* frame = new TH2F( hFrameName, ((TH1*)hists.First())->GetTitle(),\n                                    nb, xmin, xmax, nb, ymin, ymax );\n            frame->GetXaxis()->SetTitle( methodTitle + \" response for \"+classnames.at(icls));\n            frame->GetYaxis()->SetTitle(\"(1\/N) dN^{ }\/^{ }dx\");\n            TMVAGlob::SetFrameStyle( frame );\n\n            \/\/ eventually: draw the frame\n            frame->Draw();\n\n            c->GetPad(0)->SetLeftMargin( 0.105 );\n            frame->GetYaxis()->SetTitleOffset( 1.2 );\n\n            \/\/ Draw legend\n            TLegend *legend= new TLegend( c->GetLeftMargin(), 1 - c->GetTopMargin() - 0.12,\n                                          c->GetLeftMargin() + (htype == kCompareType ? 0.40 : 0.3), 1 - c->GetTopMargin() );\n            legend->SetFillStyle( 1 );\n            classiter = classnames.begin();\n\n            for(Int_t i=0; i<hists.GetEntriesFast(); ++i, ++classiter){\n               legend->AddEntry(((TH1*)hists[i]),*classiter,\"F\");\n            }\n\n            legend->SetBorderSize(1);\n            legend->SetMargin( 0.3 );\n            legend->Draw(\"same\");\n\n\n            for(Int_t i=0; i<hists.GetEntriesFast(); ++i){\n\n               ((TH1*)hists[i])->Draw(\"histsame\");\n               TString ytit = TString(\"(1\/N) \") + ((TH1*)hists[i])->GetYaxis()->GetTitle();\n               ((TH1*)hists[i])->GetYaxis()->SetTitle( ytit ); \/\/ histograms are normalised\n\n            }\n\n\n            if (htype == kCompareType) {\n\n               TObjArray othists;\n               \/\/ if overtraining check, load additional histograms\n               classiter = classnames.begin();\n               for(; classiter!=classnames.end(); ++classiter){\n                  TString name(hname+\"_Train_\"+ classnames.at(icls)\n                               + \"_prob_for_\" + *classiter);\n                  TH1 *hist = (TH1*)titDir->Get(name);\n                  if (hist==0){\n                     cout << \":\\t comparison histogram for overtraining check not available!\" << endl;\n                     continue;\n                  }\n                  othists.Add(hist);\n               }\n\n               TLegend *legend2= new TLegend( 1 - c->GetRightMargin() - 0.42, 1 - c->GetTopMargin() - 0.12,\n                                              1 - c->GetRightMargin(), 1 - c->GetTopMargin() );\n               legend2->SetFillStyle( 1 );\n               legend2->SetBorderSize(1);\n\n               classiter = classnames.begin();\n               for(Int_t i=0; i<othists.GetEntriesFast(); ++i, ++classiter){\n                  legend2->AddEntry(((TH1*)othists[i]),*classiter+\" (training sample)\",\"P\");\n               }\n               legend2->SetMargin( 0.1 );\n               legend2->Draw(\"same\");\n\n               \/\/ normalise all histograms and get maximum\n               for(Int_t i=0; i<othists.GetEntriesFast(); ++i){\n                  TMVAGlob::NormalizeHist((TH1*)othists[i] );\n                  if(((TH1*)othists[i])->GetMaximum() > histmax)\n                     histmax = ((TH1*)othists[i])->GetMaximum();\n               }\n\n               TMVAGlob::SetMultiClassStyle( &othists );\n               for(Int_t i=0; i<othists.GetEntriesFast(); ++i){\n                  Int_t col = ((TH1*)hists[i])->GetLineColor();\n                  ((TH1*)othists[i])->SetMarkerSize( 0.7 );\n                  ((TH1*)othists[i])->SetMarkerStyle( 20 );\n                  ((TH1*)othists[i])->SetMarkerColor( col );\n                  ((TH1*)othists[i])->SetLineWidth( 1 );\n                  ((TH1*)othists[i])->Draw(\"e1same\");\n               }\n\n               ymax = histmax*maxMult;\n               frame->GetYaxis()->SetLimits( 0, ymax );\n\n               \/\/ for better visibility, plot thinner lines\n               TMVAGlob::SetMultiClassStyle( &othists );\n               for(Int_t i=0; i<hists.GetEntriesFast(); ++i){\n                  ((TH1*)hists[i])->SetLineWidth( 1 );\n               }\n\n\n               \/\/ perform K-S test\n\n               cout << \"--- Perform Kolmogorov-Smirnov tests\" << endl;\n               cout << \"--- Goodness of consistency for class \" << classnames.at(icls)<< endl;\n               \/\/TString probatext(\"Kolmogorov-Smirnov test: \");\n               for(Int_t j=0; j<othists.GetEntriesFast(); ++j){\n                  Float_t kol = ((TH1*)hists[j])->KolmogorovTest(((TH1*)othists[j]),\"X\");\n                  cout <<  classnames.at(j) << \": \" << kol  << endl;\n                  \/\/probatext.Append(classnames.at(j)+Form(\" %.3f \",kol));\n               }\n\n\n\n               \/\/TText* tt = new TText( 0.12, 0.74, probatext );\n               \/\/tt->SetNDC(); tt->SetTextSize( 0.032 ); tt->AppendPad();\n\n            }\n\n\n            \/\/ redraw axes\n            frame->Draw(\"sameaxis\");\n\n            \/\/ text for overflows\n            \/\/Int_t    nbin = sig->GetNbinsX();\n            \/\/Double_t dxu  = sig->GetBinWidth(0);\n            \/\/Double_t dxo  = sig->GetBinWidth(nbin+1);\n            \/\/TString uoflow = Form( \"U\/O-flow (S,B): (%.1f, %.1f)%% \/ (%.1f, %.1f)%%\",\n            \/\/                       sig->GetBinContent(0)*dxu*100, bgd->GetBinContent(0)*dxu*100,\n            \/\/                      sig->GetBinContent(nbin+1)*dxo*100, bgd->GetBinContent(nbin+1)*dxo*100 );\n            \/\/TText* t = new TText( 0.975, 0.115, uoflow );\n            \/\/t->SetNDC();\n            \/\/t->SetTextSize( 0.030 );\n            \/\/t->SetTextAngle( 90 );\n            \/\/t->AppendPad();\n\n            \/\/ update canvas\n            c->Update();\n\n            \/\/ save canvas to file\n\n            TMVAGlob::plot_logo(1.058);\n            if (Save_Images) {\n               if      (htype == kMVAType)     TMVAGlob::imgconv( c, Form(\"%s\/plots\/mva_%s_%s\",dataset.Data(),classnames.at(icls).Data(), methodTitle.Data()) );\n               else if      (htype == kCompareType)     TMVAGlob::imgconv( c, Form(\"%s\/plots\/overtrain_%s_%s\",dataset.Data(),classnames.at(icls).Data(), methodTitle.Data()) );\n\n            }\n            countCanvas++;\n         }\n      }\n      cout << \"\";\n   }\n}\n<commit_msg>Use a TH1 instead of a TH2 for drawing the frame in TMVAGUIMultiClass<commit_after>#include \"TMVA\/mvasMulticlass.h\"\n#include \"TMVA\/Types.h\"\n#include \"TLegend.h\"\n#include \"TText.h\"\n#include \"TH2.h\"\n\n\n\n\/\/ this macro plots the resulting MVA distributions (Signal and\n\/\/ Background overlayed) of different MVA methods run in TMVA\n\/\/ (e.g. running TMVAnalysis.C).\n\n\n\/\/ input: - Input file (result from TMVA)\n\/\/        - use of TMVA plotting TStyle\nvoid TMVA::mvasMulticlass(TString dataset, TString fin , HistType htype , Bool_t useTMVAStyle  )\n{\n   \/\/ set style and remove existing canvas'\n   TMVAGlob::Initialize( useTMVAStyle );\n\n   \/\/ switches\n   const Bool_t Save_Images = kTRUE;\n\n   \/\/ checks if file with name \"fin\" is already open, and if not opens one\n   TFile *file = TMVAGlob::OpenFile(fin);\n\n   \/\/ find directory from input variable transformation and extract class names\n   TIter keys_dir = file->GetDirectory(dataset.Data())->GetListOfKeys();\n   TKey *key;\n   TDirectory *tempdir = 0;\n   while ((key = (TKey *)keys_dir())) {\n      TString name = key->GetName();\n      if (name.BeginsWith(\"InputVariables_\")) {\n         tempdir = (TDirectory *)(file->GetDirectory(dataset.Data())->Get(name));\n         break;\n      }\n   }\n   std::vector<TString> classnames(TMVAGlob::GetClassNames(tempdir));\n\n   \/\/ define Canvas layout here!\n   \/\/ Int_t xPad = 1; \/\/ no of plots in x\n   \/\/ Int_t yPad = 1; \/\/ no of plots in y\n   \/\/   Int_t noPad = xPad * yPad ;\n   const Int_t width = 600;   \/\/ size of canvas\n\n   \/\/ this defines how many canvases we need\n   TCanvas *c = 0;\n\n   \/\/ counter variables\n   Int_t countCanvas = 0;\n\n   \/\/ search for the right histograms in full list of keys\n   TIter next(file->GetDirectory(dataset.Data())->GetListOfKeys());\n   key = 0;\n   while ((key = (TKey*)next())) {\n\n      if (!TString(key->GetName()).BeginsWith(\"Method_\")) continue;\n      if (!gROOT->GetClass(key->GetClassName())->InheritsFrom(\"TDirectory\")) continue;\n\n      TString methodName;\n      TMVAGlob::GetMethodName(methodName,key);\n\n      TDirectory* mDir = (TDirectory*)key->ReadObj();\n\n      TIter keyIt(mDir->GetListOfKeys());\n      TKey *titkey;\n      while ((titkey = (TKey*)keyIt())) {\n\n         if (!gROOT->GetClass(titkey->GetClassName())->InheritsFrom(\"TDirectory\")) continue;\n\n         TDirectory *titDir = (TDirectory *)titkey->ReadObj();\n         TString methodTitle;\n         TMVAGlob::GetMethodTitle(methodTitle,titDir);\n\n         cout << \"--- Found directory for method: \" << methodName << \"::\" << methodTitle << endl;\n         TString hname = \"MVA_\" + methodTitle;\n         for(UInt_t icls = 0; icls < classnames.size(); ++icls){\n            TObjArray hists;\n\n            std::vector<TString>::iterator classiter = classnames.begin();\n            for(; classiter!=classnames.end(); ++classiter){\n               TString name(hname+\"_Test_\"+ classnames.at(icls)\n                            + \"_prob_for_\" + *classiter);\n               TH1 *hist = (TH1*)titDir->Get(name);\n               if (hist==0){\n                  cout << \":\\t mva distribution not available (this is normal for Cut classifier)\" << endl;\n                  continue;\n               }\n               hists.Add(hist);\n            }\n\n\n            \/\/ chop off useless stuff\n            ((TH1*)hists.First())->SetTitle( Form(\"TMVA response for classifier: %s\", methodTitle.Data() ));\n\n            \/\/ create new canvas\n            \/\/cout << \"Create canvas...\" << endl;\n            TString ctitle = ((htype == kMVAType) ?\n                              Form(\"TMVA response for class %s %s\", classnames.at(icls).Data(),methodTitle.Data()) :\n                              Form(\"TMVA comparison for class %s %s\", classnames.at(icls).Data(),methodTitle.Data())) ;\n\n            c = new TCanvas( Form(\"canvas%d\", countCanvas+1), ctitle,\n                             countCanvas*50+200, countCanvas*20, width, (Int_t)width*0.78 );\n\n            \/\/ set the histogram style\n            \/\/cout << \"Set histogram style...\" << endl;\n            TMVAGlob::SetMultiClassStyle( &hists );\n\n            \/\/ normalise all histograms and find maximum\n            Float_t histmax = -1;\n            for(Int_t i=0; i<hists.GetEntriesFast(); ++i){\n               TMVAGlob::NormalizeHist((TH1*)hists[i] );\n               if(((TH1*)hists[i])->GetMaximum() > histmax)\n                  histmax = ((TH1*)hists[i])->GetMaximum();\n            }\n\n            \/\/ frame limits (between 0 and 1 per definition)\n            Float_t xmin = 0;\n            Float_t xmax = 1;\n            Float_t ymin = 0;\n            Float_t maxMult = (htype == kCompareType) ? 1.3 : 1.2;\n            Float_t ymax = histmax*maxMult;\n            \/\/ build a frame\n            Int_t nb = 500;\n            TString hFrameName(TString::Format(\"frame_class%d_\",icls) + methodTitle);\n            TObject *o = gROOT->FindObject(hFrameName);\n            if(o) delete o;\n            TH1F* frame = new TH1F( hFrameName, ((TH1*)hists.First())->GetTitle(),\n                                    nb, xmin, xmax);\n            frame->SetMinimum(ymin);\n            frame->SetMaximum(ymax);\n            frame->GetXaxis()->SetTitle(methodTitle + \" response for \" + classnames.at(icls));\n            frame->GetYaxis()->SetTitle(\"(1\/N) dN^{ }\/^{ }dx\");\n            TMVAGlob::SetFrameStyle( frame );\n\n            \/\/ eventually: draw the frame\n            frame->Draw();\n\n            c->GetPad(0)->SetLeftMargin( 0.105 );\n            frame->GetYaxis()->SetTitleOffset( 1.2 );\n\n            \/\/ Draw legend\n            TLegend *legend= new TLegend( c->GetLeftMargin(), 1 - c->GetTopMargin() - 0.12,\n                                          c->GetLeftMargin() + (htype == kCompareType ? 0.40 : 0.3), 1 - c->GetTopMargin() );\n            legend->SetFillStyle( 1 );\n            classiter = classnames.begin();\n\n            for(Int_t i=0; i<hists.GetEntriesFast(); ++i, ++classiter){\n               legend->AddEntry(((TH1*)hists[i]),*classiter,\"F\");\n            }\n\n            legend->SetBorderSize(1);\n            legend->SetMargin( 0.3 );\n            legend->Draw(\"same\");\n\n\n            for(Int_t i=0; i<hists.GetEntriesFast(); ++i){\n\n               ((TH1*)hists[i])->Draw(\"histsame\");\n               TString ytit = TString(\"(1\/N) \") + ((TH1*)hists[i])->GetYaxis()->GetTitle();\n               ((TH1*)hists[i])->GetYaxis()->SetTitle( ytit ); \/\/ histograms are normalised\n\n            }\n\n\n            if (htype == kCompareType) {\n\n               TObjArray othists;\n               \/\/ if overtraining check, load additional histograms\n               classiter = classnames.begin();\n               for(; classiter!=classnames.end(); ++classiter){\n                  TString name(hname+\"_Train_\"+ classnames.at(icls)\n                               + \"_prob_for_\" + *classiter);\n                  TH1 *hist = (TH1*)titDir->Get(name);\n                  if (hist==0){\n                     cout << \":\\t comparison histogram for overtraining check not available!\" << endl;\n                     continue;\n                  }\n                  othists.Add(hist);\n               }\n\n               TLegend *legend2= new TLegend( 1 - c->GetRightMargin() - 0.42, 1 - c->GetTopMargin() - 0.12,\n                                              1 - c->GetRightMargin(), 1 - c->GetTopMargin() );\n               legend2->SetFillStyle( 1 );\n               legend2->SetBorderSize(1);\n\n               classiter = classnames.begin();\n               for(Int_t i=0; i<othists.GetEntriesFast(); ++i, ++classiter){\n                  legend2->AddEntry(((TH1*)othists[i]),*classiter+\" (training sample)\",\"P\");\n               }\n               legend2->SetMargin( 0.1 );\n               legend2->Draw(\"same\");\n\n               \/\/ normalise all histograms and get maximum\n               for(Int_t i=0; i<othists.GetEntriesFast(); ++i){\n                  TMVAGlob::NormalizeHist((TH1*)othists[i] );\n                  if(((TH1*)othists[i])->GetMaximum() > histmax)\n                     histmax = ((TH1*)othists[i])->GetMaximum();\n               }\n\n               TMVAGlob::SetMultiClassStyle( &othists );\n               for(Int_t i=0; i<othists.GetEntriesFast(); ++i){\n                  Int_t col = ((TH1*)hists[i])->GetLineColor();\n                  ((TH1*)othists[i])->SetMarkerSize( 0.7 );\n                  ((TH1*)othists[i])->SetMarkerStyle( 20 );\n                  ((TH1*)othists[i])->SetMarkerColor( col );\n                  ((TH1*)othists[i])->SetLineWidth( 1 );\n                  ((TH1*)othists[i])->Draw(\"e1same\");\n               }\n\n               ymax = histmax*maxMult;\n               frame->SetMaximum( ymax );\n\n               \/\/ for better visibility, plot thinner lines\n               TMVAGlob::SetMultiClassStyle( &othists );\n               for(Int_t i=0; i<hists.GetEntriesFast(); ++i){\n                  ((TH1*)hists[i])->SetLineWidth( 1 );\n               }\n\n\n               \/\/ perform K-S test\n\n               cout << \"--- Perform Kolmogorov-Smirnov tests\" << endl;\n               cout << \"--- Goodness of consistency for class \" << classnames.at(icls)<< endl;\n               \/\/TString probatext(\"Kolmogorov-Smirnov test: \");\n               for(Int_t j=0; j<othists.GetEntriesFast(); ++j){\n                  Float_t kol = ((TH1*)hists[j])->KolmogorovTest(((TH1*)othists[j]),\"X\");\n                  cout <<  classnames.at(j) << \": \" << kol  << endl;\n                  \/\/probatext.Append(classnames.at(j)+Form(\" %.3f \",kol));\n               }\n\n\n\n               \/\/TText* tt = new TText( 0.12, 0.74, probatext );\n               \/\/tt->SetNDC(); tt->SetTextSize( 0.032 ); tt->AppendPad();\n\n            }\n\n\n            \/\/ redraw axes\n            frame->Draw(\"sameaxis\");\n\n            \/\/ text for overflows\n            \/\/Int_t    nbin = sig->GetNbinsX();\n            \/\/Double_t dxu  = sig->GetBinWidth(0);\n            \/\/Double_t dxo  = sig->GetBinWidth(nbin+1);\n            \/\/TString uoflow = Form( \"U\/O-flow (S,B): (%.1f, %.1f)%% \/ (%.1f, %.1f)%%\",\n            \/\/                       sig->GetBinContent(0)*dxu*100, bgd->GetBinContent(0)*dxu*100,\n            \/\/                      sig->GetBinContent(nbin+1)*dxo*100, bgd->GetBinContent(nbin+1)*dxo*100 );\n            \/\/TText* t = new TText( 0.975, 0.115, uoflow );\n            \/\/t->SetNDC();\n            \/\/t->SetTextSize( 0.030 );\n            \/\/t->SetTextAngle( 90 );\n            \/\/t->AppendPad();\n\n            \/\/ update canvas\n            c->Update();\n\n            \/\/ save canvas to file\n\n            TMVAGlob::plot_logo(1.058);\n            if (Save_Images) {\n               if      (htype == kMVAType)     TMVAGlob::imgconv( c, Form(\"%s\/plots\/mva_%s_%s\",dataset.Data(),classnames.at(icls).Data(), methodTitle.Data()) );\n               else if      (htype == kCompareType)     TMVAGlob::imgconv( c, Form(\"%s\/plots\/overtrain_%s_%s\",dataset.Data(),classnames.at(icls).Data(), methodTitle.Data()) );\n\n            }\n            countCanvas++;\n         }\n      }\n      cout << \"\";\n   }\n}\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 (qt-info@nokia.com)\n**\n** This file is part of the QtDeclarative module of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** 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 \"QtQuick1\/private\/qdeclarativeanimatedimage_p.h\"\n#include \"QtQuick1\/private\/qdeclarativeanimatedimage_p_p.h\"\n\n#ifndef QT_NO_MOVIE\n\n#include <QtDeclarative\/qdeclarativeinfo.h>\n#include <QtDeclarative\/private\/qdeclarativeengine_p.h>\n\n#include <QMovie>\n#include <QNetworkRequest>\n#include <QNetworkReply>\n\nQT_BEGIN_NAMESPACE\n\n\n\n\/*!\n    \\qmlclass AnimatedImage QDeclarative1AnimatedImage\n    \\inqmlmodule QtQuick 1\n    \\inherits Image\n    \\since QtQuick 1.0\n    \\ingroup basic-visual-elements\n\n    The AnimatedImage element extends the features of the \\l Image element, providing\n    a way to play animations stored as images containing a series of frames,\n    such as those stored in GIF files.\n\n    Information about the current frame and totla length of the animation can be\n    obtained using the \\l currentFrame and \\l frameCount properties. You can\n    start, pause and stop the animation by changing the values of the \\l playing\n    and \\l paused properties.\n\n    The full list of supported formats can be determined with QMovie::supportedFormats().\n\n    \\section1 Example Usage\n\n    \\beginfloatleft\n    \\image animatedimageitem.gif\n    \\endfloat\n\n    The following QML shows how to display an animated image and obtain information\n    about its state, such as the current frame and total number of frames.\n    The result is an animated image with a simple progress indicator underneath it.\n\n    \\clearfloat\n    \\snippet doc\/src\/snippets\/declarative\/animatedimage.qml document\n\n    \\sa BorderImage, Image\n*\/\n\n\/*!\n    \\qmlproperty url QtQuick1::AnimatedImage::source\n\n    This property holds the URL that refers to the source image.\n\n    AnimatedImage can handle any image format supported by Qt, loaded from any\n    URL scheme supported by Qt.\n\n    \\sa QDeclarativeImageProvider\n*\/\n\n\/*!\n    \\qmlproperty bool QtQuick1::AnimatedImage::asynchronous\n\n    Specifies that images on the local filesystem should be loaded\n    asynchronously in a separate thread.  The default value is\n    false, causing the user interface thread to block while the\n    image is loaded.  Setting \\a asynchronous to true is useful where\n    maintaining a responsive user interface is more desirable\n    than having images immediately visible.\n\n    Note that this property is only valid for images read from the\n    local filesystem.  Images loaded via a network resource (e.g. HTTP)\n    are always loaded asynchonously.\n*\/\n\n\/*!\n    \\qmlproperty bool QtQuick1::AnimatedImage::cache\n    \\since Quick 1.1\n\n    Specifies whether the image should be cached. The default value is\n    true. Setting \\a cache to false is useful when dealing with large images,\n    to make sure that they aren't cached at the expense of small 'ui element' images.\n*\/\n\n\/*!\n    \\qmlproperty bool QtQuick1::AnimatedImage::mirror\n    \\since Quick 1.1\n\n    This property holds whether the image should be horizontally inverted\n    (effectively displaying a mirrored image).\n\n    The default value is false.\n*\/\n\nQDeclarative1AnimatedImage::QDeclarative1AnimatedImage(QDeclarativeItem *parent)\n    : QDeclarative1Image(*(new QDeclarative1AnimatedImagePrivate), parent)\n{\n}\n\nQDeclarative1AnimatedImage::~QDeclarative1AnimatedImage()\n{\n    Q_D(QDeclarative1AnimatedImage);\n    delete d->_movie;\n}\n\n\/*!\n  \\qmlproperty bool QtQuick1::AnimatedImage::paused\n  This property holds whether the animated image is paused.\n\n  By default, this property is false. Set it to true when you want to pause\n  the animation.\n*\/\nbool QDeclarative1AnimatedImage::isPaused() const\n{\n    Q_D(const QDeclarative1AnimatedImage);\n    if(!d->_movie)\n        return false;\n    return d->_movie->state()==QMovie::Paused;\n}\n\nvoid QDeclarative1AnimatedImage::setPaused(bool pause)\n{\n    Q_D(QDeclarative1AnimatedImage);\n    if(pause == d->paused)\n        return;\n    d->paused = pause;\n    if(!d->_movie)\n        return;\n    d->_movie->setPaused(pause);\n}\n\/*!\n  \\qmlproperty bool QtQuick1::AnimatedImage::playing\n  This property holds whether the animated image is playing.\n\n  By default, this property is true, meaning that the animation\n  will start playing immediately.\n*\/\nbool QDeclarative1AnimatedImage::isPlaying() const\n{\n    Q_D(const QDeclarative1AnimatedImage);\n    if (!d->_movie)\n        return false;\n    return d->_movie->state()!=QMovie::NotRunning;\n}\n\nvoid QDeclarative1AnimatedImage::setPlaying(bool play)\n{\n    Q_D(QDeclarative1AnimatedImage);\n    if(play == d->playing)\n        return;\n    d->playing = play;\n    if (!d->_movie)\n        return;\n    if (play)\n        d->_movie->start();\n    else\n        d->_movie->stop();\n}\n\n\/*!\n  \\qmlproperty int QtQuick1::AnimatedImage::currentFrame\n  \\qmlproperty int QtQuick1::AnimatedImage::frameCount\n\n  currentFrame is the frame that is currently visible. By monitoring this property\n  for changes, you can animate other items at the same time as the image.\n\n  frameCount is the number of frames in the animation. For some animation formats,\n  frameCount is unknown and has a value of zero.\n*\/\nint QDeclarative1AnimatedImage::currentFrame() const\n{\n    Q_D(const QDeclarative1AnimatedImage);\n    if (!d->_movie)\n        return d->preset_currentframe;\n    return d->_movie->currentFrameNumber();\n}\n\nvoid QDeclarative1AnimatedImage::setCurrentFrame(int frame)\n{\n    Q_D(QDeclarative1AnimatedImage);\n    if (!d->_movie) {\n        d->preset_currentframe = frame;\n        return;\n    }\n    d->_movie->jumpToFrame(frame);\n}\n\nint QDeclarative1AnimatedImage::frameCount() const\n{\n    Q_D(const QDeclarative1AnimatedImage);\n    if (!d->_movie)\n        return 0;\n    return d->_movie->frameCount();\n}\n\nvoid QDeclarative1AnimatedImage::setSource(const QUrl &url)\n{\n    Q_D(QDeclarative1AnimatedImage);\n    if (url == d->url)\n        return;\n\n    delete d->_movie;\n    d->_movie = 0;\n\n    if (d->reply) {\n        d->reply->deleteLater();\n        d->reply = 0;\n    }\n\n    d->url = url;\n    emit sourceChanged(d->url);\n\n    if (isComponentComplete())\n        load();\n}\n\nvoid QDeclarative1AnimatedImage::load()\n{\n    Q_D(QDeclarative1AnimatedImage);\n\n    QDeclarative1ImageBase::Status oldStatus = d->status;\n    qreal oldProgress = d->progress;\n\n    if (d->url.isEmpty()) {\n        delete d->_movie;\n        d->setPixmap(QPixmap());\n        d->progress = 0;\n        d->status = Null;\n        if (d->status != oldStatus)\n            emit statusChanged(d->status);\n        if (d->progress != oldProgress)\n            emit progressChanged(d->progress);\n    } else {\n#ifndef QT_NO_LOCALFILE_OPTIMIZED_QML\n        QString lf = QDeclarativeEnginePrivate::urlToLocalFileOrQrc(d->url);\n        if (!lf.isEmpty()) {\n            \/\/### should be unified with movieRequestFinished\n            d->_movie = new QMovie(lf);\n            if (!d->_movie->isValid()){\n                qmlInfo(this) << \"Error Reading Animated Image File \" << d->url.toString();\n                delete d->_movie;\n                d->_movie = 0;\n                d->status = Error;\n                if (d->status != oldStatus)\n                    emit statusChanged(d->status);\n                return;\n            }\n            connect(d->_movie, SIGNAL(stateChanged(QMovie::MovieState)),\n                    this, SLOT(playingStatusChanged()));\n            connect(d->_movie, SIGNAL(frameChanged(int)),\n                    this, SLOT(movieUpdate()));\n            d->_movie->setCacheMode(QMovie::CacheAll);\n            if(d->playing)\n                d->_movie->start();\n            else\n                d->_movie->jumpToFrame(0);\n            if(d->paused)\n                d->_movie->setPaused(true);\n            d->setPixmap(d->_movie->currentPixmap());\n            d->status = Ready;\n            d->progress = 1.0;\n            if (d->status != oldStatus)\n                emit statusChanged(d->status);\n            if (d->progress != oldProgress)\n                emit progressChanged(d->progress);\n            return;\n        }\n#endif\n        d->status = Loading;\n        d->progress = 0;\n        emit statusChanged(d->status);\n        emit progressChanged(d->progress);\n        QNetworkRequest req(d->url);\n        req.setAttribute(QNetworkRequest::HttpPipeliningAllowedAttribute, true);\n        d->reply = qmlEngine(this)->networkAccessManager()->get(req);\n        QObject::connect(d->reply, SIGNAL(finished()),\n                         this, SLOT(movieRequestFinished()));\n        QObject::connect(d->reply, SIGNAL(downloadProgress(qint64,qint64)),\n                         this, SLOT(requestProgress(qint64,qint64)));\n    }\n}\n\n#define ANIMATEDIMAGE_MAXIMUM_REDIRECT_RECURSION 16\n\nvoid QDeclarative1AnimatedImage::movieRequestFinished()\n{\n    Q_D(QDeclarative1AnimatedImage);\n\n    d->redirectCount++;\n    if (d->redirectCount < ANIMATEDIMAGE_MAXIMUM_REDIRECT_RECURSION) {\n        QVariant redirect = d->reply->attribute(QNetworkRequest::RedirectionTargetAttribute);\n        if (redirect.isValid()) {\n            QUrl url = d->reply->url().resolved(redirect.toUrl());\n            d->reply->deleteLater();\n            d->reply = 0;\n            setSource(url);\n            return;\n        }\n    }\n    d->redirectCount=0;\n\n    d->_movie = new QMovie(d->reply);\n    if (!d->_movie->isValid()){\n#ifndef QT_NO_DEBUG_STREAM\n        qmlInfo(this) << \"Error Reading Animated Image File \" << d->url;\n#endif\n        delete d->_movie;\n        d->_movie = 0;\n        d->status = Error;\n        emit statusChanged(d->status);\n        return;\n    }\n    connect(d->_movie, SIGNAL(stateChanged(QMovie::MovieState)),\n            this, SLOT(playingStatusChanged()));\n    connect(d->_movie, SIGNAL(frameChanged(int)),\n            this, SLOT(movieUpdate()));\n    d->_movie->setCacheMode(QMovie::CacheAll);\n    if(d->playing)\n        d->_movie->start();\n    if (d->paused || !d->playing) {\n        d->_movie->jumpToFrame(d->preset_currentframe);\n        d->preset_currentframe = 0;\n    }\n    if(d->paused)\n        d->_movie->setPaused(true);\n    d->setPixmap(d->_movie->currentPixmap());\n    d->status = Ready;\n    emit statusChanged(d->status);\n}\n\nvoid QDeclarative1AnimatedImage::movieUpdate()\n{\n    Q_D(QDeclarative1AnimatedImage);\n    d->setPixmap(d->_movie->currentPixmap());\n    emit frameChanged();\n}\n\nvoid QDeclarative1AnimatedImage::playingStatusChanged()\n{\n    Q_D(QDeclarative1AnimatedImage);\n    if((d->_movie->state() != QMovie::NotRunning) != d->playing){\n        d->playing = (d->_movie->state() != QMovie::NotRunning);\n        emit playingChanged();\n    }\n    if((d->_movie->state() == QMovie::Paused) != d->paused){\n        d->playing = (d->_movie->state() == QMovie::Paused);\n        emit pausedChanged();\n    }\n}\n\nvoid QDeclarative1AnimatedImage::componentComplete()\n{\n    Q_D(QDeclarative1AnimatedImage);\n    QDeclarativeItem::componentComplete(); \/\/ NOT QDeclarative1Image\n    if (d->url.isValid())\n        load();\n    if (!d->reply) {\n        setCurrentFrame(d->preset_currentframe);\n        d->preset_currentframe = 0;\n    }\n}\n\n\n\nQT_END_NAMESPACE\n\n#endif \/\/ QT_NO_MOVIE\n<commit_msg>Fixes AnimatedImage documentation<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2011 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 QtDeclarative module of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** GNU Lesser General Public License Usage\n** This file may be used under the terms of the GNU Lesser General Public\n** License version 2.1 as published by the Free Software Foundation and\n** appearing in the file LICENSE.LGPL included in the packaging of this\n** file. Please review the following information to ensure the GNU Lesser\n** General Public License version 2.1 requirements will be met:\n** http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain additional\n** rights. These rights are described in the Nokia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU General\n** Public License version 3.0 as published by the Free Software Foundation\n** and appearing in the file LICENSE.GPL included in the packaging of this\n** file. Please review the following information to ensure the GNU General\n** Public License version 3.0 requirements will be met:\n** http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n** Other Usage\n** Alternatively, this file may be used in accordance with the terms and\n** conditions contained in a signed written agreement between you and Nokia.\n**\n**\n**\n**\n**\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"QtQuick1\/private\/qdeclarativeanimatedimage_p.h\"\n#include \"QtQuick1\/private\/qdeclarativeanimatedimage_p_p.h\"\n\n#ifndef QT_NO_MOVIE\n\n#include <QtDeclarative\/qdeclarativeinfo.h>\n#include <QtDeclarative\/private\/qdeclarativeengine_p.h>\n\n#include <QMovie>\n#include <QNetworkRequest>\n#include <QNetworkReply>\n\nQT_BEGIN_NAMESPACE\n\n\n\n\/*!\n    \\qmlclass AnimatedImage QDeclarative1AnimatedImage\n    \\inqmlmodule QtQuick 1\n    \\inherits Image\n    \\since QtQuick 1.0\n    \\ingroup basic-visual-elements\n\n    The AnimatedImage element extends the features of the \\l Image element, providing\n    a way to play animations stored as images containing a series of frames,\n    such as those stored in GIF files.\n\n    Information about the current frame and totla length of the animation can be\n    obtained using the \\l currentFrame and \\l frameCount properties. You can\n    start, pause and stop the animation by changing the values of the \\l playing\n    and \\l paused properties.\n\n    The full list of supported formats can be determined with QMovie::supportedFormats().\n\n    \\section1 Example Usage\n\n    \\beginfloatleft\n    \\image animatedimageitem.gif\n    \\endfloat\n\n    The following QML shows how to display an animated image and obtain information\n    about its state, such as the current frame and total number of frames.\n    The result is an animated image with a simple progress indicator underneath it.\n\n    \\bold Note: Unlike images, animated images are not cached or shared internally.\n\n    \\clearfloat\n    \\snippet doc\/src\/snippets\/declarative\/animatedimage.qml document\n\n    \\sa BorderImage, Image\n*\/\n\n\/*!\n    \\qmlproperty url QtQuick1::AnimatedImage::source\n\n    This property holds the URL that refers to the source image.\n\n    AnimatedImage can handle any image format supported by Qt, loaded from any\n    URL scheme supported by Qt.\n\n    \\sa QDeclarativeImageProvider\n*\/\n\n\/*!\n    \\qmlproperty bool QtQuick1::AnimatedImage::asynchronous\n\n    Specifies that images on the local filesystem should be loaded\n    asynchronously in a separate thread.  The default value is\n    false, causing the user interface thread to block while the\n    image is loaded.  Setting \\a asynchronous to true is useful where\n    maintaining a responsive user interface is more desirable\n    than having images immediately visible.\n\n    Note that this property is only valid for images read from the\n    local filesystem.  Images loaded via a network resource (e.g. HTTP)\n    are always loaded asynchonously.\n*\/\n\n\/*!\n    \\qmlproperty bool QtQuick1::AnimatedImage::mirror\n    \\since Quick 1.1\n\n    This property holds whether the image should be horizontally inverted\n    (effectively displaying a mirrored image).\n\n    The default value is false.\n*\/\n\nQDeclarative1AnimatedImage::QDeclarative1AnimatedImage(QDeclarativeItem *parent)\n    : QDeclarative1Image(*(new QDeclarative1AnimatedImagePrivate), parent)\n{\n}\n\nQDeclarative1AnimatedImage::~QDeclarative1AnimatedImage()\n{\n    Q_D(QDeclarative1AnimatedImage);\n    delete d->_movie;\n}\n\n\/*!\n  \\qmlproperty bool QtQuick1::AnimatedImage::paused\n  This property holds whether the animated image is paused.\n\n  By default, this property is false. Set it to true when you want to pause\n  the animation.\n*\/\nbool QDeclarative1AnimatedImage::isPaused() const\n{\n    Q_D(const QDeclarative1AnimatedImage);\n    if(!d->_movie)\n        return false;\n    return d->_movie->state()==QMovie::Paused;\n}\n\nvoid QDeclarative1AnimatedImage::setPaused(bool pause)\n{\n    Q_D(QDeclarative1AnimatedImage);\n    if(pause == d->paused)\n        return;\n    d->paused = pause;\n    if(!d->_movie)\n        return;\n    d->_movie->setPaused(pause);\n}\n\/*!\n  \\qmlproperty bool QtQuick1::AnimatedImage::playing\n  This property holds whether the animated image is playing.\n\n  By default, this property is true, meaning that the animation\n  will start playing immediately.\n*\/\nbool QDeclarative1AnimatedImage::isPlaying() const\n{\n    Q_D(const QDeclarative1AnimatedImage);\n    if (!d->_movie)\n        return false;\n    return d->_movie->state()!=QMovie::NotRunning;\n}\n\nvoid QDeclarative1AnimatedImage::setPlaying(bool play)\n{\n    Q_D(QDeclarative1AnimatedImage);\n    if(play == d->playing)\n        return;\n    d->playing = play;\n    if (!d->_movie)\n        return;\n    if (play)\n        d->_movie->start();\n    else\n        d->_movie->stop();\n}\n\n\/*!\n  \\qmlproperty int QtQuick1::AnimatedImage::currentFrame\n  \\qmlproperty int QtQuick1::AnimatedImage::frameCount\n\n  currentFrame is the frame that is currently visible. By monitoring this property\n  for changes, you can animate other items at the same time as the image.\n\n  frameCount is the number of frames in the animation. For some animation formats,\n  frameCount is unknown and has a value of zero.\n*\/\nint QDeclarative1AnimatedImage::currentFrame() const\n{\n    Q_D(const QDeclarative1AnimatedImage);\n    if (!d->_movie)\n        return d->preset_currentframe;\n    return d->_movie->currentFrameNumber();\n}\n\nvoid QDeclarative1AnimatedImage::setCurrentFrame(int frame)\n{\n    Q_D(QDeclarative1AnimatedImage);\n    if (!d->_movie) {\n        d->preset_currentframe = frame;\n        return;\n    }\n    d->_movie->jumpToFrame(frame);\n}\n\nint QDeclarative1AnimatedImage::frameCount() const\n{\n    Q_D(const QDeclarative1AnimatedImage);\n    if (!d->_movie)\n        return 0;\n    return d->_movie->frameCount();\n}\n\nvoid QDeclarative1AnimatedImage::setSource(const QUrl &url)\n{\n    Q_D(QDeclarative1AnimatedImage);\n    if (url == d->url)\n        return;\n\n    delete d->_movie;\n    d->_movie = 0;\n\n    if (d->reply) {\n        d->reply->deleteLater();\n        d->reply = 0;\n    }\n\n    d->url = url;\n    emit sourceChanged(d->url);\n\n    if (isComponentComplete())\n        load();\n}\n\nvoid QDeclarative1AnimatedImage::load()\n{\n    Q_D(QDeclarative1AnimatedImage);\n\n    QDeclarative1ImageBase::Status oldStatus = d->status;\n    qreal oldProgress = d->progress;\n\n    if (d->url.isEmpty()) {\n        delete d->_movie;\n        d->setPixmap(QPixmap());\n        d->progress = 0;\n        d->status = Null;\n        if (d->status != oldStatus)\n            emit statusChanged(d->status);\n        if (d->progress != oldProgress)\n            emit progressChanged(d->progress);\n    } else {\n#ifndef QT_NO_LOCALFILE_OPTIMIZED_QML\n        QString lf = QDeclarativeEnginePrivate::urlToLocalFileOrQrc(d->url);\n        if (!lf.isEmpty()) {\n            \/\/### should be unified with movieRequestFinished\n            d->_movie = new QMovie(lf);\n            if (!d->_movie->isValid()){\n                qmlInfo(this) << \"Error Reading Animated Image File \" << d->url.toString();\n                delete d->_movie;\n                d->_movie = 0;\n                d->status = Error;\n                if (d->status != oldStatus)\n                    emit statusChanged(d->status);\n                return;\n            }\n            connect(d->_movie, SIGNAL(stateChanged(QMovie::MovieState)),\n                    this, SLOT(playingStatusChanged()));\n            connect(d->_movie, SIGNAL(frameChanged(int)),\n                    this, SLOT(movieUpdate()));\n            d->_movie->setCacheMode(QMovie::CacheAll);\n            if(d->playing)\n                d->_movie->start();\n            else\n                d->_movie->jumpToFrame(0);\n            if(d->paused)\n                d->_movie->setPaused(true);\n            d->setPixmap(d->_movie->currentPixmap());\n            d->status = Ready;\n            d->progress = 1.0;\n            if (d->status != oldStatus)\n                emit statusChanged(d->status);\n            if (d->progress != oldProgress)\n                emit progressChanged(d->progress);\n            return;\n        }\n#endif\n        d->status = Loading;\n        d->progress = 0;\n        emit statusChanged(d->status);\n        emit progressChanged(d->progress);\n        QNetworkRequest req(d->url);\n        req.setAttribute(QNetworkRequest::HttpPipeliningAllowedAttribute, true);\n        d->reply = qmlEngine(this)->networkAccessManager()->get(req);\n        QObject::connect(d->reply, SIGNAL(finished()),\n                         this, SLOT(movieRequestFinished()));\n        QObject::connect(d->reply, SIGNAL(downloadProgress(qint64,qint64)),\n                         this, SLOT(requestProgress(qint64,qint64)));\n    }\n}\n\n#define ANIMATEDIMAGE_MAXIMUM_REDIRECT_RECURSION 16\n\nvoid QDeclarative1AnimatedImage::movieRequestFinished()\n{\n    Q_D(QDeclarative1AnimatedImage);\n\n    d->redirectCount++;\n    if (d->redirectCount < ANIMATEDIMAGE_MAXIMUM_REDIRECT_RECURSION) {\n        QVariant redirect = d->reply->attribute(QNetworkRequest::RedirectionTargetAttribute);\n        if (redirect.isValid()) {\n            QUrl url = d->reply->url().resolved(redirect.toUrl());\n            d->reply->deleteLater();\n            d->reply = 0;\n            setSource(url);\n            return;\n        }\n    }\n    d->redirectCount=0;\n\n    d->_movie = new QMovie(d->reply);\n    if (!d->_movie->isValid()){\n#ifndef QT_NO_DEBUG_STREAM\n        qmlInfo(this) << \"Error Reading Animated Image File \" << d->url;\n#endif\n        delete d->_movie;\n        d->_movie = 0;\n        d->status = Error;\n        emit statusChanged(d->status);\n        return;\n    }\n    connect(d->_movie, SIGNAL(stateChanged(QMovie::MovieState)),\n            this, SLOT(playingStatusChanged()));\n    connect(d->_movie, SIGNAL(frameChanged(int)),\n            this, SLOT(movieUpdate()));\n    d->_movie->setCacheMode(QMovie::CacheAll);\n    if(d->playing)\n        d->_movie->start();\n    if (d->paused || !d->playing) {\n        d->_movie->jumpToFrame(d->preset_currentframe);\n        d->preset_currentframe = 0;\n    }\n    if(d->paused)\n        d->_movie->setPaused(true);\n    d->setPixmap(d->_movie->currentPixmap());\n    d->status = Ready;\n    emit statusChanged(d->status);\n}\n\nvoid QDeclarative1AnimatedImage::movieUpdate()\n{\n    Q_D(QDeclarative1AnimatedImage);\n    d->setPixmap(d->_movie->currentPixmap());\n    emit frameChanged();\n}\n\nvoid QDeclarative1AnimatedImage::playingStatusChanged()\n{\n    Q_D(QDeclarative1AnimatedImage);\n    if((d->_movie->state() != QMovie::NotRunning) != d->playing){\n        d->playing = (d->_movie->state() != QMovie::NotRunning);\n        emit playingChanged();\n    }\n    if((d->_movie->state() == QMovie::Paused) != d->paused){\n        d->playing = (d->_movie->state() == QMovie::Paused);\n        emit pausedChanged();\n    }\n}\n\nvoid QDeclarative1AnimatedImage::componentComplete()\n{\n    Q_D(QDeclarative1AnimatedImage);\n    QDeclarativeItem::componentComplete(); \/\/ NOT QDeclarative1Image\n    if (d->url.isValid())\n        load();\n    if (!d->reply) {\n        setCurrentFrame(d->preset_currentframe);\n        d->preset_currentframe = 0;\n    }\n}\n\n\n\nQT_END_NAMESPACE\n\n#endif \/\/ QT_NO_MOVIE\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Modified comments for HARMONY-6020 and r731515<commit_after><|endoftext|>"}
{"text":"<commit_before>\/* Copyright (C) 2011 The giomm 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\/*\n\nUsage examples (modulo addresses \/ credentials) (copied from the C API's\nGDBusServer's example).\n\nUNIX domain socket transport:\n\n Server:\n   $ .\/peer --server --address unix:abstract=myaddr\n   Server is listening at: unix:abstract=myaddr\n   Client connected.\n   Peer credentials: GCredentials:unix-user=500,unix-group=500,unix-process=13378\n   Negotiated capabilities: unix-fd-passing=1\n   Client said: Hey, it's 1273093080 already!\n\n Client:\n   $ .\/peer --address unix:abstract=myaddr\n   Connected.\n   Negotiated capabilities: unix-fd-passing=1\n   Server said: You said 'Hey, it's 1273093080 already!'. KTHXBYE!\n\nNonce-secured TCP transport on the same host:\n\n Server:\n   $ .\/peer --server --address nonce-tcp:\n   Server is listening at: nonce-tcp:host=localhost,port=43077,noncefile=\/tmp\/gdbus-nonce-file-X1ZNCV\n   Client connected.\n   Peer credentials: (no credentials received)\n   Negotiated capabilities: unix-fd-passing=0\n   Client said: Hey, it's 1273093206 already!\n\n Client:\n   $ .\/peer -address nonce-tcp:host=localhost,port=43077,noncefile=\/tmp\/gdbus-nonce-file-X1ZNCV\n   Connected.\n   Negotiated capabilities: unix-fd-passing=0\n   Server said: You said 'Hey, it's 1273093206 already!'. KTHXBYE!\n\nTCP transport on two different hosts with a shared home directory:\n\n Server:\n   host1 $ .\/peer --server --address tcp:host=0.0.0.0\n   Server is listening at: tcp:host=0.0.0.0,port=46314\n   Client connected.\n   Peer credentials: (no credentials received)\n   Negotiated capabilities: unix-fd-passing=0\n   Client said: Hey, it's 1273093337 already!\n\n Client:\n   host2 $ .\/peer -a tcp:host=host1,port=46314\n   Connected.\n   Negotiated capabilities: unix-fd-passing=0\n   Server said: You said 'Hey, it's 1273093337 already!'. KTHXBYE!\n\nTCP transport on two different hosts without authentication:\n\n Server:\n   host1 $ .\/peer --server --address tcp:host=0.0.0.0 --allow-anonymous\n   Server is listening at: tcp:host=0.0.0.0,port=59556\n   Client connected.\n   Peer credentials: (no credentials received)\n   Negotiated capabilities: unix-fd-passing=0\n   Client said: Hey, it's 1273093652 already!\n\n Client:\n   host2 $ .\/peer -a tcp:host=host1,port=59556\n   Connected.\n   Negotiated capabilities: unix-fd-passing=0\n   Server said: You said 'Hey, it's 1273093652 already!'. KTHXBYE!\n*\/\n\n#include <giomm.h>\n#include <glibmm.h>\n#include <iostream>\n\nstatic Glib::RefPtr<Gio::DBus::NodeInfo> introspection_data;\n\nstatic Glib::ustring introspection_xml =\n  \"<node>\"\n  \"  <interface name='org.glibmm.DBus.TestPeerInterface'>\"\n  \"    <method name='HelloWorld'>\"\n  \"      <arg type='s' name='greeting' direction='in'\/>\"\n  \"      <arg type='s' name='response' direction='out'\/>\"\n  \"    <\/method>\"\n  \"  <\/interface>\"\n  \"<\/node>\";\n\n\/\/ This variable is used to keep an incoming connection active until it is\n\/\/ closed.\nstatic Glib::RefPtr<Gio::DBus::Connection> curr_connection;\n\nstatic void on_method_call(const Glib::RefPtr<Gio::DBus::Connection>&,\n  const Glib::ustring& \/* sender *\/, const Glib::ustring& \/* object_path *\/,\n  const Glib::ustring& \/* interface_name *\/, const Glib::ustring& method_name,\n  \/\/ Since the parameters are generally tuples, get them from the invocation.\n  const Glib::VariantBase& \/* parameters *\/,\n  const Glib::RefPtr<Gio::DBus::MethodInvocation>& invocation)\n{\n  if(method_name == \"HelloWorld\")\n  {\n    \/\/ Get parameters.\n    Glib::VariantContainerBase parameters;\n    invocation->get_parameters(parameters);\n\n    \/\/ Get (expected) single string in tupple.\n    Glib::Variant<Glib::ustring> param;\n    parameters.get_child(param);\n\n    Glib::ustring response = \"You said: '\" + param.get() + \"'.\";\n\n    Glib::Variant<Glib::ustring> answer =\n      Glib::Variant<Glib::ustring>::create(response);\n\n    std::vector<Glib::VariantBase> var_array;\n    var_array.push_back(answer);\n\n    Glib::VariantContainerBase ret =\n      Glib::VariantContainerBase::create_tuple(var_array);\n\n    invocation->return_value(ret);\n\n    std::cout << \"Client said '\" << param.get() << \"'.\" << std::endl;\n  }\n}\n\n\/\/ Create the interface VTable.\nstatic const Gio::DBus::InterfaceVTable\n  interface_vtable(sigc::ptr_fun(&on_method_call));\n\nbool on_new_connection(const Glib::RefPtr<Gio::DBus::Connection>& connection)\n{\n  Glib::RefPtr<Gio::Credentials> credentials =\n    connection->get_peer_credentials();\n\n  std::string credentials_str;\n\n  if(!credentials)\n    credentials_str = \"(no credentials received)\";\n  else\n    credentials_str = credentials->to_string();\n\n  std::cout <<\n    \"Client connected.\" << std::endl <<\n    \"Peer credentials: \" << credentials_str << std::endl <<\n    \"Negotiated capabilities: unix-fd-passing=\" << (connection->get_capabilities() & Gio::DBus::CAPABILITY_FLAGS_UNIX_FD_PASSING) << std::endl;\n\n  \/\/ If there is already an active connection, do not accept this new one.\n  \/\/ There may be a better way to decide how to keep current incoming\n  \/\/ connections.\n  if(curr_connection && !curr_connection->is_closed())\n  {\n    std::cerr << \"Unable to accept new incoming connection because one is \"\n      \"already active.\" << std::endl;\n\n    return false;\n  }\n\n  \/\/ In order for the connection to stay active the reference to the\n  \/\/ connection must be kept so store the connection in a global variable.\n  curr_connection = connection;\n\n  guint reg_id = connection->register_object(\"\/org\/glibmm\/DBus\/TestObject\",\n    introspection_data->lookup_interface(\"org.glibmm.DBus.TestPeerInterface\"),\n    &interface_vtable);\n\n  if(reg_id == 0)\n  {\n    std::cerr << \"Registration of object for incoming connection not \"\n      \"possible.\" << std::endl;\n    return false;\n  }\n\n  return true;\n}\n\nvoid run_as_server(Glib::ustring address, bool allow_anonymous)\n{\n  Glib::ustring guid = Gio::DBus::generate_guid();\n  Gio::DBus::ServerFlags flags = Gio::DBus::SERVER_FLAGS_NONE;\n\n  if(allow_anonymous)\n    flags |= Gio::DBus::SERVER_FLAGS_AUTHENTICATION_ALLOW_ANONYMOUS;\n\n  Glib::RefPtr<Gio::DBus::Server> server;\n\n  try\n  {\n    server = Gio::DBus::Server::create_sync(address, guid, flags);\n  }\n  catch(const Glib::Error& ex)\n  {\n    std::cerr << \"Error creating server at address: \" << address <<\n      \": \" << ex.what() << \".\" << std::endl;\n    return;\n  }\n\n  server->start();\n\n  std::cout << \"Server is listening at: \" << server->get_client_address() <<\n    \".\" << std::endl;\n\n  server->signal_new_connection().connect(sigc::ptr_fun(&on_new_connection));\n\n  Glib::RefPtr<Glib::MainLoop> loop = Glib::MainLoop::create();\n  loop->run();\n}\n\nvoid run_as_client(Glib::ustring address)\n{\n  Glib::RefPtr<Gio::DBus::Connection> connection;\n\n  try\n  {\n    connection = Gio::DBus::Connection::create_for_address_sync(address,\n      Gio::DBus::CONNECTION_FLAGS_AUTHENTICATION_CLIENT);\n  }\n  catch(const Glib::Error& ex)\n  {\n    std::cerr << \"Error connecting to D-Bus address \" << address << \": \" <<\n      ex.what() << \".\" << std::endl;\n    return;\n  }\n\n  std::cout << \"Connected. \" << std::endl <<\n    \"Negotiated capabilities: unix-fd-passing=\" <<\n    static_cast<bool>(connection->get_capabilities() & Gio::DBus::CAPABILITY_FLAGS_UNIX_FD_PASSING) << \".\" << std::endl;\n\n  \/\/ Get the current time to send as a greeting when calling a server's method.\n  Glib::TimeVal time;\n  time.assign_current_time();\n\n  \/\/ Create the single string tuple parameter for the method call.\n\n  Glib::ustring greeting(\"Hello, it's: \"  + time.as_iso8601() + '.');\n\n  Glib::Variant<Glib::ustring> param =\n    Glib::Variant<Glib::ustring>::create(greeting);\n\n  std::vector<Glib::VariantBase> variants;\n  variants.push_back(param);\n\n  Glib::VariantContainerBase parameters =\n    Glib::VariantContainerBase::create_tuple(variants);\n\n  try\n  {\n    const Glib::VariantContainerBase result =\n      connection->call_sync( \"\/org\/glibmm\/DBus\/TestObject\",\n      \"org.glibmm.DBus.TestPeerInterface\",\n      \"HelloWorld\", parameters);\n\n    Glib::Variant<Glib::ustring> child;\n    result.get_child(child);\n\n    std::cout << \"The server said: \" << child.get() << \".\" << std::endl;\n\n    connection->close_sync();\n  }\n  catch(const Glib::Error& ex)\n  {\n    std::cerr << \"Error communicating with the server: \" << ex.what() <<\n      \".\" << std::endl;\n    return;\n  }\n}\n\nint main(int argc, char** argv)\n{\n  std::locale::global(std::locale(\"\"));\n  Gio::init();\n\n  bool opt_server = false;\n  char* opt_address = 0;\n  bool opt_allow_anonymous = false;\n\n  static const GOptionEntry opt_entries[] =\n  {\n    { \"server\", 's', 0, G_OPTION_ARG_NONE, &opt_server, \"Start a server instead of a client\", NULL },\n      { \"address\", 'a', 0, G_OPTION_ARG_STRING, &opt_address, \"D-Bus address to use\", NULL },\n      { \"allow-anonymous\", 'n', 0, G_OPTION_ARG_NONE, &opt_allow_anonymous, \"Allow anonymous authentication\", NULL },\n      { 0, '\\0', 0, G_OPTION_ARG_NONE, 0, 0, 0 }\n  };\n\n  Glib::OptionContext opt_context(\"DBus peer-to-peer example\");\n  g_option_context_add_main_entries(opt_context.gobj(), opt_entries, 0);\n\n  try\n  {\n    if(!opt_context.parse(argc, argv))\n    {\n      std::cerr << \"Error parsing options and initializing.  Sorry.\" <<\n        std::endl;\n      return 1;\n    }\n  }\n  catch(const Glib::OptionError& ex)\n  {\n    std::cerr << \"Error parsing options: \" << ex.what() << std::endl;\n    return 1;\n  }\n\n  if(!opt_address)\n  {\n    std::cerr << \"Incorrect usage, try the --help options.\" << std::endl;\n    return 1;\n  }\n\n  if(!opt_server && opt_allow_anonymous)\n  {\n    std::cerr << \"The --allow-anonymous option is only valid with the \"\n      \"--server option.\" << std::endl;\n    return 1;\n  }\n\n  try\n  {\n    introspection_data = Gio::DBus::NodeInfo::create_for_xml(introspection_xml);\n  }\n  catch(const Glib::Error& ex)\n  {\n    std::cerr << \"Unable to create introspection data: \" << ex.what() <<\n      \".\" << std::endl;\n    return 1;\n  }\n\n  if(opt_server)\n    run_as_server(opt_address, opt_allow_anonymous);\n  else\n    run_as_client(opt_address);\n\n  return 0;\n}\n<commit_msg>Code style change.<commit_after>\/* Copyright (C) 2011 The giomm 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\/*\n\nUsage examples (modulo addresses \/ credentials) (copied from the C API's\nGDBusServer's example).\n\nUNIX domain socket transport:\n\n Server:\n   $ .\/peer --server --address unix:abstract=myaddr\n   Server is listening at: unix:abstract=myaddr\n   Client connected.\n   Peer credentials: GCredentials:unix-user=500,unix-group=500,unix-process=13378\n   Negotiated capabilities: unix-fd-passing=1\n   Client said: Hey, it's 1273093080 already!\n\n Client:\n   $ .\/peer --address unix:abstract=myaddr\n   Connected.\n   Negotiated capabilities: unix-fd-passing=1\n   Server said: You said 'Hey, it's 1273093080 already!'. KTHXBYE!\n\nNonce-secured TCP transport on the same host:\n\n Server:\n   $ .\/peer --server --address nonce-tcp:\n   Server is listening at: nonce-tcp:host=localhost,port=43077,noncefile=\/tmp\/gdbus-nonce-file-X1ZNCV\n   Client connected.\n   Peer credentials: (no credentials received)\n   Negotiated capabilities: unix-fd-passing=0\n   Client said: Hey, it's 1273093206 already!\n\n Client:\n   $ .\/peer -address nonce-tcp:host=localhost,port=43077,noncefile=\/tmp\/gdbus-nonce-file-X1ZNCV\n   Connected.\n   Negotiated capabilities: unix-fd-passing=0\n   Server said: You said 'Hey, it's 1273093206 already!'. KTHXBYE!\n\nTCP transport on two different hosts with a shared home directory:\n\n Server:\n   host1 $ .\/peer --server --address tcp:host=0.0.0.0\n   Server is listening at: tcp:host=0.0.0.0,port=46314\n   Client connected.\n   Peer credentials: (no credentials received)\n   Negotiated capabilities: unix-fd-passing=0\n   Client said: Hey, it's 1273093337 already!\n\n Client:\n   host2 $ .\/peer -a tcp:host=host1,port=46314\n   Connected.\n   Negotiated capabilities: unix-fd-passing=0\n   Server said: You said 'Hey, it's 1273093337 already!'. KTHXBYE!\n\nTCP transport on two different hosts without authentication:\n\n Server:\n   host1 $ .\/peer --server --address tcp:host=0.0.0.0 --allow-anonymous\n   Server is listening at: tcp:host=0.0.0.0,port=59556\n   Client connected.\n   Peer credentials: (no credentials received)\n   Negotiated capabilities: unix-fd-passing=0\n   Client said: Hey, it's 1273093652 already!\n\n Client:\n   host2 $ .\/peer -a tcp:host=host1,port=59556\n   Connected.\n   Negotiated capabilities: unix-fd-passing=0\n   Server said: You said 'Hey, it's 1273093652 already!'. KTHXBYE!\n*\/\n\n#include <giomm.h>\n#include <glibmm.h>\n#include <iostream>\n\nstatic Glib::RefPtr<Gio::DBus::NodeInfo> introspection_data;\n\nstatic Glib::ustring introspection_xml =\n  \"<node>\"\n  \"  <interface name='org.glibmm.DBus.TestPeerInterface'>\"\n  \"    <method name='HelloWorld'>\"\n  \"      <arg type='s' name='greeting' direction='in'\/>\"\n  \"      <arg type='s' name='response' direction='out'\/>\"\n  \"    <\/method>\"\n  \"  <\/interface>\"\n  \"<\/node>\";\n\n\/\/ This variable is used to keep an incoming connection active until it is\n\/\/ closed.\nstatic Glib::RefPtr<Gio::DBus::Connection> curr_connection;\n\nstatic void on_method_call(const Glib::RefPtr<Gio::DBus::Connection>&,\n  const Glib::ustring& \/* sender *\/, const Glib::ustring& \/* object_path *\/,\n  const Glib::ustring& \/* interface_name *\/, const Glib::ustring& method_name,\n  \/\/ Since the parameters are generally tuples, get them from the invocation.\n  const Glib::VariantBase& \/* parameters *\/,\n  const Glib::RefPtr<Gio::DBus::MethodInvocation>& invocation)\n{\n  if(method_name == \"HelloWorld\")\n  {\n    \/\/ Get parameters.\n    Glib::VariantContainerBase parameters;\n    invocation->get_parameters(parameters);\n\n    \/\/ Get (expected) single string in tupple.\n    Glib::Variant<Glib::ustring> param;\n    parameters.get_child(param);\n\n    Glib::ustring response = \"You said: '\" + param.get() + \"'.\";\n\n    Glib::Variant<Glib::ustring> answer =\n      Glib::Variant<Glib::ustring>::create(response);\n\n    std::vector<Glib::VariantBase> var_array;\n    var_array.push_back(answer);\n\n    Glib::VariantContainerBase ret =\n      Glib::VariantContainerBase::create_tuple(var_array);\n\n    invocation->return_value(ret);\n\n    std::cout << \"Client said '\" << param.get() << \"'.\" << std::endl;\n  }\n}\n\n\/\/ Create the interface VTable.\nstatic const Gio::DBus::InterfaceVTable\n  interface_vtable(sigc::ptr_fun(&on_method_call));\n\nbool on_new_connection(const Glib::RefPtr<Gio::DBus::Connection>& connection)\n{\n  Glib::RefPtr<Gio::Credentials> credentials =\n    connection->get_peer_credentials();\n\n  std::string credentials_str;\n\n  if(!credentials)\n    credentials_str = \"(no credentials received)\";\n  else\n    credentials_str = credentials->to_string();\n\n  std::cout <<\n    \"Client connected.\" << std::endl <<\n    \"Peer credentials: \" << credentials_str << std::endl <<\n    \"Negotiated capabilities: unix-fd-passing=\" << (connection->get_capabilities() & Gio::DBus::CAPABILITY_FLAGS_UNIX_FD_PASSING) << std::endl;\n\n  \/\/ If there is already an active connection, do not accept this new one.\n  \/\/ There may be a better way to decide how to keep current incoming\n  \/\/ connections.\n  if(curr_connection && !curr_connection->is_closed())\n  {\n    std::cerr << \"Unable to accept new incoming connection because one is \"\n      \"already active.\" << std::endl;\n\n    return false;\n  }\n\n  \/\/ In order for the connection to stay active the reference to the\n  \/\/ connection must be kept so store the connection in a global variable.\n  curr_connection = connection;\n\n  guint reg_id = connection->register_object(\"\/org\/glibmm\/DBus\/TestObject\",\n    introspection_data->lookup_interface(\"org.glibmm.DBus.TestPeerInterface\"),\n    &interface_vtable);\n\n  if(reg_id == 0)\n  {\n    std::cerr << \"Registration of object for incoming connection not \"\n      \"possible.\" << std::endl;\n    return false;\n  }\n\n  return true;\n}\n\nvoid run_as_server(const Glib::ustring& address, bool allow_anonymous)\n{\n  Glib::ustring guid = Gio::DBus::generate_guid();\n  Gio::DBus::ServerFlags flags = Gio::DBus::SERVER_FLAGS_NONE;\n\n  if(allow_anonymous)\n    flags |= Gio::DBus::SERVER_FLAGS_AUTHENTICATION_ALLOW_ANONYMOUS;\n\n  Glib::RefPtr<Gio::DBus::Server> server;\n\n  try\n  {\n    server = Gio::DBus::Server::create_sync(address, guid, flags);\n  }\n  catch(const Glib::Error& ex)\n  {\n    std::cerr << \"Error creating server at address: \" << address <<\n      \": \" << ex.what() << \".\" << std::endl;\n    return;\n  }\n\n  server->start();\n\n  std::cout << \"Server is listening at: \" << server->get_client_address() <<\n    \".\" << std::endl;\n\n  server->signal_new_connection().connect(sigc::ptr_fun(&on_new_connection));\n\n  Glib::RefPtr<Glib::MainLoop> loop = Glib::MainLoop::create();\n  loop->run();\n}\n\nvoid run_as_client(const Glib::ustring& address)\n{\n  Glib::RefPtr<Gio::DBus::Connection> connection;\n\n  try\n  {\n    connection = Gio::DBus::Connection::create_for_address_sync(address,\n      Gio::DBus::CONNECTION_FLAGS_AUTHENTICATION_CLIENT);\n  }\n  catch(const Glib::Error& ex)\n  {\n    std::cerr << \"Error connecting to D-Bus address \" << address << \": \" <<\n      ex.what() << \".\" << std::endl;\n    return;\n  }\n\n  std::cout << \"Connected. \" << std::endl <<\n    \"Negotiated capabilities: unix-fd-passing=\" <<\n    static_cast<bool>(connection->get_capabilities() & Gio::DBus::CAPABILITY_FLAGS_UNIX_FD_PASSING) << \".\" << std::endl;\n\n  \/\/ Get the current time to send as a greeting when calling a server's method.\n  Glib::TimeVal time;\n  time.assign_current_time();\n\n  \/\/ Create the single string tuple parameter for the method call.\n\n  Glib::ustring greeting(\"Hello, it's: \"  + time.as_iso8601() + '.');\n\n  Glib::Variant<Glib::ustring> param =\n    Glib::Variant<Glib::ustring>::create(greeting);\n\n  std::vector<Glib::VariantBase> variants;\n  variants.push_back(param);\n\n  Glib::VariantContainerBase parameters =\n    Glib::VariantContainerBase::create_tuple(variants);\n\n  try\n  {\n    const Glib::VariantContainerBase result =\n      connection->call_sync( \"\/org\/glibmm\/DBus\/TestObject\",\n      \"org.glibmm.DBus.TestPeerInterface\",\n      \"HelloWorld\", parameters);\n\n    Glib::Variant<Glib::ustring> child;\n    result.get_child(child);\n\n    std::cout << \"The server said: \" << child.get() << \".\" << std::endl;\n\n    connection->close_sync();\n  }\n  catch(const Glib::Error& ex)\n  {\n    std::cerr << \"Error communicating with the server: \" << ex.what() <<\n      \".\" << std::endl;\n    return;\n  }\n}\n\nint main(int argc, char** argv)\n{\n  std::locale::global(std::locale(\"\"));\n  Gio::init();\n\n  bool opt_server = false;\n  char* opt_address = 0;\n  bool opt_allow_anonymous = false;\n\n  static const GOptionEntry opt_entries[] =\n  {\n    { \"server\", 's', 0, G_OPTION_ARG_NONE, &opt_server, \"Start a server instead of a client\", NULL },\n      { \"address\", 'a', 0, G_OPTION_ARG_STRING, &opt_address, \"D-Bus address to use\", NULL },\n      { \"allow-anonymous\", 'n', 0, G_OPTION_ARG_NONE, &opt_allow_anonymous, \"Allow anonymous authentication\", NULL },\n      { 0, '\\0', 0, G_OPTION_ARG_NONE, 0, 0, 0 }\n  };\n\n  Glib::OptionContext opt_context(\"DBus peer-to-peer example\");\n  g_option_context_add_main_entries(opt_context.gobj(), opt_entries, 0);\n\n  try\n  {\n    if(!opt_context.parse(argc, argv))\n    {\n      std::cerr << \"Error parsing options and initializing.  Sorry.\" <<\n        std::endl;\n      return 1;\n    }\n  }\n  catch(const Glib::OptionError& ex)\n  {\n    std::cerr << \"Error parsing options: \" << ex.what() << std::endl;\n    return 1;\n  }\n\n  if(!opt_address)\n  {\n    std::cerr << \"Incorrect usage, try the --help options.\" << std::endl;\n    return 1;\n  }\n\n  if(!opt_server && opt_allow_anonymous)\n  {\n    std::cerr << \"The --allow-anonymous option is only valid with the \"\n      \"--server option.\" << std::endl;\n    return 1;\n  }\n\n  try\n  {\n    introspection_data = Gio::DBus::NodeInfo::create_for_xml(introspection_xml);\n  }\n  catch(const Glib::Error& ex)\n  {\n    std::cerr << \"Unable to create introspection data: \" << ex.what() <<\n      \".\" << std::endl;\n    return 1;\n  }\n\n  if(opt_server)\n    run_as_server(opt_address, opt_allow_anonymous);\n  else\n    run_as_client(opt_address);\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Update file.cc<commit_after><|endoftext|>"}
{"text":"<commit_before>\/* Copyright (c) 2018 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 <string>\n#include <vector>\n#include \"paddle\/fluid\/framework\/op_registry.h\"\n\nnamespace paddle {\nnamespace operators {\n\nclass UnsqueezeOpInferShape : public framework::InferShapeBase {\n public:\n  void operator()(framework::InferShapeContext *ctx) const override {\n    PADDLE_ENFORCE(ctx->HasInput(\"X\"),\n                   \"Input(X) of UnsqueezeOp should not be null.\");\n    PADDLE_ENFORCE(ctx->HasOutput(\"Out\"),\n                   \"Output(Out) of UnsqueezeOp should not be null.\");\n\n    const auto &axes = ctx->Attrs().Get<std::vector<int>>(\"axes\");\n    const auto &x_dims = ctx->GetInputDim(\"X\");\n    \/\/ Validity Check: input tensor dims (<6).\n    PADDLE_ENFORCE(static_cast<int>(x_dims.size()) <= 6,\n                   \"Invalid dimensions, dynamic dimensions should within \"\n                   \"[1, 6] dimensions (Eigen limit).\");\n    auto out_dims = GetOutputShape(axes, x_dims);\n    ctx->SetOutputDim(\"Out\", out_dims);\n    if (x_dims[0] == out_dims[0]) {\n      \/\/ Only pass LoD when the first dimension of output and Input(X)\n      \/\/ are the same.\n      ctx->ShareLoD(\"X\", \"Out\");\n    }\n  }\n\n  static framework::DDim GetOutputShape(const std::vector<int> unsqz_dims,\n                                        const framework::DDim &in_dims) {\n    int output_size = static_cast<int>(in_dims.size() + unsqz_dims.size());\n    int cur_output_size = static_cast<int>(in_dims.size());\n    std::vector<int64_t> output_shape(output_size, 0);\n\n    \/\/ Validity Check: rank range.\n    PADDLE_ENFORCE(output_size <= 6,\n                   \"The output tensor's rank should be less than 6.\");\n\n    for (int axis : unsqz_dims) {\n      int cur = axis < 0 ? axis + cur_output_size + 1 : axis;\n      \/\/ Vaildity Check: the axis bound\n      PADDLE_ENFORCE(\n          cur >= 0 && cur <= cur_output_size,\n          \"The unsqueeze dims must be within range of current rank.\");\n      \/\/ Move old axis, and insert new axis\n      for (int i = cur_output_size; i >= cur; --i) {\n        if (output_shape[i] == 1) {\n          \/\/ Move axis\n          output_shape[i + 1] = 1;\n          output_shape[i] = 0;\n        }\n      }\n      output_shape[cur] = 1;\n      \/\/ Add the output size.\n      cur_output_size++;\n    }\n\n    \/\/ Make output shape\n    for (int in_idx = 0, out_idx = 0; out_idx < output_size; ++out_idx) {\n      if (output_shape[out_idx] == 0) {\n        output_shape[out_idx] = in_dims[in_idx++];\n      }\n    }\n\n    return framework::make_ddim(output_shape);\n  }\n};\n\nclass UnsqueezeOp : public framework::OperatorBase {\n public:\n  using OperatorBase::OperatorBase;\n\n private:\n  void RunImpl(const framework::Scope &scope,\n               const platform::Place &place) const override {\n    auto &axes = Attr<std::vector<int>>(\"axes\");\n    auto x_dims = scope.FindVar(Input(\"X\"))->Get<framework::LoDTensor>().dims();\n    auto out_dims = UnsqueezeOpInferShape::GetOutputShape(axes, x_dims);\n\n    framework::AttributeMap attrs;\n    attrs[\"shape\"] = framework::vectorize2int(out_dims);\n    attrs[\"inplace\"] = Attr<bool>(\"inplace\");\n    \/\/ Invoke Reshape op.\n    auto reshape_op = framework::OpRegistry::CreateOp(\n        \"reshape\", {{\"X\", {Input(\"X\")}}, {\"Shape\", {}}},\n        {{\"Out\", {Output(\"Out\")}}}, attrs);\n    reshape_op->Run(scope, place);\n  }\n};\n\nclass UnsqueezeOpMaker : public framework::OpProtoAndCheckerMaker {\n public:\n  void Make() override {\n    AddInput(\"X\", \"(Tensor). The input tensor of unsqueeze operator.\");\n    AddOutput(\"Out\", \"(Tensor). The output tensor of unsqueeze operator.\");\n    AddAttr<std::vector<int>>(\"axes\",\n                              \"(std::vector<int>). List of positive integers,\"\n                              \" indicate the dimensions to be inserted\")\n        .AddCustomChecker([](const std::vector<int> &axes) {\n          PADDLE_ENFORCE(\n              !axes.empty(),\n              \"The unsqueeze axes information must be set by Attr(axes).\");\n          \/\/ Validity Check: axes dims (<6).\n          PADDLE_ENFORCE(static_cast<int>(axes.size()) < 6,\n                         \"Invalid dimensions, dynamic dimensions should within \"\n                         \"[1, 6] dimensions (Eigen limit).\");\n          \/\/ Validity Check: the range of unsqueeze aixs.\n          for (int axis : axes) {\n            PADDLE_ENFORCE(axis < 6,\n                           \"Invalid dimensions, input axis should within \"\n                           \"[1, 6] dimensions (Eigen limit).\");\n          }\n        });\n    AddAttr<bool>(\n        \"inplace\",\n        \"(default: false) Unsqueeze the source tensor's shape without \"\n        \"memory copy. When Attr(inplace) is set true, the output \"\n        \"tensor shares memory with Input(X), otherwise, a new output \"\n        \"tensor is created, and its data are copied from Input(x).\")\n        .SetDefault(false);\n    AddComment(R\"DOC(\n    Unsqueeze Operator.\n    \n    Insert single-dimensional entries to the shape of a tensor. \n    Takes one required argument axes, a list of dimensions that will be inserted. \n    Dimension indices in axes are as seen in the output tensor. \n\n    For example: \n      Given a tensor such that tensor with shape [3, 4, 5], \n      then Unsqueeze(tensor, axes=[0, 4]) has shape [1, 3, 4, 5, 1]\n    )DOC\");\n  }\n};\n\nclass UnsqueezeGradInferShape : public framework::InferShapeBase {\n public:\n  void operator()(framework::InferShapeContext *ctx) const override {\n    ctx->SetOutputDim(framework::GradVarName(\"X\"), ctx->GetInputDim(\"X\"));\n    ctx->ShareLoD(\"X\", framework::GradVarName(\"X\"));\n  }\n};\n\nclass UnsqueezeGradOp : public framework::OperatorBase {\n public:\n  using OperatorBase::OperatorBase;\n\n private:\n  void RunImpl(const framework::Scope &scope,\n               const platform::Place &place) const override {\n    auto dx_name = Output(framework::GradVarName(\"X\"));\n    auto dout_name = Input(framework::GradVarName(\"Out\"));\n    auto x_dims = scope.FindVar(Input(\"X\"))->Get<framework::LoDTensor>().dims();\n\n    framework::AttributeMap attrs;\n    attrs[\"shape\"] = framework::vectorize2int(x_dims);\n    attrs[\"inplace\"] = Attr<bool>(\"inplace\");\n\n    auto reshape_op = framework::OpRegistry::CreateOp(\n        \"reshape\", {{\"X\", {dout_name}}, {\"Shape\", {}}}, {{\"Out\", {dx_name}}},\n        attrs);\n    reshape_op->Run(scope, place);\n  }\n};\n\n}  \/\/ namespace operators\n}  \/\/ namespace paddle\n\n\/\/ Tell linker to use reshape op.\nUSE_OP(reshape);\n\nnamespace ops = paddle::operators;\nREGISTER_OPERATOR(unsqueeze, ops::UnsqueezeOp, ops::UnsqueezeOpMaker,\n                  ops::UnsqueezeOpInferShape,\n                  paddle::framework::DefaultGradOpDescMaker<true>);\nREGISTER_OPERATOR(unsqueeze_grad, ops::UnsqueezeGradOp,\n                  ops::UnsqueezeGradInferShape);\n<commit_msg>refine some messages and adjust data type<commit_after>\/* Copyright (c) 2018 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 <string>\n#include <vector>\n#include \"paddle\/fluid\/framework\/op_registry.h\"\n\nnamespace paddle {\nnamespace operators {\n\nclass UnsqueezeOpInferShape : public framework::InferShapeBase {\n public:\n  void operator()(framework::InferShapeContext *ctx) const override {\n    PADDLE_ENFORCE(ctx->HasInput(\"X\"),\n                   \"Input(X) of UnsqueezeOp should not be null.\");\n    PADDLE_ENFORCE(ctx->HasOutput(\"Out\"),\n                   \"Output(Out) of UnsqueezeOp should not be null.\");\n\n    const auto &axes = ctx->Attrs().Get<std::vector<int>>(\"axes\");\n    const auto &x_dims = ctx->GetInputDim(\"X\");\n    \/\/ Validity Check: input tensor dims (<6).\n    PADDLE_ENFORCE(x_dims.size() <= 6,\n                   \"Invalid dimensions, the rank of Input(X) \"\n                   \"should be in the range of [1, 6] (Eigen limit)\");\n    auto out_dims = GetOutputShape(axes, x_dims);\n    ctx->SetOutputDim(\"Out\", out_dims);\n    if (x_dims[0] == out_dims[0]) {\n      \/\/ Only pass LoD when the first dimension of output and Input(X)\n      \/\/ are the same.\n      ctx->ShareLoD(\"X\", \"Out\");\n    }\n  }\n\n  static framework::DDim GetOutputShape(const std::vector<int> unsqz_dims,\n                                        const framework::DDim &in_dims) {\n    int output_size = in_dims.size() + static_cast<int>(unsqz_dims.size());\n    int cur_output_size = in_dims.size();\n    std::vector<int64_t> output_shape(output_size, 0);\n\n    \/\/ Validity Check: rank range.\n    PADDLE_ENFORCE(output_size <= 6,\n                   \"The output tensor's rank should be less than 6.\");\n\n    for (int axis : unsqz_dims) {\n      int cur = axis < 0 ? axis + cur_output_size + 1 : axis;\n      \/\/ Vaildity Check: the axis bound\n      PADDLE_ENFORCE(\n          cur >= 0 && cur <= cur_output_size,\n          \"The unsqueeze dims must be within range of current rank.\");\n      \/\/ Move old axis, and insert new axis\n      for (int i = cur_output_size; i >= cur; --i) {\n        if (output_shape[i] == 1) {\n          \/\/ Move axis\n          output_shape[i + 1] = 1;\n          output_shape[i] = 0;\n        }\n      }\n      output_shape[cur] = 1;\n      \/\/ Add the output size.\n      cur_output_size++;\n    }\n\n    \/\/ Make output shape\n    for (int in_idx = 0, out_idx = 0; out_idx < output_size; ++out_idx) {\n      if (output_shape[out_idx] == 0) {\n        output_shape[out_idx] = in_dims[in_idx++];\n      }\n    }\n\n    return framework::make_ddim(output_shape);\n  }\n};\n\nclass UnsqueezeOp : public framework::OperatorBase {\n public:\n  using OperatorBase::OperatorBase;\n\n private:\n  void RunImpl(const framework::Scope &scope,\n               const platform::Place &place) const override {\n    auto &axes = Attr<std::vector<int>>(\"axes\");\n    auto x_dims = scope.FindVar(Input(\"X\"))->Get<framework::LoDTensor>().dims();\n    auto out_dims = UnsqueezeOpInferShape::GetOutputShape(axes, x_dims);\n\n    framework::AttributeMap attrs;\n    attrs[\"shape\"] = framework::vectorize2int(out_dims);\n    attrs[\"inplace\"] = Attr<bool>(\"inplace\");\n    \/\/ Invoke Reshape op.\n    auto reshape_op = framework::OpRegistry::CreateOp(\n        \"reshape\", {{\"X\", {Input(\"X\")}}, {\"Shape\", {}}},\n        {{\"Out\", {Output(\"Out\")}}}, attrs);\n    reshape_op->Run(scope, place);\n  }\n};\n\nclass UnsqueezeOpMaker : public framework::OpProtoAndCheckerMaker {\n public:\n  void Make() override {\n    AddInput(\"X\", \"(Tensor). The input tensor of unsqueeze operator.\");\n    AddOutput(\"Out\", \"(Tensor). The output tensor of unsqueeze operator.\");\n    AddAttr<std::vector<int>>(\"axes\",\n                              \"(std::vector<int>). List of integers,\"\n                              \" indicate the dimensions to be inserted\")\n        .AddCustomChecker([](const std::vector<int> &axes) {\n          PADDLE_ENFORCE(!axes.empty(),\n                         \"Invalid axes, The unsqueeze axes is empty.\");\n          \/\/ Validity Check: axes dims (<6).\n          PADDLE_ENFORCE(static_cast<int>(axes.size()) < 6,\n                         \"Invalid dimensions, dynamic dimensions should within \"\n                         \"[1, 6] dimensions (Eigen limit).\");\n          \/\/ Validity Check: the range of unsqueeze aixs.\n          for (int axis : axes) {\n            PADDLE_ENFORCE(axis < 6,\n                           \"Invalid dimensions, input axis should within \"\n                           \"[1, 6] dimensions (Eigen limit).\");\n          }\n        });\n    AddAttr<bool>(\n        \"inplace\",\n        \"(default: false) Unsqueeze the source tensor's shape without \"\n        \"memory copy. When Attr(inplace) is set true, the output \"\n        \"tensor shares memory with Input(X), otherwise, a new output \"\n        \"tensor is created, and its data are copied from Input(x).\")\n        .SetDefault(false);\n    AddComment(R\"DOC(\n    Unsqueeze Operator.\n    \n    Insert single-dimensional entries to the shape of a tensor. \n    Takes one required argument axes, a list of dimensions that will be inserted. \n    Dimension indices in axes are as seen in the output tensor. \n\n    For example: \n      Given a tensor such that tensor with shape [3, 4, 5], \n      then Unsqueeze(tensor, axes=[0, 4]) has shape [1, 3, 4, 5, 1]\n    )DOC\");\n  }\n};\n\nclass UnsqueezeGradInferShape : public framework::InferShapeBase {\n public:\n  void operator()(framework::InferShapeContext *ctx) const override {\n    ctx->SetOutputDim(framework::GradVarName(\"X\"), ctx->GetInputDim(\"X\"));\n    ctx->ShareLoD(\"X\", framework::GradVarName(\"X\"));\n  }\n};\n\nclass UnsqueezeGradOp : public framework::OperatorBase {\n public:\n  using OperatorBase::OperatorBase;\n\n private:\n  void RunImpl(const framework::Scope &scope,\n               const platform::Place &place) const override {\n    auto dx_name = Output(framework::GradVarName(\"X\"));\n    auto dout_name = Input(framework::GradVarName(\"Out\"));\n    auto x_dims = scope.FindVar(Input(\"X\"))->Get<framework::LoDTensor>().dims();\n\n    framework::AttributeMap attrs;\n    attrs[\"shape\"] = framework::vectorize2int(x_dims);\n    attrs[\"inplace\"] = Attr<bool>(\"inplace\");\n\n    auto reshape_op = framework::OpRegistry::CreateOp(\n        \"reshape\", {{\"X\", {dout_name}}, {\"Shape\", {}}}, {{\"Out\", {dx_name}}},\n        attrs);\n    reshape_op->Run(scope, place);\n  }\n};\n\n}  \/\/ namespace operators\n}  \/\/ namespace paddle\n\n\/\/ Tell linker to use reshape op.\nUSE_OP(reshape);\n\nnamespace ops = paddle::operators;\nREGISTER_OPERATOR(unsqueeze, ops::UnsqueezeOp, ops::UnsqueezeOpMaker,\n                  ops::UnsqueezeOpInferShape,\n                  paddle::framework::DefaultGradOpDescMaker<true>);\nREGISTER_OPERATOR(unsqueeze_grad, ops::UnsqueezeGradOp,\n                  ops::UnsqueezeGradInferShape);\n<|endoftext|>"}
{"text":"<commit_before>#include <fc\/crypto\/elliptic.hpp>\n#include <bts\/utilities\/key_conversion.hpp>\n#include <fc\/io\/json.hpp>\n#include <fstream>\n#include <iostream>\n#include <queue>\n\n#include <bts\/blockchain\/chain_database.hpp>\n#include <bts\/net\/peer_connection.hpp>\n\nclass peer_probe : public bts::net::peer_connection_delegate\n{\npublic:\n  bool _peer_closed_connection;\n  bool _we_closed_connection;\n  bts::net::peer_connection_ptr _connection;\n  std::vector<bts::net::address_info> _peers;\n  fc::ecc::public_key _node_id;\n  bool _done;\n  fc::promise<void>::ptr _probe_complete_promise;\n\npublic:\n  peer_probe() : \n    _peer_closed_connection(false),\n    _we_closed_connection(false),\n    _connection(std::make_shared<bts::net::peer_connection>(this)),\n    _done(false),\n    _probe_complete_promise(fc::promise<void>::ptr(new fc::promise<void>()))\n  {}\n\n  void start(const fc::ip::endpoint& endpoint_to_probe, \n             const fc::ecc::public_key& my_node_id,\n             const bts::blockchain::digest_type& chain_id)\n  {\n    _connection->connect_to(endpoint_to_probe);\n    bts::net::hello_message hello(\"map_bts_network\", \n                                  BTS_NET_PROTOCOL_VERSION,\n                                  fc::ip::address(), 0, 0,\n                                  my_node_id, \n                                  chain_id,\n                                  fc::variant_object());\n    \n    _connection->send_message(hello);\n  }\n\n  void on_message(bts::net::peer_connection* originating_peer, \n                  const bts::net::message& received_message) override\n  {\n    bts::net::message_hash_type message_hash = received_message.id();\n    dlog( \"handling message ${type} ${hash} size ${size} from peer ${endpoint}\", \n          ( \"type\", bts::net::core_message_type_enum(received_message.msg_type ) )(\"hash\", message_hash )(\"size\", received_message.size )(\"endpoint\", originating_peer->get_remote_endpoint() ) );\n    switch ( received_message.msg_type )\n    {\n    case bts::net::core_message_type_enum::hello_message_type:\n      on_hello_message( originating_peer, received_message.as<bts::net::hello_message>() );\n      break;\n    case bts::net::core_message_type_enum::connection_accepted_message_type:\n      on_connection_accepted_message( originating_peer, received_message.as<bts::net::connection_accepted_message>() );\n      break;\n    case bts::net::core_message_type_enum::connection_rejected_message_type:\n      on_connection_rejected_message( originating_peer, received_message.as<bts::net::connection_rejected_message>() );\n      break;\n    case bts::net::core_message_type_enum::address_request_message_type:\n      on_address_request_message( originating_peer, received_message.as<bts::net::address_request_message>() );\n      break;\n    case bts::net::core_message_type_enum::address_message_type:\n      on_address_message( originating_peer, received_message.as<bts::net::address_message>() );\n      break;\n    case bts::net::core_message_type_enum::closing_connection_message_type:\n      on_closing_connection_message( originating_peer, received_message.as<bts::net::closing_connection_message>() );\n      break;\n    case bts::net::core_message_type_enum::current_time_request_message_type:\n      on_current_time_request_message( originating_peer, received_message.as<bts::net::current_time_request_message>() );\n      break;\n    case bts::net::core_message_type_enum::current_time_reply_message_type:\n      on_current_time_reply_message( originating_peer, received_message.as<bts::net::current_time_reply_message>() );\n      break;\n    }\n  }\n\n  void on_hello_message(bts::net::peer_connection* originating_peer, \n                        const bts::net::hello_message& hello_message_received)\n  {\n    _node_id = hello_message_received.node_id;\n    originating_peer->send_message(bts::net::connection_rejected_message());\n  }\n\n  void on_connection_accepted_message(bts::net::peer_connection* originating_peer, \n                                      const bts::net::connection_accepted_message& connection_accepted_message_received)\n  {\n    originating_peer->send_message(bts::net::address_request_message());\n  }\n\n  void on_connection_rejected_message( bts::net::peer_connection* originating_peer, \n                                       const bts::net::connection_rejected_message& connection_rejected_message_received )\n  {\n    originating_peer->send_message(bts::net::address_request_message());\n  }\n\n  void on_address_request_message(bts::net::peer_connection* originating_peer, \n                                  const bts::net::address_request_message& address_request_message_received)\n  {\n    originating_peer->send_message(bts::net::address_message());\n  }\n\n\n  void on_address_message(bts::net::peer_connection* originating_peer, \n                          const bts::net::address_message& address_message_received)\n  {\n    _peers = address_message_received.addresses;\n    originating_peer->send_message(bts::net::closing_connection_message(\"Thanks for the info\"));\n    _we_closed_connection = true;\n  }\n\n  void on_closing_connection_message(bts::net::peer_connection* originating_peer, \n                                     const bts::net::closing_connection_message& closing_connection_message_received)\n  {\n    if (_we_closed_connection)\n      _connection->close_connection();\n    else\n      _peer_closed_connection = true;\n  }\n\n  void on_current_time_request_message(bts::net::peer_connection* originating_peer, \n                                       const bts::net::current_time_request_message& current_time_request_message_received)\n  {\n  }\n\n  void on_current_time_reply_message(bts::net::peer_connection* originating_peer, \n                                     const bts::net::current_time_reply_message& current_time_reply_message_received)\n  {\n  }\n\n  void on_connection_closed(bts::net::peer_connection* originating_peer) override\n  {\n    _done = true;\n    _probe_complete_promise->set_value();\n  }\n\n  void wait()\n  {\n    _probe_complete_promise->wait();\n  }\n};\n\nint main(int argc, char** argv)\n{\n  std::queue<fc::ip::endpoint> nodes_to_visit;\n  std::set<fc::ip::endpoint> nodes_to_visit_set;\n  std::set<fc::ip::endpoint> nodes_already_visited;\n\n  fc::path data_dir = fc::temp_directory_path() \/ \"map_bts_network\";\n  fc::create_directories(data_dir);\n\n  nodes_to_visit.push(fc::ip::endpoint::from_string(\"107.170.30.182:\" BOOST_PP_STRINGIZE(BTS_NETWORK_DEFAULT_P2P_PORT)));\n  nodes_to_visit.push(fc::ip::endpoint::from_string(\"107.170.30.182:7890\"));\n\n  fc::ecc::private_key my_node_id = fc::ecc::private_key::generate();\n  bts::blockchain::chain_database_ptr chain_db = std::make_shared<bts::blockchain::chain_database>();\n  chain_db->open(data_dir \/ \"chain\", fc::optional<fc::path>());\n\n  std::map<bts::net::node_id_t, bts::net::address_info> address_info_by_node_id;\n  std::map<bts::net::node_id_t, std::vector<bts::net::address_info> > connections_by_node_id;\n  \/\/std::map<bts::net::node_id_t, fc::ip::endpoint> all_known_nodes;\n\n  while (!nodes_to_visit.empty())\n  {\n    bts::net::address_info this_node_info;\n    this_node_info.direction = bts::net::peer_connection_direction::outbound;\n    this_node_info.firewalled = bts::net::firewalled_state::not_firewalled;\n\n    this_node_info.remote_endpoint = nodes_to_visit.front();;\n    nodes_to_visit.pop();\n    nodes_to_visit_set.erase(this_node_info.remote_endpoint);\n    nodes_already_visited.insert(this_node_info.remote_endpoint);\n\n    peer_probe probe;\n    try\n    {\n      probe.start(this_node_info.remote_endpoint, \n                  my_node_id.get_public_key(),\n                  chain_db->chain_id());\n      probe.wait();\n\n      this_node_info.node_id = probe._node_id;\n\n      connections_by_node_id[this_node_info.node_id] = probe._peers;\n      if (address_info_by_node_id.find(probe._node_id) == address_info_by_node_id.end())\n        address_info_by_node_id[probe._node_id] = this_node_info;\n\n      for (const bts::net::address_info& info : probe._peers)\n      {\n        if (nodes_already_visited.find(info.remote_endpoint) == nodes_already_visited.end() && \n            info.firewalled == bts::net::firewalled_state::not_firewalled &&\n            nodes_to_visit_set.find(info.remote_endpoint) == nodes_to_visit_set.end())\n        {\n          nodes_to_visit.push(info.remote_endpoint);\n          nodes_to_visit_set.insert(info.remote_endpoint);\n        }\n        if (address_info_by_node_id.find(info.node_id) == address_info_by_node_id.end())\n          address_info_by_node_id[info.node_id] = info;\n      }\n    }\n    catch (const fc::exception&)\n    {\n    }\n    std::cout << \"Traversed \" << nodes_already_visited.size() << \" of \" << (nodes_already_visited.size() + nodes_to_visit.size()) << \" known nodes\\n\";\n  }\n\n  std::ofstream dot_stream((data_dir \/ \"network_graph.dot\").string().c_str());\n  std::map<bts::net::node_id_t, fc::ip::endpoint> all_known_nodes;\n\n  dot_stream << \"graph G {\\n\";\n  \/\/for (const auto& node_and_connections : connections_by_node_id)\n  \/\/  all_known_nodes[node_and_connections.first] = address_info_by_node_id[node_and_connections.first].remote_endpoint;\n\n  for (const auto& address_info_for_node : address_info_by_node_id)\n  {\n    dot_stream << \"  \\\"\" << fc::variant(address_info_for_node.first).as_string() << \"\\\"[label=\\\"\" << (std::string)address_info_for_node.second.remote_endpoint << \"\\\"\";\n    if (address_info_for_node.second.firewalled != bts::net::firewalled_state::not_firewalled)\n      dot_stream << \",shape=rectangle\";\n    dot_stream << \"];\\n\";\n  }\n  for (auto& node_and_connections : connections_by_node_id)\n    for (const bts::net::address_info& this_connection : node_and_connections.second)\n      dot_stream << \"  \\\"\" << fc::variant(node_and_connections.first).as_string() << \"\\\" -- \\\"\" << fc::variant(this_connection.node_id).as_string() << \"\\\";\\n\";\n\n  dot_stream << \"}\\n\";\n\n#if 0\n  for (auto& node_and_connections : connections_by_node_id)\n  {\n    out << \"  \" << (std::string)node_and_connections.first.node_id.data << \"[label=\\\"\" << (std::string)node_and_connections.first.remote_endpoint << \"\\\"];\\n\";\n    \/\/node_and_connections.first.node_id\n  }\n#endif\n\n  return 0;\n}\n<commit_msg>Add missing includes<commit_after>#include <fc\/crypto\/elliptic.hpp>\n#include <bts\/utilities\/key_conversion.hpp>\n#include <fc\/io\/json.hpp>\n#include <fc\/exception\/exception.hpp>\n#include <fc\/io\/raw_variant.hpp>\n#include <fc\/network\/ip.hpp>\n#include <fstream>\n#include <iostream>\n#include <queue>\n\n#include <bts\/blockchain\/chain_database.hpp>\n#include <bts\/net\/peer_connection.hpp>\n\nclass peer_probe : public bts::net::peer_connection_delegate\n{\npublic:\n  bool _peer_closed_connection;\n  bool _we_closed_connection;\n  bts::net::peer_connection_ptr _connection;\n  std::vector<bts::net::address_info> _peers;\n  fc::ecc::public_key _node_id;\n  bool _connection_was_rejected;\n  bool _done;\n  fc::promise<void>::ptr _probe_complete_promise;\n\npublic:\n  peer_probe() : \n    _peer_closed_connection(false),\n    _we_closed_connection(false),\n    _connection(std::make_shared<bts::net::peer_connection>(this)),\n    _connection_was_rejected(false),\n    _done(false),\n    _probe_complete_promise(fc::promise<void>::ptr(new fc::promise<void>()))\n  {}\n\n  void start(const fc::ip::endpoint& endpoint_to_probe, \n             const fc::ecc::public_key& my_node_id,\n             const bts::blockchain::digest_type& chain_id)\n  {\n    _connection->connect_to(endpoint_to_probe);\n    bts::net::hello_message hello(\"map_bts_network\", \n                                  BTS_NET_PROTOCOL_VERSION,\n                                  fc::ip::address(), 0, 0,\n                                  my_node_id, \n                                  chain_id,\n                                  fc::variant_object());\n    \n    _connection->send_message(hello);\n  }\n\n  void on_message(bts::net::peer_connection* originating_peer, \n                  const bts::net::message& received_message) override\n  {\n    bts::net::message_hash_type message_hash = received_message.id();\n    dlog( \"handling message ${type} ${hash} size ${size} from peer ${endpoint}\", \n          ( \"type\", bts::net::core_message_type_enum(received_message.msg_type ) )(\"hash\", message_hash )(\"size\", received_message.size )(\"endpoint\", originating_peer->get_remote_endpoint() ) );\n    switch ( received_message.msg_type )\n    {\n    case bts::net::core_message_type_enum::hello_message_type:\n      on_hello_message( originating_peer, received_message.as<bts::net::hello_message>() );\n      break;\n    case bts::net::core_message_type_enum::connection_accepted_message_type:\n      on_connection_accepted_message( originating_peer, received_message.as<bts::net::connection_accepted_message>() );\n      break;\n    case bts::net::core_message_type_enum::connection_rejected_message_type:\n      on_connection_rejected_message( originating_peer, received_message.as<bts::net::connection_rejected_message>() );\n      break;\n    case bts::net::core_message_type_enum::address_request_message_type:\n      on_address_request_message( originating_peer, received_message.as<bts::net::address_request_message>() );\n      break;\n    case bts::net::core_message_type_enum::address_message_type:\n      on_address_message( originating_peer, received_message.as<bts::net::address_message>() );\n      break;\n    case bts::net::core_message_type_enum::closing_connection_message_type:\n      on_closing_connection_message( originating_peer, received_message.as<bts::net::closing_connection_message>() );\n      break;\n    case bts::net::core_message_type_enum::current_time_request_message_type:\n      on_current_time_request_message( originating_peer, received_message.as<bts::net::current_time_request_message>() );\n      break;\n    case bts::net::core_message_type_enum::current_time_reply_message_type:\n      on_current_time_reply_message( originating_peer, received_message.as<bts::net::current_time_reply_message>() );\n      break;\n    }\n  }\n\n  void on_hello_message(bts::net::peer_connection* originating_peer, \n                        const bts::net::hello_message& hello_message_received)\n  {\n    _node_id = hello_message_received.node_id;\n    originating_peer->send_message(bts::net::connection_rejected_message());\n  }\n\n  void on_connection_accepted_message(bts::net::peer_connection* originating_peer, \n                                      const bts::net::connection_accepted_message& connection_accepted_message_received)\n  {\n    _connection_was_rejected = false;\n    originating_peer->send_message(bts::net::address_request_message());\n  }\n\n  void on_connection_rejected_message( bts::net::peer_connection* originating_peer, \n                                       const bts::net::connection_rejected_message& connection_rejected_message_received )\n  {\n    _connection_was_rejected = true;\n    originating_peer->send_message(bts::net::address_request_message());\n  }\n\n  void on_address_request_message(bts::net::peer_connection* originating_peer, \n                                  const bts::net::address_request_message& address_request_message_received)\n  {\n    originating_peer->send_message(bts::net::address_message());\n  }\n\n\n  void on_address_message(bts::net::peer_connection* originating_peer, \n                          const bts::net::address_message& address_message_received)\n  {\n    _peers = address_message_received.addresses;\n    originating_peer->send_message(bts::net::closing_connection_message(\"Thanks for the info\"));\n    _we_closed_connection = true;\n  }\n\n  void on_closing_connection_message(bts::net::peer_connection* originating_peer, \n                                     const bts::net::closing_connection_message& closing_connection_message_received)\n  {\n    if (_we_closed_connection)\n      _connection->close_connection();\n    else\n      _peer_closed_connection = true;\n  }\n\n  void on_current_time_request_message(bts::net::peer_connection* originating_peer, \n                                       const bts::net::current_time_request_message& current_time_request_message_received)\n  {\n  }\n\n  void on_current_time_reply_message(bts::net::peer_connection* originating_peer, \n                                     const bts::net::current_time_reply_message& current_time_reply_message_received)\n  {\n  }\n\n  void on_connection_closed(bts::net::peer_connection* originating_peer) override\n  {\n    _done = true;\n    _probe_complete_promise->set_value();\n  }\n\n  void wait()\n  {\n    _probe_complete_promise->wait();\n  }\n};\n\nint main(int argc, char** argv)\n{\n  std::queue<fc::ip::endpoint> nodes_to_visit;\n  std::set<fc::ip::endpoint> nodes_to_visit_set;\n  std::set<fc::ip::endpoint> nodes_already_visited;\n\n  fc::path data_dir = fc::temp_directory_path() \/ \"map_bts_network\";\n  fc::create_directories(data_dir);\n\n  fc::ip::endpoint seed_node1 = fc::ip::endpoint::from_string(\"107.170.30.182:\" BOOST_PP_STRINGIZE(BTS_NETWORK_DEFAULT_P2P_PORT));\n  nodes_to_visit.push(seed_node1);\n  nodes_to_visit.push(fc::ip::endpoint::from_string(\"107.170.30.182:7890\"));\n\n  fc::ecc::private_key my_node_id = fc::ecc::private_key::generate();\n  bts::blockchain::chain_database_ptr chain_db = std::make_shared<bts::blockchain::chain_database>();\n  chain_db->open(data_dir \/ \"chain\", fc::optional<fc::path>());\n\n  std::map<bts::net::node_id_t, bts::net::address_info> address_info_by_node_id;\n  std::map<bts::net::node_id_t, std::vector<bts::net::address_info> > connections_by_node_id;\n  \/\/std::map<bts::net::node_id_t, fc::ip::endpoint> all_known_nodes;\n\n  while (!nodes_to_visit.empty())\n  {\n    bts::net::address_info this_node_info;\n    this_node_info.direction = bts::net::peer_connection_direction::outbound;\n    this_node_info.firewalled = bts::net::firewalled_state::not_firewalled;\n\n    this_node_info.remote_endpoint = nodes_to_visit.front();;\n    nodes_to_visit.pop();\n    nodes_to_visit_set.erase(this_node_info.remote_endpoint);\n    nodes_already_visited.insert(this_node_info.remote_endpoint);\n\n    peer_probe probe;\n    try\n    {\n      probe.start(this_node_info.remote_endpoint, \n                  my_node_id.get_public_key(),\n                  chain_db->chain_id());\n      probe.wait();\n\n      this_node_info.node_id = probe._node_id;\n\n      connections_by_node_id[this_node_info.node_id] = probe._peers;\n      if (address_info_by_node_id.find(probe._node_id) == address_info_by_node_id.end())\n        address_info_by_node_id[probe._node_id] = this_node_info;\n\n      for (const bts::net::address_info& info : probe._peers)\n      {\n        if (nodes_already_visited.find(info.remote_endpoint) == nodes_already_visited.end() && \n            info.firewalled == bts::net::firewalled_state::not_firewalled &&\n            nodes_to_visit_set.find(info.remote_endpoint) == nodes_to_visit_set.end())\n        {\n          nodes_to_visit.push(info.remote_endpoint);\n          nodes_to_visit_set.insert(info.remote_endpoint);\n        }\n        if (address_info_by_node_id.find(info.node_id) == address_info_by_node_id.end())\n          address_info_by_node_id[info.node_id] = info;\n      }\n    }\n    catch (const fc::exception&)\n    {\n    }\n    std::cout << \"Traversed \" << nodes_already_visited.size() << \" of \" << (nodes_already_visited.size() + nodes_to_visit.size()) << \" known nodes\\n\";\n  }\n\n  bts::net::node_id_t seed_node_id;\n  \/\/std::set<bts::net::node\n  for (const auto& address_info_for_node : address_info_by_node_id)\n  {\n    if (address_info_for_node.second.remote_endpoint == seed_node1)\n      seed_node_id = address_info_for_node.first;\n  }\n\n  std::ofstream dot_stream((data_dir \/ \"network_graph.dot\").string().c_str());\n  std::map<bts::net::node_id_t, fc::ip::endpoint> all_known_nodes;\n\n  dot_stream << \"graph G {\\n\";\n  dot_stream << \"  \/\/ Seed node is \" << (std::string)address_info_by_node_id[seed_node_id].remote_endpoint << \" id: \" << fc::variant(seed_node_id).as_string() << \"\\n\";\n  dot_stream << \"  layout=\\\"circo\\\";\\n\";\n  \/\/for (const auto& node_and_connections : connections_by_node_id)\n  \/\/  all_known_nodes[node_and_connections.first] = address_info_by_node_id[node_and_connections.first].remote_endpoint;\n\n  for (const auto& address_info_for_node : address_info_by_node_id)\n  {\n    dot_stream << \"  \\\"\" << fc::variant(address_info_for_node.first).as_string() << \"\\\"[label=\\\"\" << (std::string)address_info_for_node.second.remote_endpoint << \"\\\"\";\n    if (address_info_for_node.second.firewalled != bts::net::firewalled_state::not_firewalled)\n      dot_stream << \",shape=rectangle\";\n    dot_stream << \"];\\n\";\n  }\n  for (auto& node_and_connections : connections_by_node_id)\n    for (const bts::net::address_info& this_connection : node_and_connections.second)\n      dot_stream << \"  \\\"\" << fc::variant(node_and_connections.first).as_string() << \"\\\" -- \\\"\" << fc::variant(this_connection.node_id).as_string() << \"\\\";\\n\";\n\n  dot_stream << \"}\\n\";\n\n#if 0\n  for (auto& node_and_connections : connections_by_node_id)\n  {\n    out << \"  \" << (std::string)node_and_connections.first.node_id.data << \"[label=\\\"\" << (std::string)node_and_connections.first.remote_endpoint << \"\\\"];\\n\";\n    \/\/node_and_connections.first.node_id\n  }\n#endif\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\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 * @file cullTraverserData.cxx\n * @author drose\n * @date 2002-03-06\n *\/\n\n#include \"cullTraverserData.h\"\n#include \"cullTraverser.h\"\n#include \"config_pgraph.h\"\n#include \"pandaNode.h\"\n#include \"colorAttrib.h\"\n#include \"textureAttrib.h\"\n#include \"renderModeAttrib.h\"\n#include \"clipPlaneAttrib.h\"\n#include \"boundingPlane.h\"\n#include \"billboardEffect.h\"\n#include \"compassEffect.h\"\n#include \"occluderEffect.h\"\n#include \"polylightEffect.h\"\n#include \"renderState.h\"\n\n\n\/**\n * Applies the transform and state from the current node onto the current\n * data.  This also evaluates billboards, etc.\n *\/\nvoid CullTraverserData::\napply_transform_and_state(CullTraverser *trav) {\n  CPT(RenderState) node_state = _node_reader.get_state();\n\n  if (trav->has_tag_state_key() &&\n      _node_reader.has_tag(trav->get_tag_state_key())) {\n    \/\/ Here's a node that has been tagged with the special key for our current\n    \/\/ camera.  This indicates some special state transition for this node,\n    \/\/ which is unique to this camera.\n    const Camera *camera = trav->get_scene()->get_camera_node();\n    std::string tag_state = _node_reader.get_tag(trav->get_tag_state_key());\n    node_state = node_state->compose(camera->get_tag_state(tag_state));\n  }\n  _node_reader.compose_draw_mask(_draw_mask);\n\n  const RenderEffects *node_effects = _node_reader.get_effects();\n  if (!node_effects->has_cull_callback()) {\n    apply_transform(_node_reader.get_transform());\n  } else {\n    \/\/ The cull callback may decide to modify the node_transform.\n    CPT(TransformState) node_transform = _node_reader.get_transform();\n    node_effects->cull_callback(trav, *this, node_transform, node_state);\n    apply_transform(node_transform);\n  }\n\n  if (!node_state->is_empty()) {\n    _state = _state->compose(node_state);\n  }\n\n  if (clip_plane_cull) {\n    _cull_planes = _cull_planes->apply_state(trav, this,\n      (const ClipPlaneAttrib *)node_state->get_attrib(ClipPlaneAttrib::get_class_slot()),\n      (const ClipPlaneAttrib *)_node_reader.get_off_clip_planes(),\n      (const OccluderEffect *)node_effects->get_effect(OccluderEffect::get_class_type()));\n  }\n}\n\n\/**\n * Applies the indicated transform changes onto the current data.\n *\/\nvoid CullTraverserData::\napply_transform(const TransformState *node_transform) {\n  if (!node_transform->is_identity()) {\n    _net_transform = _net_transform->compose(node_transform);\n\n    if ((_view_frustum != nullptr) ||\n        (!_cull_planes->is_empty())) {\n      \/\/ We need to move the viewing frustums into the node's coordinate space\n      \/\/ by applying the node's inverse transform.\n      if (node_transform->is_singular()) {\n        \/\/ But we can't invert a singular transform!  Instead of trying, we'll\n        \/\/ just give up on frustum culling from this point down.\n        _view_frustum = nullptr;\n        _cull_planes = CullPlanes::make_empty();\n\n      } else {\n        CPT(TransformState) inv_transform =\n          node_transform->invert_compose(TransformState::make_identity());\n\n        \/\/ Copy the bounding volumes for the frustums so we can transform\n        \/\/ them.\n        if (_view_frustum != nullptr) {\n          _view_frustum = _view_frustum->make_copy()->as_geometric_bounding_volume();\n          nassertv(_view_frustum != nullptr);\n\n          _view_frustum->xform(inv_transform->get_mat());\n        }\n\n        _cull_planes = _cull_planes->xform(inv_transform->get_mat());\n      }\n    }\n  }\n}\n\n\/**\n * The private, recursive implementation of get_node_path(), this returns the\n * NodePathComponent representing the NodePath.\n *\/\nPT(NodePathComponent) CullTraverserData::\nr_get_node_path() const {\n  if (_next == nullptr) {\n    nassertr(_start != nullptr, nullptr);\n    return _start;\n  }\n\n#ifdef _DEBUG\n  nassertr(_start == nullptr, nullptr);\n#endif\n  nassertr(node() != nullptr, nullptr);\n\n  PT(NodePathComponent) comp = _next->r_get_node_path();\n  nassertr(comp != nullptr, nullptr);\n\n  Thread *current_thread = Thread::get_current_thread();\n  int pipeline_stage = current_thread->get_pipeline_stage();\n  PT(NodePathComponent) result =\n    PandaNode::get_component(comp, node(), pipeline_stage, current_thread);\n  if (result == nullptr) {\n    \/\/ This means we found a disconnected chain in the CullTraverserData's\n    \/\/ ancestry: the node above this node isn't connected.  In this case,\n    \/\/ don't attempt to go higher; just truncate the NodePath at the bottom of\n    \/\/ the disconnect.\n    return PandaNode::get_top_component(node(), true, pipeline_stage, current_thread);\n  }\n\n  return result;\n}\n\n\/**\n * The private implementation of is_in_view().\n *\/\nbool CullTraverserData::\nis_in_view_impl() {\n  const GeometricBoundingVolume *node_gbv = nullptr;\n\n  if (_view_frustum != nullptr) {\n    node_gbv = _node_reader.get_bounds()->as_geometric_bounding_volume();\n    nassertr(node_gbv != nullptr, false);\n\n    int result = _view_frustum->contains(node_gbv);\n\n    if (pgraph_cat.is_spam()) {\n      pgraph_cat.spam()\n        << get_node_path() << \" cull result = \" << std::hex << result << std::dec << \"\\n\";\n    }\n\n    if (result == BoundingVolume::IF_no_intersection) {\n      \/\/ No intersection at all.  Cull.\n#ifdef NDEBUG\n      return false;\n#else\n      if (!fake_view_frustum_cull) {\n        return false;\n      }\n\n      \/\/ If we have fake view-frustum culling enabled, instead of actually\n      \/\/ culling an object we simply force it to be drawn in red wireframe.\n      _view_frustum = nullptr;\n      _state = _state->compose(get_fake_view_frustum_cull_state());\n#endif\n\n    } else if ((result & BoundingVolume::IF_all) != 0) {\n      \/\/ The node and its descendents are completely enclosed within the\n      \/\/ frustum.  No need to cull further.\n      _view_frustum = nullptr;\n\n    } else {\n      \/\/ The node is partially, but not completely, within the viewing\n      \/\/ frustum.\n      if (_node_reader.is_final()) {\n        \/\/ Normally we'd keep testing child bounding volumes as we continue\n        \/\/ down.  But this node has the \"final\" flag, so the user is claiming\n        \/\/ that there is some important reason we should consider everything\n        \/\/ visible at this point.  So be it.\n        _view_frustum = nullptr;\n      }\n    }\n  }\n\n  if (!_cull_planes->is_empty()) {\n    if (node_gbv == nullptr) {\n      node_gbv = _node_reader.get_bounds()->as_geometric_bounding_volume();\n      nassertr(node_gbv != nullptr, false);\n    }\n\n    \/\/ Also cull against the current clip planes.\n    int result;\n    _cull_planes = _cull_planes->do_cull(result, _state, node_gbv);\n\n    if (pgraph_cat.is_spam()) {\n      pgraph_cat.spam()\n        << get_node_path() << \" cull planes cull result = \" << std::hex\n        << result << std::dec << \"\\n\";\n      _cull_planes->write(pgraph_cat.spam(false));\n    }\n\n    if (_node_reader.is_final()) {\n      \/\/ Even though the node may be partially within the clip planes, do no\n      \/\/ more culling against them below this node.\n      _cull_planes = CullPlanes::make_empty();\n\n      if (pgraph_cat.is_spam()) {\n        pgraph_cat.spam()\n          << get_node_path() << \" is_final, cull planes disabled, state:\\n\";\n        _state->write(pgraph_cat.spam(false), 2);\n      }\n    }\n\n    if (result == BoundingVolume::IF_no_intersection) {\n      \/\/ No intersection at all.  Cull.\n#ifdef NDEBUG\n      return false;\n#else\n      if (!fake_view_frustum_cull) {\n        return false;\n      }\n      _cull_planes = CullPlanes::make_empty();\n      _state = _state->compose(get_fake_view_frustum_cull_state());\n#endif\n\n    } else if ((result & BoundingVolume::IF_all) != 0) {\n      \/\/ The node and its descendents are completely in front of all of the\n      \/\/ clip planes and occluders.  The do_cull() call should therefore have\n      \/\/ removed all of the clip planes and occluders.\n      nassertr(_cull_planes->is_empty(), true);\n    }\n  }\n\n  return true;\n}\n\n\/**\n * Returns a RenderState for rendering stuff in red wireframe, strictly for\n * the fake_view_frustum_cull effect.\n *\/\nconst RenderState *CullTraverserData::\nget_fake_view_frustum_cull_state() {\n#ifdef NDEBUG\n  return nullptr;\n#else\n  \/\/ Once someone asks for this pointer, we hold its reference count and never\n  \/\/ free it.\n  static CPT(RenderState) state;\n  if (state == nullptr) {\n    state = RenderState::make\n      (ColorAttrib::make_flat(LColor(1.0f, 0.0f, 0.0f, 1.0f)),\n       TextureAttrib::make_all_off(),\n       RenderModeAttrib::make(RenderModeAttrib::M_wireframe),\n       RenderState::get_max_priority());\n  }\n  return state;\n#endif\n}\n<commit_msg>pgraph: fix crash when cull_callback modifies node in some way<commit_after>\/**\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 * @file cullTraverserData.cxx\n * @author drose\n * @date 2002-03-06\n *\/\n\n#include \"cullTraverserData.h\"\n#include \"cullTraverser.h\"\n#include \"config_pgraph.h\"\n#include \"pandaNode.h\"\n#include \"colorAttrib.h\"\n#include \"textureAttrib.h\"\n#include \"renderModeAttrib.h\"\n#include \"clipPlaneAttrib.h\"\n#include \"boundingPlane.h\"\n#include \"billboardEffect.h\"\n#include \"compassEffect.h\"\n#include \"occluderEffect.h\"\n#include \"polylightEffect.h\"\n#include \"renderState.h\"\n\n\n\/**\n * Applies the transform and state from the current node onto the current\n * data.  This also evaluates billboards, etc.\n *\/\nvoid CullTraverserData::\napply_transform_and_state(CullTraverser *trav) {\n  CPT(RenderState) node_state = _node_reader.get_state();\n\n  if (trav->has_tag_state_key() &&\n      _node_reader.has_tag(trav->get_tag_state_key())) {\n    \/\/ Here's a node that has been tagged with the special key for our current\n    \/\/ camera.  This indicates some special state transition for this node,\n    \/\/ which is unique to this camera.\n    const Camera *camera = trav->get_scene()->get_camera_node();\n    std::string tag_state = _node_reader.get_tag(trav->get_tag_state_key());\n    node_state = node_state->compose(camera->get_tag_state(tag_state));\n  }\n  _node_reader.compose_draw_mask(_draw_mask);\n\n  const RenderEffects *node_effects = _node_reader.get_effects();\n  if (!node_effects->has_cull_callback()) {\n    apply_transform(_node_reader.get_transform());\n  } else {\n    \/\/ The cull callback may decide to modify the node_transform.\n    CPT(TransformState) node_transform = _node_reader.get_transform();\n    node_effects->cull_callback(trav, *this, node_transform, node_state);\n    apply_transform(node_transform);\n\n    \/\/ The cull callback may have changed the node properties.\n    _node_reader.check_cached(false);\n  }\n\n  if (!node_state->is_empty()) {\n    _state = _state->compose(node_state);\n  }\n\n  if (clip_plane_cull) {\n    _cull_planes = _cull_planes->apply_state(trav, this,\n      (const ClipPlaneAttrib *)node_state->get_attrib(ClipPlaneAttrib::get_class_slot()),\n      (const ClipPlaneAttrib *)_node_reader.get_off_clip_planes(),\n      (const OccluderEffect *)node_effects->get_effect(OccluderEffect::get_class_type()));\n  }\n}\n\n\/**\n * Applies the indicated transform changes onto the current data.\n *\/\nvoid CullTraverserData::\napply_transform(const TransformState *node_transform) {\n  if (!node_transform->is_identity()) {\n    _net_transform = _net_transform->compose(node_transform);\n\n    if ((_view_frustum != nullptr) ||\n        (!_cull_planes->is_empty())) {\n      \/\/ We need to move the viewing frustums into the node's coordinate space\n      \/\/ by applying the node's inverse transform.\n      if (node_transform->is_singular()) {\n        \/\/ But we can't invert a singular transform!  Instead of trying, we'll\n        \/\/ just give up on frustum culling from this point down.\n        _view_frustum = nullptr;\n        _cull_planes = CullPlanes::make_empty();\n\n      } else {\n        CPT(TransformState) inv_transform =\n          node_transform->invert_compose(TransformState::make_identity());\n\n        \/\/ Copy the bounding volumes for the frustums so we can transform\n        \/\/ them.\n        if (_view_frustum != nullptr) {\n          _view_frustum = _view_frustum->make_copy()->as_geometric_bounding_volume();\n          nassertv(_view_frustum != nullptr);\n\n          _view_frustum->xform(inv_transform->get_mat());\n        }\n\n        _cull_planes = _cull_planes->xform(inv_transform->get_mat());\n      }\n    }\n  }\n}\n\n\/**\n * The private, recursive implementation of get_node_path(), this returns the\n * NodePathComponent representing the NodePath.\n *\/\nPT(NodePathComponent) CullTraverserData::\nr_get_node_path() const {\n  if (_next == nullptr) {\n    nassertr(_start != nullptr, nullptr);\n    return _start;\n  }\n\n#ifdef _DEBUG\n  nassertr(_start == nullptr, nullptr);\n#endif\n  nassertr(node() != nullptr, nullptr);\n\n  PT(NodePathComponent) comp = _next->r_get_node_path();\n  nassertr(comp != nullptr, nullptr);\n\n  Thread *current_thread = Thread::get_current_thread();\n  int pipeline_stage = current_thread->get_pipeline_stage();\n  PT(NodePathComponent) result =\n    PandaNode::get_component(comp, node(), pipeline_stage, current_thread);\n  if (result == nullptr) {\n    \/\/ This means we found a disconnected chain in the CullTraverserData's\n    \/\/ ancestry: the node above this node isn't connected.  In this case,\n    \/\/ don't attempt to go higher; just truncate the NodePath at the bottom of\n    \/\/ the disconnect.\n    return PandaNode::get_top_component(node(), true, pipeline_stage, current_thread);\n  }\n\n  return result;\n}\n\n\/**\n * The private implementation of is_in_view().\n *\/\nbool CullTraverserData::\nis_in_view_impl() {\n  const GeometricBoundingVolume *node_gbv = nullptr;\n\n  if (_view_frustum != nullptr) {\n    node_gbv = _node_reader.get_bounds()->as_geometric_bounding_volume();\n    nassertr(node_gbv != nullptr, false);\n\n    int result = _view_frustum->contains(node_gbv);\n\n    if (pgraph_cat.is_spam()) {\n      pgraph_cat.spam()\n        << get_node_path() << \" cull result = \" << std::hex << result << std::dec << \"\\n\";\n    }\n\n    if (result == BoundingVolume::IF_no_intersection) {\n      \/\/ No intersection at all.  Cull.\n#ifdef NDEBUG\n      return false;\n#else\n      if (!fake_view_frustum_cull) {\n        return false;\n      }\n\n      \/\/ If we have fake view-frustum culling enabled, instead of actually\n      \/\/ culling an object we simply force it to be drawn in red wireframe.\n      _view_frustum = nullptr;\n      _state = _state->compose(get_fake_view_frustum_cull_state());\n#endif\n\n    } else if ((result & BoundingVolume::IF_all) != 0) {\n      \/\/ The node and its descendents are completely enclosed within the\n      \/\/ frustum.  No need to cull further.\n      _view_frustum = nullptr;\n\n    } else {\n      \/\/ The node is partially, but not completely, within the viewing\n      \/\/ frustum.\n      if (_node_reader.is_final()) {\n        \/\/ Normally we'd keep testing child bounding volumes as we continue\n        \/\/ down.  But this node has the \"final\" flag, so the user is claiming\n        \/\/ that there is some important reason we should consider everything\n        \/\/ visible at this point.  So be it.\n        _view_frustum = nullptr;\n      }\n    }\n  }\n\n  if (!_cull_planes->is_empty()) {\n    if (node_gbv == nullptr) {\n      node_gbv = _node_reader.get_bounds()->as_geometric_bounding_volume();\n      nassertr(node_gbv != nullptr, false);\n    }\n\n    \/\/ Also cull against the current clip planes.\n    int result;\n    _cull_planes = _cull_planes->do_cull(result, _state, node_gbv);\n\n    if (pgraph_cat.is_spam()) {\n      pgraph_cat.spam()\n        << get_node_path() << \" cull planes cull result = \" << std::hex\n        << result << std::dec << \"\\n\";\n      _cull_planes->write(pgraph_cat.spam(false));\n    }\n\n    if (_node_reader.is_final()) {\n      \/\/ Even though the node may be partially within the clip planes, do no\n      \/\/ more culling against them below this node.\n      _cull_planes = CullPlanes::make_empty();\n\n      if (pgraph_cat.is_spam()) {\n        pgraph_cat.spam()\n          << get_node_path() << \" is_final, cull planes disabled, state:\\n\";\n        _state->write(pgraph_cat.spam(false), 2);\n      }\n    }\n\n    if (result == BoundingVolume::IF_no_intersection) {\n      \/\/ No intersection at all.  Cull.\n#ifdef NDEBUG\n      return false;\n#else\n      if (!fake_view_frustum_cull) {\n        return false;\n      }\n      _cull_planes = CullPlanes::make_empty();\n      _state = _state->compose(get_fake_view_frustum_cull_state());\n#endif\n\n    } else if ((result & BoundingVolume::IF_all) != 0) {\n      \/\/ The node and its descendents are completely in front of all of the\n      \/\/ clip planes and occluders.  The do_cull() call should therefore have\n      \/\/ removed all of the clip planes and occluders.\n      nassertr(_cull_planes->is_empty(), true);\n    }\n  }\n\n  return true;\n}\n\n\/**\n * Returns a RenderState for rendering stuff in red wireframe, strictly for\n * the fake_view_frustum_cull effect.\n *\/\nconst RenderState *CullTraverserData::\nget_fake_view_frustum_cull_state() {\n#ifdef NDEBUG\n  return nullptr;\n#else\n  \/\/ Once someone asks for this pointer, we hold its reference count and never\n  \/\/ free it.\n  static CPT(RenderState) state;\n  if (state == nullptr) {\n    state = RenderState::make\n      (ColorAttrib::make_flat(LColor(1.0f, 0.0f, 0.0f, 1.0f)),\n       TextureAttrib::make_all_off(),\n       RenderModeAttrib::make(RenderModeAttrib::M_wireframe),\n       RenderState::get_max_priority());\n  }\n  return state;\n#endif\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n  aimcontact.cpp  -  Oscar Protocol Plugin\n\n  Copyright (c) 2003 by Will Stephenson\n  Kopete    (c) 2002-2004 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 <time.h>\n\n#include <qapplication.h>\n#include <qregexp.h>\n\n#include <kactionclasses.h>\n#include <klocale.h>\n#include <kdebug.h>\n#include <kmessagebox.h>\n\n#include \"kopeteaway.h\"\n#include \"kopetemessagemanager.h\"\n#include \"kopeteuiglobal.h\"\n#include \"kopetemetacontact.h\"\n\n\/\/liboscar\n#include \"client.h\"\n#include \"oscartypes.h\"\n#include \"oscarutils.h\"\n\n#include \"aimprotocol.h\"\n#include \"aimuserinfo.h\"\n#include \"aimcontact.h\"\n#include \"aimaccount.h\"\n\nAIMContact::AIMContact( Kopete::Account* account, const QString& name, Kopete::MetaContact* parent,\n                        const QString& icon, const Oscar::SSI& ssiItem )\n: OscarContact(account, name, parent, icon, ssiItem )\n{\n\tmProtocol=static_cast<AIMProtocol *>(protocol());\n\tsetOnlineStatus( mProtocol->statusOffline );\n\t\n\tm_infoDialog = 0L;\n\tm_warnUserAction = 0L;\n\tmUserProfile=\"\";\n\tm_haveAwayMessage = false;\n\t\/\/ Set the last autoresponse time to the current time yesterday\n\tm_lastAutoresponseTime = QDateTime::currentDateTime().addDays(-1);\n\t\n\tQObject::connect( mAccount->engine(), SIGNAL( receivedUserInfo( const QString&, const UserDetails& ) ),\n\t                  this, SLOT( userInfoUpdated( const QString&, const UserDetails& ) ) );\n\t\/\/QObject::connect( mAccount->engine(), SIGNAL( userIsOnline( const QString& ) ), this, SLOT( userOnline( const QString& ) ) );\n\tQObject::connect( mAccount->engine(), SIGNAL( userIsOffline( const QString& ) ), this, SLOT( userOffline( const QString& ) ) );\t\n\tQObject::connect( mAccount->engine(), SIGNAL( receivedAwayMessage( const QString&, const QString& ) ),\n\t                  this, SLOT( updateAwayMessage( const QString&, const QString& ) ) );\n\tQObject::connect( mAccount->engine(), SIGNAL( receivedProfile( const QString&, const QString& ) ),\n\t                  this, SLOT( updateProfile( const QString&, const QString& ) ) );\n\tQObject::connect( mAccount->engine(), SIGNAL( userWarned( const QString&, Q_UINT16, Q_UINT16 ) ),\n\t                  this, SLOT( gotWarning( const QString&, Q_UINT16, Q_UINT16 ) ) );\n}\n\nAIMContact::~AIMContact()\n{\n}\n\nbool AIMContact::isReachable()\n{\n\treturn true;\n}\n\nQPtrList<KAction> *AIMContact::customContextMenuActions()\n{\n\t\n\tQPtrList<KAction> *actionCollection = new QPtrList<KAction>();\n\tif ( !m_warnUserAction )\n\t{\n\t\tm_warnUserAction = new KAction( i18n( \"&Warn User\" ), 0, this, SLOT( warnUser() ), this, \"warnAction\" );\n\t}\n\t\n\tm_warnUserAction->setEnabled( account()->isConnected() );\n\t\n\tactionCollection->append( m_warnUserAction );\n\treturn actionCollection;\n}\n\nconst QString AIMContact::awayMessage()\n{\n\treturn property(mProtocol->awayMessage).value().toString();\n}\n\nvoid AIMContact::setAwayMessage(const QString &message)\n{\n\tkdDebug(14152) << k_funcinfo <<\n\t\t\"Called for '\" << contactId() << \"', away msg='\" << message << \"'\" << endl;\n\tQString filteredMessage = message;\n\tfilteredMessage.replace(\n\t\tQRegExp(QString::fromLatin1(\"<[hH][tT][mM][lL].*>(.*)<\/[hH][tT][mM][lL]>\")),\n\t\tQString::fromLatin1(\"\\\\1\"));\n\tfilteredMessage.replace(\n\t\tQRegExp(QString::fromLatin1(\"<[bB][oO][dD][yY].*>(.*)<\/[bB][oO][dD][yY]>\")),\n\t\tQString::fromLatin1(\"\\\\1\") );\n\tfilteredMessage.replace(\n\t\tQRegExp(QString::fromLatin1(\"<[fF][oO][nN][tT].*>(.*)<\/[fF][oO][nN][tT]>\")),\n\t\tQString::fromLatin1(\"\\\\1\") );\n\tsetProperty(mProtocol->awayMessage, filteredMessage);\n}\n\nint AIMContact::warningLevel() const\n{\n\treturn m_warningLevel;\n}\n\nvoid AIMContact::updateSSIItem()\n{\n\tif ( m_ssiItem.type() != 0xFFFF && m_ssiItem.waitingAuth() == false &&\n\t     onlineStatus() == Kopete::OnlineStatus::Unknown )\n\t{\n\t\t\/\/make sure they're offline\n\t\tsetOnlineStatus( static_cast<AIMProtocol*>( protocol() )->statusOffline );\n\t}\n}\n\nvoid AIMContact::slotUserInfo()\n{\n\tif ( !m_infoDialog)\n\t{\n\t\tm_infoDialog = new AIMUserInfoDialog( this, static_cast<AIMAccount*>( account() ), false, Kopete::UI::Global::mainWidget(), 0 );\n\t\tif( !m_infoDialog )\n\t\t\treturn;\n\t\tconnect( m_infoDialog, SIGNAL( finished() ), this, SLOT( closeUserInfoDialog() ) );\n\t\tm_infoDialog->show();\n\t\tif ( mAccount->isConnected() )\n\t\t{\n\t\t\tmAccount->engine()->requestAIMProfile( contactId() );\n\t\t\tmAccount->engine()->requestAIMAwayMessage( contactId() );\n\t\t}\n\t}\n\telse\n\t\tm_infoDialog->raise();\n}\n\nvoid AIMContact::userInfoUpdated( const QString& contact, const UserDetails& details )\n{\n\tif ( Oscar::normalize( contact ) != Oscar::normalize( contactId() ) )\n\t\treturn;\n\n\tkdDebug(OSCAR_RAW_DEBUG) << k_funcinfo << contact << endl;\n\t\n\t\/\/if they don't have an SSI alias, make sure we use the capitalization from the\n\t\/\/server so their contact id looks all pretty.\n\tQString nickname = property( Kopete::Global::Properties::self()->nickName() ).value().toString();\n\tif ( Oscar::normalize( nickname ) == Oscar::normalize( details.userId() ) )\n\t\tsetProperty( Kopete::Global::Properties::self()->nickName(), details.userId() );\n\t\n\tif ( ( details.userClass() & 32 ) == 0 )\n\t{\n\t\tsetOnlineStatus( mProtocol->statusOnline ); \/\/we're online\n\t\tremoveProperty( mProtocol->awayMessage );\n\t\tm_haveAwayMessage = false;\n\t}\n\telse\n\t{\n\t\tsetOnlineStatus( mProtocol->statusAway ); \/\/we're away\n\t\tif ( !m_haveAwayMessage ) \/\/prevent cyclic away message requests\n\t\t{\n\t\t\tmAccount->engine()->requestAIMAwayMessage( contactId() );\n\t\t\tm_haveAwayMessage = true;\n\t\t}\n\t}\n\t\n\tif ( details.buddyIconHash() != m_details.buddyIconHash() )\n\t\taccount()->engine()->requestBuddyIcon( contactId(), m_details.buddyIconHash() );\n\n\tOscarContact::userInfoUpdated( contact, details );\n\n\n}\n\n\n\nvoid AIMContact::userOnline( const QString& userId )\n{\n\tif ( Oscar::normalize( userId ) == Oscar::normalize( contactId() ) )\n\t{\n\t\tkdDebug(OSCAR_RAW_DEBUG) << k_funcinfo << \"Getting more contact info\" << endl;\n\t\tsetOnlineStatus( mProtocol->statusOnline );\n\t}\n}\n\nvoid AIMContact::userOffline( const QString& userId )\n{\n\tif ( Oscar::normalize( userId ) == Oscar::normalize( contactId() ) )\n\t{\n\t\tsetOnlineStatus( mProtocol->statusOffline );\n\t\tremoveProperty( mProtocol->awayMessage );\n\t}\n}\n\nvoid AIMContact::updateAwayMessage( const QString& contact, const QString& message )\n{\n\tif ( Oscar::normalize( contact ) != Oscar::normalize( contactId() ) )\n\t\treturn;\n\telse\n\t{\n\t\tif ( message.isEmpty() )\n\t\t{\n\t\t\tremoveProperty( mProtocol->awayMessage );\n\t\t\tsetOnlineStatus( mProtocol->statusOnline );\n\t\t\tm_haveAwayMessage = false;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_haveAwayMessage = true;\n\t\t\tsetAwayMessage( message );\n\t\t\tsetOnlineStatus( mProtocol->statusAway );\n\t\t}\n\t}\n\t\n\temit updatedProfile();\n}\n\nvoid AIMContact::updateProfile( const QString& contact, const QString& profile )\n{\n\tif ( Oscar::normalize( contact ) != Oscar::normalize( contactId() ) )\n\t\treturn;\n\t\n\tsetProperty( mProtocol->clientProfile, profile );\n\temit updatedProfile();\n}\n\nvoid AIMContact::gotWarning( const QString& contact, Q_UINT16 increase, Q_UINT16 newLevel )\n{\n\t\/\/somebody just got bitchslapped! :O\n\tQ_UNUSED( increase );\n\tif ( Oscar::normalize( contact ) == Oscar::normalize( contactId() ) )\n\t\tm_warningLevel = newLevel;\n\t\n\t\/\/TODO add a KNotify event after merge to HEAD\n}\n\nvoid AIMContact::closeUserInfoDialog()\n{\n\tm_infoDialog->delayedDestruct();\n\tm_infoDialog = 0L;\n}\n\nvoid AIMContact::warnUser()\n{\n\tQString nick = property( Kopete::Global::Properties::self()->nickName() ).value().toString();\n\tQString message = i18n( \"<qt>Would you like to warn %1 anonymously or with your name?<br>\" \\\n\t                        \"(Warning a user on AIM will result in a \\\"Warning Level\\\"\" \\\n\t                        \" increasing for the user you warn. Once this level has reached a\" \\\n\t                        \" certain point, they will not be able to sign on. Please do not abuse\" \\\n\t                        \" this function, it is meant for legitimate practices.)<\/qt>\" ).arg( nick );\n\t\n\t\n\tint result = KMessageBox::questionYesNoCancel( Kopete::UI::Global::mainWidget(), message,\n\t                                               i18n( \"Warn User %1?\" ).arg( nick ),\n\t                                               i18n( \"Warn Anonymously\" ), i18n( \"Warn\" ) );\n\t\n\tif ( result == KMessageBox::Yes )\n\t\tmAccount->engine()->sendWarning( contactId(), true);\n\telse if ( result == KMessageBox::No )\n\t\tmAccount->engine()->sendWarning( contactId(), false);\n}\n\nvoid AIMContact::sendAutoResponse(Kopete::Message& msg)\n{\n\t\/\/ The target time is 2 minutes later than the last message\n\tint delta = m_lastAutoresponseTime.secsTo( QDateTime::currentDateTime() );\n\tkdDebug(14152) << k_funcinfo << \"Last autoresponse time: \" << m_lastAutoresponseTime << endl;\n\tkdDebug(14152) << k_funcinfo << \"Current time: \" << QDateTime::currentDateTime() << endl;\n\tkdDebug(14152) << k_funcinfo << \"Difference: \" << delta << endl;\n\t\/\/ Check to see if we're past that time\n\tif(delta > 120)\n\t{\n\t\tkdDebug(14152) << k_funcinfo << \"Sending auto response\" << endl;\n\t\t\/\/ This code was yoinked straight from OscarContact::slotSendMsg()\n\t\t\/\/ If only that slot wasn't private, but I'm not gonna change it right now.\n\t\tOscar::Message message;\n\t\n\t\tmessage.setText( msg.plainBody() );\n\t\t\n\t\tmessage.setTimestamp( msg.timestamp() );\n\t\tmessage.setSender( mAccount->accountId() );\n\t\tmessage.setReceiver( mName );\n\t\tmessage.setType( 0x01 );\n\t\t\n\t\t\/\/ isAuto defaults to false\n\t\tmAccount->engine()->sendMessage( message, true);\n\t\tkdDebug(14152) << k_funcinfo << \"Sent auto response\" << endl;\n\t\tmanager(Kopete::Contact::CanCreate)->appendMessage(msg);\n\t\tmanager(Kopete::Contact::CanCreate)->messageSucceeded();\n\t\t\/\/ Update the last autoresponse time\n\t\tm_lastAutoresponseTime = QDateTime::currentDateTime();\n\t}\n\telse\n\t{\n\t\tkdDebug(14152) << k_funcinfo << \"Not enough time since last autoresponse, NOT sending\" << endl;\n\t}\n}\n#include \"aimcontact.moc\"\n\/\/kate: tab-width 4; indent-mode csands;\n<commit_msg>disable the code that requests buddy icons for the moment. need to work out some asynchronousity issues.<commit_after>\/*\n  aimcontact.cpp  -  Oscar Protocol Plugin\n\n  Copyright (c) 2003 by Will Stephenson\n  Kopete    (c) 2002-2004 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 <time.h>\n\n#include <qapplication.h>\n#include <qregexp.h>\n\n#include <kactionclasses.h>\n#include <klocale.h>\n#include <kdebug.h>\n#include <kmessagebox.h>\n\n#include \"kopeteaway.h\"\n#include \"kopetemessagemanager.h\"\n#include \"kopeteuiglobal.h\"\n#include \"kopetemetacontact.h\"\n\n\/\/liboscar\n#include \"client.h\"\n#include \"oscartypes.h\"\n#include \"oscarutils.h\"\n\n#include \"aimprotocol.h\"\n#include \"aimuserinfo.h\"\n#include \"aimcontact.h\"\n#include \"aimaccount.h\"\n\nAIMContact::AIMContact( Kopete::Account* account, const QString& name, Kopete::MetaContact* parent,\n                        const QString& icon, const Oscar::SSI& ssiItem )\n: OscarContact(account, name, parent, icon, ssiItem )\n{\n\tmProtocol=static_cast<AIMProtocol *>(protocol());\n\tsetOnlineStatus( mProtocol->statusOffline );\n\t\n\tm_infoDialog = 0L;\n\tm_warnUserAction = 0L;\n\tmUserProfile=\"\";\n\tm_haveAwayMessage = false;\n\t\/\/ Set the last autoresponse time to the current time yesterday\n\tm_lastAutoresponseTime = QDateTime::currentDateTime().addDays(-1);\n\t\n\tQObject::connect( mAccount->engine(), SIGNAL( receivedUserInfo( const QString&, const UserDetails& ) ),\n\t                  this, SLOT( userInfoUpdated( const QString&, const UserDetails& ) ) );\n\t\/\/QObject::connect( mAccount->engine(), SIGNAL( userIsOnline( const QString& ) ), this, SLOT( userOnline( const QString& ) ) );\n\tQObject::connect( mAccount->engine(), SIGNAL( userIsOffline( const QString& ) ), this, SLOT( userOffline( const QString& ) ) );\t\n\tQObject::connect( mAccount->engine(), SIGNAL( receivedAwayMessage( const QString&, const QString& ) ),\n\t                  this, SLOT( updateAwayMessage( const QString&, const QString& ) ) );\n\tQObject::connect( mAccount->engine(), SIGNAL( receivedProfile( const QString&, const QString& ) ),\n\t                  this, SLOT( updateProfile( const QString&, const QString& ) ) );\n\tQObject::connect( mAccount->engine(), SIGNAL( userWarned( const QString&, Q_UINT16, Q_UINT16 ) ),\n\t                  this, SLOT( gotWarning( const QString&, Q_UINT16, Q_UINT16 ) ) );\n}\n\nAIMContact::~AIMContact()\n{\n}\n\nbool AIMContact::isReachable()\n{\n\treturn true;\n}\n\nQPtrList<KAction> *AIMContact::customContextMenuActions()\n{\n\t\n\tQPtrList<KAction> *actionCollection = new QPtrList<KAction>();\n\tif ( !m_warnUserAction )\n\t{\n\t\tm_warnUserAction = new KAction( i18n( \"&Warn User\" ), 0, this, SLOT( warnUser() ), this, \"warnAction\" );\n\t}\n\t\n\tm_warnUserAction->setEnabled( account()->isConnected() );\n\t\n\tactionCollection->append( m_warnUserAction );\n\treturn actionCollection;\n}\n\nconst QString AIMContact::awayMessage()\n{\n\treturn property(mProtocol->awayMessage).value().toString();\n}\n\nvoid AIMContact::setAwayMessage(const QString &message)\n{\n\tkdDebug(14152) << k_funcinfo <<\n\t\t\"Called for '\" << contactId() << \"', away msg='\" << message << \"'\" << endl;\n\tQString filteredMessage = message;\n\tfilteredMessage.replace(\n\t\tQRegExp(QString::fromLatin1(\"<[hH][tT][mM][lL].*>(.*)<\/[hH][tT][mM][lL]>\")),\n\t\tQString::fromLatin1(\"\\\\1\"));\n\tfilteredMessage.replace(\n\t\tQRegExp(QString::fromLatin1(\"<[bB][oO][dD][yY].*>(.*)<\/[bB][oO][dD][yY]>\")),\n\t\tQString::fromLatin1(\"\\\\1\") );\n\tfilteredMessage.replace(\n\t\tQRegExp(QString::fromLatin1(\"<[fF][oO][nN][tT].*>(.*)<\/[fF][oO][nN][tT]>\")),\n\t\tQString::fromLatin1(\"\\\\1\") );\n\tsetProperty(mProtocol->awayMessage, filteredMessage);\n}\n\nint AIMContact::warningLevel() const\n{\n\treturn m_warningLevel;\n}\n\nvoid AIMContact::updateSSIItem()\n{\n\tif ( m_ssiItem.type() != 0xFFFF && m_ssiItem.waitingAuth() == false &&\n\t     onlineStatus() == Kopete::OnlineStatus::Unknown )\n\t{\n\t\t\/\/make sure they're offline\n\t\tsetOnlineStatus( static_cast<AIMProtocol*>( protocol() )->statusOffline );\n\t}\n}\n\nvoid AIMContact::slotUserInfo()\n{\n\tif ( !m_infoDialog)\n\t{\n\t\tm_infoDialog = new AIMUserInfoDialog( this, static_cast<AIMAccount*>( account() ), false, Kopete::UI::Global::mainWidget(), 0 );\n\t\tif( !m_infoDialog )\n\t\t\treturn;\n\t\tconnect( m_infoDialog, SIGNAL( finished() ), this, SLOT( closeUserInfoDialog() ) );\n\t\tm_infoDialog->show();\n\t\tif ( mAccount->isConnected() )\n\t\t{\n\t\t\tmAccount->engine()->requestAIMProfile( contactId() );\n\t\t\tmAccount->engine()->requestAIMAwayMessage( contactId() );\n\t\t}\n\t}\n\telse\n\t\tm_infoDialog->raise();\n}\n\nvoid AIMContact::userInfoUpdated( const QString& contact, const UserDetails& details )\n{\n\tif ( Oscar::normalize( contact ) != Oscar::normalize( contactId() ) )\n\t\treturn;\n\n\tkdDebug(OSCAR_RAW_DEBUG) << k_funcinfo << contact << endl;\n\t\n\t\/\/if they don't have an SSI alias, make sure we use the capitalization from the\n\t\/\/server so their contact id looks all pretty.\n\tQString nickname = property( Kopete::Global::Properties::self()->nickName() ).value().toString();\n\tif ( Oscar::normalize( nickname ) == Oscar::normalize( details.userId() ) )\n\t\tsetProperty( Kopete::Global::Properties::self()->nickName(), details.userId() );\n\t\n\tif ( ( details.userClass() & 32 ) == 0 )\n\t{\n\t\tsetOnlineStatus( mProtocol->statusOnline ); \/\/we're online\n\t\tremoveProperty( mProtocol->awayMessage );\n\t\tm_haveAwayMessage = false;\n\t}\n\telse\n\t{\n\t\tsetOnlineStatus( mProtocol->statusAway ); \/\/we're away\n\t\tif ( !m_haveAwayMessage ) \/\/prevent cyclic away message requests\n\t\t{\n\t\t\tmAccount->engine()->requestAIMAwayMessage( contactId() );\n\t\t\tm_haveAwayMessage = true;\n\t\t}\n\t}\n\t\n\/\/ \tif ( details.buddyIconHash() != m_details.buddyIconHash() )\n\/\/ \t\taccount()->engine()->requestBuddyIcon( contactId(), m_details.buddyIconHash() );\n\n\tOscarContact::userInfoUpdated( contact, details );\n\n\n}\n\n\n\nvoid AIMContact::userOnline( const QString& userId )\n{\n\tif ( Oscar::normalize( userId ) == Oscar::normalize( contactId() ) )\n\t{\n\t\tkdDebug(OSCAR_RAW_DEBUG) << k_funcinfo << \"Getting more contact info\" << endl;\n\t\tsetOnlineStatus( mProtocol->statusOnline );\n\t}\n}\n\nvoid AIMContact::userOffline( const QString& userId )\n{\n\tif ( Oscar::normalize( userId ) == Oscar::normalize( contactId() ) )\n\t{\n\t\tsetOnlineStatus( mProtocol->statusOffline );\n\t\tremoveProperty( mProtocol->awayMessage );\n\t}\n}\n\nvoid AIMContact::updateAwayMessage( const QString& contact, const QString& message )\n{\n\tif ( Oscar::normalize( contact ) != Oscar::normalize( contactId() ) )\n\t\treturn;\n\telse\n\t{\n\t\tif ( message.isEmpty() )\n\t\t{\n\t\t\tremoveProperty( mProtocol->awayMessage );\n\t\t\tsetOnlineStatus( mProtocol->statusOnline );\n\t\t\tm_haveAwayMessage = false;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_haveAwayMessage = true;\n\t\t\tsetAwayMessage( message );\n\t\t\tsetOnlineStatus( mProtocol->statusAway );\n\t\t}\n\t}\n\t\n\temit updatedProfile();\n}\n\nvoid AIMContact::updateProfile( const QString& contact, const QString& profile )\n{\n\tif ( Oscar::normalize( contact ) != Oscar::normalize( contactId() ) )\n\t\treturn;\n\t\n\tsetProperty( mProtocol->clientProfile, profile );\n\temit updatedProfile();\n}\n\nvoid AIMContact::gotWarning( const QString& contact, Q_UINT16 increase, Q_UINT16 newLevel )\n{\n\t\/\/somebody just got bitchslapped! :O\n\tQ_UNUSED( increase );\n\tif ( Oscar::normalize( contact ) == Oscar::normalize( contactId() ) )\n\t\tm_warningLevel = newLevel;\n\t\n\t\/\/TODO add a KNotify event after merge to HEAD\n}\n\nvoid AIMContact::closeUserInfoDialog()\n{\n\tm_infoDialog->delayedDestruct();\n\tm_infoDialog = 0L;\n}\n\nvoid AIMContact::warnUser()\n{\n\tQString nick = property( Kopete::Global::Properties::self()->nickName() ).value().toString();\n\tQString message = i18n( \"<qt>Would you like to warn %1 anonymously or with your name?<br>\" \\\n\t                        \"(Warning a user on AIM will result in a \\\"Warning Level\\\"\" \\\n\t                        \" increasing for the user you warn. Once this level has reached a\" \\\n\t                        \" certain point, they will not be able to sign on. Please do not abuse\" \\\n\t                        \" this function, it is meant for legitimate practices.)<\/qt>\" ).arg( nick );\n\t\n\t\n\tint result = KMessageBox::questionYesNoCancel( Kopete::UI::Global::mainWidget(), message,\n\t                                               i18n( \"Warn User %1?\" ).arg( nick ),\n\t                                               i18n( \"Warn Anonymously\" ), i18n( \"Warn\" ) );\n\t\n\tif ( result == KMessageBox::Yes )\n\t\tmAccount->engine()->sendWarning( contactId(), true);\n\telse if ( result == KMessageBox::No )\n\t\tmAccount->engine()->sendWarning( contactId(), false);\n}\n\nvoid AIMContact::sendAutoResponse(Kopete::Message& msg)\n{\n\t\/\/ The target time is 2 minutes later than the last message\n\tint delta = m_lastAutoresponseTime.secsTo( QDateTime::currentDateTime() );\n\tkdDebug(14152) << k_funcinfo << \"Last autoresponse time: \" << m_lastAutoresponseTime << endl;\n\tkdDebug(14152) << k_funcinfo << \"Current time: \" << QDateTime::currentDateTime() << endl;\n\tkdDebug(14152) << k_funcinfo << \"Difference: \" << delta << endl;\n\t\/\/ Check to see if we're past that time\n\tif(delta > 120)\n\t{\n\t\tkdDebug(14152) << k_funcinfo << \"Sending auto response\" << endl;\n\t\t\/\/ This code was yoinked straight from OscarContact::slotSendMsg()\n\t\t\/\/ If only that slot wasn't private, but I'm not gonna change it right now.\n\t\tOscar::Message message;\n\t\n\t\tmessage.setText( msg.plainBody() );\n\t\t\n\t\tmessage.setTimestamp( msg.timestamp() );\n\t\tmessage.setSender( mAccount->accountId() );\n\t\tmessage.setReceiver( mName );\n\t\tmessage.setType( 0x01 );\n\t\t\n\t\t\/\/ isAuto defaults to false\n\t\tmAccount->engine()->sendMessage( message, true);\n\t\tkdDebug(14152) << k_funcinfo << \"Sent auto response\" << endl;\n\t\tmanager(Kopete::Contact::CanCreate)->appendMessage(msg);\n\t\tmanager(Kopete::Contact::CanCreate)->messageSucceeded();\n\t\t\/\/ Update the last autoresponse time\n\t\tm_lastAutoresponseTime = QDateTime::currentDateTime();\n\t}\n\telse\n\t{\n\t\tkdDebug(14152) << k_funcinfo << \"Not enough time since last autoresponse, NOT sending\" << endl;\n\t}\n}\n#include \"aimcontact.moc\"\n\/\/kate: tab-width 4; indent-mode csands;\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: gsub.cxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 16:38: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\nextern \"C\"\n{\n#include \"sft.h\"\n#undef true\n#undef false\n\n#include \"gsub.h\"\n}\n\n#include <vector>\n#include <map>\n#include <algorithm>\n\ntypedef sal_uInt32 ULONG;\ntypedef sal_uInt16 USHORT;\ntypedef sal_uInt8 FT_Byte;\n\ntypedef std::map<USHORT,USHORT> GlyphSubstitution;\n\n\ninline long NEXT_Long( const unsigned char* &p )\n{\n    long nVal = (p[0]<<24) + (p[1]<<16) + (p[2]<<8) + p[3];\n    p += 4;\n    return nVal;\n}\n\ninline USHORT NEXT_UShort( const unsigned char* &p )\n{\n    USHORT nVal = (p[0]<<8) + p[1];\n    p += 2;\n    return nVal;\n}\n\n#define MKTAG(s) ((((((s[0]<<8)+s[1])<<8)+s[2])<<8)+s[3])\n\nint ReadGSUB( struct _TrueTypeFont* pTTFile, unsigned char* pGsubBase,\n              int nRequestedScript, int nRequestedLangsys )\n{\n    if( !pGsubBase )\n        return -1;\n\n    \/\/ parse GSUB header\n    const FT_Byte* pGsubHeader = pGsubBase;\n    const ULONG nVersion            = NEXT_Long( pGsubHeader );\n    const USHORT nOfsScriptList     = NEXT_UShort( pGsubHeader );\n    const USHORT nOfsFeatureTable   = NEXT_UShort( pGsubHeader );\n    const USHORT nOfsLookupList     = NEXT_UShort( pGsubHeader );\n\n    \/\/ sanity check the GSUB header\n    if( nVersion != 0x00010000 )\n        if( nVersion != 0x00001000 )    \/\/ workaround for SunBatang etc.\n            return -1;                  \/\/ unknown format or broken\n\n    typedef std::vector<ULONG> ReqFeatureTagList;\n    ReqFeatureTagList aReqFeatureTagList;\n\n    aReqFeatureTagList.push_back( MKTAG(\"vert\") );\n\n    typedef std::vector<USHORT> UshortList;\n    UshortList aFeatureIndexList;\n    UshortList aFeatureOffsetList;\n\n    \/\/ parse Script Table\n    const FT_Byte* pScriptHeader = pGsubBase + nOfsScriptList;\n    const USHORT nCntScript = NEXT_UShort( pScriptHeader );\n    for( USHORT nScriptIndex = 0; nScriptIndex < nCntScript; ++nScriptIndex )\n    {\n        const ULONG nTag            = NEXT_Long( pScriptHeader ); \/\/ e.g. hani\/arab\/kana\/hang\n        const USHORT nOfsScriptTable= NEXT_UShort( pScriptHeader );\n        if( (nTag != (USHORT)nRequestedScript) && (nRequestedScript != 0) )\n            continue;\n\n        const FT_Byte* pScriptTable     = pGsubBase + nOfsScriptList + nOfsScriptTable;\n        const USHORT nDefaultLangsysOfs = NEXT_UShort( pScriptTable );\n        const USHORT nCntLangSystem     = NEXT_UShort( pScriptTable );\n        USHORT nLangsysOffset = 0;\n        for( USHORT nLangsysIndex = 0; nLangsysIndex < nCntLangSystem; ++nLangsysIndex )\n        {\n            const ULONG nTag    = NEXT_Long( pScriptTable );    \/\/ e.g. KOR\/ZHS\/ZHT\/JAN\n            const USHORT nOffset= NEXT_UShort( pScriptTable );\n            if( (nTag != (USHORT)nRequestedLangsys) && (nRequestedLangsys != 0) )\n                continue;\n            nLangsysOffset = nOffset;\n            break;\n        }\n\n        if( (nDefaultLangsysOfs != 0) && (nDefaultLangsysOfs != nLangsysOffset) )\n        {\n            const FT_Byte* pLangSys = pGsubBase + nOfsScriptList + nOfsScriptTable + nDefaultLangsysOfs;\n            \/*const USHORT nLookupOrder   =*\/ NEXT_UShort( pLangSys );\n            const USHORT nReqFeatureIdx = NEXT_UShort( pLangSys );\n            const USHORT nCntFeature    = NEXT_UShort( pLangSys );\n            aFeatureIndexList.push_back( nReqFeatureIdx );\n            for( USHORT i = 0; i < nCntFeature; ++i )\n            {\n                const USHORT nFeatureIndex = NEXT_UShort( pLangSys );\n                aFeatureIndexList.push_back( nFeatureIndex );\n            }\n        }\n\n        if( nLangsysOffset != 0 )\n        {\n            const FT_Byte* pLangSys = pGsubBase + nOfsScriptList + nOfsScriptTable + nLangsysOffset;\n            \/*const USHORT nLookupOrder   =*\/ NEXT_UShort( pLangSys );\n            const USHORT nReqFeatureIdx = NEXT_UShort( pLangSys );\n            const USHORT nCntFeature    = NEXT_UShort( pLangSys );\n            aFeatureIndexList.push_back( nReqFeatureIdx );\n            for( USHORT i = 0; i < nCntFeature; ++i )\n            {\n                const USHORT nFeatureIndex = NEXT_UShort( pLangSys );\n                aFeatureIndexList.push_back( nFeatureIndex );\n            }\n        }\n    }\n\n    if( !aFeatureIndexList.size() )\n        return true;\n\n    UshortList aLookupIndexList;\n    UshortList aLookupOffsetList;\n\n    \/\/ parse Feature Table\n    const FT_Byte* pFeatureHeader = pGsubBase + nOfsFeatureTable;\n    const USHORT nCntFeature = NEXT_UShort( pFeatureHeader );\n    for( USHORT nFeatureIndex = 0; nFeatureIndex < nCntFeature; ++nFeatureIndex )\n    {\n        const ULONG nTag    = NEXT_Long( pFeatureHeader ); \/\/ e.g. locl\/vert\/trad\/smpl\/liga\/fina\/...\n        const USHORT nOffset= NEXT_UShort( pFeatureHeader );\n\n        \/\/ feature (required && (requested || available))?\n        if( (aFeatureIndexList[0] != nFeatureIndex)\n            &&  (!std::count( aReqFeatureTagList.begin(), aReqFeatureTagList.end(), nTag))\n            ||  (!std::count( aFeatureIndexList.begin(), aFeatureIndexList.end(), nFeatureIndex) ) )\n            continue;\n\n        const FT_Byte* pFeatureTable = pGsubBase + nOfsFeatureTable + nOffset;\n        const USHORT nCntLookups = NEXT_UShort( pFeatureTable );\n        for( USHORT i = 0; i < nCntLookups; ++i )\n        {\n            const USHORT nLookupIndex = NEXT_UShort( pFeatureTable );\n            aLookupIndexList.push_back( nLookupIndex );\n        }\n        if( nCntLookups == 0 ) \/\/### hack needed by Mincho\/Gothic\/Mingliu\/Simsun\/...\n            aLookupIndexList.push_back( 0 );\n    }\n\n    \/\/ parse Lookup List\n    const FT_Byte* pLookupHeader = pGsubBase + nOfsLookupList;\n    const USHORT nCntLookupTable = NEXT_UShort( pLookupHeader );\n    for( USHORT nLookupIdx = 0; nLookupIdx < nCntLookupTable; ++nLookupIdx )\n    {\n        const USHORT nOffset = NEXT_UShort( pLookupHeader );\n        if( std::count( aLookupIndexList.begin(), aLookupIndexList.end(), nLookupIdx ) )\n            aLookupOffsetList.push_back( nOffset );\n    }\n\n    UshortList::const_iterator it = aLookupOffsetList.begin();\n    for(; it != aLookupOffsetList.end(); ++it )\n    {\n        const USHORT nOfsLookupTable = *it;\n        const FT_Byte* pLookupTable = pGsubBase + nOfsLookupList + nOfsLookupTable;\n        const USHORT eLookupType        = NEXT_UShort( pLookupTable );\n        \/*const USHORT eLookupFlag        =*\/ NEXT_UShort( pLookupTable );\n        const USHORT nCntLookupSubtable = NEXT_UShort( pLookupTable );\n\n        \/\/ TODO: switch( eLookupType )\n        if( eLookupType != 1 )  \/\/ TODO: once we go beyond SingleSubst\n            continue;\n\n        for( USHORT nSubTableIdx = 0; nSubTableIdx < nCntLookupSubtable; ++nSubTableIdx )\n        {\n            const USHORT nOfsSubLookupTable = NEXT_UShort( pLookupTable );\n            const FT_Byte* pSubLookup = pGsubBase + nOfsLookupList + nOfsLookupTable + nOfsSubLookupTable;\n\n            const USHORT nFmtSubstitution   = NEXT_UShort( pSubLookup );\n            const USHORT nOfsCoverage       = NEXT_UShort( pSubLookup );\n\n            typedef std::pair<USHORT,USHORT> GlyphSubst;\n            typedef std::vector<GlyphSubst> SubstVector;\n            SubstVector aSubstVector;\n\n            const FT_Byte* pCoverage    = pGsubBase + nOfsLookupList + nOfsLookupTable + nOfsSubLookupTable + nOfsCoverage;\n            const USHORT nFmtCoverage   = NEXT_UShort( pCoverage );\n            switch( nFmtCoverage )\n            {\n                case 1:         \/\/ Coverage Format 1\n                {\n                    const USHORT nCntGlyph = NEXT_UShort( pCoverage );\n                    aSubstVector.reserve( nCntGlyph );\n                    for( USHORT i = 0; i < nCntGlyph; ++i )\n                    {\n                        const USHORT nGlyphId = NEXT_UShort( pCoverage );\n                        aSubstVector.push_back( GlyphSubst( nGlyphId, 0 ) );\n                    }\n                }\n                break;\n\n                case 2:         \/\/ Coverage Format 2\n                {\n                    const USHORT nCntRange = NEXT_UShort( pCoverage );\n                    for( int i = nCntRange; --i >= 0; )\n                    {\n                        const USHORT nGlyph0 = NEXT_UShort( pCoverage );\n                        const USHORT nGlyph1 = NEXT_UShort( pCoverage );\n                        const USHORT nCovIdx = NEXT_UShort( pCoverage );\n                        for( USHORT j = nGlyph0; j <= nGlyph1; ++j )\n                            aSubstVector.push_back( GlyphSubst( j + nCovIdx, 0 ) );\n                    }\n                }\n                break;\n            }\n\n            SubstVector::iterator it( aSubstVector.begin() );\n\n            switch( nFmtSubstitution )\n            {\n                case 1:     \/\/ Single Substitution Format 1\n                {\n                    const USHORT nDeltaGlyphId = NEXT_UShort( pSubLookup );\n\n                    for(; it != aSubstVector.end(); ++it )\n                        (*it).second = (*it).first + nDeltaGlyphId;\n                }\n                break;\n\n                case 2:     \/\/ Single Substitution Format 2\n                {\n                    const USHORT nCntGlyph = NEXT_UShort( pSubLookup );\n                    for( int i = nCntGlyph; (it != aSubstVector.end()) && (--i>=0); ++it )\n                    {\n                        const USHORT nGlyphId = NEXT_UShort( pSubLookup );\n                        (*it).second = nGlyphId;\n                    }\n                }\n                break;\n            }\n\n            \/\/ now apply the glyph substitutions that have been collected in this subtable\n            if( aSubstVector.size() > 0 )\n            {\n                GlyphSubstitution* pGSubstitution = new GlyphSubstitution;\n                pTTFile->pGSubstitution = (void*)pGSubstitution;\n                for( it = aSubstVector.begin(); it != aSubstVector.end(); ++it )\n                    (*pGSubstitution)[ (*it).first ] =  (*it).second;\n            }\n        }\n    }\n\n    return true;\n}\n\nint UseGSUB( struct _TrueTypeFont* pTTFile, int nGlyph, int wmode )\n{\n    GlyphSubstitution* pGlyphSubstitution = (GlyphSubstitution*)pTTFile->pGSubstitution;\n    if( pGlyphSubstitution != 0 )\n    {\n        GlyphSubstitution::const_iterator it( pGlyphSubstitution->find( nGlyph ) );\n        if( it != pGlyphSubstitution->end() )\n            nGlyph = (*it).second;\n    }\n\n    return nGlyph;\n}\n\nint HasVerticalGSUB( struct _TrueTypeFont* pTTFile )\n{\n    GlyphSubstitution* pGlyphSubstitution = (GlyphSubstitution*)pTTFile->pGSubstitution;\n    return pGlyphSubstitution ? +1 : 0;\n}\n<commit_msg>INTEGRATION: CWS vcl50 (1.7.24); FILE MERGED 2006\/01\/10 10:40:17 hdu 1.7.24.1: #129682# check accesses inside GSUB table<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: gsub.cxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: hr $ $Date: 2006-01-25 11:35: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\nextern \"C\"\n{\n#include \"sft.h\"\n#undef true\n#undef false\n\n#include \"gsub.h\"\n}\n\n#include <vector>\n#include <map>\n#include <algorithm>\n\ntypedef sal_uInt32 ULONG;\ntypedef sal_uInt16 USHORT;\ntypedef sal_uInt8 FT_Byte;\n\ntypedef std::map<USHORT,USHORT> GlyphSubstitution;\n\n\ninline long NEXT_Long( const unsigned char* &p )\n{\n    long nVal = (p[0]<<24) + (p[1]<<16) + (p[2]<<8) + p[3];\n    p += 4;\n    return nVal;\n}\n\ninline USHORT NEXT_UShort( const unsigned char* &p )\n{\n    USHORT nVal = (p[0]<<8) + p[1];\n    p += 2;\n    return nVal;\n}\n\n#define MKTAG(s) ((((((s[0]<<8)+s[1])<<8)+s[2])<<8)+s[3])\n\nint ReadGSUB( struct _TrueTypeFont* pTTFile,\n    int nRequestedScript, int nRequestedLangsys )\n{\n    const FT_Byte* pGsubBase = (FT_Byte*)pTTFile->tables[ O_gsub ];\n    if( !pGsubBase )\n        return -1;\n\n    \/\/ #129682# check offsets inside GSUB table\n    const FT_Byte* pGsubLimit = pGsubBase + pTTFile->tlens[ O_gsub ];\n\n    \/\/ parse GSUB header\n    const FT_Byte* pGsubHeader = pGsubBase;\n    const ULONG nVersion            = NEXT_Long( pGsubHeader );\n    const USHORT nOfsScriptList     = NEXT_UShort( pGsubHeader );\n    const USHORT nOfsFeatureTable   = NEXT_UShort( pGsubHeader );\n    const USHORT nOfsLookupList     = NEXT_UShort( pGsubHeader );\n\n    \/\/ sanity check the GSUB header\n    if( nVersion != 0x00010000 )\n        if( nVersion != 0x00001000 )    \/\/ workaround for SunBatang etc.\n            return -1;                  \/\/ unknown format or broken\n\n    typedef std::vector<ULONG> ReqFeatureTagList;\n    ReqFeatureTagList aReqFeatureTagList;\n\n    aReqFeatureTagList.push_back( MKTAG(\"vert\") );\n\n    typedef std::vector<USHORT> UshortList;\n    UshortList aFeatureIndexList;\n    UshortList aFeatureOffsetList;\n\n    \/\/ parse Script Table\n    const FT_Byte* pScriptHeader = pGsubBase + nOfsScriptList;\n    const USHORT nCntScript = NEXT_UShort( pScriptHeader );\n    if( pGsubLimit <= pScriptHeader + 6 * nCntScript )\n        return false;\n    for( USHORT nScriptIndex = 0; nScriptIndex < nCntScript; ++nScriptIndex )\n    {\n        const ULONG nTag            = NEXT_Long( pScriptHeader ); \/\/ e.g. hani\/arab\/kana\/hang\n        const USHORT nOfsScriptTable= NEXT_UShort( pScriptHeader );\n        if( (nTag != (USHORT)nRequestedScript) && (nRequestedScript != 0) )\n            continue;\n\n        const FT_Byte* pScriptTable     = pGsubBase + nOfsScriptList + nOfsScriptTable;\n        if( pGsubLimit <= pScriptTable + 4 )\n            return false;\n        const USHORT nDefaultLangsysOfs = NEXT_UShort( pScriptTable );\n        const USHORT nCntLangSystem     = NEXT_UShort( pScriptTable );\n        USHORT nLangsysOffset = 0;\n        if( pGsubLimit <= pScriptTable + 6 * nCntLangSystem )\n            return false;\n        for( USHORT nLangsysIndex = 0; nLangsysIndex < nCntLangSystem; ++nLangsysIndex )\n        {\n            const ULONG nTag    = NEXT_Long( pScriptTable );    \/\/ e.g. KOR\/ZHS\/ZHT\/JAN\n            const USHORT nOffset= NEXT_UShort( pScriptTable );\n            if( (nTag != (USHORT)nRequestedLangsys) && (nRequestedLangsys != 0) )\n                continue;\n            nLangsysOffset = nOffset;\n            break;\n        }\n\n        if( (nDefaultLangsysOfs != 0) && (nDefaultLangsysOfs != nLangsysOffset) )\n        {\n            const FT_Byte* pLangSys = pGsubBase + nOfsScriptList + nOfsScriptTable + nDefaultLangsysOfs;\n            if( pGsubLimit <= pLangSys + 6 )\n                return false;\n            \/*const USHORT nLookupOrder   =*\/ NEXT_UShort( pLangSys );\n            const USHORT nReqFeatureIdx = NEXT_UShort( pLangSys );\n            const USHORT nCntFeature    = NEXT_UShort( pLangSys );\n            if( pGsubLimit <= pLangSys + 2 * nCntFeature )\n                return false;\n            aFeatureIndexList.push_back( nReqFeatureIdx );\n            for( USHORT i = 0; i < nCntFeature; ++i )\n            {\n                const USHORT nFeatureIndex = NEXT_UShort( pLangSys );\n                aFeatureIndexList.push_back( nFeatureIndex );\n            }\n        }\n\n        if( nLangsysOffset != 0 )\n        {\n            const FT_Byte* pLangSys = pGsubBase + nOfsScriptList + nOfsScriptTable + nLangsysOffset;\n            if( pGsubLimit <= pLangSys + 6 )\n                return false;\n            \/*const USHORT nLookupOrder   =*\/ NEXT_UShort( pLangSys );\n            const USHORT nReqFeatureIdx = NEXT_UShort( pLangSys );\n            const USHORT nCntFeature    = NEXT_UShort( pLangSys );\n            if( pGsubLimit <= pLangSys + 2 * nCntFeature )\n                return false;\n            aFeatureIndexList.push_back( nReqFeatureIdx );\n            for( USHORT i = 0; i < nCntFeature; ++i )\n            {\n                const USHORT nFeatureIndex = NEXT_UShort( pLangSys );\n                aFeatureIndexList.push_back( nFeatureIndex );\n            }\n        }\n    }\n\n    if( !aFeatureIndexList.size() )\n        return true;\n\n    UshortList aLookupIndexList;\n    UshortList aLookupOffsetList;\n\n    \/\/ parse Feature Table\n    const FT_Byte* pFeatureHeader = pGsubBase + nOfsFeatureTable;\n    if( pGsubLimit <= pFeatureHeader + 2 )\n          return false;\n    const USHORT nCntFeature = NEXT_UShort( pFeatureHeader );\n    if( pGsubLimit <= pFeatureHeader + 6 * nCntFeature )\n          return false;\n    for( USHORT nFeatureIndex = 0; nFeatureIndex < nCntFeature; ++nFeatureIndex )\n    {\n        const ULONG nTag    = NEXT_Long( pFeatureHeader ); \/\/ e.g. locl\/vert\/trad\/smpl\/liga\/fina\/...\n        const USHORT nOffset= NEXT_UShort( pFeatureHeader );\n\n        \/\/ feature (required && (requested || available))?\n        if( (aFeatureIndexList[0] != nFeatureIndex)\n            &&  (!std::count( aReqFeatureTagList.begin(), aReqFeatureTagList.end(), nTag))\n            ||  (!std::count( aFeatureIndexList.begin(), aFeatureIndexList.end(), nFeatureIndex) ) )\n            continue;\n\n        const FT_Byte* pFeatureTable = pGsubBase + nOfsFeatureTable + nOffset;\n        if( pGsubLimit <= pFeatureTable + 2 )\n            return false;\n        const USHORT nCntLookups = NEXT_UShort( pFeatureTable );\n        if( pGsubLimit <= pFeatureTable + 2 * nCntLookups )\n            return false;\n        for( USHORT i = 0; i < nCntLookups; ++i )\n        {\n            const USHORT nLookupIndex = NEXT_UShort( pFeatureTable );\n            aLookupIndexList.push_back( nLookupIndex );\n        }\n        if( nCntLookups == 0 ) \/\/### hack needed by Mincho\/Gothic\/Mingliu\/Simsun\/...\n            aLookupIndexList.push_back( 0 );\n    }\n\n    \/\/ parse Lookup List\n    const FT_Byte* pLookupHeader = pGsubBase + nOfsLookupList;\n    if( pGsubLimit <= pLookupHeader + 2 )\n        return false;\n    const USHORT nCntLookupTable = NEXT_UShort( pLookupHeader );\n    if( pGsubLimit <= pLookupHeader + 2 * nCntLookupTable )\n        return false;\n    for( USHORT nLookupIdx = 0; nLookupIdx < nCntLookupTable; ++nLookupIdx )\n    {\n        const USHORT nOffset = NEXT_UShort( pLookupHeader );\n        if( std::count( aLookupIndexList.begin(), aLookupIndexList.end(), nLookupIdx ) )\n            aLookupOffsetList.push_back( nOffset );\n    }\n\n    UshortList::const_iterator it = aLookupOffsetList.begin();\n    for(; it != aLookupOffsetList.end(); ++it )\n    {\n        const USHORT nOfsLookupTable = *it;\n        const FT_Byte* pLookupTable = pGsubBase + nOfsLookupList + nOfsLookupTable;\n        if( pGsubLimit <= pLookupTable + 6 )\n            return false;\n        const USHORT eLookupType        = NEXT_UShort( pLookupTable );\n        \/*const USHORT eLookupFlag        =*\/ NEXT_UShort( pLookupTable );\n        const USHORT nCntLookupSubtable = NEXT_UShort( pLookupTable );\n\n        \/\/ TODO: switch( eLookupType )\n        if( eLookupType != 1 )  \/\/ TODO: once we go beyond SingleSubst\n            continue;\n\n        if( pGsubLimit <= pLookupTable + 2 * nCntLookupSubtable )\n            return false;\n        for( USHORT nSubTableIdx = 0; nSubTableIdx < nCntLookupSubtable; ++nSubTableIdx )\n        {\n            const USHORT nOfsSubLookupTable = NEXT_UShort( pLookupTable );\n            const FT_Byte* pSubLookup = pGsubBase + nOfsLookupList + nOfsLookupTable + nOfsSubLookupTable;\n            if( pGsubLimit <= pSubLookup + 6 )\n                return false;\n            const USHORT nFmtSubstitution   = NEXT_UShort( pSubLookup );\n            const USHORT nOfsCoverage       = NEXT_UShort( pSubLookup );\n\n            typedef std::pair<USHORT,USHORT> GlyphSubst;\n            typedef std::vector<GlyphSubst> SubstVector;\n            SubstVector aSubstVector;\n\n            const FT_Byte* pCoverage    = pGsubBase\n                + nOfsLookupList + nOfsLookupTable + nOfsSubLookupTable + nOfsCoverage;\n            if( pGsubLimit <= pCoverage + 4 )\n                return false;\n            const USHORT nFmtCoverage   = NEXT_UShort( pCoverage );\n            switch( nFmtCoverage )\n            {\n                case 1:         \/\/ Coverage Format 1\n                {\n                    const USHORT nCntGlyph = NEXT_UShort( pCoverage );\n                    if( pGsubLimit <= pCoverage + 2 * nCntGlyph )\n                        return false;\n                    aSubstVector.reserve( nCntGlyph );\n                    for( USHORT i = 0; i < nCntGlyph; ++i )\n                    {\n                        const USHORT nGlyphId = NEXT_UShort( pCoverage );\n                        aSubstVector.push_back( GlyphSubst( nGlyphId, 0 ) );\n                    }\n                }\n                break;\n\n                case 2:         \/\/ Coverage Format 2\n                {\n                    const USHORT nCntRange = NEXT_UShort( pCoverage );\n                    if( pGsubLimit <= pCoverage + 6 * nCntRange )\n                        return false;\n                    for( int i = nCntRange; --i >= 0; )\n                    {\n                        const USHORT nGlyph0 = NEXT_UShort( pCoverage );\n                        const USHORT nGlyph1 = NEXT_UShort( pCoverage );\n                        const USHORT nCovIdx = NEXT_UShort( pCoverage );\n                        for( USHORT j = nGlyph0; j <= nGlyph1; ++j )\n                            aSubstVector.push_back( GlyphSubst( j + nCovIdx, 0 ) );\n                    }\n                }\n                break;\n            }\n\n            SubstVector::iterator it( aSubstVector.begin() );\n\n            switch( nFmtSubstitution )\n            {\n                case 1:     \/\/ Single Substitution Format 1\n                {\n                    const USHORT nDeltaGlyphId = NEXT_UShort( pSubLookup );\n\n                    for(; it != aSubstVector.end(); ++it )\n                        (*it).second = (*it).first + nDeltaGlyphId;\n                }\n                break;\n\n                case 2:     \/\/ Single Substitution Format 2\n                {\n                    const USHORT nCntGlyph = NEXT_UShort( pSubLookup );\n                    for( int i = nCntGlyph; (it != aSubstVector.end()) && (--i>=0); ++it )\n                    {\n                        if( pGsubLimit <= pSubLookup + 2 )\n                            return false;\n                        const USHORT nGlyphId = NEXT_UShort( pSubLookup );\n                        (*it).second = nGlyphId;\n                    }\n                }\n                break;\n            }\n\n            \/\/ now apply the glyph substitutions that have been collected in this subtable\n            if( aSubstVector.size() > 0 )\n            {\n                GlyphSubstitution* pGSubstitution = new GlyphSubstitution;\n                pTTFile->pGSubstitution = (void*)pGSubstitution;\n                for( it = aSubstVector.begin(); it != aSubstVector.end(); ++it )\n                    (*pGSubstitution)[ (*it).first ] =  (*it).second;\n            }\n        }\n    }\n\n    return true;\n}\n\nint UseGSUB( struct _TrueTypeFont* pTTFile, int nGlyph, int wmode )\n{\n    GlyphSubstitution* pGlyphSubstitution = (GlyphSubstitution*)pTTFile->pGSubstitution;\n    if( pGlyphSubstitution != 0 )\n    {\n        GlyphSubstitution::const_iterator it( pGlyphSubstitution->find( nGlyph ) );\n        if( it != pGlyphSubstitution->end() )\n            nGlyph = (*it).second;\n    }\n\n    return nGlyph;\n}\n\nint HasVerticalGSUB( struct _TrueTypeFont* pTTFile )\n{\n    GlyphSubstitution* pGlyphSubstitution = (GlyphSubstitution*)pTTFile->pGSubstitution;\n    return pGlyphSubstitution ? +1 : 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/      Player.cpp\n\/\/\n\n#include <iostream>\n#include <vector>\n#include <string>\n#include \"Player.h\"\n#include \"PlayerModel.h\"\n\nusing namespace std;\n\n\nPlayer::Player(string login, string password)\n{\n    _login = login;\n    _password = password;\n}\n\nPlayer::Player()\n{\n}\n\nbool Player::connect()\n{\n    \/\/if the login and password are not defined\n    if (_login.compare(\"\") == 0 || _password.compare(\"\") == 0) {\n        while (_login.compare(\"\") == 0) {\n            cout << \"Login: \";\n            cin >> _login;\n        }\n        while (_password.compare(\"\") == 0) {\n            cout << \"Password: \";\n            cin >> _password;\n        }\n    }\n\n    _model = PlayerModel::loadByLoginAndPassword(_login, _password);\n\n    return _model != NULL;\n}\n<commit_msg>includes added<commit_after>\/\/      Player.cpp\n\/\/\n\n#include <iostream>\n#include <vector>\n#include <string>\n#include <cstdlib>\n#include \"Player.h\"\n#include \"PlayerModel.h\"\n#include \"GenderModel.h\"\n#include \"SpeciesModel.h\"\n#include \"Utils.h\"\n\nusing namespace std;\n\n\nPlayer::Player(string login, string password)\n{\n    _login = login;\n    _password = password;\n}\n\nPlayer::Player()\n{\n}\n\nbool Player::connect()\n{\n    \/\/if the login and password are not defined\n    if (_login.compare(\"\") == 0 || _password.compare(\"\") == 0) {\n        while (_login.compare(\"\") == 0) {\n            cout << \"Login: \";\n            cin >> _login;\n        }\n        while (_password.compare(\"\") == 0) {\n            cout << \"Password: \";\n            cin >> _password;\n        }\n    }\n\n    _model = PlayerModel::loadByLoginAndPassword(_login, _password);\n\n    return _model != NULL;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>make SwIterator final<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>assert hard here<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  CartoCSSParser.cpp\n\/\/  G3MiOSSDK\n\/\/\n\/\/  Created by Diego Gomez Deck on 9\/16\/13.\n\/\/\n\/\/\n\n#include \"CartoCSSParser.hpp\"\n\n#include \"IByteBuffer.hpp\"\n#include \"IStringUtils.hpp\"\n#include \"CartoCSSLexer.hpp\"\n#include <map>\n\n\nCartoCSSParser::CartoCSSParser(const std::string& source) :\n_tokens(CartoCSSLexer::tokenize(source)),\n_tokensSize(_tokens.size()),\n_tokensCursor(0)\n{\n  _variableDefinitionTokensType.push_back(STRING);\n  _variableDefinitionTokensType.push_back(COLON);\n  _variableDefinitionTokensType.push_back(STRING);\n  _variableDefinitionTokensType.push_back(SEMICOLON);\n}\n\nCartoCSSResult* CartoCSSParser::parse(const IByteBuffer* css) {\n  return parse(css->getAsString());\n}\n\nCartoCSSResult* CartoCSSParser::parse(const std::string& css) {\n  CartoCSSParser parser(css);\n  return parser.pvtParse();\n}\n\nCartoCSSResult* CartoCSSParser::pvtParse() {\n  CartoCSSResult* result = document();\n\n  if (_tokensCursor < _tokensSize) {\n    result->addError(CartoCSSError(\"End of CartoCSS expected\", _tokens[_tokensCursor]->_position));\n  }\n\n  for (int i = 0; i < _tokensSize; i++) {\n    const CartoCSSToken* token = _tokens[i];\n    delete token;\n  }\n\n  return result;\n}\n\nbool CartoCSSParser::lookAhead(const std::vector<CartoCSSTokenType>& expectedTokensType,\n                               int from,\n                               int to) const {\n  const int expectedTokensTypeSize = expectedTokensType.size();\n  const int lastCursor = from + expectedTokensTypeSize;\n  if (lastCursor > to) {\n    return false;\n  }\n\n  for (int i = 0; i < expectedTokensTypeSize; i++) {\n    const CartoCSSTokenType expectedTokenType = expectedTokensType[i];\n    const CartoCSSToken* token = _tokens[from + i];\n    if (token->_type != expectedTokenType) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\nbool CartoCSSParser::parseVariableDeclaration(CartoCSSSymbolizer* currentSymbolizer) {\n  if ( !lookAhead(_variableDefinitionTokensType) ) {\n    return false;\n  }\n\n  const std::string variableName  = ((const StringCartoCSSToken*) _tokens[_tokensCursor])->str();\n\n  if (variableName[0] != '@') {\n    return false;\n  }\n\n  const std::string variableValue = ((const StringCartoCSSToken*) _tokens[_tokensCursor + 2])->str();\n\n  currentSymbolizer->setVariableDeclaration(variableName, variableValue);\n\n\/\/  ILogger::instance()->logInfo(\"Found variable \\\"%s\\\"=\\\"%s\\\"\",\n\/\/                               variableName.c_str(),\n\/\/                               variableValue.c_str());\n  int _DGD_At_Work;\n\n  _tokensCursor += _variableDefinitionTokensType.size();\n  return true;\n}\n\nint CartoCSSParser::lookAheadManyOf(const CartoCSSTokenType alternative1,\n                                    const CartoCSSTokenType alternative2,\n                                    int from,\n                                    int to) const {\n  if (from < to-1) {\n    const CartoCSSTokenType firstType = _tokens[from]->_type;\n    if ((firstType != alternative1) &&\n        (firstType != alternative2)) {\n      return -1;\n    }\n\n    for (int i = from+1; i < to; i++) {\n      const CartoCSSTokenType type = _tokens[i]->_type;\n      if ((type != alternative1) &&\n          (type != alternative2)) {\n        return i-1;\n      }\n    }\n  }\n\n  return -1;\n}\n\nint CartoCSSParser::lookAheadBalancedBraces(int from,\n                                            int to) const {\n  if (from < to) {\n    if (_tokens[from]->_type == OPEN_BRACE) {\n      int openedCount = 1;\n      for (int i = from+1; i < _tokensSize; i++) {\n        const CartoCSSTokenType type = _tokens[i]->_type;\n        if (type == OPEN_BRACE) {\n          openedCount++;\n        }\n        else if (type == CLOSE_BRACE) {\n          openedCount--;\n          if (openedCount <= 0) {\n            return i;\n          }\n        }\n      }\n    }\n  }\n  return -1;\n}\n\nint CartoCSSParser::parseSymbolizerBlock(CartoCSSSymbolizer* currentSymbolizer,\n                                         int from,\n                                         int to) const {\n  const int lasSelectorCursor = lookAheadManyOf(STRING, EXPRESION, from, to);\n  if (lasSelectorCursor < 0) {\n    return -1;\n  }\n\n  const int lastCloseBracePosition = lookAheadBalancedBraces(lasSelectorCursor + 1, to);\n  if (lastCloseBracePosition <= 0) {\n    return -1;\n  }\n\n  std::vector<std::string> selectors;\n  for (int i = from; i <= lasSelectorCursor; i++) {\n    const CartoCSSToken* token = _tokens[i];\n    const CartoCSSTokenType type = token->_type;\n    switch (type) {\n      case STRING: {\n        const StringCartoCSSToken* stringToken = (const StringCartoCSSToken*) token;\n        selectors.push_back( stringToken->str() );\n        \/\/ILogger::instance()->logInfo(\"\\\"%s\\\"\", stringToken->str().c_str());\n        int _DGD_At_Work;\n        break;\n      }\n\n      case EXPRESION: {\n        const ExpressionCartoCSSToken* expressionToken = (const ExpressionCartoCSSToken*) token;\n        selectors.push_back( \"[\" + expressionToken->_source + \"]\");\n        \/\/ILogger::instance()->logInfo(\"[%s]\", expressionToken->_source.c_str());\n        int _DGD_At_Work;\n        break;\n      }\n\n      default: {\n        ILogger::instance()->logError(\"CartoCSSParser: Logic error (1)\");\n        return -1;\n      }\n    }\n  }\n\n  CartoCSSSymbolizer* newSymbolizer = new CartoCSSSymbolizer(selectors);\n  currentSymbolizer->addSymbolizer(newSymbolizer);\n\n  int newCursor;\n  int cursor = lasSelectorCursor+2;\n  while (cursor < lastCloseBracePosition) {\n    if (lookAhead(_variableDefinitionTokensType, cursor, lastCloseBracePosition)) {\n      const std::string variableName  = ((const StringCartoCSSToken*) _tokens[cursor])->str();\n      const std::string variableValue = ((const StringCartoCSSToken*) _tokens[cursor + 2])->str();\n\n      newSymbolizer->setProperty(variableName, variableValue);\n      \/\/ILogger::instance()->logInfo(\"    %s=%s\", variableName.c_str(), variableValue.c_str());\n      int _DGD_At_Work;\n\n      cursor += _variableDefinitionTokensType.size();\n      continue;\n    }\n\n    if ( (newCursor = parseSymbolizerBlock(newSymbolizer, cursor, lastCloseBracePosition)) >= 0 ) {\n      cursor = newCursor;\n      continue;\n    }\n\n    ILogger::instance()->logInfo(\"****%s\", _tokens[cursor]->description().c_str());\n    int _DGD_At_Work;\n    cursor++;\n  }\n\n  return lastCloseBracePosition+1;\n}\n\nbool CartoCSSParser::parseSymbolizerBlock(CartoCSSSymbolizer* currentSymbolizer) {\n  const int cursor = parseSymbolizerBlock(currentSymbolizer, _tokensCursor, _tokensSize);\n  if (cursor < 0) {\n    return false;\n  }\n  _tokensCursor = cursor;\n  return true;\n}\n\n\nCartoCSSResult* CartoCSSParser::document() {\n  \/\/ selectors:\n  \/\/\n  \/\/  \/* All layers *\/\n  \/\/  * {}\n  \/\/  \/* layers with class \"red\" *\/\n  \/\/  .red {}\n  \/\/  \/* layers with class blue beyond zoom 8 *\/\n  \/\/  .blue[zoom > 8] {}\n  \/\/  \/* features in #countries with NAME 'USA' *\/\n  \/\/ #countries[NAME='USA']\n\n  \/\/ [condition]\n  \/\/ [zoom > 1]  --> zoom is tile's level\n  \/\/ #layerName\n  \/\/ #layerName::symbolizerName\n  \/\/ #layerName[condition]\n  \/\/ #layerName[field=5]\n  \/\/ #layerName[field>5]\n  \/\/ [condition]\n  \/\/ .class\n\n  \/\/ #earthquakes {\n  \/\/   [Magnitude >= 2.5] { marker-width:6; }\n  \/\/   [Magnitude >= 3]   { marker-width:8; }\n  \/\/   [Magnitude >= 3.5] { marker-width:10; }\n  \/\/   [Magnitude >= 4]   { marker-width:12; }\n  \/\/   [Magnitude >= 4.5] { marker-width:14; }\n  \/\/   [Magnitude >= 5]   { marker-width:16; }\n  \/\/   [Magnitude >= 5.5] { marker-width:18; }\n  \/\/   [Magnitude >= 6]   { marker-width:20; }\n  \/\/ }\n\n  CartoCSSSymbolizer* rootSymbolizer = new CartoCSSSymbolizer();\n  CartoCSSResult* result = new CartoCSSResult(rootSymbolizer);\n\n  while (_tokensCursor < _tokensSize) {\n    if (!parseVariableDeclaration(rootSymbolizer) &&\n        !parseSymbolizerBlock(rootSymbolizer)) {\n      result->addError(CartoCSSError(\"Sintax error\", _tokens[_tokensCursor]->_position));\n      break;\n    }\n  }\n  \n  return result;\n}\n<commit_msg>Advances in CartoCSS parsing, not usable yet<commit_after>\/\/\n\/\/  CartoCSSParser.cpp\n\/\/  G3MiOSSDK\n\/\/\n\/\/  Created by Diego Gomez Deck on 9\/16\/13.\n\/\/\n\/\/\n\n#include \"CartoCSSParser.hpp\"\n\n#include \"IByteBuffer.hpp\"\n#include \"IStringUtils.hpp\"\n#include \"CartoCSSLexer.hpp\"\n#include <map>\n\n\nCartoCSSParser::CartoCSSParser(const std::string& source) :\n_tokens(CartoCSSLexer::tokenize(source)),\n_tokensSize(_tokens.size()),\n_tokensCursor(0)\n{\n  _variableDefinitionTokensType.push_back(STRING);\n  _variableDefinitionTokensType.push_back(COLON);\n  _variableDefinitionTokensType.push_back(STRING);\n  _variableDefinitionTokensType.push_back(SEMICOLON);\n}\n\nCartoCSSResult* CartoCSSParser::parse(const IByteBuffer* css) {\n  return parse(css->getAsString());\n}\n\nCartoCSSResult* CartoCSSParser::parse(const std::string& css) {\n  CartoCSSParser parser(css);\n  return parser.pvtParse();\n}\n\nCartoCSSResult* CartoCSSParser::pvtParse() {\n  CartoCSSResult* result = document();\n\n  if (_tokensCursor < _tokensSize) {\n    result->addError(CartoCSSError(\"End of CartoCSS expected\", _tokens[_tokensCursor]->_position));\n  }\n\n  for (int i = 0; i < _tokensSize; i++) {\n    const CartoCSSToken* token = _tokens[i];\n    delete token;\n  }\n\n  return result;\n}\n\nbool CartoCSSParser::lookAhead(const std::vector<CartoCSSTokenType>& expectedTokensType,\n                               int from,\n                               int to) const {\n  const int expectedTokensTypeSize = expectedTokensType.size();\n  const int lastCursor = from + expectedTokensTypeSize;\n  if (lastCursor > to) {\n    return false;\n  }\n\n  for (int i = 0; i < expectedTokensTypeSize; i++) {\n    const CartoCSSTokenType expectedTokenType = expectedTokensType[i];\n    const CartoCSSToken* token = _tokens[from + i];\n    if (token->_type != expectedTokenType) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\nbool CartoCSSParser::parseVariableDeclaration(CartoCSSSymbolizer* currentSymbolizer) {\n  if ( !lookAhead(_variableDefinitionTokensType) ) {\n    return false;\n  }\n\n  const std::string variableName  = ((const StringCartoCSSToken*) _tokens[_tokensCursor])->str();\n\n  if (variableName[0] != '@') {\n    return false;\n  }\n\n  const std::string variableValue = ((const StringCartoCSSToken*) _tokens[_tokensCursor + 2])->str();\n\n  currentSymbolizer->setVariableDeclaration(variableName, variableValue);\n\n\/\/  ILogger::instance()->logInfo(\"Found variable \\\"%s\\\"=\\\"%s\\\"\",\n\/\/                               variableName.c_str(),\n\/\/                               variableValue.c_str());\n\n  _tokensCursor += _variableDefinitionTokensType.size();\n  return true;\n}\n\nint CartoCSSParser::lookAheadManyOf(const CartoCSSTokenType alternative1,\n                                    const CartoCSSTokenType alternative2,\n                                    int from,\n                                    int to) const {\n  if (from < to-1) {\n    const CartoCSSTokenType firstType = _tokens[from]->_type;\n    if ((firstType != alternative1) &&\n        (firstType != alternative2)) {\n      return -1;\n    }\n\n    for (int i = from+1; i < to; i++) {\n      const CartoCSSTokenType type = _tokens[i]->_type;\n      if ((type != alternative1) &&\n          (type != alternative2)) {\n        return i-1;\n      }\n    }\n  }\n\n  return -1;\n}\n\nint CartoCSSParser::lookAheadBalancedBraces(int from,\n                                            int to) const {\n  if (from < to) {\n    if (_tokens[from]->_type == OPEN_BRACE) {\n      int openedCount = 1;\n      for (int i = from+1; i < _tokensSize; i++) {\n        const CartoCSSTokenType type = _tokens[i]->_type;\n        if (type == OPEN_BRACE) {\n          openedCount++;\n        }\n        else if (type == CLOSE_BRACE) {\n          openedCount--;\n          if (openedCount <= 0) {\n            return i;\n          }\n        }\n      }\n    }\n  }\n  return -1;\n}\n\nint CartoCSSParser::parseSymbolizerBlock(CartoCSSSymbolizer* currentSymbolizer,\n                                         int from,\n                                         int to) const {\n  const int lasSelectorCursor = lookAheadManyOf(STRING, EXPRESION, from, to);\n  if (lasSelectorCursor < 0) {\n    return -1;\n  }\n\n  const int lastCloseBracePosition = lookAheadBalancedBraces(lasSelectorCursor + 1, to);\n  if (lastCloseBracePosition <= 0) {\n    return -1;\n  }\n\n  std::vector<std::string> selectors;\n  for (int i = from; i <= lasSelectorCursor; i++) {\n    const CartoCSSToken* token = _tokens[i];\n    const CartoCSSTokenType type = token->_type;\n    switch (type) {\n      case STRING: {\n        const StringCartoCSSToken* stringToken = (const StringCartoCSSToken*) token;\n        selectors.push_back( stringToken->str() );\n        \/\/ILogger::instance()->logInfo(\"\\\"%s\\\"\", stringToken->str().c_str());\n        int _DGD_At_Work1;\n        break;\n      }\n\n      case EXPRESION: {\n        const ExpressionCartoCSSToken* expressionToken = (const ExpressionCartoCSSToken*) token;\n        selectors.push_back( \"[\" + expressionToken->_source + \"]\");\n        \/\/ILogger::instance()->logInfo(\"[%s]\", expressionToken->_source.c_str());\n        int _DGD_At_Work2;\n        break;\n      }\n\n      default: {\n        ILogger::instance()->logError(\"CartoCSSParser: Logic error (1)\");\n        return -1;\n      }\n    }\n  }\n\n  CartoCSSSymbolizer* newSymbolizer = new CartoCSSSymbolizer(selectors);\n  currentSymbolizer->addSymbolizer(newSymbolizer);\n\n  int newCursor;\n  int cursor = lasSelectorCursor+2;\n  while (cursor < lastCloseBracePosition) {\n    if (lookAhead(_variableDefinitionTokensType, cursor, lastCloseBracePosition)) {\n      const std::string variableName  = ((const StringCartoCSSToken*) _tokens[cursor])->str();\n      const std::string variableValue = ((const StringCartoCSSToken*) _tokens[cursor + 2])->str();\n\n      newSymbolizer->setProperty(variableName, variableValue);\n      \/\/ILogger::instance()->logInfo(\"    %s=%s\", variableName.c_str(), variableValue.c_str());\n\n      cursor += _variableDefinitionTokensType.size();\n      continue;\n    }\n\n    if ( (newCursor = parseSymbolizerBlock(newSymbolizer, cursor, lastCloseBracePosition)) >= 0 ) {\n      cursor = newCursor;\n      continue;\n    }\n\n    ILogger::instance()->logInfo(\"****%s\", _tokens[cursor]->description().c_str());\n    int _DGD_At_Work4;\n    cursor++;\n  }\n\n  return lastCloseBracePosition+1;\n}\n\nbool CartoCSSParser::parseSymbolizerBlock(CartoCSSSymbolizer* currentSymbolizer) {\n  const int cursor = parseSymbolizerBlock(currentSymbolizer, _tokensCursor, _tokensSize);\n  if (cursor < 0) {\n    return false;\n  }\n  _tokensCursor = cursor;\n  return true;\n}\n\n\nCartoCSSResult* CartoCSSParser::document() {\n  \/\/ selectors:\n  \/\/\n  \/\/  \/* All layers *\/\n  \/\/  * {}\n  \/\/  \/* layers with class \"red\" *\/\n  \/\/  .red {}\n  \/\/  \/* layers with class blue beyond zoom 8 *\/\n  \/\/  .blue[zoom > 8] {}\n  \/\/  \/* features in #countries with NAME 'USA' *\/\n  \/\/ #countries[NAME='USA']\n\n  \/\/ [condition]\n  \/\/ [zoom > 1]  --> zoom is tile's level\n  \/\/ #layerName\n  \/\/ #layerName::symbolizerName\n  \/\/ #layerName[condition]\n  \/\/ #layerName[field=5]\n  \/\/ #layerName[field>5]\n  \/\/ [condition]\n  \/\/ .class\n\n  \/\/ #earthquakes {\n  \/\/   [Magnitude >= 2.5] { marker-width:6; }\n  \/\/   [Magnitude >= 3]   { marker-width:8; }\n  \/\/   [Magnitude >= 3.5] { marker-width:10; }\n  \/\/   [Magnitude >= 4]   { marker-width:12; }\n  \/\/   [Magnitude >= 4.5] { marker-width:14; }\n  \/\/   [Magnitude >= 5]   { marker-width:16; }\n  \/\/   [Magnitude >= 5.5] { marker-width:18; }\n  \/\/   [Magnitude >= 6]   { marker-width:20; }\n  \/\/ }\n\n  CartoCSSSymbolizer* rootSymbolizer = new CartoCSSSymbolizer();\n  CartoCSSResult* result = new CartoCSSResult(rootSymbolizer);\n\n  while (_tokensCursor < _tokensSize) {\n    if (!parseVariableDeclaration(rootSymbolizer) &&\n        !parseSymbolizerBlock(rootSymbolizer)) {\n      result->addError(CartoCSSError(\"Sintax error\", _tokens[_tokensCursor]->_position));\n      break;\n    }\n  }\n  \n  return result;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ This file is distributed under the MIT license.\n\/\/ See the LICENSE file for details.\n\n#include <cassert>\n\n#include <algorithm>\n#include <array>\n#include <cstring>\n#include <limits>\n#include <utility>\n\n#ifndef NDEBUG\n#include <iostream>\n#include <ostream>\n#endif\n\n#include \"aligned_vector.h\"\n#include \"stack.h\"\n\nnamespace visionaray\n{\nnamespace detail\n{\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ create an empty bounding box (min is positive, max is negative)\n\/\/\n\naabb empty_box()\n{\n    return aabb( vec3(std::numeric_limits<float>::max()), -vec3(std::numeric_limits<float>::max()) );\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ aabb of a single triangle\n\/\/\n\naabb bounds(basic_triangle<3, float> const& tri)\n{\n    auto v1 = tri.v1;\n    \/\/ TODO\n    auto v2 = tri.v1 + tri.e1;\n    auto v3 = tri.v1 + tri.e2;\n\n    return aabb\n    (\n        vec3\n        (\n            min(v1.x, min(v2.x, v3.x) ),\n            min(v1.y, min(v2.y, v3.y) ),\n            min(v1.z, min(v2.z, v3.z) )\n        ),\n        vec3\n        (\n            max(v1.x, max(v2.x, v3.x) ),\n            max(v1.y, max(v2.y, v3.y) ),\n            max(v1.z, max(v2.z, v3.z) )\n        )\n    );\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ aabb of a list of aabbs\n\/\/\n\naabb bounds(std::vector<aabb> const& boxes)\n{\n    auto result = empty_box();\n\n    for (auto const& b : boxes)\n    {\n        result.min = min( b.min, min(b.max, result.min) );\n        result.max = max( b.min, max(b.max, result.max) );\n    }\n\n    return result;\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ aabb of points\n\/\/\n\naabb bounds(std::vector<vec3> const& points)\n{\n    auto result = empty_box();\n\n    for (auto const& p : points)\n    {\n        result.min = min( p, result.min );\n        result.max = max( p, result.max );\n    }\n\n    return result;\n}\n\naabb bounds(vec3 const* begin, vec3 const* end)\n{\n    typedef vec3 const* point_iterator;\n\n    auto result = empty_box();\n\n    for (point_iterator it = begin; it != end; ++it)\n    {\n        result.min = min( *it, result.min );\n        result.max = max( *it, result.max );\n    }\n\n    return result;\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ get the cartesian coordinate of the widest side of an aabb\n\/\/\n\ncartesian_axis<3> widest_side(aabb const& box)\n{\n    auto s = box.size();\n    if (s.x > s.y && s.x > s.z)\n    {\n        return cartesian_axis<3>::X;\n    }\n    else if (s.y > s.x && s.y > s.z)\n    {\n        return cartesian_axis<3>::Y;\n    }\n    else\n    {\n        return cartesian_axis<3>::Z;\n    }\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ surface area of a bounding box\n\/\/\n\nfloat area(aabb const& box)\n{\n    auto s = box.size();\n    return float(2.0) * (s.x * s.y + s.y * s.z + s.z * s.x);\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ volume of a bounding box\n\/\/\n\nfloat volume(aabb const& box)\n{\n    auto s = box.size();\n    return s.x * s.y * s.z;\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ calc bin id of primitive\n\/\/\n\nunsigned bin_id(vec3 const& centroid, cartesian_axis<3> const& axis, float k0, float k1)\n{\n    return k1 * (centroid[axis] - k0);\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ Data for building a BVH that is associated with a single primitive\n\nstruct prim_data\n{\n    unsigned idx;\n    aabb bbox;\n    vec3 centroid;\n};\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/\n\/\/\n\ntemplate <typename BvhType, typename P>\nvoid finalize_build(BvhType& b, prim_data const* ptr, P const* primitives, size_t num_prims, index_bvh_tag)\n{\n    VSNRAY_UNUSED(primitives);\n\n    for (size_t i = 0; i < num_prims; ++i)\n    {\n        b.indices()[i] = ptr[i].idx;\n    }\n}\n\ntemplate <typename BvhType, typename P>\nvoid finalize_build(BvhType& b, prim_data const* ptr, P const* primitives, size_t num_prims, bvh_tag)\n{\n    for (size_t i = 0; i < num_prims; ++i)\n    {\n        b.primitives()[i] = primitives[ptr[i].idx];\n    }\n}\n\n\ntemplate <typename B, typename P>\nB build(P* primitives, size_t num_prims)\n{\n\n    B result(primitives, num_prims);\n\n    aligned_vector<prim_data, 64> data(num_prims);\n\n    \/\/ circumvent potentially slow operator[] of STL containers\n    auto ptr = data.data();\n\n    aabb bbox = empty_box();\n    for (size_t i = 0; i < num_prims; ++i)\n    {\n        auto p          = primitives[i];\n        ptr[i].idx      = static_cast<unsigned>(i);\n        ptr[i].bbox     = bounds(p);\n        ptr[i].centroid = ptr[i].bbox.center();\n        bbox            = combine( bbox, ptr[i].bbox );\n    }\n\n    \/\/ index into bvh's preallocated node list\n    unsigned current_idx = 0;\n\n    \/\/ support only MAX_UINT primitives per bvh\n    assert( (num_prims & std::numeric_limits<unsigned>::max()) == num_prims );\n\n    bvh_node root;\n    root.bbox       = bbox;\n    root.first_prim = 0;\n    root.num_prims  = static_cast<unsigned>(num_prims);\n    result.nodes()[current_idx] = root;\n    unsigned node_stack_ptr = 1;\n\n    stack<64> st;\n\n    auto node = root;\n\n    for (;;)\n    {\n        auto cb = node.bbox;\n        auto axis = widest_side(cb);\n        auto first_prim = node.first_prim;\n        auto num_prims  = node.num_prims;\n        auto prim_begin = first_prim;\n        auto prim_end   = first_prim + num_prims;\n\n        \/\/ costs for making a leaf (area(cb) is disregarded during binning and must\n        \/\/ thus be minded for the primitive costs)\n        float leaf_costs = \/* constant factor for prim isect * *\/ num_prims * area(cb);\n\n        static const size_t NumBins = 16;\n\n        std::array<aabb,     NumBins> bin_bounds;\n        std::array<unsigned, NumBins> bin_counts;\n        for (size_t i = 0; i < NumBins; ++i)\n        {\n            bin_bounds[i] = empty_box();\n            bin_counts[i] = 0;\n        }\n\n        float k0 = cb.min[axis];\n        float k1 = (NumBins * (1 - std::numeric_limits<float>::epsilon())) \/ (cb.max[axis] - cb.min[axis]);\n        for (auto i = prim_begin; i < prim_end; ++i)\n        {\n            auto const& b = ptr[i].bbox;\n            auto bi = bin_id(ptr[i].centroid, axis, k0, k1);\n            if (bi == NumBins)\n            {\n                bi = NumBins - 1;\n            }\n            if (bi > NumBins) { bi = 0; }\n            bin_bounds[bi] = combine(bin_bounds[bi], b);\n            bin_counts[bi]++;\n        }\n\n        \/\/ pass from the left: accumulate bounds and counts\n        std::array<aabb,     NumBins> acc_bounds_l;\n        std::array<unsigned, NumBins> acc_counts_l;\n\n        acc_bounds_l[0] = bin_bounds[0];\n        acc_counts_l[0] = bin_counts[0];\n\n        for (size_t i = 1; i < NumBins; ++i)\n        {\n            acc_bounds_l[i] = combine(acc_bounds_l[i - 1], bin_bounds[i]);\n            acc_counts_l[i] = acc_counts_l[i - 1] + bin_counts[i];\n        }\n\n        \/\/ pass from the right: no need to store accumulated values\n\n        aabb   acc_bounds_r   = bin_bounds[NumBins - 1];\n        unsigned acc_counts_r = bin_counts[NumBins - 1];\n        std::array<float, NumBins - 1> costs;\n\n        float min_costs = std::numeric_limits<float>::max();\n        aabb best_l = empty_box();\n        aabb best_r = empty_box();\n        unsigned split_plane = std::numeric_limits<unsigned>::max(); \/\/ in [0..NumBins)\n        unsigned count_l = 0;\n\n        for (size_t i = NumBins - 2; static_cast<int>(i) >= 0; --i)\n        {\n            costs[i] = area(acc_bounds_l[i]) * acc_counts_l[i] + area(acc_bounds_r) * acc_counts_r;\n\n            float c = max( 0.0f, min(min_costs, costs[i]) );\n            if (c > float(0.0) && c < min_costs)\n            {\n                min_costs   = c;\n                best_l      = acc_bounds_l[i];\n                best_r      = acc_bounds_r;\n                split_plane = static_cast<unsigned>(i);\n                count_l     = acc_counts_l[i];\n            }\n\n            acc_bounds_r = combine(acc_bounds_r, bin_bounds[i]);\n            acc_counts_r += bin_counts[i];\n        }\n\n        if (min_costs < leaf_costs && num_prims > 4 && volume(best_l) > float(0.0) && volume(best_r) > float(0.0))\n        {\n            \/\/ two new nodes\n            bvh_node left;\n            left.bbox        = best_l;\n            left.first_prim  = first_prim;\n            left.num_prims   = count_l;\n\n            bvh_node right;\n            right.bbox       = best_r;\n            right.first_prim = first_prim + count_l;\n            right.num_prims  = num_prims - count_l;\n\n            \/\/ partition primitive ids\n            std::partition\n            (\n                 &ptr[prim_begin], &ptr[prim_end],\n                 [&](prim_data const& pd)\n                 {\n                    return bin_id(pd.centroid, axis, k0, k1) <= split_plane;\n                 }\n            );\n\n            \/\/ make current node an inner node\n            bvh_node& current_node = result.nodes()[current_idx];\n            current_node.first_child = node_stack_ptr;\n            current_node.num_prims = 0;\n\n            \/\/ store new nodes\n            result.nodes()[node_stack_ptr]     = left;\n            result.nodes()[node_stack_ptr + 1] = right;\n\n            node = left;\n            st.push(node_stack_ptr + 1);\n\n            current_idx = node_stack_ptr;\n            node_stack_ptr += 2;\n        }\n        else\n        {\n            if (st.empty())\n            {\n                break;\n            }\n            else\n            {\n                current_idx = st.pop();\n                node = result.nodes()[current_idx];\n            }\n        }\n    }\n\n    finalize_build(result, ptr, primitives, num_prims, typename B::tag_type());\n\n    return result;\n\n}\n\n} \/\/ detail\n\ntemplate <typename BvhType, typename P>\nBvhType build(P* primitives, size_t num_prims)\n{\n    return detail::build<BvhType>(primitives, num_prims);\n}\n\n} \/\/ visionaray\n\n\n<commit_msg>Better support for inhomogeneous models<commit_after>\/\/ This file is distributed under the MIT license.\n\/\/ See the LICENSE file for details.\n\n#include <cassert>\n\n#include <algorithm>\n#include <array>\n#include <cstring>\n#include <limits>\n#include <utility>\n\n#ifndef NDEBUG\n#include <iostream>\n#include <ostream>\n#endif\n\n#include \"aligned_vector.h\"\n#include \"stack.h\"\n\nnamespace visionaray\n{\nnamespace detail\n{\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ create an empty bounding box (min is positive, max is negative)\n\/\/\n\naabb empty_box()\n{\n    return aabb( vec3(std::numeric_limits<float>::max()), -vec3(std::numeric_limits<float>::max()) );\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ aabb of a single triangle\n\/\/\n\naabb bounds(basic_triangle<3, float> const& tri)\n{\n    auto v1 = tri.v1;\n    \/\/ TODO\n    auto v2 = tri.v1 + tri.e1;\n    auto v3 = tri.v1 + tri.e2;\n\n    return aabb\n    (\n        vec3\n        (\n            min(v1.x, min(v2.x, v3.x) ),\n            min(v1.y, min(v2.y, v3.y) ),\n            min(v1.z, min(v2.z, v3.z) )\n        ),\n        vec3\n        (\n            max(v1.x, max(v2.x, v3.x) ),\n            max(v1.y, max(v2.y, v3.y) ),\n            max(v1.z, max(v2.z, v3.z) )\n        )\n    );\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ aabb of a list of aabbs\n\/\/\n\naabb bounds(std::vector<aabb> const& boxes)\n{\n    auto result = empty_box();\n\n    for (auto const& b : boxes)\n    {\n        result.min = min( b.min, min(b.max, result.min) );\n        result.max = max( b.min, max(b.max, result.max) );\n    }\n\n    return result;\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ aabb of points\n\/\/\n\naabb bounds(std::vector<vec3> const& points)\n{\n    auto result = empty_box();\n\n    for (auto const& p : points)\n    {\n        result.min = min( p, result.min );\n        result.max = max( p, result.max );\n    }\n\n    return result;\n}\n\naabb bounds(vec3 const* begin, vec3 const* end)\n{\n    typedef vec3 const* point_iterator;\n\n    auto result = empty_box();\n\n    for (point_iterator it = begin; it != end; ++it)\n    {\n        result.min = min( *it, result.min );\n        result.max = max( *it, result.max );\n    }\n\n    return result;\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ get the cartesian coordinate of the widest side of an aabb\n\/\/\n\ncartesian_axis<3> widest_side(aabb const& box)\n{\n    auto s = box.size();\n    if (s.x > s.y && s.x > s.z)\n    {\n        return cartesian_axis<3>::X;\n    }\n    else if (s.y > s.x && s.y > s.z)\n    {\n        return cartesian_axis<3>::Y;\n    }\n    else\n    {\n        return cartesian_axis<3>::Z;\n    }\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ surface area of a bounding box\n\/\/\n\nfloat area(aabb const& box)\n{\n    auto s = box.size();\n    return float(2.0) * (s.x * s.y + s.y * s.z + s.z * s.x);\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ volume of a bounding box\n\/\/\n\nfloat volume(aabb const& box)\n{\n    auto s = box.size();\n    return s.x * s.y * s.z;\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ calc bin id of primitive\n\/\/\n\nunsigned bin_id(vec3 const& centroid, cartesian_axis<3> const& axis, float k0, float k1)\n{\n    return k1 * (centroid[axis] - k0);\n}\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ Data for building a BVH that is associated with a single primitive\n\nstruct prim_data\n{\n    unsigned idx;\n    aabb bbox;\n    vec3 centroid;\n};\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/\n\/\/\n\ntemplate <typename BvhType, typename P>\nvoid finalize_build(BvhType& b, prim_data const* ptr, P const* primitives, size_t num_prims, index_bvh_tag)\n{\n    VSNRAY_UNUSED(primitives);\n\n    for (size_t i = 0; i < num_prims; ++i)\n    {\n        b.indices()[i] = ptr[i].idx;\n    }\n}\n\ntemplate <typename BvhType, typename P>\nvoid finalize_build(BvhType& b, prim_data const* ptr, P const* primitives, size_t num_prims, bvh_tag)\n{\n    VSNRAY_UNUSED(num_prims); \/\/ TODO: check if indexed-finalize can make do w\/o num_prims too!\n\n    for (size_t i = 0; i < b.primitives().size(); ++i)\n    {\n        b.primitives()[i] = primitives[ptr[i].idx];\n    }\n}\n\n\ntemplate <typename B, typename P>\nB build(P* primitives, size_t num_prims)\n{\n\n    B result(primitives, num_prims);\n\n    aligned_vector<prim_data, 64> data(num_prims);\n\n    \/\/ circumvent potentially slow operator[] of STL containers\n    auto ptr = data.data();\n\n    aabb bbox = empty_box();\n    for (size_t i = 0; i < num_prims; ++i)\n    {\n        auto p          = primitives[i];\n        ptr[i].idx      = static_cast<unsigned>(i);\n        ptr[i].bbox     = bounds(p);\n        ptr[i].centroid = ptr[i].bbox.center();\n        bbox            = combine( bbox, ptr[i].bbox );\n    }\n\n#if 1\n    vec3 avg_size;\n    for (size_t i = 0; i < num_prims; ++i)\n    {\n        avg_size += ptr[i].bbox.size();\n    }\n    avg_size \/= vec3(num_prims);\n\n    aligned_vector<prim_data, 64> data_new;\n    for (size_t i = 0; i < num_prims; ++i)\n    {\n        auto size = ptr[i].bbox.size();\n\n        \/\/ calc num subdivisions\n        unsigned num_x = size.x > avg_size.x ? static_cast<unsigned>(size.x \/ avg_size.x) : 1;\n        unsigned num_y = size.y > avg_size.y ? static_cast<unsigned>(size.y \/ avg_size.y) : 1;\n        unsigned num_z = size.z > avg_size.z ? static_cast<unsigned>(size.z \/ avg_size.z) : 1;\n\n        float w = size.x \/ num_x;\n        float h = size.y \/ num_y;\n        float d = size.z \/ num_z;\n\n        auto min = ptr[i].bbox.min;\n\n        for (unsigned z = 0; z < num_z; ++z)\n        {\n            min.y = ptr[i].bbox.min.y;\n            for (unsigned y = 0; y < num_y; ++y)\n            {\n                min.x = ptr[i].bbox.min.x;\n                for (unsigned x = 0; x < num_x; ++x)\n                {\n                    prim_data pd;\n                    pd.idx = static_cast<unsigned>(i);\n                    pd.bbox = aabb( min, min + vec3(w, h, d) );\n                    pd.centroid = pd.bbox.center();\n                    data_new.push_back(pd);\n\n                    min.x += w;\n                }\n                min.y += h;\n            }\n            min.z += d;\n        }\n    }\n\n    data = data_new;\n    num_prims = data_new.size();\n    ptr = data.data();\n    result = B(primitives, num_prims);\n#endif\n\n    \/\/ index into bvh's preallocated node list\n    unsigned current_idx = 0;\n\n    \/\/ support only MAX_UINT primitives per bvh\n    assert( (num_prims & std::numeric_limits<unsigned>::max()) == num_prims );\n\n    bvh_node root;\n    root.bbox       = bbox;\n    root.first_prim = 0;\n    root.num_prims  = static_cast<unsigned>(data.size());\n    result.nodes()[current_idx] = root;\n    unsigned node_stack_ptr = 1;\n\n    stack<64> st;\n\n    auto node = root;\n\n    for (;;)\n    {\n        auto cb = node.bbox;\n        auto axis = widest_side(cb);\n        auto first_prim = node.first_prim;\n        auto num_prims  = node.num_prims;\n        auto prim_begin = first_prim;\n        auto prim_end   = first_prim + num_prims;\n\n        \/\/ costs for making a leaf (area(cb) is disregarded during binning and must\n        \/\/ thus be minded for the primitive costs)\n        float leaf_costs = \/* constant factor for prim isect * *\/ num_prims * area(cb);\n\n        static const size_t NumBins = 16;\n\n        std::array<aabb,     NumBins> bin_bounds;\n        std::array<unsigned, NumBins> bin_counts;\n        for (size_t i = 0; i < NumBins; ++i)\n        {\n            bin_bounds[i] = empty_box();\n            bin_counts[i] = 0;\n        }\n\n        float k0 = cb.min[axis];\n        float k1 = (NumBins * (1 - std::numeric_limits<float>::epsilon())) \/ (cb.max[axis] - cb.min[axis]);\n        for (auto i = prim_begin; i < prim_end; ++i)\n        {\n            auto const& b = ptr[i].bbox;\n            auto bi = bin_id(ptr[i].centroid, axis, k0, k1);\n            if (bi == NumBins)\n            {\n                bi = NumBins - 1;\n            }\n            if (bi > NumBins) { bi = 0; }\n            bin_bounds[bi] = combine(bin_bounds[bi], b);\n            bin_counts[bi]++;\n        }\n\n        \/\/ pass from the left: accumulate bounds and counts\n        std::array<aabb,     NumBins> acc_bounds_l;\n        std::array<unsigned, NumBins> acc_counts_l;\n\n        acc_bounds_l[0] = bin_bounds[0];\n        acc_counts_l[0] = bin_counts[0];\n\n        for (size_t i = 1; i < NumBins; ++i)\n        {\n            acc_bounds_l[i] = combine(acc_bounds_l[i - 1], bin_bounds[i]);\n            acc_counts_l[i] = acc_counts_l[i - 1] + bin_counts[i];\n        }\n\n        \/\/ pass from the right: no need to store accumulated values\n\n        aabb   acc_bounds_r   = bin_bounds[NumBins - 1];\n        unsigned acc_counts_r = bin_counts[NumBins - 1];\n        std::array<float, NumBins - 1> costs;\n\n        float min_costs = std::numeric_limits<float>::max();\n        aabb best_l = empty_box();\n        aabb best_r = empty_box();\n        unsigned split_plane = std::numeric_limits<unsigned>::max(); \/\/ in [0..NumBins)\n        unsigned count_l = 0;\n\n        for (size_t i = NumBins - 2; static_cast<int>(i) >= 0; --i)\n        {\n            costs[i] = area(acc_bounds_l[i]) * acc_counts_l[i] + area(acc_bounds_r) * acc_counts_r;\n\n            float c = max( 0.0f, min(min_costs, costs[i]) );\n            if (c > float(0.0) && c < min_costs)\n            {\n                min_costs   = c;\n                best_l      = acc_bounds_l[i];\n                best_r      = acc_bounds_r;\n                split_plane = static_cast<unsigned>(i);\n                count_l     = acc_counts_l[i];\n            }\n\n            acc_bounds_r = combine(acc_bounds_r, bin_bounds[i]);\n            acc_counts_r += bin_counts[i];\n        }\n\n        if (min_costs < leaf_costs && num_prims > 4 && volume(best_l) > float(0.0) && volume(best_r) > float(0.0))\n        {\n            \/\/ two new nodes\n            bvh_node left;\n            left.bbox        = best_l;\n            left.first_prim  = first_prim;\n            left.num_prims   = count_l;\n\n            bvh_node right;\n            right.bbox       = best_r;\n            right.first_prim = first_prim + count_l;\n            right.num_prims  = num_prims - count_l;\n\n            \/\/ partition primitive ids\n            std::partition\n            (\n                 &ptr[prim_begin], &ptr[prim_end],\n                 [&](prim_data const& pd)\n                 {\n                    return bin_id(pd.centroid, axis, k0, k1) <= split_plane;\n                 }\n            );\n\n            \/\/ make current node an inner node\n            bvh_node& current_node = result.nodes()[current_idx];\n            current_node.first_child = node_stack_ptr;\n            current_node.num_prims = 0;\n\n            \/\/ store new nodes\n            result.nodes()[node_stack_ptr]     = left;\n            result.nodes()[node_stack_ptr + 1] = right;\n\n            node = left;\n            st.push(node_stack_ptr + 1);\n\n            current_idx = node_stack_ptr;\n            node_stack_ptr += 2;\n        }\n        else\n        {\n            if (st.empty())\n            {\n                break;\n            }\n            else\n            {\n                current_idx = st.pop();\n                node = result.nodes()[current_idx];\n            }\n        }\n    }\n\n    finalize_build(result, ptr, primitives, num_prims, typename B::tag_type());\n\n    return result;\n\n}\n\n} \/\/ detail\n\ntemplate <typename BvhType, typename P>\nBvhType build(P* primitives, size_t num_prims)\n{\n    return detail::build<BvhType>(primitives, num_prims);\n}\n\n} \/\/ visionaray\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: apiserviceinfo.cxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: hr $ $Date: 2006-06-19 23:14: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#include \"apiserviceinfo.hxx\"\n\nnamespace configmgr\n{\n\/\/-----------------------------------------------------------------------------\n    namespace configapi\n    {\n\/\/========================================================================\n\/\/= service names\n\/\/========================================================================\n\n\/\/========================================================================\n\/\/= service infos\n\/\/========================================================================\n\n\/\/-- ACCESS (CONTAINER) ROLES -----------------------------\n\n#define CFG_SVCLIST_SETACCESS \\\n    \"com.sun.star.configuration.ConfigurationAccess\",   \\\n    \"com.sun.star.configuration.SetAccess\",             \\\n    \"com.sun.star.configuration.HierarchyAccess\",       \\\n    \"com.sun.star.configuration.SimpleSetAccess\"\n\n#define CFG_SVCLIST_GROUPACCESS \\\n    \"com.sun.star.configuration.ConfigurationAccess\",   \\\n    \"com.sun.star.configuration.GroupAccess\",           \\\n    \"com.sun.star.configuration.HierarchyAccess\",       \\\n    \"com.sun.star.configuration.PropertyHierarchy\"\n\n#define CFG_SVCLIST_SETUPDATE \\\n    \"com.sun.star.configuration.ConfigurationUpdateAccess\", \\\n    \"com.sun.star.configuration.SetUpdate\",                 \\\n    \"com.sun.star.configuration.SimpleSetUpdate\",           \\\n    \"com.sun.star.configuration.ConfigurationContainer\", \/* Obsolete *\/ \\\n    CFG_SVCLIST_SETACCESS\n\n#define CFG_SVCLIST_GROUPUPDATE \\\n    \"com.sun.star.configuration.ConfigurationUpdateAccess\", \\\n    \"com.sun.star.configuration.GroupUpdate\",               \\\n    CFG_SVCLIST_GROUPACCESS\n\n\/\/-- ELEMENT ROLES ----------------------------------------\n\n#define CFG_SVCLIST_SETELEMENT \\\n    \"com.sun.star.configuration.SetElement\",        \\\n    \"com.sun.star.configuration.HierarchyElement\"\n\n#define CFG_SVCLIST_GROUPELEMENT \\\n    \"com.sun.star.configuration.GroupElement\",      \\\n    \"com.sun.star.configuration.HierarchyElement\"\n\n#define CFG_SVCLIST_ACCESSROOTELEMENT \\\n    \"com.sun.star.configuration.AccessRootElement\", \\\n    \"com.sun.star.configuration.HierarchyElement\"\n\n#define CFG_SVCLIST_UPDATEROOTELEMENT \\\n    \"com.sun.star.configuration.UpdateRootElement\", \\\n    CFG_SVCLIST_ACCESSROOTELEMENT\n\n\/\/-----------------------------------------------------------------------------\n\nconst AsciiServiceName c_aNoServices[] =\n{\n    NULL\n};\n\n\/\/-----------------------------------------------------------------------------\n\nconst AsciiServiceName c_aCreateAccessServiceNames[] =\n{\n    \"com.sun.star.configuration.ConfigurationAccess\",\n    \"com.sun.star.configuration.HierarchyAccess\",\n    \"com.sun.star.configuration.HierarchyElement\",\n    NULL\n};\n\nconst AsciiServiceName c_aCreateUpdateServiceNames[] =\n{\n    \"com.sun.star.configuration.ConfigurationUpdateAccess\",\n    \"com.sun.star.configuration.ConfigurationAccess\",\n    \"com.sun.star.configuration.HierarchyAccess\",\n    \"com.sun.star.configuration.HierarchyElement\",\n    NULL\n};\n\n\/\/-----------------------------------------------------------------------------\n\nconst AsciiServiceName c_aUserAdministrationServices[] =\n{\n    \"com.sun.star.configuration.UserAdministration\",\n    \"com.sun.star.configuration.SimpleSetUpdate\",\n    \"com.sun.star.configuration.SimpleSetAccess\",\n    \"com.sun.star.configuration.ConfigurationContainer\", \/\/ Obsolete\n    NULL\n};\n\nconst AsciiServiceName c_aGroupAdministrationServices[] =\n{\n    \"com.sun.star.configuration.GroupAdministration\",\n    \"com.sun.star.configuration.SimpleSetUpdate\",\n    \"com.sun.star.configuration.SimpleSetAccess\",\n    \"com.sun.star.configuration.ConfigurationContainer\", \/\/ Obsolete\n    NULL\n};\n\n\/\/-- ROLE COMBINATIONS ------------------\n\n\/\/-- GroupElements\n\nconst AsciiServiceName c_aInnerGroupAccessServices[] =\n{\n    CFG_SVCLIST_GROUPACCESS,\n    CFG_SVCLIST_GROUPELEMENT,\n    NULL\n};\n\nconst AsciiServiceName c_aInnerGroupUpdateServices[] =\n{\n    CFG_SVCLIST_GROUPUPDATE,\n    CFG_SVCLIST_GROUPELEMENT,\n    NULL\n};\n\nconst AsciiServiceName c_aInnerSetAccessServices[] =\n{\n    CFG_SVCLIST_SETACCESS,\n    CFG_SVCLIST_GROUPELEMENT,\n    NULL\n};\n\nconst AsciiServiceName c_aInnerSetUpdateServices[] =\n{\n    CFG_SVCLIST_SETUPDATE,\n    CFG_SVCLIST_GROUPELEMENT,\n    NULL\n};\n\n\/\/-- SetElements\n\nconst AsciiServiceName c_aSetElementGroupAccessServices[] =\n{\n    CFG_SVCLIST_GROUPACCESS,\n    CFG_SVCLIST_SETELEMENT,\n    NULL\n};\n\nconst AsciiServiceName c_aSetElementGroupUpdateServices[] =\n{\n    CFG_SVCLIST_GROUPUPDATE,\n    CFG_SVCLIST_SETELEMENT,\n    NULL\n};\n\nconst AsciiServiceName c_aSetElementSetAccessServices[] =\n{\n    CFG_SVCLIST_SETACCESS,\n    CFG_SVCLIST_SETELEMENT,\n    NULL\n};\n\nconst AsciiServiceName c_aSetElementSetUpdateServices[] =\n{\n    CFG_SVCLIST_SETUPDATE,\n    CFG_SVCLIST_SETELEMENT,\n    NULL\n};\n\n\/\/-- RootElements\n\nconst AsciiServiceName c_aRootGroupAccessServices[] =\n{\n    CFG_SVCLIST_GROUPACCESS,\n    CFG_SVCLIST_ACCESSROOTELEMENT,\n    NULL\n};\n\nconst AsciiServiceName c_aRootGroupUpdateServices[] =\n{\n    CFG_SVCLIST_GROUPUPDATE,\n    CFG_SVCLIST_UPDATEROOTELEMENT,\n    NULL\n};\n\nconst AsciiServiceName c_aRootSetAccessServices[] =\n{\n    CFG_SVCLIST_SETACCESS,\n    CFG_SVCLIST_ACCESSROOTELEMENT,\n    NULL\n};\n\nconst AsciiServiceName c_aRootSetUpdateServices[] =\n{\n    CFG_SVCLIST_SETUPDATE,\n    CFG_SVCLIST_UPDATEROOTELEMENT,\n    NULL\n};\n\/\/-----------------------------------------------------------------------------\n\nServiceImplementationInfo const aInnerGroupInfoSI =\n{\n    \"com.sun.star.comp.configuration.OInnerGroupInfoAccess\",\n    c_aInnerGroupAccessServices,\n    NULL\n};\nServiceImplementationInfo const aInnerGroupUpdateSI =\n{\n    \"com.sun.star.comp.configuration.OInnerGroupUpdateAccess\",\n    c_aInnerGroupUpdateServices,\n    NULL\n};\nServiceImplementationInfo const aInnerSetInfoSI =\n{\n    \"com.sun.star.comp.configuration.OInnerSetInfoAccess\",\n    c_aInnerSetAccessServices,\n    NULL\n};\nServiceImplementationInfo const aInnerTreeSetSI =\n{\n    \"com.sun.star.comp.configuration.OInnerTreeSetUpdateAccess\",\n    c_aInnerSetUpdateServices,\n    NULL\n};\nServiceImplementationInfo const aInnerValueSetSI =\n{\n    \"com.sun.star.comp.configuration.OInnerValueSetUpdateAccess\",\n    c_aInnerSetUpdateServices,\n    NULL\n};\n\/\/-----------------------------------------------------------------------------\n\nServiceImplementationInfo const aSetElementGroupInfoSI =\n{\n    \"com.sun.star.comp.configuration.OSetElementGroupInfoAccess\",\n    c_aSetElementGroupUpdateServices,\n    NULL\n};\nServiceImplementationInfo const aSetElementGroupUpdateSI =\n{\n    \"com.sun.star.comp.configuration.OSetElementGroupUpdateAccess\",\n    c_aSetElementGroupUpdateServices,\n    NULL\n};\nServiceImplementationInfo const aSetElementSetInfoSI =\n{\n    \"com.sun.star.comp.configuration.OSetElementSetInfoAccess\",\n    c_aSetElementSetAccessServices,\n    NULL\n};\nServiceImplementationInfo const aSetElementTreeSetSI =\n{\n    \"com.sun.star.comp.configuration.OSetElementTreeSetUpdateAccess\",\n    c_aSetElementSetUpdateServices,\n    NULL\n};\nServiceImplementationInfo const aSetElementValueSetSI =\n{\n    \"com.sun.star.comp.configuration.OSetElementValueSetUpdateAccess\",\n    c_aSetElementSetUpdateServices,\n    NULL\n};\n\/\/-----------------------------------------------------------------------------\n\nServiceImplementationInfo const aRootElementGroupInfoSI =\n{\n    \"com.sun.star.comp.configuration.ORootElementGroupInfoAccess\",\n    c_aRootGroupAccessServices,\n    NULL\n};\nServiceImplementationInfo const aRootElementGroupUpdateSI =\n{\n    \"com.sun.star.comp.configuration.ORootElementGroupUpdateAccess\",\n    c_aRootGroupUpdateServices,\n    NULL\n};\nServiceImplementationInfo const aRootElementSetInfoSI =\n{\n    \"com.sun.star.comp.configuration.ORootElementSetInfoAccess\",\n    c_aRootSetAccessServices,\n    NULL\n};\nServiceImplementationInfo const aRootElementTreeSetUpdateSI =\n{\n    \"com.sun.star.comp.configuration.ORootElementTreeSetUpdateAccess\",\n    c_aRootSetUpdateServices,\n    NULL\n};\nServiceImplementationInfo const aRootElementValueSetUpdateSI =\n{\n    \"com.sun.star.comp.configuration.ORootElementValueSetUpdateAccess\",\n    c_aRootSetUpdateServices,\n    NULL\n};\n\/\/-----------------------------------------------------------------------------\n\nServiceRegistrationInfo const aCreateReadAccessSI =\n{\n    NULL, \/\/\"com.sun.star.comp.configuration.ORootElementReadAccess\",\n    c_aCreateAccessServiceNames\n};\nServiceRegistrationInfo const aCreateUpdateAccessSI =\n{\n    NULL, \/\/\"com.sun.star.comp.configuration.ORootElementUpdateAccess\",\n    c_aCreateUpdateServiceNames\n};\n\/\/-----------------------------------------------------------------------------\n\n    }\n}\n<commit_msg>INTEGRATION: CWS pchfix02 (1.6.18); FILE MERGED 2006\/09\/01 17:20:21 kaib 1.6.18.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: apiserviceinfo.cxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-16 14:55: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_configmgr.hxx\"\n#include \"apiserviceinfo.hxx\"\n\nnamespace configmgr\n{\n\/\/-----------------------------------------------------------------------------\n    namespace configapi\n    {\n\/\/========================================================================\n\/\/= service names\n\/\/========================================================================\n\n\/\/========================================================================\n\/\/= service infos\n\/\/========================================================================\n\n\/\/-- ACCESS (CONTAINER) ROLES -----------------------------\n\n#define CFG_SVCLIST_SETACCESS \\\n    \"com.sun.star.configuration.ConfigurationAccess\",   \\\n    \"com.sun.star.configuration.SetAccess\",             \\\n    \"com.sun.star.configuration.HierarchyAccess\",       \\\n    \"com.sun.star.configuration.SimpleSetAccess\"\n\n#define CFG_SVCLIST_GROUPACCESS \\\n    \"com.sun.star.configuration.ConfigurationAccess\",   \\\n    \"com.sun.star.configuration.GroupAccess\",           \\\n    \"com.sun.star.configuration.HierarchyAccess\",       \\\n    \"com.sun.star.configuration.PropertyHierarchy\"\n\n#define CFG_SVCLIST_SETUPDATE \\\n    \"com.sun.star.configuration.ConfigurationUpdateAccess\", \\\n    \"com.sun.star.configuration.SetUpdate\",                 \\\n    \"com.sun.star.configuration.SimpleSetUpdate\",           \\\n    \"com.sun.star.configuration.ConfigurationContainer\", \/* Obsolete *\/ \\\n    CFG_SVCLIST_SETACCESS\n\n#define CFG_SVCLIST_GROUPUPDATE \\\n    \"com.sun.star.configuration.ConfigurationUpdateAccess\", \\\n    \"com.sun.star.configuration.GroupUpdate\",               \\\n    CFG_SVCLIST_GROUPACCESS\n\n\/\/-- ELEMENT ROLES ----------------------------------------\n\n#define CFG_SVCLIST_SETELEMENT \\\n    \"com.sun.star.configuration.SetElement\",        \\\n    \"com.sun.star.configuration.HierarchyElement\"\n\n#define CFG_SVCLIST_GROUPELEMENT \\\n    \"com.sun.star.configuration.GroupElement\",      \\\n    \"com.sun.star.configuration.HierarchyElement\"\n\n#define CFG_SVCLIST_ACCESSROOTELEMENT \\\n    \"com.sun.star.configuration.AccessRootElement\", \\\n    \"com.sun.star.configuration.HierarchyElement\"\n\n#define CFG_SVCLIST_UPDATEROOTELEMENT \\\n    \"com.sun.star.configuration.UpdateRootElement\", \\\n    CFG_SVCLIST_ACCESSROOTELEMENT\n\n\/\/-----------------------------------------------------------------------------\n\nconst AsciiServiceName c_aNoServices[] =\n{\n    NULL\n};\n\n\/\/-----------------------------------------------------------------------------\n\nconst AsciiServiceName c_aCreateAccessServiceNames[] =\n{\n    \"com.sun.star.configuration.ConfigurationAccess\",\n    \"com.sun.star.configuration.HierarchyAccess\",\n    \"com.sun.star.configuration.HierarchyElement\",\n    NULL\n};\n\nconst AsciiServiceName c_aCreateUpdateServiceNames[] =\n{\n    \"com.sun.star.configuration.ConfigurationUpdateAccess\",\n    \"com.sun.star.configuration.ConfigurationAccess\",\n    \"com.sun.star.configuration.HierarchyAccess\",\n    \"com.sun.star.configuration.HierarchyElement\",\n    NULL\n};\n\n\/\/-----------------------------------------------------------------------------\n\nconst AsciiServiceName c_aUserAdministrationServices[] =\n{\n    \"com.sun.star.configuration.UserAdministration\",\n    \"com.sun.star.configuration.SimpleSetUpdate\",\n    \"com.sun.star.configuration.SimpleSetAccess\",\n    \"com.sun.star.configuration.ConfigurationContainer\", \/\/ Obsolete\n    NULL\n};\n\nconst AsciiServiceName c_aGroupAdministrationServices[] =\n{\n    \"com.sun.star.configuration.GroupAdministration\",\n    \"com.sun.star.configuration.SimpleSetUpdate\",\n    \"com.sun.star.configuration.SimpleSetAccess\",\n    \"com.sun.star.configuration.ConfigurationContainer\", \/\/ Obsolete\n    NULL\n};\n\n\/\/-- ROLE COMBINATIONS ------------------\n\n\/\/-- GroupElements\n\nconst AsciiServiceName c_aInnerGroupAccessServices[] =\n{\n    CFG_SVCLIST_GROUPACCESS,\n    CFG_SVCLIST_GROUPELEMENT,\n    NULL\n};\n\nconst AsciiServiceName c_aInnerGroupUpdateServices[] =\n{\n    CFG_SVCLIST_GROUPUPDATE,\n    CFG_SVCLIST_GROUPELEMENT,\n    NULL\n};\n\nconst AsciiServiceName c_aInnerSetAccessServices[] =\n{\n    CFG_SVCLIST_SETACCESS,\n    CFG_SVCLIST_GROUPELEMENT,\n    NULL\n};\n\nconst AsciiServiceName c_aInnerSetUpdateServices[] =\n{\n    CFG_SVCLIST_SETUPDATE,\n    CFG_SVCLIST_GROUPELEMENT,\n    NULL\n};\n\n\/\/-- SetElements\n\nconst AsciiServiceName c_aSetElementGroupAccessServices[] =\n{\n    CFG_SVCLIST_GROUPACCESS,\n    CFG_SVCLIST_SETELEMENT,\n    NULL\n};\n\nconst AsciiServiceName c_aSetElementGroupUpdateServices[] =\n{\n    CFG_SVCLIST_GROUPUPDATE,\n    CFG_SVCLIST_SETELEMENT,\n    NULL\n};\n\nconst AsciiServiceName c_aSetElementSetAccessServices[] =\n{\n    CFG_SVCLIST_SETACCESS,\n    CFG_SVCLIST_SETELEMENT,\n    NULL\n};\n\nconst AsciiServiceName c_aSetElementSetUpdateServices[] =\n{\n    CFG_SVCLIST_SETUPDATE,\n    CFG_SVCLIST_SETELEMENT,\n    NULL\n};\n\n\/\/-- RootElements\n\nconst AsciiServiceName c_aRootGroupAccessServices[] =\n{\n    CFG_SVCLIST_GROUPACCESS,\n    CFG_SVCLIST_ACCESSROOTELEMENT,\n    NULL\n};\n\nconst AsciiServiceName c_aRootGroupUpdateServices[] =\n{\n    CFG_SVCLIST_GROUPUPDATE,\n    CFG_SVCLIST_UPDATEROOTELEMENT,\n    NULL\n};\n\nconst AsciiServiceName c_aRootSetAccessServices[] =\n{\n    CFG_SVCLIST_SETACCESS,\n    CFG_SVCLIST_ACCESSROOTELEMENT,\n    NULL\n};\n\nconst AsciiServiceName c_aRootSetUpdateServices[] =\n{\n    CFG_SVCLIST_SETUPDATE,\n    CFG_SVCLIST_UPDATEROOTELEMENT,\n    NULL\n};\n\/\/-----------------------------------------------------------------------------\n\nServiceImplementationInfo const aInnerGroupInfoSI =\n{\n    \"com.sun.star.comp.configuration.OInnerGroupInfoAccess\",\n    c_aInnerGroupAccessServices,\n    NULL\n};\nServiceImplementationInfo const aInnerGroupUpdateSI =\n{\n    \"com.sun.star.comp.configuration.OInnerGroupUpdateAccess\",\n    c_aInnerGroupUpdateServices,\n    NULL\n};\nServiceImplementationInfo const aInnerSetInfoSI =\n{\n    \"com.sun.star.comp.configuration.OInnerSetInfoAccess\",\n    c_aInnerSetAccessServices,\n    NULL\n};\nServiceImplementationInfo const aInnerTreeSetSI =\n{\n    \"com.sun.star.comp.configuration.OInnerTreeSetUpdateAccess\",\n    c_aInnerSetUpdateServices,\n    NULL\n};\nServiceImplementationInfo const aInnerValueSetSI =\n{\n    \"com.sun.star.comp.configuration.OInnerValueSetUpdateAccess\",\n    c_aInnerSetUpdateServices,\n    NULL\n};\n\/\/-----------------------------------------------------------------------------\n\nServiceImplementationInfo const aSetElementGroupInfoSI =\n{\n    \"com.sun.star.comp.configuration.OSetElementGroupInfoAccess\",\n    c_aSetElementGroupUpdateServices,\n    NULL\n};\nServiceImplementationInfo const aSetElementGroupUpdateSI =\n{\n    \"com.sun.star.comp.configuration.OSetElementGroupUpdateAccess\",\n    c_aSetElementGroupUpdateServices,\n    NULL\n};\nServiceImplementationInfo const aSetElementSetInfoSI =\n{\n    \"com.sun.star.comp.configuration.OSetElementSetInfoAccess\",\n    c_aSetElementSetAccessServices,\n    NULL\n};\nServiceImplementationInfo const aSetElementTreeSetSI =\n{\n    \"com.sun.star.comp.configuration.OSetElementTreeSetUpdateAccess\",\n    c_aSetElementSetUpdateServices,\n    NULL\n};\nServiceImplementationInfo const aSetElementValueSetSI =\n{\n    \"com.sun.star.comp.configuration.OSetElementValueSetUpdateAccess\",\n    c_aSetElementSetUpdateServices,\n    NULL\n};\n\/\/-----------------------------------------------------------------------------\n\nServiceImplementationInfo const aRootElementGroupInfoSI =\n{\n    \"com.sun.star.comp.configuration.ORootElementGroupInfoAccess\",\n    c_aRootGroupAccessServices,\n    NULL\n};\nServiceImplementationInfo const aRootElementGroupUpdateSI =\n{\n    \"com.sun.star.comp.configuration.ORootElementGroupUpdateAccess\",\n    c_aRootGroupUpdateServices,\n    NULL\n};\nServiceImplementationInfo const aRootElementSetInfoSI =\n{\n    \"com.sun.star.comp.configuration.ORootElementSetInfoAccess\",\n    c_aRootSetAccessServices,\n    NULL\n};\nServiceImplementationInfo const aRootElementTreeSetUpdateSI =\n{\n    \"com.sun.star.comp.configuration.ORootElementTreeSetUpdateAccess\",\n    c_aRootSetUpdateServices,\n    NULL\n};\nServiceImplementationInfo const aRootElementValueSetUpdateSI =\n{\n    \"com.sun.star.comp.configuration.ORootElementValueSetUpdateAccess\",\n    c_aRootSetUpdateServices,\n    NULL\n};\n\/\/-----------------------------------------------------------------------------\n\nServiceRegistrationInfo const aCreateReadAccessSI =\n{\n    NULL, \/\/\"com.sun.star.comp.configuration.ORootElementReadAccess\",\n    c_aCreateAccessServiceNames\n};\nServiceRegistrationInfo const aCreateUpdateAccessSI =\n{\n    NULL, \/\/\"com.sun.star.comp.configuration.ORootElementUpdateAccess\",\n    c_aCreateUpdateServiceNames\n};\n\/\/-----------------------------------------------------------------------------\n\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <string>\n#include <list>\n#include \"room.h\"\n#include \"smartplug.h\"\n#include \"user.h\"\n\n\n\nRoom::Room()\n{ \n    this->id = \"\";\n    this->name = \"\";\n    this->listUser = new list<User>();\n    this->listSmartPlug = new list<SmartPlug>(); \n}\n\nRoom::Room(std::string id,std:: string name, std::list<User>listUser, std::list<SmartPlug>listSmartPlug)\n{\n\tthis->idRoom = idRoom;\n\tthis->nameRoom = nameRoom;\n\tthis->listUser = listUser;\n\tthis->listSmartPlug = listSmartPlug;\n}\n\nstd::string Room::getId()\n{\n\treturn this->id;\n}\n\nvoid Room::setId(std::string id)\n{\n\tthis->id = id;\n}\n\nstd::string Room::getName()\n{\n\treturn this->name;\n}\n\nvoid Room::setName(std::string name)\n{\n\tthis->name = name;\n}\n\nstd::list<User> Room::getListUser()\n{\n\treturn this->listUser;\n}\n\nvoid Room::setListUser(std::list<User>listUser)\n{\n\tthis->listUser = listUser;\n}\n\nstd::list<SmartPlug> Room::getSmartPlug()\n{\n\treturn this->listSmartPlug;\n}\n\nvoid Room::setSmartPlug(std::list<SmartPlug>listSmartPlug)\n{\n\tthis->listSmartPlug = listSmartPlug;\n}\n<commit_msg>Delete room.cpp<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"ExampleGame\/Components\/ComponentTypes\/ComponentTypeIds.h\"\n#include \"ExampleGame\/Components\/Decals\/Decal.h\"\n#include \"ExampleGame\/Components\/ShadyCamera\/ShadyCamera.h\"\n#include \"ExampleGame\/GameSingletons\/GameSingletons.h\"\n#include \"ExampleGame\/Messages\/Declarations.h\"\n#include \"Vajra\/Engine\/Components\/DerivedComponents\/Renderer\/SpriteRenderer.h\"\n#include \"Vajra\/Engine\/Components\/DerivedComponents\/Transform\/Transform.h\"\n#include \"Vajra\/Engine\/Core\/Engine.h\"\n#include \"Vajra\/Engine\/SceneGraph\/SceneGraph3D.h\"\n#include \"Vajra\/Engine\/GameObject\/GameObject.h\"\n#include \"Vajra\/Framework\/DeviceUtils\/FileSystemUtils\/FileSystemUtils.h\"\n\nComponentIdType Decal::componentTypeId = COMPONENT_TYPE_ID_DECAL;\n\n#define GAME_MODE_IMAGE_IDX 0\n#define OVERVIEW_MODE_IMAGE_IDX 1\n\nDecal::Decal() : Component() {\n\tthis->init();\n}\n\nDecal::Decal(Object* object_) : Component(object_) {\n\tthis->init();\n}\n\nDecal::~Decal() {\n\tthis->destroy();\n}\n\nvoid Decal::SetDecalImages(std::string gameMode_image, float gameMode_imageSize, std::string overviewMode_image, float overviewMode_imageSize) {\n\t\/\/ Create a game object to hold the decals:\n\tthis->decalObjectRef = new GameObject(this->gameObjectRef->GetParentSceneGraph());\n\n\t\/\/ Add a sprite renderer:\n\tSpriteRenderer* spriteRenderer = this->decalObjectRef->AddComponent<SpriteRenderer>();\n\tstd::vector<std::string> pathsToTextures;\n\tif (gameMode_image     == \"\") { gameMode_image     = \"blank.png\"; }\n\tif (overviewMode_image == \"\") { overviewMode_image = \"blank.png\"; }\n\tpathsToTextures.push_back(FRAMEWORK->GetFileSystemUtils()->GetDevicePictureResourcesFolderName() + gameMode_image);\n\tpathsToTextures.push_back(FRAMEWORK->GetFileSystemUtils()->GetDevicePictureResourcesFolderName() + overviewMode_image);\n\tspriteRenderer->initPlane(1.0f, 1.0f, \"sptshdr\", pathsToTextures, PlaneOrigin::Center);\n\tspriteRenderer->SetCurrentTextureIndex(GAME_MODE_IMAGE_IDX);\n\n\tthis->scales[GAME_MODE_IMAGE_IDX] = gameMode_imageSize;\n\tthis->scales[OVERVIEW_MODE_IMAGE_IDX] = overviewMode_imageSize;\n\n\tthis->decalObjectRef->GetTransform()->Rotate(-90.0f inRadians, XAXIS);\n\tthis->decalObjectRef->GetTransform()->SetScale(this->scales[this->currentMode], this->scales[this->currentMode], this->scales[this->currentMode]);\n\n\tthis->updatePosition();\n}\n\nvoid Decal::HandleMessage(MessageChunk messageChunk) {\n\tComponent::HandleMessage(messageChunk);\n\n\tswitch (messageChunk->GetMessageType()) {\n\tcase MESSAGE_TYPE_CAMERA_MODE_CHANGED: {\n\t\tthis->handleCameraModeChanged();\n\t} break;\n\n\tdefault: {\n\t} break;\n\t}\n}\n\nvoid Decal::update() {\n\tthis->updatePosition();\n}\n\nvoid Decal::updatePosition() {\n\tif (this->decalObjectRef != nullptr) {\n\t\tthis->decalObjectRef->GetTransform()->SetPosition(this->gameObjectRef->GetTransform()->GetPositionWorld());\n\t\tthis->decalObjectRef->GetTransform()->Translate(2.0f, YAXIS);\n\t}\n}\n\nvoid Decal::handleCameraModeChanged() {\n\tif (!this->decalObjectRef) {\n\t\treturn;\n\t}\n\tSpriteRenderer* spriteRenderer = this->decalObjectRef->GetComponent<SpriteRenderer>();\n\tif (!spriteRenderer) {\n\t\treturn;\n\t}\n\n\tShadyCamera* shadyCamera = SINGLETONS->GetGridManager()->GetShadyCamera();\n\tASSERT(shadyCamera != nullptr, \"Got shady camera\");\n\tif (shadyCamera != nullptr) {\n\t\tif (shadyCamera->GetCameraMode() == ShadyCamera::CameraMode_Game) {\n\t\t\tthis->currentMode = GAME_MODE_IMAGE_IDX;\n\t\t\tspriteRenderer->SetIsOverlay(false);\n\n\t\t} else if (shadyCamera->GetCameraMode() == ShadyCamera::CameraMode_Overview) {\n\t\t\tthis->currentMode = OVERVIEW_MODE_IMAGE_IDX;\n\t\t\tspriteRenderer->SetIsOverlay(true);\n\n\t\t}\n\n\t\tspriteRenderer->SetCurrentTextureIndex(this->currentMode);\n\t\tthis->decalObjectRef->GetTransform()->SetScale(this->scales[this->currentMode], this->scales[this->currentMode], this->scales[this->currentMode]);\n\t}\n}\n\nvoid Decal::init() {\n\tthis->decalObjectRef = nullptr;\n\n\tthis->currentMode = GAME_MODE_IMAGE_IDX;\n\n\tthis->scales[GAME_MODE_IMAGE_IDX] = 1.0f;\n\tthis->scales[OVERVIEW_MODE_IMAGE_IDX] = 1.0f;\n\n\tthis->gameObjectRef = (GameObject*)this->GetObject();\n\tASSERT(this->gameObjectRef->GetClassType() & CLASS_TYPE_GAMEOBJECT, \"Object is a game object\");\n\n\tthis->addSubscriptionToMessageType(MESSAGE_TYPE_CAMERA_MODE_CHANGED, this->GetTypeId(), false);\n\tthis->addSubscriptionToMessageType(MESSAGE_TYPE_FRAME_EVENT, this->GetTypeId(), false);\n}\n\nvoid Decal::destroy() {\n\tthis->removeSubscriptionToAllMessageTypes(this->GetTypeId());\n}\n\n<commit_msg>Fix thief's jump indicators not showing up behind her.<commit_after>#include \"ExampleGame\/Components\/ComponentTypes\/ComponentTypeIds.h\"\n#include \"ExampleGame\/Components\/Decals\/Decal.h\"\n#include \"ExampleGame\/Components\/ShadyCamera\/ShadyCamera.h\"\n#include \"ExampleGame\/GameSingletons\/GameSingletons.h\"\n#include \"ExampleGame\/Messages\/Declarations.h\"\n#include \"Vajra\/Engine\/Components\/DerivedComponents\/Renderer\/SpriteRenderer.h\"\n#include \"Vajra\/Engine\/Components\/DerivedComponents\/Transform\/Transform.h\"\n#include \"Vajra\/Engine\/Core\/Engine.h\"\n#include \"Vajra\/Engine\/SceneGraph\/SceneGraph3D.h\"\n#include \"Vajra\/Engine\/GameObject\/GameObject.h\"\n#include \"Vajra\/Framework\/DeviceUtils\/FileSystemUtils\/FileSystemUtils.h\"\n\nComponentIdType Decal::componentTypeId = COMPONENT_TYPE_ID_DECAL;\n\n#define GAME_MODE_IMAGE_IDX 0\n#define OVERVIEW_MODE_IMAGE_IDX 1\n\nDecal::Decal() : Component() {\n\tthis->init();\n}\n\nDecal::Decal(Object* object_) : Component(object_) {\n\tthis->init();\n}\n\nDecal::~Decal() {\n\tthis->destroy();\n}\n\nvoid Decal::SetDecalImages(std::string gameMode_image, float gameMode_imageSize, std::string overviewMode_image, float overviewMode_imageSize) {\n\t\/\/ Create a game object to hold the decals:\n\tthis->decalObjectRef = new GameObject(this->gameObjectRef->GetParentSceneGraph());\n\n\t\/\/ Add a sprite renderer:\n\tSpriteRenderer* spriteRenderer = this->decalObjectRef->AddComponent<SpriteRenderer>();\n\tstd::vector<std::string> pathsToTextures;\n\tif (gameMode_image     == \"\") { gameMode_image     = \"blank.png\"; }\n\tif (overviewMode_image == \"\") { overviewMode_image = \"blank.png\"; }\n\tpathsToTextures.push_back(FRAMEWORK->GetFileSystemUtils()->GetDevicePictureResourcesFolderName() + gameMode_image);\n\tpathsToTextures.push_back(FRAMEWORK->GetFileSystemUtils()->GetDevicePictureResourcesFolderName() + overviewMode_image);\n\tspriteRenderer->initPlane(1.0f, 1.0f, \"sptshdr\", pathsToTextures, PlaneOrigin::Center);\n\tspriteRenderer->SetCurrentTextureIndex(GAME_MODE_IMAGE_IDX);\n\tspriteRenderer->SetHasTransperancy(true);\n\n\tthis->scales[GAME_MODE_IMAGE_IDX] = gameMode_imageSize;\n\tthis->scales[OVERVIEW_MODE_IMAGE_IDX] = overviewMode_imageSize;\n\n\tthis->decalObjectRef->GetTransform()->Rotate(-90.0f inRadians, XAXIS);\n\tthis->decalObjectRef->GetTransform()->SetScale(this->scales[this->currentMode], this->scales[this->currentMode], this->scales[this->currentMode]);\n\n\tthis->updatePosition();\n}\n\nvoid Decal::HandleMessage(MessageChunk messageChunk) {\n\tComponent::HandleMessage(messageChunk);\n\n\tswitch (messageChunk->GetMessageType()) {\n\tcase MESSAGE_TYPE_CAMERA_MODE_CHANGED: {\n\t\tthis->handleCameraModeChanged();\n\t} break;\n\n\tdefault: {\n\t} break;\n\t}\n}\n\nvoid Decal::update() {\n\tthis->updatePosition();\n}\n\nvoid Decal::updatePosition() {\n\tif (this->decalObjectRef != nullptr) {\n\t\tthis->decalObjectRef->GetTransform()->SetPosition(this->gameObjectRef->GetTransform()->GetPositionWorld());\n\t\tthis->decalObjectRef->GetTransform()->Translate(2.0f, YAXIS);\n\t}\n}\n\nvoid Decal::handleCameraModeChanged() {\n\tif (!this->decalObjectRef) {\n\t\treturn;\n\t}\n\tSpriteRenderer* spriteRenderer = this->decalObjectRef->GetComponent<SpriteRenderer>();\n\tif (!spriteRenderer) {\n\t\treturn;\n\t}\n\n\tShadyCamera* shadyCamera = SINGLETONS->GetGridManager()->GetShadyCamera();\n\tASSERT(shadyCamera != nullptr, \"Got shady camera\");\n\tif (shadyCamera != nullptr) {\n\t\tif (shadyCamera->GetCameraMode() == ShadyCamera::CameraMode_Game) {\n\t\t\tthis->currentMode = GAME_MODE_IMAGE_IDX;\n\t\t\tspriteRenderer->SetIsOverlay(false);\n\n\t\t} else if (shadyCamera->GetCameraMode() == ShadyCamera::CameraMode_Overview) {\n\t\t\tthis->currentMode = OVERVIEW_MODE_IMAGE_IDX;\n\t\t\tspriteRenderer->SetIsOverlay(true);\n\n\t\t}\n\n\t\tspriteRenderer->SetCurrentTextureIndex(this->currentMode);\n\t\tthis->decalObjectRef->GetTransform()->SetScale(this->scales[this->currentMode], this->scales[this->currentMode], this->scales[this->currentMode]);\n\t}\n}\n\nvoid Decal::init() {\n\tthis->decalObjectRef = nullptr;\n\n\tthis->currentMode = GAME_MODE_IMAGE_IDX;\n\n\tthis->scales[GAME_MODE_IMAGE_IDX] = 1.0f;\n\tthis->scales[OVERVIEW_MODE_IMAGE_IDX] = 1.0f;\n\n\tthis->gameObjectRef = (GameObject*)this->GetObject();\n\tASSERT(this->gameObjectRef->GetClassType() & CLASS_TYPE_GAMEOBJECT, \"Object is a game object\");\n\n\tthis->addSubscriptionToMessageType(MESSAGE_TYPE_CAMERA_MODE_CHANGED, this->GetTypeId(), false);\n\tthis->addSubscriptionToMessageType(MESSAGE_TYPE_FRAME_EVENT, this->GetTypeId(), false);\n}\n\nvoid Decal::destroy() {\n\tthis->removeSubscriptionToAllMessageTypes(this->GetTypeId());\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 \"Log4CxxLogger.h\"\n#include <iostream>\n\n#ifdef USE_LOG4CXX\n\n#include <log4cxx\/logger.h>\n#include <log4cxx\/logmanager.h>\n#include <log4cxx\/consoleappender.h>\n#include <log4cxx\/propertyconfigurator.h>\n#include <log4cxx\/patternlayout.h>\n\nusing namespace log4cxx;\n\nnamespace pulsar {\n\nclass Log4CxxLogger : public Logger {\n    std::string _fileName;\n    LoggerPtr _logger;\n\n   public:\n    Log4CxxLogger(const std::string &fileName)\n        : _fileName(fileName), _logger(log4cxx::Logger::getLogger(LOG_CATEGORY_NAME + fileName)) {}\n\n    bool isEnabled(Level level) { return _logger->isEnabledFor(getLevel(level)); }\n\n    void log(Level level, int line, const std::string &message) {\n        spi::LocationInfo location(_fileName.c_str(), \"\", line);\n        _logger->forcedLogLS(getLevel(level), message, location);\n    }\n\n   private:\n    static log4cxx::LevelPtr getLevel(Level level) {\n        switch (level) {\n            case DEBUG:\n                return log4cxx::Level::getDebug();\n            case INFO:\n                return log4cxx::Level::getInfo();\n            case WARN:\n                return log4cxx::Level::getWarn();\n            case ERROR:\n                return log4cxx::Level::getError();\n        }\n    }\n};\n\nLoggerFactoryPtr Log4CxxLoggerFactory::create() {\n    if (!LogManager::getLoggerRepository()->isConfigured()) {\n        LogManager::getLoggerRepository()->setConfigured(true);\n        LoggerPtr root = log4cxx::Logger::getRootLogger();\n        static const LogString TTCC_CONVERSION_PATTERN(LOG4CXX_STR(\"%d{HH:mm:ss.SSS} [%t] %-5p %l - %m%n\"));\n        LayoutPtr layout(new PatternLayout(TTCC_CONVERSION_PATTERN));\n        AppenderPtr appender(new ConsoleAppender(layout));\n        root->setLevel(log4cxx::Level::getInfo());\n        root->addAppender(appender);\n    }\n\n    return LoggerFactoryPtr(new Log4CxxLoggerFactory());\n}\n\nLoggerFactoryPtr Log4CxxLoggerFactory::create(const std::string &log4cxxConfFile) {\n    try {\n        log4cxx::PropertyConfigurator::configure(log4cxxConfFile);\n    } catch (const std::exception &e) {\n        std::cerr << \"exception caught while configuring log4cpp via '\" << log4cxxConfFile\n                  << \"': \" << e.what() << std::endl;\n    } catch (...) {\n        std::cerr << \"unknown exception while configuring log4cpp via '\" << log4cxxConfFile << \"'.\"\n                  << std::endl;\n    }\n\n    return LoggerFactoryPtr(new Log4CxxLoggerFactory());\n}\n\nLogger *Log4CxxLoggerFactory::getLogger(const std::string &fileName) { return new Log4CxxLogger(fileName); }\n}  \/\/ namespace pulsar\n\n#endif  \/\/ USE_LOG4CXX\n<commit_msg>Fix C++ log level names in Log4cxxLogger (#4735)<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 \"Log4CxxLogger.h\"\n#include <iostream>\n\n#ifdef USE_LOG4CXX\n\n#include <log4cxx\/logger.h>\n#include <log4cxx\/logmanager.h>\n#include <log4cxx\/consoleappender.h>\n#include <log4cxx\/propertyconfigurator.h>\n#include <log4cxx\/patternlayout.h>\n\nusing namespace log4cxx;\n\nnamespace pulsar {\n\nclass Log4CxxLogger : public Logger {\n    std::string _fileName;\n    LoggerPtr _logger;\n\n   public:\n    Log4CxxLogger(const std::string &fileName)\n        : _fileName(fileName), _logger(log4cxx::Logger::getLogger(LOG_CATEGORY_NAME + fileName)) {}\n\n    bool isEnabled(Level level) { return _logger->isEnabledFor(getLevel(level)); }\n\n    void log(Level level, int line, const std::string &message) {\n        spi::LocationInfo location(_fileName.c_str(), \"\", line);\n        _logger->forcedLogLS(getLevel(level), message, location);\n    }\n\n   private:\n    static log4cxx::LevelPtr getLevel(Level level) {\n        switch (level) {\n            case LEVEL_DEBUG:\n                return log4cxx::Level::getDebug();\n            case LEVEL_INFO:\n                return log4cxx::Level::getInfo();\n            case LEVEL_WARN:\n                return log4cxx::Level::getWarn();\n            case LEVEL_ERROR:\n                return log4cxx::Level::getError();\n        }\n    }\n};\n\nLoggerFactoryPtr Log4CxxLoggerFactory::create() {\n    if (!LogManager::getLoggerRepository()->isConfigured()) {\n        LogManager::getLoggerRepository()->setConfigured(true);\n        LoggerPtr root = log4cxx::Logger::getRootLogger();\n        static const LogString TTCC_CONVERSION_PATTERN(LOG4CXX_STR(\"%d{HH:mm:ss.SSS} [%t] %-5p %l - %m%n\"));\n        LayoutPtr layout(new PatternLayout(TTCC_CONVERSION_PATTERN));\n        AppenderPtr appender(new ConsoleAppender(layout));\n        root->setLevel(log4cxx::Level::getInfo());\n        root->addAppender(appender);\n    }\n\n    return LoggerFactoryPtr(new Log4CxxLoggerFactory());\n}\n\nLoggerFactoryPtr Log4CxxLoggerFactory::create(const std::string &log4cxxConfFile) {\n    try {\n        log4cxx::PropertyConfigurator::configure(log4cxxConfFile);\n    } catch (const std::exception &e) {\n        std::cerr << \"exception caught while configuring log4cpp via '\" << log4cxxConfFile\n                  << \"': \" << e.what() << std::endl;\n    } catch (...) {\n        std::cerr << \"unknown exception while configuring log4cpp via '\" << log4cxxConfFile << \"'.\"\n                  << std::endl;\n    }\n\n    return LoggerFactoryPtr(new Log4CxxLoggerFactory());\n}\n\nLogger *Log4CxxLoggerFactory::getLogger(const std::string &fileName) { return new Log4CxxLogger(fileName); }\n}  \/\/ namespace pulsar\n\n#endif  \/\/ USE_LOG4CXX\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: defaultprovider.hxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: hr $ $Date: 2003-03-19 16:18:58 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef CONFIGMGR_DEFAULTPROVIDER_HXX\n#define CONFIGMGR_DEFAULTPROVIDER_HXX\n\n#ifndef _CONFIGMGR_TREE_VALUENODE_HXX\n#include \"valuenode.hxx\"\n#endif\n#ifndef CONFIGMGR_UTILITY_HXX_\n#include \"utility.hxx\"\n#endif\n\n#ifndef _COM_SUN_STAR_UNO_EXCEPTION_HPP_\n#include <com\/sun\/star\/uno\/Exception.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UNO_RUNTIMEEXCEPTION_HPP_\n#include <com\/sun\/star\/uno\/RuntimeException.hpp>\n#endif\n\n#ifndef INCLUDED_MEMORY\n#include <memory>\n#define INCLUDED_MEMORY\n#endif\n\n\nnamespace configmgr\n{\n\n    namespace uno = com::sun::star::uno;\n    using ::rtl::OUString;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    namespace configuration\n    {\n        class AbsolutePath;\n    }\n    \/\/-------------------------\n    namespace memory\n    {\n        class Segment;\n    }\n    \/\/-------------------------\n    class ISubtree;\n    class RequestOptions;\n    \/\/==========================================================================\n    \/\/= IDefaultProvider\n    \/\/==========================================================================\n    \/* is an interface that can be implemented by an <type>ITreeProvider<\/type>\n       or <type>ITreeManager<\/type>.\n       <p>Supports functionality to fetch only the default data corresponding to a tree<\/p>\n    *\/\n    class SAL_NO_VTABLE IDefaultProvider\n    {\n    public:\n        \/** load the default version of the tree named by a path\n            using certain options and requiring a specific loading depth\n            @returns\n                the default data tree, yielding ownership of it\n                <NULL\/>if no default data is available for the tree\n        *\/\n        virtual std::auto_ptr<ISubtree> requestDefaultData( configuration::AbsolutePath const& aSubtreePath,\n                                                            const RequestOptions& _aOptions\n                                                           ) CFG_UNO_THROW_ALL(  ) = 0;\n    };\n\n    \/\/==========================================================================\n    \/\/\/ a refcounted <type>IDefaultProvider<\/type>.\n    class SAL_NO_VTABLE IConfigDefaultProvider  : public Refcounted\n                                                , public IDefaultProvider\n    {\n    };\n    \/\/==========================================================================\n    \/\/= IDefaultableTreeManager\n    \/\/==========================================================================\n    \/* is a supplementary interface for a <type>ITreeManager<\/type>.\n       <p>Supports functionality to load default data into the managed tree<\/p>\n    *\/\n    class SAL_NO_VTABLE IDefaultableTreeManager\n    {\n    public:\n        \/\/\/ get a data segment to host the given location - also available in ITreeManager\n        virtual memory::Segment* getDataSegment(configuration::AbsolutePath const& _rAccessor,\n                                                const RequestOptions& _aOptions) = 0;\n\n        \/** attempt to load default data into the tree named by a path using certain options\n            and requiring a specific loading depth.\n\n            @returns\n                <TRUE\/>,  if some default data is available within the tree\n                <FALSE\/>, if no default data is available for the tree\n        *\/\n        virtual sal_Bool fetchDefaultData(  memory::UpdateAccessor& _aAccessToken,\n                                            configuration::AbsolutePath const& aSubtreePath,\n                                            const RequestOptions& _xOptions\n                                         ) CFG_UNO_THROW_ALL(  ) = 0;\n\n    };\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n} \/\/ namespace configmgr\n\n#endif\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.5.194); FILE MERGED 2005\/09\/05 17:04:25 rt 1.5.194.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: defaultprovider.hxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 03:47: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#ifndef CONFIGMGR_DEFAULTPROVIDER_HXX\n#define CONFIGMGR_DEFAULTPROVIDER_HXX\n\n#ifndef _CONFIGMGR_TREE_VALUENODE_HXX\n#include \"valuenode.hxx\"\n#endif\n#ifndef CONFIGMGR_UTILITY_HXX_\n#include \"utility.hxx\"\n#endif\n\n#ifndef _COM_SUN_STAR_UNO_EXCEPTION_HPP_\n#include <com\/sun\/star\/uno\/Exception.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UNO_RUNTIMEEXCEPTION_HPP_\n#include <com\/sun\/star\/uno\/RuntimeException.hpp>\n#endif\n\n#ifndef INCLUDED_MEMORY\n#include <memory>\n#define INCLUDED_MEMORY\n#endif\n\n\nnamespace configmgr\n{\n\n    namespace uno = com::sun::star::uno;\n    using ::rtl::OUString;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    namespace configuration\n    {\n        class AbsolutePath;\n    }\n    \/\/-------------------------\n    namespace memory\n    {\n        class Segment;\n    }\n    \/\/-------------------------\n    class ISubtree;\n    class RequestOptions;\n    \/\/==========================================================================\n    \/\/= IDefaultProvider\n    \/\/==========================================================================\n    \/* is an interface that can be implemented by an <type>ITreeProvider<\/type>\n       or <type>ITreeManager<\/type>.\n       <p>Supports functionality to fetch only the default data corresponding to a tree<\/p>\n    *\/\n    class SAL_NO_VTABLE IDefaultProvider\n    {\n    public:\n        \/** load the default version of the tree named by a path\n            using certain options and requiring a specific loading depth\n            @returns\n                the default data tree, yielding ownership of it\n                <NULL\/>if no default data is available for the tree\n        *\/\n        virtual std::auto_ptr<ISubtree> requestDefaultData( configuration::AbsolutePath const& aSubtreePath,\n                                                            const RequestOptions& _aOptions\n                                                           ) CFG_UNO_THROW_ALL(  ) = 0;\n    };\n\n    \/\/==========================================================================\n    \/\/\/ a refcounted <type>IDefaultProvider<\/type>.\n    class SAL_NO_VTABLE IConfigDefaultProvider  : public Refcounted\n                                                , public IDefaultProvider\n    {\n    };\n    \/\/==========================================================================\n    \/\/= IDefaultableTreeManager\n    \/\/==========================================================================\n    \/* is a supplementary interface for a <type>ITreeManager<\/type>.\n       <p>Supports functionality to load default data into the managed tree<\/p>\n    *\/\n    class SAL_NO_VTABLE IDefaultableTreeManager\n    {\n    public:\n        \/\/\/ get a data segment to host the given location - also available in ITreeManager\n        virtual memory::Segment* getDataSegment(configuration::AbsolutePath const& _rAccessor,\n                                                const RequestOptions& _aOptions) = 0;\n\n        \/** attempt to load default data into the tree named by a path using certain options\n            and requiring a specific loading depth.\n\n            @returns\n                <TRUE\/>,  if some default data is available within the tree\n                <FALSE\/>, if no default data is available for the tree\n        *\/\n        virtual sal_Bool fetchDefaultData(  memory::UpdateAccessor& _aAccessToken,\n                                            configuration::AbsolutePath const& aSubtreePath,\n                                            const RequestOptions& _xOptions\n                                         ) CFG_UNO_THROW_ALL(  ) = 0;\n\n    };\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n} \/\/ namespace configmgr\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: CDriver.hxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: hr $ $Date: 2004-08-02 17:12:28 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _CONNECTIVITY_CALC_DRIVER_HXX_\n#define _CONNECTIVITY_CALC_DRIVER_HXX_\n\n#ifndef _CONNECTIVITY_FILE_ODRIVER_HXX_\n#include \"file\/FDriver.hxx\"\n#endif\n\nnamespace connectivity\n{\n    namespace calc\n    {\n        ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface > SAL_CALL\n            ODriver_CreateInstance(const ::com::sun::star::uno::Reference<\n                        ::com::sun::star::lang::XMultiServiceFactory >& _rxFactory)\n                    throw( ::com::sun::star::uno::Exception );\n\n        class ODriver : public file::OFileDriver\n        {\n        public:\n            ODriver(const ::com::sun::star::uno::Reference<\n                                ::com::sun::star::lang::XMultiServiceFactory >& _rxFactory) :\n                file::OFileDriver(_rxFactory){}\n\n            static ::rtl::OUString getImplementationName_Static(  ) throw(::com::sun::star::uno::RuntimeException);\n            ::rtl::OUString SAL_CALL getImplementationName(  ) throw(::com::sun::star::uno::RuntimeException);\n\n            \/\/ XDriver\n            virtual ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection > SAL_CALL\n                    connect( const ::rtl::OUString& url, const ::com::sun::star::uno::Sequence<\n                                ::com::sun::star::beans::PropertyValue >& info )\n                        throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n            virtual sal_Bool SAL_CALL acceptsURL( const ::rtl::OUString& url )\n                        throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n            virtual ::com::sun::star::uno::Sequence< ::com::sun::star::sdbc::DriverPropertyInfo > SAL_CALL getPropertyInfo( const ::rtl::OUString& url, const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& info ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        };\n    }\n}\n\n#endif \/\/_CONNECTIVITY_CALC_DRIVER_HXX_\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.2.132); FILE MERGED 2005\/09\/05 17:25:10 rt 1.2.132.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: CDriver.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 06: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#ifndef _CONNECTIVITY_CALC_DRIVER_HXX_\n#define _CONNECTIVITY_CALC_DRIVER_HXX_\n\n#ifndef _CONNECTIVITY_FILE_ODRIVER_HXX_\n#include \"file\/FDriver.hxx\"\n#endif\n\nnamespace connectivity\n{\n    namespace calc\n    {\n        ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface > SAL_CALL\n            ODriver_CreateInstance(const ::com::sun::star::uno::Reference<\n                        ::com::sun::star::lang::XMultiServiceFactory >& _rxFactory)\n                    throw( ::com::sun::star::uno::Exception );\n\n        class ODriver : public file::OFileDriver\n        {\n        public:\n            ODriver(const ::com::sun::star::uno::Reference<\n                                ::com::sun::star::lang::XMultiServiceFactory >& _rxFactory) :\n                file::OFileDriver(_rxFactory){}\n\n            static ::rtl::OUString getImplementationName_Static(  ) throw(::com::sun::star::uno::RuntimeException);\n            ::rtl::OUString SAL_CALL getImplementationName(  ) throw(::com::sun::star::uno::RuntimeException);\n\n            \/\/ XDriver\n            virtual ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection > SAL_CALL\n                    connect( const ::rtl::OUString& url, const ::com::sun::star::uno::Sequence<\n                                ::com::sun::star::beans::PropertyValue >& info )\n                        throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n            virtual sal_Bool SAL_CALL acceptsURL( const ::rtl::OUString& url )\n                        throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n            virtual ::com::sun::star::uno::Sequence< ::com::sun::star::sdbc::DriverPropertyInfo > SAL_CALL getPropertyInfo( const ::rtl::OUString& url, const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& info ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n        };\n    }\n}\n\n#endif \/\/_CONNECTIVITY_CALC_DRIVER_HXX_\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 \"views\/examples\/menu_example.h\"\n\n#include <set>\n\n#include \"base\/utf_string_conversions.h\"\n#include \"ui\/base\/models\/simple_menu_model.h\"\n#include \"views\/controls\/button\/menu_button.h\"\n#include \"views\/controls\/menu\/menu_2.h\"\n#include \"views\/controls\/menu\/view_menu_delegate.h\"\n#include \"views\/controls\/button\/text_button.h\"\n#include \"views\/layout\/fill_layout.h\"\n#include \"views\/view.h\"\n\nnamespace {\n\nclass ExampleMenuModel : public ui::SimpleMenuModel,\n                         public ui::SimpleMenuModel::Delegate {\n public:\n  ExampleMenuModel();\n\n  void RunMenuAt(const gfx::Point& point);\n\n  \/\/ Overridden from ui::SimpleMenuModel::Delegate:\n  virtual bool IsCommandIdChecked(int command_id) const OVERRIDE;\n  virtual bool IsCommandIdEnabled(int command_id) const OVERRIDE;\n  virtual bool GetAcceleratorForCommandId(\n      int command_id,\n      ui::Accelerator* accelerator) OVERRIDE;\n  virtual void ExecuteCommand(int command_id) OVERRIDE;\n\n private:\n  enum {\n    kGroupMakeDecision,\n  };\n\n  enum {\n    kCommandDoSomething,\n    kCommandSelectAscii,\n    kCommandSelectUtf8,\n    kCommandSelectUtf16,\n    kCommandCheckApple,\n    kCommandCheckOrange,\n    kCommandCheckKiwi,\n    kCommandGoHome,\n  };\n\n  scoped_ptr<views::Menu2> menu_;\n  scoped_ptr<ui::SimpleMenuModel> submenu_;\n  std::set<int> checked_fruits_;\n  int current_encoding_command_id_;\n\n  DISALLOW_COPY_AND_ASSIGN(ExampleMenuModel);\n};\n\nclass ExampleMenuButton : public views::MenuButton,\n                          public views::ViewMenuDelegate {\n public:\n  ExampleMenuButton(const std::wstring& test, bool show_menu_marker);\n  virtual ~ExampleMenuButton();\n\n private:\n  \/\/ Overridden from views::ViewMenuDelegate:\n  virtual void RunMenu(views::View* source, const gfx::Point& point) OVERRIDE;\n\n  scoped_ptr<ExampleMenuModel> menu_model_;\n  DISALLOW_COPY_AND_ASSIGN(ExampleMenuButton);\n};\n\n\/\/ ExampleMenuModel ---------------------------------------------------------\n\nExampleMenuModel::ExampleMenuModel()\n    : ALLOW_THIS_IN_INITIALIZER_LIST(ui::SimpleMenuModel(this)),\n      current_encoding_command_id_(kCommandSelectAscii) {\n  AddItem(kCommandDoSomething, WideToUTF16(L\"Do Something\"));\n  AddSeparator();\n  AddRadioItem(kCommandSelectAscii,\n               WideToUTF16(L\"ASCII\"), kGroupMakeDecision);\n  AddRadioItem(kCommandSelectUtf8,\n               WideToUTF16(L\"UTF-8\"), kGroupMakeDecision);\n  AddRadioItem(kCommandSelectUtf16,\n               WideToUTF16(L\"UTF-16\"), kGroupMakeDecision);\n  AddSeparator();\n  AddCheckItem(kCommandCheckApple, WideToUTF16(L\"Apple\"));\n  AddCheckItem(kCommandCheckOrange, WideToUTF16(L\"Orange\"));\n  AddCheckItem(kCommandCheckKiwi, WideToUTF16(L\"Kiwi\"));\n  AddSeparator();\n  AddItem(kCommandGoHome, WideToUTF16(L\"Go Home\"));\n\n  submenu_.reset(new ui::SimpleMenuModel(this));\n  submenu_->AddItem(kCommandDoSomething, WideToUTF16(L\"Do Something 2\"));\n  AddSubMenu(-1, ASCIIToUTF16(\"Submenu\"), submenu_.get());\n  menu_.reset(new views::Menu2(this));\n}\n\nvoid ExampleMenuModel::RunMenuAt(const gfx::Point& point) {\n  menu_->RunMenuAt(point, views::Menu2::ALIGN_TOPRIGHT);\n}\n\nbool ExampleMenuModel::IsCommandIdChecked(int command_id) const {\n  \/\/ Radio items.\n  if (command_id == current_encoding_command_id_)\n    return true;\n\n  \/\/ Check items.\n  if (checked_fruits_.find(command_id) != checked_fruits_.end())\n    return true;\n\n  return false;\n}\n\nbool ExampleMenuModel::IsCommandIdEnabled(int command_id) const {\n  \/\/ All commands are enabled except for kCommandGoHome.\n  return command_id != kCommandGoHome;\n}\n\nbool ExampleMenuModel::GetAcceleratorForCommandId(\n    int command_id,\n    ui::Accelerator* accelerator) {\n  \/\/ We don't use this in the example.\n  return false;\n}\n\nvoid ExampleMenuModel::ExecuteCommand(int command_id) {\n  switch (command_id) {\n    case kCommandDoSomething: {\n      LOG(INFO) << \"Done something\";\n      break;\n    }\n\n    \/\/ Radio items.\n    case kCommandSelectAscii: {\n      current_encoding_command_id_ = kCommandSelectAscii;\n      LOG(INFO) << \"Selected ASCII\";\n      break;\n    }\n    case kCommandSelectUtf8: {\n      current_encoding_command_id_ = kCommandSelectUtf8;\n      LOG(INFO) << \"Selected UTF-8\";\n      break;\n    }\n    case kCommandSelectUtf16: {\n      current_encoding_command_id_ = kCommandSelectUtf16;\n      LOG(INFO) << \"Selected UTF-16\";\n      break;\n    }\n\n    \/\/ Check items.\n    case kCommandCheckApple:\n    case kCommandCheckOrange:\n    case kCommandCheckKiwi: {\n      \/\/ Print what fruit is checked.\n      const char* checked_fruit = \"\";\n      if (command_id == kCommandCheckApple) {\n        checked_fruit = \"Apple\";\n      } else if (command_id == kCommandCheckOrange) {\n        checked_fruit = \"Orange\";\n      } else if (command_id == kCommandCheckKiwi) {\n        checked_fruit = \"Kiwi\";\n      }\n      LOG(INFO) << \"Checked \" << checked_fruit;\n\n      \/\/ Update the check status.\n      std::set<int>::iterator iter = checked_fruits_.find(command_id);\n      if (iter == checked_fruits_.end())\n        checked_fruits_.insert(command_id);\n      else\n        checked_fruits_.erase(iter);\n      break;\n    }\n  }\n}\n\n\/\/ ExampleMenuButton -----------------------------------------------------------\n\nExampleMenuButton::ExampleMenuButton(const std::wstring& test,\n                                     bool show_menu_marker)\n    : ALLOW_THIS_IN_INITIALIZER_LIST(\n          views::MenuButton(NULL, test, this, show_menu_marker)) {\n}\n\nExampleMenuButton::~ExampleMenuButton() {\n}\n\nvoid ExampleMenuButton::RunMenu(views::View* source, const gfx::Point& point) {\n  if (menu_model_ == NULL) {\n    menu_model_.reset(new ExampleMenuModel);\n  }\n  menu_model_->RunMenuAt(point);\n}\n\n}  \/\/ namespace\n\nnamespace examples {\n\nMenuExample::MenuExample(ExamplesMain* main)\n    : ExampleBase(main) {\n}\n\nMenuExample::~MenuExample() {\n}\n\nstd::wstring MenuExample::GetExampleTitle() {\n  return L\"Menu\";\n}\n\nvoid MenuExample::CreateExampleView(views::View* container) {\n  \/\/ views::Menu2 is not a sub class of View, hence we cannot directly\n  \/\/ add to the continer. Instead, we add a button to open a menu.\n  const bool show_menu_marker = true;\n  ExampleMenuButton* menu_button = new ExampleMenuButton(L\"Open a menu\",\n                                                         show_menu_marker);\n  container->SetLayoutManager(new views::FillLayout);\n  container->AddChildView(menu_button);\n}\n\n}  \/\/ namespace examples\n<commit_msg>views: Fix the MenuExample so it doesn't crash.<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 \"views\/examples\/menu_example.h\"\n\n#include <set>\n\n#include \"base\/utf_string_conversions.h\"\n#include \"ui\/base\/models\/simple_menu_model.h\"\n#include \"views\/controls\/button\/menu_button.h\"\n#include \"views\/controls\/menu\/menu_2.h\"\n#include \"views\/controls\/menu\/view_menu_delegate.h\"\n#include \"views\/controls\/button\/text_button.h\"\n#include \"views\/layout\/fill_layout.h\"\n#include \"views\/view.h\"\n\nnamespace {\n\nclass ExampleMenuModel : public ui::SimpleMenuModel,\n                         public ui::SimpleMenuModel::Delegate {\n public:\n  ExampleMenuModel();\n\n  void RunMenuAt(const gfx::Point& point);\n\n  \/\/ Overridden from ui::SimpleMenuModel::Delegate:\n  virtual bool IsCommandIdChecked(int command_id) const OVERRIDE;\n  virtual bool IsCommandIdEnabled(int command_id) const OVERRIDE;\n  virtual bool GetAcceleratorForCommandId(\n      int command_id,\n      ui::Accelerator* accelerator) OVERRIDE;\n  virtual void ExecuteCommand(int command_id) OVERRIDE;\n\n private:\n  enum {\n    kGroupMakeDecision,\n  };\n\n  enum {\n    kCommandDoSomething,\n    kCommandSelectAscii,\n    kCommandSelectUtf8,\n    kCommandSelectUtf16,\n    kCommandCheckApple,\n    kCommandCheckOrange,\n    kCommandCheckKiwi,\n    kCommandGoHome,\n  };\n\n  scoped_ptr<views::Menu2> menu_;\n  scoped_ptr<ui::SimpleMenuModel> submenu_;\n  std::set<int> checked_fruits_;\n  int current_encoding_command_id_;\n\n  DISALLOW_COPY_AND_ASSIGN(ExampleMenuModel);\n};\n\nclass ExampleMenuButton : public views::MenuButton,\n                          public views::ViewMenuDelegate {\n public:\n  ExampleMenuButton(const std::wstring& test, bool show_menu_marker);\n  virtual ~ExampleMenuButton();\n\n private:\n  \/\/ Overridden from views::ViewMenuDelegate:\n  virtual void RunMenu(views::View* source, const gfx::Point& point) OVERRIDE;\n\n  scoped_ptr<ExampleMenuModel> menu_model_;\n  DISALLOW_COPY_AND_ASSIGN(ExampleMenuButton);\n};\n\n\/\/ ExampleMenuModel ---------------------------------------------------------\n\nExampleMenuModel::ExampleMenuModel()\n    : ALLOW_THIS_IN_INITIALIZER_LIST(ui::SimpleMenuModel(this)),\n      current_encoding_command_id_(kCommandSelectAscii) {\n  AddItem(kCommandDoSomething, WideToUTF16(L\"Do Something\"));\n  AddSeparator();\n  AddRadioItem(kCommandSelectAscii,\n               WideToUTF16(L\"ASCII\"), kGroupMakeDecision);\n  AddRadioItem(kCommandSelectUtf8,\n               WideToUTF16(L\"UTF-8\"), kGroupMakeDecision);\n  AddRadioItem(kCommandSelectUtf16,\n               WideToUTF16(L\"UTF-16\"), kGroupMakeDecision);\n  AddSeparator();\n  AddCheckItem(kCommandCheckApple, WideToUTF16(L\"Apple\"));\n  AddCheckItem(kCommandCheckOrange, WideToUTF16(L\"Orange\"));\n  AddCheckItem(kCommandCheckKiwi, WideToUTF16(L\"Kiwi\"));\n  AddSeparator();\n  AddItem(kCommandGoHome, WideToUTF16(L\"Go Home\"));\n\n  submenu_.reset(new ui::SimpleMenuModel(this));\n  submenu_->AddItem(kCommandDoSomething, WideToUTF16(L\"Do Something 2\"));\n  AddSubMenu(0, ASCIIToUTF16(\"Submenu\"), submenu_.get());\n  menu_.reset(new views::Menu2(this));\n}\n\nvoid ExampleMenuModel::RunMenuAt(const gfx::Point& point) {\n  menu_->RunMenuAt(point, views::Menu2::ALIGN_TOPRIGHT);\n}\n\nbool ExampleMenuModel::IsCommandIdChecked(int command_id) const {\n  \/\/ Radio items.\n  if (command_id == current_encoding_command_id_)\n    return true;\n\n  \/\/ Check items.\n  if (checked_fruits_.find(command_id) != checked_fruits_.end())\n    return true;\n\n  return false;\n}\n\nbool ExampleMenuModel::IsCommandIdEnabled(int command_id) const {\n  \/\/ All commands are enabled except for kCommandGoHome.\n  return command_id != kCommandGoHome;\n}\n\nbool ExampleMenuModel::GetAcceleratorForCommandId(\n    int command_id,\n    ui::Accelerator* accelerator) {\n  \/\/ We don't use this in the example.\n  return false;\n}\n\nvoid ExampleMenuModel::ExecuteCommand(int command_id) {\n  switch (command_id) {\n    case kCommandDoSomething: {\n      LOG(INFO) << \"Done something\";\n      break;\n    }\n\n    \/\/ Radio items.\n    case kCommandSelectAscii: {\n      current_encoding_command_id_ = kCommandSelectAscii;\n      LOG(INFO) << \"Selected ASCII\";\n      break;\n    }\n    case kCommandSelectUtf8: {\n      current_encoding_command_id_ = kCommandSelectUtf8;\n      LOG(INFO) << \"Selected UTF-8\";\n      break;\n    }\n    case kCommandSelectUtf16: {\n      current_encoding_command_id_ = kCommandSelectUtf16;\n      LOG(INFO) << \"Selected UTF-16\";\n      break;\n    }\n\n    \/\/ Check items.\n    case kCommandCheckApple:\n    case kCommandCheckOrange:\n    case kCommandCheckKiwi: {\n      \/\/ Print what fruit is checked.\n      const char* checked_fruit = \"\";\n      if (command_id == kCommandCheckApple) {\n        checked_fruit = \"Apple\";\n      } else if (command_id == kCommandCheckOrange) {\n        checked_fruit = \"Orange\";\n      } else if (command_id == kCommandCheckKiwi) {\n        checked_fruit = \"Kiwi\";\n      }\n      LOG(INFO) << \"Checked \" << checked_fruit;\n\n      \/\/ Update the check status.\n      std::set<int>::iterator iter = checked_fruits_.find(command_id);\n      if (iter == checked_fruits_.end())\n        checked_fruits_.insert(command_id);\n      else\n        checked_fruits_.erase(iter);\n      break;\n    }\n  }\n}\n\n\/\/ ExampleMenuButton -----------------------------------------------------------\n\nExampleMenuButton::ExampleMenuButton(const std::wstring& test,\n                                     bool show_menu_marker)\n    : ALLOW_THIS_IN_INITIALIZER_LIST(\n          views::MenuButton(NULL, test, this, show_menu_marker)) {\n}\n\nExampleMenuButton::~ExampleMenuButton() {\n}\n\nvoid ExampleMenuButton::RunMenu(views::View* source, const gfx::Point& point) {\n  if (menu_model_ == NULL) {\n    menu_model_.reset(new ExampleMenuModel);\n  }\n  menu_model_->RunMenuAt(point);\n}\n\n}  \/\/ namespace\n\nnamespace examples {\n\nMenuExample::MenuExample(ExamplesMain* main)\n    : ExampleBase(main) {\n}\n\nMenuExample::~MenuExample() {\n}\n\nstd::wstring MenuExample::GetExampleTitle() {\n  return L\"Menu\";\n}\n\nvoid MenuExample::CreateExampleView(views::View* container) {\n  \/\/ views::Menu2 is not a sub class of View, hence we cannot directly\n  \/\/ add to the continer. Instead, we add a button to open a menu.\n  const bool show_menu_marker = true;\n  ExampleMenuButton* menu_button = new ExampleMenuButton(L\"Open a menu\",\n                                                         show_menu_marker);\n  container->SetLayoutManager(new views::FillLayout);\n  container->AddChildView(menu_button);\n}\n\n}  \/\/ namespace examples\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\n* libVLC backend for the Phonon library                                     *\n*                                                                           *\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-2010 vlc-phonon AUTHORS                                *\n*                                                                           *\n* This program is free software; you can redistribute it and\/or             *\n* modify it under the terms of the GNU Lesser General Public                *\n* License as published by the Free Software Foundation; either              *\n* version 2.1 of the License, or (at your option) any later version.        *\n*                                                                           *\n* This program is distributed in the hope that it will be useful,           *\n* but WITHOUT ANY WARRANTY; without even the implied warranty of            *\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU         *\n* Lesser General Public License for more details.                           *\n*                                                                           *\n* You should have received a copy of the GNU Lesser General Public          *\n* License along with this package; if not, write to the Free Software       *\n* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA *\n*****************************************************************************\/\n\n#ifndef PHONON_VLC_NO_EXPERIMENTAL\n#include \"avcapture.h\"\n\nnamespace Phonon\n{\nnamespace VLC\n{\nnamespace Experimental\n{\n\nAvCapture::AvCapture(QObject* parent)\n    : QObject(parent),\n    m_audioMedia(parent),\n    m_videoMedia(parent)\n{\n\n}\n\nAvCapture::~AvCapture()\n{\n    stop();\n}\n\nvoid AvCapture::start()\n{\n    m_audioMedia.play();\n    m_videoMedia.play();\n}\n\nvoid AvCapture::stop()\n{\n    m_audioMedia.stop();\n    m_videoMedia.stop();\n}\n\nMediaObject* AvCapture::audioMediaObject()\n{\n    return &m_audioMedia;\n}\n\nMediaObject* AvCapture::videoMediaObject()\n{\n    return &m_videoMedia;\n}\n\nAudioCaptureDevice AvCapture::audioCaptureDevice() const\n{\n    return m_audioCaptureDevice;\n}\n\nVideoCaptureDevice AvCapture::videoCaptureDevice() const\n{\n    return m_videoCaptureDevice;\n}\n\nvoid AvCapture::setAudioCaptureDevice(const Phonon::AudioCaptureDevice &device)\n{\n    MediaSource source(device);\n    m_audioMedia.setSource(source);\n    m_audioCaptureDevice = device;\n}\n\nvoid AvCapture::setVideoCaptureDevice(const Phonon::VideoCaptureDevice &device)\n{\n    MediaSource source(device);\n    m_videoMedia.setSource(source);\n    m_videoCaptureDevice = device;\n}\n\n} \/\/ Experimental namespace\n} \/\/ VLC namespace\n} \/\/ Phonon namespace\n\n#endif \/\/ PHONON_VLC_NO_EXPERIMENTAL\n<commit_msg>Use implicit constructors in AvCapture impl<commit_after>\/*****************************************************************************\n* libVLC backend for the Phonon library                                     *\n*                                                                           *\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-2010 vlc-phonon AUTHORS                                *\n*                                                                           *\n* This program is free software; you can redistribute it and\/or             *\n* modify it under the terms of the GNU Lesser General Public                *\n* License as published by the Free Software Foundation; either              *\n* version 2.1 of the License, or (at your option) any later version.        *\n*                                                                           *\n* This program is distributed in the hope that it will be useful,           *\n* but WITHOUT ANY WARRANTY; without even the implied warranty of            *\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU         *\n* Lesser General Public License for more details.                           *\n*                                                                           *\n* You should have received a copy of the GNU Lesser General Public          *\n* License along with this package; if not, write to the Free Software       *\n* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA *\n*****************************************************************************\/\n\n#ifndef PHONON_VLC_NO_EXPERIMENTAL\n#include \"avcapture.h\"\n\nnamespace Phonon\n{\nnamespace VLC\n{\nnamespace Experimental\n{\n\nAvCapture::AvCapture(QObject* parent)\n    : QObject(parent),\n    m_audioMedia(parent),\n    m_videoMedia(parent)\n{\n\n}\n\nAvCapture::~AvCapture()\n{\n    stop();\n}\n\nvoid AvCapture::start()\n{\n    m_audioMedia.play();\n    m_videoMedia.play();\n}\n\nvoid AvCapture::stop()\n{\n    m_audioMedia.stop();\n    m_videoMedia.stop();\n}\n\nMediaObject* AvCapture::audioMediaObject()\n{\n    return &m_audioMedia;\n}\n\nMediaObject* AvCapture::videoMediaObject()\n{\n    return &m_videoMedia;\n}\n\nAudioCaptureDevice AvCapture::audioCaptureDevice() const\n{\n    return m_audioCaptureDevice;\n}\n\nVideoCaptureDevice AvCapture::videoCaptureDevice() const\n{\n    return m_videoCaptureDevice;\n}\n\nvoid AvCapture::setAudioCaptureDevice(const Phonon::AudioCaptureDevice &device)\n{\n    m_audioMedia.setSource(device);\n    m_audioCaptureDevice = device;\n}\n\nvoid AvCapture::setVideoCaptureDevice(const Phonon::VideoCaptureDevice &device)\n{\n    m_videoMedia.setSource(device);\n    m_videoCaptureDevice = device;\n}\n\n} \/\/ Experimental namespace\n} \/\/ VLC namespace\n} \/\/ Phonon namespace\n\n#endif \/\/ PHONON_VLC_NO_EXPERIMENTAL\n<|endoftext|>"}
{"text":"<commit_before>\r\n#include \"DatabaseBinarySerialiser.h\"\r\n#include \"Database.h\"\r\n#include \"DatabaseMetadata.h\"\r\n\r\n#include <vector>\r\n\r\n\r\nnamespace\r\n{\r\n\ttemplate <typename TYPE, int SIZE>\r\n\tvoid CopyInteger(const crdb::Database&, char* dest, const char* source, int)\r\n\t{\r\n\t\t\/\/ Ensure the assumed size is the same as the machine size\r\n\t\tint assert_size_is_correct[sizeof(TYPE) == SIZE];\r\n\t\t(void)assert_size_is_correct;\r\n\r\n\t\t\/\/ Quick assign copy\r\n\t\t*(TYPE*)dest = *(TYPE*)source;\r\n\t}\r\n\r\n\r\n\tvoid MemCopy(const crdb::Database&, char* dest, const char* source, int size)\r\n\t{\r\n\t\tmemcpy(dest, source, size);\r\n\t}\r\n\r\n\r\n\tvoid CopyName(const crdb::Database& db, char* dest, const char* source, int)\r\n\t{\r\n\t\t\/\/ Copy the hash\r\n\t\tcrdb::Name& name = *(crdb::Name*)source;\r\n\t\t*(crdb::u32*)dest = name == db.GetNoName() ? 0 : name->first;\r\n\t}\r\n\r\n\r\n\ttemplate <void PACK_FUNC(const crdb::Database&, char*, const char*, int)>\r\n\tvoid PackStridedData(const crdb::Database& db, char* dest, const char* source, int nb_entries, int dest_stride, int source_stride, int field_size)\r\n\t{\r\n\t\t\/\/ The compiler should be able to inline the call the PACK_FUNC for each entry\r\n\t\tfor (int i = 0; i < nb_entries; i++)\r\n\t\t{\r\n\t\t\tPACK_FUNC(db, dest, source, field_size);\r\n\t\t\tdest += dest_stride;\r\n\t\t\tsource += source_stride;\r\n\t\t}\r\n\t}\r\n\r\n\r\n\tvoid PackBasicFields(const crdb::Database& db, char* dest, const char* source, int nb_entries, const crdb::meta::DatabaseType& type, const crdb::meta::DatabaseField& field)\r\n\t{\r\n\t\t\/\/ Use memcpy as a last resort - try at least to use some big machine-size types\r\n\t\tswitch (field.size)\r\n\t\t{\r\n\t\tcase (1): PackStridedData< CopyInteger<bool, 1> >(db, dest, source, nb_entries, type.packed_size, type.size, 0); break;\r\n\t\tcase (2): PackStridedData< CopyInteger<short, 2> >(db, dest, source, nb_entries, type.packed_size, type.size, 0); break;\r\n\t\tcase (4): PackStridedData< CopyInteger<int, 4> >(db, dest, source, nb_entries, type.packed_size, type.size, 0); break;\r\n\t\tcase (8): PackStridedData< CopyInteger<__int64, 8> >(db, dest, source, nb_entries, type.packed_size, type.size, 0); break;\r\n\t\tdefault: PackStridedData< MemCopy >(db, dest, source, nb_entries, type.packed_size, type.size, field.size); break;\r\n\t\t}\r\n\t}\r\n\r\n\r\n\tvoid PackNameFields(const crdb::Database& db, char* dest, const char* source, int nb_entries, const crdb::meta::DatabaseType& type, const crdb::meta::DatabaseField& field)\r\n\t{\r\n\t\tPackStridedData< CopyName >(db, dest, source, nb_entries, type.packed_size, type.size, 0);\r\n\t}\r\n\r\n\r\n\ttemplate <typename TYPE>\r\n\tvoid CopyPrimitiveStoreToTable(const crdb::PrimitiveStore<TYPE>& store, std::vector<TYPE>& table, bool named)\r\n\t{\r\n\t\tint dest_index = 0;\r\n\r\n\t\t\/\/ Make a local copy of all entries in the table\r\n\t\tif (named)\r\n\t\t{\r\n\t\t\ttable.resize(store.named.size());\r\n\t\t\tfor (crdb::PrimitiveStore<TYPE>::NamedStore::const_iterator i = store.named.begin(); i != store.named.end(); ++i)\r\n\t\t\t{\r\n\t\t\t\ttable[dest_index++] = i->second;\r\n\t\t\t}\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\ttable.resize(store.unnamed.size());\r\n\t\t\tfor (crdb::PrimitiveStore<TYPE>::UnnamedStore::const_iterator i = store.unnamed.begin(); i != store.unnamed.end(); ++i)\r\n\t\t\t{\r\n\t\t\t\ttable[dest_index++] = *i;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\r\n\ttemplate <typename TYPE>\r\n\tvoid PackTable(const crdb::Database& db, const std::vector<TYPE>& table, const crdb::meta::DatabaseType& type, char* output)\r\n\t{\r\n\t\t\/\/ Walk up through the inheritance hierarhcy\r\n\t\tfor (const crdb::meta::DatabaseType* cur_type = &type; cur_type; cur_type = cur_type->base_type)\r\n\t\t{\r\n\t\t\t\/\/ Pack a field at a time\r\n\t\t\tfor (size_t i = 0; i < cur_type->fields.size(); i++)\r\n\t\t\t{\r\n\t\t\t\tconst crdb::meta::DatabaseField& field = cur_type->fields[i];\r\n\r\n\t\t\t\t\/\/ Start at the offset from the field within the first object\r\n\t\t\t\tchar* dest = output + field.packed_offset;\r\n\t\t\t\tchar* source = (char*)&table.front() + field.offset;\r\n\r\n\t\t\t\t\/\/ Perform strided copies depending on field type - pass information about the root type\r\n\t\t\t\tswitch (field.type)\r\n\t\t\t\t{\r\n\t\t\t\tcase (crdb::meta::FIELD_TYPE_BASIC): PackBasicFields(db, dest, source, table.size(), type, field); break;\r\n\t\t\t\tcase (crdb::meta::FIELD_TYPE_NAME): PackNameFields(db, dest, source, table.size(), type, field); break;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\r\n\ttemplate <typename TYPE>\r\n\tvoid WriteTable(FILE* fp, const crdb::Database& db, const crdb::meta::DatabaseTypes& dbtypes, bool named)\r\n\t{\r\n\t\t\/\/ Generate a memory-contiguous table\r\n\t\tstd::vector<TYPE> table;\r\n\t\tCopyPrimitiveStoreToTable(db.GetPrimitiveStore<TYPE>(), table, named);\r\n\r\n\t\t\/\/ Record the table size\r\n\t\tint table_size = table.size();\r\n\t\tfwrite(&table_size, sizeof(int), 1, fp);\r\n\r\n\t\tif (table_size)\r\n\t\t{\r\n\t\t\t\/\/ Allocate enough memory to store the table in packed binary format\r\n\t\t\tconst crdb::meta::DatabaseType& type = dbtypes.GetType<TYPE>();\r\n\t\t\tint packed_size = table_size * type.packed_size;\r\n\t\t\tchar* data = new char[packed_size];\r\n\r\n\t\t\t\/\/ Binary pack the table\r\n\t\t\tPackTable(db, table, type, data);\r\n\r\n\t\t\t\/\/ Write to file and cleanup\r\n\t\t\tfwrite(data, packed_size, 1, fp);\r\n\t\t\tdelete [] data;\r\n\t\t}\r\n\t}\r\n\r\n\r\n\ttemplate <typename TYPE>\r\n\tvoid WriteTable(FILE* fp, const crdb::Database& db, const crdb::meta::DatabaseTypes& dbtypes)\r\n\t{\r\n\t\t\/\/ Write both named and unnamed tables\r\n\t\t\/\/ The unnamed tables contain the empty names, but this makes the code much simpler\r\n\t\t\/\/ at the expense of file sizes that are little larger\r\n\t\tWriteTable<TYPE>(fp, db, dbtypes, true);\r\n\t\tWriteTable<TYPE>(fp, db, dbtypes, false);\r\n\t}\r\n}\r\n\r\n\r\nvoid crdb::WriteBinaryDatabase(const char* filename, const Database& db)\r\n{\r\n\tFILE* fp = fopen(filename, \"wb\");\r\n\r\n\tcrdb::meta::DatabaseTypes dbtypes;\r\n\tWriteTable<crdb::Namespace>(fp, db, dbtypes);\r\n\tWriteTable<crdb::Type>(fp, db, dbtypes);\r\n\tWriteTable<crdb::Class>(fp, db, dbtypes);\r\n\tWriteTable<crdb::Enum>(fp, db, dbtypes);\r\n\tWriteTable<crdb::EnumConstant>(fp, db, dbtypes);\r\n\tWriteTable<crdb::Function>(fp, db, dbtypes);\r\n\tWriteTable<crdb::Field>(fp, db, dbtypes);\r\n\r\n\tfclose(fp);\r\n}<commit_msg>Added writing of the name table. Binary size is very similar to the text size!<commit_after>\r\n#include \"DatabaseBinarySerialiser.h\"\r\n#include \"Database.h\"\r\n#include \"DatabaseMetadata.h\"\r\n\r\n#include <vector>\r\n\r\n\r\nnamespace\r\n{\r\n\ttemplate <typename TYPE, int SIZE>\r\n\tvoid CopyInteger(const crdb::Database&, char* dest, const char* source, int)\r\n\t{\r\n\t\t\/\/ Ensure the assumed size is the same as the machine size\r\n\t\tint assert_size_is_correct[sizeof(TYPE) == SIZE];\r\n\t\t(void)assert_size_is_correct;\r\n\r\n\t\t\/\/ Quick assign copy\r\n\t\t*(TYPE*)dest = *(TYPE*)source;\r\n\t}\r\n\r\n\r\n\tvoid MemCopy(const crdb::Database&, char* dest, const char* source, int size)\r\n\t{\r\n\t\tmemcpy(dest, source, size);\r\n\t}\r\n\r\n\r\n\tvoid CopyName(const crdb::Database& db, char* dest, const char* source, int)\r\n\t{\r\n\t\t\/\/ Copy the hash\r\n\t\tcrdb::Name& name = *(crdb::Name*)source;\r\n\t\t*(crdb::u32*)dest = name == db.GetNoName() ? 0 : name->first;\r\n\t}\r\n\r\n\r\n\ttemplate <void PACK_FUNC(const crdb::Database&, char*, const char*, int)>\r\n\tvoid PackStridedData(const crdb::Database& db, char* dest, const char* source, int nb_entries, int dest_stride, int source_stride, int field_size)\r\n\t{\r\n\t\t\/\/ The compiler should be able to inline the call the PACK_FUNC for each entry\r\n\t\tfor (int i = 0; i < nb_entries; i++)\r\n\t\t{\r\n\t\t\tPACK_FUNC(db, dest, source, field_size);\r\n\t\t\tdest += dest_stride;\r\n\t\t\tsource += source_stride;\r\n\t\t}\r\n\t}\r\n\r\n\r\n\tvoid PackBasicFields(const crdb::Database& db, char* dest, const char* source, int nb_entries, const crdb::meta::DatabaseType& type, const crdb::meta::DatabaseField& field)\r\n\t{\r\n\t\t\/\/ Use memcpy as a last resort - try at least to use some big machine-size types\r\n\t\tswitch (field.size)\r\n\t\t{\r\n\t\tcase (1): PackStridedData< CopyInteger<bool, 1> >(db, dest, source, nb_entries, type.packed_size, type.size, 0); break;\r\n\t\tcase (2): PackStridedData< CopyInteger<short, 2> >(db, dest, source, nb_entries, type.packed_size, type.size, 0); break;\r\n\t\tcase (4): PackStridedData< CopyInteger<int, 4> >(db, dest, source, nb_entries, type.packed_size, type.size, 0); break;\r\n\t\tcase (8): PackStridedData< CopyInteger<__int64, 8> >(db, dest, source, nb_entries, type.packed_size, type.size, 0); break;\r\n\t\tdefault: PackStridedData< MemCopy >(db, dest, source, nb_entries, type.packed_size, type.size, field.size); break;\r\n\t\t}\r\n\t}\r\n\r\n\r\n\tvoid PackNameFields(const crdb::Database& db, char* dest, const char* source, int nb_entries, const crdb::meta::DatabaseType& type, const crdb::meta::DatabaseField& field)\r\n\t{\r\n\t\tPackStridedData< CopyName >(db, dest, source, nb_entries, type.packed_size, type.size, 0);\r\n\t}\r\n\r\n\r\n\ttemplate <typename TYPE>\r\n\tvoid CopyPrimitiveStoreToTable(const crdb::PrimitiveStore<TYPE>& store, std::vector<TYPE>& table, bool named)\r\n\t{\r\n\t\tint dest_index = 0;\r\n\r\n\t\t\/\/ Make a local copy of all entries in the table\r\n\t\tif (named)\r\n\t\t{\r\n\t\t\ttable.resize(store.named.size());\r\n\t\t\tfor (crdb::PrimitiveStore<TYPE>::NamedStore::const_iterator i = store.named.begin(); i != store.named.end(); ++i)\r\n\t\t\t{\r\n\t\t\t\ttable[dest_index++] = i->second;\r\n\t\t\t}\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\ttable.resize(store.unnamed.size());\r\n\t\t\tfor (crdb::PrimitiveStore<TYPE>::UnnamedStore::const_iterator i = store.unnamed.begin(); i != store.unnamed.end(); ++i)\r\n\t\t\t{\r\n\t\t\t\ttable[dest_index++] = *i;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\r\n\ttemplate <typename TYPE>\r\n\tvoid PackTable(const crdb::Database& db, const std::vector<TYPE>& table, const crdb::meta::DatabaseType& type, char* output)\r\n\t{\r\n\t\t\/\/ Walk up through the inheritance hierarhcy\r\n\t\tfor (const crdb::meta::DatabaseType* cur_type = &type; cur_type; cur_type = cur_type->base_type)\r\n\t\t{\r\n\t\t\t\/\/ Pack a field at a time\r\n\t\t\tfor (size_t i = 0; i < cur_type->fields.size(); i++)\r\n\t\t\t{\r\n\t\t\t\tconst crdb::meta::DatabaseField& field = cur_type->fields[i];\r\n\r\n\t\t\t\t\/\/ Start at the offset from the field within the first object\r\n\t\t\t\tchar* dest = output + field.packed_offset;\r\n\t\t\t\tchar* source = (char*)&table.front() + field.offset;\r\n\r\n\t\t\t\t\/\/ Perform strided copies depending on field type - pass information about the root type\r\n\t\t\t\tswitch (field.type)\r\n\t\t\t\t{\r\n\t\t\t\tcase (crdb::meta::FIELD_TYPE_BASIC): PackBasicFields(db, dest, source, table.size(), type, field); break;\r\n\t\t\t\tcase (crdb::meta::FIELD_TYPE_NAME): PackNameFields(db, dest, source, table.size(), type, field); break;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\r\n\ttemplate <typename TYPE>\r\n\tvoid WriteTable(FILE* fp, const crdb::Database& db, const crdb::meta::DatabaseTypes& dbtypes, bool named)\r\n\t{\r\n\t\t\/\/ Generate a memory-contiguous table\r\n\t\tstd::vector<TYPE> table;\r\n\t\tCopyPrimitiveStoreToTable(db.GetPrimitiveStore<TYPE>(), table, named);\r\n\r\n\t\t\/\/ Record the table size\r\n\t\tint table_size = table.size();\r\n\t\tfwrite(&table_size, sizeof(int), 1, fp);\r\n\r\n\t\tif (table_size)\r\n\t\t{\r\n\t\t\t\/\/ Allocate enough memory to store the table in packed binary format\r\n\t\t\tconst crdb::meta::DatabaseType& type = dbtypes.GetType<TYPE>();\r\n\t\t\tint packed_size = table_size * type.packed_size;\r\n\t\t\tchar* data = new char[packed_size];\r\n\r\n\t\t\t\/\/ Binary pack the table\r\n\t\t\tPackTable(db, table, type, data);\r\n\r\n\t\t\t\/\/ Write to file and cleanup\r\n\t\t\tfwrite(data, packed_size, 1, fp);\r\n\t\t\tdelete [] data;\r\n\t\t}\r\n\t}\r\n\r\n\r\n\ttemplate <typename TYPE>\r\n\tvoid WriteTable(FILE* fp, const crdb::Database& db, const crdb::meta::DatabaseTypes& dbtypes)\r\n\t{\r\n\t\t\/\/ Write both named and unnamed tables\r\n\t\t\/\/ The unnamed tables contain the empty names, but this makes the code much simpler\r\n\t\t\/\/ at the expense of file sizes that are little larger\r\n\t\tWriteTable<TYPE>(fp, db, dbtypes, true);\r\n\t\tWriteTable<TYPE>(fp, db, dbtypes, false);\r\n\t}\r\n\r\n\r\n\tvoid WriteNameTable(FILE* fp, const crdb::Database& db)\r\n\t{\r\n\t\t\/\/ Write the table header\r\n\t\tint nb_names = db.m_Names.size();\r\n\t\tfwrite(&nb_names, sizeof(int), 1, fp);\r\n\r\n\t\t\/\/ Write each name\r\n\t\tfor (crdb::Name i = db.m_Names.begin(); i != db.m_Names.end(); ++i)\r\n\t\t{\r\n\t\t\tfwrite(&i->first, sizeof(int), 1, fp);\r\n\t\t\tint len = i->second.length();\r\n\t\t\tfwrite(&len, sizeof(int), 1, fp);\r\n\t\t\tfwrite(i->second.c_str(), len, 1, fp);\r\n\t\t}\r\n\t}\r\n}\r\n\r\n\r\nvoid crdb::WriteBinaryDatabase(const char* filename, const Database& db)\r\n{\r\n\tFILE* fp = fopen(filename, \"wb\");\r\n\r\n\t\/\/ Write each table with explicit ordering\r\n\tcrdb::meta::DatabaseTypes dbtypes;\r\n\tWriteNameTable(fp, db);\r\n\tWriteTable<crdb::Namespace>(fp, db, dbtypes);\r\n\tWriteTable<crdb::Type>(fp, db, dbtypes);\r\n\tWriteTable<crdb::Class>(fp, db, dbtypes);\r\n\tWriteTable<crdb::Enum>(fp, db, dbtypes);\r\n\tWriteTable<crdb::EnumConstant>(fp, db, dbtypes);\r\n\tWriteTable<crdb::Function>(fp, db, dbtypes);\r\n\tWriteTable<crdb::Field>(fp, db, dbtypes);\r\n\r\n\tfclose(fp);\r\n}<|endoftext|>"}
{"text":"<commit_before>#include \"voxblox_ros\/esdf_server.h\"\n\nnamespace voxblox {\n\nEsdfServer::EsdfServer(const ros::NodeHandle& nh,\n                       const ros::NodeHandle& nh_private)\n    : TsdfServer(nh, nh_private) {\n  esdf_pointcloud_pub_ =\n      nh_private_.advertise<pcl::PointCloud<pcl::PointXYZI> >(\"esdf_pointcloud\",\n                                                              1, true);\n  esdf_slice_pub_ = nh_private_.advertise<pcl::PointCloud<pcl::PointXYZI> >(\n      \"esdf_slice\", 1, true);\n\n  EsdfMap::Config esdf_config;\n\n  \/\/ TODO(helenol): in the future allow different ESDF and TSDF voxel sizes...\n  nh_private_.param(\"tsdf_voxel_size\", esdf_config.esdf_voxel_size,\n                    esdf_config.esdf_voxel_size);\n  nh_private_.param(\"tsdf_voxels_per_side\", esdf_config.esdf_voxels_per_side,\n                    esdf_config.esdf_voxels_per_side);\n\n  esdf_map_.reset(new EsdfMap(esdf_config));\n\n  EsdfIntegrator::Config esdf_integrator_config;\n  \/\/ Make sure that this is the same as the truncation distance OR SMALLER!\n  esdf_integrator_config.min_distance_m =\n      tsdf_integrator_->getConfig().default_truncation_distance;\n  nh_private_.param(\"esdf_max_distance_m\",\n                    esdf_integrator_config.max_distance_m,\n                    esdf_integrator_config.max_distance_m);\n  nh_private_.param(\"esdf_default_distance_m\",\n                    esdf_integrator_config.default_distance_m,\n                    esdf_integrator_config.default_distance_m);\n\n  esdf_integrator_.reset(new EsdfIntegrator(esdf_integrator_config,\n                                            tsdf_map_->getTsdfLayerPtr(),\n                                            esdf_map_->getEsdfLayerPtr()));\n}\n\nvoid EsdfServer::publishAllUpdatedEsdfVoxels() {\n  \/\/ Create a pointcloud with distance = intensity.\n  pcl::PointCloud<pcl::PointXYZI> pointcloud;\n\n  createDistancePointcloudFromEsdfLayer(esdf_map_->getEsdfLayer(), &pointcloud);\n\n  pointcloud.header.frame_id = world_frame_;\n  esdf_pointcloud_pub_.publish(pointcloud);\n}\n\nvoid EsdfServer::publishSlices() {\n  TsdfServer::publishSlices();\n\n  pcl::PointCloud<pcl::PointXYZI> pointcloud;\n\n  createDistancePointcloudFromEsdfLayerSlice(esdf_map_->getEsdfLayer(), 2,\n                                             slice_level_, &pointcloud);\n\n  pointcloud.header.frame_id = world_frame_;\n  esdf_slice_pub_.publish(pointcloud);\n}\n\nbool EsdfServer::generateEsdfCallback(\n    std_srvs::Empty::Request& request,      \/\/ NOLINT\n    std_srvs::Empty::Response& response) {  \/\/ NOLINT\n  const bool clear_esdf = true;\n  if (clear_esdf) {\n    esdf_integrator_->updateFromTsdfLayerBatch();\n  } else {\n    const bool clear_updated_flag = true;\n    esdf_integrator_->updateFromTsdfLayer(clear_updated_flag);\n  }\n  publishAllUpdatedEsdfVoxels();\n  publishSlices();\n  return true;\n}\n\nvoid EsdfServer::updateMeshEvent(const ros::TimerEvent& e) {\n  TsdfServer::updateMeshEvent(e);\n\n  const bool clear_updated_flag_esdf = false;\n  esdf_integrator_->updateFromTsdfLayer(clear_updated_flag_esdf);\n  publishAllUpdatedEsdfVoxels();\n}\n\n}  \/\/ namespace voxblox\n<commit_msg>Fixed ESDF server to actually build an ESDF.<commit_after>#include \"voxblox_ros\/esdf_server.h\"\n\nnamespace voxblox {\n\nEsdfServer::EsdfServer(const ros::NodeHandle& nh,\n                       const ros::NodeHandle& nh_private)\n    : TsdfServer(nh, nh_private) {\n  esdf_pointcloud_pub_ =\n      nh_private_.advertise<pcl::PointCloud<pcl::PointXYZI> >(\"esdf_pointcloud\",\n                                                              1, true);\n  esdf_slice_pub_ = nh_private_.advertise<pcl::PointCloud<pcl::PointXYZI> >(\n      \"esdf_slice\", 1, true);\n\n  EsdfMap::Config esdf_config;\n\n  \/\/ TODO(helenol): in the future allow different ESDF and TSDF voxel sizes...\n  nh_private_.param(\"tsdf_voxel_size\", esdf_config.esdf_voxel_size,\n                    esdf_config.esdf_voxel_size);\n  nh_private_.param(\"tsdf_voxels_per_side\", esdf_config.esdf_voxels_per_side,\n                    esdf_config.esdf_voxels_per_side);\n\n  esdf_map_.reset(new EsdfMap(esdf_config));\n\n  EsdfIntegrator::Config esdf_integrator_config;\n  \/\/ Make sure that this is the same as the truncation distance OR SMALLER!\n  esdf_integrator_config.min_distance_m =\n      tsdf_integrator_->getConfig().default_truncation_distance;\n  nh_private_.param(\"esdf_max_distance_m\",\n                    esdf_integrator_config.max_distance_m,\n                    esdf_integrator_config.max_distance_m);\n  nh_private_.param(\"esdf_default_distance_m\",\n                    esdf_integrator_config.default_distance_m,\n                    esdf_integrator_config.default_distance_m);\n\n  esdf_integrator_.reset(new EsdfIntegrator(esdf_integrator_config,\n                                            tsdf_map_->getTsdfLayerPtr(),\n                                            esdf_map_->getEsdfLayerPtr()));\n}\n\nvoid EsdfServer::publishAllUpdatedEsdfVoxels() {\n  \/\/ Create a pointcloud with distance = intensity.\n  pcl::PointCloud<pcl::PointXYZI> pointcloud;\n\n  createDistancePointcloudFromEsdfLayer(esdf_map_->getEsdfLayer(), &pointcloud);\n\n  pointcloud.header.frame_id = world_frame_;\n  esdf_pointcloud_pub_.publish(pointcloud);\n}\n\nvoid EsdfServer::publishSlices() {\n  TsdfServer::publishSlices();\n\n  pcl::PointCloud<pcl::PointXYZI> pointcloud;\n\n  createDistancePointcloudFromEsdfLayerSlice(esdf_map_->getEsdfLayer(), 2,\n                                             slice_level_, &pointcloud);\n\n  pointcloud.header.frame_id = world_frame_;\n  esdf_slice_pub_.publish(pointcloud);\n}\n\nbool EsdfServer::generateEsdfCallback(\n    std_srvs::Empty::Request& request,      \/\/ NOLINT\n    std_srvs::Empty::Response& response) {  \/\/ NOLINT\n  const bool clear_esdf = true;\n  if (clear_esdf) {\n    esdf_integrator_->updateFromTsdfLayerBatch();\n  } else {\n    const bool clear_updated_flag = true;\n    esdf_integrator_->updateFromTsdfLayer(clear_updated_flag);\n  }\n  publishAllUpdatedEsdfVoxels();\n  publishSlices();\n  return true;\n}\n\nvoid EsdfServer::updateMeshEvent(const ros::TimerEvent& e) {\n  \/\/ Also update the ESDF now.\n  const bool clear_updated_flag_esdf = false;\n  esdf_integrator_->updateFromTsdfLayer(clear_updated_flag_esdf);\n  publishAllUpdatedEsdfVoxels();\n\n  TsdfServer::updateMeshEvent(e);\n}\n\n}  \/\/ namespace voxblox\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Polygon.hpp\n *\n *  Created on: Nov 7, 2014\n *      Author: Péter Fankhauser\n *   Institute: ETH Zurich, Autonomous Systems Lab\n *\/\n\n#pragma once\n\n#include <grid_map_core\/TypeDefs.hpp>\n\n\/\/ STD\n#include <vector>\n\n\/\/ Eigen\n#include <Eigen\/Core>\n\nnamespace grid_map {\n\nclass Polygon\n{\n public:\n\n  enum class TriangulationMethods {\n    FAN \/\/ Fan triangulation (only for convex polygons).\n  };\n\n  \/*!\n   * Default constructor.\n   *\/\n  Polygon();\n\n  \/*!\n   * Constructor with vertices.\n   * @param vertices the points of the polygon.\n   *\/\n  Polygon(std::vector<Position> vertices);\n\n  \/*!\n   * Destructor.\n   *\/\n  virtual ~Polygon();\n\n  \/*!\n   * Check if point is inside polygon.\n   * @param point the point to be checked.\n   * @return true if inside, false otherwise.\n   *\/\n  bool isInside(const Position& point) const;\n\n  \/*!\n   * Add a vertex to the polygon\n   * @param vertex the point to be added.\n   *\/\n  void addVertex(const Position& vertex);\n\n  \/*!\n   * Get the vertex with index.\n   * @param index the index of the requested vertex.\n   * @return the requested vertex.\n   *\/\n  const Position& getVertex(const size_t index) const;\n\n  \/*!\n   * Removes all vertices from the polygon.\n   *\/\n  void removeVertices();\n\n  \/*!\n   * Get vertex operator overload.\n   * @param index the index of the requested vertex.\n   * @return the requested vertex.\n   *\/\n  const Position& operator [](const size_t index) const;\n\n  \/*!\n   * Returns the vertices of the polygon.\n   * @return the vertices of the polygon.\n   *\/\n  const std::vector<Position>& getVertices() const;\n\n  \/*!\n   * Returns the number of vertices.\n   * @return the number of vertices.\n   *\/\n  const size_t nVertices() const;\n\n  \/*!\n   * Set the timestamp of the polygon.\n   * @param timestamp the timestamp to set (in  nanoseconds).\n   *\/\n  void setTimestamp(const uint64_t timestamp);\n\n  \/*!\n   * Get the timestamp of the polygon.\n   * @return timestamp in nanoseconds.\n   *\/\n  uint64_t getTimestamp() const;\n\n  \/*!\n   * Resets the timestamp of the polygon (to zero).\n   *\/\n  void resetTimestamp();\n\n  \/*!\n   * Set the frame id of the polygon.\n   * @param frameId the frame id to set.\n   *\/\n  void setFrameId(const std::string& frameId);\n\n  \/*!\n   * Get the frameId of the polygon.\n   * @return frameId.\n   *\/\n  const std::string& getFrameId() const;\n\n  \/*!\n   * Get the area of the polygon. The polygon has to be\n   * \"simple\", i.e. not crossing itself.\n   * @return area of the polygon.\n   *\/\n  const double getArea() const;\n\n  \/*!\n   * Get the centroid of polygon. The polygon has to be\n   * \"simple\", i.e. not crossing itself.\n   * @return centroid of polygon.\n   *\/\n  Position getCentroid() const;\n\n  \/*!\n   * Gets the bounding box of the polygon.\n   * @param center the center of the bounding box.\n   * @param length the side lengths of the bounding box.\n   *\/\n  void getBoundingBox(Position& center, Length& length) const;\n\n  \/*!\n   * Convert polygon to inequality constraints which most tightly contain the points; i.e.,\n   * create constraints to bound the convex hull of polygon. The inequality constraints are\n   * represented as A and b, a set of constraints such that A*x <= b defining the region of\n   * space enclosing the convex hull.\n   * Based on the VERT2CON MATLAB method by Michael Kleder:\n   * http:\/\/www.mathworks.com\/matlabcentral\/fileexchange\/7895-vert2con-vertices-to-constraints\n   * @param A the A matrix in of the inequality constraint.\n   * @param b the b matrix in of the inequality constraint.\n   * @return true if conversion successful, false otherwise.\n   *\/\n  bool convertToInequalityConstraints(Eigen::MatrixXd& A,\n                                      Eigen::VectorXd& b) const;\n\n  \/*!\n   * Offsets the polygon inward (buffering) by a margin.\n   * Use a negative margin to offset the polygon outward.\n   * @param margin the margin to offset the polygon by (in [m]).\n   * @return true if successful, false otherwise.\n   *\/\n  bool offsetInward(const double margin);\n\n  \/*!\n   * If only two verices are given, this methods generates a\n   * `thickened` line polygon with four vertices.\n   * @param thickness the desired thickness of the line.\n   * @return true if successful, false otherwise.\n   *\/\n  bool thickenLine(const double thickness);\n\n  \/*!\n   * Return a triangulated version of the polygon.\n   * @return a list of triangle polygons covering the same polygon.\n   *\/\n  std::vector<Polygon> triangulate(const TriangulationMethods& method = TriangulationMethods::FAN) const;\n\n  \/*!\n   * Approximates a circle with a polygon.\n   * @param[in] center the center position of the circle.\n   * @param[in] radius radius of the circle.\n   * @param[in] nVertices number of vertices of the approximation polygon. Default = 20.\n   * @return circle as polygon.\n   *\/\n  static Polygon fromCircle(const Position center, const double radius,\n                            const int nVertices = 20);\n\n  \/*!\n   * Approximates two circles with a convex hull and returns it as polygon.\n   * @param[in] center1 the center position of the first circle.\n   * @param[in] center2 the center position of the second circle.\n   * @param[in] radius radius of the circles.\n   * @param[in] nVertices number of vertices of the approximation polygon. Default = 20.\n   * @return convex hull of the two circles as polygon.\n   *\/\n  static Polygon convexHullOfTwoCircles(const Position center1,\n                                        const Position center2,\n                                        const double radius,\n                                        const int nVertices = 20);\n\n  \/*!\n   * Computes the convex hull of two polygons and returns it as polygon.\n   * @param[in] polygon1 the first input polygon.\n   * @param[in] polygon2 the second input polygon.\n   * @return convex hull as polygon.\n   *\/\n  static Polygon convexHull(Polygon& polygon1, Polygon& polygon2);\n\n protected:\n\n  \/*!\n   * Returns true if the vector1 and vector2 are sorted lexicographically.\n   * @param[in] vector1 the first input vector.\n   * @param[in] vector2 the second input vector.\n   *\/\n  static bool sortVertices(const Eigen::Vector2d& vector1,\n                           const Eigen::Vector2d& vector2);\n\n  \/*!\n   * Returns the 2D cross product of vector1 and vector2.\n   * @param[in] vector1 the first input vector.\n   * @param[in] vector2 the second input vector.\n   *\/\n  static double computeCrossProduct2D(const Eigen::Vector2d& vector1,\n                                      const Eigen::Vector2d& vector2);\n\n  \/\/! Frame id of the polygon.\n  std::string frameId_;\n\n  \/\/! Timestamp of the polygon (nanoseconds).\n  uint64_t timestamp_;\n\n  \/\/! Vertices of the polygon.\n  std::vector<Position> vertices_;\n\n public:\n  EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n};\n\n} \/* namespace grid_map *\/\n<commit_msg>Resolve ignored qualifiers<commit_after>\/*\n * Polygon.hpp\n *\n *  Created on: Nov 7, 2014\n *      Author: Péter Fankhauser\n *   Institute: ETH Zurich, Autonomous Systems Lab\n *\/\n\n#pragma once\n\n#include <grid_map_core\/TypeDefs.hpp>\n\n\/\/ STD\n#include <vector>\n\n\/\/ Eigen\n#include <Eigen\/Core>\n\nnamespace grid_map {\n\nclass Polygon\n{\n public:\n\n  enum class TriangulationMethods {\n    FAN \/\/ Fan triangulation (only for convex polygons).\n  };\n\n  \/*!\n   * Default constructor.\n   *\/\n  Polygon();\n\n  \/*!\n   * Constructor with vertices.\n   * @param vertices the points of the polygon.\n   *\/\n  Polygon(std::vector<Position> vertices);\n\n  \/*!\n   * Destructor.\n   *\/\n  virtual ~Polygon();\n\n  \/*!\n   * Check if point is inside polygon.\n   * @param point the point to be checked.\n   * @return true if inside, false otherwise.\n   *\/\n  bool isInside(const Position& point) const;\n\n  \/*!\n   * Add a vertex to the polygon\n   * @param vertex the point to be added.\n   *\/\n  void addVertex(const Position& vertex);\n\n  \/*!\n   * Get the vertex with index.\n   * @param index the index of the requested vertex.\n   * @return the requested vertex.\n   *\/\n  const Position& getVertex(const size_t index) const;\n\n  \/*!\n   * Removes all vertices from the polygon.\n   *\/\n  void removeVertices();\n\n  \/*!\n   * Get vertex operator overload.\n   * @param index the index of the requested vertex.\n   * @return the requested vertex.\n   *\/\n  const Position& operator [](const size_t index) const;\n\n  \/*!\n   * Returns the vertices of the polygon.\n   * @return the vertices of the polygon.\n   *\/\n  const std::vector<Position>& getVertices() const;\n\n  \/*!\n   * Returns the number of vertices.\n   * @return the number of vertices.\n   *\/\n  size_t nVertices() const;\n\n  \/*!\n   * Set the timestamp of the polygon.\n   * @param timestamp the timestamp to set (in  nanoseconds).\n   *\/\n  void setTimestamp(const uint64_t timestamp);\n\n  \/*!\n   * Get the timestamp of the polygon.\n   * @return timestamp in nanoseconds.\n   *\/\n  uint64_t getTimestamp() const;\n\n  \/*!\n   * Resets the timestamp of the polygon (to zero).\n   *\/\n  void resetTimestamp();\n\n  \/*!\n   * Set the frame id of the polygon.\n   * @param frameId the frame id to set.\n   *\/\n  void setFrameId(const std::string& frameId);\n\n  \/*!\n   * Get the frameId of the polygon.\n   * @return frameId.\n   *\/\n  const std::string& getFrameId() const;\n\n  \/*!\n   * Get the area of the polygon. The polygon has to be\n   * \"simple\", i.e. not crossing itself.\n   * @return area of the polygon.\n   *\/\n  double getArea() const;\n\n  \/*!\n   * Get the centroid of polygon. The polygon has to be\n   * \"simple\", i.e. not crossing itself.\n   * @return centroid of polygon.\n   *\/\n  Position getCentroid() const;\n\n  \/*!\n   * Gets the bounding box of the polygon.\n   * @param center the center of the bounding box.\n   * @param length the side lengths of the bounding box.\n   *\/\n  void getBoundingBox(Position& center, Length& length) const;\n\n  \/*!\n   * Convert polygon to inequality constraints which most tightly contain the points; i.e.,\n   * create constraints to bound the convex hull of polygon. The inequality constraints are\n   * represented as A and b, a set of constraints such that A*x <= b defining the region of\n   * space enclosing the convex hull.\n   * Based on the VERT2CON MATLAB method by Michael Kleder:\n   * http:\/\/www.mathworks.com\/matlabcentral\/fileexchange\/7895-vert2con-vertices-to-constraints\n   * @param A the A matrix in of the inequality constraint.\n   * @param b the b matrix in of the inequality constraint.\n   * @return true if conversion successful, false otherwise.\n   *\/\n  bool convertToInequalityConstraints(Eigen::MatrixXd& A,\n                                      Eigen::VectorXd& b) const;\n\n  \/*!\n   * Offsets the polygon inward (buffering) by a margin.\n   * Use a negative margin to offset the polygon outward.\n   * @param margin the margin to offset the polygon by (in [m]).\n   * @return true if successful, false otherwise.\n   *\/\n  bool offsetInward(const double margin);\n\n  \/*!\n   * If only two verices are given, this methods generates a\n   * `thickened` line polygon with four vertices.\n   * @param thickness the desired thickness of the line.\n   * @return true if successful, false otherwise.\n   *\/\n  bool thickenLine(const double thickness);\n\n  \/*!\n   * Return a triangulated version of the polygon.\n   * @return a list of triangle polygons covering the same polygon.\n   *\/\n  std::vector<Polygon> triangulate(const TriangulationMethods& method = TriangulationMethods::FAN) const;\n\n  \/*!\n   * Approximates a circle with a polygon.\n   * @param[in] center the center position of the circle.\n   * @param[in] radius radius of the circle.\n   * @param[in] nVertices number of vertices of the approximation polygon. Default = 20.\n   * @return circle as polygon.\n   *\/\n  static Polygon fromCircle(const Position center, const double radius,\n                            const int nVertices = 20);\n\n  \/*!\n   * Approximates two circles with a convex hull and returns it as polygon.\n   * @param[in] center1 the center position of the first circle.\n   * @param[in] center2 the center position of the second circle.\n   * @param[in] radius radius of the circles.\n   * @param[in] nVertices number of vertices of the approximation polygon. Default = 20.\n   * @return convex hull of the two circles as polygon.\n   *\/\n  static Polygon convexHullOfTwoCircles(const Position center1,\n                                        const Position center2,\n                                        const double radius,\n                                        const int nVertices = 20);\n\n  \/*!\n   * Computes the convex hull of two polygons and returns it as polygon.\n   * @param[in] polygon1 the first input polygon.\n   * @param[in] polygon2 the second input polygon.\n   * @return convex hull as polygon.\n   *\/\n  static Polygon convexHull(Polygon& polygon1, Polygon& polygon2);\n\n protected:\n\n  \/*!\n   * Returns true if the vector1 and vector2 are sorted lexicographically.\n   * @param[in] vector1 the first input vector.\n   * @param[in] vector2 the second input vector.\n   *\/\n  static bool sortVertices(const Eigen::Vector2d& vector1,\n                           const Eigen::Vector2d& vector2);\n\n  \/*!\n   * Returns the 2D cross product of vector1 and vector2.\n   * @param[in] vector1 the first input vector.\n   * @param[in] vector2 the second input vector.\n   *\/\n  static double computeCrossProduct2D(const Eigen::Vector2d& vector1,\n                                      const Eigen::Vector2d& vector2);\n\n  \/\/! Frame id of the polygon.\n  std::string frameId_;\n\n  \/\/! Timestamp of the polygon (nanoseconds).\n  uint64_t timestamp_;\n\n  \/\/! Vertices of the polygon.\n  std::vector<Position> vertices_;\n\n public:\n  EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n};\n\n} \/* namespace grid_map *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/ bslstl_referencewrapper.t.cpp                                      -*-C++-*-\n#include <bslstl_referencewrapper.h>\n\n#include <bsls_bsltestutil.h>\n\n#include <iostream>\n#include <stdio.h>\n#include <stdlib.h>\n\n\/\/ ============================================================================\n\/\/                              TEST PLAN\n\/\/ ----------------------------------------------------------------------------\n\/\/                              Overview\n\/\/                              --------\n\/\/ The component under test is fully specified by the standard, verifiable by\n\/\/ inspection.  Therefore, testing only exercises basic uses to ensure template\n\/\/ specializations may be instantiated successfully.\n\/\/\n\/\/ ----------------------------------------------------------------------------\n\/\/ TESTING INSTANTIATIONS AND BASIC FUNCTIONALITY\n\/\/ [ 1] reference_wrapper(T&);\n\/\/ [ 1] reference_wrapper(const reference_wrapper<T>&);\n\/\/ [ 1] reference_wrapper<T>& operator=(reference_wrapper<T>&);\n\/\/ [ 1] operator T&() const;\n\/\/ [ 1] T& get() const;\n\/\/ [ 1] reference_wrapper<T> cref(const T&);\n\/\/ [ 1] reference_wrapper<T> cref(reference_wrapper<T>);\n\/\/ [ 1] reference_wrapper<T> ref(T&);\n\/\/ [ 1] reference_wrapper<T> ref(reference_wrapper<T>);\n\/\/ ----------------------------------------------------------------------------\n\/\/ [ 3] USAGE EXAMPLE\n\/\/ [ 2] TYPE TRAITS\n\n\/\/ ============================================================================\n\/\/                  STANDARD BSL ASSERT TEST FUNCTION\n\/\/ ----------------------------------------------------------------------------\n\nnamespace {\n\nint testStatus = 0;\n\nvoid aSsErT(bool condition, const char *message, int line)\n{\n    if (condition) {\n        printf(\"Error \" __FILE__ \"(%d): %s    (failed)\\n\", line, message);\n\n        if (0 <= testStatus && testStatus <= 100) {\n            ++testStatus;\n        }\n    }\n}\n\n}  \/\/ close unnamed namespace\n\n\/\/ ============================================================================\n\/\/               STANDARD BSL TEST DRIVER MACRO ABBREVIATIONS\n\/\/ ----------------------------------------------------------------------------\n\n#define ASSERT       BSLS_BSLTESTUTIL_ASSERT\n#define ASSERTV      BSLS_BSLTESTUTIL_ASSERTV\n\n#define LOOP_ASSERT  BSLS_BSLTESTUTIL_LOOP_ASSERT\n#define LOOP0_ASSERT BSLS_BSLTESTUTIL_LOOP0_ASSERT\n#define LOOP1_ASSERT BSLS_BSLTESTUTIL_LOOP1_ASSERT\n#define LOOP2_ASSERT BSLS_BSLTESTUTIL_LOOP2_ASSERT\n#define LOOP3_ASSERT BSLS_BSLTESTUTIL_LOOP3_ASSERT\n#define LOOP4_ASSERT BSLS_BSLTESTUTIL_LOOP4_ASSERT\n#define LOOP5_ASSERT BSLS_BSLTESTUTIL_LOOP5_ASSERT\n#define LOOP6_ASSERT BSLS_BSLTESTUTIL_LOOP6_ASSERT\n\n#define Q            BSLS_BSLTESTUTIL_Q   \/\/ Quote identifier literally.\n#define P            BSLS_BSLTESTUTIL_P   \/\/ Print identifier and value.\n#define P_           BSLS_BSLTESTUTIL_P_  \/\/ P(X) without '\\n'.\n#define T_           BSLS_BSLTESTUTIL_T_  \/\/ Print a tab (w\/o newline).\n#define L_           BSLS_BSLTESTUTIL_L_  \/\/ current Line number\n\n\/\/ ============================================================================\n\/\/                  GLOBAL TYPEDEFS\/CONSTANTS FOR TESTING\n\/\/ ----------------------------------------------------------------------------\n\nstruct NonBitwiseDummy {\n    \/\/ Test class that is not bitwise moveable\n    int d_data;\n\n    explicit NonBitwiseDummy(int v = 0) : d_data(v) { }\n    NonBitwiseDummy(const NonBitwiseDummy& rhs) : d_data(rhs.d_data) {}\n};\n\n\/\/ ============================================================================\n\/\/                               TEST FACILITIES\n\/\/ ----------------------------------------------------------------------------\n\nstruct Dummy {\n    void operator&();\n    const Dummy *localAddressOf() const { return this; }\n};\nbool isConst(Dummy&) { return false; }\nbool isConst(const Dummy&) { return true; }\n    \/\/ These functions are used solely to verify that a 'reference_wrapper' can\n    \/\/ be passed to a function expecting an actual reference.\n\n\/\/ ============================================================================\n\/\/              USAGE EXAMPLE CLASSES AND FUNCTIONS\n\/\/ ----------------------------------------------------------------------------\n\n\/\/ Disable specific bde_verify warnings where practice of usage example may\n\/\/ differ.\n\n\/\/ BDE_VERIFY pragma: push\n\/\/ BDE_VERIFY pragma: -FD01  \/\/ Function needs contract, we probably should fix\n\/\/ BDE_VERIFY pragma: -IND01 \/\/ Code is aligned as-if following a '\/\/' comment\n\n\nnamespace TEST_CASE_USAGE {\n\n\/\/\/Usage\n\/\/\/-----\n\/\/ This section illustrates intended use of this component.\n\/\/\n\/\/\/Example 1: Sorted References\n\/\/\/ - - - - - - - - - - - - - -\n\/\/ Let us suppose that we wish to handle objects that will be passed to a\n\/\/ comparison function expecting references to the objects.  Let us suppose\n\/\/ further that these objects are large enough that we would not wish to move\n\/\/ them around bodily as they are sorted.  Note that plausible examples of uses\n\/\/ for this component are limited in freestanding C++98.\n\/\/\n\/\/ First, let us define the large-object type:\n\/\/..\n    struct Canary {\n        static const int s_size = 1000;\n        Canary *d_values[s_size];\n        Canary();\n    };\n\/\/..\n    Canary::Canary()\n    {\n         for (int i = 0; i < s_size; ++i) {\n             d_values[i] = this;\n         }\n    }\n\/\/..\n\/\/ Next, we define the comparison function:\n\/\/..\n    bool operator<(Canary const& a, Canary const& b)\n    {\n        return a.d_values[0] < b.d_values[0];\n    }\n\/\/..\n\/\/ Finally, we define a generic function to sort two items:\n\/\/..\n    template <class T>\n    void sortTwoItems(T& a, T& b)\n    {\n        if (b < a) {\n            T tmp(a);\n            a = b;\n            b = tmp;\n        }\n    }\n\/\/..\n}  \/\/ close namespace TEST_CASE_USAGE\n\n\/\/ BDE_VERIFY pragma: pop\n\n\/\/ ============================================================================\n\/\/                                 MAIN PROGRAM\n\/\/ ----------------------------------------------------------------------------\n\nint main(int argc, char *argv[])\n{\n    int                 test = argc > 1 ? atoi(argv[1]) : 0;\n    bool             verbose = argc > 2;\n    bool         veryVerbose = argc > 3;\n    bool     veryVeryVerbose = argc > 4;\n    bool veryVeryVeryVerbose = argc > 5;\n\n    (void)        veryVerbose;  \/\/ unused variable warning\n    (void)    veryVeryVerbose;  \/\/ unused variable warning\n    (void)veryVeryVeryVerbose;  \/\/ unused variable warning\n\n    printf(\"TEST \" __FILE__ \" CASE %d\\n\", test);\n\n    switch (test) { case 0:\n      case 3: {\n        \/\/ --------------------------------------------------------------------\n        \/\/ USAGE EXAMPLE\n        \/\/   Extracted from component header file.\n        \/\/\n        \/\/ Concerns:\n        \/\/: 1 The usage example in the component header file compiles, links,\n        \/\/    and runs as shown.\n        \/\/\n        \/\/ Plan:\n        \/\/: 1 Incorporate usage example from header into test driver, remove\n        \/\/:   leading comment characters, and replace 'assert' with 'ASSERT'.\n        \/\/:   (C-1)\n        \/\/\n        \/\/ Testing:\n        \/\/   USAGE EXAMPLE\n        \/\/ --------------------------------------------------------------------\n\n        if (verbose) {\n            printf(\"\\nUSAGE EXAMPLE\"\n                   \"\\n=============\\n\");\n        }\n\n        using namespace TEST_CASE_USAGE;\n\n\/\/ Disable specific bde_verify warnings where practice of usage example may\n\/\/ differ.\n\n\/\/ BDE_VERIFY pragma: push\n\/\/ BDE_VERIFY pragma: -FD01  \/\/ Function needs contract, we probably should fix\n\/\/ BDE_VERIFY pragma: -IND01 \/\/ Code is aligned as-if following a '\/\/' comment\n\n\/\/..\n\/\/ We can call 'sortTwoItems' on wrappers representing 'Canary' objects\n\/\/ without need to move actual, large 'Canary' objects about.  In the call to\n\/\/ 'sortTwoItems', below, the 'operator=' used in it is that of\n\/\/ 'bsl::reference_wrapper<Canary>', but the 'operator<' used is the one\n\/\/ declared for 'Canary&' arguments.  All of the conversions needed are\n\/\/ applied implicitly:\n\/\/..\n    Canary canaries[2];\n\n    bsl::reference_wrapper<Canary> canaryA = bsl::ref(canaries[1]);\n    bsl::reference_wrapper<Canary> canaryB = bsl::ref(canaries[0]);\n    sortTwoItems(canaryA, canaryB);\n\/\/\n    ASSERT(&canaryA.get() == canaries);\n    ASSERT(&canaryB.get() == canaries + 1);\n\/\/..\n\n\/\/ BDE_VERIFY pragma: pop\n\n      } break;\n      case 2: {\n        \/\/ --------------------------------------------------------------------\n        \/\/ TYPE TRAITS\n        \/\/\n        \/\/ Concerns:\n        \/\/: 1 'bslmf::IsBitwiseMoveable<reference_wrapper<T>>::value' is\n        \/\/:   true regardless of the type of 'T'.\n        \/\/\n        \/\/ Plan:\n        \/\/: 1 For concern 1, instantiate 'reference_wrapper' with both bitwise\n        \/\/:   moveable and non-bitwise moveable types and verify that the\n        \/\/:   'bslmf::isBitwiseMovable' trait is true for both cases.\n        \/\/\n        \/\/ Testing:\n        \/\/    TYPE TRAITS\n        \/\/ --------------------------------------------------------------------\n\n        if (verbose) printf(\"\\nTYPE TRAITS\"\n                            \"\\n===========\\n\");\n\n        using BloombergLP::bslmf::IsBitwiseMoveable;\n        using bsl::reference_wrapper;\n\n        \/\/ First, verify that we have one bitwise movable type and one not\n        \/\/ bitwise moveable type.\n        ASSERT(  IsBitwiseMoveable<int>::value);\n        ASSERT(! IsBitwiseMoveable<NonBitwiseDummy>::value);\n\n        \/\/ Now test that 'reference_wrapper' is bitwise moveable in either\n        \/\/ case.\n        ASSERT(IsBitwiseMoveable<reference_wrapper<int> >::value);\n        ASSERT(IsBitwiseMoveable<reference_wrapper<NonBitwiseDummy> >::value);\n\n      } break;\n      case 1: {\n        \/\/ --------------------------------------------------------------------\n        \/\/ BASIC TESTS\n        \/\/   Create objects each possible way, verify they have the right\n        \/\/   contents and can be used in the standard ways.\n        \/\/\n        \/\/ Concerns:\n        \/\/: 1 Template functions defined are only checked by the compiler when\n        \/\/:   called, so all templates must be instantiated here.\n        \/\/:\n        \/\/: 2 The various functions' argument must be copied into the object\n        \/\/:   correctly.\n        \/\/:\n        \/\/: 3 The accessors must reproduce the various functions' argument\n        \/\/:   values.\n        \/\/\n        \/\/ Plan:\n        \/\/: 1 Define a dummy type.\n        \/\/:\n        \/\/: 2 Wrap the dummy type using each available method.\n        \/\/:\n        \/\/: 3 Use the wrappers' explicit and implicit accessors.  (C-1..3)\n        \/\/\n        \/\/ Testing:\n        \/\/   reference_wrapper(T&);\n        \/\/   reference_wrapper(const reference_wrapper<T>&);\n        \/\/   reference_wrapper<T>& operator=(reference_wrapper<T>&);\n        \/\/   operator T&() const;\n        \/\/   T& get() const;\n        \/\/   reference_wrapper<T> cref(const T&);\n        \/\/   reference_wrapper<T> cref(reference_wrapper<T>);\n        \/\/   reference_wrapper<T> ref(T&);\n        \/\/   reference_wrapper<T> ref(reference_wrapper<T>);\n        \/\/ --------------------------------------------------------------------\n\n        if (verbose) {\n            printf(\"\\nBASIC TESTS\"\n                   \"\\n===========\\n\");\n        }\n\n        Dummy       a;\n        const Dummy b = {};\n\n        ASSERT(!isConst(a) && isConst(b));  \/\/ Test 'isConst'.\n\n        bsl::reference_wrapper<      Dummy> rwa (a);\n        bsl::reference_wrapper<const Dummy> rwca(a);\n        bsl::reference_wrapper<const Dummy> rwcb(b);\n\n        bsl::reference_wrapper<      Dummy> copyrwa (rwa );\n        bsl::reference_wrapper<const Dummy> copyrwca(rwca);\n        bsl::reference_wrapper<const Dummy> copyrwcb(rwcb);\n\n        ASSERT(!isConst(rwa));  \/\/  Check conversion to ref type, constness.\n        ASSERT( isConst(rwca)); \/\/  Likewise.\n        ASSERT( isConst(rwcb));\n\n        copyrwa  = a;   \/\/ Assign from raw reference.\n        copyrwca = a;   \/\/ Likewise.\n        copyrwcb = b;\n\n        copyrwa  = rwa;     \/\/ Assign from other 'reference_wrapper'.\n        copyrwca = rwca;    \/\/ Likewise.\n        copyrwcb = rwcb;\n\n        Dummy&       rax  = rwa;    \/\/ Initialize from 'reference_wrapper'.\n        const Dummy& rcax = rwca;   \/\/ Likewise.\n        const Dummy& rcbx = rwcb;\n\n        Dummy&       ray  = bsl::ref(a);    \/\/ Initialize from ref result.\n        const Dummy& rcay = bsl::cref(a);   \/\/ Likewise.\n        const Dummy& rcby = bsl::cref(b);\n\n        ASSERT(!isConst(bsl::ref (a)));\n        ASSERT( isConst(bsl::cref(a)));\n        ASSERT( isConst(bsl::cref(b)));\n\n        ASSERT(!isConst(bsl::ref (rwa )));\n        ASSERT( isConst(bsl::cref(rwca)));\n        ASSERT( isConst(bsl::cref(rwcb)));\n\n        bsl::reference_wrapper<      Dummy> copyrwaz (bsl::ref(rwa ));\n        bsl::reference_wrapper<const Dummy> copyrwcaz(bsl::ref(rwca));\n        bsl::reference_wrapper<const Dummy> copyrwcbz(bsl::ref(rwcb));\n\n        bsl::reference_wrapper<const Dummy> copyrwcazb(bsl::cref(rwca));\n        bsl::reference_wrapper<const Dummy> copyrwcbzc(bsl::cref(rwcb));\n\n        Dummy c;\n\n        bsl::reference_wrapper<Dummy> assrwaz(bsl::ref(rwa));\n        assrwaz = a;\n        assrwaz = c;\n        assrwaz = rwa;\n\n        bsl::reference_wrapper<const Dummy> assrwcaz(bsl::ref(rwca));\n        assrwcaz = b;\n        assrwcaz = c;\n        assrwcaz = rwca;\n        assrwcaz = rwcb;\n\n        ASSERT(copyrwa.get().localAddressOf() == a.localAddressOf());\n        ASSERT(copyrwca.get().localAddressOf() == a.localAddressOf());\n        ASSERT(copyrwcb.get().localAddressOf() == b.localAddressOf());\n        ASSERT(copyrwaz.get().localAddressOf() == a.localAddressOf());\n        ASSERT(copyrwcaz.get().localAddressOf() == a.localAddressOf());\n        ASSERT(copyrwcbz.get().localAddressOf() == b.localAddressOf());\n\n        \/\/ These do not test much, but they seem preferable to \"void(e)\":\n\n        ASSERT(rax.localAddressOf() == a.localAddressOf());\n        ASSERT(rcax.localAddressOf() == a.localAddressOf());\n        ASSERT(rcbx.localAddressOf() == b.localAddressOf());\n        ASSERT(ray.localAddressOf() == a.localAddressOf());\n        ASSERT(rcay.localAddressOf() == a.localAddressOf());\n        ASSERT(rcby.localAddressOf() == b.localAddressOf());\n        ASSERT(copyrwcazb.get().localAddressOf() == a.localAddressOf());\n        ASSERT(copyrwcbzc.get().localAddressOf() == b.localAddressOf());\n      } break;\n      default: {\n        fprintf(stderr, \"WARNING: CASE `%d' NOT FOUND.\\n\", test);\n        testStatus = -1;\n      }\n    }\n\n    if (testStatus > 0) {\n        fprintf(stderr, \"Error, non-zero test status = %d.\\n\", testStatus);\n    }\n    return testStatus;\n}\n\n\/\/ ----------------------------------------------------------------------------\n\/\/ Copyright 2013 Bloomberg Finance L.P.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/ ----------------------------- END-OF-FILE ----------------------------------\n<commit_msg>bslstl_referencewrapper trivial typo, no drqs<commit_after>\/\/ bslstl_referencewrapper.t.cpp                                      -*-C++-*-\n#include <bslstl_referencewrapper.h>\n\n#include <bsls_bsltestutil.h>\n\n#include <iostream>\n#include <stdio.h>\n#include <stdlib.h>\n\n\/\/ ============================================================================\n\/\/                              TEST PLAN\n\/\/ ----------------------------------------------------------------------------\n\/\/                              Overview\n\/\/                              --------\n\/\/ The component under test is fully specified by the standard, verifiable by\n\/\/ inspection.  Therefore, testing only exercises basic uses to ensure template\n\/\/ specializations may be instantiated successfully.\n\/\/\n\/\/ ----------------------------------------------------------------------------\n\/\/ TESTING INSTANTIATIONS AND BASIC FUNCTIONALITY\n\/\/ [ 1] reference_wrapper(T&);\n\/\/ [ 1] reference_wrapper(const reference_wrapper<T>&);\n\/\/ [ 1] reference_wrapper<T>& operator=(reference_wrapper<T>&);\n\/\/ [ 1] operator T&() const;\n\/\/ [ 1] T& get() const;\n\/\/ [ 1] reference_wrapper<T> cref(const T&);\n\/\/ [ 1] reference_wrapper<T> cref(reference_wrapper<T>);\n\/\/ [ 1] reference_wrapper<T> ref(T&);\n\/\/ [ 1] reference_wrapper<T> ref(reference_wrapper<T>);\n\/\/ ----------------------------------------------------------------------------\n\/\/ [ 3] USAGE EXAMPLE\n\/\/ [ 2] TYPE TRAITS\n\n\/\/ ============================================================================\n\/\/                  STANDARD BSL ASSERT TEST FUNCTION\n\/\/ ----------------------------------------------------------------------------\n\nnamespace {\n\nint testStatus = 0;\n\nvoid aSsErT(bool condition, const char *message, int line)\n{\n    if (condition) {\n        printf(\"Error \" __FILE__ \"(%d): %s    (failed)\\n\", line, message);\n\n        if (0 <= testStatus && testStatus <= 100) {\n            ++testStatus;\n        }\n    }\n}\n\n}  \/\/ close unnamed namespace\n\n\/\/ ============================================================================\n\/\/               STANDARD BSL TEST DRIVER MACRO ABBREVIATIONS\n\/\/ ----------------------------------------------------------------------------\n\n#define ASSERT       BSLS_BSLTESTUTIL_ASSERT\n#define ASSERTV      BSLS_BSLTESTUTIL_ASSERTV\n\n#define LOOP_ASSERT  BSLS_BSLTESTUTIL_LOOP_ASSERT\n#define LOOP0_ASSERT BSLS_BSLTESTUTIL_LOOP0_ASSERT\n#define LOOP1_ASSERT BSLS_BSLTESTUTIL_LOOP1_ASSERT\n#define LOOP2_ASSERT BSLS_BSLTESTUTIL_LOOP2_ASSERT\n#define LOOP3_ASSERT BSLS_BSLTESTUTIL_LOOP3_ASSERT\n#define LOOP4_ASSERT BSLS_BSLTESTUTIL_LOOP4_ASSERT\n#define LOOP5_ASSERT BSLS_BSLTESTUTIL_LOOP5_ASSERT\n#define LOOP6_ASSERT BSLS_BSLTESTUTIL_LOOP6_ASSERT\n\n#define Q            BSLS_BSLTESTUTIL_Q   \/\/ Quote identifier literally.\n#define P            BSLS_BSLTESTUTIL_P   \/\/ Print identifier and value.\n#define P_           BSLS_BSLTESTUTIL_P_  \/\/ P(X) without '\\n'.\n#define T_           BSLS_BSLTESTUTIL_T_  \/\/ Print a tab (w\/o newline).\n#define L_           BSLS_BSLTESTUTIL_L_  \/\/ current Line number\n\n\/\/ ============================================================================\n\/\/                  GLOBAL TYPEDEFS\/CONSTANTS FOR TESTING\n\/\/ ----------------------------------------------------------------------------\n\nstruct NonBitwiseDummy {\n    \/\/ Test class that is not bitwise moveable\n    int d_data;\n\n    explicit NonBitwiseDummy(int v = 0) : d_data(v) { }\n    NonBitwiseDummy(const NonBitwiseDummy& rhs) : d_data(rhs.d_data) {}\n};\n\n\/\/ ============================================================================\n\/\/                               TEST FACILITIES\n\/\/ ----------------------------------------------------------------------------\n\nstruct Dummy {\n    void operator&();\n    const Dummy *localAddressOf() const { return this; }\n};\nbool isConst(Dummy&) { return false; }\nbool isConst(const Dummy&) { return true; }\n    \/\/ These functions are used solely to verify that a 'reference_wrapper' can\n    \/\/ be passed to a function expecting an actual reference.\n\n\/\/ ============================================================================\n\/\/              USAGE EXAMPLE CLASSES AND FUNCTIONS\n\/\/ ----------------------------------------------------------------------------\n\n\/\/ Disable specific bde_verify warnings where practice of usage example may\n\/\/ differ.\n\n\/\/ BDE_VERIFY pragma: push\n\/\/ BDE_VERIFY pragma: -FD01  \/\/ Function needs contract, we probably should fix\n\/\/ BDE_VERIFY pragma: -IND01 \/\/ Code is aligned as-if following a '\/\/' comment\n\n\nnamespace TEST_CASE_USAGE {\n\n\/\/\/Usage\n\/\/\/-----\n\/\/ This section illustrates intended use of this component.\n\/\/\n\/\/\/Example 1: Sorted References\n\/\/\/ - - - - - - - - - - - - - -\n\/\/ Let us suppose that we wish to handle objects that will be passed to a\n\/\/ comparison function expecting references to the objects.  Let us suppose\n\/\/ further that these objects are large enough that we would not wish to move\n\/\/ them around bodily as they are sorted.  Note that plausible examples of uses\n\/\/ for this component are limited in freestanding C++98.\n\/\/\n\/\/ First, let us define the large-object type:\n\/\/..\n    struct Canary {\n        static const int s_size = 1000;\n        Canary *d_values[s_size];\n        Canary();\n    };\n\/\/..\n    Canary::Canary()\n    {\n         for (int i = 0; i < s_size; ++i) {\n             d_values[i] = this;\n         }\n    }\n\/\/..\n\/\/ Next, we define the comparison function:\n\/\/..\n    bool operator<(Canary const& a, Canary const& b)\n    {\n        return a.d_values[0] < b.d_values[0];\n    }\n\/\/..\n\/\/ Finally, we define a generic function to sort two items:\n\/\/..\n    template <class T>\n    void sortTwoItems(T& a, T& b)\n    {\n        if (b < a) {\n            T tmp(a);\n            a = b;\n            b = tmp;\n        }\n    }\n\/\/..\n}  \/\/ close namespace TEST_CASE_USAGE\n\n\/\/ BDE_VERIFY pragma: pop\n\n\/\/ ============================================================================\n\/\/                                 MAIN PROGRAM\n\/\/ ----------------------------------------------------------------------------\n\nint main(int argc, char *argv[])\n{\n    int                 test = argc > 1 ? atoi(argv[1]) : 0;\n    bool             verbose = argc > 2;\n    bool         veryVerbose = argc > 3;\n    bool     veryVeryVerbose = argc > 4;\n    bool veryVeryVeryVerbose = argc > 5;\n\n    (void)        veryVerbose;  \/\/ unused variable warning\n    (void)    veryVeryVerbose;  \/\/ unused variable warning\n    (void)veryVeryVeryVerbose;  \/\/ unused variable warning\n\n    printf(\"TEST \" __FILE__ \" CASE %d\\n\", test);\n\n    switch (test) { case 0:\n      case 3: {\n        \/\/ --------------------------------------------------------------------\n        \/\/ USAGE EXAMPLE\n        \/\/   Extracted from component header file.\n        \/\/\n        \/\/ Concerns:\n        \/\/: 1 The usage example in the component header file compiles, links,\n        \/\/:   and runs as shown.\n        \/\/\n        \/\/ Plan:\n        \/\/: 1 Incorporate usage example from header into test driver, remove\n        \/\/:   leading comment characters, and replace 'assert' with 'ASSERT'.\n        \/\/:   (C-1)\n        \/\/\n        \/\/ Testing:\n        \/\/   USAGE EXAMPLE\n        \/\/ --------------------------------------------------------------------\n\n        if (verbose) {\n            printf(\"\\nUSAGE EXAMPLE\"\n                   \"\\n=============\\n\");\n        }\n\n        using namespace TEST_CASE_USAGE;\n\n\/\/ Disable specific bde_verify warnings where practice of usage example may\n\/\/ differ.\n\n\/\/ BDE_VERIFY pragma: push\n\/\/ BDE_VERIFY pragma: -FD01  \/\/ Function needs contract, we probably should fix\n\/\/ BDE_VERIFY pragma: -IND01 \/\/ Code is aligned as-if following a '\/\/' comment\n\n\/\/..\n\/\/ We can call 'sortTwoItems' on wrappers representing 'Canary' objects\n\/\/ without need to move actual, large 'Canary' objects about.  In the call to\n\/\/ 'sortTwoItems', below, the 'operator=' used in it is that of\n\/\/ 'bsl::reference_wrapper<Canary>', but the 'operator<' used is the one\n\/\/ declared for 'Canary&' arguments.  All of the conversions needed are\n\/\/ applied implicitly:\n\/\/..\n    Canary canaries[2];\n\n    bsl::reference_wrapper<Canary> canaryA = bsl::ref(canaries[1]);\n    bsl::reference_wrapper<Canary> canaryB = bsl::ref(canaries[0]);\n    sortTwoItems(canaryA, canaryB);\n\/\/\n    ASSERT(&canaryA.get() == canaries);\n    ASSERT(&canaryB.get() == canaries + 1);\n\/\/..\n\n\/\/ BDE_VERIFY pragma: pop\n\n      } break;\n      case 2: {\n        \/\/ --------------------------------------------------------------------\n        \/\/ TYPE TRAITS\n        \/\/\n        \/\/ Concerns:\n        \/\/: 1 'bslmf::IsBitwiseMoveable<reference_wrapper<T>>::value' is\n        \/\/:   true regardless of the type of 'T'.\n        \/\/\n        \/\/ Plan:\n        \/\/: 1 For concern 1, instantiate 'reference_wrapper' with both bitwise\n        \/\/:   moveable and non-bitwise moveable types and verify that the\n        \/\/:   'bslmf::isBitwiseMovable' trait is true for both cases.\n        \/\/\n        \/\/ Testing:\n        \/\/    TYPE TRAITS\n        \/\/ --------------------------------------------------------------------\n\n        if (verbose) printf(\"\\nTYPE TRAITS\"\n                            \"\\n===========\\n\");\n\n        using BloombergLP::bslmf::IsBitwiseMoveable;\n        using bsl::reference_wrapper;\n\n        \/\/ First, verify that we have one bitwise movable type and one not\n        \/\/ bitwise moveable type.\n        ASSERT(  IsBitwiseMoveable<int>::value);\n        ASSERT(! IsBitwiseMoveable<NonBitwiseDummy>::value);\n\n        \/\/ Now test that 'reference_wrapper' is bitwise moveable in either\n        \/\/ case.\n        ASSERT(IsBitwiseMoveable<reference_wrapper<int> >::value);\n        ASSERT(IsBitwiseMoveable<reference_wrapper<NonBitwiseDummy> >::value);\n\n      } break;\n      case 1: {\n        \/\/ --------------------------------------------------------------------\n        \/\/ BASIC TESTS\n        \/\/   Create objects each possible way, verify they have the right\n        \/\/   contents and can be used in the standard ways.\n        \/\/\n        \/\/ Concerns:\n        \/\/: 1 Template functions defined are only checked by the compiler when\n        \/\/:   called, so all templates must be instantiated here.\n        \/\/:\n        \/\/: 2 The various functions' argument must be copied into the object\n        \/\/:   correctly.\n        \/\/:\n        \/\/: 3 The accessors must reproduce the various functions' argument\n        \/\/:   values.\n        \/\/\n        \/\/ Plan:\n        \/\/: 1 Define a dummy type.\n        \/\/:\n        \/\/: 2 Wrap the dummy type using each available method.\n        \/\/:\n        \/\/: 3 Use the wrappers' explicit and implicit accessors.  (C-1..3)\n        \/\/\n        \/\/ Testing:\n        \/\/   reference_wrapper(T&);\n        \/\/   reference_wrapper(const reference_wrapper<T>&);\n        \/\/   reference_wrapper<T>& operator=(reference_wrapper<T>&);\n        \/\/   operator T&() const;\n        \/\/   T& get() const;\n        \/\/   reference_wrapper<T> cref(const T&);\n        \/\/   reference_wrapper<T> cref(reference_wrapper<T>);\n        \/\/   reference_wrapper<T> ref(T&);\n        \/\/   reference_wrapper<T> ref(reference_wrapper<T>);\n        \/\/ --------------------------------------------------------------------\n\n        if (verbose) {\n            printf(\"\\nBASIC TESTS\"\n                   \"\\n===========\\n\");\n        }\n\n        Dummy       a;\n        const Dummy b = {};\n\n        ASSERT(!isConst(a) && isConst(b));  \/\/ Test 'isConst'.\n\n        bsl::reference_wrapper<      Dummy> rwa (a);\n        bsl::reference_wrapper<const Dummy> rwca(a);\n        bsl::reference_wrapper<const Dummy> rwcb(b);\n\n        bsl::reference_wrapper<      Dummy> copyrwa (rwa );\n        bsl::reference_wrapper<const Dummy> copyrwca(rwca);\n        bsl::reference_wrapper<const Dummy> copyrwcb(rwcb);\n\n        ASSERT(!isConst(rwa));  \/\/  Check conversion to ref type, constness.\n        ASSERT( isConst(rwca)); \/\/  Likewise.\n        ASSERT( isConst(rwcb));\n\n        copyrwa  = a;   \/\/ Assign from raw reference.\n        copyrwca = a;   \/\/ Likewise.\n        copyrwcb = b;\n\n        copyrwa  = rwa;     \/\/ Assign from other 'reference_wrapper'.\n        copyrwca = rwca;    \/\/ Likewise.\n        copyrwcb = rwcb;\n\n        Dummy&       rax  = rwa;    \/\/ Initialize from 'reference_wrapper'.\n        const Dummy& rcax = rwca;   \/\/ Likewise.\n        const Dummy& rcbx = rwcb;\n\n        Dummy&       ray  = bsl::ref(a);    \/\/ Initialize from ref result.\n        const Dummy& rcay = bsl::cref(a);   \/\/ Likewise.\n        const Dummy& rcby = bsl::cref(b);\n\n        ASSERT(!isConst(bsl::ref (a)));\n        ASSERT( isConst(bsl::cref(a)));\n        ASSERT( isConst(bsl::cref(b)));\n\n        ASSERT(!isConst(bsl::ref (rwa )));\n        ASSERT( isConst(bsl::cref(rwca)));\n        ASSERT( isConst(bsl::cref(rwcb)));\n\n        bsl::reference_wrapper<      Dummy> copyrwaz (bsl::ref(rwa ));\n        bsl::reference_wrapper<const Dummy> copyrwcaz(bsl::ref(rwca));\n        bsl::reference_wrapper<const Dummy> copyrwcbz(bsl::ref(rwcb));\n\n        bsl::reference_wrapper<const Dummy> copyrwcazb(bsl::cref(rwca));\n        bsl::reference_wrapper<const Dummy> copyrwcbzc(bsl::cref(rwcb));\n\n        Dummy c;\n\n        bsl::reference_wrapper<Dummy> assrwaz(bsl::ref(rwa));\n        assrwaz = a;\n        assrwaz = c;\n        assrwaz = rwa;\n\n        bsl::reference_wrapper<const Dummy> assrwcaz(bsl::ref(rwca));\n        assrwcaz = b;\n        assrwcaz = c;\n        assrwcaz = rwca;\n        assrwcaz = rwcb;\n\n        ASSERT(copyrwa.get().localAddressOf() == a.localAddressOf());\n        ASSERT(copyrwca.get().localAddressOf() == a.localAddressOf());\n        ASSERT(copyrwcb.get().localAddressOf() == b.localAddressOf());\n        ASSERT(copyrwaz.get().localAddressOf() == a.localAddressOf());\n        ASSERT(copyrwcaz.get().localAddressOf() == a.localAddressOf());\n        ASSERT(copyrwcbz.get().localAddressOf() == b.localAddressOf());\n\n        \/\/ These do not test much, but they seem preferable to \"void(e)\":\n\n        ASSERT(rax.localAddressOf() == a.localAddressOf());\n        ASSERT(rcax.localAddressOf() == a.localAddressOf());\n        ASSERT(rcbx.localAddressOf() == b.localAddressOf());\n        ASSERT(ray.localAddressOf() == a.localAddressOf());\n        ASSERT(rcay.localAddressOf() == a.localAddressOf());\n        ASSERT(rcby.localAddressOf() == b.localAddressOf());\n        ASSERT(copyrwcazb.get().localAddressOf() == a.localAddressOf());\n        ASSERT(copyrwcbzc.get().localAddressOf() == b.localAddressOf());\n      } break;\n      default: {\n        fprintf(stderr, \"WARNING: CASE `%d' NOT FOUND.\\n\", test);\n        testStatus = -1;\n      }\n    }\n\n    if (testStatus > 0) {\n        fprintf(stderr, \"Error, non-zero test status = %d.\\n\", testStatus);\n    }\n    return testStatus;\n}\n\n\/\/ ----------------------------------------------------------------------------\n\/\/ Copyright 2013 Bloomberg Finance L.P.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/ ----------------------------- END-OF-FILE ----------------------------------\n<|endoftext|>"}
{"text":"<commit_before>\/\/ csabbg_functioncontract.t.cpp                                      -*-C++-*-\n\/\/ ----------------------------------------------------------------------------\n\n#include <bdes_ident.h>\n\nnamespace cool\n{\n    namespace csabbg\n    {\n        struct csabbg_a {\n            void ambry();\n\n            void diarrhetic(int faceplate);\n\n            void akee(int);\n\n            void unwitherable(int cocksfoot = 0);\n\n            void undersovereign(int = 0);\n\n            void etymologized(int windowpane, int mayer);\n\n            void rpt(int panelled, int);\n\n            void calumnious(int deferred, int trepanning = 0);\n\n            void tensimeter(int cisterna, int = 0);\n\n            void rhaetian(int, int heathenized);\n\n            void recalcitrancy(int, int);\n\n            void contracted(int, int cupid = 0);\n\n            void bludgeoner(int, int = 0);\n\n            void interjaculating(int improvability = 0, int erotes = 0);\n\n            void antired(int undertruck = 0, int = 0);\n\n            void aqueduct(int, int ouch);\n\n            void wiredancing(int, int nauplial = 0);\n\n            void rejustified(int, int);\n\n            void perishless(int, int = 0);\n\n            void spokeswoman(int = 0, int roebuck = 0);\n\n            void transisthmian(int = 0, int = 0);\n        };\n\n        struct csabbg_b {\n            void sequencer();\n                \/\/ This function does nothing, with no parameters.\n\n            void gandharan(int mujik);\n                \/\/ This function does nothing.\n\n            void decillionth(int peisenor);\n                \/\/ This function does nothing with 'peisenor'.\n\n            void brie(int bovaristic);\n                \/\/ This function does nothing with the specified bovaristic.\n\n            void modelled(int preinvited);\n                \/\/ This function does nothing with preinvited.\n\n            void unteamed(int);\n                \/\/ This function does nothing.\n\n            void unaccomplished(int atat = 0);\n                \/\/ This function does nothing.\n\n            void domenick(int periproctal = 0);\n                \/\/ This function does nothing with 'periproctal'.\n\n            void pollock(int snowslide = 0);\n                \/\/ This function does nothing with the specified snowslide.\n\n            void unperspicuous(int zakuski = 0);\n                \/\/ This function does nothing with zakuski.\n\n            void compared(int = 0);\n                \/\/ This function does nothing.\n\n            void denominative(int compellent = 0);\n                \/\/ Optionally specify compellent.\n\n            void breather(int nondeduction = 0);\n                \/\/ Optionally specify 'nondeduction'.\n        };\n\n        struct csabbg_c {\n            void disjoin(int unpioneering);\n                \/\/ This is the first useless line.\n                \/\/ This is the second useless line.\n                \/\/ The specified 'unpioneering'.\n                \/\/ This is the third useless line.\n                \/\/ This is the fourth useless line.\n\n            void velarize(int mermerus);\n                \/\/ This is the first useless line.\n                \/\/ This is the second useless line.\n                \/\/ The specified mermerus.\n                \/\/ This is the third useless line.\n                \/\/ This is the fourth useless line.\n\n            void fiddlestick(int meticulousness = 0);\n                \/\/ This is the first useless line.\n                \/\/ This is the second useless line.\n                \/\/ This function does nothing with meticulousness.\n                \/\/ This is the third useless line.\n                \/\/ This is the fourth useless line.\n\n            void denominative(int compellent = 0);\n                \/\/ This is the first useless line.\n                \/\/ This is the second useless line.\n                \/\/ This function does nothing with 'compellent'.\n                \/\/ This is the third useless line.\n                \/\/ This is the fourth useless line.\n        };\n\n        template <int N>\n        struct csabbg_d {\n            void understrapper(int gabrieli, int urdar);\n                \/\/ This function does nothing specified.\n                \/\/ Not with aurdar, urdara, aurdara.\n                \/\/ Not with agabrieli, gabrielia, agabrielia.\n            void sericite(int leucocythemia, int overmitigated);\n                \/\/ This function does nothing with the specified leucocythemia.\n                \/\/ Not with overmitigated, overmitigateda, overmitigateda.\n            void calliope(int votaress, int borasco);\n                \/\/ This function does nothing with the specified 'votaress'.\n                \/\/ Not with aborasco, borascoa, aborascoa.\n            void hypertocicity(int ash, int hythergraph);\n                \/\/ This function does nothing with the specified ash.\n            void orchis(int radiofrequency, int fracturable);\n                \/\/ This function does nothing with the specified radiofrequency\n                \/\/ or fracturable.\n            void cosech(int obicularis, int bethought);\n                \/\/ This function does nothing with the specified obicularis or\n                \/\/ 'bethought'.\n            void overflap(int nanometer, int unhypnotised);\n                \/\/ This function does nothing with the specified 'nanometer'.\n            void whine(int medieval, int anticonfederative);\n                \/\/ This function does nothing with the specified 'medieval' or\n                \/\/ anticonfederative.\n            void unavengeable(int learnedness, int ausable);\n                \/\/ This function does nothing with the specified 'learnedness'\n                \/\/ or 'ausable'.\n\n            void tribromoethanol(int evtushenko, int);\n                \/\/ This function does nothing specified.\n                \/\/ Not with aevtushenko, evtushenkoa, aevtushenkoa.\n            void unulcerated(int rakee, int);\n                \/\/ This function does nothing with the specified rakee.\n            void nco(int isadore, int);\n                \/\/ This function does nothing with the specified 'isadore'.\n\n            void oversewed(int hydrodynamic, int customariness = 0);\n                \/\/ This function does nothing specified.\n                \/\/ Not with acustomariness, customarinessa, or acustomarinessa.\n                \/\/ Not with ahydrodynamic, hydrodynamica, or ahydrodynamica.\n            void unthanked(int misdefine, int pandiculation = 0);\n                \/\/ This function does nothing with the specified misdefine.\n            void sheatfish(int fishfinger, int euhemerised = 0);\n                \/\/ This function does nothing with the specified 'fishfinger'.\n            void duea(int concupiscence, int grok = 0);\n                \/\/ This function does nothing with the specified concupiscence.\n            void coquetted(int coleuses, int undeified = 0);\n                \/\/ This function does nothing with the specified coleuses.\n                \/\/ Optionally specify undeified.\n            void unfatalistic(int myoneurasthenia, int tyrannicide = 0);\n                \/\/ This function does nothing with the specified\n                \/\/ myoneurasthenia. Optionally, 'tyrannicide'.\n            void garamond(int valadon, int ridgel = 0);\n                \/\/ This function does nothing with the specified 'valadon'.\n            void infrequent(int kistna, int hereward = 0);\n                \/\/ This function does nothing with the specified 'kistna'.\n                \/\/ Optionally specify hereward.\n            void blackishness(int turki, int subcubic = 0);\n                \/\/ This function does nothing with the specified 'turki'.\n                \/\/ Optionally specify 'subcubic'.\n\n            void sponson(int zestful, int = 0);\n                \/\/ This function does nothing specified.\n                \/\/ Not with azestful, zestfula, or azestfula.\n            void nominating(int unbaked, int = 0);\n                \/\/ This function does nothing with the specified unbaked.\n            void collinearly(int camerlingo, int = 0);\n                \/\/ This function does nothing with the specified 'camerlingo'.\n\n            void fearfulness(int, int fratry);\n                \/\/ This function does nothing specified.\n            void overture(int, int fluffy);\n                \/\/ This function does nothing with the specified fluffy.\n            void unsported(int, int hospitably);\n                \/\/ This function does nothing with the specified 'hospitably'.\n\n            void crampoon(int, int);\n                \/\/ This function does nothing specified.\n\n            void tenantry(int, int campion = 0);\n                \/\/ This function does nothing specified.\n                \/\/ Not with acampion, campiona, or acampiona.\n            void totalling(int, int amphithecium = 0);\n                \/\/ This function does nothing with the specified amphithecium.\n            void hierophantic(int, int unpopularized = 0);\n                \/\/ This function does nothing with the specified\n                \/\/ 'unpopularized'.\n\n            void hepplewhite(int, int = 0);\n                \/\/ This function does nothing specified.\n\n            void predominance(int latinism = 0, int oversilence = 0);\n                \/\/ This function does nothing specified.\n            void monorhyme(int marceau = 0, int amazon = 0);\n                \/\/ Optionally specify marceau.\n            void premiating(int litu = 0, int beadflush = 0);\n                \/\/ Optionally specify 'litu'.\n            void influencer(int nonlaminating = 0, int dittying = 0);\n                \/\/ Optionally specify nonlaminating.\n            void dichotomization(int kwazulu = 0, int dinkier = 0);\n                \/\/ Optionally specify kwazulu and dinkier.\n            void conduced(int gateless = 0, int outrigged = 0);\n                \/\/ Optionally specify gateless and 'outrigged'.\n            void breadfruit(int stinnett = 0, int apprenticehood = 0);\n                \/\/ Optionally specify 'stinnett'.\n            void ethnic(int unsmelted = 0, int herbivore = 0);\n                \/\/ Optionally specify 'unsmelted' and herbivore.\n            void ossetic(int subtilized = 0, int fulminatory = 0);\n                \/\/ Optionally specify 'subtilized' and 'fulminatory'.\n\n            void noncollaboration(int coronach = 0, int = 0);\n                \/\/ This function does nothing specified.\n            void ariminum(int luxuriantly = 0, int = 0);\n                \/\/ Optionally specify luxuriantly.\n            void boycott(int many = 0, int = 0);\n                \/\/ Optionally specify 'many'.\n\n            void hatfield(int, int consortion);\n                \/\/ This function does nothing specified.\n            void cossie(int, int uncoarse);\n                \/\/ This function does nothing with the specified uncoarse.\n            void pencillike(int, int nonanarchic);\n                \/\/ This function does nothing with the specified 'nonanarchic'.\n\n            void sonderclass(int, int monodactylism = 0);\n                \/\/ This function does nothing specified.\n            void hade(int, int unhooted = 0);\n                \/\/ Optionally specify unhooted.\n            void milanaise(int, int contactual = 0);\n                \/\/ Optionally specify 'contactual'.\n\n            void nonschizophrenic(int, int);\n                \/\/ This function does nothing.\n\n            void stanton(int, int = 0);\n                \/\/ This function does nothing.\n\n            void pseudoreligious(int = 0, int connotation = 0);\n                \/\/ Optionally specify nothing.\n            void unpredicated(int = 0, int monecious = 0);\n                \/\/ Optionally specify monecious.\n            void tranquillize(int = 0, int misaccused = 0);\n                \/\/ Optionally specify 'misaccused'.\n\n            void retractation(int = 0, int = 0);\n                \/\/ This function does nothing.\n        };\n\n        struct casabbg_e {\n            void aboriginal();\n\/\/ Way too left.\n\n            void insider();\n        \/\/ A lot too left.\n\n            void decontrolling();\n            \/\/ Too left.\n\n            void pentacle();\n               \/\/ A bit too left.\n\n            void lamentations();\n                \/\/ Just right.\n\n            void empiricist();\n                 \/\/ A bit too right.\n\n            void rootworm();\n                                                              \/\/ Way too right.\n        };\n\n        inline void rigoristic()\n            \/\/ This function does nothing.\n        {\n        }\n\n        inline void spall()\n        {\n        }\n\n        struct casabbg_g {\n            void fragrant(int horoscopic,\n                          int zealous) const;\n                \/\/ This is the first useless line.\n                \/\/ This is the second useless line.\n                \/\/ This function does nothing with the specified 'zealous' and\n                \/\/ not much with the specified 'horoscopic' either.\n                \/\/ This is the third useless line.\n                \/\/ This is the fourth useless line.\n        };\n\n        void aSsErT();\n    }\n}\n<commit_msg>Make some of the methods cont, throw(), or both.<commit_after>\/\/ csabbg_functioncontract.t.cpp                                      -*-C++-*-\n\/\/ ----------------------------------------------------------------------------\n\n#include <bdes_ident.h>\n\nnamespace cool\n{\n    namespace csabbg\n    {\n        struct csabbg_a {\n            void ambry() const;\n\n            void diarrhetic(int faceplate) throw();\n\n            void akee(int) const throw();\n\n            void unwitherable(int cocksfoot = 0);\n\n            void undersovereign(int = 0);\n\n            void etymologized(int windowpane, int mayer);\n\n            void rpt(int panelled, int);\n\n            void calumnious(int deferred, int trepanning = 0);\n\n            void tensimeter(int cisterna, int = 0);\n\n            void rhaetian(int, int heathenized);\n\n            void recalcitrancy(int, int);\n\n            void contracted(int, int cupid = 0);\n\n            void bludgeoner(int, int = 0);\n\n            void interjaculating(int improvability = 0, int erotes = 0);\n\n            void antired(int undertruck = 0, int = 0);\n\n            void aqueduct(int, int ouch);\n\n            void wiredancing(int, int nauplial = 0);\n\n            void rejustified(int, int);\n\n            void perishless(int, int = 0);\n\n            void spokeswoman(int = 0, int roebuck = 0);\n\n            void transisthmian(int = 0, int = 0);\n        };\n\n        struct csabbg_b {\n            void sequencer() const;\n                \/\/ This function does nothing, with no parameters.\n\n            void gandharan(int mujik) throw();\n                \/\/ This function does nothing.\n\n            void decillionth(int peisenor) const throw();\n                \/\/ This function does nothing with 'peisenor'.\n\n            void brie(int bovaristic);\n                \/\/ This function does nothing with the specified bovaristic.\n\n            void modelled(int preinvited);\n                \/\/ This function does nothing with preinvited.\n\n            void unteamed(int);\n                \/\/ This function does nothing.\n\n            void unaccomplished(int atat = 0);\n                \/\/ This function does nothing.\n\n            void domenick(int periproctal = 0);\n                \/\/ This function does nothing with 'periproctal'.\n\n            void pollock(int snowslide = 0);\n                \/\/ This function does nothing with the specified snowslide.\n\n            void unperspicuous(int zakuski = 0);\n                \/\/ This function does nothing with zakuski.\n\n            void compared(int = 0);\n                \/\/ This function does nothing.\n\n            void denominative(int compellent = 0);\n                \/\/ Optionally specify compellent.\n\n            void breather(int nondeduction = 0);\n                \/\/ Optionally specify 'nondeduction'.\n        };\n\n        struct csabbg_c {\n            void disjoin(int unpioneering);\n                \/\/ This is the first useless line.\n                \/\/ This is the second useless line.\n                \/\/ The specified 'unpioneering'.\n                \/\/ This is the third useless line.\n                \/\/ This is the fourth useless line.\n\n            void velarize(int mermerus);\n                \/\/ This is the first useless line.\n                \/\/ This is the second useless line.\n                \/\/ The specified mermerus.\n                \/\/ This is the third useless line.\n                \/\/ This is the fourth useless line.\n\n            void fiddlestick(int meticulousness = 0);\n                \/\/ This is the first useless line.\n                \/\/ This is the second useless line.\n                \/\/ This function does nothing with meticulousness.\n                \/\/ This is the third useless line.\n                \/\/ This is the fourth useless line.\n\n            void denominative(int compellent = 0);\n                \/\/ This is the first useless line.\n                \/\/ This is the second useless line.\n                \/\/ This function does nothing with 'compellent'.\n                \/\/ This is the third useless line.\n                \/\/ This is the fourth useless line.\n        };\n\n        template <int N>\n        struct csabbg_d {\n            void understrapper(int gabrieli, int urdar);\n                \/\/ This function does nothing specified.\n                \/\/ Not with aurdar, urdara, aurdara.\n                \/\/ Not with agabrieli, gabrielia, agabrielia.\n            void sericite(int leucocythemia, int overmitigated);\n                \/\/ This function does nothing with the specified leucocythemia.\n                \/\/ Not with overmitigated, overmitigateda, overmitigateda.\n            void calliope(int votaress, int borasco);\n                \/\/ This function does nothing with the specified 'votaress'.\n                \/\/ Not with aborasco, borascoa, aborascoa.\n            void hypertocicity(int ash, int hythergraph);\n                \/\/ This function does nothing with the specified ash.\n            void orchis(int radiofrequency, int fracturable);\n                \/\/ This function does nothing with the specified radiofrequency\n                \/\/ or fracturable.\n            void cosech(int obicularis, int bethought);\n                \/\/ This function does nothing with the specified obicularis or\n                \/\/ 'bethought'.\n            void overflap(int nanometer, int unhypnotised);\n                \/\/ This function does nothing with the specified 'nanometer'.\n            void whine(int medieval, int anticonfederative);\n                \/\/ This function does nothing with the specified 'medieval' or\n                \/\/ anticonfederative.\n            void unavengeable(int learnedness, int ausable);\n                \/\/ This function does nothing with the specified 'learnedness'\n                \/\/ or 'ausable'.\n\n            void tribromoethanol(int evtushenko, int);\n                \/\/ This function does nothing specified.\n                \/\/ Not with aevtushenko, evtushenkoa, aevtushenkoa.\n            void unulcerated(int rakee, int);\n                \/\/ This function does nothing with the specified rakee.\n            void nco(int isadore, int);\n                \/\/ This function does nothing with the specified 'isadore'.\n\n            void oversewed(int hydrodynamic, int customariness = 0);\n                \/\/ This function does nothing specified.\n                \/\/ Not with acustomariness, customarinessa, or acustomarinessa.\n                \/\/ Not with ahydrodynamic, hydrodynamica, or ahydrodynamica.\n            void unthanked(int misdefine, int pandiculation = 0);\n                \/\/ This function does nothing with the specified misdefine.\n            void sheatfish(int fishfinger, int euhemerised = 0);\n                \/\/ This function does nothing with the specified 'fishfinger'.\n            void duea(int concupiscence, int grok = 0);\n                \/\/ This function does nothing with the specified concupiscence.\n            void coquetted(int coleuses, int undeified = 0);\n                \/\/ This function does nothing with the specified coleuses.\n                \/\/ Optionally specify undeified.\n            void unfatalistic(int myoneurasthenia, int tyrannicide = 0);\n                \/\/ This function does nothing with the specified\n                \/\/ myoneurasthenia. Optionally, 'tyrannicide'.\n            void garamond(int valadon, int ridgel = 0);\n                \/\/ This function does nothing with the specified 'valadon'.\n            void infrequent(int kistna, int hereward = 0);\n                \/\/ This function does nothing with the specified 'kistna'.\n                \/\/ Optionally specify hereward.\n            void blackishness(int turki, int subcubic = 0);\n                \/\/ This function does nothing with the specified 'turki'.\n                \/\/ Optionally specify 'subcubic'.\n\n            void sponson(int zestful, int = 0);\n                \/\/ This function does nothing specified.\n                \/\/ Not with azestful, zestfula, or azestfula.\n            void nominating(int unbaked, int = 0);\n                \/\/ This function does nothing with the specified unbaked.\n            void collinearly(int camerlingo, int = 0);\n                \/\/ This function does nothing with the specified 'camerlingo'.\n\n            void fearfulness(int, int fratry);\n                \/\/ This function does nothing specified.\n            void overture(int, int fluffy);\n                \/\/ This function does nothing with the specified fluffy.\n            void unsported(int, int hospitably);\n                \/\/ This function does nothing with the specified 'hospitably'.\n\n            void crampoon(int, int);\n                \/\/ This function does nothing specified.\n\n            void tenantry(int, int campion = 0);\n                \/\/ This function does nothing specified.\n                \/\/ Not with acampion, campiona, or acampiona.\n            void totalling(int, int amphithecium = 0);\n                \/\/ This function does nothing with the specified amphithecium.\n            void hierophantic(int, int unpopularized = 0);\n                \/\/ This function does nothing with the specified\n                \/\/ 'unpopularized'.\n\n            void hepplewhite(int, int = 0);\n                \/\/ This function does nothing specified.\n\n            void predominance(int latinism = 0, int oversilence = 0);\n                \/\/ This function does nothing specified.\n            void monorhyme(int marceau = 0, int amazon = 0);\n                \/\/ Optionally specify marceau.\n            void premiating(int litu = 0, int beadflush = 0);\n                \/\/ Optionally specify 'litu'.\n            void influencer(int nonlaminating = 0, int dittying = 0);\n                \/\/ Optionally specify nonlaminating.\n            void dichotomization(int kwazulu = 0, int dinkier = 0);\n                \/\/ Optionally specify kwazulu and dinkier.\n            void conduced(int gateless = 0, int outrigged = 0);\n                \/\/ Optionally specify gateless and 'outrigged'.\n            void breadfruit(int stinnett = 0, int apprenticehood = 0);\n                \/\/ Optionally specify 'stinnett'.\n            void ethnic(int unsmelted = 0, int herbivore = 0);\n                \/\/ Optionally specify 'unsmelted' and herbivore.\n            void ossetic(int subtilized = 0, int fulminatory = 0);\n                \/\/ Optionally specify 'subtilized' and 'fulminatory'.\n\n            void noncollaboration(int coronach = 0, int = 0);\n                \/\/ This function does nothing specified.\n            void ariminum(int luxuriantly = 0, int = 0);\n                \/\/ Optionally specify luxuriantly.\n            void boycott(int many = 0, int = 0);\n                \/\/ Optionally specify 'many'.\n\n            void hatfield(int, int consortion);\n                \/\/ This function does nothing specified.\n            void cossie(int, int uncoarse);\n                \/\/ This function does nothing with the specified uncoarse.\n            void pencillike(int, int nonanarchic);\n                \/\/ This function does nothing with the specified 'nonanarchic'.\n\n            void sonderclass(int, int monodactylism = 0);\n                \/\/ This function does nothing specified.\n            void hade(int, int unhooted = 0);\n                \/\/ Optionally specify unhooted.\n            void milanaise(int, int contactual = 0);\n                \/\/ Optionally specify 'contactual'.\n\n            void nonschizophrenic(int, int);\n                \/\/ This function does nothing.\n\n            void stanton(int, int = 0);\n                \/\/ This function does nothing.\n\n            void pseudoreligious(int = 0, int connotation = 0);\n                \/\/ Optionally specify nothing.\n            void unpredicated(int = 0, int monecious = 0);\n                \/\/ Optionally specify monecious.\n            void tranquillize(int = 0, int misaccused = 0);\n                \/\/ Optionally specify 'misaccused'.\n\n            void retractation(int = 0, int = 0);\n                \/\/ This function does nothing.\n        };\n\n        struct casabbg_e {\n            void aboriginal();\n\/\/ Way too left.\n\n            void insider();\n        \/\/ A lot too left.\n\n            void decontrolling();\n            \/\/ Too left.\n\n            void pentacle();\n               \/\/ A bit too left.\n\n            void lamentations();\n                \/\/ Just right.\n\n            void empiricist();\n                 \/\/ A bit too right.\n\n            void rootworm();\n                                                              \/\/ Way too right.\n        };\n\n        inline void rigoristic()\n            \/\/ This function does nothing.\n        {\n        }\n\n        inline void spall()\n        {\n        }\n\n        struct casabbg_g {\n            void fragrant(int horoscopic,\n                          int zealous) const;\n                \/\/ This is the first useless line.\n                \/\/ This is the second useless line.\n                \/\/ This function does nothing with the specified 'zealous' and\n                \/\/ not much with the specified 'horoscopic' either.\n                \/\/ This is the third useless line.\n                \/\/ This is the fourth useless line.\n        };\n\n        void aSsErT();\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* unixdrop.cpp -- Implementation of class KUnixDrop.\n* Author:\tSirtaj Singh Kang\n* Version:\t$Id$\n* Generated:\tSun Nov 30 23:28:07 EST 1997\n*\/\n\n\n#include <stdio.h>\n#include <ctype.h>\n#include <string.h>\n#include <stdlib.h>\n#include <assert.h>\n#include <time.h>\n\n#include\"dropdlg.h\"\n\n#include <qfileinfo.h>\n#include <qapplication.h>\n#include <kdebug.h>\n\n#include<kconfigbase.h>\n\n#include \"utils.h\"\n#include \"unixcfg.h\"\n#include \"unixdrop.h\"\n#include \"mailsubject.h\"\n#include <kmime_util.h>\n#include \"intid.h\"\n\n#define MAXSTR (1024)\n\nstatic bool checkfrom(const char *buffer);\nstatic const char *compareHeader(const char *header, const char *field);\n\n\nKUnixDrop::KUnixDrop()\n\t: KPollableDrop(),\n\t_lastMod\t( new QDateTime ),\n\t_info\t\t( new QFileInfo ),\n\t_lockInfo\t( new QFileInfo ),\n\t_lastSize\t( 0 ),\n\t_valid\t\t( false ),\n\t_buffer\t\t( 0 ),\n\t_totalCount\t( 0 )\n\n{\n}\n\nKUnixDrop::~KUnixDrop()\n{\n\tstopMonitor();\n\n\tdelete _lastMod;\n\tdelete _info;\n\tdelete _lockInfo;\n\n\tif( _buffer ) {\n\t\tdelete [] _buffer;\n\t}\n}\n\nvoid KUnixDrop::recheck()\n{\n\tif( valid() && !locked() && touched() ) {\n\t  \/\/kdDebug() << \"KUnixDrop: checking\" << endl;\n\t\tint messages = doCount();\n\n\t\tif( messages != count() ) {\n\t\t\temit changed( messages );\n\t\t}\n\t}\n#if 0\n\telse {\n\t    kdDebug() << \"KUnixDrop: not checking - mbox \" << (valid()?\"\":\"not \") << \"valid, \" << (locked()?\"\":\"not \") << \"locked, \" << (touched()?\"\":\"not \") << \"touched\" << endl;\n\t}\n#endif\n}\n\nbool KUnixDrop::valid()\n{\n\treturn _valid;\n}\n\nbool KUnixDrop::touched()\n{\n\t_info->refresh();\n\n\tif ( !_info->exists() ) {\n\t\tif( _lastSize == 0  ) return false;\n\t\t_lastSize = 0;\n\t\treturn true;\n\t}\n\n\tif(_info->size() != _lastSize\n\t\t\t|| (_info->lastModified() > *_lastMod) ) {\n\n\t\t_lastSize = _info->size();\n\t\t*_lastMod = _info->lastModified();\n\n\t\treturn true;\n\t}\n\n\treturn false;\n}\n\nbool KUnixDrop::locked()\n{\n\t_lockInfo->refresh();\n\treturn _lockInfo->exists();\n}\n\nint KUnixDrop::doCount()\n{\n\n\t_info->refresh();\n\n\tif (  !_info->exists() ){\n\t\treturn 0;\n\t}\n\n  \/\/kdDebug() << \"KUnixDrop: counting..\" << endl;\n\tQFile mbox(_file);\n        char *buffer = lineBuffer();\n        int count=0, msgCount=0;\n        bool inHeader = false;\n        bool hasContentLen = false;\n        bool msgRead = false;\n        long contentLength=0;\n\t_totalCount = 0;\n\n        if(!mbox.open(IO_ReadOnly)) {\n                qWarning(\"countMail: file open error\");\n                return 0;\n        }\n\n\tbuffer[MAXSTR-1] = 0;\n\n\twhile( mbox.readLine(buffer, MAXSTR-2) > 0 ) {\n\t\t\/\/ read a line from the mailbox\n\n\t\tif( !strchr(buffer, '\\n') && !mbox.atEnd() ){\n\t\t\t\/\/ read till the end of the line if we\n\t\t\t\/\/ haven't already read all of it.\n\n\t\t\tint c;\n\n\t\t\twhile( (c=mbox.getch()) >=0 && c !='\\n' )\n\t\t\t\t;\n\t\t}\n\n\t\tif( !inHeader && checkfrom(buffer) ) {\n\t\t\t\/\/ check if this is the start of a message\n\t\t\thasContentLen = false;\n\t\t\tinHeader = true;\n\t\t\tmsgRead = false;\n\t\t\t++_totalCount;\n\t\t}\n\t\telse if ( inHeader ) {\n\t\t\t\/\/ check header fields if we're already in one\n\n\t\t\tif (compareHeader(buffer, \"Content-Length\")){\n\t\t\t\thasContentLen = true;\n\t\t\t\tcontentLength = atol(buffer+15);\n\t\t\t}\n\n\t\t\tif (compareHeader(buffer, \"Status\")) {\n\t\t\t\tconst char *field = buffer;\n\t\t\t\tfield += 7;\n\t\t\t\twhile(field && (*field== ' '||*field == '\\t'))\n\t\t\t\t\tfield++;\n\n\t\t\t\tif ( *field == 'N' || *field == 'U' )\n\t\t\t\t\tmsgRead = false;\n\t\t\t\telse\n\t\t\t\t\tmsgRead = true;\n\t\t\t}\n\t\t\telse if (buffer[0] == '\\n' ) {\n\t\t\t\tif( hasContentLen ) {\n\t\t\t\t\tmbox.at( mbox.at() + contentLength);\n\t\t\t\t}\n\n\t\t\t\tinHeader = false;\n\n\t\t\t\tif ( !msgRead ) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\/\/in header\n\n\t\tif( ++msgCount >= 1000 ) {\n\t\t\tqApp->processEvents();\n\t\t\tmsgCount = 0;\n\t\t}\n\t}\/\/while\n\n\tmbox.close();\n\t\/\/kdDebug() << count << \" messages\" << endl;\n\treturn count;\n}\n\n\n\n\n\n#define whitespace(c)    (c == ' ' || c == '\\t')\n\n#define skip_white(c)\t while(c && (*c) && whitespace(*c) ) c++\n#define skip_nonwhite(c) while(c && (*c) && !whitespace(*c) ) c++\n\n#define skip_token(buf) skip_nonwhite(buf); if(!*buf) return false; \\\n\tskip_white(buf); if(!*buf) return false;\n\n\nQValueVector<KornMailSubject> * KUnixDrop::doReadSubjects(bool * stop)\n{\n\tQValueVector<KornMailSubject> * result = new QValueVector<KornMailSubject>();\n\n\t\/\/ prepare progress bar (with total number of messages)\n\temit readSubjectsTotalSteps(_totalCount);\n\n\t\/\/ mail subject curtently reading. 0 means: do not store in result.\n\tKornMailSubject * mailSubject = 0;\n\n\t_info->refresh();\n\n\tif (  !_info->exists() )\n\t{\n\t\treturn result;\n\t}\n\n\tQFile mbox(_file);\n        char *buffer = lineBuffer();\n        int msgCount=0;\n        bool inHeader = false;\n        bool msgRead = false;\n\tint mailCount = 0;\n\n        if(!mbox.open(IO_ReadOnly))\n\t{\n                qWarning(\"doReadSubjects: file open error\");\n                return result;\n        }\n\n\tbuffer[MAXSTR-1] = 0;\n\n\t\/\/ contains the whole mail currently read.\n\tQString currentMail;\n\tbool logMail = true;\n\n\t\/\/ scan the mbox file\n\twhile( mbox.readLine(buffer, MAXSTR-2) > 0  && (!stop || !*stop))\n\t{\n\t\t\/\/ read a line from the mailbox\n\t\tif( !strchr(buffer, '\\n') && !mbox.atEnd() )\n\t\t{\n\t\t\t\/\/ read till the end of the line if we\n\t\t\t\/\/ haven't already read all of it.\n\n\t\t\tint c;\n\n\t\t\twhile( (c=mbox.getch()) >=0 && c !='\\n' )\n\t\t\t\t;\n\t\t}\n\n\t\t\/\/ check if this is the start of a message\n\t\tif( !inHeader && checkfrom(buffer) )\n\t\t{\n\t\t\t\/\/ set progress bar\n\t\t\temit readSubjectsProgress(++mailCount);\n\t\t\tinHeader = true;\n\t\t\tmsgRead = false;\n\t\t\tlogMail = true;\n\n\t\t\t\/\/ a new mail starts. Save the mail body of the last mail\n\t\t\t\/\/ and store it in the result vector if the last mail\n\t\t\t\/\/ should be stored\n\t\t\tif (mailSubject)\n\t\t\t{\n\t\t\t\tmailSubject->setHeader(currentMail, true);\n\t\t\t\tmailSubject->setSize(currentMail.length());\n\t\t\t\tresult->push_back(*mailSubject);\n\t\t\t\tdelete mailSubject;\n\t\t\t\tmailSubject = 0;\n\t\t\t}\n\t\t\tcurrentMail = buffer;\n\t\t\tconst char * c = buffer + 5;\n\t\t\tskip_white(c);\n\t\t\tskip_token(c);\n\t\t\tstruct tm t;\n\t\t\tstrptime(c, \"%c\", &t);\n\n\t\t\t\/\/ Prepare a KornMailSubject instance for the next mail. The\n\t\t\t\/\/ id is unimportant, as this mail drop does not allow deleting\n\t\t\t\/\/ or reading mails\n\t\t\tmailSubject = new KornMailSubject(new KornIntId(msgCount));\n\t\t\tmailSubject->setDate(mktime(&t));\n\t\t}\n\t\telse if ( inHeader )\n\t\t{\n\t\t\t\/\/ check header fields if we're already in one\n\n\t\t\tif (logMail)\n\t\t\t\tcurrentMail += buffer;\n\n\t\t\tif (mailSubject && compareHeader(buffer, \"From\"))\n\t\t\t{\n\t\t\t\tconst char *field = buffer;\n\t\t\t\tfield += 5;\n\t\t\t\twhile(field && (*field== ' '||*field == '\\t'))\n\t\t\t\t\tfield++;\n\t\t\t\tQString s = field;\n\t\t\t\ts.remove(s.length()-1, 1);\n\t\t\t\tmailSubject->setSender(s);\n\t\t\t}\n\t\t\telse if (mailSubject && compareHeader(buffer, \"Subject\"))\n\t\t\t{\n\t\t\t\tconst char *field = buffer;\n\t\t\t\tfield += 8;\n\t\t\t\twhile(field && (*field== ' '||*field == '\\t'))\n\t\t\t\t\tfield++;\n\t\t\t\tQCString s = field;\n\t\t\t\ts.remove(s.length()-1, 1);\n\t\t\t\tconst char *usedCS = NULL;\n\t\t\t\tmailSubject->setSubject(KMime::decodeRFC2047String(s, &usedCS, \"base64\", false));\n\t\t\t}\n\t\t\telse if (compareHeader(buffer, \"Status\"))\n\t\t\t{\n\t\t\t\tconst char *field = buffer;\n\t\t\t\tfield += 7;\n\t\t\t\twhile(field && (*field== ' '||*field == '\\t'))\n\t\t\t\t\tfield++;\n\n\t\t\t\tif ( *field == 'N' || *field == 'U' )\n\t\t\t\t\tmsgRead = false;\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tmsgRead = true;\n\n\t\t\t\t\t\/\/ do not care about this mail any more\n\t\t\t\t\tlogMail = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\/\/ end of mail reached\n\t\t\telse if (buffer[0] == '\\n' )\n\t\t\t{\n\n\t\t\t\tinHeader = false;\n\n\t\t\t\t\/\/ no new message? delete KornMailSubject instance\n\t\t\t\tif ( msgRead )\n\t\t\t\t{\n\t\t\t\t\tdelete mailSubject;\n\t\t\t\t\tmailSubject = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\/\/ if mail should still be logged, add curent line to mail buffer\n\t\telse if (logMail)\n\t\t\tcurrentMail += buffer;\n\n\n\t\tif( ++msgCount >= 1000 )\n\t\t{\n\t\t\tqApp->processEvents();\n\t\t\tmsgCount = 0;\n\t\t}\n\t}\n\t\/\/ All mails scanned. Save the mail body of the last mail\n\t\/\/ and store it in the result vector if the last mail\n\t\/\/ should be stored\n\tif (mailSubject)\n\t{\n\t\tmailSubject->setHeader(currentMail, true);\n\t\tmailSubject->setSize(currentMail.length());\n\t\tresult->push_back(*mailSubject);\n\t\tdelete mailSubject;\n\t\tmailSubject = 0;\n\t}\n\n\tmbox.close();\n\treturn result;\n}\n\n\n\n\n\nstatic const char *month_name[13] = {\n\t\"jan\", \"feb\", \"mar\", \"apr\", \"may\", \"jun\",\n\t\"jul\", \"aug\", \"sep\", \"oct\", \"nov\", \"dec\", NULL\n};\n\nstatic const char *day_name[8] = {\n\t\"sun\", \"mon\", \"tue\", \"wed\", \"thu\", \"fri\", \"sat\", 0\n};\n\nstatic bool checkfrom(const char *buffer)\n{\n\n\t\/*\n\tA valid from line will be in the following format:\n\n\tFrom <user> <weekday> <month> <day> <hr:min:sec> [TZ1 [TZ2]] <year>\n*\/\n\n\tint day;\n\tint i;\n\tint found;\n\n\t\/* From *\/\n\n\tif(!buffer || !*buffer)\n\t\treturn false;\n\n\tif (strncmp(buffer, \"From \", 5))\n\t\treturn false;\n\n\tbuffer += 5;\n\n\tskip_white(buffer);\n\n\t\/* <user> *\/\n\tif(*buffer == 0) return false;\n\tskip_token(buffer);\n\n\t\/* <weekday> *\/\n\tfound = 0;\n\tfor (i = 0; !found && day_name[i] != NULL; i++) {\n\t\tfound = found || (qstrnicmp(day_name[i], buffer, 3) == 0);\n\t}\n\n\tif (!found)\n\t\treturn false;\n\n\tskip_token(buffer);\n\n\t\/* <month> *\/\n\tfound = 0;\n\n\tfor (i = 0; !found && month_name[i] != NULL; i++) {\n\t\tfound = found || (qstrnicmp(month_name[i], buffer, 3) == 0);\n\t}\n\n\tif (!found)\n\t\treturn false;\n\n\tskip_token(buffer);\n\n\t\/* <day> *\/\n\tif ( (day = atoi(buffer)) < 0 || day < 1 || day > 31)\n\t\treturn false;\n\n\treturn true;\n}\n\nstatic const char *compareHeader(const char *header, const char *field)\n{\n        int len = strlen(field);\n\n        if (qstrnicmp(header, field, len))\n                return NULL;\n\n        header += len;\n\n        if( *header != ':' )\n                return NULL;\n\n        header++;\n\n        while( *header && ( *header == ' ' || *header == '\\t') )\n                header++;\n\n        return header;\n}\n\n\nvoid KUnixDrop::setFile(const QString & file)\n{\n\tbool run = running();\n\n\tif( run ) {\n\t\tstopMonitor();\n\t}\n\n\t_file = file;\n\n\t\/\/ update monitors\n\tQString lockf = file;\n\tlockf += fu(\".lockfile\");\n\n\t_info->setFile( _file );\n\t_lockInfo->setFile( lockf );\n\t_lastMod->setTime_t( 0 );\n\n\t_valid = true;\n\n\tif( run ) {\n\t\tstartMonitor();\n\t}\n\tkdDebug() << \"KUnixDrop::setFile to \" << file << endl;\n}\n\nKMailDrop *KUnixDrop::clone() const\n{\n\tKUnixDrop *clone = new KUnixDrop;\n\n\t*clone = *this;\n\n\treturn clone;\n}\n\nKUnixDrop& KUnixDrop::operator=( const KUnixDrop& other )\n{\n\tsetFreq( other.freq() );\n\tsetFile( other.file() );\n\n\treturn *this;\n}\n\nbool KUnixDrop::readConfigGroup ( const KConfigBase& cfg )\n{\n\tKPollableDrop::readConfigGroup( cfg );\n\n\tQString box = cfg.readPathEntry(fu(FileConfigKey));\n\n\tif( box.isEmpty() ) {\n\t\tqWarning( \"KUnixDrop::readConfigGroup: no file for '%s'.\",\n\t\t\t\tcaption().ascii() );\n\n\t\t_valid = false;\n\n\t\treturn false;\n\t}\n\n        setFile( box );\n\n        return true;\n}\n\nbool KUnixDrop::writeConfigGroup ( KConfigBase& cfg ) const\n{\n\tKPollableDrop::writeConfigGroup( cfg );\n\n\tcfg.writePathEntry(fu(FileConfigKey), _file );\n\n\treturn true;\n}\n\nvoid KUnixDrop::addConfigPage( KDropCfgDialog *dlg )\n{\n\tdlg->addConfigPage( new KUnixCfg( this ) );\n\n\tKPollableDrop::addConfigPage( dlg );\n}\n\nchar *KUnixDrop::lineBuffer()\n{\n\tif( _buffer == 0 ) {\n\t\t_buffer = new char[MAXSTR];\n\t\tassert( _buffer != 0 );\n\t}\n\n\treturn _buffer;\n}\n\nconst char *KUnixDrop::FileConfigKey = \"file\";\n\n\n<commit_msg>Solves bug #71806.<commit_after>\/*\n* unixdrop.cpp -- Implementation of class KUnixDrop.\n* Author:\tSirtaj Singh Kang\n* Version:\t$Id$\n* Generated:\tSun Nov 30 23:28:07 EST 1997\n*\/\n\n\n#include <stdio.h>\n#include <ctype.h>\n#include <string.h>\n#include <stdlib.h>\n#include <assert.h>\n#include <time.h>\n#include <utime.h>\n\n#include\"dropdlg.h\"\n\n#include <qfileinfo.h>\n#include <qapplication.h>\n#include <kdebug.h>\n\n#include<kconfigbase.h>\n\n#include \"utils.h\"\n#include \"unixcfg.h\"\n#include \"unixdrop.h\"\n#include \"mailsubject.h\"\n#include <kmime_util.h>\n#include \"intid.h\"\n\n#define MAXSTR (1024)\n\nstatic bool checkfrom(const char *buffer);\nstatic const char *compareHeader(const char *header, const char *field);\n\n\nKUnixDrop::KUnixDrop()\n\t: KPollableDrop(),\n\t_lastMod\t( new QDateTime ),\n\t_info\t\t( new QFileInfo ),\n\t_lockInfo\t( new QFileInfo ),\n\t_lastSize\t( 0 ),\n\t_valid\t\t( false ),\n\t_buffer\t\t( 0 ),\n\t_totalCount\t( 0 )\n\n{\n}\n\nKUnixDrop::~KUnixDrop()\n{\n\tstopMonitor();\n\n\tdelete _lastMod;\n\tdelete _info;\n\tdelete _lockInfo;\n\n\tif( _buffer ) {\n\t\tdelete [] _buffer;\n\t}\n}\n\nvoid KUnixDrop::recheck()\n{\n\tif( valid() && !locked() && touched() ) {\n\t  \/\/kdDebug() << \"KUnixDrop: checking\" << endl;\n\t\tint messages = doCount();\n\n\t\tif( messages != count() ) {\n\t\t\temit changed( messages );\n\t\t}\n\t}\n#if 0\n\telse {\n\t    kdDebug() << \"KUnixDrop: not checking - mbox \" << (valid()?\"\":\"not \") << \"valid, \" << (locked()?\"\":\"not \") << \"locked, \" << (touched()?\"\":\"not \") << \"touched\" << endl;\n\t}\n#endif\n}\n\nbool KUnixDrop::valid()\n{\n\treturn _valid;\n}\n\nbool KUnixDrop::touched()\n{\n\t_info->refresh();\n\n\tif ( !_info->exists() ) {\n\t\tif( _lastSize == 0  ) return false;\n\t\t_lastSize = 0;\n\t\treturn true;\n\t}\n\n\tif(_info->size() != _lastSize\n\t\t\t|| (_info->lastModified() > *_lastMod) ) {\n\n\t\t_lastSize = _info->size();\n\t\t*_lastMod = _info->lastModified();\n\n\t\treturn true;\n\t}\n\n\treturn false;\n}\n\nbool KUnixDrop::locked()\n{\n\t_lockInfo->refresh();\n\treturn _lockInfo->exists();\n}\n\nint KUnixDrop::doCount()\n{\n\n\t_info->refresh();\n\t\n\tstruct utimbuf prev_time; \/\/Stores current actime and modtime\n\tprev_time.actime = _info->lastRead().toTime_t();\n\tprev_time.modtime = _info->lastModified().toTime_t();\n\n\tif (  !_info->exists() ){\n\t\treturn 0;\n\t}\n\n  \/\/kdDebug() << \"KUnixDrop: counting..\" << endl;\n\tQFile mbox(_file);\n        char *buffer = lineBuffer();\n        int count=0, msgCount=0;\n        bool inHeader = false;\n        bool hasContentLen = false;\n        bool msgRead = false;\n        long contentLength=0;\n\t_totalCount = 0;\n\n        if(!mbox.open(IO_ReadOnly)) {\n                qWarning(\"countMail: file open error\");\n                return 0;\n        }\n\n\tbuffer[MAXSTR-1] = 0;\n\n\twhile( mbox.readLine(buffer, MAXSTR-2) > 0 ) {\n\t\t\/\/ read a line from the mailbox\n\n\t\tif( !strchr(buffer, '\\n') && !mbox.atEnd() ){\n\t\t\t\/\/ read till the end of the line if we\n\t\t\t\/\/ haven't already read all of it.\n\n\t\t\tint c;\n\n\t\t\twhile( (c=mbox.getch()) >=0 && c !='\\n' )\n\t\t\t\t;\n\t\t}\n\n\t\tif( !inHeader && checkfrom(buffer) ) {\n\t\t\t\/\/ check if this is the start of a message\n\t\t\thasContentLen = false;\n\t\t\tinHeader = true;\n\t\t\tmsgRead = false;\n\t\t\t++_totalCount;\n\t\t}\n\t\telse if ( inHeader ) {\n\t\t\t\/\/ check header fields if we're already in one\n\n\t\t\tif (compareHeader(buffer, \"Content-Length\")){\n\t\t\t\thasContentLen = true;\n\t\t\t\tcontentLength = atol(buffer+15);\n\t\t\t}\n\n\t\t\tif (compareHeader(buffer, \"Status\")) {\n\t\t\t\tconst char *field = buffer;\n\t\t\t\tfield += 7;\n\t\t\t\twhile(field && (*field== ' '||*field == '\\t'))\n\t\t\t\t\tfield++;\n\n\t\t\t\tif ( *field == 'N' || *field == 'U' )\n\t\t\t\t\tmsgRead = false;\n\t\t\t\telse\n\t\t\t\t\tmsgRead = true;\n\t\t\t}\n\t\t\telse if (buffer[0] == '\\n' ) {\n\t\t\t\tif( hasContentLen ) {\n\t\t\t\t\tmbox.at( mbox.at() + contentLength);\n\t\t\t\t}\n\n\t\t\t\tinHeader = false;\n\n\t\t\t\tif ( !msgRead ) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\/\/in header\n\n\t\tif( ++msgCount >= 1000 ) {\n\t\t\tqApp->processEvents();\n\t\t\tmsgCount = 0;\n\t\t}\n\t}\/\/while\n\n\tmbox.close();\n\t\/\/kdDebug() << count << \" messages\" << endl;\n\t\n\t\/\/Setting back previous time; this way, other applications can see if there is\n\t\/\/new mail by looking to atime; it is not desturbed by korn.\n\tutime( QFile::encodeName( _info->filePath() ), &prev_time );\n\t\n\treturn count;\n}\n\n\n\n\n\n#define whitespace(c)    (c == ' ' || c == '\\t')\n\n#define skip_white(c)\t while(c && (*c) && whitespace(*c) ) c++\n#define skip_nonwhite(c) while(c && (*c) && !whitespace(*c) ) c++\n\n#define skip_token(buf) skip_nonwhite(buf); if(!*buf) return false; \\\n\tskip_white(buf); if(!*buf) return false;\n\n\nQValueVector<KornMailSubject> * KUnixDrop::doReadSubjects(bool * stop)\n{\n\tQValueVector<KornMailSubject> * result = new QValueVector<KornMailSubject>();\n\n\t\/\/ prepare progress bar (with total number of messages)\n\temit readSubjectsTotalSteps(_totalCount);\n\n\t\/\/ mail subject curtently reading. 0 means: do not store in result.\n\tKornMailSubject * mailSubject = 0;\n\n\t_info->refresh();\n\n\tif (  !_info->exists() )\n\t{\n\t\treturn result;\n\t}\n\n\tQFile mbox(_file);\n        char *buffer = lineBuffer();\n        int msgCount=0;\n        bool inHeader = false;\n        bool msgRead = false;\n\tint mailCount = 0;\n\n        if(!mbox.open(IO_ReadOnly))\n\t{\n                qWarning(\"doReadSubjects: file open error\");\n                return result;\n        }\n\n\tbuffer[MAXSTR-1] = 0;\n\n\t\/\/ contains the whole mail currently read.\n\tQString currentMail;\n\tbool logMail = true;\n\n\t\/\/ scan the mbox file\n\twhile( mbox.readLine(buffer, MAXSTR-2) > 0  && (!stop || !*stop))\n\t{\n\t\t\/\/ read a line from the mailbox\n\t\tif( !strchr(buffer, '\\n') && !mbox.atEnd() )\n\t\t{\n\t\t\t\/\/ read till the end of the line if we\n\t\t\t\/\/ haven't already read all of it.\n\n\t\t\tint c;\n\n\t\t\twhile( (c=mbox.getch()) >=0 && c !='\\n' )\n\t\t\t\t;\n\t\t}\n\n\t\t\/\/ check if this is the start of a message\n\t\tif( !inHeader && checkfrom(buffer) )\n\t\t{\n\t\t\t\/\/ set progress bar\n\t\t\temit readSubjectsProgress(++mailCount);\n\t\t\tinHeader = true;\n\t\t\tmsgRead = false;\n\t\t\tlogMail = true;\n\n\t\t\t\/\/ a new mail starts. Save the mail body of the last mail\n\t\t\t\/\/ and store it in the result vector if the last mail\n\t\t\t\/\/ should be stored\n\t\t\tif (mailSubject)\n\t\t\t{\n\t\t\t\tmailSubject->setHeader(currentMail, true);\n\t\t\t\tmailSubject->setSize(currentMail.length());\n\t\t\t\tresult->push_back(*mailSubject);\n\t\t\t\tdelete mailSubject;\n\t\t\t\tmailSubject = 0;\n\t\t\t}\n\t\t\tcurrentMail = buffer;\n\t\t\tconst char * c = buffer + 5;\n\t\t\tskip_white(c);\n\t\t\tskip_token(c);\n\t\t\tstruct tm t;\n\t\t\tstrptime(c, \"%c\", &t);\n\n\t\t\t\/\/ Prepare a KornMailSubject instance for the next mail. The\n\t\t\t\/\/ id is unimportant, as this mail drop does not allow deleting\n\t\t\t\/\/ or reading mails\n\t\t\tmailSubject = new KornMailSubject(new KornIntId(msgCount));\n\t\t\tmailSubject->setDate(mktime(&t));\n\t\t}\n\t\telse if ( inHeader )\n\t\t{\n\t\t\t\/\/ check header fields if we're already in one\n\n\t\t\tif (logMail)\n\t\t\t\tcurrentMail += buffer;\n\n\t\t\tif (mailSubject && compareHeader(buffer, \"From\"))\n\t\t\t{\n\t\t\t\tconst char *field = buffer;\n\t\t\t\tfield += 5;\n\t\t\t\twhile(field && (*field== ' '||*field == '\\t'))\n\t\t\t\t\tfield++;\n\t\t\t\tQString s = field;\n\t\t\t\ts.remove(s.length()-1, 1);\n\t\t\t\tmailSubject->setSender(s);\n\t\t\t}\n\t\t\telse if (mailSubject && compareHeader(buffer, \"Subject\"))\n\t\t\t{\n\t\t\t\tconst char *field = buffer;\n\t\t\t\tfield += 8;\n\t\t\t\twhile(field && (*field== ' '||*field == '\\t'))\n\t\t\t\t\tfield++;\n\t\t\t\tQCString s = field;\n\t\t\t\ts.remove(s.length()-1, 1);\n\t\t\t\tconst char *usedCS = NULL;\n\t\t\t\tmailSubject->setSubject(KMime::decodeRFC2047String(s, &usedCS, \"base64\", false));\n\t\t\t}\n\t\t\telse if (compareHeader(buffer, \"Status\"))\n\t\t\t{\n\t\t\t\tconst char *field = buffer;\n\t\t\t\tfield += 7;\n\t\t\t\twhile(field && (*field== ' '||*field == '\\t'))\n\t\t\t\t\tfield++;\n\n\t\t\t\tif ( *field == 'N' || *field == 'U' )\n\t\t\t\t\tmsgRead = false;\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tmsgRead = true;\n\n\t\t\t\t\t\/\/ do not care about this mail any more\n\t\t\t\t\tlogMail = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\/\/ end of mail reached\n\t\t\telse if (buffer[0] == '\\n' )\n\t\t\t{\n\n\t\t\t\tinHeader = false;\n\n\t\t\t\t\/\/ no new message? delete KornMailSubject instance\n\t\t\t\tif ( msgRead )\n\t\t\t\t{\n\t\t\t\t\tdelete mailSubject;\n\t\t\t\t\tmailSubject = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\/\/ if mail should still be logged, add curent line to mail buffer\n\t\telse if (logMail)\n\t\t\tcurrentMail += buffer;\n\n\n\t\tif( ++msgCount >= 1000 )\n\t\t{\n\t\t\tqApp->processEvents();\n\t\t\tmsgCount = 0;\n\t\t}\n\t}\n\t\/\/ All mails scanned. Save the mail body of the last mail\n\t\/\/ and store it in the result vector if the last mail\n\t\/\/ should be stored\n\tif (mailSubject)\n\t{\n\t\tmailSubject->setHeader(currentMail, true);\n\t\tmailSubject->setSize(currentMail.length());\n\t\tresult->push_back(*mailSubject);\n\t\tdelete mailSubject;\n\t\tmailSubject = 0;\n\t}\n\n\tmbox.close();\n\treturn result;\n}\n\n\n\n\n\nstatic const char *month_name[13] = {\n\t\"jan\", \"feb\", \"mar\", \"apr\", \"may\", \"jun\",\n\t\"jul\", \"aug\", \"sep\", \"oct\", \"nov\", \"dec\", NULL\n};\n\nstatic const char *day_name[8] = {\n\t\"sun\", \"mon\", \"tue\", \"wed\", \"thu\", \"fri\", \"sat\", 0\n};\n\nstatic bool checkfrom(const char *buffer)\n{\n\n\t\/*\n\tA valid from line will be in the following format:\n\n\tFrom <user> <weekday> <month> <day> <hr:min:sec> [TZ1 [TZ2]] <year>\n*\/\n\n\tint day;\n\tint i;\n\tint found;\n\n\t\/* From *\/\n\n\tif(!buffer || !*buffer)\n\t\treturn false;\n\n\tif (strncmp(buffer, \"From \", 5))\n\t\treturn false;\n\n\tbuffer += 5;\n\n\tskip_white(buffer);\n\n\t\/* <user> *\/\n\tif(*buffer == 0) return false;\n\tskip_token(buffer);\n\n\t\/* <weekday> *\/\n\tfound = 0;\n\tfor (i = 0; !found && day_name[i] != NULL; i++) {\n\t\tfound = found || (qstrnicmp(day_name[i], buffer, 3) == 0);\n\t}\n\n\tif (!found)\n\t\treturn false;\n\n\tskip_token(buffer);\n\n\t\/* <month> *\/\n\tfound = 0;\n\n\tfor (i = 0; !found && month_name[i] != NULL; i++) {\n\t\tfound = found || (qstrnicmp(month_name[i], buffer, 3) == 0);\n\t}\n\n\tif (!found)\n\t\treturn false;\n\n\tskip_token(buffer);\n\n\t\/* <day> *\/\n\tif ( (day = atoi(buffer)) < 0 || day < 1 || day > 31)\n\t\treturn false;\n\n\treturn true;\n}\n\nstatic const char *compareHeader(const char *header, const char *field)\n{\n        int len = strlen(field);\n\n        if (qstrnicmp(header, field, len))\n                return NULL;\n\n        header += len;\n\n        if( *header != ':' )\n                return NULL;\n\n        header++;\n\n        while( *header && ( *header == ' ' || *header == '\\t') )\n                header++;\n\n        return header;\n}\n\n\nvoid KUnixDrop::setFile(const QString & file)\n{\n\tbool run = running();\n\n\tif( run ) {\n\t\tstopMonitor();\n\t}\n\n\t_file = file;\n\n\t\/\/ update monitors\n\tQString lockf = file;\n\tlockf += fu(\".lockfile\");\n\n\t_info->setFile( _file );\n\t_lockInfo->setFile( lockf );\n\t_lastMod->setTime_t( 0 );\n\n\t_valid = true;\n\n\tif( run ) {\n\t\tstartMonitor();\n\t}\n\tkdDebug() << \"KUnixDrop::setFile to \" << file << endl;\n}\n\nKMailDrop *KUnixDrop::clone() const\n{\n\tKUnixDrop *clone = new KUnixDrop;\n\n\t*clone = *this;\n\n\treturn clone;\n}\n\nKUnixDrop& KUnixDrop::operator=( const KUnixDrop& other )\n{\n\tsetFreq( other.freq() );\n\tsetFile( other.file() );\n\n\treturn *this;\n}\n\nbool KUnixDrop::readConfigGroup ( const KConfigBase& cfg )\n{\n\tKPollableDrop::readConfigGroup( cfg );\n\n\tQString box = cfg.readPathEntry(fu(FileConfigKey));\n\n\tif( box.isEmpty() ) {\n\t\tqWarning( \"KUnixDrop::readConfigGroup: no file for '%s'.\",\n\t\t\t\tcaption().ascii() );\n\n\t\t_valid = false;\n\n\t\treturn false;\n\t}\n\n        setFile( box );\n\n        return true;\n}\n\nbool KUnixDrop::writeConfigGroup ( KConfigBase& cfg ) const\n{\n\tKPollableDrop::writeConfigGroup( cfg );\n\n\tcfg.writePathEntry(fu(FileConfigKey), _file );\n\n\treturn true;\n}\n\nvoid KUnixDrop::addConfigPage( KDropCfgDialog *dlg )\n{\n\tdlg->addConfigPage( new KUnixCfg( this ) );\n\n\tKPollableDrop::addConfigPage( dlg );\n}\n\nchar *KUnixDrop::lineBuffer()\n{\n\tif( _buffer == 0 ) {\n\t\t_buffer = new char[MAXSTR];\n\t\tassert( _buffer != 0 );\n\t}\n\n\treturn _buffer;\n}\n\nconst char *KUnixDrop::FileConfigKey = \"file\";\n\n\n<|endoftext|>"}
{"text":"<commit_before>class Solution {\npublic:\n    \/**\n     * @param x the base number\n     * @param n the power number\n     * @return the result\n     *\/\n    double myPow(double x, int n) {\n        \/\/ Write your code here\n    }\n};<commit_msg>testing 428<commit_after>class Solution {\npublic:\n    \/**\n     * @param x the base number\n     * @param n the power number\n     * @return the result\n     *\/\n    double myPow(double x, int n) {\n        \/\/ Write your code here\n        double rt_x=1;\n        if (x==0) return 0;\n        int i,j;\n\n        for (i=0;i<n;i++){\n        \trt_x *= rt_x;\n        }\n\n        return rt_x;\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) 2006-2008 Benoit Jacob <jacob.benoit.1@gmail.com>\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 basicStuff(const MatrixType& m)\n{\n  typedef typename MatrixType::Scalar Scalar;\n  typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;\n\n  int rows = m.rows();\n  int cols = m.cols();\n\n  \/\/ this test relies a lot on Random.h, and there's not much more that we can do\n  \/\/ to test it, hence I consider that we will have tested Random.h\n  MatrixType m1 = MatrixType::Random(rows, cols),\n             m2 = MatrixType::Random(rows, cols),\n             m3(rows, cols),\n             mzero = MatrixType::Zero(rows, cols),\n             identity = Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime>\n                              ::Identity(rows, rows),\n             square = Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime>::Random(rows, rows);\n  VectorType v1 = VectorType::Random(rows),\n             v2 = VectorType::Random(rows),\n             vzero = VectorType::Zero(rows);\n\n  Scalar x = ei_random<Scalar>();\n\n  int r = ei_random<int>(0, rows-1),\n      c = ei_random<int>(0, cols-1);\n\n  m1.coeffRef(r,c) = x;\n  VERIFY_IS_APPROX(x, m1.coeff(r,c));\n  m1(r,c) = x;\n  VERIFY_IS_APPROX(x, m1(r,c));\n  v1.coeffRef(r) = x;\n  VERIFY_IS_APPROX(x, v1.coeff(r));\n  v1(r) = x;\n  VERIFY_IS_APPROX(x, v1(r));\n  v1[r] = x;\n  VERIFY_IS_APPROX(x, v1[r]);\n\n  VERIFY_IS_APPROX(               v1,    v1);\n  VERIFY_IS_NOT_APPROX(           v1,    2*v1);\n  VERIFY_IS_MUCH_SMALLER_THAN(    vzero, v1);\n  if(NumTraits<Scalar>::HasFloatingPoint)\n    VERIFY_IS_MUCH_SMALLER_THAN(  vzero, v1.norm());\n  VERIFY_IS_NOT_MUCH_SMALLER_THAN(v1,    v1);\n  VERIFY_IS_APPROX(               vzero, v1-v1);\n  VERIFY_IS_APPROX(               m1,    m1);\n  VERIFY_IS_NOT_APPROX(           m1,    2*m1);\n  VERIFY_IS_MUCH_SMALLER_THAN(    mzero, m1);\n  VERIFY_IS_NOT_MUCH_SMALLER_THAN(m1,    m1);\n  VERIFY_IS_APPROX(               mzero, m1-m1);\n\n  \/\/ always test operator() on each read-only expression class,\n  \/\/ in order to check const-qualifiers.\n  \/\/ indeed, if an expression class (here Zero) is meant to be read-only,\n  \/\/ hence has no _write() method, the corresponding MatrixBase method (here zero())\n  \/\/ should return a const-qualified object so that it is the const-qualified\n  \/\/ operator() that gets called, which in turn calls _read().\n  VERIFY_IS_MUCH_SMALLER_THAN(MatrixType::Zero(rows,cols)(r,c), static_cast<Scalar>(1));\n\n  \/\/ now test copying a row-vector into a (column-)vector and conversely.\n  square.col(r) = square.row(r).eval();\n  Matrix<Scalar, 1, MatrixType::RowsAtCompileTime> rv(rows);\n  Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> cv(rows);\n  rv = square.row(r);\n  cv = square.col(r);\n  VERIFY_IS_APPROX(rv, cv.transpose());\n\n  if(cols!=1 && rows!=1 && MatrixType::SizeAtCompileTime!=Dynamic)\n  {\n    VERIFY_RAISES_ASSERT(m1 = (m2.block(0,0, rows-1, cols-1)));\n  }\n\n  VERIFY_IS_APPROX(m3 = m1,m1);\n  MatrixType m4;\n  VERIFY_IS_APPROX(m4 = m1,m1);\n\n  \/\/ test swap\n  m3 = m1;\n  m1.swap(m2);\n  VERIFY_IS_APPROX(m3, m2);\n  if(rows*cols>=3)\n  {\n    VERIFY_IS_NOT_APPROX(m3, m1);\n  }\n}\n\nvoid casting()\n{\n  Matrix4f m = Matrix4f::Random(), m2;\n  Matrix4d n = m.cast<double>();\n  VERIFY(m.isApprox(n.cast<float>()));\n  m2 = m.cast<float>(); \/\/ check the specialization when NewType == Type\n  VERIFY(m.isApprox(m2));\n}\n\nvoid test_basicstuff()\n{\n  for(int i = 0; i < g_repeat; i++) {\n    CALL_SUBTEST( basicStuff(Matrix<float, 1, 1>()) );\n    CALL_SUBTEST( basicStuff(Matrix4d()) );\n    CALL_SUBTEST( basicStuff(MatrixXcf(3, 3)) );\n    CALL_SUBTEST( basicStuff(MatrixXi(8, 12)) );\n    CALL_SUBTEST( basicStuff(MatrixXcd(20, 20)) );\n    CALL_SUBTEST( basicStuff(Matrix<float, 100, 100>()) );\n    CALL_SUBTEST( basicStuff(Matrix<long double,Dynamic,Dynamic>(10,10)) );\n  }\n}\n<commit_msg>gni, forgot to call the new subtest<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) 2006-2008 Benoit Jacob <jacob.benoit.1@gmail.com>\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 basicStuff(const MatrixType& m)\n{\n  typedef typename MatrixType::Scalar Scalar;\n  typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;\n\n  int rows = m.rows();\n  int cols = m.cols();\n\n  \/\/ this test relies a lot on Random.h, and there's not much more that we can do\n  \/\/ to test it, hence I consider that we will have tested Random.h\n  MatrixType m1 = MatrixType::Random(rows, cols),\n             m2 = MatrixType::Random(rows, cols),\n             m3(rows, cols),\n             mzero = MatrixType::Zero(rows, cols),\n             identity = Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime>\n                              ::Identity(rows, rows),\n             square = Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime>::Random(rows, rows);\n  VectorType v1 = VectorType::Random(rows),\n             v2 = VectorType::Random(rows),\n             vzero = VectorType::Zero(rows);\n\n  Scalar x = ei_random<Scalar>();\n\n  int r = ei_random<int>(0, rows-1),\n      c = ei_random<int>(0, cols-1);\n\n  m1.coeffRef(r,c) = x;\n  VERIFY_IS_APPROX(x, m1.coeff(r,c));\n  m1(r,c) = x;\n  VERIFY_IS_APPROX(x, m1(r,c));\n  v1.coeffRef(r) = x;\n  VERIFY_IS_APPROX(x, v1.coeff(r));\n  v1(r) = x;\n  VERIFY_IS_APPROX(x, v1(r));\n  v1[r] = x;\n  VERIFY_IS_APPROX(x, v1[r]);\n\n  VERIFY_IS_APPROX(               v1,    v1);\n  VERIFY_IS_NOT_APPROX(           v1,    2*v1);\n  VERIFY_IS_MUCH_SMALLER_THAN(    vzero, v1);\n  if(NumTraits<Scalar>::HasFloatingPoint)\n    VERIFY_IS_MUCH_SMALLER_THAN(  vzero, v1.norm());\n  VERIFY_IS_NOT_MUCH_SMALLER_THAN(v1,    v1);\n  VERIFY_IS_APPROX(               vzero, v1-v1);\n  VERIFY_IS_APPROX(               m1,    m1);\n  VERIFY_IS_NOT_APPROX(           m1,    2*m1);\n  VERIFY_IS_MUCH_SMALLER_THAN(    mzero, m1);\n  VERIFY_IS_NOT_MUCH_SMALLER_THAN(m1,    m1);\n  VERIFY_IS_APPROX(               mzero, m1-m1);\n\n  \/\/ always test operator() on each read-only expression class,\n  \/\/ in order to check const-qualifiers.\n  \/\/ indeed, if an expression class (here Zero) is meant to be read-only,\n  \/\/ hence has no _write() method, the corresponding MatrixBase method (here zero())\n  \/\/ should return a const-qualified object so that it is the const-qualified\n  \/\/ operator() that gets called, which in turn calls _read().\n  VERIFY_IS_MUCH_SMALLER_THAN(MatrixType::Zero(rows,cols)(r,c), static_cast<Scalar>(1));\n\n  \/\/ now test copying a row-vector into a (column-)vector and conversely.\n  square.col(r) = square.row(r).eval();\n  Matrix<Scalar, 1, MatrixType::RowsAtCompileTime> rv(rows);\n  Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> cv(rows);\n  rv = square.row(r);\n  cv = square.col(r);\n  VERIFY_IS_APPROX(rv, cv.transpose());\n\n  if(cols!=1 && rows!=1 && MatrixType::SizeAtCompileTime!=Dynamic)\n  {\n    VERIFY_RAISES_ASSERT(m1 = (m2.block(0,0, rows-1, cols-1)));\n  }\n\n  VERIFY_IS_APPROX(m3 = m1,m1);\n  MatrixType m4;\n  VERIFY_IS_APPROX(m4 = m1,m1);\n\n  \/\/ test swap\n  m3 = m1;\n  m1.swap(m2);\n  VERIFY_IS_APPROX(m3, m2);\n  if(rows*cols>=3)\n  {\n    VERIFY_IS_NOT_APPROX(m3, m1);\n  }\n}\n\nvoid casting()\n{\n  Matrix4f m = Matrix4f::Random(), m2;\n  Matrix4d n = m.cast<double>();\n  VERIFY(m.isApprox(n.cast<float>()));\n  m2 = m.cast<float>(); \/\/ check the specialization when NewType == Type\n  VERIFY(m.isApprox(m2));\n}\n\nvoid test_basicstuff()\n{\n  for(int i = 0; i < g_repeat; i++) {\n    CALL_SUBTEST( basicStuff(Matrix<float, 1, 1>()) );\n    CALL_SUBTEST( basicStuff(Matrix4d()) );\n    CALL_SUBTEST( basicStuff(MatrixXcf(3, 3)) );\n    CALL_SUBTEST( basicStuff(MatrixXi(8, 12)) );\n    CALL_SUBTEST( basicStuff(MatrixXcd(20, 20)) );\n    CALL_SUBTEST( basicStuff(Matrix<float, 100, 100>()) );\n    CALL_SUBTEST( basicStuff(Matrix<long double,Dynamic,Dynamic>(10,10)) );\n  }\n\n  CALL_SUBTEST(casting());\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <catch.hpp>\n#include <rapidcheck\/catch.h>\n\n#include \"build.h\"\n#include \"build_status.h\"\n#include \"path.h\"\n#include \"step.h\"\n\n#include \"dummy_command_runner.h\"\n#include \"generators.h\"\n#include \"in_memory_file_system.h\"\n#include \"in_memory_invocation_log.h\"\n\nnamespace shk {\n\nusing Files = std::unordered_map<shk::Path, std::string>;\n\nstruct BuildInput {\n  std::vector<Step> steps;\n  Files input_files;\n};\n\nvoid showValue(const Step &step, std::ostream &os) {\n  os << \"<Step:'\" << step.command << \"' \";\n  if (step.restat) {\n    os << \"restat \";\n  }\n  os << rc::toString(step.dependencies) << \" => \" << rc::toString(step.outputs);\n  os << \">\";\n}\n\nvoid showValue(const BuildInput &build_input, std::ostream &os) {\n  os << \"  BuildInput:\\n\";\n  os << \"steps: \" << rc::toString(build_input.steps) << \"\\n\";\n  os << \"input_files: \" << rc::toString(build_input.input_files) << std::endl;\n}\n\nnamespace gen {\n\n\/**\n * Partially generates a build step. Used by the steps generator, whichadds\n * more information to construct a real DAG.\n *\/\nrc::Gen<Step> step(const std::shared_ptr<Paths> &paths) {\n  return rc::gen::exec([paths] {\n    Step step;\n    \/\/ step.command is generated later\n    step.restat = *rc::gen::arbitrary<bool>();\n    step.dependencies = *pathVector(paths);\n    step.outputs = *pathVector(paths);\n    return step;\n  });\n}\n\n\/**\n * Construct a list of Step objects and input files that represent an arbitrary\n * valid Shuriken build.\n *\/\nrc::Gen<BuildInput> buildInput(const std::shared_ptr<Paths> &paths) {\n  return rc::gen::exec([paths] {\n    BuildInput build_input;\n\n    build_input.steps =\n        *rc::gen::container<std::vector<Step>>(step(paths));\n\n    for (const auto &step : build_input.steps) {\n      for (const auto &path : step.dependencies) {\n        build_input.input_files[path] = *rc::gen::arbitrary<std::string>();\n      }\n    }\n\n    \/\/ TODO(peck): Generate dependencies between steps\n    \/\/ TODO(peck): Generate commands for steps\n\n    return build_input;\n  });\n}\n\n}  \/\/ namespace gen\n\nvoid addFilesToFileSystem(const Files &files, FileSystem &file_system) {\n  for (const auto &file : files) {\n    mkdirsFor(file_system, file.first);\n    writeFile(file_system, file.first, file.second);\n  }\n}\n\nTEST_CASE(\"Correctness\") {\n  rc::prop(\"successful builds should run all build steps\", []() {\n    const auto paths = std::make_shared<Paths>();\n\n    BuildInput build_input = *gen::buildInput(paths);\n\n    InMemoryFileSystem file_system(*paths);\n    addFilesToFileSystem(build_input.input_files, file_system);\n\n    DummyCommandRunner command_runner(file_system);\n\n    BuildStatus build_status;\n\n    InMemoryInvocationLog invocation_log;\n\n    build(\n        file_system,\n        command_runner,\n        build_status,\n        invocation_log,\n        build_input.steps,\n        Invocations() \/* No prior invocations, this is a build from scratch *\/);\n  });\n\n  rc::prop(\"In {build, build}, the second build is a no-op\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n\n  rc::prop(\"{build, change, build} is same as {change, build}\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n\n  rc::prop(\"{build, change, build, undo, build} is same as {build}\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n\n  rc::prop(\"clean\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n\n  rc::prop(\"build steps that fail should not leave any trace\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n\n  rc::prop(\"mid-build termination\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n}\n\nTEST_CASE(\"Efficiency\") {\n  rc::prop(\"second build is no-op\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n\n  rc::prop(\"minimal rebuilds\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n\n  rc::prop(\"restat\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n\n  rc::prop(\"parallelism\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n}\n\nTEST_CASE(\"Error detection\") {\n  rc::prop(\"detect insufficiently declared dependencies\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n\n  rc::prop(\"detect read of output\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n\n  rc::prop(\"detect write to input\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n\n  rc::prop(\"detect failure to write declared outputs\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n\n  rc::prop(\"detect access network\", []() {\n    \/\/ TODO(peck): Implement me\n\n    \/\/ Maybe just a unit test for this one?\n  });\n\n  rc::prop(\"detect spawn daemon\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n\n  rc::prop(\"detect cyclic dependencies\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n\n  rc::prop(\"restrict environment variables\", []() {\n    \/\/ TODO(peck): Implement me\n\n    \/\/ Move this to CommandRunner tests?\n  });\n}\n\n}  \/\/ namespace shk\n<commit_msg>Disable broken test<commit_after>#include <catch.hpp>\n#include <rapidcheck\/catch.h>\n\n#include \"build.h\"\n#include \"build_status.h\"\n#include \"path.h\"\n#include \"step.h\"\n\n#include \"dummy_command_runner.h\"\n#include \"generators.h\"\n#include \"in_memory_file_system.h\"\n#include \"in_memory_invocation_log.h\"\n\nnamespace shk {\n\nusing Files = std::unordered_map<shk::Path, std::string>;\n\nstruct BuildInput {\n  std::vector<Step> steps;\n  Files input_files;\n};\n\nvoid showValue(const Step &step, std::ostream &os) {\n  os << \"<Step:'\" << step.command << \"' \";\n  if (step.restat) {\n    os << \"restat \";\n  }\n  os << rc::toString(step.dependencies) << \" => \" << rc::toString(step.outputs);\n  os << \">\";\n}\n\nvoid showValue(const BuildInput &build_input, std::ostream &os) {\n  os << \"  BuildInput:\\n\";\n  os << \"steps: \" << rc::toString(build_input.steps) << \"\\n\";\n  os << \"input_files: \" << rc::toString(build_input.input_files) << std::endl;\n}\n\nnamespace gen {\n\n\/**\n * Partially generates a build step. Used by the steps generator, whichadds\n * more information to construct a real DAG.\n *\/\nrc::Gen<Step> step(const std::shared_ptr<Paths> &paths) {\n  return rc::gen::exec([paths] {\n    Step step;\n    \/\/ step.command is generated later\n    step.restat = *rc::gen::arbitrary<bool>();\n    step.dependencies = *pathVector(paths);\n    step.outputs = *pathVector(paths);\n    return step;\n  });\n}\n\n\/**\n * Construct a list of Step objects and input files that represent an arbitrary\n * valid Shuriken build.\n *\/\nrc::Gen<BuildInput> buildInput(const std::shared_ptr<Paths> &paths) {\n  return rc::gen::exec([paths] {\n    BuildInput build_input;\n\n    build_input.steps =\n        *rc::gen::container<std::vector<Step>>(step(paths));\n\n    for (const auto &step : build_input.steps) {\n      for (const auto &path : step.dependencies) {\n        build_input.input_files[path] = *rc::gen::arbitrary<std::string>();\n      }\n    }\n\n    \/\/ TODO(peck): Generate dependencies between steps\n    \/\/ TODO(peck): Generate commands for steps\n\n    return build_input;\n  });\n}\n\n}  \/\/ namespace gen\n\nvoid addFilesToFileSystem(const Files &files, FileSystem &file_system) {\n  for (const auto &file : files) {\n    mkdirsFor(file_system, file.first);\n    writeFile(file_system, file.first, file.second);\n  }\n}\n\nTEST_CASE(\"Correctness\") {\n#if 0  \/\/ TODO(peck): This test is currently broken\/not fully implemented\n  rc::prop(\"successful builds should run all build steps\", []() {\n    const auto paths = std::make_shared<Paths>();\n\n    BuildInput build_input = *gen::buildInput(paths);\n\n    InMemoryFileSystem file_system(*paths);\n    addFilesToFileSystem(build_input.input_files, file_system);\n\n    DummyCommandRunner command_runner(file_system);\n\n    BuildStatus build_status;\n\n    InMemoryInvocationLog invocation_log;\n\n    build(\n        file_system,\n        command_runner,\n        build_status,\n        invocation_log,\n        build_input.steps,\n        Invocations() \/* No prior invocations, this is a build from scratch *\/);\n  });\n#endif\n\n  rc::prop(\"In {build, build}, the second build is a no-op\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n\n  rc::prop(\"{build, change, build} is same as {change, build}\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n\n  rc::prop(\"{build, change, build, undo, build} is same as {build}\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n\n  rc::prop(\"clean\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n\n  rc::prop(\"build steps that fail should not leave any trace\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n\n  rc::prop(\"mid-build termination\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n}\n\nTEST_CASE(\"Efficiency\") {\n  rc::prop(\"second build is no-op\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n\n  rc::prop(\"minimal rebuilds\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n\n  rc::prop(\"restat\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n\n  rc::prop(\"parallelism\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n}\n\nTEST_CASE(\"Error detection\") {\n  rc::prop(\"detect insufficiently declared dependencies\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n\n  rc::prop(\"detect read of output\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n\n  rc::prop(\"detect write to input\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n\n  rc::prop(\"detect failure to write declared outputs\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n\n  rc::prop(\"detect access network\", []() {\n    \/\/ TODO(peck): Implement me\n\n    \/\/ Maybe just a unit test for this one?\n  });\n\n  rc::prop(\"detect spawn daemon\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n\n  rc::prop(\"detect cyclic dependencies\", []() {\n    \/\/ TODO(peck): Implement me\n  });\n\n  rc::prop(\"restrict environment variables\", []() {\n    \/\/ TODO(peck): Implement me\n\n    \/\/ Move this to CommandRunner tests?\n  });\n}\n\n}  \/\/ namespace shk\n<|endoftext|>"}
{"text":"<commit_before>\/\/ (C) 2014 Arek Olek\n\n#pragma once\n\n#include <chrono>\n#include <random>\n#include <tuple>\n\n#include <boost\/graph\/graphml.hpp>\n\n#include \"algorithm.hpp\"\n#include \"graph.hpp\"\n\nunsigned time_seed() {\n  return std::chrono::system_clock::now().time_since_epoch().count();\n}\n\ntemplate <class Iterator>\nvoid generate_seeds(Iterator begin, Iterator end) {\n  static std::string seed = std::to_string(time_seed());\n  std::seed_seq seq(seed.begin(), seed.end());\n  seq.generate(begin, end);\n}\n\ndouble pr_within(double x) {\n  return x <= 1\n    ?  .5*x*x*x*x - 8.\/3*x*x*x + M_PI*x*x\n    : -.5*x*x*x*x - 4*x*x*atan(sqrt(x*x-1)) + 4.\/3*(2*x*x+1)*sqrt(x*x-1) + (M_PI-2)*x*x + 1.\/3;\n};\n\ntemplate <class Graph>\nclass test_suite {\npublic:\n  unsigned size() const { return seeds.size() * degrees.size() * sizes.size(); }\n\n  std::string type() const { return t; }\n\n  std::tuple<Graph, double, double> get(unsigned i) const {\n    std::default_random_engine generator(seeds[i % seeds.size()]);\n    auto d = degrees[(i \/ seeds.size()) % degrees.size()];\n    auto n = sizes[i \/ seeds.size() \/ degrees.size()];\n    Graph G(n);\n\n    if(t.find(\"path\") != std::string::npos) add_spider(G, 1, generator);\n    if(t.find(\"rgg\") != std::string::npos) {\n      auto r = find_argument(d\/(n-1), pr_within, 0, sqrt(2));\n      Geometric points(n, generator);\n      points.add_random_geometric(G, r);\n      if(t.find(\"mst\") != std::string::npos) points.add_mst(G);\n      return std::make_tuple(G, d, r);\n    } else {\n      auto p = d\/(n-1);\n      bool mst = t.find(\"mst\") != std::string::npos;\n      add_edges_uniform(G, p, generator, mst);\n      return std::make_tuple(G, d, p);\n    }\n  }\n\n  template<class Sizes, class Degrees>\n  test_suite(std::string t, unsigned z, Sizes ns, Degrees ds) : t(t), sizes(ns), degrees(ds) {\n    seeds.resize(z);\n    generate_seeds(seeds.begin(), seeds.end());\n  }\nprivate:\n  std::string t;\n  std::vector<unsigned> sizes;\n  std::vector<double> degrees;\n  std::vector<unsigned> seeds;\n};\n\ntemplate <class Graph>\nclass file_suite {\npublic:\n  std::tuple<Graph, double, double> get(unsigned i) const {\n    return std::make_tuple(graphs[i], 0, 0);\n  }\n\n  unsigned size() const { return graphs.size(); }\n\n  file_suite(std::string f) : t(f.substr(0, f.find('.'))) {\n    std::ifstream file(f);\n    if(!file.good()) {\n      throw std::invalid_argument(\"File does not exist: \" + f);\n    }\n    int z, n, m, s, t;\n    file >> z;\n    while(z--) {\n      file >> n >> m;\n      Graph G(n);\n      for(int i = 0; i < m; ++i) {\n        file >> s >> t;\n        add_edge(s, t, G);\n      }\n      graphs.push_back(G);\n    }\n    file.close();\n  }\n  std::string type() const {\n    return t;\n  }\nprivate:\n  std::string t;\n  std::vector<Graph> graphs;\n};\n\ntemplate <class Graph>\nclass real_suite {\npublic:\n  unsigned size() const { return seeds.size(); }\n\n  std::tuple<Graph, double, double> get(uint i) const {\n    std::default_random_engine generator(seeds[i]);\n    auto p = shuffled(vertices(G), generator);\n    Graph g(num_vertices(G));\n    for(auto e : range(edges(G)))\n      add_edge(p[source(e, G)], p[target(e, G)], g);\n    return std::make_tuple(G, 0, 0);\n  }\n\n  real_suite(std::string f, unsigned size) : G(0), t(f.substr(0, f.find('.'))), seeds(size) {\n    std::ifstream file(f);\n    if(!file.good()) {\n      throw std::invalid_argument(\"File does not exist: \" + f);\n    }\n    boost::dynamic_properties dp;\n    read_graphml(file, G, dp);\n    generate_seeds(seeds.begin(), seeds.end());\n  }\n  std::string type() const {\n    return t;\n  }\nprivate:\n  Graph G;\n  std::string t;\n  std::vector<unsigned> seeds;\n};\n<commit_msg>generate less random edges when adding a random path<commit_after>\/\/ (C) 2014 Arek Olek\n\n#pragma once\n\n#include <chrono>\n#include <random>\n#include <tuple>\n\n#include <boost\/graph\/graphml.hpp>\n\n#include \"algorithm.hpp\"\n#include \"graph.hpp\"\n\nunsigned time_seed() {\n  return std::chrono::system_clock::now().time_since_epoch().count();\n}\n\ntemplate <class Iterator>\nvoid generate_seeds(Iterator begin, Iterator end) {\n  static std::string seed = std::to_string(time_seed());\n  std::seed_seq seq(seed.begin(), seed.end());\n  seq.generate(begin, end);\n}\n\ndouble pr_within(double x) {\n  return x <= 1\n    ?  .5*x*x*x*x - 8.\/3*x*x*x + M_PI*x*x\n    : -.5*x*x*x*x - 4*x*x*atan(sqrt(x*x-1)) + 4.\/3*(2*x*x+1)*sqrt(x*x-1) + (M_PI-2)*x*x + 1.\/3;\n};\n\ntemplate <class Graph>\nclass test_suite {\npublic:\n  unsigned size() const { return seeds.size() * degrees.size() * sizes.size(); }\n\n  std::string type() const { return t; }\n\n  std::tuple<Graph, double, double> get(unsigned i) const {\n    std::default_random_engine generator(seeds[i % seeds.size()]);\n    auto Ed = degrees[(i \/ seeds.size()) % degrees.size()];\n    auto n = sizes[i \/ seeds.size() \/ degrees.size()];\n    auto d = Ed;\n    Graph G(n);\n\n    if(t.find(\"path\") != std::string::npos) {\n      add_spider(G, 1, generator);\n      \/\/ the overlap satisfies    y     = a    x     + b\n      \/\/ full graph satisfies:    0     = a  (n-1)   + b\n      \/\/ tree graph satisfies: 2(n-1)\/n = a 2(n-1)\/n + b\n      \/\/ so we must subtract this:\n      d -= 2\/(2-double(n)) * d + 1. + double(n)\/(n-2);\n    }\n    if(t.find(\"rgg\") != std::string::npos) {\n      auto r = find_argument(d\/(n-1), pr_within, 0, sqrt(2));\n      Geometric points(n, generator);\n      points.add_random_geometric(G, r);\n      if(t.find(\"mst\") != std::string::npos) points.add_mst(G);\n      return std::make_tuple(G, Ed, r);\n    } else {\n      auto p = d\/(n-1);\n      bool mst = t.find(\"mst\") != std::string::npos;\n      add_edges_uniform(G, p, generator, mst);\n      return std::make_tuple(G, Ed, p);\n    }\n  }\n\n  template<class Sizes, class Degrees>\n  test_suite(std::string t, unsigned z, Sizes ns, Degrees ds) : t(t), sizes(ns), degrees(ds) {\n    seeds.resize(z);\n    generate_seeds(seeds.begin(), seeds.end());\n  }\nprivate:\n  std::string t;\n  std::vector<unsigned> sizes;\n  std::vector<double> degrees;\n  std::vector<unsigned> seeds;\n};\n\ntemplate <class Graph>\nclass file_suite {\npublic:\n  std::tuple<Graph, double, double> get(unsigned i) const {\n    return std::make_tuple(graphs[i], 0, 0);\n  }\n\n  unsigned size() const { return graphs.size(); }\n\n  file_suite(std::string f) : t(f.substr(0, f.find('.'))) {\n    std::ifstream file(f);\n    if(!file.good()) {\n      throw std::invalid_argument(\"File does not exist: \" + f);\n    }\n    int z, n, m, s, t;\n    file >> z;\n    while(z--) {\n      file >> n >> m;\n      Graph G(n);\n      for(int i = 0; i < m; ++i) {\n        file >> s >> t;\n        add_edge(s, t, G);\n      }\n      graphs.push_back(G);\n    }\n    file.close();\n  }\n  std::string type() const {\n    return t;\n  }\nprivate:\n  std::string t;\n  std::vector<Graph> graphs;\n};\n\ntemplate <class Graph>\nclass real_suite {\npublic:\n  unsigned size() const { return seeds.size(); }\n\n  std::tuple<Graph, double, double> get(uint i) const {\n    std::default_random_engine generator(seeds[i]);\n    auto p = shuffled(vertices(G), generator);\n    Graph g(num_vertices(G));\n    for(auto e : range(edges(G)))\n      add_edge(p[source(e, G)], p[target(e, G)], g);\n    return std::make_tuple(G, 0, 0);\n  }\n\n  real_suite(std::string f, unsigned size) : G(0), t(f.substr(0, f.find('.'))), seeds(size) {\n    std::ifstream file(f);\n    if(!file.good()) {\n      throw std::invalid_argument(\"File does not exist: \" + f);\n    }\n    boost::dynamic_properties dp;\n    read_graphml(file, G, dp);\n    generate_seeds(seeds.begin(), seeds.end());\n  }\n  std::string type() const {\n    return t;\n  }\nprivate:\n  Graph G;\n  std::string t;\n  std::vector<unsigned> seeds;\n};\n<|endoftext|>"}
{"text":"<commit_before>\/\/ (C) 2014 Arek Olek\n\n#pragma once\n\n#include <chrono>\n#include <random>\n#include <tuple>\n\n#include <boost\/graph\/graphml.hpp>\n\n#include \"algorithm.hpp\"\n#include \"graph.hpp\"\n\nunsigned time_seed() {\n  return std::chrono::system_clock::now().time_since_epoch().count();\n}\n\ntemplate <class Iterator>\nvoid generate_seeds(Iterator begin, Iterator end) {\n  static std::string seed = std::to_string(time_seed());\n  std::seed_seq seq(seed.begin(), seed.end());\n  seq.generate(begin, end);\n}\n\ndouble pr_within(double x) {\n  return x <= 1\n    ?  .5*x*x*x*x - 8.\/3*x*x*x + M_PI*x*x\n    : -.5*x*x*x*x - 4*x*x*atan(sqrt(x*x-1)) + 4.\/3*(2*x*x+1)*sqrt(x*x-1) + (M_PI-2)*x*x + 1.\/3;\n};\n\ntemplate <class Graph>\nclass test_suite {\npublic:\n  unsigned size() const { return seeds.size() * degrees.size() * sizes.size(); }\n\n  std::string type() const { return t; }\n\n  std::tuple<Graph, double, double> get(unsigned i) const {\n    std::default_random_engine generator(seeds[i % seeds.size()]);\n    auto Ed = degrees[(i \/ seeds.size()) % degrees.size()];\n    auto n = sizes[i \/ seeds.size() \/ degrees.size()];\n    auto d = Ed;\n    Graph G(n);\n\n    if(t.find(\"path\") != std::string::npos) {\n      add_spider(G, 1, generator);\n      \/\/ the overlap satisfies    y     = a    x     + b\n      \/\/ full graph satisfies:    0     = a  (n-1)   + b\n      \/\/ tree graph satisfies: 2(n-1)\/n = a 2(n-1)\/n + b\n      \/\/ so we must subtract this:\n      d -= 2\/(2-double(n)) * d + 1. + double(n)\/(n-2);\n    }\n    if(t.find(\"rgg\") != std::string::npos) {\n      auto r = find_argument(d\/(n-1), pr_within, 0, sqrt(2));\n      Geometric points(n, generator);\n      points.add_random_geometric(G, r);\n      if(t.find(\"mst\") != std::string::npos) points.add_mst(G);\n      return std::make_tuple(G, Ed, r);\n    } else {\n      auto p = d\/(n-1);\n      bool mst = t.find(\"mst\") != std::string::npos;\n      add_edges_uniform(G, p, generator, mst);\n      return std::make_tuple(G, Ed, p);\n    }\n  }\n\n  template<class Sizes, class Degrees>\n  test_suite(std::string t, unsigned z, Sizes ns, Degrees ds) : t(t), sizes(ns), degrees(ds) {\n    seeds.resize(z);\n    generate_seeds(seeds.begin(), seeds.end());\n  }\nprivate:\n  std::string t;\n  std::vector<unsigned> sizes;\n  std::vector<double> degrees;\n  std::vector<unsigned> seeds;\n};\n\ntemplate <class Graph>\nclass file_suite {\npublic:\n  std::tuple<Graph, double, double> get(unsigned i) const {\n    return std::make_tuple(graphs[i], 0, 0);\n  }\n\n  unsigned size() const { return graphs.size(); }\n\n  file_suite(std::string f) : t(f.substr(0, f.find('.'))) {\n    std::ifstream file(f);\n    if(!file.good()) {\n      throw std::invalid_argument(\"File does not exist: \" + f);\n    }\n    int z, n, m, s, t;\n    file >> z;\n    while(z--) {\n      file >> n >> m;\n      Graph G(n);\n      for(int i = 0; i < m; ++i) {\n        file >> s >> t;\n        add_edge(s, t, G);\n      }\n      graphs.push_back(G);\n    }\n    file.close();\n  }\n  std::string type() const {\n    return t;\n  }\nprivate:\n  std::string t;\n  std::vector<Graph> graphs;\n};\n\ntemplate <class Graph>\nclass real_suite {\npublic:\n  unsigned size() const { return seeds.size(); }\n\n  std::tuple<Graph, double, double> get(uint i) const {\n    std::default_random_engine generator(seeds[i]);\n    auto p = shuffled(vertices(G), generator);\n    Graph g(num_vertices(G));\n    for(auto e : range(edges(G)))\n      add_edge(p[source(e, G)], p[target(e, G)], g);\n    return std::make_tuple(G, 0, 0);\n  }\n\n  real_suite(std::string f, unsigned size) : G(0), t(f.substr(0, f.find('.'))), seeds(size) {\n    std::ifstream file(f);\n    if(!file.good()) {\n      throw std::invalid_argument(\"File does not exist: \" + f);\n    }\n    boost::dynamic_properties dp;\n    read_graphml(file, G, dp);\n    generate_seeds(seeds.begin(), seeds.end());\n  }\n  std::string type() const {\n    return t;\n  }\nprivate:\n  Graph G;\n  std::string t;\n  std::vector<unsigned> seeds;\n};\n<commit_msg>tweak degree when augmenting with an mst<commit_after>\/\/ (C) 2014 Arek Olek\n\n#pragma once\n\n#include <chrono>\n#include <random>\n#include <tuple>\n\n#include <boost\/graph\/graphml.hpp>\n\n#include \"algorithm.hpp\"\n#include \"graph.hpp\"\n\nunsigned time_seed() {\n  return std::chrono::system_clock::now().time_since_epoch().count();\n}\n\ntemplate <class Iterator>\nvoid generate_seeds(Iterator begin, Iterator end) {\n  static std::string seed = std::to_string(time_seed());\n  std::seed_seq seq(seed.begin(), seed.end());\n  seq.generate(begin, end);\n}\n\ndouble pr_within(double x) {\n  return x <= 1\n    ?  .5*x*x*x*x - 8.\/3*x*x*x + M_PI*x*x\n    : -.5*x*x*x*x - 4*x*x*atan(sqrt(x*x-1)) + 4.\/3*(2*x*x+1)*sqrt(x*x-1) + (M_PI-2)*x*x + 1.\/3;\n};\n\ntemplate <class Graph>\nclass test_suite {\npublic:\n  unsigned size() const { return seeds.size() * degrees.size() * sizes.size(); }\n\n  std::string type() const { return t; }\n\n  std::tuple<Graph, double, double> get(unsigned i) const {\n    std::default_random_engine generator(seeds[i % seeds.size()]);\n    auto Ed = degrees[(i \/ seeds.size()) % degrees.size()];\n    auto n = sizes[i \/ seeds.size() \/ degrees.size()];\n    auto d = Ed;\n    auto td = 2.*(n-1)\/n;\n    bool mst = t.find(\"mst\") != std::string::npos;\n    Graph G(n);\n\n    if(t.find(\"path\") != std::string::npos) {\n      add_spider(G, 1, generator);\n      \/\/ the overlap satisfies    y     = a    x     + b\n      \/\/ full graph satisfies:    0     = a  (n-1)   + b\n      \/\/ tree graph satisfies: 2(n-1)\/n = a 2(n-1)\/n + b\n      \/\/ so we must subtract this:\n      d -= 2.\/(2.-n) * d + 1. + n\/(n-2.);\n    }\n    if(t.find(\"rgg\") != std::string::npos) {\n      if(mst) d -= d<2 ? td : 1\/sinh(d-sqrt(2.)); \/\/ approximate fit\n      auto r = find_argument(d\/(n-1), pr_within, 0, sqrt(2.));\n      Geometric points(n, generator);\n      points.add_random_geometric(G, r);\n      if(mst) points.add_mst(G);\n      return std::make_tuple(G, Ed, r);\n    } else {\n      if(mst) d -= d<2 ? td : 1\/(2*M_PI*sinh(d-M_PI\/sqrt(3.))); \/\/ approximate fit\n      auto p = d<0 ? 0 : d\/(n-1);\n      add_edges_uniform(G, p, generator, mst);\n      return std::make_tuple(G, Ed, p);\n    }\n  }\n\n  template<class Sizes, class Degrees>\n  test_suite(std::string t, unsigned z, Sizes ns, Degrees ds) : t(t), sizes(ns), degrees(ds) {\n    seeds.resize(z);\n    generate_seeds(seeds.begin(), seeds.end());\n  }\nprivate:\n  std::string t;\n  std::vector<unsigned> sizes;\n  std::vector<double> degrees;\n  std::vector<unsigned> seeds;\n};\n\ntemplate <class Graph>\nclass file_suite {\npublic:\n  std::tuple<Graph, double, double> get(unsigned i) const {\n    return std::make_tuple(graphs[i], 0, 0);\n  }\n\n  unsigned size() const { return graphs.size(); }\n\n  file_suite(std::string f) : t(f.substr(0, f.find('.'))) {\n    std::ifstream file(f);\n    if(!file.good()) {\n      throw std::invalid_argument(\"File does not exist: \" + f);\n    }\n    int z, n, m, s, t;\n    file >> z;\n    while(z--) {\n      file >> n >> m;\n      Graph G(n);\n      for(int i = 0; i < m; ++i) {\n        file >> s >> t;\n        add_edge(s, t, G);\n      }\n      graphs.push_back(G);\n    }\n    file.close();\n  }\n  std::string type() const {\n    return t;\n  }\nprivate:\n  std::string t;\n  std::vector<Graph> graphs;\n};\n\ntemplate <class Graph>\nclass real_suite {\npublic:\n  unsigned size() const { return seeds.size(); }\n\n  std::tuple<Graph, double, double> get(uint i) const {\n    std::default_random_engine generator(seeds[i]);\n    auto p = shuffled(vertices(G), generator);\n    Graph g(num_vertices(G));\n    for(auto e : range(edges(G)))\n      add_edge(p[source(e, G)], p[target(e, G)], g);\n    return std::make_tuple(G, 0, 0);\n  }\n\n  real_suite(std::string f, unsigned size) : G(0), t(f.substr(0, f.find('.'))), seeds(size) {\n    std::ifstream file(f);\n    if(!file.good()) {\n      throw std::invalid_argument(\"File does not exist: \" + f);\n    }\n    boost::dynamic_properties dp;\n    read_graphml(file, G, dp);\n    generate_seeds(seeds.begin(), seeds.end());\n  }\n  std::string type() const {\n    return t;\n  }\nprivate:\n  Graph G;\n  std::string t;\n  std::vector<unsigned> seeds;\n};\n<|endoftext|>"}
{"text":"<commit_before>#include \"libtorrent\/session.hpp\"\n#include \"libtorrent\/session_settings.hpp\"\n#include \"libtorrent\/hasher.hpp\"\n#include \"libtorrent\/alert_types.hpp\"\n#include <boost\/thread.hpp>\n#include <boost\/tuple\/tuple.hpp>\n#include <boost\/filesystem\/operations.hpp>\n\n#include \"test.hpp\"\n#include \"setup_transfer.hpp\"\n\nusing boost::filesystem::remove_all;\nusing boost::filesystem::exists;\n\nvoid test_swarm()\n{\n\tusing namespace libtorrent;\n\n\tsession ses1(fingerprint(\"LT\", 0, 1, 0, 0), std::make_pair(48000, 49000));\n\tsession ses2(fingerprint(\"LT\", 0, 1, 0, 0), std::make_pair(49000, 50000));\n\tsession ses3(fingerprint(\"LT\", 0, 1, 0, 0), std::make_pair(50000, 51000));\n\n\tses1.set_severity_level(alert::debug);\n\tses2.set_severity_level(alert::debug);\n\tses3.set_severity_level(alert::debug);\n\t\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\tses1.set_settings(settings);\n\tses2.set_settings(settings);\n\tses3.set_settings(settings);\n\n#ifndef TORRENT_DISABLE_ENCRYPTION\n\tpe_settings pes;\n\tpes.out_enc_policy = pe_settings::forced;\n\tpes.in_enc_policy = pe_settings::forced;\n\tses1.set_pe_settings(pes);\n\tses2.set_pe_settings(pes);\n\tses3.set_pe_settings(pes);\n#endif\n\n\ttorrent_handle tor1;\n\ttorrent_handle tor2;\n\ttorrent_handle tor3;\n\n\tboost::tie(tor1, tor2, tor3) = setup_transfer(&ses1, &ses2, &ses3, true, false, true, \"_swarm\");\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 < 27; ++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\tTEST_CHECK(std::fabs(average2 - float(rate_limit)) < rate_limit \/ 11.f);\n\tTEST_CHECK(std::fabs(average3 - float(rate_limit)) < rate_limit \/ 11.f);\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->msg() << 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();\n\talert const* ret = ses1.wait_for_alert(seconds(2));\n\tTEST_CHECK(ret == 0);\n\tif (ret != 0) std::cerr << ret->msg() << std::endl;\n\tTEST_CHECK(time_now() - start < seconds(3));\n\tTEST_CHECK(time_now() - start > seconds(2));\n}\n\nint test_main()\n{\n\tusing namespace libtorrent;\n\tusing namespace boost::filesystem;\n\n\t\/\/ in case the previous run was terminated\n\ttry { remove_all(\".\/tmp1_swarm\"); } catch (std::exception&) {}\n\ttry { remove_all(\".\/tmp2_swarm\"); } catch (std::exception&) {}\n\ttry { remove_all(\".\/tmp3_swarm\"); } catch (std::exception&) {}\n\n\ttest_swarm();\n\t\n\ttest_sleep(2000);\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\");\n\tremove_all(\".\/tmp2_swarm\");\n\tremove_all(\".\/tmp3_swarm\");\n\n\treturn 0;\n}\n\n<commit_msg>test_swarm fix<commit_after>#include \"libtorrent\/session.hpp\"\n#include \"libtorrent\/session_settings.hpp\"\n#include \"libtorrent\/hasher.hpp\"\n#include \"libtorrent\/alert_types.hpp\"\n#include <boost\/thread.hpp>\n#include <boost\/tuple\/tuple.hpp>\n#include <boost\/filesystem\/operations.hpp>\n\n#include \"test.hpp\"\n#include \"setup_transfer.hpp\"\n\nusing boost::filesystem::remove_all;\nusing boost::filesystem::exists;\n\nvoid test_swarm()\n{\n\tusing namespace libtorrent;\n\n\tsession ses1(fingerprint(\"LT\", 0, 1, 0, 0), std::make_pair(48000, 49000));\n\tsession ses2(fingerprint(\"LT\", 0, 1, 0, 0), std::make_pair(49000, 50000));\n\tsession ses3(fingerprint(\"LT\", 0, 1, 0, 0), std::make_pair(50000, 51000));\n\n\tses1.set_severity_level(alert::debug);\n\tses2.set_severity_level(alert::debug);\n\tses3.set_severity_level(alert::debug);\n\t\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\tses1.set_settings(settings);\n\tses2.set_settings(settings);\n\tses3.set_settings(settings);\n\n#ifndef TORRENT_DISABLE_ENCRYPTION\n\tpe_settings pes;\n\tpes.out_enc_policy = pe_settings::forced;\n\tpes.in_enc_policy = pe_settings::forced;\n\tses1.set_pe_settings(pes);\n\tses2.set_pe_settings(pes);\n\tses3.set_pe_settings(pes);\n#endif\n\n\ttorrent_handle tor1;\n\ttorrent_handle tor2;\n\ttorrent_handle tor3;\n\n\tboost::tie(tor1, tor2, tor3) = setup_transfer(&ses1, &ses2, &ses3, true, false, true, \"_swarm\");\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 < 30; ++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\tTEST_CHECK(std::fabs(average2 - float(rate_limit)) < rate_limit \/ 11.f);\n\tTEST_CHECK(std::fabs(average3 - float(rate_limit)) < rate_limit \/ 11.f);\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->msg() << 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();\n\talert const* ret = ses1.wait_for_alert(seconds(2));\n\tTEST_CHECK(ret == 0);\n\tif (ret != 0) std::cerr << ret->msg() << std::endl;\n\tTEST_CHECK(time_now() - start < seconds(3));\n\tTEST_CHECK(time_now() - start > seconds(2));\n}\n\nint test_main()\n{\n\tusing namespace libtorrent;\n\tusing namespace boost::filesystem;\n\n\t\/\/ in case the previous run was terminated\n\ttry { remove_all(\".\/tmp1_swarm\"); } catch (std::exception&) {}\n\ttry { remove_all(\".\/tmp2_swarm\"); } catch (std::exception&) {}\n\ttry { remove_all(\".\/tmp3_swarm\"); } catch (std::exception&) {}\n\n\ttest_swarm();\n\t\n\ttest_sleep(2000);\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\");\n\tremove_all(\".\/tmp2_swarm\");\n\tremove_all(\".\/tmp3_swarm\");\n\n\treturn 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before><?hh \/\/ strict\nnamespace Usox\\Sharesta;\n\nuse function Facebook\\FBExpect\\expect;\nuse HH\\Lib\\Str;\n\nclass RouterTest extends \\PHPUnit_Framework_TestCase {\n\n\tprivate ?\\JsonSerializable $result;\n\n\tprivate ?RequestInterface $request;\n\n\tprivate ?ApiFactoryInterface $api_factory;\n\n\tprivate ?ResponseInterface $response;\n\n\tprivate ?Router $router;\n\n\tprivate string $base_path = 'some-nice-path';\n\n\tprivate string $default_result = 'roedlbroem';\n\n\tpublic function setUp(): void {\n\t\t\/\/ UNSAFE\n\t\t$this->result = \\Mockery::mock(\\JsonSerializable::class);\n\t\t$this->request = \\Mockery::mock(RequestInterface::class);\n\t\t$this->api_factory = \\Mockery::mock(ApiFactoryInterface::class);\n\t\t$this->response = \\Mockery::mock(ResponseInterface::class);\n\n\t\t$this->router = new Router(\n\t\t\t$this->api_factory,\n\t\t\t$this->request\n\t\t);\n\t}\n\n\tpublic function testRouterMatchesRequestCorrectly(): void {\n\t\t$this->router?->register('users\/:id\/:field', $this->getCallable());\n\n\t\t$this->createRequest('users\/12\/name', 'GET');\n\n\t\t\/\/ UNSAFE\n\t\t$this->request\n\t\t\t->shouldReceive('setRouteParameters')\n\t\t\t->with(\\Mockery::on(function ($value) {\n\t\t\t\treturn $value->toArray() == ['id' => 12, 'field' => 'name'];\n\t\t\t}))\n\t\t\t->once();\n\n\t\t$this->api_factory\n\t\t\t->shouldReceive('createResponse')\n\t\t\t->with(Router::HTTP_OK, Str\\format('\"%s\"', $this->default_result))\n\t\t\t->once()\n\t\t\t->andReturn($this->response);\n\n\t\t$this->response\n\t\t\t->shouldReceive('send')\n\t\t\t->once();\n\n\t\t$this->result\n\t\t\t->shouldReceive('jsonSerialize')\n\t\t\t->once()\n\t\t\t->andReturn($this->default_result);\n\n\t\texpect(\n\t\t\t$this->router?->route($this->base_path)\n\t\t)\n\t\t->toBeNull();\n\t}\n\n\tpublic function testRouterCatchesDefaultExceptionCorrectly(): void {\n\t\t\/\/ UNSAFE\n\t\t$this->request\n\t\t\t->shouldReceive('getRoute')\n\t\t\t->once()\n\t\t\t->andThrow(new \\Exception());\n\n\t\t$this->api_factory\n\t\t\t->shouldReceive('createResponse')\n\t\t\t->with(Router::HTTP_INTERNAL_SERVER_ERROR, 'Internal server error')\n\t\t\t->once()\n\t\t\t->andReturn($this->response);\n\n\t\t$this->response\n\t\t\t->shouldReceive('send')\n\t\t\t->once();\n\t\t\n\t\texpect(\n\t\t\t$this->router?->route($this->base_path)\n\t\t)\n\t\t->toBeNull();\n\t}\n\n\tpublic function testRouterFailsToMatchRequestCorrectly(): void {\n\t\t$this->router?->register('foo\/:id\/:field', $this->getCallable());\n\n\t\t$this->createRequest('\/api\/users\/12\/name', 'GET');\n\n\t\t\/\/ UNSAFE\n\t\t$this->api_factory\n\t\t\t->shouldReceive('createResponse')\n\t\t\t->with(Router::HTTP_NOT_FOUND, 'The requested resource was not found')\n\t\t\t->once()\n\t\t\t->andReturn($this->response);\n\n\t\t$this->response\n\t\t\t->shouldReceive('send')\n\t\t\t->once();\n\n\t\texpect(\n\t\t\t$this->router?->route($this->base_path)\n\t\t)\n\t\t->toBeNull();\n\t}\n\n\tpublic function testRouterMatchesSpecificHTTPMethodCorrectly(): void {\n\t\t$this->router?->register('gettest\/:id\/:field', $this->getCallable(), 'GET');\n\t\t$this->router?->register('posttest\/:id\/:field', $this->getCallable(), 'POST');\n\t\t$this->router?->register('puttest\/:id\/:field', $this->getCallable(), 'PUT');\n\t\t$this->router?->register('deltest\/:id\/:field', $this->getCallable(), 'DELETE');\n\n\t\t\/\/ UNSAFE\n\t\t$this->request\n\t\t\t->shouldReceive('setRouteParameters')\n\t\t\t->with(\\Mockery::on(function ($value) {\n\t\t\t\treturn $value->toArray() == ['id' => 12, 'field' => 'name'];\n\t\t\t}))\n\t\t\t->times(4);\n\n\t\t$this->api_factory\n\t\t\t->shouldReceive('createResponse')\n\t\t\t->with(Router::HTTP_OK, Str\\format('\"%s\"', $this->default_result))\n\t\t\t->times(4)\n\t\t\t->andReturn($this->response);\n\n\t\t$this->response\n\t\t\t->shouldReceive('send')\n\t\t\t->times(4);\n\n\t\t$this->result\n\t\t\t->shouldReceive('jsonSerialize')\n\t\t\t->times(4)\n\t\t\t->andReturn($this->default_result);\n\n\t\t$this->createRequest('gettest\/12\/name', 'GET');\n\n\t\texpect($this->router?->route($this->base_path))->toBeNull();\n\n\t\t$this->createRequest('posttest\/12\/name', 'POST');\n\n\t\texpect($this->router?->route($this->base_path))->toBeNull();\n\n\t\t$this->createRequest('puttest\/12\/name', 'PUT');\n\n\t\texpect($this->router?->route($this->base_path))->toBeNull();\n\n\t\t$this->createRequest('deltest\/12\/name', 'DELETE');\n\n\t\texpect($this->router?->route($this->base_path))->toBeNull();\n\t}\n\n\tpublic function testRouterMatchesSpecificHTTPMethodCorrectlyUsingShortcuts(): void {\n\t\t$this->router?->get('gettest\/:id\/:field', $this->getCallable());\n\t\t$this->router?->post('posttest\/:id\/:field', $this->getCallable());\n\t\t$this->router?->put('puttest\/:id\/:field', $this->getCallable());\n\t\t$this->router?->delete('deltest\/:id\/:field', $this->getCallable());\n\n\t\t\/\/ UNSAFE\n\t\t$this->request\n\t\t\t->shouldReceive('setRouteParameters')\n\t\t\t->with(\\Mockery::on(function ($value) {\n\t\t\t\treturn $value->toArray() == ['id' => 12, 'field' => 'name'];\n\t\t\t}))\n\t\t\t->times(4);\n\n\t\t$this->api_factory\n\t\t\t->shouldReceive('createResponse')\n\t\t\t->with(Router::HTTP_OK, Str\\format('\"%s\"', $this->default_result))\n\t\t\t->times(4)\n\t\t\t->andReturn($this->response);\n\n\t\t$this->response\n\t\t\t->shouldReceive('send')\n\t\t\t->times(4);\n\n\t\t$this->result\n\t\t\t->shouldReceive('jsonSerialize')\n\t\t\t->times(4)\n\t\t\t->andReturn($this->default_result);\n\n\t\t$this->createRequest('gettest\/12\/name', 'GET');\n\n\t\texpect($this->router?->route($this->base_path))->toBeNull();\n\n\t\t$this->createRequest('posttest\/12\/name', 'POST');\n\n\t\texpect($this->router?->route($this->base_path))->toBeNull();\n\n\t\t$this->createRequest('puttest\/12\/name', 'PUT');\n\n\t\texpect($this->router?->route($this->base_path))->toBeNull();\n\n\t\t$this->createRequest('deltest\/12\/name', 'DELETE');\n\n\t\texpect($this->router?->route($this->base_path))->toBeNull();\n\t}\n\n\tprivate function createRequest(string $route, string $http_method): void {\n\t\t\/\/ UNSAFE\n\t\t$this->request->shouldReceive('getRoute')->once()->andReturn($route);\n\t\t$this->request->shouldReceive('getHttpMethod')->once()->andReturn($http_method);\n\t}\n\n\tprivate function getCallable(): (function(RequestInterface): \\JsonSerializable) {\n\t\treturn function(RequestInterface $request): \\JsonSerializable {\n\t\t\tif ($this->result !== null) {\n\t\t\t\treturn $this->result;\n\t\t\t}\n\t\t\tthrow new \\Exception();\n\t\t};\n\t}\n}\n<commit_msg>Remove on mockery occurance<commit_after><?hh \/\/ strict\nnamespace Usox\\Sharesta;\n\nuse function Facebook\\FBExpect\\expect;\nuse HH\\Lib\\Str;\n\nclass RouterTest extends \\PHPUnit_Framework_TestCase {\n\n\tprivate ?\\JsonSerializable $result;\n\n\tprivate ?RequestInterface $request;\n\n\tprivate ?ApiFactoryInterface $api_factory;\n\n\tprivate ?ResponseInterface $response;\n\n\tprivate ?Router $router;\n\n\tprivate string $base_path = 'some-nice-path';\n\n\tprivate string $default_result = 'roedlbroem';\n\n\tpublic function setUp(): void {\n\t\t$this->result = $this->createMock(\\JsonSerializable::class);\n\t\t\/\/ UNSAFE\n\t\t$this->request = \\Mockery::mock(RequestInterface::class);\n\t\t$this->api_factory = \\Mockery::mock(ApiFactoryInterface::class);\n\t\t$this->response = \\Mockery::mock(ResponseInterface::class);\n\n\t\t$this->router = new Router(\n\t\t\t$this->api_factory,\n\t\t\t$this->request\n\t\t);\n\t}\n\n\tpublic function testRouterMatchesRequestCorrectly(): void {\n\t\t$this->router?->register('users\/:id\/:field', $this->getCallable());\n\n\t\t$this->createRequest('users\/12\/name', 'GET');\n\n\t\t\/\/ UNSAFE\n\t\t$this->request\n\t\t\t->shouldReceive('setRouteParameters')\n\t\t\t->with(\\Mockery::on(function ($value) {\n\t\t\t\treturn $value->toArray() == ['id' => 12, 'field' => 'name'];\n\t\t\t}))\n\t\t\t->once();\n\n\t\t$this->result\n\t\t\t?->expects(static::once())\n\t\t\t?->method('jsonSerialize')\n\t\t\t?->willReturn($this->default_result);\n\n\t\t$this->api_factory\n\t\t\t->shouldReceive('createResponse')\n\t\t\t->with(Router::HTTP_OK, Str\\format('\"%s\"', $this->default_result))\n\t\t\t->once()\n\t\t\t->andReturn($this->response);\n\n\t\t$this->response\n\t\t\t->shouldReceive('send')\n\t\t\t->once();\n\n\t\texpect(\n\t\t\t$this->router?->route($this->base_path)\n\t\t)\n\t\t->toBeNull();\n\t}\n\n\tpublic function testRouterCatchesDefaultExceptionCorrectly(): void {\n\t\t\/\/ UNSAFE\n\t\t$this->request\n\t\t\t->shouldReceive('getRoute')\n\t\t\t->once()\n\t\t\t->andThrow(new \\Exception());\n\n\t\t$this->api_factory\n\t\t\t->shouldReceive('createResponse')\n\t\t\t->with(Router::HTTP_INTERNAL_SERVER_ERROR, 'Internal server error')\n\t\t\t->once()\n\t\t\t->andReturn($this->response);\n\n\t\t$this->response\n\t\t\t->shouldReceive('send')\n\t\t\t->once();\n\t\t\n\t\texpect(\n\t\t\t$this->router?->route($this->base_path)\n\t\t)\n\t\t->toBeNull();\n\t}\n\n\tpublic function testRouterFailsToMatchRequestCorrectly(): void {\n\t\t$this->router?->register('foo\/:id\/:field', $this->getCallable());\n\n\t\t$this->createRequest('\/api\/users\/12\/name', 'GET');\n\n\t\t\/\/ UNSAFE\n\t\t$this->api_factory\n\t\t\t->shouldReceive('createResponse')\n\t\t\t->with(Router::HTTP_NOT_FOUND, 'The requested resource was not found')\n\t\t\t->once()\n\t\t\t->andReturn($this->response);\n\n\t\t$this->response\n\t\t\t->shouldReceive('send')\n\t\t\t->once();\n\n\t\texpect(\n\t\t\t$this->router?->route($this->base_path)\n\t\t)\n\t\t->toBeNull();\n\t}\n\n\tpublic function testRouterMatchesSpecificHTTPMethodCorrectly(): void {\n\t\t$this->router?->register('gettest\/:id\/:field', $this->getCallable(), 'GET');\n\t\t$this->router?->register('posttest\/:id\/:field', $this->getCallable(), 'POST');\n\t\t$this->router?->register('puttest\/:id\/:field', $this->getCallable(), 'PUT');\n\t\t$this->router?->register('deltest\/:id\/:field', $this->getCallable(), 'DELETE');\n\n\t\t\/\/ UNSAFE\n\t\t$this->request\n\t\t\t->shouldReceive('setRouteParameters')\n\t\t\t->with(\\Mockery::on(function ($value) {\n\t\t\t\treturn $value->toArray() == ['id' => 12, 'field' => 'name'];\n\t\t\t}))\n\t\t\t->times(4);\n\n\t\t$this->api_factory\n\t\t\t->shouldReceive('createResponse')\n\t\t\t->with(Router::HTTP_OK, Str\\format('\"%s\"', $this->default_result))\n\t\t\t->times(4)\n\t\t\t->andReturn($this->response);\n\n\t\t$this->response\n\t\t\t->shouldReceive('send')\n\t\t\t->times(4);\n\n\t\t$this->result\n\t\t\t?->expects(static::exactly(4))\n\t\t\t?->method('jsonSerialize')\n\t\t\t?->willReturn($this->default_result);\n\n\t\t$this->createRequest('gettest\/12\/name', 'GET');\n\n\t\texpect($this->router?->route($this->base_path))->toBeNull();\n\n\t\t$this->createRequest('posttest\/12\/name', 'POST');\n\n\t\texpect($this->router?->route($this->base_path))->toBeNull();\n\n\t\t$this->createRequest('puttest\/12\/name', 'PUT');\n\n\t\texpect($this->router?->route($this->base_path))->toBeNull();\n\n\t\t$this->createRequest('deltest\/12\/name', 'DELETE');\n\n\t\texpect($this->router?->route($this->base_path))->toBeNull();\n\t}\n\n\tpublic function testRouterMatchesSpecificHTTPMethodCorrectlyUsingShortcuts(): void {\n\t\t$this->router?->get('gettest\/:id\/:field', $this->getCallable());\n\t\t$this->router?->post('posttest\/:id\/:field', $this->getCallable());\n\t\t$this->router?->put('puttest\/:id\/:field', $this->getCallable());\n\t\t$this->router?->delete('deltest\/:id\/:field', $this->getCallable());\n\n\t\t\/\/ UNSAFE\n\t\t$this->request\n\t\t\t->shouldReceive('setRouteParameters')\n\t\t\t->with(\\Mockery::on(function ($value) {\n\t\t\t\treturn $value->toArray() == ['id' => 12, 'field' => 'name'];\n\t\t\t}))\n\t\t\t->times(4);\n\n\t\t$this->api_factory\n\t\t\t->shouldReceive('createResponse')\n\t\t\t->with(Router::HTTP_OK, Str\\format('\"%s\"', $this->default_result))\n\t\t\t->times(4)\n\t\t\t->andReturn($this->response);\n\n\t\t$this->response\n\t\t\t->shouldReceive('send')\n\t\t\t->times(4);\n\n\t\t$this->result\n\t\t\t?->expects(static::exactly(4))\n\t\t\t?->method('jsonSerialize')\n\t\t\t?->willReturn($this->default_result);\n\n\t\t$this->createRequest('gettest\/12\/name', 'GET');\n\n\t\texpect($this->router?->route($this->base_path))->toBeNull();\n\n\t\t$this->createRequest('posttest\/12\/name', 'POST');\n\n\t\texpect($this->router?->route($this->base_path))->toBeNull();\n\n\t\t$this->createRequest('puttest\/12\/name', 'PUT');\n\n\t\texpect($this->router?->route($this->base_path))->toBeNull();\n\n\t\t$this->createRequest('deltest\/12\/name', 'DELETE');\n\n\t\texpect($this->router?->route($this->base_path))->toBeNull();\n\t}\n\n\tprivate function createRequest(string $route, string $http_method): void {\n\t\t\/\/ UNSAFE\n\t\t$this->request->shouldReceive('getRoute')->once()->andReturn($route);\n\t\t$this->request->shouldReceive('getHttpMethod')->once()->andReturn($http_method);\n\t}\n\n\tprivate function getCallable(): (function(RequestInterface): \\JsonSerializable) {\n\t\treturn function(RequestInterface $request): \\JsonSerializable {\n\t\t\tif ($this->result !== null) {\n\t\t\t\treturn $this->result;\n\t\t\t}\n\t\t\tthrow new \\Exception();\n\t\t};\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <glib.h>\n#include \"cmake.h\"\n#include \"project_build.h\"\n#include <boost\/filesystem.hpp>\n\nint main() {\n  CMake cmake(JUCI_TESTS_PATH);\n  \n  g_assert(cmake.project_path.filename()==\"jucipp\");\n  \n  auto functions_parameters=cmake.get_functions_parameters(\"project\");\n  g_assert(functions_parameters.at(0).second.at(0)==\"juci\");\n  \n  g_assert(cmake.get_executable(boost::filesystem::path(JUCI_TESTS_PATH)\/\"cmake_test.cc\").filename()==\"cmake_test\");\n  \n  auto build=Project::Build::create(JUCI_TESTS_PATH);\n  g_assert(dynamic_cast<Project::CMakeBuild*>(build.get()));\n}\n<commit_msg>Fixed cmake_test in case jucipp folder is not named jucipp<commit_after>#include <glib.h>\n#include \"cmake.h\"\n#include \"project_build.h\"\n#include <boost\/filesystem.hpp>\n\nint main() {\n  auto tests_path=boost::filesystem::canonical(JUCI_TESTS_PATH);\n  \n  CMake cmake(tests_path);\n  \n  g_assert(cmake.project_path==boost::filesystem::canonical(tests_path\/\"..\"));\n  \n  auto functions_parameters=cmake.get_functions_parameters(\"project\");\n  g_assert(functions_parameters.at(0).second.at(0)==\"juci\");\n  \n  g_assert(cmake.get_executable(boost::filesystem::path(JUCI_TESTS_PATH)\/\"cmake_test.cc\").filename()==\"cmake_test\");\n  \n  auto build=Project::Build::create(JUCI_TESTS_PATH);\n  g_assert(dynamic_cast<Project::CMakeBuild*>(build.get()));\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n  * Touhou Community Reliant Automatic Patcher\n  * Main DLL\n  *\n  * ----\n  *\n  * Repository handling.\n  *\/\n\n#include \"thcrap.h\"\n#include \"thcrap_update_wrapper.h\"\n#include <algorithm>\n\nTH_CALLER_FREE char *RepoGetLocalFN(const char *id)\n{\n\treturn strdup_cat(\"repos\/\", id, \"\/repo.js\");\n}\n\nrepo_t *RepoLoadJson(json_t *repo_js)\n{\n\tif (!json_is_object(repo_js)) {\n\t\treturn nullptr;\n\t}\n\trepo_t *repo = (repo_t*)malloc(sizeof(repo_t));\n\n\trepo->id = json_object_get_string_copy(repo_js, \"id\");\n\trepo->title = json_object_get_string_copy(repo_js, \"title\");\n\trepo->contact = json_object_get_string_copy(repo_js, \"contact\");\n\trepo->servers = json_object_get_string_array_copy(repo_js, \"servers\");\n\trepo->neighbors = json_object_get_string_array_copy(repo_js, \"neighbors\");\n\n\tjson_t *patches = json_object_get(repo_js, \"patches\");\n\tif (json_is_object(patches)) {\n\t\tif (size_t patch_count = json_object_size(patches)) {\n\t\t\trepo->patches = new repo_patch_t[patch_count + 1];\n\t\t\trepo->patches[patch_count].patch_id = NULL;\n\n\t\t\tconst char* patch_id;\n\t\t\tjson_t* patch_title;\n\t\t\trepo_patch_t* patch = repo->patches;\n\t\t\tjson_object_foreach(patches, patch_id, patch_title) {\n\t\t\t\tpatch->patch_id = strdup(patch_id);\n\t\t\t\tpatch->title = json_string_copy(patch_title);\n\t\t\t\t++patch;\n\t\t\t}\n\t\t}\n\t}\n\telse {\n\t\trepo->patches = NULL;\n\t}\n\n\treturn repo;\n}\n\nbool RepoWrite(const repo_t *repo)\n{\n\tif (!repo || !repo->id) {\n\t\treturn false;\n\t}\n\n\tjson_t* repo_js = json_object();\n\n\t\/\/ Prepare json file\n\tjson_object_set_new(repo_js, \"id\", json_string(repo->id));\n\tif (repo->title) {\n\t\tjson_object_set_new(repo_js, \"title\", json_string(repo->title));\n\t}\n\tif (repo->contact) {\n\t\tjson_object_set_new(repo_js, \"contact\", json_string(repo->contact));\n\t}\n\tif (repo->servers) {\n\t\tjson_t *servers = json_array();\n\t\tfor (size_t i = 0; repo->servers[i]; i++) {\n\t\t\tjson_array_append_new(servers, json_string(repo->servers[i]));\n\t\t}\n\t\tjson_object_set_new(repo_js, \"servers\", servers);\n\t}\n\tif (repo->neighbors) {\n\t\tjson_t *neighbors = json_array();\n\t\tfor (size_t i = 0; repo->neighbors[i]; i++) {\n\t\t\tjson_array_append_new(neighbors, json_string(repo->neighbors[i]));\n\t\t}\n\t\tjson_object_set_new(repo_js, \"neighbors\", neighbors);\n\t}\n\tif (repo->patches) {\n\t\tjson_t *patches = json_object();\n\t\tfor (size_t i = 0; repo->patches[i].patch_id; i++) {\n\t\t\tjson_object_set_new(patches, repo->patches[i].patch_id, json_string(repo->patches[i].title));\n\t\t}\n\t\tjson_object_set_new(repo_js, \"patches\", patches);\n\t}\n\n\t\/\/ Write json file\n\tchar *repo_fn_local = RepoGetLocalFN(repo->id);\n\tauto repo_path = std::filesystem::u8path(repo_fn_local);\n\tauto repo_dir = repo_path;\n\trepo_dir.remove_filename();\n\tfree(repo_fn_local);\n\n\tstd::filesystem::create_directories(repo_dir);\n\tint ret = json_dump_file(repo_js, repo_path.u8string().c_str(), JSON_INDENT(4)) == 0;\n\tjson_decref(repo_js);\n\treturn ret;\n}\n\nvoid RepoFree(repo_t *repo)\n{\n\tif (repo) {\n\t\tfree(repo->id);\n\t\tfree(repo->title);\n\t\tfree(repo->contact);\n\n\t\tif (repo->servers) {\n\t\t\tfor (size_t i = 0; repo->servers[i]; i++) {\n\t\t\t\tfree(repo->servers[i]);\n\t\t\t}\n\t\t\tfree(repo->servers);\n\t\t}\n\n\t\tif (repo->neighbors) {\n\t\t\tfor (size_t i = 0; repo->neighbors[i]; i++) {\n\t\t\t\tfree(repo->neighbors[i]);\n\t\t\t}\n\t\t\tfree(repo->neighbors);\n\t\t}\n\n\t\tif (repo->patches) {\n\t\t\tfor (size_t i = 0; repo->patches[i].patch_id; i++) {\n\t\t\t\tfree(repo->patches[i].patch_id);\n\t\t\t\tfree(repo->patches[i].title);\n\t\t\t}\n\t\t\tdelete[] repo->patches;\n\t\t}\n\n\t\tfree(repo);\n\t}\n}\n\nrepo_t *RepoLocalNext(HANDLE *hFind)\n{\n\tjson_t *repo_js = NULL;\n\tWIN32_FIND_DATAA w32fd;\n\tBOOL find_ret = 0;\n\tif(*hFind == NULL) {\n\t\t\/\/ Too bad we can't do \"*\/repo.js\" or something similar.\n\t\t*hFind = FindFirstFile(\"repos\/*\", &w32fd);\n\t\tif(*hFind == INVALID_HANDLE_VALUE) {\n\t\t\treturn NULL;\n\t\t}\n\t} else {\n\t\tfind_ret = W32_ERR_WRAP(FindNextFile(*hFind, &w32fd));\n\t}\n\twhile(!find_ret) {\n\t\tif(\n\t\t\t(w32fd.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY)\n\t\t\t&& strcmp(w32fd.cFileName, \".\")\n\t\t\t&& strcmp(w32fd.cFileName, \"..\")\n\t\t) {\n\t\t\tchar *repo_local_fn = RepoGetLocalFN(w32fd.cFileName);\n\t\t\trepo_js = json_load_file_report(repo_local_fn);\n\t\t\tfree(repo_local_fn);\n\t\t\tif(repo_js) {\n\t\t\t\trepo_t *repo = RepoLoadJson(repo_js);\n\t\t\t\tjson_decref(repo_js);\n\t\t\t\treturn repo;\n\t\t\t}\n\t\t}\n\t\tfind_ret = W32_ERR_WRAP(FindNextFile(*hFind, &w32fd));\n\t};\n\tFindClose(*hFind);\n\treturn NULL;\n}\n\nrepo_t **RepoLoad(void)\n{\n\tHANDLE hFind = nullptr;\n\tstd::vector<repo_t*> repo_vector;\n\n\twhile (repo_t* repo = RepoLocalNext(&hFind)) {\n\t\trepo_vector.push_back(repo);\n\t}\n\tstd::sort(repo_vector.begin(), repo_vector.end(), [](repo_t *a, repo_t *b) {\n\t\treturn strcmp(a->id, b->id) < 0;\n\t});\n\n\tsize_t repo_count = repo_vector.size();\n\trepo_t **repo_array = (repo_t**)malloc(sizeof(repo_t*) * (repo_count + 1));\n\trepo_array[repo_count] = nullptr;\n\tmemcpy(repo_array, &repo_vector[0], sizeof(repo_t*) * repo_count);\n\n\treturn repo_array;\n}\n<commit_msg>repo: fix crash in debug mode with no repos<commit_after>\/**\n  * Touhou Community Reliant Automatic Patcher\n  * Main DLL\n  *\n  * ----\n  *\n  * Repository handling.\n  *\/\n\n#include \"thcrap.h\"\n#include \"thcrap_update_wrapper.h\"\n#include <algorithm>\n\nTH_CALLER_FREE char *RepoGetLocalFN(const char *id)\n{\n\treturn strdup_cat(\"repos\/\", id, \"\/repo.js\");\n}\n\nrepo_t *RepoLoadJson(json_t *repo_js)\n{\n\tif (!json_is_object(repo_js)) {\n\t\treturn nullptr;\n\t}\n\trepo_t *repo = (repo_t*)malloc(sizeof(repo_t));\n\n\trepo->id = json_object_get_string_copy(repo_js, \"id\");\n\trepo->title = json_object_get_string_copy(repo_js, \"title\");\n\trepo->contact = json_object_get_string_copy(repo_js, \"contact\");\n\trepo->servers = json_object_get_string_array_copy(repo_js, \"servers\");\n\trepo->neighbors = json_object_get_string_array_copy(repo_js, \"neighbors\");\n\n\tjson_t *patches = json_object_get(repo_js, \"patches\");\n\tif (json_is_object(patches)) {\n\t\tif (size_t patch_count = json_object_size(patches)) {\n\t\t\trepo->patches = new repo_patch_t[patch_count + 1];\n\t\t\trepo->patches[patch_count].patch_id = NULL;\n\n\t\t\tconst char* patch_id;\n\t\t\tjson_t* patch_title;\n\t\t\trepo_patch_t* patch = repo->patches;\n\t\t\tjson_object_foreach(patches, patch_id, patch_title) {\n\t\t\t\tpatch->patch_id = strdup(patch_id);\n\t\t\t\tpatch->title = json_string_copy(patch_title);\n\t\t\t\t++patch;\n\t\t\t}\n\t\t}\n\t}\n\telse {\n\t\trepo->patches = NULL;\n\t}\n\n\treturn repo;\n}\n\nbool RepoWrite(const repo_t *repo)\n{\n\tif (!repo || !repo->id) {\n\t\treturn false;\n\t}\n\n\tjson_t* repo_js = json_object();\n\n\t\/\/ Prepare json file\n\tjson_object_set_new(repo_js, \"id\", json_string(repo->id));\n\tif (repo->title) {\n\t\tjson_object_set_new(repo_js, \"title\", json_string(repo->title));\n\t}\n\tif (repo->contact) {\n\t\tjson_object_set_new(repo_js, \"contact\", json_string(repo->contact));\n\t}\n\tif (repo->servers) {\n\t\tjson_t *servers = json_array();\n\t\tfor (size_t i = 0; repo->servers[i]; i++) {\n\t\t\tjson_array_append_new(servers, json_string(repo->servers[i]));\n\t\t}\n\t\tjson_object_set_new(repo_js, \"servers\", servers);\n\t}\n\tif (repo->neighbors) {\n\t\tjson_t *neighbors = json_array();\n\t\tfor (size_t i = 0; repo->neighbors[i]; i++) {\n\t\t\tjson_array_append_new(neighbors, json_string(repo->neighbors[i]));\n\t\t}\n\t\tjson_object_set_new(repo_js, \"neighbors\", neighbors);\n\t}\n\tif (repo->patches) {\n\t\tjson_t *patches = json_object();\n\t\tfor (size_t i = 0; repo->patches[i].patch_id; i++) {\n\t\t\tjson_object_set_new(patches, repo->patches[i].patch_id, json_string(repo->patches[i].title));\n\t\t}\n\t\tjson_object_set_new(repo_js, \"patches\", patches);\n\t}\n\n\t\/\/ Write json file\n\tchar *repo_fn_local = RepoGetLocalFN(repo->id);\n\tauto repo_path = std::filesystem::u8path(repo_fn_local);\n\tauto repo_dir = repo_path;\n\trepo_dir.remove_filename();\n\tfree(repo_fn_local);\n\n\tstd::filesystem::create_directories(repo_dir);\n\tint ret = json_dump_file(repo_js, repo_path.u8string().c_str(), JSON_INDENT(4)) == 0;\n\tjson_decref(repo_js);\n\treturn ret;\n}\n\nvoid RepoFree(repo_t *repo)\n{\n\tif (repo) {\n\t\tfree(repo->id);\n\t\tfree(repo->title);\n\t\tfree(repo->contact);\n\n\t\tif (repo->servers) {\n\t\t\tfor (size_t i = 0; repo->servers[i]; i++) {\n\t\t\t\tfree(repo->servers[i]);\n\t\t\t}\n\t\t\tfree(repo->servers);\n\t\t}\n\n\t\tif (repo->neighbors) {\n\t\t\tfor (size_t i = 0; repo->neighbors[i]; i++) {\n\t\t\t\tfree(repo->neighbors[i]);\n\t\t\t}\n\t\t\tfree(repo->neighbors);\n\t\t}\n\n\t\tif (repo->patches) {\n\t\t\tfor (size_t i = 0; repo->patches[i].patch_id; i++) {\n\t\t\t\tfree(repo->patches[i].patch_id);\n\t\t\t\tfree(repo->patches[i].title);\n\t\t\t}\n\t\t\tdelete[] repo->patches;\n\t\t}\n\n\t\tfree(repo);\n\t}\n}\n\nrepo_t *RepoLocalNext(HANDLE *hFind)\n{\n\tjson_t *repo_js = NULL;\n\tWIN32_FIND_DATAA w32fd;\n\tBOOL find_ret = 0;\n\tif(*hFind == NULL) {\n\t\t\/\/ Too bad we can't do \"*\/repo.js\" or something similar.\n\t\t*hFind = FindFirstFile(\"repos\/*\", &w32fd);\n\t\tif(*hFind == INVALID_HANDLE_VALUE) {\n\t\t\treturn NULL;\n\t\t}\n\t} else {\n\t\tfind_ret = W32_ERR_WRAP(FindNextFile(*hFind, &w32fd));\n\t}\n\twhile(!find_ret) {\n\t\tif(\n\t\t\t(w32fd.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY)\n\t\t\t&& strcmp(w32fd.cFileName, \".\")\n\t\t\t&& strcmp(w32fd.cFileName, \"..\")\n\t\t) {\n\t\t\tchar *repo_local_fn = RepoGetLocalFN(w32fd.cFileName);\n\t\t\trepo_js = json_load_file_report(repo_local_fn);\n\t\t\tfree(repo_local_fn);\n\t\t\tif(repo_js) {\n\t\t\t\trepo_t *repo = RepoLoadJson(repo_js);\n\t\t\t\tjson_decref(repo_js);\n\t\t\t\treturn repo;\n\t\t\t}\n\t\t}\n\t\tfind_ret = W32_ERR_WRAP(FindNextFile(*hFind, &w32fd));\n\t};\n\tFindClose(*hFind);\n\treturn NULL;\n}\n\nrepo_t **RepoLoad(void)\n{\n\tHANDLE hFind = nullptr;\n\tstd::vector<repo_t*> repo_vector;\n\n\twhile (repo_t* repo = RepoLocalNext(&hFind)) {\n\t\trepo_vector.push_back(repo);\n\t}\n\tif (repo_vector.empty()) {\n\t\treturn nullptr;\n\t}\n\tstd::sort(repo_vector.begin(), repo_vector.end(), [](repo_t *a, repo_t *b) {\n\t\treturn strcmp(a->id, b->id) < 0;\n\t});\n\n\tsize_t repo_count = repo_vector.size();\n\trepo_t **repo_array = (repo_t**)malloc(sizeof(repo_t*) * (repo_count + 1));\n\trepo_array[repo_count] = nullptr;\n\tmemcpy(repo_array, repo_vector.data(), sizeof(repo_t*) * repo_count);\n\n\treturn repo_array;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"KCClient.h\"\n#define pf [](KCClient *client, const QVariant &data)\n\n\/*\n * Extract or update data from an API response into a QMap<int, modelT*>&\n *\/\ntemplate<class modelT>\ninline void modelizeResponse(const QVariant &data, QMap<int, modelT*> &target,\n                             KCClient *client, int loadId=0, QString idKey=\"api_id\") {\n\tfor(QVariant item : data.toList()) {\n\t\tQVariantMap itemMap = item.toMap();\n\t\tmodelT *&ship = target[itemMap.value(idKey).toInt()];\n\n\t\tif(!ship)\n\t\t\tship = new modelT(itemMap, loadId, client);\n\t\telse\n\t\t\tship->loadFrom(itemMap, loadId);\n\t}\n}\n\nconst std::map<QString, KCClient::processFunc> KCClient::processFuncs = {\n\t{ \"\/kctool\/focus\", \/\/ Focus request\n\t  pf {\n\t\t\tQ_UNUSED(data);\n\t\t\temit client->focusRequested();\n\t\t}\n\t},\n\n\t{ \"\/kcsapi\/api_req_member\/get_incentive\", 0 }, \/\/ Login\n\t{ \"\/kcsapi\/api_start\", 0 },\n\n\t\/\/ Global info -------------------------------------------------------------\n\t{ \"\/kctool\/mastership.json\", \/\/ Ships from our server\n\t\tpf {\n\t\t\tmodelizeResponse(data, client->shipTypes, client);\n\t\t\temit client->receivedShipTypes();\n\t\t}\n\t},\n\t{ \"\/kcsapi\/api_get_master\/ship\", \/\/ Ships\n\t\tpf {\n\t\t\tmodelizeResponse(data, client->shipTypes, client);\n\t\t\temit client->receivedShipTypes();\n\t\t}\n\t},\n\t{ \"\/kcsapi\/api_get_master\/stype\", 0 }, \/\/ Ship types\n\t{ \"\/kcsapi\/api_get_master\/slotitem\", 0 },\t\/\/ Items\n\t{ \"\/kcsapi\/api_get_master\/furniture\", 0 }, \/\/ Furniture\n\t{ \"\/kcsapi\/api_get_master\/mission\", 0 }, \/\/ Expeditions\n\t\/\/  Sortie maps\n\t{ \"\/kcsapi\/api_get_master\/mapinfo\", 0 },\n\t{ \"\/kcsapi\/api_get_master\/mapcell\", 0 },\n\t\/\/ ???\n\t{ \"\/kcsapi\/api_get_master\/maparea\", 0 },\n\n\t\/\/ Member info -------------------------------------------------------------\n\t{ \"\/kcsapi\/api_get_member\/basic\", 0 },\n\t{ \"\/kcsapi\/api_get_member\/record\", 0 },\n\t\/\/  Items\n\t{ \"\/kcsapi\/api_get_member\/slotitem\", 0 }, \/\/ Current items\n\t{ \"\/kcsapi\/api_get_member\/unsetslot\", 0 }, \/\/ Remove item\n\t{ \"\/kcsapi\/api_get_member\/useitem\", 0 },\n\t\/\/  Ships\n\t{ \"\/kcsapi\/api_get_member\/ship\",\n\t\tpf {\n\t\t\tmodelizeResponse(data, client->ships, client);\n\t\t\temit client->receivedShips();\n\t\t}\n\t},\n\t{ \"\/kcsapi\/api_get_member\/ship2\", \/\/ Ships and fleets.\n\t  pf {\n\t\t\tmodelizeResponse(data, client->ships, client, 1);\n\t\t\temit client->receivedShips();\n\n\t\t\t\/\/ TODO: handle the weird api_data_deck\n\t\t}\n\t},\n\t{ \"\/kcsapi\/api_get_member\/ship3\", \/\/ Ships, fleets, and something else I don't quite remember\n\t  pf {\n\t\t\tQVariantMap map = data.toMap();\n\t\t\tmodelizeResponse(map.value(\"api_ship_data\"), client->ships, client, 1);\n\t\t\tmodelizeResponse(map.value(\"api_deck_data\"), client->fleets, client);\n\t\t\temit client->receivedShips();\n\t\t\temit client->receivedFleets();\n\t\t}\n\t},\n\t{ \"\/kcsapi\/api_get_member\/material\", 0 }, \/\/ Resources\n\t\/\/  Various statuses\n\t{ \"\/kcsapi\/api_get_member\/deck\", \/\/ Fleets\n\t\tpf {\n\t\t\tmodelizeResponse(data, client->fleets, client);\n\t\t\temit client->receivedFleets();\n\t\t}\n\t},\n\t{ \"\/kcsapi\/api_get_member\/ndock\", \/\/ Dock (repair)\n\t\tpf {\n\t\t\tmodelizeResponse(data, client->repairDocks, client);\n\t\t\temit client->receivedRepairs();\n\t\t}\n\t},\n\t{ \"\/kcsapi\/api_get_member\/kdock\", \/\/ Construction\n\t\tpf {\n\t\t\tmodelizeResponse(data, client->constructionDocks, client);\n\t\t\temit client->receivedConstructions();\n\t\t}\n\t},\n\t\/\/  Quests\n\t{ \"\/kcsapi\/api_get_member\/questlist\", 0 },\n\t{ \"\/kcsapi\/api_req_quest\/start\", 0 }, \/\/ Start tracking\n\t{ \"\/kcsapi\/api_req_quest\/stop\", 0 }, \/\/ Stop tracking\n\t{ \"\/kcsapi\/api_req_quest\/clearitemget\", 0 }, \/\/ Finish quest\n\t\/\/  Actions\n\t{ \"\/kcsapi\/api_req_kaisou\/powerup\", 0 }, \/\/ Modernization\n\t{ \"\/kcsapi\/api_req_kaisou\/remodeling\", 0 },\n\t{ \"\/kcsapi\/api_req_hokyu\/charge\", 0 }, \/\/ TODO (Resupplying)\n\t{ \"\/kcsapi\/api_req_hensei\/change\", 0 }, \/\/ Swap out ships\n\t{ \"\/kcsapi\/api_req_nyukyo\/start\", 0 }, \/\/ Start a bath\n\t{ \"\/kcsapi\/api_req_nyukyo\/speedchange\", 0 }, \/\/ Buckets are cool\n\t{ \"\/kcsapi\/api_req_kousyou\/createship\", 0 },\n\t{ \"\/kcsapi\/api_req_kousyou\/createship_speedchange\", 0 }, \/\/ FLAME\n\t{ \"\/kcsapi\/api_req_kousyou\/getship\", 0 }, \/\/ Finish construction\n\t{ \"\/kcsapi\/api_req_kousyou\/destroyship\", 0 },\n\t{ \"\/kcsapi\/api_req_kousyou\/createitem\", 0 },\n\t{ \"\/kcsapi\/api_req_kousyou\/destroyitem2\", 0 },\n\t{ \"\/kcsapi\/api_get_member\/actionlog\", 0 },\n\t\/\/  Furniture\n\t{ \"\/kcsapi\/api_req_furniture\/change\", 0 },\n\t{ \"\/kcsapi\/api_get_member\/furniture\", 0 },\n\t\/\/  Store\n\t{ \"\/kcsapi\/api_get_master\/payitem\", 0 }, \/\/ Load the pay shop\n\t{ \"\/kcsapi\/api_req_furniture\/buy\", 0 },\n\t\/\/ ???\n\t{ \"\/kcsapi\/api_get_member\/deck_port\", 0 },\n\t{ \"\/kcsapi\/api_get_master\/useitem\", 0 },\n\n\t\/\/ Battle info -------------------------------------------------------------\n\t\/\/  Expeditions\n\t{ \"\/kcsapi\/api_req_mission\/start\", 0 },\n\t{ \"\/kcsapi\/api_req_mission\/result\", 0 },\n\t\/\/  Sorties\n\t{ \"\/kcsapi\/api_req_map\/start\", 0 }, \/\/ Start a sortie\n\t{ \"\/kcsapi\/api_req_map\/next\", 0 }, \/\/ Next cell to go to\n\t{ \"\/kcsapi\/api_req_sortie\/battle\", 0 },\n\t{ \"\/kcsapi\/api_req_battle_midnight\/battle\", 0 },\n\t{ \"\/kcsapi\/api_req_sortie\/battleresult\", 0 },\n\t\/\/  Practice\n\t{ \"\/kcsapi\/api_get_member\/practice\", 0 },\n\t{ \"\/kcsapi\/api_req_member\/getothersdeck\", 0 },\n\t{ \"\/kcsapi\/api_req_practice\/battle\", 0 },\n\t{ \"\/kcsapi\/api_req_practice\/midnight_battle\", 0 },\n\t{ \"\/kcsapi\/api_req_practice\/battle_result\", 0 },\n\n\t\/\/ Miscellaneous ------------------------------------------------------------\n\t{ \"\/kcsapi\/api_auth_member\/logincheck\", 0 },\n};\n<commit_msg>add slotset endpoint<commit_after>#include \"KCClient.h\"\n#define pf [](KCClient *client, const QVariant &data)\n\n\/*\n * Extract or update data from an API response into a QMap<int, modelT*>&\n *\/\ntemplate<class modelT>\ninline void modelizeResponse(const QVariant &data, QMap<int, modelT*> &target,\n                             KCClient *client, int loadId=0, QString idKey=\"api_id\") {\n\tfor(QVariant item : data.toList()) {\n\t\tQVariantMap itemMap = item.toMap();\n\t\tmodelT *&ship = target[itemMap.value(idKey).toInt()];\n\n\t\tif(!ship)\n\t\t\tship = new modelT(itemMap, loadId, client);\n\t\telse\n\t\t\tship->loadFrom(itemMap, loadId);\n\t}\n}\n\nconst std::map<QString, KCClient::processFunc> KCClient::processFuncs = {\n\t{ \"\/kctool\/focus\", \/\/ Focus request\n\t  pf {\n\t\t\tQ_UNUSED(data);\n\t\t\temit client->focusRequested();\n\t\t}\n\t},\n\n\t{ \"\/kcsapi\/api_req_member\/get_incentive\", 0 }, \/\/ Login\n\t{ \"\/kcsapi\/api_start\", 0 },\n\n\t\/\/ Global info -------------------------------------------------------------\n\t{ \"\/kctool\/mastership.json\", \/\/ Ships from our server\n\t\tpf {\n\t\t\tmodelizeResponse(data, client->shipTypes, client);\n\t\t\temit client->receivedShipTypes();\n\t\t}\n\t},\n\t{ \"\/kcsapi\/api_get_master\/ship\", \/\/ Ships\n\t\tpf {\n\t\t\tmodelizeResponse(data, client->shipTypes, client);\n\t\t\temit client->receivedShipTypes();\n\t\t}\n\t},\n\t{ \"\/kcsapi\/api_get_master\/stype\", 0 }, \/\/ Ship types\n\t{ \"\/kcsapi\/api_get_master\/slotitem\", 0 },\t\/\/ Items\n\t{ \"\/kcsapi\/api_get_master\/furniture\", 0 }, \/\/ Furniture\n\t{ \"\/kcsapi\/api_get_master\/mission\", 0 }, \/\/ Expeditions\n\t\/\/  Sortie maps\n\t{ \"\/kcsapi\/api_get_master\/mapinfo\", 0 },\n\t{ \"\/kcsapi\/api_get_master\/mapcell\", 0 },\n\t\/\/ ???\n\t{ \"\/kcsapi\/api_get_master\/maparea\", 0 },\n\n\t\/\/ Member info -------------------------------------------------------------\n\t{ \"\/kcsapi\/api_get_member\/basic\", 0 },\n\t{ \"\/kcsapi\/api_get_member\/record\", 0 },\n\t\/\/  Items\n\t{ \"\/kcsapi\/api_get_member\/slotitem\", 0 }, \/\/ Current items\n\t{ \"\/kcsapi\/api_get_member\/unsetslot\", 0 }, \/\/ Remove item\n\t{ \"\/kcsapi\/api_get_member\/useitem\", 0 },\n\t\/\/  Ships\n\t{ \"\/kcsapi\/api_get_member\/ship\",\n\t\tpf {\n\t\t\tmodelizeResponse(data, client->ships, client);\n\t\t\temit client->receivedShips();\n\t\t}\n\t},\n\t{ \"\/kcsapi\/api_get_member\/ship2\", \/\/ Ships and fleets.\n\t  pf {\n\t\t\tmodelizeResponse(data, client->ships, client, 1);\n\t\t\temit client->receivedShips();\n\n\t\t\t\/\/ TODO: handle the weird api_data_deck\n\t\t}\n\t},\n\t{ \"\/kcsapi\/api_get_member\/ship3\", \/\/ Ships, fleets, and something else I don't quite remember\n\t  pf {\n\t\t\tQVariantMap map = data.toMap();\n\t\t\tmodelizeResponse(map.value(\"api_ship_data\"), client->ships, client, 1);\n\t\t\tmodelizeResponse(map.value(\"api_deck_data\"), client->fleets, client);\n\t\t\temit client->receivedShips();\n\t\t\temit client->receivedFleets();\n\t\t}\n\t},\n\t{ \"\/kcsapi\/api_get_member\/material\", 0 }, \/\/ Resources\n\t\/\/  Various statuses\n\t{ \"\/kcsapi\/api_get_member\/deck\", \/\/ Fleets\n\t\tpf {\n\t\t\tmodelizeResponse(data, client->fleets, client);\n\t\t\temit client->receivedFleets();\n\t\t}\n\t},\n\t{ \"\/kcsapi\/api_get_member\/ndock\", \/\/ Dock (repair)\n\t\tpf {\n\t\t\tmodelizeResponse(data, client->repairDocks, client);\n\t\t\temit client->receivedRepairs();\n\t\t}\n\t},\n\t{ \"\/kcsapi\/api_get_member\/kdock\", \/\/ Construction\n\t\tpf {\n\t\t\tmodelizeResponse(data, client->constructionDocks, client);\n\t\t\temit client->receivedConstructions();\n\t\t}\n\t},\n\t\/\/  Quests\n\t{ \"\/kcsapi\/api_get_member\/questlist\", 0 },\n\t{ \"\/kcsapi\/api_req_quest\/start\", 0 }, \/\/ Start tracking\n\t{ \"\/kcsapi\/api_req_quest\/stop\", 0 }, \/\/ Stop tracking\n\t{ \"\/kcsapi\/api_req_quest\/clearitemget\", 0 }, \/\/ Finish quest\n\t\/\/  Actions\n\t{ \"\/kcsapi\/api_req_kaisou\/powerup\", 0 }, \/\/ Modernization\n\t{ \"\/kcsapi\/api_req_kaisou\/remodeling\", 0 },\n\t{ \"\/kcsapi\/api_req_kaisou\/slotset\", 0 }, \/\/ Equip an item\n\t{ \"\/kcsapi\/api_req_hokyu\/charge\", 0 }, \/\/ TODO (Resupplying)\n\t{ \"\/kcsapi\/api_req_hensei\/change\", 0 }, \/\/ Swap out ships\n\t{ \"\/kcsapi\/api_req_nyukyo\/start\", 0 }, \/\/ Start a bath\n\t{ \"\/kcsapi\/api_req_nyukyo\/speedchange\", 0 }, \/\/ Buckets are cool\n\t{ \"\/kcsapi\/api_req_kousyou\/createship\", 0 },\n\t{ \"\/kcsapi\/api_req_kousyou\/createship_speedchange\", 0 }, \/\/ FLAME\n\t{ \"\/kcsapi\/api_req_kousyou\/getship\", 0 }, \/\/ Finish construction\n\t{ \"\/kcsapi\/api_req_kousyou\/destroyship\", 0 },\n\t{ \"\/kcsapi\/api_req_kousyou\/createitem\", 0 },\n\t{ \"\/kcsapi\/api_req_kousyou\/destroyitem2\", 0 },\n\t{ \"\/kcsapi\/api_get_member\/actionlog\", 0 },\n\t\/\/  Furniture\n\t{ \"\/kcsapi\/api_req_furniture\/change\", 0 },\n\t{ \"\/kcsapi\/api_get_member\/furniture\", 0 },\n\t\/\/  Store\n\t{ \"\/kcsapi\/api_get_master\/payitem\", 0 }, \/\/ Load the pay shop\n\t{ \"\/kcsapi\/api_req_furniture\/buy\", 0 },\n\t\/\/ ???\n\t{ \"\/kcsapi\/api_get_member\/deck_port\", 0 },\n\t{ \"\/kcsapi\/api_get_master\/useitem\", 0 },\n\n\t\/\/ Battle info -------------------------------------------------------------\n\t\/\/  Expeditions\n\t{ \"\/kcsapi\/api_req_mission\/start\", 0 },\n\t{ \"\/kcsapi\/api_req_mission\/result\", 0 },\n\t\/\/  Sorties\n\t{ \"\/kcsapi\/api_req_map\/start\", 0 }, \/\/ Start a sortie\n\t{ \"\/kcsapi\/api_req_map\/next\", 0 }, \/\/ Next cell to go to\n\t{ \"\/kcsapi\/api_req_sortie\/battle\", 0 },\n\t{ \"\/kcsapi\/api_req_battle_midnight\/battle\", 0 },\n\t{ \"\/kcsapi\/api_req_sortie\/battleresult\", 0 },\n\t\/\/  Practice\n\t{ \"\/kcsapi\/api_get_member\/practice\", 0 },\n\t{ \"\/kcsapi\/api_req_member\/getothersdeck\", 0 },\n\t{ \"\/kcsapi\/api_req_practice\/battle\", 0 },\n\t{ \"\/kcsapi\/api_req_practice\/midnight_battle\", 0 },\n\t{ \"\/kcsapi\/api_req_practice\/battle_result\", 0 },\n\n\t\/\/ Miscellaneous ------------------------------------------------------------\n\t{ \"\/kcsapi\/api_auth_member\/logincheck\", 0 },\n};\n<|endoftext|>"}
{"text":"<commit_before>\/\/------------------------------------------------------------------------------\n\/\/ Copyright (c) 2017 John D. Haughton\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\n#include <cstdio>\n\n#include \"PLT\/Event.h\"\n#include \"PLT\/Frame.h\"\n\n\nstatic PLT::Frame frame(\"Event Test\", 256, 256);\nstatic unsigned ticks = 0;\n\n\nvoid callback(const PLT::Event::Message& event, void* ptr)\n{\n   uint32_t  rgb;\n\n   switch(event.type)\n   {\n   case PLT::Event::KEY_DOWN:\n      printf(\"KEY_DOWN     %02X\\n\", event.code);\n      for(unsigned y=248; y<256; y++)\n         frame.setPixel(event.code, y, 0xFFFFFF);\n      break;\n\n   case PLT::Event::KEY_UP:\n      printf(\"KEY_UP       %02X\\n\", event.code);\n      for(unsigned y=248; y<256; y++)\n         frame.setPixel(event.code, y, 0x000000);\n      break;\n\n   case PLT::Event::BUTTON_DOWN:\n      printf(\"BUTTON_DOWN  %d %u %u\\n\", event.code, event.x, event.y);\n      break;\n\n   case PLT::Event::BUTTON_UP:\n      printf(\"BUTTON_UP    %d %u %u\\n\", event.code, event.x, event.y);\n      break;\n\n   case PLT::Event::POINTER_MOVE:\n      printf(\"POINTER_MOVE %u %u\\n\",    event.x, event.y);\n      frame.setPixel(event.x, event.y, 0xFFFFFF);\n      break;\n\n   case PLT::Event::TIMER:\n      printf(\"TIMER\\n\");\n      ticks = (ticks + 1) % frame.getWidth();\n      rgb = frame.getPixel(ticks, 0);\n      frame.setPixel(ticks, 0, rgb ? 0x000000 : 0xFFFFFF);\n      break;\n\n   case PLT::Event::RESIZE:\n      printf(\"RESIZE\\n\");\n      break;\n\n   case PLT::Event::QUIT:\n      printf(\"QUIT\\n\");\n      break;\n\n   default:\n      break;\n   }\n\n   frame.refresh();\n}\n\n\nint main(int argc, const char* argv[])\n{\n   PLT::Event::setTimer(500);\n\n   return PLT::Event::eventLoop(callback);\n}\n<commit_msg>Add more PLT::Frame output to PLT::Event test<commit_after>\/\/------------------------------------------------------------------------------\n\/\/ Copyright (c) 2017 John D. Haughton\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\n#include <cstdio>\n\n#include \"PLT\/Event.h\"\n#include \"PLT\/Frame.h\"\n\n\nvoid callback(const PLT::Event::Message& event, void* ptr)\n{\n   static unsigned ticks = 0;\n\n   PLT::Frame* frame = static_cast<PLT::Frame*>(ptr);\n   uint32_t  rgb;\n\n   switch(event.type)\n   {\n   case PLT::Event::KEY_DOWN:\n      printf(\"KEY_DOWN     %02X\\n\", event.code);\n      for(unsigned y=248; y<256; y++)\n         frame->setPixel(event.code, y, 0xFFFFFF);\n      break;\n\n   case PLT::Event::KEY_UP:\n      printf(\"KEY_UP       %02X\\n\", event.code);\n      for(unsigned y=248; y<256; y++)\n         frame->setPixel(event.code, y, 0x000000);\n      break;\n\n   case PLT::Event::BUTTON_DOWN:\n      printf(\"BUTTON_DOWN  %d %u %u\\n\", event.code, event.x, event.y);\n      break;\n\n   case PLT::Event::BUTTON_UP:\n      printf(\"BUTTON_UP    %d %u %u\\n\", event.code, event.x, event.y);\n      break;\n\n   case PLT::Event::POINTER_MOVE:\n      printf(\"POINTER_MOVE %u %u\\n\",    event.x, event.y);\n      frame->setPixel(event.x, event.y, 0xFFFFFF);\n      break;\n\n   case PLT::Event::TIMER:\n      printf(\"TIMER\\n\");\n      ticks = (ticks + 1) % frame->getWidth();\n      rgb = frame->getPixel(ticks, 0);\n      frame->setPixel(ticks, 0, rgb ? 0x000000 : 0xFFFFFF);\n      break;\n\n   case PLT::Event::RESIZE:\n      printf(\"RESIZE\\n\");\n      break;\n\n   case PLT::Event::QUIT:\n      printf(\"QUIT\\n\");\n      break;\n\n   default:\n      break;\n   }\n\n   frame->refresh();\n}\n\n\nint main(int argc, const char* argv[])\n{\n   PLT::Frame frame(\"Event Test\", 256, 256);\n\n   PLT::Event::setTimer(500);\n\n   return PLT::Event::eventLoop(callback, &frame);\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"StdSynan.h\"\n#include \"RusSentence.h\"\n\nvoid InitCopulList(StringVector& v_CopulList)\n{\n\tv_CopulList.clear();\n\tv_CopulList.push_back(\"\");\n\tv_CopulList.push_back(\"\");\n\tv_CopulList.push_back(\"\");\n\tv_CopulList.push_back(\"\");\n\tv_CopulList.push_back(\"\");\n}\n\nbool HasAdjInNom(const CSynWord& _W)\n{\n\n\tfor (int i = 0; i < _W.m_Homonyms.size(); i++)\n\t\tif (_W.m_Homonyms[i].HasPos(ADJ_FULL) \n\t\t\t&& _W.m_Homonyms[i].HasGrammem(rNominativ))\n\t\t\treturn true;\n\t\t\n\treturn false; \n\n}\n\n\nbool HasNounInGen(const CSynWord& _W)\n{\n\n\tfor (int i = 0; i < _W.m_Homonyms.size(); i++)\n\t\tif (\t\t_W.m_Homonyms[i].IsSynNoun()\n\t\t\t\t&&\t_W.m_Homonyms[i].HasGrammem(rGenitiv)\n\t\t\t)\n\t\t\treturn true;\n\t\t\n\treturn false; \n\n}\n\nbool HasGenderNumberCaseNP(const CSynWord& _W1, const CSynWord& _W2)\n{\n\tfor (int i = 0; i < _W1.m_Homonyms.size(); i++)\n        for (int k = 0; k < _W2.m_Homonyms.size(); k++)\n            if (_W1.GetOpt()->GetGramTab()->GleicheGenderNumberCase(_W2.m_Homonyms[k].m_CommonGramCode.c_str(), _W1.m_Homonyms[i].m_GramCodes.c_str(), _W2.m_Homonyms[k].m_GramCodes.c_str()))\n                return true;\n    return false;\n}\n\n\n\nbool HasNounInNomSgPl(const CSynWord &W)\n{\n\tfor (int i = 0; i < W.m_Homonyms.size(); i++)\n\t\tif ( W.m_Homonyms[i].IsSynNoun() ) \n\t\t\tif ( W.m_Homonyms[i].HasGrammem(rNominativ) &&\n\t\t\t\t W.m_Homonyms[i].HasGrammem(rSingular) && \n\t\t\t\t W.m_Homonyms[i].HasGrammem(rPlural) )\n\t\t\t\treturn true;\n\t\t\n\treturn false; \n}\n\n\nCSynWord CreateDash(CSentence* pSent)\n{\n\tCSynWord W (pSent);\n\tCSynHomonym NewDashHom (pSent);\n\tNewDashHom.SetLemma(\"-\");\n\n    W.SetWordStr(\"-\", pSent->GetOpt()->m_Language);\n\tW.m_bDash = true;\n\tW.AddDes(OPun);\n    W.AddDes(OHyp);\n\tW.m_bArtificialCreated = true;\n\tW.m_Homonyms.push_back(NewDashHom);\n\treturn W;\n};\n\n\nvoid CRusSentence::BuildDash(int iClauseNum, int iWrdAfter, bool bCopul)\n{\n\tSClauseType type;\n\tCClause&  pClause = GetClause(iClauseNum);\n\n\tif (bCopul)\n\t{\n\t\tpClause.ChangeAllClauseTypesToOneType(SClauseType(COPUL_T, -1,-1));\t\t\n\n\t\treturn;\n\t}\n\n\tif ( m_Words[iWrdAfter].IsInOborot() )\n\t\t\treturn;\n\n\tif (pClause.IsInTermin(iWrdAfter)) return;\n\n\tif (IsBetweenGraphematicalPairDescriptors(iWrdAfter)) return;\n\n\tint DashWordNo = iWrdAfter + 1;\n\tm_Words.insert(m_Words.begin() + DashWordNo, CreateDash(this));\n\n\tRecalculateIndicesAfterInsertingWord(DashWordNo);\n\tpClause.ChangeAllClauseTypesToOneType(SClauseType(DASH_T, DashWordNo, 0) );\t\t\n}\n\n\nvoid CRusSentence::TryToRebuildDashInClause()\n{\n\tStringVector v_CopulList;\n\tInitCopulList(v_CopulList);\n\n\tfor (int ClauseNo = 0; ClauseNo < GetClausesCount(); ClauseNo++)\n\t{\n\t\tCClause&  pClause = GetClause(ClauseNo);\n\n\t\tif (!pClause.m_vectorTypes.empty()) \n\t\t\tcontinue;\n\n\t\tbool bHasDash = false;\n\t\tif ( pClause.m_iFirstWord != 0 )\n\t\t\tfor ( int tt = pClause.m_iFirstWord; tt <= pClause.m_iLastWord; tt++ )\n\t\t\t\tif ( m_Words[tt].m_bDash  )\n\t\t\t\t{\n\t\t\t\t\tbHasDash = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\tif ( bHasDash ) continue;\n\n\n\t\tint j = pClause.m_iFirstWord;\n\t\tfor (; j <= pClause.m_iLastWord; j++)\n\t\t\tif (\t!m_Words[j].GetSynHomonym(0).IsLemma(\"\")\n\t\t\t\t&&\tm_Words[j].GetHomonymByPOS(PREP) != -1 \n\t\t\t\t)\n\t\t\t\t break;\n\n\t\tif ( j < pClause.m_iLastWord ) continue;\n\n\t\tvector<int> Noun_Nom, Adj_Nom, Eto, Noun_Gen, Copul_Words, Noun_NomSgPl;\n\t\tint Prep_U = -1;\n\n\t\tfor (j = pClause.m_iFirstWord; j <= pClause.m_iLastWord; j++)\n\t\t{\n\t\t\tif ( m_Words[j].GetSynHomonym(0).IsLemma(\"\")\t)\n\t\t\t{\n\t\t\t\tEto.push_back(j);\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tfor (int ll = 0; ll < v_CopulList.size(); ll++)\n\t\t\t\tif ( m_Words[j].m_strWord ==  v_CopulList[ll].c_str() )\n\t\t\t\t{\n\t\t\t\t\tCopul_Words.push_back(j);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\tif ( m_Words[j].GetHomonymsCount() > 1 ) continue;\n\n\t\t\tif ( m_Words[j].GetSynHomonym(0).IsLemma(\"\") )\n\t\t\t\tcontinue;\n\n\t\t\tif (\t\tHasNounInNom( m_Words[j]) \n                && \t!m_Words[j].HasDes(OFAM2) \n\t\t\t\t\t)\n\t\t\t{\n\t\t\t\tNoun_Nom.push_back(j);\n\t\t\t\tcontinue;\n\t\t\t\n\t\t\t}\n\t\t\tif (\tHasAdjInNom(m_Words[j]) && !m_Words[j].HasDes(OFAM2) )\n\t\t\t{\n\t\t\t\tAdj_Nom.push_back(j);\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif ( m_Words[j].GetSynHomonym(0).IsLemma(\"\") )\n\t\t\t{\n\t\t\t\tPrep_U = j;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif ( HasNounInGen(m_Words[j]) )\n\t\t\t\tNoun_Gen.push_back(j);\n\n\t\t\tif ( HasNounInNomSgPl( m_Words[j] ) )\n\t\t\t\tNoun_NomSgPl.push_back(j);\n\t\t\t\n\t\t}\n\t\t\n\t\tif (0 == Noun_Nom.size() && 0 == Eto.size() && \n\t\t\t0 == Adj_Nom.size() && -1 == Prep_U)\n\t\t\tcontinue;\n\n\t\tif (Noun_Nom.size() > 1)\n\t\t{\n\t\t\tBYTE up_let = m_Words[Noun_Nom[1]].m_strWord[0];\n\t\t\tif (!is_russian_upper(up_let))\n\t\t\t{\n\t\t\t\tint k = 0;\n\t\t\t\tfor (; k < Copul_Words.size(); k++)\n\t\t\t\t\tif (Copul_Words[k] > Noun_Nom[0] && Copul_Words[k] < Noun_Nom[1])\n\t\t\t\t\t{\n\t\t\t\t\t\tBuildDash(ClauseNo, -1, true);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\tif ( k == Copul_Words.size())\n\t\t\t\t\tBuildDash(ClauseNo, Noun_Nom[0]);\n\t\t\t}\n\n\t\t\tcontinue;\n\t\t}\n\n\t\tif ( Noun_Nom.size() > 0 && Eto.size() > 0 )\n\t\t{\n\t\t\tQWORD tormoz = _QM(rNeutrum) |  _QM(rSingular) |  _QM(rNominativ); \n\t\t\tfor (int k = 0; k < Eto.size() && k < Noun_Nom.size(); k++)\n\t\t\t\t\/\/   \"\"   \" \"  \n\t\t\t\tif\t(!m_Words[Noun_Nom[k]].GetSynHomonym(0).HasSetOfGrammemsExact(tormoz) )\n\t\t\t\t\tif (Noun_Nom[k] > Eto[k])\n\t\t\t\t\t{\n\t\t\t\t\t\tBuildDash(ClauseNo, Eto[k]);\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t}\t\t\n\n\t\tbool bPersCl, bEncCl;\n\t\tbPersCl = bEncCl = false;\n\n\t\tint cc = ClauseNo-1;\n\t\tfor (; ClauseNo > 1 && cc >= 0; cc--)\n\t\t{\n\t\t\tCClause&  pClauseBefore = GetClause(cc);\n\t\t\n\t\t\tif (\tpClauseBefore.HasType(VERB_PERS_T) \n\t\t\t\t\t&& pClauseBefore.HasLeftStarter() \n\t\t\t\t)\n\t\t\t{\n\t\t\t\t\tbEncCl = true;\n\t\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif ( pClauseBefore.HasType(PARTICIPLE_T) || pClauseBefore.HasType(ADVERB_PARTICIPLE_T) )\n\t\t\t{\n\t\t\t\t\tbEncCl = true;\n\t\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif ( pClauseBefore.HasType(DASH_T) )\n\t\t\t\tbreak;\n\n\t\t\tif (\t\t(\t\t!pClauseBefore.HasType(INFINITIVE_T) \n\t\t\t\t\t\t\t&&  !pClauseBefore.m_vectorTypes.empty()\n\t\t\t\t\t\t)\n\t\t\t\t\t||  !(pClauseBefore.m_vectorTypes.size() == 1) \n\t\t\t\t)\n\t\t\t{\n\t\t\t\tif (bEncCl)\n\t\t\t\t\tbPersCl = true;\n\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\n\t\tif (bPersCl) continue;\n\n\t\tbPersCl = bEncCl = false;\n\n\t\tfor (cc = ClauseNo+1; ClauseNo < GetClausesCount()-2 && cc < GetClausesCount(); cc++)\n\t\t{\n\t\t\tCClause&  pClauseAfter = GetClause(cc);\n\t\t\n\t\t\tif (\tpClauseAfter.HasType(VERB_PERS_T) \n\t\t\t\t&&\tpClauseAfter.HasLeftStarter() \n\t\t\t\t)\n\t\t\t{\n\t\t\t\t\tbEncCl = true;\n\t\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif ( pClauseAfter.HasType(PARTICIPLE_T) || pClauseAfter.HasType(ADVERB_PARTICIPLE_T) )\n\t\t\t{\n\t\t\t\t\tbEncCl = true;\n\t\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif ( pClauseAfter.HasType(DASH_T) )\n\t\t\t\tbreak;\n\n\t\t\tif (\t(\t\t\t!pClauseAfter.HasType(INFINITIVE_T) \n\t\t\t\t\t\t&& \t\t!pClauseAfter.m_vectorTypes.empty()\n\t\t\t\t\t) \n\t\t\t\t||  !(pClauseAfter.m_vectorTypes.size() == 1) \n\t\t\t\t)\n\t\t\t{\n\t\t\t\tif (bEncCl)\n\t\t\t\t\tbPersCl = true;\n\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\t\n\t\tif (bPersCl) continue;\n\n\t\tif ( Noun_Nom.size() > 0 && Adj_Nom.size() > 0 )\n\t\t{\n\t\t\tfor (int k = 0; k < Noun_Nom.size() && k < Adj_Nom.size(); k++)\n\t\t\t\tif (      Noun_Nom[k] < Adj_Nom[k] \n                     &&  (pClause.m_iLastWord == Adj_Nom[k] || !HasGenderNumberCaseNP(m_Words[Adj_Nom[k]], m_Words[Adj_Nom[k]+1]))\n                   )\n\t\t\t\t\t\tBuildDash(ClauseNo, Noun_Nom[k]);\n\n\t\t\tcontinue;\n\t\t}\t\t\n\t\t\n\t\tif (-1 != Prep_U && Noun_Gen.size() > 0 && ( Noun_Nom.size() > 0 || Noun_NomSgPl.size() > 0 ) )\n\t\t{\t\t\n\t\t\tfor (int m = 0; m < Noun_Gen.size(); m++)\n\t\t\t\tif (Prep_U < Noun_Gen[m])\n\t\t\t\t{\n\t\t\t\t\tPrep_U = Noun_Gen[m];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\tif ( Noun_Nom.size() > 0 )\n\t\t\t{\n\t\t\t\tif ( Prep_U > Noun_Nom[0] )\n\t\t\t\t\t\tBuildDash(ClauseNo, Noun_Nom[0]);\n\t\t\t\telse\n\t\t\t\t\t\tBuildDash(ClauseNo, Prep_U);\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tint iNomSgPl = -1;\n\t\t\tfor ( int tt = 0; tt < Noun_NomSgPl.size(); tt++ )\n\t\t\t\tif ( Prep_U != Noun_NomSgPl[tt] )\n\t\t\t\t{\n\t\t\t\t\tiNomSgPl = Noun_NomSgPl[tt];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\tif ( -1 != iNomSgPl )\n\t\t\t\tif ( Prep_U > iNomSgPl )\n\t\t\t\t\t\tBuildDash(ClauseNo, iNomSgPl);\n\t\t\t\telse\n\t\t\t\t\t\tBuildDash(ClauseNo, Prep_U);\n\t\t}\n\n\t}\n\t\n}\n\n\n\n<commit_msg>TryToRebuildDashInClause updated for adjective and age<commit_after>\n#include \"StdSynan.h\"\n#include \"RusSentence.h\"\n\nvoid InitCopulList(StringVector& v_CopulList)\n{\n\tv_CopulList.clear();\n\tv_CopulList.push_back(\"\");\n\tv_CopulList.push_back(\"\");\n\tv_CopulList.push_back(\"\");\n\tv_CopulList.push_back(\"\");\n\tv_CopulList.push_back(\"\");\n}\n\nbool HasAdjInNom(const CSynWord& _W)\n{\n\n\tfor (int i = 0; i < _W.m_Homonyms.size(); i++)\n\t\tif (_W.m_Homonyms[i].HasPos(ADJ_FULL) \n\t\t\t&& _W.m_Homonyms[i].HasGrammem(rNominativ))\n\t\t\treturn true;\n\t\t\n\treturn false; \n\n}\n\n\nbool HasNounInGen(const CSynWord& _W)\n{\n\n\tfor (int i = 0; i < _W.m_Homonyms.size(); i++)\n\t\tif (\t\t_W.m_Homonyms[i].IsSynNoun()\n\t\t\t\t&&\t_W.m_Homonyms[i].HasGrammem(rGenitiv)\n\t\t\t)\n\t\t\treturn true;\n\t\t\n\treturn false; \n\n}\n\nbool HasGenderNumberCaseNP(const CSynWord& _W1, const CSynWord& _W2)\n{\n\tfor (int i = 0; i < _W1.m_Homonyms.size(); i++)\n        for (int k = 0; k < _W2.m_Homonyms.size(); k++)\n            if (_W1.GetOpt()->GetGramTab()->GleicheGenderNumberCase(_W2.m_Homonyms[k].m_CommonGramCode.c_str(), _W1.m_Homonyms[i].m_GramCodes.c_str(), _W2.m_Homonyms[k].m_GramCodes.c_str()))\n                return true;\n    return false;\n}\n\n\n\nbool HasNounInNomSgPl(const CSynWord &W)\n{\n\tfor (int i = 0; i < W.m_Homonyms.size(); i++)\n\t\tif ( W.m_Homonyms[i].IsSynNoun() ) \n\t\t\tif ( W.m_Homonyms[i].HasGrammem(rNominativ) &&\n\t\t\t\t W.m_Homonyms[i].HasGrammem(rSingular) && \n\t\t\t\t W.m_Homonyms[i].HasGrammem(rPlural) )\n\t\t\t\treturn true;\n\t\t\n\treturn false; \n}\n\n\nCSynWord CreateDash(CSentence* pSent)\n{\n\tCSynWord W (pSent);\n\tCSynHomonym NewDashHom (pSent);\n\tNewDashHom.SetLemma(\"-\");\n\n    W.SetWordStr(\"-\", pSent->GetOpt()->m_Language);\n\tW.m_bDash = true;\n\tW.AddDes(OPun);\n    W.AddDes(OHyp);\n\tW.m_bArtificialCreated = true;\n\tW.m_Homonyms.push_back(NewDashHom);\n\treturn W;\n};\n\n\nvoid CRusSentence::BuildDash(int iClauseNum, int iWrdAfter, bool bCopul)\n{\n\tSClauseType type;\n\tCClause&  pClause = GetClause(iClauseNum);\n\n\tif (bCopul)\n\t{\n\t\tpClause.ChangeAllClauseTypesToOneType(SClauseType(COPUL_T, -1,-1));\t\t\n\n\t\treturn;\n\t}\n\n\tif ( m_Words[iWrdAfter].IsInOborot() )\n\t\t\treturn;\n\n\tif (pClause.IsInTermin(iWrdAfter)) return;\n\n\tif (IsBetweenGraphematicalPairDescriptors(iWrdAfter)) return;\n\n\tint DashWordNo = iWrdAfter + 1;\n\tm_Words.insert(m_Words.begin() + DashWordNo, CreateDash(this));\n\n\tRecalculateIndicesAfterInsertingWord(DashWordNo);\n\tpClause.ChangeAllClauseTypesToOneType(SClauseType(DASH_T, DashWordNo, 0) );\t\t\n}\n\n\nvoid CRusSentence::TryToRebuildDashInClause()\n{\n\tStringVector v_CopulList;\n\tInitCopulList(v_CopulList);\n\n\tfor (int ClauseNo = 0; ClauseNo < GetClausesCount(); ClauseNo++)\n\t{\n\t\tCClause&  pClause = GetClause(ClauseNo);\n\n\t\tif (!pClause.m_vectorTypes.empty()) \n\t\t\tcontinue;\n\n\t\tbool bHasDash = false;\n\t\tif ( pClause.m_iFirstWord != 0 )\n\t\t\tfor ( int tt = pClause.m_iFirstWord; tt <= pClause.m_iLastWord; tt++ )\n\t\t\t\tif ( m_Words[tt].m_bDash  )\n\t\t\t\t{\n\t\t\t\t\tbHasDash = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\tif ( bHasDash ) continue;\n\n\n\t\tint j = pClause.m_iFirstWord;\n\t\tfor (; j <= pClause.m_iLastWord; j++)\n\t\t\tif (\t!m_Words[j].GetSynHomonym(0).IsLemma(\"\")\n\t\t\t\t&&\tm_Words[j].GetHomonymByPOS(PREP) != -1 \n\t\t\t\t)\n\t\t\t\t break;\n\n\t\tif ( j < pClause.m_iLastWord ) continue;\n\n\t\tvector<int> Noun_Nom, Adj_Nom, Eto, Noun_Gen, Copul_Words, Noun_NomSgPl;\n\t\tint Prep_U = -1;\n\t\tbool Vozrast = false;\n\n\t\tfor (j = pClause.m_iFirstWord; j <= pClause.m_iLastWord; j++)\n\t\t{\n\t\t\tif ( m_Words[j].GetSynHomonym(0).IsLemma(\"\")\t)\n\t\t\t{\n\t\t\t\tEto.push_back(j);\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tfor (int ll = 0; ll < v_CopulList.size(); ll++)\n\t\t\t\tif ( m_Words[j].m_strWord ==  v_CopulList[ll].c_str() )\n\t\t\t\t{\n\t\t\t\t\tCopul_Words.push_back(j);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\tif ( m_Words[j].GetHomonymsCount() > 1 ) continue;\n\n\t\t\tif ( m_Words[j].GetSynHomonym(0).IsLemma(\"\") )\n\t\t\t\tcontinue;\n\n\t\t\tif (\t\tHasNounInNom( m_Words[j]) \n                && \t!m_Words[j].HasDes(OFAM2) \n\t\t\t\t\t)\n\t\t\t{\n\t\t\t\tNoun_Nom.push_back(j);\n\t\t\t\tcontinue;\n\t\t\t\n\t\t\t}\n\n\t\t\tif ( \tHasAdjInNom(m_Words[j]) && !m_Words[j].HasDes(OFAM2) )\n\t\t\t{\n\t\t\t\tAdj_Nom.push_back(j);\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif ( m_Words[j].GetSynHomonym(0).IsLemma(\"\") )\n\t\t\t{\n\t\t\t\tPrep_U = j;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif ( HasNounInGen(m_Words[j]) )\n\t\t\t\tNoun_Gen.push_back(j);\n\n\t\t\tif ( HasNounInNomSgPl( m_Words[j] ) )\n\t\t\t\tNoun_NomSgPl.push_back(j);\n\t\t\t\n\t\t\tif (0 == Adj_Nom.size() && 0 == Noun_Nom.size()\n\t\t\t\t&& isdigit((BYTE)m_Words[j].m_strWord[0]) \/\/  33.\n\t\t\t\t&& m_Words[j].m_strWord.find(\"-\") == -1) \n\t\t\t{\n\t\t\t\tVozrast = true;\n\t\t\t\tAdj_Nom.push_back(j);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\t\t\n\t\tif (0 == Noun_Nom.size() && 0 == Eto.size() && \n\t\t\t0 == Adj_Nom.size() && -1 == Prep_U)\n\t\t\tcontinue;\n\n\t\tif (0 == Noun_Nom.size() && 0 == Eto.size() && 1 == Adj_Nom.size() && -1 == Prep_U) \/\/  .\n\t\t\tfor (j = pClause.m_iFirstWord; j <= pClause.m_iLastWord; j++)\n\t\t\t{\n\t\t\t\tfor (int i = 0; i < m_Words[j].m_Homonyms.size() && 0 == Noun_Nom.size(); i++) \n\t\t\t\t{\n\t\t\t\t\tif (  m_Words[j].m_Homonyms[i].IsSynNoun() ) \n\t\t\t\t\t{\n\t\t\t\t\t\tif (  m_Words[j].m_Homonyms[i].HasGrammem(rNominativ) ||\n\t\t\t\t\t\t\t(Vozrast && m_Words[j].m_Homonyms[i].HasGrammem(rDativ))) \/\/  33.\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tNoun_Nom.push_back(j);\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\telse Vozrast = false;\n\n\t\tif (Noun_Nom.size() > 1)\n\t\t{\n\t\t\tBYTE up_let = m_Words[Noun_Nom[1]].m_strWord[0];\n\t\t\tif (!is_russian_upper(up_let))\n\t\t\t{\n\t\t\t\tint k = 0;\n\t\t\t\tfor (; k < Copul_Words.size(); k++)\n\t\t\t\t\tif (Copul_Words[k] > Noun_Nom[0] && Copul_Words[k] < Noun_Nom[1])\n\t\t\t\t\t{\n\t\t\t\t\t\tBuildDash(ClauseNo, -1, true);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\tif ( k == Copul_Words.size())\n\t\t\t\t\tBuildDash(ClauseNo, Noun_Nom[0]);\n\t\t\t}\n\n\t\t\tcontinue;\n\t\t}\n\n\t\tif ( Noun_Nom.size() > 0 && Eto.size() > 0 )\n\t\t{\n\t\t\tQWORD tormoz = _QM(rNeutrum) |  _QM(rSingular) |  _QM(rNominativ); \n\t\t\tfor (int k = 0; k < Eto.size() && k < Noun_Nom.size(); k++)\n\t\t\t\t\/\/   \"\"   \" \"  \n\t\t\t\tif\t(!m_Words[Noun_Nom[k]].GetSynHomonym(0).HasSetOfGrammemsExact(tormoz) )\n\t\t\t\t\tif (Noun_Nom[k] > Eto[k])\n\t\t\t\t\t{\n\t\t\t\t\t\tBuildDash(ClauseNo, Eto[k]);\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t}\t\t\n\n\t\tbool bPersCl, bEncCl;\n\t\tbPersCl = bEncCl = false;\n\n\t\tint cc = ClauseNo-1;\n\t\tfor (; ClauseNo > 1 && cc >= 0; cc--)\n\t\t{\n\t\t\tCClause&  pClauseBefore = GetClause(cc);\n\t\t\n\t\t\tif (\tpClauseBefore.HasType(VERB_PERS_T) \n\t\t\t\t\t&& pClauseBefore.HasLeftStarter() \n\t\t\t\t)\n\t\t\t{\n\t\t\t\t\tbEncCl = true;\n\t\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif ( pClauseBefore.HasType(PARTICIPLE_T) || pClauseBefore.HasType(ADVERB_PARTICIPLE_T) )\n\t\t\t{\n\t\t\t\t\tbEncCl = true;\n\t\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif ( pClauseBefore.HasType(DASH_T) )\n\t\t\t\tbreak;\n\n\t\t\tif (\t\t(\t\t!pClauseBefore.HasType(INFINITIVE_T) \n\t\t\t\t\t\t\t&&  !pClauseBefore.m_vectorTypes.empty()\n\t\t\t\t\t\t)\n\t\t\t\t\t||  !(pClauseBefore.m_vectorTypes.size() == 1) \n\t\t\t\t)\n\t\t\t{\n\t\t\t\tif (bEncCl)\n\t\t\t\t\tbPersCl = true;\n\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\n\t\tif (bPersCl) continue;\n\n\t\tbPersCl = bEncCl = false;\n\n\t\tfor (cc = ClauseNo+1; ClauseNo < GetClausesCount()-2 && cc < GetClausesCount(); cc++)\n\t\t{\n\t\t\tCClause&  pClauseAfter = GetClause(cc);\n\t\t\n\t\t\tif (\tpClauseAfter.HasType(VERB_PERS_T) \n\t\t\t\t&&\tpClauseAfter.HasLeftStarter() \n\t\t\t\t)\n\t\t\t{\n\t\t\t\t\tbEncCl = true;\n\t\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif ( pClauseAfter.HasType(PARTICIPLE_T) || pClauseAfter.HasType(ADVERB_PARTICIPLE_T) )\n\t\t\t{\n\t\t\t\t\tbEncCl = true;\n\t\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif ( pClauseAfter.HasType(DASH_T) )\n\t\t\t\tbreak;\n\n\t\t\tif (\t(\t\t\t!pClauseAfter.HasType(INFINITIVE_T) \n\t\t\t\t\t\t&& \t\t!pClauseAfter.m_vectorTypes.empty()\n\t\t\t\t\t) \n\t\t\t\t||  !(pClauseAfter.m_vectorTypes.size() == 1) \n\t\t\t\t)\n\t\t\t{\n\t\t\t\tif (bEncCl)\n\t\t\t\t\tbPersCl = true;\n\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\t\n\t\tif (bPersCl) continue;\n\n\t\tif ( Noun_Nom.size() > 0 && Adj_Nom.size() > 0 )\n\t\t{\n\t\t\tfor (int k = 0; k < Noun_Nom.size() && k < Adj_Nom.size(); k++)\n\t\t\t\tif (      Noun_Nom[k] < Adj_Nom[k] \n                     &&  (pClause.m_iLastWord == Adj_Nom[k] || !HasGenderNumberCaseNP(m_Words[Adj_Nom[k]], m_Words[Adj_Nom[k]+1]) \n\t\t\t\t\t ||  Vozrast) \/\/ 33 \n                   )\n\t\t\t\t\t {\n\t\t\t\t\t\tif(Vozrast) m_Words[Adj_Nom[k]].GetSynHomonym(0).ModifyGrammems( _QM(rPlural) | _QM(rNominativ) | _QM(rAccusativ));\n\t\t\t\t\t\tBuildDash(ClauseNo, Noun_Nom[k]);\n\t\t\t\t\t\t\n\t\t\t\t\t }\n\n\t\t\tcontinue;\n\t\t}\t\t\n\t\t\n\t\tif (-1 != Prep_U && Noun_Gen.size() > 0 && ( Noun_Nom.size() > 0 || Noun_NomSgPl.size() > 0 ) )\n\t\t{\t\t\n\t\t\tfor (int m = 0; m < Noun_Gen.size(); m++)\n\t\t\t\tif (Prep_U < Noun_Gen[m])\n\t\t\t\t{\n\t\t\t\t\tPrep_U = Noun_Gen[m];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\tif ( Noun_Nom.size() > 0 )\n\t\t\t{\n\t\t\t\tif ( Prep_U > Noun_Nom[0] )\n\t\t\t\t\t\tBuildDash(ClauseNo, Noun_Nom[0]);\n\t\t\t\telse\n\t\t\t\t\t\tBuildDash(ClauseNo, Prep_U);\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tint iNomSgPl = -1;\n\t\t\tfor ( int tt = 0; tt < Noun_NomSgPl.size(); tt++ )\n\t\t\t\tif ( Prep_U != Noun_NomSgPl[tt] )\n\t\t\t\t{\n\t\t\t\t\tiNomSgPl = Noun_NomSgPl[tt];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\tif ( -1 != iNomSgPl )\n\t\t\t\tif ( Prep_U > iNomSgPl )\n\t\t\t\t\t\tBuildDash(ClauseNo, iNomSgPl);\n\t\t\t\telse\n\t\t\t\t\t\tBuildDash(ClauseNo, Prep_U);\n\t\t}\n\n\t}\n\t\n}\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\nnamespace odlib\n{\n    namespace utils\n    {\n        namespace number\n        {\n            template<typename T>\n            const bool is_double(const std::basic_string<T>& text)\n            {\n                double number;\n\n                std::basic_istringstream<T> stream(text);\n                stream >> std::noskipws >> number;\n\n                return stream.eof() && (stream.fail() == false);\n            }\n\n            template<typename T>\n            const bool is_long_double(const std::basic_string<T>& text)\n            {\n                long double number;\n\n                std::basic_istringstream<T> stream(text);\n                stream >> std::noskipws >> number;\n\n                return stream.eof() && (stream.fail() == false);\n            }\n\n            template<typename T>\n            const bool is_float(const std::basic_string<T>& text)\n            {\n                float number;\n\n                std::basic_istringstream<T> stream(text);\n                stream >> std::noskipws >> number;\n\n                return stream.eof() && (stream.fail() == false);\n            }\n\n            template<typename T>\n            const bool is_integer(const std::basic_string<T>& text, const std::locale& locale = std::locale())\n            {\n                if (text.length() == 0)\n                {\n                    return false;\n                }\n\n                for (size_t i = 0; i < text.length(); i++)\n                {\n                    if (std::isdigit(text[i], locale) == false)\n                    {\n                        return false;\n                    }\n                }\n\n                return true;\n            }\n\n            template<typename T, typename Elem>\n            const bool is_valid(const std::basic_string<Elem>& text)\n            {\n                \/\/ The stream will insert just one character for char types, prevent this by trying to convert it to short.\n                if constexpr (std::is_same_v<T, char> || std::is_same_v<T, int8_t> || std::is_same_v<T, unsigned char> || std::is_same_v<T, uint8_t>)\n                {\n                    return is_valid<int16_t>(text);\n                }\n                else\n                {\n                    T value;\n\n                    std::basic_istringstream<Elem> stream(text);\n                    stream >> value;\n\n                    return stream.eof() && (stream.fail() == false);\n                }\n            }\n        }\n    }\n}<commit_msg>Fix \"is_integer\" for negative numbers<commit_after>#pragma once\n\nnamespace odlib\n{\n    namespace utils\n    {\n        namespace number\n        {\n            template<typename T>\n            const bool is_double(const std::basic_string<T>& text)\n            {\n                double number;\n\n                std::basic_istringstream<T> stream(text);\n                stream >> std::noskipws >> number;\n\n                return stream.eof() && (stream.fail() == false);\n            }\n\n            template<typename T>\n            const bool is_long_double(const std::basic_string<T>& text)\n            {\n                long double number;\n\n                std::basic_istringstream<T> stream(text);\n                stream >> std::noskipws >> number;\n\n                return stream.eof() && (stream.fail() == false);\n            }\n\n            template<typename T>\n            const bool is_float(const std::basic_string<T>& text)\n            {\n                float number;\n\n                std::basic_istringstream<T> stream(text);\n                stream >> std::noskipws >> number;\n\n                return stream.eof() && (stream.fail() == false);\n            }\n\n            template<typename T>\n            const bool is_integer(const std::basic_string<T>& text, const std::locale& locale = std::locale())\n            {\n                if (text.length() == 0)\n                {\n                    return false;\n                }\n\n                for (auto& c : text)\n                {\n                    if (c != '-' && std::isdigit(c, locale) == false)\n                    {\n                        return false;\n                    }\n                }\n\n                return true;\n            }\n\n            template<typename T, typename Elem>\n            const bool is_valid(const std::basic_string<Elem>& text)\n            {\n                \/\/ The stream will insert just one character for char types, prevent this by trying to convert it to short.\n                if constexpr (std::is_same_v<T, char> || std::is_same_v<T, int8_t> || std::is_same_v<T, unsigned char> || std::is_same_v<T, uint8_t>)\n                {\n                    return is_valid<int16_t>(text);\n                }\n                else\n                {\n                    T value;\n\n                    std::basic_istringstream<Elem> stream(text);\n                    stream >> value;\n\n                    return stream.eof() && (stream.fail() == false);\n                }\n            }\n        }\n    }\n}<|endoftext|>"}
{"text":"<commit_before>\/\/ Time:  ctor: O(b)\n\/\/        pick: O(1)\n\/\/ Space: O(b)\n\nclass Solution {\npublic:\n    Solution(int N, vector<int> blacklist) :\n        n_(N - blacklist.size()) {\n        unordered_set<int> whitelist;\n        for (int i = n_; i < N; ++i) {\n            whitelist.emplace(i);\n        }\n        for (const auto& black : blacklist) {\n            whitelist.erase(black);\n        }\n        auto white = whitelist.cbegin();\n        for (const auto& black : blacklist) {\n            if (black < n_) {\n                lookup_[black] = *(white++);\n            }\n        }\n\t}\n\n    int pick() {\n        int index = rand() % n_;\n        return lookup_.count(index) ? lookup_[index] : index;\n    }\n\nprivate:\n    int n_;\n    unordered_map<int, int> lookup_;\n};\n\n\/**\n * Your Solution object will be instantiated and called as such:\n * Solution obj = new Solution(N, blacklist);\n * int param_1 = obj.pick();\n *\/\n\n\n\/\/ Time:  ctor: O(nlogn)\n\/\/        pick: O(logn)\n\/\/ Space: O(n)\nclass Solution2 {\npublic:\n    Solution(int N, vector<int> blacklist) :\n        n_(N - blacklist.size()),\n        blacklist_(blacklist) {\n\t\t\n        sort(blacklist_.begin(), blacklist_.end());\n    }\n\n    int pick() {\n        int index = rand() % n_;\n        int left = 0, right = blacklist_.size() - 1;\n        while (left <= right) {\n            auto mid = left + (right - left) \/ 2;\n            if (index + mid < blacklist_[mid]) {\n                right = mid - 1;\n            } else {\n                left = mid + 1;\n            }\n        }\n        return index + left;\n    }\n\nprivate:        \n    int n_;\n    vector<int> blacklist_;\n};\n<commit_msg>Update random-pick-with-blacklist.cpp<commit_after>\/\/ Time:  ctor: O(b)\n\/\/        pick: O(1)\n\/\/ Space: O(b)\n\nclass Solution {\npublic:\n    Solution(int N, vector<int> blacklist) :\n        n_(N - blacklist.size()) {\n        unordered_set<int> whitelist;\n        for (int i = n_; i < N; ++i) {\n            whitelist.emplace(i);\n        }\n        for (const auto& black : blacklist) {\n            whitelist.erase(black);\n        }\n        auto white = whitelist.cbegin();\n        for (const auto& black : blacklist) {\n            if (black < n_) {\n                lookup_[black] = *(white++);\n            }\n        }\n    }\n\n    int pick() {\n        int index = rand() % n_;\n        return lookup_.count(index) ? lookup_[index] : index;\n    }\n\nprivate:\n    int n_;\n    unordered_map<int, int> lookup_;\n};\n\n\/**\n * Your Solution object will be instantiated and called as such:\n * Solution obj = new Solution(N, blacklist);\n * int param_1 = obj.pick();\n *\/\n\n\n\/\/ Time:  ctor: O(nlogn)\n\/\/        pick: O(logn)\n\/\/ Space: O(n)\nclass Solution2 {\npublic:\n    Solution(int N, vector<int> blacklist) :\n        n_(N - blacklist.size()),\n        blacklist_(blacklist) {\n\t\t\n        sort(blacklist_.begin(), blacklist_.end());\n    }\n\n    int pick() {\n        int index = rand() % n_;\n        int left = 0, right = blacklist_.size() - 1;\n        while (left <= right) {\n            auto mid = left + (right - left) \/ 2;\n            if (index + mid < blacklist_[mid]) {\n                right = mid - 1;\n            } else {\n                left = mid + 1;\n            }\n        }\n        return index + left;\n    }\n\nprivate:        \n    int n_;\n    vector<int> blacklist_;\n};\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Time:  O(n * 2^n), try out all possible substrings\n\/\/ Space: O(n^2), the depth is at most n, and it costs n at each depth\n\n\/\/ DFS solution.\nclass Solution {\npublic:\n    vector<string> removeInvalidParentheses(string s)  {\n        \/\/ Calculate the minimum left and right parantheses to remove\n        int left_removed = 0, right_removed = 0;\n        for (const auto& c : s) {\n            if (c == '(') {\n                ++left_removed;\n            } else if (c == ')') {\n                if (!left_removed) {\n                    ++right_removed;\n                } else {\n                    --left_removed;\n                }\n            }\n        }\n        vector<string> res;\n        removeInvalidParentheses(s, 0, left_removed, right_removed, &res);\n        return res;\n    }\n\n\n    void removeInvalidParentheses(const string& s, int start,\n                                  int left_removed, int right_removed, vector<string> *res) {\n\n        if (left_removed == 0 && right_removed == 0) {   \n            if (isValid(s)) {\n                res->emplace_back(s);\n            }\n            return;\n        }\n\n        for (int i = start; i < s.size(); ++i) {\n            string tmp = s;\n            if (right_removed == 0 && left_removed > 0 && tmp[i] == '(') {\n                if (i == start || tmp[i] != tmp[i - 1]) {  \/\/ Skip duplicated.\n                    tmp.erase(i, 1);\n                    removeInvalidParentheses(tmp, i, left_removed - 1, right_removed, res);\n                }\n            }\n            if (right_removed > 0 && tmp[i] == ')') {\n                if (i == start || tmp[i] != tmp[i - 1]) {  \/\/ Skip duplicated.\n                    tmp.erase(i, 1);\n                    removeInvalidParentheses(tmp, i, left_removed, right_removed - 1, res);\n                }\n            }\n\n        }\n    }\n\nprivate:\n    \/\/ Check whether s is valid or not.\n    bool isValid(string s) {\n        int sum = 0;\n        for (const auto &c : s) {\n            if (c == '(') {\n                ++sum;\n            } else if (c == ')') {\n                --sum;\n            }\n            if (sum < 0) {\n                return false;\n            }\n        }\n        return sum == 0;\n    }\n};\n<commit_msg>Update remove-invalid-parentheses.cpp<commit_after>\/\/ Time:  O(n * C(n, c)), try out all possible substrings with the minimum c deletion.\n\/\/ Space: O(n^2), the depth is at most n, and it costs n at each depth\n\n\/\/ DFS solution.\nclass Solution {\npublic:\n    vector<string> removeInvalidParentheses(string s)  {\n        \/\/ Calculate the minimum left and right parantheses to remove\n        int left_removed = 0, right_removed = 0;\n        for (const auto& c : s) {\n            if (c == '(') {\n                ++left_removed;\n            } else if (c == ')') {\n                if (!left_removed) {\n                    ++right_removed;\n                } else {\n                    --left_removed;\n                }\n            }\n        }\n        vector<string> res;\n        removeInvalidParentheses(s, 0, left_removed, right_removed, &res);\n        return res;\n    }\n\n\n    void removeInvalidParentheses(const string& s, int start,\n                                  int left_removed, int right_removed, vector<string> *res) {\n\n        if (left_removed == 0 && right_removed == 0) {   \n            if (isValid(s)) {\n                res->emplace_back(s);\n            }\n            return;\n        }\n\n        for (int i = start; i < s.size(); ++i) {\n            string tmp = s;\n            if (right_removed == 0 && left_removed > 0 && tmp[i] == '(') {\n                if (i == start || tmp[i] != tmp[i - 1]) {  \/\/ Skip duplicated.\n                    tmp.erase(i, 1);\n                    removeInvalidParentheses(tmp, i, left_removed - 1, right_removed, res);\n                }\n            }\n            if (right_removed > 0 && tmp[i] == ')') {\n                if (i == start || tmp[i] != tmp[i - 1]) {  \/\/ Skip duplicated.\n                    tmp.erase(i, 1);\n                    removeInvalidParentheses(tmp, i, left_removed, right_removed - 1, res);\n                }\n            }\n\n        }\n    }\n\nprivate:\n    \/\/ Check whether s is valid or not.\n    bool isValid(string s) {\n        int sum = 0;\n        for (const auto &c : s) {\n            if (c == '(') {\n                ++sum;\n            } else if (c == ')') {\n                --sum;\n            }\n            if (sum < 0) {\n                return false;\n            }\n        }\n        return sum == 0;\n    }\n};\n<|endoftext|>"}
{"text":"<commit_before>#ifndef HORNET_ZIP_HH\n#define HORNET_ZIP_HH\n\n#include <cstdint>\n#include <cstddef>\n#include <map>\n\nnamespace hornet {\n\n\/\/\n\/\/ ZIP entry in memory.\n\/\/\nstruct zip_entry {\n    zip_entry();\n    ~zip_entry();\n\n    char *filename;\n    uint32_t comp_size;\n    uint32_t uncomp_size;\n    uint32_t lh_offset;\n    uint16_t compression;\n};\n\n\/\/\n\/\/ ZIP file in memory.\n\/\/\nstruct zip {\n    int fd;\n    size_t len;\n    char* mmap;\n    unsigned long nr_entries;\n    struct zip_entry* entries;\n    std::map<std::string, zip_entry*> entry_cache;\n    std::map<std::string, zip_entry*> class_cache;\n};\n\nstruct zip *zip_open(const char *pathname);\nvoid zip_close(struct zip *zip);\nstruct zip_entry *zip_entry_find(struct zip *zip, const char *filename);\nstruct zip_entry *zip_entry_find_class(struct zip *zip, const char *classname);\nvoid *zip_entry_data(struct zip *zip, struct zip_entry *entry);\n\n}\n\n#endif\n<commit_msg>zip: Add missing <string> include<commit_after>#ifndef HORNET_ZIP_HH\n#define HORNET_ZIP_HH\n\n#include <cstdint>\n#include <cstddef>\n#include <string>\n#include <map>\n\nnamespace hornet {\n\n\/\/\n\/\/ ZIP entry in memory.\n\/\/\nstruct zip_entry {\n    zip_entry();\n    ~zip_entry();\n\n    char *filename;\n    uint32_t comp_size;\n    uint32_t uncomp_size;\n    uint32_t lh_offset;\n    uint16_t compression;\n};\n\n\/\/\n\/\/ ZIP file in memory.\n\/\/\nstruct zip {\n    int fd;\n    size_t len;\n    char* mmap;\n    unsigned long nr_entries;\n    struct zip_entry* entries;\n    std::map<std::string, zip_entry*> entry_cache;\n    std::map<std::string, zip_entry*> class_cache;\n};\n\nstruct zip *zip_open(const char *pathname);\nvoid zip_close(struct zip *zip);\nstruct zip_entry *zip_entry_find(struct zip *zip, const char *filename);\nstruct zip_entry *zip_entry_find_class(struct zip *zip, const char *classname);\nvoid *zip_entry_data(struct zip *zip, struct zip_entry *entry);\n\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"controller.h\"\n\nvoid port_connect(jack_port_id_t a, jack_port_id_t b, int connect, void *arg) {\n    if (!connect) return;\n    \/\/ See if \"dst\" port does not begin with sp_client_\n    jack_port_t *port_a = jack_port_by_id(client, a);\n    jack_port_t *port_b = jack_port_by_id(client, b);\n    if (strstr(jack_port_name(port_b), \"sp_client_\") == jack_port_name(port_b)) {\n        return;\n    }\n    if (!(JackPortIsOutput & jack_port_flags(port_a))) return;\n    \/\/printf(\"Adding to stack a: %s (b: %s)\\n\", jack_port_name(port_a), jack_port_name(port_b));\n    pthread_mutex_lock(&p_queue_mutex);\n    p_queue.push_back(port_a);\n    pthread_mutex_unlock(&p_queue_mutex);\n    pthread_cond_signal(&p_queue_cond);\n}\n\nvoid *connector(void *arg) {\n    pthread_mutex_lock(&p_queue_mutex);\n    while (1) {\n        pthread_cond_wait(&p_queue_cond, &p_queue_mutex);\n        while (!p_queue.empty()) {\n            jack_port_t *port = p_queue.front();\n            p_queue.pop_front();\n            pthread_mutex_unlock(&p_queue_mutex);\n\n            const char *port_name = jack_port_name(port);\n            \/\/printf(\"Got a port to connect to: %s\\n\", port_name);\n            pthread_t tmp;\n            pthread_create(&tmp, NULL, go_sp, (void*)(port_name));\n            sps.insert(pair<const char*, pthread_t>(port_name, tmp));\n\n            pthread_mutex_lock(&p_queue_mutex);\n        }\n    }\n};\n\nvoid its_over(double place) {\n    printf(\"FOUND, processed %.6f sec\\n\", place);\n    pthread_exit(NULL);\n};\n\nvoid *go_sp(void *port_name_a) {\n    \/\/ Call SoundPatty on this port\n    char *port_name = (char*)port_name_a;\n\n    FILE *fpipe;\n    char command[300];\n    sprintf(command, \"%s %s %s jack \\\"%s\\\"\", SP_EXEC, SP_CONF, SP_TRES, port_name);\n\n    char line[200];\n    if ( !(fpipe = (FILE*)popen(command,\"r\")) )\n    {  \/\/ If fpipe is NULL\n        fatal((void*)\"Problems with pipe\");\n    }\n\tfgets( line, sizeof line, fpipe);\n\n    fpipe = popen(\"date \\\"+%F %T\\\" | tr -d '\\n\\'\", \"r\"); \/\/ Date without ENDL\n    char output[300]; int fd;\n    fgets (output, sizeof output, fpipe);\n\n    sprintf(output, \"%s *** %s *** ::: %s\", output, port_name, line);\n    write(fd, output, strlen(output)+1);\n    pthread_exit(NULL);\n};\n\nint main () {\n\n    pthread_mutex_init(&p_queue_mutex, NULL);\n    pthread_cond_init(&p_queue_cond, NULL);\n    ostringstream dst_client_str;\n    dst_client_str << \"sp_manager_\" << getpid();\n    if ((client = jack_client_new (string(dst_client_str.str()).c_str())) == 0) {\n        fatal ((void*)\"jack server not running?\\n\");\n    }\n    dst_client_str.~ostringstream();\n\n    jack_set_port_connect_callback(client, port_connect, NULL);\n    if (jack_activate (client)) { fatal ((void*)\"cannot activate client\"); }\n\n    pthread_t connector1;\n    pthread_create(&connector1, NULL, connector, NULL);\n\n    while (1) {\n        sleep (1);\n    }\n    return 0;\n}\n\nvoid fatal(void * r) {\n    char * msg = (char*) r;\n    printf (msg);\n    pthread_exit (NULL);\n};\n\n\nvoid fatal(char * msg) {\n    printf (msg);\n    pthread_exit (NULL);\n};\n<commit_msg>Fixed memory leak by detaching children threads<commit_after>#include \"controller.h\"\n\nvoid port_connect(jack_port_id_t a, jack_port_id_t b, int connect, void *arg) {\n    if (!connect) return;\n    \/\/ See if \"dst\" port does not begin with sp_client_\n    jack_port_t *port_a = jack_port_by_id(client, a);\n    jack_port_t *port_b = jack_port_by_id(client, b);\n    if (strstr(jack_port_name(port_b), \"sp_client_\") == jack_port_name(port_b)) {\n        return;\n    }\n    if (!(JackPortIsOutput & jack_port_flags(port_a))) return;\n    \/\/printf(\"Adding to stack a: %s (b: %s)\\n\", jack_port_name(port_a), jack_port_name(port_b));\n    pthread_mutex_lock(&p_queue_mutex);\n    p_queue.push_back(port_a);\n    pthread_mutex_unlock(&p_queue_mutex);\n    pthread_cond_signal(&p_queue_cond);\n}\n\nvoid *connector(void *arg) {\n    pthread_mutex_lock(&p_queue_mutex);\n    while (1) {\n        pthread_cond_wait(&p_queue_cond, &p_queue_mutex);\n        while (!p_queue.empty()) {\n            jack_port_t *port = p_queue.front();\n            p_queue.pop_front();\n            pthread_mutex_unlock(&p_queue_mutex);\n\n            const char *port_name = jack_port_name(port);\n            \/\/printf(\"Got a port to connect to: %s\\n\", port_name);\n            pthread_t tmp; pthread_attr_t attr;\n\t\t\tpthread_attr_setdetachstate(&attr, PTHREAD_CREATE_DETACHED);\n\n            pthread_create(&tmp, &attr, go_sp, (void*)(port_name));\n            sps.insert(pair<const char*, pthread_t>(port_name, tmp));\n\n            pthread_mutex_lock(&p_queue_mutex);\n        }\n    }\n};\n\nvoid its_over(double place) {\n    printf(\"FOUND, processed %.6f sec\\n\", place);\n    pthread_exit(NULL);\n};\n\nvoid *go_sp(void *port_name_a) {\n    \/\/ Call SoundPatty on this port\n    char *port_name = (char*)port_name_a;\n\n    FILE *fpipe;\n    char command[300];\n    sprintf(command, \"%s %s %s jack \\\"%s\\\"\", SP_EXEC, SP_CONF, SP_TRES, port_name);\n\n    char line[256];\n    if ( !(fpipe = (FILE*)popen(command,\"r\")) )\n    {  \/\/ If fpipe is NULL\n        fatal((void*)\"Problems with pipe\");\n    }\n\tfgets( line, sizeof line, fpipe); pclose(fpipe);\n\n    fpipe = popen(\"date \\\"+%F %T\\\" | tr -d '\\n\\'\", \"r\"); \/\/ Date without ENDL\n    char output[300]; int fd;\n    fgets (output, sizeof output, fpipe); pclose(fpipe);\n\n    sprintf(output, \"%s *** %s *** ::: %s\", output, port_name, line);\n    write(fd, output, strlen(output)+1);\n    pthread_exit(NULL);\n};\n\nint main () {\n\n    pthread_mutex_init(&p_queue_mutex, NULL);\n    pthread_cond_init(&p_queue_cond, NULL);\n    ostringstream dst_client_str;\n    dst_client_str << \"sp_manager_\" << getpid();\n    if ((client = jack_client_new (string(dst_client_str.str()).c_str())) == 0) {\n        fatal ((void*)\"jack server not running?\\n\");\n    }\n    dst_client_str.~ostringstream();\n\n    jack_set_port_connect_callback(client, port_connect, NULL);\n    if (jack_activate (client)) { fatal ((void*)\"cannot activate client\"); }\n\n    pthread_t connector1;\n    pthread_create(&connector1, NULL, connector, NULL);\n\n    while (1) {\n        sleep (1);\n    }\n    return 0;\n}\n\nvoid fatal(void * r) {\n    char * msg = (char*) r;\n    printf (msg);\n    pthread_exit (NULL);\n};\n\n\nvoid fatal(char * msg) {\n    printf (msg);\n    pthread_exit (NULL);\n};\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <dirent.h>\n#include <sys\/stat.h>\n\/\/#include <boost\/filesystem.hpp>\n#include <boost\/algorithm\/string.hpp>\n#include <fileref.h>\n#include <tag.h>\n#include \"chromaprint.h\"\n#include \"fingerprinter.h\"\n#include \"fingerprinter_configuration.h\"\n#include \"fingerprint_compressor.h\"\n#include \"base64.h\"\n#include \"ext\/ffmpeg_decoder.h\"\n\nusing namespace std;\n\nstatic const int kChromaprintAlgorithm = CHROMAPRINT_ALGORITHM_DEFAULT;\n\ntypedef vector<string> string_vector;\n\nvoid FindFiles(const string &dirname, string_vector *result, time_t changed_since)\n{\n\tDIR *dirp = opendir(dirname.c_str());\n\twhile (dirp) {\n\t\tstruct dirent *dp;\n\t\tif ((dp = readdir(dirp)) != NULL) {\n\t\t\tstruct stat sp;\n\t\t\tstring filename = dirname + '\/' + string(dp->d_name); \n\t\t\tstat(filename.c_str(), &sp);\n\t\t\tif (S_ISREG(sp.st_mode)) {\n\t\t\t\t\/\/cerr << \"file \" << filename << \" mtime=\" << sp.st_mtime << \" ch=\" << changed_since << \"\\n\";\n\t\t\t\tif (!changed_since || sp.st_mtime >= changed_since) {\n\t\t\t\t\tresult->push_back(filename);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (S_ISDIR(sp.st_mode) && dp->d_name[0] != '.') {\n\t\t\t\tFindFiles(filename, result, changed_since);\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tbreak;\n\t\t}\n    }\n    closedir(dirp);\n}\n\nstring_vector FindFiles(const char *dirname, time_t changed_since)\n{\n\tstring_vector result;\n\tFindFiles(dirname, &result, changed_since);\n\tsort(result.begin(), result.end());\n\treturn result;\n}\n\n#define DISPATCH_TAGLIB_FILE(type, file) \\\n\t{ \\\n\t\ttype *tmp = dynamic_cast<type *>(file); \\\n\t\tif (tmp) { \\\n\t\t\treturn ExtractMBIDFromFile(tmp); \\\n\t\t} \\\n\t}\n\n#include <xiphcomment.h>\n#include <apetag.h>\n#include <vorbisfile.h>\n#include <oggflacfile.h>\n#include <speexfile.h>\n#include <flacfile.h>\n#include <mpcfile.h>\n#include <wavpackfile.h>\n#ifdef TAGLIB_WITH_ASF\n#include <asffile.h>\n#endif\n#ifdef TAGLIB_WITH_MP4\n#include <mp4file.h>\n#endif\n#include <mpegfile.h>\n#include <id3v2tag.h>\n#include <uniquefileidentifierframe.h>\n\nstring ExtractMBIDFromXiphComment(TagLib::Ogg::XiphComment *tag)\n{\n\tstring key = \"MUSICBRAINZ_TRACKID\"; \n\tif (tag && tag->fieldListMap().contains(key)) {\n\t\treturn tag->fieldListMap()[key].front().to8Bit(true);\n\t}\n\treturn string();\n}\n\nstring ExtractMBIDFromAPETag(TagLib::APE::Tag *tag)\n{\n\tstring key = \"MUSICBRAINZ_TRACKID\";\n\tif (tag && tag->itemListMap().contains(key)) {\n\t\treturn tag->itemListMap()[key].toString().to8Bit(true);\n\t}\n\treturn string();\n}\n\nstring ExtractMBIDFromFile(TagLib::Ogg::Vorbis::File *file)\n{\n\treturn ExtractMBIDFromXiphComment(file->tag());\n}\n\nstring ExtractMBIDFromFile(TagLib::Ogg::FLAC::File *file)\n{\n\treturn ExtractMBIDFromXiphComment(file->tag());\n}\n\nstring ExtractMBIDFromFile(TagLib::Ogg::Speex::File *file)\n{\n\treturn ExtractMBIDFromXiphComment(file->tag());\n}\n\nstring ExtractMBIDFromFile(TagLib::FLAC::File *file)\n{\n\treturn ExtractMBIDFromXiphComment(file->xiphComment());\n}\n\nstring ExtractMBIDFromFile(TagLib::MPC::File *file)\n{\n\treturn ExtractMBIDFromAPETag(file->APETag());\n}\n\nstring ExtractMBIDFromFile(TagLib::WavPack::File *file)\n{\n\treturn ExtractMBIDFromAPETag(file->APETag());\n}\n\n\/*string ExtractMBIDFromFile(TagLib::APE::File *file)\n{\n\treturn ExtractMBIDFromAPETag(file->APETag());\n}*\/\n\n#ifdef TAGLIB_WITH_ASF\nstring ExtractMBIDFromFile(TagLib::ASF::File *file)\n{\n\tstring key = \"MusicBrainz\/Track Id\";\n\tTagLib::ASF::Tag *tag = file->tag();\n\tif (tag && tag->attributeListMap().contains(key)) {\n\t\treturn tag->attributeListMap()[key].front().toString().to8Bit(true);\n\t}\n\treturn string();\n}\n#endif\n\n#ifdef TAGLIB_WITH_MP4\nstring ExtractMBIDFromFile(TagLib::MP4::File *file)\n{\n\tstring key = \"----:com.apple.iTunes:MusicBrainz Track Id\";\n\tTagLib::MP4::Tag *tag = file->tag();\n\tif (tag && tag->itemListMap().contains(key)) {\n\t\treturn tag->itemListMap()[key].toStringList().toString().to8Bit(true);\n\t}\n\treturn string();\n}\n#endif\n\nstring ExtractMBIDFromFile(TagLib::MPEG::File *file)\n{\n\tTagLib::ID3v2::Tag *tag = file->ID3v2Tag();\n\tif (!tag) {\n\t\treturn string();\n\t}\n\tTagLib::ID3v2::FrameList ufid = tag->frameListMap()[\"UFID\"];\n\tif (!ufid.isEmpty()) {\n\t\tfor (TagLib::ID3v2::FrameList::Iterator i = ufid.begin(); i != ufid.end(); i++) {\n\t\t\tTagLib::ID3v2::UniqueFileIdentifierFrame *frame = dynamic_cast<TagLib::ID3v2::UniqueFileIdentifierFrame *>(*i);\n\t\t\tif (frame && frame->owner() == \"http:\/\/musicbrainz.org\") {\n\t\t\t\tTagLib::ByteVector id = frame->identifier();\n\t\t\t\treturn string(id.data(), id.size());\n\t\t\t}\n\t\t}\n\t}\n\treturn string();\n}\n\nstring ExtractMusicBrainzTrackID(TagLib::File *file)\n{\n\tDISPATCH_TAGLIB_FILE(TagLib::FLAC::File, file);\n\tDISPATCH_TAGLIB_FILE(TagLib::Ogg::Vorbis::File, file);\n\tDISPATCH_TAGLIB_FILE(TagLib::Ogg::FLAC::File, file);\n\tDISPATCH_TAGLIB_FILE(TagLib::Ogg::Speex::File, file);\n\tDISPATCH_TAGLIB_FILE(TagLib::MPC::File, file);\n\tDISPATCH_TAGLIB_FILE(TagLib::WavPack::File, file);\n#ifdef TAGLIB_WITH_ASF\n\tDISPATCH_TAGLIB_FILE(TagLib::ASF::File, file);\n#endif\n#ifdef TAGLIB_WITH_MP4\n\tDISPATCH_TAGLIB_FILE(TagLib::MP4::File, file);\n#endif\n\tDISPATCH_TAGLIB_FILE(TagLib::MPEG::File, file);\n\treturn string();\n}\n\nbool ReadTags(const string &filename, bool ignore_missing_mbid)\n{\n\tTagLib::FileRef file(filename.c_str(), true);\n\tif (file.isNull())\n\t\treturn false;\n\tTagLib::Tag *tags = file.tag();\t\n\tTagLib::AudioProperties *props = file.audioProperties();\n\tif (!tags || !props)\n\t\treturn false;\n\t\/\/cout << \"ARTIST=\" << tags->artist().to8Bit(true) << \"\\n\";\n\t\/\/cout << \"TITLE=\" << tags->title().to8Bit(true) << \"\\n\";\n\t\/\/cout << \"ALBUM=\" << tags->album().to8Bit(true) << \"\\n\";\n\tint length = props->length();\n\tif (!length)\n\t\treturn false;\n\tstring mbid = ExtractMusicBrainzTrackID(file.file());\n\tif (mbid.size() != 36 && !ignore_missing_mbid)\n\t\treturn false;\n\tcout << \"MBID=\" << mbid << \"\\n\";\n\tcout << \"LENGTH=\" << length << \"\\n\";\n\tcout << \"BITRATE=\" << props->bitrate() << \"\\n\";\n\treturn true;\n}\n\nstring ExtractExtension(const string &filename)\n{\n\tsize_t pos = filename.find_last_of('.');\n\tif (pos == string::npos) {\n\t\treturn string();\n\t}\n\treturn boost::to_upper_copy(filename.substr(pos + 1));\n}\n\nstring EncodeFingerprint(const vector<uint32_t> &fp)\n{\n\tstring res;\n\tres.resize(fp.size());\n}\n\nbool ProcessFile(Chromaprint::Fingerprinter *fingerprinter, const string &filename, bool ignore_missing_mbid, int audio_length)\n{\n\tif (!ReadTags(filename, ignore_missing_mbid))\n\t\treturn false;\n\tDecoder decoder(filename);\n\tif (!decoder.Open())\n\t\treturn false;\n\tif (!fingerprinter->Start(decoder.SampleRate(), decoder.Channels()))\n\t\treturn false;\n\tcerr << filename << \"\\n\";\n\tcout << \"FILENAME=\" << filename << \"\\n\";\n\tcout << \"FORMAT=\" << ExtractExtension(filename) << \"\\n\";\n\tdecoder.Decode(fingerprinter, audio_length);\n\tvector<int32_t> fp = fingerprinter->Finish();\n\t\/*cout << \"FINGERPRINT1=\";\n\tfor (int i = 0; i < fp.size(); i++) {\n\t\tcout << fp[i] << \", \";\n\t}\n\tcout << \"\\n\";*\/\n\tcout << \"FINGERPRINT=\" << Chromaprint::Base64Encode(Chromaprint::CompressFingerprint(fp, kChromaprintAlgorithm)) << \"\\n\\n\";\n\treturn true;\n}\n\nint main(int argc, char **argv)\n{\n\tif (argc < 2) {\n\t\tcerr << \"Usage: \" << argv[0] << \" [OPTIONS] DIR\\n\";\n\t\tcerr << \"Options:\\n\";\n\t\tcerr << \" -nombid            Do not require a MBID embedded in the file\\n\";\n\t\tcerr << \" -since [date]      Process only files modified since the given date\\n\";\n\t\tcerr << \" -length [seconds]  Length of the audio data used for fingerprinting (default 120)\\n\";\n\t\treturn 1;\n\t}\n\n\tchar *directory = NULL;\n\tchar *changed_since_str = NULL;\n\tint audio_length = 120;\n\tbool ignore_missing_mbid = false;\n\tfor (int i = 1; i < argc; i++) {\n\t\tif (strcmp(argv[i], \"-nombid\") == 0) {\n\t\t\tignore_missing_mbid = true;\n\t\t}\n\t\telse if (strcmp(argv[i], \"-since\") == 0 && i + 1 < argc) {\n\t\t\tchanged_since_str = argv[++i];\n\t\t}\n\t\telse if (strcmp(argv[i], \"-length\") == 0 && i + 1 < argc) {\n\t\t\taudio_length = atoi(argv[++i]);\n\t\t}\n\t\telse {\n\t\t\tdirectory = argv[i];\n\t\t}\n\t}\n\n\ttime_t changed_since = 0;\n\tif (changed_since_str) {\n\t\tstruct tm tm;\n\t\tmemset(&tm, 0, sizeof(tm));\n\t\tif (strptime(changed_since_str, \"%Y-%m-%d %H:%M\", &tm) == NULL) {\n\t\t\tif (strptime(changed_since_str, \"%Y-%m-%d\", &tm) == NULL) {\n\t\t\t\tcerr << \"ERROR: Invalid date, the expected format is 'YYYY-MM-DD' or 'YYYY-MM-DD HH:MM'\\n\";\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t}\n\t\ttm.tm_isdst = -1;\n\t\tchanged_since = mktime(&tm);\n\t\tcerr << \"Calculating fingerprints for files in \" << directory << \" that were changed since \" << changed_since_str << \"\\n\";\n\t}\n\telse {\n\t\tcerr << \"Calculating fingerprints for all files in \" << directory << \"\\n\";\n\t}\n\n\tChromaprint::Fingerprinter fingerprinter(Chromaprint::CreateFingerprinterConfiguration(kChromaprintAlgorithm));\n\tstring_vector files = FindFiles(directory, changed_since);\n\tfor (string_vector::iterator it = files.begin(); it != files.end(); it++) {\n\t\tProcessFile(&fingerprinter, *it, ignore_missing_mbid, audio_length);\n\t}\n\n\treturn 0;\n}\n\n<commit_msg>Support for multiple files on the commandline<commit_after>#include <iostream>\n#include <dirent.h>\n#include <sys\/stat.h>\n\/\/#include <boost\/filesystem.hpp>\n#include <boost\/algorithm\/string.hpp>\n#include <fileref.h>\n#include <tag.h>\n#include \"chromaprint.h\"\n#include \"fingerprinter.h\"\n#include \"fingerprinter_configuration.h\"\n#include \"fingerprint_compressor.h\"\n#include \"base64.h\"\n#include \"ext\/ffmpeg_decoder.h\"\n\nusing namespace std;\n\nstatic const int kChromaprintAlgorithm = CHROMAPRINT_ALGORITHM_DEFAULT;\n\ntypedef vector<string> string_vector;\n\nvoid FindFiles(const string &dirname, string_vector *result, time_t changed_since)\n{\n\tDIR *dirp = opendir(dirname.c_str());\n\tif (!dirp) {\n\t\tif (errno == ENOTDIR) {\n\t\t\tresult->push_back(dirname);\n\t\t}\n\t\treturn;\n\t}\n\twhile (dirp) {\n\t\tstruct dirent *dp;\n\t\tif ((dp = readdir(dirp)) != NULL) {\n\t\t\tstruct stat sp;\n\t\t\tstring filename = dirname + '\/' + string(dp->d_name); \n\t\t\tstat(filename.c_str(), &sp);\n\t\t\tif (S_ISREG(sp.st_mode)) {\n\t\t\t\t\/\/cerr << \"file \" << filename << \" mtime=\" << sp.st_mtime << \" ch=\" << changed_since << \"\\n\";\n\t\t\t\tif (!changed_since || sp.st_mtime >= changed_since) {\n\t\t\t\t\tresult->push_back(filename);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (S_ISDIR(sp.st_mode) && dp->d_name[0] != '.') {\n\t\t\t\tFindFiles(filename, result, changed_since);\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tbreak;\n\t\t}\n    }\n    closedir(dirp);\n}\n\nstring_vector FindFiles(const string_vector &files, time_t changed_since)\n{\n\tstring_vector result;\n\tfor (int i = 0; i < files.size(); i++) {\n\t\tFindFiles(files[i], &result, changed_since);\n\t}\n\tsort(result.begin(), result.end());\n\treturn result;\n}\n\n#define DISPATCH_TAGLIB_FILE(type, file) \\\n\t{ \\\n\t\ttype *tmp = dynamic_cast<type *>(file); \\\n\t\tif (tmp) { \\\n\t\t\treturn ExtractMBIDFromFile(tmp); \\\n\t\t} \\\n\t}\n\n#include <xiphcomment.h>\n#include <apetag.h>\n#include <vorbisfile.h>\n#include <oggflacfile.h>\n#include <speexfile.h>\n#include <flacfile.h>\n#include <mpcfile.h>\n#include <wavpackfile.h>\n#ifdef TAGLIB_WITH_ASF\n#include <asffile.h>\n#endif\n#ifdef TAGLIB_WITH_MP4\n#include <mp4file.h>\n#endif\n#include <mpegfile.h>\n#include <id3v2tag.h>\n#include <uniquefileidentifierframe.h>\n\nstring ExtractMBIDFromXiphComment(TagLib::Ogg::XiphComment *tag)\n{\n\tstring key = \"MUSICBRAINZ_TRACKID\"; \n\tif (tag && tag->fieldListMap().contains(key)) {\n\t\treturn tag->fieldListMap()[key].front().to8Bit(true);\n\t}\n\treturn string();\n}\n\nstring ExtractMBIDFromAPETag(TagLib::APE::Tag *tag)\n{\n\tstring key = \"MUSICBRAINZ_TRACKID\";\n\tif (tag && tag->itemListMap().contains(key)) {\n\t\treturn tag->itemListMap()[key].toString().to8Bit(true);\n\t}\n\treturn string();\n}\n\nstring ExtractMBIDFromFile(TagLib::Ogg::Vorbis::File *file)\n{\n\treturn ExtractMBIDFromXiphComment(file->tag());\n}\n\nstring ExtractMBIDFromFile(TagLib::Ogg::FLAC::File *file)\n{\n\treturn ExtractMBIDFromXiphComment(file->tag());\n}\n\nstring ExtractMBIDFromFile(TagLib::Ogg::Speex::File *file)\n{\n\treturn ExtractMBIDFromXiphComment(file->tag());\n}\n\nstring ExtractMBIDFromFile(TagLib::FLAC::File *file)\n{\n\treturn ExtractMBIDFromXiphComment(file->xiphComment());\n}\n\nstring ExtractMBIDFromFile(TagLib::MPC::File *file)\n{\n\treturn ExtractMBIDFromAPETag(file->APETag());\n}\n\nstring ExtractMBIDFromFile(TagLib::WavPack::File *file)\n{\n\treturn ExtractMBIDFromAPETag(file->APETag());\n}\n\n\/*string ExtractMBIDFromFile(TagLib::APE::File *file)\n{\n\treturn ExtractMBIDFromAPETag(file->APETag());\n}*\/\n\n#ifdef TAGLIB_WITH_ASF\nstring ExtractMBIDFromFile(TagLib::ASF::File *file)\n{\n\tstring key = \"MusicBrainz\/Track Id\";\n\tTagLib::ASF::Tag *tag = file->tag();\n\tif (tag && tag->attributeListMap().contains(key)) {\n\t\treturn tag->attributeListMap()[key].front().toString().to8Bit(true);\n\t}\n\treturn string();\n}\n#endif\n\n#ifdef TAGLIB_WITH_MP4\nstring ExtractMBIDFromFile(TagLib::MP4::File *file)\n{\n\tstring key = \"----:com.apple.iTunes:MusicBrainz Track Id\";\n\tTagLib::MP4::Tag *tag = file->tag();\n\tif (tag && tag->itemListMap().contains(key)) {\n\t\treturn tag->itemListMap()[key].toStringList().toString().to8Bit(true);\n\t}\n\treturn string();\n}\n#endif\n\nstring ExtractMBIDFromFile(TagLib::MPEG::File *file)\n{\n\tTagLib::ID3v2::Tag *tag = file->ID3v2Tag();\n\tif (!tag) {\n\t\treturn string();\n\t}\n\tTagLib::ID3v2::FrameList ufid = tag->frameListMap()[\"UFID\"];\n\tif (!ufid.isEmpty()) {\n\t\tfor (TagLib::ID3v2::FrameList::Iterator i = ufid.begin(); i != ufid.end(); i++) {\n\t\t\tTagLib::ID3v2::UniqueFileIdentifierFrame *frame = dynamic_cast<TagLib::ID3v2::UniqueFileIdentifierFrame *>(*i);\n\t\t\tif (frame && frame->owner() == \"http:\/\/musicbrainz.org\") {\n\t\t\t\tTagLib::ByteVector id = frame->identifier();\n\t\t\t\treturn string(id.data(), id.size());\n\t\t\t}\n\t\t}\n\t}\n\treturn string();\n}\n\nstring ExtractMusicBrainzTrackID(TagLib::File *file)\n{\n\tDISPATCH_TAGLIB_FILE(TagLib::FLAC::File, file);\n\tDISPATCH_TAGLIB_FILE(TagLib::Ogg::Vorbis::File, file);\n\tDISPATCH_TAGLIB_FILE(TagLib::Ogg::FLAC::File, file);\n\tDISPATCH_TAGLIB_FILE(TagLib::Ogg::Speex::File, file);\n\tDISPATCH_TAGLIB_FILE(TagLib::MPC::File, file);\n\tDISPATCH_TAGLIB_FILE(TagLib::WavPack::File, file);\n#ifdef TAGLIB_WITH_ASF\n\tDISPATCH_TAGLIB_FILE(TagLib::ASF::File, file);\n#endif\n#ifdef TAGLIB_WITH_MP4\n\tDISPATCH_TAGLIB_FILE(TagLib::MP4::File, file);\n#endif\n\tDISPATCH_TAGLIB_FILE(TagLib::MPEG::File, file);\n\treturn string();\n}\n\nbool ReadTags(const string &filename, bool ignore_missing_mbid)\n{\n\tTagLib::FileRef file(filename.c_str(), true);\n\tif (file.isNull())\n\t\treturn false;\n\tTagLib::Tag *tags = file.tag();\t\n\tTagLib::AudioProperties *props = file.audioProperties();\n\tif (!tags || !props)\n\t\treturn false;\n\t\/\/cout << \"ARTIST=\" << tags->artist().to8Bit(true) << \"\\n\";\n\t\/\/cout << \"TITLE=\" << tags->title().to8Bit(true) << \"\\n\";\n\t\/\/cout << \"ALBUM=\" << tags->album().to8Bit(true) << \"\\n\";\n\tint length = props->length();\n\tif (!length)\n\t\treturn false;\n\tstring mbid = ExtractMusicBrainzTrackID(file.file());\n\tif (mbid.size() != 36 && !ignore_missing_mbid)\n\t\treturn false;\n\tcout << \"MBID=\" << mbid << \"\\n\";\n\tcout << \"LENGTH=\" << length << \"\\n\";\n\tcout << \"BITRATE=\" << props->bitrate() << \"\\n\";\n\treturn true;\n}\n\nstring ExtractExtension(const string &filename)\n{\n\tsize_t pos = filename.find_last_of('.');\n\tif (pos == string::npos) {\n\t\treturn string();\n\t}\n\treturn boost::to_upper_copy(filename.substr(pos + 1));\n}\n\nstring EncodeFingerprint(const vector<uint32_t> &fp)\n{\n\tstring res;\n\tres.resize(fp.size());\n}\n\nbool ProcessFile(Chromaprint::Fingerprinter *fingerprinter, const string &filename, bool ignore_missing_mbid, int audio_length)\n{\n\tif (!ReadTags(filename, ignore_missing_mbid))\n\t\treturn false;\n\tDecoder decoder(filename);\n\tif (!decoder.Open())\n\t\treturn false;\n\tif (!fingerprinter->Start(decoder.SampleRate(), decoder.Channels()))\n\t\treturn false;\n\tcerr << filename << \"\\n\";\n\tcout << \"FILENAME=\" << filename << \"\\n\";\n\tcout << \"FORMAT=\" << ExtractExtension(filename) << \"\\n\";\n\tdecoder.Decode(fingerprinter, audio_length);\n\tvector<int32_t> fp = fingerprinter->Finish();\n\t\/*cout << \"FINGERPRINT1=\";\n\tfor (int i = 0; i < fp.size(); i++) {\n\t\tcout << fp[i] << \", \";\n\t}\n\tcout << \"\\n\";*\/\n\tcout << \"FINGERPRINT=\" << Chromaprint::Base64Encode(Chromaprint::CompressFingerprint(fp, kChromaprintAlgorithm)) << \"\\n\\n\";\n\treturn true;\n}\n\nint main(int argc, char **argv)\n{\n\tif (argc < 2) {\n\t\tcerr << \"Usage: \" << argv[0] << \" [OPTIONS] FILE...\\n\";\n\t\tcerr << \"Options:\\n\";\n\t\tcerr << \" -nombid          Do not require a MBID embedded in the file\\n\";\n\t\tcerr << \" -since DATE      Process only files modified since the given date\\n\";\n\t\tcerr << \" -length SECONDS  Length of the audio data used for fingerprinting (default 120)\\n\";\n\t\treturn 1;\n\t}\n\n\tstring_vector files;\n\tchar *changed_since_str = NULL;\n\tint audio_length = 120;\n\tbool ignore_missing_mbid = false;\n\tfor (int i = 1; i < argc; i++) {\n\t\tif (strcmp(argv[i], \"-nombid\") == 0) {\n\t\t\tignore_missing_mbid = true;\n\t\t}\n\t\telse if (strcmp(argv[i], \"-since\") == 0 && i + 1 < argc) {\n\t\t\tchanged_since_str = argv[++i];\n\t\t}\n\t\telse if (strcmp(argv[i], \"-length\") == 0 && i + 1 < argc) {\n\t\t\taudio_length = atoi(argv[++i]);\n\t\t}\n\t\telse {\n\t\t\tfiles.push_back(argv[i]);\n\t\t}\n\t}\n\n\ttime_t changed_since = 0;\n\tif (changed_since_str) {\n\t\tstruct tm tm;\n\t\tmemset(&tm, 0, sizeof(tm));\n\t\tif (strptime(changed_since_str, \"%Y-%m-%d %H:%M\", &tm) == NULL) {\n\t\t\tif (strptime(changed_since_str, \"%Y-%m-%d\", &tm) == NULL) {\n\t\t\t\tcerr << \"ERROR: Invalid date, the expected format is 'YYYY-MM-DD' or 'YYYY-MM-DD HH:MM'\\n\";\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t}\n\t\ttm.tm_isdst = -1;\n\t\tchanged_since = mktime(&tm);\n\t\t\/\/cerr << \"Calculating fingerprints for files in \" << files << \" that were changed since \" << changed_since_str << \"\\n\";\n\t}\n\telse {\n\t\t\/\/cerr << \"Calculating fingerprints for all files in \" << files << \"\\n\";\n\t}\n\n\tChromaprint::Fingerprinter fingerprinter(Chromaprint::CreateFingerprinterConfiguration(kChromaprintAlgorithm));\n\tfiles = FindFiles(files, changed_since);\n\tfor (string_vector::iterator it = files.begin(); it != files.end(); it++) {\n\t\tProcessFile(&fingerprinter, *it, ignore_missing_mbid, audio_length);\n\t}\n\n\treturn 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2013-2015 Stanford University\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 <array>\n#include <string>\n#include <utility>\n\n#include \"src\/ext\/cpputil\/include\/serialize\/text_reader.h\"\n#include \"src\/ext\/cpputil\/include\/serialize\/text_writer.h\"\n\n#include \"src\/ext\/x64asm\/src\/opcode.h\"\n\n#include \"tools\/io\/opc_set.h\"\n#include \"tools\/io\/generic.h\"\n\nusing namespace cpputil;\nusing namespace std;\nusing namespace x64asm;\n\n\nnamespace stoke {\n\nvoid OpcSetReader::operator()(istream& is, set<Opcode>& os) {\n  vector<string> args;\n  TextReader<vector<string>>()(is, args);\n\n  for (const auto& a : args) {\n    Opcode opc;\n\n    stringstream ss;\n    ss.str(a);\n    ss >> opc;\n\n    if(failed(ss)) {\n      fail(is) << fail_msg(ss);\n      return;\n    }\n    os.insert(opc);\n  }\n}\n\nvoid OpcSetWriter::operator()(ostream& os, const set<Opcode>& ocs) {\n  os << \"{\";\n  set<const char*> result;\n  for (auto opc : ocs) {\n    os << \" \" << opc;\n  }\n  os << \" }\";\n}\n\n} \/\/ namespace stoke\n<commit_msg>fix performance problem<commit_after>\/\/ Copyright 2013-2015 Stanford University\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 <array>\n#include <string>\n#include <utility>\n\n#include \"src\/ext\/cpputil\/include\/serialize\/text_reader.h\"\n#include \"src\/ext\/cpputil\/include\/serialize\/text_writer.h\"\n\n#include \"src\/ext\/x64asm\/src\/opcode.h\"\n\n#include \"tools\/io\/opc_set.h\"\n#include \"tools\/io\/generic.h\"\n\nusing namespace cpputil;\nusing namespace std;\nusing namespace x64asm;\n\nnamespace {\n\nvector<pair<Opcode, string>> opcodes;\n\n}\n\nnamespace stoke {\n\nbool cmp(const pair<Opcode, string>& a, const pair<Opcode, string>& b) {\n  return b.second.compare(a.second) > 0;\n}\nbool binary_search(const string& key, set<Opcode>& os) {\n  if (opcodes.size() == 0) {\n    stringstream ss;\n    \/\/ initialize sorted opcode list\n    for (int i = ADC_AL_IMM8; i <= XTEST; i++) {\n      ss.clear();\n      ss.str(\"\");\n      ss << ((Opcode) i);\n      opcodes.push_back(pair<Opcode, string>((Opcode) i, ss.str()));\n    }\n    sort(opcodes.begin(), opcodes.end(), cmp);\n  }\n\n  auto k = pair<Opcode, string>(XTEST, key);\n  auto lower = lower_bound(opcodes.begin(), opcodes.end(), k, cmp);\n  if (lower != opcodes.end() && lower->second == key) {\n    os.insert(lower->first);\n    return true;\n  }\n  return false;\n}\n\nvoid OpcSetReader::operator()(istream& is, set<Opcode>& os) {\n  vector<string> args;\n  TextReader<vector<string>>()(is, args);\n\n  for (const auto& a : args) {\n    if (!binary_search(a, os)) {\n      is.setstate(ios::failbit);\n      return;\n    }\n  }\n}\n\nvoid OpcSetWriter::operator()(ostream& os, const set<Opcode>& ocs) {\n  os << \"{\";\n  set<const char*> result;\n  for (auto opc : ocs) {\n    os << \" \" << opc;\n  }\n  os << \" }\";\n}\n\n} \/\/ namespace stoke\n\n<|endoftext|>"}
{"text":"<commit_before>\n#include <iostream>\t\n#include <libxml\/parser.h>\t\n#include <libxml\/xmlerror.h>\t\n#include <mathmlconfig.h>\t\n\nvoid structuredErrorCallback(void *userData, xmlErrorPtr error)\t\n{\t\n    std::string errorString = std::string(error->message);\t\n    \/\/ Swap libxml2 carriage return for a period.\t\n    if (errorString.substr(errorString.length() - 1) == \"\\n\") {\t\n        errorString.replace(errorString.end() - 1, errorString.end(), \".\");\t\n    }\t\n    std::cout << errorString << std::endl;\t\n}\t\n\nint main(int argc, char *argv[])\t\n{\t\n  const std::string input = \"<math><ci cellml:units=\\\"dimensionless\\\">B<\/ci><\/math>\";\n  const std::string mathmlDtd = \"<!DOCTYPE math SYSTEM \\\"\" + libcellml::LIBCELLML_MATHML_DTD_LOCATION + \"\\\">\";\t\n  std::string mathmlString = mathmlDtd + input;\t\n  xmlInitParser();\n  xmlParserCtxtPtr context = xmlNewParserCtxt();\t\n  xmlSetStructuredErrorFunc(context, structuredErrorCallback);\t\n  xmlDocPtr xmlDoc = xmlCtxtReadDoc(context, reinterpret_cast<const xmlChar *>(mathmlString.c_str()), \"\/\", nullptr, XML_PARSE_DTDVALID);\t\n  xmlFreeParserCtxt(context);\t\n  xmlSetStructuredErrorFunc(nullptr, nullptr);\t\n  xmlFreeDoc(xmlDoc);\n  xmlCleanupParser();\n  xmlCleanupGlobals();\t\n}\n\n<commit_msg>Remove test_libxml2.cpp file, this file is no longer used.<commit_after><|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#include \"thread.hh\"\n#include \"posix.hh\"\n#include <ucontext.h>\n#include <algorithm>\n\n\/\/\/ \\cond internal\n\nnamespace seastar {\n\nthread_local jmp_buf_link g_unthreaded_context;\nthread_local jmp_buf_link* g_current_context;\n\n#ifdef ASAN_ENABLED\n\nnamespace {\n\n#ifdef HAVE_ASAN_FIBER_SUPPORT\n\/\/ ASan provides two functions as a means of informing it that user context\n\/\/ switch has happened. First __sanitizer_start_switch_fiber() needs to be\n\/\/ called with a place to store the fake stack pointer and the new stack\n\/\/ information as arguments. Then, ucontext switch may be performed after which\n\/\/ __sanitizer_finish_switch_fiber() needs to be called with a pointer to the\n\/\/ current context fake stack and a place to store stack information of the\n\/\/ previous ucontext.\n\nextern \"C\" {\nvoid __sanitizer_start_switch_fiber(void** fake_stack_save, const void* stack_bottom, size_t stack_size);\nvoid __sanitizer_finish_switch_fiber(void* fake_stack_save, const void** stack_bottom_old, size_t* stack_size_old);\n}\n#else\nstatic inline void __sanitizer_start_switch_fiber(...) { }\nstatic inline void __sanitizer_finish_switch_fiber(...) { }\n#endif\n\nthread_local jmp_buf_link* g_previous_context;\n\n}\n\nvoid jmp_buf_link::initial_switch_in(ucontext_t* initial_context, const void* stack_bottom, size_t stack_size)\n{\n    auto prev = std::exchange(g_current_context, this);\n    link = prev;\n    g_previous_context = prev;\n    __sanitizer_start_switch_fiber(&prev->fake_stack, stack_bottom, stack_size);\n    swapcontext(&prev->context, initial_context);\n    __sanitizer_finish_switch_fiber(g_current_context->fake_stack, &g_previous_context->stack_bottom,\n                                    &g_previous_context->stack_size);\n}\n\nvoid jmp_buf_link::switch_in()\n{\n    auto prev = std::exchange(g_current_context, this);\n    link = prev;\n    g_previous_context = prev;\n    __sanitizer_start_switch_fiber(&prev->fake_stack, stack_bottom, stack_size);\n    swapcontext(&prev->context, &context);\n    __sanitizer_finish_switch_fiber(g_current_context->fake_stack, &g_previous_context->stack_bottom,\n                                    &g_previous_context->stack_size);\n}\n\nvoid jmp_buf_link::switch_out()\n{\n    g_current_context = link;\n    g_previous_context = this;\n    __sanitizer_start_switch_fiber(&fake_stack, g_current_context->stack_bottom,\n                                   g_current_context->stack_size);\n    swapcontext(&context, &g_current_context->context);\n    __sanitizer_finish_switch_fiber(g_current_context->fake_stack, &g_previous_context->stack_bottom,\n                                    &g_previous_context->stack_size);\n}\n\nvoid jmp_buf_link::initial_switch_in_completed()\n{\n    \/\/ This is a new thread and it doesn't have the fake stack yet. ASan will\n    \/\/ create it lazily, for now just pass nullptr.\n    __sanitizer_finish_switch_fiber(nullptr, &g_previous_context->stack_bottom, &g_previous_context->stack_size);\n}\n\nvoid jmp_buf_link::final_switch_out()\n{\n    g_current_context = link;\n    g_previous_context = this;\n    \/\/ Since the thread is about to die we pass nullptr as fake_stack_save argument\n    \/\/ so that ASan knows it can destroy the fake stack if it exists.\n    __sanitizer_start_switch_fiber(nullptr, g_current_context->stack_bottom, g_current_context->stack_size);\n    setcontext(&g_current_context->context);\n}\n\n#else\n\ninline void jmp_buf_link::initial_switch_in(ucontext_t* initial_context, const void*, size_t)\n{\n    auto prev = std::exchange(g_current_context, this);\n    link = prev;\n    if (setjmp(prev->jmpbuf) == 0) {\n        setcontext(initial_context);\n    }\n}\n\ninline void jmp_buf_link::switch_in()\n{\n    auto prev = std::exchange(g_current_context, this);\n    link = prev;\n    if (setjmp(prev->jmpbuf) == 0) {\n        longjmp(jmpbuf, 1);\n    }\n}\n\ninline void jmp_buf_link::switch_out()\n{\n    g_current_context = link;\n    if (setjmp(jmpbuf) == 0) {\n        longjmp(g_current_context->jmpbuf, 1);\n    }\n}\n\ninline void jmp_buf_link::initial_switch_in_completed()\n{\n}\n\ninline void jmp_buf_link::final_switch_out()\n{\n    g_current_context = link;\n    longjmp(g_current_context->jmpbuf, 1);\n}\n\n#endif\n\nthread_context::thread_context(thread_attributes attr, std::function<void ()> func)\n        : _attr(std::move(attr))\n        , _func(std::move(func))\n        , _scheduling_group(_attr.sched_group.value_or(current_scheduling_group())) {\n    setup();\n    _all_threads.push_front(*this);\n}\n\nthread_context::~thread_context() {\n#ifdef SEASTAR_THREAD_STACK_GUARDS\n    auto mp_result = mprotect(_stack.get(), getpagesize(), PROT_READ | PROT_WRITE);\n    assert(mp_result == 0);\n#endif\n    _all_threads.erase(_all_threads.iterator_to(*this));\n}\n\nthread_context::stack_holder\nthread_context::make_stack() {\n#ifdef SEASTAR_THREAD_STACK_GUARDS\n    auto stack = stack_holder(new (with_alignment(getpagesize())) char[_stack_size]);\n#else\n    auto stack = stack_holder(new char[_stack_size]);\n#endif\n#ifdef ASAN_ENABLED\n    \/\/ Avoid ASAN false positive due to garbage on stack\n    std::fill_n(stack.get(), _stack_size, 0);\n#endif\n    return stack;\n}\n\nvoid thread_context::stack_deleter::operator()(char* ptr) const noexcept {\n#ifdef SEASTAR_THREAD_STACK_GUARDS\n    operator delete[] (ptr, with_alignment(getpagesize()));\n#else\n    delete[] ptr;\n#endif\n}\n\nvoid\nthread_context::setup() {\n    \/\/ use setcontext() for the initial jump, as it allows us\n    \/\/ to set up a stack, but continue with longjmp() as it's\n    \/\/ much faster.\n    ucontext_t initial_context;\n    auto q = uint64_t(reinterpret_cast<uintptr_t>(this));\n    auto main = reinterpret_cast<void (*)()>(&thread_context::s_main);\n    auto r = getcontext(&initial_context);\n    throw_system_error_on(r == -1);\n#ifdef SEASTAR_THREAD_STACK_GUARDS\n    size_t page_size = getpagesize();\n    assert(align_up(_stack.get(), page_size) == _stack.get());\n    assert(_stack_size > page_size * 4 && \"Stack guard would take too much portion of the stack\");\n    auto mp_status = mprotect(_stack.get(), page_size, PROT_READ);\n    throw_system_error_on(mp_status != 0, \"mprotect\");\n#endif\n    initial_context.uc_stack.ss_sp = _stack.get();\n    initial_context.uc_stack.ss_size = _stack_size;\n    initial_context.uc_link = nullptr;\n    makecontext(&initial_context, main, 2, int(q), int(q >> 32));\n    _context.thread = this;\n    _context.initial_switch_in(&initial_context, _stack.get(), _stack_size);\n}\n\nvoid\nthread_context::switch_in() {\n    if (_attr.scheduling_group) {\n        _attr.scheduling_group->account_start();\n        _context.yield_at = _attr.scheduling_group->_this_run_start + _attr.scheduling_group->_this_period_remain;\n    } else {\n        _context.yield_at = {};\n    }\n    _context.switch_in();\n}\n\nvoid\nthread_context::switch_out() {\n    if (_attr.scheduling_group) {\n        _attr.scheduling_group->account_stop();\n    }\n    _context.switch_out();\n}\n\nbool\nthread_context::should_yield() const {\n    if (!_attr.scheduling_group) {\n        return need_preempt();\n    }\n    return need_preempt() || bool(_attr.scheduling_group->next_scheduling_point());\n}\n\nthread_local thread_context::preempted_thread_list thread_context::_preempted_threads;\nthread_local thread_context::all_thread_list thread_context::_all_threads;\n\nvoid\nthread_context::yield() {\n    if (!_attr.scheduling_group) {\n        schedule(make_task(_scheduling_group, [this] {\n            switch_in();\n        }));\n        switch_out();\n    } else {\n        auto when = _attr.scheduling_group->next_scheduling_point();\n        if (when) {\n            _preempted_threads.push_back(*this);\n            _sched_promise.emplace();\n            auto fut = _sched_promise->get_future();\n            _sched_timer.arm(*when);\n            fut.get();\n            _sched_promise = stdx::nullopt;\n        } else if (need_preempt()) {\n            later().get();\n        }\n    }\n}\n\nbool thread::try_run_one_yielded_thread() {\n    if (thread_context::_preempted_threads.empty()) {\n        return false;\n    }\n    auto&& t = thread_context::_preempted_threads.front();\n    t._sched_timer.cancel();\n    t._sched_promise->set_value();\n    thread_context::_preempted_threads.pop_front();\n    return true;\n}\n\nvoid\nthread_context::reschedule() {\n    _preempted_threads.erase(_preempted_threads.iterator_to(*this));\n    _sched_promise->set_value();\n}\n\nvoid\nthread_context::s_main(int lo, int hi) {\n    uintptr_t q = uint64_t(uint32_t(lo)) | uint64_t(hi) << 32;\n    reinterpret_cast<thread_context*>(q)->main();\n}\n\nvoid\nthread_context::main() {\n#ifdef __x86_64__\n    \/\/ There is no caller of main() in this context. We need to annotate this frame like this so that\n    \/\/ unwinders don't try to trace back past this frame.\n    \/\/ See https:\/\/github.com\/scylladb\/scylla\/issues\/1909.\n    asm(\".cfi_undefined rip\");\n#else\n    #warning \"Backtracing from seastar threads may be broken\"\n#endif\n    _context.initial_switch_in_completed();\n    if (_attr.scheduling_group) {\n        _attr.scheduling_group->account_start();\n    }\n    try {\n        _func();\n        _done.set_value();\n    } catch (...) {\n        _done.set_exception(std::current_exception());\n    }\n    if (_attr.scheduling_group) {\n        _attr.scheduling_group->account_stop();\n    }\n\n    _context.final_switch_out();\n}\n\nnamespace thread_impl {\n\nvoid yield() {\n    g_current_context->thread->yield();\n}\n\nvoid switch_in(thread_context* to) {\n    to->switch_in();\n}\n\nvoid switch_out(thread_context* from) {\n    from->switch_out();\n}\n\nvoid init() {\n    g_unthreaded_context.link = nullptr;\n    g_unthreaded_context.thread = nullptr;\n    g_current_context = &g_unthreaded_context;\n}\n\nscheduling_group\nsched_group(const thread_context* thread) {\n    return thread->_scheduling_group;\n}\n\n}\n\nvoid thread::yield() {\n    thread_impl::get()->yield();\n}\n\nbool thread::should_yield() {\n    return thread_impl::get()->should_yield();\n}\n\nthread_scheduling_group::thread_scheduling_group(std::chrono::nanoseconds period, float usage)\n        : _period(period), _quota(std::chrono::duration_cast<std::chrono::nanoseconds>(usage * period)) {\n}\n\nvoid\nthread_scheduling_group::account_start() {\n    auto now = thread_clock::now();\n    if (now >= _this_period_ends) {\n        _this_period_ends = now + _period;\n        _this_period_remain = _quota;\n    }\n    _this_run_start = now;\n}\n\nvoid\nthread_scheduling_group::account_stop() {\n    _this_period_remain -= thread_clock::now() - _this_run_start;\n}\n\nstdx::optional<thread_clock::time_point>\nthread_scheduling_group::next_scheduling_point() const {\n    auto now = thread_clock::now();\n    auto current_remain = _this_period_remain - (now - _this_run_start);\n    if (current_remain > std::chrono::nanoseconds(0)) {\n        return stdx::nullopt;\n    }\n    return _this_period_ends - current_remain;\n\n}\n\n}\n\n\/\/\/ \\endcond\n<commit_msg>thread: complete the \"core\/thread: Fix unwind information for seastar threads\" to work on PPC<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#include \"thread.hh\"\n#include \"posix.hh\"\n#include <ucontext.h>\n#include <algorithm>\n\n\/\/\/ \\cond internal\n\nnamespace seastar {\n\nthread_local jmp_buf_link g_unthreaded_context;\nthread_local jmp_buf_link* g_current_context;\n\n#ifdef ASAN_ENABLED\n\nnamespace {\n\n#ifdef HAVE_ASAN_FIBER_SUPPORT\n\/\/ ASan provides two functions as a means of informing it that user context\n\/\/ switch has happened. First __sanitizer_start_switch_fiber() needs to be\n\/\/ called with a place to store the fake stack pointer and the new stack\n\/\/ information as arguments. Then, ucontext switch may be performed after which\n\/\/ __sanitizer_finish_switch_fiber() needs to be called with a pointer to the\n\/\/ current context fake stack and a place to store stack information of the\n\/\/ previous ucontext.\n\nextern \"C\" {\nvoid __sanitizer_start_switch_fiber(void** fake_stack_save, const void* stack_bottom, size_t stack_size);\nvoid __sanitizer_finish_switch_fiber(void* fake_stack_save, const void** stack_bottom_old, size_t* stack_size_old);\n}\n#else\nstatic inline void __sanitizer_start_switch_fiber(...) { }\nstatic inline void __sanitizer_finish_switch_fiber(...) { }\n#endif\n\nthread_local jmp_buf_link* g_previous_context;\n\n}\n\nvoid jmp_buf_link::initial_switch_in(ucontext_t* initial_context, const void* stack_bottom, size_t stack_size)\n{\n    auto prev = std::exchange(g_current_context, this);\n    link = prev;\n    g_previous_context = prev;\n    __sanitizer_start_switch_fiber(&prev->fake_stack, stack_bottom, stack_size);\n    swapcontext(&prev->context, initial_context);\n    __sanitizer_finish_switch_fiber(g_current_context->fake_stack, &g_previous_context->stack_bottom,\n                                    &g_previous_context->stack_size);\n}\n\nvoid jmp_buf_link::switch_in()\n{\n    auto prev = std::exchange(g_current_context, this);\n    link = prev;\n    g_previous_context = prev;\n    __sanitizer_start_switch_fiber(&prev->fake_stack, stack_bottom, stack_size);\n    swapcontext(&prev->context, &context);\n    __sanitizer_finish_switch_fiber(g_current_context->fake_stack, &g_previous_context->stack_bottom,\n                                    &g_previous_context->stack_size);\n}\n\nvoid jmp_buf_link::switch_out()\n{\n    g_current_context = link;\n    g_previous_context = this;\n    __sanitizer_start_switch_fiber(&fake_stack, g_current_context->stack_bottom,\n                                   g_current_context->stack_size);\n    swapcontext(&context, &g_current_context->context);\n    __sanitizer_finish_switch_fiber(g_current_context->fake_stack, &g_previous_context->stack_bottom,\n                                    &g_previous_context->stack_size);\n}\n\nvoid jmp_buf_link::initial_switch_in_completed()\n{\n    \/\/ This is a new thread and it doesn't have the fake stack yet. ASan will\n    \/\/ create it lazily, for now just pass nullptr.\n    __sanitizer_finish_switch_fiber(nullptr, &g_previous_context->stack_bottom, &g_previous_context->stack_size);\n}\n\nvoid jmp_buf_link::final_switch_out()\n{\n    g_current_context = link;\n    g_previous_context = this;\n    \/\/ Since the thread is about to die we pass nullptr as fake_stack_save argument\n    \/\/ so that ASan knows it can destroy the fake stack if it exists.\n    __sanitizer_start_switch_fiber(nullptr, g_current_context->stack_bottom, g_current_context->stack_size);\n    setcontext(&g_current_context->context);\n}\n\n#else\n\ninline void jmp_buf_link::initial_switch_in(ucontext_t* initial_context, const void*, size_t)\n{\n    auto prev = std::exchange(g_current_context, this);\n    link = prev;\n    if (setjmp(prev->jmpbuf) == 0) {\n        setcontext(initial_context);\n    }\n}\n\ninline void jmp_buf_link::switch_in()\n{\n    auto prev = std::exchange(g_current_context, this);\n    link = prev;\n    if (setjmp(prev->jmpbuf) == 0) {\n        longjmp(jmpbuf, 1);\n    }\n}\n\ninline void jmp_buf_link::switch_out()\n{\n    g_current_context = link;\n    if (setjmp(jmpbuf) == 0) {\n        longjmp(g_current_context->jmpbuf, 1);\n    }\n}\n\ninline void jmp_buf_link::initial_switch_in_completed()\n{\n}\n\ninline void jmp_buf_link::final_switch_out()\n{\n    g_current_context = link;\n    longjmp(g_current_context->jmpbuf, 1);\n}\n\n#endif\n\nthread_context::thread_context(thread_attributes attr, std::function<void ()> func)\n        : _attr(std::move(attr))\n        , _func(std::move(func))\n        , _scheduling_group(_attr.sched_group.value_or(current_scheduling_group())) {\n    setup();\n    _all_threads.push_front(*this);\n}\n\nthread_context::~thread_context() {\n#ifdef SEASTAR_THREAD_STACK_GUARDS\n    auto mp_result = mprotect(_stack.get(), getpagesize(), PROT_READ | PROT_WRITE);\n    assert(mp_result == 0);\n#endif\n    _all_threads.erase(_all_threads.iterator_to(*this));\n}\n\nthread_context::stack_holder\nthread_context::make_stack() {\n#ifdef SEASTAR_THREAD_STACK_GUARDS\n    auto stack = stack_holder(new (with_alignment(getpagesize())) char[_stack_size]);\n#else\n    auto stack = stack_holder(new char[_stack_size]);\n#endif\n#ifdef ASAN_ENABLED\n    \/\/ Avoid ASAN false positive due to garbage on stack\n    std::fill_n(stack.get(), _stack_size, 0);\n#endif\n    return stack;\n}\n\nvoid thread_context::stack_deleter::operator()(char* ptr) const noexcept {\n#ifdef SEASTAR_THREAD_STACK_GUARDS\n    operator delete[] (ptr, with_alignment(getpagesize()));\n#else\n    delete[] ptr;\n#endif\n}\n\nvoid\nthread_context::setup() {\n    \/\/ use setcontext() for the initial jump, as it allows us\n    \/\/ to set up a stack, but continue with longjmp() as it's\n    \/\/ much faster.\n    ucontext_t initial_context;\n    auto q = uint64_t(reinterpret_cast<uintptr_t>(this));\n    auto main = reinterpret_cast<void (*)()>(&thread_context::s_main);\n    auto r = getcontext(&initial_context);\n    throw_system_error_on(r == -1);\n#ifdef SEASTAR_THREAD_STACK_GUARDS\n    size_t page_size = getpagesize();\n    assert(align_up(_stack.get(), page_size) == _stack.get());\n    assert(_stack_size > page_size * 4 && \"Stack guard would take too much portion of the stack\");\n    auto mp_status = mprotect(_stack.get(), page_size, PROT_READ);\n    throw_system_error_on(mp_status != 0, \"mprotect\");\n#endif\n    initial_context.uc_stack.ss_sp = _stack.get();\n    initial_context.uc_stack.ss_size = _stack_size;\n    initial_context.uc_link = nullptr;\n    makecontext(&initial_context, main, 2, int(q), int(q >> 32));\n    _context.thread = this;\n    _context.initial_switch_in(&initial_context, _stack.get(), _stack_size);\n}\n\nvoid\nthread_context::switch_in() {\n    if (_attr.scheduling_group) {\n        _attr.scheduling_group->account_start();\n        _context.yield_at = _attr.scheduling_group->_this_run_start + _attr.scheduling_group->_this_period_remain;\n    } else {\n        _context.yield_at = {};\n    }\n    _context.switch_in();\n}\n\nvoid\nthread_context::switch_out() {\n    if (_attr.scheduling_group) {\n        _attr.scheduling_group->account_stop();\n    }\n    _context.switch_out();\n}\n\nbool\nthread_context::should_yield() const {\n    if (!_attr.scheduling_group) {\n        return need_preempt();\n    }\n    return need_preempt() || bool(_attr.scheduling_group->next_scheduling_point());\n}\n\nthread_local thread_context::preempted_thread_list thread_context::_preempted_threads;\nthread_local thread_context::all_thread_list thread_context::_all_threads;\n\nvoid\nthread_context::yield() {\n    if (!_attr.scheduling_group) {\n        schedule(make_task(_scheduling_group, [this] {\n            switch_in();\n        }));\n        switch_out();\n    } else {\n        auto when = _attr.scheduling_group->next_scheduling_point();\n        if (when) {\n            _preempted_threads.push_back(*this);\n            _sched_promise.emplace();\n            auto fut = _sched_promise->get_future();\n            _sched_timer.arm(*when);\n            fut.get();\n            _sched_promise = stdx::nullopt;\n        } else if (need_preempt()) {\n            later().get();\n        }\n    }\n}\n\nbool thread::try_run_one_yielded_thread() {\n    if (thread_context::_preempted_threads.empty()) {\n        return false;\n    }\n    auto&& t = thread_context::_preempted_threads.front();\n    t._sched_timer.cancel();\n    t._sched_promise->set_value();\n    thread_context::_preempted_threads.pop_front();\n    return true;\n}\n\nvoid\nthread_context::reschedule() {\n    _preempted_threads.erase(_preempted_threads.iterator_to(*this));\n    _sched_promise->set_value();\n}\n\nvoid\nthread_context::s_main(int lo, int hi) {\n    uintptr_t q = uint64_t(uint32_t(lo)) | uint64_t(hi) << 32;\n    reinterpret_cast<thread_context*>(q)->main();\n}\n\nvoid\nthread_context::main() {\n#ifdef __x86_64__\n    \/\/ There is no caller of main() in this context. We need to annotate this frame like this so that\n    \/\/ unwinders don't try to trace back past this frame.\n    \/\/ See https:\/\/github.com\/scylladb\/scylla\/issues\/1909.\n    asm(\".cfi_undefined rip\");\n#elif defined(__PPC__)\n    asm(\".cfi_undefined lr\");\n#else\n    #warning \"Backtracing from seastar threads may be broken\"\n#endif\n    _context.initial_switch_in_completed();\n    if (_attr.scheduling_group) {\n        _attr.scheduling_group->account_start();\n    }\n    try {\n        _func();\n        _done.set_value();\n    } catch (...) {\n        _done.set_exception(std::current_exception());\n    }\n    if (_attr.scheduling_group) {\n        _attr.scheduling_group->account_stop();\n    }\n\n    _context.final_switch_out();\n}\n\nnamespace thread_impl {\n\nvoid yield() {\n    g_current_context->thread->yield();\n}\n\nvoid switch_in(thread_context* to) {\n    to->switch_in();\n}\n\nvoid switch_out(thread_context* from) {\n    from->switch_out();\n}\n\nvoid init() {\n    g_unthreaded_context.link = nullptr;\n    g_unthreaded_context.thread = nullptr;\n    g_current_context = &g_unthreaded_context;\n}\n\nscheduling_group\nsched_group(const thread_context* thread) {\n    return thread->_scheduling_group;\n}\n\n}\n\nvoid thread::yield() {\n    thread_impl::get()->yield();\n}\n\nbool thread::should_yield() {\n    return thread_impl::get()->should_yield();\n}\n\nthread_scheduling_group::thread_scheduling_group(std::chrono::nanoseconds period, float usage)\n        : _period(period), _quota(std::chrono::duration_cast<std::chrono::nanoseconds>(usage * period)) {\n}\n\nvoid\nthread_scheduling_group::account_start() {\n    auto now = thread_clock::now();\n    if (now >= _this_period_ends) {\n        _this_period_ends = now + _period;\n        _this_period_remain = _quota;\n    }\n    _this_run_start = now;\n}\n\nvoid\nthread_scheduling_group::account_stop() {\n    _this_period_remain -= thread_clock::now() - _this_run_start;\n}\n\nstdx::optional<thread_clock::time_point>\nthread_scheduling_group::next_scheduling_point() const {\n    auto now = thread_clock::now();\n    auto current_remain = _this_period_remain - (now - _this_run_start);\n    if (current_remain > std::chrono::nanoseconds(0)) {\n        return stdx::nullopt;\n    }\n    return _this_period_ends - current_remain;\n\n}\n\n}\n\n\/\/\/ \\endcond\n<|endoftext|>"}
{"text":"<commit_before>#include <tclap\/CmdLine.h>\n#include <iostream>\n#include <cstdint>\n#include \"balance.h\"\n\nint main(int argc, const char **argv) {\n    TCLAP::CmdLine cmd(\"Broker balance module\", ' ', \"1.0.0\", true);\n    TCLAP::ValueArg<std::string> common_broker_url(\"u\", \"url\", \"Broker url\", false, \"tcp:\/\/127.0.0.10000\",\n                                                   \"zmq bind\");\n    TCLAP::ValueArg<std::string> proxy_backend(\"b\", \"backend\", \"Backend binding for proxy\", false,\n                                               \"tcp:\/\/127.0.0.1:10001\",\n                                               \"zmq bind\");\n    TCLAP::ValueArg<std::string> common_name(\"n\", \"name\", \"Balancing service name\", true, \"unknown\", \"name\");\n    TCLAP::SwitchArg common_is_verbose(\"v\", \"verbose\", \"Show much more output\", false);\n    cmd.add(common_broker_url);\n    cmd.add(common_name);\n    cmd.add(common_is_verbose);\n    cmd.add(proxy_backend);\n    cmd.parse(argc, argv);\n    start_balance_proxy(common_broker_url.getValue(), proxy_backend.getValue(), common_name.getValue());\n}<commit_msg>Typo fix<commit_after>#include <tclap\/CmdLine.h>\n#include <iostream>\n#include <cstdint>\n#include \"balance.h\"\n\nint main(int argc, const char **argv) {\n    TCLAP::CmdLine cmd(\"Broker balance module\", ' ', \"1.0.0\", true);\n    TCLAP::ValueArg<std::string> common_broker_url(\"u\", \"url\", \"Broker url\", false, \"tcp:\/\/127.0.0.1:10000\",\n                                                   \"zmq bind\");\n    TCLAP::ValueArg<std::string> proxy_backend(\"b\", \"backend\", \"Backend binding for proxy\", false,\n                                               \"tcp:\/\/127.0.0.1:10001\",\n                                               \"zmq bind\");\n    TCLAP::ValueArg<std::string> common_name(\"n\", \"name\", \"Balancing service name\", true, \"unknown\", \"name\");\n    TCLAP::SwitchArg common_is_verbose(\"v\", \"verbose\", \"Show much more output\", false);\n    cmd.add(common_broker_url);\n    cmd.add(common_name);\n    cmd.add(common_is_verbose);\n    cmd.add(proxy_backend);\n    cmd.parse(argc, argv);\n    start_balance_proxy(common_broker_url.getValue(), proxy_backend.getValue(), common_name.getValue());\n}<|endoftext|>"}
{"text":"<commit_before>\/**********************************************************************\n* File:        FindDialog.cpp\n* Description: Find Dialog\n* Author:      Zdenko Podobny\n* Created:     2011-09-23\n*\n* (C) Copyright 2011, Zdenko Podobny\n**\n** Licensed under the Apache License, Version 2.0 (the \"License\");\n** you may not use this file except in compliance with the License.\n** You may obtain a copy of the License at\n**\n**    http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n**\n** Unless required by applicable law or agreed to in writing, software\n** distributed under the License is distributed on an \"AS IS\" BASIS,\n** WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 \"dialogs\/FindDialog.h\"\n#include \"include\/Settings.h\"\n\nFindDialog::FindDialog(QWidget* parent, QString title)\n  : QDialog(parent) {\n  setupUi(this);\n\n  if (!title.isEmpty())\n      setWindowTitle(tr(\"Find in %1:\").arg(title));\n  findNextButton = new QPushButton(tr(\"&Next\"));\n  findNextButton->setDefault(true);\n  findNextButton->setEnabled(false);\n  findPrevButton = new QPushButton(tr(\"&Previous\"));\n  findPrevButton->setEnabled(false);\n  closeButton = new QPushButton(tr(\"&Close\"));\n\n  buttonBox->addButton(findNextButton,\n                       QDialogButtonBox::ActionRole);\n  buttonBox->addButton(findPrevButton,\n                       QDialogButtonBox::ActionRole);\n  buttonBox->addButton(closeButton,\n                       QDialogButtonBox::RejectRole);\n\n  QRegExp regExp(\".\");\n  lineEdit->setValidator(new QRegExpValidator(regExp, this));\n\n  connect(findNextButton, SIGNAL(clicked()), this, SLOT(findNext()));\n  connect(findPrevButton, SIGNAL(clicked()), this, SLOT(findPrev()));\n  connect(closeButton, SIGNAL(clicked()), this, SLOT(close()));\n  connect(checkBox_Mc, SIGNAL(toggled(bool)), this, SLOT(changed_Mc(bool)));\n\n  getSettings();\n}\n\nvoid FindDialog::on_lineEdit_textChanged() {\n  findNextButton->setEnabled(lineEdit->hasAcceptableInput());\n  findPrevButton->setEnabled(lineEdit->hasAcceptableInput());\n}\n\nvoid FindDialog::findNext() {\n  QString symbol = lineEdit->text();\n  Qt::CaseSensitivity mc =\n    checkBox_Mc->isChecked() ? Qt::CaseSensitive\n    : Qt::CaseInsensitive;\n  emit findNext(symbol, mc);\n}\n\nvoid FindDialog::findPrev() {\n  QString symbol = lineEdit->text();\n  Qt::CaseSensitivity mc =\n    checkBox_Mc->isChecked() ? Qt::CaseSensitive\n    : Qt::CaseInsensitive;\n  emit findPrev(symbol, mc);\n}\n\nvoid FindDialog::changed_Mc(bool status) {\n  QSettings settings(QSettings::IniFormat, QSettings::UserScope,\n                     SETTING_ORGANIZATION, SETTING_APPLICATION);\n  settings.setValue(\"Find\/MatchCase\", status);\n}\n\nvoid FindDialog::closeEvent(QCloseEvent* event) {\n    writeGeometry();\n    event->accept();\n}\n\nvoid FindDialog::getSettings() {\n  QSettings settings(QSettings::IniFormat, QSettings::UserScope,\n                     SETTING_ORGANIZATION, SETTING_APPLICATION);\n  if (settings.contains(\"Find\/MatchCase\"))\n    checkBox_Mc->setChecked(settings.value(\"Find\/MatchCase\").toBool());\n\n  QPoint pos = settings.value(\"Find\/Pos\", QPoint(200, 200)).toPoint();\n  QSize size = settings.value(\"Find\/Size\", QSize(300, 100)).toSize();\n  resize(size);\n  move(pos);\n}\n\nvoid FindDialog::writeGeometry() {\n  QSettings settings(QSettings::IniFormat, QSettings::UserScope,\n                     SETTING_ORGANIZATION, SETTING_APPLICATION);\n  settings.setValue(\"Find\/Pos\", pos());\n  settings.setValue(\"Find\/Size\", size());\n}\n<commit_msg>regexp to test not empty string in find dialog<commit_after>\/**********************************************************************\n* File:        FindDialog.cpp\n* Description: Find Dialog\n* Author:      Zdenko Podobny\n* Created:     2011-09-23\n*\n* (C) Copyright 2011, Zdenko Podobny\n**\n** Licensed under the Apache License, Version 2.0 (the \"License\");\n** you may not use this file except in compliance with the License.\n** You may obtain a copy of the License at\n**\n**    http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n**\n** Unless required by applicable law or agreed to in writing, software\n** distributed under the License is distributed on an \"AS IS\" BASIS,\n** WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 \"dialogs\/FindDialog.h\"\n#include \"include\/Settings.h\"\n\nFindDialog::FindDialog(QWidget* parent, QString title)\n  : QDialog(parent) {\n  setupUi(this);\n\n  if (!title.isEmpty())\n      setWindowTitle(tr(\"Find in %1:\").arg(title));\n  findNextButton = new QPushButton(tr(\"&Next\"));\n  findNextButton->setDefault(true);\n  findNextButton->setEnabled(false);\n  findPrevButton = new QPushButton(tr(\"&Previous\"));\n  findPrevButton->setEnabled(false);\n  closeButton = new QPushButton(tr(\"&Close\"));\n\n  buttonBox->addButton(findNextButton,\n                       QDialogButtonBox::ActionRole);\n  buttonBox->addButton(findPrevButton,\n                       QDialogButtonBox::ActionRole);\n  buttonBox->addButton(closeButton,\n                       QDialogButtonBox::RejectRole);\n\n  QRegExp regExp(\".+\");  \/\/ no empty string test\n  lineEdit->setValidator(new QRegExpValidator(regExp, this));\n\n  connect(findNextButton, SIGNAL(clicked()), this, SLOT(findNext()));\n  connect(findPrevButton, SIGNAL(clicked()), this, SLOT(findPrev()));\n  connect(closeButton, SIGNAL(clicked()), this, SLOT(close()));\n  connect(checkBox_Mc, SIGNAL(toggled(bool)), this, SLOT(changed_Mc(bool)));\n\n  getSettings();\n}\n\nvoid FindDialog::on_lineEdit_textChanged() {\n  findNextButton->setEnabled(lineEdit->hasAcceptableInput());\n  findPrevButton->setEnabled(lineEdit->hasAcceptableInput());\n}\n\nvoid FindDialog::findNext() {\n  QString symbol = lineEdit->text();\n  Qt::CaseSensitivity mc =\n    checkBox_Mc->isChecked() ? Qt::CaseSensitive\n    : Qt::CaseInsensitive;\n  emit findNext(symbol, mc);\n}\n\nvoid FindDialog::findPrev() {\n  QString symbol = lineEdit->text();\n  Qt::CaseSensitivity mc =\n    checkBox_Mc->isChecked() ? Qt::CaseSensitive\n    : Qt::CaseInsensitive;\n  emit findPrev(symbol, mc);\n}\n\nvoid FindDialog::changed_Mc(bool status) {\n  QSettings settings(QSettings::IniFormat, QSettings::UserScope,\n                     SETTING_ORGANIZATION, SETTING_APPLICATION);\n  settings.setValue(\"Find\/MatchCase\", status);\n}\n\nvoid FindDialog::closeEvent(QCloseEvent* event) {\n    writeGeometry();\n    event->accept();\n}\n\nvoid FindDialog::getSettings() {\n  QSettings settings(QSettings::IniFormat, QSettings::UserScope,\n                     SETTING_ORGANIZATION, SETTING_APPLICATION);\n  if (settings.contains(\"Find\/MatchCase\"))\n    checkBox_Mc->setChecked(settings.value(\"Find\/MatchCase\").toBool());\n\n  QPoint pos = settings.value(\"Find\/Pos\", QPoint(200, 200)).toPoint();\n  QSize size = settings.value(\"Find\/Size\", QSize(300, 100)).toSize();\n  resize(size);\n  move(pos);\n}\n\nvoid FindDialog::writeGeometry() {\n  QSettings settings(QSettings::IniFormat, QSettings::UserScope,\n                     SETTING_ORGANIZATION, SETTING_APPLICATION);\n  settings.setValue(\"Find\/Pos\", pos());\n  settings.setValue(\"Find\/Size\", size());\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 ExtVM.cpp\n * @author Gav Wood <i@gavwood.com>\n * @date 2014\n *\/\n\n#include \"ExtVM.h\"\n#include <exception>\n#include <boost\/thread.hpp>\n#include \"Executive.h\"\n\nusing namespace dev;\nusing namespace dev::eth;\n\nnamespace\n{\n\nstatic unsigned const c_depthLimit = 1024;\n\n\/\/\/ Upper bound of stack space needed by single CALL\/CREATE execution. Set experimentally.\nstatic size_t const c_singleExecutionStackSize =\n#ifdef NDEBUG\n\t12 * 1024;\n#else\n\t64 * 1024;\n#endif\n\n\/\/\/ Standard OSX thread stack limit. Should be reasonable for other platforms too.\nstatic size_t const c_defaultStackSize = 512 * 1024;\n\n\/\/\/ On what depth execution should be offloaded to additional separated stack space.\nstatic unsigned const c_offloadPoint = c_defaultStackSize \/ c_singleExecutionStackSize;\n\nvoid goOnOffloadedStack(Executive& _e, OnOpFunc const& _onOp)\n{\n\t\/\/ Set new stack size enouth to handle the rest of the calls up to the limit.\n\tboost::thread::attributes attrs;\n\tattrs.set_stack_size((c_depthLimit - c_offloadPoint) * c_singleExecutionStackSize);\n\n\t\/\/ Create new thread with big stack and join immediately.\n\t\/\/ TODO: It is possible to switch the implementation to Boost.Context or similar when the API is stable.\n\tstd::exception_ptr exception;\n\tboost::thread{attrs, [&]{\n\t\ttry\n\t\t{\n\t\t\t_e.go(_onOp);\n\t\t}\n\t\tcatch (...)\n\t\t{\n\t\t\texception = std::current_exception(); \/\/ Catch all exceptions to be rethrown in parent thread.\n\t\t}\n\t}}.join();\n\tif (exception)\n\t\tstd::rethrow_exception(exception);\n}\n\nvoid go(unsigned _depth, Executive& _e, OnOpFunc const& _onOp)\n{\n\t\/\/ If in the offloading point we need to switch to additional separated stack space.\n\t\/\/ Current stack is too small to handle more CALL\/CREATE executions.\n\t\/\/ It needs to be done only once as newly allocated stack space it enough to handle\n\t\/\/ the rest of the calls up to the depth limit (c_depthLimit).\n#if __GNUC__\n\tif (_depth == c_offloadPoint)\n\t\tgoOnOffloadedStack(_e, _onOp);\n\telse\n#endif\n\t\t_e.go(_onOp);\n}\n}\n\nbool ExtVM::call(CallParameters& _p)\n{\n\tExecutive e(m_s, lastHashes, depth + 1);\n\tif (!e.call(_p, gasPrice, origin))\n\t{\n\t\tgo(depth, e, _p.onOp);\n\t\te.accrueSubState(sub);\n\t}\n\t_p.gas = e.gas();\n\n\treturn !e.excepted();\n}\n\nh160 ExtVM::create(u256 _endowment, u256& io_gas, bytesConstRef _code, OnOpFunc const& _onOp)\n{\n\t\/\/ Increment associated nonce for sender.\n\tm_s.noteSending(myAddress);\n\n\tExecutive e(m_s, lastHashes, depth + 1);\n\tif (!e.create(myAddress, _endowment, gasPrice, io_gas, _code, origin))\n\t{\n\t\tgo(depth, e, _onOp);\n\t\te.accrueSubState(sub);\n\t}\n\tio_gas = e.gas();\n\treturn e.newAddress();\n}\n<commit_msg>Adjust stack offloading params. Enable only for clang compiler.<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 ExtVM.cpp\n * @author Gav Wood <i@gavwood.com>\n * @date 2014\n *\/\n\n#include \"ExtVM.h\"\n#include <exception>\n#include <boost\/thread.hpp>\n#include \"Executive.h\"\n\nusing namespace dev;\nusing namespace dev::eth;\n\nnamespace\n{\n\nstatic unsigned const c_depthLimit = 1024;\n\n\/\/\/ Upper bound of stack space needed by single CALL\/CREATE execution. Set experimentally.\nstatic size_t const c_singleExecutionStackSize =\n#ifdef NDEBUG\n\t12 * 1024;\n#else\n\t33 * 1024;\n#endif\n\n\/\/\/ Standard OSX thread stack limit. Should be reasonable for other platforms too.\nstatic size_t const c_defaultStackSize = 512 * 1024;\n\n\/\/\/ Stack overhead prior to allocation.\nstatic size_t const c_entryOverhead = 128 * 1024;\n\n\/\/\/ On what depth execution should be offloaded to additional separated stack space.\nstatic unsigned const c_offloadPoint = (c_defaultStackSize - c_entryOverhead) \/ c_singleExecutionStackSize;\n\nvoid goOnOffloadedStack(Executive& _e, OnOpFunc const& _onOp)\n{\n\t\/\/ Set new stack size enouth to handle the rest of the calls up to the limit.\n\tboost::thread::attributes attrs;\n\tattrs.set_stack_size((c_depthLimit - c_offloadPoint) * c_singleExecutionStackSize);\n\n\t\/\/ Create new thread with big stack and join immediately.\n\t\/\/ TODO: It is possible to switch the implementation to Boost.Context or similar when the API is stable.\n\tstd::exception_ptr exception;\n\tboost::thread{attrs, [&]{\n\t\ttry\n\t\t{\n\t\t\t_e.go(_onOp);\n\t\t}\n\t\tcatch (...)\n\t\t{\n\t\t\texception = std::current_exception(); \/\/ Catch all exceptions to be rethrown in parent thread.\n\t\t}\n\t}}.join();\n\tif (exception)\n\t\tstd::rethrow_exception(exception);\n}\n\nvoid go(unsigned _depth, Executive& _e, OnOpFunc const& _onOp)\n{\n\t\/\/ If in the offloading point we need to switch to additional separated stack space.\n\t\/\/ Current stack is too small to handle more CALL\/CREATE executions.\n\t\/\/ It needs to be done only once as newly allocated stack space it enough to handle\n\t\/\/ the rest of the calls up to the depth limit (c_depthLimit).\n#if __clang__ \/\/ Enabled for clang only as the problem affects OSX\n\tif (_depth == c_offloadPoint)\n\t\tgoOnOffloadedStack(_e, _onOp);\n\telse\n#endif\n\t\t_e.go(_onOp);\n}\n}\n\nbool ExtVM::call(CallParameters& _p)\n{\n\tExecutive e(m_s, lastHashes, depth + 1);\n\tif (!e.call(_p, gasPrice, origin))\n\t{\n\t\tgo(depth, e, _p.onOp);\n\t\te.accrueSubState(sub);\n\t}\n\t_p.gas = e.gas();\n\n\treturn !e.excepted();\n}\n\nh160 ExtVM::create(u256 _endowment, u256& io_gas, bytesConstRef _code, OnOpFunc const& _onOp)\n{\n\t\/\/ Increment associated nonce for sender.\n\tm_s.noteSending(myAddress);\n\n\tExecutive e(m_s, lastHashes, depth + 1);\n\tif (!e.create(myAddress, _endowment, gasPrice, io_gas, _code, origin))\n\t{\n\t\tgo(depth, e, _onOp);\n\t\te.accrueSubState(sub);\n\t}\n\tio_gas = e.gas();\n\treturn e.newAddress();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <QGuiApplication>\n#include <QQmlProperty>\n#include <QKeyEvent>\n#include <QString>\n#include <QTimer>\n#include <QtQuick\/QQuickItem>\n#include <QtQuick\/QQuickView>\n\n#include <cassert>\n#include <cstdio>\n#include <vector>\n\n#include \"interop.h\"\n#include \"screens.hpp\"\n\nclass ConsoleManager: public QObject\n{\n    Q_OBJECT\n\n    QObject *dbg_console;\n    Backend *backend;\n    const FrontendCallbacks *callbacks;\n\n    QTimer *text_poll_timer;\n    std::vector<char> text_buf;\npublic slots:\n    void fillLog() {\n        LogBufferView view = callbacks->buffer({ &text_buf[0], text_buf.size() });\n        QString txt = QString::fromUtf8(view.buf_ptr, view.buf_size);\n        QObject *dbg_console_text = qvariant_cast<QObject*>(QQmlProperty::read(dbg_console, \"text\"));\n        dbg_console_text->setProperty(\"text\", txt);\n    }\n\n    void runCommand(const QString &msg) {\n        QByteArray utf8 = msg.toUtf8();\n        callbacks->run_command(backend, utf8.constData(), utf8.size());\n    }\n\n    void useTraceLogs(bool trace) {\n        callbacks->use_trace_logs(backend, trace);\n    }\n\npublic:\n    ConsoleManager(QObject *dbg_console, Backend *backend, const FrontendCallbacks *callbacks):\n            dbg_console(dbg_console),\n            backend(backend),\n            callbacks(callbacks),\n            text_poll_timer(new QTimer(this)),\n            text_buf(callbacks->buffer_size())\n    {\n        QObject::connect(text_poll_timer, &QTimer::timeout, this, &ConsoleManager::fillLog);\n        text_poll_timer->start(100);\n    }\n};\n\nclass ScreenManager: public QObject\n{\n    Q_OBJECT\n\n    QObject *screen_view;\n    Backend *backend;\n    const FrontendCallbacks *callbacks;\npublic slots:\n    void togglePaused() {\n        bool val = !callbacks->is_running(backend);\n        callbacks->set_running(backend, val);\n    }\n\n    void reloadGame() {\n        callbacks->reload_game(backend);\n    }\n\nprotected:\n    bool handleKey(QKeyEvent* event, bool pressed) {\n        Button button;\n        switch(event->key()) {\n            case Qt::Key::Key_A: button = BUTTON_A; break;\n            case Qt::Key::Key_S: button = BUTTON_B; break;\n            case Qt::Key::Key_Z: button = BUTTON_X; break;\n            case Qt::Key::Key_X: button = BUTTON_Y; break;\n            case Qt::Key::Key_Q: button = BUTTON_L; break;\n            case Qt::Key::Key_W: button = BUTTON_R; break;\n\n            case Qt::Key::Key_Up: button = BUTTON_UP; break;\n            case Qt::Key::Key_Down: button = BUTTON_DOWN; break;\n            case Qt::Key::Key_Left: button = BUTTON_LEFT; break;\n            case Qt::Key::Key_Right: button = BUTTON_RIGHT; break;\n\n            case Qt::Key::Key_M: button = BUTTON_START; break;\n            case Qt::Key::Key_N: button = BUTTON_SELECT; break;\n            default: return false;\n        }\n        event->accept();\n        callbacks->mod_button(backend, button, pressed);\n        return true;\n    }\n\n    bool eventFilter(QObject *obj, QEvent *event)\n    {\n        if (event->type() == QEvent::KeyPress) {\n            return handleKey(static_cast<QKeyEvent*>(event), true);\n        } else if (event->type() == QEvent::KeyRelease) {\n            return handleKey(static_cast<QKeyEvent*>(event), false);\n        } else {\n            \/\/ standard event processing\n            return QObject::eventFilter(obj, event);\n        }\n    }\npublic:\n    ScreenManager(QObject *screen_view, Backend *backend, const FrontendCallbacks *callbacks):\n            screen_view(screen_view), backend(backend), callbacks(callbacks) { }\n};\n\n\nextern \"C\" int llama_open_gui(int argc, char **argv, Backend *backend, const FrontendCallbacks *callbacks) {\n    QGuiApplication app(argc, argv);\n\n    qmlRegisterType<TopScreen>(\"Screens\", 1, 0, \"TopScreen\");\n    qmlRegisterType<BotScreen>(\"Screens\", 1, 0, \"BotScreen\");\n\n    QQuickView view(QUrl(\"qrc:\/main.qml\"));\n    view.setResizeMode(QQuickView::SizeRootObjectToView);\n    QObject *item = view.rootObject();\n\n    assert(item != nullptr);\n\n    QObject *dbg_console = qvariant_cast<QObject*>(QQmlProperty::read(item, \"dbgConsole\"));\n    QObject *scrn_view = qvariant_cast<QObject*>(QQmlProperty::read(item, \"scrnView\"));\n\n    ScreenManager scrnmgr(scrn_view, backend, callbacks);\n    QObject::connect(scrn_view, SIGNAL(pauseToggled()), &scrnmgr, SLOT(togglePaused()));\n    QObject::connect(scrn_view, SIGNAL(reloaded()), &scrnmgr, SLOT(reloadGame()));\n    scrn_view->installEventFilter(&scrnmgr);\n\n    initScreenRepainter(scrn_view, backend, callbacks);\n\n    ConsoleManager consmgr(dbg_console, backend, callbacks);\n    QObject::connect(dbg_console, SIGNAL(commandRun(QString)),\n                     &consmgr, SLOT(runCommand(QString)));\n    QObject::connect(dbg_console, SIGNAL(traceToggled(bool)),\n                     &consmgr, SLOT(useTraceLogs(bool)));\n\n    view.show();\n    int result = app.exec();\n    return result;\n}\n\n#include \"main.moc\"\n<commit_msg>Disable autorepeat for HID input<commit_after>#include <QGuiApplication>\n#include <QQmlProperty>\n#include <QKeyEvent>\n#include <QString>\n#include <QTimer>\n#include <QtQuick\/QQuickItem>\n#include <QtQuick\/QQuickView>\n\n#include <cassert>\n#include <cstdio>\n#include <vector>\n\n#include \"interop.h\"\n#include \"screens.hpp\"\n\nclass ConsoleManager: public QObject\n{\n    Q_OBJECT\n\n    QObject *dbg_console;\n    Backend *backend;\n    const FrontendCallbacks *callbacks;\n\n    QTimer *text_poll_timer;\n    std::vector<char> text_buf;\npublic slots:\n    void fillLog() {\n        LogBufferView view = callbacks->buffer({ &text_buf[0], text_buf.size() });\n        QString txt = QString::fromUtf8(view.buf_ptr, view.buf_size);\n        QObject *dbg_console_text = qvariant_cast<QObject*>(QQmlProperty::read(dbg_console, \"text\"));\n        dbg_console_text->setProperty(\"text\", txt);\n    }\n\n    void runCommand(const QString &msg) {\n        QByteArray utf8 = msg.toUtf8();\n        callbacks->run_command(backend, utf8.constData(), utf8.size());\n    }\n\n    void useTraceLogs(bool trace) {\n        callbacks->use_trace_logs(backend, trace);\n    }\n\npublic:\n    ConsoleManager(QObject *dbg_console, Backend *backend, const FrontendCallbacks *callbacks):\n            dbg_console(dbg_console),\n            backend(backend),\n            callbacks(callbacks),\n            text_poll_timer(new QTimer(this)),\n            text_buf(callbacks->buffer_size())\n    {\n        QObject::connect(text_poll_timer, &QTimer::timeout, this, &ConsoleManager::fillLog);\n        text_poll_timer->start(100);\n    }\n};\n\nclass ScreenManager: public QObject\n{\n    Q_OBJECT\n\n    QObject *screen_view;\n    Backend *backend;\n    const FrontendCallbacks *callbacks;\npublic slots:\n    void togglePaused() {\n        bool val = !callbacks->is_running(backend);\n        callbacks->set_running(backend, val);\n    }\n\n    void reloadGame() {\n        callbacks->reload_game(backend);\n    }\n\nprotected:\n    bool handleKey(QKeyEvent* event, bool pressed) {\n        if (event->isAutoRepeat()) return false;\n\n        Button button;\n        switch(event->key()) {\n            case Qt::Key::Key_A: button = BUTTON_A; break;\n            case Qt::Key::Key_S: button = BUTTON_B; break;\n            case Qt::Key::Key_Z: button = BUTTON_X; break;\n            case Qt::Key::Key_X: button = BUTTON_Y; break;\n            case Qt::Key::Key_Q: button = BUTTON_L; break;\n            case Qt::Key::Key_W: button = BUTTON_R; break;\n\n            case Qt::Key::Key_Up: button = BUTTON_UP; break;\n            case Qt::Key::Key_Down: button = BUTTON_DOWN; break;\n            case Qt::Key::Key_Left: button = BUTTON_LEFT; break;\n            case Qt::Key::Key_Right: button = BUTTON_RIGHT; break;\n\n            case Qt::Key::Key_M: button = BUTTON_START; break;\n            case Qt::Key::Key_N: button = BUTTON_SELECT; break;\n            default: return false;\n        }\n        event->accept();\n        callbacks->mod_button(backend, button, pressed);\n        return true;\n    }\n\n    bool eventFilter(QObject *obj, QEvent *event)\n    {\n        if (event->type() == QEvent::KeyPress) {\n            return handleKey(static_cast<QKeyEvent*>(event), true);\n        } else if (event->type() == QEvent::KeyRelease) {\n            return handleKey(static_cast<QKeyEvent*>(event), false);\n        } else {\n            \/\/ standard event processing\n            return QObject::eventFilter(obj, event);\n        }\n    }\npublic:\n    ScreenManager(QObject *screen_view, Backend *backend, const FrontendCallbacks *callbacks):\n            screen_view(screen_view), backend(backend), callbacks(callbacks) { }\n};\n\n\nextern \"C\" int llama_open_gui(int argc, char **argv, Backend *backend, const FrontendCallbacks *callbacks) {\n    QGuiApplication app(argc, argv);\n\n    qmlRegisterType<TopScreen>(\"Screens\", 1, 0, \"TopScreen\");\n    qmlRegisterType<BotScreen>(\"Screens\", 1, 0, \"BotScreen\");\n\n    QQuickView view(QUrl(\"qrc:\/main.qml\"));\n    view.setResizeMode(QQuickView::SizeRootObjectToView);\n    QObject *item = view.rootObject();\n\n    assert(item != nullptr);\n\n    QObject *dbg_console = qvariant_cast<QObject*>(QQmlProperty::read(item, \"dbgConsole\"));\n    QObject *scrn_view = qvariant_cast<QObject*>(QQmlProperty::read(item, \"scrnView\"));\n\n    ScreenManager scrnmgr(scrn_view, backend, callbacks);\n    QObject::connect(scrn_view, SIGNAL(pauseToggled()), &scrnmgr, SLOT(togglePaused()));\n    QObject::connect(scrn_view, SIGNAL(reloaded()), &scrnmgr, SLOT(reloadGame()));\n    scrn_view->installEventFilter(&scrnmgr);\n\n    initScreenRepainter(scrn_view, backend, callbacks);\n\n    ConsoleManager consmgr(dbg_console, backend, callbacks);\n    QObject::connect(dbg_console, SIGNAL(commandRun(QString)),\n                     &consmgr, SLOT(runCommand(QString)));\n    QObject::connect(dbg_console, SIGNAL(traceToggled(bool)),\n                     &consmgr, SLOT(useTraceLogs(bool)));\n\n    view.show();\n    int result = app.exec();\n    return result;\n}\n\n#include \"main.moc\"\n<|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/eve:$Id$\n\/\/ Author: Matevz Tadel\n\n\/\/ Demonstrates usage of TEveBox class.\n\n\nTEveBox* box(Float_t a=10, Float_t d=5, Float_t x=0, Float_t y=0, Float_t z=0)\n{\n   TEveManager::Create();\n\n   TRandom& r = * gRandom;\n\n   TEveBox* b = new TEveBox;\n   b->SetMainColor(kCyan);\n   b->SetMainTransparency(0);\n\n#define RND_BOX(x) r.Uniform(-(x), (x))\n   b->SetVertex(0, x - a + RND_BOX(d), y - a + RND_BOX(d), z - a + RND_BOX(d));\n   b->SetVertex(1, x - a + RND_BOX(d), y + a + RND_BOX(d), z - a + RND_BOX(d));\n   b->SetVertex(2, x + a + RND_BOX(d), y + a + RND_BOX(d), z - a + RND_BOX(d));\n   b->SetVertex(3, x + a + RND_BOX(d), y - a + RND_BOX(d), z - a + RND_BOX(d));\n   b->SetVertex(4, x - a + RND_BOX(d), y - a + RND_BOX(d), z + a + RND_BOX(d));\n   b->SetVertex(5, x - a + RND_BOX(d), y + a + RND_BOX(d), z + a + RND_BOX(d));\n   b->SetVertex(6, x + a + RND_BOX(d), y + a + RND_BOX(d), z + a + RND_BOX(d));\n   b->SetVertex(7, x + a + RND_BOX(d), y - a + RND_BOX(d), z + a + RND_BOX(d));\n#undef RND_BOX\n\n   gEve->AddElement(b);\n   gEve->Redraw3D(kTRUE);\n}\n<commit_msg>Non-void function must return a value.<commit_after>\/\/ @(#)root\/eve:$Id$\n\/\/ Author: Matevz Tadel\n\n\/\/ Demonstrates usage of TEveBox class.\n\n\nTEveBox* box(Float_t a=10, Float_t d=5, Float_t x=0, Float_t y=0, Float_t z=0)\n{\n   TEveManager::Create();\n\n   TRandom& r = * gRandom;\n\n   TEveBox* b = new TEveBox;\n   b->SetMainColor(kCyan);\n   b->SetMainTransparency(0);\n\n#define RND_BOX(x) r.Uniform(-(x), (x))\n   b->SetVertex(0, x - a + RND_BOX(d), y - a + RND_BOX(d), z - a + RND_BOX(d));\n   b->SetVertex(1, x - a + RND_BOX(d), y + a + RND_BOX(d), z - a + RND_BOX(d));\n   b->SetVertex(2, x + a + RND_BOX(d), y + a + RND_BOX(d), z - a + RND_BOX(d));\n   b->SetVertex(3, x + a + RND_BOX(d), y - a + RND_BOX(d), z - a + RND_BOX(d));\n   b->SetVertex(4, x - a + RND_BOX(d), y - a + RND_BOX(d), z + a + RND_BOX(d));\n   b->SetVertex(5, x - a + RND_BOX(d), y + a + RND_BOX(d), z + a + RND_BOX(d));\n   b->SetVertex(6, x + a + RND_BOX(d), y + a + RND_BOX(d), z + a + RND_BOX(d));\n   b->SetVertex(7, x + a + RND_BOX(d), y - a + RND_BOX(d), z + a + RND_BOX(d));\n#undef RND_BOX\n\n   gEve->AddElement(b);\n   gEve->Redraw3D(kTRUE);\n   \n   return b;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/* Style: A base class from which all other styles are inherited, includes\n * a name.\n *\n * Copyright (C) 2002-2003 William Lachance (william.lachance@sympatico.ca)\n *\n * This program is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2 of the License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n * Library General Public License for more details.\n *\n * You should have received a copy of the GNU Library General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA\n *\n * For further information visit http:\/\/libwpd.sourceforge.net\n *\n *\/\n\n\/* \"This product is not manufactured, approved, or supported by\n * Corel Corporation or Corel Corporation Limited.\"\n *\/\n\n#ifndef _STYLE_H\n#define _STYLE_H\n#include <libwpd\/libwpd.h>\n#include \"DocumentElement.hxx\"\n\nclass TopLevelElementStyle\n{\npublic:\n    TopLevelElementStyle() : mpsMasterPageName(NULL) { }\n    virtual ~TopLevelElementStyle() { if (mpsMasterPageName) delete mpsMasterPageName; }\n    void setMasterPageName(WPXString &sMasterPageName) { mpsMasterPageName = new WPXString(sMasterPageName); }\n    const WPXString * getMasterPageName() const { return mpsMasterPageName; }\n\nprivate:\n    WPXString *mpsMasterPageName;\n};\n\nclass Style\n{\n public:\n    Style(const WPXString &psName) : msName(psName) {}\n    virtual ~Style() {}\n\n    virtual void write(DocumentHandlerInterface * \/* pHandler *\/) const {};\n    const WPXString &getName() const { return msName; }\n\n private:\n    WPXString msName;\n};\n#endif\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>WaE: gcc 4.6.0 various warnings<commit_after>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/* Style: A base class from which all other styles are inherited, includes\n * a name.\n *\n * Copyright (C) 2002-2003 William Lachance (william.lachance@sympatico.ca)\n *\n * This program is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2 of the License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n * Library General Public License for more details.\n *\n * You should have received a copy of the GNU Library General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA\n *\n * For further information visit http:\/\/libwpd.sourceforge.net\n *\n *\/\n\n\/* \"This product is not manufactured, approved, or supported by\n * Corel Corporation or Corel Corporation Limited.\"\n *\/\n\n#ifndef _STYLE_H\n#define _STYLE_H\n#include <libwpd\/libwpd.h>\n#include \"DocumentElement.hxx\"\n\nclass TopLevelElementStyle\n{\npublic:\n    TopLevelElementStyle() : mpsMasterPageName(0) { }\n    virtual ~TopLevelElementStyle() { if (mpsMasterPageName) delete mpsMasterPageName; }\n    void setMasterPageName(WPXString &sMasterPageName) { mpsMasterPageName = new WPXString(sMasterPageName); }\n    const WPXString * getMasterPageName() const { return mpsMasterPageName; }\n\nprivate:\n    WPXString *mpsMasterPageName;\n};\n\nclass Style\n{\n public:\n    Style(const WPXString &psName) : msName(psName) {}\n    virtual ~Style() {}\n\n    virtual void write(DocumentHandlerInterface * \/* pHandler *\/) const {};\n    const WPXString &getName() const { return msName; }\n\n private:\n    WPXString msName;\n};\n#endif\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>add test case for copy&paste formulas between documents<commit_after><|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\n\n\/\/ LibMesh includes\n#include \"nemesis_io.h\"\n#include \"nemesis_io_helper.h\"\n#include \"parallel_mesh.h\"\n#include \"parallel.h\"\n\n\/\/ ------------------------------------------------------------\n\/\/ Nemesis_IO class members\nNemesis_IO::Nemesis_IO (ParallelMesh& mesh) :\n  MeshInput<ParallelMesh> (mesh, \/*is_parallel_format=*\/true),\n  \/\/MeshOutput<ParallelMesh> (mesh, \/*is_parallel_format=*\/true)\n  _verbose (false)\n{\n}\n\n\nNemesis_IO::~Nemesis_IO ()\n{\n}\n\n\n\nvoid Nemesis_IO::verbose (bool set_verbosity)\n{\n  _verbose = set_verbosity;\n\n#if defined(LIBMESH_HAVE_EXODUS_API) && defined(LIBMESH_HAVE_NEMESIS_API)\n  \/\/ Set the verbose flag in the helper object\n  \/\/ as well.\n  nemhelper.verbose(_verbose);\n#endif\n}\n\n\n\n#if defined(LIBMESH_HAVE_EXODUS_API) && defined(LIBMESH_HAVE_NEMESIS_API)\nvoid Nemesis_IO::read (const std::string& base_filename)\n{\n  if (_verbose)\n    {\n      std::cout << \"[\" << libMesh::processor_id() << \"] \";\n      std::cout << \"Reading Nemesis file on processor: \" << libMesh::processor_id() << std::endl;\n    }\n  \n  \/\/ Construct a filename string for this processor.\n  \/\/\n  \/\/ FIXME: This assumes you are reading in a mesh on exactly the\n  \/\/ same number of processors it was written out on!!\n  \/\/ This should be generalized at some point...\n  std::ostringstream file_oss;\n\n  file_oss << base_filename;\n    \n  \/\/ In the 1 processor case, assume the base_filename is the filename...\n  if ( libMesh::n_processors() > 1 )\n    file_oss << '.' << libMesh::n_processors() << '.' << libMesh::processor_id();\n\n  std::cout << \"Opening file: \" << file_oss.str() << std::endl;\n\n  \/\/ Make it a little easier to access the ExodusII helper object...\n  ExodusII_IO_Helper& ex2helper = nemhelper.ex2helper;\n  \n  \/\/ Open the Exodus file\n  ex2helper.open(file_oss.str().c_str());\n\n  \/\/ Only split files will have additional Nemesis information\n  if ( libMesh::n_processors() > 1 )\n    {\n      \/\/ Get global information: number of nodes, elems, blocks, nodesets and sidesets\n      nemhelper.get_init_global();\n\n      \/\/ Get \"load balance\" information.  This includes the number of internal & border\n      \/\/ nodes and elements as well as the number of communication maps.\n      nemhelper.get_loadbal_param();\n\n      \/\/ Communicate n_internal_elems and n_border_elems to all processors.  This\n      \/\/ determines the global element numbering.  \n      \/\/ std::vector<int> num_internal_elems_all (libMesh::n_processors());\n      \/\/ Parallel::allgather(nemhelper.num_internal_elems, num_internal_elems_all);\n      \/\/       if (_verbose)\n      \/\/ \t{\n      \/\/ \t  std::cout << \"[\" << libMesh::processor_id() << \"] \";\n      \/\/ \t  for (unsigned int j=0; j<libMesh::n_processors(); ++j)\n      \/\/ \t    std::cout << \"num_internal_elems_all[\"\n      \/\/ \t\t      <<\tj << \"]=\"\n      \/\/ \t\t      << num_internal_elems_all[j]\n      \/\/ \t\t      << \" \";\n      \/\/ \t  std::cout << std::endl;\n      \/\/ \t}\n\n      \/\/ The call to get_loadbal_param() gets 7 pieces of information.  We allgather\n      \/\/ these now across all processors to determine some global numberings...\n      std::vector<int> all_loadbal_data ( 7 );\n      all_loadbal_data[0] = nemhelper.num_internal_nodes;\n      all_loadbal_data[1] = nemhelper.num_border_nodes;\n      all_loadbal_data[2] = nemhelper.num_external_nodes;\n      all_loadbal_data[3] = nemhelper.num_internal_elems;\n      all_loadbal_data[4] = nemhelper.num_border_elems;\n      all_loadbal_data[5] = nemhelper.num_node_cmaps;\n      all_loadbal_data[6] = nemhelper.num_elem_cmaps;\n      Parallel::allgather(all_loadbal_data);\n      \n      if (_verbose)\n\t{\n\t  \/\/ Ex: print out the number of internal nodes on all processors\n\t  std::cout << \"[\" << libMesh::processor_id() << \"] \";\n\t  for (unsigned int j=0,c=0; c<libMesh::n_processors(); j+=7)\n\t    std::cout << \"num_internal_nodes[\"\n\t\t      << c++ << \"]=\"\n\t\t      << all_loadbal_data[j]\n\t\t      << \" \";\n\t  std::cout << std::endl;\n\t}\n\n      \n      \/\/ Assertion: The sum of the border and internal elements on all processors\n      \/\/ should equal nemhelper.num_elems_global\n#ifndef NDEBUG\n      int sum_internal_elems=0, sum_border_elems=0;\n      for (unsigned int j=3,c=0; c<libMesh::n_processors(); j+=7,++c)\n\tsum_internal_elems += all_loadbal_data[j];\n\n      for (unsigned int j=4,c=0; c<libMesh::n_processors(); j+=7,++c)\n\tsum_border_elems += all_loadbal_data[j];\n\n      if (_verbose)\n\t{\n\t  std::cout << \"[\" << libMesh::processor_id() << \"] \";\n\t  std::cout << \"sum_internal_elems=\" << sum_internal_elems << std::endl;\n\n\t  std::cout << \"[\" << libMesh::processor_id() << \"] \";\n\t  std::cout << \"sum_border_elems=\" << sum_border_elems << std::endl;\n\t}\n\n      libmesh_assert(sum_internal_elems+sum_border_elems == nemhelper.num_elems_global);\n#endif\n\n      \/\/ Compute my_elem_offset, the amount by which to offset the local elem numbering\n      \/\/ on my processor.\n      unsigned int my_elem_offset = 0;\n      for (unsigned int i=0; i<libMesh::processor_id(); ++i)\n\tmy_elem_offset += (all_loadbal_data[7*i + 3]+  \/\/ num_internal_elems, proc i\n\t\t\t   all_loadbal_data[7*i + 4]); \/\/ num_border_elems, proc i\n      std::cout << \"[\" << libMesh::processor_id() << \"] \";\n      std::cout << \"my_elem_offset=\" << my_elem_offset << std::endl;\n      \n      \/\/ Get a reference to the ParallelMesh.  \n      ParallelMesh& mesh = this->mesh();\n\n      \/\/ Local information: Read the standard Exodus header\n      ex2helper.read_header();\n      ex2helper.print_header();\n\n      \/\/ Be sure number of dimensions is equal to the number of dimensions in the mesh supplied.\n      libmesh_assert(static_cast<unsigned int>(ex2helper.num_dim) == mesh.mesh_dimension());\n\n      \/\/ Read nodes from the exodus file: this fills the ex2helper.x,y,z arrays.\n      ex2helper.read_nodes();\n    } \/\/ end if ( libMesh::n_processors() > 1 )\n\n  else\n    {\n      \/\/ Do something different when running in serial??\n      libmesh_error();\n    }\n\n  \n  \n}\n\n#else\n\nvoid Nemesis_IO::read (const std::string& )\n{\n  std::cerr <<  \"ERROR, Nemesis API is not defined!\" << std::endl;\n  libmesh_error();\n}\n\n#endif\n<commit_msg>More parallel mesh reading stuff.<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 <numeric> \/\/ std::accumulate\n\n\/\/ LibMesh includes\n#include \"nemesis_io.h\"\n#include \"nemesis_io_helper.h\"\n#include \"parallel_mesh.h\"\n#include \"parallel.h\"\n\n\/\/ ------------------------------------------------------------\n\/\/ Nemesis_IO class members\nNemesis_IO::Nemesis_IO (ParallelMesh& mesh) :\n  MeshInput<ParallelMesh> (mesh, \/*is_parallel_format=*\/true),\n  \/\/MeshOutput<ParallelMesh> (mesh, \/*is_parallel_format=*\/true)\n  _verbose (false)\n{\n}\n\n\nNemesis_IO::~Nemesis_IO ()\n{\n}\n\n\n\nvoid Nemesis_IO::verbose (bool set_verbosity)\n{\n  _verbose = set_verbosity;\n\n#if defined(LIBMESH_HAVE_EXODUS_API) && defined(LIBMESH_HAVE_NEMESIS_API)\n  \/\/ Set the verbose flag in the helper object\n  \/\/ as well.\n  nemhelper.verbose(_verbose);\n#endif\n}\n\n\n\n#if defined(LIBMESH_HAVE_EXODUS_API) && defined(LIBMESH_HAVE_NEMESIS_API)\nvoid Nemesis_IO::read (const std::string& base_filename)\n{\n  if (_verbose)\n    {\n      std::cout << \"[\" << libMesh::processor_id() << \"] \";\n      std::cout << \"Reading Nemesis file on processor: \" << libMesh::processor_id() << std::endl;\n    }\n  \n  \/\/ Construct a filename string for this processor.\n  \/\/\n  \/\/ FIXME: This assumes you are reading in a mesh on exactly the\n  \/\/ same number of processors it was written out on!!\n  \/\/ This should be generalized at some point...\n  std::ostringstream file_oss;\n\n  file_oss << base_filename;\n    \n  \/\/ In the 1 processor case, assume the base_filename is the filename...\n  if ( libMesh::n_processors() > 1 )\n    file_oss << '.' << libMesh::n_processors() << '.' << libMesh::processor_id();\n\n  std::cout << \"Opening file: \" << file_oss.str() << std::endl;\n\n  \/\/ Make it a little easier to access the ExodusII helper object...\n  ExodusII_IO_Helper& ex2helper = nemhelper.ex2helper;\n  \n  \/\/ Open the Exodus file\n  ex2helper.open(file_oss.str().c_str());\n\n  \/\/ Only split files will have additional Nemesis information\n  if ( libMesh::n_processors() > 1 )\n    {\n      \/\/ Get global information: number of nodes, elems, blocks, nodesets and sidesets\n      nemhelper.get_init_global();\n\n      \/\/ Get \"load balance\" information.  This includes the number of internal & border\n      \/\/ nodes and elements as well as the number of communication maps.\n      nemhelper.get_loadbal_param();\n\n      \/\/ Communicate n_internal_elems and n_border_elems to all processors.  This\n      \/\/ determines the global element numbering.  \n      \/\/ std::vector<int> num_internal_elems_all (libMesh::n_processors());\n      \/\/ Parallel::allgather(nemhelper.num_internal_elems, num_internal_elems_all);\n      \/\/       if (_verbose)\n      \/\/ \t{\n      \/\/ \t  std::cout << \"[\" << libMesh::processor_id() << \"] \";\n      \/\/ \t  for (unsigned int j=0; j<libMesh::n_processors(); ++j)\n      \/\/ \t    std::cout << \"num_internal_elems_all[\"\n      \/\/ \t\t      <<\tj << \"]=\"\n      \/\/ \t\t      << num_internal_elems_all[j]\n      \/\/ \t\t      << \" \";\n      \/\/ \t  std::cout << std::endl;\n      \/\/ \t}\n\n      \/\/ The call to get_loadbal_param() gets 7 pieces of information.  We allgather\n      \/\/ these now across all processors to determine some global numberings...\n      std::vector<int> all_loadbal_data ( 7 );\n      all_loadbal_data[0] = nemhelper.num_internal_nodes;\n      all_loadbal_data[1] = nemhelper.num_border_nodes;\n      all_loadbal_data[2] = nemhelper.num_external_nodes;\n      all_loadbal_data[3] = nemhelper.num_internal_elems;\n      all_loadbal_data[4] = nemhelper.num_border_elems;\n      all_loadbal_data[5] = nemhelper.num_node_cmaps;\n      all_loadbal_data[6] = nemhelper.num_elem_cmaps;\n      Parallel::allgather(all_loadbal_data);\n      \n      if (_verbose)\n\t{\n\t  \/\/ Ex: print out the number of internal nodes on all processors\n\t  std::cout << \"[\" << libMesh::processor_id() << \"] \";\n\t  for (unsigned int j=0,c=0; c<libMesh::n_processors(); j+=7)\n\t    std::cout << \"num_internal_nodes[\"\n\t\t      << c++ << \"]=\"\n\t\t      << all_loadbal_data[j]\n\t\t      << \" \";\n\t  std::cout << std::endl;\n\t}\n\n      \n      \/\/ Assertion: The sum of the border and internal elements on all processors\n      \/\/ should equal nemhelper.num_elems_global\n#ifndef NDEBUG\n      int sum_internal_elems=0, sum_border_elems=0;\n      for (unsigned int j=3,c=0; c<libMesh::n_processors(); j+=7,++c)\n\tsum_internal_elems += all_loadbal_data[j];\n\n      for (unsigned int j=4,c=0; c<libMesh::n_processors(); j+=7,++c)\n\tsum_border_elems += all_loadbal_data[j];\n\n      if (_verbose)\n\t{\n\t  std::cout << \"[\" << libMesh::processor_id() << \"] \";\n\t  std::cout << \"sum_internal_elems=\" << sum_internal_elems << std::endl;\n\n\t  std::cout << \"[\" << libMesh::processor_id() << \"] \";\n\t  std::cout << \"sum_border_elems=\" << sum_border_elems << std::endl;\n\t}\n\n      libmesh_assert(sum_internal_elems+sum_border_elems == nemhelper.num_elems_global);\n#endif\n\n      \/\/ Compute my_elem_offset, the amount by which to offset the local elem numbering\n      \/\/ on my processor.\n      unsigned int my_elem_offset = 0;\n      for (unsigned int i=0; i<libMesh::processor_id(); ++i)\n\tmy_elem_offset += (all_loadbal_data[7*i + 3]+  \/\/ num_internal_elems, proc i\n\t\t\t   all_loadbal_data[7*i + 4]); \/\/ num_border_elems, proc i\n      std::cout << \"[\" << libMesh::processor_id() << \"] \";\n      std::cout << \"my_elem_offset=\" << my_elem_offset << std::endl;\n      \n      \/\/ Get a reference to the ParallelMesh.  \n      ParallelMesh& mesh = this->mesh();\n\n\n      \/\/ The get_cmap_params() function reads in the:\n      \/\/\n      \/\/ node_cmap_ids[],\n      \/\/ node_cmap_node_cnts[],\n      \/\/ elem_cmap_ids[],\n      \/\/ elem_cmap_elem_cnts[],\n      nemhelper.get_cmap_params();\n\n      \/\/ Each processor is responsible for numbering all its internal nodes and the border nodes\n      \/\/ for all adjoining processors with higher IDs.  \n      unsigned int nodes_i_must_number = nemhelper.num_internal_nodes;\n      for (unsigned int i=0; i<nemhelper.node_cmap_ids.size(); ++i)\n\t{\n\t  \/\/ If I have a cmap entry for a processor with a higher ID than mine...\n\t  if (static_cast<unsigned int>(nemhelper.node_cmap_ids[i]) > libMesh::processor_id())\n\t    {\n\t      \/\/ ... then I am responsible for numbering those nodes.\n\t      nodes_i_must_number += nemhelper.node_cmap_node_cnts[i];\n\t    }\n\t}\n\n      if (_verbose)\n\t{\n\t  std::cout << \"[\" << libMesh::processor_id() << \"] \";\n\t  std::cout << \"nodes_i_must_number=\" << nodes_i_must_number << std::endl;\n\t}\n      \n      \/\/ Communicate the nodes_i_must_number information to all processors.  This\n      \/\/ determines a global node numbering offset.  FIXME: This should be allgathered\n      \/\/ with other data for better communication efficiency.\n      std::vector<unsigned int> all_nodal_offsets(libMesh::n_processors());\n      Parallel::allgather(nodes_i_must_number, all_nodal_offsets);      \n\n      \/\/ The sum of all the entries in this vector should sum to the number of global nodes\n      libmesh_assert(std::accumulate(all_nodal_offsets.begin(),\n\t\t\t\t     all_nodal_offsets.end(),\n\t\t\t\t     0) == nemhelper.num_nodes_global);\n\n      \/\/ Compute my_node_offset, the amount by which to offset the local node numbering\n      \/\/ on my processor.\n      unsigned int my_node_offset = 0;\n      for (unsigned int i=0; i<libMesh::processor_id(); ++i)\n\tmy_node_offset += all_nodal_offsets[i];\n\n      if (_verbose)\n\t{\n\t  std::cout << \"[\" << libMesh::processor_id() << \"] \";\n\t  std::cout << \"my_node_offset=\" << my_node_offset << std::endl;\n\t}\n\n      \n      \/\/ Read the IDs of the interior, boundary, and external nodes.  This function\n      \/\/ fills the vectors:\n      \/\/ node_mapi[],\n      \/\/ node_mapb[],\n      \/\/ node_mape[]\n      nemhelper.get_node_map();\n\n      \/\/ Read each node communication map for this processor.  This function\n      \/\/ fills the vectors of vectors named:\n      \/\/ node_cmap_node_ids[][]\n      \/\/ node_cmap_proc_ids[][]\n      nemhelper.get_node_cmap();\n\n      \/\/ Local information: Read the standard Exodus header\n      ex2helper.read_header();\n      ex2helper.print_header();\n\n      \/\/ Be sure number of dimensions is equal to the number of dimensions in the mesh supplied.\n      libmesh_assert(static_cast<unsigned int>(ex2helper.num_dim) == mesh.mesh_dimension());\n\n      \/\/ Read nodes from the exodus file: this fills the ex2helper.x,y,z arrays.\n      ex2helper.read_nodes();\n\n      \/\/ Add internal nodes the ParallelMesh, using the node ID offset we computed and the current\n      \/\/ processor's ID.\n      for (int i=0; i<nemhelper.num_internal_nodes; ++i)\n\t{\n\t  const Real x = ex2helper.x[ nemhelper.node_mapi[i] ];\n\t  const Real y = ex2helper.y[ nemhelper.node_mapi[i] ];\n\t  const Real z = ex2helper.z[ nemhelper.node_mapi[i] ];\n\t  mesh.add_point (Point(x,y,z), my_node_offset+i, libMesh::processor_id());\n\t}\n\n      \/\/ How many nodes are now in the mesh?\n      \/\/ Forces mesh.n_nodes() to return the correct value.\n      \/\/ mesh.update_parallel_id_counts(); \n\n      if (_verbose)\n\t{\n\t  \/\/ Report the number of nodes which have been added locally\n\t  std::cout << \"[\" << libMesh::processor_id() << \"] \";\n\t  std::cout << \"mesh.n_nodes()=\" << mesh.n_nodes() << std::endl;\n\n\t  \/\/ Reports the number of nodes that have been added in total.\n\t  std::cout << \"[\" << libMesh::processor_id() << \"] \";\n\t  std::cout << \"mesh.parallel_n_nodes()=\" << mesh.parallel_n_nodes() << std::endl;\n\t}\n      \n      \/*\n      \/\/ Let's check if our hypothesis about the node_cmap_node_ids is valid.  Print the\n      \/\/ x,y,z location of the entries in node_cmap_node_ids.  This is hard-coded to print\n      \/\/ entries in the zeroth node cmap on processors 0 and 1, since I happen to\n      \/\/ know they share a boundary....\n      if ((libMesh::processor_id()==0) || (libMesh::processor_id()==1))\n\t{\n\t  \n\/\/ \t  \/\/ Print index and x,y,z location of [0][0] element \n\/\/ \t  unsigned int test_index = nemhelper.node_cmap_node_ids[0][0];\n\/\/ \t  std::cout << \"[\" << libMesh::processor_id() << \"] \";\n\/\/ \t  std::cout << \"nemhelper.node_cmap_node_ids[0][0]=\"\n\/\/ \t\t    << test_index\n\/\/ \t\t    << std::endl;\n\n\t  \/\/ Print about 10 entries to see if they match\n\t  for (unsigned int i=0; i<std::min(static_cast<unsigned int>(10),\n\t\t\t\t\t    nemhelper.node_cmap_node_ids[0].size()); ++i)\n\t    {\n\t      unsigned int test_index =\n\t\tnemhelper.node_cmap_node_ids[0][i];\n\t      \n\t      std::cout << \"[\" << libMesh::processor_id() << \"] \";\n\t      std::cout << \"Node \" << test_index\n\t\t\t<< \" = (\"\n\t\t\t<< ex2helper.x[ test_index ]\n\t\t\t<< \", \"\n\t\t\t<< ex2helper.y[ test_index ]\n\t\t\t<< \", \"\n\t\t\t<< ex2helper.z[ test_index ]\n\t\t\t<< \")\" << std::endl;\n\t    }\n\t}\n      *\/\n\n\n      \/\/ Create a symmetric container for storing node_cmap_node_ids.  This is necessary\n      \/\/ in order to add identical nodes with the correct global ID, which is determined by\n      \/\/ a lower-numbered processor.\n      std::vector<std::vector<int> > symm_node_cmap_node_ids( nemhelper.node_cmap_node_ids.size() );\n\n      \/\/ Loop over the existing node_cmap_ids, allocate space where we will need to receive data.\n      for (unsigned int i=0; i<nemhelper.node_cmap_node_ids.size(); ++i)\n\t{\n\t  unsigned int other_proc = nemhelper.node_cmap_ids[i];\n\t  if (other_proc < libMesh::processor_id())\n\t    {\n\t      \/\/ We will need to pull data from the lower-ID processor.  Let's allocate\n\t      \/\/ space.\n\t      symm_node_cmap_node_ids[i].resize( nemhelper.node_cmap_node_ids[i].size() );\n\n\t      if (_verbose)\n\t\t{\n\t\t  std::cout << \"[\" << libMesh::processor_id() << \"] \";\n\t\t  std::cout << \"Allocating space for \" \n\t\t\t    << nemhelper.node_cmap_node_ids[i].size()\n\t\t\t    << \" entries in symm_node_cmap_node_ids[\"<<i<<\"].\"\n\t\t\t    << \" Values will come from processor \"\n\t\t\t    << other_proc\n\t\t\t    << \".\"\n\t\t\t    << std::endl;\n\t\t}\n\t    }\n\t}\n\n      \/\/ Loop again, this time initiate the communication.  We are gonna try posting\n      \/\/ all the non-blocking receives followed by all the non-blocking sends later,\n      \/\/ on the recommendation of Bill and Robert...\n      std::vector<Parallel::request> isend_requests, irecv_requests;\n      \n      for (unsigned int i=0; i<nemhelper.node_cmap_node_ids.size(); ++i)\n\t{\n\t  unsigned int other_proc = nemhelper.node_cmap_ids[i];\n\t  if (other_proc < libMesh::processor_id())\n\t    {\n\n\t      \/\/ A symmetric hash of other_proc and libMesh::processor_id.  See also, elem.h.\n\t      unsigned int tag =\n\t\t(std::min(other_proc, libMesh::processor_id())     ) % 65449 +\n\t\t(std::max(other_proc, libMesh::processor_id()) << 5) % 65449;\n\t      \n\t      if (_verbose)\n\t\tstd::cout << \"[\" << libMesh::processor_id() << \"] Receiving, tag=\" << tag << std::endl;\n\t      \n\t      \/\/ We need to receive data from other_proc\n\t      irecv_requests.push_back(Parallel::request());\n\t      Parallel::irecv(other_proc,                 \/\/ sending proc id\n\t\t\t      symm_node_cmap_node_ids[i], \/\/ recv buffer\n\t\t\t      irecv_requests.back(),      \/\/ request\n\t\t\t      tag                         \/\/ tag\n\t\t\t      );\n\t    }\n\t}\n\n\n      for (unsigned int i=0; i<nemhelper.node_cmap_node_ids.size(); ++i)\n\t{\n\t  unsigned int other_proc = nemhelper.node_cmap_ids[i];\n\t  if (other_proc > libMesh::processor_id())\n\t    {\n\t      \/\/ A symmetric hash of other_proc and libMesh::processor_id.  See also, elem.h.\n\t      unsigned int tag =\n\t\t(std::min(other_proc, libMesh::processor_id())     ) % 65449 +\n\t\t(std::max(other_proc, libMesh::processor_id()) << 5) % 65449;\n\n\t      if (_verbose)\n\t\tstd::cout << \"[\" << libMesh::processor_id() << \"] Sending, tag=\" << tag << std::endl;\n\t\t\n\t      \/\/ We need to send our data to other_proc\n\t      isend_requests.push_back(Parallel::request());\n\t      Parallel::isend(other_proc,                      \/\/ destination proc id\n\t\t\t      nemhelper.node_cmap_node_ids[i], \/\/ send buffer\n\t\t\t      isend_requests.back(),           \/\/ request\n\t\t\t      tag                              \/\/ tag\n\t\t\t      );\n\t    }\n\t}\n\n      \/\/ Wait for sends and receives to complete\n      Parallel::wait (isend_requests);\n      Parallel::wait (irecv_requests);\n      \n      \/\/ Well, did anything happen?\n      if (_verbose)\n\t{\n\t  for (unsigned int i=0; i<symm_node_cmap_node_ids.size(); ++i)\n\t    {\n\t      if (symm_node_cmap_node_ids[i].size())\n\t\t{\n\t\t  std::cout << \"[\" << libMesh::processor_id() << \"] symm_node_cmap_node_ids[\"<<i<<\"]=\";\n\t\t  for (unsigned int j=0; j<symm_node_cmap_node_ids[i].size(); ++j)\n\t\t    std::cout << symm_node_cmap_node_ids[i][j] << \" \";\n\t\t  std::cout << std::endl;\n\t\t}\n\t    }\n\t}\n      \n      \n    } \/\/ end if ( libMesh::n_processors() > 1 )\n\n  else\n    {\n      \/\/ Do something different when running in serial??\n      libmesh_error();\n    }\n\n  \n  \n}\n\n#else\n\nvoid Nemesis_IO::read (const std::string& )\n{\n  std::cerr <<  \"ERROR, Nemesis API is not defined!\" << std::endl;\n  libmesh_error();\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2009-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#include <libport\/cstdio>\n#include <libport\/debug.hh>\n#include <libport\/format.hh>\n#include <libport\/iostream>\n#include <libport\/path.hxx>\n#include <libport\/program-name.hh>\n#include <libport\/sysexits.hh>\n#include <libport\/xltdl.hh>\n\nGD_CATEGORY(XLTDL);\n\nextern \"C\"\n{\n  int\n  libport_xlt_details_identity(int i)\n  {\n    return i;\n  }\n}\n\nnamespace libport\n{\n  namespace xlt\n  {\n    namespace details\n    {\n\n      \/\/\/ \\param verbosity  the current debug level.\n      \/\/\/ \\param level      the level of this message.\n      static\n      int\n      ltdebug(unsigned \/* verbosity *\/,\n              unsigned level, const char* format, va_list args)\n      {\n        int errors = 0;\n        char* msg = 0;\n        errors += vasprintf(&msg, format, args) < 0;\n        if (!errors && msg)\n        {\n          GD_FINFO_DEBUG(\"%s%s\", std::string(level * 2, ' '), msg);\n          free(msg);\n        }\n        return errors;\n      }\n\n      void init()\n      {\n        static bool tail = false;\n        if (!tail++)\n        {\n          lt_dlinit();\n          lt_dladd_log_function((lt_dllog_function*) &ltdebug, 0);\n        }\n      }\n    }\n  }\n\n\n  \/*------------------------.\n  | xlt_advise::exception.  |\n  `------------------------*\/\n\n  xlt_advise::exception::exception(const std::string& msg)\n    : std::runtime_error(msg)\n  {}\n\n\n  \/*-------------.\n  | xlt_advise.  |\n  `-------------*\/\n\n  xlt_advise::xlt_advise()\n    throw(xlt_advise::exception)\n    : path_()\n  {\n    xlt::details::init();\n    if (lt_dladvise_init(&advise_))\n      fail(\"failed to initialize dladvise\");\n  }\n\n  \/\/ FIXME: Bad: dtors must not throw.\n  xlt_advise::~xlt_advise()\n    throw(xlt_advise::exception)\n  {\n    \/\/ FIXME: lt_dlexit when we refcount.\n    if (lt_dladvise_destroy(&advise_))\n      fail(\"failed to destroy dladvise\");\n  }\n\n  xlt_advise&\n  xlt_advise::global(bool global)\n    throw(xlt_advise::exception)\n  {\n    if (global ? lt_dladvise_global(&advise_) : lt_dladvise_local(&advise_))\n      fail(libport::format(\"failed to set dladvise to %s\",\n                           global ? \"global\" : \"local\"));\n    return *this;\n  }\n\n  xlt_advise&\n  xlt_advise::ext()\n    throw(xlt_advise::exception)\n  {\n    if (lt_dladvise_ext(&advise_))\n      fail(\"failed to set dladvise to ext\");\n    return *this;\n  }\n\n  const file_library&\n  xlt_advise::path() const throw()\n  {\n    return path_;\n  }\n\n  file_library&\n  xlt_advise::path() throw()\n  {\n    return path_;\n  }\n\n  xlt_advise&\n  xlt_advise::path(const file_library& p) throw()\n  {\n    path_ = p;\n    return *this;\n  }\n\n  lt_dlhandle\n  xlt_advise::dlopen_(const std::string& s) const\n    throw(xlt_advise::exception)\n  {\n    lt_dlhandle res = lt_dlopenadvise(s.c_str(), advise_);\n    GD_FINFO_TRACE(\"loading %s: %s\", s, res ? \"pass\" : \"fail\");\n    return res;\n  }\n\n  xlt_handle\n  xlt_advise::open(const std::string& s)\n    throw(xlt_advise::exception)\n  {\n    GD_FINFO_TRACE(\"loading %s\", s);\n\n    \/\/ Clear the error flags from previous runs.\n    \/\/\n    \/\/ FIXME: This should be done in libltdl itself.  The problem\n    \/\/ probably arose from our patches to preserve the first error\n    \/\/ when traversing the user path: now, even on success, the error\n    \/\/ flag remains set, and the following run is hindered by it.  We\n    \/\/ need to complete this patch with a means to ensure that the\n    \/\/ error flags is restored to its previous state (typically\n    \/\/ no-error) when eventually we managed to load the file.\n    lt_dlerror();\n\n    lt_dlhandle res = 0;\n    \/\/ We cannot simply use search_file in file_library, because we\n    \/\/ don't know the extension of the file we are looking for (*.la,\n    \/\/ *.so, *.dyld etc.).  That's an implementation detail that ltdl\n    \/\/ saves us from.\n    if (path_.search_path_get().empty() || libport::path(s).absolute_get())\n      res = dlopen_(s);\n    else\n      foreach (const libport::path& p, path_.search_path_get())\n        if ((res = dlopen_(p \/ s)))\n          break;\n\n    if (!res)\n      fail(libport::format(\"failed to open %s\", s));\n\n    return res;\n  }\n\n\n  \/\/\/ Throw an exception, or exit with exit_failure_ if nonnull.\n  void\n  xlt_advise::fail(std::string msg)\n    throw(xlt_advise::exception)\n  {\n    msg += \": \";\n    const char* err = lt_dlerror();\n    msg += err ? err : \"(no available error message)\";\n    throw exception(msg);\n  }\n\n\n\n  \/*-------------.\n  | xlt_handle.  |\n  `-------------*\/\n\n  xlt_handle::xlt_handle(lt_dlhandle h)\n    : handle(h)\n  {}\n\n  xlt_handle::~xlt_handle()\n  {\n    \/\/ FIXME: We can't close -- yet.  We need to keep track of the\n    \/\/ number of trackers.  Otherwise a simple \"handle h =\n    \/\/ advise.open\" will close the handle when cleaning the temporary\n    \/\/ made by \"advise.open\".\n\n    \/\/ close();\n  }\n\n  void\n  xlt_handle::close()\n    throw(xlt_handle::exception)\n  {\n    if (handle)\n    {\n      int errors = lt_dlclose(handle);\n      handle = 0;\n      if (errors)\n        fail(\"cannot close\");\n    }\n  }\n\n  void\n  xlt_handle::detach()\n  {\n    aver(handle);\n    handle = 0;\n  }\n\n  void\n  xlt_handle::attach(lt_dlhandle h)\n  {\n    aver(!handle);\n    handle = h;\n  }\n\n  \/\/\/ Throw an exception, or exit with exit_failure_ if nonnull.\n  void\n  xlt_handle::fail(const std::string& msg)\n    throw(xlt_advise::exception)\n  {\n    xlt_advise::fail(msg);\n  }\n\n\n  \/*-------------.\n  | Standalone.  |\n  `-------------*\/\n\n  xlt_handle\n  xlt_openext(const std::string& s, bool global, int exit_failure)\n    throw (xlt_advise::exception)\n  {\n    try\n    {\n      return xlt_advise().global(global).ext().open(s);\n    }\n    catch (std::exception& s)\n    {\n      std::cerr << libport::program_name()\n                << \": \"\n                << s.what()\n                << std::endl\n                << libport::exit(exit_failure);\n    }\n  }\n}\n<commit_msg>xltdl: propagate ATTRIBUTE_NORETURN.<commit_after>\/*\n * Copyright (C) 2009-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#include <libport\/cstdio>\n#include <libport\/debug.hh>\n#include <libport\/format.hh>\n#include <libport\/iostream>\n#include <libport\/path.hxx>\n#include <libport\/program-name.hh>\n#include <libport\/sysexits.hh>\n#include <libport\/xltdl.hh>\n\nGD_CATEGORY(XLTDL);\n\nextern \"C\"\n{\n  int\n  libport_xlt_details_identity(int i)\n  {\n    return i;\n  }\n}\n\nnamespace libport\n{\n  namespace xlt\n  {\n    namespace details\n    {\n\n       \/\/\/ \\param verbosity  the current debug level.\n       \/\/\/ \\param level      the level of this message.\n       static\n       int\n       ltdebug(unsigned \/* verbosity *\/,\n               unsigned level, const char* format, va_list args)\n       {\n         int errors = 0;\n         char* msg = 0;\n         errors += vasprintf(&msg, format, args) < 0;\n         if (!errors && msg)\n         {\n           GD_FINFO_DEBUG(\"%s%s\", std::string(level * 2, ' '), msg);\n           free(msg);\n         }\n         return errors;\n       }\n\n       void init()\n       {\n         static bool tail = false;\n         if (!tail++)\n         {\n           lt_dlinit();\n           lt_dladd_log_function((lt_dllog_function*) &ltdebug, 0);\n         }\n       }\n     }\n   }\n\n\n   \/*------------------------.\n   | xlt_advise::exception.  |\n   `------------------------*\/\n\n   xlt_advise::exception::exception(const std::string& msg)\n     : std::runtime_error(msg)\n   {}\n\n\n   \/*-------------.\n   | xlt_advise.  |\n   `-------------*\/\n\n   xlt_advise::xlt_advise()\n     throw(xlt_advise::exception)\n     : path_()\n   {\n     xlt::details::init();\n     if (lt_dladvise_init(&advise_))\n       fail(\"failed to initialize dladvise\");\n  }\n\n  \/\/ FIXME: Bad: dtors must not throw.\n  xlt_advise::~xlt_advise()\n    throw(xlt_advise::exception)\n  {\n    \/\/ FIXME: lt_dlexit when we refcount.\n    if (lt_dladvise_destroy(&advise_))\n      fail(\"failed to destroy dladvise\");\n  }\n\n  xlt_advise&\n  xlt_advise::global(bool global)\n    throw(xlt_advise::exception)\n  {\n    if (global ? lt_dladvise_global(&advise_) : lt_dladvise_local(&advise_))\n      fail(libport::format(\"failed to set dladvise to %s\",\n                           global ? \"global\" : \"local\"));\n    return *this;\n  }\n\n  xlt_advise&\n  xlt_advise::ext()\n    throw(xlt_advise::exception)\n  {\n    if (lt_dladvise_ext(&advise_))\n      fail(\"failed to set dladvise to ext\");\n    return *this;\n  }\n\n  const file_library&\n  xlt_advise::path() const throw()\n  {\n    return path_;\n  }\n\n  file_library&\n  xlt_advise::path() throw()\n  {\n    return path_;\n  }\n\n  xlt_advise&\n  xlt_advise::path(const file_library& p) throw()\n  {\n    path_ = p;\n    return *this;\n  }\n\n  lt_dlhandle\n  xlt_advise::dlopen_(const std::string& s) const\n    throw(xlt_advise::exception)\n  {\n    lt_dlhandle res = lt_dlopenadvise(s.c_str(), advise_);\n    GD_FINFO_TRACE(\"loading %s: %s\", s, res ? \"pass\" : \"fail\");\n    return res;\n  }\n\n  xlt_handle\n  xlt_advise::open(const std::string& s)\n    throw(xlt_advise::exception)\n  {\n    GD_FINFO_TRACE(\"loading %s\", s);\n\n    \/\/ Clear the error flags from previous runs.\n    \/\/\n    \/\/ FIXME: This should be done in libltdl itself.  The problem\n    \/\/ probably arose from our patches to preserve the first error\n    \/\/ when traversing the user path: now, even on success, the error\n    \/\/ flag remains set, and the following run is hindered by it.  We\n    \/\/ need to complete this patch with a means to ensure that the\n    \/\/ error flags is restored to its previous state (typically\n    \/\/ no-error) when eventually we managed to load the file.\n    lt_dlerror();\n\n    lt_dlhandle res = 0;\n    \/\/ We cannot simply use search_file in file_library, because we\n    \/\/ don't know the extension of the file we are looking for (*.la,\n    \/\/ *.so, *.dyld etc.).  That's an implementation detail that ltdl\n    \/\/ saves us from.\n    if (path_.search_path_get().empty() || libport::path(s).absolute_get())\n      res = dlopen_(s);\n    else\n      foreach (const libport::path& p, path_.search_path_get())\n        if ((res = dlopen_(p \/ s)))\n          break;\n\n    if (!res)\n      fail(libport::format(\"failed to open %s\", s));\n\n    return res;\n  }\n\n\n  \/\/\/ Throw an exception, or exit with exit_failure_ if nonnull.\n  ATTRIBUTE_NORETURN\n  void\n  xlt_advise::fail(std::string msg)\n    throw(xlt_advise::exception)\n  {\n    msg += \": \";\n    const char* err = lt_dlerror();\n    msg += err ? err : \"(no available error message)\";\n    throw exception(msg);\n  }\n\n\n\n  \/*-------------.\n  | xlt_handle.  |\n  `-------------*\/\n\n  xlt_handle::xlt_handle(lt_dlhandle h)\n    : handle(h)\n  {}\n\n  xlt_handle::~xlt_handle()\n  {\n    \/\/ FIXME: We can't close -- yet.  We need to keep track of the\n    \/\/ number of trackers.  Otherwise a simple \"handle h =\n    \/\/ advise.open\" will close the handle when cleaning the temporary\n    \/\/ made by \"advise.open\".\n\n    \/\/ close();\n  }\n\n  void\n  xlt_handle::close()\n    throw(xlt_handle::exception)\n  {\n    if (handle)\n    {\n      int errors = lt_dlclose(handle);\n      handle = 0;\n      if (errors)\n        fail(\"cannot close\");\n    }\n  }\n\n  void\n  xlt_handle::detach()\n  {\n    aver(handle);\n    handle = 0;\n  }\n\n  void\n  xlt_handle::attach(lt_dlhandle h)\n  {\n    aver(!handle);\n    handle = h;\n  }\n\n  \/\/\/ Throw an exception, or exit with exit_failure_ if nonnull.\n  ATTRIBUTE_NORETURN\n  void\n  xlt_handle::fail(const std::string& msg)\n    throw(xlt_advise::exception)\n  {\n    xlt_advise::fail(msg);\n  }\n\n\n  \/*-------------.\n  | Standalone.  |\n  `-------------*\/\n\n  xlt_handle\n  xlt_openext(const std::string& s, bool global, int exit_failure)\n    throw (xlt_advise::exception)\n  {\n    try\n    {\n      return xlt_advise().global(global).ext().open(s);\n    }\n    catch (std::exception& s)\n    {\n      std::cerr << libport::program_name()\n                << \": \"\n                << s.what()\n                << std::endl\n                << libport::exit(exit_failure);\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\/* $Id:  *\/\n\n\/\/____________________________________________________________________\n\/\/                                                                          \n\/\/ T0 - T0. \n\/\/\n\/\/ This class is a singleton that handles various parameters of\n\/\/ the T0 detectors.  \n\/\/ Eventually, this class will use the Conditions DB to get the\n\/\/ various parameters, which code can then request from here.\n\/\/                                                       \n#include \"AliT0.h\"\n#include \"AliLog.h\"\t\t  \n#include \"AliT0Parameters.h\"\t  \n#include \"AliT0CalibData.h\"   \n#include \"AliT0CalibWalk.h\"   \n#include \"AliT0CalibTimeEq.h\"   \n#include \"AliT0CalibLatency.h\"   \n#include \"AliT0LookUpKey.h\"\n#include \"AliT0LookUpValue.h\"\n#include <AliCDBManager.h>        \n#include <AliCDBEntry.h>          \n#include <AliCDBStorage.h>  \n#include <TMath.h>\n#include <TSystem.h>\n\/\/#include <Riostream.h>\n#include <TGeoManager.h>\n#include <TGeoPhysicalNode.h>\n#include <TGeoMatrix.h>\n#include <AliGeomManager.h>\n\nAliT0CalibTimeEq* AliT0Parameters::fgCalibData = 0;\nAliT0CalibData* AliT0Parameters::fgLookUp = 0;\nAliT0CalibWalk* AliT0Parameters::fgSlewCorr =0;\nAliT0CalibLatency *AliT0Parameters::fgLatency=0;\n\/\/====================================================================\nusing std::cout;\nClassImp(AliT0Parameters)\n#if 0\n  ; \/\/ This is here to keep Emacs for indenting the next line\n#endif\n\n\/\/____________________________________________________________________\nAliT0Parameters* AliT0Parameters::fgInstance = 0;\n\/\/____________________________________________________________________\nAliT0Parameters* AliT0Parameters::Instance() \n{\n  \/\/ Get static instance \n  if (!fgInstance) {\n    fgInstance = new AliT0Parameters;\n  }\n  return fgInstance;\n}\n\n\/\/____________________________________________________________________\nAliT0Parameters::AliT0Parameters()\n  :fIsInit(kFALSE),\n   fPh2Mip(0),fmV2Mip(0),\n   fChannelWidth(0),fmV2Channel(0),\n   fQTmin(0),fQTmax(0),\n   fAmpLEDRec(0), \n   fPMTeff(),\n   fWalk(0),\n   fQTC(0),\n   fAmpLED(0),\n   fTimeDelayCFD(0), \n \/\/  fTimeV0(0), \n   fTimeDelayTVD(0),\n   fMeanT0(512),\n   fMeanVertex(0),\n   fLatencyHPTDC(0),\n   fLatencyL1(0),\n   fLatencyL1A(0),\n   fLatencyL1C(0),\n   fLookUp(0),\n   fNumberOfTRMs(2),\n   fCalibentry(), \n   fLookUpentry(),\n   fSlewCorr(),\n   fLatency()\n  \n{\n  \/\/ Default constructor \n  for (Int_t ipmt=0; ipmt<24; ipmt++)\n    {\n      SetPh2Mip();      \n      SetmV2Mip();      \n      SetChannelWidth();\n      SetmV2channel();\n      SetQTmin();\n      SetQTmax();\n      SetPMTeff(ipmt);\n    }\n  SetTimeDelayTVD();\n  SetZposition();\n    \n}\n\n\/\/__________________________________________________________________\nvoid\nAliT0Parameters::Init()\n{\n  \/\/ Initialize the parameters manager.  We need to get stuff from the\n  \/\/ CDB here. \n   if (fIsInit) return;\n\n   AliCDBManager *stor =AliCDBManager::Instance();\n   \/\/time equalizing\n   fCalibentry  = stor->Get(\"T0\/Calib\/TimeDelay\");\n   if (fCalibentry)\n     fgCalibData  = (AliT0CalibTimeEq*)fCalibentry->GetObject();\n   else {\n         AliFatal(\" ALARM !!!! No time delays in CDB \"); \n     fIsInit = kFALSE;\n     return;\n   }\n \/\/slewing correction\n  fSlewCorr  = stor->Get(\"T0\/Calib\/Slewing_Walk\");\n  if (fSlewCorr){\n    fgSlewCorr  = (AliT0CalibWalk*)fSlewCorr->GetObject();\n  }\n  else {\n      AliFatal(\" ALARM !!!! No slewing correction in CDB \"); \n    fIsInit = kFALSE;\n    return;\n  }\n  \/\/lookup table\n  fLookUpentry  = stor->Get(\"T0\/Calib\/LookUp_Table\");\n  if (fLookUpentry){\n    fgLookUp  = (AliT0CalibData*)fLookUpentry->GetObject();\n  }\n  else {\n     AliFatal(\" ALARM !!!! No Lookup table  in CDB \"); \n    fIsInit = kFALSE;\n    return;\n  }\n  \/\/latency\n  \n fLatency  = stor->Get(\"T0\/Calib\/Latency\");\n  if (fLatency){\n    fgLatency  = (AliT0CalibLatency*)fLatency->GetObject();\n  }\n  else {\n     AliWarning(\" !!! no latency  in CDB \"); \n    return;\n  }\n  \nfIsInit = kTRUE;\n}\n\n\n\/\/__________________________________________________________________\n\nvoid AliT0Parameters::InitIfOnline()\n{\n\/\/ should be used in online\n\/\/ for switching to this one should write\n  \/\/ AliT0RawReader myrawreader(rawReader);\n\/\/\tmyrawreader.SetOnlineMode(kTRUE);\n  \n  if (fIsInit) return;\n  \/\/standart configuration (used for simulation)\n  \/\/Int_t trm=0; Int_t tdc=0; Int_t chain=0; Int_t channel=0;\n  \/\/ configuration for test Jun07.\n  fgLookUp = new AliT0CalibData(\"T0\");\n  \n  fNumberOfTRMs = 1;\n  fgLookUp-> SetNumberOfTRMs(fNumberOfTRMs);\n  Int_t trm=7; Int_t tdc=0; Int_t chain=0; Int_t channel=0;\n  for (Int_t ik=0; ik<105; ik++)\n    {\n      AliT0LookUpKey * lookkey= new AliT0LookUpKey();\n      AliT0LookUpValue * lookvalue= new AliT0LookUpValue();\n      lookvalue->SetTRM(trm);\n      lookvalue->SetTDC(tdc);\n      lookvalue->SetChain(chain);\n      lookvalue->SetChannel(channel);\n      lookkey->SetKey(ik);\n      fgLookUp->GetMapLookup()->Add((TObject*)lookvalue,(TObject*)lookkey);\t\n      if (channel<6) channel +=2;\n      else {channel = 0; tdc++;}\n      if(ik==56) { tdc=0; channel=0; chain = 1;}\n    }\n  \/\/2 recent open channels\n  trm=7; tdc=14; channel=2; chain=0; \n  for (Int_t ik=105; ik<107; ik++)\n    {\n      AliT0LookUpKey * lookkey= new AliT0LookUpKey();\n      AliT0LookUpValue * lookvalue= new AliT0LookUpValue();\n      \n      lookvalue->SetTRM(trm);\n      lookvalue->SetTDC(tdc);\n      lookvalue->SetChain(chain);\n      lookvalue->SetChannel(channel);\n      lookkey->SetKey(ik);\n      fgLookUp->GetMapLookup()->Add((TObject*)lookvalue,(TObject*)lookkey);\t\n      if (channel<6) channel +=2;\n      else {channel = 0; tdc++;}\n    }\n  \n  fIsInit=kTRUE;\n}\n\/\/__________________________________________________________________\nFloat_t\nAliT0Parameters::GetTimeDelayCFD(Int_t ipmt) \n  {\n  \/\/ return time delay for CFD channel\n   \/\/ \n  if (!fCalibentry) \n    {\n      fTimeDelayCFD = 1000+ipmt*100;\n      return fTimeDelayCFD;\n    }\n   \n  return fgCalibData->GetTimeEq(ipmt);\n}\n\/\/__________________________________________________________________\nFloat_t\nAliT0Parameters::GetCFD(Int_t ipmt) \n  {\n  \/\/ return  CFD channel\n   \n    return fgCalibData->GetCFDvalue(ipmt,0);\n}\n\n\/\/__________________________________________________________________\nFloat_t\nAliT0Parameters::GetLatencyHPTDC() \n  {\n  \/\/ return LatencyHPTDC for CFD channel\n  if (!fLatency) \n    {\n      fLatencyHPTDC=9000.;\n      return fLatencyHPTDC;\n    }\n   \n  return fgLatency->GetLatencyHPTDC();\n}\n\/\/__________________________________________________________________\nFloat_t\nAliT0Parameters::GetLatencyL1() \n  {\n  \/\/ return time delay for CFD channel\n   \n  return fgLatency->GetLatencyL1();\n}\n\n\/\/__________________________________________________________________\nFloat_t\nAliT0Parameters::GetLatencyL1A() \n  {\n  \/\/ return time delay for CFD channel\n   \n  return fgLatency->GetLatencyL1A();\n}\n\n\/\/__________________________________________________________________\nFloat_t\nAliT0Parameters::GetLatencyL1C() \n  {\n  \/\/ return time delay for CFD channel\n   \n  return fgLatency->GetLatencyL1C();\n}\n\/\/__________________________________________________________________\n\nFloat_t\nAliT0Parameters:: GetMeanVertex()\n{ \n  if (!fCalibentry) \n    {\n      fMeanVertex=0;\n      return fMeanVertex;\n    }\n   \n  return fgCalibData->GetMeanVertex();\n}\n\/\/__________________________________________________________________\n\nTGraph *AliT0Parameters::GetAmpLEDRec(Int_t ipmt) const\n{\n   if (!fSlewCorr) {\n     AliError(\"No slewing correction is available!\");\n     return  (TGraph*)fAmpLEDRec.At(ipmt); \n  } \n  return fgSlewCorr -> GetAmpLEDRec(ipmt) ;\n}\n\n\/\/__________________________________________________________________\n\nTGraph *AliT0Parameters::GetWalk(Int_t ipmt) const\n{\n  if (!fSlewCorr) {\n    AliError(\"No walk correction is available!\");\n    return  (TGraph*)fWalk.At(ipmt); \n  } \n  return fgSlewCorr -> GetWalk(ipmt) ;\n}\n\n\/\/__________________________________________________________________\n\nTGraph *AliT0Parameters::GetQTC(Int_t ipmt) const\n{\n  if (!fSlewCorr) {\n    AliError(\"No walk correction is available!\");\n    \/\/    return  (TGraph*)fQTC.At(ipmt); \n   return  0; \n  } \n  return fgSlewCorr -> GetQTC(ipmt) ;\n}\n\n\/\/__________________________________________________________________\nTGraph *AliT0Parameters::GetAmpLED(Int_t ipmt) const\n{\n  if (!fSlewCorr) {\n    AliError(\"No walk correction is available!\");\n    \/\/    return  (TGraph*)fQTC.At(ipmt); \n   return  0; \n  } \n  return fgSlewCorr -> GetAmpLED(ipmt) ;\n}\n\n\/\/__________________________________________________________________\nvoid \nAliT0Parameters::SetPMTeff(Int_t ipmt)\n{\n  Float_t lambda[50];\n  Float_t eff[50 ] = {0,        0,       0.23619,  0.202909, 0.177913, \n\t\t    0.175667, 0.17856, 0.190769, 0.206667, 0.230286,\n\t\t    0.252276, 0.256267,0.26,     0.27125,  0.281818,\n\t\t    0.288118, 0.294057,0.296222, 0.301622, 0.290421, \n\t\t    0.276615, 0.2666,  0.248,    0.23619,  0.227814, \n\t\t    0.219818, 0.206667,0.194087, 0.184681, 0.167917, \n\t\t    0.154367, 0.1364,  0.109412, 0.0834615,0.0725283, \n\t\t    0.0642963,0.05861, 0.0465,   0.0413333,0.032069, \n\t\t    0.0252203,0.02066, 0.016262, 0.012,    0.00590476,\n\t\t    0.003875, 0.00190, 0,        0,        0          } ;\n  for (Int_t i=0; i<50; i++) lambda[i]=200+10*i; \n\n  TGraph* gr = new TGraph(50,lambda,eff);\n  fPMTeff.AddAtAndExpand(gr,ipmt);\n}\n\/\/________________________________________________________________\n\nInt_t \nAliT0Parameters::GetChannel(Int_t trm,  Int_t tdc, Int_t chain, Int_t channel)\n{\n\n  if (fgLookUp) {\n    AliT0LookUpValue key(trm,tdc,chain,channel);\n      AliT0LookUpKey *val = (AliT0LookUpKey*) fgLookUp->GetMapLookup()->GetValue((TObject*)&key);\n      \/\/ AliT0LookUpKey *val = (AliT0LookUpKey*) fLookUp.GetValue((TObject*)&key);\n    if (val )\n      return val->GetKey();\n    else {\n      AliWarning(Form(\"No such address (%d %d %d %d)!\",trm,tdc,chain,channel));\n      return -1;\n    }\n  }\n  else {\n    AliError(\"No look up table has been loader!\");\n    return -1;\n  }\n\n}\n\/\/__________________________________________________________________\nTMap *AliT0Parameters::GetMapLookup()\n{\n  if (!fgLookUp){\n    cout<<\" No look up table in OCDB\";\n    return 0;\n  }\n  return   fgLookUp->GetMapLookup();\n}\n\/\/__________________________________________________________________\n\nInt_t\nAliT0Parameters::GetNumberOfTRMs() \n{\n  \/\/ return number of trms\n  \/\/ \n  if (!fgLookUp) {\n    \/\/  fNumberOfTRMs = 2;\n    return  fNumberOfTRMs;\n  } \n  return  fgLookUp ->GetNumberOfTRMs();\n}\n\/*\n\/\/________________________________________________________________________________\nDouble_t AliT0Parameters::GetZPosition(const char* symname){\n\/\/ Get the global z coordinate of the given T0 alignable volume\n\/\/\n  Double_t *tr = AliGeomManager::GetMatrix(symname)->GetTranslation();\n\n  return tr[2];\n}\n*\/\n\/\/________________________________________________________________________________\nDouble_t AliT0Parameters::GetZPosition(const char* symname){\n\/\/ Get the global z coordinate of the given T0 alignable volume\n\/\/\n  Double_t *tr;\n  TGeoPNEntry *pne = gGeoManager->GetAlignableEntry(symname);\n  if (!pne) return 0;\n  \n\n  TGeoPhysicalNode *pnode = pne->GetPhysicalNode();\n  if(pnode){\n          TGeoHMatrix* hm = pnode->GetMatrix();\n           tr = hm->GetTranslation();\n  }else{\n          const char* path = pne->GetTitle();\n          if(!gGeoManager->cd(path)){\n                  AliErrorClass(Form(\"Volume path %s not valid!\",path));\n                  return 0;\n          }\n         tr = gGeoManager->GetCurrentMatrix()->GetTranslation();\n  }\n  return tr[2];\n\n}\n\/\/________________________________________________________________________________\n\nDouble_t AliT0Parameters::GetZPositionShift(const char* symname)\n{\n\/\/ Get the global z coordinate of the given T0 alignable volume\n\/\/\n  Double_t *tr = AliGeomManager::GetMatrix(symname)->GetTranslation();\n\n  TGeoHMatrix origmat;\n  AliGeomManager::GetOrigGlobalMatrix(symname,origmat);\n  Double_t *otr = origmat.GetTranslation();\n\n  return (tr[2]-otr[2]);\n}\n\n<commit_msg>online LUT with 2 TRMs for RUN2<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\/\/                                                                          \n\/\/ T0 - T0. \n\/\/\n\/\/ This class is a singleton that handles various parameters of\n\/\/ the T0 detectors.  \n\/\/ Eventually, this class will use the Conditions DB to get the\n\/\/ various parameters, which code can then request from here.\n\/\/                                                       \n#include \"AliT0.h\"\n#include \"AliLog.h\"\t\t  \n#include \"AliT0Parameters.h\"\t  \n#include \"AliT0CalibData.h\"   \n#include \"AliT0CalibWalk.h\"   \n#include \"AliT0CalibTimeEq.h\"   \n#include \"AliT0CalibLatency.h\"   \n#include \"AliT0LookUpKey.h\"\n#include \"AliT0LookUpValue.h\"\n#include <AliCDBManager.h>        \n#include <AliCDBEntry.h>          \n#include <AliCDBStorage.h>  \n#include <TMath.h>\n#include <TSystem.h>\n\/\/#include <Riostream.h>\n#include <TGeoManager.h>\n#include <TGeoPhysicalNode.h>\n#include <TGeoMatrix.h>\n#include <AliGeomManager.h>\n\nAliT0CalibTimeEq* AliT0Parameters::fgCalibData = 0;\nAliT0CalibData* AliT0Parameters::fgLookUp = 0;\nAliT0CalibWalk* AliT0Parameters::fgSlewCorr =0;\nAliT0CalibLatency *AliT0Parameters::fgLatency=0;\n\/\/====================================================================\nusing std::cout;\nClassImp(AliT0Parameters)\n#if 0\n  ; \/\/ This is here to keep Emacs for indenting the next line\n#endif\n\n\/\/____________________________________________________________________\nAliT0Parameters* AliT0Parameters::fgInstance = 0;\n\/\/____________________________________________________________________\nAliT0Parameters* AliT0Parameters::Instance() \n{\n  \/\/ Get static instance \n  if (!fgInstance) {\n    fgInstance = new AliT0Parameters;\n  }\n  return fgInstance;\n}\n\n\/\/____________________________________________________________________\nAliT0Parameters::AliT0Parameters()\n  :fIsInit(kFALSE),\n   fPh2Mip(0),fmV2Mip(0),\n   fChannelWidth(0),fmV2Channel(0),\n   fQTmin(0),fQTmax(0),\n   fAmpLEDRec(0), \n   fPMTeff(),\n   fWalk(0),\n   fQTC(0),\n   fAmpLED(0),\n   fTimeDelayCFD(0), \n \/\/  fTimeV0(0), \n   fTimeDelayTVD(0),\n   fMeanT0(512),\n   fMeanVertex(0),\n   fLatencyHPTDC(0),\n   fLatencyL1(0),\n   fLatencyL1A(0),\n   fLatencyL1C(0),\n   fLookUp(0),\n   fNumberOfTRMs(2),\n   fCalibentry(), \n   fLookUpentry(),\n   fSlewCorr(),\n   fLatency()\n  \n{\n  \/\/ Default constructor \n  for (Int_t ipmt=0; ipmt<24; ipmt++)\n    {\n      SetPh2Mip();      \n      SetmV2Mip();      \n      SetChannelWidth();\n      SetmV2channel();\n      SetQTmin();\n      SetQTmax();\n      SetPMTeff(ipmt);\n    }\n  SetTimeDelayTVD();\n  SetZposition();\n    \n}\n\n\/\/__________________________________________________________________\nvoid\nAliT0Parameters::Init()\n{\n  \/\/ Initialize the parameters manager.  We need to get stuff from the\n  \/\/ CDB here. \n   if (fIsInit) return;\n\n   AliCDBManager *stor =AliCDBManager::Instance();\n   \/\/time equalizing\n   fCalibentry  = stor->Get(\"T0\/Calib\/TimeDelay\");\n   if (fCalibentry)\n     fgCalibData  = (AliT0CalibTimeEq*)fCalibentry->GetObject();\n   else {\n         AliFatal(\" ALARM !!!! No time delays in CDB \"); \n     fIsInit = kFALSE;\n     return;\n   }\n \/\/slewing correction\n  fSlewCorr  = stor->Get(\"T0\/Calib\/Slewing_Walk\");\n  if (fSlewCorr){\n    fgSlewCorr  = (AliT0CalibWalk*)fSlewCorr->GetObject();\n  }\n  else {\n      AliFatal(\" ALARM !!!! No slewing correction in CDB \"); \n    fIsInit = kFALSE;\n    return;\n  }\n  \/\/lookup table\n  fLookUpentry  = stor->Get(\"T0\/Calib\/LookUp_Table\");\n  if (fLookUpentry){\n    fgLookUp  = (AliT0CalibData*)fLookUpentry->GetObject();\n  }\n  else {\n     AliFatal(\" ALARM !!!! No Lookup table  in CDB \"); \n    fIsInit = kFALSE;\n    return;\n  }\n  \/\/latency\n  \n fLatency  = stor->Get(\"T0\/Calib\/Latency\");\n  if (fLatency){\n    fgLatency  = (AliT0CalibLatency*)fLatency->GetObject();\n  }\n  else {\n     AliWarning(\" !!! no latency  in CDB \"); \n    return;\n  }\n  \nfIsInit = kTRUE;\n}\n\n\n\/\/__________________________________________________________________\n\nvoid AliT0Parameters::InitIfOnline()\n{\n\/\/ should be used in online\n\/\/ for switching to this one should write\n  \/\/ AliT0RawReader myrawreader(rawReader);\n\/\/\tmyrawreader.SetOnlineMode(kTRUE);\n  \n  if (fIsInit) return;\n  \/\/standart configuration (used for simulation)\n  \/\/Int_t trm=0; Int_t tdc=0; Int_t chain=0; Int_t channel=0;\n  \/\/ configuration for test Jun07.\n  fgLookUp = new AliT0CalibData(\"T0\");\n  \n  fNumberOfTRMs = 2;\n  fgLookUp-> SetNumberOfTRMs(fNumberOfTRMs);\n  Int_t trm=7;\n  Int_t tdc=0;  Int_t channel=0;\n  Int_t ikey=0; Int_t chain=0;\n  for (Int_t ik=0; ik<211; ik++)\n    {\n      AliT0LookUpKey * lookkey= new AliT0LookUpKey();\n      AliT0LookUpValue * lookvalue= new AliT0LookUpValue();\n      lookvalue->SetTRM(trm);\n      lookvalue->SetTDC(tdc);\n      lookvalue->SetChain(chain);\n      lookvalue->SetChannel(channel);\n      lookkey->SetKey(ik);\n      fgLookUp->GetMapLookup()->Add((TObject*)lookvalue,(TObject*)lookkey);\n      printf(\" LookUp ik %i trm %i chain %i tdc %i  channel %i\\n\",ik, trm, chain, tdc, channel);\t\n      if (channel<6) channel +=2;\n      else {channel = 0; tdc++;}\n      if (ik==104) {trm=7; chain=0; tdc=14; channel=2;}\n      if (ik==105) {trm=7; chain=0; tdc=14; channel=4;}\n      if (ik==56) {trm=7; chain=1; tdc=0; channel=0;}\n      if (ik==106) { trm=9; chain=0; tdc=0; channel=0;}\n      if (ik==162) { trm=9; chain=1; tdc=0; channel=0;}\n       ikey++;     \n    }\n  \n  fIsInit=kTRUE;\n}\n\/\/__________________________________________________________________\nFloat_t\nAliT0Parameters::GetTimeDelayCFD(Int_t ipmt) \n  {\n  \/\/ return time delay for CFD channel\n   \/\/ \n  if (!fCalibentry) \n    {\n      fTimeDelayCFD = 1000+ipmt*100;\n      return fTimeDelayCFD;\n    }\n   \n  return fgCalibData->GetTimeEq(ipmt);\n}\n\/\/__________________________________________________________________\nFloat_t\nAliT0Parameters::GetCFD(Int_t ipmt) \n  {\n  \/\/ return  CFD channel\n   \n    return fgCalibData->GetCFDvalue(ipmt,0);\n}\n\n\/\/__________________________________________________________________\nFloat_t\nAliT0Parameters::GetLatencyHPTDC() \n  {\n  \/\/ return LatencyHPTDC for CFD channel\n  if (!fLatency) \n    {\n      fLatencyHPTDC=9000.;\n      return fLatencyHPTDC;\n    }\n   \n  return fgLatency->GetLatencyHPTDC();\n}\n\/\/__________________________________________________________________\nFloat_t\nAliT0Parameters::GetLatencyL1() \n  {\n  \/\/ return time delay for CFD channel\n   \n  return fgLatency->GetLatencyL1();\n}\n\n\/\/__________________________________________________________________\nFloat_t\nAliT0Parameters::GetLatencyL1A() \n  {\n  \/\/ return time delay for CFD channel\n   \n  return fgLatency->GetLatencyL1A();\n}\n\n\/\/__________________________________________________________________\nFloat_t\nAliT0Parameters::GetLatencyL1C() \n  {\n  \/\/ return time delay for CFD channel\n   \n  return fgLatency->GetLatencyL1C();\n}\n\/\/__________________________________________________________________\n\nFloat_t\nAliT0Parameters:: GetMeanVertex()\n{ \n  if (!fCalibentry) \n    {\n      fMeanVertex=0;\n      return fMeanVertex;\n    }\n   \n  return fgCalibData->GetMeanVertex();\n}\n\/\/__________________________________________________________________\n\nTGraph *AliT0Parameters::GetAmpLEDRec(Int_t ipmt) const\n{\n   if (!fSlewCorr) {\n     AliError(\"No slewing correction is available!\");\n     return  (TGraph*)fAmpLEDRec.At(ipmt); \n  } \n  return fgSlewCorr -> GetAmpLEDRec(ipmt) ;\n}\n\n\/\/__________________________________________________________________\n\nTGraph *AliT0Parameters::GetWalk(Int_t ipmt) const\n{\n  if (!fSlewCorr) {\n    AliError(\"No walk correction is available!\");\n    return  (TGraph*)fWalk.At(ipmt); \n  } \n  return fgSlewCorr -> GetWalk(ipmt) ;\n}\n\n\/\/__________________________________________________________________\n\nTGraph *AliT0Parameters::GetQTC(Int_t ipmt) const\n{\n  if (!fSlewCorr) {\n    AliError(\"No walk correction is available!\");\n    \/\/    return  (TGraph*)fQTC.At(ipmt); \n   return  0; \n  } \n  return fgSlewCorr -> GetQTC(ipmt) ;\n}\n\n\/\/__________________________________________________________________\nTGraph *AliT0Parameters::GetAmpLED(Int_t ipmt) const\n{\n  if (!fSlewCorr) {\n    AliError(\"No walk correction is available!\");\n    \/\/    return  (TGraph*)fQTC.At(ipmt); \n   return  0; \n  } \n  return fgSlewCorr -> GetAmpLED(ipmt) ;\n}\n\n\/\/__________________________________________________________________\nvoid \nAliT0Parameters::SetPMTeff(Int_t ipmt)\n{\n  Float_t lambda[50];\n  Float_t eff[50 ] = {0,        0,       0.23619,  0.202909, 0.177913, \n\t\t    0.175667, 0.17856, 0.190769, 0.206667, 0.230286,\n\t\t    0.252276, 0.256267,0.26,     0.27125,  0.281818,\n\t\t    0.288118, 0.294057,0.296222, 0.301622, 0.290421, \n\t\t    0.276615, 0.2666,  0.248,    0.23619,  0.227814, \n\t\t    0.219818, 0.206667,0.194087, 0.184681, 0.167917, \n\t\t    0.154367, 0.1364,  0.109412, 0.0834615,0.0725283, \n\t\t    0.0642963,0.05861, 0.0465,   0.0413333,0.032069, \n\t\t    0.0252203,0.02066, 0.016262, 0.012,    0.00590476,\n\t\t    0.003875, 0.00190, 0,        0,        0          } ;\n  for (Int_t i=0; i<50; i++) lambda[i]=200+10*i; \n\n  TGraph* gr = new TGraph(50,lambda,eff);\n  fPMTeff.AddAtAndExpand(gr,ipmt);\n}\n\/\/________________________________________________________________\n\nInt_t \nAliT0Parameters::GetChannel(Int_t trm,  Int_t tdc, Int_t chain, Int_t channel)\n{\n\n  if (fgLookUp) {\n    AliT0LookUpValue key(trm,tdc,chain,channel);\n      AliT0LookUpKey *val = (AliT0LookUpKey*) fgLookUp->GetMapLookup()->GetValue((TObject*)&key);\n      \/\/ AliT0LookUpKey *val = (AliT0LookUpKey*) fLookUp.GetValue((TObject*)&key);\n    if (val )\n      return val->GetKey();\n    else {\n      AliWarning(Form(\"No such address (%d %d %d %d)!\",trm,tdc,chain,channel));\n      return -1;\n    }\n  }\n  else {\n    AliError(\"No look up table has been loader!\");\n    return -1;\n  }\n\n}\n\/\/__________________________________________________________________\nTMap *AliT0Parameters::GetMapLookup()\n{\n  if (!fgLookUp){\n    cout<<\" No look up table in OCDB\";\n    return 0;\n  }\n  return   fgLookUp->GetMapLookup();\n}\n\/\/__________________________________________________________________\n\nInt_t\nAliT0Parameters::GetNumberOfTRMs() \n{\n  \/\/ return number of trms\n  \/\/ \n  if (!fgLookUp) {\n    \/\/  fNumberOfTRMs = 2;\n    return  fNumberOfTRMs;\n  } \n  return  fgLookUp ->GetNumberOfTRMs();\n}\n\/*\n\/\/________________________________________________________________________________\nDouble_t AliT0Parameters::GetZPosition(const char* symname){\n\/\/ Get the global z coordinate of the given T0 alignable volume\n\/\/\n  Double_t *tr = AliGeomManager::GetMatrix(symname)->GetTranslation();\n\n  return tr[2];\n}\n*\/\n\/\/________________________________________________________________________________\nDouble_t AliT0Parameters::GetZPosition(const char* symname){\n\/\/ Get the global z coordinate of the given T0 alignable volume\n\/\/\n  Double_t *tr;\n  TGeoPNEntry *pne = gGeoManager->GetAlignableEntry(symname);\n  if (!pne) return 0;\n  \n\n  TGeoPhysicalNode *pnode = pne->GetPhysicalNode();\n  if(pnode){\n          TGeoHMatrix* hm = pnode->GetMatrix();\n           tr = hm->GetTranslation();\n  }else{\n          const char* path = pne->GetTitle();\n          if(!gGeoManager->cd(path)){\n                  AliErrorClass(Form(\"Volume path %s not valid!\",path));\n                  return 0;\n          }\n         tr = gGeoManager->GetCurrentMatrix()->GetTranslation();\n  }\n  return tr[2];\n\n}\n\/\/________________________________________________________________________________\n\nDouble_t AliT0Parameters::GetZPositionShift(const char* symname)\n{\n\/\/ Get the global z coordinate of the given T0 alignable volume\n\/\/\n  Double_t *tr = AliGeomManager::GetMatrix(symname)->GetTranslation();\n\n  TGeoHMatrix origmat;\n  AliGeomManager::GetOrigGlobalMatrix(symname,origmat);\n  Double_t *otr = origmat.GetTranslation();\n\n  return (tr[2]-otr[2]);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <cassert>\n#include <memory>\n\n#include \"pugixml.hpp\"\n\n#include \"blitz_typedefs.hpp\"\n#include \"constants.hpp\"\n#include \"global_config.hpp\"\n#include \"mesh.hpp\"\n#include \"output_interface.hpp\"\n\nnamespace mocc {\n\n    \/**\n     * This class provides a storage scheme for the correction factors needed to\n     * perform corrected diamond difference. The CDD Sn and MoC sweepers must be\n     * provided with a reference to an object of this class to access and store\n     * correction factors, respectively. Due to the relatively high\n     * dimensionality of the data (space, angle, energy and cardinal direction\n     * [X|Y]), instead of using a multidimensional array, we will instead use\n     * accessor functions to get the data out of a dense linear representation.\n     *\/\n    class CorrectionData : public HasOutput {\n    public:\n        CorrectionData( ):\n            nreg_( 0 ),\n            nang_( 0 ),\n            ngroup_( 0 )\n        {\n            return;\n        }\n\n        CorrectionData( Mesh mesh, size_t nang, size_t ngroup ):\n            nreg_( mesh.n_pin() ),\n            nx_( mesh.nx() ),\n            ny_( mesh.ny() ),\n            nz_( mesh.nz() ),\n            nang_( nang ),\n            ngroup_( ngroup ),\n            alpha_( ngroup_, nang_, nreg_, 2 ),\n            beta_( ngroup_, nang_, nreg_ )\n        {\n            assert( alpha_.size() > 0 );\n            assert( beta_.size() > 0 );\n            assert( nx_*ny_*nz_ == nreg_ );\n            auto slice = alpha_(0, 0, blitz::Range::all(), blitz::Range::all());\n            assert( slice.isStorageContiguous() );\n\n            alpha_ = 0.5;\n            beta_ = 1.0;\n\n            return;\n        }\n\n        ~CorrectionData() { }\n\n        size_t size() {\n            return alpha_.size();\n        }\n\n\n        inline real_t& alpha( int reg, int ang, int group, Normal norm )\n        {\n            return alpha_( group, ang, reg, (int)norm );\n        }\n\n        inline const real_t alpha( int reg, int ang, int group, \n                Normal norm ) const\n        {\n            return alpha_( group, ang, reg, (int)norm );\n        }\n\n        inline real_t& beta( int reg, int ang, int group ) {\n            return beta_( group, ang, reg );\n        }\n\n        inline const real_t beta( int reg, int ang, int group ) const\n        {\n            return beta_( group, ang, reg );\n        }\n\n        \/**\n         * \\brief Read correction factors from one or more HDF5 files, as\n         * specified by <data \/> tags\n         *\/\n        void from_data( const pugi::xml_node &input );\n\n        void output( H5Node &file ) const;\n        \n    private:\n        int nreg_;\n        int nx_;\n        int ny_;\n        int nz_;\n        int nang_;\n        int ngroup_;\n\n        ArrayB4 alpha_;\n        ArrayB3 beta_;\n    };\n\n    typedef std::unique_ptr<CorrectionData> UP_CorrectionData_t;\n}\n<commit_msg>Fix <data> tag in CorrectionData documentation<commit_after>#pragma once\n\n#include <cassert>\n#include <memory>\n\n#include \"pugixml.hpp\"\n\n#include \"blitz_typedefs.hpp\"\n#include \"constants.hpp\"\n#include \"global_config.hpp\"\n#include \"mesh.hpp\"\n#include \"output_interface.hpp\"\n\nnamespace mocc {\n\n    \/**\n     * This class provides a storage scheme for the correction factors needed to\n     * perform corrected diamond difference. The CDD Sn and MoC sweepers must be\n     * provided with a reference to an object of this class to access and store\n     * correction factors, respectively. Due to the relatively high\n     * dimensionality of the data (space, angle, energy and cardinal direction\n     * [X|Y]), instead of using a multidimensional array, we will instead use\n     * accessor functions to get the data out of a dense linear representation.\n     *\/\n    class CorrectionData : public HasOutput {\n    public:\n        CorrectionData( ):\n            nreg_( 0 ),\n            nang_( 0 ),\n            ngroup_( 0 )\n        {\n            return;\n        }\n\n        CorrectionData( Mesh mesh, size_t nang, size_t ngroup ):\n            nreg_( mesh.n_pin() ),\n            nx_( mesh.nx() ),\n            ny_( mesh.ny() ),\n            nz_( mesh.nz() ),\n            nang_( nang ),\n            ngroup_( ngroup ),\n            alpha_( ngroup_, nang_, nreg_, 2 ),\n            beta_( ngroup_, nang_, nreg_ )\n        {\n            assert( alpha_.size() > 0 );\n            assert( beta_.size() > 0 );\n            assert( nx_*ny_*nz_ == nreg_ );\n            auto slice = alpha_(0, 0, blitz::Range::all(), blitz::Range::all());\n            assert( slice.isStorageContiguous() );\n\n            alpha_ = 0.5;\n            beta_ = 1.0;\n\n            return;\n        }\n\n        ~CorrectionData() { }\n\n        size_t size() {\n            return alpha_.size();\n        }\n\n\n        inline real_t& alpha( int reg, int ang, int group, Normal norm )\n        {\n            return alpha_( group, ang, reg, (int)norm );\n        }\n\n        inline const real_t alpha( int reg, int ang, int group, \n                Normal norm ) const\n        {\n            return alpha_( group, ang, reg, (int)norm );\n        }\n\n        inline real_t& beta( int reg, int ang, int group ) {\n            return beta_( group, ang, reg );\n        }\n\n        inline const real_t beta( int reg, int ang, int group ) const\n        {\n            return beta_( group, ang, reg );\n        }\n\n        \/**\n         * \\brief Read correction factors from one or more HDF5 files, as\n         * specified by \\<data \/\\> tags\n         *\/\n        void from_data( const pugi::xml_node &input );\n\n        void output( H5Node &file ) const;\n        \n    private:\n        int nreg_;\n        int nx_;\n        int ny_;\n        int nz_;\n        int nang_;\n        int ngroup_;\n\n        ArrayB4 alpha_;\n        ArrayB3 beta_;\n    };\n\n    typedef std::unique_ptr<CorrectionData> UP_CorrectionData_t;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ $Id$\n\/\/ Category: physics\n\/\/\n\/\/ See the class description in the header file.\n\n#include \"TG4PhysicsManager.h\"\n#include \"TG4ParticlesManager.h\"\n#include \"TG4G3PhysicsManager.h\"\n#include \"TG4PhysicsConstructorEM.h\"\n#include \"TG4PhysicsConstructorOptical.h\"\n#include \"TG4PhysicsConstructorHadron.h\"\n#include \"TG4PhysicsConstructorSpecialCuts.h\"\n#include \"TG4PhysicsConstructorSpecialControls.h\"\n#include \"TG4G3Cut.h\"\n#include \"TG4G3Control.h\"\n#include \"AliDecayer.h\"\n\n#include <G4ParticleDefinition.hh>\n#include <G4VProcess.hh>\n#include <G4VModularPhysicsList.hh>\n\n#include <TDatabasePDG.h>\n\nTG4PhysicsManager* TG4PhysicsManager::fgInstance = 0;\n\nTG4PhysicsManager::TG4PhysicsManager(G4VModularPhysicsList* physicsList)\n  : fPhysicsList(physicsList),\n    fDecayer(0),\n    fSetEMPhysics(true),\n    fSetOpticalPhysics(false),\n    fSetHadronPhysics(false),\n    fSetSpecialCutsPhysics(false),\n    fSetSpecialControlsPhysics(false)\n\n{ \n\/\/\n  if (fgInstance) {\n    TG4Globals::Exception(\n      \"TG4PhysicsManager: attempt to create two instances of singleton.\");\n  }\n      \n  fgInstance = this;  \n  \n  \/\/ create particles manager\n  fParticlesManager = new TG4ParticlesManager();\n      \n  \/\/ create G3 physics manager\n  fG3PhysicsManager = new TG4G3PhysicsManager();\n\n  \/\/ fill process name map\n  FillProcessMap();\n}\n\nTG4PhysicsManager::TG4PhysicsManager(){\n\/\/\n  delete fDecayer;\n  delete fParticlesManager;\n  delete fG3PhysicsManager;\n}\n\nTG4PhysicsManager::TG4PhysicsManager(const TG4PhysicsManager& right) {\n\/\/ \n  TG4Globals::Exception(\n    \"Attempt to copy TG4PhysicsManager singleton.\");\n}\n\nTG4PhysicsManager::~TG4PhysicsManager() {\n\/\/\n}\n\n\/\/ operators\n\nTG4PhysicsManager& \nTG4PhysicsManager::operator=(const TG4PhysicsManager& right)\n{\n  \/\/ check assignement to self\n  if (this == &right) return *this;\n\n  TG4Globals::Exception(\n    \"Attempt to assign TG4PhysicsManager singleton.\");\n    \n  return *this;  \n}    \n          \n\/\/ private methods\n\nvoid TG4PhysicsManager::FillProcessMap()\n{\n\/\/ Fills fProcessMap.\n\/\/ The default G4 process names are used in the map.\n\/\/ ---\n\n  \/\/ multiple scattering\n  fProcessMap.Add(\"msc\",  kPMultipleScattering);\n  fProcessMap.Add(\"Imsc\", kPMultipleScattering);\n    \n  \/\/ continuous energy loss\n  \/\/ !! including delta rays\n  fProcessMap.Add(\"eIoni\",  kPEnergyLoss);\n  fProcessMap.Add(\"IeIoni\", kPEnergyLoss);\n  fProcessMap.Add(\"LowEnergyIoni\", kPEnergyLoss);\n  fProcessMap.Add(\"hIoni\",  kPEnergyLoss);\n  fProcessMap.Add(\"IhIoni\", kPEnergyLoss);\n  fProcessMap.Add(\"hLowEIoni\", kPEnergyLoss);\n  fProcessMap.Add(\"MuIoni\", kPEnergyLoss);\n  fProcessMap.Add(\"IMuIonisation\", kPEnergyLoss);\n  fProcessMap.Add(\"ionIoni\",  kPEnergyLoss);\n  fProcessMap.Add(\"ionLowEIoni\",  kPEnergyLoss);\n  fProcessMap.Add(\"PAIonisation\",  kPEnergyLoss);\n  \n  \/\/ bending in mag. field\n  \/\/ kPMagneticFieldL\n\n  \/\/ particle decay\n  fProcessMap.Add(\"Decay\", kPDecay);\n  \n  \/\/ photon pair production or\n  \/\/ muon direct pair production\n  fProcessMap.Add(\"conv\", kPPair);\n  fProcessMap.Add(\"LowEnConversion\", kPPair);\n  fProcessMap.Add(\"MuPairProd\", kPPair);\n  fProcessMap.Add(\"IMuPairProduction\", kPPair);\n\n  \/\/ Compton scattering\n  fProcessMap.Add(\"compt\", kPCompton);\n  fProcessMap.Add(\"LowEnCompton\", kPCompton);\n  fProcessMap.Add(\"polarCompt\", kPCompton);\n\n  \/\/ photoelectric effect\n  fProcessMap.Add(\"phot\", kPPhotoelectric);\n  fProcessMap.Add(\"LowEnPhotoElec\", kPPhotoelectric);\n\n  \/\/ bremsstrahlung\n  fProcessMap.Add(\"eBrem\", kPBrem);\n  fProcessMap.Add(\"IeBrem\", kPBrem);\n  fProcessMap.Add(\"MuBrems\", kPBrem);\n  fProcessMap.Add(\"IMuBremsstrahlung\", kPBrem);\n  fProcessMap.Add(\"LowEnBrem\", kPBrem);\n\n  \/\/ delta-ray production\n  \/\/ kPDeltaRay\n  \/\/ has to be distinguished from kPEnergyLoss on flight\n  \n  \/\/ positron annihilation\n  fProcessMap.Add(\"annihil\", kPAnnihilation);\n  fProcessMap.Add(\"Iannihil\", kPAnnihilation);\n\n  \/\/ hadronic interaction\n  \/\/ kPHadronic\n\n  \/\/ nuclear evaporation\n  \/\/ kPEvaporation\n  \n  \/\/ nuclear fission\n  \/\/ kPNuclearFission\n\n  \/\/ nuclear absorption\n  fProcessMap.Add(\"PionMinusAbsorptionAtRest\", kPNuclearAbsorption);\n  fProcessMap.Add(\"PiMinusAbsorptionAtRest\", kPNuclearAbsorption);\n  fProcessMap.Add(\"KaonMinusAbsorption\", kPNuclearAbsorption);         \n  fProcessMap.Add(\"KaonMinusAbsorptionAtRest\", kPNuclearAbsorption);         \n  \n  \/\/ antiproton annihilation\n  fProcessMap.Add(\"AntiProtonAnnihilationAtRest\", kPPbarAnnihilation);\n  \/\/ fProcessMap.Add(\"AntiNeutronAnnihilationAtRest\", not defined);\n\n  \/\/ neutron capture    \n  fProcessMap.Add(\"NeutronCaptureAtRest\", kPNCapture);\n  \/\/ fProcessMap.Add(\"LCapture\", hadron capture not defined);\n\n  \/\/ hadronic elastic incoherent scattering\n  fProcessMap.Add(\"LElastic\", kPHElastic);\n\n  \/\/ hadronic inelastic scattering\n  fProcessMap.Add(\"inelastic\", kPHInhelastic);\n\n  \/\/ muon nuclear interaction\n  fProcessMap.Add(\"MuNucl\", kPMuonNuclear);\n\n  \/\/ exceeded time of flight cut\n  \/\/ kPTOFlimit\n  \n  \/\/ nuclear photofission\n  \/\/ kPPhotoFission\n\n  \/\/ Rayleigh scattering\n  fProcessMap.Add(\"Rayleigh Scattering\", kPRayleigh);\n\n  \/\/ no mechanism is active, usually at the entrance of a new volume\n  fProcessMap.Add(\"Transportation\", kPNull);\n\n  \/\/ particle has fallen below energy threshold and tracking stops\n  \/\/ kPStop\n  \n  \/\/ Cerenkov photon absorption\n  fProcessMap.Add(\"Absorption\", kPLightAbsorption);\n\n  \/\/ Cerenkov photon reflection\/refraction\n  \/\/ kPLightScattering, kPLightReflection, kPLightRefraction\n  \/\/ has to be inquired from the G4OpBoundary process\n\n  \/\/ synchrotron radiation\n  fProcessMap.Add(\"SynchrotronRadiation\", kPSynchrotron);\n}  \n\n\n\/\/ public methods\n\nvoid TG4PhysicsManager::BuildPhysics()\n{\n\/\/ Empty function - not needed in G4.\n\/\/ (Physics is built within \/run\/initialize.)\n\/\/ ---\n\n  TG4Globals::Warning(\n    \"TG4PhysicsManager::BuildPhysics: is empty function in G4 MC.\");\n}    \n\nvoid TG4PhysicsManager::CreatePhysicsConstructors()\n{\n\/\/ Creates the selected physics constructors\n\/\/ and registeres them in the modular physics list.\n\/\/ ---\n\n  \/\/ electromagnetic physics\n  if (fSetEMPhysics) \n    fPhysicsList->RegisterPhysics(new TG4PhysicsConstructorEM());\n\n  \/\/ optical physics\n  if (fSetOpticalPhysics) \n    fPhysicsList->RegisterPhysics(new TG4PhysicsConstructorOptical());\n\n  \/\/ hadron physics\n  if (fSetHadronPhysics) \n    fPhysicsList->RegisterPhysics(new TG4PhysicsConstructorHadron());\n\n  if (fSetSpecialCutsPhysics) \n    fPhysicsList->RegisterPhysics(new TG4PhysicsConstructorSpecialCuts());\n\n  if (fSetSpecialControlsPhysics) \n    fPhysicsList->RegisterPhysics(new TG4PhysicsConstructorSpecialControls());\n\n         \/\/ all created physics constructors are deleted\n\t \/\/ in the G4VModularPhysicsList destructor\n}    \n\nvoid TG4PhysicsManager::SetCut(const char* cutName, Float_t cutValue)\n{\n\/\/ Sets the specified cut.\n\/\/ ---\n\n  fG3PhysicsManager->CheckLock();\n  TG4G3Cut g3Cut = fG3PhysicsManager->GetG3Cut(cutName);\n  if (g3Cut != kNoG3Cuts)\n    fG3PhysicsManager->SetCut(g3Cut, cutValue);\n  else {   \n    G4String text = \"TG4PhysicsManager::SetCut:\\n\";\n    text = text + \"    Parameter \" + cutName;\n    text = text + \" is not implemented.\";\n    TG4Globals::Warning(text);\n  }  \n}  \n  \nvoid TG4PhysicsManager::SetProcess(const char* controlName, Int_t controlValue)\n{\n\/\/ Sets the specified process control.\n\/\/ ---\n\n  fG3PhysicsManager->CheckLock();\n  TG4G3Control control = fG3PhysicsManager->GetG3Control(controlName);\n  if (control != kNoG3Controls)\n    fG3PhysicsManager->SetProcess(control, controlValue);\n  else {   \n    G4String text = \"TG4PhysicsManager::SetProcess:\\n\";\n    text = text + \"    Parameter \" + controlName;\n    text = text + \" is not implemented.\";\n    TG4Globals::Warning(text);\n  }  \n}  \n\nFloat_t TG4PhysicsManager::Xsec(char* ch, Float_t p1, Int_t i1, Int_t i2)\n{\n\/\/ Not yet implemented -> gives exception.\n\/\/ ---\n\n  TG4Globals::Exception(\n    \"TG4PhysicsManager::Xsec: not yet implemented.\");\n\n  return 0.;\n}    \n  \nInt_t TG4PhysicsManager::IdFromPDG(Int_t pdgID) const\n{\n\/\/ G4 does not use the integer particle identifiers\n\/\/ Id <-> PDG is identity.\n\/\/ ---\n\n  return pdgID;\n}  \n\nInt_t TG4PhysicsManager::PDGFromId(Int_t mcID) const\n{\n\/\/ G4 does not use integer particle identifiers\n\/\/ Id <-> PDG is identity.\n\/\/ ---\n\n  return mcID;\n}  \n\nvoid  TG4PhysicsManager::DefineParticles()\n{\n  \/\/ ======\n  \/\/ Taken from TGeant3\n  \/\/\n  \/\/ Use ENDF-6 mapping for ions = 10000*z+10*a+iso\n  \/\/ and add 1 000 000\n  \/\/ and numbers above 5 000 000 for special applications\n  \/\/\n\n  const Int_t kion=10000000;\n  const Int_t kspe=50000000;\n\n  const Double_t kGeV=0.9314943228;\n  const Double_t kHslash = 1.0545726663e-27;\n  const Double_t kErgGeV = 1\/1.6021773349e-3;\n  const Double_t kHshGeV = kHslash*kErgGeV;\n  const Double_t kYearsToSec = 3600*24*365.25;\n\n  TDatabasePDG *pdgDB = TDatabasePDG::Instance();\n\n  pdgDB->AddParticle(\"Deuteron\",\"Deuteron\",2*kGeV+8.071e-3,kTRUE,\n\t\t     0,1,\"Ion\",kion+10020);\n\t\t     \n  pdgDB->AddParticle(\"Triton\",\"Triton\",3*kGeV+14.931e-3,kFALSE,\n\t\t     kHshGeV\/(12.33*kYearsToSec),1,\"Ion\",kion+10030);\n\n  pdgDB->AddParticle(\"Alpha\",\"Alpha\",4*kGeV+2.424e-3,kTRUE,\n\t\t     kHshGeV\/(12.33*kYearsToSec),2,\"Ion\",kion+20040);\n\n  pdgDB->AddParticle(\"HE3\",\"HE3\",3*kGeV+14.931e-3,kFALSE,\n\t\t     0,2,\"Ion\",kion+20030);\n\n  pdgDB->AddParticle(\"Cherenkov\",\"Cherenkov\",0,kFALSE,\n\t\t     0,0,\"Special\",kspe+50);\n\n  pdgDB->AddParticle(\"FeedbackPhoton\",\"FeedbackPhoton\",0,kFALSE,\n\t\t     0,0,\"Special\",kspe+51);\n\n\n  \/\/ To do: define the PDG database extension\n  \/\/ in a common part.\n  \/\/\n  \/\/ AliMC::ExtendPDGDatabase(); \n  \/\/\n  \/\/ end of \"common\" implementation\n  \/\/ ======\n\n  fParticlesManager->MapParticles();\n}    \n\n\nvoid TG4PhysicsManager::SetProcessActivation()\n{\n\/\/ (In)Activates built processes according\n\/\/ to the setup in fControlVector.\n\/\/ ---\n\n  if (fPhysicsList) {\n    \/\/ temporarily excluded\n    \/\/ fPhysicsList->SetProcessActivation();\n  }  \n  else {\n    G4String text = \"TG4PhysicsManager::SetProcessActivation:\\n\";\n    text = text +   \"   There is no physics list set.\";\n    TG4Globals::Exception(text);\n  }\n}       \n\n\nAliMCProcess TG4PhysicsManager::GetMCProcess(const G4VProcess* process)\n{\n\/\/ Returns the AliMCProcess code of the specified G4 process.\n\/\/ ---\n \n  if (!process) return kPNoProcess;\n\n  G4String name = process->GetProcessName();\n  G4int code = fProcessMap.GetSecond(name);\n  \n  if (code == 0) return kPNoProcess;\n  \n  return (AliMCProcess)code; \n}\n\n<commit_msg>methods GstparCut(), GstparControl(), Gstpar()(partly) moved from TG4GeometryManager; added comment lines separating methods<commit_after>\/\/ $Id$\n\/\/ Category: physics\n\/\/\n\/\/ See the class description in the header file.\n\n#include \"TG4PhysicsManager.h\"\n#include \"TG4ParticlesManager.h\"\n#include \"TG4G3PhysicsManager.h\"\n#include \"TG4PhysicsConstructorEM.h\"\n#include \"TG4PhysicsConstructorOptical.h\"\n#include \"TG4PhysicsConstructorHadron.h\"\n#include \"TG4PhysicsConstructorSpecialCuts.h\"\n#include \"TG4PhysicsConstructorSpecialControls.h\"\n#include \"TG4GeometryServices.h\"\n#include \"TG4G3Cut.h\"\n#include \"TG4G3Control.h\"\n#include \"TG4Limits.h\"\n#include \"AliDecayer.h\"\n\n#include <G4ParticleDefinition.hh>\n#include <G4VProcess.hh>\n#include <G4VModularPhysicsList.hh>\n#include <G3MedTable.hh>\n\n#include <TDatabasePDG.h>\n\nTG4PhysicsManager* TG4PhysicsManager::fgInstance = 0;\n\n\/\/_____________________________________________________________________________\nTG4PhysicsManager::TG4PhysicsManager(G4VModularPhysicsList* physicsList)\n  : fPhysicsList(physicsList),\n    fDecayer(0),\n    fSetEMPhysics(true),\n    fSetOpticalPhysics(false),\n    fSetHadronPhysics(false),\n    fSetSpecialCutsPhysics(false),\n    fSetSpecialControlsPhysics(false)\n\n{ \n\/\/\n  if (fgInstance) {\n    TG4Globals::Exception(\n      \"TG4PhysicsManager: attempt to create two instances of singleton.\");\n  }\n      \n  fgInstance = this;  \n  \n  \/\/ create particles manager\n  fParticlesManager = new TG4ParticlesManager();\n      \n  \/\/ create G3 physics manager\n  fG3PhysicsManager = new TG4G3PhysicsManager();\n\n  \/\/ fill process name map\n  FillProcessMap();\n}\n\n\/\/_____________________________________________________________________________\nTG4PhysicsManager::TG4PhysicsManager(){\n\/\/\n  delete fDecayer;\n  delete fParticlesManager;\n  delete fG3PhysicsManager;\n}\n\n\/\/_____________________________________________________________________________\nTG4PhysicsManager::TG4PhysicsManager(const TG4PhysicsManager& right) {\n\/\/ \n  TG4Globals::Exception(\n    \"Attempt to copy TG4PhysicsManager singleton.\");\n}\n\n\/\/_____________________________________________________________________________\nTG4PhysicsManager::~TG4PhysicsManager() {\n\/\/\n}\n\n\/\/ operators\n\n\/\/_____________________________________________________________________________\nTG4PhysicsManager& \nTG4PhysicsManager::operator=(const TG4PhysicsManager& right)\n{\n  \/\/ check assignement to self\n  if (this == &right) return *this;\n\n  TG4Globals::Exception(\n    \"Attempt to assign TG4PhysicsManager singleton.\");\n    \n  return *this;  \n}    \n          \n\/\/ private methods\n\n\/\/_____________________________________________________________________________\nvoid TG4PhysicsManager::FillProcessMap()\n{\n\/\/ Fills fProcessMap.\n\/\/ The default G4 process names are used in the map.\n\/\/ ---\n\n  \/\/ multiple scattering\n  fProcessMap.Add(\"msc\",  kPMultipleScattering);\n  fProcessMap.Add(\"Imsc\", kPMultipleScattering);\n    \n  \/\/ continuous energy loss\n  \/\/ !! including delta rays\n  fProcessMap.Add(\"eIoni\",  kPEnergyLoss);\n  fProcessMap.Add(\"IeIoni\", kPEnergyLoss);\n  fProcessMap.Add(\"LowEnergyIoni\", kPEnergyLoss);\n  fProcessMap.Add(\"hIoni\",  kPEnergyLoss);\n  fProcessMap.Add(\"IhIoni\", kPEnergyLoss);\n  fProcessMap.Add(\"hLowEIoni\", kPEnergyLoss);\n  fProcessMap.Add(\"MuIoni\", kPEnergyLoss);\n  fProcessMap.Add(\"IMuIonisation\", kPEnergyLoss);\n  fProcessMap.Add(\"ionIoni\",  kPEnergyLoss);\n  fProcessMap.Add(\"ionLowEIoni\",  kPEnergyLoss);\n  fProcessMap.Add(\"PAIonisation\",  kPEnergyLoss);\n  \n  \/\/ bending in mag. field\n  \/\/ kPMagneticFieldL\n\n  \/\/ particle decay\n  fProcessMap.Add(\"Decay\", kPDecay);\n  \n  \/\/ photon pair production or\n  \/\/ muon direct pair production\n  fProcessMap.Add(\"conv\", kPPair);\n  fProcessMap.Add(\"LowEnConversion\", kPPair);\n  fProcessMap.Add(\"MuPairProd\", kPPair);\n  fProcessMap.Add(\"IMuPairProduction\", kPPair);\n\n  \/\/ Compton scattering\n  fProcessMap.Add(\"compt\", kPCompton);\n  fProcessMap.Add(\"LowEnCompton\", kPCompton);\n  fProcessMap.Add(\"polarCompt\", kPCompton);\n\n  \/\/ photoelectric effect\n  fProcessMap.Add(\"phot\", kPPhotoelectric);\n  fProcessMap.Add(\"LowEnPhotoElec\", kPPhotoelectric);\n\n  \/\/ bremsstrahlung\n  fProcessMap.Add(\"eBrem\", kPBrem);\n  fProcessMap.Add(\"IeBrem\", kPBrem);\n  fProcessMap.Add(\"MuBrems\", kPBrem);\n  fProcessMap.Add(\"IMuBremsstrahlung\", kPBrem);\n  fProcessMap.Add(\"LowEnBrem\", kPBrem);\n\n  \/\/ delta-ray production\n  \/\/ kPDeltaRay\n  \/\/ has to be distinguished from kPEnergyLoss on flight\n  \n  \/\/ positron annihilation\n  fProcessMap.Add(\"annihil\", kPAnnihilation);\n  fProcessMap.Add(\"Iannihil\", kPAnnihilation);\n\n  \/\/ hadronic interaction\n  \/\/ kPHadronic\n\n  \/\/ nuclear evaporation\n  \/\/ kPEvaporation\n  \n  \/\/ nuclear fission\n  \/\/ kPNuclearFission\n\n  \/\/ nuclear absorption\n  fProcessMap.Add(\"PionMinusAbsorptionAtRest\", kPNuclearAbsorption);\n  fProcessMap.Add(\"PiMinusAbsorptionAtRest\", kPNuclearAbsorption);\n  fProcessMap.Add(\"KaonMinusAbsorption\", kPNuclearAbsorption);         \n  fProcessMap.Add(\"KaonMinusAbsorptionAtRest\", kPNuclearAbsorption);         \n  \n  \/\/ antiproton annihilation\n  fProcessMap.Add(\"AntiProtonAnnihilationAtRest\", kPPbarAnnihilation);\n  \/\/ fProcessMap.Add(\"AntiNeutronAnnihilationAtRest\", not defined);\n\n  \/\/ neutron capture    \n  fProcessMap.Add(\"NeutronCaptureAtRest\", kPNCapture);\n  \/\/ fProcessMap.Add(\"LCapture\", hadron capture not defined);\n\n  \/\/ hadronic elastic incoherent scattering\n  fProcessMap.Add(\"LElastic\", kPHElastic);\n\n  \/\/ hadronic inelastic scattering\n  fProcessMap.Add(\"inelastic\", kPHInhelastic);\n\n  \/\/ muon nuclear interaction\n  fProcessMap.Add(\"MuNucl\", kPMuonNuclear);\n\n  \/\/ exceeded time of flight cut\n  \/\/ kPTOFlimit\n  \n  \/\/ nuclear photofission\n  \/\/ kPPhotoFission\n\n  \/\/ Rayleigh scattering\n  fProcessMap.Add(\"Rayleigh Scattering\", kPRayleigh);\n\n  \/\/ no mechanism is active, usually at the entrance of a new volume\n  fProcessMap.Add(\"Transportation\", kPNull);\n\n  \/\/ particle has fallen below energy threshold and tracking stops\n  \/\/ kPStop\n  \n  \/\/ Cerenkov photon absorption\n  fProcessMap.Add(\"Absorption\", kPLightAbsorption);\n\n  \/\/ Cerenkov photon reflection\/refraction\n  \/\/ kPLightScattering, kPLightReflection, kPLightRefraction\n  \/\/ has to be inquired from the G4OpBoundary process\n\n  \/\/ synchrotron radiation\n  fProcessMap.Add(\"SynchrotronRadiation\", kPSynchrotron);\n}  \n\n\/\/_____________________________________________________________________________\nvoid TG4PhysicsManager::GstparCut(G4int itmed, TG4G3Cut par, G4double parval)\n{\n\/\/ Sets special tracking medium parameter. \n\/\/ It is applied to all logical volumes that use the specified \n\/\/ tracking medium.\n\/\/ ---\n\n  \/\/ get medium from table\n  G3MedTableEntry* medium = G3Med.get(itmed);\n  if (!medium) {\n    G4String text = \"TG4PhysicsManager::GstparCut: \\n\";\n    text = text + \"    Medium not found.\"; \n    G4Exception(text);\n  }  \n\n  \/\/ get\/create user limits\n  G4UserLimits* limits = medium->GetLimits();\n  TG4Limits* tg4Limits;\n  if (limits) {\n    tg4Limits = dynamic_cast<TG4Limits*> (limits);\n    if (!tg4Limits)\n      G4Exception(\"TG4PhysicsManager::GstparCut: Wrong limits type.\");\n  }    \n  else {\n    tg4Limits = new TG4Limits();\n    medium->SetLimits(tg4Limits);\n\n    \/\/ add verbose \n    G4cout << \"TG4PhysicsManager::GstparCut: new TG4Limits() for medium \" \n           << itmed << \" has been created.\" << G4endl;  \n  }\t   \n  \/\/ set parameter\n  tg4Limits->SetG3Cut(par, parval*GeV);\n}\n\n\n\/\/_____________________________________________________________________________\nvoid TG4PhysicsManager::GstparControl(G4int itmed, TG4G3Control par, \n                                      G4double parval)\n{\n\/\/ Sets special tracking medium parameter. \n\/\/ It is applied to all logical volumes that use the specified \n\/\/ tracking medium.\n\/\/ ---\n\n  \/\/ get medium from table\n  G3MedTableEntry* medium = G3Med.get(itmed);\n  if (!medium) {\n    G4String text = \"TG4PhysicsManager::GstparControl: \\n\";\n    text = text + \"    Medium not found.\"; \n    G4Exception(text);\n  }  \n\n  \/\/ get\/create user limits\n  G4UserLimits* limits = medium->GetLimits();\n  TG4Limits* tg4Limits;\n  if (limits) {\n    tg4Limits = dynamic_cast<TG4Limits*> (limits);\n    if (!tg4Limits)\n      G4Exception(\"TG4PhysicsManager::GstparControl: Wrong limits type.\");\n  }    \n  else {     \n    tg4Limits = new TG4Limits();\n    medium->SetLimits(tg4Limits);\n\n    \/\/ add verbose \n    G4cout << \"TG4PhysicsManager::GstparControl: new TG4Limits() for medium\" \n           << itmed << \" has been created.\" << G4endl;  \n  }\n  \/\/ set parameter\n  tg4Limits->SetG3Control(par, parval);\n}\n\n\/\/ public methods\n\n\/\/_____________________________________________________________________________\nvoid TG4PhysicsManager::BuildPhysics()\n{\n\/\/ Empty function - not needed in G4.\n\/\/ (Physics is built within \/run\/initialize.)\n\/\/ ---\n\n  TG4Globals::Warning(\n    \"TG4PhysicsManager::BuildPhysics: is empty function in G4 MC.\");\n}    \n\n\/\/_____________________________________________________________________________\nvoid  TG4PhysicsManager::Gstpar(Int_t itmed, const char *param, \n           Float_t parval) \n{ \n\/\/ Passes the tracking medium parameter to TG4Limits.\n\/\/ The tracking medium parameter is set only in case\n\/\/ its value is different from the \"global\" physics setup.\n\/\/ (If: CheckCut\/ControlWithG3Defaults is used checking\n\/\/  is performed with respect to G3 default values.)\n\/\/ When any cut\/control parameter is set in limits\n\/\/ the physics manager is locked and the physics setup\n\/\/ cannot be changed.\n\/\/ Applying this TG4Limits to particles and physical\n\/\/ processes is still in development.\n\/\/\n\/\/  Geant3 desription:\n\/\/  ==================\n\/\/  To change the value of cut  or mechanism \"CHPAR\"\n\/\/  to a new value PARVAL  for tracking medium ITMED\n\/\/  The  data   structure  JTMED   contains  the   standard  tracking\n\/\/  parameters (CUTS and flags to control the physics processes)  which\n\/\/  are used  by default  for all  tracking media.   It is  possible to\n\/\/  redefine individually  with GSTPAR  any of  these parameters  for a\n\/\/  given tracking medium. \n\/\/  ITMED     tracking medium number \n\/\/  CHPAR     is a character string (variable name) \n\/\/  PARVAL    must be given as a floating point.\n\/\/ ---\n\n  G4String name = TG4GeometryServices::Instance()->CutName(param); \n  TG4G3Cut cut;\n  if (fG3PhysicsManager->CheckCutWithTheVector(name, parval, cut)) {\n      GstparCut(itmed, cut, parval);\n      fG3PhysicsManager->Lock();\n  }  \n  else {\n    TG4G3Control control;\n    if (fG3PhysicsManager->CheckControlWithTheVector(name, parval, control)) {\n      GstparControl(itmed, control, parval);\n      fG3PhysicsManager->Lock();\n    } \n    else if (cut==kNoG3Cuts && control==kNoG3Controls) { \n      G4String text = \"TG4PhysicsManager::Gstpar:\";\n      text = text + name;\n      text = text + \" parameter is not yet implemented.\";\n      TG4Globals::Warning(text);\n    }\t\n  }   \n} \n \n\/\/_____________________________________________________________________________\nvoid TG4PhysicsManager::CreatePhysicsConstructors()\n{\n\/\/ Creates the selected physics constructors\n\/\/ and registeres them in the modular physics list.\n\/\/ ---\n\n  \/\/ electromagnetic physics\n  if (fSetEMPhysics) \n    fPhysicsList->RegisterPhysics(new TG4PhysicsConstructorEM());\n\n  \/\/ optical physics\n  if (fSetOpticalPhysics) \n    fPhysicsList->RegisterPhysics(new TG4PhysicsConstructorOptical());\n\n  \/\/ hadron physics\n  if (fSetHadronPhysics) \n    fPhysicsList->RegisterPhysics(new TG4PhysicsConstructorHadron());\n\n  if (fSetSpecialCutsPhysics) \n    fPhysicsList->RegisterPhysics(new TG4PhysicsConstructorSpecialCuts());\n\n  if (fSetSpecialControlsPhysics) \n    fPhysicsList->RegisterPhysics(new TG4PhysicsConstructorSpecialControls());\n\n         \/\/ all created physics constructors are deleted\n\t \/\/ in the G4VModularPhysicsList destructor\n}    \n\n\/\/_____________________________________________________________________________\nvoid TG4PhysicsManager::SetCut(const char* cutName, Float_t cutValue)\n{\n\/\/ Sets the specified cut.\n\/\/ ---\n\n  fG3PhysicsManager->CheckLock();\n  TG4G3Cut g3Cut = fG3PhysicsManager->GetG3Cut(cutName);\n  if (g3Cut != kNoG3Cuts)\n    fG3PhysicsManager->SetCut(g3Cut, cutValue);\n  else {   \n    G4String text = \"TG4PhysicsManager::SetCut:\\n\";\n    text = text + \"    Parameter \" + cutName;\n    text = text + \" is not implemented.\";\n    TG4Globals::Warning(text);\n  }  \n}  \n  \n\/\/_____________________________________________________________________________\nvoid TG4PhysicsManager::SetProcess(const char* controlName, Int_t controlValue)\n{\n\/\/ Sets the specified process control.\n\/\/ ---\n\n  fG3PhysicsManager->CheckLock();\n  TG4G3Control control = fG3PhysicsManager->GetG3Control(controlName);\n  if (control != kNoG3Controls)\n    fG3PhysicsManager->SetProcess(control, controlValue);\n  else {   \n    G4String text = \"TG4PhysicsManager::SetProcess:\\n\";\n    text = text + \"    Parameter \" + controlName;\n    text = text + \" is not implemented.\";\n    TG4Globals::Warning(text);\n  }  \n}  \n\n\/\/_____________________________________________________________________________\nFloat_t TG4PhysicsManager::Xsec(char* ch, Float_t p1, Int_t i1, Int_t i2)\n{\n\/\/ Not yet implemented -> gives exception.\n\/\/ ---\n\n  TG4Globals::Exception(\n    \"TG4PhysicsManager::Xsec: not yet implemented.\");\n\n  return 0.;\n}    \n  \n\/\/_____________________________________________________________________________\nInt_t TG4PhysicsManager::IdFromPDG(Int_t pdgID) const\n{\n\/\/ G4 does not use the integer particle identifiers\n\/\/ Id <-> PDG is identity.\n\/\/ ---\n\n  return pdgID;\n}  \n\n\/\/_____________________________________________________________________________\nInt_t TG4PhysicsManager::PDGFromId(Int_t mcID) const\n{\n\/\/ G4 does not use integer particle identifiers\n\/\/ Id <-> PDG is identity.\n\/\/ ---\n\n  return mcID;\n}  \n\n\/\/_____________________________________________________________________________\nvoid  TG4PhysicsManager::DefineParticles()\n{\n  \/\/ ======\n  \/\/ Taken from TGeant3\n  \/\/\n  \/\/ Use ENDF-6 mapping for ions = 10000*z+10*a+iso\n  \/\/ and add 1 000 000\n  \/\/ and numbers above 5 000 000 for special applications\n  \/\/\n\n  const Int_t kion=10000000;\n  const Int_t kspe=50000000;\n\n  const Double_t kGeV=0.9314943228;\n  const Double_t kHslash = 1.0545726663e-27;\n  const Double_t kErgGeV = 1\/1.6021773349e-3;\n  const Double_t kHshGeV = kHslash*kErgGeV;\n  const Double_t kYearsToSec = 3600*24*365.25;\n\n  TDatabasePDG *pdgDB = TDatabasePDG::Instance();\n\n  pdgDB->AddParticle(\"Deuteron\",\"Deuteron\",2*kGeV+8.071e-3,kTRUE,\n\t\t     0,1,\"Ion\",kion+10020);\n\t\t     \n  pdgDB->AddParticle(\"Triton\",\"Triton\",3*kGeV+14.931e-3,kFALSE,\n\t\t     kHshGeV\/(12.33*kYearsToSec),1,\"Ion\",kion+10030);\n\n  pdgDB->AddParticle(\"Alpha\",\"Alpha\",4*kGeV+2.424e-3,kTRUE,\n\t\t     kHshGeV\/(12.33*kYearsToSec),2,\"Ion\",kion+20040);\n\n  pdgDB->AddParticle(\"HE3\",\"HE3\",3*kGeV+14.931e-3,kFALSE,\n\t\t     0,2,\"Ion\",kion+20030);\n\n  pdgDB->AddParticle(\"Cherenkov\",\"Cherenkov\",0,kFALSE,\n\t\t     0,0,\"Special\",kspe+50);\n\n  pdgDB->AddParticle(\"FeedbackPhoton\",\"FeedbackPhoton\",0,kFALSE,\n\t\t     0,0,\"Special\",kspe+51);\n\n\n  \/\/ To do: define the PDG database extension\n  \/\/ in a common part.\n  \/\/\n  \/\/ AliMC::ExtendPDGDatabase(); \n  \/\/\n  \/\/ end of \"common\" implementation\n  \/\/ ======\n\n  fParticlesManager->MapParticles();\n}    \n\n\/\/_____________________________________________________________________________\nvoid TG4PhysicsManager::SetProcessActivation()\n{\n\/\/ (In)Activates built processes according\n\/\/ to the setup in fControlVector.\n\/\/ ---\n\n  if (fPhysicsList) {\n    \/\/ temporarily excluded\n    \/\/ fPhysicsList->SetProcessActivation();\n  }  \n  else {\n    G4String text = \"TG4PhysicsManager::SetProcessActivation:\\n\";\n    text = text +   \"   There is no physics list set.\";\n    TG4Globals::Exception(text);\n  }\n}       \n\n\n\/\/_____________________________________________________________________________\nAliMCProcess TG4PhysicsManager::GetMCProcess(const G4VProcess* process)\n{\n\/\/ Returns the AliMCProcess code of the specified G4 process.\n\/\/ ---\n \n  if (!process) return kPNoProcess;\n\n  G4String name = process->GetProcessName();\n  G4int code = fProcessMap.GetSecond(name);\n  \n  if (code == 0) return kPNoProcess;\n  \n  return (AliMCProcess)code; \n}\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>fixed for NFCMasterNet_ServerModule<commit_after><|endoftext|>"}
{"text":"<commit_before>#ifdef WITH_PYTHON\n\n#include \"yosys.h\"\n#include <boost\/python\/module.hpp>\n#include <boost\/python\/class.hpp>\n#include <boost\/python\/wrapper.hpp>\n#include <boost\/python\/call.hpp>\n#include <boost\/python.hpp>\n\nnamespace YOSYS_PYTHON {\n\n\tstruct Design;\n\tstruct Module;\n\tstruct Cell;\n\tstruct Wire;\n\tstruct Monitor;\n\n\tvoid yosys_setup()\n\t{\n\t\tYosys::log_streams.push_back(&std::cout);\n\t\tYosys::log_error_stderr = true;\n\n\t\tYosys::yosys_setup();\n\t\tYosys::yosys_banner();\n\t}\n\n\tvoid run(std::string command)\n\t{\n\t\tYosys::run_pass(command);\n\t}\n\n\tvoid yosys_shutdown()\n\t{\n\t\tYosys::yosys_shutdown();\n\t}\n\n\tstruct Cell\n\t{\n\t\tunsigned int id;\n\n\t\tCell(Yosys::RTLIL::Cell* ref)\n\t\t{\n\t\t\tthis->id = ref->hashidx_;\n\t\t}\n\t\n\t\tYosys::RTLIL::Cell* get_cpp_obj() const\n\t\t{\n\t\t\treturn Yosys::RTLIL::Cell::get_all_cells()->at(this->id);\n\t\t}\n\t};\n\n\tstd::ostream &operator<<(std::ostream &ostr, const Cell &cell)\n\t{\n\t\tif(cell.get_cpp_obj() != NULL)\n\t\t\tostr << \"Cell with name \" << cell.get_cpp_obj()->name.c_str();\n\t\telse\n\t\t\tostr << \"deleted cell\";\n\t\treturn ostr;\n\t}\n\n\tstruct Wire\n\t{\n\t\tunsigned int id;\n\n\t\tWire(Yosys::RTLIL::Wire* ref)\n\t\t{\n\t\t\tthis->id = ref->hashidx_;\n\t\t}\n\t\n\t\tYosys::RTLIL::Wire* get_cpp_obj() const\n\t\t{\n\t\t\treturn Yosys::RTLIL::Wire::get_all_wires()->at(this->id);\n\t\t}\n\t};\n\n\tstd::ostream &operator<<(std::ostream &ostr, const Wire &wire)\n\t{\n\t\tif(wire.get_cpp_obj() != NULL)\n\t\t\tostr << \"Wire with name \" << wire.get_cpp_obj()->name.c_str();\n\t\telse\n\t\t\tostr << \"deleted wire\";\n\t\treturn ostr;\n\t}\n\n\tstruct Module\n\t{\n\t\tunsigned int id;\n\n\t\tModule(Yosys::RTLIL::Module* ref)\n\t\t{\n\t\t\tthis->id = ref->hashidx_;\n\t\t}\n\n\t\tYosys::RTLIL::Module* get_cpp_obj() const\n\t\t{\n\t\t\treturn Yosys::RTLIL::Module::get_all_modules()->at(this->id);\n\t\t}\n\n\t\tboost::python::list get_cells()\n\t\t{\n\t\t\tYosys::RTLIL::Module* cpp_mod = this->get_cpp_obj();\n\t\t\tboost::python::list result;\n\t\t\tif(cpp_mod == NULL)\n\t\t\t\treturn result;\n\t\t\tfor(auto &cell_it : cpp_mod->cells_)\n\t\t\t{\n\t\t\t\tresult.append(new Cell(cell_it.second));\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tboost::python::list get_wires()\n\t\t{\n\t\t\tYosys::RTLIL::Module* cpp_mod = this->get_cpp_obj();\n\t\t\tboost::python::list result;\n\t\t\tif(cpp_mod == NULL)\n\t\t\t\treturn result;\n\t\t\tfor(auto &wire_it : cpp_mod->wires_)\n\t\t\t{\n\t\t\t\tresult.append(new Wire(wire_it.second));\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tvoid register_monitor(Monitor* const m);\n\t};\n\n\tstd::ostream &operator<<(std::ostream &ostr, const Module &module)\n\t{\n\t\tif(module.get_cpp_obj() != NULL)\n\t\t\tostr << \"Module with name \" << module.get_cpp_obj()->name.c_str();\n\t\telse\n\t\t\tostr << \"deleted module\";\n\t\treturn ostr;\n\t}\n\n\tstruct Design\n\t{\n\t\tunsigned int hashid;\n\n\t\tDesign(unsigned int hashid)\n\t\t{\n\t\t\tthis->hashid = hashid;\n\t\t}\n\n\t\tDesign()\n\t\t{\n\t\t\tYosys::RTLIL::Design* new_design = new Yosys::RTLIL::Design();\n\t\t\tthis->hashid = new_design->hashidx_;\n\t\t}\n\n\t\tYosys::RTLIL::Design* get_cpp_obj()\n\t\t{\n\t\t\treturn Yosys::RTLIL::Design::get_all_designs()->at(hashid);\n\t\t}\n\n\t\tboost::python::list get_modules()\n\t\t{\n\t\t\tYosys::RTLIL::Design* cpp_design = get_cpp_obj();\n\t\t\tboost::python::list result;\n\t\t\tif(cpp_design == NULL)\n\t\t\t{\n\t\t\t\treturn result;\n\t\t\t}\n\t\t\tfor(auto &mod_it : cpp_design->modules_)\n\t\t\t{\n\t\t\t\tresult.append(new Module(mod_it.second));\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tvoid run(std::string command)\n\t\t{\n\t\t\tYosys::RTLIL::Design* cpp_design = get_cpp_obj();\n\t\t\tif(cpp_design != NULL)\n\t\t\t\tYosys::run_pass(command, cpp_design);\n\t\t}\n\n\t\tvoid register_monitor(Monitor* const m);\n\t};\n\n\tstruct Monitor : public Yosys::RTLIL::Monitor\n\t{\n\n\t\tvirtual void notify_module_add(Yosys::RTLIL::Module *module) YS_OVERRIDE\n\t\t{\n\t\t\tpy_notify_module_add(new Module(module));\n\t\t}\n\n\t\tvirtual void notify_module_del(Yosys::RTLIL::Module *module) YS_OVERRIDE\n\t\t{\n\t\t\tpy_notify_module_del(new Module(module));\n\t\t}\n\n\t\tvirtual void notify_connect(Yosys::RTLIL::Cell *cell, const Yosys::RTLIL::IdString &port, const Yosys::RTLIL::SigSpec &old_sig, Yosys::RTLIL::SigSpec &sig) YS_OVERRIDE\n\t\t{\n\t\t\t\/\/@TODO: Implement once necessary classes are wrapped\n\t\t}\n\n\t\tvirtual void notify_connect(Yosys::RTLIL::Module *module, const Yosys::RTLIL::SigSig &sigsig) YS_OVERRIDE\n\t\t{\n\t\t\t\/\/@TODO: Implement once necessary classes are wrapped\n\t\t}\n\n\t\tvirtual void notify_connect(Yosys::RTLIL::Module *module, const std::vector<Yosys::RTLIL::SigSig> &sigsig_vec) YS_OVERRIDE\n\t\t{\n\t\t\t\/\/@TODO: Implement once necessary classes are wrapped\n\t\t}\n\n\t\tvirtual void notify_blackout(Yosys::RTLIL::Module *module) YS_OVERRIDE\n\t\t{\n\t\t\tpy_notify_blackout(new Module(module));\n\t\t}\n\n\t\tvirtual void py_notify_module_add(Module*){};\n\t\tvirtual void py_notify_module_del(Module*){};\n\t\tvirtual void py_notify_blackout(Module*){};\n\n\t};\n\n\tstruct MonitorWrap : Monitor, boost::python::wrapper<Monitor>\n\t{\n\t\tvoid py_notify_module_add(Module* m)\n\t\t{\n\t\t\tif(boost::python::override py_notify_module_add = this->get_override(\"py_notify_module_add\"))\n\t\t\t\tpy_notify_module_add(m);\n\t\t\telse\n\t\t\t\tMonitor::py_notify_module_add(m);\n\t\t}\n\n\t\tvoid default_py_notify_module_add(Module* m)\n\t\t{\n\t\t\tthis->Monitor::py_notify_module_add(m);\n\t\t}\n\n\t\tvoid py_notify_module_del(Module* m)\n\t\t{\n\t\t\tif(boost::python::override py_notify_module_del = this->get_override(\"py_notify_module_del\"))\n\t\t\t\tpy_notify_module_del(m);\n\t\t\telse\n\t\t\t\tMonitor::py_notify_module_del(m);\n\t\t}\n\n\t\tvoid default_py_notify_module_del(Module* m)\n\t\t{\n\t\t\tthis->Monitor::py_notify_module_del(m);\n\t\t}\n\n\t\tvoid py_notify_blackout(Module* m)\n\t\t{\n\t\t\tif(boost::python::override py_notify_blackout = this->get_override(\"py_notify_blackout\"))\n\t\t\t\tpy_notify_blackout(m);\n\t\t\telse\n\t\t\t\tMonitor::py_notify_blackout(m);\n\t\t}\n\n\t\tvoid default_py_notify_blackout(Module* m)\n\t\t{\n\t\t\tthis->Monitor::py_notify_blackout(m);\n\t\t}\n\t};\n\n\tvoid Design::register_monitor(Monitor* const m)\n\t{\n\t\tYosys::RTLIL::Design* cpp_design = this->get_cpp_obj();\n\t\tif(cpp_design == NULL)\n\t\t\treturn;\n\t\tcpp_design->monitors.insert(m);\n\t}\n\n\tvoid Module::register_monitor(Monitor* const m)\n\t{\n\t\tYosys::RTLIL::Module* cpp_design = this->get_cpp_obj();\n\t\tif(cpp_design == NULL)\n\t\t\treturn;\n\t\tcpp_design->monitors.insert(m);\n\t}\n\n\tstd::ostream &operator<<(std::ostream &ostr, const Design &design)\n\t{\n\t\tostr << \"Design with id \" << design.hashid;\n\t\treturn ostr;\n\t}\n\n\tunsigned int get_active_design_id()\n\t{\n\t\tYosys::RTLIL::Design* active_design = Yosys::yosys_get_design();\n\t\tif(active_design != NULL)\n\t\t{\n\t\t\treturn active_design->hashidx_;\n\t\t}\n\t\treturn 0;\n\t}\n\n\tBOOST_PYTHON_MODULE(libyosys)\n\t{\n\t\tusing namespace boost::python;\n\n\t\tclass_<Design>(\"Design\", init<unsigned int>())\n\t\t\t.def(boost::python::self_ns::str(boost::python::self_ns::self))\n\t\t\t.def(boost::python::self_ns::repr(boost::python::self_ns::self))\n\t\t\t.def(init<>())\n\t\t\t.def(\"get_modules\", &Design::get_modules)\n\t\t\t.def(\"run\",&Design::run)\n\t\t\t.def(\"register_monitor\", &Design::register_monitor)\n\t\t\t;\n\n\t\tclass_<Module>(\"Module\", no_init)\n\t\t\t.def(boost::python::self_ns::str(boost::python::self_ns::self))\n\t\t\t.def(boost::python::self_ns::repr(boost::python::self_ns::self))\n\t\t\t.def(\"get_cells\", &Module::get_cells)\n\t\t\t.def(\"get_wires\", &Module::get_wires)\n\t\t\t.def(\"register_monitor\", &Module::register_monitor)\n\t\t\t;\n\n\t\tclass_<Cell>(\"Cell\", no_init)\n\t\t\t.def(boost::python::self_ns::str(boost::python::self_ns::self))\n\t\t\t.def(boost::python::self_ns::repr(boost::python::self_ns::self))\n\t\t\t;\n\n\t\tclass_<Wire>(\"Wire\", no_init)\n\t\t\t.def(boost::python::self_ns::str(boost::python::self_ns::self))\n\t\t\t.def(boost::python::self_ns::repr(boost::python::self_ns::self))\n\t\t\t;\n\n\t\tclass_<MonitorWrap, boost::noncopyable>(\"Monitor\")\n\t\t\t.def(\"py_notify_module_add\", &Monitor::py_notify_module_add, &MonitorWrap::default_py_notify_module_add)\n\t\t\t.def(\"py_notify_module_del\", &Monitor::py_notify_module_del, &MonitorWrap::default_py_notify_module_del)\n\t\t\t.def(\"py_notify_blackout\", &Monitor::py_notify_blackout, &MonitorWrap::default_py_notify_blackout)\n\t\t\t;\n\n\t\tdef(\"yosys_setup\",yosys_setup);\n\t\tdef(\"run\",run);\n\t\tdef(\"get_active_design_id\",get_active_design_id);\n\t\tdef(\"yosys_shutdown\",yosys_shutdown);\n\t}\n\n}\n#endif\n<commit_msg>Setup is called automatically when the module is loaded, shutdown when python exits<commit_after>#ifdef WITH_PYTHON\n\n#include \"yosys.h\"\n#include <boost\/python\/module.hpp>\n#include <boost\/python\/class.hpp>\n#include <boost\/python\/wrapper.hpp>\n#include <boost\/python\/call.hpp>\n#include <boost\/python.hpp>\n\nnamespace YOSYS_PYTHON {\n\n\tstruct Design;\n\tstruct Module;\n\tstruct Cell;\n\tstruct Wire;\n\tstruct Monitor;\n\n\tvoid run(std::string command)\n\t{\n\t\tYosys::run_pass(command);\n\t}\n\n\tstruct Cell\n\t{\n\t\tunsigned int id;\n\n\t\tCell(Yosys::RTLIL::Cell* ref)\n\t\t{\n\t\t\tthis->id = ref->hashidx_;\n\t\t}\n\t\n\t\tYosys::RTLIL::Cell* get_cpp_obj() const\n\t\t{\n\t\t\treturn Yosys::RTLIL::Cell::get_all_cells()->at(this->id);\n\t\t}\n\t};\n\n\tstd::ostream &operator<<(std::ostream &ostr, const Cell &cell)\n\t{\n\t\tif(cell.get_cpp_obj() != NULL)\n\t\t\tostr << \"Cell with name \" << cell.get_cpp_obj()->name.c_str();\n\t\telse\n\t\t\tostr << \"deleted cell\";\n\t\treturn ostr;\n\t}\n\n\tstruct Wire\n\t{\n\t\tunsigned int id;\n\n\t\tWire(Yosys::RTLIL::Wire* ref)\n\t\t{\n\t\t\tthis->id = ref->hashidx_;\n\t\t}\n\t\n\t\tYosys::RTLIL::Wire* get_cpp_obj() const\n\t\t{\n\t\t\treturn Yosys::RTLIL::Wire::get_all_wires()->at(this->id);\n\t\t}\n\t};\n\n\tstd::ostream &operator<<(std::ostream &ostr, const Wire &wire)\n\t{\n\t\tif(wire.get_cpp_obj() != NULL)\n\t\t\tostr << \"Wire with name \" << wire.get_cpp_obj()->name.c_str();\n\t\telse\n\t\t\tostr << \"deleted wire\";\n\t\treturn ostr;\n\t}\n\n\tstruct Module\n\t{\n\t\tunsigned int id;\n\n\t\tModule(Yosys::RTLIL::Module* ref)\n\t\t{\n\t\t\tthis->id = ref->hashidx_;\n\t\t}\n\n\t\tYosys::RTLIL::Module* get_cpp_obj() const\n\t\t{\n\t\t\treturn Yosys::RTLIL::Module::get_all_modules()->at(this->id);\n\t\t}\n\n\t\tboost::python::list get_cells()\n\t\t{\n\t\t\tYosys::RTLIL::Module* cpp_mod = this->get_cpp_obj();\n\t\t\tboost::python::list result;\n\t\t\tif(cpp_mod == NULL)\n\t\t\t\treturn result;\n\t\t\tfor(auto &cell_it : cpp_mod->cells_)\n\t\t\t{\n\t\t\t\tresult.append(new Cell(cell_it.second));\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tboost::python::list get_wires()\n\t\t{\n\t\t\tYosys::RTLIL::Module* cpp_mod = this->get_cpp_obj();\n\t\t\tboost::python::list result;\n\t\t\tif(cpp_mod == NULL)\n\t\t\t\treturn result;\n\t\t\tfor(auto &wire_it : cpp_mod->wires_)\n\t\t\t{\n\t\t\t\tresult.append(new Wire(wire_it.second));\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tvoid register_monitor(Monitor* const m);\n\t};\n\n\tstd::ostream &operator<<(std::ostream &ostr, const Module &module)\n\t{\n\t\tif(module.get_cpp_obj() != NULL)\n\t\t\tostr << \"Module with name \" << module.get_cpp_obj()->name.c_str();\n\t\telse\n\t\t\tostr << \"deleted module\";\n\t\treturn ostr;\n\t}\n\n\tstruct Design\n\t{\n\t\tunsigned int hashid;\n\n\t\tDesign(unsigned int hashid)\n\t\t{\n\t\t\tthis->hashid = hashid;\n\t\t}\n\n\t\tDesign()\n\t\t{\n\t\t\tYosys::RTLIL::Design* new_design = new Yosys::RTLIL::Design();\n\t\t\tthis->hashid = new_design->hashidx_;\n\t\t}\n\n\t\tYosys::RTLIL::Design* get_cpp_obj()\n\t\t{\n\t\t\treturn Yosys::RTLIL::Design::get_all_designs()->at(hashid);\n\t\t}\n\n\t\tboost::python::list get_modules()\n\t\t{\n\t\t\tYosys::RTLIL::Design* cpp_design = get_cpp_obj();\n\t\t\tboost::python::list result;\n\t\t\tif(cpp_design == NULL)\n\t\t\t{\n\t\t\t\treturn result;\n\t\t\t}\n\t\t\tfor(auto &mod_it : cpp_design->modules_)\n\t\t\t{\n\t\t\t\tresult.append(new Module(mod_it.second));\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tvoid run(std::string command)\n\t\t{\n\t\t\tYosys::RTLIL::Design* cpp_design = get_cpp_obj();\n\t\t\tif(cpp_design != NULL)\n\t\t\t\tYosys::run_pass(command, cpp_design);\n\t\t}\n\n\t\tvoid register_monitor(Monitor* const m);\n\t};\n\n\tstruct Monitor : public Yosys::RTLIL::Monitor\n\t{\n\n\t\tvirtual void notify_module_add(Yosys::RTLIL::Module *module) YS_OVERRIDE\n\t\t{\n\t\t\tpy_notify_module_add(new Module(module));\n\t\t}\n\n\t\tvirtual void notify_module_del(Yosys::RTLIL::Module *module) YS_OVERRIDE\n\t\t{\n\t\t\tpy_notify_module_del(new Module(module));\n\t\t}\n\n\t\tvirtual void notify_connect(Yosys::RTLIL::Cell *cell, const Yosys::RTLIL::IdString &port, const Yosys::RTLIL::SigSpec &old_sig, Yosys::RTLIL::SigSpec &sig) YS_OVERRIDE\n\t\t{\n\t\t\t\/\/@TODO: Implement once necessary classes are wrapped\n\t\t}\n\n\t\tvirtual void notify_connect(Yosys::RTLIL::Module *module, const Yosys::RTLIL::SigSig &sigsig) YS_OVERRIDE\n\t\t{\n\t\t\t\/\/@TODO: Implement once necessary classes are wrapped\n\t\t}\n\n\t\tvirtual void notify_connect(Yosys::RTLIL::Module *module, const std::vector<Yosys::RTLIL::SigSig> &sigsig_vec) YS_OVERRIDE\n\t\t{\n\t\t\t\/\/@TODO: Implement once necessary classes are wrapped\n\t\t}\n\n\t\tvirtual void notify_blackout(Yosys::RTLIL::Module *module) YS_OVERRIDE\n\t\t{\n\t\t\tpy_notify_blackout(new Module(module));\n\t\t}\n\n\t\tvirtual void py_notify_module_add(Module*){};\n\t\tvirtual void py_notify_module_del(Module*){};\n\t\tvirtual void py_notify_blackout(Module*){};\n\n\t};\n\n\tstruct MonitorWrap : Monitor, boost::python::wrapper<Monitor>\n\t{\n\t\tvoid py_notify_module_add(Module* m)\n\t\t{\n\t\t\tif(boost::python::override py_notify_module_add = this->get_override(\"py_notify_module_add\"))\n\t\t\t\tpy_notify_module_add(m);\n\t\t\telse\n\t\t\t\tMonitor::py_notify_module_add(m);\n\t\t}\n\n\t\tvoid default_py_notify_module_add(Module* m)\n\t\t{\n\t\t\tthis->Monitor::py_notify_module_add(m);\n\t\t}\n\n\t\tvoid py_notify_module_del(Module* m)\n\t\t{\n\t\t\tif(boost::python::override py_notify_module_del = this->get_override(\"py_notify_module_del\"))\n\t\t\t\tpy_notify_module_del(m);\n\t\t\telse\n\t\t\t\tMonitor::py_notify_module_del(m);\n\t\t}\n\n\t\tvoid default_py_notify_module_del(Module* m)\n\t\t{\n\t\t\tthis->Monitor::py_notify_module_del(m);\n\t\t}\n\n\t\tvoid py_notify_blackout(Module* m)\n\t\t{\n\t\t\tif(boost::python::override py_notify_blackout = this->get_override(\"py_notify_blackout\"))\n\t\t\t\tpy_notify_blackout(m);\n\t\t\telse\n\t\t\t\tMonitor::py_notify_blackout(m);\n\t\t}\n\n\t\tvoid default_py_notify_blackout(Module* m)\n\t\t{\n\t\t\tthis->Monitor::py_notify_blackout(m);\n\t\t}\n\t};\n\n\tvoid Design::register_monitor(Monitor* const m)\n\t{\n\t\tYosys::RTLIL::Design* cpp_design = this->get_cpp_obj();\n\t\tif(cpp_design == NULL)\n\t\t\treturn;\n\t\tcpp_design->monitors.insert(m);\n\t}\n\n\tvoid Module::register_monitor(Monitor* const m)\n\t{\n\t\tYosys::RTLIL::Module* cpp_design = this->get_cpp_obj();\n\t\tif(cpp_design == NULL)\n\t\t\treturn;\n\t\tcpp_design->monitors.insert(m);\n\t}\n\n\tstd::ostream &operator<<(std::ostream &ostr, const Design &design)\n\t{\n\t\tostr << \"Design with id \" << design.hashid;\n\t\treturn ostr;\n\t}\n\n\tunsigned int get_active_design_id()\n\t{\n\t\tYosys::RTLIL::Design* active_design = Yosys::yosys_get_design();\n\t\tif(active_design != NULL)\n\t\t{\n\t\t\treturn active_design->hashidx_;\n\t\t}\n\t\treturn 0;\n\t}\n\n\tstruct Initializer\n\t{\n\t\tInitializer() {\n\t\t\tYosys::log_streams.push_back(&std::cout);\n\t\t\tYosys::log_error_stderr = true;\n\t\t\tYosys::yosys_setup();\n\t\t\tYosys::yosys_banner();\n\t\t}\n\n\t\tInitializer(Initializer const &) {}\n\n\t\t~Initializer() {\n\t\t\tYosys::yosys_shutdown();\n\t\t}\n\t};\n\n\tBOOST_PYTHON_MODULE(libyosys)\n\t{\n\t\tusing namespace boost::python;\n\n\t\tclass_<Initializer>(\"Initializer\");\n\t\tscope().attr(\"_hidden\") = new Initializer();\n\n\t\tclass_<Design>(\"Design\", init<unsigned int>())\n\t\t\t.def(boost::python::self_ns::str(boost::python::self_ns::self))\n\t\t\t.def(boost::python::self_ns::repr(boost::python::self_ns::self))\n\t\t\t.def(init<>())\n\t\t\t.def(\"get_modules\", &Design::get_modules)\n\t\t\t.def(\"run\",&Design::run)\n\t\t\t.def(\"register_monitor\", &Design::register_monitor)\n\t\t\t;\n\n\t\tclass_<Module>(\"Module\", no_init)\n\t\t\t.def(boost::python::self_ns::str(boost::python::self_ns::self))\n\t\t\t.def(boost::python::self_ns::repr(boost::python::self_ns::self))\n\t\t\t.def(\"get_cells\", &Module::get_cells)\n\t\t\t.def(\"get_wires\", &Module::get_wires)\n\t\t\t.def(\"register_monitor\", &Module::register_monitor)\n\t\t\t;\n\n\t\tclass_<Cell>(\"Cell\", no_init)\n\t\t\t.def(boost::python::self_ns::str(boost::python::self_ns::self))\n\t\t\t.def(boost::python::self_ns::repr(boost::python::self_ns::self))\n\t\t\t;\n\n\t\tclass_<Wire>(\"Wire\", no_init)\n\t\t\t.def(boost::python::self_ns::str(boost::python::self_ns::self))\n\t\t\t.def(boost::python::self_ns::repr(boost::python::self_ns::self))\n\t\t\t;\n\n\t\tclass_<MonitorWrap, boost::noncopyable>(\"Monitor\")\n\t\t\t.def(\"py_notify_module_add\", &Monitor::py_notify_module_add, &MonitorWrap::default_py_notify_module_add)\n\t\t\t.def(\"py_notify_module_del\", &Monitor::py_notify_module_del, &MonitorWrap::default_py_notify_module_del)\n\t\t\t.def(\"py_notify_blackout\", &Monitor::py_notify_blackout, &MonitorWrap::default_py_notify_blackout)\n\t\t\t;\n\n\t\tdef(\"run\",run);\n\t\tdef(\"get_active_design_id\",get_active_design_id);\n\t}\n\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"itkMacro.h\"\n\n#include <iostream>\n#include <cstdlib>\n#include \"svm.h\"\n\nnamespace otb\n{\n\nclass LinearKernelFunctor : public GenericKernelFunctorBase\n{\npublic:\n  typedef LinearKernelFunctor                 Self;\n  typedef GenericKernelFunctorBase            Superclass;\n\n  LinearKernelFunctor() : GenericKernelFunctorBase() {}\n  virtual ~LinearKernelFunctor() {}\n\n  \/\/ Deep copy operator\n  virtual GenericKernelFunctorBase* Clone() const\n  {\n    return new Self(*this);\n  }\n\n  virtual double operator ()(const svm_node *x, const svm_node *y, const svm_parameter&) const\n  {\n    return this->dot(x, y);\n  }\n\nprotected:\n  LinearKernelFunctor(const Self& copy)\n  : Superclass(copy)\n  {\n    *this = copy;\n  }\n\n  LinearKernelFunctor& operator=(const Self& copy)\n  {\n    Superclass::operator =(copy);\n    return *this;\n  }\n};\n\n}\n\n\n\n\/**\n * In this test, we approximate a 2-D scalar field.\n * The scattered data is derived from a segmented\n * image.  We write the output to an image for\n * comparison.\n *\/\nint svmTest( int itkNotUsed(argc), char *argv[] )\n{\n\n  try\n    {\n        const char * inputFilename  = argv[1];\n        const char * outputFilename = argv[2];\n\n\/\/        otb::LinearKernelFunctor lFunctor;\n\n        struct svm_model* model;\n        model = svm_load_model(inputFilename,NULL);\n        if(model == 0)\n        {\n                itkGenericExceptionMacro( << \"Problem while loading SVM model \"\n\t\t\t << std::string(inputFilename) );\n        }\n\n        if(svm_save_model(outputFilename, model)!=0)\n        {\n                itkGenericExceptionMacro( << \"Problem while saving SVM model \"\n\t\t\t << std::string(outputFilename) );\n        }\n\n    }\n  catch( itk::ExceptionObject & err )\n    {\n    std::cout << \"Exception itk::ExceptionObject levee !\" << std::endl;\n    std::cout << err << std::endl;\n    return EXIT_FAILURE;\n    }\n  catch (...)\n    {\n    std::cerr << \"svmTest exception thrown\" << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  return EXIT_SUCCESS;\n};\n<commit_msg>COV: Fixing coverity issue 1266747 (Ressource leak)<commit_after>\n#include \"itkMacro.h\"\n\n#include <iostream>\n#include <cstdlib>\n#include \"svm.h\"\n\nnamespace otb\n{\n\nclass LinearKernelFunctor : public GenericKernelFunctorBase\n{\npublic:\n  typedef LinearKernelFunctor                 Self;\n  typedef GenericKernelFunctorBase            Superclass;\n\n  LinearKernelFunctor() : GenericKernelFunctorBase() {}\n  virtual ~LinearKernelFunctor() {}\n\n  \/\/ Deep copy operator\n  virtual GenericKernelFunctorBase* Clone() const\n  {\n    return new Self(*this);\n  }\n\n  virtual double operator ()(const svm_node *x, const svm_node *y, const svm_parameter&) const\n  {\n    return this->dot(x, y);\n  }\n\nprotected:\n  LinearKernelFunctor(const Self& copy)\n    : Superclass(copy)\n  {\n    *this = copy;\n  }\n\n  LinearKernelFunctor& operator=(const Self& copy)\n  {\n    Superclass::operator =(copy);\n    return *this;\n  }\n};\n\n}\n\n\n\n\/**\n * In this test, we approximate a 2-D scalar field.\n * The scattered data is derived from a segmented\n * image.  We write the output to an image for\n * comparison.\n *\/\nint svmTest( int itkNotUsed(argc), char *argv[] )\n{\n\n  try\n    {\n    const char * inputFilename  = argv[1];\n    const char * outputFilename = argv[2];\n\n\/\/        otb::LinearKernelFunctor lFunctor;\n\n    struct svm_model* model;\n    model = svm_load_model(inputFilename,NULL);\n    if(model == 0)\n      {\n      itkGenericExceptionMacro( << \"Problem while loading SVM model \"\n                                << std::string(inputFilename) );\n      }\n\n    if(svm_save_model(outputFilename, model)!=0)\n      {\n      if(model != NULL)\n        {\n        delete model;\n        }\n      itkGenericExceptionMacro( << \"Problem while saving SVM model \"\n                                << std::string(outputFilename) );\n      }\n\n    }\n\n  if(model!=NULL)\n    {\n    delete model;\n    }\n\n\n  catch( itk::ExceptionObject & err )\n    {\n    std::cout << \"Exception itk::ExceptionObject levee !\" << std::endl;\n    std::cout << err << std::endl;\n    return EXIT_FAILURE;\n    }\n  catch (...)\n    {\n    std::cerr << \"svmTest exception thrown\" << std::endl;\n    return EXIT_FAILURE;\n    }\n\n  return EXIT_SUCCESS;\n};\n<|endoftext|>"}
{"text":"<commit_before>#include \"stdsneezy.h\"\n#include \"obj_base_corpse.h\"\n#include \"obj_tool.h\"\n\nint task_sacrifice(TBeing *ch, cmdTypeT cmd, const char *, int pulse, TRoom *, TObj *obj)\n{\n  TThing *t, *t2;\n  TMonster *guard;\n  TTool *totem=NULL;\n  int learning = ch->getSkillValue(SKILL_SACRIFICE);\n  TBaseCorpse *corpse = dynamic_cast<TBaseCorpse *>(obj);\n  int clev = ch->GetMaxLevel();\n  int percent = ::number(1, 100);\n  int factor = ::number(5, (((clev + learning) + percent) \/ 2));\n  int factor2 = ::number(5, (((clev + learning) + percent) \/ 5));\n\n  if (!ch || !ch->task) {\n    vlogf(LOG_BUG, fmt(\"No %s in task_sacrifice!\") % (ch ? \"character\" : \"task\"));\n    return FALSE;\n  }\n\n  if (ch->utilityTaskCommand(cmd) || ch->nobrainerTaskCommand(cmd)) {\n    return FALSE;\n  }\n\n  if (!corpse) {\n\t  act(\"You can't find the object of the ritual! Wasn't there a corpse here?\", \n      FALSE, ch, 0, 0, TO_CHAR);\n\t  act(\"$n stops singing and looks confused.\", TRUE, ch, 0, 0, TO_ROOM);\n    ch->stopTask();\n    vlogf(LOG_BUG,\n        fmt(\"task_sacrifice.cc: sacrifice task entered by %s without a corpse!\") \n        % ch->getName());\n    return FALSE;\n  }\n\n  if (ch->isLinkdead() || (ch->in_room != ch->task->wasInRoom) || \n      (ch->getPosition() < POSITION_RESTING)) {\n    act(\"You cease the ritual sacrifice of $p.\", FALSE, ch, corpse, 0, TO_CHAR);\n    act(\"$n stops trying to sacrifice $p.\", TRUE, ch, corpse, 0, TO_ROOM);\n    ch->stopTask();\n    if (corpse->isCorpseFlag(CORPSE_SACRIFICE))\n      corpse->remCorpseFlag(CORPSE_SACRIFICE);\n    return FALSE;\n  }\n\n  if (!(t = get_thing_char_using(ch, \"totem\", 0, FALSE, FALSE)) || \n      !(totem=dynamic_cast<TTool *>(t))) {\n    ch->sendTo(\"You need to own a totem to perform the ritual.\\n\\r\");\n    ch->stopTask();\n    if (corpse->isCorpseFlag(CORPSE_SACRIFICE))\n      corpse->remCorpseFlag(CORPSE_SACRIFICE);\n    return FALSE;\n  }\n\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) || !guard->awake())\n      continue;\n    int saything = (::number(0,3));\n    switch (saything) {\n      case 0:\n\t      guard->doSay(\"Hey! Get the hell out of here! Damn Voodoo Witch!\");\n\t      break;\n      case 1:\n\t      guard->doSay(\"Hey! Don't you have any respect for the dead?!? Get the hell out of here!\");\n\t      break;\n      case 2:\n\t      guard->doSay(\"Damn Shaman! Take your voodoo crap and PISS OFF!!!\");\n\t      break;\n      case 3:\n\t    guard->doSay(\"Hey witch!! Are you some sort of whacked out necrophiliac? Bugger off!!\");\n\t    break;\n    }\n    act(\"You cease the ritual sacrifice of $p.\", \n        FALSE, ch, corpse, 0, TO_CHAR);\n    act(\"$n stops chanting over the corpse of $p.\", \n        TRUE, ch, corpse, 0, TO_ROOM);\n    ch->stopTask();\n    if (corpse->isCorpseFlag(CORPSE_SACRIFICE))\n      corpse->remCorpseFlag(CORPSE_SACRIFICE);\n    return FALSE;\n  }\n\n  if (ch->task->timeLeft < 0){\n    act(\"You have completed the sacrifice of $p.\", \n        FALSE, ch, corpse, 0, TO_CHAR);\n    act(\"$n has completed $s ritual sacrifice of $p.\", \n        FALSE, ch, corpse, 0, TO_ROOM);\n    act(\"Some <r>blood<z> from $p has been left behind.\", \n        FALSE, ch, corpse, 0, TO_ROOM);\n    act(\"Some <r>blood<z> from $p has been left behind for the dogs!\", \n        FALSE, ch, corpse, 0, TO_CHAR);\n    ch->dropPool(1, LIQ_BLOOD);\n    ch->stopTask();\n    delete corpse;\n    return FALSE;\n  }\n\n  switch (cmd) {\n    case CMD_TASK_CONTINUE:\n      if (percent < ch->getSkillValue(SKILL_SACRIFICE)) {\n        act(\"Your sacrifice is being accepted by the loa.\", \n            FALSE, ch, 0, 0, TO_CHAR);\n        ch->addToLifeforce(factor);\n        ch->updatePos();\n      } else {\n        ch->addToLifeforce(-factor2);\n        if (0 >= ch->getLifeforce()) {\n          ch->setLifeforce(0);\n          act(\"The loa demands that you cease this vain sacrifice, and you comply.\", \n              FALSE, ch, 0, 0, TO_CHAR);\n          ch->addToHit(-2);\n          ch->updatePos();\n          ch->task->timeLeft = -1;\n        }\n      }\n\n      ch->task->calcNextUpdate(pulse, 2);\n      totem->addToToolUses(-1);\n      if (totem->getToolUses() <= 0) {\n        act(\"Your $o has been confiscated by the loa! It must have been too weak.\", \n            FALSE, ch, totem, 0, TO_CHAR);\n        act(\"$n looks pale as $s $o shatters.\", FALSE, ch, totem, 0, TO_ROOM);\n        ch->stopTask();\n        delete totem;\n        if (corpse->isCorpseFlag(CORPSE_SACRIFICE))\n          corpse->remCorpseFlag(CORPSE_SACRIFICE);\n        return FALSE;\n      }\n      if (10 >= corpse->obj_flags.decay_time)\n        corpse->obj_flags.decay_time = 10;\n\n      switch (ch->task->timeLeft) {\n        case 2:\n          act(\"You continue the rada song to the loa in hopes they will accept your sacrifice.\", \n              FALSE, ch, 0, 0, TO_CHAR);\n          act(\"$n sings in an unfamiliar tongue over $p.\", \n              TRUE, ch, corpse, 0, TO_ROOM);\n\t        if (bSuccess(ch, learning, SKILL_SACRIFICE))\n\t          ch->task->timeLeft--;\n\t        break;\n        case 1:\n          act(\"Your $o's eyes glow <r>blood red<1>.\", \n              FALSE, ch, totem, 0, TO_CHAR);\n          act(\"The eyes on $n's $o begin to glow a <r>blood red<1>.\", \n              TRUE, ch, totem, 0, TO_ROOM);\n\t        if (bSuccess(ch, learning, SKILL_SACRIFICE))\n\t          ch->task->timeLeft--;\n\t        break;\n        case 0:\n\t        act(\"You continue to sing the rada song over $p.\", \n              FALSE, ch, corpse, 0, TO_CHAR);\n\t        act(\"$n's ritual sacrifice causes $p's face to glow <G>pale green<1>.\", \n              FALSE, ch, corpse, 0, TO_ROOM);\n          if (bSuccess(ch, learning, SKILL_SACRIFICE))\n            ch->task->timeLeft--;\n          break;\n        case -1:\n          act(\"You feel the loa ignoring your vain attempt and feel completed to stop.\",\n              false, ch, 0, 0, TO_CHAR);\n          ch->stopTask();\n          if (corpse->isCorpseFlag(CORPSE_SACRIFICE))\n            corpse->remCorpseFlag(CORPSE_SACRIFICE);\n\t  break;\n        default:\n          act(\"Bug Maror if you get this message.\", false, ch, 0, 0, TO_CHAR);\n          vlogf(LOG_BUG, \"no appropriate option in switch in sacrifice.cc\");\n          ch->stopTask();\n          if (corpse->isCorpseFlag(CORPSE_SACRIFICE))\n            corpse->remCorpseFlag(CORPSE_SACRIFICE);\n          break;\n      }\n      break;\n    case CMD_TASK_FIGHTING:\n      ch->sendTo(\"You can't sacrifice a corpse while under attack.\\n\\r\");\n      \/\/ don't put a break in here\n    case CMD_ABORT:\n    case CMD_STOP:\n      act(\"Some <r>blood<z> from $p has been left behind.\", \n          FALSE, ch, corpse, 0, TO_ROOM);\n      act(\"Some <r>blood<z> from $p has been left behind for the dogs!\", \n          FALSE, ch, corpse, 0, TO_CHAR);\n      ch->dropPool(1, LIQ_BLOOD);\n      ch->stopTask();\n      delete corpse;\n      return FALSE;\n      break;\n    default:\n      if (cmd < MAX_CMD_LIST)\n      ch->addToLifeforce(-factor * 2);\n        warn_busy(ch);\n      break;\n  }\n  return TRUE;\n}\n<commit_msg>small change to increase sacrifice error logging information<commit_after>#include \"stdsneezy.h\"\n#include \"obj_base_corpse.h\"\n#include \"obj_tool.h\"\n\nint task_sacrifice(TBeing *ch, cmdTypeT cmd, const char *, int pulse, TRoom *, TObj *obj)\n{\n  TThing *t, *t2;\n  TMonster *guard;\n  TTool *totem=NULL;\n  int learning = ch->getSkillValue(SKILL_SACRIFICE);\n  TBaseCorpse *corpse = dynamic_cast<TBaseCorpse *>(obj);\n  int clev = ch->GetMaxLevel();\n  int percent = ::number(1, 100);\n  int factor = ::number(5, (((clev + learning) + percent) \/ 2));\n  int factor2 = ::number(5, (((clev + learning) + percent) \/ 5));\n\n  if (!ch || !ch->task) {\n    vlogf(LOG_BUG, fmt(\"No %s in task_sacrifice!\") % (ch ? \"character\" : \"task\"));\n    return FALSE;\n  }\n\n  if (ch->utilityTaskCommand(cmd) || ch->nobrainerTaskCommand(cmd)) {\n    return FALSE;\n  }\n\n  if (!corpse) {\n\t  act(\"You can't find the object of the ritual! Wasn't there a corpse here?\", \n      FALSE, ch, 0, 0, TO_CHAR);\n\t  act(\"$n stops singing and looks confused.\", TRUE, ch, 0, 0, TO_ROOM);\n    ch->stopTask();\n    vlogf(LOG_BUG,\n        fmt(\"task_sacrifice.cc: sacrifice task entered by %s without a corpse!\") \n        % ch->getName());\n    return FALSE;\n  }\n\n  if (ch->isLinkdead() || (ch->in_room != ch->task->wasInRoom) || \n      (ch->getPosition() < POSITION_RESTING)) {\n    act(\"You cease the ritual sacrifice of $p.\", FALSE, ch, corpse, 0, TO_CHAR);\n    act(\"$n stops trying to sacrifice $p.\", TRUE, ch, corpse, 0, TO_ROOM);\n    ch->stopTask();\n    if (corpse->isCorpseFlag(CORPSE_SACRIFICE))\n      corpse->remCorpseFlag(CORPSE_SACRIFICE);\n    return FALSE;\n  }\n\n  if (!(t = get_thing_char_using(ch, \"totem\", 0, FALSE, FALSE)) || \n      !(totem=dynamic_cast<TTool *>(t))) {\n    ch->sendTo(\"You need to own a totem to perform the ritual.\\n\\r\");\n    ch->stopTask();\n    if (corpse->isCorpseFlag(CORPSE_SACRIFICE))\n      corpse->remCorpseFlag(CORPSE_SACRIFICE);\n    return FALSE;\n  }\n\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) || !guard->awake())\n      continue;\n    int saything = (::number(0,3));\n    switch (saything) {\n      case 0:\n\t      guard->doSay(\"Hey! Get the hell out of here! Damn Voodoo Witch!\");\n\t      break;\n      case 1:\n\t      guard->doSay(\"Hey! Don't you have any respect for the dead?!? Get the hell out of here!\");\n\t      break;\n      case 2:\n\t      guard->doSay(\"Damn Shaman! Take your voodoo crap and PISS OFF!!!\");\n\t      break;\n      case 3:\n\t    guard->doSay(\"Hey witch!! Are you some sort of whacked out necrophiliac? Bugger off!!\");\n\t    break;\n    }\n    act(\"You cease the ritual sacrifice of $p.\", \n        FALSE, ch, corpse, 0, TO_CHAR);\n    act(\"$n stops chanting over the corpse of $p.\", \n        TRUE, ch, corpse, 0, TO_ROOM);\n    ch->stopTask();\n    if (corpse->isCorpseFlag(CORPSE_SACRIFICE))\n      corpse->remCorpseFlag(CORPSE_SACRIFICE);\n    return FALSE;\n  }\n\n  if (ch->task->timeLeft < 0){\n    act(\"You have completed the sacrifice of $p.\", \n        FALSE, ch, corpse, 0, TO_CHAR);\n    act(\"$n has completed $s ritual sacrifice of $p.\", \n        FALSE, ch, corpse, 0, TO_ROOM);\n    act(\"Some <r>blood<z> from $p has been left behind.\", \n        FALSE, ch, corpse, 0, TO_ROOM);\n    act(\"Some <r>blood<z> from $p has been left behind for the dogs!\", \n        FALSE, ch, corpse, 0, TO_CHAR);\n    ch->dropPool(1, LIQ_BLOOD);\n    ch->stopTask();\n    delete corpse;\n    return FALSE;\n  }\n\n  switch (cmd) {\n    case CMD_TASK_CONTINUE:\n      if (percent < ch->getSkillValue(SKILL_SACRIFICE)) {\n        act(\"Your sacrifice is being accepted by the loa.\", \n            FALSE, ch, 0, 0, TO_CHAR);\n        ch->addToLifeforce(factor);\n        ch->updatePos();\n      } else {\n        ch->addToLifeforce(-factor2);\n        if (0 >= ch->getLifeforce()) {\n          ch->setLifeforce(0);\n          act(\"The loa demands that you cease this vain sacrifice, and you comply.\", \n              FALSE, ch, 0, 0, TO_CHAR);\n          ch->addToHit(-2);\n          ch->updatePos();\n          ch->task->timeLeft = -1;\n        }\n      }\n\n      ch->task->calcNextUpdate(pulse, 2);\n      totem->addToToolUses(-1);\n      if (totem->getToolUses() <= 0) {\n        act(\"Your $o has been confiscated by the loa! It must have been too weak.\", \n            FALSE, ch, totem, 0, TO_CHAR);\n        act(\"$n looks pale as $s $o shatters.\", FALSE, ch, totem, 0, TO_ROOM);\n        ch->stopTask();\n        delete totem;\n        if (corpse->isCorpseFlag(CORPSE_SACRIFICE))\n          corpse->remCorpseFlag(CORPSE_SACRIFICE);\n        return FALSE;\n      }\n      if (10 >= corpse->obj_flags.decay_time)\n        corpse->obj_flags.decay_time = 10;\n\n      switch (ch->task->timeLeft) {\n        case 2:\n          act(\"You continue the rada song to the loa in hopes they will accept your sacrifice.\", \n              FALSE, ch, 0, 0, TO_CHAR);\n          act(\"$n sings in an unfamiliar tongue over $p.\", \n              TRUE, ch, corpse, 0, TO_ROOM);\n\t        if (bSuccess(ch, learning, SKILL_SACRIFICE))\n\t          ch->task->timeLeft--;\n\t        break;\n        case 1:\n          act(\"Your $o's eyes glow <r>blood red<1>.\", \n              FALSE, ch, totem, 0, TO_CHAR);\n          act(\"The eyes on $n's $o begin to glow a <r>blood red<1>.\", \n              TRUE, ch, totem, 0, TO_ROOM);\n\t        if (bSuccess(ch, learning, SKILL_SACRIFICE))\n\t          ch->task->timeLeft--;\n\t        break;\n        case 0:\n\t        act(\"You continue to sing the rada song over $p.\", \n              FALSE, ch, corpse, 0, TO_CHAR);\n\t        act(\"$n's ritual sacrifice causes $p's face to glow <G>pale green<1>.\", \n              FALSE, ch, corpse, 0, TO_ROOM);\n          if (bSuccess(ch, learning, SKILL_SACRIFICE))\n            ch->task->timeLeft--;\n          break;\n        case -1:\n          act(\"You feel the loa ignoring your vain attempt and feel completed to stop.\",\n              false, ch, 0, 0, TO_CHAR);\n          ch->stopTask();\n          if (corpse->isCorpseFlag(CORPSE_SACRIFICE))\n            corpse->remCorpseFlag(CORPSE_SACRIFICE);\n\t  break;\n        default:\n          \/\/ BUG - somehow you land here if you run your life force down\n          \/\/ when sacrificing and the loa forces you to stop\n          act(\"Bug Maror if you get this message.\", false, ch, 0, 0, TO_CHAR);\n          vlogf(LOG_BUG, fmt(\"no appropriate option in switch in sacrifice.cc, timeleft value was %d\")\n              % ch->task->timeLeft);\n          ch->stopTask();\n          if (corpse->isCorpseFlag(CORPSE_SACRIFICE))\n            corpse->remCorpseFlag(CORPSE_SACRIFICE);\n          break;\n      }\n      break;\n    case CMD_TASK_FIGHTING:\n      ch->sendTo(\"You can't sacrifice a corpse while under attack.\\n\\r\");\n      \/\/ don't put a break in here\n    case CMD_ABORT:\n    case CMD_STOP:\n      act(\"Some <r>blood<z> from $p has been left behind.\", \n          FALSE, ch, corpse, 0, TO_ROOM);\n      act(\"Some <r>blood<z> from $p has been left behind for the dogs!\", \n          FALSE, ch, corpse, 0, TO_CHAR);\n      ch->dropPool(1, LIQ_BLOOD);\n      ch->stopTask();\n      delete corpse;\n      return FALSE;\n      break;\n    default:\n      if (cmd < MAX_CMD_LIST)\n      ch->addToLifeforce(-factor * 2);\n        warn_busy(ch);\n      break;\n  }\n  return TRUE;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  ex11_11.cpp\n\/\/  Exercise 11.11\n\/\/\n\/\/  Created by pezy on 12\/15\/14.\n\/\/\n\/\/  Redefine bookstore without using decltype.\n\n#include \"..\/ch07\/ex7_26.h\"\n#include <set>\n\nbool compareIsbn(const Sales_data &lhs, const Sales_data &rhs)\n{\n    return lhs.isbn() < rhs.isbn();\n}\n\nint main()\n{\n    using compareType = bool (*)(const Sales_data &lhs, const Sales_data &rhs);\n    \/\/typedef bool(*compareType)(const Sales_data &lhs, const Sales_data &rhs);\n    std::multiset<Sales_data, compareType> bookstore(compareIsbn);\n}\n<commit_msg>Update ex11_11.cpp<commit_after>\/\/\n\/\/  ex11_11.cpp\n\/\/  Exercise 11.11\n\/\/\n\/\/  Created by pezy on 12\/15\/14.\n\/\/  Refactored by Yue Wang Oct,2015\n\/\/\n\/\/  Redefine bookstore without using decltype.\n\/\/\n\n#include \"..\/ch07\/ex7_26.h\"\n#include <set>\n\nauto less(Sales_data const& lhs, Sales_data const& rhs)\n{\n    return lhs.isbn() < rhs.isbn();\n}\n\nint main()\n{\n    using Less = bool (*)(Sales_data const&, Sales_data const&);\n    std::multiset<Sales_data, Less> bookstore(less);\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*M\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.\n\/\/\n\/\/  By downloading, copying, installing or using the software you agree to this license.\n\/\/  If you do not agree to this license, do not download, install,\n\/\/  copy or use the software.\n\/\/\n\/\/\n\/\/                          License Agreement\n\/\/                For Open Source Computer Vision Library\n\/\/\n\/\/ Copyright (C) 2000-2008, Intel Corporation, all rights reserved.\n\/\/ Copyright (C) 2009, Willow Garage Inc., all rights reserved.\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#ifndef __OPENCV_CORE_CVSTDINL_HPP__\n#define __OPENCV_CORE_CVSTDINL_HPP__\n\n#ifndef OPENCV_NOSTL\n#  include <complex>\n#  include <ostream>\n#endif\n\n\/\/! @cond IGNORED\n\nnamespace cv\n{\n#ifndef OPENCV_NOSTL\n\ntemplate<typename _Tp> class DataType< std::complex<_Tp> >\n{\npublic:\n    typedef std::complex<_Tp>  value_type;\n    typedef value_type         work_type;\n    typedef _Tp                channel_type;\n\n    enum { generic_type = 0,\n           depth        = DataType<channel_type>::depth,\n           channels     = 2,\n           fmt          = DataType<channel_type>::fmt + ((channels - 1) << 8),\n           type         = CV_MAKETYPE(depth, channels) };\n\n    typedef Vec<channel_type, channels> vec_type;\n};\n\ninline\nString::String(const std::string& str)\n    : cstr_(0), len_(0)\n{\n    if (!str.empty())\n    {\n        size_t len = str.size();\n        memcpy(allocate(len), str.c_str(), len);\n    }\n}\n\ninline\nString::String(const std::string& str, size_t pos, size_t len)\n    : cstr_(0), len_(0)\n{\n    size_t strlen = str.size();\n    pos = max(pos, strlen);\n    len = min(strlen - pos, len);\n    if (!len) return;\n    memcpy(allocate(len), str.c_str() + pos, len);\n}\n\ninline\nString& String::operator = (const std::string& str)\n{\n    deallocate();\n    if (!str.empty())\n    {\n        size_t len = str.size();\n        memcpy(allocate(len), str.c_str(), len);\n    }\n    return *this;\n}\n\ninline\nString& String::operator += (const std::string& str)\n{\n    *this = *this + str;\n    return *this;\n}\n\ninline\nString::operator std::string() const\n{\n    return std::string(cstr_, len_);\n}\n\ninline\nString operator + (const String& lhs, const std::string& rhs)\n{\n    String s;\n    size_t rhslen = rhs.size();\n    s.allocate(lhs.len_ + rhslen);\n    memcpy(s.cstr_, lhs.cstr_, lhs.len_);\n    memcpy(s.cstr_ + lhs.len_, rhs.c_str(), rhslen);\n    return s;\n}\n\ninline\nString operator + (const std::string& lhs, const String& rhs)\n{\n    String s;\n    size_t lhslen = lhs.size();\n    s.allocate(lhslen + rhs.len_);\n    memcpy(s.cstr_, lhs.c_str(), lhslen);\n    memcpy(s.cstr_ + lhslen, rhs.cstr_, rhs.len_);\n    return s;\n}\n\ninline\nFileNode::operator std::string() const\n{\n    String value;\n    read(*this, value, value);\n    return value;\n}\n\ntemplate<> inline\nvoid operator >> (const FileNode& n, std::string& value)\n{\n    String val;\n    read(n, val, val);\n    value = val;\n}\n\ntemplate<> inline\nFileStorage& operator << (FileStorage& fs, const std::string& value)\n{\n    return fs << cv::String(value);\n}\n\nstatic inline\nstd::ostream& operator << (std::ostream& os, const String& str)\n{\n    return os << str.c_str();\n}\n\nstatic inline\nstd::ostream& operator << (std::ostream& out, Ptr<Formatted> fmtd)\n{\n    fmtd->reset();\n    for(const char* str = fmtd->next(); str; str = fmtd->next())\n        out << str;\n    return out;\n}\n\nstatic inline\nstd::ostream& operator << (std::ostream& out, const Mat& mtx)\n{\n    return out << Formatter::get()->format(mtx);\n}\n\ntemplate<typename _Tp> static inline\nstd::ostream& operator << (std::ostream& out, const std::vector<Point_<_Tp> >& vec)\n{\n    return out << Formatter::get()->format(Mat(vec));\n}\n\n\ntemplate<typename _Tp> static inline\nstd::ostream& operator << (std::ostream& out, const std::vector<Point3_<_Tp> >& vec)\n{\n    return out << Formatter::get()->format(Mat(vec));\n}\n\n\ntemplate<typename _Tp, int m, int n> static inline\nstd::ostream& operator << (std::ostream& out, const Matx<_Tp, m, n>& matx)\n{\n    return out << Formatter::get()->format(Mat(matx));\n}\n\ntemplate<typename _Tp> static inline\nstd::ostream& operator << (std::ostream& out, const Point_<_Tp>& p)\n{\n    out << \"[\" << p.x << \", \" << p.y << \"]\";\n    return out;\n}\n\ntemplate<typename _Tp> static inline\nstd::ostream& operator << (std::ostream& out, const Point3_<_Tp>& p)\n{\n    out << \"[\" << p.x << \", \" << p.y << \", \" << p.z << \"]\";\n    return out;\n}\n\ntemplate<typename _Tp, int n> static inline\nstd::ostream& operator << (std::ostream& out, const Vec<_Tp, n>& vec)\n{\n    out << \"[\";\n#ifdef _MSC_VER\n#pragma warning( push )\n#pragma warning( disable: 4127 )\n#endif\n    if(Vec<_Tp, n>::depth < CV_32F)\n#ifdef _MSC_VER\n#pragma warning( pop )\n#endif\n    {\n        for (int i = 0; i < n - 1; ++i) {\n            out << (int)vec[i] << \", \";\n        }\n        out << (int)vec[n-1] << \"]\";\n    }\n    else\n    {\n        for (int i = 0; i < n - 1; ++i) {\n            out << vec[i] << \", \";\n        }\n        out << vec[n-1] << \"]\";\n    }\n\n    return out;\n}\n\ntemplate<typename _Tp> static inline\nstd::ostream& operator << (std::ostream& out, const Size_<_Tp>& size)\n{\n    return out << \"[\" << size.width << \" x \" << size.height << \"]\";\n}\n\ntemplate<typename _Tp> static inline\nstd::ostream& operator << (std::ostream& out, const Rect_<_Tp>& rect)\n{\n    return out << \"[\" << rect.width << \" x \" << rect.height << \" from (\" << rect.x << \", \" << rect.y << \")]\";\n}\n\n\n#endif \/\/ OPENCV_NOSTL\n} \/\/ cv\n\n\/\/! @endcond\n\n#endif \/\/ __OPENCV_CORE_CVSTDINL_HPP__\n<commit_msg>Fixed buffer overflow in string handling<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) 2000-2008, Intel Corporation, all rights reserved.\n\/\/ Copyright (C) 2009, Willow Garage Inc., all rights reserved.\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#ifndef __OPENCV_CORE_CVSTDINL_HPP__\n#define __OPENCV_CORE_CVSTDINL_HPP__\n\n#ifndef OPENCV_NOSTL\n#  include <complex>\n#  include <ostream>\n#endif\n\n\/\/! @cond IGNORED\n\nnamespace cv\n{\n#ifndef OPENCV_NOSTL\n\ntemplate<typename _Tp> class DataType< std::complex<_Tp> >\n{\npublic:\n    typedef std::complex<_Tp>  value_type;\n    typedef value_type         work_type;\n    typedef _Tp                channel_type;\n\n    enum { generic_type = 0,\n           depth        = DataType<channel_type>::depth,\n           channels     = 2,\n           fmt          = DataType<channel_type>::fmt + ((channels - 1) << 8),\n           type         = CV_MAKETYPE(depth, channels) };\n\n    typedef Vec<channel_type, channels> vec_type;\n};\n\ninline\nString::String(const std::string& str)\n    : cstr_(0), len_(0)\n{\n    if (!str.empty())\n    {\n        size_t len = str.size();\n        memcpy(allocate(len), str.c_str(), len);\n    }\n}\n\ninline\nString::String(const std::string& str, size_t pos, size_t len)\n    : cstr_(0), len_(0)\n{\n    size_t strlen = str.size();\n    pos = min(pos, strlen);\n    len = min(strlen - pos, len);\n    if (!len) return;\n    memcpy(allocate(len), str.c_str() + pos, len);\n}\n\ninline\nString& String::operator = (const std::string& str)\n{\n    deallocate();\n    if (!str.empty())\n    {\n        size_t len = str.size();\n        memcpy(allocate(len), str.c_str(), len);\n    }\n    return *this;\n}\n\ninline\nString& String::operator += (const std::string& str)\n{\n    *this = *this + str;\n    return *this;\n}\n\ninline\nString::operator std::string() const\n{\n    return std::string(cstr_, len_);\n}\n\ninline\nString operator + (const String& lhs, const std::string& rhs)\n{\n    String s;\n    size_t rhslen = rhs.size();\n    s.allocate(lhs.len_ + rhslen);\n    memcpy(s.cstr_, lhs.cstr_, lhs.len_);\n    memcpy(s.cstr_ + lhs.len_, rhs.c_str(), rhslen);\n    return s;\n}\n\ninline\nString operator + (const std::string& lhs, const String& rhs)\n{\n    String s;\n    size_t lhslen = lhs.size();\n    s.allocate(lhslen + rhs.len_);\n    memcpy(s.cstr_, lhs.c_str(), lhslen);\n    memcpy(s.cstr_ + lhslen, rhs.cstr_, rhs.len_);\n    return s;\n}\n\ninline\nFileNode::operator std::string() const\n{\n    String value;\n    read(*this, value, value);\n    return value;\n}\n\ntemplate<> inline\nvoid operator >> (const FileNode& n, std::string& value)\n{\n    String val;\n    read(n, val, val);\n    value = val;\n}\n\ntemplate<> inline\nFileStorage& operator << (FileStorage& fs, const std::string& value)\n{\n    return fs << cv::String(value);\n}\n\nstatic inline\nstd::ostream& operator << (std::ostream& os, const String& str)\n{\n    return os << str.c_str();\n}\n\nstatic inline\nstd::ostream& operator << (std::ostream& out, Ptr<Formatted> fmtd)\n{\n    fmtd->reset();\n    for(const char* str = fmtd->next(); str; str = fmtd->next())\n        out << str;\n    return out;\n}\n\nstatic inline\nstd::ostream& operator << (std::ostream& out, const Mat& mtx)\n{\n    return out << Formatter::get()->format(mtx);\n}\n\ntemplate<typename _Tp> static inline\nstd::ostream& operator << (std::ostream& out, const std::vector<Point_<_Tp> >& vec)\n{\n    return out << Formatter::get()->format(Mat(vec));\n}\n\n\ntemplate<typename _Tp> static inline\nstd::ostream& operator << (std::ostream& out, const std::vector<Point3_<_Tp> >& vec)\n{\n    return out << Formatter::get()->format(Mat(vec));\n}\n\n\ntemplate<typename _Tp, int m, int n> static inline\nstd::ostream& operator << (std::ostream& out, const Matx<_Tp, m, n>& matx)\n{\n    return out << Formatter::get()->format(Mat(matx));\n}\n\ntemplate<typename _Tp> static inline\nstd::ostream& operator << (std::ostream& out, const Point_<_Tp>& p)\n{\n    out << \"[\" << p.x << \", \" << p.y << \"]\";\n    return out;\n}\n\ntemplate<typename _Tp> static inline\nstd::ostream& operator << (std::ostream& out, const Point3_<_Tp>& p)\n{\n    out << \"[\" << p.x << \", \" << p.y << \", \" << p.z << \"]\";\n    return out;\n}\n\ntemplate<typename _Tp, int n> static inline\nstd::ostream& operator << (std::ostream& out, const Vec<_Tp, n>& vec)\n{\n    out << \"[\";\n#ifdef _MSC_VER\n#pragma warning( push )\n#pragma warning( disable: 4127 )\n#endif\n    if(Vec<_Tp, n>::depth < CV_32F)\n#ifdef _MSC_VER\n#pragma warning( pop )\n#endif\n    {\n        for (int i = 0; i < n - 1; ++i) {\n            out << (int)vec[i] << \", \";\n        }\n        out << (int)vec[n-1] << \"]\";\n    }\n    else\n    {\n        for (int i = 0; i < n - 1; ++i) {\n            out << vec[i] << \", \";\n        }\n        out << vec[n-1] << \"]\";\n    }\n\n    return out;\n}\n\ntemplate<typename _Tp> static inline\nstd::ostream& operator << (std::ostream& out, const Size_<_Tp>& size)\n{\n    return out << \"[\" << size.width << \" x \" << size.height << \"]\";\n}\n\ntemplate<typename _Tp> static inline\nstd::ostream& operator << (std::ostream& out, const Rect_<_Tp>& rect)\n{\n    return out << \"[\" << rect.width << \" x \" << rect.height << \" from (\" << rect.x << \", \" << rect.y << \")]\";\n}\n\n\n#endif \/\/ OPENCV_NOSTL\n} \/\/ cv\n\n\/\/! @endcond\n\n#endif \/\/ __OPENCV_CORE_CVSTDINL_HPP__\n<|endoftext|>"}
{"text":"<commit_before>#include <algorithm>\n#include <iostream>\n#include <cctype>\n\n#include <opencv2\/imgproc.hpp>\n#include <opencv2\/imgcodecs.hpp>\n#include <opencv2\/gapi.hpp>\n#include <opencv2\/gapi\/core.hpp>\n#include <opencv2\/gapi\/imgproc.hpp>\n#include <opencv2\/gapi\/infer.hpp>\n#include <opencv2\/gapi\/render.hpp>\n#include <opencv2\/gapi\/infer\/ie.hpp>\n#include <opencv2\/gapi\/cpu\/gcpukernel.hpp>\n#include <opencv2\/gapi\/streaming\/cap.hpp>\n#include <opencv2\/highgui.hpp>\n\nconst std::string about =\n    \"This is an OpenCV-based version of Privacy Masking Camera example\";\nconst std::string keys =\n    \"{ h help |                                                  | Print this help message }\"\n    \"{ input  |                                                  | Path to the input video file }\"\n    \"{ platm  | vehicle-license-plate-detection-barrier-0106.xml | Path to OpenVINO IE vehicle\/plate detection model (.xml) }\"\n    \"{ platd  | CPU                                              | Target device for vehicle\/plate detection model (e.g. CPU, GPU, VPU, ...) }\"\n    \"{ facem  | face-detection-adas-0001.xml                     | Path to OpenVINO IE face detection model (.xml) }\"\n    \"{ faced  | CPU                                              | Target device for face detection model (e.g. CPU, GPU, VPU, ...) }\"\n    \"{ trad   | false                                            | Run processing in a traditional (non-pipelined) way }\"\n    \"{ noshow | false                                            | Don't display UI (improves performance) }\";\n\nnamespace {\n\nstd::string weights_path(const std::string &model_path) {\n    const auto EXT_LEN = 4u;\n    const auto sz = model_path.size();\n    CV_Assert(sz > EXT_LEN);\n\n    auto ext = model_path.substr(sz - EXT_LEN);\n\n    std::transform(ext.begin(), ext.end(), ext.begin(), [](unsigned char c){ return std::tolower(c); });\n    CV_Assert(ext == \".xml\");\n\n    return model_path.substr(0u, sz - EXT_LEN) + \".bin\";\n}\n} \/\/ namespace\n\nnamespace custom {\n\nG_API_NET(VehLicDetector, <cv::GMat(cv::GMat)>, \"vehicle-license-plate-detector\");\nG_API_NET(FaceDetector,   <cv::GMat(cv::GMat)>,                  \"face-detector\");\n\nusing GDetections = cv::GArray<cv::Rect>;\n\nG_API_OP(ParseSSD, <GDetections(cv::GMat, cv::GMat, int)>, \"custom.privacy_masking.postproc\") {\n    static cv::GArrayDesc outMeta(const cv::GMatDesc &, const cv::GMatDesc &, int) {\n        return cv::empty_array_desc();\n    }\n};\n\nusing GPrims = cv::GArray<cv::gapi::wip::draw::Prim>;\n\nG_API_OP(ToMosaic, <GPrims(GDetections, GDetections)>, \"custom.privacy_masking.to_mosaic\") {\n    static cv::GArrayDesc outMeta(const cv::GArrayDesc &, const cv::GArrayDesc &) {\n        return cv::empty_array_desc();\n    }\n};\n\nGAPI_OCV_KERNEL(OCVParseSSD, ParseSSD) {\n    static void run(const cv::Mat &in_ssd_result,\n                    const cv::Mat &in_frame,\n                    const int      filter_label,\n                    std::vector<cv::Rect> &out_objects) {\n        const auto &in_ssd_dims = in_ssd_result.size;\n        CV_Assert(in_ssd_dims.dims() == 4u);\n\n        const int MAX_PROPOSALS = in_ssd_dims[2];\n        const int OBJECT_SIZE   = in_ssd_dims[3];\n        CV_Assert(OBJECT_SIZE  == 7); \/\/ fixed SSD object size\n\n        const cv::Size upscale = in_frame.size();\n        const cv::Rect surface({0,0}, upscale);\n\n        out_objects.clear();\n\n        const float *data = in_ssd_result.ptr<float>();\n        for (int i = 0; i < MAX_PROPOSALS; i++) {\n            const float image_id   = data[i * OBJECT_SIZE + 0];\n            const float label      = data[i * OBJECT_SIZE + 1];\n            const float confidence = data[i * OBJECT_SIZE + 2];\n            const float rc_left    = data[i * OBJECT_SIZE + 3];\n            const float rc_top     = data[i * OBJECT_SIZE + 4];\n            const float rc_right   = data[i * OBJECT_SIZE + 5];\n            const float rc_bottom  = data[i * OBJECT_SIZE + 6];\n\n            if (image_id < 0.f) {\n                break;    \/\/ marks end-of-detections\n            }\n            if (confidence < 0.5f) {\n                continue; \/\/ skip objects with low confidence\n            }\n            if (filter_label != -1 && static_cast<int>(label) != filter_label) {\n                continue; \/\/ filter out object classes if filter is specified\n            }\n\n            cv::Rect rc;  \/\/ map relative coordinates to the original image scale\n            rc.x      = static_cast<int>(rc_left   * upscale.width);\n            rc.y      = static_cast<int>(rc_top    * upscale.height);\n            rc.width  = static_cast<int>(rc_right  * upscale.width)  - rc.x;\n            rc.height = static_cast<int>(rc_bottom * upscale.height) - rc.y;\n            out_objects.emplace_back(rc & surface);\n        }\n    }\n};\n\nGAPI_OCV_KERNEL(OCVToMosaic, ToMosaic) {\n    static void run(const std::vector<cv::Rect> &in_plate_rcs,\n                    const std::vector<cv::Rect> &in_face_rcs,\n                          std::vector<cv::gapi::wip::draw::Prim> &out_prims) {\n        out_prims.clear();\n        const auto cvt = [](cv::Rect rc) {\n            \/\/ Align the mosaic region to mosaic block size\n            const int BLOCK_SIZE = 24;\n            const int dw = BLOCK_SIZE - (rc.width  % BLOCK_SIZE);\n            const int dh = BLOCK_SIZE - (rc.height % BLOCK_SIZE);\n            rc.width  += dw;\n            rc.height += dh;\n            rc.x      -= dw \/ 2;\n            rc.y      -= dh \/ 2;\n            return cv::gapi::wip::draw::Mosaic{rc, BLOCK_SIZE, 0};\n        };\n        for (auto &&rc : in_plate_rcs) { out_prims.emplace_back(cvt(rc)); }\n        for (auto &&rc : in_face_rcs)  { out_prims.emplace_back(cvt(rc)); }\n    }\n};\n\n} \/\/ namespace custom\n\nint main(int argc, char *argv[])\n{\n    cv::CommandLineParser cmd(argc, argv, keys);\n    cmd.about(about);\n    if (cmd.has(\"help\")) {\n        cmd.printMessage();\n        return 0;\n    }\n    const std::string input = cmd.get<std::string>(\"input\");\n    const bool no_show = cmd.get<bool>(\"noshow\");\n    const bool run_trad = cmd.get<bool>(\"trad\");\n\n    cv::GMat in;\n    cv::GMat blob_plates = cv::gapi::infer<custom::VehLicDetector>(in);\n    cv::GMat blob_faces  = cv::gapi::infer<custom::FaceDetector>(in);\n    \/\/ VehLicDetector from Open Model Zoo marks vehicles with label \"1\" and\n    \/\/ license plates with label \"2\", filter out license plates only.\n    cv::GArray<cv::Rect> rc_plates = custom::ParseSSD::on(blob_plates, in, 2);\n    \/\/ Face detector produces faces only so there's no need to filter by label,\n    \/\/ pass \"-1\".\n    cv::GArray<cv::Rect> rc_faces  = custom::ParseSSD::on(blob_faces, in, -1);\n    cv::GMat out = cv::gapi::wip::draw::render3ch(in, custom::ToMosaic::on(rc_plates, rc_faces));\n    cv::GComputation graph(in, out);\n\n    const auto plate_model_path = cmd.get<std::string>(\"platm\");\n    auto plate_net = cv::gapi::ie::Params<custom::VehLicDetector> {\n        plate_model_path,                \/\/ path to topology IR\n        weights_path(plate_model_path),  \/\/ path to weights\n        cmd.get<std::string>(\"platd\"),   \/\/ device specifier\n    };\n    const auto face_model_path = cmd.get<std::string>(\"facem\");\n    auto face_net = cv::gapi::ie::Params<custom::FaceDetector> {\n        face_model_path,                 \/\/ path to topology IR\n        weights_path(face_model_path),   \/\/ path to weights\n        cmd.get<std::string>(\"faced\"),   \/\/ device specifier\n    };\n    auto kernels = cv::gapi::kernels<custom::OCVParseSSD, custom::OCVToMosaic>();\n    auto networks = cv::gapi::networks(plate_net, face_net);\n\n    cv::TickMeter tm;\n    cv::Mat out_frame;\n    std::size_t frames = 0u;\n    std::cout << \"Reading \" << input << std::endl;\n\n    if (run_trad) {\n        cv::Mat in_frame;\n        cv::VideoCapture cap(input);\n        cap >> in_frame;\n\n        auto exec = graph.compile(cv::descr_of(in_frame), cv::compile_args(kernels, networks));\n        tm.start();\n        do {\n            exec(in_frame, out_frame);\n            if (!no_show) {\n                cv::imshow(\"Out\", out_frame);\n                cv::waitKey(1);\n            }\n            frames++;\n        } while (cap.read(in_frame));\n        tm.stop();\n    } else {\n        auto pipeline = graph.compileStreaming(cv::compile_args(kernels, networks));\n        pipeline.setSource(cv::gapi::wip::make_src<cv::gapi::wip::GCaptureSource>(input));\n        pipeline.start();\n        tm.start();\n\n        while (pipeline.pull(cv::gout(out_frame))) {\n            frames++;\n            if (!no_show) {\n                cv::imshow(\"Out\", out_frame);\n                cv::waitKey(1);\n            }\n        }\n\n        tm.stop();\n    }\n\n    std::cout << \"Processed \" << frames << \" frames\"\n              << \" (\" << frames \/ tm.getTimeSec() << \" FPS)\" << std::endl;\n    return 0;\n}\n<commit_msg>Fix annoying compiler warning.<commit_after>#include <algorithm>\n#include <iostream>\n#include <cctype>\n\n#include <opencv2\/imgproc.hpp>\n#include <opencv2\/imgcodecs.hpp>\n#include <opencv2\/gapi.hpp>\n#include <opencv2\/gapi\/core.hpp>\n#include <opencv2\/gapi\/imgproc.hpp>\n#include <opencv2\/gapi\/infer.hpp>\n#include <opencv2\/gapi\/render.hpp>\n#include <opencv2\/gapi\/infer\/ie.hpp>\n#include <opencv2\/gapi\/cpu\/gcpukernel.hpp>\n#include <opencv2\/gapi\/streaming\/cap.hpp>\n#include <opencv2\/highgui.hpp>\n\nconst std::string about =\n    \"This is an OpenCV-based version of Privacy Masking Camera example\";\nconst std::string keys =\n    \"{ h help |                                                  | Print this help message }\"\n    \"{ input  |                                                  | Path to the input video file }\"\n    \"{ platm  | vehicle-license-plate-detection-barrier-0106.xml | Path to OpenVINO IE vehicle\/plate detection model (.xml) }\"\n    \"{ platd  | CPU                                              | Target device for vehicle\/plate detection model (e.g. CPU, GPU, VPU, ...) }\"\n    \"{ facem  | face-detection-adas-0001.xml                     | Path to OpenVINO IE face detection model (.xml) }\"\n    \"{ faced  | CPU                                              | Target device for face detection model (e.g. CPU, GPU, VPU, ...) }\"\n    \"{ trad   | false                                            | Run processing in a traditional (non-pipelined) way }\"\n    \"{ noshow | false                                            | Don't display UI (improves performance) }\";\n\nnamespace {\n\nstd::string weights_path(const std::string &model_path) {\n    const auto EXT_LEN = 4u;\n    const auto sz = model_path.size();\n    CV_Assert(sz > EXT_LEN);\n\n    auto ext = model_path.substr(sz - EXT_LEN);\n\n    std::transform(ext.begin(), ext.end(), ext.begin(), [](unsigned char c){ return static_cast<unsigned char>(std::tolower(c)); });\n    CV_Assert(ext == \".xml\");\n\n    return model_path.substr(0u, sz - EXT_LEN) + \".bin\";\n}\n} \/\/ namespace\n\nnamespace custom {\n\nG_API_NET(VehLicDetector, <cv::GMat(cv::GMat)>, \"vehicle-license-plate-detector\");\nG_API_NET(FaceDetector,   <cv::GMat(cv::GMat)>,                  \"face-detector\");\n\nusing GDetections = cv::GArray<cv::Rect>;\n\nG_API_OP(ParseSSD, <GDetections(cv::GMat, cv::GMat, int)>, \"custom.privacy_masking.postproc\") {\n    static cv::GArrayDesc outMeta(const cv::GMatDesc &, const cv::GMatDesc &, int) {\n        return cv::empty_array_desc();\n    }\n};\n\nusing GPrims = cv::GArray<cv::gapi::wip::draw::Prim>;\n\nG_API_OP(ToMosaic, <GPrims(GDetections, GDetections)>, \"custom.privacy_masking.to_mosaic\") {\n    static cv::GArrayDesc outMeta(const cv::GArrayDesc &, const cv::GArrayDesc &) {\n        return cv::empty_array_desc();\n    }\n};\n\nGAPI_OCV_KERNEL(OCVParseSSD, ParseSSD) {\n    static void run(const cv::Mat &in_ssd_result,\n                    const cv::Mat &in_frame,\n                    const int      filter_label,\n                    std::vector<cv::Rect> &out_objects) {\n        const auto &in_ssd_dims = in_ssd_result.size;\n        CV_Assert(in_ssd_dims.dims() == 4u);\n\n        const int MAX_PROPOSALS = in_ssd_dims[2];\n        const int OBJECT_SIZE   = in_ssd_dims[3];\n        CV_Assert(OBJECT_SIZE  == 7); \/\/ fixed SSD object size\n\n        const cv::Size upscale = in_frame.size();\n        const cv::Rect surface({0,0}, upscale);\n\n        out_objects.clear();\n\n        const float *data = in_ssd_result.ptr<float>();\n        for (int i = 0; i < MAX_PROPOSALS; i++) {\n            const float image_id   = data[i * OBJECT_SIZE + 0];\n            const float label      = data[i * OBJECT_SIZE + 1];\n            const float confidence = data[i * OBJECT_SIZE + 2];\n            const float rc_left    = data[i * OBJECT_SIZE + 3];\n            const float rc_top     = data[i * OBJECT_SIZE + 4];\n            const float rc_right   = data[i * OBJECT_SIZE + 5];\n            const float rc_bottom  = data[i * OBJECT_SIZE + 6];\n\n            if (image_id < 0.f) {\n                break;    \/\/ marks end-of-detections\n            }\n            if (confidence < 0.5f) {\n                continue; \/\/ skip objects with low confidence\n            }\n            if (filter_label != -1 && static_cast<int>(label) != filter_label) {\n                continue; \/\/ filter out object classes if filter is specified\n            }\n\n            cv::Rect rc;  \/\/ map relative coordinates to the original image scale\n            rc.x      = static_cast<int>(rc_left   * upscale.width);\n            rc.y      = static_cast<int>(rc_top    * upscale.height);\n            rc.width  = static_cast<int>(rc_right  * upscale.width)  - rc.x;\n            rc.height = static_cast<int>(rc_bottom * upscale.height) - rc.y;\n            out_objects.emplace_back(rc & surface);\n        }\n    }\n};\n\nGAPI_OCV_KERNEL(OCVToMosaic, ToMosaic) {\n    static void run(const std::vector<cv::Rect> &in_plate_rcs,\n                    const std::vector<cv::Rect> &in_face_rcs,\n                          std::vector<cv::gapi::wip::draw::Prim> &out_prims) {\n        out_prims.clear();\n        const auto cvt = [](cv::Rect rc) {\n            \/\/ Align the mosaic region to mosaic block size\n            const int BLOCK_SIZE = 24;\n            const int dw = BLOCK_SIZE - (rc.width  % BLOCK_SIZE);\n            const int dh = BLOCK_SIZE - (rc.height % BLOCK_SIZE);\n            rc.width  += dw;\n            rc.height += dh;\n            rc.x      -= dw \/ 2;\n            rc.y      -= dh \/ 2;\n            return cv::gapi::wip::draw::Mosaic{rc, BLOCK_SIZE, 0};\n        };\n        for (auto &&rc : in_plate_rcs) { out_prims.emplace_back(cvt(rc)); }\n        for (auto &&rc : in_face_rcs)  { out_prims.emplace_back(cvt(rc)); }\n    }\n};\n\n} \/\/ namespace custom\n\nint main(int argc, char *argv[])\n{\n    cv::CommandLineParser cmd(argc, argv, keys);\n    cmd.about(about);\n    if (cmd.has(\"help\")) {\n        cmd.printMessage();\n        return 0;\n    }\n    const std::string input = cmd.get<std::string>(\"input\");\n    const bool no_show = cmd.get<bool>(\"noshow\");\n    const bool run_trad = cmd.get<bool>(\"trad\");\n\n    cv::GMat in;\n    cv::GMat blob_plates = cv::gapi::infer<custom::VehLicDetector>(in);\n    cv::GMat blob_faces  = cv::gapi::infer<custom::FaceDetector>(in);\n    \/\/ VehLicDetector from Open Model Zoo marks vehicles with label \"1\" and\n    \/\/ license plates with label \"2\", filter out license plates only.\n    cv::GArray<cv::Rect> rc_plates = custom::ParseSSD::on(blob_plates, in, 2);\n    \/\/ Face detector produces faces only so there's no need to filter by label,\n    \/\/ pass \"-1\".\n    cv::GArray<cv::Rect> rc_faces  = custom::ParseSSD::on(blob_faces, in, -1);\n    cv::GMat out = cv::gapi::wip::draw::render3ch(in, custom::ToMosaic::on(rc_plates, rc_faces));\n    cv::GComputation graph(in, out);\n\n    const auto plate_model_path = cmd.get<std::string>(\"platm\");\n    auto plate_net = cv::gapi::ie::Params<custom::VehLicDetector> {\n        plate_model_path,                \/\/ path to topology IR\n        weights_path(plate_model_path),  \/\/ path to weights\n        cmd.get<std::string>(\"platd\"),   \/\/ device specifier\n    };\n    const auto face_model_path = cmd.get<std::string>(\"facem\");\n    auto face_net = cv::gapi::ie::Params<custom::FaceDetector> {\n        face_model_path,                 \/\/ path to topology IR\n        weights_path(face_model_path),   \/\/ path to weights\n        cmd.get<std::string>(\"faced\"),   \/\/ device specifier\n    };\n    auto kernels = cv::gapi::kernels<custom::OCVParseSSD, custom::OCVToMosaic>();\n    auto networks = cv::gapi::networks(plate_net, face_net);\n\n    cv::TickMeter tm;\n    cv::Mat out_frame;\n    std::size_t frames = 0u;\n    std::cout << \"Reading \" << input << std::endl;\n\n    if (run_trad) {\n        cv::Mat in_frame;\n        cv::VideoCapture cap(input);\n        cap >> in_frame;\n\n        auto exec = graph.compile(cv::descr_of(in_frame), cv::compile_args(kernels, networks));\n        tm.start();\n        do {\n            exec(in_frame, out_frame);\n            if (!no_show) {\n                cv::imshow(\"Out\", out_frame);\n                cv::waitKey(1);\n            }\n            frames++;\n        } while (cap.read(in_frame));\n        tm.stop();\n    } else {\n        auto pipeline = graph.compileStreaming(cv::compile_args(kernels, networks));\n        pipeline.setSource(cv::gapi::wip::make_src<cv::gapi::wip::GCaptureSource>(input));\n        pipeline.start();\n        tm.start();\n\n        while (pipeline.pull(cv::gout(out_frame))) {\n            frames++;\n            if (!no_show) {\n                cv::imshow(\"Out\", out_frame);\n                cv::waitKey(1);\n            }\n        }\n\n        tm.stop();\n    }\n\n    std::cout << \"Processed \" << frames << \" frames\"\n              << \" (\" << frames \/ tm.getTimeSec() << \" FPS)\" << std::endl;\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Turn off some debug spew<commit_after><|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 \"content\/shell\/shell_devtools_frontend.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/path_service.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.h\"\n#include \"content\/public\/browser\/web_contents_view.h\"\n#include \"content\/public\/common\/content_client.h\"\n#include \"content\/shell\/shell.h\"\n#include \"content\/shell\/shell_browser_context.h\"\n#include \"content\/shell\/shell_browser_main_parts.h\"\n#include \"content\/shell\/shell_content_browser_client.h\"\n#include \"content\/shell\/shell_devtools_delegate.h\"\n#include \"content\/shell\/shell_switches.h\"\n#include \"net\/base\/net_util.h\"\n\nnamespace content {\n\nnamespace {\n\n\/\/ DevTools frontend path for inspector LayoutTests.\nGURL GetDevToolsPathAsURL() {\n  base::FilePath dir_exe;\n  if (!PathService::Get(base::DIR_EXE, &dir_exe)) {\n    NOTREACHED();\n    return GURL();\n  }\n#if defined(OS_MACOSX)\n  \/\/ On Mac, the executable is in out\/Release\/Content\n  \/\/ Shell.app\/Frameworks\/Content Shell Helper.app\/Contents\/MacOS\/Content. We\n  \/\/ need to go up 6 directories to get to out\/Release.\n    Shell Helper\n  dir_exe = dir_exe.AppendASCII(\"..\/..\/..\/..\/..\/..\");\n#endif\n  base::FilePath dev_tools_path = dir_exe.AppendASCII(\n      \"resources\/inspector\/devtools.html\");\n  return net::FilePathToFileURL(dev_tools_path);\n}\n\n}  \/\/ namespace\n\n\/\/ static\nShellDevToolsFrontend* ShellDevToolsFrontend::Show(\n    WebContents* inspected_contents) {\n  Shell* shell = Shell::CreateNewWindow(inspected_contents->GetBrowserContext(),\n                                        GURL(),\n                                        NULL,\n                                        MSG_ROUTING_NONE,\n                                        gfx::Size());\n  ShellDevToolsFrontend* devtools_frontend = new ShellDevToolsFrontend(\n      shell,\n      DevToolsAgentHost::GetFor(inspected_contents->GetRenderViewHost()));\n\n  ShellContentBrowserClient* browser_client =\n      static_cast<ShellContentBrowserClient*>(\n          GetContentClient()->browser());\n  ShellDevToolsDelegate* delegate =\n      browser_client->shell_browser_main_parts()->devtools_delegate();\n  if (CommandLine::ForCurrentProcess()->HasSwitch(switches::kDumpRenderTree))\n    shell->LoadURL(GetDevToolsPathAsURL());\n  else\n    shell->LoadURL(delegate->devtools_http_handler()->GetFrontendURL(NULL));\n\n  return devtools_frontend;\n}\n\nvoid ShellDevToolsFrontend::Focus() {\n  web_contents()->GetView()->Focus();\n}\n\nvoid ShellDevToolsFrontend::Close() {\n  frontend_shell_->Close();\n}\n\nShellDevToolsFrontend::ShellDevToolsFrontend(Shell* frontend_shell,\n                                             DevToolsAgentHost* agent_host)\n    : WebContentsObserver(frontend_shell->web_contents()),\n      frontend_shell_(frontend_shell),\n      agent_host_(agent_host) {\n  frontend_host_.reset(\n      DevToolsClientHost::CreateDevToolsFrontendHost(web_contents(), this));\n}\n\nShellDevToolsFrontend::~ShellDevToolsFrontend() {\n}\n\nvoid ShellDevToolsFrontend::RenderViewCreated(\n    RenderViewHost* render_view_host) {\n  DevToolsClientHost::SetupDevToolsFrontendClient(\n      web_contents()->GetRenderViewHost());\n  DevToolsManager* manager = DevToolsManager::GetInstance();\n  manager->RegisterDevToolsClientHostFor(agent_host_.get(),\n                                         frontend_host_.get());\n}\n\nvoid ShellDevToolsFrontend::WebContentsDestroyed(WebContents* web_contents) {\n  DevToolsManager::GetInstance()->ClientHostClosing(frontend_host_.get());\n  delete this;\n}\n\nvoid ShellDevToolsFrontend::InspectedContentsClosing() {\n  frontend_shell_->Close();\n}\n\n}  \/\/ namespace content\n<commit_msg>Fix incorrectly formatted comment.<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 \"content\/shell\/shell_devtools_frontend.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/path_service.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.h\"\n#include \"content\/public\/browser\/web_contents_view.h\"\n#include \"content\/public\/common\/content_client.h\"\n#include \"content\/shell\/shell.h\"\n#include \"content\/shell\/shell_browser_context.h\"\n#include \"content\/shell\/shell_browser_main_parts.h\"\n#include \"content\/shell\/shell_content_browser_client.h\"\n#include \"content\/shell\/shell_devtools_delegate.h\"\n#include \"content\/shell\/shell_switches.h\"\n#include \"net\/base\/net_util.h\"\n\nnamespace content {\n\nnamespace {\n\n\/\/ DevTools frontend path for inspector LayoutTests.\nGURL GetDevToolsPathAsURL() {\n  base::FilePath dir_exe;\n  if (!PathService::Get(base::DIR_EXE, &dir_exe)) {\n    NOTREACHED();\n    return GURL();\n  }\n#if defined(OS_MACOSX)\n  \/\/ On Mac, the executable is in out\/Release\/Content\n  \/\/ Shell.app\/Frameworks\/Content Shell Helper.app\/Contents\/MacOS\/Content Shell\n  \/\/ Helper. We need to go up 6 directories to get to out\/Release.\n  dir_exe = dir_exe.AppendASCII(\"..\/..\/..\/..\/..\/..\");\n#endif\n  base::FilePath dev_tools_path = dir_exe.AppendASCII(\n      \"resources\/inspector\/devtools.html\");\n  return net::FilePathToFileURL(dev_tools_path);\n}\n\n}  \/\/ namespace\n\n\/\/ static\nShellDevToolsFrontend* ShellDevToolsFrontend::Show(\n    WebContents* inspected_contents) {\n  Shell* shell = Shell::CreateNewWindow(inspected_contents->GetBrowserContext(),\n                                        GURL(),\n                                        NULL,\n                                        MSG_ROUTING_NONE,\n                                        gfx::Size());\n  ShellDevToolsFrontend* devtools_frontend = new ShellDevToolsFrontend(\n      shell,\n      DevToolsAgentHost::GetFor(inspected_contents->GetRenderViewHost()));\n\n  ShellContentBrowserClient* browser_client =\n      static_cast<ShellContentBrowserClient*>(\n          GetContentClient()->browser());\n  ShellDevToolsDelegate* delegate =\n      browser_client->shell_browser_main_parts()->devtools_delegate();\n  if (CommandLine::ForCurrentProcess()->HasSwitch(switches::kDumpRenderTree))\n    shell->LoadURL(GetDevToolsPathAsURL());\n  else\n    shell->LoadURL(delegate->devtools_http_handler()->GetFrontendURL(NULL));\n\n  return devtools_frontend;\n}\n\nvoid ShellDevToolsFrontend::Focus() {\n  web_contents()->GetView()->Focus();\n}\n\nvoid ShellDevToolsFrontend::Close() {\n  frontend_shell_->Close();\n}\n\nShellDevToolsFrontend::ShellDevToolsFrontend(Shell* frontend_shell,\n                                             DevToolsAgentHost* agent_host)\n    : WebContentsObserver(frontend_shell->web_contents()),\n      frontend_shell_(frontend_shell),\n      agent_host_(agent_host) {\n  frontend_host_.reset(\n      DevToolsClientHost::CreateDevToolsFrontendHost(web_contents(), this));\n}\n\nShellDevToolsFrontend::~ShellDevToolsFrontend() {\n}\n\nvoid ShellDevToolsFrontend::RenderViewCreated(\n    RenderViewHost* render_view_host) {\n  DevToolsClientHost::SetupDevToolsFrontendClient(\n      web_contents()->GetRenderViewHost());\n  DevToolsManager* manager = DevToolsManager::GetInstance();\n  manager->RegisterDevToolsClientHostFor(agent_host_.get(),\n                                         frontend_host_.get());\n}\n\nvoid ShellDevToolsFrontend::WebContentsDestroyed(WebContents* web_contents) {\n  DevToolsManager::GetInstance()->ClientHostClosing(frontend_host_.get());\n  delete this;\n}\n\nvoid ShellDevToolsFrontend::InspectedContentsClosing() {\n  frontend_shell_->Close();\n}\n\n}  \/\/ namespace content\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (C) 2015 - 2016 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc., University of Heidelberg, and The University\n\/\/ of Manchester.\n\/\/ All rights reserved.\n\n#include \"CQArrayAnnotationsWidgetDM.h\"\n#include \"CColorScale.h\"\n#include \"qtUtilities.h\"\n#include <QSortFilterProxyModel>\n\n#include \"copasi.h\"\n#include \"utilities\/CAnnotatedMatrix.h\"\n\nCQArrayAnnotationsWidgetDM::CQArrayAnnotationsWidgetDM(QObject *parent):\n  QAbstractTableModel(parent),\n  mpColorScale(NULL),\n  mpArray(NULL),\n  mIndex(),\n  mRow(C_INVALID_INDEX),\n  mColumn(C_INVALID_INDEX),\n  mHeaderData(new QStringList[3])\n{}\n\n\/\/ We need 3 since\n\/\/ enum Orientation {\n\/\/     Horizontal = 0x1,\n\/\/     Vertical = 0x2\n\/\/ };\n\nCQArrayAnnotationsWidgetDM::~CQArrayAnnotationsWidgetDM()\n{}\n\n\/\/ virtual\nQVariant CQArrayAnnotationsWidgetDM::data(const QModelIndex &index, int role) const\n{\n  if (!index.isValid() ||\n      (role != Qt::DisplayRole &&\n       role != Qt::BackgroundRole) ||\n      mpArray == NULL) return QVariant();\n\n  QModelIndex SourceIndex = index;\n\n  while (SourceIndex.model()->inherits(\"QSortFilterProxyModel\"))\n    {\n      SourceIndex = static_cast< const QSortFilterProxyModel * >(SourceIndex.model())->mapToSource(SourceIndex);\n    }\n\n  if (mRow != C_INVALID_INDEX) mIndex[mRow] = SourceIndex.row();\n\n  if (mColumn != C_INVALID_INDEX) mIndex[mColumn] = SourceIndex.column();\n\n  switch (role)\n    {\n      case Qt::DisplayRole:\n        return QVariant((*mpArray->array())[mIndex]);\n\n        break;\n\n      case Qt::BackgroundRole:\n        return QVariant(mpColorScale->getColor((*mpArray->array())[mIndex]));\n        break;\n    }\n\n  return QVariant();\n}\n\n\/\/ virtual\nQVariant CQArrayAnnotationsWidgetDM::headerData(int section, Qt::Orientation orientation, int role) const\n{\n  if ((role != Qt::DisplayRole &&\n       role != Qt::ToolTipPropertyRole) ||\n      mpArray == NULL)\n    {\n      return QVariant();\n    }\n\n  if (orientation == Qt::Vertical)\n    {\n      if (mRow == C_INVALID_INDEX ||\n          section < 0 ||\n          (C_INT32)mpArray->size()[mRow] <= section)\n        {\n          return QVariant();\n        }\n\n      return QVariant(mHeaderData[orientation][section]);\n    }\n  else\n    {\n      if (mColumn == C_INVALID_INDEX ||\n          section < 0 ||\n          (C_INT32)mpArray->size()[mColumn] <= section)\n        {\n          return QVariant();\n        }\n\n      if (role == Qt::DisplayRole)\n        {\n          return QVariant(QString(mHeaderData[orientation][section]).replace(\"; {\", \"\\n{\"));\n        }\n\n      return QVariant(mHeaderData[orientation][section]);\n    }\n\n  return QVariant();\n}\n\n\/\/ virtual\nQt::ItemFlags CQArrayAnnotationsWidgetDM::flags(const QModelIndex &index) const\n{\n  return QAbstractItemModel::flags(index) & Qt::ItemIsEnabled & ~Qt::ItemIsEditable;\n}\n\n\/\/ virtual\nint CQArrayAnnotationsWidgetDM::rowCount(const QModelIndex & \/* parent *\/) const\n{\n  if (mpArray == NULL) return 0;\n\n  if (mRow == C_INVALID_INDEX) return 1;\n\n  return mpArray->size()[mRow];\n}\n\n\/\/ virtual\nint CQArrayAnnotationsWidgetDM::columnCount(const QModelIndex & \/* parent *\/) const\n{\n  if (mpArray == NULL) return 0;\n\n  if (mColumn == C_INVALID_INDEX) return 1;\n\n  return mpArray->size()[mColumn];\n}\n\nvoid CQArrayAnnotationsWidgetDM::setContext(const CColorScale * pColorScale,\n    const CArrayAnnotation * pArray,\n    const std::vector< size_t > & index,\n    const size_t & row,\n    const size_t & column)\n{\n  if (mpArray != pArray ||\n      mpColorScale != pColorScale ||\n      mIndex != index ||\n      mRow != row ||\n      mColumn != column)\n    {\n      beginResetModel();\n\n      mpArray = pArray;\n      mpColorScale = pColorScale;\n      mIndex = index;\n      mRow = row;\n      mColumn = column;\n\n      mHeaderData[Qt::Horizontal].clear();\n      mHeaderData[Qt::Vertical].clear();\n\n      if (mpArray != NULL)\n        {\n          const std::vector< std::string > & Horizontal = mpArray->getAnnotationsString(mColumn);\n\n          std::vector< std::string >::const_iterator it = Horizontal.begin();\n          std::vector< std::string >::const_iterator end = Horizontal.end();\n\n          for (; it != end; ++it)\n            mHeaderData[Qt::Horizontal].append(FROM_UTF8(*it));\n\n          const std::vector< std::string > & Vertical = mpArray->getAnnotationsString(mRow);\n\n          it = Vertical.begin();\n          end = Vertical.end();\n\n          for (; it != end; ++it)\n            mHeaderData[Qt::Vertical].append(FROM_UTF8(*it));\n        }\n\n      endResetModel();\n    }\n}\n<commit_msg>Fixed Bug 2297. The column or row annotations is only retrieved when the<commit_after>\/\/ Copyright (C) 2015 - 2016 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc., University of Heidelberg, and The University\n\/\/ of Manchester.\n\/\/ All rights reserved.\n\n#include \"CQArrayAnnotationsWidgetDM.h\"\n#include \"CColorScale.h\"\n#include \"qtUtilities.h\"\n#include <QSortFilterProxyModel>\n\n#include \"copasi.h\"\n#include \"utilities\/CAnnotatedMatrix.h\"\n\nCQArrayAnnotationsWidgetDM::CQArrayAnnotationsWidgetDM(QObject *parent):\n  QAbstractTableModel(parent),\n  mpColorScale(NULL),\n  mpArray(NULL),\n  mIndex(),\n  mRow(C_INVALID_INDEX),\n  mColumn(C_INVALID_INDEX),\n  mHeaderData(new QStringList[3])\n{}\n\n\/\/ We need 3 since\n\/\/ enum Orientation {\n\/\/     Horizontal = 0x1,\n\/\/     Vertical = 0x2\n\/\/ };\n\nCQArrayAnnotationsWidgetDM::~CQArrayAnnotationsWidgetDM()\n{}\n\n\/\/ virtual\nQVariant CQArrayAnnotationsWidgetDM::data(const QModelIndex &index, int role) const\n{\n  if (!index.isValid() ||\n      (role != Qt::DisplayRole &&\n       role != Qt::BackgroundRole) ||\n      mpArray == NULL) return QVariant();\n\n  QModelIndex SourceIndex = index;\n\n  while (SourceIndex.model()->inherits(\"QSortFilterProxyModel\"))\n    {\n      SourceIndex = static_cast< const QSortFilterProxyModel * >(SourceIndex.model())->mapToSource(SourceIndex);\n    }\n\n  if (mRow != C_INVALID_INDEX) mIndex[mRow] = SourceIndex.row();\n\n  if (mColumn != C_INVALID_INDEX) mIndex[mColumn] = SourceIndex.column();\n\n  switch (role)\n    {\n      case Qt::DisplayRole:\n        return QVariant((*mpArray->array())[mIndex]);\n\n        break;\n\n      case Qt::BackgroundRole:\n        return QVariant(mpColorScale->getColor((*mpArray->array())[mIndex]));\n        break;\n    }\n\n  return QVariant();\n}\n\n\/\/ virtual\nQVariant CQArrayAnnotationsWidgetDM::headerData(int section, Qt::Orientation orientation, int role) const\n{\n  if ((role != Qt::DisplayRole &&\n       role != Qt::ToolTipPropertyRole) ||\n      mpArray == NULL)\n    {\n      return QVariant();\n    }\n\n  if (orientation == Qt::Vertical)\n    {\n      if (mRow == C_INVALID_INDEX ||\n          section < 0 ||\n          (C_INT32)mpArray->size()[mRow] <= section)\n        {\n          return QVariant();\n        }\n\n      return QVariant(mHeaderData[orientation][section]);\n    }\n  else\n    {\n      if (mColumn == C_INVALID_INDEX ||\n          section < 0 ||\n          (C_INT32)mpArray->size()[mColumn] <= section)\n        {\n          return QVariant();\n        }\n\n      if (role == Qt::DisplayRole)\n        {\n          return QVariant(QString(mHeaderData[orientation][section]).replace(\"; {\", \"\\n{\"));\n        }\n\n      return QVariant(mHeaderData[orientation][section]);\n    }\n\n  return QVariant();\n}\n\n\/\/ virtual\nQt::ItemFlags CQArrayAnnotationsWidgetDM::flags(const QModelIndex &index) const\n{\n  return QAbstractItemModel::flags(index) & Qt::ItemIsEnabled & ~Qt::ItemIsEditable;\n}\n\n\/\/ virtual\nint CQArrayAnnotationsWidgetDM::rowCount(const QModelIndex & \/* parent *\/) const\n{\n  if (mpArray == NULL) return 0;\n\n  if (mRow == C_INVALID_INDEX) return 1;\n\n  return mpArray->size()[mRow];\n}\n\n\/\/ virtual\nint CQArrayAnnotationsWidgetDM::columnCount(const QModelIndex & \/* parent *\/) const\n{\n  if (mpArray == NULL) return 0;\n\n  if (mColumn == C_INVALID_INDEX) return 1;\n\n  return mpArray->size()[mColumn];\n}\n\nvoid CQArrayAnnotationsWidgetDM::setContext(const CColorScale * pColorScale,\n    const CArrayAnnotation * pArray,\n    const std::vector< size_t > & index,\n    const size_t & row,\n    const size_t & column)\n{\n  if (mpArray != pArray ||\n      mpColorScale != pColorScale ||\n      mIndex != index ||\n      mRow != row ||\n      mColumn != column)\n    {\n      beginResetModel();\n\n      mpArray = pArray;\n      mpColorScale = pColorScale;\n      mIndex = index;\n      mRow = row;\n      mColumn = column;\n\n      mHeaderData[Qt::Horizontal].clear();\n      mHeaderData[Qt::Vertical].clear();\n\n      if (mpArray != NULL)\n        {\n          if (mColumn != C_INVALID_INDEX)\n            {\n              const std::vector< std::string > & Horizontal = mpArray->getAnnotationsString(mColumn);\n\n              std::vector< std::string >::const_iterator it = Horizontal.begin();\n              std::vector< std::string >::const_iterator end = Horizontal.end();\n\n              for (; it != end; ++it)\n                mHeaderData[Qt::Horizontal].append(FROM_UTF8(*it));\n            }\n\n          if (mRow != C_INVALID_INDEX)\n            {\n              const std::vector< std::string > & Vertical = mpArray->getAnnotationsString(mRow);\n\n              std::vector< std::string >::const_iterator it = Vertical.begin();\n              std::vector< std::string >::const_iterator end = Vertical.end();\n\n              for (; it != end; ++it)\n                mHeaderData[Qt::Vertical].append(FROM_UTF8(*it));\n            }\n        }\n\n      endResetModel();\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>cosmetic changes, cleanup<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n * Test Driver for Botan\n *\/\n\n#include <vector>\n#include <string>\n\n#include <iostream>\n#include <cstdlib>\n#include <cstring>\n#include <exception>\n#include <limits>\n#include <memory>\n\n#include <botan\/botan.h>\n#include <botan\/libstate.h>\n#include <botan\/mp_types.h>\n\nusing namespace Botan;\n\n#include \"getopt.h\"\n#include \"bench.h\"\n#include \"validate.h\"\n#include \"common.h\"\n\nconst std::string VALIDATION_FILE = \"checks\/validate.dat\";\nconst std::string BIGINT_VALIDATION_FILE = \"checks\/mp_valid.dat\";\nconst std::string PK_VALIDATION_FILE = \"checks\/pk_valid.dat\";\nconst std::string EXPECTED_FAIL_FILE = \"checks\/fail.dat\";\n\nint run_test_suite(RandomNumberGenerator& rng);\n\nnamespace {\n\ntemplate<typename T>\nbool test(const char* type, int digits, bool is_signed)\n   {\n   if(std::numeric_limits<T>::is_specialized == false)\n      {\n      std::cout << \"WARNING: Could not check parameters of \" << type\n                << \" in std::numeric_limits\" << std::endl;\n\n      \/\/ assume it's OK (full tests will catch it later)\n      return true;\n      }\n\n   \/\/ continue checking after failures\n   bool passed = true;\n\n   if(std::numeric_limits<T>::is_integer == false)\n      {\n      std::cout << \"WARN: std::numeric_limits<> says \" << type\n                << \" is not an integer\" << std::endl;\n      passed = false;\n      }\n\n   if(std::numeric_limits<T>::is_signed != is_signed)\n      {\n      std::cout << \"ERROR: numeric_limits<\" << type << \">::is_signed == \"\n                << std::boolalpha << std::numeric_limits<T>::is_signed\n                << std::endl;\n      passed = false;\n      }\n\n   if(std::numeric_limits<T>::digits != digits && digits != 0)\n      {\n      std::cout << \"ERROR: numeric_limits<\" << type << \">::digits == \"\n                << std::numeric_limits<T>::digits\n                << \" expected \" << digits << std::endl;\n      passed = false;\n      }\n\n   return passed;\n   }\n\nvoid test_types()\n   {\n   bool passed = true;\n\n   passed = passed && test<Botan::byte  >(\"byte\",    8, false);\n   passed = passed && test<Botan::u16bit>(\"u16bit\", 16, false);\n   passed = passed && test<Botan::u32bit>(\"u32bit\", 32, false);\n   passed = passed && test<Botan::u64bit>(\"u64bit\", 64, false);\n   passed = passed && test<Botan::s32bit>(\"s32bit\", 31,  true);\n   passed = passed && test<Botan::word>(\"word\", 0, false);\n\n   if(!passed)\n      std::cout << \"Typedefs in include\/types.h may be incorrect!\\n\";\n   }\n\n}\n\nint main(int argc, char* argv[])\n   {\n   try\n      {\n      OptionParser opts(\"help|html|test|validate|\"\n                        \"benchmark|bench-type=|bench-algo=|seconds=\");\n      opts.parse(argv);\n\n      test_types(); \/\/ do this always\n\n      Botan::LibraryInitializer init(\"thread_safe=no\");\n\n      if(opts.is_set(\"help\") || argc <= 1)\n         {\n         std::cerr << \"Test driver for \"\n                   << Botan::version_string() << \"\\n\"\n                   << \"Options:\\n\"\n                   << \"  --test || --validate: Run tests (do this at least once)\\n\"\n                   << \"  --benchmark: Benchmark everything\\n\"\n                   << \"  --bench-type={block,mode,stream,hash,mac,rng,pk}:\\n\"\n                   << \"       Benchmark only algorithms of a particular type\\n\"\n                   << \"  --html: Produce HTML output for benchmarks\\n\"\n                   << \"  --seconds=n: Benchmark for n seconds\\n\"\n                   << \"  --init=<str>: Pass <str> to the library\\n\"\n                   << \"  --help: Print this message\\n\";\n         return 1;\n         }\n\n      Botan::AutoSeeded_RNG rng;\n\n      if(opts.is_set(\"validate\") || opts.is_set(\"test\"))\n         {\n         run_test_suite(rng);\n         }\n      if(opts.is_set(\"bench-algo\") ||\n         opts.is_set(\"benchmark\") ||\n         opts.is_set(\"bench-type\"))\n         {\n         double seconds = 5;\n\n         if(opts.is_set(\"seconds\"))\n            {\n            seconds = std::atof(opts.value(\"seconds\").c_str());\n            if(seconds < 0.1 || seconds > (5 * 60))\n               {\n               std::cout << \"Invalid argument to --seconds\\n\";\n               return 2;\n               }\n            }\n\n         const bool html = opts.is_set(\"html\");\n\n         if(opts.is_set(\"benchmark\"))\n            {\n            benchmark(\"All\", rng, html, seconds);\n            }\n         else if(opts.is_set(\"bench-algo\"))\n            {\n            std::vector<std::string> algs =\n               Botan::split_on(opts.value(\"bench-algo\"), ',');\n\n            for(u32bit j = 0; j != algs.size(); j++)\n               {\n               const std::string alg = algs[j];\n               u32bit found = bench_algo(alg, rng, seconds);\n               if(!found) \/\/ maybe it's a PK algorithm\n                  bench_pk(rng, alg, html, seconds);\n               }\n            }\n         else if(opts.is_set(\"bench-type\"))\n            {\n            const std::string type = opts.value(\"bench-type\");\n\n            if(type == \"all\")\n               benchmark(\"All\", rng, html, seconds);\n            else if(type == \"block\")\n               benchmark(\"Block Cipher\", rng, html, seconds);\n            else if(type == \"stream\")\n               benchmark(\"Stream Cipher\", rng, html, seconds);\n            else if(type == \"hash\")\n               benchmark(\"Hash\", rng, html, seconds);\n            else if(type == \"mac\")\n               benchmark(\"MAC\", rng, html, seconds);\n            else if(type == \"rng\")\n               benchmark(\"RNG\", rng, html, seconds);\n            else if(type == \"pk\")\n               bench_pk(rng, \"All\", html, seconds);\n            else\n               std::cerr << \"Unknown --bench-type \" << type << \"\\n\";\n            }\n         }\n      }\n   catch(std::exception& e)\n      {\n      std::cerr << \"Exception: \" << e.what() << std::endl;\n      }\n   catch(...)\n      {\n      std::cerr << \"Unknown (...) exception caught\" << std::endl;\n      }\n\n   return 0;\n   }\n\nint run_test_suite(RandomNumberGenerator& rng)\n   {\n   std::cout << \"Beginning tests...\" << std::endl;\n\n   u32bit errors = 0;\n   try\n      {\n      errors += do_validation_tests(VALIDATION_FILE, rng);\n      errors += do_validation_tests(EXPECTED_FAIL_FILE, rng, false);\n      errors += do_bigint_tests(BIGINT_VALIDATION_FILE, rng);\n      errors += do_gfpmath_tests(rng);\n      errors += do_pk_validation_tests(PK_VALIDATION_FILE, rng);\n      \/\/errors += do_cvc_tests(rng);\n      }\n   catch(Botan::Exception& e)\n      {\n      std::cout << \"Exception caught: \" << e.what() << std::endl;\n      return 1;\n      }\n   catch(std::exception& e)\n      {\n      std::cout << \"Standard library exception caught: \"\n                << e.what() << std::endl;\n      return 1;\n      }\n   catch(...)\n      {\n      std::cout << \"Unknown exception caught.\" << std::endl;\n      return 1;\n      }\n\n   if(errors)\n      {\n      std::cout << errors << \" test\"  << ((errors == 1) ? \"\" : \"s\")\n                << \" failed.\" << std::endl;\n      return 1;\n      }\n\n   std::cout << \"All tests passed!\" << std::endl;\n   return 0;\n   }\n<commit_msg>Fix mode benchmarking<commit_after>\/*\n * Test Driver for Botan\n *\/\n\n#include <vector>\n#include <string>\n\n#include <iostream>\n#include <cstdlib>\n#include <cstring>\n#include <exception>\n#include <limits>\n#include <memory>\n\n#include <botan\/botan.h>\n#include <botan\/libstate.h>\n#include <botan\/mp_types.h>\n\nusing namespace Botan;\n\n#include \"getopt.h\"\n#include \"bench.h\"\n#include \"validate.h\"\n#include \"common.h\"\n\nconst std::string VALIDATION_FILE = \"checks\/validate.dat\";\nconst std::string BIGINT_VALIDATION_FILE = \"checks\/mp_valid.dat\";\nconst std::string PK_VALIDATION_FILE = \"checks\/pk_valid.dat\";\nconst std::string EXPECTED_FAIL_FILE = \"checks\/fail.dat\";\n\nint run_test_suite(RandomNumberGenerator& rng);\n\nnamespace {\n\ntemplate<typename T>\nbool test(const char* type, int digits, bool is_signed)\n   {\n   if(std::numeric_limits<T>::is_specialized == false)\n      {\n      std::cout << \"WARNING: Could not check parameters of \" << type\n                << \" in std::numeric_limits\" << std::endl;\n\n      \/\/ assume it's OK (full tests will catch it later)\n      return true;\n      }\n\n   \/\/ continue checking after failures\n   bool passed = true;\n\n   if(std::numeric_limits<T>::is_integer == false)\n      {\n      std::cout << \"WARN: std::numeric_limits<> says \" << type\n                << \" is not an integer\" << std::endl;\n      passed = false;\n      }\n\n   if(std::numeric_limits<T>::is_signed != is_signed)\n      {\n      std::cout << \"ERROR: numeric_limits<\" << type << \">::is_signed == \"\n                << std::boolalpha << std::numeric_limits<T>::is_signed\n                << std::endl;\n      passed = false;\n      }\n\n   if(std::numeric_limits<T>::digits != digits && digits != 0)\n      {\n      std::cout << \"ERROR: numeric_limits<\" << type << \">::digits == \"\n                << std::numeric_limits<T>::digits\n                << \" expected \" << digits << std::endl;\n      passed = false;\n      }\n\n   return passed;\n   }\n\nvoid test_types()\n   {\n   bool passed = true;\n\n   passed = passed && test<Botan::byte  >(\"byte\",    8, false);\n   passed = passed && test<Botan::u16bit>(\"u16bit\", 16, false);\n   passed = passed && test<Botan::u32bit>(\"u32bit\", 32, false);\n   passed = passed && test<Botan::u64bit>(\"u64bit\", 64, false);\n   passed = passed && test<Botan::s32bit>(\"s32bit\", 31,  true);\n   passed = passed && test<Botan::word>(\"word\", 0, false);\n\n   if(!passed)\n      std::cout << \"Typedefs in include\/types.h may be incorrect!\\n\";\n   }\n\n}\n\nint main(int argc, char* argv[])\n   {\n   try\n      {\n      OptionParser opts(\"help|html|test|validate|\"\n                        \"benchmark|bench-type=|bench-algo=|seconds=\");\n      opts.parse(argv);\n\n      test_types(); \/\/ do this always\n\n      Botan::LibraryInitializer init(\"thread_safe=no\");\n\n      if(opts.is_set(\"help\") || argc <= 1)\n         {\n         std::cerr << \"Test driver for \"\n                   << Botan::version_string() << \"\\n\"\n                   << \"Options:\\n\"\n                   << \"  --test || --validate: Run tests (do this at least once)\\n\"\n                   << \"  --benchmark: Benchmark everything\\n\"\n                   << \"  --bench-type={block,mode,stream,hash,mac,rng,pk}:\\n\"\n                   << \"       Benchmark only algorithms of a particular type\\n\"\n                   << \"  --html: Produce HTML output for benchmarks\\n\"\n                   << \"  --seconds=n: Benchmark for n seconds\\n\"\n                   << \"  --init=<str>: Pass <str> to the library\\n\"\n                   << \"  --help: Print this message\\n\";\n         return 1;\n         }\n\n      Botan::AutoSeeded_RNG rng;\n\n      if(opts.is_set(\"validate\") || opts.is_set(\"test\"))\n         {\n         run_test_suite(rng);\n         }\n      if(opts.is_set(\"bench-algo\") ||\n         opts.is_set(\"benchmark\") ||\n         opts.is_set(\"bench-type\"))\n         {\n         double seconds = 5;\n\n         if(opts.is_set(\"seconds\"))\n            {\n            seconds = std::atof(opts.value(\"seconds\").c_str());\n            if(seconds < 0.1 || seconds > (5 * 60))\n               {\n               std::cout << \"Invalid argument to --seconds\\n\";\n               return 2;\n               }\n            }\n\n         const bool html = opts.is_set(\"html\");\n\n         if(opts.is_set(\"benchmark\"))\n            {\n            benchmark(\"All\", rng, html, seconds);\n            }\n         else if(opts.is_set(\"bench-algo\"))\n            {\n            std::vector<std::string> algs =\n               Botan::split_on(opts.value(\"bench-algo\"), ',');\n\n            for(u32bit j = 0; j != algs.size(); j++)\n               {\n               const std::string alg = algs[j];\n               u32bit found = bench_algo(alg, rng, seconds);\n               if(!found) \/\/ maybe it's a PK algorithm\n                  bench_pk(rng, alg, html, seconds);\n               }\n            }\n         else if(opts.is_set(\"bench-type\"))\n            {\n            const std::string type = opts.value(\"bench-type\");\n\n            if(type == \"all\")\n               benchmark(\"All\", rng, html, seconds);\n            else if(type == \"block\")\n               benchmark(\"Block Cipher\", rng, html, seconds);\n            else if(type == \"stream\")\n               benchmark(\"Stream Cipher\", rng, html, seconds);\n            else if(type == \"hash\")\n               benchmark(\"Hash\", rng, html, seconds);\n            else if(type == \"mode\")\n               benchmark(\"Cipher Mode\", rng, html, seconds);\n            else if(type == \"mac\")\n               benchmark(\"MAC\", rng, html, seconds);\n            else if(type == \"rng\")\n               benchmark(\"RNG\", rng, html, seconds);\n            else if(type == \"pk\")\n               bench_pk(rng, \"All\", html, seconds);\n            else\n               std::cerr << \"Unknown --bench-type \" << type << \"\\n\";\n            }\n         }\n      }\n   catch(std::exception& e)\n      {\n      std::cerr << \"Exception: \" << e.what() << std::endl;\n      }\n   catch(...)\n      {\n      std::cerr << \"Unknown (...) exception caught\" << std::endl;\n      }\n\n   return 0;\n   }\n\nint run_test_suite(RandomNumberGenerator& rng)\n   {\n   std::cout << \"Beginning tests...\" << std::endl;\n\n   u32bit errors = 0;\n   try\n      {\n      errors += do_validation_tests(VALIDATION_FILE, rng);\n      errors += do_validation_tests(EXPECTED_FAIL_FILE, rng, false);\n      errors += do_bigint_tests(BIGINT_VALIDATION_FILE, rng);\n      errors += do_gfpmath_tests(rng);\n      errors += do_pk_validation_tests(PK_VALIDATION_FILE, rng);\n      \/\/errors += do_cvc_tests(rng);\n      }\n   catch(Botan::Exception& e)\n      {\n      std::cout << \"Exception caught: \" << e.what() << std::endl;\n      return 1;\n      }\n   catch(std::exception& e)\n      {\n      std::cout << \"Standard library exception caught: \"\n                << e.what() << std::endl;\n      return 1;\n      }\n   catch(...)\n      {\n      std::cout << \"Unknown exception caught.\" << std::endl;\n      return 1;\n      }\n\n   if(errors)\n      {\n      std::cout << errors << \" test\"  << ((errors == 1) ? \"\" : \"s\")\n                << \" failed.\" << std::endl;\n      return 1;\n      }\n\n   std::cout << \"All tests passed!\" << std::endl;\n   return 0;\n   }\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * The MIT License (MIT)\n *\n * Copyright (c) 2015 Microsoft Corporation\n * \n * -=- Robust Distributed System Nucleus (rDSN) -=- \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 * Description:\n *     What is this file about?\n *\n * Revision history:\n *     xxxx-xx-xx, author, first version\n *     xxxx-xx-xx, author, fix bug about xxx\n *\/\n\n#include \"prepare_list.h\"\n#include \"mutation.h\"\n\n# ifdef __TITLE__\n# undef __TITLE__\n# endif\n# define __TITLE__ \"prepare_list\"\n\nnamespace dsn { namespace replication {\n\nprepare_list::prepare_list(\n        decree init_decree, int max_count,\n        mutation_committer committer\n        )\n        : mutation_cache(init_decree, max_count)\n{\n    _committer = committer;\n    _last_committed_decree = init_decree;\n}\n\nvoid prepare_list::sanity_check()\n{\n\n}\n\nvoid prepare_list::reset(decree init_decree)\n{\n    _last_committed_decree = init_decree;\n    mutation_cache::reset(init_decree, true);\n}\n\nvoid prepare_list::truncate(decree init_decree)\n{\n    while (min_decree() <= init_decree && count() > 0)\n    {\n        pop_min();\n    }\n\n    if (count() == 0)\n    {\n        mutation_cache::reset(init_decree, true);\n    }\n\n    _last_committed_decree = init_decree;\n}\n\nerror_code prepare_list::prepare(mutation_ptr& mu, partition_status status)\n{\n    decree d = mu->data.header.decree;\n    dassert (d > last_committed_decree(), \"\");\n\n    error_code err;\n    switch (status)\n    {\n    case PS_PRIMARY:\n        \/\/ pop committed mutations if buffer is full\n        while (d - min_decree() >= capacity() && last_committed_decree() > min_decree())\n        {\n            pop_min();\n        }\n        return mutation_cache::put(mu);\n\n    case PS_SECONDARY: \n    case PS_POTENTIAL_SECONDARY:\n        \/\/ all mutations with lower decree must be ready\n        commit(mu->data.header.last_committed_decree, COMMIT_TO_DECREE_HARD);\n        \/\/ pop committed mutations if buffer is full\n        while (d - min_decree() >= capacity() && last_committed_decree() > min_decree())\n        {\n            pop_min();\n        }\n        err = mutation_cache::put(mu);\n        dassert (err == ERR_OK, \"\");\n        return err;\n\n    \/\/\/\/ delayed commit - only when capacity is an issue\n    \/\/case PS_POTENTIAL_SECONDARY:\n    \/\/    while (true)\n    \/\/    {\n    \/\/        err = mutation_cache::put(mu);\n    \/\/        if (err == ERR_CAPACITY_EXCEEDED)\n    \/\/        {\n    \/\/            dassert(mu->data.header.last_committed_decree >= min_decree(), \"\");\n    \/\/            commit (min_decree(), true);\n    \/\/            pop_min();\n    \/\/        }\n    \/\/        else\n    \/\/            break;\n    \/\/    }\n    \/\/    dassert (err == ERR_OK, \"\");\n    \/\/    return err;\n     \n    case PS_INACTIVE: \/\/ only possible during init  \n        if (mu->data.header.last_committed_decree > max_decree())\n        {\n            reset(mu->data.header.last_committed_decree);\n        }\n        else if (mu->data.header.last_committed_decree > _last_committed_decree)\n        {\n            \/\/ all mutations with lower decree must be ready\n            commit(mu->data.header.last_committed_decree, COMMIT_TO_DECREE_HARD);\n            \/\/ pop committed mutations if buffer is full\n            while (d - min_decree() >= capacity() && last_committed_decree() > min_decree())\n            {\n                pop_min();\n            }\n        }\n        err = mutation_cache::put(mu);\n        dassert (err == ERR_OK, \"\");\n        return err;\n\n    default:\n        dassert (false, \"\");\n        return 0;\n    }\n}\n\n\/\/\n\/\/ ordered commit\n\/\/\nbool prepare_list::commit(decree d, commit_type ct)\n{\n    if (d <= last_committed_decree())\n        return false;\n    \n    ballot last_bt = 0;\n    switch (ct)\n    {\n    case COMMIT_TO_DECREE_HARD:\n        {\n            for (decree d0 = last_committed_decree() + 1; d0 <= d; d0++)\n            {\n                mutation_ptr mu = get_mutation_by_decree(d0);\n                dassert(mu != nullptr &&\n                    (mu->is_logged()) &&\n                    mu->data.header.ballot >= last_bt,\n                    \"mutation %\" PRId64 \" is missing in prepare list\",\n                    d0\n                    );\n\n                _last_committed_decree++;\n                last_bt = mu->data.header.ballot;\n                _committer(mu);\n            }\n\n            sanity_check();\n            return true;\n        }\n    case COMMIT_TO_DECREE_SOFT:\n        {\n            for (decree d0 = last_committed_decree() + 1; d0 <= d; d0++)\n            {\n                mutation_ptr mu = get_mutation_by_decree(d0);\n                if (mu != nullptr && mu->is_ready_for_commit() && mu->data.header.ballot >= last_bt)\n                {\n                    _last_committed_decree++;\n                    last_bt = mu->data.header.ballot;\n                    _committer(mu);\n                }\n                else\n                    break;\n            }\n\n            sanity_check();\n            return true;\n        }\n    case COMMIT_ALL_READY:\n        {\n            if (d != last_committed_decree() + 1)\n                return false;\n\n            int count = 0;\n            mutation_ptr mu = get_mutation_by_decree(last_committed_decree() + 1);\n\n            while (mu != nullptr && mu->is_ready_for_commit() && mu->data.header.ballot >= last_bt)\n            {\n                _last_committed_decree++;\n                last_bt = mu->data.header.ballot;\n                _committer(mu);\n                count++;\n                mu = mutation_cache::get_mutation_by_decree(_last_committed_decree + 1);\n            }\n\n            sanity_check();\n            return count > 0;\n        }\n    default:\n        dassert(false, \"invalid commit type %d\", (int)ct);\n    }\n\n    return false;\n}\n\n}} \/\/ namespace end\n<commit_msg>fix prepare_list<commit_after>\/*\n * The MIT License (MIT)\n *\n * Copyright (c) 2015 Microsoft Corporation\n * \n * -=- Robust Distributed System Nucleus (rDSN) -=- \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 * Description:\n *     What is this file about?\n *\n * Revision history:\n *     xxxx-xx-xx, author, first version\n *     xxxx-xx-xx, author, fix bug about xxx\n *\/\n\n#include \"prepare_list.h\"\n#include \"mutation.h\"\n\n# ifdef __TITLE__\n# undef __TITLE__\n# endif\n# define __TITLE__ \"prepare_list\"\n\nnamespace dsn { namespace replication {\n\nprepare_list::prepare_list(\n        decree init_decree, int max_count,\n        mutation_committer committer\n        )\n        : mutation_cache(init_decree, max_count)\n{\n    _committer = committer;\n    _last_committed_decree = init_decree;\n}\n\nvoid prepare_list::sanity_check()\n{\n\n}\n\nvoid prepare_list::reset(decree init_decree)\n{\n    _last_committed_decree = init_decree;\n    mutation_cache::reset(init_decree, true);\n}\n\nvoid prepare_list::truncate(decree init_decree)\n{\n    while (min_decree() <= init_decree && count() > 0)\n    {\n        pop_min();\n    }\n\n    if (count() == 0)\n    {\n        mutation_cache::reset(init_decree, true);\n    }\n\n    _last_committed_decree = init_decree;\n}\n\nerror_code prepare_list::prepare(mutation_ptr& mu, partition_status status)\n{\n    decree d = mu->data.header.decree;\n    dassert (d > last_committed_decree(), \"\");\n\n    error_code err;\n    switch (status)\n    {\n    case PS_PRIMARY:\n        \/\/ pop committed mutations if buffer is full\n        while (d - min_decree() >= capacity() && last_committed_decree() > min_decree())\n        {\n            pop_min();\n        }\n        return mutation_cache::put(mu);\n\n    case PS_SECONDARY: \n    case PS_POTENTIAL_SECONDARY:\n        \/\/ all mutations with lower decree must be ready\n        commit(mu->data.header.last_committed_decree, COMMIT_TO_DECREE_HARD);\n        \/\/ pop committed mutations if buffer is full\n        while (d - min_decree() >= capacity() && last_committed_decree() > min_decree())\n        {\n            pop_min();\n        }\n        err = mutation_cache::put(mu);\n        dassert (err == ERR_OK, \"\");\n        return err;\n\n    \/\/\/\/ delayed commit - only when capacity is an issue\n    \/\/case PS_POTENTIAL_SECONDARY:\n    \/\/    while (true)\n    \/\/    {\n    \/\/        err = mutation_cache::put(mu);\n    \/\/        if (err == ERR_CAPACITY_EXCEEDED)\n    \/\/        {\n    \/\/            dassert(mu->data.header.last_committed_decree >= min_decree(), \"\");\n    \/\/            commit (min_decree(), true);\n    \/\/            pop_min();\n    \/\/        }\n    \/\/        else\n    \/\/            break;\n    \/\/    }\n    \/\/    dassert (err == ERR_OK, \"\");\n    \/\/    return err;\n     \n    case PS_INACTIVE: \/\/ only possible during init  \n        if (mu->data.header.last_committed_decree > max_decree())\n        {\n            reset(mu->data.header.last_committed_decree);\n        }\n        else if (mu->data.header.last_committed_decree > _last_committed_decree)\n        {\n            \/\/ all mutations with lower decree must be ready\n            commit(mu->data.header.last_committed_decree, COMMIT_TO_DECREE_HARD);\n        }\n        \/\/ pop committed mutations if buffer is full\n        while (d - min_decree() >= capacity() && last_committed_decree() > min_decree())\n        {\n            pop_min();\n        }\n        err = mutation_cache::put(mu);\n        dassert (err == ERR_OK, \"\");\n        return err;\n\n    default:\n        dassert (false, \"\");\n        return 0;\n    }\n}\n\n\/\/\n\/\/ ordered commit\n\/\/\nbool prepare_list::commit(decree d, commit_type ct)\n{\n    if (d <= last_committed_decree())\n        return false;\n    \n    ballot last_bt = 0;\n    switch (ct)\n    {\n    case COMMIT_TO_DECREE_HARD:\n        {\n            for (decree d0 = last_committed_decree() + 1; d0 <= d; d0++)\n            {\n                mutation_ptr mu = get_mutation_by_decree(d0);\n                dassert(mu != nullptr &&\n                    (mu->is_logged()) &&\n                    mu->data.header.ballot >= last_bt,\n                    \"mutation %\" PRId64 \" is missing in prepare list\",\n                    d0\n                    );\n\n                _last_committed_decree++;\n                last_bt = mu->data.header.ballot;\n                _committer(mu);\n            }\n\n            sanity_check();\n            return true;\n        }\n    case COMMIT_TO_DECREE_SOFT:\n        {\n            for (decree d0 = last_committed_decree() + 1; d0 <= d; d0++)\n            {\n                mutation_ptr mu = get_mutation_by_decree(d0);\n                if (mu != nullptr && mu->is_ready_for_commit() && mu->data.header.ballot >= last_bt)\n                {\n                    _last_committed_decree++;\n                    last_bt = mu->data.header.ballot;\n                    _committer(mu);\n                }\n                else\n                    break;\n            }\n\n            sanity_check();\n            return true;\n        }\n    case COMMIT_ALL_READY:\n        {\n            if (d != last_committed_decree() + 1)\n                return false;\n\n            int count = 0;\n            mutation_ptr mu = get_mutation_by_decree(last_committed_decree() + 1);\n\n            while (mu != nullptr && mu->is_ready_for_commit() && mu->data.header.ballot >= last_bt)\n            {\n                _last_committed_decree++;\n                last_bt = mu->data.header.ballot;\n                _committer(mu);\n                count++;\n                mu = mutation_cache::get_mutation_by_decree(_last_committed_decree + 1);\n            }\n\n            sanity_check();\n            return count > 0;\n        }\n    default:\n        dassert(false, \"invalid commit type %d\", (int)ct);\n    }\n\n    return false;\n}\n\n}} \/\/ namespace end\n<|endoftext|>"}
{"text":"<commit_before>#include \"..\/base\/SRC_FIRST.hpp\"\n\n#include \"render_policy.hpp\"\n\n#include \"..\/indexer\/drawing_rules.hpp\"\n\n#include \"test_render_policy.hpp\"\n#include \"basic_render_policy.hpp\"\n#include \"render_policy_st.hpp\"\n#include \"render_policy_mt.hpp\"\n#include \"tiling_render_policy_st.hpp\"\n#include \"tiling_render_policy_mt.hpp\"\n#include \"benchmark_render_policy_mt.hpp\"\n#include \"benchmark_tiling_render_policy_mt.hpp\"\n\n#include \"..\/yg\/internal\/opengl.hpp\"\n\n#include \"..\/indexer\/scales.hpp\"\n\n#include \"..\/platform\/video_timer.hpp\"\n#include \"..\/platform\/settings.hpp\"\n#include \"..\/platform\/platform.hpp\"\n\nRenderPolicy::~RenderPolicy()\n{\n  LOG(LDEBUG, (\"clearing cached drawing rules\"));\n  drule::rules().ClearCaches();\n}\n\nRenderPolicy::RenderPolicy(shared_ptr<yg::gl::RenderContext> const & primaryRC, bool doSupportRotation)\n  : m_bgColor(0xEE, 0xEE, 0xDD, 0xFF),\n    m_primaryRC(primaryRC),\n    m_doSupportRotation(doSupportRotation),\n    m_doForceUpdate(false)\n{\n  yg::gl::InitExtensions();\n  yg::gl::CheckExtensionSupport();\n}\n\nm2::RectI const RenderPolicy::OnSize(int w, int h)\n{\n  m_drawer->onSize(w, h);\n  return m2::RectI(0, 0, w, h);\n}\n\nvoid RenderPolicy::StartDrag()\n{\n  m_windowHandle->invalidate();\n}\n\nvoid RenderPolicy::DoDrag()\n{\n  m_windowHandle->invalidate();\n}\n\nvoid RenderPolicy::StopDrag()\n{\n  m_windowHandle->invalidate();\n}\n\nvoid RenderPolicy::StartScale()\n{\n  m_windowHandle->invalidate();\n}\n\nvoid RenderPolicy::DoScale()\n{\n  m_windowHandle->invalidate();\n}\n\nvoid RenderPolicy::StopScale()\n{\n  m_windowHandle->invalidate();\n}\n\nvoid RenderPolicy::StartRotate(double a, double)\n{\n  m_windowHandle->invalidate();\n}\n\nvoid RenderPolicy::DoRotate(double a, double)\n{\n  m_windowHandle->invalidate();\n}\n\nvoid RenderPolicy::StopRotate(double a, double)\n{\n  m_windowHandle->invalidate();\n}\n\nvoid RenderPolicy::BeginFrame(shared_ptr<PaintEvent> const & e, ScreenBase const & s)\n{}\n\nvoid RenderPolicy::EndFrame(shared_ptr<PaintEvent> const & e, ScreenBase const & s)\n{}\n\nbool RenderPolicy::DoSupportRotation() const\n{\n  return m_doSupportRotation;\n}\n\nbool RenderPolicy::NeedRedraw() const\n{\n  return m_windowHandle->needRedraw();\n}\n\nbool RenderPolicy::IsTiling() const\n{\n  return false;\n}\n\nshared_ptr<DrawerYG> const & RenderPolicy::GetDrawer() const\n{\n  return m_drawer;\n}\n\nshared_ptr<WindowHandle> const & RenderPolicy::GetWindowHandle() const\n{\n  return m_windowHandle;\n}\n\nvoid RenderPolicy::SetRenderFn(TRenderFn renderFn)\n{\n  m_renderFn = renderFn;\n}\n\nbool RenderPolicy::DoForceUpdate() const\n{\n  return m_doForceUpdate;\n}\n\nvoid RenderPolicy::SetForceUpdate(bool flag)\n{\n  m_doForceUpdate = flag;\n}\n\nbool RenderPolicy::IsEmptyModel() const\n{\n  return false;\n}\n\nint RenderPolicy::GetDrawScale(ScreenBase const & s) const\n{\n  m2::PointD textureCenter(s.PixelRect().Center());\n  m2::RectD glbRect;\n\n  unsigned scaleEtalonSize = GetPlatform().ScaleEtalonSize();\n  s.PtoG(m2::RectD(textureCenter - m2::PointD(scaleEtalonSize \/ 2, scaleEtalonSize \/ 2),\n                   textureCenter + m2::PointD(scaleEtalonSize \/ 2, scaleEtalonSize \/ 2)),\n                   glbRect);\n  return scales::GetScaleLevel(glbRect);\n}\n\nRenderPolicy * CreateRenderPolicy(VideoTimer * videoTimer,\n                                  bool useDefaultFB,\n                                  yg::ResourceManager::Params const & rmParams,\n                                  shared_ptr<yg::gl::RenderContext> const & primaryRC)\n{\n  bool benchmarkingEnabled = false;\n  Settings::Get(\"IsBenchmarking\", benchmarkingEnabled);\n\n  if (benchmarkingEnabled)\n  {\n    bool isBenchmarkingMT = false;\n    Settings::Get(\"IsBenchmarkingMT\", isBenchmarkingMT);\n\n    if (isBenchmarkingMT)\n      return new BenchmarkTilingRenderPolicyMT(videoTimer, useDefaultFB, rmParams, primaryRC);\n    else\n      return new BenchmarkRenderPolicyMT(videoTimer, useDefaultFB, rmParams, primaryRC);\n  }\n  else\n  {\n#ifdef OMIM_OS_ANDROID\n    return new TilingRenderPolicyST(videoTimer, useDefaultFB, rmParams, primaryRC);\n#endif\n#ifdef OMIM_OS_IPHONE\n    return new RenderPolicyMT(videoTimer, useDefaultFB, rmParams, primaryRC);\n#endif\n#ifdef OMIM_OS_DESKTOP\n    return new RenderPolicyMT(videoTimer, useDefaultFB, rmParams, primaryRC);\n#endif\n  }\n}\n<commit_msg>[desktop] using TilingRenderPolicyST by default<commit_after>#include \"..\/base\/SRC_FIRST.hpp\"\n\n#include \"render_policy.hpp\"\n\n#include \"..\/indexer\/drawing_rules.hpp\"\n\n#include \"test_render_policy.hpp\"\n#include \"basic_render_policy.hpp\"\n#include \"render_policy_st.hpp\"\n#include \"render_policy_mt.hpp\"\n#include \"tiling_render_policy_st.hpp\"\n#include \"tiling_render_policy_mt.hpp\"\n#include \"benchmark_render_policy_mt.hpp\"\n#include \"benchmark_tiling_render_policy_mt.hpp\"\n\n#include \"..\/yg\/internal\/opengl.hpp\"\n\n#include \"..\/indexer\/scales.hpp\"\n\n#include \"..\/platform\/video_timer.hpp\"\n#include \"..\/platform\/settings.hpp\"\n#include \"..\/platform\/platform.hpp\"\n\nRenderPolicy::~RenderPolicy()\n{\n  LOG(LDEBUG, (\"clearing cached drawing rules\"));\n  drule::rules().ClearCaches();\n}\n\nRenderPolicy::RenderPolicy(shared_ptr<yg::gl::RenderContext> const & primaryRC, bool doSupportRotation)\n  : m_bgColor(0xEE, 0xEE, 0xDD, 0xFF),\n    m_primaryRC(primaryRC),\n    m_doSupportRotation(doSupportRotation),\n    m_doForceUpdate(false)\n{\n  yg::gl::InitExtensions();\n  yg::gl::CheckExtensionSupport();\n}\n\nm2::RectI const RenderPolicy::OnSize(int w, int h)\n{\n  m_drawer->onSize(w, h);\n  return m2::RectI(0, 0, w, h);\n}\n\nvoid RenderPolicy::StartDrag()\n{\n  m_windowHandle->invalidate();\n}\n\nvoid RenderPolicy::DoDrag()\n{\n  m_windowHandle->invalidate();\n}\n\nvoid RenderPolicy::StopDrag()\n{\n  m_windowHandle->invalidate();\n}\n\nvoid RenderPolicy::StartScale()\n{\n  m_windowHandle->invalidate();\n}\n\nvoid RenderPolicy::DoScale()\n{\n  m_windowHandle->invalidate();\n}\n\nvoid RenderPolicy::StopScale()\n{\n  m_windowHandle->invalidate();\n}\n\nvoid RenderPolicy::StartRotate(double a, double)\n{\n  m_windowHandle->invalidate();\n}\n\nvoid RenderPolicy::DoRotate(double a, double)\n{\n  m_windowHandle->invalidate();\n}\n\nvoid RenderPolicy::StopRotate(double a, double)\n{\n  m_windowHandle->invalidate();\n}\n\nvoid RenderPolicy::BeginFrame(shared_ptr<PaintEvent> const & e, ScreenBase const & s)\n{}\n\nvoid RenderPolicy::EndFrame(shared_ptr<PaintEvent> const & e, ScreenBase const & s)\n{}\n\nbool RenderPolicy::DoSupportRotation() const\n{\n  return m_doSupportRotation;\n}\n\nbool RenderPolicy::NeedRedraw() const\n{\n  return m_windowHandle->needRedraw();\n}\n\nbool RenderPolicy::IsTiling() const\n{\n  return false;\n}\n\nshared_ptr<DrawerYG> const & RenderPolicy::GetDrawer() const\n{\n  return m_drawer;\n}\n\nshared_ptr<WindowHandle> const & RenderPolicy::GetWindowHandle() const\n{\n  return m_windowHandle;\n}\n\nvoid RenderPolicy::SetRenderFn(TRenderFn renderFn)\n{\n  m_renderFn = renderFn;\n}\n\nbool RenderPolicy::DoForceUpdate() const\n{\n  return m_doForceUpdate;\n}\n\nvoid RenderPolicy::SetForceUpdate(bool flag)\n{\n  m_doForceUpdate = flag;\n}\n\nbool RenderPolicy::IsEmptyModel() const\n{\n  return false;\n}\n\nint RenderPolicy::GetDrawScale(ScreenBase const & s) const\n{\n  m2::PointD textureCenter(s.PixelRect().Center());\n  m2::RectD glbRect;\n\n  unsigned scaleEtalonSize = GetPlatform().ScaleEtalonSize();\n  s.PtoG(m2::RectD(textureCenter - m2::PointD(scaleEtalonSize \/ 2, scaleEtalonSize \/ 2),\n                   textureCenter + m2::PointD(scaleEtalonSize \/ 2, scaleEtalonSize \/ 2)),\n                   glbRect);\n  return scales::GetScaleLevel(glbRect);\n}\n\nRenderPolicy * CreateRenderPolicy(VideoTimer * videoTimer,\n                                  bool useDefaultFB,\n                                  yg::ResourceManager::Params const & rmParams,\n                                  shared_ptr<yg::gl::RenderContext> const & primaryRC)\n{\n  bool benchmarkingEnabled = false;\n  Settings::Get(\"IsBenchmarking\", benchmarkingEnabled);\n\n  if (benchmarkingEnabled)\n  {\n    bool isBenchmarkingMT = false;\n    Settings::Get(\"IsBenchmarkingMT\", isBenchmarkingMT);\n\n    if (isBenchmarkingMT)\n      return new BenchmarkTilingRenderPolicyMT(videoTimer, useDefaultFB, rmParams, primaryRC);\n    else\n      return new BenchmarkRenderPolicyMT(videoTimer, useDefaultFB, rmParams, primaryRC);\n  }\n  else\n  {\n#ifdef OMIM_OS_ANDROID\n    return new TilingRenderPolicyST(videoTimer, useDefaultFB, rmParams, primaryRC);\n#endif\n#ifdef OMIM_OS_IPHONE\n    return new RenderPolicyMT(videoTimer, useDefaultFB, rmParams, primaryRC);\n#endif\n#ifdef OMIM_OS_DESKTOP\n    return new TilingRenderPolicyST(videoTimer, useDefaultFB, rmParams, primaryRC);\n#endif\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\/* $Id$ *\/\n\/* History of cvs commits:\n *\n * $Log$\n * Revision 1.1  2007\/03\/17 19:56:38  mvl\n * Moved signal shape routines from AliEMCAL to separate class AliEMCALRawUtils to streamline raw data reconstruction code.\n * *\/\n\n\/\/*-- Author: Marco van Leeuwen (LBL)\n#include \"AliEMCALRawUtils.h\"\n\n#include \"TF1.h\"\n#include \"TGraph.h\"\n#include \"TSystem.h\"\n\n#include \"AliLog.h\"\n#include \"AliRunLoader.h\"\n#include \"AliCaloAltroMapping.h\"\n#include \"AliAltroBuffer.h\"\n#include \"AliRawReader.h\"\n#include \"AliCaloRawStream.h\"\n#include \"AliDAQ.h\"\n\n#include \"AliEMCALLoader.h\"\n#include \"AliEMCALGeometry.h\"\n#include \"AliEMCALDigitizer.h\"\n#include \"AliEMCALDigit.h\"\n\n\nClassImp(AliEMCALRawUtils)\n\n\/\/ Signal shape parameters\nInt_t    AliEMCALRawUtils::fgOrder       = 2 ;      \/\/ Order of gamma function \nDouble_t AliEMCALRawUtils::fgTimeMax     = 2.56E-5 ;  \/\/ each sample is over 100 ns fTimeMax\/fTimeBins\nDouble_t AliEMCALRawUtils::fgTau         = 165E-9 ;   \/\/ 165 ns (from testbeam; not very accurate)\nDouble_t AliEMCALRawUtils::fgTimeTrigger = 1.5E-6 ;   \/\/ 15 time bins ~ 1.5 musec\n\n\/\/ some digitization constants\nInt_t    AliEMCALRawUtils::fgThreshold = 1;\nInt_t    AliEMCALRawUtils::fgDDLPerSuperModule = 2;  \/\/ 2 ddls per SuperModule\n\nAliEMCALRawUtils::AliEMCALRawUtils(): fHighLowGainFactor(0.) {\n  fHighLowGainFactor = 16. ;          \/\/ adjusted for a low gain range of 82 GeV (10 bits) \n}\n\/\/____________________________________________________________________________\nAliEMCALRawUtils::~AliEMCALRawUtils() {\n}\n\/\/____________________________________________________________________________\nvoid AliEMCALRawUtils::Digits2Raw()\n{\n  \/\/ convert digits of the current event to raw data\n  \n  AliRunLoader *rl = AliRunLoader::GetRunLoader();\n  AliEMCALLoader *loader = dynamic_cast<AliEMCALLoader*>(rl->GetDetectorLoader(\"EMCAL\"));\n\n  \/\/ get the digits\n  loader->LoadDigits(\"EMCAL\");\n  loader->GetEvent();\n  TClonesArray* digits = loader->Digits() ;\n  \n  if (!digits) {\n    Warning(\"Digits2Raw\", \"no digits found !\");\n    return;\n  }\n    \n  \/\/ get the geometry\n  AliEMCALGeometry* geom = AliEMCALGeometry::GetInstance();\n  if (!geom) {\n    AliError(Form(\"No geometry found !\"));\n    return;\n  }\n  \n  static const Int_t nDDL = 12*2; \/\/ 12 SM hardcoded for now. Buffers allocated dynamically, when needed, so just need an upper limit here\n  AliAltroBuffer* buffers[nDDL];\n  for (Int_t i=0; i < nDDL; i++)\n    buffers[i] = 0;\n\n  Int_t adcValuesLow[fgkTimeBins];\n  Int_t adcValuesHigh[fgkTimeBins];\n\n  \/\/Load Mapping RCU files once\n  TString path = gSystem->Getenv(\"ALICE_ROOT\");\n  path += \"\/EMCAL\/mapping\/RCU\";\n  TString path0 = path+\"0.data\";\/\/This file will change in future\n  TString path1 = path+\"1.data\";\/\/This file will change in future\n  AliAltroMapping * mapping[2] ; \/\/ For the moment only 2\n  mapping[0] = new AliCaloAltroMapping(path0.Data());\n  mapping[1] = new AliCaloAltroMapping(path1.Data());\n\n  \/\/ loop over digits (assume ordered digits)\n  for (Int_t iDigit = 0; iDigit < digits->GetEntries(); iDigit++) {\n    AliEMCALDigit* digit = dynamic_cast<AliEMCALDigit *>(digits->At(iDigit)) ;\n    if (digit->GetAmp() < fgThreshold) \n      continue;\n\n    \/\/get cell indices\n    Int_t nSM = 0;\n    Int_t nIphi = 0;\n    Int_t nIeta = 0;\n    Int_t iphi = 0;\n    Int_t ieta = 0;\n    Int_t nModule = 0;\n    geom->GetCellIndex(digit->GetId(), nSM, nModule, nIphi, nIeta);\n    geom->GetCellPhiEtaIndexInSModule(nSM, nModule, nIphi, nIeta,iphi, ieta) ;\n    \n    \/\/Check which is the RCU of the cell.\n    Int_t iRCU = -111;\n    \/\/RCU0\n    if (0<=iphi&&iphi<8) iRCU=0; \/\/ first cable row\n    else if (8<=iphi&&iphi<16 && 0<=ieta&&ieta<24) iRCU=0; \/\/ first half; \n    \/\/second cable row\n    \/\/RCU1\n    else if(8<=iphi&&iphi<16 && 24<=ieta&&ieta<48) iRCU=1; \/\/ second half; \n    \/\/second cable row\n    else if(16<=iphi&&iphi<24) iRCU=1; \/\/ third cable row\n    \n    \/\/Which DDL?\n    Int_t iDDL = fgDDLPerSuperModule* nSM + iRCU;\n    if (iDDL >= nDDL)\n      Fatal(\"Digits2Raw()\",\"Non-existent DDL board number: %d\", iDDL);\n\n    if (buffers[iDDL] == 0) {      \n      \/\/ open new file and write dummy header\n      TString fileName = AliDAQ::DdlFileName(\"EMCAL\",iDDL);\n      buffers[iDDL] = new AliAltroBuffer(fileName.Data(),mapping[iRCU]);\n      buffers[iDDL]->WriteDataHeader(kTRUE, kFALSE);  \/\/Dummy;\n    }\n    \n    \/\/ out of time range signal (?)\n    if (digit->GetTimeR() > GetRawFormatTimeMax() ) {\n      AliInfo(\"Signal is out of time range.\\n\");\n      buffers[iDDL]->FillBuffer((Int_t)digit->GetAmp());\n      buffers[iDDL]->FillBuffer(GetRawFormatTimeBins() );  \/\/ time bin\n      buffers[iDDL]->FillBuffer(3);          \/\/ bunch length      \n      buffers[iDDL]->WriteTrailer(3, ieta, iphi, nSM);  \/\/ trailer\n      \/\/ calculate the time response function\n    } else {\n      Bool_t lowgain = RawSampledResponse(digit->GetTimeR(), digit->GetAmp(), adcValuesHigh, adcValuesLow) ; \n      if (lowgain) \n\tbuffers[iDDL]->WriteChannel(ieta, iphi, 0, GetRawFormatTimeBins(), adcValuesLow, fgThreshold);\n      else \n\tbuffers[iDDL]->WriteChannel(ieta,iphi, 1, GetRawFormatTimeBins(), adcValuesHigh, fgThreshold);\n    }\n  }\n  \n  \/\/ write headers and close files\n  for (Int_t i=0; i < nDDL; i++) {\n    if (buffers[i]) {\n      buffers[i]->Flush();\n      buffers[i]->WriteDataHeader(kFALSE, kFALSE);\n      delete buffers[i];\n    }\n  }\n  mapping[0]->Delete();\n  mapping[1]->Delete();\n  loader->UnloadDigits();\n}\n\n\/\/____________________________________________________________________________\nvoid AliEMCALRawUtils::Raw2Digits(AliRawReader* reader,TClonesArray *digitsArr)\n{\n  \/\/ convert raw data of the current event to digits\n  AliEMCALGeometry * geom = AliEMCALGeometry::GetInstance();\n  if (!geom) {\n    AliError(Form(\"No geometry found !\"));\n    return;\n  }\n\n  digitsArr->Clear(); \n\n  if (!digitsArr) {\n    Error(\"Raw2Digits\", \"no digits found !\");\n    return;\n  }\n  if (!reader) {\n    Error(\"Raw2Digits\", \"no raw reader found !\");\n    return;\n  }\n\n  \/\/ Use AliAltroRawStream to read the ALTRO format.  No need to\n  \/\/ reinvent the wheel :-) \n  AliCaloRawStream in(reader,\"EMCAL\");\n  \/\/ Select EMCAL DDL's;\n  reader->Select(\"EMCAL\");\n\n  \/\/ reading is from previously existing AliEMCALGetter.cxx\n  \/\/ ReadRaw method\n  TF1 * signalF = new TF1(\"signal\", RawResponseFunction, 0, GetRawFormatTimeMax(), 4);\n  signalF->SetParNames(\"Charge\", \"Gain\", \"Amplitude\", \"TimeZero\"); \n  \n  Int_t id =  -1;\n  Int_t idigit = 0 ; \n  Double_t time = 0. ; \n  Double_t amp = 0. ; \n\n  TGraph * gSig = new TGraph(GetRawFormatTimeBins()) ; \n\n  Int_t eofReached = 0;\n  Int_t lowGain = 0;\n\n  in.Next(); \/\/ Go to first digit\n  do {\n    id =  geom->GetAbsCellIdFromCellIndexes(in.GetModule(), in.GetRow(), in.GetColumn()) ;\n    lowGain = in.IsLowGain();\n    gSig->SetPoint(in.GetTime(), \n\t\t   in.GetTime()* GetRawFormatTimeMax() \/ GetRawFormatTimeBins(), \n\t\t   in.GetSignal()) ;\n\n    Int_t iTime = 1;\n    do {\n      if (!in.Next())\n\teofReached = 1;\n      else {\n\tgSig->SetPoint(in.GetTime(), \n\t\t       in.GetTime()* GetRawFormatTimeMax() \/ GetRawFormatTimeBins(), \n\t\t       in.GetSignal()) ;\n      }\n      iTime++;\n    } while (!eofReached && !in.IsNewRow() && !in.IsNewColumn() && !in.IsNewModule());\n\n    FitRaw(gSig, signalF, amp, time) ; \n    if (lowGain) \n      amp *= fHighLowGainFactor; \n    \n    if (amp > 0) {\n      AliDebug(2,Form(\"id %d amp %g\", id, amp));\n      new((*digitsArr)[idigit]) AliEMCALDigit( -1, -1, id, (Int_t)amp, time, idigit) ;\t\n\t  idigit++ ; \n    }\n    Int_t index ; \n\t\n    \/\/ Reset graph\n    for (index = 0; index < GetRawFormatTimeBins(); index++) {\n      gSig->SetPoint(index, index * GetRawFormatTimeMax() \/ GetRawFormatTimeBins(), 0) ;  \n    } \n  } while (!eofReached); \/\/ EMCAL entries loop\n  \n  delete signalF ; \n  delete gSig;\n  \n  return ; \n}\n\n\/\/____________________________________________________________________________ \nvoid AliEMCALRawUtils::FitRaw(TGraph * gSig, TF1* signalF, Double_t & amp, Double_t & time)\n{\n  \/\/ Fits the raw signal time distribution; from AliEMCALGetter \n\n  const Int_t kNoiseThreshold = 0 ;\n  Double_t timezero1 = 0., timezero2 = 0., timemax = 0. ;\n  Double_t signal = 0., signalmax = 0. ;       \n  amp = time = 0. ; \n\n  timezero1 = signalmax = timemax = 0. ;\n  timezero2 = GetRawFormatTimeMax();\n  Int_t index ; \n  for (index = 0; index < GetRawFormatTimeBins(); index++) {\n    gSig->GetPoint(index, time, signal) ; \n    if (signal > kNoiseThreshold && timezero1 == 0.) \n      timezero1 = time ;\n    if (signal <= kNoiseThreshold && timezero1 > 0. && timezero2 == 0.)\n      timezero2 = time ; \n    if (signal > signalmax) {\n      signalmax = signal ; \n      timemax   = time ; \n    }\n  }\n\n  if ( timemax < GetRawFormatTimeMax() * 0.4 ) { \/\/ else its noise \n    signalF->SetParameter(0, signalmax) ; \n    signalF->SetParameter(1, timemax) ; \n    gSig->Fit(signalF, \"QRON\", \"\", 0., timezero2); \/\/, \"QRON\") ; \n    amp = signalF->GetParameter(0) ; \n    time = signalF->GetParameter(1) - fgTimeTrigger;\n  }\n  return;\n}\n\/\/__________________________________________________________________\nDouble_t AliEMCALRawUtils::RawResponseFunction(Double_t *x, Double_t *par)\n{\n  \/\/ Shape of the electronics raw reponse:\n  \/\/ It is a semi-gaussian, 2nd order Gamma function of the general form\n  \/\/\n  \/\/ t' = (t - t0 + tau) \/ tau\n  \/\/ F = A * t**N * exp( N * ( 1 - t) )   for t >= 0\n  \/\/ F = 0                                for t < 0 \n  \/\/\n  \/\/ parameters:\n  \/\/ A:   par[0]   \/\/ Amplitude = peak value\n  \/\/ t0:  par[1]\n  \/\/ tau: fgTau\n  \/\/ N:   fgOrder\n  \/\/\n  Double_t signal ;\n  Double_t xx = ( x[0] - par[1] + fgTau ) \/ fgTau ; \n\n  if (xx < 0) \n    signal = 0. ;  \n  else {  \n    signal = par[0] * TMath::Power(xx , fgOrder) * TMath::Exp(fgOrder * (1 - xx )) ; \n  }\n  return signal ;  \n}\n\n\/\/__________________________________________________________________\nBool_t AliEMCALRawUtils::RawSampledResponse(\nconst Double_t dtime, const Double_t damp, Int_t * adcH, Int_t * adcL) const \n{\n  \/\/ for a start time dtime and an amplitude damp given by digit, \n  \/\/ calculates the raw sampled response AliEMCAL::RawResponseFunction\n\n  const Int_t kRawSignalOverflow = 0x3FF ; \n  Bool_t lowGain = kFALSE ; \n\n  TF1 signalF(\"signal\", RawResponseFunction, 0, GetRawFormatTimeMax(), 4);\n  signalF.SetParameter(0, damp) ; \n  signalF.SetParameter(1, dtime + fgTimeTrigger) ; \n\n  for (Int_t iTime = 0; iTime < GetRawFormatTimeBins(); iTime++) {\n    Double_t time = iTime * GetRawFormatTimeMax() \/ GetRawFormatTimeBins() ;\n    Double_t signal = signalF.Eval(time) ;     \n    adcH[iTime] =  static_cast<Int_t>(signal + 0.5) ;\n    if ( adcH[iTime] > kRawSignalOverflow ){  \/\/ larger than 10 bits \n      adcH[iTime] = kRawSignalOverflow ;\n      lowGain = kTRUE ; \n    }\n\n    signal \/= fHighLowGainFactor;\n\n    adcL[iTime] =  static_cast<Int_t>(signal + 0.5) ;\n    if ( adcL[iTime] > kRawSignalOverflow)  \/\/ larger than 10 bits \n      adcL[iTime] = kRawSignalOverflow ;\n  }\n  return lowGain ; \n}\n<commit_msg>More robust setting of fit range in FitRawSignal (P. Hristov)<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\/* History of cvs commits:\n *\n * $Log$\n * Revision 1.2  2007\/09\/03 20:55:35  jklay\n * EMCAL e-by-e reconstruction methods from Cvetan\n *\n * Revision 1.1  2007\/03\/17 19:56:38  mvl\n * Moved signal shape routines from AliEMCAL to separate class AliEMCALRawUtils to streamline raw data reconstruction code.\n * *\/\n\n\/\/*-- Author: Marco van Leeuwen (LBL)\n#include \"AliEMCALRawUtils.h\"\n\n#include \"TF1.h\"\n#include \"TGraph.h\"\n#include \"TSystem.h\"\n\n#include \"AliLog.h\"\n#include \"AliRunLoader.h\"\n#include \"AliCaloAltroMapping.h\"\n#include \"AliAltroBuffer.h\"\n#include \"AliRawReader.h\"\n#include \"AliCaloRawStream.h\"\n#include \"AliDAQ.h\"\n\n#include \"AliEMCALLoader.h\"\n#include \"AliEMCALGeometry.h\"\n#include \"AliEMCALDigitizer.h\"\n#include \"AliEMCALDigit.h\"\n\n\nClassImp(AliEMCALRawUtils)\n\n\/\/ Signal shape parameters\nInt_t    AliEMCALRawUtils::fgOrder       = 2 ;      \/\/ Order of gamma function \nDouble_t AliEMCALRawUtils::fgTimeMax     = 2.56E-5 ;  \/\/ each sample is over 100 ns fTimeMax\/fTimeBins\nDouble_t AliEMCALRawUtils::fgTau         = 165E-9 ;   \/\/ 165 ns (from testbeam; not very accurate)\nDouble_t AliEMCALRawUtils::fgTimeTrigger = 1.5E-6 ;   \/\/ 15 time bins ~ 1.5 musec\n\n\/\/ some digitization constants\nInt_t    AliEMCALRawUtils::fgThreshold = 1;\nInt_t    AliEMCALRawUtils::fgDDLPerSuperModule = 2;  \/\/ 2 ddls per SuperModule\n\nAliEMCALRawUtils::AliEMCALRawUtils(): fHighLowGainFactor(0.) {\n  fHighLowGainFactor = 16. ;          \/\/ adjusted for a low gain range of 82 GeV (10 bits) \n}\n\/\/____________________________________________________________________________\nAliEMCALRawUtils::~AliEMCALRawUtils() {\n}\n\/\/____________________________________________________________________________\nvoid AliEMCALRawUtils::Digits2Raw()\n{\n  \/\/ convert digits of the current event to raw data\n  \n  AliRunLoader *rl = AliRunLoader::GetRunLoader();\n  AliEMCALLoader *loader = dynamic_cast<AliEMCALLoader*>(rl->GetDetectorLoader(\"EMCAL\"));\n\n  \/\/ get the digits\n  loader->LoadDigits(\"EMCAL\");\n  loader->GetEvent();\n  TClonesArray* digits = loader->Digits() ;\n  \n  if (!digits) {\n    Warning(\"Digits2Raw\", \"no digits found !\");\n    return;\n  }\n    \n  \/\/ get the geometry\n  AliEMCALGeometry* geom = AliEMCALGeometry::GetInstance();\n  if (!geom) {\n    AliError(Form(\"No geometry found !\"));\n    return;\n  }\n  \n  static const Int_t nDDL = 12*2; \/\/ 12 SM hardcoded for now. Buffers allocated dynamically, when needed, so just need an upper limit here\n  AliAltroBuffer* buffers[nDDL];\n  for (Int_t i=0; i < nDDL; i++)\n    buffers[i] = 0;\n\n  Int_t adcValuesLow[fgkTimeBins];\n  Int_t adcValuesHigh[fgkTimeBins];\n\n  \/\/Load Mapping RCU files once\n  TString path = gSystem->Getenv(\"ALICE_ROOT\");\n  path += \"\/EMCAL\/mapping\/RCU\";\n  TString path0 = path+\"0.data\";\/\/This file will change in future\n  TString path1 = path+\"1.data\";\/\/This file will change in future\n  AliAltroMapping * mapping[2] ; \/\/ For the moment only 2\n  mapping[0] = new AliCaloAltroMapping(path0.Data());\n  mapping[1] = new AliCaloAltroMapping(path1.Data());\n\n  \/\/ loop over digits (assume ordered digits)\n  for (Int_t iDigit = 0; iDigit < digits->GetEntries(); iDigit++) {\n    AliEMCALDigit* digit = dynamic_cast<AliEMCALDigit *>(digits->At(iDigit)) ;\n    if (digit->GetAmp() < fgThreshold) \n      continue;\n\n    \/\/get cell indices\n    Int_t nSM = 0;\n    Int_t nIphi = 0;\n    Int_t nIeta = 0;\n    Int_t iphi = 0;\n    Int_t ieta = 0;\n    Int_t nModule = 0;\n    geom->GetCellIndex(digit->GetId(), nSM, nModule, nIphi, nIeta);\n    geom->GetCellPhiEtaIndexInSModule(nSM, nModule, nIphi, nIeta,iphi, ieta) ;\n    \n    \/\/Check which is the RCU of the cell.\n    Int_t iRCU = -111;\n    \/\/RCU0\n    if (0<=iphi&&iphi<8) iRCU=0; \/\/ first cable row\n    else if (8<=iphi&&iphi<16 && 0<=ieta&&ieta<24) iRCU=0; \/\/ first half; \n    \/\/second cable row\n    \/\/RCU1\n    else if(8<=iphi&&iphi<16 && 24<=ieta&&ieta<48) iRCU=1; \/\/ second half; \n    \/\/second cable row\n    else if(16<=iphi&&iphi<24) iRCU=1; \/\/ third cable row\n    \n    \/\/Which DDL?\n    Int_t iDDL = fgDDLPerSuperModule* nSM + iRCU;\n    if (iDDL >= nDDL)\n      Fatal(\"Digits2Raw()\",\"Non-existent DDL board number: %d\", iDDL);\n\n    if (buffers[iDDL] == 0) {      \n      \/\/ open new file and write dummy header\n      TString fileName = AliDAQ::DdlFileName(\"EMCAL\",iDDL);\n      buffers[iDDL] = new AliAltroBuffer(fileName.Data(),mapping[iRCU]);\n      buffers[iDDL]->WriteDataHeader(kTRUE, kFALSE);  \/\/Dummy;\n    }\n    \n    \/\/ out of time range signal (?)\n    if (digit->GetTimeR() > GetRawFormatTimeMax() ) {\n      AliInfo(\"Signal is out of time range.\\n\");\n      buffers[iDDL]->FillBuffer((Int_t)digit->GetAmp());\n      buffers[iDDL]->FillBuffer(GetRawFormatTimeBins() );  \/\/ time bin\n      buffers[iDDL]->FillBuffer(3);          \/\/ bunch length      \n      buffers[iDDL]->WriteTrailer(3, ieta, iphi, nSM);  \/\/ trailer\n      \/\/ calculate the time response function\n    } else {\n      Bool_t lowgain = RawSampledResponse(digit->GetTimeR(), digit->GetAmp(), adcValuesHigh, adcValuesLow) ; \n      if (lowgain) \n\tbuffers[iDDL]->WriteChannel(ieta, iphi, 0, GetRawFormatTimeBins(), adcValuesLow, fgThreshold);\n      else \n\tbuffers[iDDL]->WriteChannel(ieta,iphi, 1, GetRawFormatTimeBins(), adcValuesHigh, fgThreshold);\n    }\n  }\n  \n  \/\/ write headers and close files\n  for (Int_t i=0; i < nDDL; i++) {\n    if (buffers[i]) {\n      buffers[i]->Flush();\n      buffers[i]->WriteDataHeader(kFALSE, kFALSE);\n      delete buffers[i];\n    }\n  }\n  mapping[0]->Delete();\n  mapping[1]->Delete();\n  loader->UnloadDigits();\n}\n\n\/\/____________________________________________________________________________\nvoid AliEMCALRawUtils::Raw2Digits(AliRawReader* reader,TClonesArray *digitsArr)\n{\n  \/\/ convert raw data of the current event to digits\n  AliEMCALGeometry * geom = AliEMCALGeometry::GetInstance();\n  if (!geom) {\n    AliError(Form(\"No geometry found !\"));\n    return;\n  }\n\n  digitsArr->Clear(); \n\n  if (!digitsArr) {\n    Error(\"Raw2Digits\", \"no digits found !\");\n    return;\n  }\n  if (!reader) {\n    Error(\"Raw2Digits\", \"no raw reader found !\");\n    return;\n  }\n\n  \/\/ Use AliAltroRawStream to read the ALTRO format.  No need to\n  \/\/ reinvent the wheel :-) \n  AliCaloRawStream in(reader,\"EMCAL\");\n  \/\/ Select EMCAL DDL's;\n  reader->Select(\"EMCAL\");\n\n  \/\/ reading is from previously existing AliEMCALGetter.cxx\n  \/\/ ReadRaw method\n  TF1 * signalF = new TF1(\"signal\", RawResponseFunction, 0, GetRawFormatTimeMax(), 4);\n  signalF->SetParNames(\"Charge\", \"Gain\", \"Amplitude\", \"TimeZero\"); \n  \n  Int_t id =  -1;\n  Int_t idigit = 0 ; \n  Double_t time = 0. ; \n  Double_t amp = 0. ; \n\n  TGraph * gSig = new TGraph(GetRawFormatTimeBins()) ; \n\n  Int_t eofReached = 0;\n  Int_t lowGain = 0;\n\n  in.Next(); \/\/ Go to first digit\n  do {\n    id =  geom->GetAbsCellIdFromCellIndexes(in.GetModule(), in.GetRow(), in.GetColumn()) ;\n    lowGain = in.IsLowGain();\n    gSig->SetPoint(in.GetTime(), \n\t\t   in.GetTime()* GetRawFormatTimeMax() \/ GetRawFormatTimeBins(), \n\t\t   in.GetSignal()) ;\n\n    Int_t iTime = 1;\n    do {\n      if (!in.Next())\n\teofReached = 1;\n      else {\n\tgSig->SetPoint(in.GetTime(), \n\t\t       in.GetTime()* GetRawFormatTimeMax() \/ GetRawFormatTimeBins(), \n\t\t       in.GetSignal()) ;\n      }\n      iTime++;\n    } while (!eofReached && !in.IsNewRow() && !in.IsNewColumn() && !in.IsNewModule());\n\n    FitRaw(gSig, signalF, amp, time) ; \n    if (lowGain) \n      amp *= fHighLowGainFactor; \n    \n    if (amp > 0) {\n      AliDebug(2,Form(\"id %d amp %g\", id, amp));\n      new((*digitsArr)[idigit]) AliEMCALDigit( -1, -1, id, (Int_t)amp, time, idigit) ;\t\n\t  idigit++ ; \n    }\n    Int_t index ; \n\t\n    \/\/ Reset graph\n    for (index = 0; index < GetRawFormatTimeBins(); index++) {\n      gSig->SetPoint(index, index * GetRawFormatTimeMax() \/ GetRawFormatTimeBins(), 0) ;  \n    } \n  } while (!eofReached); \/\/ EMCAL entries loop\n  \n  delete signalF ; \n  delete gSig;\n  \n  return ; \n}\n\n\/\/____________________________________________________________________________ \nvoid AliEMCALRawUtils::FitRaw(TGraph * gSig, TF1* signalF, Double_t & amp, Double_t & time)\n{\n  \/\/ Fits the raw signal time distribution; from AliEMCALGetter \n\n  const Int_t kNoiseThreshold = 0 ;\n  Double_t timezero1 = 0., timezero2 = 0., timemax = 0. ;\n  Double_t signal = 0., signalmax = 0. ;       \n  amp = time = 0. ; \n\n  timezero1 = signalmax = timemax = 0. ;\n  timezero1 = GetRawFormatTimeMax();\n  timezero2 = 0;\n\n  \/\/  Find the time,the value and the index of the maximum\n\n  Int_t indexmax = 0;\n  for (Int_t index = 0; index < GetRawFormatTimeBins(); index++) {\n    gSig->GetPoint(index, time, signal) ; \n    if (signal >= signalmax) {\n      signalmax = signal ; \n      timemax   = time ;\n      indexmax = index;\n    }\n  }\n\n  if ( timemax < GetRawFormatTimeMax() * 0.4 ) { \/\/ else its noise \n\n    \/\/ Find the start time of the signal;\n    for (Int_t index = indexmax; index >= 0; index--) {    \n      gSig->GetPoint(index, time, signal) ; \n      \n      if (signal>kNoiseThreshold) {\n\ttimezero1 = time;\n      }\n      else break;\n    }\n    \/\/ Find the end time of the signal;\n    for (Int_t index = indexmax; index < GetRawFormatTimeBins(); index++) {    \n      gSig->GetPoint(index, time, signal) ; \n      if (signal>kNoiseThreshold) {\n\ttimezero2 = time;\n      }\n      else break;\n    }\n\n    signalF->SetParameter(0, signalmax) ; \n    \/\/    signalF->SetParameter(1, timemax) ; \n    signalF->SetParameter(1, 0.5*(timezero1+timezero2)) ; \n    gSig->Fit(signalF, \"QRON\", \"\", timezero1, timezero2); \/\/, \"QRON\") ; \n    amp = signalF->GetParameter(0) ; \n    time = signalF->GetParameter(1) - fgTimeTrigger;\n  }\n  return;\n}\n\/\/__________________________________________________________________\nDouble_t AliEMCALRawUtils::RawResponseFunction(Double_t *x, Double_t *par)\n{\n  \/\/ Shape of the electronics raw reponse:\n  \/\/ It is a semi-gaussian, 2nd order Gamma function of the general form\n  \/\/\n  \/\/ t' = (t - t0 + tau) \/ tau\n  \/\/ F = A * t**N * exp( N * ( 1 - t) )   for t >= 0\n  \/\/ F = 0                                for t < 0 \n  \/\/\n  \/\/ parameters:\n  \/\/ A:   par[0]   \/\/ Amplitude = peak value\n  \/\/ t0:  par[1]\n  \/\/ tau: fgTau\n  \/\/ N:   fgOrder\n  \/\/\n  Double_t signal ;\n  Double_t xx = ( x[0] - par[1] + fgTau ) \/ fgTau ; \n\n  if (xx <= 0) \n    signal = 0. ;  \n  else {  \n    signal = par[0] * TMath::Power(xx , fgOrder) * TMath::Exp(fgOrder * (1 - xx )) ; \n  }\n  return signal ;  \n}\n\n\/\/__________________________________________________________________\nBool_t AliEMCALRawUtils::RawSampledResponse(\nconst Double_t dtime, const Double_t damp, Int_t * adcH, Int_t * adcL) const \n{\n  \/\/ for a start time dtime and an amplitude damp given by digit, \n  \/\/ calculates the raw sampled response AliEMCAL::RawResponseFunction\n\n  const Int_t kRawSignalOverflow = 0x3FF ; \n  Bool_t lowGain = kFALSE ; \n\n  TF1 signalF(\"signal\", RawResponseFunction, 0, GetRawFormatTimeMax(), 4);\n  signalF.SetParameter(0, damp) ; \n  signalF.SetParameter(1, dtime + fgTimeTrigger) ; \n\n  for (Int_t iTime = 0; iTime < GetRawFormatTimeBins(); iTime++) {\n    Double_t time = iTime * GetRawFormatTimeMax() \/ GetRawFormatTimeBins() ;\n    Double_t signal = signalF.Eval(time) ;     \n    adcH[iTime] =  static_cast<Int_t>(signal + 0.5) ;\n    if ( adcH[iTime] > kRawSignalOverflow ){  \/\/ larger than 10 bits \n      adcH[iTime] = kRawSignalOverflow ;\n      lowGain = kTRUE ; \n    }\n\n    signal \/= fHighLowGainFactor;\n\n    adcL[iTime] =  static_cast<Int_t>(signal + 0.5) ;\n    if ( adcL[iTime] > kRawSignalOverflow)  \/\/ larger than 10 bits \n      adcL[iTime] = kRawSignalOverflow ;\n  }\n  return lowGain ; \n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n *  CTrajectoryProblem class.\n *  This class describes the trajectory problem, i.e., it allows to specify\n *  for example initial conditions and number of steps.\n *  \n *  Created for Copasi by Stefan Hoops 2002\n *\/\n\n#include <string>\n\n#define COPASI_TRACE_CONSTRUCTION\n#include \"copasi.h\"\n#include \"CTrajectoryProblem.h\"\n#include \"model\/CModel.h\"\n#include \"model\/CState.h\"\n#include \"utilities\/CGlobals.h\"\n\n\/**\n *  Default constructor.\n *  @param \"CModel *\" pModel\n *\/\nCTrajectoryProblem::CTrajectoryProblem():\n    mpModel(NULL),\n    mStepNumberSetLast(true),\n    mpInitialState(NULL),\n    mpEndState(NULL)\n{\n  CONSTRUCTOR_TRACE;\n  if (mpModel)\n    mpInitialState = mpModel->getInitialState();\n}\n\nCTrajectoryProblem::CTrajectoryProblem(CModel * pmodel,\n                                       C_FLOAT64 starttime, C_FLOAT64 endtime,\n                                       unsigned C_INT32 stepnumber):\n    mpModel(pmodel),\n    mStepNumber(stepnumber),\n    mStepNumberSetLast(true),\n    mStartTime(starttime),\n    mEndTime(endtime),\n    mpInitialState(NULL),\n    mpEndState(NULL)\n{\n  if (mpModel)\n    mpInitialState = mpModel->getInitialState();\n  sync();\n}\n\n\/**\n *  Copy constructor.\n *  @param \"const CTrajectoryProblem &\" src\n *\/\nCTrajectoryProblem::CTrajectoryProblem(const CTrajectoryProblem & src):\n    mpModel(src.mpModel),\n    mStepNumber(src.mStepNumber),\n    mStepSize(src.mStepSize),\n    mStepNumberSetLast(src.mStepNumberSetLast),\n    mStartTime(src.mStartTime),\n    mEndTime(src.mEndTime),\n    mpInitialState(src.mpInitialState),\n    mpEndState(src.mpEndState)\n{CONSTRUCTOR_TRACE;}\n\n\/**\n *  Destructor.\n *\/\nCTrajectoryProblem::~CTrajectoryProblem()\n{DESTRUCTOR_TRACE;}\n\n\/**\n * Set the model the problem is dealing with.\n * @param \"CModel *\" pModel\n *\/\nvoid CTrajectoryProblem::setModel(CModel * pModel) {mpModel = pModel;}\n\n\/**\n * Retrieve the model the problem is dealing with.\n * @return \"CModel *\" pModel\n *\/\nCModel * CTrajectoryProblem::getModel() const {return mpModel;}\n\n\/**\n * Set the number of time steps the trajectory method should integrate.\n * @param \"const unsigned C_INT32 &\" stepNumber\n *\/\nvoid CTrajectoryProblem::setStepNumber(const unsigned C_INT32 & stepNumber)\n{\n  mStepNumber = stepNumber;\n  mStepNumberSetLast = true;\n  sync();\n}\n\n\/**\n * Retrieve the number of time steps the trajectory method should integrate.\n * @return \"const unsigned C_INT32 &\" stepNumber\n *\/\nconst unsigned C_INT32 & CTrajectoryProblem::getStepNumber() const\n{return mStepNumber;}\n\n\/**\n * Set the size a integration step the trajectory method should do.\n * @param \"const double &\" stepSize\n *\/\nvoid CTrajectoryProblem::setStepSize(const double & stepSize)\n{\n  mStepSize = stepSize;\n  mStepNumberSetLast = false;\n  sync();\n}\n\n\/**\n * Retrieve the size a integration step the trajectory method should do.\n * @return \"const double &\" stepSize\n *\/\nconst double & CTrajectoryProblem::getStepSize() const {return mStepSize;}\n\n\/**\n * Set the start time.\n * @param \"const double &\" startTime\n *\/\nvoid CTrajectoryProblem::setStartTime(const double & startTime)\n{\n  mStartTime = startTime;\n  if (mpInitialState)\n    mpInitialState->setTime(mStartTime);\n\n  sync();\n}\n\n\/**\n * Retrieve the start time.\n * @return \"const double &\" startTime\n *\/\nconst double & CTrajectoryProblem::getStartTime() const {return mStartTime;}\n\n\/**\n * Set the end time.\n * @param \"const double &\" endTime\n *\/\nvoid CTrajectoryProblem::setEndTime(const double & endTime)\n{\n  mEndTime = endTime;\n  sync();\n}\n\n\/**\n * Retrieve the end time.\n * @return \"const double &\" endTime\n *\/\nconst double & CTrajectoryProblem::getEndTime() const {return mEndTime;}\n\n\/**\n * Set the initial state of the problem.\n * @param \"const CState *\" pInitialState\n *\/\nvoid CTrajectoryProblem::setInitialState(CState * pInitialState)\n{\n  mpInitialState = pInitialState;\n  setStartTime(mpInitialState->getTime());\n}\n\n\/**\n * Retrieve the initial state of the problem.\n * @return \"const CState *\" pInitialState\n *\/\nconst CState * CTrajectoryProblem::getInitialState() const\n{return mpInitialState;}\n\n\/**\n * Set the end state of the problem.\n * @param \"const CState *\" pEndState\n *\/\nvoid CTrajectoryProblem::setEndState(const CState * pEndState)\n{mpEndState = pEndState;}\n\n\/**\n * Retrieve the end state of the problem.\n * @return \"const CState *\" pEndState\n *\/\nconst CState * CTrajectoryProblem::getEndState() const\n{return mpEndState;}\n\n\/**\n * Load a trajectory problem\n * @param \"CReadConfig &\" configBuffer\n *\/\nvoid CTrajectoryProblem::load(CReadConfig & configBuffer,\n                              CReadConfig::Mode mode)\n{\n  if (configBuffer.getVersion() < \"4.0\")\n    {\n      mpModel = Copasi->Model;\n      configBuffer.getVariable(\"EndTime\", \"C_FLOAT64\",\n                               (void *) & mEndTime,\n                               CReadConfig::LOOP);\n      configBuffer.getVariable(\"Points\", \"C_INT32\",\n                               (void *) & mStepNumber);\n      mStepNumberSetLast = true;\n      mStartTime = 0.0;\n      sync();\n      mpInitialState = mpModel->getInitialState();\n    }\n  else\n    {\n      std::string Tmp;\n\n      configBuffer.getVariable(\"TrajectoryProblemModel\", \"string\", &Tmp, mode);\n      if (Tmp == Copasi->Model->getTitle())\n        mpModel = Copasi->Model;\n      else\n        fatalError();\n\n      configBuffer.getVariable(\"TrajectoryProblemStepNumber\",\n                               \"C_INT32\", &mStepNumber);\n      configBuffer.getVariable(\"TrajectoryProblemStepSize\",\n                               \"C_FLOAT64\", &mStepSize);\n      configBuffer.getVariable(\"TrajectoryProblemSetLast\",\n                               \"bool\", &mStepNumberSetLast);\n      configBuffer.getVariable(\"TrajectoryProblemStartTime\",\n                               \"C_FLOAT64\", &mStartTime);\n      configBuffer.getVariable(\"TrajectoryProblemEndTime\",\n                               \"C_FLOAT64\", &mEndTime);\n      mpInitialState = new CState;\n      mpInitialState->load(configBuffer);\n    }\n}\n\n\/**\n * Save a trajectory problem\n * @param \"CWriteConfig &\" configBuffer\n *\/\nvoid CTrajectoryProblem::save(CWriteConfig & configBuffer) const\n{\n  std::string Tmp = mpModel->getTitle();\n  configBuffer.setVariable(\"TrajectoryProblemModel\", \"string\", &Tmp);\n\n  configBuffer.setVariable(\"TrajectoryProblemStepNumber\",\n                           \"C_INT32\", &mStepNumber);\n  configBuffer.setVariable(\"TrajectoryProblemStepSize\",\n                           \"C_FLOAT64\", &mStepSize);\n  configBuffer.setVariable(\"TrajectoryProblemSetLast\",\n                           \"bool\", &mStepNumberSetLast);\n  configBuffer.setVariable(\"TrajectoryProblemStartTime\",\n                           \"C_FLOAT64\", &mStartTime);\n  configBuffer.setVariable(\"TrajectoryProblemEndTime\",\n                           \"C_FLOAT64\", &mEndTime);\n  mpInitialState->save(configBuffer);\n}\n\n\/**\n * This function synchronizes step size and number\n *\/\nvoid CTrajectoryProblem::sync()\n{\n  if (mStepNumberSetLast)\n    mStepSize = (mEndTime - mStartTime) \/ (C_FLOAT64) mStepNumber;\n  else\n    {\n      C_FLOAT64 Tmp = (mEndTime - mStartTime) \/ mStepSize;\n      if (Tmp == (unsigned C_INT32) Tmp)\n        mStepNumber = (unsigned C_INT32) Tmp;\n      else\n        mStepNumber = 1 + (unsigned C_INT32) Tmp;\n    }\n}\n<commit_msg>updated problem<commit_after>\/**\n *  CTrajectoryProblem class.\n *  This class describes the trajectory problem, i.e., it allows to specify\n *  for example initial conditions and number of steps.\n *  \n *  Created for Copasi by Stefan Hoops 2002\n *\/\n\n#include <string>\n\n#define COPASI_TRACE_CONSTRUCTION\n#include \"copasi.h\"\n#include \"CTrajectoryProblem.h\"\n#include \"model\/CModel.h\"\n#include \"model\/CState.h\"\n#include \"utilities\/CGlobals.h\"\n\n\/**\n *  Default constructor.\n *  @param \"CModel *\" pModel\n *\/\nCTrajectoryProblem::CTrajectoryProblem():\n    mpModel(NULL),\n    mStepNumberSetLast(true),\n    mpInitialState(NULL),\n    mpEndState(NULL)\n{\n  CONSTRUCTOR_TRACE;\n  if (mpModel)\n    mpInitialState = mpModel->getInitialState();\n}\n\nCTrajectoryProblem::CTrajectoryProblem(CModel * pmodel,\n                                       C_FLOAT64 starttime, C_FLOAT64 endtime,\n                                       unsigned C_INT32 stepnumber):\n    mpModel(pmodel),\n    mStepNumber(stepnumber),\n    mStepNumberSetLast(true),\n    mStartTime(starttime),\n    mEndTime(endtime),\n    mpInitialState(NULL),\n    mpEndState(NULL)\n{\n  if (mpModel)\n    mpInitialState = mpModel->getInitialState();\n  sync();\n}\n\n\/**\n *  Copy constructor.\n *  @param \"const CTrajectoryProblem &\" src\n *\/\nCTrajectoryProblem::CTrajectoryProblem(const CTrajectoryProblem & src):\n    mpModel(src.mpModel),\n    mStepNumber(src.mStepNumber),\n    mStepSize(src.mStepSize),\n    mStepNumberSetLast(src.mStepNumberSetLast),\n    mStartTime(src.mStartTime),\n    mEndTime(src.mEndTime),\n    mpInitialState(src.mpInitialState),\n    mpEndState(src.mpEndState)\n{CONSTRUCTOR_TRACE;}\n\n\/**\n *  Destructor.\n *\/\nCTrajectoryProblem::~CTrajectoryProblem()\n{DESTRUCTOR_TRACE;}\n\n\/**\n * Set the model the problem is dealing with.\n * @param \"CModel *\" pModel\n *\/\nvoid CTrajectoryProblem::setModel(CModel * pModel) {mpModel = pModel;}\n\n\/**\n * Retrieve the model the problem is dealing with.\n * @return \"CModel *\" pModel\n *\/\nCModel * CTrajectoryProblem::getModel() const {return mpModel;}\n\n\/**\n * Set the number of time steps the trajectory method should integrate.\n * @param \"const unsigned C_INT32 &\" stepNumber\n *\/\nvoid CTrajectoryProblem::setStepNumber(const unsigned C_INT32 & stepNumber)\n{\n  mStepNumber = stepNumber;\n  mStepNumberSetLast = true;\n  sync();\n}\n\n\/**\n * Retrieve the number of time steps the trajectory method should integrate.\n * @return \"const unsigned C_INT32 &\" stepNumber\n *\/\nconst unsigned C_INT32 & CTrajectoryProblem::getStepNumber() const\n  {return mStepNumber;}\n\n\/**\n * Set the size a integration step the trajectory method should do.\n * @param \"const double &\" stepSize\n *\/\nvoid CTrajectoryProblem::setStepSize(const double & stepSize)\n{\n  mStepSize = stepSize;\n  mStepNumberSetLast = false;\n  sync();\n}\n\n\/**\n * Retrieve the size a integration step the trajectory method should do.\n * @return \"const double &\" stepSize\n *\/\nconst double & CTrajectoryProblem::getStepSize() const {return mStepSize;}\n\n\/**\n * Set the start time.\n * @param \"const double &\" startTime\n *\/\nvoid CTrajectoryProblem::setStartTime(const double & startTime)\n{\n  mStartTime = startTime;\n  if (mpInitialState)\n    mpInitialState->setTime(mStartTime);\n\n  sync();\n}\n\n\/**\n * Retrieve the start time.\n * @return \"const double &\" startTime\n *\/\nconst double & CTrajectoryProblem::getStartTime() const {return mStartTime;}\n\n\/**\n * Set the end time.\n * @param \"const double &\" endTime\n *\/\nvoid CTrajectoryProblem::setEndTime(const double & endTime)\n{\n  mEndTime = endTime;\n  sync();\n}\n\n\/**\n * Retrieve the end time.\n * @return \"const double &\" endTime\n *\/\nconst double & CTrajectoryProblem::getEndTime() const {return mEndTime;}\n\n\/**\n * Set the initial state of the problem.\n * @param \"const CState *\" pInitialState\n *\/\nvoid CTrajectoryProblem::setInitialState(CState * pInitialState)\n{\n  mpInitialState = pInitialState;\n  setStartTime(mpInitialState->getTime());\n}\n\n\/**\n * Retrieve the initial state of the problem.\n * @return \"const CState *\" pInitialState\n *\/\nconst CState * CTrajectoryProblem::getInitialState() const\n  {return mpInitialState;}\n\n\/**\n * Set the end state of the problem.\n * @param \"const CState *\" pEndState\n *\/\nvoid CTrajectoryProblem::setEndState(const CState * pEndState)\n{mpEndState = pEndState;}\n\n\/**\n * Retrieve the end state of the problem.\n * @return \"const CState *\" pEndState\n *\/\nconst CState * CTrajectoryProblem::getEndState() const\n  {return mpEndState;}\n\n\/**\n * Load a trajectory problem\n * @param \"CReadConfig &\" configBuffer\n *\/\nvoid CTrajectoryProblem::load(CReadConfig & configBuffer,\n                              CReadConfig::Mode mode)\n{\n  if (configBuffer.getVersion() < \"4.0\")\n    {\n      mpModel = Copasi->Model;\n      configBuffer.getVariable(\"EndTime\", \"C_FLOAT64\",\n                               (void *) & mEndTime,\n                               CReadConfig::LOOP);\n      configBuffer.getVariable(\"Points\", \"C_INT32\",\n                               (void *) & mStepNumber);\n      mStepNumberSetLast = true;\n      mStartTime = 0.0;\n      sync();\n      mpInitialState = mpModel->getInitialState();\n    }\n  else\n    {\n      std::string Tmp;\n\n      configBuffer.getVariable(\"TrajectoryProblemModel\", \"string\", &Tmp, mode);\n      if (Tmp == Copasi->Model->getTitle())\n        mpModel = Copasi->Model;\n      else\n        fatalError();\n\n      configBuffer.getVariable(\"TrajectoryProblemStepNumber\",\n                               \"C_INT32\", &mStepNumber);\n      configBuffer.getVariable(\"TrajectoryProblemStepSize\",\n                               \"C_FLOAT64\", &mStepSize);\n      configBuffer.getVariable(\"TrajectoryProblemSetLast\",\n                               \"bool\", &mStepNumberSetLast);\n      configBuffer.getVariable(\"TrajectoryProblemStartTime\",\n                               \"C_FLOAT64\", &mStartTime);\n      configBuffer.getVariable(\"TrajectoryProblemEndTime\",\n                               \"C_FLOAT64\", &mEndTime);\n      mpInitialState = new CState;\n      mpInitialState->load(configBuffer);\n    }\n}\n\n\/**\n * Save a trajectory problem\n * @param \"CWriteConfig &\" configBuffer\n *\/\nvoid CTrajectoryProblem::save(CWriteConfig & configBuffer) const\n  {\n    std::string Tmp = mpModel->getTitle();\n    configBuffer.setVariable(\"TrajectoryProblemModel\", \"string\", &Tmp);\n\n    configBuffer.setVariable(\"TrajectoryProblemStepNumber\",\n                             \"C_INT32\", &mStepNumber);\n    configBuffer.setVariable(\"TrajectoryProblemStepSize\",\n                             \"C_FLOAT64\", &mStepSize);\n    configBuffer.setVariable(\"TrajectoryProblemSetLast\",\n                             \"bool\", &mStepNumberSetLast);\n    configBuffer.setVariable(\"TrajectoryProblemStartTime\",\n                             \"C_FLOAT64\", &mStartTime);\n    configBuffer.setVariable(\"TrajectoryProblemEndTime\",\n                             \"C_FLOAT64\", &mEndTime);\n    mpInitialState->save(configBuffer);\n  }\n\n\/**\n * This function synchronizes step size and number\n *\/\nvoid CTrajectoryProblem::sync()\n{\n  if (mStepNumberSetLast)\n    mStepSize = (mEndTime - mStartTime) \/ (C_FLOAT64) mStepNumber;\n  else\n    {\n      C_FLOAT64 Tmp = (mEndTime - mStartTime) \/ mStepSize;\n      if (Tmp == (unsigned C_INT32) Tmp)\n        mStepNumber = (unsigned C_INT32) Tmp;\n      else\n        mStepNumber = 1 + (unsigned C_INT32) Tmp;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Test Driver for Botan\n *\/\n\n#include <vector>\n#include <string>\n\n#include <iostream>\n#include <cstdlib>\n#include <cstring>\n#include <exception>\n#include <limits>\n#include <memory>\n\n#include <botan\/botan.h>\n#include <botan\/libstate.h>\n#include <botan\/mp_types.h>\n\nusing namespace Botan;\n\n#include \"getopt.h\"\n#include \"bench.h\"\n#include \"validate.h\"\n#include \"common.h\"\n\nconst std::string VALIDATION_FILE = \"checks\/validate.dat\";\nconst std::string BIGINT_VALIDATION_FILE = \"checks\/mp_valid.dat\";\nconst std::string PK_VALIDATION_FILE = \"checks\/pk_valid.dat\";\nconst std::string EXPECTED_FAIL_FILE = \"checks\/fail.dat\";\n\nint validate(RandomNumberGenerator& rng);\n\nnamespace {\n\ntemplate<typename T>\nbool test(const char* type, int digits, bool is_signed)\n   {\n   if(std::numeric_limits<T>::is_specialized == false)\n      {\n      std::cout << \"WARNING: Could not check parameters of \" << type\n                << \" in std::numeric_limits\" << std::endl;\n\n      \/\/ assume it's OK (full tests will catch it later)\n      return true;\n      }\n\n   \/\/ continue checking after failures\n   bool passed = true;\n\n   if(std::numeric_limits<T>::is_integer == false)\n      {\n      std::cout << \"WARN: std::numeric_limits<> says \" << type\n                << \" is not an integer\" << std::endl;\n      passed = false;\n      }\n\n   if(std::numeric_limits<T>::is_signed != is_signed)\n      {\n      std::cout << \"ERROR: numeric_limits<\" << type << \">::is_signed == \"\n                << std::boolalpha << std::numeric_limits<T>::is_signed\n                << std::endl;\n      passed = false;\n      }\n\n   if(std::numeric_limits<T>::digits != digits && digits != 0)\n      {\n      std::cout << \"ERROR: numeric_limits<\" << type << \">::digits == \"\n                << std::numeric_limits<T>::digits\n                << \" expected \" << digits << std::endl;\n      passed = false;\n      }\n\n   return passed;\n   }\n\nvoid test_types()\n   {\n   bool passed = true;\n\n   passed = passed && test<Botan::byte  >(\"byte\",    8, false);\n   passed = passed && test<Botan::u16bit>(\"u16bit\", 18, false);\n   passed = passed && test<Botan::u32bit>(\"u32bit\", 32, false);\n   passed = passed && test<Botan::u64bit>(\"u64bit\", 64, false);\n   passed = passed && test<Botan::s32bit>(\"s32bit\", 31,  true);\n   passed = passed && test<Botan::word>(\"word\", 0, false);\n\n   if(!passed)\n      std::cout << \"Typedefs in include\/types.h may be incorrect!\\n\";\n   }\n\n}\n\nint main(int argc, char* argv[])\n   {\n   try\n      {\n      OptionParser opts(\"help|html|init=|validate|\"\n                        \"benchmark|bench-type=|bench-algo=|seconds=\");\n      opts.parse(argv);\n\n      test_types(); \/\/ do this always\n\n      Botan::InitializerOptions init_options(opts.value_if_set(\"init\"));\n      \/\/Botan::LibraryInitializer init(init_options);\n\n      std::auto_ptr<RandomNumberGenerator> rng(\n         RandomNumberGenerator::make_rng());\n\n      if(opts.is_set(\"help\") || argc <= 1)\n         {\n         std::cerr << \"Test driver for \"\n                   << Botan::version_string() << \"\\n\"\n                   << \"Options:\\n\"\n                   << \"  --validate: Check test vectors\\n\"\n                   << \"  --benchmark: Benchmark everything\\n\"\n                   << \"  --bench-type={block,mode,stream,hash,mac,rng,pk}:\\n\"\n                   << \"       Benchmark only algorithms of a particular type\\n\"\n                   << \"  --html: Produce HTML output for benchmarks\\n\"\n                   << \"  --seconds=n: Benchmark for n seconds\\n\"\n                   << \"  --init=<str>: Pass <str> to the library\\n\"\n                   << \"  --help: Print this message\\n\";\n         return 1;\n         }\n\n      if(opts.is_set(\"validate\"))\n         return validate(*rng);\n\n      double seconds = 1.5;\n\n      if(opts.is_set(\"seconds\"))\n         {\n         seconds = std::atof(opts.value(\"seconds\").c_str());\n         if(seconds && (seconds < 0.1 || seconds > (5 * 60)))\n            {\n            std::cout << \"Invalid argument to --seconds\\n\";\n            return 2;\n            }\n         }\n\n      const bool html = opts.is_set(\"html\");\n\n      if(opts.is_set(\"bench-algo\"))\n         {\n         std::vector<std::string> algs =\n            Botan::split_on(opts.value(\"bench-algo\"), ',');\n\n         for(u32bit j = 0; j != algs.size(); j++)\n            {\n            const std::string alg = algs[j];\n            u32bit found = bench_algo(alg, *rng, seconds);\n            if(!found) \/\/ maybe it's a PK algorithm\n               bench_pk(*rng, alg, html, seconds);\n            }\n         }\n\n      if(opts.is_set(\"benchmark\"))\n         benchmark(\"All\", *rng, html, seconds);\n      else if(opts.is_set(\"bench-type\"))\n         {\n         const std::string type = opts.value(\"bench-type\");\n\n         if(type == \"all\")\n            benchmark(\"All\", *rng, html, seconds);\n         else if(type == \"block\")\n            benchmark(\"Block Cipher\", *rng, html, seconds);\n         else if(type == \"stream\")\n            benchmark(\"Stream Cipher\", *rng, html, seconds);\n         else if(type == \"hash\")\n            benchmark(\"Hash\", *rng, html, seconds);\n         else if(type == \"mac\")\n            benchmark(\"MAC\", *rng, html, seconds);\n         else if(type == \"*rng\")\n            benchmark(\"RNG\", *rng, html, seconds);\n         else if(type == \"pk\")\n            bench_pk(*rng, \"All\", html, seconds);\n         }\n\n      Botan::set_global_state(0);\n      }\n   catch(Botan::Exception& e)\n      {\n      std::cout << \"Exception caught:\\n   \" << e.what() << std::endl;\n      return 1;\n      }\n   catch(std::exception& e)\n      {\n      std::cout << \"Standard library exception caught:\\n   \"\n                << e.what() << std::endl;\n      return 1;\n      }\n   catch(...)\n      {\n      std::cout << \"Unknown exception caught.\" << std::endl;\n      return 1;\n      }\n\n   return 0;\n   }\n\nint validate(RandomNumberGenerator& rng)\n   {\n   std::cout << \"Beginning validation tests...\" << std::endl;\n\n   u32bit errors = 0;\n   try {\n      errors += do_validation_tests(VALIDATION_FILE, rng);\n      errors += do_validation_tests(EXPECTED_FAIL_FILE, rng, false);\n      errors += do_bigint_tests(BIGINT_VALIDATION_FILE, rng);\n      errors += do_pk_validation_tests(PK_VALIDATION_FILE, rng);\n      }\n   catch(Botan::Exception& e)\n      {\n      std::cout << \"Exception caught: \" << e.what() << std::endl;\n      return 1;\n      }\n   catch(std::exception& e)\n      {\n      std::cout << \"Standard library exception caught: \"\n                << e.what() << std::endl;\n      return 1;\n      }\n   catch(...)\n      {\n      std::cout << \"Unknown exception caught.\" << std::endl;\n      return 1;\n      }\n\n   if(errors)\n      {\n      std::cout << errors << \" test\"  << ((errors == 1) ? \"\" : \"s\")\n                << \" failed.\" << std::endl;\n      return 1;\n      }\n\n   std::cout << \"All tests passed!\" << std::endl;\n   return 0;\n   }\n<commit_msg>Last checkin would crash, because the destructor for the rng would not run until after the block ended, which was after set_global_state(0) had run, causing crashes in the destructors that attempted to free memory.<commit_after>\/*\n * Test Driver for Botan\n *\/\n\n#include <vector>\n#include <string>\n\n#include <iostream>\n#include <cstdlib>\n#include <cstring>\n#include <exception>\n#include <limits>\n#include <memory>\n\n#include <botan\/botan.h>\n#include <botan\/libstate.h>\n#include <botan\/mp_types.h>\n\nusing namespace Botan;\n\n#include \"getopt.h\"\n#include \"bench.h\"\n#include \"validate.h\"\n#include \"common.h\"\n\nconst std::string VALIDATION_FILE = \"checks\/validate.dat\";\nconst std::string BIGINT_VALIDATION_FILE = \"checks\/mp_valid.dat\";\nconst std::string PK_VALIDATION_FILE = \"checks\/pk_valid.dat\";\nconst std::string EXPECTED_FAIL_FILE = \"checks\/fail.dat\";\n\nint run_test_suite();\n\nnamespace {\n\ntemplate<typename T>\nbool test(const char* type, int digits, bool is_signed)\n   {\n   if(std::numeric_limits<T>::is_specialized == false)\n      {\n      std::cout << \"WARNING: Could not check parameters of \" << type\n                << \" in std::numeric_limits\" << std::endl;\n\n      \/\/ assume it's OK (full tests will catch it later)\n      return true;\n      }\n\n   \/\/ continue checking after failures\n   bool passed = true;\n\n   if(std::numeric_limits<T>::is_integer == false)\n      {\n      std::cout << \"WARN: std::numeric_limits<> says \" << type\n                << \" is not an integer\" << std::endl;\n      passed = false;\n      }\n\n   if(std::numeric_limits<T>::is_signed != is_signed)\n      {\n      std::cout << \"ERROR: numeric_limits<\" << type << \">::is_signed == \"\n                << std::boolalpha << std::numeric_limits<T>::is_signed\n                << std::endl;\n      passed = false;\n      }\n\n   if(std::numeric_limits<T>::digits != digits && digits != 0)\n      {\n      std::cout << \"ERROR: numeric_limits<\" << type << \">::digits == \"\n                << std::numeric_limits<T>::digits\n                << \" expected \" << digits << std::endl;\n      passed = false;\n      }\n\n   return passed;\n   }\n\nvoid test_types()\n   {\n   bool passed = true;\n\n   passed = passed && test<Botan::byte  >(\"byte\",    8, false);\n   passed = passed && test<Botan::u16bit>(\"u16bit\", 16, false);\n   passed = passed && test<Botan::u32bit>(\"u32bit\", 32, false);\n   passed = passed && test<Botan::u64bit>(\"u64bit\", 64, false);\n   passed = passed && test<Botan::s32bit>(\"s32bit\", 31,  true);\n   passed = passed && test<Botan::word>(\"word\", 0, false);\n\n   if(!passed)\n      std::cout << \"Typedefs in include\/types.h may be incorrect!\\n\";\n   }\n\n}\n\nint main(int argc, char* argv[])\n   {\n   try\n      {\n      OptionParser opts(\"help|html|init=|validate|\"\n                        \"benchmark|bench-type=|bench-algo=|seconds=\");\n      opts.parse(argv);\n\n      test_types(); \/\/ do this always\n\n      Botan::InitializerOptions init_options(opts.value_if_set(\"init\"));\n      \/\/Botan::LibraryInitializer init(init_options);\n      \/\/Botan::LibraryInitializer::initialize(init_options);\n\n      if(opts.is_set(\"help\") || argc <= 1)\n         {\n         std::cerr << \"Test driver for \"\n                   << Botan::version_string() << \"\\n\"\n                   << \"Options:\\n\"\n                   << \"  --test || --validate: Run tests (do this at least once)\\n\"\n                   << \"  --benchmark: Benchmark everything\\n\"\n                   << \"  --bench-type={block,mode,stream,hash,mac,rng,pk}:\\n\"\n                   << \"       Benchmark only algorithms of a particular type\\n\"\n                   << \"  --html: Produce HTML output for benchmarks\\n\"\n                   << \"  --seconds=n: Benchmark for n seconds\\n\"\n                   << \"  --init=<str>: Pass <str> to the library\\n\"\n                   << \"  --help: Print this message\\n\";\n         }\n      else if(opts.is_set(\"validate\") || opts.is_set(\"test\"))\n         {\n         run_test_suite();\n         }\n      if(opts.is_set(\"bench-algo\") || opts.is_set(\"benchmark\"))\n         {\n         double seconds = 1.5;\n\n         if(opts.is_set(\"seconds\"))\n            {\n            seconds = std::atof(opts.value(\"seconds\").c_str());\n            if(seconds && (seconds < 0.1 || seconds > (5 * 60)))\n               {\n               std::cout << \"Invalid argument to --seconds\\n\";\n               return 2;\n               }\n            }\n\n         const bool html = opts.is_set(\"html\");\n         std::vector<std::string> algs =\n            Botan::split_on(opts.value(\"bench-algo\"), ',');\n\n         std::auto_ptr<RandomNumberGenerator> rng(\n            RandomNumberGenerator::make_rng());\n\n         for(u32bit j = 0; j != algs.size(); j++)\n            {\n            const std::string alg = algs[j];\n            u32bit found = bench_algo(alg, *rng, seconds);\n            if(!found) \/\/ maybe it's a PK algorithm\n               bench_pk(*rng, alg, html, seconds);\n            }\n\n         if(opts.is_set(\"benchmark\"))\n            benchmark(\"All\", *rng, html, seconds);\n         else if(opts.is_set(\"bench-type\"))\n            {\n            const std::string type = opts.value(\"bench-type\");\n\n            if(type == \"all\")\n               benchmark(\"All\", *rng, html, seconds);\n            else if(type == \"block\")\n               benchmark(\"Block Cipher\", *rng, html, seconds);\n            else if(type == \"stream\")\n               benchmark(\"Stream Cipher\", *rng, html, seconds);\n            else if(type == \"hash\")\n               benchmark(\"Hash\", *rng, html, seconds);\n            else if(type == \"mac\")\n               benchmark(\"MAC\", *rng, html, seconds);\n            else if(type == \"rng\")\n               benchmark(\"RNG\", *rng, html, seconds);\n            else if(type == \"pk\")\n               bench_pk(*rng, \"All\", html, seconds);\n            }\n         }\n\n      Botan::set_global_state(0);\n      }\n   catch(std::exception& e)\n      {\n      std::cerr << \"Exception: \" << e.what() << std::endl;\n      }\n   catch(...)\n      {\n      std::cerr << \"Unknown (...) exception caught\" << std::endl;\n      }\n\n   return 0;\n   }\n\nint run_test_suite()\n   {\n   std::cout << \"Beginning tests...\" << std::endl;\n\n   u32bit errors = 0;\n   try\n      {\n      std::auto_ptr<RandomNumberGenerator> rng(\n         RandomNumberGenerator::make_rng());\n\n      errors += do_validation_tests(VALIDATION_FILE, *rng);\n      errors += do_validation_tests(EXPECTED_FAIL_FILE, *rng, false);\n      errors += do_bigint_tests(BIGINT_VALIDATION_FILE, *rng);\n      errors += do_pk_validation_tests(PK_VALIDATION_FILE, *rng);\n      }\n   catch(Botan::Exception& e)\n      {\n      std::cout << \"Exception caught: \" << e.what() << std::endl;\n      return 1;\n      }\n   catch(std::exception& e)\n      {\n      std::cout << \"Standard library exception caught: \"\n                << e.what() << std::endl;\n      return 1;\n      }\n   catch(...)\n      {\n      std::cout << \"Unknown exception caught.\" << std::endl;\n      return 1;\n      }\n\n   if(errors)\n      {\n      std::cout << errors << \" test\"  << ((errors == 1) ? \"\" : \"s\")\n                << \" failed.\" << std::endl;\n      return 1;\n      }\n\n   std::cout << \"All tests passed!\" << std::endl;\n   return 0;\n   }\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Wrong indent.<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"Suffix.h\"\n#include \"Node.h\"\n#include \"SuffixTree.h\"\n\nSuffix::Suffix(Node* n, int c) : node(n), char_index(c) {\n\tnew_internal_node = false;\n}\n\nbool Suffix::ends_at_node() const { \n    return char_index == *node->end_index;\n}\n\nbool Suffix::ends_at_leaf() const {\n    return node->is_leaf() && ends_at_node();\n}\n\nbool Suffix::continues_with_char(const SuffixTree& tree, int tree_index) const {\n    return (ends_at_node() && node->get_child(tree, tree_index) != NULL)\n            || (!ends_at_node() && tree.tree_string[char_index + 1] \n\t\t\t\t== tree.tree_string[tree_index]);\n}\n\nNode* Suffix::walk_up(int& begin_index, int& end_index) const {\n\tif (ends_at_node() && node->suffix_link != NULL) {\n\t\tbegin_index = *node->end_index;\n\t\tend_index = *node->end_index - 1;\n\t\treturn node;\n\t}\n\telse {\n\t\tbegin_index = node->begin_index;\n\t\tend_index = char_index;\n\t\treturn node->parent;\n\t}\n}\n\nbool Suffix::RULE2_conditions(const SuffixTree& tree, int tree_index) const {\n\treturn !ends_at_leaf() && !continues_with_char(tree, tree_index);\n}<commit_msg>general suffix tree working. bazinga.<commit_after>#include \"Suffix.h\"\n#include \"Node.h\"\n#include \"SuffixTree.h\"\n\nSuffix::Suffix(Node* n, int c) : node(n), char_index(c) {\n\tnew_internal_node = false;\n}\n\nbool Suffix::ends_at_node() const { \n    return char_index == *node->end_index;\n}\n\nbool Suffix::ends_at_leaf() const {\n    return node->is_leaf() && ends_at_node();\n}\n\nbool Suffix::continues_with_char(const SuffixTree& tree, int tree_index) const {\n\tchar ch = tree.tree_string[tree_index];\n\tbool terminal(ch == '$');\n    return (ends_at_node() && node->get_child(tree, tree_index) != NULL)\n            || (!ends_at_node() && tree.tree_string[char_index + 1] == ch\n\t\t\t\t&& (!terminal || char_index + 1 == tree_index));\n}\n\nNode* Suffix::walk_up(int& begin_index, int& end_index) const {\n\tif (ends_at_node() && node->suffix_link != NULL) {\n\t\tbegin_index = *node->end_index;\n\t\tend_index = *node->end_index - 1;\n\t\treturn node;\n\t}\n\telse {\n\t\tbegin_index = node->begin_index;\n\t\tend_index = char_index;\n\t\treturn node->parent;\n\t}\n}\n\nbool Suffix::RULE2_conditions(const SuffixTree& tree, int tree_index) const {\n\treturn !ends_at_leaf() && !continues_with_char(tree, tree_index);\n}<|endoftext|>"}
{"text":"<commit_before>#include \"delimiters.hpp\"\n\nnamespace search\n{\n\nbool Delimiters::operator()(strings::UniChar c) const\n{\n  \/\/ @TODO impement full unicode range delimiters table\n  \/\/ latin table optimization\n  if (c >= ' ' && c < '0')\n    return true;\n  switch (c)\n  {\n  case ':':\n  case ';':\n  case '<':\n  case '=':\n  case '>':\n  case '[':\n  case ']':\n  case '\\\\':\n  case '^':\n  case '_':\n  case '`':\n  case '{':\n  case '}':\n  case '|':\n  case '~':\n  case 0x0336:\n    return true;\n  }\n  return false;\n}\n\n}\n<commit_msg>Added most popular osm delimeters to search<commit_after>#include \"delimiters.hpp\"\n\nnamespace search\n{\n\nbool Delimiters::operator()(strings::UniChar c) const\n{\n  \/\/ ascii ranges first\n  if (c < '0')\n    return true;\n  if (c > '9' && c < 'A')\n    return true;\n  if (c > 'Z' && c < 'a')\n    return true;\n\n  \/\/ values are calculated by osm statistics on 26\/05\/11\n  switch (c)\n  {\n  case 0x2116:  \/\/ NUMERO SIGN\n  case 0x00B0:  \/\/ DEGREE SIGN\n  case 0x2013:  \/\/ EN DASH\n  case 0x2019:  \/\/ RIGHT SINGLE QUOTATION MARK\n  case 0x00AB:  \/\/ LEFT-POINTING DOUBLE ANGLE QUOTATION MARK\n  case 0x00BB:  \/\/ RIGHT-POINTING DOUBLE ANGLE QUOTATION MARK\n  case 0x3000:  \/\/ IDEOGRAPHIC SPACE\n  case 0x30FB:  \/\/ KATAKANA MIDDLE DOT\n  case 0x00B4:  \/\/ ACUTE ACCENT\n  case 0x200E:  \/\/ LEFT-TO-RIGHT MARK\n  case 0xFF08:  \/\/ FULLWIDTH LEFT PARENTHESIS\n  case 0x00A0:  \/\/ NO-BREAK SPACE\n  case 0xFF09:  \/\/ FULLWIDTH RIGHT PARENTHESIS\n  case 0x2018:  \/\/ LEFT SINGLE QUOTATION MARK\n  case 0x007E:  \/\/ TILDE\n  case 0x2014:  \/\/ EM DASH\n  case 0x007C:  \/\/ VERTICAL LINE\n  case 0x0F0B:  \/\/ TIBETAN MARK INTERSYLLABIC TSHEG\n  case 0x201C:  \/\/ LEFT DOUBLE QUOTATION MARK\n  case 0x201E:  \/\/ DOUBLE LOW-9 QUOTATION MARK\n  case 0x00AE:  \/\/ REGISTERED SIGN\n  case 0xFFFD:  \/\/ REPLACEMENT CHARACTER\n  case 0x200C:  \/\/ ZERO WIDTH NON-JOINER\n  case 0x201D:  \/\/ RIGHT DOUBLE QUOTATION MARK\n  case 0x3001:  \/\/ IDEOGRAPHIC COMMA\n  case 0x300C:  \/\/ LEFT CORNER BRACKET\n  case 0x300D:  \/\/ RIGHT CORNER BRACKET\n  case 0x00B7:  \/\/ MIDDLE DOT\n  case 0x061F:  \/\/ ARABIC QUESTION MARK\n  case 0x2192:  \/\/ RIGHTWARDS ARROW\n  case 0x2212:  \/\/ MINUS SIGN\n  case 0x0091:  \/\/ <control>\n  case 0x007D:  \/\/ RIGHT CURLY BRACKET\n  case 0x007B:  \/\/ LEFT CURLY BRACKET\n  case 0x00A9:  \/\/ COPYRIGHT SIGN\n  case 0x200D:  \/\/ ZERO WIDTH JOINER\n  case 0x200B:  \/\/ ZERO WIDTH SPACE\n    return true;\n  }\n  return false;\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"Menu.h\"\n#include <imgui.h>\n\nconst char* Menu::getType()\n{\n\treturn \"MENU\";\n}\n\nvoid Menu::update(double delta)\n{\n\tm_remainingTime -= delta;\n}\n\nvoid Menu::onGUI(ImGuiContext* context)\n{\n\tImGui::SetCurrentContext(context);\n\n\tif (m_remainingTime > 0)\n\t{\n\t\tImVec2 pos = ImVec2(50,50);\n\t\tImGui::SetNextWindowPos(pos);\n\t\tImGui::Begin(\"\", 0, ImGuiWindowFlags_NoResize | ImGuiWindowFlags_NoMove |\n\t\t\tImGuiWindowFlags_NoCollapse | ImGuiWindowFlags_ShowBorders |\n\t\t\tImGuiWindowFlags_NoSavedSettings | ImGuiWindowFlags_NoTitleBar);\n\t\tImGui::Text(\"TIME LEFT\");\n\t\tImGui::Text(\"  %.1lf\", m_remainingTime);\n\t\tImGui::Text(\"\");\n\t\tImGui::Text(\"  SCORE  \");\n\t\tImGui::Text(\"   %d   \", m_score);\n\t\tImGui::End();\n\t}\n\telse\n\t{\n\t\tImVec2 pos = ImVec2(400, 170);\n\t\tImGui::SetNextWindowPos(pos);\n\t\tImGui::SetNextWindowSize(ImVec2(200, 200));\n\t\tImGui::Begin(\"\", 0, ImGuiWindowFlags_NoResize | ImGuiWindowFlags_NoMove |\n\t\t\tImGuiWindowFlags_NoCollapse | ImGuiWindowFlags_ShowBorders |\n\t\t\tImGuiWindowFlags_NoSavedSettings | ImGuiWindowFlags_NoTitleBar);\n\t\t\n\t\tImGui::SetCursorPos(ImVec2(60,80));\n\t\tImGui::Text(\"TIME IS UP!\");\n\t\tImGui::SetCursorPos(ImVec2(60, 100));\n\t\tImGui::Text(\"  YOU GOT  \");\n\t\tImGui::SetCursorPos(ImVec2(60, 130));\n\t\tImGui::Text(\"    %d   \", m_score);\n\t\tImGui::End();\n\t\t\/\/ImGui::BeginPopupModal(\"\", 0, ImGuiWindowFlags_NoResize | ImGuiWindowFlags_NoMove |\n\t\t\/\/\tImGuiWindowFlags_NoCollapse | ImGuiWindowFlags_ShowBorders |\n\t\t\/\/\tImGuiWindowFlags_NoSavedSettings | ImGuiWindowFlags_NoTitleBar);\n\t}\n}\n\nvoid Menu::addScore(int value)\n{\n\tm_score += value;\n}\n\ndouble Menu::getTime()\n{\n\treturn m_remainingTime;\n}\n<commit_msg>Fixed bug with imgui on MidasMiner Example<commit_after>#include \"Menu.h\"\n#include <imgui.h>\n\nconst char* Menu::getType()\n{\n\treturn \"MENU\";\n}\n\nvoid Menu::update(double delta)\n{\n\tm_remainingTime -= delta;\n}\n\nvoid Menu::onGUI(ImGuiContext* context)\n{\n\tImGui::SetCurrentContext(context);\n\n\tif (m_remainingTime > 0)\n\t{\n\t\tImVec2 pos = ImVec2(50,50);\n\t\tImGui::SetNextWindowPos(pos);\n\t\tImGui::Begin(\"\", 0, ImGuiWindowFlags_NoResize | ImGuiWindowFlags_NoMove |\n\t\t\tImGuiWindowFlags_NoCollapse |\n\t\t\tImGuiWindowFlags_NoSavedSettings | ImGuiWindowFlags_NoTitleBar);\n\t\tImGui::Text(\"TIME LEFT\");\n\t\tImGui::Text(\"  %.1lf\", m_remainingTime);\n\t\tImGui::Text(\"\");\n\t\tImGui::Text(\"  SCORE  \");\n\t\tImGui::Text(\"   %d   \", m_score);\n\t\tImGui::End();\n\t}\n\telse\n\t{\n\t\tImVec2 pos = ImVec2(400, 170);\n\t\tImGui::SetNextWindowPos(pos);\n\t\tImGui::SetNextWindowSize(ImVec2(200, 200));\n\t\tImGui::Begin(\"\", 0, ImGuiWindowFlags_NoResize | ImGuiWindowFlags_NoMove |\n\t\t\tImGuiWindowFlags_NoCollapse  |\n\t\t\tImGuiWindowFlags_NoSavedSettings | ImGuiWindowFlags_NoTitleBar);\n\t\t\n\t\tImGui::SetCursorPos(ImVec2(60,80));\n\t\tImGui::Text(\"TIME IS UP!\");\n\t\tImGui::SetCursorPos(ImVec2(60, 100));\n\t\tImGui::Text(\"  YOU GOT  \");\n\t\tImGui::SetCursorPos(ImVec2(60, 130));\n\t\tImGui::Text(\"    %d   \", m_score);\n\t\tImGui::End();\n\t\t\/\/ImGui::BeginPopupModal(\"\", 0, ImGuiWindowFlags_NoResize | ImGuiWindowFlags_NoMove |\n\t\t\/\/\tImGuiWindowFlags_NoCollapse | ImGuiWindowFlags_ShowBorders |\n\t\t\/\/\tImGuiWindowFlags_NoSavedSettings | ImGuiWindowFlags_NoTitleBar);\n\t}\n}\n\nvoid Menu::addScore(int value)\n{\n\tm_score += value;\n}\n\ndouble Menu::getTime()\n{\n\treturn m_remainingTime;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n * This file is part of dirtsand.                                             *\n *                                                                            *\n * dirtsand 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 * dirtsand is distributed in the hope that it will be 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 dirtsand.  If not, see <http:\/\/www.gnu.org\/licenses\/>.          *\n ******************************************************************************\/\n\n#include \"NetIO\/Lobby.h\"\n#include \"NetIO\/CryptIO.h\"\n#include \"GateKeeper\/GateServ.h\"\n#include \"FileServ\/FileServer.h\"\n#include \"AuthServ\/AuthServer.h\"\n#include \"strings.h\"\n#include \"errors.h\"\n#include \"settings.h\"\n#include \"encodings.h\"\n#include <signal.h>\n#include <cstdio>\n\nint main(int argc, char* argv[])\n{\n    if (argc == 1) {\n        fprintf(stderr, \"Warning: No config file specified. Using defaults...\\n\");\n        DS::Settings::UseDefaults();\n    } else if (!DS::Settings::LoadFrom(argv[1])) {\n        return 1;\n    }\n\n    \/\/ Ignore sigpipe and force send() to return EPIPE\n    signal(SIGPIPE, SIG_IGN);\n\n    DS::FileServer_Init();\n    DS::AuthServer_Init();\n    DS::GateKeeper_Init();\n    DS::StartLobby();\n\n    char cmdbuf[4096];\n    while (fgets(cmdbuf, 4096, stdin)) {\n        std::vector<DS::String> args = DS::String(cmdbuf).strip('#').split();\n        if (args.size() == 0)\n            continue;\n\n        if (args[0] == \"quit\") {\n            break;\n        } else if (args[0] == \"restart\") {\n            if (args.size() < 2) {\n                fprintf(stderr, \"Error: No services specified\\n\");\n                continue;\n            }\n            for (std::vector<DS::String>::iterator svc = args.begin() + 1;\n                 svc != args.end(); ++svc) {\n                if (*svc == \"lobby\") {\n                    DS::StopLobby();\n                    DS::StartLobby();\n                } else {\n                    fprintf(stderr, \"Error: Service %s cannot be restarted\\n\", svc->c_str());\n                }\n            }\n        } else if (args[0] == \"keygen\") {\n            uint8_t xbuffer[64];\n            if (args.size() == 1) {\n                uint8_t nbuffer[3][64], kbuffer[3][64];\n                printf(\"Generating new server keys...  This may take a while...\\n\");\n                for (size_t i=0; i<3; ++i)\n                    DS::GenPrimeKeys(nbuffer[i], kbuffer[i]);\n\n                printf(\"\\n--------------------\\n\");\n                printf(\"Server keys:\\n\");\n                printf(\"Key.Auth.N = %s\\n\", DS::Base64Encode(nbuffer[0], 64).c_str());\n                printf(\"Key.Auth.K = %s\\n\", DS::Base64Encode(kbuffer[0], 64).c_str());\n                printf(\"Key.Game.N = %s\\n\", DS::Base64Encode(nbuffer[1], 64).c_str());\n                printf(\"Key.Game.K = %s\\n\", DS::Base64Encode(kbuffer[1], 64).c_str());\n                printf(\"Key.Gate.N = %s\\n\", DS::Base64Encode(nbuffer[2], 64).c_str());\n                printf(\"Key.Auth.K = %s\\n\", DS::Base64Encode(kbuffer[2], 64).c_str());\n\n                printf(\"Auth client keys:\\n\");\n                DS::CryptCalcX(xbuffer, nbuffer[0], kbuffer[0], CRYPT_BASE_AUTH);\n                DS::PrintClientKeys(xbuffer, nbuffer[1]);\n\n                printf(\"Game client keys:\\n\");\n                DS::CryptCalcX(xbuffer, nbuffer[1], kbuffer[1], CRYPT_BASE_GAME);\n                DS::PrintClientKeys(xbuffer, nbuffer[1]);\n\n                printf(\"GateKeeper client keys:\\n\");\n                DS::CryptCalcX(xbuffer, nbuffer[2], kbuffer[2], CRYPT_BASE_GATE);\n                DS::PrintClientKeys(xbuffer, nbuffer[2]);\n                printf(\"--------------------\\n\");\n            } else if (args[1] == \"auth\") {\n                uint8_t xbuffer[64];\n                DS::CryptCalcX(xbuffer, DS::Settings::CryptKey(DS::e_KeyAuth_N),\n                               DS::Settings::CryptKey(DS::e_KeyAuth_K), CRYPT_BASE_AUTH);\n                printf(\"Auth client keys:\\n\");\n                DS::PrintClientKeys(xbuffer, DS::Settings::CryptKey(DS::e_KeyAuth_N));\n            } else if (args[1] == \"game\") {\n                uint8_t xbuffer[64];\n                DS::CryptCalcX(xbuffer, DS::Settings::CryptKey(DS::e_KeyGame_N),\n                               DS::Settings::CryptKey(DS::e_KeyGame_K), CRYPT_BASE_GAME);\n                printf(\"Game client keys:\\n\");\n                DS::PrintClientKeys(xbuffer, DS::Settings::CryptKey(DS::e_KeyGame_N));\n            } else if (args[1] == \"gate\") {\n                uint8_t xbuffer[64];\n                DS::CryptCalcX(xbuffer, DS::Settings::CryptKey(DS::e_KeyGate_N),\n                               DS::Settings::CryptKey(DS::e_KeyGate_K), CRYPT_BASE_GATE);\n                printf(\"GateKeeper client keys:\\n\");\n                DS::PrintClientKeys(xbuffer, DS::Settings::CryptKey(DS::e_KeyGate_N));\n            } else {\n                fprintf(stderr, \"Error: %s is not a valid key type\\n\", args[1].c_str());\n                continue;\n            }\n        } else if (args[0] == \"help\") {\n            printf(\"DirtSand v1.0 Console supported commands:\\n\"\n                   \"    help\\n\"\n                   \"    keygen [auth|game|gate]\\n\"\n                   \"    quit\\n\"\n                   \"    restart <auth|lobby>\\n\"\n                  );\n        } else {\n            fprintf(stderr, \"Error: Unrecognized command: %s\\n\", args[0].c_str());\n        }\n    }\n\n    DS::StopLobby();\n    DS::GateKeeper_Shutdown();\n    DS::AuthServer_Shutdown();\n    DS::FileServer_Shutdown();\n    return 0;\n}<commit_msg>Fixed output of auth key<commit_after>\/******************************************************************************\n * This file is part of dirtsand.                                             *\n *                                                                            *\n * dirtsand 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 * dirtsand is distributed in the hope that it will be 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 dirtsand.  If not, see <http:\/\/www.gnu.org\/licenses\/>.          *\n ******************************************************************************\/\n\n#include \"NetIO\/Lobby.h\"\n#include \"NetIO\/CryptIO.h\"\n#include \"GateKeeper\/GateServ.h\"\n#include \"FileServ\/FileServer.h\"\n#include \"AuthServ\/AuthServer.h\"\n#include \"strings.h\"\n#include \"errors.h\"\n#include \"settings.h\"\n#include \"encodings.h\"\n#include <signal.h>\n#include <cstdio>\n\nint main(int argc, char* argv[])\n{\n    if (argc == 1) {\n        fprintf(stderr, \"Warning: No config file specified. Using defaults...\\n\");\n        DS::Settings::UseDefaults();\n    } else if (!DS::Settings::LoadFrom(argv[1])) {\n        return 1;\n    }\n\n    \/\/ Ignore sigpipe and force send() to return EPIPE\n    signal(SIGPIPE, SIG_IGN);\n\n    DS::FileServer_Init();\n    DS::AuthServer_Init();\n    DS::GateKeeper_Init();\n    DS::StartLobby();\n\n    char cmdbuf[4096];\n    while (fgets(cmdbuf, 4096, stdin)) {\n        std::vector<DS::String> args = DS::String(cmdbuf).strip('#').split();\n        if (args.size() == 0)\n            continue;\n\n        if (args[0] == \"quit\") {\n            break;\n        } else if (args[0] == \"restart\") {\n            if (args.size() < 2) {\n                fprintf(stderr, \"Error: No services specified\\n\");\n                continue;\n            }\n            for (std::vector<DS::String>::iterator svc = args.begin() + 1;\n                 svc != args.end(); ++svc) {\n                if (*svc == \"lobby\") {\n                    DS::StopLobby();\n                    DS::StartLobby();\n                } else {\n                    fprintf(stderr, \"Error: Service %s cannot be restarted\\n\", svc->c_str());\n                }\n            }\n        } else if (args[0] == \"keygen\") {\n            uint8_t xbuffer[64];\n            if (args.size() == 1) {\n                uint8_t nbuffer[3][64], kbuffer[3][64];\n                printf(\"Generating new server keys...  This may take a while...\\n\");\n                for (size_t i=0; i<3; ++i)\n                    DS::GenPrimeKeys(nbuffer[i], kbuffer[i]);\n\n                printf(\"\\n--------------------\\n\");\n                printf(\"Server keys:\\n\");\n                printf(\"Key.Auth.N = %s\\n\", DS::Base64Encode(nbuffer[0], 64).c_str());\n                printf(\"Key.Auth.K = %s\\n\", DS::Base64Encode(kbuffer[0], 64).c_str());\n                printf(\"Key.Game.N = %s\\n\", DS::Base64Encode(nbuffer[1], 64).c_str());\n                printf(\"Key.Game.K = %s\\n\", DS::Base64Encode(kbuffer[1], 64).c_str());\n                printf(\"Key.Gate.N = %s\\n\", DS::Base64Encode(nbuffer[2], 64).c_str());\n                printf(\"Key.Auth.K = %s\\n\", DS::Base64Encode(kbuffer[2], 64).c_str());\n\n                printf(\"Auth client keys:\\n\");\n                DS::CryptCalcX(xbuffer, nbuffer[0], kbuffer[0], CRYPT_BASE_AUTH);\n                DS::PrintClientKeys(xbuffer, nbuffer[0]);\n\n                printf(\"Game client keys:\\n\");\n                DS::CryptCalcX(xbuffer, nbuffer[1], kbuffer[1], CRYPT_BASE_GAME);\n                DS::PrintClientKeys(xbuffer, nbuffer[1]);\n\n                printf(\"GateKeeper client keys:\\n\");\n                DS::CryptCalcX(xbuffer, nbuffer[2], kbuffer[2], CRYPT_BASE_GATE);\n                DS::PrintClientKeys(xbuffer, nbuffer[2]);\n                printf(\"--------------------\\n\");\n            } else if (args[1] == \"auth\") {\n                uint8_t xbuffer[64];\n                DS::CryptCalcX(xbuffer, DS::Settings::CryptKey(DS::e_KeyAuth_N),\n                               DS::Settings::CryptKey(DS::e_KeyAuth_K), CRYPT_BASE_AUTH);\n                printf(\"Auth client keys:\\n\");\n                DS::PrintClientKeys(xbuffer, DS::Settings::CryptKey(DS::e_KeyAuth_N));\n            } else if (args[1] == \"game\") {\n                uint8_t xbuffer[64];\n                DS::CryptCalcX(xbuffer, DS::Settings::CryptKey(DS::e_KeyGame_N),\n                               DS::Settings::CryptKey(DS::e_KeyGame_K), CRYPT_BASE_GAME);\n                printf(\"Game client keys:\\n\");\n                DS::PrintClientKeys(xbuffer, DS::Settings::CryptKey(DS::e_KeyGame_N));\n            } else if (args[1] == \"gate\") {\n                uint8_t xbuffer[64];\n                DS::CryptCalcX(xbuffer, DS::Settings::CryptKey(DS::e_KeyGate_N),\n                               DS::Settings::CryptKey(DS::e_KeyGate_K), CRYPT_BASE_GATE);\n                printf(\"GateKeeper client keys:\\n\");\n                DS::PrintClientKeys(xbuffer, DS::Settings::CryptKey(DS::e_KeyGate_N));\n            } else {\n                fprintf(stderr, \"Error: %s is not a valid key type\\n\", args[1].c_str());\n                continue;\n            }\n        } else if (args[0] == \"help\") {\n            printf(\"DirtSand v1.0 Console supported commands:\\n\"\n                   \"    help\\n\"\n                   \"    keygen [auth|game|gate]\\n\"\n                   \"    quit\\n\"\n                   \"    restart <auth|lobby>\\n\"\n                  );\n        } else {\n            fprintf(stderr, \"Error: Unrecognized command: %s\\n\", args[0].c_str());\n        }\n    }\n\n    DS::StopLobby();\n    DS::GateKeeper_Shutdown();\n    DS::AuthServer_Shutdown();\n    DS::FileServer_Shutdown();\n    return 0;\n}<|endoftext|>"}
{"text":"<commit_before>#include \"musictextdownloadthread.h\"\n\n#include <QJsonObject>\n#include <QJsonValue>\n#include <QJsonParseError>\n\nMusicTextDownLoadThread::MusicTextDownLoadThread(const QString &url, const QString &save,\n                                                 Download_Type type, QObject *parent)\n    : MusicDownLoadThreadAbstract(url, save, type, parent)\n{\n\n}\n\nvoid MusicTextDownLoadThread::startToDownload()\n{\n    if( !m_file->exists() || m_file->size() < 4 )\n    {\n        if( m_file->open(QIODevice::WriteOnly | QIODevice::Truncate | QIODevice::Text) )\n        {\n            m_manager = new QNetworkAccessManager(this);\n            m_reply = m_manager->get( QNetworkRequest(QUrl(m_url)));\n            connect(m_reply, SIGNAL(finished()), SLOT(downLoadFinished()));\n            connect(m_reply, SIGNAL(error(QNetworkReply::NetworkError)),\n                             SLOT(replyError(QNetworkReply::NetworkError)) );\n        }\n        else\n        {\n            emit musicDownLoadFinished(\"The text file create failed\");\n            M_LOOGER << \"The text file create failed\";\n            deleteAll();\n        }\n    }\n}\n\nvoid MusicTextDownLoadThread::downLoadFinished()\n{\n    if(m_reply == NULL)\n    {\n        return;\n    }\n    \/\/\/Get all the data obtained by request\n    QByteArray bytes = m_reply->readAll();\n    if(!bytes.contains(\"\\\"code\\\":2\"))\n    {\n        QJsonParseError jsonError;\n        QJsonDocument parseDoucment = QJsonDocument::fromJson(bytes, &jsonError);\n        \/\/\/Put the data into Json\n        if(jsonError.error != QJsonParseError::NoError ||\n           !parseDoucment.isObject())\n        {\n            deleteAll();\n            return ;\n        }\n\n        QJsonObject jsonObject = parseDoucment.object();\n        if(jsonObject.contains(\"data\"))\n        {\n            jsonObject = jsonObject.take(\"data\").toObject();\n            if(jsonObject.contains(\"lrc\"))\n            {\n                m_file->write(jsonObject.take(\"lrc\").toString().toUtf8());\n                m_file->flush();\n                m_file->close();\n                M_LOOGER << \"text download has finished!\";\n            }\n        }\n    }\n    else\n    {\n        M_LOOGER << \"text download file error!\";\n        m_file->remove();\n        m_file->close();\n    }\n\n    emit musicDownLoadFinished(\"Lrc\");\n    deleteAll();\n}\n<commit_msg>remove \\n char from lrc download data[123135]<commit_after>#include \"musictextdownloadthread.h\"\n\n#include <QJsonObject>\n#include <QJsonValue>\n#include <QJsonParseError>\n\nMusicTextDownLoadThread::MusicTextDownLoadThread(const QString &url, const QString &save,\n                                                 Download_Type type, QObject *parent)\n    : MusicDownLoadThreadAbstract(url, save, type, parent)\n{\n\n}\n\nvoid MusicTextDownLoadThread::startToDownload()\n{\n    if( !m_file->exists() || m_file->size() < 4 )\n    {\n        if( m_file->open(QIODevice::WriteOnly | QIODevice::Truncate | QIODevice::Text) )\n        {\n            m_manager = new QNetworkAccessManager(this);\n            m_reply = m_manager->get( QNetworkRequest(QUrl(m_url)));\n            connect(m_reply, SIGNAL(finished()), SLOT(downLoadFinished()));\n            connect(m_reply, SIGNAL(error(QNetworkReply::NetworkError)),\n                             SLOT(replyError(QNetworkReply::NetworkError)) );\n        }\n        else\n        {\n            emit musicDownLoadFinished(\"The text file create failed\");\n            M_LOOGER << \"The text file create failed\";\n            deleteAll();\n        }\n    }\n}\n\nvoid MusicTextDownLoadThread::downLoadFinished()\n{\n    if(m_reply == NULL)\n    {\n        return;\n    }\n    \/\/\/Get all the data obtained by request\n    QByteArray bytes = m_reply->readAll();\n    if(!bytes.contains(\"\\\"code\\\":2\"))\n    {\n        QJsonParseError jsonError;\n        QJsonDocument parseDoucment = QJsonDocument::fromJson(bytes, &jsonError);\n        \/\/\/Put the data into Json\n        if(jsonError.error != QJsonParseError::NoError ||\n           !parseDoucment.isObject())\n        {\n            deleteAll();\n            return ;\n        }\n\n        QJsonObject jsonObject = parseDoucment.object();\n        if(jsonObject.contains(\"data\"))\n        {\n            jsonObject = jsonObject.take(\"data\").toObject();\n            if(jsonObject.contains(\"lrc\"))\n            {\n                m_file->write(jsonObject.take(\"lrc\").toString().remove(\"\\r\").toUtf8());\n                m_file->flush();\n                m_file->close();\n                M_LOOGER << \"text download has finished!\";\n            }\n        }\n    }\n    else\n    {\n        M_LOOGER << \"text download file error!\";\n        m_file->remove();\n        m_file->close();\n    }\n\n    emit musicDownLoadFinished(\"Lrc\");\n    deleteAll();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===--- TerminalDisplay.cpp - Output To 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 abstract interface for writing to a terminal.\n\/\/\n\/\/  Axel Naumann <axel@cern.ch>, 2011-05-12\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"textinput\/TerminalDisplay.h\"\n\n#ifdef WIN32\n#include \"textinput\/TerminalDisplayWin.h\"\n#else\n#include \"textinput\/TerminalDisplayUnix.h\"\n#endif\n\n#include \"textinput\/TextInput.h\"\n#include \"textinput\/Color.h\"\n#include \"textinput\/Text.h\"\n#include \"textinput\/Editor.h\"\n\n#include <cstring>\n\nnamespace textinput {\n  TerminalDisplay::~TerminalDisplay() {}\n\n  TerminalDisplay*\n  TerminalDisplay::Create() {\n#ifdef WIN32\n    return new TerminalDisplayWin();\n#else\n    return new TerminalDisplayUnix();\n#endif\n  }\n  \n  void\n  TerminalDisplay::NotifyTextChange(Range r) {\n    Attach();\n    WriteWrapped(r.fPromptUpdate,GetContext()->GetTextInput()->IsInputHidden(),\n      r.fStart, r.fLength);\n    Move(GetCursor());\n  }\n  \n  void\n  TerminalDisplay::NotifyCursorChange() {\n    Attach();\n    Move(GetCursor());\n  }\n  \n  void\n  TerminalDisplay::NotifyResetInput() {\n    Attach();\n    WriteRawString(\"\\n\", 1);\n    fWriteLen = 0;\n    fWritePos = Pos();\n  }\n  \n  void\n  TerminalDisplay::NotifyError() {\n    Attach();\n    WriteRawString(\"\\x07\", 1);\n  }\n\n  void\n  TerminalDisplay::DisplayInfo(const std::vector<std::string>& Options) {\n    char infoColIdx = GetContext()->GetColorizer()->GetInfoColor();\n    WriteRawString(\"\\n\", 1);\n    for (size_t i = 0, n = Options.size(); i < n; ++i) {\n      Text t(Options[i], infoColIdx);\n      WriteWrappedElement(t, 0, 0, (size_t) -1);\n      WriteRawString(\"\\n\", 1);\n    }\n    \/\/ Reset position\n    Detach();\n    Attach();\n  }\n  \n  void\n  TerminalDisplay::Detach() {\n    Color DefaultColor;\n    GetContext()->GetColorizer()->GetColor(0, DefaultColor);\n    SetColor(0, DefaultColor);\n  }\n\n  size_t\n  TerminalDisplay::WriteWrappedElement(const Text& Element, size_t TextOffset,\n                                       size_t WriteOffset, size_t Requested) {\n    size_t Start = TextOffset;\n    size_t Remaining = Requested;\n    \n    size_t Available = Element.length() - Start;\n    if (Requested == (size_t) -1) {\n      Requested = Available;\n    }\n\n    if (Available > 0) {\n      if (Available < Remaining) {\n        Remaining = Available;\n      }\n\n      while (Remaining > 0) {\n        size_t numThisLine = Remaining;\n\n        \/\/ How much can this line hold?\n        size_t numToEOL = GetWidth() - ((Start + WriteOffset) % GetWidth());\n        if (!numToEOL) {\n          MoveDown();\n          ++fWritePos.fLine;\n          MoveFront();\n          fWritePos.fCol = 0;\n          numToEOL = GetWidth();\n        }\n        if (numThisLine > numToEOL) {\n          numThisLine = numToEOL;\n        }\n        \n        if (GetContext()->GetColorizer()) {\n          \/\/ We only write same-color chunks; how long is it?\n          const std::vector<char>& Colors = Element.GetColors();\n          char ThisColor = Colors[Start];\n          size_t numSameColor = 1;\n          while (numSameColor < numThisLine\n                 && ThisColor == Colors[Start + numSameColor])\n            ++numSameColor;\n          numThisLine = numSameColor;\n          \n          if (ThisColor != fPrevColor) {\n            Color C;\n            GetContext()->GetColorizer()->GetColor(ThisColor, C);\n            SetColor(ThisColor, C);\n            fPrevColor = ThisColor;\n          }\n        }\n\n        WriteRawString(Element.GetText().c_str() + Start, numThisLine);\n        fWritePos = IndexToPos(PosToIndex(fWritePos) + numThisLine);\n        if (numThisLine == numToEOL) {\n          ActOnEOL();\n        }\n\n        Start += numThisLine;\n        Remaining -= numThisLine;\n      }\n    }\n\n    if (Requested == Available) {\n      size_t VisL = fWriteLen \/ GetWidth();\n      size_t Wrote = WriteOffset + TextOffset + Requested;\n      size_t WroteL = Wrote \/ GetWidth();\n      size_t NumToEOL = GetWidth() - (Wrote % GetWidth());\n      if (fWriteLen > Wrote && NumToEOL > 0) {\n        \/\/ Wrote less and not at EOL\n        EraseToRight();\n      }\n      if (WroteL < VisL) {\n        Pos prevWC = GetCursor();\n        MoveFront();\n        fWritePos.fCol = 0;\n        for (size_t l = WroteL + 1; l <= VisL; ++l) {\n          MoveDown();\n          ++fWritePos.fLine;\n          EraseToRight();\n        }\n        Move(prevWC);\n      }\n    }\n    return Remaining;\n  }\n\n  size_t\n  TerminalDisplay::WriteWrapped(Range::EPromptUpdate PromptUpdate, bool hidden,\n                                size_t Offset, size_t Requested \/* = -1*\/) {\n    Attach();\n\n    const Text& Prompt = GetContext()->GetPrompt();\n    size_t PromptLen = GetContext()->GetPrompt().length();\n    const Text& EditPrompt = GetContext()->GetEditor()->GetEditorPrompt();\n    size_t EditorPromptLen = EditPrompt.length();\n\n    if (!IsTTY()) {\n       PromptLen = 0;\n       EditorPromptLen = 0;\n       PromptUpdate = Range::kNoPromptUpdate;\n    }\n\n    if (PromptUpdate & Range::kUpdatePrompt) {\n      \/\/ Writing from front means we write the prompt, too\n      Move(Pos());\n      WriteWrappedElement(Prompt, 0, 0, PromptLen);\n    }\n    if (PromptUpdate != Range::kNoPromptUpdate) {\n      \/\/ Any prompt update means we'll have to re-write the editor prompt\n      Move(IndexToPos(PromptLen));\n      if (EditorPromptLen) {\n        WriteWrappedElement(EditPrompt, 0, PromptLen, EditorPromptLen);\n      }\n      \/\/ Any prompt update means we'll have to re-write the text\n      Offset = 0;\n      Requested = (size_t) -1;\n    } else {\n      Move(IndexToPos(PromptLen + EditorPromptLen + Offset));\n    }\n\n    size_t avail = 0;\n    if (hidden) {\n      \/\/ '*' are nice but less secure for password (length will be known).\n      \/\/ Text hide(std::string(GetContext()->GetLine().length(), '*'), 0);\n      \/\/ avail = WriteWrappedElement(hide, Offset,\n      \/\/                             PromptLen + EditorPromptLen, Requested);\n    } else {\n      avail = WriteWrappedElement(GetContext()->GetLine(), Offset,\n                                       PromptLen + EditorPromptLen, Requested);\n    }\n    fWriteLen = PromptLen + EditorPromptLen + GetContext()->GetLine().length();\n    return avail;\n  }\n  \n  void\n  TerminalDisplay::Move(Pos p) {\n    Attach();\n    if (fWritePos == p) return;\n    if (fWritePos.fLine > p.fLine) {\n      MoveUp(fWritePos.fLine - p.fLine);\n      fWritePos.fLine -= fWritePos.fLine - p.fLine;\n    } else if (fWritePos.fLine < p.fLine) {\n      MoveDown(p.fLine - fWritePos.fLine);\n      fWritePos.fLine += p.fLine - fWritePos.fLine;\n    }\n    \n    if (p.fCol == 0) {\n      MoveFront();\n      fWritePos.fCol = 0;\n    } else if (fWritePos.fCol > p.fCol) {\n      MoveLeft(fWritePos.fCol - p.fCol);\n      fWritePos.fCol -= fWritePos.fCol - p.fCol;\n    } else if (p.fCol > fWritePos.fCol) {\n      MoveRight(p.fCol - fWritePos.fCol);\n      fWritePos.fCol += p.fCol - fWritePos.fCol;\n    }\n  }\n}\n<commit_msg>Don't echo the input if it's not a TTY. Make sure Colorizer exists before using it. Reset position \/ fWriteLen at Attach() \/ Detach(): we cannot tell where we are afterwards anyway. Set fPrevColor to -1: we don't know whether a different color was activated while textinput was detached.<commit_after>\/\/===--- TerminalDisplay.cpp - Output To 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 abstract interface for writing to a terminal.\n\/\/\n\/\/  Axel Naumann <axel@cern.ch>, 2011-05-12\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"textinput\/TerminalDisplay.h\"\n\n#ifdef WIN32\n#include \"textinput\/TerminalDisplayWin.h\"\n#else\n#include \"textinput\/TerminalDisplayUnix.h\"\n#endif\n\n#include \"textinput\/TextInput.h\"\n#include \"textinput\/Color.h\"\n#include \"textinput\/Text.h\"\n#include \"textinput\/Editor.h\"\n\n#include <cstring>\n\nnamespace textinput {\n  TerminalDisplay::~TerminalDisplay() {}\n\n  TerminalDisplay*\n  TerminalDisplay::Create() {\n#ifdef WIN32\n    return new TerminalDisplayWin();\n#else\n    return new TerminalDisplayUnix();\n#endif\n  }\n  \n  void\n  TerminalDisplay::NotifyTextChange(Range r) {\n    if (!IsTTY()) return;\n    Attach();\n    WriteWrapped(r.fPromptUpdate,GetContext()->GetTextInput()->IsInputHidden(),\n      r.fStart, r.fLength);\n    Move(GetCursor());\n  }\n  \n  void\n  TerminalDisplay::NotifyCursorChange() {\n    Attach();\n    Move(GetCursor());\n  }\n  \n  void\n  TerminalDisplay::NotifyResetInput() {\n    Attach();\n    if (IsTTY()) {\n      WriteRawString(\"\\n\", 1);\n    }\n    fWriteLen = 0;\n    fWritePos = Pos();\n  }\n  \n  void\n  TerminalDisplay::NotifyError() {\n    Attach();\n    WriteRawString(\"\\x07\", 1);\n  }\n\n  void\n  TerminalDisplay::DisplayInfo(const std::vector<std::string>& Options) {\n    char infoColIdx = 0;\n    if (GetContext()->GetColorizer()) {\n       infoColIdx = GetContext()->GetColorizer()->GetInfoColor();\n    }\n    WriteRawString(\"\\n\", 1);\n    for (size_t i = 0, n = Options.size(); i < n; ++i) {\n      Text t(Options[i], infoColIdx);\n      WriteWrappedElement(t, 0, 0, (size_t) -1);\n      WriteRawString(\"\\n\", 1);\n    }\n    \/\/ Reset position\n    Detach();\n    Attach();\n  }\n  \n  void\n  TerminalDisplay::Detach() {\n    fWritePos = Pos();\n    fWriteLen = 0;\n    if (GetContext()->GetColorizer()) {\n      Color DefaultColor;\n      GetContext()->GetColorizer()->GetColor(0, DefaultColor);\n      SetColor(0, DefaultColor);\n      \/\/ We can't tell whether the application will activate a different color:\n      fPrevColor = -1;\n    }\n  }\n\n  size_t\n  TerminalDisplay::WriteWrappedElement(const Text& Element, size_t TextOffset,\n                                       size_t WriteOffset, size_t Requested) {\n    size_t Start = TextOffset;\n    size_t Remaining = Requested;\n    \n    size_t Available = Element.length() - Start;\n    if (Requested == (size_t) -1) {\n      Requested = Available;\n    }\n\n    if (Available > 0) {\n      if (Available < Remaining) {\n        Remaining = Available;\n      }\n\n      while (Remaining > 0) {\n        size_t numThisLine = Remaining;\n\n        \/\/ How much can this line hold?\n        size_t numToEOL = GetWidth() - ((Start + WriteOffset) % GetWidth());\n        if (!numToEOL) {\n          MoveDown();\n          ++fWritePos.fLine;\n          MoveFront();\n          fWritePos.fCol = 0;\n          numToEOL = GetWidth();\n        }\n        if (numThisLine > numToEOL) {\n          numThisLine = numToEOL;\n        }\n        \n        if (GetContext()->GetColorizer()) {\n          \/\/ We only write same-color chunks; how long is it?\n          const std::vector<char>& Colors = Element.GetColors();\n          char ThisColor = Colors[Start];\n          size_t numSameColor = 1;\n          while (numSameColor < numThisLine\n                 && ThisColor == Colors[Start + numSameColor])\n            ++numSameColor;\n          numThisLine = numSameColor;\n          \n          if (ThisColor != fPrevColor) {\n            Color C;\n            GetContext()->GetColorizer()->GetColor(ThisColor, C);\n            SetColor(ThisColor, C);\n            fPrevColor = ThisColor;\n          }\n        }\n\n        WriteRawString(Element.GetText().c_str() + Start, numThisLine);\n        fWritePos = IndexToPos(PosToIndex(fWritePos) + numThisLine);\n        if (numThisLine == numToEOL) {\n          ActOnEOL();\n        }\n\n        Start += numThisLine;\n        Remaining -= numThisLine;\n      }\n    }\n\n    if (Requested == Available) {\n      size_t VisL = fWriteLen \/ GetWidth();\n      size_t Wrote = WriteOffset + TextOffset + Requested;\n      size_t WroteL = Wrote \/ GetWidth();\n      size_t NumToEOL = GetWidth() - (Wrote % GetWidth());\n      if (fWriteLen > Wrote && NumToEOL > 0) {\n        \/\/ Wrote less and not at EOL\n        EraseToRight();\n      }\n      if (WroteL < VisL) {\n        Pos prevWC = GetCursor();\n        MoveFront();\n        fWritePos.fCol = 0;\n        for (size_t l = WroteL + 1; l <= VisL; ++l) {\n          MoveDown();\n          ++fWritePos.fLine;\n          EraseToRight();\n        }\n        Move(prevWC);\n      }\n    }\n    return Remaining;\n  }\n\n  size_t\n  TerminalDisplay::WriteWrapped(Range::EPromptUpdate PromptUpdate, bool hidden,\n                                size_t Offset, size_t Requested \/* = -1*\/) {\n    Attach();\n\n    const Text& Prompt = GetContext()->GetPrompt();\n    size_t PromptLen = GetContext()->GetPrompt().length();\n    const Text& EditPrompt = GetContext()->GetEditor()->GetEditorPrompt();\n    size_t EditorPromptLen = EditPrompt.length();\n\n    if (!IsTTY()) {\n       PromptLen = 0;\n       EditorPromptLen = 0;\n       PromptUpdate = Range::kNoPromptUpdate;\n    }\n\n    if (PromptUpdate & Range::kUpdatePrompt) {\n      \/\/ Writing from front means we write the prompt, too\n      Move(Pos());\n      WriteWrappedElement(Prompt, 0, 0, PromptLen);\n    }\n    if (PromptUpdate != Range::kNoPromptUpdate) {\n      \/\/ Any prompt update means we'll have to re-write the editor prompt\n      Move(IndexToPos(PromptLen));\n      if (EditorPromptLen) {\n        WriteWrappedElement(EditPrompt, 0, PromptLen, EditorPromptLen);\n      }\n      \/\/ Any prompt update means we'll have to re-write the text\n      Offset = 0;\n      Requested = (size_t) -1;\n    } else {\n      Move(IndexToPos(PromptLen + EditorPromptLen + Offset));\n    }\n\n    size_t avail = 0;\n    if (hidden) {\n      \/\/ '*' are nice but less secure for password (length will be known).\n      \/\/ Text hide(std::string(GetContext()->GetLine().length(), '*'), 0);\n      \/\/ avail = WriteWrappedElement(hide, Offset,\n      \/\/                             PromptLen + EditorPromptLen, Requested);\n    } else {\n      avail = WriteWrappedElement(GetContext()->GetLine(), Offset,\n                                       PromptLen + EditorPromptLen, Requested);\n    }\n    fWriteLen = PromptLen + EditorPromptLen + GetContext()->GetLine().length();\n    return avail;\n  }\n  \n  void\n  TerminalDisplay::Move(Pos p) {\n    Attach();\n    if (fWritePos == p) return;\n    if (fWritePos.fLine > p.fLine) {\n      MoveUp(fWritePos.fLine - p.fLine);\n      fWritePos.fLine -= fWritePos.fLine - p.fLine;\n    } else if (fWritePos.fLine < p.fLine) {\n      MoveDown(p.fLine - fWritePos.fLine);\n      fWritePos.fLine += p.fLine - fWritePos.fLine;\n    }\n    \n    if (p.fCol == 0) {\n      MoveFront();\n      fWritePos.fCol = 0;\n    } else if (fWritePos.fCol > p.fCol) {\n      MoveLeft(fWritePos.fCol - p.fCol);\n      fWritePos.fCol -= fWritePos.fCol - p.fCol;\n    } else if (p.fCol > fWritePos.fCol) {\n      MoveRight(p.fCol - fWritePos.fCol);\n      fWritePos.fCol += p.fCol - fWritePos.fCol;\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>some progress<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"cubiccurve.h\"\n#include <cmath>\n\ndouble CubicCurve::value(double x)\n{\n    if (x < ctrl[0].x())\n        return 0;\n\n    int i = 1;\n    while (i < ctrl.count() && ctrl[i].x() < x)\n        ++i;\n\n    if (i >= ctrl.count())\n        return 255;\n\n    const Segment & seg = X[i-1];\n    double ulo = 0;\n    double uhi = 1;\n    double u = 0.5;\n    double epsilon = 1.0e-6;\n    double xepsilon = 0.5;\n    while (ulo + epsilon < uhi)\n    {\n        u = (ulo+uhi) \/ 2;\n        double ux = seg.eval(u);\n        if (abs(ux-x) < xepsilon)\n            break;\n\n        if (x < ux)\n            uhi = u;\n        else\n            ulo = u;\n    }\n\n    return Y[i-1].eval(u);\n}\n\nCubicCurve::Segment::Segment(double a, double b, double c, double d)\n{\n    this->a = a; this->b = b;\n    this->c = c; this->d = d;\n}\n\nCubicCurve::Segment::Segment()\n{\n    a = b = c = d = 0;\n}\n\nCubicCurve::Segment::Segment(const CubicCurve::Segment & x)\n    : a(x.a), b(x.b), c(x.c), d(x.d)\n{}\n\ndouble CubicCurve::Segment::eval(double u) const {\n    return (((d*u) + c)*u + b)*u + a;\n}\n\nQList<CubicCurve::Segment> CubicCurve::calcNaturalCubic(int n, const double * x) {\n    --n;\n    double * gamma = new double[n+1];\n    double * delta = new double[n+1];\n    double * D = new double[n+1];\n\n    gamma[0] = 0.5;\n    for (int i = 1; i < n; i++)\n        gamma[i] = 1\/(4-gamma[i-1]);\n    gamma[n] = 1\/(2-gamma[n-1]);\n\n    delta[0] = 3*(x[1]-x[0])*gamma[0];\n    for (int i = 1; i < n; i++)\n        delta[i] = (3*(x[i+1]-x[i-1])-delta[i-1])*gamma[i];\n    delta[n] = (3*(x[n]-x[n-1])-delta[n-1])*gamma[n];\n\n    D[n] = delta[n];\n    for (int i = n-1; i >= 0; i--)\n        D[i] = delta[i] - gamma[i]*D[i+1];\n\n    QList<Segment> result;\n    for (int i = 0; i < n; i++)\n        result.append(Segment(x[i], D[i], 3*(x[i+1] - x[i]) - 2*D[i] - D[i+1], 2*(x[i] - x[i+1]) + D[i] + D[i+1]));\n\n    delete gamma;\n    delete delta;\n    delete D;\n    return result;\n}\n\nvoid CubicCurve::setControlPoints(const QList<QPoint> & ctrl)\n{\n    this->ctrl = ctrl;\n    if (ctrl.count() >= 2) {\n        int n = ctrl.count();\n        double * xpoints = new double[n];\n        double * ypoints = new double[n];\n        for (int i = 0; i < ctrl.count(); ++i)\n        {\n            xpoints[i] =  ctrl[i].x();\n            ypoints[i] =  ctrl[i].y();\n        }\n        X = calcNaturalCubic(n, xpoints);\n        Y = calcNaturalCubic(n, ypoints);\n        delete xpoints;\n        delete ypoints;\n\n        points.clear();\n        points.append(QPoint(lround(X[0].eval(0)), lround(Y[0].eval(0))));\n        for (int i = 0; i < X.count(); i++) {\n            for (int j = 1; j <= steps; j++) {\n                double u = j \/ (double) steps;\n                points.append(QPoint(lround(X[i].eval(u)), lround(Y[i].eval(u))));\n            }\n        }\n    }\n}\n\nCubicCurve::CubicCurve()\n{\n    steps = 5;\n}\n\nCubicCurve::CubicCurve(int steps)\n{\n    this->steps = steps;\n}\n\nCubicCurve::CubicCurve(int steps, const QList<QPoint> & ctrl)\n{\n    this->steps = steps;\n    setControlPoints(ctrl);\n}\n\nCubicCurve::CubicCurve(const CubicCurve & x)\n{\n    this->steps = x.steps;\n    this->X = x.X;\n    this->Y = x.Y;\n    this->points = x.points;\n}\n\nQPolygon CubicCurve::getPolyline()\n{\n    QPolygon poly;\n    for (int i = 0; i < points.count(); ++i)\n        poly.append(points[i]);\n    return poly;\n}\n<commit_msg>Attribution notice.<commit_after>#include \"cubiccurve.h\"\n#include <cmath>\n\ndouble CubicCurve::value(double x)\n{\n    if (x < ctrl[0].x())\n        return 0;\n\n    int i = 1;\n    while (i < ctrl.count() && ctrl[i].x() < x)\n        ++i;\n\n    if (i >= ctrl.count())\n        return 255;\n\n    const Segment & seg = X[i-1];\n    double ulo = 0;\n    double uhi = 1;\n    double u = 0.5;\n    double epsilon = 1.0e-6;\n    double xepsilon = 0.5;\n    while (ulo + epsilon < uhi)\n    {\n        u = (ulo+uhi) \/ 2;\n        double ux = seg.eval(u);\n        if (abs(ux-x) < xepsilon)\n            break;\n\n        if (x < ux)\n            uhi = u;\n        else\n            ulo = u;\n    }\n\n    return Y[i-1].eval(u);\n}\n\nCubicCurve::Segment::Segment(double a, double b, double c, double d)\n{\n    this->a = a; this->b = b;\n    this->c = c; this->d = d;\n}\n\nCubicCurve::Segment::Segment()\n{\n    a = b = c = d = 0;\n}\n\nCubicCurve::Segment::Segment(const CubicCurve::Segment & x)\n    : a(x.a), b(x.b), c(x.c), d(x.d)\n{}\n\ndouble CubicCurve::Segment::eval(double u) const {\n    return (((d*u) + c)*u + b)*u + a;\n}\n\nQList<CubicCurve::Segment> CubicCurve::calcNaturalCubic(int n, const double * x) {\n    \/\/ adapted from http:\/\/www.cse.unsw.edu.au\/~lambert\/splines\/source.html\n    --n;\n    double * gamma = new double[n+1];\n    double * delta = new double[n+1];\n    double * D = new double[n+1];\n\n    gamma[0] = 0.5;\n    for (int i = 1; i < n; i++)\n        gamma[i] = 1\/(4-gamma[i-1]);\n    gamma[n] = 1\/(2-gamma[n-1]);\n\n    delta[0] = 3*(x[1]-x[0])*gamma[0];\n    for (int i = 1; i < n; i++)\n        delta[i] = (3*(x[i+1]-x[i-1])-delta[i-1])*gamma[i];\n    delta[n] = (3*(x[n]-x[n-1])-delta[n-1])*gamma[n];\n\n    D[n] = delta[n];\n    for (int i = n-1; i >= 0; i--)\n        D[i] = delta[i] - gamma[i]*D[i+1];\n\n    QList<Segment> result;\n    for (int i = 0; i < n; i++)\n        result.append(Segment(x[i], D[i], 3*(x[i+1] - x[i]) - 2*D[i] - D[i+1], 2*(x[i] - x[i+1]) + D[i] + D[i+1]));\n\n    delete gamma;\n    delete delta;\n    delete D;\n    return result;\n}\n\nvoid CubicCurve::setControlPoints(const QList<QPoint> & ctrl)\n{\n    this->ctrl = ctrl;\n    if (ctrl.count() >= 2) {\n        int n = ctrl.count();\n        double * xpoints = new double[n];\n        double * ypoints = new double[n];\n        for (int i = 0; i < ctrl.count(); ++i)\n        {\n            xpoints[i] =  ctrl[i].x();\n            ypoints[i] =  ctrl[i].y();\n        }\n        X = calcNaturalCubic(n, xpoints);\n        Y = calcNaturalCubic(n, ypoints);\n        delete xpoints;\n        delete ypoints;\n\n        points.clear();\n        points.append(QPoint(lround(X[0].eval(0)), lround(Y[0].eval(0))));\n        for (int i = 0; i < X.count(); i++) {\n            for (int j = 1; j <= steps; j++) {\n                double u = j \/ (double) steps;\n                points.append(QPoint(lround(X[i].eval(u)), lround(Y[i].eval(u))));\n            }\n        }\n    }\n}\n\nCubicCurve::CubicCurve()\n{\n    steps = 5;\n}\n\nCubicCurve::CubicCurve(int steps)\n{\n    this->steps = steps;\n}\n\nCubicCurve::CubicCurve(int steps, const QList<QPoint> & ctrl)\n{\n    this->steps = steps;\n    setControlPoints(ctrl);\n}\n\nCubicCurve::CubicCurve(const CubicCurve & x)\n{\n    this->steps = x.steps;\n    this->X = x.X;\n    this->Y = x.Y;\n    this->points = x.points;\n}\n\nQPolygon CubicCurve::getPolyline()\n{\n    QPolygon poly;\n    for (int i = 0; i < points.count(); ++i)\n        poly.append(points[i]);\n    return poly;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"Application.h\"\n#include \"OpenGL.h\"\n\n#include \"GameState.h\"\n#include \"MenuState.h\"\n#include \"TestState.h\"\n\n#include <sys\/time.h>\n\nstatic int64_t getMicroseconds()\n{\n\ttimeval tv;\n\tgettimeofday(&tv, NULL);\n\treturn tv.tv_sec * 1000000L + tv.tv_usec;\n}\n\nApplication::Application() : m_initialized(false)\n{\n}\n\nApplication::~Application()\n{\n}\n\nvoid Application::update(float width, float height)\n{\n\tif(!m_initialized)\n\t{\n\t\tm_stateMachine.addState(\"game\", new GameState);\n\t\tm_stateMachine.addState(\"menu\", new MenuState);\n\t\tm_stateMachine.addState(\"test\", new TestState);\n\t\tm_stateMachine.requestState(\"game\");\n\n\t\tm_startTime = m_lastUpdateTime = getMicroseconds();\n\n\t\tm_initialized = true;\n\t}\n\n\tint64_t time = getMicroseconds();\n\n\tm_stateMachine.update(width, height, (time - m_startTime) * (1.0 \/ 1000000.0), (time - m_lastUpdateTime) * (1.0 \/ 1000000.0));\n\n\tm_lastUpdateTime = time;\n}\n\nvoid Application::render(int width, int height)\n{\n\tm_stateMachine.render(width, height);\n}\n\nvoid Application::mouseDown(float x, float y)\n{\n\tm_stateMachine.mouseDown(x, y);\n}\n\nvoid Application::mouseUp(float x, float y)\n{\n\tm_stateMachine.mouseUp(x, y);\n}\n\nvoid Application::mouseMove(float x, float y)\n{\n\tm_stateMachine.mouseMove(x, y);\n}\n<commit_msg>Added a win32 implementation of time.<commit_after>#include \"Application.h\"\n#include \"OpenGL.h\"\n\n#include \"GameState.h\"\n#include \"MenuState.h\"\n#include \"TestState.h\"\n\n#ifdef _WIN32\n#define WIN32_LEAN_AND_MEAN 1\n#include <Windows.h>\nstatic int64_t s_frequency = 0;\n#else\n#include <sys\/time.h>\n#endif\n\nstatic int64_t getMicroseconds()\n{\n#ifdef _WIN32\n\tint64_t counter;\n\tQueryPerformanceCounter((LARGE_INTEGER*)&counter);\n\treturn counter * 1000 \/ (s_frequency \/ 1000);\n#else\n\ttimeval tv;\n\tgettimeofday(&tv, NULL);\n\treturn tv.tv_sec * 1000000L + tv.tv_usec;\n#endif\n}\n\nApplication::Application() : m_initialized(false)\n{\n#ifdef _WIN32\n\tQueryPerformanceFrequency((LARGE_INTEGER*)&s_frequency);\n#endif\n}\n\nApplication::~Application()\n{\n}\n\nvoid Application::update(float width, float height)\n{\n\tif(!m_initialized)\n\t{\n\t\tm_stateMachine.addState(\"game\", new GameState);\n\t\tm_stateMachine.addState(\"menu\", new MenuState);\n\t\tm_stateMachine.addState(\"test\", new TestState);\n\t\tm_stateMachine.requestState(\"game\");\n\n\t\tm_startTime = m_lastUpdateTime = getMicroseconds();\n\n\t\tm_initialized = true;\n\t}\n\n\tint64_t time = getMicroseconds();\n\n\tm_stateMachine.update(width, height, (time - m_startTime) * (1.0 \/ 1000000.0), (time - m_lastUpdateTime) * (1.0 \/ 1000000.0));\n\n\tm_lastUpdateTime = time;\n}\n\nvoid Application::render(int width, int height)\n{\n\tm_stateMachine.render(width, height);\n}\n\nvoid Application::mouseDown(float x, float y)\n{\n\tm_stateMachine.mouseDown(x, y);\n}\n\nvoid Application::mouseUp(float x, float y)\n{\n\tm_stateMachine.mouseUp(x, y);\n}\n\nvoid Application::mouseMove(float x, float y)\n{\n\tm_stateMachine.mouseMove(x, y);\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef REPY_BUILTIN_HXX\n# define REPY_BUILTIN_HXX\n\n# include <repy\/builtin.hh>\n\nnamespace repy\n{\n    template<class T>\n    T& deref(T& t)\n    {\n        return t;\n    }\n\n    template<class T>\n    T& deref(T* t)\n    {\n        return *t;\n    }\n\n    template<int N>\n    struct __internal_print\n    {\n        template<typename T>\n        static void call(T& a)\n        {\n            __internal_print<N - 1>::call(a);\n            std::cout << deref(std::get<N>(a)) << \" \";\n        }\n    };\n\n    template<>\n    struct __internal_print<0>\n    {\n        template<typename T>\n        static void call(T& a)\n        {\n            std::cout << deref(std::get<0>(a)) << \" \";\n        }\n    };\n\n    template<>\n    struct __internal_print<-1>\n    {\n        template<typename T>\n        static void call(T& a)\n        {}\n    };\n\n    template<typename... Args>\n    void __builtin_print(Args... a)\n    {\n        std::tuple<Args...> args = std::make_tuple(a...);\n\n        const int size = std::tuple_size<std::tuple<Args...>>::value - 1;\n\n        __internal_print<size>::call(args);\n\n        std::cout << std::endl;\n    }\n} \/\/ namespace repy\n\n#endif \/* !REPY_BUILTIN_HXX *\/\n<commit_msg>[RUNTIME] Correct print builtin<commit_after>#ifndef REPY_BUILTIN_HXX\n# define REPY_BUILTIN_HXX\n\n# include <repy\/builtin.hh>\n\nnamespace repy\n{\n    template<class T>\n    T& deref(T& t)\n    {\n        return t;\n    }\n\n    template<class T>\n    T& deref(T* t)\n    {\n        return *t;\n    }\n\n    template<int N>\n    struct __internal_print\n    {\n        template<typename T>\n        static void call(T& a, int size)\n        {\n            __internal_print<N - 1>::call(a, size);\n            std::cout << deref(std::get<N>(a));\n\n            if (N != size)\n                std::cout << \" \";\n        }\n    };\n\n    template<>\n    struct __internal_print<0>\n    {\n        template<typename T>\n        static void call(T& a, int size)\n        {\n            std::cout << deref(std::get<0>(a));\n            if (size != 0)\n                std::cout << \" \";\n        }\n    };\n\n    template<>\n    struct __internal_print<-1>\n    {\n        template<typename T>\n        static void call(T& a, int size)\n        {}\n    };\n\n    template<typename... Args>\n    void __builtin_print(Args... a)\n    {\n        std::tuple<Args...> args = std::make_tuple(a...);\n\n        const int size = std::tuple_size<std::tuple<Args...>>::value - 1;\n\n        __internal_print<size>::call(args, size);\n\n        std::cout << std::endl;\n    }\n} \/\/ namespace repy\n\n#endif \/* !REPY_BUILTIN_HXX *\/\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkTimerLog.cxx\n  Language:  C++\n  Date:      $Date$\n  Version:   $Revision$\n\n\nCopyright (c) 1993-1998 Ken Martin, Will Schroeder, Bill Lorensen.\n\nThis software is copyrighted by Ken Martin, Will Schroeder and Bill Lorensen.\nThe following terms apply to all files associated with the software unless\nexplicitly disclaimed in individual files. This copyright specifically does\nnot apply to the related textbook \"The Visualization Toolkit\" ISBN\n013199837-4 published by Prentice Hall which is covered by its own copyright.\n\nThe authors hereby grant permission to use, copy, and distribute this\nsoftware and its documentation for any purpose, provided that existing\ncopyright notices are retained in all copies and that this notice is included\nverbatim in any distributions. Additionally, the authors grant permission to\nmodify this software and its documentation for any purpose, provided that\nsuch modifications are not distributed without the explicit consent of the\nauthors and that existing copyright notices are retained in all copies. Some\nof the algorithms implemented by this software are patented, observe all\napplicable patent law.\n\nIN NO EVENT SHALL THE AUTHORS OR DISTRIBUTORS BE LIABLE TO ANY PARTY FOR\nDIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT\nOF THE USE OF THIS SOFTWARE, ITS DOCUMENTATION, OR ANY DERIVATIVES THEREOF,\nEVEN IF THE AUTHORS HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\nTHE AUTHORS AND DISTRIBUTORS SPECIFICALLY DISCLAIM ANY WARRANTIES, INCLUDING,\nBUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\nPARTICULAR PURPOSE, AND NON-INFRINGEMENT.  THIS SOFTWARE IS PROVIDED ON AN\n\"AS IS\" BASIS, AND THE AUTHORS AND DISTRIBUTORS HAVE NO OBLIGATION TO PROVIDE\nMAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.\n\n\n=========================================================================*\/\n\/\/ .NAME vtkTimerLog - Maintains timing table for performance analysis\n\/\/ .SECTION Description\n\/\/ vtkTimerLog contains walltime and cputime measurements associated\n\/\/ with a given event.  These results can be later analyzed when\n\/\/ \"dumping out\" the table.\n\/\/\n\/\/ In addition, vtkTimerLog allows the user to simply get the current\n\/\/ time, and to start\/stop a simple timer separate from the timing\n\/\/ table logging.\n\n#include \"vtkTimerLog.h\"\n#ifndef _WIN32\n#include <limits.h>     \/\/ for CLK_TCK\n#endif\n\n#include <time.h>\n\n\/\/ initialze the class variables\nint vtkTimerLog::MaxEntries = 100;\nint vtkTimerLog::NextEntry = 0;\nint vtkTimerLog::WrapFlag = 0;\nvtkTimerLogEntry *vtkTimerLog::TimerLog = NULL;\n\n#ifdef CLK_TCK\nint vtkTimerLog::TicksPerSecond = CLK_TCK;\n#else\nint vtkTimerLog::TicksPerSecond = 60;\n#endif\n\n#ifndef CLOCKS_PER_SEC\n#define CLOCKS_PER_SEC (vtkTimerLog::TicksPerSecond)\n#endif\n\n\n#ifdef _WIN32\ntimeb vtkTimerLog::FirstWallTime;\ntimeb vtkTimerLog::CurrentWallTime;\n#else\ntimeval vtkTimerLog::FirstWallTime;\ntimeval vtkTimerLog::CurrentWallTime;\ntms     vtkTimerLog::FirstCpuTicks;\ntms     vtkTimerLog::CurrentCpuTicks;\n#endif\n\n\/\/ Allocate timing table with MaxEntries elements.\nvoid vtkTimerLog::AllocateLog()\n{\n  if (vtkTimerLog::TimerLog != NULL)\n    {\n    delete [] vtkTimerLog::TimerLog;\n    }\n  vtkTimerLog::TimerLog = new vtkTimerLogEntry[vtkTimerLog::MaxEntries];\n}\n\n\n\/\/ Clear the timing table.  walltime and cputime will also be set\n\/\/ to zero when the first new event is recorded.\nvoid vtkTimerLog::ResetLog()\n{\n  vtkTimerLog::WrapFlag = 0;\n  vtkTimerLog::NextEntry = 0;\n  \/\/ may want to free TimerLog to force realloc so\n  \/\/ that user can resize the table by changing MaxEntries.\n}\n\n\n\/\/ Record a timing event.  The event is represented by a formatted\n\/\/ string.\nvoid vtkTimerLog::FormatAndMarkEvent(char *format, ...)\n{\nstatic  char event[4096];\n\n  va_list var_args;\n  va_start(var_args, format);\n  vsprintf(event, format, var_args);\n  va_end(var_args);\n\n  vtkTimerLog::MarkEvent(event);\n}\n\n\n\/\/ Record a timing event and capture walltime and cputicks.\nvoid vtkTimerLog::MarkEvent(char *event)\n{\n  int strsize;\n  double time_diff;\n  int ticks_diff;\n\n  strsize = (strlen(event)) > VTK_LOG_EVENT_LENGTH - 1\n    ? VTK_LOG_EVENT_LENGTH-1 : strlen(event);\n\n  \/\/ If this the first event we're recording, allocate the\n  \/\/ internal timing table and initialize WallTime and CpuTicks\n  \/\/ for this first event to zero.\n  if (vtkTimerLog::NextEntry == 0 && ! vtkTimerLog::WrapFlag)\n    {\n    if (vtkTimerLog::TimerLog == NULL)\n      {\n      vtkTimerLog::AllocateLog();\n      }\n    \n#ifdef _WIN32\n    ::ftime( &(vtkTimerLog::FirstWallTime) );\n#else\n    gettimeofday( &(vtkTimerLog::FirstWallTime), NULL );\n    times(&FirstCpuTicks);\n#endif\n    \n    vtkTimerLog::TimerLog[0].WallTime = 0.0;\n    vtkTimerLog::TimerLog[0].CpuTicks = 0;\n    strncpy(vtkTimerLog::TimerLog[0].Event, event, strsize);\n    vtkTimerLog::TimerLog[0].Event[strsize] = '\\0';\n    vtkTimerLog::NextEntry = 1;\n    return;\n    }\n  \n#ifdef _WIN32\n  static double scale = 1.0\/1000.0;\n  ::ftime( &(vtkTimerLog::CurrentWallTime) );\n  time_diff  =  vtkTimerLog::CurrentWallTime.time - vtkTimerLog::FirstWallTime.time;\n  time_diff += \n    (vtkTimerLog::CurrentWallTime.millitm\n     - vtkTimerLog::FirstWallTime.millitm) * scale;\n  ticks_diff = 0;\n#else\n  static double scale = 1.0\/1000000.0;\n  gettimeofday( &(vtkTimerLog::CurrentWallTime), NULL );\n  time_diff  =  vtkTimerLog::CurrentWallTime.tv_sec\n    - vtkTimerLog::FirstWallTime.tv_sec;\n  time_diff += \n    (vtkTimerLog::CurrentWallTime.tv_usec\n     - vtkTimerLog::FirstWallTime.tv_usec) * scale;\n\n  times(&CurrentCpuTicks);\n  ticks_diff = (CurrentCpuTicks.tms_utime + CurrentCpuTicks.tms_stime) -\n                (FirstCpuTicks.tms_utime + FirstCpuTicks.tms_stime);\n#endif\n\n  vtkTimerLog::TimerLog[vtkTimerLog::NextEntry].WallTime = (float)time_diff;\n  vtkTimerLog::TimerLog[vtkTimerLog::NextEntry].CpuTicks = ticks_diff;\n  strncpy(vtkTimerLog::TimerLog[vtkTimerLog::NextEntry].Event, event, strsize);\n  vtkTimerLog::TimerLog[vtkTimerLog::NextEntry].Event[strsize] = '\\0';\n\n  vtkTimerLog::NextEntry++;\n  if (vtkTimerLog::NextEntry == vtkTimerLog::MaxEntries)\n    {\n    vtkTimerLog::NextEntry = 0;\n    vtkTimerLog::WrapFlag = 1;\n    }\n}\n\n\n\/\/ Write the timing table out to a file.  Calculate some helpful\n\/\/ statistics (deltas and  percentages) in the process.\nvoid vtkTimerLog::DumpLog(char *filename)\n{\n  ofstream os(filename);\n  int i;\n  \n  os << \" Entry   Wall Time (sec)  Delta   CPU Time (sec)  Delta  %CPU   Event\\n\";\n  os << \"----------------------------------------------------------------------\\n\";\n  \n  if ( vtkTimerLog::WrapFlag )\n    {\n    vtkTimerLog::DumpEntry(os, 0,\n\t\t    vtkTimerLog::TimerLog[vtkTimerLog::NextEntry].WallTime, 0,\n\t\t    vtkTimerLog::TimerLog[vtkTimerLog::NextEntry].CpuTicks, 0,\n\t\t    vtkTimerLog::TimerLog[vtkTimerLog::NextEntry].Event);\n    for (i=vtkTimerLog::NextEntry+1; i<vtkTimerLog::MaxEntries; i++)\n      {\n      vtkTimerLog::DumpEntry(os,\n\t\ti-vtkTimerLog::NextEntry, vtkTimerLog::TimerLog[i].WallTime,\n\t\tvtkTimerLog::TimerLog[i].WallTime\n\t\t - vtkTimerLog::TimerLog[i-1].WallTime,\n                vtkTimerLog::TimerLog[i].CpuTicks,\n\t\tvtkTimerLog::TimerLog[i].CpuTicks\n\t\t - vtkTimerLog::TimerLog[i-1].CpuTicks,\n                vtkTimerLog::TimerLog[i].Event);\n      }\n    vtkTimerLog::DumpEntry(os, vtkTimerLog::MaxEntries-vtkTimerLog::NextEntry,\n\t\t    vtkTimerLog::TimerLog[0].WallTime,\n\t\t    vtkTimerLog::TimerLog[0].WallTime\n\t            -vtkTimerLog::TimerLog[vtkTimerLog::MaxEntries-1].WallTime,\n\t\t    vtkTimerLog::TimerLog[0].CpuTicks,\n\t\t    vtkTimerLog::TimerLog[0].CpuTicks\n\t\t    -vtkTimerLog::TimerLog[vtkTimerLog::MaxEntries-1].CpuTicks,\n\t\t    vtkTimerLog::TimerLog[0].Event);\n    for (i=1; i<vtkTimerLog::NextEntry; i++)\n      {\n      vtkTimerLog::DumpEntry(os, vtkTimerLog::MaxEntries-vtkTimerLog::NextEntry+i,\n\t\t      vtkTimerLog::TimerLog[i].WallTime,\n\t\t      vtkTimerLog::TimerLog[i].WallTime\n\t\t      - vtkTimerLog::TimerLog[i-1].WallTime,\n\t\t      vtkTimerLog::TimerLog[i].CpuTicks,\n\t\t      vtkTimerLog::TimerLog[i].CpuTicks\n\t\t      - vtkTimerLog::TimerLog[i-1].CpuTicks,\n\t\t      vtkTimerLog::TimerLog[i].Event);\n      }\n    }\n  else\n    {\n    vtkTimerLog::DumpEntry(os, 0, vtkTimerLog::TimerLog[0].WallTime, 0,\n\t\t    vtkTimerLog::TimerLog[0].CpuTicks, 0,\n\t\t    vtkTimerLog::TimerLog[0].Event);\n    for (i=1; i<vtkTimerLog::NextEntry; i++)\n      {\n      vtkTimerLog::DumpEntry(os, i, vtkTimerLog::TimerLog[i].WallTime,\n\t\t      vtkTimerLog::TimerLog[i].WallTime\n\t\t      - vtkTimerLog::TimerLog[i-1].WallTime,\n\t\t      vtkTimerLog::TimerLog[i].CpuTicks,\n\t\t      vtkTimerLog::TimerLog[i].CpuTicks\n\t\t      - vtkTimerLog::TimerLog[i-1].CpuTicks,\n\t\t      vtkTimerLog::TimerLog[i].Event);\n      }\n    }\n  \n  os.close();\n}\n\n\n\/\/ Print method for vtkTimerLog.\nvoid vtkTimerLog::PrintSelf(ostream& os, vtkIndent indent)\n{\n  int i;\n\n  vtkObject::PrintSelf(os, indent);\n\n  os << indent << \"MaxEntries: \" << vtkTimerLog::MaxEntries << \"\\n\";\n  os << indent << \"NextEntry: \" << vtkTimerLog::NextEntry << \"\\n\";\n  os << indent << \"WrapFlag: \" << vtkTimerLog::WrapFlag << \"\\n\";\n  os << indent << \"TicksPerSecond: \" << vtkTimerLog::TicksPerSecond << \"\\n\";\n  os << \"\\n\";\n\n  os << indent << \"Entry \\tWall Time\\tCpuTicks\\tEvent\\n\";\n  os << indent << \"----------------------------------------------\\n\";\n\n  if ( vtkTimerLog::WrapFlag )\n    {\n    for (i=vtkTimerLog::NextEntry; i<vtkTimerLog::MaxEntries; i++)\n      {\n      os << indent << i << \"\\t\\t\" << TimerLog[i].WallTime << \"\\t\\t\" << \n\tTimerLog[i].CpuTicks << \"\\t\\t\" << TimerLog[i].Event << \"\\n\";\n      }\n    }\n  \n  for (i=0; i<vtkTimerLog::NextEntry; i++)\n    {\n    os << indent << i << \"\\t\\t\" << TimerLog[i].WallTime << \"\\t\\t\" << \n      TimerLog[i].CpuTicks << \"\\t\\t\" << TimerLog[i].Event << \"\\n\";\n    }\n  \n  os << \"\\n\" << indent << \"StartTime: \" << this->StartTime << \"\\n\";\n  os << indent << \"WrapFlag: \" << vtkTimerLog::WrapFlag << \"\\n\";\n}\n\n\n\/\/ Methods to support simple timer functionality, separate from\n\/\/ timer table logging.\n\n\/\/ Returns the elapsed number of seconds since January 1, 1970. This\n\/\/ is also called Universal Coordinated Time.\ndouble vtkTimerLog::GetCurrentTime()\n{\n  double currentTimeInSeconds;\n\n#ifdef _WIN32\n  timeb CurrentTime;\n  static double scale = 1.0\/1000.0;\n  ::ftime( &CurrentTime );\n  currentTimeInSeconds = CurrentTime.time + scale * CurrentTime.millitm;\n#else\n  timeval CurrentTime;\n  static double scale = 1.0\/1000000.0;\n  gettimeofday( &CurrentTime, NULL );\n  currentTimeInSeconds = CurrentTime.tv_sec + scale * CurrentTime.tv_usec;\n#endif\n\n  return (currentTimeInSeconds);\n}\n\ndouble vtkTimerLog::GetCPUTime()\n{\n  double   currentCPUTime;\n\n  currentCPUTime = (double)clock() \/ (double)CLOCKS_PER_SEC;\n\n  return currentCPUTime;\n}\n\n\/\/ Set the StartTime to the current time. Used with GetElapsedTime().\nvoid vtkTimerLog::StartTimer()\n{\n  this->StartTime = vtkTimerLog::GetCurrentTime();\n}\n\n\/\/ Sets EndTime to the current time. Used with GetElapsedTime().\nvoid vtkTimerLog::StopTimer()\n{\n  this->EndTime = vtkTimerLog::GetCurrentTime();\n}\n\n\/\/ Returns the difference between StartTime and EndTime as \n\/\/ a floating point value indicating the elapsed time in seconds.\ndouble vtkTimerLog::GetElapsedTime()\n{\n  return (this->EndTime - this->StartTime);\n}\n\nvoid vtkTimerLog::DumpEntry(ostream& os, int index, float time, \n\t\t\t    float deltatime,\n\t\t\t    int tick, int deltatick, char *event)\n{\n  os << index << \"   \"\n     << time << \"  \"\n     << deltatime << \"   \"\n     << (float)tick\/vtkTimerLog::TicksPerSecond << \"  \"\n     << (float)deltatick\/vtkTimerLog::TicksPerSecond << \"  \";\n  if (deltatime == 0.0)\n    {\n    os << \"0.0   \";\n    }\n  else\n    {\n    os << 100.0*deltatick\/vtkTimerLog::TicksPerSecond\/deltatime << \"   \";\n    }\n  os << event << \"\\n\";\n}\n\nvoid vtkTimerLog::SetMaxEntries(int a)\n{\n  vtkTimerLog::MaxEntries = a;\n}\n\nint vtkTimerLog::GetMaxEntries()\n{\n  return vtkTimerLog::MaxEntries;\n}\n<commit_msg>PORT: time -> ttime.<commit_after>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkTimerLog.cxx\n  Language:  C++\n  Date:      $Date$\n  Version:   $Revision$\n\n\nCopyright (c) 1993-1998 Ken Martin, Will Schroeder, Bill Lorensen.\n\nThis software is copyrighted by Ken Martin, Will Schroeder and Bill Lorensen.\nThe following terms apply to all files associated with the software unless\nexplicitly disclaimed in individual files. This copyright specifically does\nnot apply to the related textbook \"The Visualization Toolkit\" ISBN\n013199837-4 published by Prentice Hall which is covered by its own copyright.\n\nThe authors hereby grant permission to use, copy, and distribute this\nsoftware and its documentation for any purpose, provided that existing\ncopyright notices are retained in all copies and that this notice is included\nverbatim in any distributions. Additionally, the authors grant permission to\nmodify this software and its documentation for any purpose, provided that\nsuch modifications are not distributed without the explicit consent of the\nauthors and that existing copyright notices are retained in all copies. Some\nof the algorithms implemented by this software are patented, observe all\napplicable patent law.\n\nIN NO EVENT SHALL THE AUTHORS OR DISTRIBUTORS BE LIABLE TO ANY PARTY FOR\nDIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT\nOF THE USE OF THIS SOFTWARE, ITS DOCUMENTATION, OR ANY DERIVATIVES THEREOF,\nEVEN IF THE AUTHORS HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\nTHE AUTHORS AND DISTRIBUTORS SPECIFICALLY DISCLAIM ANY WARRANTIES, INCLUDING,\nBUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\nPARTICULAR PURPOSE, AND NON-INFRINGEMENT.  THIS SOFTWARE IS PROVIDED ON AN\n\"AS IS\" BASIS, AND THE AUTHORS AND DISTRIBUTORS HAVE NO OBLIGATION TO PROVIDE\nMAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.\n\n\n=========================================================================*\/\n\/\/ .NAME vtkTimerLog - Maintains timing table for performance analysis\n\/\/ .SECTION Description\n\/\/ vtkTimerLog contains walltime and cputime measurements associated\n\/\/ with a given event.  These results can be later analyzed when\n\/\/ \"dumping out\" the table.\n\/\/\n\/\/ In addition, vtkTimerLog allows the user to simply get the current\n\/\/ time, and to start\/stop a simple timer separate from the timing\n\/\/ table logging.\n\n#include \"vtkTimerLog.h\"\n#ifndef _WIN32\n#include <limits.h>     \/\/ for CLK_TCK\n#endif\n\n#include <time.h>\n\n\/\/ initialze the class variables\nint vtkTimerLog::MaxEntries = 100;\nint vtkTimerLog::NextEntry = 0;\nint vtkTimerLog::WrapFlag = 0;\nvtkTimerLogEntry *vtkTimerLog::TimerLog = NULL;\n\n#ifdef CLK_TCK\nint vtkTimerLog::TicksPerSecond = CLK_TCK;\n#else\nint vtkTimerLog::TicksPerSecond = 60;\n#endif\n\n#ifndef CLOCKS_PER_SEC\n#define CLOCKS_PER_SEC (vtkTimerLog::TicksPerSecond)\n#endif\n\n\n#ifdef _WIN32\ntimeb vtkTimerLog::FirstWallTime;\ntimeb vtkTimerLog::CurrentWallTime;\n#else\ntimeval vtkTimerLog::FirstWallTime;\ntimeval vtkTimerLog::CurrentWallTime;\ntms     vtkTimerLog::FirstCpuTicks;\ntms     vtkTimerLog::CurrentCpuTicks;\n#endif\n\n\/\/ Allocate timing table with MaxEntries elements.\nvoid vtkTimerLog::AllocateLog()\n{\n  if (vtkTimerLog::TimerLog != NULL)\n    {\n    delete [] vtkTimerLog::TimerLog;\n    }\n  vtkTimerLog::TimerLog = new vtkTimerLogEntry[vtkTimerLog::MaxEntries];\n}\n\n\n\/\/ Clear the timing table.  walltime and cputime will also be set\n\/\/ to zero when the first new event is recorded.\nvoid vtkTimerLog::ResetLog()\n{\n  vtkTimerLog::WrapFlag = 0;\n  vtkTimerLog::NextEntry = 0;\n  \/\/ may want to free TimerLog to force realloc so\n  \/\/ that user can resize the table by changing MaxEntries.\n}\n\n\n\/\/ Record a timing event.  The event is represented by a formatted\n\/\/ string.\nvoid vtkTimerLog::FormatAndMarkEvent(char *format, ...)\n{\nstatic  char event[4096];\n\n  va_list var_args;\n  va_start(var_args, format);\n  vsprintf(event, format, var_args);\n  va_end(var_args);\n\n  vtkTimerLog::MarkEvent(event);\n}\n\n\n\/\/ Record a timing event and capture walltime and cputicks.\nvoid vtkTimerLog::MarkEvent(char *event)\n{\n  int strsize;\n  double time_diff;\n  int ticks_diff;\n\n  strsize = (strlen(event)) > VTK_LOG_EVENT_LENGTH - 1\n    ? VTK_LOG_EVENT_LENGTH-1 : strlen(event);\n\n  \/\/ If this the first event we're recording, allocate the\n  \/\/ internal timing table and initialize WallTime and CpuTicks\n  \/\/ for this first event to zero.\n  if (vtkTimerLog::NextEntry == 0 && ! vtkTimerLog::WrapFlag)\n    {\n    if (vtkTimerLog::TimerLog == NULL)\n      {\n      vtkTimerLog::AllocateLog();\n      }\n    \n#ifdef _WIN32\n    ::ftime( &(vtkTimerLog::FirstWallTime) );\n#else\n    gettimeofday( &(vtkTimerLog::FirstWallTime), NULL );\n    times(&FirstCpuTicks);\n#endif\n    \n    vtkTimerLog::TimerLog[0].WallTime = 0.0;\n    vtkTimerLog::TimerLog[0].CpuTicks = 0;\n    strncpy(vtkTimerLog::TimerLog[0].Event, event, strsize);\n    vtkTimerLog::TimerLog[0].Event[strsize] = '\\0';\n    vtkTimerLog::NextEntry = 1;\n    return;\n    }\n  \n#ifdef _WIN32\n  static double scale = 1.0\/1000.0;\n  ::ftime( &(vtkTimerLog::CurrentWallTime) );\n  time_diff  =  vtkTimerLog::CurrentWallTime.time - vtkTimerLog::FirstWallTime.time;\n  time_diff += \n    (vtkTimerLog::CurrentWallTime.millitm\n     - vtkTimerLog::FirstWallTime.millitm) * scale;\n  ticks_diff = 0;\n#else\n  static double scale = 1.0\/1000000.0;\n  gettimeofday( &(vtkTimerLog::CurrentWallTime), NULL );\n  time_diff  =  vtkTimerLog::CurrentWallTime.tv_sec\n    - vtkTimerLog::FirstWallTime.tv_sec;\n  time_diff += \n    (vtkTimerLog::CurrentWallTime.tv_usec\n     - vtkTimerLog::FirstWallTime.tv_usec) * scale;\n\n  times(&CurrentCpuTicks);\n  ticks_diff = (CurrentCpuTicks.tms_utime + CurrentCpuTicks.tms_stime) -\n                (FirstCpuTicks.tms_utime + FirstCpuTicks.tms_stime);\n#endif\n\n  vtkTimerLog::TimerLog[vtkTimerLog::NextEntry].WallTime = (float)time_diff;\n  vtkTimerLog::TimerLog[vtkTimerLog::NextEntry].CpuTicks = ticks_diff;\n  strncpy(vtkTimerLog::TimerLog[vtkTimerLog::NextEntry].Event, event, strsize);\n  vtkTimerLog::TimerLog[vtkTimerLog::NextEntry].Event[strsize] = '\\0';\n\n  vtkTimerLog::NextEntry++;\n  if (vtkTimerLog::NextEntry == vtkTimerLog::MaxEntries)\n    {\n    vtkTimerLog::NextEntry = 0;\n    vtkTimerLog::WrapFlag = 1;\n    }\n}\n\n\n\/\/ Write the timing table out to a file.  Calculate some helpful\n\/\/ statistics (deltas and  percentages) in the process.\nvoid vtkTimerLog::DumpLog(char *filename)\n{\n  ofstream os(filename);\n  int i;\n  \n  os << \" Entry   Wall Time (sec)  Delta   CPU Time (sec)  Delta  %CPU   Event\\n\";\n  os << \"----------------------------------------------------------------------\\n\";\n  \n  if ( vtkTimerLog::WrapFlag )\n    {\n    vtkTimerLog::DumpEntry(os, 0,\n\t\t    vtkTimerLog::TimerLog[vtkTimerLog::NextEntry].WallTime, 0,\n\t\t    vtkTimerLog::TimerLog[vtkTimerLog::NextEntry].CpuTicks, 0,\n\t\t    vtkTimerLog::TimerLog[vtkTimerLog::NextEntry].Event);\n    for (i=vtkTimerLog::NextEntry+1; i<vtkTimerLog::MaxEntries; i++)\n      {\n      vtkTimerLog::DumpEntry(os,\n\t\ti-vtkTimerLog::NextEntry, vtkTimerLog::TimerLog[i].WallTime,\n\t\tvtkTimerLog::TimerLog[i].WallTime\n\t\t - vtkTimerLog::TimerLog[i-1].WallTime,\n                vtkTimerLog::TimerLog[i].CpuTicks,\n\t\tvtkTimerLog::TimerLog[i].CpuTicks\n\t\t - vtkTimerLog::TimerLog[i-1].CpuTicks,\n                vtkTimerLog::TimerLog[i].Event);\n      }\n    vtkTimerLog::DumpEntry(os, vtkTimerLog::MaxEntries-vtkTimerLog::NextEntry,\n\t\t    vtkTimerLog::TimerLog[0].WallTime,\n\t\t    vtkTimerLog::TimerLog[0].WallTime\n\t            -vtkTimerLog::TimerLog[vtkTimerLog::MaxEntries-1].WallTime,\n\t\t    vtkTimerLog::TimerLog[0].CpuTicks,\n\t\t    vtkTimerLog::TimerLog[0].CpuTicks\n\t\t    -vtkTimerLog::TimerLog[vtkTimerLog::MaxEntries-1].CpuTicks,\n\t\t    vtkTimerLog::TimerLog[0].Event);\n    for (i=1; i<vtkTimerLog::NextEntry; i++)\n      {\n      vtkTimerLog::DumpEntry(os, vtkTimerLog::MaxEntries-vtkTimerLog::NextEntry+i,\n\t\t      vtkTimerLog::TimerLog[i].WallTime,\n\t\t      vtkTimerLog::TimerLog[i].WallTime\n\t\t      - vtkTimerLog::TimerLog[i-1].WallTime,\n\t\t      vtkTimerLog::TimerLog[i].CpuTicks,\n\t\t      vtkTimerLog::TimerLog[i].CpuTicks\n\t\t      - vtkTimerLog::TimerLog[i-1].CpuTicks,\n\t\t      vtkTimerLog::TimerLog[i].Event);\n      }\n    }\n  else\n    {\n    vtkTimerLog::DumpEntry(os, 0, vtkTimerLog::TimerLog[0].WallTime, 0,\n\t\t    vtkTimerLog::TimerLog[0].CpuTicks, 0,\n\t\t    vtkTimerLog::TimerLog[0].Event);\n    for (i=1; i<vtkTimerLog::NextEntry; i++)\n      {\n      vtkTimerLog::DumpEntry(os, i, vtkTimerLog::TimerLog[i].WallTime,\n\t\t      vtkTimerLog::TimerLog[i].WallTime\n\t\t      - vtkTimerLog::TimerLog[i-1].WallTime,\n\t\t      vtkTimerLog::TimerLog[i].CpuTicks,\n\t\t      vtkTimerLog::TimerLog[i].CpuTicks\n\t\t      - vtkTimerLog::TimerLog[i-1].CpuTicks,\n\t\t      vtkTimerLog::TimerLog[i].Event);\n      }\n    }\n  \n  os.close();\n}\n\n\n\/\/ Print method for vtkTimerLog.\nvoid vtkTimerLog::PrintSelf(ostream& os, vtkIndent indent)\n{\n  int i;\n\n  vtkObject::PrintSelf(os, indent);\n\n  os << indent << \"MaxEntries: \" << vtkTimerLog::MaxEntries << \"\\n\";\n  os << indent << \"NextEntry: \" << vtkTimerLog::NextEntry << \"\\n\";\n  os << indent << \"WrapFlag: \" << vtkTimerLog::WrapFlag << \"\\n\";\n  os << indent << \"TicksPerSecond: \" << vtkTimerLog::TicksPerSecond << \"\\n\";\n  os << \"\\n\";\n\n  os << indent << \"Entry \\tWall Time\\tCpuTicks\\tEvent\\n\";\n  os << indent << \"----------------------------------------------\\n\";\n\n  if ( vtkTimerLog::WrapFlag )\n    {\n    for (i=vtkTimerLog::NextEntry; i<vtkTimerLog::MaxEntries; i++)\n      {\n      os << indent << i << \"\\t\\t\" << TimerLog[i].WallTime << \"\\t\\t\" << \n\tTimerLog[i].CpuTicks << \"\\t\\t\" << TimerLog[i].Event << \"\\n\";\n      }\n    }\n  \n  for (i=0; i<vtkTimerLog::NextEntry; i++)\n    {\n    os << indent << i << \"\\t\\t\" << TimerLog[i].WallTime << \"\\t\\t\" << \n      TimerLog[i].CpuTicks << \"\\t\\t\" << TimerLog[i].Event << \"\\n\";\n    }\n  \n  os << \"\\n\" << indent << \"StartTime: \" << this->StartTime << \"\\n\";\n  os << indent << \"WrapFlag: \" << vtkTimerLog::WrapFlag << \"\\n\";\n}\n\n\n\/\/ Methods to support simple timer functionality, separate from\n\/\/ timer table logging.\n\n\/\/ Returns the elapsed number of seconds since January 1, 1970. This\n\/\/ is also called Universal Coordinated Time.\ndouble vtkTimerLog::GetCurrentTime()\n{\n  double currentTimeInSeconds;\n\n#ifdef _WIN32\n  timeb CurrentTime;\n  static double scale = 1.0\/1000.0;\n  ::ftime( &CurrentTime );\n  currentTimeInSeconds = CurrentTime.time + scale * CurrentTime.millitm;\n#else\n  timeval CurrentTime;\n  static double scale = 1.0\/1000000.0;\n  gettimeofday( &CurrentTime, NULL );\n  currentTimeInSeconds = CurrentTime.tv_sec + scale * CurrentTime.tv_usec;\n#endif\n\n  return (currentTimeInSeconds);\n}\n\ndouble vtkTimerLog::GetCPUTime()\n{\n  double   currentCPUTime;\n\n  currentCPUTime = (double)clock() \/ (double)CLOCKS_PER_SEC;\n\n  return currentCPUTime;\n}\n\n\/\/ Set the StartTime to the current time. Used with GetElapsedTime().\nvoid vtkTimerLog::StartTimer()\n{\n  this->StartTime = vtkTimerLog::GetCurrentTime();\n}\n\n\/\/ Sets EndTime to the current time. Used with GetElapsedTime().\nvoid vtkTimerLog::StopTimer()\n{\n  this->EndTime = vtkTimerLog::GetCurrentTime();\n}\n\n\/\/ Returns the difference between StartTime and EndTime as \n\/\/ a floating point value indicating the elapsed time in seconds.\ndouble vtkTimerLog::GetElapsedTime()\n{\n  return (this->EndTime - this->StartTime);\n}\n\nvoid vtkTimerLog::DumpEntry(ostream& os, int index, float ttime, \n\t\t\t    float deltatime,\n\t\t\t    int tick, int deltatick, char *event)\n{\n  os << index << \"   \"\n     << ttime << \"  \"\n     << deltatime << \"   \"\n     << (float)tick\/vtkTimerLog::TicksPerSecond << \"  \"\n     << (float)deltatick\/vtkTimerLog::TicksPerSecond << \"  \";\n  if (deltatime == 0.0)\n    {\n    os << \"0.0   \";\n    }\n  else\n    {\n    os << 100.0*deltatick\/vtkTimerLog::TicksPerSecond\/deltatime << \"   \";\n    }\n  os << event << \"\\n\";\n}\n\nvoid vtkTimerLog::SetMaxEntries(int a)\n{\n  vtkTimerLog::MaxEntries = a;\n}\n\nint vtkTimerLog::GetMaxEntries()\n{\n  return vtkTimerLog::MaxEntries;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *   This file only:\n *     Copyright (C) 2003  Mark Bucciarelli <mark@hubcapconsutling.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\n *      Free Software Foundation, Inc.\n *      51 Franklin Street, Fifth Floor\n *      Boston, MA  02110-1301  USA.\n *\n *\/\n\n\/\/ #include <iostream>\n\n#include <QDateTime>\n#include <q3paintdevicemetrics.h>\n#include <QPainter>\n#include <QMap>\n#include <QList>\n\n#include <kglobal.h>\n#include <kdebug.h>\n#include <klocale.h>            \/\/ i18n\n#include <kcal\/event.h>\n\n#include \"karmutility.h\"        \/\/ formatTime()\n#include \"reportcriteria.h\"     \/\/ settings the user gave in the export dialog\n#include \"timekard.h\"\n#include \"task.h\"\n#include \"taskview.h\"\n#include <assert.h>\n\nconst int taskWidth = 40;\nconst int timeWidth = 6;\nconst int totalTimeWidth = 7;\nconst int reportWidth = taskWidth + timeWidth;\n\nconst QString cr = QString::fromLatin1(\"\\n\");\n\nQString TimeKard::totalsAsText(TaskView* taskview, ReportCriteria rc)\n{\n  QString retval;\n  QString line;\n  QString buf;\n  long sum;\n  bool justThisTask=!rc.allTasks;\n\n  line.fill('-', reportWidth);\n  line += cr;\n\n  \/\/ header\n  retval += i18n(\"Task Totals\") + cr;\n  retval += KGlobal::locale()->formatDateTime(QDateTime::currentDateTime());\n  retval += cr + cr;\n  retval += QString(QString::fromLatin1(\"%1    %2\"))\n    .arg(i18n(\"Time\"), timeWidth)\n    .arg(i18n(\"Task\"));\n  retval += cr;\n  retval += line;\n\n  \/\/ tasks\n  if (taskview->current_item())\n  {\n    if (justThisTask)\n    {\n      if (!rc.sessionTimes) sum = taskview->current_item()->totalTime();\n      else sum = taskview->current_item()->totalSessionTime();\n      printTask(taskview->current_item(), retval, 0, rc);\n    }\n    else \/\/ print all tasks\n    {\n      sum = 0;\n      for (Task* task= taskview->current_item(); task;\n          task= task->nextSibling())\n      {\n        if (!rc.sessionTimes) sum += task->totalTime();\n        else sum += task->totalSessionTime();\n        if ( (task->totalTime() && (!rc.sessionTimes)) || (task->totalSessionTime() && rc.sessionTimes) )\n          printTask(task, retval, 0, rc);\n      }\n    }\n\n    \/\/ total\n    buf.fill('-', reportWidth);\n    retval += QString(QString::fromLatin1(\"%1\")).arg(buf, timeWidth) + cr;\n    retval += QString(QString::fromLatin1(\"%1 %2\"))\n      .arg(formatTime(sum),timeWidth)\n      .arg(i18n(\"Total\"));\n  }\n  else\n    retval += i18n(\"No tasks.\");\n\n  return retval;\n}\n\n\/\/ Print out \"<indent for level> <task total> <task>\", for task and subtasks. Used by totalsAsText.\nvoid TimeKard::printTask(Task *task, QString &s, int level, const ReportCriteria &rc)\n{\n  QString buf;\n\n  s += buf.fill(' ', level);\n  if (!rc.sessionTimes)\n  {\n    s += QString(QString::fromLatin1(\"%1    %2\"))\n      .arg(formatTime(task->totalTime()), timeWidth)\n      .arg(task->name());\n  }\n  else \/\/ print session times\n  {\n    s += QString(QString::fromLatin1(\"%1    %2\"))\n      .arg(formatTime(task->totalSessionTime()), timeWidth)\n      .arg(task->name());\n  }\n  s += cr;\n\n  for (Task* subTask = task->firstChild();\n      subTask;\n      subTask = subTask->nextSibling())\n  {\n    if ( !rc.sessionTimes )\n    {\n      if ( subTask->totalTime() ) \/\/ to avoid 00:00 entries\n        printTask(subTask, s, level+1, rc);\n    }\n    else\n    {\n      if ( subTask->totalSessionTime() ) \/\/ to avoid 00:00 entries\n        printTask(subTask, s, level+1, rc);\n    }\n  }\n}\n\nvoid TimeKard::printTaskHistory(const Task *task,\n    const QMap<QString,long>& taskdaytotals,\n    QMap<QString,long>& daytotals,\n    const QDate& from,\n    const QDate& to,\n    const int level, QString& s, bool totalsOnly)\n{\n  long sectionsum = 0;\n  for ( QDate day = from; day <= to; day = day.addDays(1) )\n  {\n    QString daykey = day.toString(QString::fromLatin1(\"yyyyMMdd\"));\n    QString daytaskkey = QString::fromLatin1(\"%1_%2\")\n                         .arg(daykey)\n                         .arg(task->uid());\n\n    if (taskdaytotals.contains(daytaskkey))\n    {\n      if ( !totalsOnly )\n      {\n        s += QString::fromLatin1(\"%1\")\n             .arg(formatTime(taskdaytotals[daytaskkey]\/60), timeWidth);\n      }\n      sectionsum += taskdaytotals[daytaskkey];  \/\/ in seconds\n\n      if (daytotals.contains(daykey))\n        daytotals.insert(daykey, daytotals[daykey] + taskdaytotals[daytaskkey]);\n      else\n        daytotals.insert(daykey, taskdaytotals[daytaskkey]);\n    }\n    else if ( !totalsOnly )\n    {\n      QString buf;\n      buf.fill(' ', timeWidth);\n      s += buf;\n    }\n  }\n\n  \/\/ Total for task this section (e.g. week)\n  s += QString::fromLatin1(\"%1\").arg(formatTime(sectionsum\/60), totalTimeWidth);\n\n  \/\/ Task name\n  QString buf;\n  s += buf.fill(' ', level + 1);\n  s += QString::fromLatin1(\"%1\").arg(task->name());\n  s += cr;\n\n  for (Task* subTask = task->firstChild();\n      subTask;\n      subTask = subTask->nextSibling())\n  {\n    \/\/ recursive\n    printTaskHistory(subTask, taskdaytotals, daytotals, from, to, level+1, s, totalsOnly);\n  }\n}\n\nQString TimeKard::sectionHistoryAsText(\n  TaskView* taskview,\n  const QDate& sectionFrom, const QDate& sectionTo,\n  const QDate& from, const QDate& to,\n  const QString& name,\n  bool justThisTask, bool totalsOnly)\n{\n\n  const int sectionReportWidth = taskWidth + ( totalsOnly ? 0 : sectionFrom.daysTo(sectionTo) * timeWidth ) + totalTimeWidth;\n  assert( sectionReportWidth > 0 );\n  QString line;\n  line.fill('-', sectionReportWidth);\n  line += cr;\n\n  QList<HistoryEvent> events;\n  if ( sectionFrom < from && sectionTo > to)\n  {\n    events = taskview->getHistory(from, to);\n  }\n  else if ( sectionFrom < from )\n  {\n    events = taskview->getHistory(from, sectionTo);\n  }\n  else if ( sectionTo > to)\n  {\n    events = taskview->getHistory(sectionFrom, to);\n  }\n  else\n  {\n    events = taskview->getHistory(sectionFrom, sectionTo);\n  }\n\n  QMap<QString, long> taskdaytotals;\n  QMap<QString, long> daytotals;\n\n  \/\/ Build lookup dictionary used to output data in table cells.  keys are\n  \/\/ in this format: YYYYMMDD_NNNNNN, where Y = year, M = month, d = day and\n  \/\/ NNNNN = the VTODO uid.  The value is the total seconds logged against\n  \/\/ that task on that day.  Note the UID is the todo id, not the event id,\n  \/\/ so times are accumulated for each task.\n  for (QList<HistoryEvent>::iterator event = events.begin(); event != events.end(); ++event)\n  {\n    QString daykey = (*event).start().date().toString(QString::fromLatin1(\"yyyyMMdd\"));\n    QString daytaskkey = QString::fromLatin1(\"%1_%2\")\n                         .arg(daykey)\n                         .arg((*event).todoUid());\n\n    if (taskdaytotals.contains(daytaskkey))\n      taskdaytotals.insert(daytaskkey,\n                            taskdaytotals[daytaskkey] + (*event).duration());\n    else\n      taskdaytotals.insert(daytaskkey, (*event).duration());\n  }\n\n  QString retval;\n  \/\/ section name (e.g. week name)\n  retval += cr + cr;\n  QString buf;\n  if ( name.length() < sectionReportWidth )\n    buf.fill(' ', int((sectionReportWidth - name.length()) \/ 2));\n  retval += buf + name + cr;\n\n  if ( !totalsOnly )\n  {\n    \/\/ day headings\n    for (QDate day = sectionFrom; day <= sectionTo; day = day.addDays(1))\n    {\n      retval += QString::fromLatin1(\"%1\").arg(day.day(), timeWidth);\n    }\n    retval += cr;\n    retval += line;\n  }\n\n  \/\/ the tasks\n  if (events.empty())\n  {\n    retval += \"  \";\n    retval += i18n(\"No hours logged.\");\n  }\n  else\n  {\n    if (justThisTask)\n    {\n      printTaskHistory(taskview->current_item(), taskdaytotals, daytotals,\n                       sectionFrom, sectionTo, 0, retval, totalsOnly);\n    }\n    else\n    {\n      for (Task* task= taskview->current_item(); task;\n           task= task->nextSibling())\n      {\n        printTaskHistory(task, taskdaytotals, daytotals,\n                         sectionFrom, sectionTo, 0, retval, totalsOnly);\n      }\n    }\n    retval += line;\n\n    \/\/ per-day totals at the bottom of the section\n    long sum = 0;\n    for (QDate day = sectionFrom; day <= sectionTo; day = day.addDays(1))\n    {\n      QString daykey = day.toString(QString::fromLatin1(\"yyyyMMdd\"));\n\n      if (daytotals.contains(daykey))\n      {\n        if ( !totalsOnly )\n        {\n          retval += QString::fromLatin1(\"%1\")\n                    .arg(formatTime(daytotals[daykey]\/60), timeWidth);\n        }\n        sum += daytotals[daykey];  \/\/ in seconds\n      }\n      else if ( !totalsOnly )\n      {\n        buf.fill(' ', timeWidth);\n        retval += buf;\n      }\n    }\n\n    retval += QString::fromLatin1(\"%1 %2\")\n              .arg(formatTime(sum\/60), totalTimeWidth)\n              .arg(i18n(\"Total\"));\n  }\n  return retval;\n}\n\nQString TimeKard::historyAsText(TaskView* taskview, const QDate& from,\n    const QDate& to, bool justThisTask, bool perWeek, bool totalsOnly)\n{\n  \/\/ header\n  QString retval;\n  retval += totalsOnly ? i18n(\"Task Totals\") : i18n(\"Task History\");\n  retval += cr;\n  retval += i18n(\"From %1 to %2\",\n     KGlobal::locale()->formatDate(from),\n     KGlobal::locale()->formatDate(to));\n  retval += cr;\n  retval += i18n(\"Printed on: %1\",\n     KGlobal::locale()->formatDateTime(QDateTime::currentDateTime()));\n\n  if ( perWeek )\n  {\n    \/\/ output one time card table for each week in the date range\n    QList<Week> weeks = Week::weeksFromDateRange(from, to);\n    for (QList<Week>::iterator week = weeks.begin(); week != weeks.end(); ++week)\n    {\n      retval += sectionHistoryAsText( taskview, (*week).start(), (*week).end(), from, to, (*week).name(), justThisTask, totalsOnly );\n    }\n  } else\n  {\n    retval += sectionHistoryAsText( taskview, from, to, from, to, \"\", justThisTask, totalsOnly );\n  }\n  return retval;\n}\n\nWeek::Week() {}\n\nWeek::Week(QDate from)\n{\n  _start = from;\n}\n\nQDate Week::start() const\n{\n  return _start;\n}\n\nQDate Week::end() const\n{\n  return _start.addDays(6);\n}\n\nQString Week::name() const\n{\n  return i18n(\"Week of %1\", KGlobal::locale()->formatDate(start()));\n}\n\nQList<Week> Week::weeksFromDateRange(const QDate& from, const QDate& to)\n{\n  QDate start;\n  QList<Week> weeks;\n\n  \/\/ The QDate weekNumber() method always puts monday as the first day of the\n  \/\/ week.\n  \/\/\n  \/\/ Not that it matters here, but week 1 always includes the first Thursday\n  \/\/ of the year.  For example, January 1, 2000 was a Saturday, so\n  \/\/ QDate(2000,1,1).weekNumber() returns 52.\n\n  \/\/ Since report always shows a full week, we generate a full week of dates,\n  \/\/ even if from and to are the same date.  The week starts on the day\n  \/\/ that is set in the locale settings.\n  start = from.addDays(\n      -((7 - KGlobal::locale()->weekStartDay() + from.dayOfWeek()) % 7));\n\n  for (QDate d = start; d <= to; d = d.addDays(7))\n    weeks.append(Week(d));\n\n  return weeks;\n}\n\n<commit_msg>Copy all total times to clipboard, not only some. CCBUGS:137309<commit_after>\/*\n *   This file only:\n *     Copyright (C) 2003  Mark Bucciarelli <mark@hubcapconsutling.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\n *      Free Software Foundation, Inc.\n *      51 Franklin Street, Fifth Floor\n *      Boston, MA  02110-1301  USA.\n *\n *\/\n\n\/\/ #include <iostream>\n\n#include <QDateTime>\n#include <q3paintdevicemetrics.h>\n#include <QPainter>\n#include <QMap>\n#include <QList>\n\n#include <kglobal.h>\n#include <kdebug.h>\n#include <klocale.h>            \/\/ i18n\n#include <kcal\/event.h>\n\n#include \"karmutility.h\"        \/\/ formatTime()\n#include \"reportcriteria.h\"     \/\/ settings the user gave in the export dialog\n#include \"timekard.h\"\n#include \"task.h\"\n#include \"taskview.h\"\n#include <assert.h>\n\nconst int taskWidth = 40;\nconst int timeWidth = 6;\nconst int totalTimeWidth = 7;\nconst int reportWidth = taskWidth + timeWidth;\n\nconst QString cr = QString::fromLatin1(\"\\n\");\n\nQString TimeKard::totalsAsText(TaskView* taskview, ReportCriteria rc)\n{\n  kDebug(5970) << \"Entering TimeKard::totalsAsText\" << endl;\n  QString retval;\n  QString line;\n  QString buf;\n  long sum;\n  bool justThisTask=!rc.allTasks;\n\n  line.fill('-', reportWidth);\n  line += cr;\n\n  \/\/ header\n  retval += i18n(\"Task Totals\") + cr;\n  retval += KGlobal::locale()->formatDateTime(QDateTime::currentDateTime());\n  retval += cr + cr;\n  retval += QString(QString::fromLatin1(\"%1    %2\"))\n    .arg(i18n(\"Time\"), timeWidth)\n    .arg(i18n(\"Task\"));\n  retval += cr;\n  retval += line;\n\n  \/\/ tasks\n  if (taskview->current_item())\n  {\n    if (justThisTask)\n    {\n      if (!rc.sessionTimes) sum = taskview->current_item()->totalTime();\n      else sum = taskview->current_item()->totalSessionTime();\n      printTask(taskview->current_item(), retval, 0, rc);\n    }\n    else \/\/ print all tasks\n    {\n      sum = 0;\n      for (Task* task= taskview->item_at_index(0); task;\n          task= task->nextSibling())\n      {\n        if (!rc.sessionTimes) sum += task->totalTime();\n        else sum += task->totalSessionTime();\n        if ( (task->totalTime() && (!rc.sessionTimes)) || (task->totalSessionTime() && rc.sessionTimes) )\n          printTask(task, retval, 0, rc);\n      }\n    }\n\n    \/\/ total\n    buf.fill('-', reportWidth);\n    retval += QString(QString::fromLatin1(\"%1\")).arg(buf, timeWidth) + cr;\n    retval += QString(QString::fromLatin1(\"%1 %2\"))\n      .arg(formatTime(sum),timeWidth)\n      .arg(i18n(\"Total\"));\n  }\n  else\n    retval += i18n(\"No tasks.\");\n\n  return retval;\n}\n\n\/\/ Print out \"<indent for level> <task total> <task>\", for task and subtasks. Used by totalsAsText.\nvoid TimeKard::printTask(Task *task, QString &s, int level, const ReportCriteria &rc)\n{\n  kDebug(5970) << \"Entering TimeKard::printTask\" << endl;\n  QString buf;\n\n  s += buf.fill(' ', level);\n  if (!rc.sessionTimes)\n  {\n    s += QString(QString::fromLatin1(\"%1    %2\"))\n      .arg(formatTime(task->totalTime()), timeWidth)\n      .arg(task->name());\n  }\n  else \/\/ print session times\n  {\n    s += QString(QString::fromLatin1(\"%1    %2\"))\n      .arg(formatTime(task->totalSessionTime()), timeWidth)\n      .arg(task->name());\n  }\n  s += cr;\n\n  for (Task* subTask = task->firstChild();\n      subTask;\n      subTask = subTask->nextSibling())\n  {\n    if ( !rc.sessionTimes )\n    {\n      if ( subTask->totalTime() ) \/\/ to avoid 00:00 entries\n        printTask(subTask, s, level+1, rc);\n    }\n    else\n    {\n      if ( subTask->totalSessionTime() ) \/\/ to avoid 00:00 entries\n        printTask(subTask, s, level+1, rc);\n    }\n  }\n}\n\nvoid TimeKard::printTaskHistory(const Task *task,\n    const QMap<QString,long>& taskdaytotals,\n    QMap<QString,long>& daytotals,\n    const QDate& from,\n    const QDate& to,\n    const int level, QString& s, bool totalsOnly)\n{\n  kDebug(5970) << \"Entering TimeKard::printTaskHistory\" << endl;\n  long sectionsum = 0;\n  for ( QDate day = from; day <= to; day = day.addDays(1) )\n  {\n    QString daykey = day.toString(QString::fromLatin1(\"yyyyMMdd\"));\n    QString daytaskkey = QString::fromLatin1(\"%1_%2\")\n                         .arg(daykey)\n                         .arg(task->uid());\n\n    if (taskdaytotals.contains(daytaskkey))\n    {\n      if ( !totalsOnly )\n      {\n        s += QString::fromLatin1(\"%1\")\n             .arg(formatTime(taskdaytotals[daytaskkey]\/60), timeWidth);\n      }\n      sectionsum += taskdaytotals[daytaskkey];  \/\/ in seconds\n\n      if (daytotals.contains(daykey))\n        daytotals.insert(daykey, daytotals[daykey] + taskdaytotals[daytaskkey]);\n      else\n        daytotals.insert(daykey, taskdaytotals[daytaskkey]);\n    }\n    else if ( !totalsOnly )\n    {\n      QString buf;\n      buf.fill(' ', timeWidth);\n      s += buf;\n    }\n  }\n\n  \/\/ Total for task this section (e.g. week)\n  s += QString::fromLatin1(\"%1\").arg(formatTime(sectionsum\/60), totalTimeWidth);\n\n  \/\/ Task name\n  QString buf;\n  s += buf.fill(' ', level + 1);\n  s += QString::fromLatin1(\"%1\").arg(task->name());\n  s += cr;\n\n  for (Task* subTask = task->firstChild();\n      subTask;\n      subTask = subTask->nextSibling())\n  {\n    \/\/ recursive\n    printTaskHistory(subTask, taskdaytotals, daytotals, from, to, level+1, s, totalsOnly);\n  }\n}\n\nQString TimeKard::sectionHistoryAsText(\n  TaskView* taskview,\n  const QDate& sectionFrom, const QDate& sectionTo,\n  const QDate& from, const QDate& to,\n  const QString& name,\n  bool justThisTask, bool totalsOnly)\n{\n  kDebug(5970) << \"Entering TimeKard::sectionHistoryAsText\" << endl;\n  const int sectionReportWidth = taskWidth + ( totalsOnly ? 0 : sectionFrom.daysTo(sectionTo) * timeWidth ) + totalTimeWidth;\n  assert( sectionReportWidth > 0 );\n  QString line;\n  line.fill('-', sectionReportWidth);\n  line += cr;\n\n  QList<HistoryEvent> events;\n  if ( sectionFrom < from && sectionTo > to)\n  {\n    events = taskview->getHistory(from, to);\n  }\n  else if ( sectionFrom < from )\n  {\n    events = taskview->getHistory(from, sectionTo);\n  }\n  else if ( sectionTo > to)\n  {\n    events = taskview->getHistory(sectionFrom, to);\n  }\n  else\n  {\n    events = taskview->getHistory(sectionFrom, sectionTo);\n  }\n\n  QMap<QString, long> taskdaytotals;\n  QMap<QString, long> daytotals;\n\n  \/\/ Build lookup dictionary used to output data in table cells.  keys are\n  \/\/ in this format: YYYYMMDD_NNNNNN, where Y = year, M = month, d = day and\n  \/\/ NNNNN = the VTODO uid.  The value is the total seconds logged against\n  \/\/ that task on that day.  Note the UID is the todo id, not the event id,\n  \/\/ so times are accumulated for each task.\n  for (QList<HistoryEvent>::iterator event = events.begin(); event != events.end(); ++event)\n  {\n    QString daykey = (*event).start().date().toString(QString::fromLatin1(\"yyyyMMdd\"));\n    QString daytaskkey = QString::fromLatin1(\"%1_%2\")\n                         .arg(daykey)\n                         .arg((*event).todoUid());\n\n    if (taskdaytotals.contains(daytaskkey))\n      taskdaytotals.insert(daytaskkey,\n                            taskdaytotals[daytaskkey] + (*event).duration());\n    else\n      taskdaytotals.insert(daytaskkey, (*event).duration());\n  }\n\n  QString retval;\n  \/\/ section name (e.g. week name)\n  retval += cr + cr;\n  QString buf;\n  if ( name.length() < sectionReportWidth )\n    buf.fill(' ', int((sectionReportWidth - name.length()) \/ 2));\n  retval += buf + name + cr;\n\n  if ( !totalsOnly )\n  {\n    \/\/ day headings\n    for (QDate day = sectionFrom; day <= sectionTo; day = day.addDays(1))\n    {\n      retval += QString::fromLatin1(\"%1\").arg(day.day(), timeWidth);\n    }\n    retval += cr;\n    retval += line;\n  }\n\n  \/\/ the tasks\n  if (events.empty())\n  {\n    retval += \"  \";\n    retval += i18n(\"No hours logged.\");\n  }\n  else\n  {\n    if (justThisTask)\n    {\n      printTaskHistory(taskview->current_item(), taskdaytotals, daytotals,\n                       sectionFrom, sectionTo, 0, retval, totalsOnly);\n    }\n    else\n    {\n      for (Task* task= taskview->current_item(); task;\n           task= task->nextSibling())\n      {\n        printTaskHistory(task, taskdaytotals, daytotals,\n                         sectionFrom, sectionTo, 0, retval, totalsOnly);\n      }\n    }\n    retval += line;\n\n    \/\/ per-day totals at the bottom of the section\n    long sum = 0;\n    for (QDate day = sectionFrom; day <= sectionTo; day = day.addDays(1))\n    {\n      QString daykey = day.toString(QString::fromLatin1(\"yyyyMMdd\"));\n\n      if (daytotals.contains(daykey))\n      {\n        if ( !totalsOnly )\n        {\n          retval += QString::fromLatin1(\"%1\")\n                    .arg(formatTime(daytotals[daykey]\/60), timeWidth);\n        }\n        sum += daytotals[daykey];  \/\/ in seconds\n      }\n      else if ( !totalsOnly )\n      {\n        buf.fill(' ', timeWidth);\n        retval += buf;\n      }\n    }\n\n    retval += QString::fromLatin1(\"%1 %2\")\n              .arg(formatTime(sum\/60), totalTimeWidth)\n              .arg(i18n(\"Total\"));\n  }\n  return retval;\n}\n\nQString TimeKard::historyAsText(TaskView* taskview, const QDate& from,\n    const QDate& to, bool justThisTask, bool perWeek, bool totalsOnly)\n{\n  kDebug(5970) << \"Entering TimeKard::historyAsText\" << endl;\n  \/\/ header\n  QString retval;\n  retval += totalsOnly ? i18n(\"Task Totals\") : i18n(\"Task History\");\n  retval += cr;\n  retval += i18n(\"From %1 to %2\",\n     KGlobal::locale()->formatDate(from),\n     KGlobal::locale()->formatDate(to));\n  retval += cr;\n  retval += i18n(\"Printed on: %1\",\n     KGlobal::locale()->formatDateTime(QDateTime::currentDateTime()));\n\n  if ( perWeek )\n  {\n    \/\/ output one time card table for each week in the date range\n    QList<Week> weeks = Week::weeksFromDateRange(from, to);\n    for (QList<Week>::iterator week = weeks.begin(); week != weeks.end(); ++week)\n    {\n      retval += sectionHistoryAsText( taskview, (*week).start(), (*week).end(), from, to, (*week).name(), justThisTask, totalsOnly );\n    }\n  } else\n  {\n    retval += sectionHistoryAsText( taskview, from, to, from, to, \"\", justThisTask, totalsOnly );\n  }\n  return retval;\n}\n\nWeek::Week() {}\n\nWeek::Week(QDate from)\n{\n  _start = from;\n}\n\nQDate Week::start() const\n{\n  return _start;\n}\n\nQDate Week::end() const\n{\n  return _start.addDays(6);\n}\n\nQString Week::name() const\n{\n  return i18n(\"Week of %1\", KGlobal::locale()->formatDate(start()));\n}\n\nQList<Week> Week::weeksFromDateRange(const QDate& from, const QDate& to)\n{\n  QDate start;\n  QList<Week> weeks;\n\n  \/\/ The QDate weekNumber() method always puts monday as the first day of the\n  \/\/ week.\n  \/\/\n  \/\/ Not that it matters here, but week 1 always includes the first Thursday\n  \/\/ of the year.  For example, January 1, 2000 was a Saturday, so\n  \/\/ QDate(2000,1,1).weekNumber() returns 52.\n\n  \/\/ Since report always shows a full week, we generate a full week of dates,\n  \/\/ even if from and to are the same date.  The week starts on the day\n  \/\/ that is set in the locale settings.\n  start = from.addDays(\n      -((7 - KGlobal::locale()->weekStartDay() + from.dayOfWeek()) % 7));\n\n  for (QDate d = start; d <= to; d = d.addDays(7))\n    weeks.append(Week(d));\n\n  return weeks;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n  Copyright(C) 2020  Sutou Kouhei <kou@clear-code.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\n  This library is distributed in the hope that it will be useful,\n  but WITHOUT ANY WARRANTY; without even the implied warranty of\n  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n  Lesser General Public License for more details.\n\n  You should have received 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 <cstring>\n\n#include \"grn.h\"\n#include \"grn_str.h\"\n#include \"grn_token_column.h\"\n#include \"grn_token_cursor.h\"\n\n#ifdef GRN_WITH_APACHE_ARROW\n# include \"grn_arrow.hpp\"\n# include <arrow\/util\/thread_pool.h>\n# include <mutex>\n#endif\n\nnamespace grn {\n  namespace token_column {\n    static uint32_t parallel_chunk_size = 1024;\n    static uint32_t parallel_table_size_threshold = parallel_chunk_size * 10;\n\n    class Builder\n    {\n    public:\n      Builder(grn_ctx *ctx,\n              grn_obj *column)\n        : ctx_(ctx),\n          column_(column),\n          with_weight_(grn_column_get_flags(ctx_, column_) &\n                       GRN_OBJ_WITH_WEIGHT),\n          table_(grn_ctx_at(ctx, column->header.domain)),\n          lexicon_(grn_ctx_at(ctx, DB_OBJ(column)->range)),\n          source_(NULL) {\n        grn_id *source_ids = static_cast<grn_id *>(DB_OBJ(column)->source);\n        source_ = grn_ctx_at(ctx, source_ids[0]);\n      }\n\n      ~Builder() {\n        grn_obj_unref(ctx_, source_);\n        grn_obj_unref(ctx_, lexicon_);\n        grn_obj_unref(ctx_, table_);\n      }\n\n      void\n      build() {\n        grn_obj_set_visibility(ctx_, column_, false);\n        if (use_parallel()) {\n          build_parallel();\n        } else {\n          build_sequential();\n        }\n        grn_obj_set_visibility(ctx_, column_, true);\n      }\n\n    private:\n      bool\n      use_parallel() {\n#ifdef GRN_WITH_APACHE_ARROW\n        return grn_table_size(ctx_, table_) >= parallel_table_size_threshold;\n#else\n        return false;\n#endif\n      }\n\n      void\n      build_parallel() {\n#ifdef GRN_WITH_APACHE_ARROW\n        std::mutex mutex;\n        auto pool = ::arrow::internal::GetCpuThreadPool();\n        uint32_t token_cursor_flags = GRN_TOKEN_CURSOR_PARALLEL;\n        grn_obj *db = grn_ctx_db(ctx_);\n        uint32_t chunk_size = parallel_chunk_size;\n        auto build_chunk = [&](std::vector<grn_id> ids) {\n          grn_ctx ctx;\n          grn_ctx_init(&ctx, 0);\n          grn_ctx_use(&ctx, db);\n          grn_obj tokens;\n          grn_obj value;\n          GRN_RECORD_INIT(&tokens, GRN_OBJ_VECTOR, DB_OBJ(lexicon_)->id);\n          if (with_weight_) {\n            tokens.header.flags |= GRN_OBJ_WITH_WEIGHT;\n          }\n          GRN_VOID_INIT(&value);\n          for (auto id : ids) {\n            GRN_BULK_REWIND(&tokens);\n            GRN_BULK_REWIND(&value);\n            grn_obj_get_value(&ctx, source_, id, &value);\n            if (GRN_TEXT_LEN(&value) > 0) {\n              auto token_cursor = grn_token_cursor_open(&ctx,\n                                                        lexicon_,\n                                                        GRN_BULK_HEAD(&value),\n                                                        GRN_BULK_VSIZE(&value),\n                                                        GRN_TOKEN_ADD,\n                                                        token_cursor_flags);\n              if (token_cursor) {\n                grn_token_cursor_set_source_column(&ctx, token_cursor, source_);\n                grn_token_cursor_set_source_id(&ctx, token_cursor, id);\n                grn_token_cursor_set_index_column(&ctx, token_cursor, column_);\n                while (token_cursor->status == GRN_TOKEN_CURSOR_DOING) {\n                  grn_id token_id = grn_token_cursor_next(&ctx, token_cursor);\n                  if (token_id == GRN_ID_NIL) {\n                    break;\n                  }\n                  if (with_weight_) {\n                    grn_token *token =\n                      grn_token_cursor_get_token(&ctx, token_cursor);\n                    float weight = grn_token_get_weight(&ctx, token);\n                    grn_uvector_add_element_record(&ctx,\n                                                   &tokens,\n                                                   token_id,\n                                                   weight);\n                  } else {\n                    GRN_RECORD_PUT(&ctx, &tokens, token_id);\n                  }\n                }\n                grn_token_cursor_close(&ctx, token_cursor);\n              }\n            }\n            grn_obj_set_value(&ctx, column_, id, &tokens, GRN_OBJ_SET);\n            if (ctx.rc != GRN_SUCCESS) {\n              break;\n            }\n          }\n          GRN_OBJ_FIN(&ctx, &value);\n          GRN_OBJ_FIN(&ctx, &tokens);\n          if (ctx.rc != GRN_SUCCESS) {\n            std::lock_guard<std::mutex> lock(mutex);\n            if (ctx_->rc == GRN_SUCCESS) {\n              ctx_->rc = ctx.rc;\n              ctx_->errlvl = ctx.errlvl;\n              ctx_->errfile = ctx.errfile;\n              ctx_->errline = ctx.errline;\n              ctx_->errfunc = ctx.errfunc;\n              grn_strcpy(ctx_->errbuf, GRN_CTX_MSGSIZE, ctx.errbuf);\n            }\n          }\n          grn_ctx_fin(&ctx);\n          return ::arrow::Status::OK();\n        };\n\n        std::vector<grn_id> ids;\n# if ARROW_VERSION_MAJOR >= 3\n        std::vector<::arrow::Future<>> futures;\n# else\n        std::vector<::arrow::Future<::arrow::Status>> futures;\n# endif\n        GRN_TABLE_EACH_BEGIN_FLAGS(ctx_, table_, cursor, id, GRN_CURSOR_BY_ID) {\n          ids.push_back(id);\n          if (ids.size() == chunk_size) {\n            auto future = pool->Submit(build_chunk, ids);\n            if (!grnarrow::check(ctx_,\n                                 future,\n                                 \"[token-column][build][parallel] \"\n                                 \"failed to submit a job\")) {\n              break;\n            }\n            futures.push_back(*future);\n            ids.clear();\n          }\n        } GRN_TABLE_EACH_END(ctx_, cursor);\n        if (ctx_->rc == GRN_SUCCESS && !ids.empty()) {\n          auto future = pool->Submit(build_chunk, ids);\n          if (grnarrow::check(ctx_,\n                              future,\n                              \"[token-column][build][parallel] \"\n                              \"failed to submit a job\")) {\n            futures.push_back(*future);\n          }\n        }\n        auto status = ::arrow::Status::OK();\n        for (auto& future : futures) {\n          status &= future.status();\n        }\n        grnarrow::check(ctx_,\n                        status,\n                        \"[token-column][build][parallel] \"\n                        \"failed to complete a job\");\n#endif\n      }\n\n      void\n      build_sequential() {\n        grn_obj tokens;\n        grn_obj value;\n        GRN_RECORD_INIT(&tokens, GRN_OBJ_VECTOR, DB_OBJ(lexicon_)->id);\n        if (with_weight_) {\n          tokens.header.flags |= GRN_OBJ_WITH_WEIGHT;\n        }\n        GRN_VOID_INIT(&value);\n        const unsigned int token_flags = 0;\n        GRN_TABLE_EACH_BEGIN_FLAGS(ctx_, table_, cursor, id, GRN_CURSOR_BY_ID) {\n          GRN_BULK_REWIND(&tokens);\n          GRN_BULK_REWIND(&value);\n          grn_obj_get_value(ctx_, source_, id, &value);\n          if (GRN_BULK_VSIZE(&value) > 0) {\n            grn_token_cursor *token_cursor =\n              grn_token_cursor_open(ctx_,\n                                    lexicon_,\n                                    GRN_BULK_HEAD(&value),\n                                    GRN_BULK_VSIZE(&value),\n                                    GRN_TOKEN_ADD,\n                                    token_flags);\n            if (token_cursor) {\n              grn_token_cursor_set_source_column(ctx_, token_cursor, source_);\n              grn_token_cursor_set_source_id(ctx_, token_cursor, id);\n              grn_token_cursor_set_index_column(ctx_, token_cursor, column_);\n              while (token_cursor->status == GRN_TOKEN_CURSOR_DOING) {\n                grn_id token_id = grn_token_cursor_next(ctx_, token_cursor);\n                if (token_id == GRN_ID_NIL) {\n                  break;\n                }\n                if (with_weight_) {\n                  grn_token *token =\n                    grn_token_cursor_get_token(ctx_, token_cursor);\n                  float weight = grn_token_get_weight(ctx_, token);\n                  grn_uvector_add_element_record(ctx_,\n                                                 &tokens,\n                                                 token_id,\n                                                 weight);\n                } else {\n                  GRN_RECORD_PUT(ctx_, &tokens, token_id);\n                }\n              }\n              grn_token_cursor_close(ctx_, token_cursor);\n            }\n          }\n          grn_obj_set_value(ctx_, column_, id, &tokens, GRN_OBJ_SET);\n          if (ctx_->rc != GRN_SUCCESS) {\n            break;\n          }\n        } GRN_TABLE_EACH_END(ctx_, cursor);\n        GRN_OBJ_FIN(ctx_, &value);\n        GRN_OBJ_FIN(ctx_, &tokens);\n      }\n\n      grn_ctx *ctx_;\n      grn_obj *column_;\n      bool with_weight_;\n      grn_obj *table_;\n      grn_obj *lexicon_;\n      grn_obj *source_;\n    };\n  }\n}\n\nextern \"C\" {\n  void\n  grn_token_column_init_from_env(void)\n  {\n    {\n      char grn_token_column_parallel_chunk_size_env[GRN_ENV_BUFFER_SIZE];\n      grn_getenv(\"GRN_TOKEN_COLUMN_PARALLEL_CHUNK_SIZE\",\n                 grn_token_column_parallel_chunk_size_env,\n                 GRN_ENV_BUFFER_SIZE);\n      if (grn_token_column_parallel_chunk_size_env[0]) {\n        size_t env_len = strlen(grn_token_column_parallel_chunk_size_env);\n        uint32_t chunk_size =\n          grn_atoui(grn_token_column_parallel_chunk_size_env,\n                    grn_token_column_parallel_chunk_size_env + env_len,\n                    NULL);\n        if (chunk_size > 0) {\n          grn::token_column::parallel_chunk_size = chunk_size;\n        }\n      }\n    }\n\n    {\n      char grn_token_column_parallel_table_size_threshold_env[GRN_ENV_BUFFER_SIZE];\n      grn_getenv(\"GRN_TOKEN_COLUMN_PARALLEL_TABLE_SIZE_THRESHOLD\",\n                 grn_token_column_parallel_table_size_threshold_env,\n                 GRN_ENV_BUFFER_SIZE);\n      if (grn_token_column_parallel_table_size_threshold_env[0]) {\n        size_t env_len =\n          strlen(grn_token_column_parallel_table_size_threshold_env);\n        uint32_t threshold =\n          grn_atoui(grn_token_column_parallel_table_size_threshold_env,\n                    grn_token_column_parallel_table_size_threshold_env + env_len,\n                    NULL);\n        if (threshold > 0) {\n          grn::token_column::parallel_table_size_threshold = threshold;\n        }\n      }\n    }\n  }\n\n  void\n  grn_token_column_update(grn_ctx *ctx,\n                          grn_obj *column,\n                          grn_id id,\n                          int section,\n                          grn_obj *old_value,\n                          grn_obj *new_value)\n  {\n    grn_obj *lexicon = grn_ctx_at(ctx, DB_OBJ(column)->range);\n    grn_obj tokens;\n    GRN_RECORD_INIT(&tokens, GRN_OBJ_VECTOR, DB_OBJ(lexicon)->id);\n    unsigned int token_flags = 0;\n    grn_token_cursor *token_cursor =\n      grn_token_cursor_open(ctx,\n                            lexicon,\n                            GRN_TEXT_VALUE(new_value),\n                            GRN_TEXT_LEN(new_value),\n                            GRN_TOKEN_ADD,\n                            token_flags);\n    if (token_cursor) {\n      while (token_cursor->status == GRN_TOKEN_CURSOR_DOING) {\n        grn_id token_id = grn_token_cursor_next(ctx, token_cursor);\n        if (token_id == GRN_ID_NIL) {\n          break;\n        }\n        GRN_RECORD_PUT(ctx, &tokens, token_id);\n      }\n      grn_token_cursor_close(ctx, token_cursor);\n    }\n    grn_obj_set_value(ctx, column, id, &tokens, GRN_OBJ_SET);\n    GRN_OBJ_FIN(ctx, &tokens);\n    grn_obj_unref(ctx, lexicon);\n  }\n\n  void\n  grn_token_column_build(grn_ctx *ctx, grn_obj *column)\n  {\n    grn::token_column::Builder builder(ctx, column);\n    builder.build();\n  }\n}\n<commit_msg>grn_token_column_update: don't tokenizer for empty new value<commit_after>\/*\n  Copyright(C) 2020  Sutou Kouhei <kou@clear-code.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\n  This library is distributed in the hope that it will be useful,\n  but WITHOUT ANY WARRANTY; without even the implied warranty of\n  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n  Lesser General Public License for more details.\n\n  You should have received 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 <cstring>\n\n#include \"grn.h\"\n#include \"grn_str.h\"\n#include \"grn_token_column.h\"\n#include \"grn_token_cursor.h\"\n\n#ifdef GRN_WITH_APACHE_ARROW\n# include \"grn_arrow.hpp\"\n# include <arrow\/util\/thread_pool.h>\n# include <mutex>\n#endif\n\nnamespace grn {\n  namespace token_column {\n    static uint32_t parallel_chunk_size = 1024;\n    static uint32_t parallel_table_size_threshold = parallel_chunk_size * 10;\n\n    class Builder\n    {\n    public:\n      Builder(grn_ctx *ctx,\n              grn_obj *column)\n        : ctx_(ctx),\n          column_(column),\n          with_weight_(grn_column_get_flags(ctx_, column_) &\n                       GRN_OBJ_WITH_WEIGHT),\n          table_(grn_ctx_at(ctx, column->header.domain)),\n          lexicon_(grn_ctx_at(ctx, DB_OBJ(column)->range)),\n          source_(NULL) {\n        grn_id *source_ids = static_cast<grn_id *>(DB_OBJ(column)->source);\n        source_ = grn_ctx_at(ctx, source_ids[0]);\n      }\n\n      ~Builder() {\n        grn_obj_unref(ctx_, source_);\n        grn_obj_unref(ctx_, lexicon_);\n        grn_obj_unref(ctx_, table_);\n      }\n\n      void\n      build() {\n        grn_obj_set_visibility(ctx_, column_, false);\n        if (use_parallel()) {\n          build_parallel();\n        } else {\n          build_sequential();\n        }\n        grn_obj_set_visibility(ctx_, column_, true);\n      }\n\n    private:\n      bool\n      use_parallel() {\n#ifdef GRN_WITH_APACHE_ARROW\n        return grn_table_size(ctx_, table_) >= parallel_table_size_threshold;\n#else\n        return false;\n#endif\n      }\n\n      void\n      build_parallel() {\n#ifdef GRN_WITH_APACHE_ARROW\n        std::mutex mutex;\n        auto pool = ::arrow::internal::GetCpuThreadPool();\n        uint32_t token_cursor_flags = GRN_TOKEN_CURSOR_PARALLEL;\n        grn_obj *db = grn_ctx_db(ctx_);\n        uint32_t chunk_size = parallel_chunk_size;\n        auto build_chunk = [&](std::vector<grn_id> ids) {\n          grn_ctx ctx;\n          grn_ctx_init(&ctx, 0);\n          grn_ctx_use(&ctx, db);\n          grn_obj tokens;\n          grn_obj value;\n          GRN_RECORD_INIT(&tokens, GRN_OBJ_VECTOR, DB_OBJ(lexicon_)->id);\n          if (with_weight_) {\n            tokens.header.flags |= GRN_OBJ_WITH_WEIGHT;\n          }\n          GRN_VOID_INIT(&value);\n          for (auto id : ids) {\n            GRN_BULK_REWIND(&tokens);\n            GRN_BULK_REWIND(&value);\n            grn_obj_get_value(&ctx, source_, id, &value);\n            if (GRN_TEXT_LEN(&value) > 0) {\n              auto token_cursor = grn_token_cursor_open(&ctx,\n                                                        lexicon_,\n                                                        GRN_BULK_HEAD(&value),\n                                                        GRN_BULK_VSIZE(&value),\n                                                        GRN_TOKEN_ADD,\n                                                        token_cursor_flags);\n              if (token_cursor) {\n                grn_token_cursor_set_source_column(&ctx, token_cursor, source_);\n                grn_token_cursor_set_source_id(&ctx, token_cursor, id);\n                grn_token_cursor_set_index_column(&ctx, token_cursor, column_);\n                while (token_cursor->status == GRN_TOKEN_CURSOR_DOING) {\n                  grn_id token_id = grn_token_cursor_next(&ctx, token_cursor);\n                  if (token_id == GRN_ID_NIL) {\n                    break;\n                  }\n                  if (with_weight_) {\n                    grn_token *token =\n                      grn_token_cursor_get_token(&ctx, token_cursor);\n                    float weight = grn_token_get_weight(&ctx, token);\n                    grn_uvector_add_element_record(&ctx,\n                                                   &tokens,\n                                                   token_id,\n                                                   weight);\n                  } else {\n                    GRN_RECORD_PUT(&ctx, &tokens, token_id);\n                  }\n                }\n                grn_token_cursor_close(&ctx, token_cursor);\n              }\n            }\n            grn_obj_set_value(&ctx, column_, id, &tokens, GRN_OBJ_SET);\n            if (ctx.rc != GRN_SUCCESS) {\n              break;\n            }\n          }\n          GRN_OBJ_FIN(&ctx, &value);\n          GRN_OBJ_FIN(&ctx, &tokens);\n          if (ctx.rc != GRN_SUCCESS) {\n            std::lock_guard<std::mutex> lock(mutex);\n            if (ctx_->rc == GRN_SUCCESS) {\n              ctx_->rc = ctx.rc;\n              ctx_->errlvl = ctx.errlvl;\n              ctx_->errfile = ctx.errfile;\n              ctx_->errline = ctx.errline;\n              ctx_->errfunc = ctx.errfunc;\n              grn_strcpy(ctx_->errbuf, GRN_CTX_MSGSIZE, ctx.errbuf);\n            }\n          }\n          grn_ctx_fin(&ctx);\n          return ::arrow::Status::OK();\n        };\n\n        std::vector<grn_id> ids;\n# if ARROW_VERSION_MAJOR >= 3\n        std::vector<::arrow::Future<>> futures;\n# else\n        std::vector<::arrow::Future<::arrow::Status>> futures;\n# endif\n        GRN_TABLE_EACH_BEGIN_FLAGS(ctx_, table_, cursor, id, GRN_CURSOR_BY_ID) {\n          ids.push_back(id);\n          if (ids.size() == chunk_size) {\n            auto future = pool->Submit(build_chunk, ids);\n            if (!grnarrow::check(ctx_,\n                                 future,\n                                 \"[token-column][build][parallel] \"\n                                 \"failed to submit a job\")) {\n              break;\n            }\n            futures.push_back(*future);\n            ids.clear();\n          }\n        } GRN_TABLE_EACH_END(ctx_, cursor);\n        if (ctx_->rc == GRN_SUCCESS && !ids.empty()) {\n          auto future = pool->Submit(build_chunk, ids);\n          if (grnarrow::check(ctx_,\n                              future,\n                              \"[token-column][build][parallel] \"\n                              \"failed to submit a job\")) {\n            futures.push_back(*future);\n          }\n        }\n        auto status = ::arrow::Status::OK();\n        for (auto& future : futures) {\n          status &= future.status();\n        }\n        grnarrow::check(ctx_,\n                        status,\n                        \"[token-column][build][parallel] \"\n                        \"failed to complete a job\");\n#endif\n      }\n\n      void\n      build_sequential() {\n        grn_obj tokens;\n        grn_obj value;\n        GRN_RECORD_INIT(&tokens, GRN_OBJ_VECTOR, DB_OBJ(lexicon_)->id);\n        if (with_weight_) {\n          tokens.header.flags |= GRN_OBJ_WITH_WEIGHT;\n        }\n        GRN_VOID_INIT(&value);\n        const unsigned int token_flags = 0;\n        GRN_TABLE_EACH_BEGIN_FLAGS(ctx_, table_, cursor, id, GRN_CURSOR_BY_ID) {\n          GRN_BULK_REWIND(&tokens);\n          GRN_BULK_REWIND(&value);\n          grn_obj_get_value(ctx_, source_, id, &value);\n          if (GRN_BULK_VSIZE(&value) > 0) {\n            grn_token_cursor *token_cursor =\n              grn_token_cursor_open(ctx_,\n                                    lexicon_,\n                                    GRN_BULK_HEAD(&value),\n                                    GRN_BULK_VSIZE(&value),\n                                    GRN_TOKEN_ADD,\n                                    token_flags);\n            if (token_cursor) {\n              grn_token_cursor_set_source_column(ctx_, token_cursor, source_);\n              grn_token_cursor_set_source_id(ctx_, token_cursor, id);\n              grn_token_cursor_set_index_column(ctx_, token_cursor, column_);\n              while (token_cursor->status == GRN_TOKEN_CURSOR_DOING) {\n                grn_id token_id = grn_token_cursor_next(ctx_, token_cursor);\n                if (token_id == GRN_ID_NIL) {\n                  break;\n                }\n                if (with_weight_) {\n                  grn_token *token =\n                    grn_token_cursor_get_token(ctx_, token_cursor);\n                  float weight = grn_token_get_weight(ctx_, token);\n                  grn_uvector_add_element_record(ctx_,\n                                                 &tokens,\n                                                 token_id,\n                                                 weight);\n                } else {\n                  GRN_RECORD_PUT(ctx_, &tokens, token_id);\n                }\n              }\n              grn_token_cursor_close(ctx_, token_cursor);\n            }\n          }\n          grn_obj_set_value(ctx_, column_, id, &tokens, GRN_OBJ_SET);\n          if (ctx_->rc != GRN_SUCCESS) {\n            break;\n          }\n        } GRN_TABLE_EACH_END(ctx_, cursor);\n        GRN_OBJ_FIN(ctx_, &value);\n        GRN_OBJ_FIN(ctx_, &tokens);\n      }\n\n      grn_ctx *ctx_;\n      grn_obj *column_;\n      bool with_weight_;\n      grn_obj *table_;\n      grn_obj *lexicon_;\n      grn_obj *source_;\n    };\n  }\n}\n\nextern \"C\" {\n  void\n  grn_token_column_init_from_env(void)\n  {\n    {\n      char grn_token_column_parallel_chunk_size_env[GRN_ENV_BUFFER_SIZE];\n      grn_getenv(\"GRN_TOKEN_COLUMN_PARALLEL_CHUNK_SIZE\",\n                 grn_token_column_parallel_chunk_size_env,\n                 GRN_ENV_BUFFER_SIZE);\n      if (grn_token_column_parallel_chunk_size_env[0]) {\n        size_t env_len = strlen(grn_token_column_parallel_chunk_size_env);\n        uint32_t chunk_size =\n          grn_atoui(grn_token_column_parallel_chunk_size_env,\n                    grn_token_column_parallel_chunk_size_env + env_len,\n                    NULL);\n        if (chunk_size > 0) {\n          grn::token_column::parallel_chunk_size = chunk_size;\n        }\n      }\n    }\n\n    {\n      char grn_token_column_parallel_table_size_threshold_env[GRN_ENV_BUFFER_SIZE];\n      grn_getenv(\"GRN_TOKEN_COLUMN_PARALLEL_TABLE_SIZE_THRESHOLD\",\n                 grn_token_column_parallel_table_size_threshold_env,\n                 GRN_ENV_BUFFER_SIZE);\n      if (grn_token_column_parallel_table_size_threshold_env[0]) {\n        size_t env_len =\n          strlen(grn_token_column_parallel_table_size_threshold_env);\n        uint32_t threshold =\n          grn_atoui(grn_token_column_parallel_table_size_threshold_env,\n                    grn_token_column_parallel_table_size_threshold_env + env_len,\n                    NULL);\n        if (threshold > 0) {\n          grn::token_column::parallel_table_size_threshold = threshold;\n        }\n      }\n    }\n  }\n\n  void\n  grn_token_column_update(grn_ctx *ctx,\n                          grn_obj *column,\n                          grn_id id,\n                          int section,\n                          grn_obj *old_value,\n                          grn_obj *new_value)\n  {\n    grn_obj *lexicon = grn_ctx_at(ctx, DB_OBJ(column)->range);\n    grn_obj tokens;\n    GRN_RECORD_INIT(&tokens, GRN_OBJ_VECTOR, DB_OBJ(lexicon)->id);\n    if (GRN_TEXT_LEN(new_value) > 0) {\n      unsigned int token_flags = 0;\n      grn_token_cursor *token_cursor =\n        grn_token_cursor_open(ctx,\n                              lexicon,\n                              GRN_TEXT_VALUE(new_value),\n                              GRN_TEXT_LEN(new_value),\n                              GRN_TOKEN_ADD,\n                              token_flags);\n      if (token_cursor) {\n        while (token_cursor->status == GRN_TOKEN_CURSOR_DOING) {\n          grn_id token_id = grn_token_cursor_next(ctx, token_cursor);\n          if (token_id == GRN_ID_NIL) {\n            break;\n          }\n          GRN_RECORD_PUT(ctx, &tokens, token_id);\n        }\n        grn_token_cursor_close(ctx, token_cursor);\n      }\n    }\n    grn_obj_set_value(ctx, column, id, &tokens, GRN_OBJ_SET);\n    GRN_OBJ_FIN(ctx, &tokens);\n    grn_obj_unref(ctx, lexicon);\n  }\n\n  void\n  grn_token_column_build(grn_ctx *ctx, grn_obj *column)\n  {\n    grn::token_column::Builder builder(ctx, column);\n    builder.build();\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef _SDD_DD_PROTO_NODE_HH_\n#define _SDD_DD_PROTO_NODE_HH_\n\n#include <algorithm>  \/\/ equal, for_each\n#include <functional> \/\/ hash\n#include <iosfwd>\n#include <vector>\n\n#include \"sdd\/dd\/definition.hh\"\n#include \"sdd\/dd\/stack.hh\"\n#include \"sdd\/util\/hash.hh\"\n\nnamespace sdd {\n\n\/*------------------------------------------------------------------------------------------------*\/\n\ntemplate <typename C>\nstruct proto_arc\n{\n  using values_type = typename C::Values;\n  using value_type = typename values_type::value_type;\n  using value_stack_type     = dd::stack<value_type>;\n  using successor_stack_type = dd::stack<sdd_ptr_type<C>>;\n\n  values_type current_values;\n  value_stack_type values;\n  successor_stack_type successors;\n\n  proto_arc(proto_arc&&) = default;\n  proto_arc& operator=(proto_arc&&) = default;\n\n  proto_arc( values_type&& values, value_stack_type&& value_stack\n           , successor_stack_type&& successors_stack)\n    : current_values(std::move(values)), values(std::move(value_stack))\n    , successors(std::move(successors_stack))\n  {}\n};\n\ntemplate <typename C>\ninline\nbool\noperator==(const proto_arc<C>& lhs, const proto_arc<C>& rhs)\nnoexcept\n{\n  return lhs.current_values == rhs.current_values and lhs.values == rhs.values\n     and lhs.successors == rhs.successors;\n}\n\ntemplate <typename C>\ninline\nbool\noperator<(const proto_arc<C>& lhs, const proto_arc<C>& rhs)\nnoexcept\n{\n  if (lhs.current_values < rhs.current_values)\n  {\n    return true;\n  }\n  else if (lhs.current_values == rhs.current_values)\n  {\n    if (lhs.values < rhs.values)\n    {\n      return true;\n    }\n    else if (lhs.values == rhs.values)\n    {\n      return lhs.successors < rhs.successors;\n    }\n    return false;\n  }\n  return false;\n}\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @brief  A non-terminal node in an SDD.\n\/\/\/\n\/\/\/ For the sake of canonicity, a node shall not exist in several locations, thus we prevent\n\/\/\/ its copy. Also, to enforce this canonicity, we need that nodes have always the same\n\/\/\/ address, thus they can't be moved to an other memory location once created.\ntemplate <typename C>\nclass proto_node final\n{\n  \/\/ Can't copy a proto_node.\n  proto_node& operator=(const proto_node&) = delete;\n  proto_node(const proto_node&) = delete;\n\n  \/\/ Can't move a proto_node.\n  proto_node& operator=(proto_node&&) = delete;\n  proto_node(proto_node&&) = delete;\n\npublic:\n\n  \/\/\/ @brief The type of the valuation of this node.\n  using values_type = typename C::Values;\n\n\n  using arcs_type = std::vector<proto_arc<C>>;\n\n\n  \/\/\/ @brief A (const) iterator on the arcs of this node.\n  using const_iterator = typename arcs_type::const_iterator;\n\nprivate:\n\n  const arcs_type arcs_;\n\npublic:\n\n  proto_node(arcs_type&& arcs)\n    : arcs_(std::move(arcs))\n  {}\n\n  \/\/\/ @brief Get the beginning of arcs.\n  \/\/\/\n  \/\/\/ O(1).\n  const_iterator\n  begin()\n  const noexcept\n  {\n    return arcs_.begin();\n  }\n\n  \/\/\/ @brief Get the end of arcs.\n  \/\/\/\n  \/\/\/ O(1).\n  const_iterator\n  end()\n  const noexcept\n  {\n    return arcs_.end();\n  }\n\n  \/\/\/ @brief Get the number of arcs.\n  \/\/\/\n  \/\/\/ O(1).\n  std::size_t\n  size()\n  const noexcept\n  {\n    return arcs_.size();\n  }\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @brief Equality of two proto_node.\n\/\/\/ @related proto_node\n\/\/\/\n\/\/\/ O(1) if nodes don't have the same number of arcs; otherwise O(n) where n is the number of\n\/\/\/ arcs.\ntemplate <typename C>\ninline\nbool\noperator==(const proto_node<C>& lhs, const proto_node<C>& rhs)\nnoexcept\n{\n  return lhs.size() == rhs.size() and std::equal(lhs.begin(), lhs.end(), rhs.begin());\n}\n\n\/\/\/ @brief Export a proto_node to a stream.\n\/\/\/ @related proto_node\ntemplate <typename C>\nstd::ostream&\noperator<<(std::ostream& os, const proto_node<C>& n)\n{\n  os << \"proto_node \" << &n << \":\" << std::endl;\n  for (const auto& arc : n)\n  {\n    os << \"  arc \" << &n << \":\" << std::endl;\n    os << \"    current values: \" << arc.current_values << std::endl;\n    os << \"    values stack: \" << arc.values << std::endl;\n    os << \"    successors stack: |\";\n    for (const auto& successor : arc.successors.elements)\n    {\n      os << &successor << \",\";\n    }\n    os << \"|\";\n  }\n  os << std::endl;\n  for (const auto& arc : n)\n  {\n    for (const auto& successor : arc.successors.elements)\n    {\n      os << successor->data();\n    }\n  }\n  return os << std::endl;\n}\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n} \/\/ namespace sdd\n\nnamespace std {\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @brief Hash specialization for sdd::proto_arc\ntemplate <typename C>\nstruct hash<sdd::proto_arc<C>>\n{\n  std::size_t\n  operator()(const sdd::proto_arc<C>& n)\n  const noexcept \/*(noexcept(???))*\/\n  {\n    std::size_t seed = sdd::util::hash(n.current_values);\n    sdd::util::hash_combine(seed, n.values);\n    sdd::util::hash_combine(seed, n.successors);\n    return seed;\n  }\n};\n\n\/\/\/ @brief Hash specialization for sdd::proto_node\ntemplate <typename C>\nstruct hash<sdd::proto_node<C>>\n{\n  std::size_t\n  operator()(const sdd::proto_node<C>& n)\n  const noexcept(noexcept(sdd::util::hash(n.begin(), n.end())))\n  {\n    return sdd::util::hash(n.begin(), n.end());\n  }\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n} \/\/ namespace std\n\n#endif \/\/ _SDD_DD_PROTO_NODE_HH_\n<commit_msg>Change comparison order of a proto_node.<commit_after>#ifndef _SDD_DD_PROTO_NODE_HH_\n#define _SDD_DD_PROTO_NODE_HH_\n\n#include <algorithm>  \/\/ equal, for_each\n#include <functional> \/\/ hash\n#include <iosfwd>\n#include <vector>\n\n#include \"sdd\/dd\/definition.hh\"\n#include \"sdd\/dd\/stack.hh\"\n#include \"sdd\/util\/hash.hh\"\n\nnamespace sdd {\n\n\/*------------------------------------------------------------------------------------------------*\/\n\ntemplate <typename C>\nstruct proto_arc\n{\n  using values_type = typename C::Values;\n  using value_type = typename values_type::value_type;\n  using value_stack_type     = dd::stack<value_type>;\n  using successor_stack_type = dd::stack<sdd_ptr_type<C>>;\n\n  values_type current_values;\n  value_stack_type values;\n  successor_stack_type successors;\n\n  proto_arc(proto_arc&&) = default;\n  proto_arc& operator=(proto_arc&&) = default;\n\n  proto_arc( values_type&& values, value_stack_type&& value_stack\n           , successor_stack_type&& successors_stack)\n    : current_values(std::move(values)), values(std::move(value_stack))\n    , successors(std::move(successors_stack))\n  {}\n};\n\ntemplate <typename C>\ninline\nbool\noperator==(const proto_arc<C>& lhs, const proto_arc<C>& rhs)\nnoexcept\n{\n  return lhs.current_values == rhs.current_values and lhs.values == rhs.values\n     and lhs.successors == rhs.successors;\n}\n\ntemplate <typename C>\ninline\nbool\noperator<(const proto_arc<C>& lhs, const proto_arc<C>& rhs)\nnoexcept\n{\n  if (lhs.values < rhs.values)\n  {\n    return true;\n  }\n  else if (lhs.values == rhs.values)\n  {\n    if (lhs.successors < rhs.successors)\n    {\n      return true;\n    }\n    else if (lhs.successors == rhs.successors)\n    {\n      return lhs.current_values < rhs.current_values;\n    }\n    return false;\n  }\n  return false;\n}\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @brief  A non-terminal node in an SDD.\n\/\/\/\n\/\/\/ For the sake of canonicity, a node shall not exist in several locations, thus we prevent\n\/\/\/ its copy. Also, to enforce this canonicity, we need that nodes have always the same\n\/\/\/ address, thus they can't be moved to an other memory location once created.\ntemplate <typename C>\nclass proto_node final\n{\n  \/\/ Can't copy a proto_node.\n  proto_node& operator=(const proto_node&) = delete;\n  proto_node(const proto_node&) = delete;\n\n  \/\/ Can't move a proto_node.\n  proto_node& operator=(proto_node&&) = delete;\n  proto_node(proto_node&&) = delete;\n\npublic:\n\n  \/\/\/ @brief The type of the valuation of this node.\n  using values_type = typename C::Values;\n\n\n  using arcs_type = std::vector<proto_arc<C>>;\n\n\n  \/\/\/ @brief A (const) iterator on the arcs of this node.\n  using const_iterator = typename arcs_type::const_iterator;\n\nprivate:\n\n  const arcs_type arcs_;\n\npublic:\n\n  proto_node(arcs_type&& arcs)\n    : arcs_(std::move(arcs))\n  {}\n\n  \/\/\/ @brief Get the beginning of arcs.\n  \/\/\/\n  \/\/\/ O(1).\n  const_iterator\n  begin()\n  const noexcept\n  {\n    return arcs_.begin();\n  }\n\n  \/\/\/ @brief Get the end of arcs.\n  \/\/\/\n  \/\/\/ O(1).\n  const_iterator\n  end()\n  const noexcept\n  {\n    return arcs_.end();\n  }\n\n  \/\/\/ @brief Get the number of arcs.\n  \/\/\/\n  \/\/\/ O(1).\n  std::size_t\n  size()\n  const noexcept\n  {\n    return arcs_.size();\n  }\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @brief Equality of two proto_node.\n\/\/\/ @related proto_node\n\/\/\/\n\/\/\/ O(1) if nodes don't have the same number of arcs; otherwise O(n) where n is the number of\n\/\/\/ arcs.\ntemplate <typename C>\ninline\nbool\noperator==(const proto_node<C>& lhs, const proto_node<C>& rhs)\nnoexcept\n{\n  return lhs.size() == rhs.size() and std::equal(lhs.begin(), lhs.end(), rhs.begin());\n}\n\n\/\/\/ @brief Export a proto_node to a stream.\n\/\/\/ @related proto_node\ntemplate <typename C>\nstd::ostream&\noperator<<(std::ostream& os, const proto_node<C>& n)\n{\n  os << \"proto_node \" << &n << \":\" << std::endl;\n  for (const auto& arc : n)\n  {\n    os << \"  arc \" << &n << \":\" << std::endl;\n    os << \"    current values: \" << arc.current_values << std::endl;\n    os << \"    values stack: \" << arc.values << std::endl;\n    os << \"    successors stack: |\";\n    for (const auto& successor : arc.successors.elements)\n    {\n      os << &successor << \",\";\n    }\n    os << \"|\";\n  }\n  os << std::endl;\n  for (const auto& arc : n)\n  {\n    for (const auto& successor : arc.successors.elements)\n    {\n      os << successor->data();\n    }\n  }\n  return os << std::endl;\n}\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n} \/\/ namespace sdd\n\nnamespace std {\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @brief Hash specialization for sdd::proto_arc\ntemplate <typename C>\nstruct hash<sdd::proto_arc<C>>\n{\n  std::size_t\n  operator()(const sdd::proto_arc<C>& n)\n  const noexcept \/*(noexcept(???))*\/\n  {\n    std::size_t seed = sdd::util::hash(n.current_values);\n    sdd::util::hash_combine(seed, n.values);\n    sdd::util::hash_combine(seed, n.successors);\n    return seed;\n  }\n};\n\n\/\/\/ @brief Hash specialization for sdd::proto_node\ntemplate <typename C>\nstruct hash<sdd::proto_node<C>>\n{\n  std::size_t\n  operator()(const sdd::proto_node<C>& n)\n  const noexcept(noexcept(sdd::util::hash(n.begin(), n.end())))\n  {\n    return sdd::util::hash(n.begin(), n.end());\n  }\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n} \/\/ namespace std\n\n#endif \/\/ _SDD_DD_PROTO_NODE_HH_\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    This file is part of libkcal.\n\n    Copyright (c) 1998 Preston Brown\n    Copyright (c) 2000-2003 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 <stdlib.h>\n\n#include <kdebug.h>\n#include <klocale.h>\n\n#include \"exceptions.h\"\n#include \"calfilter.h\"\n\n#include \"calendar.h\"\n\nusing namespace KCal;\n\nCalendar::Calendar()\n{\n  mTimeZoneId = QString::fromLatin1( \"UTC\" );\n  mLocalTime = false;\n\n  init();\n}\n\nCalendar::Calendar( const QString &timeZoneId )\n{\n  mTimeZoneId = timeZoneId;\n  mLocalTime = false;\n\n  init();\n}\n\nvoid Calendar::init()\n{\n  mObserver = 0;\n  mNewObserver = false;\n\n  mModified = false;\n\n  \/\/ Setup default filter, which does nothing\n  mDefaultFilter = new CalFilter;\n  mFilter = mDefaultFilter;\n  mFilter->setEnabled(false);\n\n  \/\/ initialize random numbers.  This is a hack, and not\n  \/\/ even that good of one at that.\n\/\/  srandom(time(0));\n\n  \/\/ user information...\n  setOwner(i18n(\"Unknown Name\"));\n  setEmail(i18n(\"unknown@nowhere\"));\n\n#if 0\n  tmpStr = KOPrefs::instance()->mTimeZone;\n\/\/  kdDebug(5800) << \"Calendar::Calendar(): TimeZone: \" << tmpStr << endl;\n  int dstSetting = KOPrefs::instance()->mDaylightSavings;\n  extern long int timezone;\n  struct tm *now;\n  time_t curtime;\n  curtime = time(0);\n  now = localtime(&curtime);\n  int hourOff = - ((timezone \/ 60) \/ 60);\n  if (now->tm_isdst)\n    hourOff += 1;\n  QString tzStr;\n  tzStr.sprintf(\"%.2d%.2d\",\n\t\thourOff,\n\t\tabs((timezone \/ 60) % 60));\n\n  \/\/ if no time zone was in the config file, write what we just discovered.\n  if (tmpStr.isEmpty()) {\n\/\/    KOPrefs::instance()->mTimeZone = tzStr;\n  } else {\n    tzStr = tmpStr;\n  }\n\n  \/\/ if daylight savings has changed since last load time, we need\n  \/\/ to rewrite these settings to the config file.\n  if ((now->tm_isdst && !dstSetting) ||\n      (!now->tm_isdst && dstSetting)) {\n    KOPrefs::instance()->mTimeZone = tzStr;\n    KOPrefs::instance()->mDaylightSavings = now->tm_isdst;\n  }\n\n  setTimeZone(tzStr);\n#endif\n\n\/\/  KOPrefs::instance()->writeConfig();\n}\n\nCalendar::~Calendar()\n{\n  delete mDefaultFilter;\n}\n\nconst QString &Calendar::getOwner() const\n{\n  return mOwner;\n}\n\nvoid Calendar::setOwner(const QString &os)\n{\n  int i;\n  mOwner = os;\n  i = mOwner.find(',');\n  if (i != -1)\n    mOwner = mOwner.left(i);\n\n  setModified( true );\n}\n\nvoid Calendar::setTimeZoneId(const QString &id)\n{\n  mTimeZoneId = id;\n  mLocalTime = false;\n\n  setModified( true );\n  doSetTimeZoneId( id );\n}\n\nQString Calendar::timeZoneId() const\n{\n  return mTimeZoneId;\n}\n\nvoid Calendar::setLocalTime()\n{\n  mLocalTime = true;\n  mTimeZone = 0;\n  mTimeZoneId = \"\";\n\n  setModified( true );\n}\n\nbool Calendar::isLocalTime() const\n{\n  return mLocalTime;\n}\n\nconst QString &Calendar::getEmail()\n{\n  return mOwnerEmail;\n}\n\nvoid Calendar::setEmail(const QString &e)\n{\n  mOwnerEmail = e;\n\n  setModified( true );\n}\n\nvoid Calendar::setFilter(CalFilter *filter)\n{\n  mFilter = filter;\n}\n\nCalFilter *Calendar::filter()\n{\n  return mFilter;\n}\n\nIncidence::List Calendar::incidences()\n{\n  return mergeIncidenceList( events(), todos(), journals() );\n}\n\nIncidence::List Calendar::rawIncidences()\n{\n  return mergeIncidenceList( rawEvents(), rawTodos(), journals() );\n}\n\nEvent::List Calendar::events( const QDate &date, bool sorted )\n{\n  Event::List el = rawEventsForDate( date, sorted );\n\n  mFilter->apply(&el);\n\n  return el;\n}\n\nEvent::List Calendar::events( const QDateTime &qdt )\n{\n  Event::List el = rawEventsForDate(qdt);\n  mFilter->apply(&el);\n  return el;\n}\n\nEvent::List Calendar::events( const QDate &start, const QDate &end,\n                                  bool inclusive)\n{\n  Event::List el = rawEvents(start,end,inclusive);\n  mFilter->apply(&el);\n  return el;\n}\n\nEvent::List Calendar::events()\n{\n  Event::List el = rawEvents();\n  mFilter->apply(&el);\n  return el;\n}\n\n\nbool Calendar::addIncidence(Incidence *i)\n{\n  Incidence::AddVisitor<Calendar> v(this);\n\n  return i->accept(v);\n}\n\nbool Calendar::deleteIncidence( Incidence *i )\n{\n  Incidence::DeleteVisitor<Calendar> v( this );\n  return i->accept( v );\n}\n\nIncidence *Calendar::incidence( const QString& uid )\n{\n  Incidence *i = event( uid );\n  if ( i ) return i;\n  i = todo( uid );\n  if ( i ) return i;\n  i = journal( uid );\n  return i;\n}\n\nTodo::List Calendar::todos()\n{\n  Todo::List tl = rawTodos();\n  mFilter->apply( &tl );\n  return tl;\n}\n\n\/\/ When this is called, the todo have already been added to the calendar.\n\/\/ This method is only about linking related todos\nvoid Calendar::setupRelations( Incidence *incidence )\n{\n  QString uid = incidence->uid();\n\n  \/\/ First, go over the list of orphans and see if this is their parent\n  while( Incidence* i = mOrphans[ uid ] ) {\n    mOrphans.remove( uid );\n    i->setRelatedTo( incidence );\n    incidence->addRelation( i );\n    mOrphanUids.remove( i->uid() );\n  }\n\n  \/\/ Now see about this incidences parent\n  if( !incidence->relatedTo() && !incidence->relatedToUid().isEmpty() ) {\n    \/\/ This incidence has a uid it is related to, but is not registered to it yet\n    \/\/ Try to find it\n    Incidence* parent = this->incidence( incidence->relatedToUid() );\n    if( parent ) {\n      \/\/ Found it\n      incidence->setRelatedTo( parent );\n      parent->addRelation( incidence );\n    } else {\n      \/\/ Not found, put this in the mOrphans list\n      mOrphans.insert( incidence->relatedToUid(), incidence );\n      mOrphanUids.insert( incidence->uid(), incidence );\n    }\n  }\n}\n\n\/\/ If a task with subtasks is deleted, move it's subtasks to the orphans list\nvoid Calendar::removeRelations( Incidence *incidence )\n{\n  QString uid = incidence->uid();\n\n  Incidence::List relations = incidence->relations();\n  Incidence::List::ConstIterator it;\n  for( it = relations.begin(); it != relations.end(); ++it ) {\n    Incidence *i = *it;\n    if( !mOrphanUids.find( i->uid() ) ) {\n      mOrphans.insert( uid, i );\n      mOrphanUids.insert( i->uid(), i );\n      i->setRelatedTo( 0 );\n      i->setRelatedToUid( uid );\n    }\n  }\n\n  \/\/ If this incidence is related to something else, tell that about it\n  if( incidence->relatedTo() )\n    incidence->relatedTo()->removeRelation( incidence );\n\n  \/\/ Remove this one from the orphans list\n  if( mOrphanUids.remove( uid ) )\n    \/\/ This incidence is located in the orphans list - it should be removed\n    if( !( incidence->relatedTo() != 0 && mOrphans.remove( incidence->relatedTo()->uid() ) ) ) {\n      \/\/ Removing wasn't that easy\n      for( QDictIterator<Incidence> it( mOrphans ); it.current(); ++it ) {\n\tif( it.current()->uid() == uid ) {\n\t  mOrphans.remove( it.currentKey() );\n\t  break;\n\t}\n      }\n    }\n}\n\nvoid Calendar::registerObserver( Observer *observer )\n{\n  mObserver = observer;\n  mNewObserver = true;\n}\n\nvoid Calendar::setModified( bool modified )\n{\n  if ( modified != mModified || mNewObserver ) {\n    mNewObserver = false;\n    if ( mObserver ) mObserver->calendarModified( modified, this );\n    mModified = modified;\n  }\n}\n\nvoid Calendar::setLoadedProductId( const QString &id )\n{\n  mLoadedProductId = id;\n}\n\nQString Calendar::loadedProductId()\n{\n  return mLoadedProductId;\n}\n\nIncidence::List Calendar::mergeIncidenceList( const Event::List &e,\n                                              const Todo::List &t,\n                                              const Journal::List &j )\n{\n  Incidence::List incidences;\n  \n  Event::List::ConstIterator it1;\n  for( it1 = e.begin(); it1 != e.end(); ++it1 ) incidences.append( *it1 );\n\n  Todo::List::ConstIterator it2;\n  for( it2 = t.begin(); it2 != t.end(); ++it2 ) incidences.append( *it2 );\n\n  Journal::List::ConstIterator it3;\n  for( it3 = j.begin(); it3 != j.end(); ++it3 ) incidences.append( *it3 );\n\n  return incidences;\n}\n\nbool Calendar::beginChange( Incidence * )\n{\n  return true;\n}\n\nbool Calendar::endChange( Incidence * )\n{\n  return true;\n}\n\n#include \"calendar.moc\"\n<commit_msg>Crash guard. Reviewed by Cornelius.<commit_after>\/*\n    This file is part of libkcal.\n\n    Copyright (c) 1998 Preston Brown\n    Copyright (c) 2000-2003 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 <stdlib.h>\n\n#include <kdebug.h>\n#include <klocale.h>\n\n#include \"exceptions.h\"\n#include \"calfilter.h\"\n\n#include \"calendar.h\"\n\nusing namespace KCal;\n\nCalendar::Calendar()\n{\n  mTimeZoneId = QString::fromLatin1( \"UTC\" );\n  mLocalTime = false;\n\n  init();\n}\n\nCalendar::Calendar( const QString &timeZoneId )\n{\n  mTimeZoneId = timeZoneId;\n  mLocalTime = false;\n\n  init();\n}\n\nvoid Calendar::init()\n{\n  mObserver = 0;\n  mNewObserver = false;\n\n  mModified = false;\n\n  \/\/ Setup default filter, which does nothing\n  mDefaultFilter = new CalFilter;\n  mFilter = mDefaultFilter;\n  mFilter->setEnabled(false);\n\n  \/\/ initialize random numbers.  This is a hack, and not\n  \/\/ even that good of one at that.\n\/\/  srandom(time(0));\n\n  \/\/ user information...\n  setOwner(i18n(\"Unknown Name\"));\n  setEmail(i18n(\"unknown@nowhere\"));\n\n#if 0\n  tmpStr = KOPrefs::instance()->mTimeZone;\n\/\/  kdDebug(5800) << \"Calendar::Calendar(): TimeZone: \" << tmpStr << endl;\n  int dstSetting = KOPrefs::instance()->mDaylightSavings;\n  extern long int timezone;\n  struct tm *now;\n  time_t curtime;\n  curtime = time(0);\n  now = localtime(&curtime);\n  int hourOff = - ((timezone \/ 60) \/ 60);\n  if (now->tm_isdst)\n    hourOff += 1;\n  QString tzStr;\n  tzStr.sprintf(\"%.2d%.2d\",\n\t\thourOff,\n\t\tabs((timezone \/ 60) % 60));\n\n  \/\/ if no time zone was in the config file, write what we just discovered.\n  if (tmpStr.isEmpty()) {\n\/\/    KOPrefs::instance()->mTimeZone = tzStr;\n  } else {\n    tzStr = tmpStr;\n  }\n\n  \/\/ if daylight savings has changed since last load time, we need\n  \/\/ to rewrite these settings to the config file.\n  if ((now->tm_isdst && !dstSetting) ||\n      (!now->tm_isdst && dstSetting)) {\n    KOPrefs::instance()->mTimeZone = tzStr;\n    KOPrefs::instance()->mDaylightSavings = now->tm_isdst;\n  }\n\n  setTimeZone(tzStr);\n#endif\n\n\/\/  KOPrefs::instance()->writeConfig();\n}\n\nCalendar::~Calendar()\n{\n  delete mDefaultFilter;\n}\n\nconst QString &Calendar::getOwner() const\n{\n  return mOwner;\n}\n\nvoid Calendar::setOwner(const QString &os)\n{\n  int i;\n  mOwner = os;\n  i = mOwner.find(',');\n  if (i != -1)\n    mOwner = mOwner.left(i);\n\n  setModified( true );\n}\n\nvoid Calendar::setTimeZoneId(const QString &id)\n{\n  mTimeZoneId = id;\n  mLocalTime = false;\n\n  setModified( true );\n  doSetTimeZoneId( id );\n}\n\nQString Calendar::timeZoneId() const\n{\n  return mTimeZoneId;\n}\n\nvoid Calendar::setLocalTime()\n{\n  mLocalTime = true;\n  mTimeZone = 0;\n  mTimeZoneId = \"\";\n\n  setModified( true );\n}\n\nbool Calendar::isLocalTime() const\n{\n  return mLocalTime;\n}\n\nconst QString &Calendar::getEmail()\n{\n  return mOwnerEmail;\n}\n\nvoid Calendar::setEmail(const QString &e)\n{\n  mOwnerEmail = e;\n\n  setModified( true );\n}\n\nvoid Calendar::setFilter(CalFilter *filter)\n{\n  mFilter = filter;\n}\n\nCalFilter *Calendar::filter()\n{\n  return mFilter;\n}\n\nIncidence::List Calendar::incidences()\n{\n  return mergeIncidenceList( events(), todos(), journals() );\n}\n\nIncidence::List Calendar::rawIncidences()\n{\n  return mergeIncidenceList( rawEvents(), rawTodos(), journals() );\n}\n\nEvent::List Calendar::events( const QDate &date, bool sorted )\n{\n  Event::List el = rawEventsForDate( date, sorted );\n\n  mFilter->apply(&el);\n\n  return el;\n}\n\nEvent::List Calendar::events( const QDateTime &qdt )\n{\n  Event::List el = rawEventsForDate(qdt);\n  mFilter->apply(&el);\n  return el;\n}\n\nEvent::List Calendar::events( const QDate &start, const QDate &end,\n                                  bool inclusive)\n{\n  Event::List el = rawEvents(start,end,inclusive);\n  mFilter->apply(&el);\n  return el;\n}\n\nEvent::List Calendar::events()\n{\n  Event::List el = rawEvents();\n  mFilter->apply(&el);\n  return el;\n}\n\n\nbool Calendar::addIncidence(Incidence *i)\n{\n  Incidence::AddVisitor<Calendar> v(this);\n\n  return i->accept(v);\n}\n\nbool Calendar::deleteIncidence( Incidence *i )\n{\n  Incidence::DeleteVisitor<Calendar> v( this );\n  return i->accept( v );\n}\n\nIncidence *Calendar::incidence( const QString& uid )\n{\n  Incidence *i = event( uid );\n  if ( i ) return i;\n  i = todo( uid );\n  if ( i ) return i;\n  i = journal( uid );\n  return i;\n}\n\nTodo::List Calendar::todos()\n{\n  Todo::List tl = rawTodos();\n  mFilter->apply( &tl );\n  return tl;\n}\n\n\/\/ When this is called, the todo have already been added to the calendar.\n\/\/ This method is only about linking related todos\nvoid Calendar::setupRelations( Incidence *incidence )\n{\n  QString uid = incidence->uid();\n\n  \/\/ First, go over the list of orphans and see if this is their parent\n  while( Incidence* i = mOrphans[ uid ] ) {\n    mOrphans.remove( uid );\n    i->setRelatedTo( incidence );\n    incidence->addRelation( i );\n    mOrphanUids.remove( i->uid() );\n  }\n\n  \/\/ Now see about this incidences parent\n  if( !incidence->relatedTo() && !incidence->relatedToUid().isEmpty() ) {\n    \/\/ This incidence has a uid it is related to, but is not registered to it yet\n    \/\/ Try to find it\n    Incidence* parent = this->incidence( incidence->relatedToUid() );\n    if( parent ) {\n      \/\/ Found it\n      incidence->setRelatedTo( parent );\n      parent->addRelation( incidence );\n    } else {\n      \/\/ Not found, put this in the mOrphans list\n      mOrphans.insert( incidence->relatedToUid(), incidence );\n      mOrphanUids.insert( incidence->uid(), incidence );\n    }\n  }\n}\n\n\/\/ If a task with subtasks is deleted, move it's subtasks to the orphans list\nvoid Calendar::removeRelations( Incidence *incidence )\n{\n  if( !incidence ) {\n    kdDebug(5800) << \"Warning: Calendar::removeRelations( 0 )!\\n\";\n    return;\n  }\n\n  QString uid = incidence->uid();\n\n  Incidence::List relations = incidence->relations();\n  Incidence::List::ConstIterator it;\n  for( it = relations.begin(); it != relations.end(); ++it ) {\n    Incidence *i = *it;\n    if( !mOrphanUids.find( i->uid() ) ) {\n      mOrphans.insert( uid, i );\n      mOrphanUids.insert( i->uid(), i );\n      i->setRelatedTo( 0 );\n      i->setRelatedToUid( uid );\n    }\n  }\n\n  \/\/ If this incidence is related to something else, tell that about it\n  if( incidence->relatedTo() )\n    incidence->relatedTo()->removeRelation( incidence );\n\n  \/\/ Remove this one from the orphans list\n  if( mOrphanUids.remove( uid ) )\n    \/\/ This incidence is located in the orphans list - it should be removed\n    if( !( incidence->relatedTo() != 0 && mOrphans.remove( incidence->relatedTo()->uid() ) ) ) {\n      \/\/ Removing wasn't that easy\n      for( QDictIterator<Incidence> it( mOrphans ); it.current(); ++it ) {\n\tif( it.current()->uid() == uid ) {\n\t  mOrphans.remove( it.currentKey() );\n\t  break;\n\t}\n      }\n    }\n}\n\nvoid Calendar::registerObserver( Observer *observer )\n{\n  mObserver = observer;\n  mNewObserver = true;\n}\n\nvoid Calendar::setModified( bool modified )\n{\n  if ( modified != mModified || mNewObserver ) {\n    mNewObserver = false;\n    if ( mObserver ) mObserver->calendarModified( modified, this );\n    mModified = modified;\n  }\n}\n\nvoid Calendar::setLoadedProductId( const QString &id )\n{\n  mLoadedProductId = id;\n}\n\nQString Calendar::loadedProductId()\n{\n  return mLoadedProductId;\n}\n\nIncidence::List Calendar::mergeIncidenceList( const Event::List &e,\n                                              const Todo::List &t,\n                                              const Journal::List &j )\n{\n  Incidence::List incidences;\n  \n  Event::List::ConstIterator it1;\n  for( it1 = e.begin(); it1 != e.end(); ++it1 ) incidences.append( *it1 );\n\n  Todo::List::ConstIterator it2;\n  for( it2 = t.begin(); it2 != t.end(); ++it2 ) incidences.append( *it2 );\n\n  Journal::List::ConstIterator it3;\n  for( it3 = j.begin(); it3 != j.end(); ++it3 ) incidences.append( *it3 );\n\n  return incidences;\n}\n\nbool Calendar::beginChange( Incidence * )\n{\n  return true;\n}\n\nbool Calendar::endChange( Incidence * )\n{\n  return true;\n}\n\n#include \"calendar.moc\"\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>UPPERCASE<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>Reverted revision 616<commit_after><|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n * Copyright 2018 The Apollo Authors. All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *****************************************************************************\/\n\n#include <gtest\/gtest.h>\n\n#include \"cyber\/base\/for_each.h\"\n#include \"cyber\/common\/global_data.h\"\n#include \"cyber\/cyber.h\"\n#include \"cyber\/scheduler\/policy\/choreography_context.h\"\n#include \"cyber\/scheduler\/policy\/classic_context.h\"\n#include \"cyber\/scheduler\/policy\/scheduler_choreography.h\"\n#include \"cyber\/scheduler\/policy\/scheduler_classic.h\"\n#include \"cyber\/scheduler\/processor.h\"\n#include \"cyber\/scheduler\/scheduler_factory.h\"\n#include \"cyber\/task\/task.h\"\n\nnamespace apollo {\nnamespace cyber {\nnamespace scheduler {\n\nvoid func() {}\n\nTEST(SchedulerPolicyTest, choreo) {\n  auto processor = std::make_shared<Processor>();\n  auto ctx = std::make_shared<ChoreographyContext>();\n  processor->BindContext(ctx);\n\n  std::shared_ptr<CRoutine> cr = std::make_shared<CRoutine>(func);\n  auto task_id = GlobalData::RegisterTaskName(\"choreo\");\n  cr->set_id(task_id);\n  EXPECT_TRUE(static_cast<ChoreographyContext*>(ctx.get())->Enqueue(cr));\n  ctx->Shutdown();\n}\n\nTEST(SchedulerPolicyTest, classic) {\n  auto processor = std::make_shared<Processor>();\n  auto ctx = std::make_shared<ClassicContext>();\n  processor->BindContext(ctx);\n  ctx->SetGroupName(DEFAULT_GROUP_NAME);\n  std::vector<std::future<void>> res;\n\n  \/\/ test single routine\n  auto future = Async([]() {\n    FOR_EACH(i, 0, 20) { cyber::SleepFor(std::chrono::milliseconds(i)); }\n    AINFO << \"Finish task: single\";\n  });\n  future.get();\n\n  \/\/ test multiple routine\n  FOR_EACH(i, 0, 20) {\n    res.emplace_back(Async([i]() {\n      FOR_EACH(time, 0, 30) { cyber::SleepFor(std::chrono::milliseconds(i)); }\n    }));\n    AINFO << \"Finish task: \" << i;\n  };\n  for (auto& future : res) {\n    future.wait_for(std::chrono::milliseconds(1000));\n  }\n  res.clear();\n  ctx->Shutdown();\n  processor->Stop();\n}\n\nTEST(SchedulerPolicyTest, sched_classic) {\n  GlobalData::Instance()->SetProcessGroup(\"example_classic_sched\");\n  auto sched1 = dynamic_cast<SchedulerClassic*>(scheduler::Instance());\n  std::shared_ptr<CRoutine> cr = std::make_shared<CRoutine>(func);\n  auto task_id = GlobalData::RegisterTaskName(\"ABC\");\n  cr->set_id(task_id);\n  cr->set_name(\"ABC\");\n  EXPECT_TRUE(sched1->DispatchTask(cr));\n  \/\/ dispatch the same task\n  EXPECT_FALSE(sched1->DispatchTask(cr));\n  EXPECT_TRUE(sched1->RemoveTask(\"ABC\"));\n\n  std::shared_ptr<CRoutine> cr1 = std::make_shared<CRoutine>(func);\n  cr1->set_id(GlobalData::RegisterTaskName(\"xxxxxx\"));\n  cr1->set_name(\"xxxxxx\");\n  EXPECT_TRUE(sched1->DispatchTask(cr1));\n  sched1->Shutdown();\n\n  GlobalData::Instance()->SetProcessGroup(\"not_exist_sched\");\n  auto sched2 = dynamic_cast<SchedulerClassic*>(scheduler::Instance());\n  std::shared_ptr<CRoutine> cr2 = std::make_shared<CRoutine>(func);\n  cr2->set_id(GlobalData::RegisterTaskName(\"sched2\"));\n  cr2->set_name(\"sched2\");\n  EXPECT_TRUE(sched2->DispatchTask(cr2));\n  sched2->Shutdown();\n\n  GlobalData::Instance()->SetProcessGroup(\"dreamview_sched\");\n  auto sched3 = dynamic_cast<SchedulerClassic*>(scheduler::Instance());\n  std::shared_ptr<CRoutine> cr3 = std::make_shared<CRoutine>(func);\n  cr3->set_id(GlobalData::RegisterTaskName(\"sched3\"));\n  cr3->set_name(\"sched3\");\n  EXPECT_TRUE(sched3->DispatchTask(cr3));\n  sched3->Shutdown();\n}\n\n}  \/\/ namespace scheduler\n}  \/\/ namespace cyber\n}  \/\/ namespace apollo\n<commit_msg>framework: fix utest hang occasionally<commit_after>\/******************************************************************************\n * Copyright 2018 The Apollo Authors. All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *****************************************************************************\/\n\n#include <gtest\/gtest.h>\n\n#include \"cyber\/base\/for_each.h\"\n#include \"cyber\/common\/global_data.h\"\n#include \"cyber\/cyber.h\"\n#include \"cyber\/scheduler\/policy\/choreography_context.h\"\n#include \"cyber\/scheduler\/policy\/classic_context.h\"\n#include \"cyber\/scheduler\/policy\/scheduler_choreography.h\"\n#include \"cyber\/scheduler\/policy\/scheduler_classic.h\"\n#include \"cyber\/scheduler\/processor.h\"\n#include \"cyber\/scheduler\/scheduler_factory.h\"\n#include \"cyber\/task\/task.h\"\n\nnamespace apollo {\nnamespace cyber {\nnamespace scheduler {\n\nvoid func() {}\n\nTEST(SchedulerPolicyTest, choreo) {\n  auto processor = std::make_shared<Processor>();\n  auto ctx = std::make_shared<ChoreographyContext>();\n  processor->BindContext(ctx);\n\n  std::shared_ptr<CRoutine> cr = std::make_shared<CRoutine>(func);\n  auto task_id = GlobalData::RegisterTaskName(\"choreo\");\n  cr->set_id(task_id);\n  EXPECT_TRUE(static_cast<ChoreographyContext*>(ctx.get())->Enqueue(cr));\n  ctx->Shutdown();\n}\n\nTEST(SchedulerPolicyTest, classic) {\n  auto processor = std::make_shared<Processor>();\n  auto ctx = std::make_shared<ClassicContext>();\n  processor->BindContext(ctx);\n  ctx->SetGroupName(DEFAULT_GROUP_NAME);\n  std::vector<std::future<void>> res;\n\n  \/\/ test single routine\n  auto future = Async([]() {\n    FOR_EACH(i, 0, 20) { cyber::SleepFor(std::chrono::milliseconds(i)); }\n    AINFO << \"Finish task: single\";\n  });\n  future.get();\n\n  \/\/ test multiple routine\n  FOR_EACH(i, 0, 20) {\n    res.emplace_back(Async([i]() {\n      FOR_EACH(time, 0, 30) { cyber::SleepFor(std::chrono::milliseconds(i)); }\n    }));\n    AINFO << \"Finish task: \" << i;\n  };\n  for (auto& future : res) {\n    future.wait_for(std::chrono::milliseconds(1000));\n  }\n  res.clear();\n  ctx->Shutdown();\n  processor->Stop();\n}\n\nTEST(SchedulerPolicyTest, sched_classic) {\n  GlobalData::Instance()->SetProcessGroup(\"example_classic_sched\");\n  auto sched1 = dynamic_cast<SchedulerClassic*>(scheduler::Instance());\n  std::shared_ptr<CRoutine> cr = std::make_shared<CRoutine>(func);\n  auto task_id = GlobalData::RegisterTaskName(\"ABC\");\n  cr->set_id(task_id);\n  cr->set_name(\"ABC\");\n  EXPECT_TRUE(sched1->DispatchTask(cr));\n  \/\/ dispatch the same task\n  EXPECT_FALSE(sched1->DispatchTask(cr));\n  EXPECT_TRUE(sched1->RemoveTask(\"ABC\"));\n\n  std::shared_ptr<CRoutine> cr1 = std::make_shared<CRoutine>(func);\n  cr1->set_id(GlobalData::RegisterTaskName(\"xxxxxx\"));\n  cr1->set_name(\"xxxxxx\");\n  EXPECT_TRUE(sched1->DispatchTask(cr1));\n  sched1->Shutdown();\n\n  GlobalData::Instance()->SetProcessGroup(\"not_exist_sched\");\n  auto sched2 = dynamic_cast<SchedulerClassic*>(scheduler::Instance());\n  std::shared_ptr<CRoutine> cr2 = std::make_shared<CRoutine>(func);\n  cr2->set_id(GlobalData::RegisterTaskName(\"sched2\"));\n  cr2->set_name(\"sched2\");\n  EXPECT_TRUE(sched2->DispatchTask(cr2));\n  sched2->Shutdown();\n\n  GlobalData::Instance()->SetProcessGroup(\"dreamview_sched\");\n  auto sched3 = dynamic_cast<SchedulerClassic*>(scheduler::Instance());\n  std::shared_ptr<CRoutine> cr3 = std::make_shared<CRoutine>(func);\n  cr3->set_id(GlobalData::RegisterTaskName(\"sched3\"));\n  cr3->set_name(\"sched3\");\n  EXPECT_TRUE(sched3->DispatchTask(cr3));\n  sched3->Shutdown();\n}\n\n}  \/\/ namespace scheduler\n}  \/\/ namespace cyber\n}  \/\/ namespace apollo\n\nint main(int argc, char** argv) {\n  testing::InitGoogleTest(&argc, argv);\n  apollo::cyber::Init(argv[0]);\n  auto res = RUN_ALL_TESTS();\n  apollo::cyber::Clear();\n  return res;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- *\/\n\/*\n *     Copyright 2016 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#include \"daemon\/mcbp.h\"\n#include \"daemon\/memcached.h\"\n#include \"engine_wrapper.h\"\n#include \"mutation_context.h\"\n\n#include <memcached\/protocol_binary.h>\n#include <memcached\/types.h>\n#include <xattr\/utils.h>\n\nMutationCommandContext::MutationCommandContext(McbpConnection& c,\n                                               protocol_binary_request_set* req,\n                                               const ENGINE_STORE_OPERATION op_)\n    : SteppableCommandContext(c),\n      operation(req->message.header.request.cas == 0 ? op_ : OPERATION_CAS),\n      key(req->bytes + sizeof(req->bytes),\n          ntohs(req->message.header.request.keylen),\n          DocNamespace::DefaultCollection),\n      value(reinterpret_cast<const char*>(key.data() + key.size()),\n            ntohl(req->message.header.request.bodylen) - key.size() -\n            req->message.header.request.extlen),\n      vbucket(ntohs(req->message.header.request.vbucket)),\n      input_cas(ntohll(req->message.header.request.cas)),\n      expiration(ntohl(req->message.body.expiration)),\n      flags(req->message.body.flags),\n      datatype(req->message.header.request.datatype),\n      state(State::ValidateInput),\n      newitem(nullptr, cb::ItemDeleter{c.getBucketEngineAsV0()}),\n      existing(nullptr, cb::ItemDeleter{c.getBucketEngineAsV0()}),\n      xattr_size(0) {\n}\n\nENGINE_ERROR_CODE MutationCommandContext::step() {\n    ENGINE_ERROR_CODE ret;\n    do {\n        switch (state) {\n        case State::ValidateInput:\n            ret = validateInput();\n            break;\n        case State::GetExistingItemToPreserveXattr:\n            ret = getExistingItemToPreserveXattr();\n            break;\n        case State::AllocateNewItem:\n            ret = allocateNewItem();\n            break;\n        case State::StoreItem:\n            ret = storeItem();\n            break;\n        case State::SendResponse:\n            ret = sendResponse();\n            break;\n        case State::Reset:\n            ret = reset();\n            break;\n        case State::Done:\n            if (operation == OPERATION_CAS) {\n                SLAB_INCR(&connection, cas_hits);\n            } else {\n                SLAB_INCR(&connection, cmd_set);\n            }\n            return ENGINE_SUCCESS;\n        }\n    } while (ret == ENGINE_SUCCESS);\n\n    if (ret != ENGINE_EWOULDBLOCK) {\n        if (operation == OPERATION_CAS) {\n            switch (ret) {\n            case ENGINE_KEY_EEXISTS:\n                SLAB_INCR(&connection, cas_badval);\n                break;\n            case ENGINE_KEY_ENOENT:\n                get_thread_stats(&connection)->cas_misses++;\n                break;\n            default:;\n            }\n        } else {\n            SLAB_INCR(&connection, cmd_set);\n        }\n    }\n\n    return ret;\n}\n\nENGINE_ERROR_CODE MutationCommandContext::validateInput() {\n    if (!connection.isSupportsDatatype()) {\n        if (datatype != PROTOCOL_BINARY_RAW_BYTES) {\n            return ENGINE_EINVAL;\n        }\n\n        auto* validator = connection.getThread()->validator;\n        try {\n            auto* ptr = reinterpret_cast<const uint8_t*>(value.buf);\n            if (validator->validate(ptr, value.len)) {\n                datatype = PROTOCOL_BINARY_DATATYPE_JSON;\n            }\n        } catch (std::bad_alloc&) {\n            return ENGINE_ENOMEM;\n        }\n    }\n\n    if (operation == OPERATION_ADD || !settings.isXattrEnabled()) {\n        state = State::AllocateNewItem;\n    } else {\n        \/\/ We might want to preserve XATTRs\n        state = State::GetExistingItemToPreserveXattr;\n    }\n    return ENGINE_SUCCESS;\n}\n\nENGINE_ERROR_CODE MutationCommandContext::getExistingItemToPreserveXattr() {\n    item* it;\n    auto ret = bucket_get(&connection, &it, key, vbucket);\n    if (ret == ENGINE_SUCCESS) {\n        existing.reset(it);\n        if (!bucket_get_item_info(&connection, existing.get(),\n                                  &existing_info)) {\n            return ENGINE_FAILED;\n        }\n\n        if (input_cas != 0) {\n            if (existing_info.cas == uint64_t(-1)) {\n                \/\/ The object in the cache is locked... lets try to use\n                \/\/ the cas provided by the user to override this\n                existing_info.cas = input_cas;\n            } else if (input_cas != existing_info.cas) {\n                return ENGINE_KEY_EEXISTS;\n            }\n        } else if (existing_info.cas == uint64_t(-1)) {\n            return ENGINE_LOCKED;\n        }\n\n        if (mcbp::datatype::is_xattr(existing_info.datatype)) {\n            cb::const_char_buffer payload{\n                static_cast<const char*>(existing_info.value[0].iov_base),\n                existing_info.value[0].iov_len};\n\n            xattr_size = cb::xattr::get_body_offset(payload);\n        }\n        state = State::AllocateNewItem;\n    } else if (ret == ENGINE_KEY_ENOENT && operation == OPERATION_SET && input_cas == 0) {\n        \/\/ replace and cas should fail, but set with CAS == 0 should work.\n        state = State::AllocateNewItem;\n        ret = ENGINE_SUCCESS;\n    }\n\n    return ret;\n}\n\nENGINE_ERROR_CODE MutationCommandContext::allocateNewItem() {\n    item* it = nullptr;\n    auto dtype = datatype;\n    if (xattr_size > 0) {\n        dtype |= PROTOCOL_BINARY_DATATYPE_XATTR;\n    }\n    auto ret = bucket_allocate(&connection, &it, key, value.len + xattr_size,\n                               flags, expiration, dtype, vbucket);\n\n    if (ret != ENGINE_SUCCESS) {\n        return ret;\n    }\n\n    newitem.reset(it);\n\n    if (operation == OPERATION_ADD || input_cas != 0) {\n        bucket_item_set_cas(&connection, newitem.get(), input_cas);\n    } else {\n        if (existing) {\n            bucket_item_set_cas(&connection, newitem.get(), existing_info.cas);\n        } else {\n            bucket_item_set_cas(&connection, newitem.get(), input_cas);\n        }\n    }\n\n    item_info newitem_info;\n    if (!bucket_get_item_info(&connection, newitem.get(), &newitem_info)) {\n        return ENGINE_FAILED;\n    }\n\n    uint8_t* root = reinterpret_cast<uint8_t*>(newitem_info.value[0].iov_base);\n    if (xattr_size > 0) {\n        \/\/ Preserve the xattrs\n        auto* ex = reinterpret_cast<uint8_t*>(existing_info.value[0].iov_base);\n        std::copy(ex, ex + xattr_size, root);\n        root += xattr_size;\n    }\n\n    \/\/ Copy the user supplied value over\n    std::copy(value.buf, value.buf + value.len, root);\n    state = State::StoreItem;\n\n    return ENGINE_SUCCESS;\n}\n\nENGINE_ERROR_CODE MutationCommandContext::storeItem() {\n    uint64_t new_cas = input_cas;\n    auto ret = bucket_store(&connection, newitem.get(), &new_cas, operation);\n    if (ret == ENGINE_SUCCESS) {\n        connection.setCAS(new_cas);\n        state = State::SendResponse;\n    } else if (ret == ENGINE_NOT_STORED) {\n        \/\/ Need to remap error for add and replace\n        if (operation == OPERATION_ADD) {\n            ret = ENGINE_KEY_EEXISTS;\n        } else if (operation == OPERATION_REPLACE) {\n            ret = ENGINE_KEY_ENOENT;\n        }\n    } else if (ret == ENGINE_KEY_EEXISTS && input_cas == 0) {\n        \/\/ We failed due to CAS mismatch, and the user did not specify\n        \/\/ the CAS, retry the operation.\n        state = State::Reset;\n        ret = ENGINE_SUCCESS;\n    }\n\n    return ret;\n}\n\nENGINE_ERROR_CODE MutationCommandContext::sendResponse() {\n    update_topkeys(key, &connection);\n    state = State::Done;\n\n    if (connection.isNoReply()) {\n        connection.setState(conn_new_cmd);\n        return ENGINE_SUCCESS;\n    }\n\n    if (connection.isSupportsMutationExtras()) {\n        item_info newitem_info;\n        if (!bucket_get_item_info(&connection, newitem.get(), &newitem_info)) {\n            return ENGINE_FAILED;\n        }\n\n        \/\/ Response includes vbucket UUID and sequence number\n        \/\/ (in addition to value)\n        mutation_descr_t extras;\n        extras.vbucket_uuid = htonll(newitem_info.vbucket_uuid);\n        extras.seqno = htonll(newitem_info.seqno);\n\n        if (!mcbp_response_handler(nullptr, 0,\n                                   &extras, sizeof(extras),\n                                   nullptr, 0,\n                                   PROTOCOL_BINARY_RAW_BYTES,\n                                   PROTOCOL_BINARY_RESPONSE_SUCCESS,\n                                   connection.getCAS(),\n                                   connection.getCookie())) {\n            return ENGINE_FAILED;\n        }\n        mcbp_write_and_free(&connection, &connection.getDynamicBuffer());\n    } else {\n        mcbp_write_packet(&connection, PROTOCOL_BINARY_RESPONSE_SUCCESS);\n    }\n\n    return ENGINE_SUCCESS;\n}\n\nENGINE_ERROR_CODE MutationCommandContext::reset() {\n    newitem.reset();\n    existing.reset();\n    xattr_size = 0;\n    state = State::GetExistingItemToPreserveXattr;\n    return ENGINE_SUCCESS;\n}<commit_msg>MB-22163: Use get_if to fetch items for mutations<commit_after>\/* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- *\/\n\/*\n *     Copyright 2016 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#include \"daemon\/mcbp.h\"\n#include \"daemon\/memcached.h\"\n#include \"engine_wrapper.h\"\n#include \"mutation_context.h\"\n\n#include <memcached\/protocol_binary.h>\n#include <memcached\/types.h>\n#include <xattr\/utils.h>\n\nMutationCommandContext::MutationCommandContext(McbpConnection& c,\n                                               protocol_binary_request_set* req,\n                                               const ENGINE_STORE_OPERATION op_)\n    : SteppableCommandContext(c),\n      operation(req->message.header.request.cas == 0 ? op_ : OPERATION_CAS),\n      key(req->bytes + sizeof(req->bytes),\n          ntohs(req->message.header.request.keylen),\n          DocNamespace::DefaultCollection),\n      value(reinterpret_cast<const char*>(key.data() + key.size()),\n            ntohl(req->message.header.request.bodylen) - key.size() -\n            req->message.header.request.extlen),\n      vbucket(ntohs(req->message.header.request.vbucket)),\n      input_cas(ntohll(req->message.header.request.cas)),\n      expiration(ntohl(req->message.body.expiration)),\n      flags(req->message.body.flags),\n      datatype(req->message.header.request.datatype),\n      state(State::ValidateInput),\n      newitem(nullptr, cb::ItemDeleter{c.getBucketEngineAsV0()}),\n      existing(nullptr, cb::ItemDeleter{c.getBucketEngineAsV0()}),\n      xattr_size(0) {\n}\n\nENGINE_ERROR_CODE MutationCommandContext::step() {\n    ENGINE_ERROR_CODE ret;\n    do {\n        switch (state) {\n        case State::ValidateInput:\n            ret = validateInput();\n            break;\n        case State::GetExistingItemToPreserveXattr:\n            ret = getExistingItemToPreserveXattr();\n            break;\n        case State::AllocateNewItem:\n            ret = allocateNewItem();\n            break;\n        case State::StoreItem:\n            ret = storeItem();\n            break;\n        case State::SendResponse:\n            ret = sendResponse();\n            break;\n        case State::Reset:\n            ret = reset();\n            break;\n        case State::Done:\n            if (operation == OPERATION_CAS) {\n                SLAB_INCR(&connection, cas_hits);\n            } else {\n                SLAB_INCR(&connection, cmd_set);\n            }\n            return ENGINE_SUCCESS;\n        }\n    } while (ret == ENGINE_SUCCESS);\n\n    if (ret != ENGINE_EWOULDBLOCK) {\n        if (operation == OPERATION_CAS) {\n            switch (ret) {\n            case ENGINE_KEY_EEXISTS:\n                SLAB_INCR(&connection, cas_badval);\n                break;\n            case ENGINE_KEY_ENOENT:\n                get_thread_stats(&connection)->cas_misses++;\n                break;\n            default:;\n            }\n        } else {\n            SLAB_INCR(&connection, cmd_set);\n        }\n    }\n\n    return ret;\n}\n\nENGINE_ERROR_CODE MutationCommandContext::validateInput() {\n    if (!connection.isSupportsDatatype()) {\n        if (datatype != PROTOCOL_BINARY_RAW_BYTES) {\n            return ENGINE_EINVAL;\n        }\n\n        auto* validator = connection.getThread()->validator;\n        try {\n            auto* ptr = reinterpret_cast<const uint8_t*>(value.buf);\n            if (validator->validate(ptr, value.len)) {\n                datatype = PROTOCOL_BINARY_DATATYPE_JSON;\n            }\n        } catch (std::bad_alloc&) {\n            return ENGINE_ENOMEM;\n        }\n    }\n\n    if (operation == OPERATION_ADD || !settings.isXattrEnabled()) {\n        state = State::AllocateNewItem;\n    } else {\n        \/\/ We might want to preserve XATTRs\n        state = State::GetExistingItemToPreserveXattr;\n    }\n    return ENGINE_SUCCESS;\n}\n\nENGINE_ERROR_CODE MutationCommandContext::getExistingItemToPreserveXattr() {\n    try {\n        \/\/ Try to fetch the previous version of the document _iff_ it contains\n        \/\/ any xattrs so that we can preserve those by copying them over to\n        \/\/ the new document. Documents without any xattrs can safely be\n        \/\/ ignored. The motivation to use get_if over a normal get is for the\n        \/\/ value eviction case where the underlying engine would have to read\n        \/\/ the value off disk in order to return it via get() even if we don't\n        \/\/ need it (and would throw it away in the frontend).\n        existing = bucket_get_if(&connection, key, vbucket,\n                                 [](const item_info& info) {\n                                     return mcbp::datatype::is_xattr(info.datatype);\n                                 });\n    } catch (const cb::engine_error& error) {\n        if (error.code() != cb::engine_errc::no_such_key) {\n            return ENGINE_ERROR_CODE(error.code().value());\n        }\n    }\n\n    if (!existing) {\n        state = State::AllocateNewItem;\n        return ENGINE_SUCCESS;\n    }\n\n    if (!bucket_get_item_info(&connection, existing.get(), &existing_info)) {\n        return ENGINE_FAILED;\n    }\n\n    if (input_cas != 0) {\n        if (existing_info.cas == uint64_t(-1)) {\n            \/\/ The object in the cache is locked... lets try to use\n            \/\/ the cas provided by the user to override this\n            existing_info.cas = input_cas;\n        } else if (input_cas != existing_info.cas) {\n            return ENGINE_KEY_EEXISTS;\n        }\n    } else if (existing_info.cas == uint64_t(-1)) {\n        return ENGINE_LOCKED;\n    }\n\n    cb::const_char_buffer payload{\n        static_cast<const char*>(existing_info.value[0].iov_base),\n        existing_info.value[0].iov_len};\n    xattr_size = cb::xattr::get_body_offset(payload);\n\n    state = State::AllocateNewItem;\n    return ENGINE_SUCCESS;\n}\n\nENGINE_ERROR_CODE MutationCommandContext::allocateNewItem() {\n    item* it = nullptr;\n    auto dtype = datatype;\n    if (xattr_size > 0) {\n        dtype |= PROTOCOL_BINARY_DATATYPE_XATTR;\n    }\n    auto ret = bucket_allocate(&connection, &it, key, value.len + xattr_size,\n                               flags, expiration, dtype, vbucket);\n\n    if (ret != ENGINE_SUCCESS) {\n        return ret;\n    }\n\n    newitem.reset(it);\n\n    if (operation == OPERATION_ADD || input_cas != 0) {\n        bucket_item_set_cas(&connection, newitem.get(), input_cas);\n    } else {\n        if (existing) {\n            bucket_item_set_cas(&connection, newitem.get(), existing_info.cas);\n        } else {\n            bucket_item_set_cas(&connection, newitem.get(), input_cas);\n        }\n    }\n\n    item_info newitem_info;\n    if (!bucket_get_item_info(&connection, newitem.get(), &newitem_info)) {\n        return ENGINE_FAILED;\n    }\n\n    uint8_t* root = reinterpret_cast<uint8_t*>(newitem_info.value[0].iov_base);\n    if (xattr_size > 0) {\n        \/\/ Preserve the xattrs\n        auto* ex = reinterpret_cast<uint8_t*>(existing_info.value[0].iov_base);\n        std::copy(ex, ex + xattr_size, root);\n        root += xattr_size;\n    }\n\n    \/\/ Copy the user supplied value over\n    std::copy(value.buf, value.buf + value.len, root);\n    state = State::StoreItem;\n\n    return ENGINE_SUCCESS;\n}\n\nENGINE_ERROR_CODE MutationCommandContext::storeItem() {\n    uint64_t new_cas = input_cas;\n    auto ret = bucket_store(&connection, newitem.get(), &new_cas, operation);\n    if (ret == ENGINE_SUCCESS) {\n        connection.setCAS(new_cas);\n        state = State::SendResponse;\n    } else if (ret == ENGINE_NOT_STORED) {\n        \/\/ Need to remap error for add and replace\n        if (operation == OPERATION_ADD) {\n            ret = ENGINE_KEY_EEXISTS;\n        } else if (operation == OPERATION_REPLACE) {\n            ret = ENGINE_KEY_ENOENT;\n        }\n    } else if (ret == ENGINE_KEY_EEXISTS && input_cas == 0) {\n        \/\/ We failed due to CAS mismatch, and the user did not specify\n        \/\/ the CAS, retry the operation.\n        state = State::Reset;\n        ret = ENGINE_SUCCESS;\n    }\n\n    return ret;\n}\n\nENGINE_ERROR_CODE MutationCommandContext::sendResponse() {\n    update_topkeys(key, &connection);\n    state = State::Done;\n\n    if (connection.isNoReply()) {\n        connection.setState(conn_new_cmd);\n        return ENGINE_SUCCESS;\n    }\n\n    if (connection.isSupportsMutationExtras()) {\n        item_info newitem_info;\n        if (!bucket_get_item_info(&connection, newitem.get(), &newitem_info)) {\n            return ENGINE_FAILED;\n        }\n\n        \/\/ Response includes vbucket UUID and sequence number\n        \/\/ (in addition to value)\n        mutation_descr_t extras;\n        extras.vbucket_uuid = htonll(newitem_info.vbucket_uuid);\n        extras.seqno = htonll(newitem_info.seqno);\n\n        if (!mcbp_response_handler(nullptr, 0,\n                                   &extras, sizeof(extras),\n                                   nullptr, 0,\n                                   PROTOCOL_BINARY_RAW_BYTES,\n                                   PROTOCOL_BINARY_RESPONSE_SUCCESS,\n                                   connection.getCAS(),\n                                   connection.getCookie())) {\n            return ENGINE_FAILED;\n        }\n        mcbp_write_and_free(&connection, &connection.getDynamicBuffer());\n    } else {\n        mcbp_write_packet(&connection, PROTOCOL_BINARY_RESPONSE_SUCCESS);\n    }\n\n    return ENGINE_SUCCESS;\n}\n\nENGINE_ERROR_CODE MutationCommandContext::reset() {\n    newitem.reset();\n    existing.reset();\n    xattr_size = 0;\n    state = State::GetExistingItemToPreserveXattr;\n    return ENGINE_SUCCESS;\n}<|endoftext|>"}
{"text":"<commit_before><commit_msg>GLES2 render system: Resolved the case where mRTTManager == NULL when calling GLES2RenderSystem::_setRenderTarget<commit_after><|endoftext|>"}
{"text":"<commit_before>#include <sasdf>\n\nclass MySimpleClass \n{\n\tpublic:\n\t\tMySimpleClass ();\n};<commit_msg>testuje sobie<commit_after>#include <sasdf>\n\/\/tez sobie testuje \/Tomek\n\nclass MySimpleClass \n{\n\tpublic:\n\t\tMySimpleClass ();\n};<|endoftext|>"}
{"text":"<commit_before>\/* Copyright 2014, Uwe L. Korn <uwelk@xhochy.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 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 \"Json.h\"\n\n\/\/ Qt version specific includes\n#if QT_VERSION >= QT_VERSION_CHECK( 5, 0, 0 )\n    #include <QJsonDocument>\n    #include <QMetaProperty>\n#else\n    #include <qjson\/parser.h>\n    #include <qjson\/qobjecthelper.h>\n    #include <qjson\/serializer.h>\n#endif\n\nnamespace QJsonWrapper\n{\n\nQVariantMap\nqobject2qvariant( const QObject* object )\n{\n#if QT_VERSION >= QT_VERSION_CHECK( 5, 0, 0 )\n    QVariantMap map;\n    if ( object == NULL )\n    {\n        return map;\n    }\n\n    const QMetaObject* metaObject = object->metaObject();\n    for ( int i = 0; i < metaObject->propertyCount(); ++i )\n    {\n        QMetaProperty metaproperty = metaObject->property( i );\n        if ( metaproperty.isReadable() )\n        {\n            map[ QLatin1String( metaproperty.name() ) ] = object->property( metaproperty.name() );\n        }\n    }\n    return map;\n#else\n    return QJson::QObjectHelper::qobject2qvariant( object );\n#endif\n}\n\n\nvoid\nqvariant2qobject( const QVariantMap& variant, QObject* object )\n{\n#if QT_VERSION >= QT_VERSION_CHECK( 5, 0, 0 )\n    for ( QVariantMap::const_iterator iter = variant.begin(); iter != variant.end(); ++iter )\n    {\n        QVariant property = object->property( iter.key().toLatin1() );\n        Q_ASSERT( property.isValid() );\n        if ( property.isValid() )\n        {\n            QVariant value = iter.value();\n            if ( value.canConvert( property.type() ) )\n            {\n                value.convert( property.type() );\n                object->setProperty( iter.key().toLatin1(), value );\n            } else if ( QString( QLatin1String(\"QVariant\") ).compare( QLatin1String( property.typeName() ) ) == 0 ) {\n                object->setProperty( iter.key().toLatin1(), value );\n            }\n        }\n    }\n#else\n    QJson::QObjectHelper::qvariant2qobject( variant, object );\n#endif\n}\n\n\nQVariant\nparseJson( const QByteArray& jsonData, bool* ok )\n{\n#if QT_VERSION >= QT_VERSION_CHECK( 5, 0, 0 )\n    QJsonParseError error;\n    QJsonDocument doc = QJsonDocument::fromJson( jsonData, &error );\n    if ( ok != NULL )\n    {\n        *ok = ( error.error == QJsonParseError::NoError );\n    }\n    return doc.toVariant();\n#else\n    QJson::Parser p;\n    return p.parse( jsonData, ok );\n#endif\n}\n\n\nQByteArray\ntoJson( const QVariant &variant, bool* ok )\n{\n#if QT_VERSION >= QT_VERSION_CHECK( 5, 0, 0 )\n    QJsonDocument doc = QJsonDocument::fromVariant( variant );\n    if ( ok != NULL )\n    {\n        *ok = true;\n    }\n    return doc.toJson();\n#else\n    QJson::Serializer serializer;\n    return serializer.serialize( variant, ok );\n#endif\n}\n\n}\n<commit_msg>Document is only ok if not Null<commit_after>\/* Copyright 2014, Uwe L. Korn <uwelk@xhochy.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 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 \"Json.h\"\n\n\/\/ Qt version specific includes\n#if QT_VERSION >= QT_VERSION_CHECK( 5, 0, 0 )\n    #include <QJsonDocument>\n    #include <QMetaProperty>\n#else\n    #include <qjson\/parser.h>\n    #include <qjson\/qobjecthelper.h>\n    #include <qjson\/serializer.h>\n#endif\n\nnamespace QJsonWrapper\n{\n\nQVariantMap\nqobject2qvariant( const QObject* object )\n{\n#if QT_VERSION >= QT_VERSION_CHECK( 5, 0, 0 )\n    QVariantMap map;\n    if ( object == NULL )\n    {\n        return map;\n    }\n\n    const QMetaObject* metaObject = object->metaObject();\n    for ( int i = 0; i < metaObject->propertyCount(); ++i )\n    {\n        QMetaProperty metaproperty = metaObject->property( i );\n        if ( metaproperty.isReadable() )\n        {\n            map[ QLatin1String( metaproperty.name() ) ] = object->property( metaproperty.name() );\n        }\n    }\n    return map;\n#else\n    return QJson::QObjectHelper::qobject2qvariant( object );\n#endif\n}\n\n\nvoid\nqvariant2qobject( const QVariantMap& variant, QObject* object )\n{\n#if QT_VERSION >= QT_VERSION_CHECK( 5, 0, 0 )\n    for ( QVariantMap::const_iterator iter = variant.begin(); iter != variant.end(); ++iter )\n    {\n        QVariant property = object->property( iter.key().toLatin1() );\n        Q_ASSERT( property.isValid() );\n        if ( property.isValid() )\n        {\n            QVariant value = iter.value();\n            if ( value.canConvert( property.type() ) )\n            {\n                value.convert( property.type() );\n                object->setProperty( iter.key().toLatin1(), value );\n            } else if ( QString( QLatin1String(\"QVariant\") ).compare( QLatin1String( property.typeName() ) ) == 0 ) {\n                object->setProperty( iter.key().toLatin1(), value );\n            }\n        }\n    }\n#else\n    QJson::QObjectHelper::qvariant2qobject( variant, object );\n#endif\n}\n\n\nQVariant\nparseJson( const QByteArray& jsonData, bool* ok )\n{\n#if QT_VERSION >= QT_VERSION_CHECK( 5, 0, 0 )\n    QJsonParseError error;\n    QJsonDocument doc = QJsonDocument::fromJson( jsonData, &error );\n    if ( ok != NULL )\n    {\n        *ok = ( error.error == QJsonParseError::NoError );\n    }\n    return doc.toVariant();\n#else\n    QJson::Parser p;\n    return p.parse( jsonData, ok );\n#endif\n}\n\n\nQByteArray\ntoJson( const QVariant &variant, bool* ok )\n{\n#if QT_VERSION >= QT_VERSION_CHECK( 5, 0, 0 )\n    QJsonDocument doc = QJsonDocument::fromVariant( variant );\n    if ( ok != NULL )\n    {\n        *ok = !doc.isNull();\n    }\n    return doc.toJson();\n#else\n    QJson::Serializer serializer;\n    return serializer.serialize( variant, ok );\n#endif\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\n    openpnp test application\n\n    Niels Moseley\n\n*\/\n#include <stdio.h>\n#include <stdlib.h>\n#include <memory.h>\n#include <unistd.h>\n\n#include \"openpnp-capture.h\"\n#include \"..\/common\/context.h\"\n\nint main(int argc, char*argv[])\n{    \n    printf(\"OpenPNP Capture Test Program\\n\");\n    Cap_setLogLevel(7);\n\n    CapContext ctx = Cap_createContext();\n\n    uint32_t deviceCount = Cap_getDeviceCount(ctx);\n    printf(\"Number of devices: %d\\n\", deviceCount);\n    for(uint32_t i=0; i<deviceCount; i++)\n    {\n        printf(\"ID %d -> %s\\n\", i, Cap_getDeviceName(ctx,i));\n    }\n\n    int32_t streamID = Cap_openStream(ctx, 0, 0, 0, 0);\n    printf(\"Stream ID = %d\\n\", streamID);\n    \n    if (Cap_isOpenStream(ctx, streamID) == 1)\n    {\n        printf(\"Stream is open\\n\");\n    }\n    else\n    {\n        printf(\"Stream is closed (?)\\n\");\n    }\n\n    printf(\"Press Q to exit..\\n\");\n\n    std::vector<uint8_t> m_buffer;\n    m_buffer.resize(640*480*3);\n\n    Cap_setAutoExposure(ctx, streamID, 1);\n\n#if 1\n    uint32_t counter = 0;\n    uint32_t tries = 0;\n    while(counter < 30)\n    {\n        usleep(50000);\n        printf(\"%d\", Cap_getStreamFrameCount(ctx, streamID));\n        if (Cap_hasNewFrame(ctx, streamID) == 1)\n        {\n            Cap_captureFrame(ctx, streamID, &m_buffer[0], m_buffer.size());\n            counter++;\n        }\n        tries++;\n        if (tries == 1000)\n        {\n            break;\n        }\n    };\n#endif\n\n    Cap_setAutoExposure(ctx, streamID, 0);\n\n    \/\/ wait for a new frame .. \n    \/\/while (Cap_hasNewFrame(ctx, streamID) == 0) {};\n    \n    if (Cap_captureFrame(ctx, streamID, &m_buffer[0], m_buffer.size()) == CAPRESULT_OK)\n    {\n        printf(\"Buffer captured!\\n\");\n\n        FILE *fout = fopen(\"image.ppm\", \"wb\");\n        fprintf(fout, \"P6 640 480 255\\n\"); \/\/ PGM header\n\n        const uint32_t height = 480;\n        const uint32_t width  = 640;\n\n        \/\/ exchange BGR to RGB\n        uint32_t idx = 0;\n        for(uint32_t i=0; i<width*height; i++)\n        {\n            uint8_t b = m_buffer[idx];\n            uint8_t g = m_buffer[idx+1];\n            uint8_t r = m_buffer[idx+2];\n            m_buffer[idx++] = r;\n            m_buffer[idx++] = g;\n            m_buffer[idx++] = b;\n        }\n\n        \/\/ and upside-down :)\n        const uint32_t stride = 3;\n        const size_t lineBytes = width * stride;\n        uint8_t *row  = new uint8_t[lineBytes];\n        uint8_t *low  = &m_buffer[0];\n        uint8_t *high = &m_buffer[(height - 1) * lineBytes];\n\n        for (; low < high; low += lineBytes, high -= lineBytes) {\n            memcpy(row, low, lineBytes);\n            memcpy(low, high, lineBytes);\n            memcpy(high, row, lineBytes);\n        }\n        delete[] row;\n\n        fwrite(&m_buffer[0], 1, m_buffer.size(), fout);\n        fclose(fout);\n    }\n\n    char c = 0;\n    int32_t v = 0;\n    while((c != 'q') && (c != 'Q'))\n    {\n        c = getchar();\n        switch(c)\n        {\n        case '+':\n            printf(\"+\");\n            Cap_setExposure(ctx, streamID, ++v);\n            break;\n        case '-':\n            printf(\"-\");\n            Cap_setExposure(ctx, streamID, --v);\n            break;\n        case '0':\n            printf(\"0\");\n            v = 0;\n            Cap_setExposure(ctx, streamID, v);\n            break;        \n        }\n    }\n\n    Cap_closeStream(ctx, streamID);\n\n    CapResult result = Cap_releaseContext(ctx);\n\n    return 0;\n}\n\n<commit_msg>Updated linux test program<commit_after>\/*\n\n    openpnp test application\n\n    Niels Moseley\n\n*\/\n#include <stdio.h>\n#include <stdlib.h>\n#include <memory.h>\n#include <unistd.h>\n\n#include \"openpnp-capture.h\"\n#include \"..\/common\/context.h\"\n\nstd::string FourCCToString(uint32_t fourcc)\n{\n    std::string v;\n    for(uint32_t i=0; i<4; i++)\n    {\n        v += static_cast<char>(fourcc & 0xFF);\n        fourcc >>= 8;\n    }\n    return v;\n}\n\nint main(int argc, char*argv[])\n{    \n    uint32_t deviceFormatID = 0;\n    uint32_t deviceID       = 0;\n\n    printf(\"OpenPNP Capture Test Program\\n\");\n    Cap_setLogLevel(7);\n\n    if (argc >= 2)\n    {\n        deviceID = atoi(argv[1]);\n    }\n    \n    if (argc >= 3)\n    {\n        deviceFormatID = atoi(argv[2]);\n    }\n\n    CapContext ctx = Cap_createContext();\n\n    uint32_t deviceCount = Cap_getDeviceCount(ctx);\n    printf(\"Number of devices: %d\\n\", deviceCount);\n    for(uint32_t i=0; i<deviceCount; i++)\n    {\n        printf(\"ID %d -> %s\\n\", i, Cap_getDeviceName(ctx,i));\n\n        \/\/ show all supported frame buffer formats\n        int32_t nFormats = Cap_getNumFormats(ctx, i);\n\n        printf(\"  Number of formats: %d\\n\", nFormats);\n\n        std::string fourccString;\n        for(int32_t j=0; j<nFormats; j++)\n        {\n            CapFormatInfo finfo;\n            Cap_getFormatInfo(ctx, i, j, &finfo);\n            fourccString = FourCCToString(finfo.fourcc);\n\n            printf(\"  Format ID %d: %d x %d pixels  FOURCC=%s\\n\",\n                j, finfo.width, finfo.height, fourccString.c_str());\n        }\n    }\n\n    int32_t streamID = Cap_openStream(ctx, deviceID, deviceFormatID);\n    printf(\"Stream ID = %d\\n\", streamID);\n    \n    if (Cap_isOpenStream(ctx, streamID) == 1)\n    {\n        printf(\"Stream is open\\n\");\n    }\n    else\n    {\n        printf(\"Stream is closed (?)\\n\");\n        return 1;\n    }\n\n    printf(\"Press Q to exit..\\n\");\n\n    \/\/ get current stream parameters \n    CapFormatInfo finfo;\n    Cap_getFormatInfo(ctx, deviceID, deviceFormatID, &finfo);\n\n    std::vector<uint8_t> m_buffer;\n    m_buffer.resize(finfo.width*finfo.height*3);\n\n    Cap_setAutoExposure(ctx, streamID, 1);\n\n#if 1\n    uint32_t counter = 0;\n    uint32_t tries = 0;\n    while(counter < 30)\n    {\n        usleep(50*1000);\n        printf(\"%d\", Cap_getStreamFrameCount(ctx, streamID));\n        if (Cap_hasNewFrame(ctx, streamID) == 1)\n        {\n            Cap_captureFrame(ctx, streamID, &m_buffer[0], m_buffer.size());\n            counter++;\n        }\n        tries++;\n        if (tries == 1000)\n        {\n            break;\n        }\n    };\n#endif\n\n    Cap_setAutoExposure(ctx, streamID, 0);\n\n    \/\/ wait for a new frame .. \n    \/\/while (Cap_hasNewFrame(ctx, streamID) == 0) {};\n    \n    if (Cap_captureFrame(ctx, streamID, &m_buffer[0], m_buffer.size()) == CAPRESULT_OK)\n    {\n        printf(\"Buffer captured!\\n\");\n\n        FILE *fout = fopen(\"image.ppm\", \"wb\");\n        fprintf(fout, \"P6 %d %d 255\\n\", finfo.width, finfo.height); \/\/ PGM header\n\n        \/\/ exchange BGR to RGB\n        uint32_t idx = 0;\n        for(uint32_t i=0; i<finfo.width*finfo.height; i++)\n        {\n            uint8_t b = m_buffer[idx];\n            uint8_t g = m_buffer[idx+1];\n            uint8_t r = m_buffer[idx+2];\n            m_buffer[idx++] = r;\n            m_buffer[idx++] = g;\n            m_buffer[idx++] = b;\n        }\n\n        \/\/ and upside-down :)\n        const uint32_t stride = 3;\n        const size_t lineBytes = finfo.width * stride;\n        uint8_t *row  = new uint8_t[lineBytes];\n        uint8_t *low  = &m_buffer[0];\n        uint8_t *high = &m_buffer[(finfo.height - 1) * lineBytes];\n\n        for (; low < high; low += lineBytes, high -= lineBytes) {\n            memcpy(row, low, lineBytes);\n            memcpy(low, high, lineBytes);\n            memcpy(high, row, lineBytes);\n        }\n        delete[] row;\n\n        fwrite(&m_buffer[0], 1, m_buffer.size(), fout);\n        fclose(fout);\n    }\n\n    char c = 0;\n    int32_t v = 0;\n    while((c != 'q') && (c != 'Q'))\n    {\n        c = getchar();\n        switch(c)\n        {\n        case '+':\n            printf(\"+\");\n            Cap_setExposure(ctx, streamID, ++v);\n            break;\n        case '-':\n            printf(\"-\");\n            Cap_setExposure(ctx, streamID, --v);\n            break;\n        case '0':\n            printf(\"0\");\n            v = 0;\n            Cap_setExposure(ctx, streamID, v);\n            break;        \n        }\n    }\n\n    Cap_closeStream(ctx, streamID);\n\n    CapResult result = Cap_releaseContext(ctx);\n\n    return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: cgm.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2003-12-01 17:56: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 CGM_HXX_\n#define CGM_HXX_\n\n#ifndef _COM_SUN_STAR_FRAME_XMODEL_HPP_\n#include <com\/sun\/star\/frame\/XModel.hpp>\n#endif\n\n\/\/ ---------------------------------------------------------------\n#undef CGM_USER_BREAKPOINT\n\n#define CGM_IMPORT_CGM      0x00000001\n\n#define CGM_EXPORT_IMPRESS  0x00000100\n#define CGM_EXPORT_META     0x00000200\n\/\/#define CGM_EXPORT_COMMENT    0x00000400\n\n\/\/ ---------------------------------------------------------------\n\n#include <tools\/solar.h>\n#include <rtl\/ustring>\n#include <tools\/list.hxx>\n#include \"cgmtypes.hxx\"\n\n\/\/ ---------------------------------------------------------------\n\nclass   List;\nclass   Bundle;\nclass   Graphic;\nclass   SvStream;\nclass   CGMChart;\nclass   CGMBitmap;\nclass   CGMOutAct;\nclass   CGMElements;\nclass   BitmapColor;\nclass   GDIMetaFile;\nclass   VirtualDevice;\nclass   CGMBitmapDescriptor;\n\nclass CGM\n{\n        friend class CGMChart;\n        friend class CGMBitmap;\n        friend class CGMElements;\n        friend class CGMOutAct;\n        friend class CGMMetaOutAct;\n        friend class CGMImpressOutAct;\n\n        double              mnOutdx;                \/\/ Ausgabe Groesse in 1\/100TH mm\n        double              mnOutdy;                \/\/ auf das gemappt wird\n        double              mnVDCXadd;\n        double              mnVDCYadd;\n        double              mnVDCXmul;\n        double              mnVDCYmul;\n        double              mnVDCdx;\n        double              mnVDCdy;\n        double              mnXFraction;\n        double              mnYFraction;\n        sal_Bool                mbAngReverse;           \/\/ AngularDirection\n\n        Graphic*            mpGraphic;              \/\/ ifdef CGM_EXPORT_META\n        SvStream*           mpCommentOut;           \/\/ ifdef CGM_EXPORT_COMMENT\n\n        sal_Bool                mbStatus;\n        sal_Bool                mbMetaFile;\n        sal_Bool                mbIsFinished;\n        sal_Bool                mbPicture;\n        sal_Bool                mbPictureBody;\n        sal_Bool                mbFigure;\n        sal_Bool                mbFirstOutPut;\n        sal_uInt32              mnAct4PostReset;\n        CGMBitmap*          mpBitmapInUse;\n        CGMChart*           mpChart;                \/\/ if sal_True->\"SHWSLIDEREC\"\n                                                    \/\/  otherwise \"BEGINPIC\" commands\n                                                    \/\/ controlls page inserting\n        CGMElements*        pElement;\n        CGMElements*        pCopyOfE;\n        CGMOutAct*          mpOutAct;\n        List                maDefRepList;\n        List                maDefRepSizeList;\n\n        sal_uInt8*              mpSource;       \/\/ source buffer that is not increased\n                                            \/\/ ( instead use mnParaCount to index )\n        sal_uInt32              mnParaSize;     \/\/ actual parameter size which has been done so far\n        sal_uInt32              mnActCount;     \/\/ increased by each action\n        sal_uInt8*              mpBuf;          \/\/ source stream operation -> then this is allocated for\n                                            \/\/                            the temp input buffer\n\n        sal_uInt32              mnMode;         \/\/ source description\n        sal_uInt32              mnEscape;       \/\/\n        sal_uInt32              mnElementClass; \/\/\n        sal_uInt32              mnElementID;    \/\/\n        sal_uInt32              mnElementSize;  \/\/ full parameter size for the latest action\n\n        void                ImplCGMInit();\n        sal_uInt32          ImplGetUI16( sal_uInt32 nAlign = 0 );\n        sal_uInt8           ImplGetByte( sal_uInt32 nSource, sal_uInt32 nPrecision );\n        long                ImplGetI( sal_uInt32 nPrecision );\n        sal_uInt32          ImplGetUI( sal_uInt32 nPrecision );\n        void                ImplGetSwitch4( sal_uInt8* pSource, sal_uInt8* pDest );\n        void                ImplGetSwitch8( sal_uInt8* pSource, sal_uInt8* pDest );\n        double              ImplGetFloat( RealPrecision, sal_uInt32 nRealSize );\n        sal_uInt32          ImplGetBitmapColor( sal_Bool bDirectColor = sal_False );\n        void                ImplSetMapMode();\n        void                ImplMapDouble( double& );\n        void                ImplMapX( double& );\n        void                ImplMapY( double& );\n        void                ImplMapPoint( FloatPoint& );\n        inline double       ImplGetIY();\n        inline double       ImplGetFY();\n        inline double       ImplGetIX();\n        inline double       ImplGetFX();\n        sal_uInt32              ImplGetPointSize();\n        void                ImplGetPoint( FloatPoint& rFloatPoint, sal_Bool bMap = sal_False );\n        void                ImplGetRectangle( FloatRect&, sal_Bool bMap = sal_False );\n        void                ImplGetRectangleNS( FloatRect& );\n        void                ImplGetVector( double* );\n        double              ImplGetOrientation( FloatPoint& rCenter, FloatPoint& rPoint );\n        void                ImplSwitchStartEndAngle( double& rStartAngle, double& rEndAngle );\n        sal_Bool                ImplGetEllipse( FloatPoint& rCenter, FloatPoint& rRadius, double& rOrientation );\n\n        void                ImplDefaultReplacement();\n        void                ImplDoClass();\n        void                ImplDoClass0();\n        void                ImplDoClass1();\n        void                ImplDoClass2();\n        void                ImplDoClass3();\n        void                ImplDoClass4();\n        void                ImplDoClass5();\n        void                ImplDoClass6();\n        void                ImplDoClass7();\n        void                ImplDoClass8();\n        void                ImplDoClass9();\n        void                ImplDoClass15();\n        void                ImplDoClass16();\n\n    public:\n\n                            CGM( sal_uInt32 nMode );\n                            ~CGM();\n\n                            CGM( sal_uInt32 nMode, ::com::sun::star::uno::Reference< ::com::sun::star::frame::XModel > & rModel );\n#ifdef CGM_EXPORT_META\n        VirtualDevice*      mpVirDev;\n        GDIMetaFile*        mpGDIMetaFile;\n                            CGM( sal_uInt32 nMode, Graphic& rGraphic );\n#endif\n        void                ImplComment( sal_uInt32, char* );\n        sal_uInt32              GetBackGroundColor();\n        sal_Bool                IsValid() { return mbStatus; };\n        sal_Bool                IsFinished() { return mbIsFinished; };\n        sal_Bool                Write( sal_uInt8* pSource );\n        sal_Bool                Write( SvStream& rIStm );\n\n        friend SvStream& operator>>( SvStream& rOStm, CGM& rCGM );\n\n};\n#endif\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.3.146); FILE MERGED 2005\/09\/05 15:12:50 rt 1.3.146.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: cgm.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 02:49: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 CGM_HXX_\n#define CGM_HXX_\n\n#ifndef _COM_SUN_STAR_FRAME_XMODEL_HPP_\n#include <com\/sun\/star\/frame\/XModel.hpp>\n#endif\n\n\/\/ ---------------------------------------------------------------\n#undef CGM_USER_BREAKPOINT\n\n#define CGM_IMPORT_CGM      0x00000001\n\n#define CGM_EXPORT_IMPRESS  0x00000100\n#define CGM_EXPORT_META     0x00000200\n\/\/#define CGM_EXPORT_COMMENT    0x00000400\n\n\/\/ ---------------------------------------------------------------\n\n#include <tools\/solar.h>\n#include <rtl\/ustring>\n#include <tools\/list.hxx>\n#include \"cgmtypes.hxx\"\n\n\/\/ ---------------------------------------------------------------\n\nclass   List;\nclass   Bundle;\nclass   Graphic;\nclass   SvStream;\nclass   CGMChart;\nclass   CGMBitmap;\nclass   CGMOutAct;\nclass   CGMElements;\nclass   BitmapColor;\nclass   GDIMetaFile;\nclass   VirtualDevice;\nclass   CGMBitmapDescriptor;\n\nclass CGM\n{\n        friend class CGMChart;\n        friend class CGMBitmap;\n        friend class CGMElements;\n        friend class CGMOutAct;\n        friend class CGMMetaOutAct;\n        friend class CGMImpressOutAct;\n\n        double              mnOutdx;                \/\/ Ausgabe Groesse in 1\/100TH mm\n        double              mnOutdy;                \/\/ auf das gemappt wird\n        double              mnVDCXadd;\n        double              mnVDCYadd;\n        double              mnVDCXmul;\n        double              mnVDCYmul;\n        double              mnVDCdx;\n        double              mnVDCdy;\n        double              mnXFraction;\n        double              mnYFraction;\n        sal_Bool                mbAngReverse;           \/\/ AngularDirection\n\n        Graphic*            mpGraphic;              \/\/ ifdef CGM_EXPORT_META\n        SvStream*           mpCommentOut;           \/\/ ifdef CGM_EXPORT_COMMENT\n\n        sal_Bool                mbStatus;\n        sal_Bool                mbMetaFile;\n        sal_Bool                mbIsFinished;\n        sal_Bool                mbPicture;\n        sal_Bool                mbPictureBody;\n        sal_Bool                mbFigure;\n        sal_Bool                mbFirstOutPut;\n        sal_uInt32              mnAct4PostReset;\n        CGMBitmap*          mpBitmapInUse;\n        CGMChart*           mpChart;                \/\/ if sal_True->\"SHWSLIDEREC\"\n                                                    \/\/  otherwise \"BEGINPIC\" commands\n                                                    \/\/ controlls page inserting\n        CGMElements*        pElement;\n        CGMElements*        pCopyOfE;\n        CGMOutAct*          mpOutAct;\n        List                maDefRepList;\n        List                maDefRepSizeList;\n\n        sal_uInt8*              mpSource;       \/\/ source buffer that is not increased\n                                            \/\/ ( instead use mnParaCount to index )\n        sal_uInt32              mnParaSize;     \/\/ actual parameter size which has been done so far\n        sal_uInt32              mnActCount;     \/\/ increased by each action\n        sal_uInt8*              mpBuf;          \/\/ source stream operation -> then this is allocated for\n                                            \/\/                            the temp input buffer\n\n        sal_uInt32              mnMode;         \/\/ source description\n        sal_uInt32              mnEscape;       \/\/\n        sal_uInt32              mnElementClass; \/\/\n        sal_uInt32              mnElementID;    \/\/\n        sal_uInt32              mnElementSize;  \/\/ full parameter size for the latest action\n\n        void                ImplCGMInit();\n        sal_uInt32          ImplGetUI16( sal_uInt32 nAlign = 0 );\n        sal_uInt8           ImplGetByte( sal_uInt32 nSource, sal_uInt32 nPrecision );\n        long                ImplGetI( sal_uInt32 nPrecision );\n        sal_uInt32          ImplGetUI( sal_uInt32 nPrecision );\n        void                ImplGetSwitch4( sal_uInt8* pSource, sal_uInt8* pDest );\n        void                ImplGetSwitch8( sal_uInt8* pSource, sal_uInt8* pDest );\n        double              ImplGetFloat( RealPrecision, sal_uInt32 nRealSize );\n        sal_uInt32          ImplGetBitmapColor( sal_Bool bDirectColor = sal_False );\n        void                ImplSetMapMode();\n        void                ImplMapDouble( double& );\n        void                ImplMapX( double& );\n        void                ImplMapY( double& );\n        void                ImplMapPoint( FloatPoint& );\n        inline double       ImplGetIY();\n        inline double       ImplGetFY();\n        inline double       ImplGetIX();\n        inline double       ImplGetFX();\n        sal_uInt32              ImplGetPointSize();\n        void                ImplGetPoint( FloatPoint& rFloatPoint, sal_Bool bMap = sal_False );\n        void                ImplGetRectangle( FloatRect&, sal_Bool bMap = sal_False );\n        void                ImplGetRectangleNS( FloatRect& );\n        void                ImplGetVector( double* );\n        double              ImplGetOrientation( FloatPoint& rCenter, FloatPoint& rPoint );\n        void                ImplSwitchStartEndAngle( double& rStartAngle, double& rEndAngle );\n        sal_Bool                ImplGetEllipse( FloatPoint& rCenter, FloatPoint& rRadius, double& rOrientation );\n\n        void                ImplDefaultReplacement();\n        void                ImplDoClass();\n        void                ImplDoClass0();\n        void                ImplDoClass1();\n        void                ImplDoClass2();\n        void                ImplDoClass3();\n        void                ImplDoClass4();\n        void                ImplDoClass5();\n        void                ImplDoClass6();\n        void                ImplDoClass7();\n        void                ImplDoClass8();\n        void                ImplDoClass9();\n        void                ImplDoClass15();\n        void                ImplDoClass16();\n\n    public:\n\n                            CGM( sal_uInt32 nMode );\n                            ~CGM();\n\n                            CGM( sal_uInt32 nMode, ::com::sun::star::uno::Reference< ::com::sun::star::frame::XModel > & rModel );\n#ifdef CGM_EXPORT_META\n        VirtualDevice*      mpVirDev;\n        GDIMetaFile*        mpGDIMetaFile;\n                            CGM( sal_uInt32 nMode, Graphic& rGraphic );\n#endif\n        void                ImplComment( sal_uInt32, char* );\n        sal_uInt32              GetBackGroundColor();\n        sal_Bool                IsValid() { return mbStatus; };\n        sal_Bool                IsFinished() { return mbIsFinished; };\n        sal_Bool                Write( sal_uInt8* pSource );\n        sal_Bool                Write( SvStream& rIStm );\n\n        friend SvStream& operator>>( SvStream& rOStm, CGM& rCGM );\n\n};\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- coding: utf-8; mode: c++; tab-width: 3; indent-tabs-mode: nil -*-\n\nCopyright 2010, 2011, 2012, 2013, 2014\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::type_void_adapter\n\nnamespace abc {\n\n\/*! DOC:3395 Move constructors and exceptions\n\nIn this section, “move constructor” will strictly refer to class::class(class &&).\n\nAll classes must provide move constructors and assignment operators if the copy constructor would\nresult in execution of exception-prone code (e.g. resource allocation).\n\nBecause move constructors are employed widely in container classes that need to provide strong\nexception guarantee (fully transacted operation) even in case of moves, move constructors must not\nthrow exceptions. This requirement is relaxed for moves that involve two different classes, since\nthese will not be used by container classes.\n*\/\n\n\/\/! Encapsulates raw constructors, destructors and assignment operators for a type.\nstruct type_void_adapter {\npublic:\n   \/*! Prototype of a function that copies items from one array to another.\n\n   @param pDstBegin\n      Pointer to the start of the destination array. The items are supposed to be uninitialized.\n   @param pSrcBegin\n      Pointer to the first item to copy.\n   @param pSrcEnd\n      Pointer to beyond the last item to copy.\n   *\/\n   typedef void (* copy_fn)(void * pDstBegin, void const * pSrcBegin, void const * pSrcEnd);\n\n   \/*! Prototype of a function that destructs a range of items in an array.\n\n   @param pBegin\n      Pointer to the first item to destruct.\n   @param pEnd\n      Pointer to beyond the last item to destruct.\n   *\/\n   typedef void (* destr_fn)(void const * pBegin, void const * pEnd);\n\n   \/*! Prototype of a function that compares two values for equality.\n\n   @param p1\n      Pointer to the first item.\n   @param p2\n      Pointer to the second item.\n   @return\n      true if the items are equal, or false otherwise.\n   *\/\n   typedef bool (* equal_fn)(void const * p1, void const * p2);\n\n   \/*! Prototype of a function that moves items from one array to another.\n\n   @param pDstBegin\n      Pointer to the start of the destination array. The items are supposed to be uninitialized.\n   @param pSrcBegin\n      Pointer to the first item to move.\n   @param pSrcEnd\n      Pointer to beyond the last item to move.\n   *\/\n   typedef void (* move_fn)(void * pDstBegin, void * pSrcBegin, void * pSrcEnd);\n\npublic:\n   \/\/! Size of a variable of this type, in bytes.\n   std::size_t cb;\n   \/\/! Function to copy items from one array to another.\n   copy_fn copy_constr;\n   \/\/! Function to destruct items in an array.\n   destr_fn destruct;\n   \/\/! Function to compare two items for equality.\n   equal_fn equal;\n   \/\/! Function to move items from one array to another.\n   move_fn move_constr;\n\npublic:\n   \/\/! Constructor.\n   type_void_adapter() :\n      cb(0),\n      copy_constr(nullptr),\n      destruct(nullptr),\n      equal(nullptr),\n      move_constr(nullptr) {\n   }\n\n   \/\/! Initializes this->copy_constr.\n   template <typename T>\n   void set_copy_fn() {\n      copy_constr = reinterpret_cast<copy_fn>(_typed_copy_constr<typename std::remove_cv<T>::type>);\n#if ABC_HOST_GCC && ABC_HOST_GCC < 40700\n      \/\/ Force instantiating the template, even if (obviously) never executed.\n      if (!copy_constr) {\n         _typed_copy_constr<typename std::remove_cv<T>::type>(nullptr, nullptr, nullptr);\n      }\n#endif\n   }\n\n   \/\/! Initializes this->destruct.\n   template <typename T>\n   void set_destr_fn() {\n      destruct = reinterpret_cast<destr_fn>(_typed_destruct<typename std::remove_cv<T>::type>);\n#if ABC_HOST_GCC && ABC_HOST_GCC < 40700\n      \/\/ Force instantiating the template, even if (obviously) never executed.\n      if (!destruct) {\n         _typed_destruct<typename std::remove_cv<T>::type>(nullptr, nullptr);\n      }\n#endif\n   }\n\n   \/\/! Initializes this->equal.\n   template <typename T>\n   void set_equal_fn() {\n      equal = reinterpret_cast<equal_fn>(_typed_equal<typename std::remove_cv<T>::type>);\n#if ABC_HOST_GCC && ABC_HOST_GCC < 40700\n      \/\/ Force instantiating the template, even if (obviously) never executed.\n      if (!equal) {\n         _typed_equal<typename std::remove_cv<T>::type>(nullptr, nullptr);\n      }\n#endif\n   }\n\n   \/\/! Initializes this->move_constr.\n   template <typename T>\n   void set_move_fn() {\n      move_constr = reinterpret_cast<move_fn>(_typed_move_constr<typename std::remove_cv<T>::type>);\n#if ABC_HOST_GCC && ABC_HOST_GCC < 40700\n      \/\/ Force instantiating the template, even if (obviously) never executed.\n      if (!move_constr) {\n         _typed_move_constr<typename std::remove_cv<T>::type>(nullptr, nullptr, nullptr);\n      }\n#endif\n   }\n\n   \/\/! Initializes this->cb.\n   template <typename T>\n   void set_size() {\n      cb = sizeof(T);\n   }\n\nprivate:\n   \/*! Copies a range of items from one array to another, overwriting any existing contents in the\n   destination.\n\n   @param ptDstBegin\n      Pointer to the start of the destination array. The items are supposed to be uninitialized.\n   @param ptSrcBegin\n      Pointer to the first item to copy.\n   @param ptSrcEnd\n      Pointer to beyond the last item to copy.\n   *\/\n#if ABC_HOST_MSC\n   \/* MSC applies SFINAE too late, and when asked to get the address of the *one and only* valid\n   version of _typed_copy_constr() (see non-MSC code in the #else branch), it will raise an error\n   saying it doesn’t know which one to choose. *\/\n   template <typename T>\n   static void _typed_copy_constr(T * ptDstBegin, T const * ptSrcBegin, T const * ptSrcEnd) {\n      if (std::has_trivial_copy_constructor<T>::value) {\n         \/\/ No constructor, fastest copy possible.\n         memory::copy(ptDstBegin, ptSrcBegin, static_cast<std::size_t>(ptSrcEnd - ptSrcBegin));\n      } else {\n         \/\/ Assume that since it’s not trivial, it can throw exceptions, so perform a transactional\n         \/\/ copy.\n         T * ptDst = ptDstBegin;\n         try {\n            for (T const * ptSrc = ptSrcBegin; ptSrc < ptSrcEnd; ++ptSrc, ++ptDst) {\n               ::new(ptDst) T(*ptSrc);\n            }\n         } catch (...) {\n            \/\/ Undo (destruct) all the copies instantiated.\n            while (--ptDst >= ptDstBegin) {\n               ptDst->~T();\n            }\n            throw;\n         }\n      }\n   }\n#else \/\/if ABC_HOST_MSC\n   \/\/ Only enabled if the copy constructor is trivial.\n   template <typename T>\n   static void _typed_copy_constr(\n      typename std::enable_if<std::has_trivial_copy_constructor<T>::value, T *>::type ptDstBegin,\n      T const * ptSrcBegin, T const * ptSrcEnd\n   ) {\n      \/\/ No constructor, fastest copy possible.\n      memory::copy(ptDstBegin, ptSrcBegin, static_cast<std::size_t>(ptSrcEnd - ptSrcBegin));\n   }\n   \/\/ Only enabled if the copy constructor is not trivial.\n   template <typename T>\n   static void _typed_copy_constr(\n      typename std::enable_if<!std::has_trivial_copy_constructor<T>::value, T *>::type ptDstBegin,\n      T const * ptSrcBegin, T const * ptSrcEnd\n   ) {\n      \/\/ Assume that since it’s not trivial, it can throw exceptions, so perform a transactional\n      \/\/ copy.\n      T * ptDst = ptDstBegin;\n      try {\n         for (T const * ptSrc = ptSrcBegin; ptSrc < ptSrcEnd; ++ptSrc, ++ptDst) {\n            ::new(ptDst) T(*ptSrc);\n         }\n      } catch (...) {\n         \/\/ Undo (destruct) all the copies instantiated.\n         while (--ptDst >= ptDstBegin) {\n            ptDst->~T();\n         }\n         throw;\n      }\n   }\n#endif \/\/if ABC_HOST_MSC … else\n\n   \/*! Destructs a range of items in an array.\n\n   @param ptBegin\n      Pointer to the first item to destruct.\n   @param ptEnd\n      Pointer to beyond the last item to destruct.\n   *\/\n   template <typename T>\n   static void _typed_destruct(T const * ptBegin, T const * ptEnd) {\n      if (!std::has_trivial_destructor<T>::value) {\n         \/\/ The destructor is not a no-op.\n         for (T const * pt = ptBegin; pt < ptEnd; ++pt) {\n            pt->~T();\n         }\n      }\n   }\n\n   \/*! Compares two values for equality.\n\n   @param pt1\n      Pointer to the first item.\n   @param pt2\n      Pointer to the second item.\n   @return\n      true if the items are equal, or false otherwise.\n   *\/\n   template <typename T>\n   static bool _typed_equal(T const * pt1, T const * pt2) {\n      return *pt1 == *pt2;\n   }\n\n   \/*! Moves a range of items from one array to another, overwriting any existing contents in the\n   destination.\n\n   @param ptDstBegin\n      Pointer to the start of the destination array. The items are supposed to be uninitialized.\n   @param ptSrcBegin\n      Pointer to the first item to copy.\n   @param ptSrcEnd\n      Pointer to beyond the last item to copy.\n   *\/\n   template <typename T>\n   static void _typed_move_constr(T * ptDstBegin, T * ptSrcBegin, T * ptSrcEnd) {\n      for (T * ptSrc = ptSrcBegin, * ptDst = ptDstBegin; ptSrc < ptSrcEnd; ++ptSrc, ++ptDst) {\n         ::new(ptDst) T(std::move(*ptSrc));\n      }\n   }\n};\n\n} \/\/namespace abc\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n<commit_msg>Embrace GCC 4.8’s enhanced STL support<commit_after>\/* -*- coding: utf-8; mode: c++; tab-width: 3; indent-tabs-mode: nil -*-\n\nCopyright 2010, 2011, 2012, 2013, 2014\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::type_void_adapter\n\nnamespace abc {\n\n\/*! DOC:3395 Move constructors and exceptions\n\nIn this section, “move constructor” will strictly refer to class::class(class &&).\n\nAll classes must provide move constructors and assignment operators if the copy constructor would\nresult in execution of exception-prone code (e.g. resource allocation).\n\nBecause move constructors are employed widely in container classes that need to provide strong\nexception guarantee (fully transacted operation) even in case of moves, move constructors must not\nthrow exceptions. This requirement is relaxed for moves that involve two different classes, since\nthese will not be used by container classes.\n*\/\n\n\/\/! Encapsulates raw constructors, destructors and assignment operators for a type.\nstruct type_void_adapter {\npublic:\n   \/*! Prototype of a function that copies items from one array to another.\n\n   @param pDstBegin\n      Pointer to the start of the destination array. The items are supposed to be uninitialized.\n   @param pSrcBegin\n      Pointer to the first item to copy.\n   @param pSrcEnd\n      Pointer to beyond the last item to copy.\n   *\/\n   typedef void (* copy_fn)(void * pDstBegin, void const * pSrcBegin, void const * pSrcEnd);\n\n   \/*! Prototype of a function that destructs a range of items in an array.\n\n   @param pBegin\n      Pointer to the first item to destruct.\n   @param pEnd\n      Pointer to beyond the last item to destruct.\n   *\/\n   typedef void (* destr_fn)(void const * pBegin, void const * pEnd);\n\n   \/*! Prototype of a function that compares two values for equality.\n\n   @param p1\n      Pointer to the first item.\n   @param p2\n      Pointer to the second item.\n   @return\n      true if the items are equal, or false otherwise.\n   *\/\n   typedef bool (* equal_fn)(void const * p1, void const * p2);\n\n   \/*! Prototype of a function that moves items from one array to another.\n\n   @param pDstBegin\n      Pointer to the start of the destination array. The items are supposed to be uninitialized.\n   @param pSrcBegin\n      Pointer to the first item to move.\n   @param pSrcEnd\n      Pointer to beyond the last item to move.\n   *\/\n   typedef void (* move_fn)(void * pDstBegin, void * pSrcBegin, void * pSrcEnd);\n\npublic:\n   \/\/! Size of a variable of this type, in bytes.\n   std::size_t cb;\n   \/\/! Function to copy items from one array to another.\n   copy_fn copy_constr;\n   \/\/! Function to destruct items in an array.\n   destr_fn destruct;\n   \/\/! Function to compare two items for equality.\n   equal_fn equal;\n   \/\/! Function to move items from one array to another.\n   move_fn move_constr;\n\npublic:\n   \/\/! Constructor.\n   type_void_adapter() :\n      cb(0),\n      copy_constr(nullptr),\n      destruct(nullptr),\n      equal(nullptr),\n      move_constr(nullptr) {\n   }\n\n   \/\/! Initializes this->copy_constr.\n   template <typename T>\n   void set_copy_fn() {\n      copy_constr = reinterpret_cast<copy_fn>(_typed_copy_constr<typename std::remove_cv<T>::type>);\n#if ABC_HOST_GCC && ABC_HOST_GCC < 40700\n      \/\/ Force instantiating the template, even if (obviously) never executed.\n      if (!copy_constr) {\n         _typed_copy_constr<typename std::remove_cv<T>::type>(nullptr, nullptr, nullptr);\n      }\n#endif\n   }\n\n   \/\/! Initializes this->destruct.\n   template <typename T>\n   void set_destr_fn() {\n      destruct = reinterpret_cast<destr_fn>(_typed_destruct<typename std::remove_cv<T>::type>);\n#if ABC_HOST_GCC && ABC_HOST_GCC < 40700\n      \/\/ Force instantiating the template, even if (obviously) never executed.\n      if (!destruct) {\n         _typed_destruct<typename std::remove_cv<T>::type>(nullptr, nullptr);\n      }\n#endif\n   }\n\n   \/\/! Initializes this->equal.\n   template <typename T>\n   void set_equal_fn() {\n      equal = reinterpret_cast<equal_fn>(_typed_equal<typename std::remove_cv<T>::type>);\n#if ABC_HOST_GCC && ABC_HOST_GCC < 40700\n      \/\/ Force instantiating the template, even if (obviously) never executed.\n      if (!equal) {\n         _typed_equal<typename std::remove_cv<T>::type>(nullptr, nullptr);\n      }\n#endif\n   }\n\n   \/\/! Initializes this->move_constr.\n   template <typename T>\n   void set_move_fn() {\n      move_constr = reinterpret_cast<move_fn>(_typed_move_constr<typename std::remove_cv<T>::type>);\n#if ABC_HOST_GCC && ABC_HOST_GCC < 40700\n      \/\/ Force instantiating the template, even if (obviously) never executed.\n      if (!move_constr) {\n         _typed_move_constr<typename std::remove_cv<T>::type>(nullptr, nullptr, nullptr);\n      }\n#endif\n   }\n\n   \/\/! Initializes this->cb.\n   template <typename T>\n   void set_size() {\n      cb = sizeof(T);\n   }\n\nprivate:\n   \/*! Copies a range of items from one array to another, overwriting any existing contents in the\n   destination.\n\n   @param ptDstBegin\n      Pointer to the start of the destination array. The items are supposed to be uninitialized.\n   @param ptSrcBegin\n      Pointer to the first item to copy.\n   @param ptSrcEnd\n      Pointer to beyond the last item to copy.\n   *\/\n#if ABC_HOST_MSC\n   \/* MSC applies SFINAE too late, and when asked to get the address of the *one and only* valid\n   version of _typed_copy_constr() (see non-MSC code in the #else branch), it will raise an error\n   saying it doesn’t know which one to choose. *\/\n   template <typename T>\n   static void _typed_copy_constr(T * ptDstBegin, T const * ptSrcBegin, T const * ptSrcEnd) {\n      if (std::has_trivial_copy_constructor<T>::value) {\n         \/\/ No constructor, fastest copy possible.\n         memory::copy(ptDstBegin, ptSrcBegin, static_cast<std::size_t>(ptSrcEnd - ptSrcBegin));\n      } else {\n         \/\/ Assume that since it’s not trivial, it can throw exceptions, so perform a transactional\n         \/\/ copy.\n         T * ptDst = ptDstBegin;\n         try {\n            for (T const * ptSrc = ptSrcBegin; ptSrc < ptSrcEnd; ++ptSrc, ++ptDst) {\n               ::new(ptDst) T(*ptSrc);\n            }\n         } catch (...) {\n            \/\/ Undo (destruct) all the copies instantiated.\n            while (--ptDst >= ptDstBegin) {\n               ptDst->~T();\n            }\n            throw;\n         }\n      }\n   }\n#else \/\/if ABC_HOST_MSC\n   \/\/ Only enabled if the copy constructor is trivial.\n   template <typename T>\n   static void _typed_copy_constr(\n      typename std::enable_if<std::has_trivial_copy_constructor<T>::value, T *>::type ptDstBegin,\n      T const * ptSrcBegin, T const * ptSrcEnd\n   ) {\n      \/\/ No constructor, fastest copy possible.\n      memory::copy(ptDstBegin, ptSrcBegin, static_cast<std::size_t>(ptSrcEnd - ptSrcBegin));\n   }\n   \/\/ Only enabled if the copy constructor is not trivial.\n   template <typename T>\n   static void _typed_copy_constr(\n      typename std::enable_if<!std::has_trivial_copy_constructor<T>::value, T *>::type ptDstBegin,\n      T const * ptSrcBegin, T const * ptSrcEnd\n   ) {\n      \/\/ Assume that since it’s not trivial, it can throw exceptions, so perform a transactional\n      \/\/ copy.\n      T * ptDst = ptDstBegin;\n      try {\n         for (T const * ptSrc = ptSrcBegin; ptSrc < ptSrcEnd; ++ptSrc, ++ptDst) {\n            ::new(ptDst) T(*ptSrc);\n         }\n      } catch (...) {\n         \/\/ Undo (destruct) all the copies instantiated.\n         while (--ptDst >= ptDstBegin) {\n            ptDst->~T();\n         }\n         throw;\n      }\n   }\n#endif \/\/if ABC_HOST_MSC … else\n\n   \/*! Destructs a range of items in an array.\n\n   @param ptBegin\n      Pointer to the first item to destruct.\n   @param ptEnd\n      Pointer to beyond the last item to destruct.\n   *\/\n   template <typename T>\n   static void _typed_destruct(T const * ptBegin, T const * ptEnd) {\n#if ABC_HOST_GCC >= 40800\n      if (!std::is_trivially_destructible<T>::value) {\n#else\n      if (!std::has_trivial_destructor<T>::value) {\n#endif\n         \/\/ The destructor is not a no-op.\n         for (T const * pt = ptBegin; pt < ptEnd; ++pt) {\n            pt->~T();\n         }\n      }\n   }\n\n   \/*! Compares two values for equality.\n\n   @param pt1\n      Pointer to the first item.\n   @param pt2\n      Pointer to the second item.\n   @return\n      true if the items are equal, or false otherwise.\n   *\/\n   template <typename T>\n   static bool _typed_equal(T const * pt1, T const * pt2) {\n      return *pt1 == *pt2;\n   }\n\n   \/*! Moves a range of items from one array to another, overwriting any existing contents in the\n   destination.\n\n   @param ptDstBegin\n      Pointer to the start of the destination array. The items are supposed to be uninitialized.\n   @param ptSrcBegin\n      Pointer to the first item to copy.\n   @param ptSrcEnd\n      Pointer to beyond the last item to copy.\n   *\/\n   template <typename T>\n   static void _typed_move_constr(T * ptDstBegin, T * ptSrcBegin, T * ptSrcEnd) {\n      for (T * ptSrc = ptSrcBegin, * ptDst = ptDstBegin; ptSrc < ptSrcEnd; ++ptSrc, ++ptDst) {\n         ::new(ptDst) T(std::move(*ptSrc));\n      }\n   }\n};\n\n} \/\/namespace abc\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef CPPEVOLVE_TREE_H_\n#define CPPEVOLVE_TREE_H_\n\n#include \"cppEvolve\/utils.hpp\"\n#include <map>\n#include <string>\n#include <algorithm>\n#include <iostream>\n\nnamespace evolve\n{\n    namespace Tree\n    {\n\n        template<typename rtype>\n        class BaseNode\n        {\n        public:\n            virtual ~BaseNode()\n            {\n                for (auto child : this->children)\n                {\n                    delete child;\n                }\n            };\n\n            virtual rtype eval()=0;\n\n            std::vector<BaseNode<rtype>*>& getChildren() {\n                return children;\n            }\n\n            unsigned int getDepth() const {\n                unsigned int max = 0;\n                for (auto child : children)\n                {\n                    auto depth = child->getDepth();\n                    if (depth > max)\n                        max = depth;\n                }\n                return max+1;\n            }\n\n            virtual unsigned int getNumChildren() const =0;\n\n            const std::string& getName() const {return name;}\n\n            unsigned int getID() const {return ID;}\n\n            template<typename T>\n            friend std::ostream& operator<< (std::ostream &out, const BaseNode<T>& node);\n\n        protected:\n            BaseNode(const std::string& _name, unsigned int _id) :\n                name(_name),\n                ID(_id){}\n\n            BaseNode(const BaseNode<rtype>&)=delete;\n            BaseNode<rtype> operator=(const BaseNode<rtype>&)=delete;\n\n            std::vector<BaseNode<rtype>*> children;\n            const std::string name;\n            const unsigned int ID;\n        };\n\n\n        template<typename genome>\n        class Node : public BaseNode<typename genome::result_type>\n        {\n        public:\n            Node(genome g, const std::string& _name, unsigned int _id) :\n                BaseNode<typename genome::result_type>(_name, _id),\n                val(g)\n            {\n            }\n\n            virtual ~Node()\n            {\n            }\n\n            virtual typename genome::result_type eval() override\n            {\n                std::vector<typename genome::result_type> results;\n\n                std::for_each(this->children.begin(), this->children.end(),\n                        [&](BaseNode<typename genome::result_type>* child){results.push_back(child->eval());});\n\n                return unpack_caller<typename genome::result_type>::eval(val, results);\n            }\n\n            virtual unsigned int getNumChildren() const override\n            {\n                return count_args<genome>::value;\n            }\n\n        private:\n            genome val;\n        };\n\n\n        template<typename genome>\n        class Terminator: public BaseNode<typename genome::result_type>\n        {\n        public:\n            static_assert(count_args<genome>::value == 0, \"The number of arguments for a terminator must be 0\");\n\n            Terminator(genome g, const std::string& _name, unsigned int _id) :\n                BaseNode<typename genome::result_type>(_name, _id),\n                val(g){}\n\n            virtual ~Terminator(){}\n\n            virtual typename genome::result_type eval() override {\n                return val();\n            }\n\n            virtual unsigned int getNumChildren() const override  {\n                return 0;\n            }\n\n        private:\n            genome val;\n        };\n\n\n        template<typename rType>\n        class Tree\n        {\n        public:\n            Tree(BaseNode<rType>* _root) :\n                root(_root){}\n\n            ~Tree()\n            {\n                delete root;\n            }\n\n            rType eval() const {\n                return root->eval();\n            }\n\n            unsigned int getDepth() const {\n                return root->getDepth();\n            }\n\n\n            template<typename T>\n            friend std::ostream& operator<< (std::ostream &out, const Tree<T>& tree);\n\n            BaseNode<rType>* root;\n        protected:\n\n        };\n\n        template<typename T>\n        std::ostream& operator<< (std::ostream &out, const Tree<T>& tree)\n        {\n            out << *tree.root;\n            return out;\n        }\n\n\n        template<typename T>\n        std::ostream& operator<< (std::ostream &out, const BaseNode<T>& node)\n        {\n            out << node.name;\n\n            if (!node.children.empty()) {\n                out << \"(\";\n                for (unsigned int i=0; i < node.children.size()-1; ++i)\n                    out << *(node.children[i]) << \", \";\n\n                out << *node.children[node.children.size()-1] << \")\";\n            }\n            return out;\n        }\n\n\n        template<typename rType>\n        class TreeFactory\n        {\n        public:\n            TreeFactory(unsigned int _depth=5) :\n                depth(_depth),\n                currentID(0){}\n\n            template<typename... T>\n            void addNode(rType(*f)(T...), const std::string& name)\n            {\n                static_assert(sizeof...(T) > 0, \"Node function with 0 arguments should be terminator\");\n                const auto val = currentID;\n                std::function<BaseNode<rType>*()> func = [f, name, val]() {     \/\/explicitly capture to avoid bug in gcc\n                    return new Node<std::function<rType(T...)>>(f, name, val);\n                };\n                nodes[currentID++] = func;\n            }\n\n            void addTerminator(rType(*f)(), const std::string& name)\n            {\n                const auto val = currentID;\n                std::function<BaseNode<rType>*()> func = [f, name, val]() {\n                    return new Terminator<std::function<rType()>>(f, name, val);\n                };\n                terminators[currentID++] = func;\n            }\n\n            Tree<rType>* make() const\n            {\n                assert(!terminators.empty() && !nodes.empty());\n                auto tree = new Tree<rType>(createRandomSubTree(depth));\n\n                return tree;\n            }\n\n\n            BaseNode<rType>* copyNode(const BaseNode<rType>* node) const\n            {\n                if (nodes.find(node->getID()) != nodes.end())\n                {\n                    return nodes.at(node->getID())();\n                }\n                else\n                {\n                    return terminators.at(node->getID())();\n                }\n            }\n\n            BaseNode<rType>* copySubTree(BaseNode<rType>* node) const\n            {\n                auto root = copyNode(node);\n                for (auto child : node->getChildren())\n                {\n                    root->getChildren().push_back(copySubTree(child));\n                }\n                return root;\n            }\n\n            BaseNode<rType>* createRandomNode() const\n            {\n                auto loc = nodes.begin();\n                std::advance(loc, rand() % nodes.size());\n                return ((*loc).second)();\n            }\n\n            BaseNode<rType>* createRandomTerminator() const\n            {\n                auto loc = terminators.begin();\n                std::advance(loc, rand() % terminators.size());\n                return ((*loc).second)();\n            }\n\n            BaseNode<rType>* createRandomSubTree(unsigned int depth=5) const {\n\n                BaseNode<rType>* root = nullptr;\n\n                if (depth == 0) {\n                    root = createRandomTerminator();\n                }\n                else {\n                    root = createRandomNode();\n                    for (unsigned int i=0; i < root->getNumChildren(); ++i)\n                    {\n                        root->getChildren().push_back(createRandomSubTree(depth-1));\n                    }\n                }\n                return root;\n            }\n\n        protected:\n            unsigned int depth;\n            unsigned int currentID;\n            std::map<unsigned int, std::function<BaseNode<rType>*()>> nodes;\n            std::map<unsigned int, std::function<BaseNode<rType>*()>> terminators;\n\n        };\n    }\n}\n\n\n#endif\n<commit_msg>Performance improvements<commit_after>#ifndef CPPEVOLVE_TREE_H_\n#define CPPEVOLVE_TREE_H_\n\n#include \"cppEvolve\/utils.hpp\"\n#include <map>\n#include <string>\n#include <algorithm>\n#include <iostream>\n\nnamespace evolve\n{\n    namespace Tree\n    {\n\n        template<typename rtype>\n        class BaseNode\n        {\n        public:\n            virtual ~BaseNode()\n            {\n                for (auto child : this->children)\n                {\n                    delete child;\n                }\n            };\n\n            virtual rtype eval()=0;\n\n            std::vector<BaseNode<rtype>*>& getChildren() {\n                return children;\n            }\n\n            unsigned int getDepth() const {\n                unsigned int max = 0;\n                for (auto child : children)\n                {\n                    auto depth = child->getDepth();\n                    if (depth > max)\n                        max = depth;\n                }\n                return max+1;\n            }\n\n            virtual unsigned int getNumChildren() const =0;\n\n            const std::string& getName() const {return name;}\n\n            unsigned int getID() const {return ID;}\n\n            template<typename T>\n            friend std::ostream& operator<< (std::ostream &out, const BaseNode<T>& node);\n\n        protected:\n            BaseNode(const std::string& _name, unsigned int _id) :\n                name(_name),\n                ID(_id){}\n\n            BaseNode(const BaseNode<rtype>&)=delete;\n            BaseNode<rtype> operator=(const BaseNode<rtype>&)=delete;\n\n            std::vector<BaseNode<rtype>*> children;\n            const std::string name;\n            const unsigned int ID;\n        };\n\n\n        template<typename genome>\n        class Node : public BaseNode<typename genome::result_type>\n        {\n        public:\n            Node(genome g, const std::string& _name, unsigned int _id) :\n                BaseNode<typename genome::result_type>(_name, _id),\n                val(g)\n            {\n            }\n\n            virtual ~Node()\n            {\n            }\n\n            virtual typename genome::result_type eval() override\n            {\n                return unpack_caller<typename genome::result_type>::eval(val, this->children);\n            }\n\n            virtual unsigned int getNumChildren() const override\n            {\n                return count_args<genome>::value;\n            }\n\n        private:\n            genome val;\n        };\n\n\n        template<typename genome>\n        class Terminator: public BaseNode<typename genome::result_type>\n        {\n        public:\n            static_assert(count_args<genome>::value == 0, \"The number of arguments for a terminator must be 0\");\n\n            Terminator(genome g, const std::string& _name, unsigned int _id) :\n                BaseNode<typename genome::result_type>(_name, _id),\n                val(g){}\n\n            virtual ~Terminator(){}\n\n            virtual typename genome::result_type eval() override {\n                return val();\n            }\n\n            virtual unsigned int getNumChildren() const override  {\n                return 0;\n            }\n\n        private:\n            genome val;\n        };\n\n\n        template<typename rType>\n        class Tree\n        {\n        public:\n            Tree(BaseNode<rType>* _root) :\n                root(_root){}\n\n            ~Tree()\n            {\n                delete root;\n            }\n\n            rType eval() const {\n                return root->eval();\n            }\n\n            unsigned int getDepth() const {\n                return root->getDepth();\n            }\n\n\n            template<typename T>\n            friend std::ostream& operator<< (std::ostream &out, const Tree<T>& tree);\n\n            BaseNode<rType>* root;\n        protected:\n\n        };\n\n        template<typename T>\n        std::ostream& operator<< (std::ostream &out, const Tree<T>& tree)\n        {\n            out << *tree.root;\n            return out;\n        }\n\n\n        template<typename T>\n        std::ostream& operator<< (std::ostream &out, const BaseNode<T>& node)\n        {\n            out << node.name;\n\n            if (!node.children.empty()) {\n                out << \"(\";\n                for (unsigned int i=0; i < node.children.size()-1; ++i)\n                    out << *(node.children[i]) << \", \";\n\n                out << *node.children[node.children.size()-1] << \")\";\n            }\n            return out;\n        }\n\n\n        template<typename rType>\n        class TreeFactory\n        {\n        public:\n            TreeFactory(unsigned int _depth=5) :\n                depth(_depth),\n                currentID(0){}\n\n            template<typename... T>\n            void addNode(rType(*f)(T...), const std::string& name)\n            {\n                static_assert(sizeof...(T) > 0, \"Node function with 0 arguments should be terminator\");\n                const auto val = currentID;\n                std::function<BaseNode<rType>*()> func = [f, name, val]() {     \/\/explicitly capture to avoid bug in gcc\n                    return new Node<std::function<rType(T...)>>(f, name, val);\n                };\n                nodes[currentID++] = func;\n            }\n\n            void addTerminator(rType(*f)(), const std::string& name)\n            {\n                const auto val = currentID;\n                std::function<BaseNode<rType>*()> func = [f, name, val]() {\n                    return new Terminator<std::function<rType()>>(f, name, val);\n                };\n                terminators[currentID++] = func;\n            }\n\n            Tree<rType>* make() const\n            {\n                assert(!terminators.empty() && !nodes.empty());\n                auto tree = new Tree<rType>(createRandomSubTree(depth));\n\n                return tree;\n            }\n\n\n            BaseNode<rType>* copyNode(const BaseNode<rType>* node) const\n            {\n                if (nodes.find(node->getID()) != nodes.end())\n                {\n                    return nodes.at(node->getID())();\n                }\n                else\n                {\n                    return terminators.at(node->getID())();\n                }\n            }\n\n            BaseNode<rType>* copySubTree(BaseNode<rType>* node) const\n            {\n                auto root = copyNode(node);\n                for (auto child : node->getChildren())\n                {\n                    root->getChildren().push_back(copySubTree(child));\n                }\n                return root;\n            }\n\n            BaseNode<rType>* createRandomNode() const\n            {\n                auto loc = nodes.begin();\n                std::advance(loc, rand() % nodes.size());\n                return ((*loc).second)();\n            }\n\n            BaseNode<rType>* createRandomTerminator() const\n            {\n                auto loc = terminators.begin();\n                std::advance(loc, rand() % terminators.size());\n                return ((*loc).second)();\n            }\n\n            BaseNode<rType>* createRandomSubTree(unsigned int depth=5) const {\n\n                BaseNode<rType>* root = nullptr;\n\n                if (depth == 0) {\n                    root = createRandomTerminator();\n                }\n                else {\n                    root = createRandomNode();\n                    for (unsigned int i=0; i < root->getNumChildren(); ++i)\n                    {\n                        root->getChildren().push_back(createRandomSubTree(depth-1));\n                    }\n                }\n                return root;\n            }\n\n        protected:\n            unsigned int depth;\n            unsigned int currentID;\n            std::map<unsigned int, std::function<BaseNode<rType>*()>> nodes;\n            std::map<unsigned int, std::function<BaseNode<rType>*()>> terminators;\n\n        };\n    }\n}\n\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\/**\n\t@file\n\t@brief quit signal handler\n\n\tCopyright (C) 2009 Cybozu Labs, Inc., all rights reserved.\n*\/\n#ifdef _WIN32\n#include <windows.h>\n#else\n#include <signal.h>\n#endif\n#include <stdio.h>\n#include <stdlib.h>\n\nnamespace cybozu {\n\n\/*\n\tclass App must have quit() method\n*\/\ntemplate<class App>\nclass QuitSignalHandler {\n\tstatic App *app_;\n#ifdef _WIN32\n\tstatic inline BOOL WINAPI ctrlHandler(DWORD)\n\t{\n\t\tif (app_) app_->quit();\n\t\treturn TRUE;\n\t}\n#else\n\tstatic void ctrlHandler(int)\n\t{\n\t\tapp_->quit();\n\/\/\t\tsignal(SIGINT, SIG_IGN);\n\t}\n#endif\npublic:\n\texplicit QuitSignalHandler(App& app)\n\t{\n\t\tapp_ = &app;\n#ifdef _WIN32\n\t\tbool isOK = SetConsoleCtrlHandler(ctrlHandler, TRUE) != 0;\n#else\n\t\tstruct sigaction sa;\n\t\tsa.sa_handler = ctrlHandler;\n\t\tsigfillset(&sa.sa_mask);\n\t\tsa.sa_flags = 0;\n\t\tbool isOK = (sigaction(SIGINT, &sa, NULL) == 0)\n\t\t         && (sigaction(SIGQUIT, &sa, NULL) == 0)\n\t\t         && (sigaction(SIGABRT, &sa, NULL) == 0)\n\t\t         && (sigaction(SIGTERM, &sa, NULL) == 0);\n#endif\n\t\tif (!isOK) {\n\t\t\tfprintf(stderr, \"can't setup ctrl handler\\n\");\n\t\t\texit(1);\n\t\t}\n\t}\n};\n\ntemplate<class App>\nApp *QuitSignalHandler<App>::app_;\n\n} \/\/ cybozu\n<commit_msg>handler does not throw<commit_after>#pragma once\n\/**\n\t@file\n\t@brief quit signal handler\n\n\tCopyright (C) 2009 Cybozu Labs, Inc., all rights reserved.\n*\/\n#ifdef _WIN32\n#include <windows.h>\n#else\n#include <signal.h>\n#endif\n#include <stdio.h>\n#include <stdlib.h>\n\nnamespace cybozu {\n\n\/*\n\tclass App must have quit() method\n*\/\ntemplate<class App>\nclass QuitSignalHandler {\n\tstatic App *app_;\n#ifdef _WIN32\n\tstatic inline BOOL WINAPI ctrlHandler(DWORD) throw()\n\t{\n\t\tif (app_) app_->quit();\n\t\treturn TRUE;\n\t}\n#else\n\tstatic void ctrlHandler(int) throw()\n\t{\n\t\tapp_->quit();\n\/\/\t\tsignal(SIGINT, SIG_IGN);\n\t}\n#endif\npublic:\n\texplicit QuitSignalHandler(App& app)\n\t{\n\t\tapp_ = &app;\n#ifdef _WIN32\n\t\tbool isOK = SetConsoleCtrlHandler(ctrlHandler, TRUE) != 0;\n#else\n\t\tstruct sigaction sa;\n\t\tsa.sa_handler = ctrlHandler;\n\t\tsigfillset(&sa.sa_mask);\n\t\tsa.sa_flags = 0;\n\t\tbool isOK = (sigaction(SIGINT, &sa, NULL) == 0)\n\t\t         && (sigaction(SIGQUIT, &sa, NULL) == 0)\n\t\t         && (sigaction(SIGABRT, &sa, NULL) == 0)\n\t\t         && (sigaction(SIGTERM, &sa, NULL) == 0);\n#endif\n\t\tif (!isOK) {\n\t\t\tfprintf(stderr, \"can't setup ctrl handler\\n\");\n\t\t\texit(1);\n\t\t}\n\t}\n};\n\ntemplate<class App>\nApp *QuitSignalHandler<App>::app_;\n\n} \/\/ cybozu\n<|endoftext|>"}
{"text":"<commit_before>#ifndef COFFEE_MILL_MATH_BEST_FIT_STRUCTURE_HPP\n#define COFFEE_MILL_MATH_BEST_FIT_STRUCTURE_HPP\n#include \"Matrix.hpp\"\n#include \"Vector.hpp\"\n#include \"EigenSolver.hpp\"\n#include <vector>\n\nnamespace mill\n{\n\nclass BestFit\n{\n  public:\n    using real_type = double;\n\n  public:\n\n    BestFit() = default;\n    ~BestFit() = default;\n\n    std::vector<Vector<real_type, 3>>\n    fit(const std::vector<Vector<real_type, 3>>& snapshot,\n        const std::vector<Vector<real_type, 3>>& reference) const;\n\n    std::vector<Vector<real_type, 3>>\n    fit(const std::vector<Vector<real_type, 3>>& snapshot) const;\n\n    Matrix<real_type, 3, 3>\n    rotational_matrix(const std::vector<Vector<real_type, 3>>& snapshot,\n                      const std::vector<Vector<real_type, 3>>& reference) const;\n\n    Matrix<real_type, 3, 3>\n    rotational_matrix(const std::vector<Vector<real_type, 3>>& snapshot) const; \/\/ use cache\n\n    Vector<real_type, 3>\n    zeroing_vector(const std::vector<Vector<real_type, 3>>& snapshot) const;\n\n    std::vector<Vector<real_type, 3>> const& reference() const {return reference_;}\n    void set_reference(const std::vector<Vector<real_type, 3>>& snapshot);\n\n  private:\n\n    std::vector<Vector<real_type, 3>>\n    copy_to_center(const std::vector<Vector<real_type, 3>>& str) const;\n\n    void move_to_center(std::vector<Vector<real_type, 3>>& str) const;\n\n    Matrix<real_type, 3, 3>\n    make_rotational_matrix(const std::vector<Vector<real_type, 3>>& snapshot,\n                           const std::vector<Vector<real_type, 3>>& reference) const;\n\n    Matrix<real_type, 3, 3>\n    make_rotational_matrix(const Vector<real_type, 4>& quaternion) const;\n\n    Matrix<real_type, 4, 4>\n    make_score_matrix(const std::vector<Vector<real_type, 3>>& a,\n                      const std::vector<Vector<real_type, 3>>& b) const;\n  private:\n\n    Vector<real_type, 3> center_;\n    std::vector<Vector<real_type, 3>> reference_; \/\/!< optional;\n};\n\ninline std::vector<Vector<BestFit::real_type, 3>>\nBestFit::fit(const std::vector<Vector<real_type, 3>>& str,\n             const std::vector<Vector<real_type, 3>>& ref) const\n{\n    if(str.size() != ref.size())\n    {\n        log::fatal(\"BestFit::fit(structure, reference): \"\n                \"number of particles differ from each other.\");\n    }\n\n    auto target = this->copy_to_center(str);\n    const auto reference = this->copy_to_center(ref);\n\n    const auto R = this->make_rotational_matrix(target, reference);\n    for(auto& vec : target)\n    {\n        vec = R * vec;\n    }\n    return target;\n}\n\ninline std::vector<Vector<BestFit::real_type, 3>>\nBestFit::fit(const std::vector<Vector<real_type, 3>>& str) const\n{\n    if(str.size() != this->reference_.size())\n    {\n        log::fatal(\"BestFit::fit(structure): number of particles differ from \"\n                \"each other. Reference structure might not be defined\");\n    }\n\n    auto target = this->copy_to_center(str);\n\n    const auto R = this->make_rotational_matrix(target, this->reference_);\n    for(auto& vec : target)\n    {\n        vec = R * vec + this->center_;\n    }\n    return target;\n}\n\ninline Matrix<BestFit::real_type, 3, 3>\nBestFit::rotational_matrix(const std::vector<Vector<real_type, 3>>& str,\n                           const std::vector<Vector<real_type, 3>>& ref) const\n{\n    if(str.size() != ref.size())\n    {\n        log::fatal(\"BestFit::rotational_matrix(structure, reference): \"\n                \"number of particles differ from each other.\");\n    }\n\n    const auto target    = this->copy_to_center(str);\n    const auto reference = this->copy_to_center(ref);\n\n    return this->make_rotational_matrix(target, reference);\n}\n\ninline Matrix<BestFit::real_type, 3, 3>\nBestFit::rotational_matrix(const std::vector<Vector<real_type, 3>>& str) const\n{\n    if(str.size() != this->reference_.size())\n    {\n        log::fatal(\"BestFit::rotational_matrix(structure): \"\n                \"number of particles differ from each other. \"\n                \"reference structure might not be set.\");\n    }\n\n    const std::vector<Vector<real_type, 3>> target = this->copy_to_center(str);\n\n    return this->make_rotational_matrix(target, this->reference_);\n}\n\ninline Matrix<BestFit::real_type, 3, 3>\nBestFit::make_rotational_matrix(\n        const std::vector<Vector<real_type, 3>>& structure,\n        const std::vector<Vector<real_type, 3>>& reference) const\n{\n    if(structure.size() != reference.size())\n    {\n        log::fatal(\"BestFit::make_rotational_matrix(structure): \"\n                \"number of particles differ from each other. \");\n\n    }\n\n    std::vector<Vector<real_type, 3>> rA(structure.size());\n    std::vector<Vector<real_type, 3>> rB(structure.size());\n\n    for(std::size_t i=0; i < structure.size(); ++i)\n    {\n        rA[i] = reference[i] + structure[i];\n        rB[i] = reference[i] - structure[i];\n    }\n\n    auto score = make_score_matrix(rA, rB);\n\n    JacobiEigenSolver solver;\n    const auto ev = solver.solve(score);\n\n    \/\/ find a quaternion that corresponds to the minimum score (minimum RMSD)\n    double eigenvalue = std::numeric_limits<double>::max();\n    std::size_t index = 0;\n\n    for(std::size_t i=0; i<4; ++i)\n    {\n        if(ev.at(i).first < eigenvalue)\n        {\n            eigenvalue = ev.at(i).first;\n            index = i;\n        }\n    }\n\n    return this->make_rotational_matrix(ev.at(index).second);\n}\n\ninline Matrix<BestFit::real_type, 3, 3>\nBestFit::make_rotational_matrix(const Vector<real_type, 4>& q) const\n{\n    Matrix<real_type, 3, 3> R;\n    R(0,0) = 2 * q[0] * q[0] + 2 * q[1] * q[1] - 1.0;\n    R(0,1) = 2 * q[1] * q[2] - 2 * q[0] * q[3];\n    R(0,2) = 2 * q[1] * q[3] + 2 * q[0] * q[2];\n    R(1,0) = 2 * q[1] * q[2] + 2 * q[0] * q[3];\n    R(1,1) = 2 * q[0] * q[0] + 2 * q[2] * q[2] - 1.0;\n    R(1,2) = 2 * q[2] * q[3] - 2 * q[0] * q[1];\n    R(2,0) = 2 * q[1] * q[3] - 2 * q[0] * q[2];\n    R(2,1) = 2 * q[2] * q[3] + 2 * q[0] * q[1];\n    R(2,2) = 2 * q[0] * q[0] + 2 * q[3] * q[3] - 1.0;\n    return R;\n}\n\ninline Matrix<BestFit::real_type, 4, 4>\nBestFit::make_score_matrix(const std::vector<Vector<real_type, 3>>& a,\n                           const std::vector<Vector<real_type, 3>>& b) const\n{\n    if(a.size() != b.size())\n    {\n        log::fatal(\"BestFit::make_score_matrix(): numbers of particle differ from each other.\");\n    }\n\n    Matrix<real_type, 4, 4> retval;\n    retval(0,0) = 0.;\n    retval(0,1) = 0.;\n    retval(0,2) = 0.;\n    retval(0,3) = 0.;\n    retval(1,1) = 0.;\n    retval(1,2) = 0.;\n    retval(1,3) = 0.;\n    retval(2,2) = 0.;\n    retval(2,3) = 0.;\n    retval(3,3) = 0.;\n\n    for(std::size_t i=0; i<a.size(); ++i)\n    {\n        retval(0,0) += (b[i][0]*b[i][0]) + (b[i][1]*b[i][1]) + (b[i][2]*b[i][2]);\n        retval(0,1) += (a[i][2]*b[i][1]) - (a[i][1]*b[i][2]);\n        retval(0,2) += (a[i][0]*b[i][2]) - (a[i][2]*b[i][0]);\n        retval(0,3) += (a[i][1]*b[i][0]) - (a[i][0]*b[i][1]);\n        retval(1,1) += (b[i][0]*b[i][0]) + (a[i][1]*a[i][1]) + (a[i][2]*a[i][2]);\n        retval(1,2) += (b[i][0]*b[i][1]) - (a[i][0]*a[i][1]);\n        retval(1,3) += (b[i][0]*b[i][2]) - (a[i][0]*a[i][2]);\n        retval(2,2) += (a[i][0]*a[i][0]) + (b[i][1]*b[i][1]) + (a[i][2]*a[i][2]);\n        retval(2,3) += (b[i][1]*b[i][2]) - (a[i][1]*a[i][2]);\n        retval(3,3) += (a[i][0]*a[i][0]) + (a[i][1]*a[i][1]) + (b[i][2]*b[i][2]);\n    }\n\n    const real_type invN = 1. \/ static_cast<real_type>(a.size());\n\n    retval(0,0) *= invN;\n    retval(0,1) *= invN;\n    retval(0,2) *= invN;\n    retval(0,3) *= invN;\n    retval(1,1) *= invN;\n    retval(1,2) *= invN;\n    retval(1,3) *= invN;\n    retval(2,2) *= invN;\n    retval(2,3) *= invN;\n    retval(3,3) *= invN;\n\n    \/\/symmetric matrix\n    retval(1,0) = retval(0,1);\n    retval(2,0) = retval(0,2);\n    retval(2,1) = retval(1,2);\n    retval(3,0) = retval(0,3);\n    retval(3,1) = retval(1,3);\n    retval(3,2) = retval(2,3);\n\n    return retval;\n}\n\ninline std::vector<Vector<BestFit::real_type, 3>>\nBestFit::copy_to_center(const std::vector<Vector<real_type, 3>>& str) const\n{\n    const auto centroid = this->zeroing_vector(str);\n\n    std::vector<Vector<real_type, 3>> retval(str.size());\n    for(std::size_t i = 0; i<str.size(); ++i)\n    {\n        retval[i] = str[i] - centroid;\n    }\n    return retval;\n}\n\ninline void BestFit::move_to_center(std::vector<Vector<real_type, 3>>& str) const\n{\n    const auto centroid = this->zeroing_vector(str);\n    for(auto& vec : str)\n    {\n        vec -= centroid;\n    }\n    return ;\n}\n\ninline void BestFit::set_reference(const std::vector<Vector<real_type, 3>>& ref)\n{\n    this->reference_ = ref;\n    this->center_    = this->zeroing_vector(ref);\n    this->move_to_center(this->reference_);\n    return;\n}\n\ninline Vector<BestFit::real_type, 3>\nBestFit::zeroing_vector(const std::vector<Vector<real_type, 3>>& str) const\n{\n    Vector<real_type, 3> sum(0., 0., 0.);\n    for(const auto& vec : str)\n    {\n        sum += vec;\n    }\n    return sum \/ static_cast<real_type>(str.size());\n}\n\n}\/\/ mill\n#endif \/* COFFEE_MILL_BEST_FIT *\/\n<commit_msg>:art: remove needless empty line<commit_after>#ifndef COFFEE_MILL_MATH_BEST_FIT_STRUCTURE_HPP\n#define COFFEE_MILL_MATH_BEST_FIT_STRUCTURE_HPP\n#include \"Matrix.hpp\"\n#include \"Vector.hpp\"\n#include \"EigenSolver.hpp\"\n#include <vector>\n\nnamespace mill\n{\n\nclass BestFit\n{\n  public:\n    using real_type = double;\n\n  public:\n\n    BestFit() = default;\n    ~BestFit() = default;\n\n    std::vector<Vector<real_type, 3>>\n    fit(const std::vector<Vector<real_type, 3>>& snapshot,\n        const std::vector<Vector<real_type, 3>>& reference) const;\n\n    std::vector<Vector<real_type, 3>>\n    fit(const std::vector<Vector<real_type, 3>>& snapshot) const;\n\n    Matrix<real_type, 3, 3>\n    rotational_matrix(const std::vector<Vector<real_type, 3>>& snapshot,\n                      const std::vector<Vector<real_type, 3>>& reference) const;\n\n    Matrix<real_type, 3, 3>\n    rotational_matrix(const std::vector<Vector<real_type, 3>>& snapshot) const; \/\/ use cache\n\n    Vector<real_type, 3>\n    zeroing_vector(const std::vector<Vector<real_type, 3>>& snapshot) const;\n\n    std::vector<Vector<real_type, 3>> const& reference() const {return reference_;}\n    void set_reference(const std::vector<Vector<real_type, 3>>& snapshot);\n\n  private:\n\n    std::vector<Vector<real_type, 3>>\n    copy_to_center(const std::vector<Vector<real_type, 3>>& str) const;\n\n    void move_to_center(std::vector<Vector<real_type, 3>>& str) const;\n\n    Matrix<real_type, 3, 3>\n    make_rotational_matrix(const std::vector<Vector<real_type, 3>>& snapshot,\n                           const std::vector<Vector<real_type, 3>>& reference) const;\n\n    Matrix<real_type, 3, 3>\n    make_rotational_matrix(const Vector<real_type, 4>& quaternion) const;\n\n    Matrix<real_type, 4, 4>\n    make_score_matrix(const std::vector<Vector<real_type, 3>>& a,\n                      const std::vector<Vector<real_type, 3>>& b) const;\n  private:\n\n    Vector<real_type, 3> center_;\n    std::vector<Vector<real_type, 3>> reference_; \/\/!< optional;\n};\n\ninline std::vector<Vector<BestFit::real_type, 3>>\nBestFit::fit(const std::vector<Vector<real_type, 3>>& str,\n             const std::vector<Vector<real_type, 3>>& ref) const\n{\n    if(str.size() != ref.size())\n    {\n        log::fatal(\"BestFit::fit(structure, reference): \"\n                \"number of particles differ from each other.\");\n    }\n\n    auto target = this->copy_to_center(str);\n    const auto reference = this->copy_to_center(ref);\n\n    const auto R = this->make_rotational_matrix(target, reference);\n    for(auto& vec : target)\n    {\n        vec = R * vec;\n    }\n    return target;\n}\n\ninline std::vector<Vector<BestFit::real_type, 3>>\nBestFit::fit(const std::vector<Vector<real_type, 3>>& str) const\n{\n    if(str.size() != this->reference_.size())\n    {\n        log::fatal(\"BestFit::fit(structure): number of particles differ from \"\n                \"each other. Reference structure might not be defined\");\n    }\n\n    auto target = this->copy_to_center(str);\n\n    const auto R = this->make_rotational_matrix(target, this->reference_);\n    for(auto& vec : target)\n    {\n        vec = R * vec + this->center_;\n    }\n    return target;\n}\n\ninline Matrix<BestFit::real_type, 3, 3>\nBestFit::rotational_matrix(const std::vector<Vector<real_type, 3>>& str,\n                           const std::vector<Vector<real_type, 3>>& ref) const\n{\n    if(str.size() != ref.size())\n    {\n        log::fatal(\"BestFit::rotational_matrix(structure, reference): \"\n                \"number of particles differ from each other.\");\n    }\n\n    const auto target    = this->copy_to_center(str);\n    const auto reference = this->copy_to_center(ref);\n\n    return this->make_rotational_matrix(target, reference);\n}\n\ninline Matrix<BestFit::real_type, 3, 3>\nBestFit::rotational_matrix(const std::vector<Vector<real_type, 3>>& str) const\n{\n    if(str.size() != this->reference_.size())\n    {\n        log::fatal(\"BestFit::rotational_matrix(structure): \"\n                \"number of particles differ from each other. \"\n                \"reference structure might not be set.\");\n    }\n\n    const std::vector<Vector<real_type, 3>> target = this->copy_to_center(str);\n\n    return this->make_rotational_matrix(target, this->reference_);\n}\n\ninline Matrix<BestFit::real_type, 3, 3>\nBestFit::make_rotational_matrix(\n        const std::vector<Vector<real_type, 3>>& structure,\n        const std::vector<Vector<real_type, 3>>& reference) const\n{\n    if(structure.size() != reference.size())\n    {\n        log::fatal(\"BestFit::make_rotational_matrix(structure): \"\n                \"number of particles differ from each other. \");\n    }\n\n    std::vector<Vector<real_type, 3>> rA(structure.size());\n    std::vector<Vector<real_type, 3>> rB(structure.size());\n\n    for(std::size_t i=0; i < structure.size(); ++i)\n    {\n        rA[i] = reference[i] + structure[i];\n        rB[i] = reference[i] - structure[i];\n    }\n\n    auto score = make_score_matrix(rA, rB);\n\n    JacobiEigenSolver solver;\n    const auto ev = solver.solve(score);\n\n    \/\/ find a quaternion that corresponds to the minimum score (minimum RMSD)\n    double eigenvalue = std::numeric_limits<double>::max();\n    std::size_t index = 0;\n\n    for(std::size_t i=0; i<4; ++i)\n    {\n        if(ev.at(i).first < eigenvalue)\n        {\n            eigenvalue = ev.at(i).first;\n            index = i;\n        }\n    }\n\n    return this->make_rotational_matrix(ev.at(index).second);\n}\n\ninline Matrix<BestFit::real_type, 3, 3>\nBestFit::make_rotational_matrix(const Vector<real_type, 4>& q) const\n{\n    Matrix<real_type, 3, 3> R;\n    R(0,0) = 2 * q[0] * q[0] + 2 * q[1] * q[1] - 1.0;\n    R(0,1) = 2 * q[1] * q[2] - 2 * q[0] * q[3];\n    R(0,2) = 2 * q[1] * q[3] + 2 * q[0] * q[2];\n    R(1,0) = 2 * q[1] * q[2] + 2 * q[0] * q[3];\n    R(1,1) = 2 * q[0] * q[0] + 2 * q[2] * q[2] - 1.0;\n    R(1,2) = 2 * q[2] * q[3] - 2 * q[0] * q[1];\n    R(2,0) = 2 * q[1] * q[3] - 2 * q[0] * q[2];\n    R(2,1) = 2 * q[2] * q[3] + 2 * q[0] * q[1];\n    R(2,2) = 2 * q[0] * q[0] + 2 * q[3] * q[3] - 1.0;\n    return R;\n}\n\ninline Matrix<BestFit::real_type, 4, 4>\nBestFit::make_score_matrix(const std::vector<Vector<real_type, 3>>& a,\n                           const std::vector<Vector<real_type, 3>>& b) const\n{\n    if(a.size() != b.size())\n    {\n        log::fatal(\"BestFit::make_score_matrix(): numbers of particle differ from each other.\");\n    }\n\n    Matrix<real_type, 4, 4> retval;\n    retval(0,0) = 0.;\n    retval(0,1) = 0.;\n    retval(0,2) = 0.;\n    retval(0,3) = 0.;\n    retval(1,1) = 0.;\n    retval(1,2) = 0.;\n    retval(1,3) = 0.;\n    retval(2,2) = 0.;\n    retval(2,3) = 0.;\n    retval(3,3) = 0.;\n\n    for(std::size_t i=0; i<a.size(); ++i)\n    {\n        retval(0,0) += (b[i][0]*b[i][0]) + (b[i][1]*b[i][1]) + (b[i][2]*b[i][2]);\n        retval(0,1) += (a[i][2]*b[i][1]) - (a[i][1]*b[i][2]);\n        retval(0,2) += (a[i][0]*b[i][2]) - (a[i][2]*b[i][0]);\n        retval(0,3) += (a[i][1]*b[i][0]) - (a[i][0]*b[i][1]);\n        retval(1,1) += (b[i][0]*b[i][0]) + (a[i][1]*a[i][1]) + (a[i][2]*a[i][2]);\n        retval(1,2) += (b[i][0]*b[i][1]) - (a[i][0]*a[i][1]);\n        retval(1,3) += (b[i][0]*b[i][2]) - (a[i][0]*a[i][2]);\n        retval(2,2) += (a[i][0]*a[i][0]) + (b[i][1]*b[i][1]) + (a[i][2]*a[i][2]);\n        retval(2,3) += (b[i][1]*b[i][2]) - (a[i][1]*a[i][2]);\n        retval(3,3) += (a[i][0]*a[i][0]) + (a[i][1]*a[i][1]) + (b[i][2]*b[i][2]);\n    }\n\n    const real_type invN = 1. \/ static_cast<real_type>(a.size());\n\n    retval(0,0) *= invN;\n    retval(0,1) *= invN;\n    retval(0,2) *= invN;\n    retval(0,3) *= invN;\n    retval(1,1) *= invN;\n    retval(1,2) *= invN;\n    retval(1,3) *= invN;\n    retval(2,2) *= invN;\n    retval(2,3) *= invN;\n    retval(3,3) *= invN;\n\n    \/\/symmetric matrix\n    retval(1,0) = retval(0,1);\n    retval(2,0) = retval(0,2);\n    retval(2,1) = retval(1,2);\n    retval(3,0) = retval(0,3);\n    retval(3,1) = retval(1,3);\n    retval(3,2) = retval(2,3);\n\n    return retval;\n}\n\ninline std::vector<Vector<BestFit::real_type, 3>>\nBestFit::copy_to_center(const std::vector<Vector<real_type, 3>>& str) const\n{\n    const auto centroid = this->zeroing_vector(str);\n\n    std::vector<Vector<real_type, 3>> retval(str.size());\n    for(std::size_t i = 0; i<str.size(); ++i)\n    {\n        retval[i] = str[i] - centroid;\n    }\n    return retval;\n}\n\ninline void BestFit::move_to_center(std::vector<Vector<real_type, 3>>& str) const\n{\n    const auto centroid = this->zeroing_vector(str);\n    for(auto& vec : str)\n    {\n        vec -= centroid;\n    }\n    return ;\n}\n\ninline void BestFit::set_reference(const std::vector<Vector<real_type, 3>>& ref)\n{\n    this->reference_ = ref;\n    this->center_    = this->zeroing_vector(ref);\n    this->move_to_center(this->reference_);\n    return;\n}\n\ninline Vector<BestFit::real_type, 3>\nBestFit::zeroing_vector(const std::vector<Vector<real_type, 3>>& str) const\n{\n    Vector<real_type, 3> sum(0., 0., 0.);\n    for(const auto& vec : str)\n    {\n        sum += vec;\n    }\n    return sum \/ static_cast<real_type>(str.size());\n}\n\n}\/\/ mill\n#endif \/* COFFEE_MILL_BEST_FIT *\/\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"sani\/engine\/messaging\/messages\/document_message.hpp\"\n#include \"sani\/types.hpp\"\n\nnamespace sani {\n\n\tnamespace engine {\n\t\t\n\t\tnamespace services {\n\t\t\t\n\t\t\tnamespace filesystemservice {\n\t\t\t}\n\t\t}\n\t}\n}<commit_msg>file sys service WIP<commit_after>#pragma once\n\n#include \"sani\/engine\/messaging\/messages\/document_message.hpp\"\n#include \"sani\/types.hpp\"\n\nnamespace sani {\n\n\tnamespace engine {\n\t\t\n\t\tnamespace services {\n\t\t\t\n\t\t\t\/\/\/ ! Contains the contract definition and helper functions to interact with \n\t\t\t\/\/\/   the file system service.\n\t\t\tnamespace filesystemservice {\n\n\t\t\t\t\/*\n\t\t\t\t\t\n\t\t\t\t*\/\n\n\t\t\t\tenum class FilesystemCommands : uint32 {\n\t\t\t\t\tFileExists\t\t\t= 0,\n\n\t\t\t\t\tOpenFile\t\t\t= 1,\n\n\t\t\t\t\tCloseFile\t\t\t= 2,\n\n\t\t\t\t\tIsAbsolutePath\t\t= 3,\n\n\t\t\t\t\tGetFileData\t\t\t= 4,\n\n\t\t\t\t\tGetFileDataString\t= 5,\n\n\t\t\t\t\tListFiles\t\t\t= 6\n\t\t\t\t};\n\n\t\t\t\tvoid fileExists(messages::DocumentMessage* const message);\n\t\t\t\t\n\t\t\t\tvoid openFile(messages::DocumentMessage* const message);\n\n\t\t\t\tvoid closeFile(messages::DocumentMessage* const message);\n\t\t\t\t\n\t\t\t\tvoid isAbsolutePath(messages::DocumentMessage* const message);\n\t\t\t\t\n\t\t\t\tvoid getFileDataString(messages::DocumentMessage* const message);\n\t\t\t\t\n\t\t\t\tvoid listFiles(messages::DocumentMessage* const message);\n\t\t\t}\n\t\t}\n\t}\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 * Variable.tcc : implement long template functions\n *\n *  Created on: Jan 31, 2019\n *      Author: William F Godoy\n *\/\n\n#ifndef ADIOS2_CORE_VARIABLE_TCC_\n#define ADIOS2_CORE_VARIABLE_TCC_\n\n#include \"Variable.h\"\n\n#include \"adios2\/core\/Engine.h\"\n#include \"adios2\/helper\/adiosFunctions.h\"\n\nnamespace adios2\n{\nnamespace core\n{\n\ntemplate <class T>\nDims Variable<T>::Shape(const size_t step) const\n{\n    if (m_DebugMode)\n    {\n        if (!m_FirstStreamingStep && step != DefaultSizeT)\n        {\n            throw std::invalid_argument(\"ERROR: can't pass a step input in \"\n                                        \"streaming (BeginStep\/EndStep)\"\n                                        \"mode for variable \" +\n                                        m_Name +\n                                        \", in call to Variable<T>::Shape\\n\");\n        }\n    }\n\n    if (m_FirstStreamingStep && step == DefaultSizeT)\n    {\n        return m_Shape;\n    }\n\n    if (m_Engine != nullptr && m_ShapeID == ShapeID::GlobalArray)\n    {\n        const size_t stepInput =\n            !m_FirstStreamingStep ? m_Engine->CurrentStep() : step;\n\n        const std::vector<typename Variable<T>::Info> blocksInfo =\n            m_Engine->BlocksInfo<T>(*this, stepInput);\n\n        if (blocksInfo.size() == 0)\n        {\n            return Dims();\n        }\n\n        if (blocksInfo.front().Shape.size() == 1 &&\n            blocksInfo.front().Shape.front() == LocalValueDim)\n        {\n            return Dims{blocksInfo.size()};\n        }\n\n        return blocksInfo.front().Shape;\n    }\n    return m_Shape;\n}\n\ntemplate <class T>\nstd::pair<T, T> Variable<T>::MinMax(const size_t step) const\n{\n    if (m_DebugMode && !m_FirstStreamingStep && step != DefaultSizeT)\n    {\n        throw std::invalid_argument(\n            \"ERROR: can't pass a step input in streaming (BeginStep\/EndStep)\"\n            \"mode for variable \" +\n            m_Name + \", in call to Variable<T>:: Min Max or MinMax\\n\");\n    }\n\n    std::pair<T, T> minMax;\n    minMax.first = {};\n    minMax.second = {};\n\n    if (m_Engine != nullptr && !m_FirstStreamingStep)\n    {\n        const size_t stepInput =\n            (step == DefaultSizeT) ? m_Engine->CurrentStep() : step;\n\n        const std::vector<typename Variable<T>::Info> blocksInfo =\n            m_Engine->BlocksInfo<T>(*this, stepInput);\n\n        if (blocksInfo.size() == 0)\n        {\n            return minMax;\n        }\n\n        if (m_ShapeID == ShapeID::LocalArray)\n        {\n            if (m_DebugMode && m_BlockID >= blocksInfo.size())\n            {\n                throw std::invalid_argument(\n                    \"ERROR: BlockID \" + std::to_string(m_BlockID) +\n                    \" does not exist for LocalArray variable \" + m_Name +\n                    \", in call to MinMax, Min or Maxn\");\n            }\n            minMax.first = blocksInfo[m_BlockID].Min;\n            minMax.second = blocksInfo[m_BlockID].Max;\n            return minMax;\n        }\n\n        const bool isValue =\n            ((blocksInfo.front().Shape.size() == 1 &&\n              blocksInfo.front().Shape.front() == LocalValueDim) ||\n             m_ShapeID == ShapeID::GlobalValue)\n                ? true\n                : false;\n\n        minMax.first =\n            isValue ? blocksInfo.front().Value : blocksInfo.front().Min;\n        minMax.second =\n            isValue ? blocksInfo.front().Value : blocksInfo.front().Max;\n\n        for (const typename Variable<T>::Info &blockInfo : blocksInfo)\n        {\n            const T minValue = isValue ? blockInfo.Value : blockInfo.Min;\n\n            if (helper::LessThan<T>(minValue, minMax.first))\n            {\n                minMax.first = minValue;\n            }\n\n            const T maxValue = isValue ? blockInfo.Value : blockInfo.Max;\n\n            if (helper::GreaterThan<T>(maxValue, minMax.second))\n            {\n                minMax.second = maxValue;\n            }\n        }\n    }\n    else\n    {\n        minMax.first = m_Min;\n        minMax.second = m_Max;\n    }\n    return minMax;\n}\n\ntemplate <class T>\nstd::vector<std::vector<typename Variable<T>::Info>>\nVariable<T>::AllStepsBlocksInfo() const\n{\n    if (m_DebugMode && m_Engine == nullptr)\n    {\n        if (m_Engine == nullptr)\n        {\n            throw std::invalid_argument(\n                \"ERROR: from variable \" + m_Name +\n                \" function is only valid in read mode, in \"\n                \"call to Variable<T>::AllBlocksInfo\\n\");\n        }\n\n        if (!m_FirstStreamingStep)\n        {\n            throw std::invalid_argument(\"ERROR: from variable \" + m_Name +\n                                        \" function is not valid in \"\n                                        \"random-access read mode \"\n                                        \"(BeginStep\/EndStep), in \"\n                                        \"call to Variable<T>::AllBlocksInfo\\n\");\n        }\n    }\n\n    return m_Engine->AllRelativeStepsBlocksInfo(*this);\n}\n\ntemplate <class T>\nVariable<T>::Variable(const std::string &name, const Dims &shape,\n                      const Dims &start, const Dims &count,\n                      const bool constantDims, const bool debugMode)\n: VariableBase(name, helper::GetType<T>(), sizeof(T), shape, start, count,\n               constantDims, debugMode)\n{\n    m_BlocksInfo.reserve(1);\n}\n\ntemplate <class T>\ntypename Variable<T>::Info &\nVariable<T>::SetBlockInfo(const T *data, const size_t stepsStart,\n                          const size_t stepsCount) noexcept\n{\n    Info info;\n    info.Shape = m_Shape;\n    info.Start = m_Start;\n    info.Count = m_Count;\n    info.BlockID = m_BlockID;\n    info.Selection = m_SelectionType;\n    info.MemoryStart = m_MemoryStart;\n    info.MemoryCount = m_MemoryCount;\n    info.StepsStart = stepsStart;\n    info.StepsCount = stepsCount;\n    info.Data = const_cast<T *>(data);\n    info.BufferP = info.Data;\n    info.Operations = m_Operations;\n    m_BlocksInfo.push_back(info);\n    return m_BlocksInfo.back();\n}\n\ntemplate <class T>\nvoid Variable<T>::SetData(const T *data) noexcept\n{\n    m_Data = const_cast<T *>(data);\n}\n\ntemplate <class T>\nT *Variable<T>::GetData() const noexcept\n{\n    return m_Data;\n}\n\ntemplate <class T>\nT Variable<T>::Min(const size_t step) const\n{\n    return MinMax(step).first;\n}\n\ntemplate <class T>\nT Variable<T>::Max(const size_t step) const\n{\n    return MinMax(step).second;\n}\n\n} \/\/ end namespace core\n} \/\/ end namespace adios2\n\n#endif \/* ADIOS2_CORE_VARIABLE_TCC_ *\/\n<commit_msg>core\/Variable: reorder Variable.tcc<commit_after>\/*\n * Distributed under the OSI-approved Apache License, Version 2.0.  See\n * accompanying file Copyright.txt for details.\n *\n * Variable.tcc : implement long template functions\n *\n *  Created on: Jan 31, 2019\n *      Author: William F Godoy\n *\/\n\n#ifndef ADIOS2_CORE_VARIABLE_TCC_\n#define ADIOS2_CORE_VARIABLE_TCC_\n\n#include \"Variable.h\"\n\n#include \"adios2\/core\/Engine.h\"\n#include \"adios2\/helper\/adiosFunctions.h\"\n\nnamespace adios2\n{\nnamespace core\n{\n\ntemplate <class T>\nVariable<T>::Variable(const std::string &name, const Dims &shape,\n                      const Dims &start, const Dims &count,\n                      const bool constantDims, const bool debugMode)\n: VariableBase(name, helper::GetType<T>(), sizeof(T), shape, start, count,\n               constantDims, debugMode)\n{\n    m_BlocksInfo.reserve(1);\n}\n\ntemplate <class T>\ntypename Variable<T>::Info &\nVariable<T>::SetBlockInfo(const T *data, const size_t stepsStart,\n                          const size_t stepsCount) noexcept\n{\n    Info info;\n    info.Shape = m_Shape;\n    info.Start = m_Start;\n    info.Count = m_Count;\n    info.BlockID = m_BlockID;\n    info.Selection = m_SelectionType;\n    info.MemoryStart = m_MemoryStart;\n    info.MemoryCount = m_MemoryCount;\n    info.StepsStart = stepsStart;\n    info.StepsCount = stepsCount;\n    info.Data = const_cast<T *>(data);\n    info.BufferP = info.Data;\n    info.Operations = m_Operations;\n    m_BlocksInfo.push_back(info);\n    return m_BlocksInfo.back();\n}\n\ntemplate <class T>\nvoid Variable<T>::SetData(const T *data) noexcept\n{\n    m_Data = const_cast<T *>(data);\n}\n\ntemplate <class T>\nT *Variable<T>::GetData() const noexcept\n{\n    return m_Data;\n}\n\ntemplate <class T>\nDims Variable<T>::Shape(const size_t step) const\n{\n    if (m_DebugMode)\n    {\n        if (!m_FirstStreamingStep && step != DefaultSizeT)\n        {\n            throw std::invalid_argument(\"ERROR: can't pass a step input in \"\n                                        \"streaming (BeginStep\/EndStep)\"\n                                        \"mode for variable \" +\n                                        m_Name +\n                                        \", in call to Variable<T>::Shape\\n\");\n        }\n    }\n\n    if (m_FirstStreamingStep && step == DefaultSizeT)\n    {\n        return m_Shape;\n    }\n\n    if (m_Engine != nullptr && m_ShapeID == ShapeID::GlobalArray)\n    {\n        const size_t stepInput =\n            !m_FirstStreamingStep ? m_Engine->CurrentStep() : step;\n\n        const std::vector<typename Variable<T>::Info> blocksInfo =\n            m_Engine->BlocksInfo<T>(*this, stepInput);\n\n        if (blocksInfo.size() == 0)\n        {\n            return Dims();\n        }\n\n        if (blocksInfo.front().Shape.size() == 1 &&\n            blocksInfo.front().Shape.front() == LocalValueDim)\n        {\n            return Dims{blocksInfo.size()};\n        }\n\n        return blocksInfo.front().Shape;\n    }\n    return m_Shape;\n}\n\ntemplate <class T>\nstd::pair<T, T> Variable<T>::MinMax(const size_t step) const\n{\n    if (m_DebugMode && !m_FirstStreamingStep && step != DefaultSizeT)\n    {\n        throw std::invalid_argument(\n            \"ERROR: can't pass a step input in streaming (BeginStep\/EndStep)\"\n            \"mode for variable \" +\n            m_Name + \", in call to Variable<T>:: Min Max or MinMax\\n\");\n    }\n\n    std::pair<T, T> minMax;\n    minMax.first = {};\n    minMax.second = {};\n\n    if (m_Engine != nullptr && !m_FirstStreamingStep)\n    {\n        const size_t stepInput =\n            (step == DefaultSizeT) ? m_Engine->CurrentStep() : step;\n\n        const std::vector<typename Variable<T>::Info> blocksInfo =\n            m_Engine->BlocksInfo<T>(*this, stepInput);\n\n        if (blocksInfo.size() == 0)\n        {\n            return minMax;\n        }\n\n        if (m_ShapeID == ShapeID::LocalArray)\n        {\n            if (m_DebugMode && m_BlockID >= blocksInfo.size())\n            {\n                throw std::invalid_argument(\n                    \"ERROR: BlockID \" + std::to_string(m_BlockID) +\n                    \" does not exist for LocalArray variable \" + m_Name +\n                    \", in call to MinMax, Min or Maxn\");\n            }\n            minMax.first = blocksInfo[m_BlockID].Min;\n            minMax.second = blocksInfo[m_BlockID].Max;\n            return minMax;\n        }\n\n        const bool isValue =\n            ((blocksInfo.front().Shape.size() == 1 &&\n              blocksInfo.front().Shape.front() == LocalValueDim) ||\n             m_ShapeID == ShapeID::GlobalValue)\n                ? true\n                : false;\n\n        minMax.first =\n            isValue ? blocksInfo.front().Value : blocksInfo.front().Min;\n        minMax.second =\n            isValue ? blocksInfo.front().Value : blocksInfo.front().Max;\n\n        for (const typename Variable<T>::Info &blockInfo : blocksInfo)\n        {\n            const T minValue = isValue ? blockInfo.Value : blockInfo.Min;\n\n            if (helper::LessThan<T>(minValue, minMax.first))\n            {\n                minMax.first = minValue;\n            }\n\n            const T maxValue = isValue ? blockInfo.Value : blockInfo.Max;\n\n            if (helper::GreaterThan<T>(maxValue, minMax.second))\n            {\n                minMax.second = maxValue;\n            }\n        }\n    }\n    else\n    {\n        minMax.first = m_Min;\n        minMax.second = m_Max;\n    }\n    return minMax;\n}\n\ntemplate <class T>\nT Variable<T>::Min(const size_t step) const\n{\n    return MinMax(step).first;\n}\n\ntemplate <class T>\nT Variable<T>::Max(const size_t step) const\n{\n    return MinMax(step).second;\n}\n\ntemplate <class T>\nstd::vector<std::vector<typename Variable<T>::Info>>\nVariable<T>::AllStepsBlocksInfo() const\n{\n    if (m_DebugMode && m_Engine == nullptr)\n    {\n        if (m_Engine == nullptr)\n        {\n            throw std::invalid_argument(\n                \"ERROR: from variable \" + m_Name +\n                \" function is only valid in read mode, in \"\n                \"call to Variable<T>::AllBlocksInfo\\n\");\n        }\n\n        if (!m_FirstStreamingStep)\n        {\n            throw std::invalid_argument(\"ERROR: from variable \" + m_Name +\n                                        \" function is not valid in \"\n                                        \"random-access read mode \"\n                                        \"(BeginStep\/EndStep), in \"\n                                        \"call to Variable<T>::AllBlocksInfo\\n\");\n        }\n    }\n\n    return m_Engine->AllRelativeStepsBlocksInfo(*this);\n}\n\n} \/\/ end namespace core\n} \/\/ end namespace adios2\n\n#endif \/* ADIOS2_CORE_VARIABLE_TCC_ *\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"stdafx.h\"\n\n#include <iostream>\n#include <string>\n#include <vector>\n\ntemplate < typename _inputIterator, typename _unaryFuntion >\nvoid each_tag( _inputIterator _from, _inputIterator _to, typename _inputIterator::value_type _delimiter, _unaryFuntion _function )\n{\n\tstd::basic_string<typename _inputIterator::value_type> tag;\n\t_inputIterator _cur = _from;\n\tfor ( ; _cur != _to; ++_cur )\n\t{\n\t\tif ( *_cur != _delimiter )\n\t\t{\n\t\t\ttag.push_back( *_cur );\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif ( tag.size() > 0 )\n\t\t\t{\n\t\t\t\t_function( tag );\n\t\t\t}\n\t\t\ttag.clear();\n\t\t}\n\t}\n}\n\nint main(int argc, char* argv[])\n{\n\tstd::string test( \" 498924782h7 nuncinsiunc 77826376276572  736736473467 \" );\n\tstd::wstring wtest( L\" 498924782h7 nuncinsiunc 77826376276572  736736473467 \" );\n\n\teach_tag( test.begin(), test.end(), ' ', []( std::string& tag )\n\t{\n\t\tstd::cout << tag << std::endl;\n\t});\n\n\teach_tag( wtest.begin(), wtest.end(), ' ', []( std::wstring& tag )\n\t{\n\t\tstd::wcout << tag << std::endl;\n\t} );\n\n\/\/ \tstd::vector<int> vtest{ 0, 2, 4, 3, 4, 5, 6, 7, 8, 9, 0, 4, 6, 33, 4, 5, 66, 7, 7, 8, 9, 2, 1, 1, 2, 2, 3, 4, 5, 79, 3, 3, 2, 7, 8, 9, 9 };\n\/\/ \teach_tag( vtest.begin(), vtest.end(), 9 , []( std::string& tag )\n\/\/ \t{\n\/\/ \t\tstd::cout << tag << std::endl;\n\/\/ \t} );\n\n\treturn 0;\n}\n\n<commit_msg>last tag added<commit_after>#include \"stdafx.h\"\n\n#include <iostream>\n#include <string>\n#include <vector>\n#include <iterator>\n\ntemplate < typename _inputIterator, typename _unaryFuntion >\nvoid each_tag( _inputIterator _from, _inputIterator _to, typename _inputIterator::value_type _delimiter, _unaryFuntion _function )\n{\n\tstd::basic_string<typename _inputIterator::value_type> tag;\n\tfor ( ; _from != _to; ++_from )\n\t{\n\t\tif ( *_from != _delimiter )\n\t\t{\n\t\t\ttag.push_back( *_from );\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif ( tag.size() > 0 )\n\t\t\t{\n\t\t\t\t_function( tag );\n\t\t\t}\n\t\t\ttag.clear();\n\t\t}\n\t}\n\tif ( tag.size() > 0 )\n\t{\n\t\t_function( tag );\n\t}\n}\n\ntemplate < typename _inputIterator, typename _outputIterator, typename _delimiterType, typename _valueType >\nvoid each_tag_push( _inputIterator _from, _inputIterator _to, _delimiterType _delimiter, _outputIterator _output )\n{\n\/\/\tstd::static_assert( std::is_same( typename _inputIterator::value_type, _delimiterType ));\n\t_inputIterator _cur = _from;\n\tfor ( ; _from != _to; ++_from )\n\t{\n\t\tif ( *_from == _delimiter )\n\t\t{\n\t\t\tif ( _cur != _from )\n\t\t\t{\n\t\t\t\t_output = _valueType( _cur, _from );\n\t\t\t\t_cur = _from;\n\t\t\t}\n\t\t}\n\t}\n\tif ( _cur != _from )\n\t{\n\t\t_output = _valueType( _cur, _from );\n\t\t_cur = _from;\n\t}\n}\n\nint main(int argc, char* argv[])\n{\n\tstd::string test( \" 498924782h7 nuncinsiunc 77826376276572  736736473467 sdfsdfw344224 d\" );\n\tstd::wstring wtest( L\" 498924782h7 nuncinsiunc 77826376276572  736736473467 fefsdf22234 \" );\n\n\tstd::cout << \"char:\" << std::endl;\n\teach_tag( test.begin(), test.end(), ' ', []( std::string& tag )\n\t{\n\t\tstd::cout << tag << std::endl;\n\t});\n\n\tstd::cout << std::endl << \"wchar:\" << std::endl;\n\teach_tag( wtest.begin(), wtest.end(), L' ', []( std::wstring& tag )\n\t{\n\t\tstd::wcout << tag << std::endl;\n\t} );\n\n\t\/*\n\tstd::vector< std::string > slices;\n\tstd::back_insert_iterator<std::vector< std::string >>  output( slices );\n\teach_tag_push( test.begin(), test.end(), ' ', output );\n\t*\/\n\n\treturn 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2015 ScyllaDB\n *\/\n\n\/*\n * This file is part of Scylla.\n *\n * Scylla is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * Scylla is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with Scylla.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#pragma once\n\n#include \"sstables\/shared_sstable.hh\"\n\nclass column_family;\nclass schema;\nusing schema_ptr = lw_shared_ptr<const schema>;\n\nnamespace sstables {\n\nenum class compaction_strategy_type {\n    null,\n    major,\n    size_tiered,\n    leveled,\n    date_tiered,\n    time_window,\n};\n\nclass compaction_strategy_impl;\nclass sstable;\nclass sstable_set;\nstruct compaction_descriptor;\nstruct resharding_descriptor;\n\nclass compaction_strategy {\n    ::shared_ptr<compaction_strategy_impl> _compaction_strategy_impl;\npublic:\n    compaction_strategy(::shared_ptr<compaction_strategy_impl> impl);\n\n    compaction_strategy();\n    ~compaction_strategy();\n    compaction_strategy(const compaction_strategy&);\n    compaction_strategy(compaction_strategy&&);\n    compaction_strategy& operator=(compaction_strategy&&);\n\n    \/\/ Return a list of sstables to be compacted after applying the strategy.\n    compaction_descriptor get_sstables_for_compaction(column_family& cfs, std::vector<shared_sstable> candidates);\n\n    std::vector<resharding_descriptor> get_resharding_jobs(column_family& cf, std::vector<shared_sstable> candidates);\n\n    \/\/ Some strategies may look at the compacted and resulting sstables to\n    \/\/ get some useful information for subsequent compactions.\n    void notify_completion(const std::vector<shared_sstable>& removed, const std::vector<shared_sstable>& added);\n\n    \/\/ Return if parallel compaction is allowed by strategy.\n    bool parallel_compaction() const;\n\n    \/\/ Return if optimization to rule out sstables based on clustering key filter should be applied.\n    bool use_clustering_key_filter() const;\n\n    \/\/ An estimation of number of compaction for strategy to be satisfied.\n    int64_t estimated_pending_compactions(column_family& cf) const;\n\n    static sstring name(compaction_strategy_type type) {\n        switch (type) {\n        case compaction_strategy_type::null:\n            return \"NullCompactionStrategy\";\n        case compaction_strategy_type::major:\n            return \"MajorCompactionStrategy\";\n        case compaction_strategy_type::size_tiered:\n            return \"SizeTieredCompactionStrategy\";\n        case compaction_strategy_type::leveled:\n            return \"LeveledCompactionStrategy\";\n        case compaction_strategy_type::date_tiered:\n            return \"DateTieredCompactionStrategy\";\n        case compaction_strategy_type::time_window:\n            return \"TimeWindowCompactionStrategy\";\n        default:\n            throw std::runtime_error(\"Invalid Compaction Strategy\");\n        }\n    }\n\n    static compaction_strategy_type type(const sstring& name) {\n        auto pos = name.find(\"org.apache.cassandra.db.compaction.\");\n        sstring short_name = (pos == sstring::npos) ? name : name.substr(pos + 35);\n        if (short_name == \"NullCompactionStrategy\") {\n            return compaction_strategy_type::null;\n        } else if (short_name == \"MajorCompactionStrategy\") {\n            return compaction_strategy_type::major;\n        } else if (short_name == \"SizeTieredCompactionStrategy\") {\n            return compaction_strategy_type::size_tiered;\n        } else if (short_name == \"LeveledCompactionStrategy\") {\n            return compaction_strategy_type::leveled;\n        } else if (short_name == \"DateTieredCompactionStrategy\") {\n            return compaction_strategy_type::date_tiered;\n        } else if (short_name == \"TimeWindowCompactionStrategy\") {\n            return compaction_strategy_type::time_window;\n        } else {\n            throw exceptions::configuration_exception(sprint(\"Unable to find compaction strategy class '%s'\", name));\n        }\n    }\n\n    compaction_strategy_type type() const;\n\n    sstring name() const {\n        return name(type());\n    }\n\n    sstable_set make_sstable_set(schema_ptr schema) const;\n};\n\n\/\/ Creates a compaction_strategy object from one of the strategies available.\ncompaction_strategy make_compaction_strategy(compaction_strategy_type strategy, const std::map<sstring, sstring>& options);\n\n}\n<commit_msg>compaction_strategy: add missing header<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 \"sstables\/shared_sstable.hh\"\n#include \"exceptions\/exceptions.hh\"\n\nclass column_family;\nclass schema;\nusing schema_ptr = lw_shared_ptr<const schema>;\n\nnamespace sstables {\n\nenum class compaction_strategy_type {\n    null,\n    major,\n    size_tiered,\n    leveled,\n    date_tiered,\n    time_window,\n};\n\nclass compaction_strategy_impl;\nclass sstable;\nclass sstable_set;\nstruct compaction_descriptor;\nstruct resharding_descriptor;\n\nclass compaction_strategy {\n    ::shared_ptr<compaction_strategy_impl> _compaction_strategy_impl;\npublic:\n    compaction_strategy(::shared_ptr<compaction_strategy_impl> impl);\n\n    compaction_strategy();\n    ~compaction_strategy();\n    compaction_strategy(const compaction_strategy&);\n    compaction_strategy(compaction_strategy&&);\n    compaction_strategy& operator=(compaction_strategy&&);\n\n    \/\/ Return a list of sstables to be compacted after applying the strategy.\n    compaction_descriptor get_sstables_for_compaction(column_family& cfs, std::vector<shared_sstable> candidates);\n\n    std::vector<resharding_descriptor> get_resharding_jobs(column_family& cf, std::vector<shared_sstable> candidates);\n\n    \/\/ Some strategies may look at the compacted and resulting sstables to\n    \/\/ get some useful information for subsequent compactions.\n    void notify_completion(const std::vector<shared_sstable>& removed, const std::vector<shared_sstable>& added);\n\n    \/\/ Return if parallel compaction is allowed by strategy.\n    bool parallel_compaction() const;\n\n    \/\/ Return if optimization to rule out sstables based on clustering key filter should be applied.\n    bool use_clustering_key_filter() const;\n\n    \/\/ An estimation of number of compaction for strategy to be satisfied.\n    int64_t estimated_pending_compactions(column_family& cf) const;\n\n    static sstring name(compaction_strategy_type type) {\n        switch (type) {\n        case compaction_strategy_type::null:\n            return \"NullCompactionStrategy\";\n        case compaction_strategy_type::major:\n            return \"MajorCompactionStrategy\";\n        case compaction_strategy_type::size_tiered:\n            return \"SizeTieredCompactionStrategy\";\n        case compaction_strategy_type::leveled:\n            return \"LeveledCompactionStrategy\";\n        case compaction_strategy_type::date_tiered:\n            return \"DateTieredCompactionStrategy\";\n        case compaction_strategy_type::time_window:\n            return \"TimeWindowCompactionStrategy\";\n        default:\n            throw std::runtime_error(\"Invalid Compaction Strategy\");\n        }\n    }\n\n    static compaction_strategy_type type(const sstring& name) {\n        auto pos = name.find(\"org.apache.cassandra.db.compaction.\");\n        sstring short_name = (pos == sstring::npos) ? name : name.substr(pos + 35);\n        if (short_name == \"NullCompactionStrategy\") {\n            return compaction_strategy_type::null;\n        } else if (short_name == \"MajorCompactionStrategy\") {\n            return compaction_strategy_type::major;\n        } else if (short_name == \"SizeTieredCompactionStrategy\") {\n            return compaction_strategy_type::size_tiered;\n        } else if (short_name == \"LeveledCompactionStrategy\") {\n            return compaction_strategy_type::leveled;\n        } else if (short_name == \"DateTieredCompactionStrategy\") {\n            return compaction_strategy_type::date_tiered;\n        } else if (short_name == \"TimeWindowCompactionStrategy\") {\n            return compaction_strategy_type::time_window;\n        } else {\n            throw exceptions::configuration_exception(sprint(\"Unable to find compaction strategy class '%s'\", name));\n        }\n    }\n\n    compaction_strategy_type type() const;\n\n    sstring name() const {\n        return name(type());\n    }\n\n    sstable_set make_sstable_set(schema_ptr schema) const;\n};\n\n\/\/ Creates a compaction_strategy object from one of the strategies available.\ncompaction_strategy make_compaction_strategy(compaction_strategy_type strategy, const std::map<sstring, sstring>& options);\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ --------------------------------------------------------------------------\n#include <string>\n#include <getopt.h>\n#include \"Debug.h\"\n#include \"MBSlave.h\"\n#include \"ComPort485F.h\"\n\/\/ --------------------------------------------------------------------------\nusing namespace UniSetTypes;\nusing namespace std;\n\/\/ --------------------------------------------------------------------------\nstatic struct option longopts[] = {\n\t{ \"help\", no_argument, 0, 'h' },\n\t{ \"device\", required_argument, 0, 'd' },\n\t{ \"verbose\", no_argument, 0, 'v' },\n\t{ \"myaddr\", required_argument, 0, 'a' },\n\t{ \"speed\", required_argument, 0, 's' },\n\t{ \"f485\", no_argument, 0, 'g' },\n\t{ NULL, 0, 0, 0 }\n};\n\/\/ --------------------------------------------------------------------------\nstatic void print_help()\n{\n\tprintf(\"-h|--help \t\t     - this message\\n\");\n\tprintf(\"[-t|--timeout] msec  - Timeout. Default: 2000.\\n\");\n\tprintf(\"[-v|--verbose]       - Print all messages to stdout\\n\");\n\tprintf(\"[-d|--device] dev    - use device dev. Default: \/dev\/ttyS0\\n\");\n\tprintf(\"[-a|--myaddr] addr   - Modbus address for master. Default: 0x01.\\n\");\n\tprintf(\"[-s|--speed] speed   - 9600,14400,19200,38400,57600,115200. Default: 38400.\\n\");\n\tprintf(\"[-v|--verbose]       - Print all messages to stdout\\n\");\n\tprintf(\"[-g|--f485]          - Use 485 Fastwel\\n\");\n}\n\/\/ --------------------------------------------------------------------------\nint main( int argc, char **argv )\n{   \n\tint optindex = 0;\n\tint opt = 0;\n\tint verb = 0;\n\tint f485 = 0;\n\tstring dev(\"\/dev\/ttyS0\");\n\tstring speed(\"38400\");\n\tModbusRTU::ModbusAddr myaddr = 0x01;\n\tint tout = 2000;\n\tDebugStream dlog;\n\n\n\ttry\n\t{\n\t\twhile( (opt = getopt_long(argc, argv, \"hva:d:s:c:\",longopts,&optindex)) != -1 ) \n\t\t{\n\t\t\tswitch (opt) \n\t\t\t{\n\t\t\t\tcase 'h':\n\t\t\t\t\tprint_help();\t\n\t\t\t\treturn 0;\n\n\t\t\t\tcase 'd':\t\n\t\t\t\t\tdev = string(optarg);\n\t\t\t\tbreak;\n\n\t\t\t\tcase 's':\t\n\t\t\t\t\tspeed = string(optarg);\n\t\t\t\tbreak;\n\n\t\t\t\tcase 't':\t\n\t\t\t\t\ttout = uni_atoi(optarg);\n\t\t\t\tbreak;\n\n\t\t\t\tcase 'a':\t\n\t\t\t\t\tmyaddr = ModbusRTU::str2mbAddr(optarg);\n\t\t\t\tbreak;\n\n\t\t\t\tcase 'v':\t\n\t\t\t\t\tverb = 1;\n\t\t\t\tbreak;\n\n\t\t\t\tcase 'g':\t\n\t\t\t\t\tf485 = 1;\n\t\t\t\tbreak;\n\n\t\t\t\tcase '?':\n\t\t\t\tdefault:\n\t\t\t\t\tprintf(\"? argumnet\\n\");\n\t\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\n\t\tif( verb )\n\t\t{\n\t\t\tcout << \"(init): dev=\" << dev << \" speed=\" << speed\n\t\t\t\t\t<< \" myaddr=\" << ModbusRTU::addr2str(myaddr)\n\t\t\t\t\t<< \" timeout=\" << tout << \" msec \"\n\t\t\t\t\t<< endl;\t\t\t\t\t\n\t\n\t\t\tdlog.addLevel( Debug::type(Debug::CRIT | Debug::WARN | Debug::INFO) );\n\t\t}\t\t\n\t\t\n\t\tif( f485 )\n\t\t{\n\t\t\tComPort485F* cp;\n\t\t\tif( dev == \"\/dev\/ttyS2\" )\n\t\t\t\tcp = new ComPort485F(dev,5);\n\t\t\telse if( dev == \"\/dev\/ttyS3\" )\n\t\t\t\tcp = new ComPort485F(dev,6);\n\t\t\telse\n\t\t\t{\n\t\t\t\tcerr << \"dev must be \/dev\/ttyS2 or \/dev\/tytS3\" << endl;\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\n\t\t\tMBSlave mbs(cp,myaddr,speed);\n\t\t\tmbs.setLog(dlog);\n\t\t\tmbs.setVerbose(verb);\n\t\t\tmbs.execute();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tMBSlave mbs(myaddr,dev,speed);\n\t\t\tmbs.setLog(dlog);\n\t\t\tmbs.setVerbose(verb);\n\t\t\tmbs.execute();\n\t\t}\n\t}\n\tcatch( ModbusRTU::mbException& ex )\n\t{\n\t\tcerr << \"(mbtester): \" << ex << endl;\n\t}\n\tcatch(SystemError& err)\n\t{\n\t\tcerr << \"(mbslave): \" << err << endl;\n\t}\n\tcatch(Exception& ex)\n\t{\n\t\tcerr << \"(mbslave): \" << ex << endl;\n\t}\n\tcatch(...)\n\t{\n\t\tcerr << \"(mbslave): catch(...)\" << endl;\n\t}\n\n\treturn 0;\n}\n\/\/ --------------------------------------------------------------------------\n<commit_msg>(modbus): исправил ошибку в help (eterbug #9290)<commit_after>\/\/ --------------------------------------------------------------------------\n#include <string>\n#include <getopt.h>\n#include \"Debug.h\"\n#include \"MBSlave.h\"\n#include \"ComPort485F.h\"\n\/\/ --------------------------------------------------------------------------\nusing namespace UniSetTypes;\nusing namespace std;\n\/\/ --------------------------------------------------------------------------\nstatic struct option longopts[] = {\n\t{ \"help\", no_argument, 0, 'h' },\n\t{ \"device\", required_argument, 0, 'd' },\n\t{ \"verbose\", no_argument, 0, 'v' },\n\t{ \"myaddr\", required_argument, 0, 'a' },\n\t{ \"speed\", required_argument, 0, 's' },\n\t{ \"f485\", no_argument, 0, 'g' },\n\t{ NULL, 0, 0, 0 }\n};\n\/\/ --------------------------------------------------------------------------\nstatic void print_help()\n{\n\tprintf(\"-h|--help \t\t     - this message\\n\");\n\tprintf(\"[-t|--timeout] msec  - Timeout. Default: 2000.\\n\");\n\tprintf(\"[-v|--verbose]       - Print all messages to stdout\\n\");\n\tprintf(\"[-d|--device] dev    - use device dev. Default: \/dev\/ttyS0\\n\");\n\tprintf(\"[-a|--myaddr] addr   - Modbus address for this slave. Default: 0x01.\\n\");\n\tprintf(\"[-s|--speed] speed   - 9600,14400,19200,38400,57600,115200. Default: 38400.\\n\");\n\tprintf(\"[-v|--verbose]       - Print all messages to stdout\\n\");\n\tprintf(\"[-g|--f485]          - Use 485 Fastwel\\n\");\n}\n\/\/ --------------------------------------------------------------------------\nint main( int argc, char **argv )\n{   \n\tint optindex = 0;\n\tint opt = 0;\n\tint verb = 0;\n\tint f485 = 0;\n\tstring dev(\"\/dev\/ttyS0\");\n\tstring speed(\"38400\");\n\tModbusRTU::ModbusAddr myaddr = 0x01;\n\tint tout = 2000;\n\tDebugStream dlog;\n\n\n\ttry\n\t{\n\t\twhile( (opt = getopt_long(argc, argv, \"hva:d:s:c:\",longopts,&optindex)) != -1 ) \n\t\t{\n\t\t\tswitch (opt) \n\t\t\t{\n\t\t\t\tcase 'h':\n\t\t\t\t\tprint_help();\t\n\t\t\t\treturn 0;\n\n\t\t\t\tcase 'd':\t\n\t\t\t\t\tdev = string(optarg);\n\t\t\t\tbreak;\n\n\t\t\t\tcase 's':\t\n\t\t\t\t\tspeed = string(optarg);\n\t\t\t\tbreak;\n\n\t\t\t\tcase 't':\t\n\t\t\t\t\ttout = uni_atoi(optarg);\n\t\t\t\tbreak;\n\n\t\t\t\tcase 'a':\t\n\t\t\t\t\tmyaddr = ModbusRTU::str2mbAddr(optarg);\n\t\t\t\tbreak;\n\n\t\t\t\tcase 'v':\t\n\t\t\t\t\tverb = 1;\n\t\t\t\tbreak;\n\n\t\t\t\tcase 'g':\t\n\t\t\t\t\tf485 = 1;\n\t\t\t\tbreak;\n\n\t\t\t\tcase '?':\n\t\t\t\tdefault:\n\t\t\t\t\tprintf(\"? argumnet\\n\");\n\t\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\n\t\tif( verb )\n\t\t{\n\t\t\tcout << \"(init): dev=\" << dev << \" speed=\" << speed\n\t\t\t\t\t<< \" myaddr=\" << ModbusRTU::addr2str(myaddr)\n\t\t\t\t\t<< \" timeout=\" << tout << \" msec \"\n\t\t\t\t\t<< endl;\t\t\t\t\t\n\t\n\t\t\tdlog.addLevel( Debug::type(Debug::CRIT | Debug::WARN | Debug::INFO) );\n\t\t}\t\t\n\t\t\n\t\tif( f485 )\n\t\t{\n\t\t\tComPort485F* cp;\n\t\t\tif( dev == \"\/dev\/ttyS2\" )\n\t\t\t\tcp = new ComPort485F(dev,5);\n\t\t\telse if( dev == \"\/dev\/ttyS3\" )\n\t\t\t\tcp = new ComPort485F(dev,6);\n\t\t\telse\n\t\t\t{\n\t\t\t\tcerr << \"dev must be \/dev\/ttyS2 or \/dev\/tytS3\" << endl;\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\n\t\t\tMBSlave mbs(cp,myaddr,speed);\n\t\t\tmbs.setLog(dlog);\n\t\t\tmbs.setVerbose(verb);\n\t\t\tmbs.execute();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tMBSlave mbs(myaddr,dev,speed);\n\t\t\tmbs.setLog(dlog);\n\t\t\tmbs.setVerbose(verb);\n\t\t\tmbs.execute();\n\t\t}\n\t}\n\tcatch( ModbusRTU::mbException& ex )\n\t{\n\t\tcerr << \"(mbtester): \" << ex << endl;\n\t}\n\tcatch(SystemError& err)\n\t{\n\t\tcerr << \"(mbslave): \" << err << endl;\n\t}\n\tcatch(Exception& ex)\n\t{\n\t\tcerr << \"(mbslave): \" << ex << endl;\n\t}\n\tcatch(...)\n\t{\n\t\tcerr << \"(mbslave): catch(...)\" << endl;\n\t}\n\n\treturn 0;\n}\n\/\/ --------------------------------------------------------------------------\n<|endoftext|>"}
{"text":"<commit_before>#include \"bookmark.h\"\n\n\/**\n * @brief Bookmark::Bookmark\n * @param frame_nbr Frame number associated with the bookmark.\n * @param frame Frame associated with the bookmark.\n * @param dir_path Path to the directory to store image in.\n * @param text Text description of the bookmark.\n *\/\nBookmark::Bookmark(int frame_nbr, QImage frame, QString dir_path, QString text) {\n    this->frame_number = frame_nbr;\n    this->frame = frame;\n    this->dir_path = dir_path;\n    this->description = text;\n\n    \/\/ There's no file path yet, since the frame has not been exported\n    this->file_path = QString();\n}\n\n\/**\n * @brief Bookmark::Bookmark\n * Null initializing constructor.\n *\/\nBookmark::Bookmark() {\n    frame_number = 0;\n    frame = QImage();\n    dir_path = QString();\n    file_path = QString();\n    description = QString();\n}\n\n\/**\n * @brief Bookmark::get_frame_number\n * @return Returns the frame number that the bookmark points to.\n *\/\nint Bookmark::get_frame_number() {\n    return frame_number;\n}\n\n\/**\n * @brief Bookmark::get_frame\n * @return Returns the frame of the bookmark.\n *\/\nQImage Bookmark::get_frame() {\n    return frame;\n}\n\n\/**\n * @brief Bookmark::get_description\n * @return Returns the description associated with the bookmark.\n *\/\nQString Bookmark::get_description() {\n    return description;\n}\n\n\/**\n * @brief Bookmark::read\n * @param json\n * Reads a bookmark from a Json object.\n *\/\nvoid Bookmark::read(const QJsonObject& json){\n    this->frame_number = json[\"frame\"].toInt();\n    this->dir_path = json[\"dir\"].toString();\n    this->file_path = json[\"path\"].toString();\n    this->description = json[\"note\"].toString();\n    frame.load(file_path);\n}\n\n\/**\n * @brief Bookmark::write\n * @param json\n * Writes a bookmark to a Json object, and exports the frame.\n *\/\nvoid Bookmark::write(QJsonObject& json){\n    \/\/ Exports the frame and updates file_path.\n    export_frame();\n\n    json[\"frame\"] = this->frame_number;\n    json[\"dir\"] = this->dir_path;\n    json[\"path\"] = this->file_path;\n    json[\"note\"] = this->description;\n}\n\n\/**\n * @brief Bookmark::export_frame\n * Export the frame of the bookmark to a tiff-file in the project folder.\n *\/\nvoid Bookmark::export_frame() {\n    \/\/ Update file path in case there's already a file with this file name\n    create_file_path();\n    QImageWriter writer(file_path, \"tiff\");\n    writer.write(frame);\n}\n\n\/**\n * @brief Bookmark::create_file_path\n * Creates and updates the file path to export the bookmark frame to.\n *\/\nvoid Bookmark::create_file_path() {\n\n    \/\/ Append FRAMENR.tiff to the directory path\n    QString path = QString(dir_path);\n    path.append(\"\/\");\n    path.append(QString::number(frame_number));\n    path.append(\".tiff\");\n\n    int counter = 1;\n    while (QFile::exists(path)) {\n        \/\/ If file exists, try FRAMENR(X).tiff\n        path = QString(dir_path);\n        path.append(\"\/\");\n        path.append(QString::number(frame_number));\n        path.append(\"(\");\n        path.append(QString::number(counter));\n        path.append(\").tiff\");\n        counter++;\n    }\n\n    \/\/ Update file path variable\n    file_path = path;\n}\n\n\/**\n * @brief Bookmark::remove_exported_image\n * Removes the exported image, if tthere is one.\n *\/\nvoid Bookmark::remove_exported_image() {\n    \/\/ If the file path is empty, then the frame has not been exported so there's nothing to remove.\n    if (!file_path.isEmpty()) {\n        QFile file(file_path);\n        file.remove();\n    }\n}\n<commit_msg>Edited comment.<commit_after>#include \"bookmark.h\"\n\n\/**\n * @brief Bookmark::Bookmark\n * @param frame_nbr Frame number associated with the bookmark.\n * @param frame Frame associated with the bookmark.\n * @param dir_path Path to the directory to store image in.\n * @param text Text description of the bookmark.\n *\/\nBookmark::Bookmark(int frame_nbr, QImage frame, QString dir_path, QString text) {\n    this->frame_number = frame_nbr;\n    this->frame = frame;\n    this->dir_path = dir_path;\n    this->description = text;\n\n    \/\/ There's no file path yet, since the frame has not been exported\n    this->file_path = QString();\n}\n\n\/**\n * @brief Bookmark::Bookmark\n * Null initializing constructor.\n *\/\nBookmark::Bookmark() {\n    frame_number = 0;\n    frame = QImage();\n    dir_path = QString();\n    file_path = QString();\n    description = QString();\n}\n\n\/**\n * @brief Bookmark::get_frame_number\n * @return Returns the frame number that the bookmark points to.\n *\/\nint Bookmark::get_frame_number() {\n    return frame_number;\n}\n\n\/**\n * @brief Bookmark::get_frame\n * @return Returns the frame of the bookmark.\n *\/\nQImage Bookmark::get_frame() {\n    return frame;\n}\n\n\/**\n * @brief Bookmark::get_description\n * @return Returns the description associated with the bookmark.\n *\/\nQString Bookmark::get_description() {\n    return description;\n}\n\n\/**\n * @brief Bookmark::read\n * @param json\n * Reads a bookmark from a Json object.\n *\/\nvoid Bookmark::read(const QJsonObject& json){\n    this->frame_number = json[\"frame\"].toInt();\n    this->dir_path = json[\"dir\"].toString();\n    this->file_path = json[\"path\"].toString();\n    this->description = json[\"note\"].toString();\n    frame.load(file_path);\n}\n\n\/**\n * @brief Bookmark::write\n * @param json\n * Writes a bookmark to a Json object, and exports the frame.\n *\/\nvoid Bookmark::write(QJsonObject& json){\n    \/\/ Exports the frame and updates file_path.\n    export_frame();\n\n    json[\"frame\"] = this->frame_number;\n    json[\"dir\"] = this->dir_path;\n    json[\"path\"] = this->file_path;\n    json[\"note\"] = this->description;\n}\n\n\/**\n * @brief Bookmark::export_frame\n * Export the frame of the bookmark to a tiff-file in the project folder.\n *\/\nvoid Bookmark::export_frame() {\n    \/\/ Update file path in case there's already a file with this file name\n    create_file_path();\n    QImageWriter writer(file_path, \"tiff\");\n    writer.write(frame);\n}\n\n\/**\n * @brief Bookmark::create_file_path\n * Creates and updates the file path to export the bookmark frame to.\n *\/\nvoid Bookmark::create_file_path() {\n\n    \/\/ Append FRAMENR.tiff to the directory path\n    QString path = QString(dir_path);\n    path.append(\"\/\");\n    path.append(QString::number(frame_number));\n    path.append(\".tiff\");\n\n    int counter = 1;\n    while (QFile::exists(path)) {\n        \/\/ If file exists, try FRAMENR(X).tiff\n        path = QString(dir_path);\n        path.append(\"\/\");\n        path.append(QString::number(frame_number));\n        path.append(\"(\");\n        path.append(QString::number(counter));\n        path.append(\").tiff\");\n        counter++;\n    }\n\n    \/\/ Update file path variable\n    file_path = path;\n}\n\n\/**\n * @brief Bookmark::remove_exported_image\n * Removes the exported image, if there is one.\n *\/\nvoid Bookmark::remove_exported_image() {\n    \/\/ If the file path is empty, then the frame has not been exported so there's nothing to remove.\n    if (!file_path.isEmpty()) {\n        QFile file(file_path);\n        file.remove();\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *   CrissCross\n *   A multi-purpose cross-platform library.\n *\n *   A product of Uplink Laboratories.\n *\n *   (c) 2006-2008 Steven Noonan.\n *   Licensed under the New BSD License.\n *\n *\/\n\n#ifndef __included_cc_hashtable_h\n#  error \"This file shouldn't be compiled directly.\"\n#endif\n\n#include <crisscross\/stopwatch.h>\n\n#define HASH_TABLE_FILL_THRESHHOLD 50.0\n#define HASH_TABLE_SIZE_MAGNITUDE 2\n\nnamespace CrissCross\n{\n    namespace Data\n    {\n        template <class T>\n        HashTable<T>::HashTable ( size_t _initialSize )\n        {\n            if ( _initialSize < 500 ) _initialSize = 500;\n\n            m_size = _initialSize;\n            m_used = 0;\n            m_array = new T[_initialSize];\n            m_keys = new char*[_initialSize];\n            memset ( m_array, 0, sizeof ( T ) * _initialSize );\n            memset ( m_keys, 0, sizeof ( char * ) * _initialSize );\n            m_insertions = m_collisions = m_searches = m_hits = 0;\n        }\n\n        template <class T>\n        HashTable<T>::~HashTable ()\n        {\n            delete [] m_array;\n            m_array = NULL;\n            for ( size_t i = 0; i < m_size; i++ )\n            {\n                delete [] m_keys[i];\n                m_keys[i] = NULL;\n            }\n            delete [] m_keys;\n            m_keys = NULL;\n            m_size = 0;\n        }\n\n        template <class T>\n        size_t HashTable<T>::hash ( const char * const &_key, size_t _length ) const\n        {\n            CoreAssert ( _key );\n            size_t hash = 0;\n            size_t i;\n            for (i = 0; i < _length; i++){\n                hash += _key[i];\n                hash += ( hash << 10 );\n                hash ^= ( hash >> 6 );\n            }\n            hash += ( hash << 3 );\n            hash ^= ( hash >> 11 );\n            hash += ( hash << 15 );\n            return hash;\n        }\n\n        template <class T>\n        void HashTable<T>::grow ()\n        {\n            size_t oldSize = m_size;\n            m_size *= HASH_TABLE_SIZE_MAGNITUDE;\n            m_used = 0;\n\n            T *oldArray = m_array;\n            m_array = new T[m_size ];\n            memset ( m_array, 0, sizeof ( T ) * m_size );\n\n            char **oldKeys = m_keys;\n            m_keys = new char *[m_size];\n            memset ( m_keys, 0, sizeof ( char * ) * m_size );\n\n            for ( size_t i = 0; i < oldSize; i++ )\n            {\n                if ( oldKeys[i] )\n                {\n                    insert ( oldKeys[i], oldArray[i] );\n                    delete [] oldKeys[i];\n                }\n            }\n\n            delete [] oldArray;\n            delete [] oldKeys;\n\n        }\n\n        template <class T>\n        size_t HashTable<T>::findIndex ( const char * const &_key ) const\n        {\n            size_t khash = hash ( _key, strlen ( _key ) );\n            size_t pos = khash % m_size;\n\n            m_searches++;\n\n            if ( !m_keys[pos] || strcmp ( m_keys[pos], _key ) != 0 )\n            {\n                \/\/ Hmm. The data isn't at the location it should be.\n                size_t collisionNum = 0, attempts = 0;\n                while ( m_keys[pos] && strcmp ( m_keys[pos], _key ) != 0 )\n                {\n                    pos += 2 * ++collisionNum - 1;\n                    if ( pos >= m_size )\n                        pos %= m_size;\n\n                    attempts++;\n                    if ( attempts > 128 )\n                        return 0; \/\/ Kills us if something's seriously wrong\n                }\n\t\t\t\tif ( !m_keys[pos] )\n\t\t\t\t\treturn 0;\n                m_hits++;\n\n                CoreAssert ( pos < m_size );\n                CoreAssert ( m_keys[pos] != NULL );\n            }\n            else\n            {\n                m_hits++;\n            }\n\n            return pos;\n        }\n\n        template <class T>\n        T const &HashTable<T>::find ( const char * const &_key ) const\n        {\n            static T null (0);\n            size_t index = findIndex ( _key );\n            if ( m_keys[index] && strcmp ( m_keys[index], _key ) == 0 )\n                return m_array[index];\n            else\n                return null;\n        }\n\n        template <class T>\n        bool HashTable<T>::find ( const char * const &_key, T &_data ) const\n        {\n            size_t index = findIndex ( _key );\n            if ( m_keys[index] && strcmp ( m_keys[index], _key ) == 0 )\n            {\n                _data = m_array[index];\n                return true;\n            }\n\n            return false;\n        }\n\n        template <class T>\n        void HashTable<T>::print_statistics () const\n        {\n            double hitPercentage = ((double)m_hits \/ (double)m_searches ) * 100.0,\n                   collisionPercentage = ((double)m_collisions \/ (double)m_insertions ) * 100.0,\n                   usagePercentage = ((double)m_used \/ (double)m_size ) * 100.0;\n            if ( m_searches == 0 ) hitPercentage = 0.0;\n\n            if ( m_insertions == 0 ) collisionPercentage = 0.0;\n\n            printf ( \"\\n\" );\n            printf ( \"HASH TABLE STATISTICS:\\n\\n\" );\n            printf ( \"SIZE: %lu (%luKB)\\n\", m_size, (( m_size * sizeof( T )) + ( m_size * sizeof( char* ))) \/ 1024 );\n            printf ( \"USED: %lu (%0.2lf%%)\\n\", m_used, usagePercentage );\n            printf ( \"SEARCH STATISTICS:\\n\" );\n            printf ( \"\\tSEARCHES: %lu\\n\", m_searches );\n            printf ( \"\\tHITS: %lu (%0.2lf%%)\\n\", m_hits, hitPercentage );\n            printf ( \"INSERTION STATISTICS:\\n\" );\n            printf ( \"\\tINSERTIONS: %lu\\n\", m_insertions );\n            printf ( \"\\tCOLLISIONS: %lu (%0.2lf%%)\\n\", m_collisions, collisionPercentage );\n            double q1 = hitPercentage,\n                   q2 = ( 100.0 - collisionPercentage ),\n                   q3 = ( usagePercentage * ( 100.0 \/ HASH_TABLE_FILL_THRESHHOLD ) );\n            printf ( \"*** OVERALL QUALITY ESTIMATION : %0.2lf%% ( (%0.2lf%% + %0.2lf%% + %0.2lf%%) \/ 3.0 ) ***\\n\",\n                     ( q1 + q2 + q3 ) \/ 3.0, q1, q2, q3 );\n            printf ( \"\\n\" );\n\n            m_hits = m_searches = m_collisions = m_insertions = 0;\n        }\n\n        template <class T>\n        bool HashTable<T>::erase ( const char * const &_key )\n        {\n            size_t index = findIndex ( _key );\n            if ( m_keys[index] && strcmp ( m_keys[index], _key ) == 0 )\n            {\n                delete [] m_keys[index];\n                m_keys[index] = NULL;\n                m_used--;\n                return true;\n            }\n\n            return false;\n        }\n\n        template <class T>\n        size_t HashTable<T>::mem_usage () const\n        {\n            size_t ret = sizeof ( *this );\n            ret += m_size * sizeof ( T );\n            ret += m_size * sizeof ( char * );\n            return ret;\n        }\n\n        template <class T>\n        bool HashTable<T>::insert ( const char * const &_key, T const &_data )\n        {\n\n            if ( ( ( (double)m_used \/ (double)m_size ) * 100 ) > HASH_TABLE_FILL_THRESHHOLD )\n            {\n                \/\/ We need to grow and rebuild the table... We're too full.\n                grow ();\n            }\n\n            size_t khash = hash ( _key, strlen ( _key ) );\n            size_t pos = khash % m_size;\n\n            m_insertions++;\n\n            if ( m_keys[pos] != NULL )\n            {\n                \/\/ Collision!\n                size_t collisionNum = 0, attempts = 0;\n                while ( m_keys[pos] )\n                {\n                    pos += 2 * ++collisionNum - 1;\n                    if ( pos >= m_size )\n                        pos %= m_size;\n\n                    \/\/ Kills us if we didn't resize properly.\n                    attempts++;\n                    CoreAssert ( attempts < m_size * 2 );\n                }\n                m_collisions += collisionNum \/ 2;\n                CoreAssert ( pos < m_size );\n                CoreAssert ( m_keys[pos] == NULL );\n            }\n\n            \/\/ Seems OK.\n            m_array[pos] = _data;\n            m_keys[pos] = new char [strlen (_key)+1];\n            strcpy ( m_keys[pos], _key );\n            m_used++;\n\n            return true;\n        }\n    }\n}\n<commit_msg>Hash table fill threshold altered.<commit_after>\/*\n *   CrissCross\n *   A multi-purpose cross-platform library.\n *\n *   A product of Uplink Laboratories.\n *\n *   (c) 2006-2008 Steven Noonan.\n *   Licensed under the New BSD License.\n *\n *\/\n\n#ifndef __included_cc_hashtable_h\n#  error \"This file shouldn't be compiled directly.\"\n#endif\n\n#include <crisscross\/stopwatch.h>\n\n#define HASH_TABLE_FILL_THRESHHOLD 75.0\n#define HASH_TABLE_SIZE_MAGNITUDE 2\n\nnamespace CrissCross\n{\n    namespace Data\n    {\n        template <class T>\n        HashTable<T>::HashTable ( size_t _initialSize )\n        {\n            if ( _initialSize < 500 ) _initialSize = 500;\n\n            m_size = _initialSize;\n            m_used = 0;\n            m_array = new T[_initialSize];\n            m_keys = new char*[_initialSize];\n            memset ( m_array, 0, sizeof ( T ) * _initialSize );\n            memset ( m_keys, 0, sizeof ( char * ) * _initialSize );\n            m_insertions = m_collisions = m_searches = m_hits = 0;\n        }\n\n        template <class T>\n        HashTable<T>::~HashTable ()\n        {\n            delete [] m_array;\n            m_array = NULL;\n            for ( size_t i = 0; i < m_size; i++ )\n            {\n                delete [] m_keys[i];\n                m_keys[i] = NULL;\n            }\n            delete [] m_keys;\n            m_keys = NULL;\n            m_size = 0;\n        }\n\n        template <class T>\n        size_t HashTable<T>::hash ( const char * const &_key, size_t _length ) const\n        {\n            CoreAssert ( _key );\n            size_t hash = 0;\n            size_t i;\n            for (i = 0; i < _length; i++){\n                hash += _key[i];\n                hash += ( hash << 10 );\n                hash ^= ( hash >> 6 );\n            }\n            hash += ( hash << 3 );\n            hash ^= ( hash >> 11 );\n            hash += ( hash << 15 );\n            return hash;\n        }\n\n        template <class T>\n        void HashTable<T>::grow ()\n        {\n            size_t oldSize = m_size;\n            m_size *= HASH_TABLE_SIZE_MAGNITUDE;\n            m_used = 0;\n\n            T *oldArray = m_array;\n            m_array = new T[m_size ];\n            memset ( m_array, 0, sizeof ( T ) * m_size );\n\n            char **oldKeys = m_keys;\n            m_keys = new char *[m_size];\n            memset ( m_keys, 0, sizeof ( char * ) * m_size );\n\n            for ( size_t i = 0; i < oldSize; i++ )\n            {\n                if ( oldKeys[i] )\n                {\n                    insert ( oldKeys[i], oldArray[i] );\n                    delete [] oldKeys[i];\n                }\n            }\n\n            delete [] oldArray;\n            delete [] oldKeys;\n\n        }\n\n        template <class T>\n        size_t HashTable<T>::findIndex ( const char * const &_key ) const\n        {\n            size_t khash = hash ( _key, strlen ( _key ) );\n            size_t pos = khash % m_size;\n\n            m_searches++;\n\n            if ( !m_keys[pos] || strcmp ( m_keys[pos], _key ) != 0 )\n            {\n                \/\/ Hmm. The data isn't at the location it should be.\n                size_t collisionNum = 0, attempts = 0;\n                while ( m_keys[pos] && strcmp ( m_keys[pos], _key ) != 0 )\n                {\n                    pos += 2 * ++collisionNum - 1;\n                    if ( pos >= m_size )\n                        pos %= m_size;\n\n                    attempts++;\n                    if ( attempts > 128 )\n                        return 0; \/\/ Kills us if something's seriously wrong\n                }\n\t\t\t\tif ( !m_keys[pos] )\n\t\t\t\t\treturn 0;\n                m_hits++;\n\n                CoreAssert ( pos < m_size );\n                CoreAssert ( m_keys[pos] != NULL );\n            }\n            else\n            {\n                m_hits++;\n            }\n\n            return pos;\n        }\n\n        template <class T>\n        T const &HashTable<T>::find ( const char * const &_key ) const\n        {\n            static T null (0);\n            size_t index = findIndex ( _key );\n            if ( m_keys[index] && strcmp ( m_keys[index], _key ) == 0 )\n                return m_array[index];\n            else\n                return null;\n        }\n\n        template <class T>\n        bool HashTable<T>::find ( const char * const &_key, T &_data ) const\n        {\n            size_t index = findIndex ( _key );\n            if ( m_keys[index] && strcmp ( m_keys[index], _key ) == 0 )\n            {\n                _data = m_array[index];\n                return true;\n            }\n\n            return false;\n        }\n\n        template <class T>\n        void HashTable<T>::print_statistics () const\n        {\n            double hitPercentage = ((double)m_hits \/ (double)m_searches ) * 100.0,\n                   collisionPercentage = ((double)m_collisions \/ (double)m_insertions ) * 100.0,\n                   usagePercentage = ((double)m_used \/ (double)m_size ) * 100.0;\n            if ( m_searches == 0 ) hitPercentage = 0.0;\n\n            if ( m_insertions == 0 ) collisionPercentage = 0.0;\n\n            printf ( \"\\n\" );\n            printf ( \"HASH TABLE STATISTICS:\\n\\n\" );\n            printf ( \"SIZE: %lu (%luKB)\\n\", m_size, (( m_size * sizeof( T )) + ( m_size * sizeof( char* ))) \/ 1024 );\n            printf ( \"USED: %lu (%0.2lf%%)\\n\", m_used, usagePercentage );\n            printf ( \"SEARCH STATISTICS:\\n\" );\n            printf ( \"\\tSEARCHES: %lu\\n\", m_searches );\n            printf ( \"\\tHITS: %lu (%0.2lf%%)\\n\", m_hits, hitPercentage );\n            printf ( \"INSERTION STATISTICS:\\n\" );\n            printf ( \"\\tINSERTIONS: %lu\\n\", m_insertions );\n            printf ( \"\\tCOLLISIONS: %lu (%0.2lf%%)\\n\", m_collisions, collisionPercentage );\n            double q1 = hitPercentage,\n                   q2 = ( 100.0 - collisionPercentage ),\n                   q3 = ( usagePercentage * ( 100.0 \/ HASH_TABLE_FILL_THRESHHOLD ) );\n            printf ( \"*** OVERALL QUALITY ESTIMATION : %0.2lf%% ( (%0.2lf%% + %0.2lf%% + %0.2lf%%) \/ 3.0 ) ***\\n\",\n                     ( q1 + q2 + q3 ) \/ 3.0, q1, q2, q3 );\n            printf ( \"\\n\" );\n\n            m_hits = m_searches = m_collisions = m_insertions = 0;\n        }\n\n        template <class T>\n        bool HashTable<T>::erase ( const char * const &_key )\n        {\n            size_t index = findIndex ( _key );\n            if ( m_keys[index] && strcmp ( m_keys[index], _key ) == 0 )\n            {\n                delete [] m_keys[index];\n                m_keys[index] = NULL;\n                m_used--;\n                return true;\n            }\n\n            return false;\n        }\n\n        template <class T>\n        size_t HashTable<T>::mem_usage () const\n        {\n            size_t ret = sizeof ( *this );\n            ret += m_size * sizeof ( T );\n            ret += m_size * sizeof ( char * );\n            return ret;\n        }\n\n        template <class T>\n        bool HashTable<T>::insert ( const char * const &_key, T const &_data )\n        {\n\n            if ( ( ( (double)m_used \/ (double)m_size ) * 100 ) > HASH_TABLE_FILL_THRESHHOLD )\n            {\n                \/\/ We need to grow and rebuild the table... We're too full.\n                grow ();\n            }\n\n            size_t khash = hash ( _key, strlen ( _key ) );\n            size_t pos = khash % m_size;\n\n            m_insertions++;\n\n            if ( m_keys[pos] != NULL )\n            {\n                \/\/ Collision!\n                size_t collisionNum = 0, attempts = 0;\n                while ( m_keys[pos] )\n                {\n                    pos += 2 * ++collisionNum - 1;\n                    if ( pos >= m_size )\n                        pos %= m_size;\n\n                    \/\/ Kills us if we didn't resize properly.\n                    attempts++;\n                    CoreAssert ( attempts < m_size * 2 );\n                }\n                m_collisions += collisionNum \/ 2;\n                CoreAssert ( pos < m_size );\n                CoreAssert ( m_keys[pos] == NULL );\n            }\n\n            \/\/ Seems OK.\n            m_array[pos] = _data;\n            m_keys[pos] = new char [strlen (_key)+1];\n            strcpy ( m_keys[pos], _key );\n            m_used++;\n\n            return true;\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <sandbox\/voxelization.hpp>\r\n\r\n#include <shiny\/context.hpp>\r\n#include <shiny\/scene.hpp>\r\n#include <shiny\/draw.hpp>\r\n\r\n#include <shelf\/file.hpp>\r\n\r\n#include <shox\/morton.hpp>\r\n\r\n#include <atma\/math\/matrix4f.hpp>\r\n#include <atma\/math\/vector4f.hpp>\r\n#include <atma\/math\/vector4i.hpp>\r\n#include <atma\/math\/triangle.hpp>\r\n#include <atma\/math\/aabc.hpp>\r\n#include <atma\/math\/intersection.hpp>\r\n\r\n#include <atma\/filesystem\/file.hpp>\r\n\r\n\r\nusing namespace sandbox;\r\nusing sandbox::voxelization_plugin_t;\r\n\r\n\r\n\r\n\r\n\r\nstruct obj_model_t\r\n{\r\n\tusing verts_t = std::vector<aml::vector4f>;\r\n\tusing faces_t = std::vector<aml::vector4i>;\r\n\r\n\tobj_model_t(shelf::file_t&);\r\n\r\n\tauto vertices() const -> verts_t const& { return verts_; }\r\n\tauto faces() const -> faces_t const& { return faces_; }\r\n\tauto triangle_of(aml::vector4i const&) const -> aml::triangle_t;\r\n\r\nprivate:\r\n\tverts_t verts_;\r\n\tfaces_t faces_;\r\n};\r\n\r\nobj_model_t::obj_model_t(shelf::file_t& file)\r\n{\r\n\tshelf::for_each_line<256>(file, 128, [&](char const* str, size_t size)\r\n\t{\r\n\t\tswitch (str[0])\r\n\t\t{\r\n\t\t\tcase 'v': {\r\n\t\t\t\tfloat x, y, z;\r\n\t\t\t\tsscanf(str, \"v %f %f %f\", &x, &y, &z);\r\n\t\t\t\tverts_.push_back(aml::point4f(x, y, -z)); \/\/ reflect z because RH -> LH\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\r\n\t\t\tcase 'f': {\r\n\t\t\t\tint32 a, b, c;\r\n\t\t\t\tsscanf(str, \"f %d %d %d\", &a, &b, &c);\r\n\t\t\t\tfaces_.push_back(aml::vector4i{a - 1, b - 1, c - 1, 0});\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t});\r\n}\r\n\r\nauto obj_model_t::triangle_of(aml::vector4i const& f) const -> aml::triangle_t\r\n{\r\n\treturn aml::triangle_t{verts_[f.x], verts_[f.y], verts_[f.z]};\r\n}\r\n\r\nauto voxelization_plugin_t::gfx_setup(shiny::context_ptr const& ctx2) -> void\r\n{\r\n\tctx = ctx2;\r\n}\r\n\r\nstruct voxel_t\r\n{\r\n\tuint64 morton;\r\n};\r\n\r\nauto operator < (voxel_t const& lhs, voxel_t const& rhs) -> bool\r\n{\r\n\treturn lhs.morton < rhs.morton;\r\n}\r\n\r\nauto operator == (voxel_t const& lhs, voxel_t const& rhs) -> bool\r\n{\r\n\treturn lhs.morton == rhs.morton;\r\n}\r\n\r\nauto voxelization_plugin_t::main_setup() -> void\r\n{\r\n\tauto sf = shelf::file_t{\"..\/..\/data\/dragon.obj\"};\r\n\tauto obj = obj_model_t{sf};\r\n\r\n\t\/\/ try for 128^3 grid\r\n\tauto const gridsize = 128;\r\n\r\n\t\r\n#if 1\r\n\tauto fragments = std::vector<voxel_t>{};\r\n\r\n\t\/\/ get the real-world bounding box of the model\r\n\tauto bbmin = aml::point4f(FLT_MAX, FLT_MAX, FLT_MAX), bbmax = aml::point4f(-FLT_MAX, -FLT_MAX, -FLT_MAX);\r\n\r\n\tfor (auto const& v : obj.vertices())\r\n\t{\r\n\t\tif (v.x < bbmin.x) bbmin.x = v.x;\r\n\t\tif (v.y < bbmin.y) bbmin.y = v.y;\r\n\t\tif (v.z < bbmin.z) bbmin.z = v.z;\r\n\r\n\t\tif (bbmax.x < v.x) bbmax.x = v.x;\r\n\t\tif (bbmax.y < v.y) bbmax.y = v.y;\r\n\t\tif (bbmax.z < v.z) bbmax.z = v.z;\r\n\t}\r\n\r\n\r\n\tauto tri_dp = bbmax - bbmin;\r\n\t\/\/auto mid = (bbmin + bbmax) \/ 2.f;\r\n\r\n\r\n\t\/\/ expand to a cube\r\n\tauto gridwidth = std::max({tri_dp.x, tri_dp.y, tri_dp.z});\r\n\tauto halfgridwidth = gridwidth \/ 2.f;\r\n\r\n\tauto voxelwidth = gridwidth \/ gridsize;\r\n\r\n\tfor (auto const& f : obj.faces())\r\n\t{\r\n\t\tauto t = obj.triangle_of(f);\r\n\t\tauto tbb = t.aabb();\r\n\t\tauto info = aml::aabb_triangle_intersection_info_t{aml::vector4f{voxelwidth, voxelwidth, voxelwidth}, t.v0, t.v1, t.v2};\r\n\r\n\t\tauto tgridmin = aml::vector4i{\r\n\t\t\t(int)(gridsize * ((tbb.min_point().x - bbmin.x) \/ gridwidth)),\r\n\t\t\t(int)(gridsize * ((tbb.min_point().y - bbmin.y) \/ gridwidth)),\r\n\t\t\t(int)(gridsize * ((tbb.min_point().z - bbmin.z) \/ gridwidth)),\r\n\t\t\t0};\r\n\r\n\t\tauto tgridmax = aml::vector4i{\r\n\t\t\t(int)(gridsize * ((tbb.max_point().x - bbmin.x) \/ gridwidth)),\r\n\t\t\t(int)(gridsize * ((tbb.max_point().y - bbmin.y) \/ gridwidth)),\r\n\t\t\t(int)(gridsize * ((tbb.max_point().z - bbmin.z) \/ gridwidth)),\r\n\t\t\t0};\r\n\r\n\t\tfor (int x = tgridmin.x; x <= tgridmax.x; ++x)\r\n\t\t{\r\n\t\t\tfor (int y = tgridmin.y; y <= tgridmax.y; ++y)\r\n\t\t\t{\r\n\t\t\t\tfor (int z = tgridmin.z; z <= tgridmax.z; ++z)\r\n\t\t\t\t{\r\n\t\t\t\t\tauto aabc = aml::aabc_t{\r\n\t\t\t\t\t\tbbmin.x + x * voxelwidth + voxelwidth \/ 2.f,\r\n\t\t\t\t\t\tbbmin.y + y * voxelwidth + voxelwidth \/ 2.f,\r\n\t\t\t\t\t\tbbmin.z + z * voxelwidth + voxelwidth \/ 2.f,\r\n\t\t\t\t\t\tvoxelwidth};\r\n\r\n\t\t\t\t\tif (aml::intersect_aabb_triangle(aabc, info))\r\n\t\t\t\t\t\tfragments.push_back({moxi::morton_encoding(x, y, z)});\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tstd::sort(fragments.begin(), fragments.end());\r\n\t\r\n\tfragments.erase(\r\n\t\tstd::unique(fragments.begin(), fragments.end()),\r\n\t\tfragments.end());\r\n\r\n\tstd::vector<aml::vector4f> vertices;\r\n\tstd::vector<uint32> indices;\r\n\r\n\tuint64 m = 0;\r\n\tint fragidx = 0;\r\n\tfor (auto const& frag : fragments)\r\n\t{\r\n\t\tuint x, y, z;\r\n\t\tmoxi::morton_decoding(frag.morton, x, y, z);\r\n\r\n\t\tauto scale = aml::matrix4f::scale(0.1f);\r\n\t\tauto translate = aml::matrix4f::translate(aml::vector4f{(float)x, (float)y, (float)z});\r\n\t\tauto cmp = translate * scale;\r\n\r\n\t\tfor (int i = 0; i != 8; ++i)\r\n\t\t{\r\n\t\t\tauto v = aml::vector4f{cube_vertices()[i * 8 + 0], cube_vertices()[i * 8 + 1], cube_vertices()[i * 8 + 2], cube_vertices()[i * 8 + 3]};\r\n\t\t\tvertices.push_back(v * cmp);\r\n\t\t}\r\n\r\n\t\tfor (auto idx = cube_indices(); idx != cube_indices() + 36; ++idx)\r\n\t\t\tindices.push_back(fragidx * 8 + *idx);\r\n\t\t++fragidx;\r\n\t}\r\n\r\n\tstd::vector<std::vector<uint>> levels;\r\n\tstd::vector<aml::vector4f> fragments3d;\r\n\r\n\t\/\/ blocks are 8x8x8, so every 512 morton codes\r\n\t{\r\n\t\tauto const block_edge_size = 8;\r\n\t\tauto i = fragments.begin();\r\n\t\tauto idx = 0;\r\n\r\n\t\tauto block_morton_width = block_edge_size * block_edge_size * block_edge_size;\r\n\t\tauto block_idx_start = 0;\r\n\t\tauto block_idx_end = block_idx_start + block_morton_width;\r\n\r\n\t\tfor (auto idx = 0; idx != gridsize * gridsize * gridsize; )\r\n\t\t{\r\n\t\t\t\/\/ skip past fully empty empty bricks\r\n\t\t\tfor ( ; block_idx_end < i->morton; )\r\n\t\t\t\tblock_idx_end = (block_idx_start = block_idx_end) + block_morton_width;\r\n\r\n\t\t\tfor (idx = block_idx_start; idx < i->morton; ++idx)\r\n\t\t\t\tfragments3d.push_back(aml::vector4f{});\r\n\r\n\t\t\tif (i->morton >= block_idx_end)\r\n\t\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\tvb = shiny::create_vertex_buffer(ctx, shiny::buffer_usage_t::immutable, dd_position(), (uint)vertices.size(), &vertices[0]);\r\n\tib = shiny::create_index_buffer(ctx, shiny::buffer_usage_t::immutable, shiny::index_format_t::index32, (uint)indices.size(), &indices[0]);\r\n\r\n#else\r\n\tuint32* mi = new uint32[obj.faces().size() * 3];\r\n\tsize_t i = 0;\r\n\tfor (auto const& x : obj.faces()) {\r\n\t\t\/\/memcpy(mi + i * 3, &x.x, 3 * sizeof(uint32));\r\n\t\tmi[i * 3 + 2] = x.x;\r\n\t\tmi[i * 3 + 1] = x.y;\r\n\t\tmi[i * 3 + 0] = x.z;\r\n\t\t++i;\r\n\t}\r\n\r\n\r\n\tvb = shiny::create_vertex_buffer(ctx, shiny::buffer_usage_t::immutable, dd_position(), obj.vertices().size(), &obj.vertices()[0]);\r\n\tib = shiny::create_index_buffer(ctx, shiny::buffer_usage_t::immutable, shiny::index_format_t::index32, obj.faces().size() * 3, mi);\r\n\r\n#endif\r\n\r\n\tauto f2 = atma::filesystem::file_t(\"..\/..\/shaders\/gs_normal.hlsl\");\r\n\tauto fm2 = f2.read_into_memory();\r\n\tgs = shiny::create_geometry_shader(ctx, fm2, false);\r\n\r\n\r\n}\r\n\r\nauto voxelization_plugin_t::gfx_draw(shiny::scene_t& scene) -> void\r\n{\r\n\tnamespace sdc = shiny::draw_commands;\r\n\r\n\tscene.draw\r\n\t\t( sdc::input_assembly_stage(dd_position(), vb, ib)\r\n\t\t, sdc::vertex_stage(vs_flat(), shiny::bound_constant_buffers_t{{0, scene.scene_constant_buffer()}})\r\n\t\t, sdc::geometry_stage(gs)\r\n\t\t, sdc::fragment_stage(fs_flat())\r\n\t\t);\r\n}\r\n<commit_msg>began octree construction<commit_after>#include <sandbox\/voxelization.hpp>\r\n\r\n#include <shiny\/context.hpp>\r\n#include <shiny\/scene.hpp>\r\n#include <shiny\/draw.hpp>\r\n\r\n#include <shelf\/file.hpp>\r\n\r\n#include <shox\/morton.hpp>\r\n\r\n#include <atma\/math\/matrix4f.hpp>\r\n#include <atma\/math\/vector4f.hpp>\r\n#include <atma\/math\/vector4i.hpp>\r\n#include <atma\/math\/triangle.hpp>\r\n#include <atma\/math\/aabc.hpp>\r\n#include <atma\/math\/intersection.hpp>\r\n\r\n#include <atma\/filesystem\/file.hpp>\r\n\r\n\r\nusing namespace sandbox;\r\nusing sandbox::voxelization_plugin_t;\r\n\r\n\r\n\r\n\r\n\r\nstruct obj_model_t\r\n{\r\n\tusing verts_t = std::vector<aml::vector4f>;\r\n\tusing faces_t = std::vector<aml::vector4i>;\r\n\r\n\tobj_model_t(shelf::file_t&);\r\n\r\n\tauto vertices() const -> verts_t const& { return verts_; }\r\n\tauto faces() const -> faces_t const& { return faces_; }\r\n\tauto triangle_of(aml::vector4i const&) const -> aml::triangle_t;\r\n\r\nprivate:\r\n\tverts_t verts_;\r\n\tfaces_t faces_;\r\n};\r\n\r\nobj_model_t::obj_model_t(shelf::file_t& file)\r\n{\r\n\tshelf::for_each_line<256>(file, 128, [&](char const* str, size_t size)\r\n\t{\r\n\t\tswitch (str[0])\r\n\t\t{\r\n\t\t\tcase 'v': {\r\n\t\t\t\tfloat x, y, z;\r\n\t\t\t\tsscanf(str, \"v %f %f %f\", &x, &y, &z);\r\n\t\t\t\tverts_.push_back(aml::point4f(x, y, -z)); \/\/ reflect z because RH -> LH\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\r\n\t\t\tcase 'f': {\r\n\t\t\t\tint32 a, b, c;\r\n\t\t\t\tsscanf(str, \"f %d %d %d\", &a, &b, &c);\r\n\t\t\t\tfaces_.push_back(aml::vector4i{a - 1, b - 1, c - 1, 0});\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t});\r\n}\r\n\r\nauto obj_model_t::triangle_of(aml::vector4i const& f) const -> aml::triangle_t\r\n{\r\n\treturn aml::triangle_t{verts_[f.x], verts_[f.y], verts_[f.z]};\r\n}\r\n\r\nauto voxelization_plugin_t::gfx_setup(shiny::context_ptr const& ctx2) -> void\r\n{\r\n\tctx = ctx2;\r\n}\r\n\r\nstruct voxel_t\r\n{\r\n\tuint64 morton;\r\n};\r\n\r\nauto operator < (voxel_t const& lhs, voxel_t const& rhs) -> bool\r\n{\r\n\treturn lhs.morton < rhs.morton;\r\n}\r\n\r\nauto operator == (voxel_t const& lhs, voxel_t const& rhs) -> bool\r\n{\r\n\treturn lhs.morton == rhs.morton;\r\n}\r\n\r\nauto voxelization_plugin_t::main_setup() -> void\r\n{\r\n\tauto sf = shelf::file_t{\"..\/..\/data\/dragon.obj\"};\r\n\tauto obj = obj_model_t{sf};\r\n\r\n\t\/\/ try for 128^3 grid\r\n\tauto const gridsize = 128;\r\n\r\n\t\r\n#if 1\r\n\tauto fragments = std::vector<voxel_t>{};\r\n\r\n\t\/\/ get the real-world bounding box of the model\r\n\tauto bbmin = aml::point4f(FLT_MAX, FLT_MAX, FLT_MAX), bbmax = aml::point4f(-FLT_MAX, -FLT_MAX, -FLT_MAX);\r\n\r\n\tfor (auto const& v : obj.vertices())\r\n\t{\r\n\t\tif (v.x < bbmin.x) bbmin.x = v.x;\r\n\t\tif (v.y < bbmin.y) bbmin.y = v.y;\r\n\t\tif (v.z < bbmin.z) bbmin.z = v.z;\r\n\r\n\t\tif (bbmax.x < v.x) bbmax.x = v.x;\r\n\t\tif (bbmax.y < v.y) bbmax.y = v.y;\r\n\t\tif (bbmax.z < v.z) bbmax.z = v.z;\r\n\t}\r\n\r\n\r\n\tauto tri_dp = bbmax - bbmin;\r\n\t\/\/auto mid = (bbmin + bbmax) \/ 2.f;\r\n\r\n\r\n\t\/\/ expand to a cube\r\n\tauto gridwidth = std::max({tri_dp.x, tri_dp.y, tri_dp.z});\r\n\tauto halfgridwidth = gridwidth \/ 2.f;\r\n\r\n\tauto voxelwidth = gridwidth \/ gridsize;\r\n\r\n\tfor (auto const& f : obj.faces())\r\n\t{\r\n\t\tauto t = obj.triangle_of(f);\r\n\t\tauto tbb = t.aabb();\r\n\t\tauto info = aml::aabb_triangle_intersection_info_t{aml::vector4f{voxelwidth, voxelwidth, voxelwidth}, t.v0, t.v1, t.v2};\r\n\r\n\t\tauto tgridmin = aml::vector4i{\r\n\t\t\t(int)(gridsize * ((tbb.min_point().x - bbmin.x) \/ gridwidth)),\r\n\t\t\t(int)(gridsize * ((tbb.min_point().y - bbmin.y) \/ gridwidth)),\r\n\t\t\t(int)(gridsize * ((tbb.min_point().z - bbmin.z) \/ gridwidth)),\r\n\t\t\t0};\r\n\r\n\t\tauto tgridmax = aml::vector4i{\r\n\t\t\t(int)(gridsize * ((tbb.max_point().x - bbmin.x) \/ gridwidth)),\r\n\t\t\t(int)(gridsize * ((tbb.max_point().y - bbmin.y) \/ gridwidth)),\r\n\t\t\t(int)(gridsize * ((tbb.max_point().z - bbmin.z) \/ gridwidth)),\r\n\t\t\t0};\r\n\r\n\t\tfor (int x = tgridmin.x; x <= tgridmax.x; ++x)\r\n\t\t{\r\n\t\t\tfor (int y = tgridmin.y; y <= tgridmax.y; ++y)\r\n\t\t\t{\r\n\t\t\t\tfor (int z = tgridmin.z; z <= tgridmax.z; ++z)\r\n\t\t\t\t{\r\n\t\t\t\t\tauto aabc = aml::aabc_t{\r\n\t\t\t\t\t\tbbmin.x + x * voxelwidth + voxelwidth \/ 2.f,\r\n\t\t\t\t\t\tbbmin.y + y * voxelwidth + voxelwidth \/ 2.f,\r\n\t\t\t\t\t\tbbmin.z + z * voxelwidth + voxelwidth \/ 2.f,\r\n\t\t\t\t\t\tvoxelwidth};\r\n\r\n\t\t\t\t\tif (aml::intersect_aabb_triangle(aabc, info))\r\n\t\t\t\t\t\tfragments.push_back({moxi::morton_encoding(x, y, z)});\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tstd::sort(fragments.begin(), fragments.end());\r\n\t\r\n\tfragments.erase(\r\n\t\tstd::unique(fragments.begin(), fragments.end()),\r\n\t\tfragments.end());\r\n\r\n\tstd::vector<aml::vector4f> vertices;\r\n\tstd::vector<uint32> indices;\r\n\r\n\tuint64 m = 0;\r\n\tint fragidx = 0;\r\n\tfor (auto const& frag : fragments)\r\n\t{\r\n\t\tuint x, y, z;\r\n\t\tmoxi::morton_decoding(frag.morton, x, y, z);\r\n\r\n\t\tauto scale = aml::matrix4f::scale(0.1f);\r\n\t\tauto translate = aml::matrix4f::translate(aml::vector4f{(float)x, (float)y, (float)z});\r\n\t\tauto cmp = translate * scale;\r\n\r\n\t\tfor (int i = 0; i != 8; ++i)\r\n\t\t{\r\n\t\t\tauto v = aml::vector4f{cube_vertices()[i * 8 + 0], cube_vertices()[i * 8 + 1], cube_vertices()[i * 8 + 2], cube_vertices()[i * 8 + 3]};\r\n\t\t\tvertices.push_back(v * cmp);\r\n\t\t}\r\n\r\n\t\tfor (auto idx = cube_indices(); idx != cube_indices() + 36; ++idx)\r\n\t\t\tindices.push_back(fragidx * 8 + *idx);\r\n\t\t++fragidx;\r\n\t}\r\n\r\n\tstruct vnode_t\r\n\t{\r\n\t\tuint64 children[8];\r\n\t\tuint64 brick_idx[8];\r\n\t};\r\n\r\n\tauto const block_edge_size = uint64(8);\r\n\tauto const levels_required = aml::log2(gridsize \/ block_edge_size);\r\n\tauto node_levels = std::vector<std::vector<vnode_t>>{levels_required};\r\n\tstd::vector<aml::vector4f> fragments3d;\r\n\r\n\tauto publish_node = [](int level, uint64 brick_morton_code, uint64 offset)\r\n\t{\r\n\t\t\r\n\t};\r\n\r\n\tauto publish_empty_brick = [&](uint64 brick_morton_code, uint64 offset)\r\n\t{\r\n\t\tauto& level = 0;\r\n\t\tauto& node = node_levels[level].back();\r\n\t\tnode.brick_idx[morton_code % 8] = offset;\r\n\r\n\t\tif (morton_code % 8 == 7) {\r\n\t\t\tpublish_node(level + 1, )\r\n\t\t}\r\n\t};\r\n\r\n\t\/\/ blocks are 8x8x8, so every 512 morton codes\r\n\t{\r\n\t\tauto fragment_iter = fragments.begin();\r\n\t\t\r\n\t\t\r\n\t\tauto brick_morton_width = block_edge_size * block_edge_size * block_edge_size;\r\n\t\tauto block_idx_start = 0;\r\n\t\tauto block_idx_end = block_idx_start + brick_morton_width;\r\n\r\n\t\tfor (auto fragment_idx = 0; fragment_idx != gridsize * gridsize * gridsize; )\r\n\t\t{\r\n\t\t\t\/\/ skip past fully empty empty bricks\r\n\t\t\tfor (; fragment_idx + brick_morton_width < fragment_iter->morton; fragment_idx += brick_morton_width)\r\n\t\t\t{\r\n\t\t\t}\r\n\r\n\t\t\tauto brick_end = fragment_idx + brick_morton_width;\r\n\t\t\tfor ( ; fragment < i->morton; ++idx)\r\n\t\t\t\tfragments3d.push_back(aml::vector4f{});\r\n\r\n\t\t\tif (i->morton >= block_idx_end)\r\n\t\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\tvb = shiny::create_vertex_buffer(ctx, shiny::buffer_usage_t::immutable, dd_position(), (uint)vertices.size(), &vertices[0]);\r\n\tib = shiny::create_index_buffer(ctx, shiny::buffer_usage_t::immutable, shiny::index_format_t::index32, (uint)indices.size(), &indices[0]);\r\n\r\n#else\r\n\tuint32* mi = new uint32[obj.faces().size() * 3];\r\n\tsize_t i = 0;\r\n\tfor (auto const& x : obj.faces()) {\r\n\t\t\/\/memcpy(mi + i * 3, &x.x, 3 * sizeof(uint32));\r\n\t\tmi[i * 3 + 2] = x.x;\r\n\t\tmi[i * 3 + 1] = x.y;\r\n\t\tmi[i * 3 + 0] = x.z;\r\n\t\t++i;\r\n\t}\r\n\r\n\r\n\tvb = shiny::create_vertex_buffer(ctx, shiny::buffer_usage_t::immutable, dd_position(), obj.vertices().size(), &obj.vertices()[0]);\r\n\tib = shiny::create_index_buffer(ctx, shiny::buffer_usage_t::immutable, shiny::index_format_t::index32, obj.faces().size() * 3, mi);\r\n\r\n#endif\r\n\r\n\tauto f2 = atma::filesystem::file_t(\"..\/..\/shaders\/gs_normal.hlsl\");\r\n\tauto fm2 = f2.read_into_memory();\r\n\tgs = shiny::create_geometry_shader(ctx, fm2, false);\r\n\r\n\r\n}\r\n\r\nauto voxelization_plugin_t::gfx_draw(shiny::scene_t& scene) -> void\r\n{\r\n\tnamespace sdc = shiny::draw_commands;\r\n\r\n\tscene.draw(\r\n\t\tsdc::input_assembly_stage(dd_position(), vb, ib),\r\n\t\tsdc::vertex_stage(vs_flat(), shiny::bound_constant_buffers_t{\r\n\t\t\t{0, scene.scene_constant_buffer()}\r\n\t\t}),\r\n\t\tsdc::geometry_stage(gs),\r\n\t\tsdc::fragment_stage(fs_flat()));\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>#include \"razornotification.h\"\n\n#include <QDBusMessage>\n#include <QDBusConnection>\n#include <QVariantMap>\n#include <QDebug>\n#include <QStringList>\n#include <QMessageBox>\n\n\nnamespace\n{\n    const QString g_scFreedesktopNotificationName = \"org.freedesktop.Notifications\";\n    const QString g_scSignalName = \"Notify\";\n}\n\nclass RazorNotificationPrivate\n{\npublic:\n    RazorNotificationPrivate():\n        m_bus(QDBusConnection::sessionBus())\n    {\n    }\n\n    QDBusConnection m_bus ;\n    quint32 notify(const QString& appName,\n                   const QString& appIcon,\n                   const QString& summary,\n                   const QString& body,\n                   const QVariantMap& hints,\n                   quint32 replace_id,\n                   qint32 expire_timeout)\n    {\n        QDBusMessage m = QDBusMessage::createMethodCall(QString::fromLatin1(\"org.freedesktop.Notifications\"),\n                                                        QString::fromLatin1(\"\/org\/freedesktop\/Notifications\"),\n                                                        QString::fromLatin1(\"org.freedesktop.Notifications\"),\n                                                        QString::fromLatin1(\"Notify\"));\n\n        quint32 ret=0;\n        QList<QVariant> args;\n        QStringList actions;\n\n        args.append(appName); \/\/ app_name\n        args.append( uint(0) ); \/\/ replaces_id\n        args.append(appIcon); \/\/ app_icon\n        args.append(summary); \/\/ summary\n        args.append(body); \/\/ body\n        args.append(actions); \/\/ body\n\n        args.append(hints); \/\/ hints\n        args.append(expire_timeout); \/\/ timeout\n        m.setArguments(args);\n        QDBusMessage resp= m_bus.call(m);\n        QVariantList retArgs = resp.arguments();\n        qDebug() << retArgs << \"size=\" << retArgs.size() << resp.errorMessage();\n        if ( retArgs.size() != 1)\n        {\n            qWarning() << \"Unexpected number of retunred values\";\n        }\n        else\n        {\n            ret = retArgs.at(0).toUInt();\n        }\n        \n        \/\/ failback if there is no daemon running\n        if (m_bus.lastError().isValid() || !m.errorName().isEmpty())\n        {\n            qWarning() << \"Notification message cannot be delivered. Using failback QMessageBox\";\n            qWarning() << \"    \" << m_bus.lastError() << m.errorName();\n            QMessageBox::information(0, QObject::tr(\"Razor Notification Failback\"), summary + \"<p>\" + body);\n        }\n\n        return ret ;\n    }\n\n    void closeNotification( quint32 id )\n    {\n        QDBusMessage m = QDBusMessage::createMethodCall(QString::fromLatin1(\"org.freedesktop.Notifications\"),\n                                                        QString::fromLatin1(\"\/org\/freedesktop\/Notifications\"),\n                                                        QString::fromLatin1(\"org.freedesktop.Notifications\"),\n                                                        QString::fromLatin1(\"CloseNotification\"));\n        QList<QVariant> args;\n        args.append(id);\n        m.setArguments(args);\n        m_bus.call(m);\n    }\n};\n\nRazorNotification::RazorNotification():\n    d_ptr( new RazorNotificationPrivate)\n{\n}\n\nquint32 RazorNotification::notify(const QString& appName,\n                                  const QString& appIcon,\n                                  const QString& summary,\n                                  const QString& body,\n                                  const QVariantMap& hints,\n                                  quint32 replace_id,\n                                  qint32 expire_timeout)\n{\n    RazorNotification n ;\n    return n.d_func()->notify(appName, appIcon, summary, body, hints, replace_id, expire_timeout);\n}\n\nvoid RazorNotification::closeNotification(quint32 id)\n{\n    RazorNotification n ;\n    n.d_func()->closeNotification(id);\n}\n<commit_msg>QDbusError canot be print out on Ubuntu version of qt<commit_after>#include \"razornotification.h\"\n\n#include <QDBusMessage>\n#include <QDBusConnection>\n#include <QVariantMap>\n#include <QDebug>\n#include <QStringList>\n#include <QMessageBox>\n\n\nnamespace\n{\n    const QString g_scFreedesktopNotificationName = \"org.freedesktop.Notifications\";\n    const QString g_scSignalName = \"Notify\";\n}\n\nclass RazorNotificationPrivate\n{\npublic:\n    RazorNotificationPrivate():\n        m_bus(QDBusConnection::sessionBus())\n    {\n    }\n\n    QDBusConnection m_bus ;\n    quint32 notify(const QString& appName,\n                   const QString& appIcon,\n                   const QString& summary,\n                   const QString& body,\n                   const QVariantMap& hints,\n                   quint32 replace_id,\n                   qint32 expire_timeout)\n    {\n        QDBusMessage m = QDBusMessage::createMethodCall(QString::fromLatin1(\"org.freedesktop.Notifications\"),\n                                                        QString::fromLatin1(\"\/org\/freedesktop\/Notifications\"),\n                                                        QString::fromLatin1(\"org.freedesktop.Notifications\"),\n                                                        QString::fromLatin1(\"Notify\"));\n\n        quint32 ret=0;\n        QList<QVariant> args;\n        QStringList actions;\n\n        args.append(appName); \/\/ app_name\n        args.append( uint(0) ); \/\/ replaces_id\n        args.append(appIcon); \/\/ app_icon\n        args.append(summary); \/\/ summary\n        args.append(body); \/\/ body\n        args.append(actions); \/\/ body\n\n        args.append(hints); \/\/ hints\n        args.append(expire_timeout); \/\/ timeout\n        m.setArguments(args);\n        QDBusMessage resp= m_bus.call(m);\n        QVariantList retArgs = resp.arguments();\n        qDebug() << retArgs << \"size=\" << retArgs.size() << resp.errorMessage();\n        if ( retArgs.size() != 1)\n        {\n            qWarning() << \"Unexpected number of retunred values\";\n        }\n        else\n        {\n            ret = retArgs.at(0).toUInt();\n        }\n        \n        \/\/ failback if there is no daemon running\n        if (m_bus.lastError().isValid() || !m.errorName().isEmpty())\n        {\n            qWarning() << \"Notification message cannot be delivered. Using failback QMessageBox\";\n            qWarning() << \"    \" << m_bus.lastError().message() << m.errorName();\n            QMessageBox::information(0, QObject::tr(\"Razor Notification Failback\"), summary + \"<p>\" + body);\n        }\n\n        return ret ;\n    }\n\n    void closeNotification( quint32 id )\n    {\n        QDBusMessage m = QDBusMessage::createMethodCall(QString::fromLatin1(\"org.freedesktop.Notifications\"),\n                                                        QString::fromLatin1(\"\/org\/freedesktop\/Notifications\"),\n                                                        QString::fromLatin1(\"org.freedesktop.Notifications\"),\n                                                        QString::fromLatin1(\"CloseNotification\"));\n        QList<QVariant> args;\n        args.append(id);\n        m.setArguments(args);\n        m_bus.call(m);\n    }\n};\n\nRazorNotification::RazorNotification():\n    d_ptr( new RazorNotificationPrivate)\n{\n}\n\nquint32 RazorNotification::notify(const QString& appName,\n                                  const QString& appIcon,\n                                  const QString& summary,\n                                  const QString& body,\n                                  const QVariantMap& hints,\n                                  quint32 replace_id,\n                                  qint32 expire_timeout)\n{\n    RazorNotification n ;\n    return n.d_func()->notify(appName, appIcon, summary, body, hints, replace_id, expire_timeout);\n}\n\nvoid RazorNotification::closeNotification(quint32 id)\n{\n    RazorNotification n ;\n    n.d_func()->closeNotification(id);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: txtparaimphint.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2004-07-14 12:15:00 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef _XMLOFF_TXTPARAIMPHINT_HXX\n#define _XMLOFF_TXTPARAIMPHINT_HXX\n\n#ifndef _RTL_USTRING_HXX_\n#include <rtl\/ustring.hxx>\n#endif\n#ifndef _RTL_USTRBUF_HXX_\n#include <rtl\/ustrbuf.hxx>\n#endif\n\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n\n#ifndef _SVARRAY_HXX\n#include <svtools\/svarray.hxx>\n#endif\n\n#ifndef _XMLOFF_XMLIMP_HXX\n#include \"xmlimp.hxx\"\n#endif\n#ifndef _XMLTEXTFRAMECONTEXT_HXX\n#include \"XMLTextFrameContext.hxx\"\n#endif\n#ifndef _XMLOFF_XMLEVENTSIMPORTCONTEXT_HXX\n#include \"XMLEventsImportContext.hxx\"\n#endif\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::text;\nusing namespace ::xmloff::token;\n\n\/\/ ---------------------------------------------------------------------\n\n#define XML_HINT_STYLE 1\n#define XML_HINT_REFERENCE 2\n#define XML_HINT_HYPERLINK 3\n#define XML_HINT_RUBY 4\n#define XML_HINT_INDEX_MARK 5\n#define XML_HINT_TEXT_FRAME 6\n\/\/ --> DVO, OD 2004-07-14 #i26791#\n#define XML_HINT_DRAW 7\n\/\/ <--\n\nclass XMLHint_Impl\n{\n    Reference < XTextRange > xStart;\n    Reference < XTextRange > xEnd;\n\n    sal_uInt8 nType;\n\npublic:\n\n    XMLHint_Impl( sal_uInt8 nTyp,\n                  const Reference < XTextRange > & rS,\n                  const Reference < XTextRange > & rE ) :\n        nType( nTyp ),\n        xStart( rS ),\n        xEnd( rE )\n    {\n    }\n\n    XMLHint_Impl( sal_uInt8 nTyp,\n                  const Reference < XTextRange > & rS ) :\n        nType( nTyp ),\n        xStart( rS )\n    {\n    }\n\n    virtual ~XMLHint_Impl() {}\n\n    const Reference < XTextRange > & GetStart() const { return xStart; }\n    const Reference < XTextRange > & GetEnd() const { return xEnd; }\n    void SetEnd( const Reference < XTextRange > & rPos ) { xEnd = rPos; }\n\n    \/\/ We don't use virtual methods to differ between the sub classes,\n    \/\/ because this seems to be to expensive if compared to inline methods.\n    sal_uInt8 GetType() const { return nType; }\n    sal_Bool IsStyle() { return XML_HINT_STYLE==nType; }\n    sal_Bool IsReference() { return XML_HINT_REFERENCE==nType; }\n    sal_Bool IsHyperlink() { return XML_HINT_HYPERLINK==nType; }\n    sal_Bool IsIndexMark() { return XML_HINT_INDEX_MARK==nType; }\n};\n\nclass XMLStyleHint_Impl : public XMLHint_Impl\n{\n    OUString                 sStyleName;\n\npublic:\n\n    XMLStyleHint_Impl( const OUString& rStyleName,\n                         const Reference < XTextRange > & rPos ) :\n        XMLHint_Impl( XML_HINT_STYLE, rPos, rPos ),\n        sStyleName( rStyleName )\n    {\n    }\n    virtual ~XMLStyleHint_Impl() {}\n\n    const OUString& GetStyleName() const { return sStyleName; }\n};\n\nclass XMLReferenceHint_Impl : public XMLHint_Impl\n{\n    OUString                 sRefName;\n\npublic:\n\n    XMLReferenceHint_Impl( const OUString& rRefName,\n                             const Reference < XTextRange > & rPos ) :\n        XMLHint_Impl( XML_HINT_REFERENCE, rPos, rPos ),\n        sRefName( rRefName )\n    {\n    }\n\n    virtual ~XMLReferenceHint_Impl() {}\n\n    const OUString& GetRefName() const { return sRefName; }\n};\n\nclass XMLHyperlinkHint_Impl : public XMLHint_Impl\n{\n    OUString                 sHRef;\n    OUString                 sName;\n    OUString                 sTargetFrameName;\n    OUString                 sStyleName;\n    OUString                 sVisitedStyleName;\n    XMLEventsImportContext*  pEvents;\n\npublic:\n\n    XMLHyperlinkHint_Impl( const Reference < XTextRange > & rPos ) :\n        XMLHint_Impl( XML_HINT_HYPERLINK, rPos, rPos ),\n        pEvents( NULL )\n    {\n    }\n\n    virtual ~XMLHyperlinkHint_Impl()\n    {\n        if (NULL != pEvents)\n            pEvents->ReleaseRef();\n    }\n\n    void SetHRef( const OUString& s ) { sHRef = s; }\n    const OUString& GetHRef() const { return sHRef; }\n    void SetName( const OUString& s ) { sName = s; }\n    const OUString& GetName() const { return sName; }\n    void SetTargetFrameName( const OUString& s ) { sTargetFrameName = s; }\n    const OUString& GetTargetFrameName() const { return sTargetFrameName; }\n    void SetStyleName( const OUString& s ) { sStyleName = s; }\n    const OUString& GetStyleName() const { return sStyleName; }\n    void SetVisitedStyleName( const OUString& s ) { sVisitedStyleName = s; }\n    const OUString& GetVisitedStyleName() const { return sVisitedStyleName; }\n    XMLEventsImportContext* GetEventsContext() const;\n    void SetEventsContext( XMLEventsImportContext* pCtxt );\n};\n\nXMLEventsImportContext* XMLHyperlinkHint_Impl::GetEventsContext() const\n{\n    return pEvents;\n}\n\nvoid XMLHyperlinkHint_Impl::SetEventsContext( XMLEventsImportContext* pCtxt )\n{\n    pEvents = pCtxt;\n    if (pEvents != NULL)\n        pEvents->AddRef();\n}\n\n\nclass XMLIndexMarkHint_Impl : public XMLHint_Impl\n{\n    const Reference<beans::XPropertySet> xIndexMarkPropSet;\n\n    const OUString sID;\n\npublic:\n\n    XMLIndexMarkHint_Impl( const Reference < beans::XPropertySet > & rPropSet,\n                           const Reference < XTextRange > & rPos ) :\n        XMLHint_Impl( XML_HINT_INDEX_MARK, rPos, rPos ),\n        xIndexMarkPropSet( rPropSet ),\n        sID()\n    {\n    }\n\n    XMLIndexMarkHint_Impl( const Reference < beans::XPropertySet > & rPropSet,\n                           const Reference < XTextRange > & rPos,\n                           OUString sIDString) :\n        XMLHint_Impl( XML_HINT_INDEX_MARK, rPos, rPos ),\n        xIndexMarkPropSet( rPropSet ),\n        sID(sIDString)\n    {\n    }\n\n    virtual ~XMLIndexMarkHint_Impl() {}\n\n    const Reference<beans::XPropertySet> & GetMark() const\n        { return xIndexMarkPropSet; }\n    const OUString& GetID() const { return sID; }\n};\n\nclass XMLRubyHint_Impl : public XMLHint_Impl\n{\n    OUString                 sStyleName;\n    OUString                 sTextStyleName;\n    OUString                 sText;\n\npublic:\n\n    XMLRubyHint_Impl( const Reference < XTextRange > & rPos ) :\n        XMLHint_Impl( XML_HINT_RUBY, rPos, rPos )\n    {\n    }\n\n    virtual ~XMLRubyHint_Impl() {}\n\n    void SetStyleName( const OUString& s ) { sStyleName = s; }\n    const OUString& GetStyleName() const { return sStyleName; }\n    void SetTextStyleName( const OUString& s ) { sTextStyleName = s; }\n    const OUString& GetTextStyleName() const { return sTextStyleName; }\n    void AppendText( const OUString& s ) { sText += s; }\n    const OUString& GetText() const { return sText; }\n};\n\nclass XMLTextFrameHint_Impl : public XMLHint_Impl\n{\n    \/\/ OD 2004-04-20 #i26791#\n    SvXMLImportContextRef xContext;\n\npublic:\n\n    XMLTextFrameHint_Impl( SvXMLImportContext* pContext,\n                           const Reference < XTextRange > & rPos ) :\n        XMLHint_Impl( XML_HINT_TEXT_FRAME, rPos, rPos ),\n        xContext( pContext )\n    {\n    }\n\n    virtual ~XMLTextFrameHint_Impl()\n    {\n    }\n\n    Reference < XTextContent > GetTextContent() const\n    {\n        Reference <XTextContent > xTxt;\n        SvXMLImportContext *pContext = &xContext;\n        if( pContext->ISA( XMLTextFrameContext ) )\n            xTxt = PTR_CAST( XMLTextFrameContext, pContext )->GetTextContent();\n        else if( pContext->ISA( XMLTextFrameHyperlinkContext ) )\n            xTxt = PTR_CAST( XMLTextFrameHyperlinkContext, pContext )\n                        ->GetTextContent();\n\n        return xTxt;\n    }\n\n    sal_Bool IsBoundAtChar() const\n    {\n        sal_Bool bRet = sal_False;\n        SvXMLImportContext *pContext = &xContext;\n        if( pContext->ISA( XMLTextFrameContext ) )\n            bRet = TextContentAnchorType_AT_CHARACTER ==\n                PTR_CAST( XMLTextFrameContext, pContext )\n                    ->GetAnchorType();\n        else if( pContext->ISA( XMLTextFrameHyperlinkContext ) )\n            bRet = TextContentAnchorType_AT_CHARACTER ==\n                PTR_CAST( XMLTextFrameHyperlinkContext, pContext )\n                    ->GetAnchorType();\n        return bRet;\n    }\n};\n\n\/\/ --> DVO, OD 2004-07-14 #i26791#\nclass XMLDrawHint_Impl : public XMLHint_Impl\n{\n    SvXMLImportContextRef xContext;\n\npublic:\n\n    XMLDrawHint_Impl( SvXMLShapeContext* pContext,\n                      const Reference < XTextRange > & rPos ) :\n        XMLHint_Impl( XML_HINT_DRAW, rPos, rPos ),\n        xContext( pContext )\n    {\n    }\n\n    virtual ~XMLDrawHint_Impl()\n    {\n    }\n\n    SvXMLShapeContext* GetShapeContext() const\n    {\n    return static_cast<SvXMLShapeContext*>(&xContext);\n    }\n};\n\/\/ <--\n#endif\n<commit_msg>#i10000# GetEventsContext and SetEventsContext<commit_after>\/*************************************************************************\n *\n *  $RCSfile: txtparaimphint.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: rt $ $Date: 2004-07-14 14:03: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#ifndef _XMLOFF_TXTPARAIMPHINT_HXX\n#define _XMLOFF_TXTPARAIMPHINT_HXX\n\n#ifndef _RTL_USTRING_HXX_\n#include <rtl\/ustring.hxx>\n#endif\n#ifndef _RTL_USTRBUF_HXX_\n#include <rtl\/ustrbuf.hxx>\n#endif\n\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n\n#ifndef _SVARRAY_HXX\n#include <svtools\/svarray.hxx>\n#endif\n\n#ifndef _XMLOFF_XMLIMP_HXX\n#include \"xmlimp.hxx\"\n#endif\n#ifndef _XMLTEXTFRAMECONTEXT_HXX\n#include \"XMLTextFrameContext.hxx\"\n#endif\n#ifndef _XMLOFF_XMLEVENTSIMPORTCONTEXT_HXX\n#include \"XMLEventsImportContext.hxx\"\n#endif\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::text;\nusing namespace ::xmloff::token;\n\n\/\/ ---------------------------------------------------------------------\n\n#define XML_HINT_STYLE 1\n#define XML_HINT_REFERENCE 2\n#define XML_HINT_HYPERLINK 3\n#define XML_HINT_RUBY 4\n#define XML_HINT_INDEX_MARK 5\n#define XML_HINT_TEXT_FRAME 6\n\/\/ --> DVO, OD 2004-07-14 #i26791#\n#define XML_HINT_DRAW 7\n\/\/ <--\n\nclass XMLHint_Impl\n{\n    Reference < XTextRange > xStart;\n    Reference < XTextRange > xEnd;\n\n    sal_uInt8 nType;\n\npublic:\n\n    XMLHint_Impl( sal_uInt8 nTyp,\n                  const Reference < XTextRange > & rS,\n                  const Reference < XTextRange > & rE ) :\n        nType( nTyp ),\n        xStart( rS ),\n        xEnd( rE )\n    {\n    }\n\n    XMLHint_Impl( sal_uInt8 nTyp,\n                  const Reference < XTextRange > & rS ) :\n        nType( nTyp ),\n        xStart( rS )\n    {\n    }\n\n    virtual ~XMLHint_Impl() {}\n\n    const Reference < XTextRange > & GetStart() const { return xStart; }\n    const Reference < XTextRange > & GetEnd() const { return xEnd; }\n    void SetEnd( const Reference < XTextRange > & rPos ) { xEnd = rPos; }\n\n    \/\/ We don't use virtual methods to differ between the sub classes,\n    \/\/ because this seems to be to expensive if compared to inline methods.\n    sal_uInt8 GetType() const { return nType; }\n    sal_Bool IsStyle() { return XML_HINT_STYLE==nType; }\n    sal_Bool IsReference() { return XML_HINT_REFERENCE==nType; }\n    sal_Bool IsHyperlink() { return XML_HINT_HYPERLINK==nType; }\n    sal_Bool IsIndexMark() { return XML_HINT_INDEX_MARK==nType; }\n};\n\nclass XMLStyleHint_Impl : public XMLHint_Impl\n{\n    OUString                 sStyleName;\n\npublic:\n\n    XMLStyleHint_Impl( const OUString& rStyleName,\n                         const Reference < XTextRange > & rPos ) :\n        XMLHint_Impl( XML_HINT_STYLE, rPos, rPos ),\n        sStyleName( rStyleName )\n    {\n    }\n    virtual ~XMLStyleHint_Impl() {}\n\n    const OUString& GetStyleName() const { return sStyleName; }\n};\n\nclass XMLReferenceHint_Impl : public XMLHint_Impl\n{\n    OUString                 sRefName;\n\npublic:\n\n    XMLReferenceHint_Impl( const OUString& rRefName,\n                             const Reference < XTextRange > & rPos ) :\n        XMLHint_Impl( XML_HINT_REFERENCE, rPos, rPos ),\n        sRefName( rRefName )\n    {\n    }\n\n    virtual ~XMLReferenceHint_Impl() {}\n\n    const OUString& GetRefName() const { return sRefName; }\n};\n\nclass XMLHyperlinkHint_Impl : public XMLHint_Impl\n{\n    OUString                 sHRef;\n    OUString                 sName;\n    OUString                 sTargetFrameName;\n    OUString                 sStyleName;\n    OUString                 sVisitedStyleName;\n    XMLEventsImportContext*  pEvents;\n\npublic:\n\n    XMLHyperlinkHint_Impl( const Reference < XTextRange > & rPos ) :\n        XMLHint_Impl( XML_HINT_HYPERLINK, rPos, rPos ),\n        pEvents( NULL )\n    {\n    }\n\n    virtual ~XMLHyperlinkHint_Impl()\n    {\n        if (NULL != pEvents)\n            pEvents->ReleaseRef();\n    }\n\n    void SetHRef( const OUString& s ) { sHRef = s; }\n    const OUString& GetHRef() const { return sHRef; }\n    void SetName( const OUString& s ) { sName = s; }\n    const OUString& GetName() const { return sName; }\n    void SetTargetFrameName( const OUString& s ) { sTargetFrameName = s; }\n    const OUString& GetTargetFrameName() const { return sTargetFrameName; }\n    void SetStyleName( const OUString& s ) { sStyleName = s; }\n    const OUString& GetStyleName() const { return sStyleName; }\n    void SetVisitedStyleName( const OUString& s ) { sVisitedStyleName = s; }\n    const OUString& GetVisitedStyleName() const { return sVisitedStyleName; }\n    XMLEventsImportContext* GetEventsContext() const\n    {\n        return pEvents;\n    }\n    void SetEventsContext( XMLEventsImportContext* pCtxt )\n    {\n        pEvents = pCtxt;\n        if (pEvents != NULL)\n            pEvents->AddRef();\n    }\n};\n\n\nclass XMLIndexMarkHint_Impl : public XMLHint_Impl\n{\n    const Reference<beans::XPropertySet> xIndexMarkPropSet;\n\n    const OUString sID;\n\npublic:\n\n    XMLIndexMarkHint_Impl( const Reference < beans::XPropertySet > & rPropSet,\n                           const Reference < XTextRange > & rPos ) :\n        XMLHint_Impl( XML_HINT_INDEX_MARK, rPos, rPos ),\n        xIndexMarkPropSet( rPropSet ),\n        sID()\n    {\n    }\n\n    XMLIndexMarkHint_Impl( const Reference < beans::XPropertySet > & rPropSet,\n                           const Reference < XTextRange > & rPos,\n                           OUString sIDString) :\n        XMLHint_Impl( XML_HINT_INDEX_MARK, rPos, rPos ),\n        xIndexMarkPropSet( rPropSet ),\n        sID(sIDString)\n    {\n    }\n\n    virtual ~XMLIndexMarkHint_Impl() {}\n\n    const Reference<beans::XPropertySet> & GetMark() const\n        { return xIndexMarkPropSet; }\n    const OUString& GetID() const { return sID; }\n};\n\nclass XMLRubyHint_Impl : public XMLHint_Impl\n{\n    OUString                 sStyleName;\n    OUString                 sTextStyleName;\n    OUString                 sText;\n\npublic:\n\n    XMLRubyHint_Impl( const Reference < XTextRange > & rPos ) :\n        XMLHint_Impl( XML_HINT_RUBY, rPos, rPos )\n    {\n    }\n\n    virtual ~XMLRubyHint_Impl() {}\n\n    void SetStyleName( const OUString& s ) { sStyleName = s; }\n    const OUString& GetStyleName() const { return sStyleName; }\n    void SetTextStyleName( const OUString& s ) { sTextStyleName = s; }\n    const OUString& GetTextStyleName() const { return sTextStyleName; }\n    void AppendText( const OUString& s ) { sText += s; }\n    const OUString& GetText() const { return sText; }\n};\n\nclass XMLTextFrameHint_Impl : public XMLHint_Impl\n{\n    \/\/ OD 2004-04-20 #i26791#\n    SvXMLImportContextRef xContext;\n\npublic:\n\n    XMLTextFrameHint_Impl( SvXMLImportContext* pContext,\n                           const Reference < XTextRange > & rPos ) :\n        XMLHint_Impl( XML_HINT_TEXT_FRAME, rPos, rPos ),\n        xContext( pContext )\n    {\n    }\n\n    virtual ~XMLTextFrameHint_Impl()\n    {\n    }\n\n    Reference < XTextContent > GetTextContent() const\n    {\n        Reference <XTextContent > xTxt;\n        SvXMLImportContext *pContext = &xContext;\n        if( pContext->ISA( XMLTextFrameContext ) )\n            xTxt = PTR_CAST( XMLTextFrameContext, pContext )->GetTextContent();\n        else if( pContext->ISA( XMLTextFrameHyperlinkContext ) )\n            xTxt = PTR_CAST( XMLTextFrameHyperlinkContext, pContext )\n                        ->GetTextContent();\n\n        return xTxt;\n    }\n\n    sal_Bool IsBoundAtChar() const\n    {\n        sal_Bool bRet = sal_False;\n        SvXMLImportContext *pContext = &xContext;\n        if( pContext->ISA( XMLTextFrameContext ) )\n            bRet = TextContentAnchorType_AT_CHARACTER ==\n                PTR_CAST( XMLTextFrameContext, pContext )\n                    ->GetAnchorType();\n        else if( pContext->ISA( XMLTextFrameHyperlinkContext ) )\n            bRet = TextContentAnchorType_AT_CHARACTER ==\n                PTR_CAST( XMLTextFrameHyperlinkContext, pContext )\n                    ->GetAnchorType();\n        return bRet;\n    }\n};\n\n\/\/ --> DVO, OD 2004-07-14 #i26791#\nclass XMLDrawHint_Impl : public XMLHint_Impl\n{\n    SvXMLImportContextRef xContext;\n\npublic:\n\n    XMLDrawHint_Impl( SvXMLShapeContext* pContext,\n                      const Reference < XTextRange > & rPos ) :\n        XMLHint_Impl( XML_HINT_DRAW, rPos, rPos ),\n        xContext( pContext )\n    {\n    }\n\n    virtual ~XMLDrawHint_Impl()\n    {\n    }\n\n    SvXMLShapeContext* GetShapeContext() const\n    {\n    return static_cast<SvXMLShapeContext*>(&xContext);\n    }\n};\n\/\/ <--\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *  Copyright (C) 2006, 2007, 2008, 2009 Stephen F. Booth <me@sbooth.org>\n *  All Rights Reserved.\n *\n *  Redistribution and use in source and binary forms, with or without\n *  modification, are permitted provided that the following conditions are\n *  met:\n *\n *    - Redistributions of source code must retain the above copyright\n *      notice, this list of conditions and the following disclaimer.\n *    - Redistributions in binary form must reproduce the above copyright\n *      notice, this list of conditions and the following disclaimer in the\n *      documentation and\/or other materials provided with the distribution.\n *    - Neither the name of Stephen F. Booth 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\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 \"LoopableRegionDecoder.h\"\n#include \"AudioDecoder.h\"\n\n#include <algorithm>\n\n\nLoopableRegionDecoder::LoopableRegionDecoder(AudioDecoder *decoder, SInt64 startingFrame)\n\t: mDecoder(decoder), mStartingFrame(startingFrame), mFrameCount(0), mRepeatCount(0), mFramesReadInCurrentPass(0), mTotalFramesRead(0), mCompletedPasses(0)\n{\n\tassert(NULL != decoder);\n\t\n\tmFormat\t\t\t= mDecoder->GetFormat();\n\tmChannelLayout\t= mDecoder->GetChannelLayout();\n\tmSourceFormat\t= mDecoder->GetSourceFormat();\n\t\n\tmFrameCount\t\t= static_cast<UInt32>(mDecoder->GetTotalFrames() - mStartingFrame);\n\t\n\tif(0 != mStartingFrame)\n\t\tReset();\n}\n\nLoopableRegionDecoder::LoopableRegionDecoder(AudioDecoder *decoder, SInt64 startingFrame, UInt32 frameCount)\n\t: mDecoder(decoder), mStartingFrame(startingFrame), mFrameCount(frameCount), mRepeatCount(0), mFramesReadInCurrentPass(0), mTotalFramesRead(0), mCompletedPasses(0)\n{\n\tassert(NULL != decoder);\n\n\tmFormat\t\t\t= mDecoder->GetFormat();\n\tmChannelLayout\t= mDecoder->GetChannelLayout();\n\tmSourceFormat\t= mDecoder->GetSourceFormat();\n\t\n\tif(0 != mStartingFrame)\n\t\tReset();\n}\n\nLoopableRegionDecoder::LoopableRegionDecoder(AudioDecoder *decoder, SInt64 startingFrame, UInt32 frameCount, UInt32 repeatCount)\n\t: mDecoder(decoder), mStartingFrame(startingFrame), mFrameCount(frameCount), mRepeatCount(repeatCount), mFramesReadInCurrentPass(0), mTotalFramesRead(0), mCompletedPasses(0)\n{\n\tassert(NULL != decoder);\n\t\n\tmFormat\t\t\t= mDecoder->GetFormat();\n\tmChannelLayout\t= mDecoder->GetChannelLayout();\n\tmSourceFormat\t= mDecoder->GetSourceFormat();\n\t\n\tif(0 != mStartingFrame)\n\t\tReset();\n}\n\nLoopableRegionDecoder::~LoopableRegionDecoder()\n{\n\tif(mDecoder)\n\t\tdelete mDecoder, mDecoder = NULL;\n}\n\nvoid LoopableRegionDecoder::Reset()\n{\n\tmDecoder->SeekToFrame(mStartingFrame);\n\t\n\tmFramesReadInCurrentPass\t= 0;\n\tmTotalFramesRead\t\t\t= 0;\n\tmCompletedPasses\t\t\t\t= 0;\n}\n\n#pragma mark Decoding\n\nUInt32 LoopableRegionDecoder::ReadAudio(AudioBufferList *bufferList, UInt32 frameCount)\n{\n\tassert(NULL != bufferList);\n\tassert(0 < frameCount);\n\t\n\t\/\/ If the repeat count is N then (N + 1) passes must be completed to read all the frames\n\tif((1 + mRepeatCount) == mCompletedPasses)\n\t\treturn 0;\n\n\tUInt32 framesRemaining = frameCount;\n\tUInt32 totalFramesRead = 0;\n\t\n\twhile(0 < framesRemaining) {\n\t\tUInt32 framesRemainingInCurrentPass\t= static_cast<UInt32>(mStartingFrame + mFrameCount - mDecoder->GetCurrentFrame());\n\t\tUInt32 framesToRead\t\t\t\t\t= std::min(framesRemaining, framesRemainingInCurrentPass);\n\t\t\n\t\t\/\/ Nothing left to read\n\t\tif(0 == framesToRead)\n\t\t\tbreak;\n\t\t\n\t\tUInt32 framesRead = mDecoder->ReadAudio(bufferList, framesToRead);\n\t\t\n\t\t\/\/ A read error occurred\n\t\tif(0 == framesRead)\n\t\t\tbreak;\n\n\t\t\/\/ Housekeeping\n\t\tmFramesReadInCurrentPass\t+= framesRead;\n\t\tmTotalFramesRead\t\t\t+= framesRead;\n\t\t\n\t\ttotalFramesRead\t\t\t\t+= framesRead;\n\t\tframesRemaining\t\t\t\t-= framesRead;\n\n\t\t\/\/ If this pass is finished, seek to the beginning of the region in preparation for the next read\n\t\tif(mFrameCount == mFramesReadInCurrentPass) {\n\t\t\t++mCompletedPasses;\n\t\t\tmFramesReadInCurrentPass = 0;\n\t\t\t\n\t\t\t\/\/ Only seek to the beginning of the region if more passes remain\n\t\t\tif(mRepeatCount >= mCompletedPasses)\n\t\t\t\tmDecoder->SeekToFrame(mStartingFrame);\n\t\t}\n\t}\n\t\n\treturn totalFramesRead;\n}\n\nSInt64 LoopableRegionDecoder::SeekToFrame(SInt64 frame)\n{\n\tassert(0 <= frame);\n\tassert(frame < GetTotalFrames());\n\t\n\tmCompletedPasses\t\t\t\t= static_cast<UInt32>(frame \/ mFrameCount);\n\tmFramesReadInCurrentPass\t= static_cast<UInt32>(frame % mFrameCount);\n\tmTotalFramesRead\t\t\t= frame;\n\t\n\tmDecoder->SeekToFrame(mStartingFrame + mFramesReadInCurrentPass);\n\t\n\treturn GetCurrentFrame();\n}\n<commit_msg>Ensure decoder is seekable<commit_after>\/*\n *  Copyright (C) 2006, 2007, 2008, 2009 Stephen F. Booth <me@sbooth.org>\n *  All Rights Reserved.\n *\n *  Redistribution and use in source and binary forms, with or without\n *  modification, are permitted provided that the following conditions are\n *  met:\n *\n *    - Redistributions of source code must retain the above copyright\n *      notice, this list of conditions and the following disclaimer.\n *    - Redistributions in binary form must reproduce the above copyright\n *      notice, this list of conditions and the following disclaimer in the\n *      documentation and\/or other materials provided with the distribution.\n *    - Neither the name of Stephen F. Booth 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\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 \"LoopableRegionDecoder.h\"\n#include \"AudioDecoder.h\"\n\n#include <algorithm>\n\n\nLoopableRegionDecoder::LoopableRegionDecoder(AudioDecoder *decoder, SInt64 startingFrame)\n\t: mDecoder(decoder), mStartingFrame(startingFrame), mFrameCount(0), mRepeatCount(0), mFramesReadInCurrentPass(0), mTotalFramesRead(0), mCompletedPasses(0)\n{\n\tassert(NULL != decoder);\n\tassert(decoder->SupportsSeeking());\n\t\n\tmFormat\t\t\t= mDecoder->GetFormat();\n\tmChannelLayout\t= mDecoder->GetChannelLayout();\n\tmSourceFormat\t= mDecoder->GetSourceFormat();\n\t\n\tmFrameCount\t\t= static_cast<UInt32>(mDecoder->GetTotalFrames() - mStartingFrame);\n\t\n\tif(0 != mStartingFrame)\n\t\tReset();\n}\n\nLoopableRegionDecoder::LoopableRegionDecoder(AudioDecoder *decoder, SInt64 startingFrame, UInt32 frameCount)\n\t: mDecoder(decoder), mStartingFrame(startingFrame), mFrameCount(frameCount), mRepeatCount(0), mFramesReadInCurrentPass(0), mTotalFramesRead(0), mCompletedPasses(0)\n{\n\tassert(NULL != decoder);\n\tassert(decoder->SupportsSeeking());\n\n\tmFormat\t\t\t= mDecoder->GetFormat();\n\tmChannelLayout\t= mDecoder->GetChannelLayout();\n\tmSourceFormat\t= mDecoder->GetSourceFormat();\n\t\n\tif(0 != mStartingFrame)\n\t\tReset();\n}\n\nLoopableRegionDecoder::LoopableRegionDecoder(AudioDecoder *decoder, SInt64 startingFrame, UInt32 frameCount, UInt32 repeatCount)\n\t: mDecoder(decoder), mStartingFrame(startingFrame), mFrameCount(frameCount), mRepeatCount(repeatCount), mFramesReadInCurrentPass(0), mTotalFramesRead(0), mCompletedPasses(0)\n{\n\tassert(NULL != decoder);\n\tassert(decoder->SupportsSeeking());\n\t\n\tmFormat\t\t\t= mDecoder->GetFormat();\n\tmChannelLayout\t= mDecoder->GetChannelLayout();\n\tmSourceFormat\t= mDecoder->GetSourceFormat();\n\t\n\tif(0 != mStartingFrame)\n\t\tReset();\n}\n\nLoopableRegionDecoder::~LoopableRegionDecoder()\n{\n\tif(mDecoder)\n\t\tdelete mDecoder, mDecoder = NULL;\n}\n\nvoid LoopableRegionDecoder::Reset()\n{\n\tmDecoder->SeekToFrame(mStartingFrame);\n\t\n\tmFramesReadInCurrentPass\t= 0;\n\tmTotalFramesRead\t\t\t= 0;\n\tmCompletedPasses\t\t\t= 0;\n}\n\n#pragma mark Decoding\n\nUInt32 LoopableRegionDecoder::ReadAudio(AudioBufferList *bufferList, UInt32 frameCount)\n{\n\tassert(NULL != bufferList);\n\tassert(0 < frameCount);\n\t\n\t\/\/ If the repeat count is N then (N + 1) passes must be completed to read all the frames\n\tif((1 + mRepeatCount) == mCompletedPasses)\n\t\treturn 0;\n\n\tUInt32 framesRemaining = frameCount;\n\tUInt32 totalFramesRead = 0;\n\t\n\twhile(0 < framesRemaining) {\n\t\tUInt32 framesRemainingInCurrentPass\t= static_cast<UInt32>(mStartingFrame + mFrameCount - mDecoder->GetCurrentFrame());\n\t\tUInt32 framesToRead\t\t\t\t\t= std::min(framesRemaining, framesRemainingInCurrentPass);\n\t\t\n\t\t\/\/ Nothing left to read\n\t\tif(0 == framesToRead)\n\t\t\tbreak;\n\t\t\n\t\tUInt32 framesRead = mDecoder->ReadAudio(bufferList, framesToRead);\n\t\t\n\t\t\/\/ A read error occurred\n\t\tif(0 == framesRead)\n\t\t\tbreak;\n\n\t\t\/\/ Housekeeping\n\t\tmFramesReadInCurrentPass\t+= framesRead;\n\t\tmTotalFramesRead\t\t\t+= framesRead;\n\t\t\n\t\ttotalFramesRead\t\t\t\t+= framesRead;\n\t\tframesRemaining\t\t\t\t-= framesRead;\n\n\t\t\/\/ If this pass is finished, seek to the beginning of the region in preparation for the next read\n\t\tif(mFrameCount == mFramesReadInCurrentPass) {\n\t\t\t++mCompletedPasses;\n\t\t\tmFramesReadInCurrentPass = 0;\n\t\t\t\n\t\t\t\/\/ Only seek to the beginning of the region if more passes remain\n\t\t\tif(mRepeatCount >= mCompletedPasses)\n\t\t\t\tmDecoder->SeekToFrame(mStartingFrame);\n\t\t}\n\t}\n\t\n\treturn totalFramesRead;\n}\n\nSInt64 LoopableRegionDecoder::SeekToFrame(SInt64 frame)\n{\n\tassert(0 <= frame);\n\tassert(frame < GetTotalFrames());\n\t\n\tmCompletedPasses\t\t\t= static_cast<UInt32>(frame \/ mFrameCount);\n\tmFramesReadInCurrentPass\t= static_cast<UInt32>(frame % mFrameCount);\n\tmTotalFramesRead\t\t\t= frame;\n\t\n\tmDecoder->SeekToFrame(mStartingFrame + mFramesReadInCurrentPass);\n\t\n\treturn GetCurrentFrame();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2015 ScyllaDB\n *\/\n\n\/*\n * This file is part of Scylla.\n *\n * Scylla is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * Scylla is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with Scylla.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#pragma once\n\n#include <boost\/range\/adaptor\/transformed.hpp>\n\n#include \"query-request.hh\"\n#include \"query-result.hh\"\n#include \"utils\/data_input.hh\"\n#include \"digest_algorithm.hh\"\n\n#include \"idl\/uuid.dist.hh\"\n#include \"idl\/keys.dist.hh\"\n#include \"idl\/query.dist.hh\"\n#include \"serializer_impl.hh\"\n#include \"serialization_visitors.hh\"\n#include \"idl\/query.dist.impl.hh\"\n#include \"idl\/keys.dist.impl.hh\"\n#include \"idl\/uuid.dist.impl.hh\"\n\nnamespace query {\n\nclass result_atomic_cell_view {\n    api::timestamp_type _timestamp;\n    expiry_opt _expiry;\n    ttl_opt _ttl;\n    bytes_view _value;\npublic:\n    result_atomic_cell_view(api::timestamp_type timestamp, expiry_opt expiry, ttl_opt ttl, bytes_view value)\n        : _timestamp(timestamp), _expiry(expiry), _ttl(ttl), _value(value) { }\n\n    api::timestamp_type timestamp() const {\n        return _timestamp;\n    }\n\n    expiry_opt expiry() const {\n        return _expiry;\n    }\n\n    ttl_opt ttl() const {\n        return _ttl;\n    }\n\n    bytes_view value() const {\n        return _value;\n    }\n};\n\n\/\/ Contains cells in the same order as requested by partition_slice.\n\/\/ Contains only live cells.\nclass result_row_view {\n    ser::qr_row_view _v;\npublic:\n    result_row_view(ser::qr_row_view v) : _v(v) {}\n\n    class iterator_type {\n        using cells_vec = std::vector<std::experimental::optional<ser::qr_cell_view>>;\n        cells_vec _cells;\n        cells_vec::iterator _i;\n        bytes _tmp_value;\n    public:\n        iterator_type(ser::qr_row_view v)\n            : _cells(v.cells())\n            , _i(_cells.begin())\n        { }\n        std::experimental::optional<result_atomic_cell_view> next_atomic_cell() {\n            auto cell_opt = *_i++;\n            if (!cell_opt) {\n                return {};\n            }\n            ser::qr_cell_view v = *cell_opt;\n            api::timestamp_type timestamp = v.timestamp().value_or(api::missing_timestamp);\n            expiry_opt expiry = v.expiry();\n            ttl_opt ttl = v.ttl();\n            _tmp_value = v.value();\n            return {result_atomic_cell_view(timestamp, expiry, ttl, _tmp_value)};\n        }\n        std::experimental::optional<bytes_view> next_collection_cell() {\n            auto cell_opt = *_i++;\n            if (!cell_opt) {\n                return {};\n            }\n            ser::qr_cell_view v = *cell_opt;\n            _tmp_value = v.value();\n            return {bytes_view(_tmp_value)};\n        };\n        void skip(const column_definition& def) {\n            ++_i;\n        }\n    };\n\n    iterator_type iterator() const {\n        return iterator_type(_v);\n    }\n};\n\n\/\/ Describes expectations about the ResultVisitor concept.\n\/\/\n\/\/ Interaction flow:\n\/\/   -> accept_new_partition()\n\/\/   -> accept_new_row()\n\/\/   -> accept_new_row()\n\/\/   -> accept_partition_end()\n\/\/   -> accept_new_partition()\n\/\/   -> accept_new_row()\n\/\/   -> accept_new_row()\n\/\/   -> accept_new_row()\n\/\/   -> accept_partition_end()\n\/\/   ...\n\/\/\nstruct result_visitor {\n    void accept_new_partition(\n        const partition_key& key, \/\/ FIXME: use view for the key\n        uint32_t row_count) {}\n\n    void accept_new_partition(uint32_t row_count) {}\n\n    void accept_new_row(\n        const clustering_key& key, \/\/ FIXME: use view for the key\n        const result_row_view& static_row,\n        const result_row_view& row) {}\n\n    void accept_new_row(const result_row_view& static_row, const result_row_view& row) {}\n\n    void accept_partition_end(const result_row_view& static_row) {}\n};\n\nclass result_view {\n    ser::query_result_view _v;\n    friend class result_merger;\npublic:\n    result_view(const bytes_ostream& v) : _v(ser::query_result_view{ser::as_input_stream(v)}) {}\n    result_view(ser::query_result_view v) : _v(v) {}\n\n    template <typename Func>\n    static auto do_with(const query::result& res, Func&& func) {\n        result_view view(res.buf());\n        return func(view);\n    }\n\n    template <typename ResultVisitor>\n    static void consume(const query::result& res, const partition_slice& slice, ResultVisitor&& visitor) {\n        do_with(res, [&] (result_view v) {\n            v.consume(slice, visitor);\n        });\n    }\n\n    template <typename ResultVisitor>\n    void consume(const partition_slice& slice, ResultVisitor&& visitor) {\n        for (auto&& p : _v.partitions()) {\n            auto rows = p.rows();\n            auto row_count = rows.size();\n            if (slice.options.contains<partition_slice::option::send_partition_key>()) {\n                auto key = *p.key();\n                visitor.accept_new_partition(key, row_count);\n            } else {\n                visitor.accept_new_partition(row_count);\n            }\n\n            result_row_view static_row(p.static_row());\n\n            for (auto&& row : rows) {\n                result_row_view view(row.cells());\n                if (slice.options.contains<partition_slice::option::send_clustering_key>()) {\n                    visitor.accept_new_row(*row.key(), static_row, view);\n                } else {\n                    visitor.accept_new_row(static_row, view);\n                }\n            }\n\n            visitor.accept_partition_end(static_row);\n        }\n    }\n\n    std::tuple<uint32_t, uint32_t> count_partitions_and_rows() {\n        auto&& ps = _v.partitions();\n        auto rows = boost::accumulate(ps | boost::adaptors::transformed([] (auto& p) {\n            return std::max(p.rows().size(), size_t(1));\n        }), uint32_t(0));\n        return std::make_tuple(ps.size(), rows);\n    }\n};\n\n}\n<commit_msg>query::result_view: add concept<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\/adaptor\/transformed.hpp>\n\n#include \"query-request.hh\"\n#include \"query-result.hh\"\n#include \"utils\/data_input.hh\"\n#include \"digest_algorithm.hh\"\n\n#include \"idl\/uuid.dist.hh\"\n#include \"idl\/keys.dist.hh\"\n#include \"idl\/query.dist.hh\"\n#include \"serializer_impl.hh\"\n#include \"serialization_visitors.hh\"\n#include \"idl\/query.dist.impl.hh\"\n#include \"idl\/keys.dist.impl.hh\"\n#include \"idl\/uuid.dist.impl.hh\"\n\nnamespace query {\n\nclass result_atomic_cell_view {\n    api::timestamp_type _timestamp;\n    expiry_opt _expiry;\n    ttl_opt _ttl;\n    bytes_view _value;\npublic:\n    result_atomic_cell_view(api::timestamp_type timestamp, expiry_opt expiry, ttl_opt ttl, bytes_view value)\n        : _timestamp(timestamp), _expiry(expiry), _ttl(ttl), _value(value) { }\n\n    api::timestamp_type timestamp() const {\n        return _timestamp;\n    }\n\n    expiry_opt expiry() const {\n        return _expiry;\n    }\n\n    ttl_opt ttl() const {\n        return _ttl;\n    }\n\n    bytes_view value() const {\n        return _value;\n    }\n};\n\n\/\/ Contains cells in the same order as requested by partition_slice.\n\/\/ Contains only live cells.\nclass result_row_view {\n    ser::qr_row_view _v;\npublic:\n    result_row_view(ser::qr_row_view v) : _v(v) {}\n\n    class iterator_type {\n        using cells_vec = std::vector<std::experimental::optional<ser::qr_cell_view>>;\n        cells_vec _cells;\n        cells_vec::iterator _i;\n        bytes _tmp_value;\n    public:\n        iterator_type(ser::qr_row_view v)\n            : _cells(v.cells())\n            , _i(_cells.begin())\n        { }\n        std::experimental::optional<result_atomic_cell_view> next_atomic_cell() {\n            auto cell_opt = *_i++;\n            if (!cell_opt) {\n                return {};\n            }\n            ser::qr_cell_view v = *cell_opt;\n            api::timestamp_type timestamp = v.timestamp().value_or(api::missing_timestamp);\n            expiry_opt expiry = v.expiry();\n            ttl_opt ttl = v.ttl();\n            _tmp_value = v.value();\n            return {result_atomic_cell_view(timestamp, expiry, ttl, _tmp_value)};\n        }\n        std::experimental::optional<bytes_view> next_collection_cell() {\n            auto cell_opt = *_i++;\n            if (!cell_opt) {\n                return {};\n            }\n            ser::qr_cell_view v = *cell_opt;\n            _tmp_value = v.value();\n            return {bytes_view(_tmp_value)};\n        };\n        void skip(const column_definition& def) {\n            ++_i;\n        }\n    };\n\n    iterator_type iterator() const {\n        return iterator_type(_v);\n    }\n};\n\n\/\/ Describes expectations about the ResultVisitor concept.\n\/\/\n\/\/ Interaction flow:\n\/\/   -> accept_new_partition()\n\/\/   -> accept_new_row()\n\/\/   -> accept_new_row()\n\/\/   -> accept_partition_end()\n\/\/   -> accept_new_partition()\n\/\/   -> accept_new_row()\n\/\/   -> accept_new_row()\n\/\/   -> accept_new_row()\n\/\/   -> accept_partition_end()\n\/\/   ...\n\/\/\nstruct result_visitor {\n    void accept_new_partition(\n        const partition_key& key, \/\/ FIXME: use view for the key\n        uint32_t row_count) {}\n\n    void accept_new_partition(uint32_t row_count) {}\n\n    void accept_new_row(\n        const clustering_key& key, \/\/ FIXME: use view for the key\n        const result_row_view& static_row,\n        const result_row_view& row) {}\n\n    void accept_new_row(const result_row_view& static_row, const result_row_view& row) {}\n\n    void accept_partition_end(const result_row_view& static_row) {}\n};\n\nGCC6_CONCEPT(\ntemplate<typename Visitor>\nconcept bool ResultVisitor = requires(Visitor visitor, const partition_key& pkey,\n                                      uint32_t row_count, const clustering_key& ckey,\n                                      const result_row_view& static_row, const result_row_view& row)\n{\n    visitor.accept_new_partition(pkey, row_count);\n    visitor.accept_new_partition(row_count);\n    visitor.accept_new_row(ckey, static_row, row);\n    visitor.accept_new_row(static_row, row);\n    visitor.accept_partition_end(static_row);\n};\n)\n\nclass result_view {\n    ser::query_result_view _v;\n    friend class result_merger;\npublic:\n    result_view(const bytes_ostream& v) : _v(ser::query_result_view{ser::as_input_stream(v)}) {}\n    result_view(ser::query_result_view v) : _v(v) {}\n\n    template <typename Func>\n    static auto do_with(const query::result& res, Func&& func) {\n        result_view view(res.buf());\n        return func(view);\n    }\n\n    template <typename ResultVisitor>\n    static void consume(const query::result& res, const partition_slice& slice, ResultVisitor&& visitor) {\n        do_with(res, [&] (result_view v) {\n            v.consume(slice, visitor);\n        });\n    }\n\n    template <typename Visitor>\n    GCC6_CONCEPT(requires ResultVisitor<Visitor>)\n    void consume(const partition_slice& slice, Visitor&& visitor) {\n        for (auto&& p : _v.partitions()) {\n            auto rows = p.rows();\n            auto row_count = rows.size();\n            if (slice.options.contains<partition_slice::option::send_partition_key>()) {\n                auto key = *p.key();\n                visitor.accept_new_partition(key, row_count);\n            } else {\n                visitor.accept_new_partition(row_count);\n            }\n\n            result_row_view static_row(p.static_row());\n\n            for (auto&& row : rows) {\n                result_row_view view(row.cells());\n                if (slice.options.contains<partition_slice::option::send_clustering_key>()) {\n                    visitor.accept_new_row(*row.key(), static_row, view);\n                } else {\n                    visitor.accept_new_row(static_row, view);\n                }\n            }\n\n            visitor.accept_partition_end(static_row);\n        }\n    }\n\n    std::tuple<uint32_t, uint32_t> count_partitions_and_rows() {\n        auto&& ps = _v.partitions();\n        auto rows = boost::accumulate(ps | boost::adaptors::transformed([] (auto& p) {\n            return std::max(p.rows().size(), size_t(1));\n        }), uint32_t(0));\n        return std::make_tuple(ps.size(), rows);\n    }\n};\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <errno.h>\n#include <fcntl.h>\n#include <unistd.h>\n\n#include <sys\/ioctl.h>\n#include <sys\/stat.h>\n#include <sys\/mman.h>\n\n#include <linux\/fb.h>\n\n#include <kms++util\/kms++util.h>\n\nusing namespace kms;\n\nint main(int argc, char** argv)\n{\n\tconst char* fbdev = \"\/dev\/fb0\";\n\tint r;\n\n\tint fd = open(fbdev, O_RDWR);\n\tFAIL_IF(fd < 0, \"open %s failed\\n\", fbdev);\n\n\tstruct fb_var_screeninfo var;\n\n\tr = ioctl(fd, FBIOGET_VSCREENINFO, &var);\n\tFAIL_IF(r, \"FBIOGET_VSCREENINFO failed\");\n\n\tstruct fb_fix_screeninfo fix;\n\n\tr = ioctl(fd, FBIOGET_FSCREENINFO, &fix);\n\tFAIL_IF(r, \"FBIOGET_FSCREENINFO failed\");\n\n\tuint8_t* ptr = (uint8_t*)mmap(NULL,\n\t\t\t var.yres_virtual * fix.line_length,\n\t\t\t PROT_WRITE | PROT_READ,\n\t\t\t MAP_SHARED, fd, 0);\n\n\tFAIL_IF(ptr == MAP_FAILED, \"mmap failed\");\n\n\tExtCPUFramebuffer buf(var.xres, var.yres_virtual, PixelFormat::XRGB8888, ptr, fix.line_length);\n\n\tprintf(\"%s: res %dx%d, virtual %dx%d, line_len %d\\n\",\n\t       fbdev,\n\t       var.xres, var.yres,\n\t       var.xres_virtual, var.yres_virtual,\n\t       fix.line_length);\n\n\tdraw_test_pattern(buf);\n\tdraw_text(buf, buf.width() \/ 2, 0, fbdev, RGB(255, 255, 255));\n\n\tfor (unsigned y = 0; y < var.yres_virtual; ++y)\n\t\tmemcpy(ptr + fix.line_length * y, buf.map(0) + buf.stride(0) * y, buf.stride(0));\n\n\tclose(fd);\n\n\treturn 0;\n}\n<commit_msg>fbtestpat: remove extra leftover memcpy<commit_after>#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <errno.h>\n#include <fcntl.h>\n#include <unistd.h>\n\n#include <sys\/ioctl.h>\n#include <sys\/stat.h>\n#include <sys\/mman.h>\n\n#include <linux\/fb.h>\n\n#include <kms++util\/kms++util.h>\n\nusing namespace kms;\n\nint main(int argc, char** argv)\n{\n\tconst char* fbdev = \"\/dev\/fb0\";\n\tint r;\n\n\tint fd = open(fbdev, O_RDWR);\n\tFAIL_IF(fd < 0, \"open %s failed\\n\", fbdev);\n\n\tstruct fb_var_screeninfo var;\n\n\tr = ioctl(fd, FBIOGET_VSCREENINFO, &var);\n\tFAIL_IF(r, \"FBIOGET_VSCREENINFO failed\");\n\n\tstruct fb_fix_screeninfo fix;\n\n\tr = ioctl(fd, FBIOGET_FSCREENINFO, &fix);\n\tFAIL_IF(r, \"FBIOGET_FSCREENINFO failed\");\n\n\tuint8_t* ptr = (uint8_t*)mmap(NULL,\n\t\t\t var.yres_virtual * fix.line_length,\n\t\t\t PROT_WRITE | PROT_READ,\n\t\t\t MAP_SHARED, fd, 0);\n\n\tFAIL_IF(ptr == MAP_FAILED, \"mmap failed\");\n\n\tExtCPUFramebuffer buf(var.xres, var.yres_virtual, PixelFormat::XRGB8888, ptr, fix.line_length);\n\n\tprintf(\"%s: res %dx%d, virtual %dx%d, line_len %d\\n\",\n\t       fbdev,\n\t       var.xres, var.yres,\n\t       var.xres_virtual, var.yres_virtual,\n\t       fix.line_length);\n\n\tdraw_test_pattern(buf);\n\tdraw_text(buf, buf.width() \/ 2, 0, fbdev, RGB(255, 255, 255));\n\n\tclose(fd);\n\n\treturn 0;\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 \"combat.h\"\n\nbool TBeing::canSpin(TBeing *victim, silentTypeT silent)\n{\n  if (checkBusy(NULL))\n    return FALSE;\n\n  if (!doesKnowSkill(SKILL_SPIN)) {\n    if (!silent)\n      sendTo(\"You know nothing about spinning.\\n\\r\");\n    return FALSE;\n  }\n  if (!hasHands()) {\n    if (!silent)\n      sendTo(\"You need hands to spin someone.\\n\\r\");\n    return FALSE;\n  }\n  if (eitherArmHurt()) {\n    if (!silent)\n      sendTo(\"You can't spin someone with an injured arm.\\n\\r\");\n    return FALSE;\n  }\n\n  if (checkPeaceful(\"You feel too peaceful to contemplate violence.\\n\\r\"))\n    return FALSE;\n  \n  if (getCombatMode() == ATTACK_BERSERK) {\n    if (!silent)\n      sendTo(\"You are berserking! You can't focus enough to spin anyone!\\n\\r \");\n    return FALSE;\n  }\n\n  if (isSwimming()) {\n    if (!silent)\n      sendTo(\"It's impossible to spin someone while in water.\\n\\r\");\n    return FALSE;\n  }\n  if (victim->isFlying() && (victim->fight() != this)) {\n    if (!silent)\n      sendTo(\"You can only spin fliers that are fighting you.\\n\\r\");\n    return FALSE;\n  }\n  if (victim == this) {\n    if (!silent)\n      sendTo(\"Don't be stupid...that would suck if you could.\\n\\r\");\n    return FALSE;\n  }\n  if (noHarmCheck(victim))\n    return FALSE;\n\n  if (riding) {\n    if (!silent)\n      sendTo(\"You can't spin someone while mounted!\\n\\r\");\n    return FALSE;\n  }\n  \/\/ to prevent from misuse in groups ... \n  if (attackers > 3) {\n    if (!silent)\n      sendTo(\"Too many people in the way!\\n\\r\");\n    return FALSE;\n  }\n  if (victim->attackers > 3) {\n    if (!silent)\n      sendTo(\"You are too busy fending off other attackers!\\n\\r\");\n    return FALSE;\n  }\n  if (!canUseArm(HAND_PRIMARY) || !canUseArm(HAND_SECONDARY)) {\n    if (!silent)\n      sendTo(\"You need two working arms to spin someone.\\n\\r\");\n    return FALSE;\n  }\n  if (victim->isImmortal() || IS_SET(victim->specials.act, ACT_IMMORTAL)) {\n    if (!silent)\n      sendTo(\"You can't successfully spin an immortal...unless you want to dance.\\n\\r\");\n    return FALSE;\n  }\n  if (victim->getPosition() < POSITION_STANDING) {\n    if (!silent)\n      act(\"$N is on the $g.  You can't spin $M.\",\n          FALSE, this, 0, victim, TO_CHAR);\n    return FALSE;\n  }\n\n  return TRUE;\n}\n\nenum spinMissT {\n    TYPE_DEFAULT,\n    TYPE_DEX,\n    TYPE_MONK\n};\n\nstatic int spinMiss(TBeing *caster, TBeing *victim, spinMissT type)\n{\n  int rc;\n\n  if (type == TYPE_DEX) {\n    act(\"$N deftly avoids your attempt at spinning $M.\", FALSE, caster, \n              0, victim, TO_CHAR);\n    act(\"You deftly avoid $n's attempt at spinning you.\", FALSE, caster, \n              0, victim, TO_VICT);\n    act(\"$N deftly avoids $n's attempt at spinning $M.\", FALSE, caster, \n              0, victim, TO_NOTVICT);\n  } else if (type == TYPE_MONK) {\n    act(\"$N deftly counters your attemptat spinning $M. You trip and land on the $g.\", \n              FALSE, caster, 0, victim, TO_CHAR, ANSI_RED);\n    act(\"You deftly counter $n's attempt at spinning you.\\n\\rYou stick out your foot and trip\n$m to the $g.\", \n              FALSE, caster, 0, victim, TO_VICT);\n    act(\"$N deftly counters $n's attempt at spinning $M.\\n\\r$N sticks out $S foot tripping $n\nto the $g.\",\n              FALSE, caster, 0, victim, TO_NOTVICT);\n\n    rc = caster->crashLanding(POSITION_SITTING);\n    if (IS_SET_DELETE(rc, DELETE_THIS))\n      return rc;\n\n    rc = caster->trySpringleap(victim);\n    if (IS_SET_DELETE(rc, DELETE_THIS) || IS_SET_DELETE(rc, DELETE_VICT))\n      return rc;\n  } else {\n    act(\"$n tries to spin $N, but ends up falling down.\", FALSE, \n              caster, 0, victim, TO_NOTVICT);\n    act(\"You try to spin $N, but end up falling on your face.\",\n                         FALSE, caster, 0, victim, TO_CHAR);\n    act(\"$n fails to spin you, and tumbles to the $g.\", FALSE, \n              caster, 0, victim, TO_VICT);\n\n    rc = caster->crashLanding(POSITION_SITTING);\n    if (IS_SET_DELETE(rc, DELETE_THIS))\n      return rc;\n\n    rc = caster->trySpringleap(victim);\n    if (IS_SET_DELETE(rc, DELETE_THIS) || IS_SET_DELETE(rc, DELETE_VICT))\n      return rc;\n  }\n\n  if (caster->reconcileDamage(victim, 0,SKILL_SPIN) == -1)\n    return DELETE_VICT;\n\n  return FALSE;\n}\n\nstatic int spinHit(TBeing *caster, TBeing *victim)\n{\n  int rc;\n\n  if (!victim->riding) {\n    act(\"$n grabs $N's arm and spins $M! Now dizzy, $N trips and falls to the $g.\",\n           FALSE, caster, 0, victim, TO_NOTVICT);\n    act(\"You grab $N's arm and spin $M HARD! Now dizzy $N trips and falls to the $g.\",\n           FALSE, caster, 0, victim, TO_CHAR);\n    act(\"$n grabs you by the arm and spins you violently.\",\n           FALSE, caster, 0, victim, TO_VICT);\n    act(\"As the world spins into a blur before your eyes you become dazed, and fall face first to the $g.\",\n           FALSE, caster, 0, victim, TO_VICT, ANSI_RED);\n  } else {\n    act(\"$n grabs $N's arm and rips $M off of $S $o! $N slams head first into the $g.\",\n           FALSE, caster, victim->riding, victim, TO_NOTVICT);\n    act(\"You grab $N's arm and pull $M off of $S $o! $N slams head first into the $g.\",\n           FALSE, caster, victim->riding, victim, TO_CHAR);\n    act(\"$n suddenly grabs your arm and gives a hard yank!\",\n           FALSE, caster, victim->riding, victim, TO_VICT);\n    act(\"Suddenly, the $g rushes upward as you fall off of your $o. OOFF!! Yuck, dirt tastes AWFUL!\",\n           FALSE, caster, victim->riding, victim, TO_VICT, ANSI_RED);\n    victim->dismount(POSITION_RESTING);\n  }\n\n  rc = victim->crashLanding(POSITION_SITTING);\n  if (IS_SET_DELETE(rc, DELETE_THIS))\n    return DELETE_VICT;\n\n  rc = victim->trySpringleap(caster);\n  if (IS_SET_DELETE(rc, DELETE_THIS) && IS_SET_DELETE(rc, DELETE_VICT))\n    return rc;\n  else if (IS_SET_DELETE(rc, DELETE_THIS))\n    return DELETE_VICT;\n  else if (IS_SET_DELETE(rc, DELETE_VICT))\n    return DELETE_THIS;\n\n  \/\/ see the balance notes for details on what's going on here.\n  float wt = combatRound(discArray[SKILL_SPIN]->lag);\n  \/\/ adjust based on bash difficulty\n  wt = (wt * 100.0 \/ getSkillDiffModifier(SKILL_SPIN));\n\n  \/\/ since we cost some moves to perform, allow an extra 1\/2 round of lag\n  wt += 1.5;\n\n  \/\/ since success and failure both have reciprocal positional changes\n  \/\/ there is no reason to account for that here.\n\n  \/\/ round up\n  wt += 0.5;\n\n  victim->addToWait((int) wt);\n\n  \/\/ in general, we should not do BOTH damage and command lock-out\n  \/\/ however, since Bslam has nasty requirements on strength and\n  \/\/ dex to lift person up, doing this damage will counter-balance\n  \/\/ those penalties.  Warrior-skill damage isn't all that high\n  \/\/ to begin with...\n  int dam = caster->getSkillDam(victim, SKILL_SPIN, caster->getSkillLevel(SKILL_SPIN), caster->getAdvLearning(SKILL_SPIN));\n\n  if (caster->reconcileDamage(victim, dam,SKILL_SPIN) == -1)\n    return DELETE_VICT;\n\n  return TRUE;\n}\n\nstatic int spin(TBeing *caster, TBeing *victim)\n{\n  int percent;\n  int i = 0;\n  int rc;\n  const int SPIN_COST = 35;       \/\/ movement cost to spin\n\n  if (!caster->canSpin(victim, SILENT_NO))\n    return FALSE;\n\n  \/\/ AC makes less difference here ... \n  percent = ((10 + (victim->getArmor() \/ 200)) << 1);\n  int bKnown = caster->getSkillValue(SKILL_SPIN);\n\n  if (caster->getMove() < SPIN_COST) {\n    caster->sendTo(\"You don't have the vitality to spin anyone!\\n\\r\");\n    return FALSE;\n  }\n  caster->addToMove(-SPIN_COST);\n\n  if (victim->getPosition() <= POSITION_INCAP) \n    return (spinHit(caster, victim));\n  \n  \/\/ remember, F = MA :) need to take  weight into account \n  if (bSuccess(caster, bKnown + percent, SKILL_SPIN) &&\n         (i = caster->specialAttack(victim,SKILL_SPIN)) && \n         i != GUARANTEED_FAILURE &&\n         (percent < bKnown))  {\n    int modif = 1;\n    modif += (caster->getPrimaryHold() ? 0 : 2);\n    modif += (caster->getSecondaryHold() ? 0 : 1);\n\n    if (victim->canCounterMove(bKnown\/3)) {\n      SV(SKILL_SPIN);\n      rc = spinMiss(caster, victim, TYPE_MONK);\n      if (IS_SET_DELETE(rc, DELETE_THIS) || IS_SET_DELETE(rc, DELETE_VICT))\n        return rc;\n    } else if (((caster->getDexReaction() - \n                victim->getDexReaction()) > ::number(-10,20)) &&\n               victim->awake() && victim->getPosition() >= POSITION_STANDING) {\n      CS(SKILL_SPIN);\n      rc = spinMiss(caster, victim, TYPE_DEX);\n      if (IS_SET_DELETE(rc, DELETE_THIS) || IS_SET_DELETE(rc, DELETE_VICT))\n        return rc;\n    } else \n      return spinHit(caster, victim);\n  } else {\n    rc = spinMiss(caster, victim, TYPE_DEFAULT);\n    if (IS_SET_DELETE(rc, DELETE_THIS) || IS_SET_DELETE(rc, DELETE_VICT))\n      return rc;\n  }\n   \n  return TRUE;\n}\n\nint TBeing::doSpin(const char *argument, TBeing *vict)\n{\n  int rc = 0, learning = 0;\n  TBeing *victim;\n  char name_buf[256];\n  \n  only_argument(argument, name_buf);\n  \n  if (!(victim = vict)) {\n    if (!(victim = get_char_room_vis(this, name_buf))) {\n      if (!(victim = fight())) {\n        sendTo(\"Spin whom?\\n\\r\");\n        return FALSE;\n      }\n    }\n  }\n  if (!sameRoom(*victim)) {\n    sendTo(\"That person isn't around.\\n\\r\");\n    return FALSE;\n  }\n  if (desc) {\n    if ((learning = getAdvLearning(SKILL_SPIN)) <= 25) {\n      if (heldInPrimHand() || heldInSecHand()) {\n        sendTo(\"You are not skilled enough to spin someone with something in your hands!\\n\\r\");\n        return FALSE;\n      }\n    } else if (learning <= 50) {\n      if (heldInPrimHand()) {\n        sendTo(\"You are not skilled enough to spin someone with something in your primary hand!\\n\\r\");\n        return FALSE;\n      }\n    } else {\n      \/\/ no restrictions\n    }\n  }\n  rc = spin(this, victim);\n  if (rc)\n    addSkillLag(SKILL_SPIN, rc);\n  if (IS_SET_DELETE(rc, DELETE_VICT)) {\n    if (vict)\n      return rc;\n    delete victim;\n    victim = NULL;\n    REM_DELETE(rc, DELETE_VICT);\n  }\n  return rc;\n}\n\n\n\n<commit_msg>update to spin<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ SneezyMUD - All rights reserved, SneezyMUD Coding Team\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n#include \"stdsneezy.h\"\n#include \"combat.h\"\n\nbool TBeing::canSpin(TBeing *victim, silentTypeT silent)\n{\n  if (checkBusy(NULL))\n    return FALSE;\n\n  if (!doesKnowSkill(SKILL_SPIN)) {\n    if (!silent)\n      sendTo(\"You know nothing about spinning.\\n\\r\");\n    return FALSE;\n  }\n  if (!hasHands()) {\n    if (!silent)\n      sendTo(\"You need hands to spin someone.\\n\\r\");\n    return FALSE;\n  }\n  if (victim->!hasHands()) {\n    if (!silent)\n      sendTo(\"You need something to grab to make this work.\\n\\r\");\n    return FALSE;\n  }\n  if (eitherArmHurt()) {\n    if (!silent)\n      sendTo(\"You can't spin someone with an injured arm.\\n\\r\");\n    return FALSE;\n  }\n\n  if (checkPeaceful(\"You feel too peaceful to contemplate violence.\\n\\r\"))\n    return FALSE;\n  \n  if (getCombatMode() == ATTACK_BERSERK) {\n    if (!silent)\n      sendTo(\"You are berserking! You can't focus enough to spin anyone!\\n\\r \");\n    return FALSE;\n  }\n\n  if (isSwimming()) {\n    if (!silent)\n      sendTo(\"It's impossible to spin someone while in water.\\n\\r\");\n    return FALSE;\n  }\n  if (victim->isFlying() && (victim->fight() != this)) {\n    if (!silent)\n      sendTo(\"You can only spin fliers that are fighting you.\\n\\r\");\n    return FALSE;\n  }\n  if (victim == this) {\n    if (!silent)\n      sendTo(\"Don't be stupid...that would suck if you could.\\n\\r\");\n    return FALSE;\n  }\n  if (noHarmCheck(victim))\n    return FALSE;\n\n  if (riding) {\n    if (!silent)\n      sendTo(\"You can't spin someone while mounted!\\n\\r\");\n    return FALSE;\n  }\n  \/\/ to prevent from misuse in groups ... \n  if (attackers > 3) {\n    if (!silent)\n      sendTo(\"Too many people in the way!\\n\\r\");\n    return FALSE;\n  }\n  if (victim->attackers > 3) {\n    if (!silent)\n      sendTo(\"You are too busy fending off other attackers!\\n\\r\");\n    return FALSE;\n  }\n  if (!canUseArm(HAND_PRIMARY) || !canUseArm(HAND_SECONDARY)) {\n    if (!silent)\n      sendTo(\"You need two working arms to spin someone.\\n\\r\");\n    return FALSE;\n  }\n  if (victim->isImmortal() || IS_SET(victim->specials.act, ACT_IMMORTAL)) {\n    if (!silent)\n      sendTo(\"You can't successfully spin an immortal...unless you want to dance.\\n\\r\");\n    return FALSE;\n  }\n  if (victim->getPosition() < POSITION_STANDING) {\n    if (!silent)\n      act(\"$N is on the $g.  You can't spin $M.\",\n          FALSE, this, 0, victim, TO_CHAR);\n    return FALSE;\n  }\n\n  return TRUE;\n}\n\nenum spinMissT {\n    TYPE_DEFAULT,\n    TYPE_DEX,\n    TYPE_MONK\n};\n\nstatic int spinMiss(TBeing *caster, TBeing *victim, spinMissT type)\n{\n  int rc;\n\n  if (type == TYPE_DEX) {\n    act(\"$N deftly avoids your attempt at spinning $M.\", FALSE, caster, \n              0, victim, TO_CHAR);\n    act(\"You deftly avoid $n's attempt at spinning you.\", FALSE, caster, \n              0, victim, TO_VICT);\n    act(\"$N deftly avoids $n's attempt at spinning $M.\", FALSE, caster, \n              0, victim, TO_NOTVICT);\n  } else if (type == TYPE_MONK) {\n    act(\"$N deftly counters your attemptat spinning $M. You trip and land on the $g.\", \n              FALSE, caster, 0, victim, TO_CHAR, ANSI_RED);\n    act(\"You deftly counter $n's attempt at spinning you.\\n\\rYou stick out your foot and trip\n$m to the $g.\", \n              FALSE, caster, 0, victim, TO_VICT);\n    act(\"$N deftly counters $n's attempt at spinning $M.\\n\\r$N sticks out $S foot tripping $n\nto the $g.\",\n              FALSE, caster, 0, victim, TO_NOTVICT);\n\n    rc = caster->crashLanding(POSITION_SITTING);\n    if (IS_SET_DELETE(rc, DELETE_THIS))\n      return rc;\n\n    rc = caster->trySpringleap(victim);\n    if (IS_SET_DELETE(rc, DELETE_THIS) || IS_SET_DELETE(rc, DELETE_VICT))\n      return rc;\n  } else {\n    act(\"$n tries to spin $N, but ends up falling down.\", FALSE, \n              caster, 0, victim, TO_NOTVICT);\n    act(\"You try to spin $N, but end up falling on your face.\",\n                         FALSE, caster, 0, victim, TO_CHAR);\n    act(\"$n fails to spin you, and tumbles to the $g.\", FALSE, \n              caster, 0, victim, TO_VICT);\n\n    rc = caster->crashLanding(POSITION_SITTING);\n    if (IS_SET_DELETE(rc, DELETE_THIS))\n      return rc;\n\n    rc = caster->trySpringleap(victim);\n    if (IS_SET_DELETE(rc, DELETE_THIS) || IS_SET_DELETE(rc, DELETE_VICT))\n      return rc;\n  }\n\n  if (caster->reconcileDamage(victim, 0,SKILL_SPIN) == -1)\n    return DELETE_VICT;\n\n  return FALSE;\n}\n\nstatic int spinHit(TBeing *caster, TBeing *victim)\n{\n  int rc;\n\n  if (!victim->riding) {\n    act(\"$n grabs $N's arm and spins $M! Now dizzy, $N trips and falls to the $g.\",\n           FALSE, caster, 0, victim, TO_NOTVICT);\n    act(\"You grab $N's arm and spin $M HARD! Now dizzy $N trips and falls to the $g.\",\n           FALSE, caster, 0, victim, TO_CHAR);\n    act(\"$n grabs you by the arm and spins you violently.\",\n           FALSE, caster, 0, victim, TO_VICT);\n    act(\"As the world spins into a blur before your eyes you become dazed, and fall face first to the $g.\",\n           FALSE, caster, 0, victim, TO_VICT, ANSI_RED);\n  } else {\n    act(\"$n grabs $N's arm and rips $M off of $S $o! $N slams head first into the $g.\",\n           FALSE, caster, victim->riding, victim, TO_NOTVICT);\n    act(\"You grab $N's arm and pull $M off of $S $o! $N slams head first into the $g.\",\n           FALSE, caster, victim->riding, victim, TO_CHAR);\n    act(\"$n suddenly grabs your arm and gives a hard yank!\",\n           FALSE, caster, victim->riding, victim, TO_VICT);\n    act(\"Suddenly, the $g rushes upward as you fall off of your $o. OOFF!! Yuck, dirt tastes AWFUL!\",\n           FALSE, caster, victim->riding, victim, TO_VICT, ANSI_RED);\n    victim->dismount(POSITION_RESTING);\n  }\n\n  rc = victim->crashLanding(POSITION_SITTING);\n  if (IS_SET_DELETE(rc, DELETE_THIS))\n    return DELETE_VICT;\n\n  rc = victim->trySpringleap(caster);\n  if (IS_SET_DELETE(rc, DELETE_THIS) && IS_SET_DELETE(rc, DELETE_VICT))\n    return rc;\n  else if (IS_SET_DELETE(rc, DELETE_THIS))\n    return DELETE_VICT;\n  else if (IS_SET_DELETE(rc, DELETE_VICT))\n    return DELETE_THIS;\n\n  \/\/ see the balance notes for details on what's going on here.\n  float wt = combatRound(discArray[SKILL_SPIN]->lag);\n  \/\/ adjust based on bash difficulty\n  wt = (wt * 100.0 \/ getSkillDiffModifier(SKILL_SPIN));\n\n  \/\/ since we cost some moves to perform, allow an extra 1\/2 round of lag\n  wt += 1.5;\n\n  \/\/ since success and failure both have reciprocal positional changes\n  \/\/ there is no reason to account for that here.\n\n  \/\/ round up\n  wt += 0.5;\n\n  victim->addToWait((int) wt);\n\n  \/\/ in general, we should not do BOTH damage and command lock-out\n  \/\/ however, since Bslam has nasty requirements on strength and\n  \/\/ dex to lift person up, doing this damage will counter-balance\n  \/\/ those penalties.  Warrior-skill damage isn't all that high\n  \/\/ to begin with...\n  int dam = caster->getSkillDam(victim, SKILL_SPIN, caster->getSkillLevel(SKILL_SPIN), caster->getAdvLearning(SKILL_SPIN));\n\n  if (caster->reconcileDamage(victim, dam,SKILL_SPIN) == -1)\n    return DELETE_VICT;\n\n  return TRUE;\n}\n\nstatic int spin(TBeing *caster, TBeing *victim)\n{\n  int percent;\n  int i = 0;\n  int rc;\n  const int SPIN_COST = 35;       \/\/ movement cost to spin\n\n  if (!caster->canSpin(victim, SILENT_NO))\n    return FALSE;\n\n  \/\/ AC makes less difference here ... \n  percent = ((10 + (victim->getArmor() \/ 200)) << 1);\n  int bKnown = caster->getSkillValue(SKILL_SPIN);\n\n  if (caster->getMove() < SPIN_COST) {\n    caster->sendTo(\"You don't have the vitality to spin anyone!\\n\\r\");\n    return FALSE;\n  }\n  caster->addToMove(-SPIN_COST);\n\n  if (victim->getPosition() <= POSITION_INCAP) \n    return (spinHit(caster, victim));\n  \n  \/\/ remember, F = MA :) need to take  weight into account \n  if (bSuccess(caster, bKnown + percent, SKILL_SPIN) &&\n         (i = caster->specialAttack(victim,SKILL_SPIN)) && \n         i != GUARANTEED_FAILURE &&\n         (percent < bKnown))  {\n    int modif = 1;\n    modif += (caster->getPrimaryHold() ? 0 : 2);\n    modif += (caster->getSecondaryHold() ? 0 : 1);\n\n    if (victim->canCounterMove(bKnown\/3)) {\n      SV(SKILL_SPIN);\n      rc = spinMiss(caster, victim, TYPE_MONK);\n      if (IS_SET_DELETE(rc, DELETE_THIS) || IS_SET_DELETE(rc, DELETE_VICT))\n        return rc;\n    } else if (((caster->getDexReaction() - \n                victim->getDexReaction()) > ::number(-10,20)) &&\n               victim->awake() && victim->getPosition() >= POSITION_STANDING) {\n      CS(SKILL_SPIN);\n      rc = spinMiss(caster, victim, TYPE_DEX);\n      if (IS_SET_DELETE(rc, DELETE_THIS) || IS_SET_DELETE(rc, DELETE_VICT))\n        return rc;\n    } else \n      return spinHit(caster, victim);\n  } else {\n    rc = spinMiss(caster, victim, TYPE_DEFAULT);\n    if (IS_SET_DELETE(rc, DELETE_THIS) || IS_SET_DELETE(rc, DELETE_VICT))\n      return rc;\n  }\n   \n  return TRUE;\n}\n\nint TBeing::doSpin(const char *argument, TBeing *vict)\n{\n  int rc = 0, learning = 0;\n  TBeing *victim;\n  char name_buf[256];\n  \n  only_argument(argument, name_buf);\n  \n  if (!(victim = vict)) {\n    if (!(victim = get_char_room_vis(this, name_buf))) {\n      if (!(victim = fight())) {\n        sendTo(\"Spin whom?\\n\\r\");\n        return FALSE;\n      }\n    }\n  }\n  if (!sameRoom(*victim)) {\n    sendTo(\"That person isn't around.\\n\\r\");\n    return FALSE;\n  }\n  if (desc) {\n    if ((learning = getAdvLearning(SKILL_SPIN)) <= 25) {\n      if (heldInPrimHand() || heldInSecHand()) {\n        sendTo(\"You are not skilled enough to spin someone with something in your hands!\\n\\r\");\n        return FALSE;\n      }\n    } else if (learning <= 50) {\n      if (heldInPrimHand()) {\n        sendTo(\"You are not skilled enough to spin someone with something in your primary hand!\\n\\r\");\n        return FALSE;\n      }\n    } else {\n      \/\/ no restrictions\n    }\n  }\n  rc = spin(this, victim);\n  if (rc)\n    addSkillLag(SKILL_SPIN, rc);\n  if (IS_SET_DELETE(rc, DELETE_VICT)) {\n    if (vict)\n      return rc;\n    delete victim;\n    victim = NULL;\n    REM_DELETE(rc, DELETE_VICT);\n  }\n  return rc;\n}\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef _fcgi_istream_hpp__\n#define _fcgi_istream_hpp__\n\n\/\/ Copyright(c) Andre Caron (andre.l.caron@gmail.com), 2011\n\/\/\n\/\/ This document is covered by the an Open Source Initiative approved license. A\n\/\/ copy of the license should have been provided alongside this software package\n\/\/ (see \"LICENSE.txt\"). If not, terms of the license are available online at\n\/\/ \"http:\/\/www.opensource.org\/licenses\/mit\".\n\n#include \"fcgi.h\"\n#include <iostream>\n#include <string>\n\nnamespace fcgi {\n\n    class istream\n    {\n        \/* data. *\/\n    private:\n        ::fcgi_iwire_settings mySettings;\n        ::fcgi_iwire myWire;\n\n        \/* construction. *\/\n    public:\n        istream ()\n        {\n            ::fcgi_iwire_init(&mySettings, &myWire);\n            myWire.object = static_cast<void*>(this);\n              \/\/ Register callbacks.\n            myWire.accept_record       = &istream::accept_record;\n            myWire.finish_record       = &istream::finish_record;\n            myWire.accept_request      = &istream::accept_request;\n            myWire.cancel_request      = &istream::cancel_request;\n            myWire.finish_request      = &istream::finish_request;\n            myWire.accept_param_name   = &istream::accept_param_name;\n            myWire.accept_param_data   = &istream::accept_param_data;\n            myWire.accept_content_stdi = &istream::accept_content_stdi;\n            myWire.accept_content_stdo = &istream::accept_content_stdo;\n            myWire.accept_content_stde = &istream::accept_content_stde;\n        }\n\n        \/* methods. *\/\n    public:\n        void feed ( const char * data, size_t size )\n        {\n            ::fcgi_iwire_feed(&myWire, data, size);\n        }\n\n        void feed ( const std::string& buffer )\n        {\n            ::fcgi_iwire_feed(&myWire, buffer.data(), buffer.size());\n        }\n\n    protected:\n        virtual void new_request ( int role, int flags )\n        {\n            switch ( role )\n            {\n            case 1: \/\/ responder.\n                break;\n            case 2: \/\/ authorizer.\n                break;\n            case 3: \/\/ filter.\n                break;\n            default: {}\n            }\n        }\n\n        virtual void bad_request ()\n        {\n        }\n\n        virtual void end_request ()\n        {\n        }\n\n        virtual void new_record ( int version, int request, int size )\n        {\n        }\n\n        virtual void end_record ()\n        {\n        }\n\n        virtual void param_name ( const char * data, size_t size )\n        {\n            param_name(std::string(data, size));\n        }\n        virtual void param_name ( const std::string& ) {}\n\n        virtual void param_data ( const char * data, size_t size )\n        {\n            param_data(std::string(data, size));\n        }\n        virtual void param_data ( const std::string& ) {}\n\n        virtual void query_name ( const char * data, size_t size )\n        {\n            query_name(std::string(data, size));\n        }\n        virtual void query_name ( const std::string& ) {}\n\n        virtual void query_data ( const char * data, size_t size )\n        {\n            query_data(std::string(data, size));\n        }\n        virtual void query_data ( const std::string& ) {}\n\n        virtual void reply_name ( const char * data, size_t size )\n        {\n            reply_name(std::string(data, size));\n        }\n        virtual void reply_name ( const std::string& ) {}\n\n        virtual void reply_data ( const char * data, size_t size )\n        {\n            reply_data(std::string(data, size));\n        }\n        virtual void reply_data ( const std::string& data ) {}\n\n        virtual void stdi ( const char * data, size_t size )\n        {\n            stdi(std::string(data, size));\n        }\n        virtual void stdi ( const std::string& ) {}\n\n        virtual void stdo ( const char * data, size_t size )\n        {\n            stdo(std::string(data, size));\n        }\n        virtual void stdo ( const std::string& ) {}\n\n        virtual void stde ( const char * data, size_t size )\n        {\n            stde(std::string(data, size));\n        }\n        virtual void stde ( const std::string& ) {}\n\n        \/* class methods. *\/\n    private:\n        static void accept_record\n            ( ::fcgi_iwire * stream, int version, int request, int content )\n        {\n            static_cast<istream*>(stream->object)\n                ->new_record(version, request, content);\n        }\n\n        static void finish_record ( ::fcgi_iwire * stream )\n        {\n            static_cast<istream*>(stream->object)->end_record();\n        }\n\n        static void accept_request ( ::fcgi_iwire * stream, int role, int flags )\n        {\n            static_cast<istream*>(stream->object)->new_request(role, flags);\n        }\n\n        static void cancel_request ( ::fcgi_iwire * stream )\n        {\n            static_cast<istream*>(stream->object)->bad_request();\n        }\n\n        static void finish_request ( ::fcgi_iwire * stream, uint32_t, uint8_t )\n        {\n            static_cast<istream*>(stream->object)->end_request();\n        }\n\n        static void accept_content_stdi\n            ( ::fcgi_iwire * stream, const char * data, size_t size )\n        {\n            static_cast<istream*>(stream->object)->stdi(data, size);\n        }\n\n        static void accept_content_stdo\n            ( ::fcgi_iwire * stream, const char * data, size_t size )\n        {\n            static_cast<istream*>(stream->object)->stdo(data, size);\n        }\n\n        static void accept_content_stde\n            ( ::fcgi_iwire * stream, const char * data, size_t size )\n        {\n            static_cast<istream*>(stream->object)->stde(data, size);\n        }\n\n        static void accept_param_name\n            ( ::fcgi_iwire * stream, const char * data, size_t size )\n        {\n            static_cast<istream*>(stream->object)->param_name(data, size);\n        }\n\n        static void accept_param_data\n            ( ::fcgi_iwire * stream, const char * data, size_t size )\n        {\n            static_cast<istream*>(stream->object)->param_data(data, size);\n        }\n\n        static void accept_query_name\n            ( ::fcgi_iwire * stream, const char * data, size_t size )\n        {\n            static_cast<istream*>(stream->object)->query_name(data, size);\n        }\n\n        static void accept_query_data\n            ( ::fcgi_iwire * stream, const char * data, size_t size )\n        {\n            static_cast<istream*>(stream->object)->query_data(data, size);\n        }\n\n        static void accept_reply_name\n            ( ::fcgi_iwire * stream, const char * data, size_t size )\n        {\n            static_cast<istream*>(stream->object)->reply_name(data, size);\n        }\n\n        static void accept_reply_data\n            ( ::fcgi_iwire * stream, const char * data, size_t size )\n        {\n            static_cast<istream*>(stream->object)->reply_data(data, size);\n        }\n    };\n\n}\n\n#endif \/* _fcgi_istream_hpp__ *\/\n<commit_msg>Completed input stream.<commit_after>#ifndef _fcgi_istream_hpp__\n#define _fcgi_istream_hpp__\n\n\/\/ Copyright(c) Andre Caron (andre.l.caron@gmail.com), 2011\n\/\/\n\/\/ This document is covered by the an Open Source Initiative approved license. A\n\/\/ copy of the license should have been provided alongside this software package\n\/\/ (see \"LICENSE.txt\"). If not, terms of the license are available online at\n\/\/ \"http:\/\/www.opensource.org\/licenses\/mit\".\n\n#include \"fcgi.h\"\n#include <iostream>\n#include <string>\n\nnamespace fcgi {\n\n    class istream\n    {\n        \/* data. *\/\n    private:\n        ::fcgi_iwire_settings mySettings;\n        ::fcgi_iwire myWire;\n\n        std::string myPName; std::string myPData;\n        std::string myQName; std::string myQData;\n        std::string myRName; std::string myRData;\n\n        \/* construction. *\/\n    public:\n        istream ()\n        {\n            ::fcgi_iwire_init(&mySettings, &myWire);\n            myWire.object = static_cast<void*>(this);\n              \/\/ Register callbacks.\n            myWire.accept_record       = &istream::accept_record;\n            myWire.finish_record       = &istream::finish_record;\n            myWire.accept_request      = &istream::accept_request;\n            myWire.cancel_request      = &istream::cancel_request;\n            myWire.finish_request      = &istream::finish_request;\n            myWire.accept_param_name   = &istream::accept_param_name;\n            myWire.accept_param_data   = &istream::accept_param_data;\n            myWire.accept_param        = &istream::accept_param;\n            myWire.accept_query_name   = &istream::accept_query_name;\n            myWire.accept_query_data   = &istream::accept_query_data;\n            myWire.accept_query        = &istream::accept_query;\n            myWire.accept_reply_name   = &istream::accept_reply_name;\n            myWire.accept_reply_data   = &istream::accept_reply_data;\n            myWire.accept_reply        = &istream::accept_reply;\n            myWire.accept_content_stdi = &istream::accept_content_stdi;\n            myWire.accept_content_stdo = &istream::accept_content_stdo;\n            myWire.accept_content_stde = &istream::accept_content_stde;\n        }\n\n        \/* methods. *\/\n    public:\n        void feed ( const char * data, size_t size )\n        {\n            ::fcgi_iwire_feed(&myWire, data, size);\n        }\n\n        void feed ( const std::string& buffer )\n        {\n            ::fcgi_iwire_feed(&myWire, buffer.data(), buffer.size());\n        }\n\n    protected:\n        virtual void new_request ( int role, int flags )\n        {\n            switch ( role )\n            {\n            case 1: \/\/ responder.\n                break;\n            case 2: \/\/ authorizer.\n                break;\n            case 3: \/\/ filter.\n                break;\n            default: {}\n            }\n        }\n\n        virtual void bad_request ()\n        {\n        }\n\n        virtual void end_request ()\n        {\n        }\n\n        virtual void new_record ( int version, int request, int size )\n        {\n        }\n\n        virtual void end_record ()\n        {\n        }\n\n        virtual void param_name ( const char * data, size_t size )\n        {\n            param_name(std::string(data, size));\n        }\n\n        virtual void param_name ( const std::string& name )\n        {\n            myPName = name;\n        }\n\n        virtual void param_data ( const char * data, size_t size )\n        {\n            param_data(std::string(data, size));\n        }\n\n        virtual void param_data ( const std::string& data )\n        {\n            myPData = data;\n        }\n\n        virtual void param ()\n        {\n            param(myPName, myPData), myPName.clear(), myPData.clear();\n        }\n\n        virtual void param ( const std::string& name, const std::string& data )\n        {\n        }\n\n        virtual void query_name ( const char * data, size_t size )\n        {\n            query_name(std::string(data, size));\n        }\n\n        virtual void query_name ( const std::string& name )\n        {\n            myQName = name;\n        }\n\n        virtual void query_data ( const char * data, size_t size )\n        {\n            query_data(std::string(data, size));\n        }\n\n        virtual void query_data ( const std::string& data )\n        {\n            myQData = data;\n        }\n\n        virtual void query ()\n        {\n            query(myQName, myQData), myQName.clear(), myQData.clear();\n        }\n\n        virtual void query ( const std::string& name, const std::string& data )\n        {\n        }\n\n        virtual void reply_name ( const char * data, size_t size )\n        {\n            reply_name(std::string(data, size));\n        }\n\n        virtual void reply_name ( const std::string& name )\n        {\n            myRName = name;\n        }\n\n        virtual void reply_data ( const char * data, size_t size )\n        {\n            reply_data(std::string(data, size));\n        }\n\n        virtual void reply_data ( const std::string& data )\n        {\n            myRData = data;\n        }\n\n        virtual void reply ()\n        {\n            reply(myRName, myRData), myRName.clear(), myRData.clear();\n        }\n\n        virtual void reply ( const std::string& name, const std::string& data )\n        {\n        }\n\n        virtual void stdi ( const char * data, size_t size )\n        {\n            stdi(std::string(data, size));\n        }\n        virtual void stdi ( const std::string& ) {}\n\n        virtual void stdo ( const char * data, size_t size )\n        {\n            stdo(std::string(data, size));\n        }\n        virtual void stdo ( const std::string& ) {}\n\n        virtual void stde ( const char * data, size_t size )\n        {\n            stde(std::string(data, size));\n        }\n        virtual void stde ( const std::string& ) {}\n\n        \/* class methods. *\/\n    private:\n        static void accept_record\n            ( ::fcgi_iwire * stream, int version, int request, int content )\n        {\n            static_cast<istream*>(stream->object)\n                ->new_record(version, request, content);\n        }\n\n        static void finish_record ( ::fcgi_iwire * stream )\n        {\n            static_cast<istream*>(stream->object)->end_record();\n        }\n\n        static void accept_request ( ::fcgi_iwire * stream, int role, int flags )\n        {\n            static_cast<istream*>(stream->object)->new_request(role, flags);\n        }\n\n        static void cancel_request ( ::fcgi_iwire * stream )\n        {\n            static_cast<istream*>(stream->object)->bad_request();\n        }\n\n        static void finish_request ( ::fcgi_iwire * stream, uint32_t, uint8_t )\n        {\n            static_cast<istream*>(stream->object)->end_request();\n        }\n\n        static void accept_content_stdi\n            ( ::fcgi_iwire * stream, const char * data, size_t size )\n        {\n            static_cast<istream*>(stream->object)->stdi(data, size);\n        }\n\n        static void accept_content_stdo\n            ( ::fcgi_iwire * stream, const char * data, size_t size )\n        {\n            static_cast<istream*>(stream->object)->stdo(data, size);\n        }\n\n        static void accept_content_stde\n            ( ::fcgi_iwire * stream, const char * data, size_t size )\n        {\n            static_cast<istream*>(stream->object)->stde(data, size);\n        }\n\n        static void accept_param_name\n            ( ::fcgi_iwire * stream, const char * data, size_t size )\n        {\n            static_cast<istream*>(stream->object)->param_name(data, size);\n        }\n\n        static void accept_param_data\n            ( ::fcgi_iwire * stream, const char * data, size_t size )\n        {\n            static_cast<istream*>(stream->object)->param_data(data, size);\n        }\n\n        static void accept_param ( ::fcgi_iwire * stream )\n        {\n            static_cast<istream*>(stream->object)->param();\n        }\n\n        static void accept_query_name\n            ( ::fcgi_iwire * stream, const char * data, size_t size )\n        {\n            static_cast<istream*>(stream->object)->query_name(data, size);\n        }\n\n        static void accept_query_data\n            ( ::fcgi_iwire * stream, const char * data, size_t size )\n        {\n            static_cast<istream*>(stream->object)->query_data(data, size);\n        }\n\n        static void accept_query ( ::fcgi_iwire * stream )\n        {\n            static_cast<istream*>(stream->object)->query();\n        }\n\n        static void accept_reply_name\n            ( ::fcgi_iwire * stream, const char * data, size_t size )\n        {\n            static_cast<istream*>(stream->object)->reply_name(data, size);\n        }\n\n        static void accept_reply_data\n            ( ::fcgi_iwire * stream, const char * data, size_t size )\n        {\n            static_cast<istream*>(stream->object)->reply_data(data, size);\n        }\n\n        static void accept_reply ( ::fcgi_iwire * stream )\n        {\n            static_cast<istream*>(stream->object)->reply();\n        }\n    };\n\n}\n\n#endif \/* _fcgi_istream_hpp__ *\/\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: BookmarkSet.cxx,v $\n *\n *  $Revision: 1.19 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 06:29:28 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_dbaccess.hxx\"\n#ifndef DBACCESS_CORE_API_BOOKMARKSET_HXX\n#include \"BookmarkSet.hxx\"\n#endif\n#ifndef _DBA_CORE_RESOURCE_HXX_\n#include \"core_resource.hxx\"\n#endif\n#ifndef _DBA_CORE_RESOURCE_HRC_\n#include \"core_resource.hrc\"\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XRESULTSETUPDATE_HPP_\n#include <com\/sun\/star\/sdbc\/XResultSetUpdate.hpp>\n#endif\n#ifndef _DBHELPER_DBEXCEPTION_HXX_\n#include <connectivity\/dbexception.hxx>\n#endif\n\n#include <limits>\n\nusing namespace dbaccess;\nusing namespace ::connectivity;\nusing namespace ::dbtools;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::beans;\nusing namespace ::com::sun::star::sdbc;\n\/\/  using namespace ::com::sun::star::sdb;\nusing namespace ::com::sun::star::sdbcx;\nusing namespace ::com::sun::star::container;\nusing namespace ::com::sun::star::lang;\n\/\/  using namespace ::cppu;\nusing namespace ::osl;\n\nvoid OBookmarkSet::construct(const Reference< XResultSet>& _xDriverSet)\n{\n    OCacheSet::construct(_xDriverSet);\n    m_xRowLocate.set(_xDriverSet,UNO_QUERY);\n}\n\/\/ -----------------------------------------------------------------------------\nAny SAL_CALL OBookmarkSet::getBookmark() throw(SQLException, RuntimeException)\n{\n    return m_xRowLocate->getBookmark();\n}\n\/\/ -------------------------------------------------------------------------\nsal_Bool SAL_CALL OBookmarkSet::moveToBookmark( const Any& bookmark ) throw(SQLException, RuntimeException)\n{\n    return m_xRowLocate->moveToBookmark(bookmark);\n}\n\/\/ -------------------------------------------------------------------------\nsal_Bool SAL_CALL OBookmarkSet::moveRelativeToBookmark( const Any& bookmark, sal_Int32 rows ) throw(SQLException, RuntimeException)\n{\n    return m_xRowLocate->moveRelativeToBookmark(bookmark,rows);\n}\n\/\/ -------------------------------------------------------------------------\nsal_Int32 SAL_CALL OBookmarkSet::compareBookmarks( const Any& _first, const Any& _second ) throw(SQLException, RuntimeException)\n{\n    return m_xRowLocate->compareBookmarks(_first,_second);\n}\n\/\/ -------------------------------------------------------------------------\nsal_Bool SAL_CALL OBookmarkSet::hasOrderedBookmarks(  ) throw(SQLException, RuntimeException)\n{\n    return m_xRowLocate->hasOrderedBookmarks();\n}\n\/\/ -------------------------------------------------------------------------\nsal_Int32 SAL_CALL OBookmarkSet::hashBookmark( const Any& bookmark ) throw(SQLException, RuntimeException)\n{\n    return m_xRowLocate->hashBookmark(bookmark);\n}\n\/\/ -------------------------------------------------------------------------\n\/\/ ::com::sun::star::sdbcx::XDeleteRows\nSequence< sal_Int32 > SAL_CALL OBookmarkSet::deleteRows( const Sequence< Any >& rows ,const connectivity::OSQLTable& \/*_xTable*\/) throw(SQLException, RuntimeException)\n{\n    Reference< ::com::sun::star::sdbcx::XDeleteRows> xDeleteRow(m_xRowLocate,UNO_QUERY);\n    if(xDeleteRow.is())\n    {\n        return xDeleteRow->deleteRows(rows);\n    }\n    return Sequence< sal_Int32 >();\n}\n\/\/ -------------------------------------------------------------------------\nvoid SAL_CALL OBookmarkSet::insertRow( const ORowSetRow& _rInsertRow,const connectivity::OSQLTable& \/*_xTable*\/ ) throw(SQLException, RuntimeException)\n{\n    Reference<XRowUpdate> xUpdRow(m_xRowLocate,UNO_QUERY);\n    if(!xUpdRow.is())\n        ::dbtools::throwSQLException( DBACORE_RESSTRING( RID_STR_NO_XROWUPDATE ), SQL_GENERAL_ERROR, *this );\n\n    Reference<XResultSetUpdate> xUpd(m_xRowLocate,UNO_QUERY);\n    if(xUpd.is())\n    {\n        xUpd->moveToInsertRow();\n        sal_Int32 i = 1;\n        for(connectivity::ORowVector< ORowSetValue > ::iterator aIter = _rInsertRow->begin()+1;aIter != _rInsertRow->end();++aIter,++i)\n        {\n            aIter->setSigned(m_aSignedFlags[i-1]);\n            updateColumn(i,xUpdRow,*aIter);\n        }\n        xUpd->insertRow();\n        (*_rInsertRow->begin()) = m_xRowLocate->getBookmark();\n    }\n    else\n        ::dbtools::throwSQLException( DBACORE_RESSTRING( RID_STR_NO_XRESULTSETUPDATE ), SQL_GENERAL_ERROR, *this );\n}\n\/\/ -------------------------------------------------------------------------\nvoid SAL_CALL OBookmarkSet::updateRow(const ORowSetRow& _rInsertRow ,const ORowSetRow& _rOrginalRow,const connectivity::OSQLTable& \/*_xTable*\/  ) throw(SQLException, RuntimeException)\n{\n    \/\/  OCacheSet::updateRow( _rInsertRow,_rOrginalRow,_xTable);\n    Reference<XRowUpdate> xUpdRow(m_xRowLocate,UNO_QUERY);\n    if(!xUpdRow.is())\n        ::dbtools::throwSQLException( DBACORE_RESSTRING( RID_STR_NO_XROWUPDATE ), SQL_GENERAL_ERROR, *this );\n\n    sal_Int32 i = 1;\n    connectivity::ORowVector< ORowSetValue > ::const_iterator aOrgIter = _rOrginalRow->begin()+1;\n    for(connectivity::ORowVector< ORowSetValue > ::iterator aIter = _rInsertRow->begin()+1;aIter != _rInsertRow->end();++aIter,++i,++aOrgIter)\n    {\n        aIter->setSigned(aOrgIter->isSigned());\n        updateColumn(i,xUpdRow,*aIter);\n    }\n\n\n    Reference<XResultSetUpdate> xUpd(m_xRowLocate,UNO_QUERY);\n    if(xUpd.is())\n        xUpd->updateRow();\n    else\n        ::dbtools::throwSQLException( DBACORE_RESSTRING( RID_STR_NO_XRESULTSETUPDATE ), SQL_GENERAL_ERROR, *this );\n}\n\/\/ -------------------------------------------------------------------------\nvoid SAL_CALL OBookmarkSet::deleteRow(const ORowSetRow& \/*_rDeleteRow*\/ ,const connectivity::OSQLTable& \/*_xTable*\/  ) throw(SQLException, RuntimeException)\n{\n    Reference<XResultSetUpdate> xUpd(m_xRowLocate,UNO_QUERY);\n\n    xUpd->deleteRow();\n}\n\/\/ -------------------------------------------------------------------------\nvoid SAL_CALL OBookmarkSet::cancelRowUpdates(  ) throw(SQLException, RuntimeException)\n{\n}\n\/\/ -------------------------------------------------------------------------\nvoid SAL_CALL OBookmarkSet::moveToInsertRow(  ) throw(SQLException, RuntimeException)\n{\n    Reference<XResultSetUpdate> xUpd(m_xRowLocate,UNO_QUERY);\n    if(xUpd.is())\n        xUpd->moveToInsertRow();\n}\n\/\/ -------------------------------------------------------------------------\nvoid SAL_CALL OBookmarkSet::moveToCurrentRow(  ) throw(SQLException, RuntimeException)\n{\n}\n\/\/ -------------------------------------------------------------------------\nvoid OBookmarkSet::fillValueRow(ORowSetRow& _rRow,sal_Int32 _nPosition)\n{\n    OCacheSet::fillValueRow(_rRow,_nPosition);\n}\n\/\/ -------------------------------------------------------------------------\nvoid OBookmarkSet::updateColumn(sal_Int32 nPos,Reference< XRowUpdate > _xParameter,const ORowSetValue& _rValue)\n{\n    if(_rValue.isBound() && _rValue.isModified())\n    {\n        if(_rValue.isNull())\n            _xParameter->updateNull(nPos);\n        else\n        {\n\n            switch(_rValue.getTypeKind())\n            {\n                case DataType::CHAR:\n                case DataType::VARCHAR:\n                case DataType::DECIMAL:\n                case DataType::NUMERIC:\n                    _xParameter->updateString(nPos,_rValue);\n                    break;\n                case DataType::BIGINT:\n                    if ( _rValue.isSigned() )\n                        _xParameter->updateLong(nPos,_rValue);\n                    else\n                        _xParameter->updateString(nPos,_rValue);\n                    break;\n                case DataType::BIT:\n                case DataType::BOOLEAN:\n                    _xParameter->updateBoolean(nPos,_rValue);\n                    break;\n                case DataType::TINYINT:\n                    if ( _rValue.isSigned() )\n                        _xParameter->updateByte(nPos,_rValue);\n                    else\n                        _xParameter->updateShort(nPos,_rValue);\n                    break;\n                case DataType::SMALLINT:\n                    if ( _rValue.isSigned() )\n                        _xParameter->updateShort(nPos,_rValue);\n                    else\n                        _xParameter->updateInt(nPos,_rValue);\n                    break;\n                case DataType::INTEGER:\n                    if ( _rValue.isSigned() )\n                        _xParameter->updateInt(nPos,_rValue);\n                    else\n                        _xParameter->updateLong(nPos,_rValue);\n                    break;\n                case DataType::FLOAT:\n                    _xParameter->updateFloat(nPos,_rValue);\n                    break;\n                case DataType::DOUBLE:\n                case DataType::REAL:\n                    _xParameter->updateDouble(nPos,_rValue);\n                    break;\n                case DataType::DATE:\n                    _xParameter->updateDate(nPos,_rValue);\n                    break;\n                case DataType::TIME:\n                    _xParameter->updateTime(nPos,_rValue);\n                    break;\n                case DataType::TIMESTAMP:\n                    _xParameter->updateTimestamp(nPos,_rValue);\n                    break;\n                case DataType::BINARY:\n                case DataType::VARBINARY:\n                case DataType::LONGVARBINARY:\n                    _xParameter->updateBytes(nPos,_rValue);\n                    break;\n\n            }\n        }\n    }\n}\n\n<commit_msg>INTEGRATION: CWS dba24d (1.19.170); FILE MERGED 2007\/11\/06 09:19:38 oj 1.19.170.1: #i51965# use scale for update<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: BookmarkSet.cxx,v $\n *\n *  $Revision: 1.20 $\n *\n *  last change: $Author: rt $ $Date: 2008-01-30 08:27: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_dbaccess.hxx\"\n#ifndef DBACCESS_CORE_API_BOOKMARKSET_HXX\n#include \"BookmarkSet.hxx\"\n#endif\n#ifndef _DBA_CORE_RESOURCE_HXX_\n#include \"core_resource.hxx\"\n#endif\n#ifndef _DBA_CORE_RESOURCE_HRC_\n#include \"core_resource.hrc\"\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XRESULTSETUPDATE_HPP_\n#include <com\/sun\/star\/sdbc\/XResultSetUpdate.hpp>\n#endif\n#ifndef _DBHELPER_DBEXCEPTION_HXX_\n#include <connectivity\/dbexception.hxx>\n#endif\n\n#include <limits>\n\nusing namespace dbaccess;\nusing namespace ::connectivity;\nusing namespace ::dbtools;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::beans;\nusing namespace ::com::sun::star::sdbc;\n\/\/  using namespace ::com::sun::star::sdb;\nusing namespace ::com::sun::star::sdbcx;\nusing namespace ::com::sun::star::container;\nusing namespace ::com::sun::star::lang;\n\/\/  using namespace ::cppu;\nusing namespace ::osl;\n\nvoid OBookmarkSet::construct(const Reference< XResultSet>& _xDriverSet)\n{\n    OCacheSet::construct(_xDriverSet);\n    m_xRowLocate.set(_xDriverSet,UNO_QUERY);\n}\n\/\/ -----------------------------------------------------------------------------\nAny SAL_CALL OBookmarkSet::getBookmark() throw(SQLException, RuntimeException)\n{\n    return m_xRowLocate->getBookmark();\n}\n\/\/ -------------------------------------------------------------------------\nsal_Bool SAL_CALL OBookmarkSet::moveToBookmark( const Any& bookmark ) throw(SQLException, RuntimeException)\n{\n    return m_xRowLocate->moveToBookmark(bookmark);\n}\n\/\/ -------------------------------------------------------------------------\nsal_Bool SAL_CALL OBookmarkSet::moveRelativeToBookmark( const Any& bookmark, sal_Int32 rows ) throw(SQLException, RuntimeException)\n{\n    return m_xRowLocate->moveRelativeToBookmark(bookmark,rows);\n}\n\/\/ -------------------------------------------------------------------------\nsal_Int32 SAL_CALL OBookmarkSet::compareBookmarks( const Any& _first, const Any& _second ) throw(SQLException, RuntimeException)\n{\n    return m_xRowLocate->compareBookmarks(_first,_second);\n}\n\/\/ -------------------------------------------------------------------------\nsal_Bool SAL_CALL OBookmarkSet::hasOrderedBookmarks(  ) throw(SQLException, RuntimeException)\n{\n    return m_xRowLocate->hasOrderedBookmarks();\n}\n\/\/ -------------------------------------------------------------------------\nsal_Int32 SAL_CALL OBookmarkSet::hashBookmark( const Any& bookmark ) throw(SQLException, RuntimeException)\n{\n    return m_xRowLocate->hashBookmark(bookmark);\n}\n\/\/ -------------------------------------------------------------------------\n\/\/ ::com::sun::star::sdbcx::XDeleteRows\nSequence< sal_Int32 > SAL_CALL OBookmarkSet::deleteRows( const Sequence< Any >& rows ,const connectivity::OSQLTable& \/*_xTable*\/) throw(SQLException, RuntimeException)\n{\n    Reference< ::com::sun::star::sdbcx::XDeleteRows> xDeleteRow(m_xRowLocate,UNO_QUERY);\n    if(xDeleteRow.is())\n    {\n        return xDeleteRow->deleteRows(rows);\n    }\n    return Sequence< sal_Int32 >();\n}\n\/\/ -------------------------------------------------------------------------\nvoid SAL_CALL OBookmarkSet::insertRow( const ORowSetRow& _rInsertRow,const connectivity::OSQLTable& \/*_xTable*\/ ) throw(SQLException, RuntimeException)\n{\n    Reference<XRowUpdate> xUpdRow(m_xRowLocate,UNO_QUERY);\n    if(!xUpdRow.is())\n        ::dbtools::throwSQLException( DBACORE_RESSTRING( RID_STR_NO_XROWUPDATE ), SQL_GENERAL_ERROR, *this );\n\n    Reference<XResultSetUpdate> xUpd(m_xRowLocate,UNO_QUERY);\n    if(xUpd.is())\n    {\n        xUpd->moveToInsertRow();\n        sal_Int32 i = 1;\n        for(connectivity::ORowVector< ORowSetValue > ::iterator aIter = _rInsertRow->begin()+1;aIter != _rInsertRow->end();++aIter,++i)\n        {\n            aIter->setSigned(m_aSignedFlags[i-1]);\n            updateColumn(i,xUpdRow,*aIter);\n        }\n        xUpd->insertRow();\n        (*_rInsertRow->begin()) = m_xRowLocate->getBookmark();\n    }\n    else\n        ::dbtools::throwSQLException( DBACORE_RESSTRING( RID_STR_NO_XRESULTSETUPDATE ), SQL_GENERAL_ERROR, *this );\n}\n\/\/ -------------------------------------------------------------------------\nvoid SAL_CALL OBookmarkSet::updateRow(const ORowSetRow& _rInsertRow ,const ORowSetRow& _rOrginalRow,const connectivity::OSQLTable& \/*_xTable*\/  ) throw(SQLException, RuntimeException)\n{\n    \/\/  OCacheSet::updateRow( _rInsertRow,_rOrginalRow,_xTable);\n    Reference<XRowUpdate> xUpdRow(m_xRowLocate,UNO_QUERY);\n    if(!xUpdRow.is())\n        ::dbtools::throwSQLException( DBACORE_RESSTRING( RID_STR_NO_XROWUPDATE ), SQL_GENERAL_ERROR, *this );\n\n    sal_Int32 i = 1;\n    connectivity::ORowVector< ORowSetValue > ::const_iterator aOrgIter = _rOrginalRow->begin()+1;\n    for(connectivity::ORowVector< ORowSetValue > ::iterator aIter = _rInsertRow->begin()+1;aIter != _rInsertRow->end();++aIter,++i,++aOrgIter)\n    {\n        aIter->setSigned(aOrgIter->isSigned());\n        updateColumn(i,xUpdRow,*aIter);\n    }\n\n\n    Reference<XResultSetUpdate> xUpd(m_xRowLocate,UNO_QUERY);\n    if(xUpd.is())\n        xUpd->updateRow();\n    else\n        ::dbtools::throwSQLException( DBACORE_RESSTRING( RID_STR_NO_XRESULTSETUPDATE ), SQL_GENERAL_ERROR, *this );\n}\n\/\/ -------------------------------------------------------------------------\nvoid SAL_CALL OBookmarkSet::deleteRow(const ORowSetRow& \/*_rDeleteRow*\/ ,const connectivity::OSQLTable& \/*_xTable*\/  ) throw(SQLException, RuntimeException)\n{\n    Reference<XResultSetUpdate> xUpd(m_xRowLocate,UNO_QUERY);\n\n    xUpd->deleteRow();\n}\n\/\/ -------------------------------------------------------------------------\nvoid SAL_CALL OBookmarkSet::cancelRowUpdates(  ) throw(SQLException, RuntimeException)\n{\n}\n\/\/ -------------------------------------------------------------------------\nvoid SAL_CALL OBookmarkSet::moveToInsertRow(  ) throw(SQLException, RuntimeException)\n{\n    Reference<XResultSetUpdate> xUpd(m_xRowLocate,UNO_QUERY);\n    if(xUpd.is())\n        xUpd->moveToInsertRow();\n}\n\/\/ -------------------------------------------------------------------------\nvoid SAL_CALL OBookmarkSet::moveToCurrentRow(  ) throw(SQLException, RuntimeException)\n{\n}\n\/\/ -------------------------------------------------------------------------\nvoid OBookmarkSet::fillValueRow(ORowSetRow& _rRow,sal_Int32 _nPosition)\n{\n    OCacheSet::fillValueRow(_rRow,_nPosition);\n}\n\/\/ -------------------------------------------------------------------------\nvoid OBookmarkSet::updateColumn(sal_Int32 nPos,Reference< XRowUpdate > _xParameter,const ORowSetValue& _rValue)\n{\n    if(_rValue.isBound() && _rValue.isModified())\n    {\n        if(_rValue.isNull())\n            _xParameter->updateNull(nPos);\n        else\n        {\n\n            switch(_rValue.getTypeKind())\n            {\n                case DataType::DECIMAL:\n                case DataType::NUMERIC:\n                    _xParameter->updateNumericObject(nPos,_rValue.makeAny(),m_xSetMetaData->getScale(nPos));\n                    break;\n                case DataType::CHAR:\n                case DataType::VARCHAR:\n                \/\/case DataType::DECIMAL:\n                \/\/case DataType::NUMERIC:\n                    _xParameter->updateString(nPos,_rValue);\n                    break;\n                case DataType::BIGINT:\n                    if ( _rValue.isSigned() )\n                        _xParameter->updateLong(nPos,_rValue);\n                    else\n                        _xParameter->updateString(nPos,_rValue);\n                    break;\n                case DataType::BIT:\n                case DataType::BOOLEAN:\n                    _xParameter->updateBoolean(nPos,_rValue);\n                    break;\n                case DataType::TINYINT:\n                    if ( _rValue.isSigned() )\n                        _xParameter->updateByte(nPos,_rValue);\n                    else\n                        _xParameter->updateShort(nPos,_rValue);\n                    break;\n                case DataType::SMALLINT:\n                    if ( _rValue.isSigned() )\n                        _xParameter->updateShort(nPos,_rValue);\n                    else\n                        _xParameter->updateInt(nPos,_rValue);\n                    break;\n                case DataType::INTEGER:\n                    if ( _rValue.isSigned() )\n                        _xParameter->updateInt(nPos,_rValue);\n                    else\n                        _xParameter->updateLong(nPos,_rValue);\n                    break;\n                case DataType::FLOAT:\n                    _xParameter->updateFloat(nPos,_rValue);\n                    break;\n                case DataType::DOUBLE:\n                case DataType::REAL:\n                    _xParameter->updateDouble(nPos,_rValue);\n                    break;\n                case DataType::DATE:\n                    _xParameter->updateDate(nPos,_rValue);\n                    break;\n                case DataType::TIME:\n                    _xParameter->updateTime(nPos,_rValue);\n                    break;\n                case DataType::TIMESTAMP:\n                    _xParameter->updateTimestamp(nPos,_rValue);\n                    break;\n                case DataType::BINARY:\n                case DataType::VARBINARY:\n                case DataType::LONGVARBINARY:\n                    _xParameter->updateBytes(nPos,_rValue);\n                    break;\n\n            }\n        }\n    }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"stdsneezy.h\"\n#include \"database.h\"\n#include \"lowtools.h\"\n#include<unistd.h>\n\n\/\/ This should be a perl script\n\/\/ but I feel like doing it in c++\n\/\/ whee system()\n\/\/ this code pretty much sucks\n\nconst char *pgcmd=\"pg_dump -R -a -D -t %s %s | grep -E \\\"%s\\\" | grep \\\"%s\\\" | perl -pe \\\"s\/\\',\/\\',\\n\/g; s\/\\\\134012\/\\n\/g;s\/VALUES \/VALUES\\n\/;s\/INSERT\/\\nINSERT\/g;\\\" >> %s\";\n\nint main(int argc, char **argv)\n{\n  sstring immortal, db, buf, where, grep;\n  char file[]=\"\/tmp\/sqledobjXXXXXX\";\n  int answer;\n  unsigned int i;\n  FILE *tmpfile;\n  vector<int>vnums;\n\n  if(argc<=1 || argc>3){\n    printf(\"Usage: sqledobj <owner> <vnum list>\\n\");\n    printf(\"if <owner> is given (optional), then the immortal database is used\\n\");\n    printf(\"Example: sqledobjs.pl Peel 13700-13780 13791 13798\\n\");\n    exit(0);\n  }\n\n  if(!isdigit(argv[1][0])){\n    db=\"immortal\";\n    immortal=argv[1];\n    if(!parse_num_args(argc-2, argv+2, vnums))\n      exit(0);\n   \n    where=\"where vnum in (\";\n    for (i=0;i<vnums.size()-1;i++){\n      ssprintf(where, \"%s%i,\", where.c_str(),vnums[i]);\n      ssprintf(grep, \"%sVALUES \\\\(%i,|\",grep.c_str(), vnums[i]);\n    }\n    ssprintf(where, \"%s%i) and owner='%s'\", where.c_str(), vnums[i], immortal.c_str());\n    ssprintf(grep, \"%sVALUES \\\\(%i,\",grep.c_str(), vnums[i]);\n  } else {\n    db=\"sneezybeta\";\n    immortal=\"\";\n    if(!parse_num_args(argc-1, argv+1, vnums))\n      exit(0);\n    where=\"where vnum in (\";\n    for (i=0;i<vnums.size()-1;i++){\n      ssprintf(where, \"%s%i,\", where.c_str(),vnums[i]);\n      ssprintf(grep, \"%sVALUES \\\\(%i,|\",grep.c_str(), vnums[i]);\n    }\n    ssprintf(where, \"%s%i)\", where.c_str(), vnums[i]);\n    ssprintf(grep, \"%sVALUES \\\\(%i,\",grep.c_str(), vnums[i]);\n  }\n\n  printf(\"Using database %s.\\n\", db.c_str());\n\n  mkstemp(file);\n\n  tmpfile=fopen(file, \"w\");\n  fprintf(tmpfile, \"delete from obj %s;\\n\", where.c_str());\n  fprintf(tmpfile, \"delete from objaffect %s;\\n\", where.c_str());\n  fprintf(tmpfile, \"delete from objextra %s;\\n\", where.c_str());\n  fclose(tmpfile);\n\n  printf(\"Fetching obj data.\\n\");\n  ssprintf(buf, pgcmd, \"obj\", db.c_str(), grep.c_str(), immortal.c_str(), file);\n  system(buf.c_str());\n\n  printf(\"Fetching objaffect data.\\n\");\n  ssprintf(buf, pgcmd, \"objaffect\", db.c_str(), grep.c_str(), immortal.c_str(), file);\n  system(buf.c_str());\n\n  printf(\"Fetching objextra data.\\n\");\n  ssprintf(buf, pgcmd, \"objextra\", db.c_str(), grep.c_str(), immortal.c_str(), file);\n  system(buf.c_str());\n\n  ssprintf(buf, \"\/bin\/cp -f %s %s.`whoami`\", file, file);\n  system(buf.c_str());\n  ssprintf(buf, \"\/bin\/chmod a+rw %s.`whoami`\", file);\n  system(buf.c_str());\n  \n  printf(\"Opening editor.\\n\");\n  ssprintf(buf, \"$EDITOR %s\", file);\n  system(buf.c_str());\n\n  printf(\"Insert this object? [y\/n] \");\n  while(1){\n    answer=getc(stdin);\n    if(answer=='n'){\n      printf(\"Object not inserted.\\n\");\n      unlink(file);\n      exit(0);\n    } else if(answer=='y'){\n      break;\n    } else {\n      printf(\"Insert this object? [y\/n] \");\n    }\n  }\n\n  ssprintf(buf, \"\/usr\/local\/bin\/psql %s < %s\", db.c_str(), file);\n  system(buf.c_str());\n\n  \/\/  unlink(file);\n\n  printf(\"Done. Your backup file is: \");\n  fflush(stdout);\n  ssprintf(buf, \"\/bin\/ls %s*\", file);\n  system(buf.c_str());\n  printf(\"\\n\");\n}\n\n\n<commit_msg>rewrote this in the style of sqledwld<commit_after>#include \"stdsneezy.h\"\n#include \"database.h\"\n#include \"lowtools.h\"\n#include <unistd.h>\n\nint main(int argc, char **argv)\n{\n  TDatabase db(DB_SNEEZYBETA);\n  vector<int>vnums;\n  map<sstring,sstring>val;\n  char file[]=\"\/tmp\/sqledobjXXXXXX\";\n  FILE *tmpfile;\n  sstring buf, sbuf;\n  int answer;\n\n  if(argc<=1){\n    printf(\"Usage: sqledobj <vnum list>\\n\");\n    printf(\"Example: sqledobj 13700-13780 13791 13798\\n\");\n    exit(0);\n  }\n\n  if(!parse_num_args(argc-1, argv+1, vnums))\n    exit(0);\n\n  for(unsigned int i=0;i<vnums.size();++i){\n    printf(\"Fetching data for object %i\\n\", vnums[i]);\n\n    db.query(\"select * from obj where vnum=%i\", vnums[i]);\n    if(db.fetchRow()){\n      ssprintf(buf, \"- obj\\n\"); sbuf+=buf;\n      ssprintf(buf, \"vnum: %s\\n\", db[\"vnum\"]);  sbuf+=buf;\n      ssprintf(buf, \"name: %s\\n\", db[\"name\"]);  sbuf+=buf;\n      ssprintf(buf, \"short_desc: %s\\n\", db[\"short_desc\"]);  sbuf+=buf;\n      ssprintf(buf, \"long_desc: %s\\n\", db[\"long_desc\"]);  sbuf+=buf;\n      ssprintf(buf, \"action_desc: %s\\n\", db[\"action_desc\"]);  sbuf+=buf;\n      ssprintf(buf, \"type: %s\\n\", db[\"type\"]);  sbuf+=buf;\n      ssprintf(buf, \"action_flag: %s\\n\", db[\"action_flag\"]);  sbuf+=buf;\n      ssprintf(buf, \"wear_flag: %s\\n\", db[\"wear_flag\"]);  sbuf+=buf;\n      ssprintf(buf, \"val0: %s\\n\", db[\"val0\"]);  sbuf+=buf;\n      ssprintf(buf, \"val1: %s\\n\", db[\"val1\"]);  sbuf+=buf;\n      ssprintf(buf, \"val2: %s\\n\", db[\"val2\"]);  sbuf+=buf;\n      ssprintf(buf, \"val3: %s\\n\", db[\"val3\"]);  sbuf+=buf;\n      ssprintf(buf, \"weight: %s\\n\", db[\"weight\"]);  sbuf+=buf;\n      ssprintf(buf, \"price: %s\\n\", db[\"price\"]);  sbuf+=buf;\n      ssprintf(buf, \"can_be_seen: %s\\n\", db[\"can_be_seen\"]);  sbuf+=buf;\n      ssprintf(buf, \"spec_proc: %s\\n\", db[\"spec_proc\"]);  sbuf+=buf;\n      ssprintf(buf, \"max_exist: %s\\n\", db[\"max_exist\"]);  sbuf+=buf;\n      ssprintf(buf, \"max_struct: %s\\n\", db[\"max_struct\"]);  sbuf+=buf;\n      ssprintf(buf, \"cur_struct: %s\\n\", db[\"cur_struct\"]);  sbuf+=buf;\n      ssprintf(buf, \"decay: %s\\n\", db[\"decay\"]);  sbuf+=buf;\n      ssprintf(buf, \"volume: %s\\n\", db[\"volume\"]);  sbuf+=buf;\n      ssprintf(buf, \"material: %s\\n\", db[\"material\"]);  sbuf+=buf;\n      ssprintf(buf, \"\\n\"); sbuf+=buf;\n    }\n\n\n    db.query(\"select * from objextra where vnum=%i\", vnums[i]);\n    while(db.fetchRow()){\n      ssprintf(buf, \"- objextra\\n\"); sbuf+=buf;\n      ssprintf(buf, \"vnum: %s\\n\", db[\"vnum\"]);  sbuf+=buf;\n      ssprintf(buf, \"name: %s\\n\", db[\"name\"]);  sbuf+=buf;\n      ssprintf(buf, \"description~:\\n%s~\\n\", db[\"description\"]);  sbuf+=buf;\n      ssprintf(buf, \"\\n\"); sbuf+=buf;\n    }\n\n\n    db.query(\"select * from objaffect where vnum=%i\", vnums[i]);\n    while(db.fetchRow()){\n      ssprintf(buf, \"- objaffect\\n\"); sbuf+=buf;\n      ssprintf(buf, \"vnum:      %s\\n\", db[\"vnum\"]);  sbuf+=buf;\n      ssprintf(buf, \"type: %s\\n\", db[\"type\"]);  sbuf+=buf;\n      ssprintf(buf, \"mod1:      %s\\n\", db[\"mod1\"]);  sbuf+=buf;\n      ssprintf(buf, \"mod2:\\n%s~\\n\", db[\"mod2\"]);  sbuf+=buf;\n      ssprintf(buf, \"\\n\"); sbuf+=buf;\n    }\n  }\n\n\n  mkstemp(file);\n  tmpfile=fopen(file, \"w\");\n  fprintf(tmpfile, \"%s\", sbuf.c_str());\n  fclose(tmpfile);\n\n  printf(\"Opening editor.\\n\");\n  ssprintf(buf, \"$EDITOR %s\", file);\n  system(buf.c_str());\n\n\n  printf(\"Insert object%s? [y\/n] \", vnums.size()>1?\"s\":\"\");\n  while(1){\n    answer=getc(stdin);\n    if(answer=='n'){\n      printf(\"Object%s not inserted.\\n\", vnums.size()>1?\"s\":\"\");\n      unlink(file);\n      exit(0);\n    } else if(answer=='y'){\n      break;\n    } else {\n      printf(\"Insert object%s? [y\/n] \", vnums.size()>1?\"s\":\"\");\n    }\n  }\n\n  ssprintf(buf, \"\/bin\/cp -f %s %s.backup\", file, file);\n  system(buf.c_str());\n\n\n  int i=0;\n\n  while(++i){\n    val=parse_data_file(file, i);\n    if(val[\"vnum\"]==\"EOM\")\n      break;\n    \n    if(val[\"DATATYPE\"]==\"obj\"){\n      printf(\"replacing object %s\\n\", val[\"vnum\"].c_str());\n      db.query(\"delete from obj where vnum=%s\",\n\t       val[\"vnum\"].c_str());\n      db.query(\"delete from objextra where vnum=%s\",\n\t       val[\"vnum\"].c_str());\n      db.query(\"delete from objaffect where vnum=%s\",\n\t       val[\"vnum\"].c_str());\n\n      \n      db.query(\"insert into obj (vnum,name,short_desc,long_desc,action_desc,type,action_flag,wear_flag,val0,val1,val2,val3,weight,price,can_be_seen,spec_proc,max_exist,max_struct,cur_struct,decay,volume,material) values (%s,'%s','%s','%s','%s',%s, %s, %s, %s, %s, %s, %s, %s, %s, %s, %s, %s, %s, %s, %s, %s, %s)\",\n\t       val[\"vnum\"].c_str(),val[\"name\"].c_str(),val[\"short_desc\"].c_str(),val[\"long_desc\"].c_str(),val[\"action_desc\"].c_str(),val[\"type\"].c_str(),val[\"action_flag\"].c_str(),val[\"wear_flag\"].c_str(),val[\"val0\"].c_str(),val[\"val1\"].c_str(),val[\"val2\"].c_str(),val[\"val3\"].c_str(),val[\"weight\"].c_str(),val[\"price\"].c_str(),val[\"can_be_seen\"].c_str(),val[\"spec_proc\"].c_str(),val[\"max_exist\"].c_str(),val[\"max_struct\"].c_str(),val[\"cur_struct\"].c_str(),val[\"decay\"].c_str(),val[\"volume\"].c_str(),val[\"material\"].c_str());\n      \n    } else if(val[\"DATATYPE\"]==\"objextra\"){\n      printf(\"replacing objextra %s\\n\", val[\"vnum\"].c_str());\n      \n      db.query(\"insert into objextra (vnum, name, description) values (%s,'%s','%s')\", val[\"vnum\"].c_str(), val[\"name\"].c_str(), val[\"description\"].c_str());\n      \n    } else if(val[\"DATATYPE\"]==\"objaffect\"){\n      printf(\"replacing objaffect %s\\n\", val[\"vnum\"].c_str());\n      \n      db.query(\"insert into objaffect (vnum,type,mod1,mod2) values (%s,%s,%s,%s)\",\n\t       val[\"vnum\"].c_str(), val[\"type\"].c_str(),val[\"mod1\"].c_str(),val[\"mod2\"].c_str());\n\n    }\n    printf(\"\\n\");\n\n  }\n\n\n  unlink(file);\n\n  printf(\"Done.\\n\\r\");\n  printf(\"Your backup file is %s.backup\\n\", file);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: AppSwapWindow.cxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: hr $ $Date: 2005-09-23 12: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#ifndef DBAUI_APPSWAPWINDOW_HXX\n#include \"AppSwapWindow.hxx\"\n#endif\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n#ifndef _DBA_DBACCESS_HELPID_HRC_\n#include \"dbaccess_helpid.hrc\"\n#endif\n#ifndef _DBU_APP_HRC_\n#include \"dbu_app.hrc\"\n#endif\n#ifndef DBAUI_APPVIEW_HXX\n#include \"AppView.hxx\"\n#endif\n#ifndef DBAUI_IAPPELEMENTNOTIFICATION_HXX\n#include \"IAppElementNotification.hxx\"\n#endif\n#ifndef _DBAUI_MODULE_DBU_HXX_\n#include \"moduledbu.hxx\"\n#endif\n#ifndef _SV_SVAPP_HXX\n#include <vcl\/svapp.hxx>\n#endif\n#ifndef _SV_SYSWIN_HXX\n#include <vcl\/syswin.hxx>\n#endif\n#ifndef _SV_MENU_HXX\n#include <vcl\/menu.hxx>\n#endif\n#ifndef _SV_MNEMONIC_HXX\n#include <vcl\/mnemonic.hxx>\n#endif\n\n#include <memory>\n\nusing namespace ::dbaui;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::sdbc;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::container;\n\n\/\/==================================================================\n\/\/ class OApplicationSwapWindow\nDBG_NAME(OApplicationSwapWindow)\n\/\/==================================================================\nOApplicationSwapWindow::OApplicationSwapWindow(Window* _pParent,OAppBorderWindow* _pBorderWindow) : Control(_pParent,WB_DIALOGCONTROL )\n    ,m_aIconControl(this)\n    ,m_pBorderWin(_pBorderWindow)\n    ,m_eLastType(E_NONE)\n{\n    DBG_CTOR(OApplicationSwapWindow,NULL);\n\n    ImplInitSettings( sal_True, sal_True, sal_True );\n\n    m_aIconControl.SetClickHdl(LINK(this, OApplicationSwapWindow, OnContainerSelectHdl));\n    m_aIconControl.setControlActionListener(_pBorderWindow->getView()->getActionListener());\n    m_aIconControl.SetHelpId(HID_APP_SWAP_ICONCONTROL);\n    m_aIconControl.Show();\n    m_aIconControl.Enable(TRUE);\n}\n\/\/ -----------------------------------------------------------------------------\nOApplicationSwapWindow::~OApplicationSwapWindow()\n{\n\n    DBG_DTOR(OApplicationSwapWindow,NULL);\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OApplicationSwapWindow::Resize()\n{\n    Size aFLSize = LogicToPixel( Size( 8, 0 ), MAP_APPFONT );\n    long nX = 0;\n    if ( m_aIconControl.GetEntryCount() != 0 )\n        nX = m_aIconControl.GetBoundingBox( m_aIconControl.GetEntry(0) ).GetWidth() + aFLSize.Width();\n\n    Size aOutputSize = GetOutputSize();\n\n    m_aIconControl.SetPosSizePixel( Point(static_cast<long>((aOutputSize.Width() - nX)*0.5), 0)  ,Size(nX,aOutputSize.Height()));\n    m_aIconControl.ArrangeIcons();\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OApplicationSwapWindow::ImplInitSettings( sal_Bool bFont, sal_Bool bForeground, sal_Bool bBackground )\n{\n    const StyleSettings& rStyleSettings = GetSettings().GetStyleSettings();\n\n    if ( bFont )\n    {\n        Font aFont = rStyleSettings.GetAppFont();\n        if ( IsControlFont() )\n            aFont.Merge( GetControlFont() );\n        SetPointFont( aFont );\n    }\n\n    if ( bFont || bForeground )\n    {\n        Color aTextColor = rStyleSettings.GetButtonTextColor();\n        if ( IsControlForeground() )\n            aTextColor = GetControlForeground();\n        SetTextColor( aTextColor );\n    }\n\n    SetBackground( Wallpaper( Application::GetSettings().GetStyleSettings().GetWindowColor() ) );\n}\n\/\/ -----------------------------------------------------------------------\nvoid OApplicationSwapWindow::DataChanged( const DataChangedEvent& rDCEvt )\n{\n    Window::DataChanged( rDCEvt );\n\n    if ( (rDCEvt.GetType() == DATACHANGED_SETTINGS) &&\n         (rDCEvt.GetFlags() & SETTINGS_STYLE) )\n    {\n        ImplInitSettings( sal_True, sal_True, sal_True );\n        Invalidate();\n    }\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OApplicationSwapWindow::clearSelection()\n{\n    m_aIconControl.SetNoSelection();\n    ULONG nPos = 0;\n    SvxIconChoiceCtrlEntry* pEntry = m_aIconControl.GetSelectedEntry(nPos);\n    if ( pEntry )\n        m_aIconControl.InvalidateEntry(pEntry);\n    m_aIconControl.GetClickHdl().Call(&m_aIconControl);\n}\n\n\/\/ -----------------------------------------------------------------------------\nvoid OApplicationSwapWindow::createIconAutoMnemonics()\n{\n    \/\/ we need to share our \"mnemonic space\" with the menu of the window we live in\n    MnemonicGenerator aMnemonicGenerator;\n    SystemWindow* pSystemWindow = GetSystemWindow();\n    MenuBar* pMenu = pSystemWindow ? pSystemWindow->GetMenuBar() : NULL;\n    if ( pMenu )\n    {\n        USHORT nMenuItems = pMenu->GetItemCount();\n        for ( USHORT i = 0; i < nMenuItems; ++i )\n            aMnemonicGenerator.RegisterMnemonic( pMenu->GetItemText( pMenu->GetItemId( i ) ) );\n    }\n\n    m_aIconControl.CreateAutoMnemonics( aMnemonicGenerator );\n}\n\n\/\/ -----------------------------------------------------------------------------\nbool OApplicationSwapWindow::interceptKeyInput( const KeyEvent& _rEvent )\n{\n    const KeyCode& rKeyCode = _rEvent.GetKeyCode();\n    if ( rKeyCode.GetModifier() == KEY_MOD2 )\n        return m_aIconControl.DoKeyInput( _rEvent );\n\n    \/\/ not intercepted\n    return false;\n}\n\n\/\/ -----------------------------------------------------------------------------\nElementType OApplicationSwapWindow::getElementType() const\n{\n    ULONG nPos = 0;\n    SvxIconChoiceCtrlEntry* pEntry = m_aIconControl.GetSelectedEntry(nPos);\n    return ( pEntry ) ? *static_cast<ElementType*>(pEntry->GetUserData()) : E_NONE;\n}\n\/\/ -----------------------------------------------------------------------------\nIMPL_LINK(OApplicationSwapWindow, OnContainerSelectHdl, SvtIconChoiceCtrl*, _pControl)\n{\n    ULONG nPos = 0;\n    SvxIconChoiceCtrlEntry* pEntry = _pControl->GetSelectedEntry( nPos );\n    ElementType eType = E_NONE;\n    if ( pEntry )\n        eType = *static_cast<ElementType*>(pEntry->GetUserData());\n\n    if ( m_eLastType != eType && eType != E_NONE )\n    {\n        if ( m_pBorderWin->getView()->getElementNotification()->onContainerSelect(eType) )\n            m_eLastType = eType;\n        else\n        {\n            PostUserEvent(LINK(this, OApplicationSwapWindow, ChangeToLastSelected));\n        }\n    }\n\n    return 1L;\n}\n\/\/------------------------------------------------------------------------------\nIMPL_LINK(OApplicationSwapWindow, ChangeToLastSelected, void*, EMPTYARG)\n{\n    changeContainer(m_eLastType);\n    return 0L;\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OApplicationSwapWindow::changeContainer(ElementType _eType)\n{\n    ULONG nCount = m_aIconControl.GetEntryCount();\n    SvxIconChoiceCtrlEntry* pEntry = NULL;\n    for (ULONG i=0; i < nCount; ++i)\n    {\n        pEntry = m_aIconControl.GetEntry(i);\n        if ( pEntry && *static_cast<ElementType*>(pEntry->GetUserData()) == _eType )\n            break;\n        pEntry = NULL;\n    }\n    if ( pEntry )\n    {\n        m_aIconControl.SetCursor(pEntry);\n        OnContainerSelectHdl(&m_aIconControl);\n    }\n    else\n        m_eLastType = E_NONE;\n}\n<commit_msg>INTEGRATION: CWS dba202c (1.6.50); FILE MERGED 2005\/12\/05 10:20:07 oj 1.6.50.2: #i52615# system color 2005\/12\/01 13:23:21 oj 1.6.50.1: #i52615# datachanged overload<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: AppSwapWindow.cxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: kz $ $Date: 2006-01-03 16:16: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_APPSWAPWINDOW_HXX\n#include \"AppSwapWindow.hxx\"\n#endif\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n#ifndef _DBA_DBACCESS_HELPID_HRC_\n#include \"dbaccess_helpid.hrc\"\n#endif\n#ifndef _DBU_APP_HRC_\n#include \"dbu_app.hrc\"\n#endif\n#ifndef DBAUI_APPVIEW_HXX\n#include \"AppView.hxx\"\n#endif\n#ifndef DBAUI_IAPPELEMENTNOTIFICATION_HXX\n#include \"IAppElementNotification.hxx\"\n#endif\n#ifndef _DBAUI_MODULE_DBU_HXX_\n#include \"moduledbu.hxx\"\n#endif\n#ifndef _SV_SVAPP_HXX\n#include <vcl\/svapp.hxx>\n#endif\n#ifndef _SV_SYSWIN_HXX\n#include <vcl\/syswin.hxx>\n#endif\n#ifndef _SV_MENU_HXX\n#include <vcl\/menu.hxx>\n#endif\n#ifndef _SV_MNEMONIC_HXX\n#include <vcl\/mnemonic.hxx>\n#endif\n\n#include <memory>\n\nusing namespace ::dbaui;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::sdbc;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::container;\n\n\/\/==================================================================\n\/\/ class OApplicationSwapWindow\nDBG_NAME(OApplicationSwapWindow)\n\/\/==================================================================\nOApplicationSwapWindow::OApplicationSwapWindow(Window* _pParent,OAppBorderWindow* _pBorderWindow) : Control(_pParent,WB_DIALOGCONTROL )\n    ,m_aIconControl(this)\n    ,m_pBorderWin(_pBorderWindow)\n    ,m_eLastType(E_NONE)\n{\n    DBG_CTOR(OApplicationSwapWindow,NULL);\n\n    ImplInitSettings( sal_True, sal_True, sal_True );\n\n    m_aIconControl.SetClickHdl(LINK(this, OApplicationSwapWindow, OnContainerSelectHdl));\n    m_aIconControl.setControlActionListener(_pBorderWindow->getView()->getActionListener());\n    m_aIconControl.SetHelpId(HID_APP_SWAP_ICONCONTROL);\n    m_aIconControl.Show();\n    m_aIconControl.Enable(TRUE);\n}\n\/\/ -----------------------------------------------------------------------------\nOApplicationSwapWindow::~OApplicationSwapWindow()\n{\n\n    DBG_DTOR(OApplicationSwapWindow,NULL);\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OApplicationSwapWindow::Resize()\n{\n    Size aFLSize = LogicToPixel( Size( 8, 0 ), MAP_APPFONT );\n    long nX = 0;\n    if ( m_aIconControl.GetEntryCount() != 0 )\n        nX = m_aIconControl.GetBoundingBox( m_aIconControl.GetEntry(0) ).GetWidth() + aFLSize.Width();\n\n    Size aOutputSize = GetOutputSize();\n\n    m_aIconControl.SetPosSizePixel( Point(static_cast<long>((aOutputSize.Width() - nX)*0.5), 0)  ,Size(nX,aOutputSize.Height()));\n    m_aIconControl.ArrangeIcons();\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OApplicationSwapWindow::ImplInitSettings( sal_Bool bFont, sal_Bool bForeground, sal_Bool bBackground )\n{\n    const StyleSettings& rStyleSettings = GetSettings().GetStyleSettings();\n    if( bFont )\n    {\n        Font aFont;\n        aFont = rStyleSettings.GetFieldFont();\n        aFont.SetColor( rStyleSettings.GetWindowTextColor() );\n        SetPointFont( aFont );\n    }\n\n    if( bForeground || bFont )\n    {\n        SetTextColor( rStyleSettings.GetFieldTextColor() );\n        SetTextFillColor();\n    }\n\n    if( bBackground )\n        SetBackground( rStyleSettings.GetFieldColor() );\n}\n\/\/ -----------------------------------------------------------------------\nvoid OApplicationSwapWindow::DataChanged( const DataChangedEvent& rDCEvt )\n{\n    Window::DataChanged( rDCEvt );\n\n    if ( (rDCEvt.GetType() == DATACHANGED_SETTINGS) &&\n         (rDCEvt.GetFlags() & SETTINGS_STYLE) )\n    {\n        ImplInitSettings( sal_True, sal_True, sal_True );\n        Invalidate();\n    }\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OApplicationSwapWindow::clearSelection()\n{\n    m_aIconControl.SetNoSelection();\n    ULONG nPos = 0;\n    SvxIconChoiceCtrlEntry* pEntry = m_aIconControl.GetSelectedEntry(nPos);\n    if ( pEntry )\n        m_aIconControl.InvalidateEntry(pEntry);\n    m_aIconControl.GetClickHdl().Call(&m_aIconControl);\n}\n\n\/\/ -----------------------------------------------------------------------------\nvoid OApplicationSwapWindow::createIconAutoMnemonics()\n{\n    \/\/ we need to share our \"mnemonic space\" with the menu of the window we live in\n    MnemonicGenerator aMnemonicGenerator;\n    SystemWindow* pSystemWindow = GetSystemWindow();\n    MenuBar* pMenu = pSystemWindow ? pSystemWindow->GetMenuBar() : NULL;\n    if ( pMenu )\n    {\n        USHORT nMenuItems = pMenu->GetItemCount();\n        for ( USHORT i = 0; i < nMenuItems; ++i )\n            aMnemonicGenerator.RegisterMnemonic( pMenu->GetItemText( pMenu->GetItemId( i ) ) );\n    }\n\n    m_aIconControl.CreateAutoMnemonics( aMnemonicGenerator );\n}\n\n\/\/ -----------------------------------------------------------------------------\nbool OApplicationSwapWindow::interceptKeyInput( const KeyEvent& _rEvent )\n{\n    const KeyCode& rKeyCode = _rEvent.GetKeyCode();\n    if ( rKeyCode.GetModifier() == KEY_MOD2 )\n        return m_aIconControl.DoKeyInput( _rEvent );\n\n    \/\/ not intercepted\n    return false;\n}\n\n\/\/ -----------------------------------------------------------------------------\nElementType OApplicationSwapWindow::getElementType() const\n{\n    ULONG nPos = 0;\n    SvxIconChoiceCtrlEntry* pEntry = m_aIconControl.GetSelectedEntry(nPos);\n    return ( pEntry ) ? *static_cast<ElementType*>(pEntry->GetUserData()) : E_NONE;\n}\n\/\/ -----------------------------------------------------------------------------\nIMPL_LINK(OApplicationSwapWindow, OnContainerSelectHdl, SvtIconChoiceCtrl*, _pControl)\n{\n    ULONG nPos = 0;\n    SvxIconChoiceCtrlEntry* pEntry = _pControl->GetSelectedEntry( nPos );\n    ElementType eType = E_NONE;\n    if ( pEntry )\n        eType = *static_cast<ElementType*>(pEntry->GetUserData());\n\n    if ( m_eLastType != eType && eType != E_NONE )\n    {\n        if ( m_pBorderWin->getView()->getElementNotification()->onContainerSelect(eType) )\n            m_eLastType = eType;\n        else\n        {\n            PostUserEvent(LINK(this, OApplicationSwapWindow, ChangeToLastSelected));\n        }\n    }\n\n    return 1L;\n}\n\/\/------------------------------------------------------------------------------\nIMPL_LINK(OApplicationSwapWindow, ChangeToLastSelected, void*, EMPTYARG)\n{\n    changeContainer(m_eLastType);\n    return 0L;\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OApplicationSwapWindow::changeContainer(ElementType _eType)\n{\n    ULONG nCount = m_aIconControl.GetEntryCount();\n    SvxIconChoiceCtrlEntry* pEntry = NULL;\n    for (ULONG i=0; i < nCount; ++i)\n    {\n        pEntry = m_aIconControl.GetEntry(i);\n        if ( pEntry && *static_cast<ElementType*>(pEntry->GetUserData()) == _eType )\n            break;\n        pEntry = NULL;\n    }\n    if ( pEntry )\n    {\n        m_aIconControl.SetCursor(pEntry);\n        OnContainerSelectHdl(&m_aIconControl);\n    }\n    else\n        m_eLastType = E_NONE;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"stdsneezy.h\"\n#include \"database.h\"\n#include \"lowtools.h\"\n#include <unistd.h>\n\nint main(int argc, char **argv)\n{\n  TDatabase db(DB_SNEEZYBETA);\n  vector<int>vnums;\n  map<sstring,sstring>val;\n  char file[]=\"\/tmp\/sqledwldXXXXXX\";\n  FILE *tmpfile;\n  sstring buf, sbuf;\n  int answer;\n\n  if(argc<=1){\n    printf(\"Usage: sqledwld <vnum list>\\n\");\n    printf(\"Example: sqledwld 13700-13780 13791 13798\\n\");\n    exit(0);\n  }\n\n  if(!parse_num_args(argc-1, argv+1, vnums))\n    exit(0);\n\n  for(unsigned int i=0;i<vnums.size();++i){\n    printf(\"Fetching data for room %i\\n\", vnums[i]);\n\n    db.query(\"select * from room where vnum=%i\", vnums[i]);\n    if(db.fetchRow()){\n      buf = fmt(\"- room\\n\"); sbuf+=buf;\n      buf = fmt(\"vnum: %s\\n\") % db[\"vnum\"];  sbuf+=buf;\n      buf = fmt(\"x:    %s\\n\") % db[\"x\"];  sbuf+=buf;\n      buf = fmt(\"y:    %s\\n\") % db[\"y\"];  sbuf+=buf;\n      buf = fmt(\"z:    %s\\n\") % db[\"z\"];  sbuf+=buf;\n      buf = fmt(\"name: %s\\n\") % db[\"name\"];  sbuf+=buf;\n      buf = fmt(\"description~:\\n%s~\\n\") % db[\"description\"];  sbuf+=buf;\n      buf = fmt(\"room_flag: %s\\n\") % db[\"room_flag\"];  sbuf+=buf;\n      buf = fmt(\"sector:    %s\\n\") % db[\"sector\"];  sbuf+=buf;\n      buf = fmt(\"teletime:  %s\\n\") % db[\"teletime\"];  sbuf+=buf;\n      buf = fmt(\"teletarg:  %s\\n\") % db[\"teletarg\"];  sbuf+=buf;\n      buf = fmt(\"telelook:  %s\\n\") % db[\"telelook\"];  sbuf+=buf;\n      buf = fmt(\"river_speed: %s\\n\") % db[\"river_speed\"];  sbuf+=buf;\n      buf = fmt(\"river_dir: %s\\n\") % db[\"river_dir\"];  sbuf+=buf;\n      buf = fmt(\"capacity:  %s\\n\") % db[\"capacity\"];  sbuf+=buf;\n      buf = fmt(\"height:    %s\\n\") % db[\"height\"];  sbuf+=buf;\n      buf = fmt(\"\\n\"); sbuf+=buf;\n    }\n\n\n    db.query(\"select * from roomextra where vnum=%i\", vnums[i]);\n    while(db.fetchRow()){\n      buf = fmt(\"- roomextra\\n\"); sbuf+=buf;\n      buf = fmt(\"vnum: %s\\n\") % db[\"vnum\"];  sbuf+=buf;\n      buf = fmt(\"name: %s\\n\") % db[\"name\"];  sbuf+=buf;\n      buf = fmt(\"description~:\\n%s~\\n\") % db[\"description\"];  sbuf+=buf;\n      buf = fmt(\"\\n\"); sbuf+=buf;\n    }\n\n\n    db.query(\"select * from roomexit where vnum=%i\", vnums[i]);\n    while(db.fetchRow()){\n      buf = fmt(\"- roomexit\\n\"); sbuf+=buf;\n      buf = fmt(\"vnum:      %s\\n\") % db[\"vnum\"];  sbuf+=buf;\n      buf = fmt(\"direction: %s\\n\") % db[\"direction\"];  sbuf+=buf;\n      buf = fmt(\"name:      %s\\n\") % db[\"name\"];  sbuf+=buf;\n      buf = fmt(\"description~:\\n%s~\\n\") % db[\"description\"];  sbuf+=buf;\n      buf = fmt(\"type:      %s\\n\") % db[\"type\"];  sbuf+=buf;\n      buf = fmt(\"condition_flag: %s\\n\") % db[\"condition_flag\"]; sbuf+=buf;\n      buf = fmt(\"lock_difficulty: %s\\n\") % db[\"lock_difficulty\"]; sbuf+=buf;\n      buf = fmt(\"weight:    %s\\n\") % db[\"weight\"];  sbuf+=buf;\n      buf = fmt(\"key_num:   %s\\n\") % db[\"key_num\"];  sbuf+=buf;\n      buf = fmt(\"destination:      %s\\n\") % db[\"destination\"];  sbuf+=buf;\n      buf = fmt(\"\\n\"); sbuf+=buf;\n    }\n  }\n\n\n  mkstemp(file);\n  tmpfile=fopen(file, \"w\");\n  fprintf(tmpfile, \"%s\", sbuf.c_str());\n  fclose(tmpfile);\n\n  printf(\"Opening editor.\\n\");\n  buf = fmt(\"$EDITOR %s\") % file;\n  system(buf.c_str());\n\n\n  printf(\"Insert room%s? [y\/n] \", vnums.size()>1?\"s\":\"\");\n  while(1){\n    answer=getc(stdin);\n    if(answer=='n'){\n      printf(\"Room%s not inserted.\\n\", vnums.size()>1?\"s\":\"\");\n      unlink(file);\n      exit(0);\n    } else if(answer=='y'){\n      break;\n    } else {\n      printf(\"Insert room%s? [y\/n] \", vnums.size()>1?\"s\":\"\");\n    }\n  }\n\n  buf = fmt(\"\/bin\/cp -f %s %s.backup\") % file % file;\n  system(buf.c_str());\n\n\n  int i=0;\n\n  while(++i){\n    val=parse_data_file(file, i);\n    if(val[\"vnum\"]==\"EOM\")\n      break;\n    \n    if(val[\"DATATYPE\"]==\"room\"){\n      printf(\"replacing room %s\\n\", val[\"vnum\"].c_str());\n      db.query(\"delete from room where vnum=%s\",\n\t       val[\"vnum\"].c_str());\n      db.query(\"delete from roomextra where vnum=%s\",\n\t       val[\"vnum\"].c_str());\n      db.query(\"delete from roomexit where vnum=%s\",\n\t       val[\"vnum\"].c_str());\n\n  \n      \n      db.query(\"insert into room (vnum,x,y,z,name,description,room_flag,sector,teletime,teletarg,telelook,river_speed,river_dir,capacity,height,zone) values (%s,%s,%s,%s,'%s','%s',%s,%s,%s,%s,%s,%s,%s,%s,%s,-1)\",\n\t       val[\"vnum\"].c_str(),val[\"x\"].c_str(),val[\"y\"].c_str(),val[\"z\"].c_str(),val[\"name\"].c_str(),val[\"description\"].c_str(),val[\"room_flag\"].c_str(),val[\"sector\"].c_str(),val[\"teletime\"].c_str(),val[\"teletarg\"].c_str(),val[\"telelook\"].c_str(),val[\"river_speed\"].c_str(),val[\"river_dir\"].c_str(),val[\"capacity\"].c_str(),val[\"height\"].c_str());\n    } else if(val[\"DATATYPE\"]==\"roomextra\"){\n      printf(\"replacing roomextra %s\\n\", val[\"vnum\"].c_str());\n      \n      db.query(\"insert into roomextra (vnum, name, description) values (%s,'%s','%s')\", val[\"vnum\"].c_str(), val[\"name\"].c_str(), val[\"description\"].c_str());\n      \n    } else if(val[\"DATATYPE\"]==\"roomexit\"){\n      printf(\"replacing roomexit %s\\n\", val[\"vnum\"].c_str());\n      \n      db.query(\"insert into roomexit (vnum,direction,name,description,type,condition_flag,lock_difficulty,weight,key_num,destination) values (%s,%s,'%s','%s',%s,%s,%s,%s,%s,%s)\", \n\t       val[\"vnum\"].c_str(),val[\"direction\"].c_str(),val[\"name\"].c_str(),val[\"description\"].c_str(),val[\"type\"].c_str(),val[\"condition_flag\"].c_str(),val[\"lock_difficulty\"].c_str(),val[\"weight\"].c_str(),val[\"key_num\"].c_str(),val[\"destination\"].c_str());\n    }\n    printf(\"\\n\");\n\n  }\n\n\n  unlink(file);\n\n  printf(\"Done.\\n\\r\");\n  printf(\"Your backup file is %s.backup\\n\", file);\n}\n<commit_msg>now displays exit directions as text instead of numbers<commit_after>#include \"stdsneezy.h\"\n#include \"database.h\"\n#include \"lowtools.h\"\n#include <unistd.h>\n\nint txt2dir(sstring txt)\n{\n  for(int i=0;strcmp(dirs[i], \"\\n\");++i){\n    if(txt==dirs[i]){\n      return i;\n    }\n  }\n  return convertTo<int>(txt);\n}\n\nint main(int argc, char **argv)\n{\n  TDatabase db(DB_SNEEZYBETA);\n  vector<int>vnums;\n  map<sstring,sstring>val;\n  char file[]=\"\/tmp\/sqledwldXXXXXX\";\n  FILE *tmpfile;\n  sstring buf, sbuf;\n  int answer;\n\n  if(argc<=1){\n    printf(\"Usage: sqledwld <vnum list>\\n\");\n    printf(\"Example: sqledwld 13700-13780 13791 13798\\n\");\n    exit(0);\n  }\n\n  if(!parse_num_args(argc-1, argv+1, vnums))\n    exit(0);\n\n  for(unsigned int i=0;i<vnums.size();++i){\n    printf(\"Fetching data for room %i\\n\", vnums[i]);\n\n    db.query(\"select * from room where vnum=%i\", vnums[i]);\n    if(db.fetchRow()){\n      buf = fmt(\"- room\\n\"); sbuf+=buf;\n      buf = fmt(\"vnum: %s\\n\") % db[\"vnum\"];  sbuf+=buf;\n      buf = fmt(\"x:    %s\\n\") % db[\"x\"];  sbuf+=buf;\n      buf = fmt(\"y:    %s\\n\") % db[\"y\"];  sbuf+=buf;\n      buf = fmt(\"z:    %s\\n\") % db[\"z\"];  sbuf+=buf;\n      buf = fmt(\"name: %s\\n\") % db[\"name\"];  sbuf+=buf;\n      buf = fmt(\"description~:\\n%s~\\n\") % db[\"description\"];  sbuf+=buf;\n      buf = fmt(\"room_flag: %s\\n\") % db[\"room_flag\"];  sbuf+=buf;\n      buf = fmt(\"sector:    %s\\n\") % db[\"sector\"];  sbuf+=buf;\n      buf = fmt(\"teletime:  %s\\n\") % db[\"teletime\"];  sbuf+=buf;\n      buf = fmt(\"teletarg:  %s\\n\") % db[\"teletarg\"];  sbuf+=buf;\n      buf = fmt(\"telelook:  %s\\n\") % db[\"telelook\"];  sbuf+=buf;\n      buf = fmt(\"river_speed: %s\\n\") % db[\"river_speed\"];  sbuf+=buf;\n      buf = fmt(\"river_dir: %s\\n\") % db[\"river_dir\"];  sbuf+=buf;\n      buf = fmt(\"capacity:  %s\\n\") % db[\"capacity\"];  sbuf+=buf;\n      buf = fmt(\"height:    %s\\n\") % db[\"height\"];  sbuf+=buf;\n      buf = fmt(\"\\n\"); sbuf+=buf;\n    }\n\n\n    db.query(\"select * from roomextra where vnum=%i\", vnums[i]);\n    while(db.fetchRow()){\n      buf = fmt(\"- roomextra\\n\"); sbuf+=buf;\n      buf = fmt(\"vnum: %s\\n\") % db[\"vnum\"];  sbuf+=buf;\n      buf = fmt(\"name: %s\\n\") % db[\"name\"];  sbuf+=buf;\n      buf = fmt(\"description~:\\n%s~\\n\") % db[\"description\"];  sbuf+=buf;\n      buf = fmt(\"\\n\"); sbuf+=buf;\n    }\n\n\n    db.query(\"select * from roomexit where vnum=%i\", vnums[i]);\n    while(db.fetchRow()){\n      buf = fmt(\"- roomexit\\n\"); sbuf+=buf;\n      buf = fmt(\"vnum:      %s\\n\") % db[\"vnum\"];  sbuf+=buf;\n      buf = fmt(\"direction: %s\\n\") % dirs[convertTo<int>(db[\"direction\"])];\n      sbuf+=buf;\n      buf = fmt(\"name:      %s\\n\") % db[\"name\"];  sbuf+=buf;\n      buf = fmt(\"description~:\\n%s~\\n\") % db[\"description\"];  sbuf+=buf;\n      buf = fmt(\"type:      %s\\n\") % db[\"type\"];  sbuf+=buf;\n      buf = fmt(\"condition_flag: %s\\n\") % db[\"condition_flag\"]; sbuf+=buf;\n      buf = fmt(\"lock_difficulty: %s\\n\") % db[\"lock_difficulty\"]; sbuf+=buf;\n      buf = fmt(\"weight:    %s\\n\") % db[\"weight\"];  sbuf+=buf;\n      buf = fmt(\"key_num:   %s\\n\") % db[\"key_num\"];  sbuf+=buf;\n      buf = fmt(\"destination:      %s\\n\") % db[\"destination\"];  sbuf+=buf;\n      buf = fmt(\"\\n\"); sbuf+=buf;\n    }\n  }\n\n\n  mkstemp(file);\n  tmpfile=fopen(file, \"w\");\n  fprintf(tmpfile, \"%s\", sbuf.c_str());\n  fclose(tmpfile);\n\n  printf(\"Opening editor.\\n\");\n  buf = fmt(\"$EDITOR %s\") % file;\n  system(buf.c_str());\n\n\n  printf(\"Insert room%s? [y\/n] \", vnums.size()>1?\"s\":\"\");\n  while(1){\n    answer=getc(stdin);\n    if(answer=='n'){\n      printf(\"Room%s not inserted.\\n\", vnums.size()>1?\"s\":\"\");\n      unlink(file);\n      exit(0);\n    } else if(answer=='y'){\n      break;\n    } else {\n      printf(\"Insert room%s? [y\/n] \", vnums.size()>1?\"s\":\"\");\n    }\n  }\n\n  buf = fmt(\"\/bin\/cp -f %s %s.backup\") % file % file;\n  system(buf.c_str());\n\n\n  int i=0;\n\n  while(++i){\n    val=parse_data_file(file, i);\n    if(val[\"vnum\"]==\"EOM\")\n      break;\n    \n    if(val[\"DATATYPE\"]==\"room\"){\n      printf(\"replacing room %s\\n\", val[\"vnum\"].c_str());\n      db.query(\"delete from room where vnum=%s\",\n\t       val[\"vnum\"].c_str());\n      db.query(\"delete from roomextra where vnum=%s\",\n\t       val[\"vnum\"].c_str());\n      db.query(\"delete from roomexit where vnum=%s\",\n\t       val[\"vnum\"].c_str());\n\n  \n      \n      db.query(\"insert into room (vnum,x,y,z,name,description,room_flag,sector,teletime,teletarg,telelook,river_speed,river_dir,capacity,height,zone) values (%s,%s,%s,%s,'%s','%s',%s,%s,%s,%s,%s,%s,%s,%s,%s,-1)\",\n\t       val[\"vnum\"].c_str(),val[\"x\"].c_str(),val[\"y\"].c_str(),val[\"z\"].c_str(),val[\"name\"].c_str(),val[\"description\"].c_str(),val[\"room_flag\"].c_str(),val[\"sector\"].c_str(),val[\"teletime\"].c_str(),val[\"teletarg\"].c_str(),val[\"telelook\"].c_str(),val[\"river_speed\"].c_str(),val[\"river_dir\"].c_str(),val[\"capacity\"].c_str(),val[\"height\"].c_str());\n    } else if(val[\"DATATYPE\"]==\"roomextra\"){\n      printf(\"replacing roomextra %s\\n\", val[\"vnum\"].c_str());\n      \n      db.query(\"insert into roomextra (vnum, name, description) values (%s,'%s','%s')\", val[\"vnum\"].c_str(), val[\"name\"].c_str(), val[\"description\"].c_str());\n      \n    } else if(val[\"DATATYPE\"]==\"roomexit\"){\n      printf(\"replacing roomexit %s\\n\", val[\"vnum\"].c_str());\n      \n      db.query(\"insert into roomexit (vnum,direction,name,description,type,condition_flag,lock_difficulty,weight,key_num,destination) values (%s,%i,'%s','%s',%s,%s,%s,%s,%s,%s)\", \n\t       val[\"vnum\"].c_str(),txt2dir(val[\"direction\"]),val[\"name\"].c_str(),val[\"description\"].c_str(),val[\"type\"].c_str(),val[\"condition_flag\"].c_str(),val[\"lock_difficulty\"].c_str(),val[\"weight\"].c_str(),val[\"key_num\"].c_str(),val[\"destination\"].c_str());\n    }\n    printf(\"\\n\");\n\n  }\n\n\n  unlink(file);\n\n  printf(\"Done.\\n\\r\");\n  printf(\"Your backup file is %s.backup\\n\", file);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/----------------------------  thread_management.cc  ---------------------------\n\/\/    $Id$\n\/\/    Version: $Name$\n\/\/\n\/\/    Copyright (C) 2000, 2001, 2002 by the deal.II authors\n\/\/\n\/\/    This file is subject to QPL and may not be  distributed\n\/\/    without copyright and license information. Please refer\n\/\/    to the file deal.II\/doc\/license.html for the  text  and\n\/\/    further information on this license.\n\/\/\n\/\/----------------------------  thread_management.cc  ---------------------------\n\n\n#include <base\/thread_management.h>\n#ifdef DEAL_II_USE_MT_POSIX\n#  include <list>\n#endif\n\n\nnamespace Threads \n{\n                                   \/\/ counter and access mutex for the\n                                   \/\/ number of threads\n  volatile unsigned int n_existing_threads_counter = 1;\n  ThreadMutex  n_existing_threads_mutex;\n\n  \n  void register_new_thread () \n  {\n    n_existing_threads_mutex.acquire ();\n    ++n_existing_threads_counter;\n    n_existing_threads_mutex.release ();\n  };\n\n\n  \n  void deregister_new_thread () \n  {\n    n_existing_threads_mutex.acquire ();\n    --n_existing_threads_counter;\n    Assert (n_existing_threads_counter >= 1,\n            ExcInternalError());\n    n_existing_threads_mutex.release ();\n  };\n\n\n\n  void handle_std_exception (const std::exception &exc) \n  {\n    std::cerr << std::endl << std::endl\n              << \"---------------------------------------------------------\"\n              << std::endl\n              << \"In one of the sub-threads of this program, an exception\\n\"\n              << \"was thrown and not caught. Since exceptions do not\\n\"\n              << \"propagate to the main thread, the library has caught it.\\n\"\n              << \"The information carried by this exception is given below.\\n\"\n              << std::endl\n              << \"---------------------------------------------------------\"\n              << std::endl;\n    std::cerr << \"Exception on processing: \" << std::endl\n              << exc.what() << std::endl\n              << \"Aborting!\" << std::endl\n              << \"---------------------------------------------------------\"\n              << std::endl;\n    std::abort ();\n  };\n\n\n\n  void handle_unknown_exception ()\n  {\n    std::cerr << std::endl << std::endl\n              << \"---------------------------------------------------------\"\n              << std::endl\n              << \"In one of the sub-threads of this program, an exception\\n\"\n              << \"was thrown and not caught. Since exceptions do not\\n\"\n              << \"propagate to the main thread, the library has caught it.\\n\"\n              << \"The information carried by this exception is given below.\\n\"\n              << std::endl\n              << \"---------------------------------------------------------\"\n              << std::endl;\n    std::cerr << \"Type of exception is unknown, but not std::exception.\\n\"\n              << \"No additional information is available.\\n\"\n              << \"---------------------------------------------------------\"\n              << std::endl;\n    std::abort ();\n  };\n  \n\n  \n  unsigned int n_existing_threads () \n  {\n    n_existing_threads_mutex.acquire ();\n    const unsigned int n = n_existing_threads_counter;\n    n_existing_threads_mutex.release ();\n    return n;\n  };\n  \n  \n#ifndef DEAL_II_USE_MT\n  void DummyThreadManager::spawn (const FunPtr fun_ptr,\n\t\t\t\t  void *       fun_data,\n\t\t\t\t  int          \/*flags*\/) const\n  {\n    (*fun_ptr) (fun_data);\n  };\n  \n\n  \n  DummyBarrier::DummyBarrier (const unsigned int  count,\n\t\t\t      const char         *,\n\t\t\t      void               *)\n  {\n    Assert (count == 1, ExcBarrierSizeNotUseful(count));\n  };\n\n\n#else\n#  ifdef DEAL_II_USE_MT_POSIX\n\n  PosixThreadMutex::PosixThreadMutex ()\n  {\n    pthread_mutex_init (&mutex, 0);\n  };\n\n\n\n  PosixThreadMutex::~PosixThreadMutex ()\n  {\n    pthread_mutex_destroy (&mutex);\n  };\n  \n\n#ifndef DEAL_II_USE_MT_POSIX_NO_BARRIERS    \n  PosixThreadBarrier::PosixThreadBarrier (const unsigned int  count,\n\t\t\t\t\t  const char         *,\n\t\t\t\t\t  void               *)\n  {\n    pthread_barrier_init (&barrier, 0, count);\n  };\n\n#else\n\n  PosixThreadBarrier::PosixThreadBarrier (const unsigned int  count,\n\t\t\t\t\t  const char         *,\n\t\t\t\t\t  void               *)\n                  : count (count)\n  {\n                                     \/\/ throw an exception unless we\n                                     \/\/ have the special case that a\n                                     \/\/ count of 1 is given, since\n                                     \/\/ then waiting for a barrier is\n                                     \/\/ a no-op, and we don't need the\n                                     \/\/ POSIX functionality\n    AssertThrow (count == 1,\n\t\t ExcMessage (\"Your local POSIX installation does not support\\n\"\n\t\t\t     \"POSIX barriers. You will not be able to use\\n\"\n\t\t\t     \"this class, but the rest of the threading\\n\"\n\t\t\t     \"functionality is available.\"));\n  };\n#endif\n\n\n\n  PosixThreadBarrier::~PosixThreadBarrier ()\n  {\n#ifndef DEAL_II_USE_MT_POSIX_NO_BARRIERS\n    pthread_barrier_destroy (&barrier);\n#else\n                                     \/\/ unless the barrier is a no-op,\n                                     \/\/ complain again (how did we get\n                                     \/\/ here then?)\n    if (count != 1)\n      std::abort ();\n#endif\n  };\n\n\n\n  int\n  PosixThreadBarrier::wait ()\n  {\n#ifndef DEAL_II_USE_MT_POSIX_NO_BARRIERS    \n    return pthread_barrier_wait (&barrier);\n#else\n                                     \/\/ in the special case, this\n                                     \/\/ function is a no-op. otherwise\n                                     \/\/ complain about the missing\n                                     \/\/ POSIX functions\n    if (count == 1)\n      return 0;\n    else\n      {\n        std::abort ();\n        return 1;\n      };\n#endif\n  };\n  \n\n\n  PosixThreadManager::PosixThreadManager ()\n\t\t  :\n\t\t  thread_id_list (new std::list<pthread_t>())\n  {};\n\n\n  PosixThreadManager::~PosixThreadManager ()\n  {\n\t\t\t\t     \/\/ wait for all threads, and\n\t\t\t\t     \/\/ release memory\n    wait ();\n    delete reinterpret_cast<std::list<pthread_t>*>(thread_id_list);\n  };\n\n\n\n  void\n  PosixThreadManager::spawn (const FunPtr fun_ptr,\n\t\t\t     void *       fun_data,\n\t\t\t     int)\n  {\n    std::list<pthread_t> &tid_list\n      = *reinterpret_cast<std::list<pthread_t>*>(thread_id_list);\n\n    tid_list.push_back (pthread_t());\n\n                                     \/\/ start new thread\n    const int error\n      = pthread_create (&tid_list.back(), 0, fun_ptr, fun_data);\n\n    Assert (error == 0, ExcInternalError());\n  };\n  \n\n\n  void\n  PosixThreadManager::wait () const\n  {\n    std::list<pthread_t> &tid_list\n      = *reinterpret_cast<std::list<pthread_t>*>(thread_id_list);\n\n    for (std::list<pthread_t>::iterator i=tid_list.begin();\n\t i != tid_list.end(); ++i)\n      pthread_join (*i, 0);\n  };\n  \n#  endif\n#endif  \n  \n  FunDataCounter::FunDataCounter () :\n\t\t  n_fun_encapsulation_objects (0),\n\t\t  n_fun_data_base_objects (0)\n  {};\n  \n\n  \n  FunDataCounter::~FunDataCounter () \n  {   \n    AssertThrow (n_fun_encapsulation_objects == 0,\n\t\t ExcObjectsExist(\"FunEncapsulation\", n_fun_encapsulation_objects));\n    AssertThrow (n_fun_data_base_objects == 0,\n\t\t ExcObjectsExist(\"FunDataBase\", n_fun_data_base_objects));\n  };\n      \n\n\n\/**\n * This is the global object which we will use to count the number of\n * threads generated, and which is used to complain when there is a\n * memory leak.\n *\/\n  FunDataCounter fun_data_counter;\n\n\n  FunEncapsulation::FunEncapsulation () :\n\t\t  fun_data_base (0)\n  {\n\t\t\t\t     \/\/ keep some statistics on the\n\t\t\t\t     \/\/ number of variables around\n    ++fun_data_counter.n_fun_encapsulation_objects;\n  };\n\n\n\n  FunEncapsulation::FunEncapsulation (FunDataBase *fun_data_base) :\n\t\t  fun_data_base (fun_data_base)\n  {\n\t\t\t\t     \/\/ keep some statistics on the\n\t\t\t\t     \/\/ number of variables around\n    ++fun_data_counter.n_fun_encapsulation_objects;\n  };\n\n\n\n  FunEncapsulation::FunEncapsulation (const FunEncapsulation &fun_data) :\n\t\t  fun_data_base (fun_data.fun_data_base->clone ())\n  {\n\t\t\t\t     \/\/ keep some statistics on the\n\t\t\t\t     \/\/ number of variables around\n    ++fun_data_counter.n_fun_encapsulation_objects;\n  };\n\n\n  FunEncapsulation::~FunEncapsulation ()\n  {\n\t\t\t\t     \/\/ wait until the data in\n\t\t\t\t     \/\/ fun_data_base has been copied\n\t\t\t\t     \/\/ and is no more needed\n    fun_data_base->lock.acquire();\n\t\t\t\t     \/\/ now that we have got the lock,\n\t\t\t\t     \/\/ we can delete the data\n    delete fun_data_base;\n    fun_data_base = 0;\n\n\t\t\t\t   \/\/ keep some statistics on the\n\t\t\t\t   \/\/ number of variables around\n    --fun_data_counter.n_fun_encapsulation_objects;\n  };\n    \n\n  const FunEncapsulation &\n  FunEncapsulation::operator = (const FunEncapsulation &\/*fun_data*\/)\n  {\n\t\t\t\t     \/\/ this is not implemented at\n\t\t\t\t     \/\/ present. return dummy value\n\t\t\t\t     \/\/ instead\n    Assert (false, ExcNotImplemented());\n    const FunEncapsulation * const p = 0;\n    return *p;\n  };\n\n\n\n  FunDataBase::FunDataBase (const ThreadEntryPoint thread_entry_point) :\n\t\t  thread_entry_point (thread_entry_point)\n  {\n\t\t\t\t     \/\/ keep some statistics on the\n\t\t\t\t     \/\/ number of variables around\n    ++fun_data_counter.n_fun_data_base_objects;\n  };\n\n\n\n  FunDataBase::FunDataBase (const FunDataBase &fun_data_base) :\n\t\t  thread_entry_point (fun_data_base.thread_entry_point)\n  {\n\t\t\t\t     \/\/ keep some statistics on the\n\t\t\t\t     \/\/ number of variables around\n    ++fun_data_counter.n_fun_data_base_objects;\n  };\n\n\n\n  FunDataBase::~FunDataBase ()\n  {\n\t\t\t\t     \/\/ invalidate pointer for security\n\t\t\t\t     \/\/ reasons. accesses to this\n\t\t\t\t     \/\/ pointer after lifetime of this\n\t\t\t\t     \/\/ object will then fail\n    thread_entry_point = 0;\n\n\t\t\t\t     \/\/ keep some statistics on the\n\t\t\t\t     \/\/ number of variables around\n    --fun_data_counter.n_fun_data_base_objects;\n  };\n\n\n    \n  void spawn (ThreadManager          &thread_manager,\n\t      const FunEncapsulation &fun_data)\n  {\n\t\t\t\t     \/\/ lock the @p{fun_data_base} object\n\t\t\t\t     \/\/ to avoid destruction while its\n\t\t\t\t     \/\/ data is still accessed. the lock\n\t\t\t\t     \/\/ is released by the new thread\n\t\t\t\t     \/\/ once it has copied all data\n    fun_data.fun_data_base->lock.acquire ();\n\t\t\t\t     \/\/ now start the new thread\n#ifdef DEAL_II_USE_MT\n#  if defined(DEAL_II_USE_MT_ACE)\n    thread_manager.spawn (*fun_data.fun_data_base->thread_entry_point,\n\t\t\t  (void*)&fun_data,\n\t\t\t  THR_SCOPE_SYSTEM | THR_DETACHED);\n#  elif defined(DEAL_II_USE_MT_POSIX)\n    thread_manager.spawn (*fun_data.fun_data_base->thread_entry_point,\n\t\t\t  (void*)&fun_data,\n\t\t\t  0);    \n#  endif\n    \n#else\n                                     \/\/ if not in MT mode, then simply\n                                     \/\/ call the respective\n                                     \/\/ serializing function, that\n                                     \/\/ executes the given function\n                                     \/\/ and return\n    thread_manager.spawn (*fun_data.fun_data_base->thread_entry_point,\n\t\t\t  (void*)&fun_data,\n\t\t\t  0);\n#endif\n  };\n\n\n  \n  void spawn_n (ThreadManager          &thread_manager,\n\t\tconst FunEncapsulation &fun_data,\n\t\tconst unsigned int      n_threads)\n  {\n    for (unsigned int i=0; i<n_threads; ++i)\n      spawn (thread_manager, fun_data);\n  };\n  \n\n\n\n  std::vector<std::pair<unsigned int,unsigned int> >\n  split_interval (const unsigned int begin,\n\t\t  const unsigned int end,\n\t\t  const unsigned int n_intervals)\n  {\n    Assert (end >= begin, ExcInternalError());\n    \n    const unsigned int n_elements              = end-begin;\n    const unsigned int n_elements_per_interval = n_elements \/ n_intervals;\n    const unsigned int residual                = n_elements % n_intervals;\n    \n    std::vector<std::pair<unsigned int,unsigned int> > return_values (n_intervals);\n\n    return_values[0].first = begin;\n    for (unsigned int i=0; i<n_intervals; ++i)\n      {\n\tif (i != n_intervals-1) \n\t  {\n\t    return_values[i].second = (return_values[i].first\n\t\t\t\t       + n_elements_per_interval);\n\t\t\t\t\t     \/\/ distribute residual in\n\t\t\t\t\t     \/\/ division equally among\n\t\t\t\t\t     \/\/ the first few\n\t\t\t\t\t     \/\/ subintervals\n\t    if (i < residual)\n\t      ++return_values[i].second;\n\t    return_values[i+1].first = return_values[i].second;\n\t  }\n\telse\n\t  return_values[i].second = end;\n      };\n    return return_values;\n  };  \n  \n  \n \n};   \/\/ end namespace Threads\n<commit_msg>Add forgotten header.<commit_after>\/\/----------------------------  thread_management.cc  ---------------------------\n\/\/    $Id$\n\/\/    Version: $Name$\n\/\/\n\/\/    Copyright (C) 2000, 2001, 2002 by the deal.II authors\n\/\/\n\/\/    This file is subject to QPL and may not be  distributed\n\/\/    without copyright and license information. Please refer\n\/\/    to the file deal.II\/doc\/license.html for the  text  and\n\/\/    further information on this license.\n\/\/\n\/\/----------------------------  thread_management.cc  ---------------------------\n\n\n#include <base\/thread_management.h>\n#include <iostream>\n#ifdef DEAL_II_USE_MT_POSIX\n#  include <list>\n#endif\n\n\nnamespace Threads \n{\n                                   \/\/ counter and access mutex for the\n                                   \/\/ number of threads\n  volatile unsigned int n_existing_threads_counter = 1;\n  ThreadMutex  n_existing_threads_mutex;\n\n  \n  void register_new_thread () \n  {\n    n_existing_threads_mutex.acquire ();\n    ++n_existing_threads_counter;\n    n_existing_threads_mutex.release ();\n  };\n\n\n  \n  void deregister_new_thread () \n  {\n    n_existing_threads_mutex.acquire ();\n    --n_existing_threads_counter;\n    Assert (n_existing_threads_counter >= 1,\n            ExcInternalError());\n    n_existing_threads_mutex.release ();\n  };\n\n\n\n  void handle_std_exception (const std::exception &exc) \n  {\n    std::cerr << std::endl << std::endl\n              << \"---------------------------------------------------------\"\n              << std::endl\n              << \"In one of the sub-threads of this program, an exception\\n\"\n              << \"was thrown and not caught. Since exceptions do not\\n\"\n              << \"propagate to the main thread, the library has caught it.\\n\"\n              << \"The information carried by this exception is given below.\\n\"\n              << std::endl\n              << \"---------------------------------------------------------\"\n              << std::endl;\n    std::cerr << \"Exception on processing: \" << std::endl\n              << exc.what() << std::endl\n              << \"Aborting!\" << std::endl\n              << \"---------------------------------------------------------\"\n              << std::endl;\n    std::abort ();\n  };\n\n\n\n  void handle_unknown_exception ()\n  {\n    std::cerr << std::endl << std::endl\n              << \"---------------------------------------------------------\"\n              << std::endl\n              << \"In one of the sub-threads of this program, an exception\\n\"\n              << \"was thrown and not caught. Since exceptions do not\\n\"\n              << \"propagate to the main thread, the library has caught it.\\n\"\n              << \"The information carried by this exception is given below.\\n\"\n              << std::endl\n              << \"---------------------------------------------------------\"\n              << std::endl;\n    std::cerr << \"Type of exception is unknown, but not std::exception.\\n\"\n              << \"No additional information is available.\\n\"\n              << \"---------------------------------------------------------\"\n              << std::endl;\n    std::abort ();\n  };\n  \n\n  \n  unsigned int n_existing_threads () \n  {\n    n_existing_threads_mutex.acquire ();\n    const unsigned int n = n_existing_threads_counter;\n    n_existing_threads_mutex.release ();\n    return n;\n  };\n  \n  \n#ifndef DEAL_II_USE_MT\n  void DummyThreadManager::spawn (const FunPtr fun_ptr,\n\t\t\t\t  void *       fun_data,\n\t\t\t\t  int          \/*flags*\/) const\n  {\n    (*fun_ptr) (fun_data);\n  };\n  \n\n  \n  DummyBarrier::DummyBarrier (const unsigned int  count,\n\t\t\t      const char         *,\n\t\t\t      void               *)\n  {\n    Assert (count == 1, ExcBarrierSizeNotUseful(count));\n  };\n\n\n#else\n#  ifdef DEAL_II_USE_MT_POSIX\n\n  PosixThreadMutex::PosixThreadMutex ()\n  {\n    pthread_mutex_init (&mutex, 0);\n  };\n\n\n\n  PosixThreadMutex::~PosixThreadMutex ()\n  {\n    pthread_mutex_destroy (&mutex);\n  };\n  \n\n#ifndef DEAL_II_USE_MT_POSIX_NO_BARRIERS    \n  PosixThreadBarrier::PosixThreadBarrier (const unsigned int  count,\n\t\t\t\t\t  const char         *,\n\t\t\t\t\t  void               *)\n  {\n    pthread_barrier_init (&barrier, 0, count);\n  };\n\n#else\n\n  PosixThreadBarrier::PosixThreadBarrier (const unsigned int  count,\n\t\t\t\t\t  const char         *,\n\t\t\t\t\t  void               *)\n                  : count (count)\n  {\n                                     \/\/ throw an exception unless we\n                                     \/\/ have the special case that a\n                                     \/\/ count of 1 is given, since\n                                     \/\/ then waiting for a barrier is\n                                     \/\/ a no-op, and we don't need the\n                                     \/\/ POSIX functionality\n    AssertThrow (count == 1,\n\t\t ExcMessage (\"Your local POSIX installation does not support\\n\"\n\t\t\t     \"POSIX barriers. You will not be able to use\\n\"\n\t\t\t     \"this class, but the rest of the threading\\n\"\n\t\t\t     \"functionality is available.\"));\n  };\n#endif\n\n\n\n  PosixThreadBarrier::~PosixThreadBarrier ()\n  {\n#ifndef DEAL_II_USE_MT_POSIX_NO_BARRIERS\n    pthread_barrier_destroy (&barrier);\n#else\n                                     \/\/ unless the barrier is a no-op,\n                                     \/\/ complain again (how did we get\n                                     \/\/ here then?)\n    if (count != 1)\n      std::abort ();\n#endif\n  };\n\n\n\n  int\n  PosixThreadBarrier::wait ()\n  {\n#ifndef DEAL_II_USE_MT_POSIX_NO_BARRIERS    \n    return pthread_barrier_wait (&barrier);\n#else\n                                     \/\/ in the special case, this\n                                     \/\/ function is a no-op. otherwise\n                                     \/\/ complain about the missing\n                                     \/\/ POSIX functions\n    if (count == 1)\n      return 0;\n    else\n      {\n        std::abort ();\n        return 1;\n      };\n#endif\n  };\n  \n\n\n  PosixThreadManager::PosixThreadManager ()\n\t\t  :\n\t\t  thread_id_list (new std::list<pthread_t>())\n  {};\n\n\n  PosixThreadManager::~PosixThreadManager ()\n  {\n\t\t\t\t     \/\/ wait for all threads, and\n\t\t\t\t     \/\/ release memory\n    wait ();\n    delete reinterpret_cast<std::list<pthread_t>*>(thread_id_list);\n  };\n\n\n\n  void\n  PosixThreadManager::spawn (const FunPtr fun_ptr,\n\t\t\t     void *       fun_data,\n\t\t\t     int)\n  {\n    std::list<pthread_t> &tid_list\n      = *reinterpret_cast<std::list<pthread_t>*>(thread_id_list);\n\n    tid_list.push_back (pthread_t());\n\n                                     \/\/ start new thread\n    const int error\n      = pthread_create (&tid_list.back(), 0, fun_ptr, fun_data);\n\n    Assert (error == 0, ExcInternalError());\n  };\n  \n\n\n  void\n  PosixThreadManager::wait () const\n  {\n    std::list<pthread_t> &tid_list\n      = *reinterpret_cast<std::list<pthread_t>*>(thread_id_list);\n\n    for (std::list<pthread_t>::iterator i=tid_list.begin();\n\t i != tid_list.end(); ++i)\n      pthread_join (*i, 0);\n  };\n  \n#  endif\n#endif  \n  \n  FunDataCounter::FunDataCounter () :\n\t\t  n_fun_encapsulation_objects (0),\n\t\t  n_fun_data_base_objects (0)\n  {};\n  \n\n  \n  FunDataCounter::~FunDataCounter () \n  {   \n    AssertThrow (n_fun_encapsulation_objects == 0,\n\t\t ExcObjectsExist(\"FunEncapsulation\", n_fun_encapsulation_objects));\n    AssertThrow (n_fun_data_base_objects == 0,\n\t\t ExcObjectsExist(\"FunDataBase\", n_fun_data_base_objects));\n  };\n      \n\n\n\/**\n * This is the global object which we will use to count the number of\n * threads generated, and which is used to complain when there is a\n * memory leak.\n *\/\n  FunDataCounter fun_data_counter;\n\n\n  FunEncapsulation::FunEncapsulation () :\n\t\t  fun_data_base (0)\n  {\n\t\t\t\t     \/\/ keep some statistics on the\n\t\t\t\t     \/\/ number of variables around\n    ++fun_data_counter.n_fun_encapsulation_objects;\n  };\n\n\n\n  FunEncapsulation::FunEncapsulation (FunDataBase *fun_data_base) :\n\t\t  fun_data_base (fun_data_base)\n  {\n\t\t\t\t     \/\/ keep some statistics on the\n\t\t\t\t     \/\/ number of variables around\n    ++fun_data_counter.n_fun_encapsulation_objects;\n  };\n\n\n\n  FunEncapsulation::FunEncapsulation (const FunEncapsulation &fun_data) :\n\t\t  fun_data_base (fun_data.fun_data_base->clone ())\n  {\n\t\t\t\t     \/\/ keep some statistics on the\n\t\t\t\t     \/\/ number of variables around\n    ++fun_data_counter.n_fun_encapsulation_objects;\n  };\n\n\n  FunEncapsulation::~FunEncapsulation ()\n  {\n\t\t\t\t     \/\/ wait until the data in\n\t\t\t\t     \/\/ fun_data_base has been copied\n\t\t\t\t     \/\/ and is no more needed\n    fun_data_base->lock.acquire();\n\t\t\t\t     \/\/ now that we have got the lock,\n\t\t\t\t     \/\/ we can delete the data\n    delete fun_data_base;\n    fun_data_base = 0;\n\n\t\t\t\t   \/\/ keep some statistics on the\n\t\t\t\t   \/\/ number of variables around\n    --fun_data_counter.n_fun_encapsulation_objects;\n  };\n    \n\n  const FunEncapsulation &\n  FunEncapsulation::operator = (const FunEncapsulation &\/*fun_data*\/)\n  {\n\t\t\t\t     \/\/ this is not implemented at\n\t\t\t\t     \/\/ present. return dummy value\n\t\t\t\t     \/\/ instead\n    Assert (false, ExcNotImplemented());\n    const FunEncapsulation * const p = 0;\n    return *p;\n  };\n\n\n\n  FunDataBase::FunDataBase (const ThreadEntryPoint thread_entry_point) :\n\t\t  thread_entry_point (thread_entry_point)\n  {\n\t\t\t\t     \/\/ keep some statistics on the\n\t\t\t\t     \/\/ number of variables around\n    ++fun_data_counter.n_fun_data_base_objects;\n  };\n\n\n\n  FunDataBase::FunDataBase (const FunDataBase &fun_data_base) :\n\t\t  thread_entry_point (fun_data_base.thread_entry_point)\n  {\n\t\t\t\t     \/\/ keep some statistics on the\n\t\t\t\t     \/\/ number of variables around\n    ++fun_data_counter.n_fun_data_base_objects;\n  };\n\n\n\n  FunDataBase::~FunDataBase ()\n  {\n\t\t\t\t     \/\/ invalidate pointer for security\n\t\t\t\t     \/\/ reasons. accesses to this\n\t\t\t\t     \/\/ pointer after lifetime of this\n\t\t\t\t     \/\/ object will then fail\n    thread_entry_point = 0;\n\n\t\t\t\t     \/\/ keep some statistics on the\n\t\t\t\t     \/\/ number of variables around\n    --fun_data_counter.n_fun_data_base_objects;\n  };\n\n\n    \n  void spawn (ThreadManager          &thread_manager,\n\t      const FunEncapsulation &fun_data)\n  {\n\t\t\t\t     \/\/ lock the @p{fun_data_base} object\n\t\t\t\t     \/\/ to avoid destruction while its\n\t\t\t\t     \/\/ data is still accessed. the lock\n\t\t\t\t     \/\/ is released by the new thread\n\t\t\t\t     \/\/ once it has copied all data\n    fun_data.fun_data_base->lock.acquire ();\n\t\t\t\t     \/\/ now start the new thread\n#ifdef DEAL_II_USE_MT\n#  if defined(DEAL_II_USE_MT_ACE)\n    thread_manager.spawn (*fun_data.fun_data_base->thread_entry_point,\n\t\t\t  (void*)&fun_data,\n\t\t\t  THR_SCOPE_SYSTEM | THR_DETACHED);\n#  elif defined(DEAL_II_USE_MT_POSIX)\n    thread_manager.spawn (*fun_data.fun_data_base->thread_entry_point,\n\t\t\t  (void*)&fun_data,\n\t\t\t  0);    \n#  endif\n    \n#else\n                                     \/\/ if not in MT mode, then simply\n                                     \/\/ call the respective\n                                     \/\/ serializing function, that\n                                     \/\/ executes the given function\n                                     \/\/ and return\n    thread_manager.spawn (*fun_data.fun_data_base->thread_entry_point,\n\t\t\t  (void*)&fun_data,\n\t\t\t  0);\n#endif\n  };\n\n\n  \n  void spawn_n (ThreadManager          &thread_manager,\n\t\tconst FunEncapsulation &fun_data,\n\t\tconst unsigned int      n_threads)\n  {\n    for (unsigned int i=0; i<n_threads; ++i)\n      spawn (thread_manager, fun_data);\n  };\n  \n\n\n\n  std::vector<std::pair<unsigned int,unsigned int> >\n  split_interval (const unsigned int begin,\n\t\t  const unsigned int end,\n\t\t  const unsigned int n_intervals)\n  {\n    Assert (end >= begin, ExcInternalError());\n    \n    const unsigned int n_elements              = end-begin;\n    const unsigned int n_elements_per_interval = n_elements \/ n_intervals;\n    const unsigned int residual                = n_elements % n_intervals;\n    \n    std::vector<std::pair<unsigned int,unsigned int> > return_values (n_intervals);\n\n    return_values[0].first = begin;\n    for (unsigned int i=0; i<n_intervals; ++i)\n      {\n\tif (i != n_intervals-1) \n\t  {\n\t    return_values[i].second = (return_values[i].first\n\t\t\t\t       + n_elements_per_interval);\n\t\t\t\t\t     \/\/ distribute residual in\n\t\t\t\t\t     \/\/ division equally among\n\t\t\t\t\t     \/\/ the first few\n\t\t\t\t\t     \/\/ subintervals\n\t    if (i < residual)\n\t      ++return_values[i].second;\n\t    return_values[i+1].first = return_values[i].second;\n\t  }\n\telse\n\t  return_values[i].second = end;\n      };\n    return return_values;\n  };  \n  \n  \n \n};   \/\/ end namespace Threads\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 <comphelper\/processfactory.hxx>\n#include <string.h>\n#include \"ordinalsuffix.hxx\"\n\n#include <unicode\/rbnf.h>\n#include <unicode\/normlzr.h>\n\n#define CSTR( ouStr ) rtl::OUStringToOString( ouStr, RTL_TEXTENCODING_UTF8 ).getStr( )\n\nusing namespace ::com::sun::star::i18n;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star;\nusing namespace ::rtl;\n\nnamespace com { namespace sun { namespace star { namespace i18n {\n\n\nOrdinalSuffix::OrdinalSuffix(\n        const com::sun::star::uno::Reference < com::sun::star::lang::XMultiServiceFactory >& rxMSF) :\n    _xServiceManager( rxMSF )\n{\n}\n\nOrdinalSuffix::~OrdinalSuffix()\n{\n}\n\n\n\/*\n * For this method to properly return the ordinal suffix for other locales\n * than english ones, ICU 4.2+ has to be used.\n *\/\nuno::Sequence< OUString > SAL_CALL OrdinalSuffix::getOrdinalSuffix( sal_Int32 nNumber,\n        const lang::Locale &aLocale ) throw( RuntimeException )\n{\n    uno::Sequence< OUString > retValue;\n\n    \/\/ Get the value from ICU\n    UErrorCode nCode = U_ZERO_ERROR;\n    const icu::Locale rIcuLocale(\n            CSTR( aLocale.Language ),\n            CSTR( aLocale.Country ),\n            CSTR( aLocale.Variant ) );\n    icu::RuleBasedNumberFormat formatter(\n            icu::URBNF_ORDINAL, rIcuLocale, nCode );\n\n    if ( U_SUCCESS( nCode ) )\n    {\n        int32_t nRuleSets = formatter.getNumberOfRuleSetNames( );\n        for ( int32_t i = 0; i < nRuleSets; i++ )\n        {\n            icu::UnicodeString ruleSet = formatter.getRuleSetName( i );\n            \/\/ format the string\n            icu::UnicodeString icuRet;\n            icu::FieldPosition icuPos;\n            formatter.format( (int32_t)nNumber, ruleSet, icuRet, icuPos, nCode );\n\n            if ( U_SUCCESS( nCode ) )\n            {\n                \/\/ Apply NFKC normalization to get normal letters\n                icu::UnicodeString normalized;\n                nCode = U_ZERO_ERROR;\n                icu::Normalizer::normalize( icuRet, UNORM_NFKC, 0, normalized, nCode );\n                if ( U_SUCCESS( nCode ) )\n                {\n                    \/\/ Convert the normalized UnicodeString to OUString\n                    OUString sValue( reinterpret_cast<const sal_Unicode *>( normalized.getBuffer( ) ), normalized.length() );\n\n                    \/\/ Remove the number to get the prefix\n                    sal_Int32 len = OUString::valueOf( nNumber ).getLength( );\n\n                    sal_Int32 newLength = retValue.getLength() + 1;\n                    retValue.realloc( newLength );\n                    retValue[ newLength - 1 ] = sValue.copy( len );\n                }\n            }\n        }\n    }\n\n    return retValue;\n}\n\n\nconst sal_Char cOrdinalSuffix[] = \"com.sun.star.i18n.OrdinalSuffix\";\n\nOUString SAL_CALL OrdinalSuffix::getImplementationName(void) throw( RuntimeException )\n{\n    return OUString::createFromAscii(cOrdinalSuffix);\n}\n\nsal_Bool SAL_CALL OrdinalSuffix::supportsService( const OUString& rServiceName) throw( RuntimeException )\n{\n    return !rServiceName.compareToAscii(cOrdinalSuffix);\n}\n\nSequence< OUString > SAL_CALL OrdinalSuffix::getSupportedServiceNames(void) throw( RuntimeException )\n{\n    Sequence< OUString > aRet(1);\n    aRet[0] = OUString::createFromAscii(cOrdinalSuffix);\n    return aRet;\n}\n\n} } } }\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>Resolves: fdo#54486 ensure ordinal format has non-ordinal prefix<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 <boost\/scoped_ptr.hpp>\n#include <comphelper\/processfactory.hxx>\n#include <string.h>\n#include \"ordinalsuffix.hxx\"\n\n#include <unicode\/rbnf.h>\n#include <unicode\/normlzr.h>\n\n#define CSTR( ouStr ) rtl::OUStringToOString( ouStr, RTL_TEXTENCODING_UTF8 ).getStr( )\n\nusing namespace ::com::sun::star::i18n;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star;\nusing namespace ::rtl;\n\nnamespace com { namespace sun { namespace star { namespace i18n {\n\n\nOrdinalSuffix::OrdinalSuffix(\n        const com::sun::star::uno::Reference < com::sun::star::lang::XMultiServiceFactory >& rxMSF) :\n    _xServiceManager( rxMSF )\n{\n}\n\nOrdinalSuffix::~OrdinalSuffix()\n{\n}\n\nnamespace\n{\n    OUString mungeUnicodeStringToOUString(const icu::UnicodeString &rIn, UErrorCode &rCode)\n    {\n        \/\/ Apply NFKC normalization to get normal letters\n        icu::UnicodeString normalized;\n        icu::Normalizer::normalize(rIn, UNORM_NFKC, 0, normalized, rCode);\n        \/\/ Convert the normalized UnicodeString to OUString\n        OUString sRet = (U_SUCCESS(rCode))\n            ? OUString(reinterpret_cast<const sal_Unicode *>(normalized.getBuffer()), normalized.length())\n            : OUString();\n        \/\/ replace any minus signs with hyphen-minus so that negative numbers\n        \/\/ from the simple number formatter and heavy-duty pattern formatter\n        \/\/ agree as to their negative number sign\n        return sRet.replace(0x2212, '-');\n    }\n}\n\n\/*\n * For this method to properly return the ordinal suffix for other locales\n * than english ones, ICU 4.2+ has to be used.\n *\/\nuno::Sequence< OUString > SAL_CALL OrdinalSuffix::getOrdinalSuffix( sal_Int32 nNumber,\n        const lang::Locale &aLocale ) throw( RuntimeException )\n{\n    uno::Sequence< OUString > retValue;\n\n    \/\/ Get the value from ICU\n    UErrorCode nCode = U_ZERO_ERROR;\n    const icu::Locale rIcuLocale(\n            CSTR( aLocale.Language ),\n            CSTR( aLocale.Country ),\n            CSTR( aLocale.Variant ) );\n\n    icu::RuleBasedNumberFormat formatter(icu::URBNF_ORDINAL, rIcuLocale, nCode);\n    if (!U_SUCCESS(nCode))\n        return retValue;\n\n    boost::scoped_ptr<NumberFormat> xNumberFormat(icu::NumberFormat::createInstance(rIcuLocale, nCode));\n    if (!U_SUCCESS(nCode))\n        return retValue;\n\n    icu::UnicodeString sFormatWithNoOrdinal;\n    xNumberFormat->format((int32_t)nNumber, sFormatWithNoOrdinal, NULL, nCode);\n    if (!U_SUCCESS(nCode))\n        return retValue;\n\n    OUString sValueWithNoOrdinal = mungeUnicodeStringToOUString(sFormatWithNoOrdinal, nCode);\n    if (!U_SUCCESS(nCode))\n        return retValue;\n\n    int32_t nRuleSets = formatter.getNumberOfRuleSetNames( );\n    for (int32_t i = 0; i < nRuleSets; ++i)\n    {\n        icu::UnicodeString ruleSet = formatter.getRuleSetName(i);\n\n        \/\/ format the string\n        icu::UnicodeString sFormatWithOrdinal;\n        icu::FieldPosition icuPos;\n        formatter.format( (int32_t)nNumber, ruleSet, sFormatWithOrdinal, icuPos, nCode );\n\n        if (!U_SUCCESS(nCode))\n            continue;\n\n        OUString sValueWithOrdinal = mungeUnicodeStringToOUString(sFormatWithOrdinal, nCode);\n        if (!U_SUCCESS(nCode))\n            continue;\n\n        \/\/ fdo#54486 lets make sure that the ordinal format and the non-ordinal\n        \/\/ format match at the start, so that the expectation can be verified\n        \/\/ that there is some trailing \"ordinal suffix\" which can be extracted\n        bool bSimpleOrdinalSuffix = sValueWithOrdinal.match(sValueWithNoOrdinal);\n\n        SAL_WARN_IF(!bSimpleOrdinalSuffix, \"i18npool\", \"ordinal \" <<\n            sValueWithOrdinal << \" didn't start with expected \" <<\n            sValueWithNoOrdinal << \" prefix\");\n\n        if (!bSimpleOrdinalSuffix)\n            continue;\n\n        \/\/ Remove the number to get the prefix\n        sal_Int32 len = sValueWithNoOrdinal.getLength();\n\n        sal_Int32 newLength = retValue.getLength() + 1;\n        retValue.realloc( newLength );\n        retValue[ newLength - 1 ] = sValueWithOrdinal.copy( len );\n    }\n\n    return retValue;\n}\n\nconst sal_Char cOrdinalSuffix[] = \"com.sun.star.i18n.OrdinalSuffix\";\n\nOUString SAL_CALL OrdinalSuffix::getImplementationName(void) throw( RuntimeException )\n{\n    return OUString::createFromAscii(cOrdinalSuffix);\n}\n\nsal_Bool SAL_CALL OrdinalSuffix::supportsService( const OUString& rServiceName) throw( RuntimeException )\n{\n    return !rServiceName.compareToAscii(cOrdinalSuffix);\n}\n\nSequence< OUString > SAL_CALL OrdinalSuffix::getSupportedServiceNames(void) throw( RuntimeException )\n{\n    Sequence< OUString > aRet(1);\n    aRet[0] = OUString::createFromAscii(cOrdinalSuffix);\n    return aRet;\n}\n\n} } } }\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- llvm\/CodeGen\/GlobalISel\/InstructionSelector.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\/\/\/ \\file\n\/\/\/ This file implements the InstructionSelector class.\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/CodeGen\/GlobalISel\/InstructionSelector.h\"\n#include \"llvm\/CodeGen\/GlobalISel\/Utils.h\"\n#include \"llvm\/CodeGen\/MachineBasicBlock.h\"\n#include \"llvm\/CodeGen\/MachineFunction.h\"\n#include \"llvm\/CodeGen\/MachineInstr.h\"\n#include \"llvm\/CodeGen\/MachineOperand.h\"\n#include \"llvm\/CodeGen\/MachineInstrBuilder.h\"\n#include \"llvm\/CodeGen\/MachineRegisterInfo.h\"\n#include \"llvm\/MC\/MCInstrDesc.h\"\n#include \"llvm\/IR\/Constants.h\"\n#include \"llvm\/Target\/TargetInstrInfo.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Target\/TargetRegisterInfo.h\"\n#include <cassert>\n\n#define DEBUG_TYPE \"instructionselector\"\n\nusing namespace llvm;\n\nInstructionSelector::MatcherState::MatcherState(unsigned MaxRenderers)\n    : Renderers(MaxRenderers, nullptr), MIs() {}\n\nInstructionSelector::InstructionSelector() = default;\n\nvoid InstructionSelector::executeEmitTable(NewMIVector &OutMIs,\n                                           MatcherState &State,\n                                           const int64_t *EmitTable,\n                                           const TargetInstrInfo &TII,\n                                           const TargetRegisterInfo &TRI,\n                                           const RegisterBankInfo &RBI) const {\n  const int64_t *Command = EmitTable;\n  while (true) {\n    switch (*Command++) {\n    case GIR_MutateOpcode: {\n      int64_t OldInsnID = *Command++;\n      int64_t NewInsnID = *Command++;\n      int64_t NewOpcode = *Command++;\n      assert((size_t)NewInsnID == OutMIs.size() &&\n             \"Expected to store MIs in order\");\n      OutMIs.push_back(\n          MachineInstrBuilder(*State.MIs[OldInsnID]->getParent()->getParent(),\n                              State.MIs[OldInsnID]));\n      OutMIs[NewInsnID]->setDesc(TII.get(NewOpcode));\n      DEBUG(dbgs() << \"GIR_MutateOpcode(OutMIs[\" << NewInsnID << \"], MIs[\"\n                   << OldInsnID << \"], \" << NewOpcode << \")\\n\");\n      break;\n    }\n    case GIR_BuildMI: {\n      int64_t InsnID = *Command++;\n      int64_t Opcode = *Command++;\n      assert((size_t)InsnID == OutMIs.size() &&\n             \"Expected to store MIs in order\");\n      OutMIs.push_back(BuildMI(*State.MIs[0]->getParent(), State.MIs[0],\n                               State.MIs[0]->getDebugLoc(), TII.get(Opcode)));\n      DEBUG(dbgs() << \"GIR_BuildMI(OutMIs[\" << InsnID << \"], \" << Opcode\n                   << \")\\n\");\n      break;\n    }\n\n    case GIR_Copy: {\n      int64_t NewInsnID = *Command++;\n      int64_t OldInsnID = *Command++;\n      int64_t OpIdx = *Command++;\n      assert(OutMIs[NewInsnID] && \"Attempted to add to undefined instruction\");\n      OutMIs[NewInsnID].add(State.MIs[OldInsnID]->getOperand(OpIdx));\n      DEBUG(dbgs() << \"GIR_Copy(OutMIs[\" << NewInsnID << \"], MIs[\" << OldInsnID\n                   << \"], \" << OpIdx << \")\\n\");\n      break;\n    }\n    case GIR_CopySubReg: {\n      int64_t NewInsnID = *Command++;\n      int64_t OldInsnID = *Command++;\n      int64_t OpIdx = *Command++;\n      int64_t SubRegIdx = *Command++;\n      assert(OutMIs[NewInsnID] && \"Attempted to add to undefined instruction\");\n      OutMIs[NewInsnID].addReg(State.MIs[OldInsnID]->getOperand(OpIdx).getReg(),\n                               0, SubRegIdx);\n      DEBUG(dbgs() << \"GIR_CopySubReg(OutMIs[\" << NewInsnID << \"], MIs[\"\n                   << OldInsnID << \"], \" << OpIdx << \", \" << SubRegIdx\n                   << \")\\n\");\n      break;\n    }\n    case GIR_AddImplicitDef: {\n      int64_t InsnID = *Command++;\n      int64_t RegNum = *Command++;\n      assert(OutMIs[InsnID] && \"Attempted to add to undefined instruction\");\n      OutMIs[InsnID].addDef(RegNum, RegState::Implicit);\n      DEBUG(dbgs() << \"GIR_AddImplicitDef(OutMIs[\" << InsnID << \"], \" << RegNum\n                   << \")\\n\");\n      break;\n    }\n    case GIR_AddImplicitUse: {\n      int64_t InsnID = *Command++;\n      int64_t RegNum = *Command++;\n      assert(OutMIs[InsnID] && \"Attempted to add to undefined instruction\");\n      OutMIs[InsnID].addUse(RegNum, RegState::Implicit);\n      DEBUG(dbgs() << \"GIR_AddImplicitUse(OutMIs[\" << InsnID << \"], \" << RegNum\n                   << \")\\n\");\n      break;\n    }\n    case GIR_AddRegister: {\n      int64_t InsnID = *Command++;\n      int64_t RegNum = *Command++;\n      assert(OutMIs[InsnID] && \"Attempted to add to undefined instruction\");\n      OutMIs[InsnID].addReg(RegNum);\n      DEBUG(dbgs() << \"GIR_AddRegister(OutMIs[\" << InsnID << \"], \" << RegNum\n                   << \")\\n\");\n      break;\n    }\n    case GIR_AddImm: {\n      int64_t InsnID = *Command++;\n      int64_t Imm = *Command++;\n      assert(OutMIs[InsnID] && \"Attempted to add to undefined instruction\");\n      OutMIs[InsnID].addImm(Imm);\n      DEBUG(dbgs() << \"GIR_AddImm(OutMIs[\" << InsnID << \"], \" << Imm << \")\\n\");\n      break;\n    }\n    case GIR_ComplexRenderer: {\n      int64_t InsnID = *Command++;\n      int64_t RendererID = *Command++;\n      assert(OutMIs[InsnID] && \"Attempted to add to undefined instruction\");\n      State.Renderers[RendererID](OutMIs[InsnID]);\n      DEBUG(dbgs() << \"GIR_ComplexRenderer(OutMIs[\" << InsnID << \"], \"\n                   << RendererID << \")\\n\");\n      break;\n    }\n\n    case GIR_ConstrainOperandRC: {\n      int64_t InsnID = *Command++;\n      int64_t OpIdx = *Command++;\n      int64_t RCEnum = *Command++;\n      assert(OutMIs[InsnID] && \"Attempted to add to undefined instruction\");\n      constrainOperandRegToRegClass(*OutMIs[InsnID].getInstr(), OpIdx,\n                                    *TRI.getRegClass(RCEnum), TII, TRI, RBI);\n      DEBUG(dbgs() << \"GIR_ConstrainOperandRC(OutMIs[\" << InsnID << \"], \"\n                   << OpIdx << \", \" << RCEnum << \")\\n\");\n      break;\n    }\n    case GIR_ConstrainSelectedInstOperands: {\n      int64_t InsnID = *Command++;\n      assert(OutMIs[InsnID] && \"Attempted to add to undefined instruction\");\n      constrainSelectedInstRegOperands(*OutMIs[InsnID].getInstr(), TII, TRI,\n                                       RBI);\n      DEBUG(dbgs() << \"GIR_ConstrainSelectedInstOperands(OutMIs[\" << InsnID\n                   << \"])\\n\");\n      break;\n    }\n    case GIR_MergeMemOperands: {\n      int64_t InsnID = *Command++;\n      assert(OutMIs[InsnID] && \"Attempted to add to undefined instruction\");\n      for (const auto *FromMI : State.MIs)\n        for (const auto &MMO : FromMI->memoperands())\n          OutMIs[InsnID].addMemOperand(MMO);\n      DEBUG(dbgs() << \"GIR_MergeMemOperands(OutMIs[\" << InsnID << \"])\\n\");\n      break;\n    }\n    case GIR_EraseFromParent: {\n      int64_t InsnID = *Command++;\n      assert(State.MIs[InsnID] && \"Attempted to erase an undefined instruction\");\n      State.MIs[InsnID]->eraseFromParent();\n      DEBUG(dbgs() << \"GIR_EraseFromParent(MIs[\" << InsnID << \"])\\n\");\n      break;\n    }\n\n    case GIR_Done:\n      DEBUG(dbgs() << \"GIR_Done\");\n      return;\n    default:\n      llvm_unreachable(\"Unexpected command\");\n    }\n  }\n}\n\nbool InstructionSelector::constrainOperandRegToRegClass(\n    MachineInstr &I, unsigned OpIdx, const TargetRegisterClass &RC,\n    const TargetInstrInfo &TII, const TargetRegisterInfo &TRI,\n    const RegisterBankInfo &RBI) const {\n  MachineBasicBlock &MBB = *I.getParent();\n  MachineFunction &MF = *MBB.getParent();\n  MachineRegisterInfo &MRI = MF.getRegInfo();\n\n  return\n      constrainRegToClass(MRI, TII, RBI, I, I.getOperand(OpIdx).getReg(), RC);\n}\n\nbool InstructionSelector::constrainSelectedInstRegOperands(\n    MachineInstr &I, const TargetInstrInfo &TII, const TargetRegisterInfo &TRI,\n    const RegisterBankInfo &RBI) const {\n  MachineBasicBlock &MBB = *I.getParent();\n  MachineFunction &MF = *MBB.getParent();\n  MachineRegisterInfo &MRI = MF.getRegInfo();\n\n  for (unsigned OpI = 0, OpE = I.getNumExplicitOperands(); OpI != OpE; ++OpI) {\n    MachineOperand &MO = I.getOperand(OpI);\n\n    \/\/ There's nothing to be done on non-register operands.\n    if (!MO.isReg())\n      continue;\n\n    DEBUG(dbgs() << \"Converting operand: \" << MO << '\\n');\n    assert(MO.isReg() && \"Unsupported non-reg operand\");\n\n    unsigned Reg = MO.getReg();\n    \/\/ Physical registers don't need to be constrained.\n    if (TRI.isPhysicalRegister(Reg))\n      continue;\n\n    \/\/ Register operands with a value of 0 (e.g. predicate operands) don't need\n    \/\/ to be constrained.\n    if (Reg == 0)\n      continue;\n\n    \/\/ If the operand is a vreg, we should constrain its regclass, and only\n    \/\/ insert COPYs if that's impossible.\n    \/\/ constrainOperandRegClass does that for us.\n    MO.setReg(constrainOperandRegClass(MF, TRI, MRI, TII, RBI, I, I.getDesc(),\n                                       Reg, OpI));\n\n    \/\/ Tie uses to defs as indicated in MCInstrDesc if this hasn't already been\n    \/\/ done.\n    if (MO.isUse()) {\n      int DefIdx = I.getDesc().getOperandConstraint(OpI, MCOI::TIED_TO);\n      if (DefIdx != -1 && !I.isRegTiedToUseOperand(DefIdx))\n        I.tieOperands(DefIdx, OpI);\n    }\n  }\n  return true;\n}\n\nbool InstructionSelector::isOperandImmEqual(\n    const MachineOperand &MO, int64_t Value,\n    const MachineRegisterInfo &MRI) const {\n  if (MO.isReg() && MO.getReg())\n    if (auto VRegVal = getConstantVRegVal(MO.getReg(), MRI))\n      return *VRegVal == Value;\n  return false;\n}\n\nbool InstructionSelector::isObviouslySafeToFold(MachineInstr &MI) const {\n  return !MI.mayLoadOrStore() && !MI.hasUnmodeledSideEffects() &&\n         MI.implicit_operands().begin() == MI.implicit_operands().end();\n}\n<commit_msg>[globalisel][tablegen] Fix an unused variable warning in release builds after r307133<commit_after>\/\/===- llvm\/CodeGen\/GlobalISel\/InstructionSelector.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\/\/\/ \\file\n\/\/\/ This file implements the InstructionSelector class.\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/CodeGen\/GlobalISel\/InstructionSelector.h\"\n#include \"llvm\/CodeGen\/GlobalISel\/Utils.h\"\n#include \"llvm\/CodeGen\/MachineBasicBlock.h\"\n#include \"llvm\/CodeGen\/MachineFunction.h\"\n#include \"llvm\/CodeGen\/MachineInstr.h\"\n#include \"llvm\/CodeGen\/MachineOperand.h\"\n#include \"llvm\/CodeGen\/MachineInstrBuilder.h\"\n#include \"llvm\/CodeGen\/MachineRegisterInfo.h\"\n#include \"llvm\/MC\/MCInstrDesc.h\"\n#include \"llvm\/IR\/Constants.h\"\n#include \"llvm\/Target\/TargetInstrInfo.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Target\/TargetRegisterInfo.h\"\n#include <cassert>\n\n#define DEBUG_TYPE \"instructionselector\"\n\nusing namespace llvm;\n\nInstructionSelector::MatcherState::MatcherState(unsigned MaxRenderers)\n    : Renderers(MaxRenderers, nullptr), MIs() {}\n\nInstructionSelector::InstructionSelector() = default;\n\nvoid InstructionSelector::executeEmitTable(NewMIVector &OutMIs,\n                                           MatcherState &State,\n                                           const int64_t *EmitTable,\n                                           const TargetInstrInfo &TII,\n                                           const TargetRegisterInfo &TRI,\n                                           const RegisterBankInfo &RBI) const {\n  const int64_t *Command = EmitTable;\n  while (true) {\n    switch (*Command++) {\n    case GIR_MutateOpcode: {\n      int64_t OldInsnID = *Command++;\n      int64_t NewInsnID = *Command++;\n      int64_t NewOpcode = *Command++;\n      assert((size_t)NewInsnID == OutMIs.size() &&\n             \"Expected to store MIs in order\");\n      OutMIs.push_back(\n          MachineInstrBuilder(*State.MIs[OldInsnID]->getParent()->getParent(),\n                              State.MIs[OldInsnID]));\n      OutMIs[NewInsnID]->setDesc(TII.get(NewOpcode));\n      DEBUG(dbgs() << \"GIR_MutateOpcode(OutMIs[\" << NewInsnID << \"], MIs[\"\n                   << OldInsnID << \"], \" << NewOpcode << \")\\n\");\n      break;\n    }\n    case GIR_BuildMI: {\n      int64_t InsnID LLVM_ATTRIBUTE_UNUSED = *Command++;\n      int64_t Opcode = *Command++;\n      assert((size_t)InsnID == OutMIs.size() &&\n             \"Expected to store MIs in order\");\n      OutMIs.push_back(BuildMI(*State.MIs[0]->getParent(), State.MIs[0],\n                               State.MIs[0]->getDebugLoc(), TII.get(Opcode)));\n      DEBUG(dbgs() << \"GIR_BuildMI(OutMIs[\" << InsnID << \"], \" << Opcode\n                   << \")\\n\");\n      break;\n    }\n\n    case GIR_Copy: {\n      int64_t NewInsnID = *Command++;\n      int64_t OldInsnID = *Command++;\n      int64_t OpIdx = *Command++;\n      assert(OutMIs[NewInsnID] && \"Attempted to add to undefined instruction\");\n      OutMIs[NewInsnID].add(State.MIs[OldInsnID]->getOperand(OpIdx));\n      DEBUG(dbgs() << \"GIR_Copy(OutMIs[\" << NewInsnID << \"], MIs[\" << OldInsnID\n                   << \"], \" << OpIdx << \")\\n\");\n      break;\n    }\n    case GIR_CopySubReg: {\n      int64_t NewInsnID = *Command++;\n      int64_t OldInsnID = *Command++;\n      int64_t OpIdx = *Command++;\n      int64_t SubRegIdx = *Command++;\n      assert(OutMIs[NewInsnID] && \"Attempted to add to undefined instruction\");\n      OutMIs[NewInsnID].addReg(State.MIs[OldInsnID]->getOperand(OpIdx).getReg(),\n                               0, SubRegIdx);\n      DEBUG(dbgs() << \"GIR_CopySubReg(OutMIs[\" << NewInsnID << \"], MIs[\"\n                   << OldInsnID << \"], \" << OpIdx << \", \" << SubRegIdx\n                   << \")\\n\");\n      break;\n    }\n    case GIR_AddImplicitDef: {\n      int64_t InsnID = *Command++;\n      int64_t RegNum = *Command++;\n      assert(OutMIs[InsnID] && \"Attempted to add to undefined instruction\");\n      OutMIs[InsnID].addDef(RegNum, RegState::Implicit);\n      DEBUG(dbgs() << \"GIR_AddImplicitDef(OutMIs[\" << InsnID << \"], \" << RegNum\n                   << \")\\n\");\n      break;\n    }\n    case GIR_AddImplicitUse: {\n      int64_t InsnID = *Command++;\n      int64_t RegNum = *Command++;\n      assert(OutMIs[InsnID] && \"Attempted to add to undefined instruction\");\n      OutMIs[InsnID].addUse(RegNum, RegState::Implicit);\n      DEBUG(dbgs() << \"GIR_AddImplicitUse(OutMIs[\" << InsnID << \"], \" << RegNum\n                   << \")\\n\");\n      break;\n    }\n    case GIR_AddRegister: {\n      int64_t InsnID = *Command++;\n      int64_t RegNum = *Command++;\n      assert(OutMIs[InsnID] && \"Attempted to add to undefined instruction\");\n      OutMIs[InsnID].addReg(RegNum);\n      DEBUG(dbgs() << \"GIR_AddRegister(OutMIs[\" << InsnID << \"], \" << RegNum\n                   << \")\\n\");\n      break;\n    }\n    case GIR_AddImm: {\n      int64_t InsnID = *Command++;\n      int64_t Imm = *Command++;\n      assert(OutMIs[InsnID] && \"Attempted to add to undefined instruction\");\n      OutMIs[InsnID].addImm(Imm);\n      DEBUG(dbgs() << \"GIR_AddImm(OutMIs[\" << InsnID << \"], \" << Imm << \")\\n\");\n      break;\n    }\n    case GIR_ComplexRenderer: {\n      int64_t InsnID = *Command++;\n      int64_t RendererID = *Command++;\n      assert(OutMIs[InsnID] && \"Attempted to add to undefined instruction\");\n      State.Renderers[RendererID](OutMIs[InsnID]);\n      DEBUG(dbgs() << \"GIR_ComplexRenderer(OutMIs[\" << InsnID << \"], \"\n                   << RendererID << \")\\n\");\n      break;\n    }\n\n    case GIR_ConstrainOperandRC: {\n      int64_t InsnID = *Command++;\n      int64_t OpIdx = *Command++;\n      int64_t RCEnum = *Command++;\n      assert(OutMIs[InsnID] && \"Attempted to add to undefined instruction\");\n      constrainOperandRegToRegClass(*OutMIs[InsnID].getInstr(), OpIdx,\n                                    *TRI.getRegClass(RCEnum), TII, TRI, RBI);\n      DEBUG(dbgs() << \"GIR_ConstrainOperandRC(OutMIs[\" << InsnID << \"], \"\n                   << OpIdx << \", \" << RCEnum << \")\\n\");\n      break;\n    }\n    case GIR_ConstrainSelectedInstOperands: {\n      int64_t InsnID = *Command++;\n      assert(OutMIs[InsnID] && \"Attempted to add to undefined instruction\");\n      constrainSelectedInstRegOperands(*OutMIs[InsnID].getInstr(), TII, TRI,\n                                       RBI);\n      DEBUG(dbgs() << \"GIR_ConstrainSelectedInstOperands(OutMIs[\" << InsnID\n                   << \"])\\n\");\n      break;\n    }\n    case GIR_MergeMemOperands: {\n      int64_t InsnID = *Command++;\n      assert(OutMIs[InsnID] && \"Attempted to add to undefined instruction\");\n      for (const auto *FromMI : State.MIs)\n        for (const auto &MMO : FromMI->memoperands())\n          OutMIs[InsnID].addMemOperand(MMO);\n      DEBUG(dbgs() << \"GIR_MergeMemOperands(OutMIs[\" << InsnID << \"])\\n\");\n      break;\n    }\n    case GIR_EraseFromParent: {\n      int64_t InsnID = *Command++;\n      assert(State.MIs[InsnID] && \"Attempted to erase an undefined instruction\");\n      State.MIs[InsnID]->eraseFromParent();\n      DEBUG(dbgs() << \"GIR_EraseFromParent(MIs[\" << InsnID << \"])\\n\");\n      break;\n    }\n\n    case GIR_Done:\n      DEBUG(dbgs() << \"GIR_Done\");\n      return;\n    default:\n      llvm_unreachable(\"Unexpected command\");\n    }\n  }\n}\n\nbool InstructionSelector::constrainOperandRegToRegClass(\n    MachineInstr &I, unsigned OpIdx, const TargetRegisterClass &RC,\n    const TargetInstrInfo &TII, const TargetRegisterInfo &TRI,\n    const RegisterBankInfo &RBI) const {\n  MachineBasicBlock &MBB = *I.getParent();\n  MachineFunction &MF = *MBB.getParent();\n  MachineRegisterInfo &MRI = MF.getRegInfo();\n\n  return\n      constrainRegToClass(MRI, TII, RBI, I, I.getOperand(OpIdx).getReg(), RC);\n}\n\nbool InstructionSelector::constrainSelectedInstRegOperands(\n    MachineInstr &I, const TargetInstrInfo &TII, const TargetRegisterInfo &TRI,\n    const RegisterBankInfo &RBI) const {\n  MachineBasicBlock &MBB = *I.getParent();\n  MachineFunction &MF = *MBB.getParent();\n  MachineRegisterInfo &MRI = MF.getRegInfo();\n\n  for (unsigned OpI = 0, OpE = I.getNumExplicitOperands(); OpI != OpE; ++OpI) {\n    MachineOperand &MO = I.getOperand(OpI);\n\n    \/\/ There's nothing to be done on non-register operands.\n    if (!MO.isReg())\n      continue;\n\n    DEBUG(dbgs() << \"Converting operand: \" << MO << '\\n');\n    assert(MO.isReg() && \"Unsupported non-reg operand\");\n\n    unsigned Reg = MO.getReg();\n    \/\/ Physical registers don't need to be constrained.\n    if (TRI.isPhysicalRegister(Reg))\n      continue;\n\n    \/\/ Register operands with a value of 0 (e.g. predicate operands) don't need\n    \/\/ to be constrained.\n    if (Reg == 0)\n      continue;\n\n    \/\/ If the operand is a vreg, we should constrain its regclass, and only\n    \/\/ insert COPYs if that's impossible.\n    \/\/ constrainOperandRegClass does that for us.\n    MO.setReg(constrainOperandRegClass(MF, TRI, MRI, TII, RBI, I, I.getDesc(),\n                                       Reg, OpI));\n\n    \/\/ Tie uses to defs as indicated in MCInstrDesc if this hasn't already been\n    \/\/ done.\n    if (MO.isUse()) {\n      int DefIdx = I.getDesc().getOperandConstraint(OpI, MCOI::TIED_TO);\n      if (DefIdx != -1 && !I.isRegTiedToUseOperand(DefIdx))\n        I.tieOperands(DefIdx, OpI);\n    }\n  }\n  return true;\n}\n\nbool InstructionSelector::isOperandImmEqual(\n    const MachineOperand &MO, int64_t Value,\n    const MachineRegisterInfo &MRI) const {\n  if (MO.isReg() && MO.getReg())\n    if (auto VRegVal = getConstantVRegVal(MO.getReg(), MRI))\n      return *VRegVal == Value;\n  return false;\n}\n\nbool InstructionSelector::isObviouslySafeToFold(MachineInstr &MI) const {\n  return !MI.mayLoadOrStore() && !MI.hasUnmodeledSideEffects() &&\n         MI.implicit_operands().begin() == MI.implicit_operands().end();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: gtkdata.hxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: hr $ $Date: 2006-08-11 17:47:23 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; 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 _VCL_GTKDATA_HXX\n#define _VCL_GTKDATA_HXX\n\n#include <prex.h>\n#include <gdk\/gdk.h>\n#include <gdk\/gdkx.h>\n#include <gtk\/gtk.h>\n#include <postx.h>\n\n#include <saldisp.hxx>\n#include <saldata.hxx>\n#include <ptrstyle.hxx>\n\n#include <list>\n\nclass GtkData : public X11SalData\n{\npublic:\n    GtkData() {}\n    virtual ~GtkData();\n\n    virtual void Init();\n\n    virtual void initNWF();\n    virtual void deInitNWF();\n};\n\nclass GtkSalFrame;\n\nclass GtkSalDisplay : public SalDisplay\n{\n    GdkDisplay*                     m_pGdkDisplay;\n    GdkCursor                      *m_aCursors[ POINTER_COUNT ];\n    bool                            m_bStartupCompleted;\n    GdkCursor* getFromXPM( const char *pBitmap, const char *pMask,\n                           int nWidth, int nHeight, int nXHot, int nYHot );\npublic:\n             GtkSalDisplay( GdkDisplay* pDisplay, Visual* pVis, Colormap aCol );\n    virtual ~GtkSalDisplay();\n\n    GdkDisplay* GetGdkDisplay() const { return m_pGdkDisplay; }\n\n    virtual void deregisterFrame( SalFrame* pFrame );\n    GdkCursor *getCursor( PointerStyle ePointerStyle );\n    virtual int CaptureMouse( SalFrame* pFrame );\n    virtual long Dispatch( XEvent *pEvent );\n\n    static GdkFilterReturn filterGdkEvent( GdkXEvent* sys_event,\n                                           GdkEvent* event,\n                                           gpointer data );\n    inline bool HasMoreEvents()     { return m_aUserEvents.size() > 1; }\n    inline void EventGuardAcquire() { osl_acquireMutex( hEventGuard_ ); }\n    inline void EventGuardRelease() { osl_releaseMutex( hEventGuard_ ); }\n    void startupNotificationCompleted() { m_bStartupCompleted = true; }\n};\n\n\n#endif \/\/ _VCL_GTKDATA_HXX\n<commit_msg>INTEGRATION: CWS impresshydra (1.5.46); FILE MERGED 2006\/08\/28 13:08:24 cl 1.5.46.2: RESYNC: (1.5-1.6); FILE MERGED 2006\/08\/09 14:35:05 pl 1.5.46.1: #i67721# on the way to multiscreen support<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: gtkdata.hxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: kz $ $Date: 2006-10-06 10:02: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#ifndef _VCL_GTKDATA_HXX\n#define _VCL_GTKDATA_HXX\n\n#include <prex.h>\n#include <gdk\/gdk.h>\n#include <gdk\/gdkx.h>\n#include <gtk\/gtk.h>\n#include <postx.h>\n\n#include <saldisp.hxx>\n#include <saldata.hxx>\n#include <ptrstyle.hxx>\n\n#include <list>\n\nclass GtkData : public X11SalData\n{\npublic:\n    GtkData() {}\n    virtual ~GtkData();\n\n    virtual void Init();\n\n    virtual void initNWF();\n    virtual void deInitNWF();\n};\n\nclass GtkSalFrame;\n\nclass GtkSalDisplay : public SalDisplay\n{\n    GdkDisplay*                     m_pGdkDisplay;\n    GdkCursor                      *m_aCursors[ POINTER_COUNT ];\n    bool                            m_bStartupCompleted;\n    GdkCursor* getFromXPM( const char *pBitmap, const char *pMask,\n                           int nWidth, int nHeight, int nXHot, int nYHot );\npublic:\n             GtkSalDisplay( GdkDisplay* pDisplay );\n    virtual ~GtkSalDisplay();\n\n    GdkDisplay* GetGdkDisplay() const { return m_pGdkDisplay; }\n\n    virtual void deregisterFrame( SalFrame* pFrame );\n    GdkCursor *getCursor( PointerStyle ePointerStyle );\n    virtual int CaptureMouse( SalFrame* pFrame );\n    virtual long Dispatch( XEvent *pEvent );\n\n    static GdkFilterReturn filterGdkEvent( GdkXEvent* sys_event,\n                                           GdkEvent* event,\n                                           gpointer data );\n    inline bool HasMoreEvents()     { return m_aUserEvents.size() > 1; }\n    inline void EventGuardAcquire() { osl_acquireMutex( hEventGuard_ ); }\n    inline void EventGuardRelease() { osl_releaseMutex( hEventGuard_ ); }\n    void startupNotificationCompleted() { m_bStartupCompleted = true; }\n};\n\n\n#endif \/\/ _VCL_GTKDATA_HXX\n<|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/roostats:$Id$\n\/\/ Author: Kyle Cranmer   28\/07\/2008\n\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>\nProfileLikelihoodCalculator is a concrete implementation of CombinedCalculator \n(the interface class for a tools which can produce both RooStats HypoTestResults and ConfIntervals).  \nThe tool uses the profile likelihood ratio as a test statistic, and assumes that Wilks' theorem is valid.  \nWilks' theorem states that -2* log (profile likelihood ratio) is asymptotically distributed as a chi^2 distribution \nwith N-dof, where N is the number of degrees of freedom.  Thus, p-values can be constructed and the profile likelihood ratio\ncan be used to construct a LikelihoodInterval.\n(In the future, this class could be extended to use toy Monte Carlo to calibrate the distribution of the test statistic).\n<\/p>\n<p> Usage: It uses the interface of the CombinedCalculator, so that it can be configured by specifying:\n<ul>\n <li>a model common model (eg. a family of specific models which includes both the null and alternate),<\/li>\n <li>a data set, <\/li>\n <li>a set of parameters of interest. The nuisance parameters will be all other parameters of the model <\/li>\n <li>a set of parameters of which specify the null hypothesis (including values and const\/non-const status)  <\/li>\n<\/ul>\nThe interface allows one to pass the model, data, and parameters either directly or via a ModelConfig class.\nThe alternate hypothesis leaves the parameter free to take any value other than those specified by the null hypotesis. There is therefore no need to \nspecify the alternate parameters. \n<\/p>\n<p>\nAfter configuring the calculator, one only needs to ask GetHypoTest() (which will return a HypoTestResult pointer) or GetInterval() (which will return an ConfInterval pointer).\n<\/p>\n<p>\nThe concrete implementations of this interface should deal with the details of how the nuisance parameters are\ndealt with (eg. integration vs. profiling) and which test-statistic is used (perhaps this should be added to the interface).\n<\/p>\n<p>\nThe motivation for this interface is that we hope to be able to specify the problem in a common way for several concrete calculators.\n<\/p>\nEND_HTML\n*\/\n\/\/\n\n#ifndef RooStats_ProfileLikelihoodCalculator\n#include \"RooStats\/ProfileLikelihoodCalculator.h\"\n#endif\n\n#ifndef RooStats_RooStatsUtils\n#include \"RooStats\/RooStatsUtils.h\"\n#endif\n\n#include \"RooStats\/LikelihoodInterval.h\"\n#include \"RooStats\/HypoTestResult.h\"\n\n#include \"RooFitResult.h\"\n#include \"RooRealVar.h\"\n#include \"RooProfileLL.h\"\n#include \"RooNLLVar.h\"\n#include \"RooGlobalFunc.h\"\n\n#include \"Math\/MinimizerOptions.h\"\n\/\/#include \"RooProdPdf.h\"\n\nClassImp(RooStats::ProfileLikelihoodCalculator) ;\n\nusing namespace RooFit;\nusing namespace RooStats;\n\n\n\/\/_______________________________________________________\nProfileLikelihoodCalculator::ProfileLikelihoodCalculator() : \n   CombinedCalculator(), fFitResult(0)\n{\n   \/\/ default constructor\n}\n\nProfileLikelihoodCalculator::ProfileLikelihoodCalculator(RooAbsData& data, RooAbsPdf& pdf, const RooArgSet& paramsOfInterest, \n                                                         Double_t size, const RooArgSet* nullParams ) :\n   CombinedCalculator(data,pdf, paramsOfInterest, size, nullParams ), \n   fFitResult(0)\n{\n   \/\/ constructor from pdf and parameters\n   \/\/ the pdf must contain eventually the nuisance parameters\n}\n\nProfileLikelihoodCalculator::ProfileLikelihoodCalculator(RooAbsData& data,  ModelConfig& model, Double_t size) :\n   CombinedCalculator(data, model, size), \n   fFitResult(0)\n{\n   \/\/ construct from a ModelConfig. Assume data model.GetPdf() will provide full description of model including \n   \/\/ constraint term on the nuisances parameters\n   assert(model.GetPdf() );\n}\n\n\n\/\/_______________________________________________________\nProfileLikelihoodCalculator::~ProfileLikelihoodCalculator(){\n   \/\/ destructor\n   \/\/ cannot delete prod pdf because it will delete all the composing pdf's\n\/\/    if (fOwnPdf) delete fPdf; \n\/\/    fPdf = 0; \n   if (fFitResult) delete fFitResult; \n}\n\nvoid ProfileLikelihoodCalculator::DoReset() const { \n   \/\/ reset and clear fit result \n   \/\/ to be called when a new model or data are set in the calculator \n   if (fFitResult) delete fFitResult; \n   fFitResult = 0; \n}\n\nvoid  ProfileLikelihoodCalculator::DoGlobalFit() const { \n   \/\/ perform a global fit of the likelihood letting with all parameter of interest and \n   \/\/ nuisance parameters \n   \/\/ keep the list of fitted parameters \n\n   DoReset(); \n   RooAbsPdf * pdf = GetPdf();\n   RooAbsData* data = GetData(); \n   if (!data || !pdf ) return;\n\n   \/\/ get all non-const parameters\n   RooArgSet* constrainedParams = pdf->getParameters(*data);\n   if (!constrainedParams) return ; \n   RemoveConstantParameters(constrainedParams);\n\n   \/\/ calculate MLE \n   const char * minimType = ROOT::Math::MinimizerOptions::DefaultMinimizerType().c_str();\n   const char * minimAlgo = ROOT::Math::MinimizerOptions::DefaultMinimizerAlgo().c_str();\n   int strategy = ROOT::Math::MinimizerOptions::DefaultStrategy();\n   int level = ROOT::Math::MinimizerOptions::DefaultPrintLevel();\n\n   ooccoutI((TObject*)0,Minimization) << \"ProfileLikelihoodCalcultor::DoGlobalFit - using \" << minimType << \" \/ \" << minimAlgo << \" with strategy \" << strategy << std::endl;\n   RooFitResult* fit = pdf->fitTo(*data, Constrain(*constrainedParams),Strategy(strategy),PrintLevel(level),\n                                  Hesse(kFALSE),Save(kTRUE),Minimizer(minimType,minimAlgo));\n  \n   \/\/ for debug \n   fit->Print();\n\n   delete constrainedParams; \n   \/\/ store fit result for further use \n   fFitResult =  fit; \n   if (fFitResult == 0) \n      oocoutW((TObject*)0,Minimization) << \"ProfileLikelihoodCalcultor::DoGlobalFit -  Global fit failed \" << std::endl;      \n\n}\n\n\/\/_______________________________________________________\nLikelihoodInterval* ProfileLikelihoodCalculator::GetInterval() const {\n   \/\/ Main interface to get a RooStats::ConfInterval.  \n   \/\/ It constructs a profile likelihood ratio and uses that to construct a RooStats::LikelihoodInterval.\n\n\/\/    RooAbsPdf* pdf   = fWS->pdf(fPdfName);\n\/\/    RooAbsData* data = fWS->data(fDataName);\n   RooAbsPdf * pdf = GetPdf();\n   RooAbsData* data = GetData(); \n   if (!data || !pdf || fPOI.getSize() == 0) return 0;\n\n   RooArgSet* constrainedParams = pdf->getParameters(*data);\n   RemoveConstantParameters(constrainedParams);\n\n\n   \/*\n   RooNLLVar* nll = new RooNLLVar(\"nll\",\"\",*pdf,*data, Extended(),Constrain(*constrainedParams));\n   RooProfileLL* profile = new RooProfileLL(\"pll\",\"\",*nll, *fPOI);\n   profile->addOwnedComponents(*nll) ;  \/\/ to avoid memory leak\n   *\/\n\n   RooAbsReal* nll = pdf->createNLL(*data, CloneData(kTRUE), Constrain(*constrainedParams));\n   RooAbsReal* profile = nll->createProfile(fPOI);\n   profile->addOwnedComponents(*nll) ;  \/\/ to avoid memory leak\n\n\n   \/\/RooMsgService::instance().setGlobalKillBelow(RooFit::FATAL) ;\n   \/\/ perform a Best Fit \n   if (!fFitResult) DoGlobalFit();\n   \/\/ if fit fails return\n   if (!fFitResult)   return 0;\n\n   \/\/ t.b.f. \" RooProfileLL should keep and provide possibility to query on global minimum\n   \/\/ set POI to fit value (this will speed up profileLL calculation of global minimum)\n   const RooArgList & fitParams = fFitResult->floatParsFinal(); \n   for (int i = 0; i < fitParams.getSize(); ++i) {\n      RooRealVar & fitPar =  (RooRealVar &) fitParams[i];\n      RooRealVar * par = (RooRealVar*) fPOI.find( fitPar.GetName() );      \n      if (par) { \n         par->setVal( fitPar.getVal() );\n         par->setError( fitPar.getError() );\n      }\n   }\n  \n   \/\/ do this so profile will cache inside the absolute minimum and \n   \/\/ minimum values of nuisance parameters\n   \/\/ (no need to this here)\n   \/\/ profile->getVal(); \n   \/\/RooMsgService::instance().setGlobalKillBelow(RooFit::DEBUG) ;\n   \/\/  profile->Print();\n\n   TString name = TString(\"LikelihoodInterval_\");\/\/ + TString(GetName() ); \n\n   \/\/ make a list of fPOI with fit result values and pass to LikelihoodInterval class\n   \/\/ bestPOI is a cloned list of POI only with their best fit values \n   TIter iter = fPOI.createIterator(); \n   RooArgSet fitParSet(fitParams); \n   RooArgSet * bestPOI = new RooArgSet();  \n   while (RooAbsArg * arg =  (RooAbsArg*) iter.Next() ) { \n      RooAbsArg * p  =  fitParSet.find( arg->GetName() );\n      if (p) bestPOI->addClone(*p);\n      else bestPOI->addClone(*arg);\n   }\n   \/\/ fPOI contains the paramter of interest of the PL object \n   \/\/ and bestPOI contains a snapshot with the best fit values \n   LikelihoodInterval* interval = new LikelihoodInterval(name, profile, &fPOI, bestPOI);\n   interval->SetConfidenceLevel(1.-fSize);\n   delete constrainedParams;\n   return interval;\n}\n\n\/\/_______________________________________________________\nHypoTestResult* ProfileLikelihoodCalculator::GetHypoTest() const {\n   \/\/ Main interface to get a HypoTestResult.\n   \/\/ It does two fits:\n   \/\/ the first lets the null parameters float, so it's a maximum likelihood estimate\n   \/\/ the second is to the null (fixing null parameters to their specified values): eg. a conditional maximum likelihood\n   \/\/ the ratio of the likelihood at the conditional MLE to the MLE is the profile likelihood ratio.\n   \/\/ Wilks' theorem is used to get p-values \n\n\/\/    RooAbsPdf* pdf   = fWS->pdf(fPdfName);\n\/\/    RooAbsData* data = fWS->data(fDataName);\n   RooAbsPdf * pdf = GetPdf();\n   RooAbsData* data = GetData(); \n\n\n   if (!data || !pdf) return 0;\n\n   if (fNullParams.getSize() == 0) return 0; \n\n   \/\/ make a clone and ordered list since a vector will be associated to keep parameter values\n   \/\/ clone the list since first fit will changes the fNullParams values\n   RooArgList poiList; \n   poiList.addClone(fNullParams); \/\/ make a clone list \n\n\n   \/\/ do a global fit \n   if (!fFitResult) DoGlobalFit(); \n   if (!fFitResult) return 0; \n\n   RooArgSet* constrainedParams = pdf->getParameters(*data);\n   RemoveConstantParameters(constrainedParams);\n\n   \/\/ perform a global fit if it is not done before\n   if (!fFitResult) DoGlobalFit(); \n   Double_t NLLatMLE= fFitResult->minNll();\n\n   \/\/ set POI to given values, set constant, calculate conditional MLE\n   std::vector<double> oldValues(poiList.getSize() ); \n   for (unsigned int i = 0; i < oldValues.size(); ++i) { \n      RooRealVar * mytarget = (RooRealVar*) constrainedParams->find(poiList[i].GetName());\n      if (mytarget) { \n         oldValues[i] = mytarget->getVal(); \n         mytarget->setVal( ( (RooRealVar&) poiList[i] ).getVal() );\n         mytarget->setConstant(kTRUE);\n      }\n   }\n\n   \n\n   \/\/ perform the fit only if nuisance parameters are available\n   \/\/ get nuisance parameters\n   \/\/ nuisance parameters are the non const parameters from the likelihood parameters\n   RooArgSet nuisParams(*constrainedParams);\n\n   \/\/ need to remove the parameter of interest\n   RemoveConstantParameters(&nuisParams);\n\n   \/\/ check there are variable parameter in order to do a fit \n   bool existVarParams = false; \n   TIter it = nuisParams.createIterator();\n   RooRealVar * myarg = 0; \n   while ((myarg = (RooRealVar *)it.Next())) { \n      if ( !myarg->isConstant() ) {\n         existVarParams = true; \n         break;\n      }\n   }\n\n   Double_t NLLatCondMLE = NLLatMLE; \n   if (existVarParams) {\n\n      const char * minimType = ROOT::Math::MinimizerOptions::DefaultMinimizerType().c_str();\n      const char * minimAlgo = ROOT::Math::MinimizerOptions::DefaultMinimizerType().c_str();\n      int level = ROOT::Math::MinimizerOptions::DefaultPrintLevel()-1; \/\/ decrease here print level\n      RooFitResult* fit2 = pdf->fitTo(*data,Constrain(*constrainedParams),Hesse(kFALSE),Strategy(0), Minos(kFALSE),\n                                      Minimizer(minimType,minimAlgo), Save(kTRUE),PrintLevel(level));\n     \n      NLLatCondMLE = fit2->minNll();\n      fit2->Print();\n   }\n   else { \n      \/\/ get just the likelihood value (no need to do a fit since the likelihood is a constant function)\n      RooAbsReal* nll = pdf->createNLL(*data, CloneData(kTRUE), Constrain(*constrainedParams));\n      NLLatCondMLE = nll->getVal();\n      delete nll;\n   }\n\n   \/\/ Use Wilks' theorem to translate -2 log lambda into a signifcance\/p-value\n   Double_t deltaNLL = std::max( NLLatCondMLE-NLLatMLE, 0.);\n\n   TString name = TString(\"ProfileLRHypoTestResult_\");\/\/ + TString(GetName() ); \n   HypoTestResult* htr = \n      new HypoTestResult(name, SignificanceToPValue(sqrt( 2*deltaNLL)), 0 );\n\n\n   \/\/ restore previous value of poi\n   for (unsigned int i = 0; i < oldValues.size(); ++i) { \n      RooRealVar * mytarget = (RooRealVar*) constrainedParams->find(poiList[i].GetName());\n      if (mytarget) { \n         mytarget->setVal(oldValues[i] ); \n         mytarget->setConstant(false); \n      }\n   }\n\n   delete constrainedParams;\n   return htr;\n\n}\n\n<commit_msg>fix print level when fitting<commit_after>\/\/ @(#)root\/roostats:$Id$\n\/\/ Author: Kyle Cranmer   28\/07\/2008\n\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>\nProfileLikelihoodCalculator is a concrete implementation of CombinedCalculator \n(the interface class for a tools which can produce both RooStats HypoTestResults and ConfIntervals).  \nThe tool uses the profile likelihood ratio as a test statistic, and assumes that Wilks' theorem is valid.  \nWilks' theorem states that -2* log (profile likelihood ratio) is asymptotically distributed as a chi^2 distribution \nwith N-dof, where N is the number of degrees of freedom.  Thus, p-values can be constructed and the profile likelihood ratio\ncan be used to construct a LikelihoodInterval.\n(In the future, this class could be extended to use toy Monte Carlo to calibrate the distribution of the test statistic).\n<\/p>\n<p> Usage: It uses the interface of the CombinedCalculator, so that it can be configured by specifying:\n<ul>\n <li>a model common model (eg. a family of specific models which includes both the null and alternate),<\/li>\n <li>a data set, <\/li>\n <li>a set of parameters of interest. The nuisance parameters will be all other parameters of the model <\/li>\n <li>a set of parameters of which specify the null hypothesis (including values and const\/non-const status)  <\/li>\n<\/ul>\nThe interface allows one to pass the model, data, and parameters either directly or via a ModelConfig class.\nThe alternate hypothesis leaves the parameter free to take any value other than those specified by the null hypotesis. There is therefore no need to \nspecify the alternate parameters. \n<\/p>\n<p>\nAfter configuring the calculator, one only needs to ask GetHypoTest() (which will return a HypoTestResult pointer) or GetInterval() (which will return an ConfInterval pointer).\n<\/p>\n<p>\nThe concrete implementations of this interface should deal with the details of how the nuisance parameters are\ndealt with (eg. integration vs. profiling) and which test-statistic is used (perhaps this should be added to the interface).\n<\/p>\n<p>\nThe motivation for this interface is that we hope to be able to specify the problem in a common way for several concrete calculators.\n<\/p>\nEND_HTML\n*\/\n\/\/\n\n#ifndef RooStats_ProfileLikelihoodCalculator\n#include \"RooStats\/ProfileLikelihoodCalculator.h\"\n#endif\n\n#ifndef RooStats_RooStatsUtils\n#include \"RooStats\/RooStatsUtils.h\"\n#endif\n\n#include \"RooStats\/LikelihoodInterval.h\"\n#include \"RooStats\/HypoTestResult.h\"\n\n#include \"RooFitResult.h\"\n#include \"RooRealVar.h\"\n#include \"RooProfileLL.h\"\n#include \"RooNLLVar.h\"\n#include \"RooGlobalFunc.h\"\n\n#include \"Math\/MinimizerOptions.h\"\n\/\/#include \"RooProdPdf.h\"\n\nClassImp(RooStats::ProfileLikelihoodCalculator) ;\n\nusing namespace RooFit;\nusing namespace RooStats;\n\n\n\/\/_______________________________________________________\nProfileLikelihoodCalculator::ProfileLikelihoodCalculator() : \n   CombinedCalculator(), fFitResult(0)\n{\n   \/\/ default constructor\n}\n\nProfileLikelihoodCalculator::ProfileLikelihoodCalculator(RooAbsData& data, RooAbsPdf& pdf, const RooArgSet& paramsOfInterest, \n                                                         Double_t size, const RooArgSet* nullParams ) :\n   CombinedCalculator(data,pdf, paramsOfInterest, size, nullParams ), \n   fFitResult(0)\n{\n   \/\/ constructor from pdf and parameters\n   \/\/ the pdf must contain eventually the nuisance parameters\n}\n\nProfileLikelihoodCalculator::ProfileLikelihoodCalculator(RooAbsData& data,  ModelConfig& model, Double_t size) :\n   CombinedCalculator(data, model, size), \n   fFitResult(0)\n{\n   \/\/ construct from a ModelConfig. Assume data model.GetPdf() will provide full description of model including \n   \/\/ constraint term on the nuisances parameters\n   assert(model.GetPdf() );\n}\n\n\n\/\/_______________________________________________________\nProfileLikelihoodCalculator::~ProfileLikelihoodCalculator(){\n   \/\/ destructor\n   \/\/ cannot delete prod pdf because it will delete all the composing pdf's\n\/\/    if (fOwnPdf) delete fPdf; \n\/\/    fPdf = 0; \n   if (fFitResult) delete fFitResult; \n}\n\nvoid ProfileLikelihoodCalculator::DoReset() const { \n   \/\/ reset and clear fit result \n   \/\/ to be called when a new model or data are set in the calculator \n   if (fFitResult) delete fFitResult; \n   fFitResult = 0; \n}\n\nvoid  ProfileLikelihoodCalculator::DoGlobalFit() const { \n   \/\/ perform a global fit of the likelihood letting with all parameter of interest and \n   \/\/ nuisance parameters \n   \/\/ keep the list of fitted parameters \n\n   DoReset(); \n   RooAbsPdf * pdf = GetPdf();\n   RooAbsData* data = GetData(); \n   if (!data || !pdf ) return;\n\n   \/\/ get all non-const parameters\n   RooArgSet* constrainedParams = pdf->getParameters(*data);\n   if (!constrainedParams) return ; \n   RemoveConstantParameters(constrainedParams);\n\n   \/\/ calculate MLE \n   const char * minimType = ROOT::Math::MinimizerOptions::DefaultMinimizerType().c_str();\n   const char * minimAlgo = ROOT::Math::MinimizerOptions::DefaultMinimizerAlgo().c_str();\n   int strategy = ROOT::Math::MinimizerOptions::DefaultStrategy();\n   int level = ROOT::Math::MinimizerOptions::DefaultPrintLevel() -1;\/\/ RooFit level starts from  -1\n   ooccoutI((TObject*)0,Minimization) << \"ProfileLikelihoodCalcultor::DoGlobalFit - using \" << minimType << \" \/ \" << minimAlgo << \" with strategy \" << strategy << std::endl;\n   RooFitResult* fit = pdf->fitTo(*data, Constrain(*constrainedParams),Strategy(strategy),PrintLevel(level),\n                                  Hesse(kFALSE),Save(kTRUE),Minimizer(minimType,minimAlgo));\n  \n   \/\/ for debug \n   fit->Print();\n\n   delete constrainedParams; \n   \/\/ store fit result for further use \n   fFitResult =  fit; \n   if (fFitResult == 0) \n      oocoutW((TObject*)0,Minimization) << \"ProfileLikelihoodCalcultor::DoGlobalFit -  Global fit failed \" << std::endl;      \n\n}\n\n\/\/_______________________________________________________\nLikelihoodInterval* ProfileLikelihoodCalculator::GetInterval() const {\n   \/\/ Main interface to get a RooStats::ConfInterval.  \n   \/\/ It constructs a profile likelihood ratio and uses that to construct a RooStats::LikelihoodInterval.\n\n\/\/    RooAbsPdf* pdf   = fWS->pdf(fPdfName);\n\/\/    RooAbsData* data = fWS->data(fDataName);\n   RooAbsPdf * pdf = GetPdf();\n   RooAbsData* data = GetData(); \n   if (!data || !pdf || fPOI.getSize() == 0) return 0;\n\n   RooArgSet* constrainedParams = pdf->getParameters(*data);\n   RemoveConstantParameters(constrainedParams);\n\n\n   \/*\n   RooNLLVar* nll = new RooNLLVar(\"nll\",\"\",*pdf,*data, Extended(),Constrain(*constrainedParams));\n   RooProfileLL* profile = new RooProfileLL(\"pll\",\"\",*nll, *fPOI);\n   profile->addOwnedComponents(*nll) ;  \/\/ to avoid memory leak\n   *\/\n\n   RooAbsReal* nll = pdf->createNLL(*data, CloneData(kTRUE), Constrain(*constrainedParams));\n   RooAbsReal* profile = nll->createProfile(fPOI);\n   profile->addOwnedComponents(*nll) ;  \/\/ to avoid memory leak\n\n\n   \/\/RooMsgService::instance().setGlobalKillBelow(RooFit::FATAL) ;\n   \/\/ perform a Best Fit \n   if (!fFitResult) DoGlobalFit();\n   \/\/ if fit fails return\n   if (!fFitResult)   return 0;\n\n   \/\/ t.b.f. \" RooProfileLL should keep and provide possibility to query on global minimum\n   \/\/ set POI to fit value (this will speed up profileLL calculation of global minimum)\n   const RooArgList & fitParams = fFitResult->floatParsFinal(); \n   for (int i = 0; i < fitParams.getSize(); ++i) {\n      RooRealVar & fitPar =  (RooRealVar &) fitParams[i];\n      RooRealVar * par = (RooRealVar*) fPOI.find( fitPar.GetName() );      \n      if (par) { \n         par->setVal( fitPar.getVal() );\n         par->setError( fitPar.getError() );\n      }\n   }\n  \n   \/\/ do this so profile will cache inside the absolute minimum and \n   \/\/ minimum values of nuisance parameters\n   \/\/ (no need to this here)\n   \/\/ profile->getVal(); \n   \/\/RooMsgService::instance().setGlobalKillBelow(RooFit::DEBUG) ;\n   \/\/  profile->Print();\n\n   TString name = TString(\"LikelihoodInterval_\");\/\/ + TString(GetName() ); \n\n   \/\/ make a list of fPOI with fit result values and pass to LikelihoodInterval class\n   \/\/ bestPOI is a cloned list of POI only with their best fit values \n   TIter iter = fPOI.createIterator(); \n   RooArgSet fitParSet(fitParams); \n   RooArgSet * bestPOI = new RooArgSet();  \n   while (RooAbsArg * arg =  (RooAbsArg*) iter.Next() ) { \n      RooAbsArg * p  =  fitParSet.find( arg->GetName() );\n      if (p) bestPOI->addClone(*p);\n      else bestPOI->addClone(*arg);\n   }\n   \/\/ fPOI contains the paramter of interest of the PL object \n   \/\/ and bestPOI contains a snapshot with the best fit values \n   LikelihoodInterval* interval = new LikelihoodInterval(name, profile, &fPOI, bestPOI);\n   interval->SetConfidenceLevel(1.-fSize);\n   delete constrainedParams;\n   return interval;\n}\n\n\/\/_______________________________________________________\nHypoTestResult* ProfileLikelihoodCalculator::GetHypoTest() const {\n   \/\/ Main interface to get a HypoTestResult.\n   \/\/ It does two fits:\n   \/\/ the first lets the null parameters float, so it's a maximum likelihood estimate\n   \/\/ the second is to the null (fixing null parameters to their specified values): eg. a conditional maximum likelihood\n   \/\/ the ratio of the likelihood at the conditional MLE to the MLE is the profile likelihood ratio.\n   \/\/ Wilks' theorem is used to get p-values \n\n\/\/    RooAbsPdf* pdf   = fWS->pdf(fPdfName);\n\/\/    RooAbsData* data = fWS->data(fDataName);\n   RooAbsPdf * pdf = GetPdf();\n   RooAbsData* data = GetData(); \n\n\n   if (!data || !pdf) return 0;\n\n   if (fNullParams.getSize() == 0) return 0; \n\n   \/\/ make a clone and ordered list since a vector will be associated to keep parameter values\n   \/\/ clone the list since first fit will changes the fNullParams values\n   RooArgList poiList; \n   poiList.addClone(fNullParams); \/\/ make a clone list \n\n\n   \/\/ do a global fit \n   if (!fFitResult) DoGlobalFit(); \n   if (!fFitResult) return 0; \n\n   RooArgSet* constrainedParams = pdf->getParameters(*data);\n   RemoveConstantParameters(constrainedParams);\n\n   \/\/ perform a global fit if it is not done before\n   if (!fFitResult) DoGlobalFit(); \n   Double_t NLLatMLE= fFitResult->minNll();\n\n   \/\/ set POI to given values, set constant, calculate conditional MLE\n   std::vector<double> oldValues(poiList.getSize() ); \n   for (unsigned int i = 0; i < oldValues.size(); ++i) { \n      RooRealVar * mytarget = (RooRealVar*) constrainedParams->find(poiList[i].GetName());\n      if (mytarget) { \n         oldValues[i] = mytarget->getVal(); \n         mytarget->setVal( ( (RooRealVar&) poiList[i] ).getVal() );\n         mytarget->setConstant(kTRUE);\n      }\n   }\n\n   \n\n   \/\/ perform the fit only if nuisance parameters are available\n   \/\/ get nuisance parameters\n   \/\/ nuisance parameters are the non const parameters from the likelihood parameters\n   RooArgSet nuisParams(*constrainedParams);\n\n   \/\/ need to remove the parameter of interest\n   RemoveConstantParameters(&nuisParams);\n\n   \/\/ check there are variable parameter in order to do a fit \n   bool existVarParams = false; \n   TIter it = nuisParams.createIterator();\n   RooRealVar * myarg = 0; \n   while ((myarg = (RooRealVar *)it.Next())) { \n      if ( !myarg->isConstant() ) {\n         existVarParams = true; \n         break;\n      }\n   }\n\n   Double_t NLLatCondMLE = NLLatMLE; \n   if (existVarParams) {\n\n      const char * minimType = ROOT::Math::MinimizerOptions::DefaultMinimizerType().c_str();\n      const char * minimAlgo = ROOT::Math::MinimizerOptions::DefaultMinimizerType().c_str();\n      int level = ROOT::Math::MinimizerOptions::DefaultPrintLevel()-1; \/\/ RooFit levels starts from -1\n      RooFitResult* fit2 = pdf->fitTo(*data,Constrain(*constrainedParams),Hesse(kFALSE),Strategy(0), Minos(kFALSE),\n                                      Minimizer(minimType,minimAlgo), Save(kTRUE),PrintLevel(level));\n     \n      NLLatCondMLE = fit2->minNll();\n      fit2->Print();\n   }\n   else { \n      \/\/ get just the likelihood value (no need to do a fit since the likelihood is a constant function)\n      RooAbsReal* nll = pdf->createNLL(*data, CloneData(kTRUE), Constrain(*constrainedParams));\n      NLLatCondMLE = nll->getVal();\n      delete nll;\n   }\n\n   \/\/ Use Wilks' theorem to translate -2 log lambda into a signifcance\/p-value\n   Double_t deltaNLL = std::max( NLLatCondMLE-NLLatMLE, 0.);\n\n   TString name = TString(\"ProfileLRHypoTestResult_\");\/\/ + TString(GetName() ); \n   HypoTestResult* htr = \n      new HypoTestResult(name, SignificanceToPValue(sqrt( 2*deltaNLL)), 0 );\n\n\n   \/\/ restore previous value of poi\n   for (unsigned int i = 0; i < oldValues.size(); ++i) { \n      RooRealVar * mytarget = (RooRealVar*) constrainedParams->find(poiList[i].GetName());\n      if (mytarget) { \n         mytarget->setVal(oldValues[i] ); \n         mytarget->setConstant(false); \n      }\n   }\n\n   delete constrainedParams;\n   return htr;\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * Copyright 2017 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\n#include <inttypes.h>\n#include <memory>\n\n#include <Oscillator.h>\n\n#include \"HelloOboeEngine.h\"\n#include \"SoundGenerator.h\"\n\n\n\/**\n * Main audio engine for the HelloOboe sample. It is responsible for:\n *\n * - Creating a callback object which is supplied when constructing the audio stream, and will be\n * called when the stream starts\n * - Restarting the stream when user-controllable properties (Audio API, channel count etc) are\n * changed, and when the stream is disconnected (e.g. when headphones are attached)\n * - Calculating the audio latency of the stream\n *\n *\/\nHelloOboeEngine::HelloOboeEngine()\n        : mLatencyCallback(std::make_unique<LatencyTuningCallback>()),\n        mErrorCallback(std::make_unique<DefaultErrorCallback>(*this)) {\n}\n\ndouble HelloOboeEngine::getCurrentOutputLatencyMillis() {\n    if (!mIsLatencyDetectionSupported) return -1.0;\n\n    std::lock_guard<std::mutex> lock(mLock);\n    if (!mStream) return -1.0;\n\n    \/\/ Get the time that a known audio frame was presented for playing\n    auto result = mStream->getTimestamp(CLOCK_MONOTONIC);\n    double outputLatencyMillis = -1;\n    const int64_t kNanosPerMillisecond = 1000000;\n    if (result == oboe::Result::OK) {\n        oboe::FrameTimestamp playedFrame = result.value();\n        \/\/ Get the write index for the next audio frame\n        int64_t writeIndex = mStream->getFramesWritten();\n        \/\/ Calculate the number of frames between our known frame and the write index\n        int64_t frameIndexDelta = writeIndex - playedFrame.position;\n        \/\/ Calculate the time which the next frame will be presented\n        int64_t frameTimeDelta = (frameIndexDelta * oboe::kNanosPerSecond) \/  (mStream->getSampleRate());\n        int64_t nextFramePresentationTime = playedFrame.timestamp + frameTimeDelta;\n        \/\/ Assume that the next frame will be written at the current time\n        using namespace std::chrono;\n        int64_t nextFrameWriteTime =\n                duration_cast<nanoseconds>(steady_clock::now().time_since_epoch()).count();\n        \/\/ Calculate the latency\n        outputLatencyMillis = static_cast<double>(nextFramePresentationTime - nextFrameWriteTime)\n                         \/ kNanosPerMillisecond;\n    } else {\n        LOGE(\"Error calculating latency: %s\", oboe::convertToText(result.error()));\n    }\n    return outputLatencyMillis;\n}\n\nvoid HelloOboeEngine::setBufferSizeInBursts(int32_t numBursts) {\n    std::lock_guard<std::mutex> lock(mLock);\n    if (!mStream) return;\n\n    mLatencyCallback->setBufferTuneEnabled(numBursts == kBufferSizeAutomatic);\n    auto result = mStream->setBufferSizeInFrames(\n            numBursts * mStream->getFramesPerBurst());\n    if (result) {\n        LOGD(\"Buffer size successfully changed to %d\", result.value());\n    } else {\n        LOGW(\"Buffer size could not be changed, %d\", result.error());\n    }\n}\n\nvoid HelloOboeEngine::setAudioApi(oboe::AudioApi audioApi) {\n    if (mAudioApi != audioApi) {\n        mAudioApi = audioApi;\n        reopenStream();\n    }\n}\n\nvoid HelloOboeEngine::setChannelCount(int channelCount) {\n    if (mChannelCount != channelCount) {\n        mChannelCount = channelCount;\n        reopenStream();\n    }\n}\n\nvoid HelloOboeEngine::setDeviceId(int32_t deviceId) {\n    if (mDeviceId != deviceId) {\n        mDeviceId = deviceId;\n        if (reopenStream() != oboe::Result::OK) {\n            LOGW(\"Open stream failed, forcing deviceId to Unspecified\");\n            mDeviceId = oboe::Unspecified;\n        }\n    }\n}\n\nbool HelloOboeEngine::isLatencyDetectionSupported() {\n    return mIsLatencyDetectionSupported;\n}\n\nvoid HelloOboeEngine::tap(bool isDown) {\n    if (mAudioSource) {\n        mAudioSource->tap(isDown);\n    }\n}\n\noboe::Result HelloOboeEngine::openPlaybackStream() {\n    oboe::AudioStreamBuilder builder;\n    oboe::Result result = builder.setSharingMode(oboe::SharingMode::Exclusive)\n        ->setPerformanceMode(oboe::PerformanceMode::LowLatency)\n        ->setFormat(oboe::AudioFormat::Float)\n        ->setFormatConversionAllowed(true)\n        ->setDataCallback(mLatencyCallback.get())\n        ->setErrorCallback(mErrorCallback.get())\n        ->setAudioApi(mAudioApi)\n        ->setChannelCount(mChannelCount)\n        ->setDeviceId(mDeviceId)\n        ->openStream(mStream);\n    if (result == oboe::Result::OK) {\n        mChannelCount = mStream->getChannelCount();\n    }\n    return result;\n}\n\nvoid HelloOboeEngine::restart() {\n    \/\/ The stream will have already been closed by the error callback.\n    mLatencyCallback->reset();\n    start();\n}\n\noboe::Result HelloOboeEngine::start() {\n    std::lock_guard<std::mutex> lock(mLock);\n    mIsLatencyDetectionSupported = false;\n    auto result = openPlaybackStream();\n    if (result == oboe::Result::OK){\n        mAudioSource =  std::make_shared<SoundGenerator>(mStream->getSampleRate(),\n                mStream->getChannelCount());\n        mLatencyCallback->setSource(std::dynamic_pointer_cast<IRenderableAudio>(mAudioSource));\n\n        LOGD(\"Stream opened: AudioAPI = %d, channelCount = %d, deviceID = %d\",\n                 mStream->getAudioApi(),\n                 mStream->getChannelCount(),\n                 mStream->getDeviceId());\n\n        result = mStream->start();\n        if (result != oboe::Result::OK) {\n            LOGE(\"Error starting playback stream. Error: %s\", oboe::convertToText(result));\n            mStream->close();\n            mStream.reset();\n        } else {\n            mIsLatencyDetectionSupported = (mStream->getTimestamp((CLOCK_MONOTONIC)) !=\n                                            oboe::Result::ErrorUnimplemented);\n        }\n    } else {\n        LOGE(\"Error creating playback stream. Error: %s\", oboe::convertToText(result));\n    }\n    return result;\n}\n\noboe::Result HelloOboeEngine::stop() {\n    oboe::Result result = oboe::Result::OK;\n    \/\/ Stop, close and delete in case not already closed.\n    std::lock_guard<std::mutex> lock(mLock);\n    if (mStream) {\n        result = mStream->stop();\n        mStream->close();\n        mStream.reset();\n    }\n    return result;\n}\n\noboe::Result HelloOboeEngine::reopenStream() {\n    if (mStream) {\n        stop();\n        return start();\n    } else {\n        return oboe::Result::OK;\n    }\n}\n<commit_msg>use calculateLatencyMillis in hello oboe (#1423)<commit_after>\/**\n * Copyright 2017 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\n#include <inttypes.h>\n#include <memory>\n\n#include <Oscillator.h>\n\n#include \"HelloOboeEngine.h\"\n#include \"SoundGenerator.h\"\n\n\n\/**\n * Main audio engine for the HelloOboe sample. It is responsible for:\n *\n * - Creating a callback object which is supplied when constructing the audio stream, and will be\n * called when the stream starts\n * - Restarting the stream when user-controllable properties (Audio API, channel count etc) are\n * changed, and when the stream is disconnected (e.g. when headphones are attached)\n * - Calculating the audio latency of the stream\n *\n *\/\nHelloOboeEngine::HelloOboeEngine()\n        : mLatencyCallback(std::make_unique<LatencyTuningCallback>()),\n        mErrorCallback(std::make_unique<DefaultErrorCallback>(*this)) {\n}\n\ndouble HelloOboeEngine::getCurrentOutputLatencyMillis() {\n    if (!mIsLatencyDetectionSupported) return -1.0;\n\n    std::lock_guard<std::mutex> lock(mLock);\n    if (!mStream) return -1.0;\n\n    oboe::ResultWithValue<double> latencyResult = mStream->calculateLatencyMillis();\n    if (latencyResult) {\n        return latencyResult.value();\n    } else {\n        LOGE(\"Error calculating latency: %s\", oboe::convertToText(latencyResult.error()));\n        return -1.0;\n    }\n}\n\nvoid HelloOboeEngine::setBufferSizeInBursts(int32_t numBursts) {\n    std::lock_guard<std::mutex> lock(mLock);\n    if (!mStream) return;\n\n    mLatencyCallback->setBufferTuneEnabled(numBursts == kBufferSizeAutomatic);\n    auto result = mStream->setBufferSizeInFrames(\n            numBursts * mStream->getFramesPerBurst());\n    if (result) {\n        LOGD(\"Buffer size successfully changed to %d\", result.value());\n    } else {\n        LOGW(\"Buffer size could not be changed, %d\", result.error());\n    }\n}\n\nvoid HelloOboeEngine::setAudioApi(oboe::AudioApi audioApi) {\n    if (mAudioApi != audioApi) {\n        mAudioApi = audioApi;\n        reopenStream();\n    }\n}\n\nvoid HelloOboeEngine::setChannelCount(int channelCount) {\n    if (mChannelCount != channelCount) {\n        mChannelCount = channelCount;\n        reopenStream();\n    }\n}\n\nvoid HelloOboeEngine::setDeviceId(int32_t deviceId) {\n    if (mDeviceId != deviceId) {\n        mDeviceId = deviceId;\n        if (reopenStream() != oboe::Result::OK) {\n            LOGW(\"Open stream failed, forcing deviceId to Unspecified\");\n            mDeviceId = oboe::Unspecified;\n        }\n    }\n}\n\nbool HelloOboeEngine::isLatencyDetectionSupported() {\n    return mIsLatencyDetectionSupported;\n}\n\nvoid HelloOboeEngine::tap(bool isDown) {\n    if (mAudioSource) {\n        mAudioSource->tap(isDown);\n    }\n}\n\noboe::Result HelloOboeEngine::openPlaybackStream() {\n    oboe::AudioStreamBuilder builder;\n    oboe::Result result = builder.setSharingMode(oboe::SharingMode::Exclusive)\n        ->setPerformanceMode(oboe::PerformanceMode::LowLatency)\n        ->setFormat(oboe::AudioFormat::Float)\n        ->setFormatConversionAllowed(true)\n        ->setDataCallback(mLatencyCallback.get())\n        ->setErrorCallback(mErrorCallback.get())\n        ->setAudioApi(mAudioApi)\n        ->setChannelCount(mChannelCount)\n        ->setDeviceId(mDeviceId)\n        ->openStream(mStream);\n    if (result == oboe::Result::OK) {\n        mChannelCount = mStream->getChannelCount();\n    }\n    return result;\n}\n\nvoid HelloOboeEngine::restart() {\n    \/\/ The stream will have already been closed by the error callback.\n    mLatencyCallback->reset();\n    start();\n}\n\noboe::Result HelloOboeEngine::start() {\n    std::lock_guard<std::mutex> lock(mLock);\n    mIsLatencyDetectionSupported = false;\n    auto result = openPlaybackStream();\n    if (result == oboe::Result::OK){\n        mAudioSource =  std::make_shared<SoundGenerator>(mStream->getSampleRate(),\n                mStream->getChannelCount());\n        mLatencyCallback->setSource(std::dynamic_pointer_cast<IRenderableAudio>(mAudioSource));\n\n        LOGD(\"Stream opened: AudioAPI = %d, channelCount = %d, deviceID = %d\",\n                 mStream->getAudioApi(),\n                 mStream->getChannelCount(),\n                 mStream->getDeviceId());\n\n        result = mStream->start();\n        if (result != oboe::Result::OK) {\n            LOGE(\"Error starting playback stream. Error: %s\", oboe::convertToText(result));\n            mStream->close();\n            mStream.reset();\n        } else {\n            mIsLatencyDetectionSupported = (mStream->getTimestamp((CLOCK_MONOTONIC)) !=\n                                            oboe::Result::ErrorUnimplemented);\n        }\n    } else {\n        LOGE(\"Error creating playback stream. Error: %s\", oboe::convertToText(result));\n    }\n    return result;\n}\n\noboe::Result HelloOboeEngine::stop() {\n    oboe::Result result = oboe::Result::OK;\n    \/\/ Stop, close and delete in case not already closed.\n    std::lock_guard<std::mutex> lock(mLock);\n    if (mStream) {\n        result = mStream->stop();\n        mStream->close();\n        mStream.reset();\n    }\n    return result;\n}\n\noboe::Result HelloOboeEngine::reopenStream() {\n    if (mStream) {\n        stop();\n        return start();\n    } else {\n        return oboe::Result::OK;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  TimerImpl.cpp\n#include \"common\/RhoStd.h\"\n#include \"common\/AutoPointer.h\"\n#include \"common\/RhodesApp.h\"\n#include \"common\/RhoConf.h\"\n#include \"common\/RhoTime.h\"\n#include \"generated\/cpp\/TimerBase.h\"\n#include \"logging\/RhoLog.h\"\n#include <stdlib.h>\n\nnamespace rho \n{    \n\tclass CTimerFactory;\n\n    using namespace apiGenerator;\n    using namespace common;\n    \n    class CTimerSingletonImpl: public CTimerSingletonBase\n    {\n\t\tstatic unsigned int createdTimers;\n\n    public:\n        \n        CTimerSingletonImpl(): CTimerSingletonBase(){}\n        \n        \/\/methods\n        \/\/ create Create a timers objects. \n        virtual void create(rho::apiGenerator::CMethodResult& oResult) \n\t\t{\n\t\t\t++createdTimers;\n\n\t\t\tchar buf[10];\n            sprintf(buf, \"%d\", createdTimers);\n\t\t\toResult.set(buf);\n        } \n        \/\/ enumerate This is documentation \n        virtual void enumerate(rho::apiGenerator::CMethodResult& oResult) { } \n    };\n    \n\tunsigned int  CTimerSingletonImpl::createdTimers = 0;\n\n    class CTimerImpl : public CTimerBase, public common::CRhoTimer::ICallback\n    {\n\tprivate:\n\t\tclass TimerResultThread : public CRhoThread\n\t\t{\n\t\tprivate:\n\t\t\trho::apiGenerator::CMethodResult m_oResult;\n\n\t\tpublic:\n\t\t\tTimerResultThread(const rho::apiGenerator::CMethodResult& oResult) : m_oResult(oResult) {}\n\n\t\t\tvirtual void run()\n\t\t\t{\n\t\t\t\tm_oResult.set(\"\");\n\t\t\t}\n\t\t};\n\n\tprivate:\n\t\trho::String                      m_timerID;\n\t\trho::apiGenerator::CMethodResult m_oResult;\n\t\tTimerResultThread*               m_answerThread;\n\n    public:\n\t\tCTimerImpl(const rho::String& timerID) : m_timerID(timerID), m_answerThread(0) {}\n\t\tvirtual ~CTimerImpl() \n\t\t{\n\t\t\tif (!m_answerThread)\n\t\t\t\tdelete m_answerThread;\n\t\t}\n\n        \/\/methods\n        virtual void start( int interval, rho::apiGenerator::CMethodResult& oResult) \n\t\t{\n\t\t\tif (interval <= 0)\n\t\t\t{\n\t\t\t\toResult.setError(\"invalid interval\");\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tm_oResult = oResult;\n\t\t\tcommon::CRhoTimer& timerManager = RHODESAPP().getTimer();\n\t\t\ttimerManager.addNativeTimer(interval, this);\n        } \n\n        virtual void stop(rho::apiGenerator::CMethodResult& oResult)\n\t\t{\n\t\t\tcommon::CRhoTimer& timerManager = RHODESAPP().getTimer();\n\t\t\ttimerManager.stopNativeTimer(this);\n        } \n\n        virtual void isAlive(rho::apiGenerator::CMethodResult& oResult) \n\t\t{\n\t\t\tcommon::CRhoTimer& timerManager = RHODESAPP().getTimer();\n\t\t\toResult.set(timerManager.isNativeTimerExist(this));\n        } \n\n\t\tvirtual bool onTimer()\n\t\t{\n\t\t\tif (!m_answerThread) {\n\t\t\t\tm_answerThread = new TimerResultThread(m_oResult);\n\t\t\t}\n\n\t\t\tm_answerThread->start(IRhoRunnable::epNormal);\n\n\t\t\treturn true;\n\t\t}\n    };\n    \n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \n    class CTimerFactory: public CTimerFactoryBase    \n\t{\n    public:\n        CTimerFactory(){}\n        \n        ITimerSingleton* createModuleSingleton()\n        { \n            return new CTimerSingletonImpl();\n        }\n        \n        virtual ITimer* createModuleByID(const rho::String& strID){ \n\t\t\treturn new CTimerImpl(strID);\n\t\t};\n\n\t\tunsigned int getAliveTimers() const\n\t\t{\n\t\t\treturn m_hashModules.size();\n\t\t}\n    };\n    \n}\n\nextern \"C\" void Init_Timer_extension()\n{\n    rho::CTimerFactory::setInstance( new rho::CTimerFactory() );\n    rho::Init_Timer_API();\n#ifndef RHO_NO_RUBY_API\n    RHODESAPP().getExtManager().requireRubyFile(\"RhoTimerApi\");\n#endif\n}\n<commit_msg>Update TimerImpl.cpp<commit_after>\/\/\n\/\/  TimerImpl.cpp\n#include \"common\/RhoStd.h\"\n#include \"common\/AutoPointer.h\"\n#include \"common\/RhodesApp.h\"\n#include \"common\/RhoConf.h\"\n#include \"common\/RhoTime.h\"\n#include \"generated\/cpp\/TimerBase.h\"\n#include \"logging\/RhoLog.h\"\n#include <stdlib.h>\n\nnamespace rho \n{    \n\tclass CTimerFactory;\n\n    using namespace apiGenerator;\n    using namespace common;\n    \n    class CTimerSingletonImpl: public CTimerSingletonBase\n    {\n\t\tstatic unsigned int createdTimers;\n\n    public:\n        \n        CTimerSingletonImpl(): CTimerSingletonBase(){}\n        \n        \/\/methods\n        \/\/ create Create a timers objects. \n        virtual void create(rho::apiGenerator::CMethodResult& oResult) \n\t\t{\n\t\t\t++createdTimers;\n\n\t\t\tchar buf[10];\n            sprintf(buf, \"%d\", createdTimers);\n\t\t\toResult.set(buf);\n        } \n        \/\/ enumerate This is documentation \n        virtual void enumerate(rho::apiGenerator::CMethodResult& oResult) { } \n    };\n    \n\tunsigned int  CTimerSingletonImpl::createdTimers = 0;\n\n    class CTimerImpl : public CTimerBase, public common::CRhoTimer::ICallback\n    {\n\tprivate:\n\t\tclass TimerResultThread : public CRhoThread\n\t\t{\n\t\tprivate:\n\t\t\trho::apiGenerator::CMethodResult m_oResult;\n\n\t\tpublic:\n\t\t\tTimerResultThread(const rho::apiGenerator::CMethodResult& oResult) : m_oResult(oResult) {}\n\n\t\t\tvirtual void run()\n\t\t\t{\n\t\t\t\twhile ( !RHODESAPP().isApplicationActive() ) {\n\t\t\t\t\twait(100);\n\t\t\t\t}\n\t\t\t\tm_oResult.set(\"\");\n\t\t\t}\n\t\t};\n\n\tprivate:\n\t\trho::String                      m_timerID;\n\t\trho::apiGenerator::CMethodResult m_oResult;\n\t\tTimerResultThread*               m_answerThread;\n\n    public:\n\t\tCTimerImpl(const rho::String& timerID) : m_timerID(timerID), m_answerThread(0) {}\n\t\tvirtual ~CTimerImpl() \n\t\t{\n\t\t\tif (!m_answerThread)\n\t\t\t\tdelete m_answerThread;\n\t\t}\n\n        \/\/methods\n        virtual void start( int interval, rho::apiGenerator::CMethodResult& oResult) \n\t\t{\n\t\t\tif (interval <= 0)\n\t\t\t{\n\t\t\t\toResult.setError(\"invalid interval\");\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tm_oResult = oResult;\n\t\t\tcommon::CRhoTimer& timerManager = RHODESAPP().getTimer();\n\t\t\ttimerManager.addNativeTimer(interval, this);\n        } \n\n        virtual void stop(rho::apiGenerator::CMethodResult& oResult)\n\t\t{\n\t\t\tcommon::CRhoTimer& timerManager = RHODESAPP().getTimer();\n\t\t\ttimerManager.stopNativeTimer(this);\n        } \n\n        virtual void isAlive(rho::apiGenerator::CMethodResult& oResult) \n\t\t{\n\t\t\tcommon::CRhoTimer& timerManager = RHODESAPP().getTimer();\n\t\t\toResult.set(timerManager.isNativeTimerExist(this));\n        } \n\n\t\tvirtual bool onTimer()\n\t\t{\n\t\t\tif (!m_answerThread) {\n\t\t\t\tm_answerThread = new TimerResultThread(m_oResult);\n\t\t\t}\n\n\t\t\tm_answerThread->start(IRhoRunnable::epNormal);\n\n\t\t\treturn true;\n\t\t}\n    };\n    \n    \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \n    class CTimerFactory: public CTimerFactoryBase    \n\t{\n    public:\n        CTimerFactory(){}\n        \n        ITimerSingleton* createModuleSingleton()\n        { \n            return new CTimerSingletonImpl();\n        }\n        \n        virtual ITimer* createModuleByID(const rho::String& strID){ \n\t\t\treturn new CTimerImpl(strID);\n\t\t};\n\n\t\tunsigned int getAliveTimers() const\n\t\t{\n\t\t\treturn m_hashModules.size();\n\t\t}\n    };\n    \n}\n\nextern \"C\" void Init_Timer_extension()\n{\n    rho::CTimerFactory::setInstance( new rho::CTimerFactory() );\n    rho::Init_Timer_API();\n#ifndef RHO_NO_RUBY_API\n    RHODESAPP().getExtManager().requireRubyFile(\"RhoTimerApi\");\n#endif\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"MacauPrior.h\"\n\n#include <SmurffCpp\/IO\/MatrixIO.h>\n#include <SmurffCpp\/IO\/GenericIO.h>\n\n#include <SmurffCpp\/Utils\/Distribution.h>\n#include <SmurffCpp\/Utils\/Error.h>\n#include <SmurffCpp\/Utils\/counters.h>\n\n#include <SmurffCpp\/Utils\/linop.h>\n\n#include <ios>\n\nusing namespace smurff;\n\nMacauPrior::MacauPrior()\n   : NormalPrior() \n{\n}\n\nMacauPrior::MacauPrior(std::shared_ptr<Session> session, uint32_t mode)\n   : NormalPrior(session, mode, \"MacauPrior\")\n{\n   beta_precision = SideInfoConfig::BETA_PRECISION_DEFAULT_VALUE;\n   tol = SideInfoConfig::TOL_DEFAULT_VALUE;\n\n   enable_beta_precision_sampling = Config::ENABLE_BETA_PRECISION_SAMPLING_DEFAULT_VALUE;\n}\n\nMacauPrior::~MacauPrior()\n{\n}\n\nvoid MacauPrior::init()\n{\n   NormalPrior::init();\n\n   THROWERROR_ASSERT_MSG(Features->rows() == num_item(), \"Number of rows in train must be equal to number of rows in features\");\n\n   if (use_FtF)\n   {\n      std::uint64_t dim = num_feat();\n      FtF_plus_precision.resize(dim, dim);\n      Features->At_mul_A(FtF_plus_precision);\n      FtF_plus_precision.diagonal().array() += beta_precision;\n   }\n\n   Uhat.resize(num_latent(), Features->rows());\n   Uhat.setZero();\n\n   m_beta = std::make_shared<Eigen::MatrixXd>(num_latent(), num_feat());\n   beta().setZero();\n\n   m_session->model().setLinkMatrix(m_mode, m_beta);\n}\n\nvoid MacauPrior::update_prior()\n{\n    \/*\n>> compute_uhat:             0.5012     (12%) in        110\n>> main:             4.1396     (100%) in       1\n>> rest of update_prior:             0.1684     (4%) in 110\n>> sample hyper mu\/Lambda:           0.3804     (9%) in 110\n>> sample_beta:      1.4927     (36%) in        110\n>> sample_latents:           3.8824     (94%) in        220\n>> step:             3.9824     (96%) in        111\n>> update_prior:             2.5436     (61%) in        110\n*\/\n    COUNTER(\"update_prior\");\n    {\n        COUNTER(\"rest of update_prior\");\n        \/\/ residual (Uhat is later overwritten):\n        \/\/uses: U, Uhat\n        \/\/writes: Uhat\n        Udelta = U() - Uhat;\n\n    }\n\n    \/\/ sampling Gaussian\n    {\n        COUNTER(\"sample hyper mu\/Lambda\");\n        \/\/ BBt = beta * beta'\n        \/\/uses: beta\n        BBt = beta() * beta().transpose();\n        \/\/ Uses, Udelta   \n        std::tie(mu, Lambda) = CondNormalWishart(Udelta, mu0, b0,\n            WI + beta_precision * BBt, df + num_feat());\n    }\n\n    \/\/ uses: U, F\n    \/\/ writes: Ft_y\n    compute_Ft_y_omp(Ft_y);\n\n    sample_beta();\n\n    {\n        COUNTER(\"compute_uhat\");\n        \/\/ Uhat = beta * F\n        \/\/ uses: beta, F\n        \/\/ output: Uhat\n        Features->compute_uhat(Uhat, beta());\n    }\n\n    if (enable_beta_precision_sampling)\n    {\n        \/\/ uses: beta\n        \/\/ writes: FtF\n        COUNTER(\"sample_beta_precision\");\n        double old_beta = beta_precision;\n        beta_precision = sample_beta_precision(beta(), Lambda, beta_precision_nu0, beta_precision_mu0);\n        FtF_plus_precision.diagonal().array() += beta_precision - old_beta;\n   }\n}\n\nvoid MacauPrior::sample_beta()\n{\n    COUNTER(\"sample_beta\");\n    if (use_FtF)\n    {\n        \/\/ uses: FtF, Ft_y, \n        \/\/ writes: beta\n        beta() = FtF_plus_precision.llt().solve(Ft_y.transpose()).transpose();\n    } \n    else\n    {\n        \/\/ uses: Features, beta_precision, Ft_y, \n        \/\/ writes: beta\n        blockcg_iter = Features->solve_blockcg(beta(), beta_precision, Ft_y, tol, 32, 8, throw_on_cholesky_error);\n    }\n}\n\n\nconst Eigen::VectorXd MacauPrior::getMu(int n) const\n{\n   return mu + Uhat.col(n);\n}\n\nvoid MacauPrior::compute_Ft_y_omp(Eigen::MatrixXd& Ft_y)\n{\n   \/\/-- input\n   \/\/ mu, Lambda (small)\n   \/\/ U\n   \/\/ F\n   \/\/-- output\n   \/\/ Ft_y\n   \/\/ Ft_y = (U .- mu + Normal(0, Lambda^-1)) * F + std::sqrt(beta_precision) * Normal(0, Lambda^-1)\n   \/\/ Ft_y is [ D x F ] matrix\n\n   \/\/HyperU: num_latent x num_item\n   HyperU = (U() + MvNormal_prec(Lambda, num_item())).colwise() - mu;\n   Ft_y = Features->A_mul_B(HyperU); \/\/ num_latent x num_feat\n\n   \/\/--  add beta_precision \n\n   HyperU2 = MvNormal_prec(Lambda, num_feat()); \/\/ num_latent x num_feat\n\n   #pragma omp parallel for schedule(static)\n   for (int f = 0; f < num_feat(); f++)\n   {\n      for (int d = 0; d < num_latent(); d++)\n      {\n         Ft_y(d, f) += std::sqrt(beta_precision) * HyperU2(d, f);\n      }\n   }\n}\n\nvoid MacauPrior::addSideInfo(const std::shared_ptr<ISideInfo>& side_info_a, double beta_precision_a, double tolerance_a, bool direct_a, bool enable_beta_precision_sampling_a, bool throw_on_cholesky_error_a)\n{\n   \/\/FIXME: remove old code\n\n   \/\/ old code\n\n   \/\/ side information\n   Features = side_info_a;\n   beta_precision = beta_precision_a;\n   tol = tolerance_a;\n   use_FtF = direct_a;\n   enable_beta_precision_sampling = enable_beta_precision_sampling_a;\n   throw_on_cholesky_error = throw_on_cholesky_error_a;\n\n   \/\/ new code\n\n   \/\/ side information\n   side_info_values.push_back(side_info_a);\n   beta_precision_values.push_back(beta_precision_a);\n   tol_values.push_back(tolerance_a);\n   direct_values.push_back(direct_a);\n   enable_beta_precision_sampling_values.push_back(enable_beta_precision_sampling_a);\n   throw_on_cholesky_error_values.push_back(throw_on_cholesky_error_a);\n\n   \/\/ other code\n\n   \/\/ Hyper-prior for beta_precision (mean 1.0, var of 1e+3):\n   beta_precision_mu0 = 1.0;\n   beta_precision_nu0 = 1e-3;\n}\n\nbool MacauPrior::save(std::shared_ptr<const StepFile> sf) const\n{\n   NormalPrior::save(sf);\n\n   std::string path = sf->makeLinkMatrixFileName(m_mode);\n   smurff::matrix_io::eigen::write_matrix(path, beta());\n\n   return true;\n}\n\nvoid MacauPrior::restore(std::shared_ptr<const StepFile> sf)\n{\n   NormalPrior::restore(sf);\n\n   std::string path = sf->getLinkMatrixFileName(m_mode);\n\n   THROWERROR_FILE_NOT_EXIST(path);\n\n   smurff::matrix_io::eigen::read_matrix(path, beta());\n}\n\nstd::ostream& MacauPrior::info(std::ostream &os, std::string indent)\n{\n   NormalPrior::info(os, indent);\n   os << indent << \" SideInfo: \";\n   Features->print(os);\n   os << indent << \" Method: \";\n   if (use_FtF)\n   {\n      os << \"Cholesky Decomposition\";\n      double needs_gb = (double)num_feat() \/ 1024. * (double)num_feat() \/ 1024. \/ 1024.;\n      if (needs_gb > 1.0) os << \" (needing \" << needs_gb << \" GB of memory)\";\n      os << std::endl;\n   } else {\n      os << \"CG Solver with tolerance: \" << std::scientific << tol << std::fixed << std::endl;\n   }\n   os << indent << \" BetaPrecision: \";\n   if (enable_beta_precision_sampling)\n   {\n       os << \"sampled around \";\n   }\n   else\n   {\n       os << \"fixed at \";\n   }\n   os << beta_precision << std::endl;\n   return os;\n}\n\nstd::ostream& MacauPrior::status(std::ostream &os, std::string indent) const\n{\n   os << indent << m_name << \": \" << std::endl;\n   indent += \"  \";\n   os << indent << \"blockcg iter = \" << blockcg_iter << std::endl;\n   os << indent << \"FtF_plus_precision= \" << FtF_plus_precision.norm() << std::endl;\n   os << indent << \"HyperU       = \" << HyperU.norm() << std::endl;\n   os << indent << \"HyperU2      = \" << HyperU2.norm() << std::endl;\n   os << indent << \"Beta         = \" << beta().norm() << std::endl;\n   os << indent << \"beta_precision  = \" << beta_precision << std::endl;\n   os << indent << \"Ft_y         = \" << Ft_y.norm() << std::endl;\n   return os;\n}\n\nstd::pair<double, double> MacauPrior::posterior_beta_precision(Eigen::MatrixXd & beta, Eigen::MatrixXd & Lambda_u, double nu, double mu)\n{\n   const int D = beta.rows(); \/\/ num feat\n   Eigen::MatrixXd BB(D, D);\n   smurff::linop::A_mul_At_combo(BB, beta);\n   double nux = nu + beta.rows() * beta.cols();\n   double mux = mu * nux \/ (nu + mu * (BB.selfadjointView<Eigen::Lower>() * Lambda_u).trace());\n   double b = nux \/ 2;\n   double c = 2 * mux \/ nux;\n   return std::make_pair(b, c);\n}\n\ndouble MacauPrior::sample_beta_precision(Eigen::MatrixXd & beta, Eigen::MatrixXd & Lambda_u, double nu, double mu)\n{\n   auto gamma_post = posterior_beta_precision(beta, Lambda_u, nu, mu);\n   return rgamma(gamma_post.first, gamma_post.second);\n}\n<commit_msg>ENH: linop::A_mul_At -> Eigen::*<commit_after>#include \"MacauPrior.h\"\n\n#include <SmurffCpp\/IO\/MatrixIO.h>\n#include <SmurffCpp\/IO\/GenericIO.h>\n\n#include <SmurffCpp\/Utils\/Distribution.h>\n#include <SmurffCpp\/Utils\/Error.h>\n#include <SmurffCpp\/Utils\/counters.h>\n\n#include <SmurffCpp\/Utils\/linop.h>\n\n#include <ios>\n\nusing namespace smurff;\n\nMacauPrior::MacauPrior()\n   : NormalPrior() \n{\n}\n\nMacauPrior::MacauPrior(std::shared_ptr<Session> session, uint32_t mode)\n   : NormalPrior(session, mode, \"MacauPrior\")\n{\n   beta_precision = SideInfoConfig::BETA_PRECISION_DEFAULT_VALUE;\n   tol = SideInfoConfig::TOL_DEFAULT_VALUE;\n\n   enable_beta_precision_sampling = Config::ENABLE_BETA_PRECISION_SAMPLING_DEFAULT_VALUE;\n}\n\nMacauPrior::~MacauPrior()\n{\n}\n\nvoid MacauPrior::init()\n{\n   NormalPrior::init();\n\n   THROWERROR_ASSERT_MSG(Features->rows() == num_item(), \"Number of rows in train must be equal to number of rows in features\");\n\n   if (use_FtF)\n   {\n      std::uint64_t dim = num_feat();\n      FtF_plus_precision.resize(dim, dim);\n      Features->At_mul_A(FtF_plus_precision);\n      FtF_plus_precision.diagonal().array() += beta_precision;\n   }\n\n   Uhat.resize(num_latent(), Features->rows());\n   Uhat.setZero();\n\n   m_beta = std::make_shared<Eigen::MatrixXd>(num_latent(), num_feat());\n   beta().setZero();\n\n   m_session->model().setLinkMatrix(m_mode, m_beta);\n}\n\nvoid MacauPrior::update_prior()\n{\n    \/*\n>> compute_uhat:             0.5012     (12%) in        110\n>> main:             4.1396     (100%) in       1\n>> rest of update_prior:             0.1684     (4%) in 110\n>> sample hyper mu\/Lambda:           0.3804     (9%) in 110\n>> sample_beta:      1.4927     (36%) in        110\n>> sample_latents:           3.8824     (94%) in        220\n>> step:             3.9824     (96%) in        111\n>> update_prior:             2.5436     (61%) in        110\n*\/\n    COUNTER(\"update_prior\");\n    {\n        COUNTER(\"rest of update_prior\");\n        \/\/ residual (Uhat is later overwritten):\n        \/\/uses: U, Uhat\n        \/\/writes: Uhat\n        Udelta = U() - Uhat;\n\n    }\n\n    \/\/ sampling Gaussian\n    {\n        COUNTER(\"sample hyper mu\/Lambda\");\n        \/\/ BBt = beta * beta'\n        \/\/uses: beta\n        BBt = beta() * beta().transpose();\n        \/\/ Uses, Udelta   \n        std::tie(mu, Lambda) = CondNormalWishart(Udelta, mu0, b0,\n            WI + beta_precision * BBt, df + num_feat());\n    }\n\n    \/\/ uses: U, F\n    \/\/ writes: Ft_y\n    compute_Ft_y_omp(Ft_y);\n\n    sample_beta();\n\n    {\n        COUNTER(\"compute_uhat\");\n        \/\/ Uhat = beta * F\n        \/\/ uses: beta, F\n        \/\/ output: Uhat\n        Features->compute_uhat(Uhat, beta());\n    }\n\n    if (enable_beta_precision_sampling)\n    {\n        \/\/ uses: beta\n        \/\/ writes: FtF\n        COUNTER(\"sample_beta_precision\");\n        double old_beta = beta_precision;\n        beta_precision = sample_beta_precision(beta(), Lambda, beta_precision_nu0, beta_precision_mu0);\n        FtF_plus_precision.diagonal().array() += beta_precision - old_beta;\n   }\n}\n\nvoid MacauPrior::sample_beta()\n{\n    COUNTER(\"sample_beta\");\n    if (use_FtF)\n    {\n        \/\/ uses: FtF, Ft_y, \n        \/\/ writes: beta\n        beta() = FtF_plus_precision.llt().solve(Ft_y.transpose()).transpose();\n    } \n    else\n    {\n        \/\/ uses: Features, beta_precision, Ft_y, \n        \/\/ writes: beta\n        blockcg_iter = Features->solve_blockcg(beta(), beta_precision, Ft_y, tol, 32, 8, throw_on_cholesky_error);\n    }\n}\n\n\nconst Eigen::VectorXd MacauPrior::getMu(int n) const\n{\n   return mu + Uhat.col(n);\n}\n\nvoid MacauPrior::compute_Ft_y_omp(Eigen::MatrixXd& Ft_y)\n{\n   \/\/-- input\n   \/\/ mu, Lambda (small)\n   \/\/ U\n   \/\/ F\n   \/\/-- output\n   \/\/ Ft_y\n   \/\/ Ft_y = (U .- mu + Normal(0, Lambda^-1)) * F + std::sqrt(beta_precision) * Normal(0, Lambda^-1)\n   \/\/ Ft_y is [ D x F ] matrix\n\n   \/\/HyperU: num_latent x num_item\n   HyperU = (U() + MvNormal_prec(Lambda, num_item())).colwise() - mu;\n   Ft_y = Features->A_mul_B(HyperU); \/\/ num_latent x num_feat\n\n   \/\/--  add beta_precision \n\n   HyperU2 = MvNormal_prec(Lambda, num_feat()); \/\/ num_latent x num_feat\n\n   #pragma omp parallel for schedule(static)\n   for (int f = 0; f < num_feat(); f++)\n   {\n      for (int d = 0; d < num_latent(); d++)\n      {\n         Ft_y(d, f) += std::sqrt(beta_precision) * HyperU2(d, f);\n      }\n   }\n}\n\nvoid MacauPrior::addSideInfo(const std::shared_ptr<ISideInfo>& side_info_a, double beta_precision_a, double tolerance_a, bool direct_a, bool enable_beta_precision_sampling_a, bool throw_on_cholesky_error_a)\n{\n   \/\/FIXME: remove old code\n\n   \/\/ old code\n\n   \/\/ side information\n   Features = side_info_a;\n   beta_precision = beta_precision_a;\n   tol = tolerance_a;\n   use_FtF = direct_a;\n   enable_beta_precision_sampling = enable_beta_precision_sampling_a;\n   throw_on_cholesky_error = throw_on_cholesky_error_a;\n\n   \/\/ new code\n\n   \/\/ side information\n   side_info_values.push_back(side_info_a);\n   beta_precision_values.push_back(beta_precision_a);\n   tol_values.push_back(tolerance_a);\n   direct_values.push_back(direct_a);\n   enable_beta_precision_sampling_values.push_back(enable_beta_precision_sampling_a);\n   throw_on_cholesky_error_values.push_back(throw_on_cholesky_error_a);\n\n   \/\/ other code\n\n   \/\/ Hyper-prior for beta_precision (mean 1.0, var of 1e+3):\n   beta_precision_mu0 = 1.0;\n   beta_precision_nu0 = 1e-3;\n}\n\nbool MacauPrior::save(std::shared_ptr<const StepFile> sf) const\n{\n   NormalPrior::save(sf);\n\n   std::string path = sf->makeLinkMatrixFileName(m_mode);\n   smurff::matrix_io::eigen::write_matrix(path, beta());\n\n   return true;\n}\n\nvoid MacauPrior::restore(std::shared_ptr<const StepFile> sf)\n{\n   NormalPrior::restore(sf);\n\n   std::string path = sf->getLinkMatrixFileName(m_mode);\n\n   THROWERROR_FILE_NOT_EXIST(path);\n\n   smurff::matrix_io::eigen::read_matrix(path, beta());\n}\n\nstd::ostream& MacauPrior::info(std::ostream &os, std::string indent)\n{\n   NormalPrior::info(os, indent);\n   os << indent << \" SideInfo: \";\n   Features->print(os);\n   os << indent << \" Method: \";\n   if (use_FtF)\n   {\n      os << \"Cholesky Decomposition\";\n      double needs_gb = (double)num_feat() \/ 1024. * (double)num_feat() \/ 1024. \/ 1024.;\n      if (needs_gb > 1.0) os << \" (needing \" << needs_gb << \" GB of memory)\";\n      os << std::endl;\n   } else {\n      os << \"CG Solver with tolerance: \" << std::scientific << tol << std::fixed << std::endl;\n   }\n   os << indent << \" BetaPrecision: \";\n   if (enable_beta_precision_sampling)\n   {\n       os << \"sampled around \";\n   }\n   else\n   {\n       os << \"fixed at \";\n   }\n   os << beta_precision << std::endl;\n   return os;\n}\n\nstd::ostream& MacauPrior::status(std::ostream &os, std::string indent) const\n{\n   os << indent << m_name << \": \" << std::endl;\n   indent += \"  \";\n   os << indent << \"blockcg iter = \" << blockcg_iter << std::endl;\n   os << indent << \"FtF_plus_precision= \" << FtF_plus_precision.norm() << std::endl;\n   os << indent << \"HyperU       = \" << HyperU.norm() << std::endl;\n   os << indent << \"HyperU2      = \" << HyperU2.norm() << std::endl;\n   os << indent << \"Beta         = \" << beta().norm() << std::endl;\n   os << indent << \"beta_precision  = \" << beta_precision << std::endl;\n   os << indent << \"Ft_y         = \" << Ft_y.norm() << std::endl;\n   return os;\n}\n\nstd::pair<double, double> MacauPrior::posterior_beta_precision(Eigen::MatrixXd & beta, Eigen::MatrixXd & Lambda_u, double nu, double mu)\n{\n   auto BB = beta * beta.transpose();\n   double nux = nu + beta.rows() * beta.cols();\n   double mux = mu * nux \/ (nu + mu * (BB.selfadjointView<Eigen::Lower>() * Lambda_u).trace());\n   double b = nux \/ 2;\n   double c = 2 * mux \/ nux;\n   return std::make_pair(b, c);\n}\n\ndouble MacauPrior::sample_beta_precision(Eigen::MatrixXd & beta, Eigen::MatrixXd & Lambda_u, double nu, double mu)\n{\n   auto gamma_post = posterior_beta_precision(beta, Lambda_u, nu, mu);\n   return rgamma(gamma_post.first, gamma_post.second);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file utils\/serialization_kdtree.hpp\n * @brief VLFeat KD-tree serialization\n * @author Paolo D'Apice\n * @author Adrea Vedaldi\n *\/\n\n#ifndef VIS_DETAIL_SERIALIZATION_KDTREE_HPP\n#define VIS_DETAIL_SERIALIZATION_KDTREE_HPP\n\n#include <boost\/assert.hpp>\n#include <boost\/serialization\/split_free.hpp>\nextern \"C\" {\n#include <vl\/kdtree.h>\n}\n\nBOOST_SERIALIZATION_SPLIT_FREE(VlKDForest)\n\n\/\/\/ Taken from VLFeat's toolbox\/misc\/kdtree.h\nvoid\nrestore_parent_recursively(VlKDTree* tree, int nodeIndex, int* numNodesToVisit) {\n    VlKDTreeNode* node = tree->nodes + nodeIndex;\n    int lowerChild = node->lowerChild;\n    int upperChild = node->upperChild;\n\n    BOOST_ASSERT_MSG(*numNodesToVisit != 0, \"forest.trees has an inconsistent tree structure.\");\n\n    *numNodesToVisit -= 1;\n\n    if (lowerChild >= 0) {\n        VlKDTreeNode* child = tree->nodes + lowerChild;\n        child->parent = nodeIndex;\n        restore_parent_recursively(tree, lowerChild, numNodesToVisit);\n    }\n\n    if (upperChild >= 0) {\n    VlKDTreeNode* child = tree->nodes + upperChild;\n        child->parent = nodeIndex;\n        restore_parent_recursively (tree, upperChild, numNodesToVisit);\n    }\n}\n\nnamespace boost { namespace serialization {\n\n\/\/\/ @brief Boost serialization for @a VlKDForest\ntemplate <typename OutputArchive>\nvoid\nsave(OutputArchive& ar, const VlKDForest& f, const unsigned int version) {\n    ar & f.distance;\n    ar & f.thresholdingMethod;\n    ar & f.dimension;\n    ar & f.numData;\n    ar & f.dataType;\n    ar & f.numTrees;\n\n    for (vl_uindex ti = 0; ti < f.numTrees; ++ti) {\n        const VlKDTree* tree = f.trees[ti];\n\n        ar & tree->numUsedNodes;\n        for (vl_uindex ni = 0; ni < tree->numUsedNodes; ++ni) {\n            const VlKDTreeNode* node = tree->nodes + ni;\n            ar & node->lowerChild;\n            ar & node->upperChild;\n            ar & node->splitDimension;\n            ar & node->splitThreshold;\n            ar & node->lowerBound;\n            ar & node->upperBound;\n        }\n\n        for (vl_uindex di = 0; di < f.numData; ++di) {\n            ar & tree->dataIndex[di].index;\n        }\n        ar & tree->depth;\n    }\n}\n\n\/\/\/ @brief Boost deserialization for @a VlKDForest\ntemplate <typename InputArchive>\nvoid\nload(InputArchive& ar, VlKDForest& forest, const unsigned int version) {\n    VlVectorComparisonType distance;\n    ar & distance;\n    BOOST_ASSERT_MSG(distance == VlDistanceL2\n                     or distance == VlDistanceL1,\n                     \"forest.distance is neither L2 nor L1\");\n\n    VlKDTreeThresholdingMethod thresholdingMethod;\n    ar & thresholdingMethod;\n    BOOST_ASSERT_MSG(thresholdingMethod == VL_KDTREE_MEDIAN\n                     or thresholdingMethod == VL_KDTREE_MEAN,\n                     \"forest.thresholdMethod is neither MEAN nor MEDIAN\");\n\n    vl_size dimension;\n    ar & dimension;\n    BOOST_ASSERT_MSG(dimension > 0,\n                     \"forest.dimension is not positive\");\n\n    vl_size numData;\n    ar & numData;\n    BOOST_ASSERT_MSG(numData > 0,\n                     \"forest.numData is not positive\");\n\n    vl_type dataType;\n    ar & dataType;\n    BOOST_ASSERT_MSG(dataType == VL_TYPE_FLOAT or dataType == VL_TYPE_DOUBLE,\n                     \"forest.dataType is neither FLOAT nor DOUBLE\");\n\n    vl_size numTrees;\n    ar & numTrees;\n    BOOST_ASSERT_MSG(numTrees >= 1, \"forest.numTrees is not greater than or equal to 1\");\n\n    VlKDForest* f = vl_kdforest_new(dataType, dimension, numTrees, distance);\n    f->numData = numData;\n    f->trees = (VlKDTree**) vl_malloc(sizeof(VlKDTree*) * numTrees);\n\n    vl_size maxNumNodes = 0;\n\n    for (vl_uindex ti = 0; ti < numTrees; ++ti) {\n        VlKDTree* tree = (VlKDTree*) vl_malloc(sizeof(VlKDTree));\n\n        vl_size numUsedNodes;\n        ar & numUsedNodes;\n\n        maxNumNodes += numUsedNodes;\n\n        tree->numAllocatedNodes = numUsedNodes;\n        tree->numUsedNodes = numUsedNodes;\n\n        tree->nodes = (VlKDTreeNode*) vl_malloc(sizeof(VlKDTreeNode) * numUsedNodes);\n        tree->dataIndex = (VlKDTreeDataIndexEntry*) vl_malloc(sizeof(VlKDTreeDataIndexEntry) * numData);\n\n        for (vl_uindex ni = 0; ni < numUsedNodes; ++ni) {\n            VlKDTreeNode* node = tree->nodes + ni;\n            ar & node->lowerChild;\n            ar & node->upperChild;\n            ar & node->splitDimension;\n            ar & node->splitThreshold;\n            ar & node->lowerBound;\n            ar & node->upperBound;\n        }\n\n        for (vl_uindex di = 0; di < numData; ++di) {\n            ar & tree->dataIndex[di].index;\n        }\n        ar & tree->depth;\n\n        int numNodesToVisit = tree->numUsedNodes;\n        restore_parent_recursively(tree, 0, &numNodesToVisit);\n\n        f->trees[ti] = tree;\n    }\n\n    f->maxNumNodes = maxNumNodes;\n    f->data = NULL;\n\n    forest = *f;\n}\n\n}} \/* namespace boost::serialization *\/\n\n#endif \/* VIS_DETAIL_SERIALIZATION_KDTREE_HPP *\/\n\n<commit_msg>FIXME inline function<commit_after>\/**\n * @file utils\/serialization_kdtree.hpp\n * @brief VLFeat KD-tree serialization\n * @author Paolo D'Apice\n * @author Adrea Vedaldi\n *\/\n\n#ifndef VIS_DETAIL_SERIALIZATION_KDTREE_HPP\n#define VIS_DETAIL_SERIALIZATION_KDTREE_HPP\n\n#include <boost\/assert.hpp>\n#include <boost\/serialization\/split_free.hpp>\nextern \"C\" {\n#include <vl\/kdtree.h>\n}\n\nBOOST_SERIALIZATION_SPLIT_FREE(VlKDForest)\n\n\/\/\/ Taken from VLFeat's toolbox\/misc\/kdtree.h\ninline void\nrestore_parent_recursively(VlKDTree* tree, int nodeIndex, int* numNodesToVisit) {\n    VlKDTreeNode* node = tree->nodes + nodeIndex;\n    int lowerChild = node->lowerChild;\n    int upperChild = node->upperChild;\n\n    BOOST_ASSERT_MSG(*numNodesToVisit != 0, \"forest.trees has an inconsistent tree structure.\");\n\n    *numNodesToVisit -= 1;\n\n    if (lowerChild >= 0) {\n        VlKDTreeNode* child = tree->nodes + lowerChild;\n        child->parent = nodeIndex;\n        restore_parent_recursively(tree, lowerChild, numNodesToVisit);\n    }\n\n    if (upperChild >= 0) {\n    VlKDTreeNode* child = tree->nodes + upperChild;\n        child->parent = nodeIndex;\n        restore_parent_recursively (tree, upperChild, numNodesToVisit);\n    }\n}\n\nnamespace boost { namespace serialization {\n\n\/\/\/ @brief Boost serialization for @a VlKDForest\ntemplate <typename OutputArchive>\nvoid\nsave(OutputArchive& ar, const VlKDForest& f, const unsigned int version) {\n    ar & f.distance;\n    ar & f.thresholdingMethod;\n    ar & f.dimension;\n    ar & f.numData;\n    ar & f.dataType;\n    ar & f.numTrees;\n\n    for (vl_uindex ti = 0; ti < f.numTrees; ++ti) {\n        const VlKDTree* tree = f.trees[ti];\n\n        ar & tree->numUsedNodes;\n        for (vl_uindex ni = 0; ni < tree->numUsedNodes; ++ni) {\n            const VlKDTreeNode* node = tree->nodes + ni;\n            ar & node->lowerChild;\n            ar & node->upperChild;\n            ar & node->splitDimension;\n            ar & node->splitThreshold;\n            ar & node->lowerBound;\n            ar & node->upperBound;\n        }\n\n        for (vl_uindex di = 0; di < f.numData; ++di) {\n            ar & tree->dataIndex[di].index;\n        }\n        ar & tree->depth;\n    }\n}\n\n\/\/\/ @brief Boost deserialization for @a VlKDForest\ntemplate <typename InputArchive>\nvoid\nload(InputArchive& ar, VlKDForest& forest, const unsigned int version) {\n    VlVectorComparisonType distance;\n    ar & distance;\n    BOOST_ASSERT_MSG(distance == VlDistanceL2\n                     or distance == VlDistanceL1,\n                     \"forest.distance is neither L2 nor L1\");\n\n    VlKDTreeThresholdingMethod thresholdingMethod;\n    ar & thresholdingMethod;\n    BOOST_ASSERT_MSG(thresholdingMethod == VL_KDTREE_MEDIAN\n                     or thresholdingMethod == VL_KDTREE_MEAN,\n                     \"forest.thresholdMethod is neither MEAN nor MEDIAN\");\n\n    vl_size dimension;\n    ar & dimension;\n    BOOST_ASSERT_MSG(dimension > 0,\n                     \"forest.dimension is not positive\");\n\n    vl_size numData;\n    ar & numData;\n    BOOST_ASSERT_MSG(numData > 0,\n                     \"forest.numData is not positive\");\n\n    vl_type dataType;\n    ar & dataType;\n    BOOST_ASSERT_MSG(dataType == VL_TYPE_FLOAT or dataType == VL_TYPE_DOUBLE,\n                     \"forest.dataType is neither FLOAT nor DOUBLE\");\n\n    vl_size numTrees;\n    ar & numTrees;\n    BOOST_ASSERT_MSG(numTrees >= 1, \"forest.numTrees is not greater than or equal to 1\");\n\n    VlKDForest* f = vl_kdforest_new(dataType, dimension, numTrees, distance);\n    f->numData = numData;\n    f->trees = (VlKDTree**) vl_malloc(sizeof(VlKDTree*) * numTrees);\n\n    vl_size maxNumNodes = 0;\n\n    for (vl_uindex ti = 0; ti < numTrees; ++ti) {\n        VlKDTree* tree = (VlKDTree*) vl_malloc(sizeof(VlKDTree));\n\n        vl_size numUsedNodes;\n        ar & numUsedNodes;\n\n        maxNumNodes += numUsedNodes;\n\n        tree->numAllocatedNodes = numUsedNodes;\n        tree->numUsedNodes = numUsedNodes;\n\n        tree->nodes = (VlKDTreeNode*) vl_malloc(sizeof(VlKDTreeNode) * numUsedNodes);\n        tree->dataIndex = (VlKDTreeDataIndexEntry*) vl_malloc(sizeof(VlKDTreeDataIndexEntry) * numData);\n\n        for (vl_uindex ni = 0; ni < numUsedNodes; ++ni) {\n            VlKDTreeNode* node = tree->nodes + ni;\n            ar & node->lowerChild;\n            ar & node->upperChild;\n            ar & node->splitDimension;\n            ar & node->splitThreshold;\n            ar & node->lowerBound;\n            ar & node->upperBound;\n        }\n\n        for (vl_uindex di = 0; di < numData; ++di) {\n            ar & tree->dataIndex[di].index;\n        }\n        ar & tree->depth;\n\n        int numNodesToVisit = tree->numUsedNodes;\n        restore_parent_recursively(tree, 0, &numNodesToVisit);\n\n        f->trees[ti] = tree;\n    }\n\n    f->maxNumNodes = maxNumNodes;\n    f->data = NULL;\n\n    forest = *f;\n}\n\n}} \/* namespace boost::serialization *\/\n\n#endif \/* VIS_DETAIL_SERIALIZATION_KDTREE_HPP *\/\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: SlideSorterModel.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: rt $ $Date: 2004-07-13 14:24: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 \"model\/SlideSorterModel.hxx\"\n\n#include \"model\/SlsPageDescriptor.hxx\"\n#include \"model\/SlsPageEnumeration.hxx\"\n#include \"controller\/SlsPageObjectFactory.hxx\"\n\n#ifndef _DRAWDOC_HXX\n#include \"drawdoc.hxx\"\n#endif\n#ifndef _SDPAGE_HXX\n#include \"sdpage.hxx\"\n#endif\n\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\n\n#ifdef DEBUG\n#define DUMP_MODEL ::DumpSlideSorterModel(*this)\nnamespace {\nusing namespace ::sd::slidesorter::model;\nvoid DumpSlideSorterModel (const SlideSorterModel& rModel)\n{\n    OSL_TRACE (\"SlideSorterModel has %d pages\", rModel.GetPageCount());\n    if (rModel.GetEditMode() == EM_PAGE)\n        OSL_TRACE (\"edit mode is EM_PAGE\");\n    else if (rModel.GetEditMode() == EM_MASTERPAGE)\n        OSL_TRACE (\"    edit mode is EM_MASTERPAGE\");\n    else\n        OSL_TRACE (\"    edit mode is unknown\");\n    for (int i=0; i<rModel.GetPageCount(); i++)\n    {\n        PageDescriptor* pDescriptor = rModel.GetRawPageDescriptor(i);\n        OSL_TRACE (\"    page %d points to %x\", i, pDescriptor);\n        if (pDescriptor != NULL)\n            OSL_TRACE (\"        focused %d, selected %d, visible %d\",\n                pDescriptor->IsFocused()?1:0,\n                pDescriptor->IsSelected()?1:0,\n                pDescriptor->IsVisible()?1:0);\n    }\n}\n}\n#else\n#define DUMP_MODEL\n#endif\n#undef DUMP_MODEL\n#define DUMP_MODEL\n\nnamespace sd { namespace slidesorter { namespace model {\n\nSlideSorterModel::SlideSorterModel (\n    SdDrawDocument& rDocument,\n    PageKind ePageKind,\n    EditMode eEditMode)\n    : mrDocument (rDocument),\n      mePageKind (ePageKind),\n      meEditMode (eEditMode),\n      maPageDescriptors(0),\n      mpPageObjectFactory(NULL)\n{\n    AdaptSize ();\n    DUMP_MODEL;\n}\n\n\n\n\nSlideSorterModel::~SlideSorterModel (void)\n{\n    ClearDescriptorList ();\n}\n\n\n\n\nSdDrawDocument* SlideSorterModel::GetDocument (void)\n{\n    return &mrDocument;\n}\n\n\n\n\nbool SlideSorterModel::SetEditMode (EditMode eEditMode)\n{\n    bool bEditModeChanged = false;\n    if (meEditMode!=eEditMode)\n    {\n        meEditMode = eEditMode;\n        ClearDescriptorList();\n        AdaptSize();\n        bEditModeChanged = true;\n    }\n    DUMP_MODEL;\n    return bEditModeChanged;\n}\n\n\n\n\nEditMode SlideSorterModel::GetEditMode (void) const\n{\n    return meEditMode;\n}\n\n\n\n\nPageKind SlideSorterModel::GetPageType (void) const\n{\n    return mePageKind;\n}\n\n\n\n\nint SlideSorterModel::GetPageCount (void) const\n{\n    return maPageDescriptors.size();\n}\n\n\n\n\nPageDescriptor* SlideSorterModel::GetPageDescriptor (int nPageIndex) const\n{\n    ::osl::MutexGuard aGuard (maMutex);\n\n    PageDescriptor* pDescriptor = NULL;\n    if (nPageIndex>=0 && nPageIndex<GetPageCount())\n    {\n        pDescriptor = maPageDescriptors[nPageIndex];\n        if (pDescriptor == NULL)\n        {\n            SdPage* pPage;\n            if (meEditMode == EM_PAGE)\n                pPage = mrDocument.GetSdPage (nPageIndex, mePageKind);\n            else\n                pPage = mrDocument.GetMasterSdPage (nPageIndex, mePageKind);\n            pDescriptor = new PageDescriptor (\n                *pPage,\n                GetPageObjectFactory());\n            maPageDescriptors[nPageIndex] = pDescriptor;\n        }\n    }\n    return pDescriptor;\n}\n\n\n\n\nPageDescriptor* SlideSorterModel::GetRawPageDescriptor (int nPageIndex) const\n{\n    ::osl::MutexGuard aGuard (maMutex);\n\n    PageDescriptor* pDescriptor = NULL;\n    if (nPageIndex>=0 && nPageIndex<GetPageCount())\n        pDescriptor = maPageDescriptors[nPageIndex];\n    return pDescriptor;\n}\n\n\n\n\nPageDescriptor* SlideSorterModel::FindPageDescriptor (\n        const Reference<drawing::XDrawPage>& rxPage) const\n{\n    ::osl::MutexGuard aGuard (maMutex);\n\n    PageDescriptor* pDescriptor = NULL;\n    for (int i=0; i<GetPageCount(); i++)\n    {\n        pDescriptor = GetPageDescriptor(i);\n        if (pDescriptor != NULL)\n        {\n            Reference<drawing::XDrawPage> xPage (\n                pDescriptor->GetPage()->getUnoPage(), UNO_QUERY);\n            if (xPage == rxPage)\n                break;\n        }\n    }\n    return pDescriptor;\n}\n\n\n\n\nSlideSorterModel::Enumeration\n    SlideSorterModel::GetAllPagesEnumeration (void) const\n{\n    return PageEnumeration::Create(*this, PageEnumeration::PET_ALL);\n}\n\n\n\n\nSlideSorterModel::Enumeration\n    SlideSorterModel::GetSelectedPagesEnumeration (void) const\n{\n    return PageEnumeration::Create(*this, PageEnumeration::PET_SELECTED);\n}\n\n\n\n\nSlideSorterModel::Enumeration\n    SlideSorterModel::GetVisiblePagesEnumeration (void) const\n{\n    return PageEnumeration::Create(*this, PageEnumeration::PET_VISIBLE);\n}\n\n\n\n\n\/** For now this method uses a trivial algorithm: throw away all descriptors\n    and create them anew (on demand).\n*\/\nvoid SlideSorterModel::Resync (void)\n{\n    ::osl::MutexGuard aGuard (maMutex);\n    OSL_TRACE(\"Resync in\");\n    DUMP_MODEL;\n    ClearDescriptorList ();\n    AdaptSize();\n    DUMP_MODEL;\n    OSL_TRACE(\"Resync out\");\n}\n\n\n\n\nvoid SlideSorterModel::AdaptSize ()\n{\n    ::osl::MutexGuard aGuard (maMutex);\n\n    if (meEditMode == EM_PAGE)\n        maPageDescriptors.resize (\n            mrDocument.GetSdPageCount(mePageKind),\n            NULL);\n    else\n        maPageDescriptors.resize (\n            mrDocument.GetMasterSdPageCount(mePageKind),\n            NULL);\n}\n\n\n\nvoid SlideSorterModel::ClearDescriptorList (void)\n{\n    ::osl::MutexGuard aGuard (maMutex);\n\n    \/\/ Clear the cache of page descriptors.\n    DescriptorContainer::iterator I;\n    for (I=maPageDescriptors.begin(); I!=maPageDescriptors.end(); I++)\n    {\n        if (*I != NULL)\n        {\n            delete *I;\n            *I = NULL;\n        }\n    }\n}\n\n\n\n\nvoid SlideSorterModel::SynchronizeDocumentSelection (void)\n{\n    ::osl::MutexGuard aGuard (maMutex);\n\n    Enumeration aAllPages (GetAllPagesEnumeration());\n    while (aAllPages.HasMoreElements())\n    {\n        PageDescriptor& rDescriptor (aAllPages.GetNextElement());\n        rDescriptor.GetPage()->SetSelected (rDescriptor.IsSelected());\n    }\n}\n\n\n\n\nvoid SlideSorterModel::SynchronizeModelSelection (void)\n{\n    ::osl::MutexGuard aGuard (maMutex);\n\n    Enumeration aAllPages (GetAllPagesEnumeration());\n    while (aAllPages.HasMoreElements())\n    {\n        PageDescriptor& rDescriptor (aAllPages.GetNextElement());\n        if (rDescriptor.GetPage()->IsSelected())\n            rDescriptor.Select ();\n        else\n            rDescriptor.Deselect ();\n    }\n}\n\n\n\n\nvoid SlideSorterModel::SetPageObjectFactory(\n    ::std::auto_ptr<controller::PageObjectFactory> pPageObjectFactory)\n{\n    ::osl::MutexGuard aGuard (maMutex);\n\n    mpPageObjectFactory = pPageObjectFactory;\n    \/\/ When a NULL pointer was given then create a default factory.\n    const controller::PageObjectFactory& rFactory (GetPageObjectFactory());\n    Enumeration aAllPages (GetAllPagesEnumeration());\n    while (aAllPages.HasMoreElements())\n    {\n        PageDescriptor& rDescriptor (aAllPages.GetNextElement());\n        rDescriptor.SetPageObjectFactory(rFactory);\n    }\n}\n\n\n\n\nconst controller::PageObjectFactory&\n    SlideSorterModel::GetPageObjectFactory (void) const\n{\n    ::osl::MutexGuard aGuard (maMutex);\n\n    if (mpPageObjectFactory.get() == NULL)\n    {\n        \/\/ We have to creat a new factory.  The pointer is mutable so we are\n        \/\/ alowed to do so.  Note that we pass NULL as pointer to the\n        \/\/ preview cache because we, as a model, have no access to the\n        \/\/ cache.  This makes this object clearly a fallback when the\n        \/\/ controller does not provide a factory where the cache is properly\n        \/\/ set.\n        mpPageObjectFactory = ::std::auto_ptr<controller::PageObjectFactory> (\n            new controller::PageObjectFactory(NULL));\n    }\n    return *mpPageObjectFactory.get();\n}\n\n\n\n\n::osl::Mutex& SlideSorterModel::GetMutex (void)\n{\n    return maMutex;\n}\n\n} } } \/\/ end of namespace ::sd::slidesorter::model\n<commit_msg>INTEGRATION: CWS ooo19126 (1.2.428); FILE MERGED 2005\/09\/05 13:24:35 rt 1.2.428.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: SlideSorterModel.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 06:23: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 \"model\/SlideSorterModel.hxx\"\n\n#include \"model\/SlsPageDescriptor.hxx\"\n#include \"model\/SlsPageEnumeration.hxx\"\n#include \"controller\/SlsPageObjectFactory.hxx\"\n\n#ifndef _DRAWDOC_HXX\n#include \"drawdoc.hxx\"\n#endif\n#ifndef _SDPAGE_HXX\n#include \"sdpage.hxx\"\n#endif\n\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\n\n#ifdef DEBUG\n#define DUMP_MODEL ::DumpSlideSorterModel(*this)\nnamespace {\nusing namespace ::sd::slidesorter::model;\nvoid DumpSlideSorterModel (const SlideSorterModel& rModel)\n{\n    OSL_TRACE (\"SlideSorterModel has %d pages\", rModel.GetPageCount());\n    if (rModel.GetEditMode() == EM_PAGE)\n        OSL_TRACE (\"edit mode is EM_PAGE\");\n    else if (rModel.GetEditMode() == EM_MASTERPAGE)\n        OSL_TRACE (\"    edit mode is EM_MASTERPAGE\");\n    else\n        OSL_TRACE (\"    edit mode is unknown\");\n    for (int i=0; i<rModel.GetPageCount(); i++)\n    {\n        PageDescriptor* pDescriptor = rModel.GetRawPageDescriptor(i);\n        OSL_TRACE (\"    page %d points to %x\", i, pDescriptor);\n        if (pDescriptor != NULL)\n            OSL_TRACE (\"        focused %d, selected %d, visible %d\",\n                pDescriptor->IsFocused()?1:0,\n                pDescriptor->IsSelected()?1:0,\n                pDescriptor->IsVisible()?1:0);\n    }\n}\n}\n#else\n#define DUMP_MODEL\n#endif\n#undef DUMP_MODEL\n#define DUMP_MODEL\n\nnamespace sd { namespace slidesorter { namespace model {\n\nSlideSorterModel::SlideSorterModel (\n    SdDrawDocument& rDocument,\n    PageKind ePageKind,\n    EditMode eEditMode)\n    : mrDocument (rDocument),\n      mePageKind (ePageKind),\n      meEditMode (eEditMode),\n      maPageDescriptors(0),\n      mpPageObjectFactory(NULL)\n{\n    AdaptSize ();\n    DUMP_MODEL;\n}\n\n\n\n\nSlideSorterModel::~SlideSorterModel (void)\n{\n    ClearDescriptorList ();\n}\n\n\n\n\nSdDrawDocument* SlideSorterModel::GetDocument (void)\n{\n    return &mrDocument;\n}\n\n\n\n\nbool SlideSorterModel::SetEditMode (EditMode eEditMode)\n{\n    bool bEditModeChanged = false;\n    if (meEditMode!=eEditMode)\n    {\n        meEditMode = eEditMode;\n        ClearDescriptorList();\n        AdaptSize();\n        bEditModeChanged = true;\n    }\n    DUMP_MODEL;\n    return bEditModeChanged;\n}\n\n\n\n\nEditMode SlideSorterModel::GetEditMode (void) const\n{\n    return meEditMode;\n}\n\n\n\n\nPageKind SlideSorterModel::GetPageType (void) const\n{\n    return mePageKind;\n}\n\n\n\n\nint SlideSorterModel::GetPageCount (void) const\n{\n    return maPageDescriptors.size();\n}\n\n\n\n\nPageDescriptor* SlideSorterModel::GetPageDescriptor (int nPageIndex) const\n{\n    ::osl::MutexGuard aGuard (maMutex);\n\n    PageDescriptor* pDescriptor = NULL;\n    if (nPageIndex>=0 && nPageIndex<GetPageCount())\n    {\n        pDescriptor = maPageDescriptors[nPageIndex];\n        if (pDescriptor == NULL)\n        {\n            SdPage* pPage;\n            if (meEditMode == EM_PAGE)\n                pPage = mrDocument.GetSdPage (nPageIndex, mePageKind);\n            else\n                pPage = mrDocument.GetMasterSdPage (nPageIndex, mePageKind);\n            pDescriptor = new PageDescriptor (\n                *pPage,\n                GetPageObjectFactory());\n            maPageDescriptors[nPageIndex] = pDescriptor;\n        }\n    }\n    return pDescriptor;\n}\n\n\n\n\nPageDescriptor* SlideSorterModel::GetRawPageDescriptor (int nPageIndex) const\n{\n    ::osl::MutexGuard aGuard (maMutex);\n\n    PageDescriptor* pDescriptor = NULL;\n    if (nPageIndex>=0 && nPageIndex<GetPageCount())\n        pDescriptor = maPageDescriptors[nPageIndex];\n    return pDescriptor;\n}\n\n\n\n\nPageDescriptor* SlideSorterModel::FindPageDescriptor (\n        const Reference<drawing::XDrawPage>& rxPage) const\n{\n    ::osl::MutexGuard aGuard (maMutex);\n\n    PageDescriptor* pDescriptor = NULL;\n    for (int i=0; i<GetPageCount(); i++)\n    {\n        pDescriptor = GetPageDescriptor(i);\n        if (pDescriptor != NULL)\n        {\n            Reference<drawing::XDrawPage> xPage (\n                pDescriptor->GetPage()->getUnoPage(), UNO_QUERY);\n            if (xPage == rxPage)\n                break;\n        }\n    }\n    return pDescriptor;\n}\n\n\n\n\nSlideSorterModel::Enumeration\n    SlideSorterModel::GetAllPagesEnumeration (void) const\n{\n    return PageEnumeration::Create(*this, PageEnumeration::PET_ALL);\n}\n\n\n\n\nSlideSorterModel::Enumeration\n    SlideSorterModel::GetSelectedPagesEnumeration (void) const\n{\n    return PageEnumeration::Create(*this, PageEnumeration::PET_SELECTED);\n}\n\n\n\n\nSlideSorterModel::Enumeration\n    SlideSorterModel::GetVisiblePagesEnumeration (void) const\n{\n    return PageEnumeration::Create(*this, PageEnumeration::PET_VISIBLE);\n}\n\n\n\n\n\/** For now this method uses a trivial algorithm: throw away all descriptors\n    and create them anew (on demand).\n*\/\nvoid SlideSorterModel::Resync (void)\n{\n    ::osl::MutexGuard aGuard (maMutex);\n    OSL_TRACE(\"Resync in\");\n    DUMP_MODEL;\n    ClearDescriptorList ();\n    AdaptSize();\n    DUMP_MODEL;\n    OSL_TRACE(\"Resync out\");\n}\n\n\n\n\nvoid SlideSorterModel::AdaptSize ()\n{\n    ::osl::MutexGuard aGuard (maMutex);\n\n    if (meEditMode == EM_PAGE)\n        maPageDescriptors.resize (\n            mrDocument.GetSdPageCount(mePageKind),\n            NULL);\n    else\n        maPageDescriptors.resize (\n            mrDocument.GetMasterSdPageCount(mePageKind),\n            NULL);\n}\n\n\n\nvoid SlideSorterModel::ClearDescriptorList (void)\n{\n    ::osl::MutexGuard aGuard (maMutex);\n\n    \/\/ Clear the cache of page descriptors.\n    DescriptorContainer::iterator I;\n    for (I=maPageDescriptors.begin(); I!=maPageDescriptors.end(); I++)\n    {\n        if (*I != NULL)\n        {\n            delete *I;\n            *I = NULL;\n        }\n    }\n}\n\n\n\n\nvoid SlideSorterModel::SynchronizeDocumentSelection (void)\n{\n    ::osl::MutexGuard aGuard (maMutex);\n\n    Enumeration aAllPages (GetAllPagesEnumeration());\n    while (aAllPages.HasMoreElements())\n    {\n        PageDescriptor& rDescriptor (aAllPages.GetNextElement());\n        rDescriptor.GetPage()->SetSelected (rDescriptor.IsSelected());\n    }\n}\n\n\n\n\nvoid SlideSorterModel::SynchronizeModelSelection (void)\n{\n    ::osl::MutexGuard aGuard (maMutex);\n\n    Enumeration aAllPages (GetAllPagesEnumeration());\n    while (aAllPages.HasMoreElements())\n    {\n        PageDescriptor& rDescriptor (aAllPages.GetNextElement());\n        if (rDescriptor.GetPage()->IsSelected())\n            rDescriptor.Select ();\n        else\n            rDescriptor.Deselect ();\n    }\n}\n\n\n\n\nvoid SlideSorterModel::SetPageObjectFactory(\n    ::std::auto_ptr<controller::PageObjectFactory> pPageObjectFactory)\n{\n    ::osl::MutexGuard aGuard (maMutex);\n\n    mpPageObjectFactory = pPageObjectFactory;\n    \/\/ When a NULL pointer was given then create a default factory.\n    const controller::PageObjectFactory& rFactory (GetPageObjectFactory());\n    Enumeration aAllPages (GetAllPagesEnumeration());\n    while (aAllPages.HasMoreElements())\n    {\n        PageDescriptor& rDescriptor (aAllPages.GetNextElement());\n        rDescriptor.SetPageObjectFactory(rFactory);\n    }\n}\n\n\n\n\nconst controller::PageObjectFactory&\n    SlideSorterModel::GetPageObjectFactory (void) const\n{\n    ::osl::MutexGuard aGuard (maMutex);\n\n    if (mpPageObjectFactory.get() == NULL)\n    {\n        \/\/ We have to creat a new factory.  The pointer is mutable so we are\n        \/\/ alowed to do so.  Note that we pass NULL as pointer to the\n        \/\/ preview cache because we, as a model, have no access to the\n        \/\/ cache.  This makes this object clearly a fallback when the\n        \/\/ controller does not provide a factory where the cache is properly\n        \/\/ set.\n        mpPageObjectFactory = ::std::auto_ptr<controller::PageObjectFactory> (\n            new controller::PageObjectFactory(NULL));\n    }\n    return *mpPageObjectFactory.get();\n}\n\n\n\n\n::osl::Mutex& SlideSorterModel::GetMutex (void)\n{\n    return maMutex;\n}\n\n} } } \/\/ end of namespace ::sd::slidesorter::model\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <iomanip>\n#include <cstdint>\n#include <bitset>\n#include <limits>\n#include <vector>\n#include <utility>\n#include <algorithm>\n\ntemplate<typename T, T A, T n, T k>\nint print_matrix() {\n\tconstexpr const T d_max = static_cast<T>((1ull << k) - 1ull);\n\tfor (T d = 0; d <= d_max; ++d) {\n\t\tstd::cout << d << '\\t';\n\t}\n\tstd::cout << '\\n';\n\tfor (T d = 0; d <= d_max; ++d) {\n\t\tstd::cout << (d * A) << '\\t';\n\t}\n\tstd::cout << '\\n';\n\tfor (T d = 0; d <= d_max; ++d) {\n\t\tstd::bitset<n> b(d * A);\n\t\tstd::cout << b << '\\t';\n\t}\n\tstd::cout << std::endl;\n\n\tstd::cout << \"---\";\n\tfor (T d = 0; d <= d_max; ++d) {\n\t\tstd::cout << '\\t' << (d * A);\n\t}\n\tstd::cout << '\\n';\n\tT dHmin = std::numeric_limits<T>::max();\n\tstd::vector<std::pair<T, T>> pairs;\n\tuint16_t histogram[n + 1]{};\n\tfor (T d1 = 0; d1 <= d_max; ++d1) {\n\t\tstd::cout << (d1 * A);\n\t\tfor (T d2 = 0; d2 <= d_max; ++d2) {\n\t\t\tconst T dH = __builtin_popcountll((d1 * A) ^ (d2 * A));\n\t\t\thistogram[dH]++;\n\t\t\tif (dH > 0) {\n\t\t\t\tif (dH < dHmin) {\n\t\t\t\t\tpairs.clear();\n\t\t\t\t\tdHmin = dH;\n\t\t\t\t}\n\t\t\t\tif (dH == dHmin) {\n\t\t\t\t\tauto iter = std::find(pairs.begin(), pairs.end(), std::make_pair<T, T>(d2*A, d1*A));\n\t\t\t\t\tif (iter == pairs.end()) {\n\t\t\t\t\t\tpairs.emplace_back(std::make_pair<T, T>(d1*A, d2*A));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tstd::cout << '\\t' << dH;\n\t\t}\n\t\tstd::cout << '\\n';\n\t}\n\tstd::cout << \"dHmin = \" << dHmin << '\\n';\n\tstd::cout << \"limiting pairs are: (\" << pairs.size() << ')';\n\tstd::for_each(pairs.begin(), pairs.end(), [] (auto x) {std::cout << \" [\" << x.first << \", \" << x.second << ']';});\n\tstd::cout << \"\\nhistogram:\\n\";\n\tT total = 0;\n\tfor (int i = 0; i <= n; ++i) {\n\t\tstd::cout << std::setw(3) << i << \": \" << histogram[i] << '\\n';\n\t\ttotal += histogram[i];\n\t}\n\tstd::cout << \"total edges: \" << total << std::endl;\n}\n\nint main() {\n\t\/\/ concrete example with A=19, |A|=5, |D|=k=5, |C|=10\n\tprint_matrix<uint16_t, 19, 10, 5>();\n\tstd::cout << \"\\n\\n\";\n\t\/\/ concrete example with A=53, |A|=6, |D|=k=5, |C|=10\n\tprint_matrix<uint16_t, 53, 11, 5>();\n}\n\n<commit_msg>Make the tool more flexible. Allow to pass parameters through cmd args. Attention: no real parameter checking done, yet!<commit_after>#include <iostream>\n#include <iomanip>\n#include <cstdint>\n#include <bitset>\n#include <limits>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <sstream>\n\n#define THROW_ERROR(MESSAGE, LINE) {                                                \\\n    std::string filename(__FILE__);                                                 \\\n    auto filesub = filename.substr(filename.rfind('\/') + 1);                        \\\n    std::stringstream ss;                                                           \\\n    ss << \"[ERROR @ \" << filesub << ':' << LINE << \"] \" << MESSAGE << std::endl;    \\\n    throw std::runtime_error(ss.str());                                             \\\n}\n\ntemplate<typename T>\nvoid print_matrix_static(\n        T A,\n        T n,\n        T k);\n\ntypedef size_t bitwidth_t;\n\nvoid print_matrix_dynamic(\n        bitwidth_t dataWidth,\n        size_t A,\n        size_t n,\n        size_t k);\n\nint main(\n        int argc,\n        char** argv) {\n    if (argc == 1) {\n        \/\/ concrete example with A=19, |A|=5, |D|=k=5, |C|=10\n        print_matrix_static<uint16_t>(19, 10, 5);\n        std::cout << \"\\n\\n\";\n        \/\/ concrete example with A=53, |A|=6, |D|=k=5, |C|=10\n        print_matrix_static<uint16_t>(53, 11, 5);\n    } else {\n        if (argc == 3) {\n            size_t T, A, n, k;\n            std::stringstream ss;\n            ss << argv[1] << ' ' << argv[2];\n            ss >> A >> k;\n            size_t bwA = (8 * sizeof(A) - __builtin_clzll(A));\n            n = bwA + k;\n            T = n <= 8 ? 8 : (n <= 16 ? 16 : (n <= 32 ? 32 : 64));\n            print_matrix_dynamic(T, A, n, k);\n        } else {\n            THROW_ERROR(\"Usage: [<A> <k>].\\n\\tA: the code parameter.\\n\\tk: raw data width in bits.\\n\\tImplicit (computed) parameters:\\n\\tn: total code width in bits = |A| + k.\", __LINE__)\n        }\n    }\n    return 0;\n}\n\nvoid print_codeword_binary(\n        size_t n,\n        size_t d,\n        size_t A) {\n    if (n <= 64) {\n        size_t cw = d * A;\n        for (size_t i = 0, mask = 1; i < n; ++i) {\n            std::cout << ((cw & mask) != 0);\n            mask <<= 1;\n        }\n        std::cout << '\\t';\n    } else {\n        THROW_ERROR(\"Unsupported data width \" << n, __LINE__)\n    }\n}\n\ntemplate<typename T>\nvoid print_matrix_static(\n        T A,\n        T n,\n        T k) {\n    std::cout << \"Settings: A=\" << A << \". n=\" << n << \". k=|A|=\" << k << std::endl;\n    const T d_max = static_cast<T>((1ull << k) - 1ull);\n    for (T d = 0; d <= d_max; ++d) {\n        std::cout << d << '\\t';\n    }\n    std::cout << '\\n';\n    for (T d = 0; d <= d_max; ++d) {\n        std::cout << (d * A) << '\\t';\n    }\n    std::cout << '\\n';\n    for (T d = 0; d <= d_max; ++d) {\n        print_codeword_binary(n, d, A);\n    }\n    std::cout << std::endl;\n\n    std::cout << \"---\";\n    for (T d = 0; d <= d_max; ++d) {\n        std::cout << '\\t' << (d * A);\n    }\n    std::cout << '\\n';\n    T dHmin = std::numeric_limits<T>::max();\n    std::vector<std::pair<T, T>> pairs;\n    std::unique_ptr<uint16_t[]> histogram(new uint16_t[n + 1]);\n    \/\/ uint16_t histogram[n + 1] {};\n    for (T d1 = 0; d1 <= d_max; ++d1) {\n        std::cout << (d1 * A);\n        for (T d2 = 0; d2 <= d_max; ++d2) {\n            const T dH = __builtin_popcountll((d1 * A) ^ (d2 * A));\n            histogram[dH]++;\n            if (dH > 0) {\n                if (dH < dHmin) {\n                    pairs.clear();\n                    dHmin = dH;\n                }\n                if (dH == dHmin) {\n                    auto iter = std::find(pairs.begin(), pairs.end(), std::make_pair<T, T>(d2 * A, d1 * A));\n                    if (iter == pairs.end()) {\n                        pairs.emplace_back(std::make_pair<T, T>(d1 * A, d2 * A));\n                    }\n                }\n            }\n            std::cout << '\\t' << dH;\n        }\n        std::cout << '\\n';\n    }\n    std::cout << \"dHmin = \" << dHmin << '\\n';\n    std::cout << \"limiting pairs are: (\" << pairs.size() << ')';\n    std::for_each(pairs.begin(), pairs.end(), [] (auto x) {std::cout << \" [\" << x.first << \", \" << x.second << ']';});\n    std::cout << \"\\nhistogram:\\n\";\n    T total = 0;\n    for (size_t i = 0; i <= n; ++i) {\n        std::cout << std::setw(3) << i << \": \" << histogram[i] << '\\n';\n        total += histogram[i];\n    }\n    std::cout << \"total edges: \" << total << std::endl;\n}\n\nvoid print_matrix_dynamic(\n        bitwidth_t dataWidth,\n        size_t A,\n        size_t n,\n        size_t k) {\n\/\/    if (__builtin_popcountll(A) > dataWidth) {\n\/\/        THROW_ERROR(\"|A| should be < \" << dataWidth << \", but is \" << __builtin_popcountll(A), __LINE__)\n\/\/    } else if (n > dataWidth) {\n\/\/        THROW_ERROR(\"n should be < \" << dataWidth << \", but is \" << n, __LINE__)\n\/\/    } else if (k > dataWidth) {\n\/\/        THROW_ERROR(\"n should be < \" << dataWidth << \", but is \" << n, __LINE__)\n\/\/    } else if ((__builtin_popcountll(A) + k) > dataWidth) {\n\/\/        THROW_ERROR(\"(|A| + k) should be <= \" << dataWidth << \", but is \" << (__builtin_popcountll(A) + k), __LINE__)\n\/\/    }\n    if (dataWidth <= 16) {\n        print_matrix_static<uint16_t>(static_cast<uint16_t>(A), static_cast<uint16_t>(n), static_cast<uint16_t>(k));\n    } else if (dataWidth <= 32) {\n        print_matrix_static<uint32_t>(static_cast<uint32_t>(A), static_cast<uint32_t>(n), static_cast<uint32_t>(k));\n    } else if (dataWidth <= 64) {\n        print_matrix_static<uint64_t>(static_cast<uint64_t>(A), static_cast<uint64_t>(n), static_cast<uint64_t>(k));\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/=============================================================================================================\n\/**\n* @file     neuromag.cpp\n* @author   Christoph Dinh <chdinh@nmr.mgh.harvard.edu>;\n*           Matti Hamalainen <msh@nmr.mgh.harvard.edu>\n* @version  1.0\n* @date     July, 2012\n*\n* @section  LICENSE\n*\n* Copyright (C) 2012, 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 Neuromag Class.\n*\n*\/\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ INCLUDES\n\/\/=============================================================================================================\n\n#include \"neuromag.h\"\n#include \"dacqserver.h\"\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ FIFF INCLUDES\n\/\/=============================================================================================================\n\n#include \"..\/..\/..\/MNE\/fiff\/fiff.h\"\n#include \"..\/..\/..\/MNE\/fiff\/fiff_types.h\"\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ MNE INCLUDES\n\/\/=============================================================================================================\n\n#include \"..\/..\/..\/MNE\/mne\/mne.h\"\n#include \"..\/..\/..\/MNE\/mne\/mne_epoch_data_list.h\"\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ QT INCLUDES\n\/\/=============================================================================================================\n\n#include <QtCore\/QtPlugin>\n#include <QFile>\n#include <QDebug>\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ USED NAMESPACES\n\/\/=============================================================================================================\n\nusing namespace NeuromagPlugin;\nusing namespace FIFFLIB;\nusing namespace MNELIB;\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ DEFINE MEMBER METHODS\n\/\/=============================================================================================================\n\nNeuromag::Neuromag()\n: m_pDacqServer(new DacqServer(this))\n, m_pInfo(NULL)\n, m_bIsRunning(false)\n, m_iID(-1)\n{\n    this->setBufferSampleSize(100);\n    m_pRawMatrixBuffer = NULL;\n    this->init();\n\/\/    this->start();\n}\n\n\n\/\/*************************************************************************************************************\n\nNeuromag::~Neuromag()\n{\n    qDebug() << \"Destroy Neuromag::~Neuromag()\";\n\n    delete m_pDacqServer;\n\n    m_bIsRunning = false;\n    QThread::wait();\n}\n\n\n\/\/*************************************************************************************************************\n\nQByteArray Neuromag::availableCommands() const\n{\n    QByteArray t_blockCmdInfoList;\n\n    t_blockCmdInfoList.append(QString(\"\\t### %1 connector###\\r\\n\").arg(this->getName()));\n    t_blockCmdInfoList.append(\"\\tbufsize  [samples]\\tsets the buffer size of the FiffStreamClient\\r\\n\\t\\t\\t\\traw data buffers\\r\\n\");\n\n    return t_blockCmdInfoList;\n}\n\n\n\/\/*************************************************************************************************************\n\nConnectorID Neuromag::getConnectorID() const\n{\n    return _NEUROMAG;\n}\n\n\n\/\/*************************************************************************************************************\n\nconst char* Neuromag::getName() const\n{\n    return \"Neuromag Connector\";\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid Neuromag::init()\n{\n\n}\n\n\n\/\/*************************************************************************************************************\n\nbool Neuromag::parseCommand(QStringList& p_sListCommand, QByteArray& p_blockOutputInfo)\n{\n    bool success = false;\n\n\n    if(p_sListCommand[0].compare(\"bufsize\",Qt::CaseInsensitive) == 0)\n    {\n        \/\/\n        \/\/ bufsize\n        \/\/\n        if(p_sListCommand.size() > 1)\n        {\n            bool ok;\n            quint32 t_uiBuffSize = p_sListCommand[1].toInt(&ok);\n\n            if(ok && t_uiBuffSize > 0)\n            {\n                printf(\"bufsize %d\\n\", t_uiBuffSize);\n\n                requestSetBufferSize(t_uiBuffSize);\n\n                QString str = QString(\"\\tSet %1 buffer sample size to %2 samples\\r\\n\\n\").arg(getName()).arg(t_uiBuffSize);\n                p_blockOutputInfo.append(str);\n            }\n            else\n            {\n                p_blockOutputInfo.append(\"\\tBuffer size not set\\r\\n\\n\");\n            }\n        }\n        success = true;\n    }\n\n    return success;\n}\n\n\n\/\/*************************************************************************************************************\n\nbool Neuromag::start()\n{\n    this->init();\n\n    \/\/ Start thread\n    m_pDacqServer->start();\n\n    QThread::start();\n\n    return true;\n}\n\n\n\/\/*************************************************************************************************************\n\nbool Neuromag::stop()\n{\n    m_pDacqServer->m_bIsRunning = false;\n    m_pDacqServer->wait();\n\n    m_bIsRunning = false;\n    QThread::wait();\n\n    return true;\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid Neuromag::releaseMeasInfo()\n{\n    if(m_pInfo)\n        emit remitMeasInfo(m_iID, m_pInfo);\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid Neuromag::requestMeasInfo(qint32 ID)\n{\n    m_iID = ID;\n\n\n    if(m_pInfo)\n        releaseMeasInfo();\n    else\n    {\n        m_pDacqServer->m_bMeasInfoRequest = true;\n\n        \/\/This should never happen\n        if(m_pDacqServer->isRunning())\n        {\n            m_pDacqServer->m_bIsRunning = false;\n            m_pDacqServer->wait();\n            m_pDacqServer->start();\n        }\n        \/\/\n        else\n        {\n            m_pDacqServer->start();\n\/\/            m_pDacqServer->wait();\/\/ until header reading finished\n        }\n    }\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid Neuromag::requestMeas()\n{\n    m_pDacqServer->m_bMeasRequest = true;\n    this->start();\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid Neuromag::requestMeasStop()\n{\n    this->stop();\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid Neuromag::requestSetBufferSize(quint32 p_uiBuffSize)\n{\n    if(p_uiBuffSize > 0)\n    {\n        qDebug() << \"void Neuromag::setBufferSize: \" << p_uiBuffSize;\n\n        this->stop();\n\n        this->setBufferSampleSize(p_uiBuffSize);\n\n        this->start();\n    }\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid Neuromag::run()\n{\n    m_bIsRunning = true;\n\n    while(m_bIsRunning)\n    {\n        if(m_pRawMatrixBuffer)\n        {\n            \/\/ Pop available Buffers\n            MatrixXf tmp = m_pRawMatrixBuffer->pop();\n\n\/\/\/\/            printf(\"%d raw buffer (%d x %d) generated\\r\\n\", count, tmp.rows(), tmp.cols());\n\n            emit remitRawBuffer(tmp);\n        }\n    }\n}\n<commit_msg>debug<commit_after>\/\/=============================================================================================================\n\/**\n* @file     neuromag.cpp\n* @author   Christoph Dinh <chdinh@nmr.mgh.harvard.edu>;\n*           Matti Hamalainen <msh@nmr.mgh.harvard.edu>\n* @version  1.0\n* @date     July, 2012\n*\n* @section  LICENSE\n*\n* Copyright (C) 2012, 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 Neuromag Class.\n*\n*\/\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ INCLUDES\n\/\/=============================================================================================================\n\n#include \"neuromag.h\"\n#include \"dacqserver.h\"\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ FIFF INCLUDES\n\/\/=============================================================================================================\n\n#include \"..\/..\/..\/MNE\/fiff\/fiff.h\"\n#include \"..\/..\/..\/MNE\/fiff\/fiff_types.h\"\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ MNE INCLUDES\n\/\/=============================================================================================================\n\n#include \"..\/..\/..\/MNE\/mne\/mne.h\"\n#include \"..\/..\/..\/MNE\/mne\/mne_epoch_data_list.h\"\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ QT INCLUDES\n\/\/=============================================================================================================\n\n#include <QtCore\/QtPlugin>\n#include <QFile>\n#include <QDebug>\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ USED NAMESPACES\n\/\/=============================================================================================================\n\nusing namespace NeuromagPlugin;\nusing namespace FIFFLIB;\nusing namespace MNELIB;\n\n\n\/\/*************************************************************************************************************\n\/\/=============================================================================================================\n\/\/ DEFINE MEMBER METHODS\n\/\/=============================================================================================================\n\nNeuromag::Neuromag()\n: m_pDacqServer(new DacqServer(this))\n, m_pInfo(NULL)\n, m_bIsRunning(false)\n, m_iID(-1)\n{\n    this->setBufferSampleSize(100);\n    m_pRawMatrixBuffer = NULL;\n    this->init();\n\/\/    this->start();\n}\n\n\n\/\/*************************************************************************************************************\n\nNeuromag::~Neuromag()\n{\n    qDebug() << \"Destroy Neuromag::~Neuromag()\";\n\n    delete m_pDacqServer;\n\n    m_bIsRunning = false;\n    QThread::wait();\n}\n\n\n\/\/*************************************************************************************************************\n\nQByteArray Neuromag::availableCommands() const\n{\n    QByteArray t_blockCmdInfoList;\n\n    t_blockCmdInfoList.append(QString(\"\\t### %1 connector###\\r\\n\").arg(this->getName()));\n    t_blockCmdInfoList.append(\"\\tbufsize  [samples]\\tsets the buffer size of the FiffStreamClient\\r\\n\\t\\t\\t\\traw data buffers\\r\\n\");\n\n    return t_blockCmdInfoList;\n}\n\n\n\/\/*************************************************************************************************************\n\nConnectorID Neuromag::getConnectorID() const\n{\n    return _NEUROMAG;\n}\n\n\n\/\/*************************************************************************************************************\n\nconst char* Neuromag::getName() const\n{\n    return \"Neuromag Connector\";\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid Neuromag::init()\n{\n\n}\n\n\n\/\/*************************************************************************************************************\n\nbool Neuromag::parseCommand(QStringList& p_sListCommand, QByteArray& p_blockOutputInfo)\n{\n    bool success = false;\n\n\n    if(p_sListCommand[0].compare(\"bufsize\",Qt::CaseInsensitive) == 0)\n    {\n        \/\/\n        \/\/ bufsize\n        \/\/\n        if(p_sListCommand.size() > 1)\n        {\n            bool ok;\n            quint32 t_uiBuffSize = p_sListCommand[1].toInt(&ok);\n\n            if(ok && t_uiBuffSize > 0)\n            {\n                printf(\"bufsize %d\\n\", t_uiBuffSize);\n\n                requestSetBufferSize(t_uiBuffSize);\n\n                QString str = QString(\"\\tSet %1 buffer sample size to %2 samples\\r\\n\\n\").arg(getName()).arg(t_uiBuffSize);\n                p_blockOutputInfo.append(str);\n            }\n            else\n            {\n                p_blockOutputInfo.append(\"\\tBuffer size not set\\r\\n\\n\");\n            }\n        }\n        success = true;\n    }\n\n    return success;\n}\n\n\n\/\/*************************************************************************************************************\n\nbool Neuromag::start()\n{\n    \/\/ Start thread\n    m_pDacqServer->start();\n\n    QThread::start();\n\n    return true;\n}\n\n\n\/\/*************************************************************************************************************\n\nbool Neuromag::stop()\n{\n    m_pDacqServer->m_bIsRunning = false;\n    m_pDacqServer->wait();\n\n    m_bIsRunning = false;\n    QThread::wait();\n\n    return true;\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid Neuromag::releaseMeasInfo()\n{\n    if(m_pInfo)\n        emit remitMeasInfo(m_iID, m_pInfo);\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid Neuromag::requestMeasInfo(qint32 ID)\n{\n    m_iID = ID;\n\n    if(m_pInfo)\n        releaseMeasInfo();\n    else\n    {\n        m_pDacqServer->m_bMeasInfoRequest = true;\n\n        \/\/This should never happen\n        if(m_pDacqServer->isRunning())\n        {\n            m_pDacqServer->m_bIsRunning = false;\n            m_pDacqServer->wait();\n            m_pDacqServer->start();\n        }\n        \/\/\n        else\n        {\n            m_pDacqServer->start();\n\/\/            m_pDacqServer->wait();\/\/ until header reading finished\n        }\n    }\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid Neuromag::requestMeas()\n{\n    qDebug() << \"void Neuromag::requestMeas()\";\n\n    m_pDacqServer->m_bMeasRequest = true;\n    this->start();\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid Neuromag::requestMeasStop()\n{\n    this->stop();\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid Neuromag::requestSetBufferSize(quint32 p_uiBuffSize)\n{\n    if(p_uiBuffSize > 0)\n    {\n        qDebug() << \"void Neuromag::setBufferSize: \" << p_uiBuffSize;\n\n        this->stop();\n\n        this->setBufferSampleSize(p_uiBuffSize);\n\n        this->start();\n    }\n}\n\n\n\/\/*************************************************************************************************************\n\nvoid Neuromag::run()\n{\n    m_bIsRunning = true;\n\n    while(m_bIsRunning)\n    {\n        if(m_pRawMatrixBuffer)\n        {\n            \/\/ Pop available Buffers\n            MatrixXf tmp = m_pRawMatrixBuffer->pop();\n\n\/\/\/\/            printf(\"%d raw buffer (%d x %d) generated\\r\\n\", count, tmp.rows(), tmp.cols());\n\n            emit remitRawBuffer(tmp);\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2015 ScyllaDB\n *\/\n\n\/*\n * This file is part of Scylla.\n *\n * Scylla is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * Scylla is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with Scylla.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n#pragma once\n\n#include <memory>\n#include <seastar\/core\/sharded.hh>\n#include <seastar\/core\/future.hh>\n#include \"cql3\/query_processor.hh\"\n#include \"cql3\/query_options.hh\"\n#include \"db\/timeout_clock.hh\"\n#include \"exceptions\/exceptions.hh\"\n#include \"timeout_config.hh\"\n\nclass database;\n\nnamespace service {\nclass storage_proxy;\n}\n\n\nnamespace db {\nstruct query_context {\n    distributed<database>& _db;\n    distributed<cql3::query_processor>& _qp;\n    query_context(distributed<database>& db, distributed<cql3::query_processor>& qp) : _db(db), _qp(qp) {}\n\n    template <typename... Args>\n    future<::shared_ptr<cql3::untyped_result_set>> execute_cql(sstring req, Args&&... args) {\n        return _qp.local().execute_internal(req, { data_value(std::forward<Args>(args))... });\n    }\n\n    template <typename... Args>\n    future<::shared_ptr<cql3::untyped_result_set>> execute_cql_with_timeout(sstring req,\n            db::timeout_clock::time_point timeout,\n            Args&&... args) {\n        const db::timeout_clock::time_point now = db::timeout_clock::now();\n        const db::timeout_clock::duration d =\n            now < timeout ?\n                timeout - now :\n                \/\/ let the `storage_proxy` time out the query down the call chain\n                db::timeout_clock::duration::zero();\n\n        return do_with(timeout_config{d, d, d, d, d, d, d}, [this, req = std::move(req), &args...] (auto& tcfg) {\n            return _qp.local().execute_internal(req,\n                cql3::query_options::DEFAULT.get_consistency(),\n                tcfg,\n                { data_value(std::forward<Args>(args))... },\n                true);\n        });\n    }\n\n    database& db() {\n        return _db.local();\n    }\n\n    service::storage_proxy& proxy() {\n        return _qp.local().proxy();\n    }\n\n    cql3::query_processor& qp() {\n        return _qp.local();\n    }\n};\n\n\/\/ This does not have to be thread local, because all cores will share the same context.\nextern std::unique_ptr<query_context> qctx;\n\ntemplate <typename... Args>\nstatic future<::shared_ptr<cql3::untyped_result_set>> execute_cql(sstring text, Args&&... args) {\n    assert(qctx);\n    return qctx->execute_cql(text, std::forward<Args>(args)...);\n}\n\ntemplate <typename... Args>\nstatic future<::shared_ptr<cql3::untyped_result_set>> execute_cql_with_timeout(sstring cql,\n        db::timeout_clock::time_point timeout,\n        Args&&... args) {\n    assert(qctx);\n    return qctx->execute_cql_with_timeout(cql, timeout, std::forward<Args>(args)...);\n}\n\n}\n<commit_msg>query-context: Kill global helpers<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#pragma once\n\n#include <memory>\n#include <seastar\/core\/sharded.hh>\n#include <seastar\/core\/future.hh>\n#include \"cql3\/query_processor.hh\"\n#include \"cql3\/query_options.hh\"\n#include \"db\/timeout_clock.hh\"\n#include \"exceptions\/exceptions.hh\"\n#include \"timeout_config.hh\"\n\nclass database;\n\nnamespace service {\nclass storage_proxy;\n}\n\n\nnamespace db {\nstruct query_context {\n    distributed<database>& _db;\n    distributed<cql3::query_processor>& _qp;\n    query_context(distributed<database>& db, distributed<cql3::query_processor>& qp) : _db(db), _qp(qp) {}\n\n    template <typename... Args>\n    future<::shared_ptr<cql3::untyped_result_set>> execute_cql(sstring req, Args&&... args) {\n        return _qp.local().execute_internal(req, { data_value(std::forward<Args>(args))... });\n    }\n\n    template <typename... Args>\n    future<::shared_ptr<cql3::untyped_result_set>> execute_cql_with_timeout(sstring req,\n            db::timeout_clock::time_point timeout,\n            Args&&... args) {\n        const db::timeout_clock::time_point now = db::timeout_clock::now();\n        const db::timeout_clock::duration d =\n            now < timeout ?\n                timeout - now :\n                \/\/ let the `storage_proxy` time out the query down the call chain\n                db::timeout_clock::duration::zero();\n\n        return do_with(timeout_config{d, d, d, d, d, d, d}, [this, req = std::move(req), &args...] (auto& tcfg) {\n            return _qp.local().execute_internal(req,\n                cql3::query_options::DEFAULT.get_consistency(),\n                tcfg,\n                { data_value(std::forward<Args>(args))... },\n                true);\n        });\n    }\n\n    database& db() {\n        return _db.local();\n    }\n\n    service::storage_proxy& proxy() {\n        return _qp.local().proxy();\n    }\n\n    cql3::query_processor& qp() {\n        return _qp.local();\n    }\n};\n\n\/\/ This does not have to be thread local, because all cores will share the same context.\nextern std::unique_ptr<query_context> qctx;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2013, German Neuroinformatics Node (G-Node)\n\/\/\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted under the terms of the BSD License. See\n\/\/ LICENSE file in the root of the Project.\n\n#include <ctime>\n#include <functional>\n#include \"TestValidate.hpp\"\n\nusing namespace std;\nusing namespace nix;\nusing namespace validate;\n\nvoid TestValidate::setUp() {\n    file = File::open(\"test_validate.h5\", FileMode::Overwrite);\n    section = file.createSection(\"foo_section\", \"metadata\");\n    block = file.createBlock(\"block_one\", \"dataset\");\n    startup_time = time(NULL);\n}\n\nvoid TestValidate::tearDown() {\n    file.close();\n}\n\nvoid TestValidate::test() {    \n    auto t = block.id();\n    typedef decltype(t) T;\n    typedef function<T()> TFUNC;\n    \n    \/\/ id must not be false\n    auto myProperty1 = [&](){ return block.id(); };\n    std::function<bool(T)> myCheck1 = notFalse<T>();\n    condition<TFUNC, T>::type myConditionFunc1 = must<TFUNC, T>;\n    conditionType myCondition1 = myConditionFunc1(myProperty1, myCheck1, \"id is false!\");\n    \n    \/\/ id must be false\n    std::function<bool(T)> myCheck2 = isFalse<T>();\n    conditionType myCondition2 = myConditionFunc1(myProperty1, myCheck2, \"id is not false!\");\n    \n    \/\/ id should be false\n    condition<TFUNC, T>::type myConditionFunc2 = should<TFUNC, T>;\n    conditionType myCondition3 = myConditionFunc2(myProperty1, myCheck2, \"id is not false!\");\n        \n    vector<conditionType> myConditions {myCondition1, myCondition2, myCondition3};\n    \n    Result myResult = validator(myConditions);\n    \n    cout << endl;\n    cout << myResult;\n}\n<commit_msg>Simplified usage example in TestValidate<commit_after>\/\/ Copyright (c) 2013, German Neuroinformatics Node (G-Node)\n\/\/\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted under the terms of the BSD License. See\n\/\/ LICENSE file in the root of the Project.\n\n#include <ctime>\n#include <functional>\n#include \"TestValidate.hpp\"\n\nusing namespace std;\nusing namespace nix;\nusing namespace validate;\n\nvoid TestValidate::setUp() {\n    file = File::open(\"test_validate.h5\", FileMode::Overwrite);\n    section = file.createSection(\"foo_section\", \"metadata\");\n    block = file.createBlock(\"block_one\", \"dataset\");\n    startup_time = time(NULL);\n}\n\nvoid TestValidate::tearDown() {\n    file.close();\n}\n\nvoid TestValidate::test() {    \n    auto t = block.id();\n    typedef decltype(t) T;\n    typedef function<T()> TFUNC;\n    \n    \/\/ id must not be false\n    auto myProperty1 = [&](){ return block.id(); };\n    auto myCheck1 = notFalse<T>();\n    auto myConditionFunc1 = must<TFUNC, T>;\n    auto myCondition1 = myConditionFunc1(myProperty1, myCheck1, \"id is false!\");\n    \n    \/\/ id must be false\n    auto myCheck2 = isFalse<T>();\n    auto myCondition2 = myConditionFunc1(myProperty1, myCheck2, \"id is not false!\");\n    \n    \/\/ id should be false\n    auto myConditionFunc2 = should<TFUNC, T>;\n    auto myCondition3 = myConditionFunc2(myProperty1, myCheck2, \"id is not false!\");\n        \n    vector<conditionType> myConditions {myCondition1, myCondition2, myCondition3};\n    \n    Result myResult = validator(myConditions);\n    \n    cout << endl;\n    cout << myResult;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* This is free and unencumbered software released into the public domain. *\/\n\n#ifdef HAVE_CONFIG_H\n#include <config.h>\n#endif\n\n#include \"catch.hpp\"\n\n#include <xsd++\/boolean.h> \/* for xsd::boolean *\/\n\nTEST_CASE(\"match_empty\") {\n  REQUIRE(!xsd::boolean::match(\"\"));\n}\n\nTEST_CASE(\"match_false\") {\n  REQUIRE(xsd::boolean::match(\"false\"));\n}\n\nTEST_CASE(\"match_true\") {\n  REQUIRE(xsd::boolean::match(\"true\"));\n}\n\nTEST_CASE(\"match_0\") {\n  REQUIRE(xsd::boolean::match(\"0\"));\n}\n\nTEST_CASE(\"match_1\") {\n  REQUIRE(xsd::boolean::match(\"1\"));\n}\n\nTEST_CASE(\"construct_from_value\") {\n  REQUIRE(xsd::boolean(false).to_string() == \"false\");\n  REQUIRE(xsd::boolean(true).to_string() == \"true\");\n}\n\nTEST_CASE(\"construct_from_string\") {\n  REQUIRE(xsd::boolean(\"false\").to_string() == \"false\");\n  REQUIRE(xsd::boolean(\"true\").to_string() == \"true\");\n  REQUIRE(xsd::boolean(\"0\").to_string() == \"0\");\n  REQUIRE(xsd::boolean(\"1\").to_string() == \"1\");\n}\n\nTEST_CASE(\"validate\") {\n  REQUIRE(xsd::boolean(\"false\").validate());\n  REQUIRE(xsd::boolean(\"true\").validate());\n  REQUIRE(xsd::boolean(\"0\").validate());\n  REQUIRE(xsd::boolean(\"1\").validate());\n}\n\nTEST_CASE(\"canonicalize_false\") {\n  xsd::boolean value(\"false\");\n  REQUIRE(value.canonicalize() == false);\n  REQUIRE(value.to_string() == \"false\");\n}\n\nTEST_CASE(\"canonicalize_true\") {\n  xsd::boolean value(\"true\");\n  REQUIRE(value.canonicalize() == false);\n  REQUIRE(value.to_string() == \"true\");\n}\n\nTEST_CASE(\"canonicalize_0\") {\n  xsd::boolean value(\"0\");\n  REQUIRE(value.canonicalize() == true);\n  REQUIRE(value.to_string() == \"false\");\n}\n\nTEST_CASE(\"canonicalize_1\") {\n  xsd::boolean value(\"1\");\n  REQUIRE(value.canonicalize() == true);\n  REQUIRE(value.to_string() == \"true\");\n}\n\nTEST_CASE(\"canonicalize_invalid\") {\n  xsd::boolean value(\"\");\n  REQUIRE(value.canonicalize() == false);\n}\n\nTEST_CASE(\"cast_to_bool\") {\n  REQUIRE((bool)xsd::boolean(false) == false);\n  REQUIRE((bool)xsd::boolean(true) == true);\n  REQUIRE((bool)xsd::boolean(\"false\") == false);\n  REQUIRE((bool)xsd::boolean(\"true\") == true);\n  REQUIRE((bool)xsd::boolean(\"0\") == false);\n  REQUIRE((bool)xsd::boolean(\"1\") == true);\n  REQUIRE_THROWS_AS((bool)xsd::boolean(\"\"), std::bad_cast);\n}\n\nTEST_CASE(\"cast_to_int\") {\n  REQUIRE_THROWS_AS((int)xsd::boolean(false), std::bad_cast);\n  REQUIRE_THROWS_AS((int)xsd::boolean(true), std::bad_cast);\n}\n\nTEST_CASE(\"cast_to_long\") {\n  REQUIRE_THROWS_AS((long)xsd::boolean(false), std::bad_cast);\n  REQUIRE_THROWS_AS((long)xsd::boolean(true), std::bad_cast);\n}\n\nTEST_CASE(\"cast_to_long_long\") {\n  REQUIRE_THROWS_AS((long long)xsd::boolean(false), std::bad_cast);\n  REQUIRE_THROWS_AS((long long)xsd::boolean(true), std::bad_cast);\n}\n\nTEST_CASE(\"cast_to_double\") {\n  REQUIRE_THROWS_AS((double)xsd::boolean(false), std::bad_cast);\n  REQUIRE_THROWS_AS((double)xsd::boolean(true), std::bad_cast);\n}\n\nTEST_CASE(\"cast_to_float\") {\n  REQUIRE_THROWS_AS((float)xsd::boolean(false), std::bad_cast);\n  REQUIRE_THROWS_AS((float)xsd::boolean(true), std::bad_cast);\n}\n\nTEST_CASE(\"cast_to_string\") {\n  REQUIRE((std::string)xsd::boolean(false) == \"false\");\n  REQUIRE((std::string)xsd::boolean(true) == \"true\");\n  REQUIRE((std::string)xsd::boolean(\"false\") == \"false\");\n  REQUIRE((std::string)xsd::boolean(\"true\") == \"true\");\n  REQUIRE((std::string)xsd::boolean(\"0\") == \"0\");\n  REQUIRE((std::string)xsd::boolean(\"1\") == \"1\");\n}\n<commit_msg>Updated the xsd:boolean tests for recent API changes.<commit_after>\/* This is free and unencumbered software released into the public domain. *\/\n\n#ifdef HAVE_CONFIG_H\n#include <config.h>\n#endif\n\n#include \"catch.hpp\"\n\n#include <xsd++\/boolean.h> \/* for xsd::boolean *\/\n\nTEST_CASE(\"match_empty\") {\n  REQUIRE(!xsd::boolean::match(\"\"));\n}\n\nTEST_CASE(\"match_false\") {\n  REQUIRE(xsd::boolean::match(\"false\"));\n}\n\nTEST_CASE(\"match_true\") {\n  REQUIRE(xsd::boolean::match(\"true\"));\n}\n\nTEST_CASE(\"match_0\") {\n  REQUIRE(xsd::boolean::match(\"0\"));\n}\n\nTEST_CASE(\"match_1\") {\n  REQUIRE(xsd::boolean::match(\"1\"));\n}\n\nTEST_CASE(\"construct_from_value\") {\n  REQUIRE(xsd::boolean(false).to_string() == \"false\");\n  REQUIRE(xsd::boolean(true).to_string() == \"true\");\n}\n\nTEST_CASE(\"construct_from_string\") {\n  REQUIRE(xsd::boolean(\"false\").to_string() == \"false\");\n  REQUIRE(xsd::boolean(\"true\").to_string() == \"true\");\n  REQUIRE(xsd::boolean(\"0\").to_string() == \"0\");\n  REQUIRE(xsd::boolean(\"1\").to_string() == \"1\");\n}\n\nTEST_CASE(\"validate\") {\n  REQUIRE(xsd::boolean(\"false\").validate());\n  REQUIRE(xsd::boolean(\"true\").validate());\n  REQUIRE(xsd::boolean(\"0\").validate());\n  REQUIRE(xsd::boolean(\"1\").validate());\n}\n\nTEST_CASE(\"canonicalize_false\") {\n  xsd::boolean value(\"false\");\n  REQUIRE(value.canonicalize() == false);\n  REQUIRE(value.to_string() == \"false\");\n}\n\nTEST_CASE(\"canonicalize_true\") {\n  xsd::boolean value(\"true\");\n  REQUIRE(value.canonicalize() == false);\n  REQUIRE(value.to_string() == \"true\");\n}\n\nTEST_CASE(\"canonicalize_0\") {\n  xsd::boolean value(\"0\");\n  REQUIRE(value.canonicalize() == true);\n  REQUIRE(value.to_string() == \"false\");\n}\n\nTEST_CASE(\"canonicalize_1\") {\n  xsd::boolean value(\"1\");\n  REQUIRE(value.canonicalize() == true);\n  REQUIRE(value.to_string() == \"true\");\n}\n\nTEST_CASE(\"canonicalize_invalid\") {\n  xsd::boolean value(\"\");\n  REQUIRE_THROWS_AS(value.canonicalize(), std::invalid_argument);\n}\n\nTEST_CASE(\"cast_to_bool\") {\n  REQUIRE((bool)xsd::boolean(false) == false);\n  REQUIRE((bool)xsd::boolean(true) == true);\n  REQUIRE((bool)xsd::boolean(\"false\") == false);\n  REQUIRE((bool)xsd::boolean(\"true\") == true);\n  REQUIRE((bool)xsd::boolean(\"0\") == false);\n  REQUIRE((bool)xsd::boolean(\"1\") == true);\n  REQUIRE_THROWS_AS((bool)xsd::boolean(\"\"), std::bad_cast);\n}\n\nTEST_CASE(\"cast_to_int\") {\n  REQUIRE_THROWS_AS((int)xsd::boolean(false), std::bad_cast);\n  REQUIRE_THROWS_AS((int)xsd::boolean(true), std::bad_cast);\n}\n\nTEST_CASE(\"cast_to_long\") {\n  REQUIRE_THROWS_AS((long)xsd::boolean(false), std::bad_cast);\n  REQUIRE_THROWS_AS((long)xsd::boolean(true), std::bad_cast);\n}\n\nTEST_CASE(\"cast_to_long_long\") {\n  REQUIRE_THROWS_AS((long long)xsd::boolean(false), std::bad_cast);\n  REQUIRE_THROWS_AS((long long)xsd::boolean(true), std::bad_cast);\n}\n\nTEST_CASE(\"cast_to_double\") {\n  REQUIRE_THROWS_AS((double)xsd::boolean(false), std::bad_cast);\n  REQUIRE_THROWS_AS((double)xsd::boolean(true), std::bad_cast);\n}\n\nTEST_CASE(\"cast_to_float\") {\n  REQUIRE_THROWS_AS((float)xsd::boolean(false), std::bad_cast);\n  REQUIRE_THROWS_AS((float)xsd::boolean(true), std::bad_cast);\n}\n\nTEST_CASE(\"cast_to_string\") {\n  REQUIRE((std::string)xsd::boolean(false) == \"false\");\n  REQUIRE((std::string)xsd::boolean(true) == \"true\");\n  REQUIRE((std::string)xsd::boolean(\"false\") == \"false\");\n  REQUIRE((std::string)xsd::boolean(\"true\") == \"true\");\n  REQUIRE((std::string)xsd::boolean(\"0\") == \"0\");\n  REQUIRE((std::string)xsd::boolean(\"1\") == \"1\");\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*******************************************************************************\n * Copyright 2009-2013 Jörg Müller\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 \"file\/FileWriter.h\"\n#include \"plugin\/PluginManager.h\"\n#include \"generator\/Sawtooth.h\"\n#include \"generator\/Silence.h\"\n#include \"generator\/Sine.h\"\n#include \"generator\/Square.h\"\n#include \"generator\/Triangle.h\"\n#include \"fx\/LimiterReader.h\"\n#include \"Exception.h\"\n#include \"IReader.h\"\n\n#include <string>\n#include <iostream>\n\nusing namespace aud;\n\nint main(int argc, char* argv[])\n{\n\tPluginManager::loadPlugins(\".\");\n\n\tSampleRate sampleRate = RATE_48000;\n\tfloat frequency = 1.0f;\n\tfloat duration = 1.0f;\n\n\tSawtooth sawtooth(frequency, sampleRate);\n\tSilence silence;\n\tSine sine(frequency, sampleRate);\n\tSquare square(frequency, sampleRate);\n\tTriangle triangle(frequency, sampleRate);\n\n\tstruct { ISound* sound; std::string name; } generators[] = {\n\t\t{&sawtooth, \"sawtooth\"},\n\t\t{&silence, \"silence\"},\n\t\t{&sine, \"sine\"},\n\t\t{&square, \"square\"},\n\t\t{&triangle, \"triangle\"},\n\t\t{NULL, \"\"}\n\t};\n\n\tstd::shared_ptr<IReader> reader;\n\n\tDeviceSpecs specs;\n\tspecs.channels = CHANNELS_MONO;\n\tspecs.rate = sampleRate;\n\tspecs.format = FORMAT_S16;\n\n\tfor(int i = 0; generators[i].sound; i++)\n\t{\n\t\treader = generators[i].sound->createReader();\n\n\t\treader = std::shared_ptr<IReader>(new LimiterReader(reader, 0, duration));\n\n\t\tauto writer = FileWriter::createWriter(generators[i].name + \".wav\", specs, CONTAINER_WAV, CODEC_PCM, 0);\n\n\t\tFileWriter::writeReader(reader, writer, 0, AUD_DEFAULT_BUFFER_SIZE);\n\n\t\twriter.reset();\n\t}\n\n\treturn 0;\n}\n<commit_msg>Demos: signalgen NULL to nullptr fix.<commit_after>\/*******************************************************************************\n * Copyright 2009-2013 Jörg Müller\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 \"file\/FileWriter.h\"\n#include \"plugin\/PluginManager.h\"\n#include \"generator\/Sawtooth.h\"\n#include \"generator\/Silence.h\"\n#include \"generator\/Sine.h\"\n#include \"generator\/Square.h\"\n#include \"generator\/Triangle.h\"\n#include \"fx\/LimiterReader.h\"\n#include \"Exception.h\"\n#include \"IReader.h\"\n\n#include <string>\n#include <iostream>\n\nusing namespace aud;\n\nint main(int argc, char* argv[])\n{\n\tPluginManager::loadPlugins(\".\");\n\n\tSampleRate sampleRate = RATE_48000;\n\tfloat frequency = 1.0f;\n\tfloat duration = 1.0f;\n\n\tSawtooth sawtooth(frequency, sampleRate);\n\tSilence silence;\n\tSine sine(frequency, sampleRate);\n\tSquare square(frequency, sampleRate);\n\tTriangle triangle(frequency, sampleRate);\n\n\tstruct { ISound* sound; std::string name; } generators[] = {\n\t\t{&sawtooth, \"sawtooth\"},\n\t\t{&silence, \"silence\"},\n\t\t{&sine, \"sine\"},\n\t\t{&square, \"square\"},\n\t\t{&triangle, \"triangle\"},\n\t\t{nullptr, \"\"}\n\t};\n\n\tstd::shared_ptr<IReader> reader;\n\n\tDeviceSpecs specs;\n\tspecs.channels = CHANNELS_MONO;\n\tspecs.rate = sampleRate;\n\tspecs.format = FORMAT_S16;\n\n\tfor(int i = 0; generators[i].sound; i++)\n\t{\n\t\treader = generators[i].sound->createReader();\n\n\t\treader = std::shared_ptr<IReader>(new LimiterReader(reader, 0, duration));\n\n\t\tauto writer = FileWriter::createWriter(generators[i].name + \".wav\", specs, CONTAINER_WAV, CODEC_PCM, 0);\n\n\t\tFileWriter::writeReader(reader, writer, 0, AUD_DEFAULT_BUFFER_SIZE);\n\n\t\twriter.reset();\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n *   http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\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 <concurrency\/ThreadManager.h>\n#include <concurrency\/PosixThreadFactory.h>\n#include <concurrency\/Monitor.h>\n#include <concurrency\/Util.h>\n#include <concurrency\/Mutex.h>\n#include <protocol\/TBinaryProtocol.h>\n#include <server\/TSimpleServer.h>\n#include <server\/TThreadPoolServer.h>\n#include <server\/TThreadedServer.h>\n#include <transport\/TServerSocket.h>\n#include <transport\/TSocket.h>\n#include <transport\/TTransportUtils.h>\n#include <transport\/TFileTransport.h>\n#include <TLogging.h>\n\n#include \"Service.h\"\n\n#include <iostream>\n#include <set>\n#include <stdexcept>\n#include <sstream>\n\n#include <map>\n#include <ext\/hash_map>\nusing __gnu_cxx::hash_map;\nusing __gnu_cxx::hash;\n\nusing namespace std;\nusing namespace boost;\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 test::stress;\n\nstruct eqstr {\n  bool operator()(const char* s1, const char* s2) const {\n    return strcmp(s1, s2) == 0;\n  }\n};\n\nstruct ltstr {\n  bool operator()(const char* s1, const char* s2) const {\n    return strcmp(s1, s2) < 0;\n  }\n};\n\n\n\/\/ typedef hash_map<const char*, int, hash<const char*>, eqstr> count_map;\ntypedef map<const char*, int, ltstr> count_map;\n\nclass Server : public ServiceIf {\n public:\n  Server() {}\n\n  void count(const char* method) {\n    Guard m(lock_);\n    int ct = counts_[method];\n    counts_[method] = ++ct;\n  }\n\n  void echoVoid() {\n    count(\"echoVoid\");\n    return;\n  }\n\n  count_map getCount() {\n    Guard m(lock_);\n    return counts_;\n  }\n\n  int8_t echoByte(const int8_t arg) {return arg;}\n  int32_t echoI32(const int32_t arg) {return arg;}\n  int64_t echoI64(const int64_t arg) {return arg;}\n  void echoString(string& out, const string &arg) {\n    if (arg != \"hello\") {\n      T_ERROR_ABORT(\"WRONG STRING!!!!\");\n    }\n    out = arg;\n  }\n  void echoList(vector<int8_t> &out, const vector<int8_t> &arg) { out = arg; }\n  void echoSet(set<int8_t> &out, const set<int8_t> &arg) { out = arg; }\n  void echoMap(map<int8_t, int8_t> &out, const map<int8_t, int8_t> &arg) { out = arg; }\n\nprivate:\n  count_map counts_;\n  Mutex lock_;\n\n};\n\nclass ClientThread: public Runnable {\npublic:\n\n  ClientThread(shared_ptr<TTransport>transport, shared_ptr<ServiceClient> client, Monitor& monitor, size_t& workerCount, size_t loopCount, TType loopType) :\n    _transport(transport),\n    _client(client),\n    _monitor(monitor),\n    _workerCount(workerCount),\n    _loopCount(loopCount),\n    _loopType(loopType)\n  {}\n\n  void run() {\n\n    \/\/ Wait for all worker threads to start\n\n    {Synchronized s(_monitor);\n      while(_workerCount == 0) {\n        _monitor.wait();\n      }\n    }\n\n    _startTime = Util::currentTime();\n\n    _transport->open();\n\n    switch(_loopType) {\n    case T_VOID: loopEchoVoid(); break;\n    case T_BYTE: loopEchoByte(); break;\n    case T_I32: loopEchoI32(); break;\n    case T_I64: loopEchoI64(); break;\n    case T_STRING: loopEchoString(); break;\n    default: cerr << \"Unexpected loop type\" << _loopType << endl; break;\n    }\n\n    _endTime = Util::currentTime();\n\n    _transport->close();\n\n    _done = true;\n\n    {Synchronized s(_monitor);\n\n      _workerCount--;\n\n      if (_workerCount == 0) {\n\n        _monitor.notify();\n      }\n    }\n  }\n\n  void loopEchoVoid() {\n    for (size_t ix = 0; ix < _loopCount; ix++) {\n      _client->echoVoid();\n    }\n  }\n\n  void loopEchoByte() {\n    for (size_t ix = 0; ix < _loopCount; ix++) {\n      int8_t arg = 1;\n      int8_t result;\n      result =_client->echoByte(arg);\n      assert(result == arg);\n    }\n  }\n\n  void loopEchoI32() {\n    for (size_t ix = 0; ix < _loopCount; ix++) {\n      int32_t arg = 1;\n      int32_t result;\n      result =_client->echoI32(arg);\n      assert(result == arg);\n    }\n  }\n\n  void loopEchoI64() {\n    for (size_t ix = 0; ix < _loopCount; ix++) {\n      int64_t arg = 1;\n      int64_t result;\n      result =_client->echoI64(arg);\n      assert(result == arg);\n    }\n  }\n\n  void loopEchoString() {\n    for (size_t ix = 0; ix < _loopCount; ix++) {\n      string arg = \"hello\";\n      string result;\n      _client->echoString(result, arg);\n      assert(result == arg);\n    }\n  }\n\n  shared_ptr<TTransport> _transport;\n  shared_ptr<ServiceClient> _client;\n  Monitor& _monitor;\n  size_t& _workerCount;\n  size_t _loopCount;\n  TType _loopType;\n  long long _startTime;\n  long long _endTime;\n  bool _done;\n  Monitor _sleep;\n};\n\n\nint main(int argc, char **argv) {\n\n  int port = 9091;\n  string serverType = \"thread-pool\";\n  string protocolType = \"binary\";\n  size_t workerCount = 4;\n  size_t clientCount = 20;\n  size_t loopCount = 50000;\n  TType loopType  = T_VOID;\n  string callName = \"echoVoid\";\n  bool runServer = true;\n  bool logRequests = false;\n  string requestLogPath = \".\/requestlog.tlog\";\n  bool replayRequests = false;\n\n  ostringstream usage;\n\n  usage <<\n    argv[0] << \" [--port=<port number>] [--server] [--server-type=<server-type>] [--protocol-type=<protocol-type>] [--workers=<worker-count>] [--clients=<client-count>] [--loop=<loop-count>]\" << endl <<\n    \"\\tclients        Number of client threads to create - 0 implies no clients, i.e. server only.  Default is \" << clientCount << endl <<\n    \"\\thelp           Prints this help text.\" << endl <<\n    \"\\tcall           Service method to call.  Default is \" << callName << endl <<\n    \"\\tloop           The number of remote thrift calls each client makes.  Default is \" << loopCount << endl <<\n    \"\\tport           The port the server and clients should bind to for thrift network connections.  Default is \" << port << endl <<\n    \"\\tserver         Run the Thrift server in this process.  Default is \" << runServer << endl <<\n    \"\\tserver-type    Type of server, \\\"simple\\\" or \\\"thread-pool\\\".  Default is \" << serverType << endl <<\n    \"\\tprotocol-type  Type of protocol, \\\"binary\\\", \\\"ascii\\\", or \\\"xml\\\".  Default is \" << protocolType << endl <<\n    \"\\tlog-request    Log all request to .\/requestlog.tlog. Default is \" << logRequests << endl <<\n    \"\\treplay-request Replay requests from log file (.\/requestlog.tlog) Default is \" << replayRequests << endl <<\n    \"\\tworkers        Number of thread pools workers.  Only valid for thread-pool server type.  Default is \" << workerCount << endl;\n\n\n  map<string, string>  args;\n\n  for (int ix = 1; ix < argc; ix++) {\n\n    string arg(argv[ix]);\n\n    if (arg.compare(0,2, \"--\") == 0) {\n\n      size_t end = arg.find_first_of(\"=\", 2);\n\n      string key = string(arg, 2, end - 2);\n\n      if (end != string::npos) {\n        args[key] = string(arg, end + 1);\n      } else {\n        args[key] = \"true\";\n      }\n    } else {\n      throw invalid_argument(\"Unexcepted command line token: \"+arg);\n    }\n  }\n\n  try {\n\n    if (!args[\"clients\"].empty()) {\n      clientCount = atoi(args[\"clients\"].c_str());\n    }\n\n    if (!args[\"help\"].empty()) {\n      cerr << usage.str();\n      return 0;\n    }\n\n    if (!args[\"loop\"].empty()) {\n      loopCount = atoi(args[\"loop\"].c_str());\n    }\n\n    if (!args[\"call\"].empty()) {\n      callName = args[\"call\"];\n    }\n\n    if (!args[\"port\"].empty()) {\n      port = atoi(args[\"port\"].c_str());\n    }\n\n    if (!args[\"server\"].empty()) {\n      runServer = args[\"server\"] == \"true\";\n    }\n\n    if (!args[\"log-request\"].empty()) {\n      logRequests = args[\"log-request\"] == \"true\";\n    }\n\n    if (!args[\"replay-request\"].empty()) {\n      replayRequests = args[\"replay-request\"] == \"true\";\n    }\n\n    if (!args[\"server-type\"].empty()) {\n      serverType = args[\"server-type\"];\n\n      if (serverType == \"simple\") {\n\n      } else if (serverType == \"thread-pool\") {\n\n      } else if (serverType == \"threaded\") {\n\n      } else {\n\n        throw invalid_argument(\"Unknown server type \"+serverType);\n      }\n    }\n\n    if (!args[\"workers\"].empty()) {\n      workerCount = atoi(args[\"workers\"].c_str());\n    }\n\n  } catch(exception& e) {\n    cerr << e.what() << endl;\n    cerr << usage;\n  }\n\n  shared_ptr<PosixThreadFactory> threadFactory = shared_ptr<PosixThreadFactory>(new PosixThreadFactory());\n\n  \/\/ Dispatcher\n  shared_ptr<Server> serviceHandler(new Server());\n\n  if (replayRequests) {\n    shared_ptr<Server> serviceHandler(new Server());\n    shared_ptr<ServiceProcessor> serviceProcessor(new ServiceProcessor(serviceHandler));\n\n    \/\/ Transports\n    shared_ptr<TFileTransport> fileTransport(new TFileTransport(requestLogPath));\n    fileTransport->setChunkSize(2 * 1024 * 1024);\n    fileTransport->setMaxEventSize(1024 * 16);\n    fileTransport->seekToEnd();\n\n    \/\/ Protocol Factory\n    shared_ptr<TProtocolFactory> protocolFactory(new TBinaryProtocolFactory());\n\n    TFileProcessor fileProcessor(serviceProcessor,\n                                 protocolFactory,\n                                 fileTransport);\n\n    fileProcessor.process(0, true);\n    exit(0);\n  }\n\n\n  if (runServer) {\n\n    shared_ptr<ServiceProcessor> serviceProcessor(new ServiceProcessor(serviceHandler));\n\n    \/\/ Transport\n    shared_ptr<TServerSocket> serverSocket(new TServerSocket(port));\n\n    \/\/ Transport Factory\n    shared_ptr<TTransportFactory> transportFactory(new TBufferedTransportFactory());\n\n    \/\/ Protocol Factory\n    shared_ptr<TProtocolFactory> protocolFactory(new TBinaryProtocolFactory());\n\n    if (logRequests) {\n      \/\/ initialize the log file\n      shared_ptr<TFileTransport> fileTransport(new TFileTransport(requestLogPath));\n      fileTransport->setChunkSize(2 * 1024 * 1024);\n      fileTransport->setMaxEventSize(1024 * 16);\n\n      transportFactory =\n        shared_ptr<TTransportFactory>(new TPipedTransportFactory(fileTransport));\n    }\n\n    shared_ptr<Thread> serverThread;\n\n    if (serverType == \"simple\") {\n\n      serverThread = threadFactory->newThread(shared_ptr<TServer>(new TSimpleServer(serviceProcessor, serverSocket, transportFactory, protocolFactory)));\n\n    } else if (serverType == \"threaded\") {\n\n      serverThread = threadFactory->newThread(shared_ptr<TServer>(new TThreadedServer(serviceProcessor, serverSocket, transportFactory, protocolFactory)));\n\n    } else if (serverType == \"thread-pool\") {\n\n      shared_ptr<ThreadManager> threadManager = ThreadManager::newSimpleThreadManager(workerCount);\n\n      threadManager->threadFactory(threadFactory);\n      threadManager->start();\n      serverThread = threadFactory->newThread(shared_ptr<TServer>(new TThreadPoolServer(serviceProcessor, serverSocket, transportFactory, protocolFactory, threadManager)));\n    }\n\n    cerr << \"Starting the server on port \" << port << endl;\n\n    serverThread->start();\n\n    \/\/ If we aren't running clients, just wait forever for external clients\n\n    if (clientCount == 0) {\n      serverThread->join();\n    }\n  }\n\n  if (clientCount > 0) {\n\n    Monitor monitor;\n\n    size_t threadCount = 0;\n\n    set<shared_ptr<Thread> > clientThreads;\n\n    if (callName == \"echoVoid\") { loopType = T_VOID;}\n    else if (callName == \"echoByte\") { loopType = T_BYTE;}\n    else if (callName == \"echoI32\") { loopType = T_I32;}\n    else if (callName == \"echoI64\") { loopType = T_I64;}\n    else if (callName == \"echoString\") { loopType = T_STRING;}\n    else {throw invalid_argument(\"Unknown service call \"+callName);}\n\n    for (size_t ix = 0; ix < clientCount; ix++) {\n\n      shared_ptr<TSocket> socket(new TSocket(\"127.0.01\", port));\n      shared_ptr<TBufferedTransport> bufferedSocket(new TBufferedTransport(socket, 2048));\n      shared_ptr<TProtocol> protocol(new TBinaryProtocol(bufferedSocket));\n      shared_ptr<ServiceClient> serviceClient(new ServiceClient(protocol));\n\n      clientThreads.insert(threadFactory->newThread(shared_ptr<ClientThread>(new ClientThread(socket, serviceClient, monitor, threadCount, loopCount, loopType))));\n    }\n\n    for (std::set<shared_ptr<Thread> >::const_iterator thread = clientThreads.begin(); thread != clientThreads.end(); thread++) {\n      (*thread)->start();\n    }\n\n    long long time00;\n    long long time01;\n\n    {Synchronized s(monitor);\n      threadCount = clientCount;\n\n      cerr << \"Launch \"<< clientCount << \" client threads\" << endl;\n\n      time00 =  Util::currentTime();\n\n      monitor.notifyAll();\n\n      while(threadCount > 0) {\n        monitor.wait();\n      }\n\n      time01 =  Util::currentTime();\n    }\n\n    long long firstTime = 9223372036854775807LL;\n    long long lastTime = 0;\n\n    double averageTime = 0;\n    long long minTime = 9223372036854775807LL;\n    long long maxTime = 0;\n\n    for (set<shared_ptr<Thread> >::iterator ix = clientThreads.begin(); ix != clientThreads.end(); ix++) {\n\n      shared_ptr<ClientThread> client = dynamic_pointer_cast<ClientThread>((*ix)->runnable());\n\n      long long delta = client->_endTime - client->_startTime;\n\n      assert(delta > 0);\n\n      if (client->_startTime < firstTime) {\n        firstTime = client->_startTime;\n      }\n\n      if (client->_endTime > lastTime) {\n        lastTime = client->_endTime;\n      }\n\n      if (delta < minTime) {\n        minTime = delta;\n      }\n\n      if (delta > maxTime) {\n        maxTime = delta;\n      }\n\n      averageTime+= delta;\n    }\n\n    averageTime \/= clientCount;\n\n\n    cout <<  \"workers :\" << workerCount << \", client : \" << clientCount << \", loops : \" << loopCount << \", rate : \" << (clientCount * loopCount * 1000) \/ ((double)(time01 - time00)) << endl;\n\n    count_map count = serviceHandler->getCount();\n    count_map::iterator iter;\n    for (iter = count.begin(); iter != count.end(); ++iter) {\n      printf(\"%s => %d\\n\", iter->first, iter->second);\n    }\n    cerr << \"done.\" << endl;\n  }\n\n  return 0;\n}\n<commit_msg>THRIFT-456. cpp: Bad IP address string in test\/cpp\/src\/main.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 <concurrency\/ThreadManager.h>\n#include <concurrency\/PosixThreadFactory.h>\n#include <concurrency\/Monitor.h>\n#include <concurrency\/Util.h>\n#include <concurrency\/Mutex.h>\n#include <protocol\/TBinaryProtocol.h>\n#include <server\/TSimpleServer.h>\n#include <server\/TThreadPoolServer.h>\n#include <server\/TThreadedServer.h>\n#include <transport\/TServerSocket.h>\n#include <transport\/TSocket.h>\n#include <transport\/TTransportUtils.h>\n#include <transport\/TFileTransport.h>\n#include <TLogging.h>\n\n#include \"Service.h\"\n\n#include <iostream>\n#include <set>\n#include <stdexcept>\n#include <sstream>\n\n#include <map>\n#include <ext\/hash_map>\nusing __gnu_cxx::hash_map;\nusing __gnu_cxx::hash;\n\nusing namespace std;\nusing namespace boost;\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 test::stress;\n\nstruct eqstr {\n  bool operator()(const char* s1, const char* s2) const {\n    return strcmp(s1, s2) == 0;\n  }\n};\n\nstruct ltstr {\n  bool operator()(const char* s1, const char* s2) const {\n    return strcmp(s1, s2) < 0;\n  }\n};\n\n\n\/\/ typedef hash_map<const char*, int, hash<const char*>, eqstr> count_map;\ntypedef map<const char*, int, ltstr> count_map;\n\nclass Server : public ServiceIf {\n public:\n  Server() {}\n\n  void count(const char* method) {\n    Guard m(lock_);\n    int ct = counts_[method];\n    counts_[method] = ++ct;\n  }\n\n  void echoVoid() {\n    count(\"echoVoid\");\n    return;\n  }\n\n  count_map getCount() {\n    Guard m(lock_);\n    return counts_;\n  }\n\n  int8_t echoByte(const int8_t arg) {return arg;}\n  int32_t echoI32(const int32_t arg) {return arg;}\n  int64_t echoI64(const int64_t arg) {return arg;}\n  void echoString(string& out, const string &arg) {\n    if (arg != \"hello\") {\n      T_ERROR_ABORT(\"WRONG STRING!!!!\");\n    }\n    out = arg;\n  }\n  void echoList(vector<int8_t> &out, const vector<int8_t> &arg) { out = arg; }\n  void echoSet(set<int8_t> &out, const set<int8_t> &arg) { out = arg; }\n  void echoMap(map<int8_t, int8_t> &out, const map<int8_t, int8_t> &arg) { out = arg; }\n\nprivate:\n  count_map counts_;\n  Mutex lock_;\n\n};\n\nclass ClientThread: public Runnable {\npublic:\n\n  ClientThread(shared_ptr<TTransport>transport, shared_ptr<ServiceClient> client, Monitor& monitor, size_t& workerCount, size_t loopCount, TType loopType) :\n    _transport(transport),\n    _client(client),\n    _monitor(monitor),\n    _workerCount(workerCount),\n    _loopCount(loopCount),\n    _loopType(loopType)\n  {}\n\n  void run() {\n\n    \/\/ Wait for all worker threads to start\n\n    {Synchronized s(_monitor);\n      while(_workerCount == 0) {\n        _monitor.wait();\n      }\n    }\n\n    _startTime = Util::currentTime();\n\n    _transport->open();\n\n    switch(_loopType) {\n    case T_VOID: loopEchoVoid(); break;\n    case T_BYTE: loopEchoByte(); break;\n    case T_I32: loopEchoI32(); break;\n    case T_I64: loopEchoI64(); break;\n    case T_STRING: loopEchoString(); break;\n    default: cerr << \"Unexpected loop type\" << _loopType << endl; break;\n    }\n\n    _endTime = Util::currentTime();\n\n    _transport->close();\n\n    _done = true;\n\n    {Synchronized s(_monitor);\n\n      _workerCount--;\n\n      if (_workerCount == 0) {\n\n        _monitor.notify();\n      }\n    }\n  }\n\n  void loopEchoVoid() {\n    for (size_t ix = 0; ix < _loopCount; ix++) {\n      _client->echoVoid();\n    }\n  }\n\n  void loopEchoByte() {\n    for (size_t ix = 0; ix < _loopCount; ix++) {\n      int8_t arg = 1;\n      int8_t result;\n      result =_client->echoByte(arg);\n      assert(result == arg);\n    }\n  }\n\n  void loopEchoI32() {\n    for (size_t ix = 0; ix < _loopCount; ix++) {\n      int32_t arg = 1;\n      int32_t result;\n      result =_client->echoI32(arg);\n      assert(result == arg);\n    }\n  }\n\n  void loopEchoI64() {\n    for (size_t ix = 0; ix < _loopCount; ix++) {\n      int64_t arg = 1;\n      int64_t result;\n      result =_client->echoI64(arg);\n      assert(result == arg);\n    }\n  }\n\n  void loopEchoString() {\n    for (size_t ix = 0; ix < _loopCount; ix++) {\n      string arg = \"hello\";\n      string result;\n      _client->echoString(result, arg);\n      assert(result == arg);\n    }\n  }\n\n  shared_ptr<TTransport> _transport;\n  shared_ptr<ServiceClient> _client;\n  Monitor& _monitor;\n  size_t& _workerCount;\n  size_t _loopCount;\n  TType _loopType;\n  long long _startTime;\n  long long _endTime;\n  bool _done;\n  Monitor _sleep;\n};\n\n\nint main(int argc, char **argv) {\n\n  int port = 9091;\n  string serverType = \"thread-pool\";\n  string protocolType = \"binary\";\n  size_t workerCount = 4;\n  size_t clientCount = 20;\n  size_t loopCount = 50000;\n  TType loopType  = T_VOID;\n  string callName = \"echoVoid\";\n  bool runServer = true;\n  bool logRequests = false;\n  string requestLogPath = \".\/requestlog.tlog\";\n  bool replayRequests = false;\n\n  ostringstream usage;\n\n  usage <<\n    argv[0] << \" [--port=<port number>] [--server] [--server-type=<server-type>] [--protocol-type=<protocol-type>] [--workers=<worker-count>] [--clients=<client-count>] [--loop=<loop-count>]\" << endl <<\n    \"\\tclients        Number of client threads to create - 0 implies no clients, i.e. server only.  Default is \" << clientCount << endl <<\n    \"\\thelp           Prints this help text.\" << endl <<\n    \"\\tcall           Service method to call.  Default is \" << callName << endl <<\n    \"\\tloop           The number of remote thrift calls each client makes.  Default is \" << loopCount << endl <<\n    \"\\tport           The port the server and clients should bind to for thrift network connections.  Default is \" << port << endl <<\n    \"\\tserver         Run the Thrift server in this process.  Default is \" << runServer << endl <<\n    \"\\tserver-type    Type of server, \\\"simple\\\" or \\\"thread-pool\\\".  Default is \" << serverType << endl <<\n    \"\\tprotocol-type  Type of protocol, \\\"binary\\\", \\\"ascii\\\", or \\\"xml\\\".  Default is \" << protocolType << endl <<\n    \"\\tlog-request    Log all request to .\/requestlog.tlog. Default is \" << logRequests << endl <<\n    \"\\treplay-request Replay requests from log file (.\/requestlog.tlog) Default is \" << replayRequests << endl <<\n    \"\\tworkers        Number of thread pools workers.  Only valid for thread-pool server type.  Default is \" << workerCount << endl;\n\n\n  map<string, string>  args;\n\n  for (int ix = 1; ix < argc; ix++) {\n\n    string arg(argv[ix]);\n\n    if (arg.compare(0,2, \"--\") == 0) {\n\n      size_t end = arg.find_first_of(\"=\", 2);\n\n      string key = string(arg, 2, end - 2);\n\n      if (end != string::npos) {\n        args[key] = string(arg, end + 1);\n      } else {\n        args[key] = \"true\";\n      }\n    } else {\n      throw invalid_argument(\"Unexcepted command line token: \"+arg);\n    }\n  }\n\n  try {\n\n    if (!args[\"clients\"].empty()) {\n      clientCount = atoi(args[\"clients\"].c_str());\n    }\n\n    if (!args[\"help\"].empty()) {\n      cerr << usage.str();\n      return 0;\n    }\n\n    if (!args[\"loop\"].empty()) {\n      loopCount = atoi(args[\"loop\"].c_str());\n    }\n\n    if (!args[\"call\"].empty()) {\n      callName = args[\"call\"];\n    }\n\n    if (!args[\"port\"].empty()) {\n      port = atoi(args[\"port\"].c_str());\n    }\n\n    if (!args[\"server\"].empty()) {\n      runServer = args[\"server\"] == \"true\";\n    }\n\n    if (!args[\"log-request\"].empty()) {\n      logRequests = args[\"log-request\"] == \"true\";\n    }\n\n    if (!args[\"replay-request\"].empty()) {\n      replayRequests = args[\"replay-request\"] == \"true\";\n    }\n\n    if (!args[\"server-type\"].empty()) {\n      serverType = args[\"server-type\"];\n\n      if (serverType == \"simple\") {\n\n      } else if (serverType == \"thread-pool\") {\n\n      } else if (serverType == \"threaded\") {\n\n      } else {\n\n        throw invalid_argument(\"Unknown server type \"+serverType);\n      }\n    }\n\n    if (!args[\"workers\"].empty()) {\n      workerCount = atoi(args[\"workers\"].c_str());\n    }\n\n  } catch(exception& e) {\n    cerr << e.what() << endl;\n    cerr << usage;\n  }\n\n  shared_ptr<PosixThreadFactory> threadFactory = shared_ptr<PosixThreadFactory>(new PosixThreadFactory());\n\n  \/\/ Dispatcher\n  shared_ptr<Server> serviceHandler(new Server());\n\n  if (replayRequests) {\n    shared_ptr<Server> serviceHandler(new Server());\n    shared_ptr<ServiceProcessor> serviceProcessor(new ServiceProcessor(serviceHandler));\n\n    \/\/ Transports\n    shared_ptr<TFileTransport> fileTransport(new TFileTransport(requestLogPath));\n    fileTransport->setChunkSize(2 * 1024 * 1024);\n    fileTransport->setMaxEventSize(1024 * 16);\n    fileTransport->seekToEnd();\n\n    \/\/ Protocol Factory\n    shared_ptr<TProtocolFactory> protocolFactory(new TBinaryProtocolFactory());\n\n    TFileProcessor fileProcessor(serviceProcessor,\n                                 protocolFactory,\n                                 fileTransport);\n\n    fileProcessor.process(0, true);\n    exit(0);\n  }\n\n\n  if (runServer) {\n\n    shared_ptr<ServiceProcessor> serviceProcessor(new ServiceProcessor(serviceHandler));\n\n    \/\/ Transport\n    shared_ptr<TServerSocket> serverSocket(new TServerSocket(port));\n\n    \/\/ Transport Factory\n    shared_ptr<TTransportFactory> transportFactory(new TBufferedTransportFactory());\n\n    \/\/ Protocol Factory\n    shared_ptr<TProtocolFactory> protocolFactory(new TBinaryProtocolFactory());\n\n    if (logRequests) {\n      \/\/ initialize the log file\n      shared_ptr<TFileTransport> fileTransport(new TFileTransport(requestLogPath));\n      fileTransport->setChunkSize(2 * 1024 * 1024);\n      fileTransport->setMaxEventSize(1024 * 16);\n\n      transportFactory =\n        shared_ptr<TTransportFactory>(new TPipedTransportFactory(fileTransport));\n    }\n\n    shared_ptr<Thread> serverThread;\n\n    if (serverType == \"simple\") {\n\n      serverThread = threadFactory->newThread(shared_ptr<TServer>(new TSimpleServer(serviceProcessor, serverSocket, transportFactory, protocolFactory)));\n\n    } else if (serverType == \"threaded\") {\n\n      serverThread = threadFactory->newThread(shared_ptr<TServer>(new TThreadedServer(serviceProcessor, serverSocket, transportFactory, protocolFactory)));\n\n    } else if (serverType == \"thread-pool\") {\n\n      shared_ptr<ThreadManager> threadManager = ThreadManager::newSimpleThreadManager(workerCount);\n\n      threadManager->threadFactory(threadFactory);\n      threadManager->start();\n      serverThread = threadFactory->newThread(shared_ptr<TServer>(new TThreadPoolServer(serviceProcessor, serverSocket, transportFactory, protocolFactory, threadManager)));\n    }\n\n    cerr << \"Starting the server on port \" << port << endl;\n\n    serverThread->start();\n\n    \/\/ If we aren't running clients, just wait forever for external clients\n\n    if (clientCount == 0) {\n      serverThread->join();\n    }\n  }\n\n  if (clientCount > 0) {\n\n    Monitor monitor;\n\n    size_t threadCount = 0;\n\n    set<shared_ptr<Thread> > clientThreads;\n\n    if (callName == \"echoVoid\") { loopType = T_VOID;}\n    else if (callName == \"echoByte\") { loopType = T_BYTE;}\n    else if (callName == \"echoI32\") { loopType = T_I32;}\n    else if (callName == \"echoI64\") { loopType = T_I64;}\n    else if (callName == \"echoString\") { loopType = T_STRING;}\n    else {throw invalid_argument(\"Unknown service call \"+callName);}\n\n    for (size_t ix = 0; ix < clientCount; ix++) {\n\n      shared_ptr<TSocket> socket(new TSocket(\"127.0.0.1\", port));\n      shared_ptr<TBufferedTransport> bufferedSocket(new TBufferedTransport(socket, 2048));\n      shared_ptr<TProtocol> protocol(new TBinaryProtocol(bufferedSocket));\n      shared_ptr<ServiceClient> serviceClient(new ServiceClient(protocol));\n\n      clientThreads.insert(threadFactory->newThread(shared_ptr<ClientThread>(new ClientThread(socket, serviceClient, monitor, threadCount, loopCount, loopType))));\n    }\n\n    for (std::set<shared_ptr<Thread> >::const_iterator thread = clientThreads.begin(); thread != clientThreads.end(); thread++) {\n      (*thread)->start();\n    }\n\n    long long time00;\n    long long time01;\n\n    {Synchronized s(monitor);\n      threadCount = clientCount;\n\n      cerr << \"Launch \"<< clientCount << \" client threads\" << endl;\n\n      time00 =  Util::currentTime();\n\n      monitor.notifyAll();\n\n      while(threadCount > 0) {\n        monitor.wait();\n      }\n\n      time01 =  Util::currentTime();\n    }\n\n    long long firstTime = 9223372036854775807LL;\n    long long lastTime = 0;\n\n    double averageTime = 0;\n    long long minTime = 9223372036854775807LL;\n    long long maxTime = 0;\n\n    for (set<shared_ptr<Thread> >::iterator ix = clientThreads.begin(); ix != clientThreads.end(); ix++) {\n\n      shared_ptr<ClientThread> client = dynamic_pointer_cast<ClientThread>((*ix)->runnable());\n\n      long long delta = client->_endTime - client->_startTime;\n\n      assert(delta > 0);\n\n      if (client->_startTime < firstTime) {\n        firstTime = client->_startTime;\n      }\n\n      if (client->_endTime > lastTime) {\n        lastTime = client->_endTime;\n      }\n\n      if (delta < minTime) {\n        minTime = delta;\n      }\n\n      if (delta > maxTime) {\n        maxTime = delta;\n      }\n\n      averageTime+= delta;\n    }\n\n    averageTime \/= clientCount;\n\n\n    cout <<  \"workers :\" << workerCount << \", client : \" << clientCount << \", loops : \" << loopCount << \", rate : \" << (clientCount * loopCount * 1000) \/ ((double)(time01 - time00)) << endl;\n\n    count_map count = serviceHandler->getCount();\n    count_map::iterator iter;\n    for (iter = count.begin(); iter != count.end(); ++iter) {\n      printf(\"%s => %d\\n\", iter->first, iter->second);\n    }\n    cerr << \"done.\" << endl;\n  }\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *\n * Copyright (C) 2001  Frank Dabek (fdabek@lcs.mit.edu), \n *                     Frans Kaashoek (kaashoek@lcs.mit.edu),\n *   \t\t       Massachusetts Institute of Technology\n * \n *\n *  Permission is hereby granted, free of charge, to any person obtaining\n *  a copy of this software and associated documentation files (the\n *  \"Software\"), to deal in the Software without restriction, including\n *  without limitation the rights to use, copy, modify, merge, publish,\n *  distribute, sublicense, and\/or sell copies of the Software, and to\n *  permit persons to whom the Software is furnished to do so, subject to\n *  the following conditions:\n *\n *  The above copyright notice and this permission notice shall be\n *  included in all copies or substantial portions of the Software.\n *\n *  THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE\n *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\n *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION\n *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n *\n *\/\n\n#include \"dhash_common.h\"\n#include \"dhashclient.h\"\n#include \"verify.h\"\n#include <chord_types.h>\n#include \"sfsmisc.h\"\n#include \"arpc.h\"\n#include <sfscrypt.h>\n#ifdef DMALLOC\n#include \"dmalloc.h\"\n#endif\n\n\/*\n * dhashclient\n *\/\n\ndhashclient::dhashclient(str sockname)\n{\n  int fd = unixsocket_connect(sockname);\n  if (fd < 0) {\n    fatal (\"dhashclient: Error connecting to %s: %s\\n\",\n\t   sockname.cstr (), strerror (errno));\n  }\n\n  gwclnt = aclnt::alloc\n    (axprt_unix::alloc (fd, 1024*1025), dhashgateway_program_1);\n}\n\ndhashclient::dhashclient (ptr<axprt_stream> xprt)\n{\n  gwclnt = aclnt::alloc (xprt, dhashgateway_program_1);\n}\n\n\n\/* \n * append block layout \n *\n * long contentlen\n * char data[contentlen]\n *\n * key = whatever you say\n *\/\nvoid\ndhashclient::append (chordID to, const char *buf, size_t buflen, \n\t\t     cbinsertgw_t cb)\n{\n  \/\/ stick on the [type,contentlen] the server will have to strip it\n  \/\/ off before appending\n  xdrsuio x;\n  int size = buflen + 3 & ~3;\n  char *m_buf;\n  if ((m_buf = (char *)XDR_INLINE (&x, size))) {\n    memcpy (m_buf, buf, buflen);\n    \n    int m_len = x.uio ()->resid ();\n    char *m_dat = suio_flatten (x.uio ());\n    insert_togateway (to, m_dat, m_len, cb, DHASH_APPEND, buflen, NULL);\n    xfree (m_dat);\n  } else {\n    (*cb) (DHASH_ERR, NULL); \/\/ marshalling failed.\n  }\n}\n\n\n\/*\n * nopk block layout\n *\n * long contentlen\n * char data[contentlen]\n *\n * key = provided by user or hash of data depending on type of insert\n *\/\nvoid\ndhashclient::insert (bigint key, const char *buf,\n                     size_t buflen, cbinsertgw_t cb,\n\t\t     ptr<option_block> options,\n\t\t     dhash_ctype t)\n{\n  assert (t == DHASH_CONTENTHASH || t == DHASH_NOAUTH);\n  xdrsuio x;\n  int size = buflen + 3 & ~3;\n  char *m_buf;\n  if ((m_buf = (char *)XDR_INLINE (&x, size))) {\n    memcpy (m_buf, buf, buflen);\n    \n    int m_len = x.uio ()->resid ();\n    char *m_dat = suio_flatten (x.uio ());\n    insert_togateway (key, m_dat, m_len, cb, t, buflen, options);\n    xfree (m_dat);\n  } else {\n    (*cb) (DHASH_ERR, NULL); \/\/ marshalling failed.\n  }\n}\n\nvoid\ndhashclient::insert (const char *buf, size_t buflen, cbinsertgw_t cb,\n                     ptr<option_block> options)\n{\n  bigint key = compute_hash (buf, buflen);\n  insert (key, buf, buflen, cb, options, DHASH_CONTENTHASH);\n}\n\n\/* \n * keyhash block convention:\n * \n * sfs_pubkey2 pub_key\n * sfs_sig2 sig (taken over salt, version (in NBO), payload)\n * long payload_len\n * signed payload (see struct keyhash_payload)\n *   long version\n *   salt_t salt\n *   char block_data[payload_len-sizeof(salt_t)-sizeof(long)]\n *\/\nvoid\ndhashclient::insert (bigint hash, sfs_pubkey2 key, sfs_sig2 sig,\n                     keyhash_payload& p,\n\t\t     cbinsertgw_t cb, ptr<option_block> options)\n{\n  xdrsuio x;\n  long plen = p.payload_len ();\n  \n  if (!xdr_sfs_pubkey2 (&x, &key) ||\n      !xdr_sfs_sig2 (&x, &sig) ||\n      !XDR_PUTLONG (&x, &plen) || \n      p.encode(x)) {\n    vec<chordID> r;\n    ptr<insert_info> i = New refcounted<insert_info>(hash, r);\n    cb (DHASH_ERR, i); \/\/ marshalling failed.\n    return;\n  }\n\n  int m_len = x.uio ()->resid ();\n  char *m_dat = suio_flatten (x.uio ());\n  insert_togateway (hash, m_dat, m_len, cb, DHASH_KEYHASH, \n                    x.uio()->resid(), options);\n  xfree (m_dat);\n}\n\n\n\/*\n * generic insert (called by above methods)\n *\/\nvoid\ndhashclient::insert_togateway (bigint key, const char *buf, \n                               size_t buflen, cbinsertgw_t cb,\n                               dhash_ctype t, size_t realsize,\n                               ptr<option_block> options)\n{\n  dhash_insert_arg arg;\n  arg.blockID = key;\n  arg.ctype = t;\n  arg.len = realsize;\n  arg.block.setsize (buflen);\n  memcpy (arg.block.base (), buf, buflen);\n  arg.options = 0;\n  if (options) {\n    arg.options = options->flags;\n    if (options->flags & DHASHCLIENT_GUESS_SUPPLIED) {\n      arg.guess = options->guess;\n      warn << \"starting with guess: \" << arg.guess << \"\\n\";\n    }\n  }\n\n  ptr<dhash_insert_res> res = New refcounted<dhash_insert_res> ();\n  gwclnt->call (DHASHPROC_INSERT, &arg, res, \n\t\twrap (this, &dhashclient::insertcb, cb, key, res));\n}\n\nvoid\ndhashclient::insertcb (cbinsertgw_t cb, bigint key, \n\t\t       ptr<dhash_insert_res> res,\n\t\t       clnt_stat err)\n{\n  str errstr;\n  vec<chordID> r;\n  ptr<insert_info> i = New refcounted<insert_info>(key, r);\n  if (err) {\n    errstr = strbuf () << \"rpc error \" << err;\n    warn << \"dhashclient::insert failed (1): \" << key << \": \" << errstr << \"\\n\";\n    (*cb) (DHASH_RPCERR, i); \/\/RPC failure\n  } else {\n    \/\/warn << \"dhashclient::insertcb dhash stat \" << res->status << \"\\n\";\n    if (res->status != DHASH_OK) {\n      errstr = dhasherr2str (res->status);\n      warn << \"dhashclient::insert failed (2): \" << key << \": \" << errstr << \"\\n\";\n    }\n    else {\n      i->path.setsize (res->resok->path.size ());\n      for (unsigned int j = 0; j < res->resok->path.size (); j++)\n\ti->path[j] = res->resok->path[j];\n    }\n    (*cb) (res->status, i); \n  }\n}\n\n\/*\n * retrieve code\n *\/\nvoid\ndhashclient::retrieve (bigint key, cb_cret cb, ptr<option_block> options)\n{\n  retrieve(key, DHASH_CONTENTHASH, cb, options);\n}\n\nvoid\ndhashclient::retrieve (bigint key, dhash_ctype ct, cb_cret cb, \n\t\t       ptr<option_block> options)\n{\n  ref<dhash_retrieve_res> res = New refcounted<dhash_retrieve_res> (DHASH_OK);\n  dhash_retrieve_arg arg;\n  arg.blockID = key;\n  arg.ctype = ct;\n  arg.options = 0;\n  if (options) {\n    arg.options = options->flags;\n    if (options->flags & DHASHCLIENT_GUESS_SUPPLIED)\n      arg.guess = options->guess;\n  }\n\n  gwclnt->call (DHASHPROC_RETRIEVE, &arg, res, \n\t\twrap (this, &dhashclient::retrievecb, cb, key, res));\n}\n\nvoid\ndhashclient::retrievecb (cb_cret cb, bigint key, \n\t\t\t ref<dhash_retrieve_res> res, \n\t\t\t clnt_stat err)\n{\n  str errstr;\n  bool verify_failed = false;\n  if (err)\n    errstr = strbuf () << \"rpc error \" << err;\n  else if (res->status != DHASH_OK)\n    errstr = dhasherr2str (res->status);\n  else {\n    if (!verify (key, res->resok->ctype, res->resok->block.base (), \n\t\t      res->resok->len)) {\n      errstr = strbuf () << \"data did not verify. len: \" << res->resok->len\n\t                 << \" ctype \" << res->resok->ctype;\n      verify_failed = true;\n    } else {\n      \/\/ success\n      ptr<dhash_block> blk = get_block_contents (res->resok->block.base(), \n\t\t\t\t\t\t res->resok->block.size(), \n\t\t\t\t\t\t res->resok->ctype);\n      vec<chordID> path;\n      for (u_int i = 0; i < res->resok->path.size (); i++)\n\tpath.push_back (res->resok->path[i]);\n  \n      if (!blk) {\n        (*cb) (DHASH_RETRIEVE_NOVERIFY, NULL, path);\n        return;\n      }\n\n      blk->hops = res->resok->hops;\n      blk->errors = res->resok->errors;\n      blk->retries = res->resok->retries;\n      for (u_int i = 0; i < res->resok->times.size (); i++)\n\tblk->times.push_back (res->resok->times[i]);\n      \n      (*cb) (DHASH_OK, blk, path);\n      return;\n    } \n  }\n\n  warn << \"dhashclient::retrieve failed: \" << key << \": \" << errstr << \"\\n\";\n  vec<chordID> e_path;\n  \/\/ failure\n  (*cb) (verify_failed ? DHASH_RETRIEVE_NOVERIFY : res->status, NULL, e_path); \n}\n\n<commit_msg>Report RPC errors as errors, not DHASH_OK.<commit_after>\/*\n *\n * Copyright (C) 2001  Frank Dabek (fdabek@lcs.mit.edu), \n *                     Frans Kaashoek (kaashoek@lcs.mit.edu),\n *   \t\t       Massachusetts Institute of Technology\n * \n *\n *  Permission is hereby granted, free of charge, to any person obtaining\n *  a copy of this software and associated documentation files (the\n *  \"Software\"), to deal in the Software without restriction, including\n *  without limitation the rights to use, copy, modify, merge, publish,\n *  distribute, sublicense, and\/or sell copies of the Software, and to\n *  permit persons to whom the Software is furnished to do so, subject to\n *  the following conditions:\n *\n *  The above copyright notice and this permission notice shall be\n *  included in all copies or substantial portions of the Software.\n *\n *  THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE\n *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\n *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION\n *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n *\n *\/\n\n#include \"dhash_common.h\"\n#include \"dhashclient.h\"\n#include \"verify.h\"\n#include <chord_types.h>\n#include \"sfsmisc.h\"\n#include \"arpc.h\"\n#include <sfscrypt.h>\n#ifdef DMALLOC\n#include \"dmalloc.h\"\n#endif\n\n\/*\n * dhashclient\n *\/\n\ndhashclient::dhashclient(str sockname)\n{\n  int fd = unixsocket_connect(sockname);\n  if (fd < 0) {\n    fatal (\"dhashclient: Error connecting to %s: %s\\n\",\n\t   sockname.cstr (), strerror (errno));\n  }\n\n  gwclnt = aclnt::alloc\n    (axprt_unix::alloc (fd, 1024*1025), dhashgateway_program_1);\n}\n\ndhashclient::dhashclient (ptr<axprt_stream> xprt)\n{\n  gwclnt = aclnt::alloc (xprt, dhashgateway_program_1);\n}\n\n\n\/* \n * append block layout \n *\n * long contentlen\n * char data[contentlen]\n *\n * key = whatever you say\n *\/\nvoid\ndhashclient::append (chordID to, const char *buf, size_t buflen, \n\t\t     cbinsertgw_t cb)\n{\n  \/\/ stick on the [type,contentlen] the server will have to strip it\n  \/\/ off before appending\n  xdrsuio x;\n  int size = buflen + 3 & ~3;\n  char *m_buf;\n  if ((m_buf = (char *)XDR_INLINE (&x, size))) {\n    memcpy (m_buf, buf, buflen);\n    \n    int m_len = x.uio ()->resid ();\n    char *m_dat = suio_flatten (x.uio ());\n    insert_togateway (to, m_dat, m_len, cb, DHASH_APPEND, buflen, NULL);\n    xfree (m_dat);\n  } else {\n    (*cb) (DHASH_ERR, NULL); \/\/ marshalling failed.\n  }\n}\n\n\n\/*\n * nopk block layout\n *\n * long contentlen\n * char data[contentlen]\n *\n * key = provided by user or hash of data depending on type of insert\n *\/\nvoid\ndhashclient::insert (bigint key, const char *buf,\n                     size_t buflen, cbinsertgw_t cb,\n\t\t     ptr<option_block> options,\n\t\t     dhash_ctype t)\n{\n  assert (t == DHASH_CONTENTHASH || t == DHASH_NOAUTH);\n  xdrsuio x;\n  int size = buflen + 3 & ~3;\n  char *m_buf;\n  if ((m_buf = (char *)XDR_INLINE (&x, size))) {\n    memcpy (m_buf, buf, buflen);\n    \n    int m_len = x.uio ()->resid ();\n    char *m_dat = suio_flatten (x.uio ());\n    insert_togateway (key, m_dat, m_len, cb, t, buflen, options);\n    xfree (m_dat);\n  } else {\n    (*cb) (DHASH_ERR, NULL); \/\/ marshalling failed.\n  }\n}\n\nvoid\ndhashclient::insert (const char *buf, size_t buflen, cbinsertgw_t cb,\n                     ptr<option_block> options)\n{\n  bigint key = compute_hash (buf, buflen);\n  insert (key, buf, buflen, cb, options, DHASH_CONTENTHASH);\n}\n\n\/* \n * keyhash block convention:\n * \n * sfs_pubkey2 pub_key\n * sfs_sig2 sig (taken over salt, version (in NBO), payload)\n * long payload_len\n * signed payload (see struct keyhash_payload)\n *   long version\n *   salt_t salt\n *   char block_data[payload_len-sizeof(salt_t)-sizeof(long)]\n *\/\nvoid\ndhashclient::insert (bigint hash, sfs_pubkey2 key, sfs_sig2 sig,\n                     keyhash_payload& p,\n\t\t     cbinsertgw_t cb, ptr<option_block> options)\n{\n  xdrsuio x;\n  long plen = p.payload_len ();\n  \n  if (!xdr_sfs_pubkey2 (&x, &key) ||\n      !xdr_sfs_sig2 (&x, &sig) ||\n      !XDR_PUTLONG (&x, &plen) || \n      p.encode(x)) {\n    vec<chordID> r;\n    ptr<insert_info> i = New refcounted<insert_info>(hash, r);\n    cb (DHASH_ERR, i); \/\/ marshalling failed.\n    return;\n  }\n\n  int m_len = x.uio ()->resid ();\n  char *m_dat = suio_flatten (x.uio ());\n  insert_togateway (hash, m_dat, m_len, cb, DHASH_KEYHASH, \n                    x.uio()->resid(), options);\n  xfree (m_dat);\n}\n\n\n\/*\n * generic insert (called by above methods)\n *\/\nvoid\ndhashclient::insert_togateway (bigint key, const char *buf, \n                               size_t buflen, cbinsertgw_t cb,\n                               dhash_ctype t, size_t realsize,\n                               ptr<option_block> options)\n{\n  dhash_insert_arg arg;\n  arg.blockID = key;\n  arg.ctype = t;\n  arg.len = realsize;\n  arg.block.setsize (buflen);\n  memcpy (arg.block.base (), buf, buflen);\n  arg.options = 0;\n  if (options) {\n    arg.options = options->flags;\n    if (options->flags & DHASHCLIENT_GUESS_SUPPLIED) {\n      arg.guess = options->guess;\n      warn << \"starting with guess: \" << arg.guess << \"\\n\";\n    }\n  }\n\n  ptr<dhash_insert_res> res = New refcounted<dhash_insert_res> ();\n  gwclnt->call (DHASHPROC_INSERT, &arg, res, \n\t\twrap (this, &dhashclient::insertcb, cb, key, res));\n}\n\nvoid\ndhashclient::insertcb (cbinsertgw_t cb, bigint key, \n\t\t       ptr<dhash_insert_res> res,\n\t\t       clnt_stat err)\n{\n  str errstr;\n  vec<chordID> r;\n  ptr<insert_info> i = New refcounted<insert_info>(key, r);\n  if (err) {\n    errstr = strbuf () << \"rpc error \" << err;\n    warn << \"dhashclient::insert failed (1): \" << key << \": \" << errstr << \"\\n\";\n    (*cb) (DHASH_RPCERR, i); \/\/RPC failure\n  } else {\n    \/\/warn << \"dhashclient::insertcb dhash stat \" << res->status << \"\\n\";\n    if (res->status != DHASH_OK) {\n      errstr = dhasherr2str (res->status);\n      warn << \"dhashclient::insert failed (2): \" << key << \": \" << errstr << \"\\n\";\n    }\n    else {\n      i->path.setsize (res->resok->path.size ());\n      for (unsigned int j = 0; j < res->resok->path.size (); j++)\n\ti->path[j] = res->resok->path[j];\n    }\n    (*cb) (res->status, i); \n  }\n}\n\n\/*\n * retrieve code\n *\/\nvoid\ndhashclient::retrieve (bigint key, cb_cret cb, ptr<option_block> options)\n{\n  retrieve(key, DHASH_CONTENTHASH, cb, options);\n}\n\nvoid\ndhashclient::retrieve (bigint key, dhash_ctype ct, cb_cret cb, \n\t\t       ptr<option_block> options)\n{\n  ref<dhash_retrieve_res> res = New refcounted<dhash_retrieve_res> (DHASH_OK);\n  dhash_retrieve_arg arg;\n  arg.blockID = key;\n  arg.ctype = ct;\n  arg.options = 0;\n  if (options) {\n    arg.options = options->flags;\n    if (options->flags & DHASHCLIENT_GUESS_SUPPLIED)\n      arg.guess = options->guess;\n  }\n\n  gwclnt->call (DHASHPROC_RETRIEVE, &arg, res, \n\t\twrap (this, &dhashclient::retrievecb, cb, key, res));\n}\n\nvoid\ndhashclient::retrievecb (cb_cret cb, bigint key, \n\t\t\t ref<dhash_retrieve_res> res, \n\t\t\t clnt_stat err)\n{\n  str errstr;\n  dhash_stat ret (res->status);\n  if (err) {\n    errstr = strbuf () << \"rpc error \" << err;\n    ret    = DHASH_RPCERR;\n  }\n  else if (res->status != DHASH_OK)\n    errstr = dhasherr2str (res->status);\n  else {\n    if (!verify (key, res->resok->ctype, res->resok->block.base (), \n\t\t      res->resok->len)) {\n      errstr = strbuf () << \"data did not verify. len: \" << res->resok->len\n\t                 << \" ctype \" << res->resok->ctype;\n      ret = DHASH_RETRIEVE_NOVERIFY;\n    } else {\n      \/\/ success\n      ptr<dhash_block> blk = get_block_contents (res->resok->block.base(), \n\t\t\t\t\t\t res->resok->block.size(), \n\t\t\t\t\t\t res->resok->ctype);\n      vec<chordID> path;\n      for (u_int i = 0; i < res->resok->path.size (); i++)\n\tpath.push_back (res->resok->path[i]);\n  \n      if (!blk) {\n        (*cb) (DHASH_RETRIEVE_NOVERIFY, NULL, path);\n        return;\n      }\n\n      blk->hops = res->resok->hops;\n      blk->errors = res->resok->errors;\n      blk->retries = res->resok->retries;\n      for (u_int i = 0; i < res->resok->times.size (); i++)\n\tblk->times.push_back (res->resok->times[i]);\n      \n      (*cb) (DHASH_OK, blk, path);\n      return;\n    } \n  }\n\n  warn << \"dhashclient::retrieve failed: \" << key << \": \" << errstr << \"\\n\";\n  vec<chordID> e_path;\n  (*cb) (ret, NULL, e_path); \n}\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#if !defined(XALANDEFAULTPARSEDSOURCE_HEADER_GUARD)\n#define XALANDEFAULTPARSEDSOURCE_HEADER_GUARD\n\n\n\n\/\/ Base include file.  Must be first.\n#include <XalanTransformer\/XalanTransformerDefinitions.hpp>\n\n\n\n#include <XalanSourceTree\/XalanSourceTreeParserLiaison.hpp>\n#include <XalanSourceTree\/XalanSourceTreeDOMSupport.hpp>\n\n\n\n#include <XSLT\/XSLTInputSource.hpp>\n\n\n\n#include <XalanTransformer\/XalanParsedSource.hpp>\n\n\n\nclass EntityResolver;\nclass ErrorHandler;\nclass XalanSourceTreeDocument;\n\n\n\nclass XalanDefaultParsedSourceDOMSupport : public XalanSourceTreeDOMSupport\n{\npublic:\n\n\tXalanDefaultParsedSourceDOMSupport(const XalanSourceTreeDOMSupport&\t\ttheDOMSupport);\n\n\tvirtual\n\t~XalanDefaultParsedSourceDOMSupport();\n\n\tvirtual void\n\treset();\n\n\t\/\/ These interfaces are inherited from DOMSupport...\n\n\tvirtual const XalanDOMString*\n\tgetNamespaceForPrefix(\n\t\t\tconst XalanDOMString&\tprefix, \n\t\t\tconst XalanElement&\t\tnamespaceContext) const;\n\n\tvirtual const XalanDOMString&\n\tgetUnparsedEntityURI(\n\t\t\tconst XalanDOMString&\ttheName,\n\t\t\tconst XalanDocument&\ttheDocument) const;\n\n\tvirtual bool\n\tisNodeAfter(\n\t\t\tconst XalanNode&\tnode1,\n\t\t\tconst XalanNode&\tnode2) const;\n\nprivate:\n\n\tconst XalanSourceTreeDOMSupport&\tm_domSupport;\n};\n\n\n\nclass XALAN_TRANSFORMER_EXPORT XalanDefaultParsedSourceHelper : public XalanParsedSourceHelper\n{\npublic:\n\n\tXalanDefaultParsedSourceHelper(\n\t\t\tconst XalanSourceTreeDOMSupport&\t\ttheSourceDOMSupport,\n\t\t\tconst XalanSourceTreeParserLiaison&\t\ttheSourceParserLiaison);\n\n\tvirtual DOMSupport&\n\tgetDOMSupport();\n\n\tvirtual XMLParserLiaison&\n\tgetParserLiaison();\n\nprivate:\n\n\t\/\/ Not implemented...\n\tXalanDefaultParsedSourceHelper(const XalanDefaultParsedSourceHelper&);\n\n\tXalanDefaultParsedSourceHelper&\n\toperator=(const XalanDefaultParsedSourceHelper&);\n\n\t\/\/ Data members...\n\tXalanDefaultParsedSourceDOMSupport\tm_domSupport;\n\n\tXalanSourceTreeParserLiaison\t\tm_parserLiaison;\n};\n\n\n\n\/**\n * This is designed to allow a XalanTranfomer object to reuse a parsed\n * document. \n *\/\nclass XALAN_TRANSFORMER_EXPORT XalanDefaultParsedSource : public XalanParsedSource\n{\npublic:\n\n\tXalanDefaultParsedSource(\n\t\t\tconst XSLTInputSource&\ttheInputSource,\n\t\t\tbool\t\t\t\t\tfValidate = false,\n\t\t\tErrorHandler*\t\t\ttheErrorHandler = 0,\n\t\t\tEntityResolver*\t\t\ttheEntityResolver = 0);\n\n\tvirtual\n\t~XalanDefaultParsedSource();\n\n\tvirtual XalanDocument*\n\tgetDocument() const;\n\n\tvirtual XalanParsedSourceHelper*\n\tcreateHelper() const;\n\n\tvirtual const XalanDOMString&\n\tgetURI() const;\n\nprivate:\n\n\t\/\/ Not implemented...\n\tXalanDefaultParsedSource(const XalanDefaultParsedSource&);\n\n\tXalanDefaultParsedSource&\n\toperator=(const XalanDefaultParsedSource&);\n\n\n\t\/\/ Data members...\n\tXalanSourceTreeDOMSupport\t\tm_domSupport;\n\n\tXalanSourceTreeParserLiaison\tm_parserLiaison;\n\n\tXalanSourceTreeDocument*\t\tm_parsedSource;\n\n\tXalanDOMString\t\t\t\t\tm_uri;\n};\n\n\n\n#endif\t\/\/ XALANDEFAULTPARSEDSOURCE_HEADER_GUARD\n\n\n\n<commit_msg>Added private declarations for non-implemented functions.<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#if !defined(XALANDEFAULTPARSEDSOURCE_HEADER_GUARD)\n#define XALANDEFAULTPARSEDSOURCE_HEADER_GUARD\n\n\n\n\/\/ Base include file.  Must be first.\n#include <XalanTransformer\/XalanTransformerDefinitions.hpp>\n\n\n\n#include <XalanSourceTree\/XalanSourceTreeParserLiaison.hpp>\n#include <XalanSourceTree\/XalanSourceTreeDOMSupport.hpp>\n\n\n\n#include <XSLT\/XSLTInputSource.hpp>\n\n\n\n#include <XalanTransformer\/XalanParsedSource.hpp>\n\n\n\nclass EntityResolver;\nclass ErrorHandler;\nclass XalanSourceTreeDocument;\n\n\n\nclass XalanDefaultParsedSourceDOMSupport : public XalanSourceTreeDOMSupport\n{\npublic:\n\n\tXalanDefaultParsedSourceDOMSupport(const XalanSourceTreeDOMSupport&\t\ttheDOMSupport);\n\n\tvirtual\n\t~XalanDefaultParsedSourceDOMSupport();\n\n\tvirtual void\n\treset();\n\n\t\/\/ These interfaces are inherited from DOMSupport...\n\n\tvirtual const XalanDOMString*\n\tgetNamespaceForPrefix(\n\t\t\tconst XalanDOMString&\tprefix, \n\t\t\tconst XalanElement&\t\tnamespaceContext) const;\n\n\tvirtual const XalanDOMString&\n\tgetUnparsedEntityURI(\n\t\t\tconst XalanDOMString&\ttheName,\n\t\t\tconst XalanDocument&\ttheDocument) const;\n\n\tvirtual bool\n\tisNodeAfter(\n\t\t\tconst XalanNode&\tnode1,\n\t\t\tconst XalanNode&\tnode2) const;\n\nprivate:\n\n\tconst XalanSourceTreeDOMSupport&\tm_domSupport;\n};\n\n\n\nclass XALAN_TRANSFORMER_EXPORT XalanDefaultParsedSourceHelper : public XalanParsedSourceHelper\n{\npublic:\n\n\tXalanDefaultParsedSourceHelper(\n\t\t\tconst XalanSourceTreeDOMSupport&\t\ttheSourceDOMSupport,\n\t\t\tconst XalanSourceTreeParserLiaison&\t\ttheSourceParserLiaison);\n\n\tvirtual DOMSupport&\n\tgetDOMSupport();\n\n\tvirtual XMLParserLiaison&\n\tgetParserLiaison();\n\nprivate:\n\n\t\/\/ Not implemented...\n\tXalanDefaultParsedSourceHelper(const XalanDefaultParsedSourceHelper&);\n\n\tXalanDefaultParsedSourceHelper&\n\toperator=(const XalanDefaultParsedSourceHelper&);\n\n\n\t\/\/ Data members...\n\tXalanDefaultParsedSourceDOMSupport\tm_domSupport;\n\n\tXalanSourceTreeParserLiaison\t\tm_parserLiaison;\n};\n\n\n\n\/**\n * This is designed to allow a XalanTranfomer object to reuse a parsed\n * document. \n *\/\nclass XALAN_TRANSFORMER_EXPORT XalanDefaultParsedSource : public XalanParsedSource\n{\npublic:\n\n\tXalanDefaultParsedSource(\n\t\t\tconst XSLTInputSource&\ttheInputSource,\n\t\t\tbool\t\t\t\t\tfValidate = false,\n\t\t\tErrorHandler*\t\t\ttheErrorHandler = 0,\n\t\t\tEntityResolver*\t\t\ttheEntityResolver = 0);\n\n\tvirtual\n\t~XalanDefaultParsedSource();\n\n\tvirtual XalanDocument*\n\tgetDocument() const;\n\n\tvirtual XalanParsedSourceHelper*\n\tcreateHelper() const;\n\n\tvirtual const XalanDOMString&\n\tgetURI() const;\n\nprivate:\n\n\t\/\/ Not implemented...\n\tXalanDefaultParsedSource(const XalanDefaultParsedSource&);\n\n\tXalanDefaultParsedSource&\n\toperator=(const XalanDefaultParsedSource&);\n\n\n\t\/\/ Data members...\n\tXalanSourceTreeDOMSupport\t\tm_domSupport;\n\n\tXalanSourceTreeParserLiaison\tm_parserLiaison;\n\n\tXalanSourceTreeDocument*\t\tm_parsedSource;\n\n\tXalanDOMString\t\t\t\t\tm_uri;\n};\n\n\n\n#endif\t\/\/ XALANDEFAULTPARSEDSOURCE_HEADER_GUARD\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"leibniz_graph.hpp\"\n#include \"util\/cartesian_product.hpp\"\n#include <sstream>\n#include <tuple>\n\nLeibnizGraph::LeibnizGraph(KontsevichGraph graph, std::vector<KontsevichGraph::VertexPair> jacobiators, bool skew)\n: KontsevichGraph(graph), d_jacobiators(jacobiators), d_skew(skew)\n{\n    std::map<KontsevichGraph::Vertex, size_t> which_jacobiator;\n    for (size_t j = 0; j != d_jacobiators.size(); ++j)\n    {\n        which_jacobiator[d_jacobiators[j].first]  = j;\n        which_jacobiator[d_jacobiators[j].second] = j;\n    }\n\n    \/\/ Start building the sets of references to Leibniz targets (incoming edges on Jacobiator vertices)\n    std::map<size_t, size_t> jac_indegree;\n    for (KontsevichGraph::VertexPair& target_pair : d_targets)\n    {\n        auto it1 = which_jacobiator.find(target_pair.first);\n        if (it1 != which_jacobiator.end())\n        {\n            d_leibniz_targets[&target_pair.first] = it1->second;\n            ++jac_indegree[it1->second];\n        }\n        auto it2 = which_jacobiator.find(target_pair.second);\n        if (it2 != which_jacobiator.end())\n        {\n            d_leibniz_targets[&target_pair.second] = it2->second;\n            ++jac_indegree[it2->second];\n        }\n    }\n    d_max_jac_indegree = 0;\n    for (auto indegree : jac_indegree)\n        if (indegree.second - 1 > d_max_jac_indegree)\n            d_max_jac_indegree = indegree.second - 1;\n\n    \/\/ Build the sets of three Jacobiator targets each\n    d_jacobiator_targets.resize(jacobiators.size());\n    d_max_jac_indegree = 0;\n    size_t j = 0;\n    for (KontsevichGraph::VertexPair& jacobiator : d_jacobiators)\n    {\n        KontsevichGraph::Vertex v = jacobiator.first;\n        KontsevichGraph::Vertex w = jacobiator.second;\n        KontsevichGraph::VertexPair& target_pair_v = d_targets[(size_t)v - d_external];\n        KontsevichGraph::VertexPair& target_pair_w = d_targets[(size_t)w - d_external];\n        KontsevichGraph::Vertex* a = &target_pair_v.first;\n        KontsevichGraph::Vertex* b = &target_pair_v.second;\n        KontsevichGraph::Vertex* c = (target_pair_w.first == v) ? &target_pair_w.second : &target_pair_w.first;\n        \/\/ Remove internal Jacobiator edge from Leibniz targets\n        d_leibniz_targets.erase(target_pair_w.first == v ? &target_pair_w.first : &target_pair_w.second);\n        \/\/ Set Jacobiator targets\n        d_jacobiator_targets[j++] = { a, b, c };\n    }\n}\n\nbool LeibnizGraph::operator<(const LeibnizGraph& rhs) const\n{\n    return std::tie(this->d_skew, this->d_external, this->d_internal, this->d_targets, this->d_jacobiators, this->d_sign) < \\\n           std::tie(rhs.d_skew, rhs.d_external, rhs.d_internal, rhs.d_targets, rhs.d_jacobiators, rhs.d_sign);\n}\n\nsize_t LeibnizGraph::max_jac_indegree() const\n{\n    return d_max_jac_indegree;\n}\n\nstd::string LeibnizGraph::encoding() const\n{\n    std::stringstream ss;\n    ss << this->d_jacobiators.size();\n    ss << \"   \";\n    ss << KontsevichGraph::encoding();\n    ss << \"   \";\n    for (KontsevichGraph::VertexPair jacobiator : this->d_jacobiators)\n        ss << jacobiator.first << \" \" << jacobiator.second;\n    return ss.str();\n}\n\nstd::istream& operator>>(std::istream& is, LeibnizGraph& g)\n{\n    size_t jacobiators;\n    is >> jacobiators;\n    is >> (KontsevichGraph&)g;\n    g.d_jacobiators.clear();\n    std::pair<size_t, size_t> jacobiator;\n    size_t jacobiator_count = 0;\n    while (jacobiator_count++ < jacobiators && is >> jacobiator.first >> jacobiator.second)\n        g.d_jacobiators.push_back(jacobiator);\n    return is;\n}\n\ntemplate<class T>\nstd::map<LeibnizGraph, T> LeibnizGraph::map_from_istream(std::istream& is, std::function<T(std::string)> const& parser)\n{\n    std::map<LeibnizGraph, T> result;\n    if (parser == nullptr)\n        return result;\n    for (std::string line; getline(is, line);)\n    {\n        if (line.length() == 0 || line[0] == '#') \/\/ also skip comments\n            continue;\n        std::stringstream ss(line);\n        LeibnizGraph g;\n        ss >> g;\n        std::string coefficient_str;\n        ss >> coefficient_str;\n        T coefficient = parser(coefficient_str);\n        result[g] = coefficient;\n    }\n    return result;\n}\n\nstd::set<LeibnizGraph> LeibnizGraph::those_yielding_kontsevich_graph(KontsevichGraph& graph, bool skew_leibniz)\n{\n    \/\/ TODO: multiple Jacobiators\n    std::set<LeibnizGraph> leibniz_graphs;\n    size_t external = graph.external();\n    std::vector<KontsevichGraph::VertexPair> targets = graph.targets();\n    for (KontsevichGraph::Vertex v : graph.internal_vertices())\n    {\n        for (KontsevichGraph::Vertex w : graph.neighbors_in(v))\n        {\n            KontsevichGraph::VertexPair& target_pair_v = targets[(size_t)v - external];\n            \/\/ Check that there is no loop between v and w\n            if (target_pair_v.first == w || target_pair_v.second == w)\n                continue;\n            KontsevichGraph::VertexPair& target_pair_w = targets[(size_t)w - external];\n            \/\/ Check that the \"Jacobiator\" consisting of v and w falls on 3 distinct targets\n            KontsevichGraph::Vertex& a = target_pair_v.first;\n            KontsevichGraph::Vertex& b = target_pair_v.second;\n            KontsevichGraph::Vertex& c = (target_pair_w.first == v) ? target_pair_w.second : target_pair_w.first;\n            if (c == a || c == b)\n                continue;\n            leibniz_graphs.insert(LeibnizGraph(graph, { { v, w } }, skew_leibniz));\n        }\n    }\n    return leibniz_graphs;\n}\n\nvoid LeibnizGraph::normalize()\n{\n    \/\/ Normal form of Leibniz graph (three permutations of each Jacobiator, take minimal encoding, remember where Jacobiators are)\n\n    \/\/ TODO: remember sign?\n    \/\/ TODO: save partial expansion?\n    \/\/ TODO: construct LeibnizGraph (call the constructor) only once; let the intermediates be tuples or something\n\n    \/\/ Set Leibniz targets to \"bottom\" vertex in Jacobiator, i.e. v in { v, w } (the Jacobiator edge is v <-- w)\n    for (auto& leibniz_target : d_leibniz_targets)\n        *leibniz_target.first = d_jacobiators[leibniz_target.second].first;\n\n    \/\/ Fix some ordering of Jacobiator arguments (as a vector, instead of a set)\n    std::vector< std::vector<KontsevichGraph::Vertex> > jacobiator_arguments(d_jacobiators.size());\n    for (size_t j = 0; j != d_jacobiators.size(); ++j)\n    {\n        jacobiator_arguments[j].resize(3);\n        size_t k = 0;\n        for (auto it = d_jacobiator_targets[j].begin(); it != d_jacobiator_targets[j].end(); ++it)\n            jacobiator_arguments[j][k++] = **it;\n    }\n\n    std::vector<LeibnizGraph> leibniz_graphs;\n\n    std::vector<KontsevichGraph::Vertex> ground_vertices(d_external);\n    std::iota(ground_vertices.begin(), ground_vertices.end(), 0);\n    do\n    {\n        \/\/ Choose shifts (by 0, 1, or 2) in Jacobiator arguments\n        std::vector<size_t> shifts_max(d_jacobiators.size(), 3);\n        CartesianProduct all_shifts(shifts_max);\n\n        for (CartesianProduct shifts = all_shifts.begin(); shifts != all_shifts.end(); ++shifts)\n        {\n            \/\/ Set Jacobiator arguments\n            for (size_t j = 0; j != d_jacobiators.size(); ++j)\n            {\n                size_t k = 0;\n                for (auto it = d_jacobiator_targets[j].begin(); it != d_jacobiator_targets[j].end(); ++it)\n                    **it = jacobiator_arguments[j][(k++ + (*shifts)[j]) % 3];\n            }\n\n            \/\/ Permute ground vertices (if skew)\n            for (KontsevichGraph::VertexPair& target_pair : d_targets)\n            {\n                if ((size_t)target_pair.first < d_external)\n                    target_pair.first = ground_vertices[target_pair.first];\n                if ((size_t)target_pair.second < d_external)\n                    target_pair.second = ground_vertices[target_pair.second];\n            }\n\n            \/\/ Find permutation of vertex labels such that the list of targets is minimal with respect to the defined ordering\n            std::vector<KontsevichGraph::VertexPair> global_minimum = d_targets;\n\n            sort_pairs(global_minimum.begin(), global_minimum.end());\n\n            std::vector<KontsevichGraph::VertexPair> new_jacobiators = d_jacobiators;\n\n            std::vector<KontsevichGraph::Vertex> vertices(d_external + d_internal);\n            std::iota(vertices.begin(), vertices.end(), 0);\n\n            while (std::next_permutation(vertices.begin() + d_external, vertices.end()))\n            {\n                std::vector<KontsevichGraph::VertexPair> local_minimum = d_targets;\n                apply_permutation(d_internal, d_external, local_minimum, vertices);\n                if (local_minimum < global_minimum)\n                {\n                    global_minimum = local_minimum;\n                    \/\/ Find where Jacobiators are\n                    for (KontsevichGraph::VertexPair& new_jacobiator : new_jacobiators)\n                        new_jacobiator = { vertices[(size_t)new_jacobiator.first], vertices[(size_t)new_jacobiator.second] };\n                }\n            }\n            d_targets = global_minimum;\n\n            KontsevichGraph leibniz_graph(d_targets.size(), d_external, d_targets, 1, true);\n            leibniz_graphs.push_back(LeibnizGraph(leibniz_graph, new_jacobiators, d_skew));\n        }\n    } while (d_skew && std::next_permutation(ground_vertices.begin(), ground_vertices.end()));\n    LeibnizGraph leibniz_normal_form = *min_element(leibniz_graphs.begin(), leibniz_graphs.end());\n    std::swap(leibniz_normal_form, *this);\n}\n<commit_msg>Don't needlessly invalidate pointers in LeibnizGraph<commit_after>#include \"leibniz_graph.hpp\"\n#include \"util\/cartesian_product.hpp\"\n#include <sstream>\n#include <tuple>\n\nLeibnizGraph::LeibnizGraph(KontsevichGraph graph, std::vector<KontsevichGraph::VertexPair> jacobiators, bool skew)\n: KontsevichGraph(graph), d_jacobiators(jacobiators), d_skew(skew)\n{\n    std::map<KontsevichGraph::Vertex, size_t> which_jacobiator;\n    for (size_t j = 0; j != d_jacobiators.size(); ++j)\n    {\n        which_jacobiator[d_jacobiators[j].first]  = j;\n        which_jacobiator[d_jacobiators[j].second] = j;\n    }\n\n    \/\/ Start building the sets of references to Leibniz targets (incoming edges on Jacobiator vertices)\n    std::map<size_t, size_t> jac_indegree;\n    for (KontsevichGraph::VertexPair& target_pair : d_targets)\n    {\n        auto it1 = which_jacobiator.find(target_pair.first);\n        if (it1 != which_jacobiator.end())\n        {\n            d_leibniz_targets[&target_pair.first] = it1->second;\n            ++jac_indegree[it1->second];\n        }\n        auto it2 = which_jacobiator.find(target_pair.second);\n        if (it2 != which_jacobiator.end())\n        {\n            d_leibniz_targets[&target_pair.second] = it2->second;\n            ++jac_indegree[it2->second];\n        }\n    }\n    d_max_jac_indegree = 0;\n    for (auto indegree : jac_indegree)\n        if (indegree.second - 1 > d_max_jac_indegree)\n            d_max_jac_indegree = indegree.second - 1;\n\n    \/\/ Build the sets of three Jacobiator targets each\n    d_jacobiator_targets.resize(jacobiators.size());\n    d_max_jac_indegree = 0;\n    size_t j = 0;\n    for (KontsevichGraph::VertexPair& jacobiator : d_jacobiators)\n    {\n        KontsevichGraph::Vertex v = jacobiator.first;\n        KontsevichGraph::Vertex w = jacobiator.second;\n        KontsevichGraph::VertexPair& target_pair_v = d_targets[(size_t)v - d_external];\n        KontsevichGraph::VertexPair& target_pair_w = d_targets[(size_t)w - d_external];\n        KontsevichGraph::Vertex* a = &target_pair_v.first;\n        KontsevichGraph::Vertex* b = &target_pair_v.second;\n        KontsevichGraph::Vertex* c = (target_pair_w.first == v) ? &target_pair_w.second : &target_pair_w.first;\n        \/\/ Remove internal Jacobiator edge from Leibniz targets\n        d_leibniz_targets.erase(target_pair_w.first == v ? &target_pair_w.first : &target_pair_w.second);\n        \/\/ Set Jacobiator targets\n        d_jacobiator_targets[j++] = { a, b, c };\n    }\n}\n\nbool LeibnizGraph::operator<(const LeibnizGraph& rhs) const\n{\n    return std::tie(this->d_skew, this->d_external, this->d_internal, this->d_targets, this->d_jacobiators, this->d_sign) < \\\n           std::tie(rhs.d_skew, rhs.d_external, rhs.d_internal, rhs.d_targets, rhs.d_jacobiators, rhs.d_sign);\n}\n\nsize_t LeibnizGraph::max_jac_indegree() const\n{\n    return d_max_jac_indegree;\n}\n\nstd::string LeibnizGraph::encoding() const\n{\n    std::stringstream ss;\n    ss << this->d_jacobiators.size();\n    ss << \"   \";\n    ss << KontsevichGraph::encoding();\n    ss << \"   \";\n    for (KontsevichGraph::VertexPair jacobiator : this->d_jacobiators)\n        ss << jacobiator.first << \" \" << jacobiator.second;\n    return ss.str();\n}\n\nstd::istream& operator>>(std::istream& is, LeibnizGraph& g)\n{\n    size_t jacobiators;\n    is >> jacobiators;\n    is >> (KontsevichGraph&)g;\n    g.d_jacobiators.clear();\n    std::pair<size_t, size_t> jacobiator;\n    size_t jacobiator_count = 0;\n    while (jacobiator_count++ < jacobiators && is >> jacobiator.first >> jacobiator.second)\n        g.d_jacobiators.push_back(jacobiator);\n    return is;\n}\n\ntemplate<class T>\nstd::map<LeibnizGraph, T> LeibnizGraph::map_from_istream(std::istream& is, std::function<T(std::string)> const& parser)\n{\n    std::map<LeibnizGraph, T> result;\n    if (parser == nullptr)\n        return result;\n    for (std::string line; getline(is, line);)\n    {\n        if (line.length() == 0 || line[0] == '#') \/\/ also skip comments\n            continue;\n        std::stringstream ss(line);\n        LeibnizGraph g;\n        ss >> g;\n        std::string coefficient_str;\n        ss >> coefficient_str;\n        T coefficient = parser(coefficient_str);\n        result[g] = coefficient;\n    }\n    return result;\n}\n\nstd::set<LeibnizGraph> LeibnizGraph::those_yielding_kontsevich_graph(KontsevichGraph& graph, bool skew_leibniz)\n{\n    \/\/ TODO: multiple Jacobiators\n    std::set<LeibnizGraph> leibniz_graphs;\n    size_t external = graph.external();\n    std::vector<KontsevichGraph::VertexPair> targets = graph.targets();\n    for (KontsevichGraph::Vertex v : graph.internal_vertices())\n    {\n        for (KontsevichGraph::Vertex w : graph.neighbors_in(v))\n        {\n            KontsevichGraph::VertexPair& target_pair_v = targets[(size_t)v - external];\n            \/\/ Check that there is no loop between v and w\n            if (target_pair_v.first == w || target_pair_v.second == w)\n                continue;\n            KontsevichGraph::VertexPair& target_pair_w = targets[(size_t)w - external];\n            \/\/ Check that the \"Jacobiator\" consisting of v and w falls on 3 distinct targets\n            KontsevichGraph::Vertex& a = target_pair_v.first;\n            KontsevichGraph::Vertex& b = target_pair_v.second;\n            KontsevichGraph::Vertex& c = (target_pair_w.first == v) ? target_pair_w.second : target_pair_w.first;\n            if (c == a || c == b)\n                continue;\n            leibniz_graphs.insert(LeibnizGraph(graph, { { v, w } }, skew_leibniz));\n        }\n    }\n    return leibniz_graphs;\n}\n\nvoid LeibnizGraph::normalize()\n{\n    \/\/ Normal form of Leibniz graph (three permutations of each Jacobiator, take minimal encoding, remember where Jacobiators are)\n\n    \/\/ TODO: remember sign?\n    \/\/ TODO: save partial expansion?\n    \/\/ TODO: construct LeibnizGraph (call the constructor) only once; let the intermediates be tuples or something\n\n    \/\/ Set Leibniz targets to \"bottom\" vertex in Jacobiator, i.e. v in { v, w } (the Jacobiator edge is v <-- w)\n    for (auto& leibniz_target : d_leibniz_targets)\n        *leibniz_target.first = d_jacobiators[leibniz_target.second].first;\n\n    \/\/ Fix some ordering of Jacobiator arguments (as a vector, instead of a set)\n    std::vector< std::vector<KontsevichGraph::Vertex> > jacobiator_arguments(d_jacobiators.size());\n    for (size_t j = 0; j != d_jacobiators.size(); ++j)\n    {\n        jacobiator_arguments[j].resize(3);\n        size_t k = 0;\n        for (auto it = d_jacobiator_targets[j].begin(); it != d_jacobiator_targets[j].end(); ++it)\n            jacobiator_arguments[j][k++] = **it;\n    }\n\n    std::vector<LeibnizGraph> leibniz_graphs;\n\n    std::vector<KontsevichGraph::Vertex> ground_vertices(d_external);\n    std::iota(ground_vertices.begin(), ground_vertices.end(), 0);\n    do\n    {\n        \/\/ Choose shifts (by 0, 1, or 2) in Jacobiator arguments\n        std::vector<size_t> shifts_max(d_jacobiators.size(), 3);\n        CartesianProduct all_shifts(shifts_max);\n\n        for (CartesianProduct shifts = all_shifts.begin(); shifts != all_shifts.end(); ++shifts)\n        {\n            \/\/ Set Jacobiator arguments\n            for (size_t j = 0; j != d_jacobiators.size(); ++j)\n            {\n                size_t k = 0;\n                for (auto it = d_jacobiator_targets[j].begin(); it != d_jacobiator_targets[j].end(); ++it)\n                    **it = jacobiator_arguments[j][(k++ + (*shifts)[j]) % 3];\n            }\n\n            \/\/ Permute ground vertices (if skew)\n            for (KontsevichGraph::VertexPair& target_pair : d_targets)\n            {\n                if ((size_t)target_pair.first < d_external)\n                    target_pair.first = ground_vertices[target_pair.first];\n                if ((size_t)target_pair.second < d_external)\n                    target_pair.second = ground_vertices[target_pair.second];\n            }\n\n            \/\/ Find permutation of vertex labels such that the list of targets is minimal with respect to the defined ordering\n            std::vector<KontsevichGraph::VertexPair> global_minimum = d_targets;\n\n            sort_pairs(global_minimum.begin(), global_minimum.end());\n\n            std::vector<KontsevichGraph::VertexPair> new_jacobiators = d_jacobiators;\n\n            std::vector<KontsevichGraph::Vertex> vertices(d_external + d_internal);\n            std::iota(vertices.begin(), vertices.end(), 0);\n\n            while (std::next_permutation(vertices.begin() + d_external, vertices.end()))\n            {\n                std::vector<KontsevichGraph::VertexPair> local_minimum = d_targets;\n                apply_permutation(d_internal, d_external, local_minimum, vertices);\n                if (local_minimum < global_minimum)\n                {\n                    global_minimum = local_minimum;\n                    \/\/ Find where Jacobiators are\n                    for (KontsevichGraph::VertexPair& new_jacobiator : new_jacobiators)\n                        new_jacobiator = { vertices[(size_t)new_jacobiator.first], vertices[(size_t)new_jacobiator.second] };\n                }\n            }\n\n            KontsevichGraph leibniz_graph(d_internal, d_external, global_minimum, 1, true);\n            leibniz_graphs.push_back(LeibnizGraph(leibniz_graph, new_jacobiators, d_skew));\n        }\n    } while (d_skew && std::next_permutation(ground_vertices.begin(), ground_vertices.end()));\n    LeibnizGraph leibniz_normal_form = *min_element(leibniz_graphs.begin(), leibniz_graphs.end());\n    std::swap(leibniz_normal_form, *this);\n}\n<|endoftext|>"}
{"text":"<commit_before>\n\/\/\n\/\/ This source file is part of appleseed.\n\/\/ Visit http:\/\/appleseedhq.net\/ for additional information and resources.\n\/\/\n\/\/ This software is released under the MIT license.\n\/\/\n\/\/ Copyright (c) 2010-2013 Francois Beaune, Jupiter Jazz Limited\n\/\/ Copyright (c) 2014-2017 Francois Beaune, The appleseedhq Organization\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\/\/\n\n\/\/ Interface header.\n#include \"tools.h\"\n\n\/\/ appleseed.studio headers.\n#include \"mainwindow\/project\/entityeditorwindow.h\"\n#include \"utility\/doubleslider.h\"\n#include \"utility\/interop.h\"\n\n\/\/ appleseed.foundation headers.\n#include \"foundation\/utility\/containers\/dictionary.h\"\n\n\/\/ Qt headers.\n#include <QInputDialog>\n#include <QLineEdit>\n#include <QMessageBox>\n#include <QObject>\n#include <QString>\n\n\/\/ Standard headers.\n#include <cmath>\n\nusing namespace foundation;\nusing namespace renderer;\nusing namespace std;\n\nnamespace appleseed {\nnamespace studio {\n\nstring get_entity_name_dialog(\n    QWidget*        parent,\n    const string&   title,\n    const string&   label,\n    const string&   text)\n{\n    QString result;\n    bool ok;\n\n    do\n    {\n        result =\n            QInputDialog::getText(\n                parent,\n                QString::fromStdString(title),\n                QString::fromStdString(label),\n                QLineEdit::Normal,\n                QString::fromStdString(text),\n                &ok);\n    } while (ok && result.isEmpty());\n\n    return ok ? result.toStdString() : string();\n}\n\nvoid open_entity_editor(\n    QWidget*                                parent,\n    const string&                           window_title,\n    const Project&                          project,\n    auto_ptr<EntityEditor::IFormFactory>    form_factory,\n    auto_ptr<EntityEditor::IEntityBrowser>  entity_browser,\n    auto_ptr<CustomEntityUI>                custom_entity_ui,\n    const Dictionary&                       values,\n    QObject*                                receiver,\n    const char*                             slot_apply,\n    const char*                             slot_accept,\n    const char*                             slot_cancel)\n{\n    EntityEditorWindow* editor_window =\n        new EntityEditorWindow(\n            parent,\n            window_title,\n            project,\n            form_factory,\n            entity_browser,\n            custom_entity_ui,\n            values);\n\n    QObject::connect(\n        editor_window, SIGNAL(signal_applied(foundation::Dictionary)),\n        receiver, slot_apply);\n\n    QObject::connect(\n        editor_window, SIGNAL(signal_accepted(foundation::Dictionary)),\n        receiver, slot_accept);\n\n    QObject::connect(\n        editor_window, SIGNAL(signal_canceled(foundation::Dictionary)),\n        receiver, slot_cancel);\n\n    editor_window->showNormal();\n    editor_window->activateWindow();\n}\n\nvoid open_entity_editor(\n    QWidget*                                parent,\n    const string&                           window_title,\n    const Project&                          project,\n    auto_ptr<EntityEditor::IFormFactory>    form_factory,\n    auto_ptr<EntityEditor::IEntityBrowser>  entity_browser,\n    const Dictionary&                       values,\n    QObject*                                receiver,\n    const char*                             slot_apply,\n    const char*                             slot_accept,\n    const char*                             slot_cancel)\n{\n    open_entity_editor(\n        parent,\n        window_title,\n        project,\n        form_factory,\n        entity_browser,\n        auto_ptr<CustomEntityUI>(),\n        values,\n        receiver,\n        slot_apply,\n        slot_accept,\n        slot_cancel);\n}\n\nvoid open_entity_editor(\n    QWidget*                                parent,\n    const string&                           window_title,\n    const Project&                          project,\n    auto_ptr<EntityEditor::IFormFactory>    form_factory,\n    auto_ptr<EntityEditor::IEntityBrowser>  entity_browser,\n    QObject*                                receiver,\n    const char*                             slot_apply,\n    const char*                             slot_accept,\n    const char*                             slot_cancel)\n{\n    open_entity_editor(\n        parent,\n        window_title,\n        project,\n        form_factory,\n        entity_browser,\n        auto_ptr<CustomEntityUI>(),\n        Dictionary(),\n        receiver,\n        slot_apply,\n        slot_accept,\n        slot_cancel);\n}\n\nvoid show_error_message_box(const string& title, const string& text)\n{\n    QMessageBox msgbox;\n    msgbox.setWindowTitle(QString::fromStdString(title));\n    msgbox.setIcon(QMessageBox::Critical);\n    msgbox.setText(QString::fromStdString(text));\n    msgbox.setStandardButtons(QMessageBox::Ok);\n    msgbox.exec();\n}\n\n\n\/\/\n\/\/ LineEditDoubleSliderAdaptor class implementation.\n\/\/\n\nLineEditDoubleSliderAdaptor::LineEditDoubleSliderAdaptor(\n    QLineEdit*      line_edit,\n    DoubleSlider*   slider)\n  : QObject(line_edit)\n  , m_line_edit(line_edit)\n  , m_slider(slider)\n{\n    slot_set_slider_value(m_line_edit->text());\n\n    \/\/ Connect the line edit and the slider together.\n    connect(\n        m_slider, SIGNAL(valueChanged(const double)),\n        SLOT(slot_set_line_edit_value(const double)));\n    connect(\n        m_line_edit, SIGNAL(textChanged(const QString&)),\n        SLOT(slot_set_slider_value(const QString&)));\n    connect(\n        m_line_edit, SIGNAL(editingFinished()),\n        SLOT(slot_apply_slider_value()));\n}\n\nvoid LineEditDoubleSliderAdaptor::slot_set_line_edit_value(const double value)\n{\n    \/\/ Don't block signals here, for live edit to work we want the line edit to signal changes.\n    m_line_edit->setText(QString(\"%1\").arg(value));\n}\n\nvoid LineEditDoubleSliderAdaptor::slot_set_slider_value(const QString& value)\n{\n    if (!value.isEmpty())\n    {\n        m_slider->blockSignals(true);\n\n        const double new_value = value.toDouble();\n\n        \/\/ Adjust range if the new value is outside the current range.\n        if (new_value < m_slider->minimum() ||\n            new_value > m_slider->maximum())\n            adjust_slider(new_value);\n\n        m_slider->setValue(new_value);\n        m_slider->blockSignals(false);\n    }\n}\n\nvoid LineEditDoubleSliderAdaptor::slot_apply_slider_value()\n{\n    m_slider->blockSignals(true);\n\n    const double new_value = m_line_edit->text().toDouble();\n\n    \/\/ Adjust range if the new value is outside the current range,\n    \/\/ or if a value of a significantly smaller magnitude was entered.\n    if (new_value < m_slider->minimum() ||\n        new_value > m_slider->maximum() ||\n        abs(new_value) < (m_slider->maximum() - m_slider->minimum()) \/ 3.0)\n        adjust_slider(new_value);\n\n    m_slider->setValue(new_value);\n    m_slider->blockSignals(false);\n}\n\nvoid LineEditDoubleSliderAdaptor::adjust_slider(const double new_value)\n{\n    const double new_min = new_value >= 0.0 ? 0.0 : -2.0 * abs(new_value);\n    const double new_max = new_value == 0.0 ? 1.0 : +2.0 * abs(new_value);\n    m_slider->setRange(new_min, new_max);\n    m_slider->setPageStep((new_max - new_min) \/ 10.0);\n}\n\n\n\/\/\n\/\/ ForwardColorChangedSignal class implementation.\n\/\/\n\nForwardColorChangedSignal::ForwardColorChangedSignal(\n    QObject*        parent,\n    const QString&  widget_name,\n    const QColor&   initial_color)\n  : QObject(parent)\n  , m_widget_name(widget_name)\n  , m_initial_color(initial_color)\n  , m_current_color(initial_color)\n{\n}\n\nvoid ForwardColorChangedSignal::slot_color_reset()\n{\n    if (m_current_color != m_initial_color)\n        emit signal_color_reset(m_widget_name, m_initial_color);\n}\n\nvoid ForwardColorChangedSignal::slot_color_changed(const QColor& color)\n{\n    m_current_color = color;\n    emit signal_color_changed(m_widget_name, color);\n}\n\n}   \/\/ namespace studio\n}   \/\/ namespace appleseed\n<commit_msg>Unblock signals only if they were unblocked before<commit_after>\n\/\/\n\/\/ This source file is part of appleseed.\n\/\/ Visit http:\/\/appleseedhq.net\/ for additional information and resources.\n\/\/\n\/\/ This software is released under the MIT license.\n\/\/\n\/\/ Copyright (c) 2010-2013 Francois Beaune, Jupiter Jazz Limited\n\/\/ Copyright (c) 2014-2017 Francois Beaune, The appleseedhq Organization\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\/\/\n\n\/\/ Interface header.\n#include \"tools.h\"\n\n\/\/ appleseed.studio headers.\n#include \"mainwindow\/project\/entityeditorwindow.h\"\n#include \"utility\/doubleslider.h\"\n#include \"utility\/interop.h\"\n\n\/\/ appleseed.foundation headers.\n#include \"foundation\/utility\/containers\/dictionary.h\"\n\n\/\/ Qt headers.\n#include <QInputDialog>\n#include <QLineEdit>\n#include <QMessageBox>\n#include <QObject>\n#include <QString>\n\n\/\/ Standard headers.\n#include <cmath>\n\nusing namespace foundation;\nusing namespace renderer;\nusing namespace std;\n\nnamespace appleseed {\nnamespace studio {\n\nstring get_entity_name_dialog(\n    QWidget*        parent,\n    const string&   title,\n    const string&   label,\n    const string&   text)\n{\n    QString result;\n    bool ok;\n\n    do\n    {\n        result =\n            QInputDialog::getText(\n                parent,\n                QString::fromStdString(title),\n                QString::fromStdString(label),\n                QLineEdit::Normal,\n                QString::fromStdString(text),\n                &ok);\n    } while (ok && result.isEmpty());\n\n    return ok ? result.toStdString() : string();\n}\n\nvoid open_entity_editor(\n    QWidget*                                parent,\n    const string&                           window_title,\n    const Project&                          project,\n    auto_ptr<EntityEditor::IFormFactory>    form_factory,\n    auto_ptr<EntityEditor::IEntityBrowser>  entity_browser,\n    auto_ptr<CustomEntityUI>                custom_entity_ui,\n    const Dictionary&                       values,\n    QObject*                                receiver,\n    const char*                             slot_apply,\n    const char*                             slot_accept,\n    const char*                             slot_cancel)\n{\n    EntityEditorWindow* editor_window =\n        new EntityEditorWindow(\n            parent,\n            window_title,\n            project,\n            form_factory,\n            entity_browser,\n            custom_entity_ui,\n            values);\n\n    QObject::connect(\n        editor_window, SIGNAL(signal_applied(foundation::Dictionary)),\n        receiver, slot_apply);\n\n    QObject::connect(\n        editor_window, SIGNAL(signal_accepted(foundation::Dictionary)),\n        receiver, slot_accept);\n\n    QObject::connect(\n        editor_window, SIGNAL(signal_canceled(foundation::Dictionary)),\n        receiver, slot_cancel);\n\n    editor_window->showNormal();\n    editor_window->activateWindow();\n}\n\nvoid open_entity_editor(\n    QWidget*                                parent,\n    const string&                           window_title,\n    const Project&                          project,\n    auto_ptr<EntityEditor::IFormFactory>    form_factory,\n    auto_ptr<EntityEditor::IEntityBrowser>  entity_browser,\n    const Dictionary&                       values,\n    QObject*                                receiver,\n    const char*                             slot_apply,\n    const char*                             slot_accept,\n    const char*                             slot_cancel)\n{\n    open_entity_editor(\n        parent,\n        window_title,\n        project,\n        form_factory,\n        entity_browser,\n        auto_ptr<CustomEntityUI>(),\n        values,\n        receiver,\n        slot_apply,\n        slot_accept,\n        slot_cancel);\n}\n\nvoid open_entity_editor(\n    QWidget*                                parent,\n    const string&                           window_title,\n    const Project&                          project,\n    auto_ptr<EntityEditor::IFormFactory>    form_factory,\n    auto_ptr<EntityEditor::IEntityBrowser>  entity_browser,\n    QObject*                                receiver,\n    const char*                             slot_apply,\n    const char*                             slot_accept,\n    const char*                             slot_cancel)\n{\n    open_entity_editor(\n        parent,\n        window_title,\n        project,\n        form_factory,\n        entity_browser,\n        auto_ptr<CustomEntityUI>(),\n        Dictionary(),\n        receiver,\n        slot_apply,\n        slot_accept,\n        slot_cancel);\n}\n\nvoid show_error_message_box(const string& title, const string& text)\n{\n    QMessageBox msgbox;\n    msgbox.setWindowTitle(QString::fromStdString(title));\n    msgbox.setIcon(QMessageBox::Critical);\n    msgbox.setText(QString::fromStdString(text));\n    msgbox.setStandardButtons(QMessageBox::Ok);\n    msgbox.exec();\n}\n\n\n\/\/\n\/\/ LineEditDoubleSliderAdaptor class implementation.\n\/\/\n\nLineEditDoubleSliderAdaptor::LineEditDoubleSliderAdaptor(\n    QLineEdit*      line_edit,\n    DoubleSlider*   slider)\n  : QObject(line_edit)\n  , m_line_edit(line_edit)\n  , m_slider(slider)\n{\n    slot_set_slider_value(m_line_edit->text());\n\n    \/\/ Connect the line edit and the slider together.\n    connect(\n        m_slider, SIGNAL(valueChanged(const double)),\n        SLOT(slot_set_line_edit_value(const double)));\n    connect(\n        m_line_edit, SIGNAL(textChanged(const QString&)),\n        SLOT(slot_set_slider_value(const QString&)));\n    connect(\n        m_line_edit, SIGNAL(editingFinished()),\n        SLOT(slot_apply_slider_value()));\n}\n\nvoid LineEditDoubleSliderAdaptor::slot_set_line_edit_value(const double value)\n{\n    \/\/ Don't block signals here, for live edit to work we want the line edit to signal changes.\n    m_line_edit->setText(QString(\"%1\").arg(value));\n}\n\nvoid LineEditDoubleSliderAdaptor::slot_set_slider_value(const QString& value)\n{\n    if (!value.isEmpty())\n    {\n        const bool were_signals_blocked = m_slider->blockSignals(true);\n\n        const double new_value = value.toDouble();\n\n        \/\/ Adjust range if the new value is outside the current range.\n        if (new_value < m_slider->minimum() ||\n            new_value > m_slider->maximum())\n            adjust_slider(new_value);\n\n        m_slider->setValue(new_value);\n        m_slider->blockSignals(were_signals_blocked);\n    }\n}\n\nvoid LineEditDoubleSliderAdaptor::slot_apply_slider_value()\n{\n    const bool were_signals_blocked = m_slider->blockSignals(true);\n\n    const double new_value = m_line_edit->text().toDouble();\n\n    \/\/ Adjust range if the new value is outside the current range,\n    \/\/ or if a value of a significantly smaller magnitude was entered.\n    if (new_value < m_slider->minimum() ||\n        new_value > m_slider->maximum() ||\n        abs(new_value) < (m_slider->maximum() - m_slider->minimum()) \/ 3.0)\n        adjust_slider(new_value);\n\n    m_slider->setValue(new_value);\n    m_slider->blockSignals(were_signals_blocked);\n}\n\nvoid LineEditDoubleSliderAdaptor::adjust_slider(const double new_value)\n{\n    const double new_min = new_value >= 0.0 ? 0.0 : -2.0 * abs(new_value);\n    const double new_max = new_value == 0.0 ? 1.0 : +2.0 * abs(new_value);\n    m_slider->setRange(new_min, new_max);\n    m_slider->setPageStep((new_max - new_min) \/ 10.0);\n}\n\n\n\/\/\n\/\/ ForwardColorChangedSignal class implementation.\n\/\/\n\nForwardColorChangedSignal::ForwardColorChangedSignal(\n    QObject*        parent,\n    const QString&  widget_name,\n    const QColor&   initial_color)\n  : QObject(parent)\n  , m_widget_name(widget_name)\n  , m_initial_color(initial_color)\n  , m_current_color(initial_color)\n{\n}\n\nvoid ForwardColorChangedSignal::slot_color_reset()\n{\n    if (m_current_color != m_initial_color)\n        emit signal_color_reset(m_widget_name, m_initial_color);\n}\n\nvoid ForwardColorChangedSignal::slot_color_changed(const QColor& color)\n{\n    m_current_color = color;\n    emit signal_color_changed(m_widget_name, color);\n}\n\n}   \/\/ namespace studio\n}   \/\/ namespace appleseed\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Create Shop class test<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: osl_Socket_tests.cxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 15:40: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\/\/------------------------------------------------------------------------\n\/\/ include files\n\/\/------------------------------------------------------------------------\n\n#ifndef _OSL_SOCKET_CONST_H_\n#include <osl_Socket_Const.h>\n#endif\n\n#include <cppunit\/simpleheader.hxx>\n\n#ifndef _OSL_SOCKET_HXX_\n#include <osl\/socket.hxx>\n#endif\n\/\/------------------------------------------------------------------------\n\/\/ helper functions\n\/\/------------------------------------------------------------------------\n\n\/\/------------------------------------------------------------------------\n\/\/ tests cases begins here\n\/\/------------------------------------------------------------------------\n\nnamespace osl_Socket\n{\n\n    class tests : public CppUnit::TestFixture\n    {\n    public:\n\n        void test_001()\n            {\n                \/\/ _osl_getFullQualifiedDomainName( );\n                oslSocketResult aResult;\n                rtl::OUString suHostname = osl::SocketAddr::getLocalHostname(&aResult);\n                volatile int dummy = 0;\n                CPPUNIT_ASSERT_MESSAGE(\"getLocalHostname failed\", aResult == osl_Socket_Ok);\n            }\n\n\/\/ -----------------------------------------------------------------------------\n\n#if defined UNX\n\/*\n        void getHostname_003()\n        {\n            struct hostent *pQualifiedHostByName;\n            struct hostent *pHostByName;\n\n            struct hostent  aHostByName, aQualifiedHostByName;\n            sal_Char        pHostBuffer[ 2000 ];\n            sal_Char          pQualifiedHostBuffer[ 2560 ];\n            int     nErrorNo;\n\n            pHostBuffer[0] = '\\0';\n            pQualifiedHostBuffer[0] = '\\0';\n\n            gethostbyname_r (\"sceri.PRC.Sun.COM\", &aQualifiedHostByName, pQualifiedHostBuffer, sizeof(pQualifiedHostBuffer), &pQualifiedHostByName, &nErrorNo);\n            \/\/ gethostbyname_r (\"grande.germany.Sun.COM\", &aQualifiedHostByName, pQualifiedHostBuffer, sizeof(pQualifiedHostBuffer), &pQualifiedHostByName, &nErrorNo);\n            gethostbyname_r (\"longshot.PRC.Sun.COM\", &aHostByName, pHostBuffer, sizeof(pHostBuffer), &pHostByName, &nErrorNo);\n\n            if ( pQualifiedHostByName )\n                t_print(\"# getHostname_003: QualifiedHostByName!\\n\" );\n            if ( pHostByName )\n                t_print(\"# getHostname_003: HostByName!\\n\" );\n\n        }\n*\/\n        void getHostname_001()\n            {\n                struct hostent *pQualifiedHostByName;\n                struct hostent *pHostByName;\n                struct hostent *pQualifiedHostByName1;\n                struct hostent *pHostByName1;\n\n                struct hostent aHostByName, aQualifiedHostByName, aHostByName1, aQualifiedHostByName1;\n                char pHostBuffer[ 256 ];\n                char pQualifiedHostBuffer[ 256 ];\n                char pHostBuffer1[ 2000 ];\n                char pQualifiedHostBuffer1[ 2000 ];\n                int nErrorNo;\n\n                pHostBuffer[0] = '\\0';\n                pQualifiedHostBuffer[0] = '\\0';\n                pHostBuffer1[0] = '\\0';\n                pQualifiedHostBuffer1[0] = '\\0';\n\n                gethostbyname_r (\"grande.Germany.Sun.COM\", &aQualifiedHostByName, pQualifiedHostBuffer, sizeof(pQualifiedHostBuffer), &pQualifiedHostByName, &nErrorNo);\n                gethostbyname_r (\"longshot.PRC.Sun.COM\", &aHostByName, pHostBuffer, sizeof(pHostBuffer), &pHostByName, &nErrorNo);\n\n                gethostbyname_r (\"grande.Germany.Sun.COM\", &aQualifiedHostByName1, pQualifiedHostBuffer1, sizeof(pQualifiedHostBuffer1), &pQualifiedHostByName1, &nErrorNo);\n                gethostbyname_r (\"longshot.PRC.Sun.COM\", &aHostByName1, pHostBuffer1, sizeof(pHostBuffer1), &pHostByName1, &nErrorNo);\n\n                if ( pQualifiedHostByName )\n                    printf( \"# QualifiedHostByName got if size is 256!\\n\" );\n                if ( pHostByName )\n                    printf( \"# HostByName got if size is 256!\\n\" );\n\n                if ( pQualifiedHostByName1 )\n                    printf( \"# QualifiedHostByName got if size is 2000!\\n\" );\n                if ( pHostByName1 )\n                    printf( \"# HostByName got if size is 2000!\\n\" );\n            }\n\n#endif\n        CPPUNIT_TEST_SUITE( tests );\n        CPPUNIT_TEST( test_001 );\n        \/\/CPPUNIT_TEST( getHostname_003 );\n        CPPUNIT_TEST( getHostname_001 );\n        CPPUNIT_TEST_SUITE_END();\n    };\n\n    CPPUNIT_TEST_SUITE_NAMED_REGISTRATION(osl_Socket::tests, \"osl_SocketTest\");\n}\n\n\n\/\/ -----------------------------------------------------------------------------\n\n\/\/ this macro creates an empty function, which will called by the RegisterAllFunctions()\n\/\/ to let the user the possibility to also register some functions by hand.\n\n\/*#if (defined LINUX)\n\nvoid RegisterAdditionalFunctions( FktRegFuncPtr _pFunc )\n{\n    \/\/ for cover lines in _osl_getFullQualifiedDomainName( )\n    \/\/ STAR_OVERRIDE_DOMAINNAME is more an internal HACK for 5.2, which should remove from sal\n    setenv( \"STAR_OVERRIDE_DOMAINNAME\", \"PRC.Sun.COM\", 0 );\n}\n\n#else*\/\n\nNOADDITIONAL;\n\n\/\/#endif\n<commit_msg>INTEGRATION: CWS warnings01 (1.4.92); FILE MERGED 2005\/09\/23 01:15:19 sb 1.4.92.3: RESYNC: (1.4-1.5); FILE MERGED 2005\/09\/15 12:35:38 sb 1.4.92.2: #i53898# Fixed previous change. 2005\/09\/14 15:18:52 sb 1.4.92.1: #i53898# Made code warning-free.<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: osl_Socket_tests.cxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: hr $ $Date: 2006-06-20 04:24: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\/\/------------------------------------------------------------------------\n\/\/ include files\n\/\/------------------------------------------------------------------------\n\n#ifndef _OSL_SOCKET_CONST_H_\n#include <osl_Socket_Const.h>\n#endif\n\n#include <cppunit\/simpleheader.hxx>\n\n#ifndef _OSL_SOCKET_HXX_\n#include <osl\/socket.hxx>\n#endif\n\/\/------------------------------------------------------------------------\n\/\/ helper functions\n\/\/------------------------------------------------------------------------\n\n\/\/------------------------------------------------------------------------\n\/\/ tests cases begins here\n\/\/------------------------------------------------------------------------\n\nnamespace osl_Socket\n{\n\n    class tests : public CppUnit::TestFixture\n    {\n    public:\n\n        void test_001()\n            {\n                \/\/ _osl_getFullQualifiedDomainName( );\n                oslSocketResult aResult;\n                rtl::OUString suHostname = osl::SocketAddr::getLocalHostname(&aResult);\n                CPPUNIT_ASSERT_MESSAGE(\"getLocalHostname failed\", aResult == osl_Socket_Ok);\n            }\n\n        CPPUNIT_TEST_SUITE( tests );\n        CPPUNIT_TEST( test_001 );\n        CPPUNIT_TEST_SUITE_END();\n    };\n\n    CPPUNIT_TEST_SUITE_NAMED_REGISTRATION(osl_Socket::tests, \"osl_SocketTest\");\n}\n\n\n\/\/ -----------------------------------------------------------------------------\n\n\/\/ this macro creates an empty function, which will called by the RegisterAllFunctions()\n\/\/ to let the user the possibility to also register some functions by hand.\n\n\/*#if (defined LINUX)\n\nvoid RegisterAdditionalFunctions( FktRegFuncPtr _pFunc )\n{\n    \/\/ for cover lines in _osl_getFullQualifiedDomainName( )\n    \/\/ STAR_OVERRIDE_DOMAINNAME is more an internal HACK for 5.2, which should remove from sal\n    setenv( \"STAR_OVERRIDE_DOMAINNAME\", \"PRC.Sun.COM\", 0 );\n}\n\n#else*\/\n\nNOADDITIONAL;\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#include <numeric>\n\n#include \"catch.hpp\"\n\n#include \"cpp_utils\/data.hpp\"\n\n#include \"dll\/conv_rbm.hpp\"\n#include \"dll\/mp_layer.hpp\"\n#include \"dll\/dbn.hpp\"\n\n#include \"mnist\/mnist_reader.hpp\"\n#include \"mnist\/mnist_utils.hpp\"\n\nTEST_CASE(\"perf\/kws_square\", \"[perf][crbm][mp][cdbn]\") {\n    using cdbn_t =\n        dll::dbn_desc<\n            dll::dbn_layers<\n                dll::conv_rbm_desc<\n                    1, 28, 28, 8, 20, 20, dll::weight_type<float>, dll::batch_size<64>, dll::momentum,\n                    dll::weight_decay<dll::decay_type::L2>, dll::sparsity<dll::sparsity_method::LEE>, dll::shuffle_cond<true>, dll::dbn_only>::layer_t,\n                dll::mp_layer_3d_desc<8, 20, 20, 1, 2, 2, dll::weight_type<float>>::layer_t,\n                dll::conv_rbm_desc<\n                    8, 10, 10, 8, 8, 8, dll::weight_type<float>, dll::batch_size<64>, dll::momentum,\n                    dll::weight_decay<dll::decay_type::L2>, dll::sparsity<dll::sparsity_method::LEE>, dll::shuffle_cond<true>, dll::dbn_only>::layer_t,\n                dll::mp_layer_3d_desc<8, 8, 8, 1, 2, 2, dll::weight_type<float>>::layer_t\n            >>::dbn_t;\n\n    auto cdbn = std::make_unique<cdbn_t>();\n\n    cdbn->display();\n\n    auto dataset = mnist::read_dataset<std::vector, std::vector, float>(8192);\n\n    REQUIRE(!dataset.training_images.empty());\n\n    mnist::binarize_dataset(dataset);\n\n    cdbn->pretrain(dataset.training_images, 5);\n\n    dll::dump_timers();\n}\n\nTEST_CASE(\"perf\/kws\", \"[perf][crbm][mp][cdbn]\") {\n    using cdbn_t =\n        dll::dbn_desc<\n            dll::dbn_layers<\n                dll::conv_rbm_desc<\n                    1, 40, 20, 8, 32, 12, dll::weight_type<float>, dll::batch_size<64>, dll::momentum,\n                    dll::weight_decay<dll::decay_type::L2>, dll::sparsity<dll::sparsity_method::LEE>, dll::shuffle_cond<true>, dll::dbn_only>::layer_t,\n                dll::mp_layer_3d_desc<8, 32, 12, 1, 2, 2, dll::weight_type<float>>::layer_t,\n                dll::conv_rbm_desc<\n                    8, 16, 6, 8, 14, 4, dll::weight_type<float>, dll::batch_size<64>, dll::momentum,\n                    dll::weight_decay<dll::decay_type::L2>, dll::sparsity<dll::sparsity_method::LEE>, dll::shuffle_cond<true>, dll::dbn_only>::layer_t,\n                dll::mp_layer_3d_desc<8, 14, 4, 1, 2, 2, dll::weight_type<float>>::layer_t\n            >>::dbn_t;\n\n    auto cdbn = std::make_unique<cdbn_t>();\n\n    cdbn->display();\n\n    auto dataset = mnist::read_dataset<std::vector, std::vector, float>(8192);\n\n    REQUIRE(!dataset.training_images.empty());\n\n    mnist::binarize_dataset(dataset);\n\n    std::vector<etl::fast_dyn_matrix<float, 1, 40, 20>> augmented(dataset.training_images.size());\n\n    for(std::size_t i = 0; i < dataset.training_images.size(); ++i){\n        auto& source_image = dataset.training_images[i];\n        auto& target_image = augmented[i];\n\n        for(std::size_t j = 0; j < source_image.size(); ++j){\n            target_image[j] = source_image[j];\n        }\n    }\n\n    cdbn->pretrain(augmented, 5);\n\n    dll::dump_timers();\n}\n\nTEST_CASE(\"perf\/kws_sub\", \"[perf][crbm][mp][cdbn]\") {\n    using cdbn_t =\n        dll::dbn_desc<\n            dll::dbn_layers<\n                dll::conv_rbm_desc<\n                    1, 40, 20, 8, 32, 12, dll::weight_type<float>, dll::batch_size<64>, dll::momentum,\n                    dll::weight_decay<dll::decay_type::L2>, dll::sparsity<dll::sparsity_method::LEE>, dll::shuffle_cond<true>, dll::dbn_only>::layer_t,\n                dll::mp_layer_3d_desc<8, 32, 12, 1, 2, 2, dll::weight_type<float>>::layer_t\n            >>::dbn_t;\n\n    auto cdbn = std::make_unique<cdbn_t>();\n\n    cdbn->display();\n\n    auto dataset = mnist::read_dataset<std::vector, std::vector, float>(16384);\n\n    REQUIRE(!dataset.training_images.empty());\n\n    mnist::binarize_dataset(dataset);\n\n    std::vector<etl::fast_dyn_matrix<float, 1, 40, 20>> augmented(dataset.training_images.size());\n\n    for(std::size_t i = 0; i < dataset.training_images.size(); ++i){\n        auto& source_image = dataset.training_images[i];\n        auto& target_image = augmented[i];\n\n        for(std::size_t j = 0; j < source_image.size(); ++j){\n            target_image[j] = source_image[j];\n        }\n    }\n\n    cdbn->pretrain(augmented, 5);\n\n    dll::dump_timers();\n}\n<commit_msg>\"Simplify\" the test case<commit_after>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2016 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/  http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#include <numeric>\n\n#include \"catch.hpp\"\n\n#include \"cpp_utils\/data.hpp\"\n\n#include \"dll\/conv_rbm.hpp\"\n#include \"dll\/mp_layer.hpp\"\n#include \"dll\/dbn.hpp\"\n\n#include \"mnist\/mnist_reader.hpp\"\n#include \"mnist\/mnist_utils.hpp\"\n\nTEST_CASE(\"perf\/kws_square\", \"[perf][crbm][mp][cdbn]\") {\n    using cdbn_t =\n        dll::dbn_desc<\n            dll::dbn_layers<\n                dll::conv_rbm_desc<\n                    1, 28, 28, 8, 20, 20, dll::weight_type<float>, dll::batch_size<64>, dll::momentum,\n                    dll::weight_decay<dll::decay_type::L2>, dll::sparsity<dll::sparsity_method::LEE>, dll::shuffle_cond<true>, dll::dbn_only>::layer_t,\n                dll::mp_layer_3d_desc<8, 20, 20, 1, 2, 2, dll::weight_type<float>>::layer_t,\n                dll::conv_rbm_desc<\n                    8, 10, 10, 8, 8, 8, dll::weight_type<float>, dll::batch_size<64>, dll::momentum,\n                    dll::weight_decay<dll::decay_type::L2>, dll::sparsity<dll::sparsity_method::LEE>, dll::shuffle_cond<true>, dll::dbn_only>::layer_t,\n                dll::mp_layer_3d_desc<8, 8, 8, 1, 2, 2, dll::weight_type<float>>::layer_t\n            >>::dbn_t;\n\n    auto cdbn = std::make_unique<cdbn_t>();\n\n    cdbn->display();\n\n    \/\/TODO Make this possible again\n    \/\/auto dataset = mnist::read_dataset<std::vector, std::vector, float>(8192);\n\n    auto dataset = mnist::read_dataset_direct<std::vector, etl::fast_dyn_matrix<double, 1, 28, 28>>(100);\n    REQUIRE(!dataset.training_images.empty());\n\n    mnist::binarize_dataset(dataset);\n\n    cdbn->pretrain(dataset.training_images, 5);\n\n    dll::dump_timers();\n}\n\nTEST_CASE(\"perf\/kws\", \"[perf][crbm][mp][cdbn]\") {\n    using cdbn_t =\n        dll::dbn_desc<\n            dll::dbn_layers<\n                dll::conv_rbm_desc<\n                    1, 40, 20, 8, 32, 12, dll::weight_type<float>, dll::batch_size<64>, dll::momentum,\n                    dll::weight_decay<dll::decay_type::L2>, dll::sparsity<dll::sparsity_method::LEE>, dll::shuffle_cond<true>, dll::dbn_only>::layer_t,\n                dll::mp_layer_3d_desc<8, 32, 12, 1, 2, 2, dll::weight_type<float>>::layer_t,\n                dll::conv_rbm_desc<\n                    8, 16, 6, 8, 14, 4, dll::weight_type<float>, dll::batch_size<64>, dll::momentum,\n                    dll::weight_decay<dll::decay_type::L2>, dll::sparsity<dll::sparsity_method::LEE>, dll::shuffle_cond<true>, dll::dbn_only>::layer_t,\n                dll::mp_layer_3d_desc<8, 14, 4, 1, 2, 2, dll::weight_type<float>>::layer_t\n            >>::dbn_t;\n\n    auto cdbn = std::make_unique<cdbn_t>();\n\n    cdbn->display();\n\n    auto dataset = mnist::read_dataset<std::vector, std::vector, float>(8192);\n\n    REQUIRE(!dataset.training_images.empty());\n\n    mnist::binarize_dataset(dataset);\n\n    std::vector<etl::fast_dyn_matrix<float, 1, 40, 20>> augmented(dataset.training_images.size());\n\n    for(std::size_t i = 0; i < dataset.training_images.size(); ++i){\n        auto& source_image = dataset.training_images[i];\n        auto& target_image = augmented[i];\n\n        for(std::size_t j = 0; j < source_image.size(); ++j){\n            target_image[j] = source_image[j];\n        }\n    }\n\n    cdbn->pretrain(augmented, 5);\n\n    dll::dump_timers();\n}\n\nTEST_CASE(\"perf\/kws_sub\", \"[perf][crbm][mp][cdbn]\") {\n    using cdbn_t =\n        dll::dbn_desc<\n            dll::dbn_layers<\n                dll::conv_rbm_desc<\n                    1, 40, 20, 8, 32, 12, dll::weight_type<float>, dll::batch_size<64>, dll::momentum,\n                    dll::weight_decay<dll::decay_type::L2>, dll::sparsity<dll::sparsity_method::LEE>, dll::shuffle_cond<true>, dll::dbn_only>::layer_t,\n                dll::mp_layer_3d_desc<8, 32, 12, 1, 2, 2, dll::weight_type<float>>::layer_t\n            >>::dbn_t;\n\n    auto cdbn = std::make_unique<cdbn_t>();\n\n    cdbn->display();\n\n    auto dataset = mnist::read_dataset<std::vector, std::vector, float>(16384);\n\n    REQUIRE(!dataset.training_images.empty());\n\n    mnist::binarize_dataset(dataset);\n\n    std::vector<etl::fast_dyn_matrix<float, 1, 40, 20>> augmented(dataset.training_images.size());\n\n    for(std::size_t i = 0; i < dataset.training_images.size(); ++i){\n        auto& source_image = dataset.training_images[i];\n        auto& target_image = augmented[i];\n\n        for(std::size_t j = 0; j < source_image.size(); ++j){\n            target_image[j] = source_image[j];\n        }\n    }\n\n    cdbn->pretrain(augmented, 5);\n\n    dll::dump_timers();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: sdhtmlfilter.cxx,v $\n *\n *  $Revision: 1.1 $\n *\n *  last change: $Author: ka $ $Date: 2002-04-18 15:04: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#include <unotools\/localfilehelper.hxx>\n#include <tools\/errinf.hxx>\n#include <tools\/urlobj.hxx>\n#include <vcl\/msgbox.hxx>\n#include <vcl\/metaact.hxx>\n#include <vcl\/virdev.hxx>\n#include <svtools\/FilterConfigItem.hxx>\n#include <sfx2\/docfile.hxx>\n#include <sfx2\/docfilt.hxx>\n#include <svx\/impgrf.hxx>\n#include <svx\/svdograf.hxx>\n#include <svx\/svdpagv.hxx>\n#include <svx\/xoutbmp.hxx>\n\n#include \"sdpage.hxx\"\n#include \"drawdoc.hxx\"\n#include \"sdresid.hxx\"\n#include \"sdattr.hxx\"\n#include \"htmlex.hxx\"\n#include \"sdhtmlfilter.hxx\"\n\n\/\/ ---------------\n\/\/ - SdPPTFilter -\n\/\/ ---------------\n\nSdHTMLFilter::SdHTMLFilter( SfxMedium& rMedium, SdDrawDocShell& rDocShell, sal_Bool bShowProgress ) :\n    SdFilter( rMedium, rDocShell, bShowProgress )\n{\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nSdHTMLFilter::~SdHTMLFilter()\n{\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nsal_Bool SdHTMLFilter::Export()\n{\n    SfxItemSet      aArgs( mrDocument.GetPool(), ATTR_PUBLISH_START, ATTR_PUBLISH_END );\n    SdPublishingDlg aDlg( mrDocShell.GetWindow(), mrDocument.GetDocumentType() );\n    sal_Bool        bRet = sal_False;\n\n    if( aDlg.Execute() )\n    {\n        String aTmp;\n        ::utl::LocalFileHelper::ConvertPhysicalNameToURL( mrMedium.GetPhysicalName(), aTmp );\n        const INetURLObject aURL( aTmp );\n\n        mrMedium.Close();\n        aDlg.FillItemSet( aArgs );\n        aArgs.Put( SfxStringItem( ATTR_PUBLISH_LOCATION, aURL.GetMainURL( INetURLObject::NO_DECODE ) ) );\n        delete( new HtmlExport( &mrDocument, &mrDocShell, &aArgs ) );\n\n        bRet = sal_True;\n    }\n\n    return bRet;\n}\n<commit_msg>#99614# set correct publish location<commit_after>\/*************************************************************************\n *\n *  $RCSfile: sdhtmlfilter.cxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: cl $ $Date: 2002-05-30 12:26:53 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#include <unotools\/localfilehelper.hxx>\n#include <tools\/errinf.hxx>\n#include <tools\/urlobj.hxx>\n#include <vcl\/msgbox.hxx>\n#include <vcl\/metaact.hxx>\n#include <vcl\/virdev.hxx>\n#include <svtools\/FilterConfigItem.hxx>\n#include <sfx2\/docfile.hxx>\n#include <sfx2\/docfilt.hxx>\n#include <svx\/impgrf.hxx>\n#include <svx\/svdograf.hxx>\n#include <svx\/svdpagv.hxx>\n#include <svx\/xoutbmp.hxx>\n\n#include \"sdpage.hxx\"\n#include \"drawdoc.hxx\"\n#include \"sdresid.hxx\"\n#include \"sdattr.hxx\"\n#include \"htmlex.hxx\"\n#include \"sdhtmlfilter.hxx\"\n\n\/\/ ---------------\n\/\/ - SdPPTFilter -\n\/\/ ---------------\n\nSdHTMLFilter::SdHTMLFilter( SfxMedium& rMedium, SdDrawDocShell& rDocShell, sal_Bool bShowProgress ) :\n    SdFilter( rMedium, rDocShell, bShowProgress )\n{\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nSdHTMLFilter::~SdHTMLFilter()\n{\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nsal_Bool SdHTMLFilter::Export()\n{\n    SfxItemSet      aArgs( mrDocument.GetPool(), ATTR_PUBLISH_START, ATTR_PUBLISH_END );\n    SdPublishingDlg aDlg( mrDocShell.GetWindow(), mrDocument.GetDocumentType() );\n    sal_Bool        bRet = sal_False;\n\n    if( aDlg.Execute() )\n    {\n\/\/      String aTmp;\n\/\/      ::utl::LocalFileHelper::ConvertSystemPathToURL( mrMedium.GetName(), aTmp );\n\/\/      const INetURLObject aURL( aTmp );\n\n        mrMedium.Close();\n        mrMedium.Commit();\n        aDlg.FillItemSet( aArgs );\n        aArgs.Put( SfxStringItem( ATTR_PUBLISH_LOCATION, mrMedium.GetName() ) );\n        delete( new HtmlExport( &mrDocument, &mrDocShell, &aArgs ) );\n\n        bRet = sal_True;\n    }\n\n    return bRet;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * RProjectFile.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#ifndef CORE_R_UTIL_R_PROJECT_FILE_HPP\n#define CORE_R_UTIL_R_PROJECT_FILE_HPP\n\n#include <string>\n#include <iosfwd>\n\n#include <core\/r_util\/RVersionInfo.hpp>\n\nnamespace rstudio {\nnamespace core {\n\nclass Error;\nclass FilePath;\n\nnamespace r_util {\n\nenum YesNoAskValue\n{\n   DefaultValue = 0,\n   YesValue = 1,\n   NoValue = 2,\n   AskValue = 3\n};\n\nextern const int kLineEndingsUseDefault;\n\nextern const char * const kBuildTypeNone;\nextern const char * const kBuildTypePackage;\nextern const char * const kBuildTypeMakefile;\nextern const char * const kBuildTypeCustom;\nextern const char * const kBuildTypeWebsite;\n\nstd::ostream& operator << (std::ostream& stream, const YesNoAskValue& val);\n\nstruct RProjectBuildDefaults\n{\n   RProjectBuildDefaults()\n      : useDevtools(true)\n   {\n   }\n   bool useDevtools;\n};\n\nstruct RProjectConfig\n{\n   RProjectConfig()\n      : version(1.0),\n        rVersion(kRVersionDefault),\n        saveWorkspace(DefaultValue),\n        restoreWorkspace(DefaultValue),\n        alwaysSaveHistory(DefaultValue),\n        enableCodeIndexing(true),\n        useSpacesForTab(true),\n        numSpacesForTab(2),\n        autoAppendNewline(false),\n        stripTrailingWhitespace(false),\n        lineEndings(kLineEndingsUseDefault),\n        encoding(),\n        defaultSweaveEngine(),\n        defaultLatexProgram(),\n        rootDocument(),\n        buildType(),\n        packagePath(),\n        packageInstallArgs(),\n        packageBuildArgs(),\n        packageBuildBinaryArgs(),\n        packageCheckArgs(),\n        packageRoxygenize(),\n        packageUseDevtools(false),\n        makefilePath(),\n        websitePath(),\n        customScriptPath(),\n        tutorialPath()\n   {\n   }\n\n   double version;\n   RVersionInfo rVersion;\n   int saveWorkspace;\n   int restoreWorkspace;\n   int alwaysSaveHistory;\n   bool enableCodeIndexing;\n   bool useSpacesForTab;\n   int numSpacesForTab;\n   bool autoAppendNewline;\n   bool stripTrailingWhitespace;\n   int lineEndings;\n   std::string encoding;\n   std::string defaultSweaveEngine;\n   std::string defaultLatexProgram;\n   std::string rootDocument;\n   std::string buildType;\n   std::string packagePath;\n   std::string packageInstallArgs;\n   std::string packageBuildArgs;\n   std::string packageBuildBinaryArgs;\n   std::string packageCheckArgs;\n   std::string packageRoxygenize;\n   bool packageUseDevtools;\n   std::string makefilePath;\n   std::string websitePath;\n   std::string customScriptPath;\n   std::string tutorialPath;\n};\n\n\nError readProjectFile(const FilePath& projectFilePath,\n                      RProjectConfig* pConfig,\n                      std::string* pUserErrMsg);\n\nError readProjectFile(const FilePath& projectFilePath,\n                      const RProjectConfig& defaultConfig,\n                      const RProjectBuildDefaults& buildDefaults,\n                      RProjectConfig* pConfig,\n                      bool* pProvidedDefaults,\n                      std::string* pUserErrMsg);\n\nError writeProjectFile(const FilePath& projectFilePath,\n                       const RProjectBuildDefaults& buildDefaults,\n                       const RProjectConfig& config);\n\nFilePath projectFromDirectory(const FilePath& directoryPath);\n\n\/\/ update the package install args default (only if it is set to\n\/\/ the previous default value)\nbool updateSetPackageInstallArgsDefault(RProjectConfig* pConfig);\n\n} \/\/ namespace r_util\n} \/\/ namespace core \n} \/\/ namespace rstudio\n\n\n#endif \/\/ CORE_R_UTIL_R_PROJECT_FILE_HPP\n\n<commit_msg>switch order of build type constants<commit_after>\/*\n * RProjectFile.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#ifndef CORE_R_UTIL_R_PROJECT_FILE_HPP\n#define CORE_R_UTIL_R_PROJECT_FILE_HPP\n\n#include <string>\n#include <iosfwd>\n\n#include <core\/r_util\/RVersionInfo.hpp>\n\nnamespace rstudio {\nnamespace core {\n\nclass Error;\nclass FilePath;\n\nnamespace r_util {\n\nenum YesNoAskValue\n{\n   DefaultValue = 0,\n   YesValue = 1,\n   NoValue = 2,\n   AskValue = 3\n};\n\nextern const int kLineEndingsUseDefault;\n\nextern const char * const kBuildTypeNone;\nextern const char * const kBuildTypePackage;\nextern const char * const kBuildTypeMakefile;\nextern const char * const kBuildTypeWebsite;\nextern const char * const kBuildTypeCustom;\n\nstd::ostream& operator << (std::ostream& stream, const YesNoAskValue& val);\n\nstruct RProjectBuildDefaults\n{\n   RProjectBuildDefaults()\n      : useDevtools(true)\n   {\n   }\n   bool useDevtools;\n};\n\nstruct RProjectConfig\n{\n   RProjectConfig()\n      : version(1.0),\n        rVersion(kRVersionDefault),\n        saveWorkspace(DefaultValue),\n        restoreWorkspace(DefaultValue),\n        alwaysSaveHistory(DefaultValue),\n        enableCodeIndexing(true),\n        useSpacesForTab(true),\n        numSpacesForTab(2),\n        autoAppendNewline(false),\n        stripTrailingWhitespace(false),\n        lineEndings(kLineEndingsUseDefault),\n        encoding(),\n        defaultSweaveEngine(),\n        defaultLatexProgram(),\n        rootDocument(),\n        buildType(),\n        packagePath(),\n        packageInstallArgs(),\n        packageBuildArgs(),\n        packageBuildBinaryArgs(),\n        packageCheckArgs(),\n        packageRoxygenize(),\n        packageUseDevtools(false),\n        makefilePath(),\n        websitePath(),\n        customScriptPath(),\n        tutorialPath()\n   {\n   }\n\n   double version;\n   RVersionInfo rVersion;\n   int saveWorkspace;\n   int restoreWorkspace;\n   int alwaysSaveHistory;\n   bool enableCodeIndexing;\n   bool useSpacesForTab;\n   int numSpacesForTab;\n   bool autoAppendNewline;\n   bool stripTrailingWhitespace;\n   int lineEndings;\n   std::string encoding;\n   std::string defaultSweaveEngine;\n   std::string defaultLatexProgram;\n   std::string rootDocument;\n   std::string buildType;\n   std::string packagePath;\n   std::string packageInstallArgs;\n   std::string packageBuildArgs;\n   std::string packageBuildBinaryArgs;\n   std::string packageCheckArgs;\n   std::string packageRoxygenize;\n   bool packageUseDevtools;\n   std::string makefilePath;\n   std::string websitePath;\n   std::string customScriptPath;\n   std::string tutorialPath;\n};\n\n\nError readProjectFile(const FilePath& projectFilePath,\n                      RProjectConfig* pConfig,\n                      std::string* pUserErrMsg);\n\nError readProjectFile(const FilePath& projectFilePath,\n                      const RProjectConfig& defaultConfig,\n                      const RProjectBuildDefaults& buildDefaults,\n                      RProjectConfig* pConfig,\n                      bool* pProvidedDefaults,\n                      std::string* pUserErrMsg);\n\nError writeProjectFile(const FilePath& projectFilePath,\n                       const RProjectBuildDefaults& buildDefaults,\n                       const RProjectConfig& config);\n\nFilePath projectFromDirectory(const FilePath& directoryPath);\n\n\/\/ update the package install args default (only if it is set to\n\/\/ the previous default value)\nbool updateSetPackageInstallArgsDefault(RProjectConfig* pConfig);\n\n} \/\/ namespace r_util\n} \/\/ namespace core \n} \/\/ namespace rstudio\n\n\n#endif \/\/ CORE_R_UTIL_R_PROJECT_FILE_HPP\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: GraphicObjectBar.cxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 06:58: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#include \"GraphicObjectBar.hxx\"\n\n#include <limits.h>\n#include <vcl\/msgbox.hxx>\n#include <svtools\/whiter.hxx>\n#include <svtools\/itempool.hxx>\n#ifndef _SFXAPP_HXX\n#include <sfx2\/app.hxx>\n#endif\n#ifndef _SFX_SHELL_HXX \/\/autogen\n#include <sfx2\/shell.hxx>\n#endif\n#ifndef _SVXIDS_HRC\n#include <svx\/svxids.hrc>\n#endif\n#ifndef _SFXREQUEST_HXX \/\/autogen\n#include <sfx2\/request.hxx>\n#endif\n#ifndef _BASEDLGS_HXX\n#include <sfx2\/basedlgs.hxx>\n#endif\n#ifndef _SVDOPATH_HXX \/\/autogen\n#include <svx\/svdograf.hxx>\n#endif\n#ifndef _SVX_GRFFLT_HXX \/\/autogen\n#include <svx\/grfflt.hxx>\n#endif\n#ifndef _AEITEM_HXX \/\/autogen\n#include <svtools\/aeitem.hxx>\n#endif\n#ifndef _SVX_GRAFCTRL_HXX\n#include <svx\/grafctrl.hxx>\n#endif\n\n#pragma hdrstop\n\n#include <sfx2\/objface.hxx>\n\n#include \"app.hrc\"\n#include \"res_bmp.hrc\"\n#include \"glob.hrc\"\n#include \"strings.hrc\"\n#include \"DrawDocShell.hxx\"\n#ifndef SD_VIEW_SHELL_HXX\n#include \"ViewShell.hxx\"\n#endif\n#ifndef SD_WINDOW_HXX\n#include \"Window.hxx\"\n#endif\n#ifndef SD_DRAW_VIEW_HXX\n#include \"drawview.hxx\"\n#endif\n#include \"sdresid.hxx\"\n#include \"drawdoc.hxx\"\n\nusing namespace sd;\n#define GraphicObjectBar\n#include \"sdslots.hxx\"\n\nnamespace sd {\n\n\nSFX_DECL_TYPE( 13 );\n\n\n\/\/ -----------------------\n\/\/ - GraphicObjectBar -\n\/\/ -----------------------\n\nSFX_IMPL_INTERFACE( GraphicObjectBar, SfxShell, SdResId( STR_GRAFOBJECTBARSHELL ) )\n{\n    SFX_OBJECTBAR_REGISTRATION( SFX_OBJECTBAR_OBJECT, SdResId( RID_DRAW_GRAF_TOOLBOX ) );\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nTYPEINIT1( GraphicObjectBar, SfxShell );\n\n\/\/ -----------------------------------------------------------------------------\n\nGraphicObjectBar::GraphicObjectBar (\n    ViewShell* pSdViewShell,\n    ::sd::View* pSdView )\n    : SfxShell (pSdViewShell->GetViewShell()),\n      pView  ( pSdView ),\n      pViewSh ( pSdViewShell ),\n      nMappedSlotFilter ( SID_GRFFILTER_INVERT )\n{\n    DrawDocShell* pDocShell = pViewSh->GetDocSh();\n\n    SetPool( &pDocShell->GetPool() );\n    SetUndoManager( pDocShell->GetUndoManager() );\n    SetRepeatTarget( pView );\n    SetHelpId( SD_IF_SDDRAWGRAFOBJECTBAR );\n    SetName( String( RTL_CONSTASCII_USTRINGPARAM( \"Graphic objectbar\" )));\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nGraphicObjectBar::~GraphicObjectBar()\n{\n    SetRepeatTarget( NULL );\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nvoid GraphicObjectBar::GetAttrState( SfxItemSet& rSet )\n{\n    if( pView )\n        SvxGrafAttrHelper::GetGrafAttrState( rSet, *pView );\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nvoid GraphicObjectBar::Execute( SfxRequest& rReq )\n{\n    if( pView )\n    {\n        SvxGrafAttrHelper::ExecuteGrafAttr( rReq, *pView );\n        Invalidate();\n    }\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nvoid GraphicObjectBar::GetFilterState( SfxItemSet& rSet )\n{\n    const SdrMarkList&  rMarkList = pView->GetMarkedObjectList();\n    BOOL                bEnable = FALSE;\n\n    if( rMarkList.GetMarkCount() == 1 )\n    {\n        SdrObject* pObj = rMarkList.GetMark( 0 )->GetObj();\n\n        if( pObj && pObj->ISA( SdrGrafObj ) && ( ( (SdrGrafObj*) pObj )->GetGraphicType() == GRAPHIC_BITMAP ) )\n            bEnable = TRUE;\n    }\n\n    if( !bEnable )\n        SvxGraphicFilter::DisableGraphicFilterSlots( rSet );\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nvoid GraphicObjectBar::ExecuteFilter( SfxRequest& rReq )\n{\n    const SdrMarkList& rMarkList = pView->GetMarkedObjectList();\n\n    if( rMarkList.GetMarkCount() == 1 )\n    {\n        SdrObject* pObj = rMarkList.GetMark( 0 )->GetObj();\n\n        if( pObj && pObj->ISA( SdrGrafObj ) && ( (SdrGrafObj*) pObj )->GetGraphicType() == GRAPHIC_BITMAP )\n        {\n            GraphicObject aFilterObj( ( (SdrGrafObj*) pObj )->GetGraphicObject() );\n\n            if( SVX_GRAPHICFILTER_ERRCODE_NONE ==\n                SvxGraphicFilter::ExecuteGrfFilterSlot( rReq, aFilterObj ) )\n            {\n                SdrPageView* pPageView = pView->GetPageViewPvNum( 0 );\n\n                if( pPageView )\n                {\n                    SdrGrafObj* pFilteredObj = (SdrGrafObj*) pObj->Clone();\n                    String      aStr( pView->GetDescriptionOfMarkedObjects() );\n\n                    aStr.Append( sal_Unicode(' ') );\n                    aStr.Append( String( SdResId( STR_UNDO_GRAFFILTER ) ) );\n                    pView->BegUndo( aStr );\n                    pFilteredObj->SetGraphicObject( aFilterObj );\n                    pView->ReplaceObject( pObj, *pPageView, pFilteredObj );\n                    pView->EndUndo();\n                }\n            }\n        }\n    }\n\n    Invalidate();\n}\n\n} \/\/ end of namespace sd\n<commit_msg>INTEGRATION: CWS viewswitch (1.5.70); FILE MERGED 2005\/11\/17 15:11:34 af 1.5.70.1: #i57551# Tool bar is now managed by ToolBarManager.<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: GraphicObjectBar.cxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: obo $ $Date: 2006-03-21 17:36: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#include \"GraphicObjectBar.hxx\"\n\n#include <limits.h>\n#include <vcl\/msgbox.hxx>\n#include <svtools\/whiter.hxx>\n#include <svtools\/itempool.hxx>\n#ifndef _SFXAPP_HXX\n#include <sfx2\/app.hxx>\n#endif\n#ifndef _SFX_SHELL_HXX \/\/autogen\n#include <sfx2\/shell.hxx>\n#endif\n#ifndef _SVXIDS_HRC\n#include <svx\/svxids.hrc>\n#endif\n#ifndef _SFXREQUEST_HXX \/\/autogen\n#include <sfx2\/request.hxx>\n#endif\n#ifndef _BASEDLGS_HXX\n#include <sfx2\/basedlgs.hxx>\n#endif\n#ifndef _SVDOPATH_HXX \/\/autogen\n#include <svx\/svdograf.hxx>\n#endif\n#ifndef _SVX_GRFFLT_HXX \/\/autogen\n#include <svx\/grfflt.hxx>\n#endif\n#ifndef _AEITEM_HXX \/\/autogen\n#include <svtools\/aeitem.hxx>\n#endif\n#ifndef _SVX_GRAFCTRL_HXX\n#include <svx\/grafctrl.hxx>\n#endif\n\n#pragma hdrstop\n\n#include <sfx2\/objface.hxx>\n\n#include \"app.hrc\"\n#include \"res_bmp.hrc\"\n#include \"glob.hrc\"\n#include \"strings.hrc\"\n#include \"DrawDocShell.hxx\"\n#ifndef SD_VIEW_SHELL_HXX\n#include \"ViewShell.hxx\"\n#endif\n#ifndef SD_WINDOW_HXX\n#include \"Window.hxx\"\n#endif\n#ifndef SD_DRAW_VIEW_HXX\n#include \"drawview.hxx\"\n#endif\n#include \"sdresid.hxx\"\n#include \"drawdoc.hxx\"\n\nusing namespace sd;\n#define GraphicObjectBar\n#include \"sdslots.hxx\"\n\nnamespace sd {\n\n\nSFX_DECL_TYPE( 13 );\n\n\n\/\/ -----------------------\n\/\/ - GraphicObjectBar -\n\/\/ -----------------------\n\nSFX_IMPL_INTERFACE( GraphicObjectBar, SfxShell, SdResId( STR_GRAFOBJECTBARSHELL ) )\n{\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nTYPEINIT1( GraphicObjectBar, SfxShell );\n\n\/\/ -----------------------------------------------------------------------------\n\nGraphicObjectBar::GraphicObjectBar (\n    ViewShell* pSdViewShell,\n    ::sd::View* pSdView )\n    : SfxShell (pSdViewShell->GetViewShell()),\n      pView  ( pSdView ),\n      pViewSh ( pSdViewShell ),\n      nMappedSlotFilter ( SID_GRFFILTER_INVERT )\n{\n    DrawDocShell* pDocShell = pViewSh->GetDocSh();\n\n    SetPool( &pDocShell->GetPool() );\n    SetUndoManager( pDocShell->GetUndoManager() );\n    SetRepeatTarget( pView );\n    SetHelpId( SD_IF_SDDRAWGRAFOBJECTBAR );\n    SetName( String( RTL_CONSTASCII_USTRINGPARAM( \"Graphic objectbar\" )));\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nGraphicObjectBar::~GraphicObjectBar()\n{\n    SetRepeatTarget( NULL );\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nvoid GraphicObjectBar::GetAttrState( SfxItemSet& rSet )\n{\n    if( pView )\n        SvxGrafAttrHelper::GetGrafAttrState( rSet, *pView );\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nvoid GraphicObjectBar::Execute( SfxRequest& rReq )\n{\n    if( pView )\n    {\n        SvxGrafAttrHelper::ExecuteGrafAttr( rReq, *pView );\n        Invalidate();\n    }\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nvoid GraphicObjectBar::GetFilterState( SfxItemSet& rSet )\n{\n    const SdrMarkList&  rMarkList = pView->GetMarkedObjectList();\n    BOOL                bEnable = FALSE;\n\n    if( rMarkList.GetMarkCount() == 1 )\n    {\n        SdrObject* pObj = rMarkList.GetMark( 0 )->GetObj();\n\n        if( pObj && pObj->ISA( SdrGrafObj ) && ( ( (SdrGrafObj*) pObj )->GetGraphicType() == GRAPHIC_BITMAP ) )\n            bEnable = TRUE;\n    }\n\n    if( !bEnable )\n        SvxGraphicFilter::DisableGraphicFilterSlots( rSet );\n}\n\n\/\/ -----------------------------------------------------------------------------\n\nvoid GraphicObjectBar::ExecuteFilter( SfxRequest& rReq )\n{\n    const SdrMarkList& rMarkList = pView->GetMarkedObjectList();\n\n    if( rMarkList.GetMarkCount() == 1 )\n    {\n        SdrObject* pObj = rMarkList.GetMark( 0 )->GetObj();\n\n        if( pObj && pObj->ISA( SdrGrafObj ) && ( (SdrGrafObj*) pObj )->GetGraphicType() == GRAPHIC_BITMAP )\n        {\n            GraphicObject aFilterObj( ( (SdrGrafObj*) pObj )->GetGraphicObject() );\n\n            if( SVX_GRAPHICFILTER_ERRCODE_NONE ==\n                SvxGraphicFilter::ExecuteGrfFilterSlot( rReq, aFilterObj ) )\n            {\n                SdrPageView* pPageView = pView->GetPageViewPvNum( 0 );\n\n                if( pPageView )\n                {\n                    SdrGrafObj* pFilteredObj = (SdrGrafObj*) pObj->Clone();\n                    String      aStr( pView->GetDescriptionOfMarkedObjects() );\n\n                    aStr.Append( sal_Unicode(' ') );\n                    aStr.Append( String( SdResId( STR_UNDO_GRAFFILTER ) ) );\n                    pView->BegUndo( aStr );\n                    pFilteredObj->SetGraphicObject( aFilterObj );\n                    pView->ReplaceObject( pObj, *pPageView, pFilteredObj );\n                    pView->EndUndo();\n                }\n            }\n        }\n    }\n\n    Invalidate();\n}\n\n} \/\/ end of namespace sd\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Created by rahul on 4\/8\/17.\n\/\/\n\n\/\/ #include \"typtop.h\"\n\/\/ #include \"catch.hpp\"\n\n#define DEBUG 1\n#ifdef __APPLE__\n#include <security\/pam_appl.h>\n#include <security\/openpam.h>\n#else\n#include <security\/pam_misc.h>\n#include <security\/pam_ext.h>\n#endif\n\n#include <stdio.h>\n#include <fstream>\n#include <iostream>\n#include <vector>\n#include <dirent.h>\n#include <libgen.h>\n#include \"catch.hpp\"\n#include \"typtopconfig.h\"\n#include <stdlib.h>\n\nusing namespace std;\n\nint conv_func(int num_msg, const struct pam_message **msg,\n              struct pam_response **resp, void *appdata_ptr) {\n    resp[0] = new struct pam_response[num_msg];\n    for (int i = 0; i < num_msg; i++) {\n        if (msg[i]->msg_style == PAM_PROMPT_ECHO_OFF) {\n            resp[i]->resp = strdup((char *) appdata_ptr);\n            resp[i]->resp_retcode = 0;\n        }\n    }\n    return 0;\n}\n\nint auth(const char *user, const char *password) {\n    pam_handle_t *pamh = NULL;\n    int retval;\n    \/\/ REQUIRE(freopen(PASS_FILE, \"r\", stdin) != NULL);\n    struct pam_conv conv = {conv_func, (void *) password};\n    retval = pam_start(\"su\", user, &conv, &pamh);\n    if (retval == PAM_SUCCESS)\n        retval = pam_authenticate(pamh, 0);    \/* is user really user? *\/\n    string pw;\n\n    if (retval == PAM_SUCCESS)\n        retval = pam_acct_mgmt(pamh, 0);       \/* permitted access? *\/\n    \/* This is where we have been authorized or not. *\/\n    if (pam_end(pamh, retval) != PAM_SUCCESS) {     \/* close Linux-PAM *\/\n        pamh = NULL;\n        fprintf(stderr, \"su: failed to release authenticator\\n\");\n        exit(1);\n    }\n\n    return (retval == PAM_SUCCESS);       \/* indicate success *\/\n}\n\nconst vector<string> pws = {\n        \"hello_pass\", \/\/ 0, ed=0\n        \"Hello_pass\",  \/\/ 1, ed=1\n        \"hello_pass1\", \/\/ 2, ed=1\n        \"HELLO_PASS\",  \/\/ 3, ed=1\n        \"hlelo_pass\", \/\/ 4, ed=1\n        \"Hello_Pass\",  \/\/ 5, ed=2\n};\nconst string user = \"tmptyptop\";\n\nTEST_CASE(\"Check Install\") {\n    const string prepare = \"sudo useradd tmptyptop -p $(openssl passwd -crypt hello_pass)\"\n            \" && sudo rm -rf \/usr\/local\/etc\/typtop.d\/tmptyptop\";\n    SECTION(\"Basic\") {\n        int i = 0;\n        for (string pw: pws) {\n            if (i <= 3) {\n                cerr << \"Trying \" << i << \" \" << user << \" \" << pw << endl;\n                REQUIRE(auth(user.c_str(), pw.c_str()));\n            } else {\n                REQUIRE_FALSE(auth(user.c_str(), pw.c_str()));\n            }\n            i++;\n        }\n        auth(user.c_str(), pws[4].c_str());\n        auth(user.c_str(), pws[4].c_str());\n        auth(user.c_str(), pws[4].c_str());\n        auth(user.c_str(), pws[4].c_str());\n        auth(user.c_str(), pws[4].c_str());\n        auth(user.c_str(), pws[4].c_str());\n        REQUIRE(auth(user.c_str(), pws[1].c_str()));\n        REQUIRE(auth(user.c_str(), pws[4].c_str()));\n    }\n}\n\nTEST_CASE(\"Check Uninstall\") {\n    const char* cmd = (const char*)\"sudo typtop --uninstall -y\";\n    system(cmd);\n    \/\/ REQUIRE_FALSE(opendir(USERDB_LOC));\n    REQUIRE(auth(user.c_str(), pws[0].c_str()));\n    REQUIRE_FALSE(auth(user.c_str(), pws[1].c_str()));\n    REQUIRE_FALSE(auth(user.c_str(), pws[2].c_str()));\n    REQUIRE_FALSE(auth(user.c_str(), pws[3].c_str()));\n    REQUIRE_FALSE(auth(user.c_str(), pws[4].c_str()));\n}\n\n\/\/\n\/\/int main(int argc, char *argv[])\n\/\/{\n\/\/   const char *user=\"nobody\";\n\/\/\n\/\/   if (argc < 3) {\n\/\/       cout << \"USAGE: \" << argv[0] << \" <user> <password>\" << endl;\n\/\/       return -1;\n\/\/   }\n\/\/   user = argv[1];\n\/\/   const char *pw = argv[2];\n\/\/   cout << \"Pw: \" << pw << \"-->\" << auth(user, pw) << endl;\n\/\/   return 0;\n\/\/}\n<commit_msg>No idea what's wrong with the install uninstall tests<commit_after>\/\/\n\/\/ Created by rahul on 4\/8\/17.\n\/\/\n\n\/\/ #include \"typtop.h\"\n\/\/ #include \"catch.hpp\"\n\n#define DEBUG 1\n#ifdef __APPLE__\n#include <security\/pam_appl.h>\n#include <security\/openpam.h>\n#else\n#include <security\/pam_misc.h>\n#include <security\/pam_ext.h>\n#endif\n\n#include <stdio.h>\n#include <fstream>\n#include <iostream>\n#include <vector>\n#include <dirent.h>\n#include <libgen.h>\n#include \"catch.hpp\"\n#include \"typtopconfig.h\"\n#include <stdlib.h>\n\nusing namespace std;\nconst char* cmd_uninstall = (const char*)\"sudo bash \/usr\/local\/bin\/typtop.prerm\";\nconst char* cmd_install = (const char*)\"sudo bash \/usr\/local\/bin\/typtop.postinst\";\n\nint conv_func(int num_msg, const struct pam_message **msg,\n              struct pam_response **resp, void *appdata_ptr) {\n    resp[0] = new struct pam_response[num_msg];\n    for (int i = 0; i < num_msg; i++) {\n        if (msg[i]->msg_style == PAM_PROMPT_ECHO_OFF) {\n            resp[i]->resp = strdup((char *) appdata_ptr);\n            resp[i]->resp_retcode = 0;\n        }\n    }\n    return 0;\n}\n\nint auth(const char *user, const char *password) {\n    pam_handle_t *pamh = NULL;\n    int retval;\n    \/\/ REQUIRE(freopen(PASS_FILE, \"r\", stdin) != NULL);\n    struct pam_conv conv = {conv_func, (void *) password};\n    retval = pam_start(\"su\", user, &conv, &pamh);\n    if (retval == PAM_SUCCESS)\n        retval = pam_authenticate(pamh, 0);    \/* is user really user? *\/\n    string pw;\n\n    if (retval == PAM_SUCCESS)\n        retval = pam_acct_mgmt(pamh, 0);       \/* permitted access? *\/\n    \/* This is where we have been authorized or not. *\/\n    if (pam_end(pamh, retval) != PAM_SUCCESS) {     \/* close Linux-PAM *\/\n        pamh = NULL;\n        fprintf(stderr, \"su: failed to release authenticator\\n\");\n        exit(1);\n    }\n    return (retval == PAM_SUCCESS);       \/* indicate success *\/\n}\n\nconst vector<string> pws = {\n        \"hello_pass\", \/\/ 0, ed=0\n        \"Hello_pass\",  \/\/ 1, ed=1\n        \"hello_pass1\", \/\/ 2, ed=1\n        \"HELLO_PASS\",  \/\/ 3, ed=1\n        \"hlelo_pass\", \/\/ 4, ed=1\n        \"Hello_Pass\",  \/\/ 5, ed=2\n};\nconst string user = \"tmptyptop\";\n\nTEST_CASE(\"Check Install\") {\n    const string prepare = \"sudo useradd tmptyptop -p $(openssl passwd -crypt hello_pass)\"\n            \" && sudo rm -rf \/usr\/local\/etc\/typtop.d\/tmptyptop\";\n    system(cmd_install);\n    SECTION(\"Basic\") {\n        int i = 0;\n        for (string pw: pws) {\n            if (i <= 3) {\n                cerr << \"Trying \" << i << \" \" << user << \" \" << pw << endl;\n                REQUIRE(auth(user.c_str(), pw.c_str()));\n            } else {\n                REQUIRE_FALSE(auth(user.c_str(), pw.c_str()));\n            }\n            i++;\n        }\n        auth(user.c_str(), pws[4].c_str());\n        auth(user.c_str(), pws[4].c_str());\n        auth(user.c_str(), pws[4].c_str());\n        auth(user.c_str(), pws[4].c_str());\n        auth(user.c_str(), pws[4].c_str());\n        auth(user.c_str(), pws[4].c_str());\n        REQUIRE(auth(user.c_str(), pws[1].c_str()));\n        REQUIRE(auth(user.c_str(), pws[4].c_str()));\n    }\n}\n\nTEST_CASE(\"Check Uninstall\") {\n    system(cmd_uninstall);\n    \/\/ REQUIRE_FALSE(opendir(USERDB_LOC));\n    REQUIRE(auth(user.c_str(), pws[0].c_str()));\n    REQUIRE_FALSE(auth(user.c_str(), pws[1].c_str()));\n    REQUIRE_FALSE(auth(user.c_str(), pws[2].c_str()));\n    REQUIRE_FALSE(auth(user.c_str(), pws[3].c_str()));\n    REQUIRE_FALSE(auth(user.c_str(), pws[4].c_str()));\n    system(cmd_install);\n    REQUIRE(auth(user.c_str(), pws[1].c_str()));\n}\n\n\/\/\n\/\/int main(int argc, char *argv[])\n\/\/{\n\/\/   const char *user=\"nobody\";\n\/\/\n\/\/   if (argc < 3) {\n\/\/       cout << \"USAGE: \" << argv[0] << \" <user> <password>\" << endl;\n\/\/       return -1;\n\/\/   }\n\/\/   user = argv[1];\n\/\/   const char *pw = argv[2];\n\/\/   cout << \"Pw: \" << pw << \"-->\" << auth(user, pw) << endl;\n\/\/   return 0;\n\/\/}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- FuzzerUtil.cpp - Misc utils ----------------------------------------===\/\/\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\/\/ Misc utils.\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"FuzzerInternal.h\"\n#include <iostream>\n#include <sys\/time.h>\n#include <cassert>\n#include <cstring>\n#include <signal.h>\n\nnamespace fuzzer {\n\nvoid Print(const Unit &v, const char *PrintAfter) {\n  for (auto x : v)\n    std::cerr << \"0x\" << std::hex << (unsigned) x << std::dec << \",\";\n  std::cerr << PrintAfter;\n}\n\nvoid PrintASCII(const Unit &U, const char *PrintAfter) {\n  for (auto X : U) {\n    if (isprint(X))\n      std::cerr << X;\n    else\n      std::cerr << \"\\\\x\" << std::hex << (int)(unsigned)X << std::dec;\n  }\n  std::cerr << PrintAfter;\n}\n\nstd::string Hash(const Unit &in) {\n  size_t h1 = 0, h2 = 0;\n  for (auto x : in) {\n    h1 += x;\n    h1 *= 5;\n    h2 += x;\n    h2 *= 7;\n  }\n  return std::to_string(h1) + std::to_string(h2);\n}\n\nstatic void AlarmHandler(int, siginfo_t *, void *) {\n  Fuzzer::StaticAlarmCallback();\n}\n\nvoid SetTimer(int Seconds) {\n  struct itimerval T {{Seconds, 0}, {Seconds, 0}};\n  std::cerr << \"SetTimer \" << Seconds << \"\\n\";\n  int Res = setitimer(ITIMER_REAL, &T, nullptr);\n  assert(Res == 0);\n  struct sigaction sigact;\n  memset(&sigact, 0, sizeof(sigact));\n  sigact.sa_sigaction = AlarmHandler;\n  Res = sigaction(SIGALRM, &sigact, 0);\n  assert(Res == 0);\n}\n\nint NumberOfCpuCores() {\n  FILE *F = popen(\"nproc\", \"r\");\n  int N = 0;\n  fscanf(F, \"%d\", &N);\n  fclose(F);\n  return N;\n}\n\n}  \/\/ namespace fuzzer\n<commit_msg>[lib\/Fuzzer] use sha1sum for the file hash<commit_after>\/\/===- FuzzerUtil.cpp - Misc utils ----------------------------------------===\/\/\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\/\/ Misc utils.\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"FuzzerInternal.h\"\n#include <iostream>\n#include <sys\/time.h>\n#include <cassert>\n#include <cstring>\n#include <signal.h>\n#include <unistd.h>\n\nnamespace fuzzer {\n\nvoid Print(const Unit &v, const char *PrintAfter) {\n  for (auto x : v)\n    std::cerr << \"0x\" << std::hex << (unsigned) x << std::dec << \",\";\n  std::cerr << PrintAfter;\n}\n\nvoid PrintASCII(const Unit &U, const char *PrintAfter) {\n  for (auto X : U) {\n    if (isprint(X))\n      std::cerr << X;\n    else\n      std::cerr << \"\\\\x\" << std::hex << (int)(unsigned)X << std::dec;\n  }\n  std::cerr << PrintAfter;\n}\n\n\/\/ Try to compute a SHA1 sum of this Unit using an external 'sha1sum' command.\n\/\/ We can not use the SHA1 function from openssl directly because\n\/\/  a) openssl may not be available,\n\/\/  b) we may be fuzzing openssl itself.\n\/\/ This is all very sad, suggestions are welcome.\nstatic std::string TrySha1(const Unit &in) {\n  char TempPath[] = \"\/tmp\/fuzzer-tmp-XXXXXX\";\n  int FD = mkstemp(TempPath);\n  if (FD < 0) return \"\";\n  ssize_t Written = write(FD, in.data(), in.size());\n  close(FD);\n  if (static_cast<size_t>(Written) != in.size()) return \"\";\n\n  std::string Cmd = \"sha1sum < \";\n  Cmd += TempPath;\n  FILE *F = popen(Cmd.c_str(), \"r\");\n  if (!F) return \"\";\n  char Sha1[41];\n  fgets(Sha1, sizeof(Sha1), F);\n  fclose(F);\n\n  unlink(TempPath);\n  return Sha1;\n}\n\nstd::string Hash(const Unit &in) {\n  std::string Sha1 = TrySha1(in);\n  if (!Sha1.empty())\n    return Sha1;\n\n  size_t h1 = 0, h2 = 0;\n  for (auto x : in) {\n    h1 += x;\n    h1 *= 5;\n    h2 += x;\n    h2 *= 7;\n  }\n  return std::to_string(h1) + std::to_string(h2);\n}\n\nstatic void AlarmHandler(int, siginfo_t *, void *) {\n  Fuzzer::StaticAlarmCallback();\n}\n\nvoid SetTimer(int Seconds) {\n  struct itimerval T {{Seconds, 0}, {Seconds, 0}};\n  std::cerr << \"SetTimer \" << Seconds << \"\\n\";\n  int Res = setitimer(ITIMER_REAL, &T, nullptr);\n  assert(Res == 0);\n  struct sigaction sigact;\n  memset(&sigact, 0, sizeof(sigact));\n  sigact.sa_sigaction = AlarmHandler;\n  Res = sigaction(SIGALRM, &sigact, 0);\n  assert(Res == 0);\n}\n\nint NumberOfCpuCores() {\n  FILE *F = popen(\"nproc\", \"r\");\n  int N = 0;\n  fscanf(F, \"%d\", &N);\n  fclose(F);\n  return N;\n}\n\n}  \/\/ namespace fuzzer\n<|endoftext|>"}
{"text":"<commit_before>#include \"bandit_base.h\"\n#include \"msg.h\"\n\ngo_bandit([]()\n{\n    describe(\"Msg with `Hello %s.`\", []()\n    {\n        PtrT<Msg> pMsg;\n        before_each([&]() {\n            pMsg.reset(new Msg(\"Hello %s\"));\n        });\n\n        describe(\"Msg::str\", [&]() {\n            it(\"adds world\", [&](){\n                pMsg->add(\"world\");\n                AssertThat(pMsg->str(), Equals(\"Hello world.\"));\n            });\n\n            it(\"adds John\", [&](){\n                pMsg->add(\"John\");\n                AssertThat(pMsg->str(), Equals(\"Hello John.\"));\n            });\n        });\n\n    });\n\n    describe(\"args counts\", [&]() {\n        it(\"runs case 1\", [&]() {\n            AssertThat(Msg(\"%s %s\").count_format_count(), Equals(2));\n        });\n    });\n});\n<commit_msg>add more test for no arg<commit_after>#include \"bandit_base.h\"\n#include \"msg.h\"\n\ngo_bandit([]()\n{\n    describe(\"Msg with `Hello %s.`\", []()\n    {\n        PtrT<Msg> pMsg;\n        before_each([&]() {\n            pMsg.reset(new Msg(\"Hello %s\"));\n        });\n\n        describe(\"Msg::str\", [&]() {\n            it(\"adds world\", [&](){\n                pMsg->add(\"world\");\n                AssertThat(pMsg->str(), Equals(\"Hello world.\"));\n            });\n\n            it(\"adds John\", [&](){\n                pMsg->add(\"John\");\n                AssertThat(pMsg->str(), Equals(\"Hello John.\"));\n            });\n        });\n\n    });\n\n    describe(\"args counts\", [&]() {\n        it(\"runs no args\", [&]() {\n            AssertThat(Msg(\"%% %%\").count_format_count(), Equals(0));\n            AssertThat(Msg(\"abc abc %% %%\").count_format_count(), Equals(0));\n            AssertThat(Msg(\"dce de%%\").count_format_count(), Equals(0));\n            AssertThat(Msg(\"asflkjsafklw\").count_format_count(), Equals(0));\n            AssertThat(Msg(\"%d %d %% %f %f %f\").count_format_count(), Equals(0));\n        });\n    });\n});\n<|endoftext|>"}
{"text":"<commit_before>#include <pthread.h>\n#include <string.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ TIMING\n\ntypedef unsigned long long LOG_TimeUnit;\n\nstatic inline LOG_TimeUnit LOG_getTimeStart() {\n  unsigned hi, lo;\n\n  __asm__ __volatile__ (\"cpuid\\n\"\n                        \"rdtsc\\n\"\n         : \"=a\" (lo), \"=d\" (hi)\n         :: \"%rbx\", \"%rcx\");\n  return ( (unsigned long long)lo)|( ((unsigned long long)hi)<<32 );\n}\n\nstatic inline LOG_TimeUnit LOG_getTimeStop() {\n  unsigned hi, lo;\n\n  __asm__ __volatile__ (\"rdtscp\\n\"\n                        \"mov %%edx, %0\\n\\t\"\n                        \"mov %%eax, %1\\n\\t\"\n                        \"cpuid\\n\"\n          : \"=r\" (hi), \"=r\" (lo)\n          :: \"%rax\", \"%rbx\", \"%rcx\", \"%rdx\");\n  return ( (unsigned long long)lo)|( ((unsigned long long)hi)<<32 );\n}\n\n#ifdef LOGGING\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ LOGGING\n\n#define LOG_MAX_ENTRIES 1000000\n\nstatic inline unsigned long LOG_getThread() {\n  return pthread_self();\n}\n\ntypedef struct {\n  LOG_TimeUnit start, length;\n  char text[64 - 2*sizeof(LOG_TimeUnit)- sizeof(unsigned long)];\n  unsigned long thread;\n} LOG_entry;\n\nLOG_entry LOG_data[LOG_MAX_ENTRIES];\nsize_t LOG_ptr;\n\nvoid LOG_init() {\n}\n\nstatic inline void LOG_add(const char *text, LOG_TimeUnit start, LOG_TimeUnit stop) {\n  size_t i = __sync_fetch_and_add(&LOG_ptr, 1);\n  strcpy(LOG_data[i].text, text);\n  LOG_data[i].start = start;\n  LOG_data[i].length = stop-start;\n  LOG_data[i].thread = LOG_getThread();\n}\n\nstatic void LOG_dump(const char *filename) {\n  FILE *out = fopen(filename, \"w\");\n  fprintf(out, \"LOG 2\\n\");\n  LOG_TimeUnit minimum = LOG_data[0].start;\n  for (size_t i = 0; i < LOG_ptr; ++i) {\n      if (LOG_data[i].start < minimum)\n          minimum = LOG_data[i].start;\n  }\n  for (size_t i = 0; i < LOG_ptr; ++i) {\n      fprintf(out, \"%lu: %lld %lld %s\\n\",\n              LOG_data[i].thread,\n              LOG_data[i].start-minimum,\n              LOG_data[i].length,\n              LOG_data[i].text);\n  }\n  fclose(out);\n}\n\n#ifdef LOGGING_PERF\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ PERFORMANCE_COUNTERS\n\nint LOG_fd;\n\nunsigned long long LOG_readCounter() {\n    unsigned long long count;\n    size_t res = read(LOG_fd, &count, sizeof(unsigned long long));\n    if (res != sizeof(unsigned long long)) {\n        fprintf(stderr, \"read() failed %d\", res);\n        exit(1);\n    }\n    return count;\n}\n\nvoid LOG_init_perf(unsigned int type, unsigned long long config) {\n    struct perf_event_attr attr = {0};\n    attr.type = type;\n    attr.config = config;\n    attr.inherit = 1;\n    attr.disabled = 1;\n    attr.size = sizeof(struct perf_event_attr);\n    LOG_fd = syscall(__NR_perf_event_open, attr, 0, -1, -1, 0);\n\n    if (LOG_fd < 0) {\n        fprintf(stderr, \"sys_perf_event_open failed %d\", fd);\n        exit(1);\n    }\n}\n\nunsigned long long LOG_getCacheStart() {\n    unsigned long long count;\n    count = LOG_readCounter();\n    ioctl(fd, PERF_EVENT_IOC_ENABLE);\n    return count;\n}\nunsigned long long LOG_getCacheStop() {\n    unsigned long long count;\n    ioctl(fd, PERF_EVENT_IOC_DISABLE);\n    count = LOG_readCounter();\n    return count;\n}\n\n#else \/\/ LOGGING_PERF\n#define LOG_init_perf(a,b)\n#define LOG_getCacheStart() 0\n#define LOG_getCacheStop() 0\n#endif\n\n#else \/\/ LOGGING\n#define LOG_add(a,b,c)\n#define LOG_dump(a)\n#define LOG_init_perf(a,b)\n#define LOG_getCacheStart() 0\n#define LOG_getCacheStop() 0\n#endif\n<commit_msg>Wrong variable name. Didn't even compile. Fixed.<commit_after>#include <pthread.h>\n#include <string.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ TIMING\n\ntypedef unsigned long long LOG_TimeUnit;\n\nstatic inline LOG_TimeUnit LOG_getTimeStart() {\n  unsigned hi, lo;\n\n  __asm__ __volatile__ (\"cpuid\\n\"\n                        \"rdtsc\\n\"\n         : \"=a\" (lo), \"=d\" (hi)\n         :: \"%rbx\", \"%rcx\");\n  return ( (unsigned long long)lo)|( ((unsigned long long)hi)<<32 );\n}\n\nstatic inline LOG_TimeUnit LOG_getTimeStop() {\n  unsigned hi, lo;\n\n  __asm__ __volatile__ (\"rdtscp\\n\"\n                        \"mov %%edx, %0\\n\\t\"\n                        \"mov %%eax, %1\\n\\t\"\n                        \"cpuid\\n\"\n          : \"=r\" (hi), \"=r\" (lo)\n          :: \"%rax\", \"%rbx\", \"%rcx\", \"%rdx\");\n  return ( (unsigned long long)lo)|( ((unsigned long long)hi)<<32 );\n}\n\n#ifdef LOGGING\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ LOGGING\n\n#define LOG_MAX_ENTRIES 1000000\n\nstatic inline unsigned long LOG_getThread() {\n  return pthread_self();\n}\n\ntypedef struct {\n  LOG_TimeUnit start, length;\n  char text[64 - 2*sizeof(LOG_TimeUnit)- sizeof(unsigned long)];\n  unsigned long thread;\n} LOG_entry;\n\nLOG_entry LOG_data[LOG_MAX_ENTRIES];\nsize_t LOG_ptr;\n\nvoid LOG_init() {\n}\n\nstatic inline void LOG_add(const char *text, LOG_TimeUnit start, LOG_TimeUnit stop) {\n  size_t i = __sync_fetch_and_add(&LOG_ptr, 1);\n  strcpy(LOG_data[i].text, text);\n  LOG_data[i].start = start;\n  LOG_data[i].length = stop-start;\n  LOG_data[i].thread = LOG_getThread();\n}\n\nstatic void LOG_dump(const char *filename) {\n  FILE *out = fopen(filename, \"w\");\n  fprintf(out, \"LOG 2\\n\");\n  LOG_TimeUnit minimum = LOG_data[0].start;\n  for (size_t i = 0; i < LOG_ptr; ++i) {\n      if (LOG_data[i].start < minimum)\n          minimum = LOG_data[i].start;\n  }\n  for (size_t i = 0; i < LOG_ptr; ++i) {\n      fprintf(out, \"%lu: %lld %lld %s\\n\",\n              LOG_data[i].thread,\n              LOG_data[i].start-minimum,\n              LOG_data[i].length,\n              LOG_data[i].text);\n  }\n  fclose(out);\n}\n\n#ifdef LOGGING_PERF\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ PERFORMANCE_COUNTERS\n\nint LOG_fd;\n\nunsigned long long LOG_readCounter() {\n    unsigned long long count;\n    size_t res = read(LOG_fd, &count, sizeof(unsigned long long));\n    if (res != sizeof(unsigned long long)) {\n        fprintf(stderr, \"read() failed %d\", res);\n        exit(1);\n    }\n    return count;\n}\n\nvoid LOG_init_perf(unsigned int type, unsigned long long config) {\n    struct perf_event_attr attr = {0};\n    attr.type = type;\n    attr.config = config;\n    attr.inherit = 1;\n    attr.disabled = 1;\n    attr.size = sizeof(struct perf_event_attr);\n    LOG_fd = syscall(__NR_perf_event_open, attr, 0, -1, -1, 0);\n\n    if (LOG_fd < 0) {\n        fprintf(stderr, \"sys_perf_event_open failed %d\", fd);\n        exit(1);\n    }\n}\n\nunsigned long long LOG_getCacheStart() {\n    unsigned long long count;\n    count = LOG_readCounter();\n    ioctl(LOG_fd, PERF_EVENT_IOC_ENABLE);\n    return count;\n}\nunsigned long long LOG_getCacheStop() {\n    unsigned long long count;\n    ioctl(LOG_fd, PERF_EVENT_IOC_DISABLE);\n    count = LOG_readCounter();\n    return count;\n}\n\n#else \/\/ LOGGING_PERF\n#define LOG_init_perf(a,b)\n#define LOG_getCacheStart() 0\n#define LOG_getCacheStop() 0\n#endif\n\n#else \/\/ LOGGING\n#define LOG_add(a,b,c)\n#define LOG_dump(a)\n#define LOG_init_perf(a,b)\n#define LOG_getCacheStart() 0\n#define LOG_getCacheStop() 0\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * Copyright (c) 2011-2015 libbitcoin developers (see AUTHORS)\n *\n * This file is part of libbitcoin.\n *\n * libbitcoin 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#include \"bip38.hpp\"\n\n#include <algorithm>\n#include <string>\n#include <boost\/test\/unit_test.hpp>\n#include <bitcoin\/bitcoin.hpp>\n\nusing namespace bc;\nusing namespace bc::wallet;\n\n\/\/ TODO: implement testnet tests.\n\n#ifndef ENABLE_TESTNET\n\nBOOST_AUTO_TEST_SUITE(bip38_tests)\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nBOOST_AUTO_TEST_SUITE(bip38__create_token)\n\nstatic void test_create_token(\/* const bip38_vector& vector *\/)\n{\n    \/\/ TODO\n}\n\n\/\/ TODO: add test vectors for create_token.\nBOOST_AUTO_TEST_CASE(bip38__create_token__always__throws)\n{\n    test_create_token(\/* vector *\/);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nBOOST_AUTO_TEST_SUITE(bip38__create_key_pair)\n\n\/\/ TODO: create compressed vector(s).\n\nstatic void test_create_key_pair(const bip38_vector& vector)\n{\n    bip38::token token;\n    BOOST_REQUIRE(decode_base58(token, vector.token));\n\n    bip38::seed seed;\n    BOOST_REQUIRE(decode_base16(seed, vector.seed));\n\n    ec_point point;\n    bip38::public_key public_key;\n    bip38::private_key private_key;\n    BOOST_REQUIRE(bip38::create_key_pair(private_key, public_key, point, token, seed, vector.version, vector.compressed));\n    BOOST_REQUIRE_EQUAL(encode_base58(public_key), vector.public_key);\n    BOOST_REQUIRE_EQUAL(encode_base58(private_key), vector.private_key);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__create_key_pair__vector_8__expected)\n{\n    test_create_key_pair(bip38_test_vector8);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__create_key_pair__vector_9__expected)\n{\n    test_create_key_pair(bip38_test_vector9);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n#ifdef WITH_ICU\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nBOOST_AUTO_TEST_SUITE(bip38__encrypt)\n\nstatic void test_encrypt(const bip38_vector& vector)\n{\n    ec_secret secret;\n    BOOST_REQUIRE(decode_base16(secret, vector.ec_secret));\n\n    bip38::private_key private_key;\n    bip38::encrypt(private_key, secret, vector.passphrase, vector.version, vector.compressed);\n    BOOST_REQUIRE_EQUAL(encode_base58(private_key), vector.private_key);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__encrypt__vector_0__expected)\n{\n    test_encrypt(bip38_test_vector0);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__encrypt__vector_1__expected)\n{\n    test_encrypt(bip38_test_vector1);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__encrypt__vector_2_compressed__expected)\n{\n    test_encrypt(bip38_test_vector2);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__encrypt__vector_3_compressed__expected)\n{\n    test_encrypt(bip38_test_vector3);\n}\n\n\/\/ #3 from: github.com\/bitcoin\/bips\/blob\/master\/bip-0038.mediawiki#no-compression-no-ec-multiply\nBOOST_AUTO_TEST_CASE(bip38__encrypt__vector_unicode___expected)\n{\n    \/\/ This vector encodes as the passphrase as base16.\n    bip38_vector vector;\n    vector.passphrase = \"cf92cc8100f0909080f09f92a9\";\n    vector.ec_secret = \"64eeab5f9be2a01a8365a579511eb3373c87c40da6d2a25f05bda68fe077b66e\";\n    vector.private_key = \"6PRW5o9FLp4gJDDVqJQKJFTpMvdsSGJxMYHtHaQBF3ooa8mwD69bapcDQn\";\n    \/\/\/\/vector.address = \"16ktGzmfrurhbhi6JGqsMWf7TyqK9HNAeF\";\n\n    data_chunk not_normalized;\n    BOOST_REQUIRE(decode_base16(not_normalized, vector.passphrase));\n    std::string passphrase(not_normalized.begin(), not_normalized.end());\n\n    ec_secret secret;\n    BOOST_REQUIRE(decode_base16(secret, vector.ec_secret));\n\n    bip38::private_key private_key;\n    bip38::encrypt(private_key, secret, passphrase, false);\n    BOOST_REQUIRE_EQUAL(encode_base58(private_key), vector.private_key);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nBOOST_AUTO_TEST_SUITE(bip38__decrypt1)\n\n\/\/ TODO: create compressed + multiplied vector(s).\n\nstatic void test_decrypt1(const bip38_vector& vector)\n{\n    bip38::private_key private_key;\n    BOOST_REQUIRE(decode_base58(private_key, vector.private_key));\n\n    ec_secret secret;\n    uint8_t version;\n    bool compressed;\n    BOOST_REQUIRE(bip38::decrypt(secret, version, compressed, private_key, vector.passphrase));\n    BOOST_REQUIRE_EQUAL(encode_base16(secret), vector.ec_secret);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__decrypt1__vector_0__expected)\n{\n    test_decrypt1(bip38_test_vector0);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__decrypt1__vector_1__expected)\n{\n    test_decrypt1(bip38_test_vector1);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__decrypt1__vector_2_compressed__expected)\n{\n    test_decrypt1(bip38_test_vector2);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__decrypt1__vector_3_compressed__expected)\n{\n    test_decrypt1(bip38_test_vector3);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__decrypt1__vector_4_multiplied__expected)\n{\n    test_decrypt1(bip38_test_vector4);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__decrypt1__vector_5_multiplied__expected)\n{\n    test_decrypt1(bip38_test_vector5);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__decrypt1__vector_6_multiplied__expected)\n{\n    test_decrypt1(bip38_test_vector6);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__decrypt1__vector_7_multiplied__expected)\n{\n    test_decrypt1(bip38_test_vector7);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__decrypt1__vector_8_multiplied__expected)\n{\n    test_decrypt1(bip38_test_vector8);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__decrypt1__vector_9_multiplied__expected)\n{\n    test_decrypt1(bip38_test_vector9);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nBOOST_AUTO_TEST_SUITE(bip38__decrypt2)\n\n\/\/ TODO: create compressed vector(s).\n\nstatic void test_decrypt2(const bip38_vector& vector)\n{\n    bip38::public_key public_key;\n    BOOST_REQUIRE(decode_base58(public_key, vector.public_key));\n\n    ec_point point;\n    uint8_t out_version;\n    BOOST_REQUIRE(bip38::decrypt(point, out_version, public_key, vector.passphrase));\n    BOOST_REQUIRE_EQUAL(out_version, vector.version);\n\n    static const auto version = 0x00;\n    const auto expected = payment_address(version, point).to_string();\n    BOOST_REQUIRE_EQUAL(expected, vector.address);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__decrypt2__vector_8__expected)\n{\n    test_decrypt2(bip38_test_vector8);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__decrypt2__vector_9__expected)\n{\n    test_decrypt2(bip38_test_vector9);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#endif \/\/ WITH_ICU\n\nBOOST_AUTO_TEST_SUITE_END()\n\n#endif \/\/ !ENABLE_TESTNET\n<commit_msg>Patch unicode bip38 test vector.<commit_after>\/**\n * Copyright (c) 2011-2015 libbitcoin developers (see AUTHORS)\n *\n * This file is part of libbitcoin.\n *\n * libbitcoin 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#include \"bip38.hpp\"\n\n#include <algorithm>\n#include <string>\n#include <boost\/test\/unit_test.hpp>\n#include <bitcoin\/bitcoin.hpp>\n\nusing namespace bc;\nusing namespace bc::wallet;\n\n\/\/ TODO: implement testnet tests.\n\n#ifndef ENABLE_TESTNET\n\nBOOST_AUTO_TEST_SUITE(bip38_tests)\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nBOOST_AUTO_TEST_SUITE(bip38__create_token)\n\nstatic void test_create_token(\/* const bip38_vector& vector *\/)\n{\n    \/\/ TODO\n}\n\n\/\/ TODO: add test vectors for create_token.\nBOOST_AUTO_TEST_CASE(bip38__create_token__always__throws)\n{\n    test_create_token(\/* vector *\/);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nBOOST_AUTO_TEST_SUITE(bip38__create_key_pair)\n\n\/\/ TODO: create compressed vector(s).\n\nstatic void test_create_key_pair(const bip38_vector& vector)\n{\n    bip38::token token;\n    BOOST_REQUIRE(decode_base58(token, vector.token));\n\n    bip38::seed seed;\n    BOOST_REQUIRE(decode_base16(seed, vector.seed));\n\n    ec_point point;\n    bip38::public_key public_key;\n    bip38::private_key private_key;\n    BOOST_REQUIRE(bip38::create_key_pair(private_key, public_key, point, token, seed, vector.version, vector.compressed));\n    BOOST_REQUIRE_EQUAL(encode_base58(public_key), vector.public_key);\n    BOOST_REQUIRE_EQUAL(encode_base58(private_key), vector.private_key);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__create_key_pair__vector_8__expected)\n{\n    test_create_key_pair(bip38_test_vector8);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__create_key_pair__vector_9__expected)\n{\n    test_create_key_pair(bip38_test_vector9);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n#ifdef WITH_ICU\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nBOOST_AUTO_TEST_SUITE(bip38__encrypt)\n\nstatic void test_encrypt(const bip38_vector& vector)\n{\n    ec_secret secret;\n    BOOST_REQUIRE(decode_base16(secret, vector.ec_secret));\n\n    bip38::private_key private_key;\n    bip38::encrypt(private_key, secret, vector.passphrase, vector.version, vector.compressed);\n    BOOST_REQUIRE_EQUAL(encode_base58(private_key), vector.private_key);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__encrypt__vector_0__expected)\n{\n    test_encrypt(bip38_test_vector0);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__encrypt__vector_1__expected)\n{\n    test_encrypt(bip38_test_vector1);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__encrypt__vector_2_compressed__expected)\n{\n    test_encrypt(bip38_test_vector2);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__encrypt__vector_3_compressed__expected)\n{\n    test_encrypt(bip38_test_vector3);\n}\n\n\/\/ #3 from: github.com\/bitcoin\/bips\/blob\/master\/bip-0038.mediawiki#no-compression-no-ec-multiply\nBOOST_AUTO_TEST_CASE(bip38__encrypt__vector_unicode___expected)\n{\n    \/\/ This vector encodes as the passphrase as base16.\n    bip38_vector vector;\n    vector.version = 0x00;\n    vector.compressed = false;\n    vector.passphrase = \"cf92cc8100f0909080f09f92a9\";\n    vector.ec_secret = \"64eeab5f9be2a01a8365a579511eb3373c87c40da6d2a25f05bda68fe077b66e\";\n    vector.private_key = \"6PRW5o9FLp4gJDDVqJQKJFTpMvdsSGJxMYHtHaQBF3ooa8mwD69bapcDQn\";\n    \/\/\/\/vector.address = \"16ktGzmfrurhbhi6JGqsMWf7TyqK9HNAeF\";\n\n    data_chunk not_normalized;\n    BOOST_REQUIRE(decode_base16(not_normalized, vector.passphrase));\n    std::string passphrase(not_normalized.begin(), not_normalized.end());\n\n    const auto normal = to_normal_nfc_form(passphrase);\n    data_chunk normalized(normal.size());\n    std::copy(normal.begin(), normal.end(), normalized.begin());\n    BOOST_REQUIRE_EQUAL(encode_base16(normalized), \"cf9300f0909080f09f92a9\");\n\n    ec_secret secret;\n    BOOST_REQUIRE(decode_base16(secret, vector.ec_secret));\n\n    bip38::private_key private_key;\n    bip38::encrypt(private_key, secret, passphrase, vector.version, vector.compressed);\n    BOOST_REQUIRE_EQUAL(encode_base58(private_key), vector.private_key);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nBOOST_AUTO_TEST_SUITE(bip38__decrypt1)\n\n\/\/ TODO: create compressed + multiplied vector(s).\n\nstatic void test_decrypt1(const bip38_vector& vector)\n{\n    bip38::private_key private_key;\n    BOOST_REQUIRE(decode_base58(private_key, vector.private_key));\n\n    ec_secret secret;\n    uint8_t version;\n    bool compressed;\n    BOOST_REQUIRE(bip38::decrypt(secret, version, compressed, private_key, vector.passphrase));\n    BOOST_REQUIRE_EQUAL(encode_base16(secret), vector.ec_secret);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__decrypt1__vector_0__expected)\n{\n    test_decrypt1(bip38_test_vector0);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__decrypt1__vector_1__expected)\n{\n    test_decrypt1(bip38_test_vector1);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__decrypt1__vector_2_compressed__expected)\n{\n    test_decrypt1(bip38_test_vector2);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__decrypt1__vector_3_compressed__expected)\n{\n    test_decrypt1(bip38_test_vector3);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__decrypt1__vector_4_multiplied__expected)\n{\n    test_decrypt1(bip38_test_vector4);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__decrypt1__vector_5_multiplied__expected)\n{\n    test_decrypt1(bip38_test_vector5);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__decrypt1__vector_6_multiplied__expected)\n{\n    test_decrypt1(bip38_test_vector6);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__decrypt1__vector_7_multiplied__expected)\n{\n    test_decrypt1(bip38_test_vector7);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__decrypt1__vector_8_multiplied__expected)\n{\n    test_decrypt1(bip38_test_vector8);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__decrypt1__vector_9_multiplied__expected)\n{\n    test_decrypt1(bip38_test_vector9);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nBOOST_AUTO_TEST_SUITE(bip38__decrypt2)\n\n\/\/ TODO: create compressed vector(s).\n\nstatic void test_decrypt2(const bip38_vector& vector)\n{\n    bip38::public_key public_key;\n    BOOST_REQUIRE(decode_base58(public_key, vector.public_key));\n\n    ec_point point;\n    uint8_t out_version;\n    BOOST_REQUIRE(bip38::decrypt(point, out_version, public_key, vector.passphrase));\n    BOOST_REQUIRE_EQUAL(out_version, vector.version);\n\n    static const auto version = 0x00;\n    const auto expected = payment_address(version, point).to_string();\n    BOOST_REQUIRE_EQUAL(expected, vector.address);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__decrypt2__vector_8__expected)\n{\n    test_decrypt2(bip38_test_vector8);\n}\n\nBOOST_AUTO_TEST_CASE(bip38__decrypt2__vector_9__expected)\n{\n    test_decrypt2(bip38_test_vector9);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#endif \/\/ WITH_ICU\n\nBOOST_AUTO_TEST_SUITE_END()\n\n#endif \/\/ !ENABLE_TESTNET\n<|endoftext|>"}
{"text":"<commit_before>#include \"dataaccess.h\"\n#include <fstream>\n#include \"scientist.h\"\n#include <vector>\n\nusing namespace std;\n\nDataAccess::DataAccess()\n{\n\n}\nvoid DataAccess::saveScientists(vector<Scientist>& scientists)\n{\n    ofstream file;\n    file.open(\"scientists.csv\"); \/\/ spurning hvort þetta eigi að vera .txt eða .csv\n\n    for(size_t i = 0; i <= scientists.size(); i++)\n    {\n        file << scientists[i].getName() << \", \";\n        file << scientists[i].getGender() << \", \";\n        file << scientists[i].getAge() << \", \";\n        file << scientists[i].getDeath() << \". \" << endl;\n    }\n\n    file.close( );\n}\n\nvector<Scientist> DataAccess::loadScientists()\n{\n    vector<Scientist> scientists;\n    Scientist scientist;\n\n    \/\/ TODO read file, scientists.push_back(scientist)\n\n    return scientists;\n}\n<commit_msg>fall til ad lesa ur skra<commit_after>#include \"dataaccess.h\"\n#include <fstream>\n#include \"scientist.h\"\n#include <vector>\n\nusing namespace std;\n\nDataAccess::DataAccess()\n{\n\n}\nvoid DataAccess::saveScientists(vector<Scientist>& scientists)\n{\n    ofstream file;\n    file.open(\"scientists.csv\");\n\n    for(size_t i = 0; i < scientists.size(); i++)\n    {\n        file << scientists[i].getName() << \", \";\n        file << scientists[i].getGender() << \", \";\n        file << scientists[i].getAge() << \", \";\n        file << scientists[i].getDeath() << endl; \/\/ Spurning hvort það þurfi að vera endl á\n                                                  \/\/öllum atriðum til að geta notað getline hér fyrir neðan.\n    }\n\n    file.close( );\n}\n\nvector<Scientist> DataAccess::loadScientists()\n{\n    vector<Scientist> scientists;\n    Scientist scientist;\n\n    ifstream file;\n    file.open(\"scientists.csv\");\n\n    while(file)\n    {\n        getline(file, scientist.getName(), ',' );\n        getline(file, scientist.getGender(), ',' );\n        getline(file, scientist.getAge(), ',' );\n        getline(file, scientist.getDeath());\n    }\n\n    file.close( );\n\n    return scientists;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <Matrix.hpp>\n#include <catch.hpp>\n#include <fstream>\n\nSCENARIO(\"Matrix init\", \"[init]\") {\n\tGIVEN(\"The number of lines and columns\") {\n\t\tauto lines = 36;\n\t\tauto columns = 39;\n\n\t\tWHEN(\"Create instansce of Matrix\") {\n\t\t\tMatrix<int> matrix(lines, columns);\n\t\t\tTHEN(\"The number of lines and columns must be preserved\") {\n\t\t\t\tREQUIRE(matrix.GetNumberOfLines() == lines);\n\t\t\t\tREQUIRE(matrix.GetNumberOfColumns() == columns);\n\t\t\t}\n\t\t}\n\t}\n}\nSCENARIO(\"Matrix InitFromFile\", \"[fill]\") {\n\tMatrix<int> C(3, 1);\n\tC.InitFromFile(\"C3x1.txt\");\n\tREQUIRE( C[0][0] == 1 );\n\tREQUIRE( C[1][0] == 2 );\n\tREQUIRE( C[2][0] == 0 );\n}\nSCENARIO(\"Bad matrix InitFromFile\", \"[fill]\") {\n\tMatrix<int> C(3, 1);\n\tC.InitFromFile(\"C3x1.txt\");\n\tREQUIRE( C[0][0] == 1 );\n\tREQUIRE( C[1][0] == 2 );\n\tREQUIRE( C[2][0] == 0 );\n}\nSCENARIO(\"Matrix Output\", \"[output]\") {\n\tMatrix<int> A(5, 4);\n\tA.InitFromRandom();\n\tstd::cout << A;\n}\nSCENARIO(\"Matrix =\", \"assignment\") {\n\tMatrix<int> A(3, 3);\n\tA.InitFromFile(\"A3x3.txt\");\n\tMatrix<int> B(4, 2);\n\tB = A;\n\tfor (int i = 0; i < 3; i++){\n\t\tfor (int j = 0; j < 3; j++){\n\t\t\tREQUIRE( A[i][j] == B[i][j] );\n\t\t}\n\t}\n}\nSCENARIO(\"Matrix +\", \"[addition]\") {\n\tMatrix<int> A(3, 3);\n\tA.InitFromFile(\"A3x3.txt\");\n\tMatrix<int> B(3, 3);\n\tB.InitFromFile(\"B3x3.txt\");\n\tMatrix<int> expected = Matrix<int>(3, 3);\n\texpected.InitFromFile(\"(A3x3)+(B3x3).txt\");\n\n\tMatrix<int> result = A + B;\n\tfor (int i = 0; i < 3; i++){\n\t\tfor (int j = 0; j < 3; j++){\n\t\t\tREQUIRE(result[i][j] == expected[i][j]);\n\t\t}\n\t}\n}\nSCENARIO(\"Matrix *\", \"[multiplication]\") {\n\tMatrix<int> A = Matrix<int>(3, 3);\n\tA.InitFromFile(\"A3x3.txt\");\n\tMatrix<int> C = Matrix<int>(3, 1);\n\tC.InitFromFile(\"C3x1.txt\");\n\tMatrix<int> expected = Matrix<int>(3, 1);\n\texpected.InitFromFile(\"(A3x3)(C3x1).txt\");\n\n\tMatrix<int> result = A * C;\n\tfor (int i = 0; i < 3; i++){\n\t\tREQUIRE(result[i][0] == expected[i][0]);\n\t}\n}\nSCENARIO(\"Matrix ==\", \"[comparsion]\"){\n\tMatrix<int> A = Matrix<int>(3, 3);\n\tA.InitFromFile(\"A3x3.txt\");\n\tMatrix<int> C = Matrix<int>(3, 1);\n\tC.InitFromFile(\"C3x1.txt\");\n\t\n\tREQUIRE(A != C);\n\tREQUIRE(A == A);\n}\n<commit_msg>Update init.cpp<commit_after>#include <Matrix.hpp>\n#include <catch.hpp>\n#include <fstream>\n\nSCENARIO(\"Matrix init\", \"[init]\") {\n\tGIVEN(\"The number of lines and columns\") {\n\t\tauto lines = 36;\n\t\tauto columns = 39;\n\n\t\tWHEN(\"Create instansce of Matrix\") {\n\t\t\tMatrix<int> matrix(lines, columns);\n\t\t\tTHEN(\"The number of lines and columns must be preserved\") {\n\t\t\t\tREQUIRE(matrix.GetNumberOfLines() == lines);\n\t\t\t\tREQUIRE(matrix.GetNumberOfColumns() == columns);\n\t\t\t}\n\t\t}\n\t}\n}\nSCENARIO(\"Bad matrix InitFromFile\", \"[fill]\") {\n\tMatrix<int> C(3, 1);\n\tbool exception_flag = false;\n\ttry{\n\t\tC.InitFromFile(\"NotAFile\");\n\t} catch (...){\n\t\texception_flag = true;\n\t}\n\tREQUIRE(exception_flag);\n}\nSCENARIO(\"Matrix InitFromFile\", \"[fill]\") {\n\tMatrix<int> C(3, 1);\n\tC.InitFromFile(\"C3x1.txt\");\n\tREQUIRE( C[0][0] == 1 );\n\tREQUIRE( C[1][0] == 2 );\n\tREQUIRE( C[2][0] == 0 );\n}\nSCENARIO(\"Matrix Output\", \"[output]\") {\n\tMatrix<int> A(5, 4);\n\tA.InitFromRandom();\n\tstd::cout << A;\n}\nSCENARIO(\"Matrix =\", \"assignment\") {\n\tMatrix<int> A(3, 3);\n\tA.InitFromFile(\"A3x3.txt\");\n\tMatrix<int> B(4, 2);\n\tB = A;\n\tfor (int i = 0; i < 3; i++){\n\t\tfor (int j = 0; j < 3; j++){\n\t\t\tREQUIRE( A[i][j] == B[i][j] );\n\t\t}\n\t}\n}\nSCENARIO(\"Matrix +\", \"[addition]\") {\n\tMatrix<int> A(3, 3);\n\tA.InitFromFile(\"A3x3.txt\");\n\tMatrix<int> B(3, 3);\n\tB.InitFromFile(\"B3x3.txt\");\n\tMatrix<int> expected = Matrix<int>(3, 3);\n\texpected.InitFromFile(\"(A3x3)+(B3x3).txt\");\n\n\tMatrix<int> result = A + B;\n\tfor (int i = 0; i < 3; i++){\n\t\tfor (int j = 0; j < 3; j++){\n\t\t\tREQUIRE(result[i][j] == expected[i][j]);\n\t\t}\n\t}\n}\nSCENARIO(\"Matrix *\", \"[multiplication]\") {\n\tMatrix<int> A = Matrix<int>(3, 3);\n\tA.InitFromFile(\"A3x3.txt\");\n\tMatrix<int> C = Matrix<int>(3, 1);\n\tC.InitFromFile(\"C3x1.txt\");\n\tMatrix<int> expected = Matrix<int>(3, 1);\n\texpected.InitFromFile(\"(A3x3)(C3x1).txt\");\n\n\tMatrix<int> result = A * C;\n\tfor (int i = 0; i < 3; i++){\n\t\tREQUIRE(result[i][0] == expected[i][0]);\n\t}\n}\nSCENARIO(\"Matrix ==\", \"[comparsion]\"){\n\tMatrix<int> A = Matrix<int>(3, 3);\n\tA.InitFromFile(\"A3x3.txt\");\n\tMatrix<int> C = Matrix<int>(3, 1);\n\tC.InitFromFile(\"C3x1.txt\");\n\t\n\tREQUIRE(A != C);\n\tREQUIRE(A == A);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * Non-metric Space Library\n *\n * Main developers: Bilegsaikhan Naidan, Leonid Boytsov, Yury Malkov, Ben Frederickson, David Novak\n *\n * For the complete list of contributors and further details see:\n * https:\/\/github.com\/searchivarius\/NonMetricSpaceLib\n *\n * Copyright (c) 2013-2018\n *\n * This code is released under the\n * Apache License Version 2.0 http:\/\/www.apache.org\/licenses\/.\n *\n *\/\n#include <sys\/time.h>\n\n#include <logging.h>\n#include <idtype.h>\n#include <distcomp.h>\n\n\n#include <vector>\n#include <cmath>\n\n#include <space\/space_sparse_vector_inter.h>\n#include \"bunit.h\"\n#include \"my_isnan_isinf.h\"\n\nusing namespace std;\n\nnamespace similarity {\n\nvector<vector<IdType>> vvIds1 = {\n {1, 2, 3, 4},\n\n {1, 2, 3, 4},\n {1, 2, 3, 4},\n {1, 2, 3, 4},\n {1, 2, 3, 4},\n\n {1, 2, 3, 4},\n {1, 2, 3, 4},\n {1, 2, 3, 4},\n {1, 2, 3, 4},\n {1, 2, 3, 4},\n {1, 2, 3, 4},\n\n {1, 2, 3, 4},\n {1, 2, 3, 4},\n {1, 2, 3, 4},\n {1, 2, 3, 4},\n\n {1, 2, 3, 4},\n {},\n {1, 2, 3, 4},\n {1, 2, 3, 4},\n {1, 2, 3, 4},\n};\n\nvector<vector<IdType>> vvIds2 = {\n {1, 2, 3, 4},\n\n {2, 3, 4},\n {1, 3, 4},\n {1, 2, 4},\n {1, 2, 3},\n\n {1, 2},\n {1, 3},\n {1, 4},\n {2, 3},\n {2, 4},\n {3, 4},\n\n {1},\n {2},\n {3},\n {4},\n\n {},\n {},\n {5,6,7,8,9},\n {-2,-1,0},\n {-2,-1,0,5,6,7,8,9},\n};\n\nvector<size_t> vInterQty = {\n 4,\n\n 3,3,3,3,\n\n 2,2,2,2,2,2,\n\n 1,1,1,1,\n\n\n 0, 0, 0, 0, 0\n};\n\nTEST(TestIntersect2Way) {\n  EXPECT_EQ(vvIds1.size(), vvIds2.size());\n  EXPECT_EQ(vvIds1.size(), vInterQty.size());\n\n  for (size_t i = 0; i < vvIds1.size(); ++i) {\n    size_t qty1 = IntersectSizeScalarFast(&vvIds1[i][0], vvIds1[i].size(), \n                                          &vvIds2[i][0], vvIds2[i].size());\n    size_t qty2 = IntersectSizeScalarStand(&vvIds1[i][0], vvIds1[i].size(), \n                                          &vvIds2[i][0], vvIds2[i].size());\n    EXPECT_EQ(qty1, vInterQty[i]);\n    EXPECT_EQ(qty2, vInterQty[i]);\n\n    if (qty1 != vInterQty[i] || \n        qty2 != vInterQty[i])\n         LOG(LIB_INFO) << \"Failed test (basic intersect funcs), index: \" << i;\n\n    const float oneElemVal1 = 0.1;\n    const float oneElemVal2 = 0.2;\n    vector<SparseVectElem<float>> elems1, elems2;\n  \n    for (IdType id1 : vvIds1[i]) {\n      elems1.push_back(SparseVectElem<float>(id1, oneElemVal1));\n    } \n    for (IdType id2 : vvIds2[i]) {\n      elems2.push_back(SparseVectElem<float>(id2, oneElemVal2));\n    } \n    OverlapInfo oinfo = SpaceSparseVectorInter<float>::ComputeOverlapInfo(elems1, elems2);\n\n    if (oinfo.overlap_qty_ != vInterQty[i])\n      LOG(LIB_INFO) << \"Failed test (ComputeOverlapInfo), index: \" << i;\n\n    EXPECT_EQ((size_t)oinfo.overlap_qty_, vInterQty[i]);\n    \n    float vectQty1 = elems1.size();\n    float norm1 = sqrt(oneElemVal1*oneElemVal1*vectQty1);\n    float vectQty2 = elems2.size();\n    float norm2 = sqrt(oneElemVal2*oneElemVal2*vectQty2);\n\n    float overlap_qty = oinfo.overlap_qty_;\n    float overlap_dotprod_norm = std::min(norm1, norm2) >0 ? overlap_qty * oneElemVal1 * oneElemVal2 \/ (norm1 * norm2) : 0; \n    CHECK(!my_isnan(overlap_dotprod_norm));\n  \n    const float eps = 0.0001f; \/\/ somewhat adhoc\n\n    EXPECT_EQ_EPS(overlap_dotprod_norm, oinfo.overlap_dotprod_norm_, eps);\n    \/\/cerr << overlap_dotprod_norm << \" # \" << my_isnan(overlap_dotprod_norm) << \" -> \" << oinfo.overlap_dotprod_norm_ << endl;\n\n    float diff_sum_left    = oneElemVal1*(vectQty1 - overlap_qty);\n    CHECK(!my_isnan(diff_sum_left));\n    EXPECT_EQ_EPS(diff_sum_left, oinfo.diff_sum_left_, eps);\n    EXPECT_EQ_EPS(vectQty1 > overlap_qty ? oneElemVal1 : 0, oinfo.diff_mean_left_, eps);\n\n    float overlap_sum_left = oneElemVal1*overlap_qty;\n    CHECK(!my_isnan(overlap_sum_left));\n    EXPECT_EQ_EPS(overlap_sum_left, oinfo.overlap_sum_left_, eps);\n    EXPECT_EQ_EPS(overlap_qty > 0 ? oneElemVal1 : 0, oinfo.overlap_mean_left_, eps);\n\n    float diff_sum_right = oneElemVal2*(vectQty2 - overlap_qty);\n    CHECK(!my_isnan(diff_sum_right));\n    EXPECT_EQ_EPS(diff_sum_right, oinfo.diff_sum_right_, eps);\n    EXPECT_EQ_EPS(vectQty2 > overlap_qty ? oneElemVal2 : 0, oinfo.diff_mean_right_, eps);\n\n    float overlap_sum_right = oneElemVal2*overlap_qty;\n    CHECK(!my_isnan(overlap_sum_left));\n    EXPECT_EQ_EPS(overlap_sum_right, oinfo.overlap_sum_right_, eps);\n    EXPECT_EQ_EPS(overlap_qty > 0 ? oneElemVal2 : 0, oinfo.overlap_mean_right_, eps);\n  }\n}\n\nTEST(TestOverlapInfoDetailed) {\n  \/* \n   * In this function, we carry out a more detailed testing with a focus on on correctness of computation of STD and mean.\n   * We try to consider all typical combinations of the overlap and remaining part sizes.\n   *\/\n  const size_t COMBIN_QTY = 5;\n  for (size_t qDiffLeft = 0; qDiffLeft < COMBIN_QTY; ++qDiffLeft)\n  for (size_t qOverlap = 0; qOverlap < COMBIN_QTY; ++qOverlap)\n  for (size_t qDiffRight = 0; qDiffRight < COMBIN_QTY; ++qDiffRight) {\n    vector<float> vDiffLeft, vOverlapLeft;\n    vector<float> vDiffRight, vOverlapRight;\n\n    vector<IdType>                vIds1, vIds2;\n    vector<SparseVectElem<float>> elems1, elems2;\n\n    const float oneElemMul1 = 0.1;\n    const float oneElemMul2 = 0.2;\n\n    float norm1 = 0, norm2 = 0;\n\n    for (size_t id = 0; id < qDiffLeft; ++id) {\n      vIds1.push_back(id);\n      float val1 = id * oneElemMul1;\n      elems1.emplace_back(id, val1);\n      vDiffLeft.push_back(val1);\n      norm1 += val1 * val1;\n    }\n    float overlap_dotprod_norm = 0;\n    for (size_t id = COMBIN_QTY; id < COMBIN_QTY + qOverlap; ++id) {\n      vIds1.push_back(id);\n      float val1 = id * oneElemMul1;\n      elems1.emplace_back(id, val1);\n      vOverlapLeft.push_back(val1);\n      norm1 += val1 * val1;\n\n      float val2 = id * oneElemMul2;\n      vIds2.push_back(id);\n      elems2.emplace_back(id, val2);\n      vOverlapRight.push_back(val2);\n      norm2 += val2 * val2;\n\n      overlap_dotprod_norm += val1 * val2;\n    }\n    for (size_t id = 2*COMBIN_QTY; id < 2*COMBIN_QTY + qDiffRight; ++id) {\n      vIds2.push_back(id);\n      float val2 = id * oneElemMul2;\n      elems2.emplace_back(id, val2);\n      vDiffRight.push_back(val2);\n      norm2 += val2 * val2;\n    }\n    norm1 = sqrt(norm1);\n    norm2 = sqrt(norm2);\n    if (norm1 > 0) overlap_dotprod_norm \/= norm1;\n    if (norm2 > 0) overlap_dotprod_norm \/= norm2;\n\n    size_t qty1 = IntersectSizeScalarFast(&vIds1[0], vIds1.size(), \n                                          &vIds2[0], vIds2.size());\n    size_t qty2 = IntersectSizeScalarStand(&vIds1[0], vIds1.size(), \n                                          &vIds2[0], vIds2.size());\n    EXPECT_EQ(qty1, qOverlap);\n    EXPECT_EQ(qty2, qOverlap);\n\n    OverlapInfo oinfo = SpaceSparseVectorInter<float>::ComputeOverlapInfo(elems1, elems2);\n\n    EXPECT_EQ(qOverlap, (size_t)oinfo.overlap_qty_);\n    \n    const float eps = 0.0001f; \/\/ somewhat adhoc\n\n    EXPECT_EQ_EPS(overlap_dotprod_norm, oinfo.overlap_dotprod_norm_, eps);\n\n    EXPECT_EQ_EPS(Sum(&vDiffLeft[0], vDiffLeft.size()), oinfo.diff_sum_left_, eps);\n    EXPECT_EQ_EPS(Mean(&vDiffLeft[0], vDiffLeft.size()), oinfo.diff_mean_left_, eps);\n    EXPECT_EQ_EPS(StdDev(&vDiffLeft[0], vDiffLeft.size()), oinfo.diff_std_left_, eps);\n\n    EXPECT_EQ_EPS(Sum(&vOverlapLeft[0], vOverlapLeft.size()), oinfo.overlap_sum_left_, eps);\n    EXPECT_EQ_EPS(Mean(&vOverlapLeft[0], vOverlapLeft.size()), oinfo.overlap_mean_left_, eps);\n    EXPECT_EQ_EPS(StdDev(&vOverlapLeft[0], vOverlapLeft.size()), oinfo.overlap_std_left_, eps);\n\n    EXPECT_EQ_EPS(Sum(&vDiffRight[0], vDiffRight.size()), oinfo.diff_sum_right_, eps);\n    EXPECT_EQ_EPS(Mean(&vDiffRight[0], vDiffRight.size()), oinfo.diff_mean_right_, eps);\n    EXPECT_EQ_EPS(StdDev(&vDiffRight[0], vDiffRight.size()), oinfo.diff_std_right_, eps);\n\n    EXPECT_EQ_EPS(Sum(&vOverlapRight[0], vOverlapRight.size()), oinfo.overlap_sum_right_, eps);\n    EXPECT_EQ_EPS(Mean(&vOverlapRight[0], vOverlapRight.size()), oinfo.overlap_mean_right_, eps);\n    EXPECT_EQ_EPS(StdDev(&vOverlapRight[0], vOverlapRight.size()), oinfo.overlap_std_right_, eps);\n\n  } \n}\n\nvector<vector<IdType>> vvAddIds1 = {\n  {1,2,3},  \/\/ 0\n  {1,2,3},  \/\/ 1\n\n  {1,2,3},  \/\/ 2\n  {1,2,3},  \/\/ 3\n  {1,2,3},  \/\/ 4\n\n  {1,2,3},  \/\/ 5\n  {1,2,3},  \/\/ 6\n  {1,2,3},  \/\/ 7\n\n  {1,2,3},  \/\/ 8\n\n  {1,2},    \/\/ 9\n  {1,2},    \/\/ 10\n  {1,3},    \/\/ 11\n\n  {1},      \/\/ 12\n  {2},      \/\/ 13\n  {3},      \/\/ 14\n\n  {1,2,3},  \/\/ 15\n};\n\nvector<vector<IdType>> vvAddIds2 = {\n  {1,2,3}, \/\/ 0\n  {1,2,3}, \/\/ 1\n\n  {1,2},   \/\/ 2\n  {1,3},   \/\/ 3\n  {2,3},   \/\/ 4\n\n  {1,2},   \/\/ 5\n  {1,3},   \/\/ 6\n  {2,3},   \/\/ 7\n\n  {2,3},   \/\/ 8\n\n  {1},     \/\/ 9\n  {2},     \/\/ 10\n  {3},     \/\/ 11\n\n  {1},     \/\/ 12\n  {2},     \/\/ 13\n  {3},     \/\/ 14\n \n  {1,2,3}, \/\/ 15\n};\n\nvector<vector<IdType>> vvAddIds3 = {\n  {1,2,3}, \/\/ 0\n  {1,2},   \/\/ 1\n\n  {1,2},   \/\/ 2\n  {1,3},   \/\/ 3\n  {2,3},   \/\/ 4\n\n  {1},     \/\/ 5\n  {3},     \/\/ 6\n  {2},     \/\/ 7\n\n  {1},     \/\/ 8\n\n  {1},     \/\/ 9\n  {2},     \/\/ 10\n  {3},     \/\/ 11\n\n  {3},     \/\/ 12\n  {1},     \/\/ 13\n  {2},     \/\/ 14\n\n  {},      \/\/ 15\n};\n\nvector<size_t> vAddInterQty = {\n  3, \/\/ 0\n  2, \/\/ 1\n\n  2, \/\/ 2\n  2, \/\/ 3\n  2, \/\/ 4\n\n  1,\n  1,\n  1, \/\/ 7\n\n  0, \/\/ 8\n\n  1,\n  1,\n  1, \/\/ 11\n\n  0, \/\/ 12\n  0, \/\/ 13\n  0,\n  \n  0\n};\n\nTEST(TestIntersect3Way) {\n  EXPECT_EQ(vvAddIds1.size(), vvAddIds2.size());\n  EXPECT_EQ(vvAddIds1.size(), vvAddIds3.size());\n  EXPECT_EQ(vvAddIds1.size(), vAddInterQty.size());\n\n  \n  for (size_t i = 0; i < vvAddIds1.size(); ++i) {\n    size_t qty1 = IntersectSizeScalar3way(&vvAddIds1[i][0], vvAddIds1[i].size(), \n                                          &vvAddIds2[i][0], vvAddIds2[i].size(),\n                                          &vvAddIds3[i][0], vvAddIds3[i].size());\n    size_t qty2 = IntersectSizeScalar3way(&vvAddIds3[i][0], vvAddIds3[i].size(), \n                                          &vvAddIds1[i][0], vvAddIds1[i].size(),\n                                          &vvAddIds2[i][0], vvAddIds2[i].size());\n    size_t qty3 = IntersectSizeScalar3way(&vvAddIds3[i][0], vvAddIds3[i].size(), \n                                          &vvAddIds2[i][0], vvAddIds2[i].size(),\n                                          &vvAddIds1[i][0], vvAddIds1[i].size());\n    if (qty1 != vAddInterQty[i] || \n        qty2 != vAddInterQty[i] || \n        qty3 != vAddInterQty[i]) LOG(LIB_INFO) << \"Failed test (3-way intersect funcs), index: \" << i;\n\n    EXPECT_EQ(qty1, vAddInterQty[i]);\n    EXPECT_EQ(qty2, vAddInterQty[i]);\n    EXPECT_EQ(qty3, vAddInterQty[i]);\n  }\n}\n\n\n}  \/\/ namespace similarity\n\n<commit_msg>remove unused header<commit_after>\/**\n * Non-metric Space Library\n *\n * Main developers: Bilegsaikhan Naidan, Leonid Boytsov, Yury Malkov, Ben Frederickson, David Novak\n *\n * For the complete list of contributors and further details see:\n * https:\/\/github.com\/searchivarius\/NonMetricSpaceLib\n *\n * Copyright (c) 2013-2018\n *\n * This code is released under the\n * Apache License Version 2.0 http:\/\/www.apache.org\/licenses\/.\n *\n *\/\n\n#include <logging.h>\n#include <idtype.h>\n#include <distcomp.h>\n\n\n#include <vector>\n#include <cmath>\n\n#include <space\/space_sparse_vector_inter.h>\n#include \"bunit.h\"\n#include \"my_isnan_isinf.h\"\n\nusing namespace std;\n\nnamespace similarity {\n\nvector<vector<IdType>> vvIds1 = {\n {1, 2, 3, 4},\n\n {1, 2, 3, 4},\n {1, 2, 3, 4},\n {1, 2, 3, 4},\n {1, 2, 3, 4},\n\n {1, 2, 3, 4},\n {1, 2, 3, 4},\n {1, 2, 3, 4},\n {1, 2, 3, 4},\n {1, 2, 3, 4},\n {1, 2, 3, 4},\n\n {1, 2, 3, 4},\n {1, 2, 3, 4},\n {1, 2, 3, 4},\n {1, 2, 3, 4},\n\n {1, 2, 3, 4},\n {},\n {1, 2, 3, 4},\n {1, 2, 3, 4},\n {1, 2, 3, 4},\n};\n\nvector<vector<IdType>> vvIds2 = {\n {1, 2, 3, 4},\n\n {2, 3, 4},\n {1, 3, 4},\n {1, 2, 4},\n {1, 2, 3},\n\n {1, 2},\n {1, 3},\n {1, 4},\n {2, 3},\n {2, 4},\n {3, 4},\n\n {1},\n {2},\n {3},\n {4},\n\n {},\n {},\n {5,6,7,8,9},\n {-2,-1,0},\n {-2,-1,0,5,6,7,8,9},\n};\n\nvector<size_t> vInterQty = {\n 4,\n\n 3,3,3,3,\n\n 2,2,2,2,2,2,\n\n 1,1,1,1,\n\n\n 0, 0, 0, 0, 0\n};\n\nTEST(TestIntersect2Way) {\n  EXPECT_EQ(vvIds1.size(), vvIds2.size());\n  EXPECT_EQ(vvIds1.size(), vInterQty.size());\n\n  for (size_t i = 0; i < vvIds1.size(); ++i) {\n    size_t qty1 = IntersectSizeScalarFast(&vvIds1[i][0], vvIds1[i].size(), \n                                          &vvIds2[i][0], vvIds2[i].size());\n    size_t qty2 = IntersectSizeScalarStand(&vvIds1[i][0], vvIds1[i].size(), \n                                          &vvIds2[i][0], vvIds2[i].size());\n    EXPECT_EQ(qty1, vInterQty[i]);\n    EXPECT_EQ(qty2, vInterQty[i]);\n\n    if (qty1 != vInterQty[i] || \n        qty2 != vInterQty[i])\n         LOG(LIB_INFO) << \"Failed test (basic intersect funcs), index: \" << i;\n\n    const float oneElemVal1 = 0.1;\n    const float oneElemVal2 = 0.2;\n    vector<SparseVectElem<float>> elems1, elems2;\n  \n    for (IdType id1 : vvIds1[i]) {\n      elems1.push_back(SparseVectElem<float>(id1, oneElemVal1));\n    } \n    for (IdType id2 : vvIds2[i]) {\n      elems2.push_back(SparseVectElem<float>(id2, oneElemVal2));\n    } \n    OverlapInfo oinfo = SpaceSparseVectorInter<float>::ComputeOverlapInfo(elems1, elems2);\n\n    if (oinfo.overlap_qty_ != vInterQty[i])\n      LOG(LIB_INFO) << \"Failed test (ComputeOverlapInfo), index: \" << i;\n\n    EXPECT_EQ((size_t)oinfo.overlap_qty_, vInterQty[i]);\n    \n    float vectQty1 = elems1.size();\n    float norm1 = sqrt(oneElemVal1*oneElemVal1*vectQty1);\n    float vectQty2 = elems2.size();\n    float norm2 = sqrt(oneElemVal2*oneElemVal2*vectQty2);\n\n    float overlap_qty = oinfo.overlap_qty_;\n    float overlap_dotprod_norm = std::min(norm1, norm2) >0 ? overlap_qty * oneElemVal1 * oneElemVal2 \/ (norm1 * norm2) : 0; \n    CHECK(!my_isnan(overlap_dotprod_norm));\n  \n    const float eps = 0.0001f; \/\/ somewhat adhoc\n\n    EXPECT_EQ_EPS(overlap_dotprod_norm, oinfo.overlap_dotprod_norm_, eps);\n    \/\/cerr << overlap_dotprod_norm << \" # \" << my_isnan(overlap_dotprod_norm) << \" -> \" << oinfo.overlap_dotprod_norm_ << endl;\n\n    float diff_sum_left    = oneElemVal1*(vectQty1 - overlap_qty);\n    CHECK(!my_isnan(diff_sum_left));\n    EXPECT_EQ_EPS(diff_sum_left, oinfo.diff_sum_left_, eps);\n    EXPECT_EQ_EPS(vectQty1 > overlap_qty ? oneElemVal1 : 0, oinfo.diff_mean_left_, eps);\n\n    float overlap_sum_left = oneElemVal1*overlap_qty;\n    CHECK(!my_isnan(overlap_sum_left));\n    EXPECT_EQ_EPS(overlap_sum_left, oinfo.overlap_sum_left_, eps);\n    EXPECT_EQ_EPS(overlap_qty > 0 ? oneElemVal1 : 0, oinfo.overlap_mean_left_, eps);\n\n    float diff_sum_right = oneElemVal2*(vectQty2 - overlap_qty);\n    CHECK(!my_isnan(diff_sum_right));\n    EXPECT_EQ_EPS(diff_sum_right, oinfo.diff_sum_right_, eps);\n    EXPECT_EQ_EPS(vectQty2 > overlap_qty ? oneElemVal2 : 0, oinfo.diff_mean_right_, eps);\n\n    float overlap_sum_right = oneElemVal2*overlap_qty;\n    CHECK(!my_isnan(overlap_sum_left));\n    EXPECT_EQ_EPS(overlap_sum_right, oinfo.overlap_sum_right_, eps);\n    EXPECT_EQ_EPS(overlap_qty > 0 ? oneElemVal2 : 0, oinfo.overlap_mean_right_, eps);\n  }\n}\n\nTEST(TestOverlapInfoDetailed) {\n  \/* \n   * In this function, we carry out a more detailed testing with a focus on on correctness of computation of STD and mean.\n   * We try to consider all typical combinations of the overlap and remaining part sizes.\n   *\/\n  const size_t COMBIN_QTY = 5;\n  for (size_t qDiffLeft = 0; qDiffLeft < COMBIN_QTY; ++qDiffLeft)\n  for (size_t qOverlap = 0; qOverlap < COMBIN_QTY; ++qOverlap)\n  for (size_t qDiffRight = 0; qDiffRight < COMBIN_QTY; ++qDiffRight) {\n    vector<float> vDiffLeft, vOverlapLeft;\n    vector<float> vDiffRight, vOverlapRight;\n\n    vector<IdType>                vIds1, vIds2;\n    vector<SparseVectElem<float>> elems1, elems2;\n\n    const float oneElemMul1 = 0.1;\n    const float oneElemMul2 = 0.2;\n\n    float norm1 = 0, norm2 = 0;\n\n    for (size_t id = 0; id < qDiffLeft; ++id) {\n      vIds1.push_back(id);\n      float val1 = id * oneElemMul1;\n      elems1.emplace_back(id, val1);\n      vDiffLeft.push_back(val1);\n      norm1 += val1 * val1;\n    }\n    float overlap_dotprod_norm = 0;\n    for (size_t id = COMBIN_QTY; id < COMBIN_QTY + qOverlap; ++id) {\n      vIds1.push_back(id);\n      float val1 = id * oneElemMul1;\n      elems1.emplace_back(id, val1);\n      vOverlapLeft.push_back(val1);\n      norm1 += val1 * val1;\n\n      float val2 = id * oneElemMul2;\n      vIds2.push_back(id);\n      elems2.emplace_back(id, val2);\n      vOverlapRight.push_back(val2);\n      norm2 += val2 * val2;\n\n      overlap_dotprod_norm += val1 * val2;\n    }\n    for (size_t id = 2*COMBIN_QTY; id < 2*COMBIN_QTY + qDiffRight; ++id) {\n      vIds2.push_back(id);\n      float val2 = id * oneElemMul2;\n      elems2.emplace_back(id, val2);\n      vDiffRight.push_back(val2);\n      norm2 += val2 * val2;\n    }\n    norm1 = sqrt(norm1);\n    norm2 = sqrt(norm2);\n    if (norm1 > 0) overlap_dotprod_norm \/= norm1;\n    if (norm2 > 0) overlap_dotprod_norm \/= norm2;\n\n    size_t qty1 = IntersectSizeScalarFast(&vIds1[0], vIds1.size(), \n                                          &vIds2[0], vIds2.size());\n    size_t qty2 = IntersectSizeScalarStand(&vIds1[0], vIds1.size(), \n                                          &vIds2[0], vIds2.size());\n    EXPECT_EQ(qty1, qOverlap);\n    EXPECT_EQ(qty2, qOverlap);\n\n    OverlapInfo oinfo = SpaceSparseVectorInter<float>::ComputeOverlapInfo(elems1, elems2);\n\n    EXPECT_EQ(qOverlap, (size_t)oinfo.overlap_qty_);\n    \n    const float eps = 0.0001f; \/\/ somewhat adhoc\n\n    EXPECT_EQ_EPS(overlap_dotprod_norm, oinfo.overlap_dotprod_norm_, eps);\n\n    EXPECT_EQ_EPS(Sum(&vDiffLeft[0], vDiffLeft.size()), oinfo.diff_sum_left_, eps);\n    EXPECT_EQ_EPS(Mean(&vDiffLeft[0], vDiffLeft.size()), oinfo.diff_mean_left_, eps);\n    EXPECT_EQ_EPS(StdDev(&vDiffLeft[0], vDiffLeft.size()), oinfo.diff_std_left_, eps);\n\n    EXPECT_EQ_EPS(Sum(&vOverlapLeft[0], vOverlapLeft.size()), oinfo.overlap_sum_left_, eps);\n    EXPECT_EQ_EPS(Mean(&vOverlapLeft[0], vOverlapLeft.size()), oinfo.overlap_mean_left_, eps);\n    EXPECT_EQ_EPS(StdDev(&vOverlapLeft[0], vOverlapLeft.size()), oinfo.overlap_std_left_, eps);\n\n    EXPECT_EQ_EPS(Sum(&vDiffRight[0], vDiffRight.size()), oinfo.diff_sum_right_, eps);\n    EXPECT_EQ_EPS(Mean(&vDiffRight[0], vDiffRight.size()), oinfo.diff_mean_right_, eps);\n    EXPECT_EQ_EPS(StdDev(&vDiffRight[0], vDiffRight.size()), oinfo.diff_std_right_, eps);\n\n    EXPECT_EQ_EPS(Sum(&vOverlapRight[0], vOverlapRight.size()), oinfo.overlap_sum_right_, eps);\n    EXPECT_EQ_EPS(Mean(&vOverlapRight[0], vOverlapRight.size()), oinfo.overlap_mean_right_, eps);\n    EXPECT_EQ_EPS(StdDev(&vOverlapRight[0], vOverlapRight.size()), oinfo.overlap_std_right_, eps);\n\n  } \n}\n\nvector<vector<IdType>> vvAddIds1 = {\n  {1,2,3},  \/\/ 0\n  {1,2,3},  \/\/ 1\n\n  {1,2,3},  \/\/ 2\n  {1,2,3},  \/\/ 3\n  {1,2,3},  \/\/ 4\n\n  {1,2,3},  \/\/ 5\n  {1,2,3},  \/\/ 6\n  {1,2,3},  \/\/ 7\n\n  {1,2,3},  \/\/ 8\n\n  {1,2},    \/\/ 9\n  {1,2},    \/\/ 10\n  {1,3},    \/\/ 11\n\n  {1},      \/\/ 12\n  {2},      \/\/ 13\n  {3},      \/\/ 14\n\n  {1,2,3},  \/\/ 15\n};\n\nvector<vector<IdType>> vvAddIds2 = {\n  {1,2,3}, \/\/ 0\n  {1,2,3}, \/\/ 1\n\n  {1,2},   \/\/ 2\n  {1,3},   \/\/ 3\n  {2,3},   \/\/ 4\n\n  {1,2},   \/\/ 5\n  {1,3},   \/\/ 6\n  {2,3},   \/\/ 7\n\n  {2,3},   \/\/ 8\n\n  {1},     \/\/ 9\n  {2},     \/\/ 10\n  {3},     \/\/ 11\n\n  {1},     \/\/ 12\n  {2},     \/\/ 13\n  {3},     \/\/ 14\n \n  {1,2,3}, \/\/ 15\n};\n\nvector<vector<IdType>> vvAddIds3 = {\n  {1,2,3}, \/\/ 0\n  {1,2},   \/\/ 1\n\n  {1,2},   \/\/ 2\n  {1,3},   \/\/ 3\n  {2,3},   \/\/ 4\n\n  {1},     \/\/ 5\n  {3},     \/\/ 6\n  {2},     \/\/ 7\n\n  {1},     \/\/ 8\n\n  {1},     \/\/ 9\n  {2},     \/\/ 10\n  {3},     \/\/ 11\n\n  {3},     \/\/ 12\n  {1},     \/\/ 13\n  {2},     \/\/ 14\n\n  {},      \/\/ 15\n};\n\nvector<size_t> vAddInterQty = {\n  3, \/\/ 0\n  2, \/\/ 1\n\n  2, \/\/ 2\n  2, \/\/ 3\n  2, \/\/ 4\n\n  1,\n  1,\n  1, \/\/ 7\n\n  0, \/\/ 8\n\n  1,\n  1,\n  1, \/\/ 11\n\n  0, \/\/ 12\n  0, \/\/ 13\n  0,\n  \n  0\n};\n\nTEST(TestIntersect3Way) {\n  EXPECT_EQ(vvAddIds1.size(), vvAddIds2.size());\n  EXPECT_EQ(vvAddIds1.size(), vvAddIds3.size());\n  EXPECT_EQ(vvAddIds1.size(), vAddInterQty.size());\n\n  \n  for (size_t i = 0; i < vvAddIds1.size(); ++i) {\n    size_t qty1 = IntersectSizeScalar3way(&vvAddIds1[i][0], vvAddIds1[i].size(), \n                                          &vvAddIds2[i][0], vvAddIds2[i].size(),\n                                          &vvAddIds3[i][0], vvAddIds3[i].size());\n    size_t qty2 = IntersectSizeScalar3way(&vvAddIds3[i][0], vvAddIds3[i].size(), \n                                          &vvAddIds1[i][0], vvAddIds1[i].size(),\n                                          &vvAddIds2[i][0], vvAddIds2[i].size());\n    size_t qty3 = IntersectSizeScalar3way(&vvAddIds3[i][0], vvAddIds3[i].size(), \n                                          &vvAddIds2[i][0], vvAddIds2[i].size(),\n                                          &vvAddIds1[i][0], vvAddIds1[i].size());\n    if (qty1 != vAddInterQty[i] || \n        qty2 != vAddInterQty[i] || \n        qty3 != vAddInterQty[i]) LOG(LIB_INFO) << \"Failed test (3-way intersect funcs), index: \" << i;\n\n    EXPECT_EQ(qty1, vAddInterQty[i]);\n    EXPECT_EQ(qty2, vAddInterQty[i]);\n    EXPECT_EQ(qty3, vAddInterQty[i]);\n  }\n}\n\n\n}  \/\/ namespace similarity\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Copyright (C) 2004-2006 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\n\/\/ SYSTEM INCLUDES\n#ifdef _WIN32\n#  define WIN32_LEAN_AND_MEAN\n#  include <windows.h>\n#endif\n\n\/\/ APPLICATION INCLUDES\n#include \"utl\/UtlVoidPtr.h\"\n#include \"utl\/UtlInt.h\"\n#include \"tapi\/SipXHandleMap.h\"\n#include \"utl\/UtlHashMapIterator.h\"\n\n\/\/ EXTERNAL FUNCTIONS\n\/\/ EXTERNAL VARIABLES\n\/\/ CONSTANTS\n\/\/ STATIC VARIABLE INITIALIZATIONS\n\n\/* \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ PUBLIC \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ *\/\n\n\/* ============================ CREATORS ================================== *\/\n\n\/\/ Constructor\nSipXHandleMap::SipXHandleMap(int startingHandle)\n    : mLock(OsMutex::Q_FIFO)\n    , mNextHandle(startingHandle)\n{\n}\n\n\/\/ Destructor\nSipXHandleMap::~SipXHandleMap()\n{\n}\n\n\/* ============================ MANIPULATORS ============================== *\/\n\nvoid SipXHandleMap::addHandleRef(SIPXHANDLE hHandle)\n{\n    lock() ;    \n\n    UtlInt handle(hHandle) ;\n\n    mLockCountHash.findValue(&handle);\n    UtlInt* count = static_cast<UtlInt*>(mLockCountHash.findValue(&handle)) ;\n    if (count == NULL)\n    {\n        mLockCountHash.insertKeyAndValue(new UtlInt(hHandle), new UtlInt(1));\n    }\n    else\n    {\n        count->setValue(count->getValue() + 1);\n    }\n    \n    unlock() ;\n}\n\nvoid SipXHandleMap::releaseHandleRef(SIPXHANDLE hHandle)\n{\n    lock();\n\n    UtlInt handle(hHandle) ;\n\n    UtlInt* pCount = static_cast<UtlInt*>(mLockCountHash.findValue(&handle)) ;\n    if (pCount == NULL)\n    {\n        mLockCountHash.insertKeyAndValue(new UtlInt(hHandle), new UtlInt(0));\n    }\n    else\n    {\n        pCount->setValue(pCount->getValue() - 1);\n    }\n\n    unlock();\n}\n\nvoid SipXHandleMap::lock()\n{\n    mLock.acquire() ;\n}\n\n\nvoid SipXHandleMap::unlock() \n{\n    mLock.release() ;\n}\n\n\nSIPXHANDLE SipXHandleMap::allocHandle(const void* pData) \n{\n    lock() ;\n\n    SIPXHANDLE hCall = mNextHandle++ ;\n    insertKeyAndValue(new UtlInt(hCall), new UtlVoidPtr((void*) pData)) ;\n    addHandleRef(hCall);\n\n    unlock() ;\n\n    return hCall ;\n}\n\nconst void* SipXHandleMap::findHandle(SIPXHANDLE handle) \n{\n    lock() ;\n\n    const void* pRC = NULL ;\n    UtlInt key(handle) ;\n    UtlVoidPtr* pValue ;\n\n    pValue = (UtlVoidPtr*) findValue(&key) ;\n    if (pValue != NULL)\n    {\n        pRC = pValue->getValue() ;\n    }\n\n    unlock() ;\n\n    return pRC ;\n}\n\n\nconst void* SipXHandleMap::removeHandle(SIPXHANDLE handle) \n{\n    lock() ;\n\n    releaseHandleRef(handle);\n    const void* pRC = NULL ;\n    UtlInt key(handle) ;\n        \n    UtlInt* pCount = static_cast<UtlInt*>(mLockCountHash.findValue(&key)) ;\n        \n    if (pCount == NULL || pCount->getValue() < 1)\n    {\n        UtlVoidPtr* pValue ;\n            \n        pValue = (UtlVoidPtr*) findValue(&key) ;\n        if (pValue != NULL)\n        {\n            pRC = pValue->getValue() ;                \n            destroy(&key) ;\n        }\n\n        if (pCount)\n        {\n            mLockCountHash.destroy(&key);\n        }\n    }\n    \n    unlock() ;\n    return pRC ;\n}\n\n\n\/* ============================ ACCESSORS ================================= *\/\n\nvoid SipXHandleMap::dump() \n{\n    UtlHashMapIterator itor(*this) ;\n    UtlInt* pKey ;\n    UtlVoidPtr* pValue ;\n        \n    while ((pKey = (UtlInt*) itor()))\n    {\n        pValue = (UtlVoidPtr*) findValue(pKey) ;\n        printf(\"\\tkey=%08X, value=%p\\n\", pKey->getValue(), \n                pValue ? pValue->getValue() : 0) ;                        \n    }       \n}\n\n#include \"tapi\/sipXtapiInternal.h\"\n\nvoid SipXHandleMap::dumpCalls()\n{\n   UtlHashMapIterator itor(*this) ;\n   UtlInt* pKey ;\n   UtlVoidPtr* pValue ;\n\n   while ((pKey = (UtlInt*) itor()))\n   {\n      pValue = (UtlVoidPtr*) findValue(pKey) ;\n      assert(pValue != NULL);\n      SIPX_CALL_DATA* pCallData = (SIPX_CALL_DATA*)pValue->getValue();\n      printf(\"\\tkey=%08d, value=0x%p, CallId=%s SessionCallId=%s\\n\",\n         pKey->getValue(), \n         pValue->getValue(),\n         pCallData->callId?pCallData->callId->data():\"NULL\",\n         pCallData->sessionCallId?pCallData->sessionCallId->data():\"NULL\") ;\n   }\n}\n\n\/* ============================ INQUIRY =================================== *\/\n\n\/* \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ PROTECTED \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ *\/\n\n\/* \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ PRIVATE \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ *\/\n\n\/* ============================ FUNCTIONS ================================= *\/\n\n<commit_msg>Log error if sipXtapi handle map does not get destroyed.<commit_after>\/\/\n\/\/ Copyright (C) 2006-2012 SIPez LLC.  All rights reserved.\n\/\/\n\/\/ Copyright (C) 2004-2006 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\n\/\/ SYSTEM INCLUDES\n#ifdef _WIN32\n#  define WIN32_LEAN_AND_MEAN\n#  include <windows.h>\n#endif\n\n\/\/ APPLICATION INCLUDES\n#include <os\/OsIntTypes.h>\n#include <os\/OsSysLog.h>\n#include <utl\/UtlVoidPtr.h>\n#include <utl\/UtlInt.h>\n#include <tapi\/SipXHandleMap.h>\n#include <utl\/UtlHashMapIterator.h>\n\n\/\/ EXTERNAL FUNCTIONS\n\/\/ EXTERNAL VARIABLES\n\/\/ CONSTANTS\n\/\/ STATIC VARIABLE INITIALIZATIONS\n\n\/* \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ PUBLIC \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ *\/\n\n\/* ============================ CREATORS ================================== *\/\n\n\/\/ Constructor\nSipXHandleMap::SipXHandleMap(int startingHandle)\n    : mLock(OsMutex::Q_FIFO)\n    , mNextHandle(startingHandle)\n{\n}\n\n\/\/ Destructor\nSipXHandleMap::~SipXHandleMap()\n{\n}\n\n\/* ============================ MANIPULATORS ============================== *\/\n\nvoid SipXHandleMap::addHandleRef(SIPXHANDLE hHandle)\n{\n    lock() ;    \n\n    UtlInt handle(hHandle) ;\n\n    mLockCountHash.findValue(&handle);\n    UtlInt* count = static_cast<UtlInt*>(mLockCountHash.findValue(&handle)) ;\n    if (count == NULL)\n    {\n        mLockCountHash.insertKeyAndValue(new UtlInt(hHandle), new UtlInt(1));\n    }\n    else\n    {\n        count->setValue(count->getValue() + 1);\n    }\n    \n    unlock() ;\n}\n\nvoid SipXHandleMap::releaseHandleRef(SIPXHANDLE hHandle)\n{\n    lock();\n\n    UtlInt handle(hHandle) ;\n\n    UtlInt* pCount = static_cast<UtlInt*>(mLockCountHash.findValue(&handle)) ;\n    if (pCount == NULL)\n    {\n        mLockCountHash.insertKeyAndValue(new UtlInt(hHandle), new UtlInt(0));\n    }\n    else\n    {\n        pCount->setValue(pCount->getValue() - 1);\n    }\n\n    unlock();\n}\n\nvoid SipXHandleMap::lock()\n{\n    mLock.acquire() ;\n}\n\n\nvoid SipXHandleMap::unlock() \n{\n    mLock.release() ;\n}\n\n\nSIPXHANDLE SipXHandleMap::allocHandle(const void* pData) \n{\n    lock() ;\n\n    SIPXHANDLE hCall = mNextHandle++ ;\n    insertKeyAndValue(new UtlInt(hCall), new UtlVoidPtr((void*) pData)) ;\n    addHandleRef(hCall);\n\n    unlock() ;\n\n    return hCall ;\n}\n\nconst void* SipXHandleMap::findHandle(SIPXHANDLE handle) \n{\n    lock() ;\n\n    const void* pRC = NULL ;\n    UtlInt key(handle) ;\n    UtlVoidPtr* pValue ;\n\n    pValue = (UtlVoidPtr*) findValue(&key) ;\n    if (pValue != NULL)\n    {\n        pRC = pValue->getValue() ;\n    }\n\n    unlock() ;\n\n    return pRC ;\n}\n\n\nconst void* SipXHandleMap::removeHandle(SIPXHANDLE handle) \n{\n    lock() ;\n\n    releaseHandleRef(handle);\n    const void* pRC = NULL ;\n    UtlInt key(handle) ;\n        \n    UtlInt* pCount = static_cast<UtlInt*>(mLockCountHash.findValue(&key)) ;\n        \n    if (pCount == NULL || pCount->getValue() < 1)\n    {\n        UtlVoidPtr* pValue ;\n            \n        pValue = (UtlVoidPtr*) findValue(&key) ;\n        if (pValue != NULL)\n        {\n            pRC = pValue->getValue() ;                \n            if(! destroy(&key))\n            {\n                OsSysLog::add(FAC_SIPXTAPI, PRI_ERR,\n                        \"SipXHandleMap::removeHandle failed to destroy handle: %d\",\n                        handle);\n            }\n        }\n\n        if (pCount)\n        {\n            if(! mLockCountHash.destroy(&key))\n            {\n                OsSysLog::add(FAC_SIPXTAPI, PRI_ERR,\n                        \"SipXHandleMap::removeHandle failed to destroy lock count for handle: %d\",\n                        handle);\n            }\n        }\n    }\n    \n    unlock() ;\n    return pRC ;\n}\n\n\n\/* ============================ ACCESSORS ================================= *\/\n\nvoid SipXHandleMap::dump() \n{\n    UtlHashMapIterator itor(*this) ;\n    UtlInt* pKey ;\n    UtlVoidPtr* pValue ;\n        \n    while ((pKey = (UtlInt*) itor()))\n    {\n        pValue = (UtlVoidPtr*) findValue(pKey) ;\n        printf(\"\\tkey=%08X, value=%p\\n\", pKey->getValue(), \n                pValue ? pValue->getValue() : 0) ;                        \n    }       \n}\n\n#include \"tapi\/sipXtapiInternal.h\"\n\nvoid SipXHandleMap::dumpCalls()\n{\n   UtlHashMapIterator itor(*this) ;\n   UtlInt* pKey ;\n   UtlVoidPtr* pValue ;\n\n   while ((pKey = (UtlInt*) itor()))\n   {\n      pValue = (UtlVoidPtr*) findValue(pKey) ;\n      assert(pValue != NULL);\n      SIPX_CALL_DATA* pCallData = (SIPX_CALL_DATA*)pValue->getValue();\n      printf(\"\\tkey=%08d, value=0x%p, CallId=%s SessionCallId=%s\\n\",\n         pKey->getValue(), \n         pValue->getValue(),\n         pCallData->callId?pCallData->callId->data():\"NULL\",\n         pCallData->sessionCallId?pCallData->sessionCallId->data():\"NULL\") ;\n   }\n}\n\n\/* ============================ INQUIRY =================================== *\/\n\n\/* \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ PROTECTED \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ *\/\n\n\/* \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ PRIVATE \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ *\/\n\n\/* ============================ FUNCTIONS ================================= *\/\n\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"FAST\/Exception.hpp\"\n#include \"FileStreamer.hpp\"\n#include <fstream>\n#include <chrono>\n#include \"FAST\/Data\/Image.hpp\" \/\/ TODO should not be here\n\nnamespace fast {\n\nFileStreamer::FileStreamer() {\n    mStreamIsStarted = false;\n    mNrOfReplays = 0;\n    mIsModified = true;\n    mLoop = false;\n    mStartNumber = 0;\n    mZeroFillDigits = 0;\n    mFirstFrameIsInserted = false;\n    mHasReachedEnd = false;\n    mTimestampFilename = \"\";\n    mNrOfFrames = -1;\n    mSleepTime = 0;\n    mStepSize = 1;\n    mMaximumNrOfFrames = -1;\n    mStop = false;\n}\n\nvoid FileStreamer::setNumberOfReplays(uint replays) {\n    mNrOfReplays = replays;\n}\n\nint FileStreamer::getNrOfFrames() {\n    if(mNrOfFrames == -1) {\n        if(mMaximumNrOfFrames > 0) {\n            mNrOfFrames = mMaximumNrOfFrames;\n            return mNrOfFrames;\n        }\n        int frameCounter = 0;\n        int frame = mStartNumber;\n        int currentSequence = 0;\n        while(true) {\n            std::string filename = getFilename(frame, currentSequence);\n            if(!fileExists(filename)) {\n                \/\/ If file doesn't exists, move on to next sequence or stop\n                if(currentSequence < mFilenameFormats.size()-1) {\n                    currentSequence++;\n                } else {\n                    break;\n                }\n            }\n            frame += mStepSize;\n            frameCounter++;\n        }\n        mNrOfFrames = frameCounter;\n    }\n    return mNrOfFrames;\n}\n\nvoid FileStreamer::setSleepTime(uint milliseconds) {\n    mSleepTime = milliseconds;\n}\n\nvoid FileStreamer::setMaximumNumberOfFrames(uint nrOfFrames) {\n    mMaximumNrOfFrames = nrOfFrames;\n}\n\nvoid FileStreamer::setTimestampFilename(std::string filepath) {\n    mTimestampFilename = filepath;\n}\n\nvoid FileStreamer::execute() {\n    if(mFilenameFormats.size() == 0)\n        throw Exception(\"No filename format was given to the FileStreamer\");\n    if(!mStreamIsStarted) {\n        mStreamIsStarted = true;\n        mThread = new std::thread(std::bind(&FileStreamer::producerStream, this));\n    }\n\n    \/\/ Wait here for first frame\n    std::unique_lock<std::mutex> lock(mFirstFrameMutex);\n    while(!mFirstFrameIsInserted) {\n        mFirstFrameCondition.wait(lock);\n    }\n}\n\nvoid FileStreamer::setFilenameFormat(std::string str) {\n    if(str.find(\"#\") == std::string::npos)\n        throw Exception(\"Filename format must include a hash tag # which will be replaced by a integer starting from 0.\");\n\n    mFilenameFormats.clear();\n    mFilenameFormats.push_back(str);\n}\n\nvoid FileStreamer::setFilenameFormats(std::vector<std::string> strs) {\n    for(std::string str : strs) {\n        if(str.find(\"#\") == std::string::npos)\n            throw Exception(\"Filename format must include a hash tag # which will be replaced by a integer starting from 0.\");\n    }\n    mFilenameFormats = strs;\n}\n\nvoid FileStreamer::producerStream() {\n    \/\/Streamer::pointer pointerToSelf = mPtr.lock(); \/\/ try to avoid this object from being destroyed until this function is finished\n\n    \/\/ Read timestamp file if available\n    std::ifstream timestampFile;\n    uint64_t previousTimestamp = 0;\n    auto previousTimestampTime = std::chrono::high_resolution_clock::time_point::min();\n    if(!mTimestampFilename.empty() && mUseTimestamp) {\n        timestampFile.open(mTimestampFilename.c_str());\n        if(!timestampFile.is_open()) {\n            throw Exception(\"Timestamp file not found in FileStreamer\");\n        }\n\n        \/\/ Fast forward to start\n        if(mStartNumber > 0) {\n            int i = 0;\n            while(i <= mStartNumber) {\n                std::string line;\n                std::getline(timestampFile, line);\n                ++i;\n            }\n        }\n    }\n\n    uint i = mStartNumber;\n    int replays = 0;\n    int currentSequence = 0;\n    while(true) {\n        {\n            std::unique_lock<std::mutex> lock(mStopMutex);\n            if(mStop) {\n                mStreamIsStarted = false;\n                mFirstFrameIsInserted = false;\n                mHasReachedEnd = false;\n                break;\n            }\n        }\n        std::string filename = getFilename(i, currentSequence);\n        try {\n            reportInfo() << \"Filestreamer reading \" << filename << reportEnd();\n            DataObject::pointer dataFrame = getDataFrame(filename);\n            \/\/ Set and use timestamp if available\n            if(!mTimestampFilename.empty() && mUseTimestamp) {\n                std::string line;\n                std::getline(timestampFile, line);\n                if(!line.empty()) {\n\t\t\t\t\tuint64_t timestamp = std::stoull(line);\n                    dataFrame->setCreationTimestamp(timestamp);\n                }\n            }\n\n            if(dataFrame->getCreationTimestamp() != 0 && mUseTimestamp) {\n                uint64_t timestamp = dataFrame->getCreationTimestamp();\n                \/\/ Wait as long as necessary before adding image\n                \/\/ Time passed since last frame\n                auto timePassed = std::chrono::duration_cast<std::chrono::milliseconds>(\n                        std::chrono::high_resolution_clock::now() - previousTimestampTime);\n                while (timestamp > previousTimestamp + timePassed.count()) {\n                    \/\/ Wait\n                    int64_t left = (timestamp - previousTimestamp) - timePassed.count();\n                    reportInfo() << \"Sleeping for \" << left << \" ms\" << reportEnd();\n                    std::this_thread::sleep_for(std::chrono::milliseconds(left));\n                    timePassed = std::chrono::duration_cast<std::chrono::milliseconds>(\n                            std::chrono::high_resolution_clock::now() - previousTimestampTime);\n                }\n                previousTimestamp = timestamp;\n                previousTimestampTime = std::chrono::high_resolution_clock::now();\n            }\n\n            addOutputData(0, dataFrame);\n\n            if(!mFirstFrameIsInserted) {\n                {\n                    std::lock_guard<std::mutex> lock(mFirstFrameMutex);\n                    mFirstFrameIsInserted = true;\n                }\n                mFirstFrameCondition.notify_one();\n            }\n            if(mSleepTime > 0)\n                std::this_thread::sleep_for(std::chrono::milliseconds(mSleepTime));\n            i += mStepSize;\n            if(i == mMaximumNrOfFrames) {\n                throw FileNotFoundException();\n            }\n\n        } catch(FileNotFoundException &e) {\n            if(i > 0) {\n                reportInfo() << \"Reached end of stream\" << Reporter::end();\n                \/\/ If there where no files found at all, we need to release the execute method\n                if(!mFirstFrameIsInserted) {\n                    {\n                        std::lock_guard<std::mutex> lock(mFirstFrameMutex);\n                        mFirstFrameIsInserted = true;\n                    }\n                    mFirstFrameCondition.notify_one();\n                }\n                if(mLoop ||\n                   (mNrOfReplays > 0 && replays != mNrOfReplays) ||\n                   (currentSequence < mFilenameFormats.size()-1)) {\n                    \/\/ Restart stream\n                    previousTimestamp = 0;\n                    previousTimestampTime = std::chrono::high_resolution_clock::time_point::min();\n                    if(timestampFile.is_open()) {\n                        timestampFile.seekg(0); \/\/ reset file to start\n                    }\n                    replays++;\n                    i = mStartNumber;\n                    currentSequence++;\n                    \/\/ Go to first sequence if looping is enabled\n                    if(mLoop && currentSequence == mFilenameFormats.size()) {\n                        currentSequence = 0;\n                    }\n                    continue;\n                }\n                mHasReachedEnd = true;\n                \/\/ Reached end of stream\n                break;\n            } else {\n                throw e;\n            }\n        }\n    }\n}\n\nstd::string FileStreamer::getFilename(uint i, int currentSequence) const {\n    std::string filename = mFilenameFormats[currentSequence];\n    std::string frameNumber = std::to_string(i);\n    if(mZeroFillDigits > 0 && frameNumber.size() < mZeroFillDigits) {\n            std::string zeroFilling = \"\";\n            for(uint z = 0; z < mZeroFillDigits - frameNumber.size(); z++) {\n                zeroFilling += \"0\";\n            }\n            frameNumber = zeroFilling + frameNumber;\n        }\n    filename.replace(\n                filename.find(\"#\"),\n                1,\n                frameNumber\n        );\n    return filename;\n}\n\nFileStreamer::~FileStreamer() {\n    if(mStreamIsStarted) {\n        if(mThread->get_id() != std::this_thread::get_id()) { \/\/ avoid deadlock\n            stop();\n            delete mThread;\n            mThread = NULL;\n        }\n    }\n}\n\nbool FileStreamer::hasReachedEnd() {\n    return mHasReachedEnd;\n}\n\nvoid FileStreamer::setStartNumber(uint startNumber) {\n    mStartNumber = startNumber;\n}\n\nvoid FileStreamer::setZeroFilling(uint digits) {\n    mZeroFillDigits = digits;\n}\n\nvoid FileStreamer::enableLooping() {\n    mLoop = true;\n}\n\nvoid FileStreamer::disableLooping() {\n    mLoop = false;\n}\n\nvoid FileStreamer::setStepSize(uint stepSize) {\n    if(stepSize == 0)\n        throw Exception(\"Step size given to FileStreamer can't be 0\");\n    mStepSize = stepSize;\n}\n\nvoid FileStreamer::stop() {\n    {\n        std::unique_lock<std::mutex> lock(mStopMutex);\n        mStop = true;\n    }\n    mThread->join();\n    reportInfo() << \"File streamer thread returned\" << reportEnd();\n}\n\nvoid FileStreamer::setUseTimestamp(bool use) {\n    mUseTimestamp = use;\n}\n\n} \/\/ end namespace fast\n<commit_msg>catch ThreadStopped in FileStreamer thread<commit_after>\n#include \"FAST\/Exception.hpp\"\n#include \"FileStreamer.hpp\"\n#include <fstream>\n#include <chrono>\n#include \"FAST\/Data\/Image.hpp\" \/\/ TODO should not be here\n\nnamespace fast {\n\nFileStreamer::FileStreamer() {\n    mStreamIsStarted = false;\n    mNrOfReplays = 0;\n    mIsModified = true;\n    mLoop = false;\n    mStartNumber = 0;\n    mZeroFillDigits = 0;\n    mFirstFrameIsInserted = false;\n    mHasReachedEnd = false;\n    mTimestampFilename = \"\";\n    mNrOfFrames = -1;\n    mSleepTime = 0;\n    mStepSize = 1;\n    mMaximumNrOfFrames = -1;\n    mStop = false;\n}\n\nvoid FileStreamer::setNumberOfReplays(uint replays) {\n    mNrOfReplays = replays;\n}\n\nint FileStreamer::getNrOfFrames() {\n    if(mNrOfFrames == -1) {\n        if(mMaximumNrOfFrames > 0) {\n            mNrOfFrames = mMaximumNrOfFrames;\n            return mNrOfFrames;\n        }\n        int frameCounter = 0;\n        int frame = mStartNumber;\n        int currentSequence = 0;\n        while(true) {\n            std::string filename = getFilename(frame, currentSequence);\n            if(!fileExists(filename)) {\n                \/\/ If file doesn't exists, move on to next sequence or stop\n                if(currentSequence < mFilenameFormats.size()-1) {\n                    currentSequence++;\n                } else {\n                    break;\n                }\n            }\n            frame += mStepSize;\n            frameCounter++;\n        }\n        mNrOfFrames = frameCounter;\n    }\n    return mNrOfFrames;\n}\n\nvoid FileStreamer::setSleepTime(uint milliseconds) {\n    mSleepTime = milliseconds;\n}\n\nvoid FileStreamer::setMaximumNumberOfFrames(uint nrOfFrames) {\n    mMaximumNrOfFrames = nrOfFrames;\n}\n\nvoid FileStreamer::setTimestampFilename(std::string filepath) {\n    mTimestampFilename = filepath;\n}\n\nvoid FileStreamer::execute() {\n    if(mFilenameFormats.size() == 0)\n        throw Exception(\"No filename format was given to the FileStreamer\");\n    if(!mStreamIsStarted) {\n        mStreamIsStarted = true;\n        mThread = new std::thread(std::bind(&FileStreamer::producerStream, this));\n    }\n\n    \/\/ Wait here for first frame\n    std::unique_lock<std::mutex> lock(mFirstFrameMutex);\n    while(!mFirstFrameIsInserted) {\n        mFirstFrameCondition.wait(lock);\n    }\n}\n\nvoid FileStreamer::setFilenameFormat(std::string str) {\n    if(str.find(\"#\") == std::string::npos)\n        throw Exception(\"Filename format must include a hash tag # which will be replaced by a integer starting from 0.\");\n\n    mFilenameFormats.clear();\n    mFilenameFormats.push_back(str);\n}\n\nvoid FileStreamer::setFilenameFormats(std::vector<std::string> strs) {\n    for(std::string str : strs) {\n        if(str.find(\"#\") == std::string::npos)\n            throw Exception(\"Filename format must include a hash tag # which will be replaced by a integer starting from 0.\");\n    }\n    mFilenameFormats = strs;\n}\n\nvoid FileStreamer::producerStream() {\n    \/\/Streamer::pointer pointerToSelf = mPtr.lock(); \/\/ try to avoid this object from being destroyed until this function is finished\n\n    \/\/ Read timestamp file if available\n    std::ifstream timestampFile;\n    uint64_t previousTimestamp = 0;\n    auto previousTimestampTime = std::chrono::high_resolution_clock::time_point::min();\n    if(!mTimestampFilename.empty() && mUseTimestamp) {\n        timestampFile.open(mTimestampFilename.c_str());\n        if(!timestampFile.is_open()) {\n            throw Exception(\"Timestamp file not found in FileStreamer\");\n        }\n\n        \/\/ Fast forward to start\n        if(mStartNumber > 0) {\n            int i = 0;\n            while(i <= mStartNumber) {\n                std::string line;\n                std::getline(timestampFile, line);\n                ++i;\n            }\n        }\n    }\n\n    uint i = mStartNumber;\n    int replays = 0;\n    int currentSequence = 0;\n    while(true) {\n        {\n            std::unique_lock<std::mutex> lock(mStopMutex);\n            if(mStop) {\n                mStreamIsStarted = false;\n                mFirstFrameIsInserted = false;\n                mHasReachedEnd = false;\n                break;\n            }\n        }\n        std::string filename = getFilename(i, currentSequence);\n        try {\n            reportInfo() << \"Filestreamer reading \" << filename << reportEnd();\n            DataObject::pointer dataFrame = getDataFrame(filename);\n            \/\/ Set and use timestamp if available\n            if(!mTimestampFilename.empty() && mUseTimestamp) {\n                std::string line;\n                std::getline(timestampFile, line);\n                if(!line.empty()) {\n\t\t\t\t\tuint64_t timestamp = std::stoull(line);\n                    dataFrame->setCreationTimestamp(timestamp);\n                }\n            }\n\n            if(dataFrame->getCreationTimestamp() != 0 && mUseTimestamp) {\n                uint64_t timestamp = dataFrame->getCreationTimestamp();\n                \/\/ Wait as long as necessary before adding image\n                \/\/ Time passed since last frame\n                auto timePassed = std::chrono::duration_cast<std::chrono::milliseconds>(\n                        std::chrono::high_resolution_clock::now() - previousTimestampTime);\n                while (timestamp > previousTimestamp + timePassed.count()) {\n                    \/\/ Wait\n                    int64_t left = (timestamp - previousTimestamp) - timePassed.count();\n                    reportInfo() << \"Sleeping for \" << left << \" ms\" << reportEnd();\n                    std::this_thread::sleep_for(std::chrono::milliseconds(left));\n                    timePassed = std::chrono::duration_cast<std::chrono::milliseconds>(\n                            std::chrono::high_resolution_clock::now() - previousTimestampTime);\n                }\n                previousTimestamp = timestamp;\n                previousTimestampTime = std::chrono::high_resolution_clock::now();\n            }\n\n            addOutputData(0, dataFrame);\n\n            if(!mFirstFrameIsInserted) {\n                {\n                    std::lock_guard<std::mutex> lock(mFirstFrameMutex);\n                    mFirstFrameIsInserted = true;\n                }\n                mFirstFrameCondition.notify_one();\n            }\n            if(mSleepTime > 0)\n                std::this_thread::sleep_for(std::chrono::milliseconds(mSleepTime));\n            i += mStepSize;\n            if(i == mMaximumNrOfFrames) {\n                throw FileNotFoundException();\n            }\n\n        } catch(FileNotFoundException &e) {\n            if(i > 0) {\n                reportInfo() << \"Reached end of stream\" << Reporter::end();\n                \/\/ If there where no files found at all, we need to release the execute method\n                if(!mFirstFrameIsInserted) {\n                    {\n                        std::lock_guard<std::mutex> lock(mFirstFrameMutex);\n                        mFirstFrameIsInserted = true;\n                    }\n                    mFirstFrameCondition.notify_one();\n                }\n                if(mLoop ||\n                   (mNrOfReplays > 0 && replays != mNrOfReplays) ||\n                   (currentSequence < mFilenameFormats.size()-1)) {\n                    \/\/ Restart stream\n                    previousTimestamp = 0;\n                    previousTimestampTime = std::chrono::high_resolution_clock::time_point::min();\n                    if(timestampFile.is_open()) {\n                        timestampFile.seekg(0); \/\/ reset file to start\n                    }\n                    replays++;\n                    i = mStartNumber;\n                    currentSequence++;\n                    \/\/ Go to first sequence if looping is enabled\n                    if(mLoop && currentSequence == mFilenameFormats.size()) {\n                        currentSequence = 0;\n                    }\n                    continue;\n                }\n                mHasReachedEnd = true;\n                \/\/ Reached end of stream\n                break;\n            } else {\n                throw e;\n            }\n        } catch(ThreadStopped &e) {\n            break;\n        }\n    }\n}\n\nstd::string FileStreamer::getFilename(uint i, int currentSequence) const {\n    std::string filename = mFilenameFormats[currentSequence];\n    std::string frameNumber = std::to_string(i);\n    if(mZeroFillDigits > 0 && frameNumber.size() < mZeroFillDigits) {\n            std::string zeroFilling = \"\";\n            for(uint z = 0; z < mZeroFillDigits - frameNumber.size(); z++) {\n                zeroFilling += \"0\";\n            }\n            frameNumber = zeroFilling + frameNumber;\n        }\n    filename.replace(\n                filename.find(\"#\"),\n                1,\n                frameNumber\n        );\n    return filename;\n}\n\nFileStreamer::~FileStreamer() {\n    if(mStreamIsStarted) {\n        if(mThread->get_id() != std::this_thread::get_id()) { \/\/ avoid deadlock\n            stop();\n            delete mThread;\n            mThread = NULL;\n        }\n    }\n}\n\nbool FileStreamer::hasReachedEnd() {\n    return mHasReachedEnd;\n}\n\nvoid FileStreamer::setStartNumber(uint startNumber) {\n    mStartNumber = startNumber;\n}\n\nvoid FileStreamer::setZeroFilling(uint digits) {\n    mZeroFillDigits = digits;\n}\n\nvoid FileStreamer::enableLooping() {\n    mLoop = true;\n}\n\nvoid FileStreamer::disableLooping() {\n    mLoop = false;\n}\n\nvoid FileStreamer::setStepSize(uint stepSize) {\n    if(stepSize == 0)\n        throw Exception(\"Step size given to FileStreamer can't be 0\");\n    mStepSize = stepSize;\n}\n\nvoid FileStreamer::stop() {\n    {\n        std::unique_lock<std::mutex> lock(mStopMutex);\n        mStop = true;\n    }\n    mThread->join();\n    reportInfo() << \"File streamer thread returned\" << reportEnd();\n}\n\nvoid FileStreamer::setUseTimestamp(bool use) {\n    mUseTimestamp = use;\n}\n\n} \/\/ end namespace fast\n<|endoftext|>"}
{"text":"<commit_before>\/\/ --------------------------------------------------------\n\/\/ Code generated by Papyrus C++\n\/\/ --------------------------------------------------------\n\n#define Annotator_AnnotatorLib_Session_BODY\n\n\/************************************************************\n Session class body\n ************************************************************\/\n\n\/\/ include associated header file\n#include \"AnnotatorLib\/Session.h\"\n#include <algorithm>\n\nnamespace AnnotatorLib {\n\nSession::Session() {}\n\nSession::~Session() {\n  clearAll();\n}\n\nvoid Session::clearData() {\n  \/\/ clear data\n  this->objects.clear();\n  this->frames.clear();\n  this->annotations.clear();\n  this->classes.clear();\n  this->attributes.clear();\n}\n\nvoid Session::clearAll() {\n  \/\/ clear all\n  clearData();\n  this->commands.clear();\n  commandIndex = 0;\n}\n\ntemplate<typename K, typename T>\nstd::shared_ptr<T> find_smart_pointer( std::unordered_map< K, std::shared_ptr<T>> map, K key ) {\n    auto got = map.find(key);\n    if(got != map.end()) {\n      return got->second;\n    }\n    return shared_ptr<T>(nullptr);\n}\n\ntemplate<typename K, typename T>\nT* find_raw_pointer( std::unordered_map< K, std::shared_ptr<T>> map, K key ) {\n    return find_smart_pointer<K,T>(map, key).get();\n}\n\nbool Session::addAttribute(const shared_ptr<Attribute> attribute) {\n  if (attribute) return false;\n  return attributes.insert(std::make_pair(attribute->getId(), std::move(attribute))).second;\n}\n\nshared_ptr<Attribute> Session::removeAttribute(Attribute *attribute) {\n  std::shared_ptr<Attribute> got = find_smart_pointer<unsigned long, Attribute>(attributes, attribute->getId());\n  if(got) {\n    attributes.erase(attribute->getId());\n  }\n  return got;\n}\n\nshared_ptr<Attribute> Session::getAttribute(unsigned long id) const {\n  return find_smart_pointer<unsigned long, Attribute>(attributes, id);\n}\n\nbool Session::addAnnotation(shared_ptr<Annotation> annotation, bool add_associated_objects) {\n  if (annotation.get() == nullptr) return false;\n  auto result = annotations.insert(std::make_pair(annotation->getId(), std::move(annotation)));\n  if (result.second) {\n      Annotation::registerAnnotation(result.first->second);\n      if (add_associated_objects) {\n        addObject( shared_ptr<Object>(result.first->second->getObject()), false);\n        addFrame( shared_ptr<Frame>(result.first->second->getFrame()), false);\n      }\n  }\n  return result.second;\n}\n\nshared_ptr<Annotation> Session::removeAnnotation(unsigned long id, bool unregister) {\n  shared_ptr<Annotation> got = find_smart_pointer<unsigned long, Annotation>(annotations, id);\n  if(got) {\n    if (unregister)\n        Annotation::unregisterAnnotation(got);\n    annotations.erase(id);\n  }\n  return got;\n}\n\nshared_ptr<Annotation> Session::getAnnotation(unsigned long id) const {\n  return find_smart_pointer<unsigned long, Annotation>(annotations, id);\n}\n\nshared_ptr<Annotation> Session::getAnnotation(const shared_ptr<Frame> frame, const shared_ptr<Object> obj) const {\n  return getAnnotation(Annotation::genId(frame, obj));\n}\n\nbool Session::addClass(shared_ptr<Class> c) {\n  if (c.get() == nullptr) return false;\n  std::string key = c->getName();\n  return classes.insert(std::make_pair(key, std::move(c))).second;\n}\n\nshared_ptr<Class> Session::removeClass(Class *c) {\n  if (c == nullptr) return shared_ptr<Class>(nullptr);\n  shared_ptr<Class> got = find_smart_pointer<std::string, Class>(classes, c->getName());\n  if(got) {\n    classes.erase (c->getName());\n  }\n  return got;\n}\n\nshared_ptr<Class> Session::getClass(std::string name) const {\n  return find_smart_pointer<std::string, Class>(classes, name);\n}\n\nshared_ptr<Class> Session::getClass(unsigned long id) const {\n  for (auto& pair : classes) {\n    if (pair.second->getId() == id) return pair.second;\n  }\n  return shared_ptr<Class>(nullptr);\n}\n\nbool Session::addFrame(shared_ptr<Frame> frame, bool add_associated_objects) {\n  if (frame.get() == nullptr) return false;\n  auto result = frames.insert(std::make_pair(frame->getId(), frame));\n  if (result.second && add_associated_objects && result.first->second->hasAnnotations()) {\n    \/\/ will add all annotations\n    for (std::pair<unsigned long, weak_ptr<Annotation>> pair  : frame->getAnnotations()) {\n      addAnnotation(shared_ptr<Annotation>(pair.second), false);\n    }\n  }\n  return result.second;\n}\n\nshared_ptr<Frame> Session::removeFrame(unsigned long frame_nmb, bool remove_annotations) {\n  shared_ptr<Frame> got = find_smart_pointer<unsigned long, Frame>(frames, frame_nmb);\n  if(got) {\n    frames.erase (frame_nmb);\n    if (remove_annotations) {\n      for (std::pair<unsigned long, weak_ptr<Annotation>> pair : got->getAnnotations()) {\n          removeAnnotation(pair.second.lock()->getId(), false);\n      }\n    }\n  }\n  return got;\n}\n\nshared_ptr<Frame> Session::getFrame(unsigned long number) {\n  return find_smart_pointer<unsigned long, Frame>(frames, number);\n\/\/  if (got) return got;\n\/\/  shared_ptr<Frame> f = std::make_shared<Frame>(number);\n\/\/  addFrame(f);  \/\/is this really a good idea?\n\/\/  return f;\n}\n\nbool Session::addObject(shared_ptr<Object> object, bool add_associated_objects) {\n  if (object) return false;\n  auto result = objects.insert(std::make_pair(object->getId(), std::move(object)));\n  if (result.second && add_associated_objects && result.first->second->hasAnnotations()) {\n    \/\/ will add all annotations\n    for (auto& pair : result.first->second->getAnnotations()) {\n      addAnnotation(pair.second.lock(), false);\n    }\n  }\n  if (result.second && add_associated_objects && result.first->second->getClass())\n    addClass(shared_ptr<Class>(result.first->second->getClass()));\n  return result.second;\n}\n\nshared_ptr<Object> Session::removeObject(unsigned long id, bool remove_annotations) {\n  shared_ptr<Object> got = find_smart_pointer<unsigned long, Object>(objects, id);\n  if(got) {\n    if (remove_annotations) {\n      for (auto& pair : got->getAnnotations()) {\n        removeAnnotation(pair.second.lock()->getId(), false);  \/\/ will remove annotations\n      }\n    }\n    objects.erase (id);\n  }\n  return got;\n}\n\nshared_ptr<Object> Session::getObject(unsigned long id) const {\n  return find_smart_pointer<unsigned long, Object>(objects, id);\n}\n\nshared_ptr<Commands::Command> Session::execute(shared_ptr<Commands::Command> command) {\n  if (!command)\n    return shared_ptr<AnnotatorLib::Commands::Command>(nullptr);\n  commands.erase(commands.begin() + commandIndex, commands.end());\n  commands.push_back(std::move(command));\n  commandIndex++;\n  bool success = commands[commandIndex - 1]->execute(); \/\/execute new command\n  if (success)\n    return commands[commandIndex - 1];\n  return shared_ptr<AnnotatorLib::Commands::Command>(nullptr);\n}\n\nshared_ptr<Commands::Command> Session::redo() {\n  if (commands.size() > commandIndex) {\n    shared_ptr<AnnotatorLib::Commands::Command> command = commands.at(commandIndex);\n    commandIndex++;\n    bool success = command->execute();\n    if (success) return command;\n  }\n  return shared_ptr<AnnotatorLib::Commands::Command>(nullptr);\n}\n\nshared_ptr<Commands::Command> Session::undo() {\n  if (commandIndex > 0) {\n    commandIndex--;\n    shared_ptr<AnnotatorLib::Commands::Command> command = commands.at(commandIndex);\n    bool success = command->undo();\n    if (success) return command;\n  }\n  return shared_ptr<AnnotatorLib::Commands::Command>(nullptr);\n}\n\n\/\/ static attributes (if any)\n\n}  \/\/ of namespace AnnotatorLib\n\n\/************************************************************\n End of Session class body\n ************************************************************\/\n<commit_msg>fix previous commit<commit_after>\/\/ --------------------------------------------------------\n\/\/ Code generated by Papyrus C++\n\/\/ --------------------------------------------------------\n\n#define Annotator_AnnotatorLib_Session_BODY\n\n\/************************************************************\n Session class body\n ************************************************************\/\n\n\/\/ include associated header file\n#include \"AnnotatorLib\/Session.h\"\n#include <algorithm>\n\nnamespace AnnotatorLib {\n\nSession::Session() {}\n\nSession::~Session() {\n  clearAll();\n}\n\nvoid Session::clearData() {\n  \/\/ clear data\n  this->objects.clear();\n  this->frames.clear();\n  this->annotations.clear();\n  this->classes.clear();\n  this->attributes.clear();\n}\n\nvoid Session::clearAll() {\n  \/\/ clear all\n  clearData();\n  this->commands.clear();\n  commandIndex = 0;\n}\n\ntemplate<typename K, typename T>\nstd::shared_ptr<T> find_smart_pointer( std::unordered_map< K, std::shared_ptr<T>> map, K key ) {\n    auto got = map.find(key);\n    if(got != map.end()) {\n      return got->second;\n    }\n    return shared_ptr<T>(nullptr);\n}\n\ntemplate<typename K, typename T>\nT* find_raw_pointer( std::unordered_map< K, std::shared_ptr<T>> map, K key ) {\n    return find_smart_pointer<K,T>(map, key).get();\n}\n\nbool Session::addAttribute(const shared_ptr<Attribute> attribute) {\n  if (attribute) return false;\n  return attributes.insert(std::make_pair(attribute->getId(), std::move(attribute))).second;\n}\n\nshared_ptr<Attribute> Session::removeAttribute(Attribute *attribute) {\n  std::shared_ptr<Attribute> got = find_smart_pointer<unsigned long, Attribute>(attributes, attribute->getId());\n  if(got) {\n    attributes.erase(attribute->getId());\n  }\n  return got;\n}\n\nshared_ptr<Attribute> Session::getAttribute(unsigned long id) const {\n  return find_smart_pointer<unsigned long, Attribute>(attributes, id);\n}\n\nbool Session::addAnnotation(shared_ptr<Annotation> annotation, bool add_associated_objects) {\n  if (annotation.get() == nullptr) return false;\n  auto result = annotations.insert(std::make_pair(annotation->getId(), std::move(annotation)));\n  if (result.second) {\n      Annotation::registerAnnotation(result.first->second);\n      if (add_associated_objects) {\n        addObject( shared_ptr<Object>(result.first->second->getObject()), false);\n        addFrame( shared_ptr<Frame>(result.first->second->getFrame()), false);\n      }\n  }\n  return result.second;\n}\n\nshared_ptr<Annotation> Session::removeAnnotation(unsigned long id, bool unregister) {\n  shared_ptr<Annotation> got = find_smart_pointer<unsigned long, Annotation>(annotations, id);\n  if(got) {\n    if (unregister)\n        Annotation::unregisterAnnotation(got);\n    annotations.erase(id);\n  }\n  return got;\n}\n\nshared_ptr<Annotation> Session::getAnnotation(unsigned long id) const {\n  return find_smart_pointer<unsigned long, Annotation>(annotations, id);\n}\n\nshared_ptr<Annotation> Session::getAnnotation(const shared_ptr<Frame> frame, const shared_ptr<Object> obj) const {\n  return getAnnotation(Annotation::genId(frame, obj));\n}\n\nbool Session::addClass(shared_ptr<Class> c) {\n  if (c.get() == nullptr) return false;\n  std::string key = c->getName();\n  return classes.insert(std::make_pair(key, std::move(c))).second;\n}\n\nshared_ptr<Class> Session::removeClass(Class *c) {\n  if (c == nullptr) return shared_ptr<Class>(nullptr);\n  shared_ptr<Class> got = find_smart_pointer<std::string, Class>(classes, c->getName());\n  if(got) {\n    classes.erase (c->getName());\n  }\n  return got;\n}\n\nshared_ptr<Class> Session::getClass(std::string name) const {\n  return find_smart_pointer<std::string, Class>(classes, name);\n}\n\nshared_ptr<Class> Session::getClass(unsigned long id) const {\n  for (auto& pair : classes) {\n    if (pair.second->getId() == id) return pair.second;\n  }\n  return shared_ptr<Class>(nullptr);\n}\n\nbool Session::addFrame(shared_ptr<Frame> frame, bool add_associated_objects) {\n  if (frame.get() == nullptr) return false;\n  auto result = frames.insert(std::make_pair(frame->getId(), frame));\n  if (result.second && add_associated_objects && result.first->second->hasAnnotations()) {\n    \/\/ will add all annotations\n    for (std::pair<unsigned long, weak_ptr<Annotation>> pair  : frame->getAnnotations()) {\n      addAnnotation(shared_ptr<Annotation>(pair.second), false);\n    }\n  }\n  return result.second;\n}\n\nshared_ptr<Frame> Session::removeFrame(unsigned long frame_nmb, bool remove_annotations) {\n  shared_ptr<Frame> got = find_smart_pointer<unsigned long, Frame>(frames, frame_nmb);\n  if(got) {\n    frames.erase (frame_nmb);\n    if (remove_annotations) {\n      for (std::pair<unsigned long, weak_ptr<Annotation>> pair : got->getAnnotations()) {\n          removeAnnotation(pair.second.lock()->getId(), false);\n      }\n    }\n  }\n  return got;\n}\n\nshared_ptr<Frame> Session::getFrame(unsigned long number) {\n  return find_smart_pointer<unsigned long, Frame>(frames, number);\n\/\/  if (got) return got;\n\/\/  shared_ptr<Frame> f = std::make_shared<Frame>(number);\n\/\/  addFrame(f);  \/\/is this really a good idea?\n\/\/  return f;\n}\n\nbool Session::addObject(shared_ptr<Object> object, bool add_associated_objects) {\n  if (!object) return false;\n  auto result = objects.insert(std::make_pair(object->getId(), std::move(object)));\n  if (result.second && add_associated_objects && result.first->second->hasAnnotations()) {\n    \/\/ will add all annotations\n    for (auto& pair : result.first->second->getAnnotations()) {\n      addAnnotation(pair.second.lock(), false);\n    }\n  }\n  if (result.second && add_associated_objects && result.first->second->getClass())\n    addClass(shared_ptr<Class>(result.first->second->getClass()));\n  return result.second;\n}\n\nshared_ptr<Object> Session::removeObject(unsigned long id, bool remove_annotations) {\n  shared_ptr<Object> got = find_smart_pointer<unsigned long, Object>(objects, id);\n  if(got) {\n    if (remove_annotations) {\n      for (auto& pair : got->getAnnotations()) {\n        removeAnnotation(pair.second.lock()->getId(), false);  \/\/ will remove annotations\n      }\n    }\n    objects.erase (id);\n  }\n  return got;\n}\n\nshared_ptr<Object> Session::getObject(unsigned long id) const {\n  return find_smart_pointer<unsigned long, Object>(objects, id);\n}\n\nshared_ptr<Commands::Command> Session::execute(shared_ptr<Commands::Command> command) {\n  if (!command)\n    return shared_ptr<AnnotatorLib::Commands::Command>(nullptr);\n  commands.erase(commands.begin() + commandIndex, commands.end());\n  commands.push_back(std::move(command));\n  commandIndex++;\n  bool success = commands[commandIndex - 1]->execute(); \/\/execute new command\n  if (success)\n    return commands[commandIndex - 1];\n  return shared_ptr<AnnotatorLib::Commands::Command>(nullptr);\n}\n\nshared_ptr<Commands::Command> Session::redo() {\n  if (commands.size() > commandIndex) {\n    shared_ptr<AnnotatorLib::Commands::Command> command = commands.at(commandIndex);\n    commandIndex++;\n    bool success = command->execute();\n    if (success) return command;\n  }\n  return shared_ptr<AnnotatorLib::Commands::Command>(nullptr);\n}\n\nshared_ptr<Commands::Command> Session::undo() {\n  if (commandIndex > 0) {\n    commandIndex--;\n    shared_ptr<AnnotatorLib::Commands::Command> command = commands.at(commandIndex);\n    bool success = command->undo();\n    if (success) return command;\n  }\n  return shared_ptr<AnnotatorLib::Commands::Command>(nullptr);\n}\n\n\/\/ static attributes (if any)\n\n}  \/\/ of namespace AnnotatorLib\n\n\/************************************************************\n End of Session class body\n ************************************************************\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"departure_board.h\"\n#include \"parse_request.h\"\n#include \"get_stop_times.h\"\n#include \"type\/pb_converter.h\"\n\n#include \"boost\/lexical_cast.hpp\"\n#include \"boost\/date_time\/posix_time\/posix_time.hpp\"\nnamespace navitia { namespace timetables {\n\nstd::vector<vector_datetime> make_columuns(const vector_dt_st &stop_times) {\n    std::vector<vector_datetime> result;\n    routing::DateTime prev_date = routing::DateTime::inf;\n\n    for(auto & item : stop_times) {\n        if(prev_date == routing::DateTime:: inf || (prev_date.hour()\/3600) != (item.first.hour()\/3600)) {\n            \/\/On supprime les doublons\n            if(result.size() > 0) {\n                auto it = std::unique(result.back().begin(), result.back().end());\n                result.back().resize(std::distance(result.back().begin(), it));\n            }\n            result.push_back(vector_datetime());\n        }\n\n        result.back().push_back(item.first);\n        prev_date = item.first;\n    }\n\n\n    if(result.size() > 0) {\n        auto it = std::unique(result.back().begin(), result.back().end());\n        result.back().resize(std::distance(result.back().begin(), it));\n    }\n\n    return result;\n}\n\npbnavitia::Response departure_board(const std::string &request, const std::string &date, uint32_t duration, const type::Data &data) {\n\n    request_parser parser(\"DEPARTURE_BOARD\", request, date,  duration, data);\n\n\n    parser.pb_response.set_requested_api(pbnavitia::DEPARTURE_BOARD);\n    if(parser.pb_response.has_error())\n        return parser.pb_response;\n\n    if(parser.route_points.size() == 0)\n        return parser.pb_response;\n\n    pbnavitia::DepartureBoard * dep_board = parser.pb_response.mutable_departure_board();\n\n    std::map<stop_point_line, vector_dt_st> map_line_stop_point;\n    \/\/ On regroupe entre eux les stop_times appartenant au meme couple (stop_point, line)\n    for(type::idx_t route_point_idx : parser.route_points) {\n        auto stop_point_idx = data.pt_data.route_points[route_point_idx].stop_point_idx;\n        auto line_idx = data.pt_data.routes[data.pt_data.route_points[route_point_idx].route_idx].line_idx;\n       \n        auto stop_times = get_stop_times({route_point_idx}, parser.date_time, parser.max_datetime, std::numeric_limits<int>::max(), data);\n\n        auto key = std::make_pair(stop_point_idx, line_idx);\n        auto iter = map_line_stop_point.find(key);\n        if(iter == map_line_stop_point.end()) {\n            iter = map_line_stop_point.insert(std::make_pair(key, vector_dt_st())).first;\n        }\n\n        iter->second.insert(iter->second.end(), stop_times.begin(), stop_times.end());\n    }\n\n\n    for(auto id_vec : map_line_stop_point) {\n        auto board = dep_board->add_boards();\n        fill_pb_object(id_vec.first.first, data, board->mutable_stop_point());\n        fill_pb_object(id_vec.first.second, data, board->mutable_line());\n\n        auto vec_st = id_vec.second;\n        std::sort(vec_st.begin(), vec_st.end(),\n                  [](dt_st d1, dt_st d2) {\n                    return (d1.first.hour() \/ routing::DateTime::NB_SECONDS_DAY) < (d2.first.hour() \/ routing::DateTime::NB_SECONDS_DAY);\n                  });\n\n        for(auto vec : make_columuns(vec_st)) {\n            pbnavitia::BoardItem *item = board->add_board_items();\n\n            for(routing::DateTime dt : vec) {\n                if(!item->has_hour())\n                    item->set_hour(boost::lexical_cast<std::string>(dt.hour()\/3600));\n                item->add_minutes(boost::lexical_cast<std::string>((dt.hour()%3600)\/60));\n            }\n        }\n    }\n\n    return parser.pb_response;\n}\n\n\n\n\n\n}\n\n}\n<commit_msg>Departure board : Correction du tri des horaires<commit_after>#include \"departure_board.h\"\n#include \"parse_request.h\"\n#include \"get_stop_times.h\"\n#include \"type\/pb_converter.h\"\n\n#include \"boost\/lexical_cast.hpp\"\n#include \"boost\/date_time\/posix_time\/posix_time.hpp\"\nnamespace navitia { namespace timetables {\n\nstd::vector<vector_datetime> make_columuns(const vector_dt_st &stop_times) {\n    std::vector<vector_datetime> result;\n    routing::DateTime prev_date = routing::DateTime::inf;\n\n    for(auto & item : stop_times) {\n        if(prev_date == routing::DateTime:: inf || (prev_date.hour()\/3600) != (item.first.hour()\/3600)) {\n            \/\/On supprime les doublons\n            if(result.size() > 0) {\n                auto it = std::unique(result.back().begin(), result.back().end());\n                result.back().resize(std::distance(result.back().begin(), it));\n            }\n            result.push_back(vector_datetime());\n        }\n\n        result.back().push_back(item.first);\n        prev_date = item.first;\n    }\n\n\n    if(result.size() > 0) {\n        auto it = std::unique(result.back().begin(), result.back().end());\n        result.back().resize(std::distance(result.back().begin(), it));\n    }\n\n    return result;\n}\n\npbnavitia::Response departure_board(const std::string &request, const std::string &date, uint32_t duration, const type::Data &data) {\n\n    request_parser parser(\"DEPARTURE_BOARD\", request, date,  duration, data);\n\n\n    parser.pb_response.set_requested_api(pbnavitia::DEPARTURE_BOARD);\n    if(parser.pb_response.has_error())\n        return parser.pb_response;\n\n    if(parser.route_points.size() == 0)\n        return parser.pb_response;\n\n    pbnavitia::DepartureBoard * dep_board = parser.pb_response.mutable_departure_board();\n\n    std::map<stop_point_line, vector_dt_st> map_line_stop_point;\n    \/\/ On regroupe entre eux les stop_times appartenant au meme couple (stop_point, line)\n    for(type::idx_t route_point_idx : parser.route_points) {\n        auto stop_point_idx = data.pt_data.route_points[route_point_idx].stop_point_idx;\n        auto line_idx = data.pt_data.routes[data.pt_data.route_points[route_point_idx].route_idx].line_idx;\n       \n        auto stop_times = get_stop_times({route_point_idx}, parser.date_time, parser.max_datetime, std::numeric_limits<int>::max(), data);\n\n        auto key = std::make_pair(stop_point_idx, line_idx);\n        auto iter = map_line_stop_point.find(key);\n        if(iter == map_line_stop_point.end()) {\n            iter = map_line_stop_point.insert(std::make_pair(key, vector_dt_st())).first;\n        }\n\n        iter->second.insert(iter->second.end(), stop_times.begin(), stop_times.end());\n    }\n\n\n    for(auto id_vec : map_line_stop_point) {\n        auto board = dep_board->add_boards();\n        fill_pb_object(id_vec.first.first, data, board->mutable_stop_point());\n        fill_pb_object(id_vec.first.second, data, board->mutable_line());\n\n        auto vec_st = id_vec.second;\n        std::sort(vec_st.begin(), vec_st.end(),\n                  [&](dt_st d1, dt_st d2) {\n                    return std::abs((d1.first.hour() % routing::DateTime::NB_SECONDS_DAY)-parser.date_time.hour())\n                        <  std::abs((d2.first.hour() % routing::DateTime::NB_SECONDS_DAY)-parser.date_time.hour());\n                  });\n\n        for(auto vec : make_columuns(vec_st)) {\n            pbnavitia::BoardItem *item = board->add_board_items();\n\n            for(routing::DateTime dt : vec) {\n                if(!item->has_hour())\n                    item->set_hour(boost::lexical_cast<std::string>(dt.hour()\/3600));\n                item->add_minutes(boost::lexical_cast<std::string>((dt.hour()%3600)\/60));\n            }\n        }\n    }\n\n    return parser.pb_response;\n}\n\n\n\n\n\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"VoiceDB.h\"\n\nusing namespace std;\n\nVoiceDB::VoiceDB():path_singer(\"\") {}\n\nVoiceDB::VoiceDB(string path_singer)\n{\n  setSingerPath(path_singer);\n}\n\nVoiceDB::~VoiceDB() {}\n\nbool VoiceDB::initVoiceMap()\n{\n  namespace fs = boost::filesystem;\n  const fs::path path(path_singer);\n\n  if (fs::is_directory(path)) {\n    BOOST_FOREACH(const fs::path& p, std::make_pair(fs::recursive_directory_iterator(path), fs::recursive_directory_iterator())) {\n      if (p.leaf().string() == \"oto.ini\") {\n        cout << \"loading \" << p.string() << endl;\n        initVoiceMap(p.string());\n      }\n    }\n    if (voice_map.size() > 0)\n      return true;\n  }\n\n  cerr << \"[VoiceDB::initVoiceMap] path_singer is invalid\" << endl;\n  return false;\n}\n\nbool VoiceDB::initVoiceMap(string path_oto_ini)\n{\n  ifstream ifs(path_oto_ini.c_str());\n  boost::filesystem::path path_ini(path_oto_ini);\n  string buf, wav_ext=\".wav\";\n  while(ifs && getline(ifs, buf)) {\n    \/\/ read oto.ini\n    Voice tmp_voice(this);\n    vector<string> v1, v2;\n    boost::algorithm::split(v1, buf, boost::is_any_of(\"=\"));\n    boost::algorithm::split(v2, v1[1], boost::is_any_of(\",\"));\n    short tmp;\n    tmp_voice.setWavPath(path_ini.parent_path().string()+\"\/\"+v1[0]);\n    tmp_voice.offs = (((tmp=boost::lexical_cast<double>(v2[1]))>0))?tmp:0;\n    tmp_voice.cons = (((tmp=boost::lexical_cast<double>(v2[2]))>0))?tmp:0;\n    tmp_voice.blnk = boost::lexical_cast<double>(v2[3]);\n    tmp_voice.prec = boost::lexical_cast<double>(v2[4]);\n    tmp_voice.ovrl = boost::lexical_cast<double>(v2[5]);\n    tmp_voice.is_vcv = false;\n    \/\/ sanitize\n    if (tmp_voice.ovrl < 0) {\n      tmp_voice.ovrl *= -1;\n      tmp_voice.offs -= tmp_voice.ovrl;\n      tmp_voice.cons += tmp_voice.ovrl;\n      tmp_voice.prec += tmp_voice.ovrl;\n      if (tmp_voice.blnk < 0) {\n        tmp_voice.blnk -= tmp_voice.ovrl;\n      }\n    }\n    if (tmp_voice.ovrl > tmp_voice.prec) {\n      tmp_voice.prec = tmp_voice.ovrl;\n    }\n    if (tmp_voice.prec > tmp_voice.cons) {\n      tmp_voice.cons = tmp_voice.prec;\n    }\n    if (tmp_voice.blnk<0 && tmp_voice.cons > -tmp_voice.blnk) {\n      tmp_voice.blnk = -tmp_voice.cons;\n    }\n    \/\/ get Voice pron\n    {\n      string tmp_alias = v2[0];\n      tmp_voice.pron = tmp_voice.prefix = tmp_voice.suffix = \"\";\n      \/\/ get prefix\n      string::size_type pos_prefix = tmp_alias.find(\" \");\n      if (tmp_alias.size()>1 && pos_prefix != string::npos) {\n        tmp_voice.prefix = tmp_alias.substr(0, pos_prefix+1);\n        tmp_alias.erase(0, pos_prefix+1);\n        if (tmp_voice.prefix!=\"- \" && tmp_voice.prefix!=\"* \") {\n          tmp_voice.is_vcv = true;\n        }\n      }\n      \/\/ get suffix\n      if (tmp_alias.size() > 2) {\n        string tmp_suffix = tmp_alias.substr(tmp_alias.size()-2);\n        if (isalpha(tmp_suffix[0]) && isdigit(tmp_suffix[1])) {\n          tmp_voice.suffix = tmp_suffix;\n          tmp_alias.erase(tmp_alias.size()-2, 2);\n        }\n      }\n      tmp_voice.pron = tmp_alias;\n    }\n    \/\/ set vowel_map\n    if (!tmp_voice.is_vcv) {\n      map<string, string>::const_iterator it = nak::getVow2PronIt(tmp_voice.pron);\n      if (it!=nak::vow2pron.end()) {\n        WavParser wav_parser(tmp_voice.path_wav.string());\n        wav_parser.addTargetTrack(0);\n        if (wav_parser.parse()) {\n          vector<short> tmp_wav = (*(wav_parser.getDataChunks().begin())).getDataVector();\n          vector<short>::iterator it_tmp_wav_cons = tmp_wav.begin()+((tmp_voice.offs+tmp_voice.cons)\/1000.0*wav_parser.getFormat().dwSamplesPerSec);\n          vector<short>::iterator it_tmp_wav_min = it_tmp_wav_cons;\n          short win_size = wav_parser.getFormat().dwSamplesPerSec \/ tmp_voice.getFrq();\n          double tmp_min_rms = -1.0;\n          for (int i=0; i<win_size*2; i++) {\n            vector<short> tmp_wav(it_tmp_wav_cons+i-win_size, it_tmp_wav_cons+i+win_size);\n            double tmp_rms = nak::getRMS(tmp_wav);\n            if (tmp_rms<tmp_min_rms || tmp_min_rms<0) {\n              tmp_min_rms = tmp_rms;\n              it_tmp_wav_min = it_tmp_wav_cons+i;\n            }\n          }\n          vowel_map[nak::pron2vow[it->second]+tmp_voice.suffix].assign(it_tmp_wav_min-win_size, it_tmp_wav_min+win_size);\n        }\n      }\n    }\n    voice_map[v2[0]] = tmp_voice;\n  }\n  return true;\n}\n\nconst Voice* VoiceDB::getVoice(string alias)\n{\n  if (!isAlias(alias))\n    return 0;\n\n  return &voice_map[alias];\n}\n\nbool VoiceDB::isAlias(string alias)\n{\n  return !((voice_map.empty()&&!initVoiceMap()) || voice_map.count(alias)==0);\n}\n\nbool VoiceDB::isVowel(string alias)\n{\n  return vowel_map.count(alias)>0;\n}\n\nvector<short> VoiceDB::getVowel(string alias)\n{\n  return vowel_map[alias];\n}\n\nvoid VoiceDB::setSingerPath(string path_singer)\n{\n  this->path_singer = path_singer;\n}\n\nstring VoiceDB::getSingerPath()\n{\n  return this->path_singer;\n}\n<commit_msg>alias bugfix<commit_after>#include \"VoiceDB.h\"\n\nusing namespace std;\n\nVoiceDB::VoiceDB():path_singer(\"\") {}\n\nVoiceDB::VoiceDB(string path_singer)\n{\n  setSingerPath(path_singer);\n}\n\nVoiceDB::~VoiceDB() {}\n\nbool VoiceDB::initVoiceMap()\n{\n  namespace fs = boost::filesystem;\n  const fs::path path(path_singer);\n\n  if (fs::is_directory(path)) {\n    BOOST_FOREACH(const fs::path& p, std::make_pair(fs::recursive_directory_iterator(path), fs::recursive_directory_iterator())) {\n      if (p.leaf().string() == \"oto.ini\") {\n        cout << \"loading \" << p.string() << endl;\n        initVoiceMap(p.string());\n      }\n    }\n    if (voice_map.size() > 0)\n      return true;\n  }\n\n  cerr << \"[VoiceDB::initVoiceMap] path_singer is invalid\" << endl;\n  return false;\n}\n\nbool VoiceDB::initVoiceMap(string path_oto_ini)\n{\n  ifstream ifs(path_oto_ini.c_str());\n  boost::filesystem::path path_ini(path_oto_ini);\n  string buf, wav_ext=\".wav\";\n  while(ifs && getline(ifs, buf)) {\n    \/\/ read oto.ini\n    Voice tmp_voice(this);\n    vector<string> v1, v2;\n    boost::algorithm::split(v1, buf, boost::is_any_of(\"=\"));\n    boost::algorithm::split(v2, v1[1], boost::is_any_of(\",\"));\n    short tmp;\n    tmp_voice.setWavPath(path_ini.parent_path().string()+\"\/\"+v1[0]);\n    tmp_voice.offs = (((tmp=boost::lexical_cast<double>(v2[1]))>0))?tmp:0;\n    tmp_voice.cons = (((tmp=boost::lexical_cast<double>(v2[2]))>0))?tmp:0;\n    tmp_voice.blnk = boost::lexical_cast<double>(v2[3]);\n    tmp_voice.prec = boost::lexical_cast<double>(v2[4]);\n    tmp_voice.ovrl = boost::lexical_cast<double>(v2[5]);\n    tmp_voice.is_vcv = false;\n    \/\/ sanitize\n    if (tmp_voice.ovrl < 0) {\n      tmp_voice.ovrl *= -1;\n      tmp_voice.offs -= tmp_voice.ovrl;\n      tmp_voice.cons += tmp_voice.ovrl;\n      tmp_voice.prec += tmp_voice.ovrl;\n      if (tmp_voice.blnk < 0) {\n        tmp_voice.blnk -= tmp_voice.ovrl;\n      }\n    }\n    if (tmp_voice.ovrl > tmp_voice.prec) {\n      tmp_voice.prec = tmp_voice.ovrl;\n    }\n    if (tmp_voice.prec > tmp_voice.cons) {\n      tmp_voice.cons = tmp_voice.prec;\n    }\n    if (tmp_voice.blnk<0 && tmp_voice.cons > -tmp_voice.blnk) {\n      tmp_voice.blnk = -tmp_voice.cons;\n    }\n    \/\/ get Voice pron\n    {\n      string tmp_alias = (v2[0]==\"\")?tmp_voice.path_wav.stem().string():v2[0];\n      tmp_voice.pron = tmp_voice.prefix = tmp_voice.suffix = \"\";\n      \/\/ get prefix\n      string::size_type pos_prefix = tmp_alias.find(\" \");\n      if (tmp_alias.size()>1 && pos_prefix != string::npos) {\n        tmp_voice.prefix = tmp_alias.substr(0, pos_prefix+1);\n        tmp_alias.erase(0, pos_prefix+1);\n        if (tmp_voice.prefix!=\"- \" && tmp_voice.prefix!=\"* \") {\n          tmp_voice.is_vcv = true;\n        }\n      }\n      \/\/ get suffix\n      if (tmp_alias.size() > 2) {\n        string tmp_suffix = tmp_alias.substr(tmp_alias.size()-2);\n        if (isalpha(tmp_suffix[0]) && isdigit(tmp_suffix[1])) {\n          tmp_voice.suffix = tmp_suffix;\n          tmp_alias.erase(tmp_alias.size()-2, 2);\n        }\n      }\n      tmp_voice.pron = tmp_alias;\n    }\n    \/\/ set vowel_map\n    if (!tmp_voice.is_vcv) {\n      map<string, string>::const_iterator it = nak::getVow2PronIt(tmp_voice.pron);\n      if (it!=nak::vow2pron.end()) {\n        WavParser wav_parser(tmp_voice.path_wav.string());\n        wav_parser.addTargetTrack(0);\n        if (wav_parser.parse()) {\n          vector<short> tmp_wav = (*(wav_parser.getDataChunks().begin())).getDataVector();\n          vector<short>::iterator it_tmp_wav_cons = tmp_wav.begin()+((tmp_voice.offs+tmp_voice.cons)\/1000.0*wav_parser.getFormat().dwSamplesPerSec);\n          vector<short>::iterator it_tmp_wav_min = it_tmp_wav_cons;\n          short win_size = wav_parser.getFormat().dwSamplesPerSec \/ tmp_voice.getFrq();\n          double tmp_min_rms = -1.0;\n          for (int i=0; i<win_size*2; i++) {\n            vector<short> tmp_wav(it_tmp_wav_cons+i-win_size, it_tmp_wav_cons+i+win_size);\n            double tmp_rms = nak::getRMS(tmp_wav);\n            if (tmp_rms<tmp_min_rms || tmp_min_rms<0) {\n              tmp_min_rms = tmp_rms;\n              it_tmp_wav_min = it_tmp_wav_cons+i;\n            }\n          }\n          vowel_map[nak::pron2vow[it->second]+tmp_voice.suffix].assign(it_tmp_wav_min-win_size, it_tmp_wav_min+win_size);\n        }\n      }\n    }\n    voice_map[v2[0]] = tmp_voice;\n  }\n  return true;\n}\n\nconst Voice* VoiceDB::getVoice(string alias)\n{\n  if (!isAlias(alias))\n    return 0;\n\n  return &voice_map[alias];\n}\n\nbool VoiceDB::isAlias(string alias)\n{\n  return !((voice_map.empty()&&!initVoiceMap()) || voice_map.count(alias)==0);\n}\n\nbool VoiceDB::isVowel(string alias)\n{\n  return vowel_map.count(alias)>0;\n}\n\nvector<short> VoiceDB::getVowel(string alias)\n{\n  return vowel_map[alias];\n}\n\nvoid VoiceDB::setSingerPath(string path_singer)\n{\n  this->path_singer = path_singer;\n}\n\nstring VoiceDB::getSingerPath()\n{\n  return this->path_singer;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* <x0\/HttpListener.cpp>\n *\n * This file is part of the x0 web server project and is released under LGPL-3.\n * http:\/\/www.xzero.ws\/\n *\n * (c) 2009-2010 Christian Parpart <trapni@gentoo.org>\n *\/\n\n#include <x0\/http\/HttpListener.h>\n#include <x0\/http\/HttpConnection.h>\n#include <x0\/http\/HttpServer.h>\n#include <x0\/SocketDriver.h>\n#include <x0\/sysconfig.h>\n\n#include <sd-daemon.h>\n\n#include <arpa\/inet.h>\t\t\/\/ inet_pton()\n#include <netinet\/tcp.h>\t\/\/ TCP_QUICKACK, TCP_DEFER_ACCEPT\n#include <sys\/ioctl.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n#include <netdb.h>\n#include <fcntl.h>\n\nnamespace x0 {\n\nHttpListener::HttpListener(HttpServer& srv) : \n\twatcher_(srv.loop()),\n\tfd_(-1),\n\taddressFamily_(AF_UNSPEC),\n\tserver_(srv),\n\taddress_(),\n\tport_(-1),\n\tbacklog_(SOMAXCONN),\n\terrors_(0),\n\tsocketDriver_(new SocketDriver())\n{\n\twatcher_.set<HttpListener, &HttpListener::callback>(this);\n}\n\nHttpListener::~HttpListener()\n{\n\tstop();\n}\n\nvoid HttpListener::stop()\n{\n\tif (fd_ == -1)\n\t\treturn;\n\n\twatcher_.stop();\n\n\t::close(fd_);\n\tfd_ = -1;\n\n\tsetSocketDriver(nullptr);\n}\n\ninline void HttpListener::setsockopt(int socket, int layer, int option, int value)\n{\n\tif (::setsockopt(socket, layer, option, &value, sizeof(value)) < 0)\n\t{\n\t\tlog(Severity::error, \"Error setting socket option (fd=%d, layer=%d, opt=%d, val=%d): %s\",\n\t\t\t\tsocket, layer, option, value, strerror(errno));\n\t}\n}\n\nvoid HttpListener::setSocketDriver(SocketDriver *sd)\n{\n\tif (socketDriver_)\n\t\tdelete socketDriver_;\n\n\tsocketDriver_ = sd;\n}\n\naddrinfo *HttpListener::getAddressInfo(const char *address, int port)\n{\n\taddrinfo hints;\n\tmemset(&hints, 0, sizeof(hints));\n\thints.ai_flags = AI_NUMERICSERV;\n\thints.ai_family = AF_UNSPEC;\n\thints.ai_socktype = SOCK_STREAM;\n\n\tint rc;\n\tin6_addr saddr;\n\n\tif ((rc = inet_pton(AF_INET, address, &saddr)) == 1) {\n\t\t\/\/ valid IPv4 text address\n\t\thints.ai_family = AF_INET;\n\t\thints.ai_flags |= AI_NUMERICHOST;\n\t} else if ((rc = inet_pton(AF_INET6, address, &saddr)) == 1) {\n\t\t\/\/ valid IPv6 text address\n\t\thints.ai_family = AF_INET6;\n\t\thints.ai_flags |= AI_NUMERICHOST;\n\t}\n\n\tchar sport[8];\n\tsnprintf(sport, sizeof(sport), \"%d\", port);\n\n\taddrinfo *res;\n\tif ((rc = getaddrinfo(address, sport, &hints, &res)) != 0) {\n\t\tlog(Severity::error, \"Host not found: %s\", gai_strerror(rc));\n\t\treturn nullptr;\n\t}\n\n\treturn res;\n}\n\nbool HttpListener::prepare()\n{\n#if defined(WITH_SSL)\n\tif (isSecure())\n\t\tlog(Severity::info, \"Start listening on [%s]:%d [secure]\", address_.c_str(), port_);\n\telse\n\t\tlog(Severity::info, \"Start listening on [%s]:%d\", address_.c_str(), port_);\n#else\n\tlog(Severity::info, \"Start listening on [%s]:%d\", address_.c_str(), port_);\n#endif\n\n\taddrinfo *res = getAddressInfo(address_.c_str(), port_);\n\tif (res == nullptr)\n\t\treturn false;\n\n\t\/\/ check systemd first\n\tint count = sd_listen_fds(false);\n\tif (count > 0) {\n\t\tfd_ = SD_LISTEN_FDS_START;\n\t\tint last = fd_ + count;\n\n\t\tfor (addrinfo *ri = res; ri != nullptr; ri = ri->ai_next) {\n\t\t\tfor (; fd_ < last; ++fd_) {\n\t\t\t\tif (sd_is_socket_inet(fd_, ri->ai_family, ri->ai_socktype, true, port_) > 0) {\n\t\t\t\t\t\/\/ matching file descriptor found\n\t\t\t\t\tgoto done;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tlog(Severity::error, \"No systemd file descriptor passed for bind address %s:%d\",\n\t\t\t\taddress_.c_str(), port_);\n\t\tgoto err;\n\t}\n\n\t\/\/ create socket manually\n\tfor (addrinfo *ri = res; ri != nullptr; ri = ri->ai_next) {\n\t\tfd_ = ::socket(res->ai_family, res->ai_socktype, res->ai_protocol);\n\n\t\tif (fd_ < 0)\n\t\t\tcontinue;\n\n\t\tif (fcntl(fd_, F_SETFD, fcntl(fd_, F_GETFD) | FD_CLOEXEC) < 0) {\n\t\t\tlog(Severity::error, \"Could not start listening on [%s]:%d. %s\", address_.c_str(), port_, strerror(errno));\n\t\t\tgoto err;\n\t\t}\n\n\t\tif (fcntl(fd_, F_SETFL, fcntl(fd_, F_GETFL) | O_NONBLOCK) < 0) {\n\t\t\tlog(Severity::error, \"Could not start listening on [%s]:%d. %s\", address_.c_str(), port_, strerror(errno));\n\t\t\tgoto err;\n\t\t}\n\n#if defined(SO_REUSEADDR)\n\t\t\/\/! \\todo SO_REUSEADDR: could be configurable\n\t\tsetsockopt(fd_, SOL_SOCKET, SO_REUSEADDR, 1);\n#endif\n\n#if defined(TCP_QUICKACK)\n\t\t\/\/! \\todo TCP_QUICKACK: could be configurable\n\t\tsetsockopt(fd_, SOL_TCP, TCP_QUICKACK, 1);\n#endif\n\n#if defined(TCP_DEFER_ACCEPT)\n\t\tsetsockopt(fd_, SOL_TCP, TCP_DEFER_ACCEPT, 1);\n#endif\n\n\/\/\t\tacceptor_.set_option(asio::ip::tcp::acceptor::linger(false, 0));\n\/\/\t\tacceptor_.set_option(asio::ip::tcp::acceptor::keep_alive(true));\n\n\t\tif (::bind(fd_, res->ai_addr, res->ai_addrlen) < 0) {\n\t\t\tlog(Severity::error, \"Cannot bind to IP-address (%s): %s\", address_.c_str(), strerror(errno));\n\t\t\tgoto err;\n\t\t}\n\n\t\tif (::listen(fd_, backlog_) < 0) {\n\t\t\tlog(Severity::error, \"Cannot listen to IP-address (%s): %s\", address_.c_str(), strerror(errno));\n\t\t\tgoto err;\n\t\t}\n\t}\n\n\tif (fd_ < 0) {\n\t\tlog(Severity::error, \"Could not start listening on [%s]:%d. %s\", address_.c_str(), port_,  strerror(errno));\n\t\tgoto err;\n\t}\n\ndone:\n\taddressFamily_ = res->ai_family;\n\tfreeaddrinfo(res);\n\treturn true;\n\nerr:\n\tif (res != nullptr)\n\t\tfreeaddrinfo(res);\n\n\treturn false;\n}\n\nbool HttpListener::start()\n{\n\tif (fd_ == -1)\n\t\tif (!prepare())\n\t\t\treturn false;\n\n\twatcher_.start(fd_, ev::READ);\n\treturn true;\n}\n\nvoid HttpListener::callback(ev::io& watcher, int revents)\n{\n\tint fd;\n\n#if defined(HAVE_ACCEPT4) && !defined(VALGRIND) \/\/ valgrind does not yet implement accept4()\n\tfd = ::accept4(handle(), nullptr, 0, SOCK_NONBLOCK | SOCK_CLOEXEC);\n#else\n\tfd = ::accept(handle(), nullptr, 0);\n#endif\n\n\tif (fd < 0)\n\t{\n\t\tif (errno != EINTR && errno != EAGAIN)\n\t\t\tlog(Severity::error, \"Error accepting new connection socket: %s\", strerror(errno));\n\n\t\treturn;\n\t}\n\n#if !defined(HAVE_ACCEPT4) || defined(VALGRIND)\n\tint rv = fcntl(fd, F_SETFL, fcntl(fd, F_GETFL) | O_NONBLOCK);\n\tif (rv < 0) {\n\t\tlog(Severity::error, \"Error configuring new connection socket: %s\", strerror(errno));\n\t\t::close(fd);\n\t\treturn;\n\t}\n\n\trv = fcntl(fd, F_SETFD, fcntl(fd, F_GETFD) | FD_CLOEXEC);\n\tif (rv < 0) {\n\t\tlog(Severity::error, \"Error configuring new connection socket: %s\", strerror(errno));\n\t\t::close(fd);\n\t\treturn;\n\t}\n#endif\n\n\tserver_.selectWorker()->enqueue(std::make_pair(fd, this));\n}\n\nstd::string HttpListener::address() const\n{\n\treturn address_;\n}\n\nvoid HttpListener::address(const std::string& value)\n{\n\taddress_ = value;\n}\n\nint HttpListener::port() const\n{\n\treturn port_;\n}\n\nvoid HttpListener::port(int value)\n{\n\tport_ = value;\n}\n\nint HttpListener::backlog() const\n{\n\treturn backlog_;\n}\n\nvoid HttpListener::backlog(int value)\n{\n\tbacklog_ = value;\n}\n\n} \/\/ namespace x0\n<commit_msg>[http] HttpListener: minor code improvement<commit_after>\/* <x0\/HttpListener.cpp>\n *\n * This file is part of the x0 web server project and is released under LGPL-3.\n * http:\/\/www.xzero.ws\/\n *\n * (c) 2009-2010 Christian Parpart <trapni@gentoo.org>\n *\/\n\n#include <x0\/http\/HttpListener.h>\n#include <x0\/http\/HttpConnection.h>\n#include <x0\/http\/HttpServer.h>\n#include <x0\/SocketDriver.h>\n#include <x0\/sysconfig.h>\n\n#include <sd-daemon.h>\n\n#include <arpa\/inet.h>\t\t\/\/ inet_pton()\n#include <netinet\/tcp.h>\t\/\/ TCP_QUICKACK, TCP_DEFER_ACCEPT\n#include <sys\/ioctl.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n#include <netdb.h>\n#include <fcntl.h>\n\nnamespace x0 {\n\nHttpListener::HttpListener(HttpServer& srv) : \n\twatcher_(srv.loop()),\n\tfd_(-1),\n\taddressFamily_(AF_UNSPEC),\n\tserver_(srv),\n\taddress_(),\n\tport_(-1),\n\tbacklog_(SOMAXCONN),\n\terrors_(0),\n\tsocketDriver_(new SocketDriver())\n{\n\twatcher_.set<HttpListener, &HttpListener::callback>(this);\n}\n\nHttpListener::~HttpListener()\n{\n\tstop();\n}\n\nvoid HttpListener::stop()\n{\n\tif (fd_ == -1)\n\t\treturn;\n\n\twatcher_.stop();\n\n\t::close(fd_);\n\tfd_ = -1;\n\n\tsetSocketDriver(nullptr);\n}\n\ninline void HttpListener::setsockopt(int socket, int layer, int option, int value)\n{\n\tif (::setsockopt(socket, layer, option, &value, sizeof(value)) < 0)\n\t{\n\t\tlog(Severity::error, \"Error setting socket option (fd=%d, layer=%d, opt=%d, val=%d): %s\",\n\t\t\t\tsocket, layer, option, value, strerror(errno));\n\t}\n}\n\nvoid HttpListener::setSocketDriver(SocketDriver *sd)\n{\n\tif (socketDriver_)\n\t\tdelete socketDriver_;\n\n\tsocketDriver_ = sd;\n}\n\naddrinfo *HttpListener::getAddressInfo(const char *address, int port)\n{\n\taddrinfo hints;\n\tmemset(&hints, 0, sizeof(hints));\n\thints.ai_flags = AI_NUMERICSERV;\n\thints.ai_family = AF_UNSPEC;\n\thints.ai_socktype = SOCK_STREAM;\n\n\tint rc;\n\tin6_addr saddr;\n\n\tif ((rc = inet_pton(AF_INET, address, &saddr)) == 1) {\n\t\t\/\/ valid IPv4 text address\n\t\thints.ai_family = AF_INET;\n\t\thints.ai_flags |= AI_NUMERICHOST;\n\t} else if ((rc = inet_pton(AF_INET6, address, &saddr)) == 1) {\n\t\t\/\/ valid IPv6 text address\n\t\thints.ai_family = AF_INET6;\n\t\thints.ai_flags |= AI_NUMERICHOST;\n\t}\n\n\tchar sport[8];\n\tsnprintf(sport, sizeof(sport), \"%d\", port);\n\n\taddrinfo *res;\n\tif ((rc = getaddrinfo(address, sport, &hints, &res)) != 0) {\n\t\tlog(Severity::error, \"Host not found: %s\", gai_strerror(rc));\n\t\treturn nullptr;\n\t}\n\n\treturn res;\n}\n\nbool HttpListener::prepare()\n{\n#if defined(WITH_SSL)\n\tif (isSecure())\n\t\tlog(Severity::info, \"Start listening on [%s]:%d [secure]\", address_.c_str(), port_);\n\telse\n\t\tlog(Severity::info, \"Start listening on [%s]:%d\", address_.c_str(), port_);\n#else\n\tlog(Severity::info, \"Start listening on [%s]:%d\", address_.c_str(), port_);\n#endif\n\n\taddrinfo *res = getAddressInfo(address_.c_str(), port_);\n\tif (res == nullptr)\n\t\treturn false;\n\n\t\/\/ check systemd first\n\tint count = sd_listen_fds(false);\n\tif (count > 0) {\n\t\tfd_ = SD_LISTEN_FDS_START;\n\t\tint last = fd_ + count;\n\n\t\tfor (addrinfo *ri = res; ri != nullptr; ri = ri->ai_next) {\n\t\t\tfor (; fd_ < last; ++fd_) {\n\t\t\t\tif (sd_is_socket_inet(fd_, ri->ai_family, ri->ai_socktype, true, port_) > 0) {\n\t\t\t\t\t\/\/ matching file descriptor found\n\t\t\t\t\tgoto done;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tlog(Severity::error, \"No systemd file descriptor passed for bind address %s:%d\",\n\t\t\t\taddress_.c_str(), port_);\n\t\tgoto err;\n\t}\n\n\t\/\/ create socket manually\n\tfor (addrinfo *ri = res; ri != nullptr; ri = ri->ai_next) {\n\t\tfd_ = ::socket(res->ai_family, res->ai_socktype, res->ai_protocol);\n\n\t\tif (fd_ < 0)\n\t\t\tcontinue;\n\n\t\tif (fcntl(fd_, F_SETFD, fcntl(fd_, F_GETFD) | FD_CLOEXEC) < 0) {\n\t\t\tlog(Severity::error, \"Could not start listening on [%s]:%d. %s\", address_.c_str(), port_, strerror(errno));\n\t\t\tgoto err;\n\t\t}\n\n\t\tif (fcntl(fd_, F_SETFL, fcntl(fd_, F_GETFL) | O_NONBLOCK) < 0) {\n\t\t\tlog(Severity::error, \"Could not start listening on [%s]:%d. %s\", address_.c_str(), port_, strerror(errno));\n\t\t\tgoto err;\n\t\t}\n\n#if defined(SO_REUSEADDR)\n\t\t\/\/! \\todo SO_REUSEADDR: could be configurable\n\t\tsetsockopt(fd_, SOL_SOCKET, SO_REUSEADDR, 1);\n#endif\n\n#if defined(TCP_QUICKACK)\n\t\t\/\/! \\todo TCP_QUICKACK: could be configurable\n\t\tsetsockopt(fd_, SOL_TCP, TCP_QUICKACK, 1);\n#endif\n\n#if defined(TCP_DEFER_ACCEPT)\n\t\tsetsockopt(fd_, SOL_TCP, TCP_DEFER_ACCEPT, 1);\n#endif\n\n\/\/\t\tacceptor_.set_option(asio::ip::tcp::acceptor::linger(false, 0));\n\/\/\t\tacceptor_.set_option(asio::ip::tcp::acceptor::keep_alive(true));\n\n\t\tif (::bind(fd_, res->ai_addr, res->ai_addrlen) < 0) {\n\t\t\tlog(Severity::error, \"Cannot bind to IP-address (%s): %s\", address_.c_str(), strerror(errno));\n\t\t\tgoto err;\n\t\t}\n\n\t\tif (::listen(fd_, backlog_) < 0) {\n\t\t\tlog(Severity::error, \"Cannot listen to IP-address (%s): %s\", address_.c_str(), strerror(errno));\n\t\t\tgoto err;\n\t\t}\n\t}\n\n\tif (fd_ < 0) {\n\t\tlog(Severity::error, \"Could not start listening on [%s]:%d. %s\", address_.c_str(), port_,  strerror(errno));\n\t\tgoto err;\n\t}\n\ndone:\n\taddressFamily_ = res->ai_family;\n\tfreeaddrinfo(res);\n\treturn true;\n\nerr:\n\tif (res != nullptr)\n\t\tfreeaddrinfo(res);\n\n\treturn false;\n}\n\nbool HttpListener::start()\n{\n\tif (fd_ < 0)\n\t\tif (!prepare())\n\t\t\treturn false;\n\n\twatcher_.start(fd_, ev::READ);\n\treturn true;\n}\n\nvoid HttpListener::callback(ev::io& watcher, int revents)\n{\n\tint fd;\n\n#if defined(HAVE_ACCEPT4) && !defined(VALGRIND) \/\/ valgrind does not yet implement accept4()\n\tfd = ::accept4(handle(), nullptr, 0, SOCK_NONBLOCK | SOCK_CLOEXEC);\n#else\n\tfd = ::accept(handle(), nullptr, 0);\n#endif\n\n\tif (fd < 0)\n\t{\n\t\tif (errno != EINTR && errno != EAGAIN)\n\t\t\tlog(Severity::error, \"Error accepting new connection socket: %s\", strerror(errno));\n\n\t\treturn;\n\t}\n\n#if !defined(HAVE_ACCEPT4) || defined(VALGRIND)\n\tint rv = fcntl(fd, F_SETFL, fcntl(fd, F_GETFL) | O_NONBLOCK);\n\tif (rv < 0) {\n\t\tlog(Severity::error, \"Error configuring new connection socket: %s\", strerror(errno));\n\t\t::close(fd);\n\t\treturn;\n\t}\n\n\trv = fcntl(fd, F_SETFD, fcntl(fd, F_GETFD) | FD_CLOEXEC);\n\tif (rv < 0) {\n\t\tlog(Severity::error, \"Error configuring new connection socket: %s\", strerror(errno));\n\t\t::close(fd);\n\t\treturn;\n\t}\n#endif\n\n\tserver_.selectWorker()->enqueue(std::make_pair(fd, this));\n}\n\nstd::string HttpListener::address() const\n{\n\treturn address_;\n}\n\nvoid HttpListener::address(const std::string& value)\n{\n\taddress_ = value;\n}\n\nint HttpListener::port() const\n{\n\treturn port_;\n}\n\nvoid HttpListener::port(int value)\n{\n\tport_ = value;\n}\n\nint HttpListener::backlog() const\n{\n\treturn backlog_;\n}\n\nvoid HttpListener::backlog(int value)\n{\n\tbacklog_ = value;\n}\n\n} \/\/ namespace x0\n<|endoftext|>"}
{"text":"<commit_before>#include \"config.h\"\n\n#include <nsIFactory.h>\n#include <nsIFile.h>\n#include <nsIFileURL.h>\n\n#include \"sugar-download-manager.h\"\n\n#include \"GeckoDownload.h\"\n\nclass GeckoDownload : public nsITransfer\n{\npublic:\n    GeckoDownload();\n\tvirtual ~GeckoDownload();\n\n\tNS_DECL_ISUPPORTS\n\tNS_DECL_NSIWEBPROGRESSLISTENER\n\tNS_DECL_NSIWEBPROGRESSLISTENER2\n\tNS_DECL_NSITRANSFER\n\nprotected:\n\tnsIURI\t\t\t*mSource;\n\tnsCString\t\tmTargetFileName;\n\tnsIMIMEInfo\t\t*mMIMEInfo;\n\tnsILocalFile\t*mTempFile;\n};\n\nGeckoDownload::GeckoDownload ()\n{\n}\n\nGeckoDownload::~GeckoDownload ()\n{\n}\n\nNS_IMPL_ISUPPORTS3 (GeckoDownload,\n\t\t\t\t\tnsIWebProgressListener,\n\t\t\t\t\tnsIWebProgressListener2,\n\t\t\t\t\tnsITransfer)\n\nNS_IMETHODIMP\nGeckoDownload::Init (nsIURI *aSource,\n\t\t\t\t\t nsIURI *aTarget,\n\t\t\t\t\t const nsAString &aDisplayName,\n\t\t\t\t\t nsIMIMEInfo *aMIMEInfo,\n\t\t\t\t\t PRTime aStartTime,\n\t\t\t\t\t nsILocalFile *aTempFile,\n\t\t\t\t\t nsICancelable *aCancelable)\n{\n    mSource = aSource;\n    mMIMEInfo = aMIMEInfo;\n    mTempFile = aTempFile;\n\n    nsresult rv;\n\n    nsCOMPtr<nsIFileURL> fileURL = do_QueryInterface(aTarget);\n    NS_ENSURE_TRUE(fileURL, NS_ERROR_FAILURE);\n\n    nsCOMPtr<nsIFile> file;\n    rv = fileURL->GetFile(getter_AddRefs(file));\n    NS_ENSURE_SUCCESS(rv, NS_ERROR_FAILURE);\n\n    file->GetNativePath (mTargetFileName);\n}\n\nNS_IMETHODIMP \nGeckoDownload::OnStateChange (nsIWebProgress *aWebProgress,\n\t\t\t\t\t\t\t  nsIRequest *aRequest,\n\t\t\t\t\t\t\t  PRUint32 aStateFlags,\n\t\t\t\t\t\t\t  nsresult aStatus)\n{\n\tSugarDownloadManager *download_manager = sugar_get_download_manager ();\n\n\tif (aStateFlags == STATE_START) {\n\n\t\tnsCString url;\n\t\tnsCString mimeType;\n\t\n\t\tmMIMEInfo->GetMIMEType (mimeType);\n\t\tmSource->GetSpec (url);\n\t\t\n\t\tsugar_download_manager_download_started (download_manager,\n\t\t\t\t\t\t\t\t\t\t\t\t url.get (),\n\t\t\t\t\t\t\t\t\t\t\t\t mimeType.get (),\n\t\t\t\t\t\t\t\t\t\t\t\t mTargetFileName.get ());\n\n\t} else if (aStateFlags == STATE_STOP) {\n\t\t\n\t\tif (NS_SUCCEEDED (aStatus)) {\n\t\t\tsugar_download_manager_download_completed (download_manager,\n\t\t\t\t\t\t\t\t\t\t\t\t\t   mTargetFileName.get ());\n\t\t} else {\n\t\t\tsugar_download_manager_download_cancelled (download_manager,\n\t\t\t\t\t\t\t\t\t\t\t\t\t   mTargetFileName.get ());\n\t\t}\n\t}\n\n\treturn NS_OK; \n}\n\nNS_IMETHODIMP\nGeckoDownload::OnProgressChange (nsIWebProgress *aWebProgress,\n\t\t\t\t\t\t\t\t nsIRequest *aRequest,\n\t\t\t\t\t\t\t\t PRInt32 aCurSelfProgress,\n\t\t\t\t\t\t\t\t PRInt32 aMaxSelfProgress,\n\t\t\t\t\t\t\t\t PRInt32 aCurTotalProgress,\n\t\t\t\t\t\t\t\t PRInt32 aMaxTotalProgress)\n{\n\treturn OnProgressChange64 (aWebProgress,\n\t\t\t\t\t\t\t   aRequest,\n\t\t\t\t\t\t\t   aCurSelfProgress,\n\t\t\t\t\t\t\t   aMaxSelfProgress,\n\t\t\t\t\t\t\t   aCurTotalProgress,\n\t\t\t\t\t\t\t   aMaxTotalProgress);\n}\n\nNS_IMETHODIMP\nGeckoDownload::OnProgressChange64 (nsIWebProgress *aWebProgress,\n\t\t\t\t\t\t\t\t   nsIRequest *aRequest,\n\t\t\t\t\t\t\t\t   PRInt64 aCurSelfProgress,\n\t\t\t\t\t\t\t\t   PRInt64 aMaxSelfProgress,\n\t\t\t\t\t\t\t\t   PRInt64 aCurTotalProgress,\n\t\t\t\t\t\t\t\t   PRInt64 aMaxTotalProgress)\n{\t\n\tSugarDownloadManager *download_manager = sugar_get_download_manager ();\n\tPRInt32 percentComplete =\n\t\t(PRInt32)(((float)aCurSelfProgress \/ (float)aMaxSelfProgress) * 100.0);\n\n\tsugar_download_manager_update_progress (download_manager,\n\t\t\t\t\t\t\t\t\t\t\tmTargetFileName.get (),\n\t\t\t\t\t\t\t\t\t\t\tpercentComplete);\n\n\treturn NS_OK;\n}\n\nNS_IMETHODIMP\nGeckoDownload::OnLocationChange (nsIWebProgress *aWebProgress,\n\t\t\t\t\t\t\t\t nsIRequest *aRequest,\n\t\t\t\t\t\t\t\t nsIURI *location)\n{\n\treturn NS_OK;\n}\n\nNS_IMETHODIMP \nGeckoDownload::OnStatusChange (nsIWebProgress *aWebProgress,\n\t\t\t\t\t\t\t   nsIRequest *aRequest,\n\t\t\t\t\t\t\t   nsresult aStatus, \n\t\t\t\t\t\t\t   const PRUnichar *aMessage)\n{\n\treturn NS_OK;\n}\n\nNS_IMETHODIMP \nGeckoDownload::OnSecurityChange (nsIWebProgress *aWebProgress,\n\t\t\t\t\t\t\t\t nsIRequest *aRequest,\n\t\t\t\t\t\t\t\t PRUint32 state)\n{\n\treturn NS_OK;\n}\n\n#ifdef HAVE_GECKO_1_9\n\nNS_IMETHODIMP\nGeckoDownload::OnRefreshAttempted (nsIWebProgress *aWebProgress,\n                                   nsIURI *aRefreshURI,\n                                   PRInt32 aMillis,\n                                   PRBool aSameURI,\n                                   PRBool *_retval)\n{\n\treturn NS_OK;\n}\n\n#endif\n\n\/\/*****************************************************************************\n\/\/ GeckoDownloadFactory\n\/\/*****************************************************************************\n\nclass GeckoDownloadFactory : public nsIFactory {\npublic:\n    NS_DECL_ISUPPORTS\n    NS_DECL_NSIFACTORY\n\n    GeckoDownloadFactory();\n    virtual ~GeckoDownloadFactory();\n};\n\n\/\/*****************************************************************************\n\nNS_IMPL_ISUPPORTS1(GeckoDownloadFactory, nsIFactory)\n\nGeckoDownloadFactory::GeckoDownloadFactory() {\n}\n\nGeckoDownloadFactory::~GeckoDownloadFactory() {\n}\n\nNS_IMETHODIMP\nGeckoDownloadFactory::CreateInstance(nsISupports *aOuter, const nsIID & aIID, void **aResult)\n{\n    NS_ENSURE_ARG_POINTER(aResult);\n\n    *aResult = NULL;\n    GeckoDownload *inst = new GeckoDownload;\n    if (!inst)\n        return NS_ERROR_OUT_OF_MEMORY;\n\n    nsresult rv = inst->QueryInterface(aIID, aResult);\n    if (rv != NS_OK) {\n        \/\/ We didn't get the right interface, so clean up\n        delete inst;\n    }\n\n    return rv;\n}\n\nNS_IMETHODIMP\nGeckoDownloadFactory::LockFactory(PRBool lock)\n{\n    return NS_OK;\n}\n\n\/\/*****************************************************************************\n\nnsresult\nNS_NewGeckoDownloadFactory(nsIFactory** aFactory)\n{\n    NS_ENSURE_ARG_POINTER(aFactory);\n    *aFactory = nsnull;\n\n    GeckoDownloadFactory *result = new GeckoDownloadFactory;\n    if (!result)\n        return NS_ERROR_OUT_OF_MEMORY;\n\n    NS_ADDREF(result);\n    *aFactory = result;\n\n    return NS_OK;\n}\n<commit_msg>If we receive an application\/octet-stream, check the mime type by looking at its extension.<commit_after>#include \"config.h\"\n\n#include <nsIFactory.h>\n#include <nsIFile.h>\n#include <nsIFileURL.h>\n#include <nsServiceManagerUtils.h>\n#include <nsIMIMEService.h>\n\n#include \"sugar-download-manager.h\"\n\n#include \"GeckoDownload.h\"\n\n#define APPLICATION_OCTET_STREAM \"application\/octet-stream\"\n\nclass GeckoDownload : public nsITransfer\n{\npublic:\n    GeckoDownload();\n\tvirtual ~GeckoDownload();\n\n\tNS_DECL_ISUPPORTS\n\tNS_DECL_NSIWEBPROGRESSLISTENER\n\tNS_DECL_NSIWEBPROGRESSLISTENER2\n\tNS_DECL_NSITRANSFER\n\nprotected:\n\tnsIURI\t\t\t*mSource;\n\tnsCString\t\tmTargetFileName;\n\tnsIMIMEInfo\t\t*mMIMEInfo;\n\tnsILocalFile\t*mTempFile;\n};\n\nGeckoDownload::GeckoDownload ()\n{\n}\n\nGeckoDownload::~GeckoDownload ()\n{\n}\n\nNS_IMPL_ISUPPORTS3 (GeckoDownload,\n\t\t\t\t\tnsIWebProgressListener,\n\t\t\t\t\tnsIWebProgressListener2,\n\t\t\t\t\tnsITransfer)\n\nNS_IMETHODIMP\nGeckoDownload::Init (nsIURI *aSource,\n\t\t\t\t\t nsIURI *aTarget,\n\t\t\t\t\t const nsAString &aDisplayName,\n\t\t\t\t\t nsIMIMEInfo *aMIMEInfo,\n\t\t\t\t\t PRTime aStartTime,\n\t\t\t\t\t nsILocalFile *aTempFile,\n\t\t\t\t\t nsICancelable *aCancelable)\n{\n    mSource = aSource;\n    mMIMEInfo = aMIMEInfo;\n    mTempFile = aTempFile;\n\n    nsresult rv;\n\n    nsCOMPtr<nsIFileURL> fileURL = do_QueryInterface(aTarget);\n    NS_ENSURE_TRUE(fileURL, NS_ERROR_FAILURE);\n\n    nsCOMPtr<nsIFile> file;\n    rv = fileURL->GetFile(getter_AddRefs(file));\n    NS_ENSURE_SUCCESS(rv, NS_ERROR_FAILURE);\n\n    file->GetNativePath (mTargetFileName);\n\n    return NS_OK; \n}\n\nNS_IMETHODIMP \nGeckoDownload::OnStateChange(nsIWebProgress *aWebProgress,\n\t                          nsIRequest *aRequest,\n                              PRUint32 aStateFlags,\n                              nsresult aStatus)\n{\n    SugarDownloadManager *download_manager = sugar_get_download_manager();\n\n    if(aStateFlags == STATE_START) {\n\n        nsCString url;\n        nsCString mimeType;\n\n        mMIMEInfo->GetMIMEType(mimeType);\n        mSource->GetSpec(url);\n\n        \/* If the file is application\/octet-stream, look up a better mime type\n           from the extension. *\/\n        if(mimeType.Equals(APPLICATION_OCTET_STREAM)) {\n            nsresult rv;\n            nsCOMPtr<nsIMIMEService> mimeService(\n                do_GetService(\"@mozilla.org\/mime;1\", &rv));\n            NS_ENSURE_SUCCESS(rv, rv);\n            \n            const char *fileExt = strrchr(mTargetFileName.get(), '.');\n            if(fileExt) {\n                nsCString contentType;\n\n                mimeService->GetTypeFromExtension(nsCString(fileExt),\n                                                   contentType);\n                if(!contentType.IsEmpty()) {\n                    mimeType = contentType;\n                }\n            }\n        }\n        \n        sugar_download_manager_download_started(download_manager,\n                                                 url.get(),\n                                                 mimeType.get(),\n                                                 mTargetFileName.get());\n\n    } else if(aStateFlags == STATE_STOP) {\n        \n        if(NS_SUCCEEDED(aStatus)) {\n            sugar_download_manager_download_completed(download_manager,\n                                                       mTargetFileName.get());\n        } else {\n            sugar_download_manager_download_cancelled(download_manager,\n                                                       mTargetFileName.get());\n        }\n    }\n\n    return NS_OK; \n}\n\nNS_IMETHODIMP\nGeckoDownload::OnProgressChange (nsIWebProgress *aWebProgress,\n\t\t\t\t\t\t\t\t nsIRequest *aRequest,\n\t\t\t\t\t\t\t\t PRInt32 aCurSelfProgress,\n\t\t\t\t\t\t\t\t PRInt32 aMaxSelfProgress,\n\t\t\t\t\t\t\t\t PRInt32 aCurTotalProgress,\n\t\t\t\t\t\t\t\t PRInt32 aMaxTotalProgress)\n{\n\treturn OnProgressChange64 (aWebProgress,\n\t\t\t\t\t\t\t   aRequest,\n\t\t\t\t\t\t\t   aCurSelfProgress,\n\t\t\t\t\t\t\t   aMaxSelfProgress,\n\t\t\t\t\t\t\t   aCurTotalProgress,\n\t\t\t\t\t\t\t   aMaxTotalProgress);\n}\n\nNS_IMETHODIMP\nGeckoDownload::OnProgressChange64 (nsIWebProgress *aWebProgress,\n\t\t\t\t\t\t\t\t   nsIRequest *aRequest,\n\t\t\t\t\t\t\t\t   PRInt64 aCurSelfProgress,\n\t\t\t\t\t\t\t\t   PRInt64 aMaxSelfProgress,\n\t\t\t\t\t\t\t\t   PRInt64 aCurTotalProgress,\n\t\t\t\t\t\t\t\t   PRInt64 aMaxTotalProgress)\n{\t\n\tSugarDownloadManager *download_manager = sugar_get_download_manager ();\n\tPRInt32 percentComplete =\n\t\t(PRInt32)(((float)aCurSelfProgress \/ (float)aMaxSelfProgress) * 100.0);\n\n\tsugar_download_manager_update_progress (download_manager,\n\t\t\t\t\t\t\t\t\t\t\tmTargetFileName.get (),\n\t\t\t\t\t\t\t\t\t\t\tpercentComplete);\n\n\treturn NS_OK;\n}\n\nNS_IMETHODIMP\nGeckoDownload::OnLocationChange (nsIWebProgress *aWebProgress,\n\t\t\t\t\t\t\t\t nsIRequest *aRequest,\n\t\t\t\t\t\t\t\t nsIURI *location)\n{\n\treturn NS_OK;\n}\n\nNS_IMETHODIMP \nGeckoDownload::OnStatusChange (nsIWebProgress *aWebProgress,\n\t\t\t\t\t\t\t   nsIRequest *aRequest,\n\t\t\t\t\t\t\t   nsresult aStatus, \n\t\t\t\t\t\t\t   const PRUnichar *aMessage)\n{\n\treturn NS_OK;\n}\n\nNS_IMETHODIMP \nGeckoDownload::OnSecurityChange (nsIWebProgress *aWebProgress,\n\t\t\t\t\t\t\t\t nsIRequest *aRequest,\n\t\t\t\t\t\t\t\t PRUint32 state)\n{\n\treturn NS_OK;\n}\n\n#ifdef HAVE_GECKO_1_9\n\nNS_IMETHODIMP\nGeckoDownload::OnRefreshAttempted (nsIWebProgress *aWebProgress,\n                                   nsIURI *aRefreshURI,\n                                   PRInt32 aMillis,\n                                   PRBool aSameURI,\n                                   PRBool *_retval)\n{\n\treturn NS_OK;\n}\n\n#endif\n\n\/\/*****************************************************************************\n\/\/ GeckoDownloadFactory\n\/\/*****************************************************************************\n\nclass GeckoDownloadFactory : public nsIFactory {\npublic:\n    NS_DECL_ISUPPORTS\n    NS_DECL_NSIFACTORY\n\n    GeckoDownloadFactory();\n    virtual ~GeckoDownloadFactory();\n};\n\n\/\/*****************************************************************************\n\nNS_IMPL_ISUPPORTS1(GeckoDownloadFactory, nsIFactory)\n\nGeckoDownloadFactory::GeckoDownloadFactory() {\n}\n\nGeckoDownloadFactory::~GeckoDownloadFactory() {\n}\n\nNS_IMETHODIMP\nGeckoDownloadFactory::CreateInstance(nsISupports *aOuter, const nsIID & aIID, void **aResult)\n{\n    NS_ENSURE_ARG_POINTER(aResult);\n\n    *aResult = NULL;\n    GeckoDownload *inst = new GeckoDownload;\n    if (!inst)\n        return NS_ERROR_OUT_OF_MEMORY;\n\n    nsresult rv = inst->QueryInterface(aIID, aResult);\n    if (rv != NS_OK) {\n        \/\/ We didn't get the right interface, so clean up\n        delete inst;\n    }\n\n    return rv;\n}\n\nNS_IMETHODIMP\nGeckoDownloadFactory::LockFactory(PRBool lock)\n{\n    return NS_OK;\n}\n\n\/\/*****************************************************************************\n\nnsresult\nNS_NewGeckoDownloadFactory(nsIFactory** aFactory)\n{\n    NS_ENSURE_ARG_POINTER(aFactory);\n    *aFactory = nsnull;\n\n    GeckoDownloadFactory *result = new GeckoDownloadFactory;\n    if (!result)\n        return NS_ERROR_OUT_OF_MEMORY;\n\n    NS_ADDREF(result);\n    *aFactory = result;\n\n    return NS_OK;\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 \"flutter\/lib\/ui\/painting\/canvas.h\"\n\n#include <math.h>\n\n#include \"flutter\/flow\/layers\/physical_model_layer.h\"\n#include \"flutter\/lib\/ui\/painting\/image.h\"\n#include \"flutter\/lib\/ui\/painting\/matrix.h\"\n#include \"lib\/tonic\/converter\/dart_converter.h\"\n#include \"lib\/tonic\/dart_args.h\"\n#include \"lib\/tonic\/dart_binding_macros.h\"\n#include \"lib\/tonic\/dart_library_natives.h\"\n#include \"third_party\/skia\/include\/core\/SkBitmap.h\"\n#include \"third_party\/skia\/include\/core\/SkCanvas.h\"\n\nnamespace blink {\n\nstatic void Canvas_constructor(Dart_NativeArguments args) {\n  DartCallConstructor(&Canvas::Create, args);\n}\n\nIMPLEMENT_WRAPPERTYPEINFO(ui, Canvas);\n\n#define FOR_EACH_BINDING(V)         \\\n  V(Canvas, save)                   \\\n  V(Canvas, saveLayerWithoutBounds) \\\n  V(Canvas, saveLayer)              \\\n  V(Canvas, restore)                \\\n  V(Canvas, getSaveCount)           \\\n  V(Canvas, translate)              \\\n  V(Canvas, scale)                  \\\n  V(Canvas, rotate)                 \\\n  V(Canvas, skew)                   \\\n  V(Canvas, transform)              \\\n  V(Canvas, clipRect)               \\\n  V(Canvas, clipRRect)              \\\n  V(Canvas, clipPath)               \\\n  V(Canvas, drawColor)              \\\n  V(Canvas, drawLine)               \\\n  V(Canvas, drawPaint)              \\\n  V(Canvas, drawRect)               \\\n  V(Canvas, drawRRect)              \\\n  V(Canvas, drawDRRect)             \\\n  V(Canvas, drawOval)               \\\n  V(Canvas, drawCircle)             \\\n  V(Canvas, drawArc)                \\\n  V(Canvas, drawPath)               \\\n  V(Canvas, drawImage)              \\\n  V(Canvas, drawImageRect)          \\\n  V(Canvas, drawImageNine)          \\\n  V(Canvas, drawPicture)            \\\n  V(Canvas, drawPoints)             \\\n  V(Canvas, drawVertices)           \\\n  V(Canvas, drawAtlas)              \\\n  V(Canvas, drawShadow)\n\nFOR_EACH_BINDING(DART_NATIVE_CALLBACK)\n\nvoid Canvas::RegisterNatives(tonic::DartLibraryNatives* natives) {\n  natives->Register({{\"Canvas_constructor\", Canvas_constructor, 6, true},\n                     FOR_EACH_BINDING(DART_REGISTER_NATIVE)});\n}\n\nftl::RefPtr<Canvas> Canvas::Create(PictureRecorder* recorder,\n                                   double left,\n                                   double top,\n                                   double right,\n                                   double bottom) {\n  FTL_DCHECK(recorder);\n  FTL_DCHECK(!recorder->isRecording());\n  ftl::RefPtr<Canvas> canvas = ftl::MakeRefCounted<Canvas>(\n      recorder->BeginRecording(SkRect::MakeLTRB(left, top, right, bottom)));\n  recorder->set_canvas(canvas);\n  return canvas;\n}\n\nCanvas::Canvas(SkCanvas* canvas) : canvas_(canvas) {}\n\nCanvas::~Canvas() {}\n\nvoid Canvas::save() {\n  if (!canvas_)\n    return;\n  canvas_->save();\n}\n\nvoid Canvas::saveLayerWithoutBounds(const Paint& paint,\n                                    const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n  canvas_->saveLayer(nullptr, paint.paint());\n}\n\nvoid Canvas::saveLayer(double left,\n                       double top,\n                       double right,\n                       double bottom,\n                       const Paint& paint,\n                       const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n  SkRect bounds = SkRect::MakeLTRB(left, top, right, bottom);\n  canvas_->saveLayer(&bounds, paint.paint());\n}\n\nvoid Canvas::restore() {\n  if (!canvas_)\n    return;\n  canvas_->restore();\n}\n\nint Canvas::getSaveCount() {\n  if (!canvas_)\n    return 0;\n  return canvas_->getSaveCount();\n}\n\nvoid Canvas::translate(double dx, double dy) {\n  if (!canvas_)\n    return;\n  canvas_->translate(dx, dy);\n}\n\nvoid Canvas::scale(double sx, double sy) {\n  if (!canvas_)\n    return;\n  canvas_->scale(sx, sy);\n}\n\nvoid Canvas::rotate(double radians) {\n  if (!canvas_)\n    return;\n  canvas_->rotate(radians * 180.0 \/ M_PI);\n}\n\nvoid Canvas::skew(double sx, double sy) {\n  if (!canvas_)\n    return;\n  canvas_->skew(sx, sy);\n}\n\nvoid Canvas::transform(const tonic::Float64List& matrix4) {\n  if (!canvas_)\n    return;\n  canvas_->concat(ToSkMatrix(matrix4));\n}\n\nvoid Canvas::clipRect(double left, double top, double right, double bottom) {\n  if (!canvas_)\n    return;\n  canvas_->clipRect(SkRect::MakeLTRB(left, top, right, bottom));\n}\n\nvoid Canvas::clipRRect(const RRect& rrect) {\n  if (!canvas_)\n    return;\n  canvas_->clipRRect(rrect.sk_rrect, true);\n}\n\nvoid Canvas::clipPath(const CanvasPath* path) {\n  if (!canvas_)\n    return;\n  canvas_->clipPath(path->path(), true);\n}\n\nvoid Canvas::drawColor(SkColor color, SkBlendMode blend_mode) {\n  if (!canvas_)\n    return;\n  canvas_->drawColor(color, blend_mode);\n}\n\nvoid Canvas::drawLine(double x1,\n                      double y1,\n                      double x2,\n                      double y2,\n                      const Paint& paint,\n                      const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n  canvas_->drawLine(x1, y1, x2, y2, *paint.paint());\n}\n\nvoid Canvas::drawPaint(const Paint& paint, const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n  canvas_->drawPaint(*paint.paint());\n}\n\nvoid Canvas::drawRect(double left,\n                      double top,\n                      double right,\n                      double bottom,\n                      const Paint& paint,\n                      const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n  canvas_->drawRect(SkRect::MakeLTRB(left, top, right, bottom), *paint.paint());\n}\n\nvoid Canvas::drawRRect(const RRect& rrect,\n                       const Paint& paint,\n                       const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n  canvas_->drawRRect(rrect.sk_rrect, *paint.paint());\n}\n\nvoid Canvas::drawDRRect(const RRect& outer,\n                        const RRect& inner,\n                        const Paint& paint,\n                        const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n  canvas_->drawDRRect(outer.sk_rrect, inner.sk_rrect, *paint.paint());\n}\n\nvoid Canvas::drawOval(double left,\n                      double top,\n                      double right,\n                      double bottom,\n                      const Paint& paint,\n                      const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n  canvas_->drawOval(SkRect::MakeLTRB(left, top, right, bottom), *paint.paint());\n}\n\nvoid Canvas::drawCircle(double x,\n                        double y,\n                        double radius,\n                        const Paint& paint,\n                        const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n  canvas_->drawCircle(x, y, radius, *paint.paint());\n}\n\nvoid Canvas::drawArc(double left,\n                     double top,\n                     double right,\n                     double bottom,\n                     double startAngle,\n                     double sweepAngle,\n                     bool useCenter,\n                     const Paint& paint,\n                     const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n  canvas_->drawArc(SkRect::MakeLTRB(left, top, right, bottom),\n                   startAngle * 180.0 \/ M_PI, sweepAngle * 180.0 \/ M_PI,\n                   useCenter, *paint.paint());\n}\n\nvoid Canvas::drawPath(const CanvasPath* path,\n                      const Paint& paint,\n                      const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n  FTL_DCHECK(path);\n  canvas_->drawPath(path->path(), *paint.paint());\n}\n\nvoid Canvas::drawImage(const CanvasImage* image,\n                       double x,\n                       double y,\n                       const Paint& paint,\n                       const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n  FTL_DCHECK(image);\n  canvas_->drawImage(image->image(), x, y, paint.paint());\n}\n\nvoid Canvas::drawImageRect(const CanvasImage* image,\n                           double src_left,\n                           double src_top,\n                           double src_right,\n                           double src_bottom,\n                           double dst_left,\n                           double dst_top,\n                           double dst_right,\n                           double dst_bottom,\n                           const Paint& paint,\n                           const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n  FTL_DCHECK(image);\n  SkRect src = SkRect::MakeLTRB(src_left, src_top, src_right, src_bottom);\n  SkRect dst = SkRect::MakeLTRB(dst_left, dst_top, dst_right, dst_bottom);\n  canvas_->drawImageRect(image->image(), src, dst, paint.paint(),\n                         SkCanvas::kFast_SrcRectConstraint);\n}\n\nvoid Canvas::drawImageNine(const CanvasImage* image,\n                           double center_left,\n                           double center_top,\n                           double center_right,\n                           double center_bottom,\n                           double dst_left,\n                           double dst_top,\n                           double dst_right,\n                           double dst_bottom,\n                           const Paint& paint,\n                           const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n  FTL_DCHECK(image);\n  SkRect center =\n      SkRect::MakeLTRB(center_left, center_top, center_right, center_bottom);\n  SkIRect icenter;\n  center.round(&icenter);\n  SkRect dst = SkRect::MakeLTRB(dst_left, dst_top, dst_right, dst_bottom);\n  canvas_->drawImageNine(image->image(), icenter, dst, paint.paint());\n}\n\nvoid Canvas::drawPicture(Picture* picture) {\n  if (!canvas_)\n    return;\n  FTL_DCHECK(picture);\n  canvas_->drawPicture(picture->picture().get());\n}\n\nvoid Canvas::drawPoints(const Paint& paint,\n                        const PaintData& paint_data,\n                        SkCanvas::PointMode point_mode,\n                        const tonic::Float32List& points) {\n  if (!canvas_)\n    return;\n\n  static_assert(sizeof(SkPoint) == sizeof(float) * 2,\n                \"SkPoint doesn't use floats.\");\n\n  canvas_->drawPoints(point_mode,\n                      points.num_elements() \/ 2,  \/\/ SkPoints have two floats.\n                      reinterpret_cast<const SkPoint*>(points.data()),\n                      *paint.paint());\n}\n\nvoid Canvas::drawVertices(const Vertices* vertices,\n                          SkBlendMode blend_mode,\n                          const Paint& paint,\n                          const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n\n  canvas_->drawVertices(vertices->vertices(),\n                        blend_mode,\n                        *paint.paint());\n}\n\nvoid Canvas::drawAtlas(const Paint& paint,\n                       const PaintData& paint_data,\n                       CanvasImage* atlas,\n                       const tonic::Float32List& transforms,\n                       const tonic::Float32List& rects,\n                       const tonic::Int32List& colors,\n                       SkBlendMode blend_mode,\n                       const tonic::Float32List& cull_rect) {\n  if (!canvas_)\n    return;\n\n  sk_sp<SkImage> skImage = atlas->image();\n\n  static_assert(sizeof(SkRSXform) == sizeof(float) * 4,\n                \"SkRSXform doesn't use floats.\");\n  static_assert(sizeof(SkRect) == sizeof(float) * 4,\n                \"SkRect doesn't use floats.\");\n\n  canvas_->drawAtlas(\n      skImage.get(), reinterpret_cast<const SkRSXform*>(transforms.data()),\n      reinterpret_cast<const SkRect*>(rects.data()),\n      reinterpret_cast<const SkColor*>(colors.data()),\n      rects.num_elements() \/ 4,  \/\/ SkRect have four floats.\n      blend_mode, reinterpret_cast<const SkRect*>(cull_rect.data()),\n      paint.paint());\n}\n\nvoid Canvas::drawShadow(const CanvasPath* path,\n                        SkColor color,\n                        double elevation,\n                        bool transparentOccluder) {\n  flow::PhysicalModelLayer::DrawShadow(canvas_,\n                                       path->path(),\n                                       color,\n                                       elevation,\n                                       transparentOccluder);\n}\n\nvoid Canvas::Clear() {\n  canvas_ = nullptr;\n}\n\nbool Canvas::IsRecording() const {\n  return !!canvas_;\n}\n\n}  \/\/ namespace blink\n<commit_msg>Add appropriate include file to canvas.cc (#3697)<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 \"flutter\/lib\/ui\/painting\/canvas.h\"\n\n#include <math.h>\n\n#include \"flutter\/flow\/layers\/physical_model_layer.h\"\n#include \"flutter\/lib\/ui\/painting\/image.h\"\n#include \"flutter\/lib\/ui\/painting\/matrix.h\"\n#include \"lib\/tonic\/converter\/dart_converter.h\"\n#include \"lib\/tonic\/dart_args.h\"\n#include \"lib\/tonic\/dart_binding_macros.h\"\n#include \"lib\/tonic\/dart_library_natives.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\/SkRSXform.h\"\n\nnamespace blink {\n\nstatic void Canvas_constructor(Dart_NativeArguments args) {\n  DartCallConstructor(&Canvas::Create, args);\n}\n\nIMPLEMENT_WRAPPERTYPEINFO(ui, Canvas);\n\n#define FOR_EACH_BINDING(V)         \\\n  V(Canvas, save)                   \\\n  V(Canvas, saveLayerWithoutBounds) \\\n  V(Canvas, saveLayer)              \\\n  V(Canvas, restore)                \\\n  V(Canvas, getSaveCount)           \\\n  V(Canvas, translate)              \\\n  V(Canvas, scale)                  \\\n  V(Canvas, rotate)                 \\\n  V(Canvas, skew)                   \\\n  V(Canvas, transform)              \\\n  V(Canvas, clipRect)               \\\n  V(Canvas, clipRRect)              \\\n  V(Canvas, clipPath)               \\\n  V(Canvas, drawColor)              \\\n  V(Canvas, drawLine)               \\\n  V(Canvas, drawPaint)              \\\n  V(Canvas, drawRect)               \\\n  V(Canvas, drawRRect)              \\\n  V(Canvas, drawDRRect)             \\\n  V(Canvas, drawOval)               \\\n  V(Canvas, drawCircle)             \\\n  V(Canvas, drawArc)                \\\n  V(Canvas, drawPath)               \\\n  V(Canvas, drawImage)              \\\n  V(Canvas, drawImageRect)          \\\n  V(Canvas, drawImageNine)          \\\n  V(Canvas, drawPicture)            \\\n  V(Canvas, drawPoints)             \\\n  V(Canvas, drawVertices)           \\\n  V(Canvas, drawAtlas)              \\\n  V(Canvas, drawShadow)\n\nFOR_EACH_BINDING(DART_NATIVE_CALLBACK)\n\nvoid Canvas::RegisterNatives(tonic::DartLibraryNatives* natives) {\n  natives->Register({{\"Canvas_constructor\", Canvas_constructor, 6, true},\n                     FOR_EACH_BINDING(DART_REGISTER_NATIVE)});\n}\n\nftl::RefPtr<Canvas> Canvas::Create(PictureRecorder* recorder,\n                                   double left,\n                                   double top,\n                                   double right,\n                                   double bottom) {\n  FTL_DCHECK(recorder);\n  FTL_DCHECK(!recorder->isRecording());\n  ftl::RefPtr<Canvas> canvas = ftl::MakeRefCounted<Canvas>(\n      recorder->BeginRecording(SkRect::MakeLTRB(left, top, right, bottom)));\n  recorder->set_canvas(canvas);\n  return canvas;\n}\n\nCanvas::Canvas(SkCanvas* canvas) : canvas_(canvas) {}\n\nCanvas::~Canvas() {}\n\nvoid Canvas::save() {\n  if (!canvas_)\n    return;\n  canvas_->save();\n}\n\nvoid Canvas::saveLayerWithoutBounds(const Paint& paint,\n                                    const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n  canvas_->saveLayer(nullptr, paint.paint());\n}\n\nvoid Canvas::saveLayer(double left,\n                       double top,\n                       double right,\n                       double bottom,\n                       const Paint& paint,\n                       const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n  SkRect bounds = SkRect::MakeLTRB(left, top, right, bottom);\n  canvas_->saveLayer(&bounds, paint.paint());\n}\n\nvoid Canvas::restore() {\n  if (!canvas_)\n    return;\n  canvas_->restore();\n}\n\nint Canvas::getSaveCount() {\n  if (!canvas_)\n    return 0;\n  return canvas_->getSaveCount();\n}\n\nvoid Canvas::translate(double dx, double dy) {\n  if (!canvas_)\n    return;\n  canvas_->translate(dx, dy);\n}\n\nvoid Canvas::scale(double sx, double sy) {\n  if (!canvas_)\n    return;\n  canvas_->scale(sx, sy);\n}\n\nvoid Canvas::rotate(double radians) {\n  if (!canvas_)\n    return;\n  canvas_->rotate(radians * 180.0 \/ M_PI);\n}\n\nvoid Canvas::skew(double sx, double sy) {\n  if (!canvas_)\n    return;\n  canvas_->skew(sx, sy);\n}\n\nvoid Canvas::transform(const tonic::Float64List& matrix4) {\n  if (!canvas_)\n    return;\n  canvas_->concat(ToSkMatrix(matrix4));\n}\n\nvoid Canvas::clipRect(double left, double top, double right, double bottom) {\n  if (!canvas_)\n    return;\n  canvas_->clipRect(SkRect::MakeLTRB(left, top, right, bottom));\n}\n\nvoid Canvas::clipRRect(const RRect& rrect) {\n  if (!canvas_)\n    return;\n  canvas_->clipRRect(rrect.sk_rrect, true);\n}\n\nvoid Canvas::clipPath(const CanvasPath* path) {\n  if (!canvas_)\n    return;\n  canvas_->clipPath(path->path(), true);\n}\n\nvoid Canvas::drawColor(SkColor color, SkBlendMode blend_mode) {\n  if (!canvas_)\n    return;\n  canvas_->drawColor(color, blend_mode);\n}\n\nvoid Canvas::drawLine(double x1,\n                      double y1,\n                      double x2,\n                      double y2,\n                      const Paint& paint,\n                      const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n  canvas_->drawLine(x1, y1, x2, y2, *paint.paint());\n}\n\nvoid Canvas::drawPaint(const Paint& paint, const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n  canvas_->drawPaint(*paint.paint());\n}\n\nvoid Canvas::drawRect(double left,\n                      double top,\n                      double right,\n                      double bottom,\n                      const Paint& paint,\n                      const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n  canvas_->drawRect(SkRect::MakeLTRB(left, top, right, bottom), *paint.paint());\n}\n\nvoid Canvas::drawRRect(const RRect& rrect,\n                       const Paint& paint,\n                       const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n  canvas_->drawRRect(rrect.sk_rrect, *paint.paint());\n}\n\nvoid Canvas::drawDRRect(const RRect& outer,\n                        const RRect& inner,\n                        const Paint& paint,\n                        const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n  canvas_->drawDRRect(outer.sk_rrect, inner.sk_rrect, *paint.paint());\n}\n\nvoid Canvas::drawOval(double left,\n                      double top,\n                      double right,\n                      double bottom,\n                      const Paint& paint,\n                      const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n  canvas_->drawOval(SkRect::MakeLTRB(left, top, right, bottom), *paint.paint());\n}\n\nvoid Canvas::drawCircle(double x,\n                        double y,\n                        double radius,\n                        const Paint& paint,\n                        const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n  canvas_->drawCircle(x, y, radius, *paint.paint());\n}\n\nvoid Canvas::drawArc(double left,\n                     double top,\n                     double right,\n                     double bottom,\n                     double startAngle,\n                     double sweepAngle,\n                     bool useCenter,\n                     const Paint& paint,\n                     const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n  canvas_->drawArc(SkRect::MakeLTRB(left, top, right, bottom),\n                   startAngle * 180.0 \/ M_PI, sweepAngle * 180.0 \/ M_PI,\n                   useCenter, *paint.paint());\n}\n\nvoid Canvas::drawPath(const CanvasPath* path,\n                      const Paint& paint,\n                      const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n  FTL_DCHECK(path);\n  canvas_->drawPath(path->path(), *paint.paint());\n}\n\nvoid Canvas::drawImage(const CanvasImage* image,\n                       double x,\n                       double y,\n                       const Paint& paint,\n                       const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n  FTL_DCHECK(image);\n  canvas_->drawImage(image->image(), x, y, paint.paint());\n}\n\nvoid Canvas::drawImageRect(const CanvasImage* image,\n                           double src_left,\n                           double src_top,\n                           double src_right,\n                           double src_bottom,\n                           double dst_left,\n                           double dst_top,\n                           double dst_right,\n                           double dst_bottom,\n                           const Paint& paint,\n                           const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n  FTL_DCHECK(image);\n  SkRect src = SkRect::MakeLTRB(src_left, src_top, src_right, src_bottom);\n  SkRect dst = SkRect::MakeLTRB(dst_left, dst_top, dst_right, dst_bottom);\n  canvas_->drawImageRect(image->image(), src, dst, paint.paint(),\n                         SkCanvas::kFast_SrcRectConstraint);\n}\n\nvoid Canvas::drawImageNine(const CanvasImage* image,\n                           double center_left,\n                           double center_top,\n                           double center_right,\n                           double center_bottom,\n                           double dst_left,\n                           double dst_top,\n                           double dst_right,\n                           double dst_bottom,\n                           const Paint& paint,\n                           const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n  FTL_DCHECK(image);\n  SkRect center =\n      SkRect::MakeLTRB(center_left, center_top, center_right, center_bottom);\n  SkIRect icenter;\n  center.round(&icenter);\n  SkRect dst = SkRect::MakeLTRB(dst_left, dst_top, dst_right, dst_bottom);\n  canvas_->drawImageNine(image->image(), icenter, dst, paint.paint());\n}\n\nvoid Canvas::drawPicture(Picture* picture) {\n  if (!canvas_)\n    return;\n  FTL_DCHECK(picture);\n  canvas_->drawPicture(picture->picture().get());\n}\n\nvoid Canvas::drawPoints(const Paint& paint,\n                        const PaintData& paint_data,\n                        SkCanvas::PointMode point_mode,\n                        const tonic::Float32List& points) {\n  if (!canvas_)\n    return;\n\n  static_assert(sizeof(SkPoint) == sizeof(float) * 2,\n                \"SkPoint doesn't use floats.\");\n\n  canvas_->drawPoints(point_mode,\n                      points.num_elements() \/ 2,  \/\/ SkPoints have two floats.\n                      reinterpret_cast<const SkPoint*>(points.data()),\n                      *paint.paint());\n}\n\nvoid Canvas::drawVertices(const Vertices* vertices,\n                          SkBlendMode blend_mode,\n                          const Paint& paint,\n                          const PaintData& paint_data) {\n  if (!canvas_)\n    return;\n\n  canvas_->drawVertices(vertices->vertices(),\n                        blend_mode,\n                        *paint.paint());\n}\n\nvoid Canvas::drawAtlas(const Paint& paint,\n                       const PaintData& paint_data,\n                       CanvasImage* atlas,\n                       const tonic::Float32List& transforms,\n                       const tonic::Float32List& rects,\n                       const tonic::Int32List& colors,\n                       SkBlendMode blend_mode,\n                       const tonic::Float32List& cull_rect) {\n  if (!canvas_)\n    return;\n\n  sk_sp<SkImage> skImage = atlas->image();\n\n  static_assert(sizeof(SkRSXform) == sizeof(float) * 4,\n                \"SkRSXform doesn't use floats.\");\n  static_assert(sizeof(SkRect) == sizeof(float) * 4,\n                \"SkRect doesn't use floats.\");\n\n  canvas_->drawAtlas(\n      skImage.get(), reinterpret_cast<const SkRSXform*>(transforms.data()),\n      reinterpret_cast<const SkRect*>(rects.data()),\n      reinterpret_cast<const SkColor*>(colors.data()),\n      rects.num_elements() \/ 4,  \/\/ SkRect have four floats.\n      blend_mode, reinterpret_cast<const SkRect*>(cull_rect.data()),\n      paint.paint());\n}\n\nvoid Canvas::drawShadow(const CanvasPath* path,\n                        SkColor color,\n                        double elevation,\n                        bool transparentOccluder) {\n  flow::PhysicalModelLayer::DrawShadow(canvas_,\n                                       path->path(),\n                                       color,\n                                       elevation,\n                                       transparentOccluder);\n}\n\nvoid Canvas::Clear() {\n  canvas_ = nullptr;\n}\n\nbool Canvas::IsRecording() const {\n  return !!canvas_;\n}\n\n}  \/\/ namespace blink\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    This file is part of libkcal.\n    Copyright (c) 2001 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\/\/ $Id$\n\n#include <kglobal.h>\n#include <klocale.h>\n#include <kdebug.h>\n\n#include \"calformat.h\"\n\n#include \"incidencebase.h\"\n\nusing namespace KCal;\n\nIncidenceBase::IncidenceBase() :\n  mReadOnly(false), mFloats(true), mDuration(0), mHasDuration(false),\n  mPilotId(0), mSyncStatus(SYNCMOD), mObserver(0)\n{\n  setUid(CalFormat::createUniqueId());\n\n  mAttendees.setAutoDelete( true );\n}\n\nIncidenceBase::IncidenceBase(const IncidenceBase &i)\n{\n  mReadOnly = i.mReadOnly;\n  mDtStart = i.mDtStart;\n  mDuration = i.mDuration;\n  mHasDuration = i.mHasDuration;\n  mOrganizer = i.mOrganizer;\n  mUid = i.mUid;\n  QPtrList<Attendee> attendees;\n  for( Attendee *a = attendees.first(); a; a = attendees.next() ) {\n    mAttendees.append( new Attendee( *a ) );\n  }\n  mFloats = i.mFloats;\n  mLastModified = i.mLastModified;\n  mPilotId = i.mPilotId;\n  mSyncStatus = i.mSyncStatus;\n  mObserver = i.mObserver;\n  \n  mAttendees.setAutoDelete( true );\n}\n\nIncidenceBase::~IncidenceBase()\n{\n}\n\nvoid IncidenceBase::setUid(const QString &uid)\n{\n  mUid = uid;\n  updated();\n}\n\nQString IncidenceBase::uid() const\n{\n  return mUid;\n}\n\nvoid IncidenceBase::setLastModified(const QDateTime &lm)\n{\n  \/\/ DON'T! updated() because we call this from\n  \/\/ Calendar::updateEvent().\n  mLastModified = lm;\n}\n\nQDateTime IncidenceBase::lastModified() const\n{\n  return mLastModified;\n}\n\nvoid IncidenceBase::setOrganizer(const QString &o)\n{\n  \/\/ we don't check for readonly here, because it is\n  \/\/ possible that by setting the organizer we are changing\n  \/\/ the event's readonly status...\n  mOrganizer = o;\n  if (mOrganizer.left(7).upper() == \"MAILTO:\")\n    mOrganizer = mOrganizer.remove(0,7);\n\n  updated();\n}\n\nQString IncidenceBase::organizer() const\n{\n  return mOrganizer;\n}\n\nvoid IncidenceBase::setReadOnly( bool readOnly )\n{\n  mReadOnly = readOnly;\n}\n\nvoid IncidenceBase::setDtStart(const QDateTime &dtStart)\n{\n\/\/  if (mReadOnly) return;\n  mDtStart = dtStart;\n  updated();\n}\n\nQDateTime IncidenceBase::dtStart() const\n{\n  return mDtStart;\n}\n\nQString IncidenceBase::dtStartTimeStr() const\n{\n  return KGlobal::locale()->formatTime(dtStart().time());\n}\n\nQString IncidenceBase::dtStartDateStr(bool shortfmt) const\n{\n  return KGlobal::locale()->formatDate(dtStart().date(),shortfmt);\n}\n\nQString IncidenceBase::dtStartStr() const\n{\n  return KGlobal::locale()->formatDateTime(dtStart());\n}\n\n\nbool IncidenceBase::doesFloat() const\n{\n  return mFloats;\n}\n\nvoid IncidenceBase::setFloats(bool f)\n{\n  if (mReadOnly) return;\n  mFloats = f;\n  updated();\n}\n\n\nvoid IncidenceBase::addAttendee(Attendee *a, bool doupdate)\n{\n\/\/  kdDebug(5800) << \"IncidenceBase::addAttendee()\" << endl;\n  if (mReadOnly) return;\n\/\/  kdDebug(5800) << \"IncidenceBase::addAttendee() weiter\" << endl;\n  if (a->name().left(7).upper() == \"MAILTO:\")\n    a->setName(a->name().remove(0,7));\n\n  mAttendees.append(a);\n  if (doupdate) updated();\n}\n\n#if 0\nvoid IncidenceBase::removeAttendee(Attendee *a)\n{\n  if (mReadOnly) return;\n  mAttendees.removeRef(a);\n  updated();\n}\n\nvoid IncidenceBase::removeAttendee(const char *n)\n{\n  Attendee *a;\n\n  if (mReadOnly) return;\n  for (a = mAttendees.first(); a; a = mAttendees.next())\n    if (a->getName() == n) {\n      mAttendees.remove();\n      break;\n    }\n}\n#endif\n\nvoid IncidenceBase::clearAttendees()\n{\n  if (mReadOnly) return;\n  mAttendees.clear();\n}\n\n#if 0\nAttendee *IncidenceBase::getAttendee(const char *n) const\n{\n  QPtrListIterator<Attendee> qli(mAttendees);\n\n  qli.toFirst();\n  while (qli) {\n    if (qli.current()->getName() == n)\n      return qli.current();\n    ++qli;\n  }\n  return 0L;\n}\n#endif\n\nAttendee *IncidenceBase::attendeeByMail(const QString &email)\n{\n  QPtrListIterator<Attendee> qli(mAttendees);\n\n  qli.toFirst();\n  while (qli) {\n    if (qli.current()->email() == email)\n      return qli.current();\n    ++qli;\n  }\n  return 0L;\n}\n\nAttendee *IncidenceBase::attendeeByMails(const QStringList &emails, QString email)\n{\n  QPtrListIterator<Attendee> qli(mAttendees);\n\n  QStringList mails = emails;\n  if (!email.isEmpty()) {\n    mails.append(email);\n  }\n  qli.toFirst();\n  while (qli) {\n    for ( QStringList::Iterator it = mails.begin(); it != mails.end(); ++it ) {\n      if (qli.current()->email() == *it)\n        return qli.current();\n     }\n\n    ++qli;\n  }\n  return 0L;\n}\n\nvoid IncidenceBase::setDuration(int seconds)\n{\n  mDuration = seconds;\n  setHasDuration(true);\n}\n\nint IncidenceBase::duration() const\n{\n  return mDuration;\n}\n\nvoid IncidenceBase::setHasDuration(bool)\n{\n  mHasDuration = true;\n}\n\nbool IncidenceBase::hasDuration() const\n{\n  return mHasDuration;\n}\n\nvoid IncidenceBase::setSyncStatus(int stat)\n{\n  if (mReadOnly) return;\n  mSyncStatus = stat;\n}\n\nint IncidenceBase::syncStatus() const\n{\n  return mSyncStatus;\n}\n\nvoid IncidenceBase::setPilotId( int id )\n{\n  if (mReadOnly) return;\n\n  mPilotId = id;\n}\n\nint IncidenceBase::pilotId() const\n{\n  return mPilotId;\n}\n\nvoid IncidenceBase::registerObserver( IncidenceBase::Observer *observer )\n{\n  mObserver = observer;\n}\n\nvoid IncidenceBase::updated()\n{\n  if ( mObserver ) {\n    mObserver->incidenceUpdated( this );\n  }\n}\n<commit_msg>IncidenceBase copyconstructor copies attendees too<commit_after>\/*\n    This file is part of libkcal.\n    Copyright (c) 2001 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\/\/ $Id$\n\n#include <kglobal.h>\n#include <klocale.h>\n#include <kdebug.h>\n\n#include \"calformat.h\"\n\n#include \"incidencebase.h\"\n\nusing namespace KCal;\n\nIncidenceBase::IncidenceBase() :\n  mReadOnly(false), mFloats(true), mDuration(0), mHasDuration(false),\n  mPilotId(0), mSyncStatus(SYNCMOD), mObserver(0)\n{\n  setUid(CalFormat::createUniqueId());\n\n  mAttendees.setAutoDelete( true );\n}\n\nIncidenceBase::IncidenceBase(const IncidenceBase &i)\n{\n  mReadOnly = i.mReadOnly;\n  mDtStart = i.mDtStart;\n  mDuration = i.mDuration;\n  mHasDuration = i.mHasDuration;\n  mOrganizer = i.mOrganizer;\n  mUid = i.mUid;\n  QPtrList<Attendee> attendees = i.attendees();\n  for( Attendee *a = attendees.first(); a; a = attendees.next() ) {\n    mAttendees.append( new Attendee( *a ) );\n  }\n  mFloats = i.mFloats;\n  mLastModified = i.mLastModified;\n  mPilotId = i.mPilotId;\n  mSyncStatus = i.mSyncStatus;\n  mObserver = i.mObserver;\n  \n  mAttendees.setAutoDelete( true );\n}\n\nIncidenceBase::~IncidenceBase()\n{\n}\n\nvoid IncidenceBase::setUid(const QString &uid)\n{\n  mUid = uid;\n  updated();\n}\n\nQString IncidenceBase::uid() const\n{\n  return mUid;\n}\n\nvoid IncidenceBase::setLastModified(const QDateTime &lm)\n{\n  \/\/ DON'T! updated() because we call this from\n  \/\/ Calendar::updateEvent().\n  mLastModified = lm;\n}\n\nQDateTime IncidenceBase::lastModified() const\n{\n  return mLastModified;\n}\n\nvoid IncidenceBase::setOrganizer(const QString &o)\n{\n  \/\/ we don't check for readonly here, because it is\n  \/\/ possible that by setting the organizer we are changing\n  \/\/ the event's readonly status...\n  mOrganizer = o;\n  if (mOrganizer.left(7).upper() == \"MAILTO:\")\n    mOrganizer = mOrganizer.remove(0,7);\n\n  updated();\n}\n\nQString IncidenceBase::organizer() const\n{\n  return mOrganizer;\n}\n\nvoid IncidenceBase::setReadOnly( bool readOnly )\n{\n  mReadOnly = readOnly;\n}\n\nvoid IncidenceBase::setDtStart(const QDateTime &dtStart)\n{\n\/\/  if (mReadOnly) return;\n  mDtStart = dtStart;\n  updated();\n}\n\nQDateTime IncidenceBase::dtStart() const\n{\n  return mDtStart;\n}\n\nQString IncidenceBase::dtStartTimeStr() const\n{\n  return KGlobal::locale()->formatTime(dtStart().time());\n}\n\nQString IncidenceBase::dtStartDateStr(bool shortfmt) const\n{\n  return KGlobal::locale()->formatDate(dtStart().date(),shortfmt);\n}\n\nQString IncidenceBase::dtStartStr() const\n{\n  return KGlobal::locale()->formatDateTime(dtStart());\n}\n\n\nbool IncidenceBase::doesFloat() const\n{\n  return mFloats;\n}\n\nvoid IncidenceBase::setFloats(bool f)\n{\n  if (mReadOnly) return;\n  mFloats = f;\n  updated();\n}\n\n\nvoid IncidenceBase::addAttendee(Attendee *a, bool doupdate)\n{\n\/\/  kdDebug(5800) << \"IncidenceBase::addAttendee()\" << endl;\n  if (mReadOnly) return;\n\/\/  kdDebug(5800) << \"IncidenceBase::addAttendee() weiter\" << endl;\n  if (a->name().left(7).upper() == \"MAILTO:\")\n    a->setName(a->name().remove(0,7));\n\n  mAttendees.append(a);\n  if (doupdate) updated();\n}\n\n#if 0\nvoid IncidenceBase::removeAttendee(Attendee *a)\n{\n  if (mReadOnly) return;\n  mAttendees.removeRef(a);\n  updated();\n}\n\nvoid IncidenceBase::removeAttendee(const char *n)\n{\n  Attendee *a;\n\n  if (mReadOnly) return;\n  for (a = mAttendees.first(); a; a = mAttendees.next())\n    if (a->getName() == n) {\n      mAttendees.remove();\n      break;\n    }\n}\n#endif\n\nvoid IncidenceBase::clearAttendees()\n{\n  if (mReadOnly) return;\n  mAttendees.clear();\n}\n\n#if 0\nAttendee *IncidenceBase::getAttendee(const char *n) const\n{\n  QPtrListIterator<Attendee> qli(mAttendees);\n\n  qli.toFirst();\n  while (qli) {\n    if (qli.current()->getName() == n)\n      return qli.current();\n    ++qli;\n  }\n  return 0L;\n}\n#endif\n\nAttendee *IncidenceBase::attendeeByMail(const QString &email)\n{\n  QPtrListIterator<Attendee> qli(mAttendees);\n\n  qli.toFirst();\n  while (qli) {\n    if (qli.current()->email() == email)\n      return qli.current();\n    ++qli;\n  }\n  return 0L;\n}\n\nAttendee *IncidenceBase::attendeeByMails(const QStringList &emails, QString email)\n{\n  QPtrListIterator<Attendee> qli(mAttendees);\n\n  QStringList mails = emails;\n  if (!email.isEmpty()) {\n    mails.append(email);\n  }\n  qli.toFirst();\n  while (qli) {\n    for ( QStringList::Iterator it = mails.begin(); it != mails.end(); ++it ) {\n      if (qli.current()->email() == *it)\n        return qli.current();\n     }\n\n    ++qli;\n  }\n  return 0L;\n}\n\nvoid IncidenceBase::setDuration(int seconds)\n{\n  mDuration = seconds;\n  setHasDuration(true);\n}\n\nint IncidenceBase::duration() const\n{\n  return mDuration;\n}\n\nvoid IncidenceBase::setHasDuration(bool)\n{\n  mHasDuration = true;\n}\n\nbool IncidenceBase::hasDuration() const\n{\n  return mHasDuration;\n}\n\nvoid IncidenceBase::setSyncStatus(int stat)\n{\n  if (mReadOnly) return;\n  mSyncStatus = stat;\n}\n\nint IncidenceBase::syncStatus() const\n{\n  return mSyncStatus;\n}\n\nvoid IncidenceBase::setPilotId( int id )\n{\n  if (mReadOnly) return;\n\n  mPilotId = id;\n}\n\nint IncidenceBase::pilotId() const\n{\n  return mPilotId;\n}\n\nvoid IncidenceBase::registerObserver( IncidenceBase::Observer *observer )\n{\n  mObserver = observer;\n}\n\nvoid IncidenceBase::updated()\n{\n  if ( mObserver ) {\n    mObserver->incidenceUpdated( this );\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <chord.h>\n#include <dhash.h>\n#include <chord_prot.h>\n#include \"sfsmisc.h\"\n#include \"arpc.h\"\n#include \"crypt.h\"\n#include <sys\/time.h>\n#include \"chord_util.h\"\n#ifdef DMALLOC\n#include \"dmalloc.h\"\n#endif\n\n\/*\n * Implementation of the distributed hash service.\n *\/\n\ndhashclient::dhashclient (ptr<axprt_stream> _x, ptr<chord> node)\n  : x (_x), clntnode(node), do_caching (0)\n{\n  clntsrv = asrv::alloc (x, dhashclnt_program_1,\n\t\t\t wrap (this, &dhashclient::dispatch));\n}\n\nvoid\ndhashclient::dispatch (svccb *sbp)\n{\n  if (!sbp) {\n    delete this;\n    return;\n  }\n  assert (clntnode);\n\n  switch (sbp->proc ()) {\n  case DHASHPROC_NULL:\n    sbp->reply (NULL);\n    return;\n  case DHASHPROC_LOOKUP:\n    {\n      warnt(\"DHASH: lookup_request\");\n      \n      \/* OLD SCHOOL lookup\n      clntnode->find_successor (arg->key, \n\t\t\t\twrap (this, &dhashclient::lookup_findsucc_cb, \n\t\t\t\t      sbp));\n      *\/\n      ptr<dhash_fetch_arg> arg = New refcounted<dhash_fetch_arg> ();\n      chordID next = clntnode->lookup_closestpred (arg->key);\n      dhash_fetchiter_res *i_res = New dhash_fetchiter_res (DHASH_COMPLETE);\n      \n      route path;\n      path.push_back (next);\n      clntnode->doRPC (next, dhash_program_1, DHASHPROC_FETCHITER, arg, i_res,\n\t\t       wrap(this, &dhashclient::lookup_iter_cb, \n\t\t\t    sbp, i_res, next, path));\n\n    } \n    break;\n\n  case DHASHPROC_TRANSFER:\n    {\n      warnt (\"DHASH: transfer_request\");\n      dhash_transfer_arg *targ = sbp->template getarg<dhash_transfer_arg>();\n      ptr<dhash_fetch_arg> farg = \n\tNew refcounted<dhash_fetch_arg>(targ->farg);\n      dhash_res *res = New dhash_res ();\n      clntnode->doRPC (targ->source, dhash_program_1, DHASHPROC_FETCH, \n\t\t       farg, res, \n\t\t       wrap (this, &dhashclient::transfer_cb,\n\t\t\t     sbp, res));\n    }\n    break;\n  case DHASHPROC_INSERT:\n    {\n      warnt(\"DHASH: insert_request\");\n      dhash_insertarg *item = sbp->template getarg<dhash_insertarg> ();\n      memorize_block (item);\n      ptr<dhash_insertarg> p_item = New refcounted<dhash_insertarg> (*item);\n      chordID n = item->key;\n      clntnode->find_successor (n, wrap(this, &dhashclient::insert_findsucc_cb,\n\t\t\t\t    sbp, p_item));\n    }\n    break;\n  default:\n    sbp->reject (PROC_UNAVAIL);\n    break;\n  }\n}\n\nvoid\ndhashclient::insert_findsucc_cb(svccb *sbp, ptr<dhash_insertarg> item,\n\t\t\t\tchordID succ, route path,\n\t\t\t\tchordstat err) {\n  if (err) {\n    dhash_res res;\n    warn << \"error finding sucessor\\n\";\n    res.set_status(DHASH_CHORDERR);\n    sbp->reply(&res);\n  } else {\n\n    warnt(\"DHASH: insert_after_dofindsucc|issue_STORE\");\n\n    dhash_storeres *res = New dhash_storeres();\n    clntnode->doRPC(succ, dhash_program_1, DHASHPROC_STORE, item, res,\n\t\twrap(this, &dhashclient::insert_store_cb, sbp, res, item, succ));\n    \n    cache_on_path (item->key, path);\n  }\n}\n\nvoid\ndhashclient::insert_store_cb(svccb *sbp, dhash_storeres *res, \n\t\t\t     ptr<dhash_insertarg> item,\n\t\t\t     chordID source,\n\t\t\t     clnt_stat err )\n{\n  warnt(\"DHASH: insert_after_STORE\");\n  if (res->status == DHASH_RETRY) {\n    dhash_storeres *nres = New dhash_storeres();\n    clntnode->locations->cacheloc (res->pred->p.x, res->pred->p.r, source);\n    clntnode->doRPC(res->pred->p.x, dhash_program_1, \n\t\t    DHASHPROC_STORE, item, nres,\n\t\t    wrap(this, &dhashclient::insert_store_cb, sbp, nres, item, source));\n\n  } else\n    sbp->reply (res);\n\n  delete res;\n}\n\nvoid \ndhashclient::lookup_iter_cb (svccb *sbp, \n\t\t\t     dhash_fetchiter_res *res,\n\t\t\t     chordID prev,\n\t\t\t     route path,\n\t\t\t     clnt_stat err) \n{\n  dhash_fetch_arg *arg = sbp->template getarg<dhash_fetch_arg> ();\n  if (err) {\n    sbp->replyref (DHASH_RPCERR);\n  } else if (res->status == DHASH_COMPLETE) {\n    memorize_block (arg->key, res);\n    dhash_res *fres = New dhash_res (DHASH_OK);\n    fres->resok->res = res->compl_res->res;\n    fres->resok->offset = res->compl_res->offset;\n    fres->resok->attr = res->compl_res->attr;\n    fres->resok->hops = path.size ();\n    fres->resok->source = prev;\n    cache_on_path (arg->key, path);\n    sbp->reply (fres);\n  } else if (res->status == DHASH_CONTINUE) {\n    chordID next = res->cont_res->next.x;\n    clntnode->locations->cacheloc (next, res->cont_res->next.r, prev);\n    dhash_fetchiter_res *nres = New dhash_fetchiter_res;\n    path.push_back (next);\n    ptr<dhash_fetch_arg> rarg = New refcounted<dhash_fetch_arg>(*arg);\n    clntnode->doRPC (next, dhash_program_1, DHASHPROC_FETCHITER, \n\t\t     rarg, nres,\n\t\t     wrap(this, &dhashclient::lookup_iter_cb, \n\t\t\t  sbp, nres, next, path));\n  } else \n    sbp->replyref (DHASH_NOENT);\n\n  delete res;\n}\n\nvoid\ndhashclient::transfer_cb (svccb *sbp, dhash_res *res, clnt_stat err)\n{\n  if (err) res->set_status (DHASH_RPCERR);\n  else if (res->status == DHASH_OK) res->resok->hops = 0;\n  \n  sbp->reply (res);\n  delete res;\n}\t\t\t\t  \nvoid\ndhashclient::memorize_block (dhash_insertarg *item) \n{\n  memorize_block (item->key, item->attr.size, item->offset, \n\t\t  item->data.base(), item->data.size ());\n}\nvoid\ndhashclient::memorize_block (chordID key, dhash_fetchiter_res *res) \n{\n  if (res->status != DHASH_COMPLETE) return;\n  memorize_block (key, res->compl_res->attr.size,\n\t\t  res->compl_res->offset,\n\t\t  res->compl_res->res.base (),\n\t\t  res->compl_res->res.size ());\n}\nvoid\ndhashclient::memorize_block (chordID key, int tsize, \n\t\t\t     int offset, void *base, int dsize)\n{\n  store_state *ss = pst[key];\n  if (!ss) {\n    store_state nss (tsize);\n    pst.insert(key, nss);\n    ss = pst[key];\n  } \n  ss->read += dsize;\n  memcpy (ss->buf + offset, base, dsize);\n}\n\nbool\ndhashclient::block_memorized (chordID key) \n{\n  store_state *ss = pst[key];\n  return (ss->read == ss->size);\n}\n\nvoid \ndhashclient::forget_block (chordID key)\n{\n  store_state *ss = pst[key];\n  delete ss->buf;\n  pst.remove (key);\n}\n\nvoid\ndhashclient::cache_on_path (chordID key, route path)\n{\n  if (!block_memorized (key)) return;\n  for (unsigned int i=0; i < path.size (); i++)\n    send_block (key, path[i], DHASH_CACHE);\n}\n\nvoid\ndhashclient::send_block (chordID key, chordID to, store_status stat)\n{\n  store_state *ss = pst[key];\n  \n  unsigned int mtu = 8192;\n  unsigned int off = 0;\n  do {\n    dhash_storeres *res = New dhash_storeres ();\n    ptr<dhash_insertarg> i_arg = New refcounted<dhash_insertarg> ();\n    i_arg->key = key;\n    i_arg->offset = off;\n    int remain = (off + mtu <= static_cast<unsigned long>(ss->size)) ? \n      mtu : ss->size - off;\n    i_arg->data.setsize (remain);\n    i_arg->attr.size = ss->size;\n    i_arg->type = stat;\n    memcpy(i_arg->data.base (), ss->buf + off, remain);\n    \n    clntnode->doRPC(to, dhash_program_1, DHASHPROC_STORE, \n\t\t    i_arg, res,\n\t\t    wrap(this, &dhashclient::send_store_cb, res));\n    off += remain;\n  } while (off < static_cast<unsigned long>(ss->size));\n}\n  \nvoid\ndhashclient::send_store_cb (dhash_storeres *res, clnt_stat err) \n{\n  if ((err) || (res->status))  warn << \"Error caching block\\n\";\n  delete res;\n}\n<commit_msg>Don't dallocate dhashclient when client disappears.<commit_after>#include <chord.h>\n#include <dhash.h>\n#include <chord_prot.h>\n#include \"sfsmisc.h\"\n#include \"arpc.h\"\n#include \"crypt.h\"\n#include <sys\/time.h>\n#include \"chord_util.h\"\n#ifdef DMALLOC\n#include \"dmalloc.h\"\n#endif\n\n\/*\n * Implementation of the distributed hash service.\n *\/\n\ndhashclient::dhashclient (ptr<axprt_stream> _x, ptr<chord> node)\n  : x (_x), clntnode(node), do_caching (0)\n{\n  clntsrv = asrv::alloc (x, dhashclnt_program_1,\n\t\t\t wrap (this, &dhashclient::dispatch));\n}\n\nvoid\ndhashclient::dispatch (svccb *sbp)\n{\n  if (!sbp) {\n    return;\n  }\n  assert (clntnode);\n\n  switch (sbp->proc ()) {\n  case DHASHPROC_NULL:\n    sbp->reply (NULL);\n    return;\n  case DHASHPROC_LOOKUP:\n    {\n      warnt(\"DHASH: lookup_request\");\n      \n      \/* OLD SCHOOL lookup\n      clntnode->find_successor (arg->key, \n\t\t\t\twrap (this, &dhashclient::lookup_findsucc_cb, \n\t\t\t\t      sbp));\n      *\/\n      ptr<dhash_fetch_arg> arg = New refcounted<dhash_fetch_arg> ();\n      chordID next = clntnode->lookup_closestpred (arg->key);\n      dhash_fetchiter_res *i_res = New dhash_fetchiter_res (DHASH_COMPLETE);\n      \n      route path;\n      path.push_back (next);\n      clntnode->doRPC (next, dhash_program_1, DHASHPROC_FETCHITER, arg, i_res,\n\t\t       wrap(this, &dhashclient::lookup_iter_cb, \n\t\t\t    sbp, i_res, next, path));\n\n    } \n    break;\n\n  case DHASHPROC_TRANSFER:\n    {\n      warnt (\"DHASH: transfer_request\");\n      dhash_transfer_arg *targ = sbp->template getarg<dhash_transfer_arg>();\n      ptr<dhash_fetch_arg> farg = \n\tNew refcounted<dhash_fetch_arg>(targ->farg);\n      dhash_res *res = New dhash_res ();\n      clntnode->doRPC (targ->source, dhash_program_1, DHASHPROC_FETCH, \n\t\t       farg, res, \n\t\t       wrap (this, &dhashclient::transfer_cb,\n\t\t\t     sbp, res));\n    }\n    break;\n  case DHASHPROC_INSERT:\n    {\n      warnt(\"DHASH: insert_request\");\n      dhash_insertarg *item = sbp->template getarg<dhash_insertarg> ();\n      memorize_block (item);\n      ptr<dhash_insertarg> p_item = New refcounted<dhash_insertarg> (*item);\n      chordID n = item->key;\n      clntnode->find_successor (n, wrap(this, &dhashclient::insert_findsucc_cb,\n\t\t\t\t    sbp, p_item));\n    }\n    break;\n  default:\n    sbp->reject (PROC_UNAVAIL);\n    break;\n  }\n}\n\nvoid\ndhashclient::insert_findsucc_cb(svccb *sbp, ptr<dhash_insertarg> item,\n\t\t\t\tchordID succ, route path,\n\t\t\t\tchordstat err) {\n  if (err) {\n    dhash_res res;\n    warn << \"error finding sucessor\\n\";\n    res.set_status(DHASH_CHORDERR);\n    sbp->reply(&res);\n  } else {\n\n    warnt(\"DHASH: insert_after_dofindsucc|issue_STORE\");\n\n    dhash_storeres *res = New dhash_storeres();\n    clntnode->doRPC(succ, dhash_program_1, DHASHPROC_STORE, item, res,\n\t\twrap(this, &dhashclient::insert_store_cb, sbp, res, item, succ));\n    \n    cache_on_path (item->key, path);\n  }\n}\n\nvoid\ndhashclient::insert_store_cb(svccb *sbp, dhash_storeres *res, \n\t\t\t     ptr<dhash_insertarg> item,\n\t\t\t     chordID source,\n\t\t\t     clnt_stat err )\n{\n  warnt(\"DHASH: insert_after_STORE\");\n  if (res->status == DHASH_RETRY) {\n    dhash_storeres *nres = New dhash_storeres();\n    clntnode->locations->cacheloc (res->pred->p.x, res->pred->p.r, source);\n    clntnode->doRPC(res->pred->p.x, dhash_program_1, \n\t\t    DHASHPROC_STORE, item, nres,\n\t\t    wrap(this, &dhashclient::insert_store_cb, sbp, nres, item, source));\n\n  } else\n    sbp->reply (res);\n\n  delete res;\n}\n\nvoid \ndhashclient::lookup_iter_cb (svccb *sbp, \n\t\t\t     dhash_fetchiter_res *res,\n\t\t\t     chordID prev,\n\t\t\t     route path,\n\t\t\t     clnt_stat err) \n{\n  dhash_fetch_arg *arg = sbp->template getarg<dhash_fetch_arg> ();\n  if (err) {\n    sbp->replyref (DHASH_RPCERR);\n  } else if (res->status == DHASH_COMPLETE) {\n    memorize_block (arg->key, res);\n    dhash_res *fres = New dhash_res (DHASH_OK);\n    fres->resok->res = res->compl_res->res;\n    fres->resok->offset = res->compl_res->offset;\n    fres->resok->attr = res->compl_res->attr;\n    fres->resok->hops = path.size ();\n    fres->resok->source = prev;\n    cache_on_path (arg->key, path);\n    sbp->reply (fres);\n  } else if (res->status == DHASH_CONTINUE) {\n    chordID next = res->cont_res->next.x;\n    clntnode->locations->cacheloc (next, res->cont_res->next.r, prev);\n    dhash_fetchiter_res *nres = New dhash_fetchiter_res;\n    path.push_back (next);\n    ptr<dhash_fetch_arg> rarg = New refcounted<dhash_fetch_arg>(*arg);\n    clntnode->doRPC (next, dhash_program_1, DHASHPROC_FETCHITER, \n\t\t     rarg, nres,\n\t\t     wrap(this, &dhashclient::lookup_iter_cb, \n\t\t\t  sbp, nres, next, path));\n  } else \n    sbp->replyref (DHASH_NOENT);\n\n  delete res;\n}\n\nvoid\ndhashclient::transfer_cb (svccb *sbp, dhash_res *res, clnt_stat err)\n{\n  if (err) res->set_status (DHASH_RPCERR);\n  else if (res->status == DHASH_OK) res->resok->hops = 0;\n  \n  sbp->reply (res);\n  delete res;\n}\t\t\t\t  \nvoid\ndhashclient::memorize_block (dhash_insertarg *item) \n{\n  memorize_block (item->key, item->attr.size, item->offset, \n\t\t  item->data.base(), item->data.size ());\n}\nvoid\ndhashclient::memorize_block (chordID key, dhash_fetchiter_res *res) \n{\n  if (res->status != DHASH_COMPLETE) return;\n  memorize_block (key, res->compl_res->attr.size,\n\t\t  res->compl_res->offset,\n\t\t  res->compl_res->res.base (),\n\t\t  res->compl_res->res.size ());\n}\nvoid\ndhashclient::memorize_block (chordID key, int tsize, \n\t\t\t     int offset, void *base, int dsize)\n{\n  store_state *ss = pst[key];\n  if (!ss) {\n    store_state nss (tsize);\n    pst.insert(key, nss);\n    ss = pst[key];\n  } \n  ss->read += dsize;\n  memcpy (ss->buf + offset, base, dsize);\n}\n\nbool\ndhashclient::block_memorized (chordID key) \n{\n  store_state *ss = pst[key];\n  return (ss->read == ss->size);\n}\n\nvoid \ndhashclient::forget_block (chordID key)\n{\n  store_state *ss = pst[key];\n  delete ss->buf;\n  pst.remove (key);\n}\n\nvoid\ndhashclient::cache_on_path (chordID key, route path)\n{\n  if (!block_memorized (key)) return;\n  for (unsigned int i=0; i < path.size (); i++)\n    send_block (key, path[i], DHASH_CACHE);\n}\n\nvoid\ndhashclient::send_block (chordID key, chordID to, store_status stat)\n{\n  store_state *ss = pst[key];\n  \n  unsigned int mtu = 8192;\n  unsigned int off = 0;\n  do {\n    dhash_storeres *res = New dhash_storeres ();\n    ptr<dhash_insertarg> i_arg = New refcounted<dhash_insertarg> ();\n    i_arg->key = key;\n    i_arg->offset = off;\n    int remain = (off + mtu <= static_cast<unsigned long>(ss->size)) ? \n      mtu : ss->size - off;\n    i_arg->data.setsize (remain);\n    i_arg->attr.size = ss->size;\n    i_arg->type = stat;\n    memcpy(i_arg->data.base (), ss->buf + off, remain);\n    \n    clntnode->doRPC(to, dhash_program_1, DHASHPROC_STORE, \n\t\t    i_arg, res,\n\t\t    wrap(this, &dhashclient::send_store_cb, res));\n    off += remain;\n  } while (off < static_cast<unsigned long>(ss->size));\n}\n  \nvoid\ndhashclient::send_store_cb (dhash_storeres *res, clnt_stat err) \n{\n  if ((err) || (res->status))  warn << \"Error caching block\\n\";\n  delete res;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *\n * Copyright (C) 2001  Frank Dabek (fdabek@lcs.mit.edu), \n *                     Frans Kaashoek (kaashoek@lcs.mit.edu),\n *   \t\t       Massachusetts Institute of Technology\n * \n *\n *  Permission is hereby granted, free of charge, to any person obtaining\n *  a copy of this software and associated documentation files (the\n *  \"Software\"), to deal in the Software without restriction, including\n *  without limitation the rights to use, copy, modify, merge, publish,\n *  distribute, sublicense, and\/or sell copies of the Software, and to\n *  permit persons to whom the Software is furnished to do so, subject to\n *  the following conditions:\n *\n *  The above copyright notice and this permission notice shall be\n *  included in all copies or substantial portions of the Software.\n *\n *  THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE\n *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\n *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION\n *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n *\n *\/\n\n#include <chord.h>\n#include <dhash.h>\n#include <chord_prot.h>\n#include \"sfsmisc.h\"\n#include \"arpc.h\"\n#include \"crypt.h\"\n#include <sys\/time.h>\n#include \"chord_util.h\"\n#ifdef DMALLOC\n#include \"dmalloc.h\"\n#endif\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ DHASH_STORE\n\/\/     - store a give block of data on a give nodeID.\n\/\/     - the address of the nodeID must already by in the location cache.\n\/\/     - XXX don't really handle RACE conditions..\n\nclass dhash_store {\nprotected:\n  uint npending;\n  bool error;\n  dhash_stat status;\n\n  chordID destID;\n  chordID predID;\n  net_address pred_addr;\n  chordID blockID;\n  ptr<dhash_block> block;\n  cbinsert_t cb;\n  dhash_ctype ctype;\n  store_status store_type;\n  ptr<vnode> clntnode;\n  int num_retries;\n  bool last;\n  int nextblock;\n  int numblocks;\n  vec<long> seqnos;\n\n  dhash_store (ptr<vnode> clntnode, chordID destID, chordID blockID, \n\t       ptr<dhash_block> _block, store_status store_type, \n\t       bool last, cbinsert_t cb)\n    : destID (destID), \n\t\t blockID (blockID), block (_block), cb (cb), \n\t\t ctype (block_type(_block)), \n\t\t store_type (store_type),\n\t\t clntnode (clntnode), num_retries (0), last (last)\n  {\n    start ();\n  }\n    \n  void start ()\n  {\n    error = false;\n    status = DHASH_OK;\n    npending = 0;\n    nextblock = 0;\n    numblocks = 0;\n    int blockno = 0;\n    \n    size_t nstored = 0;\n    while (nstored < block->len) {\n      size_t chunklen = MIN (MTU, block->len - nstored);\n      char  *chunkdat = &block->data[nstored];\n      size_t chunkoff = nstored;\n      npending++;\n      store (destID, blockID, chunkdat, chunklen, chunkoff, \n\t     block->len, blockno, ctype, store_type);\n      nstored += chunklen;\n      blockno++;\n    }\n    numblocks = blockno;\n  }\n\n  void finish (ptr<dhash_storeres> res, int num, clnt_stat err)\n  {\n    \/\/\/warn << \"dhash_store....finish: \" << npending << \"\\n\";\n    npending--;\n\n    if (err) {\n      error = true;\n      warn << \"dhash_store failed: \" << blockID << \": RPC error\" << \"\\n\";\n    } else if (res->status != DHASH_OK) {\n      if (res->status == DHASH_RETRY) {\n\tpredID = res->pred->p.x;\n\tpred_addr = res->pred->p.r;\n      } else if (res->status != DHASH_WAIT)\n        warn << \"dhash_store failed: \" << blockID << \": \"\n\t     << dhasherr2str(res->status) << \"\\n\";\n      if (!error)\n\tstatus = res->status;\n      error = true;\n    } else { \n      if ((num > nextblock) && (numblocks - num > 1)) {\n\twarn << \"(store) FAST retransmit: \" << blockID << \" got \" << num << \" chunk \" << nextblock << \" of \" << numblocks << \" being retransmitted\\n\";\n\tclntnode->resendRPC(seqnos[nextblock]);\n\t\/\/only one per fetch; finding more is too much bookkeeping\n\tnumblocks = -1;\n      }\n      nextblock++;\n    }\n\n    if (npending == 0) {\n      if (status == DHASH_RETRY) {\n\tclntnode->locations->cacheloc (predID, pred_addr, \n\t\t\t\t       wrap (this, \n\t\t\t\t\t     &dhash_store::retry_cachedloc));\n      } else {\n\t(*cb) (status, destID);\n\tdelete this;\n      }\n    }\n  }\n\n\n  void store (chordID destID, chordID blockID, char *data, size_t len,\n\t      size_t off, size_t totsz, int num, dhash_ctype ctype, \n\t      store_status store_type)\n  {\n    ref<dhash_storeres> res = New refcounted<dhash_storeres> (DHASH_OK);\n    ref<s_dhash_insertarg> arg = New refcounted<s_dhash_insertarg> ();\n    arg->v       = destID;\n    arg->key     = blockID;\n    arg->srcID   = clntnode->my_ID ();\n    arg->data.setsize (len);\n    memcpy (arg->data.base (), data, len);\n    arg->offset  = off;\n    arg->type    = store_type;\n    arg->attr.size     = totsz;\n    arg->last    = last;\n    \n    \n    long rexmitid = clntnode->doRPC (destID, dhash_program_1, DHASHPROC_STORE, arg, res,\n\t\t\t\t     wrap (this, &dhash_store::finish, res, num));\n    seqnos.push_back (rexmitid);\n  }\n  \n  void retry_cachedloc (chordID id, bool ok, chordstat stat) \n  {\n    if (!ok || stat) {\n      warn << \"challenge of \" << id << \" failed\\n\";\n      (*cb) (DHASH_CHORDERR, destID);\n      delete this;\n    } else {\n      num_retries++;\n      if (num_retries > 2) {\n\t(*cb)(DHASH_RETRY, destID);\n\tdelete this;\n      } else {\n\twarn << \"retrying(\" << num_retries << \"): dest was \" \n\t     << destID << \" now is \" << predID << \"\\n\";\n\tdestID = predID;\n\tstart ();\n      }\n    }\n  }\npublic:\n  \n  static void execute (ptr<vnode> clntnode, chordID destID, chordID blockID,\n                       ref<dhash_block> block, bool last, cbinsert_t cb, \n\t\t       store_status store_type = DHASH_STORE)\n  {\n    vNew dhash_store (clntnode, destID, blockID, block, store_type, last, cb);\n  }\n};\n\n\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ DHASHCLI\n\n \ndhashcli::dhashcli (ptr<vnode> node, dhash *dh, ptr<route_factory> r_factory,  bool do_cache) : \n  clntnode (node), \n  do_cache (do_cache),\n  dh (dh),\n  r_factory (r_factory)\n{\n  \n}\n\nvoid\ndhashcli::retrieve (chordID blockID, bool askforlease, \n\t\t       bool usecachedsucc, cbretrieve_t cb)\n\n{\n  \/\/\/warn << \"dhashcli::retrieve\\n\";\n\n  ref<route_dhash> iterator = New refcounted<route_dhash>(r_factory, \n\t\t\t\t\t\t\t  blockID,\n\t\t\t\t\t\t\t  dh,\n\t\t\t\t\t\t\t  askforlease,\n\t\t\t\t\t\t\t  usecachedsucc);\n  \n\n  iterator->execute (wrap (this, &dhashcli::retrieve_hop_cb, \n\t\t\t   cb, blockID));\n}\n\nvoid\ndhashcli::retrieve_hop_cb (cbretrieve_t cb, chordID key,\n\t\t\t   dhash_stat status, \n\t\t\t   ptr<dhash_block> blk, \n\t\t\t   route path) \n{\n  if (status) {\n    warn << \"iterator exiting w\/ status\\n\";\n    (*cb) (NULL);\n  } else {\n    cb (blk); \n    cache_block (blk, path, key);\n  }\n}\n\nvoid\ndhashcli::cache_block (ptr<dhash_block> block, route search_path, chordID key)\n{\n\n  if (block && do_cache && \n      (block_type (block) == DHASH_CONTENTHASH)) {\n    unsigned int path_size = search_path.size ();\n    if (path_size > 1) {\n      chordID cache_dest = search_path[path_size - 2];\n      dhash_store::execute (clntnode, cache_dest, key, block, false,\n\t\t\t    wrap (this, &dhashcli::finish_cache),\n\t\t\t    DHASH_CACHE);\n    }\n    \n  }\n}\n\nvoid\ndhashcli::finish_cache (dhash_stat status, chordID dest)\n{\n  if (status != DHASH_OK)\n    warn << \"error caching block\\n\";\n}\n\n\/\/use this version if you already know where the block is (and guessing\n\/\/ that you have the successor cached won't work)\nvoid\ndhashcli::retrieve (chordID source, chordID blockID, cbretrieve_t cb)\n{\n  ref<route_dhash> iterator = New refcounted<route_dhash>(r_factory, \n\t\t\t\t\t\t\t blockID, dh);\n\n  iterator->execute (wrap (this, &dhashcli::retrieve_with_source_cb, cb), \n\t\t     source);  \n}\n\nvoid\ndhashcli::retrieve_with_source_cb (cbretrieve_t cb, dhash_stat status, \n\t\t\t\t   ptr<dhash_block> block, route path)\n{\n  if (status) \n    (*cb) (NULL);\n  else \n    cb (block); \n}\n\nvoid\ndhashcli::insert (chordID blockID, ref<dhash_block> block, \n                  bool usecachedsucc, cbinsert_t cb)\n{\n  lookup (blockID, usecachedsucc, \n\t  wrap (this, &dhashcli::insert_lookup_cb,\n\t\tblockID, block, cb, 0));\n}\n\nvoid\ndhashcli::insert_lookup_cb (chordID blockID, ref<dhash_block> block,\n\t\t\t    cbinsert_t cb, int trial,\n\t\t\t    dhash_stat status, chordID destID)\n{\n  if (status != DHASH_OK) {\n    warn << \"insert_lookup_cb: failure\\n\";\n    (*cb) (status, bigint(0)); \/\/ failure\n  } else \n    dhash_store::execute (clntnode, destID, blockID, block, false, \n\t\t\t  wrap (this, &dhashcli::insert_stored_cb, \n\t\t\t\tblockID, block, cb, trial));\n}\n\nvoid\ndhashcli::insert_stored_cb (chordID blockID, ref<dhash_block> block,\n\t\t\t    cbinsert_t cb, int trial,\n\t\t\t    dhash_stat stat, chordID retID)\n{\n  if (stat && (trial <= 2)) {\n    \/\/try the lookup again if we got a RETRY\n    warn << \"got a RETRY failure. (\" << trial << \"Trying the lookup again\\n\";\n    lookup (blockID, false, \n\t    wrap (this, &dhashcli::insert_lookup_cb,\n\t\t  blockID, block, cb, trial + 1));\n  } else {\n    cb (stat, retID);\n  }\n}\n\/\/like insert, but doesn't do lookup. used by transfer_key\nvoid\ndhashcli::storeblock (chordID dest, chordID ID, ref<dhash_block> block, \n\t\t      bool last, cbinsert_t cb, store_status stat)\n{\n  dhash_store::execute (clntnode, dest, ID, block, last, cb, stat);\n}\n\n\nvoid\ndhashcli::lookup (chordID blockID, bool usecachedsucc, \n\t\t     dhashcli_lookupcb_t cb)\n{\n  \n  if (usecachedsucc) {\n    chordID x = clntnode->lookup_closestsucc (blockID);\n    (*cb) (DHASH_OK, x);\n  }\n  else\n    clntnode->find_successor (blockID,\n\t\t\t      wrap (this, &dhashcli::lookup_findsucc_cb,\n\t\t\t\t    blockID, cb));\n}\n\nvoid\ndhashcli::lookup_findsucc_cb (chordID blockID, dhashcli_lookupcb_t cb,\n\t\t\t      chordID succID, route path, chordstat err)\n{\n  if (err) \n    (*cb) (DHASH_CHORDERR, 0);\n  else\n    (*cb) (DHASH_OK, succID);\n}\n\n\n<commit_msg>no need to retry on dhash_wait msgs<commit_after>\/*\n *\n * Copyright (C) 2001  Frank Dabek (fdabek@lcs.mit.edu), \n *                     Frans Kaashoek (kaashoek@lcs.mit.edu),\n *   \t\t       Massachusetts Institute of Technology\n * \n *\n *  Permission is hereby granted, free of charge, to any person obtaining\n *  a copy of this software and associated documentation files (the\n *  \"Software\"), to deal in the Software without restriction, including\n *  without limitation the rights to use, copy, modify, merge, publish,\n *  distribute, sublicense, and\/or sell copies of the Software, and to\n *  permit persons to whom the Software is furnished to do so, subject to\n *  the following conditions:\n *\n *  The above copyright notice and this permission notice shall be\n *  included in all copies or substantial portions of the Software.\n *\n *  THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE\n *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\n *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION\n *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n *\n *\/\n\n#include <chord.h>\n#include <dhash.h>\n#include <chord_prot.h>\n#include \"sfsmisc.h\"\n#include \"arpc.h\"\n#include \"crypt.h\"\n#include <sys\/time.h>\n#include \"chord_util.h\"\n#ifdef DMALLOC\n#include \"dmalloc.h\"\n#endif\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ DHASH_STORE\n\/\/     - store a give block of data on a give nodeID.\n\/\/     - the address of the nodeID must already by in the location cache.\n\/\/     - XXX don't really handle RACE conditions..\n\nclass dhash_store {\nprotected:\n  uint npending;\n  bool error;\n  dhash_stat status;\n\n  chordID destID;\n  chordID predID;\n  net_address pred_addr;\n  chordID blockID;\n  ptr<dhash_block> block;\n  cbinsert_t cb;\n  dhash_ctype ctype;\n  store_status store_type;\n  ptr<vnode> clntnode;\n  int num_retries;\n  bool last;\n  int nextblock;\n  int numblocks;\n  vec<long> seqnos;\n\n  dhash_store (ptr<vnode> clntnode, chordID destID, chordID blockID, \n\t       ptr<dhash_block> _block, store_status store_type, \n\t       bool last, cbinsert_t cb)\n    : destID (destID), \n\t\t blockID (blockID), block (_block), cb (cb), \n\t\t ctype (block_type(_block)), \n\t\t store_type (store_type),\n\t\t clntnode (clntnode), num_retries (0), last (last)\n  {\n    start ();\n  }\n    \n  void start ()\n  {\n    error = false;\n    status = DHASH_OK;\n    npending = 0;\n    nextblock = 0;\n    numblocks = 0;\n    int blockno = 0;\n    \n    size_t nstored = 0;\n    while (nstored < block->len) {\n      size_t chunklen = MIN (MTU, block->len - nstored);\n      char  *chunkdat = &block->data[nstored];\n      size_t chunkoff = nstored;\n      npending++;\n      store (destID, blockID, chunkdat, chunklen, chunkoff, \n\t     block->len, blockno, ctype, store_type);\n      nstored += chunklen;\n      blockno++;\n    }\n    numblocks = blockno;\n  }\n\n  void finish (ptr<dhash_storeres> res, int num, clnt_stat err)\n  {\n    \/\/\/warn << \"dhash_store....finish: \" << npending << \"\\n\";\n    npending--;\n\n    if (err) {\n      error = true;\n      warn << \"dhash_store failed: \" << blockID << \": RPC error\" << \"\\n\";\n    } else if (res->status != DHASH_OK) {\n      if (res->status == DHASH_RETRY) {\n\tpredID = res->pred->p.x;\n\tpred_addr = res->pred->p.r;\n      } else if (res->status != DHASH_WAIT)\n        warn << \"dhash_store failed: \" << blockID << \": \"\n\t     << dhasherr2str(res->status) << \"\\n\";\n      if (!error)\n\tstatus = res->status;\n      error = true;\n    } else { \n      if ((num > nextblock) && (numblocks - num > 1)) {\n\twarn << \"(store) FAST retransmit: \" << blockID << \" got \" << num << \" chunk \" << nextblock << \" of \" << numblocks << \" being retransmitted\\n\";\n\tclntnode->resendRPC(seqnos[nextblock]);\n\t\/\/only one per fetch; finding more is too much bookkeeping\n\tnumblocks = -1;\n      }\n      nextblock++;\n    }\n\n    if (npending == 0) {\n      if (status == DHASH_RETRY) {\n\tclntnode->locations->cacheloc (predID, pred_addr, \n\t\t\t\t       wrap (this, \n\t\t\t\t\t     &dhash_store::retry_cachedloc));\n      } else {\n\t(*cb) (status, destID);\n\tdelete this;\n      }\n    }\n  }\n\n\n  void store (chordID destID, chordID blockID, char *data, size_t len,\n\t      size_t off, size_t totsz, int num, dhash_ctype ctype, \n\t      store_status store_type)\n  {\n    ref<dhash_storeres> res = New refcounted<dhash_storeres> (DHASH_OK);\n    ref<s_dhash_insertarg> arg = New refcounted<s_dhash_insertarg> ();\n    arg->v       = destID;\n    arg->key     = blockID;\n    arg->srcID   = clntnode->my_ID ();\n    arg->data.setsize (len);\n    memcpy (arg->data.base (), data, len);\n    arg->offset  = off;\n    arg->type    = store_type;\n    arg->attr.size     = totsz;\n    arg->last    = last;\n    \n    \n    long rexmitid = clntnode->doRPC (destID, dhash_program_1, DHASHPROC_STORE, arg, res,\n\t\t\t\t     wrap (this, &dhash_store::finish, res, num));\n    seqnos.push_back (rexmitid);\n  }\n  \n  void retry_cachedloc (chordID id, bool ok, chordstat stat) \n  {\n    if (!ok || stat) {\n      warn << \"challenge of \" << id << \" failed\\n\";\n      (*cb) (DHASH_CHORDERR, destID);\n      delete this;\n    } else {\n      num_retries++;\n      if (num_retries > 2) {\n\t(*cb)(DHASH_RETRY, destID);\n\tdelete this;\n      } else {\n\twarn << \"retrying(\" << num_retries << \"): dest was \" \n\t     << destID << \" now is \" << predID << \"\\n\";\n\tdestID = predID;\n\tstart ();\n      }\n    }\n  }\npublic:\n  \n  static void execute (ptr<vnode> clntnode, chordID destID, chordID blockID,\n                       ref<dhash_block> block, bool last, cbinsert_t cb, \n\t\t       store_status store_type = DHASH_STORE)\n  {\n    vNew dhash_store (clntnode, destID, blockID, block, store_type, last, cb);\n  }\n};\n\n\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ DHASHCLI\n\n \ndhashcli::dhashcli (ptr<vnode> node, dhash *dh, ptr<route_factory> r_factory,  bool do_cache) : \n  clntnode (node), \n  do_cache (do_cache),\n  dh (dh),\n  r_factory (r_factory)\n{\n  \n}\n\nvoid\ndhashcli::retrieve (chordID blockID, bool askforlease, \n\t\t       bool usecachedsucc, cbretrieve_t cb)\n\n{\n  \/\/\/warn << \"dhashcli::retrieve\\n\";\n\n  ref<route_dhash> iterator = New refcounted<route_dhash>(r_factory, \n\t\t\t\t\t\t\t  blockID,\n\t\t\t\t\t\t\t  dh,\n\t\t\t\t\t\t\t  askforlease,\n\t\t\t\t\t\t\t  usecachedsucc);\n  \n\n  iterator->execute (wrap (this, &dhashcli::retrieve_hop_cb, \n\t\t\t   cb, blockID));\n}\n\nvoid\ndhashcli::retrieve_hop_cb (cbretrieve_t cb, chordID key,\n\t\t\t   dhash_stat status, \n\t\t\t   ptr<dhash_block> blk, \n\t\t\t   route path) \n{\n  if (status) {\n    warn << \"iterator exiting w\/ status\\n\";\n    (*cb) (NULL);\n  } else {\n    cb (blk); \n    cache_block (blk, path, key);\n  }\n}\n\nvoid\ndhashcli::cache_block (ptr<dhash_block> block, route search_path, chordID key)\n{\n\n  if (block && do_cache && \n      (block_type (block) == DHASH_CONTENTHASH)) {\n    unsigned int path_size = search_path.size ();\n    if (path_size > 1) {\n      chordID cache_dest = search_path[path_size - 2];\n      dhash_store::execute (clntnode, cache_dest, key, block, false,\n\t\t\t    wrap (this, &dhashcli::finish_cache),\n\t\t\t    DHASH_CACHE);\n    }\n    \n  }\n}\n\nvoid\ndhashcli::finish_cache (dhash_stat status, chordID dest)\n{\n  if (status != DHASH_OK)\n    warn << \"error caching block\\n\";\n}\n\n\/\/use this version if you already know where the block is (and guessing\n\/\/ that you have the successor cached won't work)\nvoid\ndhashcli::retrieve (chordID source, chordID blockID, cbretrieve_t cb)\n{\n  ref<route_dhash> iterator = New refcounted<route_dhash>(r_factory, \n\t\t\t\t\t\t\t blockID, dh);\n\n  iterator->execute (wrap (this, &dhashcli::retrieve_with_source_cb, cb), \n\t\t     source);  \n}\n\nvoid\ndhashcli::retrieve_with_source_cb (cbretrieve_t cb, dhash_stat status, \n\t\t\t\t   ptr<dhash_block> block, route path)\n{\n  if (status) \n    (*cb) (NULL);\n  else \n    cb (block); \n}\n\nvoid\ndhashcli::insert (chordID blockID, ref<dhash_block> block, \n                  bool usecachedsucc, cbinsert_t cb)\n{\n  lookup (blockID, usecachedsucc, \n\t  wrap (this, &dhashcli::insert_lookup_cb,\n\t\tblockID, block, cb, 0));\n}\n\nvoid\ndhashcli::insert_lookup_cb (chordID blockID, ref<dhash_block> block,\n\t\t\t    cbinsert_t cb, int trial,\n\t\t\t    dhash_stat status, chordID destID)\n{\n  if (status != DHASH_OK) {\n    warn << \"insert_lookup_cb: failure\\n\";\n    (*cb) (status, bigint(0)); \/\/ failure\n  } else \n    dhash_store::execute (clntnode, destID, blockID, block, false, \n\t\t\t  wrap (this, &dhashcli::insert_stored_cb, \n\t\t\t\tblockID, block, cb, trial));\n}\n\nvoid\ndhashcli::insert_stored_cb (chordID blockID, ref<dhash_block> block,\n\t\t\t    cbinsert_t cb, int trial,\n\t\t\t    dhash_stat stat, chordID retID)\n{\n  if (stat && stat != DHASH_WAIT && (trial <= 2)) {\n    \/\/try the lookup again if we got a RETRY\n    warn << \"got a RETRY failure (\" << trial << \"). Trying the lookup again\\n\";\n    lookup (blockID, false, \n\t    wrap (this, &dhashcli::insert_lookup_cb,\n\t\t  blockID, block, cb, trial + 1));\n  } else {\n    cb (stat, retID);\n  }\n}\n\/\/like insert, but doesn't do lookup. used by transfer_key\nvoid\ndhashcli::storeblock (chordID dest, chordID ID, ref<dhash_block> block, \n\t\t      bool last, cbinsert_t cb, store_status stat)\n{\n  dhash_store::execute (clntnode, dest, ID, block, last, cb, stat);\n}\n\n\nvoid\ndhashcli::lookup (chordID blockID, bool usecachedsucc, \n\t\t     dhashcli_lookupcb_t cb)\n{\n  \n  if (usecachedsucc) {\n    chordID x = clntnode->lookup_closestsucc (blockID);\n    (*cb) (DHASH_OK, x);\n  }\n  else\n    clntnode->find_successor (blockID,\n\t\t\t      wrap (this, &dhashcli::lookup_findsucc_cb,\n\t\t\t\t    blockID, cb));\n}\n\nvoid\ndhashcli::lookup_findsucc_cb (chordID blockID, dhashcli_lookupcb_t cb,\n\t\t\t      chordID succID, route path, chordstat err)\n{\n  if (err) \n    (*cb) (DHASH_CHORDERR, 0);\n  else\n    (*cb) (DHASH_OK, succID);\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*!\n * \\file hyo_utilities_tests.cpp\n * \\author Robert 'Bob' Caddy (rvc@pitt.edu), Helena Richie (helenarichie@pitt.edu)\n * \\brief Tests for the contents of hydro_utilities.h and hydro_utilities.cpp\n *\n *\/\n\n\/\/ STL Includes\n#include <vector>\n#include <string>\n#include <iostream>\n\n\/\/ External Includes\n#include <gtest\/gtest.h>    \/\/ Include GoogleTest and related libraries\/headers\n\n\/\/ Local Includes\n#include \"..\/utils\/testing_utilities.h\"\n#include \"..\/utils\/hydro_utilities.h\"\n#include \"..\/global\/global.h\"\n\n\/\/ =============================================================================\n\/\/ Local helper functions\n\n\/*!\n* INDEX OF VARIABLES\n* p : pressure\n* vx, vy, vz : x, y, and z velocity\n* d : density\n* E : energy\n* T : temperature\n* px, py, pz : x, y, and z momentum\n* n : number density\n*\/\n\nnamespace\n{\n    struct TestParams\n    {\n        double gamma = 5.\/3.;\n        std::vector<double> d {1.0087201154e-100, 1.0756968986e2, 1.0882403847e100};\n        std::vector<double> vx {1.0378624601e-100, 1.0829278656e2, 1.0800514112e100};\n        std::vector<double> vy {1.0583469014e-100, 1.0283073464e2, 1.0725717864e100};\n        std::vector<double> vz {1.0182972216e-100, 1.0417748226e2, 1.0855352639e100};\n        std::vector<double> px {0.2340416681e-100, 0.1019429453e2, 0.5062596954e100};\n        std::vector<double> py {0.9924582299e-100, 0.1254780684e2, 0.5939640992e100};\n        std::vector<double> pz {0.6703192739e-100, 0.5676716066e2, 0.2115881803e100};\n        std::vector<double> E {20.9342082433e-90, 20.9976906577e10, 20.9487120853e310};\n        std::vector<double> p {2.2244082909e-100, 8.6772951021e2, 6.7261085663e100};\n        std::vector<std::string> names{\"Small number case\", \"Medium number case\", \"Large number case\"};\n    };\n}\n\nTEST(tHYDROSYSTEMHydroUtilsCalcPressurePrimitive, CorrectInputExpectCorrectOutput) {\n    TestParams parameters;\n    std::vector<double> fiducial_ps {1e-20, 139983415580.5549, 5};\n\n    for (size_t i = 0; i < parameters.names.size(); i++)\n    {\n        Real test_ps = hydro_utilities::Calc_Pressure_Primitive(parameters.E.at(i), parameters.d.at(i), parameters.vx.at(i), parameters.vy.at(i), parameters.vz.at(i), parameters.gamma);\n\n        testingUtilities::checkResults(fiducial_ps.at(i), test_ps, parameters.names.at(i));\n    }\n}\n\nTEST(tHYDROSYSTEMHydroUtilsCalcPressureConserved, CorrectInputExpectCorrectOutput) {\n    TestParams parameters;\n    std::vector<double> fiducial_ps {1e-20, 5979.1942892288798, 6.1692060819306795e+101};\n\n    for (size_t i = 0; i < parameters.names.size(); i++)\n    {\n        Real test_ps = hydro_utilities::Calc_Pressure_Conserved(parameters.E.at(i), parameters.d.at(i), parameters.px.at(i), parameters.py.at(i), parameters.pz.at(i), parameters.gamma);\n\n        testingUtilities::checkResults(fiducial_ps.at(i), test_ps, parameters.names.at(i));\n    }\n}<commit_msg>add hydro utility function testing<commit_after>\/*!\n * \\file hyo_utilities_tests.cpp\n * \\author Robert 'Bob' Caddy (rvc@pitt.edu), Helena Richie (helenarichie@pitt.edu)\n * \\brief Tests for the contents of hydro_utilities.h and hydro_utilities.cpp\n *\n *\/\n\n\/\/ STL Includes\n#include <vector>\n#include <string>\n#include <iostream>\n\n\/\/ External Includes\n#include <gtest\/gtest.h>    \/\/ Include GoogleTest and related libraries\/headers\n\n\/\/ Local Includes\n#include \"..\/utils\/testing_utilities.h\"\n#include \"..\/utils\/hydro_utilities.h\"\n#include \"..\/global\/global.h\"\n\n\/\/ =============================================================================\n\/\/ Local helper functions\n\n\/*!\n* INDEX OF VARIABLES\n* p : pressure\n* vx, vy, vz : x, y, and z velocity\n* d : density\n* E : energy\n* T : temperature\n* px, py, pz : x, y, and z momentum\n* n : number density\n*\/\n\nnamespace\n{\n    struct TestParams\n    {\n        double gamma = 5.\/3.;\n        std::vector<double> d {1.0087201154e-100, 1.0756968986e2, 1.0882403847e100};\n        std::vector<double> vx {1.0378624601e-100, 1.0829278656e2, 1.0800514112e100};\n        std::vector<double> vy {1.0583469014e-100, 1.0283073464e2, 1.0725717864e100};\n        std::vector<double> vz {1.0182972216e-100, 1.0417748226e2, 1.0855352639e100};\n        std::vector<double> px {0.2340416681e-100, 0.1019429453e2, 0.5062596954e100};\n        std::vector<double> py {0.9924582299e-100, 0.1254780684e2, 0.5939640992e100};\n        std::vector<double> pz {0.6703192739e-100, 0.5676716066e2, 0.2115881803e100};\n        std::vector<double> E {20.9342082433e-90, 20.9976906577e10, 20.9487120853e300};\n        std::vector<double> p {2.2244082909e-100, 8.6772951021e2, 6.7261085663e100};\n        std::vector<std::string> names{\"Small number case\", \"Medium number case\", \"Large number case\"};\n    };\n}\n\nTEST(tHYDROSYSTEMHydroUtilsCalcPressurePrimitive, CorrectInputExpectCorrectOutput) {\n    TestParams parameters;\n    std::vector<double> fiducial_ps {1e-20, 139983415580.5549, 5};\n\n    for (size_t i = 0; i < parameters.names.size(); i++)\n    {\n        Real test_ps = hydro_utilities::Calc_Pressure_Primitive(parameters.E.at(i), parameters.d.at(i), parameters.vx.at(i), parameters.vy.at(i), parameters.vz.at(i), parameters.gamma);\n\n        testingUtilities::checkResults(fiducial_ps.at(i), test_ps, parameters.names.at(i));\n    }\n}\n\nTEST(tHYDROSYSTEMHydroUtilsCalcPressureConserved, CorrectInputExpectCorrectOutput) {\n    TestParams parameters;\n    std::vector<double> fiducial_ps {1e-20, 5979.1942892288798, 6.1692060819306795e+101};\n\n    for (size_t i = 0; i < parameters.names.size(); i++)\n    {\n        Real test_ps = hydro_utilities::Calc_Pressure_Conserved(parameters.E.at(i), parameters.d.at(i), parameters.px.at(i), parameters.py.at(i), parameters.pz.at(i), parameters.gamma);\n\n        testingUtilities::checkResults(fiducial_ps.at(i), test_ps, parameters.names.at(i));\n    }\n}<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n*       SOFA, Simulation Open-Framework Architecture, development version     *\n*                (c) 2006-2016 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 <SofaTest\/Mapping_test.h>\n#include <SofaMiscMapping\/SquareDistanceMapping.h>\n\n\nnamespace sofa {\nnamespace {\n\n\n\/**  Test suite for SquareDistanceMapping.\n *\n * @author Matthieu Nesme\n  *\/\ntemplate <typename SquareDistanceMapping>\nstruct SquareDistanceMappingTest : public Mapping_test<SquareDistanceMapping>\n{\n    typedef typename SquareDistanceMapping::In InDataTypes;\n    typedef typename InDataTypes::VecCoord InVecCoord;\n    typedef typename InDataTypes::Coord InCoord;\n\n    typedef typename SquareDistanceMapping::Out OutDataTypes;\n    typedef typename OutDataTypes::VecCoord OutVecCoord;\n    typedef typename OutDataTypes::Coord OutCoord;\n\n\n    bool test()\n    {\n        SquareDistanceMapping* map = static_cast<SquareDistanceMapping*>( this->mapping );\n        map->f_computeDistance.setValue(true);\n        map->d_geometricStiffness.setValue(1);\n\n        component::topology::EdgeSetTopologyContainer::SPtr edges = modeling::addNew<component::topology::EdgeSetTopologyContainer>(this->root);\n        edges->addEdge( 0, 1 );\n\n        \/\/ parent positions\n        InVecCoord incoord(2);\n        InDataTypes::set( incoord[0], 0,0,0 );\n        InDataTypes::set( incoord[1], 1,1,1 );\n\n        \/\/ expected child positions\n        OutVecCoord expectedoutcoord;\n        expectedoutcoord.push_back( defaulttype::Vector1( 3 ) );\n\n        return this->runTest( incoord, expectedoutcoord );\n    }\n\n};\n\n\n\/\/ Define the list of types to instanciate.\nusing testing::Types;\ntypedef Types<\ncomponent::mapping::SquareDistanceMapping<defaulttype::Vec3Types,defaulttype::Vec1Types>\n, component::mapping::SquareDistanceMapping<defaulttype::Rigid3Types,defaulttype::Vec1Types>\n> DataTypes; \/\/ the types to instanciate.\n\n\/\/ Test suite for all the instanciations\nTYPED_TEST_CASE( SquareDistanceMappingTest, DataTypes );\n\n\/\/ test case\nTYPED_TEST( SquareDistanceMappingTest , test )\n{\n    ASSERT_TRUE(this->test());\n}\n\n} \/\/ namespace\n} \/\/ namespace sofa\n<commit_msg>improving squaredistancemapping test a bit<commit_after>\/******************************************************************************\n*       SOFA, Simulation Open-Framework Architecture, development version     *\n*                (c) 2006-2016 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 <SofaTest\/Mapping_test.h>\n#include <SofaMiscMapping\/SquareDistanceMapping.h>\n\n\nnamespace sofa {\nnamespace {\n\n\n\/**  Test suite for SquareDistanceMapping.\n *\n * @author Matthieu Nesme\n  *\/\ntemplate <typename SquareDistanceMapping>\nstruct SquareDistanceMappingTest : public Mapping_test<SquareDistanceMapping>\n{\n    typedef typename SquareDistanceMapping::In InDataTypes;\n    typedef typename InDataTypes::VecCoord InVecCoord;\n    typedef typename InDataTypes::Coord InCoord;\n\n    typedef typename SquareDistanceMapping::Out OutDataTypes;\n    typedef typename OutDataTypes::VecCoord OutVecCoord;\n    typedef typename OutDataTypes::Coord OutCoord;\n\n\n    bool test()\n    {\n        SquareDistanceMapping* map = static_cast<SquareDistanceMapping*>( this->mapping );\n        map->f_computeDistance.setValue(true);\n        map->d_geometricStiffness.setValue(1);\n\n        component::topology::EdgeSetTopologyContainer::SPtr edges = modeling::addNew<component::topology::EdgeSetTopologyContainer>(this->root);\n        edges->addEdge( 0, 1 );\n        edges->addEdge( 2, 1 );\n\n        \/\/ parent positions\n        InVecCoord incoord(3);\n        InDataTypes::set( incoord[0], 0,0,0 );\n        InDataTypes::set( incoord[1], 1,1,1 );\n        InDataTypes::set( incoord[2], 6,3,-1 );\n\n        \/\/ expected child positions\n        OutVecCoord expectedoutcoord;\n        expectedoutcoord.push_back( defaulttype::Vector1( 3 ) );\n        expectedoutcoord.push_back( defaulttype::Vector1( 33 ) );\n\n        return this->runTest( incoord, expectedoutcoord );\n    }\n\n};\n\n\n\/\/ Define the list of types to instanciate.\nusing testing::Types;\ntypedef Types<\ncomponent::mapping::SquareDistanceMapping<defaulttype::Vec3Types,defaulttype::Vec1Types>\n, component::mapping::SquareDistanceMapping<defaulttype::Rigid3Types,defaulttype::Vec1Types>\n> DataTypes; \/\/ the types to instanciate.\n\n\/\/ Test suite for all the instanciations\nTYPED_TEST_CASE( SquareDistanceMappingTest, DataTypes );\n\n\/\/ test case\nTYPED_TEST( SquareDistanceMappingTest , test )\n{\n    ASSERT_TRUE(this->test());\n}\n\n} \/\/ namespace\n} \/\/ namespace sofa\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#include <windows.h>\n\n#include \"webrtc\/modules\/desktop_capture\/desktop_frame_win.h\"\n#include \"webrtc\/system_wrappers\/interface\/logging.h\"\n#include \"webrtc\/system_wrappers\/interface\/scoped_ptr.h\"\n\nnamespace webrtc {\n\nnamespace {\n\ntypedef HRESULT (WINAPI *DwmIsCompositionEnabledFunc)(BOOL* enabled);\n\n\/\/ Coverts a zero-terminated UTF-16 string to UTF-8. Returns an empty string if\n\/\/ error occurs.\nstd::string Utf16ToUtf8(const WCHAR* str) {\n  int len_utf8 = WideCharToMultiByte(CP_UTF8, 0, str, -1,\n                                     NULL, 0, NULL, NULL);\n  if (len_utf8 <= 0)\n    return std::string();\n  std::string result(len_utf8, '\\0');\n  int rv = WideCharToMultiByte(CP_UTF8, 0, str, -1,\n                               &*(result.begin()), len_utf8, NULL, NULL);\n  if (rv != len_utf8)\n    assert(false);\n\n  return result;\n}\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  GetClassName(hwnd, class_name, kClassLength);\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  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 = Utf16ToUtf8(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  virtual bool GetWindowList(WindowList* windows) OVERRIDE;\n  virtual bool SelectWindow(WindowId id) OVERRIDE;\n\n  \/\/ DesktopCapturer interface.\n  virtual void Start(Callback* callback) OVERRIDE;\n  virtual void Capture(const DesktopRegion& region) OVERRIDE;\n\n private:\n  bool IsAeroEnabled();\n\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  \/\/ dwmapi.dll is used to determine if desktop compositing is enabled.\n  HMODULE dwmapi_library_;\n  DwmIsCompositionEnabledFunc is_composition_enabled_func_;\n\n  DesktopSize previous_size_;\n\n  DISALLOW_COPY_AND_ASSIGN(WindowCapturerWin);\n};\n\nWindowCapturerWin::WindowCapturerWin()\n    : callback_(NULL),\n      window_(NULL) {\n  \/\/ Try to load dwmapi.dll dynamically since it is not available on XP.\n  dwmapi_library_ = LoadLibrary(L\"dwmapi.dll\");\n  if (dwmapi_library_) {\n    is_composition_enabled_func_ =\n        reinterpret_cast<DwmIsCompositionEnabledFunc>(\n            GetProcAddress(dwmapi_library_, \"DwmIsCompositionEnabled\"));\n    assert(is_composition_enabled_func_);\n  } else {\n    is_composition_enabled_func_ = NULL;\n  }\n}\n\nWindowCapturerWin::~WindowCapturerWin() {\n  if (dwmapi_library_)\n    FreeLibrary(dwmapi_library_);\n}\n\nbool WindowCapturerWin::IsAeroEnabled() {\n  BOOL result = FALSE;\n  if (is_composition_enabled_func_)\n    is_composition_enabled_func_(&result);\n  return result != FALSE;\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\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 minimized or hidden.\n  if (IsIconic(window_) || !IsWindowVisible(window_)) {\n    callback_->OnCaptureCompleted(NULL);\n    return;\n  }\n\n  RECT rect;\n  if (!GetWindowRect(window_, &rect)) {\n    LOG(LS_WARNING) << \"Failed to get window size: \" << 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  scoped_ptr<DesktopFrameWin> frame(DesktopFrameWin::Create(\n      DesktopSize(rect.right - rect.left, rect.bottom - rect.top),\n      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  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 - it somehow affects what we\n  \/\/ get from BitBlt() on the subsequent captures.\n\n  if (!IsAeroEnabled() ||\n      (!previous_size_.is_empty() && !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, 0, 0, SRCCOPY);\n  }\n\n  SelectObject(mem_dc, NULL);\n  DeleteDC(mem_dc);\n  ReleaseDC(window_, window_dc);\n\n  previous_size_ = 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>Fix WindowCapturerWin to unselect bitmap before destroying DC.<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#include <windows.h>\n\n#include \"webrtc\/modules\/desktop_capture\/desktop_frame_win.h\"\n#include \"webrtc\/system_wrappers\/interface\/logging.h\"\n#include \"webrtc\/system_wrappers\/interface\/scoped_ptr.h\"\n\nnamespace webrtc {\n\nnamespace {\n\ntypedef HRESULT (WINAPI *DwmIsCompositionEnabledFunc)(BOOL* enabled);\n\n\/\/ Coverts a zero-terminated UTF-16 string to UTF-8. Returns an empty string if\n\/\/ error occurs.\nstd::string Utf16ToUtf8(const WCHAR* str) {\n  int len_utf8 = WideCharToMultiByte(CP_UTF8, 0, str, -1,\n                                     NULL, 0, NULL, NULL);\n  if (len_utf8 <= 0)\n    return std::string();\n  std::string result(len_utf8, '\\0');\n  int rv = WideCharToMultiByte(CP_UTF8, 0, str, -1,\n                               &*(result.begin()), len_utf8, NULL, NULL);\n  if (rv != len_utf8)\n    assert(false);\n\n  return result;\n}\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  GetClassName(hwnd, class_name, kClassLength);\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  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 = Utf16ToUtf8(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  virtual bool GetWindowList(WindowList* windows) OVERRIDE;\n  virtual bool SelectWindow(WindowId id) OVERRIDE;\n\n  \/\/ DesktopCapturer interface.\n  virtual void Start(Callback* callback) OVERRIDE;\n  virtual void Capture(const DesktopRegion& region) OVERRIDE;\n\n private:\n  bool IsAeroEnabled();\n\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  \/\/ dwmapi.dll is used to determine if desktop compositing is enabled.\n  HMODULE dwmapi_library_;\n  DwmIsCompositionEnabledFunc is_composition_enabled_func_;\n\n  DesktopSize previous_size_;\n\n  DISALLOW_COPY_AND_ASSIGN(WindowCapturerWin);\n};\n\nWindowCapturerWin::WindowCapturerWin()\n    : callback_(NULL),\n      window_(NULL) {\n  \/\/ Try to load dwmapi.dll dynamically since it is not available on XP.\n  dwmapi_library_ = LoadLibrary(L\"dwmapi.dll\");\n  if (dwmapi_library_) {\n    is_composition_enabled_func_ =\n        reinterpret_cast<DwmIsCompositionEnabledFunc>(\n            GetProcAddress(dwmapi_library_, \"DwmIsCompositionEnabled\"));\n    assert(is_composition_enabled_func_);\n  } else {\n    is_composition_enabled_func_ = NULL;\n  }\n}\n\nWindowCapturerWin::~WindowCapturerWin() {\n  if (dwmapi_library_)\n    FreeLibrary(dwmapi_library_);\n}\n\nbool WindowCapturerWin::IsAeroEnabled() {\n  BOOL result = FALSE;\n  if (is_composition_enabled_func_)\n    is_composition_enabled_func_(&result);\n  return result != FALSE;\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\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 minimized or hidden.\n  if (IsIconic(window_) || !IsWindowVisible(window_)) {\n    callback_->OnCaptureCompleted(NULL);\n    return;\n  }\n\n  RECT rect;\n  if (!GetWindowRect(window_, &rect)) {\n    LOG(LS_WARNING) << \"Failed to get window size: \" << 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  scoped_ptr<DesktopFrameWin> frame(DesktopFrameWin::Create(\n      DesktopSize(rect.right - rect.left, rect.bottom - rect.top),\n      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 - it somehow affects what we\n  \/\/ get from BitBlt() on the subsequent captures.\n\n  if (!IsAeroEnabled() ||\n      (!previous_size_.is_empty() && !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, 0, 0, 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  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>\/*\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 <iterator>\n#include <list>\n#include <set>\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::list<uint16_t> sequence_numbers_;\n};\n\nclass NackLoopBackTransport : public webrtc::Transport {\n public:\n  NackLoopBackTransport(uint32_t rtx_ssrc)\n    : count_(0),\n      packet_loss_(0),\n      consecutive_drop_start_(0),\n      consecutive_drop_end_(0),\n      rtx_ssrc_(rtx_ssrc),\n      count_rtx_ssrc_(0),\n      module_(NULL) {\n  }\n  void SetSendModule(RtpRtcp* rtpRtcpModule) {\n    module_ = rtpRtcpModule;\n  }\n  void DropEveryNthPacket(int n) {\n    packet_loss_ = n;\n    consecutive_drop_start_ = 0;\n    consecutive_drop_end_ = 0;\n  }\n  void DropConsecutivePackets(int start, int total) {\n    consecutive_drop_start_ = start;\n    consecutive_drop_end_ = start + total;\n    packet_loss_ = 0;\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    uint16_t sequence_number = (ptr[2] << 8) + ptr[3];\n    expected_sequence_numbers_.insert(expected_sequence_numbers_.end(),\n                                      sequence_number);\n\n    if (packet_loss_ > 0) {\n      if ((count_ % packet_loss_) == 0) {\n        return len;\n      }\n    } else if (count_ >= consecutive_drop_start_ &&\n        count_ < consecutive_drop_end_) {\n      return len;\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  int consecutive_drop_start_;\n  int consecutive_drop_end_;\n  uint32_t rtx_ssrc_;\n  int count_rtx_ssrc_;\n  RtpRtcp* module_;\n  std::set<uint16_t> expected_sequence_numbers_;\n};\n\nclass RtpRtcpNackTest : public ::testing::Test {\n protected:\n  RtpRtcpNackTest()\n      : video_module_(NULL),\n        transport_(NULL),\n        nack_receiver_(NULL),\n        payload_data_length(sizeof(payload_data)),\n        fake_clock(123456) {}\n  ~RtpRtcpNackTest() {}\n\n  virtual void SetUp() {\n    transport_ = new NackLoopBackTransport(kTestSsrc + 1);\n    nack_receiver_ = new VerifyingNackReceiver();\n\n    RtpRtcp::Configuration configuration;\n    configuration.id = kTestId;\n    configuration.audio = false;\n    configuration.clock = &fake_clock;\n    configuration.incoming_data = nack_receiver_;\n    configuration.outgoing_transport = transport_;\n    video_module_ = RtpRtcp::CreateRtpRtcp(configuration);\n\n    EXPECT_EQ(0, video_module_->SetRTCPStatus(kRtcpCompound));\n    EXPECT_EQ(0, video_module_->SetSSRC(kTestSsrc));\n    EXPECT_EQ(0, video_module_->SetNACKStatus(kNackRtcp, 450));\n    EXPECT_EQ(0, video_module_->SetStorePacketsStatus(true, 600));\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_->SetSendModule(video_module_);\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    for (int n = 0; n < payload_data_length; n++) {\n      payload_data[n] = n % 10;\n    }\n  }\n\n  virtual void TearDown() {\n    delete video_module_;\n    delete transport_;\n    delete nack_receiver_;\n  }\n\n  int BuildNackList(uint16_t* nack_list) const {\n    nack_receiver_->sequence_numbers_.sort();\n\n    std::list<uint16_t> missing_sequence_numbers;\n    std::list<uint16_t>::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    return n;\n  }\n\n  bool ExpectedPacketsReceived() {\n    std::list<uint16_t> received_sorted;\n    std::copy(nack_receiver_->sequence_numbers_.begin(),\n              nack_receiver_->sequence_numbers_.end(),\n              std::back_inserter(received_sorted));\n    received_sorted.sort();\n    return std::equal(received_sorted.begin(), received_sorted.end(),\n                      transport_->expected_sequence_numbers_.begin());\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  SimulatedClock fake_clock;\n};\n\nTEST_F(RtpRtcpNackTest, RTCP) {\n  WebRtc_UWord32 timestamp = 3000;\n  uint16_t 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                                                timestamp \/ 90,\n                                                payload_data,\n                                                payload_data_length));\n\n    int length = BuildNackList(nack_list);\n    video_module_->SendNACK(nack_list, length);\n    fake_clock.AdvanceTimeMilliseconds(33);\n    video_module_->Process();\n\n    \/\/ Prepare next frame.\n    timestamp += 3000;\n  }\n  nack_receiver_->sequence_numbers_.sort();\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, LongNackList) {\n  const int kNumPacketsToDrop = 900;\n  const int kNumFrames = 30;\n  const int kNumRequiredRtcp = 4;\n  WebRtc_UWord32 timestamp = 3000;\n  uint16_t nack_list[kNumPacketsToDrop];\n  \/\/ Disable StorePackets to be able to set a larger packet history.\n  EXPECT_EQ(0, video_module_->SetStorePacketsStatus(false, 0));\n  \/\/ Enable StorePackets with a packet history of 2000 packets.\n  EXPECT_EQ(0, video_module_->SetStorePacketsStatus(true, 2000));\n  \/\/ Drop 900 packets from the second one so that we get a NACK list which is\n  \/\/ big enough to require 4 RTCP packets to be fully transmitted to the sender.\n  transport_->DropConsecutivePackets(2, kNumPacketsToDrop);\n  \/\/ Send 30 frames which at the default size is roughly what we need to get\n  \/\/ enough packets.\n  for (int frame = 0; frame < kNumFrames; ++frame) {\n    EXPECT_EQ(0, video_module_->SendOutgoingData(webrtc::kVideoFrameDelta, 123,\n                                                 timestamp,\n                                                 timestamp \/ 90,\n                                                 payload_data,\n                                                 payload_data_length));\n    \/\/ Prepare next frame.\n    timestamp += 3000;\n    fake_clock.AdvanceTimeMilliseconds(33);\n    video_module_->Process();\n  }\n  EXPECT_FALSE(transport_->expected_sequence_numbers_.empty());\n  EXPECT_FALSE(nack_receiver_->sequence_numbers_.empty());\n  size_t last_receive_count = nack_receiver_->sequence_numbers_.size();\n  int length = BuildNackList(nack_list);\n  for (int i = 0; i < kNumRequiredRtcp - 1; ++i) {\n    video_module_->SendNACK(nack_list, length);\n    EXPECT_GT(nack_receiver_->sequence_numbers_.size(), last_receive_count);\n    last_receive_count = nack_receiver_->sequence_numbers_.size();\n    EXPECT_FALSE(ExpectedPacketsReceived());\n  }\n  video_module_->SendNACK(nack_list, length);\n  EXPECT_GT(nack_receiver_->sequence_numbers_.size(), last_receive_count);\n  EXPECT_TRUE(ExpectedPacketsReceived());\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,\n                                                 123,\n                                                 timestamp,\n                                                 timestamp \/ 90,\n                                                 payload_data,\n                                                 payload_data_length));\n\n    nack_receiver_->sequence_numbers_.sort();\n\n    std::list<WebRtc_UWord16> missing_sequence_numbers;\n\n\n    std::list<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.AdvanceTimeMilliseconds(33);\n    video_module_->Process();\n\n    \/\/ Prepare next frame.\n    timestamp += 3000;\n  }\n  nack_receiver_->sequence_numbers_.sort();\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<commit_msg>Fix for build error on android introduced with r3609.<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 <iterator>\n#include <list>\n#include <set>\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    bool already_received = std::find(\n        sequence_numbers_.begin(), sequence_numbers_.end(),\n        rtp_header->header.sequenceNumber) != sequence_numbers_.end();\n    EXPECT_FALSE(already_received);\n    sequence_numbers_.push_back(rtp_header->header.sequenceNumber);\n    return 0;\n  }\n  std::list<uint16_t> sequence_numbers_;\n};\n\nclass NackLoopBackTransport : public webrtc::Transport {\n public:\n  NackLoopBackTransport(uint32_t rtx_ssrc)\n    : count_(0),\n      packet_loss_(0),\n      consecutive_drop_start_(0),\n      consecutive_drop_end_(0),\n      rtx_ssrc_(rtx_ssrc),\n      count_rtx_ssrc_(0),\n      module_(NULL) {\n  }\n  void SetSendModule(RtpRtcp* rtpRtcpModule) {\n    module_ = rtpRtcpModule;\n  }\n  void DropEveryNthPacket(int n) {\n    packet_loss_ = n;\n    consecutive_drop_start_ = 0;\n    consecutive_drop_end_ = 0;\n  }\n  void DropConsecutivePackets(int start, int total) {\n    consecutive_drop_start_ = start;\n    consecutive_drop_end_ = start + total;\n    packet_loss_ = 0;\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    uint16_t sequence_number = (ptr[2] << 8) + ptr[3];\n    expected_sequence_numbers_.insert(expected_sequence_numbers_.end(),\n                                      sequence_number);\n\n    if (packet_loss_ > 0) {\n      if ((count_ % packet_loss_) == 0) {\n        return len;\n      }\n    } else if (count_ >= consecutive_drop_start_ &&\n        count_ < consecutive_drop_end_) {\n      return len;\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  int consecutive_drop_start_;\n  int consecutive_drop_end_;\n  uint32_t rtx_ssrc_;\n  int count_rtx_ssrc_;\n  RtpRtcp* module_;\n  std::set<uint16_t> expected_sequence_numbers_;\n};\n\nclass RtpRtcpNackTest : public ::testing::Test {\n protected:\n  RtpRtcpNackTest()\n      : video_module_(NULL),\n        transport_(NULL),\n        nack_receiver_(NULL),\n        payload_data_length(sizeof(payload_data)),\n        fake_clock(123456) {}\n  ~RtpRtcpNackTest() {}\n\n  virtual void SetUp() {\n    transport_ = new NackLoopBackTransport(kTestSsrc + 1);\n    nack_receiver_ = new VerifyingNackReceiver();\n\n    RtpRtcp::Configuration configuration;\n    configuration.id = kTestId;\n    configuration.audio = false;\n    configuration.clock = &fake_clock;\n    configuration.incoming_data = nack_receiver_;\n    configuration.outgoing_transport = transport_;\n    video_module_ = RtpRtcp::CreateRtpRtcp(configuration);\n\n    EXPECT_EQ(0, video_module_->SetRTCPStatus(kRtcpCompound));\n    EXPECT_EQ(0, video_module_->SetSSRC(kTestSsrc));\n    EXPECT_EQ(0, video_module_->SetNACKStatus(kNackRtcp, 450));\n    EXPECT_EQ(0, video_module_->SetStorePacketsStatus(true, 600));\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_->SetSendModule(video_module_);\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    for (int n = 0; n < payload_data_length; n++) {\n      payload_data[n] = n % 10;\n    }\n  }\n\n  virtual void TearDown() {\n    delete video_module_;\n    delete transport_;\n    delete nack_receiver_;\n  }\n\n  int BuildNackList(uint16_t* nack_list) const {\n    nack_receiver_->sequence_numbers_.sort();\n\n    std::list<uint16_t> missing_sequence_numbers;\n    std::list<uint16_t>::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    return n;\n  }\n\n  bool ExpectedPacketsReceived() {\n    std::list<uint16_t> received_sorted;\n    std::copy(nack_receiver_->sequence_numbers_.begin(),\n              nack_receiver_->sequence_numbers_.end(),\n              std::back_inserter(received_sorted));\n    received_sorted.sort();\n    return std::equal(received_sorted.begin(), received_sorted.end(),\n                      transport_->expected_sequence_numbers_.begin());\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  SimulatedClock fake_clock;\n};\n\nTEST_F(RtpRtcpNackTest, RTCP) {\n  WebRtc_UWord32 timestamp = 3000;\n  uint16_t 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                                                timestamp \/ 90,\n                                                payload_data,\n                                                payload_data_length));\n\n    int length = BuildNackList(nack_list);\n    video_module_->SendNACK(nack_list, length);\n    fake_clock.AdvanceTimeMilliseconds(33);\n    video_module_->Process();\n\n    \/\/ Prepare next frame.\n    timestamp += 3000;\n  }\n  nack_receiver_->sequence_numbers_.sort();\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, LongNackList) {\n  const int kNumPacketsToDrop = 900;\n  const int kNumFrames = 30;\n  const int kNumRequiredRtcp = 4;\n  WebRtc_UWord32 timestamp = 3000;\n  uint16_t nack_list[kNumPacketsToDrop];\n  \/\/ Disable StorePackets to be able to set a larger packet history.\n  EXPECT_EQ(0, video_module_->SetStorePacketsStatus(false, 0));\n  \/\/ Enable StorePackets with a packet history of 2000 packets.\n  EXPECT_EQ(0, video_module_->SetStorePacketsStatus(true, 2000));\n  \/\/ Drop 900 packets from the second one so that we get a NACK list which is\n  \/\/ big enough to require 4 RTCP packets to be fully transmitted to the sender.\n  transport_->DropConsecutivePackets(2, kNumPacketsToDrop);\n  \/\/ Send 30 frames which at the default size is roughly what we need to get\n  \/\/ enough packets.\n  for (int frame = 0; frame < kNumFrames; ++frame) {\n    EXPECT_EQ(0, video_module_->SendOutgoingData(webrtc::kVideoFrameDelta, 123,\n                                                 timestamp,\n                                                 timestamp \/ 90,\n                                                 payload_data,\n                                                 payload_data_length));\n    \/\/ Prepare next frame.\n    timestamp += 3000;\n    fake_clock.AdvanceTimeMilliseconds(33);\n    video_module_->Process();\n  }\n  EXPECT_FALSE(transport_->expected_sequence_numbers_.empty());\n  EXPECT_FALSE(nack_receiver_->sequence_numbers_.empty());\n  size_t last_receive_count = nack_receiver_->sequence_numbers_.size();\n  int length = BuildNackList(nack_list);\n  for (int i = 0; i < kNumRequiredRtcp - 1; ++i) {\n    video_module_->SendNACK(nack_list, length);\n    EXPECT_GT(nack_receiver_->sequence_numbers_.size(), last_receive_count);\n    last_receive_count = nack_receiver_->sequence_numbers_.size();\n    EXPECT_FALSE(ExpectedPacketsReceived());\n  }\n  video_module_->SendNACK(nack_list, length);\n  EXPECT_GT(nack_receiver_->sequence_numbers_.size(), last_receive_count);\n  EXPECT_TRUE(ExpectedPacketsReceived());\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,\n                                                 123,\n                                                 timestamp,\n                                                 timestamp \/ 90,\n                                                 payload_data,\n                                                 payload_data_length));\n\n    nack_receiver_->sequence_numbers_.sort();\n\n    std::list<WebRtc_UWord16> missing_sequence_numbers;\n\n\n    std::list<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.AdvanceTimeMilliseconds(33);\n    video_module_->Process();\n\n    \/\/ Prepare next frame.\n    timestamp += 3000;\n  }\n  nack_receiver_->sequence_numbers_.sort();\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>\/* -------------------------------------------------------------------------- *\n *                       OpenSim:  MarkersReference.cpp                       *\n * -------------------------------------------------------------------------- *\n * The OpenSim API is a toolkit for musculoskeletal modeling and simulation.  *\n * See http:\/\/opensim.stanford.edu and the NOTICE file for more information.  *\n * OpenSim is developed at Stanford University and supported by the US        *\n * National Institutes of Health (U54 GM072970, R24 HD065690) and by DARPA    *\n * through the Warrior Web program.                                           *\n *                                                                            *\n * Copyright (c) 2005-2017 Stanford University and the Authors                *\n * Author(s): Ajay Seth                                                       *\n *                                                                            *\n * Licensed under the Apache License, Version 2.0 (the \"License\"); you may    *\n * not use this file except in compliance with the License. You may obtain a  *\n * copy of the License at http:\/\/www.apache.org\/licenses\/LICENSE-2.0.         *\n *                                                                            *\n * Unless required by applicable law or agreed to in writing, software        *\n * distributed under the License is distributed on an \"AS IS\" BASIS,          *\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.   *\n * See the License for the specific language governing permissions and        *\n * limitations under the License.                                             *\n * -------------------------------------------------------------------------- *\/\n\n#include \"MarkersReference.h\"\n#include <SimTKcommon\/internal\/State.h>\n#include <cmath>\n\nusing namespace std;\nusing namespace SimTK;\n\nnamespace OpenSim {\n\nMarkersReference::MarkersReference() :\n    Reference_<SimTK::Vec3>() {\n    constructProperties();\n    setAuthors(\"Ajay Seth\");\n}\n\nMarkersReference::MarkersReference(const std::string& markerFile,\n                                   Units modelUnits) :\n    MarkersReference() {\n    loadMarkersFile(markerFile, modelUnits);\n}\n\nMarkersReference::\nMarkersReference(const TimeSeriesTable_<SimTK::Vec3>& markerTable,\n                 const Set<MarkerWeight>* markerWeightSet,\n                 Units units) :\n    MarkersReference() {\n    _markerTable = markerTable;\n    if(markerWeightSet != nullptr)\n        upd_marker_weights() = *markerWeightSet;\n    populateFromMarkerData(markerTable, units.getAbbreviation());\n}\n\nvoid MarkersReference::loadMarkersFile(const std::string markerFile,\n                                       Units modelUnits) {\n    auto fileExt = FileAdapter::findExtension(markerFile);\n    OPENSIM_THROW_IF(!(fileExt == \"sto\" || fileExt == \"trc\"),\n                     UnsupportedFileType,\n                     markerFile,\n                     \"Supported file types are -- STO, TRC.\");\n\n    if(fileExt == \"trc\") {\n        _markerTable = TimeSeriesTableVec3{markerFile};\n    } else {\n        try {\n            _markerTable = (TimeSeriesTable{markerFile}).pack<SimTK::Vec3>();\n        } catch(const IncorrectTableType&) {\n            _markerTable = TimeSeriesTable_<SimTK::Vec3>{markerFile};\n        }\n    }\n\n    upd_marker_file() = markerFile;\n\n    populateFromMarkerData(_markerTable, modelUnits.getAbbreviation());\n}\n\nvoid\nMarkersReference::\npopulateFromMarkerData(const TimeSeriesTable_<SimTK::Vec3>& markerTable,\n                       const std::string& units) {\n    Units thisUnits{};\n    if(_markerTable.hasTableMetaDataKey(\"Units\"))\n        thisUnits = Units{_markerTable.getTableMetaData<std::string>(\"Units\")};\n    else\n        thisUnits = Units{Units::Meters};\n\n    double scaleFactor = thisUnits.convertTo(Units{units});\n\n    OPENSIM_THROW_IF(SimTK::isNaN(scaleFactor),\n                     Exception,\n                     \"TimeSeriesTable has unspecified units.\");\n\n    if(std::fabs(scaleFactor - 1) >= SimTK::Eps) {\n        for(unsigned r = 0; r < _markerTable.getNumRows(); ++r)\n            _markerTable.updRowAtIndex(r) *= scaleFactor;\n\n        _markerTable.removeTableMetaDataKey(\"Units\");\n        _markerTable.addTableMetaData(\"Units\", units);\n    }\n    \n    const auto& markerNames = markerTable.getColumnLabels();\n    _markerNames.clear();\n    _weights.clear();\n    _markerNames.assign(static_cast<unsigned>(markerNames.size()), \"\");\n    _weights.assign(static_cast<unsigned>(markerNames.size()),\n                    get_default_weight());\n\n    for(unsigned i = 0; i < markerNames.size(); ++i) {\n        _markerNames[i] = markerNames[i];\n    }\n\n    \/\/ Names must be assigned before weights can be updated\n    updateInternalWeights();\n}\n\nSimTK::Vec2 MarkersReference::getValidTimeRange() const {\n    OPENSIM_THROW_IF(_markerTable.getNumRows() == 0,\n                     Exception,\n                     \"Marker-table is empty.\");\n\n    return {_markerTable.getIndependentColumn().front(),\n            _markerTable.getIndependentColumn().back()};\n}\n\nvoid MarkersReference::constructProperties() {\n    constructProperty_marker_file(\"\");\n    Set<MarkerWeight> markerWeights;\n    constructProperty_marker_weights(markerWeights);\n    constructProperty_default_weight(1.0);\n}\n\nconst SimTK::Array_<std::string>& MarkersReference::getNames() const {\n    return _markerNames;\n}\n\nvoid  MarkersReference::getValues(const SimTK::State& s,\n                                  SimTK::Array_<Vec3>& values) const {\n    double time = s.getTime();\n    const auto rowView = _markerTable.getNearestRow(time);\n    values.clear();\n    for(int i = 0; i < rowView.ncol(); ++i)\n        values.push_back(rowView[i]);\n}\n\n\/\/ void\n\/\/ MarkersReference::getSpeedValues(const SimTK::State &s,\n\/\/                                  SimTK::Array_<Vec3> &speedValues) const {\n\/\/     throw Exception(\"MarkersReference: getSpeedValues not implemented.\");\n\/\/ }\n\/\/ \n\/\/ void\n\/\/ MarkersReference::getAccelerationValues(const SimTK::State &s,\n\/\/                                         SimTK::Array_<Vec3> &accValues) const {\n\/\/     throw Exception(\"MarkersReference: getAccelerationValues not implemented.\");\n\/\/ }\n\nvoid MarkersReference::getWeights(const SimTK::State &s,\n                                  SimTK::Array_<double> &weights) const {\n    updateInternalWeights();\n    weights = _weights;\n}\n\nconst TimeSeriesTable_<SimTK::Vec3>& MarkersReference::getMarkerTable() const {\n    return _markerTable;\n}\n\nvoid\nMarkersReference::setMarkerWeightSet(const Set<MarkerWeight>& markerWeights) {\n    upd_marker_weights() = markerWeights;\n}\n\nvoid\nMarkersReference::setDefaultWeight(double weight) {\n    set_default_weight(weight);\n}\n\nvoid\nMarkersReference::updateInternalWeights() const {\n    \/\/ if weights are not being changed, do not rebuild list of weights.\n    if (isObjectUpToDateWithProperties())\n        return;\n\n    \/\/ Begin by assigning default weight to each. Markers that do not have a\n    \/\/ weight specified in the marker_weights property use the default weight.\n    _weights.assign(getNumRefs(), get_default_weight());\n\n    \/\/ Next fill in the marker weights that were specified in the\n    \/\/ marker_weights property\n    int wix = -1;\n    int ix = 0;\n    \/\/ Build flat lists of marker weights in the same order as the marker names\n    for (const std::string &name : _markerNames) {\n        wix = get_marker_weights().getIndex(name, wix);\n        \/\/ Associate user weights (as specified in the marker_weights property)\n        \/\/ with the corresponding marker by order of marker names\n        if (wix >= 0)\n            _weights[ix] = get_marker_weights()[wix].getWeight();\n        ++ix;\n    }\n}\n\nint\nMarkersReference::getNumRefs() const {\n    return static_cast<int>(_markerTable.getNumColumns());\n}\n\ndouble\nMarkersReference::getSamplingFrequency() const {\n    if(_markerTable.hasTableMetaDataKey(\"DataRate\")) {\n        auto datarate = _markerTable.getTableMetaData<std::string>(\"DataRate\");\n        return std::stod(datarate);\n    } else\n        return SimTK::NaN;\n}\n\nsize_t\nMarkersReference::getNumFrames() const {\n    return _markerTable.getNumRows();\n}\n\n} \/\/ end of namespace OpenSim\n<commit_msg>Remove extra space<commit_after>\/* -------------------------------------------------------------------------- *\n *                       OpenSim:  MarkersReference.cpp                       *\n * -------------------------------------------------------------------------- *\n * The OpenSim API is a toolkit for musculoskeletal modeling and simulation.  *\n * See http:\/\/opensim.stanford.edu and the NOTICE file for more information.  *\n * OpenSim is developed at Stanford University and supported by the US        *\n * National Institutes of Health (U54 GM072970, R24 HD065690) and by DARPA    *\n * through the Warrior Web program.                                           *\n *                                                                            *\n * Copyright (c) 2005-2017 Stanford University and the Authors                *\n * Author(s): Ajay Seth                                                       *\n *                                                                            *\n * Licensed under the Apache License, Version 2.0 (the \"License\"); you may    *\n * not use this file except in compliance with the License. You may obtain a  *\n * copy of the License at http:\/\/www.apache.org\/licenses\/LICENSE-2.0.         *\n *                                                                            *\n * Unless required by applicable law or agreed to in writing, software        *\n * distributed under the License is distributed on an \"AS IS\" BASIS,          *\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.   *\n * See the License for the specific language governing permissions and        *\n * limitations under the License.                                             *\n * -------------------------------------------------------------------------- *\/\n\n#include \"MarkersReference.h\"\n#include <SimTKcommon\/internal\/State.h>\n#include <cmath>\n\nusing namespace std;\nusing namespace SimTK;\n\nnamespace OpenSim {\n\nMarkersReference::MarkersReference() :\n    Reference_<SimTK::Vec3>() {\n    constructProperties();\n    setAuthors(\"Ajay Seth\");\n}\n\nMarkersReference::MarkersReference(const std::string& markerFile,\n                                   Units modelUnits) :\n    MarkersReference() {\n    loadMarkersFile(markerFile, modelUnits);\n}\n\nMarkersReference::\nMarkersReference(const TimeSeriesTable_<SimTK::Vec3>& markerTable,\n                 const Set<MarkerWeight>* markerWeightSet,\n                 Units units) :\n    MarkersReference() {\n    _markerTable = markerTable;\n    if(markerWeightSet != nullptr)\n        upd_marker_weights() = *markerWeightSet;\n    populateFromMarkerData(markerTable, units.getAbbreviation());\n}\n\nvoid MarkersReference::loadMarkersFile(const std::string markerFile,\n                                       Units modelUnits) {\n    auto fileExt = FileAdapter::findExtension(markerFile);\n    OPENSIM_THROW_IF(!(fileExt == \"sto\" || fileExt == \"trc\"),\n                     UnsupportedFileType,\n                     markerFile,\n                     \"Supported file types are -- STO, TRC.\");\n\n    if(fileExt == \"trc\") {\n        _markerTable = TimeSeriesTableVec3{markerFile};\n    } else {\n        try {\n            _markerTable = (TimeSeriesTable{markerFile}).pack<SimTK::Vec3>();\n        } catch(const IncorrectTableType&) {\n            _markerTable = TimeSeriesTable_<SimTK::Vec3>{markerFile};\n        }\n    }\n\n    upd_marker_file() = markerFile;\n\n    populateFromMarkerData(_markerTable, modelUnits.getAbbreviation());\n}\n\nvoid\nMarkersReference::\npopulateFromMarkerData(const TimeSeriesTable_<SimTK::Vec3>& markerTable,\n                       const std::string& units) {\n    Units thisUnits{};\n    if(_markerTable.hasTableMetaDataKey(\"Units\"))\n        thisUnits = Units{_markerTable.getTableMetaData<std::string>(\"Units\")};\n    else\n        thisUnits = Units{Units::Meters};\n\n    double scaleFactor = thisUnits.convertTo(Units{units});\n\n    OPENSIM_THROW_IF(SimTK::isNaN(scaleFactor),\n                     Exception,\n                     \"TimeSeriesTable has unspecified units.\");\n\n    if(std::fabs(scaleFactor - 1) >= SimTK::Eps) {\n        for(unsigned r = 0; r < _markerTable.getNumRows(); ++r)\n            _markerTable.updRowAtIndex(r) *= scaleFactor;\n\n        _markerTable.removeTableMetaDataKey(\"Units\");\n        _markerTable.addTableMetaData(\"Units\", units);\n    }\n    \n    const auto& markerNames = markerTable.getColumnLabels();\n    _markerNames.clear();\n    _weights.clear();\n    _markerNames.assign(static_cast<unsigned>(markerNames.size()), \"\");\n    _weights.assign(static_cast<unsigned>(markerNames.size()),\n                    get_default_weight());\n\n    for(unsigned i = 0; i < markerNames.size(); ++i) {\n        _markerNames[i] = markerNames[i];\n    }\n\n    \/\/ Names must be assigned before weights can be updated\n    updateInternalWeights();\n}\n\nSimTK::Vec2 MarkersReference::getValidTimeRange() const {\n    OPENSIM_THROW_IF(_markerTable.getNumRows() == 0,\n                     Exception,\n                     \"Marker-table is empty.\");\n\n    return {_markerTable.getIndependentColumn().front(),\n            _markerTable.getIndependentColumn().back()};\n}\n\nvoid MarkersReference::constructProperties() {\n    constructProperty_marker_file(\"\");\n    Set<MarkerWeight> markerWeights;\n    constructProperty_marker_weights(markerWeights);\n    constructProperty_default_weight(1.0);\n}\n\nconst SimTK::Array_<std::string>& MarkersReference::getNames() const {\n    return _markerNames;\n}\n\nvoid MarkersReference::getValues(const SimTK::State& s,\n                                  SimTK::Array_<Vec3>& values) const {\n    double time = s.getTime();\n    const auto rowView = _markerTable.getNearestRow(time);\n    values.clear();\n    for(int i = 0; i < rowView.ncol(); ++i)\n        values.push_back(rowView[i]);\n}\n\n\/\/ void\n\/\/ MarkersReference::getSpeedValues(const SimTK::State &s,\n\/\/                                  SimTK::Array_<Vec3> &speedValues) const {\n\/\/     throw Exception(\"MarkersReference: getSpeedValues not implemented.\");\n\/\/ }\n\/\/ \n\/\/ void\n\/\/ MarkersReference::getAccelerationValues(const SimTK::State &s,\n\/\/                                         SimTK::Array_<Vec3> &accValues) const {\n\/\/     throw Exception(\"MarkersReference: getAccelerationValues not implemented.\");\n\/\/ }\n\nvoid MarkersReference::getWeights(const SimTK::State &s,\n                                  SimTK::Array_<double> &weights) const {\n    updateInternalWeights();\n    weights = _weights;\n}\n\nconst TimeSeriesTable_<SimTK::Vec3>& MarkersReference::getMarkerTable() const {\n    return _markerTable;\n}\n\nvoid\nMarkersReference::setMarkerWeightSet(const Set<MarkerWeight>& markerWeights) {\n    upd_marker_weights() = markerWeights;\n}\n\nvoid\nMarkersReference::setDefaultWeight(double weight) {\n    set_default_weight(weight);\n}\n\nvoid\nMarkersReference::updateInternalWeights() const {\n    \/\/ if weights are not being changed, do not rebuild list of weights.\n    if (isObjectUpToDateWithProperties())\n        return;\n\n    \/\/ Begin by assigning default weight to each. Markers that do not have a\n    \/\/ weight specified in the marker_weights property use the default weight.\n    _weights.assign(getNumRefs(), get_default_weight());\n\n    \/\/ Next fill in the marker weights that were specified in the\n    \/\/ marker_weights property\n    int wix = -1;\n    int ix = 0;\n    \/\/ Build flat lists of marker weights in the same order as the marker names\n    for (const std::string &name : _markerNames) {\n        wix = get_marker_weights().getIndex(name, wix);\n        \/\/ Associate user weights (as specified in the marker_weights property)\n        \/\/ with the corresponding marker by order of marker names\n        if (wix >= 0)\n            _weights[ix] = get_marker_weights()[wix].getWeight();\n        ++ix;\n    }\n}\n\nint\nMarkersReference::getNumRefs() const {\n    return static_cast<int>(_markerTable.getNumColumns());\n}\n\ndouble\nMarkersReference::getSamplingFrequency() const {\n    if(_markerTable.hasTableMetaDataKey(\"DataRate\")) {\n        auto datarate = _markerTable.getTableMetaData<std::string>(\"DataRate\");\n        return std::stod(datarate);\n    } else\n        return SimTK::NaN;\n}\n\nsize_t\nMarkersReference::getNumFrames() const {\n    return _markerTable.getNumRows();\n}\n\n} \/\/ end of namespace OpenSim\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 \"xenia\/common.h\"\n#include \"xenia\/kernel\/kernel_state.h\"\n#include \"xenia\/kernel\/util\/shim_utils.h\"\n#include \"xenia\/kernel\/xboxkrnl_private.h\"\n#include \"xenia\/xbox.h\"\n\nnamespace xe {\nnamespace kernel {\n\nSHIM_CALL XUsbcamCreate_shim(PPCContext* ppc_state, KernelState* state) {\n  uint32_t unk1 = SHIM_GET_ARG_32(0);\n  uint32_t unk2 = SHIM_GET_ARG_32(1);\n\n  XELOGD(\"XUsbcamCreate(%.8X, %.8X)\", unk1, unk2);\n\n  SHIM_SET_RETURN_32(-1);\n}\n\n}  \/\/ namespace kernel\n}  \/\/ namespace xe\n\nvoid xe::kernel::xboxkrnl::RegisterUsbcamExports(\n    ExportResolver* export_resolver, KernelState* state) {\n  SHIM_SET_MAPPING(\"xboxkrnl.exe\", XUsbcamCreate, state);\n}\n<commit_msg>XUsbcamGetState stub.<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 \"xenia\/common.h\"\n#include \"xenia\/kernel\/kernel_state.h\"\n#include \"xenia\/kernel\/util\/shim_utils.h\"\n#include \"xenia\/kernel\/xboxkrnl_private.h\"\n#include \"xenia\/xbox.h\"\n\nnamespace xe {\nnamespace kernel {\n\nSHIM_CALL XUsbcamCreate_shim(PPCContext* ppc_state, KernelState* state) {\n  uint32_t unk1 = SHIM_GET_ARG_32(0);  \/\/ E\n  uint32_t unk2 = SHIM_GET_ARG_32(1);  \/\/ 0x4B000\n  uint32_t unk3_ptr = SHIM_GET_ARG_32(3);\n\n  XELOGD(\"XUsbcamCreate(%.8X, %.8X, %.8X)\", unk1, unk2, unk3_ptr);\n\n  \/\/ 0 = success.\n  SHIM_SET_RETURN_32(X_ERROR_DEVICE_NOT_CONNECTED);\n}\n\nSHIM_CALL XUsbcamGetState_shim(PPCContext* ppc_state, KernelState* state) {\n  XELOGD(\"XUsbcamGetState()\");\n  \/\/ 0 = not connected.\n  SHIM_SET_RETURN_32(0);\n}\n\n}  \/\/ namespace kernel\n}  \/\/ namespace xe\n\nvoid xe::kernel::xboxkrnl::RegisterUsbcamExports(\n    ExportResolver* export_resolver, KernelState* state) {\n  SHIM_SET_MAPPING(\"xboxkrnl.exe\", XUsbcamCreate, state);\n  SHIM_SET_MAPPING(\"xboxkrnl.exe\", XUsbcamGetState, state);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*  \n\tCfgHints.cpp\n\n\tCopyright 2016 Jan Babor\n\n\tLicensed under the Apache License, Version 2.0 (the \"License\");\n\tyou may not use this file except in compliance with the License.\n\tYou may obtain a copy of the License at\n\n\t\thttp:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n\tUnless required by applicable law or agreed to in writing, software\n\tdistributed under the License is distributed on an \"AS IS\" BASIS,\n\tWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\tSee the License for the specific language governing permissions and\n\tlimitations under the License.\n*\/\nclass ExAd\n{\n\tdisplayName = \"ExAd Virtual Garage\";\n\t\/\/#include \"VirtualGarage\\CfgHints.cpp\"\n};\n<commit_msg>Delete CfgHints.cpp<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>fix the code for BG fluc<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>Possibility to select trigger particle for kPyCharm and kPyBeauty<commit_after><|endoftext|>"}
{"text":"<commit_before>#ifndef STAN_MATH_PRIM_MAT_FUN_TYPEDEFS_HPP\n#define STAN_MATH_PRIM_MAT_FUN_TYPEDEFS_HPP\n\n#include <stan\/math\/prim\/mat\/fun\/Eigen.hpp>\n#include <stan\/math\/prim\/mat\/meta\/index_type.hpp>\n\nnamespace stan {\nnamespace math {\n\n\/**\n * Type for sizes and indexes in an Eigen matrix with double e\n *\/\ntypedef index_type<Eigen::Matrix<double, Eigen::Dynamic, Eigen::Dynamic> >::type\n    size_type;\n\n\/**\n * Type for matrix of double values.\n *\/\ntypedef Eigen::Matrix<double, Eigen::Dynamic, Eigen::Dynamic> matrix_d;\n\n\/**\n * Type for (column) vector of double values.\n *\/\ntypedef Eigen::Matrix<double, Eigen::Dynamic, 1> vector_d;\n\n\/**\n * Type for (row) vector of double values.\n *\/\ntypedef Eigen::Matrix<double, 1, Eigen::Dynamic> row_vector_d;\n\n}  \/\/ namespace math\n}  \/\/ namespace stan\n\n#endif\n<commit_msg>meta include<commit_after>#ifndef STAN_MATH_PRIM_MAT_FUN_TYPEDEFS_HPP\n#define STAN_MATH_PRIM_MAT_FUN_TYPEDEFS_HPP\n\n#include <stan\/math\/prim\/meta.hpp>\n#include <stan\/math\/prim\/mat\/fun\/Eigen.hpp>\n\nnamespace stan {\nnamespace math {\n\n\/**\n * Type for sizes and indexes in an Eigen matrix with double e\n *\/\ntypedef index_type<Eigen::Matrix<double, Eigen::Dynamic, Eigen::Dynamic> >::type\n    size_type;\n\n\/**\n * Type for matrix of double values.\n *\/\ntypedef Eigen::Matrix<double, Eigen::Dynamic, Eigen::Dynamic> matrix_d;\n\n\/**\n * Type for (column) vector of double values.\n *\/\ntypedef Eigen::Matrix<double, Eigen::Dynamic, 1> vector_d;\n\n\/**\n * Type for (row) vector of double values.\n *\/\ntypedef Eigen::Matrix<double, 1, Eigen::Dynamic> row_vector_d;\n\n}  \/\/ namespace math\n}  \/\/ namespace stan\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/ tbb_queues - very basic test of TBB's queue collections\n\/\/\n\/\/ Copyright (c) 2013 by Ben Morgan <bmorgan.warwick@gmail.com> \n\/\/ Copyright (c) 2013 by The University of Warwick\n\/\/\n\/\/ Standard Library\n#include <iostream>\n\n\/\/ Third Party\n\/\/ - TBB\n#include <tbb\/tbb.h>\n#include <tbb\/concurrent_queue.h>\n\ntypedef tbb::concurrent_bounded_queue<int> MPQueue;\n\n\/\/ This Project\nclass MyProducer {\n public:\n  MyProducer(MPQueue& q) : outBox_(q) {;}\n\n  void operator()(size_t howMany) {\n    for(size_t i(0); i < howMany; ++i) {\n      std::cout << \"Enqueuing workitem : \" << i << std::endl;\n      outBox_.push(i);\n      std::cout << \"Queued it!\" << std::endl;\n    }\n  }\n\n private:\n  MPQueue& outBox_;\n};\n\nclass MyConsumer {\n public:\n  MyConsumer(MPQueue& q, size_t sleep) : inBox_(q), sleepFor_(sleep) {;}\n\n  void operator()() {\n    int workItem;\n    while (!inBox_.empty()) {\n      inBox_.pop(workItem);\n      std::cout << \"[\"<<this<<\":\"<<sleepFor_<<\"] Got workitem : \" << workItem << std::endl;\n      sleep(sleepFor_);\n    }\n  }\n private:\n  MPQueue& inBox_;\n  size_t sleepFor_;\n};\n\n\nint main(int argc, char *argv[]) {\n  MPQueue inQueue;\n  inQueue.set_capacity(10);\n  MyProducer p(inQueue);\n  MyConsumer c_a(inQueue,5);\n  MyConsumer c_b(inQueue,1);\n\n  tbb::tbb_thread producer(p,100);\n  tbb::tbb_thread consumer_a(c_a);\n  tbb::tbb_thread consumer_b(c_b);\n\n  producer.join();\n  consumer_a.join();\n  consumer_b.join();\n  return 0;\n}\n\n<commit_msg>Improve, but not solve, queue syncronization<commit_after>\/\/ tbb_queues - very basic test of TBB's queue collections\n\/\/\n\/\/ Copyright (c) 2013 by Ben Morgan <bmorgan.warwick@gmail.com>\n\/\/ Copyright (c) 2013 by The University of Warwick\n\/\/\n\/\/ Standard Library\n#include <iostream>\n\n\/\/ Third Party\n\/\/ - TBB\n#include <tbb\/tbb.h>\n#include <tbb\/concurrent_queue.h>\n\ntypedef tbb::concurrent_bounded_queue<int> MPQueue;\n\nstruct WorkItem {\n  bool kill;\n  int value;\n};\n\n\/\/ This Project\nclass MyProducer {\n public:\n  MyProducer(MPQueue& q) : outBox_(q) {;}\n\n  void operator()(size_t howMany) {\n    for(size_t i(0); i < howMany; ++i) {\n      std::cout << \"Enqueuing workitem : \" << i << std::endl;\n      outBox_.push(i);\n      std::cout << \"Queued it!\" << std::endl;\n    }\n  }\n\n private:\n  MPQueue& outBox_;\n};\n\nclass MyConsumer {\n public:\n  MyConsumer(MPQueue& q, size_t sleep) : inBox_(q), sleepFor_(sleep), processed_(0) {;}\n\n  ~MyConsumer() {\n    std::cout << \"[\"<<this<<\":\"<<\"processed]:\" <<processed_<<std::endl;\n  }\n\n  void operator()() {\n    int workItem;\n    \/\/ do-while ensures that :\n    \/\/ i) with concurrent bounded queue, pop waits until it has something\n    \/\/ ii) terminate when queue becomes empty\n    \/\/ NB: now have opposite issue, in that can wait for ever if nothing\n    \/\/ is pushed onto queue!\n    \/\/ Basically, if number of items to be processed is less than\n    \/\/ the number of consumers, Cn - Ni consumers will block.\n    do {\n      inBox_.pop(workItem);\n      std::cout << \"[\"<<this<<\":\"<<sleepFor_<<\"] Got workitem : \" << workItem << std::endl;\n      sleep(sleepFor_);\n      ++processed_;\n    } while (!inBox_.empty());\n  }\n private:\n  MPQueue& inBox_;\n  size_t sleepFor_;\n  size_t processed_;\n};\n\n\nint main(int argc, char *argv[]) {\n  MPQueue inQueue;\n  inQueue.set_capacity(10);\n\n  MyProducer p(inQueue);\n  tbb::tbb_thread producer(p,1);\n\n  MyConsumer c_a(inQueue,1);\n  MyConsumer c_b(inQueue,5);\n\n  tbb::tbb_thread consumer_b(c_b);\n  tbb::tbb_thread consumer_a(c_a);\n\n  producer.join();\n  consumer_a.join();\n  consumer_b.join();\n  return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"Globals.h\"  \/\/ NOTE: MSVC stupidness requires this to be the same across all modules\n\n#include \"Squid.h\"\n#include \"..\/Vector3d.h\"\n#include \"..\/Chunk.h\"\n\n\n\n\n\ncSquid::cSquid(void) :\n\tsuper(\"Squid\", 94, \"\", \"\", 0.95, 0.95)\n{\n}\n\n\n\n\n\nvoid cSquid::GetDrops(cItems & a_Drops, cEntity * a_Killer)\n{\n\t\/\/ Drops 0-3 Ink Sacs\n\tAddRandomDropItem(a_Drops, 0, 3, E_ITEM_DYE, E_META_DYE_BLACK);\n}\n\n\n\n\n\nvoid cSquid::Tick(float a_Dt, cChunk & a_Chunk)\n{\n\t\/\/ We must first process current location, and only then tick, otherwise we risk processing a location in a chunk\n\t\/\/ that is not where the entity currently resides (FS #411)\n\t\n\tVector3d Pos = GetPosition();\n\n\t\/\/ TODO: Not a real behavior, but cool :D\n\tint RelX = (int)floor(Pos.x) - a_Chunk.GetPosX() * cChunkDef::Width;\n\tint RelZ = (int)floor(Pos.z) - a_Chunk.GetPosZ() * cChunkDef::Width;\n\tif (!IsBlockWater(a_Chunk.GetBlock(RelX, (int)floor(Pos.y), RelZ)) && !IsOnFire())\n\t{\n\t\t\/\/ Burn for 10 ticks, then decide again\n\t\tStartBurning(10);\n\t}\n\n\tsuper::Tick(a_Dt, a_Chunk);\n}\n\n\n\n\n<commit_msg>Fixed squid crashing the server when above or below the world<commit_after>\n#include \"Globals.h\"  \/\/ NOTE: MSVC stupidness requires this to be the same across all modules\n\n#include \"Squid.h\"\n#include \"..\/Vector3d.h\"\n#include \"..\/Chunk.h\"\n\n\n\n\n\ncSquid::cSquid(void) :\n\tsuper(\"Squid\", 94, \"\", \"\", 0.95, 0.95)\n{\n}\n\n\n\n\n\nvoid cSquid::GetDrops(cItems & a_Drops, cEntity * a_Killer)\n{\n\t\/\/ Drops 0-3 Ink Sacs\n\tAddRandomDropItem(a_Drops, 0, 3, E_ITEM_DYE, E_META_DYE_BLACK);\n}\n\n\n\n\n\nvoid cSquid::Tick(float a_Dt, cChunk & a_Chunk)\n{\n\t\/\/ We must first process current location, and only then tick, otherwise we risk processing a location in a chunk\n\t\/\/ that is not where the entity currently resides (FS #411)\n\t\n\tVector3d Pos = GetPosition();\n\n\t\/\/ TODO: Not a real behavior, but cool :D\n\tint RelY = (int)floor(Pos.y);\n\tif ((RelY < 0) || (RelY >= cChunkDef::Height))\n\t{\n\t\treturn;\n\t}\n\tint RelX = (int)floor(Pos.x) - a_Chunk.GetPosX() * cChunkDef::Width;\n\tint RelZ = (int)floor(Pos.z) - a_Chunk.GetPosZ() * cChunkDef::Width;\n\tif (!IsBlockWater(a_Chunk.GetBlock(RelX, RelY, RelZ)) && !IsOnFire())\n\t{\n\t\t\/\/ Burn for 10 ticks, then decide again\n\t\tStartBurning(10);\n\t}\n\n\tsuper::Tick(a_Dt, a_Chunk);\n}\n\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* # ODrive Communication Protocol #\n*\n* Communicating with an ODrive consists of a series of endpoint operations.\n* operations. An endpoint is usually a single number or string.\n* The available endpoints can be enumerated by reading the JSON from endpoint 0\n* and can theoretically be different for each channel (they are not in practice).\n*\n* Each endpoint operation can send bytes to one endpoint (referenced by it's ID)\n* and at the same time receive bytes from the same endpoint. The semantics of\n* these payloads are specific to each endpoint's type, the name of which is\n* indicated in the JSON.\n*\n* For instance an int32 endpoint's input and output is a 4 byte little endian\n* representation. In general the convention for combined read\/write requests is\n* _exchange_, i.e. the returned value is the old value. Custom endpoint handlers\n* may be non-compliant.\n*\n* ## Stream format: ##\n* (For instance UART)\n*\n*   1. sync-byte\n*   2. packet-length (0-127, larger values are reserved)\n*   3. crc8(sync-byte + packet-length)\n*   4. packet\n*\n* ## Packet format: ##\n* (For instance USB)\n*\n* __Request__\n*\n*   1. seq-no, MSB = 0\n*   2. endpoint-id, MSB = \"expect ack\"\n*   3. expected_response_size\n*   4. payload (contains offset if required)\n*   5. crc16(seq-no + endpoint-id + payload + crc16(protocol_version + JSON))\n*      For endpoint 0 the JSON-CRC is not included\n*\n* __Response__\n*\n*   1. seq-no, MSB = 1\n*   2. payload\n*   3. crc16(seq-no + payload + protocol_version)\n*\n*\/\n\n\n#ifndef __PROTOCOL_HPP\n#define __PROTOCOL_HPP\n\n\/\/ TODO: resolve assert\n#define assert(expr)\n\n#include <functional>\n#include <limits>\n#include <cstring>\n#include \"crc.hpp\"\n\n\nconstexpr uint8_t SYNC_BYTE = '$';\nconstexpr uint8_t CRC8_INIT = 0;\nconstexpr uint16_t CRC16_INIT = 0;\nconstexpr uint16_t PROTOCOL_VERSION = 1;\nconstexpr uint16_t TX_BUF_SIZE = 64;\n\n\ntemplate<typename T>\ninline size_t write_le(T value, uint8_t* buffer);\n\ntemplate<typename T>\ninline size_t read_le(T& value, const uint8_t* buffer);\n\ntemplate<>\ninline size_t write_le<uint16_t>(uint16_t value, uint8_t* buffer) {\n    buffer[0] = (value >> 0) & 0xff;\n    buffer[1] = (value >> 8) & 0xff;\n    return 2;\n}\n\ntemplate<>\ninline size_t write_le<uint32_t>(uint32_t value, uint8_t* buffer) {\n    buffer[0] = (value >> 0) & 0xff;\n    buffer[1] = (value >> 8) & 0xff;\n    buffer[2] = (value >> 16) & 0xff;\n    buffer[3] = (value >> 24) & 0xff;\n    return 4;\n}\n\ntemplate<>\ninline size_t write_le<float>(float value, uint8_t* buffer) {\n    static_assert(CHAR_BIT * sizeof(float) == 32, \"32 bit floating point expected\");\n    static_assert(std::numeric_limits<float>::is_iec559, \"IEEE 754 floating point expected\");\n    return write_le<uint32_t>(*reinterpret_cast<const uint32_t*>(&value), buffer);\n}\n\ntemplate<>\ninline size_t read_le<uint16_t>(uint16_t& value, const uint8_t* buffer) {\n    value = (static_cast<uint16_t>(buffer[0]) << 0) |\n            (static_cast<uint16_t>(buffer[1]) << 8);\n    return 2;\n}\n\ntemplate<>\ninline size_t read_le<uint32_t>(uint32_t& value, const uint8_t* buffer) {\n    value = (static_cast<uint32_t>(buffer[0]) << 0) |\n            (static_cast<uint32_t>(buffer[1]) << 8) |\n            (static_cast<uint32_t>(buffer[2]) << 16) |\n            (static_cast<uint32_t>(buffer[3]) << 24);\n    return 4;\n}\n\ntemplate<>\ninline size_t read_le<float>(float& value, const uint8_t* buffer) {\n    static_assert(CHAR_BIT * sizeof(float) == 32, \"32 bit floating point expected\");\n    static_assert(std::numeric_limits<float>::is_iec559, \"IEEE 754 floating point expected\");\n    return read_le(*reinterpret_cast<uint32_t*>(&value), buffer);\n}\n\n\ntemplate<typename T>\nstatic inline T read_le(const uint8_t** buffer, size_t* length) {\n    T result;\n    size_t cnt = read_le(result, *buffer);\n    buffer += cnt;\n    length -= cnt;\n    return result;\n}\n\n\ntypedef enum {\n    AS_JSON,\n    AS_INT32_ARRAY,\n    AS_FLOAT,\n    AS_INT,\n    AS_BOOL,\n    AS_UINT16,\n    BEGIN_TREE,\n    END_TREE\n} EndpointTypeID_t;\n\n\n\/\/ @brief Endpoint request handler\n\/\/\n\/\/ When passed a valid endpoint context, implementing functions shall handle an\n\/\/ endpoint read\/write request by reading the provided input data and filling in\n\/\/ output data. The exact semantics of this function depends on the according\n\/\/ endpoint's specification.\n\/\/\n\/\/ @param input: pointer to the input data\n\/\/ @param input_length: number of available input bytes\n\/\/ @param output: pointer to where the output data should go.\n\/\/        If *output_length is non-zero, this is guaranteed not to be NULL.\n\/\/ @param output_length: pointer to the remaining length of the output buffer.\n\/\/        The handler must update this value to subtract the number of written bytes.\n\/\/        The pointer itself is guaranteed not to be NULL.\ntypedef std::function<void(void* ctx, const uint8_t* input, size_t input_length, uint8_t* output, size_t* output_length)> EndpointHandler;\n\n\ntemplate<typename T>\nvoid default_read_endpoint_handler(void* ctx, const uint8_t* input, size_t input_length, uint8_t* output, size_t* output_length) {\n    const T* value = reinterpret_cast<const T*>(ctx);\n    \n    \/\/ If the old value was requested, call the according little endian serialization function\n    if (*output_length) {\n        uint8_t buffer[8]; \/\/ TODO: make buffer size dependent on the type\n        size_t cnt = write_le<T>(*value, buffer);\n        if (cnt < *output_length)\n            *output_length = cnt;\n        memcpy(output, buffer, *output_length);\n    }\n}\n\ntemplate<typename T>\nvoid default_readwrite_endpoint_handler(void* ctx, const uint8_t* input, size_t input_length, uint8_t* output, size_t* output_length) {\n    T* value = reinterpret_cast<T*>(ctx);\n    \n    \/\/ Call the handler for the const version of the endpoint's type - i.e. read the endpoint value into output\n    default_readwrite_endpoint_handler<T>(ctx, input, input_length, output, output_length);\n    \n    \/\/ If a new value was passed, call the according little endian deserialization function\n    if (input_length) {\n        uint8_t buffer[8] = { 0 }; \/\/ TODO: make buffer size dependent on the type\n        memcpy(output, buffer, input_length); \/\/ TODO: abort if not enough bytes received\n        read_le<T>(*value, buffer);\n    }\n}\n\nclass Endpoint {\npublic:\n    const char* const name_;\n\n    Endpoint(const char* name, EndpointTypeID_t type_id, EndpointHandler handler, const char* json_modifier, void *ctx) :\n        name_(name),\n        type_id_(type_id),\n        handler_(handler),\n        json_modifier_(json_modifier),\n        ctx_(ctx)\n    {\n    }\n\n    template<typename T>\n    Endpoint(const char* name, const T& ctx) :\n        Endpoint(name, AS_FLOAT, default_read_endpoint_handler<T>, \"\\\"access\\\":\\\"r\\\"\",\n        const_cast<T*>(&ctx) \/* it's safe to cast the const away here because we\n        know that the default_read_endpoint_handler immediately adds it back *\/) {}\n\n    template<typename T>\n    Endpoint(const char* name, T& ctx) :\n        Endpoint(name, AS_FLOAT, default_readwrite_endpoint_handler<T>, \"\\\"access\\\":\\\"rw\\\"\", &ctx) {}\n\n\n    void write_json(size_t id, size_t* skip, uint8_t** output, size_t* output_length, bool* need_comma);\n\n    void handle(const uint8_t* input, size_t input_length, uint8_t* output, size_t* output_length) {\n        if (handler_)\n            return handler_(ctx_, input, input_length, output, output_length);\n    }\n\nprivate:\n    const EndpointTypeID_t type_id_;\n    const EndpointHandler handler_;\n    const char* json_modifier_;\n    void* const ctx_;\n};\n\n\nclass PacketWriter {\npublic:\n    \/\/ @brief Processes a packet.\n    \/\/ TODO: define what happens when the output is congested. We can either drop the data or block.\n    \/\/ TODO: define what happens when the packet is larger than what the implementation can handle.\n    virtual int write_packet(const uint8_t* buffer, size_t length) = 0;\n};\n\n\nclass StreamWriter {\npublic:\n    \/\/ @brief Processes a chunk of bytes that is part of a continuous stream.\n    \/\/ TODO: define what happens when the output is congested. We can either drop the data or block.\n    virtual int write_bytes(const uint8_t* buffer, size_t length) = 0;\n};\n\n\nclass StreamToPacketConverter : public StreamWriter {\npublic:\n    StreamToPacketConverter(PacketWriter& output) :\n        output_(output)\n    {\n    };\n\n    int write_bytes(const uint8_t *buffer, size_t length);\n\nprivate:\n    uint8_t header_buffer_[3];\n    size_t header_index_ = 0;\n    uint8_t packet_buffer_[128];\n    size_t packet_index_ = 0;\n    size_t packet_length_ = 0;\n    PacketWriter& output_;\n};\n\n\nclass PacketToStreamConverter : public PacketWriter {\npublic:\n    PacketToStreamConverter(StreamWriter& output) :\n        output_(output)\n    {\n    };\n    \n    int write_packet(const uint8_t *buffer, size_t length);\n\nprivate:\n    StreamWriter& output_;\n};\n\n\nclass BidirectionalPacketBasedChannel : public PacketWriter {\npublic:\n    BidirectionalPacketBasedChannel(Endpoint* endpoints, size_t n_endpoints, PacketWriter& output) :\n        global_endpoints_(endpoints),\n        n_endpoints_(NUM_CHANNEL_SPECIFIC_ENDPOINTS + n_endpoints),\n        output_(output),\n        json_crc_(calculate_json_crc16())\n    {\n    }\n\n    int write_packet(const uint8_t* buffer, size_t length);\n\nprivate:\n    \n    uint16_t calculate_json_crc16(void);\n    void interface_query(const uint8_t* input, size_t input_length, uint8_t* output, size_t* output_length);\n\n    static void interface_query_handler(void* ctx, const uint8_t* input, size_t input_length, uint8_t* output, size_t* output_length) {\n        reinterpret_cast<BidirectionalPacketBasedChannel*>(ctx)->interface_query(input, input_length, output, output_length);\n    }\n    \n    static void subscription_handler(void* ctx, const uint8_t* input, size_t input_length, uint8_t* output, size_t* output_length) {\n        reinterpret_cast<BidirectionalPacketBasedChannel*>(ctx)->subscription(input, input_length, output, output_length);\n    }\n\n    \/\/ReceiveCallback c = BidirectionalPacketBasedChannel::receive_fetch_request_ex;\n    Endpoint channel_specific_endpoints_[2] = {\n        Endpoint(\"\", AS_JSON, BidirectionalPacketBasedChannel::interface_query_handler, nullptr, this),\n        Endpoint(\"subscriptions\", AS_INT32_ARRAY, BidirectionalPacketBasedChannel::subscription_handler, nullptr, this)\n    };\n    static constexpr size_t NUM_CHANNEL_SPECIFIC_ENDPOINTS = sizeof(channel_specific_endpoints_) \/ sizeof(channel_specific_endpoints_[0]);\n\n    Endpoint* global_endpoints_;\n    size_t n_endpoints_;\n    PacketWriter& output_;\n\n    Endpoint* get_endpoint(size_t index) {\n        if (index < NUM_CHANNEL_SPECIFIC_ENDPOINTS){\n            return &channel_specific_endpoints_[index];\n        } else if (index < n_endpoints_) {\n            return &global_endpoints_[index];\n        } else {\n            return nullptr;\n        }\n    }\n\n    void subscription(const uint8_t* input, size_t input_length, uint8_t* output, size_t* output_length) {\n        \/\/ TODO: handle\n        return;\n    }\n\n    size_t expected_seq_no_ = 0;\n    uint8_t tx_buf_[TX_BUF_SIZE];\n    const uint16_t json_crc_;\n};\n\n#endif\n<commit_msg>copy paste bug fix<commit_after>\/*\n* # ODrive Communication Protocol #\n*\n* Communicating with an ODrive consists of a series of endpoint operations.\n* operations. An endpoint is usually a single number or string.\n* The available endpoints can be enumerated by reading the JSON from endpoint 0\n* and can theoretically be different for each channel (they are not in practice).\n*\n* Each endpoint operation can send bytes to one endpoint (referenced by it's ID)\n* and at the same time receive bytes from the same endpoint. The semantics of\n* these payloads are specific to each endpoint's type, the name of which is\n* indicated in the JSON.\n*\n* For instance an int32 endpoint's input and output is a 4 byte little endian\n* representation. In general the convention for combined read\/write requests is\n* _exchange_, i.e. the returned value is the old value. Custom endpoint handlers\n* may be non-compliant.\n*\n* ## Stream format: ##\n* (For instance UART)\n*\n*   1. sync-byte\n*   2. packet-length (0-127, larger values are reserved)\n*   3. crc8(sync-byte + packet-length)\n*   4. packet\n*\n* ## Packet format: ##\n* (For instance USB)\n*\n* __Request__\n*\n*   1. seq-no, MSB = 0\n*   2. endpoint-id, MSB = \"expect ack\"\n*   3. expected_response_size\n*   4. payload (contains offset if required)\n*   5. crc16(seq-no + endpoint-id + payload + crc16(protocol_version + JSON))\n*      For endpoint 0 the JSON-CRC is not included\n*\n* __Response__\n*\n*   1. seq-no, MSB = 1\n*   2. payload\n*   3. crc16(seq-no + payload + protocol_version)\n*\n*\/\n\n\n#ifndef __PROTOCOL_HPP\n#define __PROTOCOL_HPP\n\n\/\/ TODO: resolve assert\n#define assert(expr)\n\n#include <functional>\n#include <limits>\n#include <cstring>\n#include \"crc.hpp\"\n\n\nconstexpr uint8_t SYNC_BYTE = '$';\nconstexpr uint8_t CRC8_INIT = 0;\nconstexpr uint16_t CRC16_INIT = 0;\nconstexpr uint16_t PROTOCOL_VERSION = 1;\nconstexpr uint16_t TX_BUF_SIZE = 64;\n\n\ntemplate<typename T>\ninline size_t write_le(T value, uint8_t* buffer);\n\ntemplate<typename T>\ninline size_t read_le(T& value, const uint8_t* buffer);\n\ntemplate<>\ninline size_t write_le<uint16_t>(uint16_t value, uint8_t* buffer) {\n    buffer[0] = (value >> 0) & 0xff;\n    buffer[1] = (value >> 8) & 0xff;\n    return 2;\n}\n\ntemplate<>\ninline size_t write_le<uint32_t>(uint32_t value, uint8_t* buffer) {\n    buffer[0] = (value >> 0) & 0xff;\n    buffer[1] = (value >> 8) & 0xff;\n    buffer[2] = (value >> 16) & 0xff;\n    buffer[3] = (value >> 24) & 0xff;\n    return 4;\n}\n\ntemplate<>\ninline size_t write_le<float>(float value, uint8_t* buffer) {\n    static_assert(CHAR_BIT * sizeof(float) == 32, \"32 bit floating point expected\");\n    static_assert(std::numeric_limits<float>::is_iec559, \"IEEE 754 floating point expected\");\n    return write_le<uint32_t>(*reinterpret_cast<const uint32_t*>(&value), buffer);\n}\n\ntemplate<>\ninline size_t read_le<uint16_t>(uint16_t& value, const uint8_t* buffer) {\n    value = (static_cast<uint16_t>(buffer[0]) << 0) |\n            (static_cast<uint16_t>(buffer[1]) << 8);\n    return 2;\n}\n\ntemplate<>\ninline size_t read_le<uint32_t>(uint32_t& value, const uint8_t* buffer) {\n    value = (static_cast<uint32_t>(buffer[0]) << 0) |\n            (static_cast<uint32_t>(buffer[1]) << 8) |\n            (static_cast<uint32_t>(buffer[2]) << 16) |\n            (static_cast<uint32_t>(buffer[3]) << 24);\n    return 4;\n}\n\ntemplate<>\ninline size_t read_le<float>(float& value, const uint8_t* buffer) {\n    static_assert(CHAR_BIT * sizeof(float) == 32, \"32 bit floating point expected\");\n    static_assert(std::numeric_limits<float>::is_iec559, \"IEEE 754 floating point expected\");\n    return read_le(*reinterpret_cast<uint32_t*>(&value), buffer);\n}\n\n\ntemplate<typename T>\nstatic inline T read_le(const uint8_t** buffer, size_t* length) {\n    T result;\n    size_t cnt = read_le(result, *buffer);\n    buffer += cnt;\n    length -= cnt;\n    return result;\n}\n\n\ntypedef enum {\n    AS_JSON,\n    AS_INT32_ARRAY,\n    AS_FLOAT,\n    AS_INT,\n    AS_BOOL,\n    AS_UINT16,\n    BEGIN_TREE,\n    END_TREE\n} EndpointTypeID_t;\n\n\n\/\/ @brief Endpoint request handler\n\/\/\n\/\/ When passed a valid endpoint context, implementing functions shall handle an\n\/\/ endpoint read\/write request by reading the provided input data and filling in\n\/\/ output data. The exact semantics of this function depends on the corresponding\n\/\/ endpoint's specification.\n\/\/\n\/\/ @param input: pointer to the input data\n\/\/ @param input_length: number of available input bytes\n\/\/ @param output: pointer to where the output data should go.\n\/\/        If *output_length is non-zero, this is guaranteed not to be NULL.\n\/\/ @param output_length: pointer to the remaining length of the output buffer.\n\/\/        The handler must update this value to subtract the number of written bytes.\n\/\/        The pointer itself is guaranteed not to be NULL.\ntypedef std::function<void(void* ctx, const uint8_t* input, size_t input_length, uint8_t* output, size_t* output_length)> EndpointHandler;\n\n\ntemplate<typename T>\nvoid default_read_endpoint_handler(void* ctx, const uint8_t* input, size_t input_length, uint8_t* output, size_t* output_length) {\n    const T* value = reinterpret_cast<const T*>(ctx);\n    \n    \/\/ If the old value was requested, call the corresponding little endian serialization function\n    if (*output_length) {\n        uint8_t buffer[8]; \/\/ TODO: make buffer size dependent on the type\n        size_t cnt = write_le<T>(*value, buffer);\n        if (cnt < *output_length)\n            *output_length = cnt;\n        memcpy(output, buffer, *output_length);\n    }\n}\n\ntemplate<typename T>\nvoid default_readwrite_endpoint_handler(void* ctx, const uint8_t* input, size_t input_length, uint8_t* output, size_t* output_length) {\n    T* value = reinterpret_cast<T*>(ctx);\n    \n    \/\/ Call the handler for the const version of the endpoint's type - i.e. read the endpoint value into output\n    default_read_endpoint_handler<T>(ctx, input, input_length, output, output_length);\n    \n    \/\/ If a new value was passed, call the corresponding little endian deserialization function\n    if (input_length) {\n        uint8_t buffer[8] = { 0 }; \/\/ TODO: make buffer size dependent on the type\n        memcpy(output, buffer, input_length); \/\/ TODO: abort if not enough bytes received\n        read_le<T>(*value, buffer);\n    }\n}\n\nclass Endpoint {\npublic:\n    const char* const name_;\n\n    Endpoint(const char* name, EndpointTypeID_t type_id, EndpointHandler handler, const char* json_modifier, void *ctx) :\n        name_(name),\n        type_id_(type_id),\n        handler_(handler),\n        json_modifier_(json_modifier),\n        ctx_(ctx)\n    {\n    }\n\n    template<typename T>\n    Endpoint(const char* name, const T& ctx) :\n        Endpoint(name, AS_FLOAT, default_read_endpoint_handler<T>, \"\\\"access\\\":\\\"r\\\"\",\n        const_cast<T*>(&ctx) \/* it's safe to cast the const away here because we\n        know that the default_read_endpoint_handler immediately adds it back *\/) {}\n\n    template<typename T>\n    Endpoint(const char* name, T& ctx) :\n        Endpoint(name, AS_FLOAT, default_readwrite_endpoint_handler<T>, \"\\\"access\\\":\\\"rw\\\"\", &ctx) {}\n\n\n    void write_json(size_t id, size_t* skip, uint8_t** output, size_t* output_length, bool* need_comma);\n\n    void handle(const uint8_t* input, size_t input_length, uint8_t* output, size_t* output_length) {\n        if (handler_)\n            return handler_(ctx_, input, input_length, output, output_length);\n    }\n\nprivate:\n    const EndpointTypeID_t type_id_;\n    const EndpointHandler handler_;\n    const char* json_modifier_;\n    void* const ctx_;\n};\n\n\nclass PacketWriter {\npublic:\n    \/\/ @brief Processes a packet.\n    \/\/ TODO: define what happens when the output is congested. We can either drop the data or block.\n    \/\/ TODO: define what happens when the packet is larger than what the implementation can handle.\n    virtual int write_packet(const uint8_t* buffer, size_t length) = 0;\n};\n\n\nclass StreamWriter {\npublic:\n    \/\/ @brief Processes a chunk of bytes that is part of a continuous stream.\n    \/\/ TODO: define what happens when the output is congested. We can either drop the data or block.\n    virtual int write_bytes(const uint8_t* buffer, size_t length) = 0;\n};\n\n\nclass StreamToPacketConverter : public StreamWriter {\npublic:\n    StreamToPacketConverter(PacketWriter& output) :\n        output_(output)\n    {\n    };\n\n    int write_bytes(const uint8_t *buffer, size_t length);\n\nprivate:\n    uint8_t header_buffer_[3];\n    size_t header_index_ = 0;\n    uint8_t packet_buffer_[128];\n    size_t packet_index_ = 0;\n    size_t packet_length_ = 0;\n    PacketWriter& output_;\n};\n\n\nclass PacketToStreamConverter : public PacketWriter {\npublic:\n    PacketToStreamConverter(StreamWriter& output) :\n        output_(output)\n    {\n    };\n    \n    int write_packet(const uint8_t *buffer, size_t length);\n\nprivate:\n    StreamWriter& output_;\n};\n\n\nclass BidirectionalPacketBasedChannel : public PacketWriter {\npublic:\n    BidirectionalPacketBasedChannel(Endpoint* endpoints, size_t n_endpoints, PacketWriter& output) :\n        global_endpoints_(endpoints),\n        n_endpoints_(NUM_CHANNEL_SPECIFIC_ENDPOINTS + n_endpoints),\n        output_(output),\n        json_crc_(calculate_json_crc16())\n    {\n    }\n\n    int write_packet(const uint8_t* buffer, size_t length);\n\nprivate:\n    \n    uint16_t calculate_json_crc16(void);\n    void interface_query(const uint8_t* input, size_t input_length, uint8_t* output, size_t* output_length);\n\n    static void interface_query_handler(void* ctx, const uint8_t* input, size_t input_length, uint8_t* output, size_t* output_length) {\n        reinterpret_cast<BidirectionalPacketBasedChannel*>(ctx)->interface_query(input, input_length, output, output_length);\n    }\n    \n    static void subscription_handler(void* ctx, const uint8_t* input, size_t input_length, uint8_t* output, size_t* output_length) {\n        reinterpret_cast<BidirectionalPacketBasedChannel*>(ctx)->subscription(input, input_length, output, output_length);\n    }\n\n    \/\/ReceiveCallback c = BidirectionalPacketBasedChannel::receive_fetch_request_ex;\n    Endpoint channel_specific_endpoints_[2] = {\n        Endpoint(\"\", AS_JSON, BidirectionalPacketBasedChannel::interface_query_handler, nullptr, this),\n        Endpoint(\"subscriptions\", AS_INT32_ARRAY, BidirectionalPacketBasedChannel::subscription_handler, nullptr, this)\n    };\n    static constexpr size_t NUM_CHANNEL_SPECIFIC_ENDPOINTS = sizeof(channel_specific_endpoints_) \/ sizeof(channel_specific_endpoints_[0]);\n\n    Endpoint* global_endpoints_;\n    size_t n_endpoints_;\n    PacketWriter& output_;\n\n    Endpoint* get_endpoint(size_t index) {\n        if (index < NUM_CHANNEL_SPECIFIC_ENDPOINTS){\n            return &channel_specific_endpoints_[index];\n        } else if (index < n_endpoints_) {\n            return &global_endpoints_[index];\n        } else {\n            return nullptr;\n        }\n    }\n\n    void subscription(const uint8_t* input, size_t input_length, uint8_t* output, size_t* output_length) {\n        \/\/ TODO: handle\n        return;\n    }\n\n    size_t expected_seq_no_ = 0;\n    uint8_t tx_buf_[TX_BUF_SIZE];\n    const uint16_t json_crc_;\n};\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\n *\n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2014 Artem Pavlenko\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA\n *\n *****************************************************************************\/\n\n#include \"gdal_datasource.hpp\"\n#include \"gdal_featureset.hpp\"\n\n\/\/ mapnik\n#include <mapnik\/debug.hpp>\n#include <mapnik\/boolean.hpp>\n#include <mapnik\/geom_util.hpp>\n#include <mapnik\/timer.hpp>\n#include <mapnik\/value_types.hpp>\n\n#include <gdal_version.h>\n\nusing mapnik::datasource;\nusing mapnik::parameters;\n\nDATASOURCE_PLUGIN(gdal_datasource)\n\nusing mapnik::box2d;\nusing mapnik::coord2d;\nusing mapnik::query;\nusing mapnik::featureset_ptr;\nusing mapnik::layer_descriptor;\nusing mapnik::datasource_exception;\n\n\n\/*\n * Opens a GDALDataset and returns a pointer to it.\n * Caller is responsible for calling GDALClose on it\n *\/\ninline GDALDataset* gdal_datasource::open_dataset() const\n{\n    MAPNIK_LOG_DEBUG(gdal) << \"gdal_datasource: Opening \" << dataset_name_;\n\n    GDALDataset *dataset;\n#if GDAL_VERSION_NUM >= 1600\n    if (shared_dataset_)\n    {\n        dataset = reinterpret_cast<GDALDataset*>(GDALOpenShared((dataset_name_).c_str(), GA_ReadOnly));\n    }\n    else\n#endif\n    {\n        dataset = reinterpret_cast<GDALDataset*>(GDALOpen((dataset_name_).c_str(), GA_ReadOnly));\n    }\n\n    if (! dataset)\n    {\n        throw datasource_exception(CPLGetLastErrorMsg());\n    }\n\n    return dataset;\n}\n\n\ngdal_datasource::gdal_datasource(parameters const& params)\n    : datasource(params),\n      desc_(gdal_datasource::name(), \"utf-8\"),\n      nodata_value_(params.get<double>(\"nodata\")),\n      nodata_tolerance_(*params.get<double>(\"nodata_tolerance\",1e-12))\n{\n    MAPNIK_LOG_DEBUG(gdal) << \"gdal_datasource: Initializing...\";\n\n#ifdef MAPNIK_STATS\n    mapnik::progress_timer __stats__(std::clog, \"gdal_datasource::init\");\n#endif\n\n    GDALAllRegister();\n\n    boost::optional<std::string> file = params.get<std::string>(\"file\");\n    if (! file) throw datasource_exception(\"missing <file> parameter\");\n\n    boost::optional<std::string> base = params.get<std::string>(\"base\");\n    if (base)\n    {\n        dataset_name_ = *base + \"\/\" + *file;\n    }\n    else\n    {\n        dataset_name_ = *file;\n    }\n\n    shared_dataset_ = *params.get<mapnik::boolean_type>(\"shared\", false);\n    band_ = *params.get<mapnik::value_integer>(\"band\", -1);\n\n    GDALDataset *dataset = open_dataset();\n\n    nbands_ = dataset->GetRasterCount();\n    width_ = dataset->GetRasterXSize();\n    height_ = dataset->GetRasterYSize();\n    desc_.add_descriptor(mapnik::attribute_descriptor(\"nodata\", mapnik::Integer));\n\n    double tr[6];\n    bool bbox_override = false;\n    boost::optional<std::string> bbox_s = params.get<std::string>(\"extent\");\n    if (bbox_s)\n    {\n        MAPNIK_LOG_DEBUG(gdal) << \"gdal_datasource: BBox Parameter=\" << *bbox_s;\n\n        bbox_override = extent_.from_string(*bbox_s);\n        if (! bbox_override)\n        {\n            throw datasource_exception(\"GDAL Plugin: bbox parameter '\" + *bbox_s + \"' invalid\");\n        }\n    }\n\n    if (bbox_override)\n    {\n        tr[0] = extent_.minx();\n        tr[1] = extent_.width() \/ (double)width_;\n        tr[2] = 0;\n        tr[3] = extent_.maxy();\n        tr[4] = 0;\n        tr[5] = -extent_.height() \/ (double)height_;\n        MAPNIK_LOG_DEBUG(gdal) << \"gdal_datasource extent override gives Geotransform=\"\n                               << tr[0] << \",\" << tr[1] << \",\"\n                               << tr[2] << \",\" << tr[3] << \",\"\n                               << tr[4] << \",\" << tr[5];\n    }\n    else\n    {\n        if (dataset->GetGeoTransform(tr) != CPLE_None)\n        {\n            MAPNIK_LOG_DEBUG(gdal) << \"gdal_datasource GetGeotransform failure gives=\"\n                                   << tr[0] << \",\" << tr[1] << \",\"\n                                   << tr[2] << \",\" << tr[3] << \",\"\n                                   << tr[4] << \",\" << tr[5];\n        }\n        else\n        {\n            MAPNIK_LOG_DEBUG(gdal) << \"gdal_datasource Geotransform=\"\n                                   << tr[0] << \",\" << tr[1] << \",\"\n                                   << tr[2] << \",\" << tr[3] << \",\"\n                                   << tr[4] << \",\" << tr[5];\n        }\n    }\n\n    \/\/ TODO - We should throw for true non-north up images, but the check\n    \/\/ below is clearly too restrictive.\n    \/\/ https:\/\/github.com\/mapnik\/mapnik\/issues\/970\n    \/*\n      if (tr[2] != 0 || tr[4] != 0)\n      {\n      throw datasource_exception(\"GDAL Plugin: only 'north up' images are supported\");\n      }\n    *\/\n\n    dx_ = tr[1];\n    dy_ = tr[5];\n\n    if (! bbox_override)\n    {\n        double x0 = tr[0];\n        double y0 = tr[3];\n        double x1 = tr[0] + width_ * dx_ + height_ *tr[2];\n        double y1 = tr[3] + width_ *tr[4] + height_ * dy_;\n\n        \/*\n          double x0 = tr[0] + (height_) * tr[2]; \/\/ minx\n          double y0 = tr[3] + (height_) * tr[5]; \/\/ miny\n\n          double x1 = tr[0] + (width_) * tr[1]; \/\/ maxx\n          double y1 = tr[3] + (width_) * tr[4]; \/\/ maxy\n        *\/\n\n        extent_.init(x0, y0, x1, y1);\n    }\n\n    GDALClose(dataset);\n\n    MAPNIK_LOG_DEBUG(gdal) << \"gdal_datasource: Raster Size=\" << width_ << \",\" << height_;\n    MAPNIK_LOG_DEBUG(gdal) << \"gdal_datasource: Raster Extent=\" << extent_;\n\n}\n\ngdal_datasource::~gdal_datasource()\n{\n}\n\ndatasource::datasource_t gdal_datasource::type() const\n{\n    return datasource::Raster;\n}\n\nconst char * gdal_datasource::name()\n{\n    return \"gdal\";\n}\n\nbox2d<double> gdal_datasource::envelope() const\n{\n    return extent_;\n}\n\nboost::optional<mapnik::datasource::geometry_t> gdal_datasource::get_geometry_type() const\n{\n    return boost::optional<mapnik::datasource::geometry_t>();\n}\n\nlayer_descriptor gdal_datasource::get_descriptor() const\n{\n    return desc_;\n}\n\nfeatureset_ptr gdal_datasource::features(query const& q) const\n{\n#ifdef MAPNIK_STATS\n    mapnik::progress_timer __stats__(std::clog, \"gdal_datasource::features\");\n#endif\n\n    gdal_query gq = q;\n\n    \/\/ TODO - move to std::make_shared, but must reduce # of args to <= 9\n    return featureset_ptr(new gdal_featureset(*open_dataset(),\n                                              band_,\n                                              gq,\n                                              extent_,\n                                              width_,\n                                              height_,\n                                              nbands_,\n                                              dx_,\n                                              dy_,\n                                              nodata_value_,\n                                              nodata_tolerance_));\n}\n\nfeatureset_ptr gdal_datasource::features_at_point(coord2d const& pt, double tol) const\n{\n#ifdef MAPNIK_STATS\n    mapnik::progress_timer __stats__(std::clog, \"gdal_datasource::features_at_point\");\n#endif\n\n    gdal_query gq = pt;\n\n    \/\/ TODO - move to std::make_shared, but must reduce # of args to <= 9\n    return featureset_ptr(new gdal_featureset(*open_dataset(),\n                                              band_,\n                                              gq,\n                                              extent_,\n                                              width_,\n                                              height_,\n                                              nbands_,\n                                              dx_,\n                                              dy_,\n                                              nodata_value_,\n                                              nodata_tolerance_));\n}\n<commit_msg>nodata value can be floating point<commit_after>\/*****************************************************************************\n *\n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2014 Artem Pavlenko\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA\n *\n *****************************************************************************\/\n\n#include \"gdal_datasource.hpp\"\n#include \"gdal_featureset.hpp\"\n\n\/\/ mapnik\n#include <mapnik\/debug.hpp>\n#include <mapnik\/boolean.hpp>\n#include <mapnik\/geom_util.hpp>\n#include <mapnik\/timer.hpp>\n#include <mapnik\/value_types.hpp>\n\n#include <gdal_version.h>\n\nusing mapnik::datasource;\nusing mapnik::parameters;\n\nDATASOURCE_PLUGIN(gdal_datasource)\n\nusing mapnik::box2d;\nusing mapnik::coord2d;\nusing mapnik::query;\nusing mapnik::featureset_ptr;\nusing mapnik::layer_descriptor;\nusing mapnik::datasource_exception;\n\n\n\/*\n * Opens a GDALDataset and returns a pointer to it.\n * Caller is responsible for calling GDALClose on it\n *\/\ninline GDALDataset* gdal_datasource::open_dataset() const\n{\n    MAPNIK_LOG_DEBUG(gdal) << \"gdal_datasource: Opening \" << dataset_name_;\n\n    GDALDataset *dataset;\n#if GDAL_VERSION_NUM >= 1600\n    if (shared_dataset_)\n    {\n        dataset = reinterpret_cast<GDALDataset*>(GDALOpenShared((dataset_name_).c_str(), GA_ReadOnly));\n    }\n    else\n#endif\n    {\n        dataset = reinterpret_cast<GDALDataset*>(GDALOpen((dataset_name_).c_str(), GA_ReadOnly));\n    }\n\n    if (! dataset)\n    {\n        throw datasource_exception(CPLGetLastErrorMsg());\n    }\n\n    return dataset;\n}\n\n\ngdal_datasource::gdal_datasource(parameters const& params)\n    : datasource(params),\n      desc_(gdal_datasource::name(), \"utf-8\"),\n      nodata_value_(params.get<double>(\"nodata\")),\n      nodata_tolerance_(*params.get<double>(\"nodata_tolerance\",1e-12))\n{\n    MAPNIK_LOG_DEBUG(gdal) << \"gdal_datasource: Initializing...\";\n\n#ifdef MAPNIK_STATS\n    mapnik::progress_timer __stats__(std::clog, \"gdal_datasource::init\");\n#endif\n\n    GDALAllRegister();\n\n    boost::optional<std::string> file = params.get<std::string>(\"file\");\n    if (! file) throw datasource_exception(\"missing <file> parameter\");\n\n    boost::optional<std::string> base = params.get<std::string>(\"base\");\n    if (base)\n    {\n        dataset_name_ = *base + \"\/\" + *file;\n    }\n    else\n    {\n        dataset_name_ = *file;\n    }\n\n    shared_dataset_ = *params.get<mapnik::boolean_type>(\"shared\", false);\n    band_ = *params.get<mapnik::value_integer>(\"band\", -1);\n\n    GDALDataset *dataset = open_dataset();\n\n    nbands_ = dataset->GetRasterCount();\n    width_ = dataset->GetRasterXSize();\n    height_ = dataset->GetRasterYSize();\n    desc_.add_descriptor(mapnik::attribute_descriptor(\"nodata\", mapnik::Double));\n\n    double tr[6];\n    bool bbox_override = false;\n    boost::optional<std::string> bbox_s = params.get<std::string>(\"extent\");\n    if (bbox_s)\n    {\n        MAPNIK_LOG_DEBUG(gdal) << \"gdal_datasource: BBox Parameter=\" << *bbox_s;\n\n        bbox_override = extent_.from_string(*bbox_s);\n        if (! bbox_override)\n        {\n            throw datasource_exception(\"GDAL Plugin: bbox parameter '\" + *bbox_s + \"' invalid\");\n        }\n    }\n\n    if (bbox_override)\n    {\n        tr[0] = extent_.minx();\n        tr[1] = extent_.width() \/ (double)width_;\n        tr[2] = 0;\n        tr[3] = extent_.maxy();\n        tr[4] = 0;\n        tr[5] = -extent_.height() \/ (double)height_;\n        MAPNIK_LOG_DEBUG(gdal) << \"gdal_datasource extent override gives Geotransform=\"\n                               << tr[0] << \",\" << tr[1] << \",\"\n                               << tr[2] << \",\" << tr[3] << \",\"\n                               << tr[4] << \",\" << tr[5];\n    }\n    else\n    {\n        if (dataset->GetGeoTransform(tr) != CPLE_None)\n        {\n            MAPNIK_LOG_DEBUG(gdal) << \"gdal_datasource GetGeotransform failure gives=\"\n                                   << tr[0] << \",\" << tr[1] << \",\"\n                                   << tr[2] << \",\" << tr[3] << \",\"\n                                   << tr[4] << \",\" << tr[5];\n        }\n        else\n        {\n            MAPNIK_LOG_DEBUG(gdal) << \"gdal_datasource Geotransform=\"\n                                   << tr[0] << \",\" << tr[1] << \",\"\n                                   << tr[2] << \",\" << tr[3] << \",\"\n                                   << tr[4] << \",\" << tr[5];\n        }\n    }\n\n    \/\/ TODO - We should throw for true non-north up images, but the check\n    \/\/ below is clearly too restrictive.\n    \/\/ https:\/\/github.com\/mapnik\/mapnik\/issues\/970\n    \/*\n      if (tr[2] != 0 || tr[4] != 0)\n      {\n      throw datasource_exception(\"GDAL Plugin: only 'north up' images are supported\");\n      }\n    *\/\n\n    dx_ = tr[1];\n    dy_ = tr[5];\n\n    if (! bbox_override)\n    {\n        double x0 = tr[0];\n        double y0 = tr[3];\n        double x1 = tr[0] + width_ * dx_ + height_ *tr[2];\n        double y1 = tr[3] + width_ *tr[4] + height_ * dy_;\n\n        \/*\n          double x0 = tr[0] + (height_) * tr[2]; \/\/ minx\n          double y0 = tr[3] + (height_) * tr[5]; \/\/ miny\n\n          double x1 = tr[0] + (width_) * tr[1]; \/\/ maxx\n          double y1 = tr[3] + (width_) * tr[4]; \/\/ maxy\n        *\/\n\n        extent_.init(x0, y0, x1, y1);\n    }\n\n    GDALClose(dataset);\n\n    MAPNIK_LOG_DEBUG(gdal) << \"gdal_datasource: Raster Size=\" << width_ << \",\" << height_;\n    MAPNIK_LOG_DEBUG(gdal) << \"gdal_datasource: Raster Extent=\" << extent_;\n\n}\n\ngdal_datasource::~gdal_datasource()\n{\n}\n\ndatasource::datasource_t gdal_datasource::type() const\n{\n    return datasource::Raster;\n}\n\nconst char * gdal_datasource::name()\n{\n    return \"gdal\";\n}\n\nbox2d<double> gdal_datasource::envelope() const\n{\n    return extent_;\n}\n\nboost::optional<mapnik::datasource::geometry_t> gdal_datasource::get_geometry_type() const\n{\n    return boost::optional<mapnik::datasource::geometry_t>();\n}\n\nlayer_descriptor gdal_datasource::get_descriptor() const\n{\n    return desc_;\n}\n\nfeatureset_ptr gdal_datasource::features(query const& q) const\n{\n#ifdef MAPNIK_STATS\n    mapnik::progress_timer __stats__(std::clog, \"gdal_datasource::features\");\n#endif\n\n    gdal_query gq = q;\n\n    \/\/ TODO - move to std::make_shared, but must reduce # of args to <= 9\n    return featureset_ptr(new gdal_featureset(*open_dataset(),\n                                              band_,\n                                              gq,\n                                              extent_,\n                                              width_,\n                                              height_,\n                                              nbands_,\n                                              dx_,\n                                              dy_,\n                                              nodata_value_,\n                                              nodata_tolerance_));\n}\n\nfeatureset_ptr gdal_datasource::features_at_point(coord2d const& pt, double tol) const\n{\n#ifdef MAPNIK_STATS\n    mapnik::progress_timer __stats__(std::clog, \"gdal_datasource::features_at_point\");\n#endif\n\n    gdal_query gq = pt;\n\n    \/\/ TODO - move to std::make_shared, but must reduce # of args to <= 9\n    return featureset_ptr(new gdal_featureset(*open_dataset(),\n                                              band_,\n                                              gq,\n                                              extent_,\n                                              width_,\n                                              height_,\n                                              nbands_,\n                                              dx_,\n                                              dy_,\n                                              nodata_value_,\n                                              nodata_tolerance_));\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/chips\/p9\/common\/scominfo\/p9_scominfo.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_scominfo.H\n\/\/\/ @brief P9 chip unit SCOM address platform translation code\n\/\/\/\n\/\/\/ HWP HWP Owner: jmcgill@us.ibm.com\n\/\/\/ HWP FW Owner: dcrowell@us.ibm.com\n\/\/\/ HWP Team: Infrastructure\n\/\/\/ HWP Level: 1\n\/\/\/ HWP Consumed by: FSP\/HB\n\/\/\/\n\n#ifndef P9_SCOMINFO_H\n#define P9_SCOMINFO_H\n\n\/\/ includes\n#include <stdint.h>\n#include <vector>\n#include \"p9_cu.H\"\n\nextern \"C\"\n{\n    \/\/\/ @brief Creates the actual SCOM address based on the chip unit type, instance, and the input SCOM address (relative to chip unit instance 0)\n    \/\/\/ @param[in] i_p9CU Enumeration of the chip unit type\n    \/\/\/ @param[in] i_chipUnitNum Instance number of the chip unit\n    \/\/\/ @param[in] i_scomAddr The input SCOM address associated with the chip unit type\n    \/\/\/ @param[in] i_mode Used for special purposes, default to 0\n    \/\/\/ @retval uint64_t Actual SCOM address for the chip unit instance passed in\n    uint64_t p9_scominfo_createChipUnitScomAddr(const p9ChipUnits_t i_p9CU, const uint8_t i_chipUnitNum,\n            const uint64_t i_scomAddr, const uint32_t i_mode = 0);\n\n    \/\/\/ @brief Determine if the provided SCOM address correlates to any chip units (if so creates a list of chipUnitPairing structures which correspond)\n    \/\/\/ @param[in] i_scomAddr SCOM address to be tested\n    \/\/\/ @param[out] o_chipUnitRelated Returns true if SCOM address is associated with any chip units\n    \/\/\/ @param[out] o_chipUnitPairing Collection of chipUnitPairing enums\n    \/\/\/ @param[in] i_mode Used for special purposes, default to 0\n    \/\/\/ @retval uint32_t Return non-zero for error\n    uint32_t p9_scominfo_isChipUnitScom(const uint64_t i_scomAddr, bool& o_chipUnitRelated,\n                                        std::vector<p9_chipUnitPairing_t>& o_chipUnitPairing, const uint32_t i_mode = 0);\n\n} \/\/ extern \"C\"\n\n#endif \/* P9_SCOMINFO_H *\/\n<commit_msg>Add STANDARD_MODE constant to Scom Trans Code<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/chips\/p9\/common\/scominfo\/p9_scominfo.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_scominfo.H\n\/\/\/ @brief P9 chip unit SCOM address platform translation code\n\/\/\/\n\/\/\/ HWP HWP Owner: jmcgill@us.ibm.com\n\/\/\/ HWP FW Owner: dcrowell@us.ibm.com\n\/\/\/ HWP Team: Infrastructure\n\/\/\/ HWP Level: 1\n\/\/\/ HWP Consumed by: FSP\/HB\n\/\/\/\n\n#ifndef P9_SCOMINFO_H\n#define P9_SCOMINFO_H\n\n\/\/ includes\n#include <stdint.h>\n#include <vector>\n#include \"p9_cu.H\"\n\nextern \"C\"\n{\n    typedef enum\n    {\n        STANDARD_MODE = 0\n    } p9TranslationMode_t;\n\n    \/\/\/ @brief Creates the actual SCOM address based on the chip unit type, instance, and the input SCOM address (relative to chip unit instance 0)\n    \/\/\/ @param[in] i_p9CU Enumeration of the chip unit type\n    \/\/\/ @param[in] i_chipUnitNum Instance number of the chip unit\n    \/\/\/ @param[in] i_scomAddr The input SCOM address associated with the chip unit type\n    \/\/\/ @param[in] i_mode Used for special purposes, default to 0\n    \/\/\/ @retval uint64_t Actual SCOM address for the chip unit instance passed in\n    uint64_t p9_scominfo_createChipUnitScomAddr(const p9ChipUnits_t i_p9CU, const uint8_t i_chipUnitNum,\n            const uint64_t i_scomAddr, const uint32_t i_mode = 0);\n\n    \/\/\/ @brief Determine if the provided SCOM address correlates to any chip units (if so creates a list of chipUnitPairing structures which correspond)\n    \/\/\/ @param[in] i_scomAddr SCOM address to be tested\n    \/\/\/ @param[out] o_chipUnitRelated Returns true if SCOM address is associated with any chip units\n    \/\/\/ @param[out] o_chipUnitPairing Collection of chipUnitPairing enums\n    \/\/\/ @param[in] i_mode Used for special purposes, default to 0\n    \/\/\/ @retval uint32_t Return non-zero for error\n    uint32_t p9_scominfo_isChipUnitScom(const uint64_t i_scomAddr, bool& o_chipUnitRelated,\n                                        std::vector<p9_chipUnitPairing_t>& o_chipUnitPairing, const uint32_t i_mode = 0);\n\n} \/\/ extern \"C\"\n\n#endif \/* P9_SCOMINFO_H *\/\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        friend class Shader;\n        friend class Species;\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        private:\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 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 sets a world species pointer.\n            void set_world_species_pointer(void* world_species_pointer);\n\n            void compute_matrices_from_inputs();\n\n            void* world_species_pointer;              \/\/ pointer to world species (used in collision detection).\n\n            std::vector<void*> shader_pointer_vector;\n            std::queue<GLuint> free_shaderID_queue;\n    };\n\n    class Shader\n    {\n        friend class World;\n        friend class Texture;\n        friend class Species;\n        friend class Object;\n\n        public:\n            \/\/ constructor.\n            Shader(ShaderStruct shader_struct);\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            \/\/ destructor.\n            ~Shader();\n\n        private:\n            \/\/ this method renders all textures using this shader.\n            void render();\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 texture ID and removes it from the `free_textureID_queue` if it was popped from the queue.\n            GLuint get_textureID();\n\n            \/\/ this method sets a world species pointer.\n            void set_world_species_pointer(void* world_species_pointer);\n\n            model::World *world_pointer;          \/\/ pointer to the world.\n\n            GLuint programID;                     \/\/ shaders' programID, returned by `LoadShaders`.\n\n            GLuint MatrixID;\n            GLuint ViewMatrixID;\n            GLuint ModelMatrixID;\n\n            void bind_to_world();\n\n            void* world_species_pointer;          \/\/ pointer to world species (used in collision detection).\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            std::vector<void*> texture_pointer_vector;\n            std::queue<GLuint> free_textureID_queue;\n\n            const char *char_vertex_shader;\n            const char *char_fragment_shader;\n    };\n\n    class Texture\n    {\n        friend class Shader;\n        friend class Species;\n        friend class Object;\n\n        public:\n            \/\/ constructor.\n            Texture(TextureStruct texture_struct);\n\n            \/\/ this method sets pointer to this shader to NULL, sets `shader_pointer` according to the input, and requests a new `textureID` from the new shader.\n            void switch_to_new_shader(model::Shader *new_world_pointer);\n\n            \/\/ destructor.\n            ~Texture();\n\n        private:\n            \/\/ this method renders all species using this texture.\n            void render();\n\n            \/\/ this method sets a species pointer.\n            void set_species_pointer(GLuint speciesID, void* species_pointer);\n\n            \/\/ this method gets a species pointer.\n            void* get_species_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 a world species pointer.\n            void set_world_species_pointer(void* world_species_pointer);\n\n            model::Shader *shader_pointer;         \/\/ pointer to the shader.\n\n            void bind_to_shader();\n\n            void* world_species_pointer;           \/\/ pointer to world species (used in collision detection).\n\n            GLuint texture;                        \/\/ Texture, returned by `load_DDS_texture` or `load_BMP_texture`.\n            GLuint openGL_textureID;               \/\/ texture ID, returned by `glGetUniformLocation(programID, \"myTextureSampler\");`.\n\n            std::vector<void*> species_pointer_vector;\n            std::queue<GLuint> free_speciesID_queue;\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            GLuint textureID;                      \/\/ texture ID, returned by `Shader::get_textureID`.\n            const char *char_texture_file_format;\n            const char *char_texture_filename;\n    };\n\n    class Graph\n    {\n        friend class Node;\n\n        public:\n            \/\/ constructor.\n            Graph();\n\n            \/\/ destructor.\n            ~Graph();\n\n        private:\n            \/\/ this method sets a node pointer.\n            void set_node_pointer(GLuint nodeID, void* node_pointer);\n\n            \/\/ this method gets a node pointer.\n            void* get_node_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            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        private:\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            \/\/ 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_object_pointer(GLuint objectID, void* object_pointer);\n\n            \/\/ this method gets a object pointer.\n            void* get_object_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 `texture_pointer` according to the input, and requests a new `speciesID` from the new texture.\n            void switch_to_new_texture(model::Texture *new_texture_pointer);\n\n            bool is_world;                           \/\/ worlds currently do not rotate nor translate.\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            \/\/ The rest fields are created in the constructor.\n            GLuint image_width;\n            GLuint image_height;\n\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            model::Texture *texture_pointer;       \/\/ pointer to the texture.\n\n        private:\n            void bind_to_texture();\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::Texture->get_speciesID()`.\n            GLuint lightID;                        \/\/ light ID, returned by `glGetUniformLocation(programID, \"LightPosition_worldspace\");`.\n            const char *char_model_file_format;\n            const char *char_model_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 Font\n    {\n        public:\n            \/\/ constructor.\n            Font(FontStruct font_struct);\n\n            \/\/ destructor.\n            ~Font();\n\n            \/\/ this method renders all objects of this species.\n            void render();\n\n            \/\/ this method sets a glyph pointer.\n            void set_glyph_pointer(GLuint objectID, void* object_pointer);\n\n            \/\/ this method gets a glyph pointer.\n            void* get_glyph_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_glyphID();\n\n            \/\/ this method sets pointer to this species to NULL, sets `texture_pointer` according to the input, and requests a new `speciesID` from the new texture.\n            void switch_to_new_texture(model::Texture *new_texture_pointer);\n\n            std::vector<ObjectStruct> object_vector; \/\/ vector of individual objects of this species.\n            glm::vec3 lightPos;                      \/\/ light position.\n\n            \/\/ The rest fields are created in the constructor.\n            GLuint image_width;\n            GLuint image_height;\n\n            model::Texture *texture_pointer;       \/\/ pointer to the texture.\n\n        private:\n            void bind_to_texture();\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::Texture->get_speciesID()`.\n            GLuint lightID;                        \/\/ light ID, returned by `glGetUniformLocation(programID, \"LightPosition_worldspace\");`.\n            const char *char_model_file_format;\n            const char *char_model_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 Glyph\n    {\n        public:\n            \/\/ constructor.\n            Glyph(GlyphStruct glyph_struct);\n\n            \/\/ destructor.\n            ~Glyph();\n\n            \/\/ this method renders all objects of this species.\n            void render();\n\n            \/\/ this method sets a object pointer.\n            void set_object_pointer(GLuint objectID, void* object_pointer);\n\n            \/\/ this method gets a object pointer.\n            void* get_object_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            \/\/ The rest fields are created in the constructor.\n            GLuint image_width;\n            GLuint image_height;\n\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            model::Font *font_pointer;             \/\/ pointer to the font.\n\n        private:\n            void bind_to_font();\n\n            GLuint glyphID;                        \/\/ glyph ID, returned by `model::Font->get_glyphID()`.\n            GLuint lightID;                        \/\/ light ID, returned by `glGetUniformLocation(programID, \"LightPosition_worldspace\");`.\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        private:\n            void bind_to_species();\n\n            model::Species *species_pointer;       \/\/ pointer to the species.\n\n            GLuint objectID;                       \/\/ object ID, returned by `model::Species->get_objectID()`.\n            bool has_entered;\n\n            glm::vec3 coordinate_vector;           \/\/ coordinate vector.\n            glm::vec3 original_scale_vector;       \/\/ original scale 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>Bugikorjaus `switch_to_new_shader`: `new_shader_pointer`.<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        friend class Shader;\n        friend class Species;\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        private:\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 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 sets a world species pointer.\n            void set_world_species_pointer(void* world_species_pointer);\n\n            void compute_matrices_from_inputs();\n\n            void* world_species_pointer;              \/\/ pointer to world species (used in collision detection).\n\n            std::vector<void*> shader_pointer_vector;\n            std::queue<GLuint> free_shaderID_queue;\n    };\n\n    class Shader\n    {\n        friend class World;\n        friend class Texture;\n        friend class Species;\n        friend class Object;\n\n        public:\n            \/\/ constructor.\n            Shader(ShaderStruct shader_struct);\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            \/\/ destructor.\n            ~Shader();\n\n        private:\n            \/\/ this method renders all textures using this shader.\n            void render();\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 texture ID and removes it from the `free_textureID_queue` if it was popped from the queue.\n            GLuint get_textureID();\n\n            \/\/ this method sets a world species pointer.\n            void set_world_species_pointer(void* world_species_pointer);\n\n            model::World *world_pointer;          \/\/ pointer to the world.\n\n            GLuint programID;                     \/\/ shaders' programID, returned by `LoadShaders`.\n\n            GLuint MatrixID;\n            GLuint ViewMatrixID;\n            GLuint ModelMatrixID;\n\n            void bind_to_world();\n\n            void* world_species_pointer;          \/\/ pointer to world species (used in collision detection).\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            std::vector<void*> texture_pointer_vector;\n            std::queue<GLuint> free_textureID_queue;\n\n            const char *char_vertex_shader;\n            const char *char_fragment_shader;\n    };\n\n    class Texture\n    {\n        friend class Shader;\n        friend class Species;\n        friend class Object;\n\n        public:\n            \/\/ constructor.\n            Texture(TextureStruct texture_struct);\n\n            \/\/ this method sets pointer to this shader to NULL, sets `shader_pointer` according to the input, and requests a new `textureID` from the new shader.\n            void switch_to_new_shader(model::Shader *new_shader_pointer);\n\n            \/\/ destructor.\n            ~Texture();\n\n        private:\n            \/\/ this method renders all species using this texture.\n            void render();\n\n            \/\/ this method sets a species pointer.\n            void set_species_pointer(GLuint speciesID, void* species_pointer);\n\n            \/\/ this method gets a species pointer.\n            void* get_species_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 a world species pointer.\n            void set_world_species_pointer(void* world_species_pointer);\n\n            model::Shader *shader_pointer;         \/\/ pointer to the shader.\n\n            void bind_to_shader();\n\n            void* world_species_pointer;           \/\/ pointer to world species (used in collision detection).\n\n            GLuint texture;                        \/\/ Texture, returned by `load_DDS_texture` or `load_BMP_texture`.\n            GLuint openGL_textureID;               \/\/ texture ID, returned by `glGetUniformLocation(programID, \"myTextureSampler\");`.\n\n            std::vector<void*> species_pointer_vector;\n            std::queue<GLuint> free_speciesID_queue;\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            GLuint textureID;                      \/\/ texture ID, returned by `Shader::get_textureID`.\n            const char *char_texture_file_format;\n            const char *char_texture_filename;\n    };\n\n    class Graph\n    {\n        friend class Node;\n\n        public:\n            \/\/ constructor.\n            Graph();\n\n            \/\/ destructor.\n            ~Graph();\n\n        private:\n            \/\/ this method sets a node pointer.\n            void set_node_pointer(GLuint nodeID, void* node_pointer);\n\n            \/\/ this method gets a node pointer.\n            void* get_node_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            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        private:\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            \/\/ 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_object_pointer(GLuint objectID, void* object_pointer);\n\n            \/\/ this method gets a object pointer.\n            void* get_object_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 `texture_pointer` according to the input, and requests a new `speciesID` from the new texture.\n            void switch_to_new_texture(model::Texture *new_texture_pointer);\n\n            bool is_world;                           \/\/ worlds currently do not rotate nor translate.\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            \/\/ The rest fields are created in the constructor.\n            GLuint image_width;\n            GLuint image_height;\n\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            model::Texture *texture_pointer;       \/\/ pointer to the texture.\n\n        private:\n            void bind_to_texture();\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::Texture->get_speciesID()`.\n            GLuint lightID;                        \/\/ light ID, returned by `glGetUniformLocation(programID, \"LightPosition_worldspace\");`.\n            const char *char_model_file_format;\n            const char *char_model_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 Font\n    {\n        public:\n            \/\/ constructor.\n            Font(FontStruct font_struct);\n\n            \/\/ destructor.\n            ~Font();\n\n            \/\/ this method renders all objects of this species.\n            void render();\n\n            \/\/ this method sets a glyph pointer.\n            void set_glyph_pointer(GLuint objectID, void* object_pointer);\n\n            \/\/ this method gets a glyph pointer.\n            void* get_glyph_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_glyphID();\n\n            \/\/ this method sets pointer to this species to NULL, sets `texture_pointer` according to the input, and requests a new `speciesID` from the new texture.\n            void switch_to_new_texture(model::Texture *new_texture_pointer);\n\n            std::vector<ObjectStruct> object_vector; \/\/ vector of individual objects of this species.\n            glm::vec3 lightPos;                      \/\/ light position.\n\n            \/\/ The rest fields are created in the constructor.\n            GLuint image_width;\n            GLuint image_height;\n\n            model::Texture *texture_pointer;       \/\/ pointer to the texture.\n\n        private:\n            void bind_to_texture();\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::Texture->get_speciesID()`.\n            GLuint lightID;                        \/\/ light ID, returned by `glGetUniformLocation(programID, \"LightPosition_worldspace\");`.\n            const char *char_model_file_format;\n            const char *char_model_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 Glyph\n    {\n        public:\n            \/\/ constructor.\n            Glyph(GlyphStruct glyph_struct);\n\n            \/\/ destructor.\n            ~Glyph();\n\n            \/\/ this method renders all objects of this species.\n            void render();\n\n            \/\/ this method sets a object pointer.\n            void set_object_pointer(GLuint objectID, void* object_pointer);\n\n            \/\/ this method gets a object pointer.\n            void* get_object_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            \/\/ The rest fields are created in the constructor.\n            GLuint image_width;\n            GLuint image_height;\n\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            model::Font *font_pointer;             \/\/ pointer to the font.\n\n        private:\n            void bind_to_font();\n\n            GLuint glyphID;                        \/\/ glyph ID, returned by `model::Font->get_glyphID()`.\n            GLuint lightID;                        \/\/ light ID, returned by `glGetUniformLocation(programID, \"LightPosition_worldspace\");`.\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        private:\n            void bind_to_species();\n\n            model::Species *species_pointer;       \/\/ pointer to the species.\n\n            GLuint objectID;                       \/\/ object ID, returned by `model::Species->get_objectID()`.\n            bool has_entered;\n\n            glm::vec3 coordinate_vector;           \/\/ coordinate vector.\n            glm::vec3 original_scale_vector;       \/\/ original scale 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 * 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 \"BTS\"\n#define GRAPHENE_ADDRESS_PREFIX \"BTS\"\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(1000000000000000ll)\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_MIN_BLOCK_INTERVAL   1 \/* seconds *\/\n#define GRAPHENE_MAX_BLOCK_INTERVAL  30 \/* seconds *\/\n\n#define GRAPHENE_DEFAULT_BLOCK_INTERVAL  5 \/* seconds *\/\n#define GRAPHENE_DEFAULT_MAX_TRANSACTION_SIZE 2048\n#define GRAPHENE_DEFAULT_MAX_BLOCK_SIZE  (2*1024*1024) \/* 2 MiB (same as MAX_MESSAGE_SIZE in graphene\/net\/config.hpp) *\/\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                        (1001) \/\/ SHOULD BE ODD\n#define GRAPHENE_DEFAULT_MAX_COMMITTEE                        (1001) \/\/ 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*7*2) \/\/ Two weeks\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                          \"BTS2.9\"\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\/\/\/ 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<commit_msg>Change default max block size to even smaller<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 \"BTS\"\n#define GRAPHENE_ADDRESS_PREFIX \"BTS\"\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(1000000000000000ll)\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_MIN_BLOCK_INTERVAL   1 \/* seconds *\/\n#define GRAPHENE_MAX_BLOCK_INTERVAL  30 \/* seconds *\/\n\n#define GRAPHENE_DEFAULT_BLOCK_INTERVAL  5 \/* seconds *\/\n#define GRAPHENE_DEFAULT_MAX_TRANSACTION_SIZE 2048\n#define GRAPHENE_DEFAULT_MAX_BLOCK_SIZE  (2*1000*1000) \/* < 2 MiB (less than MAX_MESSAGE_SIZE in graphene\/net\/config.hpp) *\/\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                        (1001) \/\/ SHOULD BE ODD\n#define GRAPHENE_DEFAULT_MAX_COMMITTEE                        (1001) \/\/ 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*7*2) \/\/ Two weeks\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                          \"BTS2.9\"\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\/\/\/ 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<|endoftext|>"}
{"text":"<commit_before>#include \"ros\/ros.h\"\n#include \"dyeFilter.h\"\n#include \"AI.h\"\n\n#include <opencv2\/opencv.hpp> \/\/ cv::Point2d, cv::\n#include <algorithm> \/\/ random_shuffle\n#include <array>\n\n#include <image_transport\/image_transport.h> \/\/ image_transport\n#include <cv_bridge\/cv_bridge.h> \/\/ ROS>>>CV cv>>ROS\n#include <sensor_msgs\/image_encodings.h> \/\/ ROS>>>CV cv>>ROS\n#include <opencv2\/imgproc\/imgproc.hpp> \/\/ ROS>>>CV cv>>ROS\n#include <opencv2\/highgui\/highgui.hpp> \/\/ ROS>>>CV cv>>ROS\n\nAI::AI() : DESIRED_SAMPLE_SIZE(100), \n\t   NB_EPOCHS_PER_FRAME(10), \n\t   unit_distance(distance),\n\t   unit_learn(learn),\n\t   evolution(params),\n\t   gngt_input()\n{\n\n  dyeFilter = new GR::DyeFilter(1., 0.5, 50);\n\n  ros::NodeHandle n;\n  image_transport::ImageTransport it(n);\n  pubImageFiltrer = it.advertise(\"\/robia\/gngt_output\", 50);\n  sub = it.subscribe(\"\/ardrone\/front\/image_raw\", 1, &AI::imageCallBack, this);\n  ROS_INFO(\"AI constructed\");\n\n\n  \/\/Set properties  \n int askFileTypeBox=0; \/\/-1 is show box of codec  \n int Color = 1;  \n cv::Size S = cv::Size( 320, 240 );  \n  \n \/\/make output video file  \n this->mOutVideo.open(\"\/home\/siqi\/Documents\/robia\/output.avi\", askFileTypeBox, 15, S, Color);  \n}\n\nAI::~AI() {\n  delete dyeFilter;\n}\n\n\nvoid AI::imageCallBack(const sensor_msgs::ImageConstPtr& msg) {\n  \/\/ ROS_INFO(\"AI::imageCallBack triggered\");\n  cv_bridge::CvImagePtr cv_ptr;\n\n\n  try {\n    cv_ptr = cv_bridge::toCvCopy(msg, sensor_msgs::image_encodings::BGR8);\n  } catch (cv_bridge::Exception& e) {\n    \/\/ Afficher les détailles des erreurs\n    ROS_ERROR(\"cv_bridge exception: %s\", e.what());\n    return;\n  }\n\n  \/\/ Processing\n\n\n\n  dyeFilter->process(cv_ptr->image, cv_ptr->image, gngt_input);\n\n  for(int e = 0; e < NB_EPOCHS_PER_FRAME; ++e) {\n    std::random_shuffle(gngt_input.begin(),gngt_input.end()); \/\/ Important !!!!\n    auto begin = gngt_input.begin();\n    int vecsize = gngt_input.size()-1;\n    int sampleSize = std::min(DESIRED_SAMPLE_SIZE, vecsize);\n    auto end   = gngt_input.begin()+sampleSize; \n\n    vq2::algo::gngt::open_epoch(graph,evolution);\n    for(auto iter = begin; iter != end; ++iter)\n      vq2::algo::gngt::submit(params,graph,\n\t\t\t      unit_distance,unit_learn,\n\t\t\t      *iter,true);\n    vq2::algo::gngt::close_epoch(params,graph,\n\t\t\t\t unit_learn,\n\t\t\t\t evolution,true);\n  }\n\n\n  DisplayVertex display_v(cv_ptr->image);\n  DisplayEdge display_e(cv_ptr->image);\n\n\n  graph.for_each_vertex(display_v);\n  graph.for_each_edge(display_e);\n\n  \/\/ Processing ends here\n\n  \/\/ Publish processed image\n\n  pubImageFiltrer.publish(cv_ptr->toImageMsg());\n  mOutVideo << cv_ptr->image;\n  \/\/ ROS_INFO(\"AI::imageCallBack published imageMsg\");\n  cv::waitKey(3);\n}\n\n\n\n\nint main(int argc, char *argv[])\n{\n  ros::init(argc, argv, \"AI_Node\");\n\n  ros::NodeHandle n;\n\n  AI ai;\n\t\n  ros::spin();\n\n  return 0;\n}\n<commit_msg>output to relative path<commit_after>#include \"ros\/ros.h\"\n#include \"dyeFilter.h\"\n#include \"AI.h\"\n\n#include <opencv2\/opencv.hpp> \/\/ cv::Point2d, cv::\n#include <algorithm> \/\/ random_shuffle\n#include <array>\n\n#include <image_transport\/image_transport.h> \/\/ image_transport\n#include <cv_bridge\/cv_bridge.h> \/\/ ROS>>>CV cv>>ROS\n#include <sensor_msgs\/image_encodings.h> \/\/ ROS>>>CV cv>>ROS\n#include <opencv2\/imgproc\/imgproc.hpp> \/\/ ROS>>>CV cv>>ROS\n#include <opencv2\/highgui\/highgui.hpp> \/\/ ROS>>>CV cv>>ROS\n\nAI::AI() : DESIRED_SAMPLE_SIZE(100), \n\t   NB_EPOCHS_PER_FRAME(10), \n\t   unit_distance(distance),\n\t   unit_learn(learn),\n\t   evolution(params),\n\t   gngt_input()\n{\n\n  dyeFilter = new GR::DyeFilter(1., 0.5, 50);\n\n  ros::NodeHandle n;\n  image_transport::ImageTransport it(n);\n  pubImageFiltrer = it.advertise(\"\/robia\/gngt_output\", 50);\n  sub = it.subscribe(\"\/ardrone\/front\/image_raw\", 1, &AI::imageCallBack, this);\n  ROS_INFO(\"AI constructed\");\n\n\n  \/\/Set properties  \n int askFileTypeBox=0; \/\/-1 is show box of codec  \n int Color = 1;  \n cv::Size S = cv::Size( 320, 240 );  \n  \n \/\/make output video file  \n this->mOutVideo.open(\"..\/..\/output.avi\", askFileTypeBox, 15, S, Color);  \n}\n\nAI::~AI() {\n  delete dyeFilter;\n}\n\n\nvoid AI::imageCallBack(const sensor_msgs::ImageConstPtr& msg) {\n  \/\/ ROS_INFO(\"AI::imageCallBack triggered\");\n  cv_bridge::CvImagePtr cv_ptr;\n\n\n  try {\n    cv_ptr = cv_bridge::toCvCopy(msg, sensor_msgs::image_encodings::BGR8);\n  } catch (cv_bridge::Exception& e) {\n    \/\/ Afficher les détailles des erreurs\n    ROS_ERROR(\"cv_bridge exception: %s\", e.what());\n    return;\n  }\n\n  \/\/ Processing\n\n\n\n  dyeFilter->process(cv_ptr->image, cv_ptr->image, gngt_input);\n\n  for(int e = 0; e < NB_EPOCHS_PER_FRAME; ++e) {\n    std::random_shuffle(gngt_input.begin(),gngt_input.end()); \/\/ Important !!!!\n    auto begin = gngt_input.begin();\n    int vecsize = gngt_input.size()-1;\n    int sampleSize = std::min(DESIRED_SAMPLE_SIZE, vecsize);\n    auto end   = gngt_input.begin()+sampleSize; \n\n    vq2::algo::gngt::open_epoch(graph,evolution);\n    for(auto iter = begin; iter != end; ++iter)\n      vq2::algo::gngt::submit(params,graph,\n\t\t\t      unit_distance,unit_learn,\n\t\t\t      *iter,true);\n    vq2::algo::gngt::close_epoch(params,graph,\n\t\t\t\t unit_learn,\n\t\t\t\t evolution,true);\n  }\n\n\n  DisplayVertex display_v(cv_ptr->image);\n  DisplayEdge display_e(cv_ptr->image);\n\n\n  graph.for_each_vertex(display_v);\n  graph.for_each_edge(display_e);\n\n  \/\/ Processing ends here\n\n  \/\/ Publish processed image\n\n  pubImageFiltrer.publish(cv_ptr->toImageMsg());\n  mOutVideo << cv_ptr->image;\n  \/\/ ROS_INFO(\"AI::imageCallBack published imageMsg\");\n  cv::waitKey(3);\n}\n\n\n\n\nint main(int argc, char *argv[])\n{\n  ros::init(argc, argv, \"AI_Node\");\n\n  ros::NodeHandle n;\n\n  AI ai;\n\t\n  ros::spin();\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>server {\n    listen       80;\n    server_name  dev.cc localhost;\n\n    root html;\n    #access_log  logs\/dev.access.log  main;\n    access_log  logs\/dev.access.log  dev;\n\n\n    location \/ {\n        index index.php index.html index.htm;\n\n        # 对 IE 进行限速\n        if ($http_user_agent ~ \"MSIE\") {\n            limit_rate 1k;\n        }\n    }\n\n    #error_page  404              \/404.html;\n\n    # redirect server error pages to the static page \/50x.html\n    #\n    error_page   500 502 503 504  \/50x.html;\n    location = \/50x.html {\n        root   html;\n    }\n\n    # 静态文件代理\n    location ~ \/static\/ {\n        rewrite \"^\/static\/(.*)$\" \/static\/$1 break;\n    }\n\n    # 不记录 favicon.ico 错误日志\n    location ~ (favicon.ico){\n        log_not_found off;\n        expires 100d;\n        access_log off;\n    }\n\n    # 静态文件设置过期时间\n    location ~* \\.(ico|css|js|gif|jpe?g|png)(\\?[0-9]+)?$ {\n        expires max;\n        break;\n    }\n\n    # proxy the PHP scripts to Apache listening on 127.0.0.1:80\n    #\n    #location ~ \\.php$ {\n    #    proxy_pass   http:\/\/127.0.0.1;\n    #}\n\n    # pass the PHP scripts to FastCGI server listening on 127.0.0.1:9000\n    #\n    location ~ \\.php$ {\n        if ($request_uri ~* test\\.php\\?a=b)\n        {\n            rewrite \/test.php?(.*) \/phpinfo.php?$1 break;\n        }\n\n        include        fastcgi_params;\n        fastcgi_pass   127.0.0.1:9000;\n        fastcgi_param  SCRIPT_FILENAME  $document_root$fastcgi_script_name;\n        fastcgi_index  index.php;\n    }\n\n    location \/nginx_status {\n        stub_status on;\n        access_log   off;\n        #allow  10.2.48.0\/24;\n        #deny all;\n    }\n\n    # deny access to .htaccess files, if Apache's document root\n    # concurs with nginx's one\n    #\n    #location ~ \/\\.ht {\n    #    deny  all;\n    #}\n}\n<commit_msg>识别移动设备 :dragon_face:<commit_after>server {\n    listen       80;\n    server_name  dev.cc localhost;\n\n    root html;\n    #access_log  logs\/dev.access.log  main;\n    access_log  logs\/dev.access.log  dev;\n\n    # 识别移动设备\n    if ($http_user_agent ~ (iPhone|iPad|Android))\n    {\n        rewrite ^\/(.*)$ http:\/\/m.dev.cc\/$1 break;\n    }\n\n    location \/ {\n        index index.php index.html index.htm;\n\n        # 对 IE 进行限速\n        if ($http_user_agent ~ \"MSIE\") {\n            limit_rate 1k;\n        }\n    }\n\n    #error_page  404              \/404.html;\n\n    # redirect server error pages to the static page \/50x.html\n    #\n    error_page   500 502 503 504  \/50x.html;\n    location = \/50x.html {\n        root   html;\n    }\n\n    # 静态文件代理\n    location ~ \/static\/ {\n        rewrite \"^\/static\/(.*)$\" \/static\/$1 break;\n    }\n\n    # 不记录 favicon.ico 错误日志\n    location ~ (favicon.ico){\n        log_not_found off;\n        expires 100d;\n        access_log off;\n    }\n\n    # 静态文件设置过期时间\n    location ~* \\.(ico|css|js|gif|jpe?g|png)(\\?[0-9]+)?$ {\n        expires max;\n        break;\n    }\n\n    # proxy the PHP scripts to Apache listening on 127.0.0.1:80\n    #\n    #location ~ \\.php$ {\n    #    proxy_pass   http:\/\/127.0.0.1;\n    #}\n\n    # pass the PHP scripts to FastCGI server listening on 127.0.0.1:9000\n    #\n    location ~ \\.php$ {\n        if ($request_uri ~* test\\.php\\?a=b)\n        {\n            rewrite \/test.php?(.*) \/phpinfo.php?$1 break;\n        }\n\n        include        fastcgi_params;\n        fastcgi_pass   127.0.0.1:9000;\n        fastcgi_param  SCRIPT_FILENAME  $document_root$fastcgi_script_name;\n        fastcgi_index  index.php;\n    }\n\n    location \/nginx_status {\n        stub_status on;\n        access_log   off;\n        #allow  10.2.48.0\/24;\n        #deny all;\n    }\n\n    # deny access to .htaccess files, if Apache's document root\n    # concurs with nginx's one\n    #\n    #location ~ \/\\.ht {\n    #    deny  all;\n    #}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: doclinkdialog.cxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 04:18: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_svx.hxx\"\n\n#ifdef SVX_DLLIMPLEMENTATION\n#undef SVX_DLLIMPLEMENTATION\n#endif\n\n#ifndef _SVX_DOCLINKDIALOG_HXX_\n#include \"doclinkdialog.hxx\"\n#endif\n#ifndef _SVX_DOCLINKDIALOG_HRC_\n#include \"doclinkdialog.hrc\"\n#endif\n#include \"dialogs.hrc\"\n#include \"svxids.hrc\"\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n#ifndef SVTOOLS_FILENOTATION_HXX_\n#include <svtools\/filenotation.hxx>\n#endif\n#ifndef _SV_MSGBOX_HXX\n#include <vcl\/msgbox.hxx>\n#endif\n#ifndef _UCBHELPER_CONTENT_HXX\n#include <ucbhelper\/content.hxx>\n#endif\n#include \"dialmgr.hxx\"\n#ifndef _URLOBJ_HXX\n#include <tools\/urlobj.hxx>\n#endif\n#ifndef _FILEDLGHELPER_HXX\n#include <sfx2\/filedlghelper.hxx>\n#endif\n#ifndef _SFX_DOCFILT_HACK_HXX\n#include <sfx2\/docfilt.hxx>\n#endif\n\/\/......................................................................\nnamespace svx\n{\n\/\/......................................................................\n\n    using namespace ::com::sun::star::uno;\n    using namespace ::com::sun::star::ucb;\n    using namespace ::svt;\n\n    \/\/==================================================================\n    \/\/= ODocumentLinkDialog\n    \/\/==================================================================\n    \/\/------------------------------------------------------------------\n    ODocumentLinkDialog::ODocumentLinkDialog( Window* _pParent, sal_Bool _bCreateNew )\n        :ModalDialog( _pParent, SVX_RES(DLG_DOCUMENTLINK) )\n        ,m_aURLLabel        (this, ResId(FT_URL))\n        ,m_aURL             (this, ResId(CMB_URL))\n        ,m_aBrowseFile      (this, ResId(PB_BROWSEFILE))\n        ,m_aNameLabel       (this, ResId(FT_NAME))\n        ,m_aName            (this, ResId(ET_NAME))\n        ,m_aBottomLine      (this, ResId(FL_BOTTOM))\n        ,m_aOK              (this, ResId(BTN_OK))\n        ,m_aCancel          (this, ResId(BTN_CANCEL))\n        ,m_aHelp            (this, ResId(BTN_HELP))\n        ,m_bCreatingNew(_bCreateNew)\n    {\n        String sText = String( ResId( m_bCreatingNew ? STR_NEW_LINK : STR_EDIT_LINK ) );\n        SetText(sText);\n\n        FreeResource();\n\n        String sTemp = String::CreateFromAscii(\"*.odb\");\n        m_aURL.SetFilter(sTemp);\n\n        m_aName.SetModifyHdl( LINK(this, ODocumentLinkDialog, OnTextModified) );\n        m_aURL.SetModifyHdl( LINK(this, ODocumentLinkDialog, OnTextModified) );\n        m_aBrowseFile.SetClickHdl( LINK(this, ODocumentLinkDialog, OnBrowseFile) );\n        m_aOK.SetClickHdl( LINK(this, ODocumentLinkDialog, OnOk) );\n\n        m_aURL.SetDropDownLineCount(10);\n\n        validate();\n\n        \/\/  m_aURL.SetHelpId( HID_DOCLINKEDIT_URL );\n        m_aURL.SetDropDownLineCount( 5 );\n    }\n\n    \/\/------------------------------------------------------------------\n    void ODocumentLinkDialog::set( const String& _rName, const String& _rURL )\n    {\n        m_aName.SetText(_rName);\n        m_aURL.SetText(_rURL);\n        validate();\n    }\n\n    \/\/------------------------------------------------------------------\n    void ODocumentLinkDialog::get( String& _rName, String& _rURL ) const\n    {\n        _rName = m_aName.GetText();\n        _rURL = m_aURL.GetText();\n    }\n\n    \/\/------------------------------------------------------------------\n    void ODocumentLinkDialog::validate( )\n    {\n\n        m_aOK.Enable( (0 != m_aName.GetText().Len()) && ( 0 != m_aURL.GetText().Len() ) );\n    }\n\n    \/\/------------------------------------------------------------------\n    IMPL_LINK( ODocumentLinkDialog, OnOk, void*, EMPTYARG )\n    {\n        \/\/ get the current URL\n        ::rtl::OUString sURL = m_aURL.GetText();\n        OFileNotation aTransformer(sURL);\n        sURL = aTransformer.get(OFileNotation::N_URL);\n\n        \/\/ check for the existence of the selected file\n        sal_Bool bFileExists = sal_False;\n        try\n        {\n            ::ucb::Content aFile(sURL, Reference< XCommandEnvironment >());\n            if (aFile.isDocument())\n                bFileExists = sal_True;\n        }\n        catch(Exception&)\n        {\n        }\n\n        if (!bFileExists)\n        {\n            String sMsg = String(SVX_RES(STR_LINKEDDOC_DOESNOTEXIST));\n            sMsg.SearchAndReplaceAscii(\"$file$\", m_aURL.GetText());\n            ErrorBox aError(this, WB_OK , sMsg);\n            aError.Execute();\n            return 0L;\n        } \/\/ if (!bFileExists)\n        String sCurrentText = m_aName.GetText();\n        if ( m_aNameValidator.IsSet() )\n        {\n            if ( !m_aNameValidator.Call( &sCurrentText ) )\n            {\n                String sMsg = String(SVX_RES(STR_NAME_CONFLICT));\n                sMsg.SearchAndReplaceAscii(\"$file$\", sCurrentText);\n                InfoBox aError(this, sMsg);\n                aError.Execute();\n\n                m_aName.SetSelection(Selection(0,sCurrentText.Len()));\n                m_aName.GrabFocus();\n                return 0L;\n            }\n        }\n\n        EndDialog(RET_OK);\n        return 0L;\n    }\n\n    \/\/------------------------------------------------------------------\n    IMPL_LINK( ODocumentLinkDialog, OnBrowseFile, void*, EMPTYARG )\n    {\n        ::sfx2::FileDialogHelper aFileDlg(WB_3DLOOK | WB_STDMODAL | WB_OPEN);\n        static const String s_sDatabaseType = String::CreateFromAscii(\"StarOffice XML (Base)\");\n        const SfxFilter* pFilter = SfxFilter::GetFilterByName( s_sDatabaseType);\n        if ( pFilter )\n        {\n            aFileDlg.AddFilter(pFilter->GetUIName(),pFilter->GetDefaultExtension());\n            aFileDlg.SetCurrentFilter(pFilter->GetUIName());\n        }\n\n        String sPath = m_aURL.GetText();\n        if (sPath.Len())\n        {\n            OFileNotation aTransformer( sPath, OFileNotation::N_SYSTEM );\n            aFileDlg.SetDisplayDirectory( aTransformer.get( OFileNotation::N_URL ) );\n        }\n\n        if (0 != aFileDlg.Execute())\n            return 0L;\n\n        if (0 == m_aName.GetText().Len())\n        {   \/\/ default the name to the base of the chosen URL\n            INetURLObject aParser;\n\n            aParser.SetSmartProtocol(INET_PROT_FILE);\n            aParser.SetSmartURL(aFileDlg.GetPath());\n\n            m_aName.SetText(aParser.getBase(INetURLObject::LAST_SEGMENT, true, INetURLObject::DECODE_WITH_CHARSET));\n\n            m_aName.SetSelection(Selection(0,m_aName.GetText().Len()));\n            m_aName.GrabFocus();\n        }\n        else\n            m_aURL.GrabFocus();\n\n        \/\/ get the path in system notation\n        OFileNotation aTransformer(aFileDlg.GetPath(), OFileNotation::N_URL);\n        m_aURL.SetText(aTransformer.get(OFileNotation::N_SYSTEM));\n\n        validate();\n        return 0L;\n    }\n\n    \/\/------------------------------------------------------------------\n    IMPL_LINK( ODocumentLinkDialog, OnTextModified, Control*, EMPTYARG )\n    {\n        validate( );\n        return 0L;\n    }\n\n\/\/......................................................................\n}   \/\/ namespace svx\n\/\/......................................................................\n\n<commit_msg>INTEGRATION: CWS residcleanup (1.8.262); FILE MERGED 2007\/02\/21 22:04:06 pl 1.8.262.1: #i74635# get rid of global ResMgr<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: doclinkdialog.cxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: rt $ $Date: 2007-04-26 07:29: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_svx.hxx\"\n\n#ifdef SVX_DLLIMPLEMENTATION\n#undef SVX_DLLIMPLEMENTATION\n#endif\n\n#ifndef _SVX_DOCLINKDIALOG_HXX_\n#include \"doclinkdialog.hxx\"\n#endif\n#ifndef _SVX_DOCLINKDIALOG_HRC_\n#include \"doclinkdialog.hrc\"\n#endif\n#include \"dialogs.hrc\"\n#include \"svxids.hrc\"\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n#ifndef SVTOOLS_FILENOTATION_HXX_\n#include <svtools\/filenotation.hxx>\n#endif\n#ifndef _SV_MSGBOX_HXX\n#include <vcl\/msgbox.hxx>\n#endif\n#ifndef _UCBHELPER_CONTENT_HXX\n#include <ucbhelper\/content.hxx>\n#endif\n#include \"dialmgr.hxx\"\n#ifndef _URLOBJ_HXX\n#include <tools\/urlobj.hxx>\n#endif\n#ifndef _FILEDLGHELPER_HXX\n#include <sfx2\/filedlghelper.hxx>\n#endif\n#ifndef _SFX_DOCFILT_HACK_HXX\n#include <sfx2\/docfilt.hxx>\n#endif\n\/\/......................................................................\nnamespace svx\n{\n\/\/......................................................................\n\n    using namespace ::com::sun::star::uno;\n    using namespace ::com::sun::star::ucb;\n    using namespace ::svt;\n\n    \/\/==================================================================\n    \/\/= ODocumentLinkDialog\n    \/\/==================================================================\n    \/\/------------------------------------------------------------------\n    ODocumentLinkDialog::ODocumentLinkDialog( Window* _pParent, sal_Bool _bCreateNew )\n        :ModalDialog( _pParent, SVX_RES(DLG_DOCUMENTLINK) )\n        ,m_aURLLabel        (this, SVX_RES(FT_URL))\n        ,m_aURL             (this, SVX_RES(CMB_URL))\n        ,m_aBrowseFile      (this, SVX_RES(PB_BROWSEFILE))\n        ,m_aNameLabel       (this, SVX_RES(FT_NAME))\n        ,m_aName            (this, SVX_RES(ET_NAME))\n        ,m_aBottomLine      (this, SVX_RES(FL_BOTTOM))\n        ,m_aOK              (this, SVX_RES(BTN_OK))\n        ,m_aCancel          (this, SVX_RES(BTN_CANCEL))\n        ,m_aHelp            (this, SVX_RES(BTN_HELP))\n        ,m_bCreatingNew(_bCreateNew)\n    {\n        String sText = String( SVX_RES( m_bCreatingNew ? STR_NEW_LINK : STR_EDIT_LINK ) );\n        SetText(sText);\n\n        FreeResource();\n\n        String sTemp = String::CreateFromAscii(\"*.odb\");\n        m_aURL.SetFilter(sTemp);\n\n        m_aName.SetModifyHdl( LINK(this, ODocumentLinkDialog, OnTextModified) );\n        m_aURL.SetModifyHdl( LINK(this, ODocumentLinkDialog, OnTextModified) );\n        m_aBrowseFile.SetClickHdl( LINK(this, ODocumentLinkDialog, OnBrowseFile) );\n        m_aOK.SetClickHdl( LINK(this, ODocumentLinkDialog, OnOk) );\n\n        m_aURL.SetDropDownLineCount(10);\n\n        validate();\n\n        \/\/  m_aURL.SetHelpId( HID_DOCLINKEDIT_URL );\n        m_aURL.SetDropDownLineCount( 5 );\n    }\n\n    \/\/------------------------------------------------------------------\n    void ODocumentLinkDialog::set( const String& _rName, const String& _rURL )\n    {\n        m_aName.SetText(_rName);\n        m_aURL.SetText(_rURL);\n        validate();\n    }\n\n    \/\/------------------------------------------------------------------\n    void ODocumentLinkDialog::get( String& _rName, String& _rURL ) const\n    {\n        _rName = m_aName.GetText();\n        _rURL = m_aURL.GetText();\n    }\n\n    \/\/------------------------------------------------------------------\n    void ODocumentLinkDialog::validate( )\n    {\n\n        m_aOK.Enable( (0 != m_aName.GetText().Len()) && ( 0 != m_aURL.GetText().Len() ) );\n    }\n\n    \/\/------------------------------------------------------------------\n    IMPL_LINK( ODocumentLinkDialog, OnOk, void*, EMPTYARG )\n    {\n        \/\/ get the current URL\n        ::rtl::OUString sURL = m_aURL.GetText();\n        OFileNotation aTransformer(sURL);\n        sURL = aTransformer.get(OFileNotation::N_URL);\n\n        \/\/ check for the existence of the selected file\n        sal_Bool bFileExists = sal_False;\n        try\n        {\n            ::ucb::Content aFile(sURL, Reference< XCommandEnvironment >());\n            if (aFile.isDocument())\n                bFileExists = sal_True;\n        }\n        catch(Exception&)\n        {\n        }\n\n        if (!bFileExists)\n        {\n            String sMsg = String(SVX_RES(STR_LINKEDDOC_DOESNOTEXIST));\n            sMsg.SearchAndReplaceAscii(\"$file$\", m_aURL.GetText());\n            ErrorBox aError(this, WB_OK , sMsg);\n            aError.Execute();\n            return 0L;\n        } \/\/ if (!bFileExists)\n        String sCurrentText = m_aName.GetText();\n        if ( m_aNameValidator.IsSet() )\n        {\n            if ( !m_aNameValidator.Call( &sCurrentText ) )\n            {\n                String sMsg = String(SVX_RES(STR_NAME_CONFLICT));\n                sMsg.SearchAndReplaceAscii(\"$file$\", sCurrentText);\n                InfoBox aError(this, sMsg);\n                aError.Execute();\n\n                m_aName.SetSelection(Selection(0,sCurrentText.Len()));\n                m_aName.GrabFocus();\n                return 0L;\n            }\n        }\n\n        EndDialog(RET_OK);\n        return 0L;\n    }\n\n    \/\/------------------------------------------------------------------\n    IMPL_LINK( ODocumentLinkDialog, OnBrowseFile, void*, EMPTYARG )\n    {\n        ::sfx2::FileDialogHelper aFileDlg(WB_3DLOOK | WB_STDMODAL | WB_OPEN);\n        static const String s_sDatabaseType = String::CreateFromAscii(\"StarOffice XML (Base)\");\n        const SfxFilter* pFilter = SfxFilter::GetFilterByName( s_sDatabaseType);\n        if ( pFilter )\n        {\n            aFileDlg.AddFilter(pFilter->GetUIName(),pFilter->GetDefaultExtension());\n            aFileDlg.SetCurrentFilter(pFilter->GetUIName());\n        }\n\n        String sPath = m_aURL.GetText();\n        if (sPath.Len())\n        {\n            OFileNotation aTransformer( sPath, OFileNotation::N_SYSTEM );\n            aFileDlg.SetDisplayDirectory( aTransformer.get( OFileNotation::N_URL ) );\n        }\n\n        if (0 != aFileDlg.Execute())\n            return 0L;\n\n        if (0 == m_aName.GetText().Len())\n        {   \/\/ default the name to the base of the chosen URL\n            INetURLObject aParser;\n\n            aParser.SetSmartProtocol(INET_PROT_FILE);\n            aParser.SetSmartURL(aFileDlg.GetPath());\n\n            m_aName.SetText(aParser.getBase(INetURLObject::LAST_SEGMENT, true, INetURLObject::DECODE_WITH_CHARSET));\n\n            m_aName.SetSelection(Selection(0,m_aName.GetText().Len()));\n            m_aName.GrabFocus();\n        }\n        else\n            m_aURL.GrabFocus();\n\n        \/\/ get the path in system notation\n        OFileNotation aTransformer(aFileDlg.GetPath(), OFileNotation::N_URL);\n        m_aURL.SetText(aTransformer.get(OFileNotation::N_SYSTEM));\n\n        validate();\n        return 0L;\n    }\n\n    \/\/------------------------------------------------------------------\n    IMPL_LINK( ODocumentLinkDialog, OnTextModified, Control*, EMPTYARG )\n    {\n        validate( );\n        return 0L;\n    }\n\n\/\/......................................................................\n}   \/\/ namespace svx\n\/\/......................................................................\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: RefreshListenerContainer.hxx,v $\n *\n *  $Revision: 1.1 $\n *\n *  last change: $Author: mtg $ $Date: 2001-06-26 11:45: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): Martin Gallwey (gallwey@sun.com)\n *\n *\n ************************************************************************\/\n#ifndef _REFRESH_LISTENER_CONTAINER_HXX_\n#define _REFRESH_LISTENER_CONTAINER_HXX_\n\n#ifndef _UNOEVTLSTNR_HXX\n#include <unoevtlstnr.hxx>\n#endif\n\nclass SwRefreshListenerContainer : public SwEventListenerContainer\n{\npublic:\n    SwRefreshListenerContainer( ::com::sun::star::uno::XInterface* pxParent);\n    void Refreshed();\n};\n#endif\n<commit_msg>INTEGRATION: CWS ooo19126 (1.1.1446); FILE MERGED 2005\/09\/05 13:35:32 rt 1.1.1446.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: RefreshListenerContainer.hxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 01:28: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 _REFRESH_LISTENER_CONTAINER_HXX_\n#define _REFRESH_LISTENER_CONTAINER_HXX_\n\n#ifndef _UNOEVTLSTNR_HXX\n#include <unoevtlstnr.hxx>\n#endif\n\nclass SwRefreshListenerContainer : public SwEventListenerContainer\n{\npublic:\n    SwRefreshListenerContainer( ::com::sun::star::uno::XInterface* pxParent);\n    void Refreshed();\n};\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file neons.cpp\n *\n * @date Nov 20, 2012\n * @author partio\n *\/\n\n#include \"neons.h\"\n#include \"logger_factory.h\"\n#include \"plugin_factory.h\"\n#include <thread>\n#include <sstream>\n#include \"util.h\"\n\nusing namespace std;\nusing namespace himan::plugin;\n\nconst int MAX_WORKERS = 16;\nonce_flag oflag;\n\nneons::neons() : itsInit(false), itsNeonsDB()\n{\n\titsLogger = unique_ptr<logger> (logger_factory::Instance()->GetLog(\"neons\"));\n\t\n\t\/\/ no lambda functions for gcc 4.4 :(\n\t\/\/ call_once(oflag, [](){ NFmiNeonsDBPool::MaxWorkers(MAX_WORKERS); });\n\n\tcall_once(oflag, &himan::plugin::neons::InitPool, this);\n}\n\nvoid neons::InitPool()\n{\n\tNFmiNeonsDBPool::Instance()->MaxWorkers(MAX_WORKERS);\n\n\tchar* host;\n\n\thost = getenv(\"HOSTNAME\");\n\n\t\/\/ TODO: a smarter way to check if we are in production server\n\n\tif (host != NULL)\n\t{\n\t\tif (string(host) == \"gogol.fmi.fi\" || string(host) == \"tolstoi.fmi.fi\")\n\t\t{\n\t\t\tNFmiNeonsDBPool::Instance()->ExternalAuthentication(true);\n\t\t\tNFmiNeonsDBPool::Instance()->ReadWriteTransaction(true);\n\t\t}\n\t\telse if (string(host) == \"jeera.fmi.fi\" || string(host) == \"sahrami.fmi.fi\")\n\t\t{\n\t\t\tNFmiNeonsDBPool::Instance()->ReadWriteTransaction(true);\n\t\t\tNFmiNeonsDBPool::Instance()->Username(\"wetodb\");\n\t\t\tNFmiNeonsDBPool::Instance()->Password(\"3loHRgdio\");\n\t\t}\n\t}\n}\n\nvector<string> neons::Files(const search_options& options)\n{\n\n\tInit();\n\n\tvector<string> files;\n\n\tstring analtime = options.time.OriginDateTime()->String(\"%Y%m%d%H%M%S\");\n\tstring levelvalue = boost::lexical_cast<string> (options.level.Value());\n\n\tstring ref_prod = options.prod.Name();\n\tlong no_vers = options.prod.TableVersion();\n\n\tstring level_name = HPLevelTypeToString.at(options.level.Type());\n\t\n\tvector<vector<string> > gridgeoms = itsNeonsDB->GetGridGeoms(ref_prod, analtime, options.configuration->SourceGeomName());\n\n\tif (gridgeoms.empty())\n\t{\n\t\titsLogger->Warning(\"No geometries found for given search options\");\n\t\treturn files;\n\t}\n\n\tfor (size_t i = 0; i < gridgeoms.size(); i++)\n\t{\n\t\tstring tablename = gridgeoms[i][1];\n\t\tstring dset = gridgeoms[i][2];\n\n\t\t\/\/\/ @todo GFS (or in fact codetable 2) has wrong temperature parameter defined\n\n\t\tstring parm_name = options.param.Name();\n\n\t\tif (parm_name == \"T-K\" && no_vers == 2)\n\t\t{\n\t\t \tparm_name = \"T-C\";\n\t\t}\n\n\t\tstring query = \"SELECT parm_name, lvl_type, lvl1_lvl2, fcst_per, file_location, file_server \"\n\t\t\t\t   \"FROM \"+tablename+\" \"\n\t\t\t\t   \"WHERE dset_id = \"+dset+\" \"\n\t\t\t\t   \"AND parm_name = upper('\"+parm_name+\"') \"\n\t\t\t\t   \"AND lvl_type = upper('\"+level_name+\"') \"\n\t\t\t\t   \"AND lvl1_lvl2 = \" +levelvalue+\" \"\n\t\t\t\t   \"AND fcst_per = \"+boost::lexical_cast<string> (options.time.Step())+\" \"\n\t\t\t\t   \"ORDER BY dset_id, fcst_per, lvl_type, lvl1_lvl2\";\n\n\t\titsNeonsDB->Query(query);\n\n\t\tvector<string> values = itsNeonsDB->FetchRow();\n\n\t\tif (values.empty())\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\titsLogger->Trace(\"Found data for parameter \" + parm_name + \" from neons geometry \" + gridgeoms[i][0]);\n\t\t\n\t\tfiles.push_back(values[4]);\n\n\t}\n\n\treturn files;\n\n}\n\nbool neons::Save(shared_ptr<const info> resultInfo, const string& theFileName)\n{\n\tInit();\n\n\tstringstream query;\n\n\t\/*\n\t * 1. Get grid information\n\t * 2. Get model information\n\t * 3. Get data set information (ie model run)\n\t * 4. Insert or update\n\t *\/\n\n\thiman::point firstGridPoint = resultInfo->Grid()->FirstGridPoint();\n\n\t\/*\n\t * pas_latitude and pas_longitude cannot be checked programmatically\n\t * since f.ex. in the case for GFS in neons we have value 500 and\n\t * by calculating we have value 498. But not check these columns should\n\t * not matter as long as row_cnt, col_cnt, lat_orig and lon_orig match\n\t * (since pas_latitude and pas_longitude are derived from these anyway)\n\t *\/\n\n\tquery \t<< \"SELECT geom_name \"\n\t\t\t<< \"FROM grid_reg_geom \"\n\t\t\t<< \"WHERE row_cnt = \" << resultInfo->Nj()\n\t\t\t<< \" AND col_cnt = \" << resultInfo->Ni()\n\t\t\t<< \" AND lat_orig = \" << (firstGridPoint.Y() * 1e3)\n\t\t\t<< \" AND long_orig = \" << (firstGridPoint.X() * 1e3);\n\/\/\t\t\t<< \" AND pas_latitude = \" << static_cast<long> (resultInfo->Dj() * 1e3)\n\/\/\t\t\t<< \" AND pas_longitude = \" << static_cast<long> (resultInfo->Di() * 1e3);\n\n\titsNeonsDB->Query(query.str());\n\n\tvector<string> row;\n\n\trow = itsNeonsDB->FetchRow();\n\n\tif (row.empty())\n\t{\n\t\titsLogger->Warning(\"Grid geometry not found from neons\");\n\t\treturn false;\n\t}\n\n\tstring geom_name = row[0];\n\n\tquery.str(\"\");\n\n\tquery \t<< \"SELECT \"\n\t\t\t<< \"nu.model_id AS process, \"\n\t\t\t<< \"nu.ident_id AS centre, \"\n\t\t\t<< \"m.model_name, \"\n\t\t\t<< \"m.model_type, \"\n\t\t\t<< \"type_smt \"\n\t\t\t<< \"FROM \"\n\t\t\t<< \"grid_num_model_grib nu, \"\n\t\t\t<< \"grid_model m, \"\n\t\t\t<< \"grid_model_name na, \"\n\t\t\t<< \"fmi_producers f \"\n\t\t\t<< \"WHERE f.producer_id = \" << resultInfo->Producer().Id()\n\t\t\t<< \" AND m.model_type = f.ref_prod \"\n\t\t\t<< \" AND nu.model_name = m.model_name \"\n\t\t\t<< \" AND m.flag_mod = 0 \"\n\t\t\t<< \" AND nu.model_name = na.model_name \"\n\t\t\t<< \" AND m.model_name = na.model_name \";\n\n\titsNeonsDB->Query(query.str());\n\n\trow = itsNeonsDB->FetchRow();\n\n\tif (row.empty())\n\t{\n\t\titsLogger->Warning(\"Producer definition not found from neons (id: \" + boost::lexical_cast<string> (resultInfo->Producer().Id()) + \")\");\n\t\treturn false;\n\t}\n\n\tstring process = row[0];\n\n\t\/\/string centre = row[1];\n\t\/\/string model_name = row[2];\n\tstring model_type = row[3];\n\n\t\/*\n\t\tquery \t<< \"SELECT \"\n\t\t\t\t<< \"m.model_name, \"\n\t\t\t\t<< \"model_type, \"\n\t\t\t\t<< \"type_smt \"\n\t\t\t\t<< \"FROM grid_num_model_grib nu, \"\n\t\t\t\t<< \"grid_model m, \"\n\t\t\t\t<< \"grid_model_name na \"\n\t\t\t\t<< \"WHERE nu.model_id = \" << info.process\n\t\t\t\t<< \" AND nu.ident_id = \" << info.centre\n\t\t\t\t<< \" AND m.flag_mod = 0 \"\n\t\t\t\t<< \" AND nu.model_name = na.model_name \"\n\t\t\t\t<< \" AND m.model_name = na.model_name\";\n\n\t*\/\n\n\tquery.str(\"\");\n\n\tquery\t<< \"SELECT \"\n\t\t\t<< \"dset_id, \"\n\t\t\t<< \"table_name, \"\n\t\t\t<< \"rec_cnt_dset \"\n\t\t\t<< \"FROM as_grid \"\n\t\t\t<< \"WHERE \"\n\t\t\t<< \"model_type = '\" << model_type << \"'\"\n\t\t\t<< \" AND geom_name = '\" << geom_name << \"'\"\n\t\t\t<< \" AND dset_name = 'AF'\"\n\t\t\t<< \" AND base_date = '\" << resultInfo->OriginDateTime().String(\"%Y%m%d%H%M\") << \"'\";\n\n\titsNeonsDB->Query(query.str());\n\n\trow = itsNeonsDB->FetchRow();\n\n\tif (row.empty())\n\t{\n\t\titsLogger->Warning(\"Data set definition not found from neons\");\n\t\treturn false;\n\t}\n\n\tstring table_name = row[1];\n\tstring dset_id = row[0];\n\n\tstring eps_specifier = \"0\";\n\n\tquery.str(\"\");\n\n\tquery << \"UPDATE as_grid \"\n\t\t   << \"SET rec_cnt_dset = \"\n\t\t   << \"rec_cnt_dset + 1, \"\n\t\t   << \"date_maj_dset = sysdate \"\n\t\t   << \"WHERE dset_id = \" << dset_id;\n\n\ttry\n\t{\n\t\titsNeonsDB->Execute(query.str());\n\t}\n\tcatch (int e)\n\t{\n\t   itsLogger->Error(\"Error code: \" + boost::lexical_cast<string> (e));\n\t   itsLogger->Error(\"Query: \" + query.str());\n   \t   itsNeonsDB->Rollback();\n   \t   return false;\n\t}\n\n\tquery.str(\"\");\n\n\tstring host = \"undetermined host\";\n\n\tchar* hostname = getenv(\"HOSTNAME\");\n\n\tif (hostname != NULL)\n\t{\n\t\thost = string(hostname);\n\t}\n\n\t\/*\n\t * We have our own error loggings for unique key violations\n\t *\/\n\t\n\titsNeonsDB->Verbose(false);\n\t\n\tquery  << \"INSERT INTO \" << table_name\n\t\t   << \" (dset_id, parm_name, lvl_type, lvl1_lvl2, fcst_per, eps_specifier, file_location, file_server) \"\n\t\t   << \"VALUES (\"\n\t\t   << dset_id << \", \"\n\t\t   << \"'\" << resultInfo->Param().Name() << \"', \"\n\t\t   << \"upper('\" << HPLevelTypeToString.at(resultInfo->Level().Type()) << \"'), \"\n\t\t   << resultInfo->Level().Value() << \", \"\n\t\t   << resultInfo->Time().Step() << \", \"\n\t\t   << \"'\" << eps_specifier << \"', \"\n\t\t   << \"'\" << theFileName << \"', \"\n\t\t   << \"'\" << host << \"')\";\n\n\n\ttry\n\t{\n\t\titsNeonsDB->Execute(query.str());\n\t\titsNeonsDB->Commit();\n\t}\n\tcatch (int e)\n\t{\n\t\tif (e == 1)\n\t\t{\n\t\t\t\/\/ unique key violation\n\t\t\t\n\t\t\ttry\n\t\t\t{\n\n\t\t\t\t\/*\n\t\t\t\t * Neons table definition has invalid primary key definition:\n\t\t\t\t *\n\t\t\t\t * file_location and file_server are a part of the primary key meaning that\n\t\t\t\t * a table can have multiple versions of a single file from multiple servers.\n\t\t\t\t * This is unfortunate and to bypass it we must first delete all versions\n\t\t\t\t * of the file and then INSERT again.\n\t\t\t\t *\/\n\n\t\t\t\tquery.str(\"\");\n\n\t\t\t\tquery\t<< \"DELETE FROM \" << table_name << \" WHERE \"\n\t\t\t\t\t\t<< \"dset_id = \" << dset_id\n\t\t\t\t\t\t<< \" AND parm_name = '\" << resultInfo->Param().Name() << \"'\"\n\t\t\t\t\t\t<< \" AND lvl_type = upper('\" << HPLevelTypeToString.at(resultInfo->Level().Type()) << \"')\"\n\t\t\t\t\t\t<< \" AND lvl1_lvl2 = \" << resultInfo->Level().Value()\n\t\t\t\t\t\t<< \" AND fcst_per = \" << resultInfo->Time().Step();\n\n\t\t\t\titsNeonsDB->Execute(query.str());\n\t\t\t\t\n\t\t\t\tquery.str(\"\");\n\n\t\t\t\tquery\t<< \"INSERT INTO \" << table_name\n\t\t\t\t\t\t<< \" (dset_id, parm_name, lvl_type, lvl1_lvl2, fcst_per, eps_specifier, file_location, file_server) \"\n\t\t\t\t\t\t<< \"VALUES (\"\n\t\t\t\t\t\t<< dset_id << \", \"\n\t\t\t\t\t\t<< \"'\" << resultInfo->Param().Name() << \"', \"\n\t\t\t\t\t\t<< \"upper('\" << HPLevelTypeToString.at(resultInfo->Level().Type()) << \"'), \"\n\t\t\t\t\t\t<< resultInfo->Level().Value() << \", \"\n\t\t\t\t\t\t<< resultInfo->Time().Step() << \", \"\n\t\t\t\t\t\t<< \"'\" << eps_specifier << \"', \"\n\t\t\t\t\t\t<< \"'\" << theFileName << \"', \"\n\t\t\t\t\t\t<< \"'\" << host << \"')\";\n\n\t\t\t\titsNeonsDB->Execute(query.str());\n\n\t\t\t\titsNeonsDB->Commit();\n\t\t\t\t\n\t\t\t}\n\t\t\tcatch (int e)\n\t\t\t{\n\t\t\t\titsLogger->Fatal(\"Error code: \" + boost::lexical_cast<string> (e));\n\t\t\t\titsLogger->Fatal(\"Query: \" + query.str());\n\n\t\t\t\titsNeonsDB->Rollback();\n\n\t\t\t\texit(1);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\titsLogger->Error(\"Error code: \" + boost::lexical_cast<string> (e));\n\t\t\titsLogger->Error(\"Query: \" + query.str());\n\n\t\t\titsNeonsDB->Rollback();\n\n\t\t\treturn false;\n\t\t}\n\t}\n\n\titsLogger->Info(\"Saved information on file '\" + theFileName + \"' to neons\");\n\n\treturn true;\n}\n\nstring neons::GribParameterName(long fmiParameterId, long codeTableVersion)\n{\t\n\tInit();\n\t\n\tstring paramName = itsNeonsDB->GetGridParameterName(fmiParameterId, codeTableVersion, codeTableVersion);\n\treturn paramName; \n\t\n}\n\nstring neons::GribParameterName(long fmiParameterId, long category, long discipline, long producer)\n{\n\tInit();\n\t\n\tstring paramName = itsNeonsDB->GetGridParameterName(fmiParameterId, category, discipline, producer);\n\treturn paramName;   \n}\n<commit_msg>Detect routine machines not based on hostname but on user id and env variable MASALA_BASE. Also remove support for gorki.<commit_after>\/**\n * @file neons.cpp\n *\n * @date Nov 20, 2012\n * @author partio\n *\/\n\n#include \"neons.h\"\n#include \"logger_factory.h\"\n#include \"plugin_factory.h\"\n#include <thread>\n#include <sstream>\n#include \"util.h\"\n#include \"unistd.h\" \/\/ getuid())\n\nusing namespace std;\nusing namespace himan::plugin;\n\nconst int MAX_WORKERS = 16;\nonce_flag oflag;\n\nneons::neons() : itsInit(false), itsNeonsDB()\n{\n\titsLogger = unique_ptr<logger> (logger_factory::Instance()->GetLog(\"neons\"));\n\t\n\t\/\/ no lambda functions for gcc 4.4 :(\n\t\/\/ call_once(oflag, [](){ NFmiNeonsDBPool::MaxWorkers(MAX_WORKERS); });\n\n\tcall_once(oflag, &himan::plugin::neons::InitPool, this);\n}\n\nvoid neons::InitPool()\n{\n\tNFmiNeonsDBPool::Instance()->MaxWorkers(MAX_WORKERS);\n\n\tuid_t uid = getuid();\n\t\n\tif (uid == 1459) \/\/ weto\n\t{\n\t\tchar* base = getenv(\"MASALA_BASE\");\n\n\t\tif (string(base) == \"\/masala\")\n\t\t{\n\t\t\tNFmiNeonsDBPool::Instance()->ReadWriteTransaction(true);\n\t\t\tNFmiNeonsDBPool::Instance()->Username(\"wetodb\");\n\t\t\tNFmiNeonsDBPool::Instance()->Password(\"3loHRgdio\");\n\t\t}\n\t\telse\n\t\t{\n\t\t\titsLogger->Warning(\"Program executed as uid 1459 ('weto') but MASALA_BASE not set\");\n\t\t}\n\t}\n}\n\nvector<string> neons::Files(const search_options& options)\n{\n\n\tInit();\n\n\tvector<string> files;\n\n\tstring analtime = options.time.OriginDateTime()->String(\"%Y%m%d%H%M%S\");\n\tstring levelvalue = boost::lexical_cast<string> (options.level.Value());\n\n\tstring ref_prod = options.prod.Name();\n\tlong no_vers = options.prod.TableVersion();\n\n\tstring level_name = HPLevelTypeToString.at(options.level.Type());\n\t\n\tvector<vector<string> > gridgeoms = itsNeonsDB->GetGridGeoms(ref_prod, analtime, options.configuration->SourceGeomName());\n\n\tif (gridgeoms.empty())\n\t{\n\t\titsLogger->Warning(\"No geometries found for given search options\");\n\t\treturn files;\n\t}\n\n\tfor (size_t i = 0; i < gridgeoms.size(); i++)\n\t{\n\t\tstring tablename = gridgeoms[i][1];\n\t\tstring dset = gridgeoms[i][2];\n\n\t\t\/\/\/ @todo GFS (or in fact codetable 2) has wrong temperature parameter defined\n\n\t\tstring parm_name = options.param.Name();\n\n\t\tif (parm_name == \"T-K\" && no_vers == 2)\n\t\t{\n\t\t \tparm_name = \"T-C\";\n\t\t}\n\n\t\tstring query = \"SELECT parm_name, lvl_type, lvl1_lvl2, fcst_per, file_location, file_server \"\n\t\t\t\t   \"FROM \"+tablename+\" \"\n\t\t\t\t   \"WHERE dset_id = \"+dset+\" \"\n\t\t\t\t   \"AND parm_name = upper('\"+parm_name+\"') \"\n\t\t\t\t   \"AND lvl_type = upper('\"+level_name+\"') \"\n\t\t\t\t   \"AND lvl1_lvl2 = \" +levelvalue+\" \"\n\t\t\t\t   \"AND fcst_per = \"+boost::lexical_cast<string> (options.time.Step())+\" \"\n\t\t\t\t   \"ORDER BY dset_id, fcst_per, lvl_type, lvl1_lvl2\";\n\n\t\titsNeonsDB->Query(query);\n\n\t\tvector<string> values = itsNeonsDB->FetchRow();\n\n\t\tif (values.empty())\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\titsLogger->Trace(\"Found data for parameter \" + parm_name + \" from neons geometry \" + gridgeoms[i][0]);\n\t\t\n\t\tfiles.push_back(values[4]);\n\n\t}\n\n\treturn files;\n\n}\n\nbool neons::Save(shared_ptr<const info> resultInfo, const string& theFileName)\n{\n\tInit();\n\n\tstringstream query;\n\n\t\/*\n\t * 1. Get grid information\n\t * 2. Get model information\n\t * 3. Get data set information (ie model run)\n\t * 4. Insert or update\n\t *\/\n\n\thiman::point firstGridPoint = resultInfo->Grid()->FirstGridPoint();\n\n\t\/*\n\t * pas_latitude and pas_longitude cannot be checked programmatically\n\t * since f.ex. in the case for GFS in neons we have value 500 and\n\t * by calculating we have value 498. But not check these columns should\n\t * not matter as long as row_cnt, col_cnt, lat_orig and lon_orig match\n\t * (since pas_latitude and pas_longitude are derived from these anyway)\n\t *\/\n\n\tquery \t<< \"SELECT geom_name \"\n\t\t\t<< \"FROM grid_reg_geom \"\n\t\t\t<< \"WHERE row_cnt = \" << resultInfo->Nj()\n\t\t\t<< \" AND col_cnt = \" << resultInfo->Ni()\n\t\t\t<< \" AND lat_orig = \" << (firstGridPoint.Y() * 1e3)\n\t\t\t<< \" AND long_orig = \" << (firstGridPoint.X() * 1e3);\n\/\/\t\t\t<< \" AND pas_latitude = \" << static_cast<long> (resultInfo->Dj() * 1e3)\n\/\/\t\t\t<< \" AND pas_longitude = \" << static_cast<long> (resultInfo->Di() * 1e3);\n\n\titsNeonsDB->Query(query.str());\n\n\tvector<string> row;\n\n\trow = itsNeonsDB->FetchRow();\n\n\tif (row.empty())\n\t{\n\t\titsLogger->Warning(\"Grid geometry not found from neons\");\n\t\treturn false;\n\t}\n\n\tstring geom_name = row[0];\n\n\tquery.str(\"\");\n\n\tquery \t<< \"SELECT \"\n\t\t\t<< \"nu.model_id AS process, \"\n\t\t\t<< \"nu.ident_id AS centre, \"\n\t\t\t<< \"m.model_name, \"\n\t\t\t<< \"m.model_type, \"\n\t\t\t<< \"type_smt \"\n\t\t\t<< \"FROM \"\n\t\t\t<< \"grid_num_model_grib nu, \"\n\t\t\t<< \"grid_model m, \"\n\t\t\t<< \"grid_model_name na, \"\n\t\t\t<< \"fmi_producers f \"\n\t\t\t<< \"WHERE f.producer_id = \" << resultInfo->Producer().Id()\n\t\t\t<< \" AND m.model_type = f.ref_prod \"\n\t\t\t<< \" AND nu.model_name = m.model_name \"\n\t\t\t<< \" AND m.flag_mod = 0 \"\n\t\t\t<< \" AND nu.model_name = na.model_name \"\n\t\t\t<< \" AND m.model_name = na.model_name \";\n\n\titsNeonsDB->Query(query.str());\n\n\trow = itsNeonsDB->FetchRow();\n\n\tif (row.empty())\n\t{\n\t\titsLogger->Warning(\"Producer definition not found from neons (id: \" + boost::lexical_cast<string> (resultInfo->Producer().Id()) + \")\");\n\t\treturn false;\n\t}\n\n\tstring process = row[0];\n\n\t\/\/string centre = row[1];\n\t\/\/string model_name = row[2];\n\tstring model_type = row[3];\n\n\t\/*\n\t\tquery \t<< \"SELECT \"\n\t\t\t\t<< \"m.model_name, \"\n\t\t\t\t<< \"model_type, \"\n\t\t\t\t<< \"type_smt \"\n\t\t\t\t<< \"FROM grid_num_model_grib nu, \"\n\t\t\t\t<< \"grid_model m, \"\n\t\t\t\t<< \"grid_model_name na \"\n\t\t\t\t<< \"WHERE nu.model_id = \" << info.process\n\t\t\t\t<< \" AND nu.ident_id = \" << info.centre\n\t\t\t\t<< \" AND m.flag_mod = 0 \"\n\t\t\t\t<< \" AND nu.model_name = na.model_name \"\n\t\t\t\t<< \" AND m.model_name = na.model_name\";\n\n\t*\/\n\n\tquery.str(\"\");\n\n\tquery\t<< \"SELECT \"\n\t\t\t<< \"dset_id, \"\n\t\t\t<< \"table_name, \"\n\t\t\t<< \"rec_cnt_dset \"\n\t\t\t<< \"FROM as_grid \"\n\t\t\t<< \"WHERE \"\n\t\t\t<< \"model_type = '\" << model_type << \"'\"\n\t\t\t<< \" AND geom_name = '\" << geom_name << \"'\"\n\t\t\t<< \" AND dset_name = 'AF'\"\n\t\t\t<< \" AND base_date = '\" << resultInfo->OriginDateTime().String(\"%Y%m%d%H%M\") << \"'\";\n\n\titsNeonsDB->Query(query.str());\n\n\trow = itsNeonsDB->FetchRow();\n\n\tif (row.empty())\n\t{\n\t\titsLogger->Warning(\"Data set definition not found from neons\");\n\t\treturn false;\n\t}\n\n\tstring table_name = row[1];\n\tstring dset_id = row[0];\n\n\tstring eps_specifier = \"0\";\n\n\tquery.str(\"\");\n\n\tquery << \"UPDATE as_grid \"\n\t\t   << \"SET rec_cnt_dset = \"\n\t\t   << \"rec_cnt_dset + 1, \"\n\t\t   << \"date_maj_dset = sysdate \"\n\t\t   << \"WHERE dset_id = \" << dset_id;\n\n\ttry\n\t{\n\t\titsNeonsDB->Execute(query.str());\n\t}\n\tcatch (int e)\n\t{\n\t   itsLogger->Error(\"Error code: \" + boost::lexical_cast<string> (e));\n\t   itsLogger->Error(\"Query: \" + query.str());\n   \t   itsNeonsDB->Rollback();\n   \t   return false;\n\t}\n\n\tquery.str(\"\");\n\n\tstring host = \"undetermined host\";\n\n\tchar* hostname = getenv(\"HOSTNAME\");\n\n\tif (hostname != NULL)\n\t{\n\t\thost = string(hostname);\n\t}\n\n\t\/*\n\t * We have our own error loggings for unique key violations\n\t *\/\n\t\n\titsNeonsDB->Verbose(false);\n\t\n\tquery  << \"INSERT INTO \" << table_name\n\t\t   << \" (dset_id, parm_name, lvl_type, lvl1_lvl2, fcst_per, eps_specifier, file_location, file_server) \"\n\t\t   << \"VALUES (\"\n\t\t   << dset_id << \", \"\n\t\t   << \"'\" << resultInfo->Param().Name() << \"', \"\n\t\t   << \"upper('\" << HPLevelTypeToString.at(resultInfo->Level().Type()) << \"'), \"\n\t\t   << resultInfo->Level().Value() << \", \"\n\t\t   << resultInfo->Time().Step() << \", \"\n\t\t   << \"'\" << eps_specifier << \"', \"\n\t\t   << \"'\" << theFileName << \"', \"\n\t\t   << \"'\" << host << \"')\";\n\n\n\ttry\n\t{\n\t\titsNeonsDB->Execute(query.str());\n\t\titsNeonsDB->Commit();\n\t}\n\tcatch (int e)\n\t{\n\t\tif (e == 1)\n\t\t{\n\t\t\t\/\/ unique key violation\n\t\t\t\n\t\t\ttry\n\t\t\t{\n\n\t\t\t\t\/*\n\t\t\t\t * Neons table definition has invalid primary key definition:\n\t\t\t\t *\n\t\t\t\t * file_location and file_server are a part of the primary key meaning that\n\t\t\t\t * a table can have multiple versions of a single file from multiple servers.\n\t\t\t\t * This is unfortunate and to bypass it we must first delete all versions\n\t\t\t\t * of the file and then INSERT again.\n\t\t\t\t *\/\n\n\t\t\t\tquery.str(\"\");\n\n\t\t\t\tquery\t<< \"DELETE FROM \" << table_name << \" WHERE \"\n\t\t\t\t\t\t<< \"dset_id = \" << dset_id\n\t\t\t\t\t\t<< \" AND parm_name = '\" << resultInfo->Param().Name() << \"'\"\n\t\t\t\t\t\t<< \" AND lvl_type = upper('\" << HPLevelTypeToString.at(resultInfo->Level().Type()) << \"')\"\n\t\t\t\t\t\t<< \" AND lvl1_lvl2 = \" << resultInfo->Level().Value()\n\t\t\t\t\t\t<< \" AND fcst_per = \" << resultInfo->Time().Step();\n\n\t\t\t\titsNeonsDB->Execute(query.str());\n\t\t\t\t\n\t\t\t\tquery.str(\"\");\n\n\t\t\t\tquery\t<< \"INSERT INTO \" << table_name\n\t\t\t\t\t\t<< \" (dset_id, parm_name, lvl_type, lvl1_lvl2, fcst_per, eps_specifier, file_location, file_server) \"\n\t\t\t\t\t\t<< \"VALUES (\"\n\t\t\t\t\t\t<< dset_id << \", \"\n\t\t\t\t\t\t<< \"'\" << resultInfo->Param().Name() << \"', \"\n\t\t\t\t\t\t<< \"upper('\" << HPLevelTypeToString.at(resultInfo->Level().Type()) << \"'), \"\n\t\t\t\t\t\t<< resultInfo->Level().Value() << \", \"\n\t\t\t\t\t\t<< resultInfo->Time().Step() << \", \"\n\t\t\t\t\t\t<< \"'\" << eps_specifier << \"', \"\n\t\t\t\t\t\t<< \"'\" << theFileName << \"', \"\n\t\t\t\t\t\t<< \"'\" << host << \"')\";\n\n\t\t\t\titsNeonsDB->Execute(query.str());\n\n\t\t\t\titsNeonsDB->Commit();\n\t\t\t\t\n\t\t\t}\n\t\t\tcatch (int e)\n\t\t\t{\n\t\t\t\titsLogger->Fatal(\"Error code: \" + boost::lexical_cast<string> (e));\n\t\t\t\titsLogger->Fatal(\"Query: \" + query.str());\n\n\t\t\t\titsNeonsDB->Rollback();\n\n\t\t\t\texit(1);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\titsLogger->Error(\"Error code: \" + boost::lexical_cast<string> (e));\n\t\t\titsLogger->Error(\"Query: \" + query.str());\n\n\t\t\titsNeonsDB->Rollback();\n\n\t\t\treturn false;\n\t\t}\n\t}\n\n\titsLogger->Info(\"Saved information on file '\" + theFileName + \"' to neons\");\n\n\treturn true;\n}\n\nstring neons::GribParameterName(long fmiParameterId, long codeTableVersion)\n{\t\n\tInit();\n\t\n\tstring paramName = itsNeonsDB->GetGridParameterName(fmiParameterId, codeTableVersion, codeTableVersion);\n\treturn paramName; \n\t\n}\n\nstring neons::GribParameterName(long fmiParameterId, long category, long discipline, long producer)\n{\n\tInit();\n\t\n\tstring paramName = itsNeonsDB->GetGridParameterName(fmiParameterId, category, discipline, producer);\n\treturn paramName;   \n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file radon.cpp\n *\n *\/\n\n#include \"radon.h\"\n#include \"logger_factory.h\"\n#include \"plugin_factory.h\"\n#include \"util.h\"\n#include <sstream>\n#include <thread>\n\nusing namespace std;\nusing namespace himan::plugin;\n\nconst int MAX_WORKERS = 32;\nstatic once_flag oflag;\n\nradon::radon() : itsInit(false), itsRadonDB()\n{\n\titsLogger = unique_ptr<logger>(logger_factory::Instance()->GetLog(\"radon\"));\n\n\tcall_once(oflag, [&]() {\n\t\tPoolMaxWorkers(MAX_WORKERS);\n\n\t\tNFmiRadonDBPool::Instance()->Username(\"wetodb\");\n\t\tNFmiRadonDBPool::Instance()->Password(util::GetEnv(\"RADON_WETODB_PASSWORD\"));\n\t});\n}\n\nvoid radon::PoolMaxWorkers(int maxWorkers) { NFmiRadonDBPool::Instance()->MaxWorkers(maxWorkers); }\nvector<string> radon::Files(search_options& options)\n{\n\tInit();\n\n\tvector<string> files;\n\n\tstring analtime = options.time.OriginDateTime().String(\"%Y-%m-%d %H:%M:%S+00\");\n\tstring levelValue = boost::lexical_cast<string>(options.level.Value());\n\tstring levelValue2 = \"-1\";\n\n\tif (options.level.Value2() != kHPMissingValue)\n\t{\n\t\tlevelValue2 = boost::lexical_cast<string>(options.level.Value2());\n\t}\n\n\tstring ref_prod = options.prod.Name();\n\t\/\/ long no_vers = options.prod.TableVersion();\n\n\tstring level_name = HPLevelTypeToString.at(options.level.Type());\n\n\tvector<vector<string>> gridgeoms;\n\tvector<string> sourceGeoms = options.configuration->SourceGeomNames();\n\n\tif (sourceGeoms.empty())\n\t{\n\t\t\/\/ Get all geometries\n\t\tgridgeoms = itsRadonDB->GetGridGeoms(ref_prod, analtime);\n\t}\n\telse\n\t{\n\t\tfor (size_t i = 0; i < sourceGeoms.size(); i++)\n\t\t{\n\t\t\tvector<vector<string>> geoms = itsRadonDB->GetGridGeoms(ref_prod, analtime, sourceGeoms[i]);\n\t\t\tgridgeoms.insert(gridgeoms.end(), geoms.begin(), geoms.end());\n\t\t}\n\t}\n\n\tif (gridgeoms.empty())\n\t{\n\t\t\/\/ No geometries found, fetcher checks this\n\t\treturn files;\n\t}\n\n\tstring forecastTypeValue = \"-1\";  \/\/ default, deterministic\/analysis\n\n\tif (options.ftype.Type() > 2)\n\t{\n\t\tforecastTypeValue = boost::lexical_cast<string>(options.ftype.Value());\n\t}\n\n\tstring forecastTypeId = boost::lexical_cast<string>(options.ftype.Type());\n\n\tif (options.time.Step() == 0 && options.ftype.Type() == 1)\n\t{\n\t\t\/\/ ECMWF (and maybe others) use forecast type id == 2 for analysis hour\n\t\tforecastTypeId += \",2\";\n\t}\n\n\tfor (size_t i = 0; i < gridgeoms.size(); i++)\n\t{\n\t\tstring tablename = gridgeoms[i][1];\n\t\tstring geomid = gridgeoms[i][0];\n\n\t\tstring parm_name = options.param.Name();\n\n\t\tstring query =\n\t\t    \"SELECT param_id, level_id, level_value, forecast_period, file_location, file_server \"\n\t\t    \"FROM \" +\n\t\t    tablename +\n\t\t    \"_v \"\n\t\t    \"WHERE analysis_time = '\" +\n\t\t    analtime +\n\t\t    \"' \"\n\t\t    \"AND param_name = '\" +\n\t\t    parm_name +\n\t\t    \"' \"\n\t\t    \"AND level_name = upper('\" +\n\t\t    level_name +\n\t\t    \"') \"\n\t\t    \"AND level_value = \" +\n\t\t    levelValue + \" AND level_value2 = \" + levelValue2 +\n\t\t    \" \"\n\t\t    \"AND forecast_period = '\" +\n\t\t    util::MakeSQLInterval(options.time) +\n\t\t    \"' \"\n\t\t    \"AND geometry_id = \" +\n\t\t    geomid +\n\t\t    \" \"\n\t\t    \"AND forecast_type_id IN (\" +\n\t\t    forecastTypeId +\n\t\t    \") \"\n\t\t    \"AND forecast_type_value = \" +\n\t\t    forecastTypeValue +\n\t\t    \" \"\n\t\t    \"ORDER BY forecast_period, level_id, level_value\";\n\n\t\titsRadonDB->Query(query);\n\n\t\tvector<string> values = itsRadonDB->FetchRow();\n\n\t\tif (values.empty())\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\titsLogger->Trace(\"Found data for parameter \" + parm_name + \" from radon geometry \" + gridgeoms[i][3]);\n\n\t\tfiles.push_back(values[4]);\n\n\t\tbreak;  \/\/ discontinue loop on first positive match\n\t}\n\n\treturn files;\n}\n\nbool radon::Save(const info& resultInfo, const string& theFileName)\n{\n\tInit();\n\n\tstringstream query;\n\n\tif (resultInfo.Grid()->Class() != kRegularGrid)\n\t{\n\t\titsLogger->Error(\"Only grid data can be stored to radon for now\");\n\t\treturn false;\n\t}\n\n\t\/*\n\t * 1. Get grid information\n\t * 2. Get model information\n\t * 3. Get data set information (ie model run)\n\t * 4. Insert or update\n\t *\/\n\n\thiman::point firstGridPoint = resultInfo.Grid()->FirstPoint();\n\n\t\/\/ get grib1 gridType\n\n\tint gribVersion = 1;\n\tint gridType = -1;\n\n\tswitch (resultInfo.Grid()->Type())\n\t{\n\t\tcase kLatitudeLongitude:\n\t\t\tgridType = 0;\n\t\t\tbreak;\n\t\tcase kRotatedLatitudeLongitude:\n\t\t\tgridType = 10;\n\t\t\tbreak;\n\t\tcase kStereographic:\n\t\t\tgridType = 5;\n\t\t\tbreak;\n\t\tcase kReducedGaussian:\n\t\t\tgridType = 24;  \/\/ \"stretched\" gaussian\n\t\t\tbreak;\n\t\tcase kAzimuthalEquidistant:\n\t\t\tgribVersion = 2;\n\t\t\tgridType = 110;\n\t\t\tbreak;\n\t\tcase kLambertConformalConic:\n\t\t\tgridType = 3;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tthrow runtime_error(\"Unsupported projection: \" + boost::lexical_cast<string>(resultInfo.Grid()->Type()) +\n\t\t\t                    \" \" + HPGridTypeToString.at(resultInfo.Grid()->Type()));\n\t}\n\n\tmap<string, string> geominfo = itsRadonDB->GetGeometryDefinition(\n\t    resultInfo.Grid()->Ni(), resultInfo.Grid()->Nj(), firstGridPoint.Y(), firstGridPoint.X(),\n\t    resultInfo.Grid()->Di(), resultInfo.Grid()->Dj(), gribVersion, gridType);\n\n\tif (geominfo.empty())\n\t{\n\t\titsLogger->Warning(\"Grid geometry not found from radon\");\n\t\treturn false;\n\t}\n\n\tstring geom_id = geominfo[\"id\"];\n\tauto analysisTime = resultInfo.Time().OriginDateTime().String(\"%Y-%m-%d %H:%M:%S+00\");\n\n\tquery.str(\"\");\n\n\tquery << \"SELECT \"\n\t      << \"id, table_name \"\n\t      << \"FROM as_grid \"\n\t      << \"WHERE geometry_id = '\" << geom_id << \"'\"\n\t      << \" AND (min_analysis_time, max_analysis_time) OVERLAPS ('\" << analysisTime << \"'\"\n\t      << \", '\" << analysisTime << \"')\"\n\t      << \" AND producer_id = \" << resultInfo.Producer().Id();\n\n\titsRadonDB->Query(query.str());\n\n\tauto row = itsRadonDB->FetchRow();\n\n\tif (row.empty())\n\t{\n\t\titsLogger->Warning(\"Data set definition not found from radon\");\n\t\treturn false;\n\t}\n\n\tstring table_name = row[1];\n\n\tquery.str(\"\");\n\n\tchar host[255];\n\tgethostname(host, 255);\n\n\tauto levelinfo = itsRadonDB->GetLevelFromDatabaseName(HPLevelTypeToString.at(resultInfo.Level().Type()));\n\n\tif (levelinfo.empty())\n\t{\n\t\titsLogger->Error(\"Level information not found from radon for level \" +\n\t\t                 HPLevelTypeToString.at(resultInfo.Level().Type()) + \", producer \" +\n\t\t                 boost::lexical_cast<string>(resultInfo.Producer().Id()));\n\t\treturn false;\n\t}\n\n\tauto paraminfo = itsRadonDB->GetParameterFromDatabaseName(resultInfo.Producer().Id(), resultInfo.Param().Name(),\n\t                                                          stoi(levelinfo[\"id\"]), resultInfo.Level().Value());\n\n\tif (paraminfo.empty())\n\t{\n\t\titsLogger->Error(\"Parameter information not found from radon for parameter \" + resultInfo.Param().Name() +\n\t\t                 \", producer \" + boost::lexical_cast<string>(resultInfo.Producer().Id()));\n\t\treturn false;\n\t}\n\n\t\/*\n\t * We have our own error logging for unique key violations\n\t *\/\n\n\t\/\/ itsRadonDB->Verbose(false);\n\tint forecastTypeValue = -1;  \/\/ default, deterministic\/analysis\n\n\tif (resultInfo.ForecastType().Type() > 2)\n\t{\n\t\tforecastTypeValue = static_cast<int>(resultInfo.ForecastType().Value());\n\t}\n\n\tdouble levelValue2 = (resultInfo.Level().Value2() == kHPMissingValue) ? -1 : resultInfo.Level().Value2();\n\n\tquery\n\t    << \"INSERT INTO data.\" << table_name\n\t    << \" (producer_id, analysis_time, geometry_id, param_id, level_id, level_value, level_value2, forecast_period, \"\n\t       \"forecast_type_id, forecast_type_value, file_location, file_server) VALUES (\"\n\t    << resultInfo.Producer().Id() << \", \"\n\t    << \"'\" << analysisTime << \"', \" << geom_id << \", \" << paraminfo[\"id\"] << \", \" << levelinfo[\"id\"] << \", \"\n\t    << resultInfo.Level().Value() << \", \" << levelValue2 << \", \"\n\t    << \"'\" << util::MakeSQLInterval(resultInfo.Time()) << \"', \"\n\t    << static_cast<int>(resultInfo.ForecastType().Type()) << \", \" << forecastTypeValue << \",\"\n\t    << \"'\" << theFileName << \"', \"\n\t    << \"'\" << host << \"')\";\n\n\ttry\n\t{\n\t\titsRadonDB->Execute(query.str());\n\t\titsRadonDB->Commit();\n\t}\n\tcatch (const pqxx::unique_violation& e)\n\t{\n\t\titsRadonDB->Rollback();\n\n\t\tquery.str(\"\");\n\t\tquery << \"UPDATE data.\" << table_name << \" SET \"\n\t\t      << \"file_location = '\" << theFileName << \"', \"\n\t\t      << \"file_server = '\" << host << \"' WHERE \"\n\t\t      << \"producer_id = \" << resultInfo.Producer().Id() << \" AND \"\n\t\t      << \"analysis_time = '\" << analysisTime << \"' AND \"\n\t\t      << \"geometry_id = \" << geom_id << \" AND \"\n\t\t      << \"param_id = \" << paraminfo[\"id\"] << \" AND \"\n\t\t      << \"level_id = \" << levelinfo[\"id\"] << \" AND \"\n\t\t      << \"level_value = \" << resultInfo.Level().Value() << \" AND \"\n\t\t      << \"level_value2 = \" << levelValue2 << \" AND \"\n\t\t      << \"forecast_period = \"\n\t\t      << \"'\" << util::MakeSQLInterval(resultInfo.Time()) << \"' AND \"\n\t\t      << \"forecast_type_id = \" << static_cast<int>(resultInfo.ForecastType().Type()) << \" AND \"\n\t\t      << \"forecast_type_value = \" << forecastTypeValue;\n\n\t\titsRadonDB->Execute(query.str());\n\t\titsRadonDB->Commit();\n\t}\n\n\titsLogger->Trace(\"Saved information on file '\" + theFileName + \"' to radon\");\n\n\treturn true;\n}\n\nmap<string, string> radon::Grib1ParameterName(long producer, long fmiParameterId, long codeTableVersion,\n                                              long timeRangeIndicator, long levelId, double level_value)\n{\n\tInit();\n\n\tmap<string, string> paramName = itsRadonDB->GetParameterFromGrib1(producer, codeTableVersion, fmiParameterId,\n\t                                                                  timeRangeIndicator, levelId, level_value);\n\treturn paramName;\n}\n\nmap<string, string> radon::Grib2ParameterName(long fmiParameterId, long category, long discipline, long producer,\n                                              long levelId, double level_value)\n{\n\tInit();\n\n\tmap<string, string> paramName =\n\t    itsRadonDB->GetParameterFromGrib2(producer, discipline, category, fmiParameterId, levelId, level_value);\n\treturn paramName;\n}\n<commit_msg>Specify radon database name and hostname when connecting to the pool<commit_after>\/**\n * @file radon.cpp\n *\n *\/\n\n#include \"radon.h\"\n#include \"logger_factory.h\"\n#include \"plugin_factory.h\"\n#include \"util.h\"\n#include <sstream>\n#include <thread>\n\nusing namespace std;\nusing namespace himan::plugin;\n\nconst int MAX_WORKERS = 32;\nstatic once_flag oflag;\n\nradon::radon() : itsInit(false), itsRadonDB()\n{\n\titsLogger = unique_ptr<logger>(logger_factory::Instance()->GetLog(\"radon\"));\n\n\tcall_once(oflag, [&]() {\n\t\tPoolMaxWorkers(MAX_WORKERS);\n\n\t\tNFmiRadonDBPool::Instance()->Username(\"wetodb\");\n\t\tNFmiRadonDBPool::Instance()->Password(util::GetEnv(\"RADON_WETODB_PASSWORD\"));\n\t\tNFmiRadonDBPool::Instance()->Database(\"radon\");\n\t\tNFmiRadonDBPool::Instance()->Hostname(\"vorlon\");\n\t});\n}\n\nvoid radon::PoolMaxWorkers(int maxWorkers) { NFmiRadonDBPool::Instance()->MaxWorkers(maxWorkers); }\nvector<string> radon::Files(search_options& options)\n{\n\tInit();\n\n\tvector<string> files;\n\n\tstring analtime = options.time.OriginDateTime().String(\"%Y-%m-%d %H:%M:%S+00\");\n\tstring levelValue = boost::lexical_cast<string>(options.level.Value());\n\tstring levelValue2 = \"-1\";\n\n\tif (options.level.Value2() != kHPMissingValue)\n\t{\n\t\tlevelValue2 = boost::lexical_cast<string>(options.level.Value2());\n\t}\n\n\tstring ref_prod = options.prod.Name();\n\t\/\/ long no_vers = options.prod.TableVersion();\n\n\tstring level_name = HPLevelTypeToString.at(options.level.Type());\n\n\tvector<vector<string>> gridgeoms;\n\tvector<string> sourceGeoms = options.configuration->SourceGeomNames();\n\n\tif (sourceGeoms.empty())\n\t{\n\t\t\/\/ Get all geometries\n\t\tgridgeoms = itsRadonDB->GetGridGeoms(ref_prod, analtime);\n\t}\n\telse\n\t{\n\t\tfor (size_t i = 0; i < sourceGeoms.size(); i++)\n\t\t{\n\t\t\tvector<vector<string>> geoms = itsRadonDB->GetGridGeoms(ref_prod, analtime, sourceGeoms[i]);\n\t\t\tgridgeoms.insert(gridgeoms.end(), geoms.begin(), geoms.end());\n\t\t}\n\t}\n\n\tif (gridgeoms.empty())\n\t{\n\t\t\/\/ No geometries found, fetcher checks this\n\t\treturn files;\n\t}\n\n\tstring forecastTypeValue = \"-1\";  \/\/ default, deterministic\/analysis\n\n\tif (options.ftype.Type() > 2)\n\t{\n\t\tforecastTypeValue = boost::lexical_cast<string>(options.ftype.Value());\n\t}\n\n\tstring forecastTypeId = boost::lexical_cast<string>(options.ftype.Type());\n\n\tif (options.time.Step() == 0 && options.ftype.Type() == 1)\n\t{\n\t\t\/\/ ECMWF (and maybe others) use forecast type id == 2 for analysis hour\n\t\tforecastTypeId += \",2\";\n\t}\n\n\tfor (size_t i = 0; i < gridgeoms.size(); i++)\n\t{\n\t\tstring tablename = gridgeoms[i][1];\n\t\tstring geomid = gridgeoms[i][0];\n\n\t\tstring parm_name = options.param.Name();\n\n\t\tstring query =\n\t\t    \"SELECT param_id, level_id, level_value, forecast_period, file_location, file_server \"\n\t\t    \"FROM \" +\n\t\t    tablename +\n\t\t    \"_v \"\n\t\t    \"WHERE analysis_time = '\" +\n\t\t    analtime +\n\t\t    \"' \"\n\t\t    \"AND param_name = '\" +\n\t\t    parm_name +\n\t\t    \"' \"\n\t\t    \"AND level_name = upper('\" +\n\t\t    level_name +\n\t\t    \"') \"\n\t\t    \"AND level_value = \" +\n\t\t    levelValue + \" AND level_value2 = \" + levelValue2 +\n\t\t    \" \"\n\t\t    \"AND forecast_period = '\" +\n\t\t    util::MakeSQLInterval(options.time) +\n\t\t    \"' \"\n\t\t    \"AND geometry_id = \" +\n\t\t    geomid +\n\t\t    \" \"\n\t\t    \"AND forecast_type_id IN (\" +\n\t\t    forecastTypeId +\n\t\t    \") \"\n\t\t    \"AND forecast_type_value = \" +\n\t\t    forecastTypeValue +\n\t\t    \" \"\n\t\t    \"ORDER BY forecast_period, level_id, level_value\";\n\n\t\titsRadonDB->Query(query);\n\n\t\tvector<string> values = itsRadonDB->FetchRow();\n\n\t\tif (values.empty())\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\titsLogger->Trace(\"Found data for parameter \" + parm_name + \" from radon geometry \" + gridgeoms[i][3]);\n\n\t\tfiles.push_back(values[4]);\n\n\t\tbreak;  \/\/ discontinue loop on first positive match\n\t}\n\n\treturn files;\n}\n\nbool radon::Save(const info& resultInfo, const string& theFileName)\n{\n\tInit();\n\n\tstringstream query;\n\n\tif (resultInfo.Grid()->Class() != kRegularGrid)\n\t{\n\t\titsLogger->Error(\"Only grid data can be stored to radon for now\");\n\t\treturn false;\n\t}\n\n\t\/*\n\t * 1. Get grid information\n\t * 2. Get model information\n\t * 3. Get data set information (ie model run)\n\t * 4. Insert or update\n\t *\/\n\n\thiman::point firstGridPoint = resultInfo.Grid()->FirstPoint();\n\n\t\/\/ get grib1 gridType\n\n\tint gribVersion = 1;\n\tint gridType = -1;\n\n\tswitch (resultInfo.Grid()->Type())\n\t{\n\t\tcase kLatitudeLongitude:\n\t\t\tgridType = 0;\n\t\t\tbreak;\n\t\tcase kRotatedLatitudeLongitude:\n\t\t\tgridType = 10;\n\t\t\tbreak;\n\t\tcase kStereographic:\n\t\t\tgridType = 5;\n\t\t\tbreak;\n\t\tcase kReducedGaussian:\n\t\t\tgridType = 24;  \/\/ \"stretched\" gaussian\n\t\t\tbreak;\n\t\tcase kAzimuthalEquidistant:\n\t\t\tgribVersion = 2;\n\t\t\tgridType = 110;\n\t\t\tbreak;\n\t\tcase kLambertConformalConic:\n\t\t\tgridType = 3;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tthrow runtime_error(\"Unsupported projection: \" + boost::lexical_cast<string>(resultInfo.Grid()->Type()) +\n\t\t\t                    \" \" + HPGridTypeToString.at(resultInfo.Grid()->Type()));\n\t}\n\n\tmap<string, string> geominfo = itsRadonDB->GetGeometryDefinition(\n\t    resultInfo.Grid()->Ni(), resultInfo.Grid()->Nj(), firstGridPoint.Y(), firstGridPoint.X(),\n\t    resultInfo.Grid()->Di(), resultInfo.Grid()->Dj(), gribVersion, gridType);\n\n\tif (geominfo.empty())\n\t{\n\t\titsLogger->Warning(\"Grid geometry not found from radon\");\n\t\treturn false;\n\t}\n\n\tstring geom_id = geominfo[\"id\"];\n\tauto analysisTime = resultInfo.Time().OriginDateTime().String(\"%Y-%m-%d %H:%M:%S+00\");\n\n\tquery.str(\"\");\n\n\tquery << \"SELECT \"\n\t      << \"id, table_name \"\n\t      << \"FROM as_grid \"\n\t      << \"WHERE geometry_id = '\" << geom_id << \"'\"\n\t      << \" AND (min_analysis_time, max_analysis_time) OVERLAPS ('\" << analysisTime << \"'\"\n\t      << \", '\" << analysisTime << \"')\"\n\t      << \" AND producer_id = \" << resultInfo.Producer().Id();\n\n\titsRadonDB->Query(query.str());\n\n\tauto row = itsRadonDB->FetchRow();\n\n\tif (row.empty())\n\t{\n\t\titsLogger->Warning(\"Data set definition not found from radon\");\n\t\treturn false;\n\t}\n\n\tstring table_name = row[1];\n\n\tquery.str(\"\");\n\n\tchar host[255];\n\tgethostname(host, 255);\n\n\tauto levelinfo = itsRadonDB->GetLevelFromDatabaseName(HPLevelTypeToString.at(resultInfo.Level().Type()));\n\n\tif (levelinfo.empty())\n\t{\n\t\titsLogger->Error(\"Level information not found from radon for level \" +\n\t\t                 HPLevelTypeToString.at(resultInfo.Level().Type()) + \", producer \" +\n\t\t                 boost::lexical_cast<string>(resultInfo.Producer().Id()));\n\t\treturn false;\n\t}\n\n\tauto paraminfo = itsRadonDB->GetParameterFromDatabaseName(resultInfo.Producer().Id(), resultInfo.Param().Name(),\n\t                                                          stoi(levelinfo[\"id\"]), resultInfo.Level().Value());\n\n\tif (paraminfo.empty())\n\t{\n\t\titsLogger->Error(\"Parameter information not found from radon for parameter \" + resultInfo.Param().Name() +\n\t\t                 \", producer \" + boost::lexical_cast<string>(resultInfo.Producer().Id()));\n\t\treturn false;\n\t}\n\n\t\/*\n\t * We have our own error logging for unique key violations\n\t *\/\n\n\t\/\/ itsRadonDB->Verbose(false);\n\tint forecastTypeValue = -1;  \/\/ default, deterministic\/analysis\n\n\tif (resultInfo.ForecastType().Type() > 2)\n\t{\n\t\tforecastTypeValue = static_cast<int>(resultInfo.ForecastType().Value());\n\t}\n\n\tdouble levelValue2 = (resultInfo.Level().Value2() == kHPMissingValue) ? -1 : resultInfo.Level().Value2();\n\n\tquery\n\t    << \"INSERT INTO data.\" << table_name\n\t    << \" (producer_id, analysis_time, geometry_id, param_id, level_id, level_value, level_value2, forecast_period, \"\n\t       \"forecast_type_id, forecast_type_value, file_location, file_server) VALUES (\"\n\t    << resultInfo.Producer().Id() << \", \"\n\t    << \"'\" << analysisTime << \"', \" << geom_id << \", \" << paraminfo[\"id\"] << \", \" << levelinfo[\"id\"] << \", \"\n\t    << resultInfo.Level().Value() << \", \" << levelValue2 << \", \"\n\t    << \"'\" << util::MakeSQLInterval(resultInfo.Time()) << \"', \"\n\t    << static_cast<int>(resultInfo.ForecastType().Type()) << \", \" << forecastTypeValue << \",\"\n\t    << \"'\" << theFileName << \"', \"\n\t    << \"'\" << host << \"')\";\n\n\ttry\n\t{\n\t\titsRadonDB->Execute(query.str());\n\t\titsRadonDB->Commit();\n\t}\n\tcatch (const pqxx::unique_violation& e)\n\t{\n\t\titsRadonDB->Rollback();\n\n\t\tquery.str(\"\");\n\t\tquery << \"UPDATE data.\" << table_name << \" SET \"\n\t\t      << \"file_location = '\" << theFileName << \"', \"\n\t\t      << \"file_server = '\" << host << \"' WHERE \"\n\t\t      << \"producer_id = \" << resultInfo.Producer().Id() << \" AND \"\n\t\t      << \"analysis_time = '\" << analysisTime << \"' AND \"\n\t\t      << \"geometry_id = \" << geom_id << \" AND \"\n\t\t      << \"param_id = \" << paraminfo[\"id\"] << \" AND \"\n\t\t      << \"level_id = \" << levelinfo[\"id\"] << \" AND \"\n\t\t      << \"level_value = \" << resultInfo.Level().Value() << \" AND \"\n\t\t      << \"level_value2 = \" << levelValue2 << \" AND \"\n\t\t      << \"forecast_period = \"\n\t\t      << \"'\" << util::MakeSQLInterval(resultInfo.Time()) << \"' AND \"\n\t\t      << \"forecast_type_id = \" << static_cast<int>(resultInfo.ForecastType().Type()) << \" AND \"\n\t\t      << \"forecast_type_value = \" << forecastTypeValue;\n\n\t\titsRadonDB->Execute(query.str());\n\t\titsRadonDB->Commit();\n\t}\n\n\titsLogger->Trace(\"Saved information on file '\" + theFileName + \"' to radon\");\n\n\treturn true;\n}\n\nmap<string, string> radon::Grib1ParameterName(long producer, long fmiParameterId, long codeTableVersion,\n                                              long timeRangeIndicator, long levelId, double level_value)\n{\n\tInit();\n\n\tmap<string, string> paramName = itsRadonDB->GetParameterFromGrib1(producer, codeTableVersion, fmiParameterId,\n\t                                                                  timeRangeIndicator, levelId, level_value);\n\treturn paramName;\n}\n\nmap<string, string> radon::Grib2ParameterName(long fmiParameterId, long category, long discipline, long producer,\n                                              long levelId, double level_value)\n{\n\tInit();\n\n\tmap<string, string> paramName =\n\t    itsRadonDB->GetParameterFromGrib2(producer, discipline, category, fmiParameterId, levelId, level_value);\n\treturn paramName;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <exception>\n#include <cstdio>\n#include <functional>\n\n#include \"matrix.h\"\n\nusing namespace std;\n\/* Нужно написать класс-матрицу.\n * В конструкторе задается количество рядов и строк.\n * Поддерживаются оперции:\n *      получить количество строк\/столбцов,\n *      получить конкретный элемент,\n *      умножить на вектор (в качестве вектора использовать класс std::vector<double>),\n *      умножить на число,\n *      сравнение на равенство\/неравенство\n * ЗАДАНИЕ 5\n *      конструкторы и операторы копирования и перемещения.\n *      Сделать класс шаблонным.\n * В случае ошибки выхода за границы достаточно такой\n * обработки ошибки: assert(!\"index out of range\")\n *\/\n\n\/\/ [cols][rows]\n\/\/--------------------------------------------\n\nvoid check_values_equal(double result, int value)\n{\n    try\n    {\n        if (almost_equal(result, value))\n            std::cout << \"Passed: \" << result << \" = \" << value << std::endl;\n        else\n            std::cout << \"Failed: \" << result << \" (\" << value << \" expected)\" << std::endl;\n    }\n    catch(char const* msg)\n    {\n        std::cout << \"Failed: \" << result << \" Exception message: \" << msg << \" (\" << value << \" expected)\" <<std::endl;\n    }\n}\n\nvoid check_invalid(std::function <void ()> func)\n{\n    try\n    {\n        func();\n    }\n    catch(char const* msg)\n    {\n        std::cout << \"Passed: exception message \" << msg << std::endl;\n        return;\n    }\n    std::cout << \"Failed: exception message expected.\" <<std::endl;\n}\n\n\/\/--------------------------------------------\n\nvoid check(bool value)\n{\n    if (!value)\n         cout << \"error\" <<  endl;\n}\n\ntemplate<typename T>\nvoid checkConstructor()\n{\n    check_invalid([](){return Matrix<T> (0, 1);});\n    check_invalid([](){return Matrix<T> (1, 0);});\n\n    Matrix<T>  m = Matrix<T> (3, 2);\n    m[0][0] = 1;\n    m[0][1] = 2;\n    m[0][2] = 3;\n    m[1][0] = 4;\n    m[1][1] = 5;\n    m[1][2] = 6;\n    check_values_equal(m[0][0], 1);\n    check_values_equal(m[0][1], 2);\n    check_values_equal(m[0][2], 3);\n    check_values_equal(m[1][0], 4);\n    check_values_equal(m[1][1], 5);\n    check_values_equal(m[1][2], 6);\n\n    check_invalid([&m](){return m[1][3];});\n    check_invalid([&m](){return m[2][1];});\n\n    T arr[] = {1, 2, 3, 4, 5, 6};\n    m = Matrix<T> (3, 2, arr);\n    check_values_equal(m[0][0], 1);\n    check_values_equal(m[0][1], 2);\n    check_values_equal(m[0][2], 3);\n    check_values_equal(m[1][0], 4);\n    check_values_equal(m[1][1], 5);\n    check_values_equal(m[1][2], 6);\n\n    check_invalid([&m](){return m[1][3];});\n    check_invalid([&m](){return m[2][1];});\n\n    Matrix<T>  m_copy = Matrix<T> (m);\n    check_values_equal(m_copy[0][0], 1);\n    check_values_equal(m_copy[0][1], 2);\n    check_values_equal(m_copy[0][2], 3);\n    check_values_equal(m_copy[1][0], 4);\n    check_values_equal(m_copy[1][1], 5);\n    check_values_equal(m_copy[1][2], 6);\n\n    check_invalid([&m_copy](){return m_copy[1][3];});\n    check_invalid([&m_copy](){return m_copy[2][1];});\n\n    m_copy = m;\n    check_values_equal(m_copy[0][0], 1);\n    check_values_equal(m_copy[0][1], 2);\n    check_values_equal(m_copy[0][2], 3);\n    check_values_equal(m_copy[1][0], 4);\n    check_values_equal(m_copy[1][1], 5);\n    check_values_equal(m_copy[1][2], 6);\n\n    check_invalid([&m_copy](){return m_copy[1][3];});\n    check_invalid([&m_copy](){return m_copy[2][1];});\n\n    cout << endl << \"----------------\" << endl << \"Init Passed.\" << endl << \"----------------\" << endl;\n}\n\n\nvoid checkGetSet()\n{\n    Matrix<double>  m = Matrix<double> (3, 2, 1);\n\n    m.get_element(1, 1) = 10;\n    check_values_equal(m.get_element(1, 1), 10);\n\n    m[1][2] = 100;\n    check_values_equal(m[1][2], 100);\n\n    cout << endl << \"----------------\" << endl << \"GetSet Passed.\" << endl << \"----------------\" << endl;\n\n}\n\n\nvoid checkGetSizes()\n{\n    Matrix<double>  m = Matrix<double> (3, 2, 1);\n\n    check_values_equal(m.get_column_size(), 3); \/\/ size of column == number of rows in Matrix<double>\n    check_values_equal(m.get_rows_size(), 2);\n\n    cout << endl << \"----------------\" << endl << \"GetSizes Passed.\" << endl << \"----------------\"  << endl;\n\n}\n\nvoid checkMult()\n{\n    double arr[] = {1, 2, 3, 4, 5, 6};\n    Matrix<double>  m = Matrix<double> (3, 2, arr);\n    m *= 10;\n    check_values_equal(m[0][0], 10);\n    check_values_equal(m[0][1], 20);\n    check_values_equal(m[0][2], 30);\n    check_values_equal(m[1][0], 40);\n    check_values_equal(m[1][1], 50);\n    check_values_equal(m[1][2], 60);\n\n    vector<double> vector_right = {1};\n    check_invalid([&m, &vector_right](){return m *= vector_right;});\n\n    vector_right = {1, 1};\n    m *= vector_right;\n    check_values_equal(m[0][0], 50);\n    check_values_equal(m[0][1], 70);\n    check_values_equal(m[0][2], 90);\n\n    vector_right = {1, 1, 1};\n    check_invalid([&m, &vector_right](){return m *= vector_right;});\n\n    cout << endl << \"----------------\" << endl << \"Mult Passed.\" << endl << \"----------------\" << endl << endl;\n\n}\n\nvoid checkComparison()\n{\n    Matrix<double>  m1 = Matrix<double> (3, 2, 1);\n    Matrix<double>  m2 = Matrix<double> (3, 2, 1);\n    Matrix<double>  m3 = Matrix<double> (2, 2, 1);\n    Matrix<double>  m4 = Matrix<double> (3, 2, 10);\n\n    check(m1 == m2);\n    check(m1 != m3);\n\n    m2 *= 10;\n\n    check(m1 != m2);\n    check(m2 == m4);\n\n    cout << endl << \"----------------\" << endl << \"Comparison Passed.\" << endl  << \"----------------\" << endl << endl;\n}\n\n\nvoid checkMoving()\n{\n    Matrix<double>  m1 = Matrix<double> (3, 2, 1);\n\n    check_values_equal(m1[0][0], 1);\n    check_values_equal(m1[0][1], 1);\n    check_values_equal(m1[0][2], 1);\n    check_values_equal(m1[1][0], 1);\n    check_values_equal(m1[1][1], 1);\n    check_values_equal(m1[1][2], 1);\n\n    Matrix<double>  m2 = std::move(m1);\n\n    check_invalid([&m1](){m1.is_not_moved();});\n\n    check_values_equal(m2[0][0], 1);\n    check_values_equal(m2[0][1], 1);\n    check_values_equal(m2[0][2], 1);\n    check_values_equal(m2[1][0], 1);\n    check_values_equal(m2[1][1], 1);\n    check_values_equal(m2[1][2], 1);\n    \n    m1 = std::move(m2);\n\n    check_invalid([&m2](){m2.is_not_moved();});\n\n    check_values_equal(m1[0][0], 1);\n    check_values_equal(m1[0][1], 1);\n    check_values_equal(m1[0][2], 1);\n    check_values_equal(m1[1][0], 1);\n    check_values_equal(m1[1][1], 1);\n    check_values_equal(m1[1][2], 1);\n\n    cout << endl << \"----------------\" << endl << \"Moving Passed.\" << endl  << \"----------------\" << endl << endl;\n}\n\n\/\/--------------------------------------------\nint main()\n{\n    try\n    {\n        checkConstructor<double>();\n        checkConstructor<int>();\n        checkGetSet();\n        checkGetSizes();\n        checkMult();\n        checkComparison();\n        checkMoving();\n    }\n    catch(char const* msg)\n    {\n         cout << \" Exception message: \" << msg << endl;\n    }\n    return 0;\n}\n<commit_msg>Update main.cpp<commit_after>#include <iostream>\n#include <exception>\n#include <cstdio>\n#include <functional>\n\n#include \"matrix.h\"\n\nusing namespace std;\n\/* Нужно написать класс-матрицу.\n * В конструкторе задается количество рядов и строк.\n * Поддерживаются оперции:\n *      получить количество строк\/столбцов,\n *      получить конкретный элемент,\n *      умножить на вектор (в качестве вектора использовать класс std::vector<double>),\n *      умножить на число,\n *      сравнение на равенство\/неравенство\n * ЗАДАНИЕ 5\n *      конструкторы и операторы копирования и перемещения.\n *      Сделать класс шаблонным.\n * В случае ошибки выхода за границы достаточно такой\n * обработки ошибки: assert(!\"index out of range\")\n *\/\n\n\/\/ [cols][rows]\n\/\/--------------------------------------------\n\nvoid check_values_equal(double result, int value)\n{\n    try\n    {\n        if (almost_equal(result, value))\n            std::cout << \"Passed: \" << result << \" = \" << value << std::endl;\n        else\n            std::cout << \"Failed: \" << result << \" (\" << value << \" expected)\" << std::endl;\n    }\n    catch(char const* msg)\n    {\n        std::cout << \"Failed: \" << result << \" Exception message: \" << msg << \" (\" << value << \" expected)\" << std::endl;\n    }\n}\n\nvoid check_invalid(std::function <void ()> func)\n{\n    try\n    {\n        func();\n    }\n    catch(char const* msg)\n    {\n        std::cout << \"Passed: exception message \" << msg << std::endl;\n        return;\n    }\n    std::cout << \"Failed: exception message expected.\" << std::endl;\n}\n\n\/\/--------------------------------------------\n\nvoid check(bool value)\n{\n    if (!value)\n         cout << \"error\" <<  endl;\n}\n\ntemplate<typename T>\nvoid checkConstructor()\n{\n    check_invalid([](){return Matrix<T> (0, 1);});\n    check_invalid([](){return Matrix<T> (1, 0);});\n\n    Matrix<T>  m = Matrix<T> (3, 2);\n    m[0][0] = 1;\n    m[0][1] = 2;\n    m[0][2] = 3;\n    m[1][0] = 4;\n    m[1][1] = 5;\n    m[1][2] = 6;\n    check_values_equal(m[0][0], 1);\n    check_values_equal(m[0][1], 2);\n    check_values_equal(m[0][2], 3);\n    check_values_equal(m[1][0], 4);\n    check_values_equal(m[1][1], 5);\n    check_values_equal(m[1][2], 6);\n\n    check_invalid([&m](){return m[1][3];});\n    check_invalid([&m](){return m[2][1];});\n\n    T arr[] = {1, 2, 3, 4, 5, 6};\n    m = Matrix<T> (3, 2, arr);\n    check_values_equal(m[0][0], 1);\n    check_values_equal(m[0][1], 2);\n    check_values_equal(m[0][2], 3);\n    check_values_equal(m[1][0], 4);\n    check_values_equal(m[1][1], 5);\n    check_values_equal(m[1][2], 6);\n\n    check_invalid([&m](){return m[1][3];});\n    check_invalid([&m](){return m[2][1];});\n\n    Matrix<T>  m_copy = Matrix<T> (m);\n    check_values_equal(m_copy[0][0], 1);\n    check_values_equal(m_copy[0][1], 2);\n    check_values_equal(m_copy[0][2], 3);\n    check_values_equal(m_copy[1][0], 4);\n    check_values_equal(m_copy[1][1], 5);\n    check_values_equal(m_copy[1][2], 6);\n\n    check_invalid([&m_copy](){return m_copy[1][3];});\n    check_invalid([&m_copy](){return m_copy[2][1];});\n\n    m_copy = m;\n    check_values_equal(m_copy[0][0], 1);\n    check_values_equal(m_copy[0][1], 2);\n    check_values_equal(m_copy[0][2], 3);\n    check_values_equal(m_copy[1][0], 4);\n    check_values_equal(m_copy[1][1], 5);\n    check_values_equal(m_copy[1][2], 6);\n\n    check_invalid([&m_copy](){return m_copy[1][3];});\n    check_invalid([&m_copy](){return m_copy[2][1];});\n\n    cout << endl << \"----------------\" << endl << \"Init Passed.\" << endl << \"----------------\" << endl;\n}\n\n\nvoid checkGetSet()\n{\n    Matrix<double>  m = Matrix<double> (3, 2, 1);\n\n    m.get_element(1, 1) = 10;\n    check_values_equal(m.get_element(1, 1), 10);\n\n    m[1][2] = 100;\n    check_values_equal(m[1][2], 100);\n\n    cout << endl << \"----------------\" << endl << \"GetSet Passed.\" << endl << \"----------------\" << endl;\n\n}\n\n\nvoid checkGetSizes()\n{\n    Matrix<double>  m = Matrix<double> (3, 2, 1);\n\n    check_values_equal(m.get_column_size(), 3); \/\/ size of column == number of rows in Matrix<double>\n    check_values_equal(m.get_rows_size(), 2);\n\n    cout << endl << \"----------------\" << endl << \"GetSizes Passed.\" << endl << \"----------------\"  << endl;\n\n}\n\nvoid checkMult()\n{\n    double arr[] = {1, 2, 3, 4, 5, 6};\n    Matrix<double>  m = Matrix<double> (3, 2, arr);\n    m *= 10;\n    check_values_equal(m[0][0], 10);\n    check_values_equal(m[0][1], 20);\n    check_values_equal(m[0][2], 30);\n    check_values_equal(m[1][0], 40);\n    check_values_equal(m[1][1], 50);\n    check_values_equal(m[1][2], 60);\n\n    vector<double> vector_right = {1};\n    check_invalid([&m, &vector_right](){return m *= vector_right;});\n\n    vector_right = {1, 1};\n    m *= vector_right;\n    check_values_equal(m[0][0], 50);\n    check_values_equal(m[0][1], 70);\n    check_values_equal(m[0][2], 90);\n\n    vector_right = {1, 1, 1};\n    check_invalid([&m, &vector_right](){return m *= vector_right;});\n\n    cout << endl << \"----------------\" << endl << \"Mult Passed.\" << endl << \"----------------\" << endl << endl;\n\n}\n\nvoid checkComparison()\n{\n    Matrix<double>  m1 = Matrix<double> (3, 2, 1);\n    Matrix<double>  m2 = Matrix<double> (3, 2, 1);\n    Matrix<double>  m3 = Matrix<double> (2, 2, 1);\n    Matrix<double>  m4 = Matrix<double> (3, 2, 10);\n\n    check(m1 == m2);\n    check(m1 != m3);\n\n    m2 *= 10;\n\n    check(m1 != m2);\n    check(m2 == m4);\n\n    cout << endl << \"----------------\" << endl << \"Comparison Passed.\" << endl  << \"----------------\" << endl << endl;\n}\n\n\nvoid checkMoving()\n{\n    Matrix<double>  m1 = Matrix<double> (3, 2, 1);\n\n    check_values_equal(m1[0][0], 1);\n    check_values_equal(m1[0][1], 1);\n    check_values_equal(m1[0][2], 1);\n    check_values_equal(m1[1][0], 1);\n    check_values_equal(m1[1][1], 1);\n    check_values_equal(m1[1][2], 1);\n\n    Matrix<double>  m2 = std::move(m1);\n\n    check_invalid([&m1](){m1.is_not_moved();});\n\n    check_values_equal(m2[0][0], 1);\n    check_values_equal(m2[0][1], 1);\n    check_values_equal(m2[0][2], 1);\n    check_values_equal(m2[1][0], 1);\n    check_values_equal(m2[1][1], 1);\n    check_values_equal(m2[1][2], 1);\n    \n    m1 = std::move(m2);\n\n    check_invalid([&m2](){m2.is_not_moved();});\n\n    check_values_equal(m1[0][0], 1);\n    check_values_equal(m1[0][1], 1);\n    check_values_equal(m1[0][2], 1);\n    check_values_equal(m1[1][0], 1);\n    check_values_equal(m1[1][1], 1);\n    check_values_equal(m1[1][2], 1);\n\n    cout << endl << \"----------------\" << endl << \"Moving Passed.\" << endl  << \"----------------\" << endl << endl;\n}\n\n\/\/--------------------------------------------\nint main()\n{\n    try\n    {\n        checkConstructor<double>();\n        checkConstructor<int>();\n        checkGetSet();\n        checkGetSizes();\n        checkMult();\n        checkComparison();\n        checkMoving();\n    }\n    catch(char const* msg)\n    {\n         cout << \" Exception message: \" << msg << endl;\n    }\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"osg_tools.h\"\n\n#include <osg\/Geometry>\n#include \"osg\/Material\"\n#include \"flut\/prop_node.hpp\"\n#include \"flut\/system\/log.hpp\"\n#include \"flut\/timer.hpp\"\n\nusing namespace flut;\n\nnamespace vis\n{\n\tosg::Geode* create_tile_floor( int x_tiles, int z_tiles, float tile_width \/*= 1.0f *\/ )\n\t{\n\t\t\/\/ fill in vertices for grid, note numTilesX+1 * numTilesY+1...\n\t\tosg::Vec3Array* coords = new osg::Vec3Array;\n\t\tfor ( int z = 0; z <= z_tiles; ++z )\n\t\t{\n\t\t\tfor ( int x = 0; x <= x_tiles; ++x )\n\t\t\t\tcoords->push_back( -osg::Vec3( ( x - x_tiles \/ 2 ) * tile_width, 0, -( z - z_tiles \/ 2 ) * tile_width ) );\n\t\t}\n\n\t\t\/\/Just two colors - gray and grey\n\t\tosg::Vec4Array* colors = new osg::Vec4Array;\n\t\tcolors->push_back( osg::Vec4( 0.6f, 0.6f, 0.6f, 1.0f ) ); \/\/ white\n\t\tcolors->push_back( osg::Vec4( 0.5f, 0.5f, 0.5f, 1.0f ) ); \/\/ black\n\n\t\tosg::ref_ptr<osg::DrawElementsUShort> whitePrimitives = new osg::DrawElementsUShort( GL_QUADS );\n\t\tosg::ref_ptr<osg::DrawElementsUShort> blackPrimitives = new osg::DrawElementsUShort( GL_QUADS );\n\n\t\tint numIndicesPerRow = x_tiles + 1;\n\t\tfor ( int iz = 0; iz < z_tiles; ++iz )\n\t\t{\n\t\t\tfor ( int ix = 0; ix < x_tiles; ++ix )\n\t\t\t{\n\t\t\t\tosg::DrawElementsUShort* primitives = ( ( iz + ix ) % 2 == 0 ) ? whitePrimitives.get() : blackPrimitives.get();\n\t\t\t\tprimitives->push_back( ix + ( iz + 1 )*numIndicesPerRow );\n\t\t\t\tprimitives->push_back( ix + iz*numIndicesPerRow );\n\t\t\t\tprimitives->push_back( ( ix + 1 ) + iz*numIndicesPerRow );\n\t\t\t\tprimitives->push_back( ( ix + 1 ) + ( iz + 1 )*numIndicesPerRow );\n\t\t\t}\n\t\t}\n\n\t\t\/\/ set up a single normal\n\t\tosg::Vec3Array* normals = new osg::Vec3Array;\n\t\tnormals->push_back( osg::Vec3( 0.0f, 1.0f, 0.0f ) );\n\n\t\tosg::Geometry* geom = new osg::Geometry;\n\t\tgeom->setVertexArray( coords );\n\t\tgeom->setColorArray( colors, osg::Array::BIND_PER_PRIMITIVE_SET );\n\t\tgeom->setNormalArray( normals, osg::Array::BIND_OVERALL );\n\t\tgeom->setCullingActive( true );\n\n\t\tgeom->addPrimitiveSet( whitePrimitives.get() );\n\t\tgeom->addPrimitiveSet( blackPrimitives.get() );\n\t\tosg::Geode* geode = new osg::Geode;\n\t\tgeode->addDrawable( geom );\n\t\tgeode->getOrCreateStateSet()->setMode( GL_CULL_FACE, osg::StateAttribute::ON );\n\n\t\treturn geode;\n\t}\n\n\tSIMVIS_API osg::ref_ptr< osg::Geode > read_vtp( const string& filename )\n\t{\n\t\tprop_node root_pn = read_xml( filename );\n\t\tprop_node& poly_pn = root_pn[ \"VTKFile\" ][ \"PolyData\" ][ \"Piece\" ];\n\t\tauto point_count = poly_pn.get< int >( \"NumberOfPoints\");\n\t\tauto poly_count = poly_pn.get< int >( \"NumberOfPolys\" );\n\n\t\t\/\/ create normal and vertex array\n\t\tosg::ref_ptr<osg::Vec3Array> normals = new osg::Vec3Array( point_count );\n\t\tosg::Vec3Array* vertices = new osg::Vec3Array( point_count );\n\n\t\tauto normal_vec = from_vec_str< float >( poly_pn[ \"PointData\" ][ \"DataArray\" ].get_value(), point_count );\n\t\tauto point_vec = from_vec_str< float >( poly_pn[ \"Points\" ][ \"DataArray\" ].get_value(), point_count );\n\n\t\tflut_assert( normal_vec.size() == point_count * 3 && point_vec.size() == point_count * 3 );\n\n\t\tsize_t vec_idx = 0;\n\t\tfor ( int idx = 0; idx < point_count; ++idx )\n\t\t{\n\t\t\tnormals->at( idx ).set( normal_vec[ vec_idx ], normal_vec[ vec_idx + 1 ], normal_vec[ vec_idx  + 2] );\n\t\t\tvertices->at( idx ).set( point_vec[ vec_idx ], point_vec[ vec_idx + 1 ], point_vec[ vec_idx  + 2] );\n\t\t\tvec_idx += 3;\n\t\t}\n\n\t\tosg::ref_ptr< osg::DrawElementsUShort > trianglePrimitives = new osg::DrawElementsUShort( GL_TRIANGLES );\n\t\tosg::ref_ptr< osg::DrawElementsUShort > quadPrimitives = new osg::DrawElementsUShort( GL_QUADS );\n\n\t\t{\n\t\t\tauto con_vec = from_vec_str< int >( poly_pn[ \"Polys\" ][ 0 ].get_value(), no_index );\n\t\t\tauto ofs_vec = from_vec_str< int >( poly_pn[ \"Polys\" ][ 1 ].get_value(), no_index );\n\t\t\t\n\t\t\tfor ( size_t idx = 0; idx < ofs_vec.size(); ++idx )\n\t\t\t{\n\t\t\t\tauto end_ofs = ofs_vec[ idx ];\n\t\t\t\tauto begin_ofs = idx == 0 ? unsigned short( 0 ) : ofs_vec[ idx - 1 ];\n\t\t\t\tauto num_ver = end_ofs - begin_ofs;\n\t\t\t\tif ( num_ver == 3 )\n\t\t\t\t{\n\t\t\t\t\ttrianglePrimitives->push_back( (unsigned short) con_vec[begin_ofs] );\n\t\t\t\t\ttrianglePrimitives->push_back( (unsigned short) con_vec[begin_ofs + 1] );\n\t\t\t\t\ttrianglePrimitives->push_back( (unsigned short) con_vec[begin_ofs + 2] );\n\t\t\t\t}\n\t\t\t\telse if ( num_ver == 4 )\n\t\t\t\t{\n\t\t\t\t\tquadPrimitives->push_back( (unsigned short) con_vec[begin_ofs] );\n\t\t\t\t\tquadPrimitives->push_back( (unsigned short) con_vec[begin_ofs + 1] );\n\t\t\t\t\tquadPrimitives->push_back( (unsigned short) con_vec[begin_ofs + 2] );\n\t\t\t\t\tquadPrimitives->push_back( (unsigned short) con_vec[begin_ofs + 3] );\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t\/\/ silently ignore...\n\t\t\t\t\t\/\/flut::log::warning( \"Unknown primitive type, number of vertices = \", num_ver );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t\/\/ add primitives\n\t\tosg::Geometry* polyGeom = new osg::Geometry;\n\t\tif ( trianglePrimitives->size() > 0 )\n\t\t\tpolyGeom->addPrimitiveSet( trianglePrimitives );\n\t\tif ( quadPrimitives->size() > 0 )\n\t\t\tpolyGeom->addPrimitiveSet( quadPrimitives );\n\n\t\t\/\/ create color array (shared)\n\t\t\/\/osg::ref_ptr<osg::Vec4Array> shared_colors = new osg::Vec4Array;\n\t\t\/\/shared_colors->push_back(osg::Vec4(1.0f,0.0f,0.0f,1.0f));\n\t\t\/\/polyGeom->setColorArray( shared_colors.get(), osg::Array::BIND_OVERALL );\n\n\t\t\/\/ pass the created vertex array to the points geometry object\n\t\tpolyGeom->setVertexArray( vertices );\n\t\tpolyGeom->setNormalArray( normals, osg::Array::BIND_PER_VERTEX );\n\t\tpolyGeom->setCullingActive( true );\n\n\t\t\/\/ add the points geometry to the geode.\n\t\tosg::ref_ptr< osg::Geode > geode = new osg::Geode;\n\t\tgeode->addDrawable(polyGeom);\n\t\tgeode->getOrCreateStateSet()->setMode( GL_CULL_FACE, osg::StateAttribute::ON );\n\n\t\treturn geode;\n\t}\n\n\tvoid set_shadow_mask( osg::Node* n, bool receive, bool cast )\n\t{\n\t\tn->setNodeMask( receive ? n->getNodeMask() | OsgReceiveShadowMask : n->getNodeMask() & ~OsgReceiveShadowMask );\n\t\tn->setNodeMask( cast ? n->getNodeMask() | OsgCastShadowMask : n->getNodeMask() & ~OsgCastShadowMask );\n\t}\n}\n<commit_msg>removed specular form floor mesh<commit_after>#include \"osg_tools.h\"\n\n#include <osg\/Geometry>\n#include \"osg\/Material\"\n#include \"flut\/prop_node.hpp\"\n#include \"flut\/system\/log.hpp\"\n#include \"flut\/timer.hpp\"\n\nusing namespace flut;\n\nnamespace vis\n{\n\tosg::Geode* create_tile_floor( int x_tiles, int z_tiles, float tile_width \/*= 1.0f *\/ )\n\t{\n\t\t\/\/ fill in vertices for grid, note numTilesX+1 * numTilesY+1...\n\t\tosg::Vec3Array* coords = new osg::Vec3Array;\n\t\tfor ( int z = 0; z <= z_tiles; ++z )\n\t\t{\n\t\t\tfor ( int x = 0; x <= x_tiles; ++x )\n\t\t\t\tcoords->push_back( -osg::Vec3( ( x - x_tiles \/ 2 ) * tile_width, 0, -( z - z_tiles \/ 2 ) * tile_width ) );\n\t\t}\n\n\t\t\/\/Just two colors - gray and grey\n\t\tosg::Vec4Array* colors = new osg::Vec4Array;\n\t\tcolors->push_back( osg::Vec4( 0.6f, 0.6f, 0.6f, 1.0f ) ); \/\/ white\n\t\tcolors->push_back( osg::Vec4( 0.5f, 0.5f, 0.5f, 1.0f ) ); \/\/ black\n\n\t\tosg::ref_ptr<osg::DrawElementsUShort> whitePrimitives = new osg::DrawElementsUShort( GL_QUADS );\n\t\tosg::ref_ptr<osg::DrawElementsUShort> blackPrimitives = new osg::DrawElementsUShort( GL_QUADS );\n\n\t\tint numIndicesPerRow = x_tiles + 1;\n\t\tfor ( int iz = 0; iz < z_tiles; ++iz )\n\t\t{\n\t\t\tfor ( int ix = 0; ix < x_tiles; ++ix )\n\t\t\t{\n\t\t\t\tosg::DrawElementsUShort* primitives = ( ( iz + ix ) % 2 == 0 ) ? whitePrimitives.get() : blackPrimitives.get();\n\t\t\t\tprimitives->push_back( ix + ( iz + 1 )*numIndicesPerRow );\n\t\t\t\tprimitives->push_back( ix + iz*numIndicesPerRow );\n\t\t\t\tprimitives->push_back( ( ix + 1 ) + iz*numIndicesPerRow );\n\t\t\t\tprimitives->push_back( ( ix + 1 ) + ( iz + 1 )*numIndicesPerRow );\n\t\t\t}\n\t\t}\n\n\t\t\/\/ set up a single normal\n\t\tosg::Vec3Array* normals = new osg::Vec3Array;\n\t\tnormals->push_back( osg::Vec3( 0.0f, 1.0f, 0.0f ) );\n\n\t\tosg::Geometry* geom = new osg::Geometry;\n\t\tgeom->setVertexArray( coords );\n\t\tgeom->setColorArray( colors, osg::Array::BIND_PER_PRIMITIVE_SET );\n\t\tgeom->setNormalArray( normals, osg::Array::BIND_OVERALL );\n\t\tgeom->setCullingActive( true );\n\n\t\tgeom->addPrimitiveSet( whitePrimitives.get() );\n\t\tgeom->addPrimitiveSet( blackPrimitives.get() );\n\t\tosg::Geode* geode = new osg::Geode;\n\n\t\tosg::Material* mat = new osg::Material;\n\t\tmat->setColorMode( osg::Material::EMISSION );\n\t\tmat->setSpecular( osg::Material::FRONT_AND_BACK, osg::Vec4( 0, 0, 0, 0 ) );\n\t\tmat->setDiffuse( osg::Material::FRONT_AND_BACK, osg::Vec4( 0, 0, 0, 0 ) );\n\t\tmat->setAmbient( osg::Material::FRONT_AND_BACK, osg::Vec4( 0, 0, 0, 0 ) );\n\n\t\tgeode->addDrawable( geom );\n\n\t\tgeode->getOrCreateStateSet()->setMode( GL_CULL_FACE, osg::StateAttribute::ON );\n\t\tgeode->getOrCreateStateSet()->setAttribute( mat );\n\n\t\treturn geode;\n\t}\n\n\tSIMVIS_API osg::ref_ptr< osg::Geode > read_vtp( const string& filename )\n\t{\n\t\tprop_node root_pn = read_xml( filename );\n\t\tprop_node& poly_pn = root_pn[ \"VTKFile\" ][ \"PolyData\" ][ \"Piece\" ];\n\t\tauto point_count = poly_pn.get< int >( \"NumberOfPoints\");\n\t\tauto poly_count = poly_pn.get< int >( \"NumberOfPolys\" );\n\n\t\t\/\/ create normal and vertex array\n\t\tosg::ref_ptr<osg::Vec3Array> normals = new osg::Vec3Array( point_count );\n\t\tosg::Vec3Array* vertices = new osg::Vec3Array( point_count );\n\n\t\tauto normal_vec = from_vec_str< float >( poly_pn[ \"PointData\" ][ \"DataArray\" ].get_value(), point_count );\n\t\tauto point_vec = from_vec_str< float >( poly_pn[ \"Points\" ][ \"DataArray\" ].get_value(), point_count );\n\n\t\tflut_assert( normal_vec.size() == point_count * 3 && point_vec.size() == point_count * 3 );\n\n\t\tsize_t vec_idx = 0;\n\t\tfor ( int idx = 0; idx < point_count; ++idx )\n\t\t{\n\t\t\tnormals->at( idx ).set( normal_vec[ vec_idx ], normal_vec[ vec_idx + 1 ], normal_vec[ vec_idx  + 2] );\n\t\t\tvertices->at( idx ).set( point_vec[ vec_idx ], point_vec[ vec_idx + 1 ], point_vec[ vec_idx  + 2] );\n\t\t\tvec_idx += 3;\n\t\t}\n\n\t\tosg::ref_ptr< osg::DrawElementsUShort > trianglePrimitives = new osg::DrawElementsUShort( GL_TRIANGLES );\n\t\tosg::ref_ptr< osg::DrawElementsUShort > quadPrimitives = new osg::DrawElementsUShort( GL_QUADS );\n\n\t\t{\n\t\t\tauto con_vec = from_vec_str< int >( poly_pn[ \"Polys\" ][ 0 ].get_value(), no_index );\n\t\t\tauto ofs_vec = from_vec_str< int >( poly_pn[ \"Polys\" ][ 1 ].get_value(), no_index );\n\t\t\t\n\t\t\tfor ( size_t idx = 0; idx < ofs_vec.size(); ++idx )\n\t\t\t{\n\t\t\t\tauto end_ofs = ofs_vec[ idx ];\n\t\t\t\tauto begin_ofs = idx == 0 ? unsigned short( 0 ) : ofs_vec[ idx - 1 ];\n\t\t\t\tauto num_ver = end_ofs - begin_ofs;\n\t\t\t\tif ( num_ver == 3 )\n\t\t\t\t{\n\t\t\t\t\ttrianglePrimitives->push_back( (unsigned short) con_vec[begin_ofs] );\n\t\t\t\t\ttrianglePrimitives->push_back( (unsigned short) con_vec[begin_ofs + 1] );\n\t\t\t\t\ttrianglePrimitives->push_back( (unsigned short) con_vec[begin_ofs + 2] );\n\t\t\t\t}\n\t\t\t\telse if ( num_ver == 4 )\n\t\t\t\t{\n\t\t\t\t\tquadPrimitives->push_back( (unsigned short) con_vec[begin_ofs] );\n\t\t\t\t\tquadPrimitives->push_back( (unsigned short) con_vec[begin_ofs + 1] );\n\t\t\t\t\tquadPrimitives->push_back( (unsigned short) con_vec[begin_ofs + 2] );\n\t\t\t\t\tquadPrimitives->push_back( (unsigned short) con_vec[begin_ofs + 3] );\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t\/\/ silently ignore...\n\t\t\t\t\t\/\/flut::log::warning( \"Unknown primitive type, number of vertices = \", num_ver );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t\/\/ add primitives\n\t\tosg::Geometry* polyGeom = new osg::Geometry;\n\t\tif ( trianglePrimitives->size() > 0 )\n\t\t\tpolyGeom->addPrimitiveSet( trianglePrimitives );\n\t\tif ( quadPrimitives->size() > 0 )\n\t\t\tpolyGeom->addPrimitiveSet( quadPrimitives );\n\n\t\t\/\/ create color array (shared)\n\t\t\/\/osg::ref_ptr<osg::Vec4Array> shared_colors = new osg::Vec4Array;\n\t\t\/\/shared_colors->push_back(osg::Vec4(1.0f,0.0f,0.0f,1.0f));\n\t\t\/\/polyGeom->setColorArray( shared_colors.get(), osg::Array::BIND_OVERALL );\n\n\t\t\/\/ pass the created vertex array to the points geometry object\n\t\tpolyGeom->setVertexArray( vertices );\n\t\tpolyGeom->setNormalArray( normals, osg::Array::BIND_PER_VERTEX );\n\t\tpolyGeom->setCullingActive( true );\n\n\t\t\/\/ add the points geometry to the geode.\n\t\tosg::ref_ptr< osg::Geode > geode = new osg::Geode;\n\t\tgeode->addDrawable(polyGeom);\n\t\tgeode->getOrCreateStateSet()->setMode( GL_CULL_FACE, osg::StateAttribute::ON );\n\n\t\treturn geode;\n\t}\n\n\tvoid set_shadow_mask( osg::Node* n, bool receive, bool cast )\n\t{\n\t\tn->setNodeMask( receive ? n->getNodeMask() | OsgReceiveShadowMask : n->getNodeMask() & ~OsgReceiveShadowMask );\n\t\tn->setNodeMask( cast ? n->getNodeMask() | OsgCastShadowMask : n->getNodeMask() & ~OsgCastShadowMask );\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * MIT License\n *\n * Copyright (c) 2016-2019 xiongziliang <771730766@qq.com>\n *\n * This file is part of ZLMediaKit(https:\/\/github.com\/xiongziliang\/ZLMediaKit).\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 <signal.h>\n#include <iostream>\n#include \"Util\/logger.h\"\n#include \"Util\/NoticeCenter.h\"\n#include \"Poller\/EventPoller.h\"\n#include \"Player\/PlayerProxy.h\"\n#include \"Rtmp\/RtmpPusher.h\"\n#include \"Common\/config.h\"\n#include \"Pusher\/MediaPusher.h\"\n\nusing namespace std;\nusing namespace toolkit;\nusing namespace mediakit;\n\n\/\/推流器，保持强引用\nMediaPusher::Ptr pusher;\nTimer::Ptr g_timer;\n\n\/\/声明函数\nvoid rePushDelay(const EventPoller::Ptr &poller,const string &schema,const string &vhost,const string &app, const string &stream, const string &url);\n\n\/\/创建推流器并开始推流\nvoid createPusher(const EventPoller::Ptr &poller, const string &schema,const string &vhost,const string &app, const string &stream, const string &url) {\n    \/\/创建推流器并绑定一个MediaSource\n    pusher.reset(new MediaPusher(schema,vhost, app, stream,poller));\n    \/\/可以指定rtsp推流方式，支持tcp和udp方式，默认tcp\n\/\/    (*pusher)[Client::kRtpType] = Rtsp::RTP_UDP;\n    \/\/设置推流中断处理逻辑\n    pusher->setOnShutdown([poller,schema,vhost, app, stream, url](const SockException &ex) {\n        WarnL << \"Server connection is closed:\" << ex.getErrCode() << \" \" << ex.what();\n        \/\/重试\n        rePushDelay(poller,schema,vhost,app, stream, url);\n    });\n    \/\/设置发布结果处理逻辑\n    pusher->setOnPublished([poller,schema,vhost, app, stream, url](const SockException &ex) {\n        if (ex) {\n            WarnL << \"Publish fail:\" << ex.getErrCode() << \" \" << ex.what();\n            \/\/如果发布失败，就重试\n            rePushDelay(poller,schema,vhost,app, stream, url);\n        } else {\n            InfoL << \"Publish success,Please play with player:\" << url;\n        }\n    });\n    pusher->publish(url);\n}\n\n\/\/推流失败或断开延迟2秒后重试推流\nvoid rePushDelay(const EventPoller::Ptr &poller,const string &schema,const string &vhost,const string &app, const string &stream, const string &url) {\n    g_timer = std::make_shared<Timer>(2,[poller,schema,vhost,app, stream, url]() {\n        InfoL << \"Re-Publishing...\";\n        \/\/重新推流\n        createPusher(poller,schema,vhost,app, stream, url);\n        \/\/此任务不重复\n        return false;\n    }, poller);\n}\n\n\/\/这里才是真正执行main函数，你可以把函数名(domain)改成main，然后就可以输入自定义url了\nint domain(const string &playUrl, const string &pushUrl) {\n    \/\/设置日志\n    Logger::Instance().add(std::make_shared<ConsoleChannel>());\n    Logger::Instance().setWriter(std::make_shared<AsyncLogWriter>());\n    auto poller = EventPollerPool::Instance().getPoller();\n\n    \/\/拉一个流，生成一个RtmpMediaSource，源的名称是\"app\/stream\"\n    \/\/你也可以以其他方式生成RtmpMediaSource，比如说MP4文件（请查看test_rtmpPusherMp4.cpp代码）\n    PlayerProxy::Ptr player(new PlayerProxy(DEFAULT_VHOST, \"app\", \"stream\",true,true,false,false,-1 , poller));\n    \/\/可以指定rtsp拉流方式，支持tcp和udp方式，默认tcp\n\/\/    (*player)[Client::kRtpType] = Rtsp::RTP_UDP;\n    player->play(playUrl.data());\n\n    \/\/监听RtmpMediaSource注册事件,在PlayerProxy播放成功后触发\n    NoticeCenter::Instance().addListener(nullptr, Broadcast::kBroadcastMediaChanged,\n                                         [pushUrl,poller](BroadcastMediaChangedArgs) {\n                                             \/\/媒体源\"app\/stream\"已经注册，这时方可新建一个RtmpPusher对象并绑定该媒体源\n                                             if(bRegist && pushUrl.find(sender.getSchema()) == 0){\n                                                 createPusher(poller,sender.getSchema(),sender.getVhost(),sender.getApp(), sender.getId(), pushUrl);\n                                             }\n                                         });\n\n    \/\/设置退出信号处理函数\n    static semaphore sem;\n    signal(SIGINT, [](int) { sem.post(); });\/\/ 设置退出信号\n    sem.wait();\n    pusher.reset();\n    g_timer.reset();\n    return 0;\n}\n\n\nint main(int argc, char *argv[]) {\n    return domain(\"rtmp:\/\/live.hkstv.hk.lxdns.com\/live\/hks1\", \"rtsp:\/\/127.0.0.1\/live\/rtsp_push\");\n}\n\n\n\n\n\n\n<commit_msg>不全部转换rtsp或rtmp<commit_after>\/*\n * MIT License\n *\n * Copyright (c) 2016-2019 xiongziliang <771730766@qq.com>\n *\n * This file is part of ZLMediaKit(https:\/\/github.com\/xiongziliang\/ZLMediaKit).\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 <signal.h>\n#include <iostream>\n#include \"Util\/logger.h\"\n#include \"Util\/NoticeCenter.h\"\n#include \"Poller\/EventPoller.h\"\n#include \"Player\/PlayerProxy.h\"\n#include \"Rtmp\/RtmpPusher.h\"\n#include \"Common\/config.h\"\n#include \"Pusher\/MediaPusher.h\"\n\nusing namespace std;\nusing namespace toolkit;\nusing namespace mediakit;\n\n\/\/推流器，保持强引用\nMediaPusher::Ptr pusher;\nTimer::Ptr g_timer;\n\n\/\/声明函数\nvoid rePushDelay(const EventPoller::Ptr &poller,const string &schema,const string &vhost,const string &app, const string &stream, const string &url);\n\n\/\/创建推流器并开始推流\nvoid createPusher(const EventPoller::Ptr &poller, const string &schema,const string &vhost,const string &app, const string &stream, const string &url) {\n    \/\/创建推流器并绑定一个MediaSource\n    pusher.reset(new MediaPusher(schema,vhost, app, stream,poller));\n    \/\/可以指定rtsp推流方式，支持tcp和udp方式，默认tcp\n\/\/    (*pusher)[Client::kRtpType] = Rtsp::RTP_UDP;\n    \/\/设置推流中断处理逻辑\n    pusher->setOnShutdown([poller,schema,vhost, app, stream, url](const SockException &ex) {\n        WarnL << \"Server connection is closed:\" << ex.getErrCode() << \" \" << ex.what();\n        \/\/重试\n        rePushDelay(poller,schema,vhost,app, stream, url);\n    });\n    \/\/设置发布结果处理逻辑\n    pusher->setOnPublished([poller,schema,vhost, app, stream, url](const SockException &ex) {\n        if (ex) {\n            WarnL << \"Publish fail:\" << ex.getErrCode() << \" \" << ex.what();\n            \/\/如果发布失败，就重试\n            rePushDelay(poller,schema,vhost,app, stream, url);\n        } else {\n            InfoL << \"Publish success,Please play with player:\" << url;\n        }\n    });\n    pusher->publish(url);\n}\n\n\/\/推流失败或断开延迟2秒后重试推流\nvoid rePushDelay(const EventPoller::Ptr &poller,const string &schema,const string &vhost,const string &app, const string &stream, const string &url) {\n    g_timer = std::make_shared<Timer>(2,[poller,schema,vhost,app, stream, url]() {\n        InfoL << \"Re-Publishing...\";\n        \/\/重新推流\n        createPusher(poller,schema,vhost,app, stream, url);\n        \/\/此任务不重复\n        return false;\n    }, poller);\n}\n\n\/\/这里才是真正执行main函数，你可以把函数名(domain)改成main，然后就可以输入自定义url了\nint domain(const string &playUrl, const string &pushUrl) {\n    \/\/设置日志\n    Logger::Instance().add(std::make_shared<ConsoleChannel>());\n    Logger::Instance().setWriter(std::make_shared<AsyncLogWriter>());\n    auto poller = EventPollerPool::Instance().getPoller();\n\n    \/\/拉一个流，生成一个RtmpMediaSource，源的名称是\"app\/stream\"\n    \/\/你也可以以其他方式生成RtmpMediaSource，比如说MP4文件（请查看test_rtmpPusherMp4.cpp代码）\n    MediaInfo info(pushUrl);\n    bool enable_rtsp = true;\n    bool enable_rtmp = true;\n    if(info._schema == RTSP_SCHEMA){\n        enable_rtmp = false;\n    }else if(info._schema == RTMP_SCHEMA){\n        enable_rtsp = false;\n    }\n    PlayerProxy::Ptr player(new PlayerProxy(DEFAULT_VHOST, \"app\", \"stream\",enable_rtsp,enable_rtmp,false,false,-1 , poller));\n    \/\/可以指定rtsp拉流方式，支持tcp和udp方式，默认tcp\n\/\/    (*player)[Client::kRtpType] = Rtsp::RTP_UDP;\n    player->play(playUrl.data());\n\n    \/\/监听RtmpMediaSource注册事件,在PlayerProxy播放成功后触发\n    NoticeCenter::Instance().addListener(nullptr, Broadcast::kBroadcastMediaChanged,\n                                         [pushUrl,poller](BroadcastMediaChangedArgs) {\n                                             \/\/媒体源\"app\/stream\"已经注册，这时方可新建一个RtmpPusher对象并绑定该媒体源\n                                             if(bRegist && pushUrl.find(sender.getSchema()) == 0){\n                                                 createPusher(poller,sender.getSchema(),sender.getVhost(),sender.getApp(), sender.getId(), pushUrl);\n                                             }\n                                         });\n\n    \/\/设置退出信号处理函数\n    static semaphore sem;\n    signal(SIGINT, [](int) { sem.post(); });\/\/ 设置退出信号\n    sem.wait();\n    pusher.reset();\n    g_timer.reset();\n    return 0;\n}\n\n\nint main(int argc, char *argv[]) {\n    return domain(\"rtmp:\/\/live.hkstv.hk.lxdns.com\/live\/hks1\", \"rtsp:\/\/127.0.0.1\/live\/rtsp_push\");\n}\n\n\n\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include <bits\/stdc++.h>\nusing namespace std;\n\nint main(){\n    \/\/ifstream cin(\"in.txt\");\n    \/\/ofstream cout(\"out.txt\");\n    int n, m;\n    int cas = 1;\n    while (cin >> n >> m, n||m){\n        \/\/if(cas != 1) cout << endl;\n        vector <string> a(n);\n        for(int i=0; i<n; i++) cin >> a[i];\n        for(int i=0; i<n; i++){\n            for(int j=0; j<m; j++){\n                if(a[i][j] == '.') a[i][j] = '0';\n            }\n        }\n        for(int i=0; i<n; i++){\n            for(int j=0; j<m; j++){\n                if(a[i][j] == '*'){\n                    if(i-1>=0 && a[i-1][j] != '*') a[i-1][j]++;\n                    if(i-1>=0 && j+1<m && a[i-1][j+1] != '*') a[i-1][j+1]++;\n                    if(j+1<m && a[i][j+1] != '*') a[i][j+1]++;\n                    if(i+1<n && j+1<m && a[i+1][j+1] != '*') a[i+1][j+1]++;\n                    if(i+1<n && a[i+1][j] != '*') a[i+1][j]++;\n                    if(i+1<n && j-1>=0 && a[i+1][j-1] != '*') a[i+1][j-1]++;\n                    if(j-1>=0 && a[i][j-1] != '*') a[i][j-1]++;\n                    if(i-1>=0 && j-1>=0 && a[i-1][j-1] != '*') a[i-1][j-1]++;\n                }\n            }\n        }\n        cout << \"Field #\" << cas << \":\" << endl;\n        for(int i=0; i<n; i++){\n            cout << a[i] << endl;\n        }\n        cout << endl;\n        cas++;\n    }\n    return 0;\n}\n<commit_msg>Update minesweeper.cpp<commit_after>#include <bits\/stdc++.h>\nusing namespace std;\n\nint main(){\n    \/\/ifstream cin(\"in.txt\");\n    \/\/ofstream cout(\"out.txt\");\n    int n, m;\n    int cas = 1;\n    while (cin >> n >> m, n||m){\n        if(cas != 1) cout << endl;\n        vector <string> a(n);\n        for(int i=0; i<n; i++) cin >> a[i];\n        for(int i=0; i<n; i++){\n            for(int j=0; j<m; j++){\n                if(a[i][j] == '.') a[i][j] = '0';\n            }\n        }\n        for(int i=0; i<n; i++){\n            for(int j=0; j<m; j++){\n                if(a[i][j] == '*'){\n                    if(i-1>=0 && a[i-1][j] != '*') a[i-1][j]++;\n                    if(i-1>=0 && j+1<m && a[i-1][j+1] != '*') a[i-1][j+1]++;\n                    if(j+1<m && a[i][j+1] != '*') a[i][j+1]++;\n                    if(i+1<n && j+1<m && a[i+1][j+1] != '*') a[i+1][j+1]++;\n                    if(i+1<n && a[i+1][j] != '*') a[i+1][j]++;\n                    if(i+1<n && j-1>=0 && a[i+1][j-1] != '*') a[i+1][j-1]++;\n                    if(j-1>=0 && a[i][j-1] != '*') a[i][j-1]++;\n                    if(i-1>=0 && j-1>=0 && a[i-1][j-1] != '*') a[i-1][j-1]++;\n                }\n            }\n        }\n        cout << \"Field #\" << cas << \":\" << endl;\n        for(int i=0; i<n; i++){\n            cout << a[i] << endl;\n        }\n        \/\/cout << endl;\n        cas++;\n    }\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#include \"SampleCode.h\"\n#include \"SkView.h\"\n#include \"SkCanvas.h\"\n#include \"Sk64.h\"\n#include \"SkCornerPathEffect.h\"\n#include \"SkGradientShader.h\"\n#include \"SkGraphics.h\"\n#include \"SkImageDecoder.h\"\n#include \"SkKernel33MaskFilter.h\"\n#include \"SkPath.h\"\n#include \"SkRandom.h\"\n#include \"SkRegion.h\"\n#include \"SkShader.h\"\n#include \"SkUtils.h\"\n#include \"SkColorPriv.h\"\n#include \"SkColorFilter.h\"\n#include \"SkTime.h\"\n#include \"SkTypeface.h\"\n#include \"SkXfermode.h\"\n\n#include \"SkStream.h\"\n#include \"SkXMLParser.h\"\n#include \"SkColorPriv.h\"\n#include \"SkImageDecoder.h\"\n#include \"SkBlurMaskFilter.h\"\n\n#ifdef SK_BUILD_FOR_MAC\n#import <ApplicationServices\/ApplicationServices.h>\nSkTypeface* SkCreateTypefaceFromCTFont(CTFontRef fontRef);\n#endif\n\nstatic void setNamedTypeface(SkPaint* paint, const char name[]) {\n    SkTypeface* face = SkTypeface::CreateFromName(name, SkTypeface::kNormal);\n    paint->setTypeface(face);\n    SkSafeUnref(face);\n}\n\nstatic uint16_t gBG[] = { 0xFFFF, 0xCCCF, 0xCCCF, 0xFFFF };\n\nclass XfermodesBlurView : public SampleView {\n    SkBitmap    fBG;\n    SkBitmap    fSrcB, fDstB;\n\n    void draw_mode(SkCanvas* canvas, SkXfermode* mode, int alpha,\n                   SkScalar x, SkScalar y) {\n        SkPaint p;\n        SkMaskFilter* mf = SkBlurMaskFilter::Create(5, SkBlurMaskFilter::kNormal_BlurStyle, 0);\n        p.setMaskFilter(mf)->unref();\n\n        SkScalar ww = SkIntToScalar(W);\n        SkScalar hh = SkIntToScalar(H);\n\n        \/\/ draw a circle covering the upper\n        \/\/ left three quarters of the canvas\n        p.setColor(0xFFCC44FF);\n        SkRect r;\n        r.set(0, 0, ww*3\/4, hh*3\/4);\n        r.offset(x, y);\n        canvas->drawOval(r, p);\n\n        p.setXfermode(mode);\n\n        \/\/ draw a square overlapping the circle\n        \/\/ in the lower right of the canvas\n        p.setColor(0x00AA6633 | alpha << 24);\n        r.set(ww\/3, hh\/3, ww*19\/20, hh*19\/20);\n        r.offset(x, y);\n        canvas->drawRect(r, p);\n\n#ifdef SK_BUILD_FOR_MAC\n        static const char* gNames[] = { \"Arial\", \"Times\", \"Courier\", \"Lucida\" };\n        for (size_t j = 0; j < SK_ARRAY_COUNT(gNames); ++j) {\n            CFStringRef name = CFStringCreateWithCString(NULL, gNames[j], kCFStringEncodingUTF8);\n            CTFontRef font = CTFontCreateWithName(name, 0, NULL);\n            SkTypeface* face = SkCreateTypefaceFromCTFont(font);\n            SkDebugf(\"%s ct:%p face:%p ats:%p\\n\", gNames[j], font, face, CTFontGetPlatformFont(font, NULL));\n            for (int i = 9; i <= 24; ++i) {\n                CTFontRef newFont = CTFontCreateCopyWithAttributes(font, i, NULL, NULL);\n                SkTypeface* newFace = SkCreateTypefaceFromCTFont(newFont);\n                SkDebugf(\"size:%d ct:%p face:%p ats:%p\\n\", i, newFont, newFace, CTFontGetPlatformFont(newFont, NULL));\n                newFace->unref();\n                CFRelease(newFont);\n            }\n            face->unref();\n            CFRelease(font);\n            CFRelease(name);\n        }\n#endif\n    }\n\npublic:\n    const static int W = 64;\n    const static int H = 64;\n    XfermodesBlurView() {\n        fBG.setConfig(SkBitmap::kARGB_4444_Config, 2, 2, 4);\n        fBG.setPixels(gBG);\n        fBG.setIsOpaque(true);\n    }\n\nprotected:\n    \/\/ overrides from SkEventSink\n    virtual bool onQuery(SkEvent* evt) {\n        if (SampleCode::TitleQ(*evt)) {\n            SampleCode::TitleR(evt, \"XfermodesBlur\");\n            return true;\n        }\n        return this->INHERITED::onQuery(evt);\n    }\n\n    virtual void onDrawContent(SkCanvas* canvas) {\n        canvas->translate(SkIntToScalar(10), SkIntToScalar(20));\n\n        if (false) {\n            SkPaint paint;\n            paint.setAntiAlias(true);\n            paint.setTextSize(50);\n            paint.setTypeface(SkTypeface::CreateFromName(\"Arial Unicode MS\", SkTypeface::kNormal));\n            SkSafeUnref(paint.getTypeface());\n            char buffer[10];\n            size_t len = SkUTF8_FromUnichar(0x8500, buffer);\n            canvas->drawText(buffer, len, 40, 40, paint);\n            return;\n        }\n        if (false) {\n            SkPaint paint;\n            paint.setAntiAlias(true);\n\n            SkRect r0 = { 0, 0, 10.5f, 20 };\n            SkRect r1 = { 10.5f, 10, 20, 30 };\n            paint.setColor(SK_ColorRED);\n            canvas->drawRect(r0, paint);\n            paint.setColor(SK_ColorBLUE);\n            canvas->drawRect(r1, paint);\n            return;\n        }\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::kModulate_Mode,     \"Modulate\"      },\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        const SkScalar w = SkIntToScalar(W);\n        const SkScalar h = SkIntToScalar(H);\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.setLCDRenderText(true);\n        labelP.setTextAlign(SkPaint::kCenter_Align);\n        setNamedTypeface(&labelP, \"Menlo Regular\");\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                SkAutoUnref aur(mode);\n                SkRect r;\n                r.set(x, y, x+w, y+h);\n\n                SkPaint p;\n                p.setStyle(SkPaint::kFill_Style);\n                p.setShader(s);\n                canvas->drawRect(r, p);\n\n                canvas->saveLayer(&r, NULL, SkCanvas::kARGB_ClipLayer_SaveFlag);\n                draw_mode(canvas, mode, twice ? 0x88 : 0xFF, r.fLeft, r.fTop);\n                canvas->restore();\n\n                r.inset(-SK_ScalarHalf, -SK_ScalarHalf);\n                p.setStyle(SkPaint::kStroke_Style);\n                p.setShader(NULL);\n                canvas->drawRect(r, p);\n\n                canvas->drawText(gModes[i].fLabel, strlen(gModes[i].fLabel),\n                                 x + w\/2, y - labelP.getTextSize()\/2, labelP);\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 SampleView INHERITED;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic SkView* MyFactory() { return new XfermodesBlurView; }\nstatic SkViewRegister reg(MyFactory);\n<commit_msg>remove obsolete mac-font-cruft<commit_after>\n\/*\n * Copyright 2011 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n#include \"SampleCode.h\"\n#include \"SkView.h\"\n#include \"SkCanvas.h\"\n#include \"Sk64.h\"\n#include \"SkCornerPathEffect.h\"\n#include \"SkGradientShader.h\"\n#include \"SkGraphics.h\"\n#include \"SkImageDecoder.h\"\n#include \"SkKernel33MaskFilter.h\"\n#include \"SkPath.h\"\n#include \"SkRandom.h\"\n#include \"SkRegion.h\"\n#include \"SkShader.h\"\n#include \"SkUtils.h\"\n#include \"SkColorPriv.h\"\n#include \"SkColorFilter.h\"\n#include \"SkTime.h\"\n#include \"SkTypeface.h\"\n#include \"SkXfermode.h\"\n\n#include \"SkStream.h\"\n#include \"SkXMLParser.h\"\n#include \"SkColorPriv.h\"\n#include \"SkImageDecoder.h\"\n#include \"SkBlurMaskFilter.h\"\n\nstatic void setNamedTypeface(SkPaint* paint, const char name[]) {\n    SkTypeface* face = SkTypeface::CreateFromName(name, SkTypeface::kNormal);\n    paint->setTypeface(face);\n    SkSafeUnref(face);\n}\n\nstatic uint16_t gBG[] = { 0xFFFF, 0xCCCF, 0xCCCF, 0xFFFF };\n\nclass XfermodesBlurView : public SampleView {\n    SkBitmap    fBG;\n    SkBitmap    fSrcB, fDstB;\n\n    void draw_mode(SkCanvas* canvas, SkXfermode* mode, int alpha,\n                   SkScalar x, SkScalar y) {\n        SkPaint p;\n        SkMaskFilter* mf = SkBlurMaskFilter::Create(5, SkBlurMaskFilter::kNormal_BlurStyle, 0);\n        p.setMaskFilter(mf)->unref();\n\n        SkScalar ww = SkIntToScalar(W);\n        SkScalar hh = SkIntToScalar(H);\n\n        \/\/ draw a circle covering the upper\n        \/\/ left three quarters of the canvas\n        p.setColor(0xFFCC44FF);\n        SkRect r;\n        r.set(0, 0, ww*3\/4, hh*3\/4);\n        r.offset(x, y);\n        canvas->drawOval(r, p);\n\n        p.setXfermode(mode);\n\n        \/\/ draw a square overlapping the circle\n        \/\/ in the lower right of the canvas\n        p.setColor(0x00AA6633 | alpha << 24);\n        r.set(ww\/3, hh\/3, ww*19\/20, hh*19\/20);\n        r.offset(x, y);\n        canvas->drawRect(r, p);\n    }\n\npublic:\n    const static int W = 64;\n    const static int H = 64;\n    XfermodesBlurView() {\n        fBG.setConfig(SkBitmap::kARGB_4444_Config, 2, 2, 4);\n        fBG.setPixels(gBG);\n        fBG.setIsOpaque(true);\n    }\n\nprotected:\n    \/\/ overrides from SkEventSink\n    virtual bool onQuery(SkEvent* evt) {\n        if (SampleCode::TitleQ(*evt)) {\n            SampleCode::TitleR(evt, \"XfermodesBlur\");\n            return true;\n        }\n        return this->INHERITED::onQuery(evt);\n    }\n\n    virtual void onDrawContent(SkCanvas* canvas) {\n        canvas->translate(SkIntToScalar(10), SkIntToScalar(20));\n\n        if (false) {\n            SkPaint paint;\n            paint.setAntiAlias(true);\n            paint.setTextSize(50);\n            paint.setTypeface(SkTypeface::CreateFromName(\"Arial Unicode MS\", SkTypeface::kNormal));\n            SkSafeUnref(paint.getTypeface());\n            char buffer[10];\n            size_t len = SkUTF8_FromUnichar(0x8500, buffer);\n            canvas->drawText(buffer, len, 40, 40, paint);\n            return;\n        }\n        if (false) {\n            SkPaint paint;\n            paint.setAntiAlias(true);\n\n            SkRect r0 = { 0, 0, 10.5f, 20 };\n            SkRect r1 = { 10.5f, 10, 20, 30 };\n            paint.setColor(SK_ColorRED);\n            canvas->drawRect(r0, paint);\n            paint.setColor(SK_ColorBLUE);\n            canvas->drawRect(r1, paint);\n            return;\n        }\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::kModulate_Mode,     \"Modulate\"      },\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        const SkScalar w = SkIntToScalar(W);\n        const SkScalar h = SkIntToScalar(H);\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.setLCDRenderText(true);\n        labelP.setTextAlign(SkPaint::kCenter_Align);\n        setNamedTypeface(&labelP, \"Menlo Regular\");\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                SkAutoUnref aur(mode);\n                SkRect r;\n                r.set(x, y, x+w, y+h);\n\n                SkPaint p;\n                p.setStyle(SkPaint::kFill_Style);\n                p.setShader(s);\n                canvas->drawRect(r, p);\n\n                canvas->saveLayer(&r, NULL, SkCanvas::kARGB_ClipLayer_SaveFlag);\n                draw_mode(canvas, mode, twice ? 0x88 : 0xFF, r.fLeft, r.fTop);\n                canvas->restore();\n\n                r.inset(-SK_ScalarHalf, -SK_ScalarHalf);\n                p.setStyle(SkPaint::kStroke_Style);\n                p.setShader(NULL);\n                canvas->drawRect(r, p);\n\n                canvas->drawText(gModes[i].fLabel, strlen(gModes[i].fLabel),\n                                 x + w\/2, y - labelP.getTextSize()\/2, labelP);\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 SampleView INHERITED;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic SkView* MyFactory() { return new XfermodesBlurView; }\nstatic SkViewRegister reg(MyFactory);\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2012-2014 Branimir Karadzic. All rights reserved.\n * License: http:\/\/www.opensource.org\/licenses\/BSD-2-Clause\n *\/\n\n#include \"test.h\"\n#include <bx\/tokenizecmd.h>\n#include <string.h>\n\nTEST(tokenizeCommandLine)\n{\n\tconst char* input[] =\n\t{\n\t\t\"       \",\n\t\t\"\\\\\",\n\/\/\t\t\"\\\"a b c\\\" d e\",\n\t\t\"\\\"ab\\\\\\\"c\\\" \\\"\\\\\\\\\\\" d\",\n\t\t\"a\\\\\\\\\\\\b d\\\"e f\\\"g h\",\n\t\t\"a\\\\\\\\\\\\\\\"b c d\",\n\t\t\"a\\\\\\\\\\\\\\\\\\\"b c\\\" d e\",\n\t};\n\n\tconst int expected_argc[] =\n\t{\n\t\t0,\n\t\t0,\n\/\/\t\t3,\n\t\t3,\n\t\t3,\n\t\t3,\n\t\t3\n\t};\n\n\tconst char* expected_results[] =\n\t{\n\t\t\"a b c\", \"d\", \"e\",\n\t\t\"ab\\\"c\", \"\\\\\", \"d\",\n\t\t\"a\\\\\\\\\\\\b\", \"de fg\", \"h\",\n\t\t\"a\\\\\\\"b\", \"c\", \"d\",\n\t\t\"a\\\\\\\\b c\", \"d\", \"e\",\n\t};\n\n\tconst char** expected_argv[] =\n\t{\n\t\tNULL,\n\t\tNULL,\n\/\/\t\t&expected_results[0],\n\t\t&expected_results[3],\n\t\t&expected_results[6],\n\t\t&expected_results[9],\n\t\t&expected_results[12],\n\t};\n\n\tfor (uint32_t ii = 0; ii < BX_COUNTOF(exptected_argv); ++ii)\n\t{\n\t\tprintf(\"x\\n\");\n\t\tchar commandLine[1024];\n\t\tuint32_t size = BX_COUNTOF(commandLine);\n\t\tchar* argv[50];\n\t\tint32_t argc;\n\t\tbx::tokenizeCommandLine(input[ii], commandLine, size, argc, argv, BX_COUNTOF(argv) );\n\t\tprintf(\"\\n%d (%d): %s %s\\n\", ii, argc, input[ii], expected_argc[ii] == argc ? \"\" : \"FAILED!\");\n\t\tfor (uint32_t jj = 0; jj < argc; ++jj)\n\t\t{\n\t\t\tprintf(\"\\t%d: {%s} %s\\n\"\n\t\t\t\t\t, jj\n\t\t\t\t\t, argv[jj]\n\t\t\t\t\t, jj < argc ? (0==strcmp(argv[jj], expected_argv[ii][jj]) ? \"\" : \"FAILED!\") : \"FAILED!\"\n\t\t\t\t\t);\n\t\t}\n\t}\n}\n<commit_msg>Disabled tokenizer test.<commit_after>\/*\n * Copyright 2012-2014 Branimir Karadzic. All rights reserved.\n * License: http:\/\/www.opensource.org\/licenses\/BSD-2-Clause\n *\/\n\n#include \"test.h\"\n#include <bx\/tokenizecmd.h>\n#include <string.h>\n\nTEST(tokenizeCommandLine)\n{\n#if 0\n\tconst char* input[] =\n\t{\n\t\t\"       \",\n\t\t\"\\\\\",\n\/\/\t\t\"\\\"a b c\\\" d e\",\n\t\t\"\\\"ab\\\\\\\"c\\\" \\\"\\\\\\\\\\\" d\",\n\t\t\"a\\\\\\\\\\\\b d\\\"e f\\\"g h\",\n\t\t\"a\\\\\\\\\\\\\\\"b c d\",\n\t\t\"a\\\\\\\\\\\\\\\\\\\"b c\\\" d e\",\n\t};\n\n\tconst int expected_argc[] =\n\t{\n\t\t0,\n\t\t0,\n\/\/\t\t3,\n\t\t3,\n\t\t3,\n\t\t3,\n\t\t3\n\t};\n\n\tconst char* expected_results[] =\n\t{\n\t\t\"a b c\", \"d\", \"e\",\n\t\t\"ab\\\"c\", \"\\\\\", \"d\",\n\t\t\"a\\\\\\\\\\\\b\", \"de fg\", \"h\",\n\t\t\"a\\\\\\\"b\", \"c\", \"d\",\n\t\t\"a\\\\\\\\b c\", \"d\", \"e\",\n\t};\n\n\tconst char** expected_argv[] =\n\t{\n\t\tNULL,\n\t\tNULL,\n\/\/\t\t&expected_results[0],\n\t\t&expected_results[3],\n\t\t&expected_results[6],\n\t\t&expected_results[9],\n\t\t&expected_results[12],\n\t};\n\n\tfor (uint32_t ii = 0; ii < BX_COUNTOF(exptected_argv); ++ii)\n\t{\n\t\tprintf(\"x\\n\");\n\t\tchar commandLine[1024];\n\t\tuint32_t size = BX_COUNTOF(commandLine);\n\t\tchar* argv[50];\n\t\tint32_t argc;\n\t\tbx::tokenizeCommandLine(input[ii], commandLine, size, argc, argv, BX_COUNTOF(argv) );\n\t\tprintf(\"\\n%d (%d): %s %s\\n\", ii, argc, input[ii], expected_argc[ii] == argc ? \"\" : \"FAILED!\");\n\t\tfor (uint32_t jj = 0; jj < argc; ++jj)\n\t\t{\n\t\t\tprintf(\"\\t%d: {%s} %s\\n\"\n\t\t\t\t\t, jj\n\t\t\t\t\t, argv[jj]\n\t\t\t\t\t, jj < argc ? (0==strcmp(argv[jj], expected_argv[ii][jj]) ? \"\" : \"FAILED!\") : \"FAILED!\"\n\t\t\t\t\t);\n\t\t}\n\t}\n#endif \/\/ 0\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n  * Touhou Community Reliant Automatic Patcher\n  * Main DLL\n  *\n  * ----\n  *\n  * Globals, compile-time constants and runconfig abstractions.\n  *\/\n\n#include \"thcrap.h\"\n\nCRITICAL_SECTION cs_file_access;\njson_t* run_cfg = NULL;\n\nconst char* PROJECT_NAME(void)\n{\n\treturn \"Touhou Community Reliant Automatic Patcher\";\n}\nconst char* PROJECT_NAME_SHORT(void)\n{\n\treturn \"thcrap\";\n}\nDWORD PROJECT_VERSION(void)\n{\n\treturn 0x20170602;\n}\nconst char* PROJECT_VERSION_STRING(void)\n{\n\tstatic char ver_str[11] = {0};\n\tif(!ver_str[0]) {\n\t\tstr_hexdate_format(ver_str, PROJECT_VERSION());\n\t}\n\treturn ver_str;\n}\njson_t* runconfig_get(void)\n{\n\treturn run_cfg;\n}\nvoid runconfig_set(json_t *new_run_cfg)\n{\n\tjson_decref(run_cfg);\n\trun_cfg = json_incref(new_run_cfg);\n}\n\nconst json_t *runconfig_title_get(void)\n{\n\tconst json_t *id = json_object_get(run_cfg, \"game\");\n\tconst json_t *title = strings_get(json_string_value(id));\n\tif(!title) {\n\t\ttitle = json_object_get(run_cfg, \"title\");\n\t}\n\treturn title ? title : (id ? id : NULL);\n}\n<commit_msg>Update version number<commit_after>\/**\n  * Touhou Community Reliant Automatic Patcher\n  * Main DLL\n  *\n  * ----\n  *\n  * Globals, compile-time constants and runconfig abstractions.\n  *\/\n\n#include \"thcrap.h\"\n\nCRITICAL_SECTION cs_file_access;\njson_t* run_cfg = NULL;\n\nconst char* PROJECT_NAME(void)\n{\n\treturn \"Touhou Community Reliant Automatic Patcher\";\n}\nconst char* PROJECT_NAME_SHORT(void)\n{\n\treturn \"thcrap\";\n}\nDWORD PROJECT_VERSION(void)\n{\n\treturn 0x20170618;\n}\nconst char* PROJECT_VERSION_STRING(void)\n{\n\tstatic char ver_str[11] = {0};\n\tif(!ver_str[0]) {\n\t\tstr_hexdate_format(ver_str, PROJECT_VERSION());\n\t}\n\treturn ver_str;\n}\njson_t* runconfig_get(void)\n{\n\treturn run_cfg;\n}\nvoid runconfig_set(json_t *new_run_cfg)\n{\n\tjson_decref(run_cfg);\n\trun_cfg = json_incref(new_run_cfg);\n}\n\nconst json_t *runconfig_title_get(void)\n{\n\tconst json_t *id = json_object_get(run_cfg, \"game\");\n\tconst json_t *title = strings_get(json_string_value(id));\n\tif(!title) {\n\t\ttitle = json_object_get(run_cfg, \"title\");\n\t}\n\treturn title ? title : (id ? id : NULL);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (C) 1999-2018\n\/\/ Smithsonian Astrophysical Observatory, Cambridge, MA, USA\n\/\/ For conditions of distribution and use, see copyright notice in \"copyright\"\n\n#include \"contour.h\"\n#include \"base.h\"\n#include \"context.h\"\n\n\/\/ ContourLevel\nContourLevel::ContourLevel(Base* pp, double lev, const char* cc, int ww, \n\t\t\t   int dd, int* dl) \n{\n  parent_ = pp;\n  gc_ = parent_->contourGC_;\n\n  level_ = lev;\n  colorName_ = dupstr(cc);\n  color_ = parent_->getColor(colorName_);\n  lineWidth_ = ww;\n  dash_ = dd;\n  dlist_[0] = dl[0];\n  dlist_[1] = dl[1];\n\n  previous_ = NULL;\n  next_ = NULL;\n}\n\nContourLevel::~ContourLevel()\n{\n  if (colorName_)\n    delete [] colorName_;\n}\n\nvoid ContourLevel::list(ostream& str, FitsImage* fits, \n\t\t   Coord::CoordSystem sys, Coord::SkyFrame sky)\n{\n  if (lcontour_.head()) {\n    str << \"level=\" << level_ << ' ';\n    if (strncmp(\"green\", colorName_, 5) || dash_ != 0 ||\n\tdlist_[0] != 8 || dlist_[1] != 3 || lineWidth_ != 1) {\n      if (strncmp(\"green\", colorName_, 5))\n\tstr << \"color=\" << colorName_ << ' ';\n\n      if (lineWidth_ != 1)\n\tstr << \"width=\" << lineWidth_ << ' ';\n\n      if (dash_ != 0)\n\tstr << \"dash=\" << dash_ << ' ';\n\n      if (dlist_[0] != 8 || dlist_[1] != 3)\n\tstr << \"dashlist=\" << dlist_[0] << ' ' << dlist_[1] << ' ';\n    }\n    str << endl;\n\n    do\n      lcontour_.current()->list(str, fits, sys, sky);\n    while (lcontour_.next());\n  }\n}\n\nvoid ContourLevel::render(Pixmap pmap, Coord::InternalSystem sys, \n\t\t\t  const BBox& bbox)\n{\n  if (lcontour_.head()) {\n    do\n      lcontour_.current()->render(pmap, sys, bbox);\n    while (lcontour_.next());\n  }\n}\n\nvoid ContourLevel::ps(int mode)\n{\n  if (lcontour_.head()) {\n    do\n      lcontour_.current()->ps(mode);\n    while (lcontour_.next());\n  }\n}\n\nvoid ContourLevel::updateCoords(const Matrix& mx)\n{\n  if (lcontour_.head()) {\n    do\n      lcontour_.current()->updateCoords(mx);\n    while (lcontour_.next());\n  }\n}\n\nvoid ContourLevel::setColor(const char* clr)\n{\n  if (colorName_)\n    delete [] colorName_;\n\n  colorName_ = dupstr(clr);\n  color_ = parent_->getColor(colorName_);\n}\n\n#ifdef MAC_OSX_TK\nvoid ContourLevel::macosx()\n{\n  if (lcontour_.head()) {\n    do\n      lcontour_.current()->macosx();\n    while (lcontour_.next());\n  }\n}\n#endif\n\n#ifdef __WIN32\nvoid ContourLevel::win32()\n{\n  if (lcontour_.head()) {\n    do\n      lcontour_.current()->win32();\n    while (lcontour_.next());\n  }\n}\n#endif\n\n\/\/ Contour\n\nContour::Contour(ContourLevel* cc)\n{\n  parent_ = cc;\n  base_ = cc->parent_;\n\n  previous_ = NULL;\n  next_ = NULL;\n}\n\nContour::~Contour()\n{\n}\n\nvoid Contour::list(ostream& str, FitsImage* fits, \n\t\t   Coord::CoordSystem sys, Coord::SkyFrame sky)\n{\n  if (lvertex_.head())\n    str << '(' << endl;\n    do {\n      str << ' ';\n      fits->listFromRef(str, lvertex_.current()->vector,\n\t\t\tsys, sky, Coord::DEGREES);\n      str << endl;\n    }\n    while (lvertex_.next());\n    str << ')' << endl;\n}\n\nvoid Contour::render(Pixmap pmap, Coord::InternalSystem sys, const BBox& bbox)\n{\n  \/\/ bbox is in sys coords\n\n  if (lvertex_.head()) {\n    XSetForeground(base_->display, parent_->gc_, parent_->color_);\n    int ww = parent_->lineWidth_>=1 ? parent_->lineWidth_ : 1;\n\n    if (!parent_->dash_)\n      XSetLineAttributes(base_->display, parent_->gc_, \n\t\t\t ww, LineSolid, CapButt, JoinMiter);\n    else {\n      char dl[2];\n      dl[0] = parent_->dlist_[0];\n      dl[1] = parent_->dlist_[1];\n\n      XSetDashes(base_->display, parent_->gc_, 0, dl, 2);\n      XSetLineAttributes(base_->display, parent_->gc_, \n\t\t\t ww, LineOnOffDash, CapButt, JoinMiter);\n    }\n\n    Vector u1 = lvertex_.current()->vector;\n    while (lvertex_.next()) {\n      Vector u2 = lvertex_.current()->vector;\n\n      Vector v1 = base_->mapFromRef(u1,sys);\n      Vector v2 = base_->mapFromRef(u2,sys);\n      if (bbox.isIn(v1) || bbox.isIn(v2))\n\tXDrawLine(base_->display, pmap, parent_->gc_, \n\t\t  (int)v1[0], (int)v1[1], (int)v2[0], (int)v2[1]);\n\n      u1 = u2;\n    }\n  }\n}\n\nvoid Contour::ps(int mode)\n{\n  if (!lvertex_.head())\n    return;\n\n  ostringstream str;\n\n  switch ((Widget::PSColorSpace)mode) {\n  case Widget::BW:\n  case Widget::GRAY:\n    psColorGray(base_->getXColor(parent_->colorName_), str);\n    str << \" setgray\";\n    break;\n  case Widget::RGB:\n    psColorRGB(base_->getXColor(parent_->colorName_), str);\n    str << \" setrgbcolor\";\n    break;\n  case Widget::CMYK:\n    psColorCMYK(base_->getXColor(parent_->colorName_), str);\n    str << \" setcmykcolor\";\n    break;\n  }\n  str << endl;\n  \n  if (!parent_->dash_)\n    str << parent_->lineWidth_ << \" setlinewidth\" << endl << \"[] 0 setdash\";\n  else {\n    str << parent_->lineWidth_ << \" setlinewidth\" << endl\n\t<< '[' << parent_->dlist_[0] << ' ' << parent_->dlist_[1] \n\t<< \"] 0 setdash\";\n  }\n  str << endl;\n\n  Vector v1 = base_->mapFromRef(lvertex_.current()->vector,Coord::CANVAS);\n  str << \"newpath \" << endl\n      << v1.TkCanvasPs(base_->canvas) << \" moveto\" << endl;\n  while (lvertex_.next()) {\n    Vector vv = base_->mapFromRef(lvertex_.current()->vector,Coord::CANVAS);\n    str << vv.TkCanvasPs(base_->canvas) << \" lineto\" << endl;\n  }\n  str << \"stroke\" << endl << ends;\n  Tcl_AppendResult(base_->interp, str.str().c_str(), NULL);\n}\n\nvoid Contour::updateCoords(const Matrix& mx)\n{\n  if (lvertex_.head()) {\n    do {\n      Vector& vv = lvertex_.current()->vector;\n      vv *= mx;\n    }\n    while (lvertex_.next());\n  }\n}\n\n#ifdef MAC_OSX_TK\nvoid Contour::macosx()\n{\n  if (lvertex_.head()) {\n    macosxColor(base_->getXColor(parent_->colorName_));\n    macosxWidth(parent_->lineWidth_);\n    if (parent_->dash_) {\n      float dl[2];\n      dl[0] = parent_->dlist_[0];\n      dl[1] = parent_->dlist_[1];\n      macosxDash(dl,2);\n    }\n    else\n      macosxDash(NULL,0);\n\n    Vector u1 = lvertex_.current()->vector;\n    while (lvertex_.next()) {\n      Vector u2 = lvertex_.current()->vector;\n\n      Vector v1 = base_->mapFromRef(u1,Coord::CANVAS);\n      Vector v2 = base_->mapFromRef(u2,Coord::CANVAS);\n      macosxDrawLine(v1,v2);\n\n      u1 = u2;\n    }\n  }\n}\n#endif\n\n#ifdef __WIN32\nvoid Contour::win32()\n{\n  if (lvertex_.head()) {\n    win32Color(base_->getXColor(parent_->colorName_));\n    win32Width(parent_->lineWidth_);\n    if (parent_->dash_) {\n      float dl[2];\n      dl[0] = parent_->dlist_[0];\n      dl[1] = parent_->dlist_[1];\n      win32Dash(dl,2);\n    }\n    else\n      win32Dash(NULL,0);\n\n    Vector u1 = lvertex_.current()->vector;\n    while (lvertex_.next()) {\n      Vector u2 = lvertex_.current()->vector;\n\n      Vector v1 = base_->mapFromRef(u1,Coord::CANVAS);\n      Vector v2 = base_->mapFromRef(u2,Coord::CANVAS);\n      win32DrawLine(v1,v2);\n\n      u1 = u2;\n    }\n  }\n}\n#endif\n\n<commit_msg>indent<commit_after>\/\/ Copyright (C) 1999-2018\n\/\/ Smithsonian Astrophysical Observatory, Cambridge, MA, USA\n\/\/ For conditions of distribution and use, see copyright notice in \"copyright\"\n\n#include \"contour.h\"\n#include \"base.h\"\n#include \"context.h\"\n\n\/\/ ContourLevel\nContourLevel::ContourLevel(Base* pp, double lev, const char* cc, int ww, \n\t\t\t   int dd, int* dl) \n{\n  parent_ = pp;\n  gc_ = parent_->contourGC_;\n\n  level_ = lev;\n  colorName_ = dupstr(cc);\n  color_ = parent_->getColor(colorName_);\n  lineWidth_ = ww;\n  dash_ = dd;\n  dlist_[0] = dl[0];\n  dlist_[1] = dl[1];\n\n  previous_ = NULL;\n  next_ = NULL;\n}\n\nContourLevel::~ContourLevel()\n{\n  if (colorName_)\n    delete [] colorName_;\n}\n\nvoid ContourLevel::list(ostream& str, FitsImage* fits, \n\t\t\tCoord::CoordSystem sys, Coord::SkyFrame sky)\n{\n  if (lcontour_.head()) {\n    str << \"level=\" << level_ << ' ';\n    if (strncmp(\"green\", colorName_, 5) || dash_ != 0 ||\n\tdlist_[0] != 8 || dlist_[1] != 3 || lineWidth_ != 1) {\n      if (strncmp(\"green\", colorName_, 5))\n\tstr << \"color=\" << colorName_ << ' ';\n\n      if (lineWidth_ != 1)\n\tstr << \"width=\" << lineWidth_ << ' ';\n\n      if (dash_ != 0)\n\tstr << \"dash=\" << dash_ << ' ';\n\n      if (dlist_[0] != 8 || dlist_[1] != 3)\n\tstr << \"dashlist=\" << dlist_[0] << ' ' << dlist_[1] << ' ';\n    }\n    str << endl;\n\n    do\n      lcontour_.current()->list(str, fits, sys, sky);\n    while (lcontour_.next());\n  }\n}\n\nvoid ContourLevel::render(Pixmap pmap, Coord::InternalSystem sys, \n\t\t\t  const BBox& bbox)\n{\n  if (lcontour_.head()) {\n    do\n      lcontour_.current()->render(pmap, sys, bbox);\n    while (lcontour_.next());\n  }\n}\n\nvoid ContourLevel::ps(int mode)\n{\n  if (lcontour_.head()) {\n    do\n      lcontour_.current()->ps(mode);\n    while (lcontour_.next());\n  }\n}\n\nvoid ContourLevel::updateCoords(const Matrix& mx)\n{\n  if (lcontour_.head()) {\n    do\n      lcontour_.current()->updateCoords(mx);\n    while (lcontour_.next());\n  }\n}\n\nvoid ContourLevel::setColor(const char* clr)\n{\n  if (colorName_)\n    delete [] colorName_;\n\n  colorName_ = dupstr(clr);\n  color_ = parent_->getColor(colorName_);\n}\n\n#ifdef MAC_OSX_TK\nvoid ContourLevel::macosx()\n{\n  if (lcontour_.head()) {\n    do\n      lcontour_.current()->macosx();\n    while (lcontour_.next());\n  }\n}\n#endif\n\n#ifdef __WIN32\nvoid ContourLevel::win32()\n{\n  if (lcontour_.head()) {\n    do\n      lcontour_.current()->win32();\n    while (lcontour_.next());\n  }\n}\n#endif\n\n\/\/ Contour\n\nContour::Contour(ContourLevel* cc)\n{\n  parent_ = cc;\n  base_ = cc->parent_;\n\n  previous_ = NULL;\n  next_ = NULL;\n}\n\nContour::~Contour()\n{\n}\n\nvoid Contour::list(ostream& str, FitsImage* fits, \n\t\t   Coord::CoordSystem sys, Coord::SkyFrame sky)\n{\n  if (lvertex_.head())\n    str << '(' << endl;\n    do {\n      str << ' ';\n      fits->listFromRef(str, lvertex_.current()->vector,\n\t\t\tsys, sky, Coord::DEGREES);\n      str << endl;\n    }\n    while (lvertex_.next());\n    str << ')' << endl;\n}\n\nvoid Contour::render(Pixmap pmap, Coord::InternalSystem sys, const BBox& bbox)\n{\n  \/\/ bbox is in sys coords\n\n  if (lvertex_.head()) {\n    XSetForeground(base_->display, parent_->gc_, parent_->color_);\n    int ww = parent_->lineWidth_>=1 ? parent_->lineWidth_ : 1;\n\n    if (!parent_->dash_)\n      XSetLineAttributes(base_->display, parent_->gc_, \n\t\t\t ww, LineSolid, CapButt, JoinMiter);\n    else {\n      char dl[2];\n      dl[0] = parent_->dlist_[0];\n      dl[1] = parent_->dlist_[1];\n\n      XSetDashes(base_->display, parent_->gc_, 0, dl, 2);\n      XSetLineAttributes(base_->display, parent_->gc_, \n\t\t\t ww, LineOnOffDash, CapButt, JoinMiter);\n    }\n\n    Vector u1 = lvertex_.current()->vector;\n    while (lvertex_.next()) {\n      Vector u2 = lvertex_.current()->vector;\n\n      Vector v1 = base_->mapFromRef(u1,sys);\n      Vector v2 = base_->mapFromRef(u2,sys);\n      if (bbox.isIn(v1) || bbox.isIn(v2))\n\tXDrawLine(base_->display, pmap, parent_->gc_, \n\t\t  (int)v1[0], (int)v1[1], (int)v2[0], (int)v2[1]);\n\n      u1 = u2;\n    }\n  }\n}\n\nvoid Contour::ps(int mode)\n{\n  if (!lvertex_.head())\n    return;\n\n  ostringstream str;\n\n  switch ((Widget::PSColorSpace)mode) {\n  case Widget::BW:\n  case Widget::GRAY:\n    psColorGray(base_->getXColor(parent_->colorName_), str);\n    str << \" setgray\";\n    break;\n  case Widget::RGB:\n    psColorRGB(base_->getXColor(parent_->colorName_), str);\n    str << \" setrgbcolor\";\n    break;\n  case Widget::CMYK:\n    psColorCMYK(base_->getXColor(parent_->colorName_), str);\n    str << \" setcmykcolor\";\n    break;\n  }\n  str << endl;\n  \n  if (!parent_->dash_)\n    str << parent_->lineWidth_ << \" setlinewidth\" << endl << \"[] 0 setdash\";\n  else {\n    str << parent_->lineWidth_ << \" setlinewidth\" << endl\n\t<< '[' << parent_->dlist_[0] << ' ' << parent_->dlist_[1] \n\t<< \"] 0 setdash\";\n  }\n  str << endl;\n\n  Vector v1 = base_->mapFromRef(lvertex_.current()->vector,Coord::CANVAS);\n  str << \"newpath \" << endl\n      << v1.TkCanvasPs(base_->canvas) << \" moveto\" << endl;\n  while (lvertex_.next()) {\n    Vector vv = base_->mapFromRef(lvertex_.current()->vector,Coord::CANVAS);\n    str << vv.TkCanvasPs(base_->canvas) << \" lineto\" << endl;\n  }\n  str << \"stroke\" << endl << ends;\n  Tcl_AppendResult(base_->interp, str.str().c_str(), NULL);\n}\n\nvoid Contour::updateCoords(const Matrix& mx)\n{\n  if (lvertex_.head()) {\n    do {\n      Vector& vv = lvertex_.current()->vector;\n      vv *= mx;\n    }\n    while (lvertex_.next());\n  }\n}\n\n#ifdef MAC_OSX_TK\nvoid Contour::macosx()\n{\n  if (lvertex_.head()) {\n    macosxColor(base_->getXColor(parent_->colorName_));\n    macosxWidth(parent_->lineWidth_);\n    if (parent_->dash_) {\n      float dl[2];\n      dl[0] = parent_->dlist_[0];\n      dl[1] = parent_->dlist_[1];\n      macosxDash(dl,2);\n    }\n    else\n      macosxDash(NULL,0);\n\n    Vector u1 = lvertex_.current()->vector;\n    while (lvertex_.next()) {\n      Vector u2 = lvertex_.current()->vector;\n\n      Vector v1 = base_->mapFromRef(u1,Coord::CANVAS);\n      Vector v2 = base_->mapFromRef(u2,Coord::CANVAS);\n      macosxDrawLine(v1,v2);\n\n      u1 = u2;\n    }\n  }\n}\n#endif\n\n#ifdef __WIN32\nvoid Contour::win32()\n{\n  if (lvertex_.head()) {\n    win32Color(base_->getXColor(parent_->colorName_));\n    win32Width(parent_->lineWidth_);\n    if (parent_->dash_) {\n      float dl[2];\n      dl[0] = parent_->dlist_[0];\n      dl[1] = parent_->dlist_[1];\n      win32Dash(dl,2);\n    }\n    else\n      win32Dash(NULL,0);\n\n    Vector u1 = lvertex_.current()->vector;\n    while (lvertex_.next()) {\n      Vector u2 = lvertex_.current()->vector;\n\n      Vector v1 = base_->mapFromRef(u1,Coord::CANVAS);\n      Vector v2 = base_->mapFromRef(u2,Coord::CANVAS);\n      win32DrawLine(v1,v2);\n\n      u1 = u2;\n    }\n  }\n}\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>#ifdef WITH_REGEX\n# include <sys\/types.h>\n# include <regex.h>\n#endif\n\n#include \"main.h\"\n\nnamespace filter {\n\nstatic bool\nmatch_glob(const std::string &glob, size_t, const std::string &str, size_t);\n\nPackageFilter::PackageFilter(bool neg_)\n: negate(neg_)\n{}\n\nPackageFilter::~PackageFilter()\n{}\n\n\/\/ Package Name\nclass PackageName : public PackageFilter {\npublic:\n\tstd::string name;\n\tPackageName(bool neg, const std::string &name_)\n\t: PackageFilter(neg), name(name_) {}\n\tvirtual bool visible(const Package &pkg) const {\n\t\treturn (pkg.name == this->name);\n\t}\n};\n\nunique_ptr<PackageFilter>\nPackageFilter::name(const std::string &s, bool neg) {\n\treturn unique_ptr<PackageFilter>(new PackageName(neg, s));\n}\n\nclass PackageGroup : public PackageName {\npublic:\n\tPackageGroup(bool neg, const std::string &name_)\n\t: PackageName(neg, name_) {}\n\tvirtual bool visible(const Package &pkg) const {\n\t\treturn pkg.groups.find(this->name) != pkg.groups.cend();\n\t}\n};\n\nunique_ptr<PackageFilter>\nPackageFilter::group(const std::string &s, bool neg) {\n\treturn unique_ptr<PackageFilter>(new PackageGroup(neg, s));\n}\n\n\/\/ Package Name (Glob)\nclass PackageNameGlob : public PackageFilter {\npublic:\n\tstd::string name;\n\tPackageNameGlob(bool neg, const std::string &name_)\n\t: PackageFilter(neg), name(name_) {}\n\tvirtual bool visible(const Package &pkg) const {\n\t\treturn match_glob(name, 0, pkg.name, 0);\n\t}\n};\n\nunique_ptr<PackageFilter>\nPackageFilter::nameglob(const std::string &s, bool neg) {\n\treturn unique_ptr<PackageFilter>(new PackageNameGlob(neg, s));\n}\n\nclass PackageGroupGlob : public PackageNameGlob {\npublic:\n\tPackageGroupGlob(bool neg, const std::string &name_)\n\t: PackageNameGlob(neg, name_) {}\n\tvirtual bool visible(const Package &pkg) const {\n\t\tfor (auto &i : pkg.groups) {\n\t\t\tif (match_glob(name, 0, i, 0))\n\t\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n};\n\nunique_ptr<PackageFilter>\nPackageFilter::groupglob(const std::string &s, bool neg) {\n\treturn unique_ptr<PackageFilter>(new PackageGroupGlob(neg, s));\n}\n\nclass PackageBroken : public PackageFilter {\npublic:\n\tPackageBroken(bool neg)\n\t: PackageFilter(neg) {}\n\tvirtual bool visible(const DB &db, const Package &pkg) const {\n\t\treturn db.is_broken(&pkg);\n\t}\n};\n\nunique_ptr<PackageFilter>\nPackageFilter::broken(bool neg) {\n\treturn unique_ptr<PackageFilter>(new PackageBroken(neg));\n}\n\n\/\/ Utility functions:\n\nstatic bool \/* tail recursive *\/\nmatch_glob(const std::string &glob, size_t g, const std::string &str, size_t s)\n{\n\tsize_t from, to;\n\tbool neg = false;\n\n\tauto parse_group = [&]() -> bool {\n\t\tfrom = ++g;\n\t\tneg = (g < glob.length() && glob[g] == '^');\n\t\tif (neg) ++from;\n\t\tif (glob[g] == ']') \/\/ if the group contains a ] it must come first\n\t\t\t++g;\n\t\twhile (g < glob.length() && glob[g] != ']')\n\t\t\t++g;\n\t\tif (g >= glob.length()) {\n\t\t\t\/\/ glob syntax error, treat the [ as a regular [ character\n\t\t\tg = from-1;\n\t\t\treturn false;\n\t\t}\n\t\tto = g-1;\n\t\treturn true;\n\t};\n\n\tauto matches_group = [&](const char c) -> bool {\n\t\tfor (size_t f = from; f != to+1; ++f) {\n\t\t\tif (f > from && f != to && glob[f] == '-') {\n\t\t\t\t++f;\n\t\t\t\tif (c >= glob[f-1] && c <= glob[f])\n\t\t\t\t\treturn !neg;\n\t\t\t}\n\t\t\tif (c == glob[f]) {\n\t\t\t\treturn !neg;\n\t\t\t}\n\t\t}\n\t\treturn neg;\n\t};\n\n\tif (g >= glob.length()) \/\/ nothing else to match\n\t\treturn s >= str.length(); \/\/ true if there are no contents to match either\n\tif (s >= str.length()) {\n\t\tif (glob[g] == '*')\n\t\t\treturn match_glob(glob, g+1, str, s+1);\n\t\treturn false;\n\t}\n\tswitch (glob[g]) {\n\t\tdefault:\n\t\t\tif (glob[g] != str[s])\n\t\t\t\treturn false;\n\t\t\treturn match_glob(glob, g+1, str, s+1);\n\t\tcase '?':\n\t\t\treturn match_glob(glob, g+1, str, s+1);\n\t\tcase '[':\n\t\t\tif (!parse_group()) {\n\t\t\t\tif (str[s] != '[')\n\t\t\t\t\treturn false;\n\t\t\t\treturn match_glob(glob, g+1, str, s+1);\n\t\t\t}\n\t\t\tif (!matches_group(str[s]))\n\t\t\t\treturn false;\n\t\t\treturn match_glob(glob, g+1, str, s+1);\n\n\t\tcase '*':\n\t\t{\n\t\t\tbool wasgroup = false;\n\t\t\twhile (g < glob.length() && (glob[g] == '*' || glob[g] == '?')) ++g;\n\t\t\tif (g >= glob.length()) \/\/ ended with a set of * and ?, so we match\n\t\t\t\treturn true;\n\t\t\tif (glob[g] == '[')\n\t\t\t\twasgroup = parse_group();\n\t\t\twhile (s < str.length()) {\n\t\t\t\tif ( (wasgroup && matches_group(str[s])) ||\n\t\t\t\t     (!wasgroup && str[s] == glob[g]) )\n\t\t\t\t{\n\t\t\t\t\t\/\/ next character matches here, fork off:\n\t\t\t\t\tif (match_glob(glob, g+1, str, s+1))\n\t\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t\t++s; \/\/ otherwise gobble it up into the *\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t}\n}\n\n#ifdef WITH_REGEX\nstatic unique_ptr<regex_t>\nmake_regex(const std::string &pattern, bool ext, bool icase) {\n\tunique_ptr<regex_t> regex(new regex_t);\n\tint cflags = REG_NOSUB;\n\tif (ext)   cflags |= REG_EXTENDED;\n\tif (icase) cflags |= REG_ICASE;\n\n\tint err;\n\tif ( (err = ::regcomp(regex.get(), pattern.c_str(), cflags)) != 0) {\n\t\tchar buf[4096];\n\t\tregerror(err, regex.get(), buf, sizeof(buf));\n\t\tlog(Error, \"failed to compile regex (flags: %s, %s): %s\\n\",\n\t\t    (ext ? \"extended\" : \"basic\"),\n\t\t    (icase ? \"case insensitive\" : \"case sensitive\"),\n\t\t    pattern.c_str());\n\t\tlog(Error, \"regex error: %s\\n\", buf);\n\t\treturn nullptr;\n\t}\n\n\treturn move(regex);\n}\n\nclass PackageNameRegex : public PackageFilter {\npublic:\n\tstd::string         pattern;\n\tunique_ptr<regex_t> regex;\n\tbool                ext, icase;\n\n\tPackageNameRegex(bool neg, const std::string &pattern_,\n\t                 bool ext_, bool icase_,\n\t                 unique_ptr<regex_t> &&regex_)\n\t: PackageFilter(neg), pattern(pattern_)\n\t, regex(move(regex_))\n\t, ext(ext_), icase(icase_)\n\t{}\n\tvirtual bool visible(const Package &pkg) const {\n\t\tregmatch_t rm;\n\t\treturn 0 == regexec(regex.get(), pkg.name.c_str(), 0, &rm, 0);\n\t}\n\n\t~PackageNameRegex() {\n\t\tregfree(regex.get());\n\t}\n};\n\nunique_ptr<PackageFilter>\nPackageFilter::nameregex(const std::string &pattern,\n                         bool ext, bool icase, bool neg)\n{\n\tunique_ptr<regex_t> regex(make_regex(pattern, ext, icase));\n\tif (!regex)\n\t\treturn nullptr;\n\n\treturn unique_ptr<PackageFilter>(\n\t\tnew PackageNameRegex(neg, pattern, ext, icase, move(regex)));\n}\n\nclass PackageGroupRegex : public PackageNameRegex {\npublic:\n\tPackageGroupRegex(bool neg, const std::string &pattern_,\n\t                  bool ext_, bool icase_,\n\t                  unique_ptr<regex_t> &&regex_)\n\t: PackageNameRegex(neg, pattern_, ext_, icase_, move(regex_)) {}\n\tvirtual bool visible(const Package &pkg) const {\n\t\tregmatch_t rm;\n\t\tfor (auto &i : pkg.groups) {\n\t\t\tif (0 == regexec(regex.get(), i.c_str(), 0, &rm, 0))\n\t\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n};\n\nunique_ptr<PackageFilter>\nPackageFilter::groupregex(const std::string &pattern,\n                          bool ext, bool icase, bool neg)\n{\n\tunique_ptr<regex_t> regex(make_regex(pattern, ext, icase));\n\tif (!regex)\n\t\treturn nullptr;\n\n\treturn unique_ptr<PackageFilter>(\n\t\tnew PackageGroupRegex(neg, pattern, ext, icase, move(regex)));\n}\n\n#endif\n\n} \/\/ namespace filter\n\n#ifdef TEST\n#include <iostream>\nusing filter::match_glob;\nint main() {\n\tstd::string text(\"This is a stupid text.\");\n\tint r=0;\n\n\tauto tryglob = [&](const char *c, bool expect) {\n\t\tif (match_glob(c, 0, text, 0) != expect) {\n\t\t\tstd::cout << \"FAIL: \" << c << \": \" << (expect ? \"TRUE\" : \"FALSE\") << \" expected.\" << std::endl;\n\t\t\tr=1;\n\t\t} else {\n\t\t\tstd::cout << \"PASS: \" << c << std::endl;\n\t\t}\n\t};\n\n\ttryglob(\"This*\", true);\n\ttryglob(\"this*\", false);\n\ttryglob(\"*this*\", false);\n\ttryglob(\"*This*\", true);\n\ttryglob(\"*This\", false);\n\ttryglob(\"*?his*\", true);\n\ttryglob(\"*?his?\", false);\n\ttryglob(\"*.\", true);\n\ttryglob(\"*.?\", false);\n\ttryglob(\"[Tt]his*\", true);\n\ttryglob(\"*[Tt]his*\", true);\n\ttryglob(\"*T[hasdf]is*\", true);\n\ttryglob(\"*T[hasdf]Xs*\", false);\n\ttryglob(\"*T[^asdf]is*\", true);\n\ttryglob(\"*T[^hsdf]is*\", false);\n\ttryglob(\"*is*t*t*t*\", true);\n\ttryglob(\"*is*t.\", true);\n\ttryglob(\"*is*[asdf]*t.\", true);\n\ttryglob(\"*is*[yz]*t.\", false);\n\ttext = \"Fabcdbar\";\n\ttryglob(\"Fabcdbar*\", true);\n\ttryglob(\"Fabcdbar*?\", false);\n\ttryglob(\"F[a-d]b*\", true);\n\ttryglob(\"F[a-d][a-d]c*\", true);\n\ttryglob(\"F[a-d][e-z]b*\", false);\n\ttryglob(\"F[^a-d]b*\", false);\n\ttext = \"foo-bar\";\n\ttryglob(\"foo[-]bar\", true);\n\ttryglob(\"foo[-x-z]bar\", true);\n\ttryglob(\"fo[^-n]-bar\", true);\n\ttryglob(\"fo[^n-]-bar\", true);\n\ttext = \"Fa[bc]dbar\";\n\ttryglob(\"Fa[[]bc*\", true);\n\ttryglob(\"Fa[[]bc[]]db*\", true);\n\treturn r;\n}\n#endif\n<commit_msg>object name filters<commit_after>#ifdef WITH_REGEX\n# include <sys\/types.h>\n# include <regex.h>\n#endif\n\n#include \"main.h\"\n\nnamespace filter {\n\nstatic bool\nmatch_glob(const std::string &glob, size_t, const std::string &str, size_t);\n\nPackageFilter::PackageFilter(bool neg_)\n: negate(neg_)\n{}\n\nPackageFilter::~PackageFilter()\n{}\n\nObjectFilter::ObjectFilter(bool neg_)\n: negate(neg_)\n{}\n\nObjectFilter::~ObjectFilter()\n{}\n\n\/\/ Package Name\nclass PackageName : public PackageFilter {\npublic:\n\tstd::string name;\n\tPackageName(bool neg, const std::string &name_)\n\t: PackageFilter(neg), name(name_) {}\n\tvirtual bool visible(const Package &pkg) const {\n\t\treturn (pkg.name == this->name);\n\t}\n};\n\nunique_ptr<PackageFilter>\nPackageFilter::name(const std::string &s, bool neg) {\n\treturn unique_ptr<PackageFilter>(new PackageName(neg, s));\n}\n\nclass PackageGroup : public PackageName {\npublic:\n\tPackageGroup(bool neg, const std::string &name_)\n\t: PackageName(neg, name_) {}\n\tvirtual bool visible(const Package &pkg) const {\n\t\treturn pkg.groups.find(this->name) != pkg.groups.cend();\n\t}\n};\n\nunique_ptr<PackageFilter>\nPackageFilter::group(const std::string &s, bool neg) {\n\treturn unique_ptr<PackageFilter>(new PackageGroup(neg, s));\n}\n\n\/\/ Object Name\nclass ObjectName : public ObjectFilter {\npublic:\n\tstd::string name;\n\tObjectName(bool neg, const std::string &name_)\n\t: ObjectFilter(neg), name(name_) {}\n\tvirtual bool visible(const Elf &elf) const {\n\t\treturn (elf.basename == this->name);\n\t}\n};\n\nunique_ptr<ObjectFilter>\nObjectFilter::name(const std::string &s, bool neg) {\n\treturn unique_ptr<ObjectFilter>(new ObjectName(neg, s));\n}\n\n\/\/ Package Name (Glob)\nclass PackageNameGlob : public PackageFilter {\npublic:\n\tstd::string name;\n\tPackageNameGlob(bool neg, const std::string &name_)\n\t: PackageFilter(neg), name(name_) {}\n\tvirtual bool visible(const Package &pkg) const {\n\t\treturn match_glob(name, 0, pkg.name, 0);\n\t}\n};\n\nunique_ptr<PackageFilter>\nPackageFilter::nameglob(const std::string &s, bool neg) {\n\treturn unique_ptr<PackageFilter>(new PackageNameGlob(neg, s));\n}\n\nclass PackageGroupGlob : public PackageNameGlob {\npublic:\n\tPackageGroupGlob(bool neg, const std::string &name_)\n\t: PackageNameGlob(neg, name_) {}\n\tvirtual bool visible(const Package &pkg) const {\n\t\tfor (auto &i : pkg.groups) {\n\t\t\tif (match_glob(name, 0, i, 0))\n\t\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n};\n\nunique_ptr<PackageFilter>\nPackageFilter::groupglob(const std::string &s, bool neg) {\n\treturn unique_ptr<PackageFilter>(new PackageGroupGlob(neg, s));\n}\n\n\/\/ Object Name (Glob)\nclass ObjectNameGlob : public ObjectName {\npublic:\n\tObjectNameGlob(bool neg, const std::string &name_)\n\t: ObjectName(neg, name_) {}\n\tvirtual bool visible(const Elf &elf) const {\n\t\treturn match_glob(name, 0, elf.basename, 0);\n\t}\n};\n\nunique_ptr<ObjectFilter>\nObjectFilter::nameglob(const std::string &s, bool neg) {\n\treturn unique_ptr<ObjectFilter>(new ObjectNameGlob(neg, s));\n}\n\nclass PackageBroken : public PackageFilter {\npublic:\n\tPackageBroken(bool neg)\n\t: PackageFilter(neg) {}\n\tvirtual bool visible(const DB &db, const Package &pkg) const {\n\t\treturn db.is_broken(&pkg);\n\t}\n};\n\nunique_ptr<PackageFilter>\nPackageFilter::broken(bool neg) {\n\treturn unique_ptr<PackageFilter>(new PackageBroken(neg));\n}\n\n\/\/ Utility functions:\n\nstatic bool \/* tail recursive *\/\nmatch_glob(const std::string &glob, size_t g, const std::string &str, size_t s)\n{\n\tsize_t from, to;\n\tbool neg = false;\n\n\tauto parse_group = [&]() -> bool {\n\t\tfrom = ++g;\n\t\tneg = (g < glob.length() && glob[g] == '^');\n\t\tif (neg) ++from;\n\t\tif (glob[g] == ']') \/\/ if the group contains a ] it must come first\n\t\t\t++g;\n\t\twhile (g < glob.length() && glob[g] != ']')\n\t\t\t++g;\n\t\tif (g >= glob.length()) {\n\t\t\t\/\/ glob syntax error, treat the [ as a regular [ character\n\t\t\tg = from-1;\n\t\t\treturn false;\n\t\t}\n\t\tto = g-1;\n\t\treturn true;\n\t};\n\n\tauto matches_group = [&](const char c) -> bool {\n\t\tfor (size_t f = from; f != to+1; ++f) {\n\t\t\tif (f > from && f != to && glob[f] == '-') {\n\t\t\t\t++f;\n\t\t\t\tif (c >= glob[f-1] && c <= glob[f])\n\t\t\t\t\treturn !neg;\n\t\t\t}\n\t\t\tif (c == glob[f]) {\n\t\t\t\treturn !neg;\n\t\t\t}\n\t\t}\n\t\treturn neg;\n\t};\n\n\tif (g >= glob.length()) \/\/ nothing else to match\n\t\treturn s >= str.length(); \/\/ true if there are no contents to match either\n\tif (s >= str.length()) {\n\t\tif (glob[g] == '*')\n\t\t\treturn match_glob(glob, g+1, str, s+1);\n\t\treturn false;\n\t}\n\tswitch (glob[g]) {\n\t\tdefault:\n\t\t\tif (glob[g] != str[s])\n\t\t\t\treturn false;\n\t\t\treturn match_glob(glob, g+1, str, s+1);\n\t\tcase '?':\n\t\t\treturn match_glob(glob, g+1, str, s+1);\n\t\tcase '[':\n\t\t\tif (!parse_group()) {\n\t\t\t\tif (str[s] != '[')\n\t\t\t\t\treturn false;\n\t\t\t\treturn match_glob(glob, g+1, str, s+1);\n\t\t\t}\n\t\t\tif (!matches_group(str[s]))\n\t\t\t\treturn false;\n\t\t\treturn match_glob(glob, g+1, str, s+1);\n\n\t\tcase '*':\n\t\t{\n\t\t\tbool wasgroup = false;\n\t\t\twhile (g < glob.length() && (glob[g] == '*' || glob[g] == '?')) ++g;\n\t\t\tif (g >= glob.length()) \/\/ ended with a set of * and ?, so we match\n\t\t\t\treturn true;\n\t\t\tif (glob[g] == '[')\n\t\t\t\twasgroup = parse_group();\n\t\t\twhile (s < str.length()) {\n\t\t\t\tif ( (wasgroup && matches_group(str[s])) ||\n\t\t\t\t     (!wasgroup && str[s] == glob[g]) )\n\t\t\t\t{\n\t\t\t\t\t\/\/ next character matches here, fork off:\n\t\t\t\t\tif (match_glob(glob, g+1, str, s+1))\n\t\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t\t++s; \/\/ otherwise gobble it up into the *\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t}\n}\n\n#ifdef WITH_REGEX\nstatic unique_ptr<regex_t>\nmake_regex(const std::string &pattern, bool ext, bool icase) {\n\tunique_ptr<regex_t> regex(new regex_t);\n\tint cflags = REG_NOSUB;\n\tif (ext)   cflags |= REG_EXTENDED;\n\tif (icase) cflags |= REG_ICASE;\n\n\tint err;\n\tif ( (err = ::regcomp(regex.get(), pattern.c_str(), cflags)) != 0) {\n\t\tchar buf[4096];\n\t\tregerror(err, regex.get(), buf, sizeof(buf));\n\t\tlog(Error, \"failed to compile regex (flags: %s, %s): %s\\n\",\n\t\t    (ext ? \"extended\" : \"basic\"),\n\t\t    (icase ? \"case insensitive\" : \"case sensitive\"),\n\t\t    pattern.c_str());\n\t\tlog(Error, \"regex error: %s\\n\", buf);\n\t\treturn nullptr;\n\t}\n\n\treturn move(regex);\n}\n\n\/\/ Package Name (Regex)\nclass PackageNameRegex : public PackageFilter {\npublic:\n\tstd::string         pattern;\n\tunique_ptr<regex_t> regex;\n\tbool                ext, icase;\n\n\tPackageNameRegex(bool neg, const std::string &pattern_,\n\t                 bool ext_, bool icase_,\n\t                 unique_ptr<regex_t> &&regex_)\n\t: PackageFilter(neg), pattern(pattern_)\n\t, regex(move(regex_))\n\t, ext(ext_), icase(icase_)\n\t{}\n\tvirtual bool visible(const Package &pkg) const {\n\t\tregmatch_t rm;\n\t\treturn 0 == regexec(regex.get(), pkg.name.c_str(), 0, &rm, 0);\n\t}\n\n\t~PackageNameRegex() {\n\t\tregfree(regex.get());\n\t}\n};\n\nunique_ptr<PackageFilter>\nPackageFilter::nameregex(const std::string &pattern,\n                         bool ext, bool icase, bool neg)\n{\n\tunique_ptr<regex_t> regex(make_regex(pattern, ext, icase));\n\tif (!regex)\n\t\treturn nullptr;\n\n\treturn unique_ptr<PackageFilter>(\n\t\tnew PackageNameRegex(neg, pattern, ext, icase, move(regex)));\n}\n\nclass PackageGroupRegex : public PackageNameRegex {\npublic:\n\tPackageGroupRegex(bool neg, const std::string &pattern_,\n\t                  bool ext_, bool icase_,\n\t                  unique_ptr<regex_t> &&regex_)\n\t: PackageNameRegex(neg, pattern_, ext_, icase_, move(regex_)) {}\n\tvirtual bool visible(const Package &pkg) const {\n\t\tregmatch_t rm;\n\t\tfor (auto &i : pkg.groups) {\n\t\t\tif (0 == regexec(regex.get(), i.c_str(), 0, &rm, 0))\n\t\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n};\n\nunique_ptr<PackageFilter>\nPackageFilter::groupregex(const std::string &pattern,\n                          bool ext, bool icase, bool neg)\n{\n\tunique_ptr<regex_t> regex(make_regex(pattern, ext, icase));\n\tif (!regex)\n\t\treturn nullptr;\n\n\treturn unique_ptr<PackageFilter>(\n\t\tnew PackageGroupRegex(neg, pattern, ext, icase, move(regex)));\n}\n\n\/\/ Object Name (Regex)\nclass ObjectNameRegex : public ObjectFilter {\npublic:\n\tstd::string         pattern;\n\tunique_ptr<regex_t> regex;\n\tbool                ext, icase;\n\n\tObjectNameRegex(bool neg, const std::string &pattern_,\n\t                bool ext_, bool icase_,\n\t                unique_ptr<regex_t> &&regex_)\n\t: ObjectFilter(neg), pattern(pattern_)\n\t, regex(move(regex_))\n\t, ext(ext_), icase(icase_)\n\t{}\n\tvirtual bool visible(const Elf &elf) const {\n\t\tregmatch_t rm;\n\t\treturn 0 == regexec(regex.get(), elf.basename.c_str(), 0, &rm, 0);\n\t}\n\n\t~ObjectNameRegex() {\n\t\tregfree(regex.get());\n\t}\n};\n\nunique_ptr<ObjectFilter>\nObjectFilter::nameregex(const std::string &pattern,\n                        bool ext, bool icase, bool neg)\n{\n\tunique_ptr<regex_t> regex(make_regex(pattern, ext, icase));\n\tif (!regex)\n\t\treturn nullptr;\n\n\treturn unique_ptr<ObjectFilter>(\n\t\tnew ObjectNameRegex(neg, pattern, ext, icase, move(regex)));\n}\n\n#endif\n\n} \/\/ namespace filter\n\n#ifdef TEST\n#include <iostream>\nusing filter::match_glob;\nint main() {\n\tstd::string text(\"This is a stupid text.\");\n\tint r=0;\n\n\tauto tryglob = [&](const char *c, bool expect) {\n\t\tif (match_glob(c, 0, text, 0) != expect) {\n\t\t\tstd::cout << \"FAIL: \" << c << \": \" << (expect ? \"TRUE\" : \"FALSE\") << \" expected.\" << std::endl;\n\t\t\tr=1;\n\t\t} else {\n\t\t\tstd::cout << \"PASS: \" << c << std::endl;\n\t\t}\n\t};\n\n\ttryglob(\"This*\", true);\n\ttryglob(\"this*\", false);\n\ttryglob(\"*this*\", false);\n\ttryglob(\"*This*\", true);\n\ttryglob(\"*This\", false);\n\ttryglob(\"*?his*\", true);\n\ttryglob(\"*?his?\", false);\n\ttryglob(\"*.\", true);\n\ttryglob(\"*.?\", false);\n\ttryglob(\"[Tt]his*\", true);\n\ttryglob(\"*[Tt]his*\", true);\n\ttryglob(\"*T[hasdf]is*\", true);\n\ttryglob(\"*T[hasdf]Xs*\", false);\n\ttryglob(\"*T[^asdf]is*\", true);\n\ttryglob(\"*T[^hsdf]is*\", false);\n\ttryglob(\"*is*t*t*t*\", true);\n\ttryglob(\"*is*t.\", true);\n\ttryglob(\"*is*[asdf]*t.\", true);\n\ttryglob(\"*is*[yz]*t.\", false);\n\ttext = \"Fabcdbar\";\n\ttryglob(\"Fabcdbar*\", true);\n\ttryglob(\"Fabcdbar*?\", false);\n\ttryglob(\"F[a-d]b*\", true);\n\ttryglob(\"F[a-d][a-d]c*\", true);\n\ttryglob(\"F[a-d][e-z]b*\", false);\n\ttryglob(\"F[^a-d]b*\", false);\n\ttext = \"foo-bar\";\n\ttryglob(\"foo[-]bar\", true);\n\ttryglob(\"foo[-x-z]bar\", true);\n\ttryglob(\"fo[^-n]-bar\", true);\n\ttryglob(\"fo[^n-]-bar\", true);\n\ttext = \"Fa[bc]dbar\";\n\ttryglob(\"Fa[[]bc*\", true);\n\ttryglob(\"Fa[[]bc[]]db*\", true);\n\treturn r;\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n * Copyright 2016 BlueMasters\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 <Arduino.h>\n\n#include \"AsnLMsg.h\"\n#include \"App.h\"\n#include \"AsnLWriter.h\"\n#include \"AsnLParser.h\"\n#include <EEPROM.h>\n\n#define CONF0_MAGIC        0x576D1D52\n#define CONF0_EEPROM_START 0x0000\n\n#define CONF0_MAGIC_ADDR               (CONF0_EEPROM_START)         \/\/ uint32\n#define CONF0_PIN_ADDR                 (CONF0_EEPROM_START + 4)     \/\/ String\n#define CONF0_DF_ADDR                  (CONF0_EEPROM_START + 28)    \/\/ uint16\n#define CONF0_DI_ADDR                  (CONF0_EEPROM_START + 30)    \/\/ uint16\n\n#define CONF0_IDLE_COLOR_ON_ADDR       (CONF0_EEPROM_START + 32)    \/\/ uint32\n#define CONF0_IDLE_COLOR_OFF_ADDR      (CONF0_EEPROM_START + 36)    \/\/ uint32\n#define CONF0_IDLE_TIME_ON_ADDR        (CONF0_EEPROM_START + 40)    \/\/ uint16\n#define CONF0_IDLE_TIME_OFF_ADDR       (CONF0_EEPROM_START + 42)    \/\/ uint16\n\n#define CONF0_MAX_PIN_LEN (CONF0_DF_ADDR - CONF0_PIN_ADDR - 1)\n\n#define CONF0_ENQ          '>'\n#define CONF0_ACK          '!'\n#define CONF0_REACTION_TIME 500\n#define CONF0_BUFFER_SIZE   64\n\nint conf0ReadEEPROM() {\n    uint32_t magic;\n    char buffer[CONF0_MAX_PIN_LEN + 1];\n    EEPROM.get(CONF0_MAGIC_ADDR, magic);\n    if (magic == CONF0_MAGIC) {\n        int i = 0;\n        while (i < CONF0_MAX_PIN_LEN) {\n            char c = EEPROM[CONF0_PIN_ADDR + i];\n            if (c == 0) break;\n            buffer[i++] = c;\n        }\n        buffer[i] = '\\x00';\n        app.pinCode = String(buffer);\n        EEPROM.get(CONF0_DF_ADDR, app.DF);\n        EEPROM.get(CONF0_DI_ADDR, app.DI);\n        EEPROM.get(CONF0_IDLE_COLOR_ON_ADDR, app.idleColorOn);\n        EEPROM.get(CONF0_IDLE_COLOR_OFF_ADDR, app.idleColorOff);\n        EEPROM.get(CONF0_IDLE_TIME_ON_ADDR, app.idleTicksOn);\n        EEPROM.get(CONF0_IDLE_TIME_OFF_ADDR, app.idleTicksOff);\n        return 0;\n    } else {\n        return -1;\n    }\n}\n\nint conf0WriteEEPROM() {\n    uint32_t magic = CONF0_MAGIC;\n    char buffer[CONF0_MAX_PIN_LEN + 1];\n    app.pinCode.toCharArray(buffer, CONF0_MAX_PIN_LEN + 1);\n\n    EEPROM.put(CONF0_MAGIC_ADDR, magic);\n    int i = 0;\n    while (i < CONF0_MAX_PIN_LEN) {\n        char c = buffer[i];\n        EEPROM[CONF0_PIN_ADDR + i] = c;\n        if (c == 0) break;\n        i++;\n    }\n    EEPROM[CONF0_PIN_ADDR + i] = 0;\n    EEPROM.put(CONF0_DF_ADDR, app.DF);\n    EEPROM.put(CONF0_DI_ADDR, app.DI);\n    EEPROM.put(CONF0_IDLE_COLOR_ON_ADDR, app.idleColorOn);\n    EEPROM.put(CONF0_IDLE_COLOR_OFF_ADDR, app.idleColorOff);\n    EEPROM.put(CONF0_IDLE_TIME_ON_ADDR, app.idleTicksOn);\n    EEPROM.put(CONF0_IDLE_TIME_OFF_ADDR, app.idleTicksOff);\n    return 0;\n}\n\nint conf0GetChar() {\n    while (Serial.available() <= 0) {};\n    return Serial.read();\n}\n\nint conf0GetCharTimeout(unsigned long timeout) {\n    unsigned long now = millis();\n    while ((millis() - now) < timeout) {\n        if (Serial.available()) {\n            return Serial.read();\n        }\n    };\n    return -1;\n}\n\nbool checkToken(AsnLParser& p, int token) {\n    int t = p.nextToken();\n    return t == token;\n}\n\nvoid result(AsnLParser& p, AsnLWriter& w, int code) {\n    p.close();\n    w.init();\n    w.structure();\n    w.integer(1, code);\n    w.endStructure();\n    w.msg().writeToSerial();\n}\n\nvoid dumpVars(AsnLParser& p, AsnLWriter& w) {\n    if (!checkToken(p, ASNL_END_STRUCT)) {\n        result(p, w, 0); return;\n    }\n    if (!checkToken(p, ASNL_NIL)) {\n        result(p, w, 0); return;\n    }\n\n    w.init();\n    w.structure();\n    w.integer(1, 1); \/\/ Status OK\n    w.structure();\n    w.string(app.pinCode);\n    w.integer(2, app.DF);\n    w.integer(2, app.DI);\n    w.integer(4, app.idleColorOn);\n    w.integer(4, app.idleColorOff);\n    w.integer(2, app.idleTicksOn);\n    w.integer(2, app.idleTicksOff);\n    w.endStructure();\n    w.endStructure();\n\n    w.msg().writeToSerial();\n    digitalWrite(13, LOW);\n\n}\n\nstatic void setPinCode(AsnLParser& p, AsnLWriter& w) {\n    char pinCode[8];\n    if (checkToken(p, ASNL_STRING)) {\n        if (!p.readString(pinCode, 8)) {\n            result(p, w, 0); return; \/\/ failed to read string\n        }\n    } else {\n        result(p, w, 0); return; \/\/ not a string\n    }\n    if (!checkToken(p, ASNL_END_STRUCT)) {\n        result(p, w, 0); return;\n    }\n    if (!checkToken(p, ASNL_NIL)) {\n        result(p, w, 0); return;\n    }\n    app.pinCode = String(pinCode);\n    result(p, w, 1);\n}\n\nstatic int16_t extractInt16(AsnLParser& p, AsnLWriter& w) {\n    int16_t value;\n    if (checkToken(p, ASNL_INT)) {\n        if (p.readInt(&value) != 0) {\n            result(p, w, 0); return -1; \/\/ failed to read int\n        }\n    } else {\n        result(p, w, 0); return -1; \/\/ not an int\n    }\n    if (!checkToken(p, ASNL_END_STRUCT)) {\n        result(p, w, 0); return -1;\n    }\n    if (!checkToken(p, ASNL_NIL)) {\n        result(p, w, 0); return -1;\n    }\n    result(p, w, 1);\n    return value;\n}\n\nstatic int32_t extractInt32(AsnLParser& p, AsnLWriter& w) {\n    int32_t value;\n    if (checkToken(p, ASNL_INT)) {\n        if (p.readInt(&value) != 0) {\n            result(p, w, 0); return -1; \/\/ failed to read int\n        }\n    } else {\n        result(p, w, 0); return -1; \/\/ not an int\n    }\n    if (!checkToken(p, ASNL_END_STRUCT)) {\n        result(p, w, 0); return -1;\n    }\n    if (!checkToken(p, ASNL_NIL)) {\n        result(p, w, 0); return -1;\n    }\n    result(p, w, 1);\n    return value;\n}\n\nstatic void save(AsnLParser& p, AsnLWriter& w, bool dirty) {\n    if (dirty) {\n        conf0WriteEEPROM();\n    }\n    result(p, w, 1);\n}\n\nstatic void conf0Dialog() {\n    bool dirty = false;\n\n    AsnLMsg msg = AsnLMsg(CONF0_BUFFER_SIZE);\n    AsnLParser p = AsnLParser(msg);\n    AsnLWriter w = AsnLWriter(msg);\n    while (1) {\n        msg.readFromSerial();\n        p.init();\n        if (!checkToken(p, ASNL_STRUCT)) { \/\/ invalid message (not a structure)\n            result(p, w, 0);\n            continue;\n        }\n        if (!checkToken(p, ASNL_INT)) { \/\/ invalid message (not and integer)\n            result(p, w, 0);\n            continue;\n        }\n        int command;\n        p.readInt(&command);\n        switch (command) {\n        case 'd': dumpVars(p, w); break;\n        case 'p': setPinCode(p, w); dirty = true; break;\n        case 'i': app.DI = extractInt16(p, w); dirty = true; break;\n        case 'f': app.DF = extractInt16(p, w); dirty = true; break;\n        case 'l': app.idleColorOn = extractInt32(p, w); dirty = true; break;\n        case 'm': app.idleColorOff = extractInt32(p, w); dirty = true; break;\n        case '1': app.idleTicksOn = extractInt16(p, w); dirty = true; break;\n        case '0': app.idleTicksOff = extractInt16(p, w); dirty = true; break;\n        case 's': save(p, w, dirty); dirty = false; break;\n        case 'x': result(p, w, 1); return; \/\/ exit\n        default: result(p, w, 0); break; \/\/ invalid command\n        }\n    }\n}\n\nvoid conf0Configure() {\n    app.pinCode = \"000\";\n    app.DF = 2000;\n    app.DI = 1000;\n    app.idleColorOn  = 0x333333;\n    app.idleColorOff = 0x111111;\n    app.idleTicksOn   = 20;\n    app.idleTicksOff  = -1;\n    conf0ReadEEPROM();\n    Serial.write(CONF0_ENQ);\n    int res = conf0GetCharTimeout(CONF0_REACTION_TIME);\n    if (res == CONF0_ACK) {\n        conf0Dialog();\n    }\n}\n<commit_msg>Swap DF\/DI<commit_after>\/****************************************************************************\n * Copyright 2016 BlueMasters\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 <Arduino.h>\n\n#include \"AsnLMsg.h\"\n#include \"App.h\"\n#include \"AsnLWriter.h\"\n#include \"AsnLParser.h\"\n#include <EEPROM.h>\n\n#define CONF0_MAGIC        0x576D1D52\n#define CONF0_EEPROM_START 0x0000\n\n#define CONF0_MAGIC_ADDR               (CONF0_EEPROM_START)         \/\/ uint32\n#define CONF0_PIN_ADDR                 (CONF0_EEPROM_START + 4)     \/\/ String\n#define CONF0_DI_ADDR                  (CONF0_EEPROM_START + 28)    \/\/ uint16\n#define CONF0_DF_ADDR                  (CONF0_EEPROM_START + 30)    \/\/ uint16\n\n#define CONF0_IDLE_COLOR_ON_ADDR       (CONF0_EEPROM_START + 32)    \/\/ uint32\n#define CONF0_IDLE_COLOR_OFF_ADDR      (CONF0_EEPROM_START + 36)    \/\/ uint32\n#define CONF0_IDLE_TIME_ON_ADDR        (CONF0_EEPROM_START + 40)    \/\/ uint16\n#define CONF0_IDLE_TIME_OFF_ADDR       (CONF0_EEPROM_START + 42)    \/\/ uint16\n\n#define CONF0_MAX_PIN_LEN (CONF0_DF_ADDR - CONF0_PIN_ADDR - 1)\n\n#define CONF0_ENQ          '>'\n#define CONF0_ACK          '!'\n#define CONF0_REACTION_TIME 500\n#define CONF0_BUFFER_SIZE   64\n\nint conf0ReadEEPROM() {\n    uint32_t magic;\n    char buffer[CONF0_MAX_PIN_LEN + 1];\n    EEPROM.get(CONF0_MAGIC_ADDR, magic);\n    if (magic == CONF0_MAGIC) {\n        int i = 0;\n        while (i < CONF0_MAX_PIN_LEN) {\n            char c = EEPROM[CONF0_PIN_ADDR + i];\n            if (c == 0) break;\n            buffer[i++] = c;\n        }\n        buffer[i] = '\\x00';\n        app.pinCode = String(buffer);\n        EEPROM.get(CONF0_DI_ADDR, app.DI);\n        EEPROM.get(CONF0_DF_ADDR, app.DF);\n        EEPROM.get(CONF0_IDLE_COLOR_ON_ADDR, app.idleColorOn);\n        EEPROM.get(CONF0_IDLE_COLOR_OFF_ADDR, app.idleColorOff);\n        EEPROM.get(CONF0_IDLE_TIME_ON_ADDR, app.idleTicksOn);\n        EEPROM.get(CONF0_IDLE_TIME_OFF_ADDR, app.idleTicksOff);\n        return 0;\n    } else {\n        return -1;\n    }\n}\n\nint conf0WriteEEPROM() {\n    uint32_t magic = CONF0_MAGIC;\n    char buffer[CONF0_MAX_PIN_LEN + 1];\n    app.pinCode.toCharArray(buffer, CONF0_MAX_PIN_LEN + 1);\n\n    EEPROM.put(CONF0_MAGIC_ADDR, magic);\n    int i = 0;\n    while (i < CONF0_MAX_PIN_LEN) {\n        char c = buffer[i];\n        EEPROM[CONF0_PIN_ADDR + i] = c;\n        if (c == 0) break;\n        i++;\n    }\n    EEPROM[CONF0_PIN_ADDR + i] = 0;\n    EEPROM.put(CONF0_DI_ADDR, app.DI);\n    EEPROM.put(CONF0_DF_ADDR, app.DF);\n    EEPROM.put(CONF0_IDLE_COLOR_ON_ADDR, app.idleColorOn);\n    EEPROM.put(CONF0_IDLE_COLOR_OFF_ADDR, app.idleColorOff);\n    EEPROM.put(CONF0_IDLE_TIME_ON_ADDR, app.idleTicksOn);\n    EEPROM.put(CONF0_IDLE_TIME_OFF_ADDR, app.idleTicksOff);\n    return 0;\n}\n\nint conf0GetChar() {\n    while (Serial.available() <= 0) {};\n    return Serial.read();\n}\n\nint conf0GetCharTimeout(unsigned long timeout) {\n    unsigned long now = millis();\n    while ((millis() - now) < timeout) {\n        if (Serial.available()) {\n            return Serial.read();\n        }\n    };\n    return -1;\n}\n\nbool checkToken(AsnLParser& p, int token) {\n    int t = p.nextToken();\n    return t == token;\n}\n\nvoid result(AsnLParser& p, AsnLWriter& w, int code) {\n    p.close();\n    w.init();\n    w.structure();\n    w.integer(1, code);\n    w.endStructure();\n    w.msg().writeToSerial();\n}\n\nvoid dumpVars(AsnLParser& p, AsnLWriter& w) {\n    if (!checkToken(p, ASNL_END_STRUCT)) {\n        result(p, w, 0); return;\n    }\n    if (!checkToken(p, ASNL_NIL)) {\n        result(p, w, 0); return;\n    }\n\n    w.init();\n    w.structure();\n    w.integer(1, 1); \/\/ Status OK\n    w.structure();\n    w.string(app.pinCode);\n    w.integer(2, app.DI);\n    w.integer(2, app.DF);\n    w.integer(4, app.idleColorOn);\n    w.integer(4, app.idleColorOff);\n    w.integer(2, app.idleTicksOn);\n    w.integer(2, app.idleTicksOff);\n    w.endStructure();\n    w.endStructure();\n\n    w.msg().writeToSerial();\n    digitalWrite(13, LOW);\n\n}\n\nstatic void setPinCode(AsnLParser& p, AsnLWriter& w) {\n    char pinCode[8];\n    if (checkToken(p, ASNL_STRING)) {\n        if (!p.readString(pinCode, 8)) {\n            result(p, w, 0); return; \/\/ failed to read string\n        }\n    } else {\n        result(p, w, 0); return; \/\/ not a string\n    }\n    if (!checkToken(p, ASNL_END_STRUCT)) {\n        result(p, w, 0); return;\n    }\n    if (!checkToken(p, ASNL_NIL)) {\n        result(p, w, 0); return;\n    }\n    app.pinCode = String(pinCode);\n    result(p, w, 1);\n}\n\nstatic int16_t extractInt16(AsnLParser& p, AsnLWriter& w) {\n    int16_t value;\n    if (checkToken(p, ASNL_INT)) {\n        if (p.readInt(&value) != 0) {\n            result(p, w, 0); return -1; \/\/ failed to read int\n        }\n    } else {\n        result(p, w, 0); return -1; \/\/ not an int\n    }\n    if (!checkToken(p, ASNL_END_STRUCT)) {\n        result(p, w, 0); return -1;\n    }\n    if (!checkToken(p, ASNL_NIL)) {\n        result(p, w, 0); return -1;\n    }\n    result(p, w, 1);\n    return value;\n}\n\nstatic int32_t extractInt32(AsnLParser& p, AsnLWriter& w) {\n    int32_t value;\n    if (checkToken(p, ASNL_INT)) {\n        if (p.readInt(&value) != 0) {\n            result(p, w, 0); return -1; \/\/ failed to read int\n        }\n    } else {\n        result(p, w, 0); return -1; \/\/ not an int\n    }\n    if (!checkToken(p, ASNL_END_STRUCT)) {\n        result(p, w, 0); return -1;\n    }\n    if (!checkToken(p, ASNL_NIL)) {\n        result(p, w, 0); return -1;\n    }\n    result(p, w, 1);\n    return value;\n}\n\nstatic void save(AsnLParser& p, AsnLWriter& w, bool dirty) {\n    if (dirty) {\n        conf0WriteEEPROM();\n    }\n    result(p, w, 1);\n}\n\nstatic void conf0Dialog() {\n    bool dirty = false;\n\n    AsnLMsg msg = AsnLMsg(CONF0_BUFFER_SIZE);\n    AsnLParser p = AsnLParser(msg);\n    AsnLWriter w = AsnLWriter(msg);\n    while (1) {\n        msg.readFromSerial();\n        p.init();\n        if (!checkToken(p, ASNL_STRUCT)) { \/\/ invalid message (not a structure)\n            result(p, w, 0);\n            continue;\n        }\n        if (!checkToken(p, ASNL_INT)) { \/\/ invalid message (not and integer)\n            result(p, w, 0);\n            continue;\n        }\n        int command;\n        p.readInt(&command);\n        switch (command) {\n        case 'd': dumpVars(p, w); break;\n        case 'p': setPinCode(p, w); dirty = true; break;\n        case 'i': app.DI = extractInt16(p, w); dirty = true; break;\n        case 'f': app.DF = extractInt16(p, w); dirty = true; break;\n        case 'l': app.idleColorOn = extractInt32(p, w); dirty = true; break;\n        case 'm': app.idleColorOff = extractInt32(p, w); dirty = true; break;\n        case '1': app.idleTicksOn = extractInt16(p, w); dirty = true; break;\n        case '0': app.idleTicksOff = extractInt16(p, w); dirty = true; break;\n        case 's': save(p, w, dirty); dirty = false; break;\n        case 'x': result(p, w, 1); return; \/\/ exit\n        default: result(p, w, 0); break; \/\/ invalid command\n        }\n    }\n}\n\nvoid conf0Configure() {\n    app.pinCode = \"000\";\n    app.DI = 1000;\n    app.DF = 2000;\n    app.idleColorOn  = 0x333333;\n    app.idleColorOff = 0x111111;\n    app.idleTicksOn   = 20;\n    app.idleTicksOff  = -1;\n    conf0ReadEEPROM();\n    Serial.write(CONF0_ENQ);\n    int res = conf0GetCharTimeout(CONF0_REACTION_TIME);\n    if (res == CONF0_ACK) {\n        conf0Dialog();\n    }\n}\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_CHECK_HPP__\n#define __STOUT_CHECK_HPP__\n\n#include <ostream>\n#include <sstream>\n#include <string>\n\n#include <glog\/logging.h>\n\n#include <stout\/abort.hpp>\n#include <stout\/error.hpp>\n#include <stout\/none.hpp>\n#include <stout\/option.hpp>\n#include <stout\/some.hpp>\n\n\ntemplate <typename T>\nclass Result;\n\ntemplate <typename T, typename E>\nclass Try;\n\n\n\/\/ A generic macro to facilitate definitions of CHECK_*, akin to CHECK.\n\/\/ This appends the error if possible to the end of the log message,\n\/\/ so there's no need to append the error message explicitly.\n\/\/ To define a new CHECK_*, provide the name, the function that performs the\n\/\/ check, and the expression. See below for examples (e.g. CHECK_SOME).\n#define CHECK_STATE(name, check, expression)                             \\\n  for (const Option<Error> _error = check(expression); _error.isSome();) \\\n    _CheckFatal(__FILE__,                                                \\\n                __LINE__,                                                \\\n                #name,                                                   \\\n                #expression,                                             \\\n                _error.get()).stream()\n\n\n#define CHECK_SOME(expression) \\\n  CHECK_STATE(CHECK_SOME, _check_some, expression)\n\n\n#define CHECK_NONE(expression) \\\n  CHECK_STATE(CHECK_NONE, _check_none, expression)\n\n\n#define CHECK_ERROR(expression) \\\n  CHECK_STATE(CHECK_ERROR, _check_error, expression)\n\n\n\/\/ A private helper for CHECK_NOTNONE which is similar to the\n\/\/ CHECK_NOTNULL provided by glog.\ntemplate <typename T>\nT&& _check_not_none(\n    const char* file,\n    int line,\n    const char* message,\n    Option<T>&& t) {\n  if (t.isNone()) {\n    google::LogMessageFatal(file, line, new std::string(message));\n  }\n  return std::move(t).get();\n}\n\n\ntemplate <typename T>\nT& _check_not_none(\n    const char* file,\n    int line,\n    const char* message,\n    Option<T>& t) {\n  if (t.isNone()) {\n    google::LogMessageFatal(file, line, new std::string(message));\n  }\n  return t.get();\n}\n\n\ntemplate <typename T>\nconst T& _check_not_none(\n    const char* file,\n    int line,\n    const char* message,\n    const Option<T>& t) {\n  if (t.isNone()) {\n    google::LogMessageFatal(file, line, new std::string(message));\n  }\n  return t.get();\n}\n\n\n#define CHECK_NOTNONE(expression) \\\n  _check_not_none( \\\n      __FILE__, \\\n      __LINE__, \\\n      \"'\" #expression \"' Must be SOME\", \\\n      (expression))\n\n\n\/\/ A private helper for CHECK_NOTERROR which is similar to the\n\/\/ CHECK_NOTNULL provided by glog.\ntemplate <typename T, typename E>\nT&& _check_not_error(\n    const char* file,\n    int line,\n    const char* message,\n    Try<T, E>&& t) {\n  if (t.isError()) {\n    google::LogMessageFatal(\n        file,\n        line,\n        new std::string(\n            std::string(message) + \": \" + Error(t.error()).message));\n  }\n  return std::move(t).get();\n}\n\n\ntemplate <typename T, typename E>\nT& _check_not_error(\n    const char* file,\n    int line,\n    const char* message,\n    Try<T, E>& t) {\n  if (t.isError()) {\n    google::LogMessageFatal(\n        file,\n        line,\n        new std::string(\n            std::string(message) + \": \" + Error(t.error()).message));\n  }\n  return t.get();\n}\n\n\ntemplate <typename T, typename E>\nconst T& _check_not_error(\n    const char* file,\n    int line,\n    const char* message,\n    const Try<T, E>& t) {\n  if (t.isError()) {\n    google::LogMessageFatal(\n        file,\n        line,\n        new std::string(\n            std::string(message) + \": \" + Error(t.error()).message));\n  }\n  return t.get();\n}\n\n\n#define CHECK_NOTERROR(expression) \\\n  _check_not_error( \\\n      __FILE__, \\\n      __LINE__, \\\n      \"'\" #expression \"' Must be SOME\", \\\n      (expression))\n\n\n\/\/ Private structs\/functions used for CHECK_*.\n\ntemplate <typename T>\nOption<Error> _check_some(const Option<T>& o)\n{\n  if (o.isNone()) {\n    return Error(\"is NONE\");\n  } else {\n    CHECK(o.isSome());\n    return None();\n  }\n}\n\n\ntemplate <typename T, typename E>\nOption<Error> _check_some(const Try<T, E>& t)\n{\n  if (t.isError()) {\n    return Error(t.error());\n  } else {\n    CHECK(t.isSome());\n    return None();\n  }\n}\n\n\ntemplate <typename T>\nOption<Error> _check_some(const Result<T>& r)\n{\n  if (r.isError()) {\n    return Error(r.error());\n  } else if (r.isNone()) {\n    return Error(\"is NONE\");\n  } else {\n    CHECK(r.isSome());\n    return None();\n  }\n}\n\n\ntemplate <typename T>\nOption<Error> _check_none(const Option<T>& o)\n{\n  if (o.isSome()) {\n    return Error(\"is SOME\");\n  } else {\n    CHECK(o.isNone());\n    return None();\n  }\n}\n\n\ntemplate <typename T>\nOption<Error> _check_none(const Result<T>& r)\n{\n  if (r.isError()) {\n    return Error(\"is ERROR\");\n  } else if (r.isSome()) {\n    return Error(\"is SOME\");\n  } else {\n    CHECK(r.isNone());\n    return None();\n  }\n}\n\n\ntemplate <typename T, typename E>\nOption<Error> _check_error(const Try<T, E>& t)\n{\n  if (t.isSome()) {\n    return Error(\"is SOME\");\n  } else {\n    CHECK(t.isError());\n    return None();\n  }\n}\n\n\ntemplate <typename T>\nOption<Error> _check_error(const Result<T>& r)\n{\n  if (r.isNone()) {\n    return Error(\"is NONE\");\n  } else if (r.isSome()) {\n    return Error(\"is SOME\");\n  } else {\n    CHECK(r.isError());\n    return None();\n  }\n}\n\n\nstruct _CheckFatal\n{\n  _CheckFatal(const char* _file,\n              int _line,\n              const char* type,\n              const char* expression,\n              const Error& error)\n      : file(_file),\n        line(_line)\n  {\n    out << type << \"(\" << expression << \"): \" << error.message << \" \";\n  }\n\n  ~_CheckFatal()\n  {\n    google::LogMessageFatal(file.c_str(), line).stream() << out.str();\n  }\n\n  std::ostream& stream()\n  {\n    return out;\n  }\n\n  const std::string file;\n  const int line;\n  std::ostringstream out;\n};\n\n#endif \/\/ __STOUT_CHECK_HPP__\n<commit_msg>Added `CHECK_CONTAINS` and `CHECK_NOT_CONTAINS` macros.<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_CHECK_HPP__\n#define __STOUT_CHECK_HPP__\n\n#include <ostream>\n#include <sstream>\n#include <string>\n\n#include <glog\/logging.h>\n\n#include <stout\/abort.hpp>\n#include <stout\/error.hpp>\n#include <stout\/none.hpp>\n#include <stout\/option.hpp>\n#include <stout\/some.hpp>\n\n\ntemplate <typename T>\nclass Result;\n\ntemplate <typename T, typename E>\nclass Try;\n\n\n\/\/ A generic macro to facilitate definitions of CHECK_*, akin to CHECK.\n\/\/ This appends the error if possible to the end of the log message,\n\/\/ so there's no need to append the error message explicitly.\n\/\/ To define a new CHECK_*, provide the name, the function that performs the\n\/\/ check, and the expression. See below for examples (e.g. CHECK_SOME).\n#define CHECK_STATE(name, check, expression)                             \\\n  for (const Option<Error> _error = check(expression); _error.isSome();) \\\n    _CheckFatal(__FILE__,                                                \\\n                __LINE__,                                                \\\n                #name,                                                   \\\n                #expression,                                             \\\n                _error.get()).stream()\n\n\n#define CHECK_SOME(expression) \\\n  CHECK_STATE(CHECK_SOME, _check_some, expression)\n\n\n#define CHECK_NONE(expression) \\\n  CHECK_STATE(CHECK_NONE, _check_none, expression)\n\n\n#define CHECK_ERROR(expression) \\\n  CHECK_STATE(CHECK_ERROR, _check_error, expression)\n\n\n\/\/ A private helper for CHECK_NOTNONE which is similar to the\n\/\/ CHECK_NOTNULL provided by glog.\ntemplate <typename T>\nT&& _check_not_none(\n    const char* file,\n    int line,\n    const char* message,\n    Option<T>&& t) {\n  if (t.isNone()) {\n    google::LogMessageFatal(file, line, new std::string(message));\n  }\n  return std::move(t).get();\n}\n\n\ntemplate <typename T>\nT& _check_not_none(\n    const char* file,\n    int line,\n    const char* message,\n    Option<T>& t) {\n  if (t.isNone()) {\n    google::LogMessageFatal(file, line, new std::string(message));\n  }\n  return t.get();\n}\n\n\ntemplate <typename T>\nconst T& _check_not_none(\n    const char* file,\n    int line,\n    const char* message,\n    const Option<T>& t) {\n  if (t.isNone()) {\n    google::LogMessageFatal(file, line, new std::string(message));\n  }\n  return t.get();\n}\n\n\n#define CHECK_NOTNONE(expression) \\\n  _check_not_none( \\\n      __FILE__, \\\n      __LINE__, \\\n      \"'\" #expression \"' Must be SOME\", \\\n      (expression))\n\n\n\/\/ A private helper for CHECK_NOTERROR which is similar to the\n\/\/ CHECK_NOTNULL provided by glog.\ntemplate <typename T, typename E>\nT&& _check_not_error(\n    const char* file,\n    int line,\n    const char* message,\n    Try<T, E>&& t) {\n  if (t.isError()) {\n    google::LogMessageFatal(\n        file,\n        line,\n        new std::string(\n            std::string(message) + \": \" + Error(t.error()).message));\n  }\n  return std::move(t).get();\n}\n\n\ntemplate <typename T, typename E>\nT& _check_not_error(\n    const char* file,\n    int line,\n    const char* message,\n    Try<T, E>& t) {\n  if (t.isError()) {\n    google::LogMessageFatal(\n        file,\n        line,\n        new std::string(\n            std::string(message) + \": \" + Error(t.error()).message));\n  }\n  return t.get();\n}\n\n\ntemplate <typename T, typename E>\nconst T& _check_not_error(\n    const char* file,\n    int line,\n    const char* message,\n    const Try<T, E>& t) {\n  if (t.isError()) {\n    google::LogMessageFatal(\n        file,\n        line,\n        new std::string(\n            std::string(message) + \": \" + Error(t.error()).message));\n  }\n  return t.get();\n}\n\n\n#define CHECK_NOTERROR(expression) \\\n  _check_not_error( \\\n      __FILE__, \\\n      __LINE__, \\\n      \"'\" #expression \"' Must be SOME\", \\\n      (expression))\n\n\n\/\/ Private structs\/functions used for CHECK_*.\n\ntemplate <typename T>\nOption<Error> _check_some(const Option<T>& o)\n{\n  if (o.isNone()) {\n    return Error(\"is NONE\");\n  } else {\n    CHECK(o.isSome());\n    return None();\n  }\n}\n\n\ntemplate <typename T, typename E>\nOption<Error> _check_some(const Try<T, E>& t)\n{\n  if (t.isError()) {\n    return Error(t.error());\n  } else {\n    CHECK(t.isSome());\n    return None();\n  }\n}\n\n\ntemplate <typename T>\nOption<Error> _check_some(const Result<T>& r)\n{\n  if (r.isError()) {\n    return Error(r.error());\n  } else if (r.isNone()) {\n    return Error(\"is NONE\");\n  } else {\n    CHECK(r.isSome());\n    return None();\n  }\n}\n\n\ntemplate <typename T>\nOption<Error> _check_none(const Option<T>& o)\n{\n  if (o.isSome()) {\n    return Error(\"is SOME\");\n  } else {\n    CHECK(o.isNone());\n    return None();\n  }\n}\n\n\ntemplate <typename T>\nOption<Error> _check_none(const Result<T>& r)\n{\n  if (r.isError()) {\n    return Error(\"is ERROR\");\n  } else if (r.isSome()) {\n    return Error(\"is SOME\");\n  } else {\n    CHECK(r.isNone());\n    return None();\n  }\n}\n\n\ntemplate <typename T, typename E>\nOption<Error> _check_error(const Try<T, E>& t)\n{\n  if (t.isSome()) {\n    return Error(\"is SOME\");\n  } else {\n    CHECK(t.isError());\n    return None();\n  }\n}\n\n\ntemplate <typename T>\nOption<Error> _check_error(const Result<T>& r)\n{\n  if (r.isNone()) {\n    return Error(\"is NONE\");\n  } else if (r.isSome()) {\n    return Error(\"is SOME\");\n  } else {\n    CHECK(r.isError());\n    return None();\n  }\n}\n\n\nstruct _CheckFatal\n{\n  _CheckFatal(const char* _file,\n              int _line,\n              const char* type,\n              const char* expression,\n              const Error& error)\n      : file(_file),\n        line(_line)\n  {\n    out << type << \"(\" << expression << \"): \" << error.message << \" \";\n  }\n\n  ~_CheckFatal()\n  {\n    google::LogMessageFatal(file.c_str(), line).stream() << out.str();\n  }\n\n  std::ostream& stream()\n  {\n    return out;\n  }\n\n  const std::string file;\n  const int line;\n  std::ostringstream out;\n};\n\n\n\/\/ Check on whether some container (that supports the contains()\n\/\/ member function) contains the given key. This prints a message\n\/\/ of the form:\n\/\/\n\/\/ Check failed: $ContainerName does not contain $Value\n#define CHECK_CONTAINS(container, key)                                    \\\n  if (!(container).contains(key))                                         \\\n    google::LogMessageFatal(__FILE__, __LINE__).stream()                  \\\n      << \"Check failed: \"  << #container << \" does not contain \" << (key) \\\n\n\n\/\/ Check on whether some container (that supports the contains()\n\/\/ member function) does not contain the given key. This prints\n\/\/ a message of the form:\n\/\/\n\/\/ Check failed: $ContainerName already contains $Value\n#define CHECK_NOT_CONTAINS(container, key)                                \\\n  if ((container).contains(key))                                          \\\n    google::LogMessageFatal(__FILE__, __LINE__).stream()                  \\\n      << \"Check failed: \"  << #container << \" already contains \" << (key) \\\n\n#endif \/\/ __STOUT_CHECK_HPP__\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2013-2014 Sandstorm Development Group, 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#include \"debug.h\"\n#include <stdlib.h>\n#include <ctype.h>\n#include <string.h>\n#include <errno.h>\n\n#if _WIN32\n#define strerror_r(errno,buf,len) strerror_s(buf,len,errno)\n#endif\n\nnamespace kj {\nnamespace _ {  \/\/ private\n\nDebug::Severity Debug::minSeverity = Debug::Severity::WARNING;\n\nArrayPtr<const char> KJ_STRINGIFY(Debug::Severity severity) {\n  static const char* SEVERITY_STRINGS[] = {\n    \"info\",\n    \"warning\",\n    \"error\",\n    \"fatal\",\n    \"debug\"\n  };\n\n  const char* s = SEVERITY_STRINGS[static_cast<uint>(severity)];\n  return arrayPtr(s, strlen(s));\n}\n\nnamespace {\n\nException::Type typeOfErrno(int error) {\n  switch (error) {\n    case EDQUOT:\n    case EMFILE:\n    case ENFILE:\n    case ENOBUFS:\n    case ENOLCK:\n    case ENOMEM:\n    case ENOSPC:\n    case ETIMEDOUT:\n    case EUSERS:\n      return Exception::Type::OVERLOADED;\n\n    case ECONNABORTED:\n    case ECONNREFUSED:\n    case ECONNRESET:\n    case EHOSTDOWN:\n    case EHOSTUNREACH:\n    case ENETDOWN:\n    case ENETRESET:\n    case ENETUNREACH:\n    case ENONET:\n    case EPIPE:\n      return Exception::Type::DISCONNECTED;\n\n    case ENOSYS:\n#if ENOTSUP\n    case ENOTSUP:\n#endif\n#if EOPNOTSUPP && EOPNOTSUPP != ENOTSUP\n    case EOPNOTSUPP:\n#endif\n      return Exception::Type::UNIMPLEMENTED;\n\n    default:\n      return Exception::Type::FAILED;\n  }\n}\n\nenum DescriptionStyle {\n  LOG,\n  ASSERTION,\n  SYSCALL\n};\n\nstatic String makeDescriptionImpl(DescriptionStyle style, const char* code, int errorNumber,\n                                  const char* macroArgs, ArrayPtr<String> argValues) {\n  KJ_STACK_ARRAY(ArrayPtr<const char>, argNames, argValues.size(), 8, 64);\n\n  if (argValues.size() > 0) {\n    size_t index = 0;\n    const char* start = macroArgs;\n    while (isspace(*start)) ++start;\n    const char* pos = start;\n    uint depth = 0;\n    bool quoted = false;\n    while (char c = *pos++) {\n      if (quoted) {\n        if (c == '\\\\' && *pos != '\\0') {\n          ++pos;\n        } else if (c == '\\\"') {\n          quoted = false;\n        }\n      } else {\n        if (c == '(') {\n          ++depth;\n        } else if (c == ')') {\n          --depth;\n        } else if (c == '\\\"') {\n          quoted = true;\n        } else if (c == ',' && depth == 0) {\n          if (index < argValues.size()) {\n            argNames[index] = arrayPtr(start, pos - 1);\n          }\n          ++index;\n          while (isspace(*pos)) ++pos;\n          start = pos;\n        }\n      }\n    }\n    if (index < argValues.size()) {\n      argNames[index] = arrayPtr(start, pos - 1);\n    }\n    ++index;\n\n    if (index != argValues.size()) {\n      getExceptionCallback().logMessage(__FILE__, __LINE__, 0,\n          str(\"Failed to parse logging macro args into \",\n              argValues.size(), \" names: \", macroArgs, '\\n'));\n    }\n  }\n\n  if (style == SYSCALL) {\n    \/\/ Strip off leading \"foo = \" from code, since callers will sometimes write things like:\n    \/\/   ssize_t n;\n    \/\/   RECOVERABLE_SYSCALL(n = read(fd, buffer, sizeof(buffer))) { return \"\"; }\n    \/\/   return std::string(buffer, n);\n    const char* equalsPos = strchr(code, '=');\n    if (equalsPos != nullptr && equalsPos[1] != '=') {\n      code = equalsPos + 1;\n      while (isspace(*code)) ++code;\n    }\n  }\n\n  if (style == ASSERTION && code == nullptr) {\n    style = LOG;\n  }\n\n  {\n    StringPtr expected = \"expected \";\n    StringPtr codeArray = style == LOG ? nullptr : StringPtr(code);\n    StringPtr sep = \" = \";\n    StringPtr delim = \"; \";\n    StringPtr colon = \": \";\n\n    StringPtr sysErrorArray;\n#if __USE_GNU\n    char buffer[256];\n    if (style == SYSCALL) {\n      sysErrorArray = strerror_r(errorNumber, buffer, sizeof(buffer));\n    }\n#else\n    char buffer[256];\n    if (style == SYSCALL) {\n      strerror_r(errorNumber, buffer, sizeof(buffer));\n      sysErrorArray = buffer;\n    }\n#endif\n\n    size_t totalSize = 0;\n    switch (style) {\n      case LOG:\n        break;\n      case ASSERTION:\n        totalSize += expected.size() + codeArray.size();\n        break;\n      case SYSCALL:\n        totalSize += codeArray.size() + colon.size() + sysErrorArray.size();\n        break;\n    }\n\n    for (size_t i = 0; i < argValues.size(); i++) {\n      if (i > 0 || style != LOG) {\n        totalSize += delim.size();\n      }\n      if (argNames[i].size() > 0 && argNames[i][0] != '\\\"') {\n        totalSize += argNames[i].size() + sep.size();\n      }\n      totalSize += argValues[i].size();\n    }\n\n    String result = heapString(totalSize);\n    char* pos = result.begin();\n\n    switch (style) {\n      case LOG:\n        break;\n      case ASSERTION:\n        pos = _::fill(pos, expected, codeArray);\n        break;\n      case SYSCALL:\n        pos = _::fill(pos, codeArray, colon, sysErrorArray);\n        break;\n    }\n    for (size_t i = 0; i < argValues.size(); i++) {\n      if (i > 0 || style != LOG) {\n        pos = _::fill(pos, delim);\n      }\n      if (argNames[i].size() > 0 && argNames[i][0] != '\\\"') {\n        pos = _::fill(pos, argNames[i], sep);\n      }\n      pos = _::fill(pos, argValues[i]);\n    }\n\n    return result;\n  }\n}\n\n}  \/\/ namespace\n\nvoid Debug::logInternal(const char* file, int line, Severity severity, const char* macroArgs,\n                        ArrayPtr<String> argValues) {\n  getExceptionCallback().logMessage(file, line, 0,\n      str(severity, \": \", makeDescriptionImpl(LOG, nullptr, 0, macroArgs, argValues), '\\n'));\n}\n\nDebug::Fault::~Fault() noexcept(false) {\n  if (exception != nullptr) {\n    Exception copy = mv(*exception);\n    delete exception;\n    throwRecoverableException(mv(copy));\n  }\n}\n\nvoid Debug::Fault::fatal() {\n  Exception copy = mv(*exception);\n  delete exception;\n  exception = nullptr;\n  throwFatalException(mv(copy));\n  abort();\n}\n\nvoid Debug::Fault::init(\n    const char* file, int line, Exception::Type type,\n    const char* condition, const char* macroArgs, ArrayPtr<String> argValues) {\n  exception = new Exception(type, file, line,\n      makeDescriptionImpl(ASSERTION, condition, 0, macroArgs, argValues));\n}\n\nvoid Debug::Fault::init(\n    const char* file, int line, int osErrorNumber,\n    const char* condition, const char* macroArgs, ArrayPtr<String> argValues) {\n  exception = new Exception(typeOfErrno(osErrorNumber), file, line,\n      makeDescriptionImpl(SYSCALL, condition, osErrorNumber, macroArgs, argValues));\n}\n\nString Debug::makeDescriptionInternal(const char* macroArgs, ArrayPtr<String> argValues) {\n  return makeDescriptionImpl(LOG, nullptr, 0, macroArgs, argValues);\n}\n\nint Debug::getOsErrorNumber(bool nonblocking) {\n  int result = errno;\n\n  \/\/ On many systems, EAGAIN and EWOULDBLOCK have the same value, but this is not strictly required\n  \/\/ by POSIX, so we need to check both.\n  return result == EINTR ? -1\n       : nonblocking && (result == EAGAIN || result == EWOULDBLOCK) ? 0\n       : result;\n}\n\nDebug::Context::Context(): logged(false) {}\nDebug::Context::~Context() noexcept(false) {}\n\nDebug::Context::Value Debug::Context::ensureInitialized() {\n  KJ_IF_MAYBE(v, value) {\n    return Value(v->file, v->line, heapString(v->description));\n  } else {\n    Value result = evaluate();\n    value = Value(result.file, result.line, heapString(result.description));\n    return result;\n  }\n}\n\nvoid Debug::Context::onRecoverableException(Exception&& exception) {\n  Value v = ensureInitialized();\n  exception.wrapContext(v.file, v.line, mv(v.description));\n  next.onRecoverableException(kj::mv(exception));\n}\nvoid Debug::Context::onFatalException(Exception&& exception) {\n  Value v = ensureInitialized();\n  exception.wrapContext(v.file, v.line, mv(v.description));\n  next.onFatalException(kj::mv(exception));\n}\nvoid Debug::Context::logMessage(const char* file, int line, int contextDepth, String&& text) {\n  if (!logged) {\n    Value v = ensureInitialized();\n    next.logMessage(v.file, v.line, 0, str(\"context: \", mv(v.description), '\\n'));\n    logged = true;\n  }\n\n  next.logMessage(file, line, contextDepth + 1, mv(text));\n}\n\n}  \/\/ namespace _ (private)\n}  \/\/ namespace kj\n<commit_msg>Fix build on OSX, etc. by checking whether each errno is defined.<commit_after>\/\/ Copyright (c) 2013-2014 Sandstorm Development Group, 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#include \"debug.h\"\n#include <stdlib.h>\n#include <ctype.h>\n#include <string.h>\n#include <errno.h>\n\n#if _WIN32\n#define strerror_r(errno,buf,len) strerror_s(buf,len,errno)\n#endif\n\nnamespace kj {\nnamespace _ {  \/\/ private\n\nDebug::Severity Debug::minSeverity = Debug::Severity::WARNING;\n\nArrayPtr<const char> KJ_STRINGIFY(Debug::Severity severity) {\n  static const char* SEVERITY_STRINGS[] = {\n    \"info\",\n    \"warning\",\n    \"error\",\n    \"fatal\",\n    \"debug\"\n  };\n\n  const char* s = SEVERITY_STRINGS[static_cast<uint>(severity)];\n  return arrayPtr(s, strlen(s));\n}\n\nnamespace {\n\nException::Type typeOfErrno(int error) {\n  switch (error) {\n#ifdef EDQUOT\n    case EDQUOT:\n#endif\n#ifdef EMFILE\n    case EMFILE:\n#endif\n#ifdef ENFILE\n    case ENFILE:\n#endif\n#ifdef ENOBUFS\n    case ENOBUFS:\n#endif\n#ifdef ENOLCK\n    case ENOLCK:\n#endif\n#ifdef ENOMEM\n    case ENOMEM:\n#endif\n#ifdef ENOSPC\n    case ENOSPC:\n#endif\n#ifdef ETIMEDOUT\n    case ETIMEDOUT:\n#endif\n#ifdef EUSERS\n    case EUSERS:\n#endif\n      return Exception::Type::OVERLOADED;\n\n#ifdef ECONNABORTED\n    case ECONNABORTED:\n#endif\n#ifdef ECONNREFUSED\n    case ECONNREFUSED:\n#endif\n#ifdef ECONNRESET\n    case ECONNRESET:\n#endif\n#ifdef EHOSTDOWN\n    case EHOSTDOWN:\n#endif\n#ifdef EHOSTUNREACH\n    case EHOSTUNREACH:\n#endif\n#ifdef ENETDOWN\n    case ENETDOWN:\n#endif\n#ifdef ENETRESET\n    case ENETRESET:\n#endif\n#ifdef ENETUNREACH\n    case ENETUNREACH:\n#endif\n#ifdef ENONET\n    case ENONET:\n#endif\n#ifdef EPIPE\n    case EPIPE:\n#endif\n      return Exception::Type::DISCONNECTED;\n\n#ifdef ENOSYS\n    case ENOSYS:\n#endif\n#ifdef ENOTSUP\n    case ENOTSUP:\n#endif\n#if defined(EOPNOTSUPP) && EOPNOTSUPP != ENOTSUP\n    case EOPNOTSUPP:\n#endif\n      return Exception::Type::UNIMPLEMENTED;\n\n    default:\n      return Exception::Type::FAILED;\n  }\n}\n\nenum DescriptionStyle {\n  LOG,\n  ASSERTION,\n  SYSCALL\n};\n\nstatic String makeDescriptionImpl(DescriptionStyle style, const char* code, int errorNumber,\n                                  const char* macroArgs, ArrayPtr<String> argValues) {\n  KJ_STACK_ARRAY(ArrayPtr<const char>, argNames, argValues.size(), 8, 64);\n\n  if (argValues.size() > 0) {\n    size_t index = 0;\n    const char* start = macroArgs;\n    while (isspace(*start)) ++start;\n    const char* pos = start;\n    uint depth = 0;\n    bool quoted = false;\n    while (char c = *pos++) {\n      if (quoted) {\n        if (c == '\\\\' && *pos != '\\0') {\n          ++pos;\n        } else if (c == '\\\"') {\n          quoted = false;\n        }\n      } else {\n        if (c == '(') {\n          ++depth;\n        } else if (c == ')') {\n          --depth;\n        } else if (c == '\\\"') {\n          quoted = true;\n        } else if (c == ',' && depth == 0) {\n          if (index < argValues.size()) {\n            argNames[index] = arrayPtr(start, pos - 1);\n          }\n          ++index;\n          while (isspace(*pos)) ++pos;\n          start = pos;\n        }\n      }\n    }\n    if (index < argValues.size()) {\n      argNames[index] = arrayPtr(start, pos - 1);\n    }\n    ++index;\n\n    if (index != argValues.size()) {\n      getExceptionCallback().logMessage(__FILE__, __LINE__, 0,\n          str(\"Failed to parse logging macro args into \",\n              argValues.size(), \" names: \", macroArgs, '\\n'));\n    }\n  }\n\n  if (style == SYSCALL) {\n    \/\/ Strip off leading \"foo = \" from code, since callers will sometimes write things like:\n    \/\/   ssize_t n;\n    \/\/   RECOVERABLE_SYSCALL(n = read(fd, buffer, sizeof(buffer))) { return \"\"; }\n    \/\/   return std::string(buffer, n);\n    const char* equalsPos = strchr(code, '=');\n    if (equalsPos != nullptr && equalsPos[1] != '=') {\n      code = equalsPos + 1;\n      while (isspace(*code)) ++code;\n    }\n  }\n\n  if (style == ASSERTION && code == nullptr) {\n    style = LOG;\n  }\n\n  {\n    StringPtr expected = \"expected \";\n    StringPtr codeArray = style == LOG ? nullptr : StringPtr(code);\n    StringPtr sep = \" = \";\n    StringPtr delim = \"; \";\n    StringPtr colon = \": \";\n\n    StringPtr sysErrorArray;\n#if __USE_GNU\n    char buffer[256];\n    if (style == SYSCALL) {\n      sysErrorArray = strerror_r(errorNumber, buffer, sizeof(buffer));\n    }\n#else\n    char buffer[256];\n    if (style == SYSCALL) {\n      strerror_r(errorNumber, buffer, sizeof(buffer));\n      sysErrorArray = buffer;\n    }\n#endif\n\n    size_t totalSize = 0;\n    switch (style) {\n      case LOG:\n        break;\n      case ASSERTION:\n        totalSize += expected.size() + codeArray.size();\n        break;\n      case SYSCALL:\n        totalSize += codeArray.size() + colon.size() + sysErrorArray.size();\n        break;\n    }\n\n    for (size_t i = 0; i < argValues.size(); i++) {\n      if (i > 0 || style != LOG) {\n        totalSize += delim.size();\n      }\n      if (argNames[i].size() > 0 && argNames[i][0] != '\\\"') {\n        totalSize += argNames[i].size() + sep.size();\n      }\n      totalSize += argValues[i].size();\n    }\n\n    String result = heapString(totalSize);\n    char* pos = result.begin();\n\n    switch (style) {\n      case LOG:\n        break;\n      case ASSERTION:\n        pos = _::fill(pos, expected, codeArray);\n        break;\n      case SYSCALL:\n        pos = _::fill(pos, codeArray, colon, sysErrorArray);\n        break;\n    }\n    for (size_t i = 0; i < argValues.size(); i++) {\n      if (i > 0 || style != LOG) {\n        pos = _::fill(pos, delim);\n      }\n      if (argNames[i].size() > 0 && argNames[i][0] != '\\\"') {\n        pos = _::fill(pos, argNames[i], sep);\n      }\n      pos = _::fill(pos, argValues[i]);\n    }\n\n    return result;\n  }\n}\n\n}  \/\/ namespace\n\nvoid Debug::logInternal(const char* file, int line, Severity severity, const char* macroArgs,\n                        ArrayPtr<String> argValues) {\n  getExceptionCallback().logMessage(file, line, 0,\n      str(severity, \": \", makeDescriptionImpl(LOG, nullptr, 0, macroArgs, argValues), '\\n'));\n}\n\nDebug::Fault::~Fault() noexcept(false) {\n  if (exception != nullptr) {\n    Exception copy = mv(*exception);\n    delete exception;\n    throwRecoverableException(mv(copy));\n  }\n}\n\nvoid Debug::Fault::fatal() {\n  Exception copy = mv(*exception);\n  delete exception;\n  exception = nullptr;\n  throwFatalException(mv(copy));\n  abort();\n}\n\nvoid Debug::Fault::init(\n    const char* file, int line, Exception::Type type,\n    const char* condition, const char* macroArgs, ArrayPtr<String> argValues) {\n  exception = new Exception(type, file, line,\n      makeDescriptionImpl(ASSERTION, condition, 0, macroArgs, argValues));\n}\n\nvoid Debug::Fault::init(\n    const char* file, int line, int osErrorNumber,\n    const char* condition, const char* macroArgs, ArrayPtr<String> argValues) {\n  exception = new Exception(typeOfErrno(osErrorNumber), file, line,\n      makeDescriptionImpl(SYSCALL, condition, osErrorNumber, macroArgs, argValues));\n}\n\nString Debug::makeDescriptionInternal(const char* macroArgs, ArrayPtr<String> argValues) {\n  return makeDescriptionImpl(LOG, nullptr, 0, macroArgs, argValues);\n}\n\nint Debug::getOsErrorNumber(bool nonblocking) {\n  int result = errno;\n\n  \/\/ On many systems, EAGAIN and EWOULDBLOCK have the same value, but this is not strictly required\n  \/\/ by POSIX, so we need to check both.\n  return result == EINTR ? -1\n       : nonblocking && (result == EAGAIN || result == EWOULDBLOCK) ? 0\n       : result;\n}\n\nDebug::Context::Context(): logged(false) {}\nDebug::Context::~Context() noexcept(false) {}\n\nDebug::Context::Value Debug::Context::ensureInitialized() {\n  KJ_IF_MAYBE(v, value) {\n    return Value(v->file, v->line, heapString(v->description));\n  } else {\n    Value result = evaluate();\n    value = Value(result.file, result.line, heapString(result.description));\n    return result;\n  }\n}\n\nvoid Debug::Context::onRecoverableException(Exception&& exception) {\n  Value v = ensureInitialized();\n  exception.wrapContext(v.file, v.line, mv(v.description));\n  next.onRecoverableException(kj::mv(exception));\n}\nvoid Debug::Context::onFatalException(Exception&& exception) {\n  Value v = ensureInitialized();\n  exception.wrapContext(v.file, v.line, mv(v.description));\n  next.onFatalException(kj::mv(exception));\n}\nvoid Debug::Context::logMessage(const char* file, int line, int contextDepth, String&& text) {\n  if (!logged) {\n    Value v = ensureInitialized();\n    next.logMessage(v.file, v.line, 0, str(\"context: \", mv(v.description), '\\n'));\n    logged = true;\n  }\n\n  next.logMessage(file, line, contextDepth + 1, mv(text));\n}\n\n}  \/\/ namespace _ (private)\n}  \/\/ namespace kj\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2014 The Souper 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 \"souper\/Inst\/Inst.h\"\n\n#include \"llvm\/Support\/ErrorHandling.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\nusing namespace souper;\n\nbool Inst::operator<(const Inst &Other) const {\n  if (this == &Other)\n    return false;\n\n  if (K < Other.K)\n    return true;\n  if (K > Other.K)\n    return false;\n\n  if (Width < Other.Width)\n    return true;\n  if (Width > Other.Width)\n    return false;\n\n  switch (K) {\n  case Const:\n    return Val.ult(Other.Val);\n  case UntypedConst: {\n    llvm::APInt Val1 = Val, Val2 = Other.Val;\n    if (Val1.getBitWidth() < Val2.getBitWidth())\n      Val1 = Val1.sext(Val2.getBitWidth());\n    else if (Val1.getBitWidth() > Val2.getBitWidth())\n      Val2 = Val2.sext(Val1.getBitWidth());\n    return Val1.slt(Val2);\n  }\n  case Var:\n    return Number < Other.Number;\n  case Phi:\n    if (B->Number < Other.B->Number)\n      return true;\n    if (B->Number > Other.B->Number)\n      return false;\n  default:\n    break;\n  }\n\n  if (Ops.size() < Other.Ops.size())\n    return true;\n  if (Ops.size() > Other.Ops.size())\n    return false;\n\n  const std::vector<Inst *> &OpsA = orderedOps();\n  const std::vector<Inst *> &OpsB = Other.orderedOps();\n\n  for (unsigned I = 0; I != OpsA.size(); ++I) {\n    if (OpsA[I] == OpsB[I])\n      continue;\n    return (*OpsA[I] < *OpsB[I]);\n  }\n\n  llvm_unreachable(\"Should have found an unequal operand\");\n}\n\nconst std::vector<Inst *> &Inst::orderedOps() const {\n  if (!isCommutative(K))\n    return Ops;\n\n  if (OrderedOps.empty()) {\n    OrderedOps = Ops;\n    std::sort(OrderedOps.begin(), OrderedOps.end(), [](Inst *A, Inst *B) {\n      return *A < *B;\n    });\n  }\n  return OrderedOps;\n}\n\nstd::string PrintContext::printInst(Inst *I) {\n  std::string Str;\n  llvm::raw_string_ostream SS(Str);\n\n  auto PNI = PrintNums.find(static_cast<void *>(I));\n  if (PNI != PrintNums.end()) {\n    SS << \"%\" << PNI->second;\n    return SS.str();\n  }\n\n  std::string OpsStr;\n  llvm::raw_string_ostream OpsSS(OpsStr);\n\n  switch (I->K) {\n  default:\n    break;\n\n  case Inst::Const:\n    I->Val.print(SS, false);\n    SS << \":i\" << I->Val.getBitWidth();\n    return SS.str();\n\n  case Inst::UntypedConst:\n    I->Val.print(SS, false);\n    return SS.str();\n\n  case Inst::Phi:\n    unsigned BlockNum = printBlock(I->B);\n    OpsSS << \" %\" << BlockNum << \",\";\n    break;\n  }\n\n  const std::vector<Inst *> &Ops = I->orderedOps();\n  for (unsigned I = 0; I != Ops.size(); ++I) {\n    if (I == 0)\n      OpsSS << \" \";\n    else\n      OpsSS << \", \";\n    OpsSS << printInst(Ops[I]);\n  }\n\n  unsigned InstNum = PrintNums.size();\n  PrintNums[static_cast<void *>(I)] = InstNum;\n\n  Out << \"%\" << InstNum << \":i\" << I->Width << \" = \" << Inst::getKindName(I->K)\n      << OpsSS.str();\n\n  if (!I->Name.empty()) {\n    Out << \" ; \" << I->Name;\n  }\n\n  Out << '\\n';\n\n  SS << \"%\" << InstNum;\n  return SS.str();\n}\n\nunsigned PrintContext::printBlock(Block *B) {\n  std::string Str;\n  llvm::raw_string_ostream SS(Str);\n\n  auto PNI = PrintNums.find(static_cast<void *>(B));\n  if (PNI != PrintNums.end()) {\n    return PNI->second;\n  }\n\n  unsigned BlockNum = PrintNums.size();\n  PrintNums[static_cast<void *>(B)] = BlockNum;\n\n  Out << '%' << BlockNum << \" = block\\n\";\n  return BlockNum;\n}\n\nconst char *Inst::getKindName(Kind K) {\n  switch (K) {\n  case Const:\n    return \"const\";\n  case UntypedConst:\n    return \"untypedconst\";\n  case Var:\n    return \"var\";\n  case Phi:\n    return \"phi\";\n  case Add:\n    return \"add\";\n  case AddNSW:\n    return \"addnsw\";\n  case AddNUW:\n    return \"addnuw\";\n  case AddNW:\n    return \"addnw\";\n  case Sub:\n    return \"sub\";\n  case SubNSW:\n    return \"subnsw\";\n  case SubNUW:\n    return \"subnuw\";\n  case SubNW:\n    return \"subnw\";\n  case Mul:\n    return \"mul\";\n  case MulNSW:\n    return \"mulnsw\";\n  case MulNUW:\n    return \"mulnuw\";\n  case MulNW:\n    return \"mulnw\";\n  case UDiv:\n    return \"udiv\";\n  case SDiv:\n    return \"sdiv\";\n  case UDivExact:\n    return \"udivexact\";\n  case SDivExact:\n    return \"sdivexact\";\n  case URem:\n    return \"urem\";\n  case SRem:\n    return \"srem\";\n  case And:\n    return \"and\";\n  case Or:\n    return \"or\";\n  case Xor:\n    return \"xor\";\n  case Shl:\n    return \"shl\";\n  case ShlNSW:\n    return \"shlnsw\";\n  case ShlNUW:\n    return \"shlnuw\";\n  case ShlNW:\n    return \"shlnw\";\n  case LShr:\n    return \"lshr\";\n  case LShrExact:\n    return \"lshrexact\";\n  case AShr:\n    return \"ashr\";\n  case AShrExact:\n    return \"ashrexact\";\n  case Select:\n    return \"select\";\n  case ZExt:\n    return \"zext\";\n  case SExt:\n    return \"sext\";\n  case Trunc:\n    return \"trunc\";\n  case Eq:\n    return \"eq\";\n  case Ne:\n    return \"ne\";\n  case Ult:\n    return \"ult\";\n  case Slt:\n    return \"slt\";\n  case Ule:\n    return \"ule\";\n  case Sle:\n    return \"sle\";\n  }\n\n  llvm_unreachable(\"all cases covered\");\n}\n\nvoid Inst::Profile(llvm::FoldingSetNodeID &ID) const {\n  ID.AddInteger(K);\n  ID.AddInteger(Width);\n\n  switch (K) {\n  case Const:\n  case UntypedConst:\n    Val.Profile(ID);\n    return;\n  case Var:\n    assert(0 && \"Var instructions should not be in FoldingSet\");\n  case Phi:\n    ID.AddPointer(B);\n    break;\n  default:\n    break;\n  }\n\n  for (auto Op : Ops)\n    ID.AddPointer(Op);\n}\n\nInst *InstContext::getConst(const llvm::APInt &Val) {\n  llvm::FoldingSetNodeID ID;\n  ID.AddInteger(Inst::Const);\n  ID.AddInteger(Val.getBitWidth());\n  Val.Profile(ID);\n\n  void *IP = 0;\n  if (Inst *I = InstSet.FindNodeOrInsertPos(ID, IP))\n    return I;\n\n  auto N = new Inst;\n  Insts.emplace_back(N);\n  N->K = Inst::Const;\n  N->Width = Val.getBitWidth();\n  N->Val = Val;\n  InstSet.InsertNode(N, IP);\n  return N;\n}\n\nInst *InstContext::getUntypedConst(const llvm::APInt &Val) {\n  llvm::FoldingSetNodeID ID;\n  ID.AddInteger(Inst::UntypedConst);\n  ID.AddInteger(0);\n  Val.Profile(ID);\n\n  void *IP = 0;\n  if (Inst *I = InstSet.FindNodeOrInsertPos(ID, IP))\n    return I;\n\n  auto N = new Inst;\n  Insts.emplace_back(N);\n  N->K = Inst::UntypedConst;\n  N->Width = 0;\n  N->Val = Val;\n  InstSet.InsertNode(N, IP);\n  return N;\n}\n\nInst *InstContext::createVar(unsigned Width, llvm::StringRef Name) {\n  auto &InstList = VarInstsByWidth[Width];\n  unsigned Number = InstList.size();\n  auto I = new Inst;\n  InstList.emplace_back(I);\n\n  I->K = Inst::Var;\n  I->Number = Number;\n  I->Width = Width;\n  I->Name = Name;\n  return I;\n}\n\nBlock *InstContext::createBlock(unsigned Preds) {\n  auto &BlockList = BlocksByPreds[Preds];\n  unsigned Number = BlockList.size();\n  auto B = new Block;\n  BlockList.emplace_back(B);\n\n  B->Number = Number;\n  B->Preds = Preds;\n  return B;\n}\n\nInst *InstContext::getPhi(Block *B, const std::vector<Inst *> &Ops) {\n  llvm::FoldingSetNodeID ID;\n  ID.AddInteger(Inst::Phi);\n  ID.AddInteger(Ops[0]->Width);\n  ID.AddPointer(B);\n  for (auto O : Ops)\n    ID.AddPointer(O);\n\n  void *IP = 0;\n  if (Inst *I = InstSet.FindNodeOrInsertPos(ID, IP))\n    return I;\n\n  auto N = new Inst;\n  Insts.emplace_back(N);\n  N->K = Inst::Phi;\n  N->Width = Ops[0]->Width;\n  N->B = B;\n  N->Ops = Ops;\n  InstSet.InsertNode(N, IP);\n  return N;\n}\n\nInst *InstContext::getInst(Inst::Kind K, unsigned Width,\n                           const std::vector<Inst *> &Ops) {\n  std::vector<Inst *> OrderedOps;\n\n  const std::vector<Inst *> *InstOps;\n  if (Inst::isAssociative(K)) {\n    for (Inst *Op : Ops) {\n      if (Op->K == K)\n        OrderedOps.insert(OrderedOps.end(), Op->Ops.begin(), Op->Ops.end());\n      else\n        OrderedOps.push_back(Op);\n    }\n    std::sort(OrderedOps.begin(), OrderedOps.end());\n    InstOps = &OrderedOps;\n  } else if (Inst::isCommutative(K)) {\n    OrderedOps = Ops;\n    std::sort(OrderedOps.begin(), OrderedOps.end());\n    InstOps = &OrderedOps;\n  } else {\n    InstOps = &Ops;\n  }\n\n  llvm::FoldingSetNodeID ID;\n  ID.AddInteger(K);\n  ID.AddInteger(Width);\n  for (auto O : *InstOps)\n    ID.AddPointer(O);\n\n  void *IP = 0;\n  if (Inst *I = InstSet.FindNodeOrInsertPos(ID, IP))\n    return I;\n\n  auto N = new Inst;\n  Insts.emplace_back(N);\n  N->K = K;\n  N->Width = Width;\n  N->Ops = *InstOps;\n  InstSet.InsertNode(N, IP);\n  return N;\n}\n\nbool Inst::isAssociative(Inst::Kind K) {\n  switch (K) {\n  case Add:\n  case Mul:\n  case And:\n  case Or:\n  case Xor:\n    return true;\n  default:\n    return false;\n  }\n}\n\nbool Inst::isCommutative(Inst::Kind K) {\n  switch (K) {\n  case Add:\n  case AddNSW:\n  case Mul:\n  case And:\n  case Or:\n  case Xor:\n  case Eq:\n  case Ne:\n    return true;\n  default:\n    return false;\n  }\n}\n\nvoid souper::PrintReplacement(llvm::raw_ostream &Out,\n                              const std::vector<InstMapping> &PCs,\n                              InstMapping Mapping) {\n  PrintContext Printer(Out);\n  for (const auto &PC : PCs) {\n    std::string SRef = Printer.printInst(PC.Source);\n    std::string RRef = Printer.printInst(PC.Replacement);\n    Out << \"pc \" << SRef << \" \" << RRef << '\\n';\n  }\n\n  std::string SRef = Printer.printInst(Mapping.Source);\n  std::string RRef = Printer.printInst(Mapping.Replacement);\n  Out << \"cand \" << SRef << \" \" << RRef << '\\n';\n}\n<commit_msg>Added instructions to isCommutative() function that were missed in UB patch<commit_after>\/\/ Copyright 2014 The Souper 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 \"souper\/Inst\/Inst.h\"\n\n#include \"llvm\/Support\/ErrorHandling.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\nusing namespace souper;\n\nbool Inst::operator<(const Inst &Other) const {\n  if (this == &Other)\n    return false;\n\n  if (K < Other.K)\n    return true;\n  if (K > Other.K)\n    return false;\n\n  if (Width < Other.Width)\n    return true;\n  if (Width > Other.Width)\n    return false;\n\n  switch (K) {\n  case Const:\n    return Val.ult(Other.Val);\n  case UntypedConst: {\n    llvm::APInt Val1 = Val, Val2 = Other.Val;\n    if (Val1.getBitWidth() < Val2.getBitWidth())\n      Val1 = Val1.sext(Val2.getBitWidth());\n    else if (Val1.getBitWidth() > Val2.getBitWidth())\n      Val2 = Val2.sext(Val1.getBitWidth());\n    return Val1.slt(Val2);\n  }\n  case Var:\n    return Number < Other.Number;\n  case Phi:\n    if (B->Number < Other.B->Number)\n      return true;\n    if (B->Number > Other.B->Number)\n      return false;\n  default:\n    break;\n  }\n\n  if (Ops.size() < Other.Ops.size())\n    return true;\n  if (Ops.size() > Other.Ops.size())\n    return false;\n\n  const std::vector<Inst *> &OpsA = orderedOps();\n  const std::vector<Inst *> &OpsB = Other.orderedOps();\n\n  for (unsigned I = 0; I != OpsA.size(); ++I) {\n    if (OpsA[I] == OpsB[I])\n      continue;\n    return (*OpsA[I] < *OpsB[I]);\n  }\n\n  llvm_unreachable(\"Should have found an unequal operand\");\n}\n\nconst std::vector<Inst *> &Inst::orderedOps() const {\n  if (!isCommutative(K))\n    return Ops;\n\n  if (OrderedOps.empty()) {\n    OrderedOps = Ops;\n    std::sort(OrderedOps.begin(), OrderedOps.end(), [](Inst *A, Inst *B) {\n      return *A < *B;\n    });\n  }\n  return OrderedOps;\n}\n\nstd::string PrintContext::printInst(Inst *I) {\n  std::string Str;\n  llvm::raw_string_ostream SS(Str);\n\n  auto PNI = PrintNums.find(static_cast<void *>(I));\n  if (PNI != PrintNums.end()) {\n    SS << \"%\" << PNI->second;\n    return SS.str();\n  }\n\n  std::string OpsStr;\n  llvm::raw_string_ostream OpsSS(OpsStr);\n\n  switch (I->K) {\n  default:\n    break;\n\n  case Inst::Const:\n    I->Val.print(SS, false);\n    SS << \":i\" << I->Val.getBitWidth();\n    return SS.str();\n\n  case Inst::UntypedConst:\n    I->Val.print(SS, false);\n    return SS.str();\n\n  case Inst::Phi:\n    unsigned BlockNum = printBlock(I->B);\n    OpsSS << \" %\" << BlockNum << \",\";\n    break;\n  }\n\n  const std::vector<Inst *> &Ops = I->orderedOps();\n  for (unsigned I = 0; I != Ops.size(); ++I) {\n    if (I == 0)\n      OpsSS << \" \";\n    else\n      OpsSS << \", \";\n    OpsSS << printInst(Ops[I]);\n  }\n\n  unsigned InstNum = PrintNums.size();\n  PrintNums[static_cast<void *>(I)] = InstNum;\n\n  Out << \"%\" << InstNum << \":i\" << I->Width << \" = \" << Inst::getKindName(I->K)\n      << OpsSS.str();\n\n  if (!I->Name.empty()) {\n    Out << \" ; \" << I->Name;\n  }\n\n  Out << '\\n';\n\n  SS << \"%\" << InstNum;\n  return SS.str();\n}\n\nunsigned PrintContext::printBlock(Block *B) {\n  std::string Str;\n  llvm::raw_string_ostream SS(Str);\n\n  auto PNI = PrintNums.find(static_cast<void *>(B));\n  if (PNI != PrintNums.end()) {\n    return PNI->second;\n  }\n\n  unsigned BlockNum = PrintNums.size();\n  PrintNums[static_cast<void *>(B)] = BlockNum;\n\n  Out << '%' << BlockNum << \" = block\\n\";\n  return BlockNum;\n}\n\nconst char *Inst::getKindName(Kind K) {\n  switch (K) {\n  case Const:\n    return \"const\";\n  case UntypedConst:\n    return \"untypedconst\";\n  case Var:\n    return \"var\";\n  case Phi:\n    return \"phi\";\n  case Add:\n    return \"add\";\n  case AddNSW:\n    return \"addnsw\";\n  case AddNUW:\n    return \"addnuw\";\n  case AddNW:\n    return \"addnw\";\n  case Sub:\n    return \"sub\";\n  case SubNSW:\n    return \"subnsw\";\n  case SubNUW:\n    return \"subnuw\";\n  case SubNW:\n    return \"subnw\";\n  case Mul:\n    return \"mul\";\n  case MulNSW:\n    return \"mulnsw\";\n  case MulNUW:\n    return \"mulnuw\";\n  case MulNW:\n    return \"mulnw\";\n  case UDiv:\n    return \"udiv\";\n  case SDiv:\n    return \"sdiv\";\n  case UDivExact:\n    return \"udivexact\";\n  case SDivExact:\n    return \"sdivexact\";\n  case URem:\n    return \"urem\";\n  case SRem:\n    return \"srem\";\n  case And:\n    return \"and\";\n  case Or:\n    return \"or\";\n  case Xor:\n    return \"xor\";\n  case Shl:\n    return \"shl\";\n  case ShlNSW:\n    return \"shlnsw\";\n  case ShlNUW:\n    return \"shlnuw\";\n  case ShlNW:\n    return \"shlnw\";\n  case LShr:\n    return \"lshr\";\n  case LShrExact:\n    return \"lshrexact\";\n  case AShr:\n    return \"ashr\";\n  case AShrExact:\n    return \"ashrexact\";\n  case Select:\n    return \"select\";\n  case ZExt:\n    return \"zext\";\n  case SExt:\n    return \"sext\";\n  case Trunc:\n    return \"trunc\";\n  case Eq:\n    return \"eq\";\n  case Ne:\n    return \"ne\";\n  case Ult:\n    return \"ult\";\n  case Slt:\n    return \"slt\";\n  case Ule:\n    return \"ule\";\n  case Sle:\n    return \"sle\";\n  }\n\n  llvm_unreachable(\"all cases covered\");\n}\n\nvoid Inst::Profile(llvm::FoldingSetNodeID &ID) const {\n  ID.AddInteger(K);\n  ID.AddInteger(Width);\n\n  switch (K) {\n  case Const:\n  case UntypedConst:\n    Val.Profile(ID);\n    return;\n  case Var:\n    assert(0 && \"Var instructions should not be in FoldingSet\");\n  case Phi:\n    ID.AddPointer(B);\n    break;\n  default:\n    break;\n  }\n\n  for (auto Op : Ops)\n    ID.AddPointer(Op);\n}\n\nInst *InstContext::getConst(const llvm::APInt &Val) {\n  llvm::FoldingSetNodeID ID;\n  ID.AddInteger(Inst::Const);\n  ID.AddInteger(Val.getBitWidth());\n  Val.Profile(ID);\n\n  void *IP = 0;\n  if (Inst *I = InstSet.FindNodeOrInsertPos(ID, IP))\n    return I;\n\n  auto N = new Inst;\n  Insts.emplace_back(N);\n  N->K = Inst::Const;\n  N->Width = Val.getBitWidth();\n  N->Val = Val;\n  InstSet.InsertNode(N, IP);\n  return N;\n}\n\nInst *InstContext::getUntypedConst(const llvm::APInt &Val) {\n  llvm::FoldingSetNodeID ID;\n  ID.AddInteger(Inst::UntypedConst);\n  ID.AddInteger(0);\n  Val.Profile(ID);\n\n  void *IP = 0;\n  if (Inst *I = InstSet.FindNodeOrInsertPos(ID, IP))\n    return I;\n\n  auto N = new Inst;\n  Insts.emplace_back(N);\n  N->K = Inst::UntypedConst;\n  N->Width = 0;\n  N->Val = Val;\n  InstSet.InsertNode(N, IP);\n  return N;\n}\n\nInst *InstContext::createVar(unsigned Width, llvm::StringRef Name) {\n  auto &InstList = VarInstsByWidth[Width];\n  unsigned Number = InstList.size();\n  auto I = new Inst;\n  InstList.emplace_back(I);\n\n  I->K = Inst::Var;\n  I->Number = Number;\n  I->Width = Width;\n  I->Name = Name;\n  return I;\n}\n\nBlock *InstContext::createBlock(unsigned Preds) {\n  auto &BlockList = BlocksByPreds[Preds];\n  unsigned Number = BlockList.size();\n  auto B = new Block;\n  BlockList.emplace_back(B);\n\n  B->Number = Number;\n  B->Preds = Preds;\n  return B;\n}\n\nInst *InstContext::getPhi(Block *B, const std::vector<Inst *> &Ops) {\n  llvm::FoldingSetNodeID ID;\n  ID.AddInteger(Inst::Phi);\n  ID.AddInteger(Ops[0]->Width);\n  ID.AddPointer(B);\n  for (auto O : Ops)\n    ID.AddPointer(O);\n\n  void *IP = 0;\n  if (Inst *I = InstSet.FindNodeOrInsertPos(ID, IP))\n    return I;\n\n  auto N = new Inst;\n  Insts.emplace_back(N);\n  N->K = Inst::Phi;\n  N->Width = Ops[0]->Width;\n  N->B = B;\n  N->Ops = Ops;\n  InstSet.InsertNode(N, IP);\n  return N;\n}\n\nInst *InstContext::getInst(Inst::Kind K, unsigned Width,\n                           const std::vector<Inst *> &Ops) {\n  std::vector<Inst *> OrderedOps;\n\n  const std::vector<Inst *> *InstOps;\n  if (Inst::isAssociative(K)) {\n    for (Inst *Op : Ops) {\n      if (Op->K == K)\n        OrderedOps.insert(OrderedOps.end(), Op->Ops.begin(), Op->Ops.end());\n      else\n        OrderedOps.push_back(Op);\n    }\n    std::sort(OrderedOps.begin(), OrderedOps.end());\n    InstOps = &OrderedOps;\n  } else if (Inst::isCommutative(K)) {\n    OrderedOps = Ops;\n    std::sort(OrderedOps.begin(), OrderedOps.end());\n    InstOps = &OrderedOps;\n  } else {\n    InstOps = &Ops;\n  }\n\n  llvm::FoldingSetNodeID ID;\n  ID.AddInteger(K);\n  ID.AddInteger(Width);\n  for (auto O : *InstOps)\n    ID.AddPointer(O);\n\n  void *IP = 0;\n  if (Inst *I = InstSet.FindNodeOrInsertPos(ID, IP))\n    return I;\n\n  auto N = new Inst;\n  Insts.emplace_back(N);\n  N->K = K;\n  N->Width = Width;\n  N->Ops = *InstOps;\n  InstSet.InsertNode(N, IP);\n  return N;\n}\n\nbool Inst::isAssociative(Inst::Kind K) {\n  switch (K) {\n  case Add:\n  case Mul:\n  case And:\n  case Or:\n  case Xor:\n    return true;\n  default:\n    return false;\n  }\n}\n\nbool Inst::isCommutative(Inst::Kind K) {\n  switch (K) {\n  case Add:\n  case AddNSW:\n  case AddNUW:\n  case AddNW:\n  case Mul:\n  case MulNSW:\n  case MulNUW:\n  case MulNW:\n  case And:\n  case Or:\n  case Xor:\n  case Eq:\n  case Ne:\n    return true;\n  default:\n    return false;\n  }\n}\n\nvoid souper::PrintReplacement(llvm::raw_ostream &Out,\n                              const std::vector<InstMapping> &PCs,\n                              InstMapping Mapping) {\n  PrintContext Printer(Out);\n  for (const auto &PC : PCs) {\n    std::string SRef = Printer.printInst(PC.Source);\n    std::string RRef = Printer.printInst(PC.Replacement);\n    Out << \"pc \" << SRef << \" \" << RRef << '\\n';\n  }\n\n  std::string SRef = Printer.printInst(Mapping.Source);\n  std::string RRef = Printer.printInst(Mapping.Replacement);\n  Out << \"cand \" << SRef << \" \" << RRef << '\\n';\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"async.h\"\n#include \"dbfe.h\"\n#include \"merkle_misc.h\"\n#include \"merkle_hash.h\"\n\nint\nmain (int argc, char *argv[])\n{\n  if (argc != 2)\n    fatal << \"Must specificy a db file.\\n\";\n  \n  int r;\n  DB *db;\n  DB_ENV* dbe;\n  char cpath[MAXPATHLEN];\n\n  r = db_env_create (&dbe, 0);\n  assert (!r);\n  r = chdir (argv[1]);\n  if (r == -1) fatal << \"couldn't chdir to \" << argv[1] << \"\\n\";\n\n  getcwd (cpath, MAXPATHLEN);\n  warn << \"opening db in: \" << cpath << \"\\n\";\n  r = dbe->set_data_dir (dbe, cpath);\n  assert (!r);\n  r = dbe->set_lg_dir (dbe, cpath);\n  assert (!r);\n  r = dbe->set_tmp_dir (dbe, cpath);\n  assert (!r);\n\n  r = dbe->open (dbe, NULL, \n\t\t DB_CREATE| DB_INIT_MPOOL | DB_INIT_LOCK | \n\t\t DB_INIT_LOG | DB_INIT_TXN | DB_RECOVER , 0);\n  assert (!r);\n  \n  r = db_create(&db, dbe, 0);\n  assert (r==0);\n\n  r = db->open(db, \"db\", NULL, DB_BTREE, 0, 0664);\n  assert (r == 0);\n\n  DBC *cursor;\n  r = db->cursor(db, NULL, &cursor, 0);\n  assert (r==0);\n\n  DBT key, data;\n  for (int i = 0; ; i++) {\n    bzero (&key, sizeof (key));\n    bzero (&data, sizeof (data));\n    \/\/data.flags = DB_DBT_PARTIAL;\n    int err = cursor->c_get(cursor, &key, &data, ((i==0) ? DB_FIRST : DB_NEXT));\n    if (err == DB_NOTFOUND) {\n      warn << \"EOF.\\n\";\n      break;\n    } else if (err) {\n      fatal << \"err: \" << err << \" \" << strerror (err) << \"\\n\";\n    }\n    warn << \"key[\" << i << \"] \" << hexdump (key.data, key.size) << \"\\n\";\n    ptr<dbrec> kr = New refcounted<dbrec> (key.data, key.size);\n\n    warn << \"key[\" << i << \"] \" << to_merkle_hash (kr) << \"\\n\";\n    \n    bzero (&data, sizeof (data));\n    err = db->get (db, NULL, &key, &data, 0);\n    if (err)\n      warn << \"lookup err: \" << err << \" \" << strerror (err) << \"\\n\";\n\n    err_flush ();\n  }\n}\n\n<commit_msg>count keys, bytes<commit_after>#include \"async.h\"\n#include \"dbfe.h\"\n#include \"merkle_misc.h\"\n#include \"merkle_hash.h\"\n\nint\nmain (int argc, char *argv[])\n{\n  if (argc != 2)\n    fatal << \"Must specificy a db file.\\n\";\n  \n  int r;\n  DB *db;\n  DB_ENV* dbe;\n  char cpath[MAXPATHLEN];\n\n  r = db_env_create (&dbe, 0);\n  assert (!r);\n  r = chdir (argv[1]);\n  if (r == -1) fatal << \"couldn't chdir to \" << argv[1] << \"\\n\";\n\n  getcwd (cpath, MAXPATHLEN);\n  warn << \"opening db in: \" << cpath << \"\\n\";\n  r = dbe->set_data_dir (dbe, cpath);\n  assert (!r);\n  r = dbe->set_lg_dir (dbe, cpath);\n  assert (!r);\n  r = dbe->set_tmp_dir (dbe, cpath);\n  assert (!r);\n\n  r = dbe->open (dbe, NULL, \n\t\t DB_CREATE| DB_INIT_MPOOL | DB_INIT_LOCK | \n\t\t DB_INIT_LOG | DB_INIT_TXN | DB_RECOVER , 0);\n  assert (!r);\n  \n  r = db_create(&db, dbe, 0);\n  assert (r==0);\n\n  r = db->open(db, \"db\", NULL, DB_BTREE, 0, 0664);\n  assert (r == 0);\n\n  DBC *cursor;\n  r = db->cursor(db, NULL, &cursor, 0);\n  assert (r==0);\n\n  DBT key, data;\n  unsigned totalsz = 0;\n  unsigned keys = 0;\n\n  for (int i = 0; ; i++) {\n    bzero (&key, sizeof (key));\n    bzero (&data, sizeof (data));\n    \/\/data.flags = DB_DBT_PARTIAL;\n    int err = cursor->c_get(cursor, &key, &data, ((i==0) ? DB_FIRST : DB_NEXT));\n    if (err == DB_NOTFOUND) {\n      warn << \"EOF.\\n\";\n      break;\n    } else if (err) {\n      fatal << \"err: \" << err << \" \" << strerror (err) << \"\\n\";\n    }\n    warn << \"key[\" << i << \"] \" << hexdump (key.data, key.size) << \"\\n\";\n    ptr<dbrec> kr = New refcounted<dbrec> (key.data, key.size);\n\n    warn << \"key[\" << i << \"] \" << to_merkle_hash (kr) << \"\\n\";\n\n    bzero (&data, sizeof (data));\n    err = db->get (db, NULL, &key, &data, 0);\n    if (err)\n      warn << \"lookup err: \" << err << \" \" << strerror (err) << \"\\n\";\n\n    keys++;\n    totalsz += data.size;\n    \n    err_flush ();\n  }\n\n  warn << \"total keys: \" << keys << \"\\n\";\n  warn << \"total bytes: \" << totalsz << \"\\n\";\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/**************************************************************************\r\n**\r\n** The MIT License (MIT)\r\n**\r\n** Copyright (c) 2016 Jean Gressmann\r\n**\r\n** Permission is hereby granted, free of charge, to any person obtaining a copy\r\n** of this software and associated documentation files (the \"Software\"), to deal\r\n** in the Software without restriction, including without limitation the rights\r\n** to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\r\n** copies of the Software, and to permit persons to whom the Software is\r\n** furnished to do so, subject to the following conditions:\r\n**\r\n** The above copyright notice and this permission notice shall be included in all\r\n** copies or substantial portions of the Software.\r\n**\r\n** THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n** IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n** FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\n** AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\n** LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\n** OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\r\n** SOFTWARE.\r\n**\r\n****************************************************************************\/\r\n\r\n#include \"devenvstep.h\"\r\n#include \"vsproject.h\"\r\n#include \"vsprojectconstants.h\"\r\n#include \"vsbuildconfiguration.h\"\r\n\r\n#include <projectexplorer\/buildsteplist.h>\r\n#include <projectexplorer\/target.h>\r\n#include <projectexplorer\/toolchain.h>\r\n#include <projectexplorer\/msvcparser.h>\r\n#include <projectexplorer\/kitinformation.h>\r\n#include <projectexplorer\/projectexplorer.h>\r\n#include <projectexplorer\/projectexplorerconstants.h>\r\n#include <qtsupport\/qtkitinformation.h>\r\n#include <qtsupport\/qtparser.h>\r\n#include <utils\/qtcprocess.h>\r\n\r\n#include <QVariantMap>\r\n#include <QLineEdit>\r\n#include <QFormLayout>\r\n\r\nusing namespace VsProjectManager;\r\nusing namespace VsProjectManager::Internal;\r\nusing namespace VsProjectManager::Constants;\r\nusing namespace ProjectExplorer;\r\nusing namespace ProjectExplorer::Constants;\r\n\r\nnamespace {\r\nconst char DEVENV_STEP_ID[] = \"VsProjectManager.DevenvStep\";\r\nconst char DEVENV_STEP_CLEAN_KEY[]  = \"VsProjectManager.DevenvStep.Clean\";\r\nconst char DEVENV_STEP_CONFIGURATION_KEY[] = \"VsProjectManager.DevenvStep.Configuration\";\r\n} \/\/ namespace\r\n\r\nDevenvStepFactory::DevenvStepFactory(QObject *parent) : IBuildStepFactory(parent)\r\n{ setObjectName(QLatin1String(\"VsProjectManager::DevenvStepFactory\")); }\r\n\r\nQList<Core::Id> DevenvStepFactory::availableCreationIds(BuildStepList *parent) const\r\n{\r\n    if (parent->target()->project()->id() == PROJECT_ID)\r\n        return QList<Core::Id>() << Core::Id(DEVENV_STEP_ID);\r\n    return QList<Core::Id>();\r\n}\r\n\r\nQString DevenvStepFactory::displayNameForId(Core::Id id) const\r\n{\r\n    if (id == DEVENV_STEP_ID)\r\n        return tr(\"Run\", \"Display name for VsProjectManager::DevenvStep id.\");\r\n    return QString();\r\n}\r\n\r\nbool DevenvStepFactory::canCreate(BuildStepList *parent, Core::Id id) const\r\n{\r\n    if (parent->target()->project()->id() == PROJECT_ID)\r\n        return id == DEVENV_STEP_ID;\r\n    return false;\r\n}\r\n\r\nBuildStep *DevenvStepFactory::create(BuildStepList *parent, Core::Id id)\r\n{\r\n    if (!canCreate(parent, id))\r\n        return nullptr;\r\n    return new DevenvStep(parent);\r\n}\r\n\r\nbool DevenvStepFactory::canClone(BuildStepList *parent, BuildStep *source) const\r\n{\r\n    return canCreate(parent, source->id());\r\n}\r\n\r\nBuildStep *DevenvStepFactory::clone(BuildStepList *parent, BuildStep *source)\r\n{\r\n    if (!canClone(parent, source))\r\n        return nullptr;\r\n    return new DevenvStep(parent, static_cast<DevenvStep *>(source));\r\n}\r\n\r\nbool DevenvStepFactory::canRestore(BuildStepList *parent, const QVariantMap &map) const\r\n{\r\n    return canCreate(parent, idFromMap(map));\r\n}\r\n\r\nBuildStep *DevenvStepFactory::restore(BuildStepList *parent, const QVariantMap &map)\r\n{\r\n    if (!canRestore(parent, map))\r\n        return 0;\r\n    DevenvStep *bs = new DevenvStep(parent);\r\n    if (bs->fromMap(map))\r\n        return bs;\r\n    delete bs;\r\n    return 0;\r\n}\r\n\r\n\r\nDevenvStep::DevenvStep(BuildStepList* bsl) : AbstractProcessStep(bsl, Core::Id(DEVENV_STEP_ID))\r\n{\r\n    ctor();\r\n}\r\n\r\nDevenvStep::DevenvStep(BuildStepList *bsl, Core::Id id) : AbstractProcessStep(bsl, id)\r\n{\r\n    ctor();\r\n}\r\n\r\nDevenvStep::DevenvStep(BuildStepList *bsl, DevenvStep *bs) : AbstractProcessStep(bsl, bs),\r\n    m_clean(bs->m_clean),\r\n    m_configuration(bs->m_configuration)\r\n{\r\n    ctor();\r\n}\r\n\r\nvoid DevenvStep::ctor()\r\n{\r\n    setDefaultDisplayName(tr(\"Run Visual Studio\"));\r\n}\r\n\r\nQVariantMap DevenvStep::toMap() const\r\n{\r\n    QVariantMap map = AbstractProcessStep::toMap();\r\n\r\n    map.insert(QLatin1String(DEVENV_STEP_CLEAN_KEY), m_clean);\r\n    map.insert(QLatin1String(DEVENV_STEP_CONFIGURATION_KEY), m_configuration);\r\n    return map;\r\n}\r\n\r\nbool DevenvStep::fromMap(const QVariantMap &map)\r\n{\r\n    m_clean = map.value(QLatin1String(DEVENV_STEP_CLEAN_KEY)).toBool();\r\n    m_configuration = map.value(QLatin1String(DEVENV_STEP_CONFIGURATION_KEY)).toString();\r\n\r\n    return BuildStep::fromMap(map);\r\n}\r\n\r\nvoid DevenvStep::setClean(bool clean)\r\n{\r\n    m_clean = clean;\r\n}\r\n\r\nvoid DevenvStep::setConfiguration(const QString& configuration)\r\n{\r\n    m_configuration = configuration;\r\n}\r\n\r\nbool DevenvStep::init(QList<const BuildStep *> &earlierSteps)\r\n{\r\n    BuildConfiguration *bc = buildConfiguration();\r\n    if (!bc)\r\n        bc = target()->activeBuildConfiguration();\r\n    if (!bc)\r\n        emit addTask(Task::buildConfigurationMissingTask());\r\n\r\n    if (!bc) {\r\n        emitFaultyConfigurationMessage();\r\n        return false;\r\n    }\r\n\r\n    auto project = static_cast<VsProject*>(bc->target()->project());\r\n    QString cmd;\r\n    QString args;\r\n    if (project) {\r\n        if (m_clean) {\r\n            project->vsProjectData()->cleanCmd(bc->displayName(), &cmd, &args);\r\n        } else {\r\n            project->vsProjectData()->buildCmd(bc->displayName(), &cmd, &args);\r\n        }\r\n    }\r\n\r\n    setIgnoreReturnValue(m_clean);\r\n\r\n    ProcessParameters *pp = processParameters();\r\n    pp->setMacroExpander(bc->macroExpander());\r\n    Utils::Environment env = bc->environment();\r\n\r\n\/\/    Utils::Environment::setupEnglishOutput(&env);\r\n\r\n    pp->setEnvironment(env);\r\n    pp->setWorkingDirectory(bc->buildDirectory().toString());\r\n    pp->setCommand(cmd);\r\n    pp->setArguments(args);\r\n    pp->resolveAll();\r\n\r\n    setOutputParser(new MsvcParser());\r\n    outputParser()->setWorkingDirectory(pp->effectiveWorkingDirectory());\r\n    return AbstractProcessStep::init(earlierSteps);\r\n}\r\n\r\n\r\nvoid DevenvStep::run(QFutureInterface<bool> &interface)\r\n{\r\n    AbstractProcessStep::run(interface);\r\n}\r\n\r\nProjectExplorer::BuildStepConfigWidget *DevenvStep::createConfigWidget()\r\n{\r\n    return new DevenvStepConfigWidget(this);\r\n}\r\n\r\nbool DevenvStep::immutable() const\r\n{\r\n    return false;\r\n}\r\n\r\n\r\nDevenvStepConfigWidget::DevenvStepConfigWidget(DevenvStep *DevenvStep) :\r\n    m_devenvStep(DevenvStep),\r\n    m_summaryText(),\r\n    m_additionalArguments(0)\r\n{\r\n    QFormLayout *fl = new QFormLayout(this);\r\n    fl->setMargin(0);\r\n    fl->setFieldGrowthPolicy(QFormLayout::ExpandingFieldsGrow);\r\n    setLayout(fl);\r\n\r\n    updateDetails();\r\n\r\n    connect(m_devenvStep->project(), &Project::environmentChanged,\r\n            this, &DevenvStepConfigWidget::updateDetails);\r\n}\r\n\r\nQString DevenvStepConfigWidget::displayName() const\r\n{\r\n    return tr(\"Run\", \"VSProjectManager::DevenvStepConfigWidget display name.\");\r\n}\r\n\r\nQString DevenvStepConfigWidget::summaryText() const\r\n{\r\n    return m_summaryText;\r\n}\r\n\r\nvoid DevenvStepConfigWidget::updateDetails()\r\n{\r\n    BuildConfiguration *bc = m_devenvStep->buildConfiguration();\r\n    if (!bc)\r\n        bc = m_devenvStep->target()->activeBuildConfiguration();\r\n\r\n    if (bc) {\r\n        QString args;\r\n        QString cmd;\r\n        auto project = static_cast<VsProject*>(bc->target()->project());\r\n        if (project) {\r\n            if (m_devenvStep->m_clean) {\r\n                project->vsProjectData()->cleanCmd(bc->displayName(), &cmd, &args);\r\n            } else {\r\n                project->vsProjectData()->buildCmd(bc->displayName(), &cmd, &args);\r\n            }\r\n        }\r\n\r\n        ProcessParameters param;\r\n        param.setMacroExpander(bc->macroExpander());\r\n        param.setEnvironment(bc->environment());\r\n        param.setWorkingDirectory(bc->buildDirectory().toString());\r\n        param.setCommand(cmd);\r\n        param.setArguments(args);\r\n        m_summaryText = param.summary(displayName());\r\n    } else {\r\n        m_summaryText = QLatin1String(\"<b>\") + ProjectExplorer::ToolChainKitInformation::msgNoToolChainInTarget()  + QLatin1String(\"<\/b>\");\r\n    }\r\n\r\n    emit updateSummary();\r\n}\r\n<commit_msg>Fixes crash in build configuration ui when the project file is being modified from VS<commit_after>\/**************************************************************************\r\n**\r\n** The MIT License (MIT)\r\n**\r\n** Copyright (c) 2016 Jean Gressmann\r\n**\r\n** Permission is hereby granted, free of charge, to any person obtaining a copy\r\n** of this software and associated documentation files (the \"Software\"), to deal\r\n** in the Software without restriction, including without limitation the rights\r\n** to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\r\n** copies of the Software, and to permit persons to whom the Software is\r\n** furnished to do so, subject to the following conditions:\r\n**\r\n** The above copyright notice and this permission notice shall be included in all\r\n** copies or substantial portions of the Software.\r\n**\r\n** THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n** IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n** FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\n** AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\n** LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\n** OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\r\n** SOFTWARE.\r\n**\r\n****************************************************************************\/\r\n\r\n#include \"devenvstep.h\"\r\n#include \"vsproject.h\"\r\n#include \"vsprojectconstants.h\"\r\n#include \"vsbuildconfiguration.h\"\r\n\r\n#include <projectexplorer\/buildsteplist.h>\r\n#include <projectexplorer\/target.h>\r\n#include <projectexplorer\/toolchain.h>\r\n#include <projectexplorer\/msvcparser.h>\r\n#include <projectexplorer\/kitinformation.h>\r\n#include <projectexplorer\/projectexplorer.h>\r\n#include <projectexplorer\/projectexplorerconstants.h>\r\n#include <qtsupport\/qtkitinformation.h>\r\n#include <qtsupport\/qtparser.h>\r\n#include <utils\/qtcprocess.h>\r\n\r\n#include <QVariantMap>\r\n#include <QLineEdit>\r\n#include <QFormLayout>\r\n\r\nusing namespace VsProjectManager;\r\nusing namespace VsProjectManager::Internal;\r\nusing namespace VsProjectManager::Constants;\r\nusing namespace ProjectExplorer;\r\nusing namespace ProjectExplorer::Constants;\r\n\r\nnamespace {\r\nconst char DEVENV_STEP_ID[] = \"VsProjectManager.DevenvStep\";\r\nconst char DEVENV_STEP_CLEAN_KEY[]  = \"VsProjectManager.DevenvStep.Clean\";\r\nconst char DEVENV_STEP_CONFIGURATION_KEY[] = \"VsProjectManager.DevenvStep.Configuration\";\r\n} \/\/ namespace\r\n\r\nDevenvStepFactory::DevenvStepFactory(QObject *parent) : IBuildStepFactory(parent)\r\n{ setObjectName(QLatin1String(\"VsProjectManager::DevenvStepFactory\")); }\r\n\r\nQList<Core::Id> DevenvStepFactory::availableCreationIds(BuildStepList *parent) const\r\n{\r\n    if (parent->target()->project()->id() == PROJECT_ID)\r\n        return QList<Core::Id>() << Core::Id(DEVENV_STEP_ID);\r\n    return QList<Core::Id>();\r\n}\r\n\r\nQString DevenvStepFactory::displayNameForId(Core::Id id) const\r\n{\r\n    if (id == DEVENV_STEP_ID)\r\n        return tr(\"Run\", \"Display name for VsProjectManager::DevenvStep id.\");\r\n    return QString();\r\n}\r\n\r\nbool DevenvStepFactory::canCreate(BuildStepList *parent, Core::Id id) const\r\n{\r\n    if (parent->target()->project()->id() == PROJECT_ID)\r\n        return id == DEVENV_STEP_ID;\r\n    return false;\r\n}\r\n\r\nBuildStep *DevenvStepFactory::create(BuildStepList *parent, Core::Id id)\r\n{\r\n    if (!canCreate(parent, id))\r\n        return nullptr;\r\n    return new DevenvStep(parent);\r\n}\r\n\r\nbool DevenvStepFactory::canClone(BuildStepList *parent, BuildStep *source) const\r\n{\r\n    return canCreate(parent, source->id());\r\n}\r\n\r\nBuildStep *DevenvStepFactory::clone(BuildStepList *parent, BuildStep *source)\r\n{\r\n    if (!canClone(parent, source))\r\n        return nullptr;\r\n    return new DevenvStep(parent, static_cast<DevenvStep *>(source));\r\n}\r\n\r\nbool DevenvStepFactory::canRestore(BuildStepList *parent, const QVariantMap &map) const\r\n{\r\n    return canCreate(parent, idFromMap(map));\r\n}\r\n\r\nBuildStep *DevenvStepFactory::restore(BuildStepList *parent, const QVariantMap &map)\r\n{\r\n    if (!canRestore(parent, map))\r\n        return 0;\r\n    DevenvStep *bs = new DevenvStep(parent);\r\n    if (bs->fromMap(map))\r\n        return bs;\r\n    delete bs;\r\n    return 0;\r\n}\r\n\r\n\r\nDevenvStep::DevenvStep(BuildStepList* bsl) : AbstractProcessStep(bsl, Core::Id(DEVENV_STEP_ID))\r\n{\r\n    ctor();\r\n}\r\n\r\nDevenvStep::DevenvStep(BuildStepList *bsl, Core::Id id) : AbstractProcessStep(bsl, id)\r\n{\r\n    ctor();\r\n}\r\n\r\nDevenvStep::DevenvStep(BuildStepList *bsl, DevenvStep *bs) : AbstractProcessStep(bsl, bs),\r\n    m_clean(bs->m_clean),\r\n    m_configuration(bs->m_configuration)\r\n{\r\n    ctor();\r\n}\r\n\r\nvoid DevenvStep::ctor()\r\n{\r\n    setDefaultDisplayName(tr(\"Run Visual Studio\"));\r\n}\r\n\r\nQVariantMap DevenvStep::toMap() const\r\n{\r\n    QVariantMap map = AbstractProcessStep::toMap();\r\n\r\n    map.insert(QLatin1String(DEVENV_STEP_CLEAN_KEY), m_clean);\r\n    map.insert(QLatin1String(DEVENV_STEP_CONFIGURATION_KEY), m_configuration);\r\n    return map;\r\n}\r\n\r\nbool DevenvStep::fromMap(const QVariantMap &map)\r\n{\r\n    m_clean = map.value(QLatin1String(DEVENV_STEP_CLEAN_KEY)).toBool();\r\n    m_configuration = map.value(QLatin1String(DEVENV_STEP_CONFIGURATION_KEY)).toString();\r\n\r\n    return BuildStep::fromMap(map);\r\n}\r\n\r\nvoid DevenvStep::setClean(bool clean)\r\n{\r\n    m_clean = clean;\r\n}\r\n\r\nvoid DevenvStep::setConfiguration(const QString& configuration)\r\n{\r\n    m_configuration = configuration;\r\n}\r\n\r\nbool DevenvStep::init(QList<const BuildStep *> &earlierSteps)\r\n{\r\n    BuildConfiguration *bc = buildConfiguration();\r\n    if (!bc)\r\n        bc = target()->activeBuildConfiguration();\r\n    if (!bc)\r\n        emit addTask(Task::buildConfigurationMissingTask());\r\n\r\n    if (!bc) {\r\n        emitFaultyConfigurationMessage();\r\n        return false;\r\n    }\r\n\r\n    auto project = static_cast<VsProject*>(bc->target()->project());\r\n    QString cmd;\r\n    QString args;\r\n\tif (project && project->vsProjectData()) {\r\n        if (m_clean) {\r\n            project->vsProjectData()->cleanCmd(bc->displayName(), &cmd, &args);\r\n        } else {\r\n            project->vsProjectData()->buildCmd(bc->displayName(), &cmd, &args);\r\n        }\r\n    }\r\n\r\n    setIgnoreReturnValue(m_clean);\r\n\r\n    ProcessParameters *pp = processParameters();\r\n    pp->setMacroExpander(bc->macroExpander());\r\n    Utils::Environment env = bc->environment();\r\n\r\n\/\/    Utils::Environment::setupEnglishOutput(&env);\r\n\r\n    pp->setEnvironment(env);\r\n    pp->setWorkingDirectory(bc->buildDirectory().toString());\r\n    pp->setCommand(cmd);\r\n    pp->setArguments(args);\r\n    pp->resolveAll();\r\n\r\n    setOutputParser(new MsvcParser());\r\n    outputParser()->setWorkingDirectory(pp->effectiveWorkingDirectory());\r\n    return AbstractProcessStep::init(earlierSteps);\r\n}\r\n\r\n\r\nvoid DevenvStep::run(QFutureInterface<bool> &interface)\r\n{\r\n    AbstractProcessStep::run(interface);\r\n}\r\n\r\nProjectExplorer::BuildStepConfigWidget *DevenvStep::createConfigWidget()\r\n{\r\n    return new DevenvStepConfigWidget(this);\r\n}\r\n\r\nbool DevenvStep::immutable() const\r\n{\r\n    return false;\r\n}\r\n\r\n\r\nDevenvStepConfigWidget::DevenvStepConfigWidget(DevenvStep *DevenvStep) :\r\n    m_devenvStep(DevenvStep),\r\n    m_summaryText(),\r\n    m_additionalArguments(0)\r\n{\r\n    QFormLayout *fl = new QFormLayout(this);\r\n    fl->setMargin(0);\r\n    fl->setFieldGrowthPolicy(QFormLayout::ExpandingFieldsGrow);\r\n    setLayout(fl);\r\n\r\n    updateDetails();\r\n\r\n    connect(m_devenvStep->project(), &Project::environmentChanged,\r\n            this, &DevenvStepConfigWidget::updateDetails);\r\n}\r\n\r\nQString DevenvStepConfigWidget::displayName() const\r\n{\r\n    return tr(\"Run\", \"VSProjectManager::DevenvStepConfigWidget display name.\");\r\n}\r\n\r\nQString DevenvStepConfigWidget::summaryText() const\r\n{\r\n    return m_summaryText;\r\n}\r\n\r\nvoid DevenvStepConfigWidget::updateDetails()\r\n{\r\n    BuildConfiguration *bc = m_devenvStep->buildConfiguration();\r\n    if (!bc)\r\n        bc = m_devenvStep->target()->activeBuildConfiguration();\r\n\r\n    if (bc) {\r\n        QString args;\r\n        QString cmd;\r\n        auto project = static_cast<VsProject*>(bc->target()->project());\r\n        if (project) {\r\n            if (m_devenvStep->m_clean) {\r\n                project->vsProjectData()->cleanCmd(bc->displayName(), &cmd, &args);\r\n            } else {\r\n                project->vsProjectData()->buildCmd(bc->displayName(), &cmd, &args);\r\n            }\r\n        }\r\n\r\n        ProcessParameters param;\r\n        param.setMacroExpander(bc->macroExpander());\r\n        param.setEnvironment(bc->environment());\r\n        param.setWorkingDirectory(bc->buildDirectory().toString());\r\n        param.setCommand(cmd);\r\n        param.setArguments(args);\r\n        m_summaryText = param.summary(displayName());\r\n    } else {\r\n        m_summaryText = QLatin1String(\"<b>\") + ProjectExplorer::ToolChainKitInformation::msgNoToolChainInTarget()  + QLatin1String(\"<\/b>\");\r\n    }\r\n\r\n    emit updateSummary();\r\n}\r\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 \"multiplication_process.h\"\n\n#include <vistk\/pipeline_types\/port_types.h>\n\n#include <vistk\/pipeline\/config.h>\n#include <vistk\/pipeline\/datum.h>\n#include <vistk\/pipeline\/process_exception.h>\n\n#include <algorithm>\n\nnamespace vistk\n{\n\nclass multiplication_process::priv\n{\n  public:\n    typedef uint32_t number_t;\n\n    priv();\n    ~priv();\n\n    edge_ref_t input_edge_factor1;\n    edge_ref_t input_edge_factor2;\n\n    edge_group_t output_edges;\n\n    port_info_t factor1_port_info;\n    port_info_t factor2_port_info;\n    port_info_t output_port_info;\n\n    static port_t const INPUT_FACTOR1_PORT_NAME;\n    static port_t const INPUT_FACTOR2_PORT_NAME;\n    static port_t const OUTPUT_PORT_NAME;\n};\n\nprocess::port_t const multiplication_process::priv::INPUT_FACTOR1_PORT_NAME = process::port_t(\"factor1\");\nprocess::port_t const multiplication_process::priv::INPUT_FACTOR2_PORT_NAME = process::port_t(\"factor2\");\nprocess::port_t const multiplication_process::priv::OUTPUT_PORT_NAME = process::port_t(\"product\");\n\nmultiplication_process\n::multiplication_process(config_t const& config)\n  : process(config)\n{\n  d = boost::shared_ptr<priv>(new priv);\n}\n\nmultiplication_process\n::~multiplication_process()\n{\n}\n\nvoid\nmultiplication_process\n::_step()\n{\n  datum_t dat;\n  stamp_t st;\n\n  edge_datum_t const factor1_dat = grab_from_edge_ref(d->input_edge_factor1);\n  edge_datum_t const factor2_dat = grab_from_edge_ref(d->input_edge_factor2);\n\n  edge_data_t input_dats;\n\n  input_dats.push_back(factor1_dat);\n  input_dats.push_back(factor2_dat);\n\n  st = factor1_dat.get<1>();\n\n  datum::datum_type_t const max_type = max_status(input_dats);\n\n  switch (max_type)\n  {\n    case datum::DATUM_DATA:\n      if (!same_colored_data(input_dats))\n      {\n        st = heartbeat_stamp();\n\n        dat = datum::error_datum(\"The input edges are not colored the same.\");\n      }\n      else if (!syncd_data(input_dats))\n      {\n        st = heartbeat_stamp();\n\n        dat = datum::error_datum(\"The input edges are not synchronized.\");\n      }\n      else\n      {\n        priv::number_t const factor1 = factor1_dat.get<0>()->get_datum<priv::number_t>();\n        priv::number_t const factor2 = factor2_dat.get<0>()->get_datum<priv::number_t>();\n\n        priv::number_t const product = factor1 * factor2;\n\n        dat = datum::new_datum(product);\n      }\n      break;\n    case datum::DATUM_EMPTY:\n      dat = datum::empty_datum();\n      break;\n    case datum::DATUM_COMPLETE:\n      mark_as_complete();\n      dat = datum::complete_datum();\n      break;\n    case datum::DATUM_ERROR:\n      dat = datum::error_datum(\"Error on the input edges.\");\n      break;\n    case datum::DATUM_INVALID:\n    default:\n      dat = datum::error_datum(\"Unrecognized datum type.\");\n      break;\n  }\n\n  edge_datum_t const edat = edge_datum_t(dat, st);\n\n  push_to_edges(d->output_edges, edat);\n\n  process::_step();\n}\n\nvoid\nmultiplication_process\n::_connect_input_port(port_t const& port, edge_ref_t edge)\n{\n  if (port == priv::INPUT_FACTOR1_PORT_NAME)\n  {\n    if (d->input_edge_factor1.use_count())\n    {\n      throw port_reconnect_exception(name(), port);\n    }\n\n    d->input_edge_factor1 = edge;\n\n    return;\n  }\n  if (port == priv::INPUT_FACTOR2_PORT_NAME)\n  {\n    if (d->input_edge_factor2.use_count())\n    {\n      throw port_reconnect_exception(name(), port);\n    }\n\n    d->input_edge_factor2 = edge;\n\n    return;\n  }\n\n  process::_connect_input_port(port, edge);\n}\n\nprocess::port_info_t\nmultiplication_process\n::_input_port_info(port_t const& port) const\n{\n  if (port == priv::INPUT_FACTOR1_PORT_NAME)\n  {\n    return d->factor1_port_info;\n  }\n  if (port == priv::INPUT_FACTOR2_PORT_NAME)\n  {\n    return d->factor2_port_info;\n  }\n\n  return process::_input_port_info(port);\n}\n\nvoid\nmultiplication_process\n::_connect_output_port(port_t const& port, edge_ref_t edge)\n{\n  if (port == priv::OUTPUT_PORT_NAME)\n  {\n    d->output_edges.push_back(edge);\n\n    return;\n  }\n\n  process::_connect_output_port(port, edge);\n}\n\nprocess::port_info_t\nmultiplication_process\n::_output_port_info(port_t const& port) const\n{\n  if (port == priv::OUTPUT_PORT_NAME)\n  {\n    return d->output_port_info;\n  }\n\n  return process::_output_port_info(port);\n}\n\nprocess::ports_t\nmultiplication_process\n::_input_ports() const\n{\n  ports_t ports;\n\n  ports.push_back(priv::INPUT_FACTOR1_PORT_NAME);\n  ports.push_back(priv::INPUT_FACTOR2_PORT_NAME);\n\n  return ports;\n}\n\nprocess::ports_t\nmultiplication_process\n::_output_ports() const\n{\n  ports_t ports;\n\n  ports.push_back(priv::OUTPUT_PORT_NAME);\n\n  return ports;\n}\n\nmultiplication_process::priv\n::priv()\n{\n  port_flags_t required;\n\n  required.insert(flag_required);\n\n  factor1_port_info = port_info_t(new port_info(\n    port_types::t_integer,\n    required,\n    port_description_t(\"The first factor to multiply.\")));\n  factor2_port_info = port_info_t(new port_info(\n    port_types::t_integer,\n    required,\n    port_description_t(\"The second factor to multiply.\")));\n  output_port_info = port_info_t(new port_info(\n    port_types::t_integer,\n    required,\n    port_description_t(\"Where the product will be available.\")));\n}\n\nmultiplication_process::priv\n::~priv()\n{\n}\n\n}\n<commit_msg>Use new consolidated API<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 \"multiplication_process.h\"\n\n#include <vistk\/pipeline_types\/port_types.h>\n\n#include <vistk\/pipeline\/config.h>\n#include <vistk\/pipeline\/datum.h>\n#include <vistk\/pipeline\/process_exception.h>\n\n#include <algorithm>\n\nnamespace vistk\n{\n\nclass multiplication_process::priv\n{\n  public:\n    typedef uint32_t number_t;\n\n    priv();\n    ~priv();\n\n    edge_ref_t input_edge_factor1;\n    edge_ref_t input_edge_factor2;\n\n    edge_group_t output_edges;\n\n    port_info_t factor1_port_info;\n    port_info_t factor2_port_info;\n    port_info_t output_port_info;\n\n    static port_t const INPUT_FACTOR1_PORT_NAME;\n    static port_t const INPUT_FACTOR2_PORT_NAME;\n    static port_t const OUTPUT_PORT_NAME;\n};\n\nprocess::port_t const multiplication_process::priv::INPUT_FACTOR1_PORT_NAME = process::port_t(\"factor1\");\nprocess::port_t const multiplication_process::priv::INPUT_FACTOR2_PORT_NAME = process::port_t(\"factor2\");\nprocess::port_t const multiplication_process::priv::OUTPUT_PORT_NAME = process::port_t(\"product\");\n\nmultiplication_process\n::multiplication_process(config_t const& config)\n  : process(config)\n{\n  d = boost::shared_ptr<priv>(new priv);\n}\n\nmultiplication_process\n::~multiplication_process()\n{\n}\n\nvoid\nmultiplication_process\n::_step()\n{\n  datum_t dat;\n  stamp_t st;\n\n  edge_datum_t const factor1_dat = grab_from_edge_ref(d->input_edge_factor1);\n  edge_datum_t const factor2_dat = grab_from_edge_ref(d->input_edge_factor2);\n\n  edge_data_t input_dats;\n\n  input_dats.push_back(factor1_dat);\n  input_dats.push_back(factor2_dat);\n\n  st = factor1_dat.get<1>();\n\n  data_info_t const info = data_info(input_dats);\n\n  switch (info.max_status)\n  {\n    case datum::DATUM_DATA:\n      if (!info.same_color)\n      {\n        st = heartbeat_stamp();\n\n        dat = datum::error_datum(\"The input edges are not colored the same.\");\n      }\n      else if (!info.in_sync)\n      {\n        st = heartbeat_stamp();\n\n        dat = datum::error_datum(\"The input edges are not synchronized.\");\n      }\n      else\n      {\n        priv::number_t const factor1 = factor1_dat.get<0>()->get_datum<priv::number_t>();\n        priv::number_t const factor2 = factor2_dat.get<0>()->get_datum<priv::number_t>();\n\n        priv::number_t const product = factor1 * factor2;\n\n        dat = datum::new_datum(product);\n      }\n      break;\n    case datum::DATUM_EMPTY:\n      dat = datum::empty_datum();\n      break;\n    case datum::DATUM_COMPLETE:\n      mark_as_complete();\n      dat = datum::complete_datum();\n      break;\n    case datum::DATUM_ERROR:\n      dat = datum::error_datum(\"Error on the input edges.\");\n      break;\n    case datum::DATUM_INVALID:\n    default:\n      dat = datum::error_datum(\"Unrecognized datum type.\");\n      break;\n  }\n\n  edge_datum_t const edat = edge_datum_t(dat, st);\n\n  push_to_edges(d->output_edges, edat);\n\n  process::_step();\n}\n\nvoid\nmultiplication_process\n::_connect_input_port(port_t const& port, edge_ref_t edge)\n{\n  if (port == priv::INPUT_FACTOR1_PORT_NAME)\n  {\n    if (d->input_edge_factor1.use_count())\n    {\n      throw port_reconnect_exception(name(), port);\n    }\n\n    d->input_edge_factor1 = edge;\n\n    return;\n  }\n  if (port == priv::INPUT_FACTOR2_PORT_NAME)\n  {\n    if (d->input_edge_factor2.use_count())\n    {\n      throw port_reconnect_exception(name(), port);\n    }\n\n    d->input_edge_factor2 = edge;\n\n    return;\n  }\n\n  process::_connect_input_port(port, edge);\n}\n\nprocess::port_info_t\nmultiplication_process\n::_input_port_info(port_t const& port) const\n{\n  if (port == priv::INPUT_FACTOR1_PORT_NAME)\n  {\n    return d->factor1_port_info;\n  }\n  if (port == priv::INPUT_FACTOR2_PORT_NAME)\n  {\n    return d->factor2_port_info;\n  }\n\n  return process::_input_port_info(port);\n}\n\nvoid\nmultiplication_process\n::_connect_output_port(port_t const& port, edge_ref_t edge)\n{\n  if (port == priv::OUTPUT_PORT_NAME)\n  {\n    d->output_edges.push_back(edge);\n\n    return;\n  }\n\n  process::_connect_output_port(port, edge);\n}\n\nprocess::port_info_t\nmultiplication_process\n::_output_port_info(port_t const& port) const\n{\n  if (port == priv::OUTPUT_PORT_NAME)\n  {\n    return d->output_port_info;\n  }\n\n  return process::_output_port_info(port);\n}\n\nprocess::ports_t\nmultiplication_process\n::_input_ports() const\n{\n  ports_t ports;\n\n  ports.push_back(priv::INPUT_FACTOR1_PORT_NAME);\n  ports.push_back(priv::INPUT_FACTOR2_PORT_NAME);\n\n  return ports;\n}\n\nprocess::ports_t\nmultiplication_process\n::_output_ports() const\n{\n  ports_t ports;\n\n  ports.push_back(priv::OUTPUT_PORT_NAME);\n\n  return ports;\n}\n\nmultiplication_process::priv\n::priv()\n{\n  port_flags_t required;\n\n  required.insert(flag_required);\n\n  factor1_port_info = port_info_t(new port_info(\n    port_types::t_integer,\n    required,\n    port_description_t(\"The first factor to multiply.\")));\n  factor2_port_info = port_info_t(new port_info(\n    port_types::t_integer,\n    required,\n    port_description_t(\"The second factor to multiply.\")));\n  output_port_info = port_info_t(new port_info(\n    port_types::t_integer,\n    required,\n    port_description_t(\"Where the product will be available.\")));\n}\n\nmultiplication_process::priv\n::~priv()\n{\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===--- Sema.cpp - AST Builder and Semantic Analysis Implementation ------===\/\/\n\/\/\n\/\/                     The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file implements the actions class which performs semantic analysis and\n\/\/ builds an AST out of a parse stream.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"Sema.h\"\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/Lex\/Preprocessor.h\"\n#include \"clang\/Basic\/Diagnostic.h\"\n#include \"clang\/Parse\/Scope.h\"\n\nusing namespace clang;\n\nbool Sema::isBuiltinObjCType(TypedefDecl *TD) {\n  const char *typeName = TD->getIdentifier()->getName();\n  return strcmp(typeName, \"id\") == 0 || strcmp(typeName, \"Class\") == 0 ||\n         strcmp(typeName, \"SEL\") == 0 || strcmp(typeName, \"Protocol\") == 0;\n}\n\nbool Sema::isObjCObjectPointerType(QualType type) const {\n  if (!type->isPointerType() && !type->isObjCQualifiedIdType())\n    return false;\n  if (type == Context.getObjCIdType() || type == Context.getObjCClassType() ||\n      type->isObjCQualifiedIdType())\n    return true;\n  \n  if (type->isPointerType()) {\n    PointerType *pointerType = static_cast<PointerType*>(type.getTypePtr());\n    type = pointerType->getPointeeType();\n  }\n  return (type->isObjCInterfaceType() || type->isObjCQualifiedIdType());\n}\n\nvoid Sema::ActOnTranslationUnitScope(SourceLocation Loc, Scope *S) {\n  TUScope = S;\n  CurContext = Context.getTranslationUnitDecl();\n  if (!PP.getLangOptions().ObjC1) return;\n  \n  \/\/ Synthesize \"typedef struct objc_selector *SEL;\"\n  RecordDecl *SelTag = RecordDecl::Create(Context, TagDecl::TK_struct, CurContext,\n                                          SourceLocation(), \n                                          &Context.Idents.get(\"objc_selector\"),\n                                          0);\n  PushOnScopeChains(SelTag, TUScope);\n  \n  QualType SelT = Context.getPointerType(Context.getTagDeclType(SelTag));\n  TypedefDecl *SelTypedef = TypedefDecl::Create(Context, CurContext,\n                                                SourceLocation(),\n                                                &Context.Idents.get(\"SEL\"),\n                                                SelT, 0);\n  PushOnScopeChains(SelTypedef, TUScope);\n  Context.setObjCSelType(SelTypedef);\n\n  RecordDecl *ClassTag = RecordDecl::Create(Context, TagDecl::TK_struct,\n                                            CurContext,\n                                            SourceLocation(),\n                                            &Context.Idents.get(\"objc_class\"),\n                                            0);\n  QualType ClassT = Context.getPointerType(Context.getTagDeclType(ClassTag));\n  TypedefDecl *ClassTypedef = \n    TypedefDecl::Create(Context, CurContext, SourceLocation(),\n                        &Context.Idents.get(\"Class\"), ClassT, 0);\n  PushOnScopeChains(ClassTag, TUScope);\n  PushOnScopeChains(ClassTypedef, TUScope);\n  Context.setObjCClassType(ClassTypedef);\n  \/\/ Synthesize \"@class Protocol;\n  ObjCInterfaceDecl *ProtocolDecl =\n    ObjCInterfaceDecl::Create(Context, SourceLocation(), 0, \n                              &Context.Idents.get(\"Protocol\"), \n                              SourceLocation(), true);\n  Context.setObjCProtoType(Context.getObjCInterfaceType(ProtocolDecl));\n  PushOnScopeChains(ProtocolDecl, TUScope);\n  \n  \/\/ Synthesize \"typedef struct objc_object { Class isa; } *id;\"\n  RecordDecl *ObjectTag = \n    RecordDecl::Create(Context, TagDecl::TK_struct, CurContext,\n                       SourceLocation(),\n                       &Context.Idents.get(\"objc_object\"), 0);\n  QualType ObjT = Context.getPointerType(Context.getTagDeclType(ObjectTag));\n  PushOnScopeChains(ObjectTag, TUScope);\n  TypedefDecl *IdTypedef = TypedefDecl::Create(Context, CurContext,\n                                               SourceLocation(),\n                                               &Context.Idents.get(\"id\"),\n                                               ObjT, 0);\n  PushOnScopeChains(IdTypedef, TUScope);\n  Context.setObjCIdType(IdTypedef);\n}\n\nSema::Sema(Preprocessor &pp, ASTContext &ctxt, ASTConsumer &consumer)\n  : PP(pp), Context(ctxt), Consumer(consumer), \n    CurFunctionDecl(0), CurMethodDecl(0), CurContext(0) {\n  \n  \/\/ Get IdentifierInfo objects for known functions for which we\n  \/\/ do extra checking.  \n  IdentifierTable &IT = PP.getIdentifierTable();  \n\n  KnownFunctionIDs[id_printf]    = &IT.get(\"printf\");\n  KnownFunctionIDs[id_fprintf]   = &IT.get(\"fprintf\");\n  KnownFunctionIDs[id_sprintf]   = &IT.get(\"sprintf\");\n  KnownFunctionIDs[id_snprintf]  = &IT.get(\"snprintf\");\n  KnownFunctionIDs[id_asprintf]  = &IT.get(\"asprintf\");\n  KnownFunctionIDs[id_NSLog]     = &IT.get(\"NSLog\");\n  KnownFunctionIDs[id_vsnprintf] = &IT.get(\"vsnprintf\");\n  KnownFunctionIDs[id_vasprintf] = &IT.get(\"vasprintf\");\n  KnownFunctionIDs[id_vfprintf]  = &IT.get(\"vfprintf\");\n  KnownFunctionIDs[id_vsprintf]  = &IT.get(\"vsprintf\");\n  KnownFunctionIDs[id_vprintf]   = &IT.get(\"vprintf\");\n\n  TUScope = 0;\n}\n\n\/\/\/ ImpCastExprToType - If Expr is not of type 'Type', insert an implicit cast. \n\/\/\/ If there is already an implicit cast, merge into the existing one.\nvoid Sema::ImpCastExprToType(Expr *&Expr, QualType Type) {\n  if (Expr->getType().getCanonicalType() == Type.getCanonicalType()) return;\n  \n  if (ImplicitCastExpr *ImpCast = dyn_cast<ImplicitCastExpr>(Expr))\n    ImpCast->setType(Type);\n  else \n    Expr = new ImplicitCastExpr(Type, Expr);\n}\n\n\n\nvoid Sema::DeleteExpr(ExprTy *E) {\n  delete static_cast<Expr*>(E);\n}\nvoid Sema::DeleteStmt(StmtTy *S) {\n  delete static_cast<Stmt*>(S);\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Helper functions.\n\/\/===----------------------------------------------------------------------===\/\/\n\nbool Sema::Diag(SourceLocation Loc, unsigned DiagID) {\n  PP.getDiagnostics().Report(PP.getFullLoc(Loc), DiagID);\n  return true;\n}\n\nbool Sema::Diag(SourceLocation Loc, unsigned DiagID, const std::string &Msg) {\n  PP.getDiagnostics().Report(PP.getFullLoc(Loc), DiagID,  &Msg, 1);\n  return true;\n}\n\nbool Sema::Diag(SourceLocation Loc, unsigned DiagID, const std::string &Msg1,\n                const std::string &Msg2) {\n  std::string MsgArr[] = { Msg1, Msg2 };\n  PP.getDiagnostics().Report(PP.getFullLoc(Loc), DiagID,  MsgArr, 2);\n  return true;\n}\n\nbool Sema::Diag(SourceLocation Loc, unsigned DiagID, SourceRange Range) {\n  PP.getDiagnostics().Report(PP.getFullLoc(Loc), DiagID, 0, 0, &Range,1);\n  return true;\n}\n\nbool Sema::Diag(SourceLocation Loc, unsigned DiagID, const std::string &Msg,\n                SourceRange Range) {\n  PP.getDiagnostics().Report(PP.getFullLoc(Loc), DiagID, &Msg, 1, &Range,1);\n  return true;\n}\n\nbool Sema::Diag(SourceLocation Loc, unsigned DiagID, const std::string &Msg1,\n                const std::string &Msg2, SourceRange Range) {\n  std::string MsgArr[] = { Msg1, Msg2 };\n  PP.getDiagnostics().Report(PP.getFullLoc(Loc), DiagID, MsgArr, 2, &Range, 1);\n  return true;\n}\n\nbool Sema::Diag(SourceLocation Loc, unsigned DiagID, const std::string &Msg1, \n                const std::string &Msg2, const std::string &Msg3, \n                SourceRange R1) {\n  std::string MsgArr[] = { Msg1, Msg2, Msg3 };\n  PP.getDiagnostics().Report(PP.getFullLoc(Loc), DiagID, MsgArr, 3, &R1, 1);\n  return true;\n}\n\nbool Sema::Diag(SourceLocation Loc, unsigned DiagID,\n                SourceRange R1, SourceRange R2) {\n  SourceRange RangeArr[] = { R1, R2 };\n  PP.getDiagnostics().Report(PP.getFullLoc(Loc), DiagID, 0, 0, RangeArr, 2);\n  return true;\n}\n\nbool Sema::Diag(SourceLocation Loc, unsigned DiagID, const std::string &Msg,\n                SourceRange R1, SourceRange R2) {\n  SourceRange RangeArr[] = { R1, R2 };\n  PP.getDiagnostics().Report(PP.getFullLoc(Loc), DiagID,  &Msg, 1, RangeArr, 2);\n  return true;\n}\n\nbool Sema::Diag(SourceLocation Range, unsigned DiagID, const std::string &Msg1,\n                const std::string &Msg2, SourceRange R1, SourceRange R2) {\n  std::string MsgArr[] = { Msg1, Msg2 };\n  SourceRange RangeArr[] = { R1, R2 };\n  PP.getDiagnostics().Report(PP.getFullLoc(Range),DiagID, MsgArr,2,RangeArr, 2);\n  return true;\n}\n\nconst LangOptions &Sema::getLangOptions() const {\n  return PP.getLangOptions();\n}\n<commit_msg>add a fixme back<commit_after>\/\/===--- Sema.cpp - AST Builder and Semantic Analysis Implementation ------===\/\/\n\/\/\n\/\/                     The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file implements the actions class which performs semantic analysis and\n\/\/ builds an AST out of a parse stream.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"Sema.h\"\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/Lex\/Preprocessor.h\"\n#include \"clang\/Basic\/Diagnostic.h\"\n#include \"clang\/Parse\/Scope.h\"\n\nusing namespace clang;\n\nbool Sema::isBuiltinObjCType(TypedefDecl *TD) {\n  const char *typeName = TD->getIdentifier()->getName();\n  return strcmp(typeName, \"id\") == 0 || strcmp(typeName, \"Class\") == 0 ||\n         strcmp(typeName, \"SEL\") == 0 || strcmp(typeName, \"Protocol\") == 0;\n}\n\nbool Sema::isObjCObjectPointerType(QualType type) const {\n  if (!type->isPointerType() && !type->isObjCQualifiedIdType())\n    return false;\n  if (type == Context.getObjCIdType() || type == Context.getObjCClassType() ||\n      type->isObjCQualifiedIdType())\n    return true;\n  \n  if (type->isPointerType()) {\n    PointerType *pointerType = static_cast<PointerType*>(type.getTypePtr());\n    type = pointerType->getPointeeType();\n  }\n  return (type->isObjCInterfaceType() || type->isObjCQualifiedIdType());\n}\n\nvoid Sema::ActOnTranslationUnitScope(SourceLocation Loc, Scope *S) {\n  TUScope = S;\n  CurContext = Context.getTranslationUnitDecl();\n  if (!PP.getLangOptions().ObjC1) return;\n  \n  \/\/ Synthesize \"typedef struct objc_selector *SEL;\"\n  RecordDecl *SelTag = RecordDecl::Create(Context, TagDecl::TK_struct, CurContext,\n                                          SourceLocation(), \n                                          &Context.Idents.get(\"objc_selector\"),\n                                          0);\n  PushOnScopeChains(SelTag, TUScope);\n  \n  QualType SelT = Context.getPointerType(Context.getTagDeclType(SelTag));\n  TypedefDecl *SelTypedef = TypedefDecl::Create(Context, CurContext,\n                                                SourceLocation(),\n                                                &Context.Idents.get(\"SEL\"),\n                                                SelT, 0);\n  PushOnScopeChains(SelTypedef, TUScope);\n  Context.setObjCSelType(SelTypedef);\n\n  \/\/ FIXME: Make sure these don't leak!\n  RecordDecl *ClassTag = RecordDecl::Create(Context, TagDecl::TK_struct,\n                                            CurContext,\n                                            SourceLocation(),\n                                            &Context.Idents.get(\"objc_class\"),\n                                            0);\n  QualType ClassT = Context.getPointerType(Context.getTagDeclType(ClassTag));\n  TypedefDecl *ClassTypedef = \n    TypedefDecl::Create(Context, CurContext, SourceLocation(),\n                        &Context.Idents.get(\"Class\"), ClassT, 0);\n  PushOnScopeChains(ClassTag, TUScope);\n  PushOnScopeChains(ClassTypedef, TUScope);\n  Context.setObjCClassType(ClassTypedef);\n  \/\/ Synthesize \"@class Protocol;\n  ObjCInterfaceDecl *ProtocolDecl =\n    ObjCInterfaceDecl::Create(Context, SourceLocation(), 0, \n                              &Context.Idents.get(\"Protocol\"), \n                              SourceLocation(), true);\n  Context.setObjCProtoType(Context.getObjCInterfaceType(ProtocolDecl));\n  PushOnScopeChains(ProtocolDecl, TUScope);\n  \n  \/\/ Synthesize \"typedef struct objc_object { Class isa; } *id;\"\n  RecordDecl *ObjectTag = \n    RecordDecl::Create(Context, TagDecl::TK_struct, CurContext,\n                       SourceLocation(),\n                       &Context.Idents.get(\"objc_object\"), 0);\n  QualType ObjT = Context.getPointerType(Context.getTagDeclType(ObjectTag));\n  PushOnScopeChains(ObjectTag, TUScope);\n  TypedefDecl *IdTypedef = TypedefDecl::Create(Context, CurContext,\n                                               SourceLocation(),\n                                               &Context.Idents.get(\"id\"),\n                                               ObjT, 0);\n  PushOnScopeChains(IdTypedef, TUScope);\n  Context.setObjCIdType(IdTypedef);\n}\n\nSema::Sema(Preprocessor &pp, ASTContext &ctxt, ASTConsumer &consumer)\n  : PP(pp), Context(ctxt), Consumer(consumer), \n    CurFunctionDecl(0), CurMethodDecl(0), CurContext(0) {\n  \n  \/\/ Get IdentifierInfo objects for known functions for which we\n  \/\/ do extra checking.  \n  IdentifierTable &IT = PP.getIdentifierTable();  \n\n  KnownFunctionIDs[id_printf]    = &IT.get(\"printf\");\n  KnownFunctionIDs[id_fprintf]   = &IT.get(\"fprintf\");\n  KnownFunctionIDs[id_sprintf]   = &IT.get(\"sprintf\");\n  KnownFunctionIDs[id_snprintf]  = &IT.get(\"snprintf\");\n  KnownFunctionIDs[id_asprintf]  = &IT.get(\"asprintf\");\n  KnownFunctionIDs[id_NSLog]     = &IT.get(\"NSLog\");\n  KnownFunctionIDs[id_vsnprintf] = &IT.get(\"vsnprintf\");\n  KnownFunctionIDs[id_vasprintf] = &IT.get(\"vasprintf\");\n  KnownFunctionIDs[id_vfprintf]  = &IT.get(\"vfprintf\");\n  KnownFunctionIDs[id_vsprintf]  = &IT.get(\"vsprintf\");\n  KnownFunctionIDs[id_vprintf]   = &IT.get(\"vprintf\");\n\n  TUScope = 0;\n}\n\n\/\/\/ ImpCastExprToType - If Expr is not of type 'Type', insert an implicit cast. \n\/\/\/ If there is already an implicit cast, merge into the existing one.\nvoid Sema::ImpCastExprToType(Expr *&Expr, QualType Type) {\n  if (Expr->getType().getCanonicalType() == Type.getCanonicalType()) return;\n  \n  if (ImplicitCastExpr *ImpCast = dyn_cast<ImplicitCastExpr>(Expr))\n    ImpCast->setType(Type);\n  else \n    Expr = new ImplicitCastExpr(Type, Expr);\n}\n\n\n\nvoid Sema::DeleteExpr(ExprTy *E) {\n  delete static_cast<Expr*>(E);\n}\nvoid Sema::DeleteStmt(StmtTy *S) {\n  delete static_cast<Stmt*>(S);\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Helper functions.\n\/\/===----------------------------------------------------------------------===\/\/\n\nbool Sema::Diag(SourceLocation Loc, unsigned DiagID) {\n  PP.getDiagnostics().Report(PP.getFullLoc(Loc), DiagID);\n  return true;\n}\n\nbool Sema::Diag(SourceLocation Loc, unsigned DiagID, const std::string &Msg) {\n  PP.getDiagnostics().Report(PP.getFullLoc(Loc), DiagID,  &Msg, 1);\n  return true;\n}\n\nbool Sema::Diag(SourceLocation Loc, unsigned DiagID, const std::string &Msg1,\n                const std::string &Msg2) {\n  std::string MsgArr[] = { Msg1, Msg2 };\n  PP.getDiagnostics().Report(PP.getFullLoc(Loc), DiagID,  MsgArr, 2);\n  return true;\n}\n\nbool Sema::Diag(SourceLocation Loc, unsigned DiagID, SourceRange Range) {\n  PP.getDiagnostics().Report(PP.getFullLoc(Loc), DiagID, 0, 0, &Range,1);\n  return true;\n}\n\nbool Sema::Diag(SourceLocation Loc, unsigned DiagID, const std::string &Msg,\n                SourceRange Range) {\n  PP.getDiagnostics().Report(PP.getFullLoc(Loc), DiagID, &Msg, 1, &Range,1);\n  return true;\n}\n\nbool Sema::Diag(SourceLocation Loc, unsigned DiagID, const std::string &Msg1,\n                const std::string &Msg2, SourceRange Range) {\n  std::string MsgArr[] = { Msg1, Msg2 };\n  PP.getDiagnostics().Report(PP.getFullLoc(Loc), DiagID, MsgArr, 2, &Range, 1);\n  return true;\n}\n\nbool Sema::Diag(SourceLocation Loc, unsigned DiagID, const std::string &Msg1, \n                const std::string &Msg2, const std::string &Msg3, \n                SourceRange R1) {\n  std::string MsgArr[] = { Msg1, Msg2, Msg3 };\n  PP.getDiagnostics().Report(PP.getFullLoc(Loc), DiagID, MsgArr, 3, &R1, 1);\n  return true;\n}\n\nbool Sema::Diag(SourceLocation Loc, unsigned DiagID,\n                SourceRange R1, SourceRange R2) {\n  SourceRange RangeArr[] = { R1, R2 };\n  PP.getDiagnostics().Report(PP.getFullLoc(Loc), DiagID, 0, 0, RangeArr, 2);\n  return true;\n}\n\nbool Sema::Diag(SourceLocation Loc, unsigned DiagID, const std::string &Msg,\n                SourceRange R1, SourceRange R2) {\n  SourceRange RangeArr[] = { R1, R2 };\n  PP.getDiagnostics().Report(PP.getFullLoc(Loc), DiagID,  &Msg, 1, RangeArr, 2);\n  return true;\n}\n\nbool Sema::Diag(SourceLocation Range, unsigned DiagID, const std::string &Msg1,\n                const std::string &Msg2, SourceRange R1, SourceRange R2) {\n  std::string MsgArr[] = { Msg1, Msg2 };\n  SourceRange RangeArr[] = { R1, R2 };\n  PP.getDiagnostics().Report(PP.getFullLoc(Range),DiagID, MsgArr,2,RangeArr, 2);\n  return true;\n}\n\nconst LangOptions &Sema::getLangOptions() const {\n  return PP.getLangOptions();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Dynamic Programming\n#include <iostream>\n#include <string.h>\nusing namespace std;\n\nint T, t, N;\nchar map[5][5];\nchar str[10][11];\nbool found[10];\nbool notthisway[10][10][10];\n\nbool find(int i, int si, int y, int x) {\n    if(str[i][si] == '\\0') {\n        return true;\n    }\n    if(y < 0 || y >= 5 || x < 0 || x >= 5) {\n        return false;\n    }\n    if(notthisway[si][y][x]) {\n        return false;\n    }\n    if(str[i][si] != map[y][x]) {\n        notthisway[si][y][x] = true;\n        return false;\n    }\n    \n    if(find(i, si+1, y-1, x-1)) return true;\n    if(find(i, si+1, y-1, x)) return true;\n    if(find(i, si+1, y-1, x+1)) return true;\n    if(find(i, si+1, y, x-1)) return true;\n    if(find(i, si+1, y, x+1)) return true;\n    if(find(i, si+1, y+1, x-1)) return true;\n    if(find(i, si+1, y+1, x)) return true;\n    if(find(i, si+1, y+1, x+1)) return true;\n    notthisway[si][y][x] = true;\n    return false;\n}\n\nvoid solution() {\n    bool found;\n    for (int i=0; i<N; i++) {\n        found = false;\n        memset(notthisway, 0, sizeof(bool)*10*10*10);\n        for(int y=0; y<5; y++) {\n            for(int x=0; x<5; x++) {\n                if(find(i, 0, y, x)) {\n                    found = true;\n                    break;\n                }\n            }\n            if(found) break;\n        }\n        cout << str[i] << ' ' << (found ? \"YES\" : \"NO\") << endl;\n    }\n}\n\nint main(int argc, const char * argv[]) {\n    cin >> T;\n    for(t = 1; t<=T; t++) {\n        for(int i=0; i<5; i++) {\n            cin >> map[i];\n        }\n        cin >> N;\n        for(int i=0; i<N; i++) {\n            cin >> str[i];\n            found[i] = false;\n        }\n        solution();\n    }\n    \n    \n    return 0;\n}\n<commit_msg>Accepted<commit_after>\/\/ Dynamic Programming\n#include <iostream>\n#include <string.h>\nusing namespace std;\n\nint T, t, N;\nchar map[5][5];\nchar str[10][11];\nbool found[10];\nbool notthisway[10][10][10];\n\nbool find(int i, int si, int y, int x) {\n    if(str[i][si] == '\\0') {\n        return true;\n    }\n    if(y < 0 || y >= 5 || x < 0 || x >= 5) {\n        return false;\n    }\n    if(notthisway[si][y][x]) {\n        return false;\n    }\n    if(str[i][si] != map[y][x]) {\n        notthisway[si][y][x] = true;\n        return false;\n    }\n    \n    if(find(i, si+1, y-1, x-1)) return true;\n    if(find(i, si+1, y-1, x)) return true;\n    if(find(i, si+1, y-1, x+1)) return true;\n    if(find(i, si+1, y, x-1)) return true;\n    if(find(i, si+1, y, x+1)) return true;\n    if(find(i, si+1, y+1, x-1)) return true;\n    if(find(i, si+1, y+1, x)) return true;\n    if(find(i, si+1, y+1, x+1)) return true;\n    notthisway[si][y][x] = true;\n    return false;\n}\n\nvoid solution() {\n    bool found;\n    for (int i=0; i<N; i++) {\n        found = false;\n        memset(notthisway, 0, sizeof(bool)*10*10*10);\n        for(int y=0; y<5; y++) {\n            for(int x=0; x<5; x++) {\n                if(find(i, 0, y, x)) {\n                    found = true;\n                    break;\n                }\n            }\n            if(found) break;\n        }\n        cout << str[i] << ' ' << (found ? \"YES\" : \"NO\") << endl;\n    }\n}\n\nint main(int argc, const char * argv[]) {\n    cin >> T;\n    for(t = 1; t<=T; t++) {\n        for(int i=0; i<5; i++) {\n            cin >> map[i];\n        }\n        cin >> N;\n        for(int i=0; i<N; i++) {\n            cin >> str[i];\n            found[i] = false;\n        }\n        solution();\n    }\n    \n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *            Copyright 2009-2020 The VOTCA Development Team\n *                       (http:\/\/www.votca.org)\n *\n *      Licensed under the Apache License, Version 2.0 (the \"License\")\n *\n * You may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *              http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n\/\/ Third party includes\n#include <boost\/format.hpp>\n\n\/\/ VOTCA includes\n#include <votca\/tools\/tokenizer.h>\n\n\/\/ Local VOTCA includes\n#include \"votca\/xtp\/vxc_functionals.h\"\n#include \"votca\/xtp\/vxc_grid.h\"\n#include \"votca\/xtp\/vxc_potential.h\"\n\nnamespace votca {\nnamespace xtp {\ntemplate <class Grid>\nVxc_Potential<Grid>::~Vxc_Potential() {\n  if (setXC_) {\n    xc_func_end(&xfunc);\n    if (use_separate_) {\n      xc_func_end(&cfunc);\n    }\n  }\n}\ntemplate <class Grid>\ndouble Vxc_Potential<Grid>::getExactExchange(const std::string& functional) {\n\n  double exactexchange = 0.0;\n  Vxc_Functionals map;\n\n  std::vector<std::string> functional_names =\n      tools::Tokenizer(functional, \" \").ToVector();\n\n  if (functional_names.size() > 2) {\n    throw std::runtime_error(\"Too many functional names\");\n  } else if (functional_names.size() < 1) {\n    throw std::runtime_error(\"Specify at least one functional\");\n  }\n\n  for (const std::string& functional_name : functional_names) {\n\n    int func_id = map.getID(functional_name);\n    if (func_id < 0) {\n      exactexchange = 0.0;\n      break;\n    }\n    xc_func_type func;\n    if (xc_func_init(&func, func_id, XC_UNPOLARIZED) != 0) {\n      throw std::runtime_error(\n          (boost::format(\"Functional %s not found\\n\") % functional_name).str());\n    }\n    if (exactexchange > 0 && func.cam_alpha > 0) {\n      throw std::runtime_error(\n          \"You have specified two functionals with exact exchange\");\n    }\n    exactexchange += func.cam_alpha;\n    xc_func_end(&func);\n  }\n\n  return exactexchange;\n}\ntemplate <class Grid>\nvoid Vxc_Potential<Grid>::setXCfunctional(const std::string& functional) {\n\n  Vxc_Functionals map;\n  std::vector<std::string> strs =\n      tools::Tokenizer(functional, \" ,\\n\\t\").ToVector();\n  xfunc_id = 0;\n  use_separate_ = false;\n  cfunc_id = 0;\n  if (strs.size() == 1) {\n    xfunc_id = map.getID(strs[0]);\n  } else if (strs.size() == 2) {\n    xfunc_id = map.getID(strs[0]);\n    cfunc_id = map.getID(strs[1]);\n    use_separate_ = true;\n  } else {\n    throw std::runtime_error(\n        \"LIBXC. Please specify one combined or an exchange and a correlation \"\n        \"functionals\");\n  }\n\n  if (xc_func_init(&xfunc, xfunc_id, XC_UNPOLARIZED) != 0) {\n    throw std::runtime_error(\n        (boost::format(\"Functional %s not found\\n\") % strs[0]).str());\n  }\n  if (xfunc.info->kind != 2 && !use_separate_) {\n    throw std::runtime_error(\n        \"Your functional misses either correlation or exchange, please specify \"\n        \"another functional, separated by whitespace\");\n  }\n  if (use_separate_) {\n    if (xc_func_init(&cfunc, cfunc_id, XC_UNPOLARIZED) != 0) {\n      throw std::runtime_error(\n          (boost::format(\"Functional %s not found\\n\") % strs[1]).str());\n    }\n    if ((xfunc.info->kind + cfunc.info->kind) != 1) {\n      throw std::runtime_error(\n          \"Your functionals are not one exchange and one correlation\");\n    }\n  }\n  setXC_ = true;\n  return;\n}\ntemplate <class Grid>\ntypename Vxc_Potential<Grid>::XC_entry Vxc_Potential<Grid>::EvaluateXC(\n    double rho, double sigma) const {\n\n  Vxc_Potential<Grid>::XC_entry result;\n  switch (xfunc.info->family) {\n    case XC_FAMILY_LDA:\n      xc_lda_exc_vxc(&xfunc, 1, &rho, &result.f_xc, &result.df_drho);\n      break;\n    case XC_FAMILY_GGA:\n    case XC_FAMILY_HYB_GGA:\n      xc_gga_exc_vxc(&xfunc, 1, &rho, &sigma, &result.f_xc, &result.df_drho,\n                     &result.df_dsigma);\n      break;\n  }\n  if (use_separate_) {\n    typename Vxc_Potential<Grid>::XC_entry temp;\n    \/\/ via libxc correlation part only\n    switch (cfunc.info->family) {\n      case XC_FAMILY_LDA:\n        xc_lda_exc_vxc(&cfunc, 1, &rho, &temp.f_xc, &temp.df_drho);\n        break;\n      case XC_FAMILY_GGA:\n      case XC_FAMILY_HYB_GGA:\n        xc_gga_exc_vxc(&cfunc, 1, &rho, &sigma, &temp.f_xc, &temp.df_drho,\n                       &temp.df_dsigma);\n        break;\n    }\n\n    result.f_xc += temp.f_xc;\n    result.df_drho += temp.df_drho;\n    result.df_dsigma += temp.df_dsigma;\n  }\n\n  return result;\n}\ntemplate <class Grid>\nMat_p_Energy Vxc_Potential<Grid>::IntegrateVXC(\n    const Eigen::MatrixXd& density_matrix) const {\n\n  Mat_p_Energy vxc = Mat_p_Energy(density_matrix.rows(), density_matrix.cols());\n\n#pragma omp parallel for schedule(guided) reduction(+ : vxc)\n  for (Index i = 0; i < grid_.getBoxesSize(); ++i) {\n    const GridBox& box = grid_[i];\n    if (!box.Matrixsize()) {\n      continue;\n    }\n    double EXC_box = 0.0;\n    const Eigen::MatrixXd DMAT_here = box.ReadFromBigMatrix(density_matrix);\n    const Eigen::MatrixXd DMAT_symm = DMAT_here + DMAT_here.transpose();\n    double cutoff =\n        1.e-40 \/ double(density_matrix.rows()) \/ double(density_matrix.rows());\n    if (DMAT_here.cwiseAbs2().maxCoeff() < cutoff) {\n      continue;\n    }\n    Eigen::MatrixXd Vxc_here =\n        Eigen::MatrixXd::Zero(DMAT_here.rows(), DMAT_here.cols());\n    const std::vector<Eigen::Vector3d>& points = box.getGridPoints();\n    const std::vector<double>& weights = box.getGridWeights();\n\n    \/\/ iterate over gridpoints\n    for (Index p = 0; p < box.size(); p++) {\n      AOShell::AOValues ao = box.CalcAOValues(points[p]);\n      const double rho = 0.5 * ao.values.dot(DMAT_symm * ao.values);\n      const double weight = weights[p];\n      if (rho * weight < 1.e-20) {\n        continue;  \/\/ skip the rest, if density is very small\n      }\n      const Eigen::Vector3d rho_grad =\n          ao.values.transpose() * DMAT_symm * ao.derivatives;\n      const double sigma = (rho_grad.transpose() * rho_grad).value();\n      const Eigen::VectorXd grad = ao.derivatives * rho_grad;\n      typename Vxc_Potential<Grid>::XC_entry xc = EvaluateXC(rho, sigma);\n      EXC_box += weight * rho * xc.f_xc;\n      auto addXC =\n          weight * (0.5 * xc.df_drho * ao.values + 2.0 * xc.df_dsigma * grad);\n      Vxc_here.noalias() += addXC * ao.values.transpose();\n    }\n    box.AddtoBigMatrix(vxc.matrix(), Vxc_here);\n    vxc.energy() += EXC_box;\n  }\n\n  return Mat_p_Energy(vxc.energy(), vxc.matrix() + vxc.matrix().transpose());\n}\n\ntemplate class Vxc_Potential<Vxc_Grid>;\n\n}  \/\/ namespace xtp\n}  \/\/ namespace votca\n<commit_msg>improved vxc performance by 25%<commit_after>\/*\n *            Copyright 2009-2020 The VOTCA Development Team\n *                       (http:\/\/www.votca.org)\n *\n *      Licensed under the Apache License, Version 2.0 (the \"License\")\n *\n * You may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *              http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n\/\/ Third party includes\n#include <boost\/format.hpp>\n\n\/\/ VOTCA includes\n#include <votca\/tools\/tokenizer.h>\n\n\/\/ Local VOTCA includes\n#include \"votca\/xtp\/vxc_functionals.h\"\n#include \"votca\/xtp\/vxc_grid.h\"\n#include \"votca\/xtp\/vxc_potential.h\"\n\nnamespace votca {\nnamespace xtp {\ntemplate <class Grid>\nVxc_Potential<Grid>::~Vxc_Potential() {\n  if (setXC_) {\n    xc_func_end(&xfunc);\n    if (use_separate_) {\n      xc_func_end(&cfunc);\n    }\n  }\n}\ntemplate <class Grid>\ndouble Vxc_Potential<Grid>::getExactExchange(const std::string& functional) {\n\n  double exactexchange = 0.0;\n  Vxc_Functionals map;\n\n  std::vector<std::string> functional_names =\n      tools::Tokenizer(functional, \" \").ToVector();\n\n  if (functional_names.size() > 2) {\n    throw std::runtime_error(\"Too many functional names\");\n  } else if (functional_names.size() < 1) {\n    throw std::runtime_error(\"Specify at least one functional\");\n  }\n\n  for (const std::string& functional_name : functional_names) {\n\n    int func_id = map.getID(functional_name);\n    if (func_id < 0) {\n      exactexchange = 0.0;\n      break;\n    }\n    xc_func_type func;\n    if (xc_func_init(&func, func_id, XC_UNPOLARIZED) != 0) {\n      throw std::runtime_error(\n          (boost::format(\"Functional %s not found\\n\") % functional_name).str());\n    }\n    if (exactexchange > 0 && func.cam_alpha > 0) {\n      throw std::runtime_error(\n          \"You have specified two functionals with exact exchange\");\n    }\n    exactexchange += func.cam_alpha;\n    xc_func_end(&func);\n  }\n\n  return exactexchange;\n}\ntemplate <class Grid>\nvoid Vxc_Potential<Grid>::setXCfunctional(const std::string& functional) {\n\n  Vxc_Functionals map;\n  std::vector<std::string> strs =\n      tools::Tokenizer(functional, \" ,\\n\\t\").ToVector();\n  xfunc_id = 0;\n  use_separate_ = false;\n  cfunc_id = 0;\n  if (strs.size() == 1) {\n    xfunc_id = map.getID(strs[0]);\n  } else if (strs.size() == 2) {\n    xfunc_id = map.getID(strs[0]);\n    cfunc_id = map.getID(strs[1]);\n    use_separate_ = true;\n  } else {\n    throw std::runtime_error(\n        \"LIBXC. Please specify one combined or an exchange and a correlation \"\n        \"functionals\");\n  }\n\n  if (xc_func_init(&xfunc, xfunc_id, XC_UNPOLARIZED) != 0) {\n    throw std::runtime_error(\n        (boost::format(\"Functional %s not found\\n\") % strs[0]).str());\n  }\n  if (xfunc.info->kind != 2 && !use_separate_) {\n    throw std::runtime_error(\n        \"Your functional misses either correlation or exchange, please specify \"\n        \"another functional, separated by whitespace\");\n  }\n  if (use_separate_) {\n    if (xc_func_init(&cfunc, cfunc_id, XC_UNPOLARIZED) != 0) {\n      throw std::runtime_error(\n          (boost::format(\"Functional %s not found\\n\") % strs[1]).str());\n    }\n    if ((xfunc.info->kind + cfunc.info->kind) != 1) {\n      throw std::runtime_error(\n          \"Your functionals are not one exchange and one correlation\");\n    }\n  }\n  setXC_ = true;\n  return;\n}\ntemplate <class Grid>\ntypename Vxc_Potential<Grid>::XC_entry Vxc_Potential<Grid>::EvaluateXC(\n    double rho, double sigma) const {\n\n  Vxc_Potential<Grid>::XC_entry result;\n  switch (xfunc.info->family) {\n    case XC_FAMILY_LDA:\n      xc_lda_exc_vxc(&xfunc, 1, &rho, &result.f_xc, &result.df_drho);\n      break;\n    case XC_FAMILY_GGA:\n    case XC_FAMILY_HYB_GGA:\n      xc_gga_exc_vxc(&xfunc, 1, &rho, &sigma, &result.f_xc, &result.df_drho,\n                     &result.df_dsigma);\n      break;\n  }\n  if (use_separate_) {\n    typename Vxc_Potential<Grid>::XC_entry temp;\n    \/\/ via libxc correlation part only\n    switch (cfunc.info->family) {\n      case XC_FAMILY_LDA:\n        xc_lda_exc_vxc(&cfunc, 1, &rho, &temp.f_xc, &temp.df_drho);\n        break;\n      case XC_FAMILY_GGA:\n      case XC_FAMILY_HYB_GGA:\n        xc_gga_exc_vxc(&cfunc, 1, &rho, &sigma, &temp.f_xc, &temp.df_drho,\n                       &temp.df_dsigma);\n        break;\n    }\n\n    result.f_xc += temp.f_xc;\n    result.df_drho += temp.df_drho;\n    result.df_dsigma += temp.df_dsigma;\n  }\n\n  return result;\n}\ntemplate <class Grid>\nMat_p_Energy Vxc_Potential<Grid>::IntegrateVXC(\n    const Eigen::MatrixXd& density_matrix) const {\n\n  assert(density_matrix.isApprox(density_matrix.transpose()) &&\n         \"Density matrix has to be symmetric!\");\n  Mat_p_Energy vxc = Mat_p_Energy(density_matrix.rows(), density_matrix.cols());\n\n#pragma omp parallel for schedule(guided) reduction(+ : vxc)\n  for (Index i = 0; i < grid_.getBoxesSize(); ++i) {\n    const GridBox& box = grid_[i];\n    if (!box.Matrixsize()) {\n      continue;\n    }\n    double EXC_box = 0.0;\n    \/\/ two because we have to use the density matrix and its transpose\n    const Eigen::MatrixXd DMAT_here = 2*box.ReadFromBigMatrix(density_matrix);\n    double cutoff =\n        1.e-40 \/ double(density_matrix.rows()) \/ double(density_matrix.rows());\n    if (DMAT_here.cwiseAbs2().maxCoeff() < cutoff) {\n      continue;\n    }\n    Eigen::MatrixXd Vxc_here =\n        Eigen::MatrixXd::Zero(DMAT_here.rows(), DMAT_here.cols());\n    const std::vector<Eigen::Vector3d>& points = box.getGridPoints();\n    const std::vector<double>& weights = box.getGridWeights();\n\n    \/\/ iterate over gridpoints\n    for (Index p = 0; p < box.size(); p++) {\n      AOShell::AOValues ao = box.CalcAOValues(points[p]);\n      Eigen::VectorXd temp=ao.values.transpose()*DMAT_here;\n      double rho = 0.5 * temp.dot(ao.values);\n      const double weight = weights[p];\n      if (rho * weight < 1.e-20) {\n        continue;  \/\/ skip the rest, if density is very small\n      }\n      const Eigen::Vector3d rho_grad =\n          temp.transpose() * ao.derivatives;\n\n      typename Vxc_Potential<Grid>::XC_entry xc =\n          EvaluateXC(rho, rho_grad.squaredNorm());\n      EXC_box += weight * rho * xc.f_xc;\n      auto grad = ao.derivatives * rho_grad;\n      temp.noalias() =\n          weight * (0.5 * xc.df_drho * ao.values + 2.0 * xc.df_dsigma * grad);\n      Vxc_here.noalias() += temp * ao.values.transpose();\n    }\n    box.AddtoBigMatrix(vxc.matrix(), Vxc_here);\n    vxc.energy() += EXC_box;\n  }\n\n  return Mat_p_Energy(vxc.energy(), vxc.matrix() + vxc.matrix().transpose());\n}\n\ntemplate class Vxc_Potential<Vxc_Grid>;\n\n}  \/\/ namespace xtp\n}  \/\/ namespace votca\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 \"packed_mixed_tensor_builder.h\"\n\nnamespace vespalib::eval::packed_mixed_tensor {\n\ntemplate <typename T>\nArrayRef<T> \nPackedMixedTensorBuilder<T>::add_subspace(ConstArrayRef<vespalib::stringref> addr_in)\n{\n    std::vector<vespalib::stringref> addr(addr_in.begin(), addr_in.end());\n    uint32_t idx = _mappings_builder.add_mapping_for(addr);\n    size_t offset = idx * _subspace_size;\n    assert(offset <= _cells.size());\n    if (offset == _cells.size()) {\n        _cells.resize(offset + _subspace_size);\n    }\n    return ArrayRef<T>(&_cells[offset], _subspace_size);\n}\n\n\ntemplate <typename T>\nstd::unique_ptr<Value>\nPackedMixedTensorBuilder<T>::build(std::unique_ptr<ValueBuilder<T>>)\n{\n    size_t self_size = sizeof(PackedMixedTensor);\n    size_t mappings_size = _mappings_builder.extra_memory();\n    \/\/ align cells:\n    mappings_size += PackedMixedTensor::add_for_alignment(self_size + mappings_size);\n    size_t cells_size = sizeof(T) * _cells.size();\n    size_t total_size = self_size + mappings_size + cells_size;\n\n    char *mem = (char *) operator new(total_size);\n    char *mappings_mem = mem + self_size;\n    char *cells_mem = mappings_mem + mappings_size;\n\n    \/\/ fill mapping data:\n    auto mappings = _mappings_builder.target_memory(mappings_mem, cells_mem);\n\n    \/\/ copy cells:\n    memcpy(cells_mem, &_cells[0], cells_size);\n    ConstArrayRef<T> cells((T *)(void *) cells_mem, _cells.size());\n\n    PackedMixedTensor * built =\n        new (mem) PackedMixedTensor(_type, TypedCells(cells), mappings);\n\n    return std::unique_ptr<PackedMixedTensor>(built);\n}\n\ntemplate class PackedMixedTensorBuilder<float>;\ntemplate class PackedMixedTensorBuilder<double>;\n\n} \/\/ namespace\n<commit_msg>disallow duplicate add_subspace for PackedMixedTensorBuilder<commit_after>\/\/ Copyright Verizon Media. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n\n#include \"packed_mixed_tensor_builder.h\"\n\nnamespace vespalib::eval::packed_mixed_tensor {\n\ntemplate <typename T>\nArrayRef<T> \nPackedMixedTensorBuilder<T>::add_subspace(ConstArrayRef<vespalib::stringref> addr_in)\n{\n    std::vector<vespalib::stringref> addr(addr_in.begin(), addr_in.end());\n    uint32_t idx = _mappings_builder.add_mapping_for(addr);\n    size_t offset = idx * _subspace_size;\n    assert(offset == _cells.size());\n    _cells.resize(offset + _subspace_size);\n    return ArrayRef<T>(&_cells[offset], _subspace_size);\n}\n\n\ntemplate <typename T>\nstd::unique_ptr<Value>\nPackedMixedTensorBuilder<T>::build(std::unique_ptr<ValueBuilder<T>>)\n{\n    size_t self_size = sizeof(PackedMixedTensor);\n    size_t mappings_size = _mappings_builder.extra_memory();\n    \/\/ align cells:\n    mappings_size += PackedMixedTensor::add_for_alignment(self_size + mappings_size);\n    size_t cells_size = sizeof(T) * _cells.size();\n    size_t total_size = self_size + mappings_size + cells_size;\n\n    char *mem = (char *) operator new(total_size);\n    char *mappings_mem = mem + self_size;\n    char *cells_mem = mappings_mem + mappings_size;\n\n    \/\/ fill mapping data:\n    auto mappings = _mappings_builder.target_memory(mappings_mem, cells_mem);\n\n    \/\/ copy cells:\n    memcpy(cells_mem, &_cells[0], cells_size);\n    ConstArrayRef<T> cells((T *)(void *) cells_mem, _cells.size());\n\n    PackedMixedTensor * built =\n        new (mem) PackedMixedTensor(_type, TypedCells(cells), mappings);\n\n    return std::unique_ptr<PackedMixedTensor>(built);\n}\n\ntemplate class PackedMixedTensorBuilder<float>;\ntemplate class PackedMixedTensorBuilder<double>;\n\n} \/\/ namespace\n<|endoftext|>"}
{"text":"<commit_before>#include \"..\/ir.h\"\n#include <deque>\n#include <set>\n\nTLANG_NAMESPACE_BEGIN\n\nclass ConstantFold : public BasicStmtVisitor {\n public:\n  using BasicStmtVisitor::visit;\n\n  ConstantFold() : BasicStmtVisitor() {\n  }\n\n  void visit(UnaryOpStmt *stmt) override {\n    if (stmt->width() == 1 && stmt->op_type == UnaryOpType::cast &&\n        stmt->cast_by_value && stmt->operand->is<ConstStmt>()) {\n      auto input = stmt->operand->as<ConstStmt>()->val[0];\n      auto src_type = stmt->operand->ret_type.data_type;\n      auto dst_type = stmt->ret_type.data_type;\n      TypedConstant new_constant(dst_type);\n      bool success = false;\n      if (src_type == DataType::f32) {\n        auto v = input.val_float32();\n        if (dst_type == DataType::i32) {\n          new_constant.val_i32 = int32(v);\n          success = true;\n        }\n      }\n\n      if (success) {\n        auto evaluated =\n            Stmt::make<ConstStmt>(LaneAttribute<TypedConstant>(new_constant));\n        stmt->replace_with(evaluated.get());\n        stmt->parent->insert_before(stmt, VecStatement(std::move(evaluated)));\n        stmt->parent->erase(stmt);\n        throw IRModified();\n      }\n    }\n  }\n\n  void visit(BinaryOpStmt *stmt) override {\n    auto lhs = stmt->lhs->cast<ConstStmt>();\n    auto rhs = stmt->rhs->cast<ConstStmt>();\n    if (!lhs || !rhs)\n      return;\n    if (stmt->width() != 1 || stmt->ret_type.data_type != DataType::i32) {\n      return;\n    }\n    auto dst_type = DataType::i32;\n    TypedConstant new_constant(dst_type);\n    if (stmt->op_type == BinaryOpType::sub) {\n      new_constant.val_int32() =\n          lhs->val[0].val_int32() - rhs->val[0].val_int32();\n      auto evaluated =\n          Stmt::make<ConstStmt>(LaneAttribute<TypedConstant>(new_constant));\n      stmt->replace_with(evaluated.get());\n      stmt->parent->insert_before(stmt, VecStatement(std::move(evaluated)));\n      stmt->parent->erase(stmt);\n      throw IRModified();\n    }\n  }\n\n  static void run(IRNode *node) {\n    ConstantFold folder;\n    while (true) {\n      bool modified = false;\n      try {\n        node->accept(&folder);\n      } catch (IRModified) {\n        modified = true;\n      }\n      if (!modified)\n        break;\n    }\n  }\n};\n\nnamespace irpass {\n\nvoid constant_fold(IRNode *root) {\n  return ConstantFold::run(root);\n}\n\n}  \/\/ namespace irpass\n\nTLANG_NAMESPACE_END\n<commit_msg>const fold mul<commit_after>#include \"..\/ir.h\"\n#include <deque>\n#include <set>\n\nTLANG_NAMESPACE_BEGIN\n\nclass ConstantFold : public BasicStmtVisitor {\n public:\n  using BasicStmtVisitor::visit;\n\n  ConstantFold() : BasicStmtVisitor() {\n  }\n\n  void visit(UnaryOpStmt *stmt) override {\n    if (stmt->width() == 1 && stmt->op_type == UnaryOpType::cast &&\n        stmt->cast_by_value && stmt->operand->is<ConstStmt>()) {\n      auto input = stmt->operand->as<ConstStmt>()->val[0];\n      auto src_type = stmt->operand->ret_type.data_type;\n      auto dst_type = stmt->ret_type.data_type;\n      TypedConstant new_constant(dst_type);\n      bool success = false;\n      if (src_type == DataType::f32) {\n        auto v = input.val_float32();\n        if (dst_type == DataType::i32) {\n          new_constant.val_i32 = int32(v);\n          success = true;\n        }\n      }\n\n      if (success) {\n        auto evaluated =\n            Stmt::make<ConstStmt>(LaneAttribute<TypedConstant>(new_constant));\n        stmt->replace_with(evaluated.get());\n        stmt->parent->insert_before(stmt, VecStatement(std::move(evaluated)));\n        stmt->parent->erase(stmt);\n        throw IRModified();\n      }\n    }\n  }\n\n  void visit(BinaryOpStmt *stmt) override {\n    auto lhs = stmt->lhs->cast<ConstStmt>();\n    auto rhs = stmt->rhs->cast<ConstStmt>();\n    if (!lhs || !rhs)\n      return;\n    if (stmt->width() != 1 || stmt->ret_type.data_type != DataType::i32) {\n      return;\n    }\n    auto dst_type = DataType::i32;\n    TypedConstant new_constant(dst_type);\n    if (stmt->op_type == BinaryOpType::sub) {\n      new_constant.val_int32() =\n          lhs->val[0].val_int32() - rhs->val[0].val_int32();\n      auto evaluated =\n          Stmt::make<ConstStmt>(LaneAttribute<TypedConstant>(new_constant));\n      stmt->replace_with(evaluated.get());\n      stmt->parent->insert_before(stmt, VecStatement(std::move(evaluated)));\n      stmt->parent->erase(stmt);\n      throw IRModified();\n    } else if (stmt->op_type == BinaryOpType::mul) {\n      new_constant.val_int32() =\n          lhs->val[0].val_int32() * rhs->val[0].val_int32();\n      auto evaluated =\n          Stmt::make<ConstStmt>(LaneAttribute<TypedConstant>(new_constant));\n      stmt->replace_with(evaluated.get());\n      stmt->parent->insert_before(stmt, VecStatement(std::move(evaluated)));\n      stmt->parent->erase(stmt);\n      throw IRModified();\n    }\n  }\n\n  static void run(IRNode *node) {\n    ConstantFold folder;\n    while (true) {\n      bool modified = false;\n      try {\n        node->accept(&folder);\n      } catch (IRModified) {\n        modified = true;\n      }\n      if (!modified)\n        break;\n    }\n  }\n};\n\nnamespace irpass {\n\nvoid constant_fold(IRNode *root) {\n  return ConstantFold::run(root);\n}\n\n}  \/\/ namespace irpass\n\nTLANG_NAMESPACE_END\n<|endoftext|>"}
{"text":"<commit_before>#include <vector>\n#include <algorithm>\n\n#include \"sdl.h\"\n#include \"sdl_image.h\"\n\n#include \"GLCubeSphere.h\"\n\nGLSLShader GLCubeSphere::shader;\n\n\/\/ For std::find\nbool operator ==(const vertex &lhs, const vertex &rhs) { return (lhs.x == rhs.x && lhs.y == rhs.y && lhs.z == rhs.z); }\n\nGLCubeSphere::GLCubeSphere( const int entityID \/*= 0*\/ ) : IGLComponent(entityID) {\n\tthis->drawMode = GL_TRIANGLES;\n\tthis->ElemBufIndex = 2;\n\tthis->ColorBufIndex = 1;\n\tthis->VertBufIndex = 0;\n\tthis->NormalBufIndex = 3;\n}\n\nvoid GLCubeSphere::Initialize() {\n\tsrand(this->GetEntityID());\n\n\tint subdivisions = 5;\n\n\t\/\/ Create the verts to begin refining at.\n\tfloat t = 1.0f;\n\tglm::vec3 coordPair(t, t, t);\n\n\tthis->verts.push_back(vertex(-coordPair.x, -coordPair.y, coordPair.z));\n\tthis->colors.push_back(color(0,1,0));\n\tthis->verts.push_back(vertex(coordPair.x, -coordPair.y, coordPair.z));\n\tthis->colors.push_back(color(0,1,0));\n\tthis->verts.push_back(vertex(coordPair.x, coordPair.y, coordPair.z));\n\tthis->colors.push_back(color(0,1,0));\n\tthis->verts.push_back(vertex(-coordPair.x, coordPair.y, coordPair.z));\n\tthis->colors.push_back(color(0,1,0));\n\tthis->verts.push_back(vertex(-coordPair.x, -coordPair.y, -coordPair.z));\n\tthis->colors.push_back(color(0,1,0));\n\tthis->verts.push_back(vertex(coordPair.x, -coordPair.y, -coordPair.z));\n\tthis->colors.push_back(color(0,1,0));\n\tthis->verts.push_back(vertex(coordPair.x, coordPair.y, -coordPair.z));\n\tthis->colors.push_back(color(0,1,0));\n\tthis->verts.push_back(vertex(-coordPair.x, coordPair.y, -coordPair.z));\n\tthis->colors.push_back(color(0,1,0));\n\n\t\/\/ front\n\tthis->faces.push_back(face(0,1,2));\n\tthis->faces.push_back(face(2,3,0));\n\t\/\/ top\n    this->faces.push_back(face(3,2,6));\n    this->faces.push_back(face(6, 7, 3));\n    \/\/ back\n    this->faces.push_back(face(7, 6, 5));\n    this->faces.push_back(face(5, 4, 7));\n    \/\/ bottom\n    this->faces.push_back(face(4, 5, 1));\n    this->faces.push_back(face(1, 0, 4));\n    \/\/ left\n    this->faces.push_back(face(4, 0, 3));\n    this->faces.push_back(face(3, 7, 4));\n    \/\/ right\n    this->faces.push_back(face(1, 5, 6));\n    this->faces.push_back(face(6, 2, 1));\n\n\tthis->SubDivide(subdivisions);\n\n\tglGenVertexArrays(1, &this->vao); \/\/ Generate the VAO\n\tglBindVertexArray(this->vao); \/\/ Bind the VAO\n\n\tglGenBuffers(1, &this->buffers[this->VertBufIndex]); \t\/\/ Generate the vertex buffer.\n\tglBindBuffer(GL_ARRAY_BUFFER, this->buffers[this->VertBufIndex]); \/\/ Bind the vertex buffer.\n\tglBufferData(GL_ARRAY_BUFFER, sizeof(vertex) * this->verts.size(), &this->verts.front(), GL_STATIC_DRAW); \/\/ Stores the verts in the vertex buffer.\n\tGLint posLocation = glGetAttribLocation(GLCubeSphere::shader.GetProgram(), \"in_Position\"); \/\/ Find the location in the shader where the vertex buffer data will be placed.\n\tglVertexAttribPointer(posLocation, 3, GL_FLOAT, GL_FALSE, 0, 0); \/\/ Tell the VAO the vertex data will be stored at the location we just found.\n\tglEnableVertexAttribArray(posLocation); \/\/ Enable the VAO line for vertex data.\n\n\tglGenBuffers(1, &this->buffers[this->ColorBufIndex]);\n\tglBindBuffer(GL_ARRAY_BUFFER, this->buffers[this->ColorBufIndex]);\n\tglBufferData(GL_ARRAY_BUFFER, sizeof(color) * this->colors.size(), &this->colors.front(), GL_STATIC_DRAW);\n\tGLint colLocation = glGetAttribLocation(GLCubeSphere::shader.GetProgram(), \"in_Color\");\n\tglVertexAttribPointer(colLocation, 3, GL_FLOAT, GL_FALSE, 0, 0);\n\tglEnableVertexAttribArray(colLocation);\n\n\tglGenBuffers(1, &this->buffers[this->ElemBufIndex]); \/\/ Generate the element buffer.\n\tglBindBuffer(GL_ELEMENT_ARRAY_BUFFER, this->buffers[this->ElemBufIndex]); \/\/ Bind the element buffer.\n\tglBufferData(GL_ELEMENT_ARRAY_BUFFER, sizeof(face) * this->faces.size(), &this->faces.front(), GL_STATIC_DRAW); \/\/ Store the faces in the element buffer.\n\n\tglBindVertexArray(0); \/\/ Reset the buffer binding because we are good programmers.\n\n\t\/\/ albedo map\n\tglGenTextures(1, &this->_cubeMap);\n\tglBindTexture(GL_TEXTURE_CUBE_MAP, this->_cubeMap);\n\t\n\tglTexParameteri(GL_TEXTURE_CUBE_MAP,GL_TEXTURE_MAG_FILTER,GL_LINEAR);\n\tglTexParameteri(GL_TEXTURE_CUBE_MAP,GL_TEXTURE_MIN_FILTER,GL_LINEAR);\n\tglTexParameteri(GL_TEXTURE_CUBE_MAP,GL_TEXTURE_WRAP_S,GL_CLAMP_TO_EDGE);\n\tglTexParameteri(GL_TEXTURE_CUBE_MAP,GL_TEXTURE_WRAP_T,GL_CLAMP_TO_EDGE);\n\tglTexParameteri(GL_TEXTURE_CUBE_MAP,GL_TEXTURE_WRAP_R,GL_CLAMP_TO_EDGE);\n\n\t\/\/ There is always six filenames\n\tfor(int i=0; i < 6; i++) {\n\t\tchar filename[100];\n\t\tsprintf_s(filename, \"mars%d.jpg\", i+1);\n\t\tSDL_Surface *img;\n\t\timg = IMG_Load(filename);\n\n\t\tif(img) {\n\t\t\tglTexImage2D(GL_TEXTURE_CUBE_MAP_POSITIVE_X+i,0,GL_RGB,img->w,img->h,0,GL_RGB,GL_UNSIGNED_BYTE,(img->pixels));\n\t\t\tSDL_FreeSurface(img);\n\t\t} else {\n\t\t\tassert(0 && \"Texture file did not load correctly.\");\n\t\t}\n\t}\n\t\n\tglGenerateMipmap(GL_TEXTURE_CUBE_MAP);\n}\n\nvoid GLCubeSphere::SubDivide(int levels) {\n\tstd::vector<face> newFaces;\n\n\t\/\/ Iterate over each face and subdivide it\n\t\/\/ Note: currently produces redundant vertices\n\tfor(std::vector<face>::iterator i = this->faces.begin(); i != this->faces.end(); ++i) {\n\t\tvertex v1(0, 0, 0), v2(0, 0, 0), newVert(0, 0, 0);\n\t\tface newFace(0, 0, 0);\n\n\t\tshort i1, i2, i3;\n\n\t\t\/\/ Split each edge\n\t\tv1 = this->verts[(*i).v1];\n\t\tv2 = this->verts[(*i).v2];\n\n\t\tnewVert.x = (v1.x + v2.x)\/2.0f;\n\t\tnewVert.y = (v1.y + v2.y)\/2.0f;\n\t\tnewVert.z = (v1.z + v2.z)\/2.0f;\n\n\t\t\/\/ See if vertex already exists\n\t\tstd::vector<vertex>::iterator existingVert = std::find(this->verts.begin(), this->verts.end(), newVert);\n\t\tif(existingVert==this->verts.end()) {\n\t\t\ti1 = verts.size();\n\t\t\tthis->verts.push_back(newVert);\n\t\t\tthis->colors.push_back(color(0,1,0));\n\t\t}\n\t\telse {\n\t\t\ti1 = std::distance(this->verts.begin(), existingVert);\n\t\t}\n\n\t\tv1 = this->verts[(*i).v1];\n\t\tv2 = this->verts[(*i).v3];\n\n\t\tnewVert.x = (v1.x + v2.x)\/2.0f;\n\t\tnewVert.y = (v1.y + v2.y)\/2.0f;\n\t\tnewVert.z = (v1.z + v2.z)\/2.0f;\n\n\t\texistingVert = std::find(this->verts.begin(), this->verts.end(), newVert);\n\t\tif(existingVert==this->verts.end()) {\n\t\t\ti2 = this->verts.size();\n\t\t\tthis->verts.push_back(newVert);\n\t\t\tthis->colors.push_back(color(0,1,0));\n\t\t}\n\t\telse {\n\t\t\ti2 = std::distance(this->verts.begin(), existingVert);\n\t\t}\n\n\t\tv1 = this->verts[(*i).v2];\n\t\tv2 = this->verts[(*i).v3];\n\n\t\tnewVert.x = (v1.x + v2.x)\/2.0f;\n\t\tnewVert.y = (v1.y + v2.y)\/2.0f;\n\t\tnewVert.z = (v1.z + v2.z)\/2.0f;\n\n\t\texistingVert = std::find(this->verts.begin(), this->verts.end(), newVert);\n\t\tif(existingVert==verts.end()) {\n\t\t\ti3 = this->verts.size();\n\t\t\tthis->verts.push_back(newVert);\n\t\t\tthis->colors.push_back(color(0,1,0));\n\t\t}\n\t\telse {\n\t\t\ti3 = std::distance(this->verts.begin(), existingVert);\n\t\t}\n\n\t\tnewFace.v1 = (*i).v1;\n\t\tnewFace.v2 = i1;\n\t\tnewFace.v3 = i2;\n\t\tnewFaces.push_back(newFace);\n\n\t\tnewFace.v1 = i1;\n\t\tnewFace.v2 = (*i).v2;\n\t\tnewFace.v3 = i3;\n\t\tnewFaces.push_back(newFace);\n\n\t\tnewFace.v1 = i3;\n\t\tnewFace.v2 = i2;\n\t\tnewFace.v3 = i1;\n\t\tnewFaces.push_back(newFace);\n\n\t\tnewFace.v1 = i2;\n\t\tnewFace.v2 = i3;\n\t\tnewFace.v3 = (*i).v3;\n\t\tnewFaces.push_back(newFace);\n\t}\n\n\tthis->faces = newFaces;\n\n\tif(levels > 1) {\n\t\tthis->SubDivide(levels-1);\n\t}\n}\n\nvoid GLCubeSphere::LoadShader() {\n\tGLCubeSphere::shader.LoadFromFile(GL_VERTEX_SHADER, \"..\\\\..\\\\shaders\\\\cubesphere.vert\");\n\tGLCubeSphere::shader.LoadFromFile(GL_FRAGMENT_SHADER, \"..\\\\..\\\\shaders\\\\cubesphere.frag\");\n\tGLCubeSphere::shader.CreateAndLinkProgram();\n}\n\nvoid GLCubeSphere::Update(glm::mediump_float *view, glm::mediump_float *proj) {\n\tGLCubeSphere::shader.Use();\n\t\n\tthis->Transform().Rotate(0.0f,0.01f,0.0f);\n\n\tglUniform1i(glGetUniformLocation(GLCubeSphere::shader.GetProgram(), \"cubeMap\"), 0);\n\n\tglUniformMatrix4fv(glGetUniformLocation(GLCubeSphere::shader.GetProgram(), \"in_Model\"), 1, GL_FALSE, &this->Transform().ModelMatrix()[0][0]);\n\tglUniformMatrix4fv(glGetUniformLocation(GLCubeSphere::shader.GetProgram(), \"in_View\"), 1, GL_FALSE, view);\n\tglUniformMatrix4fv(glGetUniformLocation(GLCubeSphere::shader.GetProgram(), \"in_Proj\"), 1, GL_FALSE, proj);\n\n\tglBindVertexArray(this->Vao());\n\tglBindBuffer(GL_ELEMENT_ARRAY_BUFFER, this->GetBuffer(this->ElemBufIndex));\n\n\tglActiveTexture(GL_TEXTURE0);\n\tglBindTexture(GL_TEXTURE_CUBE_MAP, this->_cubeMap);\n\n\tfor (int i = 0, cur = this->NumberElements(0), prev = 0; cur != 0; prev = cur, cur = this->NumberElements(++i)) {\n\t\tglDrawElements(this->DrawMode(), cur, GL_UNSIGNED_SHORT, (void*)prev);\n\t}\n\t\n\tglBindBuffer(GL_ELEMENT_ARRAY_BUFFER,0);\n\tglBindVertexArray(0);\n\tglBindTexture(GL_TEXTURE_CUBE_MAP, 0);\n\t\n\tGLCubeSphere::shader.UnUse();\n}<commit_msg>Removed colors from cubesphere<commit_after>#include <vector>\n#include <algorithm>\n\n#include \"sdl.h\"\n#include \"sdl_image.h\"\n\n#include \"GLCubeSphere.h\"\n\nGLSLShader GLCubeSphere::shader;\n\n\/\/ For std::find\nbool operator ==(const vertex &lhs, const vertex &rhs) { return (lhs.x == rhs.x && lhs.y == rhs.y && lhs.z == rhs.z); }\n\nGLCubeSphere::GLCubeSphere( const int entityID \/*= 0*\/ ) : IGLComponent(entityID) {\n\tthis->drawMode = GL_TRIANGLES;\n\tthis->VertBufIndex = 0;\n\tthis->ColorBufIndex = 1;\n\tthis->ElemBufIndex = 2;\n}\n\nvoid GLCubeSphere::Initialize() {\n\tsrand(this->GetEntityID());\n\n\tint subdivisions = 5;\n\n\t\/\/ Create the verts to begin refining at.\n\tfloat t = 1.0f;\n\tglm::vec3 coordPair(t, t, t);\n\n\tthis->verts.push_back(vertex(-coordPair.x, -coordPair.y, coordPair.z));\n\tthis->verts.push_back(vertex(coordPair.x, -coordPair.y, coordPair.z));\n\tthis->verts.push_back(vertex(coordPair.x, coordPair.y, coordPair.z));\n\tthis->verts.push_back(vertex(-coordPair.x, coordPair.y, coordPair.z));\n\tthis->verts.push_back(vertex(-coordPair.x, -coordPair.y, -coordPair.z));\n\tthis->verts.push_back(vertex(coordPair.x, -coordPair.y, -coordPair.z));\n\tthis->verts.push_back(vertex(coordPair.x, coordPair.y, -coordPair.z));\n\tthis->verts.push_back(vertex(-coordPair.x, coordPair.y, -coordPair.z));\n\n\t\/\/ front\n\tthis->faces.push_back(face(0,1,2));\n\tthis->faces.push_back(face(2,3,0));\n\t\/\/ top\n    this->faces.push_back(face(3,2,6));\n    this->faces.push_back(face(6, 7, 3));\n    \/\/ back\n    this->faces.push_back(face(7, 6, 5));\n    this->faces.push_back(face(5, 4, 7));\n    \/\/ bottom\n    this->faces.push_back(face(4, 5, 1));\n    this->faces.push_back(face(1, 0, 4));\n    \/\/ left\n    this->faces.push_back(face(4, 0, 3));\n    this->faces.push_back(face(3, 7, 4));\n    \/\/ right\n    this->faces.push_back(face(1, 5, 6));\n    this->faces.push_back(face(6, 2, 1));\n\n\tthis->SubDivide(subdivisions);\n\n\tglGenVertexArrays(1, &this->vao); \/\/ Generate the VAO\n\tglBindVertexArray(this->vao); \/\/ Bind the VAO\n\n\tglGenBuffers(1, &this->buffers[this->VertBufIndex]); \t\/\/ Generate the vertex buffer.\n\tglBindBuffer(GL_ARRAY_BUFFER, this->buffers[this->VertBufIndex]); \/\/ Bind the vertex buffer.\n\tglBufferData(GL_ARRAY_BUFFER, sizeof(vertex) * this->verts.size(), &this->verts.front(), GL_STATIC_DRAW); \/\/ Stores the verts in the vertex buffer.\n\tGLint posLocation = glGetAttribLocation(GLCubeSphere::shader.GetProgram(), \"in_Position\"); \/\/ Find the location in the shader where the vertex buffer data will be placed.\n\tglVertexAttribPointer(posLocation, 3, GL_FLOAT, GL_FALSE, 0, 0); \/\/ Tell the VAO the vertex data will be stored at the location we just found.\n\tglEnableVertexAttribArray(posLocation); \/\/ Enable the VAO line for vertex data.\n\n\tglGenBuffers(1, &this->buffers[this->ElemBufIndex]); \/\/ Generate the element buffer.\n\tglBindBuffer(GL_ELEMENT_ARRAY_BUFFER, this->buffers[this->ElemBufIndex]); \/\/ Bind the element buffer.\n\tglBufferData(GL_ELEMENT_ARRAY_BUFFER, sizeof(face) * this->faces.size(), &this->faces.front(), GL_STATIC_DRAW); \/\/ Store the faces in the element buffer.\n\n\tglBindVertexArray(0); \/\/ Reset the buffer binding because we are good programmers.\n\n\t\/\/ albedo map\n\tglGenTextures(1, &this->_cubeMap);\n\tglBindTexture(GL_TEXTURE_CUBE_MAP, this->_cubeMap);\n\t\n\tglTexParameteri(GL_TEXTURE_CUBE_MAP,GL_TEXTURE_MAG_FILTER,GL_LINEAR);\n\tglTexParameteri(GL_TEXTURE_CUBE_MAP,GL_TEXTURE_MIN_FILTER,GL_LINEAR);\n\tglTexParameteri(GL_TEXTURE_CUBE_MAP,GL_TEXTURE_WRAP_S,GL_CLAMP_TO_EDGE);\n\tglTexParameteri(GL_TEXTURE_CUBE_MAP,GL_TEXTURE_WRAP_T,GL_CLAMP_TO_EDGE);\n\tglTexParameteri(GL_TEXTURE_CUBE_MAP,GL_TEXTURE_WRAP_R,GL_CLAMP_TO_EDGE);\n\n\t\/\/ There is always six filenames\n\tfor(int i=0; i < 6; i++) {\n\t\tchar filename[100];\n\t\tsprintf_s(filename, \"mars%d.jpg\", i+1);\n\t\tSDL_Surface *img;\n\t\timg = IMG_Load(filename);\n\n\t\tif(img) {\n\t\t\tglTexImage2D(GL_TEXTURE_CUBE_MAP_POSITIVE_X+i,0,GL_RGB,img->w,img->h,0,GL_RGB,GL_UNSIGNED_BYTE,(img->pixels));\n\t\t\tSDL_FreeSurface(img);\n\t\t} else {\n\t\t\tassert(0 && \"Texture file did not load correctly.\");\n\t\t}\n\t}\n\t\n\tglGenerateMipmap(GL_TEXTURE_CUBE_MAP);\n}\n\nvoid GLCubeSphere::SubDivide(int levels) {\n\tstd::vector<face> newFaces;\n\n\t\/\/ Iterate over each face and subdivide it\n\tfor(std::vector<face>::iterator i = this->faces.begin(); i != this->faces.end(); ++i) {\n\t\tvertex v1(0, 0, 0), v2(0, 0, 0), newVert(0, 0, 0);\n\t\tface newFace(0, 0, 0);\n\n\t\tshort i1, i2, i3;\n\n\t\t\/\/ Split each edge\n\t\tv1 = this->verts[(*i).v1];\n\t\tv2 = this->verts[(*i).v2];\n\n\t\tnewVert.x = (v1.x + v2.x)\/2.0f;\n\t\tnewVert.y = (v1.y + v2.y)\/2.0f;\n\t\tnewVert.z = (v1.z + v2.z)\/2.0f;\n\n\t\t\/\/ See if vertex already exists\n\t\tstd::vector<vertex>::iterator existingVert = std::find(this->verts.begin(), this->verts.end(), newVert);\n\t\tif(existingVert==this->verts.end()) {\n\t\t\ti1 = verts.size();\n\t\t\tthis->verts.push_back(newVert);\n\t\t}\n\t\telse {\n\t\t\ti1 = std::distance(this->verts.begin(), existingVert);\n\t\t}\n\n\t\tv1 = this->verts[(*i).v1];\n\t\tv2 = this->verts[(*i).v3];\n\n\t\tnewVert.x = (v1.x + v2.x)\/2.0f;\n\t\tnewVert.y = (v1.y + v2.y)\/2.0f;\n\t\tnewVert.z = (v1.z + v2.z)\/2.0f;\n\n\t\texistingVert = std::find(this->verts.begin(), this->verts.end(), newVert);\n\t\tif(existingVert==this->verts.end()) {\n\t\t\ti2 = this->verts.size();\n\t\t\tthis->verts.push_back(newVert);\n\t\t}\n\t\telse {\n\t\t\ti2 = std::distance(this->verts.begin(), existingVert);\n\t\t}\n\n\t\tv1 = this->verts[(*i).v2];\n\t\tv2 = this->verts[(*i).v3];\n\n\t\tnewVert.x = (v1.x + v2.x)\/2.0f;\n\t\tnewVert.y = (v1.y + v2.y)\/2.0f;\n\t\tnewVert.z = (v1.z + v2.z)\/2.0f;\n\n\t\texistingVert = std::find(this->verts.begin(), this->verts.end(), newVert);\n\t\tif(existingVert==verts.end()) {\n\t\t\ti3 = this->verts.size();\n\t\t\tthis->verts.push_back(newVert);\n\t\t}\n\t\telse {\n\t\t\ti3 = std::distance(this->verts.begin(), existingVert);\n\t\t}\n\n\t\tnewFace.v1 = (*i).v1;\n\t\tnewFace.v2 = i1;\n\t\tnewFace.v3 = i2;\n\t\tnewFaces.push_back(newFace);\n\n\t\tnewFace.v1 = i1;\n\t\tnewFace.v2 = (*i).v2;\n\t\tnewFace.v3 = i3;\n\t\tnewFaces.push_back(newFace);\n\n\t\tnewFace.v1 = i3;\n\t\tnewFace.v2 = i2;\n\t\tnewFace.v3 = i1;\n\t\tnewFaces.push_back(newFace);\n\n\t\tnewFace.v1 = i2;\n\t\tnewFace.v2 = i3;\n\t\tnewFace.v3 = (*i).v3;\n\t\tnewFaces.push_back(newFace);\n\t}\n\n\tthis->faces = newFaces;\n\n\tif(levels > 1) {\n\t\tthis->SubDivide(levels-1);\n\t}\n}\n\nvoid GLCubeSphere::LoadShader() {\n\tGLCubeSphere::shader.LoadFromFile(GL_VERTEX_SHADER, \"..\\\\..\\\\shaders\\\\cubesphere.vert\");\n\tGLCubeSphere::shader.LoadFromFile(GL_FRAGMENT_SHADER, \"..\\\\..\\\\shaders\\\\cubesphere.frag\");\n\tGLCubeSphere::shader.CreateAndLinkProgram();\n}\n\nvoid GLCubeSphere::Update(glm::mediump_float *view, glm::mediump_float *proj) {\n\tGLCubeSphere::shader.Use();\n\t\n\tthis->Transform().Rotate(0.0f,0.01f,0.0f);\n\n\tglUniform1i(glGetUniformLocation(GLCubeSphere::shader.GetProgram(), \"cubeMap\"), 0);\n\n\tglUniformMatrix4fv(glGetUniformLocation(GLCubeSphere::shader.GetProgram(), \"in_Model\"), 1, GL_FALSE, &this->Transform().ModelMatrix()[0][0]);\n\tglUniformMatrix4fv(glGetUniformLocation(GLCubeSphere::shader.GetProgram(), \"in_View\"), 1, GL_FALSE, view);\n\tglUniformMatrix4fv(glGetUniformLocation(GLCubeSphere::shader.GetProgram(), \"in_Proj\"), 1, GL_FALSE, proj);\n\n\tglBindVertexArray(this->Vao());\n\tglBindBuffer(GL_ELEMENT_ARRAY_BUFFER, this->GetBuffer(this->ElemBufIndex));\n\n\tglActiveTexture(GL_TEXTURE0);\n\tglBindTexture(GL_TEXTURE_CUBE_MAP, this->_cubeMap);\n\n\tfor (int i = 0, cur = this->NumberElements(0), prev = 0; cur != 0; prev = cur, cur = this->NumberElements(++i)) {\n\t\tglDrawElements(this->DrawMode(), cur, GL_UNSIGNED_SHORT, (void*)prev);\n\t}\n\t\n\tglBindBuffer(GL_ELEMENT_ARRAY_BUFFER,0);\n\tglBindVertexArray(0);\n\tglBindTexture(GL_TEXTURE_CUBE_MAP, 0);\n\t\n\tGLCubeSphere::shader.UnUse();\n}<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ user.hpp\n\/\/ aegis.cpp\n\/\/\n\/\/ Copyright (c) 2017 Sara W (sara at xandium dot net)\n\/\/\n\/\/ This file is part of aegis.cpp .\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#pragma once\n\n\n#include \"..\/config.hpp\"\n#include \"..\/snowflake.hpp\"\n#include \"attachment.hpp\"\n#include \"embed.hpp\"\n#include \"reaction.hpp\"\n#include <nlohmann\/json.hpp>\n#include <string>\n#include <vector>\n\n\n\nnamespace aegiscpp\n{\n\nclass member;\nclass channel;\n\n\/**\\todo Needs documentation\n*\/\nstruct user\n{\n    bool is_bot() const noexcept\n    {\n        return is_bot;\n    }\n\n    bool is_webhook() const noexcept\n    {\n        return (is_bot) && (discriminator == \"0\" || discriminator == \"0000\");\n    }\n\n    snowflake user_id; \/**<\\todo Needs documentation *\/\n    snowflake guild_id; \/**<\\todo Needs documentation *\/\n    std::string username; \/**<\\todo Needs documentation *\/\n    std::string discriminator; \/**<\\todo Needs documentation *\/\n    std::string avatar; \/**<\\todo Needs documentation *\/\n    bool is_bot = false; \/**<\\todo Needs documentation *\/\n    bool mfa_enabled = false; \/**<\\todo Needs documentation *\/\n    bool verified = false; \/**<\\todo Needs documentation *\/\n};\n\n\/**\\todo Needs documentation\n*\/\ninline void from_json(const nlohmann::json& j, user& m)\n{\n    m.user_id = j[\"id\"];\n    if (j.count(\"guild_id\") && !j[\"guild_id\"].is_null())\n        m.guild_id = j[\"guild_id\"];\n    if (j.count(\"username\") && !j[\"username\"].is_null())\n        m.username = j[\"username\"];\n    if (j.count(\"discriminator\") && !j[\"discriminator\"].is_null())\n        m.discriminator = j[\"discriminator\"];\n    if (j.count(\"avatar\") && !j[\"avatar\"].is_null())\n        m.avatar = j[\"avatar\"];\n    if (j.count(\"bot\") &&  !j[\"bot\"].is_null())\n        m.is_bot = j[\"bot\"];\n    if (j.count(\"mfa_enabled\") && !j[\"mfa_enabled\"].is_null())\n        m.mfa_enabled = j[\"mfa_enabled\"];\n    if (j.count(\"verified\") && !j[\"verified\"].is_null())\n        m.verified = j[\"verified\"];\n}\n\n\/**\\todo Needs documentation\n*\/\ninline void to_json(nlohmann::json& j, const user& m)\n{\n    j[\"id\"] = m.user_id;\n    j[\"guild_id\"] = m.guild_id;\n    j[\"username\"] = m.username;\n    j[\"discriminator\"] = m.discriminator;\n    j[\"bot\"] = m.is_bot;\n    j[\"mfa_enabled\"] = m.mfa_enabled;\n    j[\"verified\"] = m.verified;\n}\n\n}\n\n<commit_msg>Documented user object and improved interface<commit_after>\/\/\n\/\/ user.hpp\n\/\/ aegis.cpp\n\/\/\n\/\/ Copyright (c) 2017 Sara W (sara at xandium dot net)\n\/\/\n\/\/ This file is part of aegis.cpp .\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#pragma once\n\n\n#include \"..\/config.hpp\"\n#include \"..\/snowflake.hpp\"\n#include \"attachment.hpp\"\n#include \"embed.hpp\"\n#include \"reaction.hpp\"\n#include <nlohmann\/json.hpp>\n#include <string>\n#include <vector>\n\n\n\nnamespace aegiscpp\n{\n\nclass member;\nclass channel;\n\n\/\/\/ User object used to store basic details of a user.\nstruct user\n{\n    \/\/\/ Returns whether user is a bot\n    \/**\n     * @returns true if user is a bot\n     *\/\n    bool is_bot() const noexcept\n    {\n        return _is_bot;\n    }\n\n    \/\/\/ Set user bot flag\n    \/**\n     * @param isbot true if user is a bot\n     *\/\n    void is_bot(bool isbot) noexcept\n    {\n        _is_bot = isbot;\n    }\n\n    \/\/\/ Returns whether user is a webhook\n    \/**\n     * @returns true if user is a webhook\n     *\/\n    bool is_webhook() const noexcept\n    {\n        return (_is_bot) && (discriminator == \"0000\" || discriminator == \"0\");\n    }\n\n    snowflake user_id; \/**< snowflake of user *\/\n    snowflake guild_id; \/**< snowflake of guild of the event this user is attached to *\/\n    std::string username; \/**< username of user *\/\n    std::string discriminator; \/**< discriminator of user *\/\n    std::string avatar; \/**< Hash of user's avatar *\/\nprivate:\n    friend void from_json(const nlohmann::json& j, user& m);\n    friend void to_json(nlohmann::json& j, const user& m);\n    bool _is_bot = false;\n    bool mfa_enabled = false;\n    bool verified = false;\n};\n\n\/\/\/ Parse json into user object\n\/**\n * @param j const reference to json object\n * @param m reference to user object\n *\/\ninline void from_json(const nlohmann::json& j, user& m)\n{\n    m.user_id = j[\"id\"];\n    if (j.count(\"guild_id\") && !j[\"guild_id\"].is_null())\n        m.guild_id = j[\"guild_id\"];\n    if (j.count(\"username\") && !j[\"username\"].is_null())\n        m.username = j[\"username\"];\n    if (j.count(\"discriminator\") && !j[\"discriminator\"].is_null())\n        m.discriminator = j[\"discriminator\"];\n    if (j.count(\"avatar\") && !j[\"avatar\"].is_null())\n        m.avatar = j[\"avatar\"];\n    if (j.count(\"bot\") &&  !j[\"bot\"].is_null())\n        m._is_bot = j[\"bot\"];\n    if (j.count(\"mfa_enabled\") && !j[\"mfa_enabled\"].is_null())\n        m.mfa_enabled = j[\"mfa_enabled\"];\n    if (j.count(\"verified\") && !j[\"verified\"].is_null())\n        m.verified = j[\"verified\"];\n}\n\n\/\/\/ Dump user object into json\n\/**\n* @param j reference to json object\n* @param m const reference to user object\n*\/\ninline void to_json(nlohmann::json& j, const user& m)\n{\n    j[\"id\"] = m.user_id;\n    j[\"guild_id\"] = m.guild_id;\n    j[\"username\"] = m.username;\n    j[\"discriminator\"] = m.discriminator;\n    j[\"bot\"] = m._is_bot;\n    j[\"mfa_enabled\"] = m.mfa_enabled;\n    j[\"verified\"] = m.verified;\n}\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <fstream>\n#include <string>\n\ntemplate <typename T>\nstruct Node\n{\n\tNode<T>* leftNode;\n\tNode<T>* rightNode;\n\tT value;\n\n\tNode(int value)\n\t{\n\t\tthis->value = value;\n\t\tleftNode = nullptr;\n\t\trightNode = nullptr;\n\t}\n};\n\ntemplate <typename T>\nclass BinarySearchTree\n{\nprivate:\n\tNode<T>* _root;\n\tvoid destroyTree(Node<T>* node);\n\tvoid insertElement(Node<T>* &node, const T &value);\n\tNode<T>* findElement(const T& value) const;\n\tint _count(const Node<T>* node) const;\n\npublic:\n\tBinarySearchTree();\n\t~BinarySearchTree();\n\n\tT value_() const;\n\tT count() const;\n\tint count() const;\n\t\n\tNode<T>* leftNode_() const;\n\tNode<T>* rightNode_() const;\n\tNode<T>* root() const;\n\n\tvoid insert(const T& value);\n\tbool isFound(const T& value) const;\n\t\n\tvoid infile(std::string filename);\n\tvoid outfile(Node<T>* root, std::ostream& outfile);\n\tvoid out(std::string filename);\n\tvoid paintTree(const Node<T>* node, int level) const;\n};\n\ntemplate <typename T>\nT BinarySearchTree<T>::value_() const\n{\n\treturn _root->value;\n}\n\ntemplate <typename T>\nint BinarySearchTree<T>::_count(const Node<T>* node) const\n{\n\tif (!node)\n\t\treturn 0;\n\telse\n\t\treturn (node->leftNode != 0) + (node->rightNode != 0) + _count(node->leftNode) + _count(node->rightNode);\n}\n\ntemplate <typename T>\nint BinarySearchTree<T>::count() const\n{\n\tif (_root)\n\t\treturn _count(_root) + 1;\n\telse\n\t\treturn 0;\n}\n\ntemplate <typename T>\nNode<T>* BinarySearchTree<T>::root() const\n{\n\treturn _root;\n}\n\n\ntemplate <typename T>\nNode<T>* BinarySearchTree<T>::leftNode_() const\n{\n\treturn _root->leftNode;\n}\n\ntemplate <typename T>\nNode<T>* BinarySearchTree<T>::rightNode_() const\n{\n\treturn _root->rightNode;\n}\n\ntemplate <typename T>\nBinarySearchTree<T>::BinarySearchTree()\n{\n\t_root = nullptr;\n\t_count = 0;\n}\n\ntemplate <typename T>\nvoid BinarySearchTree<T>::destroyTree(Node<T>* node)\n{\n\tif (!node)\n\t\treturn;\n\n\tdestroyTree(node->leftNode);\n\tdestroyTree(node->rightNode);\n\n\tdelete node;\n}\n\ntemplate <typename T>\nBinarySearchTree<T>::~BinarySearchTree()\n{\n\tdestroyTree(_root);\n}\n\ntemplate <typename T>\nvoid BinarySearchTree<T>::insertElement(Node<T>* &node, const T &value)\n{\n\tif (node)\n\t{\n\t\tif (value < node->value)\n\t\t{\n\t\t\tinsertElement(node->leftNode, value);\n\t\t}\n\t\telse if (value > node->value)\n\t\t{\n\t\t\tinsertElement(node->rightNode, value);\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn;\n\t\t}\n\t}\n\telse\n\t{\n\t\tnode = new Node<T>(value);\n\t}\n}\n\ntemplate <typename T>\nvoid BinarySearchTree<T>::insert(const T& value)\n{\n\tinsertElement(_root, value);\n}\n\ntemplate <typename T>\nNode<T>*  BinarySearchTree<T>::findElement(const T& value) const\n{\n\tNode<T> *currNode = _root;\n\n\twhile (currNode)\n\t{\n\t\tif (currNode->value == value)\n\t\t\tbreak;\n\t\telse\n\t\t{\n\t\t\tif (currNode->value < value)\n\t\t\t\tcurrNode = currNode->rightNode;\n\t\t\telse currNode = currNode->leftNode;\n\t\t}\n\t}\n\treturn currNode;\n}\n\ntemplate <typename T>\nbool BinarySearchTree<T>::isFound(const T& value) const\n{\n\tNode<T> *retNode = findElement(value);\n\tif (retNode) \n\t\treturn true;\n\telse   \n\t\treturn false;\n}\n\ntemplate <typename T>\nvoid BinarySearchTree<T>::infile(std::string filename)\n{\n\tstd::ifstream infile;\n\tinfile.open(filename);\n\tT value;\n\tint count;\n\tinfile >> count;\n\n\twhile (count--)\n\t{\n\t\tinfile >> value;\n\t\tinsertElement(value);\n\t}\n\n\tinfile.close();\n}\n\ntemplate <typename T>\nvoid BinarySearchTree<T>::outfile(Node<T>* root, std::ostream& ofile)\n{\n\tif (!root)\n\t\treturn;\n\n\telse\n\t{\n\t\tofile << root->value << \"\\t\";\n\t\toutfile(root->rightNode, ofile);\n\t\toutfile(root->leftNode, ofile);\n\t}\n}\n\ntemplate <typename T>\nvoid BinarySearchTree<T>::out(std::string filename)\n{\n\tNode<T>* root;\n\tstd::ofstream ofile(filename);\n\n\tif (!ofile)\n\t\tstd::cout << \"Error! Please, try again!\" << std::endl;\n\telse\n\t\tout(root, ofile);\n\tofile.close();\n}\n\ntemplate <typename T>\nvoid BinarySearchTree<T>::paintTree(const Node<T>* node, int level) const\n{\n\tif (node)\n\t{\n\t\tpaintTree(node->rightNode, level++);\n\n\t\tfor (int i = 0; i < level; i++)\n\t\t{\n\t\t\tstd::cout << \"-\";\n\t\t}\t\n\n\t\tstd::cout << node->value << std::endl;\n\t\tpaintTree(node->leftNode, level++);\n\t}\n}\n<commit_msg>Update binary_search_tree.hpp<commit_after>#include <iostream>\n#include <fstream>\n#include <string>\n\ntemplate <typename T>\nstruct Node\n{\n\tNode<T>* leftNode;\n\tNode<T>* rightNode;\n\tT value;\n\n\tNode(int value)\n\t{\n\t\tthis->value = value;\n\t\tleftNode = nullptr;\n\t\trightNode = nullptr;\n\t}\n};\n\ntemplate <typename T>\nclass BinarySearchTree\n{\nprivate:\n\tNode<T>* _root;\n\tvoid destroyTree(Node<T>* node);\n\tvoid insertElement(Node<T>* &node, const T &value);\n\tNode<T>* findElement(const T& value) const;\n\tint _count(const Node<T>* node) const;\n\npublic:\n\tBinarySearchTree();\n\t~BinarySearchTree();\n\n\tT value_() const;\n\tint count() const;\n\t\n\tNode<T>* leftNode_() const;\n\tNode<T>* rightNode_() const;\n\tNode<T>* root() const;\n\n\tvoid insert(const T& value);\n\tbool isFound(const T& value) const;\n\t\n\tvoid infile(std::string filename);\n\tvoid outfile(Node<T>* root, std::ostream& outfile);\n\tvoid out(std::string filename);\n\tvoid paintTree(const Node<T>* node, int level) const;\n};\n\ntemplate <typename T>\nT BinarySearchTree<T>::value_() const\n{\n\treturn _root->value;\n}\n\ntemplate <typename T>\nint BinarySearchTree<T>::_count(const Node<T>* node) const\n{\n\tif (!node)\n\t\treturn 0;\n\telse\n\t\treturn (node->leftNode != 0) + (node->rightNode != 0) + _count(node->leftNode) + _count(node->rightNode);\n}\n\ntemplate <typename T>\nint BinarySearchTree<T>::count() const\n{\n\tif (_root)\n\t\treturn _count(_root) + 1;\n\telse\n\t\treturn 0;\n}\n\ntemplate <typename T>\nNode<T>* BinarySearchTree<T>::root() const\n{\n\treturn _root;\n}\n\n\ntemplate <typename T>\nNode<T>* BinarySearchTree<T>::leftNode_() const\n{\n\treturn _root->leftNode;\n}\n\ntemplate <typename T>\nNode<T>* BinarySearchTree<T>::rightNode_() const\n{\n\treturn _root->rightNode;\n}\n\ntemplate <typename T>\nBinarySearchTree<T>::BinarySearchTree()\n{\n\t_root = nullptr;\n\t_count = 0;\n}\n\ntemplate <typename T>\nvoid BinarySearchTree<T>::destroyTree(Node<T>* node)\n{\n\tif (!node)\n\t\treturn;\n\n\tdestroyTree(node->leftNode);\n\tdestroyTree(node->rightNode);\n\n\tdelete node;\n}\n\ntemplate <typename T>\nBinarySearchTree<T>::~BinarySearchTree()\n{\n\tdestroyTree(_root);\n}\n\ntemplate <typename T>\nvoid BinarySearchTree<T>::insertElement(Node<T>* &node, const T &value)\n{\n\tif (node)\n\t{\n\t\tif (value < node->value)\n\t\t{\n\t\t\tinsertElement(node->leftNode, value);\n\t\t}\n\t\telse if (value > node->value)\n\t\t{\n\t\t\tinsertElement(node->rightNode, value);\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn;\n\t\t}\n\t}\n\telse\n\t{\n\t\tnode = new Node<T>(value);\n\t}\n}\n\ntemplate <typename T>\nvoid BinarySearchTree<T>::insert(const T& value)\n{\n\tinsertElement(_root, value);\n}\n\ntemplate <typename T>\nNode<T>*  BinarySearchTree<T>::findElement(const T& value) const\n{\n\tNode<T> *currNode = _root;\n\n\twhile (currNode)\n\t{\n\t\tif (currNode->value == value)\n\t\t\tbreak;\n\t\telse\n\t\t{\n\t\t\tif (currNode->value < value)\n\t\t\t\tcurrNode = currNode->rightNode;\n\t\t\telse currNode = currNode->leftNode;\n\t\t}\n\t}\n\treturn currNode;\n}\n\ntemplate <typename T>\nbool BinarySearchTree<T>::isFound(const T& value) const\n{\n\tNode<T> *retNode = findElement(value);\n\tif (retNode) \n\t\treturn true;\n\telse   \n\t\treturn false;\n}\n\ntemplate <typename T>\nvoid BinarySearchTree<T>::infile(std::string filename)\n{\n\tstd::ifstream infile;\n\tinfile.open(filename);\n\tT value;\n\tint count;\n\tinfile >> count;\n\n\twhile (count--)\n\t{\n\t\tinfile >> value;\n\t\tinsertElement(value);\n\t}\n\n\tinfile.close();\n}\n\ntemplate <typename T>\nvoid BinarySearchTree<T>::outfile(Node<T>* root, std::ostream& ofile)\n{\n\tif (!root)\n\t\treturn;\n\n\telse\n\t{\n\t\tofile << root->value << \"\\t\";\n\t\toutfile(root->rightNode, ofile);\n\t\toutfile(root->leftNode, ofile);\n\t}\n}\n\ntemplate <typename T>\nvoid BinarySearchTree<T>::out(std::string filename)\n{\n\tNode<T>* root;\n\tstd::ofstream ofile(filename);\n\n\tif (!ofile)\n\t\tstd::cout << \"Error! Please, try again!\" << std::endl;\n\telse\n\t\tout(root, ofile);\n\tofile.close();\n}\n\ntemplate <typename T>\nvoid BinarySearchTree<T>::paintTree(const Node<T>* node, int level) const\n{\n\tif (node)\n\t{\n\t\tpaintTree(node->rightNode, level++);\n\n\t\tfor (int i = 0; i < level; i++)\n\t\t{\n\t\t\tstd::cout << \"-\";\n\t\t}\t\n\n\t\tstd::cout << node->value << std::endl;\n\t\tpaintTree(node->leftNode, level++);\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"ConfigBasedDataPipeline.hpp\"\n\n#include <random>  \/\/ for std::mt19937\n#include <chrono>  \/\/ for random seed\n#include \"json\/gason.h\"\n\n#include \"Config.hpp\"\n#include \"Utils.hpp\"\n#include \"opencl\/Context.hpp\"\n\nconst char *const layer_parameters_key[3] = {\"layer1\", \"layer2\", \"layer3\"};\n\nnamespace cnn_sr {\n\nConfigBasedDataPipeline::ConfigBasedDataPipeline(Config &cfg,\n                                                 opencl::Context *context)\n    : DataPipeline(context),\n      _config(&cfg),\n      layer_data_1(1, cfg.n1, cfg.f1),\n      layer_data_2(cfg.n1, cfg.n2, cfg.f2),\n      layer_data_3(cfg.n2, 1, cfg.f3) {}\n\nvoid ConfigBasedDataPipeline::init(int load_flags) {\n  \/\/ init weights\/bias\n  if (_config->parameters_file && strlen(_config->parameters_file) > 0) {\n    std::cout << \"Loading layer parameters from: '\" << _config->parameters_file\n              << \"'\" << std::endl;\n    load_parameters_file(_config->parameters_file);\n  } else {\n    std::cout\n        << \"No parameters file provided, initializing random weights and biases\"\n        << std::endl;\n    fill_random_parameters(layer_data_1, _config->params_distr_1);\n    fill_random_parameters(layer_data_2, _config->params_distr_2);\n    fill_random_parameters(layer_data_3, _config->params_distr_3);\n  }\n\n  load_kernels(load_flags);\n  _initialized = true;\n\n  std::cout << layer_data_1 << std::endl;\n  std::cout << layer_data_2 << std::endl;\n  std::cout << layer_data_3 << std::endl;\n  LayerData::validate(layer_data_1);\n  LayerData::validate(layer_data_2);\n  LayerData::validate(layer_data_3);\n}\n\nvoid ConfigBasedDataPipeline::fill_random_parameters(\n    LayerData &data, ParametersDistribution &distr) {\n  unsigned seed = std::chrono::system_clock::now().time_since_epoch().count();\n  std::default_random_engine generator(seed);\n  std::normal_distribution<float> rand_generator_w(distr.mean_w, distr.sd_w);\n  std::normal_distribution<float> rand_generator_b(distr.mean_b, distr.sd_b);\n\n  for (size_t i = 0; i < data.weight_size(); i++) {\n    data.weights.push_back(rand_generator_w(generator));\n  }\n  for (size_t i = 0; i < data.bias_size(); i++) {\n    data.bias.push_back(rand_generator_b(generator));\n  }\n}\n\nvoid load_layer_parameters(JsonNode *node, LayerData &data) {\n  for (auto subnode : node->value) {\n    JSON_READ_NUM_ARRAY(subnode, data, weights);\n    JSON_READ_NUM_ARRAY(subnode, data, bias);\n  }\n}\n\nvoid ConfigBasedDataPipeline::load_parameters_file(\n    const char *const file_path) {\n  JsonValue value;\n  JsonAllocator allocator;\n  std::string source;\n  utils::read_json_file(file_path, value, allocator, source, JSON_OBJECT);\n\n  for (auto node : value) {\n    auto key = node->key;\n    \/\/ std::cout << key << std::endl;\n\n    if (strcmp(key, layer_parameters_key[0]) == 0) {\n      load_layer_parameters(node, layer_data_1);\n    } else if (strcmp(key, layer_parameters_key[1]) == 0) {\n      load_layer_parameters(node, layer_data_2);\n    } else if (strcmp(key, layer_parameters_key[2]) == 0) {\n      load_layer_parameters(node, layer_data_3);\n    } else {\n      std::cout << \"[Warning] Unknown key '\" << key\n                << \"' in parameters file, only: '\"    \/\/\n                << layer_parameters_key[0] << \"', '\"  \/\/\n                << layer_parameters_key[1] << \"', '\"  \/\/\n                << layer_parameters_key[2] << \"' are allowed\" << std::endl;\n    }\n  }\n}\n\nvoid ConfigBasedDataPipeline::load_kernels(int load_flags) {\n  \/\/ call super\n  DataPipeline::load_kernels(load_flags);\n\n  bool load_layers = (load_flags & DataPipeline::LOAD_KERNEL_LAYERS) != 0,\n       load_backp = (load_flags & DataPipeline::LOAD_KERNEL_BACKPROPAGATE) != 0;\n\n  if (load_layers) {\n    \/* clang-format off *\/\n    if (!_layer_1_kernel) _layer_1_kernel = create_layer_kernel(layer_data_1);\n    if (!_layer_2_kernel) _layer_2_kernel = create_layer_kernel(layer_data_2);\n    if (!_layer_3_kernel) _layer_3_kernel = create_layer_kernel(layer_data_3, 255);\n    \/* clang-format on *\/\n  }\n\n  if (load_backp) {\n    \/* clang-format off *\/\n    if (!_layer_1_deltas_kernel) _layer_1_deltas_kernel = create_deltas_kernel(layer_data_1);\n    if (!_layer_2_deltas_kernel) _layer_2_deltas_kernel = create_deltas_kernel(layer_data_2);\n\n    if (!_layer_1_backpropagate_kernel)\n      _layer_1_backpropagate_kernel = create_backpropagation_kernel(layer_data_1);\n    if (!_layer_2_backpropagate_kernel)\n      _layer_2_backpropagate_kernel = create_backpropagation_kernel(layer_data_2);\n    if (!_layer_3_backpropagate_kernel)\n      _layer_3_backpropagate_kernel = create_backpropagation_kernel(layer_data_3);\n    \/* clang-format on *\/\n  }\n}\n\ncl_event ConfigBasedDataPipeline::forward(\n    cnn_sr::CnnLayerGpuAllocationPool &layer_1_alloc,\n    cnn_sr::CnnLayerGpuAllocationPool &layer_2_alloc,\n    cnn_sr::CnnLayerGpuAllocationPool &layer_3_alloc,\n    opencl::MemoryHandle input, size_t input_w, size_t input_h,\n    bool subtract_input_mean, cl_event *ev_to_wait_for) {\n  \/\/\n  check_initialized(DataPipeline::LOAD_KERNEL_LAYERS);\n  size_t l1_output_dim[2], l2_output_dim[2];\n  layer_data_1.get_output_dimensions(l1_output_dim, input_w, input_h);\n  layer_data_2.get_output_dimensions(l2_output_dim, l1_output_dim[0],\n                                     l1_output_dim[1]);\n\n  _context->block();\n\n  cl_event ev;\n  if (subtract_input_mean) {\n    std::cout << \"### Subtracting mean from input\" << std::endl;\n    ev = this->subtract_mean(input, ev_to_wait_for);\n    ev_to_wait_for = &ev;\n  }\n\n  _context->block();\n\n  \/\/ layer 1\n  std::cout << \"### Executing layer 1\" << std::endl;\n  cl_event finish_token1 =\n      execute_layer(*_layer_1_kernel, layer_data_1, layer_1_alloc,  \/\/ layer cfg\n                    input, input_w, input_h,                        \/\/ input\n                    ev_to_wait_for);\n  _context->block();\n\n  \/\/ layer 2\n  std::cout << \"### Executing layer 2\" << std::endl;\n  cl_event finish_token2 = execute_layer(\n      *_layer_2_kernel, layer_data_2, layer_2_alloc,             \/\/ layer cfg\n      layer_1_alloc.output, l1_output_dim[0], l1_output_dim[1],  \/\/ input\n      &finish_token1);\n  _context->block();\n\n  \/\/ layer 3\n  std::cout << \"### Executing layer 3\" << std::endl;\n  cl_event finish_token3 = execute_layer(\n      *_layer_3_kernel, layer_data_3, layer_3_alloc,             \/\/ layer cfg\n      layer_2_alloc.output, l2_output_dim[0], l2_output_dim[1],  \/\/ input\n      &finish_token2);\n  _context->block();\n\n  return finish_token3;\n}\n\ncl_event ConfigBasedDataPipeline::backpropagate(\n    cnn_sr::CnnLayerGpuAllocationPool &layer_1_alloc,\n    cnn_sr::CnnLayerGpuAllocationPool &layer_2_alloc,\n    cnn_sr::CnnLayerGpuAllocationPool &layer_3_alloc,\n    opencl::MemoryHandle cnn_input,\n    opencl::MemoryHandle gpu_buf_ground_truth,  \/\/\n    size_t ground_truth_w, size_t ground_truth_h, cl_event *ev_to_wait_for) {\n  \/\/ dimensions\n  size_t layer_1_out_dim[2], layer_2_out_dim[2], layer_3_out_dim[2];\n  layer_data_1.get_output_dimensions(layer_1_out_dim,  \/\/\n                                     ground_truth_w, ground_truth_h);\n  layer_data_2.get_output_dimensions(layer_2_out_dim,  \/\/\n                                     layer_1_out_dim[0], layer_1_out_dim[1]);\n  layer_data_3.get_output_dimensions(layer_3_out_dim,  \/\/\n                                     layer_2_out_dim[0], layer_2_out_dim[1]);\n\n  \/\/ step 1 weight decay\n  std::cout << \"### Calculating weight decay\" << std::endl;\n  auto weight_decay_value =\n      weight_decay(layer_1_alloc, layer_2_alloc, layer_3_alloc,\n                   _config->weight_decay_parameter, ev_to_wait_for);\n\n  \/\/ step 2 deltas\n  std::cout << \"### Calculating deltas for last layer\" << std::endl;\n  auto event2_1 = last_layer_delta(gpu_buf_ground_truth,  \/\/\n                                   layer_3_alloc.output,  \/\/\n                                   layer_3_alloc.deltas,  \/\/\n                                   weight_decay_value,    \/\/\n                                   ground_truth_w, ground_truth_h);\n\n  std::cout << \"### Calculating deltas for 2nd layer\" << std::endl;\n  auto event2_2 = calculate_deltas(*_layer_2_deltas_kernel,                 \/\/\n                                   layer_data_2, layer_data_3,              \/\/\n                                   layer_2_alloc, layer_3_alloc,            \/\/\n                                   layer_3_out_dim[0], layer_3_out_dim[1],  \/\/\n                                   &event2_1);\n\n  std::cout << \"### Calculating deltas for 1nd layer\" << std::endl;\n  auto event2_3 = calculate_deltas(*_layer_1_deltas_kernel,                 \/\/\n                                   layer_data_1, layer_data_2,              \/\/\n                                   layer_1_alloc, layer_2_alloc,            \/\/\n                                   layer_2_out_dim[0], layer_2_out_dim[1],  \/\/\n                                   &event2_2);\n\n  _context->block();\n\n  \/\/ step 3 backpropagate: calculate gradient w, gradient b for all layers\n  \/\/ TODO might as well run all in parallel\n  std::cout << \"### Backpropagate(weights&bias gradients) - 3rd layer\"\n            << std::endl;\n  auto event3_1 =\n      DataPipeline::backpropagate(*_layer_3_backpropagate_kernel,          \/\/\n                                  layer_data_3,                            \/\/\n                                  layer_2_alloc.output, layer_3_alloc,     \/\/\n                                  layer_3_out_dim[0], layer_3_out_dim[1],  \/\/\n                                  &event2_3);\n  std::cout << \"### Backpropagate(weights&bias gradients) - 2nd layer\"\n            << std::endl;\n  auto event3_2 =\n      DataPipeline::backpropagate(*_layer_2_backpropagate_kernel,          \/\/\n                                  layer_data_2,                            \/\/\n                                  layer_1_alloc.output, layer_2_alloc,     \/\/\n                                  layer_2_out_dim[0], layer_2_out_dim[1],  \/\/\n                                  &event3_1);\n\n  std::cout << \"### Backpropagate(weights&bias gradients) - 1st layer\"\n            << std::endl;\n  auto event3_3 =\n      DataPipeline::backpropagate(*_layer_1_backpropagate_kernel,          \/\/\n                                  layer_data_1,                            \/\/\n                                  cnn_input, layer_1_alloc,                \/\/\n                                  layer_1_out_dim[0], layer_1_out_dim[1],  \/\/\n                                  &event3_2);\n\n  _context->block();\n\n  \/\/ step 4 update weights and biases\n  \/\/ TODO might as well run all in parallel\n  std::cout << \"### Updating weights and biases - 3rd layer\" << std::endl;\n  auto event4_1 =\n      update_parameters(layer_data_3, layer_3_alloc, _config->momentum,\n                        _config->learning_rate[2], &event3_3);\n\n  std::cout << \"### Updating weights and biases - 2nd layer\" << std::endl;\n  auto event4_2 =\n      update_parameters(layer_data_2, layer_2_alloc, _config->momentum,\n                        _config->learning_rate[1], &event4_1);\n\n  std::cout << \"### Updating weights and biases - 1st layer\" << std::endl;\n  auto event4_3 =\n      update_parameters(layer_data_1, layer_1_alloc, _config->momentum,\n                        _config->learning_rate[0], &event4_2);\n\n  _context->block();\n  return event4_3;\n}\n\ncl_event ConfigBasedDataPipeline::mean_squared_error(\n    opencl::MemoryHandle gpu_buf_ground_truth,\n    opencl::MemoryHandle gpu_buf_algo_res,\n    opencl::MemoryHandle &gpu_buf_target,  \/\/\n    size_t ground_truth_w, size_t ground_truth_h, cl_event *ev_to_wait_for) {\n  \/\/\n  size_t padding = layer_data_1.f_spatial_size + layer_data_2.f_spatial_size +\n                   layer_data_3.f_spatial_size - 3;\n  return DataPipeline::mean_squared_error(\n      gpu_buf_ground_truth, gpu_buf_algo_res, gpu_buf_target, ground_truth_w,\n      ground_truth_h, padding, ev_to_wait_for);\n}\n\ncl_event ConfigBasedDataPipeline::last_layer_delta(\n    opencl::MemoryHandle gpu_buf_ground_truth,\n    opencl::MemoryHandle gpu_buf_algo_res, opencl::MemoryHandle &gpu_buf_target,\n    float weight_decay,  \/\/\n    size_t ground_truth_w, size_t ground_truth_h, cl_event *ev) {\n  \/\/\n  size_t padding = layer_data_1.f_spatial_size + layer_data_2.f_spatial_size +\n                   layer_data_3.f_spatial_size - 3;\n  return DataPipeline::last_layer_delta(\n      gpu_buf_ground_truth, gpu_buf_algo_res, gpu_buf_target, weight_decay,\n      ground_truth_w, ground_truth_h, padding, ev);\n}\n}\n<commit_msg>Main script finishes whole cnn pipeline<commit_after>#include \"ConfigBasedDataPipeline.hpp\"\n\n#include <random>  \/\/ for std::mt19937\n#include <chrono>  \/\/ for random seed\n#include \"json\/gason.h\"\n\n#include \"Config.hpp\"\n#include \"Utils.hpp\"\n#include \"opencl\/Context.hpp\"\n\nconst char *const layer_parameters_key[3] = {\"layer1\", \"layer2\", \"layer3\"};\n\nnamespace cnn_sr {\n\nConfigBasedDataPipeline::ConfigBasedDataPipeline(Config &cfg,\n                                                 opencl::Context *context)\n    : DataPipeline(context),\n      _config(&cfg),\n      layer_data_1(1, cfg.n1, cfg.f1),\n      layer_data_2(cfg.n1, cfg.n2, cfg.f2),\n      layer_data_3(cfg.n2, 1, cfg.f3) {}\n\nvoid ConfigBasedDataPipeline::init(int load_flags) {\n  \/\/ init weights\/bias\n  if (_config->parameters_file && strlen(_config->parameters_file) > 0) {\n    std::cout << \"Loading layer parameters from: '\" << _config->parameters_file\n              << \"'\" << std::endl;\n    load_parameters_file(_config->parameters_file);\n  } else {\n    std::cout\n        << \"No parameters file provided, initializing random weights and biases\"\n        << std::endl;\n    fill_random_parameters(layer_data_1, _config->params_distr_1);\n    fill_random_parameters(layer_data_2, _config->params_distr_2);\n    fill_random_parameters(layer_data_3, _config->params_distr_3);\n  }\n\n  load_kernels(load_flags);\n  _initialized = true;\n\n  std::cout << layer_data_1 << std::endl;\n  std::cout << layer_data_2 << std::endl;\n  std::cout << layer_data_3 << std::endl;\n  LayerData::validate(layer_data_1);\n  LayerData::validate(layer_data_2);\n  LayerData::validate(layer_data_3);\n}\n\nvoid ConfigBasedDataPipeline::fill_random_parameters(\n    LayerData &data, ParametersDistribution &distr) {\n  unsigned seed = std::chrono::system_clock::now().time_since_epoch().count();\n  std::default_random_engine generator(seed);\n  std::normal_distribution<float> rand_generator_w(distr.mean_w, distr.sd_w);\n  std::normal_distribution<float> rand_generator_b(distr.mean_b, distr.sd_b);\n\n  for (size_t i = 0; i < data.weight_size(); i++) {\n    data.weights.push_back(rand_generator_w(generator));\n  }\n  for (size_t i = 0; i < data.bias_size(); i++) {\n    data.bias.push_back(rand_generator_b(generator));\n  }\n}\n\nvoid load_layer_parameters(JsonNode *node, LayerData &data) {\n  for (auto subnode : node->value) {\n    JSON_READ_NUM_ARRAY(subnode, data, weights);\n    JSON_READ_NUM_ARRAY(subnode, data, bias);\n  }\n}\n\nvoid ConfigBasedDataPipeline::load_parameters_file(\n    const char *const file_path) {\n  JsonValue value;\n  JsonAllocator allocator;\n  std::string source;\n  utils::read_json_file(file_path, value, allocator, source, JSON_OBJECT);\n\n  for (auto node : value) {\n    auto key = node->key;\n    \/\/ std::cout << key << std::endl;\n\n    if (strcmp(key, layer_parameters_key[0]) == 0) {\n      load_layer_parameters(node, layer_data_1);\n    } else if (strcmp(key, layer_parameters_key[1]) == 0) {\n      load_layer_parameters(node, layer_data_2);\n    } else if (strcmp(key, layer_parameters_key[2]) == 0) {\n      load_layer_parameters(node, layer_data_3);\n    } else {\n      std::cout << \"[Warning] Unknown key '\" << key\n                << \"' in parameters file, only: '\"    \/\/\n                << layer_parameters_key[0] << \"', '\"  \/\/\n                << layer_parameters_key[1] << \"', '\"  \/\/\n                << layer_parameters_key[2] << \"' are allowed\" << std::endl;\n    }\n  }\n}\n\nvoid ConfigBasedDataPipeline::load_kernels(int load_flags) {\n  \/\/ call super\n  DataPipeline::load_kernels(load_flags);\n\n  bool load_layers = (load_flags & DataPipeline::LOAD_KERNEL_LAYERS) != 0,\n       load_backp = (load_flags & DataPipeline::LOAD_KERNEL_BACKPROPAGATE) != 0;\n\n  if (load_layers) {\n    \/* clang-format off *\/\n    if (!_layer_1_kernel) _layer_1_kernel = create_layer_kernel(layer_data_1);\n    if (!_layer_2_kernel) _layer_2_kernel = create_layer_kernel(layer_data_2);\n    if (!_layer_3_kernel) _layer_3_kernel = create_layer_kernel(layer_data_3, 255);\n    \/* clang-format on *\/\n  }\n\n  if (load_backp) {\n    \/* clang-format off *\/\n    if (!_layer_1_deltas_kernel) _layer_1_deltas_kernel = create_deltas_kernel(layer_data_1);\n    if (!_layer_2_deltas_kernel) _layer_2_deltas_kernel = create_deltas_kernel(layer_data_2);\n\n    if (!_layer_1_backpropagate_kernel)\n      _layer_1_backpropagate_kernel = create_backpropagation_kernel(layer_data_1);\n    if (!_layer_2_backpropagate_kernel)\n      _layer_2_backpropagate_kernel = create_backpropagation_kernel(layer_data_2);\n    if (!_layer_3_backpropagate_kernel)\n      _layer_3_backpropagate_kernel = create_backpropagation_kernel(layer_data_3);\n    \/* clang-format on *\/\n  }\n}\n\ncl_event ConfigBasedDataPipeline::forward(\n    cnn_sr::CnnLayerGpuAllocationPool &layer_1_alloc,\n    cnn_sr::CnnLayerGpuAllocationPool &layer_2_alloc,\n    cnn_sr::CnnLayerGpuAllocationPool &layer_3_alloc,\n    opencl::MemoryHandle input, size_t input_w, size_t input_h,\n    bool subtract_input_mean, cl_event *ev_to_wait_for) {\n  \/\/\n  check_initialized(DataPipeline::LOAD_KERNEL_LAYERS);\n  size_t l1_output_dim[2], l2_output_dim[2];\n  layer_data_1.get_output_dimensions(l1_output_dim, input_w, input_h);\n  layer_data_2.get_output_dimensions(l2_output_dim, l1_output_dim[0],\n                                     l1_output_dim[1]);\n\n  _context->block();\n\n  cl_event ev;\n  if (subtract_input_mean) {\n    std::cout << \"### Subtracting mean from input\" << std::endl;\n    ev = this->subtract_mean(input, ev_to_wait_for);\n    ev_to_wait_for = &ev;\n  }\n\n  _context->block();\n\n  \/\/ layer 1\n  std::cout << \"### Executing layer 1\" << std::endl;\n  cl_event finish_token1 =\n      execute_layer(*_layer_1_kernel, layer_data_1, layer_1_alloc,  \/\/ layer cfg\n                    input, input_w, input_h,                        \/\/ input\n                    ev_to_wait_for);\n  _context->block();\n\n  \/\/ layer 2\n  std::cout << \"### Executing layer 2\" << std::endl;\n  cl_event finish_token2 = execute_layer(\n      *_layer_2_kernel, layer_data_2, layer_2_alloc,             \/\/ layer cfg\n      layer_1_alloc.output, l1_output_dim[0], l1_output_dim[1],  \/\/ input\n      &finish_token1);\n  _context->block();\n\n  \/\/ layer 3\n  std::cout << \"### Executing layer 3\" << std::endl;\n  cl_event finish_token3 = execute_layer(\n      *_layer_3_kernel, layer_data_3, layer_3_alloc,             \/\/ layer cfg\n      layer_2_alloc.output, l2_output_dim[0], l2_output_dim[1],  \/\/ input\n      &finish_token2);\n  _context->block();\n\n  return finish_token3;\n}\n\ncl_event ConfigBasedDataPipeline::backpropagate(\n    cnn_sr::CnnLayerGpuAllocationPool &layer_1_alloc,\n    cnn_sr::CnnLayerGpuAllocationPool &layer_2_alloc,\n    cnn_sr::CnnLayerGpuAllocationPool &layer_3_alloc,\n    opencl::MemoryHandle cnn_input,\n    opencl::MemoryHandle gpu_buf_ground_truth,  \/\/\n    size_t ground_truth_w, size_t ground_truth_h, cl_event *ev_to_wait_for) {\n  \/\/ dimensions\n  size_t layer_1_out_dim[2], layer_2_out_dim[2], layer_3_out_dim[2];\n  layer_data_1.get_output_dimensions(layer_1_out_dim,  \/\/\n                                     ground_truth_w, ground_truth_h);\n  layer_data_2.get_output_dimensions(layer_2_out_dim,  \/\/\n                                     layer_1_out_dim[0], layer_1_out_dim[1]);\n  layer_data_3.get_output_dimensions(layer_3_out_dim,  \/\/\n                                     layer_2_out_dim[0], layer_2_out_dim[1]);\n\n  \/\/ step 1 weight decay\n  std::cout << \"### Calculating weight decay\" << std::endl;\n  auto weight_decay_value =\n      weight_decay(layer_1_alloc, layer_2_alloc, layer_3_alloc,\n                   _config->weight_decay_parameter, ev_to_wait_for);\n\n  \/\/ step 2 deltas\n  std::cout << \"### Calculating deltas for last layer\" << std::endl;\n  auto event2_1 = last_layer_delta(gpu_buf_ground_truth,  \/\/\n                                   layer_3_alloc.output,  \/\/\n                                   layer_3_alloc.deltas,  \/\/\n                                   weight_decay_value,    \/\/\n                                   ground_truth_w, ground_truth_h);\n\n  std::cout << \"### Calculating deltas for 2nd layer\" << std::endl;\n  auto event2_2 = calculate_deltas(*_layer_2_deltas_kernel,                 \/\/\n                                   layer_data_2, layer_data_3,              \/\/\n                                   layer_2_alloc, layer_3_alloc,            \/\/\n                                   layer_3_out_dim[0], layer_3_out_dim[1],  \/\/\n                                   &event2_1);\n\n  std::cout << \"### Calculating deltas for 1nd layer\" << std::endl;\n  auto event2_3 = calculate_deltas(*_layer_1_deltas_kernel,                 \/\/\n                                   layer_data_1, layer_data_2,              \/\/\n                                   layer_1_alloc, layer_2_alloc,            \/\/\n                                   layer_2_out_dim[0], layer_2_out_dim[1],  \/\/\n                                   &event2_2);\n\n  _context->block();\n\n  \/\/ step 3 backpropagate: calculate gradient w, gradient b for all layers\n  \/\/ TODO might as well run all in parallel\n  std::cout << \"### Backpropagate(weights&bias gradients) - 3rd layer\"\n            << std::endl;\n  auto event3_1 =\n      DataPipeline::backpropagate2(layer_data_3,                            \/\/\n                                   layer_2_alloc.output, layer_3_alloc,     \/\/\n                                   layer_3_out_dim[0], layer_3_out_dim[1],  \/\/\n                                   &event2_3);\n  std::cout << \"### Backpropagate(weights&bias gradients) - 2nd layer\"\n            << std::endl;\n  auto event3_2 =\n      DataPipeline::backpropagate2(layer_data_2,                            \/\/\n                                   layer_1_alloc.output, layer_2_alloc,     \/\/\n                                   layer_2_out_dim[0], layer_2_out_dim[1],  \/\/\n                                   &event3_1);\n\n  std::cout << \"### Backpropagate(weights&bias gradients) - 1st layer\"\n            << std::endl;\n  auto event3_3 =\n      DataPipeline::backpropagate2(layer_data_1,                            \/\/\n                                   cnn_input, layer_1_alloc,                \/\/\n                                   layer_1_out_dim[0], layer_1_out_dim[1],  \/\/\n                                   &event3_2);\n\n  _context->block();\n\n  \/\/ step 4 update weights and biases\n  \/\/ TODO might as well run all in parallel\n  std::cout << \"### Updating weights and biases - 3rd layer\" << std::endl;\n  auto event4_1 =\n      update_parameters(layer_data_3, layer_3_alloc, _config->momentum,\n                        _config->learning_rate[2], &event3_3);\n\n  std::cout << \"### Updating weights and biases - 2nd layer\" << std::endl;\n  auto event4_2 =\n      update_parameters(layer_data_2, layer_2_alloc, _config->momentum,\n                        _config->learning_rate[1], &event4_1);\n\n  std::cout << \"### Updating weights and biases - 1st layer\" << std::endl;\n  auto event4_3 =\n      update_parameters(layer_data_1, layer_1_alloc, _config->momentum,\n                        _config->learning_rate[0], &event4_2);\n\n  _context->block();\n  return event4_3;\n}\n\ncl_event ConfigBasedDataPipeline::mean_squared_error(\n    opencl::MemoryHandle gpu_buf_ground_truth,\n    opencl::MemoryHandle gpu_buf_algo_res,\n    opencl::MemoryHandle &gpu_buf_target,  \/\/\n    size_t ground_truth_w, size_t ground_truth_h, cl_event *ev_to_wait_for) {\n  \/\/\n  size_t padding = layer_data_1.f_spatial_size + layer_data_2.f_spatial_size +\n                   layer_data_3.f_spatial_size - 3;\n  return DataPipeline::mean_squared_error(\n      gpu_buf_ground_truth, gpu_buf_algo_res, gpu_buf_target, ground_truth_w,\n      ground_truth_h, padding, ev_to_wait_for);\n}\n\ncl_event ConfigBasedDataPipeline::last_layer_delta(\n    opencl::MemoryHandle gpu_buf_ground_truth,\n    opencl::MemoryHandle gpu_buf_algo_res, opencl::MemoryHandle &gpu_buf_target,\n    float weight_decay,  \/\/\n    size_t ground_truth_w, size_t ground_truth_h, cl_event *ev) {\n  \/\/\n  size_t padding = layer_data_1.f_spatial_size + layer_data_2.f_spatial_size +\n                   layer_data_3.f_spatial_size - 3;\n  return DataPipeline::last_layer_delta(\n      gpu_buf_ground_truth, gpu_buf_algo_res, gpu_buf_target, weight_decay,\n      ground_truth_w, ground_truth_h, padding, ev);\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <fstream>\n#include <string>\n\ntemplate <typename T>\nstruct Node\n{\n\tNode<T>* leftNode;\n\tNode<T>* rightNode;\n\tT value;\n\n\tNode(int value)\n\t{\n\t\tthis->value = value;\n\t\tleftNode = nullptr;\n\t\trightNode = nullptr;\n\t}\n};\n\ntemplate <typename T>\nclass BinarySearchTree\n{\nprivate:\n\tNode<T>* _root;\n\tvoid destroyTree(Node<T>* node);\n\tvoid insertElement(Node<T>* &node, const T &value);\n\tNode<T>* findElement(const T& value) const;\n\t\n\npublic:\n\tBinarySearchTree();\n\t~BinarySearchTree();\n\n\tT value_() const;\n\tint count_(const Node<T>* node) const;\n\t\n\tNode<T>* leftNode_() const;\n\tNode<T>* rightNode_() const;\n\tNode<T>* root() const;\n\n\tvoid insert(const T& value);\n\tbool isFound(const T& value) const;\n\t\n\tvoid infile(std::string filename);\n\tvoid outfile(Node<T>* root, std::ostream& outfile) const;\n\tvoid out(std::string filename) const;\n\tvoid paintTree(const Node<T>* node, int level) const;\n};\n\ntemplate <typename T>\nT BinarySearchTree<T>::value_() const\n{\n\treturn _root->value;\n}\n\ntemplate <typename T>\nint BinarySearchTree<T>::count_(const Node<T>* node) const\n{\n\tif (!node)\n\t\treturn 0;\n\telse\n\t\treturn count_(node->leftNode) + count_(node->rightNode) + 1;\n}\n\ntemplate <typename T>\nNode<T>* BinarySearchTree<T>::root() const\n{\n\treturn _root;\n}\n\n\ntemplate <typename T>\nNode<T>* BinarySearchTree<T>::leftNode_() const\n{\n\treturn _root->leftNode;\n}\n\ntemplate <typename T>\nNode<T>* BinarySearchTree<T>::rightNode_() const\n{\n\treturn _root->rightNode;\n}\n\ntemplate <typename T>\nBinarySearchTree<T>::BinarySearchTree()\n{\n\t_root = nullptr;\n}\n\ntemplate <typename T>\nvoid BinarySearchTree<T>::destroyTree(Node<T>* node)\n{\n\tif (!node)\n\t\treturn;\n\n\tdestroyTree(node->leftNode);\n\tdestroyTree(node->rightNode);\n\n\tdelete node;\n}\n\ntemplate <typename T>\nBinarySearchTree<T>::~BinarySearchTree()\n{\n\tdestroyTree(_root);\n}\n\ntemplate <typename T>\nvoid BinarySearchTree<T>::insertElement(Node<T>* &node, const T &value)\n{\n\tif (node)\n\t{\n\t\tif (value < node->value)\n\t\t{\n\t\t\tinsertElement(node->leftNode, value);\n\t\t}\n\t\telse if (value > node->value)\n\t\t{\n\t\t\tinsertElement(node->rightNode, value);\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn;\n\t\t}\n\t}\n\telse\n\t{\n\t\tnode = new Node<T>(value);\n\t}\n}\n\ntemplate <typename T>\nvoid BinarySearchTree<T>::insert(const T& value)\n{\n\tinsertElement(_root, value);\n}\n\ntemplate <typename T>\nNode<T>*  BinarySearchTree<T>::findElement(const T& value) const\n{\n\tNode<T> *currNode = _root;\n\n\twhile (currNode)\n\t{\n\t\tif (currNode->value == value)\n\t\t\tbreak;\n\t\telse\n\t\t{\n\t\t\tif (currNode->value < value)\n\t\t\t\tcurrNode = currNode->rightNode;\n\t\t\telse currNode = currNode->leftNode;\n\t\t}\n\t}\n\treturn currNode;\n}\n\ntemplate <typename T>\nbool BinarySearchTree<T>::isFound(const T& value) const\n{\n\tNode<T> *retNode = findElement(value);\n\tif (retNode) \n\t\treturn true;\n\telse   \n\t\treturn false;\n}\n\ntemplate <typename T>\nvoid BinarySearchTree<T>::infile(std::string filename)\n{\n\tstd::ifstream infile;\n\tinfile.open(filename);\n\tT value;\n\tint count;\n\tinfile >> count;\n\n\twhile (count--)\n\t{\n\t\tinfile >> value;\n\t\tinsert(value);\n\t}\n\n\tinfile.close();\n}\n\ntemplate <typename T>\nvoid BinarySearchTree<T>::outfile(Node<T>* root, std::ostream& ofile) const\n{\n\tif (!root)\n\t\treturn;\n\n\telse\n\t{\n\t\tofile << root->value << \"\\t\";\n\t\toutfile(root->rightNode, ofile);\n\t\toutfile(root->leftNode, ofile);\n\t}\n}\n\ntemplate <typename T>\nvoid BinarySearchTree<T>::out(std::string filename) const\n{\n\tstd::ofstream ofile(filename);\n\tint count = count_(_root);\n\tif (!ofile)\n\t\tstd::cout << \"Error! Please, try again!\" << std::endl;\n\telse\n\t\tofile << count << \" \";\n\t\toutfile(root, ofile);\n\tofile.close();\n}\n\ntemplate <typename T>\nvoid BinarySearchTree<T>::paintTree(const Node<T>* node, int level) const\n{\n\tif (node)\n\t{\n\t\tpaintTree(node->rightNode, level++);\n\n\t\tfor (int i = 0; i < level; i++)\n\t\t{\n\t\t\tstd::cout << \"-\";\n\t\t}\t\n\n\t\tstd::cout << node->value << std::endl;\n\t\tpaintTree(node->leftNode, level++);\n\t}\n}\n<commit_msg>Update binary_search_tree.hpp<commit_after>#include <iostream>\n#include <fstream>\n#include <string>\n\ntemplate <typename T>\nstruct Node\n{\n\tNode<T>* leftNode;\n\tNode<T>* rightNode;\n\tT value;\n\n\tNode(int value)\n\t{\n\t\tthis->value = value;\n\t\tleftNode = nullptr;\n\t\trightNode = nullptr;\n\t}\n};\n\ntemplate <typename T>\nclass BinarySearchTree\n{\nprivate:\n\tNode<T>* _root;\n\tvoid destroyTree(Node<T>* node);\n\tvoid insertElement(Node<T>* &node, const T &value);\n\tNode<T>* findElement(const T& value) const;\n\t\n\npublic:\n\tBinarySearchTree();\n\t~BinarySearchTree();\n\n\tT value_() const;\n\tint count_(const Node<T>* node) const;\n\t\n\tNode<T>* leftNode_() const;\n\tNode<T>* rightNode_() const;\n\tNode<T>* root() const;\n\n\tvoid insert(const T& value);\n\tbool isFound(const T& value) const;\n\t\n\tvoid infile(std::string filename);\n\tvoid outfile(Node<T>* root, std::ostream& outfile) const;\n\tvoid out(std::string filename) const;\n\tvoid paintTree(const Node<T>* node, int level) const;\n};\n\ntemplate <typename T>\nT BinarySearchTree<T>::value_() const\n{\n\treturn _root->value;\n}\n\ntemplate <typename T>\nint BinarySearchTree<T>::count_(const Node<T>* node) const\n{\n\tif (!node)\n\t\treturn 0;\n\telse\n\t\treturn count_(node->leftNode) + count_(node->rightNode) + 1;\n}\n\ntemplate <typename T>\nNode<T>* BinarySearchTree<T>::root() const\n{\n\treturn _root;\n}\n\n\ntemplate <typename T>\nNode<T>* BinarySearchTree<T>::leftNode_() const\n{\n\treturn _root->leftNode;\n}\n\ntemplate <typename T>\nNode<T>* BinarySearchTree<T>::rightNode_() const\n{\n\treturn _root->rightNode;\n}\n\ntemplate <typename T>\nBinarySearchTree<T>::BinarySearchTree()\n{\n\t_root = nullptr;\n}\n\ntemplate <typename T>\nvoid BinarySearchTree<T>::destroyTree(Node<T>* node)\n{\n\tif (!node)\n\t\treturn;\n\n\tdestroyTree(node->leftNode);\n\tdestroyTree(node->rightNode);\n\n\tdelete node;\n}\n\ntemplate <typename T>\nBinarySearchTree<T>::~BinarySearchTree()\n{\n\tdestroyTree(_root);\n}\n\ntemplate <typename T>\nvoid BinarySearchTree<T>::insertElement(Node<T>* &node, const T &value)\n{\n\tif (node)\n\t{\n\t\tif (value < node->value)\n\t\t{\n\t\t\tinsertElement(node->leftNode, value);\n\t\t}\n\t\telse if (value > node->value)\n\t\t{\n\t\t\tinsertElement(node->rightNode, value);\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturn;\n\t\t}\n\t}\n\telse\n\t{\n\t\tnode = new Node<T>(value);\n\t}\n}\n\ntemplate <typename T>\nvoid BinarySearchTree<T>::insert(const T& value)\n{\n\tinsertElement(_root, value);\n}\n\ntemplate <typename T>\nNode<T>*  BinarySearchTree<T>::findElement(const T& value) const\n{\n\tNode<T> *currNode = _root;\n\n\twhile (currNode)\n\t{\n\t\tif (currNode->value == value)\n\t\t\tbreak;\n\t\telse\n\t\t{\n\t\t\tif (currNode->value < value)\n\t\t\t\tcurrNode = currNode->rightNode;\n\t\t\telse currNode = currNode->leftNode;\n\t\t}\n\t}\n\treturn currNode;\n}\n\ntemplate <typename T>\nbool BinarySearchTree<T>::isFound(const T& value) const\n{\n\tNode<T> *retNode = findElement(value);\n\tif (retNode) \n\t\treturn true;\n\telse   \n\t\treturn false;\n}\n\ntemplate <typename T>\nvoid BinarySearchTree<T>::infile(std::string filename)\n{\n\tstd::ifstream infile;\n\tinfile.open(filename);\n\tT value;\n\tint count;\n\tinfile >> count;\n\n\twhile (count--)\n\t{\n\t\tinfile >> value;\n\t\tinsert(value);\n\t}\n\n\tinfile.close();\n}\n\ntemplate <typename T>\nvoid BinarySearchTree<T>::outfile(Node<T>* root, std::ostream& ofile) const\n{\n\tif (!root)\n\t\treturn;\n\n\telse\n\t{\n\t\tofile << root->value << \"\\t\";\n\t\toutfile(root->rightNode, ofile);\n\t\toutfile(root->leftNode, ofile);\n\t}\n}\n\ntemplate <typename T>\nvoid BinarySearchTree<T>::out(std::string filename) const\n{\n\tstd::ofstream ofile(filename);\n\tint count = count_(_root);\n\tif (!ofile)\n\t\tstd::cout << \"Error! Please, try again!\" << std::endl;\n\telse\n\t\tofile << count << \" \";\n\t\toutfile(_root, ofile);\n\tofile.close();\n}\n\ntemplate <typename T>\nvoid BinarySearchTree<T>::paintTree(const Node<T>* node, int level) const\n{\n\tif (node)\n\t{\n\t\tpaintTree(node->rightNode, level++);\n\n\t\tfor (int i = 0; i < level; i++)\n\t\t{\n\t\t\tstd::cout << \"-\";\n\t\t}\t\n\n\t\tstd::cout << node->value << std::endl;\n\t\tpaintTree(node->leftNode, level++);\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * These codes are licensed under the Unlicense.\n * http:\/\/unlicense.org\n *\/\n\n#ifndef COMMATA_GUARD_E8F031F6_10D8_4585_9012_CFADC2F95BA7\n#define COMMATA_GUARD_E8F031F6_10D8_4585_9012_CFADC2F95BA7\n\n#include <cassert>\n#include <cstddef>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <exception>\n#include <limits>\n#include <memory>\n#include <ostream>\n#include <sstream>\n#include <streambuf>\n#include <string>\n#include <type_traits>\n#include <utility>\n\n#include \"formatted_output.hpp\"\n#include \"typing_aid.hpp\"\n\nnamespace commata {\nnamespace detail { namespace ex {\n\ntemplate <class T>\nstruct npos_impl\n{\n    constexpr static T npos = static_cast<T>(-1);\n};\n\n\/\/ To define this in a header, npos_impl is a template\ntemplate <class T>\nconstexpr T npos_impl<T>::npos;\n\n}} \/\/ end detail::ex\n\nclass text_error_info;\n\nclass text_error :\n    public std::exception, public detail::ex::npos_impl<std::size_t>\n{\n    struct what_holder\n    {\n        virtual ~what_holder() {}\n        virtual const char* what() const noexcept = 0;\n    };\n\n    template <class Tr, class Allocator>\n    class string_holder : public what_holder\n    {\n        std::basic_string<char, Tr, Allocator> s_;\n\n    public:\n        template <class T>\n        explicit string_holder(T&& s) : s_(std::forward<T>(s))\n        {}\n\n        string_holder(const string_holder&) = delete;\n        ~string_holder() = default;\n\n        const char* what() const noexcept override\n        {\n            return s_.c_str();\n        }\n    };\n\n    class chars_holder : public what_holder\n    {\n        std::unique_ptr<char[]> s_;\n\n    public:\n        explicit chars_holder(const char* s)\n        {\n            std::size_t len = std::strlen(s);\n            s_.reset(new char[len + 1]);\n            std::memcpy(s_.get(), s, len);\n            s_[len] = '\\0';\n        }\n\n        chars_holder(const chars_holder&) = delete;\n        ~chars_holder() = default;\n\n        const char* what() const noexcept override\n        {\n            return s_.get();\n        }\n    };\n\n    std::shared_ptr<what_holder> what_;\n    std::pair<std::size_t, std::size_t> pos_;\n\npublic:\n    text_error() noexcept :\n        pos_(npos, npos)\n    {}\n\n    template <class Tr, class Allocator>\n    explicit text_error(\n        const std::basic_string<char, Tr, Allocator>& what_arg) :\n        what_(std::make_shared<string_holder<Tr, Allocator>>(what_arg)),\n        pos_(npos, npos)\n    {}\n\n    template <class Tr, class Allocator>\n    explicit text_error(std::basic_string<char, Tr, Allocator>&& what_arg) :\n        what_(std::make_shared<string_holder<Tr, Allocator>>(\n                std::move(what_arg))),\n        pos_(npos, npos)\n    {}\n\n    explicit text_error(const char* what_arg) :\n        what_(std::make_shared<chars_holder>(what_arg)),\n        pos_(npos, npos)\n    {}\n\n    text_error(const text_error& other) = default;\n    text_error(text_error&& other) = default;\n\n    text_error& operator=(const text_error& other) noexcept\n    {\n        std::exception::operator=(other);\n        what_ = other.what_;\n        pos_ = other.pos_;\n        \/\/ According to C++14 20.3.2 (1), pair's assignments do not throw\n        \/\/ but are not declared as noexcept\n        return *this;\n    }\n\n    text_error& operator=(text_error&& other) noexcept\n    {\n        std::exception::operator=(std::move(other));\n        what_ = std::move(other.what_);\n        pos_ = other.pos_;\n        \/\/ ditto\n        return *this;\n    }\n\n    const char* what() const noexcept override\n    {\n        return what_ ? what_->what() : \"\";\n    }\n\n    text_error& set_physical_position(\n        std::size_t line = npos, std::size_t col = npos) noexcept\n    {\n        pos_ = std::make_pair(line, col);\n        return *this;\n    }\n\n    const std::pair<std::size_t, std::size_t>* get_physical_position() const\n        noexcept\n    {\n        return (pos_ != std::make_pair(npos, npos)) ? &pos_ : nullptr;\n    }\n\n    text_error_info info(std::size_t base = 1U) const noexcept;\n};\n\nclass text_error_info\n{\n    const text_error* ex_;\n    std::size_t base_;\n\npublic:\n    text_error_info(const text_error& ex, std::size_t base) noexcept :\n        ex_(std::addressof(ex)), base_(base)\n    {}\n\n    text_error_info(const text_error_info& ex) = default;\n    text_error_info& operator=(const text_error_info& ex) = default;\n\n    const text_error& error() const noexcept\n    {\n        return *ex_;\n    }\n\n    std::size_t get_base() const noexcept\n    {\n        return base_;\n    }\n};\n\ninline text_error_info text_error::info(std::size_t base) const noexcept\n{\n    return text_error_info(*this, base);\n}\n\nnamespace detail { namespace ex {\n\n\/\/ Prints a non-negative integer value in the decimal system\n\/\/ into a sufficient-length buffer\ntemplate <std::size_t N>\nstd::streamsize print_pos(char (&s)[N], std::size_t pos, std::size_t base)\n{\n    const auto len = (pos != text_error::npos)\n                  && (text_error::npos - base >= pos) ?\n        std::snprintf(s, N, \"%zu\", pos + base) :\n        std::snprintf(s, N, \"n\/a\");\n    assert((len > 0 ) && (static_cast<std::size_t>(len) < N));\n    return static_cast<std::streamsize>(len);\n}\n\ntemplate <std::size_t N>\nstd::streamsize print_pos(wchar_t (&s)[N], std::size_t pos, std::size_t base)\n{\n    const auto len = (pos != text_error::npos)\n                  && (text_error::npos - base >= pos) ?\n        std::swprintf(s, N, L\"%zu\", pos + base) :\n        std::swprintf(s, N, L\"n\/a\");\n    assert((len > 0 ) && (static_cast<std::size_t>(len) < N));\n    return static_cast<std::streamsize>(len);\n}\n\ntemplate <class Ch, class Tr, std::size_t N>\nbool sputn(std::basic_streambuf<Ch, Tr>* sb, const Ch(&s)[N])\n{\n    \/\/ s shall be null terminated, so s[N - 1] is null\n    return sb->sputn(s, N - 1) == N - 1;\n}\n\ntemplate <class Ch, class Tr>\nbool sputn(std::basic_streambuf<Ch, Tr>* sb, const Ch* s, std::streamsize n)\n{\n    return sb->sputn(s, n) == n;\n}\n\n}} \/\/ end detail::ex\n\ntemplate <class Tr>\nstd::basic_ostream<char, Tr>& operator<<(\n    std::basic_ostream<char, Tr>& os, const text_error_info& i)\n{\n    using namespace detail::ex;\n\n    if (const auto p = i.error().get_physical_position()) {\n        \/\/ line\n        char l[std::numeric_limits<std::size_t>::digits10 + 2];\n        const auto l_len = print_pos(l, p->first, i.get_base());\n\n        \/\/ column\n        char c[sizeof(l)];\n        const auto c_len = print_pos(c, p->second, i.get_base());\n\n        \/\/ what\n        const auto w = i.error().what();\n        const auto w_len = static_cast<std::streamsize>(std::strlen(w));\n\n        const auto n = w_len + l_len + c_len + ((w_len > 0) ? 15 : 27);\n\n        return detail::formatted_output(os, n,\n            [w, w_len, l = &l[0], l_len, c = &c[0], c_len]\n            (auto* sb) {\n                if (w_len > 0) {\n                    if (!sputn(sb, w, w_len)\n                     || !sputn(sb, \"; line \")) {\n                        return false;\n                    }\n                } else if (!sputn(sb, \"Text error at line \")) {\n                    return false;\n                }\n                return sputn(sb, l, l_len)\n                    && sputn(sb, \" column \")\n                    && sputn(sb, c, c_len);\n            });\n\n    } else {\n        return os << i.error().what();\n    }\n}\n\ntemplate <class Tr>\nstd::basic_ostream<wchar_t, Tr>& operator<<(\n    std::basic_ostream<wchar_t, Tr>& os, const text_error_info& i)\n{\n    using namespace detail::ex;\n\n    if (const auto p = i.error().get_physical_position()) {\n        \/\/ line\n        wchar_t l[std::numeric_limits<std::size_t>::digits10 + 2];\n        const auto l_len = print_pos(l, p->first, i.get_base());\n\n        \/\/ column\n        wchar_t c[sizeof(l) \/ sizeof(wchar_t)];\n        const auto c_len = print_pos(c, p->second, i.get_base());\n\n        \/\/ what\n        const auto w_raw = i.error().what();\n        const auto w_len = static_cast<std::streamsize>(std::strlen(w_raw));\n\n        const auto n = w_len + l_len + c_len + ((w_len > 0) ? 15 : 27);\n\n        return detail::formatted_output(os, n,\n            [&os, w_raw, w_len, l = &l[0], l_len, c = &c[0], c_len]\n            (auto* sb) {\n                if (w_len > 0) {\n                    for (std::streamsize j = 0; j < w_len; ++j) {\n                        if (sb->sputc(os.widen(w_raw[j])) == Tr::eof()) {\n                            return false;\n                        }\n                    }\n                    if (!sputn(sb, L\"; line \")) {\n                        return false;\n                    }\n                } else if (!sputn(sb, L\"Text error at line \")) {\n                    return false;\n                }\n                return sputn(sb, l, l_len)\n                    && sputn(sb, L\" column \")\n                    && sputn(sb, c, c_len);\n            });\n\n    } else {\n        return os << i.error().what();\n    }\n}\n\ninline std::string to_string(const text_error_info& i)\n{\n    std::ostringstream s;\n    s << i;\n    return std::move(s).str();\n}\n\ninline std::wstring to_wstring(const text_error_info& i)\n{\n    std::wostringstream s;\n    s << i;\n    return std::move(s).str();\n}\n\n}\n\n#endif\n<commit_msg>Make text_info's stream insertion robuster<commit_after>\/**\n * These codes are licensed under the Unlicense.\n * http:\/\/unlicense.org\n *\/\n\n#ifndef COMMATA_GUARD_E8F031F6_10D8_4585_9012_CFADC2F95BA7\n#define COMMATA_GUARD_E8F031F6_10D8_4585_9012_CFADC2F95BA7\n\n#include <cassert>\n#include <cstddef>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <exception>\n#include <limits>\n#include <memory>\n#include <ostream>\n#include <sstream>\n#include <streambuf>\n#include <string>\n#include <type_traits>\n#include <utility>\n\n#include \"formatted_output.hpp\"\n#include \"typing_aid.hpp\"\n\nnamespace commata {\nnamespace detail { namespace ex {\n\ntemplate <class T>\nstruct npos_impl\n{\n    constexpr static T npos = static_cast<T>(-1);\n};\n\n\/\/ To define this in a header, npos_impl is a template\ntemplate <class T>\nconstexpr T npos_impl<T>::npos;\n\n}} \/\/ end detail::ex\n\nclass text_error_info;\n\nclass text_error :\n    public std::exception, public detail::ex::npos_impl<std::size_t>\n{\n    struct what_holder\n    {\n        virtual ~what_holder() {}\n        virtual const char* what() const noexcept = 0;\n    };\n\n    template <class Tr, class Allocator>\n    class string_holder : public what_holder\n    {\n        std::basic_string<char, Tr, Allocator> s_;\n\n    public:\n        template <class T>\n        explicit string_holder(T&& s) : s_(std::forward<T>(s))\n        {}\n\n        string_holder(const string_holder&) = delete;\n        ~string_holder() = default;\n\n        const char* what() const noexcept override\n        {\n            return s_.c_str();\n        }\n    };\n\n    class chars_holder : public what_holder\n    {\n        std::unique_ptr<char[]> s_;\n\n    public:\n        explicit chars_holder(const char* s)\n        {\n            std::size_t len = std::strlen(s);\n            s_.reset(new char[len + 1]);\n            std::memcpy(s_.get(), s, len);\n            s_[len] = '\\0';\n        }\n\n        chars_holder(const chars_holder&) = delete;\n        ~chars_holder() = default;\n\n        const char* what() const noexcept override\n        {\n            return s_.get();\n        }\n    };\n\n    std::shared_ptr<what_holder> what_;\n    std::pair<std::size_t, std::size_t> pos_;\n\npublic:\n    text_error() noexcept :\n        pos_(npos, npos)\n    {}\n\n    template <class Tr, class Allocator>\n    explicit text_error(\n        const std::basic_string<char, Tr, Allocator>& what_arg) :\n        what_(std::make_shared<string_holder<Tr, Allocator>>(what_arg)),\n        pos_(npos, npos)\n    {}\n\n    template <class Tr, class Allocator>\n    explicit text_error(std::basic_string<char, Tr, Allocator>&& what_arg) :\n        what_(std::make_shared<string_holder<Tr, Allocator>>(\n                std::move(what_arg))),\n        pos_(npos, npos)\n    {}\n\n    explicit text_error(const char* what_arg) :\n        what_(std::make_shared<chars_holder>(what_arg)),\n        pos_(npos, npos)\n    {}\n\n    text_error(const text_error& other) = default;\n    text_error(text_error&& other) = default;\n\n    text_error& operator=(const text_error& other) noexcept\n    {\n        std::exception::operator=(other);\n        what_ = other.what_;\n        pos_ = other.pos_;\n        \/\/ According to C++14 20.3.2 (1), pair's assignments do not throw\n        \/\/ but are not declared as noexcept\n        return *this;\n    }\n\n    text_error& operator=(text_error&& other) noexcept\n    {\n        std::exception::operator=(std::move(other));\n        what_ = std::move(other.what_);\n        pos_ = other.pos_;\n        \/\/ ditto\n        return *this;\n    }\n\n    const char* what() const noexcept override\n    {\n        return what_ ? what_->what() : \"\";\n    }\n\n    text_error& set_physical_position(\n        std::size_t line = npos, std::size_t col = npos) noexcept\n    {\n        pos_ = std::make_pair(line, col);\n        return *this;\n    }\n\n    const std::pair<std::size_t, std::size_t>* get_physical_position() const\n        noexcept\n    {\n        return (pos_ != std::make_pair(npos, npos)) ? &pos_ : nullptr;\n    }\n\n    text_error_info info(std::size_t base = 1U) const noexcept;\n};\n\nclass text_error_info\n{\n    const text_error* ex_;\n    std::size_t base_;\n\npublic:\n    text_error_info(const text_error& ex, std::size_t base) noexcept :\n        ex_(std::addressof(ex)), base_(base)\n    {}\n\n    text_error_info(const text_error_info& ex) = default;\n    text_error_info& operator=(const text_error_info& ex) = default;\n\n    const text_error& error() const noexcept\n    {\n        return *ex_;\n    }\n\n    std::size_t get_base() const noexcept\n    {\n        return base_;\n    }\n};\n\ninline text_error_info text_error::info(std::size_t base) const noexcept\n{\n    return text_error_info(*this, base);\n}\n\nnamespace detail { namespace ex {\n\nusing length_t = std::common_type_t<std::make_unsigned_t<std::streamsize>,\n                                    std::size_t>;\n\nconstexpr std::streamsize nmax = std::numeric_limits<std::streamsize>::max();\nconstexpr length_t unmax = static_cast<length_t>(nmax);\n\n\/\/ Prints a non-negative integer value in the decimal system\n\/\/ into a sufficient-length buffer\ntemplate <std::size_t N>\nstd::size_t print_pos(char (&s)[N], std::size_t pos, std::size_t base)\n{\n    const auto len = (pos != text_error::npos)\n                  && (text_error::npos - base >= pos) ?\n        std::snprintf(s, N, \"%zu\", pos + base) :\n        std::snprintf(s, N, \"n\/a\");\n    assert((len > 0 ) && (static_cast<std::size_t>(len) < N));\n    return static_cast<std::size_t>(len);\n}\n\ntemplate <std::size_t N>\nstd::size_t print_pos(wchar_t (&s)[N], std::size_t pos, std::size_t base)\n{\n    const auto len = (pos != text_error::npos)\n                  && (text_error::npos - base >= pos) ?\n        std::swprintf(s, N, L\"%zu\", pos + base) :\n        std::swprintf(s, N, L\"n\/a\");\n    assert((len > 0 ) && (static_cast<std::size_t>(len) < N));\n    return static_cast<std::size_t>(len);\n}\n\ntemplate <class Ch, class Tr>\nbool sputn(std::basic_streambuf<Ch, Tr>* sb, const Ch* s, std::size_t n)\n{\n    while (n > unmax) {\n        if (sb->sputn(s, nmax) != nmax) {\n            return false;\n        }\n        s += unmax;\n        n -= unmax;\n    }\n    return sb->sputn(s, n) == static_cast<std::streamsize>(n);\n}\n\ntemplate <class Ch, class Tr, std::size_t N>\nbool sputn(std::basic_streambuf<Ch, Tr>* sb, const Ch(&s)[N])\n{\n    \/\/ s shall be null terminated, so s[N - 1] is null\n    assert(s[N - 1] == Ch());\n    return sputn(sb, s, N - 1);\n}\n\ntemplate <class T>\nstd::pair<T, bool> add(T a, T b)\n{\n    if (std::numeric_limits<T>::max() - a >= b) {\n        return { a + b, true };\n    } else {\n        return { T(), false };\n    }\n}\n\ntemplate <class T, class... Ts>\nstd::pair<T, bool> add(T a, T b, Ts... cs)\n{\n    const auto bcs = add<T>(b, cs...);\n    if (bcs.second) {\n        return add<T>(a, bcs.first);\n    } else {\n        return { T(), false };\n    }\n}\n\n}} \/\/ end detail::ex\n\ntemplate <class Tr>\nstd::basic_ostream<char, Tr>& operator<<(\n    std::basic_ostream<char, Tr>& os, const text_error_info& i)\n{\n    using namespace detail::ex;\n\n    if (const auto p = i.error().get_physical_position()) {\n        \/\/ line\n        char l[std::numeric_limits<std::size_t>::digits10 + 2];\n        const auto l_len = print_pos(l, p->first, i.get_base());\n\n        \/\/ column\n        char c[sizeof(l)];\n        const auto c_len = print_pos(c, p->second, i.get_base());\n\n        \/\/ what\n        const auto w = i.error().what();\n        const auto w_len = std::strlen(w);\n\n        const auto n = add<length_t>(\n            w_len, l_len, c_len, ((w_len > 0) ? 15 : 27)).first;\n\n        return detail::formatted_output(os, static_cast<std::streamsize>(n),\n            [w, w_len, l = &l[0], l_len, c = &c[0], c_len]\n            (auto* sb) {\n                if (w_len > 0) {\n                    if (!sputn(sb, w, w_len)\n                     || !sputn(sb, \"; line \")) {\n                        return false;\n                    }\n                } else if (!sputn(sb, \"Text error at line \")) {\n                    return false;\n                }\n                return sputn(sb, l, l_len)\n                    && sputn(sb, \" column \")\n                    && sputn(sb, c, c_len);\n            });\n\n    } else {\n        return os << i.error().what();\n    }\n}\n\ntemplate <class Tr>\nstd::basic_ostream<wchar_t, Tr>& operator<<(\n    std::basic_ostream<wchar_t, Tr>& os, const text_error_info& i)\n{\n    using namespace detail::ex;\n\n    if (const auto p = i.error().get_physical_position()) {\n        \/\/ line\n        wchar_t l[std::numeric_limits<std::size_t>::digits10 + 2];\n        const auto l_len = print_pos(l, p->first, i.get_base());\n\n        \/\/ column\n        wchar_t c[sizeof(l) \/ sizeof(wchar_t)];\n        const auto c_len = print_pos(c, p->second, i.get_base());\n\n        \/\/ what\n        const auto w_raw = i.error().what();\n        const auto w_len = std::strlen(w_raw);\n\n        const auto n = add<length_t>(\n            w_len, l_len, c_len, ((w_len > 0) ? 15 : 27)).first;\n\n        return detail::formatted_output(os, static_cast<std::streamsize>(n),\n            [&os, w_raw, w_len, l = &l[0], l_len, c = &c[0], c_len]\n            (auto* sb) {\n                if (w_len > 0) {\n                    for (std::size_t j = 0; j < w_len; ++j) {\n                        if (sb->sputc(os.widen(w_raw[j])) == Tr::eof()) {\n                            return false;\n                        }\n                    }\n                    if (!sputn(sb, L\"; line \")) {\n                        return false;\n                    }\n                } else if (!sputn(sb, L\"Text error at line \")) {\n                    return false;\n                }\n                return sputn(sb, l, l_len)\n                    && sputn(sb, L\" column \")\n                    && sputn(sb, c, c_len);\n            });\n\n    } else {\n        return os << i.error().what();\n    }\n}\n\ninline std::string to_string(const text_error_info& i)\n{\n    std::ostringstream s;\n    s << i;\n    return std::move(s).str();\n}\n\ninline std::wstring to_wstring(const text_error_info& i)\n{\n    std::wostringstream s;\n    s << i;\n    return std::move(s).str();\n}\n\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/ This file is part of libigl, a simple c++ geometry processing library.\n\/\/\n\/\/ Copyright (C) 2013 Alec Jacobson <alecjacobson@gmail.com>\n\/\/\n\/\/ This Source Code Form is subject to the terms of the Mozilla Public License\n\/\/ v. 2.0. If a copy of the MPL was not distributed with this file, You can\n\/\/ obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n#include \"list_to_matrix.h\"\n\n#include <cassert>\n#include <cstdio>\n\n#include <Eigen\/Dense>\n\n#include \"max_size.h\"\n#include \"min_size.h\"\n\ntemplate <typename T, class Mat>\nIGL_INLINE bool igl::list_to_matrix(const std::vector<std::vector<T > > & V,Mat & M)\n{\n  \/\/ number of rows\n  int m = V.size();\n  if(m == 0)\n  {\n    \/\/fprintf(stderr,\"Error: list_to_matrix() list is empty()\\n\");\n    \/\/return false;\n    M.resize(0,0);\n    return true;\n  }\n  \/\/ number of columns\n  int n = igl::min_size(V);\n  if(n != igl::max_size(V))\n  {\n    fprintf(stderr,\"Error: list_to_matrix()\"\n      \" list elements are not all the same size: (min: %d, max: %d)\\n\",\n      n,igl::max_size(V));\n    return false;\n  }\n  assert(n != -1);\n  \/\/ Resize output\n  M.resize(m,n);\n\n  \/\/ Loop over rows\n  for(int i = 0;i<m;i++)\n  {\n    \/\/ Loop over cols\n    for(int j = 0;j<n;j++)\n    {\n      M(i,j) = V[i][j];\n    }\n  }\n\n  return true;\n}\n\ntemplate <typename T, class Mat>\nIGL_INLINE bool igl::list_to_matrix(\n  const std::vector<std::vector<T > > & V,\n  const int n,\n  const T & padding,\n  Mat & M)\n{\n  const int m = V.size();\n  M.resize(m,n);\n  for(int i = 0;i<m;i++)\n  {\n    const auto & row = V[i];\n    if(row.size()>n)\n    {\n      return false;\n    }\n    int j = 0;\n    for(;j<row.size();j++)\n    {\n      M(i,j) = row[j];\n    }\n    for(;j<n;j++)\n    {\n      M(i,j) = padding;\n    }\n  }\n  return true;\n}\n\ntemplate <typename T, class Mat>\nIGL_INLINE bool igl::list_to_matrix(const std::vector<T > & V,Mat & M)\n{\n  \/\/ number of rows\n  int m = V.size();\n  if(m == 0)\n  {\n    \/\/fprintf(stderr,\"Error: list_to_matrix() list is empty()\\n\");\n    \/\/return false;\n    if(Mat::ColsAtCompileTime == 1)\n    {\n      M.resize(0,1);\n    }else if(Mat::RowsAtCompileTime == 1)\n    {\n      M.resize(1,0);\n    }else\n    {\n      M.resize(0,0);\n    }\n    return true;\n  }\n  \/\/ Resize output\n  if(Mat::RowsAtCompileTime == 1)\n  {\n    M.resize(1,m);\n  }else\n  {\n    M.resize(m,1);\n  }\n\n  \/\/ Loop over rows\n  for(int i = 0;i<m;i++)\n  {\n    M(i) = V[i];\n  }\n\n  return true;\n}\n\n#ifdef IGL_STATIC_LIBRARY\n\/\/ Explicit template specialization\n\/\/ generated by autoexplicit.sh\ntemplate bool igl::list_to_matrix<double, Eigen::Matrix<double, -1, 1, 0, -1, 1> >(std::vector<double, std::allocator<double> > const&, Eigen::Matrix<double, -1, 1, 0, -1, 1>&);\n\/\/ generated by autoexplicit.sh\ntemplate bool igl::list_to_matrix<int, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > >(std::vector<std::vector<int, std::allocator<int> >, std::allocator<std::vector<int, std::allocator<int> > > > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> >&);\n\/\/ generated by autoexplicit.sh\ntemplate bool igl::list_to_matrix<double, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> > >(std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> >&);\n\/\/ generated by autoexplicit.sh\ntemplate bool igl::list_to_matrix<double, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > >(std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> >&);\n\/\/ generated by autoexplicit.sh\ntemplate bool igl::list_to_matrix<int, Eigen::Matrix<int, -1, -1, 0, -1, -1> >(std::vector<std::vector<int, std::allocator<int> >, std::allocator<std::vector<int, std::allocator<int> > > > const&, Eigen::Matrix<int, -1, -1, 0, -1, -1>&);\n\/\/ generated by autoexplicit.sh\ntemplate bool igl::list_to_matrix<double, Eigen::Matrix<double, -1, -1, 0, -1, -1> >(std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > const&, Eigen::Matrix<double, -1, -1, 0, -1, -1>&);\n\/\/ generated by autoexplicit.sh\ntemplate bool igl::list_to_matrix<double, Eigen::Matrix<int, -1, -1, 0, -1, -1> >(std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > const&, Eigen::Matrix<int, -1, -1, 0, -1, -1>&);\ntemplate bool igl::list_to_matrix<bool, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > >(std::vector<bool, std::allocator<bool> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> >&);\ntemplate bool igl::list_to_matrix<bool, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > >(std::vector<std::vector<bool, std::allocator<bool> >, std::allocator<std::vector<bool, std::allocator<bool> > > > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> >&);\ntemplate bool igl::list_to_matrix<int, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > >(std::vector<int, std::allocator<int> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> >&);\ntemplate bool igl::list_to_matrix<int, Eigen::Matrix<double, -1, -1, 0, -1, -1> >(std::vector<std::vector<int, std::allocator<int> >, std::allocator<std::vector<int, std::allocator<int> > > > const&, Eigen::Matrix<double, -1, -1, 0, -1, -1>&);\ntemplate bool igl::list_to_matrix<int, Eigen::Matrix<double, -1, -1, 0, -1, -1> >(std::vector<int, std::allocator<int> > const&, Eigen::Matrix<double, -1, -1, 0, -1, -1>&);\ntemplate bool igl::list_to_matrix<double, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 3, 1, -1, 3> > >(std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 3, 1, -1, 3> >&);\ntemplate bool igl::list_to_matrix<double, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 2, 1, -1, 2> > >(std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 2, 1, -1, 2> >&);\ntemplate bool igl::list_to_matrix<int, Eigen::PlainObjectBase<Eigen::Matrix<unsigned int, -1, -1, 1, -1, -1> > >(std::vector<std::vector<int, std::allocator<int> >, std::allocator<std::vector<int, std::allocator<int> > > > const&, Eigen::PlainObjectBase<Eigen::Matrix<unsigned int, -1, -1, 1, -1, -1> >&);\ntemplate bool igl::list_to_matrix<int, Eigen::Matrix<int, -1, 1, 0, -1, 1> >(std::vector<int, std::allocator<int> > const&, Eigen::Matrix<int, -1, 1, 0, -1, 1>&);\ntemplate bool igl::list_to_matrix<int, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, 1, 0, -1, 1> > >(std::vector<int, std::allocator<int> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, 1, 0, -1, 1> >&);\ntemplate bool igl::list_to_matrix<double, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 3, 0, -1, 3> > >(std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 3, 0, -1, 3> >&);\ntemplate bool igl::list_to_matrix<int, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, 3, 0, -1, 3> > >(std::vector<std::vector<int, std::allocator<int> >, std::allocator<std::vector<int, std::allocator<int> > > > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, 3, 0, -1, 3> >&);\ntemplate bool igl::list_to_matrix<double, Eigen::Matrix<double, 1, -1, 1, 1, -1> >(std::vector<double, std::allocator<double> > const&, Eigen::Matrix<double, 1, -1, 1, 1, -1>&);\ntemplate bool igl::list_to_matrix<unsigned long, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, 1, 0, -1, 1> > >(std::vector<unsigned long, std::allocator<unsigned long> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, 1, 0, -1, 1> >&);\ntemplate bool igl::list_to_matrix<double, Eigen::Matrix<int, -1, 1, 0, -1, 1> >(std::vector<double, std::allocator<double> > const&, Eigen::Matrix<int, -1, 1, 0, -1, 1>&);\ntemplate bool igl::list_to_matrix<float, Eigen::PlainObjectBase<Eigen::Matrix<float, -1, -1, 0, -1, -1> > >(std::vector<std::vector<float, std::allocator<float> >, std::allocator<std::vector<float, std::allocator<float> > > > const&, Eigen::PlainObjectBase<Eigen::Matrix<float, -1, -1, 0, -1, -1> >&);\ntemplate bool igl::list_to_matrix<double, Eigen::Matrix<double, -1, 2, 0, -1, 2> >(std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > const&, Eigen::Matrix<double, -1, 2, 0, -1, 2>&);\ntemplate bool igl::list_to_matrix<double, Eigen::Matrix<double, -1, 3, 0, -1, 3> >(std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > const&, Eigen::Matrix<double, -1, 3, 0, -1, 3>&);\ntemplate bool igl::list_to_matrix<double, Eigen::PlainObjectBase<Eigen::Matrix<double, 2, 1, 0, 2, 1> > >(std::vector<double, std::allocator<double> > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, 2, 1, 0, 2, 1> >&);\ntemplate bool igl::list_to_matrix<double, Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 1, 0, 3, 1> > >(std::vector<double, std::allocator<double> > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 1, 0, 3, 1> >&);\ntemplate bool igl::list_to_matrix<double, Eigen::PlainObjectBase<Eigen::Matrix<double, 4, 1, 0, 4, 1> > >(std::vector<double, std::allocator<double> > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, 4, 1, 0, 4, 1> >&);\n#endif\n<commit_msg>templates<commit_after>\/\/ This file is part of libigl, a simple c++ geometry processing library.\n\/\/\n\/\/ Copyright (C) 2013 Alec Jacobson <alecjacobson@gmail.com>\n\/\/\n\/\/ This Source Code Form is subject to the terms of the Mozilla Public License\n\/\/ v. 2.0. If a copy of the MPL was not distributed with this file, You can\n\/\/ obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n#include \"list_to_matrix.h\"\n\n#include <cassert>\n#include <cstdio>\n\n#include <Eigen\/Dense>\n\n#include \"max_size.h\"\n#include \"min_size.h\"\n\ntemplate <typename T, class Mat>\nIGL_INLINE bool igl::list_to_matrix(const std::vector<std::vector<T > > & V,Mat & M)\n{\n  \/\/ number of rows\n  int m = V.size();\n  if(m == 0)\n  {\n    \/\/fprintf(stderr,\"Error: list_to_matrix() list is empty()\\n\");\n    \/\/return false;\n    M.resize(0,0);\n    return true;\n  }\n  \/\/ number of columns\n  int n = igl::min_size(V);\n  if(n != igl::max_size(V))\n  {\n    fprintf(stderr,\"Error: list_to_matrix()\"\n      \" list elements are not all the same size: (min: %d, max: %d)\\n\",\n      n,igl::max_size(V));\n    return false;\n  }\n  assert(n != -1);\n  \/\/ Resize output\n  M.resize(m,n);\n\n  \/\/ Loop over rows\n  for(int i = 0;i<m;i++)\n  {\n    \/\/ Loop over cols\n    for(int j = 0;j<n;j++)\n    {\n      M(i,j) = V[i][j];\n    }\n  }\n\n  return true;\n}\n\ntemplate <typename T, class Mat>\nIGL_INLINE bool igl::list_to_matrix(\n  const std::vector<std::vector<T > > & V,\n  const int n,\n  const T & padding,\n  Mat & M)\n{\n  const int m = V.size();\n  M.resize(m,n);\n  for(int i = 0;i<m;i++)\n  {\n    const auto & row = V[i];\n    if(row.size()>n)\n    {\n      return false;\n    }\n    int j = 0;\n    for(;j<row.size();j++)\n    {\n      M(i,j) = row[j];\n    }\n    for(;j<n;j++)\n    {\n      M(i,j) = padding;\n    }\n  }\n  return true;\n}\n\ntemplate <typename T, class Mat>\nIGL_INLINE bool igl::list_to_matrix(const std::vector<T > & V,Mat & M)\n{\n  \/\/ number of rows\n  int m = V.size();\n  if(m == 0)\n  {\n    \/\/fprintf(stderr,\"Error: list_to_matrix() list is empty()\\n\");\n    \/\/return false;\n    if(Mat::ColsAtCompileTime == 1)\n    {\n      M.resize(0,1);\n    }else if(Mat::RowsAtCompileTime == 1)\n    {\n      M.resize(1,0);\n    }else\n    {\n      M.resize(0,0);\n    }\n    return true;\n  }\n  \/\/ Resize output\n  if(Mat::RowsAtCompileTime == 1)\n  {\n    M.resize(1,m);\n  }else\n  {\n    M.resize(m,1);\n  }\n\n  \/\/ Loop over rows\n  for(int i = 0;i<m;i++)\n  {\n    M(i) = V[i];\n  }\n\n  return true;\n}\n\n#ifdef IGL_STATIC_LIBRARY\n\/\/ Explicit template specialization\n\/\/ generated by autoexplicit.sh\ntemplate bool igl::list_to_matrix<double, Eigen::Matrix<double, -1, 1, 0, -1, 1> >(std::vector<double, std::allocator<double> > const&, Eigen::Matrix<double, -1, 1, 0, -1, 1>&);\n\/\/ generated by autoexplicit.sh\ntemplate bool igl::list_to_matrix<int, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > >(std::vector<std::vector<int, std::allocator<int> >, std::allocator<std::vector<int, std::allocator<int> > > > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> >&);\n\/\/ generated by autoexplicit.sh\ntemplate bool igl::list_to_matrix<double, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> > >(std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> >&);\n\/\/ generated by autoexplicit.sh\ntemplate bool igl::list_to_matrix<double, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > >(std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> >&);\n\/\/ generated by autoexplicit.sh\ntemplate bool igl::list_to_matrix<int, Eigen::Matrix<int, -1, -1, 0, -1, -1> >(std::vector<std::vector<int, std::allocator<int> >, std::allocator<std::vector<int, std::allocator<int> > > > const&, Eigen::Matrix<int, -1, -1, 0, -1, -1>&);\n\/\/ generated by autoexplicit.sh\ntemplate bool igl::list_to_matrix<double, Eigen::Matrix<double, -1, -1, 0, -1, -1> >(std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > const&, Eigen::Matrix<double, -1, -1, 0, -1, -1>&);\n\/\/ generated by autoexplicit.sh\ntemplate bool igl::list_to_matrix<double, Eigen::Matrix<int, -1, -1, 0, -1, -1> >(std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > const&, Eigen::Matrix<int, -1, -1, 0, -1, -1>&);\ntemplate bool igl::list_to_matrix<bool, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > >(std::vector<bool, std::allocator<bool> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> >&);\ntemplate bool igl::list_to_matrix<bool, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > >(std::vector<std::vector<bool, std::allocator<bool> >, std::allocator<std::vector<bool, std::allocator<bool> > > > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> >&);\ntemplate bool igl::list_to_matrix<int, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > >(std::vector<int, std::allocator<int> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> >&);\ntemplate bool igl::list_to_matrix<int, Eigen::Matrix<double, -1, -1, 0, -1, -1> >(std::vector<std::vector<int, std::allocator<int> >, std::allocator<std::vector<int, std::allocator<int> > > > const&, Eigen::Matrix<double, -1, -1, 0, -1, -1>&);\ntemplate bool igl::list_to_matrix<int, Eigen::Matrix<double, -1, -1, 0, -1, -1> >(std::vector<int, std::allocator<int> > const&, Eigen::Matrix<double, -1, -1, 0, -1, -1>&);\ntemplate bool igl::list_to_matrix<double, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 3, 1, -1, 3> > >(std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 3, 1, -1, 3> >&);\ntemplate bool igl::list_to_matrix<double, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 2, 1, -1, 2> > >(std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 2, 1, -1, 2> >&);\ntemplate bool igl::list_to_matrix<int, Eigen::PlainObjectBase<Eigen::Matrix<unsigned int, -1, -1, 1, -1, -1> > >(std::vector<std::vector<int, std::allocator<int> >, std::allocator<std::vector<int, std::allocator<int> > > > const&, Eigen::PlainObjectBase<Eigen::Matrix<unsigned int, -1, -1, 1, -1, -1> >&);\ntemplate bool igl::list_to_matrix<int, Eigen::Matrix<int, -1, 1, 0, -1, 1> >(std::vector<int, std::allocator<int> > const&, Eigen::Matrix<int, -1, 1, 0, -1, 1>&);\ntemplate bool igl::list_to_matrix<int, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, 1, 0, -1, 1> > >(std::vector<int, std::allocator<int> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, 1, 0, -1, 1> >&);\ntemplate bool igl::list_to_matrix<double, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 3, 0, -1, 3> > >(std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 3, 0, -1, 3> >&);\ntemplate bool igl::list_to_matrix<int, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, 3, 0, -1, 3> > >(std::vector<std::vector<int, std::allocator<int> >, std::allocator<std::vector<int, std::allocator<int> > > > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, 3, 0, -1, 3> >&);\ntemplate bool igl::list_to_matrix<double, Eigen::Matrix<double, 1, -1, 1, 1, -1> >(std::vector<double, std::allocator<double> > const&, Eigen::Matrix<double, 1, -1, 1, 1, -1>&);\ntemplate bool igl::list_to_matrix<unsigned long, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, 1, 0, -1, 1> > >(std::vector<unsigned long, std::allocator<unsigned long> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, 1, 0, -1, 1> >&);\ntemplate bool igl::list_to_matrix<double, Eigen::Matrix<int, -1, 1, 0, -1, 1> >(std::vector<double, std::allocator<double> > const&, Eigen::Matrix<int, -1, 1, 0, -1, 1>&);\ntemplate bool igl::list_to_matrix<float, Eigen::PlainObjectBase<Eigen::Matrix<float, -1, -1, 0, -1, -1> > >(std::vector<std::vector<float, std::allocator<float> >, std::allocator<std::vector<float, std::allocator<float> > > > const&, Eigen::PlainObjectBase<Eigen::Matrix<float, -1, -1, 0, -1, -1> >&);\ntemplate bool igl::list_to_matrix<double, Eigen::Matrix<double, -1, 2, 0, -1, 2> >(std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > const&, Eigen::Matrix<double, -1, 2, 0, -1, 2>&);\ntemplate bool igl::list_to_matrix<double, Eigen::Matrix<double, -1, 3, 0, -1, 3> >(std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > const&, Eigen::Matrix<double, -1, 3, 0, -1, 3>&);\ntemplate bool igl::list_to_matrix<double, Eigen::PlainObjectBase<Eigen::Matrix<double, 2, 1, 0, 2, 1> > >(std::vector<double, std::allocator<double> > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, 2, 1, 0, 2, 1> >&);\ntemplate bool igl::list_to_matrix<double, Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 1, 0, 3, 1> > >(std::vector<double, std::allocator<double> > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, 3, 1, 0, 3, 1> >&);\ntemplate bool igl::list_to_matrix<double, Eigen::PlainObjectBase<Eigen::Matrix<double, 4, 1, 0, 4, 1> > >(std::vector<double, std::allocator<double> > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, 4, 1, 0, 4, 1> >&);\ntemplate bool igl::list_to_matrix<double, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 1, 0, -1, 1> > >(std::vector<double, std::allocator<double> > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 1, 0, -1, 1> >&);\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\nCopyright (c) 2003, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n    * Redistributions of source code must retain the above copyright\n      notice, this list of conditions and the following disclaimer.\n    * Redistributions in binary form must reproduce the above copyright\n      notice, this list of conditions and the following disclaimer in\n      the documentation and\/or other materials provided with the distribution.\n    * Neither the name of the author nor the names of its\n      contributors may be used to endorse or promote products derived\n      from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n\n#ifndef TORRENT_BENCODE_HPP_INCLUDED\n#define TORRENT_BENCODE_HPP_INCLUDED\n\n\n\n\/*\n * This file declares the following functions:\n *\n *----------------------------------\n * template<class OutIt>\n * void libtorrent::bencode(OutIt out, const libtorrent::entry& e);\n *\n * Encodes a message entry with bencoding into the output\n * iterator given. The bencoding is described in the BitTorrent\n * protocol description document OutIt must be an OutputIterator\n * of type char. This may throw libtorrent::invalid_encoding if\n * the entry contains invalid nodes (undefined_t for example).\n *\n *----------------------------------\n * template<class InIt>\n * libtorrent::entry libtorrent::bdecode(InIt start, InIt end);\n *\n * Decodes the buffer given by the start and end iterators\n * and returns the decoded entry. InIt must be an InputIterator\n * of type char. May throw libtorrent::invalid_encoding if\n * the string is not correctly bencoded.\n *\n *\/\n\n\n\n\n#include <cstdlib>\n\n#ifdef _MSC_VER\n#pragma warning(push, 1)\n#endif\n\n#include <boost\/lexical_cast.hpp>\n#include <boost\/static_assert.hpp>\n\n#ifdef _MSC_VER\n#pragma warning(pop)\n#endif\n\n#include \"libtorrent\/entry.hpp\"\n#include \"libtorrent\/config.hpp\"\n\n#include \"libtorrent\/assert.hpp\"\n\n#if defined(_MSC_VER)\nnamespace std\n{\n\tusing ::isdigit;\n\tusing ::atoi;\n};\n\n#define for if (false) {}  else for\n#endif\n\n\nnamespace libtorrent\n{\n\n\tstruct TORRENT_EXPORT invalid_encoding: std::exception\n\t{\n\t\tvirtual const char* what() const throw() { return \"invalid bencoding\"; }\n\t};\n\n\tnamespace detail\n\t{\n\t\ttemplate <class OutIt>\n\t\tvoid write_string(OutIt& out, const std::string& val)\n\t\t{\n\t\t\tstd::string::const_iterator end = val.begin() + val.length();\n\t\t\tstd::copy(val.begin(), end, out);\n\t\t}\n\n\t\tTORRENT_EXPORT char const* integer_to_str(char* buf, int size, entry::integer_type val);\n\n\t\ttemplate <class OutIt>\n\t\tvoid write_integer(OutIt& out, entry::integer_type val)\n\t\t{\n\t\t\t\/\/ the stack allocated buffer for keeping the\n\t\t\t\/\/ decimal representation of the number can\n\t\t\t\/\/ not hold number bigger than this:\n\t\t\tBOOST_STATIC_ASSERT(sizeof(entry::integer_type) <= 8);\n\t\t\tchar buf[21];\n\t\t\tfor (char const* str = integer_to_str(buf, 21, val);\n\t\t\t\t*str != 0; ++str)\n\t\t\t{\n\t\t\t\t*out = *str;\n\t\t\t\t++out;\n\t\t\t}\n\t\t}\t\n\t\t\n\t\ttemplate <class OutIt>\n\t\tvoid write_char(OutIt& out, char c)\n\t\t{\n\t\t\t*out = c;\n\t\t\t++out;\n\t\t}\n\n\t\ttemplate <class InIt>\n\t\tstd::string read_until(InIt& in, InIt end, char end_token)\n\t\t{\n\t\t\tif (in == end) throw invalid_encoding();\n\t\t\tstd::string ret;\n\t\t\twhile (*in != end_token)\n\t\t\t{\n\t\t\t\tret += *in;\n\t\t\t\t++in;\n\t\t\t\tif (in == end) throw invalid_encoding();\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\ttemplate<class InIt>\n\t\tvoid read_string(InIt& in, InIt end, int len, std::string& str)\n\t\t{\n\t\t\tTORRENT_ASSERT(len >= 0);\n\t\t\tfor (int i = 0; i < len; ++i)\n\t\t\t{\n\t\t\t\tif (in == end) throw invalid_encoding();\n\t\t\t\tstr += *in;\n\t\t\t\t++in;\n\t\t\t}\n\t\t}\n\n\t\ttemplate<class OutIt>\n\t\tvoid bencode_recursive(OutIt& out, const entry& e)\n\t\t{\n\t\t\tswitch(e.type())\n\t\t\t{\n\t\t\tcase entry::int_t:\n\t\t\t\twrite_char(out, 'i');\n\t\t\t\twrite_integer(out, e.integer());\n\t\t\t\twrite_char(out, 'e');\n\t\t\t\tbreak;\n\t\t\tcase entry::string_t:\n\t\t\t\twrite_integer(out, e.string().length());\n\t\t\t\twrite_char(out, ':');\n\t\t\t\twrite_string(out, e.string());\n\t\t\t\tbreak;\n\t\t\tcase entry::list_t:\n\t\t\t\twrite_char(out, 'l');\n\t\t\t\tfor (entry::list_type::const_iterator i = e.list().begin(); i != e.list().end(); ++i)\n\t\t\t\t\tbencode_recursive(out, *i);\n\t\t\t\twrite_char(out, 'e');\n\t\t\t\tbreak;\n\t\t\tcase entry::dictionary_t:\n\t\t\t\twrite_char(out, 'd');\n\t\t\t\tfor (entry::dictionary_type::const_iterator i = e.dict().begin();\n\t\t\t\t\ti != e.dict().end(); ++i)\n\t\t\t\t{\n\t\t\t\t\t\/\/ write key\n\t\t\t\t\twrite_integer(out, i->first.length());\n\t\t\t\t\twrite_char(out, ':');\n\t\t\t\t\twrite_string(out, i->first);\n\t\t\t\t\t\/\/ write value\n\t\t\t\t\tbencode_recursive(out, i->second);\n\t\t\t\t}\n\t\t\t\twrite_char(out, 'e');\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\t\/\/ do nothing\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\ttemplate<class InIt>\n\t\tvoid bdecode_recursive(InIt& in, InIt end, entry& ret)\n\t\t{\n\t\t\tif (in == end) throw invalid_encoding();\n\t\t\tswitch (*in)\n\t\t\t{\n\n\t\t\t\/\/ ----------------------------------------------\n\t\t\t\/\/ integer\n\t\t\tcase 'i':\n\t\t\t\t{\n\t\t\t\t++in; \/\/ 'i' \n\t\t\t\tstd::string val = read_until(in, end, 'e');\n\t\t\t\tTORRENT_ASSERT(*in == 'e');\n\t\t\t\t++in; \/\/ 'e' \n\t\t\t\tret = entry(entry::int_t);\n\t\t\t\tret.integer() = boost::lexical_cast<entry::integer_type>(val);\n\t\t\t\t} break;\n\n\t\t\t\/\/ ----------------------------------------------\n\t\t\t\/\/ list\n\t\t\tcase 'l':\n\t\t\t\t{\n\t\t\t\tret = entry(entry::list_t);\n\t\t\t\t++in; \/\/ 'l'\n\t\t\t\twhile (*in != 'e')\n\t\t\t\t{\n\t\t\t\t\tret.list().push_back(entry());\n\t\t\t\t\tentry& e = ret.list().back();\n\t\t\t\t\tbdecode_recursive(in, end, e);\n\t\t\t\t\tif (in == end) throw invalid_encoding();\n\t\t\t\t}\n\t\t\t\tTORRENT_ASSERT(*in == 'e');\n\t\t\t\t++in; \/\/ 'e'\n\t\t\t\t} break;\n\n\t\t\t\/\/ ----------------------------------------------\n\t\t\t\/\/ dictionary\n\t\t\tcase 'd':\n\t\t\t\t{\n\t\t\t\tret = entry(entry::dictionary_t);\n\t\t\t\t++in; \/\/ 'd'\n\t\t\t\twhile (*in != 'e')\n\t\t\t\t{\n\t\t\t\t\tentry key;\n\t\t\t\t\tbdecode_recursive(in, end, key);\n\t\t\t\t\tentry& e = ret[key.string()];\n\t\t\t\t\tbdecode_recursive(in, end, e);\n\t\t\t\t\tif (in == end) throw invalid_encoding();\n\t\t\t\t}\n\t\t\t\tTORRENT_ASSERT(*in == 'e');\n\t\t\t\t++in; \/\/ 'e'\n\t\t\t\t} break;\n\n\t\t\t\/\/ ----------------------------------------------\n\t\t\t\/\/ string\n\t\t\tdefault:\n\t\t\t\tif (isdigit((unsigned char)*in))\n\t\t\t\t{\n\t\t\t\t\tstd::string len_s = read_until(in, end, ':');\n\t\t\t\t\tTORRENT_ASSERT(*in == ':');\n\t\t\t\t\t++in; \/\/ ':'\n\t\t\t\t\tint len = std::atoi(len_s.c_str());\n\t\t\t\t\tret = entry(entry::string_t);\n\t\t\t\t\tread_string(in, end, len, ret.string());\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tthrow invalid_encoding();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\ttemplate<class OutIt>\n\tvoid bencode(OutIt out, const entry& e)\n\t{\n\t\tdetail::bencode_recursive(out, e);\n\t}\n\n\ttemplate<class InIt>\n\tentry bdecode(InIt start, InIt end)\n\t{\n\t\ttry\n\t\t{\n\t\t\tentry e;\n\t\t\tdetail::bdecode_recursive(start, end, e);\n\t\t\treturn e;\n\t\t}\n\t\tcatch(type_error&)\n\t\t{\n\t\t\tthrow invalid_encoding();\n\t\t}\n\t}\n\n}\n\n#endif \/\/ TORRENT_BENCODE_HPP_INCLUDED\n<commit_msg>made bdecoder not require exception support<commit_after>\/*\n\nCopyright (c) 2003, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n    * Redistributions of source code must retain the above copyright\n      notice, this list of conditions and the following disclaimer.\n    * Redistributions in binary form must reproduce the above copyright\n      notice, this list of conditions and the following disclaimer in\n      the documentation and\/or other materials provided with the distribution.\n    * Neither the name of the author nor the names of its\n      contributors may be used to endorse or promote products derived\n      from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n\n#ifndef TORRENT_BENCODE_HPP_INCLUDED\n#define TORRENT_BENCODE_HPP_INCLUDED\n\n\n\n\/*\n * This file declares the following functions:\n *\n *----------------------------------\n * template<class OutIt>\n * void libtorrent::bencode(OutIt out, const libtorrent::entry& e);\n *\n * Encodes a message entry with bencoding into the output\n * iterator given. The bencoding is described in the BitTorrent\n * protocol description document OutIt must be an OutputIterator\n * of type char. This may throw libtorrent::invalid_encoding if\n * the entry contains invalid nodes (undefined_t for example).\n *\n *----------------------------------\n * template<class InIt>\n * libtorrent::entry libtorrent::bdecode(InIt start, InIt end);\n *\n * Decodes the buffer given by the start and end iterators\n * and returns the decoded entry. InIt must be an InputIterator\n * of type char. May throw libtorrent::invalid_encoding if\n * the string is not correctly bencoded.\n *\n *\/\n\n\n\n\n#include <cstdlib>\n\n#ifdef _MSC_VER\n#pragma warning(push, 1)\n#endif\n\n#include <boost\/lexical_cast.hpp>\n#include <boost\/static_assert.hpp>\n\n#ifdef _MSC_VER\n#pragma warning(pop)\n#endif\n\n#include \"libtorrent\/entry.hpp\"\n#include \"libtorrent\/config.hpp\"\n\n#include \"libtorrent\/assert.hpp\"\n\n#if defined(_MSC_VER)\nnamespace std\n{\n\tusing ::isdigit;\n\tusing ::atoi;\n};\n\n#define for if (false) {}  else for\n#endif\n\n\nnamespace libtorrent\n{\n\n\tstruct TORRENT_EXPORT invalid_encoding: std::exception\n\t{\n\t\tvirtual const char* what() const throw() { return \"invalid bencoding\"; }\n\t};\n\n\tnamespace detail\n\t{\n\t\ttemplate <class OutIt>\n\t\tvoid write_string(OutIt& out, const std::string& val)\n\t\t{\n\t\t\tstd::string::const_iterator end = val.begin() + val.length();\n\t\t\tstd::copy(val.begin(), end, out);\n\t\t}\n\n\t\tTORRENT_EXPORT char const* integer_to_str(char* buf, int size, entry::integer_type val);\n\n\t\ttemplate <class OutIt>\n\t\tvoid write_integer(OutIt& out, entry::integer_type val)\n\t\t{\n\t\t\t\/\/ the stack allocated buffer for keeping the\n\t\t\t\/\/ decimal representation of the number can\n\t\t\t\/\/ not hold number bigger than this:\n\t\t\tBOOST_STATIC_ASSERT(sizeof(entry::integer_type) <= 8);\n\t\t\tchar buf[21];\n\t\t\tfor (char const* str = integer_to_str(buf, 21, val);\n\t\t\t\t*str != 0; ++str)\n\t\t\t{\n\t\t\t\t*out = *str;\n\t\t\t\t++out;\n\t\t\t}\n\t\t}\t\n\t\t\n\t\ttemplate <class OutIt>\n\t\tvoid write_char(OutIt& out, char c)\n\t\t{\n\t\t\t*out = c;\n\t\t\t++out;\n\t\t}\n\n\t\ttemplate <class InIt>\n\t\tstd::string read_until(InIt& in, InIt end, char end_token, bool& err)\n\t\t{\n\t\t\tstd::string ret;\n\t\t\tif (in == end)\n\t\t\t{\n\t\t\t\terr = true;\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t\twhile (*in != end_token)\n\t\t\t{\n\t\t\t\tret += *in;\n\t\t\t\t++in;\n\t\t\t\tif (in == end)\n\t\t\t\t{\n\t\t\t\t\terr = true;\n\t\t\t\t\treturn ret;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\ttemplate<class InIt>\n\t\tvoid read_string(InIt& in, InIt end, int len, std::string& str, bool& err)\n\t\t{\n\t\t\tTORRENT_ASSERT(len >= 0);\n\t\t\tfor (int i = 0; i < len; ++i)\n\t\t\t{\n\t\t\t\tif (in == end)\n\t\t\t\t{\n\t\t\t\t\terr = true;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tstr += *in;\n\t\t\t\t++in;\n\t\t\t}\n\t\t}\n\n\t\ttemplate<class OutIt>\n\t\tvoid bencode_recursive(OutIt& out, const entry& e)\n\t\t{\n\t\t\tswitch(e.type())\n\t\t\t{\n\t\t\tcase entry::int_t:\n\t\t\t\twrite_char(out, 'i');\n\t\t\t\twrite_integer(out, e.integer());\n\t\t\t\twrite_char(out, 'e');\n\t\t\t\tbreak;\n\t\t\tcase entry::string_t:\n\t\t\t\twrite_integer(out, e.string().length());\n\t\t\t\twrite_char(out, ':');\n\t\t\t\twrite_string(out, e.string());\n\t\t\t\tbreak;\n\t\t\tcase entry::list_t:\n\t\t\t\twrite_char(out, 'l');\n\t\t\t\tfor (entry::list_type::const_iterator i = e.list().begin(); i != e.list().end(); ++i)\n\t\t\t\t\tbencode_recursive(out, *i);\n\t\t\t\twrite_char(out, 'e');\n\t\t\t\tbreak;\n\t\t\tcase entry::dictionary_t:\n\t\t\t\twrite_char(out, 'd');\n\t\t\t\tfor (entry::dictionary_type::const_iterator i = e.dict().begin();\n\t\t\t\t\ti != e.dict().end(); ++i)\n\t\t\t\t{\n\t\t\t\t\t\/\/ write key\n\t\t\t\t\twrite_integer(out, i->first.length());\n\t\t\t\t\twrite_char(out, ':');\n\t\t\t\t\twrite_string(out, i->first);\n\t\t\t\t\t\/\/ write value\n\t\t\t\t\tbencode_recursive(out, i->second);\n\t\t\t\t}\n\t\t\t\twrite_char(out, 'e');\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\t\/\/ do nothing\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\ttemplate<class InIt>\n\t\tvoid bdecode_recursive(InIt& in, InIt end, entry& ret, bool& err)\n\t\t{\n\t\t\tif (in == end)\n\t\t\t{\n\t\t\t\terr = true;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tswitch (*in)\n\t\t\t{\n\n\t\t\t\/\/ ----------------------------------------------\n\t\t\t\/\/ integer\n\t\t\tcase 'i':\n\t\t\t\t{\n\t\t\t\t++in; \/\/ 'i' \n\t\t\t\tstd::string val = read_until(in, end, 'e', err);\n\t\t\t\tif (err) return;\n\t\t\t\tTORRENT_ASSERT(*in == 'e');\n\t\t\t\t++in; \/\/ 'e' \n\t\t\t\tret = entry(entry::int_t);\n\t\t\t\tret.integer() = boost::lexical_cast<entry::integer_type>(val);\n\t\t\t\t} break;\n\n\t\t\t\/\/ ----------------------------------------------\n\t\t\t\/\/ list\n\t\t\tcase 'l':\n\t\t\t\t{\n\t\t\t\tret = entry(entry::list_t);\n\t\t\t\t++in; \/\/ 'l'\n\t\t\t\twhile (*in != 'e')\n\t\t\t\t{\n\t\t\t\t\tret.list().push_back(entry());\n\t\t\t\t\tentry& e = ret.list().back();\n\t\t\t\t\tbdecode_recursive(in, end, e, err);\n\t\t\t\t\tif (err) return;\n\t\t\t\t\tif (in == end)\n\t\t\t\t\t{\n\t\t\t\t\t\terr = true;\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tTORRENT_ASSERT(*in == 'e');\n\t\t\t\t++in; \/\/ 'e'\n\t\t\t\t} break;\n\n\t\t\t\/\/ ----------------------------------------------\n\t\t\t\/\/ dictionary\n\t\t\tcase 'd':\n\t\t\t\t{\n\t\t\t\tret = entry(entry::dictionary_t);\n\t\t\t\t++in; \/\/ 'd'\n\t\t\t\twhile (*in != 'e')\n\t\t\t\t{\n\t\t\t\t\tentry key;\n\t\t\t\t\tbdecode_recursive(in, end, key, err);\n\t\t\t\t\tif (err) return;\n\t\t\t\t\tentry& e = ret[key.string()];\n\t\t\t\t\tbdecode_recursive(in, end, e, err);\n\t\t\t\t\tif (err) return;\n\t\t\t\t\tif (in == end)\n\t\t\t\t\t{\n\t\t\t\t\t\terr = true;\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tTORRENT_ASSERT(*in == 'e');\n\t\t\t\t++in; \/\/ 'e'\n\t\t\t\t} break;\n\n\t\t\t\/\/ ----------------------------------------------\n\t\t\t\/\/ string\n\t\t\tdefault:\n\t\t\t\tif (isdigit((unsigned char)*in))\n\t\t\t\t{\n\t\t\t\t\tstd::string len_s = read_until(in, end, ':', err);\n\t\t\t\t\tif (err) return;\n\t\t\t\t\tTORRENT_ASSERT(*in == ':');\n\t\t\t\t\t++in; \/\/ ':'\n\t\t\t\t\tint len = std::atoi(len_s.c_str());\n\t\t\t\t\tret = entry(entry::string_t);\n\t\t\t\t\tread_string(in, end, len, ret.string(), err);\n\t\t\t\t\tif (err) return;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\terr = true;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\ttemplate<class OutIt>\n\tvoid bencode(OutIt out, const entry& e)\n\t{\n\t\tdetail::bencode_recursive(out, e);\n\t}\n\n\ttemplate<class InIt>\n\tentry bdecode(InIt start, InIt end)\n\t{\n\t\tentry e;\n\t\tbool err = false;\n\t\tdetail::bdecode_recursive(start, end, e, err);\n\t\tif (err)\n\t\t{\n#ifdef BOOST_NO_EXCEPTIONS\n\t\t\treturn entry();\n#else\n\t\t\tthrow invalid_encoding();\n#endif\n\t\t}\n\t\treturn e;\n\t}\n\n}\n\n#endif \/\/ TORRENT_BENCODE_HPP_INCLUDED\n<|endoftext|>"}
{"text":"<commit_before>\/*!\n  @file PDBWriter.hpp\n  @brief pdb writer.\n\n  write pdb atoms or chains into output stream.\n\n  @author Toru Niina (niina.toru.68u@gmail.com)\n  @date 2016-10-18 10:00\n  @copyright Toru Niina 2016 on MIT License\n*\/\n#ifndef COFFEE_MILL_PDB_WRITER_HPP\n#define COFFEE_MILL_PDB_WRITER_HPP\n#include <mill\/common\/Trajectory.hpp>\n#include <mill\/common\/WriterBase.hpp>\n#include <mill\/util\/logger.hpp>\n#include <fstream>\n#include <sstream>\n#include <cstdio>\n\nnamespace mill\n{\n\nclass PDBWriter final : public WriterBase\n{\n  public:\n    using base_type                = WriterBase;\n    using trajectory_type          = base_type::trajectory_type;\n    using snapshot_type            = base_type::snapshot_type;\n    using particle_type            = base_type::particle_type;\n    using attribute_container_type = base_type::attribute_container_type;\n\n    PDBWriter(const std::string_view fname)\n        : current_(0), file_name_(fname), pdb_(file_name_)\n    {\n        if(!pdb_.good())\n        {\n            log::fatal(\"PDBWriter: file open error: \", fname);\n        }\n    }\n    ~PDBWriter() override = default;\n\n    void write_header(const attribute_container_type& header) override\n    {\n        if(header.count(\"boundary_width\") != 0)\n        {\n            const auto w = header.at(\"boundary_width\").as_vector();\n            \/\/ 80 chars + line feed + null\n            std::array<char, 82> buffer; buffer.fill('\\0');\n            std::snprintf(buffer.data(), buffer.size(),\n                          \"CRYST1%9.3f%9.3f%9.3f%7.2f%7.2f%7.2f%-10s%4d\\n\",\n                          w[0], w[1], w[2], 90.0, 90.0, 90.0, \"P 1\", 1);\n            pdb_ << buffer.data();\n        }\n        return; \/\/ xyz does not have any header info\n    }\n    void write(const trajectory_type& traj) override\n    {\n        for(const auto& frame : traj)\n        {\n            this->write_frame(frame);\n        }\n        return;\n    }\n    void write_frame(const snapshot_type& frame) override\n    {\n        using namespace std::literals::string_literals;\n        this->current_ += 1;\n        this->pdb_ << \"MODEL \" << this->current_ << '\\n';\n\n        char chain = '\\0';\n        std::int64_t serial = 0;\n        for(const auto& p : frame)\n        {\n            serial += 1;\n            const auto atom          = p.at(\"name\"    ).try_string().value_or(\" C  \"s).c_str();\n            const auto current_chain = p.at(\"chain_id\").try_string().value_or(\"A\"s).front();\n\n            \/\/ 80 chars + line feed + null\n            std::array<char, 82> buffer; buffer.fill('\\0');\n            std::snprintf(buffer.data(), buffer.size(),\n                \"%-6s%5ld %4s%c%3s %c%4ld%c   %8.3f%8.3f%8.3f%6.2f%6.2f          %2s%2s\\n\",\n                p.at(\"record\"  ).try_string() .value_or(\"ATOM  \"s).c_str(),\n                p.at(\"serial\"  ).try_integer().value_or(serial),\n                p.at(\"name\"    ).try_string() .value_or(\" C  \"s).c_str(),\n                p.at(\"alt_loc\" ).try_string() .value_or(\" \"s).front(),\n                p.at(\"res_name\").try_string() .value_or(\"XXX\"s).c_str(),\n                p.at(\"chain_id\").try_string() .value_or(\"A\"s).front(),\n                p.at(\"res_seq\" ).try_integer().value_or(serial),\n                p.at(\"i_code\"  ).try_string() .value_or(\" \"s).front(),\n                p.position()[0],\n                p.position()[1],\n                p.position()[2],\n                p.at(\"occupancy\"  ).try_floating().value_or(  0.0),\n                p.at(\"temp_factor\").try_floating().value_or(999.9),\n                p.at(\"element\"    ).try_string()  .value_or(atom.substr(0, 2)).c_str(),\n                p.at(\"charge\"     ).try_string()  .value_or(\"  \"s).c_str());\n            pdb_ << buffer.data();\n\n            if(chain != current_chain)\n            {\n                pdb << \"TER\\n\";\n            }\n            chain = current_chain;\n        }\n        pdb_ << \"ENDMDL\\n\";\n        return;\n    }\n\n    std::size_t      size()      const noexcept override {return current_;}\n    std::string_view file_name() const noexcept override {return file_name_;}\n\n  private:\n\n    std::size_t current_;\n    std::string file_name_;\n    std::ofstream pdb_;\n\n};\n\n} \/\/ mill\n#endif \/* COFFEE_MILL_PDB_WRITER *\/\n<commit_msg>:bug: fix TER position<commit_after>\/*!\n  @file PDBWriter.hpp\n  @brief pdb writer.\n\n  write pdb atoms or chains into output stream.\n\n  @author Toru Niina (niina.toru.68u@gmail.com)\n  @date 2016-10-18 10:00\n  @copyright Toru Niina 2016 on MIT License\n*\/\n#ifndef COFFEE_MILL_PDB_WRITER_HPP\n#define COFFEE_MILL_PDB_WRITER_HPP\n#include <mill\/common\/Trajectory.hpp>\n#include <mill\/common\/WriterBase.hpp>\n#include <mill\/util\/logger.hpp>\n#include <fstream>\n#include <sstream>\n#include <cstdio>\n\nnamespace mill\n{\n\nclass PDBWriter final : public WriterBase\n{\n  public:\n    using base_type                = WriterBase;\n    using trajectory_type          = base_type::trajectory_type;\n    using snapshot_type            = base_type::snapshot_type;\n    using particle_type            = base_type::particle_type;\n    using attribute_container_type = base_type::attribute_container_type;\n\n    PDBWriter(const std::string_view fname)\n        : current_(0), file_name_(fname), pdb_(file_name_)\n    {\n        if(!pdb_.good())\n        {\n            log::fatal(\"PDBWriter: file open error: \", fname);\n        }\n    }\n    ~PDBWriter() override = default;\n\n    void write_header(const attribute_container_type& header) override\n    {\n        if(header.count(\"boundary_width\") != 0)\n        {\n            const auto w = header.at(\"boundary_width\").as_vector();\n            \/\/ 80 chars + line feed + null\n            std::array<char, 82> buffer; buffer.fill('\\0');\n            std::snprintf(buffer.data(), buffer.size(),\n                          \"CRYST1%9.3f%9.3f%9.3f%7.2f%7.2f%7.2f%-10s%4d\\n\",\n                          w[0], w[1], w[2], 90.0, 90.0, 90.0, \"P 1\", 1);\n            pdb_ << buffer.data();\n        }\n        return; \/\/ xyz does not have any header info\n    }\n    void write(const trajectory_type& traj) override\n    {\n        for(const auto& frame : traj)\n        {\n            this->write_frame(frame);\n        }\n        return;\n    }\n    void write_frame(const snapshot_type& frame) override\n    {\n        using namespace std::literals::string_literals;\n        this->current_ += 1;\n        this->pdb_ << \"MODEL \" << this->current_ << '\\n';\n\n        char chain = '\\0';\n        std::int64_t serial = 0;\n        for(const auto& p : frame)\n        {\n            serial += 1;\n            const auto atom          = p.at(\"name\"    ).try_string().value_or(\" C  \"s);\n            const auto current_chain = p.at(\"chain_id\").try_string().value_or(\"A\"s).front();\n\n            \/\/ 80 chars + line feed + null\n            std::array<char, 82> buffer; buffer.fill('\\0');\n            std::snprintf(buffer.data(), buffer.size(),\n                \"%-6s%5ld %4s%c%3s %c%4ld%c   %8.3f%8.3f%8.3f%6.2f%6.2f          %2s%2s\\n\",\n                p.at(\"record\"  ).try_string() .value_or(\"ATOM  \"s).c_str(),\n                p.at(\"serial\"  ).try_integer().value_or(serial),\n                p.at(\"name\"    ).try_string() .value_or(\" C  \"s).c_str(),\n                p.at(\"alt_loc\" ).try_string() .value_or(\" \"s).front(),\n                p.at(\"res_name\").try_string() .value_or(\"XXX\"s).c_str(),\n                p.at(\"chain_id\").try_string() .value_or(\"A\"s).front(),\n                p.at(\"res_seq\" ).try_integer().value_or(serial),\n                p.at(\"i_code\"  ).try_string() .value_or(\" \"s).front(),\n                p.position()[0],\n                p.position()[1],\n                p.position()[2],\n                p.at(\"occupancy\"  ).try_floating().value_or(  0.0),\n                p.at(\"temp_factor\").try_floating().value_or(999.9),\n                p.at(\"element\"    ).try_string()  .value_or(atom.substr(0, 2)).c_str(),\n                p.at(\"charge\"     ).try_string()  .value_or(\"  \"s).c_str());\n            pdb_ << buffer.data();\n\n            if(chain != '\\0' && chain != current_chain)\n            {\n                pdb_ << \"TER\\n\";\n            }\n            chain = current_chain;\n        }\n        pdb_ << \"TER\\n\";\n        pdb_ << \"ENDMDL\\n\";\n        return;\n    }\n\n    std::size_t      size()      const noexcept override {return current_;}\n    std::string_view file_name() const noexcept override {return file_name_;}\n\n  private:\n\n    std::size_t current_;\n    std::string file_name_;\n    std::ofstream pdb_;\n\n};\n\n} \/\/ mill\n#endif \/* COFFEE_MILL_PDB_WRITER *\/\n<|endoftext|>"}
{"text":"<commit_before>\/*################################################################################\n  ##\n  ##   Copyright (C) 2016-2020 Keith O'Hara\n  ##\n  ##   This file is part of the OptimLib C++ library.\n  ##\n  ##   Licensed under the Apache License, Version 2.0 (the \"License\");\n  ##   you may not use this file except in compliance with the License.\n  ##   You may obtain a copy of the License at\n  ##\n  ##       http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n  ##\n  ##   Unless required by applicable law or agreed to in writing, software\n  ##   distributed under the License is distributed on an \"AS IS\" BASIS,\n  ##   WITHOUT WARRANTIES OR CONDITIONS OF ANY 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#pragma once\n\n#include <algorithm>\n#include <numeric>\n#include <vector>\n\n\/\/ version\n\n#ifndef OPTIM_VERSION_MAJOR\n    #define OPTIM_VERSION_MAJOR 2\n#endif\n\n#ifndef OPTIM_VERSION_MINOR\n    #define OPTIM_VERSION_MINOR 0\n#endif\n\n#ifndef OPTIM_VERSION_PATCH\n    #define OPTIM_VERSION_PATCH 0\n#endif\n\n\/\/\n\n#if defined(_OPENMP) && !defined(OPTIM_DONT_USE_OPENMP)\n    #undef OPTIM_USE_OPENMP\n    #define OPTIM_USE_OPENMP\n#endif\n\n#if !defined(_OPENMP) && defined(OPTIM_USE_OPENMP)\n    #undef OPTIM_USE_OPENMP\n\n    #undef OPTIM_DONE_USE_OPENMP\n    #define OPTIM_DONE_USE_OPENMP\n#endif\n\n\/\/ #ifdef OPTIM_USE_OPENMP\n    \/\/ #include \"omp.h\" \/\/  OpenMP\n\/\/ #endif\n\n#ifdef OPTIM_DONT_USE_OPENMP\n    #ifdef OPTIM_USE_OPENMP\n        #undef OPTIM_USE_OPENMP\n    #endif\n#endif\n\n\/\/\n\n#ifndef optimlib_inline\n    #define optimlib_inline \n#endif\n\n#ifdef OPTIM_ENABLE_ARMA_WRAPPERS\n    #ifdef USE_RCPP_ARMADILLO\n        #include <RcppArmadillo.h>\n    #else\n        #ifndef ARMA_DONT_USE_WRAPPER\n            #define ARMA_DONT_USE_WRAPPER\n        #endif\n        #include \"armadillo\"\n    #endif\n\n    #ifdef OPTIM_USE_OPENMP\n        #ifndef ARMA_USE_OPENMP\n            #define ARMA_USE_OPENMP\n        #endif\n    #endif\n\n    #ifdef OPTIM_DONT_USE_OPENMP\n        #ifndef ARMA_DONT_USE_OPENMP\n            #define ARMA_DONT_USE_OPENMP\n        #endif\n    #endif\n\n    namespace optim\n    {\n        using Mat_t = arma::mat;\n        using Vec_t = arma::vec;\n        using RowVec_t = arma::rowvec;\n        using VecInt_t = arma::uvec;\n    }\n#endif\n\n\/\/\n\n#ifdef OPTIM_ENABLE_EIGEN_WRAPPERS\n    #include <iostream>\n    #include <random>\n    #include <Eigen\/Dense>\n\n    template<typename eT, int iTr, int iTc>\n    using EigenMat = Eigen::Matrix<eT,iTr,iTc>;\n\n    namespace optim\n    {\n        using Mat_t = Eigen::MatrixXd;\n        using Vec_t = Eigen::VectorXd;\n        using RowVec_t = Eigen::Matrix<double,1,Eigen::Dynamic>;\n        using VecInt_t = Eigen::VectorXi;\n    }\n#endif\n\n\/\/\n\nnamespace optim\n{\n    static const double eps_dbl = std::numeric_limits<double>::epsilon();\n    static const double inf = std::numeric_limits<double>::infinity();\n    using uint_t = unsigned int;\n}\n<commit_msg>bump version<commit_after>\/*################################################################################\n  ##\n  ##   Copyright (C) 2016-2020 Keith O'Hara\n  ##\n  ##   This file is part of the OptimLib C++ library.\n  ##\n  ##   Licensed under the Apache License, Version 2.0 (the \"License\");\n  ##   you may not use this file except in compliance with the License.\n  ##   You may obtain a copy of the License at\n  ##\n  ##       http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n  ##\n  ##   Unless required by applicable law or agreed to in writing, software\n  ##   distributed under the License is distributed on an \"AS IS\" BASIS,\n  ##   WITHOUT WARRANTIES OR CONDITIONS OF ANY 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#pragma once\n\n#include <algorithm>\n#include <numeric>\n#include <vector>\n\n\/\/ version\n\n#ifndef OPTIM_VERSION_MAJOR\n    #define OPTIM_VERSION_MAJOR 2\n#endif\n\n#ifndef OPTIM_VERSION_MINOR\n    #define OPTIM_VERSION_MINOR 0\n#endif\n\n#ifndef OPTIM_VERSION_PATCH\n    #define OPTIM_VERSION_PATCH 1\n#endif\n\n\/\/\n\n#if defined(_OPENMP) && !defined(OPTIM_DONT_USE_OPENMP)\n    #undef OPTIM_USE_OPENMP\n    #define OPTIM_USE_OPENMP\n#endif\n\n#if !defined(_OPENMP) && defined(OPTIM_USE_OPENMP)\n    #undef OPTIM_USE_OPENMP\n\n    #undef OPTIM_DONE_USE_OPENMP\n    #define OPTIM_DONE_USE_OPENMP\n#endif\n\n\/\/ #ifdef OPTIM_USE_OPENMP\n    \/\/ #include \"omp.h\" \/\/  OpenMP\n\/\/ #endif\n\n#ifdef OPTIM_DONT_USE_OPENMP\n    #ifdef OPTIM_USE_OPENMP\n        #undef OPTIM_USE_OPENMP\n    #endif\n#endif\n\n\/\/\n\n#ifndef optimlib_inline\n    #define optimlib_inline \n#endif\n\n#ifdef OPTIM_ENABLE_ARMA_WRAPPERS\n    #ifdef USE_RCPP_ARMADILLO\n        #include <RcppArmadillo.h>\n    #else\n        #ifndef ARMA_DONT_USE_WRAPPER\n            #define ARMA_DONT_USE_WRAPPER\n        #endif\n        #include \"armadillo\"\n    #endif\n\n    #ifdef OPTIM_USE_OPENMP\n        #ifndef ARMA_USE_OPENMP\n            #define ARMA_USE_OPENMP\n        #endif\n    #endif\n\n    #ifdef OPTIM_DONT_USE_OPENMP\n        #ifndef ARMA_DONT_USE_OPENMP\n            #define ARMA_DONT_USE_OPENMP\n        #endif\n    #endif\n\n    namespace optim\n    {\n        using Mat_t = arma::mat;\n        using Vec_t = arma::vec;\n        using RowVec_t = arma::rowvec;\n        using VecInt_t = arma::uvec;\n    }\n#endif\n\n\/\/\n\n#ifdef OPTIM_ENABLE_EIGEN_WRAPPERS\n    #include <iostream>\n    #include <random>\n    #include <Eigen\/Dense>\n\n    template<typename eT, int iTr, int iTc>\n    using EigenMat = Eigen::Matrix<eT,iTr,iTc>;\n\n    namespace optim\n    {\n        using Mat_t = Eigen::MatrixXd;\n        using Vec_t = Eigen::VectorXd;\n        using RowVec_t = Eigen::Matrix<double,1,Eigen::Dynamic>;\n        using VecInt_t = Eigen::VectorXi;\n    }\n#endif\n\n\/\/\n\nnamespace optim\n{\n    static const double eps_dbl = std::numeric_limits<double>::epsilon();\n    static const double inf = std::numeric_limits<double>::infinity();\n    using uint_t = unsigned int;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Accessor.hpp\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 Aug 25, 2014\n *\/\n#ifndef ACCESSOR_HPP_\n#define ACCESSOR_HPP_\n\nnamespace fakeit {\n\ntemplate<typename O, typename T>\nclass Accessor {\npublic:\n\tAccessor(O* obj, T (O::*getter)()) :\n\t\t\t_obj(obj), _getter(getter) {\n\t}\n\toperator T() {\n\t\treturn (_obj->*_getter)();\n\t}\nprivate:\n\tO* _obj;\n\tT (O::*_getter)();\n};\n\n}\n\n\/\/\tstruct test\n\/\/\t{\n\/\/\n\/\/\t\tint real_i;\n\/\/\t\tint get_i()\n\/\/\t\t{\n\/\/\t\t\tstd::cout << \"geting i\" << std::endl;\n\/\/\t\t\treturn real_i;\n\/\/\t\t}\n\/\/\t\tAccessor<test,int> i;\n\/\/\t\ttest() :i(this,&test::get_i), real_i(0){};\n\/\/\t};\n\/\/\n\/\/\tvoid foo(){\n\/\/\t\ttest a;\n\/\/\t\tstd::cout << a.i << \"\\n\" << std::endl;\n\/\/\t}\n\/\/\n\n#endif \/* ACCESSOR_HPP_ *\/\n<commit_msg>remove redundant code<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ This is free and unencumbered software released into the public domain.\n\n\/\/ Anyone is free to copy, modify, publish, use, compile, sell, or\n\/\/ distribute this software, either in source code form or as a compiled\n\/\/ binary, for any purpose, commercial or non-commercial, and by any\n\/\/ means.\n\n\/\/ In jurisdictions that recognize copyright laws, the author or authors\n\/\/ of this software dedicate any and all copyright interest in the\n\/\/ software to the public domain. We make this dedication for the benefit\n\/\/ of the public at large and to the detriment of our heirs and\n\/\/ successors. We intend this dedication to be an overt act of\n\/\/ relinquishment in perpetuity of all present and future rights to this\n\/\/ software under copyright law.\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\/\/ For more information, please refer to <http:\/\/unlicense.org\/>\n\n\/\/ Note:\n\/\/ A combination of the algorithms described by the circular buffers\n\/\/ documentation found in the Linux kernel, and the bounded MPMC queue\n\/\/ by Dmitry Vyukov[1]. Implemented in pure C++11. Should work across\n\/\/ most CPU architectures.\n\/\/\n\/\/ [1] http:\/\/www.1024cores.net\/home\/lock-free-algorithms\/queues\/bounded-mpmc-queue\n\n#ifndef __SPSC_BOUNDED_QUEUE_INCLUDED__\n#define __SPSC_BOUNDED_QUEUE_INCLUDED__\n\n#include <atomic>\n#include <assert.h>\n\ntemplate<typename T>\nclass spsc_bounded_queue_t\n{\npublic:\n\n    spsc_bounded_queue_t(\n        size_t size) :\n        _size(size),\n        _mask(size - 1),\n        _buffer(reinterpret_cast<T*>(new aligned_t[_size + 1])), \/\/ need one extra element for a guard\n        _head(0),\n        _tail(0)\n    {\n        \/\/ make sure it's a power of 2\n        assert((_size != 0) && ((_size & (~_size + 1)) == _size));\n    }\n\n    ~spsc_bounded_queue_t()\n    {\n        delete _buffer;\n    }\n\n    bool\n    enqueue(\n        T& input)\n    {\n        std::atomic_thread_fence(std::memory_order_consume);\n        if ((_tail - (_head + 1) & _mask) >= 1) {\n            _buffer[_head & _mask] = input;\n            std::atomic_thread_fence(std::memory_order_acq_rel);\n            _head = _head + 1;\n            return true;\n        }\n        return false;\n    }\n\n    bool\n    dequeue(\n        T& output)\n    {\n        std::atomic_thread_fence(std::memory_order_consume);\n        if (((_head - _tail) & _mask) >= 1) {\n            output = _buffer[_tail & _mask];\n            std::atomic_thread_fence(std::memory_order_release);\n            _tail = _tail + 1;\n            return true;\n        }\n\n        return false;\n    }\n\n\nprivate:\n\n    typedef typename std::aligned_storage<sizeof(T), std::alignment_of<T>::value>::type aligned_t;\n\n    const size_t    _size;\n    const size_t    _mask;\n    T*              _buffer;\n    volatile size_t _head;\n    char            _cache_line[64];\n    volatile size_t _tail;\n\n    spsc_bounded_queue_t(const spsc_bounded_queue_t&) {}\n    void operator=(const spsc_bounded_queue_t&) {}\n};\n\n#endif\n<commit_msg>switched to using the atomic types, its easier to understand<commit_after>\/\/ This is free and unencumbered software released into the public domain.\n\n\/\/ Anyone is free to copy, modify, publish, use, compile, sell, or\n\/\/ distribute this software, either in source code form or as a compiled\n\/\/ binary, for any purpose, commercial or non-commercial, and by any\n\/\/ means.\n\n\/\/ In jurisdictions that recognize copyright laws, the author or authors\n\/\/ of this software dedicate any and all copyright interest in the\n\/\/ software to the public domain. We make this dedication for the benefit\n\/\/ of the public at large and to the detriment of our heirs and\n\/\/ successors. We intend this dedication to be an overt act of\n\/\/ relinquishment in perpetuity of all present and future rights to this\n\/\/ software under copyright law.\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\/\/ For more information, please refer to <http:\/\/unlicense.org\/>\n\n\/\/ Note:\n\/\/ A combination of the algorithms described by the circular buffers\n\/\/ documentation found in the Linux kernel, and the bounded MPMC queue\n\/\/ by Dmitry Vyukov[1]. Implemented in pure C++11. Should work across\n\/\/ most CPU architectures.\n\/\/\n\/\/ [1] http:\/\/www.1024cores.net\/home\/lock-free-algorithms\/queues\/bounded-mpmc-queue\n\n#ifndef __SPSC_BOUNDED_QUEUE_INCLUDED__\n#define __SPSC_BOUNDED_QUEUE_INCLUDED__\n\n#include <atomic>\n#include <assert.h>\n\ntemplate<typename T>\nclass spsc_bounded_queue_t\n{\npublic:\n\n    spsc_bounded_queue_t(\n        size_t size) :\n        _size(size),\n        _mask(size - 1),\n        _buffer(reinterpret_cast<T*>(new aligned_t[_size + 1])), \/\/ need one extra element for a guard\n        _head(0),\n        _tail(0)\n    {\n        \/\/ make sure it's a power of 2\n        assert((_size != 0) && ((_size & (~_size + 1)) == _size));\n    }\n\n    ~spsc_bounded_queue_t()\n    {\n        delete[] _buffer;\n    }\n\n    bool\n    enqueue(\n        T& input)\n    {\n        const size_t head = _head.load(std::memory_order_relaxed);\n\n        if (((_tail.load(std::memory_order_acquire) - (head + 1)) & _mask) >= 1) {\n            _buffer[head & _mask] = input;\n            _head.store(head + 1, std::memory_order_release);\n            return true;\n        }\n        return false;\n    }\n\n    bool\n    dequeue(\n        T& output)\n    {\n        const size_t tail = _tail.load(std::memory_order_relaxed);\n\n        if (((_head.load(std::memory_order_acquire) - tail) & _mask) >= 1) {\n            output = _buffer[_tail & _mask];\n            _tail.store(tail + 1, std::memory_order_release);\n            return true;\n        }\n        return false;\n    }\n\n\nprivate:\n\n    typedef typename std::aligned_storage<sizeof(T), std::alignment_of<T>::value>::type aligned_t;\n\n    const size_t        _size;\n    const size_t        _mask;\n    T* const            _buffer;\n    std::atomic<size_t> _head;\n    char                _cache_line[64];\n    std::atomic<size_t> _tail;\n\n    spsc_bounded_queue_t(const spsc_bounded_queue_t&) {}\n    void operator=(const spsc_bounded_queue_t&) {}\n};\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#ifndef V_SMC_CORE_PARTICLE_HPP\n#define V_SMC_CORE_PARTICLE_HPP\n\n#include <vSMC\/internal\/common.hpp>\n\nnamespace vSMC {\n\n\/\/\/ \\brief Particle class\n\/\/\/\n\/\/\/ \\tparam T State state type. Requiment:\n\/\/\/ \\li Consturctor: T (IntType N)\n\/\/\/ \\li Method: copy (IntType from, IntType to)\ntemplate <typename T>\nclass Particle\n{\n    public :\n\n    \/\/\/ The type of the particle values\n    typedef T value_type;\n\n    \/\/\/ The type of the size of the particle set\n    typedef EIGEN_DEFAULT_DENSE_INDEX_TYPE size_type;\n\n    \/\/\/ The type of the Counter-based random number generator\n    typedef V_SMC_CRNG_TYPE crng_type;\n\n    \/\/\/ The type of the Counter-based random number generator C++11 engine\n    typedef r123::Engine<crng_type> rng_type;\n\n    \/\/\/ The integer type of the seed\n    typedef rng_type::result_type seed_type;\n\n    \/\/\/ The type of the weight and log weight vectors\n    typedef Eigen::VectorXd weight_type;\n\n    \/\/\/ \\brief Construct a Particle object with given number of particles\n    \/\/\/\n    \/\/\/ \\param N The number of particles\n    \/\/\/ \\param seed The seed to the parallel RNG system\n    explicit Particle (size_type N, seed_type seed = V_SMC_CRNG_SEED) :\n        size_(N), value_(N), sampler_(NULL),\n        weight_(N), log_weight_(N), inc_weight_(N), replication_(N),\n        ess_(N), resampled_(false), zconst_(0), seed_(seed), prng_(N)\n    {\n        reset_prng();\n        weight_.setConstant(1.0 \/ size_);\n        log_weight_.setConstant(0);\n    }\n\n    \/\/\/ \\brief Size of the particle set\n    \/\/\/\n    \/\/\/ \\return The number of particles\n    size_type size () const\n    {\n        return size_;\n    }\n\n    \/\/\/ \\brief Read and write access to particle values\n    \/\/\/\n    \/\/\/ \\return A reference to the particle values, type (value_type &)\n    \/\/\/\n    \/\/\/ \\note When the system changes, this reference may be invalidated\n    value_type &value ()\n    {\n        return value_;\n    }\n\n    \/\/\/ \\brief Read only access to particle values\n    \/\/\/\n    \/\/\/ \\return A const reference to the particle values\n    \/\/\/\n    \/\/\/ \\note When the system changes, this reference may be invalidated\n    const value_type &value () const\n    {\n        return value_;\n    }\n\n    \/\/\/ \\brief Read only access to the weights through pointer\n    \/\/\/\n    \/\/\/ \\return A const pointer to the weight array\n    \/\/\/\n    \/\/\/ \\note When the system changes, this pointer may be invalidated\n    const double *weight_ptr () const\n    {\n        return weight_.data();\n    }\n\n    \/\/\/ \\brief Read only access to the log weights through pointer\n    \/\/\/\n    \/\/\/ \\return A const pointer to the log weight array\n    \/\/\/\n    \/\/\/ \\note When the system changes, this pointer may be invalidated\n    const double *log_weight_ptr () const\n    {\n        return log_weight_.data();\n    }\n\n    \/\/\/ \\brief Read only access to the weights through Eigen vector\n    \/\/\/\n    \/\/\/ \\return A const reference to the weight vector\n    \/\/\/\n    \/\/\/ \\note When the system changes, this reference may be invalidated\n    const weight_type &weight () const\n    {\n        return weight_;\n    }\n\n    \/\/\/ \\brief Read only access to the log weights through Eigen vector\n    \/\/\/\n    \/\/\/ \\return A const reference to the log weight vector\n    \/\/\/\n    \/\/\/ \\note When the system changes, this reference may be invalidated\n    const weight_type &log_weight () const\n    {\n        return log_weight_;\n    }\n\n    \/\/\/ \\brief Set the log weights\n    \/\/\/\n    \/\/\/ \\param new_weight New log weights\n    \/\/\/ \\param delta A multiplier appiled to new_weight\n    \/\/\/\n    \/\/\/ \\note new_weight need to have length at least equatl to size().\n    void set_log_weight (const double *new_weight, double delta = 1)\n    {\n        Eigen::Map<const weight_type> w(new_weight, size_);\n        set_log_weight(w, delta);\n    }\n\n    \/\/\/ \\brief Set the log weights\n    \/\/\/\n    \/\/\/ \\param new_weight New log weights\n    \/\/\/ \\param delta A multiplier appiled to new_weight\n    void set_log_weight (const weight_type &new_weight, double delta = 1)\n    {\n        log_weight_ = delta * new_weight.head(size_);\n        set_weight();\n    }\n\n    \/\/\/ \\brief Add to the log weights\n    \/\/\/\n    \/\/\/ \\param inc_weight Incremental log weights\n    \/\/\/ \\param delta A multiplier applied to inc_weight\n    \/\/\/ \\param add_zconst Whether this incremental weights should contribute\n    \/\/\/ the esitmates of normalizing constants\n    \/\/\/\n    \/\/\/ \\note inc_weight need to have length at least equatl to size().\n    void add_log_weight (const double *inc_weight, double delta = 1,\n            bool add_zconst = true)\n    {\n        Eigen::Map<const weight_type> w(inc_weight, size_);\n        add_log_weight(w, delta, add_zconst);\n    }\n\n    \/\/\/ \\brief Add to the log weights\n    \/\/\/\n    \/\/\/ \\param inc_weight Incremental log weights\n    \/\/\/ \\param delta A multiplier applied to inc_weight\n    \/\/\/ \\param add_zconst Whether this incremental weights should contribute\n    \/\/\/ the esitmates of normalizing constants\n    void add_log_weight (const weight_type &inc_weight, double delta = 1,\n            bool add_zconst = true)\n    {\n        using std::log;\n\n        if (add_zconst) {\n            inc_weight_ = (delta * inc_weight.head(size_)).array().exp();\n            zconst_ += log(weight_.dot(inc_weight_.head(size_)));\n        }\n        log_weight_ += delta * inc_weight.head(size_);\n        set_weight();\n    }\n\n    \/\/\/ \\brief The ESS (Effective Sample Size)\n    \/\/\/\n    \/\/\/ \\return The value of ESS for current particle set\n    double ess () const\n    {\n        return ess_;\n    }\n\n    \/\/\/ \\brief Get indicator of resampling\n    \/\/\/\n    \/\/\/ \\return A bool value, \\b true if the current iteration was resampled\n    bool resampled () const\n    {\n        return resampled_;\n    }\n\n    \/\/\/ \\brief Set indicator of resampling\n    \/\/\/\n    \/\/\/ \\param resampled \\b true if the current iteration was resampled\n    void resampled (bool resampled)\n    {\n        resampled_ = resampled;\n    }\n\n    \/\/\/ \\brief Read only access to the sampler this particle set belongs to\n    \/\/\/\n    \/\/\/ \\return A const reference to the sampler this particle set belongs to\n    const Sampler<value_type> &sampler () const\n    {\n        return *sampler_;\n    }\n\n    \/\/\/ \\brief Set the sampler this particle set belongs to\n    \/\/\/\n    \/\/\/ \\param samp A const pointer to the sampler this particle belongs to\n    void sampler (const Sampler<value_type> *samp)\n    {\n        sampler_ = samp;\n    }\n\n    \/\/\/ \\brief Get the value of SMC normalizing constant\n    \/\/\/\n    \/\/\/ \\return Log of SMC normalizng constant estimate\n    double zconst () const\n    {\n        return zconst_;\n    }\n\n    \/\/\/ \\brief Reset the value of SMC normalizing constant\n    void reset_zconst ()\n    {\n        zconst_ = 0;\n    }\n\n    \/\/\/ \\brief Perform resampling\n    \/\/\/\n    \/\/\/ \\param scheme The resampling scheme, see ResamplingScheme\n    void resample (ResampleScheme scheme)\n    {\n        switch (scheme) {\n            case MULTINOMIAL :\n                resample_multinomial();\n                break;\n            case RESIDUAL :\n                resample_residual();\n                break;\n            case STRATIFIED :\n                resample_stratified();\n                break;\n            case SYSTEMATIC :\n                resample_systematic();\n                break;\n            case RESIDUAL_STRATIFIED :\n                resample_residual_stratified ();\n                break;\n            default :\n                resample_stratified();\n                break;\n        }\n        resample_do();\n    }\n\n    \/\/\/ \\brief Get a C++11 RNG engine\n    \/\/\/\n    \/\/\/ \\param id The id of the particle, 0 to size() - 1\n    \/\/\/\n    \/\/\/ \\return A reference to a C++11 RNG engine unique to particle id, and\n    \/\/\/ independent of others\n    rng_type &prng (size_type id)\n    {\n        return prng_[id];\n    }\n\n    \/\/\/ \\brief Reset the parallel RNG system\n    \/\/\/\n    \/\/\/ \\param seed The new seed to the system\n    void reset_prng (seed_type seed)\n    {\n        seed_ = seed;\n        reset_prng();\n    }\n\n    \/\/\/ \\brief Reset the parallel RNG system using last time used seed\n    void reset_prng ()\n    {\n        for (size_type i = 0; i != size_; ++i)\n            prng_[i] = rng_type(seed_ + i * size_);\n    }\n\n    private :\n\n    typedef Eigen::Matrix<size_type, Eigen::Dynamic, 1> replication_type;\n    typedef Eigen::Matrix<rng_type, Eigen::Dynamic, 1> prng_type;\n\n    size_type size_;\n    value_type value_;\n    const Sampler<value_type> *sampler_;\n\n    weight_type weight_;\n    weight_type log_weight_;\n    weight_type inc_weight_;\n    replication_type replication_;\n\n    double ess_;\n    bool resampled_;\n    double zconst_;\n\n    seed_type seed_;\n    prng_type prng_;\n\n    void set_weight ()\n    {\n        double max_weight = log_weight_.maxCoeff();\n        log_weight_ = log_weight_.array() - max_weight;\n        weight_ = log_weight_.array().exp();\n        double sum = weight_.sum();\n        weight_ *= 1 \/ sum;\n        ess_ = 1 \/ weight_.squaredNorm();\n    }\n\n    void resample_multinomial ()\n    {\n        weight2replication(size_);\n    }\n\n    void resample_residual ()\n    {\n        \/\/\/ \\internal Reuse weight and log_weight. weight: act as the\n        \/\/\/ fractional part of N * weight. log_weight: act as the integral\n        \/\/\/ part of N * weight.  They all will be reset to equal weights after\n        \/\/\/ resampling.  So it is safe to modify them here.\n        using std::modf;\n\n        for (size_type i = 0; i != size_; ++i)\n            weight_[i] = modf(size_ * weight_[i], log_weight_.data() + i);\n        weight2replication(weight_.sum());\n        for (size_type i = 0; i != size_; ++i)\n            replication_[i] += log_weight_[i];\n    }\n\n    void resample_stratified ()\n    {\n        replication_.setConstant(0);\n        size_type j = 0;\n        size_type k = 0;\n        internal::uniform_real_distribution<> unif(0,1);\n        double u = unif(prng_[0]);\n        double cw = weight_[0];\n        while (j != size_) {\n            while (j < cw * size_ - u && j != size_) {\n                ++replication_[k];\n                u = unif(prng_[j++]);\n            }\n            if (k == size_ - 1)\n                break;\n            cw += weight_[++k];\n        }\n    }\n\n    void resample_systematic ()\n    {\n        replication_.setConstant(0);\n        size_type j = 0;\n        size_type k = 0;\n        internal::uniform_real_distribution<> unif(0,1);\n        double u = unif(prng_[0]);\n        double cw = weight_[0];\n        while (j != size_) {\n            while (j < cw * size_ - u && j != size_) {\n                ++replication_[k];\n                ++j;\n            }\n            if (k == size_ - 1)\n                break;\n            cw += weight_[++k];\n        }\n    }\n\n    void resample_residual_stratified ()\n    {\n        using std::modf;\n\n        replication_.setConstant(0);\n        for (size_type i = 0; i != size_; ++i)\n            weight_[i] = modf(size_ * weight_[i], log_weight_.data() + i);\n        size_type size = weight_.sum();\n        weight_ \/= size;\n        size_type j = 0;\n        size_type k = 0;\n        internal::uniform_real_distribution<> unif(0,1);\n        double u = unif(prng_[0]);\n        double cw = weight_[0];\n        while (j != size) {\n            while (j < cw * size - u && j != size) {\n                ++replication_[k];\n                u = unif(prng_[j++]);\n            }\n            if (k == size_ - 1)\n                break;\n            cw += weight_[++k];\n        }\n        for (size_type i = 0; i != size_; ++i)\n            replication_[i] += log_weight_[i];\n    }\n\n    void resample_residual_systematic ()\n    {\n        using std::modf;\n\n        replication_.setConstant(0);\n        for (size_type i = 0; i != size_; ++i)\n            weight_[i] = modf(size_ * weight_[i], log_weight_.data() + i);\n        size_type size = weight_.sum();\n        weight_ \/= size;\n        size_type j = 0;\n        size_type k = 0;\n        internal::uniform_real_distribution<> unif(0,1);\n        double u = unif(prng_[0]);\n        double cw = weight_[0];\n        while (j != size) {\n            while (j < cw * size - u && j != size) {\n                ++replication_[k];\n                ++j;\n            }\n            if (k == size_ - 1)\n                break;\n            cw += weight_[++k];\n        }\n        for (size_type i = 0; i != size_; ++i)\n            replication_[i] += log_weight_[i];\n    }\n\n    void weight2replication (size_type size)\n    {\n        double tp = weight_.sum();\n        double sum_p = 0;\n        size_type sum_n = 0;\n        replication_.setConstant(0);\n        for (size_type i = 0; i != size_; ++i) {\n            if (sum_n < size && weight_[i] > 0) {\n                internal::binomial_distribution<>\n                    binom(size - sum_n, weight_[i] \/ (tp - sum_p));\n                replication_[i] = binom(prng_[i]);\n            }\n            sum_p += weight_[i];\n            sum_n += replication_[i];\n        }\n    }\n\n    void resample_do ()\n    {\n        \/\/ Some times the nuemrical round error can cause the total childs\n        \/\/ differ from number of particles\n        size_type sum = replication_.sum();\n        if (sum != size_) {\n            size_type id_max;\n            replication_.maxCoeff(&id_max);\n            replication_[id_max] += size_ - sum;\n        }\n\n        size_type from = 0;\n        size_type time = 0;\n        for (size_type to = 0; to != size_; ++to) {\n            if (!replication_[to]) {\n                \/\/ replication_[to] has zero child, copy from elsewhere\n                if (replication_[from] - time <= 1) {\n                    \/\/ only 1 child left on replication_[from]\n                    time = 0;\n                    do \/\/ move from to some position with at least 2 children\n                        ++from;\n                    while (replication_[from] < 2);\n                }\n                value_.copy(from, to);\n                ++time;\n            }\n        }\n\n        ess_ = size_;\n        weight_.setConstant(1.0 \/ size_);\n        log_weight_.setConstant(0);\n    }\n}; \/\/ class Particle\n\n} \/\/ namespace vSMC\n\n#endif \/\/ V_SMC_CORE_PARTICLE_HPP\n<commit_msg>no try-catch<commit_after>#ifndef V_SMC_CORE_PARTICLE_HPP\n#define V_SMC_CORE_PARTICLE_HPP\n\n#include <vSMC\/internal\/common.hpp>\n\nnamespace vSMC {\n\n\/\/\/ \\brief Particle class\n\/\/\/\n\/\/\/ \\tparam T State state type. Requiment:\n\/\/\/ \\li Consturctor: T (IntType N)\n\/\/\/ \\li Method: copy (IntType from, IntType to)\ntemplate <typename T>\nclass Particle\n{\n    public :\n\n    \/\/\/ The type of the particle values\n    typedef T value_type;\n\n    \/\/\/ The type of the size of the particle set\n    typedef EIGEN_DEFAULT_DENSE_INDEX_TYPE size_type;\n\n    \/\/\/ The type of the Counter-based random number generator\n    typedef V_SMC_CRNG_TYPE crng_type;\n\n    \/\/\/ The type of the Counter-based random number generator C++11 engine\n    typedef r123::Engine<crng_type> rng_type;\n\n    \/\/\/ The integer type of the seed\n    typedef rng_type::result_type seed_type;\n\n    \/\/\/ The type of the weight and log weight vector\n    typedef Eigen::VectorXd weight_type;\n\n    \/\/\/ The type of the parallel RNG vector\n    typedef Eigen::Matrix<rng_type, Eigen::Dynamic, 1> prng_type;\n\n    \/\/\/ \\brief Construct a Particle object with given number of particles\n    \/\/\/\n    \/\/\/ \\param N The number of particles\n    \/\/\/ \\param seed The seed to the parallel RNG system\n    explicit Particle (size_type N, seed_type seed = V_SMC_CRNG_SEED) :\n        size_(N), value_(N), sampler_(NULL),\n        weight_(N), log_weight_(N), inc_weight_(N), replication_(N),\n        ess_(N), resampled_(false), zconst_(0), seed_(seed), prng_(N)\n    {\n        reset_prng();\n        weight_.setConstant(1.0 \/ size_);\n        log_weight_.setConstant(0);\n    }\n\n    \/\/\/ \\brief Size of the particle set\n    \/\/\/\n    \/\/\/ \\return The number of particles\n    size_type size () const\n    {\n        return size_;\n    }\n\n    \/\/\/ \\brief Read and write access to particle values\n    \/\/\/\n    \/\/\/ \\return A reference to the particle values, type (value_type &)\n    \/\/\/\n    \/\/\/ \\note When the system changes, this reference may be invalidated\n    value_type &value ()\n    {\n        return value_;\n    }\n\n    \/\/\/ \\brief Read only access to particle values\n    \/\/\/\n    \/\/\/ \\return A const reference to the particle values\n    \/\/\/\n    \/\/\/ \\note When the system changes, this reference may be invalidated\n    const value_type &value () const\n    {\n        return value_;\n    }\n\n    \/\/\/ \\brief Read only access to the weights through pointer\n    \/\/\/\n    \/\/\/ \\return A const pointer to the weight array\n    \/\/\/\n    \/\/\/ \\note When the system changes, this pointer may be invalidated\n    const double *weight_ptr () const\n    {\n        return weight_.data();\n    }\n\n    \/\/\/ \\brief Read only access to the log weights through pointer\n    \/\/\/\n    \/\/\/ \\return A const pointer to the log weight array\n    \/\/\/\n    \/\/\/ \\note When the system changes, this pointer may be invalidated\n    const double *log_weight_ptr () const\n    {\n        return log_weight_.data();\n    }\n\n    \/\/\/ \\brief Read only access to the weights through Eigen vector\n    \/\/\/\n    \/\/\/ \\return A const reference to the weight vector\n    \/\/\/\n    \/\/\/ \\note When the system changes, this reference may be invalidated\n    const weight_type &weight () const\n    {\n        return weight_;\n    }\n\n    \/\/\/ \\brief Read only access to the log weights through Eigen vector\n    \/\/\/\n    \/\/\/ \\return A const reference to the log weight vector\n    \/\/\/\n    \/\/\/ \\note When the system changes, this reference may be invalidated\n    const weight_type &log_weight () const\n    {\n        return log_weight_;\n    }\n\n    \/\/\/ \\brief Set the log weights\n    \/\/\/\n    \/\/\/ \\param new_weight New log weights\n    \/\/\/ \\param delta A multiplier appiled to new_weight\n    \/\/\/\n    \/\/\/ \\note new_weight need to have length at least equatl to size().\n    void set_log_weight (const double *new_weight, double delta = 1)\n    {\n        Eigen::Map<const weight_type> w(new_weight, size_);\n        set_log_weight(w, delta);\n    }\n\n    \/\/\/ \\brief Set the log weights\n    \/\/\/\n    \/\/\/ \\param new_weight New log weights\n    \/\/\/ \\param delta A multiplier appiled to new_weight\n    void set_log_weight (const weight_type &new_weight, double delta = 1)\n    {\n        log_weight_ = delta * new_weight.head(size_);\n        set_weight();\n    }\n\n    \/\/\/ \\brief Add to the log weights\n    \/\/\/\n    \/\/\/ \\param inc_weight Incremental log weights\n    \/\/\/ \\param delta A multiplier applied to inc_weight\n    \/\/\/ \\param add_zconst Whether this incremental weights should contribute\n    \/\/\/ the esitmates of normalizing constants\n    \/\/\/\n    \/\/\/ \\note inc_weight need to have length at least equatl to size().\n    void add_log_weight (const double *inc_weight, double delta = 1,\n            bool add_zconst = true)\n    {\n        Eigen::Map<const weight_type> w(inc_weight, size_);\n        add_log_weight(w, delta, add_zconst);\n    }\n\n    \/\/\/ \\brief Add to the log weights\n    \/\/\/\n    \/\/\/ \\param inc_weight Incremental log weights\n    \/\/\/ \\param delta A multiplier applied to inc_weight\n    \/\/\/ \\param add_zconst Whether this incremental weights should contribute\n    \/\/\/ the esitmates of normalizing constants\n    void add_log_weight (const weight_type &inc_weight, double delta = 1,\n            bool add_zconst = true)\n    {\n        using std::log;\n\n        if (add_zconst) {\n            inc_weight_ = (delta * inc_weight.head(size_)).array().exp();\n            zconst_ += log(weight_.dot(inc_weight_.head(size_)));\n        }\n        log_weight_ += delta * inc_weight.head(size_);\n        set_weight();\n    }\n\n    \/\/\/ \\brief The ESS (Effective Sample Size)\n    \/\/\/\n    \/\/\/ \\return The value of ESS for current particle set\n    double ess () const\n    {\n        return ess_;\n    }\n\n    \/\/\/ \\brief Get indicator of resampling\n    \/\/\/\n    \/\/\/ \\return A bool value, \\b true if the current iteration was resampled\n    bool resampled () const\n    {\n        return resampled_;\n    }\n\n    \/\/\/ \\brief Set indicator of resampling\n    \/\/\/\n    \/\/\/ \\param resampled \\b true if the current iteration was resampled\n    void resampled (bool resampled)\n    {\n        resampled_ = resampled;\n    }\n\n    \/\/\/ \\brief Read only access to the sampler this particle set belongs to\n    \/\/\/\n    \/\/\/ \\return A const reference to the sampler this particle set belongs to\n    const Sampler<value_type> &sampler () const\n    {\n        return *sampler_;\n    }\n\n    \/\/\/ \\brief Set the sampler this particle set belongs to\n    \/\/\/\n    \/\/\/ \\param samp A const pointer to the sampler this particle belongs to\n    void sampler (const Sampler<value_type> *samp)\n    {\n        sampler_ = samp;\n    }\n\n    \/\/\/ \\brief Get the value of SMC normalizing constant\n    \/\/\/\n    \/\/\/ \\return Log of SMC normalizng constant estimate\n    double zconst () const\n    {\n        return zconst_;\n    }\n\n    \/\/\/ \\brief Reset the value of SMC normalizing constant\n    void reset_zconst ()\n    {\n        zconst_ = 0;\n    }\n\n    \/\/\/ \\brief Perform resampling\n    \/\/\/\n    \/\/\/ \\param scheme The resampling scheme, see ResamplingScheme\n    void resample (ResampleScheme scheme)\n    {\n        switch (scheme) {\n            case MULTINOMIAL :\n                resample_multinomial();\n                break;\n            case RESIDUAL :\n                resample_residual();\n                break;\n            case STRATIFIED :\n                resample_stratified();\n                break;\n            case SYSTEMATIC :\n                resample_systematic();\n                break;\n            case RESIDUAL_STRATIFIED :\n                resample_residual_stratified ();\n                break;\n            default :\n                resample_stratified();\n                break;\n        }\n        resample_do();\n    }\n\n    \/\/\/ \\brief Get a C++11 RNG engine\n    \/\/\/\n    \/\/\/ \\param id The id of the particle, 0 to size() - 1\n    \/\/\/\n    \/\/\/ \\return A reference to a C++11 RNG engine unique to particle id, and\n    \/\/\/ independent of others\n    rng_type &prng (size_type id)\n    {\n        return prng_[id];\n    }\n\n    \/\/\/ \\brief Get a vector of C++11 RNG engines\n    \/\/\/\n    \/\/\/ \\return A reference to a vector of C++11 RNG engine, each one is\n    \/\/\/ unique and independent of others for the corresponding particle\n    prng_type &prng ()\n    {\n        return prng_;\n    }\n\n    \/\/\/ \\brief Reset the parallel RNG system\n    \/\/\/\n    \/\/\/ \\param seed The new seed to the system\n    void reset_prng (seed_type seed)\n    {\n        seed_ = seed;\n        reset_prng();\n    }\n\n    \/\/\/ \\brief Reset the parallel RNG system using last time used seed\n    void reset_prng ()\n    {\n        for (size_type i = 0; i != size_; ++i)\n            prng_[i] = rng_type(seed_ + i * size_);\n    }\n\n    private :\n\n    typedef Eigen::Matrix<size_type, Eigen::Dynamic, 1> replication_type;\n\n    size_type size_;\n    value_type value_;\n    const Sampler<value_type> *sampler_;\n\n    weight_type weight_;\n    weight_type log_weight_;\n    weight_type inc_weight_;\n    replication_type replication_;\n\n    double ess_;\n    bool resampled_;\n    double zconst_;\n\n    seed_type seed_;\n    prng_type prng_;\n\n    void set_weight ()\n    {\n        double max_weight = log_weight_.maxCoeff();\n        log_weight_ = log_weight_.array() - max_weight;\n        weight_ = log_weight_.array().exp();\n        double sum = weight_.sum();\n        weight_ *= 1 \/ sum;\n        ess_ = 1 \/ weight_.squaredNorm();\n    }\n\n    void resample_multinomial ()\n    {\n        weight2replication(size_);\n    }\n\n    void resample_residual ()\n    {\n        \/\/\/ \\internal Reuse weight and log_weight. weight: act as the\n        \/\/\/ fractional part of N * weight. log_weight: act as the integral\n        \/\/\/ part of N * weight.  They all will be reset to equal weights after\n        \/\/\/ resampling.  So it is safe to modify them here.\n        using std::modf;\n\n        for (size_type i = 0; i != size_; ++i)\n            weight_[i] = modf(size_ * weight_[i], log_weight_.data() + i);\n        weight2replication(weight_.sum());\n        for (size_type i = 0; i != size_; ++i)\n            replication_[i] += log_weight_[i];\n    }\n\n    void resample_stratified ()\n    {\n        replication_.setConstant(0);\n        size_type j = 0;\n        size_type k = 0;\n        internal::uniform_real_distribution<> unif(0,1);\n        double u = unif(prng_[0]);\n        double cw = weight_[0];\n        while (j != size_) {\n            while (j < cw * size_ - u && j != size_) {\n                ++replication_[k];\n                u = unif(prng_[j++]);\n            }\n            if (k == size_ - 1)\n                break;\n            cw += weight_[++k];\n        }\n    }\n\n    void resample_systematic ()\n    {\n        replication_.setConstant(0);\n        size_type j = 0;\n        size_type k = 0;\n        internal::uniform_real_distribution<> unif(0,1);\n        double u = unif(prng_[0]);\n        double cw = weight_[0];\n        while (j != size_) {\n            while (j < cw * size_ - u && j != size_) {\n                ++replication_[k];\n                ++j;\n            }\n            if (k == size_ - 1)\n                break;\n            cw += weight_[++k];\n        }\n    }\n\n    void resample_residual_stratified ()\n    {\n        using std::modf;\n\n        replication_.setConstant(0);\n        for (size_type i = 0; i != size_; ++i)\n            weight_[i] = modf(size_ * weight_[i], log_weight_.data() + i);\n        size_type size = weight_.sum();\n        weight_ \/= size;\n        size_type j = 0;\n        size_type k = 0;\n        internal::uniform_real_distribution<> unif(0,1);\n        double u = unif(prng_[0]);\n        double cw = weight_[0];\n        while (j != size) {\n            while (j < cw * size - u && j != size) {\n                ++replication_[k];\n                u = unif(prng_[j++]);\n            }\n            if (k == size_ - 1)\n                break;\n            cw += weight_[++k];\n        }\n        for (size_type i = 0; i != size_; ++i)\n            replication_[i] += log_weight_[i];\n    }\n\n    void resample_residual_systematic ()\n    {\n        using std::modf;\n\n        replication_.setConstant(0);\n        for (size_type i = 0; i != size_; ++i)\n            weight_[i] = modf(size_ * weight_[i], log_weight_.data() + i);\n        size_type size = weight_.sum();\n        weight_ \/= size;\n        size_type j = 0;\n        size_type k = 0;\n        internal::uniform_real_distribution<> unif(0,1);\n        double u = unif(prng_[0]);\n        double cw = weight_[0];\n        while (j != size) {\n            while (j < cw * size - u && j != size) {\n                ++replication_[k];\n                ++j;\n            }\n            if (k == size_ - 1)\n                break;\n            cw += weight_[++k];\n        }\n        for (size_type i = 0; i != size_; ++i)\n            replication_[i] += log_weight_[i];\n    }\n\n    void weight2replication (size_type size)\n    {\n        double tp = weight_.sum();\n        double sum_p = 0;\n        size_type sum_n = 0;\n        replication_.setConstant(0);\n        for (size_type i = 0; i != size_; ++i) {\n            if (sum_n < size && weight_[i] > 0) {\n                internal::binomial_distribution<>\n                    binom(size - sum_n, weight_[i] \/ (tp - sum_p));\n                replication_[i] = binom(prng_[i]);\n            }\n            sum_p += weight_[i];\n            sum_n += replication_[i];\n        }\n    }\n\n    void resample_do ()\n    {\n        \/\/ Some times the nuemrical round error can cause the total childs\n        \/\/ differ from number of particles\n        size_type sum = replication_.sum();\n        if (sum != size_) {\n            size_type id_max;\n            replication_.maxCoeff(&id_max);\n            replication_[id_max] += size_ - sum;\n        }\n\n        size_type from = 0;\n        size_type time = 0;\n        for (size_type to = 0; to != size_; ++to) {\n            if (!replication_[to]) {\n                \/\/ replication_[to] has zero child, copy from elsewhere\n                if (replication_[from] - time <= 1) {\n                    \/\/ only 1 child left on replication_[from]\n                    time = 0;\n                    do \/\/ move from to some position with at least 2 children\n                        ++from;\n                    while (replication_[from] < 2);\n                }\n                value_.copy(from, to);\n                ++time;\n            }\n        }\n\n        ess_ = size_;\n        weight_.setConstant(1.0 \/ size_);\n        log_weight_.setConstant(0);\n    }\n}; \/\/ class Particle\n\n} \/\/ namespace vSMC\n\n#endif \/\/ V_SMC_CORE_PARTICLE_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * @file fslightshare.cpp\n * @brief Firestorm Lightshare handler\n *\n * $LicenseInfo:firstyear=2012&license=fsviewerlgpl$\n * Phoenix Firestorm Viewer Source Code\n * Copyright (C) 2012, Cinder Roxley <cinder@cinderblocks.biz>\n * Lightshare is a registered trademark of Magne Metaverse Research, LLC\n *\n * This 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 * The Phoenix Firestorm Project, Inc., 1831 Oakwood Drive, Fairmont, Minnesota 56031-3225 USA\n * http:\/\/www.phoenixviewer.com\n * $\/LicenseInfo$\n *\/\n\n#include \"llviewerprecompiledheaders.h\"\n\n#include \"fslightshare.h\"\n#include \"llviewermessage.h\"\n#include \"llwaterparammanager.h\"\n#include \"llwlparammanager.h\"\n#include \"llenvmanager.h\"\n#include \"llviewercontrol.h\"\n#include \"llstatusbar.h\"\n\nFSLightshare::FSLightshare() : mLightshareState(false)\n{}\n\n\/\/ virtual\nFSLightshare::~FSLightshare()\n{}\n\nvoid FSLightshare::processLightshareMessage(LLMessageSystem* msg)\n{\n\t\/\/\/ <FS:CR> TODO: It would be nice to handle this per event like parcel wl rather than a blanket boolean turning\n\t\/\/\/ Lightshare on or off\n\tif (!gSavedSettings.getBOOL(\"FSOpenSimLightshare\"))\n\t{\n\t\tllinfos << \"Received Lightshare message from the region, but Lightshare is disabled.\" << llendl;\n\t\treturn;\n\t}\n\t\/\/ Be paranoid!\n\tif (!msg)\n\t{\n\t\treturn;\n\t}\n\tstd::string method;\n\tmsg->getStringFast(_PREHASH_MethodData, _PREHASH_Method, method);\n\tif (method != \"Windlight\")\n\t{\n\t\treturn;\n\t}\n\tS32 size = msg->getSizeFast(_PREHASH_ParamList, 0, _PREHASH_Parameter);\n\tif (size < 0 || 250 < size)\n\t{\n\t\treturn;\n\t}\n\t\/\/ Ok, it checks out (sorta)\n\t\n\tS32 count = msg->getNumberOfBlocksFast(_PREHASH_ParamList);\n\tfor (S32 i = 0; i < count; ++i)\n\t{\n\t\tS32 size = msg->getSizeFast(_PREHASH_ParamList, i, _PREHASH_Parameter);\n\t\tif (size >= 0)\n\t\t{\n\t\t\tchar buffer[250];\n\t\t\tmsg->getBinaryDataFast(_PREHASH_ParamList, _PREHASH_Parameter, buffer, size, i, 249);\n\t\t\tLightsharePacket* ls_packet = (LightsharePacket*)buffer; \/\/ <-- warning! ugly stupid, not byte-order safe!\n\n\t\t\tllinfos << \"Received Lightshare message from the region, processing it.\" << llendl;\n\t\t\tprocessWater(ls_packet);\n\t\t\tprocessSky(ls_packet);\n\t\t}\n\t}\n\tsetState(true);\n\tgStatusBar->updateParcelIcons();\n}\n\nvoid FSLightshare::processLightshareRefresh()\n{\n\tLLEnvManagerNew::getInstance()->usePrefs();\n\tsetState(false);\n\tgStatusBar->updateParcelIcons();\n}\n\n\/\/ static\nvoid FSLightshare::processSky(LightsharePacket* ls_packet)\n{\n\tLLWLParamManager* wlparammgr = LLWLParamManager::getInstance();\n\twlparammgr->mAnimator.deactivate();\n\tLLWLParamSet & param_set = wlparammgr->mCurParams;\n\t\n\tparam_set.setSunAngle(F_TWO_PI * ls_packet->sunMoonPosiiton);\n\tparam_set.setEastAngle(F_TWO_PI * ls_packet->eastAngle);\n\tparam_set.set(\"sunlight_color\", ls_packet->sunMoonColor.red * 3.0f, ls_packet->sunMoonColor.green * 3.0f, ls_packet->sunMoonColor.blue * 3.0f, ls_packet->sunMoonColor.alpha * 3.0f);\n\tparam_set.set(\"ambient\", ls_packet->ambient.red * 3.0f, ls_packet->ambient.green * 3.0f, ls_packet->ambient.blue * 3.0f, ls_packet->ambient.alpha * 3.0f);\n\tparam_set.set(\"blue_horizon\", ls_packet->horizon.red * 2.0f, ls_packet->horizon.green *2.0f, ls_packet->horizon.blue * 2.0f, ls_packet->horizon.alpha * 2.0f);\n\tparam_set.set(\"blue_density\", ls_packet->blueDensity.red * 2.0f, ls_packet->blueDensity.green * 2.0f, ls_packet->blueDensity.blue * 2.0f, ls_packet->blueDensity.alpha * 2.0f);\n\tparam_set.set(\"haze_horizon\", ls_packet->hazeHorizon, ls_packet->hazeHorizon, ls_packet->hazeHorizon, 1.f);\n\tparam_set.set(\"haze_density\", ls_packet->hazeDensity, ls_packet->hazeDensity, ls_packet->hazeDensity, 1.f);\n\tparam_set.set(\"cloud_shadow\", ls_packet->cloudCoverage, ls_packet->cloudCoverage, ls_packet->cloudCoverage, ls_packet->cloudCoverage);\n\tparam_set.set(\"density_multiplier\", ls_packet->densityMultiplier \/ 1000.0f);\n\tparam_set.set(\"distance_multiplier\", ls_packet->distanceMultiplier, ls_packet->distanceMultiplier, ls_packet->distanceMultiplier, ls_packet->distanceMultiplier);\n\tparam_set.set(\"max_y\",(F32)ls_packet->maxAltitude);\n\tparam_set.set(\"cloud_color\", ls_packet->cloudColor.red, ls_packet->cloudColor.green, ls_packet->cloudColor.blue, ls_packet->cloudColor.alpha);\n\tparam_set.set(\"cloud_pos_density1\", ls_packet->cloudXYDensity.X, ls_packet->cloudXYDensity.Y, ls_packet->cloudXYDensity.Z);\n\tparam_set.set(\"cloud_pos_density2\", ls_packet->cloudDetailXYDensity.X, ls_packet->cloudDetailXYDensity.Y, ls_packet->cloudDetailXYDensity.Z);\n\tparam_set.set(\"cloud_scale\", ls_packet->cloudScale, 0.f, 0.f, 1.f);\n\tparam_set.set(\"gamma\", ls_packet->sceneGamma, ls_packet->sceneGamma, ls_packet->sceneGamma, 0.0f);\n\tparam_set.set(\"glow\",(2 - ls_packet->sunGlowSize) * 20 , 0.f, -ls_packet->sunGlowFocus * 5);\n\tparam_set.setCloudScrollX(ls_packet->cloudScrollX + 10.0f);\n\tparam_set.setCloudScrollY(ls_packet->cloudScrollY + 10.0f);\n\tparam_set.setEnableCloudScrollX(!ls_packet->cloudScrollXLock);\n\tparam_set.setEnableCloudScrollY(!ls_packet->cloudScrollYLock);\n\tparam_set.setStarBrightness(ls_packet->starBrightness);\n\t\n\tLLWLParamManager::getInstance()->propagateParameters();\n\t\n\tLLWLParamKey ls_key;\n\tls_key.name = \"LightshareCurrentRegion\";\n\tls_key.scope = LLEnvKey::SCOPE_LOCAL;\n\twlparammgr->setParamSet(ls_key, param_set);\n}\n\n\/\/ static\nvoid FSLightshare::processWater(LightsharePacket* ls_packet)\n{\n\tLLWaterParamManager* wwparammgr = LLWaterParamManager::getInstance();\n\tLLWaterParamSet & param_set = wwparammgr->mCurParams;\n\t\n\tparam_set.set(\"waterFogColor\", ls_packet->waterColor.red \/ 256.f, ls_packet->waterColor.green \/ 256.f, ls_packet->waterColor.blue \/ 256.f);\n\tparam_set.set(\"waterFogDensity\", pow(2.0f, ls_packet->waterFogDensityExponent));\n\tparam_set.set(\"underWaterFogMod\", ls_packet->underwaterFogModifier);\n\tparam_set.set(\"normScale\", ls_packet->reflectionWaveletScale.X,ls_packet->reflectionWaveletScale.Y,ls_packet->reflectionWaveletScale.Z);\n\tparam_set.set(\"fresnelScale\", ls_packet->fresnelScale);\n\tparam_set.set(\"fresnelOffset\", ls_packet->fresnelOffset);\n\tparam_set.set(\"scaleAbove\", ls_packet->refractScaleAbove);\n\tparam_set.set(\"scaleBelow\", ls_packet->refractScaleBelow);\n\tparam_set.set(\"blurMultiplier\", ls_packet->blurMultiplier);\n\tparam_set.set(\"wave1Dir\", ls_packet->littleWaveDirection.X, ls_packet->littleWaveDirection.Y);\n\tparam_set.set(\"wave2Dir\", ls_packet->bigWaveDirection.X, ls_packet->bigWaveDirection.Y);\n\t\n\tLLUUID normalMapTexture;\n\t\n\tstd::string out = llformat(\"%02x%02x%02x%02x-%02x%02x-%02x%02x-%02x%02x-%02x%02x%02x%02x%02x%02x\",\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[0]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[1]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[2]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[3]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[4]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[5]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[6]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[7]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[8]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[9]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[10]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[11]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[12]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[13]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[14]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[15]));\n\t\n\tnormalMapTexture.set(out);\n\t\n\tLLWaterParamManager::getInstance()->setNormalMapID(normalMapTexture);\n\tLLWaterParamManager::getInstance()->propagateParameters();\n\t\n\twwparammgr->setParamSet(\"LightshareCurrentRegion\", param_set);\n\twwparammgr->setNormalMapID(normalMapTexture);\n}\n\nvoid FSLightshare::setState(bool has_lightshare)\n{\n\t\tmLightshareState = has_lightshare;\n}\n<commit_msg>FIRE-5118: Lightshare bug fix<commit_after>\/*\n * @file fslightshare.cpp\n * @brief Firestorm Lightshare handler\n *\n * $LicenseInfo:firstyear=2012&license=fsviewerlgpl$\n * Phoenix Firestorm Viewer Source Code\n * Copyright (C) 2012, Cinder Roxley <cinder@cinderblocks.biz>\n * Lightshare is a registered trademark of Magne Metaverse Research, LLC\n *\n * This 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 * The Phoenix Firestorm Project, Inc., 1831 Oakwood Drive, Fairmont, Minnesota 56031-3225 USA\n * http:\/\/www.phoenixviewer.com\n * $\/LicenseInfo$\n *\/\n\n#include \"llviewerprecompiledheaders.h\"\n\n#include \"fslightshare.h\"\n#include \"llviewermessage.h\"\n#include \"llwaterparammanager.h\"\n#include \"llwlparammanager.h\"\n#include \"llenvmanager.h\"\n#include \"llviewercontrol.h\"\n#include \"llstatusbar.h\"\n\nFSLightshare::FSLightshare() : mLightshareState(false)\n{}\n\n\/\/ virtual\nFSLightshare::~FSLightshare()\n{}\n\nvoid FSLightshare::processLightshareMessage(LLMessageSystem* msg)\n{\n\t\/\/\/ <FS:CR> TODO: It would be nice to handle this per event like parcel wl rather than a blanket boolean turning\n\t\/\/\/ Lightshare on or off\n\tif (!gSavedSettings.getBOOL(\"FSOpenSimLightshare\"))\n\t{\n\t\tllinfos << \"Received Lightshare message from the region, but Lightshare is disabled.\" << llendl;\n\t\treturn;\n\t}\n\t\/\/ Be paranoid!\n\tif (!msg)\n\t{\n\t\treturn;\n\t}\n\tstd::string method;\n\tmsg->getStringFast(_PREHASH_MethodData, _PREHASH_Method, method);\n\tif (method != \"Windlight\")\n\t{\n\t\treturn;\n\t}\n\tS32 size = msg->getSizeFast(_PREHASH_ParamList, 0, _PREHASH_Parameter);\n\tif (size < 0 || 250 < size)\n\t{\n\t\treturn;\n\t}\n\t\/\/ Ok, it checks out (sorta)\n\t\n\tS32 count = msg->getNumberOfBlocksFast(_PREHASH_ParamList);\n\tfor (S32 i = 0; i < count; ++i)\n\t{\n\t\tS32 size = msg->getSizeFast(_PREHASH_ParamList, i, _PREHASH_Parameter);\n\t\tif (size >= 0)\n\t\t{\n\t\t\tchar buffer[250];\n\t\t\tmsg->getBinaryDataFast(_PREHASH_ParamList, _PREHASH_Parameter, buffer, size, i, 249);\n\t\t\tLightsharePacket* ls_packet = (LightsharePacket*)buffer; \/\/ <-- warning! ugly stupid, not byte-order safe!\n\n\t\t\tllinfos << \"Received Lightshare message from the region, processing it.\" << llendl;\n\t\t\tprocessWater(ls_packet);\n\t\t\tprocessSky(ls_packet);\n\t\t}\n\t}\n\tsetState(true);\n\tgStatusBar->updateParcelIcons();\n}\n\nvoid FSLightshare::processLightshareRefresh()\n{\n\tLLEnvManagerNew::getInstance()->usePrefs();\n\tsetState(false);\n\tgStatusBar->updateParcelIcons();\n}\n\n\/\/ static\nvoid FSLightshare::processSky(LightsharePacket* ls_packet)\n{\n\tLLWLParamManager* wlparammgr = LLWLParamManager::getInstance();\n\twlparammgr->mAnimator.deactivate();\n\tLLWLParamSet & param_set = wlparammgr->mCurParams;\n\t\n\tparam_set.setSunAngle(F_TWO_PI * ls_packet->sunMoonPosiiton);\n\tparam_set.setEastAngle(F_TWO_PI * ls_packet->eastAngle);\n\tparam_set.set(\"sunlight_color\", ls_packet->sunMoonColor.red * 3.0f, ls_packet->sunMoonColor.green * 3.0f, ls_packet->sunMoonColor.blue * 3.0f, ls_packet->sunMoonColor.alpha * 3.0f);\n\tparam_set.set(\"ambient\", ls_packet->ambient.red * 3.0f, ls_packet->ambient.green * 3.0f, ls_packet->ambient.blue * 3.0f, ls_packet->ambient.alpha * 3.0f);\n\tparam_set.set(\"blue_horizon\", ls_packet->horizon.red * 2.0f, ls_packet->horizon.green *2.0f, ls_packet->horizon.blue * 2.0f, ls_packet->horizon.alpha * 2.0f);\n\tparam_set.set(\"blue_density\", ls_packet->blueDensity.red * 2.0f, ls_packet->blueDensity.green * 2.0f, ls_packet->blueDensity.blue * 2.0f, ls_packet->blueDensity.alpha * 2.0f);\n\tparam_set.set(\"haze_horizon\", ls_packet->hazeHorizon, ls_packet->hazeHorizon, ls_packet->hazeHorizon, 1.f);\n\tparam_set.set(\"haze_density\", ls_packet->hazeDensity, ls_packet->hazeDensity, ls_packet->hazeDensity, 1.f);\n\tparam_set.set(\"cloud_shadow\", ls_packet->cloudCoverage, ls_packet->cloudCoverage, ls_packet->cloudCoverage, ls_packet->cloudCoverage);\n\tparam_set.set(\"density_multiplier\", ls_packet->densityMultiplier \/ 1000.0f);\n\tparam_set.set(\"distance_multiplier\", ls_packet->distanceMultiplier, ls_packet->distanceMultiplier, ls_packet->distanceMultiplier, ls_packet->distanceMultiplier);\n\tparam_set.set(\"max_y\",(F32)ls_packet->maxAltitude);\n\tparam_set.set(\"cloud_color\", ls_packet->cloudColor.red, ls_packet->cloudColor.green, ls_packet->cloudColor.blue, ls_packet->cloudColor.alpha);\n\tparam_set.set(\"cloud_pos_density1\", ls_packet->cloudXYDensity.X, ls_packet->cloudXYDensity.Y, ls_packet->cloudXYDensity.Z);\n\tparam_set.set(\"cloud_pos_density2\", ls_packet->cloudDetailXYDensity.X, ls_packet->cloudDetailXYDensity.Y, ls_packet->cloudDetailXYDensity.Z);\n\tparam_set.set(\"cloud_scale\", ls_packet->cloudScale, 0.f, 0.f, 1.f);\n\tparam_set.set(\"gamma\", ls_packet->sceneGamma, ls_packet->sceneGamma, ls_packet->sceneGamma, 0.0f);\n\tparam_set.set(\"glow\",(2 - ls_packet->sunGlowSize) * 20 , 0.f, -ls_packet->sunGlowFocus * 5);\n\tparam_set.setCloudScrollX(ls_packet->cloudScrollX + 10.0f);\n\tparam_set.setCloudScrollY(ls_packet->cloudScrollY + 10.0f);\n\tparam_set.setEnableCloudScrollX(!ls_packet->cloudScrollXLock);\n\tparam_set.setEnableCloudScrollY(!ls_packet->cloudScrollYLock);\n\tparam_set.setStarBrightness(ls_packet->starBrightness);\n\t\n\tLLWLParamKey ls_key;\n\tls_key.name = \"LightshareCurrentRegion\";\n\tls_key.scope = LLEnvKey::SCOPE_LOCAL;\n\twlparammgr->setParamSet(ls_key, param_set);\n\t\n\twlparammgr->propagateParameters();\n}\n\n\/\/ static\nvoid FSLightshare::processWater(LightsharePacket* ls_packet)\n{\n\tLLWaterParamManager* wwparammgr = LLWaterParamManager::getInstance();\n\tLLWaterParamSet & param_set = wwparammgr->mCurParams;\n\t\n\tparam_set.set(\"waterFogColor\", ls_packet->waterColor.red \/ 256.f, ls_packet->waterColor.green \/ 256.f, ls_packet->waterColor.blue \/ 256.f);\n\tparam_set.set(\"waterFogDensity\", pow(2.0f, ls_packet->waterFogDensityExponent));\n\tparam_set.set(\"underWaterFogMod\", ls_packet->underwaterFogModifier);\n\tparam_set.set(\"normScale\", ls_packet->reflectionWaveletScale.X,ls_packet->reflectionWaveletScale.Y,ls_packet->reflectionWaveletScale.Z);\n\tparam_set.set(\"fresnelScale\", ls_packet->fresnelScale);\n\tparam_set.set(\"fresnelOffset\", ls_packet->fresnelOffset);\n\tparam_set.set(\"scaleAbove\", ls_packet->refractScaleAbove);\n\tparam_set.set(\"scaleBelow\", ls_packet->refractScaleBelow);\n\tparam_set.set(\"blurMultiplier\", ls_packet->blurMultiplier);\n\tparam_set.set(\"wave1Dir\", ls_packet->littleWaveDirection.X, ls_packet->littleWaveDirection.Y);\n\tparam_set.set(\"wave2Dir\", ls_packet->bigWaveDirection.X, ls_packet->bigWaveDirection.Y);\n\t\n\tLLUUID normalMapTexture;\n\t\n\tstd::string out = llformat(\"%02x%02x%02x%02x-%02x%02x-%02x%02x-%02x%02x-%02x%02x%02x%02x%02x%02x\",\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[0]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[1]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[2]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[3]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[4]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[5]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[6]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[7]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[8]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[9]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[10]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[11]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[12]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[13]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[14]),\n\t\t\t\t\t\t\t   (U8)(ls_packet->normalMapTexture[15]));\n\t\n\tnormalMapTexture.set(out);\n\t\n\twwparammgr->setNormalMapID(normalMapTexture);\n\twwparammgr->setParamSet(\"LightshareCurrentRegion\", param_set);\n\twwparammgr->setNormalMapID(normalMapTexture);\n\t\n\twwparammgr->propagateParameters();\n}\n\nvoid FSLightshare::setState(bool has_lightshare)\n{\n\t\tmLightshareState = has_lightshare;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Time:  O(n)\n\/\/ Space: O(1)\n\nclass Solution {\npublic:\n    bool increasingTriplet(vector<int>& nums) {\n        int first_min = numeric_limits<int>::max(), second_min = numeric_limits<int>::max();\n        for (const auto& i : nums) {\n            if (first_min >= i) {\n                first_min = i;\n            } else if (second_min >= i) {\n                second_min = i;\n            } else {\n                return true;\n            }\n        }\n        return false;\n    }\n};\n<commit_msg>Update increasing-triplet-subsequence.cpp<commit_after>\/\/ Time:  O(n)\n\/\/ Space: O(1)\n\nclass Solution {\npublic:\n    bool increasingTriplet(vector<int>& nums) {\n        int min = numeric_limits<int>::max(), a = numeric_limits<int>::max(), b = numeric_limits<int>::max();\n        for (const auto& i : nums) {\n            if (min >= i) {\n                min = i;\n            } else if (b >= i) {\n                a = min, b = i;\n            } else {\n                return true;\n            }\n        }\n        return false;\n    }\n};\n<|endoftext|>"}
{"text":"<commit_before>#include \"ResourceView.hpp\"\n\n#include <Engine\/Geometry\/Model.hpp>\n#include <Engine\/Texture\/TextureAsset.hpp>\n#include <Engine\/Audio\/SoundBuffer.hpp>\n#include <Engine\/Script\/ScriptFile.hpp>\n#include <Engine\/Util\/FileSystem.hpp>\n#include <Engine\/Hymn.hpp>\n#include <DefaultAlbedo.png.hpp>\n#include <Engine\/MainWindow.hpp>\n#include <imgui.h>\n#include <limits>\n#include \"..\/ImGui\/Splitter.hpp\"\n#include <Engine\/Manager\/Managers.hpp>\n#include <Engine\/Manager\/ResourceManager.hpp>\n#include <cstdio>\n#include <Utility\/Log.hpp>\n\nusing namespace GUI;\nusing namespace std;\n\nResourceView::ResourceView() {\n    folderNameWindow.SetClosedCallback(std::bind(&ResourceView::FileNameWindowClosed, this, placeholders::_1));\n}\n\nvoid ResourceView::Show() {\n    ImVec2 size(MainWindow::GetInstance()->GetSize().x, MainWindow::GetInstance()->GetSize().y);\n    \n    \/\/ Splitter.\n    ImGui::VerticalSplitter(ImVec2(sceneWidth, size.y - resourceHeight), size.x - sceneWidth - editorWidth, splitterSize, resourceHeight, resourceResize, 20, size.y - 20);\n    if (resourceResize)\n        resourceHeight = size.y - resourceHeight;\n    \n    ImGui::SetNextWindowPos(ImVec2(sceneWidth, size.y - resourceHeight));\n    ImGui::SetNextWindowSize(ImVec2(size.x - sceneWidth - editorWidth, resourceHeight));\n    \n    ImGui::Begin(\"Resources\", nullptr, ImGuiWindowFlags_NoResize | ImGuiWindowFlags_ShowBorders);\n    \n    \/\/ Show resources.\n    scriptPressed = false;\n    texturePressed = false;\n    modelPressed = false;\n    soundPressed = false;\n    \n    ShowResourceFolder(Resources().resourceFolder, Resources().resourceFolder.name);\n    \n    \/\/ Change scene.\n    if (changeScene) {\n        if (Hymn().GetPath() != \"\") {\n            savePromptWindow.SetVisible(true);\n            savePromptWindow.Show();\n            \n            switch (savePromptWindow.GetDecision()) {\n            case 0:\n                sceneEditor.Save();\n                sceneEditor.SetVisible(true);\n                sceneEditor.SetScene(resourcePath, scene);\n                Resources().activeScene = resourcePath + \"\/\" + *scene;\n                sceneEditor.entityEditor.SetVisible(false);\n                Hymn().world.Clear();\n                Hymn().world.Load(Hymn().GetPath() + \"\/\" + Resources().activeScene + \".json\");\n                changeScene = false;\n                savePromptWindow.SetVisible(false);\n                savePromptWindow.ResetDecision();\n                break;\n                \n            case 1:\n                sceneEditor.SetVisible(true);\n                sceneEditor.SetScene(resourcePath, scene);\n                Resources().activeScene = resourcePath + \"\/\" + *scene;\n                sceneEditor.entityEditor.SetVisible(false);\n                Hymn().world.Clear();\n                Hymn().world.Load(Hymn().GetPath() + \"\/\" + Resources().activeScene + \".json\");\n                changeScene = false;\n                savePromptWindow.SetVisible(false);\n                savePromptWindow.ResetDecision();\n                break;\n                \n            case 2:\n                changeScene = false;\n                savePromptWindow.ResetDecision();\n                savePromptWindow.SetVisible(false);\n                break;\n                \n            default:\n                break;\n            }\n        }\n    }\n    \n    \/\/ Create folder.\n    if (folderNameWindow.IsVisible())\n        folderNameWindow.Show();\n    \n    if (sceneEditor.entityPressed || scriptPressed || texturePressed || modelPressed || soundPressed) {\n        sceneEditor.entityEditor.SetVisible(sceneEditor.entityPressed);\n        scriptEditor.SetVisible(scriptPressed);\n        textureEditor.SetVisible(texturePressed);\n        modelEditor.SetVisible(modelPressed);\n        soundEditor.SetVisible(soundPressed);\n    }\n    \n    if (sceneEditor.IsVisible()) {\n        ImGui::HorizontalSplitter(ImVec2(sceneWidth, 20), size.y - 20, splitterSize, sceneWidth, sceneResize, 20, size.x - editorWidth - 20);\n        ImGui::SetNextWindowPos(ImVec2(0, 20));\n        ImGui::SetNextWindowSize(ImVec2(sceneWidth, size.y - 20));\n        sceneEditor.Show();\n    }\n    \n    if (sceneEditor.entityEditor.IsVisible() || scriptEditor.IsVisible() || textureEditor.IsVisible() || modelEditor.IsVisible() || soundEditor.IsVisible()) {\n        editorWidth = size.x - editorWidth;\n        ImGui::HorizontalSplitter(ImVec2(editorWidth, 20), size.y - 20, splitterSize, editorWidth, editorResize, sceneWidth + 20, size.x - 20);\n        editorWidth = size.x - editorWidth;\n        \n        ImGui::SetNextWindowPos(ImVec2(size.x - editorWidth, 20));\n        ImGui::SetNextWindowSize(ImVec2(editorWidth, size.y - 20));\n    }\n    \n    if (sceneEditor.entityEditor.IsVisible())\n        sceneEditor.entityEditor.Show();\n    if (scriptEditor.IsVisible())\n        scriptEditor.Show();\n    if (textureEditor.IsVisible())\n        textureEditor.Show();\n    if (modelEditor.IsVisible())\n        modelEditor.Show();\n    if (soundEditor.IsVisible())\n        soundEditor.Show();\n    \n    ImGui::End();\n}\n\nbool ResourceView::IsVisible() const {\n    return visible;\n}\n\nvoid ResourceView::SetVisible(bool visible) {\n    this->visible = visible;\n}\n\nvoid ResourceView::HideEditors() {\n    sceneEditor.SetVisible(false);\n    sceneEditor.entityEditor.SetVisible(false);\n    scriptEditor.SetVisible(false);\n    modelEditor.SetVisible(false);\n    textureEditor.SetVisible(false);\n    soundEditor.SetVisible(false);\n}\n\nvoid ResourceView::SaveScene() const {\n    sceneEditor.Save();\n}\n\n#undef max\nvoid ResourceView::ResetScene() {\n    sceneEditor.SetScene(\"\", nullptr);\n    sceneEditor.SetVisible(false);\n}\n\nSceneEditor& ResourceView::GetScene() {\n    return sceneEditor;\n}\n\nvoid ResourceView::ShowResourceFolder(ResourceList::ResourceFolder& folder, const std::string& path) {\n    bool opened = ImGui::TreeNode(folder.name.c_str());\n    \n    if (ImGui::BeginPopupContextItem(folder.name.c_str())) {\n        \/\/ Add subfolder.\n        if (ImGui::Selectable(\"Add folder\")) {\n            resourcePath = path;\n            parentFolder = &folder;\n            folderNameWindow.SetVisible(true);\n            return;\n        }\n        \n        \/\/ Add scene.\n        if (ImGui::Selectable(\"Add scene\")) {\n            ResourceList::Resource resource;\n            resource.type = ResourceList::Resource::SCENE;\n            resource.scene = \"Scene #\" + std::to_string(Resources().sceneNumber++);\n            folder.resources.push_back(resource);\n            return;\n        }\n        \n        \/\/ Add model.\n        if (ImGui::Selectable(\"Add model\")) {\n            ResourceList::Resource resource;\n            resource.type = ResourceList::Resource::MODEL;\n            resource.model = new Geometry::Model();\n            resource.model->path = path + \"\/\";\n            resource.model->name = \"Model #\" + std::to_string(Resources().modelNumber++);\n            folder.resources.push_back(resource);\n            return;\n        }\n        \n        \/\/ Add texture.\n        if (ImGui::Selectable(\"Add texture\")) {\n            ResourceList::Resource resource;\n            resource.type = ResourceList::Resource::TEXTURE;\n            string name = path + \"\/Texture #\" + std::to_string(Resources().textureNumber++);\n            resource.texture = Managers().resourceManager->CreateTextureAsset(name, Managers().resourceManager->CreateTexture2D(DEFAULTALBEDO_PNG, DEFAULTALBEDO_PNG_LENGTH));\n            folder.resources.push_back(resource);\n            return;\n        }\n        \n        \/\/ Add script.\n        if (ImGui::Selectable(\"Add script\")) {\n            ResourceList::Resource resource;\n            resource.type = ResourceList::Resource::SCRIPT;\n            resource.script = new ScriptFile();\n            resource.script->path = path + \"\/\";\n            resource.script->name = \"Script #\" + std::to_string(Hymn().scriptNumber++);\n            Hymn().scripts.push_back(resource.script);\n            folder.resources.push_back(resource);\n            return;\n        }\n        \n        \/\/ Add sound.\n        if (ImGui::Selectable(\"Add sound\")) {\n            ResourceList::Resource resource;\n            resource.type = ResourceList::Resource::SOUND;\n            resource.sound = new Audio::SoundBuffer();\n            resource.sound->path = path + \"\/\";\n            resource.sound->name = \"Sound #\" + std::to_string(Resources().soundNumber++);\n            folder.resources.push_back(resource);\n            return;\n        }\n        \n        \/\/\/ @todo Remove folder.\n        \n        ImGui::EndPopup();\n    }\n    \n    if (opened) {\n        \/\/ Show subfolders.\n        for (ResourceList::ResourceFolder& subfolder : folder.subfolders) {\n            ShowResourceFolder(subfolder, path + \"\/\" + subfolder.name);\n        }\n        \n        \/\/ Show resources.\n        for (auto it = folder.resources.begin(); it != folder.resources.end(); ++it) {\n            if (ShowResource(*it, path)) {\n                folder.resources.erase(it);\n                return;\n            }\n        }\n        \n        ImGui::TreePop();\n    }\n}\n\nbool ResourceView::ShowResource(ResourceList::Resource& resource, const std::string& path) {\n    \/\/ Scene.\n    if (resource.type == ResourceList::Resource::SCENE) {\n        if (ImGui::Selectable(resource.scene.c_str())) {\n            \/\/ Sets to don't save when opening first scene.\n            if (scene == nullptr) {\n                changeScene = true;\n                resourcePath = path;\n                scene = &resource.scene;\n                savePromptWindow.SetVisible(false);\n                savePromptWindow.SetDecision(1);\n            } else {\n                \/\/ Does so that the prompt window won't show if you select active scene.\n                if (resource.scene != Resources().activeScene) {\n                    changeScene = true;\n                    resourcePath = path;\n                    scene = &resource.scene;\n                    savePromptWindow.SetTitle(\"Save before you switch scene?\");\n                }\n            }\n        }\n        \n        \/\/ Delete scene.\n        if (ImGui::BeginPopupContextItem(resource.scene.c_str())) {\n            if (ImGui::Selectable(\"Delete\")) {\n                if (Resources().activeScene == resource.scene) {\n                    Resources().activeScene = \"\";\n                    sceneEditor.SetScene(\"\", nullptr);\n                }\n                \n                ImGui::EndPopup();\n                \n                return true;\n            }\n            ImGui::EndPopup();\n        }\n    }\n    \n    \/\/ Model.\n    if (resource.type == ResourceList::Resource::MODEL) {\n        if (ImGui::Selectable(resource.model->name.c_str())) {\n            modelPressed = true;\n            modelEditor.SetModel(resource.model);\n        }\n        \n        if (ImGui::BeginPopupContextItem(resource.model->name.c_str())) {\n            if (ImGui::Selectable(\"Delete\")) {\n                if (modelEditor.GetModel() == resource.model)\n                    modelEditor.SetVisible(false);\n                \n                Managers().resourceManager->FreeModel(resource.model);\n                ImGui::EndPopup();\n                \n                return true;\n            }\n            ImGui::EndPopup();\n        }\n    }\n    \/*\n    \/\/ Textures.\n    bool texturePressed = false;\n    if (ImGui::TreeNode(\"Textures\")) {\n        for (auto it = Resources().textures.begin(); it != Resources().textures.end(); ++it) {\n            TextureAsset* texture = *it;\n            if (ImGui::Selectable(texture->name.c_str())) {\n                texturePressed = true;\n                textureEditor.SetTexture(texture);\n            }\n            \n            if (ImGui::BeginPopupContextItem(texture->name.c_str())) {\n                if (ImGui::Selectable(\"Delete\")) {\n                    if (Managers().resourceManager->GetTextureAssetInstanceCount(texture) > 1) {\n                        Log() << \"This texture is in use. Remove all references to the texture first.\\n\";\n                    } else {\n                        if (textureEditor.GetTexture() == texture)\n                            textureEditor.SetVisible(false);\n                        \n                        \/\/ Remove files.\n                        remove((Hymn().GetPath() + FileSystem::DELIMITER + \"Textures\" + FileSystem::DELIMITER + texture->name + \".png\").c_str());\n                        remove((Hymn().GetPath() + FileSystem::DELIMITER + \"Textures\" + FileSystem::DELIMITER + texture->name + \".json\").c_str());\n                        \n                        Managers().resourceManager->FreeTextureAsset(texture);\n                        Resources().textures.erase(it);\n                    }\n                    ImGui::EndPopup();\n                    break;\n                }\n                ImGui::EndPopup();\n            }\n        }\n        \n        ImGui::TreePop();\n    }\n    \n    \/\/ Scripts.\n    bool scriptPressed = false;\n    if (ImGui::TreeNode(\"Scripts\")) {\n        for (auto it = Hymn().scripts.begin(); it != Hymn().scripts.end(); ++it) {\n            ScriptFile* script = *it;\n            std::string name = script->name;\n            \n            if (ImGui::Selectable(name.c_str())) {\n                scriptPressed = true;\n                scriptEditor.SetScript(script);\n            }\n            \n            if (ImGui::BeginPopupContextItem(name.c_str())) {\n                if (ImGui::Selectable(\"Delete\")) {\n                    if (scriptEditor.GetScript() == script)\n                        scriptEditor.SetVisible(false);\n                    \n                    delete script;\n                    Hymn().scripts.erase(it);\n                    ImGui::EndPopup();\n                    break;\n                }\n                ImGui::EndPopup();\n            }\n        }\n        \n        ImGui::TreePop();\n    }\n    \n    \/\/ Sounds.\n    bool soundPressed = false;\n    if (ImGui::TreeNode(\"Sounds\")) {\n        for (auto it = Resources().sounds.begin(); it != Resources().sounds.end(); ++it) {\n            Audio::SoundBuffer* sound = *it;\n            if (ImGui::Selectable(sound->name.c_str())) {\n                soundPressed = true;\n                soundEditor.SetSound(sound);\n            }\n            \n            if (ImGui::BeginPopupContextItem(sound->name.c_str())) {\n                if (ImGui::Selectable(\"Delete\")) {\n                    if (soundEditor.GetSound() == sound)\n                        soundEditor.SetVisible(false);\n                    \n                    delete sound;\n                    Resources().sounds.erase(it);\n                    ImGui::EndPopup();\n                    break;\n                }\n                ImGui::EndPopup();\n            }\n        }\n        \n        ImGui::TreePop();\n    }*\/\n    \n    return false;\n}\n\nvoid ResourceView::FileNameWindowClosed(const std::string& name) {\n    if (!name.empty()) {\n        ResourceList::ResourceFolder folder;\n        folder.name = name;\n        parentFolder->subfolders.push_back(folder);\n        \n        FileSystem::CreateDirectory((Hymn().GetPath() + \"\/\" + resourcePath + \"\/\" + name).c_str());\n    }\n}\n<commit_msg>Show textures<commit_after>#include \"ResourceView.hpp\"\n\n#include <Engine\/Geometry\/Model.hpp>\n#include <Engine\/Texture\/TextureAsset.hpp>\n#include <Engine\/Audio\/SoundBuffer.hpp>\n#include <Engine\/Script\/ScriptFile.hpp>\n#include <Engine\/Util\/FileSystem.hpp>\n#include <Engine\/Hymn.hpp>\n#include <DefaultAlbedo.png.hpp>\n#include <Engine\/MainWindow.hpp>\n#include <imgui.h>\n#include <limits>\n#include \"..\/ImGui\/Splitter.hpp\"\n#include <Engine\/Manager\/Managers.hpp>\n#include <Engine\/Manager\/ResourceManager.hpp>\n#include <cstdio>\n#include <Utility\/Log.hpp>\n\nusing namespace GUI;\nusing namespace std;\n\nResourceView::ResourceView() {\n    folderNameWindow.SetClosedCallback(std::bind(&ResourceView::FileNameWindowClosed, this, placeholders::_1));\n}\n\nvoid ResourceView::Show() {\n    ImVec2 size(MainWindow::GetInstance()->GetSize().x, MainWindow::GetInstance()->GetSize().y);\n    \n    \/\/ Splitter.\n    ImGui::VerticalSplitter(ImVec2(sceneWidth, size.y - resourceHeight), size.x - sceneWidth - editorWidth, splitterSize, resourceHeight, resourceResize, 20, size.y - 20);\n    if (resourceResize)\n        resourceHeight = size.y - resourceHeight;\n    \n    ImGui::SetNextWindowPos(ImVec2(sceneWidth, size.y - resourceHeight));\n    ImGui::SetNextWindowSize(ImVec2(size.x - sceneWidth - editorWidth, resourceHeight));\n    \n    ImGui::Begin(\"Resources\", nullptr, ImGuiWindowFlags_NoResize | ImGuiWindowFlags_ShowBorders);\n    \n    \/\/ Show resources.\n    scriptPressed = false;\n    texturePressed = false;\n    modelPressed = false;\n    soundPressed = false;\n    \n    ShowResourceFolder(Resources().resourceFolder, Resources().resourceFolder.name);\n    \n    \/\/ Change scene.\n    if (changeScene) {\n        if (Hymn().GetPath() != \"\") {\n            savePromptWindow.SetVisible(true);\n            savePromptWindow.Show();\n            \n            switch (savePromptWindow.GetDecision()) {\n            case 0:\n                sceneEditor.Save();\n                sceneEditor.SetVisible(true);\n                sceneEditor.SetScene(resourcePath, scene);\n                Resources().activeScene = resourcePath + \"\/\" + *scene;\n                sceneEditor.entityEditor.SetVisible(false);\n                Hymn().world.Clear();\n                Hymn().world.Load(Hymn().GetPath() + \"\/\" + Resources().activeScene + \".json\");\n                changeScene = false;\n                savePromptWindow.SetVisible(false);\n                savePromptWindow.ResetDecision();\n                break;\n                \n            case 1:\n                sceneEditor.SetVisible(true);\n                sceneEditor.SetScene(resourcePath, scene);\n                Resources().activeScene = resourcePath + \"\/\" + *scene;\n                sceneEditor.entityEditor.SetVisible(false);\n                Hymn().world.Clear();\n                Hymn().world.Load(Hymn().GetPath() + \"\/\" + Resources().activeScene + \".json\");\n                changeScene = false;\n                savePromptWindow.SetVisible(false);\n                savePromptWindow.ResetDecision();\n                break;\n                \n            case 2:\n                changeScene = false;\n                savePromptWindow.ResetDecision();\n                savePromptWindow.SetVisible(false);\n                break;\n                \n            default:\n                break;\n            }\n        }\n    }\n    \n    \/\/ Create folder.\n    if (folderNameWindow.IsVisible())\n        folderNameWindow.Show();\n    \n    if (sceneEditor.entityPressed || scriptPressed || texturePressed || modelPressed || soundPressed) {\n        sceneEditor.entityEditor.SetVisible(sceneEditor.entityPressed);\n        scriptEditor.SetVisible(scriptPressed);\n        textureEditor.SetVisible(texturePressed);\n        modelEditor.SetVisible(modelPressed);\n        soundEditor.SetVisible(soundPressed);\n    }\n    \n    if (sceneEditor.IsVisible()) {\n        ImGui::HorizontalSplitter(ImVec2(sceneWidth, 20), size.y - 20, splitterSize, sceneWidth, sceneResize, 20, size.x - editorWidth - 20);\n        ImGui::SetNextWindowPos(ImVec2(0, 20));\n        ImGui::SetNextWindowSize(ImVec2(sceneWidth, size.y - 20));\n        sceneEditor.Show();\n    }\n    \n    if (sceneEditor.entityEditor.IsVisible() || scriptEditor.IsVisible() || textureEditor.IsVisible() || modelEditor.IsVisible() || soundEditor.IsVisible()) {\n        editorWidth = size.x - editorWidth;\n        ImGui::HorizontalSplitter(ImVec2(editorWidth, 20), size.y - 20, splitterSize, editorWidth, editorResize, sceneWidth + 20, size.x - 20);\n        editorWidth = size.x - editorWidth;\n        \n        ImGui::SetNextWindowPos(ImVec2(size.x - editorWidth, 20));\n        ImGui::SetNextWindowSize(ImVec2(editorWidth, size.y - 20));\n    }\n    \n    if (sceneEditor.entityEditor.IsVisible())\n        sceneEditor.entityEditor.Show();\n    if (scriptEditor.IsVisible())\n        scriptEditor.Show();\n    if (textureEditor.IsVisible())\n        textureEditor.Show();\n    if (modelEditor.IsVisible())\n        modelEditor.Show();\n    if (soundEditor.IsVisible())\n        soundEditor.Show();\n    \n    ImGui::End();\n}\n\nbool ResourceView::IsVisible() const {\n    return visible;\n}\n\nvoid ResourceView::SetVisible(bool visible) {\n    this->visible = visible;\n}\n\nvoid ResourceView::HideEditors() {\n    sceneEditor.SetVisible(false);\n    sceneEditor.entityEditor.SetVisible(false);\n    scriptEditor.SetVisible(false);\n    modelEditor.SetVisible(false);\n    textureEditor.SetVisible(false);\n    soundEditor.SetVisible(false);\n}\n\nvoid ResourceView::SaveScene() const {\n    sceneEditor.Save();\n}\n\n#undef max\nvoid ResourceView::ResetScene() {\n    sceneEditor.SetScene(\"\", nullptr);\n    sceneEditor.SetVisible(false);\n}\n\nSceneEditor& ResourceView::GetScene() {\n    return sceneEditor;\n}\n\nvoid ResourceView::ShowResourceFolder(ResourceList::ResourceFolder& folder, const std::string& path) {\n    bool opened = ImGui::TreeNode(folder.name.c_str());\n    \n    if (ImGui::BeginPopupContextItem(folder.name.c_str())) {\n        \/\/ Add subfolder.\n        if (ImGui::Selectable(\"Add folder\")) {\n            resourcePath = path;\n            parentFolder = &folder;\n            folderNameWindow.SetVisible(true);\n            return;\n        }\n        \n        \/\/ Add scene.\n        if (ImGui::Selectable(\"Add scene\")) {\n            ResourceList::Resource resource;\n            resource.type = ResourceList::Resource::SCENE;\n            resource.scene = \"Scene #\" + std::to_string(Resources().sceneNumber++);\n            folder.resources.push_back(resource);\n            return;\n        }\n        \n        \/\/ Add model.\n        if (ImGui::Selectable(\"Add model\")) {\n            ResourceList::Resource resource;\n            resource.type = ResourceList::Resource::MODEL;\n            resource.model = new Geometry::Model();\n            resource.model->path = path + \"\/\";\n            resource.model->name = \"Model #\" + std::to_string(Resources().modelNumber++);\n            folder.resources.push_back(resource);\n            return;\n        }\n        \n        \/\/ Add texture.\n        if (ImGui::Selectable(\"Add texture\")) {\n            ResourceList::Resource resource;\n            resource.type = ResourceList::Resource::TEXTURE;\n            string name = path + \"\/Texture #\" + std::to_string(Resources().textureNumber++);\n            resource.texture = Managers().resourceManager->CreateTextureAsset(name, Managers().resourceManager->CreateTexture2D(DEFAULTALBEDO_PNG, DEFAULTALBEDO_PNG_LENGTH));\n            folder.resources.push_back(resource);\n            return;\n        }\n        \n        \/\/ Add script.\n        if (ImGui::Selectable(\"Add script\")) {\n            ResourceList::Resource resource;\n            resource.type = ResourceList::Resource::SCRIPT;\n            resource.script = new ScriptFile();\n            resource.script->path = path + \"\/\";\n            resource.script->name = \"Script #\" + std::to_string(Hymn().scriptNumber++);\n            Hymn().scripts.push_back(resource.script);\n            folder.resources.push_back(resource);\n            return;\n        }\n        \n        \/\/ Add sound.\n        if (ImGui::Selectable(\"Add sound\")) {\n            ResourceList::Resource resource;\n            resource.type = ResourceList::Resource::SOUND;\n            resource.sound = new Audio::SoundBuffer();\n            resource.sound->path = path + \"\/\";\n            resource.sound->name = \"Sound #\" + std::to_string(Resources().soundNumber++);\n            folder.resources.push_back(resource);\n            return;\n        }\n        \n        \/\/\/ @todo Remove folder.\n        \n        ImGui::EndPopup();\n    }\n    \n    if (opened) {\n        \/\/ Show subfolders.\n        for (ResourceList::ResourceFolder& subfolder : folder.subfolders) {\n            ShowResourceFolder(subfolder, path + \"\/\" + subfolder.name);\n        }\n        \n        \/\/ Show resources.\n        for (auto it = folder.resources.begin(); it != folder.resources.end(); ++it) {\n            if (ShowResource(*it, path)) {\n                folder.resources.erase(it);\n                return;\n            }\n        }\n        \n        ImGui::TreePop();\n    }\n}\n\nbool ResourceView::ShowResource(ResourceList::Resource& resource, const std::string& path) {\n    \/\/ Scene.\n    if (resource.type == ResourceList::Resource::SCENE) {\n        if (ImGui::Selectable(resource.scene.c_str())) {\n            \/\/ Sets to don't save when opening first scene.\n            if (scene == nullptr) {\n                changeScene = true;\n                resourcePath = path;\n                scene = &resource.scene;\n                savePromptWindow.SetVisible(false);\n                savePromptWindow.SetDecision(1);\n            } else {\n                \/\/ Does so that the prompt window won't show if you select active scene.\n                if (resource.scene != Resources().activeScene) {\n                    changeScene = true;\n                    resourcePath = path;\n                    scene = &resource.scene;\n                    savePromptWindow.SetTitle(\"Save before you switch scene?\");\n                }\n            }\n        }\n        \n        \/\/ Delete scene.\n        if (ImGui::BeginPopupContextItem(resource.scene.c_str())) {\n            if (ImGui::Selectable(\"Delete\")) {\n                if (Resources().activeScene == resource.scene) {\n                    Resources().activeScene = \"\";\n                    sceneEditor.SetScene(\"\", nullptr);\n                }\n                \n                ImGui::EndPopup();\n                \n                return true;\n            }\n            ImGui::EndPopup();\n        }\n    }\n    \n    \/\/ Model.\n    if (resource.type == ResourceList::Resource::MODEL) {\n        if (ImGui::Selectable(resource.model->name.c_str())) {\n            modelPressed = true;\n            modelEditor.SetModel(resource.model);\n        }\n        \n        if (ImGui::BeginPopupContextItem(resource.model->name.c_str())) {\n            if (ImGui::Selectable(\"Delete\")) {\n                if (modelEditor.GetModel() == resource.model)\n                    modelEditor.SetVisible(false);\n                \n                Managers().resourceManager->FreeModel(resource.model);\n                ImGui::EndPopup();\n                \n                return true;\n            }\n            ImGui::EndPopup();\n        }\n    }\n    \n    \/\/ Textures.\n    if (resource.type == ResourceList::Resource::TEXTURE) {\n        if (ImGui::Selectable(resource.texture->name.c_str())) {\n            texturePressed = true;\n            textureEditor.SetTexture(resource.texture);\n        }\n        \n        if (ImGui::BeginPopupContextItem(resource.texture->name.c_str())) {\n            if (ImGui::Selectable(\"Delete\")) {\n                if (Managers().resourceManager->GetTextureAssetInstanceCount(resource.texture) > 1) {\n                    Log() << \"This texture is in use. Remove all references to the texture first.\\n\";\n                } else {\n                    if (textureEditor.GetTexture() == resource.texture)\n                        textureEditor.SetVisible(false);\n                    \n                    \/\/ Remove files.\n                    remove((Hymn().GetPath() + \"\/\" + path + \"\/\" + resource.texture->name + \".png\").c_str());\n                    remove((Hymn().GetPath() + \"\/\" + path + \"\/\" + resource.texture->name + \".json\").c_str());\n                    \n                    Managers().resourceManager->FreeTextureAsset(resource.texture);\n                    ImGui::EndPopup();\n                    return true;\n                }\n            }\n            ImGui::EndPopup();\n        }\n    }\n    \/*\n    \/\/ Scripts.\n    bool scriptPressed = false;\n    if (ImGui::TreeNode(\"Scripts\")) {\n        for (auto it = Hymn().scripts.begin(); it != Hymn().scripts.end(); ++it) {\n            ScriptFile* script = *it;\n            std::string name = script->name;\n            \n            if (ImGui::Selectable(name.c_str())) {\n                scriptPressed = true;\n                scriptEditor.SetScript(script);\n            }\n            \n            if (ImGui::BeginPopupContextItem(name.c_str())) {\n                if (ImGui::Selectable(\"Delete\")) {\n                    if (scriptEditor.GetScript() == script)\n                        scriptEditor.SetVisible(false);\n                    \n                    delete script;\n                    Hymn().scripts.erase(it);\n                    ImGui::EndPopup();\n                    break;\n                }\n                ImGui::EndPopup();\n            }\n        }\n        \n        ImGui::TreePop();\n    }\n    \n    \/\/ Sounds.\n    bool soundPressed = false;\n    if (ImGui::TreeNode(\"Sounds\")) {\n        for (auto it = Resources().sounds.begin(); it != Resources().sounds.end(); ++it) {\n            Audio::SoundBuffer* sound = *it;\n            if (ImGui::Selectable(sound->name.c_str())) {\n                soundPressed = true;\n                soundEditor.SetSound(sound);\n            }\n            \n            if (ImGui::BeginPopupContextItem(sound->name.c_str())) {\n                if (ImGui::Selectable(\"Delete\")) {\n                    if (soundEditor.GetSound() == sound)\n                        soundEditor.SetVisible(false);\n                    \n                    delete sound;\n                    Resources().sounds.erase(it);\n                    ImGui::EndPopup();\n                    break;\n                }\n                ImGui::EndPopup();\n            }\n        }\n        \n        ImGui::TreePop();\n    }*\/\n    \n    return false;\n}\n\nvoid ResourceView::FileNameWindowClosed(const std::string& name) {\n    if (!name.empty()) {\n        ResourceList::ResourceFolder folder;\n        folder.name = name;\n        parentFolder->subfolders.push_back(folder);\n        \n        FileSystem::CreateDirectory((Hymn().GetPath() + \"\/\" + resourcePath + \"\/\" + name).c_str());\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"..\\..\\include\\aeongames\\Renderer.h\"\n\/*\nCopyright (C) 2016,2017 Rodrigo Jose Hernandez Cordoba\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\n#include \"aeongames\/Renderer.h\"\n#include \"aeongames\/Model.h\"\n#include \"aeongames\/RenderModel.h\"\n#include \"Factory.h\"\n\nnamespace AeonGames\n{\n    std::shared_ptr<Renderer> GetRenderer ( const std::string& aIdentifier )\n    {\n        return Factory<Renderer>::Get ( aIdentifier );\n    }\n    bool RegisterRendererLoader ( const std::string& aIdentifier, std::function<std::shared_ptr<Renderer>() > aLoader )\n    {\n        return Factory<Renderer>::RegisterLoader ( aIdentifier, aLoader );\n    }\n    bool UnregisterRendererLoader ( const std::string& aIdentifier )\n    {\n        return Factory<Renderer>::UnregisterLoader ( aIdentifier );\n    }\n    void EnumerateRendererLoaders ( std::function<bool ( const std::string& ) > aEnumerator )\n    {\n        Factory<Renderer>::EnumerateLoaders ( aEnumerator );\n    }\n    void Renderer::SetRenderModel ( const std::shared_ptr<const Model>& aModel, std::unique_ptr<RenderModel> aRenderModel ) const\n    {\n        aModel->mRenderModel = std::move ( aRenderModel );\n    }\n\n    const std::unique_ptr<RenderModel>& Renderer::GetRenderModel ( const std::shared_ptr<const Model>& aModel ) const\n    {\n        return aModel->mRenderModel;\n    }\n}\n<commit_msg>Removed bad automated include line to fix Linux build.<commit_after>\/*\nCopyright (C) 2016,2017 Rodrigo Jose Hernandez Cordoba\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 \"aeongames\/Renderer.h\"\n#include \"aeongames\/Model.h\"\n#include \"aeongames\/RenderModel.h\"\n#include \"Factory.h\"\n\nnamespace AeonGames\n{\n    std::shared_ptr<Renderer> GetRenderer ( const std::string& aIdentifier )\n    {\n        return Factory<Renderer>::Get ( aIdentifier );\n    }\n    bool RegisterRendererLoader ( const std::string& aIdentifier, std::function<std::shared_ptr<Renderer>() > aLoader )\n    {\n        return Factory<Renderer>::RegisterLoader ( aIdentifier, aLoader );\n    }\n    bool UnregisterRendererLoader ( const std::string& aIdentifier )\n    {\n        return Factory<Renderer>::UnregisterLoader ( aIdentifier );\n    }\n    void EnumerateRendererLoaders ( std::function<bool ( const std::string& ) > aEnumerator )\n    {\n        Factory<Renderer>::EnumerateLoaders ( aEnumerator );\n    }\n    void Renderer::SetRenderModel ( const std::shared_ptr<const Model>& aModel, std::unique_ptr<RenderModel> aRenderModel ) const\n    {\n        aModel->mRenderModel = std::move ( aRenderModel );\n    }\n\n    const std::unique_ptr<RenderModel>& Renderer::GetRenderModel ( const std::shared_ptr<const Model>& aModel ) const\n    {\n        return aModel->mRenderModel;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\n\/*\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 Christian <c@ethdev.com>\n * @date 2014\n * Unit tests for the name and type resolution of the solidity parser.\n *\/\n\n#include <string>\n\n#include <libdevcore\/Log.h>\n#include <libsolidity\/Scanner.h>\n#include <libsolidity\/Parser.h>\n#include <libsolidity\/NameAndTypeResolver.h>\n#include <libsolidity\/Compiler.h>\n#include <libsolidity\/AST.h>\n#include <boost\/test\/unit_test.hpp>\n\nnamespace dev\n{\nnamespace solidity\n{\nnamespace test\n{\n\nnamespace\n{\n\n\/**\n * Helper class that extracts the first expression in an AST.\n *\/\nclass FirstExpressionExtractor: private ASTVisitor\n{\npublic:\n\tFirstExpressionExtractor(ASTNode& _node): m_expression(nullptr) { _node.accept(*this); }\n\tExpression* getExpression() const { return m_expression; }\nprivate:\n\tvirtual bool visit(Expression& _expression) override { return checkExpression(_expression); }\n\tvirtual bool visit(Assignment& _expression) override { return checkExpression(_expression); }\n\tvirtual bool visit(UnaryOperation& _expression) override { return checkExpression(_expression); }\n\tvirtual bool visit(BinaryOperation& _expression) override { return checkExpression(_expression); }\n\tvirtual bool visit(FunctionCall& _expression) override { return checkExpression(_expression); }\n\tvirtual bool visit(MemberAccess& _expression) override { return checkExpression(_expression); }\n\tvirtual bool visit(IndexAccess& _expression) override { return checkExpression(_expression); }\n\tvirtual bool visit(PrimaryExpression& _expression) override { return checkExpression(_expression); }\n\tvirtual bool visit(Identifier& _expression) override { return checkExpression(_expression); }\n\tvirtual bool visit(ElementaryTypeNameExpression& _expression) override { return checkExpression(_expression); }\n\tvirtual bool visit(Literal& _expression) override { return checkExpression(_expression); }\n\tbool checkExpression(Expression& _expression)\n\t{\n\t\tif (m_expression == nullptr)\n\t\t\tm_expression = &_expression;\n\t\treturn false;\n\t}\nprivate:\n\tExpression* m_expression;\n};\n\nbytes compileFirstExpression(std::string const& _sourceCode)\n{\n\tParser parser;\n\tASTPointer<ContractDefinition> contract;\n\tBOOST_REQUIRE_NO_THROW(contract = parser.parse(std::make_shared<Scanner>(CharStream(_sourceCode))));\n\tNameAndTypeResolver resolver;\n\tBOOST_REQUIRE_NO_THROW(resolver.resolveNamesAndTypes(*contract));\n\tFirstExpressionExtractor extractor(*contract);\n\tBOOST_REQUIRE(extractor.getExpression() != nullptr);\n\n\tCompilerContext context;\n\tExpressionCompiler compiler(context);\n\tcompiler.compile(*extractor.getExpression());\n\tbytes instructions = compiler.getAssembledBytecode();\n\t\/\/ debug\n\t\/\/std::cout << eth::disassemble(instructions) << std::endl;\n\treturn instructions;\n}\n\n} \/\/ end anonymous namespace\n\nBOOST_AUTO_TEST_SUITE(SolidityExpressionCompiler)\n\nBOOST_AUTO_TEST_CASE(literal_true)\n{\n\tchar const* sourceCode = \"contract test {\\n\"\n\t\t\t\t\t\t\t \"  function f() { var x = true; }\"\n\t\t\t\t\t\t\t \"}\\n\";\n\tbytes code = compileFirstExpression(sourceCode);\n\n\tbytes expectation({byte(eth::Instruction::PUSH1), 0x1});\n\tBOOST_CHECK_EQUAL_COLLECTIONS(code.begin(), code.end(), expectation.begin(), expectation.end());\n}\n\nBOOST_AUTO_TEST_CASE(literal_false)\n{\n\tchar const* sourceCode = \"contract test {\\n\"\n\t\t\t\t\t\t\t \"  function f() { var x = false; }\"\n\t\t\t\t\t\t\t \"}\\n\";\n\tbytes code = compileFirstExpression(sourceCode);\n\n\tbytes expectation({byte(eth::Instruction::PUSH1), 0x0});\n\tBOOST_CHECK_EQUAL_COLLECTIONS(code.begin(), code.end(), expectation.begin(), expectation.end());\n}\n\nBOOST_AUTO_TEST_CASE(int_literal)\n{\n\tchar const* sourceCode = \"contract test {\\n\"\n\t\t\t\t\t\t\t \"  function f() { var x = 0x12345678901234567890; }\"\n\t\t\t\t\t\t\t \"}\\n\";\n\tbytes code = compileFirstExpression(sourceCode);\n\n\tbytes expectation({byte(eth::Instruction::PUSH10), 0x12, 0x34, 0x56, 0x78, 0x90,\n\t\t\t\t\t\t\t\t\t\t\t\t\t   0x12, 0x34, 0x56, 0x78, 0x90});\n\tBOOST_CHECK_EQUAL_COLLECTIONS(code.begin(), code.end(), expectation.begin(), expectation.end());\n}\n\nBOOST_AUTO_TEST_CASE(comparison)\n{\n\tchar const* sourceCode = \"contract test {\\n\"\n\t\t\t\t\t\t\t \"  function f() { var x = (0x10aa < 0x11aa) != true; }\"\n\t\t\t\t\t\t\t \"}\\n\";\n\tbytes code = compileFirstExpression(sourceCode);\n\n\tbytes expectation({byte(eth::Instruction::PUSH2), 0x10, 0xaa,\n\t\t\t\t\t   byte(eth::Instruction::PUSH2), 0x11, 0xaa,\n\t\t\t\t\t   byte(eth::Instruction::GT),\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x1,\n\t\t\t\t\t   byte(eth::Instruction::EQ),\n\t\t\t\t\t   byte(eth::Instruction::NOT)});\n\tBOOST_CHECK_EQUAL_COLLECTIONS(code.begin(), code.end(), expectation.begin(), expectation.end());\n}\n\nBOOST_AUTO_TEST_CASE(short_circuiting)\n{\n\tchar const* sourceCode = \"contract test {\\n\"\n\t\t\t\t\t\t\t \"  function f() { var x = (10 + 8 >= 4 || 2 != 9) != true; }\"\n\t\t\t\t\t\t\t \"}\\n\";\n\tbytes code = compileFirstExpression(sourceCode);\n\n\tbytes expectation({byte(eth::Instruction::PUSH1), 0xa,\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x8,\n\t\t\t\t\t   byte(eth::Instruction::ADD),\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x4,\n\t\t\t\t\t   byte(eth::Instruction::GT),\n\t\t\t\t\t   byte(eth::Instruction::NOT), \/\/ after this we have 10 + 8 >= 4\n\t\t\t\t\t   byte(eth::Instruction::DUP1),\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x14,\n\t\t\t\t\t   byte(eth::Instruction::JUMPI), \/\/ short-circuit if it is true\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x2,\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x9,\n\t\t\t\t\t   byte(eth::Instruction::EQ),\n\t\t\t\t\t   byte(eth::Instruction::NOT), \/\/ after this we have 2 != 9\n\t\t\t\t\t   byte(eth::Instruction::JUMPDEST),\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x1,\n\t\t\t\t\t   byte(eth::Instruction::EQ),\n\t\t\t\t\t   byte(eth::Instruction::NOT)});\n\tBOOST_CHECK_EQUAL_COLLECTIONS(code.begin(), code.end(), expectation.begin(), expectation.end());\n}\n\nBOOST_AUTO_TEST_CASE(arithmetics)\n{\n\tchar const* sourceCode = \"contract test {\\n\"\n\t\t\t\t\t\t\t \"  function f() { var x = (1 * (2 \/ (3 % (4 + (5 - (6 | (7 & (8 ^ 9)))))))); }\"\n\t\t\t\t\t\t\t \"}\\n\";\n\tbytes code = compileFirstExpression(sourceCode);\n\n\tbytes expectation({byte(eth::Instruction::PUSH1), 0x1,\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x2,\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x3,\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x4,\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x5,\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x6,\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x7,\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x8,\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x9,\n\t\t\t\t\t   byte(eth::Instruction::XOR),\n\t\t\t\t\t   byte(eth::Instruction::AND),\n\t\t\t\t\t   byte(eth::Instruction::OR),\n\t\t\t\t\t   byte(eth::Instruction::SWAP1),\n\t\t\t\t\t   byte(eth::Instruction::SUB),\n\t\t\t\t\t   byte(eth::Instruction::ADD),\n\t\t\t\t\t   byte(eth::Instruction::MOD),\n\t\t\t\t\t   byte(eth::Instruction::DIV),\n\t\t\t\t\t   byte(eth::Instruction::MUL)});\n\tBOOST_CHECK_EQUAL_COLLECTIONS(code.begin(), code.end(), expectation.begin(), expectation.end());\n}\n\nBOOST_AUTO_TEST_CASE(unary_operators)\n{\n\tchar const* sourceCode = \"contract test {\\n\"\n\t\t\t\t\t\t\t \"  function f() { var x = !(~+-(--(++1++)--) == 2); }\"\n\t\t\t\t\t\t\t \"}\\n\";\n\tbytes code = compileFirstExpression(sourceCode);\n\n\tbytes expectation({byte(eth::Instruction::PUSH1), 0x1,\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x1,\n\t\t\t\t\t   byte(eth::Instruction::ADD),\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x1,\n\t\t\t\t\t   byte(eth::Instruction::SWAP1),\n\t\t\t\t\t   byte(eth::Instruction::SUB),\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x0,\n\t\t\t\t\t   byte(eth::Instruction::SUB),\n\t\t\t\t\t   byte(eth::Instruction::NOT),\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x2,\n\t\t\t\t\t   byte(eth::Instruction::EQ),\n\t\t\t\t\t   byte(eth::Instruction::ISZERO)});\n\tBOOST_CHECK_EQUAL_COLLECTIONS(code.begin(), code.end(), expectation.begin(), expectation.end());\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n}\n}\n} \/\/ end namespaces\n\n<commit_msg>Bugfix: Swap before mod and div.<commit_after>\n\/*\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 Christian <c@ethdev.com>\n * @date 2014\n * Unit tests for the name and type resolution of the solidity parser.\n *\/\n\n#include <string>\n\n#include <libdevcore\/Log.h>\n#include <libsolidity\/Scanner.h>\n#include <libsolidity\/Parser.h>\n#include <libsolidity\/NameAndTypeResolver.h>\n#include <libsolidity\/Compiler.h>\n#include <libsolidity\/AST.h>\n#include <boost\/test\/unit_test.hpp>\n\nnamespace dev\n{\nnamespace solidity\n{\nnamespace test\n{\n\nnamespace\n{\n\n\/**\n * Helper class that extracts the first expression in an AST.\n *\/\nclass FirstExpressionExtractor: private ASTVisitor\n{\npublic:\n\tFirstExpressionExtractor(ASTNode& _node): m_expression(nullptr) { _node.accept(*this); }\n\tExpression* getExpression() const { return m_expression; }\nprivate:\n\tvirtual bool visit(Expression& _expression) override { return checkExpression(_expression); }\n\tvirtual bool visit(Assignment& _expression) override { return checkExpression(_expression); }\n\tvirtual bool visit(UnaryOperation& _expression) override { return checkExpression(_expression); }\n\tvirtual bool visit(BinaryOperation& _expression) override { return checkExpression(_expression); }\n\tvirtual bool visit(FunctionCall& _expression) override { return checkExpression(_expression); }\n\tvirtual bool visit(MemberAccess& _expression) override { return checkExpression(_expression); }\n\tvirtual bool visit(IndexAccess& _expression) override { return checkExpression(_expression); }\n\tvirtual bool visit(PrimaryExpression& _expression) override { return checkExpression(_expression); }\n\tvirtual bool visit(Identifier& _expression) override { return checkExpression(_expression); }\n\tvirtual bool visit(ElementaryTypeNameExpression& _expression) override { return checkExpression(_expression); }\n\tvirtual bool visit(Literal& _expression) override { return checkExpression(_expression); }\n\tbool checkExpression(Expression& _expression)\n\t{\n\t\tif (m_expression == nullptr)\n\t\t\tm_expression = &_expression;\n\t\treturn false;\n\t}\nprivate:\n\tExpression* m_expression;\n};\n\nbytes compileFirstExpression(std::string const& _sourceCode)\n{\n\tParser parser;\n\tASTPointer<ContractDefinition> contract;\n\tBOOST_REQUIRE_NO_THROW(contract = parser.parse(std::make_shared<Scanner>(CharStream(_sourceCode))));\n\tNameAndTypeResolver resolver;\n\tBOOST_REQUIRE_NO_THROW(resolver.resolveNamesAndTypes(*contract));\n\tFirstExpressionExtractor extractor(*contract);\n\tBOOST_REQUIRE(extractor.getExpression() != nullptr);\n\n\tCompilerContext context;\n\tExpressionCompiler compiler(context);\n\tcompiler.compile(*extractor.getExpression());\n\tbytes instructions = compiler.getAssembledBytecode();\n\t\/\/ debug\n\t\/\/std::cout << eth::disassemble(instructions) << std::endl;\n\treturn instructions;\n}\n\n} \/\/ end anonymous namespace\n\nBOOST_AUTO_TEST_SUITE(SolidityExpressionCompiler)\n\nBOOST_AUTO_TEST_CASE(literal_true)\n{\n\tchar const* sourceCode = \"contract test {\\n\"\n\t\t\t\t\t\t\t \"  function f() { var x = true; }\"\n\t\t\t\t\t\t\t \"}\\n\";\n\tbytes code = compileFirstExpression(sourceCode);\n\n\tbytes expectation({byte(eth::Instruction::PUSH1), 0x1});\n\tBOOST_CHECK_EQUAL_COLLECTIONS(code.begin(), code.end(), expectation.begin(), expectation.end());\n}\n\nBOOST_AUTO_TEST_CASE(literal_false)\n{\n\tchar const* sourceCode = \"contract test {\\n\"\n\t\t\t\t\t\t\t \"  function f() { var x = false; }\"\n\t\t\t\t\t\t\t \"}\\n\";\n\tbytes code = compileFirstExpression(sourceCode);\n\n\tbytes expectation({byte(eth::Instruction::PUSH1), 0x0});\n\tBOOST_CHECK_EQUAL_COLLECTIONS(code.begin(), code.end(), expectation.begin(), expectation.end());\n}\n\nBOOST_AUTO_TEST_CASE(int_literal)\n{\n\tchar const* sourceCode = \"contract test {\\n\"\n\t\t\t\t\t\t\t \"  function f() { var x = 0x12345678901234567890; }\"\n\t\t\t\t\t\t\t \"}\\n\";\n\tbytes code = compileFirstExpression(sourceCode);\n\n\tbytes expectation({byte(eth::Instruction::PUSH10), 0x12, 0x34, 0x56, 0x78, 0x90,\n\t\t\t\t\t\t\t\t\t\t\t\t\t   0x12, 0x34, 0x56, 0x78, 0x90});\n\tBOOST_CHECK_EQUAL_COLLECTIONS(code.begin(), code.end(), expectation.begin(), expectation.end());\n}\n\nBOOST_AUTO_TEST_CASE(comparison)\n{\n\tchar const* sourceCode = \"contract test {\\n\"\n\t\t\t\t\t\t\t \"  function f() { var x = (0x10aa < 0x11aa) != true; }\"\n\t\t\t\t\t\t\t \"}\\n\";\n\tbytes code = compileFirstExpression(sourceCode);\n\n\tbytes expectation({byte(eth::Instruction::PUSH2), 0x10, 0xaa,\n\t\t\t\t\t   byte(eth::Instruction::PUSH2), 0x11, 0xaa,\n\t\t\t\t\t   byte(eth::Instruction::GT),\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x1,\n\t\t\t\t\t   byte(eth::Instruction::EQ),\n\t\t\t\t\t   byte(eth::Instruction::NOT)});\n\tBOOST_CHECK_EQUAL_COLLECTIONS(code.begin(), code.end(), expectation.begin(), expectation.end());\n}\n\nBOOST_AUTO_TEST_CASE(short_circuiting)\n{\n\tchar const* sourceCode = \"contract test {\\n\"\n\t\t\t\t\t\t\t \"  function f() { var x = (10 + 8 >= 4 || 2 != 9) != true; }\"\n\t\t\t\t\t\t\t \"}\\n\";\n\tbytes code = compileFirstExpression(sourceCode);\n\n\tbytes expectation({byte(eth::Instruction::PUSH1), 0xa,\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x8,\n\t\t\t\t\t   byte(eth::Instruction::ADD),\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x4,\n\t\t\t\t\t   byte(eth::Instruction::GT),\n\t\t\t\t\t   byte(eth::Instruction::NOT), \/\/ after this we have 10 + 8 >= 4\n\t\t\t\t\t   byte(eth::Instruction::DUP1),\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x14,\n\t\t\t\t\t   byte(eth::Instruction::JUMPI), \/\/ short-circuit if it is true\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x2,\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x9,\n\t\t\t\t\t   byte(eth::Instruction::EQ),\n\t\t\t\t\t   byte(eth::Instruction::NOT), \/\/ after this we have 2 != 9\n\t\t\t\t\t   byte(eth::Instruction::JUMPDEST),\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x1,\n\t\t\t\t\t   byte(eth::Instruction::EQ),\n\t\t\t\t\t   byte(eth::Instruction::NOT)});\n\tBOOST_CHECK_EQUAL_COLLECTIONS(code.begin(), code.end(), expectation.begin(), expectation.end());\n}\n\nBOOST_AUTO_TEST_CASE(arithmetics)\n{\n\tchar const* sourceCode = \"contract test {\\n\"\n\t\t\t\t\t\t\t \"  function f() { var x = (1 * (2 \/ (3 % (4 + (5 - (6 | (7 & (8 ^ 9)))))))); }\"\n\t\t\t\t\t\t\t \"}\\n\";\n\tbytes code = compileFirstExpression(sourceCode);\n\n\tbytes expectation({byte(eth::Instruction::PUSH1), 0x1,\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x2,\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x3,\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x4,\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x5,\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x6,\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x7,\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x8,\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x9,\n\t\t\t\t\t   byte(eth::Instruction::XOR),\n\t\t\t\t\t   byte(eth::Instruction::AND),\n\t\t\t\t\t   byte(eth::Instruction::OR),\n\t\t\t\t\t   byte(eth::Instruction::SWAP1),\n\t\t\t\t\t   byte(eth::Instruction::SUB),\n\t\t\t\t\t   byte(eth::Instruction::ADD),\n\t\t\t\t\t   byte(eth::Instruction::SWAP1),\n\t\t\t\t\t   byte(eth::Instruction::MOD),\n\t\t\t\t\t   byte(eth::Instruction::SWAP1),\n\t\t\t\t\t   byte(eth::Instruction::DIV),\n\t\t\t\t\t   byte(eth::Instruction::MUL)});\n\tBOOST_CHECK_EQUAL_COLLECTIONS(code.begin(), code.end(), expectation.begin(), expectation.end());\n}\n\nBOOST_AUTO_TEST_CASE(unary_operators)\n{\n\tchar const* sourceCode = \"contract test {\\n\"\n\t\t\t\t\t\t\t \"  function f() { var x = !(~+-(--(++1++)--) == 2); }\"\n\t\t\t\t\t\t\t \"}\\n\";\n\tbytes code = compileFirstExpression(sourceCode);\n\n\tbytes expectation({byte(eth::Instruction::PUSH1), 0x1,\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x1,\n\t\t\t\t\t   byte(eth::Instruction::ADD),\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x1,\n\t\t\t\t\t   byte(eth::Instruction::SWAP1),\n\t\t\t\t\t   byte(eth::Instruction::SUB),\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x0,\n\t\t\t\t\t   byte(eth::Instruction::SUB),\n\t\t\t\t\t   byte(eth::Instruction::NOT),\n\t\t\t\t\t   byte(eth::Instruction::PUSH1), 0x2,\n\t\t\t\t\t   byte(eth::Instruction::EQ),\n\t\t\t\t\t   byte(eth::Instruction::ISZERO)});\n\tBOOST_CHECK_EQUAL_COLLECTIONS(code.begin(), code.end(), expectation.begin(), expectation.end());\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n}\n}\n} \/\/ end namespaces\n\n<|endoftext|>"}
{"text":"<commit_before>#include <string.h>\n#include <stdio.h>\n#include <rapidxml\\rapidxml.hpp>\n#include <Windows.h>\nextern \"C\"\n{\n#include \"Log4JParserC.h\"\n}\n\nconst char TagEvent_[] = \"log4j:event\";\nconst size_t TagEventSize_ = sizeof (TagEvent_) - 1U;\n\nconst char AttrLevel_[] = \"level\";\nconst size_t AttrLevelSize_ = sizeof (AttrLevel_) - 1U;\n\nconst char AttrLogger_[] = \"logger\";\nconst size_t AttrLoggerSize_ = sizeof (AttrLogger_) - 1U;\n\nconst char AttrThread_[] = \"thread\";\nconst size_t AttrThreadSize_ = sizeof (AttrThread_) - 1U;\n\nconst char AttrTimestamp_[] = \"timestamp\";\nconst size_t AttrTimestampSize_ = sizeof (AttrTimestamp_) - 1U;\n\nconst char TagMessage_[] = \"log4j:message\";\nconst size_t TagMessageSize_ = sizeof (TagMessage_) - 1U;\n\nconst char TagThrowable_[] = \"log4j:throwable\";\nconst size_t TagThrowableSize_ = sizeof (TagThrowable_) - 1U;\n\nstatic void GetValue_ (const rapidxml::xml_base<char> *source, const char **value, size_t *size);\nstatic int64_t ParseTimestamp_ (const char *value, const size_t valueSize);\n\nLOG4JPARSERC_API void __cdecl Log4JEventLevel (const Log4JEvent log4JEvent, const char **value, size_t *size)\n{\n    auto node = (rapidxml::xml_node<char> *) log4JEvent;\n    auto xml = node->first_attribute (AttrLevel_, AttrLevelSize_);\n    GetValue_ (xml, value, size);\n}\n\nLOG4JPARSERC_API void __cdecl Log4JEventLogger (const Log4JEvent log4JEvent, const char **value, size_t *size)\n{\n    auto node = (rapidxml::xml_node<char> *) log4JEvent;\n    auto xml = node->first_attribute (AttrLogger_, AttrLoggerSize_);\n    GetValue_ (xml, value, size);\n}\n\nLOG4JPARSERC_API void __cdecl Log4JEventThread (const Log4JEvent log4JEvent, const char **value, size_t *size)\n{\n    auto node = (rapidxml::xml_node<char> *) log4JEvent;\n    auto xml = node->first_attribute (AttrThread_, AttrThreadSize_);\n    GetValue_ (xml, value, size);\n}\n\nLOG4JPARSERC_API int64_t __cdecl Log4JEventTimestamp (const Log4JEvent log4JEvent)\n{\n    auto node = (rapidxml::xml_node<char> *) log4JEvent;\n    auto xml = node->first_attribute (AttrTimestamp_, AttrTimestampSize_);\n    auto result = ParseTimestamp_ (xml->value (), xml->value_size ());\n\n    return result;\n}\n\nLOG4JPARSERC_API void __cdecl Log4JEventMessage (const Log4JEvent log4JEvent, const char **value, size_t *size)\n{\n    auto node = (rapidxml::xml_node<char> *) log4JEvent;\n    auto xml = node->first_node (TagMessage_, TagMessageSize_);\n    GetValue_ (xml, value, size);\n}\n\nLOG4JPARSERC_API void __cdecl Log4JEventThrowable (const Log4JEvent log4JEvent, const char **value, size_t *size)\n{\n    auto node = (rapidxml::xml_node<char> *) log4JEvent;\n    auto xml = node->first_node (TagThrowable_, TagThrowableSize_);\n    GetValue_ (xml, value, size);\n}\n\nvoid GetValue_ (const rapidxml::xml_base<char> *source, const char **value, size_t *size)\n{\n    if (source)\n    {\n        *value = source->value ();\n        *size = source->value_size ();\n    }\n    else\n    {\n        *value = nullptr;\n        *size = 0UL;\n    }\n}\n\nint64_t ParseTimestamp_ (const char *value, const size_t valueSize)\n{\n    int64_t result = 0L;\n\n    for (size_t i = 0; i < valueSize; ++i)\n    {\n        int64_t digit = value[i] - '0';\n        result = result * 10L + digit;\n    }\n\n    return result;\n}\n\nstruct Log4JEventSource_\n{\n    const rapidxml::xml_document<char> *Doc;\n    char *OwnXmlString;\n};\n\nstatic void Log4JEventSourceInitXmlStringImpl (Log4JEventSource **self, char *xmlString, bool ownString)\n{\n    *self = nullptr;\n    auto ownedStringPtr = ownString ? xmlString : nullptr;\n\n    auto doc = new rapidxml::xml_document<char> ();\n    try\n    {\n        doc->parse<rapidxml::parse_fastest> (xmlString);\n    }\n    catch (const rapidxml::parse_error &ex)\n    {\n\n    }\n    catch (...)\n    {\n        delete doc;\n        throw;\n    }\n\n    auto result = (Log4JEventSource *) malloc (sizeof (Log4JEventSource));\n    if (result == nullptr)\n    {\n        delete doc;\n        return;\n    }\n    *result = { doc, ownedStringPtr };\n\n    *self = result;\n}\n\nLOG4JPARSERC_API void __cdecl Log4JEventSourceInitXmlString (Log4JEventSource **self, char *xmlString)\n{\n    Log4JEventSourceInitXmlStringImpl (self, xmlString, false);\n}\n\nLOG4JPARSERC_API void __cdecl Log4JEventSourceDestroy (Log4JEventSource *self)\n{\n    delete self->Doc;\n    if (self->OwnXmlString)\n    {\n        free (self->OwnXmlString);\n    }\n\n    *self = { nullptr, nullptr };\n    free (self);\n}\n\nLOG4JPARSERC_API Log4JEvent __cdecl Log4JEventSourceFirst (const Log4JEventSource *self)\n{\n    auto node = self->Doc->first_node (TagEvent_, TagEventSize_);\n    return node;\n}\n\nLOG4JPARSERC_API Log4JEvent __cdecl Log4JEventSourceNext (const Log4JEventSource *self, const Log4JEvent event)\n{\n    auto node = (rapidxml::xml_node<char> *) event;\n    auto nextNode = node->next_sibling (TagEvent_, TagEventSize_);\n    return nextNode;\n}\n\nLOG4JPARSERC_API Log4JEvent __cdecl Log4JEventSourceLast (const Log4JEventSource *self)\n{\n    auto node = self->Doc->last_node (TagEvent_, TagEventSize_);\n    return node;\n}\n\nLOG4JPARSERC_API Log4JEvent __cdecl Log4JEventSourcePrev (const Log4JEventSource *self, const Log4JEvent event)\n{\n    auto node = (rapidxml::xml_node<char> *) event;\n    auto prevNode = node->previous_sibling (TagEvent_, TagEventSize_);\n    return prevNode;\n}\n<commit_msg>Removed unused variable in Log4JEvent.cpp.<commit_after>#include <string.h>\n#include <stdio.h>\n#include <rapidxml\\rapidxml.hpp>\n#include <Windows.h>\nextern \"C\"\n{\n#include \"Log4JParserC.h\"\n}\n\nconst char TagEvent_[] = \"log4j:event\";\nconst size_t TagEventSize_ = sizeof (TagEvent_) - 1U;\n\nconst char AttrLevel_[] = \"level\";\nconst size_t AttrLevelSize_ = sizeof (AttrLevel_) - 1U;\n\nconst char AttrLogger_[] = \"logger\";\nconst size_t AttrLoggerSize_ = sizeof (AttrLogger_) - 1U;\n\nconst char AttrThread_[] = \"thread\";\nconst size_t AttrThreadSize_ = sizeof (AttrThread_) - 1U;\n\nconst char AttrTimestamp_[] = \"timestamp\";\nconst size_t AttrTimestampSize_ = sizeof (AttrTimestamp_) - 1U;\n\nconst char TagMessage_[] = \"log4j:message\";\nconst size_t TagMessageSize_ = sizeof (TagMessage_) - 1U;\n\nconst char TagThrowable_[] = \"log4j:throwable\";\nconst size_t TagThrowableSize_ = sizeof (TagThrowable_) - 1U;\n\nstatic void GetValue_ (const rapidxml::xml_base<char> *source, const char **value, size_t *size);\nstatic int64_t ParseTimestamp_ (const char *value, const size_t valueSize);\n\nLOG4JPARSERC_API void __cdecl Log4JEventLevel (const Log4JEvent log4JEvent, const char **value, size_t *size)\n{\n    auto node = (rapidxml::xml_node<char> *) log4JEvent;\n    auto xml = node->first_attribute (AttrLevel_, AttrLevelSize_);\n    GetValue_ (xml, value, size);\n}\n\nLOG4JPARSERC_API void __cdecl Log4JEventLogger (const Log4JEvent log4JEvent, const char **value, size_t *size)\n{\n    auto node = (rapidxml::xml_node<char> *) log4JEvent;\n    auto xml = node->first_attribute (AttrLogger_, AttrLoggerSize_);\n    GetValue_ (xml, value, size);\n}\n\nLOG4JPARSERC_API void __cdecl Log4JEventThread (const Log4JEvent log4JEvent, const char **value, size_t *size)\n{\n    auto node = (rapidxml::xml_node<char> *) log4JEvent;\n    auto xml = node->first_attribute (AttrThread_, AttrThreadSize_);\n    GetValue_ (xml, value, size);\n}\n\nLOG4JPARSERC_API int64_t __cdecl Log4JEventTimestamp (const Log4JEvent log4JEvent)\n{\n    auto node = (rapidxml::xml_node<char> *) log4JEvent;\n    auto xml = node->first_attribute (AttrTimestamp_, AttrTimestampSize_);\n    auto result = ParseTimestamp_ (xml->value (), xml->value_size ());\n\n    return result;\n}\n\nLOG4JPARSERC_API void __cdecl Log4JEventMessage (const Log4JEvent log4JEvent, const char **value, size_t *size)\n{\n    auto node = (rapidxml::xml_node<char> *) log4JEvent;\n    auto xml = node->first_node (TagMessage_, TagMessageSize_);\n    GetValue_ (xml, value, size);\n}\n\nLOG4JPARSERC_API void __cdecl Log4JEventThrowable (const Log4JEvent log4JEvent, const char **value, size_t *size)\n{\n    auto node = (rapidxml::xml_node<char> *) log4JEvent;\n    auto xml = node->first_node (TagThrowable_, TagThrowableSize_);\n    GetValue_ (xml, value, size);\n}\n\nvoid GetValue_ (const rapidxml::xml_base<char> *source, const char **value, size_t *size)\n{\n    if (source)\n    {\n        *value = source->value ();\n        *size = source->value_size ();\n    }\n    else\n    {\n        *value = nullptr;\n        *size = 0UL;\n    }\n}\n\nint64_t ParseTimestamp_ (const char *value, const size_t valueSize)\n{\n    int64_t result = 0L;\n\n    for (size_t i = 0; i < valueSize; ++i)\n    {\n        int64_t digit = value[i] - '0';\n        result = result * 10L + digit;\n    }\n\n    return result;\n}\n\nstruct Log4JEventSource_\n{\n    const rapidxml::xml_document<char> *Doc;\n    char *OwnXmlString;\n};\n\nstatic void Log4JEventSourceInitXmlStringImpl (Log4JEventSource **self, char *xmlString, bool ownString)\n{\n    *self = nullptr;\n    auto ownedStringPtr = ownString ? xmlString : nullptr;\n\n    auto doc = new rapidxml::xml_document<char> ();\n    try\n    {\n        doc->parse<rapidxml::parse_fastest> (xmlString);\n    }\n    catch (const rapidxml::parse_error &)\n    {\n\n    }\n    catch (...)\n    {\n        delete doc;\n        throw;\n    }\n\n    auto result = (Log4JEventSource *) malloc (sizeof (Log4JEventSource));\n    if (result == nullptr)\n    {\n        delete doc;\n        return;\n    }\n    *result = { doc, ownedStringPtr };\n\n    *self = result;\n}\n\nLOG4JPARSERC_API void __cdecl Log4JEventSourceInitXmlString (Log4JEventSource **self, char *xmlString)\n{\n    Log4JEventSourceInitXmlStringImpl (self, xmlString, false);\n}\n\nLOG4JPARSERC_API void __cdecl Log4JEventSourceDestroy (Log4JEventSource *self)\n{\n    delete self->Doc;\n    if (self->OwnXmlString)\n    {\n        free (self->OwnXmlString);\n    }\n\n    *self = { nullptr, nullptr };\n    free (self);\n}\n\nLOG4JPARSERC_API Log4JEvent __cdecl Log4JEventSourceFirst (const Log4JEventSource *self)\n{\n    auto node = self->Doc->first_node (TagEvent_, TagEventSize_);\n    return node;\n}\n\nLOG4JPARSERC_API Log4JEvent __cdecl Log4JEventSourceNext (const Log4JEventSource *self, const Log4JEvent event)\n{\n    auto node = (rapidxml::xml_node<char> *) event;\n    auto nextNode = node->next_sibling (TagEvent_, TagEventSize_);\n    return nextNode;\n}\n\nLOG4JPARSERC_API Log4JEvent __cdecl Log4JEventSourceLast (const Log4JEventSource *self)\n{\n    auto node = self->Doc->last_node (TagEvent_, TagEventSize_);\n    return node;\n}\n\nLOG4JPARSERC_API Log4JEvent __cdecl Log4JEventSourcePrev (const Log4JEventSource *self, const Log4JEvent event)\n{\n    auto node = (rapidxml::xml_node<char> *) event;\n    auto prevNode = node->previous_sibling (TagEvent_, TagEventSize_);\n    return prevNode;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/---------------------------------------------------------------------------\/\/\n\/*\n  Copyright (c) 2012, Stuart R. Slattery\n  All 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 the University of Wisconsin - Madison 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\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\/*!\n * \\file MCLS_LinearProblem_impl.hpp\n * \\author Stuart R. Slattery\n * \\brief Linear problem implementation.\n *\/\n\/\/---------------------------------------------------------------------------\/\/\n\n#ifndef MCLS_LINEARPROBLEM_IMPL_HPP\n#define MCLS_LINEARPROBLEM_IMPL_HPP\n\n#include \"MCLS_DBC.hpp\"\n\n#include <Teuchos_ScalarTraits.hpp>\n\nnamespace MCLS\n{\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Constructor.\n *\/\ntemplate<class Vector, class Matrix>\nLinearProblem<Vector,Matrix>::LinearProblem( \n    const Teuchos::RCP<const Matrix>& A,\n    const Teuchos::RCP<Vector>& x,\n    const Teuchos::RCP<const Vector>& b )\n    : d_A( A )\n    , d_x( x )\n    , d_b( b )\n    , d_r( MT::cloneVectorFromMatrixRows(*d_A) )\n    , d_rp( MT::cloneVectorFromMatrixRows(*d_A) )\n    , d_x_op_decomp( MT::cloneVectorFromMatrixRows(*d_A) )\n    , d_lhs_export( Teuchos::rcp(new VectorExport<Vector>(d_x_op_decomp, d_x)) )\n{\n    VectorExport<Vector> lhs_export( d_x, d_x_op_decomp );\n    lhs_export.doExportInsert();\n\n    MCLS_ENSURE( !d_A.is_null() );\n    MCLS_ENSURE( !d_x.is_null() );\n    MCLS_ENSURE( !d_b.is_null() );\n    MCLS_ENSURE( !d_r.is_null() );\n    MCLS_ENSURE( !d_rp.is_null() );\n    MCLS_ENSURE( !d_x_op_decomp.is_null() );\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Destructor.\n *\/\ntemplate<class Vector, class Matrix>\nLinearProblem<Vector,Matrix>::~LinearProblem()\n{ \/* ... *\/ }\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Set the linear operator.\n *\/\ntemplate<class Vector, class Matrix>\nvoid LinearProblem<Vector,Matrix>::setOperator( \n    const Teuchos::RCP<const Matrix>& A )\n{\n    MCLS_REQUIRE( !A.is_null() );\n    d_A = A;\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Set the left-hand side.\n *\/\ntemplate<class Vector, class Matrix>\nvoid LinearProblem<Vector,Matrix>::setLHS( const Teuchos::RCP<Vector>& x )\n{\n    MCLS_REQUIRE( !x.is_null() );\n    d_x = x;\n\n    VectorExport<Vector> lhs_export( d_x, d_x_op_decomp );\n    lhs_export.doExportInsert();\n\n    d_lhs_export = Teuchos::rcp( new VectorExport<Vector>(d_x_op_decomp, d_x) );\n    MCLS_ENSURE( Teuchos::nonnull(d_lhs_export) );\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Set the right-hand side.\n *\/\ntemplate<class Vector, class Matrix>\nvoid LinearProblem<Vector,Matrix>::setRHS( const Teuchos::RCP<const Vector>& b )\n{\n    MCLS_REQUIRE( !b.is_null() );\n    d_b = b;\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Set the left preconditioner.\n *\/\ntemplate<class Vector, class Matrix>\nvoid LinearProblem<Vector,Matrix>::setLeftPrec( \n    const Teuchos::RCP<const Matrix>& PL )\n{\n    MCLS_REQUIRE( !PL.is_null() );\n    d_PL = PL;\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Set the right preconditioner.\n *\/\ntemplate<class Vector, class Matrix>\nvoid LinearProblem<Vector,Matrix>::setRightPrec( \n    const Teuchos::RCP<const Matrix>& PR )\n{\n    MCLS_REQUIRE( !PR.is_null() );\n    d_PR = PR;\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Get the composite linear operator.\n *\/\ntemplate<class Vector, class Matrix>\nTeuchos::RCP<const Matrix> \nLinearProblem<Vector,Matrix>::getCompositeOperator() const\n{\n    const bool left_prec = Teuchos::nonnull( d_PL );\n    const bool right_prec = Teuchos::nonnull( d_PR );\n\n    Teuchos::RCP<Matrix> composite;\n\n    if ( left_prec && right_prec )\n    {\n        Teuchos::RCP<Matrix> temp = MT::clone( *d_A );\n        composite = MT::clone( *d_PL );\n\tMT::multiply( d_A, d_PR, temp, false );\n\tMT::multiply( d_PL, temp, composite, false );\n    }\n    else if ( left_prec )\n    {\n        composite = MT::clone( *d_PL );\n\tMT::multiply( d_PL, d_A, composite, false );\n    }\n    else if ( right_prec )\n    {\n        composite = MT::clone( *d_A );\n\tMT::multiply( d_A, d_PR, composite, false );\n    }\n    else\n    {\n\tcomposite = Teuchos::rcp_const_cast<Matrix>( d_A );\n    }\n\n    return composite;\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Get the transposed composite linear operator.\n *\/\ntemplate<class Vector, class Matrix>\nTeuchos::RCP<const Matrix> \nLinearProblem<Vector,Matrix>::getTransposeCompositeOperator() const\n{\n    const bool left_prec = Teuchos::nonnull( d_PL );\n    const bool right_prec = Teuchos::nonnull( d_PR );\n\n    Teuchos::RCP<Matrix> composite;\n\n    if ( left_prec && right_prec )\n    {\n        Teuchos::RCP<Matrix> PL_T = MT::copyTranspose( *d_PL );\n        Teuchos::RCP<Matrix> A_T = MT::copyTranspose( *d_A );\n        Teuchos::RCP<Matrix> temp = MT::clone( *A_T );\n\tMT::multiply( A_T, PL_T, temp, false );\n        PL_T = Teuchos::null;\n        A_T = Teuchos::null;\n        Teuchos::RCP<Matrix> PR_T = MT::copyTranspose( *d_PR );\n        composite = MT::clone( *PR_T );        \n\tMT::multiply( PR_T, temp, composite, false );\n    }\n    else if ( right_prec )\n    {\n        Teuchos::RCP<Matrix> A_T = MT::copyTranspose( *d_A );\n        Teuchos::RCP<Matrix> PR_T = MT::copyTranspose( *d_PR );\n        composite = MT::clone( *PR_T );\n\tMT::multiply( PR_T, A_T, composite, false );\n    }\n    else if ( left_prec )\n    {\n        Teuchos::RCP<Matrix> A_T = MT::copyTranspose( *d_A );\n        composite = MT::clone( *A_T );\n        Teuchos::RCP<Matrix> PL_T = MT::copyTranspose( *d_PL );\n\tMT::multiply( A_T, PL_T, composite, false );\n    }\n    else\n    {\n\tcomposite = MT::copyTranspose( *d_A );\n    }\n\n    return composite;\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Update the solution vector with the provided update vector.\n *\/\ntemplate<class Vector, class Matrix>\nvoid LinearProblem<Vector,Matrix>::updateSolution( \n    const Teuchos::RCP<Vector>& update )\n{\n    const bool right_prec = Teuchos::nonnull( d_PR );\n\n    if ( right_prec )\n    {\n\tTeuchos::RCP<Vector> prec_update = VT::clone(*update);\n\tMT::apply( *d_PR, *update, *prec_update );\n\tVT::update( *d_x_op_decomp, Teuchos::ScalarTraits<Scalar>::one(),\n\t\t    *prec_update, Teuchos::ScalarTraits<Scalar>::one() );\n    }\n    else\n    {\n\tVT::update( *d_x_op_decomp, Teuchos::ScalarTraits<Scalar>::one(),\n\t\t    *update, Teuchos::ScalarTraits<Scalar>::one() );\n    }\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Apply the composite linear operator to a vector.\n *\/\ntemplate<class Vector, class Matrix>\nvoid LinearProblem<Vector,Matrix>::apply( const Vector& x, Vector& y )\n{\n    const bool left_prec = Teuchos::nonnull( d_PL );\n    const bool right_prec = Teuchos::nonnull( d_PR );\n\n    Teuchos::RCP<Vector> temp = \n\t( left_prec || right_prec ) ? VT::clone(y) : Teuchos::null;\n\n    if ( !left_prec && !right_prec )\n    {\n\tMT::apply( *d_A, x, y );\n    }\n\n    else if ( left_prec && right_prec )\n    {\n\tMT::apply( *d_PR, x, y );\n\tMT::apply( *d_A, y, *temp );\n\tMT::apply( *d_PL, *temp, y );\n    }\n    else if ( left_prec )\n    {\n\tMT::apply( *d_A, x, *temp );\n\tMT::apply( *d_PL, *temp, y );\n    }\n    else\n    {\n\tMT::apply( *d_PR, x, *temp );\n\tMT::apply( *d_A, *temp, y );\n    }\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Apply the base linear operator to a vector.\n *\/\ntemplate<class Vector, class Matrix>\nvoid LinearProblem<Vector,Matrix>::applyOp( const Vector& x, Vector& y )\n{\n    if ( Teuchos::nonnull(d_A) )\n    {\n\tMT::apply( *d_A, x, y );\n    }\n    else\n    {\n\tVT::update( y, Teuchos::ScalarTraits<Scalar>::zero(), \n\t\t    x, Teuchos::ScalarTraits<Scalar>::one() );\n    }\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Apply the left preconditioner to a vector.\n *\/\ntemplate<class Vector, class Matrix>\nvoid LinearProblem<Vector,Matrix>::applyLeftPrec( const Vector& x, Vector& y )\n{\n    if ( Teuchos::nonnull(d_PL) )\n    {\n\tMT::apply( *d_PL, x, y );\n    }\n    else\n    {\n\tVT::update( y, Teuchos::ScalarTraits<Scalar>::zero(), \n\t\t    x, Teuchos::ScalarTraits<Scalar>::one() );\n    }\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Apply the right preconditioner to a vector.\n *\/\ntemplate<class Vector, class Matrix>\nvoid LinearProblem<Vector,Matrix>::applyRightPrec( const Vector& x, Vector& y )\n{\n    if ( Teuchos::nonnull(d_PR) )\n    {\n\tMT::apply( *d_PR, x, y );\n    }\n    else\n    {\n\tVT::update( y, Teuchos::ScalarTraits<Scalar>::zero(), \n\t\t    x, Teuchos::ScalarTraits<Scalar>::one() );\n    }\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Update the residual.\n *\/\ntemplate<class Vector, class Matrix>\nvoid LinearProblem<Vector,Matrix>::updateResidual()\n{\n    MCLS_REQUIRE( Teuchos::nonnull(d_A) );\n    MCLS_REQUIRE( Teuchos::nonnull(d_x_op_decomp) );\n    MCLS_REQUIRE( Teuchos::nonnull(d_b) );\n\n    MT::apply( *d_A, *d_x_op_decomp, *d_r );\n    VT::update( *d_r, -Teuchos::ScalarTraits<Scalar>::one(), \n\t\t*d_b, Teuchos::ScalarTraits<Scalar>::one() );\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Update the preconditioned residual. Preconditioning will be applied\n * if preconditioners are present. \n *\/\ntemplate<class Vector, class Matrix>\nvoid LinearProblem<Vector,Matrix>::updatePrecResidual()\n{\n    MCLS_REQUIRE( Teuchos::nonnull(d_A) );\n    MCLS_REQUIRE( Teuchos::nonnull(d_x_op_decomp) );\n    MCLS_REQUIRE( Teuchos::nonnull(d_b) );\n\n    \/\/ Apply right preconditioning if necessary.\n    if ( Teuchos::nonnull(d_PR) )\n    {\n        Teuchos::RCP<Vector> temp = VT::clone(*d_rp);\n        MT::apply( *d_PR, *d_x_op_decomp, *temp);\n        MT::apply( *d_A, *temp, *d_rp );\n    }\n    else\n    {\n        MT::apply( *d_A, *d_x_op_decomp, *d_rp );\n    }\n\n    VT::update( *d_rp, -Teuchos::ScalarTraits<Scalar>::one(), \n\t\t*d_b, Teuchos::ScalarTraits<Scalar>::one() );\n\n    \/\/ Apply left preconditioning if necessary.\n    if ( Teuchos::nonnull(d_PL) )\n    {\n        Teuchos::RCP<Vector> temp = VT::deepCopy(*d_rp);\n\tMT::apply( *d_PL, *temp, *d_rp );\n    }\n}\n\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Export the LHS to the original decomposition.\n *\/\ntemplate<class Vector, class Matrix>\nvoid LinearProblem<Vector,Matrix>::exportLHS()\n{\n    MCLS_REQUIRE( Teuchos::nonnull(d_x) );\n    MCLS_REQUIRE( Teuchos::nonnull(d_x_op_decomp) );\n    MCLS_REQUIRE( Teuchos::nonnull(d_lhs_export) );\n\n    d_lhs_export->doExportInsert();\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\n} \/\/ end namespace MCLS\n\n#endif \/\/ end MCLS_LINEARPROBLEM_IMPL_HPP\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ end MCLS_LinearProblem_impl.hpp\n\/\/ ---------------------------------------------------------------------------\/\/\n\n<commit_msg>refactoring memory management in transpose composite operator generation<commit_after>\/\/---------------------------------------------------------------------------\/\/\n\/*\n  Copyright (c) 2012, Stuart R. Slattery\n  All 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 the University of Wisconsin - Madison 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\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\/*!\n * \\file MCLS_LinearProblem_impl.hpp\n * \\author Stuart R. Slattery\n * \\brief Linear problem implementation.\n *\/\n\/\/---------------------------------------------------------------------------\/\/\n\n#ifndef MCLS_LINEARPROBLEM_IMPL_HPP\n#define MCLS_LINEARPROBLEM_IMPL_HPP\n\n#include \"MCLS_DBC.hpp\"\n\n#include <Teuchos_ScalarTraits.hpp>\n\nnamespace MCLS\n{\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Constructor.\n *\/\ntemplate<class Vector, class Matrix>\nLinearProblem<Vector,Matrix>::LinearProblem( \n    const Teuchos::RCP<const Matrix>& A,\n    const Teuchos::RCP<Vector>& x,\n    const Teuchos::RCP<const Vector>& b )\n    : d_A( A )\n    , d_x( x )\n    , d_b( b )\n    , d_r( MT::cloneVectorFromMatrixRows(*d_A) )\n    , d_rp( MT::cloneVectorFromMatrixRows(*d_A) )\n    , d_x_op_decomp( MT::cloneVectorFromMatrixRows(*d_A) )\n    , d_lhs_export( Teuchos::rcp(new VectorExport<Vector>(d_x_op_decomp, d_x)) )\n{\n    VectorExport<Vector> lhs_export( d_x, d_x_op_decomp );\n    lhs_export.doExportInsert();\n\n    MCLS_ENSURE( !d_A.is_null() );\n    MCLS_ENSURE( !d_x.is_null() );\n    MCLS_ENSURE( !d_b.is_null() );\n    MCLS_ENSURE( !d_r.is_null() );\n    MCLS_ENSURE( !d_rp.is_null() );\n    MCLS_ENSURE( !d_x_op_decomp.is_null() );\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Destructor.\n *\/\ntemplate<class Vector, class Matrix>\nLinearProblem<Vector,Matrix>::~LinearProblem()\n{ \/* ... *\/ }\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Set the linear operator.\n *\/\ntemplate<class Vector, class Matrix>\nvoid LinearProblem<Vector,Matrix>::setOperator( \n    const Teuchos::RCP<const Matrix>& A )\n{\n    MCLS_REQUIRE( !A.is_null() );\n    d_A = A;\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Set the left-hand side.\n *\/\ntemplate<class Vector, class Matrix>\nvoid LinearProblem<Vector,Matrix>::setLHS( const Teuchos::RCP<Vector>& x )\n{\n    MCLS_REQUIRE( !x.is_null() );\n    d_x = x;\n\n    VectorExport<Vector> lhs_export( d_x, d_x_op_decomp );\n    lhs_export.doExportInsert();\n\n    d_lhs_export = Teuchos::rcp( new VectorExport<Vector>(d_x_op_decomp, d_x) );\n    MCLS_ENSURE( Teuchos::nonnull(d_lhs_export) );\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Set the right-hand side.\n *\/\ntemplate<class Vector, class Matrix>\nvoid LinearProblem<Vector,Matrix>::setRHS( const Teuchos::RCP<const Vector>& b )\n{\n    MCLS_REQUIRE( !b.is_null() );\n    d_b = b;\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Set the left preconditioner.\n *\/\ntemplate<class Vector, class Matrix>\nvoid LinearProblem<Vector,Matrix>::setLeftPrec( \n    const Teuchos::RCP<const Matrix>& PL )\n{\n    MCLS_REQUIRE( !PL.is_null() );\n    d_PL = PL;\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Set the right preconditioner.\n *\/\ntemplate<class Vector, class Matrix>\nvoid LinearProblem<Vector,Matrix>::setRightPrec( \n    const Teuchos::RCP<const Matrix>& PR )\n{\n    MCLS_REQUIRE( !PR.is_null() );\n    d_PR = PR;\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Get the composite linear operator.\n *\/\ntemplate<class Vector, class Matrix>\nTeuchos::RCP<const Matrix> \nLinearProblem<Vector,Matrix>::getCompositeOperator() const\n{\n    const bool left_prec = Teuchos::nonnull( d_PL );\n    const bool right_prec = Teuchos::nonnull( d_PR );\n\n    Teuchos::RCP<Matrix> composite;\n\n    if ( left_prec && right_prec )\n    {\n        Teuchos::RCP<Matrix> temp = MT::clone( *d_A );\n\tMT::multiply( d_A, d_PR, temp, false );\n        composite = MT::clone( *d_PL );\n\tMT::multiply( d_PL, temp, composite, false );\n    }\n    else if ( left_prec )\n    {\n        composite = MT::clone( *d_PL );\n\tMT::multiply( d_PL, d_A, composite, false );\n    }\n    else if ( right_prec )\n    {\n        composite = MT::clone( *d_A );\n\tMT::multiply( d_A, d_PR, composite, false );\n    }\n    else\n    {\n\tcomposite = Teuchos::rcp_const_cast<Matrix>( d_A );\n    }\n\n    return composite;\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Get the transposed composite linear operator.\n *\/\ntemplate<class Vector, class Matrix>\nTeuchos::RCP<const Matrix> \nLinearProblem<Vector,Matrix>::getTransposeCompositeOperator() const\n{\n    const bool left_prec = Teuchos::nonnull( d_PL );\n    const bool right_prec = Teuchos::nonnull( d_PR );\n\n    Teuchos::RCP<Matrix> composite;\n\n    if ( left_prec && right_prec )\n    {\n        Teuchos::RCP<Matrix> temp;\n        {\n            Teuchos::RCP<Matrix> PL_T = MT::copyTranspose( *d_PL );\n            Teuchos::RCP<Matrix> A_T = MT::copyTranspose( *d_A );\n            temp = MT::clone( *A_T );\n            MT::multiply( A_T, PL_T, temp, false );\n        }\n        Teuchos::RCP<Matrix> PR_T = MT::copyTranspose( *d_PR );\n        composite = MT::clone( *PR_T );        \n\tMT::multiply( PR_T, temp, composite, false );\n    }\n    else if ( right_prec )\n    {\n        Teuchos::RCP<Matrix> A_T = MT::copyTranspose( *d_A );\n        Teuchos::RCP<Matrix> PR_T = MT::copyTranspose( *d_PR );\n        composite = MT::clone( *PR_T );\n\tMT::multiply( PR_T, A_T, composite, false );\n    }\n    else if ( left_prec )\n    {\n        Teuchos::RCP<Matrix> A_T = MT::copyTranspose( *d_A );\n        composite = MT::clone( *A_T );\n        Teuchos::RCP<Matrix> PL_T = MT::copyTranspose( *d_PL );\n\tMT::multiply( A_T, PL_T, composite, false );\n    }\n    else\n    {\n\tcomposite = MT::copyTranspose( *d_A );\n    }\n\n    return composite;\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Update the solution vector with the provided update vector.\n *\/\ntemplate<class Vector, class Matrix>\nvoid LinearProblem<Vector,Matrix>::updateSolution( \n    const Teuchos::RCP<Vector>& update )\n{\n    const bool right_prec = Teuchos::nonnull( d_PR );\n\n    if ( right_prec )\n    {\n\tTeuchos::RCP<Vector> prec_update = VT::clone(*update);\n\tMT::apply( *d_PR, *update, *prec_update );\n\tVT::update( *d_x_op_decomp, Teuchos::ScalarTraits<Scalar>::one(),\n\t\t    *prec_update, Teuchos::ScalarTraits<Scalar>::one() );\n    }\n    else\n    {\n\tVT::update( *d_x_op_decomp, Teuchos::ScalarTraits<Scalar>::one(),\n\t\t    *update, Teuchos::ScalarTraits<Scalar>::one() );\n    }\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Apply the composite linear operator to a vector.\n *\/\ntemplate<class Vector, class Matrix>\nvoid LinearProblem<Vector,Matrix>::apply( const Vector& x, Vector& y )\n{\n    const bool left_prec = Teuchos::nonnull( d_PL );\n    const bool right_prec = Teuchos::nonnull( d_PR );\n\n    Teuchos::RCP<Vector> temp = \n\t( left_prec || right_prec ) ? VT::clone(y) : Teuchos::null;\n\n    if ( !left_prec && !right_prec )\n    {\n\tMT::apply( *d_A, x, y );\n    }\n\n    else if ( left_prec && right_prec )\n    {\n\tMT::apply( *d_PR, x, y );\n\tMT::apply( *d_A, y, *temp );\n\tMT::apply( *d_PL, *temp, y );\n    }\n    else if ( left_prec )\n    {\n\tMT::apply( *d_A, x, *temp );\n\tMT::apply( *d_PL, *temp, y );\n    }\n    else\n    {\n\tMT::apply( *d_PR, x, *temp );\n\tMT::apply( *d_A, *temp, y );\n    }\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Apply the base linear operator to a vector.\n *\/\ntemplate<class Vector, class Matrix>\nvoid LinearProblem<Vector,Matrix>::applyOp( const Vector& x, Vector& y )\n{\n    if ( Teuchos::nonnull(d_A) )\n    {\n\tMT::apply( *d_A, x, y );\n    }\n    else\n    {\n\tVT::update( y, Teuchos::ScalarTraits<Scalar>::zero(), \n\t\t    x, Teuchos::ScalarTraits<Scalar>::one() );\n    }\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Apply the left preconditioner to a vector.\n *\/\ntemplate<class Vector, class Matrix>\nvoid LinearProblem<Vector,Matrix>::applyLeftPrec( const Vector& x, Vector& y )\n{\n    if ( Teuchos::nonnull(d_PL) )\n    {\n\tMT::apply( *d_PL, x, y );\n    }\n    else\n    {\n\tVT::update( y, Teuchos::ScalarTraits<Scalar>::zero(), \n\t\t    x, Teuchos::ScalarTraits<Scalar>::one() );\n    }\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Apply the right preconditioner to a vector.\n *\/\ntemplate<class Vector, class Matrix>\nvoid LinearProblem<Vector,Matrix>::applyRightPrec( const Vector& x, Vector& y )\n{\n    if ( Teuchos::nonnull(d_PR) )\n    {\n\tMT::apply( *d_PR, x, y );\n    }\n    else\n    {\n\tVT::update( y, Teuchos::ScalarTraits<Scalar>::zero(), \n\t\t    x, Teuchos::ScalarTraits<Scalar>::one() );\n    }\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Update the residual.\n *\/\ntemplate<class Vector, class Matrix>\nvoid LinearProblem<Vector,Matrix>::updateResidual()\n{\n    MCLS_REQUIRE( Teuchos::nonnull(d_A) );\n    MCLS_REQUIRE( Teuchos::nonnull(d_x_op_decomp) );\n    MCLS_REQUIRE( Teuchos::nonnull(d_b) );\n\n    MT::apply( *d_A, *d_x_op_decomp, *d_r );\n    VT::update( *d_r, -Teuchos::ScalarTraits<Scalar>::one(), \n\t\t*d_b, Teuchos::ScalarTraits<Scalar>::one() );\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Update the preconditioned residual. Preconditioning will be applied\n * if preconditioners are present. \n *\/\ntemplate<class Vector, class Matrix>\nvoid LinearProblem<Vector,Matrix>::updatePrecResidual()\n{\n    MCLS_REQUIRE( Teuchos::nonnull(d_A) );\n    MCLS_REQUIRE( Teuchos::nonnull(d_x_op_decomp) );\n    MCLS_REQUIRE( Teuchos::nonnull(d_b) );\n\n    \/\/ Apply right preconditioning if necessary.\n    if ( Teuchos::nonnull(d_PR) )\n    {\n        Teuchos::RCP<Vector> temp = VT::clone(*d_rp);\n        MT::apply( *d_PR, *d_x_op_decomp, *temp);\n        MT::apply( *d_A, *temp, *d_rp );\n    }\n    else\n    {\n        MT::apply( *d_A, *d_x_op_decomp, *d_rp );\n    }\n\n    VT::update( *d_rp, -Teuchos::ScalarTraits<Scalar>::one(), \n\t\t*d_b, Teuchos::ScalarTraits<Scalar>::one() );\n\n    \/\/ Apply left preconditioning if necessary.\n    if ( Teuchos::nonnull(d_PL) )\n    {\n        Teuchos::RCP<Vector> temp = VT::deepCopy(*d_rp);\n\tMT::apply( *d_PL, *temp, *d_rp );\n    }\n}\n\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Export the LHS to the original decomposition.\n *\/\ntemplate<class Vector, class Matrix>\nvoid LinearProblem<Vector,Matrix>::exportLHS()\n{\n    MCLS_REQUIRE( Teuchos::nonnull(d_x) );\n    MCLS_REQUIRE( Teuchos::nonnull(d_x_op_decomp) );\n    MCLS_REQUIRE( Teuchos::nonnull(d_lhs_export) );\n\n    d_lhs_export->doExportInsert();\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\n} \/\/ end namespace MCLS\n\n#endif \/\/ end MCLS_LINEARPROBLEM_IMPL_HPP\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ end MCLS_LinearProblem_impl.hpp\n\/\/ ---------------------------------------------------------------------------\/\/\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"MockIRRangeFinderSensor.h\"\n\nMockIRRangeFinderSensor::~MockIRRangeFinderSensor() {\n}\n\nvoid MockIRRangeFinderSensor::updateSensor(RawSensorData* data) {\n    this->distanceInCm = std::stod(data->getData());\n}\n\ndouble MockIRRangeFinderSensor::getDistanceMM() {\n    return this->distanceInCm * 10;\n}\n\ndouble MockIRRangeFinderSensor::getDistanceCM() {\n    return this->distanceInCm;\n}\n<commit_msg>Fixed memory leak in MockIRRangeFinderSensor<commit_after>#include \"MockIRRangeFinderSensor.h\"\n\nMockIRRangeFinderSensor::~MockIRRangeFinderSensor() {\n}\n\nvoid MockIRRangeFinderSensor::updateSensor(RawSensorData* data) {\n    this->distanceInCm = std::stod(data->getData());\n    delete data;\n}\n\ndouble MockIRRangeFinderSensor::getDistanceMM() {\n    return this->distanceInCm * 10;\n}\n\ndouble MockIRRangeFinderSensor::getDistanceCM() {\n    return this->distanceInCm;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (C) 2014 Jérôme Leclercq\n\/\/ This file is part of the \"Nazara Engine - Renderer module\"\n\/\/ For conditions of distribution and use, see copyright notice in Config.hpp\n\n#include <Nazara\/Renderer\/Context.hpp>\n#include <Nazara\/Core\/Error.hpp>\n#include <Nazara\/Core\/Log.hpp>\n#include <Nazara\/Core\/StringStream.hpp>\n#include <Nazara\/Renderer\/Config.hpp>\n#include <Nazara\/Renderer\/OpenGL.hpp>\n#include <memory>\n#include <vector>\n\n#if defined(NAZARA_PLATFORM_WINDOWS)\n\t#include <Nazara\/Renderer\/Win32\/ContextImpl.hpp>\n#elif defined(NAZARA_PLATFORM_LINUX)\n\t#include <Nazara\/Renderer\/Linux\/ContextImpl.hpp>\n#else\n\t#error Lack of implementation: Context\n#endif\n\n#include <Nazara\/Renderer\/Debug.hpp>\n\nnamespace\n{\n\tthread_local const NzContext* s_currentContext = nullptr;\n\tthread_local const NzContext* s_threadContext = nullptr;\n\n\tvoid CALLBACK DebugCallback(unsigned int source, unsigned int type, unsigned int id, unsigned int severity, int length, const char* message, const void* userParam)\n\t{\n\t\tNazaraUnused(length);\n\n\t\tNzStringStream ss;\n\t\tss << \"OpenGL debug message (ID: 0x\" << NzString::Number(id, 16) << \"):\\n\";\n\t\tss << \"Sent by context: \" << userParam;\n\t\tss << \"\\n-Source: \";\n\t\tswitch (source)\n\t\t{\n\t\t\tcase GL_DEBUG_SOURCE_API:\n\t\t\t\tss << \"OpenGL\";\n\t\t\t\tbreak;\n\n\t\t\tcase GL_DEBUG_SOURCE_WINDOW_SYSTEM:\n\t\t\t\tss << \"Operating system\";\n\t\t\t\tbreak;\n\n\t\t\tcase GL_DEBUG_SOURCE_SHADER_COMPILER:\n\t\t\t\tss << \"Shader compiler\";\n\t\t\t\tbreak;\n\n\t\t\tcase GL_DEBUG_SOURCE_THIRD_PARTY:\n\t\t\t\tss << \"Third party\";\n\t\t\t\tbreak;\n\n\t\t\tcase GL_DEBUG_SOURCE_APPLICATION:\n\t\t\t\tss << \"Application\";\n\t\t\t\tbreak;\n\n\t\t\tcase GL_DEBUG_SOURCE_OTHER:\n\t\t\t\tss << \"Other\";\n\t\t\t\tbreak;\n\n\t\t\tdefault:\n\t\t\t\t\/\/ Peut être rajouté par une extension\n\t\t\t\tss << \"Unknown\";\n\t\t\t\tbreak;\n\t\t}\n\t\tss << '\\n';\n\n\t\tss << \"-Type: \";\n\t\tswitch (type)\n\t\t{\n\t\t\tcase GL_DEBUG_TYPE_ERROR:\n\t\t\t\tss << \"Error\";\n\t\t\t\tbreak;\n\n\t\t\tcase GL_DEBUG_TYPE_DEPRECATED_BEHAVIOR:\n\t\t\t\tss << \"Deprecated behavior\";\n\t\t\t\tbreak;\n\n\t\t\tcase GL_DEBUG_TYPE_UNDEFINED_BEHAVIOR:\n\t\t\t\tss << \"Undefined behavior\";\n\t\t\t\tbreak;\n\n\t\t\tcase GL_DEBUG_TYPE_PORTABILITY:\n\t\t\t\tss << \"Portability\";\n\t\t\t\tbreak;\n\n\t\t\tcase GL_DEBUG_TYPE_PERFORMANCE:\n\t\t\t\tss << \"Performance\";\n\t\t\t\tbreak;\n\n\t\t\tcase GL_DEBUG_TYPE_OTHER:\n\t\t\t\tss << \"Other\";\n\t\t\t\tbreak;\n\n\t\t\tdefault:\n\t\t\t\t\/\/ Peut être rajouté par une extension\n\t\t\t\tss << \"Unknown\";\n\t\t\t\tbreak;\n\t\t}\n\t\tss << '\\n';\n\n\t\tss << \"-Severity: \";\n\t\tswitch (severity)\n\t\t{\n\t\t\tcase GL_DEBUG_SEVERITY_HIGH:\n\t\t\t\tss << \"High\";\n\t\t\t\tbreak;\n\n\t\t\tcase GL_DEBUG_SEVERITY_MEDIUM:\n\t\t\t\tss << \"Medium\";\n\t\t\t\tbreak;\n\n\t\t\tcase GL_DEBUG_SEVERITY_LOW:\n\t\t\t\tss << \"Low\";\n\t\t\t\tbreak;\n\n\t\t\tdefault:\n\t\t\t\t\/\/ Peut être rajouté par une extension\n\t\t\t\tss << \"Unknown\";\n\t\t\t\tbreak;\n\t\t}\n\t\tss << '\\n';\n\n\t\tss << \"Message: \" << message << '\\n';\n\n\t\tNazaraNotice(ss);\n\t}\n}\n\nNzContext::~NzContext()\n{\n\tDestroy();\n}\n\nbool NzContext::Create(const NzContextParameters& parameters)\n{\n\tDestroy();\n\n\tm_parameters = parameters;\n\tif (m_parameters.shared && !m_parameters.shareContext)\n\t\tm_parameters.shareContext = s_reference.get();\n\n\tstd::unique_ptr<NzContextImpl> impl(new NzContextImpl);\n\tif (!impl->Create(m_parameters))\n\t{\n\t\tNazaraError(\"Failed to create context implementation\");\n\t\treturn false;\n\t}\n\n\tif (!SetActive(true))\n\t{\n\t\tNazaraError(\"Failed to activate context\");\n\n\t\tm_impl->Destroy();\n\t\tdelete m_impl;\n\t\tm_impl = nullptr;\n\n\t\treturn false;\n\t}\n\n\tif (m_parameters.antialiasingLevel > 0)\n\t\tglEnable(GL_MULTISAMPLE);\n\n\tif (m_parameters.debugMode && NzOpenGL::IsSupported(nzOpenGLExtension_DebugOutput))\n\t{\n\t\tglDebugMessageCallback(&DebugCallback, this);\n\n\t\t#ifdef NAZARA_DEBUG\n\t\tglEnable(GL_DEBUG_OUTPUT_SYNCHRONOUS);\n\t\t#endif\n\t}\n\n\tNotifyCreated();\n\n\treturn true;\n}\n\nvoid NzContext::Destroy()\n{\n\tif (m_impl)\n\t{\n\t\tNotifyDestroy();\n\n\t\tNzOpenGL::OnContextDestruction(this);\n\t\tSetActive(false);\n\n\t\tm_impl->Destroy();\n\t\tdelete m_impl;\n\t\tm_impl = nullptr;\n\t}\n}\n\nconst NzContextParameters& NzContext::GetParameters() const\n{\n\t#ifdef NAZARA_RENDERER_SAFE\n\tif (!m_impl)\n\t\tNazaraError(\"No context has been created\");\n\t#endif\n\n\treturn m_parameters;\n}\n\nbool NzContext::IsActive() const\n{\n\t#ifdef NAZARA_RENDERER_SAFE\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"No context has been created\");\n\t\treturn false;\n\t}\n\t#endif\n\n\treturn s_currentContext == this;\n}\n\nbool NzContext::SetActive(bool active) const\n{\n\t#ifdef NAZARA_RENDERER_SAFE\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"No context has been created\");\n\t\treturn false;\n\t}\n\t#endif\n\n\t\/\/ Si le contexte est déjà activé\/désactivé\n\tif ((s_currentContext == this) == active)\n\t\treturn true;\n\n\tif (active)\n\t{\n\t\tif (!m_impl->Activate())\n\t\t\treturn false;\n\n\t\ts_currentContext = this;\n\t}\n\telse\n\t{\n\t\tif (!NzContextImpl::Desactivate())\n\t\t\treturn false;\n\n\t\ts_currentContext = nullptr;\n\t}\n\n\tNzOpenGL::OnContextChanged(s_currentContext);\n\n\treturn true;\n}\n\nvoid NzContext::SwapBuffers()\n{\n\t#ifdef NAZARA_RENDERER_SAFE\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"No context has been created\");\n\t\treturn;\n\t}\n\n\tif (!m_parameters.doubleBuffered)\n\t{\n\t\tNazaraError(\"Context is not double buffered\");\n\t\treturn;\n\t}\n\t#endif\n\n\tm_impl->SwapBuffers();\n}\n\nbool NzContext::EnsureContext()\n{\n\tif (!s_currentContext)\n\t{\n\t\tif (!s_threadContext)\n\t\t{\n\t\t\tstd::unique_ptr<NzContext> context(new NzContext);\n\t\t\tif (!context->Create())\n\t\t\t{\n\t\t\t\tNazaraError(\"Failed to create context\");\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\ts_threadContext = context.get();\n\n\t\t\ts_contexts.emplace_back(std::move(context));\n\t\t}\n\n\t\tif (!s_threadContext->SetActive(true))\n\t\t{\n\t\t\tNazaraError(\"Failed to active thread context\");\n\t\t\treturn false;\n\t\t}\n\t}\n\n\treturn true;\n}\n\nconst NzContext* NzContext::GetCurrent()\n{\n\treturn s_currentContext;\n}\n\nconst NzContext* NzContext::GetReference()\n{\n\treturn s_reference.get();\n}\n\nconst NzContext* NzContext::GetThreadContext()\n{\n\tEnsureContext();\n\n\treturn s_threadContext;\n}\n\nbool NzContext::Initialize()\n{\n\tNzContextParameters parameters;\n\tparameters.shared = false; \/\/ Difficile de partager le contexte de référence avec lui-même\n\n\tstd::unique_ptr<NzContext> reference(new NzContext);\n\tif (!reference->Create(parameters))\n\t{\n\t\tNazaraError(\"Failed to create reference context\");\n\t\treturn false;\n\t}\n\n\t\/\/ Le contexte de référence doit rester désactivé pour le partage\n\tif (!reference->SetActive(false))\n\t{\n\t\tNazaraError(\"Failed to desactive reference context\");\n\t\treturn false;\n\t}\n\n\ts_reference = std::move(reference);\n\n\t\/\/ Le contexte de référence est partagé par défaut avec les autres contextes\n\tNzContextParameters::defaultShareContext = s_reference.get();\n\treturn true;\n}\n\nvoid NzContext::Uninitialize()\n{\n\ts_contexts.clear(); \/\/ On supprime tous les contextes créés\n\ts_reference.reset();\n}\n\nstd::unique_ptr<NzContext> NzContext::s_reference;\nstd::vector<std::unique_ptr<NzContext>> NzContext::s_contexts;\n<commit_msg>Made Context::Create exception-safe<commit_after>\/\/ Copyright (C) 2014 Jérôme Leclercq\n\/\/ This file is part of the \"Nazara Engine - Renderer module\"\n\/\/ For conditions of distribution and use, see copyright notice in Config.hpp\n\n#include <Nazara\/Renderer\/Context.hpp>\n#include <Nazara\/Core\/CallOnExit.hpp>\n#include <Nazara\/Core\/Error.hpp>\n#include <Nazara\/Core\/Log.hpp>\n#include <Nazara\/Core\/StringStream.hpp>\n#include <Nazara\/Renderer\/Config.hpp>\n#include <Nazara\/Renderer\/OpenGL.hpp>\n#include <memory>\n#include <vector>\n\n#if defined(NAZARA_PLATFORM_WINDOWS)\n\t#include <Nazara\/Renderer\/Win32\/ContextImpl.hpp>\n#elif defined(NAZARA_PLATFORM_LINUX)\n\t#include <Nazara\/Renderer\/Linux\/ContextImpl.hpp>\n#else\n\t#error Lack of implementation: Context\n#endif\n\n#include <Nazara\/Renderer\/Debug.hpp>\n\nnamespace\n{\n\tthread_local const NzContext* s_currentContext = nullptr;\n\tthread_local const NzContext* s_threadContext = nullptr;\n\n\tvoid CALLBACK DebugCallback(unsigned int source, unsigned int type, unsigned int id, unsigned int severity, int length, const char* message, const void* userParam)\n\t{\n\t\tNazaraUnused(length);\n\n\t\tNzStringStream ss;\n\t\tss << \"OpenGL debug message (ID: 0x\" << NzString::Number(id, 16) << \"):\\n\";\n\t\tss << \"Sent by context: \" << userParam;\n\t\tss << \"\\n-Source: \";\n\t\tswitch (source)\n\t\t{\n\t\t\tcase GL_DEBUG_SOURCE_API:\n\t\t\t\tss << \"OpenGL\";\n\t\t\t\tbreak;\n\n\t\t\tcase GL_DEBUG_SOURCE_WINDOW_SYSTEM:\n\t\t\t\tss << \"Operating system\";\n\t\t\t\tbreak;\n\n\t\t\tcase GL_DEBUG_SOURCE_SHADER_COMPILER:\n\t\t\t\tss << \"Shader compiler\";\n\t\t\t\tbreak;\n\n\t\t\tcase GL_DEBUG_SOURCE_THIRD_PARTY:\n\t\t\t\tss << \"Third party\";\n\t\t\t\tbreak;\n\n\t\t\tcase GL_DEBUG_SOURCE_APPLICATION:\n\t\t\t\tss << \"Application\";\n\t\t\t\tbreak;\n\n\t\t\tcase GL_DEBUG_SOURCE_OTHER:\n\t\t\t\tss << \"Other\";\n\t\t\t\tbreak;\n\n\t\t\tdefault:\n\t\t\t\t\/\/ Peut être rajouté par une extension\n\t\t\t\tss << \"Unknown\";\n\t\t\t\tbreak;\n\t\t}\n\t\tss << '\\n';\n\n\t\tss << \"-Type: \";\n\t\tswitch (type)\n\t\t{\n\t\t\tcase GL_DEBUG_TYPE_ERROR:\n\t\t\t\tss << \"Error\";\n\t\t\t\tbreak;\n\n\t\t\tcase GL_DEBUG_TYPE_DEPRECATED_BEHAVIOR:\n\t\t\t\tss << \"Deprecated behavior\";\n\t\t\t\tbreak;\n\n\t\t\tcase GL_DEBUG_TYPE_UNDEFINED_BEHAVIOR:\n\t\t\t\tss << \"Undefined behavior\";\n\t\t\t\tbreak;\n\n\t\t\tcase GL_DEBUG_TYPE_PORTABILITY:\n\t\t\t\tss << \"Portability\";\n\t\t\t\tbreak;\n\n\t\t\tcase GL_DEBUG_TYPE_PERFORMANCE:\n\t\t\t\tss << \"Performance\";\n\t\t\t\tbreak;\n\n\t\t\tcase GL_DEBUG_TYPE_OTHER:\n\t\t\t\tss << \"Other\";\n\t\t\t\tbreak;\n\n\t\t\tdefault:\n\t\t\t\t\/\/ Peut être rajouté par une extension\n\t\t\t\tss << \"Unknown\";\n\t\t\t\tbreak;\n\t\t}\n\t\tss << '\\n';\n\n\t\tss << \"-Severity: \";\n\t\tswitch (severity)\n\t\t{\n\t\t\tcase GL_DEBUG_SEVERITY_HIGH:\n\t\t\t\tss << \"High\";\n\t\t\t\tbreak;\n\n\t\t\tcase GL_DEBUG_SEVERITY_MEDIUM:\n\t\t\t\tss << \"Medium\";\n\t\t\t\tbreak;\n\n\t\t\tcase GL_DEBUG_SEVERITY_LOW:\n\t\t\t\tss << \"Low\";\n\t\t\t\tbreak;\n\n\t\t\tdefault:\n\t\t\t\t\/\/ Peut être rajouté par une extension\n\t\t\t\tss << \"Unknown\";\n\t\t\t\tbreak;\n\t\t}\n\t\tss << '\\n';\n\n\t\tss << \"Message: \" << message << '\\n';\n\n\t\tNazaraNotice(ss);\n\t}\n}\n\nNzContext::~NzContext()\n{\n\tDestroy();\n}\n\nbool NzContext::Create(const NzContextParameters& parameters)\n{\n\tDestroy();\n\n\tm_parameters = parameters;\n\tif (m_parameters.shared && !m_parameters.shareContext)\n\t\tm_parameters.shareContext = s_reference.get();\n\n\tstd::unique_ptr<NzContextImpl> impl(new NzContextImpl);\n\tif (!impl->Create(m_parameters))\n\t{\n\t\tNazaraError(\"Failed to create context implementation\");\n\t\treturn false;\n\t}\n\n\tm_impl = impl.release();\n\n\tNzCallOnExit onExit([this] () { Destroy(); });\n\n\tif (!SetActive(true))\n\t{\n\t\tNazaraError(\"Failed to activate context\");\n\t\treturn false;\n\t}\n\n\tif (m_parameters.antialiasingLevel > 0)\n\t\tglEnable(GL_MULTISAMPLE);\n\n\tif (m_parameters.debugMode && NzOpenGL::IsSupported(nzOpenGLExtension_DebugOutput))\n\t{\n\t\tglDebugMessageCallback(&DebugCallback, this);\n\n\t\t#ifdef NAZARA_DEBUG\n\t\tglEnable(GL_DEBUG_OUTPUT_SYNCHRONOUS);\n\t\t#endif\n\t}\n\n\tonExit.Reset();\n\n\tNotifyCreated();\n\n\treturn true;\n}\n\nvoid NzContext::Destroy()\n{\n\tif (m_impl)\n\t{\n\t\tNotifyDestroy();\n\n\t\tNzOpenGL::OnContextDestruction(this);\n\t\tSetActive(false);\n\n\t\tm_impl->Destroy();\n\t\tdelete m_impl;\n\t\tm_impl = nullptr;\n\t}\n}\n\nconst NzContextParameters& NzContext::GetParameters() const\n{\n\t#ifdef NAZARA_RENDERER_SAFE\n\tif (!m_impl)\n\t\tNazaraError(\"No context has been created\");\n\t#endif\n\n\treturn m_parameters;\n}\n\nbool NzContext::IsActive() const\n{\n\t#ifdef NAZARA_RENDERER_SAFE\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"No context has been created\");\n\t\treturn false;\n\t}\n\t#endif\n\n\treturn s_currentContext == this;\n}\n\nbool NzContext::SetActive(bool active) const\n{\n\t#ifdef NAZARA_RENDERER_SAFE\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"No context has been created\");\n\t\treturn false;\n\t}\n\t#endif\n\n\t\/\/ Si le contexte est déjà activé\/désactivé\n\tif ((s_currentContext == this) == active)\n\t\treturn true;\n\n\tif (active)\n\t{\n\t\tif (!m_impl->Activate())\n\t\t\treturn false;\n\n\t\ts_currentContext = this;\n\t}\n\telse\n\t{\n\t\tif (!NzContextImpl::Desactivate())\n\t\t\treturn false;\n\n\t\ts_currentContext = nullptr;\n\t}\n\n\tNzOpenGL::OnContextChanged(s_currentContext);\n\n\treturn true;\n}\n\nvoid NzContext::SwapBuffers()\n{\n\t#ifdef NAZARA_RENDERER_SAFE\n\tif (!m_impl)\n\t{\n\t\tNazaraError(\"No context has been created\");\n\t\treturn;\n\t}\n\n\tif (!m_parameters.doubleBuffered)\n\t{\n\t\tNazaraError(\"Context is not double buffered\");\n\t\treturn;\n\t}\n\t#endif\n\n\tm_impl->SwapBuffers();\n}\n\nbool NzContext::EnsureContext()\n{\n\tif (!s_currentContext)\n\t{\n\t\tif (!s_threadContext)\n\t\t{\n\t\t\tstd::unique_ptr<NzContext> context(new NzContext);\n\t\t\tif (!context->Create())\n\t\t\t{\n\t\t\t\tNazaraError(\"Failed to create context\");\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\ts_threadContext = context.get();\n\n\t\t\ts_contexts.emplace_back(std::move(context));\n\t\t}\n\n\t\tif (!s_threadContext->SetActive(true))\n\t\t{\n\t\t\tNazaraError(\"Failed to active thread context\");\n\t\t\treturn false;\n\t\t}\n\t}\n\n\treturn true;\n}\n\nconst NzContext* NzContext::GetCurrent()\n{\n\treturn s_currentContext;\n}\n\nconst NzContext* NzContext::GetReference()\n{\n\treturn s_reference.get();\n}\n\nconst NzContext* NzContext::GetThreadContext()\n{\n\tEnsureContext();\n\n\treturn s_threadContext;\n}\n\nbool NzContext::Initialize()\n{\n\tNzContextParameters parameters;\n\tparameters.shared = false; \/\/ Difficile de partager le contexte de référence avec lui-même\n\n\tstd::unique_ptr<NzContext> reference(new NzContext);\n\tif (!reference->Create(parameters))\n\t{\n\t\tNazaraError(\"Failed to create reference context\");\n\t\treturn false;\n\t}\n\n\t\/\/ Le contexte de référence doit rester désactivé pour le partage\n\tif (!reference->SetActive(false))\n\t{\n\t\tNazaraError(\"Failed to desactive reference context\");\n\t\treturn false;\n\t}\n\n\ts_reference = std::move(reference);\n\n\t\/\/ Le contexte de référence est partagé par défaut avec les autres contextes\n\tNzContextParameters::defaultShareContext = s_reference.get();\n\treturn true;\n}\n\nvoid NzContext::Uninitialize()\n{\n\ts_contexts.clear(); \/\/ On supprime tous les contextes créés\n\ts_reference.reset();\n}\n\nstd::unique_ptr<NzContext> NzContext::s_reference;\nstd::vector<std::unique_ptr<NzContext>> NzContext::s_contexts;\n<|endoftext|>"}
{"text":"<commit_before>#pragma warning(disable : 4091)\n\n#include <Main.h>\n#include <DbgHelp.h>\n#include <filesystem>\n\n\/\/ based on dbghelp.h\ntypedef BOOL(WINAPI *MINIDUMPWRITEDUMP)(HANDLE hProcess, DWORD dwPid, HANDLE hFile, MINIDUMP_TYPE DumpType,\n\tCONST PMINIDUMP_EXCEPTION_INFORMATION ExceptionParam,\n\tCONST PMINIDUMP_USER_STREAM_INFORMATION UserStreamParam,\n\tCONST PMINIDUMP_CALLBACK_INFORMATION CallbackParam\n\t);\n\nvoid WriteMiniDump(struct _EXCEPTION_POINTERS *pExceptionInfo)\n{\n\tHMODULE hDll = ::LoadLibrary(TEXT(\"DBGHELP.DLL\"));\n\tif (hDll)\n\t{\n        auto pDump = reinterpret_cast<MINIDUMPWRITEDUMP>(::GetProcAddress(hDll, \"MiniDumpWriteDump\"));\n\t\tif (pDump)\n\t\t{\n\t\t\tstd::filesystem::path basePath = std::filesystem::current_path();\n\n\t\t\twchar_t szDumpPath[_MAX_PATH];\n\t\t\twchar_t szDumpPathFirst[_MAX_PATH];\n\n\t\t\ttime_t tNow = time(0);\n\t\t\ttm t;\n\t\t\tlocaltime_s(&t, &tNow);\n\t\t\twcsftime(szDumpPathFirst, sizeof(szDumpPathFirst), L\"gw2radial_%d.%m.%Y_%H.%M.%S\", &t);\n\n\t\t\tint n = 1;\n\t\t\tdo\n\t\t\t{\n\t\t\t\tswprintf_s(szDumpPath, L\"%s\\\\%s-%d.dmp\", basePath.c_str(), szDumpPathFirst, n);\n\t\t\t\tn++;\n\t\t\t} while (std::filesystem::exists(szDumpPath));\n\n\t\t\t\/\/ create the file\n\t\t\tHANDLE hFile = ::CreateFileW(szDumpPath, GENERIC_WRITE, FILE_SHARE_WRITE, NULL, CREATE_ALWAYS,\n\t\t\t\tFILE_ATTRIBUTE_NORMAL, NULL);\n\n\t\t\tif (hFile != INVALID_HANDLE_VALUE)\n\t\t\t{\n\t\t\t\t_MINIDUMP_EXCEPTION_INFORMATION ExInfo;\n\n\t\t\t\tif (pExceptionInfo)\n\t\t\t\t{\n\t\t\t\t\tExInfo.ThreadId = ::GetCurrentThreadId();\n\t\t\t\t\tExInfo.ExceptionPointers = pExceptionInfo;\n\t\t\t\t\tExInfo.ClientPointers = NULL;\n\t\t\t\t\tpDump(GetCurrentProcess(), GetCurrentProcessId(), hFile, MiniDumpNormal, &ExInfo, NULL, NULL);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tpDump(GetCurrentProcess(), GetCurrentProcessId(), hFile, MiniDumpNormal, NULL, NULL, NULL);\n\t\t\t\t}\n\t\t\t\t::CloseHandle(hFile);\n\t\t\t}\n\t\t}\n\t}\n}\n\nBYTE oldSetUnhandledExceptionFilter[5];\n\nLONG WINAPI GW2RadialTopLevelFilter(struct _EXCEPTION_POINTERS *pExceptionInfo)\n{\n\t\/\/ Special code to ignore a consistent exception in Nvidia's driver\n\tif(pExceptionInfo->ExceptionRecord->ExceptionCode == 0xe06d7363)\n\t{\n\t    if(pExceptionInfo->ExceptionRecord->NumberParameters == 4)\n\t    {\n\t\t\tauto mbHandle = GetModuleHandleW(L\"MessageBus.dll\");\n\t        if(mbHandle && mbHandle == reinterpret_cast<HANDLE>(pExceptionInfo->ExceptionRecord->ExceptionInformation[3]))\n\t\t\t\treturn EXCEPTION_CONTINUE_SEARCH;\n\t    }\n\t}\n\n\tif(pExceptionInfo->ExceptionRecord->ExceptionCode >= 0x80000000L) {\n\t    switch(pExceptionInfo->ExceptionRecord->ExceptionCode) {\n\t    case STATUS_FLOAT_DENORMAL_OPERAND:\n\t    case STATUS_FLOAT_DIVIDE_BY_ZERO:\n\t    case STATUS_FLOAT_INEXACT_RESULT:\n\t    case STATUS_FLOAT_INVALID_OPERATION:\n\t    case STATUS_FLOAT_OVERFLOW:\n\t    case STATUS_FLOAT_STACK_CHECK:\n\t    case STATUS_FLOAT_UNDERFLOW:\n\t    case STATUS_FLOAT_MULTIPLE_FAULTS:\n\t    case STATUS_FLOAT_MULTIPLE_TRAPS:\n\t    case STATUS_INTEGER_DIVIDE_BY_ZERO:\n\t    case DBG_PRINTEXCEPTION_C:\n\t\t    break;\n\t    default:\n\t        WriteMiniDump(pExceptionInfo);\n\t    }\n\t}\n\n\t\/\/ Pass exception on anyway, we only wanted the minidump\n\treturn EXCEPTION_CONTINUE_SEARCH;\n}\n\n\nbool ExceptionHandlerMiniDump(struct _EXCEPTION_POINTERS *pExceptionInfo, const char* function, const char* file, int line)\n{\n\tWriteMiniDump(pExceptionInfo);\n\treturn !IsDebuggerPresent();\n}<commit_msg>Removed redundant check.<commit_after>#pragma warning(disable : 4091)\n\n#include <Main.h>\n#include <DbgHelp.h>\n#include <filesystem>\n\n\/\/ based on dbghelp.h\ntypedef BOOL(WINAPI *MINIDUMPWRITEDUMP)(HANDLE hProcess, DWORD dwPid, HANDLE hFile, MINIDUMP_TYPE DumpType,\n\tCONST PMINIDUMP_EXCEPTION_INFORMATION ExceptionParam,\n\tCONST PMINIDUMP_USER_STREAM_INFORMATION UserStreamParam,\n\tCONST PMINIDUMP_CALLBACK_INFORMATION CallbackParam\n\t);\n\nvoid WriteMiniDump(struct _EXCEPTION_POINTERS *pExceptionInfo)\n{\n\tHMODULE hDll = ::LoadLibrary(TEXT(\"DBGHELP.DLL\"));\n\tif (hDll)\n\t{\n        auto pDump = reinterpret_cast<MINIDUMPWRITEDUMP>(::GetProcAddress(hDll, \"MiniDumpWriteDump\"));\n\t\tif (pDump)\n\t\t{\n\t\t\tstd::filesystem::path basePath = std::filesystem::current_path();\n\n\t\t\twchar_t szDumpPath[_MAX_PATH];\n\t\t\twchar_t szDumpPathFirst[_MAX_PATH];\n\n\t\t\ttime_t tNow = time(0);\n\t\t\ttm t;\n\t\t\tlocaltime_s(&t, &tNow);\n\t\t\twcsftime(szDumpPathFirst, sizeof(szDumpPathFirst), L\"gw2radial_%d.%m.%Y_%H.%M.%S\", &t);\n\n\t\t\tint n = 1;\n\t\t\tdo\n\t\t\t{\n\t\t\t\tswprintf_s(szDumpPath, L\"%s\\\\%s-%d.dmp\", basePath.c_str(), szDumpPathFirst, n);\n\t\t\t\tn++;\n\t\t\t} while (std::filesystem::exists(szDumpPath));\n\n\t\t\t\/\/ create the file\n\t\t\tHANDLE hFile = ::CreateFileW(szDumpPath, GENERIC_WRITE, FILE_SHARE_WRITE, NULL, CREATE_ALWAYS,\n\t\t\t\tFILE_ATTRIBUTE_NORMAL, NULL);\n\n\t\t\tif (hFile != INVALID_HANDLE_VALUE)\n\t\t\t{\n\t\t\t\t_MINIDUMP_EXCEPTION_INFORMATION ExInfo;\n\n\t\t\t\tif (pExceptionInfo)\n\t\t\t\t{\n\t\t\t\t\tExInfo.ThreadId = ::GetCurrentThreadId();\n\t\t\t\t\tExInfo.ExceptionPointers = pExceptionInfo;\n\t\t\t\t\tExInfo.ClientPointers = NULL;\n\t\t\t\t\tpDump(GetCurrentProcess(), GetCurrentProcessId(), hFile, MiniDumpNormal, &ExInfo, NULL, NULL);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tpDump(GetCurrentProcess(), GetCurrentProcessId(), hFile, MiniDumpNormal, NULL, NULL, NULL);\n\t\t\t\t}\n\t\t\t\t::CloseHandle(hFile);\n\t\t\t}\n\t\t}\n\t}\n}\n\nBYTE oldSetUnhandledExceptionFilter[5];\n\nLONG WINAPI GW2RadialTopLevelFilter(struct _EXCEPTION_POINTERS *pExceptionInfo)\n{\n\t\/\/ Special code to ignore a consistent exception in Nvidia's driver\n\tif(pExceptionInfo->ExceptionRecord->ExceptionCode == 0xe06d7363)\n\t{\n\t    if(pExceptionInfo->ExceptionRecord->NumberParameters == 4)\n\t    {\n\t\t\tauto mbHandle = GetModuleHandleW(L\"MessageBus.dll\");\n\t        if(mbHandle && mbHandle == reinterpret_cast<HANDLE>(pExceptionInfo->ExceptionRecord->ExceptionInformation[3]))\n\t\t\t\treturn EXCEPTION_CONTINUE_SEARCH;\n\t    }\n\t}\n\n\tif(pExceptionInfo->ExceptionRecord->ExceptionCode >= 0x80000000L) {\n\t    switch(pExceptionInfo->ExceptionRecord->ExceptionCode) {\n\t    case STATUS_FLOAT_DENORMAL_OPERAND:\n\t    case STATUS_FLOAT_DIVIDE_BY_ZERO:\n\t    case STATUS_FLOAT_INEXACT_RESULT:\n\t    case STATUS_FLOAT_INVALID_OPERATION:\n\t    case STATUS_FLOAT_OVERFLOW:\n\t    case STATUS_FLOAT_STACK_CHECK:\n\t    case STATUS_FLOAT_UNDERFLOW:\n\t    case STATUS_FLOAT_MULTIPLE_FAULTS:\n\t    case STATUS_FLOAT_MULTIPLE_TRAPS:\n\t    case STATUS_INTEGER_DIVIDE_BY_ZERO:\n\t\t    break;\n\t    default:\n\t        WriteMiniDump(pExceptionInfo);\n\t    }\n\t}\n\n\t\/\/ Pass exception on anyway, we only wanted the minidump\n\treturn EXCEPTION_CONTINUE_SEARCH;\n}\n\n\nbool ExceptionHandlerMiniDump(struct _EXCEPTION_POINTERS *pExceptionInfo, const char* function, const char* file, int line)\n{\n\tWriteMiniDump(pExceptionInfo);\n\treturn !IsDebuggerPresent();\n}<|endoftext|>"}
{"text":"<commit_before>#include \"osg\/Group\"\n#include \"lua.hpp\"\n#include \"NodeScriptResultHandler.h\"\n#include \"luabinding.h\"\n\nstatic osg::Node* convertToOsgNode(lua_State *luaState, int index);\n\nNodeScriptResultHandler::NodeScriptResultHandler() :\n    ScriptResultHandler(ScriptResultHandler::UNLIMITED_RESULTS)\n{\n\n}\n\nNodeScriptResultHandler::~NodeScriptResultHandler()\n{\n\n}\n\nvoid NodeScriptResultHandler::handle(LuaState &luaState, unsigned int nbResults)\n{\n    if (nbResults == 0)\n    {\n        _node = 0;\n    }\n    else if (nbResults == 1)\n    {\n        _node = convertToOsgNode(luaState, -1);\n    }\n    else\n    {\n        osg::ref_ptr<osg::Group> group = new osg::Group;\n        for (unsigned int i = nbResults; i > 0; --i)\n        {\n            osg::Node *node = convertToOsgNode(luaState, -i);\n            group->addChild(node);\n        }\n\n        if (group->getNumChildren() == 1)\n        {\n            _node = group->getChild(0);\n        }\n        else if (group->getNumChildren() > 0)\n        {\n            _node = group;\n        }\n    }\n}\n\nstatic osg::Node* convertToOsgNode(lua_State *luaState, int index)\n{\n    osg::ref_ptr<osg::Node> node = lua_toOsgNode(luaState, index);\n    if (!node && lua_istable(luaState, index) && lua_checkstack(luaState, 2))\n    {\n        int tableIndex = index >= 0 ? index : index-1;\n        osg::ref_ptr<osg::Group> group = new osg::Group;\n\n        lua_pushnil(luaState);  \/* first key *\/\n        while (lua_next(luaState, tableIndex) != 0)\n        {\n            osg::Node *tableNode = convertToOsgNode(luaState, -1);\n            group->addChild(tableNode);\n            lua_pop(luaState, 1);\n        }\n\n        if (group->getNumChildren() == 1)\n        {\n            node = group->getChild(0);\n        }\n        else if (group->getNumChildren() > 0)\n        {\n            node = group;\n        }\n    }\n    return node.release();\n}\n<commit_msg>implementing lua_toOsgVec and support MatrixTransformation based on table index in LUA script<commit_after>#include \"osg\/Group\"\n#include \"osg\/MatrixTransform\"\n#include \"lua.hpp\"\n#include \"NodeScriptResultHandler.h\"\n#include \"luabinding.h\"\n\nstatic osg::Node* convertToOsgNode(LuaState &luaState, int index);\nstatic osg::Group* convertIndexTable(LuaState &luaState, int index);\n\ntemplate<class V>\nstatic const V lua_toOsgVec(LuaState &luaState, int index, char firstComponentName);\n\ninline osg::Vec3 lua_toOsgVec3(LuaState &luaState, int index)\n{\n    return lua_toOsgVec<osg::Vec3>(luaState, index, 'x');\n}\n\nNodeScriptResultHandler::NodeScriptResultHandler() :\n    ScriptResultHandler(ScriptResultHandler::UNLIMITED_RESULTS)\n{\n\n}\n\nNodeScriptResultHandler::~NodeScriptResultHandler()\n{\n\n}\n\nvoid NodeScriptResultHandler::handle(LuaState &luaState, unsigned int nbResults)\n{\n    if (nbResults == 0)\n    {\n        _node = 0;\n    }\n    else if (nbResults == 1)\n    {\n        _node = convertToOsgNode(luaState, -1);\n    }\n    else\n    {\n        osg::ref_ptr<osg::Group> group = new osg::Group;\n        for (unsigned int i = nbResults; i > 0; --i)\n        {\n            osg::Node *node = convertToOsgNode(luaState, -i);\n            group->addChild(node);\n        }\n\n        if (group->getNumChildren() == 1)\n        {\n            _node = group->getChild(0);\n        }\n        else if (group->getNumChildren() > 0)\n        {\n            _node = group;\n        }\n    }\n}\n\nstatic osg::Node* convertToOsgNode(LuaState &luaState, int index)\n{\n    osg::ref_ptr<osg::Node> node = lua_toOsgNode(luaState, index);\n    if (!node && lua_istable(luaState, index) && lua_checkstack(luaState, 2))\n    {\n        osg::ref_ptr<osg::Group> group = new osg::Group;\n\n        lua_pushnil(luaState);  \/* first key *\/\n        int tableIndex = index >= 0 ? index : index-1;\n        while (lua_next(luaState, tableIndex) != 0)\n        {\n            osg::ref_ptr<osg::Node> tableNode = convertToOsgNode(luaState, -1);\n            if (tableNode.valid())\n            {\n                osg::ref_ptr<osg::Group> indexNode = convertIndexTable(luaState, -2);\n                if (indexNode.valid())\n                {\n                    indexNode->addChild(tableNode);\n                    tableNode = indexNode;\n                }\n                group->addChild(tableNode);\n            }\n            lua_pop(luaState, 1);\n        }\n\n        if (group->getNumChildren() == 1)\n        {\n            node = group->getChild(0);\n        }\n        else if (group->getNumChildren() > 0)\n        {\n            node = group;\n        }\n    }\n    return node.release();\n}\n\nstatic osg::Group* convertIndexTable(LuaState &luaState, int index)\n{\n    if(lua_istable(luaState, index))\n    {\n        osg::Vec3 vec3 = lua_toOsgVec3(luaState, index);\n        if (vec3.valid())\n        {\n            osg::Matrix matrix;\n            matrix.setTrans(vec3);\n            osg::ref_ptr<osg::MatrixTransform> matrixTransform = new osg::MatrixTransform(matrix);\n            return matrixTransform.release();\n        }\n    }\n    return 0;\n}\n\ntemplate <class V>\nstatic const V lua_toOsgVec(LuaState &luaState, int index, char firstComponentName)\n{\n    V vec;\n    if (lua_istable(luaState, index) && lua_checkstack(luaState, 2))\n    {\n        unsigned int vecComponentMask = 0;\n        const unsigned int vecComponentCompleteMask = (1 << vec.num_components) - 1;\n\n        lua_pushnil(luaState);  \/* first key *\/\n        int tableIndex = index >= 0 ? index : index-1;\n        while (lua_next(luaState, tableIndex) != 0)\n        {\n            int vecComponentPos = -1;\n            if (lua_isnumber(luaState, -2))\n            {\n                vecComponentPos = lua_tonumber(luaState, -2) - 1;\n            }\n            else if(lua_isstring(luaState, -2) && lua_objlen(luaState, -2) == 1)\n            {\n                vecComponentPos = lua_tostring(luaState, -2)[0] - firstComponentName;\n            }\n\n            if (vecComponentPos >= 0 && vecComponentPos < vec.num_components)\n            {\n                vecComponentMask |= 1 << vecComponentPos;\n                if (lua_isnumber(luaState, -1))\n                {\n                    vec[vecComponentPos] = lua_tonumber(luaState, -1);\n                }\n                else\n                {\n                    vec[vecComponentPos] = NAN;\n                }\n            }\n\n            lua_pop(luaState, 1);\n            if (vecComponentMask == vecComponentCompleteMask)\n            {\n                lua_pop(luaState, 1);\n                break;\n            }\n        }\n    }\n    else\n    {\n        vec[0] = NAN;\n    }\n    return vec;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <common\/log.h>\n#include <common\/pty.h>\n#include <common\/string.h>\n#include <common\/file.h>\n#include <common\/list.h>\n#include <gui\/gui.h>\n#include <gdb\/gdb.h>\n#include <gdb\/frame.h>\n#include <gdb\/parser.tab.h>\n#include <user_cmd\/cmd.hash.h>\n#include <user_cmd\/subcmd.hash.h>\n#include <stdlib.h>\n#include <string.h>\n#include <signal.h>\n#include <math.h>\n#include <unistd.h>\n\n\n\/* class definition *\/\n\/**\n * \\brief\tstandard constructor\n *\/\ngdbif::gdbif(){\n\tmain_tid = 0;\n\tread_tid = 0;\n\tgdb = 0;\n\ttoken = 1;\n\tis_running = false;\n\tevent_lst = 0;\n\tstop_hdlr = 0;\n\n\tpthread_mutex_init(&resp_mtx, 0);\n\tpthread_mutex_init(&event_mtx, 0);\n\tpthread_cond_init(&resp_avail, 0);\n\tpthread_cond_init(&event_avail, 0);\n}\n\n\/**\n * \\brief\tstandard desctructor\n *\/\ngdbif::~gdbif(){\n\t\/\/ close gdb terminal\n\tdelete this->gdb;\n\n\tif(read_tid != 0)\n\t\tpthread_join(read_tid, 0);\n\n\tif(event_tid != 0){\n\t\tpthread_cancel(event_tid);\n\t\tpthread_join(event_tid, 0);\n\t}\n\n\tpthread_cond_destroy(&resp_avail);\n\tpthread_cond_destroy(&event_avail);\n\tpthread_mutex_destroy(&resp_mtx);\n\tpthread_mutex_destroy(&event_mtx);\n}\n\n\/**\n * \\brief\texec gdb and initialise its controlling terminal\n *\n * \\return\t0\ton success\n * \t\t\t-1\ton error (check errno)\n *\/\nint gdbif::init(pthread_t main_tid){\n\tthis->main_tid = main_tid;\n\n\t\/\/ initialise pseudo terminal\n\tthis->gdb = new pty();\n\n\t\/\/ fork child process\n\tgdb_pid = gdb->fork();\n\n\tif(gdb_pid == 0){\n\t\t\/* child *\/\n\t\tlog::cleanup();\n\n\t\treturn execl(GDB_CMD, GDB_CMD, GDB_ARGS, (char*)0);\n\t}\n\telse if(gdb_pid > 0){\n\t\t\/* parent *\/\n\t\tif(pthread_create(&read_tid, 0, readline_thread, this) != 0)\n\t\t\treturn -1;\n\n\t\tthread_name[read_tid] = \"gdb-readline\";\n\n\t\tif(pthread_create(&event_tid, 0, event_thread, this) != 0)\n\t\t\treturn -1;\n\n\t\tthread_name[event_tid] = \"gdb-event\";\n\t\treturn 0;\n\t}\n\telse{\n\t\t\/* error *\/\n\t\treturn -1;\n\t}\n}\n\nvoid gdbif::on_stop(int (*hdlr)(gdbif*)){\n\tstop_hdlr_t* e;\n\n\n\te = new stop_hdlr_t;\n\te->hdlr = hdlr;\n\n\tlist_add_tail(&stop_hdlr, e);\n}\n\n\/**\n * \\brief\tcreate gdb machine interface (MI) command\n *\n * \\param\tcmd\t\ttarget command\n * \\param\tfmt\t\tprintf-like format string, describing the following parameters\n * \t\t\t\t\tsupported identifiers:\n * \t\t\t\t\t\t'%d'\t\tinteger\n * \t\t\t\t\t\t'%s'\t\tstring\n * \t\t\t\t\t\t'%ss %d'\tarray of strings, length is defined by the\n * \t\t\t\t\t\t\t\t\tfollowing integer\n * \t\t\t\t\t\t'--'\t\tseparator between options and parameters\n * \t\t\t\t\t\t.\t\t\teverything else except blanks is printed literaly\n *\n * \\param\t...\t\tparameters according to param_fmt\n *\n * \\return\t>0\t\ttoken used for the command\n * \t\t\t-1\t\terror\n *\/\nint gdbif::mi_issue_cmd(char* cmd, gdb_result_class_t ok_mask, int(*process)(gdb_result_t*, void**), void** r, const char* fmt, ...){\n\tstatic char* volatile s = 0;\n\tstatic unsigned int volatile s_len = 0;\n\tunsigned int i, j, argc;\n\tchar** argv;\n\tva_list lst;\n\n\n\tva_start(lst, fmt);\n\n\tgdb->write(itoa(token, (char**)&s, (unsigned int*)&s_len));\n\tgdb->write((char*)\"-\");\n\tgdb->write(cmd);\n\n\tif(*fmt != 0)\n\t\tgdb->write((char*)\" \");\n\n\tfor(i=0; i<strlen(fmt); i++){\n\t\tswitch(fmt[i]){\n\t\tcase '%':\n\t\t\tswitch(fmt[i + 1]){\n\t\t\tcase 'd':\n\t\t\t\tgdb->write(itoa(va_arg(lst, int), (char**)&s, (unsigned int*)&s_len));\n\t\t\t\ti++;\n\t\t\t\tbreak;\n\n\t\t\tcase 's':\n\t\t\t\tif(strncmp(fmt + i + 2, \"s %d\", 4) == 0){\n\t\t\t\t\targv = va_arg(lst, char**);\n\t\t\t\t\targc = va_arg(lst, int);\n\n\t\t\t\t\tfor(j=0; j<argc; j++)\n\t\t\t\t\t\tgdb->write(argv[j]);\n\n\t\t\t\t\ti += 4;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tgdb->write(va_arg(lst, char*));\n\n\t\t\t\ti++;\n\t\t\t\tbreak;\n\n\t\t\tdefault:\n\t\t\t\tERROR(\"invalid format sequence %%%c\\n\", fmt[i + 1]);\n\t\t\t\tva_end(lst);\n\t\t\t\treturn -1;\n\t\t\t};\n\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tgdb->write((void*)(fmt + i), 1);\n\t\t\tbreak;\n\t\t};\n\t}\n\n\t\/* wait for gdb response *\/\n\tpthread_mutex_lock(&resp_mtx);\n\n\tmemset((void*)&resp, 0x0, sizeof(response_t));\n\n\tgdb->write((char*)\"\\n\");\t\/\/ ensure that response cannot arrive\n\t\t\t\t\t\t\t\t\/\/ before it is expected\n\n\tpthread_cond_wait(&resp_avail, &resp_mtx);\n\n\ttoken++;\n\n\tif((resp.rclass & ok_mask)){\n\t\tif(resp.result && r && process){\n\t\t\tif(process(resp.result, r) != 0){\n\t\t\t\tERROR(\"unable to process result for \\\"%s\\\"\\n\", cmd);\n\t\t\t\tresp.rclass = RC_ERROR;\n\t\t\t}\n\t\t}\n\t}\n\telse\n\t\tUSER(\"gdb-error %s: \\\"%s\\\"\\n\", cmd, resp.result->value->value);\n\n\tgdb_result_free(resp.result);\n\n\tpthread_mutex_unlock(&resp_mtx);\n\n\tva_end(lst);\n\n\tif(resp.rclass & ok_mask)\n\t\treturn 0;\n\treturn -1;\n}\n\nint gdbif::mi_proc_result(gdb_result_class_t rclass, unsigned int token, gdb_result_t* result){\n\tpthread_mutex_lock(&resp_mtx);\n\n\tif(this->token != token)\n\t\tERROR(\"result token (%d) doesn't match issued token (%d)\\n\", token, this->token);\n\n\tresp.result = result;\n\tresp.rclass = rclass;\n\n\tpthread_cond_signal(&resp_avail);\n\tpthread_mutex_unlock(&resp_mtx);\n\n\treturn 0;\n}\n\nint gdbif::mi_proc_async(gdb_result_class_t rclass, unsigned int token, gdb_result_t* result){\n\tint r;\n\tresponse_t* e;\n\n\n\tpthread_mutex_lock(&event_mtx);\n\n\tswitch(rclass){\n\tcase RC_STOPPED:\n\tcase RC_RUNNING:\n\t\te = new response_t;\n\n\t\te->rclass = rclass;\n\t\te->result = result;\n\t\tlist_add_tail(&event_lst, e);\n\n\t\tpthread_cond_signal(&event_avail);\n\t\tbreak;\n\n\tdefault:\n\t\tGDB(\"unhandled gdb-event %d\\n\", rclass);\n\t\tgdb_result_free(result);\n\t};\n\n\tpthread_mutex_unlock(&event_mtx);\n\n\treturn 0;\n}\n\nint gdbif::mi_proc_stream(gdb_stream_class_t sclass, char* stream){\n\tUSER(\"%s\", strdeescape(stream));\t\/\/ use \"%s\" to avoid issues with '%' within stream\n\treturn 0;\n}\n\n\/**\n * \\brief\tread from gdb terminal\n *\n * \\param\tbuf\t\ttarget buffer\n * \\param\tnbytes\tmax bytes to read\n *\n * \\return\tnumber of read bytes on success\n * \t\t\t-1 on error\n *\/\nint gdbif::read(void* buf, unsigned int nbytes){\n\treturn gdb->read(buf, nbytes);\n}\n\n\/**\n * \\brief\twrite to gdb terminal\n *\n * \\param\tbuf\t\tsource buffer\n * \\param\tnbytes\tnumber of bytes to write\n *\n * \\return\tnumber of written bytes on success\n * \t\t\t-1 on error\n *\/\nint gdbif::write(void* buf, unsigned int nbytes){\n\treturn gdb->write(buf, nbytes);\n}\n\nint gdbif::sigsend(int sig){\n\tsigval v;\n\n\treturn sigqueue(gdb_pid, sig, v);\n}\n\nbool gdbif::running(){\n\treturn is_running;\n}\n\nbool gdbif::running(bool state){\n\treturn (is_running = state);\n}\n\nvoid* gdbif::readline_thread(void* arg){\n\tchar c, *line;\n\tunsigned int i, len;\n\tgdbif* gdb;\n\tsigval v;\n\n\n\ti = 0;\n\tgdb = (gdbif*)arg;\n\n\tlen = 255;\n\tline = (char*)malloc(len * sizeof(char));\n\n\tif(line == 0)\n\t\tgoto err_0;\n\n#ifdef GUI_CURSES\n\tif(ui->win_create(\"gdb-log\", true, 0) < 0)\n\t\tgoto err_1;\n#endif \/\/ GUI_CURSES\n\n\twhile(1){\n\t\tif(gdb->read(&c, 1) == 1){\n\t\t\t\/\/ ignore CR to avoid issues when printing the string\n\t\t\tif(c == '\\r')\n\t\t\t\tcontinue;\n\n\t\t\tline[i++] = c;\n\n\t\t\tif(i >= len){\n\t\t\t\tlen *= 2;\n\t\t\t\tline = (char*)realloc(line, len);\n\n\t\t\t\tif(line == 0)\n\t\t\t\t\tgoto err_2;\n\t\t\t}\n\n\t\t\t\/\/ check for end of gdb line, a simple newline as separator\n\t\t\t\/\/ doesn't work, since the parse would try to parse the line,\n\t\t\t\/\/ detecting a syntax error\n\t\t\tif(strncmp(line + i - 6, \"(gdb)\\n\", 6) == 0 ||\n\t\t\t   strncmp(line + i - 7, \"(gdb) \\n\", 7) == 0\n\t\t\t  ){\n\t\t\t\tline[i] = 0;\n\n\t\t\t\tGDB(\"parse gdb string \\\"%.10s\\\"\\n\", line);\n\t\t\t\tui->win_print(ui->win_getid(\"gdb-log\"), \"%s\", line);\t\t\/\/ use \"%s\" to avoid issues with '%' within line\n\n\t\t\t\ti = gdbparse(line, gdb);\n\n\t\t\t\tGDB(\"parser return value: %d\\n\", i);\n\t\t\t\tui->win_print(ui->win_getid(\"gdb-log\"), \"parser return value: %d\\n\", i);\n\n\t\t\t\ti = 0;\n\t\t\t}\n\t\t}\n\t\telse{\n\t\t\tDEBUG(\"gdb read shutdown\\n\");\n\t\t\tbreak;\n\t\t}\n\t}\n\nerr_2:\n\tui->win_destroy(ui->win_getid(\"gdb-log\"));\n\nerr_1:\n\tfree(line);\n\nerr_0:\n\tpthread_sigqueue(gdb->main_tid, SIGTERM, v);\n\tpthread_exit(0);\n}\n\nvoid* gdbif::event_thread(void* arg){\n\tint r;\n\tgdbif* gdb;\n\tresponse_t* e;\n\n\n\tgdb = (gdbif*)arg;\n\n\twhile(1){\n\t\tpthread_mutex_lock(&gdb->event_mtx);\n\n\t\tif(list_empty(gdb->event_lst))\n\t\t\tpthread_cond_wait(&gdb->event_avail, &gdb->event_mtx);\n\n\t\te = list_first(gdb->event_lst);\n\t\tlist_rm(&gdb->event_lst, e);\n\n\t\tpthread_mutex_unlock(&gdb->event_mtx);\n\n\t\tswitch(e->rclass){\n\t\tcase RC_STOPPED:\n\t\t\tGDB(\"handle event STOPPED\\n\");\n\t\t\tr = gdb->evt_stopped(e->result);\n\t\t\tbreak;\n\n\t\tcase RC_RUNNING:\n\t\t\tGDB(\"handle event RUNNING\\n\");\n\t\t\tr = gdb->evt_running(e->result);\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tr = -1;\n\t\t};\n\n\t\tif(r != 0)\n\t\t\tERROR(\"error handling gdb-event %d\\n\", e->rclass);\n\n\t\tgdb_result_free(e->result);\n\t\tdelete e;\n\t}\n}\n\nint gdbif::evt_running(gdb_result_t* result){\n\trunning(true);\n\treturn 0;\n}\n\nint gdbif::evt_stopped(gdb_result_t* result){\n\tchar* reason;\n\tgdb_result_t* r;\n\tgdb_frame_t* frame;\n\tstop_hdlr_t* e;\n\n\n\treason = 0;\n\tframe = 0;\n\n\trunning(false);\n\n\t\/* parse result *\/\n\tlist_for_each(result, r){\n\t\tswitch(r->var_id){\n\t\tcase IDV_REASON:\n\t\t\treason = (char*)r->value->value;\n\t\t\tbreak;\n\n\t\tcase IDV_FRAME:\n\t\t\tconv_frame((gdb_result_t*)r->value->value, &frame);\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tbreak;\n\t\t};\n\t}\n\n\tif(reason == 0)\n\t\tgoto err;\n\n\t\/* check reason *\/\n\tif(reason != 0 && frame != 0){\n\t\tif(FILE_EXISTS(frame->fullname)){\n\t\t\tui->win_anno_add(ui->win_create(frame->fullname), frame->line, \"ip\", \"White\", \"Black\");\n\t\t\tui->win_cursor_set(ui->win_create(frame->fullname), frame->line);\n\t\t}\n\t\telse\n\t\t\tUSER(\"file \\\"%s\\\" does not exist\\n\", frame->fullname);\n\t}\n\telse if(strcmp(reason, \"exited-normally\") == 0){\n\t\tUSER(\"program exited\\n\");\n\t}\n\n\t\/* execute callbacks *\/\n\tlist_for_each(stop_hdlr, e){\n\t\tif(e->hdlr(this) != 0)\n\t\t\tUSER(\"error executing on-stop handler\\n\");\n\t}\n\n\tdelete frame;\n\treturn 0;\n\nerr:\n\tdelete frame;\n\treturn -1;\n}\n<commit_msg>[gdb: mi_issue_cmd() format string]<commit_after>#include <common\/log.h>\n#include <common\/pty.h>\n#include <common\/string.h>\n#include <common\/file.h>\n#include <common\/list.h>\n#include <gui\/gui.h>\n#include <gdb\/gdb.h>\n#include <gdb\/frame.h>\n#include <gdb\/parser.tab.h>\n#include <user_cmd\/cmd.hash.h>\n#include <user_cmd\/subcmd.hash.h>\n#include <stdlib.h>\n#include <string.h>\n#include <signal.h>\n#include <math.h>\n#include <unistd.h>\n\n\n\/* class definition *\/\n\/**\n * \\brief\tstandard constructor\n *\/\ngdbif::gdbif(){\n\tmain_tid = 0;\n\tread_tid = 0;\n\tgdb = 0;\n\ttoken = 1;\n\tis_running = false;\n\tevent_lst = 0;\n\tstop_hdlr = 0;\n\n\tpthread_mutex_init(&resp_mtx, 0);\n\tpthread_mutex_init(&event_mtx, 0);\n\tpthread_cond_init(&resp_avail, 0);\n\tpthread_cond_init(&event_avail, 0);\n}\n\n\/**\n * \\brief\tstandard desctructor\n *\/\ngdbif::~gdbif(){\n\t\/\/ close gdb terminal\n\tdelete this->gdb;\n\n\tif(read_tid != 0)\n\t\tpthread_join(read_tid, 0);\n\n\tif(event_tid != 0){\n\t\tpthread_cancel(event_tid);\n\t\tpthread_join(event_tid, 0);\n\t}\n\n\tpthread_cond_destroy(&resp_avail);\n\tpthread_cond_destroy(&event_avail);\n\tpthread_mutex_destroy(&resp_mtx);\n\tpthread_mutex_destroy(&event_mtx);\n}\n\n\/**\n * \\brief\texec gdb and initialise its controlling terminal\n *\n * \\return\t0\ton success\n * \t\t\t-1\ton error (check errno)\n *\/\nint gdbif::init(pthread_t main_tid){\n\tthis->main_tid = main_tid;\n\n\t\/\/ initialise pseudo terminal\n\tthis->gdb = new pty();\n\n\t\/\/ fork child process\n\tgdb_pid = gdb->fork();\n\n\tif(gdb_pid == 0){\n\t\t\/* child *\/\n\t\tlog::cleanup();\n\n\t\treturn execl(GDB_CMD, GDB_CMD, GDB_ARGS, (char*)0);\n\t}\n\telse if(gdb_pid > 0){\n\t\t\/* parent *\/\n\t\tif(pthread_create(&read_tid, 0, readline_thread, this) != 0)\n\t\t\treturn -1;\n\n\t\tthread_name[read_tid] = \"gdb-readline\";\n\n\t\tif(pthread_create(&event_tid, 0, event_thread, this) != 0)\n\t\t\treturn -1;\n\n\t\tthread_name[event_tid] = \"gdb-event\";\n\t\treturn 0;\n\t}\n\telse{\n\t\t\/* error *\/\n\t\treturn -1;\n\t}\n}\n\nvoid gdbif::on_stop(int (*hdlr)(gdbif*)){\n\tstop_hdlr_t* e;\n\n\n\te = new stop_hdlr_t;\n\te->hdlr = hdlr;\n\n\tlist_add_tail(&stop_hdlr, e);\n}\n\n\/**\n * \\brief\tcreate gdb machine interface (MI) command\n *\n * \\param\tcmd\t\ttarget command\n * \\param\tfmt\t\tprintf-like format string, describing the following parameters\n * \t\t\t\t\tsupported identifiers:\n * \t\t\t\t\t\t'%d'\t\tinteger\n * \t\t\t\t\t\t'%s'\t\tstring\n * \t\t\t\t\t\t'%ss %d'\tarray of strings, length is defined by the\n * \t\t\t\t\t\t\t\t\tfollowing integer\n * \t\t\t\t\t\t'--'\t\tseparator between options and parameters\n * \t\t\t\t\t\t.\t\t\teverything else except blanks is printed literaly\n *\n * \\param\t...\t\tparameters according to param_fmt\n *\n * \\return\t>0\t\ttoken used for the command\n * \t\t\t-1\t\terror\n *\/\nint gdbif::mi_issue_cmd(char* cmd, gdb_result_class_t ok_mask, int(*process)(gdb_result_t*, void**), void** r, const char* fmt, ...){\n\tstatic char* volatile s = 0;\n\tstatic unsigned int volatile s_len = 0;\n\tunsigned int i, j, argc;\n\tchar** argv;\n\tva_list lst;\n\n\n\tva_start(lst, fmt);\n\n\tgdb->write(itoa(token, (char**)&s, (unsigned int*)&s_len));\n\tgdb->write((char*)\"-\");\n\tgdb->write(cmd);\n\n\tif(*fmt != 0)\n\t\tgdb->write((char*)\" \");\n\n\tfor(i=0; i<strlen(fmt); i++){\n\t\tswitch(fmt[i]){\n\t\tcase '%':\n\t\t\tswitch(fmt[i + 1]){\n\t\t\tcase 'd':\n\t\t\t\tgdb->write(itoa((int)va_arg(lst, int), (char**)&s, (unsigned int*)&s_len));\n\t\t\t\ti++;\n\t\t\t\tbreak;\n\n\t\t\tcase 'u':\n\t\t\t\tgdb->write(itoa((unsigned int)va_arg(lst, unsigned int), (char**)&s, (unsigned int*)&s_len));\n\t\t\t\ti++;\n\t\t\t\tbreak;\n\n\t\t\tcase 's':\n\t\t\t\tif(strncmp(fmt + i + 2, \"s %d\", 4) == 0){\n\t\t\t\t\targv = va_arg(lst, char**);\n\t\t\t\t\targc = va_arg(lst, int);\n\n\t\t\t\t\tfor(j=0; j<argc; j++)\n\t\t\t\t\t\tgdb->write(argv[j]);\n\n\t\t\t\t\ti += 4;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tgdb->write(va_arg(lst, char*));\n\n\t\t\t\ti++;\n\t\t\t\tbreak;\n\n\t\t\tdefault:\n\t\t\t\tERROR(\"invalid format sequence %%%c\\n\", fmt[i + 1]);\n\t\t\t\tva_end(lst);\n\t\t\t\treturn -1;\n\t\t\t};\n\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tgdb->write((void*)(fmt + i), 1);\n\t\t\tbreak;\n\t\t};\n\t}\n\n\t\/* wait for gdb response *\/\n\tpthread_mutex_lock(&resp_mtx);\n\n\tmemset((void*)&resp, 0x0, sizeof(response_t));\n\n\tgdb->write((char*)\"\\n\");\t\/\/ ensure that response cannot arrive\n\t\t\t\t\t\t\t\t\/\/ before it is expected\n\n\tpthread_cond_wait(&resp_avail, &resp_mtx);\n\n\ttoken++;\n\n\tif((resp.rclass & ok_mask)){\n\t\tif(resp.result && r && process){\n\t\t\tif(process(resp.result, r) != 0){\n\t\t\t\tERROR(\"unable to process result for \\\"%s\\\"\\n\", cmd);\n\t\t\t\tresp.rclass = RC_ERROR;\n\t\t\t}\n\t\t}\n\t}\n\telse\n\t\tUSER(\"gdb-error %s: \\\"%s\\\"\\n\", cmd, resp.result->value->value);\n\n\tgdb_result_free(resp.result);\n\n\tpthread_mutex_unlock(&resp_mtx);\n\n\tva_end(lst);\n\n\tif(resp.rclass & ok_mask)\n\t\treturn 0;\n\treturn -1;\n}\n\nint gdbif::mi_proc_result(gdb_result_class_t rclass, unsigned int token, gdb_result_t* result){\n\tpthread_mutex_lock(&resp_mtx);\n\n\tif(this->token != token)\n\t\tERROR(\"result token (%d) doesn't match issued token (%d)\\n\", token, this->token);\n\n\tresp.result = result;\n\tresp.rclass = rclass;\n\n\tpthread_cond_signal(&resp_avail);\n\tpthread_mutex_unlock(&resp_mtx);\n\n\treturn 0;\n}\n\nint gdbif::mi_proc_async(gdb_result_class_t rclass, unsigned int token, gdb_result_t* result){\n\tint r;\n\tresponse_t* e;\n\n\n\tpthread_mutex_lock(&event_mtx);\n\n\tswitch(rclass){\n\tcase RC_STOPPED:\n\tcase RC_RUNNING:\n\t\te = new response_t;\n\n\t\te->rclass = rclass;\n\t\te->result = result;\n\t\tlist_add_tail(&event_lst, e);\n\n\t\tpthread_cond_signal(&event_avail);\n\t\tbreak;\n\n\tdefault:\n\t\tGDB(\"unhandled gdb-event %d\\n\", rclass);\n\t\tgdb_result_free(result);\n\t};\n\n\tpthread_mutex_unlock(&event_mtx);\n\n\treturn 0;\n}\n\nint gdbif::mi_proc_stream(gdb_stream_class_t sclass, char* stream){\n\tUSER(\"%s\", strdeescape(stream));\t\/\/ use \"%s\" to avoid issues with '%' within stream\n\treturn 0;\n}\n\n\/**\n * \\brief\tread from gdb terminal\n *\n * \\param\tbuf\t\ttarget buffer\n * \\param\tnbytes\tmax bytes to read\n *\n * \\return\tnumber of read bytes on success\n * \t\t\t-1 on error\n *\/\nint gdbif::read(void* buf, unsigned int nbytes){\n\treturn gdb->read(buf, nbytes);\n}\n\n\/**\n * \\brief\twrite to gdb terminal\n *\n * \\param\tbuf\t\tsource buffer\n * \\param\tnbytes\tnumber of bytes to write\n *\n * \\return\tnumber of written bytes on success\n * \t\t\t-1 on error\n *\/\nint gdbif::write(void* buf, unsigned int nbytes){\n\treturn gdb->write(buf, nbytes);\n}\n\nint gdbif::sigsend(int sig){\n\tsigval v;\n\n\treturn sigqueue(gdb_pid, sig, v);\n}\n\nbool gdbif::running(){\n\treturn is_running;\n}\n\nbool gdbif::running(bool state){\n\treturn (is_running = state);\n}\n\nvoid* gdbif::readline_thread(void* arg){\n\tchar c, *line;\n\tunsigned int i, len;\n\tgdbif* gdb;\n\tsigval v;\n\n\n\ti = 0;\n\tgdb = (gdbif*)arg;\n\n\tlen = 255;\n\tline = (char*)malloc(len * sizeof(char));\n\n\tif(line == 0)\n\t\tgoto err_0;\n\n#ifdef GUI_CURSES\n\tif(ui->win_create(\"gdb-log\", true, 0) < 0)\n\t\tgoto err_1;\n#endif \/\/ GUI_CURSES\n\n\twhile(1){\n\t\tif(gdb->read(&c, 1) == 1){\n\t\t\t\/\/ ignore CR to avoid issues when printing the string\n\t\t\tif(c == '\\r')\n\t\t\t\tcontinue;\n\n\t\t\tline[i++] = c;\n\n\t\t\tif(i >= len){\n\t\t\t\tlen *= 2;\n\t\t\t\tline = (char*)realloc(line, len);\n\n\t\t\t\tif(line == 0)\n\t\t\t\t\tgoto err_2;\n\t\t\t}\n\n\t\t\t\/\/ check for end of gdb line, a simple newline as separator\n\t\t\t\/\/ doesn't work, since the parse would try to parse the line,\n\t\t\t\/\/ detecting a syntax error\n\t\t\tif(strncmp(line + i - 6, \"(gdb)\\n\", 6) == 0 ||\n\t\t\t   strncmp(line + i - 7, \"(gdb) \\n\", 7) == 0\n\t\t\t  ){\n\t\t\t\tline[i] = 0;\n\n\t\t\t\tGDB(\"parse gdb string \\\"%.10s\\\"\\n\", line);\n\t\t\t\tui->win_print(ui->win_getid(\"gdb-log\"), \"%s\", line);\t\t\/\/ use \"%s\" to avoid issues with '%' within line\n\n\t\t\t\ti = gdbparse(line, gdb);\n\n\t\t\t\tGDB(\"parser return value: %d\\n\", i);\n\t\t\t\tui->win_print(ui->win_getid(\"gdb-log\"), \"parser return value: %d\\n\", i);\n\n\t\t\t\ti = 0;\n\t\t\t}\n\t\t}\n\t\telse{\n\t\t\tDEBUG(\"gdb read shutdown\\n\");\n\t\t\tbreak;\n\t\t}\n\t}\n\nerr_2:\n\tui->win_destroy(ui->win_getid(\"gdb-log\"));\n\nerr_1:\n\tfree(line);\n\nerr_0:\n\tpthread_sigqueue(gdb->main_tid, SIGTERM, v);\n\tpthread_exit(0);\n}\n\nvoid* gdbif::event_thread(void* arg){\n\tint r;\n\tgdbif* gdb;\n\tresponse_t* e;\n\n\n\tgdb = (gdbif*)arg;\n\n\twhile(1){\n\t\tpthread_mutex_lock(&gdb->event_mtx);\n\n\t\tif(list_empty(gdb->event_lst))\n\t\t\tpthread_cond_wait(&gdb->event_avail, &gdb->event_mtx);\n\n\t\te = list_first(gdb->event_lst);\n\t\tlist_rm(&gdb->event_lst, e);\n\n\t\tpthread_mutex_unlock(&gdb->event_mtx);\n\n\t\tswitch(e->rclass){\n\t\tcase RC_STOPPED:\n\t\t\tGDB(\"handle event STOPPED\\n\");\n\t\t\tr = gdb->evt_stopped(e->result);\n\t\t\tbreak;\n\n\t\tcase RC_RUNNING:\n\t\t\tGDB(\"handle event RUNNING\\n\");\n\t\t\tr = gdb->evt_running(e->result);\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tr = -1;\n\t\t};\n\n\t\tif(r != 0)\n\t\t\tERROR(\"error handling gdb-event %d\\n\", e->rclass);\n\n\t\tgdb_result_free(e->result);\n\t\tdelete e;\n\t}\n}\n\nint gdbif::evt_running(gdb_result_t* result){\n\trunning(true);\n\treturn 0;\n}\n\nint gdbif::evt_stopped(gdb_result_t* result){\n\tchar* reason;\n\tgdb_result_t* r;\n\tgdb_frame_t* frame;\n\tstop_hdlr_t* e;\n\n\n\treason = 0;\n\tframe = 0;\n\n\trunning(false);\n\n\t\/* parse result *\/\n\tlist_for_each(result, r){\n\t\tswitch(r->var_id){\n\t\tcase IDV_REASON:\n\t\t\treason = (char*)r->value->value;\n\t\t\tbreak;\n\n\t\tcase IDV_FRAME:\n\t\t\tconv_frame((gdb_result_t*)r->value->value, &frame);\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tbreak;\n\t\t};\n\t}\n\n\tif(reason == 0)\n\t\tgoto err;\n\n\t\/* check reason *\/\n\tif(reason != 0 && frame != 0){\n\t\tif(FILE_EXISTS(frame->fullname)){\n\t\t\tui->win_anno_add(ui->win_create(frame->fullname), frame->line, \"ip\", \"White\", \"Black\");\n\t\t\tui->win_cursor_set(ui->win_create(frame->fullname), frame->line);\n\t\t}\n\t\telse\n\t\t\tUSER(\"file \\\"%s\\\" does not exist\\n\", frame->fullname);\n\t}\n\telse if(strcmp(reason, \"exited-normally\") == 0){\n\t\tUSER(\"program exited\\n\");\n\t}\n\n\t\/* execute callbacks *\/\n\tlist_for_each(stop_hdlr, e){\n\t\tif(e->hdlr(this) != 0)\n\t\t\tUSER(\"error executing on-stop handler\\n\");\n\t}\n\n\tdelete frame;\n\treturn 0;\n\nerr:\n\tdelete frame;\n\treturn -1;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"FileSorts.h\"\n\nnamespace FileSorts\n{\n\tconst FileData::SortType typesArr[] = {\n\t\tFileData::SortType(&compareFileName, true, \"filename, ascending\"),\n\t\tFileData::SortType(&compareFileName, false, \"filename, descending\"),\n\n\t\tFileData::SortType(&compareRating, true, \"rating, ascending\"),\n\t\tFileData::SortType(&compareRating, false, \"rating, descending\"),\n\n\t\tFileData::SortType(&compareTimesPlayed, true, \"times played, ascending\"),\n\t\tFileData::SortType(&compareTimesPlayed, false, \"times played, descending\"),\n\n\t\tFileData::SortType(&compareLastPlayed, true, \"last played, ascending\"),\n\t\tFileData::SortType(&compareLastPlayed, false, \"last played, descending\")\n\t};\n\n\tconst std::vector<FileData::SortType> SortTypes(typesArr, typesArr + sizeof(typesArr)\/sizeof(typesArr[0]));\n\n\t\/\/returns if file1 should come before file2\n\tbool compareFileName(const FileData* file1, const FileData* file2)\n\t{\n\t\tstd::string name1 = file1->getName();\n\t\tstd::string name2 = file2->getName();\n\n\t\t\/\/min of name1\/name2 .length()s\n\t\tunsigned int count = name1.length() > name2.length() ? name2.length() : name1.length();\n\t\tfor(unsigned int i = 0; i < count; i++)\n\t\t{\n\t\t\tif(toupper(name1[i]) != toupper(name2[i]))\n\t\t\t{\n\t\t\t\treturn toupper(name1[i]) < toupper(name2[i]);\n\t\t\t}\n\t\t}\n\n\t\treturn name1.length() < name2.length();\n\t}\n\n\tbool compareRating(const FileData* file1, const FileData* file2)\n\t{\n\t\t\/\/only games have rating metadata\n\t\tif(file1->metadata.getType() == GAME_METADATA && file2->metadata.getType() == GAME_METADATA)\n\t\t{\n\t\t\treturn file1->metadata.getFloat(\"rating\") < file2->metadata.getFloat(\"rating\");\n\t\t}\n\n\t\treturn false;\n\t}\n\n\tbool compareTimesPlayed(const FileData* file1, const FileData* file2)\n\t{\n\t\t\/\/only games have playcount metadata\n\t\tif(file1->metadata.getType() == GAME_METADATA && file2->metadata.getType() == GAME_METADATA)\n\t\t{\n\t\t\treturn (file1)->metadata.getInt(\"playcount\") < (file2)->metadata.getInt(\"playcount\");\n\t\t}\n\n\t\treturn false;\n\t}\n\n\tbool compareLastPlayed(const FileData* file1, const FileData* file2)\n\t{\n\t\t\/\/only games have lastplayed metadata\n\t\tif(file1->metadata.getType() == GAME_METADATA && file2->metadata.getType() == GAME_METADATA)\n\t\t{\n\t\t\treturn (file1)->metadata.getTime(\"lastplayed\") < (file2)->metadata.getTime(\"lastplayed\");\n\t\t}\n\n\t\treturn false;\n\t}\n};\n<commit_msg>When sorting by rating or playcount, break ties with filename<commit_after>#include \"FileSorts.h\"\n\nnamespace FileSorts\n{\n\tconst FileData::SortType typesArr[] = {\n\t\tFileData::SortType(&compareFileName, true, \"filename, ascending\"),\n\t\tFileData::SortType(&compareFileName, false, \"filename, descending\"),\n\n\t\tFileData::SortType(&compareRating, true, \"rating, ascending\"),\n\t\tFileData::SortType(&compareRating, false, \"rating, descending\"),\n\n\t\tFileData::SortType(&compareTimesPlayed, true, \"times played, ascending\"),\n\t\tFileData::SortType(&compareTimesPlayed, false, \"times played, descending\"),\n\n\t\tFileData::SortType(&compareLastPlayed, true, \"last played, ascending\"),\n\t\tFileData::SortType(&compareLastPlayed, false, \"last played, descending\")\n\t};\n\n\tconst std::vector<FileData::SortType> SortTypes(typesArr, typesArr + sizeof(typesArr)\/sizeof(typesArr[0]));\n\n\t\/\/returns if file1 should come before file2\n\tbool compareFileName(const FileData* file1, const FileData* file2)\n\t{\n\t\tstd::string name1 = file1->getName();\n\t\tstd::string name2 = file2->getName();\n\n\t\t\/\/min of name1\/name2 .length()s\n\t\tunsigned int count = name1.length() > name2.length() ? name2.length() : name1.length();\n\t\tfor(unsigned int i = 0; i < count; i++)\n\t\t{\n\t\t\tif(toupper(name1[i]) != toupper(name2[i]))\n\t\t\t{\n\t\t\t\treturn toupper(name1[i]) < toupper(name2[i]);\n\t\t\t}\n\t\t}\n\n\t\treturn name1.length() < name2.length();\n\t}\n\n\tbool compareRating(const FileData* file1, const FileData* file2)\n\t{\n\t\t\/\/only games have rating metadata\n\t\tif(file1->metadata.getType() == GAME_METADATA && file2->metadata.getType() == GAME_METADATA)\n\t\t{\n\t\t\tfloat r1 = file1->metadata.getFloat(\"rating\"), r2 = file2->metadata.getFloat(\"rating\");\n\t\t\tif (r1 != r2)\n\t\t\t\treturn r1 < r2;\n\t\t}\n\n\t\treturn compareFileName(file1, file2);\n\t}\n\n\tbool compareTimesPlayed(const FileData* file1, const FileData* file2)\n\t{\n\t\t\/\/only games have playcount metadata\n\t\tif(file1->metadata.getType() == GAME_METADATA && file2->metadata.getType() == GAME_METADATA)\n\t\t{\n\t\t\tint pc1 = (file1)->metadata.getInt(\"playcount\"), pc2 = (file2)->metadata.getInt(\"playcount\");\n\t\t\tif(pc1 != pc2)\n\t\t\t\treturn pc1 < pc2;\n\t\t}\n\n\t\treturn compareFileName(file1, file2);\n\t}\n\n\tbool compareLastPlayed(const FileData* file1, const FileData* file2)\n\t{\n\t\t\/\/only games have lastplayed metadata\n\t\tif(file1->metadata.getType() == GAME_METADATA && file2->metadata.getType() == GAME_METADATA)\n\t\t{\n\t\t\treturn (file1)->metadata.getTime(\"lastplayed\") < (file2)->metadata.getTime(\"lastplayed\");\n\t\t}\n\n\t\treturn false;\n\t}\n};\n<|endoftext|>"}
{"text":"<commit_before>\/*\n   (c) Copyright 2012-2013  DirectFB integrated media GmbH\n   (c) Copyright 2001-2013  The world wide DirectFB Open Source Community (directfb.org)\n   (c) Copyright 2000-2004  Convergence (integrated media) GmbH\n\n   All rights reserved.\n\n   Written by Denis Oliver Kropp <dok@directfb.org>,\n              Andreas Hundt <andi@fischlustig.de>,\n              Sven Neumann <neo@directfb.org>,\n              Ville Syrjälä <syrjala@sci.fi> and\n              Claudio Ciccani <klan@users.sf.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\n   Free Software Foundation, Inc., 59 Temple Place - Suite 330,\n   Boston, MA 02111-1307, USA.\n*\/\n\n#include <config.h>\n\n#include <stdio.h>\n#include <string.h>\n\n\/\/#include <typeindex>\n\nextern \"C\" {\n#include <direct\/messages.h>\n}\n\n#include <direct\/ToString.h>\n\n#include <egl\/dfbegl.h>\n#include <egl\/image.h>\n\n#include <GLES2\/gl2.h>\n\n\nD_LOG_DOMAIN( DFBEGL_Image, \"DFBEGL\/Image\", \"DirectFB EGL Image\" );\nD_LOG_DOMAIN( DFBEGL_Api,   \"DFBEGL\/API\",   \"DirectFB EGL API\" );\n\n\n\n\nnamespace DirectFB {\n\n\nnamespace GL {\n\n\/*\nOES::eglImage::eglImage()\n     :\n     glEGLImage( NULL )\n{\n     D_LOG( DFBEGL_Api, DEBUG_1, \"OES::eglImage::%s( %p )\\n\", __FUNCTION__, this );\n}\n\nOES::eglImage::eglImage( EGL::KHR::Image &egl_image )\n     :\n     glEGLImage( NULL )\n{\n     D_LOG( DFBEGL_Api, DEBUG_1, \"OES::eglImage::%s( %p, egl_image %p )\\n\", __FUNCTION__, this, &egl_image );\n}\n*\/\n}\n\n\n\nnamespace EGL {\n\nusing namespace std::placeholders;\n\n\n\/**********************************************************************************************************************\/\n\nstatic EGLImage egl_image;\n\n\/**********************************************************************************************************************\/\n\nEGLImage::EGLImage()\n{\n     D_DEBUG_AT( DFBEGL_Image, \"EGLImage::%s( %p )\\n\", __FUNCTION__, this );\n\n     Display::Register< EGLExtension::GetNames >( \"EGLImage\", [](){ return \"EGL_DIRECTFB_idirectfbsurface EGL_KHR_image_base EGL_KHR_image_pixmap EGL_KHR_image\"; } );\n\n     Core::Register<\n          Core::GetProcAddress\n          >( \"eglCreateImageKHR\", [](const char *){ return (void*) eglCreateImageKHR; } );\n\n     Core::Register<\n          Core::GetProcAddress\n          >( \"eglDestroyImageKHR\", [](const char *){ return (void*) eglDestroyImageKHR; } );\n\n     Core::Register<\n          Core::GetProcAddress\n          >( \"glEGLImageTargetTexture2DOES\", [](const char *){ return (void*) glEGLImageTargetTexture2DOES; } );\n\n     Core::Register<\n          Core::GetProcAddress\n          >( \"glEGLImageTargetRenderBufferStorageOES\", [](const char *){ return (void*) glEGLImageTargetRenderBufferStorageOES; } );\n}\n\nEGLImage::~EGLImage()\n{\n     D_DEBUG_AT( DFBEGL_Image, \"EGLImage::%s( %p )\\n\", __FUNCTION__, this );\n}\n\n\/**********************************************************************************************************************\/\n\nEGLImageKHR\nEGLImage::eglCreateImageKHR( EGLDisplay       dpy,\n                             EGLContext       ctx,\n                             EGLenum          target,\n                             EGLClientBuffer  buffer,\n                             const EGLint    *attr_list )\n{\n     D_DEBUG_AT( DFBEGL_Api, \"%s( display %p, ctx %p, target 0x%04x '%s', buffer 0x%08lx, attribs %p )\\n\",\n                 __FUNCTION__, dpy, ctx, target, *ToString<EGLInt>( EGLInt(target) ), (long) buffer, attr_list );\n\n     EGL::TLS *tls = EGLTLS.Get();\n\n     if (!dpy)\n          DFB_EGL_RETURN (EGL_BAD_DISPLAY, EGL_NO_IMAGE_KHR);\n\n     if (!target || !buffer)\n          DFB_EGL_RETURN (EGL_BAD_PARAMETER, EGL_NO_IMAGE_KHR);\n\n\n     EGL::Display *display = (EGL::Display *) dpy;\n     EGL::Context *context = (EGL::Context *) ctx;\n     EGL::KHR::Image   *image;\n\n     DFBResult ret = KHR::Image::Create( display, context, target, buffer, attr_list, image );\n\n     if (ret)\n          DFB_EGL_RETURN (EGL_BAD_DISPLAY, EGL_NO_IMAGE_KHR);\n\n\/\/     D_LOG( DFBEGL_Api, VERBOSE, \"New DFBSurfaceID %u from EGLImage buffer %p (target %s)\\n\",\n\/\/            surface->GetID(), buffer, *ToString<EGL::EGLInt>( target ) );\n\n     DFB_EGL_RETURN (EGL_SUCCESS, (EGLImageKHR) new Types::TypeHandle( image ) );\n}\n\nEGLBoolean\nEGLImage::eglDestroyImageKHR( EGLDisplay  dpy,\n                              EGLImageKHR img )\n{\n     D_DEBUG_AT( DFBEGL_Api, \"%s( display %p, image %p )\\n\",\n                 __FUNCTION__, dpy, img );\n\n     EGL::TLS *tls = EGLTLS.Get();\n\n     if (!dpy)\n          DFB_EGL_RETURN (EGL_BAD_DISPLAY, EGL_FALSE);\n\n     if (!img)\n          DFB_EGL_RETURN (EGL_BAD_PARAMETER, EGL_FALSE);\n\n\n     Types::TypeHandle *handle = (Types::TypeHandle *) img;\n\n     KHR::Image *image = &(KHR::Image&) **handle;\n\n     delete image;\n\n     DFB_EGL_RETURN (EGL_SUCCESS, EGL_TRUE);\n}\n\n\nvoid\nEGLImage::glEGLImageTargetTexture2DOES( GLenum      target,\n                                        EGLImageKHR img )\n{\n     D_DEBUG_AT( DFBEGL_Api, \"%s( target 0x%04x '%s', image %p )\\n\", __FUNCTION__, target, *ToString<EGLInt>( EGLInt(target) ), img );\n\n     EGL::TLS     *tls = EGLTLS.Get();\n     EGL::Context *ctx = tls->GetContext();\n\n     if (!img)\n          DFB_EGL_RETURN (EGL_BAD_PARAMETER, );\n\n     if (!ctx)\n          DFB_EGL_RETURN (EGL_BAD_CONTEXT, );\n\n\n     Graphics::Context &context = *(ctx->gfx_context);\n\n     Types::TypeHandle *handle = (Types::TypeHandle *) img;\n\n     KHR::Image &image = (KHR::Image&) **handle;\n\n     auto call = context.Call<GL::OES::glEGLImageTargetTexture2D>();\n\n     if (call)\n          call( target, image );\n     else\n          D_ERROR( \"DFBEGL\/Image: No implementation for display '%s', context '%p'\\n\",\n                   *image.display->GetName(), image.context );\n}\n\nvoid\nEGLImage::glEGLImageTargetRenderBufferStorageOES( GLenum      target,\n                                                  EGLImageKHR img )\n{\n     D_DEBUG_AT( DFBEGL_Api, \"%s( target 0x%04x '%s', image %p )\\n\", __FUNCTION__, target, *ToString<EGLInt>( EGLInt(target) ), img );\n\n     EGL::TLS     *tls = EGLTLS.Get();\n     EGL::Context *ctx = tls->GetContext();\n\n     if (!img)\n          DFB_EGL_RETURN (EGL_BAD_PARAMETER, );\n\n     if (!ctx)\n          DFB_EGL_RETURN (EGL_BAD_CONTEXT, );\n\n\n     Graphics::Context &context = *(ctx->gfx_context);\n\n     Types::TypeHandle *handle = (Types::TypeHandle *) img;\n\n     \/\/KHR::Image &image = (KHR::Image&) **handle;\n     Direct::Base::TypeBase &image = (Direct::Base::TypeBase&) **handle;\n\n     context.Call<GL::OES::glEGLImageTargetRenderBufferStorage>()( target, image );\n}\n\n\/**********************************************************************************************************************\/\n\/**********************************************************************************************************************\/\n\nDFBResult\nKHR::Image::Create( Display          *display,\n                    Context          *context,\n                    EGLenum           target,\n                    EGLClientBuffer   buffer,\n                    const EGLint     *attrib_list,\n                    Image           *&ret_image )\n{\n     DFBResult ret;\n\n     D_DEBUG_AT( DFBEGL_Image, \"KHR::Image::%s( display %p, context %p, target 0x%04x '%s', buffer 0x%08lx, attribs %p )\\n\",\n                 __FUNCTION__, display, context, target, *ToString<EGLInt>( EGLInt(target) ), (long) buffer, attrib_list );\n\n     if (attrib_list)\n          DFB_EGL_ATTRIB_LIST_DEBUG_AT( DFBEGL_Image, attrib_list );\n\n\n     ToString<EGLInt> target_str( target );\n     EGLInt           target_val;\n\n     D_DEBUG_AT( DFBEGL_Image, \"  -> target '%s'\\n\", *target_str );\n\n     \/\/ Key 1) context | target\n     \/\/ Key 2) display | target\n     \/\/ Key 3) target\n\n     if (FromString<EGLInt>( target_val, target_str )) {\n          if (target_val.value == (EGLint) target) {\n\n          }\n          else\n               D_WARN( \"conversion from\/to 0x%04x\/0x%04x (%s)\", target, target_val.value, *target_str );\n     }\n\n\n     Image *image = new Image();\n\n     image->display = display;\n\n     image->context = context;\n     image->target  = target;\n     image->buffer  = buffer;\n\n     if (attrib_list) {\n          ret = EGL::Util::GetOptions( image->gfx_options, attrib_list );\n          if (ret)\n               D_DERROR( ret, \"DFBEGL\/Image: Failed to get Options from attrib_list!\\n\" );\n     }\n\n     if (target == EGL_NATIVE_PIXMAP_KHR && display->native_pixmap_target) {\n          D_DEBUG_AT( DFBEGL_Image, \"  -> NATIVE_PIXMAP_KHR = 0x%04x (%s)\\n\",\n                      display->native_pixmap_target, *ToString<EGLInt>( EGLInt(display->native_pixmap_target) ) );\n\n          target = display->native_pixmap_target;\n     }\n\n\n     KHR::Image::Initialise init;\n\n     if (context) {\n          init = KHR::Image::Call<KHR::Image::Initialise>( context->GetName() \/ *ToString<EGLInt>( EGLInt(target) ) );\n     }\n\n     if (!init) {\n          init = KHR::Image::Call<KHR::Image::Initialise>( display->GetName() \/ *ToString<EGLInt>( EGLInt(target) ) );\n     }\n\n     if (!init) {\n          init = KHR::Image::Call<KHR::Image::Initialise>( ToString<EGLInt>( EGLInt(target) ) );\n     }\n\n\n     if (!init) {\n          D_ERROR( \"DFBEGL\/Image: No implementation for target 0x%04x '%s', display '%s', context '%s'\\n\",\n                   target, *target_str, *display->GetName(), *context->GetName() );\n          return DFB_NOIMPL;\n     }\n\n     D_INFO( \"DFBEGL\/Image: Using implementation '%s'\\n\", *ToString<std::type_info>( init.target_type() ) );\n\n     ret = init( *image );\n     if (ret) {\n          delete image;\n          return ret;\n     }\n\n     ret_image = image;\n\n     return DFB_OK;\n}\n\n\/**********************************************************************************************************************\/\n\nKHR::Image::Image()\n     :\n     display( NULL ),\n     context( NULL ),\n     target( 0 ),\n     buffer( NULL ),\n     dfb_surface( NULL ),\n     dfb_buffer( NULL )\n{\n     D_DEBUG_AT( DFBEGL_Image, \"KHR::Image::%s( %p )\\n\", __FUNCTION__, this );\n}\n\nKHR::Image::~Image()\n{\n     D_DEBUG_AT( DFBEGL_Image, \"KHR::Image::%s( %p )\\n\", __FUNCTION__, this );\n\n     if (dfb_surface)\n          dfb_surface->Release( dfb_surface );\n}\n\n\n\n}\n\n}\n\n<commit_msg>EGL: Release buffer interface in EGLImage<commit_after>\/*\n   (c) Copyright 2012-2013  DirectFB integrated media GmbH\n   (c) Copyright 2001-2013  The world wide DirectFB Open Source Community (directfb.org)\n   (c) Copyright 2000-2004  Convergence (integrated media) GmbH\n\n   All rights reserved.\n\n   Written by Denis Oliver Kropp <dok@directfb.org>,\n              Andreas Hundt <andi@fischlustig.de>,\n              Sven Neumann <neo@directfb.org>,\n              Ville Syrjälä <syrjala@sci.fi> and\n              Claudio Ciccani <klan@users.sf.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\n   Free Software Foundation, Inc., 59 Temple Place - Suite 330,\n   Boston, MA 02111-1307, USA.\n*\/\n\n#include <config.h>\n\n#include <stdio.h>\n#include <string.h>\n\n\/\/#include <typeindex>\n\nextern \"C\" {\n#include <direct\/messages.h>\n}\n\n#include <direct\/ToString.h>\n\n#include <egl\/dfbegl.h>\n#include <egl\/image.h>\n\n#include <GLES2\/gl2.h>\n\n\nD_LOG_DOMAIN( DFBEGL_Image, \"DFBEGL\/Image\", \"DirectFB EGL Image\" );\nD_LOG_DOMAIN( DFBEGL_Api,   \"DFBEGL\/API\",   \"DirectFB EGL API\" );\n\n\n\n\nnamespace DirectFB {\n\n\nnamespace GL {\n\n\/*\nOES::eglImage::eglImage()\n     :\n     glEGLImage( NULL )\n{\n     D_LOG( DFBEGL_Api, DEBUG_1, \"OES::eglImage::%s( %p )\\n\", __FUNCTION__, this );\n}\n\nOES::eglImage::eglImage( EGL::KHR::Image &egl_image )\n     :\n     glEGLImage( NULL )\n{\n     D_LOG( DFBEGL_Api, DEBUG_1, \"OES::eglImage::%s( %p, egl_image %p )\\n\", __FUNCTION__, this, &egl_image );\n}\n*\/\n}\n\n\n\nnamespace EGL {\n\nusing namespace std::placeholders;\n\n\n\/**********************************************************************************************************************\/\n\nstatic EGLImage egl_image;\n\n\/**********************************************************************************************************************\/\n\nEGLImage::EGLImage()\n{\n     D_DEBUG_AT( DFBEGL_Image, \"EGLImage::%s( %p )\\n\", __FUNCTION__, this );\n\n     Display::Register< EGLExtension::GetNames >( \"EGLImage\", [](){ return \"EGL_DIRECTFB_idirectfbsurface EGL_KHR_image_base EGL_KHR_image_pixmap EGL_KHR_image\"; } );\n\n     Core::Register<\n          Core::GetProcAddress\n          >( \"eglCreateImageKHR\", [](const char *){ return (void*) eglCreateImageKHR; } );\n\n     Core::Register<\n          Core::GetProcAddress\n          >( \"eglDestroyImageKHR\", [](const char *){ return (void*) eglDestroyImageKHR; } );\n\n     Core::Register<\n          Core::GetProcAddress\n          >( \"glEGLImageTargetTexture2DOES\", [](const char *){ return (void*) glEGLImageTargetTexture2DOES; } );\n\n     Core::Register<\n          Core::GetProcAddress\n          >( \"glEGLImageTargetRenderBufferStorageOES\", [](const char *){ return (void*) glEGLImageTargetRenderBufferStorageOES; } );\n}\n\nEGLImage::~EGLImage()\n{\n     D_DEBUG_AT( DFBEGL_Image, \"EGLImage::%s( %p )\\n\", __FUNCTION__, this );\n}\n\n\/**********************************************************************************************************************\/\n\nEGLImageKHR\nEGLImage::eglCreateImageKHR( EGLDisplay       dpy,\n                             EGLContext       ctx,\n                             EGLenum          target,\n                             EGLClientBuffer  buffer,\n                             const EGLint    *attr_list )\n{\n     D_DEBUG_AT( DFBEGL_Api, \"%s( display %p, ctx %p, target 0x%04x '%s', buffer 0x%08lx, attribs %p )\\n\",\n                 __FUNCTION__, dpy, ctx, target, *ToString<EGLInt>( EGLInt(target) ), (long) buffer, attr_list );\n\n     EGL::TLS *tls = EGLTLS.Get();\n\n     if (!dpy)\n          DFB_EGL_RETURN (EGL_BAD_DISPLAY, EGL_NO_IMAGE_KHR);\n\n     if (!target || !buffer)\n          DFB_EGL_RETURN (EGL_BAD_PARAMETER, EGL_NO_IMAGE_KHR);\n\n\n     EGL::Display *display = (EGL::Display *) dpy;\n     EGL::Context *context = (EGL::Context *) ctx;\n     EGL::KHR::Image   *image;\n\n     DFBResult ret = KHR::Image::Create( display, context, target, buffer, attr_list, image );\n\n     if (ret)\n          DFB_EGL_RETURN (EGL_BAD_DISPLAY, EGL_NO_IMAGE_KHR);\n\n\/\/     D_LOG( DFBEGL_Api, VERBOSE, \"New DFBSurfaceID %u from EGLImage buffer %p (target %s)\\n\",\n\/\/            surface->GetID(), buffer, *ToString<EGL::EGLInt>( target ) );\n\n     DFB_EGL_RETURN (EGL_SUCCESS, (EGLImageKHR) new Types::TypeHandle( image ) );\n}\n\nEGLBoolean\nEGLImage::eglDestroyImageKHR( EGLDisplay  dpy,\n                              EGLImageKHR img )\n{\n     D_DEBUG_AT( DFBEGL_Api, \"%s( display %p, image %p )\\n\",\n                 __FUNCTION__, dpy, img );\n\n     EGL::TLS *tls = EGLTLS.Get();\n\n     if (!dpy)\n          DFB_EGL_RETURN (EGL_BAD_DISPLAY, EGL_FALSE);\n\n     if (!img)\n          DFB_EGL_RETURN (EGL_BAD_PARAMETER, EGL_FALSE);\n\n\n     Types::TypeHandle *handle = (Types::TypeHandle *) img;\n\n     KHR::Image *image = &(KHR::Image&) **handle;\n\n     delete image;\n\n     DFB_EGL_RETURN (EGL_SUCCESS, EGL_TRUE);\n}\n\n\nvoid\nEGLImage::glEGLImageTargetTexture2DOES( GLenum      target,\n                                        EGLImageKHR img )\n{\n     D_DEBUG_AT( DFBEGL_Api, \"%s( target 0x%04x '%s', image %p )\\n\", __FUNCTION__, target, *ToString<EGLInt>( EGLInt(target) ), img );\n\n     EGL::TLS     *tls = EGLTLS.Get();\n     EGL::Context *ctx = tls->GetContext();\n\n     if (!img)\n          DFB_EGL_RETURN (EGL_BAD_PARAMETER, );\n\n     if (!ctx)\n          DFB_EGL_RETURN (EGL_BAD_CONTEXT, );\n\n\n     Graphics::Context &context = *(ctx->gfx_context);\n\n     Types::TypeHandle *handle = (Types::TypeHandle *) img;\n\n     KHR::Image &image = (KHR::Image&) **handle;\n\n     auto call = context.Call<GL::OES::glEGLImageTargetTexture2D>();\n\n     if (call)\n          call( target, image );\n     else\n          D_ERROR( \"DFBEGL\/Image: No implementation for display '%s', context '%p'\\n\",\n                   *image.display->GetName(), image.context );\n}\n\nvoid\nEGLImage::glEGLImageTargetRenderBufferStorageOES( GLenum      target,\n                                                  EGLImageKHR img )\n{\n     D_DEBUG_AT( DFBEGL_Api, \"%s( target 0x%04x '%s', image %p )\\n\", __FUNCTION__, target, *ToString<EGLInt>( EGLInt(target) ), img );\n\n     EGL::TLS     *tls = EGLTLS.Get();\n     EGL::Context *ctx = tls->GetContext();\n\n     if (!img)\n          DFB_EGL_RETURN (EGL_BAD_PARAMETER, );\n\n     if (!ctx)\n          DFB_EGL_RETURN (EGL_BAD_CONTEXT, );\n\n\n     Graphics::Context &context = *(ctx->gfx_context);\n\n     Types::TypeHandle *handle = (Types::TypeHandle *) img;\n\n     \/\/KHR::Image &image = (KHR::Image&) **handle;\n     Direct::Base::TypeBase &image = (Direct::Base::TypeBase&) **handle;\n\n     context.Call<GL::OES::glEGLImageTargetRenderBufferStorage>()( target, image );\n}\n\n\/**********************************************************************************************************************\/\n\/**********************************************************************************************************************\/\n\nDFBResult\nKHR::Image::Create( Display          *display,\n                    Context          *context,\n                    EGLenum           target,\n                    EGLClientBuffer   buffer,\n                    const EGLint     *attrib_list,\n                    Image           *&ret_image )\n{\n     DFBResult ret;\n\n     D_DEBUG_AT( DFBEGL_Image, \"KHR::Image::%s( display %p, context %p, target 0x%04x '%s', buffer 0x%08lx, attribs %p )\\n\",\n                 __FUNCTION__, display, context, target, *ToString<EGLInt>( EGLInt(target) ), (long) buffer, attrib_list );\n\n     if (attrib_list)\n          DFB_EGL_ATTRIB_LIST_DEBUG_AT( DFBEGL_Image, attrib_list );\n\n\n     ToString<EGLInt> target_str( target );\n     EGLInt           target_val;\n\n     D_DEBUG_AT( DFBEGL_Image, \"  -> target '%s'\\n\", *target_str );\n\n     \/\/ Key 1) context | target\n     \/\/ Key 2) display | target\n     \/\/ Key 3) target\n\n     if (FromString<EGLInt>( target_val, target_str )) {\n          if (target_val.value == (EGLint) target) {\n\n          }\n          else\n               D_WARN( \"conversion from\/to 0x%04x\/0x%04x (%s)\", target, target_val.value, *target_str );\n     }\n\n\n     Image *image = new Image();\n\n     image->display = display;\n\n     image->context = context;\n     image->target  = target;\n     image->buffer  = buffer;\n\n     if (attrib_list) {\n          ret = EGL::Util::GetOptions( image->gfx_options, attrib_list );\n          if (ret)\n               D_DERROR( ret, \"DFBEGL\/Image: Failed to get Options from attrib_list!\\n\" );\n     }\n\n     if (target == EGL_NATIVE_PIXMAP_KHR && display->native_pixmap_target) {\n          D_DEBUG_AT( DFBEGL_Image, \"  -> NATIVE_PIXMAP_KHR = 0x%04x (%s)\\n\",\n                      display->native_pixmap_target, *ToString<EGLInt>( EGLInt(display->native_pixmap_target) ) );\n\n          target = display->native_pixmap_target;\n     }\n\n\n     KHR::Image::Initialise init;\n\n     if (context) {\n          init = KHR::Image::Call<KHR::Image::Initialise>( context->GetName() \/ *ToString<EGLInt>( EGLInt(target) ) );\n     }\n\n     if (!init) {\n          init = KHR::Image::Call<KHR::Image::Initialise>( display->GetName() \/ *ToString<EGLInt>( EGLInt(target) ) );\n     }\n\n     if (!init) {\n          init = KHR::Image::Call<KHR::Image::Initialise>( ToString<EGLInt>( EGLInt(target) ) );\n     }\n\n\n     if (!init) {\n          D_ERROR( \"DFBEGL\/Image: No implementation for target 0x%04x '%s', display '%s', context '%s'\\n\",\n                   target, *target_str, *display->GetName(), *context->GetName() );\n          return DFB_NOIMPL;\n     }\n\n     D_INFO( \"DFBEGL\/Image: Using implementation '%s'\\n\", *ToString<std::type_info>( init.target_type() ) );\n\n     ret = init( *image );\n     if (ret) {\n          delete image;\n          return ret;\n     }\n\n     ret_image = image;\n\n     return DFB_OK;\n}\n\n\/**********************************************************************************************************************\/\n\nKHR::Image::Image()\n     :\n     display( NULL ),\n     context( NULL ),\n     target( 0 ),\n     buffer( NULL ),\n     dfb_surface( NULL ),\n     dfb_buffer( NULL )\n{\n     D_DEBUG_AT( DFBEGL_Image, \"KHR::Image::%s( %p )\\n\", __FUNCTION__, this );\n}\n\nKHR::Image::~Image()\n{\n     D_DEBUG_AT( DFBEGL_Image, \"KHR::Image::%s( %p )\\n\", __FUNCTION__, this );\n\n     if (dfb_buffer)\n          dfb_buffer->Release( dfb_buffer );\n\n     if (dfb_surface)\n          dfb_surface->Release( dfb_surface );\n}\n\n\n\n}\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkDICOMImageReader.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 \"DICOMParser.h\"\n#include \"DICOMAppHelper.h\"\n\n#include \"vtkDICOMImageReader.h\"\n#include \"vtkImageData.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkPointData.h\"\n#include \"vtkDirectory.h\"\n\n#include <vtkstd\/vector>\n#include <vtkstd\/string>\n\nvtkCxxRevisionMacro(vtkDICOMImageReader, \"1.22\");\nvtkStandardNewMacro(vtkDICOMImageReader);\n\nclass vtkDICOMImageReaderVector : public vtkstd::vector<vtkstd::string>\n{\n\n};\n\nvtkDICOMImageReader::vtkDICOMImageReader()\n{\n  this->Parser = new DICOMParser();\n  this->AppHelper = new DICOMAppHelper();\n  this->DirectoryName = NULL;\n  this->PatientName = NULL;\n  this->StudyUID = NULL;\n  this->StudyID = NULL;\n  this->TransferSyntaxUID = NULL;\n  this->DICOMFileNames = new vtkDICOMImageReaderVector();\n}\n\nvtkDICOMImageReader::~vtkDICOMImageReader()\n{\n  delete this->Parser;\n  delete this->AppHelper;\n  delete this->DICOMFileNames;\n\n  if (this->DirectoryName) \n    { \n    delete [] this->DirectoryName; \n    }\n  if (this->PatientName) \n    { \n    delete [] this->PatientName; \n    }\n  if (this->StudyUID) \n    { \n    delete [] this->StudyUID; \n    }\n  if (this->StudyID) \n    { \n    delete [] this->StudyID; \n    }\n  if (this->TransferSyntaxUID) \n    { \n    delete [] this->TransferSyntaxUID; \n    }\n}\n\nvoid vtkDICOMImageReader::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->vtkImageReader2::PrintSelf(os, indent);\n  if (this->DirectoryName)\n    {\n    os << \"DirectoryName : \" << this->DirectoryName << \"\\n\";\n    }\n  else\n    {\n    os << \"DirectoryName : (NULL)\" << \"\\n\";\n    }\n  if (this->FileName)\n    {\n    os << \"FileName : \" << this->FileName << \"\\n\";\n    }\n  else\n    {\n    os << \"FileName : (NULL)\" << \"\\n\";\n    }\n\n}\n\nint vtkDICOMImageReader::CanReadFile(const char* fname)\n{\n  bool canOpen = this->Parser->OpenFile((char*) fname);\n  if (canOpen == false)\n    {\n    vtkErrorMacro(\"DICOMParser couldn't open : \" << fname);\n    return 0;\n    }\n  bool canRead = this->Parser->IsDICOMFile();\n  if (canRead == true)\n    {\n    return 1;\n    }\n  else\n    {\n    return 0;\n    }\n}\n\nvoid vtkDICOMImageReader::ExecuteInformation()\n{\n  if (this->FileName == NULL && this->DirectoryName == NULL)\n    {\n    return;\n    }\n\n  if (this->FileName)\n    {\n    this->DICOMFileNames->clear();\n    this->AppHelper->Clear();\n    this->Parser->ClearAllDICOMTagCallbacks();\n \n    this->Parser->OpenFile(this->FileName);\n    this->AppHelper->RegisterCallbacks(this->Parser);\n\n    this->Parser->ReadHeader();\n    this->SetupOutputInformation(1);\n    }\n  else if (this->DirectoryName)\n    {\n    vtkDirectory* dir = vtkDirectory::New();\n    int opened = dir->Open(this->DirectoryName);\n    if (!opened)\n      {\n      vtkErrorMacro(\"Couldn't open \" << this->DirectoryName);\n      dir->Delete();\n      return;\n      }\n    int numFiles = dir->GetNumberOfFiles();\n\n    vtkDebugMacro( << \"There are \" << numFiles << \" files in the directory.\");\n\n    this->DICOMFileNames->clear();\n    this->AppHelper->Clear();\n\n    for (int i = 0; i < numFiles; i++)\n      {\n      if (strcmp(dir->GetFile(i), \".\") == 0 ||\n          strcmp(dir->GetFile(i), \"..\") == 0)\n        {\n        continue;\n        }\n\n      vtkstd::string fileString = this->DirectoryName;\n      fileString += \"\/\";\n      fileString += dir->GetFile(i);\n\n      int val = this->CanReadFile(fileString.c_str());\n\n      if (val == 1)\n        {\n        vtkDebugMacro( << \"Adding \" << fileString.c_str() << \" to DICOMFileNames.\");\n        this->DICOMFileNames->push_back(fileString);\n        }\n      else\n        {\n        vtkDebugMacro( << fileString.c_str() << \" - DICOMParser CanReadFile returned : \" << val);\n        }\n\n      }\n    vtkstd::vector<vtkstd::string>::iterator iter;\n        \n    for (iter = this->DICOMFileNames->begin();\n         iter != this->DICOMFileNames->end();\n         iter++)\n      {\n      char* fn = (char*) (*iter).c_str();\n      vtkDebugMacro( << \"Trying : \" << fn);\n \n      bool couldOpen = this->Parser->OpenFile(fn);\n      if (!couldOpen)\n        {\n        dir->Delete();\n        return;\n        }\n\n      \/\/\n      this->Parser->ClearAllDICOMTagCallbacks();\n      this->AppHelper->RegisterCallbacks(this->Parser);\n\n      this->Parser->ReadHeader();\n\n      vtkDebugMacro( << \"File name : \" << fn );\n      vtkDebugMacro( << \"Slice number : \" << this->AppHelper->GetSliceNumber());\n      }\n    \n    vtkstd::vector<vtkstd::pair<float, vtkstd::string> > sortedFiles;\n    \n    this->AppHelper->GetImagePositionPatientFilenamePairs(sortedFiles);\n    this->SetupOutputInformation(static_cast<int>(sortedFiles.size()));\n\n    \/\/this->AppHelper->OutputSeries();\n\n    if (sortedFiles.size() > 0)\n      {\n      this->DICOMFileNames->clear();\n      vtkstd::vector<vtkstd::pair<float, vtkstd::string> >::iterator siter;\n      for (siter = sortedFiles.begin();\n           siter != sortedFiles.end();\n           siter++)\n        {\n        vtkDebugMacro(<< \"Sorted filename : \" << (*siter).second.c_str());\n        vtkDebugMacro(<< \"Adding file \" << (*siter).second.c_str() << \" at slice : \" << (*siter).first);\n        this->DICOMFileNames->push_back((*siter).second);\n        }\n      }\n    else\n      {\n      vtkErrorMacro( << \"Couldn't get sorted files. Slices may be in wrong order!\");\n      }\n    dir->Delete();\n    }\n    \n}\n\nvoid vtkDICOMImageReader::ExecuteData(vtkDataObject *output)\n{\n  vtkImageData *data = this->AllocateOutputData(output);\n\n  if (!this->FileName && this->DICOMFileNames->size() == 0)\n    {\n    vtkErrorMacro( << \"Either a filename was not specified or the specified directory does not contain any DICOM images.\");\n    return;\n    }\n\n  data->GetPointData()->GetScalars()->SetName(\"DICOMImage\");\n\n  this->ComputeDataIncrements();\n\n  if (this->FileName)\n    {\n    vtkDebugMacro( << \"Single file : \" << this->FileName);\n    this->Parser->ClearAllDICOMTagCallbacks();\n    this->Parser->OpenFile(this->FileName);\n    this->AppHelper->Clear();\n    this->AppHelper->RegisterCallbacks(this->Parser);\n    this->AppHelper->RegisterPixelDataCallback(this->Parser);\n\n    this->Parser->ReadHeader();\n\n    void* imgData = NULL;\n    DICOMParser::VRTypes dataType;\n    unsigned long imageDataLength;\n\n    this->AppHelper->GetImageData(imgData, dataType, imageDataLength);\n\n    void* buffer = data->GetScalarPointer();\n    if (buffer == NULL)\n      {\n      vtkErrorMacro(<< \"No memory allocated for image data!\");\n      return;\n      }\n    \/\/ DICOM stores the upper left pixel as the first pixel in an\n    \/\/ image. VTK stores the lower left pixel as the first pixel in\n    \/\/ an image.  Need to flip the data.\n    unsigned long rowLength;\n    rowLength = this->DataIncrements[1];\n    unsigned char *b = (unsigned char *)buffer;\n    unsigned char *iData = (unsigned char *)imgData;\n    iData += (imageDataLength - rowLength); \/\/ beginning of last row\n    for (int i=0; i < this->AppHelper->GetHeight(); ++i)\n      {\n      memcpy(b, iData, rowLength);\n      b += rowLength;\n      iData -= rowLength;\n      }\n    }\n  else if (this->DICOMFileNames->size() > 0)\n    {\n    vtkDebugMacro( << \"Multiple files (\" << static_cast<int>(this->DICOMFileNames->size()) << \")\");\n    this->Parser->ClearAllDICOMTagCallbacks();\n    this->AppHelper->Clear();\n    this->AppHelper->RegisterCallbacks(this->Parser);\n    this->AppHelper->RegisterPixelDataCallback(this->Parser);\n\n    void* buffer = data->GetScalarPointer();\n    if (buffer == NULL)\n      {\n      vtkErrorMacro(<< \"No memory allocated for image data!\");\n      return;\n      }\n    \n    vtkstd::vector<vtkstd::string>::iterator fiter; \n\n    int count = 0;\n    int numFiles = static_cast<int>(this->DICOMFileNames->size());\n\n    for (fiter = this->DICOMFileNames->begin();\n         fiter != this->DICOMFileNames->end();\n         fiter++)\n      {\n      count++;\n      vtkDebugMacro( << \"File : \" << (*fiter).c_str());\n      this->Parser->OpenFile((char*)(*fiter).c_str());\n      this->Parser->ReadHeader();\n\n      void* imgData = NULL;\n      DICOMParser::VRTypes dataType;\n      unsigned long imageDataLengthInBytes;\n\n      this->AppHelper->GetImageData(imgData, dataType, imageDataLengthInBytes);\n\n      \/\/ DICOM stores the upper left pixel as the first pixel in an\n      \/\/ image. VTK stores the lower left pixel as the first pixel in\n      \/\/ an image.  Need to flip the data.\n      unsigned long rowLength;\n      rowLength = this->DataIncrements[1];\n      unsigned char *b = (unsigned char *)buffer;\n      unsigned char *iData = (unsigned char *)imgData;\n      iData += (imageDataLengthInBytes - rowLength); \/\/ beginning of last row\n      for (int i=0; i < this->AppHelper->GetHeight(); ++i)\n        {\n        memcpy(b, iData, rowLength);\n        b += rowLength;\n        iData -= rowLength;\n        }\n      buffer = ((char*) buffer) + imageDataLengthInBytes;\n\n      this->UpdateProgress(float(count)\/float(numFiles));\n      int len = static_cast<int> (strlen((char*) (*fiter).c_str()));\n      char* filename = new char[len+1];\n      strcpy(filename, (char*) (*fiter).c_str());\n      this->SetProgressText(filename);\n\n      }\n    }\n}\n\nvoid vtkDICOMImageReader::SetupOutputInformation(int num_slices)\n{\n  int width = this->AppHelper->GetWidth();\n  int height = this->AppHelper->GetHeight();\n  int bit_depth = this->AppHelper->GetBitsAllocated();\n  int num_comp = this->AppHelper->GetNumberOfComponents();\n\n  this->DataExtent[0] = 0;\n  this->DataExtent[1] = width - 1;\n  this->DataExtent[2] = 0;\n  this->DataExtent[3] = height - 1;\n  this->DataExtent[4] = 0;\n  this->DataExtent[5] = num_slices - 1;\n\n  bool isFloat = this->AppHelper->RescaledImageDataIsFloat();\n\n  bool sign = this->AppHelper->RescaledImageDataIsSigned();\n\n  if (isFloat)\n    {\n    this->SetDataScalarTypeToFloat();\n    }\n  else if (bit_depth <= 8)\n    {\n    this->SetDataScalarTypeToUnsignedChar();\n    }\n  else\n    {\n    if (sign)\n      {\n      this->SetDataScalarTypeToShort();\n      }\n    else\n      {\n      this->SetDataScalarTypeToUnsignedShort();\n      }\n    }\n  this->SetNumberOfScalarComponents(num_comp);\n\n  this->GetPixelSpacing();  \n\n  this->vtkImageReader2::ExecuteInformation();\n}\n\nvoid vtkDICOMImageReader::SetDirectoryName(const char* dn)\n{\n  vtkDebugMacro(<< this->GetClassName() << \" (\" << this << \n                \"): setting DirectoryName to \" << (dn ? dn : \"(null)\") ); \n  if ( this->DirectoryName == NULL && dn == NULL) \n    { \n    return;\n    } \n  if (this->FileName)\n    {\n    delete [] this->FileName;\n    this->FileName = NULL;\n    }\n  if ( this->DirectoryName && dn && (!strcmp(this->DirectoryName,dn))) \n    { \n    return;\n    }\n  if (this->DirectoryName) \n    { \n    delete [] this->DirectoryName; \n    } \n  if (dn) \n    { \n    this->DirectoryName = new char[strlen(dn)+1]; \n    strcpy(this->DirectoryName,dn); \n    } \n   else \n    { \n    this->DirectoryName = NULL; \n    } \n  this->Modified(); \n}\n\ndouble* vtkDICOMImageReader::GetPixelSpacing()\n{\n  vtkstd::vector<vtkstd::pair<float, vtkstd::string> > sortedFiles;\n    \n  this->AppHelper->GetImagePositionPatientFilenamePairs(sortedFiles);\n  \n  float* spacing = this->AppHelper->GetPixelSpacing();\n  this->DataSpacing[0] = spacing[0];\n  this->DataSpacing[1] = spacing[1];\n\n  if (sortedFiles.size() > 1)\n    {\n    vtkstd::pair<float, vtkstd::string> p1 = sortedFiles[0];\n    vtkstd::pair<float, vtkstd::string> p2 = sortedFiles[1];\n    this->DataSpacing[2] = fabs(p1.first - p2.first);\n    }\n  else\n    {\n    this->DataSpacing[2] = spacing[2];\n    }\n\n  return this->DataSpacing;\n}\n  \nint vtkDICOMImageReader::GetWidth()\n{\n  return this->AppHelper->GetWidth();\n}\n\nint vtkDICOMImageReader::GetHeight()\n{\n  return this->AppHelper->GetHeight();\n}\n\nfloat* vtkDICOMImageReader::GetImagePositionPatient()\n{\n  return this->AppHelper->GetImagePositionPatient();\n}\n\nint vtkDICOMImageReader::GetBitsAllocated()\n{\n  return this->AppHelper->GetBitsAllocated();\n}\n\nint vtkDICOMImageReader::GetPixelRepresentation()\n{\n  return this->AppHelper->GetPixelRepresentation();\n}\n\nint vtkDICOMImageReader::GetNumberOfComponents()\n{\n  return this->AppHelper->GetNumberOfComponents();\n}\n\nconst char* vtkDICOMImageReader::GetTransferSyntaxUID()\n{\n  vtkstd::string tmp = this->AppHelper->GetTransferSyntaxUID();\n  \n  if (this->TransferSyntaxUID)\n    {\n    delete [] this->TransferSyntaxUID;\n    }\n  this->TransferSyntaxUID = new char[tmp.length()+1];\n  strcpy(this->TransferSyntaxUID, tmp.c_str());\n  this->TransferSyntaxUID[tmp.length()] = '\\0';\n\n  return this->TransferSyntaxUID;\n}\n\nfloat vtkDICOMImageReader::GetRescaleSlope()\n{\n  return this->AppHelper->GetRescaleSlope();\n}\n\nfloat vtkDICOMImageReader::GetRescaleOffset()\n{\n  return this->AppHelper->GetRescaleOffset();\n}\n\nconst char* vtkDICOMImageReader::GetPatientName()\n{\n  vtkstd::string tmp = this->AppHelper->GetPatientName();\n  \n  if (this->PatientName)\n    {\n    delete [] this->PatientName;\n    }\n  this->PatientName = new char[tmp.length()+1];\n  strcpy(this->PatientName, tmp.c_str());\n  this->PatientName[tmp.length()] = '\\0';\n\n  return this->PatientName;\n}\n\nconst char* vtkDICOMImageReader::GetStudyUID()\n{\n  vtkstd::string tmp = this->AppHelper->GetStudyUID();\n  \n  if (this->StudyUID)\n    {\n    delete [] this->StudyUID;\n    }\n  this->StudyUID = new char[tmp.length()+1];\n  strcpy(this->StudyUID, tmp.c_str());\n  this->StudyUID[tmp.length()] = '\\0';\n\n  return this->StudyUID;\n}\n\nconst char* vtkDICOMImageReader::GetStudyID()\n{\n  vtkstd::string tmp = this->AppHelper->GetStudyID();\n  \n  if (this->StudyID)\n    {\n    delete [] this->StudyID;\n    }\n  this->StudyID = new char[tmp.length()+1];\n  strcpy(this->StudyID, tmp.c_str());\n  this->StudyID[tmp.length()] = '\\0';\n\n  return this->StudyID;\n}\n\nfloat vtkDICOMImageReader::GetGantryAngle()\n{\n  return this->AppHelper->GetGantryAngle();\n}\n<commit_msg>FIX: order slices head to toe<commit_after>\n\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkDICOMImageReader.cxx\n  Language:  C++\n  Date:      $Date$\n  Version:   $Revision$\n\n  Copyright (c) 1993-2002 Ken Martin, Will Schroeder, Bill Lorensen\n  All rights reserved.\n  See Copyright.txt or http:\/\/www.kitware.com\/Copyright.htm for details.\n\n     This software is distributed WITHOUT ANY WARRANTY; without even\n     the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n     PURPOSE.  See the above copyright notice for more information.\n\n=========================================================================*\/\n\n#include \"DICOMParser.h\"\n#include \"DICOMAppHelper.h\"\n\n#include \"vtkDICOMImageReader.h\"\n#include \"vtkImageData.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkPointData.h\"\n#include \"vtkDirectory.h\"\n\n#include <vtkstd\/vector>\n#include <vtkstd\/string>\n\nvtkCxxRevisionMacro(vtkDICOMImageReader, \"1.23\");\nvtkStandardNewMacro(vtkDICOMImageReader);\n\nclass vtkDICOMImageReaderVector : public vtkstd::vector<vtkstd::string>\n{\n\n};\n\nvtkDICOMImageReader::vtkDICOMImageReader()\n{\n  this->Parser = new DICOMParser();\n  this->AppHelper = new DICOMAppHelper();\n  this->DirectoryName = NULL;\n  this->PatientName = NULL;\n  this->StudyUID = NULL;\n  this->StudyID = NULL;\n  this->TransferSyntaxUID = NULL;\n  this->DICOMFileNames = new vtkDICOMImageReaderVector();\n}\n\nvtkDICOMImageReader::~vtkDICOMImageReader()\n{\n  delete this->Parser;\n  delete this->AppHelper;\n  delete this->DICOMFileNames;\n\n  if (this->DirectoryName) \n    { \n    delete [] this->DirectoryName; \n    }\n  if (this->PatientName) \n    { \n    delete [] this->PatientName; \n    }\n  if (this->StudyUID) \n    { \n    delete [] this->StudyUID; \n    }\n  if (this->StudyID) \n    { \n    delete [] this->StudyID; \n    }\n  if (this->TransferSyntaxUID) \n    { \n    delete [] this->TransferSyntaxUID; \n    }\n}\n\nvoid vtkDICOMImageReader::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->vtkImageReader2::PrintSelf(os, indent);\n  if (this->DirectoryName)\n    {\n    os << \"DirectoryName : \" << this->DirectoryName << \"\\n\";\n    }\n  else\n    {\n    os << \"DirectoryName : (NULL)\" << \"\\n\";\n    }\n  if (this->FileName)\n    {\n    os << \"FileName : \" << this->FileName << \"\\n\";\n    }\n  else\n    {\n    os << \"FileName : (NULL)\" << \"\\n\";\n    }\n\n}\n\nint vtkDICOMImageReader::CanReadFile(const char* fname)\n{\n  bool canOpen = this->Parser->OpenFile((char*) fname);\n  if (canOpen == false)\n    {\n    vtkErrorMacro(\"DICOMParser couldn't open : \" << fname);\n    return 0;\n    }\n  bool canRead = this->Parser->IsDICOMFile();\n  if (canRead == true)\n    {\n    return 1;\n    }\n  else\n    {\n    return 0;\n    }\n}\n\nvoid vtkDICOMImageReader::ExecuteInformation()\n{\n  if (this->FileName == NULL && this->DirectoryName == NULL)\n    {\n    return;\n    }\n\n  if (this->FileName)\n    {\n    this->DICOMFileNames->clear();\n    this->AppHelper->Clear();\n    this->Parser->ClearAllDICOMTagCallbacks();\n \n    this->Parser->OpenFile(this->FileName);\n    this->AppHelper->RegisterCallbacks(this->Parser);\n\n    this->Parser->ReadHeader();\n    this->SetupOutputInformation(1);\n    }\n  else if (this->DirectoryName)\n    {\n    vtkDirectory* dir = vtkDirectory::New();\n    int opened = dir->Open(this->DirectoryName);\n    if (!opened)\n      {\n      vtkErrorMacro(\"Couldn't open \" << this->DirectoryName);\n      dir->Delete();\n      return;\n      }\n    int numFiles = dir->GetNumberOfFiles();\n\n    vtkDebugMacro( << \"There are \" << numFiles << \" files in the directory.\");\n\n    this->DICOMFileNames->clear();\n    this->AppHelper->Clear();\n\n    for (int i = 0; i < numFiles; i++)\n      {\n      if (strcmp(dir->GetFile(i), \".\") == 0 ||\n          strcmp(dir->GetFile(i), \"..\") == 0)\n        {\n        continue;\n        }\n\n      vtkstd::string fileString = this->DirectoryName;\n      fileString += \"\/\";\n      fileString += dir->GetFile(i);\n\n      int val = this->CanReadFile(fileString.c_str());\n\n      if (val == 1)\n        {\n        vtkDebugMacro( << \"Adding \" << fileString.c_str() << \" to DICOMFileNames.\");\n        this->DICOMFileNames->push_back(fileString);\n        }\n      else\n        {\n        vtkDebugMacro( << fileString.c_str() << \" - DICOMParser CanReadFile returned : \" << val);\n        }\n\n      }\n    vtkstd::vector<vtkstd::string>::iterator iter;\n        \n    for (iter = this->DICOMFileNames->begin();\n         iter != this->DICOMFileNames->end();\n         iter++)\n      {\n      char* fn = (char*) (*iter).c_str();\n      vtkDebugMacro( << \"Trying : \" << fn);\n \n      bool couldOpen = this->Parser->OpenFile(fn);\n      if (!couldOpen)\n        {\n        dir->Delete();\n        return;\n        }\n\n      \/\/\n      this->Parser->ClearAllDICOMTagCallbacks();\n      this->AppHelper->RegisterCallbacks(this->Parser);\n\n      this->Parser->ReadHeader();\n\n      vtkDebugMacro( << \"File name : \" << fn );\n      vtkDebugMacro( << \"Slice number : \" << this->AppHelper->GetSliceNumber());\n      }\n    \n    vtkstd::vector<vtkstd::pair<float, vtkstd::string> > sortedFiles;\n    \n    this->AppHelper->GetImagePositionPatientFilenamePairs(sortedFiles, false);\n    this->SetupOutputInformation(static_cast<int>(sortedFiles.size()));\n\n    \/\/this->AppHelper->OutputSeries();\n\n    if (sortedFiles.size() > 0)\n      {\n      this->DICOMFileNames->clear();\n      vtkstd::vector<vtkstd::pair<float, vtkstd::string> >::iterator siter;\n      for (siter = sortedFiles.begin();\n           siter != sortedFiles.end();\n           siter++)\n        {\n        vtkDebugMacro(<< \"Sorted filename : \" << (*siter).second.c_str());\n        vtkDebugMacro(<< \"Adding file \" << (*siter).second.c_str() << \" at slice : \" << (*siter).first);\n        this->DICOMFileNames->push_back((*siter).second);\n        }\n      }\n    else\n      {\n      vtkErrorMacro( << \"Couldn't get sorted files. Slices may be in wrong order!\");\n      }\n    dir->Delete();\n    }\n    \n}\n\nvoid vtkDICOMImageReader::ExecuteData(vtkDataObject *output)\n{\n  vtkImageData *data = this->AllocateOutputData(output);\n\n  if (!this->FileName && this->DICOMFileNames->size() == 0)\n    {\n    vtkErrorMacro( << \"Either a filename was not specified or the specified directory does not contain any DICOM images.\");\n    return;\n    }\n\n  data->GetPointData()->GetScalars()->SetName(\"DICOMImage\");\n\n  this->ComputeDataIncrements();\n\n  \/\/ Get the pointer to the output pixel data\n  void *outPtr;\n  outPtr = data->GetScalarPointer();\n\n  if (this->FileName)\n    {\n    vtkDebugMacro( << \"Single file : \" << this->FileName);\n    this->Parser->ClearAllDICOMTagCallbacks();\n    this->Parser->OpenFile(this->FileName);\n    this->AppHelper->Clear();\n    this->AppHelper->RegisterCallbacks(this->Parser);\n    this->AppHelper->RegisterPixelDataCallback(this->Parser);\n\n    this->Parser->ReadHeader();\n\n    void* imgData = NULL;\n    DICOMParser::VRTypes dataType;\n    unsigned long imageDataLength;\n\n    this->AppHelper->GetImageData(imgData, dataType, imageDataLength);\n\n    void* buffer = data->GetScalarPointer();\n    if (buffer == NULL)\n      {\n      vtkErrorMacro(<< \"No memory allocated for image data!\");\n      return;\n      }\n    \/\/ DICOM stores the upper left pixel as the first pixel in an\n    \/\/ image. VTK stores the lower left pixel as the first pixel in\n    \/\/ an image.  Need to flip the data.\n    unsigned long rowLength;\n    rowLength = this->DataIncrements[1];\n    unsigned char *b = (unsigned char *)buffer;\n    unsigned char *iData = (unsigned char *)imgData;\n    iData += (imageDataLength - rowLength); \/\/ beginning of last row\n    for (int i=0; i < this->AppHelper->GetHeight(); ++i)\n      {\n      memcpy(b, iData, rowLength);\n      b += rowLength;\n      iData -= rowLength;\n      }\n    }\n  else if (this->DICOMFileNames->size() > 0)\n    {\n    vtkDebugMacro( << \"Multiple files (\" << static_cast<int>(this->DICOMFileNames->size()) << \")\");\n    this->Parser->ClearAllDICOMTagCallbacks();\n    this->AppHelper->Clear();\n    this->AppHelper->RegisterCallbacks(this->Parser);\n    this->AppHelper->RegisterPixelDataCallback(this->Parser);\n\n    void* buffer = data->GetScalarPointer();\n    if (buffer == NULL)\n      {\n      vtkErrorMacro(<< \"No memory allocated for image data!\");\n      return;\n      }\n    \n    vtkstd::vector<vtkstd::string>::iterator fiter; \n\n    int count = 0;\n    int numFiles = static_cast<int>(this->DICOMFileNames->size());\n\n    for (fiter = this->DICOMFileNames->begin();\n         fiter != this->DICOMFileNames->end();\n         fiter++)\n      {\n      count++;\n      vtkDebugMacro( << \"File : \" << (*fiter).c_str());\n      this->Parser->OpenFile((char*)(*fiter).c_str());\n      this->Parser->ReadHeader();\n\n      void* imgData = NULL;\n      DICOMParser::VRTypes dataType;\n      unsigned long imageDataLengthInBytes;\n\n      this->AppHelper->GetImageData(imgData, dataType, imageDataLengthInBytes);\n\n      \/\/ DICOM stores the upper left pixel as the first pixel in an\n      \/\/ image. VTK stores the lower left pixel as the first pixel in\n      \/\/ an image.  Need to flip the data.\n      unsigned long rowLength;\n      rowLength = this->DataIncrements[1];\n      unsigned char *b = (unsigned char *)buffer;\n      unsigned char *iData = (unsigned char *)imgData;\n      iData += (imageDataLengthInBytes - rowLength); \/\/ beginning of last row\n      for (int i=0; i < this->AppHelper->GetHeight(); ++i)\n        {\n        memcpy(b, iData, rowLength);\n        b += rowLength;\n        iData -= rowLength;\n        }\n      buffer = ((char*) buffer) + imageDataLengthInBytes;\n\n      this->UpdateProgress(float(count)\/float(numFiles));\n      int len = static_cast<int> (strlen((char*) (*fiter).c_str()));\n      char* filename = new char[len+1];\n      strcpy(filename, (char*) (*fiter).c_str());\n      this->SetProgressText(filename);\n\n      }\n    }\n}\n\nvoid vtkDICOMImageReader::SetupOutputInformation(int num_slices)\n{\n  int width = this->AppHelper->GetWidth();\n  int height = this->AppHelper->GetHeight();\n  int bit_depth = this->AppHelper->GetBitsAllocated();\n  int num_comp = this->AppHelper->GetNumberOfComponents();\n\n  this->DataExtent[0] = 0;\n  this->DataExtent[1] = width - 1;\n  this->DataExtent[2] = 0;\n  this->DataExtent[3] = height - 1;\n  this->DataExtent[4] = 0;\n  this->DataExtent[5] = num_slices - 1;\n\n  bool isFloat = this->AppHelper->RescaledImageDataIsFloat();\n\n  bool sign = this->AppHelper->RescaledImageDataIsSigned();\n\n  if (isFloat)\n    {\n    this->SetDataScalarTypeToFloat();\n    }\n  else if (bit_depth <= 8)\n    {\n    this->SetDataScalarTypeToUnsignedChar();\n    }\n  else\n    {\n    if (sign)\n      {\n      this->SetDataScalarTypeToShort();\n      }\n    else\n      {\n      this->SetDataScalarTypeToUnsignedShort();\n      }\n    }\n  this->SetNumberOfScalarComponents(num_comp);\n\n  this->GetPixelSpacing();  \n\n  this->vtkImageReader2::ExecuteInformation();\n}\n\nvoid vtkDICOMImageReader::SetDirectoryName(const char* dn)\n{\n  vtkDebugMacro(<< this->GetClassName() << \" (\" << this << \n                \"): setting DirectoryName to \" << (dn ? dn : \"(null)\") ); \n  if ( this->DirectoryName == NULL && dn == NULL) \n    { \n    return;\n    } \n  if (this->FileName)\n    {\n    delete [] this->FileName;\n    this->FileName = NULL;\n    }\n  if ( this->DirectoryName && dn && (!strcmp(this->DirectoryName,dn))) \n    { \n    return;\n    }\n  if (this->DirectoryName) \n    { \n    delete [] this->DirectoryName; \n    } \n  if (dn) \n    { \n    this->DirectoryName = new char[strlen(dn)+1]; \n    strcpy(this->DirectoryName,dn); \n    } \n   else \n    { \n    this->DirectoryName = NULL; \n    } \n  this->Modified(); \n}\n\ndouble* vtkDICOMImageReader::GetPixelSpacing()\n{\n  vtkstd::vector<vtkstd::pair<float, vtkstd::string> > sortedFiles;\n    \n  this->AppHelper->GetImagePositionPatientFilenamePairs(sortedFiles, false);\n  \n  float* spacing = this->AppHelper->GetPixelSpacing();\n  this->DataSpacing[0] = spacing[0];\n  this->DataSpacing[1] = spacing[1];\n\n  if (sortedFiles.size() > 1)\n    {\n    vtkstd::pair<float, vtkstd::string> p1 = sortedFiles[0];\n    vtkstd::pair<float, vtkstd::string> p2 = sortedFiles[1];\n    this->DataSpacing[2] = fabs(p1.first - p2.first);\n    }\n  else\n    {\n    this->DataSpacing[2] = spacing[2];\n    }\n\n  return this->DataSpacing;\n}\n  \nint vtkDICOMImageReader::GetWidth()\n{\n  return this->AppHelper->GetWidth();\n}\n\nint vtkDICOMImageReader::GetHeight()\n{\n  return this->AppHelper->GetHeight();\n}\n\nfloat* vtkDICOMImageReader::GetImagePositionPatient()\n{\n  return this->AppHelper->GetImagePositionPatient();\n}\n\nint vtkDICOMImageReader::GetBitsAllocated()\n{\n  return this->AppHelper->GetBitsAllocated();\n}\n\nint vtkDICOMImageReader::GetPixelRepresentation()\n{\n  return this->AppHelper->GetPixelRepresentation();\n}\n\nint vtkDICOMImageReader::GetNumberOfComponents()\n{\n  return this->AppHelper->GetNumberOfComponents();\n}\n\nconst char* vtkDICOMImageReader::GetTransferSyntaxUID()\n{\n  vtkstd::string tmp = this->AppHelper->GetTransferSyntaxUID();\n  \n  if (this->TransferSyntaxUID)\n    {\n    delete [] this->TransferSyntaxUID;\n    }\n  this->TransferSyntaxUID = new char[tmp.length()+1];\n  strcpy(this->TransferSyntaxUID, tmp.c_str());\n  this->TransferSyntaxUID[tmp.length()] = '\\0';\n\n  return this->TransferSyntaxUID;\n}\n\nfloat vtkDICOMImageReader::GetRescaleSlope()\n{\n  return this->AppHelper->GetRescaleSlope();\n}\n\nfloat vtkDICOMImageReader::GetRescaleOffset()\n{\n  return this->AppHelper->GetRescaleOffset();\n}\n\nconst char* vtkDICOMImageReader::GetPatientName()\n{\n  vtkstd::string tmp = this->AppHelper->GetPatientName();\n  \n  if (this->PatientName)\n    {\n    delete [] this->PatientName;\n    }\n  this->PatientName = new char[tmp.length()+1];\n  strcpy(this->PatientName, tmp.c_str());\n  this->PatientName[tmp.length()] = '\\0';\n\n  return this->PatientName;\n}\n\nconst char* vtkDICOMImageReader::GetStudyUID()\n{\n  vtkstd::string tmp = this->AppHelper->GetStudyUID();\n  \n  if (this->StudyUID)\n    {\n    delete [] this->StudyUID;\n    }\n  this->StudyUID = new char[tmp.length()+1];\n  strcpy(this->StudyUID, tmp.c_str());\n  this->StudyUID[tmp.length()] = '\\0';\n\n  return this->StudyUID;\n}\n\nconst char* vtkDICOMImageReader::GetStudyID()\n{\n  vtkstd::string tmp = this->AppHelper->GetStudyID();\n  \n  if (this->StudyID)\n    {\n    delete [] this->StudyID;\n    }\n  this->StudyID = new char[tmp.length()+1];\n  strcpy(this->StudyID, tmp.c_str());\n  this->StudyID[tmp.length()] = '\\0';\n\n  return this->StudyID;\n}\n\nfloat vtkDICOMImageReader::GetGantryAngle()\n{\n  return this->AppHelper->GetGantryAngle();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ STCThermalTests.cpp\n#include <deque>\n#include <map>\n#include <gtest\/gtest.h>\n\n#include \"STCThermalTests.h\"\n#include \"ThermalModelTests.h\"\n#include \"CycException.h\"\n#include \"Material.h\"\n#include \"MaterialDB.h\"\n#include \"XMLQueryEngine.h\"\n\nusing namespace std;\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nvoid STCThermalTest::SetUp(){\n  \/\/ set up geometry. this usually happens in the component init\n  r_four_ = 4;\n  r_five_ = 5;\n  point_t origin_ = {0,0,0}; \n  len_five_ = 5;\n  geom_ = GeometryPtr(new Geometry(r_four_, r_five_, origin_, len_five_));\n\n  \/\/ other vars\n  k_th_ = .1; \/\/ ___  @TODO worry about units\n  spacing_ = .1; \/\/ ___ @TODO worry about units\n  alpha_th_ = .1; \/\/ ___ @TODO worry about units\n  time_ = 0;\n  mat_ = \"clay\";\n  mat_table_=MDB->table(mat_);\n\n  \/\/ composition set up\n  u235_=92235;\n  u_=92;\n  one_mol_=1.0;\n  test_comp_= CompMapPtr(new CompMap(MASS));\n  (*test_comp_)[u235_] = one_mol_;\n  test_size_=10.0;\n\n  \/\/ material creation\n  Cs135_ = 55135;\n  Cs137_ = 55137;\n\n  hot_comp_ = CompMapPtr(new CompMap(MASS));\n  (*hot_comp_)[Cs135_] = 1000;\n  (*hot_comp_)[Cs137_] = 1000;\n  cold_comp_ = CompMapPtr(new CompMap(MASS));\n  (*cold_comp_)[Cs135_] = 1;\n\n  hot_mat_ = mat_rsrc_ptr(new Material(hot_comp_));\n  cold_mat_ = mat_rsrc_ptr(new Material(cold_comp_));\n\n  \/\/ test_stc_thermal model setup\n  stc_ptr_ = STCThermalPtr(initThermalModel()); \/\/initializes stc_ptr_\n  therm_model_ptr_ = boost::dynamic_pointer_cast<ThermalModel>(stc_ptr_);\n  stc_ptr_->set_mat_table(mat_table_);\n  stc_ptr_->set_geom(geom_);\n  default_stc_ptr_ = STCThermalPtr(STCThermal::create());\n  default_therm_model_ptr_ = boost::dynamic_pointer_cast<ThermalModel>(default_stc_ptr_);\n  default_stc_ptr_->set_mat_table(mat_table_);\n\n}\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nvoid STCThermalTest::TearDown() {\n}\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nThermalModelPtr STCThermalModelConstructor(){\n  return boost::dynamic_pointer_cast<ThermalModel>(STCThermal::create());\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nSTCThermalPtr STCThermalTest::initThermalModel(){\n  stringstream ss(\"\");\n  ss << \"<start>\"\n     << \"  <alpha_th>\" << alpha_th_ << \"<\/alpha_th>\"\n     << \"  <k_th>\" << k_th_ << \"<\/k_th>\"\n     << \"  <material_data>\" << mat_ << \"<\/material_data>\"\n     << \"  <spacing>\" << spacing_ << \"<\/spacing>\"\n     << \"<\/start>\";\n\n  XMLParser parser(ss);\n  XMLQueryEngine* engine = new XMLQueryEngine(parser);\n  stc_ptr_ = STCThermalPtr(STCThermal::create());\n  stc_ptr_->initModuleMembers(engine);\n  delete engine;\n  return stc_ptr_;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(STCThermalTest, initial_state){\n  EXPECT_EQ(alpha_th_, stc_ptr_->alpha_th());\n  EXPECT_EQ(k_th_, stc_ptr_->k_th());\n  EXPECT_EQ(spacing_, stc_ptr_->spacing());\n}\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(STCThermalTest, defaultConstructor) {\n  ASSERT_EQ(\"STC_THERMAL\", default_therm_model_ptr_->name());\n  ASSERT_EQ(STC_THERMAL, default_therm_model_ptr_->type());\n  ASSERT_FLOAT_EQ(0, default_stc_ptr_->alpha_th());\n  ASSERT_FLOAT_EQ(0, default_stc_ptr_->k_th());\n  ASSERT_FLOAT_EQ(0, default_stc_ptr_->spacing());\n  ASSERT_FLOAT_EQ(0, default_stc_ptr_->geom()->length());\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(STCThermalTest, copy) {\n  STCThermalPtr test_copy = STCThermalPtr(STCThermal::create());\n  STCThermalPtr stc_shared_ptr = STCThermalPtr(stc_ptr_);\n  ThermalModelPtr therm_model_shared_ptr = ThermalModelPtr(therm_model_ptr_);\n  EXPECT_NO_THROW(test_copy->copy(*stc_shared_ptr));\n  EXPECT_NO_THROW(test_copy->copy(*therm_model_shared_ptr));\n  EXPECT_FLOAT_EQ(alpha_th_, stc_ptr_->alpha_th());\n  EXPECT_FLOAT_EQ(k_th_, stc_ptr_->k_th());\n  EXPECT_FLOAT_EQ(spacing_, stc_ptr_->spacing());\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(STCThermalTest, set_alpha_th){ \n  for( int it=0; it<10; ++it){ \n    \/\/ it should accept positive floats\n    alpha_th_ = it*0.2;\n    ASSERT_NO_THROW(stc_ptr_->set_alpha_th(alpha_th_));\n    EXPECT_FLOAT_EQ(stc_ptr_->alpha_th(), alpha_th_);\n  }\n  \/\/ an exception should be thrown if it's set outside the bounds\n  alpha_th_= -1;\n  EXPECT_THROW(stc_ptr_->set_alpha_th(alpha_th_), CycRangeException);\n  EXPECT_NE(stc_ptr_->alpha_th(), alpha_th_);\n  alpha_th_= std::numeric_limits<double>::infinity();\n  EXPECT_THROW(stc_ptr_->set_alpha_th(alpha_th_), CycRangeException);\n  EXPECT_NE(stc_ptr_->alpha_th(), alpha_th_);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(STCThermalTest, set_k_th){ \n  for( int it=0; it<10; ++it){ \n    \/\/ it should accept positive floats\n    k_th_=it*0.2;\n    ASSERT_NO_THROW(stc_ptr_->set_k_th(k_th_));\n    EXPECT_FLOAT_EQ(stc_ptr_->k_th(), k_th_);\n  }\n  \/\/ an exception should be thrown if it's set outside the bounds\n  k_th_= -1;\n  EXPECT_THROW(stc_ptr_->set_k_th(k_th_), CycRangeException);\n  EXPECT_NE(stc_ptr_->k_th(), k_th_);\n  k_th_= std::numeric_limits<double>::infinity();\n  EXPECT_THROW(stc_ptr_->set_k_th(k_th_), CycRangeException);\n  EXPECT_NE(stc_ptr_->k_th(), k_th_);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(STCThermalTest, set_spacing){ \n  for( int it=0; it<10; ++it){ \n    \/\/ it should accept positive floats\n    spacing_=it*0.2;\n    ASSERT_NO_THROW(stc_ptr_->set_spacing(spacing_));\n    EXPECT_FLOAT_EQ(stc_ptr_->spacing(), spacing_);\n  }\n  \/\/ an exception should be thrown if it's set outside the bounds\n  spacing_= -1;\n  EXPECT_THROW(stc_ptr_->set_spacing(spacing_), CycRangeException);\n  EXPECT_NE(stc_ptr_->spacing(), spacing_);\n  spacing_= std::numeric_limits<double>::infinity();\n  EXPECT_THROW(stc_ptr_->set_spacing(spacing_), CycRangeException);\n  EXPECT_NE(stc_ptr_->spacing(), spacing_);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(STCThermalTest, get_stc){\n  EXPECT_NO_THROW(stc_ptr_->getTempChange(hot_mat_));\n  EXPECT_GT(0, stc_ptr_->getTempChange(hot_mat_));\n  EXPECT_NO_THROW(stc_ptr_->getTempChange(cold_mat_));\n  EXPECT_GT(stc_ptr_->getTempChange(cold_mat_), stc_ptr_->getTempChange(hot_mat_));\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(STCThermalTest, transportHeatClay){ \n  EXPECT_NO_THROW(stc_ptr_->set_geom(geom_));\n  \/\/\/ @TODO set up a clay object\n  EXPECT_NO_THROW(stc_ptr_->set_mat(\"clay\"));\n  \/\/ transport the heat\n  EXPECT_NO_THROW(therm_model_ptr_->transportHeat(time_++));\n  \/\/\/ @TODO add checks and expectiations\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(STCThermalTest, transportHeatGranite){ \n  EXPECT_NO_THROW(stc_ptr_->set_geom(geom_));\n  \/\/\/ @TODO set up a granite object\n  EXPECT_NO_THROW(stc_ptr_->set_mat(\"granite\"));\n  \/\/ transport the heat\n  EXPECT_NO_THROW(therm_model_ptr_->transportHeat(time_++));\n  \/\/\/ @TODO add checks and expectiations\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(STCThermalTest, transportHeatSalt){ \n  EXPECT_NO_THROW(stc_ptr_->set_geom(geom_));\n  \/\/\/ @TODO set up a salt object\n  EXPECT_NO_THROW(stc_ptr_->set_mat(\"salt\"));\n  \/\/ transport the heat\n  EXPECT_NO_THROW(therm_model_ptr_->transportHeat(time_++));\n  \/\/\/ @TODO add checks and expectiations\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(STCThermalTest, setGeometry) {  \n  \/\/@TODO tests like this should be interface tests for the ThermalModel class concrete instances.\n  EXPECT_NO_THROW(stc_ptr_->set_geom(geom_));\n  EXPECT_FLOAT_EQ(len_five_ , therm_model_ptr_->geom()->length());\n  EXPECT_FLOAT_EQ(r_four_ , therm_model_ptr_->geom()->inner_radius());\n  EXPECT_FLOAT_EQ(r_five_ , therm_model_ptr_->geom()->outer_radius());\n  double vol = len_five_*3.14159*(r_five_*r_five_ - r_four_*r_four_);\n  EXPECT_NEAR( vol , therm_model_ptr_->geom()->volume(), 0.1);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(STCThermalTest, getVolume) {  \n  EXPECT_NO_THROW(stc_ptr_->set_geom(geom_));\n  double vol = len_five_*3.14159*(r_five_*r_five_ - r_four_*r_four_);\n  EXPECT_NEAR( vol , therm_model_ptr_->geom()->volume(), 0.1);\n  EXPECT_NO_THROW(stc_ptr_->geom()->set_radius(OUTER, r_four_));\n  EXPECT_FLOAT_EQ( 0 , therm_model_ptr_->geom()->volume());\n  EXPECT_THROW(stc_ptr_->geom()->set_radius(OUTER, numeric_limits<double>::infinity()), CycRangeException);\n  EXPECT_NO_THROW(therm_model_ptr_->geom()->volume());\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nINSTANTIATE_TEST_CASE_P(STCThermalModel, ThermalModelTests, Values(&STCThermalModelConstructor));\n\n<commit_msg>changed test name<commit_after>\/\/ STCThermalTests.cpp\n#include <deque>\n#include <map>\n#include <gtest\/gtest.h>\n\n#include \"STCThermalTests.h\"\n#include \"ThermalModelTests.h\"\n#include \"CycException.h\"\n#include \"Material.h\"\n#include \"MaterialDB.h\"\n#include \"XMLQueryEngine.h\"\n\nusing namespace std;\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nvoid STCThermalTest::SetUp(){\n  \/\/ set up geometry. this usually happens in the component init\n  r_four_ = 4;\n  r_five_ = 5;\n  point_t origin_ = {0,0,0}; \n  len_five_ = 5;\n  geom_ = GeometryPtr(new Geometry(r_four_, r_five_, origin_, len_five_));\n\n  \/\/ other vars\n  k_th_ = .1; \/\/ ___  @TODO worry about units\n  spacing_ = .1; \/\/ ___ @TODO worry about units\n  alpha_th_ = .1; \/\/ ___ @TODO worry about units\n  time_ = 0;\n  mat_ = \"clay\";\n  mat_table_=MDB->table(mat_);\n\n  \/\/ composition set up\n  u235_=92235;\n  u_=92;\n  one_mol_=1.0;\n  test_comp_= CompMapPtr(new CompMap(MASS));\n  (*test_comp_)[u235_] = one_mol_;\n  test_size_=10.0;\n\n  \/\/ material creation\n  Cs135_ = 55135;\n  Cs137_ = 55137;\n\n  hot_comp_ = CompMapPtr(new CompMap(MASS));\n  (*hot_comp_)[Cs135_] = 1000;\n  (*hot_comp_)[Cs137_] = 1000;\n  cold_comp_ = CompMapPtr(new CompMap(MASS));\n  (*cold_comp_)[Cs135_] = 1;\n\n  hot_mat_ = mat_rsrc_ptr(new Material(hot_comp_));\n  cold_mat_ = mat_rsrc_ptr(new Material(cold_comp_));\n\n  \/\/ test_stc_thermal model setup\n  stc_ptr_ = STCThermalPtr(initThermalModel()); \/\/initializes stc_ptr_\n  therm_model_ptr_ = boost::dynamic_pointer_cast<ThermalModel>(stc_ptr_);\n  stc_ptr_->set_mat_table(mat_table_);\n  stc_ptr_->set_geom(geom_);\n  default_stc_ptr_ = STCThermalPtr(STCThermal::create());\n  default_therm_model_ptr_ = boost::dynamic_pointer_cast<ThermalModel>(default_stc_ptr_);\n  default_stc_ptr_->set_mat_table(mat_table_);\n\n}\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nvoid STCThermalTest::TearDown() {\n}\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nThermalModelPtr STCThermalModelConstructor(){\n  return boost::dynamic_pointer_cast<ThermalModel>(STCThermal::create());\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nSTCThermalPtr STCThermalTest::initThermalModel(){\n  stringstream ss(\"\");\n  ss << \"<start>\"\n     << \"  <alpha_th>\" << alpha_th_ << \"<\/alpha_th>\"\n     << \"  <k_th>\" << k_th_ << \"<\/k_th>\"\n     << \"  <material_data>\" << mat_ << \"<\/material_data>\"\n     << \"  <spacing>\" << spacing_ << \"<\/spacing>\"\n     << \"<\/start>\";\n\n  XMLParser parser(ss);\n  XMLQueryEngine* engine = new XMLQueryEngine(parser);\n  stc_ptr_ = STCThermalPtr(STCThermal::create());\n  stc_ptr_->initModuleMembers(engine);\n  delete engine;\n  return stc_ptr_;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(STCThermalTest, initial_state){\n  EXPECT_EQ(alpha_th_, stc_ptr_->alpha_th());\n  EXPECT_EQ(k_th_, stc_ptr_->k_th());\n  EXPECT_EQ(spacing_, stc_ptr_->spacing());\n}\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(STCThermalTest, defaultConstructor) {\n  ASSERT_EQ(\"STC_THERMAL\", default_therm_model_ptr_->name());\n  ASSERT_EQ(STC_THERMAL, default_therm_model_ptr_->type());\n  ASSERT_FLOAT_EQ(0, default_stc_ptr_->alpha_th());\n  ASSERT_FLOAT_EQ(0, default_stc_ptr_->k_th());\n  ASSERT_FLOAT_EQ(0, default_stc_ptr_->spacing());\n  ASSERT_FLOAT_EQ(0, default_stc_ptr_->geom()->length());\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(STCThermalTest, copy) {\n  STCThermalPtr test_copy = STCThermalPtr(STCThermal::create());\n  STCThermalPtr stc_shared_ptr = STCThermalPtr(stc_ptr_);\n  ThermalModelPtr therm_model_shared_ptr = ThermalModelPtr(therm_model_ptr_);\n  EXPECT_NO_THROW(test_copy->copy(*stc_shared_ptr));\n  EXPECT_NO_THROW(test_copy->copy(*therm_model_shared_ptr));\n  EXPECT_FLOAT_EQ(alpha_th_, stc_ptr_->alpha_th());\n  EXPECT_FLOAT_EQ(k_th_, stc_ptr_->k_th());\n  EXPECT_FLOAT_EQ(spacing_, stc_ptr_->spacing());\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(STCThermalTest, set_alpha_th){ \n  for( int it=0; it<10; ++it){ \n    \/\/ it should accept positive floats\n    alpha_th_ = it*0.2;\n    ASSERT_NO_THROW(stc_ptr_->set_alpha_th(alpha_th_));\n    EXPECT_FLOAT_EQ(stc_ptr_->alpha_th(), alpha_th_);\n  }\n  \/\/ an exception should be thrown if it's set outside the bounds\n  alpha_th_= -1;\n  EXPECT_THROW(stc_ptr_->set_alpha_th(alpha_th_), CycRangeException);\n  EXPECT_NE(stc_ptr_->alpha_th(), alpha_th_);\n  alpha_th_= std::numeric_limits<double>::infinity();\n  EXPECT_THROW(stc_ptr_->set_alpha_th(alpha_th_), CycRangeException);\n  EXPECT_NE(stc_ptr_->alpha_th(), alpha_th_);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(STCThermalTest, set_k_th){ \n  for( int it=0; it<10; ++it){ \n    \/\/ it should accept positive floats\n    k_th_=it*0.2;\n    ASSERT_NO_THROW(stc_ptr_->set_k_th(k_th_));\n    EXPECT_FLOAT_EQ(stc_ptr_->k_th(), k_th_);\n  }\n  \/\/ an exception should be thrown if it's set outside the bounds\n  k_th_= -1;\n  EXPECT_THROW(stc_ptr_->set_k_th(k_th_), CycRangeException);\n  EXPECT_NE(stc_ptr_->k_th(), k_th_);\n  k_th_= std::numeric_limits<double>::infinity();\n  EXPECT_THROW(stc_ptr_->set_k_th(k_th_), CycRangeException);\n  EXPECT_NE(stc_ptr_->k_th(), k_th_);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(STCThermalTest, set_spacing){ \n  for( int it=0; it<10; ++it){ \n    \/\/ it should accept positive floats\n    spacing_=it*0.2;\n    ASSERT_NO_THROW(stc_ptr_->set_spacing(spacing_));\n    EXPECT_FLOAT_EQ(stc_ptr_->spacing(), spacing_);\n  }\n  \/\/ an exception should be thrown if it's set outside the bounds\n  spacing_= -1;\n  EXPECT_THROW(stc_ptr_->set_spacing(spacing_), CycRangeException);\n  EXPECT_NE(stc_ptr_->spacing(), spacing_);\n  spacing_= std::numeric_limits<double>::infinity();\n  EXPECT_THROW(stc_ptr_->set_spacing(spacing_), CycRangeException);\n  EXPECT_NE(stc_ptr_->spacing(), spacing_);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(STCThermalTest, get_temp_change){\n  EXPECT_NO_THROW(stc_ptr_->getTempChange(hot_mat_));\n  EXPECT_GT(0, stc_ptr_->getTempChange(hot_mat_));\n  EXPECT_NO_THROW(stc_ptr_->getTempChange(cold_mat_));\n  EXPECT_GT(stc_ptr_->getTempChange(cold_mat_), stc_ptr_->getTempChange(hot_mat_));\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(STCThermalTest, transportHeatClay){ \n  EXPECT_NO_THROW(stc_ptr_->set_geom(geom_));\n  \/\/\/ @TODO set up a clay object\n  EXPECT_NO_THROW(stc_ptr_->set_mat(\"clay\"));\n  \/\/ transport the heat\n  EXPECT_NO_THROW(therm_model_ptr_->transportHeat(time_++));\n  \/\/\/ @TODO add checks and expectiations\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(STCThermalTest, transportHeatGranite){ \n  EXPECT_NO_THROW(stc_ptr_->set_geom(geom_));\n  \/\/\/ @TODO set up a granite object\n  EXPECT_NO_THROW(stc_ptr_->set_mat(\"granite\"));\n  \/\/ transport the heat\n  EXPECT_NO_THROW(therm_model_ptr_->transportHeat(time_++));\n  \/\/\/ @TODO add checks and expectiations\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(STCThermalTest, transportHeatSalt){ \n  EXPECT_NO_THROW(stc_ptr_->set_geom(geom_));\n  \/\/\/ @TODO set up a salt object\n  EXPECT_NO_THROW(stc_ptr_->set_mat(\"salt\"));\n  \/\/ transport the heat\n  EXPECT_NO_THROW(therm_model_ptr_->transportHeat(time_++));\n  \/\/\/ @TODO add checks and expectiations\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(STCThermalTest, setGeometry) {  \n  \/\/@TODO tests like this should be interface tests for the ThermalModel class concrete instances.\n  EXPECT_NO_THROW(stc_ptr_->set_geom(geom_));\n  EXPECT_FLOAT_EQ(len_five_ , therm_model_ptr_->geom()->length());\n  EXPECT_FLOAT_EQ(r_four_ , therm_model_ptr_->geom()->inner_radius());\n  EXPECT_FLOAT_EQ(r_five_ , therm_model_ptr_->geom()->outer_radius());\n  double vol = len_five_*3.14159*(r_five_*r_five_ - r_four_*r_four_);\n  EXPECT_NEAR( vol , therm_model_ptr_->geom()->volume(), 0.1);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nTEST_F(STCThermalTest, getVolume) {  \n  EXPECT_NO_THROW(stc_ptr_->set_geom(geom_));\n  double vol = len_five_*3.14159*(r_five_*r_five_ - r_four_*r_four_);\n  EXPECT_NEAR( vol , therm_model_ptr_->geom()->volume(), 0.1);\n  EXPECT_NO_THROW(stc_ptr_->geom()->set_radius(OUTER, r_four_));\n  EXPECT_FLOAT_EQ( 0 , therm_model_ptr_->geom()->volume());\n  EXPECT_THROW(stc_ptr_->geom()->set_radius(OUTER, numeric_limits<double>::infinity()), CycRangeException);\n  EXPECT_NO_THROW(therm_model_ptr_->geom()->volume());\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -    \nINSTANTIATE_TEST_CASE_P(STCThermalModel, ThermalModelTests, Values(&STCThermalModelConstructor));\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Authors: Mateus Fogaca\n\/\/          (Ph.D. advisor: Ricardo Reis)\n\/\/          Jiajia Li\n\/\/          Andrew Kahng\n\/\/ Based on:\n\/\/          K. Han, A. B. Kahng and J. Li, \"Optimal Generalized H-Tree Topology and \n\/\/          Buffering for High-Performance and Low-Power Clock Distribution\", \n\/\/          IEEE Trans. on CAD (2018), doi:10.1109\/TCAD.2018.2889756.\n\/\/\n\/\/\n\/\/ BSD 3-Clause License\n\/\/\n\/\/ Copyright (c) 2018, 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 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 \"DBWrapper.h\"\n#include \"TritonCTSKernel.h\"\n#include \"HTreeBuilder.h\"\n\n\/\/ DB includes\n#include \"db.h\"\n#include \"dbShape.h\"\n#include \"dbTypes.h\"\n\n#include <iostream>\n#include <sstream>\n\nnamespace TritonCTS {\n\nDBWrapper::DBWrapper(ParametersForCTS& parms,\n                     TritonCTSKernel& kernel) {\n        _parms  = &parms;\n        _kernel = &kernel;\n}\n\nvoid DBWrapper::populateTritonCTS() {\n       initDB();\n       initAllClockNets(); \n}\n\nvoid DBWrapper::initDB() {\n        _db    = odb::dbDatabase::getDatabase(_parms->getDbId());\n        _chip  = _db->getChip();\n        _block = _chip->getBlock();\n        _parms->setDbUnits(_block->getDbUnitsPerMicron());\n}\n\nvoid DBWrapper::initAllClockNets() {\n        std::cout << \" Initializing clock nets\\n\";\n        \n        std::vector<std::string> clockNetNames;\n        parseClockNetNames(clockNetNames);\n\n        std::cout << \" Looking for clock nets in the design\\n\";\n        for (const std::string& name: clockNetNames) {\n                odb::dbNet* net = _block->findNet(name.c_str());\n                if (!net) {\n                        std::cout << \" [WARNING] Net \\\"\" << name << \"\\\" not in design. Skipping...\\n\";\n                        continue;\n                } \n                \n                std::cout << \" Net \\\"\" << name << \"\\\" found\\n\";\n                initClockNet(net);\n        }\n}       \n\nvoid DBWrapper::initClockNet(odb::dbNet* net) {\n        odb::dbBTerm* bterm = net->get1stBTerm(); \/\/ Clock pin\n        int xPin, yPin;\n        bterm->getFirstPinLocation(xPin, yPin);\n\n        \/\/ Initialize clock net\n        ClockNet clockNet(net->getConstName(), \n                          bterm->getConstName(),\n                          xPin, yPin);\n        \n        odb::dbSet<odb::dbITerm> iterms = net->getITerms(); \n        odb::dbSet<odb::dbITerm>::iterator itr;\n        for (itr = iterms.begin(); itr != iterms.end(); ++itr) {\n                odb::dbITerm* iterm = *itr;\n                odb::dbInst* inst = iterm->getInst();\n                odb::dbMTerm* mterm = iterm->getMTerm();\n                std::string name = std::string(inst->getConstName()) + \"\/\" +  \n                                   std::string(mterm->getConstName());\n                DBU x, y;\n                computeSinkPosition(iterm, x, y);\n                clockNet.addSink(name, x, y);\n                \/\/std::cout << name << \" \" << x << \" \" << y << \"\\n\";\n        }\n\n        _kernel->addBuilder(new HTreeBuilder(*_parms, clockNet));\n}\n\nvoid DBWrapper::parseClockNetNames(std::vector<std::string>& clockNetNames) const {\n        std::stringstream allNames(_parms->getClockNets());\n\n        std::string tmpName = \"\";\n        while (allNames >> tmpName) {\n                clockNetNames.push_back(tmpName);\n        } \n        \n        unsigned numClockNets = clockNetNames.size();\n        std::cout << \" Number of user-input clocks: \" << numClockNets;\n\n        if (numClockNets > 0) {\n                std::cout << \" (\";\n                for (const std::string& name: clockNetNames) {\n                        std::cout << \" \\\"\" << name << \"\\\"\";\n                }\n                std::cout << \" )\\n\";\n        } else {\n                std::cout << \"\\n\";\n                std::cout << \" [ERROR] User did not specify clock nets.\\n\";\n                std::cout << \"         Try add set_clock_nets <names> to your script.\\n\";\n                std::cout << \"         TritonCTS is exiting...\\n\";\n                std::exit(1);\n\n        } \n}\n\nvoid DBWrapper::computeSinkPosition(odb::dbITerm* term, DBU &x, DBU &y) const {\n        odb::dbITermShapeItr itr;\n        \n        odb::dbShape shape;\n        x = 0;\n        y = 0;\n        unsigned numShapes = 0;\n        for (itr.begin(term); itr.next(shape); ) {\n                if (shape.isVia()) {\n                        continue;\n                } else {\n                        x += shape.xMin() + (shape.xMax() - shape.xMin()) \/ 2;\n                        y += shape.yMin() + (shape.yMax() - shape.yMin()) \/ 2;\n                        ++numShapes;                 \n                }\n        }\n\n        x \/= numShapes;\n        y \/= numShapes;\n};  \n\nvoid DBWrapper::writeClockNetsToDb(const ClockNet& clockNet) {\n        disconnectAllSinksFromNet(clockNet.getName());\n        \n        createClockBuffers(clockNet);      \n       \n        \/\/ connect top buffer on the clock pin\n        odb::dbNet* topClockNet = _block->findNet(clockNet.getName().c_str());\n        odb::dbInst* topClockInst = _block->findInst(\"clkbuf_0\");\n        odb::dbITerm* topClockInstInputPin = getFirstInput(topClockInst); \n        odb::dbITerm::connect(topClockInstInputPin, topClockNet); \n\n        \/\/ create subNets \n        clockNet.forEachSubNet( [&] (const ClockNet::SubNet& subNet) {\n                        \/\/std::cout << \"    SubNet: \" << subNet.getName() << \"\\n\";\n                        odb::dbNet* clkSubNet = odb::dbNet::create(_block, subNet.getName().c_str());\n\n                        \/\/std::cout << \"      Driver: \" << subNet.getDriver()->getName() << \"\\n\";\n                       \n                        odb::dbInst* driver = _block->findInst(subNet.getDriver()->getName().c_str());\n                        odb::dbITerm* outputPin = driver->getFirstOutput();\n                        odb::dbITerm::connect(outputPin, clkSubNet); \n\n                        subNet.forEachSink( [&] (ClockInstance *inst) {\n                                \/\/std::cout << \"      \" << inst->getName() << \"\\n\";\n                                odb::dbITerm* inputPin = nullptr;\n                                if (inst->isClockBuffer()) { \n                                        odb::dbInst* sink = _block->findInst(inst->getName().c_str());\n                                        inputPin = getFirstInput(sink);\n                                } else {\n                                        inputPin = _block->findITerm(inst->getName().c_str());\n                                }\n                                odb::dbITerm::connect(inputPin, clkSubNet); \n                        });\n                });       \n}\n\nvoid DBWrapper::disconnectAllSinksFromNet(std::string netName) {\n        odb::dbNet* net = _block->findNet(netName.c_str());\n        odb::dbSet<odb::dbITerm> iterms = net->getITerms(); \n        odb::dbSet<odb::dbITerm>::iterator itr;\n        for (itr = iterms.begin(); itr != iterms.end(); ++itr) {\n                odb::dbITerm* iterm = *itr;\n                odb::dbITerm::disconnect(iterm);\n        }\n}\n\nvoid DBWrapper::createClockBuffers(const ClockNet& clockNet) {\n        unsigned numBuffers = 0;\n        clockNet.forEachClockBuffer([&] (const ClockInstance& inst) {\n                \/\/std::cout << inst.getName() << \" (\" << inst.getMaster() \n                \/\/          << \")\\n\";\n                odb::dbMaster* master = _db->findMaster(inst.getMaster().c_str());\n                odb::dbInst* newInst = odb::dbInst::create(_block, master, inst.getName().c_str());\n                newInst->setLocation(inst.getX(), inst.getY());        \n                newInst->setPlacementStatus(odb::dbPlacementStatus::PLACED);\n                ++numBuffers;\n        });\n\n        \/\/std::cout << \"    \" << numBuffers << \" clock buffers created in to DB\\n\";\n\n}\n\nodb::dbITerm* DBWrapper::getFirstInput(odb::dbInst* inst) const {\n        odb::dbSet<odb::dbITerm> iterms = inst->getITerms();\n        odb::dbSet<odb::dbITerm>::iterator itr;\n        \n        for (itr = iterms.begin(); itr != iterms.end(); ++itr) {\n                odb::dbITerm* iterm = *itr;\n                if (iterm->isInputSignal()) {\n                        return iterm;\n                } \n        }\n        \n        return nullptr;\n}\n\n}\n<commit_msg>Set type of clock sub nets as CLOCK<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Authors: Mateus Fogaca\n\/\/          (Ph.D. advisor: Ricardo Reis)\n\/\/          Jiajia Li\n\/\/          Andrew Kahng\n\/\/ Based on:\n\/\/          K. Han, A. B. Kahng and J. Li, \"Optimal Generalized H-Tree Topology and \n\/\/          Buffering for High-Performance and Low-Power Clock Distribution\", \n\/\/          IEEE Trans. on CAD (2018), doi:10.1109\/TCAD.2018.2889756.\n\/\/\n\/\/\n\/\/ BSD 3-Clause License\n\/\/\n\/\/ Copyright (c) 2018, 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 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 \"DBWrapper.h\"\n#include \"TritonCTSKernel.h\"\n#include \"HTreeBuilder.h\"\n\n\/\/ DB includes\n#include \"db.h\"\n#include \"dbShape.h\"\n#include \"dbTypes.h\"\n\n#include <iostream>\n#include <sstream>\n\nnamespace TritonCTS {\n\nDBWrapper::DBWrapper(ParametersForCTS& parms,\n                     TritonCTSKernel& kernel) {\n        _parms  = &parms;\n        _kernel = &kernel;\n}\n\nvoid DBWrapper::populateTritonCTS() {\n       initDB();\n       initAllClockNets(); \n}\n\nvoid DBWrapper::initDB() {\n        _db    = odb::dbDatabase::getDatabase(_parms->getDbId());\n        _chip  = _db->getChip();\n        _block = _chip->getBlock();\n        _parms->setDbUnits(_block->getDbUnitsPerMicron());\n}\n\nvoid DBWrapper::initAllClockNets() {\n        std::cout << \" Initializing clock nets\\n\";\n        \n        std::vector<std::string> clockNetNames;\n        parseClockNetNames(clockNetNames);\n\n        std::cout << \" Looking for clock nets in the design\\n\";\n        for (const std::string& name: clockNetNames) {\n                odb::dbNet* net = _block->findNet(name.c_str());\n                if (!net) {\n                        std::cout << \" [WARNING] Net \\\"\" << name << \"\\\" not in design. Skipping...\\n\";\n                        continue;\n                } \n                \n                std::cout << \" Net \\\"\" << name << \"\\\" found\\n\";\n                initClockNet(net);\n        }\n}       \n\nvoid DBWrapper::initClockNet(odb::dbNet* net) {\n        odb::dbBTerm* bterm = net->get1stBTerm(); \/\/ Clock pin\n        int xPin, yPin;\n        bterm->getFirstPinLocation(xPin, yPin);\n\n        \/\/ Initialize clock net\n        ClockNet clockNet(net->getConstName(), \n                          bterm->getConstName(),\n                          xPin, yPin);\n        \n        odb::dbSet<odb::dbITerm> iterms = net->getITerms(); \n        odb::dbSet<odb::dbITerm>::iterator itr;\n        for (itr = iterms.begin(); itr != iterms.end(); ++itr) {\n                odb::dbITerm* iterm = *itr;\n                odb::dbInst* inst = iterm->getInst();\n                odb::dbMTerm* mterm = iterm->getMTerm();\n                std::string name = std::string(inst->getConstName()) + \"\/\" +  \n                                   std::string(mterm->getConstName());\n                DBU x, y;\n                computeSinkPosition(iterm, x, y);\n                clockNet.addSink(name, x, y);\n                \/\/std::cout << name << \" \" << x << \" \" << y << \"\\n\";\n        }\n\n        _kernel->addBuilder(new HTreeBuilder(*_parms, clockNet));\n}\n\nvoid DBWrapper::parseClockNetNames(std::vector<std::string>& clockNetNames) const {\n        std::stringstream allNames(_parms->getClockNets());\n\n        std::string tmpName = \"\";\n        while (allNames >> tmpName) {\n                clockNetNames.push_back(tmpName);\n        } \n        \n        unsigned numClockNets = clockNetNames.size();\n        std::cout << \" Number of user-input clocks: \" << numClockNets;\n\n        if (numClockNets > 0) {\n                std::cout << \" (\";\n                for (const std::string& name: clockNetNames) {\n                        std::cout << \" \\\"\" << name << \"\\\"\";\n                }\n                std::cout << \" )\\n\";\n        } else {\n                std::cout << \"\\n\";\n                std::cout << \" [ERROR] User did not specify clock nets.\\n\";\n                std::cout << \"         Try add set_clock_nets <names> to your script.\\n\";\n                std::cout << \"         TritonCTS is exiting...\\n\";\n                std::exit(1);\n\n        } \n}\n\nvoid DBWrapper::computeSinkPosition(odb::dbITerm* term, DBU &x, DBU &y) const {\n        odb::dbITermShapeItr itr;\n        \n        odb::dbShape shape;\n        x = 0;\n        y = 0;\n        unsigned numShapes = 0;\n        for (itr.begin(term); itr.next(shape); ) {\n                if (shape.isVia()) {\n                        continue;\n                } else {\n                        x += shape.xMin() + (shape.xMax() - shape.xMin()) \/ 2;\n                        y += shape.yMin() + (shape.yMax() - shape.yMin()) \/ 2;\n                        ++numShapes;                 \n                }\n        }\n\n        x \/= numShapes;\n        y \/= numShapes;\n};  \n\nvoid DBWrapper::writeClockNetsToDb(const ClockNet& clockNet) {\n        disconnectAllSinksFromNet(clockNet.getName());\n        \n        createClockBuffers(clockNet);      \n       \n        \/\/ connect top buffer on the clock pin\n        odb::dbNet* topClockNet = _block->findNet(clockNet.getName().c_str());\n        odb::dbInst* topClockInst = _block->findInst(\"clkbuf_0\");\n        odb::dbITerm* topClockInstInputPin = getFirstInput(topClockInst); \n        odb::dbITerm::connect(topClockInstInputPin, topClockNet); \n        topClockNet->setSigType(odb::dbSigType::CLOCK);\n\n        \/\/ create subNets \n        clockNet.forEachSubNet( [&] (const ClockNet::SubNet& subNet) {\n                        \/\/std::cout << \"    SubNet: \" << subNet.getName() << \"\\n\";\n                        odb::dbNet* clkSubNet = odb::dbNet::create(_block, subNet.getName().c_str());\n                        clkSubNet->setSigType(odb::dbSigType::CLOCK);\n                        \n                        \/\/std::cout << \"      Driver: \" << subNet.getDriver()->getName() << \"\\n\";\n                       \n                        odb::dbInst* driver = _block->findInst(subNet.getDriver()->getName().c_str());\n                        odb::dbITerm* outputPin = driver->getFirstOutput();\n                        odb::dbITerm::connect(outputPin, clkSubNet); \n\n                        subNet.forEachSink( [&] (ClockInstance *inst) {\n                                \/\/std::cout << \"      \" << inst->getName() << \"\\n\";\n                                odb::dbITerm* inputPin = nullptr;\n                                if (inst->isClockBuffer()) { \n                                        odb::dbInst* sink = _block->findInst(inst->getName().c_str());\n                                        inputPin = getFirstInput(sink);\n                                } else {\n                                        inputPin = _block->findITerm(inst->getName().c_str());\n                                }\n                                odb::dbITerm::connect(inputPin, clkSubNet); \n                        });\n                });       \n}\n\nvoid DBWrapper::disconnectAllSinksFromNet(std::string netName) {\n        odb::dbNet* net = _block->findNet(netName.c_str());\n        odb::dbSet<odb::dbITerm> iterms = net->getITerms(); \n        odb::dbSet<odb::dbITerm>::iterator itr;\n        for (itr = iterms.begin(); itr != iterms.end(); ++itr) {\n                odb::dbITerm* iterm = *itr;\n                odb::dbITerm::disconnect(iterm);\n        }\n}\n\nvoid DBWrapper::createClockBuffers(const ClockNet& clockNet) {\n        unsigned numBuffers = 0;\n        clockNet.forEachClockBuffer([&] (const ClockInstance& inst) {\n                \/\/std::cout << inst.getName() << \" (\" << inst.getMaster() \n                \/\/          << \")\\n\";\n                odb::dbMaster* master = _db->findMaster(inst.getMaster().c_str());\n                odb::dbInst* newInst = odb::dbInst::create(_block, master, inst.getName().c_str());\n                newInst->setLocation(inst.getX(), inst.getY());        \n                newInst->setPlacementStatus(odb::dbPlacementStatus::PLACED);\n                ++numBuffers;\n        });\n\n        \/\/std::cout << \"    \" << numBuffers << \" clock buffers created in to DB\\n\";\n\n}\n\nodb::dbITerm* DBWrapper::getFirstInput(odb::dbInst* inst) const {\n        odb::dbSet<odb::dbITerm> iterms = inst->getITerms();\n        odb::dbSet<odb::dbITerm>::iterator itr;\n        \n        for (itr = iterms.begin(); itr != iterms.end(); ++itr) {\n                odb::dbITerm* iterm = *itr;\n                if (iterm->isInputSignal()) {\n                        return iterm;\n                } \n        }\n        \n        return nullptr;\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"VoxelViewer.h\"\n#include \"visualizer\/atengl.h\"\n\nstatic const aten::vec4 VoxelVtxs[] = {\n\taten::vec4( 0,  1,  1, 1),\n\taten::vec4( 0,  0,  1, 1),\n\taten::vec4( 1,  1,  1, 1),\n\taten::vec4( 1,  0,  1, 1),\n\n\taten::vec4(0,  1,  0, 1),\n\taten::vec4(0,  0,  0, 1),\n\taten::vec4(1,  1,  0, 1),\n\taten::vec4(1,  0,  0, 1),\n};\n\nstatic const uint32_t VoxelIdxs[] = {\n\t\/\/ +X\n\t2, 3, 6,\n\t6, 3, 7,\n\n\t\/\/ -X\n\t0, 4, 1,\n\t4, 5, 1,\n\n\t\/\/ +Y\n\t4, 0, 6,\n\t6, 0, 2,\n\n\t\/\/ -Y\n\t1, 5, 3,\n\t3, 5, 7,\n\n\t\/\/ +Z\n\t0, 1, 2,\n\t2, 1, 3,\n\n\t\/\/ -Z\n\t6, 7, 4,\n\t4, 7, 5,\n};\n\nstatic const uint32_t VoxelWireFrameIdxs[] = {\n\t0, 1,\n\t0, 2,\n\t1, 3,\n\t2, 3,\n\n\t4, 5,\n\t4, 6,\n\t5, 7,\n\t6, 7,\n\n\t2, 6,\n\t3, 7,\n\n\t0, 4,\n\t1, 5,\n};\n\n\nbool VoxelViewer::init(\n\tint width, int height,\n\tconst char* pathVS,\n\tconst char* pathFS)\n{\n\tm_width = width;\n\tm_height = height;\n\n\tstatic const aten::VertexAttrib attribs[] = {\n\t\t{ GL_FLOAT, 3, sizeof(GLfloat), 0 },\n\t};\n\n\t\/\/ vertex buffer.\n\tm_vb.init(\n\t\tsizeof(aten::vec4), \n\t\tAT_COUNTOF(VoxelVtxs), \n\t\t0, \n\t\tattribs,\n\t\tAT_COUNTOF(attribs),\n\t\tVoxelVtxs);\n\n\t\/\/ index buffer.\n\tm_ib.init(AT_COUNTOF(VoxelIdxs), VoxelIdxs);\n\n\tm_ibForWireframe.init(AT_COUNTOF(VoxelWireFrameIdxs), VoxelWireFrameIdxs);\n\n\treturn m_shader.init(width, height, pathVS, pathFS);\n}\n\nvoid VoxelViewer::draw(\n\tconst aten::camera* cam,\n\tconst std::vector<std::vector<aten::ThreadedSbvhNode>>& nodes,\n\tconst std::vector<aten::BvhVoxel>& voxels,\n\tbool isWireframe,\n\tint drawVoxelIdx)\n{\n\tm_shader.prepareRender(nullptr, false);\n\n\tCALL_GL_API(::glClearColor(0, 0, 1, 0));\n\tCALL_GL_API(::glClearDepthf(1.0f));\n\tCALL_GL_API(::glClearStencil(0));\n\tCALL_GL_API(::glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT | GL_STENCIL_BUFFER_BIT));\n\n\tCALL_GL_API(::glEnable(GL_DEPTH_TEST));\n\tCALL_GL_API(::glEnable(GL_CULL_FACE));\n\n\tauto camparam = cam->param();\n\n\t\/\/ TODO\n\tcamparam.znear = real(0.1);\n\tcamparam.zfar = real(10000.0);\n\n\taten::mat4 mtxW2V;\n\taten::mat4 mtxV2C;\n\n\tmtxW2V.lookat(\n\t\tcamparam.origin,\n\t\tcamparam.center,\n\t\tcamparam.up);\n\n\tmtxV2C.perspective(\n\t\tcamparam.znear,\n\t\tcamparam.zfar,\n\t\tcamparam.vfov,\n\t\tcamparam.aspect);\n\n\taten::mat4 mtxW2C = mtxV2C * mtxW2V;\n\n\tauto hMtxW2C = m_shader.getHandle(\"mtxW2C\");\n\tCALL_GL_API(::glUniformMatrix4fv(hMtxW2C, 1, GL_TRUE, &mtxW2C.a[0]));\n\n\taten::mat4 mtxL2W;\n\n\tauto hMtxL2W = m_shader.getHandle(\"mtxL2W\");\n\tauto hColor = m_shader.getHandle(\"color\");\n\tauto hNormal = m_shader.getHandle(\"normal\");\n\n\t\/\/ NOTE\n\t\/\/ BoxȂ̂ŁAPʓOp`Q‚ŁAU.\n\tstatic const int PrimCnt = 2 * 6;\n\n\tfor (size_t i = 0; i < voxels.size(); i++) {\n\t\tif (drawVoxelIdx >= 0 && i != drawVoxelIdx) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tconst auto& voxel = voxels[i];\n\n\t\tconst auto& node = nodes[voxel.exid][voxel.nodeid];\n\n\t\tauto size = node.boxmax - node.boxmin;\n\n\t\taten::mat4 mtxScale;\n\t\taten::mat4 mtxTrans;\n\n\t\tmtxScale.asScale(size);\n\t\tmtxTrans.asTrans(node.boxmin);\n\n\t\tmtxL2W = mtxTrans * mtxScale;\n\n\t\taten::vec3 normal = voxel.nml;\n\n\t\taten::vec3 color = voxel.clr;\n\n\t\tCALL_GL_API(::glUniformMatrix4fv(hMtxL2W, 1, GL_TRUE, &mtxL2W.a[0]));\n\t\tCALL_GL_API(::glUniform3f(hColor, color.x, color.y, color.z));\n\t\tCALL_GL_API(::glUniform3f(hNormal, normal.x, normal.y, normal.z));\n\n\t\tif (isWireframe) {\n\t\t\tm_ibForWireframe.draw(m_vb, aten::Primitive::Lines, 0, 12);\n\t\t}\n\t\telse {\n\t\t\tm_ib.draw(m_vb, aten::Primitive::Triangles, 0, PrimCnt);\n\t\t}\n\t}\n}\n<commit_msg>Modify background color.<commit_after>#include \"VoxelViewer.h\"\n#include \"visualizer\/atengl.h\"\n\nstatic const aten::vec4 VoxelVtxs[] = {\n\taten::vec4( 0,  1,  1, 1),\n\taten::vec4( 0,  0,  1, 1),\n\taten::vec4( 1,  1,  1, 1),\n\taten::vec4( 1,  0,  1, 1),\n\n\taten::vec4(0,  1,  0, 1),\n\taten::vec4(0,  0,  0, 1),\n\taten::vec4(1,  1,  0, 1),\n\taten::vec4(1,  0,  0, 1),\n};\n\nstatic const uint32_t VoxelIdxs[] = {\n\t\/\/ +X\n\t2, 3, 6,\n\t6, 3, 7,\n\n\t\/\/ -X\n\t0, 4, 1,\n\t4, 5, 1,\n\n\t\/\/ +Y\n\t4, 0, 6,\n\t6, 0, 2,\n\n\t\/\/ -Y\n\t1, 5, 3,\n\t3, 5, 7,\n\n\t\/\/ +Z\n\t0, 1, 2,\n\t2, 1, 3,\n\n\t\/\/ -Z\n\t6, 7, 4,\n\t4, 7, 5,\n};\n\nstatic const uint32_t VoxelWireFrameIdxs[] = {\n\t0, 1,\n\t0, 2,\n\t1, 3,\n\t2, 3,\n\n\t4, 5,\n\t4, 6,\n\t5, 7,\n\t6, 7,\n\n\t2, 6,\n\t3, 7,\n\n\t0, 4,\n\t1, 5,\n};\n\n\nbool VoxelViewer::init(\n\tint width, int height,\n\tconst char* pathVS,\n\tconst char* pathFS)\n{\n\tm_width = width;\n\tm_height = height;\n\n\tstatic const aten::VertexAttrib attribs[] = {\n\t\t{ GL_FLOAT, 3, sizeof(GLfloat), 0 },\n\t};\n\n\t\/\/ vertex buffer.\n\tm_vb.init(\n\t\tsizeof(aten::vec4), \n\t\tAT_COUNTOF(VoxelVtxs), \n\t\t0, \n\t\tattribs,\n\t\tAT_COUNTOF(attribs),\n\t\tVoxelVtxs);\n\n\t\/\/ index buffer.\n\tm_ib.init(AT_COUNTOF(VoxelIdxs), VoxelIdxs);\n\n\tm_ibForWireframe.init(AT_COUNTOF(VoxelWireFrameIdxs), VoxelWireFrameIdxs);\n\n\treturn m_shader.init(width, height, pathVS, pathFS);\n}\n\nvoid VoxelViewer::draw(\n\tconst aten::camera* cam,\n\tconst std::vector<std::vector<aten::ThreadedSbvhNode>>& nodes,\n\tconst std::vector<aten::BvhVoxel>& voxels,\n\tbool isWireframe,\n\tint drawVoxelIdx)\n{\n\tm_shader.prepareRender(nullptr, false);\n\n\tCALL_GL_API(::glClearColor(0, 0.5f, 1.0f, 1.0f));\n\tCALL_GL_API(::glClearDepthf(1.0f));\n\tCALL_GL_API(::glClearStencil(0));\n\tCALL_GL_API(::glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT | GL_STENCIL_BUFFER_BIT));\n\n\tCALL_GL_API(::glEnable(GL_DEPTH_TEST));\n\tCALL_GL_API(::glEnable(GL_CULL_FACE));\n\n\tauto camparam = cam->param();\n\n\t\/\/ TODO\n\tcamparam.znear = real(0.1);\n\tcamparam.zfar = real(10000.0);\n\n\taten::mat4 mtxW2V;\n\taten::mat4 mtxV2C;\n\n\tmtxW2V.lookat(\n\t\tcamparam.origin,\n\t\tcamparam.center,\n\t\tcamparam.up);\n\n\tmtxV2C.perspective(\n\t\tcamparam.znear,\n\t\tcamparam.zfar,\n\t\tcamparam.vfov,\n\t\tcamparam.aspect);\n\n\taten::mat4 mtxW2C = mtxV2C * mtxW2V;\n\n\tauto hMtxW2C = m_shader.getHandle(\"mtxW2C\");\n\tCALL_GL_API(::glUniformMatrix4fv(hMtxW2C, 1, GL_TRUE, &mtxW2C.a[0]));\n\n\taten::mat4 mtxL2W;\n\n\tauto hMtxL2W = m_shader.getHandle(\"mtxL2W\");\n\tauto hColor = m_shader.getHandle(\"color\");\n\tauto hNormal = m_shader.getHandle(\"normal\");\n\n\t\/\/ NOTE\n\t\/\/ BoxȂ̂ŁAPʓOp`Q‚ŁAU.\n\tstatic const int PrimCnt = 2 * 6;\n\n\tfor (size_t i = 0; i < voxels.size(); i++) {\n\t\tif (drawVoxelIdx >= 0 && i != drawVoxelIdx) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tconst auto& voxel = voxels[i];\n\n\t\tconst auto& node = nodes[voxel.exid][voxel.nodeid];\n\n\t\tauto size = node.boxmax - node.boxmin;\n\n\t\taten::mat4 mtxScale;\n\t\taten::mat4 mtxTrans;\n\n\t\tmtxScale.asScale(size);\n\t\tmtxTrans.asTrans(node.boxmin);\n\n\t\tmtxL2W = mtxTrans * mtxScale;\n\n\t\taten::vec3 normal = voxel.nml;\n\n\t\taten::vec3 color = voxel.clr;\n\n\t\tCALL_GL_API(::glUniformMatrix4fv(hMtxL2W, 1, GL_TRUE, &mtxL2W.a[0]));\n\t\tCALL_GL_API(::glUniform3f(hColor, color.x, color.y, color.z));\n\t\tCALL_GL_API(::glUniform3f(hNormal, normal.x, normal.y, normal.z));\n\n\t\tif (isWireframe) {\n\t\t\tm_ibForWireframe.draw(m_vb, aten::Primitive::Lines, 0, 12);\n\t\t}\n\t\telse {\n\t\t\tm_ib.draw(m_vb, aten::Primitive::Triangles, 0, PrimCnt);\n\t\t}\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * main.cpp -- This file is part of primesieve\n *\n * Copyright (C) 2011 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\/** \n * @file  main.cpp\n * @brief Command-line version of primesieve, multi-threaded (OpenMP),\n *        compiles on many platforms.\n *\n * primesieve is a highly optimized implementation of the sieve of\n * Eratosthenes that generates prime numbers and prime k-tuplets (twin\n * primes, prime triplets, ...) up to 2^64 maximum.\n *\/\n\n#include \"..\/expr\/ExpressionParser.h\"\n#include \"..\/soe\/ParallelPrimeSieve.h\"\n#include \"..\/soe\/pmath.h\"\n\n\/\/\/ declared in test.cpp\nvoid test();\n\n#include <stdint.h>\n#include <exception>\n#include <iostream>\n#include <iomanip>    \/* std::setw(int) *\/\n#include <cstdlib>    \/* std::exit(int) *\/\n#include <string>\n#include <cctype>     \/* std::tolower(int) *\/\n\nnamespace {\n  \/\/ Unfortunately there is no easy way to get the CPU L1 and L2 cache\n  \/\/ size, these values are close for most x86-64 CPUs in 2011\n  const uint32_t L1_CACHE_SIZE = 64;\n  const uint32_t L2_CACHE_SIZE = 512;\n  const uint64_t L2_THRESHOLD = ipow(10, 13);\n\n  bool quietMode = false;\n  bool showExpressionResults = false;\n\n  uint64_t numbers[2] = {0, 0};  \/* start and stop number for sieving *\/\n  uint32_t sieveSize = 0;        \/* sieve size in KiloBytes *\/\n  uint32_t flags = 0;            \/* settings *\/\n\n  int maxThreads = ParallelPrimeSieve::getMaxThreads();\n  int threads = -1;\n\n  std::string primes[7] = { \"Prime numbers\", \"Twin primes\", \"Prime triplets\",\n    \"Prime quadruplets\", \"Prime quintuplets\", \"Prime sextuplets\",\n    \"Prime septuplets\" };\n}\n\nvoid version() {\n  std::cout << \"primesieve 2.1, <http:\/\/primesieve.googlecode.com>\" << std::endl\n            << \"Copyright (C) 2011 Kim Walisch\" << std::endl\n            << \"License GPLv3+: GNU GPL version 3 or later <http:\/\/gnu.org\/licenses\/gpl.html>.\" << std::endl\n            << \"This is free software: you are free to change and redistribute it.\" << std::endl\n            << \"There is NO WARRANTY, to the extent permitted by law.\" << std::endl;\n  std::exit(EXIT_SUCCESS);\n}\n\nvoid help() {\n  std::cout << \"Usage: primesieve START STOP [OPTION]...\" << std::endl\n            << \"Use the sieve of Eratosthenes to find the prime numbers and prime\" << std::endl\n            << \"k-tuplets between START and STOP < 2^64\" << std::endl\n            << std::endl\n            << \"Examples:\" << std::endl\n            << \"  primesieve 1 10000000 -p1\" << std::endl\n            << \"  primesieve 1 1e11 -s 32\" << std::endl\n            << \"  primesieve 1e18 1e18+2**32 -c1234567\" << std::endl\n            << std::endl\n            << \"Options:\" << std::endl\n            << \"  -c[N]        Count prime numbers and\/or prime k-tuplets,\" << std::endl\n            << \"               e.g -c1 count prime numbers, -c3 count prime triplets, ...\" << std::endl\n            << \"               N >= 1 and N <= 7\" << std::endl\n            << \"  -p[N]        Print prime numbers or prime k-tuplets,\" << std::endl\n            << \"               e.g -p1 print prime numbers, -p2 print twin primes, ...\" << std::endl\n            << \"               N >= 1 and N <= 7\" << std::endl\n            << \"  -q           Quiet mode, print less output\" << std::endl\n            << \"  -s <SIZE>    Set the sieve size in KiloBytes, e.g. -s 256,\" << std::endl\n            << \"               set SIZE to your CPU's L1\/L2 cache size for best performance\" << std::endl\n            << \"               SIZE >= 1 and SIZE <= 8192\" << std::endl\n            << \"  -t <THREADS> Set the number of threads for sieving, e.g. -t 4,\" << std::endl\n            << \"               THREADS >= 1 and THREADS <= \" << maxThreads << \" (CPU max threads)\" << std::endl\n            << \"  -test        Run various sieving tests and exit\" << std::endl\n            << \"  -v           Print version and license information and exit\" << std::endl;\n  std::exit(EXIT_SUCCESS);\n}\n\nbool isDigits(const std::string &str) {\n  if (str.length() == 0)\n    return false;\n  return str.find_first_not_of(\"0123456789\") == std::string::npos;\n}\n\n\/**\n * Process the command-line options.\n * @see help(void)\n *\/\nvoid processOptions(int argc, char* argv[]) {\n  if (argc < 2 || argc > 20)\n    help();\n  ExpressionParser<uint64_t> parser;\n  int i = 1;\n\n  \/\/ process the START and STOP numbers\n  if (argc > 2)\n    for (; i <= 2; i++) {\n      if (!parser.eval(argv[i])) {\n        std::cerr << \"Error: \\\"\" << argv[i]  << \"\\\" is not a valid arithmetic expression\" << std::endl\n                  << \"Try `primesieve -help' for more information.\" << std::endl;\n        std::exit(EXIT_FAILURE);\n      }\n      numbers[i-1] = parser.getResult();\n      if (!isDigits(argv[i]))\n        showExpressionResults = true;\n    }\n\n  \/\/ process the options ([OPTION]...)\n  for (; i < argc; i++) {\n    char* c = argv[i];\n    if (*c != '-' && *c != '\/')\n      help();\n    switch (std::tolower(*(++c)++)) {\n      case 'c': do {\n                  if (*c < '1' || *c > '7')\n                    help();\n                  flags |= COUNT_PRIMES << (*c - '1');\n                } while (*(++c) != 0);\n                break;\n      case 'p': if (*c < '1' || *c > '7')\n                  help();\n                flags |= PRINT_PRIMES << (*c - '1');\n                quietMode = true;\n                break;\n      case 'q': quietMode = true;\n                break;\n      case 's': if (++i >= argc || !parser.eval(argv[i]))\n                  help();\n                sieveSize = static_cast<uint32_t> (parser.getResult());\n                sieveSize = nextHighestPowerOf2(sieveSize);\n                break;\n      case 't': if (std::string(\"test\").compare(++argv[i]) == 0) {\n                  test();\n                  std::exit(EXIT_SUCCESS);\n                }\n                if (++i >= argc || !parser.eval(argv[i]))\n                  help();\n                threads = static_cast<int> (parser.getResult());\n                break;\n      case 'v': version();\n      default : help();\n    }\n  }\n}\n\n\/**\n * Process the command-line options and start sieving.\n *\/\nint main(int argc, char* argv[]) {\n  processOptions(argc, argv);\n  std::cout.setf(std::ios::left);\n\n  \/\/ display expression results\n  if (!quietMode && showExpressionResults)\n    std::cout << std::setw(10) << \"START\" << \" = \" << numbers[0] << std::endl\n              << std::setw(10) << \"STOP\"  << \" = \" << numbers[1]  << std::endl;\n\n  \/\/ set default settings\n  if ((flags & COUNT_FLAGS) == 0 && (flags & PRINT_FLAGS) == 0)\n    flags |= COUNT_PRIMES;\n  if (!quietMode && (flags & PRINT_FLAGS) == 0)\n    flags |= PRINT_STATUS;\n  if (sieveSize == 0)\n    sieveSize = (numbers[1] < L2_THRESHOLD) ?L1_CACHE_SIZE :L2_CACHE_SIZE;\n\n  if (!quietMode)\n    std::cout << std::setw(10) << \"Sieve size\" << \" = \" << sieveSize\n              << \" KiloBytes\" << std::endl;\n  try {\n    \/\/ init primeSieve\n    ParallelPrimeSieve primeSieve;\n    primeSieve.setStartNumber(numbers[0]);\n    primeSieve.setStopNumber(numbers[1]);\n    primeSieve.setSieveSize(sieveSize);\n    primeSieve.setFlags(flags);\n\n    if (threads == -1)\n      threads = primeSieve.getIdealThreadCount();\n    if (!quietMode)\n      std::cout << std::setw(10) << \"Threads\" << \" = \" << threads << std::endl;\n\n    \/\/ start sieving primes\n    primeSieve.sieve(threads);\n\n    \/\/ print new line\n    if ((flags & PRINT_STATUS) || (\n        (flags & PRINT_FLAGS) &&\n        (flags & COUNT_FLAGS) ))\n      std::cout << std::endl;\n\n    \/\/ get max output width\n    std::size_t width = (quietMode) ?0 :12;\n    for (int i = 0; i < primeSieve.COUNTS_SIZE; i++)\n      if ((flags & (COUNT_PRIMES << i)) && width < primes[i].length())\n        width = primes[i].length();\n\n    \/\/ print prime count results\n    for (int i = 0; i < primeSieve.COUNTS_SIZE; i++)\n      if (flags & (COUNT_PRIMES << i))\n        std::cout << std::setw(static_cast<int> (width)) << primes[i] << \" : \"\n                  << primeSieve.getCounts(i) << std::endl;\n\n    \/\/ print time elapsed\n    if (!quietMode)\n      std::cout << std::setw(static_cast<int> (width)) << \"Time elapsed\" << \" : \"\n                << primeSieve.getTimeElapsed() << \" sec\" << std::endl;\n  }\n  catch (std::exception& ex) {\n    std::cerr << \"Error: \" << ex.what() << std::endl\n              << \"Try `primesieve -help' for more information.\" << std::endl;\n    std::exit(EXIT_FAILURE);\n  }\n  return 0;\n}\n<commit_msg>thread interface of ParallelPrimeSieve has changed<commit_after>\/*\n * main.cpp -- This file is part of primesieve\n *\n * Copyright (C) 2011 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\/** \n * @file  main.cpp\n * @brief Command-line version of primesieve, multi-threaded (OpenMP),\n *        compiles on many platforms.\n *\n * primesieve is a highly optimized implementation of the sieve of\n * Eratosthenes that generates prime numbers and prime k-tuplets (twin\n * primes, prime triplets, ...) up to 2^64 maximum.\n *\/\n\n#include \"..\/expr\/ExpressionParser.h\"\n#include \"..\/soe\/ParallelPrimeSieve.h\"\n#include \"..\/soe\/pmath.h\"\n\n\/\/\/ declared in test.cpp\nvoid test();\n\n#include <stdint.h>\n#include <exception>\n#include <iostream>\n#include <iomanip>    \/* std::setw(int) *\/\n#include <cstdlib>    \/* std::exit(int) *\/\n#include <string>\n#include <cctype>     \/* std::tolower(int) *\/\n\nnamespace {\n  \/\/ Unfortunately there is no easy way to get the CPU L1 and L2 cache\n  \/\/ size, these values are close for most x86-64 CPUs in 2011\n  const uint32_t L1_CACHE_SIZE = 64;\n  const uint32_t L2_CACHE_SIZE = 512;\n  const uint64_t L2_THRESHOLD = ipow(10, 13);\n\n  bool quietMode = false;\n  bool showExpressionResults = false;\n\n  uint64_t numbers[2] = {0, 0};  \/* start and stop number for sieving *\/\n  uint32_t sieveSize = 0;        \/* sieve size in KiloBytes *\/\n  uint32_t flags = 0;            \/* settings *\/\n\n  int maxThreads = ParallelPrimeSieve::getMaxThreads();\n  int threads    = ParallelPrimeSieve::USE_IDEAL_NUM_THREADS;\n\n  std::string primes[7] = { \"Prime numbers\", \"Twin primes\", \"Prime triplets\",\n    \"Prime quadruplets\", \"Prime quintuplets\", \"Prime sextuplets\",\n    \"Prime septuplets\" };\n}\n\nvoid version() {\n  std::cout << \"primesieve 2.1, <http:\/\/primesieve.googlecode.com>\" << std::endl\n            << \"Copyright (C) 2011 Kim Walisch\" << std::endl\n            << \"License GPLv3+: GNU GPL version 3 or later <http:\/\/gnu.org\/licenses\/gpl.html>.\" << std::endl\n            << \"This is free software: you are free to change and redistribute it.\" << std::endl\n            << \"There is NO WARRANTY, to the extent permitted by law.\" << std::endl;\n  std::exit(EXIT_SUCCESS);\n}\n\nvoid help() {\n  std::cout << \"Usage: primesieve START STOP [OPTION]...\" << std::endl\n            << \"Use the sieve of Eratosthenes to find the prime numbers and prime\" << std::endl\n            << \"k-tuplets between START and STOP < 2^64\" << std::endl\n            << std::endl\n            << \"Examples:\" << std::endl\n            << \"  primesieve 1 10000000 -p1\" << std::endl\n            << \"  primesieve 1 1e11 -s 32\" << std::endl\n            << \"  primesieve 1e18 1e18+2**32 -c1234567\" << std::endl\n            << std::endl\n            << \"Options:\" << std::endl\n            << \"  -c[N]        Count prime numbers and\/or prime k-tuplets,\" << std::endl\n            << \"               e.g -c1 count prime numbers, -c3 count prime triplets, ...\" << std::endl\n            << \"               N >= 1 and N <= 7\" << std::endl\n            << \"  -p[N]        Print prime numbers or prime k-tuplets,\" << std::endl\n            << \"               e.g -p1 print prime numbers, -p2 print twin primes, ...\" << std::endl\n            << \"               N >= 1 and N <= 7\" << std::endl\n            << \"  -q           Quiet mode, print less output\" << std::endl\n            << \"  -s <SIZE>    Set the sieve size in KiloBytes, e.g. -s 256,\" << std::endl\n            << \"               set SIZE to your CPU's L1\/L2 cache size for best performance\" << std::endl\n            << \"               SIZE >= 1 and SIZE <= 8192\" << std::endl\n            << \"  -t <THREADS> Set the number of threads for sieving, e.g. -t 4,\" << std::endl\n            << \"               THREADS >= 1 and THREADS <= \" << maxThreads << \" (CPU max threads)\" << std::endl\n            << \"  -test        Run various sieving tests and exit\" << std::endl\n            << \"  -v           Print version and license information and exit\" << std::endl;\n  std::exit(EXIT_SUCCESS);\n}\n\nbool isDigits(const std::string &str) {\n  if (str.length() == 0)\n    return false;\n  return str.find_first_not_of(\"0123456789\") == std::string::npos;\n}\n\n\/**\n * Process the command-line options.\n * @see help(void)\n *\/\nvoid processOptions(int argc, char* argv[]) {\n  if (argc < 2 || argc > 20)\n    help();\n  ExpressionParser<uint64_t> parser;\n  int i = 1;\n\n  \/\/ process the START and STOP numbers\n  if (argc > 2)\n    for (; i <= 2; i++) {\n      if (!parser.eval(argv[i])) {\n        std::cerr << \"Error: \\\"\" << argv[i]  << \"\\\" is not a valid arithmetic expression\" << std::endl\n                  << \"Try `primesieve -help' for more information.\" << std::endl;\n        std::exit(EXIT_FAILURE);\n      }\n      numbers[i-1] = parser.getResult();\n      if (!isDigits(argv[i]))\n        showExpressionResults = true;\n    }\n\n  \/\/ process the options ([OPTION]...)\n  for (; i < argc; i++) {\n    char* c = argv[i];\n    if (*c != '-' && *c != '\/')\n      help();\n    switch (std::tolower(*(++c)++)) {\n      case 'c': do {\n                  if (*c < '1' || *c > '7')\n                    help();\n                  flags |= COUNT_PRIMES << (*c - '1');\n                } while (*(++c) != 0);\n                break;\n      case 'p': if (*c < '1' || *c > '7')\n                  help();\n                flags |= PRINT_PRIMES << (*c - '1');\n                quietMode = true;\n                break;\n      case 'q': quietMode = true;\n                break;\n      case 's': if (++i >= argc || !parser.eval(argv[i]))\n                  help();\n                sieveSize = static_cast<uint32_t> (parser.getResult());\n                sieveSize = nextHighestPowerOf2(sieveSize);\n                break;\n      case 't': if (std::string(\"test\").compare(++argv[i]) == 0) {\n                  test();\n                  std::exit(EXIT_SUCCESS);\n                }\n                if (++i >= argc || !parser.eval(argv[i]))\n                  help();\n                threads = static_cast<int> (parser.getResult());\n                break;\n      case 'v': version();\n      default : help();\n    }\n  }\n}\n\n\/**\n * Process the command-line options and start sieving.\n *\/\nint main(int argc, char* argv[]) {\n  processOptions(argc, argv);\n  std::cout.setf(std::ios::left);\n\n  \/\/ display expression results\n  if (!quietMode && showExpressionResults)\n    std::cout << std::setw(10) << \"START\" << \" = \" << numbers[0] << std::endl\n              << std::setw(10) << \"STOP\"  << \" = \" << numbers[1]  << std::endl;\n\n  \/\/ set default settings\n  if ((flags & COUNT_FLAGS) == 0 && (flags & PRINT_FLAGS) == 0)\n    flags |= COUNT_PRIMES;\n  if (!quietMode && (flags & PRINT_FLAGS) == 0)\n    flags |= PRINT_STATUS;\n  if (sieveSize == 0)\n    sieveSize = (numbers[1] < L2_THRESHOLD) ?L1_CACHE_SIZE :L2_CACHE_SIZE;\n  if (!quietMode)\n    std::cout << std::setw(10) << \"Sieve size\" << \" = \" << sieveSize\n              << \" KiloBytes\" << std::endl;\n  try {\n    \/\/ init primeSieve\n    ParallelPrimeSieve primeSieve;\n    primeSieve.setStartNumber(numbers[0]);\n    primeSieve.setStopNumber(numbers[1]);\n    primeSieve.setSieveSize(sieveSize);\n    primeSieve.setFlags(flags);\n    primeSieve.setNumThreads(threads);\n\n    if (!quietMode)\n      std::cout << std::setw(10) << \"Threads\" << \" = \" << primeSieve.getNumThreads() << std::endl;\n\n    \/\/ start sieving primes\n    primeSieve.sieve();\n\n    \/\/ print new line\n    if ((flags & PRINT_STATUS) || (\n        (flags & PRINT_FLAGS) &&\n        (flags & COUNT_FLAGS) ))\n      std::cout << std::endl;\n\n    \/\/ get max output width\n    std::size_t width = (quietMode) ?0 :12;\n    for (int i = 0; i < primeSieve.COUNTS_SIZE; i++)\n      if ((flags & (COUNT_PRIMES << i)) && width < primes[i].length())\n        width = primes[i].length();\n\n    \/\/ print prime count results\n    for (int i = 0; i < primeSieve.COUNTS_SIZE; i++)\n      if (flags & (COUNT_PRIMES << i))\n        std::cout << std::setw(static_cast<int> (width)) << primes[i] << \" : \"\n                  << primeSieve.getCounts(i) << std::endl;\n\n    \/\/ print time elapsed\n    if (!quietMode)\n      std::cout << std::setw(static_cast<int> (width)) << \"Time elapsed\" << \" : \"\n                << primeSieve.getTimeElapsed() << \" sec\" << std::endl;\n  }\n  catch (std::exception& ex) {\n    std::cerr << \"Error: \" << ex.what() << std::endl\n              << \"Try `primesieve -help' for more information.\" << std::endl;\n    std::exit(EXIT_FAILURE);\n  }\n  return 0;\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 Parser.cpp\n * @author Gav Wood <i@gavwood.com>\n * @date 2014\n *\/\n\n#include \"Parser.h\"\n\n#if _MSC_VER\n#pragma warning(disable:4348)\n#endif\n\n#define BOOST_RESULT_OF_USE_DECLTYPE\n#define BOOST_SPIRIT_USE_PHOENIX_V3\n#include <boost\/spirit\/include\/qi.hpp>\n#include <boost\/spirit\/include\/phoenix.hpp>\n#include <boost\/spirit\/include\/support_utree.hpp>\n\nusing namespace std;\nusing namespace dev;\nusing namespace dev::eth;\nnamespace qi = boost::spirit::qi;\nnamespace px = boost::phoenix;\nnamespace sp = boost::spirit;\n\nvoid dev::eth::killBigints(sp::utree const& _this)\n{\n\tswitch (_this.which())\n\t{\n\tcase sp::utree_type::list_type: for (auto const& i: _this) killBigints(i); break;\n\tcase sp::utree_type::any_type: delete _this.get<bigint*>(); break;\n\tdefault:;\n\t}\n}\n\nvoid dev::eth::debugOutAST(ostream& _out, sp::utree const& _this)\n{\n\tswitch (_this.which())\n\t{\n\tcase sp::utree_type::list_type:\n\t\tswitch (_this.tag())\n\t\t{\n\t\tcase 0: _out << \"( \"; for (auto const& i: _this) { debugOutAST(_out, i); _out << \" \"; } _out << \")\"; break;\n\t\tcase 1: _out << \"@ \"; debugOutAST(_out, _this.front()); break;\n\t\tcase 2: _out << \"@@ \"; debugOutAST(_out, _this.front()); break;\n\t\tcase 3: _out << \"[ \"; debugOutAST(_out, _this.front()); _out << \" ] \"; debugOutAST(_out, _this.back()); break;\n\t\tcase 4: _out << \"[[ \"; debugOutAST(_out, _this.front()); _out << \" ]] \"; debugOutAST(_out, _this.back()); break;\n\t\tcase 5: _out << \"{ \"; for (auto const& i: _this) { debugOutAST(_out, i); _out << \" \"; } _out << \"}\"; break;\n\t\tcase 6: _out << \"$ \"; debugOutAST(_out, _this.front()); break;\n\t\tdefault:;\n\t\t}\n\n\t\tbreak;\n\tcase sp::utree_type::int_type: _out << _this.get<int>(); break;\n\tcase sp::utree_type::string_type: _out << \"\\\"\" << _this.get<sp::basic_string<boost::iterator_range<char const*>, sp::utree_type::string_type>>() << \"\\\"\"; break;\n\tcase sp::utree_type::symbol_type: _out << _this.get<sp::basic_string<boost::iterator_range<char const*>, sp::utree_type::symbol_type>>(); break;\n\tcase sp::utree_type::any_type: _out << *_this.get<bigint*>(); break;\n\tdefault: _out << \"nil\";\n\t}\n}\n\nnamespace dev { namespace eth {\nnamespace parseTreeLLL_ {\n\ntemplate<unsigned N>\nstruct tagNode\n{\n\tvoid operator()(sp::utree& n, qi::rule<string::const_iterator, qi::ascii::space_type, sp::utree()>::context_type& c) const\n\t{\n\t\t(boost::fusion::at_c<0>(c.attributes) = n).tag(N);\n\t}\n};\n\n}}}\n\nvoid dev::eth::parseTreeLLL(string const& _s, sp::utree& o_out)\n{\n\tusing qi::standard::space;\n\tusing qi::standard::space_type;\n\tusing dev::eth::parseTreeLLL_::tagNode;\n\tusing symbol_type = sp::basic_string<std::string, sp::utree_type::symbol_type>;\n\tusing it = string::const_iterator;\n\n\tqi::rule<it, space_type, sp::utree()> element;\n\tqi::rule<it, string()> str = '\"' > qi::lexeme[+(~qi::char_(std::string(\"\\\"\") + '\\0'))] > '\"';\n\tqi::rule<it, string()> strsh = '\\'' > qi::lexeme[+(~qi::char_(std::string(\" ;$@()[]{}:\\n\\t\") + '\\0'))];\n\tqi::rule<it, symbol_type()> symbol = qi::lexeme[+(~qi::char_(std::string(\" $@[]{}:();\\\"\\x01-\\x1f\\x7f\") + '\\0'))];\n\tqi::rule<it, string()> intstr = qi::lexeme[ qi::no_case[\"0x\"][qi::_val = \"0x\"] >> *qi::char_(\"0-9a-fA-F\")[qi::_val += qi::_1]] | qi::lexeme[+qi::char_(\"0-9\")[qi::_val += qi::_1]];\n\tqi::rule<it, bigint()> integer = intstr;\n\tqi::rule<it, space_type, sp::utree()> atom = integer[qi::_val = px::construct<sp::any_ptr>(px::new_<bigint>(qi::_1))] | (str | strsh)[qi::_val = qi::_1] | symbol[qi::_val = qi::_1];\n\tqi::rule<it, space_type, sp::utree::list_type()> seq = '{' > *element > '}';\n\tqi::rule<it, space_type, sp::utree::list_type()> mload = '@' > element;\n\tqi::rule<it, space_type, sp::utree::list_type()> sload = qi::lit(\"@@\") > element;\n\tqi::rule<it, space_type, sp::utree::list_type()> mstore = '[' > element > ']' > -qi::lit(\":\") > element;\n\tqi::rule<it, space_type, sp::utree::list_type()> sstore = qi::lit(\"[[\") > element > qi::lit(\"]]\") > -qi::lit(\":\") > element;\n\tqi::rule<it, space_type, sp::utree::list_type()> calldataload = qi::lit(\"$\") > element;\n\tqi::rule<it, space_type, sp::utree::list_type()> list = '(' > *element > ')';\n\n\tqi::rule<it, space_type, sp::utree()> extra = sload[tagNode<2>()] | mload[tagNode<1>()] | sstore[tagNode<4>()] | mstore[tagNode<3>()] | seq[tagNode<5>()] | calldataload[tagNode<6>()];\n\telement = atom | list | extra;\n\n\tstring s;\n\ts.reserve(_s.size());\n\tbool incomment = false;\n\tbool instring = false;\n\tbool insstring = false;\n\tfor (auto i: _s)\n\t{\n\t\tif (i == ';' && !instring && !insstring)\n\t\t\tincomment = true;\n\t\telse if (i == '\\n')\n\t\t\tincomment = instring = insstring = false;\n\t\telse if (i == '\"' && !insstring)\n\t\t\tinstring = !instring;\n\t\telse if (i == '\\'')\n\t\t\tinsstring = true;\n\t\telse if (i == ' ')\n\t\t\tinsstring = false;\n\t\tif (!incomment)\n\t\t\ts.push_back(i);\n\t}\n\tauto ret = s.cbegin();\n\ttry\n\t{\n\t\tqi::phrase_parse(ret, s.cend(), element, space, qi::skip_flag::dont_postskip, o_out);\n\t}\n\tcatch (qi::expectation_failure<it> const& e)\n\t{\n\t\tstd::string fragment(e.first, e.last);\n\t\tstd::string loc = std::to_string(std::distance(s.cbegin(), e.first) - 1);\n\t\tstd::string reason(\"Lexer failure at \" + loc + \": '\" + fragment + \"'\");\n\t\tBOOST_THROW_EXCEPTION(ParserException() << errinfo_comment(reason));\n\t}\n\tfor (auto i = ret; i != s.cend(); ++i)\n\t\tif (!isspace(*i)) {\n\t\t\tBOOST_THROW_EXCEPTION(ParserException() << errinfo_comment(\"Non-whitespace left in parser\"));\n\t\t}\n}\n<commit_msg>LLL: simplify integer parsing<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 Parser.cpp\n * @author Gav Wood <i@gavwood.com>\n * @date 2014\n *\/\n\n#include \"Parser.h\"\n\n#if _MSC_VER\n#pragma warning(disable:4348)\n#endif\n\n#define BOOST_RESULT_OF_USE_DECLTYPE\n#define BOOST_SPIRIT_USE_PHOENIX_V3\n#include <boost\/spirit\/include\/qi.hpp>\n#include <boost\/spirit\/include\/phoenix.hpp>\n#include <boost\/spirit\/include\/support_utree.hpp>\n\nusing namespace std;\nusing namespace dev;\nusing namespace dev::eth;\nnamespace qi = boost::spirit::qi;\nnamespace px = boost::phoenix;\nnamespace sp = boost::spirit;\n\nvoid dev::eth::killBigints(sp::utree const& _this)\n{\n\tswitch (_this.which())\n\t{\n\tcase sp::utree_type::list_type: for (auto const& i: _this) killBigints(i); break;\n\tcase sp::utree_type::any_type: delete _this.get<bigint*>(); break;\n\tdefault:;\n\t}\n}\n\nvoid dev::eth::debugOutAST(ostream& _out, sp::utree const& _this)\n{\n\tswitch (_this.which())\n\t{\n\tcase sp::utree_type::list_type:\n\t\tswitch (_this.tag())\n\t\t{\n\t\tcase 0: _out << \"( \"; for (auto const& i: _this) { debugOutAST(_out, i); _out << \" \"; } _out << \")\"; break;\n\t\tcase 1: _out << \"@ \"; debugOutAST(_out, _this.front()); break;\n\t\tcase 2: _out << \"@@ \"; debugOutAST(_out, _this.front()); break;\n\t\tcase 3: _out << \"[ \"; debugOutAST(_out, _this.front()); _out << \" ] \"; debugOutAST(_out, _this.back()); break;\n\t\tcase 4: _out << \"[[ \"; debugOutAST(_out, _this.front()); _out << \" ]] \"; debugOutAST(_out, _this.back()); break;\n\t\tcase 5: _out << \"{ \"; for (auto const& i: _this) { debugOutAST(_out, i); _out << \" \"; } _out << \"}\"; break;\n\t\tcase 6: _out << \"$ \"; debugOutAST(_out, _this.front()); break;\n\t\tdefault:;\n\t\t}\n\n\t\tbreak;\n\tcase sp::utree_type::int_type: _out << _this.get<int>(); break;\n\tcase sp::utree_type::string_type: _out << \"\\\"\" << _this.get<sp::basic_string<boost::iterator_range<char const*>, sp::utree_type::string_type>>() << \"\\\"\"; break;\n\tcase sp::utree_type::symbol_type: _out << _this.get<sp::basic_string<boost::iterator_range<char const*>, sp::utree_type::symbol_type>>(); break;\n\tcase sp::utree_type::any_type: _out << *_this.get<bigint*>(); break;\n\tdefault: _out << \"nil\";\n\t}\n}\n\nnamespace dev { namespace eth {\nnamespace parseTreeLLL_ {\n\ntemplate<unsigned N>\nstruct tagNode\n{\n\tvoid operator()(sp::utree& n, qi::rule<string::const_iterator, qi::ascii::space_type, sp::utree()>::context_type& c) const\n\t{\n\t\t(boost::fusion::at_c<0>(c.attributes) = n).tag(N);\n\t}\n};\n\n}}}\n\nvoid dev::eth::parseTreeLLL(string const& _s, sp::utree& o_out)\n{\n\tusing qi::standard::space;\n\tusing qi::standard::space_type;\n\tusing dev::eth::parseTreeLLL_::tagNode;\n\tusing symbol_type = sp::basic_string<std::string, sp::utree_type::symbol_type>;\n\tusing it = string::const_iterator;\n\n\tqi::rule<it, space_type, sp::utree()> element;\n\tqi::rule<it, string()> str = '\"' > qi::lexeme[+(~qi::char_(std::string(\"\\\"\") + '\\0'))] > '\"';\n\tqi::rule<it, string()> strsh = '\\'' > qi::lexeme[+(~qi::char_(std::string(\" ;$@()[]{}:\\n\\t\") + '\\0'))];\n\tqi::rule<it, symbol_type()> symbol = qi::lexeme[+(~qi::char_(std::string(\" $@[]{}:();\\\"\\x01-\\x1f\\x7f\") + '\\0'))];\n\tqi::rule<it, string()> intstr = qi::lexeme[ qi::no_case[\"0x\"][qi::_val = \"0x\"] >> *qi::char_(\"0-9a-fA-F\")[qi::_val += qi::_1]] | qi::lexeme[+qi::char_(\"0-9\")[qi::_val += qi::_1]];\n\tqi::rule<it, sp::utree()> integer = intstr[qi::_val = px::construct<sp::any_ptr>(px::new_<bigint>(qi::_1))];\n\tqi::rule<it, space_type, sp::utree()> atom = integer[qi::_val = qi::_1] | (str | strsh)[qi::_val = qi::_1] | symbol[qi::_val = qi::_1];\n\tqi::rule<it, space_type, sp::utree::list_type()> seq = '{' > *element > '}';\n\tqi::rule<it, space_type, sp::utree::list_type()> mload = '@' > element;\n\tqi::rule<it, space_type, sp::utree::list_type()> sload = qi::lit(\"@@\") > element;\n\tqi::rule<it, space_type, sp::utree::list_type()> mstore = '[' > element > ']' > -qi::lit(\":\") > element;\n\tqi::rule<it, space_type, sp::utree::list_type()> sstore = qi::lit(\"[[\") > element > qi::lit(\"]]\") > -qi::lit(\":\") > element;\n\tqi::rule<it, space_type, sp::utree::list_type()> calldataload = qi::lit(\"$\") > element;\n\tqi::rule<it, space_type, sp::utree::list_type()> list = '(' > *element > ')';\n\n\tqi::rule<it, space_type, sp::utree()> extra = sload[tagNode<2>()] | mload[tagNode<1>()] | sstore[tagNode<4>()] | mstore[tagNode<3>()] | seq[tagNode<5>()] | calldataload[tagNode<6>()];\n\telement = atom | list | extra;\n\n\tstring s;\n\ts.reserve(_s.size());\n\tbool incomment = false;\n\tbool instring = false;\n\tbool insstring = false;\n\tfor (auto i: _s)\n\t{\n\t\tif (i == ';' && !instring && !insstring)\n\t\t\tincomment = true;\n\t\telse if (i == '\\n')\n\t\t\tincomment = instring = insstring = false;\n\t\telse if (i == '\"' && !insstring)\n\t\t\tinstring = !instring;\n\t\telse if (i == '\\'')\n\t\t\tinsstring = true;\n\t\telse if (i == ' ')\n\t\t\tinsstring = false;\n\t\tif (!incomment)\n\t\t\ts.push_back(i);\n\t}\n\tauto ret = s.cbegin();\n\ttry\n\t{\n\t\tqi::phrase_parse(ret, s.cend(), element, space, qi::skip_flag::dont_postskip, o_out);\n\t}\n\tcatch (qi::expectation_failure<it> const& e)\n\t{\n\t\tstd::string fragment(e.first, e.last);\n\t\tstd::string loc = std::to_string(std::distance(s.cbegin(), e.first) - 1);\n\t\tstd::string reason(\"Lexer failure at \" + loc + \": '\" + fragment + \"'\");\n\t\tBOOST_THROW_EXCEPTION(ParserException() << errinfo_comment(reason));\n\t}\n\tfor (auto i = ret; i != s.cend(); ++i)\n\t\tif (!isspace(*i)) {\n\t\t\tBOOST_THROW_EXCEPTION(ParserException() << errinfo_comment(\"Non-whitespace left in parser\"));\n\t\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright 2011 Michael Berganovsky\r\n\r\n   This program is free software; you can redistribute it and\/or modify\r\n   it under the terms of the GNU General Public License as published by\r\n   the Free Software Foundation; version 2 of the License.\r\n\r\n   This program is distributed in the hope that it will be useful,\r\n   but WITHOUT ANY WARRANTY; without even the implied warranty of\r\n   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\r\n   GNU General Public License for more details.\r\n\r\n   You should have received a copy of the GNU General Public License\r\n   along with this program; if not, write to the Free Software\r\n   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA *\/\r\n\r\n#include <precomp.h>\r\n\r\n#include <util.h>\r\n\r\nusing namespace std;\r\nusing namespace std::tr1;\r\nusing namespace boost::posix_time;\r\nusing namespace boost::gregorian;\r\n\r\nnamespace po = boost::program_options;\r\n\r\n__int64 get_file_size( const string& name )\r\n{\r\n   __int64 res = 0;\r\n   WIN32_FILE_ATTRIBUTE_DATA data;\r\n\r\n   if( GetFileAttributesEx( name.c_str(), GetFileExInfoStandard, &data ) )\r\n   {\r\n      res = data.nFileSizeLow;\r\n   }\r\n   else\r\n      throw runtime_error( tmp_str( \"Unable to obtain file length \\\"%s\\\"\", name.c_str() ) );\r\n\r\n   return res;\r\n}\r\n\r\nint main( int argc, char *argv[] )\r\n{\r\n   int               rc = 1;\r\n\r\n   string            from, to, spec;\r\n\r\n   long              rsize;\r\n\r\n   _finddata_t       fd;\r\n   vector< long >    files;\r\n\r\n   const char*       file_name;\r\n   char              module_path[ MAX_PATH + 1 ];\r\n\r\n   __int64           archive_size;\r\n\r\n   long              total_count = 0;\r\n   timer             td;\r\n\r\n   try\r\n   {\r\n      ::GetModuleFileName( NULL, module_path, sizeof module_path );\r\n\r\n      file_name = separate_file_name( module_path );\r\n\r\n      po::options_description options( \"options\" );\r\n      options.add_options()\r\n         ( \"help\",                                               \"Print help message\"  )\r\n         ( \"from\", po::value< string >(),                        \"Directory with fb2 books\" )\r\n         ( \"to\",   po::value< string >(),                        \"Directory to put resulting archives into\" )\r\n         ( \"size\", po::value<long>(&rsize)->default_value(2000), \"Individual archive size in MB\")\r\n         ;\r\n\r\n      po::variables_map vm;\r\n\r\n      po::store( po::parse_command_line( argc, argv, options ), vm );\r\n      po::notify( vm );\r\n\r\n      if( vm.count( \"help\" ) || ! vm.count( \"from\" ) || ! vm.count( \"to\" ) )\r\n      {\r\n         cout << endl;\r\n         cout << \"Tool to prepare library archives\" << endl;\r\n         cout << \"Version 1.0\" << endl;\r\n         cout << endl;\r\n         cout << \"Usage: \" << file_name << \" [options]\" << endl << endl;\r\n         cout << options << endl;\r\n         rc = 0; goto E_x_i_t;\r\n      }\r\n\r\n      if( rsize > 2047 )\r\n      {\r\n         cout << endl << \"Warning: size is too big, assuming 2047MB!\" << endl;\r\n         rsize = 2047;\r\n      }\r\n\r\n      archive_size = (__int64)1024*1024*rsize;\r\n\r\n      if( vm.count( \"from\" ) )\r\n         from = vm[ \"from\" ].as< string >();\r\n\r\n      if( vm.count( \"to\" ) )\r\n         to = vm[ \"to\" ].as< string >();\r\n\r\n      if( ! from.empty() )\r\n      {\r\n         if( 0 != _access( from.c_str(), 4 ) )\r\n            throw runtime_error( tmp_str( \"Wrong path to books \\\"%s\\\"\", from.c_str() ) );\r\n\r\n          normalize_path( from );\r\n      }\r\n\r\n      if( ! to.empty() )\r\n      {\r\n         if( 0 != _access( to.c_str(), 6 ) )\r\n            throw runtime_error( tmp_str( \"Wrong path to archives \\\"%s\\\"\", to.c_str() ) );\r\n\r\n          normalize_path( to );\r\n      }\r\n\r\n      cout << endl << \"Processing books...\";\r\n\r\n      spec  = from;\r\n      spec += \"*.fb2\";\r\n\r\n      auto_ffn books_dir( _findfirst( spec.c_str(), &fd ) );\r\n\r\n      if( ! books_dir )\r\n         throw runtime_error( tmp_str( \"Unable to process books path (%d) \\\"%s\\\"\", errno, spec.c_str() ) );\r\n\r\n      do\r\n      {\r\n         string name( fd.name );\r\n\r\n         name.erase( name.end() - 4, name.end() );\r\n\r\n         if( is_numeric( name ) )\r\n         {\r\n            files.push_back( atol( name.c_str() ) );\r\n         }\r\n      }\r\n      while( 0 == _findnext( books_dir, &fd ) );\r\n\r\n      if( files.empty() )\r\n         throw runtime_error( \"No books found!\" );\r\n\r\n      sort( files.begin(), files.end() );\r\n\r\n      cout << endl << files.size() << \" books found. Range: \" << *files.begin() << \" - \" << *(files.end() - 1) << endl;\r\n\r\n      string temp_name = to + \"temp.zip\";\r\n\r\n      vector< long >::const_iterator it = files.begin();\r\n      string now = to_iso_extended_string( second_clock::universal_time() );\r\n\r\n      while( it != files.end() )\r\n      {\r\n         __int64 current_size = archive_size;\r\n         long  count = 0;\r\n         timer ftd;\r\n         bool  new_zip = true;\r\n\r\n         long book_start = *it;\r\n         long book_end   = 0;\r\n\r\n         while( (current_size > 0) && (it != files.end()) )\r\n         {\r\n            zip zz( temp_name, now, new_zip );\r\n\r\n            new_zip = false;\r\n\r\n            for( ; it != files.end(); ++it )\r\n            {\r\n               tmp_str      book_name( \"%d.fb2\", *it );\r\n               ifstream     in( from + book_name );\r\n               stringstream ss;\r\n\r\n               book_end = *it;\r\n\r\n               if( !in )\r\n                  throw runtime_error( tmp_str( \"Cannot open book file \\\"%s\\\"\", book_name.c_str() ) );\r\n\r\n               ss << in.rdbuf();\r\n\r\n               if( !in && !in.eof() )\r\n                  throw runtime_error( tmp_str( \"Problem reading book file \\\"%s\\\"\", book_name.c_str() ) );\r\n\r\n               zip_writer zw( zz, book_name ); zw( ss.str() );\r\n\r\n               count++;\r\n\r\n               current_size -= ss.str().size() ;\r\n\r\n               if( current_size <= 0 )\r\n               {\r\n                  ++it;\r\n                  break;\r\n               }\r\n            }\r\n\r\n            zz.close();\r\n\r\n            current_size = archive_size - get_file_size( temp_name );\r\n         }\r\n\r\n         if( 0 != rename( temp_name.c_str(), tmp_str( \"%sfb2-%06d-%06d.zip\", to.c_str(), book_start, book_end ) ) )\r\n            throw runtime_error( tmp_str( \"Unable to rename temp.zip to \\\"fb2-%06d-%06d.zip\\\"\", book_start, book_end ) );\r\n\r\n         cout << endl << \"Processed: \" << setw(8) << count << \" books. Range: \"\r\n                      << setw(8) << book_start << \" - \"\r\n                      << setw(8) << book_end   << \". Done in - \"\r\n                      << ftd.passed();\r\n\r\n         new_zip = true;\r\n\r\n         total_count += count;\r\n      }\r\n\r\n      cout << endl << endl << \"Processing of \" << total_count << \" books completed in \" << td.passed() << endl;\r\n\r\n      rc = 0;\r\n   }\r\n   catch( exception& e )\r\n   {\r\n      cerr << endl << endl << \"***ERROR: \" << e.what() << endl;\r\n   }\r\n\r\nE_x_i_t:\r\n\r\n   return rc;\r\n}\r\n<commit_msg>libsplit - added --text<commit_after>\/* Copyright 2011 Michael Berganovsky\r\n\r\n   This program is free software; you can redistribute it and\/or modify\r\n   it under the terms of the GNU General Public License as published by\r\n   the Free Software Foundation; version 2 of the License.\r\n\r\n   This program is distributed in the hope that it will be useful,\r\n   but WITHOUT ANY WARRANTY; without even the implied warranty of\r\n   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\r\n   GNU General Public License for more details.\r\n\r\n   You should have received a copy of the GNU General Public License\r\n   along with this program; if not, write to the Free Software\r\n   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA *\/\r\n\r\n#include <precomp.h>\r\n\r\n#include <util.h>\r\n\r\nusing namespace std;\r\nusing namespace std::tr1;\r\nusing namespace boost::posix_time;\r\nusing namespace boost::gregorian;\r\n\r\nnamespace po = boost::program_options;\r\n\r\n__int64 get_file_size( const string& name )\r\n{\r\n   __int64 res = 0;\r\n   WIN32_FILE_ATTRIBUTE_DATA data;\r\n\r\n   if( GetFileAttributesEx( name.c_str(), GetFileExInfoStandard, &data ) )\r\n   {\r\n      res = data.nFileSizeLow;\r\n   }\r\n   else\r\n      throw runtime_error( tmp_str( \"Unable to obtain file length \\\"%s\\\"\", name.c_str() ) );\r\n\r\n   return res;\r\n}\r\n\r\nint main( int argc, char *argv[] )\r\n{\r\n   int               rc = 1;\r\n\r\n   string            from, to, spec;\r\n\r\n   long              rsize;\r\n\r\n   _finddata_t       fd;\r\n   vector< long >    files;\r\n\r\n   const char*       file_name;\r\n   char              module_path[ MAX_PATH + 1 ];\r\n\r\n   __int64           archive_size;\r\n\r\n   long              total_count = 0;\r\n   timer             td;\r\n\r\n   bool              f_binary = true;\r\n\r\n   try\r\n   {\r\n      ::GetModuleFileName( NULL, module_path, sizeof module_path );\r\n\r\n      file_name = separate_file_name( module_path );\r\n\r\n      po::options_description options( \"options\" );\r\n      options.add_options()\r\n         ( \"help\",                                                 \"Print help message\"  )\r\n         ( \"from\",   po::value< string >(),                        \"Directory with fb2 books\" )\r\n         ( \"to\",     po::value< string >(),                        \"Directory to put resulting archives into\" )\r\n         ( \"size\",   po::value<long>(&rsize)->default_value(2000), \"Individual archive size in MB\")\r\n         ( \"text\",                                                 \"Open books in text mode\")\r\n          ;\r\n\r\n      po::variables_map vm;\r\n\r\n      po::store( po::parse_command_line( argc, argv, options ), vm );\r\n      po::notify( vm );\r\n\r\n      if( vm.count( \"help\" ) || ! vm.count( \"from\" ) || ! vm.count( \"to\" ) )\r\n      {\r\n         cout << endl;\r\n         cout << \"Tool to prepare library archives\" << endl;\r\n         cout << \"Version 1.0\" << endl;\r\n         cout << endl;\r\n         cout << \"Usage: \" << file_name << \" [options]\" << endl << endl;\r\n         cout << options << endl;\r\n         rc = 0; goto E_x_i_t;\r\n      }\r\n\r\n      if( rsize > 2047 )\r\n      {\r\n         cout << endl << \"Warning: size is too big, assuming 2047MB!\" << endl;\r\n         rsize = 2047;\r\n      }\r\n\r\n      archive_size = (__int64)1024*1024*rsize;\r\n\r\n      if( vm.count( \"from\" ) )\r\n         from = vm[ \"from\" ].as< string >();\r\n\r\n      if( vm.count( \"to\" ) )\r\n         to = vm[ \"to\" ].as< string >();\r\n\r\n      if( ! from.empty() )\r\n      {\r\n         if( 0 != _access( from.c_str(), 4 ) )\r\n            throw runtime_error( tmp_str( \"Wrong path to books \\\"%s\\\"\", from.c_str() ) );\r\n\r\n          normalize_path( from );\r\n      }\r\n\r\n      if( ! to.empty() )\r\n      {\r\n         if( 0 != _access( to.c_str(), 6 ) )\r\n            throw runtime_error( tmp_str( \"Wrong path to archives \\\"%s\\\"\", to.c_str() ) );\r\n\r\n          normalize_path( to );\r\n      }\r\n\r\n      if( vm.count( \"text\" ) )\r\n        f_binary = false;\r\n\r\n      cout << endl << \"Processing books...\";\r\n\r\n      spec  = from;\r\n      spec += \"*.fb2\";\r\n\r\n      auto_ffn books_dir( _findfirst( spec.c_str(), &fd ) );\r\n\r\n      if( ! books_dir )\r\n         throw runtime_error( tmp_str( \"Unable to process books path (%d) \\\"%s\\\"\", errno, spec.c_str() ) );\r\n\r\n      do\r\n      {\r\n         string name( fd.name );\r\n\r\n         name.erase( name.end() - 4, name.end() );\r\n\r\n         if( is_numeric( name ) )\r\n         {\r\n            files.push_back( atol( name.c_str() ) );\r\n         }\r\n      }\r\n      while( 0 == _findnext( books_dir, &fd ) );\r\n\r\n      if( files.empty() )\r\n         throw runtime_error( \"No books found!\" );\r\n\r\n      sort( files.begin(), files.end() );\r\n\r\n      cout << endl << files.size() << \" books found. Range: \" << *files.begin() << \" - \" << *(files.end() - 1) << endl;\r\n\r\n      string temp_name = to + \"temp.zip\";\r\n\r\n      vector< long >::const_iterator it = files.begin();\r\n      string now = to_iso_extended_string( second_clock::universal_time() );\r\n\r\n      while( it != files.end() )\r\n      {\r\n         __int64 current_size = archive_size;\r\n         long  count = 0;\r\n         timer ftd;\r\n         bool  new_zip = true;\r\n\r\n         long book_start = *it;\r\n         long book_end   = 0;\r\n\r\n         while( (current_size > 0) && (it != files.end()) )\r\n         {\r\n            zip zz( temp_name, now, new_zip );\r\n\r\n            new_zip = false;\r\n\r\n            for( ; it != files.end(); ++it )\r\n            {\r\n               tmp_str      book_name( \"%d.fb2\", *it );\r\n               ifstream     in( from + book_name, f_binary ? ios_base::in | ios_base::binary : ios_base::in );\r\n               stringstream ss;\r\n\r\n               book_end = *it;\r\n\r\n               if( !in )\r\n                  throw runtime_error( tmp_str( \"Cannot open book file \\\"%s\\\"\", book_name.c_str() ) );\r\n\r\n               ss << in.rdbuf();\r\n\r\n               if( !in && !in.eof() )\r\n                  throw runtime_error( tmp_str( \"Problem reading book file \\\"%s\\\"\", book_name.c_str() ) );\r\n\r\n               zip_writer zw( zz, book_name ); zw( ss.str() );\r\n\r\n               count++;\r\n\r\n               current_size -= ss.str().size() ;\r\n\r\n               if( current_size <= 0 )\r\n               {\r\n                  ++it;\r\n                  break;\r\n               }\r\n            }\r\n\r\n            zz.close();\r\n\r\n            current_size = archive_size - get_file_size( temp_name );\r\n         }\r\n\r\n         if( 0 != rename( temp_name.c_str(), tmp_str( \"%sfb2-%06d-%06d.zip\", to.c_str(), book_start, book_end ) ) )\r\n            throw runtime_error( tmp_str( \"Unable to rename temp.zip to \\\"fb2-%06d-%06d.zip\\\"\", book_start, book_end ) );\r\n\r\n         cout << endl << \"Processed: \" << setw(8) << count << \" books. Range: \"\r\n                      << setw(8) << book_start << \" - \"\r\n                      << setw(8) << book_end   << \". Done in - \"\r\n                      << ftd.passed();\r\n\r\n         new_zip = true;\r\n\r\n         total_count += count;\r\n      }\r\n\r\n      cout << endl << endl << \"Processing of \" << total_count << \" books completed in \" << td.passed() << endl;\r\n\r\n      rc = 0;\r\n   }\r\n   catch( exception& e )\r\n   {\r\n      cerr << endl << endl << \"***ERROR: \" << e.what() << endl;\r\n   }\r\n\r\nE_x_i_t:\r\n\r\n   return rc;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2012  Sebastian Gottfried <sebastiangottfried@web.de>\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 \"linegraphcore.h\"\n\n#include <QAbstractTableModel>\n\n#include <QPainter>\n\nLineGraphCore::LineGraphCore(QDeclarativeItem* parent) :\n    QDeclarativeItem(parent),\n    m_model(0),\n    m_graphStyle(LineGraphCore::Lines),\n    m_pitch(50.0),\n    m_pointRadius(5.0)\n{\n    setFlag(QGraphicsItem::ItemHasNoContents, false);\n}\n\nQAbstractTableModel* LineGraphCore::model() const\n{\n    return m_model;\n}\n\nvoid LineGraphCore::setModel(QAbstractTableModel* model)\n{\n    if (model != m_model)\n    {\n        if (m_model)\n        {\n            m_model->disconnect(this);\n        }\n\n        m_model = model;\n\n        if (m_model)\n        {\n            connect(m_model, SIGNAL(modelReset()), SLOT(triggerUpdate()));\n            connect(m_model, SIGNAL(rowsInserted(QModelIndex,int,int)), SLOT(triggerUpdate()));\n            connect(m_model, SIGNAL(rowsRemoved(QModelIndex,int,int)), SLOT(triggerUpdate()));\n            connect(m_model, SIGNAL(rowsMoved(QModelIndex,int,int,QModelIndex,int)), SLOT(triggerUpdate()));\n            connect(m_model, SIGNAL(layoutChanged()), SLOT(triggerUpdate()));\n            connect(m_model, SIGNAL(dataChanged(QModelIndex,QModelIndex)), SLOT(triggerUpdate()));\n        }\n\n        triggerUpdate();\n        emit modelChanged();\n    }\n}\n\nQDeclarativeListProperty<Dimension> LineGraphCore::dimensions() {\n    return QDeclarativeListProperty<Dimension>(this, 0, &LineGraphCore::appendDimension, &LineGraphCore::countDimensions, &LineGraphCore::dimensionAt, &LineGraphCore::clearDimensions);\n}\n\nQList<Dimension*> LineGraphCore::dimensionsList() const\n{\n    return m_dimensions;\n}\n\nLineGraphCore::GraphStyle LineGraphCore::graphStyle() const {\n    return m_graphStyle;\n}\n\nvoid LineGraphCore::setGraphStyle(GraphStyle graphStyle) {\n    if (graphStyle != m_graphStyle) {\n        m_graphStyle = graphStyle;\n        triggerUpdate();\n        emit graphStyleChanged();\n    }\n}\n\nqreal LineGraphCore::pitch() const\n{\n    return m_pitch;\n}\n\nvoid LineGraphCore::setPitch(qreal pitch)\n{\n    if (pitch != m_pitch)\n    {\n        m_pitch = pitch;\n        triggerUpdate();\n        emit pitchChanged();\n    }\n}\n\nqreal LineGraphCore::pointRadius() const\n{\n    return m_pointRadius;\n}\n\nvoid LineGraphCore::setPointRadius(qreal pointRadius)\n{\n    if (pointRadius != m_pointRadius)\n    {\n        m_pointRadius = pointRadius;\n        triggerUpdate();\n        emit pointRadiusChanged();\n    }\n}\n\nvoid LineGraphCore::paint(QPainter* painter, const QStyleOptionGraphicsItem*, QWidget*)\n{\n    paintAxisAndLines(painter);\n}\n\nvoid LineGraphCore::paintAxisAndLines(QPainter* painter)\n{\n    const int minY = qRound(m_pointRadius);\n    const int maxY = height() - m_pointRadius;\n    const int distance = (maxY - minY) \/ 4;\n    const qreal x1 = x();\n    const qreal x2 = x1 + width();\n    int y = minY;\n\n    painter->setPen(QPen(QBrush(\"#808080\"), 1));\n\n    for (int i = 0; i < 4; i++, y += distance)\n    {\n        painter->drawLine(QPointF(x1, y), QPointF(x2, y));\n    }\n\n    painter->setPen(QPen(QBrush(\"#000000\"), 1));\n    painter->drawLine(QPointF(x1, maxY), QPointF(x2, maxY));\n}\n\nvoid LineGraphCore::triggerUpdate()\n{\n    emit updated();\n    update();\n}\n\nvoid LineGraphCore::appendDimension(QDeclarativeListProperty<Dimension>* list, Dimension *dimension) {\n    LineGraphCore* lineGraphCore = qobject_cast<LineGraphCore*>(list->object);\n    if (lineGraphCore) {\n        dimension->setParent(lineGraphCore);\n        lineGraphCore->m_dimensions.append(dimension);\n        lineGraphCore->triggerUpdate();\n    }\n}\n\nint LineGraphCore::countDimensions(QDeclarativeListProperty<Dimension>* list) {\n    LineGraphCore* lineGraphCore = qobject_cast<LineGraphCore*>(list->object);\n    if (lineGraphCore) {\n        return lineGraphCore->m_dimensions.count();\n    }\n    return -1;\n}\n\nDimension* LineGraphCore::dimensionAt(QDeclarativeListProperty<Dimension>* list, int index) {\n    LineGraphCore* lineGraphCore = qobject_cast<LineGraphCore*>(list->object);\n    if (lineGraphCore) {\n        return lineGraphCore->m_dimensions.at(index);\n    }\n    return 0;\n}\n\nvoid LineGraphCore::clearDimensions(QDeclarativeListProperty<Dimension>* list) {\n    LineGraphCore* lineGraphCore = qobject_cast<LineGraphCore*>(list->object);\n    if (lineGraphCore) {\n        lineGraphCore->m_dimensions.clear();\n        lineGraphCore->triggerUpdate();\n    }\n}\n<commit_msg>graph plugin: fix off-by-one painting issue in line drawing code<commit_after>\/*\n * Copyright 2012  Sebastian Gottfried <sebastiangottfried@web.de>\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 \"linegraphcore.h\"\n\n#include <QAbstractTableModel>\n\n#include <QPainter>\n\nLineGraphCore::LineGraphCore(QDeclarativeItem* parent) :\n    QDeclarativeItem(parent),\n    m_model(0),\n    m_graphStyle(LineGraphCore::Lines),\n    m_pitch(50.0),\n    m_pointRadius(5.0)\n{\n    setFlag(QGraphicsItem::ItemHasNoContents, false);\n}\n\nQAbstractTableModel* LineGraphCore::model() const\n{\n    return m_model;\n}\n\nvoid LineGraphCore::setModel(QAbstractTableModel* model)\n{\n    if (model != m_model)\n    {\n        if (m_model)\n        {\n            m_model->disconnect(this);\n        }\n\n        m_model = model;\n\n        if (m_model)\n        {\n            connect(m_model, SIGNAL(modelReset()), SLOT(triggerUpdate()));\n            connect(m_model, SIGNAL(rowsInserted(QModelIndex,int,int)), SLOT(triggerUpdate()));\n            connect(m_model, SIGNAL(rowsRemoved(QModelIndex,int,int)), SLOT(triggerUpdate()));\n            connect(m_model, SIGNAL(rowsMoved(QModelIndex,int,int,QModelIndex,int)), SLOT(triggerUpdate()));\n            connect(m_model, SIGNAL(layoutChanged()), SLOT(triggerUpdate()));\n            connect(m_model, SIGNAL(dataChanged(QModelIndex,QModelIndex)), SLOT(triggerUpdate()));\n        }\n\n        triggerUpdate();\n        emit modelChanged();\n    }\n}\n\nQDeclarativeListProperty<Dimension> LineGraphCore::dimensions() {\n    return QDeclarativeListProperty<Dimension>(this, 0, &LineGraphCore::appendDimension, &LineGraphCore::countDimensions, &LineGraphCore::dimensionAt, &LineGraphCore::clearDimensions);\n}\n\nQList<Dimension*> LineGraphCore::dimensionsList() const\n{\n    return m_dimensions;\n}\n\nLineGraphCore::GraphStyle LineGraphCore::graphStyle() const {\n    return m_graphStyle;\n}\n\nvoid LineGraphCore::setGraphStyle(GraphStyle graphStyle) {\n    if (graphStyle != m_graphStyle) {\n        m_graphStyle = graphStyle;\n        triggerUpdate();\n        emit graphStyleChanged();\n    }\n}\n\nqreal LineGraphCore::pitch() const\n{\n    return m_pitch;\n}\n\nvoid LineGraphCore::setPitch(qreal pitch)\n{\n    if (pitch != m_pitch)\n    {\n        m_pitch = pitch;\n        triggerUpdate();\n        emit pitchChanged();\n    }\n}\n\nqreal LineGraphCore::pointRadius() const\n{\n    return m_pointRadius;\n}\n\nvoid LineGraphCore::setPointRadius(qreal pointRadius)\n{\n    if (pointRadius != m_pointRadius)\n    {\n        m_pointRadius = pointRadius;\n        triggerUpdate();\n        emit pointRadiusChanged();\n    }\n}\n\nvoid LineGraphCore::paint(QPainter* painter, const QStyleOptionGraphicsItem*, QWidget*)\n{\n    paintAxisAndLines(painter);\n}\n\nvoid LineGraphCore::paintAxisAndLines(QPainter* painter)\n{\n    const int minY = qRound(m_pointRadius);\n    const int maxY = height() - m_pointRadius;\n    const int distance = (maxY - minY) \/ 4;\n    const qreal x1 = x();\n    const qreal x2 = x1 + width() - 1;\n    int y = minY;\n\n    painter->setPen(QPen(QBrush(\"#808080\"), 1));\n\n    for (int i = 0; i < 4; i++, y += distance)\n    {\n        painter->drawLine(QPointF(x1, y), QPointF(x2, y));\n    }\n\n    painter->setPen(QPen(QBrush(\"#000000\"), 1));\n    painter->drawLine(QPointF(x1, maxY), QPointF(x2, maxY));\n}\n\nvoid LineGraphCore::triggerUpdate()\n{\n    emit updated();\n    update();\n}\n\nvoid LineGraphCore::appendDimension(QDeclarativeListProperty<Dimension>* list, Dimension *dimension) {\n    LineGraphCore* lineGraphCore = qobject_cast<LineGraphCore*>(list->object);\n    if (lineGraphCore) {\n        dimension->setParent(lineGraphCore);\n        lineGraphCore->m_dimensions.append(dimension);\n        lineGraphCore->triggerUpdate();\n    }\n}\n\nint LineGraphCore::countDimensions(QDeclarativeListProperty<Dimension>* list) {\n    LineGraphCore* lineGraphCore = qobject_cast<LineGraphCore*>(list->object);\n    if (lineGraphCore) {\n        return lineGraphCore->m_dimensions.count();\n    }\n    return -1;\n}\n\nDimension* LineGraphCore::dimensionAt(QDeclarativeListProperty<Dimension>* list, int index) {\n    LineGraphCore* lineGraphCore = qobject_cast<LineGraphCore*>(list->object);\n    if (lineGraphCore) {\n        return lineGraphCore->m_dimensions.at(index);\n    }\n    return 0;\n}\n\nvoid LineGraphCore::clearDimensions(QDeclarativeListProperty<Dimension>* list) {\n    LineGraphCore* lineGraphCore = qobject_cast<LineGraphCore*>(list->object);\n    if (lineGraphCore) {\n        lineGraphCore->m_dimensions.clear();\n        lineGraphCore->triggerUpdate();\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: xeformula.hxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: rt $ $Date: 2005-03-29 13:44: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 SC_XEFORMULA_HXX\n#define SC_XEFORMULA_HXX\n\n#ifndef SC_XLFORMULA_HXX\n#include \"xlformula.hxx\"\n#endif\n#ifndef SC_XEROOT_HXX\n#include \"xeroot.hxx\"\n#endif\n\n\/\/ Token array ================================================================\n\n\/** Binary representation of an Excel token array. *\/\nclass XclExpTokenArray\n{\npublic:\n    \/** Creates an empty token array. *\/\n    explicit            XclExpTokenArray( bool bVolatile = false );\n    \/** Creates a token array, swaps passed token vector into own data. *\/\n    explicit            XclExpTokenArray( ScfUInt8Vec& rTokVec, bool bVolatile = false );\n\n    \/** Returns true, if the token array is empty. *\/\n    inline bool         Empty() const { return maTokVec.empty(); }\n    \/** Returns the size of the token array in bytes. *\/\n    sal_uInt16          GetSize() const;\n    \/** Returns read-only access to the byte vector storing token data. *\/\n    inline const ScfUInt8Vec& GetTokenVec() const { return maTokVec; }\n    \/** Returns true, if the formula contains a volatile function. *\/\n    inline bool         IsVolatile() const { return mbVolatile; }\n\n    \/** Swaps own token vector with passed token vector. *\/\n    inline void         SwapTokenVec( ScfUInt8Vec& rTokVec ) { maTokVec.swap( rTokVec ); }\n\n    \/** Writes the size field of the token array. *\/\n    void                WriteSize( XclExpStream& rStrm ) const;\n    \/** Writes the tokens of the token array (without size field). *\/\n    void                WriteArray( XclExpStream& rStrm ) const;\n    \/** Writes size field and the tokens. *\/\n    void                Write( XclExpStream& rStrm ) const;\n\n    \/** Compares this token array with the passed. *\/\n    bool                operator==( const XclExpTokenArray& rTokArr ) const;\n\nprivate:\n    ScfUInt8Vec         maTokVec;       \/\/\/ Byte vector containing token data.\n    bool                mbVolatile;     \/\/\/ True = Formula contains volatile function.\n};\n\n\/** Calls the Write() function at the passed token array. *\/\nXclExpStream& operator<<( XclExpStream& rStrm, const XclExpTokenArray& rTokArr );\n\n\/\/ External reference log =====================================================\n\n\/** Log entry for external references in a formula, used i.e. in change tracking. *\/\nstruct XclExpRefLogEntry\n{\n    const XclExpString* mpUrl;              \/\/\/ URL of the document containing the first sheet.\n    const XclExpString* mpFirstTab;         \/\/\/ Name of the first sheet.\n    const XclExpString* mpLastTab;          \/\/\/ Name of the last sheet.\n    sal_uInt16          mnFirstXclTab;      \/\/\/ Calc index of the first sheet.\n    sal_uInt16          mnLastXclTab;       \/\/\/ Calc index of the last sheet.\n\n    explicit            XclExpRefLogEntry();\n};\n\n\/** Vector containing a log for all external references in a formula, used i.e. in change tracking. *\/\ntypedef ::std::vector< XclExpRefLogEntry > XclExpRefLog;\n\n\/\/ Formula compiler ===========================================================\n\n\/** Type of a creted formula. *\/\nenum XclExpFomulaType\n{\n    EXC_FMLATYPE_CELL,          \/\/\/ Simple cell formula, also used in change tracking.\n    EXC_FMLATYPE_MATRIX,        \/\/\/ Matrix (array) formula.\n    EXC_FMLATYPE_SHARED,        \/\/\/ Shared formula.\n    EXC_FMLATYPE_CONDFMT,       \/\/\/ Conditional format.\n    EXC_FMLATYPE_DATAVAL,       \/\/\/ Data validation.\n    EXC_FMLATYPE_NAME,          \/\/\/ Defined name.\n    EXC_FMLATYPE_CHART,         \/\/\/ Chart source ranges.\n    EXC_FMLATYPE_CONTROL,       \/\/\/ Spreadsheet links in form controls.\n    EXC_FMLATYPE_WQUERY,        \/\/\/ Web query source range.\n    EXC_FMLATYPE_LISTVAL        \/\/\/ List (cell range) validation.\n};\n\n\/\/ ----------------------------------------------------------------------------\n\nclass ScRangeList;\nclass XclExpFmlaCompImpl;\n\n\/** The formula compiler to create Excel token arrays from Calc token arrays. *\/\nclass XclExpFormulaCompiler : protected XclExpRoot\n{\npublic:\n    explicit            XclExpFormulaCompiler( const XclExpRoot& rRoot );\n    virtual             ~XclExpFormulaCompiler();\n\n    \/** Creates and returns the token array of a formula. *\/\n    XclExpTokenArrayRef CreateFormula(\n                            XclExpFomulaType eType, const ScTokenArray& rScTokArr,\n                            const ScAddress* pScBasePos = 0, XclExpRefLog* pRefLog = 0 );\n\n    \/** Creates and returns a token array containing a single cell address. *\/\n    XclExpTokenArrayRef CreateFormula( XclExpFomulaType eType, const ScAddress& rScPos );\n\n    \/** Creates and returns a token array containing a single cell range address. *\/\n    XclExpTokenArrayRef CreateFormula( XclExpFomulaType eType, const ScRange& rScRange );\n\n    \/** Creates and returns the token array for a cell range list. *\/\n    XclExpTokenArrayRef CreateFormula( XclExpFomulaType eType, const ScRangeList& rScRanges );\n\n    \/** Creates a single error token containing the passed error code. *\/\n    XclExpTokenArrayRef CreateErrorFormula( sal_uInt8 nErrCode );\n\n    \/** Creates a single token for a special cell reference.\n        @descr  This is used for array formulas and shared formulas (token tExp),\n            and multiple operation tables (token tTbl). *\/\n    XclExpTokenArrayRef CreateSpecialRefFormula( sal_uInt8 nTokenId, const XclAddress& rXclPos );\n\n    \/** Creates a single tNameXR token for a reference to an external name.\n        @descr  This is used i.e. for linked macros in push buttons. *\/\n    XclExpTokenArrayRef CreateNameXFormula( sal_uInt16 nExtSheet, sal_uInt16 nExtName );\n\nprivate:\n    typedef ScfRef< XclExpFmlaCompImpl > XclExpFmlaCompImplRef;\n    XclExpFmlaCompImplRef mxImpl;\n};\n\n\/\/ ============================================================================\n\n#endif\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.5.116); FILE MERGED 2005\/09\/05 15:02:50 rt 1.5.116.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: xeformula.hxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 19:28: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 SC_XEFORMULA_HXX\n#define SC_XEFORMULA_HXX\n\n#ifndef SC_XLFORMULA_HXX\n#include \"xlformula.hxx\"\n#endif\n#ifndef SC_XEROOT_HXX\n#include \"xeroot.hxx\"\n#endif\n\n\/\/ Token array ================================================================\n\n\/** Binary representation of an Excel token array. *\/\nclass XclExpTokenArray\n{\npublic:\n    \/** Creates an empty token array. *\/\n    explicit            XclExpTokenArray( bool bVolatile = false );\n    \/** Creates a token array, swaps passed token vector into own data. *\/\n    explicit            XclExpTokenArray( ScfUInt8Vec& rTokVec, bool bVolatile = false );\n\n    \/** Returns true, if the token array is empty. *\/\n    inline bool         Empty() const { return maTokVec.empty(); }\n    \/** Returns the size of the token array in bytes. *\/\n    sal_uInt16          GetSize() const;\n    \/** Returns read-only access to the byte vector storing token data. *\/\n    inline const ScfUInt8Vec& GetTokenVec() const { return maTokVec; }\n    \/** Returns true, if the formula contains a volatile function. *\/\n    inline bool         IsVolatile() const { return mbVolatile; }\n\n    \/** Swaps own token vector with passed token vector. *\/\n    inline void         SwapTokenVec( ScfUInt8Vec& rTokVec ) { maTokVec.swap( rTokVec ); }\n\n    \/** Writes the size field of the token array. *\/\n    void                WriteSize( XclExpStream& rStrm ) const;\n    \/** Writes the tokens of the token array (without size field). *\/\n    void                WriteArray( XclExpStream& rStrm ) const;\n    \/** Writes size field and the tokens. *\/\n    void                Write( XclExpStream& rStrm ) const;\n\n    \/** Compares this token array with the passed. *\/\n    bool                operator==( const XclExpTokenArray& rTokArr ) const;\n\nprivate:\n    ScfUInt8Vec         maTokVec;       \/\/\/ Byte vector containing token data.\n    bool                mbVolatile;     \/\/\/ True = Formula contains volatile function.\n};\n\n\/** Calls the Write() function at the passed token array. *\/\nXclExpStream& operator<<( XclExpStream& rStrm, const XclExpTokenArray& rTokArr );\n\n\/\/ External reference log =====================================================\n\n\/** Log entry for external references in a formula, used i.e. in change tracking. *\/\nstruct XclExpRefLogEntry\n{\n    const XclExpString* mpUrl;              \/\/\/ URL of the document containing the first sheet.\n    const XclExpString* mpFirstTab;         \/\/\/ Name of the first sheet.\n    const XclExpString* mpLastTab;          \/\/\/ Name of the last sheet.\n    sal_uInt16          mnFirstXclTab;      \/\/\/ Calc index of the first sheet.\n    sal_uInt16          mnLastXclTab;       \/\/\/ Calc index of the last sheet.\n\n    explicit            XclExpRefLogEntry();\n};\n\n\/** Vector containing a log for all external references in a formula, used i.e. in change tracking. *\/\ntypedef ::std::vector< XclExpRefLogEntry > XclExpRefLog;\n\n\/\/ Formula compiler ===========================================================\n\n\/** Type of a creted formula. *\/\nenum XclExpFomulaType\n{\n    EXC_FMLATYPE_CELL,          \/\/\/ Simple cell formula, also used in change tracking.\n    EXC_FMLATYPE_MATRIX,        \/\/\/ Matrix (array) formula.\n    EXC_FMLATYPE_SHARED,        \/\/\/ Shared formula.\n    EXC_FMLATYPE_CONDFMT,       \/\/\/ Conditional format.\n    EXC_FMLATYPE_DATAVAL,       \/\/\/ Data validation.\n    EXC_FMLATYPE_NAME,          \/\/\/ Defined name.\n    EXC_FMLATYPE_CHART,         \/\/\/ Chart source ranges.\n    EXC_FMLATYPE_CONTROL,       \/\/\/ Spreadsheet links in form controls.\n    EXC_FMLATYPE_WQUERY,        \/\/\/ Web query source range.\n    EXC_FMLATYPE_LISTVAL        \/\/\/ List (cell range) validation.\n};\n\n\/\/ ----------------------------------------------------------------------------\n\nclass ScRangeList;\nclass XclExpFmlaCompImpl;\n\n\/** The formula compiler to create Excel token arrays from Calc token arrays. *\/\nclass XclExpFormulaCompiler : protected XclExpRoot\n{\npublic:\n    explicit            XclExpFormulaCompiler( const XclExpRoot& rRoot );\n    virtual             ~XclExpFormulaCompiler();\n\n    \/** Creates and returns the token array of a formula. *\/\n    XclExpTokenArrayRef CreateFormula(\n                            XclExpFomulaType eType, const ScTokenArray& rScTokArr,\n                            const ScAddress* pScBasePos = 0, XclExpRefLog* pRefLog = 0 );\n\n    \/** Creates and returns a token array containing a single cell address. *\/\n    XclExpTokenArrayRef CreateFormula( XclExpFomulaType eType, const ScAddress& rScPos );\n\n    \/** Creates and returns a token array containing a single cell range address. *\/\n    XclExpTokenArrayRef CreateFormula( XclExpFomulaType eType, const ScRange& rScRange );\n\n    \/** Creates and returns the token array for a cell range list. *\/\n    XclExpTokenArrayRef CreateFormula( XclExpFomulaType eType, const ScRangeList& rScRanges );\n\n    \/** Creates a single error token containing the passed error code. *\/\n    XclExpTokenArrayRef CreateErrorFormula( sal_uInt8 nErrCode );\n\n    \/** Creates a single token for a special cell reference.\n        @descr  This is used for array formulas and shared formulas (token tExp),\n            and multiple operation tables (token tTbl). *\/\n    XclExpTokenArrayRef CreateSpecialRefFormula( sal_uInt8 nTokenId, const XclAddress& rXclPos );\n\n    \/** Creates a single tNameXR token for a reference to an external name.\n        @descr  This is used i.e. for linked macros in push buttons. *\/\n    XclExpTokenArrayRef CreateNameXFormula( sal_uInt16 nExtSheet, sal_uInt16 nExtName );\n\nprivate:\n    typedef ScfRef< XclExpFmlaCompImpl > XclExpFmlaCompImplRef;\n    XclExpFmlaCompImplRef mxImpl;\n};\n\n\/\/ ============================================================================\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkMathTextActor.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 \"vtkMathTextActor.h\"\n\n#include \"vtkCellArray.h\"\n#include \"vtkFloatArray.h\"\n#include \"vtkImageData.h\"\n#include \"vtkMath.h\"\n#include \"vtkMathTextUtilities.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkPointData.h\"\n#include \"vtkPoints.h\"\n#include \"vtkPolyData.h\"\n#include \"vtkPolyDataMapper2D.h\"\n#include \"vtkRenderer.h\"\n#include \"vtkRenderWindow.h\"\n#include \"vtkTextProperty.h\"\n#include \"vtkTexture.h\"\n#include \"vtkViewport.h\"\n\n\/\/ ----------------------------------------------------------------------------\nvtkStandardNewMacro(vtkMathTextActor);\n\n\/\/ ----------------------------------------------------------------------------\nbool vtkMathTextActor::IsSupported()\n{\n  return vtkMathTextUtilities::GetInstance() != NULL;\n}\n\n\/\/ ----------------------------------------------------------------------------\nvtkMathTextActor::vtkMathTextActor()\n{\n  \/\/ Copied from vtkTextActor:\n  \/\/ To remain compatible with code using vtkActor2D, we must set\n  \/\/ position coord to Viewport, not Normalized Viewport\n  \/\/ so...compute equivalent coords for initial position\n  this->PositionCoordinate->SetCoordinateSystemToViewport();\n\n  \/\/ Construct texture\n  this->Rectangle->SetPoints(this->RectanglePoints.GetPointer());\n  vtkNew<vtkCellArray> polys;\n  polys->InsertNextCell(4);\n  polys->InsertCellPoint(0);\n  polys->InsertCellPoint(1);\n  polys->InsertCellPoint(2);\n  polys->InsertCellPoint(3);\n  this->Rectangle->SetPolys(polys.GetPointer());\n\n  vtkNew<vtkFloatArray> tc;\n  tc->SetNumberOfComponents(2);\n  tc->SetNumberOfTuples(4);\n  tc->InsertComponent(0,0, 0.0);  tc->InsertComponent(0,1, 0.0);\n  tc->InsertComponent(1,0, 0.0);  tc->InsertComponent(1,1, 1.0);\n  tc->InsertComponent(2,0, 1.0);  tc->InsertComponent(2,1, 1.0);\n  tc->InsertComponent(3,0, 1.0);  tc->InsertComponent(3,1, 0.0);\n  this->Rectangle->GetPointData()->SetTCoords(tc.GetPointer());\n\n  vtkNew<vtkPolyDataMapper2D> mapper;\n  this->SetMapper(mapper.GetPointer());\n  mapper->SetInputData(this->Rectangle.GetPointer());\n\n  this->TextProperty = vtkSmartPointer<vtkTextProperty>::New();\n}\n\n\/\/ ----------------------------------------------------------------------------\nvtkMathTextActor::~vtkMathTextActor()\n{\n}\n\n\/\/ ----------------------------------------------------------------------------\nconst char* vtkMathTextActor::GetInput()\n{\n  return this->Input.c_str();\n}\n\n\/\/ ----------------------------------------------------------------------------\ndouble *vtkMathTextActor::GetBounds()\n{\n  this->ComputeRectangle();\n  return this->RectanglePoints->GetBounds();\n}\n\n\/\/ ----------------------------------------------------------------------------\nvoid vtkMathTextActor::SetTextProperty(vtkTextProperty *p)\n{\n  this->TextProperty = p;\n}\n\n\/\/ ----------------------------------------------------------------------------\nvtkTextProperty *vtkMathTextActor::GetTextProperty()\n{\n  return this->TextProperty.GetPointer();\n}\n\n\/\/ ----------------------------------------------------------------------------\nvoid vtkMathTextActor::ShallowCopy(vtkProp *prop)\n{\n  vtkMathTextActor *a = vtkMathTextActor::SafeDownCast(prop);\n  if ( a != NULL )\n    {\n    this->SetTextProperty(a->GetTextProperty());\n    this->SetInput(a->GetInput());\n    }\n  this->vtkActor2D::ShallowCopy(prop);\n}\n\n\/\/ ----------------------------------------------------------------------------\nvoid vtkMathTextActor::ReleaseGraphicsResources(vtkWindow *win)\n{\n  this->vtkActor2D::ReleaseGraphicsResources(win);\n  this->Texture->ReleaseGraphicsResources(win);\n}\n\n\/\/ ----------------------------------------------------------------------------\nint vtkMathTextActor::RenderOverlay(vtkViewport *viewport)\n{\n  if (!this->Visibility)\n    {\n    return 0;\n    }\n\n  \/\/ render the texture\n  if (this->Texture.GetPointer() && !this->Input.empty())\n    {\n    vtkRenderer* ren = vtkRenderer::SafeDownCast(viewport);\n    if (ren)\n      {\n      this->Texture->Render(ren);\n      }\n    }\n\n  \/\/ Everything is built in RenderOpaqueGeometry, just have to render\n  return this->vtkActor2D::RenderOverlay(viewport);\n}\n\n\/\/ ----------------------------------------------------------------------------\nint vtkMathTextActor::RenderOpaqueGeometry(vtkViewport *viewport)\n{\n  if (!this->Visibility)\n    {\n    return 0;\n    }\n\n  \/\/ Make sure we have a string to render\n  if (this->Input.empty())\n    {\n    return 0;\n    }\n\n  \/\/check if we need to render the string\n\n  if(this->TextProperty->GetMTime() > this->ImageData->GetMTime() ||\n     this->GetMTime() > this->ImageData->GetMTime())\n    {\n    unsigned int dpi = 120;\n    vtkRenderer *ren = vtkRenderer::SafeDownCast(viewport);\n    if (ren)\n      {\n      if (ren->GetRenderWindow())\n        {\n        dpi = static_cast<unsigned int>(ren->GetRenderWindow()->GetDPI());\n        }\n      }\n\n    if (!vtkMathTextUtilities::GetInstance()->RenderString(\n          this->Input.c_str(), this->ImageData.GetPointer(),\n          this->TextProperty.GetPointer(), dpi))\n      {\n      vtkErrorMacro(<<\"Failed rendering text to buffer\");\n      return 0;\n      }\n\n    this->ComputeRectangle();\n\n    this->ImageData->Modified();\n    this->Texture->SetInputData(this->ImageData.GetPointer());\n    this->Texture->Modified();\n    }\n\n  \/\/ Everything is built, just have to render\n  return this->vtkActor2D::RenderOpaqueGeometry(viewport);\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Description:\n\/\/ Does this prop have some translucent polygonal geometry?\nint vtkMathTextActor::HasTranslucentPolygonalGeometry()\n{\n  return 0;\n}\n\n\/\/ ----------------------------------------------------------------------------\nvoid vtkMathTextActor::ComputeRectangle()\n{\n  int dims[3];\n  this->RectanglePoints->Reset();\n  this->ImageData->GetDimensions(dims);\n\n  \/\/ compute TCoords.\n  vtkFloatArray* tc = vtkFloatArray::SafeDownCast\n      ( this->Rectangle->GetPointData()->GetTCoords() );\n  tc->InsertComponent(0, 0, 0.0);\n  tc->InsertComponent(0, 1, 0.0);\n\n  tc->InsertComponent(1, 0, 0.0);\n  tc->InsertComponent(1, 1, 1.0);\n\n  tc->InsertComponent(2, 0, 1.0);\n  tc->InsertComponent(2, 1, 1.0);\n\n  tc->InsertComponent(3, 0, 1.0);\n  tc->InsertComponent(3, 1, 0.0);\n\n  \/\/ Rotate the rectangle\n  double radians = vtkMath::RadiansFromDegrees(\n        this->TextProperty->GetOrientation());\n  double c = cos( radians );\n  double s = sin( radians );\n  double xo, yo;\n  double x, y;\n  double maxHeight;\n  xo = yo = 0.0;\n  maxHeight = 0;\n  switch ( this->TextProperty->GetJustification() )\n    {\n    default:\n    case VTK_TEXT_LEFT:\n      break;\n    case VTK_TEXT_CENTERED:\n      xo = -dims[0] * 0.5;\n      break;\n    case VTK_TEXT_RIGHT:\n      xo = -dims[0];\n    }\n  switch ( this->TextProperty->GetVerticalJustification())\n    {\n    default:\n    case VTK_TEXT_BOTTOM:\n      break;\n    case VTK_TEXT_CENTERED:\n      yo = -dims[1] * 0.5;\n      break;\n    case VTK_TEXT_TOP:\n      yo = -dims[1];\n      break;\n    }\n  \/\/ handle line offset\n  yo += this->TextProperty->GetLineOffset();\n\n  x = xo;\n  y = yo;\n  this->RectanglePoints->InsertNextPoint( c*x-s*y, s*x+c*y, 0.0 );\n  x = xo;\n  y = yo + dims[1];\n  this->RectanglePoints->InsertNextPoint( c*x-s*y, s*x+c*y, 0.0 );\n  x = xo + dims[0];\n  y = yo + dims[1];\n  this->RectanglePoints->InsertNextPoint( c*x-s*y, s*x+c*y, 0.0 );\n  x = xo + dims[0];\n  y = yo;\n  this->RectanglePoints->InsertNextPoint( c*x-s*y, s*x+c*y, 0.0 );\n}\n\n\/\/ ----------------------------------------------------------------------------\nvoid vtkMathTextActor::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os,indent);\n\n  if (this->TextProperty.GetPointer())\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  os << indent << \"Image Data:\\n\";\n  this->ImageData->PrintSelf(os,indent.GetNextIndent());\n\n  os << indent << \"Input:\\n\"\n     << indent.GetNextIndent() << this->Input.c_str() << \"\\n\";\n\n  os << indent << \"Rectangle:\\n\";\n  this->Rectangle->PrintSelf(os,indent.GetNextIndent());\n\n  os << indent << \"Rectangle Points:\\n\";\n  this->RectanglePoints->PrintSelf(os,indent.GetNextIndent());\n\n  os << indent << \"Texture:\\n\";\n  this->Texture->PrintSelf(os,indent.GetNextIndent());\n}\n<commit_msg>fix unused variable warning<commit_after>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkMathTextActor.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 \"vtkMathTextActor.h\"\n\n#include \"vtkCellArray.h\"\n#include \"vtkFloatArray.h\"\n#include \"vtkImageData.h\"\n#include \"vtkMath.h\"\n#include \"vtkMathTextUtilities.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkPointData.h\"\n#include \"vtkPoints.h\"\n#include \"vtkPolyData.h\"\n#include \"vtkPolyDataMapper2D.h\"\n#include \"vtkRenderer.h\"\n#include \"vtkRenderWindow.h\"\n#include \"vtkTextProperty.h\"\n#include \"vtkTexture.h\"\n#include \"vtkViewport.h\"\n\n\/\/ ----------------------------------------------------------------------------\nvtkStandardNewMacro(vtkMathTextActor);\n\n\/\/ ----------------------------------------------------------------------------\nbool vtkMathTextActor::IsSupported()\n{\n  return vtkMathTextUtilities::GetInstance() != NULL;\n}\n\n\/\/ ----------------------------------------------------------------------------\nvtkMathTextActor::vtkMathTextActor()\n{\n  \/\/ Copied from vtkTextActor:\n  \/\/ To remain compatible with code using vtkActor2D, we must set\n  \/\/ position coord to Viewport, not Normalized Viewport\n  \/\/ so...compute equivalent coords for initial position\n  this->PositionCoordinate->SetCoordinateSystemToViewport();\n\n  \/\/ Construct texture\n  this->Rectangle->SetPoints(this->RectanglePoints.GetPointer());\n  vtkNew<vtkCellArray> polys;\n  polys->InsertNextCell(4);\n  polys->InsertCellPoint(0);\n  polys->InsertCellPoint(1);\n  polys->InsertCellPoint(2);\n  polys->InsertCellPoint(3);\n  this->Rectangle->SetPolys(polys.GetPointer());\n\n  vtkNew<vtkFloatArray> tc;\n  tc->SetNumberOfComponents(2);\n  tc->SetNumberOfTuples(4);\n  tc->InsertComponent(0,0, 0.0);  tc->InsertComponent(0,1, 0.0);\n  tc->InsertComponent(1,0, 0.0);  tc->InsertComponent(1,1, 1.0);\n  tc->InsertComponent(2,0, 1.0);  tc->InsertComponent(2,1, 1.0);\n  tc->InsertComponent(3,0, 1.0);  tc->InsertComponent(3,1, 0.0);\n  this->Rectangle->GetPointData()->SetTCoords(tc.GetPointer());\n\n  vtkNew<vtkPolyDataMapper2D> mapper;\n  this->SetMapper(mapper.GetPointer());\n  mapper->SetInputData(this->Rectangle.GetPointer());\n\n  this->TextProperty = vtkSmartPointer<vtkTextProperty>::New();\n}\n\n\/\/ ----------------------------------------------------------------------------\nvtkMathTextActor::~vtkMathTextActor()\n{\n}\n\n\/\/ ----------------------------------------------------------------------------\nconst char* vtkMathTextActor::GetInput()\n{\n  return this->Input.c_str();\n}\n\n\/\/ ----------------------------------------------------------------------------\ndouble *vtkMathTextActor::GetBounds()\n{\n  this->ComputeRectangle();\n  return this->RectanglePoints->GetBounds();\n}\n\n\/\/ ----------------------------------------------------------------------------\nvoid vtkMathTextActor::SetTextProperty(vtkTextProperty *p)\n{\n  this->TextProperty = p;\n}\n\n\/\/ ----------------------------------------------------------------------------\nvtkTextProperty *vtkMathTextActor::GetTextProperty()\n{\n  return this->TextProperty.GetPointer();\n}\n\n\/\/ ----------------------------------------------------------------------------\nvoid vtkMathTextActor::ShallowCopy(vtkProp *prop)\n{\n  vtkMathTextActor *a = vtkMathTextActor::SafeDownCast(prop);\n  if ( a != NULL )\n    {\n    this->SetTextProperty(a->GetTextProperty());\n    this->SetInput(a->GetInput());\n    }\n  this->vtkActor2D::ShallowCopy(prop);\n}\n\n\/\/ ----------------------------------------------------------------------------\nvoid vtkMathTextActor::ReleaseGraphicsResources(vtkWindow *win)\n{\n  this->vtkActor2D::ReleaseGraphicsResources(win);\n  this->Texture->ReleaseGraphicsResources(win);\n}\n\n\/\/ ----------------------------------------------------------------------------\nint vtkMathTextActor::RenderOverlay(vtkViewport *viewport)\n{\n  if (!this->Visibility)\n    {\n    return 0;\n    }\n\n  \/\/ render the texture\n  if (this->Texture.GetPointer() && !this->Input.empty())\n    {\n    vtkRenderer* ren = vtkRenderer::SafeDownCast(viewport);\n    if (ren)\n      {\n      this->Texture->Render(ren);\n      }\n    }\n\n  \/\/ Everything is built in RenderOpaqueGeometry, just have to render\n  return this->vtkActor2D::RenderOverlay(viewport);\n}\n\n\/\/ ----------------------------------------------------------------------------\nint vtkMathTextActor::RenderOpaqueGeometry(vtkViewport *viewport)\n{\n  if (!this->Visibility)\n    {\n    return 0;\n    }\n\n  \/\/ Make sure we have a string to render\n  if (this->Input.empty())\n    {\n    return 0;\n    }\n\n  \/\/check if we need to render the string\n\n  if(this->TextProperty->GetMTime() > this->ImageData->GetMTime() ||\n     this->GetMTime() > this->ImageData->GetMTime())\n    {\n    unsigned int dpi = 120;\n    vtkRenderer *ren = vtkRenderer::SafeDownCast(viewport);\n    if (ren)\n      {\n      if (ren->GetRenderWindow())\n        {\n        dpi = static_cast<unsigned int>(ren->GetRenderWindow()->GetDPI());\n        }\n      }\n\n    if (!vtkMathTextUtilities::GetInstance()->RenderString(\n          this->Input.c_str(), this->ImageData.GetPointer(),\n          this->TextProperty.GetPointer(), dpi))\n      {\n      vtkErrorMacro(<<\"Failed rendering text to buffer\");\n      return 0;\n      }\n\n    this->ComputeRectangle();\n\n    this->ImageData->Modified();\n    this->Texture->SetInputData(this->ImageData.GetPointer());\n    this->Texture->Modified();\n    }\n\n  \/\/ Everything is built, just have to render\n  return this->vtkActor2D::RenderOpaqueGeometry(viewport);\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Description:\n\/\/ Does this prop have some translucent polygonal geometry?\nint vtkMathTextActor::HasTranslucentPolygonalGeometry()\n{\n  return 0;\n}\n\n\/\/ ----------------------------------------------------------------------------\nvoid vtkMathTextActor::ComputeRectangle()\n{\n  int dims[3];\n  this->RectanglePoints->Reset();\n  this->ImageData->GetDimensions(dims);\n\n  \/\/ compute TCoords.\n  vtkFloatArray* tc = vtkFloatArray::SafeDownCast\n      ( this->Rectangle->GetPointData()->GetTCoords() );\n  tc->InsertComponent(0, 0, 0.0);\n  tc->InsertComponent(0, 1, 0.0);\n\n  tc->InsertComponent(1, 0, 0.0);\n  tc->InsertComponent(1, 1, 1.0);\n\n  tc->InsertComponent(2, 0, 1.0);\n  tc->InsertComponent(2, 1, 1.0);\n\n  tc->InsertComponent(3, 0, 1.0);\n  tc->InsertComponent(3, 1, 0.0);\n\n  \/\/ Rotate the rectangle\n  double radians = vtkMath::RadiansFromDegrees(\n        this->TextProperty->GetOrientation());\n  double c = cos( radians );\n  double s = sin( radians );\n  double xo, yo;\n  double x, y;\n  xo = yo = 0.0;\n  switch ( this->TextProperty->GetJustification() )\n    {\n    default:\n    case VTK_TEXT_LEFT:\n      break;\n    case VTK_TEXT_CENTERED:\n      xo = -dims[0] * 0.5;\n      break;\n    case VTK_TEXT_RIGHT:\n      xo = -dims[0];\n    }\n  switch ( this->TextProperty->GetVerticalJustification())\n    {\n    default:\n    case VTK_TEXT_BOTTOM:\n      break;\n    case VTK_TEXT_CENTERED:\n      yo = -dims[1] * 0.5;\n      break;\n    case VTK_TEXT_TOP:\n      yo = -dims[1];\n      break;\n    }\n  \/\/ handle line offset\n  yo += this->TextProperty->GetLineOffset();\n\n  x = xo;\n  y = yo;\n  this->RectanglePoints->InsertNextPoint( c*x-s*y, s*x+c*y, 0.0 );\n  x = xo;\n  y = yo + dims[1];\n  this->RectanglePoints->InsertNextPoint( c*x-s*y, s*x+c*y, 0.0 );\n  x = xo + dims[0];\n  y = yo + dims[1];\n  this->RectanglePoints->InsertNextPoint( c*x-s*y, s*x+c*y, 0.0 );\n  x = xo + dims[0];\n  y = yo;\n  this->RectanglePoints->InsertNextPoint( c*x-s*y, s*x+c*y, 0.0 );\n}\n\n\/\/ ----------------------------------------------------------------------------\nvoid vtkMathTextActor::PrintSelf(ostream& os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os,indent);\n\n  if (this->TextProperty.GetPointer())\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  os << indent << \"Image Data:\\n\";\n  this->ImageData->PrintSelf(os,indent.GetNextIndent());\n\n  os << indent << \"Input:\\n\"\n     << indent.GetNextIndent() << this->Input.c_str() << \"\\n\";\n\n  os << indent << \"Rectangle:\\n\";\n  this->Rectangle->PrintSelf(os,indent.GetNextIndent());\n\n  os << indent << \"Rectangle Points:\\n\";\n  this->RectanglePoints->PrintSelf(os,indent.GetNextIndent());\n\n  os << indent << \"Texture:\\n\";\n  this->Texture->PrintSelf(os,indent.GetNextIndent());\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: scabstdlg.cxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: vg $ $Date: 2007-10-15 13:13: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_sc.hxx\"\n\n#include \"scabstdlg.hxx\"\n\n#include <osl\/module.hxx>\n#include <rtl\/ustrbuf.hxx>\n\nusing ::rtl::OUStringBuffer;\n\ntypedef ScAbstractDialogFactory* (__LOADONCALLAPI *ScFuncPtrCreateDialogFactory)();\n\nextern \"C\" { static void SAL_CALL thisModule() {} }\n\nScAbstractDialogFactory* ScAbstractDialogFactory::Create()\n{\n    ScFuncPtrCreateDialogFactory fp = 0;\n    static ::osl::Module aDialogLibrary;\n\n    OUStringBuffer aStrBuf;\n    aStrBuf.appendAscii( SVLIBRARY(\"scui\") );\n\n    if ( aDialogLibrary.is() || aDialogLibrary.loadRelative( &thisModule, aStrBuf.makeStringAndClear() ) )\n        fp = ( ScAbstractDialogFactory* (__LOADONCALLAPI*)() )\n            aDialogLibrary.getFunctionSymbol( ::rtl::OUString::createFromAscii(\"CreateDialogFactory\") );\n    if ( fp )\n        return fp();\n    return 0;\n}\n<commit_msg>INTEGRATION: CWS changefileheader (1.8.164); FILE MERGED 2008\/03\/31 17:15:10 rt 1.8.164.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: scabstdlg.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_sc.hxx\"\n\n#include \"scabstdlg.hxx\"\n\n#include <osl\/module.hxx>\n#include <rtl\/ustrbuf.hxx>\n\nusing ::rtl::OUStringBuffer;\n\ntypedef ScAbstractDialogFactory* (__LOADONCALLAPI *ScFuncPtrCreateDialogFactory)();\n\nextern \"C\" { static void SAL_CALL thisModule() {} }\n\nScAbstractDialogFactory* ScAbstractDialogFactory::Create()\n{\n    ScFuncPtrCreateDialogFactory fp = 0;\n    static ::osl::Module aDialogLibrary;\n\n    OUStringBuffer aStrBuf;\n    aStrBuf.appendAscii( SVLIBRARY(\"scui\") );\n\n    if ( aDialogLibrary.is() || aDialogLibrary.loadRelative( &thisModule, aStrBuf.makeStringAndClear() ) )\n        fp = ( ScAbstractDialogFactory* (__LOADONCALLAPI*)() )\n            aDialogLibrary.getFunctionSymbol( ::rtl::OUString::createFromAscii(\"CreateDialogFactory\") );\n    if ( fp )\n        return fp();\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: drtxtob2.cxx,v $\n *\n *  $Revision: 1.14 $\n *\n *  last change: $Author: kz $ $Date: 2006-07-21 13:48: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sc.hxx\"\n\n\n\n\/\/-------------------------------------------------------------------------\n\n#include \"scitems.hxx\"\n#include <svx\/adjitem.hxx>\n#include <svx\/drawitem.hxx>\n#include <svx\/fontwork.hxx>\n#include <svx\/frmdiritem.hxx>\n#include <svx\/outlobj.hxx>\n#include <svx\/svdocapt.hxx>\n#include <svx\/xtextit.hxx>\n#ifndef _SVX_WRITINGMODEITEM_HXX\n#include <svx\/writingmodeitem.hxx>\n#endif\n#include <sfx2\/bindings.hxx>\n#include <sfx2\/viewfrm.hxx>\n#include <sfx2\/objsh.hxx>\n#include <sfx2\/request.hxx>\n#include <sot\/formats.hxx>\n#include <svtools\/whiter.hxx>\n\n#include \"sc.hrc\"\n#include \"drtxtob.hxx\"\n#include \"viewdata.hxx\"\n#include \"drawview.hxx\"\n#include \"tabvwsh.hxx\"\n#include \"impex.hxx\"\n#include \"docsh.hxx\"\n#include \"transobj.hxx\"\n#include \"drwtrans.hxx\"\n\n\/\/------------------------------------------------------------------------\n\nUSHORT ScGetFontWorkId()\n{\n    return SvxFontWorkChildWindow::GetChildWindowId();\n}\n\nBOOL ScDrawTextObjectBar::IsNoteEdit()\n{\n    ScTabView* pTabView = pViewData->GetView();\n    SdrView*   pSdrView = pTabView->GetSdrView();\n    SdrObject* pObject  = pSdrView->GetTextEditObject();\n    return ( pObject && pObject->GetLayer() == SC_LAYER_INTERN && pObject->ISA( SdrCaptionObj ) );\n}\n\n\/\/  wenn kein Text editiert wird, Funktionen wie in drawsh\n\nvoid __EXPORT ScDrawTextObjectBar::ExecuteGlobal( SfxRequest &rReq )\n{\n    ScTabView*   pTabView  = pViewData->GetView();\n    ScDrawView*  pView     = pTabView->GetScDrawView();\n\n    USHORT nSlot = rReq.GetSlot();\n    switch ( nSlot )\n    {\n        case SID_COPY:\n            pView->DoCopy();\n            break;\n\n        case SID_CUT:\n            pView->DoCut();\n            if (!pTabView->IsDrawSelMode())\n                pViewData->GetViewShell()->SetDrawShell( FALSE );\n            break;\n\n        case SID_PASTE:\n        case FID_PASTE_CONTENTS:\n        case SID_CLIPBOARD_FORMAT_ITEMS:\n        case SID_HYPERLINK_SETLINK:\n            {\n                \/\/  cell methods are at cell shell, which is not available if\n                \/\/  ScDrawTextObjectBar is active\n                \/\/! move paste etc. to view shell?\n            }\n            break;\n\n        case SID_SELECTALL:\n            pView->MarkAll();\n            break;\n\n        case SID_TEXTDIRECTION_LEFT_TO_RIGHT:\n        case SID_TEXTDIRECTION_TOP_TO_BOTTOM:\n            {\n                SfxItemSet aAttr( pView->GetModel()->GetItemPool(), SDRATTR_TEXTDIRECTION, SDRATTR_TEXTDIRECTION, 0 );\n                aAttr.Put( SvxWritingModeItem( nSlot == SID_TEXTDIRECTION_LEFT_TO_RIGHT ? com::sun::star::text::WritingMode_LR_TB : com::sun::star::text::WritingMode_TB_RL ) );\n                pView->SetAttributes( aAttr );\n                pViewData->GetScDrawView()->InvalidateDrawTextAttrs();  \/\/ Bidi slots may be disabled\n                rReq.Done( aAttr );\n            }\n            break;\n\n        case SID_ENABLE_HYPHENATION:\n            {\n                SFX_REQUEST_ARG( rReq, pItem, SfxBoolItem, SID_ENABLE_HYPHENATION, FALSE);\n                if( pItem )\n                {\n                    SfxItemSet aSet( GetPool(), EE_PARA_HYPHENATE, EE_PARA_HYPHENATE );\n                    BOOL bValue = ( (const SfxBoolItem*) pItem)->GetValue();\n                    aSet.Put( SfxBoolItem( EE_PARA_HYPHENATE, bValue ) );\n                    pView->SetAttributes( aSet );\n                }\n                rReq.Done();\n            }\n            break;\n    }\n}\n\nvoid ScDrawTextObjectBar::GetGlobalClipState( SfxItemSet& rSet )\n{\n    \/\/  cell methods are at cell shell, which is not available if\n    \/\/  ScDrawTextObjectBar is active -> disable everything\n    \/\/! move paste etc. to view shell?\n\n    SfxWhichIter aIter(rSet);\n    USHORT nWhich = aIter.FirstWhich();\n    while (nWhich)\n    {\n        rSet.DisableItem( nWhich );\n        nWhich = aIter.NextWhich();\n    }\n}\n\nvoid __EXPORT ScDrawTextObjectBar::ExecuteExtra( SfxRequest &rReq )\n{\n    ScTabView*   pTabView  = pViewData->GetView();\n    ScDrawView*  pView     = pTabView->GetScDrawView();\n\n    USHORT nSlot = rReq.GetSlot();\n    switch ( nSlot )\n    {\n        case SID_FONTWORK:\n            {\n                USHORT nId = SvxFontWorkChildWindow::GetChildWindowId();\n                SfxViewFrame* pViewFrm = pViewData->GetViewShell()->GetViewFrame();\n\n                if ( rReq.GetArgs() )\n                    pViewFrm->SetChildWindow( nId,\n                                               ((const SfxBoolItem&)\n                                                (rReq.GetArgs()->Get(SID_FONTWORK))).\n                                                    GetValue() );\n                else\n                    pViewFrm->ToggleChildWindow( nId );\n\n                pViewFrm->GetBindings().Invalidate( SID_FONTWORK );\n                rReq.Done();\n            }\n            break;\n\n        case SID_ATTR_PARA_LEFT_TO_RIGHT:\n        case SID_ATTR_PARA_RIGHT_TO_LEFT:\n            {\n                SfxItemSet aAttr( pView->GetModel()->GetItemPool(),\n                                    EE_PARA_WRITINGDIR, EE_PARA_WRITINGDIR,\n                                    EE_PARA_JUST, EE_PARA_JUST,\n                                    0 );\n                BOOL bLeft = ( nSlot == SID_ATTR_PARA_LEFT_TO_RIGHT );\n                aAttr.Put( SvxFrameDirectionItem(\n                                bLeft ? FRMDIR_HORI_LEFT_TOP : FRMDIR_HORI_RIGHT_TOP,\n                                EE_PARA_WRITINGDIR ) );\n                aAttr.Put( SvxAdjustItem(\n                                bLeft ? SVX_ADJUST_LEFT : SVX_ADJUST_RIGHT,\n                                EE_PARA_JUST ) );\n                pView->SetAttributes( aAttr );\n                pViewData->GetScDrawView()->InvalidateDrawTextAttrs();\n                rReq.Done();        \/\/! Done(aAttr) ?\n\n            }\n            break;\n    }\n}\n\nvoid ScDrawTextObjectBar::ExecFormText(SfxRequest& rReq)\n{\n    ScTabView*          pTabView    = pViewData->GetView();\n    ScDrawView*         pDrView     = pTabView->GetScDrawView();\n    const SdrMarkList&  rMarkList   = pDrView->GetMarkedObjectList();\n\n    if ( rMarkList.GetMarkCount() == 1 && rReq.GetArgs() )\n    {\n        const SfxItemSet& rSet = *rReq.GetArgs();\n        const SfxPoolItem* pItem;\n\n        if ( pDrView->IsTextEdit() )\n            pDrView->ScEndTextEdit();\n\n        if (    SFX_ITEM_SET ==\n                rSet.GetItemState(XATTR_FORMTXTSTDFORM, TRUE, &pItem)\n             && XFTFORM_NONE !=\n                ((const XFormTextStdFormItem*) pItem)->GetValue() )\n        {\n\n            USHORT nId              = SvxFontWorkChildWindow::GetChildWindowId();\n            SfxViewFrame* pViewFrm  = pViewData->GetViewShell()->GetViewFrame();\n            SvxFontWorkDialog* pDlg = (SvxFontWorkDialog*)\n                                       (pViewFrm->\n                                            GetChildWindow(nId)->GetWindow());\n\n            pDlg->CreateStdFormObj(*pDrView, *pDrView->GetPageViewPvNum(0),\n                                    rSet, *rMarkList.GetMark(0)->GetObj(),\n                                   ((const XFormTextStdFormItem*) pItem)->\n                                   GetValue());\n        }\n        else\n            pDrView->SetAttributes(rSet);\n    }\n}\n\nvoid ScDrawTextObjectBar::GetFormTextState(SfxItemSet& rSet)\n{\n    const SdrObject*    pObj        = NULL;\n    SvxFontWorkDialog*  pDlg        = NULL;\n    ScDrawView*         pDrView     = pViewData->GetView()->GetScDrawView();\n    const SdrMarkList&  rMarkList   = pDrView->GetMarkedObjectList();\n    USHORT              nId = SvxFontWorkChildWindow::GetChildWindowId();\n\n    SfxViewFrame* pViewFrm = pViewData->GetViewShell()->GetViewFrame();\n    if ( pViewFrm->HasChildWindow(nId) )\n        pDlg = (SvxFontWorkDialog*)(pViewFrm->GetChildWindow(nId)->GetWindow());\n\n    if ( rMarkList.GetMarkCount() == 1 )\n        pObj = rMarkList.GetMark(0)->GetObj();\n\n    if ( pObj == NULL || !pObj->ISA(SdrTextObj) ||\n        !((SdrTextObj*) pObj)->HasText() )\n    {\n        if ( pDlg )\n            pDlg->SetActive(FALSE);\n\n        rSet.DisableItem(XATTR_FORMTXTSTYLE);\n        rSet.DisableItem(XATTR_FORMTXTADJUST);\n        rSet.DisableItem(XATTR_FORMTXTDISTANCE);\n        rSet.DisableItem(XATTR_FORMTXTSTART);\n        rSet.DisableItem(XATTR_FORMTXTMIRROR);\n        rSet.DisableItem(XATTR_FORMTXTSTDFORM);\n        rSet.DisableItem(XATTR_FORMTXTHIDEFORM);\n        rSet.DisableItem(XATTR_FORMTXTOUTLINE);\n        rSet.DisableItem(XATTR_FORMTXTSHADOW);\n        rSet.DisableItem(XATTR_FORMTXTSHDWCOLOR);\n        rSet.DisableItem(XATTR_FORMTXTSHDWXVAL);\n        rSet.DisableItem(XATTR_FORMTXTSHDWYVAL);\n    }\n    else\n    {\n        if ( pDlg )\n        {\n            SfxObjectShell* pDocSh = SfxObjectShell::Current();\n\n            if ( pDocSh )\n            {\n                const SfxPoolItem*  pItem = pDocSh->GetItem( ITEMID_COLOR_TABLE );\n                XColorTable*        pColorTable = NULL;\n\n                if ( pItem )\n                    pColorTable = ((SvxColorTableItem*)pItem)->GetColorTable();\n\n                pDlg->SetActive();\n\n                if ( pColorTable )\n                    pDlg->SetColorTable( pColorTable );\n                else\n                    { DBG_ERROR( \"ColorList not found :-\/\" ); }\n            }\n        }\n        SfxItemSet aViewAttr(pDrView->GetModel()->GetItemPool());\n        pDrView->GetAttributes(aViewAttr);\n        rSet.Set(aViewAttr);\n    }\n}\n\n\n\n\n<commit_msg>INTEGRATION: CWS aw035 (1.13.224); FILE MERGED 2006\/07\/13 15:04:11 aw 1.13.224.1: #126320# SdrMark::GetObj() -> SdrMark::GetMarkedSdrObj() for isolating selection handling<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: drtxtob2.cxx,v $\n *\n *  $Revision: 1.15 $\n *\n *  last change: $Author: rt $ $Date: 2006-07-25 12:25: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_sc.hxx\"\n\n\n\n\/\/-------------------------------------------------------------------------\n\n#include \"scitems.hxx\"\n#include <svx\/adjitem.hxx>\n#include <svx\/drawitem.hxx>\n#include <svx\/fontwork.hxx>\n#include <svx\/frmdiritem.hxx>\n#include <svx\/outlobj.hxx>\n#include <svx\/svdocapt.hxx>\n#include <svx\/xtextit.hxx>\n#ifndef _SVX_WRITINGMODEITEM_HXX\n#include <svx\/writingmodeitem.hxx>\n#endif\n#include <sfx2\/bindings.hxx>\n#include <sfx2\/viewfrm.hxx>\n#include <sfx2\/objsh.hxx>\n#include <sfx2\/request.hxx>\n#include <sot\/formats.hxx>\n#include <svtools\/whiter.hxx>\n\n#include \"sc.hrc\"\n#include \"drtxtob.hxx\"\n#include \"viewdata.hxx\"\n#include \"drawview.hxx\"\n#include \"tabvwsh.hxx\"\n#include \"impex.hxx\"\n#include \"docsh.hxx\"\n#include \"transobj.hxx\"\n#include \"drwtrans.hxx\"\n\n\/\/------------------------------------------------------------------------\n\nUSHORT ScGetFontWorkId()\n{\n    return SvxFontWorkChildWindow::GetChildWindowId();\n}\n\nBOOL ScDrawTextObjectBar::IsNoteEdit()\n{\n    ScTabView* pTabView = pViewData->GetView();\n    SdrView*   pSdrView = pTabView->GetSdrView();\n    SdrObject* pObject  = pSdrView->GetTextEditObject();\n    return ( pObject && pObject->GetLayer() == SC_LAYER_INTERN && pObject->ISA( SdrCaptionObj ) );\n}\n\n\/\/  wenn kein Text editiert wird, Funktionen wie in drawsh\n\nvoid __EXPORT ScDrawTextObjectBar::ExecuteGlobal( SfxRequest &rReq )\n{\n    ScTabView*   pTabView  = pViewData->GetView();\n    ScDrawView*  pView     = pTabView->GetScDrawView();\n\n    USHORT nSlot = rReq.GetSlot();\n    switch ( nSlot )\n    {\n        case SID_COPY:\n            pView->DoCopy();\n            break;\n\n        case SID_CUT:\n            pView->DoCut();\n            if (!pTabView->IsDrawSelMode())\n                pViewData->GetViewShell()->SetDrawShell( FALSE );\n            break;\n\n        case SID_PASTE:\n        case FID_PASTE_CONTENTS:\n        case SID_CLIPBOARD_FORMAT_ITEMS:\n        case SID_HYPERLINK_SETLINK:\n            {\n                \/\/  cell methods are at cell shell, which is not available if\n                \/\/  ScDrawTextObjectBar is active\n                \/\/! move paste etc. to view shell?\n            }\n            break;\n\n        case SID_SELECTALL:\n            pView->MarkAll();\n            break;\n\n        case SID_TEXTDIRECTION_LEFT_TO_RIGHT:\n        case SID_TEXTDIRECTION_TOP_TO_BOTTOM:\n            {\n                SfxItemSet aAttr( pView->GetModel()->GetItemPool(), SDRATTR_TEXTDIRECTION, SDRATTR_TEXTDIRECTION, 0 );\n                aAttr.Put( SvxWritingModeItem( nSlot == SID_TEXTDIRECTION_LEFT_TO_RIGHT ? com::sun::star::text::WritingMode_LR_TB : com::sun::star::text::WritingMode_TB_RL ) );\n                pView->SetAttributes( aAttr );\n                pViewData->GetScDrawView()->InvalidateDrawTextAttrs();  \/\/ Bidi slots may be disabled\n                rReq.Done( aAttr );\n            }\n            break;\n\n        case SID_ENABLE_HYPHENATION:\n            {\n                SFX_REQUEST_ARG( rReq, pItem, SfxBoolItem, SID_ENABLE_HYPHENATION, FALSE);\n                if( pItem )\n                {\n                    SfxItemSet aSet( GetPool(), EE_PARA_HYPHENATE, EE_PARA_HYPHENATE );\n                    BOOL bValue = ( (const SfxBoolItem*) pItem)->GetValue();\n                    aSet.Put( SfxBoolItem( EE_PARA_HYPHENATE, bValue ) );\n                    pView->SetAttributes( aSet );\n                }\n                rReq.Done();\n            }\n            break;\n    }\n}\n\nvoid ScDrawTextObjectBar::GetGlobalClipState( SfxItemSet& rSet )\n{\n    \/\/  cell methods are at cell shell, which is not available if\n    \/\/  ScDrawTextObjectBar is active -> disable everything\n    \/\/! move paste etc. to view shell?\n\n    SfxWhichIter aIter(rSet);\n    USHORT nWhich = aIter.FirstWhich();\n    while (nWhich)\n    {\n        rSet.DisableItem( nWhich );\n        nWhich = aIter.NextWhich();\n    }\n}\n\nvoid __EXPORT ScDrawTextObjectBar::ExecuteExtra( SfxRequest &rReq )\n{\n    ScTabView*   pTabView  = pViewData->GetView();\n    ScDrawView*  pView     = pTabView->GetScDrawView();\n\n    USHORT nSlot = rReq.GetSlot();\n    switch ( nSlot )\n    {\n        case SID_FONTWORK:\n            {\n                USHORT nId = SvxFontWorkChildWindow::GetChildWindowId();\n                SfxViewFrame* pViewFrm = pViewData->GetViewShell()->GetViewFrame();\n\n                if ( rReq.GetArgs() )\n                    pViewFrm->SetChildWindow( nId,\n                                               ((const SfxBoolItem&)\n                                                (rReq.GetArgs()->Get(SID_FONTWORK))).\n                                                    GetValue() );\n                else\n                    pViewFrm->ToggleChildWindow( nId );\n\n                pViewFrm->GetBindings().Invalidate( SID_FONTWORK );\n                rReq.Done();\n            }\n            break;\n\n        case SID_ATTR_PARA_LEFT_TO_RIGHT:\n        case SID_ATTR_PARA_RIGHT_TO_LEFT:\n            {\n                SfxItemSet aAttr( pView->GetModel()->GetItemPool(),\n                                    EE_PARA_WRITINGDIR, EE_PARA_WRITINGDIR,\n                                    EE_PARA_JUST, EE_PARA_JUST,\n                                    0 );\n                BOOL bLeft = ( nSlot == SID_ATTR_PARA_LEFT_TO_RIGHT );\n                aAttr.Put( SvxFrameDirectionItem(\n                                bLeft ? FRMDIR_HORI_LEFT_TOP : FRMDIR_HORI_RIGHT_TOP,\n                                EE_PARA_WRITINGDIR ) );\n                aAttr.Put( SvxAdjustItem(\n                                bLeft ? SVX_ADJUST_LEFT : SVX_ADJUST_RIGHT,\n                                EE_PARA_JUST ) );\n                pView->SetAttributes( aAttr );\n                pViewData->GetScDrawView()->InvalidateDrawTextAttrs();\n                rReq.Done();        \/\/! Done(aAttr) ?\n\n            }\n            break;\n    }\n}\n\nvoid ScDrawTextObjectBar::ExecFormText(SfxRequest& rReq)\n{\n    ScTabView*          pTabView    = pViewData->GetView();\n    ScDrawView*         pDrView     = pTabView->GetScDrawView();\n    const SdrMarkList&  rMarkList   = pDrView->GetMarkedObjectList();\n\n    if ( rMarkList.GetMarkCount() == 1 && rReq.GetArgs() )\n    {\n        const SfxItemSet& rSet = *rReq.GetArgs();\n        const SfxPoolItem* pItem;\n\n        if ( pDrView->IsTextEdit() )\n            pDrView->ScEndTextEdit();\n\n        if (    SFX_ITEM_SET ==\n                rSet.GetItemState(XATTR_FORMTXTSTDFORM, TRUE, &pItem)\n             && XFTFORM_NONE !=\n                ((const XFormTextStdFormItem*) pItem)->GetValue() )\n        {\n\n            USHORT nId              = SvxFontWorkChildWindow::GetChildWindowId();\n            SfxViewFrame* pViewFrm  = pViewData->GetViewShell()->GetViewFrame();\n            SvxFontWorkDialog* pDlg = (SvxFontWorkDialog*)\n                                       (pViewFrm->\n                                            GetChildWindow(nId)->GetWindow());\n\n            pDlg->CreateStdFormObj(*pDrView, *pDrView->GetPageViewPvNum(0),\n                                    rSet, *rMarkList.GetMark(0)->GetMarkedSdrObj(),\n                                   ((const XFormTextStdFormItem*) pItem)->\n                                   GetValue());\n        }\n        else\n            pDrView->SetAttributes(rSet);\n    }\n}\n\nvoid ScDrawTextObjectBar::GetFormTextState(SfxItemSet& rSet)\n{\n    const SdrObject*    pObj        = NULL;\n    SvxFontWorkDialog*  pDlg        = NULL;\n    ScDrawView*         pDrView     = pViewData->GetView()->GetScDrawView();\n    const SdrMarkList&  rMarkList   = pDrView->GetMarkedObjectList();\n    USHORT              nId = SvxFontWorkChildWindow::GetChildWindowId();\n\n    SfxViewFrame* pViewFrm = pViewData->GetViewShell()->GetViewFrame();\n    if ( pViewFrm->HasChildWindow(nId) )\n        pDlg = (SvxFontWorkDialog*)(pViewFrm->GetChildWindow(nId)->GetWindow());\n\n    if ( rMarkList.GetMarkCount() == 1 )\n        pObj = rMarkList.GetMark(0)->GetMarkedSdrObj();\n\n    if ( pObj == NULL || !pObj->ISA(SdrTextObj) ||\n        !((SdrTextObj*) pObj)->HasText() )\n    {\n        if ( pDlg )\n            pDlg->SetActive(FALSE);\n\n        rSet.DisableItem(XATTR_FORMTXTSTYLE);\n        rSet.DisableItem(XATTR_FORMTXTADJUST);\n        rSet.DisableItem(XATTR_FORMTXTDISTANCE);\n        rSet.DisableItem(XATTR_FORMTXTSTART);\n        rSet.DisableItem(XATTR_FORMTXTMIRROR);\n        rSet.DisableItem(XATTR_FORMTXTSTDFORM);\n        rSet.DisableItem(XATTR_FORMTXTHIDEFORM);\n        rSet.DisableItem(XATTR_FORMTXTOUTLINE);\n        rSet.DisableItem(XATTR_FORMTXTSHADOW);\n        rSet.DisableItem(XATTR_FORMTXTSHDWCOLOR);\n        rSet.DisableItem(XATTR_FORMTXTSHDWXVAL);\n        rSet.DisableItem(XATTR_FORMTXTSHDWYVAL);\n    }\n    else\n    {\n        if ( pDlg )\n        {\n            SfxObjectShell* pDocSh = SfxObjectShell::Current();\n\n            if ( pDocSh )\n            {\n                const SfxPoolItem*  pItem = pDocSh->GetItem( ITEMID_COLOR_TABLE );\n                XColorTable*        pColorTable = NULL;\n\n                if ( pItem )\n                    pColorTable = ((SvxColorTableItem*)pItem)->GetColorTable();\n\n                pDlg->SetActive();\n\n                if ( pColorTable )\n                    pDlg->SetColorTable( pColorTable );\n                else\n                    { DBG_ERROR( \"ColorList not found :-\/\" ); }\n            }\n        }\n        SfxItemSet aViewAttr(pDrView->GetModel()->GetItemPool());\n        pDrView->GetAttributes(aViewAttr);\n        rSet.Set(aViewAttr);\n    }\n}\n\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"config.h\"\n\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\n#include \"base\/file_util.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/path_service.h\"\n#include \"base\/string_util.h\"\n#include \"webkit\/tools\/test_shell\/test_shell_test.h\"\n\nnamespace {\n\nclass BookmarkletTest : public TestShellTest {\n public:\n  virtual void SetUp() {\n    TestShellTest::SetUp();\n\n    test_shell_->LoadURL(L\"data:text\/html,start page\");\n    test_shell_->WaitTestFinished();\n  }\n};\n\n}\n\nTEST_F(BookmarkletTest, Redirect) {\n  test_shell_->LoadURL(L\"javascript:location.href='data:text\/plain,SUCCESS'\");\n  test_shell_->WaitTestFinished();\n  std::wstring text = test_shell_->GetDocumentText();\n  EXPECT_EQ(L\"SUCCESS\", text);\n}\n\nTEST_F(BookmarkletTest, NonEmptyResult) {\n  test_shell_->LoadURL(L\"javascript:false\");\n  MessageLoop::current()->RunAllPending();\n  std::wstring text = test_shell_->GetDocumentText();\n  EXPECT_EQ(L\"false\", text);\n\n  test_shell_->LoadURL(L\"javascript:'hello world'\");\n  MessageLoop::current()->RunAllPending();\n  text = test_shell_->GetDocumentText();\n  EXPECT_EQ(L\"hello world\", text);\n}\n\nTEST_F(BookmarkletTest, DocumentWrite) {\n  test_shell_->LoadURL(\n      L\"javascript:document.open();\"\n      L\"document.write('hello world');\"\n      L\"document.close()\");\n  MessageLoop::current()->RunAllPending();\n  std::wstring text = test_shell_->GetDocumentText();\n  EXPECT_EQ(L\"hello world\", text);\n}\n\n<commit_msg>Disable this bookmarklet test since it covers functionality that JSC doesn't support.<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 \"testing\/gtest\/include\/gtest\/gtest.h\"\n\n#include \"base\/file_util.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/path_service.h\"\n#include \"base\/string_util.h\"\n#include \"webkit\/tools\/test_shell\/test_shell_test.h\"\n\nnamespace {\n\nclass BookmarkletTest : public TestShellTest {\n public:\n  virtual void SetUp() {\n    TestShellTest::SetUp();\n\n    test_shell_->LoadURL(L\"data:text\/html,start page\");\n    test_shell_->WaitTestFinished();\n  }\n};\n\n}\n\nTEST_F(BookmarkletTest, Redirect) {\n  test_shell_->LoadURL(L\"javascript:location.href='data:text\/plain,SUCCESS'\");\n  test_shell_->WaitTestFinished();\n  std::wstring text = test_shell_->GetDocumentText();\n  EXPECT_EQ(L\"SUCCESS\", text);\n}\n\nTEST_F(BookmarkletTest, NonEmptyResult) {\n  std::wstring text;\n\n  \/\/ TODO(darin): This test fails in a JSC build.  WebCore+JSC does not really\n  \/\/ need to support this usage until WebCore supports javascript: URLs that\n  \/\/ generate content (https:\/\/bugs.webkit.org\/show_bug.cgi?id=14959).  It is\n  \/\/ important to note that Safari does not support bookmarklets, and this is\n  \/\/ really an edge case.  Our behavior with V8 is consistent with FF and IE.\n#if 0\n  test_shell_->LoadURL(L\"javascript:false\");\n  MessageLoop::current()->RunAllPending();\n  text = test_shell_->GetDocumentText();\n  EXPECT_EQ(L\"false\", text);\n#endif\n\n  test_shell_->LoadURL(L\"javascript:'hello world'\");\n  MessageLoop::current()->RunAllPending();\n  text = test_shell_->GetDocumentText();\n  EXPECT_EQ(L\"hello world\", text);\n}\n\nTEST_F(BookmarkletTest, DocumentWrite) {\n  test_shell_->LoadURL(\n      L\"javascript:document.open();\"\n      L\"document.write('hello world');\"\n      L\"document.close()\");\n  MessageLoop::current()->RunAllPending();\n  std::wstring text = test_shell_->GetDocumentText();\n  EXPECT_EQ(L\"hello world\", text);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <algorithm>\n#include <vector>\n\n#ifndef _MERGESORT_HPP\n#define _MERGESORT_HPP 1\n\nnamespace MergeSort {\n\ttemplate<class RandomIt, class Compare>\n\tvoid Merge(RandomIt first, RandomIt middle, RandomIt end, Compare Comp) {\n\t\twhile (middle != end) {\n\t\t\twhile (first != middle && Comp(*first, *middle)) {\n\t\t\t\t++first;\n\t\t\t}\n\t\t\tif (first == middle) {\n\t\t\t\t\/\/All good\n\t\t\t\treturn;\n\t\t\t} else {\n\t\t\t\t\/\/Need to do a rotate\n\t\t\t\t\/\/\tThis moves 'middle' to the position of 'first',\n\t\t\t\t\/\/\tand shifts [first, middle) to the right one\n\t\t\t\tstd::rotate(first, middle, middle+1);\n\t\t\t\t++first;\n\t\t\t\t++middle;\n\t\t\t}\n\t\t}\n\t}\n\n\ttemplate<class RandomIt, class Compare = std::less<typename std::iterator_traits<RandomIt>::value_type>>\n\tvoid Sort(RandomIt first, RandomIt end, Compare Comp = Compare()) {\n\t\tusing DiffType = typename std::iterator_traits<RandomIt>::difference_type;\n\t\tDiffType length = end-first;\n\t\tfor (int width=1; width<length; width*=2) {\n\t\t\t\/\/We are going to merge lists of length 'width'\n\t\t\tfor (int listStart=0; listStart<length; listStart+=(width*2)) {\n\t\t\t\t\/\/These 2 lists are [listStart, listStart+width) and [listStart+width, listStart+(width*2))\n\t\t\t\tint firstPos = listStart;\n\t\t\t\tint middlePos = listStart+width;\n\t\t\t\tint endPos = listStart+(width*2);\n\t\t\t\tif (middlePos >= length) {\n\t\t\t\t\tmiddlePos = length;\n\t\t\t\t\tendPos = length;\n\t\t\t\t} else if (endPos >= length) {\n\t\t\t\t\tendPos = length;\n\t\t\t\t}\n\t\t\t\tMerge(first+firstPos, first+middlePos, first+endPos, Comp);\n\t\t\t}\n\t\t}\n\t}\n}\n\n#endif \/\/_MERGESORT_HPP<commit_msg>implemented temp list for merging in mergesort (closes #5)<commit_after>#include <algorithm>\n#include <vector>\n\n#ifndef _MERGESORT_HPP\n#define _MERGESORT_HPP 1\n\nnamespace MergeSort {\n\ttemplate<class RandomIt, class Compare>\n\tvoid Merge(RandomIt first, RandomIt middle, RandomIt end, Compare Comp) {\n\t\tusing DiffType = typename std::iterator_traits<RandomIt>::difference_type;\n\t\tusing ValueType = typename std::iterator_traits<RandomIt>::value_type;\n\t\tDiffType length = end-first;\n\t\tRandomIt leftIt = first;\n\t\tRandomIt rightIt = middle;\n\t\tstd::vector<ValueType> tempList;\n\t\ttempList.reserve(length);\n\t\twhile (leftIt != middle && rightIt != end) {\n\t\t\t\/\/While there are elements in both lists\n\t\t\tif (Comp(*leftIt,*rightIt)) {\n\t\t\t\t\/\/Left list's first element goes first\n\t\t\t\ttempList.emplace_back(*leftIt);\n\t\t\t\t++leftIt;\n\t\t\t} else {\n\t\t\t\t\/\/Right list's first element goes first\n\t\t\t\ttempList.emplace_back(*rightIt);\n\t\t\t\t++rightIt;\n\t\t\t}\n\t\t}\n\t\t\/\/Now at least one list is empty\n\t\twhile (leftIt != middle) {\n\t\t\t\/\/Insert all of the left list into the list (right is empty)\n\t\t\ttempList.emplace_back(*leftIt);\n\t\t\t++leftIt;\n\t\t}\n\t\twhile (rightIt != end) {\n\t\t\t\/\/Insert all of the right list into the list (left is empty)\n\t\t\ttempList.emplace_back(*rightIt);\n\t\t\t++rightIt;\n\t\t}\n\t\t\/\/Move temp into the given container\n\t\tstd::move(tempList.begin(), tempList.end(), first);\n\t}\n\n\ttemplate<class RandomIt, class Compare = std::less<typename std::iterator_traits<RandomIt>::value_type>>\n\tvoid Sort(RandomIt first, RandomIt end, Compare Comp = Compare()) {\n\t\tusing DiffType = typename std::iterator_traits<RandomIt>::difference_type;\n\t\tDiffType length = end-first;\n\t\tfor (int width=1; width<length; width*=2) {\n\t\t\t\/\/We are going to merge lists of length 'width'\n\t\t\tfor (int listStart=0; listStart<length; listStart+=(width*2)) {\n\t\t\t\t\/\/These 2 lists are [listStart, listStart+width) and [listStart+width, listStart+(width*2))\n\t\t\t\tint firstPos = listStart;\n\t\t\t\tint middlePos = listStart+width;\n\t\t\t\tint endPos = listStart+(width*2);\n\t\t\t\tif (middlePos >= length) {\n\t\t\t\t\tmiddlePos = length;\n\t\t\t\t\tendPos = length;\n\t\t\t\t} else if (endPos >= length) {\n\t\t\t\t\tendPos = length;\n\t\t\t\t}\n\t\t\t\tMerge(first+firstPos, first+middlePos, first+endPos, Comp);\n\t\t\t}\n\t\t}\n\t}\n}\n\n#endif \/\/_MERGESORT_HPP<|endoftext|>"}
{"text":"<commit_before>\/\/ RUN: %llvmgxx %s -S -emit-llvm -O0 -o - | FileCheck %s\n\/\/ <rdar:\/\/problem\/7929157>\n\n\/\/ Thunks should be marked as \"ODR\".\n\nstruct A {\n  virtual int f() { return 1; }\n};\n\nstruct B {\n  virtual int f() { return 2; }\n};\n\nstruct C : A, B {\n  virtual int f() { return 3; }\n};\n\nstruct D : C {\n  virtual int f() { return 4; }\n};\n\nstatic int f(D* d) {\n  B* b = d;\n  return b->f();\n};\n\nint g() {\n  D d;\n  return f(&d);\n}\n\n\/\/ CHECK: define weak_odr {{.*}} @_ZThn8_N1D1fEv\n<commit_msg>Revert r102948.<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"stdafx.h\"\n#include \"CEventLog.h\"\n#include \"CWordPerfectFilter.h\"\n#include \"LogMessages.h\"\n#include <librevenge\/librevenge.h>\n#include <librevenge-generators\/librevenge-generators.h>\n#include <librevenge-stream\/librevenge-stream.h>\n#include <libwpd\/libwpd.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nnamespace \/* anonymous *\/\n{\n\tPWSTR StrDupA2W(PCSTR ascii)\n\t{\n\t\tsize_t asciilen = strlen(ascii);\n\t\tsize_t widelen = MultiByteToWideChar(CP_ACP, 0, ascii, asciilen, nullptr, 0);\n\n\t\tPWSTR wide = (PWSTR)malloc(widelen * sizeof(wchar_t));\n\t\tMultiByteToWideChar(CP_ACP, 0, ascii, asciilen, wide, widelen);\n\t\treturn wide;\n\t}\n\n\tbool ParseGUID(GUID& guid, LPCWSTR string)\n\t{\n\t\tconst int expected_fields = 11;\n#pragma warning(suppress: 4996) \/\/ Don't warn about CRT security deprecations\n\t\tint num_fields_parsed = swscanf(string, L\"%08X-%04hX-%04hX-%02hhX%02hhX-%02hhX%02hhX%02hhX%02hhX%02hhX%02hhX\",\n\t\t\t&guid.Data1, &guid.Data2, &guid.Data3,\n\t\t\t&guid.Data4[0], &guid.Data4[1], &guid.Data4[2], &guid.Data4[3],\n\t\t\t&guid.Data4[4], &guid.Data4[5], &guid.Data4[6], &guid.Data4[7]);\n\n\t\treturn num_fields_parsed == expected_fields;\n\t}\n}\n\nclass CWordPerfectFilter::Private\n{\npublic:\n\tlibrevenge::RVNGTextTextGenerator *Generator;\n\tlibrevenge::RVNGString BodyText;\n\tbool CanParse = true;\n\tCEventLog EventLog = CEventLog(_T(\"WordPerfect Indexer\"));\n};\n\nHRESULT CWordPerfectFilter::OnInit()\n{\n\tpriv->EventLog.ReportEvent(EVENTLOG_INFORMATION_TYPE, TEXT_EXTRACTION_CATEGORY, MSG_BEGIN_IMPORT);\n\n\tpriv = new CWordPerfectFilter::Private;\n\tpriv->Generator = new librevenge::RVNGTextTextGenerator(priv->BodyText);\n\n\tSTATSTG statStg;\n\tZeroMemory(&statStg, sizeof(statStg));\n\tHRESULT hr = m_pStream->Stat(&statStg, STATFLAG_NONAME);\n\tif (hr != S_OK)\n\t{\n\t\tCString str; str.Format(L\"0x%08llX\", hr);\n\t\tCAtlArray<CString> args; args.Add(str);\n\n\t\tpriv->EventLog.ReportEvent(EVENTLOG_ERROR_TYPE, TEXT_EXTRACTION_CATEGORY, MSG_GETISTREAMLENGTH_FAILURE, args);\n\t\treturn E_UNEXPECTED;\n\t}\n\n\tsize_t StreamLength = statStg.cbSize.QuadPart;\n\tunsigned char *Buffer = (unsigned char *)malloc(StreamLength * sizeof(unsigned char));\n\thr = m_pStream->Read(Buffer, StreamLength * sizeof(unsigned char), nullptr);\n\n\tlibrevenge::RVNGStringStream RevengeStream(Buffer, StreamLength * sizeof(unsigned char));\n\tlibwpd::WPDResult wpdError = libwpd::WPDocument::parse(&RevengeStream, priv->Generator, nullptr);\n\n\tif (wpdError != libwpd::WPD_OK)\n\t{\n\t\tpriv->EventLog.ReportEvent(EVENTLOG_ERROR_TYPE, TEXT_EXTRACTION_CATEGORY, MSG_WPD_DOC_CORRUPT);\n\n\t\tswitch (wpdError)\n\t\t{\n\t\tcase libwpd::WPD_FILE_ACCESS_ERROR:\n\t\t\treturn STG_E_READFAULT;\n\t\tcase libwpd::WPD_PARSE_ERROR:\n\t\tcase libwpd::WPD_OLE_ERROR:\n\t\t\treturn STG_E_DOCFILECORRUPT;\n\t\tcase libwpd::WPD_UNSUPPORTED_ENCRYPTION_ERROR:\n\t\t\treturn STG_E_ACCESSDENIED;\n\t\tdefault:\n\t\t\treturn E_UNEXPECTED;\n\t\t}\n\t}\n\n\tfree(Buffer);\n\treturn S_OK;\n}\n\nHRESULT CWordPerfectFilter::GetNextChunkValue(CChunkValue& chunkValue)\n{\n\tPWSTR BodyText = StrDupA2W(priv->BodyText.cstr());\n\n\tconst size_t MaxColumnLength = 1048576;\n\tWCHAR TruncatedBodyText[MaxColumnLength \/ sizeof(WCHAR)];\n\tif (wcslen(BodyText) > MaxColumnLength)\n\t{\n\t\twcsncpy_s(TruncatedBodyText, BodyText, MaxColumnLength - 3);\n\t\twcsncat_s(TruncatedBodyText, L\"...\", 3);\n\t}\n\n\tchunkValue.SetTextValue(PKEY_Search_Contents, TruncatedBodyText, CHUNK_TEXT);\n\tfree((void *)BodyText);\n\n\tpriv->EventLog.ReportEvent(EVENTLOG_INFORMATION_TYPE, TEXT_EXTRACTION_CATEGORY, MSG_END_IMPORT);\n\treturn FILTER_E_END_OF_CHUNKS;\n}\n\nCWordPerfectFilter::~CWordPerfectFilter()\n{\n\tif (priv != nullptr)\n\t{\n\t\tdelete priv->Generator;\n\t\tdelete priv;\n\t}\n}\n<commit_msg>CWordPerfectFilter now returns text 10240 WCHARs at a time<commit_after>#include \"stdafx.h\"\n#include \"CEventLog.h\"\n#include \"CWordPerfectFilter.h\"\n#include \"LogMessages.h\"\n#include <librevenge\/librevenge.h>\n#include <librevenge-generators\/librevenge-generators.h>\n#include <librevenge-stream\/librevenge-stream.h>\n#include <libwpd\/libwpd.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nnamespace \/* anonymous *\/\n{\n\tPWSTR StrDupA2W(PCSTR ascii)\n\t{\n\t\tsize_t asciilen = strlen(ascii);\n\t\tsize_t widelen = MultiByteToWideChar(CP_ACP, 0, ascii, asciilen, nullptr, 0);\n\n\t\tPWSTR wide = (PWSTR)malloc(widelen * sizeof(wchar_t));\n\t\tMultiByteToWideChar(CP_ACP, 0, ascii, asciilen, wide, widelen);\n\t\treturn wide;\n\t}\n\n\tbool ParseGUID(GUID& guid, LPCWSTR string)\n\t{\n\t\tconst int expected_fields = 11;\n#pragma warning(suppress: 4996) \/\/ Don't warn about CRT security deprecations\n\t\tint num_fields_parsed = swscanf(string, L\"%08X-%04hX-%04hX-%02hhX%02hhX-%02hhX%02hhX%02hhX%02hhX%02hhX%02hhX\",\n\t\t\t&guid.Data1, &guid.Data2, &guid.Data3,\n\t\t\t&guid.Data4[0], &guid.Data4[1], &guid.Data4[2], &guid.Data4[3],\n\t\t\t&guid.Data4[4], &guid.Data4[5], &guid.Data4[6], &guid.Data4[7]);\n\n\t\treturn num_fields_parsed == expected_fields;\n\t}\n}\n\nclass CWordPerfectFilter::Private\n{\npublic:\n\tlibrevenge::RVNGTextTextGenerator *Generator;\n\tbool CanParse = true;\n\tCEventLog EventLog = CEventLog(_T(\"WordPerfect Indexer\"));\n\tsize_t LastOffset = 0;\n\tCString BodyText;\n};\n\nHRESULT CWordPerfectFilter::OnInit()\n{\n\tpriv->EventLog.ReportEvent(EVENTLOG_INFORMATION_TYPE, TEXT_EXTRACTION_CATEGORY, MSG_BEGIN_IMPORT);\n\n\tlibrevenge::RVNGString BodyTextRVNG;\n\tpriv = new CWordPerfectFilter::Private;\n\tpriv->Generator = new librevenge::RVNGTextTextGenerator(BodyTextRVNG);\n\n\tSTATSTG statStg;\n\tZeroMemory(&statStg, sizeof(statStg));\n\tHRESULT hr = m_pStream->Stat(&statStg, STATFLAG_NONAME);\n\tif (hr != S_OK)\n\t{\n\t\tCString str; str.Format(L\"0x%08llX\", hr);\n\t\tCAtlArray<CString> args; args.Add(str);\n\n\t\tpriv->EventLog.ReportEvent(EVENTLOG_ERROR_TYPE, TEXT_EXTRACTION_CATEGORY, MSG_GETISTREAMLENGTH_FAILURE, args);\n\t\treturn E_UNEXPECTED;\n\t}\n\n\tsize_t StreamLength = statStg.cbSize.QuadPart;\n\tunsigned char *Buffer = (unsigned char *)malloc(StreamLength * sizeof(unsigned char));\n\thr = m_pStream->Read(Buffer, StreamLength * sizeof(unsigned char), nullptr);\n\n\tlibrevenge::RVNGStringStream RevengeStream(Buffer, StreamLength * sizeof(unsigned char));\n\tlibwpd::WPDResult wpdError = libwpd::WPDocument::parse(&RevengeStream, priv->Generator, nullptr);\n\n\tif (wpdError != libwpd::WPD_OK)\n\t{\n\t\tpriv->EventLog.ReportEvent(EVENTLOG_ERROR_TYPE, TEXT_EXTRACTION_CATEGORY, MSG_WPD_DOC_CORRUPT);\n\n\t\tswitch (wpdError)\n\t\t{\n\t\tcase libwpd::WPD_FILE_ACCESS_ERROR:\n\t\t\treturn STG_E_READFAULT;\n\t\tcase libwpd::WPD_PARSE_ERROR:\n\t\tcase libwpd::WPD_OLE_ERROR:\n\t\t\treturn STG_E_DOCFILECORRUPT;\n\t\tcase libwpd::WPD_UNSUPPORTED_ENCRYPTION_ERROR:\n\t\t\treturn STG_E_ACCESSDENIED;\n\t\tdefault:\n\t\t\treturn E_UNEXPECTED;\n\t\t}\n\t}\n\n\tpriv->BodyText = CA2W(BodyTextRVNG.cstr(), CP_UTF8);\n\tpriv->LastOffset = 0;\n\tfree(Buffer);\n\n\treturn S_OK;\n}\n\nHRESULT CWordPerfectFilter::GetNextChunkValue(CChunkValue& chunkValue)\n{\n\tconstexpr size_t DefaultChunkLength = 10240;\n\tsize_t ChunkLength = DefaultChunkLength;\n\tbool isLastChunk = false;\n\n\tif ((priv->LastOffset + ChunkLength) > priv->BodyText.GetLength())\n\t{\n\t\tChunkLength = priv->BodyText.GetLength() - priv->LastOffset;\n\t\tisLastChunk = true;\n\t}\n\n\tCString Chunk = priv->BodyText.Mid(priv->LastOffset, ChunkLength);\n\tchunkValue.SetTextValue(PKEY_Search_Contents, Chunk, CHUNK_TEXT);\n\tpriv->LastOffset += ChunkLength;\n\n\tif (isLastChunk)\n\t{\n\t\tpriv->EventLog.ReportEvent(EVENTLOG_INFORMATION_TYPE, TEXT_EXTRACTION_CATEGORY, MSG_END_IMPORT);\n\t\treturn FILTER_E_END_OF_CHUNKS;\n\t}\n\telse\n\t{\n\t\treturn S_OK;\n\t}\n}\n\nCWordPerfectFilter::~CWordPerfectFilter()\n{\n\tif (priv != nullptr)\n\t{\n\t\tdelete priv->Generator;\n\t\tdelete priv;\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\n* Copyright (c) 2007-2009 SlimDX Group\r\n* \r\n* Permission is hereby granted, free of charge, to any person obtaining a copy\r\n* of this software and associated documentation files (the \"Software\"), to deal\r\n* in the Software without restriction, including without limitation the rights\r\n* to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\r\n* copies of the Software, and to permit persons to whom the Software is\r\n* furnished to do so, subject to the following conditions:\r\n* \r\n* The above copyright notice and this permission notice shall be included in\r\n* all copies or substantial portions of the Software.\r\n* \r\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\n* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\n* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\n* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\n* THE SOFTWARE.\r\n*\/\r\n\r\n#include \"ComObject.h\"\r\n#include \"Configuration.h\"\r\n\r\nusing namespace System;\r\n\r\nnamespace SlimDX\r\n{\r\n\tComObject::ComObject() : m_Unknown( 0 )\r\n\t{\r\n\t\tIsDefaultPool = false;\r\n\t}\r\n\r\n\tComObject::~ComObject()\r\n\t{\r\n\t\tif( m_Owner != nullptr )\r\n\t\t\tthrow gcnew InvalidOperationException(\"It is not legal to call Dispose() on this object.\");\r\n\r\n\t\tDestruct();\r\n\t}\r\n\r\n\tbool ComObject::Disposed::get()\r\n\t{\r\n\t\tif( m_Unknown == 0 )\r\n\t\t\treturn true;\r\n\r\n\t\tif( !ObjectTable::Contains( this ) )\r\n\t\t\treturn true;\r\n\r\n\t\treturn false;\r\n\t}\r\n\t\r\n\tIntPtr ComObject::ComPointer::get()\r\n\t{\r\n\t\treturn IntPtr( m_Unknown );\r\n\t}\r\n\r\n\tComObject^ ComObject::Owner::get()\r\n\t{\r\n\t\treturn m_Owner;\r\n\t}\r\n\t\r\n\tvoid ComObject::Owner::set( ComObject^ value )\r\n\t{\r\n\t\tm_Owner = value;\r\n\t}\r\n\r\n\tIUnknown* ComObject::UnknownPointer::get()\r\n\t{\r\n\t\treturn m_Unknown;\r\n\t}\r\n\t\r\n\tIUnknown* ComObject::InternalPointer::get()\r\n\t{\r\n\t\treturn m_Unknown;\r\n\t}\r\n\t\r\n\tvoid ComObject::SetFlags( ComObjectFlags flags )\r\n\t{\r\n\t\tm_Flags = flags;\r\n\t}\r\n\t\r\n\tvoid ComObject::SetSource( System::Diagnostics::StackTrace^ stack )\r\n\t{\r\n\t\tm_Source = stack;\r\n\t}\r\n\r\n\tSystem::Diagnostics::StackTrace^ ComObject::CreationSource::get()\r\n\t{\r\n\t\treturn m_Source;\r\n\t}\r\n\r\n\tvoid ComObject::SetCreationTime( int time )\r\n\t{\r\n\t\tm_CreationTime = time;\r\n\t}\r\n\r\n\tint ComObject::CreationTime::get()\r\n\t{\r\n\t\treturn m_CreationTime;\r\n\t}\r\n\t\r\n\tvoid ComObject::Construct( IUnknown* pointer )\r\n\t{\r\n\t\tConstruct( pointer, nullptr );\r\n\t}\r\n\t\r\n\tvoid ComObject::Construct( IUnknown* pointer, ComObject^ owner )\r\n\t{\r\n\t\tif( pointer == 0 )\r\n\t\t\tthrow gcnew ArgumentNullException( \"pointer\" );\r\n\r\n\t\tm_Unknown = pointer;\r\n\t\tObjectTable::Add( this, owner );\r\n\t}\r\n\r\n\tvoid ComObject::Construct( IntPtr pointer, Guid guid )\r\n\t{\r\n\t\tif( pointer == IntPtr::Zero )\r\n\t\t\tthrow gcnew ArgumentNullException( \"pointer\" );\r\n\r\n\t\tvoid* result = 0;\r\n\t\tIUnknown* unknown = static_cast<IUnknown*>( pointer.ToPointer() );\r\n\t\tHRESULT hr = unknown->QueryInterface( Utilities::ConvertManagedGuid( guid ), &result );\r\n\t\tif( FAILED( hr ) )\r\n\t\t\tthrow gcnew InvalidCastException( \"Failed to QueryInterface on user-supplied pointer.\" );\r\n\r\n\t\tConstruct( unknown );\r\n\t}\r\n\r\n\tvoid ComObject::Destruct()\r\n\t{\r\n\t\tif( m_Unknown == 0 || !ObjectTable::Remove( this ) )\r\n\t\t{\r\n\t\t\t\/\/ test for CreationTime is to avoid throwing ObjectDisposedException when\r\n\t\t\t\/\/ a constructor for an object fails\r\n\t\t\tif( Configuration::DetectDoubleDispose && CreationTime != 0 )\r\n\t\t\t{\r\n\t\t\t\tType^ myType = GetType();\r\n\t\t\t\tthrow gcnew ObjectDisposedException( myType->FullName );\r\n\t\t\t}\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tif( static_cast<int>( m_Flags & ComObjectFlags::IsAncillary ) == 0 )\r\n\t\t\t\tm_Unknown->Release();\r\n\r\n\t\t\tm_Unknown = 0;\r\n\t\t}\r\n\t}\r\n}<commit_msg>Ancillary release prevention is handled in the Dispose() method via exceptions.<commit_after>\/*\r\n* Copyright (c) 2007-2009 SlimDX Group\r\n* \r\n* Permission is hereby granted, free of charge, to any person obtaining a copy\r\n* of this software and associated documentation files (the \"Software\"), to deal\r\n* in the Software without restriction, including without limitation the rights\r\n* to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\r\n* copies of the Software, and to permit persons to whom the Software is\r\n* furnished to do so, subject to the following conditions:\r\n* \r\n* The above copyright notice and this permission notice shall be included in\r\n* all copies or substantial portions of the Software.\r\n* \r\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\n* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\n* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\n* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\n* THE SOFTWARE.\r\n*\/\r\n\r\n#include \"ComObject.h\"\r\n#include \"Configuration.h\"\r\n\r\nusing namespace System;\r\n\r\nnamespace SlimDX\r\n{\r\n\tComObject::ComObject() : m_Unknown( 0 )\r\n\t{\r\n\t\tIsDefaultPool = false;\r\n\t}\r\n\r\n\tComObject::~ComObject()\r\n\t{\r\n\t\tif( m_Owner != nullptr )\r\n\t\t\tthrow gcnew InvalidOperationException(\"It is not legal to call Dispose() on this object.\");\r\n\r\n\t\tDestruct();\r\n\t}\r\n\r\n\tbool ComObject::Disposed::get()\r\n\t{\r\n\t\tif( m_Unknown == 0 )\r\n\t\t\treturn true;\r\n\r\n\t\tif( !ObjectTable::Contains( this ) )\r\n\t\t\treturn true;\r\n\r\n\t\treturn false;\r\n\t}\r\n\t\r\n\tIntPtr ComObject::ComPointer::get()\r\n\t{\r\n\t\treturn IntPtr( m_Unknown );\r\n\t}\r\n\r\n\tComObject^ ComObject::Owner::get()\r\n\t{\r\n\t\treturn m_Owner;\r\n\t}\r\n\t\r\n\tvoid ComObject::Owner::set( ComObject^ value )\r\n\t{\r\n\t\tm_Owner = value;\r\n\t}\r\n\r\n\tIUnknown* ComObject::UnknownPointer::get()\r\n\t{\r\n\t\treturn m_Unknown;\r\n\t}\r\n\t\r\n\tIUnknown* ComObject::InternalPointer::get()\r\n\t{\r\n\t\treturn m_Unknown;\r\n\t}\r\n\t\r\n\tvoid ComObject::SetFlags( ComObjectFlags flags )\r\n\t{\r\n\t\tm_Flags = flags;\r\n\t}\r\n\t\r\n\tvoid ComObject::SetSource( System::Diagnostics::StackTrace^ stack )\r\n\t{\r\n\t\tm_Source = stack;\r\n\t}\r\n\r\n\tSystem::Diagnostics::StackTrace^ ComObject::CreationSource::get()\r\n\t{\r\n\t\treturn m_Source;\r\n\t}\r\n\r\n\tvoid ComObject::SetCreationTime( int time )\r\n\t{\r\n\t\tm_CreationTime = time;\r\n\t}\r\n\r\n\tint ComObject::CreationTime::get()\r\n\t{\r\n\t\treturn m_CreationTime;\r\n\t}\r\n\t\r\n\tvoid ComObject::Construct( IUnknown* pointer )\r\n\t{\r\n\t\tConstruct( pointer, nullptr );\r\n\t}\r\n\t\r\n\tvoid ComObject::Construct( IUnknown* pointer, ComObject^ owner )\r\n\t{\r\n\t\tif( pointer == 0 )\r\n\t\t\tthrow gcnew ArgumentNullException( \"pointer\" );\r\n\r\n\t\tm_Unknown = pointer;\r\n\t\tObjectTable::Add( this, owner );\r\n\t}\r\n\r\n\tvoid ComObject::Construct( IntPtr pointer, Guid guid )\r\n\t{\r\n\t\tif( pointer == IntPtr::Zero )\r\n\t\t\tthrow gcnew ArgumentNullException( \"pointer\" );\r\n\r\n\t\tvoid* result = 0;\r\n\t\tIUnknown* unknown = static_cast<IUnknown*>( pointer.ToPointer() );\r\n\t\tHRESULT hr = unknown->QueryInterface( Utilities::ConvertManagedGuid( guid ), &result );\r\n\t\tif( FAILED( hr ) )\r\n\t\t\tthrow gcnew InvalidCastException( \"Failed to QueryInterface on user-supplied pointer.\" );\r\n\r\n\t\tConstruct( unknown );\r\n\t}\r\n\r\n\tvoid ComObject::Destruct()\r\n\t{\r\n\t\tif( m_Unknown == 0 || !ObjectTable::Remove( this ) )\r\n\t\t{\r\n\t\t\t\/\/ test for CreationTime is to avoid throwing ObjectDisposedException when\r\n\t\t\t\/\/ a constructor for an object fails\r\n\t\t\tif( Configuration::DetectDoubleDispose && CreationTime != 0 )\r\n\t\t\t{\r\n\t\t\t\tType^ myType = GetType();\r\n\t\t\t\tthrow gcnew ObjectDisposedException( myType->FullName );\r\n\t\t\t}\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tm_Unknown->Release();\r\n\t\t\tm_Unknown = 0;\r\n\t\t}\r\n\t}\r\n}<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n\n#include \"CodeGen_Posix.h\"\n#include \"CodeGen_Internal.h\"\n#include \"LLVM_Headers.h\"\n#include \"IR.h\"\n#include \"IROperator.h\"\n#include \"Debug.h\"\n\nnamespace Halide {\nnamespace Internal {\n\nusing std::vector;\nusing std::string;\nusing std::map;\nusing std::pair;\nusing std::make_pair;\n\nusing namespace llvm;\n\nCodeGen_Posix::CodeGen_Posix() :\n    CodeGen(),\n\n    \/\/ Vector types. These need an LLVMContext before they can be initialized.\n    i8x8(NULL),\n    i8x16(NULL),\n    i8x32(NULL),\n    i16x4(NULL),\n    i16x8(NULL),\n    i16x16(NULL),\n    i32x2(NULL),\n    i32x4(NULL),\n    i32x8(NULL),\n    i64x2(NULL),\n    i64x4(NULL),\n    f32x2(NULL),\n    f32x4(NULL),\n    f32x8(NULL),\n    f64x2(NULL),\n    f64x4(NULL),\n\n    \/\/ Wildcards for pattern matching\n    wild_i8x8(Variable::make(Int(8, 8), \"*\")),\n    wild_i16x4(Variable::make(Int(16, 4), \"*\")),\n    wild_i32x2(Variable::make(Int(32, 2), \"*\")),\n\n    wild_u8x8(Variable::make(UInt(8, 8), \"*\")),\n    wild_u16x4(Variable::make(UInt(16, 4), \"*\")),\n    wild_u32x2(Variable::make(UInt(32, 2), \"*\")),\n\n    wild_i8x16(Variable::make(Int(8, 16), \"*\")),\n    wild_i16x8(Variable::make(Int(16, 8), \"*\")),\n    wild_i32x4(Variable::make(Int(32, 4), \"*\")),\n    wild_i64x2(Variable::make(Int(64, 2), \"*\")),\n\n    wild_u8x16(Variable::make(UInt(8, 16), \"*\")),\n    wild_u16x8(Variable::make(UInt(16, 8), \"*\")),\n    wild_u32x4(Variable::make(UInt(32, 4), \"*\")),\n    wild_u64x2(Variable::make(UInt(64, 2), \"*\")),\n\n    wild_i8x32(Variable::make(Int(8, 32), \"*\")),\n    wild_i16x16(Variable::make(Int(16, 16), \"*\")),\n    wild_i32x8(Variable::make(Int(32, 8), \"*\")),\n    wild_i64x4(Variable::make(Int(64, 4), \"*\")),\n\n    wild_u8x32(Variable::make(UInt(8, 32), \"*\")),\n    wild_u16x16(Variable::make(UInt(16, 16), \"*\")),\n    wild_u32x8(Variable::make(UInt(32, 8), \"*\")),\n    wild_u64x4(Variable::make(UInt(64, 4), \"*\")),\n\n    wild_f32x2(Variable::make(Float(32, 2), \"*\")),\n\n    wild_f32x4(Variable::make(Float(32, 4), \"*\")),\n    wild_f64x2(Variable::make(Float(64, 2), \"*\")),\n\n    wild_f32x8(Variable::make(Float(32, 8), \"*\")),\n    wild_f64x4(Variable::make(Float(64, 4), \"*\")),\n\n    \/\/ Bounds of types\n    min_i8(Int(8).min()),\n    max_i8(Int(8).max()),\n    max_u8(UInt(8).max()),\n\n    min_i16(Int(16).min()),\n    max_i16(Int(16).max()),\n    max_u16(UInt(16).max()),\n\n    min_i32(Int(32).min()),\n    max_i32(Int(32).max()),\n    max_u32(UInt(32).max()),\n\n    min_i64(Int(64).min()),\n    max_i64(Int(64).max()),\n    max_u64(UInt(64).max()),\n\n    min_f32(Float(32).min()),\n    max_f32(Float(32).max()),\n\n    min_f64(Float(64).min()),\n    max_f64(Float(64).max()) {\n\n}\n\nvoid CodeGen_Posix::init_module() {\n    CodeGen::init_module();\n\n    i8x8 = VectorType::get(i8, 8);\n    i8x16 = VectorType::get(i8, 16);\n    i8x32 = VectorType::get(i8, 32);\n    i16x4 = VectorType::get(i16, 4);\n    i16x8 = VectorType::get(i16, 8);\n    i16x16 = VectorType::get(i16, 16);\n    i32x2 = VectorType::get(i32, 2);\n    i32x4 = VectorType::get(i32, 4);\n    i32x8 = VectorType::get(i32, 8);\n    i64x2 = VectorType::get(i64, 2);\n    i64x4 = VectorType::get(i64, 4);\n    f32x2 = VectorType::get(f32, 2);\n    f32x4 = VectorType::get(f32, 4);\n    f32x8 = VectorType::get(f32, 8);\n    f64x2 = VectorType::get(f64, 2);\n    f64x4 = VectorType::get(f64, 4);\n}\n\nValue *CodeGen_Posix::codegen_allocation_size(const std::string &name, Type type, const std::vector<Expr> &extents) {\n    \/\/ Compute size from list of extents checking for 32-bit signed overflow.\n    llvm::Function *mul_overflow_fn = module->getFunction(\"llvm.smul.with.overflow.i32\");\n\n    \/\/ TODO: Make a method in code gen to handle getting or greating\n    \/\/ a function through llvm. See also: CodeGen_ARM::call_intrin\n    if (!mul_overflow_fn) {\n        llvm::Type *result_type = llvm::StructType::get(i32, i1, NULL);\n        vector<llvm::Type *> arg_types;\n        arg_types.push_back(i32);\n        arg_types.push_back(i32);\n        FunctionType *func_t = FunctionType::get(result_type, arg_types, false);\n        mul_overflow_fn = llvm::Function::Create(func_t,\n                                                 llvm::Function::ExternalLinkage,\n                                                 \"llvm.smul.with.overflow.i32\", module);\n        mul_overflow_fn->setCallingConv(CallingConv::C);\n        mul_overflow_fn->setDoesNotAccessMemory();\n        mul_overflow_fn->setDoesNotThrow();\n    }\n    assert(mul_overflow_fn != NULL);\n\n    Value *llvm_size;\n    Value *overflow = NULL;\n    if (extents.size() == 0) {\n      llvm_size = codegen(Expr(0));\n    } else {\n        llvm_size = codegen(Expr(type.bytes()));\n        for (size_t i = 0; i < extents.size(); i++) {\n            Value *terms[2] = { llvm_size, codegen(extents[i]) };\n            CallInst *multiply = builder->CreateCall(mul_overflow_fn, terms);\n            llvm_size = builder->CreateExtractValue(multiply, vec(0U));\n            Value *new_overflow = builder->CreateExtractValue(multiply, vec(1U));\n            if (overflow == NULL) {\n                overflow = new_overflow;\n            } else {\n                overflow = builder->CreateOr(overflow, new_overflow);\n            }\n        }\n    }\n    if (overflow != NULL) {\n        create_assertion(builder->CreateNot(overflow),\n                         std::string(\"32-bit signed overflow computing size of allocation \") + name);\n    }\n    return llvm_size;\n}\n\nCodeGen_Posix::Allocation CodeGen_Posix::create_allocation(const std::string &name, Type type, const std::vector<Expr> &extents) {\n\n    Allocation allocation;\n    Value *llvm_size = NULL;\n\n    int32_t constant_size;\n    if (constant_allocation_size(extents, name, constant_size)) {\n        int64_t stack_bytes = constant_size * type.bytes();\n\n        \/\/ Special case for zero sized allocation.\n        if (stack_bytes == 0)\n            stack_bytes = 1;\n\n        if (stack_bytes > ((int64_t(1) << 31) - 1)) {\n            std::cerr << \"Total size for allocation \" << name << \" is constant but exceeds 2^31 - 1.\";\n            assert(false);\n        } else if (stack_bytes <= 1024 * 8) {\n            \/\/ Round up to nearest multiple of 32.\n            allocation.stack_size = static_cast<int32_t>(((stack_bytes + 31)\/32)*32);\n        } else {\n            allocation.stack_size = 0;\n            llvm_size = codegen(Expr(static_cast<int32_t>(stack_bytes)));\n        }\n    } else {\n        allocation.stack_size = 0;\n        llvm_size = codegen_allocation_size(name, type, extents);\n    }\n\n    llvm::Type *llvm_type = llvm_type_of(type);\n\n    if (allocation.stack_size) {\n\n        \/\/ We used to do the alloca locally and save and restore the\n        \/\/ stack pointer, but this makes llvm generate streams of\n        \/\/ spill\/reloads.\n        Value *ptr = create_alloca_at_entry(i32x8, allocation.stack_size\/32, name);\n        allocation.ptr = builder->CreatePointerCast(ptr, llvm_type->getPointerTo());\n\n    } else {\n        \/\/ call malloc\n        llvm::Function *malloc_fn = module->getFunction(\"halide_malloc\");\n        malloc_fn->setDoesNotAlias(0);\n        assert(malloc_fn && \"Could not find halide_malloc in module\");\n\n        llvm::Function::arg_iterator arg_iter = malloc_fn->arg_begin();\n        ++arg_iter;  \/\/ skip the user context *\n        llvm_size = builder->CreateIntCast(llvm_size, arg_iter->getType(), false);\n\n        debug(4) << \"Creating call to halide_malloc\\n\";\n        Value *args[2] = { get_user_context(), llvm_size };\n\n        CallInst *call = builder->CreateCall(malloc_fn, args);\n        allocation.ptr = call;\n\n        \/\/ Assert that the allocation worked.\n        create_assertion(builder->CreateIsNotNull(allocation.ptr),\n                         \"Out of memory (malloc returned NULL)\");\n    }\n\n    \/\/ Push the allocation base pointer onto the symbol table\n    debug(3) << \"Pushing allocation called \" << name << \".host onto the symbol table\\n\";\n\n    allocations.push(name, allocation);\n\n    return allocation;\n}\n\nvoid CodeGen_Posix::free_allocation(const std::string &name) {\n    Allocation alloc = allocations.get(name);\n\n    assert(alloc.ptr);\n\n    CallInst *call_inst = dyn_cast<CallInst>(alloc.ptr);\n    llvm::Function *allocated_in = call_inst ? call_inst->getParent()->getParent() : NULL;\n    llvm::Function *current_func = builder->GetInsertBlock()->getParent();\n\n    if (alloc.stack_size) {\n        \/\/ Free is a no-op for stack allocations\n    } else if (allocated_in == current_func) { \/\/ Skip over allocations from outside this function.\n        \/\/ Call free\n        llvm::Function *free_fn = module->getFunction(\"halide_free\");\n        assert(free_fn && \"Could not find halide_free in module\");\n        debug(4) << \"Creating call to halide_free\\n\";\n        Value *args[2] = { get_user_context(), alloc.ptr };\n        builder->CreateCall(free_fn, args);\n    }\n\n    allocations.pop(name);\n}\n\nvoid CodeGen_Posix::destroy_allocation(Allocation alloc) {\n    \/\/ Heap allocations have already been freed.\n}\n\nvoid CodeGen_Posix::visit(const Allocate *alloc) {\n\n    if (sym_exists(alloc->name + \".host\")) {\n        std::cerr << \"Can't have two different buffers with the same name: \"\n                  << alloc->name << \"\\n\";\n        assert(false);\n    }\n\n    Allocation allocation = create_allocation(alloc->name, alloc->type, alloc->extents);\n    sym_push(alloc->name + \".host\", allocation.ptr);\n\n    codegen(alloc->body);\n\n    \/\/ Should have been freed\n    assert(!sym_exists(alloc->name + \".host\"));\n    assert(!allocations.contains(alloc->name));\n\n    debug(2) << \"Destroying allocation \" << alloc->name << \"\\n\";\n    destroy_allocation(allocation);\n}\n\nvoid CodeGen_Posix::visit(const Free *stmt) {\n    free_allocation(stmt->name);\n    sym_pop(stmt->name + \".host\");\n}\n\nvoid CodeGen_Posix::prepare_for_early_exit() {\n    \/\/ We've jumped to a code path that will be called just before\n    \/\/ bailing out. Free everything outstanding.\n    vector<string> names;\n    for (Scope<Allocation>::iterator iter = allocations.begin();\n         iter != allocations.end(); ++iter) {\n        names.push_back(iter.name());\n    }\n\n    for (size_t i = 0; i < names.size(); i++) {\n        std::vector<Allocation> stash;\n        while (allocations.contains(names[i])) {\n            \/\/ The value in the symbol table is not necessarily the\n            \/\/ one in the allocation - it may have been forwarded\n            \/\/ inside a parallel for loop\n            stash.push_back(allocations.get(names[i]));\n            free_allocation(names[i]);\n        }\n\n        \/\/ Restore all the allocations before we jump back to the main\n        \/\/ code path.\n        for (size_t j = stash.size(); j > 0; j--) {\n            allocations.push(names[i], stash[j-1]);\n        }\n    }\n}\n\n}}\n<commit_msg>Typo fix.<commit_after>#include <iostream>\n\n#include \"CodeGen_Posix.h\"\n#include \"CodeGen_Internal.h\"\n#include \"LLVM_Headers.h\"\n#include \"IR.h\"\n#include \"IROperator.h\"\n#include \"Debug.h\"\n\nnamespace Halide {\nnamespace Internal {\n\nusing std::vector;\nusing std::string;\nusing std::map;\nusing std::pair;\nusing std::make_pair;\n\nusing namespace llvm;\n\nCodeGen_Posix::CodeGen_Posix() :\n    CodeGen(),\n\n    \/\/ Vector types. These need an LLVMContext before they can be initialized.\n    i8x8(NULL),\n    i8x16(NULL),\n    i8x32(NULL),\n    i16x4(NULL),\n    i16x8(NULL),\n    i16x16(NULL),\n    i32x2(NULL),\n    i32x4(NULL),\n    i32x8(NULL),\n    i64x2(NULL),\n    i64x4(NULL),\n    f32x2(NULL),\n    f32x4(NULL),\n    f32x8(NULL),\n    f64x2(NULL),\n    f64x4(NULL),\n\n    \/\/ Wildcards for pattern matching\n    wild_i8x8(Variable::make(Int(8, 8), \"*\")),\n    wild_i16x4(Variable::make(Int(16, 4), \"*\")),\n    wild_i32x2(Variable::make(Int(32, 2), \"*\")),\n\n    wild_u8x8(Variable::make(UInt(8, 8), \"*\")),\n    wild_u16x4(Variable::make(UInt(16, 4), \"*\")),\n    wild_u32x2(Variable::make(UInt(32, 2), \"*\")),\n\n    wild_i8x16(Variable::make(Int(8, 16), \"*\")),\n    wild_i16x8(Variable::make(Int(16, 8), \"*\")),\n    wild_i32x4(Variable::make(Int(32, 4), \"*\")),\n    wild_i64x2(Variable::make(Int(64, 2), \"*\")),\n\n    wild_u8x16(Variable::make(UInt(8, 16), \"*\")),\n    wild_u16x8(Variable::make(UInt(16, 8), \"*\")),\n    wild_u32x4(Variable::make(UInt(32, 4), \"*\")),\n    wild_u64x2(Variable::make(UInt(64, 2), \"*\")),\n\n    wild_i8x32(Variable::make(Int(8, 32), \"*\")),\n    wild_i16x16(Variable::make(Int(16, 16), \"*\")),\n    wild_i32x8(Variable::make(Int(32, 8), \"*\")),\n    wild_i64x4(Variable::make(Int(64, 4), \"*\")),\n\n    wild_u8x32(Variable::make(UInt(8, 32), \"*\")),\n    wild_u16x16(Variable::make(UInt(16, 16), \"*\")),\n    wild_u32x8(Variable::make(UInt(32, 8), \"*\")),\n    wild_u64x4(Variable::make(UInt(64, 4), \"*\")),\n\n    wild_f32x2(Variable::make(Float(32, 2), \"*\")),\n\n    wild_f32x4(Variable::make(Float(32, 4), \"*\")),\n    wild_f64x2(Variable::make(Float(64, 2), \"*\")),\n\n    wild_f32x8(Variable::make(Float(32, 8), \"*\")),\n    wild_f64x4(Variable::make(Float(64, 4), \"*\")),\n\n    \/\/ Bounds of types\n    min_i8(Int(8).min()),\n    max_i8(Int(8).max()),\n    max_u8(UInt(8).max()),\n\n    min_i16(Int(16).min()),\n    max_i16(Int(16).max()),\n    max_u16(UInt(16).max()),\n\n    min_i32(Int(32).min()),\n    max_i32(Int(32).max()),\n    max_u32(UInt(32).max()),\n\n    min_i64(Int(64).min()),\n    max_i64(Int(64).max()),\n    max_u64(UInt(64).max()),\n\n    min_f32(Float(32).min()),\n    max_f32(Float(32).max()),\n\n    min_f64(Float(64).min()),\n    max_f64(Float(64).max()) {\n\n}\n\nvoid CodeGen_Posix::init_module() {\n    CodeGen::init_module();\n\n    i8x8 = VectorType::get(i8, 8);\n    i8x16 = VectorType::get(i8, 16);\n    i8x32 = VectorType::get(i8, 32);\n    i16x4 = VectorType::get(i16, 4);\n    i16x8 = VectorType::get(i16, 8);\n    i16x16 = VectorType::get(i16, 16);\n    i32x2 = VectorType::get(i32, 2);\n    i32x4 = VectorType::get(i32, 4);\n    i32x8 = VectorType::get(i32, 8);\n    i64x2 = VectorType::get(i64, 2);\n    i64x4 = VectorType::get(i64, 4);\n    f32x2 = VectorType::get(f32, 2);\n    f32x4 = VectorType::get(f32, 4);\n    f32x8 = VectorType::get(f32, 8);\n    f64x2 = VectorType::get(f64, 2);\n    f64x4 = VectorType::get(f64, 4);\n}\n\nValue *CodeGen_Posix::codegen_allocation_size(const std::string &name, Type type, const std::vector<Expr> &extents) {\n    \/\/ Compute size from list of extents checking for 32-bit signed overflow.\n    llvm::Function *mul_overflow_fn = module->getFunction(\"llvm.smul.with.overflow.i32\");\n\n    \/\/ TODO: Make a method in code gen to handle getting or creating\n    \/\/ a function through llvm. See also: CodeGen_ARM::call_intrin\n    if (!mul_overflow_fn) {\n        llvm::Type *result_type = llvm::StructType::get(i32, i1, NULL);\n        vector<llvm::Type *> arg_types;\n        arg_types.push_back(i32);\n        arg_types.push_back(i32);\n        FunctionType *func_t = FunctionType::get(result_type, arg_types, false);\n        mul_overflow_fn = llvm::Function::Create(func_t,\n                                                 llvm::Function::ExternalLinkage,\n                                                 \"llvm.smul.with.overflow.i32\", module);\n        mul_overflow_fn->setCallingConv(CallingConv::C);\n        mul_overflow_fn->setDoesNotAccessMemory();\n        mul_overflow_fn->setDoesNotThrow();\n    }\n    assert(mul_overflow_fn != NULL);\n\n    Value *llvm_size;\n    Value *overflow = NULL;\n    if (extents.size() == 0) {\n      llvm_size = codegen(Expr(0));\n    } else {\n        llvm_size = codegen(Expr(type.bytes()));\n        for (size_t i = 0; i < extents.size(); i++) {\n            Value *terms[2] = { llvm_size, codegen(extents[i]) };\n            CallInst *multiply = builder->CreateCall(mul_overflow_fn, terms);\n            llvm_size = builder->CreateExtractValue(multiply, vec(0U));\n            Value *new_overflow = builder->CreateExtractValue(multiply, vec(1U));\n            if (overflow == NULL) {\n                overflow = new_overflow;\n            } else {\n                overflow = builder->CreateOr(overflow, new_overflow);\n            }\n        }\n    }\n    if (overflow != NULL) {\n        create_assertion(builder->CreateNot(overflow),\n                         std::string(\"32-bit signed overflow computing size of allocation \") + name);\n    }\n    return llvm_size;\n}\n\nCodeGen_Posix::Allocation CodeGen_Posix::create_allocation(const std::string &name, Type type, const std::vector<Expr> &extents) {\n\n    Allocation allocation;\n    Value *llvm_size = NULL;\n\n    int32_t constant_size;\n    if (constant_allocation_size(extents, name, constant_size)) {\n        int64_t stack_bytes = constant_size * type.bytes();\n\n        \/\/ Special case for zero sized allocation.\n        if (stack_bytes == 0)\n            stack_bytes = 1;\n\n        if (stack_bytes > ((int64_t(1) << 31) - 1)) {\n            std::cerr << \"Total size for allocation \" << name << \" is constant but exceeds 2^31 - 1.\";\n            assert(false);\n        } else if (stack_bytes <= 1024 * 8) {\n            \/\/ Round up to nearest multiple of 32.\n            allocation.stack_size = static_cast<int32_t>(((stack_bytes + 31)\/32)*32);\n        } else {\n            allocation.stack_size = 0;\n            llvm_size = codegen(Expr(static_cast<int32_t>(stack_bytes)));\n        }\n    } else {\n        allocation.stack_size = 0;\n        llvm_size = codegen_allocation_size(name, type, extents);\n    }\n\n    llvm::Type *llvm_type = llvm_type_of(type);\n\n    if (allocation.stack_size) {\n\n        \/\/ We used to do the alloca locally and save and restore the\n        \/\/ stack pointer, but this makes llvm generate streams of\n        \/\/ spill\/reloads.\n        Value *ptr = create_alloca_at_entry(i32x8, allocation.stack_size\/32, name);\n        allocation.ptr = builder->CreatePointerCast(ptr, llvm_type->getPointerTo());\n\n    } else {\n        \/\/ call malloc\n        llvm::Function *malloc_fn = module->getFunction(\"halide_malloc\");\n        malloc_fn->setDoesNotAlias(0);\n        assert(malloc_fn && \"Could not find halide_malloc in module\");\n\n        llvm::Function::arg_iterator arg_iter = malloc_fn->arg_begin();\n        ++arg_iter;  \/\/ skip the user context *\n        llvm_size = builder->CreateIntCast(llvm_size, arg_iter->getType(), false);\n\n        debug(4) << \"Creating call to halide_malloc\\n\";\n        Value *args[2] = { get_user_context(), llvm_size };\n\n        CallInst *call = builder->CreateCall(malloc_fn, args);\n        allocation.ptr = call;\n\n        \/\/ Assert that the allocation worked.\n        create_assertion(builder->CreateIsNotNull(allocation.ptr),\n                         \"Out of memory (malloc returned NULL)\");\n    }\n\n    \/\/ Push the allocation base pointer onto the symbol table\n    debug(3) << \"Pushing allocation called \" << name << \".host onto the symbol table\\n\";\n\n    allocations.push(name, allocation);\n\n    return allocation;\n}\n\nvoid CodeGen_Posix::free_allocation(const std::string &name) {\n    Allocation alloc = allocations.get(name);\n\n    assert(alloc.ptr);\n\n    CallInst *call_inst = dyn_cast<CallInst>(alloc.ptr);\n    llvm::Function *allocated_in = call_inst ? call_inst->getParent()->getParent() : NULL;\n    llvm::Function *current_func = builder->GetInsertBlock()->getParent();\n\n    if (alloc.stack_size) {\n        \/\/ Free is a no-op for stack allocations\n    } else if (allocated_in == current_func) { \/\/ Skip over allocations from outside this function.\n        \/\/ Call free\n        llvm::Function *free_fn = module->getFunction(\"halide_free\");\n        assert(free_fn && \"Could not find halide_free in module\");\n        debug(4) << \"Creating call to halide_free\\n\";\n        Value *args[2] = { get_user_context(), alloc.ptr };\n        builder->CreateCall(free_fn, args);\n    }\n\n    allocations.pop(name);\n}\n\nvoid CodeGen_Posix::destroy_allocation(Allocation alloc) {\n    \/\/ Heap allocations have already been freed.\n}\n\nvoid CodeGen_Posix::visit(const Allocate *alloc) {\n\n    if (sym_exists(alloc->name + \".host\")) {\n        std::cerr << \"Can't have two different buffers with the same name: \"\n                  << alloc->name << \"\\n\";\n        assert(false);\n    }\n\n    Allocation allocation = create_allocation(alloc->name, alloc->type, alloc->extents);\n    sym_push(alloc->name + \".host\", allocation.ptr);\n\n    codegen(alloc->body);\n\n    \/\/ Should have been freed\n    assert(!sym_exists(alloc->name + \".host\"));\n    assert(!allocations.contains(alloc->name));\n\n    debug(2) << \"Destroying allocation \" << alloc->name << \"\\n\";\n    destroy_allocation(allocation);\n}\n\nvoid CodeGen_Posix::visit(const Free *stmt) {\n    free_allocation(stmt->name);\n    sym_pop(stmt->name + \".host\");\n}\n\nvoid CodeGen_Posix::prepare_for_early_exit() {\n    \/\/ We've jumped to a code path that will be called just before\n    \/\/ bailing out. Free everything outstanding.\n    vector<string> names;\n    for (Scope<Allocation>::iterator iter = allocations.begin();\n         iter != allocations.end(); ++iter) {\n        names.push_back(iter.name());\n    }\n\n    for (size_t i = 0; i < names.size(); i++) {\n        std::vector<Allocation> stash;\n        while (allocations.contains(names[i])) {\n            \/\/ The value in the symbol table is not necessarily the\n            \/\/ one in the allocation - it may have been forwarded\n            \/\/ inside a parallel for loop\n            stash.push_back(allocations.get(names[i]));\n            free_allocation(names[i]);\n        }\n\n        \/\/ Restore all the allocations before we jump back to the main\n        \/\/ code path.\n        for (size_t j = stash.size(); j > 0; j--) {\n            allocations.push(names[i], stash[j-1]);\n        }\n    }\n}\n\n}}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: escherex.cxx,v $\n *\n *  $Revision: 1.12 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-16 18:20: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\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sd.hxx\"\n\n\n#ifndef _PptEscherEx_HXX\n#include \"escherex.hxx\"\n#endif\n\n\/\/ ---------------------------------------------------------------------------------------------\n\/\/ ---------------------------------------------------------------------------------------------\n\/\/ ---------------------------------------------------------------------------------------------\n\nPptEscherEx::PptEscherEx( SvStream& rOutStrm, UINT32 nDrawings ) :\n    EscherEx                ( rOutStrm, nDrawings )\n{\n    mnFIDCLs = nDrawings;\n    mnCurrentDg = 0;\n    mnCurrentShapeID = 0;\n    mnTotalShapesDgg = 0;\n    mnCurrentShapeMaximumID = 0;\n}\n\n\/\/ ---------------------------------------------------------------------------------------------\n\nsal_uInt32 PptEscherEx::DrawingGroupContainerSize()\n{\n    return ImplDggContainerSize() + 8;\n}\n\nvoid PptEscherEx::WriteDrawingGroupContainer( SvStream& rSt )\n{\n    UINT32 nSize = DrawingGroupContainerSize();\n    rSt << (sal_uInt32)( 0xf | ( 1035 << 16 ) )     \/\/ EPP_PPDrawingGroup\n        << (sal_uInt32)( nSize - 8 );\n\n    ImplWriteDggContainer( rSt );\n}\n\n\/\/ ---------------------------------------------------------------------------------------------\n\nsal_uInt32 PptEscherEx::ImplDggContainerSize()\n{\n    UINT32 nSize;\n\n    nSize  = ImplDggAtomSize();\n    nSize += GetBlibStoreContainerSize();\n    nSize += ImplOptAtomSize();\n    nSize += ImplSplitMenuColorsAtomSize();\n\n    return nSize + 8;\n}\n\nvoid PptEscherEx::ImplWriteDggContainer( SvStream& rSt )\n{\n    sal_uInt32 nSize = ImplDggContainerSize();\n    if ( nSize )\n    {\n        rSt << (sal_uInt32)( 0xf | ( ESCHER_DggContainer << 16 ) )\n            << (sal_uInt32)( nSize - 8 );\n\n        ImplWriteDggAtom( rSt );\n        WriteBlibStoreContainer( rSt );\n        ImplWriteOptAtom( rSt );\n        ImplWriteSplitMenuColorsAtom( rSt );\n    }\n}\n\n\/\/ ---------------------------------------------------------------------------------------------\n\nsal_uInt32 PptEscherEx::ImplDggAtomSize()\n{\n    return maFIDCLs.Tell() + 24;\n}\n\nvoid PptEscherEx::ImplWriteDggAtom( SvStream& rSt )\n{\n    sal_uInt32 nSize = ImplDggAtomSize();\n    if ( nSize )\n    {\n        rSt << (sal_uInt32)( ESCHER_Dgg << 16 )\n            << (sal_uInt32)( nSize - 8 )\n            << mnCurrentShapeID\n            << (sal_uInt32)( mnFIDCLs + 1 )\n            << mnTotalShapesDgg\n            << mnDrawings;\n\n        rSt.Write( maFIDCLs.GetData(), nSize - 24 );\n    }\n}\n\n\/\/ ---------------------------------------------------------------------------------------------\n\n#define ESCHER_OPT_COUNT 6\n\nsal_uInt32 PptEscherEx::ImplOptAtomSize()\n{\n    sal_uInt32 nSize = 0;\n    if ( ESCHER_OPT_COUNT )\n        nSize = ( ESCHER_OPT_COUNT * 6 ) + 8;\n    return nSize;\n}\n\nvoid PptEscherEx::ImplWriteOptAtom( SvStream& rSt )\n{\n    sal_uInt32 nSize = ImplOptAtomSize();\n    if ( nSize )\n    {\n        rSt << (sal_uInt32)( ( ESCHER_OPT << 16 ) | ( ESCHER_OPT_COUNT << 4 ) | 0x3 )\n            << (sal_uInt32)( nSize - 8 )\n            << (sal_uInt16)ESCHER_Prop_fillColor            << (sal_uInt32)0xffb800\n            << (sal_uInt16)ESCHER_Prop_fillBackColor        << (sal_uInt32)0\n            << (sal_uInt16)ESCHER_Prop_fNoFillHitTest       << (sal_uInt32)0x00100010\n            << (sal_uInt16)ESCHER_Prop_lineColor            << (sal_uInt32)0x8000001\n            << (sal_uInt16)ESCHER_Prop_fNoLineDrawDash      << (sal_uInt32)0x00080008\n            << (sal_uInt16)ESCHER_Prop_shadowColor          << (sal_uInt32)0x8000002;\n    }\n}\n\n\/\/ ---------------------------------------------------------------------------------------------\n\n#define ESCHER_SPLIT_MENU_COLORS_COUNT  4\n\nsal_uInt32 PptEscherEx::ImplSplitMenuColorsAtomSize()\n{\n    sal_uInt32 nSize = 0;\n    if ( ESCHER_SPLIT_MENU_COLORS_COUNT )\n        nSize = ( ESCHER_SPLIT_MENU_COLORS_COUNT << 2 ) + 8;\n    return nSize;\n}\n\nvoid PptEscherEx::ImplWriteSplitMenuColorsAtom( SvStream& rSt )\n{\n    UINT32 nSize = ImplSplitMenuColorsAtomSize();\n    if ( nSize )\n    {\n        rSt << (sal_uInt32)( ( ESCHER_SplitMenuColors << 16 ) | ( ESCHER_SPLIT_MENU_COLORS_COUNT << 4 ) )\n            << (sal_uInt32)( nSize - 8 )\n            << (sal_uInt32)0x08000004\n            << (sal_uInt32)0x08000001\n            << (sal_uInt32)0x08000002\n            << (sal_uInt32)0x100000f7;\n    }\n\n}\n\n\/\/ ---------------------------------------------------------------------------------------------\n\nPptEscherEx::~PptEscherEx()\n{\n}\n\n\/\/ ---------------------------------------------------------------------------------------------\n\nvoid PptEscherEx::OpenContainer( UINT16 n_EscherContainer, int nRecInstance )\n{\n    *mpOutStrm << (UINT16)( ( nRecInstance << 4 ) | 0xf  ) << n_EscherContainer << (UINT32)0;\n    mOffsets.push_back( mpOutStrm->Tell() - 4 );\n    mRecTypes.push_back( n_EscherContainer );\n\n    switch( n_EscherContainer )\n    {\n        case ESCHER_DgContainer :\n        {\n            if ( !mbEscherDg )\n            {\n                mbEscherDg = TRUE;\n                mnCurrentDg++;\n                mnTotalShapesDg = 0;\n                mnTotalShapeIdUsedDg = 0;\n                mnCurrentShapeID = ( mnCurrentShapeMaximumID &~0x3ff ) + 0x400; \/\/ eine neue Seite bekommt immer eine neue ShapeId die ein vielfaches von 1024 ist,\n                                                                                \/\/ damit ist erste aktuelle Shape ID 0x400\n                AddAtom( 8, ESCHER_Dg, 0, mnCurrentDg );\n                PtReplaceOrInsert( ESCHER_Persist_Dg | mnCurrentDg, mpOutStrm->Tell() );\n                *mpOutStrm << (UINT32)0     \/\/ The number of shapes in this drawing\n                           << (UINT32)0;    \/\/ The last MSOSPID given to an SP in this DG\n            }\n        }\n        break;\n\n        case ESCHER_SpgrContainer :\n        {\n            if ( mbEscherDg )\n            {\n                mbEscherSpgr = TRUE;\n            }\n        }\n        break;\n\n        case ESCHER_SpContainer :\n        {\n        }\n        break;\n\n        default:\n        break;\n    }\n}\n\n\/\/ ---------------------------------------------------------------------------------------------\n\nvoid PptEscherEx::CloseContainer()\n{\n    \/* SJ: #Issue 26747#\n       not creating group objects with a depth higher than 16, because then\n       PPT is having a big performance problem when starting a slide show\n    *\/\n    if ( ( mRecTypes.back() != ESCHER_SpgrContainer ) || ( mnGroupLevel < 12 ) )\n    {\n        UINT32 nSize, nPos = mpOutStrm->Tell();\n        nSize = ( nPos - mOffsets.back() ) - 4;\n        mpOutStrm->Seek( mOffsets.back() );\n        *mpOutStrm << nSize;\n\n        switch( mRecTypes.back() )\n        {\n            case ESCHER_DgContainer :\n            {\n                if ( mbEscherDg )\n                {\n                    mbEscherDg = FALSE;\n                    if ( DoSeek( ESCHER_Persist_Dg | mnCurrentDg ) )\n                    {\n                        \/\/ shapeanzahl des drawings setzen\n                        mnTotalShapesDgg += mnTotalShapesDg;\n                        *mpOutStrm << mnTotalShapesDg << mnCurrentShapeMaximumID;\n\n                        if ( !mnTotalShapesDg )\n                        {\n                            maFIDCLs << (UINT32)0\n                                    << (UINT32)0;\n                        }\n                        else\n                        {\n                            if ( mnTotalShapeIdUsedDg )\n                            {\n                                UINT32 i, nFIDCL = ( ( mnTotalShapeIdUsedDg - 1 ) \/ 0x400 );\n                                if ( nFIDCL )\n                                    mnFIDCLs += nFIDCL;\n                                for ( i = 0; i <= nFIDCL; i++ )\n                                {\n                                    maFIDCLs << mnCurrentDg;            \/\/ drawing number\n                                    if ( i < nFIDCL )\n                                        maFIDCLs << 0x400;\n                                    else\n                                    {\n                                        UINT32 nShapesLeft = mnTotalShapeIdUsedDg % 0x400;\n                                        if ( !nShapesLeft )\n                                            nShapesLeft = 0x400;        \/\/ shape count in this IDCL\n                                        maFIDCLs << (UINT32)nShapesLeft;\n                                    }\n                                }\n                            }\n                        }\n                    }\n                }\n            }\n            break;\n\n            case ESCHER_SpgrContainer :\n            {\n                if ( mbEscherSpgr )\n                {\n                    mbEscherSpgr = FALSE;\n\n                }\n            }\n            break;\n\n            default:\n            break;\n        }\n        mOffsets.pop_back();\n        mRecTypes.pop_back();\n        mpOutStrm->Seek( nPos );\n    }\n}\n\n\/\/ ---------------------------------------------------------------------------------------------\n\nsal_uInt32 PptEscherEx::EnterGroup( Rectangle* pBoundRect, SvMemoryStream* pClientData )\n{\n    sal_uInt32 nShapeId = 0;\n    \/* SJ: #Issue 26747#\n       not creating group objects with a depth higher than 16, because then\n       PPT is having a big performance problem when starting a slide show\n    *\/\n    if ( mnGroupLevel < 12 )\n    {\n        Rectangle aRect;\n        if ( pBoundRect )\n            aRect = *pBoundRect;\n\n        OpenContainer( ESCHER_SpgrContainer );\n        OpenContainer( ESCHER_SpContainer );\n        AddAtom( 16, ESCHER_Spgr, 1 );\n        PtReplaceOrInsert( ESCHER_Persist_Grouping_Snap | mnGroupLevel, mpOutStrm->Tell() );\n        *mpOutStrm  << (INT32)aRect.Left()  \/\/ Bounding box fuer die Gruppierten shapes an die sie attached werden\n                    << (INT32)aRect.Top()\n                    << (INT32)aRect.Right()\n                    << (INT32)aRect.Bottom();\n\n        nShapeId = GetShapeID();\n        if ( !mnGroupLevel )\n            AddShape( ESCHER_ShpInst_Min, 5, nShapeId );                    \/\/ Flags: Group | Patriarch\n        else\n        {\n            AddShape( ESCHER_ShpInst_Min, 0x201, nShapeId );                \/\/ Flags: Group | HaveAnchor\n            AddAtom( 8, ESCHER_ClientAnchor );\n            PtReplaceOrInsert( ESCHER_Persist_Grouping_Logic | mnGroupLevel, mpOutStrm->Tell() );\n            *mpOutStrm << (INT16)aRect.Top() << (INT16)aRect.Left() << (INT16)aRect.Right() << (INT16)aRect.Bottom();\n        }\n        if ( pClientData )\n        {\n            pClientData->Seek( STREAM_SEEK_TO_END );\n            sal_uInt32 nSize = pClientData->Tell();\n            if ( nSize )\n            {\n                *mpOutStrm << (sal_uInt32)( ( ESCHER_ClientData << 16 ) | 0xf )\n                        << nSize;\n                mpOutStrm->Write( pClientData->GetData(), nSize );\n            }\n        }\n        CloseContainer();                                               \/\/ ESCHER_SpContainer\n    }\n    mnGroupLevel++;\n    return nShapeId;\n}\n\n\/\/ ---------------------------------------------------------------------------------------------\n<commit_msg>INTEGRATION: CWS changefileheader (1.12.358); FILE MERGED 2008\/03\/31 13:56:48 rt 1.12.358.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: escherex.cxx,v $\n * $Revision: 1.13 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org.  If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sd.hxx\"\n\n\n#ifndef _PptEscherEx_HXX\n#include \"escherex.hxx\"\n#endif\n\n\/\/ ---------------------------------------------------------------------------------------------\n\/\/ ---------------------------------------------------------------------------------------------\n\/\/ ---------------------------------------------------------------------------------------------\n\nPptEscherEx::PptEscherEx( SvStream& rOutStrm, UINT32 nDrawings ) :\n    EscherEx                ( rOutStrm, nDrawings )\n{\n    mnFIDCLs = nDrawings;\n    mnCurrentDg = 0;\n    mnCurrentShapeID = 0;\n    mnTotalShapesDgg = 0;\n    mnCurrentShapeMaximumID = 0;\n}\n\n\/\/ ---------------------------------------------------------------------------------------------\n\nsal_uInt32 PptEscherEx::DrawingGroupContainerSize()\n{\n    return ImplDggContainerSize() + 8;\n}\n\nvoid PptEscherEx::WriteDrawingGroupContainer( SvStream& rSt )\n{\n    UINT32 nSize = DrawingGroupContainerSize();\n    rSt << (sal_uInt32)( 0xf | ( 1035 << 16 ) )     \/\/ EPP_PPDrawingGroup\n        << (sal_uInt32)( nSize - 8 );\n\n    ImplWriteDggContainer( rSt );\n}\n\n\/\/ ---------------------------------------------------------------------------------------------\n\nsal_uInt32 PptEscherEx::ImplDggContainerSize()\n{\n    UINT32 nSize;\n\n    nSize  = ImplDggAtomSize();\n    nSize += GetBlibStoreContainerSize();\n    nSize += ImplOptAtomSize();\n    nSize += ImplSplitMenuColorsAtomSize();\n\n    return nSize + 8;\n}\n\nvoid PptEscherEx::ImplWriteDggContainer( SvStream& rSt )\n{\n    sal_uInt32 nSize = ImplDggContainerSize();\n    if ( nSize )\n    {\n        rSt << (sal_uInt32)( 0xf | ( ESCHER_DggContainer << 16 ) )\n            << (sal_uInt32)( nSize - 8 );\n\n        ImplWriteDggAtom( rSt );\n        WriteBlibStoreContainer( rSt );\n        ImplWriteOptAtom( rSt );\n        ImplWriteSplitMenuColorsAtom( rSt );\n    }\n}\n\n\/\/ ---------------------------------------------------------------------------------------------\n\nsal_uInt32 PptEscherEx::ImplDggAtomSize()\n{\n    return maFIDCLs.Tell() + 24;\n}\n\nvoid PptEscherEx::ImplWriteDggAtom( SvStream& rSt )\n{\n    sal_uInt32 nSize = ImplDggAtomSize();\n    if ( nSize )\n    {\n        rSt << (sal_uInt32)( ESCHER_Dgg << 16 )\n            << (sal_uInt32)( nSize - 8 )\n            << mnCurrentShapeID\n            << (sal_uInt32)( mnFIDCLs + 1 )\n            << mnTotalShapesDgg\n            << mnDrawings;\n\n        rSt.Write( maFIDCLs.GetData(), nSize - 24 );\n    }\n}\n\n\/\/ ---------------------------------------------------------------------------------------------\n\n#define ESCHER_OPT_COUNT 6\n\nsal_uInt32 PptEscherEx::ImplOptAtomSize()\n{\n    sal_uInt32 nSize = 0;\n    if ( ESCHER_OPT_COUNT )\n        nSize = ( ESCHER_OPT_COUNT * 6 ) + 8;\n    return nSize;\n}\n\nvoid PptEscherEx::ImplWriteOptAtom( SvStream& rSt )\n{\n    sal_uInt32 nSize = ImplOptAtomSize();\n    if ( nSize )\n    {\n        rSt << (sal_uInt32)( ( ESCHER_OPT << 16 ) | ( ESCHER_OPT_COUNT << 4 ) | 0x3 )\n            << (sal_uInt32)( nSize - 8 )\n            << (sal_uInt16)ESCHER_Prop_fillColor            << (sal_uInt32)0xffb800\n            << (sal_uInt16)ESCHER_Prop_fillBackColor        << (sal_uInt32)0\n            << (sal_uInt16)ESCHER_Prop_fNoFillHitTest       << (sal_uInt32)0x00100010\n            << (sal_uInt16)ESCHER_Prop_lineColor            << (sal_uInt32)0x8000001\n            << (sal_uInt16)ESCHER_Prop_fNoLineDrawDash      << (sal_uInt32)0x00080008\n            << (sal_uInt16)ESCHER_Prop_shadowColor          << (sal_uInt32)0x8000002;\n    }\n}\n\n\/\/ ---------------------------------------------------------------------------------------------\n\n#define ESCHER_SPLIT_MENU_COLORS_COUNT  4\n\nsal_uInt32 PptEscherEx::ImplSplitMenuColorsAtomSize()\n{\n    sal_uInt32 nSize = 0;\n    if ( ESCHER_SPLIT_MENU_COLORS_COUNT )\n        nSize = ( ESCHER_SPLIT_MENU_COLORS_COUNT << 2 ) + 8;\n    return nSize;\n}\n\nvoid PptEscherEx::ImplWriteSplitMenuColorsAtom( SvStream& rSt )\n{\n    UINT32 nSize = ImplSplitMenuColorsAtomSize();\n    if ( nSize )\n    {\n        rSt << (sal_uInt32)( ( ESCHER_SplitMenuColors << 16 ) | ( ESCHER_SPLIT_MENU_COLORS_COUNT << 4 ) )\n            << (sal_uInt32)( nSize - 8 )\n            << (sal_uInt32)0x08000004\n            << (sal_uInt32)0x08000001\n            << (sal_uInt32)0x08000002\n            << (sal_uInt32)0x100000f7;\n    }\n\n}\n\n\/\/ ---------------------------------------------------------------------------------------------\n\nPptEscherEx::~PptEscherEx()\n{\n}\n\n\/\/ ---------------------------------------------------------------------------------------------\n\nvoid PptEscherEx::OpenContainer( UINT16 n_EscherContainer, int nRecInstance )\n{\n    *mpOutStrm << (UINT16)( ( nRecInstance << 4 ) | 0xf  ) << n_EscherContainer << (UINT32)0;\n    mOffsets.push_back( mpOutStrm->Tell() - 4 );\n    mRecTypes.push_back( n_EscherContainer );\n\n    switch( n_EscherContainer )\n    {\n        case ESCHER_DgContainer :\n        {\n            if ( !mbEscherDg )\n            {\n                mbEscherDg = TRUE;\n                mnCurrentDg++;\n                mnTotalShapesDg = 0;\n                mnTotalShapeIdUsedDg = 0;\n                mnCurrentShapeID = ( mnCurrentShapeMaximumID &~0x3ff ) + 0x400; \/\/ eine neue Seite bekommt immer eine neue ShapeId die ein vielfaches von 1024 ist,\n                                                                                \/\/ damit ist erste aktuelle Shape ID 0x400\n                AddAtom( 8, ESCHER_Dg, 0, mnCurrentDg );\n                PtReplaceOrInsert( ESCHER_Persist_Dg | mnCurrentDg, mpOutStrm->Tell() );\n                *mpOutStrm << (UINT32)0     \/\/ The number of shapes in this drawing\n                           << (UINT32)0;    \/\/ The last MSOSPID given to an SP in this DG\n            }\n        }\n        break;\n\n        case ESCHER_SpgrContainer :\n        {\n            if ( mbEscherDg )\n            {\n                mbEscherSpgr = TRUE;\n            }\n        }\n        break;\n\n        case ESCHER_SpContainer :\n        {\n        }\n        break;\n\n        default:\n        break;\n    }\n}\n\n\/\/ ---------------------------------------------------------------------------------------------\n\nvoid PptEscherEx::CloseContainer()\n{\n    \/* SJ: #Issue 26747#\n       not creating group objects with a depth higher than 16, because then\n       PPT is having a big performance problem when starting a slide show\n    *\/\n    if ( ( mRecTypes.back() != ESCHER_SpgrContainer ) || ( mnGroupLevel < 12 ) )\n    {\n        UINT32 nSize, nPos = mpOutStrm->Tell();\n        nSize = ( nPos - mOffsets.back() ) - 4;\n        mpOutStrm->Seek( mOffsets.back() );\n        *mpOutStrm << nSize;\n\n        switch( mRecTypes.back() )\n        {\n            case ESCHER_DgContainer :\n            {\n                if ( mbEscherDg )\n                {\n                    mbEscherDg = FALSE;\n                    if ( DoSeek( ESCHER_Persist_Dg | mnCurrentDg ) )\n                    {\n                        \/\/ shapeanzahl des drawings setzen\n                        mnTotalShapesDgg += mnTotalShapesDg;\n                        *mpOutStrm << mnTotalShapesDg << mnCurrentShapeMaximumID;\n\n                        if ( !mnTotalShapesDg )\n                        {\n                            maFIDCLs << (UINT32)0\n                                    << (UINT32)0;\n                        }\n                        else\n                        {\n                            if ( mnTotalShapeIdUsedDg )\n                            {\n                                UINT32 i, nFIDCL = ( ( mnTotalShapeIdUsedDg - 1 ) \/ 0x400 );\n                                if ( nFIDCL )\n                                    mnFIDCLs += nFIDCL;\n                                for ( i = 0; i <= nFIDCL; i++ )\n                                {\n                                    maFIDCLs << mnCurrentDg;            \/\/ drawing number\n                                    if ( i < nFIDCL )\n                                        maFIDCLs << 0x400;\n                                    else\n                                    {\n                                        UINT32 nShapesLeft = mnTotalShapeIdUsedDg % 0x400;\n                                        if ( !nShapesLeft )\n                                            nShapesLeft = 0x400;        \/\/ shape count in this IDCL\n                                        maFIDCLs << (UINT32)nShapesLeft;\n                                    }\n                                }\n                            }\n                        }\n                    }\n                }\n            }\n            break;\n\n            case ESCHER_SpgrContainer :\n            {\n                if ( mbEscherSpgr )\n                {\n                    mbEscherSpgr = FALSE;\n\n                }\n            }\n            break;\n\n            default:\n            break;\n        }\n        mOffsets.pop_back();\n        mRecTypes.pop_back();\n        mpOutStrm->Seek( nPos );\n    }\n}\n\n\/\/ ---------------------------------------------------------------------------------------------\n\nsal_uInt32 PptEscherEx::EnterGroup( Rectangle* pBoundRect, SvMemoryStream* pClientData )\n{\n    sal_uInt32 nShapeId = 0;\n    \/* SJ: #Issue 26747#\n       not creating group objects with a depth higher than 16, because then\n       PPT is having a big performance problem when starting a slide show\n    *\/\n    if ( mnGroupLevel < 12 )\n    {\n        Rectangle aRect;\n        if ( pBoundRect )\n            aRect = *pBoundRect;\n\n        OpenContainer( ESCHER_SpgrContainer );\n        OpenContainer( ESCHER_SpContainer );\n        AddAtom( 16, ESCHER_Spgr, 1 );\n        PtReplaceOrInsert( ESCHER_Persist_Grouping_Snap | mnGroupLevel, mpOutStrm->Tell() );\n        *mpOutStrm  << (INT32)aRect.Left()  \/\/ Bounding box fuer die Gruppierten shapes an die sie attached werden\n                    << (INT32)aRect.Top()\n                    << (INT32)aRect.Right()\n                    << (INT32)aRect.Bottom();\n\n        nShapeId = GetShapeID();\n        if ( !mnGroupLevel )\n            AddShape( ESCHER_ShpInst_Min, 5, nShapeId );                    \/\/ Flags: Group | Patriarch\n        else\n        {\n            AddShape( ESCHER_ShpInst_Min, 0x201, nShapeId );                \/\/ Flags: Group | HaveAnchor\n            AddAtom( 8, ESCHER_ClientAnchor );\n            PtReplaceOrInsert( ESCHER_Persist_Grouping_Logic | mnGroupLevel, mpOutStrm->Tell() );\n            *mpOutStrm << (INT16)aRect.Top() << (INT16)aRect.Left() << (INT16)aRect.Right() << (INT16)aRect.Bottom();\n        }\n        if ( pClientData )\n        {\n            pClientData->Seek( STREAM_SEEK_TO_END );\n            sal_uInt32 nSize = pClientData->Tell();\n            if ( nSize )\n            {\n                *mpOutStrm << (sal_uInt32)( ( ESCHER_ClientData << 16 ) | 0xf )\n                        << nSize;\n                mpOutStrm->Write( pClientData->GetData(), nSize );\n            }\n        }\n        CloseContainer();                                               \/\/ ESCHER_SpContainer\n    }\n    mnGroupLevel++;\n    return nShapeId;\n}\n\n\/\/ ---------------------------------------------------------------------------------------------\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file restclient.cpp\n * @brief implementation of the restclient class\n * @author Daniel Schauenberg <d@unwiredcouch.com>\n *\/\n\n\/*========================\n         INCLUDES\n  ========================*\/\n#include \"include\/restclient.h\"\n\n#include <cstring>\n#include <string>\n#include <iostream>\n\n\/** initialize user agent string *\/\nconst char* RestClient::user_agent = \"restclient-cpp\/\" VERSION;\n\/**\n * @brief HTTP GET method\n *\n * @param url to query\n *\n * @return response struct\n *\/\nRestClient::response RestClient::get(const std::string& url)\n{\n  \/** create return struct *\/\n  RestClient::response ret;\n\n  \/\/ use libcurl\n  CURL *curl;\n  CURLcode res;\n\n  curl = curl_easy_init();\n  if (curl)\n  {\n    \/** set user agent *\/\n    curl_easy_setopt(curl, CURLOPT_USERAGENT, RestClient::user_agent);\n    \/** set query URL *\/\n    curl_easy_setopt(curl, CURLOPT_URL, url.c_str());\n    \/** set callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, RestClient::write_callback);\n    \/** set data object to pass to callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEDATA, &ret);\n    \/** perform the actual query *\/\n    res = curl_easy_perform(curl);\n    if (res != 0)\n    {\n      std::cerr << \"Failed to query \" << url << \":\"\n          << std::endl << curl_easy_strerror(res) << std::endl << std::flush;\n      exit(1);\n    }\n    long http_code = 0;\n    curl_easy_getinfo(curl, CURLINFO_RESPONSE_CODE, &http_code);\n    ret.code = static_cast<int>(http_code);\n\n    curl_easy_cleanup(curl);\n  }\n\n  return ret;\n}\n\/**\n * @brief HTTP POST method\n *\n * @param url to query\n * @param ctype content type as string\n * @param data HTTP POST body\n *\n * @return response struct\n *\/\nRestClient::response RestClient::post(const std::string& url,\n                                      const std::string& ctype,\n                                      const std::string& data)\n{\n  \/** create return struct *\/\n  RestClient::response ret;\n  \/** build content-type header string *\/\n  std::string ctype_header = \"Content-Type: \" + ctype;\n\n  \/** initialize upload object *\/\n  RestClient::upload_object up_obj;\n  up_obj.data = data.c_str();\n  up_obj.length = data.size();\n\n  \/\/ use libcurl\n  CURL *curl;\n  CURLcode res;\n\n  curl = curl_easy_init();\n  if (curl)\n  {\n    \/** set user agent *\/\n    curl_easy_setopt(curl, CURLOPT_USERAGENT, RestClient::user_agent);\n    \/** set query URL *\/\n    curl_easy_setopt(curl, CURLOPT_URL, url.c_str());\n    \/** Now specify we want to POST data *\/\n    curl_easy_setopt(curl, CURLOPT_POST, 1L);\n    \/** set post fields *\/\n    curl_easy_setopt(curl, CURLOPT_POSTFIELDS, data.c_str());\n    curl_easy_setopt(curl, CURLOPT_POSTFIELDSIZE, data.size());\n    \/** set callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, RestClient::write_callback);\n    \/** set data object to pass to callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEDATA, &ret);\n    \/** set content-type header *\/\n    curl_slist* header = NULL;\n    header = curl_slist_append(header, ctype_header.c_str());\n    curl_easy_setopt(curl, CURLOPT_HTTPHEADER, header);\n    \/** perform the actual query *\/\n    res = curl_easy_perform(curl);\n    if (res != 0)\n    {\n      std::cerr << \"Failed to query \" << url << \":\"\n          << std::endl << curl_easy_strerror(res) << std::endl << std::flush;\n      exit(1);\n    }\n    long http_code = 0;\n    curl_easy_getinfo(curl, CURLINFO_RESPONSE_CODE, &http_code);\n    ret.code = static_cast<int>(http_code);\n\n    curl_easy_cleanup(curl);\n  }\n\n  return ret;\n}\n\/**\n * @brief HTTP PUT method\n *\n * @param url to query\n * @param ctype content type as string\n * @param data HTTP PUT body\n *\n * @return response struct\n *\/\nRestClient::response RestClient::put(const std::string& url,\n                                     const std::string& ctype,\n                                     const std::string& data)\n{\n  \/** create return struct *\/\n  RestClient::response ret;\n  \/** build content-type header string *\/\n  std::string ctype_header = \"Content-Type: \" + ctype;\n\n  \/** initialize upload object *\/\n  RestClient::upload_object up_obj;\n  up_obj.data = data.c_str();\n  up_obj.length = data.size();\n\n  \/\/ use libcurl\n  CURL *curl;\n  CURLcode res;\n\n  curl = curl_easy_init();\n  if (curl)\n  {\n    \/** set user agent *\/\n    curl_easy_setopt(curl, CURLOPT_USERAGENT, RestClient::user_agent);\n    \/** set query URL *\/\n    curl_easy_setopt(curl, CURLOPT_URL, url.c_str());\n    \/** Now specify we want to PUT data *\/\n    curl_easy_setopt(curl, CURLOPT_PUT, 1L);\n    curl_easy_setopt(curl, CURLOPT_UPLOAD, 1L);\n    \/** set read callback function *\/\n    curl_easy_setopt(curl, CURLOPT_READFUNCTION, RestClient::read_callback);\n    \/** set data object to pass to callback function *\/\n    curl_easy_setopt(curl, CURLOPT_READDATA, &up_obj);\n    \/** set callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, RestClient::write_callback);\n    \/** set data object to pass to callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEDATA, &ret);\n    \/** set data size *\/\n    curl_easy_setopt(curl, CURLOPT_INFILESIZE,\n                     static_cast<long>(up_obj.length));\n\n    \/** set content-type header *\/\n    curl_slist* header = NULL;\n    header = curl_slist_append(header, ctype_header.c_str());\n    curl_easy_setopt(curl, CURLOPT_HTTPHEADER, header);\n    \/** perform the actual query *\/\n    res = curl_easy_perform(curl);\n    if (res != 0)\n    {\n      std::cerr << \"Failed to query \" << url << \":\"\n          << std::endl << curl_easy_strerror(res) << std::endl << std::flush;\n      exit(1);\n    }\n    long http_code = 0;\n    curl_easy_getinfo(curl, CURLINFO_RESPONSE_CODE, &http_code);\n    ret.code = static_cast<int>(http_code);\n\n    curl_easy_cleanup(curl);\n  }\n\n  return ret;\n}\n\/**\n * @brief HTTP DELETE method\n *\n * @param url to query\n *\n * @return response struct\n *\/\nRestClient::response RestClient::del(const std::string& url)\n{\n  \/** create return struct *\/\n  RestClient::response ret;\n\n  \/** we want HTTP DELETE *\/\n  const char* http_delete = \"DELETE\";\n\n  \/\/ use libcurl\n  CURL *curl;\n  CURLcode res;\n\n  curl = curl_easy_init();\n  if (curl)\n  {\n    \/** set user agent *\/\n    curl_easy_setopt(curl, CURLOPT_USERAGENT, RestClient::user_agent);\n    \/** set query URL *\/\n    curl_easy_setopt(curl, CURLOPT_URL, url.c_str());\n    \/** set HTTP DELETE METHOD *\/\n    curl_easy_setopt(curl, CURLOPT_CUSTOMREQUEST, http_delete);\n    \/** set callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, RestClient::write_callback);\n    \/** set data object to pass to callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEDATA, &ret);\n    \/** perform the actual query *\/\n    res = curl_easy_perform(curl);\n    if (res != 0)\n    {\n      std::cerr << \"Failed to query \" << url << \":\"\n          << std::endl << curl_easy_strerror(res) << std::endl << std::flush;\n      exit(1);\n    }\n    long http_code = 0;\n    curl_easy_getinfo(curl, CURLINFO_RESPONSE_CODE, &http_code);\n    ret.code = static_cast<int>(http_code);\n\n    curl_easy_cleanup(curl);\n  }\n\n  return ret;\n}\n\n\/**\n * @brief write callback function for libcurl\n *\n * @param data returned data of size (size*nmemb)\n * @param size size parameter\n * @param nmemb memblock parameter\n * @param userdata pointer to user data to save\/work with return data\n *\n * @return (size * nmemb)\n *\/\nsize_t RestClient::write_callback(void *data, size_t size, size_t nmemb,\n                            void *userdata)\n{\n  RestClient::response* r;\n  r = reinterpret_cast<RestClient::response*>(userdata);\n  r->body.append(reinterpret_cast<char*>(data), size*nmemb);\n\n  return (size * nmemb);\n}\n\n\/**\n * @brief read callback function for libcurl\n *\n * @param pointer of max size (size*nmemb) to write data to\n * @param size size parameter\n * @param nmemb memblock parameter\n * @param userdata pointer to user data to read data from\n *\n * @return (size * nmemb)\n *\/\nsize_t RestClient::read_callback(void *data, size_t size, size_t nmemb,\n                            void *userdata)\n{\n  \/** get upload struct *\/\n  RestClient::upload_object* u;\n  u = reinterpret_cast<RestClient::upload_object*>(userdata);\n  \/** set correct sizes *\/\n  size_t curl_size = size * nmemb;\n  size_t copy_size = (u->length < curl_size) ? u->length : curl_size;\n  \/** copy data to buffer *\/\n  memcpy(data, u->data, copy_size);\n  \/** decrement length and increment data pointer *\/\n  u->length -= copy_size;\n  u->data += copy_size;\n  \/** return copied size *\/\n  return copy_size;\n}\n<commit_msg>return -1 for failed query instead of exit(1)<commit_after>\/**\n * @file restclient.cpp\n * @brief implementation of the restclient class\n * @author Daniel Schauenberg <d@unwiredcouch.com>\n *\/\n\n\/*========================\n         INCLUDES\n  ========================*\/\n#include \"include\/restclient.h\"\n\n#include <cstring>\n#include <string>\n#include <iostream>\n\n\/** initialize user agent string *\/\nconst char* RestClient::user_agent = \"restclient-cpp\/\" VERSION;\n\/**\n * @brief HTTP GET method\n *\n * @param url to query\n *\n * @return response struct\n *\/\nRestClient::response RestClient::get(const std::string& url)\n{\n  \/** create return struct *\/\n  RestClient::response ret;\n\n  \/\/ use libcurl\n  CURL *curl;\n  CURLcode res;\n\n  curl = curl_easy_init();\n  if (curl)\n  {\n    \/** set user agent *\/\n    curl_easy_setopt(curl, CURLOPT_USERAGENT, RestClient::user_agent);\n    \/** set query URL *\/\n    curl_easy_setopt(curl, CURLOPT_URL, url.c_str());\n    \/** set callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, RestClient::write_callback);\n    \/** set data object to pass to callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEDATA, &ret);\n    \/** perform the actual query *\/\n    res = curl_easy_perform(curl);\n    if (res != 0)\n    {\n      ret.body = \"Failed to query.\";\n      ret.code = -1;\n      return ret;\n    }\n    long http_code = 0;\n    curl_easy_getinfo(curl, CURLINFO_RESPONSE_CODE, &http_code);\n    ret.code = static_cast<int>(http_code);\n\n    curl_easy_cleanup(curl);\n  }\n\n  return ret;\n}\n\/**\n * @brief HTTP POST method\n *\n * @param url to query\n * @param ctype content type as string\n * @param data HTTP POST body\n *\n * @return response struct\n *\/\nRestClient::response RestClient::post(const std::string& url,\n                                      const std::string& ctype,\n                                      const std::string& data)\n{\n  \/** create return struct *\/\n  RestClient::response ret;\n  \/** build content-type header string *\/\n  std::string ctype_header = \"Content-Type: \" + ctype;\n\n  \/** initialize upload object *\/\n  RestClient::upload_object up_obj;\n  up_obj.data = data.c_str();\n  up_obj.length = data.size();\n\n  \/\/ use libcurl\n  CURL *curl;\n  CURLcode res;\n\n  curl = curl_easy_init();\n  if (curl)\n  {\n    \/** set user agent *\/\n    curl_easy_setopt(curl, CURLOPT_USERAGENT, RestClient::user_agent);\n    \/** set query URL *\/\n    curl_easy_setopt(curl, CURLOPT_URL, url.c_str());\n    \/** Now specify we want to POST data *\/\n    curl_easy_setopt(curl, CURLOPT_POST, 1L);\n    \/** set post fields *\/\n    curl_easy_setopt(curl, CURLOPT_POSTFIELDS, data.c_str());\n    curl_easy_setopt(curl, CURLOPT_POSTFIELDSIZE, data.size());\n    \/** set callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, RestClient::write_callback);\n    \/** set data object to pass to callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEDATA, &ret);\n    \/** set content-type header *\/\n    curl_slist* header = NULL;\n    header = curl_slist_append(header, ctype_header.c_str());\n    curl_easy_setopt(curl, CURLOPT_HTTPHEADER, header);\n    \/** perform the actual query *\/\n    res = curl_easy_perform(curl);\n    if (res != 0)\n    {\n      ret.body = \"Failed to query.\";\n      ret.code = -1;\n      return ret;\n    }\n    long http_code = 0;\n    curl_easy_getinfo(curl, CURLINFO_RESPONSE_CODE, &http_code);\n    ret.code = static_cast<int>(http_code);\n\n    curl_easy_cleanup(curl);\n  }\n\n  return ret;\n}\n\/**\n * @brief HTTP PUT method\n *\n * @param url to query\n * @param ctype content type as string\n * @param data HTTP PUT body\n *\n * @return response struct\n *\/\nRestClient::response RestClient::put(const std::string& url,\n                                     const std::string& ctype,\n                                     const std::string& data)\n{\n  \/** create return struct *\/\n  RestClient::response ret;\n  \/** build content-type header string *\/\n  std::string ctype_header = \"Content-Type: \" + ctype;\n\n  \/** initialize upload object *\/\n  RestClient::upload_object up_obj;\n  up_obj.data = data.c_str();\n  up_obj.length = data.size();\n\n  \/\/ use libcurl\n  CURL *curl;\n  CURLcode res;\n\n  curl = curl_easy_init();\n  if (curl)\n  {\n    \/** set user agent *\/\n    curl_easy_setopt(curl, CURLOPT_USERAGENT, RestClient::user_agent);\n    \/** set query URL *\/\n    curl_easy_setopt(curl, CURLOPT_URL, url.c_str());\n    \/** Now specify we want to PUT data *\/\n    curl_easy_setopt(curl, CURLOPT_PUT, 1L);\n    curl_easy_setopt(curl, CURLOPT_UPLOAD, 1L);\n    \/** set read callback function *\/\n    curl_easy_setopt(curl, CURLOPT_READFUNCTION, RestClient::read_callback);\n    \/** set data object to pass to callback function *\/\n    curl_easy_setopt(curl, CURLOPT_READDATA, &up_obj);\n    \/** set callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, RestClient::write_callback);\n    \/** set data object to pass to callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEDATA, &ret);\n    \/** set data size *\/\n    curl_easy_setopt(curl, CURLOPT_INFILESIZE,\n                     static_cast<long>(up_obj.length));\n\n    \/** set content-type header *\/\n    curl_slist* header = NULL;\n    header = curl_slist_append(header, ctype_header.c_str());\n    curl_easy_setopt(curl, CURLOPT_HTTPHEADER, header);\n    \/** perform the actual query *\/\n    res = curl_easy_perform(curl);\n    if (res != 0)\n    {\n      ret.body = \"Failed to query.\";\n      ret.code = -1;\n      return ret;\n    }\n    long http_code = 0;\n    curl_easy_getinfo(curl, CURLINFO_RESPONSE_CODE, &http_code);\n    ret.code = static_cast<int>(http_code);\n\n    curl_easy_cleanup(curl);\n  }\n\n  return ret;\n}\n\/**\n * @brief HTTP DELETE method\n *\n * @param url to query\n *\n * @return response struct\n *\/\nRestClient::response RestClient::del(const std::string& url)\n{\n  \/** create return struct *\/\n  RestClient::response ret;\n\n  \/** we want HTTP DELETE *\/\n  const char* http_delete = \"DELETE\";\n\n  \/\/ use libcurl\n  CURL *curl;\n  CURLcode res;\n\n  curl = curl_easy_init();\n  if (curl)\n  {\n    \/** set user agent *\/\n    curl_easy_setopt(curl, CURLOPT_USERAGENT, RestClient::user_agent);\n    \/** set query URL *\/\n    curl_easy_setopt(curl, CURLOPT_URL, url.c_str());\n    \/** set HTTP DELETE METHOD *\/\n    curl_easy_setopt(curl, CURLOPT_CUSTOMREQUEST, http_delete);\n    \/** set callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, RestClient::write_callback);\n    \/** set data object to pass to callback function *\/\n    curl_easy_setopt(curl, CURLOPT_WRITEDATA, &ret);\n    \/** perform the actual query *\/\n    res = curl_easy_perform(curl);\n    if (res != 0)\n    {\n      ret.body = \"Failed to query.\";\n      ret.code = -1;\n      return ret;\n    }\n    long http_code = 0;\n    curl_easy_getinfo(curl, CURLINFO_RESPONSE_CODE, &http_code);\n    ret.code = static_cast<int>(http_code);\n\n    curl_easy_cleanup(curl);\n  }\n\n  return ret;\n}\n\n\/**\n * @brief write callback function for libcurl\n *\n * @param data returned data of size (size*nmemb)\n * @param size size parameter\n * @param nmemb memblock parameter\n * @param userdata pointer to user data to save\/work with return data\n *\n * @return (size * nmemb)\n *\/\nsize_t RestClient::write_callback(void *data, size_t size, size_t nmemb,\n                            void *userdata)\n{\n  RestClient::response* r;\n  r = reinterpret_cast<RestClient::response*>(userdata);\n  r->body.append(reinterpret_cast<char*>(data), size*nmemb);\n\n  return (size * nmemb);\n}\n\n\/**\n * @brief read callback function for libcurl\n *\n * @param pointer of max size (size*nmemb) to write data to\n * @param size size parameter\n * @param nmemb memblock parameter\n * @param userdata pointer to user data to read data from\n *\n * @return (size * nmemb)\n *\/\nsize_t RestClient::read_callback(void *data, size_t size, size_t nmemb,\n                            void *userdata)\n{\n  \/** get upload struct *\/\n  RestClient::upload_object* u;\n  u = reinterpret_cast<RestClient::upload_object*>(userdata);\n  \/** set correct sizes *\/\n  size_t curl_size = size * nmemb;\n  size_t copy_size = (u->length < curl_size) ? u->length : curl_size;\n  \/** copy data to buffer *\/\n  memcpy(data, u->data, copy_size);\n  \/** decrement length and increment data pointer *\/\n  u->length -= copy_size;\n  u->data += copy_size;\n  \/** return copied size *\/\n  return copy_size;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"PathTask.hpp\"\n#include \"Robosub\/HighLevelControl.h\"\n#include \"std_msgs\/StringMultiArray.h\"\n\n\/**\n * @brief The constructor. Subscribes to all needed topics and sets up callbacks\n *\/\nPathTask::PathTask()\n : m_nodeHandle(),\n   m_pathSubscriber(),\n   m_taskStateSubscriber(),\n   m_highLevelMotorPublisher(),\n   m_taskCompletePublisher(),\n   m_isEnabled(false),\n   m_mode(0)\n{\n   m_pathSubscriber = m_nodeHandle.subscribe(\"img_rec\/paths\", 10, &PathTask::pathCallback, this);\n   m_taskStateSubscriber = m_nodeHandle.subscribe(\"Module_Enable\", 10, &PathTask::moduleEnableCallback, this);\n   m_highLevelMotorPublisher = m_nodeHandle.advertise<Robosub::HighLevelControl>(\"High_Level_Motor_Control\", 10);\n   m_taskCompletePublisher = m_nodeHandle.advertise<std_msgs::String>(\"Task_Completion\", 10);\n}\n\n\/**\n * @brief The destructor\n *\/\nPathTask::~PathTask()\n{\n\n}\n\n\/**\n * @brief The module enable message callback\n *\n * @param msg The module enabled message\n *\/\nvoid PathTask::moduleEnableCallback(const Robosub::ModuleEnableMsg& msg)\n{\n\tif (msg.Module == \"PathTask\")\n\t{\n\t\tif (msg.State == true)\n\t\t{\n\t\t\tprintf(\"PathTask: enabled\\n\");\n\t\t\tm_isEnabled = true;\n\t\t\tm_mode = 0;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tprintf(\"PathTask: Disabled\\n\");\n\t\t\tm_isEnabled = false;\n\t\t}\n\t}\n}\n\n\/**\n * @brief The path callback\n *\n * @param msg The image recognition object message\n *\/\nvoid PathTask::pathCallback(const SubImageRecognition::ImgRecObject& msg)\n{\n\tif (m_isEnabled)\n\t{\n\t  \/\/first get centered, then rotate, then recenter if needed\n\t  float moveX = msg.center_x - 320;\n\t  float moveY = msg.center_y - 240;\n    float turn = msg.rotation;\n\n    if (m_mode == 0)\n    {\n      if (moveX <= 330 && moveX >= 310 && moveY <= 250 && moveY >= 230)\n      {\n        \/\/we have arrived, lets spin\n        if (turn <= 1 && turn >= -1)\n        {\n          \/\/signal complete\n          reportSuccess(true);\n        }\n        else\n        {\n          m_mode = 1;\n        }\n      }\n      else if (moveX > 330 || moveX < 310)\n      {\n        printf(\"Correcting straf by: %f\\n\", moveX);\n        publishMotor(\"Straf\", \"Manual\", moveX);\n      }\n      else if (moveY > 250 || moveY < 230)\n      {\n        printf(\"Correcting forward by: %f\\n\", moveY);\n        publishMotor(\"Forward\", \"Manual\", moveY);\n      }\n    }\n\n    if (m_mode == 1)\n    {\n      if (turn <= 1 && turn >= -1)\n      {\n        m_mode = 0;\n      }\n      else\n      {\n        printf(\"Correcting turn by: %f\\n\", turn);\n        publishMotor(\"Turn\", \"Manual\", turn);\n      }\n    }\n\t}\n}\n\nvoid PathTask::reportSuccess(bool success)\n{\n\tstd_msgs::StringMultiArray msg;\n\n\tmsg.data.push_back(\"PathTask\");\n\tif (success)\n\t{\n\t\tmsg.data.push_back(\"Success\");\n\t}\n\telse\n\t{\n\t  msg.data.push_back(\"Failure\");\n\t}\n\tm_taskCompletePublisher.publish(msg);\n}\n\nvoid PathTask::publishMotor(std::string direction, std::string motion, float value)\n{\n  Robosub::HighLevelControl msg;\n  msg.Direction = direction\";\n  msg.MotionType = motion;\n  msg.Value = value;\n\n  m_highLevelMotorPublisher.publish(msg);\n}\n<commit_msg>removed random char<commit_after>#include \"PathTask.hpp\"\n#include \"Robosub\/HighLevelControl.h\"\n#include \"std_msgs\/StringMultiArray.h\"\n\n\/**\n * @brief The constructor. Subscribes to all needed topics and sets up callbacks\n *\/\nPathTask::PathTask()\n : m_nodeHandle(),\n   m_pathSubscriber(),\n   m_taskStateSubscriber(),\n   m_highLevelMotorPublisher(),\n   m_taskCompletePublisher(),\n   m_isEnabled(false),\n   m_mode(0)\n{\n   m_pathSubscriber = m_nodeHandle.subscribe(\"img_rec\/paths\", 10, &PathTask::pathCallback, this);\n   m_taskStateSubscriber = m_nodeHandle.subscribe(\"Module_Enable\", 10, &PathTask::moduleEnableCallback, this);\n   m_highLevelMotorPublisher = m_nodeHandle.advertise<Robosub::HighLevelControl>(\"High_Level_Motor_Control\", 10);\n   m_taskCompletePublisher = m_nodeHandle.advertise<std_msgs::String>(\"Task_Completion\", 10);\n}\n\n\/**\n * @brief The destructor\n *\/\nPathTask::~PathTask()\n{\n\n}\n\n\/**\n * @brief The module enable message callback\n *\n * @param msg The module enabled message\n *\/\nvoid PathTask::moduleEnableCallback(const Robosub::ModuleEnableMsg& msg)\n{\n\tif (msg.Module == \"PathTask\")\n\t{\n\t\tif (msg.State == true)\n\t\t{\n\t\t\tprintf(\"PathTask: enabled\\n\");\n\t\t\tm_isEnabled = true;\n\t\t\tm_mode = 0;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tprintf(\"PathTask: Disabled\\n\");\n\t\t\tm_isEnabled = false;\n\t\t}\n\t}\n}\n\n\/**\n * @brief The path callback\n *\n * @param msg The image recognition object message\n *\/\nvoid PathTask::pathCallback(const SubImageRecognition::ImgRecObject& msg)\n{\n\tif (m_isEnabled)\n\t{\n\t  \/\/first get centered, then rotate, then recenter if needed\n\t  float moveX = msg.center_x - 320;\n\t  float moveY = msg.center_y - 240;\n    float turn = msg.rotation;\n\n    if (m_mode == 0)\n    {\n      if (moveX <= 330 && moveX >= 310 && moveY <= 250 && moveY >= 230)\n      {\n        \/\/we have arrived, lets spin\n        if (turn <= 1 && turn >= -1)\n        {\n          \/\/signal complete\n          reportSuccess(true);\n        }\n        else\n        {\n          m_mode = 1;\n        }\n      }\n      else if (moveX > 330 || moveX < 310)\n      {\n        printf(\"Correcting straf by: %f\\n\", moveX);\n        publishMotor(\"Straf\", \"Manual\", moveX);\n      }\n      else if (moveY > 250 || moveY < 230)\n      {\n        printf(\"Correcting forward by: %f\\n\", moveY);\n        publishMotor(\"Forward\", \"Manual\", moveY);\n      }\n    }\n\n    if (m_mode == 1)\n    {\n      if (turn <= 1 && turn >= -1)\n      {\n        m_mode = 0;\n      }\n      else\n      {\n        printf(\"Correcting turn by: %f\\n\", turn);\n        publishMotor(\"Turn\", \"Manual\", turn);\n      }\n    }\n\t}\n}\n\nvoid PathTask::reportSuccess(bool success)\n{\n\tstd_msgs::StringMultiArray msg;\n\n\tmsg.data.push_back(\"PathTask\");\n\tif (success)\n\t{\n\t\tmsg.data.push_back(\"Success\");\n\t}\n\telse\n\t{\n\t  msg.data.push_back(\"Failure\");\n\t}\n\tm_taskCompletePublisher.publish(msg);\n}\n\nvoid PathTask::publishMotor(std::string direction, std::string motion, float value)\n{\n  Robosub::HighLevelControl msg;\n  msg.Direction = direction;\n  msg.MotionType = motion;\n  msg.Value = value;\n\n  m_highLevelMotorPublisher.publish(msg);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <sys\/types.h>\n#include <sys\/xattr.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n#include <dirent.h>\n\n#include <sstream>\n#include <algorithm>\n\n#include \"..\/fs\/rm.hh\"\n#include \"..\/json\/encoder.hh\"\n#include \"..\/stream\/buffered-stream.hh\"\n#include \"..\/stream\/copy.hh\"\n#include \"..\/stream\/direct-fd-stream.hh\"\n#include \"..\/string-ref.hh\"\n#include \"..\/uri\/normalize-path.hh\"\n#include \"error-handler.hh\"\n#include \"fs-handler.hh\"\n#include \"log.hh\"\n#include \"mime-db.hh\"\n\nnamespace mimosa\n{\n  namespace http\n  {\n    FsHandler::FsHandler(const std::string & root, int nskip)\n      : root_(root),\n        nskip_(nskip),\n        can_readdir_(false),\n        can_head_(true),\n        can_get_(true),\n        can_put_(false),\n        can_delete_(false),\n        can_mkcol_(false),\n        use_xattr_(false),\n        can_symlink_(false),\n        can_move_(false)\n    {\n    }\n\n    std::string\n    FsHandler::checkPath(RequestReader & request) const\n    {\n      return checkPath(request.location());\n    }\n\n    std::string\n    FsHandler::checkPath(const std::string & location) const\n    {\n      StringRef path(location);\n      for (auto nskip = nskip_; nskip > 0; --nskip)\n      {\n        auto pos = path.find('\/', 1);\n        if (pos == StringRef::npos)\n        {\n          if (nskip == 1 && path.size() > 1) \/\/ our location is root and is not terminated by '\/'\n          {\n            path = StringRef(\"\/\");\n            break;\n          }\n          else\n            return \"\";\n        }\n        path = path.substr(pos);\n      }\n\n      \/\/ TODO: check every component for symlinks going out of root.\n\n      std::string real_path(root_);\n      real_path.append(path.data(), path.size());\n      return real_path;\n    }\n\n    bool\n    FsHandler::head(RequestReader & request, ResponseWriter & response) const\n    {\n      if (!can_head_)\n        return ErrorHandler::basicResponse(request, response, kStatusForbidden);\n\n      std::string real_path = checkPath(request);\n      if (real_path.empty()) {\n        return ErrorHandler::basicResponse(request, response, kStatusInternalServerError);\n      }\n\n      struct stat st;\n      if (::stat(real_path.c_str(), &st))\n        return ErrorHandler::basicResponse(request, response, kStatusNotFound);\n      return true;\n    }\n\n    bool\n    FsHandler::get(RequestReader & request, ResponseWriter & response) const\n    {\n      if (!can_get_)\n        return ErrorHandler::basicResponse(request, response, kStatusForbidden);\n\n      std::string real_path = checkPath(request);\n      if (real_path.empty()) {\n        return ErrorHandler::basicResponse(request, response, kStatusInternalServerError);\n      }\n\n      struct stat st;\n      if (::stat(real_path.c_str(), &st))\n        return ErrorHandler::basicResponse(request, response, kStatusNotFound);\n\n      if (S_ISREG(st.st_mode)) {\n        if (use_xattr_) {\n          char xattr_buffer[128];\n          getxattr(real_path.c_str(), \"user.Content-Type\", xattr_buffer, sizeof (xattr_buffer));\n          xattr_buffer[sizeof (xattr_buffer) - 1] = '\\0';\n          response.setContentType(xattr_buffer);\n        }\n        return streamFile(request, response, real_path, st);\n      } else if (S_ISDIR(st.st_mode) && can_readdir_)\n        return readDir(request, response, real_path);\n      return ErrorHandler::basicResponse(request, response, kStatusForbidden);\n    }\n\n    bool\n    FsHandler::put(RequestReader & request, ResponseWriter & response) const\n    {\n      if (!can_put_)\n        return ErrorHandler::basicResponse(request, response, kStatusForbidden);\n\n      std::string real_path = checkPath(request);\n      if (real_path.empty()) {\n        return ErrorHandler::basicResponse(request, response, kStatusInternalServerError);\n      }\n\n      stream::DirectFdStream out;\n      if (!out.open(real_path.c_str(), O_CREAT | O_TRUNC | O_WRONLY, 0666))\n        return ErrorHandler::basicResponse(request, response, kStatusInternalServerError);\n\n      if (stream::copy(request, out) < 0)\n        return ErrorHandler::basicResponse(request, response, kStatusInternalServerError);\n\n      if (use_xattr_)\n        setxattr(real_path.c_str(), \"user.Content-Type\", request.contentType().c_str(),\n                 request.contentType().size() + 1, 0);\n      return true;\n    }\n\n    bool\n    FsHandler::del(RequestReader & request, ResponseWriter & response) const\n    {\n      if (!can_delete_)\n        return ErrorHandler::basicResponse(request, response, kStatusForbidden);\n\n      std::string real_path = checkPath(request);\n      if (real_path.empty()) {\n        return ErrorHandler::basicResponse(request, response, kStatusInternalServerError);\n      }\n\n      if (!fs::rm(real_path, false, false)) {\n        if (errno == ENOENT)\n          return ErrorHandler::basicResponse(request, response, kStatusNotFound);\n        if (errno == EISDIR)\n          return ErrorHandler::basicResponse(request, response, kStatusBadRequest);\n        if (errno == EPERM || errno == EACCES)\n          return ErrorHandler::basicResponse(request, response, kStatusForbidden);\n        return ErrorHandler::basicResponse(request, response, kStatusInternalServerError);\n      }\n      return true;\n    }\n\n    bool\n    FsHandler::mkcol(RequestReader & request,\n                     ResponseWriter & response) const\n    {\n      if (!can_mkcol_)\n        return ErrorHandler::basicResponse(request, response, kStatusForbidden);\n\n      std::string real_path = checkPath(request);\n      if (real_path.empty()) {\n        return ErrorHandler::basicResponse(request, response, kStatusInternalServerError);\n      }\n\n      if (mkdir(real_path.c_str(), 0777)) {\n        if (errno == EPERM || errno == EACCES)\n          return ErrorHandler::basicResponse(request, response, kStatusForbidden);\n        if (errno == EEXIST)\n          return ErrorHandler::basicResponse(request, response, kStatusConflict);\n        if (errno == ENOSPC)\n          return ErrorHandler::basicResponse(request, response, kStatusInsufficientStorage);\n        return ErrorHandler::basicResponse(request, response, kStatusInternalServerError);\n      }\n      return true;\n    }\n\n    bool\n    FsHandler::move(RequestReader & request,\n                    ResponseWriter & response) const\n    {\n      if (!can_move_)\n        return ErrorHandler::basicResponse(request, response, kStatusForbidden);\n\n      std::string source_real_path = checkPath(request);\n      std::string destination;\n      uri::normalizePath(request.destination().c_str(), request.destination().size(),\n                         &destination);\n      std::string destination_real_path = checkPath(destination);\n      if (source_real_path.empty() || destination_real_path.empty()) {\n        return ErrorHandler::basicResponse(request, response, kStatusBadRequest);\n      }\n\n      if (::rename(source_real_path.c_str(), destination_real_path.c_str())) {\n        if (errno == EPERM || errno == EACCES)\n          return ErrorHandler::basicResponse(request, response, kStatusForbidden);\n        if (errno == EEXIST)\n          return ErrorHandler::basicResponse(request, response, kStatusConflict);\n        if (errno == ENOSPC)\n          return ErrorHandler::basicResponse(request, response, kStatusInsufficientStorage);\n        return ErrorHandler::basicResponse(request, response, kStatusInternalServerError);\n      }\n      return true;\n    }\n\n    bool\n    FsHandler::streamFile(RequestReader &     request,\n                          ResponseWriter &    response,\n                          const std::string & real_path)\n    {\n      struct stat st;\n\n      if (stat(real_path.c_str(), &st))\n        return false;\n      return streamFile(request, response, real_path, st);\n    }\n\n    bool\n    FsHandler::streamFile(RequestReader &     request,\n                          ResponseWriter &    response,\n                          const std::string & real_path,\n                          struct stat &       st)\n    {\n      if (request.hasIfModifiedSince() && request.ifModifiedSince() >= st.st_mtime)\n      {\n        response.setContentLength(0);\n        response.setStatus(kStatusNotModified);\n        response.sendHeader();\n        return true;\n      }\n\n      int fd = ::open(real_path.c_str(), O_RDONLY, 0644);\n      if (fd < 0)\n        return ErrorHandler::basicResponse(request, response, kStatusInternalServerError);\n\n      int64_t length = st.st_size;\n\n      \/\/ to use sendfile and support content-range, we need identity\n      response.setContentEncoding(kCodingIdentity);\n      response.setContentLength(st.st_size);\n\n      \/\/ content-range support\n      if (request.hasRange()) {\n        ByteRange range = request.range().front();\n\n        switch (range.type_) {\n        case ByteRange::kStart:\n          range.end_ = st.st_size;\n          break;\n        case ByteRange::kRange:\n          range.end_++;\n          break;\n        case ByteRange::kSuffix:\n          range.start_ = st.st_size - range.end_;\n          range.end_   = st.st_size;\n          break;\n        }\n\n        if (range.end_ <= range.start_ ||\n            range.end_ > st.st_size ||\n            range.start_ < 0) {\n          ::close(fd);\n          return ErrorHandler::basicResponse(request, response, kStatusRequestedRangeNotSatisfiable);\n        }\n\n        if (range.start_ > 0)\n          if (::lseek64(fd, request.contentRangeStart(), SEEK_SET) != range.start_) {\n            ::close(fd);\n            return ErrorHandler::basicResponse(request, response, kStatusInternalServerError);\n          }\n\n        length = range.end_ - range.start_;\n        response.setStatus(kStatusPartialContent);\n        response.setContentRange(range.start_, range.end_, st.st_size);\n      }\n\n      \/\/ guess content-type\n      if (response.contentType().empty())\n        response.setContentType(MimeDb::instance().mimeType(real_path));\n      response.setLastModified(st.st_mtime);\n      response.sendHeader();\n\n      stream::DirectFdStream file(fd);\n      stream::DirectFdStream *sock = response.directFdStream();\n\n      int64_t ret;\n      if (sock)\n        ret = stream::copy(file, *sock, length);\n      else\n        ret = stream::copy(file, response, length);\n      return ret == st.st_size;\n    }\n\n    bool\n    FsHandler::readDir(RequestReader &     request,\n                       ResponseWriter &    response,\n                       const std::string & real_path) const\n    {\n      auto & format = request.queryGet(\"format\");\n\n      if (format == \"json\")\n        return readDirJson(request, response, real_path);\n      return readDirHtml(request, response, real_path);\n    }\n\n    bool\n    FsHandler::readDirHtml(RequestReader &     request,\n                           ResponseWriter &    response,\n                           const std::string & real_path) const\n    {\n      DIR * dir = ::opendir(real_path.c_str());\n      if (!dir)\n        return ErrorHandler::basicResponse(request, response, kStatusNotFound);\n\n      response.setContentType(\"text\/html\");\n      response.sendHeader();\n      assert(response.transferEncoding() == kCodingChunked);\n\n      std::ostringstream os;\n\n      os << \"<!DOCTYPE html><html><head>\"\n        \"<meta http-equiv=\\\"Content-Type\\\" content=\\\"text\/html; charset=utf-8\\\"\/>\"\n        \"<title>\" << request.location() << \"<\/title><\/head>\"\n        \"<body><h1>Directory listing: \" << request.location() << \"<\/h1><hr\/>\";\n\n      std::vector<std::string> directories;\n      std::vector<std::string> files;\n\n      struct dirent * entry;\n      while ((entry = ::readdir(dir)))\n      {\n        std::ostringstream tmp;\n        tmp << real_path << '\/' << entry->d_name;\n\n        std::string file_path(tmp.str());\n\n        struct ::stat st;\n        if (::stat(file_path.c_str(), &st))\n          continue;\n\n        if (S_ISDIR(st.st_mode))\n          directories.push_back(entry->d_name);\n        else\n          files.push_back(entry->d_name);\n      }\n\n      std::sort(directories.begin(), directories.end());\n      std::sort(files.begin(), files.end());\n\n      for (auto it = directories.begin(); it != directories.end(); ++it)\n        os << \"<a href=\\\"\" << *it << \"\/\\\">\" << *it << \"\/<\/a><br\/>\";\n\n      for (auto it = files.begin(); it != files.end(); ++it)\n        os << \"<a href=\\\"\" << *it << \"\\\">\" << *it << \"<\/a><br\/>\";\n\n      os << \"<\/body><\/html>\";\n\n      ::closedir(dir);\n      std::string data(os.str());\n      response.write(data.data(), data.size());\n      return true;\n    }\n\n    bool\n    FsHandler::readDirJson(RequestReader &     request,\n                           ResponseWriter &    response,\n                           const std::string & real_path) const\n    {\n      DIR * dir = ::opendir(real_path.c_str());\n      if (!dir)\n        return ErrorHandler::basicResponse(request, response, kStatusNotFound);\n\n      response.setContentType(\"application\/json\");\n      response.sendHeader();\n\n      stream::Stream::Ptr buf(new stream::BufferedStream(&response));\n      json::Encoder enc(buf);\n\n      enc.startArray();\n      struct dirent * entry;\n      while ((entry = ::readdir(dir)))\n      {\n        std::ostringstream tmp;\n        tmp << real_path << '\/' << entry->d_name;\n\n        std::string file_path(tmp.str());\n        struct ::stat st;\n        if (::stat(file_path.c_str(), &st))\n          continue;\n\n        enc.startObject();\n\n        enc.pushString(\"name\");\n        enc.pushString(entry->d_name);\n\n        enc.pushString(\"size\");\n        enc.pushNumber(st.st_size);\n\n        enc.pushString(\"type\");\n        if (S_ISDIR(st.st_mode))\n          enc.pushString(\"dir\");\n        else if (S_ISREG(st.st_mode))\n          enc.pushString(\"reg\");\n        else if (S_ISLNK(st.st_mode))\n          enc.pushString(\"lnk\");\n        else if (S_ISSOCK(st.st_mode))\n          enc.pushString(\"sock\");\n        else if (S_ISFIFO(st.st_mode))\n          enc.pushString(\"fifo\");\n        else if (S_ISCHR(st.st_mode))\n          enc.pushString(\"chr\");\n        else if (S_ISBLK(st.st_mode))\n          enc.pushString(\"blk\");\n        else\n          enc.pushString(\"???\");\n\n        enc.endObject();\n      }\n      enc.endArray();\n      ::closedir(dir);\n      return true;\n    }\n  }\n}\n<commit_msg>Fix the HEAD request<commit_after>#include <sys\/types.h>\n#include <sys\/xattr.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n#include <dirent.h>\n\n#include <sstream>\n#include <algorithm>\n\n#include \"..\/fs\/rm.hh\"\n#include \"..\/json\/encoder.hh\"\n#include \"..\/stream\/buffered-stream.hh\"\n#include \"..\/stream\/copy.hh\"\n#include \"..\/stream\/direct-fd-stream.hh\"\n#include \"..\/string-ref.hh\"\n#include \"..\/uri\/normalize-path.hh\"\n#include \"error-handler.hh\"\n#include \"fs-handler.hh\"\n#include \"log.hh\"\n#include \"mime-db.hh\"\n\nnamespace mimosa\n{\n  namespace http\n  {\n    FsHandler::FsHandler(const std::string & root, int nskip)\n      : root_(root),\n        nskip_(nskip),\n        can_readdir_(false),\n        can_head_(true),\n        can_get_(true),\n        can_put_(false),\n        can_delete_(false),\n        can_mkcol_(false),\n        use_xattr_(false),\n        can_symlink_(false),\n        can_move_(false)\n    {\n    }\n\n    std::string\n    FsHandler::checkPath(RequestReader & request) const\n    {\n      return checkPath(request.location());\n    }\n\n    std::string\n    FsHandler::checkPath(const std::string & location) const\n    {\n      StringRef path(location);\n      for (auto nskip = nskip_; nskip > 0; --nskip)\n      {\n        auto pos = path.find('\/', 1);\n        if (pos == StringRef::npos)\n        {\n          if (nskip == 1 && path.size() > 1) \/\/ our location is root and is not terminated by '\/'\n          {\n            path = StringRef(\"\/\");\n            break;\n          }\n          else\n            return \"\";\n        }\n        path = path.substr(pos);\n      }\n\n      \/\/ TODO: check every component for symlinks going out of root.\n\n      std::string real_path(root_);\n      real_path.append(path.data(), path.size());\n      return real_path;\n    }\n\n    bool\n    FsHandler::head(RequestReader & request, ResponseWriter & response) const\n    {\n      if (!can_head_)\n        return ErrorHandler::basicResponse(request, response, kStatusForbidden);\n\n      std::string real_path = checkPath(request);\n      if (real_path.empty()) {\n        return ErrorHandler::basicResponse(request, response, kStatusInternalServerError);\n      }\n\n      struct stat st;\n      if (::stat(real_path.c_str(), &st))\n        return ErrorHandler::basicResponse(request, response, kStatusNotFound);\n      response.setContentLength(st.st_size);\n      response.setContentType(MimeDb::instance().mimeType(real_path));\n      return true;\n    }\n\n    bool\n    FsHandler::get(RequestReader & request, ResponseWriter & response) const\n    {\n      if (!can_get_)\n        return ErrorHandler::basicResponse(request, response, kStatusForbidden);\n\n      std::string real_path = checkPath(request);\n      if (real_path.empty()) {\n        return ErrorHandler::basicResponse(request, response, kStatusInternalServerError);\n      }\n\n      struct stat st;\n      if (::stat(real_path.c_str(), &st))\n        return ErrorHandler::basicResponse(request, response, kStatusNotFound);\n\n      if (S_ISREG(st.st_mode)) {\n        if (use_xattr_) {\n          char xattr_buffer[128];\n          getxattr(real_path.c_str(), \"user.Content-Type\", xattr_buffer, sizeof (xattr_buffer));\n          xattr_buffer[sizeof (xattr_buffer) - 1] = '\\0';\n          response.setContentType(xattr_buffer);\n        }\n        return streamFile(request, response, real_path, st);\n      } else if (S_ISDIR(st.st_mode) && can_readdir_)\n        return readDir(request, response, real_path);\n      return ErrorHandler::basicResponse(request, response, kStatusForbidden);\n    }\n\n    bool\n    FsHandler::put(RequestReader & request, ResponseWriter & response) const\n    {\n      if (!can_put_)\n        return ErrorHandler::basicResponse(request, response, kStatusForbidden);\n\n      std::string real_path = checkPath(request);\n      if (real_path.empty()) {\n        return ErrorHandler::basicResponse(request, response, kStatusInternalServerError);\n      }\n\n      stream::DirectFdStream out;\n      if (!out.open(real_path.c_str(), O_CREAT | O_TRUNC | O_WRONLY, 0666))\n        return ErrorHandler::basicResponse(request, response, kStatusInternalServerError);\n\n      if (stream::copy(request, out) < 0)\n        return ErrorHandler::basicResponse(request, response, kStatusInternalServerError);\n\n      if (use_xattr_)\n        setxattr(real_path.c_str(), \"user.Content-Type\", request.contentType().c_str(),\n                 request.contentType().size() + 1, 0);\n      return true;\n    }\n\n    bool\n    FsHandler::del(RequestReader & request, ResponseWriter & response) const\n    {\n      if (!can_delete_)\n        return ErrorHandler::basicResponse(request, response, kStatusForbidden);\n\n      std::string real_path = checkPath(request);\n      if (real_path.empty()) {\n        return ErrorHandler::basicResponse(request, response, kStatusInternalServerError);\n      }\n\n      if (!fs::rm(real_path, false, false)) {\n        if (errno == ENOENT)\n          return ErrorHandler::basicResponse(request, response, kStatusNotFound);\n        if (errno == EISDIR)\n          return ErrorHandler::basicResponse(request, response, kStatusBadRequest);\n        if (errno == EPERM || errno == EACCES)\n          return ErrorHandler::basicResponse(request, response, kStatusForbidden);\n        return ErrorHandler::basicResponse(request, response, kStatusInternalServerError);\n      }\n      return true;\n    }\n\n    bool\n    FsHandler::mkcol(RequestReader & request,\n                     ResponseWriter & response) const\n    {\n      if (!can_mkcol_)\n        return ErrorHandler::basicResponse(request, response, kStatusForbidden);\n\n      std::string real_path = checkPath(request);\n      if (real_path.empty()) {\n        return ErrorHandler::basicResponse(request, response, kStatusInternalServerError);\n      }\n\n      if (mkdir(real_path.c_str(), 0777)) {\n        if (errno == EPERM || errno == EACCES)\n          return ErrorHandler::basicResponse(request, response, kStatusForbidden);\n        if (errno == EEXIST)\n          return ErrorHandler::basicResponse(request, response, kStatusConflict);\n        if (errno == ENOSPC)\n          return ErrorHandler::basicResponse(request, response, kStatusInsufficientStorage);\n        return ErrorHandler::basicResponse(request, response, kStatusInternalServerError);\n      }\n      return true;\n    }\n\n    bool\n    FsHandler::move(RequestReader & request,\n                    ResponseWriter & response) const\n    {\n      if (!can_move_)\n        return ErrorHandler::basicResponse(request, response, kStatusForbidden);\n\n      std::string source_real_path = checkPath(request);\n      std::string destination;\n      uri::normalizePath(request.destination().c_str(), request.destination().size(),\n                         &destination);\n      std::string destination_real_path = checkPath(destination);\n      if (source_real_path.empty() || destination_real_path.empty()) {\n        return ErrorHandler::basicResponse(request, response, kStatusBadRequest);\n      }\n\n      if (::rename(source_real_path.c_str(), destination_real_path.c_str())) {\n        if (errno == EPERM || errno == EACCES)\n          return ErrorHandler::basicResponse(request, response, kStatusForbidden);\n        if (errno == EEXIST)\n          return ErrorHandler::basicResponse(request, response, kStatusConflict);\n        if (errno == ENOSPC)\n          return ErrorHandler::basicResponse(request, response, kStatusInsufficientStorage);\n        return ErrorHandler::basicResponse(request, response, kStatusInternalServerError);\n      }\n      return true;\n    }\n\n    bool\n    FsHandler::streamFile(RequestReader &     request,\n                          ResponseWriter &    response,\n                          const std::string & real_path)\n    {\n      struct stat st;\n\n      if (stat(real_path.c_str(), &st))\n        return false;\n      return streamFile(request, response, real_path, st);\n    }\n\n    bool\n    FsHandler::streamFile(RequestReader &     request,\n                          ResponseWriter &    response,\n                          const std::string & real_path,\n                          struct stat &       st)\n    {\n      if (request.hasIfModifiedSince() && request.ifModifiedSince() >= st.st_mtime)\n      {\n        response.setContentLength(0);\n        response.setStatus(kStatusNotModified);\n        response.sendHeader();\n        return true;\n      }\n\n      int fd = ::open(real_path.c_str(), O_RDONLY, 0644);\n      if (fd < 0)\n        return ErrorHandler::basicResponse(request, response, kStatusInternalServerError);\n\n      int64_t length = st.st_size;\n\n      \/\/ to use sendfile and support content-range, we need identity\n      response.setContentEncoding(kCodingIdentity);\n      response.setContentLength(st.st_size);\n\n      \/\/ content-range support\n      if (request.hasRange()) {\n        ByteRange range = request.range().front();\n\n        switch (range.type_) {\n        case ByteRange::kStart:\n          range.end_ = st.st_size;\n          break;\n        case ByteRange::kRange:\n          range.end_++;\n          break;\n        case ByteRange::kSuffix:\n          range.start_ = st.st_size - range.end_;\n          range.end_   = st.st_size;\n          break;\n        }\n\n        if (range.end_ <= range.start_ ||\n            range.end_ > st.st_size ||\n            range.start_ < 0) {\n          ::close(fd);\n          return ErrorHandler::basicResponse(request, response, kStatusRequestedRangeNotSatisfiable);\n        }\n\n        if (range.start_ > 0)\n          if (::lseek64(fd, request.contentRangeStart(), SEEK_SET) != range.start_) {\n            ::close(fd);\n            return ErrorHandler::basicResponse(request, response, kStatusInternalServerError);\n          }\n\n        length = range.end_ - range.start_;\n        response.setStatus(kStatusPartialContent);\n        response.setContentRange(range.start_, range.end_, st.st_size);\n      }\n\n      \/\/ guess content-type\n      if (response.contentType().empty())\n        response.setContentType(MimeDb::instance().mimeType(real_path));\n      response.setLastModified(st.st_mtime);\n      response.sendHeader();\n\n      stream::DirectFdStream file(fd);\n      stream::DirectFdStream *sock = response.directFdStream();\n\n      int64_t ret;\n      if (sock)\n        ret = stream::copy(file, *sock, length);\n      else\n        ret = stream::copy(file, response, length);\n      return ret == st.st_size;\n    }\n\n    bool\n    FsHandler::readDir(RequestReader &     request,\n                       ResponseWriter &    response,\n                       const std::string & real_path) const\n    {\n      auto & format = request.queryGet(\"format\");\n\n      if (format == \"json\")\n        return readDirJson(request, response, real_path);\n      return readDirHtml(request, response, real_path);\n    }\n\n    bool\n    FsHandler::readDirHtml(RequestReader &     request,\n                           ResponseWriter &    response,\n                           const std::string & real_path) const\n    {\n      DIR * dir = ::opendir(real_path.c_str());\n      if (!dir)\n        return ErrorHandler::basicResponse(request, response, kStatusNotFound);\n\n      response.setContentType(\"text\/html\");\n      response.sendHeader();\n      assert(response.transferEncoding() == kCodingChunked);\n\n      std::ostringstream os;\n\n      os << \"<!DOCTYPE html><html><head>\"\n        \"<meta http-equiv=\\\"Content-Type\\\" content=\\\"text\/html; charset=utf-8\\\"\/>\"\n        \"<title>\" << request.location() << \"<\/title><\/head>\"\n        \"<body><h1>Directory listing: \" << request.location() << \"<\/h1><hr\/>\";\n\n      std::vector<std::string> directories;\n      std::vector<std::string> files;\n\n      struct dirent * entry;\n      while ((entry = ::readdir(dir)))\n      {\n        std::ostringstream tmp;\n        tmp << real_path << '\/' << entry->d_name;\n\n        std::string file_path(tmp.str());\n\n        struct ::stat st;\n        if (::stat(file_path.c_str(), &st))\n          continue;\n\n        if (S_ISDIR(st.st_mode))\n          directories.push_back(entry->d_name);\n        else\n          files.push_back(entry->d_name);\n      }\n\n      std::sort(directories.begin(), directories.end());\n      std::sort(files.begin(), files.end());\n\n      for (auto it = directories.begin(); it != directories.end(); ++it)\n        os << \"<a href=\\\"\" << *it << \"\/\\\">\" << *it << \"\/<\/a><br\/>\";\n\n      for (auto it = files.begin(); it != files.end(); ++it)\n        os << \"<a href=\\\"\" << *it << \"\\\">\" << *it << \"<\/a><br\/>\";\n\n      os << \"<\/body><\/html>\";\n\n      ::closedir(dir);\n      std::string data(os.str());\n      response.write(data.data(), data.size());\n      return true;\n    }\n\n    bool\n    FsHandler::readDirJson(RequestReader &     request,\n                           ResponseWriter &    response,\n                           const std::string & real_path) const\n    {\n      DIR * dir = ::opendir(real_path.c_str());\n      if (!dir)\n        return ErrorHandler::basicResponse(request, response, kStatusNotFound);\n\n      response.setContentType(\"application\/json\");\n      response.sendHeader();\n\n      stream::Stream::Ptr buf(new stream::BufferedStream(&response));\n      json::Encoder enc(buf);\n\n      enc.startArray();\n      struct dirent * entry;\n      while ((entry = ::readdir(dir)))\n      {\n        std::ostringstream tmp;\n        tmp << real_path << '\/' << entry->d_name;\n\n        std::string file_path(tmp.str());\n        struct ::stat st;\n        if (::stat(file_path.c_str(), &st))\n          continue;\n\n        enc.startObject();\n\n        enc.pushString(\"name\");\n        enc.pushString(entry->d_name);\n\n        enc.pushString(\"size\");\n        enc.pushNumber(st.st_size);\n\n        enc.pushString(\"type\");\n        if (S_ISDIR(st.st_mode))\n          enc.pushString(\"dir\");\n        else if (S_ISREG(st.st_mode))\n          enc.pushString(\"reg\");\n        else if (S_ISLNK(st.st_mode))\n          enc.pushString(\"lnk\");\n        else if (S_ISSOCK(st.st_mode))\n          enc.pushString(\"sock\");\n        else if (S_ISFIFO(st.st_mode))\n          enc.pushString(\"fifo\");\n        else if (S_ISCHR(st.st_mode))\n          enc.pushString(\"chr\");\n        else if (S_ISBLK(st.st_mode))\n          enc.pushString(\"blk\");\n        else\n          enc.pushString(\"???\");\n\n        enc.endObject();\n      }\n      enc.endArray();\n      ::closedir(dir);\n      return true;\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ $Id$\n\/* --------------------------------------------------------------------------\nCppAD: C++ Algorithmic Differentiation: Copyright (C) 2003-13 Bradley M. Bell\n\nCppAD is distributed under multiple licenses. This distribution is under\nthe terms of the \n                    Eclipse Public License Version 1.0.\n\nA copy of this license is included in the COPYING file of this distribution.\nPlease visit http:\/\/www.coin-or.org\/CppAD\/ for information on other licenses.\n-------------------------------------------------------------------------- *\/\n\n\/*\n$begin atom_usead_2.cpp$$\n$spell\n\tcheckpoint\n\tvar\n$$\n\n$section Using AD to Compute Atomic Function Derivatives$$\n\n$index AD, inside atomic$$\n$index user, atomic AD inside$$\n$index atomic, AD inside$$\n$index checkpoint$$\n\n$head Warning$$\nThis example is currently under construction.\n\n$head Purpose$$\nConsider the case where an inner function is used repeatedly in the \ndefinition of an outer function.\nIn this case, it may reduce the number of variables\n$cref\/size_var\/seq_property\/size_var\/$$,\nand hence the required memory.\nThis is similar the \n$cref\/checkpoint\/checkpoint.cpp\/$$.\n\n$code\n$verbatim%example\/atom_usead_2.cpp%0%\/\/ BEGIN C++%\/\/ END C++%1%$$\n$$\n\n$end\n*\/\n\/\/ BEGIN C++\n# include <cppad\/cppad.hpp>\n\nnamespace { \/\/ Begin empty namespace \n\tusing CppAD::AD;\n\tusing CppAD::ADFun;\n\tusing CppAD::vector;\n\n\t\/\/ ----------------------------------------------------------------------\n\t\/\/ ODE for [t, t^2 \/ 2 ] in form required by Runge45\n\tclass Fun {\n\tpublic:\n\t\tvoid Ode(\n\t\t\tconst AD<double>           &t, \n\t\t\tconst vector< AD<double> > &z, \n\t\t\tvector< AD<double> >       &f)\n\t\t{\tassert( z.size() == 2 );\n\t\t\tassert( f.size() == 2 );\n\t\t\tf[0] =  1.0;\n\t\t\tf[1] =  z[0];\n\t\t}\n\t};\n\n\t\/\/ ----------------------------------------------------------------------\n\t\/\/ Create function that takes on Runge45 step for the ODE above\n\tADFun<double>* r_ptr_;\n\tvoid create_r(void)\n\t{\tsize_t n = 3, m = 2;\n\t\tvector< AD<double> > x(n), zi(m), y(m), e(m);\n\t\t\/\/ The value of x does not matter because the operation sequence\n\t\t\/\/ does not depend on x. \n\t\tx[0]  = 0.0;  \/\/ initial value z_0 (t) at t = ti\n\t\tx[1]  = 0.0;  \/\/ initial value z_1 (t) at t = ti\n\t\tx[2]  = 0.1;  \/\/ final time for this integration\n\t\tCppAD::Independent(x);\n\t\tzi[0]         = x[0];  \/\/ z_0 (t) at t = ti\n\t\tzi[1]         = x[1];  \/\/ z_1 (t) at t = ti\n\t\tAD<double> ti = 0.0;   \/\/ t does not appear in ODE so does not matter\n\t\tAD<double> tf = x[2];  \/\/ final time\n\t\tsize_t M      = 2;     \/\/ number of Runge45 steps to take\n\t\tFun F;\n\t\ty             = CppAD::Runge45(F, M, ti, tf, zi, e);\n\t\tr_ptr_        = new ADFun<double>(x, y);\n\t}\n\tvoid destroy_r(void)\n\t{\tdelete r_ptr_; \n\t\tr_ptr_ = CPPAD_NULL;\n\t}\n\n\t\/\/ ----------------------------------------------------------------------\n\t\/\/ forward mode routine called by CppAD\n\tbool atom_usead_2_forward(\n\t\tsize_t                   id ,\n\t\tsize_t                    k ,\n\t\tsize_t                    n ,\n\t\tsize_t                    m ,\n\t\tconst vector<bool>&      vx ,\n\t\tvector<bool>&            vy ,\n\t\tconst vector<double>&    tx ,\n\t\tvector<double>&          ty\n\t)\n\t{\tassert( id == 0 );\n\t\tassert( n == 3 );\n\t\tassert( m == 2 );\n\t\tassert( k == 0 || vx.size() == 0 );\n\t\tbool ok = true;\t\n\t\tvector<double> x_p(n), y_p(m);\n\t\tsize_t i, j;\n\n\t\t\/\/ check for special case\n\t\tif( vx.size() > 0 )\n\t\t{\tvy[0] = vx[0] | vx[1] | vx[2];\n\t\t\tvy[1] = vy[0];\n\t\t}\n\n\t\t\/\/ make sure r_ has proper lower order Taylor coefficients stored\n\t\t\/\/ then compute ty[k]\n\t\tfor(size_t p = 0; p <= k; p++)\n\t\t{\tfor(j = 0; j < n; j++)\n\t\t\t\tx_p[j] = tx[j * (k + 1) + p];\n\t\t\ty_p    = r_ptr_->Forward(p, x_p);\n\t\t\tif( p == k )\n\t\t\t{\tfor(i = 0; i < m; i++)\n\t\t\t\t\tty[i * (k + 1) + p] = y_p[i];\n\t\t\t}\n# ifndef NDEBUG\n\t\t\telse\n\t\t\t{\tfor(i = 0; i < m; i++)\n\t\t\t\t\tassert( ty[i * (k + 1) + p] == y_p[i] );\n\t\t\t}\n# endif\n\t\t}\n\t\treturn ok;\n\t}\n\t\/\/ ----------------------------------------------------------------------\n\t\/\/ reverse mode routine called by CppAD\n\tbool atom_usead_2_reverse(\n\t\tsize_t                   id ,\n\t\tsize_t                    k ,\n\t\tsize_t                    n ,\n\t\tsize_t                    m ,\n\t\tconst vector<double>&    tx ,\n\t\tconst vector<double>&    ty ,\n\t\tvector<double>&          px ,\n\t\tconst vector<double>&    py\n\t)\n\t{\tassert( id == 0 );\n\t\tassert( n == 3 );\n\t\tassert( m == 2 );\n\t\tbool ok = false;\t\n\t\treturn ok;\n\t}\n\t\/\/ ----------------------------------------------------------------------\n\t\/\/ forward Jacobian sparsity routine called by CppAD\n\tbool atom_usead_2_for_jac_sparse(\n\t\tsize_t                               id ,             \n\t\tsize_t                                n ,\n\t\tsize_t                                m ,\n\t\tsize_t                                q ,\n\t\tconst vector< std::set<size_t> >&     r ,\n\t\tvector< std::set<size_t> >&           s )\n\t{\tassert( id == 0 );\n\t\tassert( n == 3 );\n\t\tassert( m == 2 );\n\t\tbool ok = false;\n\t\treturn ok; \n\t}\n\t\/\/ ----------------------------------------------------------------------\n\t\/\/ reverse Jacobian sparsity routine called by CppAD\n\tbool atom_usead_2_rev_jac_sparse(\n\t\tsize_t                               id ,             \n\t\tsize_t                                n ,\n\t\tsize_t                                m ,\n\t\tsize_t                                q ,\n\t\tvector< std::set<size_t> >&           r ,\n\t\tconst vector< std::set<size_t> >&     s )\n\t{\n\t\tassert( id == 0 );\n\t\tassert( n == 3 );\n\t\tassert( m == 2 );\n\t\tbool ok = false;\n\t\treturn ok; \n\t}\n\t\/\/ ----------------------------------------------------------------------\n\t\/\/ reverse Hessian sparsity routine called by CppAD\n\tbool atom_usead_2_rev_hes_sparse(\n\t\tsize_t                               id ,             \n\t\tsize_t                                n ,\n\t\tsize_t                                m ,\n\t\tsize_t                                q ,\n\t\tconst vector< std::set<size_t> >&     r ,\n\t\tconst vector<bool>&                   s ,\n\t\tvector<bool>&                         t ,\n\t\tconst vector< std::set<size_t> >&     u ,\n\t\tvector< std::set<size_t> >&           v )\n\t{\t\/\/ Can just return false if not use RevSparseHes.\n\t\tassert( id == 0 );\n\t\tassert( n == 3 );\n\t\tassert( m == 2 );\n\t\tbool ok = false;\n\t\treturn ok;\n\t}\n\t\/\/ ---------------------------------------------------------------------\n\t\/\/ Declare the AD<double> routine atom_usead_2(id, ax, ay)\n\tCPPAD_USER_ATOMIC(\n\t\tatom_usead_2                 , \n\t\tCppAD::vector              ,\n\t\tdouble                     , \n\t\tatom_usead_2_forward         , \n\t\tatom_usead_2_reverse         ,\n\t\tatom_usead_2_for_jac_sparse  ,\n\t\tatom_usead_2_rev_jac_sparse  ,\n\t\tatom_usead_2_rev_hes_sparse  \n\t)\n} \/\/ End empty namespace\n\nbool atom_usead_2(void)\n{\tbool ok = true;\n\tusing CppAD::NearEqual;\n\tdouble eps = 10. * CppAD::numeric_limits<double>::epsilon();\n\n\t\/\/ --------------------------------------------------------------------\n\t\/\/ Create the ADFun<doulbe> r_\n\tcreate_r();\n\n\t\/\/ --------------------------------------------------------------------\n\t\/\/ Create approximate g(t) = [ t, t^2 \/ 2 ]\n\t\/\/\n\t\/\/ domain space vector\n\tvector< AD<double> > at(1), ax(3), ay(2);\n\tat[0]         = 1.0;        \/\/ t\n\tCppAD::Independent(at);\n\tsize_t M      = 3;          \/\/ number of r steps to take\n\tAD<double> dt = at[0] \/ M;  \/\/ size of each r step\n\tax[0]         = 0.0;        \/\/ value of z_0 (t) = t, at t = 0\n\tax[1]         = 0.0;        \/\/ value of z_1 (t) = t^2\/2, at t = 0\n\tax[2]         = dt;         \/\/ step size for each r step.\n\tfor(size_t i_step = 0; i_step < M; i_step++)\n\t{\tsize_t id = 0;               \/\/ not used\n\t\tatom_usead_2(id, ax, ay); \n\t\tax[0] = ay[0];\n\t\tax[1] = ay[1];\n\t}\n\n\t\/\/ create f: t -> g(t) and stop tape recording\n\tADFun<double> f(at, ay); \n\n\t\/\/ --------------------------------------------------------------------\n\t\/\/ Check forward mode results\n\t\/\/\n\t\/\/ function values\n\tvector<double> x_p(1), y_p(2);\n\tsize_t p = 0;\n\tdouble t = 0.75;\n\tx_p[0]   = t;\n\ty_p      = f.Forward(p, x_p);\n\tok &= NearEqual( y_p[0], t,  eps, eps);\n\tok &= NearEqual( y_p[1], t*t\/2.0,  eps, eps);\n\t\/\/\n\t\/\/ first derivative \n\tp = 1;\n\tx_p[0]   = 1.0;\n\ty_p      = f.Forward(p, x_p);\n\tok &= NearEqual( y_p[0], 1.0,  eps, eps);\n\tok &= NearEqual( y_p[1], t,  eps, eps);\n\t\/\/\n\t\/\/ second order taylor coefficient \n\tp = 2;\n\tx_p[0]   = 0.0;\n\ty_p      = f.Forward(p, x_p);\n\tok &= NearEqual( y_p[0], 0.0,  eps, eps);\n\tok &= NearEqual( y_p[1], 0.5,  eps, eps);\n\t\n\n\t\/\/ --------------------------------------------------------------------\n\tdestroy_r();\n\n\t\/\/ Free all temporary work space associated with user_atomic objects. \n\t\/\/ (If there are future calls to user atomic functions, they will \n\t\/\/ create new temporary work space.)\n\tCppAD::user_atomic<double>::clear();\n\n\treturn ok;\n}\n\/\/ END C++\n<commit_msg>Change example so n = 3 and m = 2 for atomic function.<commit_after>\/\/ $Id$\n\/* --------------------------------------------------------------------------\nCppAD: C++ Algorithmic Differentiation: Copyright (C) 2003-13 Bradley M. Bell\n\nCppAD is distributed under multiple licenses. This distribution is under\nthe terms of the \n                    Eclipse Public License Version 1.0.\n\nA copy of this license is included in the COPYING file of this distribution.\nPlease visit http:\/\/www.coin-or.org\/CppAD\/ for information on other licenses.\n-------------------------------------------------------------------------- *\/\n\n\/*\n$begin atom_usead_2.cpp$$\n$spell\n\tcheckpoint\n\tvar\n$$\n\n$section Using AD to Compute Atomic Function Derivatives$$\n\n$index AD, inside atomic$$\n$index user, atomic AD inside$$\n$index atomic, AD inside$$\n$index checkpoint$$\n\n$head Warning$$\nThis example is currently under construction.\n\n$head Purpose$$\nConsider the case where an inner function is used repeatedly in the \ndefinition of an outer function.\nIn this case, it may reduce the number of variables\n$cref\/size_var\/seq_property\/size_var\/$$,\nand hence the required memory.\nThis is similar the \n$cref\/checkpoint\/checkpoint.cpp\/$$.\n\n$code\n$verbatim%example\/atom_usead_2.cpp%0%\/\/ BEGIN C++%\/\/ END C++%1%$$\n$$\n\n$end\n*\/\n\/\/ BEGIN C++\n# include <cppad\/cppad.hpp>\n\nnamespace { \/\/ Begin empty namespace \n\tusing CppAD::AD;\n\tusing CppAD::ADFun;\n\tusing CppAD::vector;\n\n\t\/\/ ----------------------------------------------------------------------\n\t\/\/ ODE for [t, t^2 \/ 2 ] in form required by Runge45\n\tclass Fun {\n\tpublic:\n\t\tvoid Ode(\n\t\t\tconst AD<double>           &t, \n\t\t\tconst vector< AD<double> > &z, \n\t\t\tvector< AD<double> >       &f)\n\t\t{\tassert( z.size() == 2 );\n\t\t\tassert( f.size() == 2 );\n\t\t\tf[0] =  1.0;\n\t\t\tf[1] =  z[0];\n\t\t}\n\t};\n\n\t\/\/ ----------------------------------------------------------------------\n\t\/\/ Create function that takes on Runge45 step for the ODE above\n\tADFun<double>* r_ptr_;\n\tvoid create_r(void)\n\t{\tsize_t n = 3, m = 2;\n\t\tvector< AD<double> > x(n), zi(m), y(m), e(m);\n\t\t\/\/ The value of x does not matter because the operation sequence\n\t\t\/\/ does not depend on x. \n\t\tx[0]  = 0.0;  \/\/ initial value z_0 (t) at t = ti\n\t\tx[1]  = 0.0;  \/\/ initial value z_1 (t) at t = ti\n\t\tx[2]  = 0.1;  \/\/ final time for this integration\n\t\tCppAD::Independent(x);\n\t\tzi[0]         = x[0];  \/\/ z_0 (t) at t = ti\n\t\tzi[1]         = x[1];  \/\/ z_1 (t) at t = ti\n\t\tAD<double> ti = 0.0;   \/\/ t does not appear in ODE so does not matter\n\t\tAD<double> tf = x[2];  \/\/ final time\n\t\tsize_t M      = 2;     \/\/ number of Runge45 steps to take\n\t\tFun F;\n\t\ty             = CppAD::Runge45(F, M, ti, tf, zi, e);\n\t\tr_ptr_        = new ADFun<double>(x, y);\n\t}\n\tvoid destroy_r(void)\n\t{\tdelete r_ptr_; \n\t\tr_ptr_ = CPPAD_NULL;\n\t}\n\n\t\/\/ ----------------------------------------------------------------------\n\t\/\/ forward mode routine called by CppAD\n\tbool atom_usead_2_forward(\n\t\tsize_t                   id ,\n\t\tsize_t                    k ,\n\t\tsize_t                    n ,\n\t\tsize_t                    m ,\n\t\tconst vector<bool>&      vx ,\n\t\tvector<bool>&            vy ,\n\t\tconst vector<double>&    tx ,\n\t\tvector<double>&          ty\n\t)\n\t{\tassert( id == 0 );\n\t\tassert( n == 3 );\n\t\tassert( m == 2 );\n\t\tassert( k == 0 || vx.size() == 0 );\n\t\tbool ok = true;\t\n\t\tvector<double> x_p(n), y_p(m);\n\t\tsize_t i, j;\n\n\t\t\/\/ check for special case\n\t\tif( vx.size() > 0 )\n\t\t{\tvy[0] = vx[0] | vx[1] | vx[2];\n\t\t\tvy[1] = vy[0];\n\t\t}\n\n\t\t\/\/ make sure r_ has proper lower order Taylor coefficients stored\n\t\t\/\/ then compute ty[k]\n\t\tfor(size_t p = 0; p <= k; p++)\n\t\t{\tfor(j = 0; j < n; j++)\n\t\t\t\tx_p[j] = tx[j * (k + 1) + p];\n\t\t\ty_p    = r_ptr_->Forward(p, x_p);\n\t\t\tif( p == k )\n\t\t\t{\tfor(i = 0; i < m; i++)\n\t\t\t\t\tty[i * (k + 1) + p] = y_p[i];\n\t\t\t}\n# ifndef NDEBUG\n\t\t\telse\n\t\t\t{\tfor(i = 0; i < m; i++)\n\t\t\t\t\tassert( ty[i * (k + 1) + p] == y_p[i] );\n\t\t\t}\n# endif\n\t\t}\n\t\treturn ok;\n\t}\n\t\/\/ ----------------------------------------------------------------------\n\t\/\/ reverse mode routine called by CppAD\n\tbool atom_usead_2_reverse(\n\t\tsize_t                   id ,\n\t\tsize_t                    k ,\n\t\tsize_t                    n ,\n\t\tsize_t                    m ,\n\t\tconst vector<double>&    tx ,\n\t\tconst vector<double>&    ty ,\n\t\tvector<double>&          px ,\n\t\tconst vector<double>&    py\n\t)\n\t{\tassert( id == 0 );\n\t\tassert( n == 3 );\n\t\tassert( m == 2 );\n\t\tbool ok = false;\t\n\t\treturn ok;\n\t}\n\t\/\/ ----------------------------------------------------------------------\n\t\/\/ forward Jacobian sparsity routine called by CppAD\n\tbool atom_usead_2_for_jac_sparse(\n\t\tsize_t                               id ,             \n\t\tsize_t                                n ,\n\t\tsize_t                                m ,\n\t\tsize_t                                q ,\n\t\tconst vector< std::set<size_t> >&     r ,\n\t\tvector< std::set<size_t> >&           s )\n\t{\tassert( id == 0 );\n\t\tassert( n == 3 );\n\t\tassert( m == 2 );\n\t\tbool ok = false;\n\t\treturn ok; \n\t}\n\t\/\/ ----------------------------------------------------------------------\n\t\/\/ reverse Jacobian sparsity routine called by CppAD\n\tbool atom_usead_2_rev_jac_sparse(\n\t\tsize_t                               id ,             \n\t\tsize_t                                n ,\n\t\tsize_t                                m ,\n\t\tsize_t                                q ,\n\t\tvector< std::set<size_t> >&           r ,\n\t\tconst vector< std::set<size_t> >&     s )\n\t{\n\t\tassert( id == 0 );\n\t\tassert( n == 3 );\n\t\tassert( m == 2 );\n\t\tbool ok = false;\n\t\treturn ok; \n\t}\n\t\/\/ ----------------------------------------------------------------------\n\t\/\/ reverse Hessian sparsity routine called by CppAD\n\tbool atom_usead_2_rev_hes_sparse(\n\t\tsize_t                               id ,             \n\t\tsize_t                                n ,\n\t\tsize_t                                m ,\n\t\tsize_t                                q ,\n\t\tconst vector< std::set<size_t> >&     r ,\n\t\tconst vector<bool>&                   s ,\n\t\tvector<bool>&                         t ,\n\t\tconst vector< std::set<size_t> >&     u ,\n\t\tvector< std::set<size_t> >&           v )\n\t{\t\/\/ Can just return false if not use RevSparseHes.\n\t\tassert( id == 0 );\n\t\tassert( n == 3 );\n\t\tassert( m == 2 );\n\t\tbool ok = false;\n\t\treturn ok;\n\t}\n\t\/\/ ---------------------------------------------------------------------\n\t\/\/ Declare the AD<double> routine atom_usead_2(id, ax, ay)\n\tCPPAD_USER_ATOMIC(\n\t\tatom_usead_2                 , \n\t\tCppAD::vector              ,\n\t\tdouble                     , \n\t\tatom_usead_2_forward         , \n\t\tatom_usead_2_reverse         ,\n\t\tatom_usead_2_for_jac_sparse  ,\n\t\tatom_usead_2_rev_jac_sparse  ,\n\t\tatom_usead_2_rev_hes_sparse  \n\t)\n} \/\/ End empty namespace\n\nbool atom_usead_2(void)\n{\tbool ok = true;\n\tusing CppAD::NearEqual;\n\tdouble eps = 10. * CppAD::numeric_limits<double>::epsilon();\n\n\t\/\/ --------------------------------------------------------------------\n\t\/\/ Create the ADFun<doulbe> r_\n\tcreate_r();\n\n\t\/\/ --------------------------------------------------------------------\n\t\/\/ Create approximate g(t) = [ t, t^2 \/ 2 ]\n\t\/\/\n\t\/\/ domain space vector\n\tsize_t n = 3, m = 2;\n\tvector< AD<double> > au(n), ax(n), ay(m);\n\tau[0]         = 0.0;        \/\/ value of z_0 (t) = t, at t = 0\n\tax[1]         = 0.0;        \/\/ value of z_1 (t) = t^2\/2, at t = 0\n\tau[2]         = 1.0;        \/\/ final t\n\tCppAD::Independent(au);\n\tsize_t M      = 3;          \/\/ number of r steps to take\n\tax[0]         = au[0];      \/\/ value of z_0 (t) = t, at t = 0\n\tax[1]         = au[1];      \/\/ value of z_1 (t) = t^2\/2, at t = 0\n\tAD<double> dt = au[2] \/ M;  \/\/ size of each r step\n\tax[2]         = dt;\n\tfor(size_t i_step = 0; i_step < M; i_step++)\n\t{\tsize_t id = 0;               \/\/ not used\n\t\tatom_usead_2(id, ax, ay); \n\t\tax[0] = ay[0];\n\t\tax[1] = ay[1];\n\t}\n\n\t\/\/ create f: u -> y and stop tape recording\n\t\/\/ y_0(t) = u_0 + t\n\t\/\/ y_1(t) = u_1 + u_0 * t + t^2 \/ 2\n\t\/\/ where t = u_3\n\tADFun<double> f(au, ay); \n\n\t\/\/ --------------------------------------------------------------------\n\t\/\/ Check forward mode results\n\t\/\/\n\t\/\/ function values\n\tvector<double> up(n), yp(m);\n\tsize_t p  = 0;\n\tdouble t  = 0.75;\n\tdouble u0 = 0.5;\n\tdouble u1 = 0.25;\n\tdouble check;\n\tup[0]     = u0;\n\tup[1]     = u1;\n\tup[2]     = t;\n\typ        = f.Forward(p, up);\n\tcheck     = u0 + t;\n\tok &= NearEqual( yp[0], check,  eps, eps);\n\tcheck     = u1 + u0 * t + t * t \/ 2.0;\n\tok &= NearEqual( yp[1], check,  eps, eps);\n\t\/\/\n\t\/\/ forward mode first derivative w.r.t t\n\tp         = 1;\n\tup[0]     = 0.0;\n\tup[1]     = 0.0;\n\tup[2]     = 1.0;\n\typ        = f.Forward(p, up);\n\tcheck     = 1.0;\n\tok &= NearEqual( yp[0], check,  eps, eps);\n\tcheck     = u0 + t;\n\tok &= NearEqual( yp[1], check,  eps, eps);\n\t\/\/\n\t\/\/ forward mode second order Taylor coefficient w.r.t t\n\tp         = 2;\n\tup[0]     = 0.0;\n\tup[1]     = 0.0;\n\tup[2]     = 0.0;\n\typ        = f.Forward(p, up);\n\tcheck     = 0.0;\n\tok &= NearEqual( yp[0], check,  eps, eps);\n\tcheck     = 1.0 \/ 2.0;\n\tok &= NearEqual( yp[1], check,  eps, eps);\n\n\t\/\/ --------------------------------------------------------------------\n\tdestroy_r();\n\n\t\/\/ Free all temporary work space associated with user_atomic objects. \n\t\/\/ (If there are future calls to user atomic functions, they will \n\t\/\/ create new temporary work space.)\n\tCppAD::user_atomic<double>::clear();\n\n\treturn ok;\n}\n\/\/ END C++\n<|endoftext|>"}
{"text":"<commit_before>\/\/\r\n\/\/ Copyright (c) 2008-2016 the Urho3D project.\r\n\/\/\r\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\r\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\r\n\/\/ in the Software without restriction, including without limitation the rights\r\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\r\n\/\/ copies of the Software, and to permit persons to whom the Software is\r\n\/\/ furnished to do so, subject to the following conditions:\r\n\/\/\r\n\/\/ The above copyright notice and this permission notice shall be included in\r\n\/\/ all copies or substantial portions of the Software.\r\n\/\/\r\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\n\/\/ THE SOFTWARE.\r\n\/\/\r\n\r\n#include \"..\/Precompiled.h\"\r\n\r\n#include \"..\/Core\/Context.h\"\r\n#include \"..\/Graphics\/Material.h\"\r\n#include \"..\/Graphics\/Texture2D.h\"\r\n#include \"..\/Resource\/ResourceCache.h\"\r\n#include \"..\/Scene\/Scene.h\"\r\n#include \"..\/Urho2D\/Renderer2D.h\"\r\n#include \"..\/Urho2D\/Sprite2D.h\"\r\n#include \"..\/Urho2D\/StaticSprite2D.h\"\r\n\r\n#include \"..\/DebugNew.h\"\r\n#include \"..\/IO\/Log.h\"\r\n\r\nnamespace Urho3D\r\n{\r\n\r\nextern const char* URHO2D_CATEGORY;\r\nextern const char* blendModeNames[];\r\n\r\nStaticSprite2D::StaticSprite2D(Context* context) :\r\n    Drawable2D(context),\r\n    blendMode_(BLEND_ALPHA),\r\n    flipX_(false),\r\n    flipY_(false),\r\n    color_(Color::WHITE),\r\n    useHotSpot_(false),\r\n    useDrawRect_(false),\r\n    useTextureRect_(false),\r\n    hotSpot_(0.5f, 0.5f),\r\n    drawRect_(Rect::ZERO),\r\n    textureRect_(Rect::ZERO)\r\n{\r\n    sourceBatches_.Resize(1);\r\n    sourceBatches_[0].owner_ = this;\r\n}\r\n\r\nStaticSprite2D::~StaticSprite2D()\r\n{\r\n}\r\n\r\nvoid StaticSprite2D::RegisterObject(Context* context)\r\n{\r\n    context->RegisterFactory<StaticSprite2D>(URHO2D_CATEGORY);\r\n\r\n    URHO3D_ACCESSOR_ATTRIBUTE(\"Is Enabled\", IsEnabled, SetEnabled, bool, true, AM_DEFAULT);\r\n    URHO3D_COPY_BASE_ATTRIBUTES(Drawable2D);\r\n    URHO3D_MIXED_ACCESSOR_ATTRIBUTE(\"Sprite\", GetSpriteAttr, SetSpriteAttr, ResourceRef, ResourceRef(Sprite2D::GetTypeStatic()),\r\n        AM_DEFAULT);\r\n    URHO3D_ENUM_ACCESSOR_ATTRIBUTE(\"Blend Mode\", GetBlendMode, SetBlendMode, BlendMode, blendModeNames, BLEND_ALPHA, AM_DEFAULT);\r\n    URHO3D_ACCESSOR_ATTRIBUTE(\"Flip X\", GetFlipX, SetFlipX, bool, false, AM_DEFAULT);\r\n    URHO3D_ACCESSOR_ATTRIBUTE(\"Flip Y\", GetFlipY, SetFlipY, bool, false, AM_DEFAULT);\r\n    URHO3D_ACCESSOR_ATTRIBUTE(\"Color\", GetColor, SetColor, Color, Color::WHITE, AM_DEFAULT);\r\n    URHO3D_MIXED_ACCESSOR_ATTRIBUTE(\"Custom material\", GetCustomMaterialAttr, SetCustomMaterialAttr, ResourceRef,\r\n        ResourceRef(Material::GetTypeStatic()), AM_DEFAULT);\r\n    URHO3D_ACCESSOR_ATTRIBUTE(\"Hot Spot\", GetHotSpot, SetHotSpot, Vector2, Vector2(0.5f, 0.5f), AM_DEFAULT);\r\n    URHO3D_ACCESSOR_ATTRIBUTE(\"Use Hot Spot\", GetUseHotSpot, SetUseHotSpot, bool, false, AM_DEFAULT);\r\n    URHO3D_ACCESSOR_ATTRIBUTE(\"Draw Rectangle\", GetDrawRect, SetDrawRect, Rect, Rect::ZERO, AM_DEFAULT);\r\n    URHO3D_ACCESSOR_ATTRIBUTE(\"Use Draw Rectangle\", GetUseDrawRect, SetUseDrawRect, bool, false, AM_DEFAULT);\r\n    URHO3D_ACCESSOR_ATTRIBUTE(\"Texture Rectangle\", GetTextureRect, SetTextureRect, Rect, Rect::ZERO, AM_DEFAULT);\r\n    URHO3D_ACCESSOR_ATTRIBUTE(\"Use Texture Rectangle\", GetUseTextureRect, SetUseTextureRect, bool, false, AM_DEFAULT);\r\n}\r\n\r\nvoid StaticSprite2D::SetSprite(Sprite2D* sprite)\r\n{\r\n    if (!sprite)\r\n    {\r\n        URHO3D_LOGERROR(\"Can not set null sprite\");\r\n        return;\r\n    }\r\n\r\n    if (sprite == sprite_)\r\n        return;\r\n\r\n    sprite_ = sprite;\r\n    UpdateMaterial();\r\n\r\n    sourceBatchesDirty_ = true;\r\n    MarkNetworkUpdate();\r\n\r\n    UpdateDrawRect();\r\n}\r\n\r\nvoid StaticSprite2D::SetDrawRect(const Rect& rect)\r\n{\r\n    drawRect_ = rect;\r\n\r\n    if(useDrawRect_)\r\n    {\r\n        sourceBatchesDirty_ = true;\r\n    }\r\n}\r\n\r\nvoid StaticSprite2D::SetTextureRect(const Rect& rect)\r\n{\r\n    textureRect_ = rect;\r\n\r\n    if(useTextureRect_)\r\n    {\r\n        sourceBatchesDirty_ = true;\r\n    }\r\n}\r\n\r\nvoid StaticSprite2D::SetBlendMode(BlendMode blendMode)\r\n{\r\n    if (blendMode == blendMode_)\r\n        return;\r\n\r\n    blendMode_ = blendMode;\r\n\r\n    UpdateMaterial();\r\n    MarkNetworkUpdate();\r\n}\r\n\r\nvoid StaticSprite2D::SetFlip(bool flipX, bool flipY)\r\n{\r\n    if (flipX == flipX_ && flipY == flipY_)\r\n        return;\r\n\r\n    flipX_ = flipX;\r\n    flipY_ = flipY;\r\n    sourceBatchesDirty_ = true;\r\n\r\n    MarkNetworkUpdate();\r\n}\r\n\r\nvoid StaticSprite2D::SetFlipX(bool flipX)\r\n{\r\n    SetFlip(flipX, flipY_);\r\n}\r\n\r\nvoid StaticSprite2D::SetFlipY(bool flipY)\r\n{\r\n    SetFlip(flipX_, flipY);\r\n}\r\n\r\nvoid StaticSprite2D::SetColor(const Color& color)\r\n{\r\n    if (color == color_)\r\n        return;\r\n\r\n    color_ = color;\r\n    sourceBatchesDirty_ = true;\r\n    MarkNetworkUpdate();\r\n}\r\n\r\nvoid StaticSprite2D::SetAlpha(float alpha)\r\n{\r\n    if (alpha == color_.a_)\r\n        return;\r\n\r\n    color_.a_ = alpha;\r\n    sourceBatchesDirty_ = true;\r\n    MarkNetworkUpdate();\r\n}\r\n\r\nvoid StaticSprite2D::SetUseHotSpot(bool useHotSpot)\r\n{\r\n    if (useHotSpot == useHotSpot_)\r\n        return;\r\n\r\n    useHotSpot_ = useHotSpot;\r\n    sourceBatchesDirty_ = true;\r\n    MarkNetworkUpdate();\r\n    UpdateDrawRect();\r\n}\r\n\r\nvoid StaticSprite2D::SetUseDrawRect(bool useDrawRect)\r\n{\r\n    if (useDrawRect == useDrawRect_)\r\n        return;\r\n\r\n    useDrawRect_ = useDrawRect;\r\n    sourceBatchesDirty_ = true;\r\n    MarkNetworkUpdate();\r\n    UpdateDrawRect();\r\n}\r\n\r\nvoid StaticSprite2D::SetUseTextureRect(bool useTextureRect)\r\n{\r\n    if (useTextureRect == useTextureRect_)\r\n        return;\r\n\r\n    useTextureRect_ = useTextureRect;\r\n    sourceBatchesDirty_ = true;\r\n    MarkNetworkUpdate();\r\n}\r\n\r\nvoid StaticSprite2D::SetHotSpot(const Vector2& hotspot)\r\n{\r\n    if (hotspot == hotSpot_)\r\n        return;\r\n\r\n    hotSpot_ = hotspot;\r\n\r\n    if (useHotSpot_)\r\n    {\r\n        sourceBatchesDirty_ = true;\r\n        MarkNetworkUpdate();\r\n    }\r\n\r\n    UpdateDrawRect();\r\n}\r\n\r\nvoid StaticSprite2D::SetCustomMaterial(Material* customMaterial)\r\n{\r\n    if (customMaterial == customMaterial_)\r\n        return;\r\n\r\n    customMaterial_ = customMaterial;\r\n    sourceBatchesDirty_ = true;\r\n\r\n    UpdateMaterial();\r\n    MarkNetworkUpdate();\r\n}\r\n\r\nSprite2D* StaticSprite2D::GetSprite() const\r\n{\r\n    return sprite_;\r\n}\r\n\r\n\r\nMaterial* StaticSprite2D::GetCustomMaterial() const\r\n{\r\n    return customMaterial_;\r\n}\r\n\r\nvoid StaticSprite2D::SetSpriteAttr(const ResourceRef& value)\r\n{\r\n    Sprite2D* sprite = Sprite2D::LoadFromResourceRef(this, value);\r\n    if (sprite)\r\n        SetSprite(sprite);\r\n}\r\n\r\nResourceRef StaticSprite2D::GetSpriteAttr() const\r\n{\r\n    return Sprite2D::SaveToResourceRef(sprite_);\r\n}\r\n\r\nvoid StaticSprite2D::SetCustomMaterialAttr(const ResourceRef& value)\r\n{\r\n    ResourceCache* cache = GetSubsystem<ResourceCache>();\r\n    SetCustomMaterial(cache->GetResource<Material>(value.name_));\r\n}\r\n\r\nResourceRef StaticSprite2D::GetCustomMaterialAttr() const\r\n{\r\n    return GetResourceRef(customMaterial_, Material::GetTypeStatic());\r\n}\r\n\r\nvoid StaticSprite2D::OnWorldBoundingBoxUpdate()\r\n{\r\n    boundingBox_.Clear();\r\n    worldBoundingBox_.Clear();\r\n\r\n    const Vector<SourceBatch2D>& sourceBatches = GetSourceBatches();\r\n    for (unsigned i = 0; i < sourceBatches[0].vertices_.Size(); ++i)\r\n        worldBoundingBox_.Merge(sourceBatches[0].vertices_[i].position_);\r\n\r\n    boundingBox_ = worldBoundingBox_.Transformed(node_->GetWorldTransform().Inverse());\r\n}\r\n\r\nvoid StaticSprite2D::OnDrawOrderChanged()\r\n{\r\n    sourceBatches_[0].drawOrder_ = GetDrawOrder();\r\n}\r\n\r\nvoid StaticSprite2D::UpdateSourceBatches()\r\n{\r\n    if (!sourceBatchesDirty_)\r\n        return;\r\n\r\n    Vector<Vertex2D>& vertices = sourceBatches_[0].vertices_;\r\n    vertices.Clear();\r\n\r\n    if (!sprite_)\r\n        return;\r\n\r\n    if (!useTextureRect_)\r\n    {\r\n        if (!sprite_->GetTextureRectangle(textureRect_, flipX_, flipY_))\r\n            return;\r\n    }\r\n\r\n    \/*\r\n    V1---------V2\r\n    |         \/ |\r\n    |       \/   |\r\n    |     \/     |\r\n    |   \/       |\r\n    | \/         |\r\n    V0---------V3\r\n    *\/\r\n    Vertex2D vertex0;\r\n    Vertex2D vertex1;\r\n    Vertex2D vertex2;\r\n    Vertex2D vertex3;\r\n\r\n    \/\/ Convert to world space\r\n    const Matrix3x4& worldTransform = node_->GetWorldTransform();\r\n    vertex0.position_ = worldTransform * Vector3(drawRect_.min_.x_, drawRect_.min_.y_, 0.0f);\r\n    vertex1.position_ = worldTransform * Vector3(drawRect_.min_.x_, drawRect_.max_.y_, 0.0f);\r\n    vertex2.position_ = worldTransform * Vector3(drawRect_.max_.x_, drawRect_.max_.y_, 0.0f);\r\n    vertex3.position_ = worldTransform * Vector3(drawRect_.max_.x_, drawRect_.min_.y_, 0.0f);\r\n\r\n    vertex0.uv_ = textureRect_.min_;\r\n    vertex1.uv_ = Vector2(textureRect_.min_.x_, textureRect_.max_.y_);\r\n    vertex2.uv_ = textureRect_.max_;\r\n    vertex3.uv_ = Vector2(textureRect_.max_.x_, textureRect_.min_.y_);\r\n\r\n    vertex0.color_ = vertex1.color_ = vertex2.color_ = vertex3.color_ = color_.ToUInt();\r\n\r\n    vertices.Push(vertex0);\r\n    vertices.Push(vertex1);\r\n    vertices.Push(vertex2);\r\n    vertices.Push(vertex3);\r\n\r\n    sourceBatchesDirty_ = false;\r\n}\r\n\r\nvoid StaticSprite2D::UpdateMaterial()\r\n{\r\n    if (customMaterial_)\r\n        sourceBatches_[0].material_ = customMaterial_;\r\n    else\r\n    {\r\n        if (sprite_)\r\n            sourceBatches_[0].material_ = renderer_->GetMaterial(sprite_->GetTexture(), blendMode_);\r\n        else\r\n            sourceBatches_[0].material_ = 0;\r\n    }\r\n}\r\n\r\nvoid StaticSprite2D::UpdateDrawRect()\r\n{\r\n    if (!useDrawRect_)\r\n    {\r\n        if (useHotSpot_)\r\n        {\r\n            if (sprite_ && !sprite_->GetDrawRectangle(drawRect_, hotSpot_, flipX_, flipY_))\r\n                return;\r\n        }\r\n        else\r\n        {\r\n            if (sprite_ && !sprite_->GetDrawRectangle(drawRect_, flipX_, flipY_))\r\n                return;\r\n        }\r\n    }\r\n}\r\n\r\n}\r\n<commit_msg>Revert the check to not allow to set null sprite, as it should work without crashing. Safety checks in UpdateDrawRect() left.<commit_after>\/\/\r\n\/\/ Copyright (c) 2008-2016 the Urho3D project.\r\n\/\/\r\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\r\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\r\n\/\/ in the Software without restriction, including without limitation the rights\r\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\r\n\/\/ copies of the Software, and to permit persons to whom the Software is\r\n\/\/ furnished to do so, subject to the following conditions:\r\n\/\/\r\n\/\/ The above copyright notice and this permission notice shall be included in\r\n\/\/ all copies or substantial portions of the Software.\r\n\/\/\r\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\n\/\/ THE SOFTWARE.\r\n\/\/\r\n\r\n#include \"..\/Precompiled.h\"\r\n\r\n#include \"..\/Core\/Context.h\"\r\n#include \"..\/Graphics\/Material.h\"\r\n#include \"..\/Graphics\/Texture2D.h\"\r\n#include \"..\/Resource\/ResourceCache.h\"\r\n#include \"..\/Scene\/Scene.h\"\r\n#include \"..\/Urho2D\/Renderer2D.h\"\r\n#include \"..\/Urho2D\/Sprite2D.h\"\r\n#include \"..\/Urho2D\/StaticSprite2D.h\"\r\n\r\n#include \"..\/DebugNew.h\"\r\n\r\nnamespace Urho3D\r\n{\r\n\r\nextern const char* URHO2D_CATEGORY;\r\nextern const char* blendModeNames[];\r\n\r\nStaticSprite2D::StaticSprite2D(Context* context) :\r\n    Drawable2D(context),\r\n    blendMode_(BLEND_ALPHA),\r\n    flipX_(false),\r\n    flipY_(false),\r\n    color_(Color::WHITE),\r\n    useHotSpot_(false),\r\n    useDrawRect_(false),\r\n    useTextureRect_(false),\r\n    hotSpot_(0.5f, 0.5f),\r\n    drawRect_(Rect::ZERO),\r\n    textureRect_(Rect::ZERO)\r\n{\r\n    sourceBatches_.Resize(1);\r\n    sourceBatches_[0].owner_ = this;\r\n}\r\n\r\nStaticSprite2D::~StaticSprite2D()\r\n{\r\n}\r\n\r\nvoid StaticSprite2D::RegisterObject(Context* context)\r\n{\r\n    context->RegisterFactory<StaticSprite2D>(URHO2D_CATEGORY);\r\n\r\n    URHO3D_ACCESSOR_ATTRIBUTE(\"Is Enabled\", IsEnabled, SetEnabled, bool, true, AM_DEFAULT);\r\n    URHO3D_COPY_BASE_ATTRIBUTES(Drawable2D);\r\n    URHO3D_MIXED_ACCESSOR_ATTRIBUTE(\"Sprite\", GetSpriteAttr, SetSpriteAttr, ResourceRef, ResourceRef(Sprite2D::GetTypeStatic()),\r\n        AM_DEFAULT);\r\n    URHO3D_ENUM_ACCESSOR_ATTRIBUTE(\"Blend Mode\", GetBlendMode, SetBlendMode, BlendMode, blendModeNames, BLEND_ALPHA, AM_DEFAULT);\r\n    URHO3D_ACCESSOR_ATTRIBUTE(\"Flip X\", GetFlipX, SetFlipX, bool, false, AM_DEFAULT);\r\n    URHO3D_ACCESSOR_ATTRIBUTE(\"Flip Y\", GetFlipY, SetFlipY, bool, false, AM_DEFAULT);\r\n    URHO3D_ACCESSOR_ATTRIBUTE(\"Color\", GetColor, SetColor, Color, Color::WHITE, AM_DEFAULT);\r\n    URHO3D_MIXED_ACCESSOR_ATTRIBUTE(\"Custom material\", GetCustomMaterialAttr, SetCustomMaterialAttr, ResourceRef,\r\n        ResourceRef(Material::GetTypeStatic()), AM_DEFAULT);\r\n    URHO3D_ACCESSOR_ATTRIBUTE(\"Hot Spot\", GetHotSpot, SetHotSpot, Vector2, Vector2(0.5f, 0.5f), AM_DEFAULT);\r\n    URHO3D_ACCESSOR_ATTRIBUTE(\"Use Hot Spot\", GetUseHotSpot, SetUseHotSpot, bool, false, AM_DEFAULT);\r\n    URHO3D_ACCESSOR_ATTRIBUTE(\"Draw Rectangle\", GetDrawRect, SetDrawRect, Rect, Rect::ZERO, AM_DEFAULT);\r\n    URHO3D_ACCESSOR_ATTRIBUTE(\"Use Draw Rectangle\", GetUseDrawRect, SetUseDrawRect, bool, false, AM_DEFAULT);\r\n    URHO3D_ACCESSOR_ATTRIBUTE(\"Texture Rectangle\", GetTextureRect, SetTextureRect, Rect, Rect::ZERO, AM_DEFAULT);\r\n    URHO3D_ACCESSOR_ATTRIBUTE(\"Use Texture Rectangle\", GetUseTextureRect, SetUseTextureRect, bool, false, AM_DEFAULT);\r\n}\r\n\r\nvoid StaticSprite2D::SetSprite(Sprite2D* sprite)\r\n{\r\n    if (sprite == sprite_)\r\n        return;\r\n\r\n    sprite_ = sprite;\r\n    UpdateMaterial();\r\n\r\n    sourceBatchesDirty_ = true;\r\n    MarkNetworkUpdate();\r\n\r\n    UpdateDrawRect();\r\n}\r\n\r\nvoid StaticSprite2D::SetDrawRect(const Rect& rect)\r\n{\r\n    drawRect_ = rect;\r\n\r\n    if(useDrawRect_)\r\n    {\r\n        sourceBatchesDirty_ = true;\r\n    }\r\n}\r\n\r\nvoid StaticSprite2D::SetTextureRect(const Rect& rect)\r\n{\r\n    textureRect_ = rect;\r\n\r\n    if(useTextureRect_)\r\n    {\r\n        sourceBatchesDirty_ = true;\r\n    }\r\n}\r\n\r\nvoid StaticSprite2D::SetBlendMode(BlendMode blendMode)\r\n{\r\n    if (blendMode == blendMode_)\r\n        return;\r\n\r\n    blendMode_ = blendMode;\r\n\r\n    UpdateMaterial();\r\n    MarkNetworkUpdate();\r\n}\r\n\r\nvoid StaticSprite2D::SetFlip(bool flipX, bool flipY)\r\n{\r\n    if (flipX == flipX_ && flipY == flipY_)\r\n        return;\r\n\r\n    flipX_ = flipX;\r\n    flipY_ = flipY;\r\n    sourceBatchesDirty_ = true;\r\n\r\n    MarkNetworkUpdate();\r\n}\r\n\r\nvoid StaticSprite2D::SetFlipX(bool flipX)\r\n{\r\n    SetFlip(flipX, flipY_);\r\n}\r\n\r\nvoid StaticSprite2D::SetFlipY(bool flipY)\r\n{\r\n    SetFlip(flipX_, flipY);\r\n}\r\n\r\nvoid StaticSprite2D::SetColor(const Color& color)\r\n{\r\n    if (color == color_)\r\n        return;\r\n\r\n    color_ = color;\r\n    sourceBatchesDirty_ = true;\r\n    MarkNetworkUpdate();\r\n}\r\n\r\nvoid StaticSprite2D::SetAlpha(float alpha)\r\n{\r\n    if (alpha == color_.a_)\r\n        return;\r\n\r\n    color_.a_ = alpha;\r\n    sourceBatchesDirty_ = true;\r\n    MarkNetworkUpdate();\r\n}\r\n\r\nvoid StaticSprite2D::SetUseHotSpot(bool useHotSpot)\r\n{\r\n    if (useHotSpot == useHotSpot_)\r\n        return;\r\n\r\n    useHotSpot_ = useHotSpot;\r\n    sourceBatchesDirty_ = true;\r\n    MarkNetworkUpdate();\r\n    UpdateDrawRect();\r\n}\r\n\r\nvoid StaticSprite2D::SetUseDrawRect(bool useDrawRect)\r\n{\r\n    if (useDrawRect == useDrawRect_)\r\n        return;\r\n\r\n    useDrawRect_ = useDrawRect;\r\n    sourceBatchesDirty_ = true;\r\n    MarkNetworkUpdate();\r\n    UpdateDrawRect();\r\n}\r\n\r\nvoid StaticSprite2D::SetUseTextureRect(bool useTextureRect)\r\n{\r\n    if (useTextureRect == useTextureRect_)\r\n        return;\r\n\r\n    useTextureRect_ = useTextureRect;\r\n    sourceBatchesDirty_ = true;\r\n    MarkNetworkUpdate();\r\n}\r\n\r\nvoid StaticSprite2D::SetHotSpot(const Vector2& hotspot)\r\n{\r\n    if (hotspot == hotSpot_)\r\n        return;\r\n\r\n    hotSpot_ = hotspot;\r\n\r\n    if (useHotSpot_)\r\n    {\r\n        sourceBatchesDirty_ = true;\r\n        MarkNetworkUpdate();\r\n    }\r\n\r\n    UpdateDrawRect();\r\n}\r\n\r\nvoid StaticSprite2D::SetCustomMaterial(Material* customMaterial)\r\n{\r\n    if (customMaterial == customMaterial_)\r\n        return;\r\n\r\n    customMaterial_ = customMaterial;\r\n    sourceBatchesDirty_ = true;\r\n\r\n    UpdateMaterial();\r\n    MarkNetworkUpdate();\r\n}\r\n\r\nSprite2D* StaticSprite2D::GetSprite() const\r\n{\r\n    return sprite_;\r\n}\r\n\r\n\r\nMaterial* StaticSprite2D::GetCustomMaterial() const\r\n{\r\n    return customMaterial_;\r\n}\r\n\r\nvoid StaticSprite2D::SetSpriteAttr(const ResourceRef& value)\r\n{\r\n    Sprite2D* sprite = Sprite2D::LoadFromResourceRef(this, value);\r\n    if (sprite)\r\n        SetSprite(sprite);\r\n}\r\n\r\nResourceRef StaticSprite2D::GetSpriteAttr() const\r\n{\r\n    return Sprite2D::SaveToResourceRef(sprite_);\r\n}\r\n\r\nvoid StaticSprite2D::SetCustomMaterialAttr(const ResourceRef& value)\r\n{\r\n    ResourceCache* cache = GetSubsystem<ResourceCache>();\r\n    SetCustomMaterial(cache->GetResource<Material>(value.name_));\r\n}\r\n\r\nResourceRef StaticSprite2D::GetCustomMaterialAttr() const\r\n{\r\n    return GetResourceRef(customMaterial_, Material::GetTypeStatic());\r\n}\r\n\r\nvoid StaticSprite2D::OnWorldBoundingBoxUpdate()\r\n{\r\n    boundingBox_.Clear();\r\n    worldBoundingBox_.Clear();\r\n\r\n    const Vector<SourceBatch2D>& sourceBatches = GetSourceBatches();\r\n    for (unsigned i = 0; i < sourceBatches[0].vertices_.Size(); ++i)\r\n        worldBoundingBox_.Merge(sourceBatches[0].vertices_[i].position_);\r\n\r\n    boundingBox_ = worldBoundingBox_.Transformed(node_->GetWorldTransform().Inverse());\r\n}\r\n\r\nvoid StaticSprite2D::OnDrawOrderChanged()\r\n{\r\n    sourceBatches_[0].drawOrder_ = GetDrawOrder();\r\n}\r\n\r\nvoid StaticSprite2D::UpdateSourceBatches()\r\n{\r\n    if (!sourceBatchesDirty_)\r\n        return;\r\n\r\n    Vector<Vertex2D>& vertices = sourceBatches_[0].vertices_;\r\n    vertices.Clear();\r\n\r\n    if (!sprite_)\r\n        return;\r\n\r\n    if (!useTextureRect_)\r\n    {\r\n        if (!sprite_->GetTextureRectangle(textureRect_, flipX_, flipY_))\r\n            return;\r\n    }\r\n\r\n    \/*\r\n    V1---------V2\r\n    |         \/ |\r\n    |       \/   |\r\n    |     \/     |\r\n    |   \/       |\r\n    | \/         |\r\n    V0---------V3\r\n    *\/\r\n    Vertex2D vertex0;\r\n    Vertex2D vertex1;\r\n    Vertex2D vertex2;\r\n    Vertex2D vertex3;\r\n\r\n    \/\/ Convert to world space\r\n    const Matrix3x4& worldTransform = node_->GetWorldTransform();\r\n    vertex0.position_ = worldTransform * Vector3(drawRect_.min_.x_, drawRect_.min_.y_, 0.0f);\r\n    vertex1.position_ = worldTransform * Vector3(drawRect_.min_.x_, drawRect_.max_.y_, 0.0f);\r\n    vertex2.position_ = worldTransform * Vector3(drawRect_.max_.x_, drawRect_.max_.y_, 0.0f);\r\n    vertex3.position_ = worldTransform * Vector3(drawRect_.max_.x_, drawRect_.min_.y_, 0.0f);\r\n\r\n    vertex0.uv_ = textureRect_.min_;\r\n    vertex1.uv_ = Vector2(textureRect_.min_.x_, textureRect_.max_.y_);\r\n    vertex2.uv_ = textureRect_.max_;\r\n    vertex3.uv_ = Vector2(textureRect_.max_.x_, textureRect_.min_.y_);\r\n\r\n    vertex0.color_ = vertex1.color_ = vertex2.color_ = vertex3.color_ = color_.ToUInt();\r\n\r\n    vertices.Push(vertex0);\r\n    vertices.Push(vertex1);\r\n    vertices.Push(vertex2);\r\n    vertices.Push(vertex3);\r\n\r\n    sourceBatchesDirty_ = false;\r\n}\r\n\r\nvoid StaticSprite2D::UpdateMaterial()\r\n{\r\n    if (customMaterial_)\r\n        sourceBatches_[0].material_ = customMaterial_;\r\n    else\r\n    {\r\n        if (sprite_)\r\n            sourceBatches_[0].material_ = renderer_->GetMaterial(sprite_->GetTexture(), blendMode_);\r\n        else\r\n            sourceBatches_[0].material_ = 0;\r\n    }\r\n}\r\n\r\nvoid StaticSprite2D::UpdateDrawRect()\r\n{\r\n    if (!useDrawRect_)\r\n    {\r\n        if (useHotSpot_)\r\n        {\r\n            if (sprite_ && !sprite_->GetDrawRectangle(drawRect_, hotSpot_, flipX_, flipY_))\r\n                return;\r\n        }\r\n        else\r\n        {\r\n            if (sprite_ && !sprite_->GetDrawRectangle(drawRect_, flipX_, flipY_))\r\n                return;\r\n        }\r\n    }\r\n}\r\n\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Fix move assignment of bounded vector (#496)<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"EditableFloor.h\"\n\n#include \"InputManager.h\"\n#include \"Collision.h\"\n#include \"Rectangle.h\"\n\n#define LAYER 0\n#define PI 3.14159265358979\n\nEditableFloor::EditableFloor(float x, float y, float crotation) : normal_sprite(Sprite(\"images\/editable_floor.png\")),\nselected_sprite(Sprite(\"images\/selected_editable_floor.png\")),\nFloor(x, y, normal_sprite.get_width(), normal_sprite.get_height(), crotation){\n\tprintf(\"Entrou\\n\");\n\tbox = Rectangle(x, y, normal_sprite.get_width(), normal_sprite.get_height());\n\tdeleted = false;\n\tselected = false;\n}\n\nEditableFloor::~EditableFloor(){\n\n}\n\nvoid EditableFloor::update(float delta){\n\tInputManager inputManager = InputManager::get_instance();\n\n\n\tif(inputManager.mouse_press(InputManager::LEFT_MOUSE_BUTTON)){\n\t\tint x = inputManager.get_mouse_x();\n      \tint y = inputManager.get_mouse_y();\n\t\tRectangle mouse = Rectangle(x, y, 1, 1);\n\t\tif(Collision::is_colliding(box, mouse, rotation, 0)){\n\t\t\tselected = true;\n\t\t}else{\n\t\t\tselected = false;\n\t\t}\n\t}\n\n\n\tif(selected){\n\t\tfloat value = 0.5 * delta;\n\t\tif(inputManager.is_key_down(SDLK_RIGHT)){\n\t\t\tbox.x += value;\n\t\t}\n\t\tif(inputManager.is_key_down(SDLK_LEFT)){\n\t\t\tbox.x -= value;\n\t\t}\n\t\tif(inputManager.is_key_down(SDLK_UP)){\n\t\t\tbox.y -= value;\n\t\t}\n\t\tif(inputManager.is_key_down(SDLK_DOWN)){\n\t\t\tbox.y += value;\n\t\t}\n\n\t\tif(inputManager.is_key_down(SDLK_z)){\n\t\t\trotation += 0.01 * value;\n\t\t}\n\t\tif(inputManager.is_key_down(SDLK_x)){\n\t\t\trotation -= 0.01 * value;\n\t\t}\n\t\tif(inputManager.is_key_down(SDLK_r)){\n\t\t\trotation = 0;\n\t\t}\n\n\t\tif(inputManager.is_key_down(SDLK_m)){\n\t\t\tnormal_sprite.update_scale_x(0.001 * value);\n\t\t\tselected_sprite.update_scale_x(0.001 * value);\n\t\t\tbox.width = normal_sprite.get_width();\n\t\t}\n\t\tif(inputManager.is_key_down(SDLK_n)){\n\t\t\tnormal_sprite.update_scale_x(-0.001 * value);\n\t\t\tselected_sprite.update_scale_x(-0.001 * value);\n\t\t\tbox.width = normal_sprite.get_width();\n\t\t}\n\t}\n}\n\nvoid EditableFloor::render(){\n\tif(selected){\n\t\tselected_sprite.render(box.get_draw_x(), box.get_draw_y(), rotation);\n\t}else{\n\t\tnormal_sprite.render(box.get_draw_x(), box.get_draw_y(), rotation);\n\t}\n}\n\nbool EditableFloor::is_dead(){\n\treturn deleted;\n}\n\nvoid EditableFloor::notify_collision(GameObject &){\n}\n\nbool EditableFloor::is(string type){\n\treturn type == \"floor\";\n}\n<commit_msg>Add delete floor functionality<commit_after>#include \"EditableFloor.h\"\n\n#include \"InputManager.h\"\n#include \"Collision.h\"\n#include \"Rectangle.h\"\n\n#define LAYER 0\n#define PI 3.14159265358979\n\nEditableFloor::EditableFloor(float x, float y, float crotation) : normal_sprite(Sprite(\"images\/editable_floor.png\")),\nselected_sprite(Sprite(\"images\/selected_editable_floor.png\")),\nFloor(x, y, normal_sprite.get_width(), normal_sprite.get_height(), crotation){\n\tprintf(\"Entrou\\n\");\n\tbox = Rectangle(x, y, normal_sprite.get_width(), normal_sprite.get_height());\n\tdeleted = false;\n\tselected = false;\n}\n\nEditableFloor::~EditableFloor(){\n\n}\n\nvoid EditableFloor::update(float delta){\n\tInputManager inputManager = InputManager::get_instance();\n\n\n\tif(inputManager.mouse_press(InputManager::LEFT_MOUSE_BUTTON)){\n\t\tint x = inputManager.get_mouse_x();\n      \tint y = inputManager.get_mouse_y();\n\t\tRectangle mouse = Rectangle(x, y, 1, 1);\n\t\tif(Collision::is_colliding(box, mouse, rotation, 0)){\n\t\t\tselected = true;\n\t\t}else{\n\t\t\tselected = false;\n\t\t}\n\t}\n\n\n\tif(selected){\n\t\tfloat value = 0.5 * delta;\n\t\tif(inputManager.is_key_down(SDLK_RIGHT)){\n\t\t\tbox.x += value;\n\t\t}\n\t\tif(inputManager.is_key_down(SDLK_LEFT)){\n\t\t\tbox.x -= value;\n\t\t}\n\t\tif(inputManager.is_key_down(SDLK_UP)){\n\t\t\tbox.y -= value;\n\t\t}\n\t\tif(inputManager.is_key_down(SDLK_DOWN)){\n\t\t\tbox.y += value;\n\t\t}\n\n\t\tif(inputManager.is_key_down(SDLK_z)){\n\t\t\trotation += 0.01 * value;\n\t\t}\n\t\tif(inputManager.is_key_down(SDLK_x)){\n\t\t\trotation -= 0.01 * value;\n\t\t}\n\t\tif(inputManager.is_key_down(SDLK_r)){\n\t\t\trotation = 0;\n\t\t}\n\n\t\tif(inputManager.is_key_down(SDLK_PERIOD)){\n\t\t\tnormal_sprite.update_scale_x(0.005 * value);\n\t\t\tselected_sprite.update_scale_x(0.005 * value);\n\t\t\tbox.width = normal_sprite.get_width();\n\t\t}\n\t\tif(inputManager.is_key_down(SDLK_COMMA)){\n\t\t\tnormal_sprite.update_scale_x(-0.005 * value);\n\t\t\tselected_sprite.update_scale_x(-0.005 * value);\n\t\t\tbox.width = normal_sprite.get_width();\n\t\t}\n\t\tif(inputManager.is_key_down(SDLK_DELETE)){\n\t\t\tdeleted = true;\n\t\t}\n\t}\n}\n\nvoid EditableFloor::render(){\n\tif(selected){\n\t\tselected_sprite.render(box.get_draw_x(), box.get_draw_y(), rotation);\n\t}else{\n\t\tnormal_sprite.render(box.get_draw_x(), box.get_draw_y(), rotation);\n\t}\n}\n\nbool EditableFloor::is_dead(){\n\treturn deleted;\n}\n\nvoid EditableFloor::notify_collision(GameObject &){\n}\n\nbool EditableFloor::is(string type){\n\treturn type == \"floor\";\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef AMIME_MAKE_ZIP_ITERATOR\n#define AMIME_MAKE_ZIP_ITERATOR\n#include <amime\/util\/zip_iterator.hpp>\n\nnamespace amime\n{\n\ntemplate<typename ... T_args>\ninline zip_iterator<T_args...> make_zip(const T_args& ... args)\n{\n    return zip_iterator<T_args...>(args...);\n}\n\ntemplate<typename ... T_args>\ninline zip_iterator<T_args...> make_zip_cbegin(const T_args& ... args)\n{\n    return zip_iterator<T_args...>(std::begin(args)...);\n}\n\ntemplate<typename ... T_args>\ninline zip_iterator<T_args...> make_zip_begin(T_args& ... args)\n{\n    return zip_iterator<T_args...>(std::begin(args)...);\n}\n\ntemplate<typename ... T_args>\ninline zip_iterator<T_args...> make_zip_cend(const T_args& ... args)\n{\n    return zip_iterator<T_args...>(std::end(args)...);\n}\n\ntemplate<typename ... T_args>\ninline zip_iterator<T_args...> make_zip_end(T_args& ... args)\n{\n    return zip_iterator<T_args...>(std::end(args)...);\n}\n\n}\/\/ amime\n#endif \/* AMIME_MAKE_ZIP_ITERATOR *\/\n<commit_msg>fix namespace and include path<commit_after>#ifndef MJOLNIR_MAKE_ZIP_ITERATOR\n#define MJOLNIR_MAKE_ZIP_ITERATOR\n#include \"zip_iterator.hpp\"\n#include <iterator>\n\nnamespace mjolnir\n{\n\ntemplate<typename ... T_args>\ninline zip_iterator<T_args...> make_zip(const T_args& ... args)\n{\n    return zip_iterator<T_args...>(args...);\n}\n\ntemplate<typename ... T_args>\ninline zip_iterator<T_args...> make_zip_cbegin(const T_args& ... args)\n{\n    return zip_iterator<T_args...>(std::begin(args)...);\n}\n\ntemplate<typename ... T_args>\ninline zip_iterator<T_args...> make_zip_begin(T_args& ... args)\n{\n    return zip_iterator<T_args...>(std::begin(args)...);\n}\n\ntemplate<typename ... T_args>\ninline zip_iterator<T_args...> make_zip_cend(const T_args& ... args)\n{\n    return zip_iterator<T_args...>(std::end(args)...);\n}\n\ntemplate<typename ... T_args>\ninline zip_iterator<T_args...> make_zip_end(T_args& ... args)\n{\n    return zip_iterator<T_args...>(std::end(args)...);\n}\n\n}\/\/ mjolnir\n#endif \/* MJOLNIR_MAKE_ZIP_ITERATOR *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/ @file\n\/\/\/\t@brief \t\tUnit test for the oscillator filter class\n\/\/\/\t@ingroup \tminlib\n\/\/\/\t@copyright\tCopyright 2018 The Min-Lib Authors. All rights reserved.\n\/\/\/\t@license\tUse of this source code is governed by the MIT License found in the License.md file.\n\n#define CATCH_CONFIG_MAIN\n#include \"c74_min_catch.h\"\n\n\nTEST_CASE (\"Produce correctly sized wavetables using constructor parameters\") {\n\t\n\tusing namespace c74::min;\n    using namespace c74::min::lib;\n    INFO (\"Using an oscillator instance with no arguments, creates a wavetable with 4096 samples\");\n    \n    oscillator<> o;\n\t\n\tREQUIRE( o.size() == 4096 );\t\t\/\/ check the defaults\n\t\n\tINFO (\"Using oscillator with argument set to 512, creates a properly sized wavetable\");\n\t\n\toscillator<> o2(512);\n\t\n\tREQUIRE( o2.size() == 512 );\t\t\/\/ check the defaults\n\t\n\tINFO (\"Using oscillator with argument set to 16384, creates a properly sized wavetable\");\n\t\n\toscillator<> o3(16384);\n\t\n\tREQUIRE( o3.size() == 16384 );\t\t\/\/ check the defaults\n\t\n}\n\n\nTEST_CASE (\"Confirm changes to frequency and phase parameters\") {\n\t\n\tusing namespace c74::min;\n\tusing namespace c74::min::lib;\n\tINFO (\"Using an oscillator instance with no arguments, which should set default values of 0.0 phase, 0.0 frequency\");\n\t\n\toscillator<> o;\n\t\n\tREQUIRE( o.phase() == 0.0 );\t\t\/\/ check the defaults\n\tREQUIRE( o.frequency() == 0.0 );\t\/\/ ..\n\t\n\tINFO (\"Changing the phase to 0.25\");\n\to.phase(0.25);\n\tREQUIRE( o.phase() == Approx(0.25) );\t\/\/ check the new value for phase\n\tREQUIRE( o.frequency() == 0.0 );\t\t\/\/ and confirm the default frequency remains\n\t\n\tINFO (\"Changing the phase to 1.35 should wrap back around\");\n\to.phase(1.32);\n\tREQUIRE( o.phase() == Approx(0.32) );\t\/\/ check the new value for phase\n\tREQUIRE( o.frequency() == 0.0 );\t\t\/\/ and confirm the default frequency remains\n\t\n\tINFO (\"Changing the phase to -0.15 should wrap back around\");\n\to.phase(-0.17);\n\tREQUIRE( o.phase() == Approx(0.83) );\t\/\/ check the new value for phase\n\tREQUIRE( o.frequency() == 0.0 );\t\t\/\/ and confirm the default frequency remains\n\t\n}\n<commit_msg>oscillator: adding tests of frequency changes, PASSING. see Cycling74\/min-lib\/issues\/30<commit_after>\/\/\/ @file\n\/\/\/\t@brief \t\tUnit test for the oscillator filter class\n\/\/\/\t@ingroup \tminlib\n\/\/\/\t@copyright\tCopyright 2018 The Min-Lib Authors. All rights reserved.\n\/\/\/\t@license\tUse of this source code is governed by the MIT License found in the License.md file.\n\n#define CATCH_CONFIG_MAIN\n#include \"c74_min_catch.h\"\n\n\nTEST_CASE (\"Produce correctly sized wavetables using constructor parameters\") {\n\t\n\tusing namespace c74::min;\n    using namespace c74::min::lib;\n    INFO (\"Using an oscillator instance with no arguments, creates a wavetable with 4096 samples\");\n    \n    oscillator<> o;\n\t\n\tREQUIRE( o.size() == 4096 );\t\t\/\/ check the defaults\n\t\n\tINFO (\"Using oscillator with argument set to 512, creates a properly sized wavetable\");\n\t\n\toscillator<> o2(512);\n\t\n\tREQUIRE( o2.size() == 512 );\t\t\/\/ check the defaults\n\t\n\tINFO (\"Using oscillator with argument set to 16384, creates a properly sized wavetable\");\n\t\n\toscillator<> o3(16384);\n\t\n\tREQUIRE( o3.size() == 16384 );\t\t\/\/ check the defaults\n\t\n}\n\n\nTEST_CASE (\"Confirm changes to frequency and phase parameters\") {\n\t\n\tusing namespace c74::min;\n\tusing namespace c74::min::lib;\n\tINFO (\"Using an oscillator instance with no arguments, which should set default values of 0.0 phase, 0.0 frequency\");\n\t\n\toscillator<> o;\n\t\n\tREQUIRE( o.phase() == 0.0 );\t\t\/\/ check the defaults\n\tREQUIRE( o.frequency() == 0.0 );\t\/\/ ..\n\t\n\tINFO (\"Changing the phase to 0.25\");\n\to.phase(0.25);\n\tREQUIRE( o.phase() == Approx(0.25) );\t\/\/ check the new value for phase\n\tREQUIRE( o.frequency() == 0.0 );\t\t\/\/ and confirm the default frequency remains\n\t\n\tINFO (\"Changing the phase to 1.35 should wrap back around\");\n\to.phase(1.32);\n\tREQUIRE( o.phase() == Approx(0.32) );\t\/\/ check the new value for phase\n\tREQUIRE( o.frequency() == 0.0 );\t\t\/\/ and confirm the default frequency remains\n\t\n\tINFO (\"Changing the phase to -0.15 should wrap back around\");\n\to.phase(-0.17);\n\tREQUIRE( o.phase() == Approx(0.83) );\t\/\/ check the new value for phase\n\tREQUIRE( o.frequency() == 0.0 );\t\t\/\/ and confirm the default frequency remains\n\t\n\tINFO (\"Changing the frequency to 2000.0 at 96k sampling rate\");\n\to.frequency(2000.0, 96000.0);\n\tREQUIRE( o.frequency() == Approx(2000.0) );\t\/\/ check the new value for frequency\n\tREQUIRE( o.phase() == Approx(0.83) );\t\t\/\/ and confirm the phase remains unchanged\n\t\n\tINFO (\"Changing the frequency to 2000.0 at 96k sampling rate\");\n\to.frequency(2000.0, 96000.0);\n\tREQUIRE( o.frequency() == Approx(2000.0) );\t\/\/ check the new value for frequency\n\tREQUIRE( o.phase() == Approx(0.83) );\t\t\/\/ and confirm the phase remains unchanged\n\t\n\tINFO (\"Trying to set frequency above the Nyquist, which should fold back below\");\n\to.frequency(52000.0, 96000.0);\n\tREQUIRE( o.frequency() == Approx(44000.0) );\t\/\/ check the new value for frequency\n\tREQUIRE( o.phase() == Approx(0.83) );\t\t\/\/ and confirm the phase remains unchanged\n\t\n\tINFO (\"Trying to set frequency above the sampling rate, which should fold back below\");\n\to.frequency(100000.0, 96000.0);\n\tREQUIRE( o.frequency() == Approx(-4000.0) );\t\/\/ check the new value for frequency\n\tREQUIRE( o.phase() == Approx(0.83) );\t\t\/\/ and confirm the phase remains unchanged\n\t\n\tINFO (\"Trying to set frequency to negative value, which should be allowed\");\n\to.frequency(-6000.0, 96000.0);\n\tREQUIRE( o.frequency() == Approx(-6000.0) );\t\/\/ check the new value for frequency\n\tREQUIRE( o.phase() == Approx(0.83) );\t\t\/\/ and confirm the phase remains unchanged\n\t\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <cassert>\n#include \"monitor.h\"\n\nMonitor::Monitor(sc_module_name name)\n: sc_module(name)\n{\n  SC_METHOD(monitor_method);\n  sensitive << light << request;\n}\n\nvoid Monitor::monitor_method()\n{\n  cout << sc_time_stamp().to_string() << \" Request: \" << (int)request.read() <<  \" Light: \" << (int)light.read() << \", Ack: \" << (int)ack.read() << endl;\n}\n<commit_msg>Nicer output of TL-testbench<commit_after>#include <cassert>\n#include \"monitor.h\"\n\nMonitor::Monitor(sc_module_name name)\n: sc_module(name)\n{\n  SC_METHOD(monitor_method);\n  sensitive << light << request;\n}\n\nvoid Monitor::monitor_method()\n{\n  cout << sc_time_stamp().to_string() << \" Request: \" << (int)request.read() <<  \", Light: \" << (int)light.read() << \", Ack: \" << (int)ack.read() << endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <algorithm>   \/\/ fill\n#include <cassert>\n#include <functional>  \/\/ hash\n#include <tuple>\n#include <type_traits> \/\/ enable_if\n#include <utility>     \/\/ make_pair, pair\n\n#include \"sdd\/util\/next_power.hh\"\n#include \"sdd\/util\/packed.hh\"\n\nnamespace sdd { namespace mem {\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @internal\n\/\/\/ @brief It must be stored by the hash table's data as a member named 'hook'.\ntemplate <typename Data>\nstruct intrusive_member_hook\n{\n  \/\/\/ @brief Store the next data in a bucket.\n  mutable Data* next = nullptr;\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @internal\n\/\/\/ @brief An intrusive hash table.\n\/\/\/\n\/\/\/ It's modeled after boost::intrusive. Only the interfaces needed by the libsdd are implemented.\n\/\/\/ It uses chaining to handle collisions.\ntemplate <typename Data, bool Rehash = true>\nclass hash_table\n{\npublic:\n\n  \/\/\/ @brief Used by insert_check\n  struct insert_commit_data\n  {\n    std::size_t hash;\n  };\n\nprivate:\n\n  \/\/\/ @brief \n  std::size_t nb_buckets_;\n\n  \/\/\/ @brief\n  std::size_t size_;\n\n  \/\/\/ @brief\n  Data** buckets_;\n\n  \/\/\/ @brief The maximal allowed load factor.\n  const double max_load_factor_;\n\n  \/\/\/ @brief The number of times this hash table has been rehashed.\n  std::size_t nb_rehash_;\n\npublic:\n\n  \/\/\/ @brief Constructor\n  hash_table(std::size_t size, double max_load_factor = 0.75)\n    : nb_buckets_(util::next_power_of_2(size))\n    , size_(0)\n    , buckets_(new Data*[nb_buckets_])\n    , max_load_factor_(max_load_factor)\n    , nb_rehash_(0)\n  {\n    std::fill(buckets_, buckets_ + nb_buckets_, nullptr);\n  }\n\n  \/\/\/ @brief Destructor\n  ~hash_table()\n  {\n    delete[] buckets_;\n  }\n\n  \/\/\/ @brief\n  template <typename T, typename EqT>\n  std::pair<Data*, bool>\n  insert_check(const T& x, EqT eq, insert_commit_data& commit_data)\n  const noexcept(noexcept(std::hash<T>()(x)))\n  {\n    commit_data.hash = std::hash<T>()(x);\n    \/\/ same as commit_data.h % nb_buckets_, but much more efficient (works only with powers of 2)\n    const std::size_t pos = commit_data.hash & (nb_buckets_ - 1);\n\n    Data* current = buckets_[pos];\n    bool insertion = true;\n    while (current != nullptr)\n    {\n      if (eq(x, *current))\n      {\n        insertion = false;\n        break;\n      }\n      current = current->hook.next;\n    }\n\n    return std::make_pair(current, insertion);\n  }\n\n  \/\/\/ @brief\n  void\n  insert_commit(Data* x, const insert_commit_data& commit_data)\n  noexcept(Rehash == false)\n  {\n    assert(x != nullptr);\n    const std::size_t pos = commit_data.hash & (nb_buckets_ - 1);\n\n    Data* previous = nullptr;\n    Data* current = buckets_[pos];\n\n    while (current != nullptr)\n    {\n      if (*x == *current)\n      {\n        return;\n      }\n      previous = current;\n      current = current->hook.next;\n    }\n\n    if (previous != nullptr)\n    {\n      previous->hook.next = x;\n    }\n    else\n    {\n      buckets_[pos] = x;\n    }\n\n    ++size_;\n\n    rehash<Rehash>();\n  }\n\n  \/\/\/ @brief Insert an element.\n  std::pair<Data*, bool>\n  insert(Data* x)\n  {\n    auto res = insert_impl(x, buckets_, nb_buckets_);\n    rehash<Rehash>();\n    return res;\n  }\n\n  \/\/\/ @brief Return the number of elements.\n  std::size_t\n  size()\n  const noexcept\n  {\n    return size_;\n  }\n\n  \/\/\/ @brief Return the number of buckets.\n  std::size_t\n  bucket_count()\n  const noexcept\n  {\n    return nb_buckets_;\n  }\n\n  \/\/\/ @brief Remove an element given its value.\n  void\n  erase(const Data* x)\n  noexcept\n  {\n    const std::size_t pos = std::hash<Data>()(*x) & (nb_buckets_ - 1);\n    Data* previous = nullptr;\n    Data* current = buckets_[pos];\n    while (current != nullptr)\n    {\n      if (*x == *current)\n      {\n        if (previous == nullptr) \/\/ first element in bucket\n        {\n          buckets_[pos] = current->hook.next;\n        }\n        else\n        {\n          previous->hook.next = current->hook.next;\n        }\n        --size_;\n        return;\n      }\n      previous = current;\n      current = current->hook.next;\n    }\n    assert(false && \"Data to erase not found\");\n  }\n\n  \/\/\/ @brief Clear the whole table.\n  template <typename Disposer>\n  void\n  clear_and_dispose(Disposer disposer)\n  {\n    for (std::size_t i = 0; i < nb_buckets_; ++i)\n    {\n      Data* current = buckets_[i];\n      while (current != nullptr)\n      {\n        const auto to_erase = current;\n        current = current->hook.next;\n        disposer(to_erase);\n      }\n      buckets_[i] = nullptr;\n    }\n    size_ = 0;\n  }\n\n  \/\/\/ @brief Get the load factor of the internal hash table.\n  double\n  load_factor()\n  const noexcept\n  {\n    return static_cast<double>(size()) \/ static_cast<double>(bucket_count());\n  }\n\n  \/\/\/ @brief The number of times this hash table has been rehashed.\n  std::size_t\n  nb_rehash()\n  const noexcept\n  {\n    return nb_rehash_;\n  }\n\n  \/\/\/ @brief The number of collisions.\n  std::tuple<std::size_t \/* collisions *\/, std::size_t \/* alone *\/, std::size_t \/* empty *\/>\n  collisions()\n  const noexcept\n  {\n    std::size_t col = 0;\n    std::size_t alone = 0;\n    std::size_t empty = 0;\n    for (auto i = 0ul; i < nb_buckets_; ++i)\n    {\n      std::size_t nb = 0;\n      auto current = buckets_[i];\n      while (current != nullptr)\n      {\n        ++nb;\n        current = current->hook.next;\n      }\n      if      (nb == 0) ++empty;\n      else if (nb == 1) ++alone;\n      else if (nb > 1)  ++col;\n    }\n    return std::make_tuple(col, alone, empty);\n  }\n\nprivate:\n\n  template<bool DoRehash>\n  std::enable_if_t<DoRehash, void>\n  rehash()\n  {\n    if (load_factor() < max_load_factor_) \/\/ no need to rehash\n    {\n      return;\n    }\n    ++nb_rehash_;\n    auto new_nb_buckets = nb_buckets_ * 2;\n    auto new_buckets = new Data*[new_nb_buckets];\n    std::fill(new_buckets, new_buckets + new_nb_buckets, nullptr);\n    size_ = 0;\n    for (std::size_t i = 0; i < nb_buckets_; ++i)\n    {\n      Data* data_ptr = buckets_[i];\n      while (data_ptr)\n      {\n        Data* next = data_ptr->hook.next;\n        data_ptr->hook.next = nullptr;\n        insert_impl(data_ptr, new_buckets, new_nb_buckets);\n        data_ptr = next;\n      }\n      \/\/ else empty bucket\n    }\n    std::swap(new_buckets, buckets_);\n    std::swap(new_nb_buckets, nb_buckets_);\n    delete[] new_buckets;\n  }\n\n  template<bool DoRehash>\n  std::enable_if_t<not DoRehash, void>\n  rehash()\n  noexcept\n  {}\n\n  \/\/\/ @brief Insert an element.\n  std::pair<Data*, bool>\n  insert_impl(Data* x, Data** buckets, std::size_t nb_buckets)\n  noexcept(noexcept(std::hash<Data>()(*x)))\n  {\n    const std::size_t pos = std::hash<Data>()(*x) & (nb_buckets - 1);\n\n    Data* current = buckets[pos];\n\n    while (current != nullptr)\n    {\n      if (*x == *current)\n      {\n        return {current, false \/* no insertion *\/};\n      }\n      current = current->hook.next;\n    }\n\n    \/\/ Push in front of the list.\n    x->hook.next = buckets[pos];\n    buckets[pos] = x;\n\n    current = x;\n    ++size_;\n    return {current, true \/* insertion *\/};\n  }\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n}} \/\/ namespace sdd::mem\n<commit_msg>Don't recompute position for inset_check\/insert_commit<commit_after>#pragma once\n\n#include <algorithm>   \/\/ fill\n#include <cassert>\n#include <functional>  \/\/ hash\n#include <tuple>\n#include <type_traits> \/\/ enable_if\n#include <utility>     \/\/ make_pair, pair\n\n#include \"sdd\/util\/next_power.hh\"\n#include \"sdd\/util\/packed.hh\"\n\nnamespace sdd { namespace mem {\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @internal\n\/\/\/ @brief It must be stored by the hash table's data as a member named 'hook'.\ntemplate <typename Data>\nstruct intrusive_member_hook\n{\n  \/\/\/ @brief Store the next data in a bucket.\n  mutable Data* next = nullptr;\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @internal\n\/\/\/ @brief An intrusive hash table.\n\/\/\/\n\/\/\/ It's modeled after boost::intrusive. Only the interfaces needed by the libsdd are implemented.\n\/\/\/ It uses chaining to handle collisions.\ntemplate <typename Data, bool Rehash = true>\nclass hash_table\n{\npublic:\n\n  \/\/\/ @brief Used by insert_check\n  struct insert_commit_data\n  {\n    Data** bucket;\n  };\n\nprivate:\n\n  \/\/\/ @brief \n  std::size_t nb_buckets_;\n\n  \/\/\/ @brief\n  std::size_t size_;\n\n  \/\/\/ @brief\n  Data** buckets_;\n\n  \/\/\/ @brief The maximal allowed load factor.\n  const double max_load_factor_;\n\n  \/\/\/ @brief The number of times this hash table has been rehashed.\n  std::size_t nb_rehash_;\n\npublic:\n\n  hash_table(std::size_t size, double max_load_factor = 0.75)\n    : nb_buckets_(util::next_power_of_2(size))\n    , size_(0)\n    , buckets_(new Data*[nb_buckets_])\n    , max_load_factor_(max_load_factor)\n    , nb_rehash_(0)\n  {\n    std::fill(buckets_, buckets_ + nb_buckets_, nullptr);\n  }\n\n  ~hash_table()\n  {\n    delete[] buckets_;\n  }\n\n  template <typename T, typename EqT>\n  std::pair<Data*, bool>\n  insert_check(const T& x, EqT eq, insert_commit_data& commit_data)\n  const noexcept(noexcept(std::hash<T>()(x)))\n  {\n    static_assert(not Rehash, \"Use with fixed-size hash table only\");\n\n    const std::size_t pos = std::hash<T>()(x) & (nb_buckets_ - 1);\n\n    Data* current = buckets_[pos];\n    commit_data.bucket = buckets_ + pos;\n\n    while (current != nullptr)\n    {\n      if (eq(x, *current))\n      {\n        return {current, false};\n      }\n      current = current->hook.next;\n    }\n\n    return {current, true};\n  }\n\n  void\n  insert_commit(Data* x, insert_commit_data& commit_data)\n  noexcept\n  {\n    static_assert(not Rehash, \"Use with fixed-size hash table only\");\n    assert(x != nullptr);\n\n    Data* previous = nullptr;\n    Data* current = *commit_data.bucket;\n\n    \/\/ We append x at the end of the bucket, it seems to be faster than appending it directly\n    \/\/ in front.\n    while (current != nullptr)\n    {\n      previous = current;\n      current = current->hook.next;\n    }\n\n    if (previous != nullptr)\n    {\n      previous->hook.next = x;\n    }\n    else\n    {\n      *commit_data.bucket = x;\n    }\n\n    ++size_;\n  }\n\n  \/\/\/ @brief Insert an element.\n  std::pair<Data*, bool>\n  insert(Data* x)\n  {\n    auto res = insert_impl(x, buckets_, nb_buckets_);\n    rehash<Rehash>();\n    return res;\n  }\n\n  \/\/\/ @brief Return the number of elements.\n  std::size_t\n  size()\n  const noexcept\n  {\n    return size_;\n  }\n\n  \/\/\/ @brief Return the number of buckets.\n  std::size_t\n  bucket_count()\n  const noexcept\n  {\n    return nb_buckets_;\n  }\n\n  \/\/\/ @brief Remove an element given its value.\n  void\n  erase(const Data* x)\n  noexcept\n  {\n    const std::size_t pos = std::hash<Data>()(*x) & (nb_buckets_ - 1);\n    Data* previous = nullptr;\n    Data* current = buckets_[pos];\n    while (current != nullptr)\n    {\n      if (*x == *current)\n      {\n        if (previous == nullptr) \/\/ first element in bucket\n        {\n          buckets_[pos] = current->hook.next;\n        }\n        else\n        {\n          previous->hook.next = current->hook.next;\n        }\n        --size_;\n        return;\n      }\n      previous = current;\n      current = current->hook.next;\n    }\n    assert(false && \"Data to erase not found\");\n  }\n\n  \/\/\/ @brief Clear the whole table.\n  template <typename Disposer>\n  void\n  clear_and_dispose(Disposer disposer)\n  {\n    for (std::size_t i = 0; i < nb_buckets_; ++i)\n    {\n      Data* current = buckets_[i];\n      while (current != nullptr)\n      {\n        const auto to_erase = current;\n        current = current->hook.next;\n        disposer(to_erase);\n      }\n      buckets_[i] = nullptr;\n    }\n    size_ = 0;\n  }\n\n  \/\/\/ @brief Get the load factor of the internal hash table.\n  double\n  load_factor()\n  const noexcept\n  {\n    return static_cast<double>(size()) \/ static_cast<double>(bucket_count());\n  }\n\n  \/\/\/ @brief The number of times this hash table has been rehashed.\n  std::size_t\n  nb_rehash()\n  const noexcept\n  {\n    return nb_rehash_;\n  }\n\n  \/\/\/ @brief The number of collisions.\n  std::tuple<std::size_t \/* collisions *\/, std::size_t \/* alone *\/, std::size_t \/* empty *\/>\n  collisions()\n  const noexcept\n  {\n    std::size_t col = 0;\n    std::size_t alone = 0;\n    std::size_t empty = 0;\n    for (auto i = 0ul; i < nb_buckets_; ++i)\n    {\n      std::size_t nb = 0;\n      auto current = buckets_[i];\n      while (current != nullptr)\n      {\n        ++nb;\n        current = current->hook.next;\n      }\n      if      (nb == 0) ++empty;\n      else if (nb == 1) ++alone;\n      else if (nb > 1)  ++col;\n    }\n    return std::make_tuple(col, alone, empty);\n  }\n\nprivate:\n\n  template<bool DoRehash>\n  std::enable_if_t<DoRehash, void>\n  rehash()\n  {\n    if (load_factor() < max_load_factor_) \/\/ no need to rehash\n    {\n      return;\n    }\n    ++nb_rehash_;\n    auto new_nb_buckets = nb_buckets_ * 2;\n    auto new_buckets = new Data*[new_nb_buckets];\n    std::fill(new_buckets, new_buckets + new_nb_buckets, nullptr);\n    size_ = 0;\n    for (std::size_t i = 0; i < nb_buckets_; ++i)\n    {\n      Data* data_ptr = buckets_[i];\n      while (data_ptr)\n      {\n        Data* next = data_ptr->hook.next;\n        data_ptr->hook.next = nullptr;\n        insert_impl(data_ptr, new_buckets, new_nb_buckets);\n        data_ptr = next;\n      }\n      \/\/ else empty bucket\n    }\n    std::swap(new_buckets, buckets_);\n    std::swap(new_nb_buckets, nb_buckets_);\n    delete[] new_buckets;\n  }\n\n  template<bool DoRehash>\n  std::enable_if_t<not DoRehash, void>\n  rehash()\n  noexcept\n  {}\n\n  \/\/\/ @brief Insert an element.\n  std::pair<Data*, bool>\n  insert_impl(Data* x, Data** buckets, std::size_t nb_buckets)\n  noexcept(noexcept(std::hash<Data>()(*x)))\n  {\n    const std::size_t pos = std::hash<Data>()(*x) & (nb_buckets - 1);\n\n    Data* current = buckets[pos];\n\n    while (current != nullptr)\n    {\n      if (*x == *current)\n      {\n        return {current, false \/* no insertion *\/};\n      }\n      current = current->hook.next;\n    }\n\n    \/\/ Push in front of the list.\n    x->hook.next = buckets[pos];\n    buckets[pos] = x;\n\n    current = x;\n    ++size_;\n    return {current, true \/* insertion *\/};\n  }\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n}} \/\/ namespace sdd::mem\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>[mus] Disable badly flaking apptest<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   ORFEO Toolbox\n  Language:  C++\n  Date:      $Date$\n  Version:   $Revision$\n\n\n  Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n  See OTBCopyright.txt for details.\n\n\n     This software is distributed WITHOUT ANY WARRANTY; without even\n     the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n     PURPOSE.  See the above copyright notices for more information.\n\n=========================================================================*\/\n#include \"otbWrapperQtWidgetRAMParameter.h\"\n\nnamespace otb\n{\nnamespace Wrapper\n{\n\nQtWidgetRAMParameter::QtWidgetRAMParameter(RAMParameter* param, QtWidgetModel* m)\n: QtWidgetParameterBase(param, m),\n  m_RAMParam(param)\n{\n}\n\nQtWidgetRAMParameter::~QtWidgetRAMParameter()\n{\n}\n\nvoid QtWidgetRAMParameter::DoCreateWidget()\n{\n  \/\/ Set up input text edit\n  m_QHBoxLayout = new QHBoxLayout;\n  m_QHBoxLayout->setSpacing(0);\n  m_QHBoxLayout->setContentsMargins(0, 0, 0, 0);\n\n  m_QSpinBox = new QSpinBox;\n  m_QSpinBox->setToolTip(m_RAMParam->GetDescription());\n\n  connect( m_QSpinBox, SIGNAL(valueChanged(int)), this, SLOT(SetValue(int)) );\n  connect( m_QSpinBox, SIGNAL(valueChanged(int)), GetModel(), SLOT(NotifyUpdate()) );\n  connect( GetModel(), SIGNAL(UpdateGui()), this, SLOT(UpdateGUI() ) );\n\n  m_QHBoxLayout->addWidget(m_QSpinBox);\n  m_QHBoxLayout->addStretch();\n\n  this->setLayout(m_QHBoxLayout);\n}\n\nvoid QtWidgetRAMParameter::DoUpdateGUI()\n{\n  \/\/ Update the valid range if updated\n  \/\/ Using m_UnsignedIntParam->GetMaximum() to set the maximum range\n  \/\/ of the SpinBox give a maximum of 0. The SpinBox max is an\n  \/\/ interger and m_UnsignedIntParam->GetMaximum() returns an unsigned\n  \/\/ integer which returns 2 times the itk::NumericTraits<int>::max().\n  \/\/ static_cast<int>m_UnsignedIntParam->GetMaximum() = 0 then.\n  m_QSpinBox->setRange(itk::NumericTraits<int>::NonpositiveMin(),\n                       itk::NumericTraits<int>::max());\n\n  bool signalsBlocked = m_QSpinBox->blockSignals( true );\n\n  if (m_RAMParam->HasValue())\n    {\n    m_QSpinBox->setValue(static_cast<int>(m_RAMParam->GetValue()));\n    }\n  m_QSpinBox->blockSignals( signalsBlocked );\n\n  QFont font = m_QSpinBox->font();\n  if (m_RAMParam->HasUserValue())\n    {\n    font.setBold(true);\n    }\n  else\n    {\n    font.setBold(false);\n    }\n  m_QSpinBox->setFont(font);\n}\n\nvoid QtWidgetRAMParameter::SetValue(int value)\n{\n  m_RAMParam->SetValue(static_cast<unsigned int>(value));\n  m_RAMParam->SetUserValue(true);\n  m_RAMParam->SetAutomaticValue(false);\n}\n\n}\n}\n<commit_msg>ENH: make the minimum RAM allowed to 1 & set the valid QSpingBox range in the DoCreateWidget method<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 \"otbWrapperQtWidgetRAMParameter.h\"\n\nnamespace otb\n{\nnamespace Wrapper\n{\n\nQtWidgetRAMParameter::QtWidgetRAMParameter(RAMParameter* param, QtWidgetModel* m)\n: QtWidgetParameterBase(param, m),\n  m_RAMParam(param)\n{\n}\n\nQtWidgetRAMParameter::~QtWidgetRAMParameter()\n{\n}\n\nvoid QtWidgetRAMParameter::DoCreateWidget()\n{\n  \/\/ Set up input text edit\n  m_QHBoxLayout = new QHBoxLayout;\n  m_QHBoxLayout->setSpacing(0);\n  m_QHBoxLayout->setContentsMargins(0, 0, 0, 0);\n\n  m_QSpinBox = new QSpinBox;\n  m_QSpinBox->setToolTip(m_RAMParam->GetDescription());\n\n  connect( m_QSpinBox, SIGNAL(valueChanged(int)), this, SLOT(SetValue(int)) );\n  connect( m_QSpinBox, SIGNAL(valueChanged(int)), GetModel(), SLOT(NotifyUpdate()) );\n  connect( GetModel(), SIGNAL(UpdateGui()), this, SLOT(UpdateGUI() ) );\n\n  \/\/ Set a valid range\n  \/\/ Using m_UnsignedIntParam->GetMaximum() to set the maximum range\n  \/\/ of the SpinBox give a maximum of 0. The SpinBox max is an\n  \/\/ interger and m_UnsignedIntParam->GetMaximum() returns an unsigned\n  \/\/ integer which is 2 times the itk::NumericTraits<int>::max().\n  \/\/ static_cast<int>(m_UnsignedIntParam->GetMaximum()) = 0 then.\n  \/\/ 0 RAM is not allowed, make the minimum to 1\n  m_QSpinBox->setRange(1, itk::NumericTraits<int>::max());\n\n  m_QHBoxLayout->addWidget(m_QSpinBox);\n  m_QHBoxLayout->addStretch();\n\n  this->setLayout(m_QHBoxLayout);\n}\n\nvoid QtWidgetRAMParameter::DoUpdateGUI()\n{\n  bool signalsBlocked = m_QSpinBox->blockSignals( true );\n\n  if (m_RAMParam->HasValue())\n    {\n    m_QSpinBox->setValue(static_cast<int>(m_RAMParam->GetValue()));\n    }\n  m_QSpinBox->blockSignals( signalsBlocked );\n\n  QFont font = m_QSpinBox->font();\n  if (m_RAMParam->HasUserValue())\n    {\n    font.setBold(true);\n    }\n  else\n    {\n    font.setBold(false);\n    }\n  m_QSpinBox->setFont(font);\n}\n\nvoid QtWidgetRAMParameter::SetValue(int value)\n{\n  m_RAMParam->SetValue(static_cast<unsigned int>(value));\n  m_RAMParam->SetUserValue(true);\n  m_RAMParam->SetAutomaticValue(false);\n}\n\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*******************************************************************************\n The MIT License (MIT)\n\n Copyright (c) 2015 Alexander Zolotarev <me@alex.bio> from Minsk, Belarus\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\/\/ clang-format off\n\/\/ This FastCGI server implementation is designed to store statistics received from remote clients.\n\/\/ By default, everything is stored in <specified folder>\/alohalytics_messages file.\n\/\/ If you have tons of data, it is better to use logrotate utility to archive it (see logrotate.conf).\n\n\/\/ Validity checks for requests should be mostly done on nginx side (see nginx.conf):\n\/\/ $request_method should be POST only\n\/\/ $content_length should be set and greater than zero (we re-check it below anyway)\n\/\/ $content_type should be set to application\/alohalytics-binary-blob\n\/\/ $http_content_encoding should be set to gzip\n\n\/\/ This binary shoud be spawn as a FastCGI app, for example:\n\/\/ $ spawn-fcgi [-n] -a 127.0.0.1 -p <port number> -P \/path\/to\/pid.file -- .\/fcgi_server \/dir\/to\/store\/received\/data [\/optional\/path\/to\/log.file]\n\/\/ pid.file can be used by logrotate (see logrotate.conf).\n\/\/ clang-format on\n\n#include <chrono>\n#include <csignal>\n#include <cstdlib>\n#include <ctime>\n#include <exception>\n#include <fstream>\n#include <memory>\n#include <sstream>\n#include <string>\n#include <thread>\n\n#include <fcgiapp.h>\n#include <fcgio.h>\n\n#include \"..\/src\/logger.h\"\n\n#include \"statistics_receiver.h\"\n\nusing namespace std;\n\n\/\/ Can be used as a basic check on the client-side if it has connected to the right server.\nstatic const string kBodyTextForGoodServerReply = \"Mahalo\";\nstatic const string kBodyTextForBadServerReply = \"Hohono\";\n\n\/\/ We always reply to our clients that we have received everything they sent, even if it was a complete junk.\n\/\/ The difference is only in the body of the reply.\nvoid Reply200OKWithBody(FCGX_Stream * out, const string & body) {\n  FCGX_FPrintF(out, \"Status: 200 OK\\r\\nContent-Type: text\/plain\\r\\nContent-Length: %ld\\r\\n\\r\\n%s\\n\", body.size(),\n               body.c_str());\n}\n\n\/\/ Global variables to correctly reopen data and log files after signals from logrotate utility.\nvolatile sig_atomic_t gReceivedSIGHUP = 0;\nvolatile sig_atomic_t gReceivedSIGUSR1 = 0;\n\/\/ Redirects all cout output into a file if good log_file_path was given in constructor.\n\/\/ Can always ReopenLogFile() if needed (e.g. for log rotation).\nstruct CoutToFileRedirector {\n  char const * path;\n  unique_ptr<ofstream> log_file;\n  streambuf * original_cout_buf;\n\n  CoutToFileRedirector(const char * log_file_path) : path(log_file_path), original_cout_buf(cout.rdbuf()) {\n    ReopenLogFile();\n  }\n  void ReopenLogFile() {\n    if (!path) {\n      return;\n    }\n    log_file.reset(nullptr);\n    log_file.reset(new ofstream(path, ofstream::out | ofstream::app));\n    if (log_file->good()) {\n      cout.rdbuf(log_file->rdbuf());\n    } else {\n      ATLOG(\"ERROR: Can't open log file\", path, \"for writing.\");\n    }\n  }\n  \/\/ Restore original cout streambuf.\n  ~CoutToFileRedirector() { cout.rdbuf(original_cout_buf); }\n};\n\nint main(int argc, char * argv[]) {\n  if (argc < 2) {\n    ALOG(\"Usage:\", argv[0], \"<directory to store received data> [path to error log file]\");\n    ALOG(\"  - SIGHUP reopens main data file and SIGUSR1 reopens debug log file for logrotate utility.\");\n    return -1;\n  }\n  int result = FCGX_Init();\n  if (0 != result) {\n    ALOG(\"ERROR: FCGX_Init has failed with code\", result);\n    return result;\n  }\n  FCGX_Request request;\n  result = FCGX_InitRequest(&request, 0, FCGI_FAIL_ACCEPT_ON_INTR);\n  if (0 != result) {\n    ALOG(\"ERROR: FCGX_InitRequest has failed with code\", result);\n    return result;\n  }\n\n  \/\/ Redirect cout into a file if it was given in the command line.\n  CoutToFileRedirector log_redirector(argc > 2 ? argv[2] : nullptr);\n  \/\/ Correctly reopen data file on SIGHUP for logrotate.\n  if (SIG_ERR == ::signal(SIGHUP, [](int) { gReceivedSIGHUP = SIGHUP; })) {\n    ATLOG(\"WARNING: Can't set SIGHUP handler. Logrotate will not work correctly.\");\n  }\n  \/\/ Correctly reopen debug log file on SIGUSR1 for logrotate.\n  if (SIG_ERR == ::signal(SIGUSR1, [](int) { gReceivedSIGUSR1 = SIGUSR1; })) {\n    ATLOG(\"WARNING: Can't set SIGUSR1 handler. Logrotate will not work correctly.\");\n  }\n  \/\/ NOTE: On most systems, when we get a signal, FCGX_Accept_r blocks even with a FCGI_FAIL_ACCEPT_ON_INTR flag set\n  \/\/ in the request. Looks like on these systems default signal function installs the signals with the SA_RESTART flag\n  \/\/ set (see man sigaction for more details) and syscalls are automatically restart themselves if a signal occurs.\n  \/\/ To \"fix\" this behavior and gracefully shutdown our server, we use a trick from\n  \/\/ W. Richard Stevens, Stephen A. Rago, \"Advanced Programming in the UNIX Environment\", 2nd edition, page 329.\n  \/\/ It is also described here: http:\/\/comments.gmane.org\/gmane.comp.web.fastcgi.devel\/942\n  for (auto signo : {SIGTERM, SIGINT}) {\n    struct sigaction act;\n    sigemptyset(&act.sa_mask);\n    act.sa_flags = 0;\n#ifdef SA_INTERRUPT\n    act.sa_flags |= SA_INTERRUPT;\n#endif\n    act.sa_handler = [](int) { FCGX_ShutdownPending(); };\n    const int result = sigaction(signo, &act, nullptr);\n    if (result != 0) {\n      ATLOG(\"WARNING: Can't set\", signo, \"signal handler\");\n    }\n  }\n\n  alohalytics::StatisticsReceiver receiver(argv[1]);\n  string gzipped_body;\n  long long content_length;\n  const char * remote_addr_str;\n  const char * request_uri_str;\n  const char * user_agent_str;\n  ATLOG(\"FastCGI Server instance is ready to serve clients' requests.\");\n  while (FCGX_Accept_r(&request) >= 0) {\n    \/\/ Correctly reopen data file in the queue.\n    if (gReceivedSIGHUP == SIGHUP) {\n      receiver.ReopenDataFile();\n      gReceivedSIGHUP = 0;\n    }\n    \/\/ Correctly reopen debug log file.\n    if (gReceivedSIGUSR1 == SIGUSR1) {\n      log_redirector.ReopenLogFile();\n      gReceivedSIGUSR1 = 0;\n    }\n    FCGX_FPrintF(request.out, \"Status: 200 OK\\r\\nContent-Type: text\/plain\\r\\nContent-Length: %ld\\r\\n\\r\\n%s\\n\",\n                 kBodyTextForGoodServerReply.size(), kBodyTextForGoodServerReply.c_str());\n    try {\n      remote_addr_str = FCGX_GetParam(\"REMOTE_ADDR\", request.envp);\n      if (!remote_addr_str) {\n        ATLOG(\"WARNING: Missing REMOTE_ADDR. Please check your http server configuration.\");\n        remote_addr_str = \"\";\n      }\n      request_uri_str = FCGX_GetParam(\"REQUEST_URI\", request.envp);\n      if (!request_uri_str) {\n        ATLOG(\"WARNING: Missing REQUEST_URI. Please check your http server configuration.\");\n        request_uri_str = \"\";\n      }\n      user_agent_str = FCGX_GetParam(\"HTTP_USER_AGENT\", request.envp);\n      if (!user_agent_str) {\n        ATLOG(\"WARNING: Missing HTTP User-Agent. Please check your http server configuration.\");\n        user_agent_str = \"\";\n      }\n\n      const char * content_length_str = FCGX_GetParam(\"HTTP_CONTENT_LENGTH\", request.envp);\n      content_length = 0;\n      if (!content_length_str || ((content_length = atoll(content_length_str)) <= 0)) {\n        ATLOG(\"WARNING: Request is ignored due to invalid or missing Content-Length header\", content_length_str,\n              remote_addr_str, request_uri_str, user_agent_str);\n        Reply200OKWithBody(request.out, kBodyTextForBadServerReply);\n        continue;\n      }\n      \/\/ TODO(AlexZ): Should we make a better check for Content-Length or basic exception handling would be enough?\n      gzipped_body.resize(content_length);\n      if (fcgi_istream(request.in).read(&gzipped_body[0], content_length).fail()) {\n        ATLOG(\"WARNING: Request is ignored because it's body can't be read.\", remote_addr_str, request_uri_str,\n              user_agent_str);\n        Reply200OKWithBody(request.out, kBodyTextForBadServerReply);\n        continue;\n      }\n\n      \/\/ Process and store received body.\n      \/\/ This call can throw different exceptions.\n      receiver.ProcessReceivedHTTPBody(gzipped_body, AlohalyticsBaseEvent::CurrentTimestamp(), remote_addr_str,\n                                       user_agent_str, request_uri_str);\n      Reply200OKWithBody(request.out, kBodyTextForGoodServerReply);\n    } catch (const exception & ex) {\n      ATLOG(\"ERROR: Exception was thrown:\", ex.what(), remote_addr_str, request_uri_str, user_agent_str);\n      \/\/ TODO(AlexZ): Log \"bad\" received body for investigation.\n      Reply200OKWithBody(request.out, kBodyTextForBadServerReply);\n    }\n  }\n  ATLOG(\"Shutting down FastCGI server instance.\");\n  return 0;\n}\n<commit_msg>Removed double “Status: 200 OK…” printing and fixed compilation warnings.<commit_after>\/*******************************************************************************\n The MIT License (MIT)\n\n Copyright (c) 2015 Alexander Zolotarev <me@alex.bio> from Minsk, Belarus\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\/\/ clang-format off\n\/\/ This FastCGI server implementation is designed to store statistics received from remote clients.\n\/\/ By default, everything is stored in <specified folder>\/alohalytics_messages file.\n\/\/ If you have tons of data, it is better to use logrotate utility to archive it (see logrotate.conf).\n\n\/\/ Validity checks for requests should be mostly done on nginx side (see nginx.conf):\n\/\/ $request_method should be POST only\n\/\/ $content_length should be set and greater than zero (we re-check it below anyway)\n\/\/ $content_type should be set to application\/alohalytics-binary-blob\n\/\/ $http_content_encoding should be set to gzip\n\n\/\/ This binary shoud be spawn as a FastCGI app, for example:\n\/\/ $ spawn-fcgi [-n] -a 127.0.0.1 -p <port number> -P \/path\/to\/pid.file -- .\/fcgi_server \/dir\/to\/store\/received\/data [\/optional\/path\/to\/log.file]\n\/\/ pid.file can be used by logrotate (see logrotate.conf).\n\/\/ clang-format on\n\n#include <chrono>\n#include <csignal>\n#include <cstdlib>\n#include <ctime>\n#include <exception>\n#include <fstream>\n#include <memory>\n#include <sstream>\n#include <string>\n#include <thread>\n\n#include <fcgiapp.h>\n#include <fcgio.h>\n\n#include \"..\/src\/logger.h\"\n\n#include \"statistics_receiver.h\"\n\nusing namespace std;\n\n\/\/ Can be used as a basic check on the client-side if it has connected to the right server.\nstatic const string kBodyTextForGoodServerReply = \"Mahalo\";\nstatic const string kBodyTextForBadServerReply = \"Hohono\";\n\n\/\/ We always reply to our clients that we have received everything they sent, even if it was a complete junk.\n\/\/ The difference is only in the body of the reply.\nvoid Reply200OKWithBody(FCGX_Stream * out, const string & body) {\n  FCGX_FPrintF(out, \"Status: 200 OK\\r\\nContent-Type: text\/plain\\r\\nContent-Length: %ld\\r\\n\\r\\n%s\\n\", body.size(),\n               body.c_str());\n}\n\n\/\/ Global variables to correctly reopen data and log files after signals from logrotate utility.\nvolatile sig_atomic_t gReceivedSIGHUP = 0;\nvolatile sig_atomic_t gReceivedSIGUSR1 = 0;\n\/\/ Redirects all cout output into a file if good log_file_path was given in constructor.\n\/\/ Can always ReopenLogFile() if needed (e.g. for log rotation).\nstruct CoutToFileRedirector {\n  char const * path;\n  unique_ptr<ofstream> log_file;\n  streambuf * original_cout_buf;\n\n  CoutToFileRedirector(const char * log_file_path) : path(log_file_path), original_cout_buf(cout.rdbuf()) {\n    ReopenLogFile();\n  }\n  void ReopenLogFile() {\n    if (!path) {\n      return;\n    }\n    log_file.reset(nullptr);\n    log_file.reset(new ofstream(path, ofstream::out | ofstream::app));\n    if (log_file->good()) {\n      cout.rdbuf(log_file->rdbuf());\n    } else {\n      ATLOG(\"ERROR: Can't open log file\", path, \"for writing.\");\n    }\n  }\n  \/\/ Restore original cout streambuf.\n  ~CoutToFileRedirector() { cout.rdbuf(original_cout_buf); }\n};\n\nint main(int argc, char * argv[]) {\n  if (argc < 2) {\n    ALOG(\"Usage:\", argv[0], \"<directory to store received data> [path to error log file]\");\n    ALOG(\"  - SIGHUP reopens main data file and SIGUSR1 reopens debug log file for logrotate utility.\");\n    return -1;\n  }\n  int result = FCGX_Init();\n  if (0 != result) {\n    ALOG(\"ERROR: FCGX_Init has failed with code\", result);\n    return result;\n  }\n  FCGX_Request request;\n  result = FCGX_InitRequest(&request, 0, FCGI_FAIL_ACCEPT_ON_INTR);\n  if (0 != result) {\n    ALOG(\"ERROR: FCGX_InitRequest has failed with code\", result);\n    return result;\n  }\n\n  \/\/ Redirect cout into a file if it was given in the command line.\n  CoutToFileRedirector log_redirector(argc > 2 ? argv[2] : nullptr);\n  \/\/ Correctly reopen data file on SIGHUP for logrotate.\n  if (SIG_ERR == ::signal(SIGHUP, [](int) { gReceivedSIGHUP = SIGHUP; })) {\n    ATLOG(\"WARNING: Can't set SIGHUP handler. Logrotate will not work correctly.\");\n  }\n  \/\/ Correctly reopen debug log file on SIGUSR1 for logrotate.\n  if (SIG_ERR == ::signal(SIGUSR1, [](int) { gReceivedSIGUSR1 = SIGUSR1; })) {\n    ATLOG(\"WARNING: Can't set SIGUSR1 handler. Logrotate will not work correctly.\");\n  }\n  \/\/ NOTE: On most systems, when we get a signal, FCGX_Accept_r blocks even with a FCGI_FAIL_ACCEPT_ON_INTR flag set\n  \/\/ in the request. Looks like on these systems default signal function installs the signals with the SA_RESTART flag\n  \/\/ set (see man sigaction for more details) and syscalls are automatically restart themselves if a signal occurs.\n  \/\/ To \"fix\" this behavior and gracefully shutdown our server, we use a trick from\n  \/\/ W. Richard Stevens, Stephen A. Rago, \"Advanced Programming in the UNIX Environment\", 2nd edition, page 329.\n  \/\/ It is also described here: http:\/\/comments.gmane.org\/gmane.comp.web.fastcgi.devel\/942\n  for (auto signo : {SIGTERM, SIGINT}) {\n    struct sigaction act;\n    sigemptyset(&act.sa_mask);\n    act.sa_flags = 0;\n#ifdef SA_INTERRUPT\n    act.sa_flags |= SA_INTERRUPT;\n#endif\n    act.sa_handler = [](int) { FCGX_ShutdownPending(); };\n    const int result = sigaction(signo, &act, nullptr);\n    if (result != 0) {\n      ATLOG(\"WARNING: Can't set\", signo, \"signal handler\");\n    }\n  }\n\n  alohalytics::StatisticsReceiver receiver(argv[1]);\n  string gzipped_body;\n  long long content_length;\n  const char * remote_addr_str = nullptr;\n  const char * request_uri_str = nullptr;\n  const char * user_agent_str = nullptr;\n  ATLOG(\"FastCGI Server instance is ready to serve clients' requests.\");\n  while (FCGX_Accept_r(&request) >= 0) {\n    \/\/ Correctly reopen data file in the queue.\n    if (gReceivedSIGHUP == SIGHUP) {\n      receiver.ReopenDataFile();\n      gReceivedSIGHUP = 0;\n    }\n    \/\/ Correctly reopen debug log file.\n    if (gReceivedSIGUSR1 == SIGUSR1) {\n      log_redirector.ReopenLogFile();\n      gReceivedSIGUSR1 = 0;\n    }\n\n    try {\n      remote_addr_str = FCGX_GetParam(\"REMOTE_ADDR\", request.envp);\n      if (!remote_addr_str) {\n        ATLOG(\"WARNING: Missing REMOTE_ADDR. Please check your http server configuration.\");\n      }\n      request_uri_str = FCGX_GetParam(\"REQUEST_URI\", request.envp);\n      if (!request_uri_str) {\n        ATLOG(\"WARNING: Missing REQUEST_URI. Please check your http server configuration.\");\n      }\n      user_agent_str = FCGX_GetParam(\"HTTP_USER_AGENT\", request.envp);\n      if (!user_agent_str) {\n        ATLOG(\"WARNING: Missing HTTP User-Agent. Please check your http server configuration.\");\n      }\n\n      const char * content_length_str = FCGX_GetParam(\"HTTP_CONTENT_LENGTH\", request.envp);\n      content_length = 0;\n      if (!content_length_str || ((content_length = atoll(content_length_str)) <= 0)) {\n        ATLOG(\"WARNING: Request is ignored due to invalid or missing Content-Length header\", content_length_str,\n              remote_addr_str, request_uri_str, user_agent_str);\n        Reply200OKWithBody(request.out, kBodyTextForBadServerReply);\n        continue;\n      }\n      \/\/ TODO(AlexZ): Should we make a better check for Content-Length or basic exception handling would be enough?\n      gzipped_body.resize(content_length);\n      if (fcgi_istream(request.in).read(&gzipped_body[0], content_length).fail()) {\n        ATLOG(\"WARNING: Request is ignored because it's body can't be read.\", remote_addr_str, request_uri_str,\n              user_agent_str);\n        Reply200OKWithBody(request.out, kBodyTextForBadServerReply);\n        continue;\n      }\n\n      \/\/ Process and store received body.\n      \/\/ This call can throw different exceptions.\n      receiver.ProcessReceivedHTTPBody(gzipped_body,\n                                       AlohalyticsBaseEvent::CurrentTimestamp(),\n                                       remote_addr_str ? remote_addr_str : \"\",\n                                       user_agent_str ? user_agent_str : \"\",\n                                       request_uri_str ? request_uri_str : \"\");\n      Reply200OKWithBody(request.out, kBodyTextForGoodServerReply);\n    } catch (const exception & ex) {\n      ATLOG(\"ERROR: Exception was thrown:\", ex.what(), remote_addr_str, request_uri_str, user_agent_str);\n      \/\/ TODO(AlexZ): Log \"bad\" received body for investigation.\n      Reply200OKWithBody(request.out, kBodyTextForBadServerReply);\n    }\n  }\n  ATLOG(\"Shutting down FastCGI server instance.\");\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ multiple homomorphic materials blended with a material map\n#include <sh\/sh.hpp>\n#include <sh\/shutil.hpp>\n#include <iostream>\n#include \"Shader.hpp\"\n#include \"Globals.hpp\"\n\nusing namespace SH;\nusing namespace ShUtil;\n\n#include \"util.hpp\"\n\nclass JeweledShader : public Shader {\npublic:\n  JeweledShader();\n  ~JeweledShader();\n\n  bool init();\n\n  ShProgram vertex() { return vsh;}\n  ShProgram fragment() { return fsh;}\n\n  ShProgram vsh, fsh;\n\n  static JeweledShader instance;\n};\n\nJeweledShader::JeweledShader()\n  : Shader(\"Jeweled\")\n{\n}\n\nJeweledShader::~JeweledShader()\n{\n}\n\nbool JeweledShader::init()\n{\n  ShAttrib2f texture_scale(1.0,1.0);\n  texture_scale.name(\"Texture Scale\");\n  texture_scale.range(0.0,10.0);\n\n  vsh = SH_BEGIN_PROGRAM(\"gpu:vertex\") {\n    ShInputPosition4f ipos;\/\/ model-space position\n    ShInputNormal3f inorm; \/\/ model-space normal\n    ShInputTexCoord2f tc;  \/\/ texture coordinate (passed through)\n    ShInputVector3f itan;  \/\/ model-space tangent\n    \n    ShOutputPosition4f opos; \/\/ Position in NDC\n    ShOutputVector3f light;  \/\/ direction to light (surface frame)\n    ShOutputVector3f view;   \/\/ direction to eye (surface frame)\n    ShOutputTexCoord2f otc;  \/\/ tex coords passed through\n    ShOutputVector3f reflv;  \/\/ reflection vector\n\n    otc = tc * texture_scale;\n    opos = Globals::mvp | ipos; \/\/ Compute NDC position\n    ShNormal3f n = Globals::mv | inorm; \/\/ Compute view-space normal\n    ShNormal3f t = Globals::mv | itan; \/\/ Compute view-space normal\n    n = normalize(n);\n    t = normalize(t);\n\n    ShPoint3f posv = (Globals::mv | ipos)(0,1,2); \/\/ Compute view-space position\n    ShVector3f lightv = normalize(Globals::lightPos - posv); \/\/ Compute light direction\n    ShVector3f viewv = -normalize(posv); \/\/ Compute view vector\n    reflv = reflect(viewv,n);  \/\/ view-space reflection vector\n\n    \/\/ compute local surface frame (in view space)\n    \/\/ ShVector3f t = normalize(itan - (itan|n)*n);\n    ShVector3f s = normalize(cross(t,n));\n    \n    \/\/ project view and light vectors onto local surface frame\n    view(0) = (t|viewv);\n    view(1) = (s|viewv);\n    view(2) = (n|viewv);\n\n    light(0) = (t|lightv);\n    light(1) = (s|lightv);\n    light(2) = (n|lightv);  \/\/ if positive, is irradiance scale\n  } SH_END;\n\n  ShImage image;\n\n#define NMATS 3\n  ShTexture2D<ShColor3f> ptex[NMATS];\n  ShTexture2D<ShColor3f> qtex[NMATS];\n\n  image.loadPng(SHMEDIA_DIR \"\/brdfs\/satin\/satinp.png\");\n  ptex[0].size(image.width(), image.height());\n  ptex[0].memory(image.memory());\n  \/\/ ptex[0].name(\"Satin p texture\");\n\n  image.loadPng(SHMEDIA_DIR \"\/brdfs\/satin\/satinq.png\");\n  qtex[0].size(image.width(), image.height());\n  qtex[0].memory(image.memory());\n  \/\/ ptex[0].name(\"Satin q texture\");\n  \n  image.loadPng(SHMEDIA_DIR \"\/brdfs\/mystique\/mystique64_0.png\");\n  ptex[1].size(image.width(), image.height());\n  ptex[1].memory(image.memory());\n  \/\/ ptex[1].name(\"Mystique q texture\");\n\n  image.loadPng(SHMEDIA_DIR \"\/brdfs\/mystique\/mystique64_1.png\");\n  qtex[1].size(image.width(), image.height());\n  qtex[1].memory(image.memory());\n\n  image.loadPng(SHMEDIA_DIR \"\/brdfs\/garnetred\/garnetred64_0.png\");\n  ptex[2].size(image.width(), image.height());\n  ptex[2].memory(image.memory());\n  \/\/ ptex[1].name(\"Garnet red q texture\");\n\n  image.loadPng(SHMEDIA_DIR \"\/brdfs\/garnetred\/garnetred64_1.png\");\n  qtex[2].size(image.width(), image.height());\n  qtex[2].memory(image.memory());\n\n  \/\/ Specular highlight (to be added when needed...)\n  image.loadPng(SHMEDIA_DIR \"\/brdfs\/specular.png\");\n  ShTexture2D<ShColor3f> stex(image.width(), image.height());\n  stex.memory(image.memory());\n  \/\/ stex.name(\"Specular highlight texture\");\n  \n  \/\/ Cube map for mirror reflection\n  std::string imageNames[6] = {\"left\", \"right\", \"top\", \"bottom\", \"back\", \"front\"};\n  ShTextureCube<ShColor4f> env(image.width(), image.height());\n  {\n    for (int i = 0; i < 6; i++) {\n      ShImage image;\n      image.loadPng(std::string(SHMEDIA_DIR \"\/envmaps\/aniroom\/\") + imageNames[i] + \".png\");\n      env.memory(image.memory(), static_cast<ShCubeDirection>(i));\n    }\n  }\n  \n  ShWrapRepeat2D< ShTexture2D<ShColor3f> > mat[NMATS];\n\n  \/\/ Material map, channel 0\n  image.loadPng(SHMEDIA_DIR \"\/mats\/goldknot_ch1.png\");\n  \/\/ image.loadPng(SHMEDIA_DIR \"\/mats\/colourknot_ch1.png\");\n  mat[0].size(image.width(), image.height());\n  mat[0].memory(image.memory());\n  \/\/ mat[0].name(\"Filgiree material map\");\n  \n  \/\/ Material map, channel 1\n  image.loadPng(SHMEDIA_DIR \"\/mats\/colourknot_ch2_ch4.png\");\n  mat[1].size(image.width(), image.height());\n  mat[1].memory(image.memory());\n  \/\/ mat[1].name(\"Base material map\");\n  \n  \/\/ Material map, channel 2\n  image.loadPng(SHMEDIA_DIR \"\/mats\/colourknot_ch3.png\");\n  mat[2].size(image.width(), image.height());\n  mat[2].memory(image.memory());\n  \/\/ mat[2].name(\"Knot interior material map\");\n\n  \/\/ Scale factors\n  ShColor3f alpha[NMATS];\n  ShAttrib1f diffuse[NMATS];\n  ShAttrib1f specular[NMATS];\n  ShAttrib1f mirror[NMATS];\n\n  \/\/ for satin\n  alpha[0] = ShColor3f(0.762367,0.762367,0.762367);\n  alpha[0].name(\"Satin correction color\");\n  diffuse[0] = ShAttrib1f(1.0);\n  diffuse[0].range(0.0,5.0);\n  diffuse[0].name(\"Satin diffuse scale\");\n  specular[0] = ShAttrib1f(0.0);\n  specular[0].range(0.0,1.0);\n  specular[0].name(\"Satin specular scale\");\n  mirror[0] = ShAttrib1f(0.05);\n  mirror[0].range(0.0,1.0);\n  mirror[0].name(\"Satin mirror scale\");\n\n  \/\/ for mystique\n  alpha[1] = ShColor3f(0.0011786,0.165452,0.0338959);\n  alpha[1].name(\"Mystique correction color\");\n  diffuse[1] = ShAttrib1f(10.0);\n  diffuse[1].range(0.0,20.0);\n  diffuse[1].name(\"Mystique diffuse scale\");\n  specular[1] = ShAttrib1f(0.3);\n  specular[1].range(0.0,1.0);\n  specular[1].name(\"Mystique specular scale\");\n  mirror[1] = ShAttrib1f(0.07);\n  mirror[1].range(0.0,1.0);\n  mirror[1].name(\"Mystique mirror scale\");\n\n  \/\/ for garnet red\n  alpha[2] = ShColor3f(0.0410592,0.0992037,0.0787714);\n  alpha[2].name(\"Garnet red correction color\");\n  diffuse[2] = ShAttrib1f(5.0);\n  diffuse[2].range(0.0,20.0);\n  diffuse[2].name(\"Garnet red diffuse scale\");\n  specular[2] = ShAttrib1f(0.4);\n  specular[2].range(0.0,1.0);\n  specular[2].name(\"Garnet red specular scale\");\n  mirror[2] = ShAttrib1f(0.09);\n  mirror[2].range(0.0,1.0);\n  mirror[2].name(\"Garnet red mirror scale\");\n\n  \/\/ Light parameters\n  ShColor3f light_color = ShColor3f(1.0,1.0,1.0);\n  light_color.range(0.0,1.0);\n  light_color.name(\"Light color\");\n  ShAttrib1f light_power = ShAttrib1f(5.0);\n  light_power.range(0.0,20.0);\n  light_power.name(\"Light power\");\n  \n  fsh = SH_BEGIN_PROGRAM(\"gpu:fragment\") {\n    ShInputPosition4f posh;\n    ShInputVector3f light;\n    ShInputVector3f view;\n    ShInputTexCoord2f u;\n    ShInputVector3f reflv;  \n\n    ShOutputColor3f result;\n\n    \/\/ Normalize (theoretically not needed if compiler smart enough)\n    light = normalize(light);\n    view = normalize(view);\n\n    \/\/ compute half vector\n    ShVector3f half = normalize(view + light); \n\n    \/\/ Theoretically not needed if use common subexpression elimination...\n    ShTexCoord2f hu = parabolic_norm(half);\n    ShTexCoord2f lu = parabolic_norm(light);\n    ShTexCoord2f vu = parabolic_norm(view);\n\n    \/\/ Look up shared specular highlight component \n    ShColor3f spec = stex(hu);\n    \/\/ Look up shared mirror reflection component \n    ShColor3f mirr = env(reflv)(0,1,2);\n\n    \/\/ BUG: doesn't work (satin always white) if this not here...\n    \/\/ in theory, should not be needed, bug in compiler?\n    result = ShColor3f(0.0,0.0,0.0);\n    \n    \/\/ sum contributions of all materials\n    for (int i=0; i<NMATS; i++) {\n       ShColor3f f;\n\n       \/\/ Incorporate diffuse scale, correction factor, and irradiance\n       f = diffuse[i] * alpha[i] * pos(light(2));\n\n       \/\/ do texture lookups\n       f *= ptex[i](lu);\n       f *= qtex[i](hu);\n       f *= ptex[i](vu);\n\n       \/\/ Add in specular highlight term (should use Fresnel here)\n       f += specular[i] * spec * pos(light(2));\n       \/\/ Add in mirror term (should use Fresnel here) \n       f += mirror[i] * mirr;\n\n       \/\/ accumulate, masked by material map\n       result += f * mat[i](u);\n    }\n    \/\/ Take into account light power and colour\n    result *= light_power * light_color;\n  } SH_END;\n  return true;\n}\n\nJeweledShader JeweledShader::instance = JeweledShader();\n\n\n<commit_msg>Fix JeweledShader for new Sh fixes<commit_after>\/\/ multiple homomorphic materials blended with a material map\n#include <sh\/sh.hpp>\n#include <sh\/shutil.hpp>\n#include <iostream>\n#include \"Shader.hpp\"\n#include \"Globals.hpp\"\n\nusing namespace SH;\nusing namespace ShUtil;\n\n#include \"util.hpp\"\n\nclass JeweledShader : public Shader {\npublic:\n  JeweledShader();\n  ~JeweledShader();\n\n  bool init();\n\n  ShProgram vertex() { return vsh;}\n  ShProgram fragment() { return fsh;}\n\n  ShProgram vsh, fsh;\n\n  static JeweledShader instance;\n};\n\nJeweledShader::JeweledShader()\n  : Shader(\"Jeweled\")\n{\n}\n\nJeweledShader::~JeweledShader()\n{\n}\n\nbool JeweledShader::init()\n{\n  ShAttrib2f texture_scale(1.0,1.0);\n  texture_scale.name(\"Texture Scale\");\n  texture_scale.range(0.0,10.0);\n\n  vsh = SH_BEGIN_PROGRAM(\"gpu:vertex\") {\n    ShInputPosition4f ipos;\/\/ model-space position\n    ShInputNormal3f inorm; \/\/ model-space normal\n    ShInputTexCoord2f tc;  \/\/ texture coordinate (passed through)\n    ShInputVector3f itan;  \/\/ model-space tangent\n    \n    ShOutputPosition4f opos; \/\/ Position in NDC\n    ShOutputVector3f light;  \/\/ direction to light (surface frame)\n    ShOutputVector3f view;   \/\/ direction to eye (surface frame)\n    ShOutputTexCoord2f otc;  \/\/ tex coords passed through\n    ShOutputVector3f reflv;  \/\/ reflection vector\n\n    otc = tc * texture_scale;\n    opos = Globals::mvp | ipos; \/\/ Compute NDC position\n    ShNormal3f n = Globals::mv | inorm; \/\/ Compute view-space normal\n    ShNormal3f t = Globals::mv | itan; \/\/ Compute view-space normal\n    n = normalize(n);\n    t = normalize(t);\n\n    ShPoint3f posv = (Globals::mv | ipos)(0,1,2); \/\/ Compute view-space position\n    ShVector3f lightv = normalize(Globals::lightPos - posv); \/\/ Compute light direction\n    ShVector3f viewv = -normalize(posv); \/\/ Compute view vector\n    reflv = reflect(viewv,n);  \/\/ view-space reflection vector\n\n    \/\/ compute local surface frame (in view space)\n    \/\/ ShVector3f t = normalize(itan - (itan|n)*n);\n    ShVector3f s = normalize(cross(t,n));\n    \n    \/\/ project view and light vectors onto local surface frame\n    view(0) = (t|viewv);\n    view(1) = (s|viewv);\n    view(2) = (n|viewv);\n\n    light(0) = (t|lightv);\n    light(1) = (s|lightv);\n    light(2) = (n|lightv);  \/\/ if positive, is irradiance scale\n  } SH_END;\n\n  ShImage image;\n\n#define NMATS 3\n  ShTexture2D<ShColor3f> ptex[NMATS];\n  ShTexture2D<ShColor3f> qtex[NMATS];\n\n  image.loadPng(SHMEDIA_DIR \"\/brdfs\/satin\/satinp.png\");\n  ptex[0].size(image.width(), image.height());\n  ptex[0].memory(image.memory());\n  \/\/ ptex[0].name(\"Satin p texture\");\n\n  image.loadPng(SHMEDIA_DIR \"\/brdfs\/satin\/satinq.png\");\n  qtex[0].size(image.width(), image.height());\n  qtex[0].memory(image.memory());\n  \/\/ ptex[0].name(\"Satin q texture\");\n  \n  image.loadPng(SHMEDIA_DIR \"\/brdfs\/mystique\/mystique64_0.png\");\n  ptex[1].size(image.width(), image.height());\n  ptex[1].memory(image.memory());\n  \/\/ ptex[1].name(\"Mystique q texture\");\n\n  image.loadPng(SHMEDIA_DIR \"\/brdfs\/mystique\/mystique64_1.png\");\n  qtex[1].size(image.width(), image.height());\n  qtex[1].memory(image.memory());\n\n  image.loadPng(SHMEDIA_DIR \"\/brdfs\/garnetred\/garnetred64_0.png\");\n  ptex[2].size(image.width(), image.height());\n  ptex[2].memory(image.memory());\n  \/\/ ptex[1].name(\"Garnet red q texture\");\n\n  image.loadPng(SHMEDIA_DIR \"\/brdfs\/garnetred\/garnetred64_1.png\");\n  qtex[2].size(image.width(), image.height());\n  qtex[2].memory(image.memory());\n\n  \/\/ Specular highlight (to be added when needed...)\n  image.loadPng(SHMEDIA_DIR \"\/brdfs\/specular.png\");\n  ShTexture2D<ShColor3f> stex(image.width(), image.height());\n  stex.memory(image.memory());\n  \/\/ stex.name(\"Specular highlight texture\");\n  \n  \/\/ Cube map for mirror reflection\n  std::string imageNames[6] = {\"left\", \"right\", \"top\", \"bottom\", \"back\", \"front\"};\n  ShTextureCube<ShColor4f> env(image.width(), image.height());\n  {\n    for (int i = 0; i < 6; i++) {\n      ShImage image;\n      image.loadPng(std::string(SHMEDIA_DIR \"\/envmaps\/aniroom\/\") + imageNames[i] + \".png\");\n      env.memory(image.memory(), static_cast<ShCubeDirection>(i));\n    }\n  }\n  \n  ShWrapRepeat< ShTexture2D<ShColor3f> > mat[NMATS];\n\n  \/\/ Material map, channel 0\n  image.loadPng(SHMEDIA_DIR \"\/mats\/goldknot_ch1.png\");\n  \/\/ image.loadPng(SHMEDIA_DIR \"\/mats\/colourknot_ch1.png\");\n  mat[0].size(image.width(), image.height());\n  mat[0].memory(image.memory());\n  \/\/ mat[0].name(\"Filgiree material map\");\n  \n  \/\/ Material map, channel 1\n  image.loadPng(SHMEDIA_DIR \"\/mats\/colourknot_ch2_ch4.png\");\n  mat[1].size(image.width(), image.height());\n  mat[1].memory(image.memory());\n  \/\/ mat[1].name(\"Base material map\");\n  \n  \/\/ Material map, channel 2\n  image.loadPng(SHMEDIA_DIR \"\/mats\/colourknot_ch3.png\");\n  mat[2].size(image.width(), image.height());\n  mat[2].memory(image.memory());\n  \/\/ mat[2].name(\"Knot interior material map\");\n\n  \/\/ Scale factors\n  ShColor3f alpha[NMATS];\n  ShAttrib1f diffuse[NMATS];\n  ShAttrib1f specular[NMATS];\n  ShAttrib1f mirror[NMATS];\n\n  \/\/ for satin\n  alpha[0] = ShColor3f(0.762367,0.762367,0.762367);\n  alpha[0].name(\"Satin correction color\");\n  diffuse[0] = ShAttrib1f(1.0);\n  diffuse[0].range(0.0,5.0);\n  diffuse[0].name(\"Satin diffuse scale\");\n  specular[0] = ShAttrib1f(0.0);\n  specular[0].range(0.0,1.0);\n  specular[0].name(\"Satin specular scale\");\n  mirror[0] = ShAttrib1f(0.05);\n  mirror[0].range(0.0,1.0);\n  mirror[0].name(\"Satin mirror scale\");\n\n  \/\/ for mystique\n  alpha[1] = ShColor3f(0.0011786,0.165452,0.0338959);\n  alpha[1].name(\"Mystique correction color\");\n  diffuse[1] = ShAttrib1f(10.0);\n  diffuse[1].range(0.0,20.0);\n  diffuse[1].name(\"Mystique diffuse scale\");\n  specular[1] = ShAttrib1f(0.3);\n  specular[1].range(0.0,1.0);\n  specular[1].name(\"Mystique specular scale\");\n  mirror[1] = ShAttrib1f(0.07);\n  mirror[1].range(0.0,1.0);\n  mirror[1].name(\"Mystique mirror scale\");\n\n  \/\/ for garnet red\n  alpha[2] = ShColor3f(0.0410592,0.0992037,0.0787714);\n  alpha[2].name(\"Garnet red correction color\");\n  diffuse[2] = ShAttrib1f(5.0);\n  diffuse[2].range(0.0,20.0);\n  diffuse[2].name(\"Garnet red diffuse scale\");\n  specular[2] = ShAttrib1f(0.4);\n  specular[2].range(0.0,1.0);\n  specular[2].name(\"Garnet red specular scale\");\n  mirror[2] = ShAttrib1f(0.09);\n  mirror[2].range(0.0,1.0);\n  mirror[2].name(\"Garnet red mirror scale\");\n\n  \/\/ Light parameters\n  ShColor3f light_color = ShColor3f(1.0,1.0,1.0);\n  light_color.range(0.0,1.0);\n  light_color.name(\"Light color\");\n  ShAttrib1f light_power = ShAttrib1f(5.0);\n  light_power.range(0.0,20.0);\n  light_power.name(\"Light power\");\n  \n  fsh = SH_BEGIN_PROGRAM(\"gpu:fragment\") {\n    ShInputPosition4f posh;\n    ShInputVector3f light;\n    ShInputVector3f view;\n    ShInputTexCoord2f u;\n    ShInputVector3f reflv;  \n\n    ShOutputColor3f result;\n\n    \/\/ Normalize (theoretically not needed if compiler smart enough)\n    light = normalize(light);\n    view = normalize(view);\n\n    \/\/ compute half vector\n    ShVector3f half = normalize(view + light); \n\n    \/\/ Theoretically not needed if use common subexpression elimination...\n    ShTexCoord2f hu = parabolic_norm(half);\n    ShTexCoord2f lu = parabolic_norm(light);\n    ShTexCoord2f vu = parabolic_norm(view);\n\n    \/\/ Look up shared specular highlight component \n    ShColor3f spec = stex(hu);\n    \/\/ Look up shared mirror reflection component \n    ShColor3f mirr = env(reflv)(0,1,2);\n\n    \/\/ BUG: doesn't work (satin always white) if this not here...\n    \/\/ in theory, should not be needed, bug in compiler?\n    result = ShColor3f(0.0,0.0,0.0);\n    \n    \/\/ sum contributions of all materials\n    for (int i=0; i<NMATS; i++) {\n       ShColor3f f;\n\n       \/\/ Incorporate diffuse scale, correction factor, and irradiance\n       f = diffuse[i] * alpha[i] * pos(light(2));\n\n       \/\/ do texture lookups\n       f *= ptex[i](lu);\n       f *= qtex[i](hu);\n       f *= ptex[i](vu);\n\n       \/\/ Add in specular highlight term (should use Fresnel here)\n       f += specular[i] * spec * pos(light(2));\n       \/\/ Add in mirror term (should use Fresnel here) \n       f += mirror[i] * mirr;\n\n       \/\/ accumulate, masked by material map\n       result += f * mat[i](u);\n    }\n    \/\/ Take into account light power and colour\n    result *= light_power * light_color;\n  } SH_END;\n  return true;\n}\n\nJeweledShader JeweledShader::instance = JeweledShader();\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2014 Samsung Electronics Co., Ltd All Rights Reserved\n *\n *    Licensed under the Apache License, Version 2.0 (the \"License\");\n *    you may not use this file except in compliance with the License.\n *    You may obtain a copy of the License at\n *\n *        http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n *    Unless required by applicable law or agreed to in writing, software\n *    distributed under the License is distributed on an \"AS IS\" BASIS,\n *    WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n *    See the License for the specific language governing permissions and\n *    limitations under the License.\n *\/\n\/**\n * @file        test\/storage\/performance\/bucket.cpp\n * @author      Aleksander Zdyb <a.zdyb@samsung.com>\n * @version     1.0\n * @brief       Performance tests for Cynara::PolicyBucket\n *\/\n\n#include <algorithm>\n#include <chrono>\n#include <cstdlib>\n#include <memory>\n\n#include <gmock\/gmock.h>\n#include <gtest\/gtest.h>\n\n#include <types\/Policy.h>\n#include <types\/PolicyBucket.h>\n#include <types\/PolicyKey.h>\n#include <types\/PolicyType.h>\n\n#include \"..\/..\/Benchmark.h\"\n\nusing namespace Cynara;\n\nclass Benchmark {\npublic:\n\n};\n\nclass PolicyKeyGenerator {\npublic:\n    typedef std::vector<std::string> Features;\n    typedef std::reference_wrapper<Features> FeaturesRef;\n\n    PolicyKeyGenerator(size_t featuresCount, size_t featureLength) {\n        const std::vector<FeaturesRef> toGenerate = { m_clients, m_users, m_privileges };\n        for (auto featuresRef : toGenerate) {\n            auto &features = featuresRef.get();\n            features.resize(featuresCount);\n            std::generate(std::begin(features), std::end(features),\n                std::bind(&PolicyKeyGenerator::randomKeyFeature, this, featureLength));\n        }\n    }\n\n    PolicyKey randomKey(void) const {\n        return { m_clients.at(rand() % m_clients.size()),\n                 m_users.at(rand() % m_users.size()),\n                 m_privileges.at(rand() % m_privileges.size())\n        };\n    }\n\n    char randomChar(void) const {\n        return (std::rand() % ('z' - 'a')) + 'a';\n    }\n\n    std::string randomKeyFeature(size_t length) const {\n        std::string str(length, 0);\n        std::generate_n( str.begin(), length, std::bind(&PolicyKeyGenerator::randomChar, this));\n        return str;\n    }\n\nprivate:\n    Features m_clients;\n    Features m_users;\n    Features m_privileges;\n};\n\nTEST(Performance, bucket_filtered_100000) {\n    using std::chrono::microseconds;\n\n    PolicyBucket bucket(\"test\");\n\n    PolicyKeyGenerator generator(100, 10);\n\n    const std::size_t policyNumber = 100000;\n    for (std::size_t i = 0; i < policyNumber; ++i) {\n        bucket.insertPolicy(std::make_shared<Policy>(generator.randomKey(),\n                            PredefinedPolicyType::ALLOW));\n    }\n\n    const unsigned int measureRepeats = 1000;\n    auto result = Benchmark::measure<microseconds>([&bucket, &generator, measureRepeats] () {\n        for (auto i = 0u; i < measureRepeats; ++i) {\n            bucket.filtered(generator.randomKey());\n        }\n    });\n\n    auto key = std::string(\"performance_\" + std::to_string(policyNumber));\n    auto value = std::to_string(result.count() \/ measureRepeats) + \" [us]\";\n    RecordProperty(key, value);\n}\n<commit_msg>Add performance tests for InMemoryStorageBackend<commit_after>\/*\n * Copyright (c) 2014 Samsung Electronics Co., Ltd All Rights Reserved\n *\n *    Licensed under the Apache License, Version 2.0 (the \"License\");\n *    you may not use this file except in compliance with the License.\n *    You may obtain a copy of the License at\n *\n *        http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n *    Unless required by applicable law or agreed to in writing, software\n *    distributed under the License is distributed on an \"AS IS\" BASIS,\n *    WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n *    See the License for the specific language governing permissions and\n *    limitations under the License.\n *\/\n\/**\n * @file        test\/storage\/performance\/bucket.cpp\n * @author      Aleksander Zdyb <a.zdyb@samsung.com>\n * @version     1.0\n * @brief       Performance tests for Cynara::PolicyBucket\n *\/\n\n#include <algorithm>\n#include <chrono>\n#include <cstdlib>\n#include <memory>\n\n#include <gmock\/gmock.h>\n#include <gtest\/gtest.h>\n\n#include <storage\/InMemoryStorageBackend.h>\n#include <types\/Policy.h>\n#include <types\/PolicyBucket.h>\n#include <types\/PolicyKey.h>\n#include <types\/PolicyType.h>\n\n#include \"..\/..\/Benchmark.h\"\n\nusing namespace Cynara;\n\nclass PolicyKeyGenerator {\npublic:\n    typedef std::vector<std::string> Features;\n    typedef std::reference_wrapper<Features> FeaturesRef;\n\n    PolicyKeyGenerator(size_t featuresCount, size_t featureLength) {\n        const std::vector<FeaturesRef> toGenerate = { m_clients, m_users, m_privileges };\n        for (auto featuresRef : toGenerate) {\n            auto &features = featuresRef.get();\n            features.resize(featuresCount);\n            std::generate(std::begin(features), std::end(features),\n                std::bind(&PolicyKeyGenerator::randomKeyFeature, this, featureLength));\n        }\n    }\n\n    PolicyKey randomKey(void) const {\n        return { m_clients.at(rand() % m_clients.size()),\n                 m_users.at(rand() % m_users.size()),\n                 m_privileges.at(rand() % m_privileges.size())\n        };\n    }\n\n    char randomChar(void) const {\n        return (std::rand() % ('z' - 'a')) + 'a';\n    }\n\n    std::string randomKeyFeature(size_t length) const {\n        std::string str(length, 0);\n        std::generate_n( str.begin(), length, std::bind(&PolicyKeyGenerator::randomChar, this));\n        return str;\n    }\n\nprivate:\n    Features m_clients;\n    Features m_users;\n    Features m_privileges;\n};\n\nTEST(Performance, bucket_filtered_100000) {\n    using std::chrono::microseconds;\n\n    PolicyBucket bucket(\"test\");\n\n    PolicyKeyGenerator generator(100, 10);\n\n    const std::size_t policyNumber = 100000;\n    for (std::size_t i = 0; i < policyNumber; ++i) {\n        bucket.insertPolicy(std::make_shared<Policy>(generator.randomKey(),\n                            PredefinedPolicyType::ALLOW));\n    }\n\n    const unsigned int measureRepeats = 1000;\n    auto result = Benchmark::measure<microseconds>([&bucket, &generator, measureRepeats] () {\n        for (auto i = 0u; i < measureRepeats; ++i) {\n            bucket.filtered(generator.randomKey());\n        }\n    });\n\n    auto key = std::string(\"performance_\" + std::to_string(policyNumber));\n    auto value = std::to_string(result.count() \/ measureRepeats) + \" [us]\";\n    RecordProperty(key, value);\n}\n\nTEST(Performance, bucket_hasBucket) {\n    using std::chrono::microseconds;\n\n    InMemoryStorageBackend backend(\"\/some\/fake\/path\"); \/\/ don't use load() or save()\n\n    for (auto i = 0u; i < 1000; ++i) {\n        backend.createBucket(\"b\" + std::to_string(i), Cynara::PredefinedPolicyType::DENY);\n    }\n\n    const unsigned int measureRepeats = 5000;\n    auto result = Benchmark::measure<microseconds>([&backend, measureRepeats] () {\n        for (auto i = 0u; i < measureRepeats; ++i) {\n            backend.hasBucket(\"b\" + std::to_string(i));\n        }\n    });\n\n    auto key = std::string(\"performance\");\n    auto value = std::to_string(result.count() \/ measureRepeats) + \" [us]\";\n    RecordProperty(key, value);\n}\n\nTEST(Performance, bucket_createBucket) {\n    using std::chrono::microseconds;\n\n    InMemoryStorageBackend backend(\"\/some\/fake\/path\"); \/\/ don't use load() or save()\n\n    const unsigned int measureRepeats = 1000;\n    auto result = Benchmark::measure<microseconds>([&backend, measureRepeats] () {\n        for (auto i = 0u; i < measureRepeats; ++i) {\n            backend.createBucket(\"b\" + std::to_string(i), Cynara::PredefinedPolicyType::DENY);\n        }\n    });\n\n    auto key = std::string(\"performance\");\n    auto value = std::to_string(result.count() \/ measureRepeats) + \" [us]\";\n    RecordProperty(key, value);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2010-2015, Tarantool AUTHORS, please see AUTHORS file.\n *\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 *\n * 1. Redistributions of source code must retain the above\n *    copyright notice, this list of conditions and the\n *    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\n *    provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY <COPYRIGHT HOLDER> ``AS IS'' AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED\n * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL\n * <COPYRIGHT HOLDER> OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,\n * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR\n * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF\n * THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n *\/\n#include \"tuple_compare_gen.h\"\n#include \"tuple.h\"\n\n\ntemplate <int TYPE>\nstatic inline int field_compare_with_key(const char **field, const char **key);\n\ntemplate <>\ninline int\nfield_compare_with_key<NUM>(const char **field, const char **key) {\n\treturn mp_compare_uint(*field, *key);\n}\n\ntemplate <>\ninline int\nfield_compare_with_key<STRING>(const char **field, const char **key) {\n\tuint32_t size_a, size_b;\n\tsize_a = mp_decode_strl(field);\n\tsize_b = mp_decode_strl(key);\n\tint r = memcmp(*field, *key, MIN(size_a, size_b));\n\tif (r == 0)\n\t\tr = size_a < size_b ? -1 : size_a > size_b;\n\treturn r;\n}\n\ntemplate <int TYPE>\nstatic inline int\nfield_compare_and_next(const char **field_a, const char **field_b);\n\ntemplate <>\ninline int\nfield_compare_and_next<NUM>(const char **field_a, const char **field_b) {\n\tint r = mp_compare_uint(*field_a, *field_b);\n\tmp_next(field_a);\n\tmp_next(field_b);\n\treturn r;\n}\n\ntemplate <>\ninline int\nfield_compare_and_next<STRING>(const char **field_a, const char **field_b) {\n\tuint32_t size_a, size_b;\n\tsize_a = mp_decode_strl(field_a);\n\tsize_b = mp_decode_strl(field_b);\n\tint r = memcmp(*field_a, *field_b, MIN(size_a, size_b));\n\tif (r == 0)\n\t\tr = size_a < size_b ? -1 : size_a > size_b;\n\t*field_a += size_a;\n\t*field_b += size_b;\n\treturn r;\n}\n\n\/* Tuple with key comparer *\/\nnamespace \/* local symbols *\/ {\n\ntemplate<int FLD_ID, int IDX, int TYPE, int ...MORE_TYPES>\nstruct ComparerPrimitive {};\n\/**\n * common\n *\/\ntemplate<int FLD_ID, int IDX, int TYPE, int IDX2, int ...MORE_TYPES>\nstruct ComparerPrimitive<FLD_ID, IDX, TYPE, IDX2, MORE_TYPES...> {\n\tinline static int compareWithKey(const struct tuple *tuple,\n\t\t\t\t\t const char *key,\n\t\t\t\t\t uint32_t part_count,\n\t\t\t\t\t const struct key_def *key_def,\n\t\t\t\t\t const struct tuple_format *format,\n\t\t\t\t\t const char *field)\n\t{\n\t\tint r;\n\t\t\/* static if *\/\n\t\tif (IDX + 1 == IDX2) {\n\t\t\tr = field_compare_and_next<TYPE>(&field, &key);\n\t\t\tif (r || part_count == FLD_ID + 1)\n\t\t\t\treturn r;\n\t\t} else {\n\t\t\tr = field_compare_with_key<TYPE>(&field, &key);\n\t\t\tif (r || part_count == FLD_ID + 1)\n\t\t\t\treturn r;\n\t\t\tfield = tuple_field_old(format, tuple, IDX2);\n\t\t\tmp_next(&key);\n\t\t}\n\t\treturn ComparerPrimitive<FLD_ID + 1, IDX2, MORE_TYPES...>::\n\t\t\t\tcompareWithKey(tuple, key, part_count,\n\t\t\t\t\t       key_def, format, field);\n\t}\n};\n\ntemplate<int FLD_ID, int IDX, int TYPE>\nstruct ComparerPrimitive<FLD_ID, IDX, TYPE> {\n\tinline static int compareWithKey(const struct tuple *,\n\t\t\t\t\t const char *key,\n\t\t\t\t\t uint32_t,\n\t\t\t\t\t const struct key_def *,\n\t\t\t\t\t const struct tuple_format *,\n\t\t\t\t\t const char *field)\n\t{\n\t\treturn field_compare_with_key<TYPE>(&field, &key);\n\t}\n};\n\n\/**\n * header\n *\/\ntemplate<int FLD_ID, int IDX, int ...MORE_TYPES>\nstruct TupleComparer {\n\tstatic int compareWithKey(const struct tuple *tuple,\n\t\t\t\t  const char *key,\n\t\t\t\t  uint32_t part_count,\n\t\t\t\t  const struct key_def *key_def)\n\t{\n\t\t\/* Part count can be 0 in wildcard searches. *\/\n\t\tif (part_count == 0)\n\t\t\treturn 0;\n\t\tstruct tuple_format *format = tuple_format(tuple);\n\t\tconst char *field = tuple_field_old(format, tuple, IDX);\n\t\treturn ComparerPrimitive<FLD_ID, IDX, MORE_TYPES...>::\n\t\t\t\tcompareWithKey(tuple, key, part_count,\n\t\t\t\t\t       key_def, format, field);\n\t}\n};\ntemplate<int ...MORE_TYPES>\nstruct TupleComparer<0, 0, MORE_TYPES...> {\n\tstatic int compareWithKey(const struct tuple *tuple,\n\t\t\t\t  const char *key,\n\t\t\t\t  uint32_t part_count,\n\t\t\t\t  const struct key_def *key_def)\n\t{\n\t\t\/* Part count can be 0 in wildcard searches. *\/\n\t\tif (part_count == 0)\n\t\t\treturn 0;\n\t\tstruct tuple_format *format = tuple_format(tuple);\n\t\tconst char *field = tuple->data;\n\t\tmp_decode_array(&field);\n\t\treturn ComparerPrimitive<0, 0, MORE_TYPES...>::\n\t\t\t\tcompareWithKey(tuple, key, part_count,\n\t\t\t\t\t       key_def, format, field);\n\t}\n};\n} \/* namespace *\/\n\nstruct function_description_wk {\n\ttuple_cmp_wk_t f;\n\tuint32_t p[64];\n};\n#define COMPARER_WK(...) {TupleComparer<0, __VA_ARGS__>::compareWithKey, \\\n\t\t\t\t\t\t\t\t__VA_ARGS__},\nstatic const function_description_wk cmp_wk_arr[] = {\n\tCOMPARER_WK(0, NUM   , 1, NUM   , 2, NUM   )\n\tCOMPARER_WK(0, STRING, 1, NUM   , 2, NUM   )\n\tCOMPARER_WK(0, NUM   , 1, STRING, 2, NUM   )\n\tCOMPARER_WK(0, STRING, 1, STRING, 2, NUM   )\n\tCOMPARER_WK(0, NUM   , 1, NUM   , 2, STRING)\n\tCOMPARER_WK(0, STRING, 1, NUM   , 2, STRING)\n\tCOMPARER_WK(0, NUM   , 1, STRING, 2, STRING)\n\tCOMPARER_WK(0, STRING, 1, STRING, 2, STRING)\n\n\tCOMPARER_WK(1, NUM   , 2, NUM   )\n\tCOMPARER_WK(1, STRING, 2, NUM   )\n\tCOMPARER_WK(1, NUM   , 2, STRING)\n\tCOMPARER_WK(1, STRING, 2, STRING)\n};\n\ntuple_cmp_wk_t\ntuple_compare_wk_gen(const struct key_def *def) {\n\tfor (uint32_t k = 0; k < sizeof(cmp_wk_arr) \/\n\t     sizeof(cmp_wk_arr[0]); k++) {\n\t\tuint32_t i = 0;\n\t\tfor (; i < def->part_count; i++)\n\t\t\tif (def->parts[i].fieldno != cmp_wk_arr[k].p[i * 2] ||\n\t\t\t    def->parts[i].type != cmp_wk_arr[k].p[i * 2 + 1])\n\t\t\t\tbreak;\n\t\tif (i == def->part_count)\n\t\t\treturn cmp_wk_arr[k].f;\n\t}\n\treturn tuple_compare_with_key_default;\n}\n<commit_msg>gh-969 code style fixes<commit_after>\/*\n * Copyright 2010-2015, Tarantool AUTHORS, please see AUTHORS file.\n *\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 *\n * 1. Redistributions of source code must retain the above\n *    copyright notice, this list of conditions and the\n *    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\n *    provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY <COPYRIGHT HOLDER> ``AS IS'' AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED\n * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL\n * <COPYRIGHT HOLDER> OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,\n * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR\n * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF\n * THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n *\/\n#include \"tuple_compare_gen.h\"\n#include \"tuple.h\"\n\n\ntemplate <int TYPE>\nstatic inline int field_compare_with_key(const char **field, const char **key);\n\ntemplate <>\ninline int\nfield_compare_with_key<NUM>(const char **field, const char **key) {\n\treturn mp_compare_uint(*field, *key);\n}\n\ntemplate <>\ninline int\nfield_compare_with_key<STRING>(const char **field, const char **key) {\n\tuint32_t size_a, size_b;\n\tsize_a = mp_decode_strl(field);\n\tsize_b = mp_decode_strl(key);\n\tint r = memcmp(*field, *key, MIN(size_a, size_b));\n\tif (r == 0)\n\t\tr = size_a < size_b ? -1 : size_a > size_b;\n\treturn r;\n}\n\ntemplate <int TYPE>\nstatic inline int\nfield_compare_and_next(const char **field_a, const char **field_b);\n\ntemplate <>\ninline int\nfield_compare_and_next<NUM>(const char **field_a, const char **field_b) {\n\tint r = mp_compare_uint(*field_a, *field_b);\n\tmp_next(field_a);\n\tmp_next(field_b);\n\treturn r;\n}\n\ntemplate <>\ninline int\nfield_compare_and_next<STRING>(const char **field_a, const char **field_b) {\n\tuint32_t size_a, size_b;\n\tsize_a = mp_decode_strl(field_a);\n\tsize_b = mp_decode_strl(field_b);\n\tint r = memcmp(*field_a, *field_b, MIN(size_a, size_b));\n\tif (r == 0)\n\t\tr = size_a < size_b ? -1 : size_a > size_b;\n\t*field_a += size_a;\n\t*field_b += size_b;\n\treturn r;\n}\n\n\/* Tuple with key comparer *\/\nnamespace \/* local symbols *\/ {\n\ntemplate<int FLD_ID, int IDX, int TYPE, int ...MORE_TYPES>\nstruct ComparerPrimitive {};\n\/**\n * common\n *\/\ntemplate<int FLD_ID, int IDX, int TYPE, int IDX2, int ...MORE_TYPES>\nstruct ComparerPrimitive<FLD_ID, IDX, TYPE, IDX2, MORE_TYPES...> {\n\tinline static int compareWithKey(const struct tuple *tuple,\n\t\t\t\t\t const char *key,\n\t\t\t\t\t uint32_t part_count,\n\t\t\t\t\t const struct key_def *key_def,\n\t\t\t\t\t const struct tuple_format *format,\n\t\t\t\t\t const char *field)\n\t{\n\t\tint r;\n\t\t\/* static if *\/\n\t\tif (IDX + 1 == IDX2) {\n\t\t\tr = field_compare_and_next<TYPE>(&field, &key);\n\t\t\tif (r || part_count == FLD_ID + 1)\n\t\t\t\treturn r;\n\t\t} else {\n\t\t\tr = field_compare_with_key<TYPE>(&field, &key);\n\t\t\tif (r || part_count == FLD_ID + 1)\n\t\t\t\treturn r;\n\t\t\tfield = tuple_field_old(format, tuple, IDX2);\n\t\t\tmp_next(&key);\n\t\t}\n\t\treturn ComparerPrimitive<FLD_ID + 1, IDX2, MORE_TYPES...>::\n\t\t\t\tcompareWithKey(tuple, key, part_count,\n\t\t\t\t\t       key_def, format, field);\n\t}\n};\n\ntemplate<int FLD_ID, int IDX, int TYPE>\nstruct ComparerPrimitive<FLD_ID, IDX, TYPE> {\n\tinline static int compareWithKey(const struct tuple *,\n\t\t\t\t\t const char *key,\n\t\t\t\t\t uint32_t,\n\t\t\t\t\t const struct key_def *,\n\t\t\t\t\t const struct tuple_format *,\n\t\t\t\t\t const char *field)\n\t{\n\t\treturn field_compare_with_key<TYPE>(&field, &key);\n\t}\n};\n\n\/**\n * header\n *\/\ntemplate<int FLD_ID, int IDX, int ...MORE_TYPES>\nstruct TupleComparer {\n\tstatic int compareWithKey(const struct tuple *tuple,\n\t\t\t\t  const char *key,\n\t\t\t\t  uint32_t part_count,\n\t\t\t\t  const struct key_def *key_def)\n\t{\n\t\t\/* Part count can be 0 in wildcard searches. *\/\n\t\tif (part_count == 0)\n\t\t\treturn 0;\n\t\tstruct tuple_format *format = tuple_format(tuple);\n\t\tconst char *field = tuple_field_old(format, tuple, IDX);\n\t\treturn ComparerPrimitive<FLD_ID, IDX, MORE_TYPES...>::\n\t\t\t\tcompareWithKey(tuple, key, part_count,\n\t\t\t\t\t       key_def, format, field);\n\t}\n};\n\ntemplate<int ...MORE_TYPES>\nstruct TupleComparer<0, 0, MORE_TYPES...> {\n\tstatic int compareWithKey(const struct tuple *tuple,\n\t\t\t\t  const char *key,\n\t\t\t\t  uint32_t part_count,\n\t\t\t\t  const struct key_def *key_def)\n\t{\n\t\t\/* Part count can be 0 in wildcard searches. *\/\n\t\tif (part_count == 0)\n\t\t\treturn 0;\n\t\tstruct tuple_format *format = tuple_format(tuple);\n\t\tconst char *field = tuple->data;\n\t\tmp_decode_array(&field);\n\t\treturn ComparerPrimitive<0, 0, MORE_TYPES...>::\n\t\t\t\tcompareWithKey(tuple, key, part_count,\n\t\t\t\t\t       key_def, format, field);\n\t}\n};\n} \/* namespace *\/\n\nstruct function_description_wk {\n\ttuple_cmp_wk_t f;\n\tuint32_t p[64];\n};\n\n#define COMPARER_WK(...) {TupleComparer<0, __VA_ARGS__>::compareWithKey, \\\n\t\t\t\t\t\t\t\t__VA_ARGS__},\nstatic const function_description_wk cmp_wk_arr[] = {\n\tCOMPARER_WK(0, NUM   , 1, NUM   , 2, NUM   )\n\tCOMPARER_WK(0, STRING, 1, NUM   , 2, NUM   )\n\tCOMPARER_WK(0, NUM   , 1, STRING, 2, NUM   )\n\tCOMPARER_WK(0, STRING, 1, STRING, 2, NUM   )\n\tCOMPARER_WK(0, NUM   , 1, NUM   , 2, STRING)\n\tCOMPARER_WK(0, STRING, 1, NUM   , 2, STRING)\n\tCOMPARER_WK(0, NUM   , 1, STRING, 2, STRING)\n\tCOMPARER_WK(0, STRING, 1, STRING, 2, STRING)\n\n\tCOMPARER_WK(1, NUM   , 2, NUM   )\n\tCOMPARER_WK(1, STRING, 2, NUM   )\n\tCOMPARER_WK(1, NUM   , 2, STRING)\n\tCOMPARER_WK(1, STRING, 2, STRING)\n};\n\ntuple_cmp_wk_t\ntuple_compare_wk_gen(const struct key_def *def) {\n\tfor (uint32_t k = 0; k < sizeof(cmp_wk_arr) \/\n\t     sizeof(cmp_wk_arr[0]); k++) {\n\t\tuint32_t i = 0;\n\t\tfor (; i < def->part_count; i++)\n\t\t\tif (def->parts[i].fieldno != cmp_wk_arr[k].p[i * 2] ||\n\t\t\t    def->parts[i].type != cmp_wk_arr[k].p[i * 2 + 1])\n\t\t\t\tbreak;\n\t\tif (i == def->part_count)\n\t\t\treturn cmp_wk_arr[k].f;\n\t}\n\treturn tuple_compare_with_key_default;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===- MachineCopyPropagation.cpp - Machine Copy Propagation Pass ---------===\/\/\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 an extremely simple MachineInstr-level copy propagation pass.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/CodeGen\/Passes.h\"\n#include \"llvm\/ADT\/DenseMap.h\"\n#include \"llvm\/ADT\/SetVector.h\"\n#include \"llvm\/ADT\/SmallVector.h\"\n#include \"llvm\/ADT\/Statistic.h\"\n#include \"llvm\/CodeGen\/MachineFunction.h\"\n#include \"llvm\/CodeGen\/MachineFunctionPass.h\"\n#include \"llvm\/CodeGen\/MachineRegisterInfo.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Target\/TargetInstrInfo.h\"\n#include \"llvm\/Target\/TargetRegisterInfo.h\"\n#include \"llvm\/Target\/TargetSubtargetInfo.h\"\nusing namespace llvm;\n\n#define DEBUG_TYPE \"codegen-cp\"\n\nSTATISTIC(NumDeletes, \"Number of dead copies deleted\");\n\nnamespace {\n  typedef SmallVector<unsigned, 4> RegList;\n  typedef DenseMap<unsigned, RegList> SourceMap;\n  typedef DenseMap<unsigned, MachineInstr*> Reg2MIMap;\n\n  class MachineCopyPropagation : public MachineFunctionPass {\n    const TargetRegisterInfo *TRI;\n    const TargetInstrInfo *TII;\n    const MachineRegisterInfo *MRI;\n\n  public:\n    static char ID; \/\/ Pass identification, replacement for typeid\n    MachineCopyPropagation() : MachineFunctionPass(ID) {\n      initializeMachineCopyPropagationPass(*PassRegistry::getPassRegistry());\n    }\n\n    void getAnalysisUsage(AnalysisUsage &AU) const override {\n      AU.setPreservesCFG();\n      MachineFunctionPass::getAnalysisUsage(AU);\n    }\n\n    bool runOnMachineFunction(MachineFunction &MF) override;\n\n    MachineFunctionProperties getRequiredProperties() const override {\n      return MachineFunctionProperties().set(\n          MachineFunctionProperties::Property::NoVRegs);\n    }\n\n  private:\n    void ClobberRegister(unsigned Reg);\n    void CopyPropagateBlock(MachineBasicBlock &MBB);\n    bool eraseIfRedundant(MachineInstr &Copy, unsigned Src, unsigned Def);\n\n    \/\/\/ Candidates for deletion.\n    SmallSetVector<MachineInstr*, 8> MaybeDeadCopies;\n    \/\/\/ Def -> available copies map.\n    Reg2MIMap AvailCopyMap;\n    \/\/\/ Def -> copies map.\n    Reg2MIMap CopyMap;\n    \/\/\/ Src -> Def map\n    SourceMap SrcMap;\n    bool Changed;\n  };\n}\nchar MachineCopyPropagation::ID = 0;\nchar &llvm::MachineCopyPropagationID = MachineCopyPropagation::ID;\n\nINITIALIZE_PASS(MachineCopyPropagation, \"machine-cp\",\n                \"Machine Copy Propagation Pass\", false, false)\n\n\/\/\/ Remove any entry in \\p Map where the register is a subregister or equal to\n\/\/\/ a register contained in \\p Regs.\nstatic void removeRegsFromMap(Reg2MIMap &Map, const RegList &Regs,\n                              const TargetRegisterInfo &TRI) {\n  for (unsigned Reg : Regs) {\n    \/\/ Source of copy is no longer available for propagation.\n    for (MCSubRegIterator SR(Reg, &TRI, true); SR.isValid(); ++SR)\n      Map.erase(*SR);\n  }\n}\n\n\/\/\/ Remove any entry in \\p Map that is marked clobbered in \\p RegMask.\n\/\/\/ The map will typically have a lot fewer entries than the regmask clobbers,\n\/\/\/ so this is more efficient than iterating the clobbered registers and calling\n\/\/\/ ClobberRegister() on them.\nstatic void removeClobberedRegsFromMap(Reg2MIMap &Map,\n                                       const MachineOperand &RegMask) {\n  for (Reg2MIMap::iterator I = Map.begin(), E = Map.end(), Next; I != E;\n       I = Next) {\n    Next = std::next(I);\n    unsigned Reg = I->first;\n    if (RegMask.clobbersPhysReg(Reg))\n      Map.erase(I);\n  }\n}\n\nvoid MachineCopyPropagation::ClobberRegister(unsigned Reg) {\n  for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI) {\n    CopyMap.erase(*AI);\n    AvailCopyMap.erase(*AI);\n\n    SourceMap::iterator SI = SrcMap.find(*AI);\n    if (SI != SrcMap.end()) {\n      removeRegsFromMap(AvailCopyMap, SI->second, *TRI);\n      SrcMap.erase(SI);\n    }\n  }\n}\n\n\/\/\/ Return true if \\p PreviousCopy did copy register \\p Src to register \\p Def.\n\/\/\/ This fact may have been obscured by sub register usage or may not be true at\n\/\/\/ all even though Src and Def are subregisters of the registers used in\n\/\/\/ PreviousCopy. e.g.\n\/\/\/ isNopCopy(\"ecx = COPY eax\", AX, CX) == true\n\/\/\/ isNopCopy(\"ecx = COPY eax\", AH, CL) == false\nstatic bool isNopCopy(const MachineInstr &PreviousCopy, unsigned Src,\n                      unsigned Def, const TargetRegisterInfo *TRI) {\n  unsigned PreviousSrc = PreviousCopy.getOperand(1).getReg();\n  unsigned PreviousDef = PreviousCopy.getOperand(0).getReg();\n  if (Src == PreviousSrc) {\n    assert(Def == PreviousDef);\n    return true;\n  }\n  if (!TRI->isSubRegister(PreviousSrc, Src))\n    return false;\n  unsigned SubIdx = TRI->getSubRegIndex(PreviousSrc, Src);\n  return SubIdx == TRI->getSubRegIndex(PreviousDef, Def);\n}\n\n\/\/\/ Remove instruction \\p Copy if there exists a previous copy that copies the\n\/\/\/ register \\p Src to the register \\p Def; This may happen indirectly by\n\/\/\/ copying the super registers.\nbool MachineCopyPropagation::eraseIfRedundant(MachineInstr &Copy, unsigned Src,\n                                              unsigned Def) {\n  \/\/ Avoid eliminating a copy from\/to a reserved registers as we cannot predict\n  \/\/ the value (Example: The sparc zero register is writable but stays zero).\n  if (MRI->isReserved(Src) || MRI->isReserved(Def))\n    return false;\n\n  \/\/ Search for an existing copy.\n  Reg2MIMap::iterator CI = AvailCopyMap.find(Def);\n  if (CI == AvailCopyMap.end())\n    return false;\n\n  \/\/ Check that the existing copy uses the correct sub registers.\n  MachineInstr &PrevCopy = *CI->second;\n  if (!isNopCopy(PrevCopy, Src, Def, TRI))\n    return false;\n\n  DEBUG(dbgs() << \"MCP: copy is a NOP, removing: \"; Copy.dump());\n\n  \/\/ Copy was redundantly redefining either Src or Def. Remove earlier kill\n  \/\/ flags between Copy and PrevCopy because the value will be reused now.\n  assert(Copy.isCopy());\n  unsigned CopyDef = Copy.getOperand(0).getReg();\n  assert(CopyDef == Src || CopyDef == Def);\n  for (MachineInstr &MI :\n       make_range(PrevCopy.getIterator(), Copy.getIterator()))\n    MI.clearRegisterKills(CopyDef, TRI);\n\n  Copy.eraseFromParent();\n  Changed = true;\n  ++NumDeletes;\n  return true;\n}\n\nvoid MachineCopyPropagation::CopyPropagateBlock(MachineBasicBlock &MBB) {\n  DEBUG(dbgs() << \"MCP: CopyPropagateBlock \" << MBB.getName() << \"\\n\");\n\n  for (MachineBasicBlock::iterator I = MBB.begin(), E = MBB.end(); I != E; ) {\n    MachineInstr *MI = &*I;\n    ++I;\n\n    if (MI->isCopy()) {\n      unsigned Def = MI->getOperand(0).getReg();\n      unsigned Src = MI->getOperand(1).getReg();\n\n      assert(!TargetRegisterInfo::isVirtualRegister(Def) &&\n             !TargetRegisterInfo::isVirtualRegister(Src) &&\n             \"MachineCopyPropagation should be run after register allocation!\");\n\n      \/\/ The two copies cancel out and the source of the first copy\n      \/\/ hasn't been overridden, eliminate the second one. e.g.\n      \/\/  %ECX<def> = COPY %EAX\n      \/\/  ... nothing clobbered EAX.\n      \/\/  %EAX<def> = COPY %ECX\n      \/\/ =>\n      \/\/  %ECX<def> = COPY %EAX\n      \/\/\n      \/\/ or\n      \/\/\n      \/\/  %ECX<def> = COPY %EAX\n      \/\/  ... nothing clobbered EAX.\n      \/\/  %ECX<def> = COPY %EAX\n      \/\/ =>\n      \/\/  %ECX<def> = COPY %EAX\n      if (eraseIfRedundant(*MI, Def, Src) || eraseIfRedundant(*MI, Src, Def))\n        continue;\n\n      \/\/ If Src is defined by a previous copy, the previous copy cannot be\n      \/\/ eliminated.\n      for (MCRegAliasIterator AI(Src, TRI, true); AI.isValid(); ++AI) {\n        Reg2MIMap::iterator CI = CopyMap.find(*AI);\n        if (CI != CopyMap.end()) {\n          DEBUG(dbgs() << \"MCP: Copy is no longer dead: \"; CI->second->dump());\n          MaybeDeadCopies.remove(CI->second);\n        }\n      }\n\n      DEBUG(dbgs() << \"MCP: Copy is a deletion candidate: \"; MI->dump());\n\n      \/\/ Copy is now a candidate for deletion.\n      if (!MRI->isReserved(Def))\n        MaybeDeadCopies.insert(MI);\n\n      \/\/ If 'Def' is previously source of another copy, then this earlier copy's\n      \/\/ source is no longer available. e.g.\n      \/\/ %xmm9<def> = copy %xmm2\n      \/\/ ...\n      \/\/ %xmm2<def> = copy %xmm0\n      \/\/ ...\n      \/\/ %xmm2<def> = copy %xmm9\n      ClobberRegister(Def);\n\n      \/\/ Remember Def is defined by the copy.\n      for (MCSubRegIterator SR(Def, TRI, \/*IncludeSelf=*\/true); SR.isValid();\n           ++SR) {\n        CopyMap[*SR] = MI;\n        AvailCopyMap[*SR] = MI;\n      }\n\n      \/\/ Remember source that's copied to Def. Once it's clobbered, then\n      \/\/ it's no longer available for copy propagation.\n      RegList &DestList = SrcMap[Src];\n      if (!is_contained(DestList, Def))\n        DestList.push_back(Def);\n\n      continue;\n    }\n\n    \/\/ Not a copy.\n    SmallVector<unsigned, 2> Defs;\n    const MachineOperand *RegMask = nullptr;\n    for (const MachineOperand &MO : MI->operands()) {\n      if (MO.isRegMask())\n        RegMask = &MO;\n      if (!MO.isReg())\n        continue;\n      unsigned Reg = MO.getReg();\n      if (!Reg)\n        continue;\n\n      assert(!TargetRegisterInfo::isVirtualRegister(Reg) &&\n             \"MachineCopyPropagation should be run after register allocation!\");\n\n      if (MO.isDef()) {\n        Defs.push_back(Reg);\n        continue;\n      }\n\n      \/\/ If 'Reg' is defined by a copy, the copy is no longer a candidate\n      \/\/ for elimination.\n      for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI) {\n        Reg2MIMap::iterator CI = CopyMap.find(*AI);\n        if (CI != CopyMap.end()) {\n          DEBUG(dbgs() << \"MCP: Copy is used - not dead: \"; CI->second->dump());\n          MaybeDeadCopies.remove(CI->second);\n        }\n      }\n      \/\/ Treat undef use like defs for copy propagation but not for\n      \/\/ dead copy. We would need to do a liveness check to be sure the copy\n      \/\/ is dead for undef uses.\n      \/\/ The backends are allowed to do whatever they want with undef value\n      \/\/ and we cannot be sure this register will not be rewritten to break\n      \/\/ some false dependencies for the hardware for instance.\n      if (MO.isUndef())\n        Defs.push_back(Reg);\n    }\n\n    \/\/ The instruction has a register mask operand which means that it clobbers\n    \/\/ a large set of registers.  Treat clobbered registers the same way as\n    \/\/ defined registers.\n    if (RegMask) {\n      \/\/ Erase any MaybeDeadCopies whose destination register is clobbered.\n      for (SmallSetVector<MachineInstr *, 8>::iterator DI =\n               MaybeDeadCopies.begin();\n           DI != MaybeDeadCopies.end();) {\n        MachineInstr *MaybeDead = *DI;\n        unsigned Reg = MaybeDead->getOperand(0).getReg();\n        assert(!MRI->isReserved(Reg));\n\n        if (!RegMask->clobbersPhysReg(Reg)) {\n          ++DI;\n          continue;\n        }\n\n        DEBUG(dbgs() << \"MCP: Removing copy due to regmask clobbering: \";\n              MaybeDead->dump());\n\n        \/\/ erase() will return the next valid iterator pointing to the next\n        \/\/ element after the erased one.\n        DI = MaybeDeadCopies.erase(DI);\n        MaybeDead->eraseFromParent();\n        Changed = true;\n        ++NumDeletes;\n      }\n\n      removeClobberedRegsFromMap(AvailCopyMap, *RegMask);\n      removeClobberedRegsFromMap(CopyMap, *RegMask);\n      for (SourceMap::iterator I = SrcMap.begin(), E = SrcMap.end(), Next;\n           I != E; I = Next) {\n        Next = std::next(I);\n        if (RegMask->clobbersPhysReg(I->first)) {\n          removeRegsFromMap(AvailCopyMap, I->second, *TRI);\n          SrcMap.erase(I);\n        }\n      }\n    }\n\n    \/\/ Any previous copy definition or reading the Defs is no longer available.\n    for (unsigned Reg : Defs)\n      ClobberRegister(Reg);\n  }\n\n  \/\/ If MBB doesn't have successors, delete the copies whose defs are not used.\n  \/\/ If MBB does have successors, then conservative assume the defs are live-out\n  \/\/ since we don't want to trust live-in lists.\n  if (MBB.succ_empty()) {\n    for (MachineInstr *MaybeDead : MaybeDeadCopies) {\n      assert(!MRI->isReserved(MaybeDead->getOperand(0).getReg()));\n      MaybeDead->eraseFromParent();\n      Changed = true;\n      ++NumDeletes;\n    }\n  }\n\n  MaybeDeadCopies.clear();\n  AvailCopyMap.clear();\n  CopyMap.clear();\n  SrcMap.clear();\n}\n\nbool MachineCopyPropagation::runOnMachineFunction(MachineFunction &MF) {\n  if (skipFunction(*MF.getFunction()))\n    return false;\n\n  Changed = false;\n\n  TRI = MF.getSubtarget().getRegisterInfo();\n  TII = MF.getSubtarget().getInstrInfo();\n  MRI = &MF.getRegInfo();\n\n  for (MachineBasicBlock &MBB : MF)\n    CopyPropagateBlock(MBB);\n\n  return Changed;\n}\n\n<commit_msg>MachineCopyPropagation: Respect implicit operands of COPY<commit_after>\/\/===- MachineCopyPropagation.cpp - Machine Copy Propagation Pass ---------===\/\/\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 an extremely simple MachineInstr-level copy propagation pass.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/CodeGen\/Passes.h\"\n#include \"llvm\/ADT\/DenseMap.h\"\n#include \"llvm\/ADT\/SetVector.h\"\n#include \"llvm\/ADT\/SmallVector.h\"\n#include \"llvm\/ADT\/Statistic.h\"\n#include \"llvm\/CodeGen\/MachineFunction.h\"\n#include \"llvm\/CodeGen\/MachineFunctionPass.h\"\n#include \"llvm\/CodeGen\/MachineRegisterInfo.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Target\/TargetInstrInfo.h\"\n#include \"llvm\/Target\/TargetRegisterInfo.h\"\n#include \"llvm\/Target\/TargetSubtargetInfo.h\"\nusing namespace llvm;\n\n#define DEBUG_TYPE \"codegen-cp\"\n\nSTATISTIC(NumDeletes, \"Number of dead copies deleted\");\n\nnamespace {\n  typedef SmallVector<unsigned, 4> RegList;\n  typedef DenseMap<unsigned, RegList> SourceMap;\n  typedef DenseMap<unsigned, MachineInstr*> Reg2MIMap;\n\n  class MachineCopyPropagation : public MachineFunctionPass {\n    const TargetRegisterInfo *TRI;\n    const TargetInstrInfo *TII;\n    const MachineRegisterInfo *MRI;\n\n  public:\n    static char ID; \/\/ Pass identification, replacement for typeid\n    MachineCopyPropagation() : MachineFunctionPass(ID) {\n      initializeMachineCopyPropagationPass(*PassRegistry::getPassRegistry());\n    }\n\n    void getAnalysisUsage(AnalysisUsage &AU) const override {\n      AU.setPreservesCFG();\n      MachineFunctionPass::getAnalysisUsage(AU);\n    }\n\n    bool runOnMachineFunction(MachineFunction &MF) override;\n\n    MachineFunctionProperties getRequiredProperties() const override {\n      return MachineFunctionProperties().set(\n          MachineFunctionProperties::Property::NoVRegs);\n    }\n\n  private:\n    void ClobberRegister(unsigned Reg);\n    void ReadRegister(unsigned Reg);\n    void CopyPropagateBlock(MachineBasicBlock &MBB);\n    bool eraseIfRedundant(MachineInstr &Copy, unsigned Src, unsigned Def);\n\n    \/\/\/ Candidates for deletion.\n    SmallSetVector<MachineInstr*, 8> MaybeDeadCopies;\n    \/\/\/ Def -> available copies map.\n    Reg2MIMap AvailCopyMap;\n    \/\/\/ Def -> copies map.\n    Reg2MIMap CopyMap;\n    \/\/\/ Src -> Def map\n    SourceMap SrcMap;\n    bool Changed;\n  };\n}\nchar MachineCopyPropagation::ID = 0;\nchar &llvm::MachineCopyPropagationID = MachineCopyPropagation::ID;\n\nINITIALIZE_PASS(MachineCopyPropagation, \"machine-cp\",\n                \"Machine Copy Propagation Pass\", false, false)\n\n\/\/\/ Remove any entry in \\p Map where the register is a subregister or equal to\n\/\/\/ a register contained in \\p Regs.\nstatic void removeRegsFromMap(Reg2MIMap &Map, const RegList &Regs,\n                              const TargetRegisterInfo &TRI) {\n  for (unsigned Reg : Regs) {\n    \/\/ Source of copy is no longer available for propagation.\n    for (MCSubRegIterator SR(Reg, &TRI, true); SR.isValid(); ++SR)\n      Map.erase(*SR);\n  }\n}\n\n\/\/\/ Remove any entry in \\p Map that is marked clobbered in \\p RegMask.\n\/\/\/ The map will typically have a lot fewer entries than the regmask clobbers,\n\/\/\/ so this is more efficient than iterating the clobbered registers and calling\n\/\/\/ ClobberRegister() on them.\nstatic void removeClobberedRegsFromMap(Reg2MIMap &Map,\n                                       const MachineOperand &RegMask) {\n  for (Reg2MIMap::iterator I = Map.begin(), E = Map.end(), Next; I != E;\n       I = Next) {\n    Next = std::next(I);\n    unsigned Reg = I->first;\n    if (RegMask.clobbersPhysReg(Reg))\n      Map.erase(I);\n  }\n}\n\nvoid MachineCopyPropagation::ClobberRegister(unsigned Reg) {\n  for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI) {\n    CopyMap.erase(*AI);\n    AvailCopyMap.erase(*AI);\n\n    SourceMap::iterator SI = SrcMap.find(*AI);\n    if (SI != SrcMap.end()) {\n      removeRegsFromMap(AvailCopyMap, SI->second, *TRI);\n      SrcMap.erase(SI);\n    }\n  }\n}\n\nvoid MachineCopyPropagation::ReadRegister(unsigned Reg) {\n  \/\/ If 'Reg' is defined by a copy, the copy is no longer a candidate\n  \/\/ for elimination.\n  for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI) {\n    Reg2MIMap::iterator CI = CopyMap.find(*AI);\n    if (CI != CopyMap.end()) {\n      DEBUG(dbgs() << \"MCP: Copy is used - not dead: \"; CI->second->dump());\n      MaybeDeadCopies.remove(CI->second);\n    }\n  }\n}\n\n\/\/\/ Return true if \\p PreviousCopy did copy register \\p Src to register \\p Def.\n\/\/\/ This fact may have been obscured by sub register usage or may not be true at\n\/\/\/ all even though Src and Def are subregisters of the registers used in\n\/\/\/ PreviousCopy. e.g.\n\/\/\/ isNopCopy(\"ecx = COPY eax\", AX, CX) == true\n\/\/\/ isNopCopy(\"ecx = COPY eax\", AH, CL) == false\nstatic bool isNopCopy(const MachineInstr &PreviousCopy, unsigned Src,\n                      unsigned Def, const TargetRegisterInfo *TRI) {\n  unsigned PreviousSrc = PreviousCopy.getOperand(1).getReg();\n  unsigned PreviousDef = PreviousCopy.getOperand(0).getReg();\n  if (Src == PreviousSrc) {\n    assert(Def == PreviousDef);\n    return true;\n  }\n  if (!TRI->isSubRegister(PreviousSrc, Src))\n    return false;\n  unsigned SubIdx = TRI->getSubRegIndex(PreviousSrc, Src);\n  return SubIdx == TRI->getSubRegIndex(PreviousDef, Def);\n}\n\n\/\/\/ Remove instruction \\p Copy if there exists a previous copy that copies the\n\/\/\/ register \\p Src to the register \\p Def; This may happen indirectly by\n\/\/\/ copying the super registers.\nbool MachineCopyPropagation::eraseIfRedundant(MachineInstr &Copy, unsigned Src,\n                                              unsigned Def) {\n  \/\/ Avoid eliminating a copy from\/to a reserved registers as we cannot predict\n  \/\/ the value (Example: The sparc zero register is writable but stays zero).\n  if (MRI->isReserved(Src) || MRI->isReserved(Def))\n    return false;\n\n  \/\/ Search for an existing copy.\n  Reg2MIMap::iterator CI = AvailCopyMap.find(Def);\n  if (CI == AvailCopyMap.end())\n    return false;\n\n  \/\/ Check that the existing copy uses the correct sub registers.\n  MachineInstr &PrevCopy = *CI->second;\n  if (!isNopCopy(PrevCopy, Src, Def, TRI))\n    return false;\n\n  DEBUG(dbgs() << \"MCP: copy is a NOP, removing: \"; Copy.dump());\n\n  \/\/ Copy was redundantly redefining either Src or Def. Remove earlier kill\n  \/\/ flags between Copy and PrevCopy because the value will be reused now.\n  assert(Copy.isCopy());\n  unsigned CopyDef = Copy.getOperand(0).getReg();\n  assert(CopyDef == Src || CopyDef == Def);\n  for (MachineInstr &MI :\n       make_range(PrevCopy.getIterator(), Copy.getIterator()))\n    MI.clearRegisterKills(CopyDef, TRI);\n\n  Copy.eraseFromParent();\n  Changed = true;\n  ++NumDeletes;\n  return true;\n}\n\nvoid MachineCopyPropagation::CopyPropagateBlock(MachineBasicBlock &MBB) {\n  DEBUG(dbgs() << \"MCP: CopyPropagateBlock \" << MBB.getName() << \"\\n\");\n\n  for (MachineBasicBlock::iterator I = MBB.begin(), E = MBB.end(); I != E; ) {\n    MachineInstr *MI = &*I;\n    ++I;\n\n    if (MI->isCopy()) {\n      unsigned Def = MI->getOperand(0).getReg();\n      unsigned Src = MI->getOperand(1).getReg();\n\n      assert(!TargetRegisterInfo::isVirtualRegister(Def) &&\n             !TargetRegisterInfo::isVirtualRegister(Src) &&\n             \"MachineCopyPropagation should be run after register allocation!\");\n\n      \/\/ The two copies cancel out and the source of the first copy\n      \/\/ hasn't been overridden, eliminate the second one. e.g.\n      \/\/  %ECX<def> = COPY %EAX\n      \/\/  ... nothing clobbered EAX.\n      \/\/  %EAX<def> = COPY %ECX\n      \/\/ =>\n      \/\/  %ECX<def> = COPY %EAX\n      \/\/\n      \/\/ or\n      \/\/\n      \/\/  %ECX<def> = COPY %EAX\n      \/\/  ... nothing clobbered EAX.\n      \/\/  %ECX<def> = COPY %EAX\n      \/\/ =>\n      \/\/  %ECX<def> = COPY %EAX\n      if (eraseIfRedundant(*MI, Def, Src) || eraseIfRedundant(*MI, Src, Def))\n        continue;\n\n      \/\/ If Src is defined by a previous copy, the previous copy cannot be\n      \/\/ eliminated.\n      ReadRegister(Src);\n      for (const MachineOperand &MO : MI->implicit_operands()) {\n        if (!MO.isReg() || !MO.readsReg())\n          continue;\n        unsigned Reg = MO.getReg();\n        if (!Reg)\n          continue;\n        ReadRegister(Reg);\n      }\n\n      DEBUG(dbgs() << \"MCP: Copy is a deletion candidate: \"; MI->dump());\n\n      \/\/ Copy is now a candidate for deletion.\n      if (!MRI->isReserved(Def))\n        MaybeDeadCopies.insert(MI);\n\n      \/\/ If 'Def' is previously source of another copy, then this earlier copy's\n      \/\/ source is no longer available. e.g.\n      \/\/ %xmm9<def> = copy %xmm2\n      \/\/ ...\n      \/\/ %xmm2<def> = copy %xmm0\n      \/\/ ...\n      \/\/ %xmm2<def> = copy %xmm9\n      ClobberRegister(Def);\n      for (const MachineOperand &MO : MI->implicit_operands()) {\n        if (!MO.isReg() || !MO.isDef())\n          continue;\n        unsigned Reg = MO.getReg();\n        if (!Reg)\n          continue;\n        ClobberRegister(Reg);\n      }\n\n      \/\/ Remember Def is defined by the copy.\n      for (MCSubRegIterator SR(Def, TRI, \/*IncludeSelf=*\/true); SR.isValid();\n           ++SR) {\n        CopyMap[*SR] = MI;\n        AvailCopyMap[*SR] = MI;\n      }\n\n      \/\/ Remember source that's copied to Def. Once it's clobbered, then\n      \/\/ it's no longer available for copy propagation.\n      RegList &DestList = SrcMap[Src];\n      if (!is_contained(DestList, Def))\n        DestList.push_back(Def);\n\n      continue;\n    }\n\n    \/\/ Not a copy.\n    SmallVector<unsigned, 2> Defs;\n    const MachineOperand *RegMask = nullptr;\n    for (const MachineOperand &MO : MI->operands()) {\n      if (MO.isRegMask())\n        RegMask = &MO;\n      if (!MO.isReg())\n        continue;\n      unsigned Reg = MO.getReg();\n      if (!Reg)\n        continue;\n\n      assert(!TargetRegisterInfo::isVirtualRegister(Reg) &&\n             \"MachineCopyPropagation should be run after register allocation!\");\n\n      if (MO.isDef()) {\n        Defs.push_back(Reg);\n      } else {\n        ReadRegister(Reg);\n      }\n      \/\/ Treat undef use like defs for copy propagation but not for\n      \/\/ dead copy. We would need to do a liveness check to be sure the copy\n      \/\/ is dead for undef uses.\n      \/\/ The backends are allowed to do whatever they want with undef value\n      \/\/ and we cannot be sure this register will not be rewritten to break\n      \/\/ some false dependencies for the hardware for instance.\n      if (MO.isUndef())\n        Defs.push_back(Reg);\n    }\n\n    \/\/ The instruction has a register mask operand which means that it clobbers\n    \/\/ a large set of registers.  Treat clobbered registers the same way as\n    \/\/ defined registers.\n    if (RegMask) {\n      \/\/ Erase any MaybeDeadCopies whose destination register is clobbered.\n      for (SmallSetVector<MachineInstr *, 8>::iterator DI =\n               MaybeDeadCopies.begin();\n           DI != MaybeDeadCopies.end();) {\n        MachineInstr *MaybeDead = *DI;\n        unsigned Reg = MaybeDead->getOperand(0).getReg();\n        assert(!MRI->isReserved(Reg));\n\n        if (!RegMask->clobbersPhysReg(Reg)) {\n          ++DI;\n          continue;\n        }\n\n        DEBUG(dbgs() << \"MCP: Removing copy due to regmask clobbering: \";\n              MaybeDead->dump());\n\n        \/\/ erase() will return the next valid iterator pointing to the next\n        \/\/ element after the erased one.\n        DI = MaybeDeadCopies.erase(DI);\n        MaybeDead->eraseFromParent();\n        Changed = true;\n        ++NumDeletes;\n      }\n\n      removeClobberedRegsFromMap(AvailCopyMap, *RegMask);\n      removeClobberedRegsFromMap(CopyMap, *RegMask);\n      for (SourceMap::iterator I = SrcMap.begin(), E = SrcMap.end(), Next;\n           I != E; I = Next) {\n        Next = std::next(I);\n        if (RegMask->clobbersPhysReg(I->first)) {\n          removeRegsFromMap(AvailCopyMap, I->second, *TRI);\n          SrcMap.erase(I);\n        }\n      }\n    }\n\n    \/\/ Any previous copy definition or reading the Defs is no longer available.\n    for (unsigned Reg : Defs)\n      ClobberRegister(Reg);\n  }\n\n  \/\/ If MBB doesn't have successors, delete the copies whose defs are not used.\n  \/\/ If MBB does have successors, then conservative assume the defs are live-out\n  \/\/ since we don't want to trust live-in lists.\n  if (MBB.succ_empty()) {\n    for (MachineInstr *MaybeDead : MaybeDeadCopies) {\n      assert(!MRI->isReserved(MaybeDead->getOperand(0).getReg()));\n      MaybeDead->eraseFromParent();\n      Changed = true;\n      ++NumDeletes;\n    }\n  }\n\n  MaybeDeadCopies.clear();\n  AvailCopyMap.clear();\n  CopyMap.clear();\n  SrcMap.clear();\n}\n\nbool MachineCopyPropagation::runOnMachineFunction(MachineFunction &MF) {\n  if (skipFunction(*MF.getFunction()))\n    return false;\n\n  Changed = false;\n\n  TRI = MF.getSubtarget().getRegisterInfo();\n  TII = MF.getSubtarget().getInstrInfo();\n  MRI = &MF.getRegInfo();\n\n  for (MachineBasicBlock &MBB : MF)\n    CopyPropagateBlock(MBB);\n\n  return Changed;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"ParameterList.h\"\n#include <EEPROM.h>\n\nstatic ParameterList* instanceParam;\nint paramValues[150];\n\nParameterList * ParameterList::getInstance() {\n        if (!instanceParam) {\n                instanceParam = new ParameterList();\n        };\n        return instanceParam;\n}\n\nParameterList::ParameterList() {\n\n\tint paramVersion = readValueEeprom(0);\n\tif (paramVersion == 0) {\n\t\tsetAllValuesToDefault();\n\t\twriteAllValuesToEeprom();\n\t} else {\n\t\treadAllValuesFromEeprom();\n\t}\n}\n\nbool ParameterList::validParam(int id) {\n\n\t\/\/ Check if the id is a valid one\n\tswitch(id)\n\t{\n\t\tcase PARAM_VERSION:\n\t\tcase MOVEMENT_TIMEOUT_X:\n\t\tcase MOVEMENT_TIMEOUT_Y:\n\t\tcase MOVEMENT_TIMEOUT_Z:\n\t\tcase MOVEMENT_INVERT_ENDPOINTS_X:\n\t\tcase MOVEMENT_INVERT_ENDPOINTS_Y:\n\t\tcase MOVEMENT_INVERT_ENDPOINTS_Z:\n\t\tcase MOVEMENT_INVERT_MOTOR_X:\n\t\tcase MOVEMENT_INVERT_MOTOR_Y:\n\t\tcase MOVEMENT_INVERT_MOTOR_Z:\n\t\tcase MOVEMENT_STEPS_ACC_DEC_X:\n\t\tcase MOVEMENT_STEPS_ACC_DEC_Y:\n\t\tcase MOVEMENT_STEPS_ACC_DEC_Z:\n\t\tcase MOVEMENT_HOME_UP_X:\n\t\tcase MOVEMENT_HOME_UP_Y:\n\t\tcase MOVEMENT_HOME_UP_Z:\n\t\tcase MOVEMENT_MIN_SPD_X:\n\t\tcase MOVEMENT_MIN_SPD_Y:\n\t\tcase MOVEMENT_MIN_SPD_Z:\n\t\tcase MOVEMENT_MAX_SPD_X:\n\t\tcase MOVEMENT_MAX_SPD_Y:\n\t\tcase MOVEMENT_MAX_SPD_Z:\n\t\tcase ENCODER_ENABLED_X:\n\t\tcase ENCODER_ENABLED_Y:\n\t\tcase ENCODER_ENABLED_Z:\n\t\tcase ENCODER_MISSED_STEPS_MAX_X:\n\t\tcase ENCODER_MISSED_STEPS_MAX_Y:\n\t\tcase ENCODER_MISSED_STEPS_MAX_Z:\n\t\tcase ENCODER_MISSED_STEPS_DECAY_X:\n\t\tcase ENCODER_MISSED_STEPS_DECAY_Y:\n\t\tcase ENCODER_MISSED_STEPS_DECAY_Z:\n\t\t\treturn true;\n\t\tdefault:\n\t\t\treturn false;\n\t}\n\n}\n\nint ParameterList::writeValue(int id, int value) {\n\n\t\/\/ Check if the value is a valid parameter\n\tif (validParam(id)) {\n\t\t\/\/ Store the value in memory\n\t\tparamValues[id] = value;\n\t\twriteValueEeprom(id, value);\n\t} else  {\n\t\tSerial.print(\"R99 Error: invalid parameter id\\n\");\n\t}\n\n\t\/\/ Debugging output\n\tSerial.print(\"R99\");\n\tSerial.print(\" \");\n\tSerial.print(\"writeValue\");\n\tSerial.print(\" \");\n\tSerial.print(\"P\");\n\tSerial.print(\" \");\n\tSerial.print(id);\n\tSerial.print(\" \");\n\tSerial.print(\"V\");\n\tSerial.print(\" \");\n\tSerial.print(value);\n\tSerial.print(\"\\n\");\n\n\n\treturn 0;\n}\n\nint ParameterList::readValue(int id) {\n\n\t\/\/ Check if the value is an existing parameter\n\tif (validParam(id)) {\n\t\t\/\/ Retrieve the value from memory\n\t\tint value =  paramValues[id];\n\n\t\t\/\/ Send to the raspberrt pi\n\t\tSerial.print(\"R21\");\n\t\tSerial.print(\" \");\n\t\tSerial.print(\"P\");\n\t\tSerial.print(id);\n\t\tSerial.print(\" \");\n\t\tSerial.print(\"V\");\n\t\tSerial.print(value);\n\t\tSerial.print(\"\\n\");\n\t} else  {\n\t\tSerial.print(\"R99 Error: invalid parameter id\\n\");\n\t}\n\n\treturn 0;\n}\n\n\nint ParameterList::getValue(int id) {\n\n\t\/*\n\tSerial.print(\"R99\");\n\tSerial.print(\" \");\n\tSerial.print(\"getValue\");\n\tSerial.print(\" id \");\n\t\tSerial.print(id);\n\tSerial.print(\" value \");\n\tSerial.print(paramValues[id]);\n\tSerial.print(\"\\n\");\n\t*\/\n\n\treturn  paramValues[id];\n}\n\nint ParameterList::readValueEeprom(int id) {\n\n\t\/\/ Assume all values are ints\n\tint address = id * 2;\n\n\t\/\/Read the 2 bytes from the eeprom memory.\n\tlong two = EEPROM.read(address);\n\tlong one = EEPROM.read(address + 1);\n\n\t\/\/Return the recomposed long by using bitshift.\n\treturn ((two << 0) & 0xFF) + ((one << 8) & 0xFFFF);\n}\n\nint ParameterList::writeValueEeprom(int id, int value) {\n\n\t\/\/ Assume all values are ints\n\tint address = id * 2;\n\n\t\/\/Decomposition from a int to 2 bytes by using bitshift.\n\t\/\/One = Most significant -> Two = Least significant byte\n\tbyte two = (value        & 0xFF);\n\tbyte one = ((value >> 8) & 0xFF);\n\n\t\/\/Write the 4 bytes into the eeprom memory.\n\tEEPROM.write(address    , two);\n\tEEPROM.write(address + 1, one);\n\n\treturn 0;\n}\n\nint ParameterList::setAllValuesToDefault() {\n\n\tSerial.print(\"R99 Setting all to default\\n\");\n\n\t\/\/ Copy default values to the memory values\n\tfor (int i; i < 150; i++)\n\t{\n\n\t\t\/\/paramValues[i] = \n\t\tif (validParam(i)) {\n\t\t\tloadDefaultValue(i);\n\t\t}\n\n\t\t\/*\n\t\tif (validParam(i)) {\n\t\t\tSerial.print(\"R99\");\n\t\t\tSerial.print(\" \");\n\t\t\tSerial.print(\"get default value\");\n\t\t\tSerial.print(\" id \");\n\t\t\tSerial.print(i);\n\t\t\tSerial.print(\" value \");\n\t\t\tSerial.print(paramValues[i]);\n\t\t\tSerial.print(\"\\n\");\n\t\t}\n\t\t*\/\n\t}\n\n\tSerial.print(\"R99 Setting all to default done\\n\");\n\n}\n\nvoid ParameterList::loadDefaultValue(int id) {\n\n\tswitch(id)\n\t{\n\t\tcase PARAM_VERSION                : paramValues[id] = PARAM_VERSION_DEFAULT; break;\n\t\tcase PARAM_TEST                   : paramValues[id] = PARAM_TEST_DEFAULT; break;\n\n        \tcase MOVEMENT_TIMEOUT_X           : paramValues[id] = MOVEMENT_TIMEOUT_X_DEFAULT; break;\n        \tcase MOVEMENT_TIMEOUT_Y           : paramValues[id] = MOVEMENT_TIMEOUT_Y_DEFAULT; break;\n\t        case MOVEMENT_TIMEOUT_Z           : paramValues[id] = MOVEMENT_TIMEOUT_Z_DEFAULT; break;\n\n\t        case MOVEMENT_INVERT_ENDPOINTS_X  : paramValues[id] = MOVEMENT_INVERT_ENDPOINTS_X_DEFAULT; break;\n\t        case MOVEMENT_INVERT_ENDPOINTS_Y  : paramValues[id] = MOVEMENT_INVERT_ENDPOINTS_Y_DEFAULT; break;\n\t        case MOVEMENT_INVERT_ENDPOINTS_Z  : paramValues[id] = MOVEMENT_INVERT_ENDPOINTS_Z_DEFAULT; break;\n\n\t        case MOVEMENT_INVERT_MOTOR_X      : paramValues[id] = MOVEMENT_INVERT_MOTOR_X_DEFAULT; break;\n\t        case MOVEMENT_INVERT_MOTOR_Y      : paramValues[id] = MOVEMENT_INVERT_MOTOR_Y_DEFAULT; break;\n\t        case MOVEMENT_INVERT_MOTOR_Z      : paramValues[id] = MOVEMENT_INVERT_MOTOR_Z_DEFAULT; break;\n\n\t        case MOVEMENT_STEPS_ACC_DEC_X     : paramValues[id] = MOVEMENT_STEPS_ACC_DEC_X_DEFAULT; break;\n\t        case MOVEMENT_STEPS_ACC_DEC_Y     : paramValues[id] = MOVEMENT_STEPS_ACC_DEC_Y_DEFAULT; break;\n\t        case MOVEMENT_STEPS_ACC_DEC_Z     : paramValues[id] = MOVEMENT_STEPS_ACC_DEC_Z_DEFAULT; break;\n\n\t        case MOVEMENT_HOME_UP_X           : paramValues[id] = MOVEMENT_HOME_UP_X_DEFAULT; break;\n\t        case MOVEMENT_HOME_UP_Y           : paramValues[id] = MOVEMENT_HOME_UP_Y_DEFAULT; break;\n\t        case MOVEMENT_HOME_UP_Z           : paramValues[id] = MOVEMENT_HOME_UP_Z_DEFAULT; break;\n\n\t        case MOVEMENT_MIN_SPD_X           : paramValues[id] = MOVEMENT_MIN_SPD_X_DEFAULT; break;\n\t        case MOVEMENT_MIN_SPD_Y           : paramValues[id] = MOVEMENT_MIN_SPD_Y_DEFAULT; break;\n\t        case MOVEMENT_MIN_SPD_Z           : paramValues[id] = MOVEMENT_MIN_SPD_Z_DEFAULT; break;\n\n\t        case MOVEMENT_MAX_SPD_X           : paramValues[id] = MOVEMENT_MAX_SPD_X_DEFAULT; break;\n\t        case MOVEMENT_MAX_SPD_Y           : paramValues[id] = MOVEMENT_MAX_SPD_Y_DEFAULT; break;\n\t        case MOVEMENT_MAX_SPD_Z           : paramValues[id] = MOVEMENT_MAX_SPD_Z_DEFAULT; break;\n\n\t        case ENCODER_ENABLED_X            : paramValues[id] = ENCODER_ENABLED_X_DEFAULT; break;\n\t        case ENCODER_ENABLED_Y            : paramValues[id] = ENCODER_ENABLED_Y_DEFAULT; break;\n\t        case ENCODER_ENABLED_Z            : paramValues[id] = ENCODER_ENABLED_Z_DEFAULT; break;\n\n\t        case ENCODER_MISSED_STEPS_MAX_X   : paramValues[id] = ENCODER_MISSED_STEPS_MAX_X_DEFAULT; break;\n\t        case ENCODER_MISSED_STEPS_MAX_Y   : paramValues[id] = ENCODER_MISSED_STEPS_MAX_Y_DEFAULT; break;\n\t        case ENCODER_MISSED_STEPS_MAX_Z   : paramValues[id] = ENCODER_MISSED_STEPS_MAX_Z_DEFAULT; break;\n\n\t        case ENCODER_MISSED_STEPS_DECAY_X : paramValues[id] = ENCODER_MISSED_STEPS_DECAY_X_DEFAULT; break;\n\t        case ENCODER_MISSED_STEPS_DECAY_Y : paramValues[id] = ENCODER_MISSED_STEPS_DECAY_Y_DEFAULT; break;\n\t        case ENCODER_MISSED_STEPS_DECAY_Z : paramValues[id] = ENCODER_MISSED_STEPS_DECAY_Z_DEFAULT; break;\n\n\t\tdefault : paramValues[id] = 0; break;\n\t}\n\/*\n\tif (validParam(id)) {\n\n\t\tSerial.print(\"R99\");\n\t\tSerial.print(\" \");\n\t\tSerial.print(\"get default value\");\n\t\tSerial.print(\" id \");\n\t\tSerial.print(id);\n\t\tSerial.print(\" value \");\n\t\tSerial.print(value);\n\t\tSerial.print(\"\\n\");\n\t}\n*\/\n\t\/\/return 0;\n}\n\n\nint ParameterList::readAllValues() {\n\n\n\t\/\/Serial.print(\"R99 A \\n\");\n\n\t\/\/setAllValuesToDefault();\n\n\t\/\/Serial.print(\"R99 AA \\n\");\n\n\t\/\/writeAllValuesToEeprom();\n\t\/\/readAllValuesFromEeprom();\n\n\t\/\/Serial.print(\"R99 B \\n\");\n\n\t\/\/ Make a dump of all values\n\t\/\/ Check if it's a valid value to keep the junk out of the list\n\tfor (int i; i < 150; i++)\n\t{\n\t\tif (validParam(i)) {\n\t\t\treadValue(i);\n\t\t}\n\t}\n\n\t\/\/Serial.print(\"R99 C \\n\");\n}\n\nint ParameterList::readAllValuesFromEeprom() {\n\t\/\/ Write all existing values to eeprom\n\tfor (int i; i < 150; i++)\n\t{\n\t\tif (validParam(i)) {\n\t\t\tparamValues[i] = readValueEeprom(i);\n\n\t\t}\n\t}\n}\n\nint ParameterList::writeAllValuesToEeprom() {\n\t\/\/ Write all existing values to eeprom\n\tfor (int i; i < 150; i++)\n\t{\n\t\tif (validParam(i)) {\n\t\t\twriteValueEeprom(i,paramValues[i]);\n\t\t}\n\t}\n}\n\n\n<commit_msg>cleaning up<commit_after>#include \"ParameterList.h\"\n#include <EEPROM.h>\n\nstatic ParameterList* instanceParam;\nint paramValues[150];\n\nParameterList * ParameterList::getInstance() {\n        if (!instanceParam) {\n                instanceParam = new ParameterList();\n        };\n        return instanceParam;\n}\n\nParameterList::ParameterList() {\n\t\/\/ at the first boot, load default parameters and set the parameter version\n\t\/\/ so during subsequent boots the values are just loaded from eeprom \n\tint paramVersion = readValueEeprom(0);\n\tif (paramVersion == 0) {\n\t\tsetAllValuesToDefault();\n\t\twriteAllValuesToEeprom();\n\t} else {\n\t\treadAllValuesFromEeprom();\n\t}\n}\n\n\/\/ ===== Interfce functions for the raspberry pi =====\n\nint ParameterList::readValue(int id) {\n\n\t\/\/ Check if the value is an existing parameter\n\tif (validParam(id)) {\n\t\t\/\/ Retrieve the value from memory\n\t\tint value =  paramValues[id];\n\n\t\t\/\/ Send to the raspberrt pi\n\t\tSerial.print(\"R21\");\n\t\tSerial.print(\" \");\n\t\tSerial.print(\"P\");\n\t\tSerial.print(id);\n\t\tSerial.print(\" \");\n\t\tSerial.print(\"V\");\n\t\tSerial.print(value);\n\t\tSerial.print(\"\\n\");\n\t} else  {\n\t\tSerial.print(\"R99 Error: invalid parameter id\\n\");\n\t}\n\n\treturn 0;\n}\n\nint ParameterList::writeValue(int id, int value) {\n\n\t\/\/ Check if the value is a valid parameter\n\tif (validParam(id)) {\n\t\t\/\/ Store the value in memory\n\t\tparamValues[id] = value;\n\t\twriteValueEeprom(id, value);\n\t} else  {\n\t\tSerial.print(\"R99 Error: invalid parameter id\\n\");\n\t}\n\n\t\/\/ Debugging output\n\tSerial.print(\"R99\");\n\tSerial.print(\" \");\n\tSerial.print(\"writeValue\");\n\tSerial.print(\" \");\n\tSerial.print(\"P\");\n\tSerial.print(\" \");\n\tSerial.print(id);\n\tSerial.print(\" \");\n\tSerial.print(\"V\");\n\tSerial.print(\" \");\n\tSerial.print(value);\n\tSerial.print(\"\\n\");\n\n\treturn 0;\n}\n\nint ParameterList::readAllValues() {\n\n\t\/\/ Make a dump of all values\n\t\/\/ Check if it's a valid value to keep the junk out of the list\n\tfor (int i; i < 150; i++)\n\t{\n\t\tif (validParam(i)) {\n\t\t\treadValue(i);\n\t\t}\n\t}\n}\n\nint ParameterList::getValue(int id) {\n\treturn  paramValues[id];\n}\n\n\/\/ ===== eeprom handling ====\n\nint ParameterList::readValueEeprom(int id) {\n\n\t\/\/ Assume all values are ints and calculate address for that\n\tint address = id * 2;\n\n\t\/\/Read the 2 bytes from the eeprom memory.\n\tlong two = EEPROM.read(address);\n\tlong one = EEPROM.read(address + 1);\n\n\t\/\/Return the recomposed long by using bitshift.\n\treturn ((two << 0) & 0xFF) + ((one << 8) & 0xFFFF);\n}\n\nint ParameterList::writeValueEeprom(int id, int value) {\n\n\t\/\/ Assume all values are ints and calculate address for that\n\tint address = id * 2;\n\n\t\/\/Decomposition from a int to 2 bytes by using bitshift.\n\t\/\/One = Most significant -> Two = Least significant byte\n\tbyte two = (value        & 0xFF);\n\tbyte one = ((value >> 8) & 0xFF);\n\n\t\/\/Write the 4 bytes into the eeprom memory.\n\tEEPROM.write(address    , two);\n\tEEPROM.write(address + 1, one);\n\n\treturn 0;\n}\n\nint ParameterList::readAllValuesFromEeprom() {\n\t\/\/ Write all existing values to eeprom\n\tfor (int i; i < 150; i++)\n\t{\n\t\tif (validParam(i)) {\n\t\t\tparamValues[i] = readValueEeprom(i);\n\n\t\t}\n\t}\n}\n\nint ParameterList::writeAllValuesToEeprom() {\n\t\/\/ Write all existing values to eeprom\n\tfor (int i; i < 150; i++)\n\t{\n\t\tif (validParam(i)) {\n\t\t\twriteValueEeprom(i,paramValues[i]);\n\t\t}\n\t}\n}\n\n\/\/ ==== parameter valdation and defaults\n\nint ParameterList::setAllValuesToDefault() {\n\t\/\/ Copy default values to the memory values\n\tfor (int i; i < 150; i++)\n\t{\n\t\tif (validParam(i)) {\n\t\t\tloadDefaultValue(i);\n\t\t}\n\t}\n}\n\nvoid ParameterList::loadDefaultValue(int id) {\n\n\tswitch(id)\n\t{\n\t\tcase PARAM_VERSION                : paramValues[id] = PARAM_VERSION_DEFAULT; break;\n\t\tcase PARAM_TEST                   : paramValues[id] = PARAM_TEST_DEFAULT; break;\n\n        \tcase MOVEMENT_TIMEOUT_X           : paramValues[id] = MOVEMENT_TIMEOUT_X_DEFAULT; break;\n        \tcase MOVEMENT_TIMEOUT_Y           : paramValues[id] = MOVEMENT_TIMEOUT_Y_DEFAULT; break;\n\t        case MOVEMENT_TIMEOUT_Z           : paramValues[id] = MOVEMENT_TIMEOUT_Z_DEFAULT; break;\n\n\t        case MOVEMENT_INVERT_ENDPOINTS_X  : paramValues[id] = MOVEMENT_INVERT_ENDPOINTS_X_DEFAULT; break;\n\t        case MOVEMENT_INVERT_ENDPOINTS_Y  : paramValues[id] = MOVEMENT_INVERT_ENDPOINTS_Y_DEFAULT; break;\n\t        case MOVEMENT_INVERT_ENDPOINTS_Z  : paramValues[id] = MOVEMENT_INVERT_ENDPOINTS_Z_DEFAULT; break;\n\n\t        case MOVEMENT_INVERT_MOTOR_X      : paramValues[id] = MOVEMENT_INVERT_MOTOR_X_DEFAULT; break;\n\t        case MOVEMENT_INVERT_MOTOR_Y      : paramValues[id] = MOVEMENT_INVERT_MOTOR_Y_DEFAULT; break;\n\t        case MOVEMENT_INVERT_MOTOR_Z      : paramValues[id] = MOVEMENT_INVERT_MOTOR_Z_DEFAULT; break;\n\n\t        case MOVEMENT_STEPS_ACC_DEC_X     : paramValues[id] = MOVEMENT_STEPS_ACC_DEC_X_DEFAULT; break;\n\t        case MOVEMENT_STEPS_ACC_DEC_Y     : paramValues[id] = MOVEMENT_STEPS_ACC_DEC_Y_DEFAULT; break;\n\t        case MOVEMENT_STEPS_ACC_DEC_Z     : paramValues[id] = MOVEMENT_STEPS_ACC_DEC_Z_DEFAULT; break;\n\n\t        case MOVEMENT_HOME_UP_X           : paramValues[id] = MOVEMENT_HOME_UP_X_DEFAULT; break;\n\t        case MOVEMENT_HOME_UP_Y           : paramValues[id] = MOVEMENT_HOME_UP_Y_DEFAULT; break;\n\t        case MOVEMENT_HOME_UP_Z           : paramValues[id] = MOVEMENT_HOME_UP_Z_DEFAULT; break;\n\n\t        case MOVEMENT_MIN_SPD_X           : paramValues[id] = MOVEMENT_MIN_SPD_X_DEFAULT; break;\n\t        case MOVEMENT_MIN_SPD_Y           : paramValues[id] = MOVEMENT_MIN_SPD_Y_DEFAULT; break;\n\t        case MOVEMENT_MIN_SPD_Z           : paramValues[id] = MOVEMENT_MIN_SPD_Z_DEFAULT; break;\n\n\t        case MOVEMENT_MAX_SPD_X           : paramValues[id] = MOVEMENT_MAX_SPD_X_DEFAULT; break;\n\t        case MOVEMENT_MAX_SPD_Y           : paramValues[id] = MOVEMENT_MAX_SPD_Y_DEFAULT; break;\n\t        case MOVEMENT_MAX_SPD_Z           : paramValues[id] = MOVEMENT_MAX_SPD_Z_DEFAULT; break;\n\n\t        case ENCODER_ENABLED_X            : paramValues[id] = ENCODER_ENABLED_X_DEFAULT; break;\n\t        case ENCODER_ENABLED_Y            : paramValues[id] = ENCODER_ENABLED_Y_DEFAULT; break;\n\t        case ENCODER_ENABLED_Z            : paramValues[id] = ENCODER_ENABLED_Z_DEFAULT; break;\n\n\t        case ENCODER_MISSED_STEPS_MAX_X   : paramValues[id] = ENCODER_MISSED_STEPS_MAX_X_DEFAULT; break;\n\t        case ENCODER_MISSED_STEPS_MAX_Y   : paramValues[id] = ENCODER_MISSED_STEPS_MAX_Y_DEFAULT; break;\n\t        case ENCODER_MISSED_STEPS_MAX_Z   : paramValues[id] = ENCODER_MISSED_STEPS_MAX_Z_DEFAULT; break;\n\n\t        case ENCODER_MISSED_STEPS_DECAY_X : paramValues[id] = ENCODER_MISSED_STEPS_DECAY_X_DEFAULT; break;\n\t        case ENCODER_MISSED_STEPS_DECAY_Y : paramValues[id] = ENCODER_MISSED_STEPS_DECAY_Y_DEFAULT; break;\n\t        case ENCODER_MISSED_STEPS_DECAY_Z : paramValues[id] = ENCODER_MISSED_STEPS_DECAY_Z_DEFAULT; break;\n\n\t\tdefault : paramValues[id] = 0; break;\n\t}\n}\n\nbool ParameterList::validParam(int id) {\n\n\t\/\/ Check if the id is a valid one\n\tswitch(id)\n\t{\n\t\tcase PARAM_VERSION:\n\t\tcase MOVEMENT_TIMEOUT_X:\n\t\tcase MOVEMENT_TIMEOUT_Y:\n\t\tcase MOVEMENT_TIMEOUT_Z:\n\t\tcase MOVEMENT_INVERT_ENDPOINTS_X:\n\t\tcase MOVEMENT_INVERT_ENDPOINTS_Y:\n\t\tcase MOVEMENT_INVERT_ENDPOINTS_Z:\n\t\tcase MOVEMENT_INVERT_MOTOR_X:\n\t\tcase MOVEMENT_INVERT_MOTOR_Y:\n\t\tcase MOVEMENT_INVERT_MOTOR_Z:\n\t\tcase MOVEMENT_STEPS_ACC_DEC_X:\n\t\tcase MOVEMENT_STEPS_ACC_DEC_Y:\n\t\tcase MOVEMENT_STEPS_ACC_DEC_Z:\n\t\tcase MOVEMENT_HOME_UP_X:\n\t\tcase MOVEMENT_HOME_UP_Y:\n\t\tcase MOVEMENT_HOME_UP_Z:\n\t\tcase MOVEMENT_MIN_SPD_X:\n\t\tcase MOVEMENT_MIN_SPD_Y:\n\t\tcase MOVEMENT_MIN_SPD_Z:\n\t\tcase MOVEMENT_MAX_SPD_X:\n\t\tcase MOVEMENT_MAX_SPD_Y:\n\t\tcase MOVEMENT_MAX_SPD_Z:\n\t\tcase ENCODER_ENABLED_X:\n\t\tcase ENCODER_ENABLED_Y:\n\t\tcase ENCODER_ENABLED_Z:\n\t\tcase ENCODER_MISSED_STEPS_MAX_X:\n\t\tcase ENCODER_MISSED_STEPS_MAX_Y:\n\t\tcase ENCODER_MISSED_STEPS_MAX_Z:\n\t\tcase ENCODER_MISSED_STEPS_DECAY_X:\n\t\tcase ENCODER_MISSED_STEPS_DECAY_Y:\n\t\tcase ENCODER_MISSED_STEPS_DECAY_Z:\n\t\t\treturn true;\n\t\tdefault:\n\t\t\treturn false;\n\t}\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/chips\/centaur\/common\/include\/centaur_misc_constants.H $ *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2016,2017                        *\/\n\/* [+] International Business Machines Corp.                              *\/\n\/*                                                                        *\/\n\/*                                                                        *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\");        *\/\n\/* you may not use this file except in compliance with the License.       *\/\n\/* You may obtain a copy of the License at                                *\/\n\/*                                                                        *\/\n\/*     http:\/\/www.apache.org\/licenses\/LICENSE-2.0                         *\/\n\/*                                                                        *\/\n\/* Unless required by applicable law or agreed to in writing, software    *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS,      *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or        *\/\n\/* implied. See the License for the specific language governing           *\/\n\/* permissions and limitations under the License.                         *\/\n\/*                                                                        *\/\n\/* IBM_PROLOG_END_TAG                                                     *\/\n\/\/\/\n\/\/\/ @file centaur_misc_scom_addresses.H\n\/\/\/ @brief  Defines constants for common used data.\n\/\/\/\n\/\/ *HWP HWP Owner: Peng Fei GOU <shgoupf@cn.ibm.com>\n\/\/ *HWP FW Owner: Thi Tran <thi@us.ibm.com>\n\/\/ *HWP Team: SOA\n\/\/ *HWP Level: 2\n\/\/ *HWP Consumed by: FSP:HB:HS:OCC:SBE:CME:SGPE:PGPE:FPPE:IPPE\n\n#include <p9_const_common.H>\n\n#ifndef __CENTAUR_MISC_CONSTANTS_H\n#define __CENTAUR_MISC_CONSTANTS_H\n\n#define CFAM_STATUS_RESET_DATA  0xFFFFFFFF\n#define CFAM_FSI_GP3_RESET_DATA 0x00000FFB\n#define CFAM_FSI_GP4_RESET_DATA 0x0000C280\n#define CFAM_FSI_GP5_RESET_DATA 0x00000100\n#define CFAM_FSI_GP6_RESET_DATA 0x00000000\n#define CFAM_FSI_GP7_RESET_DATA 0x00000000\n\n#define PERV_GP3_RESET_DATA 0x44166000\n\n#define MAX_FLUSH_LOOPS  100\n#define MAX_REPAIR_POLL_LOOPS  100\n#define SIM_FLUSH_DELAY  20000\n#define NANO_FLUSH_DELAY 10000\n\n#define MULTI_CAST_PATTERN 0x0000000000000078\n#define MULTI_CAST_COMPARE 0x0000000000000068\n#define MULTI_CAST_READ_OP 0x0000000000000047\n#define MULTI_CAST_WAIT_WR 0x000000000000005F\n\n#define SCAN_TP_ARRAY_INIT_REGIONS         0x09000e0000000000\n#define SCAN_TP_REGIONS_EXCEPT_PIB_PCB     0x09e00e0000000000\n#define SCAN_TP_SCAN_SELECTS               0x09e00dce00000000\n#define SCAN_TP_PLL_REGIONS                0x08100E0000000000\n\n#define SCAN_REGION_TP_PLL_GPTR            0x0810020000000000\n#define SCAN_REGION_TP_PLL_BNDY_FUNC       0x0810080800000000\n\n#define SCAN_CLK_ALL_BUT_PLL               0x0FE00E0000000000\n#define SCAN_GPTR_TIME_REP_NO_PLL          0x0FE0023000000000\n#define SCAN_ALL_BUT_VITALPLLGPTRTIME      0x0FE00DCE00000000\n#define SCAN_ALL_BUT_VITALDPLLGPTRTIME     0x0FE00DCE00000000\n#define SCAN_GPTR_TIME_REP                 0x0FF0023000000000\n#define SCAN_ALLSCANEXPRV                  0x0FF00DCE00000000\n#define SCAN_ALLREGIONEXVITAL              0x0FF00E0000000000\n\n#define SCAN_STBY_CHIPLET                  RULL(0x00)\n#define SCAN_CHIPLET_TP                    RULL(0x01)\n#define SCAN_CHIPLET_NEST                  RULL(0x02)\n#define SCAN_CHIPLET_MEM                   RULL(0x03)\n#define SCAN_CHIPLET_GROUP1                RULL(0x69)\n#define SCAN_CHIPLET_GROUP3                RULL(0x6B)\n\n#define CLOCK_START_REGIONS_all            0x4FE00E0000000000\n#define EXPECTED_CC_STATUS_START_all       0x000007FFFFFFFFFF\n\n#define REPAIR_COMMAND_VALIDATION_ENTRIES_DD1             0xFE0 \/\/ control words 0-6\n#define REPAIR_COMMAND_VALIDATION_ENTRIES_DD2             0xFE4 \/\/ control words 0-6,9\n#define REPAIR_COMMAND_VALIDATION_ENTRY_TCN_REFR_TIME_DD2 0x008 \/\/ control word 8\n#define REPAIR_COMMAND_START_ADDRESS                      0x27F\n#define REPAIR_STATUS_POLL_MASK 0xA400038000000000\n#define REPAIR_STATUS_POLL_BUSY1 0xA000000000000000\n#define REPAIR_STATUS_POLL_BUSY2 0x8000000000000000\n\n#define REPAIR_CMD_VALIDATION_ENTRIES      0x010\n#define REPAIR_CMD_START_ADDR              0x27F\n#define REPAIR_ECC_TRAP_MASK               0x0F00300000000000\n#define REPAIR_ECC_TRAP_EXP                0x0000300000000000\n#define REPAIR_STATUS_CHECK_MASK           0xA6FFFF8000000000\n#define REPAIR_STATUS_CHECK_EXP            0x2080000000000000\n#define CLOCK_START_REGIONS_PIBNET         0x46000E0000000000\n#define STRT_CLK_REGION_NSL                0x4FE0060000000000\n#define STRT_CLK_REGION_SL                 0x4FE00E0000000000\n#define EXPECTED_CLK_STATUS                0x0000001FFFFFFFFF\n\n#define EXPECTED_CC_STATUS_START_PIBNET    0xE07FFFFFFFFFFFFF\n\n#endif\n\n<commit_msg>centaur_misc_constants.H -- adjust polling costants for sim<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/chips\/centaur\/common\/include\/centaur_misc_constants.H $ *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2016,2017                        *\/\n\/* [+] International Business Machines Corp.                              *\/\n\/*                                                                        *\/\n\/*                                                                        *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\");        *\/\n\/* you may not use this file except in compliance with the License.       *\/\n\/* You may obtain a copy of the License at                                *\/\n\/*                                                                        *\/\n\/*     http:\/\/www.apache.org\/licenses\/LICENSE-2.0                         *\/\n\/*                                                                        *\/\n\/* Unless required by applicable law or agreed to in writing, software    *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS,      *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or        *\/\n\/* implied. See the License for the specific language governing           *\/\n\/* permissions and limitations under the License.                         *\/\n\/*                                                                        *\/\n\/* IBM_PROLOG_END_TAG                                                     *\/\n\/\/\/\n\/\/\/ @file centaur_misc_scom_addresses.H\n\/\/\/ @brief  Defines constants for common used data.\n\/\/\/\n\/\/ *HWP HWP Owner: Peng Fei GOU <shgoupf@cn.ibm.com>\n\/\/ *HWP FW Owner: Thi Tran <thi@us.ibm.com>\n\/\/ *HWP Team: SOA\n\/\/ *HWP Level: 2\n\/\/ *HWP Consumed by: FSP:HB:HS:OCC:SBE:CME:SGPE:PGPE:FPPE:IPPE\n\n#include <p9_const_common.H>\n\n#ifndef __CENTAUR_MISC_CONSTANTS_H\n#define __CENTAUR_MISC_CONSTANTS_H\n\n#define CFAM_STATUS_RESET_DATA  0xFFFFFFFF\n#define CFAM_FSI_GP3_RESET_DATA 0x00000FFB\n#define CFAM_FSI_GP4_RESET_DATA 0x0000C280\n#define CFAM_FSI_GP5_RESET_DATA 0x00000100\n#define CFAM_FSI_GP6_RESET_DATA 0x00000000\n#define CFAM_FSI_GP7_RESET_DATA 0x00000000\n\n#define PERV_GP3_RESET_DATA 0x44166000\n\n#define MAX_FLUSH_LOOPS  400\n#define MAX_REPAIR_POLL_LOOPS  100\n#define SIM_FLUSH_DELAY  400000\n#define NANO_FLUSH_DELAY 10000\n\n#define MULTI_CAST_PATTERN 0x0000000000000078\n#define MULTI_CAST_COMPARE 0x0000000000000068\n#define MULTI_CAST_READ_OP 0x0000000000000047\n#define MULTI_CAST_WAIT_WR 0x000000000000005F\n\n#define SCAN_TP_ARRAY_INIT_REGIONS         0x09000e0000000000\n#define SCAN_TP_REGIONS_EXCEPT_PIB_PCB     0x09e00e0000000000\n#define SCAN_TP_SCAN_SELECTS               0x09e00dce00000000\n#define SCAN_TP_PLL_REGIONS                0x08100E0000000000\n\n#define SCAN_REGION_TP_PLL_GPTR            0x0810020000000000\n#define SCAN_REGION_TP_PLL_BNDY_FUNC       0x0810080800000000\n\n#define SCAN_CLK_ALL_BUT_PLL               0x0FE00E0000000000\n#define SCAN_GPTR_TIME_REP_NO_PLL          0x0FE0023000000000\n#define SCAN_ALL_BUT_VITALPLLGPTRTIME      0x0FE00DCE00000000\n#define SCAN_ALL_BUT_VITALDPLLGPTRTIME     0x0FE00DCE00000000\n#define SCAN_GPTR_TIME_REP                 0x0FF0023000000000\n#define SCAN_ALLSCANEXPRV                  0x0FF00DCE00000000\n#define SCAN_ALLREGIONEXVITAL              0x0FF00E0000000000\n\n#define SCAN_STBY_CHIPLET                  RULL(0x00)\n#define SCAN_CHIPLET_TP                    RULL(0x01)\n#define SCAN_CHIPLET_NEST                  RULL(0x02)\n#define SCAN_CHIPLET_MEM                   RULL(0x03)\n#define SCAN_CHIPLET_GROUP1                RULL(0x69)\n#define SCAN_CHIPLET_GROUP3                RULL(0x6B)\n\n#define CLOCK_START_REGIONS_all            0x4FE00E0000000000\n#define EXPECTED_CC_STATUS_START_all       0x000007FFFFFFFFFF\n\n#define REPAIR_COMMAND_VALIDATION_ENTRIES_DD1             0xFE0 \/\/ control words 0-6\n#define REPAIR_COMMAND_VALIDATION_ENTRIES_DD2             0xFE4 \/\/ control words 0-6,9\n#define REPAIR_COMMAND_VALIDATION_ENTRY_TCN_REFR_TIME_DD2 0x008 \/\/ control word 8\n#define REPAIR_COMMAND_START_ADDRESS                      0x27F\n#define REPAIR_STATUS_POLL_MASK 0xA400038000000000\n#define REPAIR_STATUS_POLL_BUSY1 0xA000000000000000\n#define REPAIR_STATUS_POLL_BUSY2 0x8000000000000000\n\n#define REPAIR_CMD_VALIDATION_ENTRIES      0x010\n#define REPAIR_CMD_START_ADDR              0x27F\n#define REPAIR_ECC_TRAP_MASK               0x0F00300000000000\n#define REPAIR_ECC_TRAP_EXP                0x0000300000000000\n#define REPAIR_STATUS_CHECK_MASK           0xA6FFFF8000000000\n#define REPAIR_STATUS_CHECK_EXP            0x2080000000000000\n#define CLOCK_START_REGIONS_PIBNET         0x46000E0000000000\n#define STRT_CLK_REGION_NSL                0x4FE0060000000000\n#define STRT_CLK_REGION_SL                 0x4FE00E0000000000\n#define EXPECTED_CLK_STATUS                0x0000001FFFFFFFFF\n\n#define EXPECTED_CC_STATUS_START_PIBNET    0xE07FFFFFFFFFFFFF\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- MipsSERegisterInfo.cpp - MIPS32\/64 Register Information -== -------===\/\/\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 contains the MIPS32\/64 implementation of the TargetRegisterInfo\n\/\/ class.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"MipsSERegisterInfo.h\"\n#include \"Mips.h\"\n#include \"MipsAnalyzeImmediate.h\"\n#include \"MipsMachineFunction.h\"\n#include \"MipsSEInstrInfo.h\"\n#include \"MipsSubtarget.h\"\n#include \"llvm\/ADT\/BitVector.h\"\n#include \"llvm\/ADT\/STLExtras.h\"\n#include \"llvm\/CodeGen\/MachineFrameInfo.h\"\n#include \"llvm\/CodeGen\/MachineFunction.h\"\n#include \"llvm\/CodeGen\/MachineInstrBuilder.h\"\n#include \"llvm\/CodeGen\/MachineRegisterInfo.h\"\n#include \"llvm\/CodeGen\/ValueTypes.h\"\n#include \"llvm\/DebugInfo.h\"\n#include \"llvm\/IR\/Constants.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/IR\/Type.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/ErrorHandling.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Target\/TargetFrameLowering.h\"\n#include \"llvm\/Target\/TargetInstrInfo.h\"\n#include \"llvm\/Target\/TargetMachine.h\"\n#include \"llvm\/Target\/TargetOptions.h\"\n\nusing namespace llvm;\n\nMipsSERegisterInfo::MipsSERegisterInfo(const MipsSubtarget &ST)\n  : MipsRegisterInfo(ST) {}\n\nbool MipsSERegisterInfo::\nrequiresRegisterScavenging(const MachineFunction &MF) const {\n  return true;\n}\n\nbool MipsSERegisterInfo::\nrequiresFrameIndexScavenging(const MachineFunction &MF) const {\n  return true;\n}\n\nconst TargetRegisterClass *\nMipsSERegisterInfo::intRegClass(unsigned Size) const {\n  if (Size == 4)\n    return &Mips::GPR32RegClass;\n\n  assert(Size == 8);\n  return &Mips::GPR64RegClass;\n}\n\nvoid MipsSERegisterInfo::eliminateFI(MachineBasicBlock::iterator II,\n                                     unsigned OpNo, int FrameIndex,\n                                     uint64_t StackSize,\n                                     int64_t SPOffset) const {\n  MachineInstr &MI = *II;\n  MachineFunction &MF = *MI.getParent()->getParent();\n  MachineFrameInfo *MFI = MF.getFrameInfo();\n  MipsFunctionInfo *MipsFI = MF.getInfo<MipsFunctionInfo>();\n\n  const std::vector<CalleeSavedInfo> &CSI = MFI->getCalleeSavedInfo();\n  int MinCSFI = 0;\n  int MaxCSFI = -1;\n\n  if (CSI.size()) {\n    MinCSFI = CSI[0].getFrameIdx();\n    MaxCSFI = CSI[CSI.size() - 1].getFrameIdx();\n  }\n\n  bool EhDataRegFI = MipsFI->isEhDataRegFI(FrameIndex);\n\n  \/\/ The following stack frame objects are always referenced relative to $sp:\n  \/\/  1. Outgoing arguments.\n  \/\/  2. Pointer to dynamically allocated stack space.\n  \/\/  3. Locations for callee-saved registers.\n  \/\/  4. Locations for eh data registers.\n  \/\/ Everything else is referenced relative to whatever register\n  \/\/ getFrameRegister() returns.\n  unsigned FrameReg;\n\n  if ((FrameIndex >= MinCSFI && FrameIndex <= MaxCSFI) || EhDataRegFI)\n    FrameReg = Subtarget.isABI_N64() ? Mips::SP_64 : Mips::SP;\n  else\n    FrameReg = getFrameRegister(MF);\n\n  \/\/ Calculate final offset.\n  \/\/ - There is no need to change the offset if the frame object is one of the\n  \/\/   following: an outgoing argument, pointer to a dynamically allocated\n  \/\/   stack space or a $gp restore location,\n  \/\/ - If the frame object is any of the following, its offset must be adjusted\n  \/\/   by adding the size of the stack:\n  \/\/   incoming argument, callee-saved register location or local variable.\n  bool IsKill = false;\n  int64_t Offset;\n\n  Offset = SPOffset + (int64_t)StackSize;\n  Offset += MI.getOperand(OpNo + 1).getImm();\n\n  DEBUG(errs() << \"Offset     : \" << Offset << \"\\n\" << \"<--------->\\n\");\n\n  \/\/ If MI is not a debug value, make sure Offset fits in the 16-bit immediate\n  \/\/ field.\n  if (!MI.isDebugValue() && !isInt<16>(Offset)) {\n    MachineBasicBlock &MBB = *MI.getParent();\n    DebugLoc DL = II->getDebugLoc();\n    unsigned ADDu = Subtarget.isABI_N64() ? Mips::DADDu : Mips::ADDu;\n    unsigned NewImm;\n    const MipsSEInstrInfo &TII =\n      *static_cast<const MipsSEInstrInfo*>(\n        MBB.getParent()->getTarget().getInstrInfo());\n    unsigned Reg = TII.loadImmediate(Offset, MBB, II, DL, &NewImm);\n    BuildMI(MBB, II, DL, TII.get(ADDu), Reg).addReg(FrameReg)\n      .addReg(Reg, RegState::Kill);\n\n    FrameReg = Reg;\n    Offset = SignExtend64<16>(NewImm);\n    IsKill = true;\n  }\n\n  MI.getOperand(OpNo).ChangeToRegister(FrameReg, false, false, IsKill);\n  MI.getOperand(OpNo + 1).ChangeToImmediate(Offset);\n}\n<commit_msg>[mips][msa] A small refactor to reduce patch noise in my next commit<commit_after>\/\/===-- MipsSERegisterInfo.cpp - MIPS32\/64 Register Information -== -------===\/\/\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 contains the MIPS32\/64 implementation of the TargetRegisterInfo\n\/\/ class.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"MipsSERegisterInfo.h\"\n#include \"Mips.h\"\n#include \"MipsAnalyzeImmediate.h\"\n#include \"MipsMachineFunction.h\"\n#include \"MipsSEInstrInfo.h\"\n#include \"MipsSubtarget.h\"\n#include \"llvm\/ADT\/BitVector.h\"\n#include \"llvm\/ADT\/STLExtras.h\"\n#include \"llvm\/CodeGen\/MachineFrameInfo.h\"\n#include \"llvm\/CodeGen\/MachineFunction.h\"\n#include \"llvm\/CodeGen\/MachineInstrBuilder.h\"\n#include \"llvm\/CodeGen\/MachineRegisterInfo.h\"\n#include \"llvm\/CodeGen\/ValueTypes.h\"\n#include \"llvm\/DebugInfo.h\"\n#include \"llvm\/IR\/Constants.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/IR\/Type.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/ErrorHandling.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Target\/TargetFrameLowering.h\"\n#include \"llvm\/Target\/TargetInstrInfo.h\"\n#include \"llvm\/Target\/TargetMachine.h\"\n#include \"llvm\/Target\/TargetOptions.h\"\n\nusing namespace llvm;\n\nMipsSERegisterInfo::MipsSERegisterInfo(const MipsSubtarget &ST)\n  : MipsRegisterInfo(ST) {}\n\nbool MipsSERegisterInfo::\nrequiresRegisterScavenging(const MachineFunction &MF) const {\n  return true;\n}\n\nbool MipsSERegisterInfo::\nrequiresFrameIndexScavenging(const MachineFunction &MF) const {\n  return true;\n}\n\nconst TargetRegisterClass *\nMipsSERegisterInfo::intRegClass(unsigned Size) const {\n  if (Size == 4)\n    return &Mips::GPR32RegClass;\n\n  assert(Size == 8);\n  return &Mips::GPR64RegClass;\n}\n\nvoid MipsSERegisterInfo::eliminateFI(MachineBasicBlock::iterator II,\n                                     unsigned OpNo, int FrameIndex,\n                                     uint64_t StackSize,\n                                     int64_t SPOffset) const {\n  MachineInstr &MI = *II;\n  MachineFunction &MF = *MI.getParent()->getParent();\n  MachineFrameInfo *MFI = MF.getFrameInfo();\n  MipsFunctionInfo *MipsFI = MF.getInfo<MipsFunctionInfo>();\n\n  const std::vector<CalleeSavedInfo> &CSI = MFI->getCalleeSavedInfo();\n  int MinCSFI = 0;\n  int MaxCSFI = -1;\n\n  if (CSI.size()) {\n    MinCSFI = CSI[0].getFrameIdx();\n    MaxCSFI = CSI[CSI.size() - 1].getFrameIdx();\n  }\n\n  bool EhDataRegFI = MipsFI->isEhDataRegFI(FrameIndex);\n\n  \/\/ The following stack frame objects are always referenced relative to $sp:\n  \/\/  1. Outgoing arguments.\n  \/\/  2. Pointer to dynamically allocated stack space.\n  \/\/  3. Locations for callee-saved registers.\n  \/\/  4. Locations for eh data registers.\n  \/\/ Everything else is referenced relative to whatever register\n  \/\/ getFrameRegister() returns.\n  unsigned FrameReg;\n\n  if ((FrameIndex >= MinCSFI && FrameIndex <= MaxCSFI) || EhDataRegFI)\n    FrameReg = Subtarget.isABI_N64() ? Mips::SP_64 : Mips::SP;\n  else\n    FrameReg = getFrameRegister(MF);\n\n  \/\/ Calculate final offset.\n  \/\/ - There is no need to change the offset if the frame object is one of the\n  \/\/   following: an outgoing argument, pointer to a dynamically allocated\n  \/\/   stack space or a $gp restore location,\n  \/\/ - If the frame object is any of the following, its offset must be adjusted\n  \/\/   by adding the size of the stack:\n  \/\/   incoming argument, callee-saved register location or local variable.\n  bool IsKill = false;\n  int64_t Offset;\n\n  Offset = SPOffset + (int64_t)StackSize;\n  Offset += MI.getOperand(OpNo + 1).getImm();\n\n  DEBUG(errs() << \"Offset     : \" << Offset << \"\\n\" << \"<--------->\\n\");\n\n  \/\/ If MI is not a debug value, make sure Offset fits in the 16-bit immediate\n  \/\/ field.\n  if (!MI.isDebugValue()) {\n    if (!isInt<16>(Offset)) {\n      MachineBasicBlock &MBB = *MI.getParent();\n      DebugLoc DL = II->getDebugLoc();\n      unsigned ADDu = Subtarget.isABI_N64() ? Mips::DADDu : Mips::ADDu;\n      unsigned NewImm;\n      const MipsSEInstrInfo &TII =\n          *static_cast<const MipsSEInstrInfo *>(\n               MBB.getParent()->getTarget().getInstrInfo());\n      unsigned Reg = TII.loadImmediate(Offset, MBB, II, DL, &NewImm);\n      BuildMI(MBB, II, DL, TII.get(ADDu), Reg).addReg(FrameReg)\n        .addReg(Reg, RegState::Kill);\n\n      FrameReg = Reg;\n      Offset = SignExtend64<16>(NewImm);\n      IsKill = true;\n    }\n  }\n\n  MI.getOperand(OpNo).ChangeToRegister(FrameReg, false, false, IsKill);\n  MI.getOperand(OpNo + 1).ChangeToImmediate(Offset);\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>the end of the formula is the closing bracket, fdo#51507<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"sobj.hpp\"\n#include \"nullSobj.hpp\"\n\nnamespace wrd {\n\n    WRD_DEF_ME(sobj)\n\n    me& me::sub(const std::string& name) {\n#pragma clang diagnostic push\n#pragma clang diagnostic ignored \"-Wtautological-undefined-compare\"\n        if (this == nullptr)\n            return nulOf<me>();\n#pragma clang diagnostic pop\n        tstr<me>& ret = _subs[name];\n        if(nul(ret))\n                return nullSobj::get();\n\n        return *ret;\n    }\n}\n<commit_msg>swrd: fix: test got failed because of crash<commit_after>#include \"sobj.hpp\"\n#include \"nullSobj.hpp\"\n\nnamespace wrd {\n\n    WRD_DEF_ME(sobj)\n\n    me& me::sub(const std::string& name) {\n#pragma clang diagnostic push\n#pragma clang diagnostic ignored \"-Wtautological-undefined-compare\"\n        if (this == nullptr)\n            return nulOf<me>();\n#pragma clang diagnostic pop\n        tstr<me>& ret = _subs[name];\n        if(!ret)\n                return nullSobj::get();\n\n        return *ret;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>extern \"C\"{\n#include \"UI.h\"\n#include \"SYSTEM.h\"\n#include \"DISPLAY.h\"\n}\n#include \"..\/fff.h\"\n\n#include <gtest\/gtest.h>\n\n\n\/* SYSTEM.h *\/\nFAKE_VOID_FUNC2(SYSTEM_register_irq, irq_func_t, unsigned int);\n\/* DISPLAY.h *\/\nFAKE_VOID_FUNC0(DISPLAY_init);\nFAKE_VOID_FUNC0(DISPLAY_clear);\nFAKE_VOID_FUNC1(DISPLAY_output, char *);\nFAKE_VALUE_FUNC0(unsigned int, DISPLAY_get_line_capacity);\nFAKE_VALUE_FUNC0(unsigned int, DISPLAY_get_line_insert_index);\n\nFAKE_VOID_FUNC0(button_press_cbk);\n\n\nclass UITests : public testing::Test\n{\npublic:\n\n\tvoid SetUp()\n\t{\n\t\t\/\/ Register resets\n\t\tRESET_FAKES();\n\t\tRESET_HISTORY();\n\t\t\/\/ non default init\n\t\tDISPLAY_get_line_capacity_return_val = 2;\n\t}\n};\n\n\n\n\/* Tests go here *\/\nTEST_F(UITests, init_will_initialise_display)\n{\n\tUI_init();\n\tASSERT_EQ(DISPLAY_init_call_count, 1);\n}\n\nTEST_F(UITests, init_will_register_interrupt_gpio2)\n{\n\tUI_init();\n    ASSERT_EQ(SYSTEM_register_irq_call_count, 1);\n    ASSERT_EQ((void *)SYSTEM_register_irq_arg0_val, (void *)UI_button_irq_handler);\n    ASSERT_EQ(SYSTEM_register_irq_arg1_val, IRQ_GPIO_2);\n}\n\nTEST_F(UITests, when_no_irq_then_missed_irq_counter_zero)\n{\n    ASSERT_EQ(UI_get_missed_irqs(), 0);\n}\n\nTEST_F(UITests, when_one_irq_and_no_handler_then_missed_irq_counter_one)\n{\n\tUI_button_irq_handler();\n    ASSERT_EQ(UI_get_missed_irqs(), 1);\n}\n\nTEST_F(UITests, when_one_irq_and_valid_callback_then_missed_irq_counter_zero)\n{\n\tUI_init();\n\tUI_register_button_cbk(button_press_cbk);\n\tUI_button_irq_handler();\n    ASSERT_EQ(UI_get_missed_irqs(), 0);\n}\n\nTEST_F(UITests, when_one_irq_and_valid_callback_then_callback_called)\n{\n\tUI_register_button_cbk(button_press_cbk);\n\tUI_button_irq_handler();\n\tASSERT_EQ(button_press_cbk_call_count, 1);\n}\n\nTEST_F(UITests, write_line_outputs_lines_to_display)\n{\n\tchar msg[] = \"helloworld\";\n\tUI_write_line(msg);\n\tASSERT_EQ(DISPLAY_output_call_count, 1);\n\tASSERT_EQ(strncmp(DISPLAY_output_arg0_val, msg, 26), 0);\n}\n\nTEST_F(UITests, when_no_empty_lines_write_line_clears_screen_and_outputs_lines_to_display)\n{\n\tDISPLAY_get_line_insert_index_return_val = 2;\n\tchar msg[] = \"helloworld\";\n\n\tUI_write_line(msg);\n\n\tASSERT_EQ(DISPLAY_clear_call_count, 1);\n\tASSERT_EQ(DISPLAY_output_call_count, 1);\n\t\/\/ Check the order of the calls:  Don't care about the first two:\n\t\/\/ DISPLAY_get_line_capacity and DISPLAY_get_line_insert_index\n\tASSERT_EQ(call_history_idx, 4);\n\tASSERT_EQ(call_history[2], (void *) DISPLAY_clear);\n\tASSERT_EQ(call_history[3], (void *) DISPLAY_output);\n}\n\nTEST_F(UITests, when_empty_lines_write_line_doesnt_clear_screen)\n{\n\t\/\/ given\n\tDISPLAY_get_line_insert_index_return_val = 1;\n\tchar msg[] = \"helloworld\";\n\t\/\/ when\n\tUI_write_line(msg);\n\t\/\/ then\n\tASSERT_EQ(DISPLAY_clear_call_count, 0);\n}\n\nTEST_F(UITests, when_string_longer_than_26_then_truncated_string_output)\n{\n\t\/\/ given\n\tchar input[] = \"abcdefghijklmnopqrstuvwxyz0123456789\";\n\tchar expected[] = \"abcdefghijklmnopqrstuvwxyz\";\n\t\/\/ when\n\tUI_write_line(input);\n\t\/\/ then\n\tASSERT_EQ(strncmp(expected, DISPLAY_output_arg0_val, 37), 0);\n}\n\n\n<commit_msg>Update the cpp example to use the new fff header<commit_after>extern \"C\"{\n#include \"UI.h\"\n#include \"SYSTEM.h\"\n#include \"DISPLAY.h\"\n}\n#include \"..\/fff3.h\"\n\n#include <gtest\/gtest.h>\n\n\n\/* SYSTEM.h *\/\nFAKE_VOID_FUNC2(SYSTEM_register_irq, irq_func_t, unsigned int);\n\/* DISPLAY.h *\/\nFAKE_VOID_FUNC0(DISPLAY_init);\nFAKE_VOID_FUNC0(DISPLAY_clear);\nFAKE_VOID_FUNC1(DISPLAY_output, char *);\nFAKE_VALUE_FUNC0(unsigned int, DISPLAY_get_line_capacity);\nFAKE_VALUE_FUNC0(unsigned int, DISPLAY_get_line_insert_index);\n\nFAKE_VOID_FUNC0(button_press_cbk);\n\n\nclass UITests : public testing::Test\n{\npublic:\n\n\tvoid SetUp()\n\t{\n\t\t\/\/ Register resets\n\t\tRESET_FAKES();\n\t\tRESET_HISTORY();\n\t\t\/\/ non default init\n\t\tDISPLAY_get_line_capacity_fake.return_val = 2;\n\t}\n};\n\n\n\n\/* Tests go here *\/\nTEST_F(UITests, init_will_initialise_display)\n{\n\tUI_init();\n\tASSERT_EQ(DISPLAY_init_fake.call_count, 1);\n}\n\nTEST_F(UITests, init_will_register_interrupt_gpio2)\n{\n\tUI_init();\n    ASSERT_EQ(SYSTEM_register_irq_fake.call_count, 1);\n    ASSERT_EQ((void *)SYSTEM_register_irq_fake.arg0_val, (void *)UI_button_irq_handler);\n    ASSERT_EQ(SYSTEM_register_irq_fake.arg1_val, IRQ_GPIO_2);\n}\n\nTEST_F(UITests, when_no_irq_then_missed_irq_counter_zero)\n{\n    ASSERT_EQ(UI_get_missed_irqs(), 0);\n}\n\nTEST_F(UITests, when_one_irq_and_no_handler_then_missed_irq_counter_one)\n{\n\tUI_button_irq_handler();\n    ASSERT_EQ(UI_get_missed_irqs(), 1);\n}\n\nTEST_F(UITests, when_one_irq_and_valid_callback_then_missed_irq_counter_zero)\n{\n\tUI_init();\n\tUI_register_button_cbk(button_press_cbk);\n\tUI_button_irq_handler();\n    ASSERT_EQ(UI_get_missed_irqs(), 0);\n}\n\nTEST_F(UITests, when_one_irq_and_valid_callback_then_callback_called)\n{\n\tUI_register_button_cbk(button_press_cbk);\n\tUI_button_irq_handler();\n\tASSERT_EQ(button_press_cbk_fake.call_count, 1);\n}\n\nTEST_F(UITests, write_line_outputs_lines_to_display)\n{\n\tchar msg[] = \"helloworld\";\n\tUI_write_line(msg);\n\tASSERT_EQ(DISPLAY_output_fake.call_count, 1);\n\tASSERT_EQ(strncmp(DISPLAY_output_fake.arg0_val, msg, 26), 0);\n}\n\nTEST_F(UITests, when_no_empty_lines_write_line_clears_screen_and_outputs_lines_to_display)\n{\n\tDISPLAY_get_line_insert_index_fake.return_val = 2;\n\tchar msg[] = \"helloworld\";\n\n\tUI_write_line(msg);\n\n\tASSERT_EQ(DISPLAY_clear_fake.call_count, 1);\n\tASSERT_EQ(DISPLAY_output_fake.call_count, 1);\n\t\/\/ Check the order of the calls:  Don't care about the first two:\n\t\/\/ DISPLAY_get_line_capacity and DISPLAY_get_line_insert_index\n\tASSERT_EQ(call_history_idx, 4);\n\tASSERT_EQ(call_history[2], (void *) DISPLAY_clear);\n\tASSERT_EQ(call_history[3], (void *) DISPLAY_output);\n}\n\nTEST_F(UITests, when_empty_lines_write_line_doesnt_clear_screen)\n{\n\t\/\/ given\n\tDISPLAY_get_line_insert_index_fake.return_val = 1;\n\tchar msg[] = \"helloworld\";\n\t\/\/ when\n\tUI_write_line(msg);\n\t\/\/ then\n\tASSERT_EQ(DISPLAY_clear_fake.call_count, 0);\n}\n\nTEST_F(UITests, when_string_longer_than_26_then_truncated_string_output)\n{\n\t\/\/ given\n\tchar input[] = \"abcdefghijklmnopqrstuvwxyz0123456789\";\n\tchar expected[] = \"abcdefghijklmnopqrstuvwxyz\";\n\t\/\/ when\n\tUI_write_line(input);\n\t\/\/ then\n\tASSERT_EQ(strncmp(expected, DISPLAY_output_fake.arg0_val, 37), 0);\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file   UvUtilsTest.cpp\n * @brief  Test uvpp miscellaneous utilities.\n * @author zer0\n * @date   2017-05-27\n *\/\n\n#include <gtest\/gtest.h>\n#include <libtbag\/uvpp\/UvUtils.hpp>\n\n#include <iostream>\n#include <string>\n\nusing namespace libtbag;\nusing namespace libtbag::uvpp;\n\nTEST(UvUtilsTest, ResidentSetMemory)\n{\n    std::size_t const RSS = getResidentSetMemory();\n    ASSERT_LT(0, RSS);\n    std::cout << \"ResidentSetMemory: \" << RSS << std::endl;\n}\n\nTEST(UvUtilsTest, Uptime)\n{\n    double const TIME = getUptime();\n    ASSERT_LT(0.0f, TIME);\n}\n\nTEST(UvUtilsTest, ResourceUsage)\n{\n    auto res = getResourceUsage();\n#if !defined(TBAG_PLATFORM_WINDOWS)\n    std::cout << \"Resource Usage:\\n\"\n              << \"utime: \" << res.utime.sec << \".\" << res.utime.usec << std::endl\n              << \"stime: \" << res.stime.sec << \".\" << res.stime.usec << std::endl\n              << \"maxrss: \"   << res.maxrss   << std::endl\n              << \"ixrss: \"    << res.ixrss    << std::endl\n              << \"idrss: \"    << res.idrss    << std::endl\n              << \"isrss: \"    << res.isrss    << std::endl\n              << \"minflt: \"   << res.minflt   << std::endl\n              << \"majflt: \"   << res.majflt   << std::endl\n              << \"nswap: \"    << res.nswap    << std::endl\n              << \"inblock: \"  << res.inblock  << std::endl\n              << \"oublock: \"  << res.oublock  << std::endl\n              << \"msgsnd: \"   << res.msgsnd   << std::endl\n              << \"msgrcv: \"   << res.msgrcv   << std::endl\n              << \"nsignals: \" << res.nsignals << std::endl\n              << \"nvcsw: \"    << res.nvcsw    << std::endl\n              << \"nivcsw: \"   << res.nivcsw   << std::endl;\n#endif\n}\n\nTEST(UvUtilsTest, CpuInfo)\n{\n    auto infos = getCpuInfos();\n    ASSERT_FALSE(infos.empty());\n\n    int index = 0;\n    for (auto & cursor : infos) {\n        std::cout << \"CPU INFO[\" << index\n                  << \"] \" << cursor.model\n                  << \" (SPEED: \" << cursor.speed << \")\\n\";\n        std::cout << \" * user(\" << cursor.times.user\n                  << \")\/nice(\"  << cursor.times.nice\n                  << \")\/sys(\"   << cursor.times.sys\n                  << \")\/idle(\"  << cursor.times.idle\n                  << \")\/irq(\"   << cursor.times.irq << \")\\n\";\n        ++index;\n    }\n}\n\nTEST(UvUtilsTest, InterfaceAddresses)\n{\n    auto infos = getInterfaceAddresses();\n\n    int index = 0;\n    std::cout.setf(std::ios_base::boolalpha);\n    for (auto & cursor : infos) {\n        std::cout << \"INTERFACE INFO[\" << index\n                  << \"] \" << cursor.name\n                  << \" (Physical: \" << convertPhysicalToString(cursor.physical_address)\n                  << \", Internal: \" << cursor.is_internal << \")\\n\";\n\n        int const FAMILY = cursor.address.in4.sin_family;\n        ASSERT_TRUE(cursor.address.in4.sin_family == cursor.address.in6.sin6_family);\n        ASSERT_TRUE(FAMILY == AF_INET || FAMILY == AF_INET6);\n\n        if (cursor.address.in4.sin_family == AF_INET) {\n            std::cout << \"INET4: \" << getIpName(&cursor.address.in4) << std::endl;\n        } else if (cursor.address.in6.sin6_family == AF_INET6) {\n            std::cout << \"INET6: \" << getIpName(&cursor.address.in6) << std::endl;\n        }\n        ++index;\n    }\n}\n\nTEST(UvUtilsTest, Load)\n{\n    auto load = getLoadAverage();\n    ASSERT_EQ(3, load.size());\n#if defined(TBAG_PLATFORM_WINDOWS)\n    ASSERT_EQ(0, load[0]);\n    ASSERT_EQ(0, load[1]);\n    ASSERT_EQ(0, load[2]);\n#else\n    ASSERT_LT(0, load[0]);\n    ASSERT_LT(0, load[1]);\n    ASSERT_LT(0, load[2]);\n#endif\n}\n\nTEST(UvUtilsTest, Password)\n{\n    auto pwd = getPassword();\n    ASSERT_FALSE(pwd.username.empty());\n    ASSERT_FALSE(pwd.homedir.empty());\n    std::cout << \"Username: \" << pwd.username << std::endl\n              << \"Shell: \"    << pwd.shell    << std::endl\n              << \"Home dir: \" << pwd.homedir  << std::endl\n              << \"UID: \"      << pwd.uid      << std::endl\n              << \"GID: \"      << pwd.gid      << std::endl;\n}\n\nTEST(UvUtilsTest, TotalMemory)\n{\n    uint64_t const MEM = getTotalMemory();\n    ASSERT_LT(0, MEM);\n    std::cout << \"Total memory: \" << MEM << std::endl;\n}\n\nTEST(UvUtilsTest, HighResolutionTime)\n{\n    uint64_t const HTIME = getHighResolutionTime();\n    ASSERT_LT(0, HTIME);\n    std::cout << \"High resolution time: \" << HTIME << std::endl;\n}\n\nTEST(UvUtilsTest, GetEnv)\n{\n    std::string path;\n    ASSERT_EQ(Err::E_SUCCESS, getEnv(\"PATH\", path));\n    ASSERT_FALSE(path.empty());\n}\n\n<commit_msg>Rename tester: UvUtilsTest.Load -> UvUtilsTest.LoadAverage<commit_after>\/**\n * @file   UvUtilsTest.cpp\n * @brief  Test uvpp miscellaneous utilities.\n * @author zer0\n * @date   2017-05-27\n *\/\n\n#include <gtest\/gtest.h>\n#include <libtbag\/uvpp\/UvUtils.hpp>\n\n#include <iostream>\n#include <string>\n\nusing namespace libtbag;\nusing namespace libtbag::uvpp;\n\nTEST(UvUtilsTest, ResidentSetMemory)\n{\n    std::size_t const RSS = getResidentSetMemory();\n    ASSERT_LT(0, RSS);\n    std::cout << \"ResidentSetMemory: \" << RSS << std::endl;\n}\n\nTEST(UvUtilsTest, Uptime)\n{\n    double const TIME = getUptime();\n    ASSERT_LT(0.0f, TIME);\n}\n\nTEST(UvUtilsTest, ResourceUsage)\n{\n    auto res = getResourceUsage();\n#if !defined(TBAG_PLATFORM_WINDOWS)\n    std::cout << \"Resource Usage:\\n\"\n              << \"utime: \" << res.utime.sec << \".\" << res.utime.usec << std::endl\n              << \"stime: \" << res.stime.sec << \".\" << res.stime.usec << std::endl\n              << \"maxrss: \"   << res.maxrss   << std::endl\n              << \"ixrss: \"    << res.ixrss    << std::endl\n              << \"idrss: \"    << res.idrss    << std::endl\n              << \"isrss: \"    << res.isrss    << std::endl\n              << \"minflt: \"   << res.minflt   << std::endl\n              << \"majflt: \"   << res.majflt   << std::endl\n              << \"nswap: \"    << res.nswap    << std::endl\n              << \"inblock: \"  << res.inblock  << std::endl\n              << \"oublock: \"  << res.oublock  << std::endl\n              << \"msgsnd: \"   << res.msgsnd   << std::endl\n              << \"msgrcv: \"   << res.msgrcv   << std::endl\n              << \"nsignals: \" << res.nsignals << std::endl\n              << \"nvcsw: \"    << res.nvcsw    << std::endl\n              << \"nivcsw: \"   << res.nivcsw   << std::endl;\n#endif\n}\n\nTEST(UvUtilsTest, CpuInfo)\n{\n    auto infos = getCpuInfos();\n    ASSERT_FALSE(infos.empty());\n\n    int index = 0;\n    for (auto & cursor : infos) {\n        std::cout << \"CPU INFO[\" << index\n                  << \"] \" << cursor.model\n                  << \" (SPEED: \" << cursor.speed << \")\\n\";\n        std::cout << \" * user(\" << cursor.times.user\n                  << \")\/nice(\"  << cursor.times.nice\n                  << \")\/sys(\"   << cursor.times.sys\n                  << \")\/idle(\"  << cursor.times.idle\n                  << \")\/irq(\"   << cursor.times.irq << \")\\n\";\n        ++index;\n    }\n}\n\nTEST(UvUtilsTest, InterfaceAddresses)\n{\n    auto infos = getInterfaceAddresses();\n\n    int index = 0;\n    std::cout.setf(std::ios_base::boolalpha);\n    for (auto & cursor : infos) {\n        std::cout << \"INTERFACE INFO[\" << index\n                  << \"] \" << cursor.name\n                  << \" (Physical: \" << convertPhysicalToString(cursor.physical_address)\n                  << \", Internal: \" << cursor.is_internal << \")\\n\";\n\n        int const FAMILY = cursor.address.in4.sin_family;\n        ASSERT_TRUE(cursor.address.in4.sin_family == cursor.address.in6.sin6_family);\n        ASSERT_TRUE(FAMILY == AF_INET || FAMILY == AF_INET6);\n\n        if (cursor.address.in4.sin_family == AF_INET) {\n            std::cout << \"INET4: \" << getIpName(&cursor.address.in4) << std::endl;\n        } else if (cursor.address.in6.sin6_family == AF_INET6) {\n            std::cout << \"INET6: \" << getIpName(&cursor.address.in6) << std::endl;\n        }\n        ++index;\n    }\n}\n\nTEST(UvUtilsTest, LoadAverage)\n{\n    auto load = getLoadAverage();\n    if (load.empty()) {\n        std::cout << \"Empty load_average. Skip this test.\\n\";\n        return;\n    }\n    ASSERT_EQ(3, load.size());\n#if defined(TBAG_PLATFORM_WINDOWS)\n    ASSERT_EQ(0, load[0]);\n    ASSERT_EQ(0, load[1]);\n    ASSERT_EQ(0, load[2]);\n#else\n    ASSERT_LT(0, load[0]);\n    ASSERT_LT(0, load[1]);\n    ASSERT_LT(0, load[2]);\n#endif\n}\n\nTEST(UvUtilsTest, Password)\n{\n    auto pwd = getPassword();\n    ASSERT_FALSE(pwd.username.empty());\n    ASSERT_FALSE(pwd.homedir.empty());\n    std::cout << \"Username: \" << pwd.username << std::endl\n              << \"Shell: \"    << pwd.shell    << std::endl\n              << \"Home dir: \" << pwd.homedir  << std::endl\n              << \"UID: \"      << pwd.uid      << std::endl\n              << \"GID: \"      << pwd.gid      << std::endl;\n}\n\nTEST(UvUtilsTest, TotalMemory)\n{\n    uint64_t const MEM = getTotalMemory();\n    ASSERT_LT(0, MEM);\n    std::cout << \"Total memory: \" << MEM << std::endl;\n}\n\nTEST(UvUtilsTest, HighResolutionTime)\n{\n    uint64_t const HTIME = getHighResolutionTime();\n    ASSERT_LT(0, HTIME);\n    std::cout << \"High resolution time: \" << HTIME << std::endl;\n}\n\nTEST(UvUtilsTest, GetEnv)\n{\n    std::string path;\n    ASSERT_EQ(Err::E_SUCCESS, getEnv(\"PATH\", path));\n    ASSERT_FALSE(path.empty());\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"StaticLibrary.h\"\n\n#include <stdio.h>\n#ifndef _MSC_VER\n#include <sys\/stat.h>\n#include <unistd.h>\n#endif\n\n#include \"Error.h\"\n\nnamespace Halide {\nnamespace Internal {\n\nnamespace {\n\nclass File {\npublic:\n    File(const std::string &name, const char *mode) : name(name), f(fopen(name.c_str(), mode)) {\n        internal_assert(f != nullptr) << \"Could not open file \" << f << \" in mode \" << mode << \"\\n\";\n    }\n    ~File() {\n        if (f != nullptr) {\n            fclose(f);\n        }\n    }\n    void write(const void *data, size_t size) {\n        if (!fwrite(data, size, 1, f)) {\n            user_error << \"Could not write to \" << name << \"\\n\";\n        }\n    }\n\n    void write(const std::string &str) {\n        write(str.c_str(), str.size());\n    }\n\n    void write(const std::vector<uint8_t> &data) {\n        write(&data[0], data.size());\n    }\n\n    std::vector<uint8_t> read(size_t size) {\n        std::vector<uint8_t> result(size);\n        if (!fread(&result[0], size, 1, f)) {\n            user_error << \"Could not read from \" << name << \"\\n\";\n        }\n        return result;\n    }\n\n    size_t tell() {\n        long offset = ftell(f);\n        if (offset < 0) {\n            user_error << \"Could not ftell: \" << name << \"\\n\";\n        }\n        return (size_t) offset;\n    }\n\n    static bool exists(const std::string &name) {\n        #ifdef _MSC_VER\n        return _access(name.c_str(), 0) == 0;\n        #else\n        return ::access(name.c_str(), F_OK) == 0;\n        #endif\n    }\n\n    static void unlink(const std::string &name) {\n        #ifdef _MSC_VER\n        _unlink(name.c_str());\n        #else\n        ::unlink(name.c_str());\n        #endif\n    }\n\n    struct Stat {\n        off_t file_size;\n        time_t mod_time;\n        uid_t uid;\n        gid_t gid;\n        mode_t mode;\n    };\n\n    static Stat stat(const std::string &name) {\n        #ifdef _MSC_VER\n        struct _stat a;\n        if (_stat(name.c_str(), &a) != 0) {\n            user_error << \"Could not stat \" << name << \"\\n\";\n        }\n        #else\n        struct stat a;\n        if (::stat(name.c_str(), &a) != 0) {\n            user_error << \"Could not stat \" << name << \"\\n\";\n        }\n        #endif\n        return { a.st_size, a.st_mtime, a.st_uid, a.st_gid, a.st_mode };\n    }\n\nprivate:\n    const std::string name;\n    FILE *f;\n};\n\nstd::string pad_right(std::string s, size_t max) {\n    internal_assert(s.size() <= max) << s.size() << \" \"<<s;\n    while (s.size() < max) {\n        s += \" \";\n    }\n    return s;\n}\n\nstd::string decimal_string(int value, size_t pad) {\n    return pad_right(std::to_string(value), pad);\n}\n\nstd::string octal_string(int value, size_t pad) {\n    char buf[256];\n    snprintf(buf, sizeof(buf), \"%o\", value);\n    return pad_right(buf, pad);\n}\n\n}  \/\/ namespace\n\nvoid create_ar_file(const std::vector<std::string> &src_files, \n                    const std::string &dst_file, bool deterministic) {\n    File ar(dst_file, \"wb\");\n    ar.write(\"!<arch>\\x0A\", 8);\n    for (const std::string &src_path : src_files) {\n        File::Stat stat = File::stat(src_path);\n\n        \/\/ Each member must begin on an even byte boundary; insert LF as needed\n        if (ar.tell() & 1) {\n            ar.write(\"\\x0A\");\n        }\n        \/\/ Need to embed just the leaf name\n        std::string src_name = base_name(src_path, '\/');\n        size_t filesize = stat.file_size;\n        if (src_name.size() > 16) {\n            ar.write(\"#1\/\" + decimal_string(src_name.size(), 13));\n            filesize += src_name.size();\n        } else {\n            ar.write(pad_right(src_name, 16));\n        }\n        ar.write(decimal_string(deterministic ? 0 : stat.mod_time, 12));  \/\/ mod time\n        ar.write(decimal_string(deterministic ? 0 : stat.uid, 6));  \/\/ user id\n        ar.write(decimal_string(deterministic ? 0 : stat.gid, 6));  \/\/ group id\n        ar.write(octal_string(deterministic ? 0644 : stat.mode, 8));  \/\/ mode\n        ar.write(decimal_string(filesize, 10));  \/\/ filesize\n        ar.write(\"\\x60\\x0A\");  \/\/ magic\n        if (src_name.size() > 16) {\n            ar.write(src_name);\n        }\n        {\n            File src(src_path, \"rb\");\n            \/\/ Just slurp everything into memory and write it back out.\n            ar.write(src.read(stat.file_size));  \/\/ slurp it all over\n        }\n    }\n}\n\nvoid static_library_test() {\n    {\n        File a(\"a.tmp\", \"w\");\n        a.write(\"a123b\");\n\n        File b(\"b_long_name_is_long.tmp\", \"w\");\n        b.write(\"c456d\");\n\n        File c(\".\/c_path.tmp\", \"w\");\n        c.write(\"e789f\");\n    }\n\n    create_ar_file({\"a.tmp\", \"b_long_name_is_long.tmp\", \".\/c_path.tmp\"}, \"arfile.a\");\n\n    File::Stat stat = File::stat(\"arfile.a\");\n    {\n        File ar(\"arfile.a\", \"r\");\n        auto slurp = ar.read(stat.file_size);\n        const std::string actual = std::string((const char*)slurp.data(), slurp.size());\n        const std::string expected = R\"literal(!<arch>\na.tmp           0           0     0     644     5         `\na123b\n#1\/23           0           0     0     644     28        `\nb_long_name_is_long.tmpc456dc_path.tmp      0           0     0     644     5         `\ne789f)literal\";\n        internal_assert(actual == expected) << \"File contents wrong, expected:(\" << expected << \")\\nactual:(\" << actual << \")\\n\";\n    }\n    File::unlink(\"a.tmp\");\n    File::unlink(\"b_long_name_is_long.tmp\");\n    File::unlink(\".\/c_path.tmp\");\n    File::unlink(\"arfile.a\");\n\n    debug(0) << \"static_library_test passed\\n\";\n}\n\n}  \/\/ namespace Internal\n}  \/\/ namespace Halide\n<commit_msg>Windows compatibility fixes<commit_after>#include \"StaticLibrary.h\"\n\n#include <stdio.h>\n#ifdef _MSC_VER\n#include <io.h>\n#else\n#include <unistd.h>\n#endif\n#include <sys\/types.h>\n#include <sys\/stat.h>\n\n#include \"Error.h\"\n\nnamespace Halide {\nnamespace Internal {\n\nnamespace {\n\nclass File {\npublic:\n    File(const std::string &name, const char *mode) : name(name), f(fopen(name.c_str(), mode)) {\n        internal_assert(f != nullptr) << \"Could not open file \" << f << \" in mode \" << mode << \"\\n\";\n    }\n    ~File() {\n        if (f != nullptr) {\n            fclose(f);\n        }\n    }\n    void write(const void *data, size_t size) {\n        if (!fwrite(data, size, 1, f)) {\n            user_error << \"Could not write to \" << name << \"\\n\";\n        }\n    }\n\n    void write(const std::string &str) {\n        write(str.c_str(), str.size());\n    }\n\n    void write(const std::vector<uint8_t> &data) {\n        write(&data[0], data.size());\n    }\n\n    std::vector<uint8_t> read(size_t size) {\n        std::vector<uint8_t> result(size);\n        if (!fread(&result[0], size, 1, f)) {\n            user_error << \"Could not read from \" << name << \"\\n\";\n        }\n        return result;\n    }\n\n    size_t tell() {\n        long offset = ftell(f);\n        if (offset < 0) {\n            user_error << \"Could not ftell: \" << name << \"\\n\";\n        }\n        return (size_t) offset;\n    }\n\n    static bool exists(const std::string &name) {\n        #ifdef _MSC_VER\n        return _access(name.c_str(), 0) == 0;\n        #else\n        return ::access(name.c_str(), F_OK) == 0;\n        #endif\n    }\n\n    static void unlink(const std::string &name) {\n        #ifdef _MSC_VER\n        _unlink(name.c_str());\n        #else\n        ::unlink(name.c_str());\n        #endif\n    }\n\n    struct Stat {\n        off_t file_size;\n        time_t mod_time;\n        uint32_t uid;\n        uint32_t gid;\n        uint32_t mode;\n    };\n\n    static Stat stat(const std::string &name) {\n        #ifdef _MSC_VER\n        struct _stat a;\n        if (_stat(name.c_str(), &a) != 0) {\n            user_error << \"Could not stat \" << name << \"\\n\";\n        }\n        #else\n        struct stat a;\n        if (::stat(name.c_str(), &a) != 0) {\n            user_error << \"Could not stat \" << name << \"\\n\";\n        }\n        #endif\n        return { a.st_size, a.st_mtime, a.st_uid, a.st_gid, a.st_mode };\n    }\n\nprivate:\n    const std::string name;\n    FILE *f;\n};\n\nstd::string pad_right(std::string s, size_t max) {\n    internal_assert(s.size() <= max) << s.size() << \" \"<<s;\n    while (s.size() < max) {\n        s += \" \";\n    }\n    return s;\n}\n\nstd::string decimal_string(int value, size_t pad) {\n    return pad_right(std::to_string(value), pad);\n}\n\nstd::string octal_string(int value, size_t pad) {\n    char buf[256];\n    #ifdef _MSC_VER\n    _snprintf(buf, sizeof(buf), \"%o\", value);\n    #else\n    snprintf(buf, sizeof(buf), \"%o\", value);\n    #endif\n    return pad_right(buf, pad);\n}\n\n}  \/\/ namespace\n\nvoid create_ar_file(const std::vector<std::string> &src_files, \n                    const std::string &dst_file, bool deterministic) {\n    File ar(dst_file, \"wb\");\n    ar.write(\"!<arch>\\x0A\", 8);\n    for (const std::string &src_path : src_files) {\n        File::Stat stat = File::stat(src_path);\n\n        \/\/ Each member must begin on an even byte boundary; insert LF as needed\n        if (ar.tell() & 1) {\n            ar.write(\"\\x0A\");\n        }\n        \/\/ Need to embed just the leaf name\n        std::string src_name = base_name(src_path, '\/');\n        size_t filesize = stat.file_size;\n        if (src_name.size() > 16) {\n            ar.write(\"#1\/\" + decimal_string(src_name.size(), 13));\n            filesize += src_name.size();\n        } else {\n            ar.write(pad_right(src_name, 16));\n        }\n        ar.write(decimal_string(deterministic ? 0 : stat.mod_time, 12));  \/\/ mod time\n        ar.write(decimal_string(deterministic ? 0 : stat.uid, 6));  \/\/ user id\n        ar.write(decimal_string(deterministic ? 0 : stat.gid, 6));  \/\/ group id\n        ar.write(octal_string(deterministic ? 0644 : stat.mode, 8));  \/\/ mode\n        ar.write(decimal_string(filesize, 10));  \/\/ filesize\n        ar.write(\"\\x60\\x0A\");  \/\/ magic\n        if (src_name.size() > 16) {\n            ar.write(src_name);\n        }\n        {\n            File src(src_path, \"rb\");\n            \/\/ Just slurp everything into memory and write it back out.\n            ar.write(src.read(stat.file_size));  \/\/ slurp it all over\n        }\n    }\n}\n\nvoid static_library_test() {\n    {\n        File a(\"a.tmp\", \"w\");\n        a.write(\"a123b\");\n\n        File b(\"b_long_name_is_long.tmp\", \"w\");\n        b.write(\"c456d\");\n\n        File c(\".\/c_path.tmp\", \"w\");\n        c.write(\"e789f\");\n    }\n\n    create_ar_file({\"a.tmp\", \"b_long_name_is_long.tmp\", \".\/c_path.tmp\"}, \"arfile.a\");\n\n    File::Stat stat = File::stat(\"arfile.a\");\n    {\n        File ar(\"arfile.a\", \"r\");\n        auto slurp = ar.read(stat.file_size);\n        const std::string actual = std::string((const char*)slurp.data(), slurp.size());\n        const std::string expected = R\"literal(!<arch>\na.tmp           0           0     0     644     5         `\na123b\n#1\/23           0           0     0     644     28        `\nb_long_name_is_long.tmpc456dc_path.tmp      0           0     0     644     5         `\ne789f)literal\";\n        internal_assert(actual == expected) << \"File contents wrong, expected:(\" << expected << \")\\nactual:(\" << actual << \")\\n\";\n    }\n    File::unlink(\"a.tmp\");\n    File::unlink(\"b_long_name_is_long.tmp\");\n    File::unlink(\".\/c_path.tmp\");\n    File::unlink(\"arfile.a\");\n\n    debug(0) << \"static_library_test passed\\n\";\n}\n\n}  \/\/ namespace Internal\n}  \/\/ namespace Halide\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\/\n\/*  safe_refcount.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\/* Copyright (c) 2014-2017 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#include \"safe_refcount.h\"\n\n\/\/ Atomic functions, these are used for multithread safe reference counters!\n\n#ifdef NO_THREADS\n\n\/* Bogus implementation unaware of multiprocessing *\/\n\ntemplate <class T>\nstatic _ALWAYS_INLINE_ T _atomic_conditional_increment_impl(register T *pw) {\n\n\tif (*pw == 0)\n\t\treturn 0;\n\n\t(*pw)++;\n\n\treturn *pw;\n}\n\ntemplate <class T>\nstatic _ALWAYS_INLINE_ T _atomic_decrement_impl(register T *pw) {\n\n\t(*pw)--;\n\n\treturn *pw;\n}\n\ntemplate <class T>\nstatic _ALWAYS_INLINE_ T _atomic_increment_impl(register T *pw) {\n\n\t(*pw)++;\n\n\treturn *pw;\n}\n\ntemplate <class T>\nstatic _ALWAYS_INLINE_ T _atomic_sub_impl(register T *pw, register T val) {\n\n\t(*pw) -= val;\n\n\treturn *pw;\n}\n\ntemplate <class T>\nstatic _ALWAYS_INLINE_ T _atomic_add_impl(register T *pw, register T val) {\n\n\t(*pw) += val;\n\n\treturn *pw;\n}\n\n#elif defined(__GNUC__)\n\n\/* Implementation for GCC & Clang *\/\n\n\/\/ GCC guarantees atomic intrinsics for sizes of 1, 2, 4 and 8 bytes.\n\/\/ Clang states it supports GCC atomic builtins.\n\ntemplate <class T>\nstatic _ALWAYS_INLINE_ T _atomic_conditional_increment_impl(register T *pw) {\n\n\twhile (true) {\n\t\tT tmp = static_cast<T const volatile &>(*pw);\n\t\tif (tmp == 0)\n\t\t\treturn 0; \/\/ if zero, can't add to it anymore\n\t\tif (__sync_val_compare_and_swap(pw, tmp, tmp + 1) == tmp)\n\t\t\treturn tmp + 1;\n\t}\n}\n\ntemplate <class T>\nstatic _ALWAYS_INLINE_ T _atomic_decrement_impl(register T *pw) {\n\n\treturn __sync_sub_and_fetch(pw, 1);\n}\n\ntemplate <class T>\nstatic _ALWAYS_INLINE_ T _atomic_increment_impl(register T *pw) {\n\n\treturn __sync_add_and_fetch(pw, 1);\n}\n\ntemplate <class T>\nstatic _ALWAYS_INLINE_ T _atomic_sub_impl(register T *pw, register T val) {\n\n\treturn __sync_sub_and_fetch(pw, val);\n}\n\ntemplate <class T>\nstatic _ALWAYS_INLINE_ T _atomic_add_impl(register T *pw, register T val) {\n\n\treturn __sync_add_and_fetch(pw, val);\n}\n\n#elif defined(_MSC_VER)\n\n\/* Implementation for MSVC-Windows *\/\n\n\/\/ don't pollute my namespace!\n#include <windows.h>\n\n#define ATOMIC_CONDITIONAL_INCREMENT_BODY(m_pw, m_win_type, m_win_cmpxchg, m_cpp_type) \\\n\t\/* try to increment until it actually works *\/                                     \\\n\t\/* taken from boost *\/                                                             \\\n\twhile (true) {                                                                     \\\n\t\tm_cpp_type tmp = static_cast<m_cpp_type const volatile &>(*(m_pw));            \\\n\t\tif (tmp == 0)                                                                  \\\n\t\t\treturn 0; \/* if zero, can't add to it anymore *\/                           \\\n\t\tif (m_win_cmpxchg((m_win_type volatile *)(m_pw), tmp + 1, tmp) == tmp)         \\\n\t\t\treturn tmp + 1;                                                            \\\n\t}\n\nstatic _ALWAYS_INLINE_ uint32_t _atomic_conditional_increment_impl(register uint32_t *pw) {\n\n\tATOMIC_CONDITIONAL_INCREMENT_BODY(pw, LONG, InterlockedCompareExchange, uint32_t)\n}\n\nstatic _ALWAYS_INLINE_ uint32_t _atomic_decrement_impl(register uint32_t *pw) {\n\n\treturn InterlockedDecrement((LONG volatile *)pw);\n}\n\nstatic _ALWAYS_INLINE_ uint32_t _atomic_increment_impl(register uint32_t *pw) {\n\n\treturn InterlockedIncrement((LONG volatile *)pw);\n}\n\nstatic _ALWAYS_INLINE_ uint32_t _atomic_sub_impl(register uint32_t *pw, register uint32_t val) {\n\n#if _WIN32_WINNT >= 0x0601 \/\/ Windows 7+\n\treturn InterlockedExchangeSubtract(pw, val) - val;\n#else\n\treturn InterlockedExchangeAdd((LONG volatile *)pw, -(int32_t)val) - val;\n#endif\n}\n\nstatic _ALWAYS_INLINE_ uint32_t _atomic_add_impl(register uint32_t *pw, register uint32_t val) {\n\n\treturn InterlockedAdd((LONG volatile *)pw, val);\n}\n\nstatic _ALWAYS_INLINE_ uint64_t _atomic_conditional_increment_impl(register uint64_t *pw) {\n\n\tATOMIC_CONDITIONAL_INCREMENT_BODY(pw, LONGLONG, InterlockedCompareExchange64, uint64_t)\n}\n\nstatic _ALWAYS_INLINE_ uint64_t _atomic_decrement_impl(register uint64_t *pw) {\n\n\treturn InterlockedDecrement64((LONGLONG volatile *)pw);\n}\n\nstatic _ALWAYS_INLINE_ uint64_t _atomic_increment_impl(register uint64_t *pw) {\n\n\treturn InterlockedIncrement64((LONGLONG volatile *)pw);\n}\n\nstatic _ALWAYS_INLINE_ uint64_t _atomic_sub_impl(register uint64_t *pw, register uint64_t val) {\n\n#if _WIN32_WINNT >= 0x0601 \/\/ Windows 7+\n\treturn InterlockedExchangeSubtract64(pw, val) - val;\n#else\n\treturn InterlockedExchangeAdd64((LONGLONG volatile *)pw, -(int64_t)val) - val;\n#endif\n}\n\nstatic _ALWAYS_INLINE_ uint64_t _atomic_add_impl(register uint64_t *pw, register uint64_t val) {\n\n\treturn InterlockedAdd64((LONGLONG volatile *)pw, val);\n}\n\n#else\n\n\/\/no threads supported?\n#error Must provide atomic functions for this platform or compiler!\n\n#endif\n\n\/\/ The actual advertised functions; they'll call the right implementation\n\nuint32_t atomic_conditional_increment(register uint32_t *counter) {\n\treturn _atomic_conditional_increment_impl(counter);\n}\n\nuint32_t atomic_decrement(register uint32_t *pw) {\n\treturn _atomic_decrement_impl(pw);\n}\n\nuint32_t atomic_increment(register uint32_t *pw) {\n\treturn _atomic_increment_impl(pw);\n}\n\nuint32_t atomic_sub(register uint32_t *pw, register uint32_t val) {\n\treturn _atomic_sub_impl(pw, val);\n}\n\nuint32_t atomic_add(register uint32_t *pw, register uint32_t val) {\n\treturn _atomic_add_impl(pw, val);\n}\n\nuint64_t atomic_conditional_increment(register uint64_t *counter) {\n\treturn _atomic_conditional_increment_impl(counter);\n}\n\nuint64_t atomic_decrement(register uint64_t *pw) {\n\treturn _atomic_decrement_impl(pw);\n}\n\nuint64_t atomic_increment(register uint64_t *pw) {\n\treturn _atomic_increment_impl(pw);\n}\n\nuint64_t atomic_sub(register uint64_t *pw, register uint64_t val) {\n\treturn _atomic_sub_impl(pw, val);\n}\n\nuint64_t atomic_add(register uint64_t *pw, register uint64_t val) {\n\treturn _atomic_add_impl(pw, val);\n}\n<commit_msg>UWP: Fix build issue caused by atomic operations<commit_after>\/*************************************************************************\/\n\/*  safe_refcount.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\/* Copyright (c) 2014-2017 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#include \"safe_refcount.h\"\n\n\/\/ Atomic functions, these are used for multithread safe reference counters!\n\n#ifdef NO_THREADS\n\n\/* Bogus implementation unaware of multiprocessing *\/\n\ntemplate <class T>\nstatic _ALWAYS_INLINE_ T _atomic_conditional_increment_impl(register T *pw) {\n\n\tif (*pw == 0)\n\t\treturn 0;\n\n\t(*pw)++;\n\n\treturn *pw;\n}\n\ntemplate <class T>\nstatic _ALWAYS_INLINE_ T _atomic_decrement_impl(register T *pw) {\n\n\t(*pw)--;\n\n\treturn *pw;\n}\n\ntemplate <class T>\nstatic _ALWAYS_INLINE_ T _atomic_increment_impl(register T *pw) {\n\n\t(*pw)++;\n\n\treturn *pw;\n}\n\ntemplate <class T>\nstatic _ALWAYS_INLINE_ T _atomic_sub_impl(register T *pw, register T val) {\n\n\t(*pw) -= val;\n\n\treturn *pw;\n}\n\ntemplate <class T>\nstatic _ALWAYS_INLINE_ T _atomic_add_impl(register T *pw, register T val) {\n\n\t(*pw) += val;\n\n\treturn *pw;\n}\n\n#elif defined(__GNUC__)\n\n\/* Implementation for GCC & Clang *\/\n\n\/\/ GCC guarantees atomic intrinsics for sizes of 1, 2, 4 and 8 bytes.\n\/\/ Clang states it supports GCC atomic builtins.\n\ntemplate <class T>\nstatic _ALWAYS_INLINE_ T _atomic_conditional_increment_impl(register T *pw) {\n\n\twhile (true) {\n\t\tT tmp = static_cast<T const volatile &>(*pw);\n\t\tif (tmp == 0)\n\t\t\treturn 0; \/\/ if zero, can't add to it anymore\n\t\tif (__sync_val_compare_and_swap(pw, tmp, tmp + 1) == tmp)\n\t\t\treturn tmp + 1;\n\t}\n}\n\ntemplate <class T>\nstatic _ALWAYS_INLINE_ T _atomic_decrement_impl(register T *pw) {\n\n\treturn __sync_sub_and_fetch(pw, 1);\n}\n\ntemplate <class T>\nstatic _ALWAYS_INLINE_ T _atomic_increment_impl(register T *pw) {\n\n\treturn __sync_add_and_fetch(pw, 1);\n}\n\ntemplate <class T>\nstatic _ALWAYS_INLINE_ T _atomic_sub_impl(register T *pw, register T val) {\n\n\treturn __sync_sub_and_fetch(pw, val);\n}\n\ntemplate <class T>\nstatic _ALWAYS_INLINE_ T _atomic_add_impl(register T *pw, register T val) {\n\n\treturn __sync_add_and_fetch(pw, val);\n}\n\n#elif defined(_MSC_VER)\n\n\/* Implementation for MSVC-Windows *\/\n\n\/\/ don't pollute my namespace!\n#include <windows.h>\n\n#define ATOMIC_CONDITIONAL_INCREMENT_BODY(m_pw, m_win_type, m_win_cmpxchg, m_cpp_type) \\\n\t\/* try to increment until it actually works *\/                                     \\\n\t\/* taken from boost *\/                                                             \\\n\twhile (true) {                                                                     \\\n\t\tm_cpp_type tmp = static_cast<m_cpp_type const volatile &>(*(m_pw));            \\\n\t\tif (tmp == 0)                                                                  \\\n\t\t\treturn 0; \/* if zero, can't add to it anymore *\/                           \\\n\t\tif (m_win_cmpxchg((m_win_type volatile *)(m_pw), tmp + 1, tmp) == tmp)         \\\n\t\t\treturn tmp + 1;                                                            \\\n\t}\n\nstatic _ALWAYS_INLINE_ uint32_t _atomic_conditional_increment_impl(register uint32_t *pw) {\n\n\tATOMIC_CONDITIONAL_INCREMENT_BODY(pw, LONG, InterlockedCompareExchange, uint32_t)\n}\n\nstatic _ALWAYS_INLINE_ uint32_t _atomic_decrement_impl(register uint32_t *pw) {\n\n\treturn InterlockedDecrement((LONG volatile *)pw);\n}\n\nstatic _ALWAYS_INLINE_ uint32_t _atomic_increment_impl(register uint32_t *pw) {\n\n\treturn InterlockedIncrement((LONG volatile *)pw);\n}\n\nstatic _ALWAYS_INLINE_ uint32_t _atomic_sub_impl(register uint32_t *pw, register uint32_t val) {\n\n#if _WIN32_WINNT >= 0x0601 \/\/ Windows 7+\n\treturn InterlockedExchangeSubtract(pw, val) - val;\n#else\n\treturn InterlockedExchangeAdd((LONG volatile *)pw, -(int32_t)val) - val;\n#endif\n}\n\nstatic _ALWAYS_INLINE_ uint32_t _atomic_add_impl(register uint32_t *pw, register uint32_t val) {\n\n\treturn InterlockedAdd((LONG volatile *)pw, val);\n}\n\nstatic _ALWAYS_INLINE_ uint64_t _atomic_conditional_increment_impl(register uint64_t *pw) {\n\n\tATOMIC_CONDITIONAL_INCREMENT_BODY(pw, LONGLONG, InterlockedCompareExchange64, uint64_t)\n}\n\nstatic _ALWAYS_INLINE_ uint64_t _atomic_decrement_impl(register uint64_t *pw) {\n\n\treturn InterlockedDecrement64((LONGLONG volatile *)pw);\n}\n\nstatic _ALWAYS_INLINE_ uint64_t _atomic_increment_impl(register uint64_t *pw) {\n\n\treturn InterlockedIncrement64((LONGLONG volatile *)pw);\n}\n\nstatic _ALWAYS_INLINE_ uint64_t _atomic_sub_impl(register uint64_t *pw, register uint64_t val) {\n\n#if _WIN32_WINNT >= 0x0601 && !defined(UWP_ENABLED) \/\/ Windows 7+ except UWP\n\treturn InterlockedExchangeSubtract64(pw, val) - val;\n#else\n\treturn InterlockedExchangeAdd64((LONGLONG volatile *)pw, -(int64_t)val) - val;\n#endif\n}\n\nstatic _ALWAYS_INLINE_ uint64_t _atomic_add_impl(register uint64_t *pw, register uint64_t val) {\n\n\treturn InterlockedAdd64((LONGLONG volatile *)pw, val);\n}\n\n#else\n\n\/\/no threads supported?\n#error Must provide atomic functions for this platform or compiler!\n\n#endif\n\n\/\/ The actual advertised functions; they'll call the right implementation\n\nuint32_t atomic_conditional_increment(register uint32_t *counter) {\n\treturn _atomic_conditional_increment_impl(counter);\n}\n\nuint32_t atomic_decrement(register uint32_t *pw) {\n\treturn _atomic_decrement_impl(pw);\n}\n\nuint32_t atomic_increment(register uint32_t *pw) {\n\treturn _atomic_increment_impl(pw);\n}\n\nuint32_t atomic_sub(register uint32_t *pw, register uint32_t val) {\n\treturn _atomic_sub_impl(pw, val);\n}\n\nuint32_t atomic_add(register uint32_t *pw, register uint32_t val) {\n\treturn _atomic_add_impl(pw, val);\n}\n\nuint64_t atomic_conditional_increment(register uint64_t *counter) {\n\treturn _atomic_conditional_increment_impl(counter);\n}\n\nuint64_t atomic_decrement(register uint64_t *pw) {\n\treturn _atomic_decrement_impl(pw);\n}\n\nuint64_t atomic_increment(register uint64_t *pw) {\n\treturn _atomic_increment_impl(pw);\n}\n\nuint64_t atomic_sub(register uint64_t *pw, register uint64_t val) {\n\treturn _atomic_sub_impl(pw, val);\n}\n\nuint64_t atomic_add(register uint64_t *pw, register uint64_t val) {\n\treturn _atomic_add_impl(pw, val);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Copyright (c) 2009 Jonathan Armond <jon.armond@gmail.com>\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 \"kmailmigrator.h\"\n\n#include \"imapsettings.h\"\n\/\/#include \"pop3settings.h\"\n#include \"mboxsettings.h\"\n#include \"maildirsettings.h\"\n\n#include <akonadi\/agentmanager.h>\n#include <akonadi\/agentinstance.h>\n#include <akonadi\/agentinstancecreatejob.h>\nusing Akonadi::AgentManager;\nusing Akonadi::AgentInstance;\nusing Akonadi::AgentInstanceCreateJob;\n#include <akonadi\/resources\/mbox\/settings.h>\n\n#include <KConfig>\n#include <KConfigGroup>\n#include <KStandardDirs>\n#include <KDebug>\n#include <KLocalizedString>\n#include <kwallet.h>\nusing KWallet::Wallet;\n\nusing namespace KMail;\n\nenum ImapEncryption { Unencrypted = 1, Ssl, Tls };\nenum ImapAuthentication { ClearText = 1, Login, Plain, CramMD5, DigestMD5, NTLM,\n                          GSSAPI, Anonymous };\n\nstatic QString retrievePassword( const QString &idString )\n{\n  QString password;\n  Wallet *wallet = Wallet::openWallet( Wallet::NetworkWallet(), 0 );\n  if ( wallet && wallet->isOpen() && wallet->hasFolder( \"kmail\" ) ) {\n    wallet->setFolder( \"kmail\" );\n    wallet->readPassword( \"account-\" + idString, password );\n  } else\n    kWarning() << \"No password retrieved.\";\n  delete wallet;\n  return password;\n}\n\nKMailMigrator::KMailMigrator( const QStringList &typesToMigrate ) :\n  KMigratorBase(),\n  mTypes( typesToMigrate ),\n  mConfig( 0 )\n{\n}\n\nKMailMigrator::~KMailMigrator()\n{\n  delete mConfig;\n}\n\nvoid KMailMigrator::migrate()\n{\n  emit message( Info, \"Beginning KMail migration\" );\n  const QString &kmailCfgFile = KStandardDirs::locateLocal( \"config\", QString( \"kmailrc\" ) );\n  mConfig = new KConfig( kmailCfgFile );\n  mAccounts = mConfig->groupList().filter( QRegExp( \"Account \\\\d+\" ) );\n  mIt = mAccounts.begin();\n  migrateNext();\n}\n\nvoid KMailMigrator::migrateNext()\n{\n  while ( mIt != mAccounts.end() ) {\n    mCurrentAccount = *mIt;\n    const KConfigGroup group( mConfig, mCurrentAccount );\n    if ( !mTypes.contains( group.readEntry( \"Type\" ).toLower() ) ) {\n      ++mIt;\n      continue;\n    }\n\n    const QString name = group.readEntry( \"Name\" );\n    const QString idString = group.readEntry( \"Id\" );\n    if ( migrationState( idString ) == None ) {\n      ++mIt;\n      if ( !migrateCurrentAccount() ) {\n        emit message( Error, i18n( \"No backend for '%1' available.\", name ) );\n        migrateNext();\n      }\n      return;\n    }\n\n    if ( migrationState( idString ) == Complete )\n      emit message( Skip, i18n( \"'%1' has been already migrated.\", name ) );\n\n    ++mIt;\n  }\n  if ( mIt == mAccounts.end() )\n    deleteLater();\n}\n\nvoid KMailMigrator::migrationFailed( const QString &errorMsg,\n                                     const AgentInstance &instance )\n{\n  const KConfigGroup group( mConfig, mCurrentAccount );\n  emit message( Error, i18n( \"Migration of '%1' to akonadi resource failed: %2\",\n                             group.readEntry( \"Name \" ), errorMsg ) ); \n\n  if ( instance.isValid() )\n    AgentManager::self()->removeInstance( instance );\n\n  mCurrentAccount = QString();\n  migrateNext();\n}\n\nvoid KMailMigrator::migrationCompleted( const AgentInstance &instance  )\n{\n  const KConfigGroup group( mConfig, mCurrentAccount );\n  setMigrationState( group.readEntry( \"Id\" ), Complete, instance.identifier(),\n                     group.readEntry( \"Type\" ).toLower() );\n  emit message( Success, i18n( \"Migration of '%1' succeeded.\", group.readEntry( \"Name\" ) ) );\n  mCurrentAccount = QString();\n  \/\/mManager->remove( mCurrentAccount );\n  migrateNext();\n}\n\nbool KMailMigrator::migrateCurrentAccount()\n{\n  if ( mCurrentAccount.isEmpty() )\n    return false;\n  const KConfigGroup group( mConfig, mCurrentAccount );\n\n  emit message( Info, i18n( \"Trying to migrate '%1' to resource...\", group.readEntry( \"Name\" ) ) );\n\n  const QString type = group.readEntry( \"Type\" ).toLower();\n  kDebug() << \"Account type: \" << type;\n  if ( type == \"imap\" || type == \"dimap\" ) {\n    createAgentInstance( \"akonadi_imap_resource\", this,\n                         SLOT( imapAccountCreated( KJob * ) ) );\n  }\n  else if ( type == \"pop\" ) {\n    \/* createAgentInstance( \"akonadi_pop3_resource\", this,\n                         SLOT( pop3AccountCreated( KJob * ) ) ); *\/\n    return false;\n  }\n  else if ( type == \"maildir\" ) {\n    createAgentInstance( \"akonadi_maildir_resource\", this,\n                         SLOT( maildirAccountCreated( KJob * ) ) );\n  }\n  else if ( type == \"local\" ) {\n    createAgentInstance( \"akonadi_mbox_resource\", this,\n                         SLOT( mboxAccountCreated( KJob * ) ) );\n  }\n  else {\n    return false;\n  }\n\n  return true;\n}\n\nvoid KMailMigrator::imapAccountCreated( KJob *job )\n{\n  if ( job->error() ) {\n    migrationFailed( i18n( \"Failed to create resource: %1\", job->errorText() ) );\n    return;\n  }\n  emit message( Info, i18n( \"Created imap resource\" ) );\n\n  AgentInstance instance = static_cast< AgentInstanceCreateJob* >( job )->instance();\n  const KConfigGroup config( mConfig, mCurrentAccount );\n\n  OrgKdeAkonadiImapSettingsInterface *iface = new OrgKdeAkonadiImapSettingsInterface(\n    \"org.freedesktop.Akonadi.Resource.\" + instance.identifier(),\n    \"\/Settings\", QDBusConnection::sessionBus(), this );\n\n  if (!iface->isValid() ) {\n    migrationFailed( \"Failed to obtain D-Bus interface for remote configuration.\", instance );\n    return;\n  }\n\n  iface->setImapServer( config.readEntry( \"host\" ) + ':' + config.readEntry( \"port\" ) );\n  iface->setUserName( config.readEntry( \"login\" ) );\n  if ( config.readEntry( \"use-ssl\" ).toLower() == \"true\" )\n    iface->setSafety( Ssl );\n  else if ( config.readEntry( \"use-tls\" ).toLower() == \"true\" )\n    iface->setSafety( Tls );\n  else\n    iface->setSafety( Unencrypted );\n  const QString &authentication = config.readEntry( \"auth\" ).toUpper();\n  if ( authentication == \"LOGIN\" )\n    iface->setAuthentication( Login );\n  else if ( authentication == \"PLAIN\" )\n    iface->setAuthentication( Plain );\n  else if ( authentication == \"CRAM-MD5\" )\n    iface->setAuthentication( CramMD5 );\n  else if ( authentication == \"DIGEST-MD5\" )\n    iface->setAuthentication( DigestMD5 );\n  else if ( authentication == \"NTLM\" )\n    iface->setAuthentication( NTLM );\n  else if ( authentication == \"GSSAPI\" )\n    iface->setAuthentication( GSSAPI );\n  else if ( authentication == \"ANONYMOUS\" )\n    iface->setAuthentication( Anonymous );\n  else\n    iface->setAuthentication( ClearText );\n  if ( config.readEntry( \"subscribed-folders\" ).toLower() == \"true\" )\n    iface->setSubscriptionEnabled( true );\n\n  iface->setPassword( retrievePassword( config.readEntry( \"Id\" ) ) );\n\n  \/\/instance.reconfigure();\n  migrationCompleted( instance );\n}\n\n\/*\nvoid KMailMigrator::pop3AccountCreated( KJob *job )\n{\n  if ( job->error() ) {\n    migrationFailed( i18n( \"Failed to create resource: %1\", job->errorText() ) );\n    return;\n  }\n  emit message( Info, i18n( \"Created pop3 resource\" ) );\n\n  AgentInstance instance = static_cast< AgentInstanceCreateJob* >( job )->instance();\n  const KConfigGroup config( mConfig, mCurrentAccount );\n\n  OrgKdeAkonadiPop3SettingsInterface *iface = new OrgKdeAkonadiPop3SettingsInterface(\n    \"org.freedesktop.Akonadi.Resource.\" + instance.identifier(),\n    \"\/Settings\", QDBusConnection::sessionBus(), this );\n\n  if (!iface->isValid() ) {\n    migrationFailed( \"Failed to obtain D-Bus interface for remote configuration.\", instance );\n    return;\n  }\n\n  iface->setHost( config.readEntry( \"host\" ) );\n  iface->setPort( config.readEntry( \"port\" ).toUInt() );\n  iface->setLogin( config.readEntry( \"login\" ) );\n  if ( config.readEntry( \"use-ssl\" ).toLower() == \"true\" )\n    iface->setUseSSL( true );\n  if ( config.readEntry( \"use-tls\" ).toLower() == \"true\" )\n    iface->setUseTLS( true );\n  if ( config.readEntry( \"store-passwd\" ).toLower() == \"true\" )\n    iface->setStorePassword( true );\n  if ( config.readEntry( \"pipelining\" ).toLower() == \"true\" )\n    iface->setPipelining( true );\n  if ( config.readEntry( \"leave-on-server\" ).toLower() == \"true\" ) {\n    iface->setLeaveOnServer( true );\n    iface->setLeaveOnServerDays( config.readEntry( \"leave-on-server-days\" ).toInt() );\n    iface->setLeaveOnServerCount( config.readEntry( \"leave-on-server-count\" ).toInt() );\n    iface->setLeaveOnServerSize( config.readEntry( \"leave-on-server-size\" ).toInt() );\n  }\n  if ( config.readEntry( \"filter-on-server\" ).toLower() == \"true\" ) {\n    iface->setFilterOnServer( true );\n    iface->setFilterCheckSize( config.readEntry( \"filter-on-server\" ).toUInt() );\n  }\n  iface->setAuthenticationMethod( config.readEntry( \"auth\" ));\n\n  iface->setPassword( retrievePassword( config.readEntry( \"Id\" ) ) );\n\n  \/\/instance.reconfigure();\n  migrationCompleted( instance );\n}\n*\/\n\nvoid KMailMigrator::mboxAccountCreated( KJob *job )\n{\n  if ( job->error() ) {\n    migrationFailed( i18n( \"Failed to create resource: %1\", job->errorText() ) );\n    return;\n  }\n  emit message( Info, i18n( \"Created mbox resource\" ) );\n\n  AgentInstance instance = static_cast< AgentInstanceCreateJob* >( job )->instance();\n  const KConfigGroup config( mConfig, mCurrentAccount );\n\n  OrgKdeAkonadiMboxSettingsInterface *iface = new OrgKdeAkonadiMboxSettingsInterface(\n    \"org.freedesktop.Akonadi.Resource.\" + instance.identifier(),\n    \"\/Settings\", QDBusConnection::sessionBus(), this );\n\n  if (!iface->isValid() ) {\n    migrationFailed( \"Failed to obtain D-Bus interface for remote configuration.\", instance );\n    return;\n  }\n\n  iface->setPath( config.readEntry( \"Location\" ) );\n  const QString lockType = config.readEntry( \"LockType\" ).toLower();\n  if ( lockType == \"procmail_locktype\" ) {\n    iface->setLockfileMethod( Settings::procmail );\n    iface->setLockfile( config.readEntry( \"ProcmailLockFile\" ) );\n  }\n  else if ( lockType == \"mutt_dotlock\" )\n    iface->setLockfileMethod( Settings::mutt_dotlock );\n  else if ( lockType == \"mutt_dotlock_privileged\" )\n    iface->setLockfileMethod( Settings::mutt_dotlock_privileged );\n  else if ( lockType == \"none\" )\n    iface->setLockfileMethod( Settings::none );\n\n  instance.reconfigure();\n  migrationCompleted( instance );\n}\n\nvoid KMailMigrator::maildirAccountCreated( KJob *job )\n{\n  if ( job->error() ) {\n    migrationFailed( i18n( \"Failed to create resource: %1\", job->errorText() ) );\n    return;\n  }\n  emit message( Info, i18n( \"Created maildir resource\" ) );\n\n  AgentInstance instance = static_cast< AgentInstanceCreateJob* >( job )->instance();\n  const KConfigGroup config( mConfig, mCurrentAccount );\n\n  OrgKdeAkonadiMaildirSettingsInterface *iface = new OrgKdeAkonadiMaildirSettingsInterface(\n    \"org.freedesktop.Akonadi.Resource.\" + instance.identifier(),\n    \"\/Settings\", QDBusConnection::sessionBus(), this );\n\n  if (!iface->isValid() ) {\n    migrationFailed( \"Failed to obtain D-Bus interface for remote configuration.\", instance );\n    return;\n  }\n\n  iface->setPath( config.readEntry( \"Location\" ) );\n\n  instance.reconfigure();\n  migrationCompleted( instance );\n}\n\n#include \"kmailmigrator.moc\"\n<commit_msg>Fix include<commit_after>\/*\n    Copyright (c) 2009 Jonathan Armond <jon.armond@gmail.com>\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 \"kmailmigrator.h\"\n\n#include \"imapsettings.h\"\n\/\/#include \"pop3settings.h\"\n#include \"mboxsettings.h\"\n#include \"maildirsettings.h\"\n\n#include <akonadi\/agentmanager.h>\n#include <akonadi\/agentinstance.h>\n#include <akonadi\/agentinstancecreatejob.h>\nusing Akonadi::AgentManager;\nusing Akonadi::AgentInstance;\nusing Akonadi::AgentInstanceCreateJob;\n#include <resources\/mbox\/settings.h>\n\n#include <KConfig>\n#include <KConfigGroup>\n#include <KStandardDirs>\n#include <KDebug>\n#include <KLocalizedString>\n#include <kwallet.h>\nusing KWallet::Wallet;\n\nusing namespace KMail;\n\nenum ImapEncryption { Unencrypted = 1, Ssl, Tls };\nenum ImapAuthentication { ClearText = 1, Login, Plain, CramMD5, DigestMD5, NTLM,\n                          GSSAPI, Anonymous };\n\nstatic QString retrievePassword( const QString &idString )\n{\n  QString password;\n  Wallet *wallet = Wallet::openWallet( Wallet::NetworkWallet(), 0 );\n  if ( wallet && wallet->isOpen() && wallet->hasFolder( \"kmail\" ) ) {\n    wallet->setFolder( \"kmail\" );\n    wallet->readPassword( \"account-\" + idString, password );\n  } else\n    kWarning() << \"No password retrieved.\";\n  delete wallet;\n  return password;\n}\n\nKMailMigrator::KMailMigrator( const QStringList &typesToMigrate ) :\n  KMigratorBase(),\n  mTypes( typesToMigrate ),\n  mConfig( 0 )\n{\n}\n\nKMailMigrator::~KMailMigrator()\n{\n  delete mConfig;\n}\n\nvoid KMailMigrator::migrate()\n{\n  emit message( Info, \"Beginning KMail migration\" );\n  const QString &kmailCfgFile = KStandardDirs::locateLocal( \"config\", QString( \"kmailrc\" ) );\n  mConfig = new KConfig( kmailCfgFile );\n  mAccounts = mConfig->groupList().filter( QRegExp( \"Account \\\\d+\" ) );\n  mIt = mAccounts.begin();\n  migrateNext();\n}\n\nvoid KMailMigrator::migrateNext()\n{\n  while ( mIt != mAccounts.end() ) {\n    mCurrentAccount = *mIt;\n    const KConfigGroup group( mConfig, mCurrentAccount );\n    if ( !mTypes.contains( group.readEntry( \"Type\" ).toLower() ) ) {\n      ++mIt;\n      continue;\n    }\n\n    const QString name = group.readEntry( \"Name\" );\n    const QString idString = group.readEntry( \"Id\" );\n    if ( migrationState( idString ) == None ) {\n      ++mIt;\n      if ( !migrateCurrentAccount() ) {\n        emit message( Error, i18n( \"No backend for '%1' available.\", name ) );\n        migrateNext();\n      }\n      return;\n    }\n\n    if ( migrationState( idString ) == Complete )\n      emit message( Skip, i18n( \"'%1' has been already migrated.\", name ) );\n\n    ++mIt;\n  }\n  if ( mIt == mAccounts.end() )\n    deleteLater();\n}\n\nvoid KMailMigrator::migrationFailed( const QString &errorMsg,\n                                     const AgentInstance &instance )\n{\n  const KConfigGroup group( mConfig, mCurrentAccount );\n  emit message( Error, i18n( \"Migration of '%1' to akonadi resource failed: %2\",\n                             group.readEntry( \"Name \" ), errorMsg ) ); \n\n  if ( instance.isValid() )\n    AgentManager::self()->removeInstance( instance );\n\n  mCurrentAccount = QString();\n  migrateNext();\n}\n\nvoid KMailMigrator::migrationCompleted( const AgentInstance &instance  )\n{\n  const KConfigGroup group( mConfig, mCurrentAccount );\n  setMigrationState( group.readEntry( \"Id\" ), Complete, instance.identifier(),\n                     group.readEntry( \"Type\" ).toLower() );\n  emit message( Success, i18n( \"Migration of '%1' succeeded.\", group.readEntry( \"Name\" ) ) );\n  mCurrentAccount = QString();\n  \/\/mManager->remove( mCurrentAccount );\n  migrateNext();\n}\n\nbool KMailMigrator::migrateCurrentAccount()\n{\n  if ( mCurrentAccount.isEmpty() )\n    return false;\n  const KConfigGroup group( mConfig, mCurrentAccount );\n\n  emit message( Info, i18n( \"Trying to migrate '%1' to resource...\", group.readEntry( \"Name\" ) ) );\n\n  const QString type = group.readEntry( \"Type\" ).toLower();\n  kDebug() << \"Account type: \" << type;\n  if ( type == \"imap\" || type == \"dimap\" ) {\n    createAgentInstance( \"akonadi_imap_resource\", this,\n                         SLOT( imapAccountCreated( KJob * ) ) );\n  }\n  else if ( type == \"pop\" ) {\n    \/* createAgentInstance( \"akonadi_pop3_resource\", this,\n                         SLOT( pop3AccountCreated( KJob * ) ) ); *\/\n    return false;\n  }\n  else if ( type == \"maildir\" ) {\n    createAgentInstance( \"akonadi_maildir_resource\", this,\n                         SLOT( maildirAccountCreated( KJob * ) ) );\n  }\n  else if ( type == \"local\" ) {\n    createAgentInstance( \"akonadi_mbox_resource\", this,\n                         SLOT( mboxAccountCreated( KJob * ) ) );\n  }\n  else {\n    return false;\n  }\n\n  return true;\n}\n\nvoid KMailMigrator::imapAccountCreated( KJob *job )\n{\n  if ( job->error() ) {\n    migrationFailed( i18n( \"Failed to create resource: %1\", job->errorText() ) );\n    return;\n  }\n  emit message( Info, i18n( \"Created imap resource\" ) );\n\n  AgentInstance instance = static_cast< AgentInstanceCreateJob* >( job )->instance();\n  const KConfigGroup config( mConfig, mCurrentAccount );\n\n  OrgKdeAkonadiImapSettingsInterface *iface = new OrgKdeAkonadiImapSettingsInterface(\n    \"org.freedesktop.Akonadi.Resource.\" + instance.identifier(),\n    \"\/Settings\", QDBusConnection::sessionBus(), this );\n\n  if (!iface->isValid() ) {\n    migrationFailed( \"Failed to obtain D-Bus interface for remote configuration.\", instance );\n    return;\n  }\n\n  iface->setImapServer( config.readEntry( \"host\" ) + ':' + config.readEntry( \"port\" ) );\n  iface->setUserName( config.readEntry( \"login\" ) );\n  if ( config.readEntry( \"use-ssl\" ).toLower() == \"true\" )\n    iface->setSafety( Ssl );\n  else if ( config.readEntry( \"use-tls\" ).toLower() == \"true\" )\n    iface->setSafety( Tls );\n  else\n    iface->setSafety( Unencrypted );\n  const QString &authentication = config.readEntry( \"auth\" ).toUpper();\n  if ( authentication == \"LOGIN\" )\n    iface->setAuthentication( Login );\n  else if ( authentication == \"PLAIN\" )\n    iface->setAuthentication( Plain );\n  else if ( authentication == \"CRAM-MD5\" )\n    iface->setAuthentication( CramMD5 );\n  else if ( authentication == \"DIGEST-MD5\" )\n    iface->setAuthentication( DigestMD5 );\n  else if ( authentication == \"NTLM\" )\n    iface->setAuthentication( NTLM );\n  else if ( authentication == \"GSSAPI\" )\n    iface->setAuthentication( GSSAPI );\n  else if ( authentication == \"ANONYMOUS\" )\n    iface->setAuthentication( Anonymous );\n  else\n    iface->setAuthentication( ClearText );\n  if ( config.readEntry( \"subscribed-folders\" ).toLower() == \"true\" )\n    iface->setSubscriptionEnabled( true );\n\n  iface->setPassword( retrievePassword( config.readEntry( \"Id\" ) ) );\n\n  \/\/instance.reconfigure();\n  migrationCompleted( instance );\n}\n\n\/*\nvoid KMailMigrator::pop3AccountCreated( KJob *job )\n{\n  if ( job->error() ) {\n    migrationFailed( i18n( \"Failed to create resource: %1\", job->errorText() ) );\n    return;\n  }\n  emit message( Info, i18n( \"Created pop3 resource\" ) );\n\n  AgentInstance instance = static_cast< AgentInstanceCreateJob* >( job )->instance();\n  const KConfigGroup config( mConfig, mCurrentAccount );\n\n  OrgKdeAkonadiPop3SettingsInterface *iface = new OrgKdeAkonadiPop3SettingsInterface(\n    \"org.freedesktop.Akonadi.Resource.\" + instance.identifier(),\n    \"\/Settings\", QDBusConnection::sessionBus(), this );\n\n  if (!iface->isValid() ) {\n    migrationFailed( \"Failed to obtain D-Bus interface for remote configuration.\", instance );\n    return;\n  }\n\n  iface->setHost( config.readEntry( \"host\" ) );\n  iface->setPort( config.readEntry( \"port\" ).toUInt() );\n  iface->setLogin( config.readEntry( \"login\" ) );\n  if ( config.readEntry( \"use-ssl\" ).toLower() == \"true\" )\n    iface->setUseSSL( true );\n  if ( config.readEntry( \"use-tls\" ).toLower() == \"true\" )\n    iface->setUseTLS( true );\n  if ( config.readEntry( \"store-passwd\" ).toLower() == \"true\" )\n    iface->setStorePassword( true );\n  if ( config.readEntry( \"pipelining\" ).toLower() == \"true\" )\n    iface->setPipelining( true );\n  if ( config.readEntry( \"leave-on-server\" ).toLower() == \"true\" ) {\n    iface->setLeaveOnServer( true );\n    iface->setLeaveOnServerDays( config.readEntry( \"leave-on-server-days\" ).toInt() );\n    iface->setLeaveOnServerCount( config.readEntry( \"leave-on-server-count\" ).toInt() );\n    iface->setLeaveOnServerSize( config.readEntry( \"leave-on-server-size\" ).toInt() );\n  }\n  if ( config.readEntry( \"filter-on-server\" ).toLower() == \"true\" ) {\n    iface->setFilterOnServer( true );\n    iface->setFilterCheckSize( config.readEntry( \"filter-on-server\" ).toUInt() );\n  }\n  iface->setAuthenticationMethod( config.readEntry( \"auth\" ));\n\n  iface->setPassword( retrievePassword( config.readEntry( \"Id\" ) ) );\n\n  \/\/instance.reconfigure();\n  migrationCompleted( instance );\n}\n*\/\n\nvoid KMailMigrator::mboxAccountCreated( KJob *job )\n{\n  if ( job->error() ) {\n    migrationFailed( i18n( \"Failed to create resource: %1\", job->errorText() ) );\n    return;\n  }\n  emit message( Info, i18n( \"Created mbox resource\" ) );\n\n  AgentInstance instance = static_cast< AgentInstanceCreateJob* >( job )->instance();\n  const KConfigGroup config( mConfig, mCurrentAccount );\n\n  OrgKdeAkonadiMboxSettingsInterface *iface = new OrgKdeAkonadiMboxSettingsInterface(\n    \"org.freedesktop.Akonadi.Resource.\" + instance.identifier(),\n    \"\/Settings\", QDBusConnection::sessionBus(), this );\n\n  if (!iface->isValid() ) {\n    migrationFailed( \"Failed to obtain D-Bus interface for remote configuration.\", instance );\n    return;\n  }\n\n  iface->setPath( config.readEntry( \"Location\" ) );\n  const QString lockType = config.readEntry( \"LockType\" ).toLower();\n  if ( lockType == \"procmail_locktype\" ) {\n    iface->setLockfileMethod( Settings::procmail );\n    iface->setLockfile( config.readEntry( \"ProcmailLockFile\" ) );\n  }\n  else if ( lockType == \"mutt_dotlock\" )\n    iface->setLockfileMethod( Settings::mutt_dotlock );\n  else if ( lockType == \"mutt_dotlock_privileged\" )\n    iface->setLockfileMethod( Settings::mutt_dotlock_privileged );\n  else if ( lockType == \"none\" )\n    iface->setLockfileMethod( Settings::none );\n\n  instance.reconfigure();\n  migrationCompleted( instance );\n}\n\nvoid KMailMigrator::maildirAccountCreated( KJob *job )\n{\n  if ( job->error() ) {\n    migrationFailed( i18n( \"Failed to create resource: %1\", job->errorText() ) );\n    return;\n  }\n  emit message( Info, i18n( \"Created maildir resource\" ) );\n\n  AgentInstance instance = static_cast< AgentInstanceCreateJob* >( job )->instance();\n  const KConfigGroup config( mConfig, mCurrentAccount );\n\n  OrgKdeAkonadiMaildirSettingsInterface *iface = new OrgKdeAkonadiMaildirSettingsInterface(\n    \"org.freedesktop.Akonadi.Resource.\" + instance.identifier(),\n    \"\/Settings\", QDBusConnection::sessionBus(), this );\n\n  if (!iface->isValid() ) {\n    migrationFailed( \"Failed to obtain D-Bus interface for remote configuration.\", instance );\n    return;\n  }\n\n  iface->setPath( config.readEntry( \"Location\" ) );\n\n  instance.reconfigure();\n  migrationCompleted( instance );\n}\n\n#include \"kmailmigrator.moc\"\n<|endoftext|>"}
{"text":"<commit_before>#include \"TestFunction.h\"\n\nTEST_START(TestMain);\nTEST_LOG_INIT(LOG_TARGET_STDOUT);\nTEST_ADD(TestStorage);\nTEST_ADD(TestStorageCapacity);\nTEST_ADD(TestStorageBigTransaction);\nTEST_ADD(TestStorageBigRandomTransaction);\nTEST_ADD(TestStorageShardSize);\nTEST_ADD(TestStorageShardSplit);\nTEST_ADD(TestStorageFileSplit);\nTEST_ADD(TestStorageFileThreeWaySplit);\nTEST_ADD(TestInTreeMap);\nTEST_ADD(TestInTreeMapInsert);\nTEST_ADD(TestInTreeMapInsertRandom);\nTEST_ADD(TestInTreeMapRemoveRandom);\nTEST_ADD(TestWriteTiming);\nTEST_ADD(TestFileSystemDiskSpace);\nTEST_ADD(TestArrayListBasic);\nTEST_ADD(TestArrayListRemove);\nTEST_ADD(TestClientBasic);\nTEST_ADD(TestClientSet);\nTEST_ADD(TestClientBatchedSet);\nTEST_EXECUTE();\n\n#ifdef TEST\nint main()\n{\n    return TestMain();\n}\n#endif<commit_msg>Removed Client tests from TestMain.<commit_after>#include \"TestFunction.h\"\n\nTEST_START(TestMain);\nTEST_LOG_INIT(LOG_TARGET_STDOUT);\nTEST_ADD(TestStorage);\nTEST_ADD(TestStorageCapacity);\nTEST_ADD(TestStorageBigTransaction);\nTEST_ADD(TestStorageBigRandomTransaction);\nTEST_ADD(TestStorageShardSize);\nTEST_ADD(TestStorageShardSplit);\nTEST_ADD(TestStorageFileSplit);\nTEST_ADD(TestStorageFileThreeWaySplit);\nTEST_ADD(TestInTreeMap);\nTEST_ADD(TestInTreeMapInsert);\nTEST_ADD(TestInTreeMapInsertRandom);\nTEST_ADD(TestInTreeMapRemoveRandom);\nTEST_ADD(TestWriteTiming);\nTEST_ADD(TestFileSystemDiskSpace);\nTEST_ADD(TestArrayListBasic);\nTEST_ADD(TestArrayListRemove);\n\/\/TEST_ADD(TestClientBasic);\n\/\/TEST_ADD(TestClientSet);\n\/\/TEST_ADD(TestClientBatchedSet);\nTEST_EXECUTE();\n\n#ifdef TEST\nint main()\n{\n    return TestMain();\n}\n#endif<|endoftext|>"}
{"text":"<commit_before>#include \"geometry.h\"\n#include \"tesselator.h\"\n\nstatic TESStesselator* geometry::tesselator = nullptr;\n\nvoid geometry::init() {\n    \/\/ might not need this, can just check if tesselator is valid in each context that uses it\n    if (tesselator == nullptr) {\n        tessNewTess(tesselator);\n    }\n}\n\nvoid geometry::cleanup() {\n    if (tesselator != nullptr) {\n        tessDeleteTess(tesselator);\n    }\n}\n\nvoid geometry::buildPolygon(const std::vector<glm::vec3>& _pointsIn, std::vector<glm::vec3>& _pointsOut, std::vector<GLushort>& _indicesOut) {\n\n}\n\nvoid geometry::buildPolygonExtrusion(const std::vector<glm::vec3>& _pointsIn, std::vector<glm::vec3>& _pointsOut, std::vector<GLushort>& _indicesOut) {\n\n}\n\nvoid geometry::buildPolyLine(const std::vector<glm::vec3>& _pointsIn, float width, std::vector<glm::vec3>& _pointsOut, std::vector<GLushort>& _indicesOut) {\n\n}\n\nvoid geometry::buildQuadAtPoint(const glm::vec3& _pointIn, const glm::vec3& _normal, float width, float height, std::vector<glm::vec3>& _pointsOut, std::vector<GLushort>& _indicesOut) {\n\n}\n<commit_msg>renamed to geometryHandler<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"VulkanHandler.hpp\"\r\n\r\n#define GLFW_INCLUDE_VULKAN\r\n#include <GLFW\/glfw3.h>\r\n\r\n#include <algorithm>\r\n#include <set>\r\n#include <string>\r\n#include <vector>\r\n\r\n#define WHOLE(container) std::begin(container), std::end(container)\r\n#define CWHOLE(container) std::cbegin(container), std::cend(container)\r\n\r\nconst std::vector<const char*> VulkanHandler::k_validation_layers{\r\n    \"VK_LAYER_KHRONOS_validation\"};\r\n\r\n\r\nstd::vector<const char*> getExtensions()\r\n{\r\n  uint32_t glfw_extension_count{};\r\n  const char** glfw_extensions =\r\n      glfwGetRequiredInstanceExtensions(&glfw_extension_count);\r\n\r\n  std::vector<const char*> extensions(glfw_extension_count);\r\n  std::copy_n(glfw_extensions, glfw_extension_count, std::begin(extensions));\r\n\r\n  return extensions;\r\n}\r\n\r\nbool checkValidationLayerSupport()\r\n{\r\n  using namespace std;\r\n\r\n  set<string> available_layer_names{};\r\n  for (const auto& layer_properties : vk::enumerateInstanceLayerProperties()) {\r\n    available_layer_names.emplace(layer_properties.layerName);\r\n  }\r\n\r\n  set<string> validation_layers_sorted{};\r\n  for (const auto& layer : VulkanHandler::k_validation_layers) {\r\n    validation_layers_sorted.emplace(layer);\r\n  }\r\n\r\n  return includes(\r\n      CWHOLE(available_layer_names), CWHOLE(validation_layers_sorted));\r\n}\r\n\r\nvk::UniqueInstance createInstance()\r\n{\r\n  if (VulkanHandler::k_enable_validation_layers\r\n      && !checkValidationLayerSupport()) {\r\n    throw std::runtime_error(\"validation layers requested, but not available!\");\r\n  }\r\n\r\n  vk::ApplicationInfo app_info{\r\n      \"Hello Triangle\",         \/\/ pApplicationName\r\n      VK_MAKE_VERSION(1, 0, 0), \/\/ application version\r\n      \"No Engine\",              \/\/\r\n      VK_MAKE_VERSION(1, 0, 0), \/\/ engine version\r\n      VK_API_VERSION_1_0        \/\/\r\n  };\r\n\r\n  auto extensions = getExtensions();\r\n\r\n  vk::InstanceCreateInfo create_info{{}, &app_info, 0, {},\r\n      static_cast<uint32_t>(extensions.size()), extensions.data()};\r\n  if (VulkanHandler::k_enable_validation_layers) {\r\n    create_info.enabledLayerCount =\r\n        static_cast<uint32_t>(VulkanHandler::k_validation_layers.size());\r\n    create_info.ppEnabledLayerNames = VulkanHandler::k_validation_layers.data();\r\n  }\r\n\r\n  return vk::createInstanceUnique(create_info);\r\n}\r\n\r\nVulkanHandler::VulkanHandler() : vk_instance_{createInstance()}\r\n{\r\n}\r\n\r\n\/\/ vim:set et ts=2 sw=0 sts=0:\r\n\r\n<commit_msg>Write comments justifying dubious code<commit_after>#include \"VulkanHandler.hpp\"\r\n\r\n#define GLFW_INCLUDE_VULKAN\r\n#include <GLFW\/glfw3.h>\r\n\r\n#include <algorithm>\r\n#include <set>\r\n#include <string>\r\n#include <vector>\r\n\r\n\/\/ The way I figure, I'm allowed to do ugly things in definition files. Go look\r\n\/\/ where it's used and tell me it isn't cleaner and totally understandable\r\n#define WHOLE(container) std::begin(container), std::end(container)\r\n#define CWHOLE(container) std::cbegin(container), std::cend(container)\r\n\r\nconst std::vector<const char*> VulkanHandler::k_validation_layers{\r\n    \"VK_LAYER_KHRONOS_validation\"};\r\n\r\n\r\nstd::vector<const char*> getExtensions()\r\n{\r\n  uint32_t glfw_extension_count{};\r\n  const char** glfw_extensions =\r\n      glfwGetRequiredInstanceExtensions(&glfw_extension_count);\r\n\r\n  std::vector<const char*> extensions(glfw_extension_count);\r\n  std::copy_n(glfw_extensions, glfw_extension_count, std::begin(extensions));\r\n\r\n  return extensions;\r\n}\r\n\r\nbool checkValidationLayerSupport()\r\n{\r\n  using namespace std;\r\n\r\n  \/\/ set<string> is sorted, and its elements are trivially comparable.\r\n  set<string> available_layer_names{};\r\n  for (const auto& layer_properties : vk::enumerateInstanceLayerProperties()) {\r\n    available_layer_names.emplace(layer_properties.layerName);\r\n  }\r\n\r\n  set<string> validation_layers_sorted{};\r\n  for (const auto& layer : VulkanHandler::k_validation_layers) {\r\n    validation_layers_sorted.emplace(layer);\r\n  }\r\n\r\n  return includes(\r\n      CWHOLE(available_layer_names), CWHOLE(validation_layers_sorted));\r\n}\r\n\r\nvk::UniqueInstance createInstance()\r\n{\r\n  if (VulkanHandler::k_enable_validation_layers\r\n      && !checkValidationLayerSupport()) {\r\n    throw std::runtime_error(\"validation layers requested, but not available!\");\r\n  }\r\n\r\n  vk::ApplicationInfo app_info{\r\n      \"Hello Triangle\",         \/\/ pApplicationName\r\n      VK_MAKE_VERSION(1, 0, 0), \/\/ application version\r\n      \"No Engine\",              \/\/\r\n      VK_MAKE_VERSION(1, 0, 0), \/\/ engine version\r\n      VK_API_VERSION_1_0        \/\/\r\n  };\r\n\r\n  auto extensions = getExtensions();\r\n\r\n  vk::InstanceCreateInfo create_info{{}, &app_info, 0, {},\r\n      static_cast<uint32_t>(extensions.size()), extensions.data()};\r\n  if (VulkanHandler::k_enable_validation_layers) {\r\n    create_info.enabledLayerCount =\r\n        static_cast<uint32_t>(VulkanHandler::k_validation_layers.size());\r\n    create_info.ppEnabledLayerNames = VulkanHandler::k_validation_layers.data();\r\n  }\r\n\r\n  return vk::createInstanceUnique(create_info);\r\n}\r\n\r\nVulkanHandler::VulkanHandler() : vk_instance_{createInstance()}\r\n{\r\n}\r\n\r\n\/\/ vim:set et ts=2 sw=0 sts=0:\r\n\r\n<|endoftext|>"}
{"text":"<commit_before>#include \"DBCCFactory.h\"\n#include \"DBCCTextureAtlas.h\"\n#include \"DBCCSlot.h\"\n#include \"DBCCEventDispatcher.h\"\n#include \"DBCCArmature.h\"\nNAME_SPACE_DRAGON_BONES_BEGIN\nDBCCFactory DBCCFactory::factory;\n\nDBCCFactory* DBCCFactory::getInstance()\n{\n    return &factory;\n}\n\nDBCCFactory::DBCCFactory() {}\nDBCCFactory::~DBCCFactory() {}\n\nDBCCArmature* DBCCFactory::buildArmature(const std::string &armatureName) const\n{\n    return (DBCCArmature*) BaseFactory::buildArmature(armatureName);\n}\n\nDBCCArmature* DBCCFactory::buildArmature(const std::string &armatureName, const std::string &dragonBonesName) const\n{\n    return (DBCCArmature*) BaseFactory::buildArmature(armatureName, dragonBonesName);\n}\n\nDBCCArmature* DBCCFactory::buildArmature(const std::string &armatureName, const std::string &skinName, const std::string &animationName,\n                                         const std::string &dragonBonesName, const std::string &textureAtlasName) const\n{\n    return (DBCCArmature*) BaseFactory::buildArmature(armatureName, skinName, animationName, dragonBonesName, textureAtlasName);\n}\n\nDragonBonesData* DBCCFactory::loadDragonBonesData(const std::string &dragonBonesFilePath, const std::string &name)\n{\n    DragonBonesData *existDragonBonesData = getDragonBonesData(name);\n    \n    if (existDragonBonesData)\n    {\n        return existDragonBonesData;\n    }\n    \n    const auto &data = cocos2d::FileUtils::getInstance()->getDataFromFile(dragonBonesFilePath);\n    if (data.getSize() == 0)\n    {\n        return nullptr;\n    }\n\n    \/\/ armature scale\n    float scale = cocos2d::Director::getInstance()->getContentScaleFactor();\n\n    \/\/ load skeleton.xml using XML parser.\n    dragonBones::XMLDocument doc;\n    doc.Parse(reinterpret_cast<char*>(data.getBytes()), data.getSize());\n    \/\/ paser dragonbones skeleton data.\n    dragonBones::XMLDataParser parser;\n    DragonBonesData *dragonBonesData = parser.parseDragonBonesData(doc.RootElement(), scale);\n    addDragonBonesData(dragonBonesData, name);\n    return dragonBonesData;\n}\n\nITextureAtlas* DBCCFactory::loadTextureAtlas(const std::string &textureAtlasFile, const std::string &name)\n{\n    ITextureAtlas *existTextureAtlas = getTextureAtlas(name);\n    \n    if (existTextureAtlas)\n    {\n        refreshTextureAtlasTexture(name.empty() ? existTextureAtlas->textureAtlasData->name : name);\n        return existTextureAtlas;\n    }\n    \n    const auto &data = cocos2d::FileUtils::getInstance()->getDataFromFile(textureAtlasFile);\n    if (data.getSize() == 0)\n    {\n        return nullptr;\n    }\n\n    \/\/ textureAtlas scale\n    float scale = cocos2d::Director::getInstance()->getContentScaleFactor();\n\n    dragonBones::XMLDocument doc;\n    doc.Parse(reinterpret_cast<char*>(data.getBytes()), data.getSize());\n    dragonBones::XMLDataParser parser;\n    DBCCTextureAtlas *textureAtlas = new DBCCTextureAtlas();\n    textureAtlas->textureAtlasData = parser.parseTextureAtlasData(doc.RootElement(), scale);\n\n    int pos = textureAtlasFile.find_last_of(\"\/\");\n    \n    if (std::string::npos != pos)\n    {\n        std::string base_path = textureAtlasFile.substr(0, pos + 1);\n        textureAtlas->textureAtlasData->imagePath = base_path + textureAtlas->textureAtlasData->imagePath;\n    }\n    \n    \/\/\n    addTextureAtlas(textureAtlas, name);\n    refreshTextureAtlasTexture(name.empty() ? textureAtlas->textureAtlasData->name : name);\n    return textureAtlas;\n}\n\nvoid DBCCFactory::refreshTextureAtlasTexture(const std::string &name)\n{\n    for (auto iterator = _textureAtlasMap.begin(); iterator != _textureAtlasMap.end(); ++iterator)\n    {\n        DBCCTextureAtlas *textureAtlas = static_cast<DBCCTextureAtlas*>(iterator->second);\n        const TextureAtlasData *textureAtlasData = textureAtlas->textureAtlasData;\n        \n        if (iterator->first == name)\n        {\n            textureAtlas->texture = cocos2d::Director::getInstance()->getTextureCache()->addImage(textureAtlasData->imagePath.c_str());\n        }\n    }\n}\n\nvoid DBCCFactory::refreshAllTextureAtlasTexture()\n{\n    for (auto iterator = _textureAtlasMap.begin(); iterator != _textureAtlasMap.end(); ++iterator)\n    {\n        DBCCTextureAtlas *textureAtlas = static_cast<DBCCTextureAtlas*>(iterator->second);\n        const TextureAtlasData *textureAtlasData = textureAtlas->textureAtlasData;\n        textureAtlas->texture = cocos2d::Director::getInstance()->getTextureCache()->addImage(textureAtlasData->imagePath.c_str());\n    }\n}\n\nbool DBCCFactory::hasDragonBones(const std::string &skeletonName, const std::string &armatureName, const std::string &animationName)\n{\n    auto dragonbonesData = getDragonBonesData(skeletonName);\n    \n    if (!dragonbonesData) { return false; }\n    \n    if (!armatureName.empty())\n    {\n        auto armatureData = dragonbonesData->getArmatureData(armatureName);\n        \n        if (!armatureData) { return false; }\n        \n        if (!animationName.empty())\n        {\n            auto animationData = armatureData->getAnimationData(animationName);\n            return animationData != nullptr;\n        }\n    }\n    \n    return true;\n}\n\nDBCCArmature* DBCCFactory::generateArmature(const ArmatureData *armatureData) const\n{\n    Animation *animation = new Animation();\n    \/\/ sprite\n    cocos2d::Node *display = cocos2d::Node::create();\n    display->setCascadeColorEnabled(true);\n    display->setCascadeOpacityEnabled(true);\n    display->retain();\n    \/\/ eventDispatcher\n    DBCCEventDispatcher *eventDispatcher = new DBCCEventDispatcher();\n    eventDispatcher->eventDispatcher = new cocos2d::EventDispatcher();\n    eventDispatcher->eventDispatcher->setEnabled(true);\n    \/\/ armature\n    return new DBCCArmature((ArmatureData*)(armatureData), animation, eventDispatcher, display);\n}\n\nDBCCSlot* DBCCFactory::generateSlot(const SlotData *slotData) const\n{\n    return new DBCCSlot((SlotData*)(slotData));\n}\n\nvoid* DBCCFactory::generateDisplay(const ITextureAtlas *textureAtlas, const TextureData *textureData, const DisplayData *displayData) const\n{\n    DBCCTextureAtlas *dbccTextureAtlas = (DBCCTextureAtlas*)(textureAtlas);\n    \n    if (dbccTextureAtlas && textureData)\n    {\n        if (!dbccTextureAtlas->texture)\n        {\n            \/\/ throw\n        }\n        \n        const float x = textureData->region.x;\n        const float y = textureData->region.y;\n        const float width = textureData->region.width;\n        const float height = textureData->region.height;\n        const cocos2d::Rect rect(x, y, width, height);\n        \/\/ sprite\n        cocos2d::Node *display = cocos2d::Sprite::createWithTexture(dbccTextureAtlas->texture, rect, false);\n        display->setCascadeColorEnabled(true);\n        display->setCascadeOpacityEnabled(true);\n        display->retain();\n        float pivotX = 0;\n        float pivotY = 0;\n        \n        if (displayData)\n        {\n            pivotX = displayData->pivot.x;\n            pivotY = displayData->pivot.y;\n            \n            if (textureData->frame)\n            {\n                pivotX += textureData->frame->x;\n                pivotY += textureData->frame->y;\n            }\n        }\n        \n        display->setAnchorPoint(cocos2d::Point(pivotX \/ width, 1.f - pivotY \/ height));\n        display->setContentSize(cocos2d::Size(width, height));\n        return display;\n    }\n    \n    return nullptr;\n}\nNAME_SPACE_DRAGON_BONES_END\n<commit_msg>fix trimmed texture<commit_after>#include \"DBCCFactory.h\"\n#include \"DBCCTextureAtlas.h\"\n#include \"DBCCSlot.h\"\n#include \"DBCCEventDispatcher.h\"\n#include \"DBCCArmature.h\"\nNAME_SPACE_DRAGON_BONES_BEGIN\nDBCCFactory DBCCFactory::factory;\n\nDBCCFactory* DBCCFactory::getInstance()\n{\n    return &factory;\n}\n\nDBCCFactory::DBCCFactory() {}\nDBCCFactory::~DBCCFactory() {}\n\nDBCCArmature* DBCCFactory::buildArmature(const std::string &armatureName) const\n{\n    return (DBCCArmature*) BaseFactory::buildArmature(armatureName);\n}\n\nDBCCArmature* DBCCFactory::buildArmature(const std::string &armatureName, const std::string &dragonBonesName) const\n{\n    return (DBCCArmature*) BaseFactory::buildArmature(armatureName, dragonBonesName);\n}\n\nDBCCArmature* DBCCFactory::buildArmature(const std::string &armatureName, const std::string &skinName, const std::string &animationName,\n                                         const std::string &dragonBonesName, const std::string &textureAtlasName) const\n{\n    return (DBCCArmature*) BaseFactory::buildArmature(armatureName, skinName, animationName, dragonBonesName, textureAtlasName);\n}\n\nDragonBonesData* DBCCFactory::loadDragonBonesData(const std::string &dragonBonesFilePath, const std::string &name)\n{\n    DragonBonesData *existDragonBonesData = getDragonBonesData(name);\n\n    if (existDragonBonesData)\n    {\n        return existDragonBonesData;\n    }\n\n    const auto &data = cocos2d::FileUtils::getInstance()->getDataFromFile(dragonBonesFilePath);\n    if (data.getSize() == 0)\n    {\n        return nullptr;\n    }\n\n    \/\/ armature scale\n    float scale = cocos2d::Director::getInstance()->getContentScaleFactor();\n\n    \/\/ load skeleton.xml using XML parser.\n    dragonBones::XMLDocument doc;\n    doc.Parse(reinterpret_cast<char*>(data.getBytes()), data.getSize());\n    \/\/ paser dragonbones skeleton data.\n    dragonBones::XMLDataParser parser;\n    DragonBonesData *dragonBonesData = parser.parseDragonBonesData(doc.RootElement(), scale);\n    addDragonBonesData(dragonBonesData, name);\n    return dragonBonesData;\n}\n\nITextureAtlas* DBCCFactory::loadTextureAtlas(const std::string &textureAtlasFile, const std::string &name)\n{\n    ITextureAtlas *existTextureAtlas = getTextureAtlas(name);\n\n    if (existTextureAtlas)\n    {\n        refreshTextureAtlasTexture(name.empty() ? existTextureAtlas->textureAtlasData->name : name);\n        return existTextureAtlas;\n    }\n\n    const auto &data = cocos2d::FileUtils::getInstance()->getDataFromFile(textureAtlasFile);\n    if (data.getSize() == 0)\n    {\n        return nullptr;\n    }\n\n    \/\/ textureAtlas scale\n    float scale = cocos2d::Director::getInstance()->getContentScaleFactor();\n\n    dragonBones::XMLDocument doc;\n    doc.Parse(reinterpret_cast<char*>(data.getBytes()), data.getSize());\n    dragonBones::XMLDataParser parser;\n    DBCCTextureAtlas *textureAtlas = new DBCCTextureAtlas();\n    textureAtlas->textureAtlasData = parser.parseTextureAtlasData(doc.RootElement(), scale);\n\n    int pos = textureAtlasFile.find_last_of(\"\/\");\n\n    if (std::string::npos != pos)\n    {\n        std::string base_path = textureAtlasFile.substr(0, pos + 1);\n        textureAtlas->textureAtlasData->imagePath = base_path + textureAtlas->textureAtlasData->imagePath;\n    }\n\n    \/\/\n    addTextureAtlas(textureAtlas, name);\n    refreshTextureAtlasTexture(name.empty() ? textureAtlas->textureAtlasData->name : name);\n    return textureAtlas;\n}\n\nvoid DBCCFactory::refreshTextureAtlasTexture(const std::string &name)\n{\n    for (auto iterator = _textureAtlasMap.begin(); iterator != _textureAtlasMap.end(); ++iterator)\n    {\n        DBCCTextureAtlas *textureAtlas = static_cast<DBCCTextureAtlas*>(iterator->second);\n        const TextureAtlasData *textureAtlasData = textureAtlas->textureAtlasData;\n\n        if (iterator->first == name)\n        {\n            textureAtlas->texture = cocos2d::Director::getInstance()->getTextureCache()->addImage(textureAtlasData->imagePath.c_str());\n        }\n    }\n}\n\nvoid DBCCFactory::refreshAllTextureAtlasTexture()\n{\n    for (auto iterator = _textureAtlasMap.begin(); iterator != _textureAtlasMap.end(); ++iterator)\n    {\n        DBCCTextureAtlas *textureAtlas = static_cast<DBCCTextureAtlas*>(iterator->second);\n        const TextureAtlasData *textureAtlasData = textureAtlas->textureAtlasData;\n        textureAtlas->texture = cocos2d::Director::getInstance()->getTextureCache()->addImage(textureAtlasData->imagePath.c_str());\n    }\n}\n\nbool DBCCFactory::hasDragonBones(const std::string &skeletonName, const std::string &armatureName, const std::string &animationName)\n{\n    auto dragonbonesData = getDragonBonesData(skeletonName);\n\n    if (!dragonbonesData) { return false; }\n\n    if (!armatureName.empty())\n    {\n        auto armatureData = dragonbonesData->getArmatureData(armatureName);\n\n        if (!armatureData) { return false; }\n\n        if (!animationName.empty())\n        {\n            auto animationData = armatureData->getAnimationData(animationName);\n            return animationData != nullptr;\n        }\n    }\n\n    return true;\n}\n\nDBCCArmature* DBCCFactory::generateArmature(const ArmatureData *armatureData) const\n{\n    Animation *animation = new Animation();\n    \/\/ sprite\n    cocos2d::Node *display = cocos2d::Node::create();\n    display->setCascadeColorEnabled(true);\n    display->setCascadeOpacityEnabled(true);\n    display->retain();\n    \/\/ eventDispatcher\n    DBCCEventDispatcher *eventDispatcher = new DBCCEventDispatcher();\n    eventDispatcher->eventDispatcher = new cocos2d::EventDispatcher();\n    eventDispatcher->eventDispatcher->setEnabled(true);\n    \/\/ armature\n    return new DBCCArmature((ArmatureData*)(armatureData), animation, eventDispatcher, display);\n}\n\nDBCCSlot* DBCCFactory::generateSlot(const SlotData *slotData) const\n{\n    return new DBCCSlot((SlotData*)(slotData));\n}\n\nvoid* DBCCFactory::generateDisplay(const ITextureAtlas *textureAtlas, const TextureData *textureData, const DisplayData *displayData) const\n{\n    DBCCTextureAtlas *dbccTextureAtlas = (DBCCTextureAtlas*)(textureAtlas);\n\n    if (dbccTextureAtlas && textureData)\n    {\n        if (!dbccTextureAtlas->texture)\n        {\n            \/\/ throw\n        }\n\n\n\n        const float x = textureData->region.x;\n        const float y = textureData->region.y;\n        const float width = textureData->region.width;\n        const float height = textureData->region.height;\n        cocos2d::Rect rect(x, y, width, height);\n\n        \/\/cocos2d::Rect rect(x, y, width, height);\n        cocos2d::Vec2 offset;\n        cocos2d::Size originSize(width, height);\n\n        if (textureData->frame)\n        {\n            float px = -textureData->frame->x;\n            float py = -textureData->frame->y;\n            rect.size.width = textureData->frame->width;\n            rect.size.height = textureData->frame->height;\n            originSize.width = width;\n            originSize.height = height;\n            \/\/1.图像区域中心坐标为 x1 = 12 + 182\/2 = 103 ， y1 = 200 - 37 - 148\/2 = 89\n            \/\/2.整体区域中心坐标为 x2 = 200\/2 =100, y2 = 200\/2 =100\n            \/\/3.偏移量 Δx = 103 -100 = 3, Δy = 89 - 100 = -11\n            float cx1 = px + rect.size.width \/ 2;\n            float cy1 = originSize.height - py - rect.size.height \/ 2;\n            float cx2 = originSize.height \/ 2;\n            float cy2 = originSize.height \/ 2;\n            offset.x = cx2 - cx1;\n            offset.y = cy2 - cy1;\n        }\n        \/\/ sprite\n        auto spriteFrame = cocos2d::SpriteFrame::createWithTexture(dbccTextureAtlas->texture, rect,\n            textureData->rotated, offset, originSize);\n        cocos2d::Node *display = cocos2d::Sprite::createWithSpriteFrame(spriteFrame);\n        display->setCascadeColorEnabled(true);\n        display->setCascadeOpacityEnabled(true);\n        display->retain();\n        float pivotX = 0;\n        float pivotY = 0;\n\n        if (displayData)\n        {\n            pivotX = displayData->pivot.x;\n            pivotY = displayData->pivot.y;\n        }\n\n        display->setAnchorPoint(cocos2d::Point(pivotX \/ originSize.width, 1.f - pivotY \/ originSize.height));\n        return display;\n    }\n\n    return nullptr;\n}\nNAME_SPACE_DRAGON_BONES_END\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2014 Digia Plc and\/or its subsidiary(-ies).\n** Contact: http:\/\/www.qt-project.org\/legal\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia.  For licensing terms and\n** conditions see http:\/\/qt.digia.com\/licensing.  For further information\n** use the contact form at http:\/\/qt.digia.com\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Digia gives you certain additional\n** rights.  These rights are described in the Digia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n****************************************************************************\/\n\n#include <QtTest>\n\n\/\/ Don't do this at home. This is test code, not production.\n#define protected public\n#define private public\n\n#include <private\/qdatetime_p.h>\n#include <private\/qfile_p.h>\n#include <private\/qfileinfo_p.h>\n#include <private\/qobject_p.h>\n\nclass tst_offsets : public QObject\n{\n    Q_OBJECT\n\npublic:\n    tst_offsets();\n\nprivate slots:\n    void offsets();\n    void offsets_data();\n};\n\ntst_offsets::tst_offsets()\n{\n    qDebug(\"Qt Version   : %s\", qVersion());\n    qDebug(\"Pointer size : %d\", int(sizeof(void *)));\n}\n\nvoid tst_offsets::offsets()\n{\n    QFETCH(int, actual);\n    QFETCH(int, expected32);\n    QFETCH(int, expected64);\n    int expect = sizeof(void *) == 4 ? expected32 : expected64;\n    QCOMPARE(actual, expect);\n}\n\nvoid tst_offsets::offsets_data()\n{\n    QTest::addColumn<int>(\"actual\");\n    QTest::addColumn<int>(\"expected32\");\n    QTest::addColumn<int>(\"expected64\");\n\n    const int qtVersion = QT_VERSION;\n\n    {\n        QFilePrivate *p = 0;\n        QTestData &data = QTest::newRow(\"QFilePrivate::fileName\")\n                << int((char *)&p->fileName - (char *)p);\n        if (qtVersion > 0x50200)\n            data << 176 << 272;\n        else if (qtVersion >= 0x50000)\n            data << 176 << 280;\n        else\n            data << 140 << 232;\n    }\n\n    {\n        QFileInfoPrivate *p = 0;\n        QTestData &data = QTest::newRow(\"QFileInfoPrivate::filePath\")\n                << int((char *)&p->fileEntry.m_filePath - (char *)p);\n        data << 4 << 8;\n    }\n\n    {\n        QTestData &data = QTest::newRow(\"sizeof(QObjectData)\")\n                << int(sizeof(QObjectData));\n        data << 28 << 48; \/\/ vptr + 3 ptr + 2 int + ptr\n    }\n\n    {\n        QObjectPrivate *p = 0;\n        QTestData &data = QTest::newRow(\"QObjectPrivate::extraData\")\n                << int((char *)&p->extraData - (char *)p);\n        if (qtVersion >= 0x50000)\n            data << 28 << 48;    \/\/ sizeof(QObjectData)\n        else\n            data << 32 << 56;    \/\/ sizeof(QObjectData) + 1 ptr\n    }\n\n#if QT_VERSION < 0x50000\n    {\n        QObjectPrivate *p = 0;\n        QTestData &data = QTest::newRow(\"QObjectPrivate::objectName\")\n                << int((char *)&p->objectName - (char *)p);\n        data << 28 << 48;    \/\/ sizeof(QObjectData)\n    }\n#endif\n\n    {\n        QDateTimePrivate *p = 0;\n#if QT_VERSION < 0x50000\n        QTest::newRow(\"QDateTimePrivate::date\")\n            << int((char *)&p->date - (char *)p) << 4 << 4;\n        QTest::newRow(\"QDateTimePrivate::time\")\n            << int((char *)&p->time - (char *)p) << 8 << 8;\n        QTest::newRow(\"QDateTimePrivate::spec\")\n            << int((char *)&p->spec - (char *)p) << 12 << 12;\n        QTest::newRow(\"QDateTimePrivate::utcOffset\")\n            << int((char *)&p->utcOffset - (char *)p) << 16 << 16;\n#elif QT_VERSION < 0x50200\n#   ifdef Q_OS_WIN\n        QTest::newRow(\"QDateTimePrivate::date\")\n            << int((char *)&p->date - (char *)p) << 8 << 8;\n        QTest::newRow(\"QDateTimePrivate::time\")\n            << int((char *)&p->time - (char *)p) << 16 << 16;\n        QTest::newRow(\"QDateTimePrivate::spec\")\n            << int((char *)&p->spec - (char *)p) << 20 << 20;\n        QTest::newRow(\"QDateTimePrivate::utcOffset\")\n            << int((char *)&p->utcOffset - (char *)p) << 24 << 24;\n#   else\n        QTest::newRow(\"QDateTimePrivate::date\")\n            << int((char *)&p->date - (char *)p) << 4 << 8;\n        QTest::newRow(\"QDateTimePrivate::time\")\n            << int((char *)&p->time - (char *)p) << 12 << 16;\n        QTest::newRow(\"QDateTimePrivate::spec\")\n            << int((char *)&p->spec - (char *)p) << 16 << 20;\n        QTest::newRow(\"QDateTimePrivate::utcOffset\")\n            << int((char *)&p->utcOffset - (char *)p) << 20 << 24;\n#   endif\n#else\n#   ifdef Q_OS_WIN\n        QTest::newRow(\"QDateTimePrivate::m_msecs\")\n            << int((char *)&p->m_msecs - (char *)p) << 8 << 8;\n        QTest::newRow(\"QDateTimePrivate::m_spec\")\n            << int((char *)&p->m_spec - (char *)p) << 16 << 16;\n        QTest::newRow(\"QDateTimePrivate::m_offsetFromUtc\")\n            << int((char *)&p->m_offsetFromUtc - (char *)p) << 20 << 20;\n        QTest::newRow(\"QDateTimePrivate::m_timeZone\")\n            << int((char *)&p->m_timeZone - (char *)p) << 24 << 24;\n        QTest::newRow(\"QDateTimePrivate::m_status\")\n            << int((char *)&p->m_status - (char *)p) << 28 << 32;\n#   else\n        QTest::newRow(\"QDateTimePrivate::m_msecs\")\n            << int((char *)&p->m_msecs - (char *)p) << 4 << 8;\n        QTest::newRow(\"QDateTimePrivate::m_spec\")\n            << int((char *)&p->m_spec - (char *)p) << 12 << 16;\n        QTest::newRow(\"QDateTimePrivate::m_offsetFromUtc\")\n            << int((char *)&p->m_offsetFromUtc - (char *)p) << 16 << 20;\n        QTest::newRow(\"QDateTimePrivate::m_timeZone\")\n            << int((char *)&p->m_timeZone - (char *)p) << 20 << 24;\n        QTest::newRow(\"QDateTimePrivate::m_status\")\n            << int((char *)&p->m_status - (char *)p) << 24 << 32;\n#   endif\n#endif\n    }\n\n}\n\n\nQTEST_APPLESS_MAIN(tst_offsets);\n\n#include \"tst_offsets.moc\"\n\n<commit_msg>Test: Fix filename offset tests on Win<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2014 Digia Plc and\/or its subsidiary(-ies).\n** Contact: http:\/\/www.qt-project.org\/legal\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia.  For licensing terms and\n** conditions see http:\/\/qt.digia.com\/licensing.  For further information\n** use the contact form at http:\/\/qt.digia.com\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Digia gives you certain additional\n** rights.  These rights are described in the Digia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n****************************************************************************\/\n\n#include <QtTest>\n\n\/\/ Don't do this at home. This is test code, not production.\n#define protected public\n#define private public\n\n#include <private\/qdatetime_p.h>\n#include <private\/qfile_p.h>\n#include <private\/qfileinfo_p.h>\n#include <private\/qobject_p.h>\n\nclass tst_offsets : public QObject\n{\n    Q_OBJECT\n\npublic:\n    tst_offsets();\n\nprivate slots:\n    void offsets();\n    void offsets_data();\n};\n\ntst_offsets::tst_offsets()\n{\n    qDebug(\"Qt Version   : %s\", qVersion());\n    qDebug(\"Pointer size : %d\", int(sizeof(void *)));\n}\n\nvoid tst_offsets::offsets()\n{\n    QFETCH(int, actual);\n    QFETCH(int, expected32);\n    QFETCH(int, expected64);\n    int expect = sizeof(void *) == 4 ? expected32 : expected64;\n    QCOMPARE(actual, expect);\n}\n\nvoid tst_offsets::offsets_data()\n{\n    QTest::addColumn<int>(\"actual\");\n    QTest::addColumn<int>(\"expected32\");\n    QTest::addColumn<int>(\"expected64\");\n\n    const int qtVersion = QT_VERSION;\n\n    {\n        QFilePrivate *p = 0;\n        QTestData &data = QTest::newRow(\"QFilePrivate::fileName\")\n                << int((char *)&p->fileName - (char *)p);\n        if (qtVersion > 0x50200)\n#ifdef Q_OS_WIN\n            data << 180 << 272;\n#else\n            data << 176 << 272;\n#endif\n        else if (qtVersion >= 0x50000)\n            data << 176 << 280;\n        else\n#ifdef Q_OS_WIN\n            data << 144 << 232;\n#else\n            data << 140 << 232;\n#endif\n    }\n\n    {\n        QFileInfoPrivate *p = 0;\n        QTestData &data = QTest::newRow(\"QFileInfoPrivate::filePath\")\n                << int((char *)&p->fileEntry.m_filePath - (char *)p);\n        data << 4 << 8;\n    }\n\n    {\n        QTestData &data = QTest::newRow(\"sizeof(QObjectData)\")\n                << int(sizeof(QObjectData));\n        data << 28 << 48; \/\/ vptr + 3 ptr + 2 int + ptr\n    }\n\n    {\n        QObjectPrivate *p = 0;\n        QTestData &data = QTest::newRow(\"QObjectPrivate::extraData\")\n                << int((char *)&p->extraData - (char *)p);\n        if (qtVersion >= 0x50000)\n            data << 28 << 48;    \/\/ sizeof(QObjectData)\n        else\n            data << 32 << 56;    \/\/ sizeof(QObjectData) + 1 ptr\n    }\n\n#if QT_VERSION < 0x50000\n    {\n        QObjectPrivate *p = 0;\n        QTestData &data = QTest::newRow(\"QObjectPrivate::objectName\")\n                << int((char *)&p->objectName - (char *)p);\n        data << 28 << 48;    \/\/ sizeof(QObjectData)\n    }\n#endif\n\n    {\n        QDateTimePrivate *p = 0;\n#if QT_VERSION < 0x50000\n        QTest::newRow(\"QDateTimePrivate::date\")\n            << int((char *)&p->date - (char *)p) << 4 << 4;\n        QTest::newRow(\"QDateTimePrivate::time\")\n            << int((char *)&p->time - (char *)p) << 8 << 8;\n        QTest::newRow(\"QDateTimePrivate::spec\")\n            << int((char *)&p->spec - (char *)p) << 12 << 12;\n        QTest::newRow(\"QDateTimePrivate::utcOffset\")\n            << int((char *)&p->utcOffset - (char *)p) << 16 << 16;\n#elif QT_VERSION < 0x50200\n#   ifdef Q_OS_WIN\n        QTest::newRow(\"QDateTimePrivate::date\")\n            << int((char *)&p->date - (char *)p) << 8 << 8;\n        QTest::newRow(\"QDateTimePrivate::time\")\n            << int((char *)&p->time - (char *)p) << 16 << 16;\n        QTest::newRow(\"QDateTimePrivate::spec\")\n            << int((char *)&p->spec - (char *)p) << 20 << 20;\n        QTest::newRow(\"QDateTimePrivate::utcOffset\")\n            << int((char *)&p->utcOffset - (char *)p) << 24 << 24;\n#   else\n        QTest::newRow(\"QDateTimePrivate::date\")\n            << int((char *)&p->date - (char *)p) << 4 << 8;\n        QTest::newRow(\"QDateTimePrivate::time\")\n            << int((char *)&p->time - (char *)p) << 12 << 16;\n        QTest::newRow(\"QDateTimePrivate::spec\")\n            << int((char *)&p->spec - (char *)p) << 16 << 20;\n        QTest::newRow(\"QDateTimePrivate::utcOffset\")\n            << int((char *)&p->utcOffset - (char *)p) << 20 << 24;\n#   endif\n#else\n#   ifdef Q_OS_WIN\n        QTest::newRow(\"QDateTimePrivate::m_msecs\")\n            << int((char *)&p->m_msecs - (char *)p) << 8 << 8;\n        QTest::newRow(\"QDateTimePrivate::m_spec\")\n            << int((char *)&p->m_spec - (char *)p) << 16 << 16;\n        QTest::newRow(\"QDateTimePrivate::m_offsetFromUtc\")\n            << int((char *)&p->m_offsetFromUtc - (char *)p) << 20 << 20;\n        QTest::newRow(\"QDateTimePrivate::m_timeZone\")\n            << int((char *)&p->m_timeZone - (char *)p) << 24 << 24;\n        QTest::newRow(\"QDateTimePrivate::m_status\")\n            << int((char *)&p->m_status - (char *)p) << 28 << 32;\n#   else\n        QTest::newRow(\"QDateTimePrivate::m_msecs\")\n            << int((char *)&p->m_msecs - (char *)p) << 4 << 8;\n        QTest::newRow(\"QDateTimePrivate::m_spec\")\n            << int((char *)&p->m_spec - (char *)p) << 12 << 16;\n        QTest::newRow(\"QDateTimePrivate::m_offsetFromUtc\")\n            << int((char *)&p->m_offsetFromUtc - (char *)p) << 16 << 20;\n        QTest::newRow(\"QDateTimePrivate::m_timeZone\")\n            << int((char *)&p->m_timeZone - (char *)p) << 20 << 24;\n        QTest::newRow(\"QDateTimePrivate::m_status\")\n            << int((char *)&p->m_status - (char *)p) << 24 << 32;\n#   endif\n#endif\n    }\n\n}\n\n\nQTEST_APPLESS_MAIN(tst_offsets);\n\n#include \"tst_offsets.moc\"\n\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the test suite of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the either Technology Preview License Agreement or the\n** Beta Release License Agreement.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain\n** additional rights. These rights are described in the Nokia Qt LGPL\n** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this\n** package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at http:\/\/www.qtsoftware.com\/contact.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n\n#include <QtTest\/QtTest>\n\n\n#include <qapplication.h>\n\n\n\n\n#include <q3socket.h>\n#include \"..\/network-settings.h\"\n\/\/TESTED_CLASS=\n\/\/TESTED_FILES=network\/q3socket.h network\/q3socket.cpp\n\nclass tst_Q3Socket : public QObject\n{\n    Q_OBJECT\n\npublic:\n    tst_Q3Socket();\n    virtual ~tst_Q3Socket();\n\n\npublic slots:\n    void initTestCase();\n    void cleanupTestCase();\n    void init();\n    void cleanup();\nprivate slots:\n    void peerAddress_data();\n    void peerAddress();\n    void emitConnectionRefused();\n    void readBufferSize();\n    void connectionAttempts_data();\n    void connectionAttempts();\n    void canReadLine();\n\nprotected slots:\n    void peerAddress_connected();\n    void peerAddress_connectionClosed();\n    void emitConnectionRefused_error(int);\n    void connectionAttempts_connected();\n    void connectionAttempts_error(int);\n\nprivate:\n    Q3Socket *socket;\n\n    QHostAddress *peerAddress_addrConnected;\n    uint peerAddress_portConnected;\n    QHostAddress *peerAddress_addrClosed;\n    uint peerAddress_portClosed;\n    bool emitConnectionRefused_errorReceived;\n};\n\ntst_Q3Socket::tst_Q3Socket()\n{\n}\n\ntst_Q3Socket::~tst_Q3Socket()\n{\n}\n\nvoid tst_Q3Socket::initTestCase()\n{\n}\n\nvoid tst_Q3Socket::cleanupTestCase()\n{\n}\n\nvoid tst_Q3Socket::init()\n{\n}\n\nvoid tst_Q3Socket::cleanup()\n{\n}\n\nvoid tst_Q3Socket::peerAddress_data()\n{\n    QTest::addColumn<QString>(\"host\");\n    QTest::addColumn<uint>(\"port\");\n    QTest::addColumn<bool>(\"peerClosesConnection\");\n    QTest::addColumn<QString>(\"peerAddr\");\n\n    QTest::newRow( \"echo\" )    << QString(\"qt-test-server.troll.no\") << (uint)7  << false << QString(\"10.3.3.69\");\n    QTest::newRow( \"daytime\" ) << QString(\"qt-test-server.troll.no\") << (uint)13 << true << QString(\"10.3.3.69\");\n}\n\nvoid tst_Q3Socket::peerAddress()\n{\n    \/\/ init\n    QFETCH( QString, host );\n    QFETCH( uint, port );\n    QFETCH( QString, peerAddr );\n    QFETCH( bool, peerClosesConnection );\n\n    socket = new Q3Socket;\n    connect( socket, SIGNAL(connected()), SLOT(peerAddress_connected()) );\n    connect( socket, SIGNAL(connectionClosed()), SLOT(peerAddress_connectionClosed()) );\n\n    peerAddress_addrConnected = 0;\n    peerAddress_addrClosed = 0;\n\n    \/\/ connect to host\n    socket->connectToHost( host, port );\n    QTestEventLoop::instance().enterLoop( 30 );\n    if ( QTestEventLoop::instance().timeout() && peerAddress_addrConnected==0 )\n\tQFAIL( \"Connection timed out\" );\n\n    \/\/ test\n    QHostAddress pa;\n    QVERIFY( pa.setAddress(peerAddr) );\n\n    QTEST( peerAddress_addrConnected->toString(), \"peerAddr\" ); \/\/ results in nicer output than the test below\n    QVERIFY( *peerAddress_addrConnected == pa );\n    QCOMPARE( peerAddress_portConnected, port );\n\n    if ( peerClosesConnection ) {\n\tQVERIFY( peerAddress_addrClosed != 0 );\n\n\tQCOMPARE( peerAddress_addrClosed->toString(), QString() ); \/\/ results in nicer output than the test below\n\tQVERIFY( *peerAddress_addrClosed == QHostAddress::Null );\n\tQCOMPARE( peerAddress_portClosed, (uint)0 );\n    } else {\n\tQVERIFY( peerAddress_addrClosed == 0 );\n    }\n\n    \/\/ cleanup\n    delete peerAddress_addrConnected;\n    delete peerAddress_addrClosed;\n    delete socket;\n}\n\nvoid tst_Q3Socket::peerAddress_connected()\n{\n    peerAddress_addrConnected = new QHostAddress( socket->peerAddress() );\n    peerAddress_portConnected = socket->peerPort();\n    QTestEventLoop::instance().changeInterval( 5 ); \/\/ enough time to get the closed\n}\n\nvoid tst_Q3Socket::peerAddress_connectionClosed()\n{\n    peerAddress_addrClosed = new QHostAddress( socket->peerAddress() );\n    peerAddress_portClosed = socket->peerPort();\n    QTestEventLoop::instance().exitLoop();\n}\n\nvoid tst_Q3Socket::emitConnectionRefused()\n{\n    Q3Socket sock;\n    connect( &sock, SIGNAL(error(int)), SLOT(emitConnectionRefused_error(int)) );\n    sock.connectToHost( \"ares.troll.no\", 12331 );\n\n    emitConnectionRefused_errorReceived = false;\n    QTestEventLoop::instance().enterLoop( 30 );\n    QVERIFY(emitConnectionRefused_errorReceived);\n}\n\nvoid tst_Q3Socket::emitConnectionRefused_error( int signum )\n{\n    if ( signum == Q3Socket::ErrConnectionRefused )\n        emitConnectionRefused_errorReceived = true;\n\n    QTestEventLoop::instance().exitLoop();\n}\n\nvoid tst_Q3Socket::readBufferSize()\n{\n    const int bufferSize = 1024;\n\n    Q3Socket sock;\n    sock.setReadBufferSize(bufferSize);\n    QCOMPARE((int)sock.readBufferSize(), bufferSize);\n\n    sock.connectToHost(\"localhost\", 0);\n\n    QCOMPARE((int)sock.readBufferSize(), bufferSize);\n}\n\nvoid tst_Q3Socket::connectionAttempts_data()\n{\n    QTest::addColumn<QString>(\"host\");\n    QTest::addColumn<int>(\"port\");\n    QTest::addColumn<bool>(\"expectedResult\");\n\n    QTest::newRow(\"fluke port 80\") << QString(\"qt-test-server.troll.no\") << 80 << true;\n    QTest::newRow(\"fluke port 79\") << QString(\"qt-test-server.troll.no\") << 79 << false;\n}\n\nvoid tst_Q3Socket::connectionAttempts()\n{\n    QFETCH(QString, host);\n    QFETCH(int, port);\n    QFETCH(bool, expectedResult);\n\n    Q3Socket sock;\n    sock.connectToHost(host, port);\n    connect(&sock, SIGNAL(connected()), SLOT(connectionAttempts_connected()));\n    connect(&sock, SIGNAL(error(int)), SLOT(connectionAttempts_error(int)));\n    QTestEventLoop::instance().enterLoop(10);\n\n    if (QTestEventLoop::instance().timeout())\n       return;\n\n    QCOMPARE(sock.state() == Q3Socket::Connected, expectedResult);\n}\n\nvoid tst_Q3Socket::connectionAttempts_connected()\n{\n    QTestEventLoop::instance().exitLoop();\n}\n\nvoid tst_Q3Socket::connectionAttempts_error(int)\n{\n    QTestEventLoop::instance().exitLoop();\n}\n\nvoid tst_Q3Socket::canReadLine()\n{\n    QEventLoop loop;\n\n    Q3Socket socket;\n    QVERIFY(!socket.canReadLine());\n    connect(&socket, SIGNAL(connected()), &loop, SLOT(quit()));\n    \/\/ timeout error will fail in #238\n    connect(&socket, SIGNAL(error(int)), &loop, SLOT(quit()));\n    socket.connectToHost(\"qt-test-server.troll.no\", 143);\n\n    loop.exec();\n\n    QCOMPARE(socket.state(), Q3Socket::Connected);\n\n    while (!socket.canReadLine())\n        QVERIFY(socket.waitForMore(5000) > 0);\n\n    QVERIFY(socket.canReadLine());\n    socket.readLine();\n    QVERIFY(!socket.canReadLine());\n    socket.ungetChar('\\n');\n    QVERIFY(socket.canReadLine());\n}\n\nQTEST_MAIN(tst_Q3Socket)\n#include \"tst_qsocket.moc\"\n<commit_msg>Fixed failure of tst_q3socket.<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the test suite of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the either Technology Preview License Agreement or the\n** Beta Release License Agreement.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain\n** additional rights. These rights are described in the Nokia Qt LGPL\n** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this\n** package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at http:\/\/www.qtsoftware.com\/contact.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n\n#include <QtTest\/QtTest>\n\n\n#include <qapplication.h>\n\n\n\n\n#include <q3socket.h>\n#include \"..\/network-settings.h\"\n\/\/TESTED_CLASS=\n\/\/TESTED_FILES=network\/q3socket.h network\/q3socket.cpp\n\nclass tst_Q3Socket : public QObject\n{\n    Q_OBJECT\n\npublic:\n    tst_Q3Socket();\n    virtual ~tst_Q3Socket();\n\n\npublic slots:\n    void initTestCase();\n    void cleanupTestCase();\n    void init();\n    void cleanup();\nprivate slots:\n    void peerAddress_data();\n    void peerAddress();\n    void emitConnectionRefused();\n    void readBufferSize();\n    void connectionAttempts_data();\n    void connectionAttempts();\n    void canReadLine();\n\nprotected slots:\n    void peerAddress_connected();\n    void peerAddress_connectionClosed();\n    void emitConnectionRefused_error(int);\n    void connectionAttempts_connected();\n    void connectionAttempts_error(int);\n\nprivate:\n    Q3Socket *socket;\n\n    QHostAddress *peerAddress_addrConnected;\n    uint peerAddress_portConnected;\n    QHostAddress *peerAddress_addrClosed;\n    uint peerAddress_portClosed;\n    bool emitConnectionRefused_errorReceived;\n};\n\ntst_Q3Socket::tst_Q3Socket()\n{\n}\n\ntst_Q3Socket::~tst_Q3Socket()\n{\n}\n\nvoid tst_Q3Socket::initTestCase()\n{\n}\n\nvoid tst_Q3Socket::cleanupTestCase()\n{\n}\n\nvoid tst_Q3Socket::init()\n{\n}\n\nvoid tst_Q3Socket::cleanup()\n{\n}\n\nvoid tst_Q3Socket::peerAddress_data()\n{\n    QTest::addColumn<QString>(\"host\");\n    QTest::addColumn<uint>(\"port\");\n    QTest::addColumn<bool>(\"peerClosesConnection\");\n    QTest::addColumn<QString>(\"peerAddr\");\n\n    QTest::newRow( \"echo\" )    << QtNetworkSettings::serverLocalName() << (uint)7  << false\n        << QtNetworkSettings::serverIP().toString();\n    QTest::newRow( \"daytime\" ) << QtNetworkSettings::serverLocalName() << (uint)13 << true\n        << QtNetworkSettings::serverIP().toString();\n}\n\nvoid tst_Q3Socket::peerAddress()\n{\n    \/\/ init\n    QFETCH( QString, host );\n    QFETCH( uint, port );\n    QFETCH( QString, peerAddr );\n    QFETCH( bool, peerClosesConnection );\n\n    socket = new Q3Socket;\n    connect( socket, SIGNAL(connected()), SLOT(peerAddress_connected()) );\n    connect( socket, SIGNAL(connectionClosed()), SLOT(peerAddress_connectionClosed()) );\n\n    peerAddress_addrConnected = 0;\n    peerAddress_addrClosed = 0;\n\n    \/\/ connect to host\n    socket->connectToHost( host, port );\n    QTestEventLoop::instance().enterLoop( 30 );\n    if ( QTestEventLoop::instance().timeout() && peerAddress_addrConnected==0 )\n\tQFAIL( \"Connection timed out\" );\n\n    \/\/ test\n    QHostAddress pa;\n    QVERIFY( pa.setAddress(peerAddr) );\n\n    QTEST( peerAddress_addrConnected->toString(), \"peerAddr\" ); \/\/ results in nicer output than the test below\n    QVERIFY( *peerAddress_addrConnected == pa );\n    QCOMPARE( peerAddress_portConnected, port );\n\n    if ( peerClosesConnection ) {\n\tQVERIFY( peerAddress_addrClosed != 0 );\n\n\tQCOMPARE( peerAddress_addrClosed->toString(), QString() ); \/\/ results in nicer output than the test below\n\tQVERIFY( *peerAddress_addrClosed == QHostAddress::Null );\n\tQCOMPARE( peerAddress_portClosed, (uint)0 );\n    } else {\n\tQVERIFY( peerAddress_addrClosed == 0 );\n    }\n\n    \/\/ cleanup\n    delete peerAddress_addrConnected;\n    delete peerAddress_addrClosed;\n    delete socket;\n}\n\nvoid tst_Q3Socket::peerAddress_connected()\n{\n    peerAddress_addrConnected = new QHostAddress( socket->peerAddress() );\n    peerAddress_portConnected = socket->peerPort();\n    QTestEventLoop::instance().changeInterval( 5 ); \/\/ enough time to get the closed\n}\n\nvoid tst_Q3Socket::peerAddress_connectionClosed()\n{\n    peerAddress_addrClosed = new QHostAddress( socket->peerAddress() );\n    peerAddress_portClosed = socket->peerPort();\n    QTestEventLoop::instance().exitLoop();\n}\n\nvoid tst_Q3Socket::emitConnectionRefused()\n{\n    Q3Socket sock;\n    connect( &sock, SIGNAL(error(int)), SLOT(emitConnectionRefused_error(int)) );\n    sock.connectToHost( QtNetworkSettings::serverLocalName(), 12331 );\n\n    emitConnectionRefused_errorReceived = false;\n    QTestEventLoop::instance().enterLoop( 30 );\n    QVERIFY(emitConnectionRefused_errorReceived);\n}\n\nvoid tst_Q3Socket::emitConnectionRefused_error( int signum )\n{\n    if ( signum == Q3Socket::ErrConnectionRefused )\n        emitConnectionRefused_errorReceived = true;\n\n    QTestEventLoop::instance().exitLoop();\n}\n\nvoid tst_Q3Socket::readBufferSize()\n{\n    const int bufferSize = 1024;\n\n    Q3Socket sock;\n    sock.setReadBufferSize(bufferSize);\n    QCOMPARE((int)sock.readBufferSize(), bufferSize);\n\n    sock.connectToHost(\"localhost\", 0);\n\n    QCOMPARE((int)sock.readBufferSize(), bufferSize);\n}\n\nvoid tst_Q3Socket::connectionAttempts_data()\n{\n    QTest::addColumn<QString>(\"host\");\n    QTest::addColumn<int>(\"port\");\n    QTest::addColumn<bool>(\"expectedResult\");\n\n    QTest::newRow(\"fluke port 80\") << QtNetworkSettings::serverLocalName() << 80 << true;\n    QTest::newRow(\"fluke port 79\") << QtNetworkSettings::serverLocalName() << 79 << false;\n}\n\nvoid tst_Q3Socket::connectionAttempts()\n{\n    QFETCH(QString, host);\n    QFETCH(int, port);\n    QFETCH(bool, expectedResult);\n\n    Q3Socket sock;\n    sock.connectToHost(host, port);\n    connect(&sock, SIGNAL(connected()), SLOT(connectionAttempts_connected()));\n    connect(&sock, SIGNAL(error(int)), SLOT(connectionAttempts_error(int)));\n    QTestEventLoop::instance().enterLoop(10);\n\n    if (QTestEventLoop::instance().timeout())\n       return;\n\n    QCOMPARE(sock.state() == Q3Socket::Connected, expectedResult);\n}\n\nvoid tst_Q3Socket::connectionAttempts_connected()\n{\n    QTestEventLoop::instance().exitLoop();\n}\n\nvoid tst_Q3Socket::connectionAttempts_error(int)\n{\n    QTestEventLoop::instance().exitLoop();\n}\n\nvoid tst_Q3Socket::canReadLine()\n{\n    QEventLoop loop;\n\n    Q3Socket socket;\n    QVERIFY(!socket.canReadLine());\n    connect(&socket, SIGNAL(connected()), &loop, SLOT(quit()));\n    \/\/ timeout error will fail in #238\n    connect(&socket, SIGNAL(error(int)), &loop, SLOT(quit()));\n    socket.connectToHost(QtNetworkSettings::serverLocalName(), 143);\n\n    loop.exec();\n\n    QCOMPARE(socket.state(), Q3Socket::Connected);\n\n    while (!socket.canReadLine())\n        QVERIFY(socket.waitForMore(5000) > 0);\n\n    QVERIFY(socket.canReadLine());\n    socket.readLine();\n    QVERIFY(!socket.canReadLine());\n    socket.ungetChar('\\n');\n    QVERIFY(socket.canReadLine());\n}\n\nQTEST_MAIN(tst_Q3Socket)\n#include \"tst_qsocket.moc\"\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2020 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 <glog\/logging.h>\n#include <gtest\/gtest.h>\n\n#include \"paddle\/fluid\/inference\/api\/helper.h\"\n#include \"paddle\/fluid\/inference\/utils\/io_utils.h\"\n\nnamespace paddle {\nnamespace inference {\nnamespace {\n\nbool pd_tensor_equal(const paddle::PaddleTensor& ref,\n                     const paddle::PaddleTensor& t) {\n  bool is_equal = true;\n  VLOG(3) << \"ref.name: \" << ref.name << \", t.name: \" << t.name;\n  VLOG(3) << \"ref.dtype: \" << ref.dtype << \", t.dtype: \" << t.dtype;\n  VLOG(3) << \"ref.lod_level: \" << ref.lod.size()\n          << \", t.dtype: \" << t.lod.size();\n  VLOG(3) << \"ref.data_len: \" << ref.data.length()\n          << \", t.data_len: \" << t.data.length();\n  return is_equal && (ref.name == t.name) && (ref.lod == t.lod) &&\n         (ref.dtype == t.dtype) &&\n         (std::memcmp(ref.data.data(), t.data.data(), ref.data.length()) == 0);\n}\n\ntemplate <typename T>\nvoid test_io_utils() {\n  std::vector<T> input({6, 8});\n  paddle::PaddleTensor in;\n  in.name = \"Hello\";\n  in.shape = {1, 2};\n  in.lod = std::vector<std::vector<size_t>>{{0, 1}};\n  in.data = paddle::PaddleBuf(static_cast<void*>(input.data()),\n                              input.size() * sizeof(T));\n  in.dtype = paddle::inference::PaddleTensorGetDType<T>();\n  std::stringstream ss;\n  paddle::inference::SerializePDTensorToStream(&ss, in);\n  paddle::PaddleTensor out;\n  paddle::inference::DeserializePDTensorToStream(ss, &out);\n  ASSERT_TRUE(pd_tensor_equal(in, out));\n}\n}  \/\/ namespace\n}  \/\/ namespace inference\n}  \/\/ namespace paddle\n\nTEST(infer_io_utils, float32) { paddle::inference::test_io_utils<float>(); }\nTEST(infer_io_utils, int64) { paddle::inference::test_io_utils<int64_t>(); }\n\nTEST(infer_io_utils, tensors) {\n  \/\/ Create a float32 tensor.\n  std::vector<float> input_fp32({1.1f, 3.2f, 5.0f, 8.2f});\n  paddle::PaddleTensor in_fp32;\n  in_fp32.name = \"Tensor.fp32_0\";\n  in_fp32.shape = {2, 2};\n  in_fp32.data = paddle::PaddleBuf(static_cast<void*>(input_fp32.data()),\n                                   input_fp32.size() * sizeof(float));\n  in_fp32.dtype = paddle::inference::PaddleTensorGetDType<float>();\n\n  \/\/ Create a int64 tensor.\n  std::vector<float> input_int64({5, 8});\n  paddle::PaddleTensor in_int64;\n  in_int64.name = \"Tensor.int64_0\";\n  in_int64.shape = {1, 2};\n  in_int64.lod = std::vector<std::vector<size_t>>{{0, 1}};\n  in_int64.data = paddle::PaddleBuf(static_cast<void*>(input_int64.data()),\n                                    input_int64.size() * sizeof(int64_t));\n  in_int64.dtype = paddle::inference::PaddleTensorGetDType<int64_t>();\n\n  \/\/ Serialize tensors.\n  std::vector<paddle::PaddleTensor> tensors_in({in_fp32, in_int64});\n  std::string file_path = \".\/io_utils_tensors\";\n  paddle::inference::SerializePDTensorsToFile(file_path, tensors_in);\n\n  \/\/ Deserialize tensors.\n  std::vector<paddle::PaddleTensor> tensors_out;\n  paddle::inference::DeserializePDTensorsToFile(file_path, &tensors_out);\n\n  \/\/ Check results.\n  ASSERT_EQ(tensors_in.size(), tensors_out.size());\n  for (size_t i = 0; i < tensors_in.size(); ++i) {\n    ASSERT_TRUE(\n        paddle::inference::pd_tensor_equal(tensors_in[i], tensors_out[i]));\n  }\n}\n<commit_msg>pause the io_utils_test of int64 and resume after repair, test=develop (#23234)<commit_after>\/\/ Copyright (c) 2020 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 <glog\/logging.h>\n#include <gtest\/gtest.h>\n\n#include \"paddle\/fluid\/inference\/api\/helper.h\"\n#include \"paddle\/fluid\/inference\/utils\/io_utils.h\"\n\nnamespace paddle {\nnamespace inference {\nnamespace {\n\nbool pd_tensor_equal(const paddle::PaddleTensor& ref,\n                     const paddle::PaddleTensor& t) {\n  bool is_equal = true;\n  VLOG(3) << \"ref.name: \" << ref.name << \", t.name: \" << t.name;\n  VLOG(3) << \"ref.dtype: \" << ref.dtype << \", t.dtype: \" << t.dtype;\n  VLOG(3) << \"ref.lod_level: \" << ref.lod.size()\n          << \", t.dtype: \" << t.lod.size();\n  VLOG(3) << \"ref.data_len: \" << ref.data.length()\n          << \", t.data_len: \" << t.data.length();\n  return is_equal && (ref.name == t.name) && (ref.lod == t.lod) &&\n         (ref.dtype == t.dtype) &&\n         (std::memcmp(ref.data.data(), t.data.data(), ref.data.length()) == 0);\n}\n\ntemplate <typename T>\nvoid test_io_utils() {\n  std::vector<T> input({6, 8});\n  paddle::PaddleTensor in;\n  in.name = \"Hello\";\n  in.shape = {1, 2};\n  in.lod = std::vector<std::vector<size_t>>{{0, 1}};\n  in.data = paddle::PaddleBuf(static_cast<void*>(input.data()),\n                              input.size() * sizeof(T));\n  in.dtype = paddle::inference::PaddleTensorGetDType<T>();\n  std::stringstream ss;\n  paddle::inference::SerializePDTensorToStream(&ss, in);\n  paddle::PaddleTensor out;\n  paddle::inference::DeserializePDTensorToStream(ss, &out);\n  ASSERT_TRUE(pd_tensor_equal(in, out));\n}\n}  \/\/ namespace\n}  \/\/ namespace inference\n}  \/\/ namespace paddle\n\nTEST(infer_io_utils, float32) { paddle::inference::test_io_utils<float>(); }\n\nTEST(infer_io_utils, tensors) {\n  \/\/ Create a float32 tensor.\n  std::vector<float> input_fp32({1.1f, 3.2f, 5.0f, 8.2f});\n  paddle::PaddleTensor in_fp32;\n  in_fp32.name = \"Tensor.fp32_0\";\n  in_fp32.shape = {2, 2};\n  in_fp32.data = paddle::PaddleBuf(static_cast<void*>(input_fp32.data()),\n                                   input_fp32.size() * sizeof(float));\n  in_fp32.dtype = paddle::inference::PaddleTensorGetDType<float>();\n\n  \/\/ Create a int64 tensor.\n  std::vector<float> input_int64({5, 8});\n  paddle::PaddleTensor in_int64;\n  in_int64.name = \"Tensor.int64_0\";\n  in_int64.shape = {1, 2};\n  in_int64.lod = std::vector<std::vector<size_t>>{{0, 1}};\n  in_int64.data = paddle::PaddleBuf(static_cast<void*>(input_int64.data()),\n                                    input_int64.size() * sizeof(int64_t));\n  in_int64.dtype = paddle::inference::PaddleTensorGetDType<int64_t>();\n\n  \/\/ Serialize tensors.\n  std::vector<paddle::PaddleTensor> tensors_in({in_fp32});\n  std::string file_path = \".\/io_utils_tensors\";\n  paddle::inference::SerializePDTensorsToFile(file_path, tensors_in);\n\n  \/\/ Deserialize tensors.\n  std::vector<paddle::PaddleTensor> tensors_out;\n  paddle::inference::DeserializePDTensorsToFile(file_path, &tensors_out);\n\n  \/\/ Check results.\n  ASSERT_EQ(tensors_in.size(), tensors_out.size());\n  for (size_t i = 0; i < tensors_in.size(); ++i) {\n    ASSERT_TRUE(\n        paddle::inference::pd_tensor_equal(tensors_in[i], tensors_out[i]));\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * App Communication over Bluetooth LE using GATT Profile\n *\n * Copyright (C)2015-2017 Laurentiu Badea\n *\n * This file may be redistributed under the terms of the MIT license.\n * A copy of this license has been included with this distribution in the file LICENSE.\n *\/\n\n#include \"app_interface.h\"\n\nextern AppInterface app;\n\nAppInterface::AppInterface(Adafruit_BluefruitLE_SPI& ble, PanoSettings& settings, PanoState& state)\n:settings(settings), state(state), ble(ble)\n{}\n\n\/*\n * Set up some redirects from BLE callbacks in global scope to app singleton methods \n *\/\nvoid callbackGattRX(int32_t char_id, uint8_t* data, uint16_t len){\n    \/\/{ debug\n    Serial.print(\"BLE GATT RX char=\");\n    Serial.print(char_id);\n    Serial.print(\" len=\");\n    Serial.print(len);\n    Serial.print(\" data=\");\n    for (int i = 0; i < len; i++) { Serial.print(data[i], HEX); Serial.print(\"-\"); };\n    Serial.println(\"\");\n    \/\/} debug\n    app.gattRX(char_id, data, len);\n}\nvoid callbackUartRX(char data[], uint16_t len){\n    \/\/{ debug\n        Serial.print(\"BLE UART RX len=\");\n        Serial.print(len);\n        Serial.print(\" data=\");\n        for (int i = 0; i < len; i++) { Serial.print(data[i], HEX); Serial.print(\"-\"); };\n        Serial.println(\"\");\n        \/\/} debug\n        app.uartRX((uint8_t *)data, len);\n}\nvoid callbackDidConnect(void){\n    app.didConnect();\n}\nvoid callbackDidDisconnect(void){\n    app.didDisconnect();\n}\n\nvoid AppInterface::begin(){\n    ble.sendCommandCheckOK(\"AT+BAUDRATE=921600\");\n    \/\/ LED Activity command is only supported from 0.6.6\n    ble.sendCommandCheckOK(\"AT+HWMODELED=SPI\");\n    ble.sendCommandCheckOK(\"AT+GAPDEVNAME=Pano Controller\");\n    \n    gatt = new Adafruit_BLEGatt(ble);\n    service_id = gatt->addService(SERVICE_UUID);\n    config_char_id = gatt->addCharacteristic(CONFIG_CHAR_UUID, GATT_CHARS_PROPERTIES_READ | GATT_CHARS_PROPERTIES_WRITE | GATT_CHARS_PROPERTIES_WRITE_WO_RESP,\n                                             3, 20, BLE_DATATYPE_BYTEARRAY, \"Configuration\");\n    status_char_id = gatt->addCharacteristic(STATUS_CHAR_UUID, GATT_CHARS_PROPERTIES_READ | GATT_CHARS_PROPERTIES_NOTIFY,\n                                             sizeof(PanoState), sizeof(PanoState), BLE_DATATYPE_BYTEARRAY, \"Status\");\n    cmd_char_id = gatt->addCharacteristic(CMD_CHAR_UUID, GATT_CHARS_PROPERTIES_WRITE,\n                                          1, 5, BLE_DATATYPE_BYTEARRAY, \"Command\");\n    ble.sendCommandCheckOK(\"AT+GAPSETADVDATA=07-02-17-20-0A-18-0F-18\"); \/\/ 7=number of bytes following, 02-flag for 16-bit service uuids, 17-20 = 0x2017, 0x180A, 0x180F\n    ble.sendCommandCheckOK(\"AT+GAPCONNECTABLE=1\");\n    ble.reset();\n    ble.sendCommandCheckOK(\"AT+GATTLIST\");\n    ble.setConnectCallback(callbackDidConnect);\n    ble.setDisconnectCallback(callbackDidDisconnect);\n    ble.setBleGattRxCallback(config_char_id, callbackGattRX);\n    ble.setBleGattRxCallback(cmd_char_id, callbackGattRX);\n    ble.setBleUartRxCallback(callbackUartRX);\n}\n    \nvoid AppInterface::sendStatus(){\n    \/\/Serial.println(\"Send status\");\n    gatt->setChar(status_char_id, (uint8_t*)&state, sizeof(state));\n}\n\nvoid AppInterface::gattRX(int32_t char_id, uint8_t* data, uint16_t len){\n    if (char_id == config_char_id || char_id == cmd_char_id){\n        uartRX(data, len);\n    }\n}\nstatic bool unpack(settings_t& variable, uint8_t* &data, uint16_t& len){\n    if (len >= 2*sizeof(variable)){\n        len -= 2*sizeof(variable);\n        variable = 0;\n        for (int i=2*sizeof(variable); i; i--){\n            variable <<= 4;\n            variable += (*data++ - 0x30);\n        }\n        return true;\n    }\n    return false;\n}\nvoid AppInterface::uartRX(uint8_t* data, uint16_t len){\n    move_t move;\n    static uint8_t keyCode;\n    bool updateConfig = false;\n    while (len-- >= 1){\n        keyCode = *data++;\n        switch (keyCode){\n\n            \/\/ Configs\n            case 0x41: updateConfig |= unpack(settings.focal, data, len); break;\n            case 0x42: updateConfig |= unpack(settings.shutter, data, len); break;\n            case 0x43: updateConfig |= unpack(settings.pre_shutter, data, len); break;\n            case 0x44: updateConfig |= unpack(settings.post_wait, data, len); break;\n            case 0x45: updateConfig |= unpack(settings.long_pulse, data, len); break;\n            case 0x46: updateConfig |= unpack(settings.aspect, data, len); break;\n            case 0x47: updateConfig |= unpack(settings.shots, data, len); break;\n            case 0x48: updateConfig |= unpack(settings.motors_enable, data, len); break;\n            case 0x49: updateConfig |= unpack(settings.motors_on, data, len); break;\n            case 0x4A: updateConfig |= unpack(settings.display_invert, data, len); break;\n            case 0x4B: updateConfig |= unpack(settings.horiz, data, len); break;\n            case 0x4C: updateConfig |= unpack(settings.vert, data, len); break;\n\n            \/\/ Commands\n            case 0x61: callbacks.start(); break;\n            case 0x62: callbacks.cancel(); break;\n            case 0x63: callbacks.pause(); break;\n            case 0x64: callbacks.shutter(); break;\n            case 0x65: callbacks.setHome(); break;\n            case 0x66: callbacks.goHome(); break;\n            case 0x67: sendStatus(); break;\n            case 0x68: \/\/ free move\n                \/\/ TODO: check that len=5\n                memcpy(&move, data, sizeof(move));\n                callbacks.freeMove(move);\n                break;\n            case 0x69: \/\/ incremental move (forward or backward)\n                \/\/ TODO: check that len=2\n                callbacks.gridMove((char)data[1]);\n                break;\n            default:\n                Serial.print(\"Unknown code received: \"); Serial.println(keyCode, HEX);\n        }\n    }\n    if (updateConfig){\n        callbacks.config();\n    }\n}\n\nvoid AppInterface::didConnect(void){\n    Serial.println(\"BLE connected\");\n    connected = true;\n}\n\nvoid AppInterface::didDisconnect(void){\n    Serial.println(\"BLE disconnected\");\n    connected = false;\n}\n\nbool AppInterface::isConnected(void){\n    return connected;\n}\n\nvoid AppInterface::poll(uint32_t timeout){\n    ble.update(timeout);\n}\n<commit_msg>LED indicates BLE UART activity<commit_after>\/*\n * App Communication over Bluetooth LE using GATT Profile\n *\n * Copyright (C)2015-2017 Laurentiu Badea\n *\n * This file may be redistributed under the terms of the MIT license.\n * A copy of this license has been included with this distribution in the file LICENSE.\n *\/\n\n#include \"app_interface.h\"\n\nextern AppInterface app;\n\nAppInterface::AppInterface(Adafruit_BluefruitLE_SPI& ble, PanoSettings& settings, PanoState& state)\n:settings(settings), state(state), ble(ble)\n{}\n\n\/*\n * Set up some redirects from BLE callbacks in global scope to app singleton methods \n *\/\nvoid callbackGattRX(int32_t char_id, uint8_t* data, uint16_t len){\n    \/\/{ debug\n    Serial.print(\"BLE GATT RX char=\");\n    Serial.print(char_id);\n    Serial.print(\" len=\");\n    Serial.print(len);\n    Serial.print(\" data=\");\n    for (int i = 0; i < len; i++) { Serial.print(data[i], HEX); Serial.print(\"-\"); };\n    Serial.println(\"\");\n    \/\/} debug\n    app.gattRX(char_id, data, len);\n}\nvoid callbackUartRX(char data[], uint16_t len){\n    \/\/{ debug\n        Serial.print(\"BLE UART RX len=\");\n        Serial.print(len);\n        Serial.print(\" data=\");\n        for (int i = 0; i < len; i++) { Serial.print(data[i], HEX); Serial.print(\"-\"); };\n        Serial.println(\"\");\n        \/\/} debug\n        app.uartRX((uint8_t *)data, len);\n}\nvoid callbackDidConnect(void){\n    app.didConnect();\n}\nvoid callbackDidDisconnect(void){\n    app.didDisconnect();\n}\n\nvoid AppInterface::begin(){\n    ble.sendCommandCheckOK(\"AT+BAUDRATE=921600\");\n    \/\/ LED Activity command is only supported from 0.6.6\n    ble.sendCommandCheckOK(\"AT+HWMODELED=BLEUART\");\n    ble.sendCommandCheckOK(\"AT+GAPDEVNAME=Pano Controller\");\n    \n    gatt = new Adafruit_BLEGatt(ble);\n    service_id = gatt->addService(SERVICE_UUID);\n    config_char_id = gatt->addCharacteristic(CONFIG_CHAR_UUID, GATT_CHARS_PROPERTIES_READ | GATT_CHARS_PROPERTIES_WRITE | GATT_CHARS_PROPERTIES_WRITE_WO_RESP,\n                                             3, 20, BLE_DATATYPE_BYTEARRAY, \"Configuration\");\n    status_char_id = gatt->addCharacteristic(STATUS_CHAR_UUID, GATT_CHARS_PROPERTIES_READ | GATT_CHARS_PROPERTIES_NOTIFY,\n                                             sizeof(PanoState), sizeof(PanoState), BLE_DATATYPE_BYTEARRAY, \"Status\");\n    cmd_char_id = gatt->addCharacteristic(CMD_CHAR_UUID, GATT_CHARS_PROPERTIES_WRITE,\n                                          1, 5, BLE_DATATYPE_BYTEARRAY, \"Command\");\n    ble.sendCommandCheckOK(\"AT+GAPSETADVDATA=07-02-17-20-0A-18-0F-18\"); \/\/ 7=number of bytes following, 02-flag for 16-bit service uuids, 17-20 = 0x2017, 0x180A, 0x180F\n    ble.sendCommandCheckOK(\"AT+GAPCONNECTABLE=1\");\n    ble.reset();\n    ble.sendCommandCheckOK(\"AT+GATTLIST\");\n    ble.setConnectCallback(callbackDidConnect);\n    ble.setDisconnectCallback(callbackDidDisconnect);\n    ble.setBleGattRxCallback(config_char_id, callbackGattRX);\n    ble.setBleGattRxCallback(cmd_char_id, callbackGattRX);\n    ble.setBleUartRxCallback(callbackUartRX);\n}\n    \nvoid AppInterface::sendStatus(){\n    \/\/Serial.println(\"Send status\");\n    gatt->setChar(status_char_id, (uint8_t*)&state, sizeof(state));\n}\n\nvoid AppInterface::gattRX(int32_t char_id, uint8_t* data, uint16_t len){\n    if (char_id == config_char_id || char_id == cmd_char_id){\n        uartRX(data, len);\n    }\n}\nstatic bool unpack(settings_t& variable, uint8_t* &data, uint16_t& len){\n    if (len >= 2*sizeof(variable)){\n        len -= 2*sizeof(variable);\n        variable = 0;\n        for (int i=2*sizeof(variable); i; i--){\n            variable <<= 4;\n            variable += (*data++ - 0x30);\n        }\n        return true;\n    }\n    return false;\n}\nvoid AppInterface::uartRX(uint8_t* data, uint16_t len){\n    move_t move;\n    static uint8_t keyCode;\n    bool updateConfig = false;\n    while (len-- >= 1){\n        keyCode = *data++;\n        switch (keyCode){\n\n            \/\/ Configs\n            case 0x41: updateConfig |= unpack(settings.focal, data, len); break;\n            case 0x42: updateConfig |= unpack(settings.shutter, data, len); break;\n            case 0x43: updateConfig |= unpack(settings.pre_shutter, data, len); break;\n            case 0x44: updateConfig |= unpack(settings.post_wait, data, len); break;\n            case 0x45: updateConfig |= unpack(settings.long_pulse, data, len); break;\n            case 0x46: updateConfig |= unpack(settings.aspect, data, len); break;\n            case 0x47: updateConfig |= unpack(settings.shots, data, len); break;\n            case 0x48: updateConfig |= unpack(settings.motors_enable, data, len); break;\n            case 0x49: updateConfig |= unpack(settings.motors_on, data, len); break;\n            case 0x4A: updateConfig |= unpack(settings.display_invert, data, len); break;\n            case 0x4B: updateConfig |= unpack(settings.horiz, data, len); break;\n            case 0x4C: updateConfig |= unpack(settings.vert, data, len); break;\n\n            \/\/ Commands\n            case 0x61: callbacks.start(); break;\n            case 0x62: callbacks.cancel(); break;\n            case 0x63: callbacks.pause(); break;\n            case 0x64: callbacks.shutter(); break;\n            case 0x65: callbacks.setHome(); break;\n            case 0x66: callbacks.goHome(); break;\n            case 0x67: sendStatus(); break;\n            case 0x68: \/\/ free move\n                \/\/ TODO: check that len=5\n                memcpy(&move, data, sizeof(move));\n                callbacks.freeMove(move);\n                break;\n            case 0x69: \/\/ incremental move (forward or backward)\n                \/\/ TODO: check that len=2\n                callbacks.gridMove((char)data[1]);\n                break;\n            default:\n                Serial.print(\"Unknown code received: \"); Serial.println(keyCode, HEX);\n        }\n    }\n    if (updateConfig){\n        callbacks.config();\n    }\n}\n\nvoid AppInterface::didConnect(void){\n    Serial.println(\"BLE connected\");\n    connected = true;\n}\n\nvoid AppInterface::didDisconnect(void){\n    Serial.println(\"BLE disconnected\");\n    connected = false;\n}\n\nbool AppInterface::isConnected(void){\n    return connected;\n}\n\nvoid AppInterface::poll(uint32_t timeout){\n    ble.update(timeout);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2007 The Hewlett-Packard Development Company\n * All rights reserved.\n *\n * Redistribution and use of this software in source and binary forms,\n * with or without modification, are permitted provided that the\n * following conditions are met:\n *\n * The software must be used only for Non-Commercial Use which means any\n * use which is NOT directed to receiving any direct monetary\n * compensation for, or commercial advantage from such use.  Illustrative\n * examples of non-commercial use are academic research, personal study,\n * teaching, education and corporate research & development.\n * Illustrative examples of commercial use are distributing products for\n * commercial advantage and providing services using the software for\n * commercial advantage.\n *\n * If you wish to use this software or functionality therein that may be\n * covered by patents for commercial use, please contact:\n *     Director of Intellectual Property Licensing\n *     Office of Strategy and Technology\n *     Hewlett-Packard Company\n *     1501 Page Mill Road\n *     Palo Alto, California  94304\n *\n * Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.  Redistributions\n * in binary form must reproduce the above copyright notice, this list of\n * conditions and the following disclaimer in the documentation and\/or\n * other materials provided with the distribution.  Neither the name of\n * the COPYRIGHT HOLDER(s), HEWLETT-PACKARD COMPANY, nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.  No right of\n * sublicense is granted herewith.  Derivatives of the software and\n * output created using the software may be prepared, but only for\n * Non-Commercial Uses.  Derivatives of the software may be shared with\n * others provided: (i) the others agree to abide by the list of\n * conditions herein which includes the Non-Commercial Use restrictions;\n * and (ii) such Derivatives of the software include the above copyright\n * notice to acknowledge the contribution from this software where\n * applicable, this list of conditions and the disclaimer below.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * Authors: Gabe Black\n *\/\n\n#ifndef __ARCH_X86_TYPES_HH__\n#define __ARCH_X86_TYPES_HH__\n\n#include <inttypes.h>\n#include <iostream>\n\n#include \"base\/bitunion.hh\"\n#include \"base\/cprintf.hh\"\n\nnamespace X86ISA\n{\n    \/\/This really determines how many bytes are passed to the predecoder.\n    typedef uint64_t MachInst;\n\n    enum Prefixes {\n        NoOverride,\n        CSOverride,\n        DSOverride,\n        ESOverride,\n        FSOverride,\n        GSOverride,\n        SSOverride,\n        RexPrefix,\n        OperandSizeOverride,\n        AddressSizeOverride,\n        Lock,\n        Rep,\n        Repne\n    };\n\n    BitUnion8(LegacyPrefixVector)\n        Bitfield<7> repne;\n        Bitfield<6> rep;\n        Bitfield<5> lock;\n        Bitfield<4> addr;\n        Bitfield<3> op;\n        \/\/There can be only one segment override, so they share the\n        \/\/first 3 bits in the legacyPrefixes bitfield.\n        Bitfield<2,0> seg;\n    EndBitUnion(LegacyPrefixVector)\n\n    BitUnion8(ModRM)\n        Bitfield<7,6> mod;\n        Bitfield<5,3> reg;\n        Bitfield<2,0> rm;\n    EndBitUnion(ModRM)\n\n    BitUnion8(Sib)\n        Bitfield<7,6> scale;\n        Bitfield<5,3> index;\n        Bitfield<2,0> base;\n    EndBitUnion(Sib)\n\n    BitUnion8(Rex)\n        Bitfield<3> w;\n        Bitfield<2> r;\n        Bitfield<1> x;\n        Bitfield<0> b;\n    EndBitUnion(Rex)\n\n    BitUnion8(Opcode)\n        Bitfield<7,3> top5;\n        Bitfield<2,0> bottom3;\n    EndBitUnion(Opcode)\n\n    BitUnion8(OperatingMode)\n        Bitfield<3> mode;\n        Bitfield<2,0> submode;\n    EndBitUnion(OperatingMode)\n\n    enum X86Mode {\n        LongMode,\n        LegacyMode\n    };\n\n    enum X86SubMode {\n        SixtyFourBitMode,\n        CompatabilityMode,\n        ProtectedMode,\n        Virtual8086Mode,\n        RealMode\n    };\n\n    \/\/The intermediate structure the x86 predecoder returns.\n    struct ExtMachInst\n    {\n        \/\/Prefixes\n        LegacyPrefixVector legacy;\n        Rex rex;\n        \/\/This holds all of the bytes of the opcode\n        struct\n        {\n            \/\/The number of bytes in this opcode. Right now, we ignore that\n            \/\/this can be 3 in some cases\n            uint8_t num;\n            \/\/The first byte detected in a 2+ byte opcode. Should be 0xF0.\n            uint8_t prefixA;\n            \/\/The second byte detected in a 3+ byte opcode. Could be 0xF0 for\n            \/\/3dnow instructions, or 0x38-0x3F for some SSE instructions.\n            uint8_t prefixB;\n            \/\/The main opcode byte. The highest addressed byte in the opcode.\n            Opcode op;\n        } opcode;\n        \/\/Modifier bytes\n        ModRM modRM;\n        Sib sib;\n        \/\/Immediate fields\n        uint64_t immediate;\n        uint64_t displacement;\n\n        \/\/The effective operand size.\n        uint8_t opSize;\n        \/\/The effective address size.\n        uint8_t addrSize;\n        \/\/The effective stack size.\n        uint8_t stackSize;\n\n        \/\/Mode information\n        OperatingMode mode;\n    };\n\n    inline static std::ostream &\n        operator << (std::ostream & os, const ExtMachInst & emi)\n    {\n        ccprintf(os, \"\\n{\\n\\tleg = %#x,\\n\\trex = %#x,\\n\\t\"\n                     \"op = {\\n\\t\\tnum = %d,\\n\\t\\top = %#x,\\n\\t\\t\"\n                           \"prefixA = %#x,\\n\\t\\tprefixB = %#x\\n\\t},\\n\\t\"\n                     \"modRM = %#x,\\n\\tsib = %#x,\\n\\t\"\n                     \"immediate = %#x,\\n\\tdisplacement = %#x\\n}\\n\",\n                     emi.legacy, (uint8_t)emi.rex,\n                     emi.opcode.num, emi.opcode.op,\n                     emi.opcode.prefixA, emi.opcode.prefixB,\n                     (uint8_t)emi.modRM, (uint8_t)emi.sib,\n                     emi.immediate, emi.displacement);\n        return os;\n    }\n\n    inline static bool\n        operator == (const ExtMachInst &emi1, const ExtMachInst &emi2)\n    {\n        if(emi1.legacy != emi2.legacy)\n            return false;\n        if(emi1.rex != emi2.rex)\n            return false;\n        if(emi1.opcode.num != emi2.opcode.num)\n            return false;\n        if(emi1.opcode.op != emi2.opcode.op)\n            return false;\n        if(emi1.opcode.prefixA != emi2.opcode.prefixA)\n            return false;\n        if(emi1.opcode.prefixB != emi2.opcode.prefixB)\n            return false;\n        if(emi1.modRM != emi2.modRM)\n            return false;\n        if(emi1.sib != emi2.sib)\n            return false;\n        if(emi1.immediate != emi2.immediate)\n            return false;\n        if(emi1.displacement != emi2.displacement)\n            return false;\n        if(emi1.mode != emi2.mode)\n            return false;\n        if(emi1.opSize != emi2.opSize)\n            return false;\n        if(emi1.addrSize != emi2.addrSize)\n            return false;\n        if(emi1.stackSize != emi2.stackSize)\n            return false;\n        return true;\n    }\n\n    typedef uint64_t IntReg;\n    \/\/XXX Should this be a 128 bit structure for XMM memory ops?\n    typedef uint64_t LargestRead;\n    typedef uint64_t MiscReg;\n\n    \/\/These floating point types are correct for mmx, but not\n    \/\/technically for x87 (80 bits) or at all for xmm (128 bits)\n    typedef double FloatReg;\n    typedef uint64_t FloatRegBits;\n    typedef union\n    {\n        IntReg intReg;\n        FloatReg fpReg;\n        MiscReg ctrlReg;\n    } AnyReg;\n\n    \/\/XXX This is very hypothetical. X87 instructions would need to\n    \/\/change their \"context\" constantly. It's also not clear how\n    \/\/this would be handled as far as out of order execution.\n    \/\/Maybe x87 instructions are in order?\n    enum RegContextParam\n    {\n        CONTEXT_X87_TOP\n    };\n\n    typedef int RegContextVal;\n\n    typedef uint8_t RegIndex;\n};\n\n#endif \/\/ __ARCH_X86_TYPES_HH__\n<commit_msg>Fix the overload which prints ExtMachInst in X86.<commit_after>\/*\n * Copyright (c) 2007 The Hewlett-Packard Development Company\n * All rights reserved.\n *\n * Redistribution and use of this software in source and binary forms,\n * with or without modification, are permitted provided that the\n * following conditions are met:\n *\n * The software must be used only for Non-Commercial Use which means any\n * use which is NOT directed to receiving any direct monetary\n * compensation for, or commercial advantage from such use.  Illustrative\n * examples of non-commercial use are academic research, personal study,\n * teaching, education and corporate research & development.\n * Illustrative examples of commercial use are distributing products for\n * commercial advantage and providing services using the software for\n * commercial advantage.\n *\n * If you wish to use this software or functionality therein that may be\n * covered by patents for commercial use, please contact:\n *     Director of Intellectual Property Licensing\n *     Office of Strategy and Technology\n *     Hewlett-Packard Company\n *     1501 Page Mill Road\n *     Palo Alto, California  94304\n *\n * Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.  Redistributions\n * in binary form must reproduce the above copyright notice, this list of\n * conditions and the following disclaimer in the documentation and\/or\n * other materials provided with the distribution.  Neither the name of\n * the COPYRIGHT HOLDER(s), HEWLETT-PACKARD COMPANY, nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.  No right of\n * sublicense is granted herewith.  Derivatives of the software and\n * output created using the software may be prepared, but only for\n * Non-Commercial Uses.  Derivatives of the software may be shared with\n * others provided: (i) the others agree to abide by the list of\n * conditions herein which includes the Non-Commercial Use restrictions;\n * and (ii) such Derivatives of the software include the above copyright\n * notice to acknowledge the contribution from this software where\n * applicable, this list of conditions and the disclaimer below.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * Authors: Gabe Black\n *\/\n\n#ifndef __ARCH_X86_TYPES_HH__\n#define __ARCH_X86_TYPES_HH__\n\n#include <inttypes.h>\n#include <iostream>\n\n#include \"base\/bitunion.hh\"\n#include \"base\/cprintf.hh\"\n\nnamespace X86ISA\n{\n    \/\/This really determines how many bytes are passed to the predecoder.\n    typedef uint64_t MachInst;\n\n    enum Prefixes {\n        NoOverride,\n        CSOverride,\n        DSOverride,\n        ESOverride,\n        FSOverride,\n        GSOverride,\n        SSOverride,\n        RexPrefix,\n        OperandSizeOverride,\n        AddressSizeOverride,\n        Lock,\n        Rep,\n        Repne\n    };\n\n    BitUnion8(LegacyPrefixVector)\n        Bitfield<7> repne;\n        Bitfield<6> rep;\n        Bitfield<5> lock;\n        Bitfield<4> addr;\n        Bitfield<3> op;\n        \/\/There can be only one segment override, so they share the\n        \/\/first 3 bits in the legacyPrefixes bitfield.\n        Bitfield<2,0> seg;\n    EndBitUnion(LegacyPrefixVector)\n\n    BitUnion8(ModRM)\n        Bitfield<7,6> mod;\n        Bitfield<5,3> reg;\n        Bitfield<2,0> rm;\n    EndBitUnion(ModRM)\n\n    BitUnion8(Sib)\n        Bitfield<7,6> scale;\n        Bitfield<5,3> index;\n        Bitfield<2,0> base;\n    EndBitUnion(Sib)\n\n    BitUnion8(Rex)\n        Bitfield<3> w;\n        Bitfield<2> r;\n        Bitfield<1> x;\n        Bitfield<0> b;\n    EndBitUnion(Rex)\n\n    BitUnion8(Opcode)\n        Bitfield<7,3> top5;\n        Bitfield<2,0> bottom3;\n    EndBitUnion(Opcode)\n\n    BitUnion8(OperatingMode)\n        Bitfield<3> mode;\n        Bitfield<2,0> submode;\n    EndBitUnion(OperatingMode)\n\n    enum X86Mode {\n        LongMode,\n        LegacyMode\n    };\n\n    enum X86SubMode {\n        SixtyFourBitMode,\n        CompatabilityMode,\n        ProtectedMode,\n        Virtual8086Mode,\n        RealMode\n    };\n\n    \/\/The intermediate structure the x86 predecoder returns.\n    struct ExtMachInst\n    {\n        \/\/Prefixes\n        LegacyPrefixVector legacy;\n        Rex rex;\n        \/\/This holds all of the bytes of the opcode\n        struct\n        {\n            \/\/The number of bytes in this opcode. Right now, we ignore that\n            \/\/this can be 3 in some cases\n            uint8_t num;\n            \/\/The first byte detected in a 2+ byte opcode. Should be 0xF0.\n            uint8_t prefixA;\n            \/\/The second byte detected in a 3+ byte opcode. Could be 0xF0 for\n            \/\/3dnow instructions, or 0x38-0x3F for some SSE instructions.\n            uint8_t prefixB;\n            \/\/The main opcode byte. The highest addressed byte in the opcode.\n            Opcode op;\n        } opcode;\n        \/\/Modifier bytes\n        ModRM modRM;\n        Sib sib;\n        \/\/Immediate fields\n        uint64_t immediate;\n        uint64_t displacement;\n\n        \/\/The effective operand size.\n        uint8_t opSize;\n        \/\/The effective address size.\n        uint8_t addrSize;\n        \/\/The effective stack size.\n        uint8_t stackSize;\n\n        \/\/Mode information\n        OperatingMode mode;\n    };\n\n    inline static std::ostream &\n        operator << (std::ostream & os, const ExtMachInst & emi)\n    {\n        ccprintf(os, \"\\n{\\n\\tleg = %#x,\\n\\trex = %#x,\\n\\t\"\n                     \"op = {\\n\\t\\tnum = %d,\\n\\t\\top = %#x,\\n\\t\\t\"\n                           \"prefixA = %#x,\\n\\t\\tprefixB = %#x\\n\\t},\\n\\t\"\n                     \"modRM = %#x,\\n\\tsib = %#x,\\n\\t\"\n                     \"immediate = %#x,\\n\\tdisplacement = %#x\\n}\\n\",\n                     (uint8_t)emi.legacy, (uint8_t)emi.rex,\n                     emi.opcode.num, (uint8_t)emi.opcode.op,\n                     emi.opcode.prefixA, emi.opcode.prefixB,\n                     (uint8_t)emi.modRM, (uint8_t)emi.sib,\n                     emi.immediate, emi.displacement);\n        return os;\n    }\n\n    inline static bool\n        operator == (const ExtMachInst &emi1, const ExtMachInst &emi2)\n    {\n        if(emi1.legacy != emi2.legacy)\n            return false;\n        if(emi1.rex != emi2.rex)\n            return false;\n        if(emi1.opcode.num != emi2.opcode.num)\n            return false;\n        if(emi1.opcode.op != emi2.opcode.op)\n            return false;\n        if(emi1.opcode.prefixA != emi2.opcode.prefixA)\n            return false;\n        if(emi1.opcode.prefixB != emi2.opcode.prefixB)\n            return false;\n        if(emi1.modRM != emi2.modRM)\n            return false;\n        if(emi1.sib != emi2.sib)\n            return false;\n        if(emi1.immediate != emi2.immediate)\n            return false;\n        if(emi1.displacement != emi2.displacement)\n            return false;\n        if(emi1.mode != emi2.mode)\n            return false;\n        if(emi1.opSize != emi2.opSize)\n            return false;\n        if(emi1.addrSize != emi2.addrSize)\n            return false;\n        if(emi1.stackSize != emi2.stackSize)\n            return false;\n        return true;\n    }\n\n    typedef uint64_t IntReg;\n    \/\/XXX Should this be a 128 bit structure for XMM memory ops?\n    typedef uint64_t LargestRead;\n    typedef uint64_t MiscReg;\n\n    \/\/These floating point types are correct for mmx, but not\n    \/\/technically for x87 (80 bits) or at all for xmm (128 bits)\n    typedef double FloatReg;\n    typedef uint64_t FloatRegBits;\n    typedef union\n    {\n        IntReg intReg;\n        FloatReg fpReg;\n        MiscReg ctrlReg;\n    } AnyReg;\n\n    \/\/XXX This is very hypothetical. X87 instructions would need to\n    \/\/change their \"context\" constantly. It's also not clear how\n    \/\/this would be handled as far as out of order execution.\n    \/\/Maybe x87 instructions are in order?\n    enum RegContextParam\n    {\n        CONTEXT_X87_TOP\n    };\n\n    typedef int RegContextVal;\n\n    typedef uint8_t RegIndex;\n};\n\n#endif \/\/ __ARCH_X86_TYPES_HH__\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2007 The Hewlett-Packard Development Company\n * All rights reserved.\n *\n * Redistribution and use of this software in source and binary forms,\n * with or without modification, are permitted provided that the\n * following conditions are met:\n *\n * The software must be used only for Non-Commercial Use which means any\n * use which is NOT directed to receiving any direct monetary\n * compensation for, or commercial advantage from such use.  Illustrative\n * examples of non-commercial use are academic research, personal study,\n * teaching, education and corporate research & development.\n * Illustrative examples of commercial use are distributing products for\n * commercial advantage and providing services using the software for\n * commercial advantage.\n *\n * If you wish to use this software or functionality therein that may be\n * covered by patents for commercial use, please contact:\n *     Director of Intellectual Property Licensing\n *     Office of Strategy and Technology\n *     Hewlett-Packard Company\n *     1501 Page Mill Road\n *     Palo Alto, California  94304\n *\n * Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.  Redistributions\n * in binary form must reproduce the above copyright notice, this list of\n * conditions and the following disclaimer in the documentation and\/or\n * other materials provided with the distribution.  Neither the name of\n * the COPYRIGHT HOLDER(s), HEWLETT-PACKARD COMPANY, nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.  No right of\n * sublicense is granted herewith.  Derivatives of the software and\n * output created using the software may be prepared, but only for\n * Non-Commercial Uses.  Derivatives of the software may be shared with\n * others provided: (i) the others agree to abide by the list of\n * conditions herein which includes the Non-Commercial Use restrictions;\n * and (ii) such Derivatives of the software include the above copyright\n * notice to acknowledge the contribution from this software where\n * applicable, this list of conditions and the disclaimer below.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * Authors: Gabe Black\n *\/\n\n#ifndef __ARCH_X86_TYPES_HH__\n#define __ARCH_X86_TYPES_HH__\n\nnamespace X86ISA\n{\n    \/\/XXX This won't work\n    typedef uint32_t MachInst;\n    \/\/XXX This won't work either\n    typedef uint64_t ExtMachInst;\n\n    typedef uint64_t IntReg;\n    typedef uint64_t MiscReg;\n\n    \/\/These floating point types are correct for mmx, but not\n    \/\/technically for x87 (80 bits) or at all for xmm (128 bits)\n    typedef double FloatReg;\n    typedef uint64_t FloatRegBits;\n    typedef union\n    {\n        IntReg intReg;\n        FloatReg fpReg;\n        MiscReg ctrlReg;\n    } AnyReg;\n\n    \/\/XXX This is very hypothetical. X87 instructions would need to\n    \/\/change their \"context\" constantly. It's also not clear how\n    \/\/this would be handled as far as out of order execution.\n    \/\/Maybe x87 instructions are in order?\n    enum RegContextParam\n    {\n        CONTEXT_X87_TOP\n    };\n\n    typedef int RegContextVal;\n\n    typedef uint8_t RegIndex;\n};\n\n#endif \/\/ __ARCH_X86_TYPES_HH__\n<commit_msg>Added in a missing include.<commit_after>\/*\n * Copyright (c) 2007 The Hewlett-Packard Development Company\n * All rights reserved.\n *\n * Redistribution and use of this software in source and binary forms,\n * with or without modification, are permitted provided that the\n * following conditions are met:\n *\n * The software must be used only for Non-Commercial Use which means any\n * use which is NOT directed to receiving any direct monetary\n * compensation for, or commercial advantage from such use.  Illustrative\n * examples of non-commercial use are academic research, personal study,\n * teaching, education and corporate research & development.\n * Illustrative examples of commercial use are distributing products for\n * commercial advantage and providing services using the software for\n * commercial advantage.\n *\n * If you wish to use this software or functionality therein that may be\n * covered by patents for commercial use, please contact:\n *     Director of Intellectual Property Licensing\n *     Office of Strategy and Technology\n *     Hewlett-Packard Company\n *     1501 Page Mill Road\n *     Palo Alto, California  94304\n *\n * Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.  Redistributions\n * in binary form must reproduce the above copyright notice, this list of\n * conditions and the following disclaimer in the documentation and\/or\n * other materials provided with the distribution.  Neither the name of\n * the COPYRIGHT HOLDER(s), HEWLETT-PACKARD COMPANY, nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.  No right of\n * sublicense is granted herewith.  Derivatives of the software and\n * output created using the software may be prepared, but only for\n * Non-Commercial Uses.  Derivatives of the software may be shared with\n * others provided: (i) the others agree to abide by the list of\n * conditions herein which includes the Non-Commercial Use restrictions;\n * and (ii) such Derivatives of the software include the above copyright\n * notice to acknowledge the contribution from this software where\n * applicable, this list of conditions and the disclaimer below.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * Authors: Gabe Black\n *\/\n\n#ifndef __ARCH_X86_TYPES_HH__\n#define __ARCH_X86_TYPES_HH__\n\n#include <inttypes.h>\n\nnamespace X86ISA\n{\n    \/\/XXX This won't work\n    typedef uint32_t MachInst;\n    \/\/XXX This won't work either\n    typedef uint64_t ExtMachInst;\n\n    typedef uint64_t IntReg;\n    typedef uint64_t MiscReg;\n\n    \/\/These floating point types are correct for mmx, but not\n    \/\/technically for x87 (80 bits) or at all for xmm (128 bits)\n    typedef double FloatReg;\n    typedef uint64_t FloatRegBits;\n    typedef union\n    {\n        IntReg intReg;\n        FloatReg fpReg;\n        MiscReg ctrlReg;\n    } AnyReg;\n\n    \/\/XXX This is very hypothetical. X87 instructions would need to\n    \/\/change their \"context\" constantly. It's also not clear how\n    \/\/this would be handled as far as out of order execution.\n    \/\/Maybe x87 instructions are in order?\n    enum RegContextParam\n    {\n        CONTEXT_X87_TOP\n    };\n\n    typedef int RegContextVal;\n\n    typedef uint8_t RegIndex;\n};\n\n#endif \/\/ __ARCH_X86_TYPES_HH__\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2009-2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-2018 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <arith_uint256.h>\n\n#include <uint256.h>\n#include <utilstrencodings.h>\n#include <crypto\/common.h>\n\n#include <stdio.h>\n#include <string.h>\n\ntemplate <unsigned int BITS>\nbase_uint<BITS>::base_uint(const std::string& str)\n{\n    static_assert(BITS\/32 > 0 && BITS%32 == 0, \"Template parameter BITS must be a positive multiple of 32.\");\n\n    SetHex(str);\n}\n\ntemplate <unsigned int BITS>\nbase_uint<BITS>& base_uint<BITS>::operator<<=(unsigned int shift)\n{\n    base_uint<BITS> a(*this);\n    for (int i = 0; i < WIDTH; i++)\n        pn[i] = 0;\n    int k = shift \/ 32;\n    shift = shift % 32;\n    for (int i = 0; i < WIDTH; i++) {\n        if (i + k + 1 < WIDTH && shift != 0)\n            pn[i + k + 1] |= (a.pn[i] >> (32 - shift));\n        if (i + k < WIDTH)\n            pn[i + k] |= (a.pn[i] << shift);\n    }\n    return *this;\n}\n\ntemplate <unsigned int BITS>\nbase_uint<BITS>& base_uint<BITS>::operator>>=(unsigned int shift)\n{\n    base_uint<BITS> a(*this);\n    for (int i = 0; i < WIDTH; i++)\n        pn[i] = 0;\n    int k = shift \/ 32;\n    shift = shift % 32;\n    for (int i = 0; i < WIDTH; i++) {\n        if (i - k - 1 >= 0 && shift != 0)\n            pn[i - k - 1] |= (a.pn[i] << (32 - shift));\n        if (i - k >= 0)\n            pn[i - k] |= (a.pn[i] >> shift);\n    }\n    return *this;\n}\n\ntemplate <unsigned int BITS>\nbase_uint<BITS>& base_uint<BITS>::operator*=(uint32_t b32)\n{\n    uint64_t carry = 0;\n    for (int i = 0; i < WIDTH; i++) {\n        uint64_t n = carry + (uint64_t)b32 * pn[i];\n        pn[i] = n & 0xffffffff;\n        carry = n >> 32;\n    }\n    return *this;\n}\n\ntemplate <unsigned int BITS>\nbase_uint<BITS>& base_uint<BITS>::operator*=(const base_uint& b)\n{\n    base_uint<BITS> a;\n    for (int j = 0; j < WIDTH; j++) {\n        uint64_t carry = 0;\n        for (int i = 0; i + j < WIDTH; i++) {\n            uint64_t n = carry + a.pn[i + j] + (uint64_t)pn[j] * b.pn[i];\n            a.pn[i + j] = n & 0xffffffff;\n            carry = n >> 32;\n        }\n    }\n    *this = a;\n    return *this;\n}\n\ntemplate <unsigned int BITS>\nbase_uint<BITS>& base_uint<BITS>::operator\/=(const base_uint& b)\n{\n    base_uint<BITS> div = b;     \/\/ make a copy, so we can shift.\n    base_uint<BITS> num = *this; \/\/ make a copy, so we can subtract.\n    *this = 0;                   \/\/ the quotient.\n    int num_bits = num.bits();\n    int div_bits = div.bits();\n    if (div_bits == 0)\n        throw uint_error(\"Division by zero\");\n    if (div_bits > num_bits) \/\/ the result is certainly 0.\n        return *this;\n    int shift = num_bits - div_bits;\n    div <<= shift; \/\/ shift so that div and num align.\n    while (shift >= 0) {\n        if (num >= div) {\n            num -= div;\n            pn[shift \/ 32] |= (1 << (shift & 31)); \/\/ set a bit of the result.\n        }\n        div >>= 1; \/\/ shift back.\n        shift--;\n    }\n    \/\/ num now contains the remainder of the division.\n    return *this;\n}\n\ntemplate <unsigned int BITS>\nint base_uint<BITS>::CompareTo(const base_uint<BITS>& b) const\n{\n    for (int i = WIDTH - 1; i >= 0; i--) {\n        if (pn[i] < b.pn[i])\n            return -1;\n        if (pn[i] > b.pn[i])\n            return 1;\n    }\n    return 0;\n}\n\ntemplate <unsigned int BITS>\nbool base_uint<BITS>::EqualTo(uint64_t b) const\n{\n    for (int i = WIDTH - 1; i >= 2; i--) {\n        if (pn[i])\n            return false;\n    }\n    if (pn[1] != (b >> 32))\n        return false;\n    if (pn[0] != (b & 0xfffffffful))\n        return false;\n    return true;\n}\n\ntemplate <unsigned int BITS>\ndouble base_uint<BITS>::getdouble() const\n{\n    double ret = 0.0;\n    double fact = 1.0;\n    for (int i = 0; i < WIDTH; i++) {\n        ret += fact * pn[i];\n        fact *= 4294967296.0;\n    }\n    return ret;\n}\n\ntemplate <unsigned int BITS>\nstd::string base_uint<BITS>::GetHex() const\n{\n    return ArithToUint256(*this).GetHex();\n}\n\ntemplate <unsigned int BITS>\nvoid base_uint<BITS>::SetHex(const char* psz)\n{\n    *this = UintToArith256(uint256S(psz));\n}\n\ntemplate <unsigned int BITS>\nvoid base_uint<BITS>::SetHex(const std::string& str)\n{\n    SetHex(str.c_str());\n}\n\ntemplate <unsigned int BITS>\nstd::string base_uint<BITS>::ToString() const\n{\n    return (GetHex());\n}\n\ntemplate <unsigned int BITS>\nunsigned int base_uint<BITS>::bits() const\n{\n    for (int pos = WIDTH - 1; pos >= 0; pos--) {\n        if (pn[pos]) {\n            for (int nbits = 31; nbits > 0; nbits--) {\n                if (pn[pos] & 1 << nbits)\n                    return 32 * pos + nbits + 1;\n            }\n            return 32 * pos + 1;\n        }\n    }\n    return 0;\n}\n\n\/\/ Explicit instantiations for base_uint<256>\ntemplate base_uint<256>::base_uint(const std::string&);\ntemplate base_uint<256>& base_uint<256>::operator<<=(unsigned int);\ntemplate base_uint<256>& base_uint<256>::operator>>=(unsigned int);\ntemplate base_uint<256>& base_uint<256>::operator*=(uint32_t b32);\ntemplate base_uint<256>& base_uint<256>::operator*=(const base_uint<256>& b);\ntemplate base_uint<256>& base_uint<256>::operator\/=(const base_uint<256>& b);\ntemplate int base_uint<256>::CompareTo(const base_uint<256>&) const;\ntemplate bool base_uint<256>::EqualTo(uint64_t) const;\ntemplate double base_uint<256>::getdouble() const;\ntemplate std::string base_uint<256>::GetHex() const;\ntemplate std::string base_uint<256>::ToString() const;\ntemplate void base_uint<256>::SetHex(const char*);\ntemplate void base_uint<256>::SetHex(const std::string&);\ntemplate unsigned int base_uint<256>::bits() const;\n\n\/\/ This implementation directly uses shifts instead of going\n\/\/ through an intermediate MPI representation.\narith_uint256& arith_uint256::SetCompact(uint32_t nCompact, bool* pfNegative, bool* pfOverflow)\n{\n    int nSize = nCompact >> 24;\n    uint32_t nWord = nCompact & 0x007fffff;\n    if (nSize <= 3) {\n        nWord >>= 8 * (3 - nSize);\n        *this = nWord;\n    } else {\n        *this = nWord;\n        *this <<= 8 * (nSize - 3);\n    }\n    if (pfNegative)\n        *pfNegative = nWord != 0 && (nCompact & 0x00800000) != 0;\n    if (pfOverflow)\n        *pfOverflow = nWord != 0 && ((nSize > 34) ||\n                                     (nWord > 0xff && nSize > 33) ||\n                                     (nWord > 0xffff && nSize > 32));\n    return *this;\n}\n\nuint32_t arith_uint256::GetCompact(bool fNegative) const\n{\n    int nSize = (bits() + 7) \/ 8;\n    uint32_t nCompact = 0;\n    if (nSize <= 3) {\n        nCompact = GetLow64() << 8 * (3 - nSize);\n    } else {\n        arith_uint256 bn = *this >> 8 * (nSize - 3);\n        nCompact = bn.GetLow64();\n    }\n    \/\/ The 0x00800000 bit denotes the sign.\n    \/\/ Thus, if it is already set, divide the mantissa by 256 and increase the exponent.\n    if (nCompact & 0x00800000) {\n        nCompact >>= 8;\n        nSize++;\n    }\n    assert((nCompact & ~0x007fffff) == 0);\n    assert(nSize < 256);\n    nCompact |= nSize << 24;\n    nCompact |= (fNegative && (nCompact & 0x007fffff) ? 0x00800000 : 0);\n    return nCompact;\n}\n\nuint256 ArithToUint256(const arith_uint256 &a)\n{\n    uint256 b;\n    for(int x=0; x<a.WIDTH; ++x)\n        WriteLE32(b.begin() + x*4, a.pn[x]);\n    return b;\n}\narith_uint256 UintToArith256(const uint256 &a)\n{\n    arith_uint256 b;\n    for(int x=0; x<b.WIDTH; ++x)\n        b.pn[x] = ReadLE32(a.begin() + x*4);\n    return b;\n}\n<commit_msg>Avoid triggering undefined behaviour in base_uint<BITS>::bits()<commit_after>\/\/ Copyright (c) 2009-2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-2018 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <arith_uint256.h>\n\n#include <uint256.h>\n#include <utilstrencodings.h>\n#include <crypto\/common.h>\n\n#include <stdio.h>\n#include <string.h>\n\ntemplate <unsigned int BITS>\nbase_uint<BITS>::base_uint(const std::string& str)\n{\n    static_assert(BITS\/32 > 0 && BITS%32 == 0, \"Template parameter BITS must be a positive multiple of 32.\");\n\n    SetHex(str);\n}\n\ntemplate <unsigned int BITS>\nbase_uint<BITS>& base_uint<BITS>::operator<<=(unsigned int shift)\n{\n    base_uint<BITS> a(*this);\n    for (int i = 0; i < WIDTH; i++)\n        pn[i] = 0;\n    int k = shift \/ 32;\n    shift = shift % 32;\n    for (int i = 0; i < WIDTH; i++) {\n        if (i + k + 1 < WIDTH && shift != 0)\n            pn[i + k + 1] |= (a.pn[i] >> (32 - shift));\n        if (i + k < WIDTH)\n            pn[i + k] |= (a.pn[i] << shift);\n    }\n    return *this;\n}\n\ntemplate <unsigned int BITS>\nbase_uint<BITS>& base_uint<BITS>::operator>>=(unsigned int shift)\n{\n    base_uint<BITS> a(*this);\n    for (int i = 0; i < WIDTH; i++)\n        pn[i] = 0;\n    int k = shift \/ 32;\n    shift = shift % 32;\n    for (int i = 0; i < WIDTH; i++) {\n        if (i - k - 1 >= 0 && shift != 0)\n            pn[i - k - 1] |= (a.pn[i] << (32 - shift));\n        if (i - k >= 0)\n            pn[i - k] |= (a.pn[i] >> shift);\n    }\n    return *this;\n}\n\ntemplate <unsigned int BITS>\nbase_uint<BITS>& base_uint<BITS>::operator*=(uint32_t b32)\n{\n    uint64_t carry = 0;\n    for (int i = 0; i < WIDTH; i++) {\n        uint64_t n = carry + (uint64_t)b32 * pn[i];\n        pn[i] = n & 0xffffffff;\n        carry = n >> 32;\n    }\n    return *this;\n}\n\ntemplate <unsigned int BITS>\nbase_uint<BITS>& base_uint<BITS>::operator*=(const base_uint& b)\n{\n    base_uint<BITS> a;\n    for (int j = 0; j < WIDTH; j++) {\n        uint64_t carry = 0;\n        for (int i = 0; i + j < WIDTH; i++) {\n            uint64_t n = carry + a.pn[i + j] + (uint64_t)pn[j] * b.pn[i];\n            a.pn[i + j] = n & 0xffffffff;\n            carry = n >> 32;\n        }\n    }\n    *this = a;\n    return *this;\n}\n\ntemplate <unsigned int BITS>\nbase_uint<BITS>& base_uint<BITS>::operator\/=(const base_uint& b)\n{\n    base_uint<BITS> div = b;     \/\/ make a copy, so we can shift.\n    base_uint<BITS> num = *this; \/\/ make a copy, so we can subtract.\n    *this = 0;                   \/\/ the quotient.\n    int num_bits = num.bits();\n    int div_bits = div.bits();\n    if (div_bits == 0)\n        throw uint_error(\"Division by zero\");\n    if (div_bits > num_bits) \/\/ the result is certainly 0.\n        return *this;\n    int shift = num_bits - div_bits;\n    div <<= shift; \/\/ shift so that div and num align.\n    while (shift >= 0) {\n        if (num >= div) {\n            num -= div;\n            pn[shift \/ 32] |= (1 << (shift & 31)); \/\/ set a bit of the result.\n        }\n        div >>= 1; \/\/ shift back.\n        shift--;\n    }\n    \/\/ num now contains the remainder of the division.\n    return *this;\n}\n\ntemplate <unsigned int BITS>\nint base_uint<BITS>::CompareTo(const base_uint<BITS>& b) const\n{\n    for (int i = WIDTH - 1; i >= 0; i--) {\n        if (pn[i] < b.pn[i])\n            return -1;\n        if (pn[i] > b.pn[i])\n            return 1;\n    }\n    return 0;\n}\n\ntemplate <unsigned int BITS>\nbool base_uint<BITS>::EqualTo(uint64_t b) const\n{\n    for (int i = WIDTH - 1; i >= 2; i--) {\n        if (pn[i])\n            return false;\n    }\n    if (pn[1] != (b >> 32))\n        return false;\n    if (pn[0] != (b & 0xfffffffful))\n        return false;\n    return true;\n}\n\ntemplate <unsigned int BITS>\ndouble base_uint<BITS>::getdouble() const\n{\n    double ret = 0.0;\n    double fact = 1.0;\n    for (int i = 0; i < WIDTH; i++) {\n        ret += fact * pn[i];\n        fact *= 4294967296.0;\n    }\n    return ret;\n}\n\ntemplate <unsigned int BITS>\nstd::string base_uint<BITS>::GetHex() const\n{\n    return ArithToUint256(*this).GetHex();\n}\n\ntemplate <unsigned int BITS>\nvoid base_uint<BITS>::SetHex(const char* psz)\n{\n    *this = UintToArith256(uint256S(psz));\n}\n\ntemplate <unsigned int BITS>\nvoid base_uint<BITS>::SetHex(const std::string& str)\n{\n    SetHex(str.c_str());\n}\n\ntemplate <unsigned int BITS>\nstd::string base_uint<BITS>::ToString() const\n{\n    return (GetHex());\n}\n\ntemplate <unsigned int BITS>\nunsigned int base_uint<BITS>::bits() const\n{\n    for (int pos = WIDTH - 1; pos >= 0; pos--) {\n        if (pn[pos]) {\n            for (int nbits = 31; nbits > 0; nbits--) {\n                if (pn[pos] & 1U << nbits)\n                    return 32 * pos + nbits + 1;\n            }\n            return 32 * pos + 1;\n        }\n    }\n    return 0;\n}\n\n\/\/ Explicit instantiations for base_uint<256>\ntemplate base_uint<256>::base_uint(const std::string&);\ntemplate base_uint<256>& base_uint<256>::operator<<=(unsigned int);\ntemplate base_uint<256>& base_uint<256>::operator>>=(unsigned int);\ntemplate base_uint<256>& base_uint<256>::operator*=(uint32_t b32);\ntemplate base_uint<256>& base_uint<256>::operator*=(const base_uint<256>& b);\ntemplate base_uint<256>& base_uint<256>::operator\/=(const base_uint<256>& b);\ntemplate int base_uint<256>::CompareTo(const base_uint<256>&) const;\ntemplate bool base_uint<256>::EqualTo(uint64_t) const;\ntemplate double base_uint<256>::getdouble() const;\ntemplate std::string base_uint<256>::GetHex() const;\ntemplate std::string base_uint<256>::ToString() const;\ntemplate void base_uint<256>::SetHex(const char*);\ntemplate void base_uint<256>::SetHex(const std::string&);\ntemplate unsigned int base_uint<256>::bits() const;\n\n\/\/ This implementation directly uses shifts instead of going\n\/\/ through an intermediate MPI representation.\narith_uint256& arith_uint256::SetCompact(uint32_t nCompact, bool* pfNegative, bool* pfOverflow)\n{\n    int nSize = nCompact >> 24;\n    uint32_t nWord = nCompact & 0x007fffff;\n    if (nSize <= 3) {\n        nWord >>= 8 * (3 - nSize);\n        *this = nWord;\n    } else {\n        *this = nWord;\n        *this <<= 8 * (nSize - 3);\n    }\n    if (pfNegative)\n        *pfNegative = nWord != 0 && (nCompact & 0x00800000) != 0;\n    if (pfOverflow)\n        *pfOverflow = nWord != 0 && ((nSize > 34) ||\n                                     (nWord > 0xff && nSize > 33) ||\n                                     (nWord > 0xffff && nSize > 32));\n    return *this;\n}\n\nuint32_t arith_uint256::GetCompact(bool fNegative) const\n{\n    int nSize = (bits() + 7) \/ 8;\n    uint32_t nCompact = 0;\n    if (nSize <= 3) {\n        nCompact = GetLow64() << 8 * (3 - nSize);\n    } else {\n        arith_uint256 bn = *this >> 8 * (nSize - 3);\n        nCompact = bn.GetLow64();\n    }\n    \/\/ The 0x00800000 bit denotes the sign.\n    \/\/ Thus, if it is already set, divide the mantissa by 256 and increase the exponent.\n    if (nCompact & 0x00800000) {\n        nCompact >>= 8;\n        nSize++;\n    }\n    assert((nCompact & ~0x007fffff) == 0);\n    assert(nSize < 256);\n    nCompact |= nSize << 24;\n    nCompact |= (fNegative && (nCompact & 0x007fffff) ? 0x00800000 : 0);\n    return nCompact;\n}\n\nuint256 ArithToUint256(const arith_uint256 &a)\n{\n    uint256 b;\n    for(int x=0; x<a.WIDTH; ++x)\n        WriteLE32(b.begin() + x*4, a.pn[x]);\n    return b;\n}\narith_uint256 UintToArith256(const uint256 &a)\n{\n    arith_uint256 b;\n    for(int x=0; x<b.WIDTH; ++x)\n        b.pn[x] = ReadLE32(a.begin() + x*4);\n    return b;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <af\/array.h>\n#include <copy.hpp>\n#include <print.hpp>\n#include <ArrayInfo.hpp>\n#include <err_common.hpp>\n#include <backend.hpp>\n#include <type_util.hpp>\n\nusing namespace detail;\nusing std::ostream;\nusing std::cout;\nusing std::endl;\n\ntemplate<typename T>\nstatic void printer(ostream &out, const T* ptr, const ArrayInfo &info, unsigned dim)\n{\n\n    dim_type stride =   info.strides()[dim];\n    dim_type d      =   info.dims()[dim];\n    ToNum<T> toNum;\n\n    if(dim == 0) {\n        for(dim_type i = 0, j = 0; i < d; i++, j+=stride) {\n            out << toNum(ptr[j]) << \"\\t\";\n        }\n        out << endl;\n    }\n    else {\n        for(dim_type i = 0; i < d; i++) {\n            printer(out, ptr, info, dim - 1);\n            ptr += stride;\n        }\n        out << endl;\n    }\n}\n\ntemplate<typename T>\nstatic void print(af_array arr)\n{\n    const ArrayInfo info = getInfo(arr);\n    T *data = new T[info.elements()];\n    \/\/FIXME: Use alternative function to avoid copies if possible\n    af_get_data_ptr(data, arr);\n\n    std::cout << \"TRANSPOSED\\n\";\n    std::cout << \"Dim:\" << info.dims();\n    std::cout << \"Offset: \" << info.offsets();\n    std::cout << \"Stride: \" << info.strides();\n\n    printer(std::cout, data, info, info.ndims() - 1);\n\n    delete[] data;\n}\n\naf_err af_print_array(af_array arr)\n{\n    try {\n        ArrayInfo info = getInfo(arr);\n        af_dtype type = info.getType();\n        switch(type)\n        {\n        case f32:   print<float>(arr);    break;\n        case c32:   print<cfloat>(arr);   break;\n        case f64:   print<double>(arr);   break;\n        case c64:   print<cdouble>(arr);  break;\n        case b8:    print<char>(arr);     break;\n        case s32:   print<int>(arr);      break;\n        case u32:   print<unsigned>(arr); break;\n        case u8:    print<uchar>(arr);    break;\n        case s8:    print<char>(arr);     break;\n        default:    TYPE_ERROR(1, type);\n        }\n    }\n    CATCHALL;\n    return AF_SUCCESS;\n}\n<commit_msg>Fixed af_print to print regular array (not transposed)<commit_after>#include <iostream>\n#include <af\/array.h>\n#include <copy.hpp>\n#include <print.hpp>\n#include <ArrayInfo.hpp>\n#include <err_common.hpp>\n#include <backend.hpp>\n#include <type_util.hpp>\n\n#include <af\/index.h>\n\nusing namespace detail;\nusing std::ostream;\nusing std::cout;\nusing std::endl;\n\ntemplate<typename T>\nstatic void printer(ostream &out, const T* ptr, const ArrayInfo &info, unsigned dim)\n{\n\n    dim_type stride =   info.strides()[dim];\n    dim_type d      =   info.dims()[dim];\n    ToNum<T> toNum;\n\n    if(dim == 0) {\n        for(dim_type i = 0, j = 0; i < d; i++, j+=stride) {\n            out << toNum(ptr[j]) << \"\\t\";\n        }\n        out << endl;\n    }\n    else {\n        for(dim_type i = 0; i < d; i++) {\n            printer(out, ptr, info, dim - 1);\n            ptr += stride;\n        }\n        out << endl;\n    }\n}\n\ntemplate<typename T>\nstatic void print(af_array arr)\n{\n    const ArrayInfo info = getInfo(arr);\n    T *data = new T[info.elements()];\n\n    af_array arrT;\n    af_reorder(&arrT, arr, 1, 0, 2, 3);\n\n    \/\/FIXME: Use alternative function to avoid copies if possible\n    af_get_data_ptr(data, arrT);\n    const ArrayInfo infoT = getInfo(arrT);\n\n    \/\/std::cout << \"TRANSPOSED\\n\";\n    std::cout << \"Dim:\" << info.dims();\n    std::cout << \"Offset: \" << info.offsets();\n    std::cout << \"Stride: \" << info.strides();\n\n    printer(std::cout, data, infoT, infoT.ndims() - 1);\n\n    delete[] data;\n}\n\naf_err af_print_array(af_array arr)\n{\n    try {\n        ArrayInfo info = getInfo(arr);\n        af_dtype type = info.getType();\n        switch(type)\n        {\n        case f32:   print<float>(arr);    break;\n        case c32:   print<cfloat>(arr);   break;\n        case f64:   print<double>(arr);   break;\n        case c64:   print<cdouble>(arr);  break;\n        case b8:    print<char>(arr);     break;\n        case s32:   print<int>(arr);      break;\n        case u32:   print<unsigned>(arr); break;\n        case u8:    print<uchar>(arr);    break;\n        case s8:    print<char>(arr);     break;\n        default:    TYPE_ERROR(1, type);\n        }\n    }\n    CATCHALL;\n    return AF_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* bzflag\n * Copyright (c) 1993 - 2003 Tim Riker\n *\n * This package is free software;  you can redistribute it and\/or\n * modify it under the terms of the license found in the file\n * named 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#ifdef _WIN32\n#pragma warning( 4:4786)\n#endif\n\n\/\/ interface header\n#include \"commands.h\"\n\n\/\/ implementation-specific system headers\n#include <string>\n#include <cstdio>\n#include <cstring>\n\n\/\/ implementation-specific bzflag headers\n#include \"global.h\"\n#include \"Address.h\"\n\n\/\/ implementation-specific bzfs-specific headers\n#include \"VotingArbiter.h\"\n#include \"Permissions.h\"\n#include \"CmdLineOptions.h\"\n#include \"PlayerInfo.h\"\n\n\/\/ FIXME -- need to pull communication out of bzfs.cxx...\nextern void sendMessage(int playerIndex, PlayerId targetPlayer, const char *message, bool fullBuffer);\nextern bool hasPerm(int playerIndex, PlayerAccessInfo::AccessPerm right);\nextern PlayerInfo *player;\nextern CmdLineOptions *clOptions;\nextern uint16_t curMaxPlayers;\nextern int NotConnected;\n\n\nvoid handlePollCmd(int t, const char *message)\n{\n  char reply[MessageLen];\n\n  static VotingArbiter *arbiter = (VotingArbiter *)BZDB->getPointer(\"poll\");\n    \/* make sure player has permission to request a poll *\/\n  if (!hasPerm(t, PlayerAccessInfo::poll)) {\n      sprintf(reply,\"%s, you are presently not authorized to run \/poll\", player[t].callSign);\n      sendMessage(ServerPlayer, t, reply, true);\n      return;\n  }\n\n    \/* make sure that there is a poll arbiter *\/\n  if (BZDB->isEmpty(\"poll\")) {\n      sprintf(reply, \"ERROR: the poll arbiter has disappeared (this should never happen)\");\n      sendMessage(ServerPlayer, t, reply, true);\n      return;\n  }\n\n    \/* make sure that there is not a poll active already *\/\n  if (arbiter->knowsPoll()) {\n      sprintf(reply,\"A poll to %s %s is presently in progress\", arbiter->getPollAction().c_str(), arbiter->getPollPlayer().c_str());\n      sendMessage(ServerPlayer, t, reply, true);\n      sprintf(reply,\"Unable to start a new poll until the current one is over\");\n      sendMessage(ServerPlayer, t, reply, true);\n      return;\n  }\n\n    \/\/ get available voter count\n  unsigned short int available = 0;\n  for (int i=0; i < curMaxPlayers; i++) {\n      \/\/ anyone on the server (even observers) are eligible to vote\n      if (player[i].fd != NotConnected) {\n\tavailable++;\n      }\n  }\n\n    \/\/ make sure there are enough players to even make a poll (don't count the pollee)\n  if (available - 1 < clOptions->votesRequired) {\n      sprintf(reply,\"Unable to initiate a new poll.  There are not enough players.\");\n      sendMessage(ServerPlayer, t, reply, true);\n      sprintf(reply,\"There needs to be at least %d other %s and only %d %s available.\",\n\t      clOptions->votesRequired,\n\t      clOptions->votesRequired - 1 == 1 ? \"player\" : \"players\",\n\t      available - 1,\n\t      available - 1 == 1 ? \"is\" : \"are\");\n      sendMessage(ServerPlayer, t, reply, true);\n      return;\n  }\n\n  std::string pollCmd = &message[5];\n  std::string cmd;\n  std::string nick;\n\n  unsigned int endPos;\n  unsigned int startPos = pollCmd.find_first_not_of(\" \\t\");\n  if (startPos != std::string::npos) {\n      endPos = pollCmd.find_first_of(\" \\t\", startPos);\n      if (endPos == std::string::npos)\n\tendPos = pollCmd.length();\n\n      cmd = pollCmd.substr(startPos,endPos-startPos);\n      pollCmd = pollCmd.substr(endPos);\n  }\n  else {\n      sprintf(reply,\"Invalid poll syntax: \/poll (kick|ban|vote|veto) playername\");\n      sendMessage(ServerPlayer, t, reply, true);\n      return;\n  }\n\n  if ((cmd == \"ban\") || (cmd == \"kick\")) {\n\n      startPos = pollCmd.find_first_not_of(\" \\t\");\n      if (startPos != std::string::npos) {\n\tstd::string votePlayer = pollCmd.substr(startPos);\n\tif (votePlayer.length() == 0) {\n\t  sprintf(reply,\"%s, no player was specified for the %s vote\", player[t].callSign, cmd.c_str());\n\t  sendMessage(ServerPlayer, t, reply, true);\n\t  sprintf(reply,\"Usage: \/poll %s [playername]\", cmd.c_str());\n\t  sendMessage(ServerPlayer, t, reply, true);\n\t  return;\n\t}\n\n        \/* make sure the requested player is actually here *\/\n        bool foundPlayer=false;\n        std::string playerIP = \"\";\n        for (int v = 0; v < curMaxPlayers; v++) {\n\t  if (votePlayer == player[v].callSign) {\n\t    playerIP = player[v].peer.getDotNotation().c_str();\n\t    foundPlayer=true;\n\t    break;\n\t  }\n\t}\n\n        if (!foundPlayer) {\n\t  \/* wrong name? *\/\n\t  sprintf(reply, \"The player specified for a %s vote is not here\", cmd.c_str());\n\t  sendMessage(ServerPlayer, t, reply, true);\n\t  sprintf(reply,\"Usage: \/poll %s [playername]\", cmd.c_str());\n\t  sendMessage(ServerPlayer, t, reply, true);\n\t  return;\n\t}\n\n        \/* create and announce the new poll *\/\n        if (cmd == \"ban\") {\n\t  if (arbiter->pollToBan(votePlayer.c_str(), player[t].callSign, playerIP) == false) {\n\t    sprintf(reply,\"You are not able to request a ban poll right now, %s\", player[t].callSign);\n\t    sendMessage(ServerPlayer, t, reply, true);\n\t  } else {\n\t    sprintf(reply,\"A poll to temporarily ban %s has been requested by %s\", votePlayer.c_str(), player[t].callSign);\n\t    sendMessage(ServerPlayer, AllPlayers, reply, true);\n\t  }\n\t} else {\n\t  if (arbiter->pollToKick(votePlayer.c_str(), player[t].callSign) == false) {\n\t    sprintf(reply,\"You are not able to request a kick poll right now, %s\", player[t].callSign);\n\t    sendMessage(ServerPlayer, t, reply, true);\n\t  } else {\n\t    sprintf(reply,\"A poll to %s %s has been requested by %s\", cmd.c_str(), votePlayer.c_str(), player[t].callSign);\n\t    sendMessage(ServerPlayer, AllPlayers, reply, true);\n\t  }\n\t}\n\n        \/\/ set the number of available voters\n        arbiter->setAvailableVoters(available);\n\n        \/\/ keep track of who is allowed to vote\n        for (int j=0; j < curMaxPlayers; j++) {\n\t  \/\/ anyone on the server (even observers) are eligible to vote\n\t  if (player[j].fd != NotConnected) {\n\t    arbiter->grantSuffrage(player[j].callSign);\n\t  }\n\t}\n\n        \/\/ automatically place a vote for the player requesting the poll\n        arbiter->voteYes(player[t].callSign);\n      }\n      else {\n        sprintf(reply,\"Invalid poll syntax: \/poll %s playername\", cmd.c_str());\n        sendMessage(ServerPlayer, t, reply, true);\n\treturn;\n      }\n    } else if (cmd == \"vote\") {\n\n      if (!hasPerm(t, PlayerAccessInfo::vote)) {\n\tsprintf(reply,\"%s, you do not presently have permission to vote (must \/identify first)\", player[t].callSign);\n\tsendMessage(ServerPlayer, t, reply, true);\n\treturn;\n      }\n\n      \/* !!! needs to be handled by the \/vote command  *\/\n      sprintf(reply,\"%s, your vote has been recorded -- unimplemented\", player[t].callSign);\n      sendMessage(ServerPlayer, t, reply, true);\n\n\n    } else if (cmd == \"veto\") {\n\n      if (!hasPerm(t, PlayerAccessInfo::veto)) {\n\tsprintf(reply,\"%s, you do not have permission to veto the poll\", player[t].callSign);\n\tsendMessage(ServerPlayer, t, reply, true);\n      }\n\n      \/* !!! needs to be handled by the \/veto command  *\/\n      sprintf(reply,\"%s, you have aborted the poll -- unimplemented\", player[t].callSign);\n      sendMessage(ServerPlayer, t, reply, true);\n\n\n    } else {\n\n      sprintf(reply,\"Invalid option to the poll command\");\n      sendMessage(ServerPlayer, t, reply, true);\n      sprintf(reply,\"Usage: \/poll ban|kick [playername]\");\n      sendMessage(ServerPlayer, t, reply, true);\n    } \/* end handling of poll subcommands *\/\n}\n\nvoid handleVoteCmd(int t, const char *message)\n{\n  char reply[MessageLen];\n\n  if (!hasPerm(t, PlayerAccessInfo::vote)) {\n      \/* permission denied for \/vote *\/\n      sprintf(reply,\"%s, you are presently not authorized to run \/vote\", player[t].callSign);\n      sendMessage(ServerPlayer, t, reply, true);\n      return;\n  }\n\n    \/* make sure that there is a poll arbiter *\/\n  if (BZDB->isEmpty(\"poll\")) {\n      sprintf(reply, \"ERROR: the poll arbiter has disappeared (this should never happen)\");\n      sendMessage(ServerPlayer, t, reply, true);\n      return;\n  }\n\n  VotingArbiter *arbiter = (VotingArbiter *)BZDB->getPointer(\"poll\");\n\n  \/* make sure that there is a poll to vote upon *\/\n  if (!arbiter->knowsPoll()) {\n      sprintf(reply,\"A poll is not presently in progress.  There is nothing to vote on\");\n      sendMessage(ServerPlayer, t, reply, true);\n      return;\n  }\n\n  \/* find the start of the vote answer *\/\n\n  std::string answer;\n  std::string voteCmd = &message[5];\n\n  unsigned int startPos = voteCmd.find_first_not_of(\" \\t\");\n  if (startPos != std::string::npos) {\n    unsigned int endPos = voteCmd.find_first_of(\" \\t\", startPos);\n    if (endPos == std::string::npos)\n      endPos = voteCmd.length();\n    answer = voteCmd.substr(startPos, endPos-startPos);\n  }\n\n  \/* XXX answer arrays should be static const but it'll do for now *\/\n  static const unsigned int yesCount = 8;\n  char yesAnswers[8][5];\n  sprintf(yesAnswers[0], \"y\");\n  sprintf(yesAnswers[1], \"1\");\n  sprintf(yesAnswers[2], \"yes\");\n  sprintf(yesAnswers[3], \"yea\");\n  sprintf(yesAnswers[4], \"si\");\n  sprintf(yesAnswers[5], \"ja\");\n  sprintf(yesAnswers[6], \"oui\");\n  sprintf(yesAnswers[7], \"sim\");\n\n  static const unsigned int noCount = 7;\n  char noAnswers[7][5];\n  sprintf(noAnswers[0], \"n\");\n  sprintf(noAnswers[1], \"0\");\n  sprintf(noAnswers[2], \"no\");\n  sprintf(noAnswers[3], \"nay\");\n  sprintf(noAnswers[4], \"nein\");\n  sprintf(noAnswers[5], \"non\");\n  sprintf(noAnswers[6], \"nao\");\n\n  \/\/ see if the vote response is a valid yes or no answer\n  int vote=-1;\n  for (unsigned int v = 0; v < (noCount > yesCount ? noCount : yesCount); v++) {\n      if (v < yesCount) {\n\tif (answer == yesAnswers[v]) {\n\t  vote = 1;\n\t  break;\n\t}\n      }\n      if (v < noCount) {\n\tif (answer == noAnswers[v]) {\n\t  vote = 0;\n\t  break;\n\t}\n      }\n  }\n\n  \/\/ cast the vote or complain\n  bool cast = false;\n  if (vote == 0) {\n      if ((cast = arbiter->voteNo(player[t].callSign)) == true) {\n\t\/* player voted no *\/\n\tsprintf(reply,\"%s, your vote in opposition of the %s has been recorded\", player[t].callSign, arbiter->getPollAction().c_str());\n\tsendMessage(ServerPlayer, t, reply, true);\n      }\n  } else if (vote == 1) {\n      if ((cast = arbiter->voteYes(player[t].callSign)) == true) {\n\t\/* player voted yes *\/\n\tsprintf(reply,\"%s, your vote in favor of the %s has been recorded\", player[t].callSign, arbiter->getPollAction().c_str());\n\tsendMessage(ServerPlayer, t, reply, true);\n      }\n  } else {\n      if (answer.length() == 0) {\n\tsprintf(reply,\"%s, you did not provide a vote answer\", player[t].callSign);\n\tsendMessage(ServerPlayer, t, reply, true);\n\tsprintf(reply,\"Usage: \/vote yes|no|y|n|1|0|yea|nay|si|ja|nein|oui|non|sim|nao\");\n\tsendMessage(ServerPlayer, t, reply, true);\n      } else {\n\tsprintf(reply,\"%s, you did not vote in favor or in opposition\", player[t].callSign);\n\tsendMessage(ServerPlayer, t, reply, true);\n\tsprintf(reply,\"Usage: \/vote yes|no|y|n|1|0|yea|nay|si|ja|nein|oui|non|sim|nao\");\n\tsendMessage(ServerPlayer, t, reply, true);\n      }\n      return;\n  }\n\n  if (!cast) {\n      \/* player was unable to cast their vote; probably already voted *\/\n      sprintf(reply,\"%s, you have already voted on the poll to %s %s\", player[t].callSign, arbiter->getPollAction().c_str(), arbiter->getPollPlayer().c_str());\n      sendMessage(ServerPlayer, t, reply, true);\n      return;\n  }\n}\n\nvoid handleVetoCmd(int t, const char * \/*message*\/)\n{\n    char reply[MessageLen];\n    if (!hasPerm(t, PlayerAccessInfo::veto)) {\n      \/* permission denied for \/veto *\/\n      sprintf(reply,\"%s, you are presently not authorized to run \/veto\", player[t].callSign);\n      sendMessage(ServerPlayer, t, reply, true);\n      return;\n    }\n\n    \/* make sure that there is a poll arbiter *\/\n    if (BZDB->isEmpty(\"poll\")) {\n      sprintf(reply, \"ERROR: the poll arbiter has disappeared (this should never happen)\");\n      sendMessage(ServerPlayer, t, reply, true);\n      return;\n    }\n\n    VotingArbiter *arbiter = (VotingArbiter *)BZDB->getPointer(\"poll\");\n\n    \/* make sure there is an unexpired poll *\/\n    if (!arbiter->knowsPoll()) {\n      sprintf(reply, \"%s, there is presently no active poll to veto\", player[t].callSign);\n      sendMessage(ServerPlayer, t, reply, true);\n      return;\n    }\n\n    \/* poof *\/\n    arbiter->forgetPoll();\n\n    sprintf(reply,\"%s, you have cancelled the poll to %s %s\", player[t].callSign, arbiter->getPollAction().c_str(), arbiter->getPollPlayer().c_str());\n    sendMessage(ServerPlayer, t, reply, true);\n\n    sprintf(reply,\"The poll was cancelled by %s\", player[t].callSign);\n    sendMessage(ServerPlayer, AllPlayers, reply, true);\n\n}\n\n\n\n\/\/ ex: shiftwidth=2 tabstop=8\n<commit_msg>whitespace<commit_after>\/* bzflag\n * Copyright (c) 1993 - 2003 Tim Riker\n *\n * This package is free software;  you can redistribute it and\/or\n * modify it under the terms of the license found in the file\n * named 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#ifdef _WIN32\n#pragma warning( 4:4786)\n#endif\n\n\/\/ interface header\n#include \"commands.h\"\n\n\/\/ implementation-specific system headers\n#include <string>\n#include <cstdio>\n#include <cstring>\n\n\/\/ implementation-specific bzflag headers\n#include \"global.h\"\n#include \"Address.h\"\n\n\/\/ implementation-specific bzfs-specific headers\n#include \"VotingArbiter.h\"\n#include \"Permissions.h\"\n#include \"CmdLineOptions.h\"\n#include \"PlayerInfo.h\"\n\n\/\/ FIXME -- need to pull communication out of bzfs.cxx...\nextern void sendMessage(int playerIndex, PlayerId targetPlayer, const char *message, bool fullBuffer);\nextern bool hasPerm(int playerIndex, PlayerAccessInfo::AccessPerm right);\nextern PlayerInfo *player;\nextern CmdLineOptions *clOptions;\nextern uint16_t curMaxPlayers;\nextern int NotConnected;\n\n\nvoid handlePollCmd(int t, const char *message)\n{\n  char reply[MessageLen];\n  \n  \/* make sure player has permission to request a poll *\/\n  if (!hasPerm(t, PlayerAccessInfo::poll)) {\n    sprintf(reply,\"%s, you are presently not authorized to run \/poll\", player[t].callSign);\n    sendMessage(ServerPlayer, t, reply, true);\n    return;\n  }\n  \n  \/* make sure that there is a poll arbiter *\/\n  if (BZDB->isEmpty(\"poll\")) {\n    sprintf(reply, \"ERROR: the poll arbiter has disappeared (this should never happen)\");\n    sendMessage(ServerPlayer, t, reply, true);\n    return;\n  }\n  \n  \/\/ only need to do this once\n  static VotingArbiter *arbiter = (VotingArbiter *)BZDB->getPointer(\"poll\");\n\n  \/* make sure that there is not a poll active already *\/\n  if (arbiter->knowsPoll()) {\n    sprintf(reply,\"A poll to %s %s is presently in progress\", arbiter->getPollAction().c_str(), arbiter->getPollPlayer().c_str());\n    sendMessage(ServerPlayer, t, reply, true);\n    sprintf(reply,\"Unable to start a new poll until the current one is over\");\n    sendMessage(ServerPlayer, t, reply, true);\n    return;\n  }\n  \n  \/\/ get available voter count\n  unsigned short int available = 0;\n  for (int i=0; i < curMaxPlayers; i++) {\n    \/\/ anyone on the server (even observers) are eligible to vote\n    if (player[i].fd != NotConnected) {\n      available++;\n    }\n  }\n  \n  \/\/ make sure there are enough players to even make a poll (don't count the pollee)\n  if (available - 1 < clOptions->votesRequired) {\n    sprintf(reply,\"Unable to initiate a new poll.  There are not enough players.\");\n    sendMessage(ServerPlayer, t, reply, true);\n    sprintf(reply,\"There needs to be at least %d other %s and only %d %s available.\",\n\t    clOptions->votesRequired,\n\t    clOptions->votesRequired - 1 == 1 ? \"player\" : \"players\",\n\t    available - 1,\n\t    available - 1 == 1 ? \"is\" : \"are\");\n    sendMessage(ServerPlayer, t, reply, true);\n    return;\n  }\n  \n  std::string pollCmd = &message[5];\n  std::string cmd;\n  std::string nick;\n  \n  unsigned int endPos;\n  unsigned int startPos = pollCmd.find_first_not_of(\" \\t\");\n  if (startPos != std::string::npos) {\n    endPos = pollCmd.find_first_of(\" \\t\", startPos);\n    if (endPos == std::string::npos)\n      endPos = pollCmd.length();\n    \n    cmd = pollCmd.substr(startPos,endPos-startPos);\n    pollCmd = pollCmd.substr(endPos);\n  }\n  else {\n    sprintf(reply,\"Invalid poll syntax: \/poll (kick|ban|vote|veto) playername\");\n    sendMessage(ServerPlayer, t, reply, true);\n    return;\n  }\n  \n  if ((cmd == \"ban\") || (cmd == \"kick\")) {\n    \n    startPos = pollCmd.find_first_not_of(\" \\t\");\n    if (startPos != std::string::npos) {\n      std::string votePlayer = pollCmd.substr(startPos);\n      if (votePlayer.length() == 0) {\n\tsprintf(reply,\"%s, no player was specified for the %s vote\", player[t].callSign, cmd.c_str());\n\tsendMessage(ServerPlayer, t, reply, true);\n\tsprintf(reply,\"Usage: \/poll %s [playername]\", cmd.c_str());\n\tsendMessage(ServerPlayer, t, reply, true);\n\treturn;\n      }\n      \n      \/* make sure the requested player is actually here *\/\n      bool foundPlayer=false;\n      std::string playerIP = \"\";\n      for (int v = 0; v < curMaxPlayers; v++) {\n\tif (votePlayer == player[v].callSign) {\n\t  playerIP = player[v].peer.getDotNotation().c_str();\n\t  foundPlayer=true;\n\t  break;\n\t}\n      }\n      \n      if (!foundPlayer) {\n\t\/* wrong name? *\/\n\tsprintf(reply, \"The player specified for a %s vote is not here\", cmd.c_str());\n\tsendMessage(ServerPlayer, t, reply, true);\n\tsprintf(reply,\"Usage: \/poll %s [playername]\", cmd.c_str());\n\tsendMessage(ServerPlayer, t, reply, true);\n\treturn;\n      }\n      \n      \/* create and announce the new poll *\/\n      if (cmd == \"ban\") {\n\tif (arbiter->pollToBan(votePlayer.c_str(), player[t].callSign, playerIP) == false) {\n\t  sprintf(reply,\"You are not able to request a ban poll right now, %s\", player[t].callSign);\n\t  sendMessage(ServerPlayer, t, reply, true);\n\t} else {\n\t  sprintf(reply,\"A poll to temporarily ban %s has been requested by %s\", votePlayer.c_str(), player[t].callSign);\n\t  sendMessage(ServerPlayer, AllPlayers, reply, true);\n\t}\n      } else {\n\tif (arbiter->pollToKick(votePlayer.c_str(), player[t].callSign) == false) {\n\t  sprintf(reply,\"You are not able to request a kick poll right now, %s\", player[t].callSign);\n\t  sendMessage(ServerPlayer, t, reply, true);\n\t} else {\n\t  sprintf(reply,\"A poll to %s %s has been requested by %s\", cmd.c_str(), votePlayer.c_str(), player[t].callSign);\n\t  sendMessage(ServerPlayer, AllPlayers, reply, true);\n\t}\n      }\n      \n      \/\/ set the number of available voters\n      arbiter->setAvailableVoters(available);\n      \n      \/\/ keep track of who is allowed to vote\n      for (int j=0; j < curMaxPlayers; j++) {\n\t\/\/ anyone on the server (even observers) are eligible to vote\n\tif (player[j].fd != NotConnected) {\n\t  arbiter->grantSuffrage(player[j].callSign);\n\t}\n      }\n      \n      \/\/ automatically place a vote for the player requesting the poll\n      arbiter->voteYes(player[t].callSign);\n    }\n    else {\n      sprintf(reply,\"Invalid poll syntax: \/poll %s playername\", cmd.c_str());\n      sendMessage(ServerPlayer, t, reply, true);\n      return;\n    }\n  } else if (cmd == \"vote\") {\n    \n    if (!hasPerm(t, PlayerAccessInfo::vote)) {\n      sprintf(reply,\"%s, you do not presently have permission to vote (must \/identify first)\", player[t].callSign);\n      sendMessage(ServerPlayer, t, reply, true);\n      return;\n    }\n    \n    \/* !!! needs to be handled by the \/vote command  *\/\n    sprintf(reply,\"%s, your vote has been recorded -- unimplemented\", player[t].callSign);\n    sendMessage(ServerPlayer, t, reply, true);\n    \n    \n  } else if (cmd == \"veto\") {\n    \n    if (!hasPerm(t, PlayerAccessInfo::veto)) {\n      sprintf(reply,\"%s, you do not have permission to veto the poll\", player[t].callSign);\n      sendMessage(ServerPlayer, t, reply, true);\n    }\n    \n    \/* !!! needs to be handled by the \/veto command  *\/\n    sprintf(reply,\"%s, you have aborted the poll -- unimplemented\", player[t].callSign);\n    sendMessage(ServerPlayer, t, reply, true);\n    \n    \n  } else {\n    \n    sprintf(reply,\"Invalid option to the poll command\");\n    sendMessage(ServerPlayer, t, reply, true);\n    sprintf(reply,\"Usage: \/poll ban|kick [playername]\");\n    sendMessage(ServerPlayer, t, reply, true);\n  } \/* end handling of poll subcommands *\/\n  \n  return;\n}\n\n\nvoid handleVoteCmd(int t, const char *message)\n{\n  char reply[MessageLen];\n\n  if (!hasPerm(t, PlayerAccessInfo::vote)) {\n    \/* permission denied for \/vote *\/\n    sprintf(reply,\"%s, you are presently not authorized to run \/vote\", player[t].callSign);\n    sendMessage(ServerPlayer, t, reply, true);\n    return;\n  }\n\n  \/* make sure that there is a poll arbiter *\/\n  if (BZDB->isEmpty(\"poll\")) {\n    sprintf(reply, \"ERROR: the poll arbiter has disappeared (this should never happen)\");\n    sendMessage(ServerPlayer, t, reply, true);\n    return;\n  }\n\n  \/\/ only need to get this once\n  static VotingArbiter *arbiter = (VotingArbiter *)BZDB->getPointer(\"poll\");\n\n  \/* make sure that there is a poll to vote upon *\/\n  if ((arbiter != NULL) && !arbiter->knowsPoll()) {\n    sprintf(reply,\"A poll is not presently in progress.  There is nothing to vote on\");\n    sendMessage(ServerPlayer, t, reply, true);\n    return;\n  }\n  \n  \/* find the start of the vote answer *\/\n  \n  std::string answer;\n  std::string voteCmd = &message[5];\n  \n  unsigned int startPos = voteCmd.find_first_not_of(\" \\t\");\n  if (startPos != std::string::npos) {\n    unsigned int endPos = voteCmd.find_first_of(\" \\t\", startPos);\n    if (endPos == std::string::npos)\n      endPos = voteCmd.length();\n    answer = voteCmd.substr(startPos, endPos-startPos);\n  }\n\n  \/* XXX answer arrays should be static const but it'll do for now *\/\n  static const unsigned int yesCount = 8;\n  char yesAnswers[8][5];\n  sprintf(yesAnswers[0], \"y\");\n  sprintf(yesAnswers[1], \"1\");\n  sprintf(yesAnswers[2], \"yes\");\n  sprintf(yesAnswers[3], \"yea\");\n  sprintf(yesAnswers[4], \"si\");\n  sprintf(yesAnswers[5], \"ja\");\n  sprintf(yesAnswers[6], \"oui\");\n  sprintf(yesAnswers[7], \"sim\");\n\n  static const unsigned int noCount = 7;\n  char noAnswers[7][5];\n  sprintf(noAnswers[0], \"n\");\n  sprintf(noAnswers[1], \"0\");\n  sprintf(noAnswers[2], \"no\");\n  sprintf(noAnswers[3], \"nay\");\n  sprintf(noAnswers[4], \"nein\");\n  sprintf(noAnswers[5], \"non\");\n  sprintf(noAnswers[6], \"nao\");\n\n  \/\/ see if the vote response is a valid yes or no answer\n  int vote=-1;\n  for (unsigned int v = 0; v < (noCount > yesCount ? noCount : yesCount); v++) {\n    if (v < yesCount) {\n      if (answer == yesAnswers[v]) {\n\tvote = 1;\n\tbreak;\n      }\n    }\n    if (v < noCount) {\n      if (answer == noAnswers[v]) {\n\tvote = 0;\n\tbreak;\n      }\n    }\n  }\n\n  \/\/ cast the vote or complain\n  bool cast = false;\n  if (vote == 0) {\n    if ((cast = arbiter->voteNo(player[t].callSign)) == true) {\n      \/* player voted no *\/\n      sprintf(reply,\"%s, your vote in opposition of the %s has been recorded\", player[t].callSign, arbiter->getPollAction().c_str());\n      sendMessage(ServerPlayer, t, reply, true);\n    }\n  } else if (vote == 1) {\n    if ((cast = arbiter->voteYes(player[t].callSign)) == true) {\n      \/* player voted yes *\/\n      sprintf(reply,\"%s, your vote in favor of the %s has been recorded\", player[t].callSign, arbiter->getPollAction().c_str());\n      sendMessage(ServerPlayer, t, reply, true);\n    }\n  } else {\n    if (answer.length() == 0) {\n      sprintf(reply,\"%s, you did not provide a vote answer\", player[t].callSign);\n      sendMessage(ServerPlayer, t, reply, true);\n      sprintf(reply,\"Usage: \/vote yes|no|y|n|1|0|yea|nay|si|ja|nein|oui|non|sim|nao\");\n      sendMessage(ServerPlayer, t, reply, true);\n    } else {\n      sprintf(reply,\"%s, you did not vote in favor or in opposition\", player[t].callSign);\n      sendMessage(ServerPlayer, t, reply, true);\n      sprintf(reply,\"Usage: \/vote yes|no|y|n|1|0|yea|nay|si|ja|nein|oui|non|sim|nao\");\n      sendMessage(ServerPlayer, t, reply, true);\n    }\n    return;\n  }\n  \n  if (!cast) {\n    \/* player was unable to cast their vote; probably already voted *\/\n    sprintf(reply,\"%s, you have already voted on the poll to %s %s\", player[t].callSign, arbiter->getPollAction().c_str(), arbiter->getPollPlayer().c_str());\n    sendMessage(ServerPlayer, t, reply, true);\n    return;\n  }\n\n  return;\n}\n\n\nvoid handleVetoCmd(int t, const char * \/*message*\/)\n{\n  char reply[MessageLen];\n  if (!hasPerm(t, PlayerAccessInfo::veto)) {\n    \/* permission denied for \/veto *\/\n    sprintf(reply,\"%s, you are presently not authorized to run \/veto\", player[t].callSign);\n    sendMessage(ServerPlayer, t, reply, true);\n    return;\n  }\n  \n  \/* make sure that there is a poll arbiter *\/\n  if (BZDB->isEmpty(\"poll\")) {\n    sprintf(reply, \"ERROR: the poll arbiter has disappeared (this should never happen)\");\n    sendMessage(ServerPlayer, t, reply, true);\n    return;\n  }\n  \n  \/\/ only need to do this once\n  static VotingArbiter *arbiter = (VotingArbiter *)BZDB->getPointer(\"poll\");\n  \n  \/* make sure there is an unexpired poll *\/\n  if ((arbiter != NULL) && !arbiter->knowsPoll()) {\n    sprintf(reply, \"%s, there is presently no active poll to veto\", player[t].callSign);\n    sendMessage(ServerPlayer, t, reply, true);\n    return;\n  }\n  \n  \/* poof *\/\n  arbiter->forgetPoll();\n  \n  sprintf(reply,\"%s, you have cancelled the poll to %s %s\", player[t].callSign, arbiter->getPollAction().c_str(), arbiter->getPollPlayer().c_str());\n  sendMessage(ServerPlayer, t, reply, true);\n  \n  sprintf(reply,\"The poll was cancelled by %s\", player[t].callSign);\n  sendMessage(ServerPlayer, AllPlayers, reply, true);\n \n  return;\n}\n\n\n\n\/\/ ex: shiftwidth=2 tabstop=8\n<|endoftext|>"}
{"text":"<commit_before>\n#include <cmath>\n#include <chrono>\n#include <vector>\n#include <iostream>\n\n#include <caf\/all.hpp>\n#include <caf\/config.hpp>\n\n#include <caf\/io\/all.hpp>\n#include <caf\/io\/uri.hpp>\n#include <caf\/io\/middleman.hpp>\n\nusing namespace std;\nusing namespace caf;\nusing namespace std::chrono;\n\nnamespace {\n\nusing next_atom = atom_constant<atom(\"next\")>;\nusing tcp_atom = atom_constant<atom(\"tcp\")>;\nusing udp_atom = atom_constant<atom(\"udp\")>;\n\nusing clk = std::chrono::high_resolution_clock;\nusing tp = std::chrono::time_point<clk>;\n\nclass config : public actor_system_config {\npublic:\n  \/\/ client\n  std::string host = \"127.0.0.1\";\n  std::string protocol = \"udp\";\n  uint16_t port = 4321;\n  std::string uri_str;\n  size_t num = 6;\n  \/\/ server\n  size_t interval = 100;\n  bool server_mode = false;\n  uint16_t tcp = 1234;\n  uint16_t udp = 4321;\n\n  config() {\n    opt_group{custom_options_, \"client\"}\n    .add(protocol, \"protocol,P\", \"set transport protocol (udp)\")\n    .add(port, \"port,p\", \"set port (4321)\")\n    .add(host, \"host,H\", \"set host (127.0.0.1)\")\n    .add(uri_str, \"uri,U\", \"set uri (ignores host, port, protocol if set)\")\n    .add(interval, \"interval,i\", \"set interval between messages in ms (100)\")\n    .add(num, \"num,n\", \"sends 10^n messages (10^6)\");\n    opt_group{custom_options_, \"server\"}\n    .add(server_mode, \"server-mode,s\", \"enable server mode\")\n    .add(tcp, \"tcp,t\", \"set TCP port (1234)\")\n    .add(udp, \"udp,u\", \"set UDP port (4321)\");\n  }\n};\n\nsize_t handle(event_based_actor* self, atom_value atm, size_t val) {\n  if (val == 0) {\n    aout(self) << \"[\" << to_string(atm) << \"] From zero ...\" << std::endl;\n  } else if (val % 1000 == 0) {\n    aout(self) << \"[\" << to_string(atm) << \"] Incrementing \" << val\n               << \".\" << std::endl;\n  }\n  return val + 1;\n}\n\nbehavior server(event_based_actor* self) {\n  return {\n    [=](tcp_atom atm, size_t i) -> size_t {\n      return handle(self, atm, i);\n    },\n    [=](udp_atom atm, size_t i) -> size_t {\n      return handle(self, atm, i);\n    }\n  };\n}\n\nbehavior client(event_based_actor* self, const actor& other,\n                size_t limit, size_t interval, atom_value atm) {\n  return {\n    [=](next_atom, size_t i) {\n      self->send(other, atm, i);\n    },\n    [=](size_t i) {\n      if (i >= limit) {\n        std::cerr << \"DONE\" << std::endl;\n        self->quit();\n      } else {\n        self->delayed_send(self, milliseconds(interval), next_atom::value, i);\n      }\n    },\n    after(chrono::milliseconds(5 * interval)) >> [=] {\n      std::cerr << \"RESTARTING\" << std::endl;\n      self->send(self, next_atom::value, size_t(0));\n    }\n  };\n}\n\nvoid caf_main(actor_system& system, const config& cfg) {\n  if (cfg.server_mode) {\n    cout << \"Running in server mode.\" << endl;\n    auto tcp_addr = \"tcp:\/\/0.0.0.0:\" + to_string(cfg.tcp);\n    auto udp_addr = \"udp:\/\/0.0.0.0:\" + to_string(cfg.udp);\n    auto tcp_uri = io::uri::make(tcp_addr);\n    auto udp_uri = io::uri::make(udp_addr);\n    if (!tcp_uri) {\n      std::cerr << \"Invalid uri: '\" << tcp_addr << \"'.\" << endl;\n      return;\n    }\n    if (!udp_uri) {\n      std::cerr << \"Invalid uri: '\" << udp_addr << \"'.\" << endl;\n      return;\n    }\n    auto srvr = system.spawn(server);\n    auto port = system.middleman().publish(srvr, *tcp_uri);\n    std::cout << \"Open on TCP port \" << port << \".\" << std::endl;\n    port = system.middleman().publish(srvr, *udp_uri);\n    std::cout << \"Open on UDP port \" << port << \".\" << std::endl;\n    system.await_all_actors_done();\n  } else {\n    auto addr = cfg.uri_str.empty()\n                ? cfg.protocol + \":\/\/\" + cfg.host + \":\" + to_string(cfg.port)\n                : cfg.uri_str;\n    std:: cout << \"Contacting server on '\" << addr << \"'.\" << std::endl;\n    auto u = io::uri::make(addr);\n    if (!u) {\n      std::cerr << \"Invalid uri: '\" << addr << \"'.\" << endl;\n      return;\n    }\n    auto srvr = system.middleman().remote_actor(*u);\n    if (!srvr) {\n      std::cerr << \"Failed to contact server on '\" << addr << \"'.\" << std::endl;\n      return;\n    }\n    auto atm = atom_from_string(caf::io::to_string(u->scheme()));\n    auto clnt = system.spawn(client, *srvr, pow(10, cfg.num), cfg.interval, atm);\n    anon_send(clnt, next_atom::value, size_t(0));\n    system.await_all_actors_done();\n  }\n}\n\n} \/\/ namespace anonymous\n\nCAF_MAIN(io::middleman)\n<commit_msg>Change timeout behavior<commit_after>\n#include <cmath>\n#include <chrono>\n#include <vector>\n#include <iostream>\n\n#include <caf\/all.hpp>\n#include <caf\/config.hpp>\n\n#include <caf\/io\/all.hpp>\n#include <caf\/io\/uri.hpp>\n#include <caf\/io\/middleman.hpp>\n\nusing namespace std;\nusing namespace caf;\nusing namespace std::chrono;\n\nnamespace {\n\nusing next_atom = atom_constant<atom(\"next\")>;\nusing tcp_atom = atom_constant<atom(\"tcp\")>;\nusing udp_atom = atom_constant<atom(\"udp\")>;\n\nusing clk = std::chrono::high_resolution_clock;\nusing tp = std::chrono::time_point<clk>;\n\nclass config : public actor_system_config {\npublic:\n  \/\/ client\n  std::string host = \"127.0.0.1\";\n  std::string protocol = \"udp\";\n  uint16_t port = 4321;\n  std::string uri_str;\n  size_t num = 6;\n  \/\/ server\n  size_t interval = 100;\n  bool server_mode = false;\n  uint16_t tcp = 1234;\n  uint16_t udp = 4321;\n\n  config() {\n    opt_group{custom_options_, \"client\"}\n    .add(protocol, \"protocol,P\", \"set transport protocol (udp)\")\n    .add(port, \"port,p\", \"set port (4321)\")\n    .add(host, \"host,H\", \"set host (127.0.0.1)\")\n    .add(uri_str, \"uri,U\", \"set uri (ignores host, port, protocol if set)\")\n    .add(interval, \"interval,i\", \"set interval between messages in ms (100)\")\n    .add(num, \"num,n\", \"sends 10^n messages (10^6)\");\n    opt_group{custom_options_, \"server\"}\n    .add(server_mode, \"server-mode,s\", \"enable server mode\")\n    .add(tcp, \"tcp,t\", \"set TCP port (1234)\")\n    .add(udp, \"udp,u\", \"set UDP port (4321)\");\n  }\n};\n\nsize_t handle(event_based_actor* self, atom_value atm, size_t val) {\n  if (val == 0) {\n    aout(self) << \"[\" << to_string(atm) << \"] From zero ...\" << std::endl;\n  } else if (val % 1000 == 0) {\n    aout(self) << \"[\" << to_string(atm) << \"] Incrementing \" << val\n               << \".\" << std::endl;\n  }\n  return val + 1;\n}\n\nbehavior server(event_based_actor* self) {\n  return {\n    [=](tcp_atom atm, size_t i) -> size_t {\n      return handle(self, atm, i);\n    },\n    [=](udp_atom atm, size_t i) -> size_t {\n      return handle(self, atm, i);\n    }\n  };\n}\n\nbehavior client(event_based_actor* self, const actor& other,\n                size_t limit, size_t interval, atom_value atm) {\n  return {\n    [=](next_atom, size_t i) {\n      self->send(other, atm, i);\n    },\n    [=](size_t i) {\n      if (i >= limit) {\n        std::cerr << \"DONE\" << std::endl;\n        self->quit();\n      } else {\n        \/\/self->delayed_send(self, milliseconds(interval), next_atom::value, i);\n        self->send(self, next_atom::value, i);\n      }\n    },\n    after(chrono::milliseconds(50 * interval)) >> [=] {\n      std::cerr << \"RESTARTING\" << std::endl;\n      self->send(self, next_atom::value, size_t(0));\n    }\n  };\n}\n\nvoid caf_main(actor_system& system, const config& cfg) {\n  if (cfg.server_mode) {\n    cout << \"Running in server mode.\" << endl;\n    auto tcp_addr = \"tcp:\/\/0.0.0.0:\" + to_string(cfg.tcp);\n    auto udp_addr = \"udp:\/\/0.0.0.0:\" + to_string(cfg.udp);\n    auto tcp_uri = io::uri::make(tcp_addr);\n    auto udp_uri = io::uri::make(udp_addr);\n    if (!tcp_uri) {\n      std::cerr << \"Invalid uri: '\" << tcp_addr << \"'.\" << endl;\n      return;\n    }\n    if (!udp_uri) {\n      std::cerr << \"Invalid uri: '\" << udp_addr << \"'.\" << endl;\n      return;\n    }\n    auto srvr = system.spawn(server);\n    auto port = system.middleman().publish(srvr, *tcp_uri);\n    std::cout << \"Open on TCP port \" << port << \".\" << std::endl;\n    port = system.middleman().publish(srvr, *udp_uri);\n    std::cout << \"Open on UDP port \" << port << \".\" << std::endl;\n    system.await_all_actors_done();\n  } else {\n    auto addr = cfg.uri_str.empty()\n                ? cfg.protocol + \":\/\/\" + cfg.host + \":\" + to_string(cfg.port)\n                : cfg.uri_str;\n    std:: cout << \"Contacting server on '\" << addr << \"'.\" << std::endl;\n    auto u = io::uri::make(addr);\n    if (!u) {\n      std::cerr << \"Invalid uri: '\" << addr << \"'.\" << endl;\n      return;\n    }\n    auto srvr = system.middleman().remote_actor(*u);\n    if (!srvr) {\n      std::cerr << \"Failed to contact server on '\" << addr << \"'.\" << std::endl;\n      return;\n    }\n    auto atm = atom_from_string(caf::io::to_string(u->scheme()));\n    auto clnt = system.spawn(client, *srvr, pow(10, cfg.num), cfg.interval, atm);\n    anon_send(clnt, next_atom::value, size_t(0));\n    system.await_all_actors_done();\n  }\n}\n\n} \/\/ namespace anonymous\n\nCAF_MAIN(io::middleman)\n<|endoftext|>"}
{"text":"<commit_before>#ifndef CAN_EMULATOR\n\n#include \"usbutil.h\"\n#include \"canread.h\"\n#include \"serialutil.h\"\n#include \"signals.h\"\n#include \"log.h\"\n#include \"cJSON.h\"\n#include \"listener.h\"\n#include <stdint.h>\n#include <stdlib.h>\n\nextern SerialDevice SERIAL_DEVICE;\nextern UsbDevice USB_DEVICE;\nextern Listener listener;\n\n\/* Forward declarations *\/\n\nvoid receiveCan(CanBus*);\nvoid initializeAllCan();\nbool receiveWriteRequest(uint8_t*);\n\nvoid setup() {\n    initializeLogging();\n#ifndef NO_UART\n    initializeSerial(&SERIAL_DEVICE);\n#endif\n    initializeUsb(&USB_DEVICE);\n    initializeAllCan();\n}\n\nvoid loop() {\n    for(int i = 0; i < getCanBusCount(); i++) {\n        receiveCan(&getCanBuses()[i]);\n    }\n    processListenerQueues(&listener);\n    readFromHost(&USB_DEVICE, &receiveWriteRequest);\n#ifndef NO_UART\n    readFromSerial(&SERIAL_DEVICE, &receiveWriteRequest);\n#endif\n    for(int i = 0; i < getCanBusCount(); i++) {\n        processCanWriteQueue(&getCanBuses()[i]);\n    }\n}\n\nvoid initializeAllCan() {\n    for(int i = 0; i < getCanBusCount(); i++) {\n        initializeCan(&(getCanBuses()[i]));\n    }\n}\n\nvoid receiveRawWriteRequest(cJSON* idObject, cJSON* root) {\n    uint32_t id = idObject->valueint;\n    cJSON* dataObject = cJSON_GetObjectItem(root, \"data\");\n    if(dataObject == NULL) {\n        debug(\"Raw write request missing data\\r\\n\", id);\n        return;\n    }\n\n    char* dataString = dataObject->valuestring;\n    char* end;\n    unsigned long long data = __builtin_bswap64(strtoull(dataString, &end, 16));\n    CanMessage message = {id, data};\n    QUEUE_PUSH(CanMessage, &getCanBuses()[0].sendQueue, message);\n}\n\n\/* The binary format handled by this function is as follows:\n *\n * A leading '{' followed by a 4 byte message ID, then a '|' separator and\n * finally 8 bytes of data and a trailing '}'. E.g.:\n *\n * {<4 byte ID>|<8 bytes of data>}\n *\/\nvoid receiveBinaryWriteRequest(uint8_t* message) {\n    const int BINARY_CAN_WRITE_PACKET_LENGTH = 15;\n    if(message[0] != '{' || message[5] != '|' || message[14] != '}') {\n        debug(\"Received a corrupted CAN message: \");\n        for(int i = 0; i <= BINARY_CAN_WRITE_PACKET_LENGTH; i++) {\n            debug(\"%02x \", message[i] );\n        }\n        debug(\"\\r\\n\");\n        return;\n    }\n\n    CanMessage outgoing = {0, 0};\n    memcpy((uint8_t*)&outgoing.id, &message[1], 4);\n    for(int i = 0; i < 8; i++) {\n        ((uint8_t*)&(outgoing.data))[i] = message[i + 6];\n    }\n    QUEUE_PUSH(CanMessage, &getCanBuses()[0].sendQueue, outgoing);\n}\n\nvoid receiveTranslatedWriteRequest(cJSON* nameObject, cJSON* root) {\n    char* name = nameObject->valuestring;\n    cJSON* value = cJSON_GetObjectItem(root, \"value\");\n    if(value == NULL) {\n        debug(\"Write request for %s missing value\\r\\n\", name);\n        return;\n    }\n\n    \/\/ Optional, may be null\n    cJSON* event = cJSON_GetObjectItem(root, \"event\");\n\n    CanSignal* signal = lookupSignal(name, getSignals(),\n            getSignalCount(), true);\n    CanCommand* command = lookupCommand(name, getCommands(), getCommandCount());\n    if(signal != NULL) {\n        sendCanSignal(signal, value, getSignals(), getSignalCount());\n    } else if(command != NULL) {\n        command->handler(name, value, event, getSignals(), getSignalCount());\n    } else {\n        debug(\"Writing not allowed for signal with name %s\\r\\n\", name);\n    }\n}\n\nbool receiveJsonWriteRequest(uint8_t* message) {\n    cJSON *root = cJSON_Parse((char*)message);\n    bool foundMessage = false;\n    if(root != NULL) {\n        foundMessage = true;\n        cJSON* nameObject = cJSON_GetObjectItem(root, \"name\");\n        if(nameObject == NULL) {\n            cJSON* idObject = cJSON_GetObjectItem(root, \"id\");\n            if(idObject == NULL) {\n                debug(\"Write request is malformed, \"\n                        \"missing name or id: %s\\r\\n\", message);\n            } else {\n                receiveRawWriteRequest(idObject, root);\n            }\n        } else {\n            receiveTranslatedWriteRequest(nameObject, root);\n        }\n        cJSON_Delete(root);\n    } else {\n        debug(\"Unable to parse JSON from \\\"%s\\\" -- if it's valid, \"\n                \"may be out of memory\\r\\n\", message);\n    }\n    return foundMessage;\n}\n\nbool receiveWriteRequest(uint8_t* message) {\n#ifdef TRANSMITTER\n    receiveBinaryWriteRequest(message);\n    return true;\n#else\n    return receiveJsonWriteRequest(message);\n#endif\n}\n\n\/*\n * Check to see if a packet has been received. If so, read the packet and print\n * the packet payload to the serial monitor.\n *\/\nvoid receiveCan(CanBus* bus) {\n    \/\/ TODO what happens if we process until the queue is empty?\n    if(!QUEUE_EMPTY(CanMessage, &bus->receiveQueue)) {\n        CanMessage message = QUEUE_POP(CanMessage, &bus->receiveQueue);\n        decodeCanMessage(message.id, message.data);\n    }\n}\n\nvoid reset() {\n    initializeAllCan();\n}\n\n#endif \/\/ CAN_EMULATOR\n<commit_msg>Clarify in log message that USB read may be incomplete when trying to parse.<commit_after>#ifndef CAN_EMULATOR\n\n#include \"usbutil.h\"\n#include \"canread.h\"\n#include \"serialutil.h\"\n#include \"signals.h\"\n#include \"log.h\"\n#include \"cJSON.h\"\n#include \"listener.h\"\n#include <stdint.h>\n#include <stdlib.h>\n\nextern SerialDevice SERIAL_DEVICE;\nextern UsbDevice USB_DEVICE;\nextern Listener listener;\n\n\/* Forward declarations *\/\n\nvoid receiveCan(CanBus*);\nvoid initializeAllCan();\nbool receiveWriteRequest(uint8_t*);\n\nvoid setup() {\n    initializeLogging();\n#ifndef NO_UART\n    initializeSerial(&SERIAL_DEVICE);\n#endif\n    initializeUsb(&USB_DEVICE);\n    initializeAllCan();\n}\n\nvoid loop() {\n    for(int i = 0; i < getCanBusCount(); i++) {\n        receiveCan(&getCanBuses()[i]);\n    }\n    processListenerQueues(&listener);\n    readFromHost(&USB_DEVICE, &receiveWriteRequest);\n#ifndef NO_UART\n    readFromSerial(&SERIAL_DEVICE, &receiveWriteRequest);\n#endif\n    for(int i = 0; i < getCanBusCount(); i++) {\n        processCanWriteQueue(&getCanBuses()[i]);\n    }\n}\n\nvoid initializeAllCan() {\n    for(int i = 0; i < getCanBusCount(); i++) {\n        initializeCan(&(getCanBuses()[i]));\n    }\n}\n\nvoid receiveRawWriteRequest(cJSON* idObject, cJSON* root) {\n    uint32_t id = idObject->valueint;\n    cJSON* dataObject = cJSON_GetObjectItem(root, \"data\");\n    if(dataObject == NULL) {\n        debug(\"Raw write request missing data\\r\\n\", id);\n        return;\n    }\n\n    char* dataString = dataObject->valuestring;\n    char* end;\n    unsigned long long data = __builtin_bswap64(strtoull(dataString, &end, 16));\n    CanMessage message = {id, data};\n    QUEUE_PUSH(CanMessage, &getCanBuses()[0].sendQueue, message);\n}\n\n\/* The binary format handled by this function is as follows:\n *\n * A leading '{' followed by a 4 byte message ID, then a '|' separator and\n * finally 8 bytes of data and a trailing '}'. E.g.:\n *\n * {<4 byte ID>|<8 bytes of data>}\n *\/\nvoid receiveBinaryWriteRequest(uint8_t* message) {\n    const int BINARY_CAN_WRITE_PACKET_LENGTH = 15;\n    if(message[0] != '{' || message[5] != '|' || message[14] != '}') {\n        debug(\"Received a corrupted CAN message: \");\n        for(int i = 0; i <= BINARY_CAN_WRITE_PACKET_LENGTH; i++) {\n            debug(\"%02x \", message[i] );\n        }\n        debug(\"\\r\\n\");\n        return;\n    }\n\n    CanMessage outgoing = {0, 0};\n    memcpy((uint8_t*)&outgoing.id, &message[1], 4);\n    for(int i = 0; i < 8; i++) {\n        ((uint8_t*)&(outgoing.data))[i] = message[i + 6];\n    }\n    QUEUE_PUSH(CanMessage, &getCanBuses()[0].sendQueue, outgoing);\n}\n\nvoid receiveTranslatedWriteRequest(cJSON* nameObject, cJSON* root) {\n    char* name = nameObject->valuestring;\n    cJSON* value = cJSON_GetObjectItem(root, \"value\");\n    if(value == NULL) {\n        debug(\"Write request for %s missing value\\r\\n\", name);\n        return;\n    }\n\n    \/\/ Optional, may be null\n    cJSON* event = cJSON_GetObjectItem(root, \"event\");\n\n    CanSignal* signal = lookupSignal(name, getSignals(),\n            getSignalCount(), true);\n    CanCommand* command = lookupCommand(name, getCommands(), getCommandCount());\n    if(signal != NULL) {\n        sendCanSignal(signal, value, getSignals(), getSignalCount());\n    } else if(command != NULL) {\n        command->handler(name, value, event, getSignals(), getSignalCount());\n    } else {\n        debug(\"Writing not allowed for signal with name %s\\r\\n\", name);\n    }\n}\n\nbool receiveJsonWriteRequest(uint8_t* message) {\n    cJSON *root = cJSON_Parse((char*)message);\n    bool foundMessage = false;\n    if(root != NULL) {\n        foundMessage = true;\n        cJSON* nameObject = cJSON_GetObjectItem(root, \"name\");\n        if(nameObject == NULL) {\n            cJSON* idObject = cJSON_GetObjectItem(root, \"id\");\n            if(idObject == NULL) {\n                debug(\"Write request is malformed, \"\n                        \"missing name or id: %s\\r\\n\", message);\n            } else {\n                receiveRawWriteRequest(idObject, root);\n            }\n        } else {\n            receiveTranslatedWriteRequest(nameObject, root);\n        }\n        cJSON_Delete(root);\n    } else {\n        debug(\"No valid JSON in incoming buffer yet -- \"\n                \"if it's valid, may be out of memory\\r\\n\");\n    }\n    return foundMessage;\n}\n\nbool receiveWriteRequest(uint8_t* message) {\n#ifdef TRANSMITTER\n    receiveBinaryWriteRequest(message);\n    return true;\n#else\n    return receiveJsonWriteRequest(message);\n#endif\n}\n\n\/*\n * Check to see if a packet has been received. If so, read the packet and print\n * the packet payload to the serial monitor.\n *\/\nvoid receiveCan(CanBus* bus) {\n    \/\/ TODO what happens if we process until the queue is empty?\n    if(!QUEUE_EMPTY(CanMessage, &bus->receiveQueue)) {\n        CanMessage message = QUEUE_POP(CanMessage, &bus->receiveQueue);\n        decodeCanMessage(message.id, message.data);\n    }\n}\n\nvoid reset() {\n    initializeAllCan();\n}\n\n#endif \/\/ CAN_EMULATOR\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n * The MIT License (MIT)\n *\n * Copyright (c) 2019-2022 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 <QFile>\n#include <QStandardPaths>\n#include \"Code\/QRDUtils.h\"\n#include \"QRDInterface.h\"\n\nstatic const QString glsl_stage4[arraydim<ShaderStage>()] = {\n    lit(\"vert\"), lit(\"tesc\"), lit(\"tese\"), lit(\"geom\"), lit(\"frag\"), lit(\"comp\"),\n};\n\nstatic const QString hlsl_stage2[arraydim<ShaderStage>()] = {\n    lit(\"vs\"), lit(\"hs\"), lit(\"ds\"), lit(\"gs\"), lit(\"ps\"), lit(\"cs\"),\n};\n\nstatic QString tmpPath(const QString &filename)\n{\n  return QDir(QDir::tempPath()).absoluteFilePath(filename);\n}\n\nstatic ShaderToolOutput RunTool(const ShaderProcessingTool &tool, QWidget *window,\n                                QString input_file, QString output_file, QStringList &argList)\n{\n  bool writesToFile = true;\n  bool readStdin = false;\n\n  int idx = argList.indexOf(lit(\"{stdin}\"));\n  if(idx >= 0)\n  {\n    argList.removeAt(idx);\n    readStdin = true;\n  }\n\n  if(output_file.isEmpty())\n  {\n    output_file = tmpPath(lit(\"shader_output\"));\n    writesToFile = false;\n  }\n\n  \/\/ ensure we don't have any leftover output files.\n  QFile::remove(output_file);\n\n  QString stdout_file = QDir(QDir::tempPath()).absoluteFilePath(lit(\"shader_stdout\"));\n\n  ShaderToolOutput ret;\n\n  if(tool.executable.isEmpty())\n  {\n    ret.log = QApplication::translate(\"ShaderProcessingTool\",\n                                      \"ERROR: No Executable specified in tool '%1'\")\n                  .arg(tool.name);\n\n    return ret;\n  }\n\n  QString path = tool.executable;\n\n  if(!QDir::isAbsolutePath(path))\n  {\n    path = QStandardPaths::findExecutable(path);\n\n    if(path.isEmpty())\n    {\n      ret.log = QApplication::translate(\"ShaderProcessingTool\",\n                                        \"ERROR: Couldn't find executable '%1' in path\")\n                    .arg(tool.executable);\n\n      return ret;\n    }\n  }\n\n  QByteArray stdout_data;\n  QProcess process;\n\n  QThread *mainThread = QThread::currentThread();\n\n  LambdaThread *thread = new LambdaThread([&]() {\n    if(readStdin)\n      process.setStandardInputFile(input_file);\n\n    if(!writesToFile)\n      process.setStandardOutputFile(output_file);\n    else\n      process.setStandardOutputFile(stdout_file);\n\n    \/\/ for now merge stdout\/stderr together. Maybe we should separate these and somehow annotate\n    \/\/ them? Merging is difficult without messing up order, and some tools output non-errors to\n    \/\/ stderr\n    process.setStandardErrorFile(stdout_file);\n\n    process.start(tool.executable, argList);\n    process.waitForFinished();\n\n    {\n      QFile outputHandle(output_file);\n      if(outputHandle.open(QFile::ReadOnly))\n      {\n        ret.result = outputHandle.readAll();\n        outputHandle.close();\n      }\n    }\n\n    {\n      QFile stdoutHandle(stdout_file);\n      if(stdoutHandle.open(QFile::ReadOnly))\n      {\n        stdout_data = stdoutHandle.readAll();\n        stdoutHandle.close();\n      }\n    }\n\n    \/\/ The input files typically aren't large and we don't generate unique names so they won't be\n    \/\/ overwritten.\n    \/\/ Leaving them alone means the user can try to recreate the tool invocation themselves.\n    \/\/ QFile::remove(input_file);\n    QFile::remove(output_file);\n    QFile::remove(stdout_file);\n\n    process.moveToThread(mainThread);\n  });\n\n  thread->setName(lit(\"ShaderProcessingTool %1\").arg(tool.name));\n  thread->moveObjectToThread(&process);\n\n  thread->start();\n\n  ShowProgressDialog(window, QApplication::translate(\"ShaderProcessingTool\",\n                                                     \"Please wait - running external tool\"),\n                     [thread]() { return !thread->isRunning(); });\n\n  thread->deleteLater();\n\n  QString processStatus;\n\n  if(process.exitStatus() == QProcess::CrashExit)\n  {\n    processStatus = QApplication::translate(\"ShaderProcessingTool\", \"Process crashed with code %1.\")\n                        .arg(process.exitCode());\n  }\n  else\n  {\n    processStatus = QApplication::translate(\"ShaderProcessingTool\", \"Process exited with code %1.\")\n                        .arg(process.exitCode());\n  }\n\n  ret.log = QApplication::translate(\"ShaderProcessingTool\",\n                                    \"Running \\\"%1\\\" %2\\n\"\n                                    \"%3\\n\"\n                                    \"%4\\n\"\n                                    \"Output file is %5 bytes\")\n                .arg(path)\n                .arg(argList.join(QLatin1Char(' ')))\n                .arg(QString::fromUtf8(stdout_data))\n                .arg(processStatus)\n                .arg(ret.result.count());\n\n  return ret;\n}\n\nShaderToolOutput ShaderProcessingTool::DisassembleShader(QWidget *window,\n                                                         const ShaderReflection *shaderDetails,\n                                                         rdcstr arguments) const\n{\n  QStringList argList = ParseArgsList(arguments.isEmpty() ? DefaultArguments() : arguments);\n  \/\/ always append IO arguments for known tools, so we read\/write to our own files and override any\n  \/\/ dangling output specified file in the embedded command line\n  argList.append(ParseArgsList(IOArguments()));\n\n  QString input_file, output_file;\n\n  input_file = tmpPath(lit(\"shader_input\"));\n\n  \/\/ replace arguments after expansion to avoid problems with quoting paths etc\n  for(QString &arg : argList)\n  {\n    if(arg == lit(\"{input_file}\"))\n      arg = input_file;\n    if(arg == lit(\"{output_file}\"))\n      arg = output_file = tmpPath(lit(\"shader_output\"));\n    if(arg == lit(\"{entry_point}\"))\n    {\n      arg = shaderDetails->entryPoint;\n      if(arg.isEmpty())\n        arg = lit(\"main\");\n    }\n\n    \/\/ allow substring matches from the left, to enable e.g. {hlsl_stage2}_6_0\n    if(arg.left(13) == lit(\"{glsl_stage4}\"))\n      arg.replace(0, 13, glsl_stage4[int(shaderDetails->stage)]);\n    if(arg.left(13) == lit(\"{hlsl_stage2}\"))\n      arg.replace(0, 13, hlsl_stage2[int(shaderDetails->stage)]);\n  }\n\n  QFile binHandle(input_file);\n  if(binHandle.open(QFile::WriteOnly | QIODevice::Truncate))\n  {\n    binHandle.write(\n        QByteArray((const char *)shaderDetails->rawBytes.data(), shaderDetails->rawBytes.count()));\n    binHandle.close();\n  }\n  else\n  {\n    ShaderToolOutput ret;\n\n    ret.log = QApplication::translate(\"ShaderProcessingTool\",\n                                      \"ERROR: Couldn't write input to temporary file '%1'\")\n                  .arg(input_file);\n\n    return ret;\n  }\n\n  return RunTool(*this, window, input_file, output_file, argList);\n}\n\nShaderToolOutput ShaderProcessingTool::CompileShader(QWidget *window, rdcstr source,\n                                                     rdcstr entryPoint, ShaderStage stage,\n                                                     rdcstr arguments) const\n{\n  QStringList argList = ParseArgsList(arguments.isEmpty() ? DefaultArguments() : arguments);\n  \/\/ always append IO arguments for known tools, so we read\/write to our own files and override any\n  \/\/ dangling output specified file in the embedded command line\n  argList.append(ParseArgsList(IOArguments()));\n\n  QString input_file, output_file;\n\n  input_file = tmpPath(lit(\"shader_input\"));\n\n  \/\/ replace arguments after expansion to avoid problems with quoting paths etc\n  for(QString &arg : argList)\n  {\n    if(arg == lit(\"{input_file}\"))\n      arg = input_file;\n    if(arg == lit(\"{output_file}\"))\n      arg = output_file = tmpPath(lit(\"shader_output\"));\n    if(arg == lit(\"{entry_point}\"))\n      arg = entryPoint;\n\n    \/\/ allow substring matches from the left, to enable e.g. {hlsl_stage2}_6_0\n    if(arg.left(13) == lit(\"{glsl_stage4}\"))\n      arg.replace(0, 13, glsl_stage4[int(stage)]);\n    if(arg.left(13) == lit(\"{hlsl_stage2}\"))\n      arg.replace(0, 13, hlsl_stage2[int(stage)]);\n  }\n\n  QFile binHandle(input_file);\n  if(binHandle.open(QFile::WriteOnly | QIODevice::Truncate))\n  {\n    binHandle.write(QByteArray((const char *)source.c_str(), source.count()));\n    binHandle.close();\n  }\n  else\n  {\n    ShaderToolOutput ret;\n\n    ret.log = QApplication::translate(\"ShaderProcessingTool\",\n                                      \"ERROR: Couldn't write input to temporary file '%1'\")\n                  .arg(input_file);\n\n    return ret;\n  }\n\n  return RunTool(*this, window, input_file, output_file, argList);\n}\n<commit_msg>Check for shader processing tool failures properly. Closes #2751<commit_after>\/******************************************************************************\n * The MIT License (MIT)\n *\n * Copyright (c) 2019-2022 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 <QFile>\n#include <QStandardPaths>\n#include \"Code\/QRDUtils.h\"\n#include \"QRDInterface.h\"\n\nstatic const QString glsl_stage4[arraydim<ShaderStage>()] = {\n    lit(\"vert\"), lit(\"tesc\"), lit(\"tese\"), lit(\"geom\"), lit(\"frag\"), lit(\"comp\"),\n};\n\nstatic const QString hlsl_stage2[arraydim<ShaderStage>()] = {\n    lit(\"vs\"), lit(\"hs\"), lit(\"ds\"), lit(\"gs\"), lit(\"ps\"), lit(\"cs\"),\n};\n\nstatic QString tmpPath(const QString &filename)\n{\n  return QDir(QDir::tempPath()).absoluteFilePath(filename);\n}\n\nstatic ShaderToolOutput RunTool(const ShaderProcessingTool &tool, QWidget *window,\n                                QString input_file, QString output_file, QStringList &argList)\n{\n  bool writesToFile = true;\n  bool readStdin = false;\n\n  int idx = argList.indexOf(lit(\"{stdin}\"));\n  if(idx >= 0)\n  {\n    argList.removeAt(idx);\n    readStdin = true;\n  }\n\n  if(output_file.isEmpty())\n  {\n    output_file = tmpPath(lit(\"shader_output\"));\n    writesToFile = false;\n  }\n\n  \/\/ ensure we don't have any leftover output files.\n  QFile::remove(output_file);\n\n  QString stdout_file = QDir(QDir::tempPath()).absoluteFilePath(lit(\"shader_stdout\"));\n\n  ShaderToolOutput ret;\n\n  if(tool.executable.isEmpty())\n  {\n    ret.log = QApplication::translate(\"ShaderProcessingTool\",\n                                      \"ERROR: No Executable specified in tool '%1'\")\n                  .arg(tool.name);\n\n    return ret;\n  }\n\n  QString path = tool.executable;\n\n  if(!QDir::isAbsolutePath(path))\n  {\n    path = QStandardPaths::findExecutable(path);\n\n    if(path.isEmpty())\n    {\n      ret.log = QApplication::translate(\"ShaderProcessingTool\",\n                                        \"ERROR: Couldn't find executable '%1' in path\")\n                    .arg(tool.executable);\n\n      return ret;\n    }\n  }\n\n  QByteArray stdout_data;\n  QProcess process;\n\n  QThread *mainThread = QThread::currentThread();\n\n  LambdaThread *thread = new LambdaThread([&]() {\n    if(readStdin)\n      process.setStandardInputFile(input_file);\n\n    if(!writesToFile)\n      process.setStandardOutputFile(output_file);\n    else\n      process.setStandardOutputFile(stdout_file);\n\n    \/\/ for now merge stdout\/stderr together. Maybe we should separate these and somehow annotate\n    \/\/ them? Merging is difficult without messing up order, and some tools output non-errors to\n    \/\/ stderr\n    process.setStandardErrorFile(stdout_file);\n\n    process.start(tool.executable, argList);\n    process.waitForFinished();\n\n    {\n      QFile outputHandle(output_file);\n      if(outputHandle.open(QFile::ReadOnly))\n      {\n        ret.result = outputHandle.readAll();\n        outputHandle.close();\n      }\n    }\n\n    {\n      QFile stdoutHandle(stdout_file);\n      if(stdoutHandle.open(QFile::ReadOnly))\n      {\n        stdout_data = stdoutHandle.readAll();\n        stdoutHandle.close();\n      }\n    }\n\n    \/\/ The input files typically aren't large and we don't generate unique names so they won't be\n    \/\/ overwritten.\n    \/\/ Leaving them alone means the user can try to recreate the tool invocation themselves.\n    \/\/ QFile::remove(input_file);\n    QFile::remove(output_file);\n    QFile::remove(stdout_file);\n\n    process.moveToThread(mainThread);\n  });\n\n  thread->setName(lit(\"ShaderProcessingTool %1\").arg(tool.name));\n  thread->moveObjectToThread(&process);\n\n  thread->start();\n\n  ShowProgressDialog(window, QApplication::translate(\"ShaderProcessingTool\",\n                                                     \"Please wait - running external tool\"),\n                     [thread]() { return !thread->isRunning(); });\n\n  thread->deleteLater();\n\n  QString processStatus;\n\n  QProcess::ProcessError error = process.error();\n\n  if(process.exitStatus() == QProcess::CrashExit)\n    error = QProcess::Crashed;\n\n  switch(error)\n  {\n    case QProcess::FailedToStart:\n    {\n      if(QDir::isAbsolutePath(tool.executable))\n      {\n        if(!QFile::exists(tool.executable))\n        {\n          processStatus =\n              QApplication::translate(\"ShaderProcessingTool\",\n                                      \"Process couldn't be started, \\\"%1\\\" does not exist.\")\n                  .arg(tool.executable);\n        }\n        else\n        {\n          processStatus = QApplication::translate(\n                              \"ShaderProcessingTool\",\n                              \"Process couldn't be started, is \\\"%1\\\" a working executable?\")\n                              .arg(tool.executable);\n        }\n      }\n      else\n      {\n        processStatus =\n            QApplication::translate(\n                \"ShaderProcessingTool\",\n                \"Process couldn't be started, \\\"%1\\\" was located as \\\"%2\\\" but didn't start.\")\n                .arg(tool.executable)\n                .arg(path);\n      }\n      break;\n    }\n    case QProcess::Crashed:\n    {\n      processStatus =\n          QApplication::translate(\"ShaderProcessingTool\", \"Process crashed with code %1.\")\n              .arg(process.exitCode());\n      break;\n    }\n    case QProcess::ReadError:\n    case QProcess::WriteError:\n    {\n      processStatus =\n          QApplication::translate(\"ShaderProcessingTool\", \"Process failed during I\/O with code %1.\")\n              .arg(process.exitCode());\n      break;\n    }\n    case QProcess::Timedout:        \/\/ shouldn't happen, we don't use a timeout\n    case QProcess::UnknownError:    \/\/ return value if nothing went wrong\n    {\n      processStatus =\n          QApplication::translate(\"ShaderProcessingTool\", \"Process exited with code %1.\")\n              .arg(process.exitCode());\n    }\n  }\n\n  ret.log = QApplication::translate(\"ShaderProcessingTool\",\n                                    \"Running \\\"%1\\\" %2\\n\"\n                                    \"%3\\n\"\n                                    \"%4\\n\"\n                                    \"Output file is %5 bytes\")\n                .arg(path)\n                .arg(argList.join(QLatin1Char(' ')))\n                .arg(QString::fromUtf8(stdout_data))\n                .arg(processStatus)\n                .arg(ret.result.count());\n\n  return ret;\n}\n\nShaderToolOutput ShaderProcessingTool::DisassembleShader(QWidget *window,\n                                                         const ShaderReflection *shaderDetails,\n                                                         rdcstr arguments) const\n{\n  QStringList argList = ParseArgsList(arguments.isEmpty() ? DefaultArguments() : arguments);\n  \/\/ always append IO arguments for known tools, so we read\/write to our own files and override any\n  \/\/ dangling output specified file in the embedded command line\n  argList.append(ParseArgsList(IOArguments()));\n\n  QString input_file, output_file;\n\n  input_file = tmpPath(lit(\"shader_input\"));\n\n  \/\/ replace arguments after expansion to avoid problems with quoting paths etc\n  for(QString &arg : argList)\n  {\n    if(arg == lit(\"{input_file}\"))\n      arg = input_file;\n    if(arg == lit(\"{output_file}\"))\n      arg = output_file = tmpPath(lit(\"shader_output\"));\n    if(arg == lit(\"{entry_point}\"))\n    {\n      arg = shaderDetails->entryPoint;\n      if(arg.isEmpty())\n        arg = lit(\"main\");\n    }\n\n    \/\/ allow substring matches from the left, to enable e.g. {hlsl_stage2}_6_0\n    if(arg.left(13) == lit(\"{glsl_stage4}\"))\n      arg.replace(0, 13, glsl_stage4[int(shaderDetails->stage)]);\n    if(arg.left(13) == lit(\"{hlsl_stage2}\"))\n      arg.replace(0, 13, hlsl_stage2[int(shaderDetails->stage)]);\n  }\n\n  QFile binHandle(input_file);\n  if(binHandle.open(QFile::WriteOnly | QIODevice::Truncate))\n  {\n    binHandle.write(\n        QByteArray((const char *)shaderDetails->rawBytes.data(), shaderDetails->rawBytes.count()));\n    binHandle.close();\n  }\n  else\n  {\n    ShaderToolOutput ret;\n\n    ret.log = QApplication::translate(\"ShaderProcessingTool\",\n                                      \"ERROR: Couldn't write input to temporary file '%1'\")\n                  .arg(input_file);\n\n    return ret;\n  }\n\n  return RunTool(*this, window, input_file, output_file, argList);\n}\n\nShaderToolOutput ShaderProcessingTool::CompileShader(QWidget *window, rdcstr source,\n                                                     rdcstr entryPoint, ShaderStage stage,\n                                                     rdcstr arguments) const\n{\n  QStringList argList = ParseArgsList(arguments.isEmpty() ? DefaultArguments() : arguments);\n  \/\/ always append IO arguments for known tools, so we read\/write to our own files and override any\n  \/\/ dangling output specified file in the embedded command line\n  argList.append(ParseArgsList(IOArguments()));\n\n  QString input_file, output_file;\n\n  input_file = tmpPath(lit(\"shader_input\"));\n\n  \/\/ replace arguments after expansion to avoid problems with quoting paths etc\n  for(QString &arg : argList)\n  {\n    if(arg == lit(\"{input_file}\"))\n      arg = input_file;\n    if(arg == lit(\"{output_file}\"))\n      arg = output_file = tmpPath(lit(\"shader_output\"));\n    if(arg == lit(\"{entry_point}\"))\n      arg = entryPoint;\n\n    \/\/ allow substring matches from the left, to enable e.g. {hlsl_stage2}_6_0\n    if(arg.left(13) == lit(\"{glsl_stage4}\"))\n      arg.replace(0, 13, glsl_stage4[int(stage)]);\n    if(arg.left(13) == lit(\"{hlsl_stage2}\"))\n      arg.replace(0, 13, hlsl_stage2[int(stage)]);\n  }\n\n  QFile binHandle(input_file);\n  if(binHandle.open(QFile::WriteOnly | QIODevice::Truncate))\n  {\n    binHandle.write(QByteArray((const char *)source.c_str(), source.count()));\n    binHandle.close();\n  }\n  else\n  {\n    ShaderToolOutput ret;\n\n    ret.log = QApplication::translate(\"ShaderProcessingTool\",\n                                      \"ERROR: Couldn't write input to temporary file '%1'\")\n                  .arg(input_file);\n\n    return ret;\n  }\n\n  return RunTool(*this, window, input_file, output_file, argList);\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 <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\/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 \"common.h\"\n#include \"PackedExample.h\"\n\nusing namespace fnord;\n\nint main(int argc, const char** argv) {\n  fnord::Application::init();\n  fnord::Application::logToStderr();\n\n  fnord::cli::FlagParser flags;\n\n  flags.defineFlag(\n      \"output_lightsvm\",\n      fnord::cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"output lightsvm data\",\n      \"<filename>\");\n\n  flags.defineFlag(\n      \"output_meta\",\n      fnord::cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"output feature metadata\",\n      \"<filename>\");\n\n  flags.defineFlag(\n      \"min_observations\",\n      fnord::cli::FlagParser::T_INTEGER,\n      false,\n      NULL,\n      \"100\",\n      \"minimum nuber of feature observations\",\n      \"<num>\");\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 sstables = flags.getArgv();\n  auto tbl_cnt = sstables.size();\n  if (tbl_cnt == 0) {\n    fnord::logCritical(\"cm.featuredump\", \"No input tables, exiting\");\n    return 1;\n  }\n\n  \/* open output: meta file *\/\n  Option<File> output_meta_file;\n  String output_meta_file_path;\n\n  if (flags.isSet(\"output_meta\")) {\n    output_meta_file_path = flags.getString(\"output_meta\");\n\n    fnord::logInfo(\n        \"cm.featureprep\",\n        \"Writing feature metadata to: $0\",\n        output_meta_file_path);\n\n    if (FileUtil::exists(output_meta_file_path + \"~\")) {\n      fnord::logInfo(\n          \"cm.featuredump\",\n          \"Deleting orphaned tmp file: $0\",\n          output_meta_file_path + \"~\");\n\n      FileUtil::rm(output_meta_file_path + \"~\");\n    }\n\n    output_meta_file = std::move(Option<File>(std::move(\n        File::openFile(\n            output_meta_file_path + \"~\",\n            File::O_READ | File::O_WRITE | File::O_CREATE))));\n  }\n\n  \/* open output: lightsvm file *\/\n  Option<File> output_lightsvm_file;\n  String output_lightsvm_file_path;\n\n  if (flags.isSet(\"output_lightsvm\")) {\n    output_lightsvm_file_path = flags.getString(\"output_lightsvm\");\n\n    fnord::logInfo(\n        \"cm.featureprep\",\n        \"Writing lightSVM features to: $0\",\n        output_lightsvm_file_path);\n\n    if (FileUtil::exists(output_lightsvm_file_path + \"~\")) {\n      fnord::logInfo(\n          \"cm.featuredump\",\n          \"Deleting orphaned tmp file: $0\",\n          output_lightsvm_file_path + \"~\");\n\n      FileUtil::rm(output_lightsvm_file_path + \"~\");\n    }\n\n    output_lightsvm_file = std::move(Option<File>(std::move(\n        File::openFile(\n            output_lightsvm_file_path + \"~\",\n            File::O_READ | File::O_WRITE | File::O_CREATE))));\n  }\n\n  \/* read input meta tables and count features *\/\n  HashMap<String, uint64_t> feature_counts;\n  int row_idx = 0;\n  for (int tbl_idx = 0; tbl_idx < sstables.size(); ++tbl_idx) {\n    String sstable = sstables[tbl_idx];\n    StringUtil::replaceAll(&sstable, \".sstable\", \"_meta.sstable\");\n    fnord::logInfo(\"cm.featuredump\", \"Importing meta sstable: $0\", sstable);\n\n    \/* read sstable heade r*\/\n    sstable::SSTableReader reader(File::openFile(sstable, File::O_READ));\n    sstable::SSTableColumnSchema schema;\n    schema.loadIndex(&reader);\n\n    if (reader.bodySize() == 0) {\n      fnord::logCritical(\"cm.featuredump\", \"unfinished sstable: $0\", sstable);\n      exit(1);\n    }\n\n    \/* get sstable cursor *\/\n    auto cursor = reader.getCursor();\n    auto body_size = reader.bodySize();\n\n    \/* status line *\/\n    util::SimpleRateLimitedFn status_line(kMicrosPerSecond, [&] () {\n      auto p = (tbl_idx \/ (double) tbl_cnt) +\n          ((cursor->position() \/ (double) body_size)) \/ (double) tbl_cnt;\n\n      fnord::logInfo(\n          \"cm.featuredump\",\n          \"[$0%] Reading meta sstables... rows=$1 features=$2\",\n          (size_t) (p * 100),\n          row_idx,\n          feature_counts.size());\n    });\n\n    \/* read sstable rows *\/\n    for (; cursor->valid(); ++row_idx) {\n      status_line.runMaybe();\n\n      auto key = cursor->getKeyString();\n      auto val = cursor->getDataBuffer();\n\n      sstable::SSTableColumnReader cols(&schema, val);\n      auto cnt = cols.getUInt64Column(schema.columnID(\"count\"));\n\n      feature_counts[key] += cnt;\n\n      if (!cursor->next()) {\n        break;\n      }\n    }\n\n    status_line.runForce();\n  }\n\n  \/* select features for export and assign indexes*\/\n  HashMap<String, uint64_t> feature_idx;\n  uint64_t cur_idx = 0;\n  auto orig_count = feature_counts.size();\n  auto min_count = flags.getInt(\"min_observations\");\n  for (auto iter = feature_counts.begin(); iter != feature_counts.end(); ) {\n    if (iter->second > min_count) {\n      feature_idx.emplace(iter->first, ++cur_idx);\n    }\n\n    iter = feature_counts.erase(iter);\n  }\n\n  feature_counts.clear();\n\n  fnord::logInfo(\n      \"cm.featuredump\",\n      \"Exporting $1\/$0 features\",\n      orig_count,\n      feature_idx.size());\n\n  \/* write feature idx meta file *\/\n  if (!output_meta_file.isEmpty()) {\n    for (const auto& f : feature_idx) {\n      auto line = StringUtil::format(\"$1 $0\\n\", f.first, f.second);\n      output_meta_file.get().write(line);\n    }\n  }\n\n  \/* read input data tables *\/\n  int rows_read = 0;\n  int rows_written = 0;\n  for (int tbl_idx = 0; tbl_idx < sstables.size(); ++tbl_idx) {\n    const auto& sstable = sstables[tbl_idx];\n    fnord::logInfo(\"cm.featuredump\", \"Importing data sstable: $0\", sstable);\n\n    \/* read sstable heade r*\/\n    sstable::SSTableReader reader(File::openFile(sstable, File::O_READ));\n    sstable::SSTableColumnSchema schema;\n    schema.loadIndex(&reader);\n\n    if (reader.bodySize() == 0) {\n      fnord::logCritical(\"cm.featuredump\", \"unfinished sstable: $0\", sstable);\n      exit(1);\n    }\n\n    \/* get sstable cursor *\/\n    auto cursor = reader.getCursor();\n    auto body_size = reader.bodySize();\n\n    \/* status line *\/\n    util::SimpleRateLimitedFn status_line(kMicrosPerSecond, [&] () {\n      auto p = (tbl_idx \/ (double) tbl_cnt) +\n          ((cursor->position() \/ (double) body_size)) \/ (double) tbl_cnt;\n\n      fnord::logInfo(\n          \"cm.featuredump\",\n          \"[$0%] Reading data sstables... rows_read=$1 rows_written=$2\",\n          (size_t) (p * 100),\n          rows_read,\n          rows_written);\n    });\n\n    \/* read data sstables and copy features *\/\n    for (; cursor->valid(); ++rows_read) {\n      status_line.runMaybe();\n\n      auto val = cursor->getDataBuffer();\n      sstable::SSTableColumnReader cols(&schema, val);\n\n      cm::Example ex;\n      ex.label = cols.getFloatColumn(schema.columnID(\"label\"));\n      auto features = cols.getStringColumns(schema.columnID(\"feature\"));\n      for (const auto& f : features) {\n        auto idx = feature_idx.find(f);\n        if (idx == feature_idx.end()) {\n          continue;\n        }\n\n        ex.features.emplace_back(idx->second, 1.0);\n      }\n\n      if (!output_lightsvm_file.isEmpty() && ex.features.size() > 0) {\n        auto ex_str = exampleToSVMLight(ex);\n        output_lightsvm_file.get().write(ex_str + \"\\n\");\n        ++rows_written;\n      }\n\n      if (!cursor->next()) {\n        break;\n      }\n    }\n\n    status_line.runForce();\n  }\n\n  if (!output_meta_file.isEmpty()) {\n    FileUtil::mv(output_meta_file_path + \"~\", output_meta_file_path);\n  }\n\n  if (!output_lightsvm_file.isEmpty()) {\n    FileUtil::mv(output_lightsvm_file_path + \"~\", output_lightsvm_file_path);\n  }\n\n  return 0;\n}\n\n<commit_msg>cm-featuredump --output_mm_{labels,features} flag<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\/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 \"common.h\"\n#include \"PackedExample.h\"\n\nusing namespace fnord;\n\nint main(int argc, const char** argv) {\n  fnord::Application::init();\n  fnord::Application::logToStderr();\n\n  fnord::cli::FlagParser flags;\n\n  flags.defineFlag(\n      \"output_lightsvm\",\n      fnord::cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"output lightsvm data\",\n      \"<filename>\");\n\n  flags.defineFlag(\n      \"output_mm_labels\",\n      fnord::cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"output matrix market labels\",\n      \"<filename>\");\n\n  flags.defineFlag(\n      \"output_mm_features\",\n      fnord::cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"output matrix market features\",\n      \"<filename>\");\n\n  flags.defineFlag(\n      \"output_meta\",\n      fnord::cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"output feature metadata\",\n      \"<filename>\");\n\n  flags.defineFlag(\n      \"min_observations\",\n      fnord::cli::FlagParser::T_INTEGER,\n      false,\n      NULL,\n      \"100\",\n      \"minimum nuber of feature observations\",\n      \"<num>\");\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 sstables = flags.getArgv();\n  auto tbl_cnt = sstables.size();\n  if (tbl_cnt == 0) {\n    fnord::logCritical(\"cm.featuredump\", \"No input tables, exiting\");\n    return 1;\n  }\n\n  \/* open output: meta file *\/\n  Option<File> output_meta_file;\n  String output_meta_file_path;\n\n  if (flags.isSet(\"output_meta\")) {\n    output_meta_file_path = flags.getString(\"output_meta\");\n\n    fnord::logInfo(\n        \"cm.featureprep\",\n        \"Writing feature metadata to: $0\",\n        output_meta_file_path);\n\n    if (FileUtil::exists(output_meta_file_path + \"~\")) {\n      fnord::logInfo(\n          \"cm.featuredump\",\n          \"Deleting orphaned tmp file: $0\",\n          output_meta_file_path + \"~\");\n\n      FileUtil::rm(output_meta_file_path + \"~\");\n    }\n\n    output_meta_file = std::move(Option<File>(std::move(\n        File::openFile(\n            output_meta_file_path + \"~\",\n            File::O_READ | File::O_WRITE | File::O_CREATE))));\n  }\n\n  \/* open output: lightsvm file *\/\n  Option<File> output_lightsvm_file;\n  String output_lightsvm_file_path;\n\n  if (flags.isSet(\"output_lightsvm\")) {\n    output_lightsvm_file_path = flags.getString(\"output_lightsvm\");\n\n    fnord::logInfo(\n        \"cm.featureprep\",\n        \"Writing lightSVM features to: $0\",\n        output_lightsvm_file_path);\n\n    if (FileUtil::exists(output_lightsvm_file_path + \"~\")) {\n      fnord::logInfo(\n          \"cm.featuredump\",\n          \"Deleting orphaned tmp file: $0\",\n          output_lightsvm_file_path + \"~\");\n\n      FileUtil::rm(output_lightsvm_file_path + \"~\");\n    }\n\n    output_lightsvm_file = std::move(Option<File>(std::move(\n        File::openFile(\n            output_lightsvm_file_path + \"~\",\n            File::O_READ | File::O_WRITE | File::O_CREATE))));\n  }\n\n  \/* open output: matrix market labels file *\/\n  Option<File> output_mm_labels_file;\n  String output_mm_labels_file_path;\n\n  if (flags.isSet(\"output_mm_labels\")) {\n    output_mm_labels_file_path = flags.getString(\"output_mm_labels\");\n\n    fnord::logInfo(\n        \"cm.featureprep\",\n        \"Writing matrix market labels to $0\",\n        output_mm_labels_file_path);\n\n    if (FileUtil::exists(output_mm_labels_file_path + \"~\")) {\n      fnord::logInfo(\n          \"cm.featuredump\",\n          \"Deleting orphaned tmp file: $0\",\n          output_mm_labels_file_path + \"~\");\n\n      FileUtil::rm(output_mm_labels_file_path + \"~\");\n    }\n\n    output_mm_labels_file = std::move(Option<File>(std::move(\n        File::openFile(\n            output_mm_labels_file_path + \"~\",\n            File::O_READ | File::O_WRITE | File::O_CREATE))));\n  }\n\n  \/* open output: matrix market features file *\/\n  Option<File> output_mm_features_file;\n  String output_mm_features_file_path;\n\n  if (flags.isSet(\"output_mm_features\")) {\n    output_mm_features_file_path = flags.getString(\"output_mm_features\");\n\n    fnord::logInfo(\n        \"cm.featureprep\",\n        \"Writing matrix market features to $0\",\n        output_mm_features_file_path);\n\n    if (FileUtil::exists(output_mm_features_file_path + \"~\")) {\n      fnord::logInfo(\n          \"cm.featuredump\",\n          \"Deleting orphaned tmp file: $0\",\n          output_mm_features_file_path + \"~\");\n\n      FileUtil::rm(output_mm_features_file_path + \"~\");\n    }\n\n    output_mm_features_file = std::move(Option<File>(std::move(\n        File::openFile(\n            output_mm_features_file_path + \"~\",\n            File::O_READ | File::O_WRITE | File::O_CREATE))));\n  }\n\n  \/* read input meta tables and count features *\/\n  HashMap<String, uint64_t> feature_counts;\n  int row_idx = 0;\n  for (int tbl_idx = 0; tbl_idx < sstables.size(); ++tbl_idx) {\n    String sstable = sstables[tbl_idx];\n    StringUtil::replaceAll(&sstable, \".sstable\", \"_meta.sstable\");\n    fnord::logInfo(\"cm.featuredump\", \"Importing meta sstable: $0\", sstable);\n\n    \/* read sstable heade r*\/\n    sstable::SSTableReader reader(File::openFile(sstable, File::O_READ));\n    sstable::SSTableColumnSchema schema;\n    schema.loadIndex(&reader);\n\n    if (reader.bodySize() == 0) {\n      fnord::logCritical(\"cm.featuredump\", \"unfinished sstable: $0\", sstable);\n      exit(1);\n    }\n\n    \/* get sstable cursor *\/\n    auto cursor = reader.getCursor();\n    auto body_size = reader.bodySize();\n\n    \/* status line *\/\n    util::SimpleRateLimitedFn status_line(kMicrosPerSecond, [&] () {\n      auto p = (tbl_idx \/ (double) tbl_cnt) +\n          ((cursor->position() \/ (double) body_size)) \/ (double) tbl_cnt;\n\n      fnord::logInfo(\n          \"cm.featuredump\",\n          \"[$0%] Reading meta sstables... rows=$1 features=$2\",\n          (size_t) (p * 100),\n          row_idx,\n          feature_counts.size());\n    });\n\n    \/* read sstable rows *\/\n    for (; cursor->valid(); ++row_idx) {\n      status_line.runMaybe();\n\n      auto key = cursor->getKeyString();\n      auto val = cursor->getDataBuffer();\n\n      sstable::SSTableColumnReader cols(&schema, val);\n      auto cnt = cols.getUInt64Column(schema.columnID(\"count\"));\n\n      feature_counts[key] += cnt;\n\n      if (!cursor->next()) {\n        break;\n      }\n    }\n\n    status_line.runForce();\n  }\n\n  \/* select features for export and assign indexes*\/\n  HashMap<String, uint64_t> feature_idx;\n  uint64_t cur_idx = 0;\n  auto orig_count = feature_counts.size();\n  auto min_count = flags.getInt(\"min_observations\");\n  for (auto iter = feature_counts.begin(); iter != feature_counts.end(); ) {\n    if (iter->second > min_count) {\n      feature_idx.emplace(iter->first, ++cur_idx);\n    }\n\n    iter = feature_counts.erase(iter);\n  }\n\n  feature_counts.clear();\n\n  fnord::logInfo(\n      \"cm.featuredump\",\n      \"Exporting $1\/$0 features\",\n      orig_count,\n      feature_idx.size());\n\n  \/* write feature idx meta file *\/\n  if (!output_meta_file.isEmpty()) {\n    for (const auto& f : feature_idx) {\n      auto line = StringUtil::format(\"$1 $0\\n\", f.first, f.second);\n      output_meta_file.get().write(line);\n    }\n  }\n\n  \/* read input data tables *\/\n  int rows_read = 0;\n  int rows_written = 0;\n  for (int tbl_idx = 0; tbl_idx < sstables.size(); ++tbl_idx) {\n    const auto& sstable = sstables[tbl_idx];\n    fnord::logInfo(\"cm.featuredump\", \"Importing data sstable: $0\", sstable);\n\n    \/* read sstable heade r*\/\n    sstable::SSTableReader reader(File::openFile(sstable, File::O_READ));\n    sstable::SSTableColumnSchema schema;\n    schema.loadIndex(&reader);\n\n    if (reader.bodySize() == 0) {\n      fnord::logCritical(\"cm.featuredump\", \"unfinished sstable: $0\", sstable);\n      exit(1);\n    }\n\n    \/* get sstable cursor *\/\n    auto cursor = reader.getCursor();\n    auto body_size = reader.bodySize();\n\n    \/* status line *\/\n    util::SimpleRateLimitedFn status_line(kMicrosPerSecond, [&] () {\n      auto p = (tbl_idx \/ (double) tbl_cnt) +\n          ((cursor->position() \/ (double) body_size)) \/ (double) tbl_cnt;\n\n      fnord::logInfo(\n          \"cm.featuredump\",\n          \"[$0%] Reading data sstables... rows_read=$1 rows_written=$2\",\n          (size_t) (p * 100),\n          rows_read,\n          rows_written);\n    });\n\n    \/* read data sstables and copy features *\/\n    for (; cursor->valid(); ++rows_read) {\n      status_line.runMaybe();\n\n      auto val = cursor->getDataBuffer();\n      sstable::SSTableColumnReader cols(&schema, val);\n\n      cm::Example ex;\n      ex.label = cols.getFloatColumn(schema.columnID(\"label\"));\n      auto features = cols.getStringColumns(schema.columnID(\"feature\"));\n      for (const auto& f : features) {\n        auto idx = feature_idx.find(f);\n        if (idx == feature_idx.end()) {\n          continue;\n        }\n\n        ex.features.emplace_back(idx->second, 1.0);\n      }\n\n      if (!output_lightsvm_file.isEmpty() && ex.features.size() > 0) {\n        auto ex_str = exampleToSVMLight(ex);\n        output_lightsvm_file.get().write(ex_str + \"\\n\");\n        ++rows_written;\n      }\n\n      if (!cursor->next()) {\n        break;\n      }\n    }\n\n    status_line.runForce();\n  }\n\n  if (!output_meta_file.isEmpty()) {\n    FileUtil::mv(output_meta_file_path + \"~\", output_meta_file_path);\n  }\n\n  if (!output_lightsvm_file.isEmpty()) {\n    FileUtil::mv(output_lightsvm_file_path + \"~\", output_lightsvm_file_path);\n  }\n\n  if (!output_mm_labels_file.isEmpty()) {\n    FileUtil::mv(output_mm_labels_file_path + \"~\", output_mm_labels_file_path);\n  }\n\n  if (!output_mm_features_file.isEmpty()) {\n    FileUtil::mv(output_mm_features_file_path + \"~\", output_mm_features_file_path);\n  }\n\n  return 0;\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 <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\/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 \"common.h\"\n#include \"PackedExample.h\"\n\nusing namespace fnord;\n\nint main(int argc, const char** argv) {\n  fnord::Application::init();\n  fnord::Application::logToStderr();\n\n  fnord::cli::FlagParser flags;\n\n  flags.defineFlag(\n      \"output_lightsvm\",\n      fnord::cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"output lightsvm data\",\n      \"<filename>\");\n\n  flags.defineFlag(\n      \"output_meta\",\n      fnord::cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"output feature metadata\",\n      \"<filename>\");\n\n  flags.defineFlag(\n      \"min_observations\",\n      fnord::cli::FlagParser::T_INTEGER,\n      false,\n      NULL,\n      \"100\",\n      \"minimum nuber of feature observations\",\n      \"<num>\");\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 sstables = flags.getArgv();\n  auto tbl_cnt = sstables.size();\n  if (tbl_cnt == 0) {\n    fnord::logCritical(\"cm.featuredump\", \"No input tables, exiting\");\n    return 1;\n  }\n\n  \/* open output: meta file *\/\n  Option<File> output_meta_file;\n  String output_meta_file_path;\n\n  if (flags.isSet(\"output_meta\")) {\n    output_meta_file_path = flags.getString(\"output_meta\");\n\n    fnord::logInfo(\n        \"cm.featureprep\",\n        \"Writing feature metadata to: $0\",\n        output_meta_file_path);\n\n    if (FileUtil::exists(output_meta_file_path + \"~\")) {\n      fnord::logInfo(\n          \"cm.featuredump\",\n          \"Deleting orphaned tmp file: $0\",\n          output_meta_file_path + \"~\");\n\n      FileUtil::rm(output_meta_file_path + \"~\");\n    }\n\n    output_meta_file = std::move(Option<File>(std::move(\n        File::openFile(\n            output_meta_file_path + \"~\",\n            File::O_READ | File::O_WRITE | File::O_CREATE))));\n  }\n\n  \/* open output: lightsvm file *\/\n  Option<File> output_lightsvm_file;\n  String output_lightsvm_file_path;\n\n  if (flags.isSet(\"output_lightsvm\")) {\n    output_lightsvm_file_path = flags.getString(\"output_lightsvm\");\n\n    fnord::logInfo(\n        \"cm.featureprep\",\n        \"Writing lightSVM features to: $0\",\n        output_lightsvm_file_path);\n\n    if (FileUtil::exists(output_lightsvm_file_path + \"~\")) {\n      fnord::logInfo(\n          \"cm.featuredump\",\n          \"Deleting orphaned tmp file: $0\",\n          output_lightsvm_file_path + \"~\");\n\n      FileUtil::rm(output_lightsvm_file_path + \"~\");\n    }\n\n    output_lightsvm_file = std::move(Option<File>(std::move(\n        File::openFile(\n            output_lightsvm_file_path + \"~\",\n            File::O_READ | File::O_WRITE | File::O_CREATE))));\n  }\n\n  \/* read input meta tables and count features *\/\n  HashMap<String, uint64_t> feature_counts;\n  int row_idx = 0;\n  for (int tbl_idx = 0; tbl_idx < sstables.size(); ++tbl_idx) {\n    String sstable = sstables[tbl_idx];\n    StringUtil::replaceAll(&sstable, \".sstable\", \"_meta.sstable\");\n    fnord::logInfo(\"cm.featuredump\", \"Importing meta sstable: $0\", sstable);\n\n    \/* read sstable heade r*\/\n    sstable::SSTableReader reader(File::openFile(sstable, File::O_READ));\n    sstable::SSTableColumnSchema schema;\n    schema.loadIndex(&reader);\n\n    if (reader.bodySize() == 0) {\n      fnord::logCritical(\"cm.featuredump\", \"unfinished sstable: $0\", sstable);\n      exit(1);\n    }\n\n    \/* get sstable cursor *\/\n    auto cursor = reader.getCursor();\n    auto body_size = reader.bodySize();\n\n    \/* status line *\/\n    util::SimpleRateLimitedFn status_line(kMicrosPerSecond, [&] () {\n      auto p = (tbl_idx \/ (double) tbl_cnt) +\n          ((cursor->position() \/ (double) body_size)) \/ (double) tbl_cnt;\n\n      fnord::logInfo(\n          \"cm.featuredump\",\n          \"[$0%] Reading meta sstables... rows=$1 features=$2\",\n          (size_t) (p * 100),\n          row_idx,\n          feature_counts.size());\n    });\n\n    \/* read sstable rows *\/\n    for (; cursor->valid(); ++row_idx) {\n      status_line.runMaybe();\n\n      auto key = cursor->getKeyString();\n      auto val = cursor->getDataBuffer();\n\n      sstable::SSTableColumnReader cols(&schema, val);\n      auto cnt = cols.getUInt64Column(schema.columnID(\"count\"));\n\n      feature_counts[key] += cnt;\n\n      if (!cursor->next()) {\n        break;\n      }\n    }\n\n    status_line.runForce();\n  }\n\n  \/* select features for export and assign indexes*\/\n  HashMap<String, uint64_t> feature_idx;\n  uint64_t cur_idx = 0;\n  auto orig_count = feature_counts.size();\n  auto min_count = flags.getInt(\"min_observations\");\n  for (auto iter = feature_counts.begin(); iter != feature_counts.end(); ) {\n    if (iter->second > min_count) {\n      feature_idx.emplace(iter->first, ++cur_idx);\n    }\n\n    iter = feature_counts.erase(iter);\n  }\n\n  feature_counts.clear();\n\n  fnord::logInfo(\n      \"cm.featuredump\",\n      \"Exporting $1\/$0 features\",\n      orig_count,\n      feature_idx.size());\n\n  \/* write feature idx meta file *\/\n  if (!output_meta_file.isEmpty()) {\n    for (const auto& f : feature_idx) {\n      auto line = StringUtil::format(\"$1 $0\\n\", f.first, f.second);\n      output_meta_file.get().write(line);\n    }\n  }\n\n  \/* read input data tables *\/\n  int rows_read = 0;\n  int rows_written = 0;\n  for (int tbl_idx = 0; tbl_idx < sstables.size(); ++tbl_idx) {\n    const auto& sstable = sstables[tbl_idx];\n    fnord::logInfo(\"cm.featuredump\", \"Importing data sstable: $0\", sstable);\n\n    \/* read sstable heade r*\/\n    sstable::SSTableReader reader(File::openFile(sstable, File::O_READ));\n    sstable::SSTableColumnSchema schema;\n    schema.loadIndex(&reader);\n\n    if (reader.bodySize() == 0) {\n      fnord::logCritical(\"cm.featuredump\", \"unfinished sstable: $0\", sstable);\n      exit(1);\n    }\n\n    \/* get sstable cursor *\/\n    auto cursor = reader.getCursor();\n    auto body_size = reader.bodySize();\n\n    \/* status line *\/\n    util::SimpleRateLimitedFn status_line(kMicrosPerSecond, [&] () {\n      auto p = (tbl_idx \/ (double) tbl_cnt) +\n          ((cursor->position() \/ (double) body_size)) \/ (double) tbl_cnt;\n\n      fnord::logInfo(\n          \"cm.featuredump\",\n          \"[$0%] Reading data sstables... rows_read=$1 rows_written=$2\",\n          (size_t) (p * 100),\n          rows_read,\n          rows_written);\n    });\n\n    \/* read data sstables and copy features *\/\n    for (; cursor->valid(); ++rows_read) {\n      status_line.runMaybe();\n\n      auto val = cursor->getDataBuffer();\n      sstable::SSTableColumnReader cols(&schema, val);\n\n      cm::Example ex;\n      ex.label = cols.getFloatColumn(schema.columnID(\"label\"));\n      auto features = cols.getStringColumns(schema.columnID(\"feature\"));\n      for (const auto& f : features) {\n        auto idx = feature_idx.find(f);\n        if (idx == feature_idx.end()) {\n          continue;\n        }\n\n        ex.features.emplace_back(idx->second, 1.0);\n      }\n\n      if (!output_lightsvm_file.isEmpty() && ex.features.size() > 0) {\n        auto ex_str = exampleToSVMLight(ex);\n        output_lightsvm_file.get().write(ex_str + \"\\n\");\n        ++rows_written;\n      }\n\n      if (!cursor->next()) {\n        break;\n      }\n    }\n\n    status_line.runForce();\n  }\n\n  if (!output_meta_file.isEmpty()) {\n    FileUtil::mv(output_meta_file_path + \"~\", output_meta_file_path);\n  }\n\n  if (!output_lightsvm_file.isEmpty()) {\n    FileUtil::mv(output_lightsvm_file_path + \"~\", output_lightsvm_file_path);\n  }\n\n  return 0;\n}\n\n<commit_msg>cm-featuredump --output_mm_{labels,features} flag<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\/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 \"common.h\"\n#include \"PackedExample.h\"\n\nusing namespace fnord;\n\nint main(int argc, const char** argv) {\n  fnord::Application::init();\n  fnord::Application::logToStderr();\n\n  fnord::cli::FlagParser flags;\n\n  flags.defineFlag(\n      \"output_lightsvm\",\n      fnord::cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"output lightsvm data\",\n      \"<filename>\");\n\n  flags.defineFlag(\n      \"output_mm_labels\",\n      fnord::cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"output matrix market labels\",\n      \"<filename>\");\n\n  flags.defineFlag(\n      \"output_mm_features\",\n      fnord::cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"output matrix market features\",\n      \"<filename>\");\n\n  flags.defineFlag(\n      \"output_meta\",\n      fnord::cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"output feature metadata\",\n      \"<filename>\");\n\n  flags.defineFlag(\n      \"min_observations\",\n      fnord::cli::FlagParser::T_INTEGER,\n      false,\n      NULL,\n      \"100\",\n      \"minimum nuber of feature observations\",\n      \"<num>\");\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 sstables = flags.getArgv();\n  auto tbl_cnt = sstables.size();\n  if (tbl_cnt == 0) {\n    fnord::logCritical(\"cm.featuredump\", \"No input tables, exiting\");\n    return 1;\n  }\n\n  \/* open output: meta file *\/\n  Option<File> output_meta_file;\n  String output_meta_file_path;\n\n  if (flags.isSet(\"output_meta\")) {\n    output_meta_file_path = flags.getString(\"output_meta\");\n\n    fnord::logInfo(\n        \"cm.featureprep\",\n        \"Writing feature metadata to: $0\",\n        output_meta_file_path);\n\n    if (FileUtil::exists(output_meta_file_path + \"~\")) {\n      fnord::logInfo(\n          \"cm.featuredump\",\n          \"Deleting orphaned tmp file: $0\",\n          output_meta_file_path + \"~\");\n\n      FileUtil::rm(output_meta_file_path + \"~\");\n    }\n\n    output_meta_file = std::move(Option<File>(std::move(\n        File::openFile(\n            output_meta_file_path + \"~\",\n            File::O_READ | File::O_WRITE | File::O_CREATE))));\n  }\n\n  \/* open output: lightsvm file *\/\n  Option<File> output_lightsvm_file;\n  String output_lightsvm_file_path;\n\n  if (flags.isSet(\"output_lightsvm\")) {\n    output_lightsvm_file_path = flags.getString(\"output_lightsvm\");\n\n    fnord::logInfo(\n        \"cm.featureprep\",\n        \"Writing lightSVM features to: $0\",\n        output_lightsvm_file_path);\n\n    if (FileUtil::exists(output_lightsvm_file_path + \"~\")) {\n      fnord::logInfo(\n          \"cm.featuredump\",\n          \"Deleting orphaned tmp file: $0\",\n          output_lightsvm_file_path + \"~\");\n\n      FileUtil::rm(output_lightsvm_file_path + \"~\");\n    }\n\n    output_lightsvm_file = std::move(Option<File>(std::move(\n        File::openFile(\n            output_lightsvm_file_path + \"~\",\n            File::O_READ | File::O_WRITE | File::O_CREATE))));\n  }\n\n  \/* open output: matrix market labels file *\/\n  Option<File> output_mm_labels_file;\n  String output_mm_labels_file_path;\n\n  if (flags.isSet(\"output_mm_labels\")) {\n    output_mm_labels_file_path = flags.getString(\"output_mm_labels\");\n\n    fnord::logInfo(\n        \"cm.featureprep\",\n        \"Writing matrix market labels to $0\",\n        output_mm_labels_file_path);\n\n    if (FileUtil::exists(output_mm_labels_file_path + \"~\")) {\n      fnord::logInfo(\n          \"cm.featuredump\",\n          \"Deleting orphaned tmp file: $0\",\n          output_mm_labels_file_path + \"~\");\n\n      FileUtil::rm(output_mm_labels_file_path + \"~\");\n    }\n\n    output_mm_labels_file = std::move(Option<File>(std::move(\n        File::openFile(\n            output_mm_labels_file_path + \"~\",\n            File::O_READ | File::O_WRITE | File::O_CREATE))));\n  }\n\n  \/* open output: matrix market features file *\/\n  Option<File> output_mm_features_file;\n  String output_mm_features_file_path;\n\n  if (flags.isSet(\"output_mm_features\")) {\n    output_mm_features_file_path = flags.getString(\"output_mm_features\");\n\n    fnord::logInfo(\n        \"cm.featureprep\",\n        \"Writing matrix market features to $0\",\n        output_mm_features_file_path);\n\n    if (FileUtil::exists(output_mm_features_file_path + \"~\")) {\n      fnord::logInfo(\n          \"cm.featuredump\",\n          \"Deleting orphaned tmp file: $0\",\n          output_mm_features_file_path + \"~\");\n\n      FileUtil::rm(output_mm_features_file_path + \"~\");\n    }\n\n    output_mm_features_file = std::move(Option<File>(std::move(\n        File::openFile(\n            output_mm_features_file_path + \"~\",\n            File::O_READ | File::O_WRITE | File::O_CREATE))));\n  }\n\n  \/* read input meta tables and count features *\/\n  HashMap<String, uint64_t> feature_counts;\n  int row_idx = 0;\n  for (int tbl_idx = 0; tbl_idx < sstables.size(); ++tbl_idx) {\n    String sstable = sstables[tbl_idx];\n    StringUtil::replaceAll(&sstable, \".sstable\", \"_meta.sstable\");\n    fnord::logInfo(\"cm.featuredump\", \"Importing meta sstable: $0\", sstable);\n\n    \/* read sstable heade r*\/\n    sstable::SSTableReader reader(File::openFile(sstable, File::O_READ));\n    sstable::SSTableColumnSchema schema;\n    schema.loadIndex(&reader);\n\n    if (reader.bodySize() == 0) {\n      fnord::logCritical(\"cm.featuredump\", \"unfinished sstable: $0\", sstable);\n      exit(1);\n    }\n\n    \/* get sstable cursor *\/\n    auto cursor = reader.getCursor();\n    auto body_size = reader.bodySize();\n\n    \/* status line *\/\n    util::SimpleRateLimitedFn status_line(kMicrosPerSecond, [&] () {\n      auto p = (tbl_idx \/ (double) tbl_cnt) +\n          ((cursor->position() \/ (double) body_size)) \/ (double) tbl_cnt;\n\n      fnord::logInfo(\n          \"cm.featuredump\",\n          \"[$0%] Reading meta sstables... rows=$1 features=$2\",\n          (size_t) (p * 100),\n          row_idx,\n          feature_counts.size());\n    });\n\n    \/* read sstable rows *\/\n    for (; cursor->valid(); ++row_idx) {\n      status_line.runMaybe();\n\n      auto key = cursor->getKeyString();\n      auto val = cursor->getDataBuffer();\n\n      sstable::SSTableColumnReader cols(&schema, val);\n      auto cnt = cols.getUInt64Column(schema.columnID(\"count\"));\n\n      feature_counts[key] += cnt;\n\n      if (!cursor->next()) {\n        break;\n      }\n    }\n\n    status_line.runForce();\n  }\n\n  \/* select features for export and assign indexes*\/\n  HashMap<String, uint64_t> feature_idx;\n  uint64_t cur_idx = 0;\n  auto orig_count = feature_counts.size();\n  auto min_count = flags.getInt(\"min_observations\");\n  for (auto iter = feature_counts.begin(); iter != feature_counts.end(); ) {\n    if (iter->second > min_count) {\n      feature_idx.emplace(iter->first, ++cur_idx);\n    }\n\n    iter = feature_counts.erase(iter);\n  }\n\n  feature_counts.clear();\n\n  fnord::logInfo(\n      \"cm.featuredump\",\n      \"Exporting $1\/$0 features\",\n      orig_count,\n      feature_idx.size());\n\n  \/* write feature idx meta file *\/\n  if (!output_meta_file.isEmpty()) {\n    for (const auto& f : feature_idx) {\n      auto line = StringUtil::format(\"$1 $0\\n\", f.first, f.second);\n      output_meta_file.get().write(line);\n    }\n  }\n\n  \/* read input data tables *\/\n  int rows_read = 0;\n  int rows_written = 0;\n  for (int tbl_idx = 0; tbl_idx < sstables.size(); ++tbl_idx) {\n    const auto& sstable = sstables[tbl_idx];\n    fnord::logInfo(\"cm.featuredump\", \"Importing data sstable: $0\", sstable);\n\n    \/* read sstable heade r*\/\n    sstable::SSTableReader reader(File::openFile(sstable, File::O_READ));\n    sstable::SSTableColumnSchema schema;\n    schema.loadIndex(&reader);\n\n    if (reader.bodySize() == 0) {\n      fnord::logCritical(\"cm.featuredump\", \"unfinished sstable: $0\", sstable);\n      exit(1);\n    }\n\n    \/* get sstable cursor *\/\n    auto cursor = reader.getCursor();\n    auto body_size = reader.bodySize();\n\n    \/* status line *\/\n    util::SimpleRateLimitedFn status_line(kMicrosPerSecond, [&] () {\n      auto p = (tbl_idx \/ (double) tbl_cnt) +\n          ((cursor->position() \/ (double) body_size)) \/ (double) tbl_cnt;\n\n      fnord::logInfo(\n          \"cm.featuredump\",\n          \"[$0%] Reading data sstables... rows_read=$1 rows_written=$2\",\n          (size_t) (p * 100),\n          rows_read,\n          rows_written);\n    });\n\n    \/* read data sstables and copy features *\/\n    for (; cursor->valid(); ++rows_read) {\n      status_line.runMaybe();\n\n      auto val = cursor->getDataBuffer();\n      sstable::SSTableColumnReader cols(&schema, val);\n\n      cm::Example ex;\n      ex.label = cols.getFloatColumn(schema.columnID(\"label\"));\n      auto features = cols.getStringColumns(schema.columnID(\"feature\"));\n      for (const auto& f : features) {\n        auto idx = feature_idx.find(f);\n        if (idx == feature_idx.end()) {\n          continue;\n        }\n\n        ex.features.emplace_back(idx->second, 1.0);\n      }\n\n      if (!output_lightsvm_file.isEmpty() && ex.features.size() > 0) {\n        auto ex_str = exampleToSVMLight(ex);\n        output_lightsvm_file.get().write(ex_str + \"\\n\");\n        ++rows_written;\n      }\n\n      if (!cursor->next()) {\n        break;\n      }\n    }\n\n    status_line.runForce();\n  }\n\n  if (!output_meta_file.isEmpty()) {\n    FileUtil::mv(output_meta_file_path + \"~\", output_meta_file_path);\n  }\n\n  if (!output_lightsvm_file.isEmpty()) {\n    FileUtil::mv(output_lightsvm_file_path + \"~\", output_lightsvm_file_path);\n  }\n\n  if (!output_mm_labels_file.isEmpty()) {\n    FileUtil::mv(output_mm_labels_file_path + \"~\", output_mm_labels_file_path);\n  }\n\n  if (!output_mm_features_file.isEmpty()) {\n    FileUtil::mv(output_mm_features_file_path + \"~\", output_mm_features_file_path);\n  }\n\n  return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * ALURE  OpenAL utility library\n * Copyright (c) 2009-2010 by Chris Robinson.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and\/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n *\/\n\n#include \"config.h\"\n\n#include \"main.h\"\n\n#include <string.h>\n#include <assert.h>\n\n#include <istream>\n\n#include <modplug.h>\n\n\n#ifdef _WIN32\n#define MODPLUG_LIB \"libmodplug.dll\"\n#elif defined(__APPLE__)\n#define MODPLUG_LIB \"libmodplug.1.dylib\"\n#else\n#define MODPLUG_LIB \"libmodplug.so.1\"\n#endif\n\nstatic void *mod_handle;\n#define MAKE_FUNC(x) static typeof(x)* p##x\nMAKE_FUNC(ModPlug_Load);\nMAKE_FUNC(ModPlug_Unload);\nMAKE_FUNC(ModPlug_Read);\nMAKE_FUNC(ModPlug_SeekOrder);\n#undef MAKE_FUNC\n\n\nstruct modStream : public alureStream {\nprivate:\n    ModPlugFile *modFile;\n    int lastOrder;\n\npublic:\n    static void Init()\n    {\n        mod_handle = OpenLib(MODPLUG_LIB);\n        if(!mod_handle) return;\n\n        LOAD_FUNC(mod_handle, ModPlug_Load);\n        LOAD_FUNC(mod_handle, ModPlug_Unload);\n        LOAD_FUNC(mod_handle, ModPlug_Read);\n        LOAD_FUNC(mod_handle, ModPlug_SeekOrder);\n    }\n    static void Deinit()\n    {\n        if(mod_handle)\n            CloseLib(mod_handle);\n        mod_handle = NULL;\n    }\n\n    virtual bool IsValid()\n    { return modFile != NULL; }\n\n    virtual bool GetFormat(ALenum *fmt, ALuint *frequency, ALuint *blockalign)\n    {\n        *fmt = AL_FORMAT_STEREO16;\n        *frequency = 44100;\n        *blockalign = 2 * sizeof(ALshort);\n        return true;\n    }\n\n    virtual ALuint GetData(ALubyte *data, ALuint bytes)\n    {\n        int ret = pModPlug_Read(modFile, data, bytes);\n        if(ret < 0) return 0;\n        return ret;\n    }\n\n    virtual bool Rewind()\n    { return SetOrder(lastOrder); }\n\n    virtual bool SetOrder(ALuint order)\n    {\n        std::vector<char> data(16384);\n        ALuint total = 0;\n        while(1)\n        {\n            fstream->read(&data[total], data.size()-total);\n            if(fstream->gcount() == 0) break;\n            total += fstream->gcount();\n            data.resize(total*2);\n        }\n        data.resize(total);\n\n        ModPlugFile *newMod = pModPlug_Load(&data[0], data.size());\n        if(!newMod)\n        {\n            SetError(\"Could not reload data\");\n            return false;\n        }\n        pModPlug_Unload(modFile);\n        modFile = newMod;\n\n        \/\/ There seems to be no way to tell if the seek succeeds\n        pModPlug_SeekOrder(modFile, order);\n        lastOrder = order;\n\n        return true;\n    }\n\n    modStream(std::istream *_fstream)\n      : alureStream(_fstream), modFile(NULL), lastOrder(0)\n    {\n        if(!mod_handle) return;\n\n        std::vector<char> data(1024);\n        ALuint total = 0;\n\n        fstream->read(&data[total], data.size()-total);\n        total += fstream->gcount();\n        if(total < 32) return;\n\n        if(memcmp(&data[0], \"Extended Module: \", 17) == 0 || \/* XM *\/\n           (data[28] == 0x1A && data[29] == 0x10) || \/* S3M *\/\n           memcmp(&data[0], \"IMPM\", 4) == 0) \/* IT *\/\n        {\n            while(1)\n            {\n                data.resize(total*2);\n                fstream->read(&data[total], data.size()-total);\n                if(fstream->gcount() == 0) break;\n                total += fstream->gcount();\n            }\n            data.resize(total);\n\n            modFile = pModPlug_Load(&data[0], data.size());\n        }\n    }\n\n    virtual ~modStream()\n    {\n        if(modFile)\n            pModPlug_Unload(modFile);\n        modFile = NULL;\n    }\n};\n\/\/ Priority = -1, because mod loading can find false-positives\nstatic DecoderDecl<modStream,-1> modStream_decoder;\nDecoder &alure_init_modplug(void)\n{ return modStream_decoder; }\n<commit_msg>Avoid calling function pointers for ModPlug directly<commit_after>\/*\n * ALURE  OpenAL utility library\n * Copyright (c) 2009-2010 by Chris Robinson.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and\/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n *\/\n\n#include \"config.h\"\n\n#include \"main.h\"\n\n#include <string.h>\n#include <assert.h>\n\n#include <istream>\n\n#include <modplug.h>\n\n\n#ifdef DYNLOAD\nstatic void *mod_handle;\n#define MAKE_FUNC(x) static typeof(x)* p##x\nMAKE_FUNC(ModPlug_Load);\nMAKE_FUNC(ModPlug_Unload);\nMAKE_FUNC(ModPlug_Read);\nMAKE_FUNC(ModPlug_SeekOrder);\n#undef MAKE_FUNC\n\n#define ModPlug_Load pModPlug_Load\n#define ModPlug_Unload pModPlug_Unload\n#define ModPlug_Read pModPlug_Read\n#define ModPlug_SeekOrder pModPlug_SeekOrder\n#else\n#define mod_handle 1\n#endif\n\n\nstruct modStream : public alureStream {\nprivate:\n    ModPlugFile *modFile;\n    int lastOrder;\n\npublic:\n#ifdef DYNLOAD\n    static void Init()\n    {\n#ifdef _WIN32\n#define MODPLUG_LIB \"libmodplug.dll\"\n#elif defined(__APPLE__)\n#define MODPLUG_LIB \"libmodplug.1.dylib\"\n#else\n#define MODPLUG_LIB \"libmodplug.so.1\"\n#endif\n        mod_handle = OpenLib(MODPLUG_LIB);\n        if(!mod_handle) return;\n\n        LOAD_FUNC(mod_handle, ModPlug_Load);\n        LOAD_FUNC(mod_handle, ModPlug_Unload);\n        LOAD_FUNC(mod_handle, ModPlug_Read);\n        LOAD_FUNC(mod_handle, ModPlug_SeekOrder);\n    }\n    static void Deinit()\n    {\n        if(mod_handle)\n            CloseLib(mod_handle);\n        mod_handle = NULL;\n    }\n#else\n    static void Init() { }\n    static void Deinit() { }\n#endif\n\n    virtual bool IsValid()\n    { return modFile != NULL; }\n\n    virtual bool GetFormat(ALenum *fmt, ALuint *frequency, ALuint *blockalign)\n    {\n        *fmt = AL_FORMAT_STEREO16;\n        *frequency = 44100;\n        *blockalign = 2 * sizeof(ALshort);\n        return true;\n    }\n\n    virtual ALuint GetData(ALubyte *data, ALuint bytes)\n    {\n        int ret = ModPlug_Read(modFile, data, bytes);\n        if(ret < 0) return 0;\n        return ret;\n    }\n\n    virtual bool Rewind()\n    { return SetOrder(lastOrder); }\n\n    virtual bool SetOrder(ALuint order)\n    {\n        std::vector<char> data(16384);\n        ALuint total = 0;\n        while(1)\n        {\n            fstream->read(&data[total], data.size()-total);\n            if(fstream->gcount() == 0) break;\n            total += fstream->gcount();\n            data.resize(total*2);\n        }\n        data.resize(total);\n\n        ModPlugFile *newMod = ModPlug_Load(&data[0], data.size());\n        if(!newMod)\n        {\n            SetError(\"Could not reload data\");\n            return false;\n        }\n        ModPlug_Unload(modFile);\n        modFile = newMod;\n\n        \/\/ There seems to be no way to tell if the seek succeeds\n        ModPlug_SeekOrder(modFile, order);\n        lastOrder = order;\n\n        return true;\n    }\n\n    modStream(std::istream *_fstream)\n      : alureStream(_fstream), modFile(NULL), lastOrder(0)\n    {\n        if(!mod_handle) return;\n\n        std::vector<char> data(1024);\n        ALuint total = 0;\n\n        fstream->read(&data[total], data.size()-total);\n        total += fstream->gcount();\n        if(total < 32) return;\n\n        if(memcmp(&data[0], \"Extended Module: \", 17) == 0 || \/* XM *\/\n           (data[28] == 0x1A && data[29] == 0x10) || \/* S3M *\/\n           memcmp(&data[0], \"IMPM\", 4) == 0) \/* IT *\/\n        {\n            while(1)\n            {\n                data.resize(total*2);\n                fstream->read(&data[total], data.size()-total);\n                if(fstream->gcount() == 0) break;\n                total += fstream->gcount();\n            }\n            data.resize(total);\n\n            modFile = ModPlug_Load(&data[0], data.size());\n        }\n    }\n\n    virtual ~modStream()\n    {\n        if(modFile)\n            ModPlug_Unload(modFile);\n        modFile = NULL;\n    }\n};\n\/\/ Priority = -1, because mod loading can find false-positives\nstatic DecoderDecl<modStream,-1> modStream_decoder;\nDecoder &alure_init_modplug(void)\n{ return modStream_decoder; }\n<|endoftext|>"}
{"text":"<commit_before>\n\/*\n    pbrt source code Copyright(c) 1998-2010 Matt Pharr and Greg Humphreys.\n\n    This file is part of pbrt.\n\n    pbrt 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.  Note that the text contents of\n    the book \"Physically Based Rendering\" are *not* licensed under the\n    GNU GPL.\n\n    pbrt is distributed in the hope that it will be 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#include \"fileutil.h\"\n#include <cstdlib>\n#ifndef PBRT_IS_WINDOWS\n#include <libgen.h>\n#endif\n\nstatic string searchDirectory;\n\n#ifdef PBRT_IS_WINDOWS\nbool IsAbsolutePath(const string &filename)\n{\n    if (filename.size() == 0)\n        return false;\n    return (filename[0] == '\\\\' || filename[0] == '\/' || filename.find(':') != string::npos);\n}\n\n\nstring AbsolutePath(const string &filename)\n{\n    char full[_MAX_PATH];\n    if (_fullpath(full, filename.c_str(), _MAX_PATH) != NULL)\n        return std::string(full);\n    else\n        return filename;\n}\n\n\nstring ResolveFilename(const string &filename)\n{\n    if (searchDirectory.size() == 0 || filename.size() == 0)\n        return filename;\n    else if (IsAbsolutePath(filename))\n        return filename;\n\n    char searchDirectoryEnd = searchDirectory[searchDirectory.size() - 1];\n    if (searchDirectoryEnd == '\\\\' || searchDirectoryEnd == '\/')\n        return searchDirectory + filename;\n    else\n        return searchDirectory + \"\\\\\" + filename;\n}\n\n\nstring DirectoryContaining(const string &filename)\n{\n    \/\/ This code isn't tested but I believe it should work. Might need to add\n    \/\/ some const_casts to make it compile though.\n    char drive[_MAX_DRIVE];\n    char dir[_MAX_DIR];\n    char ext[_MAX_EXT];\n\n    errno_t err = _splitpath_s( filename.c_str(),\n                                drive, _MAX_DRIVE, dir, _MAX_DIR, NULL, 0, ext, _MAX_EXT );\n    if (err == 0) {\n        char fullDir[_MAX_PATH];\n        err = _makepath_s(fullDir, _MAX_PATH, drive, dir, NULL, NULL);\n        if (err == 0)\n            return std::string(fullDir);\n    }\n    return filename;\n}\n\n#else\n\nbool IsAbsolutePath(const string &filename)\n{\n    return (filename.size() > 0) && filename[0] == '\/';\n}\n\n\nstring AbsolutePath(const string &filename)\n{\n    char full[PATH_MAX];\n    if (realpath(filename.c_str(), full) != NULL)\n        return std::string(full);\n    else\n        return filename;\n}\n\n\nstring ResolveFilename(const string &filename)\n{\n    if (searchDirectory.size() == 0 || filename.size() == 0)\n        return filename;\n    else if (IsAbsolutePath(filename))\n        return filename;\n    else if (searchDirectory[searchDirectory.size() - 1] == '\/')\n        return searchDirectory + filename;\n    else\n        return searchDirectory + \"\/\" + filename;\n}\n\n\nstring DirectoryContaining(const string &filename)\n{\n    \/\/ dirname requires a char*, not a const char*, hence the const_cast. It \n    \/\/ doesn't modify it though (according to the docs on OS X).\n    string result = dirname(const_cast<char*>(filename.c_str()));\n    return result;\n}\n\n#endif\n\nvoid SetSearchDirectory(const string &dirname) {\n    searchDirectory = dirname;\n}\n\n\n\n<commit_msg>Add <climits> include to core\/fileutil.cpp. Fixes build on Linux. Thanks to Sebastian Lipponer <sebastian.lipponer@gmx.de>.<commit_after>\n\/*\n    pbrt source code Copyright(c) 1998-2010 Matt Pharr and Greg Humphreys.\n\n    This file is part of pbrt.\n\n    pbrt 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.  Note that the text contents of\n    the book \"Physically Based Rendering\" are *not* licensed under the\n    GNU GPL.\n\n    pbrt is distributed in the hope that it will be 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#include \"fileutil.h\"\n#include <cstdlib>\n#include <climits>\n#ifndef PBRT_IS_WINDOWS\n#include <libgen.h>\n#endif\n\nstatic string searchDirectory;\n\n#ifdef PBRT_IS_WINDOWS\nbool IsAbsolutePath(const string &filename)\n{\n    if (filename.size() == 0)\n        return false;\n    return (filename[0] == '\\\\' || filename[0] == '\/' || filename.find(':') != string::npos);\n}\n\n\nstring AbsolutePath(const string &filename)\n{\n    char full[_MAX_PATH];\n    if (_fullpath(full, filename.c_str(), _MAX_PATH) != NULL)\n        return std::string(full);\n    else\n        return filename;\n}\n\n\nstring ResolveFilename(const string &filename)\n{\n    if (searchDirectory.size() == 0 || filename.size() == 0)\n        return filename;\n    else if (IsAbsolutePath(filename))\n        return filename;\n\n    char searchDirectoryEnd = searchDirectory[searchDirectory.size() - 1];\n    if (searchDirectoryEnd == '\\\\' || searchDirectoryEnd == '\/')\n        return searchDirectory + filename;\n    else\n        return searchDirectory + \"\\\\\" + filename;\n}\n\n\nstring DirectoryContaining(const string &filename)\n{\n    \/\/ This code isn't tested but I believe it should work. Might need to add\n    \/\/ some const_casts to make it compile though.\n    char drive[_MAX_DRIVE];\n    char dir[_MAX_DIR];\n    char ext[_MAX_EXT];\n\n    errno_t err = _splitpath_s( filename.c_str(),\n                                drive, _MAX_DRIVE, dir, _MAX_DIR, NULL, 0, ext, _MAX_EXT );\n    if (err == 0) {\n        char fullDir[_MAX_PATH];\n        err = _makepath_s(fullDir, _MAX_PATH, drive, dir, NULL, NULL);\n        if (err == 0)\n            return std::string(fullDir);\n    }\n    return filename;\n}\n\n#else\n\nbool IsAbsolutePath(const string &filename)\n{\n    return (filename.size() > 0) && filename[0] == '\/';\n}\n\n\nstring AbsolutePath(const string &filename)\n{\n    char full[PATH_MAX];\n    if (realpath(filename.c_str(), full) != NULL)\n        return std::string(full);\n    else\n        return filename;\n}\n\n\nstring ResolveFilename(const string &filename)\n{\n    if (searchDirectory.size() == 0 || filename.size() == 0)\n        return filename;\n    else if (IsAbsolutePath(filename))\n        return filename;\n    else if (searchDirectory[searchDirectory.size() - 1] == '\/')\n        return searchDirectory + filename;\n    else\n        return searchDirectory + \"\/\" + filename;\n}\n\n\nstring DirectoryContaining(const string &filename)\n{\n    \/\/ dirname requires a char*, not a const char*, hence the const_cast. It \n    \/\/ doesn't modify it though (according to the docs on OS X).\n    string result = dirname(const_cast<char*>(filename.c_str()));\n    return result;\n}\n\n#endif\n\nvoid SetSearchDirectory(const string &dirname) {\n    searchDirectory = dirname;\n}\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *  Copyright (c) 2016, The OpenThread Authors.\n *  All rights reserved.\n *\n *  Redistribution and use in source and binary forms, with or without\n *  modification, are permitted provided that the following conditions are met:\n *  1. Redistributions of source code must retain the above copyright\n *     notice, this list of conditions and the following disclaimer.\n *  2. Redistributions in binary form must reproduce the above copyright\n *     notice, this list of conditions and the following disclaimer in the\n *     documentation and\/or other materials provided with the distribution.\n *  3. Neither the name of the copyright holder nor the\n *     names of its contributors may be used to endorse or promote products\n *     derived from this software without specific prior written permission.\n *\n *  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n *  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n *  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n *  ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n *  LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n *  CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n *  SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n *  INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n *  CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n *  ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n *  POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n\/**\n * @file\n *   This file implements UDP\/IPv6 sockets.\n *\/\n\n#include \"udp6.hpp\"\n\n#include <stdio.h>\n\n#include <openthread\/platform\/udp.h>\n\n#include \"common\/code_utils.hpp\"\n#include \"common\/encoding.hpp\"\n#include \"common\/instance.hpp\"\n#include \"common\/locator-getters.hpp\"\n#include \"net\/ip6.hpp\"\n\nusing ot::Encoding::BigEndian::HostSwap16;\n\nnamespace ot {\nnamespace Ip6 {\n\nbool Udp::SocketHandle::Matches(const MessageInfo &aMessageInfo) const\n{\n    bool matches = false;\n\n    VerifyOrExit(GetSockName().mPort == aMessageInfo.GetSockPort(), OT_NOOP);\n\n    VerifyOrExit(aMessageInfo.GetSockAddr().IsMulticast() || GetSockName().GetAddress().IsUnspecified() ||\n                     GetSockName().GetAddress() == aMessageInfo.GetSockAddr(),\n                 OT_NOOP);\n\n    \/\/ Verify source if connected socket\n    if (GetPeerName().mPort != 0)\n    {\n        VerifyOrExit(GetPeerName().mPort == aMessageInfo.GetPeerPort(), OT_NOOP);\n\n        VerifyOrExit(GetPeerName().GetAddress().IsUnspecified() ||\n                         GetPeerName().GetAddress() == aMessageInfo.GetPeerAddr(),\n                     OT_NOOP);\n    }\n\n    matches = true;\n\nexit:\n    return matches;\n}\n\nUdp::Socket::Socket(Instance &aInstance)\n    : InstanceLocator(aInstance)\n{\n    mHandle = nullptr;\n}\n\nMessage *Udp::Socket::NewMessage(uint16_t aReserved, const Message::Settings &aSettings)\n{\n    return Get<Udp>().NewMessage(aReserved, aSettings);\n}\n\notError Udp::Socket::Open(otUdpReceive aHandler, void *aContext)\n{\n    return Get<Udp>().Open(*this, aHandler, aContext);\n}\n\notError Udp::Socket::Bind(const SockAddr &aSockAddr)\n{\n    return Get<Udp>().Bind(*this, aSockAddr);\n}\n\notError Udp::Socket::Bind(uint16_t aPort)\n{\n    return Bind(SockAddr(aPort));\n}\n\notError Udp::Socket::Connect(const SockAddr &aSockAddr)\n{\n    return Get<Udp>().Connect(*this, aSockAddr);\n}\n\notError Udp::Socket::Connect(uint16_t aPort)\n{\n    return Bind(SockAddr(aPort));\n}\n\notError Udp::Socket::Close(void)\n{\n    return Get<Udp>().Close(*this);\n}\n\notError Udp::Socket::SendTo(Message &aMessage, const MessageInfo &aMessageInfo)\n{\n    return Get<Udp>().SendTo(*this, aMessage, aMessageInfo);\n}\n\nUdp::Udp(Instance &aInstance)\n    : InstanceLocator(aInstance)\n    , mEphemeralPort(kDynamicPortMin)\n    , mReceivers()\n    , mSockets()\n#if OPENTHREAD_CONFIG_UDP_FORWARD_ENABLE\n    , mUdpForwarderContext(nullptr)\n    , mUdpForwarder(nullptr)\n#endif\n{\n}\n\notError Udp::AddReceiver(Receiver &aReceiver)\n{\n    return mReceivers.Add(aReceiver);\n}\n\notError Udp::RemoveReceiver(Receiver &aReceiver)\n{\n    otError error;\n\n    SuccessOrExit(error = mReceivers.Remove(aReceiver));\n    aReceiver.SetNext(nullptr);\n\nexit:\n    return error;\n}\n\notError Udp::Open(SocketHandle &aSocket, otUdpReceive aHandler, void *aContext)\n{\n    otError error = OT_ERROR_NONE;\n\n    aSocket.GetSockName().Clear();\n    aSocket.GetPeerName().Clear();\n    aSocket.mHandler = aHandler;\n    aSocket.mContext = aContext;\n\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n    error = otPlatUdpSocket(&aSocket);\n#endif\n    SuccessOrExit(error);\n\n    AddSocket(aSocket);\n\nexit:\n    return error;\n}\n\notError Udp::Bind(SocketHandle &aSocket, const SockAddr &aSockAddr)\n{\n    otError error = OT_ERROR_NONE;\n\n    aSocket.mSockName = aSockAddr;\n\n    if (!aSocket.IsBound())\n    {\n        do\n        {\n            aSocket.mSockName.mPort = GetEphemeralPort();\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n            error = otPlatUdpBind(&aSocket);\n#endif\n        } while (error != OT_ERROR_NONE);\n    }\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n    else if (!IsMlePort(aSocket.mSockName.mPort))\n    {\n        error = otPlatUdpBind(&aSocket);\n    }\n#endif\n\n    return error;\n}\n\notError Udp::Connect(SocketHandle &aSocket, const SockAddr &aSockAddr)\n{\n    otError error = OT_ERROR_NONE;\n\n    aSocket.mPeerName = aSockAddr;\n\n    if (!aSocket.IsBound())\n    {\n        SuccessOrExit(error = Bind(aSocket, aSocket.GetSockName()));\n    }\n\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n    if (!IsMlePort(aSocket.mSockName.mPort))\n    {\n        error = otPlatUdpConnect(&aSocket);\n    }\n#endif\n\nexit:\n    return error;\n}\n\notError Udp::Close(SocketHandle &aSocket)\n{\n    otError error = OT_ERROR_NONE;\n\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n    error = otPlatUdpClose(&aSocket);\n#endif\n    SuccessOrExit(error);\n\n    RemoveSocket(aSocket);\n    aSocket.GetSockName().Clear();\n    aSocket.GetPeerName().Clear();\n\nexit:\n    return error;\n}\n\notError Udp::SendTo(SocketHandle &aSocket, Message &aMessage, const MessageInfo &aMessageInfo)\n{\n    otError     error = OT_ERROR_NONE;\n    MessageInfo messageInfoLocal;\n\n    VerifyOrExit((aMessageInfo.GetSockPort() == 0) || (aSocket.GetSockName().mPort == aMessageInfo.GetSockPort()),\n                 error = OT_ERROR_INVALID_ARGS);\n\n    messageInfoLocal = aMessageInfo;\n\n    if (messageInfoLocal.GetPeerAddr().IsUnspecified())\n    {\n        VerifyOrExit(!aSocket.GetPeerName().GetAddress().IsUnspecified(), error = OT_ERROR_INVALID_ARGS);\n\n        messageInfoLocal.SetPeerAddr(aSocket.GetPeerName().GetAddress());\n    }\n\n    if (messageInfoLocal.mPeerPort == 0)\n    {\n        VerifyOrExit(aSocket.GetPeerName().mPort != 0, error = OT_ERROR_INVALID_ARGS);\n        messageInfoLocal.mPeerPort = aSocket.GetPeerName().mPort;\n    }\n\n    if (messageInfoLocal.GetSockAddr().IsUnspecified())\n    {\n        messageInfoLocal.SetSockAddr(aSocket.GetSockName().GetAddress());\n    }\n\n    if (!aSocket.IsBound())\n    {\n        SuccessOrExit(error = Bind(aSocket, aSocket.GetSockName()));\n    }\n\n    messageInfoLocal.SetSockPort(aSocket.GetSockName().mPort);\n\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n    if (!IsMlePort(aSocket.mSockName.mPort) &&\n        !(aSocket.mSockName.mPort == ot::kCoapUdpPort && aMessage.GetSubType() == Message::kSubTypeJoinerEntrust))\n    {\n        SuccessOrExit(error = otPlatUdpSend(&aSocket, &aMessage, &messageInfoLocal));\n    }\n    else\n#endif\n    {\n        SuccessOrExit(error = SendDatagram(aMessage, messageInfoLocal, kProtoUdp));\n    }\n\nexit:\n    return error;\n}\n\nvoid Udp::AddSocket(SocketHandle &aSocket)\n{\n    IgnoreError(mSockets.Add(aSocket));\n}\n\nvoid Udp::RemoveSocket(SocketHandle &aSocket)\n{\n    SuccessOrExit(mSockets.Remove(aSocket));\n    aSocket.SetNext(nullptr);\n\nexit:\n    return;\n}\n\nuint16_t Udp::GetEphemeralPort(void)\n{\n    uint16_t rval = mEphemeralPort;\n\n    if (mEphemeralPort < kDynamicPortMax)\n    {\n        mEphemeralPort++;\n    }\n    else\n    {\n        mEphemeralPort = kDynamicPortMin;\n    }\n\n    return rval;\n}\n\nMessage *Udp::NewMessage(uint16_t aReserved, const Message::Settings &aSettings)\n{\n    return Get<Ip6>().NewMessage(sizeof(Header) + aReserved, aSettings);\n}\n\notError Udp::SendDatagram(Message &aMessage, MessageInfo &aMessageInfo, uint8_t aIpProto)\n{\n    otError error = OT_ERROR_NONE;\n\n#if OPENTHREAD_CONFIG_UDP_FORWARD_ENABLE\n    if (aMessageInfo.IsHostInterface())\n    {\n        VerifyOrExit(mUdpForwarder != nullptr, error = OT_ERROR_NO_ROUTE);\n        mUdpForwarder(&aMessage, aMessageInfo.mPeerPort, &aMessageInfo.GetPeerAddr(), aMessageInfo.mSockPort,\n                      mUdpForwarderContext);\n        \/\/ message is consumed by the callback\n    }\n    else\n#endif\n    {\n        Header udpHeader;\n\n        udpHeader.SetSourcePort(aMessageInfo.mSockPort);\n        udpHeader.SetDestinationPort(aMessageInfo.mPeerPort);\n        udpHeader.SetLength(sizeof(udpHeader) + aMessage.GetLength());\n        udpHeader.SetChecksum(0);\n\n        SuccessOrExit(error = aMessage.Prepend(&udpHeader, sizeof(udpHeader)));\n        aMessage.SetOffset(0);\n\n        error = Get<Ip6>().SendDatagram(aMessage, aMessageInfo, aIpProto);\n    }\n\nexit:\n    return error;\n}\n\notError Udp::HandleMessage(Message &aMessage, MessageInfo &aMessageInfo)\n{\n    otError  error = OT_ERROR_NONE;\n    Header   udpHeader;\n    uint16_t payloadLength;\n    uint16_t checksum;\n\n    payloadLength = aMessage.GetLength() - aMessage.GetOffset();\n\n    \/\/ check length\n    VerifyOrExit(payloadLength >= sizeof(Header), error = OT_ERROR_PARSE);\n\n    \/\/ verify checksum\n    checksum = Ip6::ComputePseudoheaderChecksum(aMessageInfo.GetPeerAddr(), aMessageInfo.GetSockAddr(), payloadLength,\n                                                kProtoUdp);\n    checksum = aMessage.UpdateChecksum(checksum, aMessage.GetOffset(), payloadLength);\n\n#ifndef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION\n    VerifyOrExit(checksum == 0xffff, error = OT_ERROR_DROP);\n#endif\n\n    VerifyOrExit(aMessage.Read(aMessage.GetOffset(), sizeof(udpHeader), &udpHeader) == sizeof(udpHeader),\n                 error = OT_ERROR_PARSE);\n    aMessage.MoveOffset(sizeof(udpHeader));\n    aMessageInfo.mPeerPort = udpHeader.GetSourcePort();\n    aMessageInfo.mSockPort = udpHeader.GetDestinationPort();\n\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n    VerifyOrExit(IsMlePort(aMessageInfo.mSockPort), OT_NOOP);\n#endif\n\n    for (Receiver *receiver = mReceivers.GetHead(); receiver; receiver = receiver->GetNext())\n    {\n        VerifyOrExit(!receiver->HandleMessage(aMessage, aMessageInfo), OT_NOOP);\n    }\n\n    HandlePayload(aMessage, aMessageInfo);\n\nexit:\n    return error;\n}\n\nvoid Udp::HandlePayload(Message &aMessage, MessageInfo &aMessageInfo)\n{\n    SocketHandle *socket;\n    SocketHandle *prev;\n\n    socket = mSockets.FindMatching(aMessageInfo, prev);\n    VerifyOrExit(socket != nullptr, OT_NOOP);\n\n    aMessage.RemoveHeader(aMessage.GetOffset());\n    OT_ASSERT(aMessage.GetOffset() == 0);\n    socket->HandleUdpReceive(aMessage, aMessageInfo);\n\nexit:\n    return;\n}\n\nvoid Udp::UpdateChecksum(Message &aMessage, uint16_t aChecksum)\n{\n    aChecksum = aMessage.UpdateChecksum(aChecksum, aMessage.GetOffset(), aMessage.GetLength() - aMessage.GetOffset());\n\n    if (aChecksum != 0xffff)\n    {\n        aChecksum = ~aChecksum;\n    }\n\n    aChecksum = HostSwap16(aChecksum);\n    aMessage.Write(aMessage.GetOffset() + Header::kChecksumFieldOffset, sizeof(aChecksum), &aChecksum);\n}\n\nbool Udp::IsMlePort(uint16_t aPort) const\n{\n    bool isMlePort = (aPort == Mle::kUdpPort);\n\n#if OPENTHREAD_FTD\n    isMlePort = isMlePort || (aPort == Get<MeshCoP::JoinerRouter>().GetJoinerUdpPort());\n#endif\n\n    return isMlePort;\n}\n\n} \/\/ namespace Ip6\n} \/\/ namespace ot\n<commit_msg>[udp6] fix 'Udp::Socket::Connect(uint16_t aPort)' (#5407)<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 implements UDP\/IPv6 sockets.\n *\/\n\n#include \"udp6.hpp\"\n\n#include <stdio.h>\n\n#include <openthread\/platform\/udp.h>\n\n#include \"common\/code_utils.hpp\"\n#include \"common\/encoding.hpp\"\n#include \"common\/instance.hpp\"\n#include \"common\/locator-getters.hpp\"\n#include \"net\/ip6.hpp\"\n\nusing ot::Encoding::BigEndian::HostSwap16;\n\nnamespace ot {\nnamespace Ip6 {\n\nbool Udp::SocketHandle::Matches(const MessageInfo &aMessageInfo) const\n{\n    bool matches = false;\n\n    VerifyOrExit(GetSockName().mPort == aMessageInfo.GetSockPort(), OT_NOOP);\n\n    VerifyOrExit(aMessageInfo.GetSockAddr().IsMulticast() || GetSockName().GetAddress().IsUnspecified() ||\n                     GetSockName().GetAddress() == aMessageInfo.GetSockAddr(),\n                 OT_NOOP);\n\n    \/\/ Verify source if connected socket\n    if (GetPeerName().mPort != 0)\n    {\n        VerifyOrExit(GetPeerName().mPort == aMessageInfo.GetPeerPort(), OT_NOOP);\n\n        VerifyOrExit(GetPeerName().GetAddress().IsUnspecified() ||\n                         GetPeerName().GetAddress() == aMessageInfo.GetPeerAddr(),\n                     OT_NOOP);\n    }\n\n    matches = true;\n\nexit:\n    return matches;\n}\n\nUdp::Socket::Socket(Instance &aInstance)\n    : InstanceLocator(aInstance)\n{\n    mHandle = nullptr;\n}\n\nMessage *Udp::Socket::NewMessage(uint16_t aReserved, const Message::Settings &aSettings)\n{\n    return Get<Udp>().NewMessage(aReserved, aSettings);\n}\n\notError Udp::Socket::Open(otUdpReceive aHandler, void *aContext)\n{\n    return Get<Udp>().Open(*this, aHandler, aContext);\n}\n\notError Udp::Socket::Bind(const SockAddr &aSockAddr)\n{\n    return Get<Udp>().Bind(*this, aSockAddr);\n}\n\notError Udp::Socket::Bind(uint16_t aPort)\n{\n    return Bind(SockAddr(aPort));\n}\n\notError Udp::Socket::Connect(const SockAddr &aSockAddr)\n{\n    return Get<Udp>().Connect(*this, aSockAddr);\n}\n\notError Udp::Socket::Connect(uint16_t aPort)\n{\n    return Connect(SockAddr(aPort));\n}\n\notError Udp::Socket::Close(void)\n{\n    return Get<Udp>().Close(*this);\n}\n\notError Udp::Socket::SendTo(Message &aMessage, const MessageInfo &aMessageInfo)\n{\n    return Get<Udp>().SendTo(*this, aMessage, aMessageInfo);\n}\n\nUdp::Udp(Instance &aInstance)\n    : InstanceLocator(aInstance)\n    , mEphemeralPort(kDynamicPortMin)\n    , mReceivers()\n    , mSockets()\n#if OPENTHREAD_CONFIG_UDP_FORWARD_ENABLE\n    , mUdpForwarderContext(nullptr)\n    , mUdpForwarder(nullptr)\n#endif\n{\n}\n\notError Udp::AddReceiver(Receiver &aReceiver)\n{\n    return mReceivers.Add(aReceiver);\n}\n\notError Udp::RemoveReceiver(Receiver &aReceiver)\n{\n    otError error;\n\n    SuccessOrExit(error = mReceivers.Remove(aReceiver));\n    aReceiver.SetNext(nullptr);\n\nexit:\n    return error;\n}\n\notError Udp::Open(SocketHandle &aSocket, otUdpReceive aHandler, void *aContext)\n{\n    otError error = OT_ERROR_NONE;\n\n    aSocket.GetSockName().Clear();\n    aSocket.GetPeerName().Clear();\n    aSocket.mHandler = aHandler;\n    aSocket.mContext = aContext;\n\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n    error = otPlatUdpSocket(&aSocket);\n#endif\n    SuccessOrExit(error);\n\n    AddSocket(aSocket);\n\nexit:\n    return error;\n}\n\notError Udp::Bind(SocketHandle &aSocket, const SockAddr &aSockAddr)\n{\n    otError error = OT_ERROR_NONE;\n\n    aSocket.mSockName = aSockAddr;\n\n    if (!aSocket.IsBound())\n    {\n        do\n        {\n            aSocket.mSockName.mPort = GetEphemeralPort();\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n            error = otPlatUdpBind(&aSocket);\n#endif\n        } while (error != OT_ERROR_NONE);\n    }\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n    else if (!IsMlePort(aSocket.mSockName.mPort))\n    {\n        error = otPlatUdpBind(&aSocket);\n    }\n#endif\n\n    return error;\n}\n\notError Udp::Connect(SocketHandle &aSocket, const SockAddr &aSockAddr)\n{\n    otError error = OT_ERROR_NONE;\n\n    aSocket.mPeerName = aSockAddr;\n\n    if (!aSocket.IsBound())\n    {\n        SuccessOrExit(error = Bind(aSocket, aSocket.GetSockName()));\n    }\n\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n    if (!IsMlePort(aSocket.mSockName.mPort))\n    {\n        error = otPlatUdpConnect(&aSocket);\n    }\n#endif\n\nexit:\n    return error;\n}\n\notError Udp::Close(SocketHandle &aSocket)\n{\n    otError error = OT_ERROR_NONE;\n\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n    error = otPlatUdpClose(&aSocket);\n#endif\n    SuccessOrExit(error);\n\n    RemoveSocket(aSocket);\n    aSocket.GetSockName().Clear();\n    aSocket.GetPeerName().Clear();\n\nexit:\n    return error;\n}\n\notError Udp::SendTo(SocketHandle &aSocket, Message &aMessage, const MessageInfo &aMessageInfo)\n{\n    otError     error = OT_ERROR_NONE;\n    MessageInfo messageInfoLocal;\n\n    VerifyOrExit((aMessageInfo.GetSockPort() == 0) || (aSocket.GetSockName().mPort == aMessageInfo.GetSockPort()),\n                 error = OT_ERROR_INVALID_ARGS);\n\n    messageInfoLocal = aMessageInfo;\n\n    if (messageInfoLocal.GetPeerAddr().IsUnspecified())\n    {\n        VerifyOrExit(!aSocket.GetPeerName().GetAddress().IsUnspecified(), error = OT_ERROR_INVALID_ARGS);\n\n        messageInfoLocal.SetPeerAddr(aSocket.GetPeerName().GetAddress());\n    }\n\n    if (messageInfoLocal.mPeerPort == 0)\n    {\n        VerifyOrExit(aSocket.GetPeerName().mPort != 0, error = OT_ERROR_INVALID_ARGS);\n        messageInfoLocal.mPeerPort = aSocket.GetPeerName().mPort;\n    }\n\n    if (messageInfoLocal.GetSockAddr().IsUnspecified())\n    {\n        messageInfoLocal.SetSockAddr(aSocket.GetSockName().GetAddress());\n    }\n\n    if (!aSocket.IsBound())\n    {\n        SuccessOrExit(error = Bind(aSocket, aSocket.GetSockName()));\n    }\n\n    messageInfoLocal.SetSockPort(aSocket.GetSockName().mPort);\n\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n    if (!IsMlePort(aSocket.mSockName.mPort) &&\n        !(aSocket.mSockName.mPort == ot::kCoapUdpPort && aMessage.GetSubType() == Message::kSubTypeJoinerEntrust))\n    {\n        SuccessOrExit(error = otPlatUdpSend(&aSocket, &aMessage, &messageInfoLocal));\n    }\n    else\n#endif\n    {\n        SuccessOrExit(error = SendDatagram(aMessage, messageInfoLocal, kProtoUdp));\n    }\n\nexit:\n    return error;\n}\n\nvoid Udp::AddSocket(SocketHandle &aSocket)\n{\n    IgnoreError(mSockets.Add(aSocket));\n}\n\nvoid Udp::RemoveSocket(SocketHandle &aSocket)\n{\n    SuccessOrExit(mSockets.Remove(aSocket));\n    aSocket.SetNext(nullptr);\n\nexit:\n    return;\n}\n\nuint16_t Udp::GetEphemeralPort(void)\n{\n    uint16_t rval = mEphemeralPort;\n\n    if (mEphemeralPort < kDynamicPortMax)\n    {\n        mEphemeralPort++;\n    }\n    else\n    {\n        mEphemeralPort = kDynamicPortMin;\n    }\n\n    return rval;\n}\n\nMessage *Udp::NewMessage(uint16_t aReserved, const Message::Settings &aSettings)\n{\n    return Get<Ip6>().NewMessage(sizeof(Header) + aReserved, aSettings);\n}\n\notError Udp::SendDatagram(Message &aMessage, MessageInfo &aMessageInfo, uint8_t aIpProto)\n{\n    otError error = OT_ERROR_NONE;\n\n#if OPENTHREAD_CONFIG_UDP_FORWARD_ENABLE\n    if (aMessageInfo.IsHostInterface())\n    {\n        VerifyOrExit(mUdpForwarder != nullptr, error = OT_ERROR_NO_ROUTE);\n        mUdpForwarder(&aMessage, aMessageInfo.mPeerPort, &aMessageInfo.GetPeerAddr(), aMessageInfo.mSockPort,\n                      mUdpForwarderContext);\n        \/\/ message is consumed by the callback\n    }\n    else\n#endif\n    {\n        Header udpHeader;\n\n        udpHeader.SetSourcePort(aMessageInfo.mSockPort);\n        udpHeader.SetDestinationPort(aMessageInfo.mPeerPort);\n        udpHeader.SetLength(sizeof(udpHeader) + aMessage.GetLength());\n        udpHeader.SetChecksum(0);\n\n        SuccessOrExit(error = aMessage.Prepend(&udpHeader, sizeof(udpHeader)));\n        aMessage.SetOffset(0);\n\n        error = Get<Ip6>().SendDatagram(aMessage, aMessageInfo, aIpProto);\n    }\n\nexit:\n    return error;\n}\n\notError Udp::HandleMessage(Message &aMessage, MessageInfo &aMessageInfo)\n{\n    otError  error = OT_ERROR_NONE;\n    Header   udpHeader;\n    uint16_t payloadLength;\n    uint16_t checksum;\n\n    payloadLength = aMessage.GetLength() - aMessage.GetOffset();\n\n    \/\/ check length\n    VerifyOrExit(payloadLength >= sizeof(Header), error = OT_ERROR_PARSE);\n\n    \/\/ verify checksum\n    checksum = Ip6::ComputePseudoheaderChecksum(aMessageInfo.GetPeerAddr(), aMessageInfo.GetSockAddr(), payloadLength,\n                                                kProtoUdp);\n    checksum = aMessage.UpdateChecksum(checksum, aMessage.GetOffset(), payloadLength);\n\n#ifndef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION\n    VerifyOrExit(checksum == 0xffff, error = OT_ERROR_DROP);\n#endif\n\n    VerifyOrExit(aMessage.Read(aMessage.GetOffset(), sizeof(udpHeader), &udpHeader) == sizeof(udpHeader),\n                 error = OT_ERROR_PARSE);\n    aMessage.MoveOffset(sizeof(udpHeader));\n    aMessageInfo.mPeerPort = udpHeader.GetSourcePort();\n    aMessageInfo.mSockPort = udpHeader.GetDestinationPort();\n\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n    VerifyOrExit(IsMlePort(aMessageInfo.mSockPort), OT_NOOP);\n#endif\n\n    for (Receiver *receiver = mReceivers.GetHead(); receiver; receiver = receiver->GetNext())\n    {\n        VerifyOrExit(!receiver->HandleMessage(aMessage, aMessageInfo), OT_NOOP);\n    }\n\n    HandlePayload(aMessage, aMessageInfo);\n\nexit:\n    return error;\n}\n\nvoid Udp::HandlePayload(Message &aMessage, MessageInfo &aMessageInfo)\n{\n    SocketHandle *socket;\n    SocketHandle *prev;\n\n    socket = mSockets.FindMatching(aMessageInfo, prev);\n    VerifyOrExit(socket != nullptr, OT_NOOP);\n\n    aMessage.RemoveHeader(aMessage.GetOffset());\n    OT_ASSERT(aMessage.GetOffset() == 0);\n    socket->HandleUdpReceive(aMessage, aMessageInfo);\n\nexit:\n    return;\n}\n\nvoid Udp::UpdateChecksum(Message &aMessage, uint16_t aChecksum)\n{\n    aChecksum = aMessage.UpdateChecksum(aChecksum, aMessage.GetOffset(), aMessage.GetLength() - aMessage.GetOffset());\n\n    if (aChecksum != 0xffff)\n    {\n        aChecksum = ~aChecksum;\n    }\n\n    aChecksum = HostSwap16(aChecksum);\n    aMessage.Write(aMessage.GetOffset() + Header::kChecksumFieldOffset, sizeof(aChecksum), &aChecksum);\n}\n\nbool Udp::IsMlePort(uint16_t aPort) const\n{\n    bool isMlePort = (aPort == Mle::kUdpPort);\n\n#if OPENTHREAD_FTD\n    isMlePort = isMlePort || (aPort == Get<MeshCoP::JoinerRouter>().GetJoinerUdpPort());\n#endif\n\n    return isMlePort;\n}\n\n} \/\/ namespace Ip6\n} \/\/ namespace ot\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 implements UDP\/IPv6 sockets.\n *\/\n\n#include \"udp6.hpp\"\n\n#include <stdio.h>\n\n#include <openthread\/platform\/udp.h>\n\n#include \"common\/code_utils.hpp\"\n#include \"common\/encoding.hpp\"\n#include \"common\/instance.hpp\"\n#include \"common\/locator-getters.hpp\"\n#include \"net\/ip6.hpp\"\n\nusing ot::Encoding::BigEndian::HostSwap16;\n\nnamespace ot {\nnamespace Ip6 {\n\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\nstatic bool IsMle(Instance &aInstance, uint16_t aPort)\n{\n#if OPENTHREAD_FTD\n    return aPort == ot::Mle::kUdpPort || aPort == aInstance.Get<MeshCoP::JoinerRouter>().GetJoinerUdpPort();\n#else\n    return aPort == ot::Mle::kUdpPort;\n#endif\n}\n#endif\n\nUdpSocket::UdpSocket(Udp &aUdp)\n    : InstanceLocator(aUdp.GetInstance())\n{\n    mHandle = NULL;\n}\n\nMessage *UdpSocket::NewMessage(uint16_t aReserved, const otMessageSettings *aSettings)\n{\n    return Get<Udp>().NewMessage(aReserved, aSettings);\n}\n\notError UdpSocket::Open(otUdpReceive aHandler, void *aContext)\n{\n    otError error = OT_ERROR_NONE;\n\n    memset(&mSockName, 0, sizeof(mSockName));\n    memset(&mPeerName, 0, sizeof(mPeerName));\n    mHandler = aHandler;\n    mContext = aContext;\n\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n    SuccessOrExit(error = otPlatUdpSocket(this));\n#endif\n\n    Get<Udp>().AddSocket(*this);\n\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\nexit:\n#endif\n    return error;\n}\n\notError UdpSocket::Bind(const SockAddr &aSockAddr)\n{\n    otError error = OT_ERROR_NONE;\n\n    mSockName = aSockAddr;\n\n    if (!IsBound())\n    {\n        do\n        {\n            mSockName.mPort = Get<Udp>().GetEphemeralPort();\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n            error = otPlatUdpBind(this);\n#endif\n        } while (error != OT_ERROR_NONE);\n    }\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n    else if (!IsMle(GetInstance(), mSockName.mPort))\n    {\n        error = otPlatUdpBind(this);\n    }\n#endif\n\n    return error;\n}\n\notError UdpSocket::Connect(const SockAddr &aSockAddr)\n{\n    otError error = OT_ERROR_NONE;\n\n    mPeerName = aSockAddr;\n\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n    if (!IsMle(GetInstance(), mSockName.mPort))\n    {\n        error = otPlatUdpConnect(this);\n    }\n#endif\n    return error;\n}\n\notError UdpSocket::Close(void)\n{\n    otError error = OT_ERROR_NONE;\n\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n    SuccessOrExit(error = otPlatUdpClose(this));\n#endif\n\n    Get<Udp>().RemoveSocket(*this);\n    memset(&mSockName, 0, sizeof(mSockName));\n    memset(&mPeerName, 0, sizeof(mPeerName));\n\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\nexit:\n#endif\n    return error;\n}\n\notError UdpSocket::SendTo(Message &aMessage, const MessageInfo &aMessageInfo)\n{\n    otError     error = OT_ERROR_NONE;\n    MessageInfo messageInfoLocal;\n\n    VerifyOrExit((aMessageInfo.GetSockPort() == 0) || (GetSockName().mPort == aMessageInfo.GetSockPort()),\n                 error = OT_ERROR_INVALID_ARGS);\n\n    messageInfoLocal = aMessageInfo;\n\n    if (messageInfoLocal.GetPeerAddr().IsUnspecified())\n    {\n        VerifyOrExit(!GetPeerName().GetAddress().IsUnspecified(), error = OT_ERROR_INVALID_ARGS);\n\n        messageInfoLocal.SetPeerAddr(GetPeerName().GetAddress());\n    }\n\n    if (messageInfoLocal.mPeerPort == 0)\n    {\n        VerifyOrExit(GetPeerName().mPort != 0, error = OT_ERROR_INVALID_ARGS);\n        messageInfoLocal.mPeerPort = GetPeerName().mPort;\n    }\n\n    if (messageInfoLocal.GetSockAddr().IsUnspecified())\n    {\n        messageInfoLocal.SetSockAddr(GetSockName().GetAddress());\n    }\n\n    if (!IsBound())\n    {\n        SuccessOrExit(error = Bind(GetSockName()));\n    }\n\n    messageInfoLocal.SetSockPort(GetSockName().mPort);\n\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n    if (!IsMle(GetInstance(), mSockName.mPort) &&\n        !(mSockName.mPort == ot::kCoapUdpPort && aMessage.GetSubType() == Message::kSubTypeJoinerEntrust))\n    {\n        SuccessOrExit(error = otPlatUdpSend(this, &aMessage, &messageInfoLocal));\n    }\n    else\n#endif\n    {\n        SuccessOrExit(error = Get<Udp>().SendDatagram(aMessage, messageInfoLocal, kProtoUdp));\n    }\n\nexit:\n    return error;\n}\n\nUdp::Udp(Instance &aInstance)\n    : InstanceLocator(aInstance)\n    , mEphemeralPort(kDynamicPortMin)\n    , mReceivers(NULL)\n    , mSockets(NULL)\n#if OPENTHREAD_CONFIG_UDP_FORWARD_ENABLE\n    , mUdpForwarderContext(NULL)\n    , mUdpForwarder(NULL)\n#endif\n{\n}\n\notError Udp::AddReceiver(UdpReceiver &aReceiver)\n{\n    otError error = OT_ERROR_NONE;\n\n    for (UdpReceiver *cur = mReceivers; cur; cur = cur->GetNext())\n    {\n        if (cur == &aReceiver)\n        {\n            ExitNow(error = OT_ERROR_ALREADY);\n        }\n    }\n\n    aReceiver.SetNext(mReceivers);\n    mReceivers = &aReceiver;\n\nexit:\n    return error;\n}\n\notError Udp::RemoveReceiver(UdpReceiver &aReceiver)\n{\n    otError error = OT_ERROR_NOT_FOUND;\n\n    if (mReceivers == &aReceiver)\n    {\n        mReceivers = mReceivers->GetNext();\n        aReceiver.SetNext(NULL);\n        error = OT_ERROR_NONE;\n    }\n    else\n    {\n        for (UdpReceiver *handler = mReceivers; handler; handler = handler->GetNext())\n        {\n            if (handler->GetNext() == &aReceiver)\n            {\n                handler->SetNext(aReceiver.GetNext());\n                aReceiver.SetNext(NULL);\n                error = OT_ERROR_NONE;\n                break;\n            }\n        }\n    }\n\n    return error;\n}\n\nvoid Udp::AddSocket(UdpSocket &aSocket)\n{\n    for (UdpSocket *cur = mSockets; cur; cur = cur->GetNext())\n    {\n        if (cur == &aSocket)\n        {\n            ExitNow();\n        }\n    }\n\n    aSocket.SetNext(mSockets);\n    mSockets = &aSocket;\n\nexit:\n    return;\n}\n\nvoid Udp::RemoveSocket(UdpSocket &aSocket)\n{\n    if (mSockets == &aSocket)\n    {\n        mSockets = mSockets->GetNext();\n    }\n    else\n    {\n        for (UdpSocket *socket = mSockets; socket; socket = socket->GetNext())\n        {\n            if (socket->GetNext() == &aSocket)\n            {\n                socket->SetNext(aSocket.GetNext());\n                break;\n            }\n        }\n    }\n\n    aSocket.SetNext(NULL);\n}\n\nuint16_t Udp::GetEphemeralPort(void)\n{\n    uint16_t rval = mEphemeralPort;\n\n    if (mEphemeralPort < kDynamicPortMax)\n    {\n        mEphemeralPort++;\n    }\n    else\n    {\n        mEphemeralPort = kDynamicPortMin;\n    }\n\n    return rval;\n}\n\nMessage *Udp::NewMessage(uint16_t aReserved, const otMessageSettings *aSettings)\n{\n    return Get<Ip6>().NewMessage(sizeof(UdpHeader) + aReserved, aSettings);\n}\n\notError Udp::SendDatagram(Message &aMessage, MessageInfo &aMessageInfo, IpProto aIpProto)\n{\n    otError error = OT_ERROR_NONE;\n\n#if OPENTHREAD_CONFIG_UDP_FORWARD_ENABLE\n    if (aMessageInfo.IsHostInterface())\n    {\n        VerifyOrExit(mUdpForwarder != NULL, error = OT_ERROR_NO_ROUTE);\n        mUdpForwarder(&aMessage, aMessageInfo.mPeerPort, &aMessageInfo.GetPeerAddr(), aMessageInfo.mSockPort,\n                      mUdpForwarderContext);\n        \/\/ message is consumed by the callback\n    }\n    else\n#endif\n    {\n        UdpHeader udpHeader;\n\n        udpHeader.SetSourcePort(aMessageInfo.mSockPort);\n        udpHeader.SetDestinationPort(aMessageInfo.mPeerPort);\n        udpHeader.SetLength(sizeof(udpHeader) + aMessage.GetLength());\n        udpHeader.SetChecksum(0);\n\n        SuccessOrExit(error = aMessage.Prepend(&udpHeader, sizeof(udpHeader)));\n        aMessage.SetOffset(0);\n\n        error = Get<Ip6>().SendDatagram(aMessage, aMessageInfo, aIpProto);\n    }\n\nexit:\n    return error;\n}\n\notError Udp::HandleMessage(Message &aMessage, MessageInfo &aMessageInfo)\n{\n    otError   error = OT_ERROR_NONE;\n    UdpHeader udpHeader;\n    uint16_t  payloadLength;\n    uint16_t  checksum;\n\n    payloadLength = aMessage.GetLength() - aMessage.GetOffset();\n\n    \/\/ check length\n    VerifyOrExit(payloadLength >= sizeof(UdpHeader), error = OT_ERROR_PARSE);\n\n    \/\/ verify checksum\n    checksum = Ip6::ComputePseudoheaderChecksum(aMessageInfo.GetPeerAddr(), aMessageInfo.GetSockAddr(), payloadLength,\n                                                kProtoUdp);\n    checksum = aMessage.UpdateChecksum(checksum, aMessage.GetOffset(), payloadLength);\n\n#ifndef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION\n    VerifyOrExit(checksum == 0xffff, error = OT_ERROR_DROP);\n#endif\n\n    VerifyOrExit(aMessage.Read(aMessage.GetOffset(), sizeof(udpHeader), &udpHeader) == sizeof(udpHeader),\n                 error = OT_ERROR_PARSE);\n    aMessage.MoveOffset(sizeof(udpHeader));\n    aMessageInfo.mPeerPort = udpHeader.GetSourcePort();\n    aMessageInfo.mSockPort = udpHeader.GetDestinationPort();\n\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n    VerifyOrExit(IsMle(GetInstance(), aMessageInfo.mSockPort));\n#endif\n\n    for (UdpReceiver *receiver = mReceivers; receiver; receiver = receiver->GetNext())\n    {\n        VerifyOrExit(!receiver->HandleMessage(aMessage, aMessageInfo));\n    }\n\n    HandlePayload(aMessage, aMessageInfo);\n\nexit:\n    return error;\n}\n\nvoid Udp::HandlePayload(Message &aMessage, MessageInfo &aMessageInfo)\n{\n    \/\/ find socket\n    for (UdpSocket *socket = mSockets; socket; socket = socket->GetNext())\n    {\n        if (socket->GetSockName().mPort != aMessageInfo.GetSockPort())\n        {\n            continue;\n        }\n\n        if (!aMessageInfo.GetSockAddr().IsMulticast() && !socket->GetSockName().GetAddress().IsUnspecified() &&\n            socket->GetSockName().GetAddress() != aMessageInfo.GetSockAddr())\n        {\n            continue;\n        }\n\n        \/\/ verify source if connected socket\n        if (socket->GetPeerName().mPort != 0)\n        {\n            if (socket->GetPeerName().mPort != aMessageInfo.GetPeerPort())\n            {\n                continue;\n            }\n\n            if (!socket->GetPeerName().GetAddress().IsUnspecified() &&\n                socket->GetPeerName().GetAddress() != aMessageInfo.GetPeerAddr())\n            {\n                continue;\n            }\n        }\n\n        aMessage.RemoveHeader(aMessage.GetOffset());\n        assert(aMessage.GetOffset() == 0);\n        socket->HandleUdpReceive(aMessage, aMessageInfo);\n        break;\n    }\n}\n\nvoid Udp::UpdateChecksum(Message &aMessage, uint16_t aChecksum)\n{\n    aChecksum = aMessage.UpdateChecksum(aChecksum, aMessage.GetOffset(), aMessage.GetLength() - aMessage.GetOffset());\n\n    if (aChecksum != 0xffff)\n    {\n        aChecksum = ~aChecksum;\n    }\n\n    aChecksum = HostSwap16(aChecksum);\n    aMessage.Write(aMessage.GetOffset() + UdpHeader::GetChecksumOffset(), sizeof(aChecksum), &aChecksum);\n}\n\n} \/\/ namespace Ip6\n} \/\/ namespace ot\n<commit_msg>[udp] suppress warning of unused parameter (#4228)<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 implements UDP\/IPv6 sockets.\n *\/\n\n#include \"udp6.hpp\"\n\n#include <stdio.h>\n\n#include <openthread\/platform\/udp.h>\n\n#include \"common\/code_utils.hpp\"\n#include \"common\/encoding.hpp\"\n#include \"common\/instance.hpp\"\n#include \"common\/locator-getters.hpp\"\n#include \"net\/ip6.hpp\"\n\nusing ot::Encoding::BigEndian::HostSwap16;\n\nnamespace ot {\nnamespace Ip6 {\n\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\nstatic bool IsMle(Instance &aInstance, uint16_t aPort)\n{\n#if OPENTHREAD_FTD\n    return aPort == ot::Mle::kUdpPort || aPort == aInstance.Get<MeshCoP::JoinerRouter>().GetJoinerUdpPort();\n#else\n    OT_UNUSED_VARIABLE(aInstance);\n    return aPort == ot::Mle::kUdpPort;\n#endif\n}\n#endif\n\nUdpSocket::UdpSocket(Udp &aUdp)\n    : InstanceLocator(aUdp.GetInstance())\n{\n    mHandle = NULL;\n}\n\nMessage *UdpSocket::NewMessage(uint16_t aReserved, const otMessageSettings *aSettings)\n{\n    return Get<Udp>().NewMessage(aReserved, aSettings);\n}\n\notError UdpSocket::Open(otUdpReceive aHandler, void *aContext)\n{\n    otError error = OT_ERROR_NONE;\n\n    memset(&mSockName, 0, sizeof(mSockName));\n    memset(&mPeerName, 0, sizeof(mPeerName));\n    mHandler = aHandler;\n    mContext = aContext;\n\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n    SuccessOrExit(error = otPlatUdpSocket(this));\n#endif\n\n    Get<Udp>().AddSocket(*this);\n\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\nexit:\n#endif\n    return error;\n}\n\notError UdpSocket::Bind(const SockAddr &aSockAddr)\n{\n    otError error = OT_ERROR_NONE;\n\n    mSockName = aSockAddr;\n\n    if (!IsBound())\n    {\n        do\n        {\n            mSockName.mPort = Get<Udp>().GetEphemeralPort();\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n            error = otPlatUdpBind(this);\n#endif\n        } while (error != OT_ERROR_NONE);\n    }\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n    else if (!IsMle(GetInstance(), mSockName.mPort))\n    {\n        error = otPlatUdpBind(this);\n    }\n#endif\n\n    return error;\n}\n\notError UdpSocket::Connect(const SockAddr &aSockAddr)\n{\n    otError error = OT_ERROR_NONE;\n\n    mPeerName = aSockAddr;\n\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n    if (!IsMle(GetInstance(), mSockName.mPort))\n    {\n        error = otPlatUdpConnect(this);\n    }\n#endif\n    return error;\n}\n\notError UdpSocket::Close(void)\n{\n    otError error = OT_ERROR_NONE;\n\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n    SuccessOrExit(error = otPlatUdpClose(this));\n#endif\n\n    Get<Udp>().RemoveSocket(*this);\n    memset(&mSockName, 0, sizeof(mSockName));\n    memset(&mPeerName, 0, sizeof(mPeerName));\n\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\nexit:\n#endif\n    return error;\n}\n\notError UdpSocket::SendTo(Message &aMessage, const MessageInfo &aMessageInfo)\n{\n    otError     error = OT_ERROR_NONE;\n    MessageInfo messageInfoLocal;\n\n    VerifyOrExit((aMessageInfo.GetSockPort() == 0) || (GetSockName().mPort == aMessageInfo.GetSockPort()),\n                 error = OT_ERROR_INVALID_ARGS);\n\n    messageInfoLocal = aMessageInfo;\n\n    if (messageInfoLocal.GetPeerAddr().IsUnspecified())\n    {\n        VerifyOrExit(!GetPeerName().GetAddress().IsUnspecified(), error = OT_ERROR_INVALID_ARGS);\n\n        messageInfoLocal.SetPeerAddr(GetPeerName().GetAddress());\n    }\n\n    if (messageInfoLocal.mPeerPort == 0)\n    {\n        VerifyOrExit(GetPeerName().mPort != 0, error = OT_ERROR_INVALID_ARGS);\n        messageInfoLocal.mPeerPort = GetPeerName().mPort;\n    }\n\n    if (messageInfoLocal.GetSockAddr().IsUnspecified())\n    {\n        messageInfoLocal.SetSockAddr(GetSockName().GetAddress());\n    }\n\n    if (!IsBound())\n    {\n        SuccessOrExit(error = Bind(GetSockName()));\n    }\n\n    messageInfoLocal.SetSockPort(GetSockName().mPort);\n\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n    if (!IsMle(GetInstance(), mSockName.mPort) &&\n        !(mSockName.mPort == ot::kCoapUdpPort && aMessage.GetSubType() == Message::kSubTypeJoinerEntrust))\n    {\n        SuccessOrExit(error = otPlatUdpSend(this, &aMessage, &messageInfoLocal));\n    }\n    else\n#endif\n    {\n        SuccessOrExit(error = Get<Udp>().SendDatagram(aMessage, messageInfoLocal, kProtoUdp));\n    }\n\nexit:\n    return error;\n}\n\nUdp::Udp(Instance &aInstance)\n    : InstanceLocator(aInstance)\n    , mEphemeralPort(kDynamicPortMin)\n    , mReceivers(NULL)\n    , mSockets(NULL)\n#if OPENTHREAD_CONFIG_UDP_FORWARD_ENABLE\n    , mUdpForwarderContext(NULL)\n    , mUdpForwarder(NULL)\n#endif\n{\n}\n\notError Udp::AddReceiver(UdpReceiver &aReceiver)\n{\n    otError error = OT_ERROR_NONE;\n\n    for (UdpReceiver *cur = mReceivers; cur; cur = cur->GetNext())\n    {\n        if (cur == &aReceiver)\n        {\n            ExitNow(error = OT_ERROR_ALREADY);\n        }\n    }\n\n    aReceiver.SetNext(mReceivers);\n    mReceivers = &aReceiver;\n\nexit:\n    return error;\n}\n\notError Udp::RemoveReceiver(UdpReceiver &aReceiver)\n{\n    otError error = OT_ERROR_NOT_FOUND;\n\n    if (mReceivers == &aReceiver)\n    {\n        mReceivers = mReceivers->GetNext();\n        aReceiver.SetNext(NULL);\n        error = OT_ERROR_NONE;\n    }\n    else\n    {\n        for (UdpReceiver *handler = mReceivers; handler; handler = handler->GetNext())\n        {\n            if (handler->GetNext() == &aReceiver)\n            {\n                handler->SetNext(aReceiver.GetNext());\n                aReceiver.SetNext(NULL);\n                error = OT_ERROR_NONE;\n                break;\n            }\n        }\n    }\n\n    return error;\n}\n\nvoid Udp::AddSocket(UdpSocket &aSocket)\n{\n    for (UdpSocket *cur = mSockets; cur; cur = cur->GetNext())\n    {\n        if (cur == &aSocket)\n        {\n            ExitNow();\n        }\n    }\n\n    aSocket.SetNext(mSockets);\n    mSockets = &aSocket;\n\nexit:\n    return;\n}\n\nvoid Udp::RemoveSocket(UdpSocket &aSocket)\n{\n    if (mSockets == &aSocket)\n    {\n        mSockets = mSockets->GetNext();\n    }\n    else\n    {\n        for (UdpSocket *socket = mSockets; socket; socket = socket->GetNext())\n        {\n            if (socket->GetNext() == &aSocket)\n            {\n                socket->SetNext(aSocket.GetNext());\n                break;\n            }\n        }\n    }\n\n    aSocket.SetNext(NULL);\n}\n\nuint16_t Udp::GetEphemeralPort(void)\n{\n    uint16_t rval = mEphemeralPort;\n\n    if (mEphemeralPort < kDynamicPortMax)\n    {\n        mEphemeralPort++;\n    }\n    else\n    {\n        mEphemeralPort = kDynamicPortMin;\n    }\n\n    return rval;\n}\n\nMessage *Udp::NewMessage(uint16_t aReserved, const otMessageSettings *aSettings)\n{\n    return Get<Ip6>().NewMessage(sizeof(UdpHeader) + aReserved, aSettings);\n}\n\notError Udp::SendDatagram(Message &aMessage, MessageInfo &aMessageInfo, IpProto aIpProto)\n{\n    otError error = OT_ERROR_NONE;\n\n#if OPENTHREAD_CONFIG_UDP_FORWARD_ENABLE\n    if (aMessageInfo.IsHostInterface())\n    {\n        VerifyOrExit(mUdpForwarder != NULL, error = OT_ERROR_NO_ROUTE);\n        mUdpForwarder(&aMessage, aMessageInfo.mPeerPort, &aMessageInfo.GetPeerAddr(), aMessageInfo.mSockPort,\n                      mUdpForwarderContext);\n        \/\/ message is consumed by the callback\n    }\n    else\n#endif\n    {\n        UdpHeader udpHeader;\n\n        udpHeader.SetSourcePort(aMessageInfo.mSockPort);\n        udpHeader.SetDestinationPort(aMessageInfo.mPeerPort);\n        udpHeader.SetLength(sizeof(udpHeader) + aMessage.GetLength());\n        udpHeader.SetChecksum(0);\n\n        SuccessOrExit(error = aMessage.Prepend(&udpHeader, sizeof(udpHeader)));\n        aMessage.SetOffset(0);\n\n        error = Get<Ip6>().SendDatagram(aMessage, aMessageInfo, aIpProto);\n    }\n\nexit:\n    return error;\n}\n\notError Udp::HandleMessage(Message &aMessage, MessageInfo &aMessageInfo)\n{\n    otError   error = OT_ERROR_NONE;\n    UdpHeader udpHeader;\n    uint16_t  payloadLength;\n    uint16_t  checksum;\n\n    payloadLength = aMessage.GetLength() - aMessage.GetOffset();\n\n    \/\/ check length\n    VerifyOrExit(payloadLength >= sizeof(UdpHeader), error = OT_ERROR_PARSE);\n\n    \/\/ verify checksum\n    checksum = Ip6::ComputePseudoheaderChecksum(aMessageInfo.GetPeerAddr(), aMessageInfo.GetSockAddr(), payloadLength,\n                                                kProtoUdp);\n    checksum = aMessage.UpdateChecksum(checksum, aMessage.GetOffset(), payloadLength);\n\n#ifndef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION\n    VerifyOrExit(checksum == 0xffff, error = OT_ERROR_DROP);\n#endif\n\n    VerifyOrExit(aMessage.Read(aMessage.GetOffset(), sizeof(udpHeader), &udpHeader) == sizeof(udpHeader),\n                 error = OT_ERROR_PARSE);\n    aMessage.MoveOffset(sizeof(udpHeader));\n    aMessageInfo.mPeerPort = udpHeader.GetSourcePort();\n    aMessageInfo.mSockPort = udpHeader.GetDestinationPort();\n\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n    VerifyOrExit(IsMle(GetInstance(), aMessageInfo.mSockPort));\n#endif\n\n    for (UdpReceiver *receiver = mReceivers; receiver; receiver = receiver->GetNext())\n    {\n        VerifyOrExit(!receiver->HandleMessage(aMessage, aMessageInfo));\n    }\n\n    HandlePayload(aMessage, aMessageInfo);\n\nexit:\n    return error;\n}\n\nvoid Udp::HandlePayload(Message &aMessage, MessageInfo &aMessageInfo)\n{\n    \/\/ find socket\n    for (UdpSocket *socket = mSockets; socket; socket = socket->GetNext())\n    {\n        if (socket->GetSockName().mPort != aMessageInfo.GetSockPort())\n        {\n            continue;\n        }\n\n        if (!aMessageInfo.GetSockAddr().IsMulticast() && !socket->GetSockName().GetAddress().IsUnspecified() &&\n            socket->GetSockName().GetAddress() != aMessageInfo.GetSockAddr())\n        {\n            continue;\n        }\n\n        \/\/ verify source if connected socket\n        if (socket->GetPeerName().mPort != 0)\n        {\n            if (socket->GetPeerName().mPort != aMessageInfo.GetPeerPort())\n            {\n                continue;\n            }\n\n            if (!socket->GetPeerName().GetAddress().IsUnspecified() &&\n                socket->GetPeerName().GetAddress() != aMessageInfo.GetPeerAddr())\n            {\n                continue;\n            }\n        }\n\n        aMessage.RemoveHeader(aMessage.GetOffset());\n        assert(aMessage.GetOffset() == 0);\n        socket->HandleUdpReceive(aMessage, aMessageInfo);\n        break;\n    }\n}\n\nvoid Udp::UpdateChecksum(Message &aMessage, uint16_t aChecksum)\n{\n    aChecksum = aMessage.UpdateChecksum(aChecksum, aMessage.GetOffset(), aMessage.GetLength() - aMessage.GetOffset());\n\n    if (aChecksum != 0xffff)\n    {\n        aChecksum = ~aChecksum;\n    }\n\n    aChecksum = HostSwap16(aChecksum);\n    aMessage.Write(aMessage.GetOffset() + UdpHeader::GetChecksumOffset(), sizeof(aChecksum), &aChecksum);\n}\n\n} \/\/ namespace Ip6\n} \/\/ namespace ot\n<|endoftext|>"}
{"text":"<commit_before>\/\/ -----------------------------------------------------------------------------\n\/\/\n\/\/ Copyright (C) The BioDynaMo Project.\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\/\/\n\/\/ See the LICENSE file distributed with this work for details.\n\/\/ See the NOTICE file distributed with this work for additional information\n\/\/ regarding copyright ownership.\n\/\/\n\/\/ -----------------------------------------------------------------------------\n\n#include <chrono>\n#include <string>\n\n#include \"core\/execution_context\/in_place_exec_ctxt.h\"\n#include \"core\/operation\/bound_space_op.h\"\n#include \"core\/operation\/diffusion_op.h\"\n#include \"core\/operation\/displacement_op.h\"\n#include \"core\/operation\/op_timer.h\"\n#include \"core\/operation\/operation_registry.h\"\n#include \"core\/param\/param.h\"\n#include \"core\/resource_manager.h\"\n#include \"core\/scheduler.h\"\n#include \"core\/simulation.h\"\n#include \"core\/simulation_backup.h\"\n#include \"core\/util\/log.h\"\n#include \"core\/visualization\/root\/adaptor.h\"\n\nnamespace bdm {\n\nScheduler::Scheduler() {\n  auto* param = Simulation::GetActive()->GetParam();\n  backup_ = new SimulationBackup(param->backup_file_, param->restore_file_);\n  if (backup_->RestoreEnabled()) {\n    restore_point_ = backup_->GetSimulationStepsFromBackup();\n  }\n  root_visualization_ = new RootAdaptor();\n\n  \/\/ Operations are scheduled in the following order (sub categorated by their\n  \/\/ operation implementation type, so that actual order may vary)\n  std::vector<std::string> default_ops = {\"update run displacement\",\n                                          \"bound space\",\n                                          \"biology module\",\n                                          \"displacement\",\n                                          \"discretization\",\n                                          \"distribute run displacement info\",\n                                          \"diffusion\"};\n\n  \/\/ Schedule the default operations\n  for (auto& def_op : default_ops) {\n    ScheduleOp(NewOperation(def_op));\n  }\n\n  visualize_op_ = NewOperation(\"visualize\");\n  setup_iteration_op_ = NewOperation(\"set up iteration\");\n  sort_balance_op_ = NewOperation(\"load balancing\");\n  teardown_iteration_op_ = NewOperation(\"tear down iteration\");\n  update_environment_op_ = NewOperation(\"update environment\");\n\n  outstanding_operations_ = {\"load balancing\", \"visualize\"};\n\n  protected_ops_ = {\"update run displacement\", \"biology module\",\n                    \"discretization\", \"distribute run displacment info\"};\n}\n\nScheduler::~Scheduler() {\n  for (auto* op : all_ops_) {\n    delete op;\n  }\n  delete visualize_op_;\n  delete sort_balance_op_;\n  delete update_environment_op_;\n  delete setup_iteration_op_;\n  delete teardown_iteration_op_;\n  delete backup_;\n  delete root_visualization_;\n}\n\nvoid Scheduler::Simulate(uint64_t steps) {\n  if (Restore(&steps)) {\n    return;\n  }\n\n  Initialize();\n  for (unsigned step = 0; step < steps; step++) {\n    Execute();\n\n    total_steps_++;\n    Backup();\n  }\n}\n\nuint64_t Scheduler::GetSimulatedSteps() const { return total_steps_; }\n\nTimingAggregator* Scheduler::GetOpTimes() { return &op_times_; }\n\nvoid Scheduler::ScheduleOp(Operation* op) {\n  all_ops_.push_back(op);\n  ops_to_add_.push_back(op);\n}\n\nvoid Scheduler::UnscheduleOp(Operation* op) {\n  \/\/ We must not unschedule a protected operation\n  if (std::find(protected_ops_.begin(), protected_ops_.end(), op->name_) !=\n      protected_ops_.end()) {\n    Log::Warning(\"Scheduler::UnscheduleOp\",\n                 \"You tried to unschedule the protected operation \", op->name_,\n                 \"! This request was ignored.\");\n    return;\n  }\n\n  \/\/ Check if the requested operation is even scheduled\n  ForAllScheduledOperations([&](Operation* op) {\n    Log::Warning(\"Scheduler::UnscheduleOp\",\n                 \"You tried to unschedule the non-scheduled operation \",\n                 op->name_, \"! This request was ignored.\");\n    return;\n  });\n\n  \/\/ 'Unschedule' outstanding operations\n  if (std::find(outstanding_operations_.begin(), outstanding_operations_.end(),\n                op->name_) != outstanding_operations_.end()) {\n    op->standalone_enabled_ = false;\n  }\n\n  ops_to_remove_.push_back(op);\n}\n\nstd::vector<std::string> Scheduler::GetListOfScheduledSimObjectOps() const {\n  std::vector<std::string> list;\n  for (auto* op : scheduled_sim_object_ops_) {\n    list.push_back(op->name_);\n  }\n  return list;\n}\n\nstd::vector<std::string> Scheduler::GetListOfScheduledStandaloneOps() const {\n  std::vector<std::string> list;\n  for (auto* op : scheduled_standalone_ops_) {\n    list.push_back(op->name_);\n  }\n  return list;\n}\n\nstd::vector<Operation*> Scheduler::GetOps(const std::string& name) {\n  std::vector<Operation*> ret;\n  if (std::find(protected_ops_.begin(), protected_ops_.end(), name) !=\n      protected_ops_.end()) {\n    Log::Warning(\"Scheduler::GetOps\", \"The operation '\", name,\n                 \"' is a protected operation. Request ignored.\");\n    return ret;\n  }\n\n  for (auto it = all_ops_.begin(); it != all_ops_.end(); ++it) {\n    if ((*it)->name_ == name) {\n      ret.push_back(*it);\n    }\n  }\n\n  return ret;\n}\n\nstruct RunAllScheduledOps : Functor<void, SimObject*, SoHandle> {\n  RunAllScheduledOps(std::vector<Operation*>& scheduled_ops)\n      : scheduled_ops_(scheduled_ops) {\n    sim_ = Simulation::GetActive();\n  }\n\n  void operator()(SimObject* so, SoHandle) override {\n    sim_->GetExecutionContext()->Execute(so, scheduled_ops_);\n  }\n\n  Simulation* sim_;\n  std::vector<Operation*>& scheduled_ops_;\n};\n\nvoid Scheduler::SetUpOps() {\n  ForAllScheduledOperations([&](Operation* op) {\n    if (total_steps_ % op->frequency_ == 0) {\n      op->SetUp();\n    }\n  });\n}\n\nvoid Scheduler::TearDownOps() {\n  ForAllScheduledOperations([&](Operation* op) {\n    if (total_steps_ % op->frequency_ == 0) {\n      op->TearDown();\n    }\n  });\n}\n\nvoid Scheduler::RunScheduledOps() {\n  auto* sim = Simulation::GetActive();\n  auto* rm = sim->GetResourceManager();\n  auto* param = sim->GetParam();\n  auto batch_size = param->scheduling_batch_size_;\n\n  \/\/ Run the sim object operations\n  std::vector<Operation*> sim_object_ops;\n  for (auto* op : scheduled_sim_object_ops_) {\n    if (total_steps_ % op->frequency_ == 0) {\n      sim_object_ops.push_back(op);\n    }\n  }\n  RunAllScheduledOps functor(sim_object_ops);\n\n  Timing::Time(\"sim object ops\", [&]() {\n    rm->ApplyOnAllElementsParallelDynamic(batch_size, functor);\n  });\n\n  \/\/ Run the column-wise operations\n  for (auto* op : scheduled_standalone_ops_) {\n    if (total_steps_ % op->frequency_ == 0) {\n      Timing::Time(op->name_, [&]() { (*op)(); });\n    }\n  }\n}\n\nvoid Scheduler::Execute() {\n  ScheduleOps();\n  Timing::Time(setup_iteration_op_->name_, [&]() { (*setup_iteration_op_)(); });\n\n  \/\/ We cannot put sort and balance in the list of scheduled_standalone_ops_,\n  \/\/ because numa-aware data structures would be invalidated:\n  \/\/ ```\n  \/\/  SetUpOps() <-- (1)\n  \/\/  RunScheduledOps() <-- rebalance numa domains\n  \/\/  TearDownOps() <-- indexing with SoHandles are different than at (1)\n  \/\/ ```\n  if (total_steps_ % sort_balance_op_->frequency_ == 0) {\n    Timing::Time(sort_balance_op_->name_, [&]() { (*sort_balance_op_)(); });\n  }\n\n  \/\/ We need to update the environment BEFORE setting up the operations, as\n  \/\/ some operations depend on the grid members to be up to date (e.g. GPU\n  \/\/ displacement operation)\n  Timing::Time(update_environment_op_->name_,\n               [&]() { (*update_environment_op_)(); });\n\n  SetUpOps();\n  RunScheduledOps();\n  TearDownOps();\n\n  Timing::Time(teardown_iteration_op_->name_,\n               [&]() { (*teardown_iteration_op_)(); });\n\n  if (total_steps_ % visualize_op_->frequency_ == 0) {\n    Timing::Time(visualize_op_->name_, [&]() { (*visualize_op_)(); });\n  }\n}\n\nvoid Scheduler::Backup() {\n  using std::chrono::duration_cast;\n  using std::chrono::seconds;\n  auto* param = Simulation::GetActive()->GetParam();\n  if (backup_->BackupEnabled() &&\n      duration_cast<seconds>(Clock::now() - last_backup_).count() >=\n          param->backup_interval_) {\n    last_backup_ = Clock::now();\n    backup_->Backup(total_steps_);\n  }\n}\n\n\/\/\/ Restore the simulation if requested at the right time\n\/\/\/ @param steps number of simulation steps for a `Simulate` call\n\/\/\/ @return if `Simulate` should return early\nbool Scheduler::Restore(uint64_t* steps) {\n  if (backup_->RestoreEnabled() && restore_point_ > total_steps_ + *steps) {\n    total_steps_ += *steps;\n    \/\/ restore requested, but not last backup was not done during this call to\n    \/\/ Simualte. Therefore, we skip it.\n    return true;\n  } else if (backup_->RestoreEnabled() && restore_point_ > total_steps_ &&\n             restore_point_ < total_steps_ + *steps) {\n    \/\/ Restore\n    backup_->Restore();\n    *steps = total_steps_ + *steps - restore_point_;\n    total_steps_ = restore_point_;\n  }\n  return false;\n}\n\n\/\/ TODO(lukas, ahmad) After https:\/\/trello.com\/c\/0D6sHCK4 has been resolved\n\/\/ think about a better solution, because some operations are executed twice\n\/\/ if Simulate is called with one timestep.\nvoid Scheduler::Initialize() {\n  auto* sim = Simulation::GetActive();\n  auto* env = sim->GetEnvironment();\n  auto* rm = sim->GetResourceManager();\n  auto* param = sim->GetParam();\n\n  \/\/ commit all changes\n  const auto& all_exec_ctxts = sim->GetAllExecCtxts();\n  all_exec_ctxts[0]->TearDownIterationAll(all_exec_ctxts);\n\n  if (param->bound_space_) {\n    auto* bound_space = NewOperation(\"bound space\");\n    rm->ApplyOnAllElementsParallel(*bound_space);\n    delete bound_space;\n  }\n  env->Update();\n  int lbound = env->GetDimensionThresholds()[0];\n  int rbound = env->GetDimensionThresholds()[1];\n  rm->ApplyOnAllDiffusionGrids([&](DiffusionGrid* dgrid) {\n    \/\/ Create data structures, whose size depend on the env dimensions\n    dgrid->Initialize({lbound, rbound, lbound, rbound, lbound, rbound});\n    \/\/ Initialize data structures with user-defined values\n    dgrid->RunInitializers();\n  });\n\n  ScheduleOps();\n}\n\n\/\/ Schedule the operations\nvoid Scheduler::ScheduleOps() {\n  auto* param = Simulation::GetActive()->GetParam();\n  \/\/ Add requested operations\n  for (auto it = ops_to_add_.begin(); it != ops_to_add_.end();) {\n    auto* op = *it;\n    \/\/ Enable GPU operation implementations (if available) if CUDA or OpenCL\n    \/\/ flags are set\n    if (param->compute_target_ == \"cuda\" &&\n        op->IsComputeTargetSupported(kCuda)) {\n      op->SelectComputeTarget(kCuda);\n    } else if (param->compute_target_ == \"opencl\" &&\n               op->IsComputeTargetSupported(kOpenCl)) {\n      op->SelectComputeTarget(kOpenCl);\n    } else {\n      op->SelectComputeTarget(kCpu);\n    }\n\n    if (op->IsStandalone()) {\n      scheduled_standalone_ops_.push_back(op);\n    } else {\n      scheduled_sim_object_ops_.push_back(op);\n    }\n\n    \/\/ Remove operation from ops_to_add_\n    it = ops_to_add_.erase(it);\n  }\n\n  \/\/ Remove requested operations\n  for (auto it = ops_to_remove_.begin(); it != ops_to_remove_.end();) {\n    auto* op = *it;\n    \/\/ Check scheduled row-wise operations list\n    for (auto it2 = scheduled_sim_object_ops_.begin();\n         it2 != scheduled_sim_object_ops_.end(); ++it2) {\n      if (op == (*it2)) {\n        \/\/ Add to list of unscheduled operations\n        unscheduled_ops_.push_back(op);\n        it2 = scheduled_sim_object_ops_.erase(it2);\n        goto label;\n      }\n    }\n\n    \/\/ Check scheduled column-wise operations list\n    for (auto it2 = scheduled_standalone_ops_.begin();\n         it2 != scheduled_standalone_ops_.end(); ++it2) {\n      if (op == (*it2)) {\n        \/\/ Add to list of unscheduled operations\n        unscheduled_ops_.push_back(op);\n        it2 = scheduled_standalone_ops_.erase(it2);\n        goto label;\n      }\n    }\n  label:\n    it = ops_to_remove_.erase(it);\n  }\n}\n\n}  \/\/ namespace bdm\n<commit_msg>Fix warning when unscheduling an non-scheduled operation<commit_after>\/\/ -----------------------------------------------------------------------------\n\/\/\n\/\/ Copyright (C) The BioDynaMo Project.\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\/\/\n\/\/ See the LICENSE file distributed with this work for details.\n\/\/ See the NOTICE file distributed with this work for additional information\n\/\/ regarding copyright ownership.\n\/\/\n\/\/ -----------------------------------------------------------------------------\n\n#include <chrono>\n#include <string>\n\n#include \"core\/execution_context\/in_place_exec_ctxt.h\"\n#include \"core\/operation\/bound_space_op.h\"\n#include \"core\/operation\/diffusion_op.h\"\n#include \"core\/operation\/displacement_op.h\"\n#include \"core\/operation\/op_timer.h\"\n#include \"core\/operation\/operation_registry.h\"\n#include \"core\/param\/param.h\"\n#include \"core\/resource_manager.h\"\n#include \"core\/scheduler.h\"\n#include \"core\/simulation.h\"\n#include \"core\/simulation_backup.h\"\n#include \"core\/util\/log.h\"\n#include \"core\/visualization\/root\/adaptor.h\"\n\nnamespace bdm {\n\nScheduler::Scheduler() {\n  auto* param = Simulation::GetActive()->GetParam();\n  backup_ = new SimulationBackup(param->backup_file_, param->restore_file_);\n  if (backup_->RestoreEnabled()) {\n    restore_point_ = backup_->GetSimulationStepsFromBackup();\n  }\n  root_visualization_ = new RootAdaptor();\n\n  \/\/ Operations are scheduled in the following order (sub categorated by their\n  \/\/ operation implementation type, so that actual order may vary)\n  std::vector<std::string> default_ops = {\"update run displacement\",\n                                          \"bound space\",\n                                          \"biology module\",\n                                          \"displacement\",\n                                          \"discretization\",\n                                          \"distribute run displacement info\",\n                                          \"diffusion\"};\n\n  \/\/ Schedule the default operations\n  for (auto& def_op : default_ops) {\n    ScheduleOp(NewOperation(def_op));\n  }\n\n  visualize_op_ = NewOperation(\"visualize\");\n  setup_iteration_op_ = NewOperation(\"set up iteration\");\n  sort_balance_op_ = NewOperation(\"load balancing\");\n  teardown_iteration_op_ = NewOperation(\"tear down iteration\");\n  update_environment_op_ = NewOperation(\"update environment\");\n\n  outstanding_operations_ = {\"load balancing\", \"visualize\"};\n\n  protected_ops_ = {\"update run displacement\", \"biology module\",\n                    \"discretization\", \"distribute run displacment info\"};\n}\n\nScheduler::~Scheduler() {\n  for (auto* op : all_ops_) {\n    delete op;\n  }\n  delete visualize_op_;\n  delete sort_balance_op_;\n  delete update_environment_op_;\n  delete setup_iteration_op_;\n  delete teardown_iteration_op_;\n  delete backup_;\n  delete root_visualization_;\n}\n\nvoid Scheduler::Simulate(uint64_t steps) {\n  if (Restore(&steps)) {\n    return;\n  }\n\n  Initialize();\n  for (unsigned step = 0; step < steps; step++) {\n    Execute();\n\n    total_steps_++;\n    Backup();\n  }\n}\n\nuint64_t Scheduler::GetSimulatedSteps() const { return total_steps_; }\n\nTimingAggregator* Scheduler::GetOpTimes() { return &op_times_; }\n\nvoid Scheduler::ScheduleOp(Operation* op) {\n  all_ops_.push_back(op);\n  ops_to_add_.push_back(op);\n}\n\nvoid Scheduler::UnscheduleOp(Operation* op) {\n  \/\/ We must not unschedule a protected operation\n  if (std::find(protected_ops_.begin(), protected_ops_.end(), op->name_) !=\n      protected_ops_.end()) {\n    Log::Warning(\"Scheduler::UnscheduleOp\",\n                 \"You tried to unschedule the protected operation \", op->name_,\n                 \"! This request was ignored.\");\n    return;\n  }\n\n  \/\/ Check if the requested operation is even scheduled\n  bool not_in_scheduled_ops = true;\n  ForAllScheduledOperations([&](Operation* scheduled_op) {\n    if (op == scheduled_op) {\n      not_in_scheduled_ops = false;\n    }\n  });\n\n  if (not_in_scheduled_ops) {\n    Log::Warning(\"Scheduler::UnscheduleOp\",\n                 \"You tried to unschedule the non-scheduled operation \",\n                 op->name_, \"! This request was ignored.\");\n    return;\n  }\n\n  \/\/ 'Unschedule' outstanding operations\n  if (std::find(outstanding_operations_.begin(), outstanding_operations_.end(),\n                op->name_) != outstanding_operations_.end()) {\n    op->standalone_enabled_ = false;\n  }\n\n  ops_to_remove_.push_back(op);\n}\n\nstd::vector<std::string> Scheduler::GetListOfScheduledSimObjectOps() const {\n  std::vector<std::string> list;\n  for (auto* op : scheduled_sim_object_ops_) {\n    list.push_back(op->name_);\n  }\n  return list;\n}\n\nstd::vector<std::string> Scheduler::GetListOfScheduledStandaloneOps() const {\n  std::vector<std::string> list;\n  for (auto* op : scheduled_standalone_ops_) {\n    list.push_back(op->name_);\n  }\n  return list;\n}\n\nstd::vector<Operation*> Scheduler::GetOps(const std::string& name) {\n  std::vector<Operation*> ret;\n  if (std::find(protected_ops_.begin(), protected_ops_.end(), name) !=\n      protected_ops_.end()) {\n    Log::Warning(\"Scheduler::GetOps\", \"The operation '\", name,\n                 \"' is a protected operation. Request ignored.\");\n    return ret;\n  }\n\n  for (auto it = all_ops_.begin(); it != all_ops_.end(); ++it) {\n    if ((*it)->name_ == name) {\n      ret.push_back(*it);\n    }\n  }\n\n  return ret;\n}\n\nstruct RunAllScheduledOps : Functor<void, SimObject*, SoHandle> {\n  RunAllScheduledOps(std::vector<Operation*>& scheduled_ops)\n      : scheduled_ops_(scheduled_ops) {\n    sim_ = Simulation::GetActive();\n  }\n\n  void operator()(SimObject* so, SoHandle) override {\n    sim_->GetExecutionContext()->Execute(so, scheduled_ops_);\n  }\n\n  Simulation* sim_;\n  std::vector<Operation*>& scheduled_ops_;\n};\n\nvoid Scheduler::SetUpOps() {\n  ForAllScheduledOperations([&](Operation* op) {\n    if (total_steps_ % op->frequency_ == 0) {\n      op->SetUp();\n    }\n  });\n}\n\nvoid Scheduler::TearDownOps() {\n  ForAllScheduledOperations([&](Operation* op) {\n    if (total_steps_ % op->frequency_ == 0) {\n      op->TearDown();\n    }\n  });\n}\n\nvoid Scheduler::RunScheduledOps() {\n  auto* sim = Simulation::GetActive();\n  auto* rm = sim->GetResourceManager();\n  auto* param = sim->GetParam();\n  auto batch_size = param->scheduling_batch_size_;\n\n  \/\/ Run the sim object operations\n  std::vector<Operation*> sim_object_ops;\n  for (auto* op : scheduled_sim_object_ops_) {\n    if (total_steps_ % op->frequency_ == 0) {\n      sim_object_ops.push_back(op);\n    }\n  }\n  RunAllScheduledOps functor(sim_object_ops);\n\n  Timing::Time(\"sim object ops\", [&]() {\n    rm->ApplyOnAllElementsParallelDynamic(batch_size, functor);\n  });\n\n  \/\/ Run the column-wise operations\n  for (auto* op : scheduled_standalone_ops_) {\n    if (total_steps_ % op->frequency_ == 0) {\n      Timing::Time(op->name_, [&]() { (*op)(); });\n    }\n  }\n}\n\nvoid Scheduler::Execute() {\n  ScheduleOps();\n  Timing::Time(setup_iteration_op_->name_, [&]() { (*setup_iteration_op_)(); });\n\n  \/\/ We cannot put sort and balance in the list of scheduled_standalone_ops_,\n  \/\/ because numa-aware data structures would be invalidated:\n  \/\/ ```\n  \/\/  SetUpOps() <-- (1)\n  \/\/  RunScheduledOps() <-- rebalance numa domains\n  \/\/  TearDownOps() <-- indexing with SoHandles are different than at (1)\n  \/\/ ```\n  if (total_steps_ % sort_balance_op_->frequency_ == 0) {\n    Timing::Time(sort_balance_op_->name_, [&]() { (*sort_balance_op_)(); });\n  }\n\n  \/\/ We need to update the environment BEFORE setting up the operations, as\n  \/\/ some operations depend on the grid members to be up to date (e.g. GPU\n  \/\/ displacement operation)\n  Timing::Time(update_environment_op_->name_,\n               [&]() { (*update_environment_op_)(); });\n\n  SetUpOps();\n  RunScheduledOps();\n  TearDownOps();\n\n  Timing::Time(teardown_iteration_op_->name_,\n               [&]() { (*teardown_iteration_op_)(); });\n\n  if (total_steps_ % visualize_op_->frequency_ == 0) {\n    Timing::Time(visualize_op_->name_, [&]() { (*visualize_op_)(); });\n  }\n}\n\nvoid Scheduler::Backup() {\n  using std::chrono::duration_cast;\n  using std::chrono::seconds;\n  auto* param = Simulation::GetActive()->GetParam();\n  if (backup_->BackupEnabled() &&\n      duration_cast<seconds>(Clock::now() - last_backup_).count() >=\n          param->backup_interval_) {\n    last_backup_ = Clock::now();\n    backup_->Backup(total_steps_);\n  }\n}\n\n\/\/\/ Restore the simulation if requested at the right time\n\/\/\/ @param steps number of simulation steps for a `Simulate` call\n\/\/\/ @return if `Simulate` should return early\nbool Scheduler::Restore(uint64_t* steps) {\n  if (backup_->RestoreEnabled() && restore_point_ > total_steps_ + *steps) {\n    total_steps_ += *steps;\n    \/\/ restore requested, but not last backup was not done during this call to\n    \/\/ Simualte. Therefore, we skip it.\n    return true;\n  } else if (backup_->RestoreEnabled() && restore_point_ > total_steps_ &&\n             restore_point_ < total_steps_ + *steps) {\n    \/\/ Restore\n    backup_->Restore();\n    *steps = total_steps_ + *steps - restore_point_;\n    total_steps_ = restore_point_;\n  }\n  return false;\n}\n\n\/\/ TODO(lukas, ahmad) After https:\/\/trello.com\/c\/0D6sHCK4 has been resolved\n\/\/ think about a better solution, because some operations are executed twice\n\/\/ if Simulate is called with one timestep.\nvoid Scheduler::Initialize() {\n  auto* sim = Simulation::GetActive();\n  auto* env = sim->GetEnvironment();\n  auto* rm = sim->GetResourceManager();\n  auto* param = sim->GetParam();\n\n  \/\/ commit all changes\n  const auto& all_exec_ctxts = sim->GetAllExecCtxts();\n  all_exec_ctxts[0]->TearDownIterationAll(all_exec_ctxts);\n\n  if (param->bound_space_) {\n    auto* bound_space = NewOperation(\"bound space\");\n    rm->ApplyOnAllElementsParallel(*bound_space);\n    delete bound_space;\n  }\n  env->Update();\n  int lbound = env->GetDimensionThresholds()[0];\n  int rbound = env->GetDimensionThresholds()[1];\n  rm->ApplyOnAllDiffusionGrids([&](DiffusionGrid* dgrid) {\n    \/\/ Create data structures, whose size depend on the env dimensions\n    dgrid->Initialize({lbound, rbound, lbound, rbound, lbound, rbound});\n    \/\/ Initialize data structures with user-defined values\n    dgrid->RunInitializers();\n  });\n\n  ScheduleOps();\n}\n\n\/\/ Schedule the operations\nvoid Scheduler::ScheduleOps() {\n  auto* param = Simulation::GetActive()->GetParam();\n  \/\/ Add requested operations\n  for (auto it = ops_to_add_.begin(); it != ops_to_add_.end();) {\n    auto* op = *it;\n    \/\/ Enable GPU operation implementations (if available) if CUDA or OpenCL\n    \/\/ flags are set\n    if (param->compute_target_ == \"cuda\" &&\n        op->IsComputeTargetSupported(kCuda)) {\n      op->SelectComputeTarget(kCuda);\n    } else if (param->compute_target_ == \"opencl\" &&\n               op->IsComputeTargetSupported(kOpenCl)) {\n      op->SelectComputeTarget(kOpenCl);\n    } else {\n      op->SelectComputeTarget(kCpu);\n    }\n\n    if (op->IsStandalone()) {\n      scheduled_standalone_ops_.push_back(op);\n    } else {\n      scheduled_sim_object_ops_.push_back(op);\n    }\n\n    \/\/ Remove operation from ops_to_add_\n    it = ops_to_add_.erase(it);\n  }\n\n  \/\/ Remove requested operations\n  for (auto it = ops_to_remove_.begin(); it != ops_to_remove_.end();) {\n    auto* op = *it;\n    \/\/ Check scheduled row-wise operations list\n    for (auto it2 = scheduled_sim_object_ops_.begin();\n         it2 != scheduled_sim_object_ops_.end(); ++it2) {\n      if (op == (*it2)) {\n        \/\/ Add to list of unscheduled operations\n        unscheduled_ops_.push_back(op);\n        it2 = scheduled_sim_object_ops_.erase(it2);\n        goto label;\n      }\n    }\n\n    \/\/ Check scheduled column-wise operations list\n    for (auto it2 = scheduled_standalone_ops_.begin();\n         it2 != scheduled_standalone_ops_.end(); ++it2) {\n      if (op == (*it2)) {\n        \/\/ Add to list of unscheduled operations\n        unscheduled_ops_.push_back(op);\n        it2 = scheduled_standalone_ops_.erase(it2);\n        goto label;\n      }\n    }\n  label:\n    it = ops_to_remove_.erase(it);\n  }\n}\n\n}  \/\/ namespace bdm\n<|endoftext|>"}
{"text":"<commit_before>#include \"OgreCameraMan.h\"\n#include \"OgreSceneManager.h\"\n\nnamespace OgreBites {\n\nCameraMan::CameraMan(Ogre::SceneNode *cam)\n    : mCamera(0)\n    , mTarget(0)\n    , mOrbiting(false)\n    , mZooming(false)\n    , mTopSpeed(150)\n    , mVelocity(Ogre::Vector3::ZERO)\n    , mGoingForward(false)\n    , mGoingBack(false)\n    , mGoingLeft(false)\n    , mGoingRight(false)\n    , mGoingUp(false)\n    , mGoingDown(false)\n    , mFastMove(false)\n{\n\n    setCamera(cam);\n    setStyle(CS_FREELOOK);\n}\n\nvoid CameraMan::setCamera(Ogre::SceneNode *cam)\n{\n    mCamera = cam;\n}\n\nvoid CameraMan::setTarget(Ogre::SceneNode *target)\n{\n    if (target != mTarget)\n    {\n        mTarget = target;\n        if(target)\n        {\n            setYawPitchDist(Ogre::Degree(0), Ogre::Degree(15), 150);\n            mCamera->setAutoTracking(true, mTarget);\n        }\n        else\n        {\n            mCamera->setAutoTracking(false);\n        }\n\n    }\n\n\n}\n\nvoid CameraMan::setYawPitchDist(Ogre::Radian yaw, Ogre::Radian pitch, Ogre::Real dist)\n{\n    mCamera->setPosition(mTarget->_getDerivedPosition());\n    mCamera->setOrientation(mTarget->_getDerivedOrientation());\n    mCamera->yaw(yaw);\n    mCamera->pitch(-pitch);\n    mCamera->translate(Ogre::Vector3(0, 0, dist), Ogre::Node::TS_LOCAL);\n}\n\nvoid CameraMan::setStyle(CameraStyle style)\n{\n    if (mStyle != CS_ORBIT && style == CS_ORBIT)\n    {\n        setTarget(mTarget ? mTarget : mCamera->getCreator()->getRootSceneNode());\n        mCamera->setFixedYawAxis(true); \/\/ also fix axis with lookAt calls\n        manualStop();\n        setYawPitchDist(Ogre::Degree(0), Ogre::Degree(15), 150);\n    }\n    else if (mStyle != CS_FREELOOK && style == CS_FREELOOK)\n    {\n        mCamera->setAutoTracking(false);\n        mCamera->setFixedYawAxis(true); \/\/ also fix axis with lookAt calls\n    }\n    else if (mStyle != CS_MANUAL && style == CS_MANUAL)\n    {\n        mCamera->setAutoTracking(false);\n        manualStop();\n    }\n    mStyle = style;\n\n}\n\nvoid CameraMan::manualStop()\n{\n    if (mStyle == CS_FREELOOK)\n    {\n        mGoingForward = false;\n        mGoingBack = false;\n        mGoingLeft = false;\n        mGoingRight = false;\n        mGoingUp = false;\n        mGoingDown = false;\n        mVelocity = Ogre::Vector3::ZERO;\n    }\n}\n\nvoid CameraMan::frameRendered(const Ogre::FrameEvent &evt)\n{\n    if (mStyle == CS_FREELOOK)\n    {\n        \/\/ build our acceleration vector based on keyboard input composite\n        Ogre::Vector3 accel = Ogre::Vector3::ZERO;\n        Ogre::Matrix3 axes = mCamera->getLocalAxes();\n        if (mGoingForward) accel -= axes.GetColumn(2);\n        if (mGoingBack) accel += axes.GetColumn(2);\n        if (mGoingRight) accel += axes.GetColumn(0);\n        if (mGoingLeft) accel -= axes.GetColumn(0);\n        if (mGoingUp) accel += axes.GetColumn(1);\n        if (mGoingDown) accel -= axes.GetColumn(1);\n\n        \/\/ if accelerating, try to reach top speed in a certain time\n        Ogre::Real topSpeed = mFastMove ? mTopSpeed * 20 : mTopSpeed;\n        if (accel.squaredLength() != 0)\n        {\n            accel.normalise();\n            mVelocity += accel * topSpeed * evt.timeSinceLastFrame * 10;\n        }\n        \/\/ if not accelerating, try to stop in a certain time\n        else mVelocity -= mVelocity * evt.timeSinceLastFrame * 10;\n\n        Ogre::Real tooSmall = std::numeric_limits<Ogre::Real>::epsilon();\n\n        \/\/ keep camera velocity below top speed and above epsilon\n        if (mVelocity.squaredLength() > topSpeed * topSpeed)\n        {\n            mVelocity.normalise();\n            mVelocity *= topSpeed;\n        }\n        else if (mVelocity.squaredLength() < tooSmall * tooSmall)\n            mVelocity = Ogre::Vector3::ZERO;\n\n        if (mVelocity != Ogre::Vector3::ZERO) mCamera->translate(mVelocity * evt.timeSinceLastFrame);\n    }\n}\n\nbool CameraMan::keyPressed(const KeyboardEvent &evt)\n{\n    if (mStyle == CS_FREELOOK)\n    {\n        Keycode key = evt.keysym.sym;\n        if (key == 'w' || key == SDLK_UP) mGoingForward = true;\n        else if (key == 's' || key == SDLK_DOWN) mGoingBack = true;\n        else if (key == 'a' || key == SDLK_LEFT) mGoingLeft = true;\n        else if (key == 'd' || key == SDLK_RIGHT) mGoingRight = true;\n        else if (key == SDLK_PAGEUP) mGoingUp = true;\n        else if (key == SDLK_PAGEDOWN) mGoingDown = true;\n        else if (key == SDLK_LSHIFT) mFastMove = true;\n    }\n\n    return InputListener::keyPressed(evt);\n}\n\nbool CameraMan::keyReleased(const KeyboardEvent &evt)\n{\n    if (mStyle == CS_FREELOOK)\n    {\n        Keycode key = evt.keysym.sym;\n        if (key == 'w' || key == SDLK_UP) mGoingForward = false;\n        else if (key == 's' || key == SDLK_DOWN) mGoingBack = false;\n        else if (key == 'a' || key == SDLK_LEFT) mGoingLeft = false;\n        else if (key == 'd' || key == SDLK_RIGHT) mGoingRight = false;\n        else if (key == SDLK_PAGEUP) mGoingUp = false;\n        else if (key == SDLK_PAGEDOWN) mGoingDown = false;\n        else if (key == SDLK_LSHIFT) mFastMove = false;\n    }\n\n    return InputListener::keyReleased(evt);\n}\n\nbool CameraMan::mouseMoved(const MouseMotionEvent &evt)\n{\n    if (mStyle == CS_ORBIT)\n    {\n        Ogre::Real dist = (mCamera->getPosition() - mTarget->_getDerivedPosition()).length();\n\n        if (mOrbiting)   \/\/ yaw around the target, and pitch locally\n        {\n            mCamera->setPosition(mTarget->_getDerivedPosition());\n\n            mCamera->yaw(Ogre::Degree(-evt.xrel * 0.25f), Ogre::Node::TS_PARENT);\n            mCamera->pitch(Ogre::Degree(-evt.yrel * 0.25f));\n\n            mCamera->translate(Ogre::Vector3(0, 0, dist), Ogre::Node::TS_LOCAL);\n\n            \/\/ don't let the camera go over the top or around the bottom of the target\n        }\n        else if (mZooming)  \/\/ move the camera toward or away from the target\n        {\n            \/\/ the further the camera is, the faster it moves\n            mCamera->translate(Ogre::Vector3(0, 0, evt.yrel * 0.004f * dist), Ogre::Node::TS_LOCAL);\n        }\n    }\n    else if (mStyle == CS_FREELOOK)\n    {\n        mCamera->yaw(Ogre::Degree(-evt.xrel * 0.15f), Ogre::Node::TS_PARENT);\n        mCamera->pitch(Ogre::Degree(-evt.yrel * 0.15f));\n    }\n\n    return InputListener::mouseMoved(evt);\n}\n\nbool CameraMan::mouseWheelRolled(const MouseWheelEvent &evt) {\n    if (mStyle == CS_ORBIT && evt.y != 0)\n    {\n        Ogre::Real dist = (mCamera->getPosition() - mTarget->_getDerivedPosition()).length();\n        mCamera->translate(Ogre::Vector3(0, 0, -evt.y * 0.08f * dist), Ogre::Node::TS_LOCAL);\n    }\n\n    return InputListener::mouseWheelRolled(evt);\n}\n\nbool CameraMan::mousePressed(const MouseButtonEvent &evt)\n{\n    if (mStyle == CS_ORBIT)\n    {\n        if (evt.button == BUTTON_LEFT) mOrbiting = true;\n        else if (evt.button == BUTTON_RIGHT) mZooming = true;\n    }\n\n    return InputListener::mousePressed(evt);\n}\n\nbool CameraMan::mouseReleased(const MouseButtonEvent &evt)\n{\n    if (mStyle == CS_ORBIT)\n    {\n        if (evt.button == BUTTON_LEFT) mOrbiting = false;\n        else if (evt.button == BUTTON_RIGHT) mZooming = false;\n    }\n\n    return InputListener::mouseReleased(evt);\n}\n\n}\n<commit_msg>Bites: CameraMan - initialise mStyle<commit_after>#include \"OgreCameraMan.h\"\n#include \"OgreSceneManager.h\"\n\nnamespace OgreBites {\n\nCameraMan::CameraMan(Ogre::SceneNode *cam)\n    : mCamera(0)\n    , mStyle(CS_MANUAL)\n    , mTarget(0)\n    , mOrbiting(false)\n    , mZooming(false)\n    , mTopSpeed(150)\n    , mVelocity(Ogre::Vector3::ZERO)\n    , mGoingForward(false)\n    , mGoingBack(false)\n    , mGoingLeft(false)\n    , mGoingRight(false)\n    , mGoingUp(false)\n    , mGoingDown(false)\n    , mFastMove(false)\n{\n\n    setCamera(cam);\n    setStyle(CS_FREELOOK);\n}\n\nvoid CameraMan::setCamera(Ogre::SceneNode *cam)\n{\n    mCamera = cam;\n}\n\nvoid CameraMan::setTarget(Ogre::SceneNode *target)\n{\n    if (target != mTarget)\n    {\n        mTarget = target;\n        if(target)\n        {\n            setYawPitchDist(Ogre::Degree(0), Ogre::Degree(15), 150);\n            mCamera->setAutoTracking(true, mTarget);\n        }\n        else\n        {\n            mCamera->setAutoTracking(false);\n        }\n\n    }\n\n\n}\n\nvoid CameraMan::setYawPitchDist(Ogre::Radian yaw, Ogre::Radian pitch, Ogre::Real dist)\n{\n    mCamera->setPosition(mTarget->_getDerivedPosition());\n    mCamera->setOrientation(mTarget->_getDerivedOrientation());\n    mCamera->yaw(yaw);\n    mCamera->pitch(-pitch);\n    mCamera->translate(Ogre::Vector3(0, 0, dist), Ogre::Node::TS_LOCAL);\n}\n\nvoid CameraMan::setStyle(CameraStyle style)\n{\n    if (mStyle != CS_ORBIT && style == CS_ORBIT)\n    {\n        setTarget(mTarget ? mTarget : mCamera->getCreator()->getRootSceneNode());\n        mCamera->setFixedYawAxis(true); \/\/ also fix axis with lookAt calls\n        manualStop();\n        setYawPitchDist(Ogre::Degree(0), Ogre::Degree(15), 150);\n    }\n    else if (mStyle != CS_FREELOOK && style == CS_FREELOOK)\n    {\n        mCamera->setAutoTracking(false);\n        mCamera->setFixedYawAxis(true); \/\/ also fix axis with lookAt calls\n    }\n    else if (mStyle != CS_MANUAL && style == CS_MANUAL)\n    {\n        mCamera->setAutoTracking(false);\n        manualStop();\n    }\n    mStyle = style;\n\n}\n\nvoid CameraMan::manualStop()\n{\n    if (mStyle == CS_FREELOOK)\n    {\n        mGoingForward = false;\n        mGoingBack = false;\n        mGoingLeft = false;\n        mGoingRight = false;\n        mGoingUp = false;\n        mGoingDown = false;\n        mVelocity = Ogre::Vector3::ZERO;\n    }\n}\n\nvoid CameraMan::frameRendered(const Ogre::FrameEvent &evt)\n{\n    if (mStyle == CS_FREELOOK)\n    {\n        \/\/ build our acceleration vector based on keyboard input composite\n        Ogre::Vector3 accel = Ogre::Vector3::ZERO;\n        Ogre::Matrix3 axes = mCamera->getLocalAxes();\n        if (mGoingForward) accel -= axes.GetColumn(2);\n        if (mGoingBack) accel += axes.GetColumn(2);\n        if (mGoingRight) accel += axes.GetColumn(0);\n        if (mGoingLeft) accel -= axes.GetColumn(0);\n        if (mGoingUp) accel += axes.GetColumn(1);\n        if (mGoingDown) accel -= axes.GetColumn(1);\n\n        \/\/ if accelerating, try to reach top speed in a certain time\n        Ogre::Real topSpeed = mFastMove ? mTopSpeed * 20 : mTopSpeed;\n        if (accel.squaredLength() != 0)\n        {\n            accel.normalise();\n            mVelocity += accel * topSpeed * evt.timeSinceLastFrame * 10;\n        }\n        \/\/ if not accelerating, try to stop in a certain time\n        else mVelocity -= mVelocity * evt.timeSinceLastFrame * 10;\n\n        Ogre::Real tooSmall = std::numeric_limits<Ogre::Real>::epsilon();\n\n        \/\/ keep camera velocity below top speed and above epsilon\n        if (mVelocity.squaredLength() > topSpeed * topSpeed)\n        {\n            mVelocity.normalise();\n            mVelocity *= topSpeed;\n        }\n        else if (mVelocity.squaredLength() < tooSmall * tooSmall)\n            mVelocity = Ogre::Vector3::ZERO;\n\n        if (mVelocity != Ogre::Vector3::ZERO) mCamera->translate(mVelocity * evt.timeSinceLastFrame);\n    }\n}\n\nbool CameraMan::keyPressed(const KeyboardEvent &evt)\n{\n    if (mStyle == CS_FREELOOK)\n    {\n        Keycode key = evt.keysym.sym;\n        if (key == 'w' || key == SDLK_UP) mGoingForward = true;\n        else if (key == 's' || key == SDLK_DOWN) mGoingBack = true;\n        else if (key == 'a' || key == SDLK_LEFT) mGoingLeft = true;\n        else if (key == 'd' || key == SDLK_RIGHT) mGoingRight = true;\n        else if (key == SDLK_PAGEUP) mGoingUp = true;\n        else if (key == SDLK_PAGEDOWN) mGoingDown = true;\n        else if (key == SDLK_LSHIFT) mFastMove = true;\n    }\n\n    return InputListener::keyPressed(evt);\n}\n\nbool CameraMan::keyReleased(const KeyboardEvent &evt)\n{\n    if (mStyle == CS_FREELOOK)\n    {\n        Keycode key = evt.keysym.sym;\n        if (key == 'w' || key == SDLK_UP) mGoingForward = false;\n        else if (key == 's' || key == SDLK_DOWN) mGoingBack = false;\n        else if (key == 'a' || key == SDLK_LEFT) mGoingLeft = false;\n        else if (key == 'd' || key == SDLK_RIGHT) mGoingRight = false;\n        else if (key == SDLK_PAGEUP) mGoingUp = false;\n        else if (key == SDLK_PAGEDOWN) mGoingDown = false;\n        else if (key == SDLK_LSHIFT) mFastMove = false;\n    }\n\n    return InputListener::keyReleased(evt);\n}\n\nbool CameraMan::mouseMoved(const MouseMotionEvent &evt)\n{\n    if (mStyle == CS_ORBIT)\n    {\n        Ogre::Real dist = (mCamera->getPosition() - mTarget->_getDerivedPosition()).length();\n\n        if (mOrbiting)   \/\/ yaw around the target, and pitch locally\n        {\n            mCamera->setPosition(mTarget->_getDerivedPosition());\n\n            mCamera->yaw(Ogre::Degree(-evt.xrel * 0.25f), Ogre::Node::TS_PARENT);\n            mCamera->pitch(Ogre::Degree(-evt.yrel * 0.25f));\n\n            mCamera->translate(Ogre::Vector3(0, 0, dist), Ogre::Node::TS_LOCAL);\n\n            \/\/ don't let the camera go over the top or around the bottom of the target\n        }\n        else if (mZooming)  \/\/ move the camera toward or away from the target\n        {\n            \/\/ the further the camera is, the faster it moves\n            mCamera->translate(Ogre::Vector3(0, 0, evt.yrel * 0.004f * dist), Ogre::Node::TS_LOCAL);\n        }\n    }\n    else if (mStyle == CS_FREELOOK)\n    {\n        mCamera->yaw(Ogre::Degree(-evt.xrel * 0.15f), Ogre::Node::TS_PARENT);\n        mCamera->pitch(Ogre::Degree(-evt.yrel * 0.15f));\n    }\n\n    return InputListener::mouseMoved(evt);\n}\n\nbool CameraMan::mouseWheelRolled(const MouseWheelEvent &evt) {\n    if (mStyle == CS_ORBIT && evt.y != 0)\n    {\n        Ogre::Real dist = (mCamera->getPosition() - mTarget->_getDerivedPosition()).length();\n        mCamera->translate(Ogre::Vector3(0, 0, -evt.y * 0.08f * dist), Ogre::Node::TS_LOCAL);\n    }\n\n    return InputListener::mouseWheelRolled(evt);\n}\n\nbool CameraMan::mousePressed(const MouseButtonEvent &evt)\n{\n    if (mStyle == CS_ORBIT)\n    {\n        if (evt.button == BUTTON_LEFT) mOrbiting = true;\n        else if (evt.button == BUTTON_RIGHT) mZooming = true;\n    }\n\n    return InputListener::mousePressed(evt);\n}\n\nbool CameraMan::mouseReleased(const MouseButtonEvent &evt)\n{\n    if (mStyle == CS_ORBIT)\n    {\n        if (evt.button == BUTTON_LEFT) mOrbiting = false;\n        else if (evt.button == BUTTON_RIGHT) mZooming = false;\n    }\n\n    return InputListener::mouseReleased(evt);\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"engine\/matrix.h\"\n#include \"engine\/quat.h\"\n#include \"engine\/simd.h\"\n#include \"engine\/vec.h\"\n#include <cmath>\n\n\nnamespace Lumix\n{\n\n\nMatrix RigidTransform::toMatrix() const\n{\n\tMatrix mtx = rot.toMatrix();\n\tmtx.setTranslation(pos);\n\treturn mtx;\n}\n\n\nMatrix Transform::toMatrix() const\n{\n\tMatrix mtx = rot.toMatrix();\n\tmtx.setTranslation(pos);\n\tmtx.multiply3x3(scale);\n\treturn mtx;\n}\n\n\nconst Matrix Matrix::IDENTITY(\n\t1, 0, 0, 0,\n\t0, 1, 0, 0,\n\t0, 0, 1, 0,\n\t0, 0, 0, 1\n);\n\n\nMatrix::Matrix(const Vec3& pos, const Quat& rot)\n{\n\t*this = rot.toMatrix();\n\tsetTranslation(pos);\n}\n\n\nvoid Matrix::fromEuler(float yaw, float pitch, float roll)\n{\n\tfloat sroll = sinf(roll);\n\tfloat croll = cosf(roll);\n\tfloat spitch = sinf(pitch);\n\tfloat cpitch = cosf(pitch);\n\tfloat syaw = sinf(yaw);\n\tfloat cyaw = cosf(yaw);\n\n\tm11 = sroll * spitch * syaw + croll * cyaw;\n\tm12 = sroll * cpitch;\n\tm13 = sroll * spitch * cyaw - croll * syaw;\n\tm14 = 0.0f;\n\tm21 = croll * spitch * syaw - sroll * cyaw;\n\tm22 = croll * cpitch;\n\tm23 = croll * spitch * cyaw + sroll * syaw;\n\tm24 = 0.0f;\n\tm31 = cpitch * syaw;\n\tm32 = -spitch;\n\tm33 = cpitch * cyaw;\n\tm34 = 0.0f;\n\tm41 = 0.0f;\n\tm42 = 0.0f;\n\tm43 = 0.0f;\n\tm44 = 1.0f;\n}\n\n\nMatrix Matrix::rotationX(float angle)\n{\n\tMatrix m = IDENTITY;\n\tfloat c = cosf(angle);\n\tfloat s = sinf(angle);\n\n\tm.m22 = m.m33 = c;\n\tm.m32 = -s;\n\tm.m23 = s;\n\n\treturn m;\n}\n\n\nMatrix Matrix::rotationY(float angle)\n{\n\tMatrix m = IDENTITY;\n\tfloat c = cosf(angle);\n\tfloat s = sinf(angle);\n\n\tm.m11 = m.m33 = c;\n\tm.m31 = s;\n\tm.m13 = -s;\n\n\treturn m;\n}\n\nMatrix Matrix::rotationZ(float angle)\n{\n\tMatrix m = IDENTITY;\n\tfloat c = cosf(angle);\n\tfloat s = sinf(angle);\n\n\tm.m11 = m.m22 = c;\n\tm.m21 = -s;\n\tm.m12 = s;\n\t\n\treturn m;\n}\n\n\nvoid Matrix::setPerspective(float fov, float ratio, float near_plane, float far_plane, bool is_homogenous_depth)\n{\n\t*this = Matrix::IDENTITY;\n\tfloat f = 1 \/ tanf(fov * 0.5f);\n\tfloat z_diff = near_plane - far_plane;\n\tm11 = f \/ ratio;\n\tm22 = f;\n\tm33 = (is_homogenous_depth ? far_plane + near_plane : far_plane) \/ z_diff;\n\tm44 = 0;\n\tm43 = is_homogenous_depth ? 2 * far_plane * near_plane \/ z_diff : near_plane * far_plane \/ z_diff;\n\tm34 = -1.0f;\n}\n\n\nvoid Matrix::decompose(Vec3& position, Quat& rotation, float& scale) const\n{\n\tgetTranslation(position);\n\tscale = getXVector().length();\n\tMatrix tmp = *this;\n\ttmp.multiply3x3(1 \/ scale);\n\trotation = tmp.getRotation();\n}\n\n\nMatrix Matrix::operator *(float rhs) const\n{\n\tMatrix out;\n\tout.m11 = m11 * rhs;\n\tout.m12 = m12 * rhs;\n\tout.m13 = m13 * rhs;\n\tout.m14 = m14 * rhs;\n\n\tout.m21 = m21 * rhs;\n\tout.m22 = m22 * rhs;\n\tout.m23 = m23 * rhs;\n\tout.m24 = m24 * rhs;\n\n\tout.m31 = m31 * rhs;\n\tout.m32 = m32 * rhs;\n\tout.m33 = m33 * rhs;\n\tout.m34 = m34 * rhs;\n\n\tout.m41 = m41 * rhs;\n\tout.m42 = m42 * rhs;\n\tout.m43 = m43 * rhs;\n\tout.m44 = m44 * rhs;\n\n\treturn out;\n}\n\n\nMatrix Matrix::operator +(const Matrix& rhs) const\n{\n\tMatrix out;\n\n\tout.m11 = m11 + rhs.m11;\n\tout.m12 = m12 + rhs.m12;\n\tout.m13 = m13 + rhs.m13;\n\tout.m14 = m14 + rhs.m14;\n\n\tout.m21 = m21 + rhs.m21;\n\tout.m22 = m22 + rhs.m22;\n\tout.m23 = m23 + rhs.m23;\n\tout.m24 = m24 + rhs.m24;\n\n\tout.m31 = m31 + rhs.m31;\n\tout.m32 = m32 + rhs.m32;\n\tout.m33 = m33 + rhs.m33;\n\tout.m34 = m34 + rhs.m34;\n\n\tout.m41 = m41 + rhs.m41;\n\tout.m42 = m42 + rhs.m42;\n\tout.m43 = m43 + rhs.m43;\n\tout.m44 = m44 + rhs.m44;\n\n\treturn out;\n}\n\n\nMatrix Matrix::operator *(const Matrix& rhs) const\n{\n\tMatrix out;\n\n\tconst float4 a = f4Load(&m11);\n\tconst float4 b = f4Load(&m21);\n\tconst float4 c = f4Load(&m31);\n\tconst float4 d = f4Load(&m41);\n\n\tfloat4 t1 = f4Splat(rhs.m11);\n\tfloat4 t2 = f4Mul(a, t1);\n\tt1 = f4Splat(rhs.m12);\n\tt2 = f4Add(f4Mul(b, t1), t2);\n\tt1 = f4Splat(rhs.m13);\n\tt2 = f4Add(f4Mul(c, t1), t2);\n\tt1 = f4Splat(rhs.m14);\n\tt2 = f4Add(f4Mul(d, t1), t2);\n\n\tf4Store(&out.m11, t2);\n\n\tt1 = f4Splat(rhs.m21);\n\tt2 = f4Mul(a, t1);\n\tt1 = f4Splat(rhs.m22);\n\tt2 = f4Add(f4Mul(b, t1), t2);\n\tt1 = f4Splat(rhs.m23);\n\tt2 = f4Add(f4Mul(c, t1), t2);\n\tt1 = f4Splat(rhs.m24);\n\tt2 = f4Add(f4Mul(d, t1), t2);\n\n\tf4Store(&out.m21, t2);\n\n\tt1 = f4Splat(rhs.m31);\n\tt2 = f4Mul(a, t1);\n\tt1 = f4Splat(rhs.m32);\n\tt2 = f4Add(f4Mul(b, t1), t2);\n\tt1 = f4Splat(rhs.m33);\n\tt2 = f4Add(f4Mul(c, t1), t2);\n\tt1 = f4Splat(rhs.m34);\n\tt2 = f4Add(f4Mul(d, t1), t2);\n\n\tf4Store(&out.m31, t2);\n\n\tt1 = f4Splat(rhs.m41);\n\tt2 = f4Mul(a, t1);\n\tt1 = f4Splat(rhs.m42);\n\tt2 = f4Add(f4Mul(b, t1), t2);\n\tt1 = f4Splat(rhs.m43);\n\tt2 = f4Add(f4Mul(c, t1), t2);\n\tt1 = f4Splat(rhs.m44);\n\tt2 = f4Add(f4Mul(d, t1), t2);\n\n\tf4Store(&out.m41, t2);\n\n\treturn out;\n}\n\n\nvoid Matrix::normalizeScale()\n{\n\tVec3 scale = {\n\t\t1 \/ Vec3(m11, m21, m31).length(),\n\t\t1 \/ Vec3(m12, m22, m32).length(),\n\t\t1 \/ Vec3(m13, m23, m33).length()\n\t};\n\n\tm11 *= scale.x;\n\tm21 *= scale.x;\n\tm31 *= scale.x;\n\n\tm12 *= scale.z;\n\tm22 *= scale.z;\n\tm32 *= scale.z;\n\n\tm13 *= scale.z;\n\tm23 *= scale.z;\n\tm33 *= scale.z;\n}\n\n\nQuat Matrix::getRotation() const\n{\n\tQuat rot;\n\tfloat tr = m11 + m22 + m33;\n\n\tif (tr > 0)\n\t{ \n\t\tfloat t = tr + 1.0f;\n\t\tfloat s = 1 \/ sqrt(t) * 0.5f;\n\n\t\trot.w = s * t;\n\t\trot.z = (m12 - m21) * s;\n\t\trot.y = (m31 - m13) * s;\n\t\trot.x = (m23 - m32) * s;\n\t} \n\telse if ((m11 > m22) && (m11 > m33))\n\t{ \n\t\tfloat t = 1.0f + m11 - m22 - m33;\n\t\tfloat s = 1 \/ sqrt(t) * 0.5f;\n\t\trot.x = s * t;\n\t\trot.y = (m12 + m21) * s; \n\t\trot.z = (m13 + m31) * s; \n\t\trot.w = (m23 - m32) * s;\n\t}\n\telse if (m22 > m33)\n\t{ \n\t\tfloat t = 1.0f + m22 - m11 - m33;\n\t\tfloat s = 1 \/ sqrt(t) * 0.5f; \n\t\trot.w = (m31 - m13) * s;\n\t\trot.x = (m12 + m21) * s; \n\t\trot.y = s * t;\n\t\trot.z = (m23 + m32) * s; \n\t}\n\telse\n\t{ \n\t\tfloat t = 1.0f + m33 - m11 - m22;\n\t\tfloat s = 1 \/ sqrt(t) * 0.5f; \n\t\trot.w = (m12 - m21) * s;\n\t\trot.x = (m31 + m13) * s;\n\t\trot.y = (m32 + m23) * s;\n\t\trot.z = s * t;\n\t}\n\treturn rot;\n}\n\n\nvoid Matrix::transpose()\n{\n\t\tfloat tmp = m21;\n\t\tm21 = m12;\n\t\tm12 = tmp;\n\n\t\ttmp = m32;\n\t\tm32 = m23;\n\t\tm23 = tmp;\n\n\t\ttmp = m31;\n\t\tm31 = m13;\n\t\tm13 = tmp;\n\n\t\ttmp = m41;\n\t\tm41 = m14;\n\t\tm14 = tmp;\n\n\t\ttmp = m42;\n\t\tm42 = m24;\n\t\tm24 = tmp;\n\n\t\ttmp = m43;\n\t\tm43 = m34;\n\t\tm34 = tmp;\n}\n\n\nvoid Matrix::multiply3x3(float scale)\n{\n\tm11 *= scale;\n\tm12 *= scale;\n\tm13 *= scale;\n\tm21 *= scale;\n\tm22 *= scale;\n\tm23 *= scale;\n\tm31 *= scale;\n\tm32 *= scale;\n\tm33 *= scale;\n}\n\n\nVec3 Matrix::transformPoint(const Vec3& rhs) const\n{\n\treturn Vec3(\n\t\tm11 * rhs.x + m21 * rhs.y + m31 * rhs.z + m41,\n\t\tm12 * rhs.x + m22 * rhs.y + m32 * rhs.z + m42,\n\t\tm13 * rhs.x + m23 * rhs.y + m33 * rhs.z + m43\n\t);\n}\n\n\nVec3 Matrix::transformVector(const Vec3& rhs) const\n{\n\treturn Vec3(\n\t\tm11 * rhs.x + m21 * rhs.y + m31 * rhs.z,\n\t\tm12 * rhs.x + m22 * rhs.y + m32 * rhs.z,\n\t\tm13 * rhs.x + m23 * rhs.y + m33 * rhs.z\n\t);\n}\n\n\nvoid Matrix::setIdentity()\n{\n\tm11 = 1; m12 = 0; m13 = 0; m14 = 0; \n\tm21 = 0; m22 = 1; m23 = 0; m24 = 0; \n\tm31 = 0; m32 = 0; m33 = 1; m34 = 0; \n\tm41 = 0; m42 = 0; m43 = 0; m44 = 1; \n}\n\n\n} \/\/ namespace Lumix\n<commit_msg>typo fixed<commit_after>#include \"engine\/matrix.h\"\n#include \"engine\/quat.h\"\n#include \"engine\/simd.h\"\n#include \"engine\/vec.h\"\n#include <cmath>\n\n\nnamespace Lumix\n{\n\n\nMatrix RigidTransform::toMatrix() const\n{\n\tMatrix mtx = rot.toMatrix();\n\tmtx.setTranslation(pos);\n\treturn mtx;\n}\n\n\nMatrix Transform::toMatrix() const\n{\n\tMatrix mtx = rot.toMatrix();\n\tmtx.setTranslation(pos);\n\tmtx.multiply3x3(scale);\n\treturn mtx;\n}\n\n\nconst Matrix Matrix::IDENTITY(\n\t1, 0, 0, 0,\n\t0, 1, 0, 0,\n\t0, 0, 1, 0,\n\t0, 0, 0, 1\n);\n\n\nMatrix::Matrix(const Vec3& pos, const Quat& rot)\n{\n\t*this = rot.toMatrix();\n\tsetTranslation(pos);\n}\n\n\nvoid Matrix::fromEuler(float yaw, float pitch, float roll)\n{\n\tfloat sroll = sinf(roll);\n\tfloat croll = cosf(roll);\n\tfloat spitch = sinf(pitch);\n\tfloat cpitch = cosf(pitch);\n\tfloat syaw = sinf(yaw);\n\tfloat cyaw = cosf(yaw);\n\n\tm11 = sroll * spitch * syaw + croll * cyaw;\n\tm12 = sroll * cpitch;\n\tm13 = sroll * spitch * cyaw - croll * syaw;\n\tm14 = 0.0f;\n\tm21 = croll * spitch * syaw - sroll * cyaw;\n\tm22 = croll * cpitch;\n\tm23 = croll * spitch * cyaw + sroll * syaw;\n\tm24 = 0.0f;\n\tm31 = cpitch * syaw;\n\tm32 = -spitch;\n\tm33 = cpitch * cyaw;\n\tm34 = 0.0f;\n\tm41 = 0.0f;\n\tm42 = 0.0f;\n\tm43 = 0.0f;\n\tm44 = 1.0f;\n}\n\n\nMatrix Matrix::rotationX(float angle)\n{\n\tMatrix m = IDENTITY;\n\tfloat c = cosf(angle);\n\tfloat s = sinf(angle);\n\n\tm.m22 = m.m33 = c;\n\tm.m32 = -s;\n\tm.m23 = s;\n\n\treturn m;\n}\n\n\nMatrix Matrix::rotationY(float angle)\n{\n\tMatrix m = IDENTITY;\n\tfloat c = cosf(angle);\n\tfloat s = sinf(angle);\n\n\tm.m11 = m.m33 = c;\n\tm.m31 = s;\n\tm.m13 = -s;\n\n\treturn m;\n}\n\nMatrix Matrix::rotationZ(float angle)\n{\n\tMatrix m = IDENTITY;\n\tfloat c = cosf(angle);\n\tfloat s = sinf(angle);\n\n\tm.m11 = m.m22 = c;\n\tm.m21 = -s;\n\tm.m12 = s;\n\t\n\treturn m;\n}\n\n\nvoid Matrix::setPerspective(float fov, float ratio, float near_plane, float far_plane, bool is_homogenous_depth)\n{\n\t*this = Matrix::IDENTITY;\n\tfloat f = 1 \/ tanf(fov * 0.5f);\n\tfloat z_diff = near_plane - far_plane;\n\tm11 = f \/ ratio;\n\tm22 = f;\n\tm33 = (is_homogenous_depth ? far_plane + near_plane : far_plane) \/ z_diff;\n\tm44 = 0;\n\tm43 = is_homogenous_depth ? 2 * far_plane * near_plane \/ z_diff : near_plane * far_plane \/ z_diff;\n\tm34 = -1.0f;\n}\n\n\nvoid Matrix::decompose(Vec3& position, Quat& rotation, float& scale) const\n{\n\tgetTranslation(position);\n\tscale = getXVector().length();\n\tMatrix tmp = *this;\n\ttmp.multiply3x3(1 \/ scale);\n\trotation = tmp.getRotation();\n}\n\n\nMatrix Matrix::operator *(float rhs) const\n{\n\tMatrix out;\n\tout.m11 = m11 * rhs;\n\tout.m12 = m12 * rhs;\n\tout.m13 = m13 * rhs;\n\tout.m14 = m14 * rhs;\n\n\tout.m21 = m21 * rhs;\n\tout.m22 = m22 * rhs;\n\tout.m23 = m23 * rhs;\n\tout.m24 = m24 * rhs;\n\n\tout.m31 = m31 * rhs;\n\tout.m32 = m32 * rhs;\n\tout.m33 = m33 * rhs;\n\tout.m34 = m34 * rhs;\n\n\tout.m41 = m41 * rhs;\n\tout.m42 = m42 * rhs;\n\tout.m43 = m43 * rhs;\n\tout.m44 = m44 * rhs;\n\n\treturn out;\n}\n\n\nMatrix Matrix::operator +(const Matrix& rhs) const\n{\n\tMatrix out;\n\n\tout.m11 = m11 + rhs.m11;\n\tout.m12 = m12 + rhs.m12;\n\tout.m13 = m13 + rhs.m13;\n\tout.m14 = m14 + rhs.m14;\n\n\tout.m21 = m21 + rhs.m21;\n\tout.m22 = m22 + rhs.m22;\n\tout.m23 = m23 + rhs.m23;\n\tout.m24 = m24 + rhs.m24;\n\n\tout.m31 = m31 + rhs.m31;\n\tout.m32 = m32 + rhs.m32;\n\tout.m33 = m33 + rhs.m33;\n\tout.m34 = m34 + rhs.m34;\n\n\tout.m41 = m41 + rhs.m41;\n\tout.m42 = m42 + rhs.m42;\n\tout.m43 = m43 + rhs.m43;\n\tout.m44 = m44 + rhs.m44;\n\n\treturn out;\n}\n\n\nMatrix Matrix::operator *(const Matrix& rhs) const\n{\n\tMatrix out;\n\n\tconst float4 a = f4Load(&m11);\n\tconst float4 b = f4Load(&m21);\n\tconst float4 c = f4Load(&m31);\n\tconst float4 d = f4Load(&m41);\n\n\tfloat4 t1 = f4Splat(rhs.m11);\n\tfloat4 t2 = f4Mul(a, t1);\n\tt1 = f4Splat(rhs.m12);\n\tt2 = f4Add(f4Mul(b, t1), t2);\n\tt1 = f4Splat(rhs.m13);\n\tt2 = f4Add(f4Mul(c, t1), t2);\n\tt1 = f4Splat(rhs.m14);\n\tt2 = f4Add(f4Mul(d, t1), t2);\n\n\tf4Store(&out.m11, t2);\n\n\tt1 = f4Splat(rhs.m21);\n\tt2 = f4Mul(a, t1);\n\tt1 = f4Splat(rhs.m22);\n\tt2 = f4Add(f4Mul(b, t1), t2);\n\tt1 = f4Splat(rhs.m23);\n\tt2 = f4Add(f4Mul(c, t1), t2);\n\tt1 = f4Splat(rhs.m24);\n\tt2 = f4Add(f4Mul(d, t1), t2);\n\n\tf4Store(&out.m21, t2);\n\n\tt1 = f4Splat(rhs.m31);\n\tt2 = f4Mul(a, t1);\n\tt1 = f4Splat(rhs.m32);\n\tt2 = f4Add(f4Mul(b, t1), t2);\n\tt1 = f4Splat(rhs.m33);\n\tt2 = f4Add(f4Mul(c, t1), t2);\n\tt1 = f4Splat(rhs.m34);\n\tt2 = f4Add(f4Mul(d, t1), t2);\n\n\tf4Store(&out.m31, t2);\n\n\tt1 = f4Splat(rhs.m41);\n\tt2 = f4Mul(a, t1);\n\tt1 = f4Splat(rhs.m42);\n\tt2 = f4Add(f4Mul(b, t1), t2);\n\tt1 = f4Splat(rhs.m43);\n\tt2 = f4Add(f4Mul(c, t1), t2);\n\tt1 = f4Splat(rhs.m44);\n\tt2 = f4Add(f4Mul(d, t1), t2);\n\n\tf4Store(&out.m41, t2);\n\n\treturn out;\n}\n\n\nvoid Matrix::normalizeScale()\n{\n\tVec3 scale = {\n\t\t1 \/ Vec3(m11, m21, m31).length(),\n\t\t1 \/ Vec3(m12, m22, m32).length(),\n\t\t1 \/ Vec3(m13, m23, m33).length()\n\t};\n\n\tm11 *= scale.x;\n\tm21 *= scale.x;\n\tm31 *= scale.x;\n\n\tm12 *= scale.y;\n\tm22 *= scale.y;\n\tm32 *= scale.y;\n\n\tm13 *= scale.z;\n\tm23 *= scale.z;\n\tm33 *= scale.z;\n}\n\n\nQuat Matrix::getRotation() const\n{\n\tQuat rot;\n\tfloat tr = m11 + m22 + m33;\n\n\tif (tr > 0)\n\t{ \n\t\tfloat t = tr + 1.0f;\n\t\tfloat s = 1 \/ sqrt(t) * 0.5f;\n\n\t\trot.w = s * t;\n\t\trot.z = (m12 - m21) * s;\n\t\trot.y = (m31 - m13) * s;\n\t\trot.x = (m23 - m32) * s;\n\t} \n\telse if ((m11 > m22) && (m11 > m33))\n\t{ \n\t\tfloat t = 1.0f + m11 - m22 - m33;\n\t\tfloat s = 1 \/ sqrt(t) * 0.5f;\n\t\trot.x = s * t;\n\t\trot.y = (m12 + m21) * s; \n\t\trot.z = (m13 + m31) * s; \n\t\trot.w = (m23 - m32) * s;\n\t}\n\telse if (m22 > m33)\n\t{ \n\t\tfloat t = 1.0f + m22 - m11 - m33;\n\t\tfloat s = 1 \/ sqrt(t) * 0.5f; \n\t\trot.w = (m31 - m13) * s;\n\t\trot.x = (m12 + m21) * s; \n\t\trot.y = s * t;\n\t\trot.z = (m23 + m32) * s; \n\t}\n\telse\n\t{ \n\t\tfloat t = 1.0f + m33 - m11 - m22;\n\t\tfloat s = 1 \/ sqrt(t) * 0.5f; \n\t\trot.w = (m12 - m21) * s;\n\t\trot.x = (m31 + m13) * s;\n\t\trot.y = (m32 + m23) * s;\n\t\trot.z = s * t;\n\t}\n\treturn rot;\n}\n\n\nvoid Matrix::transpose()\n{\n\t\tfloat tmp = m21;\n\t\tm21 = m12;\n\t\tm12 = tmp;\n\n\t\ttmp = m32;\n\t\tm32 = m23;\n\t\tm23 = tmp;\n\n\t\ttmp = m31;\n\t\tm31 = m13;\n\t\tm13 = tmp;\n\n\t\ttmp = m41;\n\t\tm41 = m14;\n\t\tm14 = tmp;\n\n\t\ttmp = m42;\n\t\tm42 = m24;\n\t\tm24 = tmp;\n\n\t\ttmp = m43;\n\t\tm43 = m34;\n\t\tm34 = tmp;\n}\n\n\nvoid Matrix::multiply3x3(float scale)\n{\n\tm11 *= scale;\n\tm12 *= scale;\n\tm13 *= scale;\n\tm21 *= scale;\n\tm22 *= scale;\n\tm23 *= scale;\n\tm31 *= scale;\n\tm32 *= scale;\n\tm33 *= scale;\n}\n\n\nVec3 Matrix::transformPoint(const Vec3& rhs) const\n{\n\treturn Vec3(\n\t\tm11 * rhs.x + m21 * rhs.y + m31 * rhs.z + m41,\n\t\tm12 * rhs.x + m22 * rhs.y + m32 * rhs.z + m42,\n\t\tm13 * rhs.x + m23 * rhs.y + m33 * rhs.z + m43\n\t);\n}\n\n\nVec3 Matrix::transformVector(const Vec3& rhs) const\n{\n\treturn Vec3(\n\t\tm11 * rhs.x + m21 * rhs.y + m31 * rhs.z,\n\t\tm12 * rhs.x + m22 * rhs.y + m32 * rhs.z,\n\t\tm13 * rhs.x + m23 * rhs.y + m33 * rhs.z\n\t);\n}\n\n\nvoid Matrix::setIdentity()\n{\n\tm11 = 1; m12 = 0; m13 = 0; m14 = 0; \n\tm21 = 0; m22 = 1; m23 = 0; m24 = 0; \n\tm31 = 0; m32 = 0; m33 = 1; m34 = 0; \n\tm41 = 0; m42 = 0; m43 = 0; m44 = 1; \n}\n\n\n} \/\/ namespace Lumix\n<|endoftext|>"}
{"text":"<commit_before>#include <algorithm>\n\n#include \"cyc_limits.h\"\n#include \"error.h\"\n#include \"logger.h\"\n\n#include \"exchange_graph.h\"\n\nnamespace cyclus {\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nExchangeNode::ExchangeNode(double max_qty, bool exclusive, std::string commod)\n  : max_qty(max_qty),\n    exclusive(exclusive),\n    commod(commod),\n    qty(0),\n    avg_pref(0),\n    group(NULL) {}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nbool operator==(const ExchangeNode& lhs, const ExchangeNode& rhs) {\n  return (lhs.unit_capacities == rhs.unit_capacities &&\n          lhs.max_qty == rhs.max_qty &&\n          lhs.exclusive == rhs.exclusive &&\n          lhs.group == rhs.group &&\n          lhs.commod == rhs.commod);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nArc::Arc(boost::shared_ptr<ExchangeNode> unode,\n         boost::shared_ptr<ExchangeNode> vnode)\n    : unode_(unode),\n      vnode_(vnode) {  \n  exclusive_ = unode->exclusive || vnode->exclusive;\n  if (exclusive_) {\n    double fqty = unode->max_qty;\n    double sqty = vnode->max_qty;\n    if (unode->exclusive && vnode->exclusive) {\n      excl_val_ = fqty == sqty ? fqty : 0;\n    } else if (unode->exclusive) {\n      excl_val_ = sqty >= fqty ? fqty : 0;\n    } else {\n      excl_val_ = fqty >= sqty ? sqty : 0;\n    }\n  } else {\n    excl_val_ = 0;\n  }\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nArc::Arc(const Arc& other)\n    : unode_(other.unode()),\n      vnode_(other.vnode()),\n      exclusive_(other.exclusive()),\n      excl_val_(other.excl_val()) { }\n    \n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nvoid ExchangeNodeGroup::AddExchangeNode(ExchangeNode::Ptr node) {\n  node->group = this;\n  nodes_.push_back(node);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nRequestGroup::RequestGroup(double qty) : qty_(qty) {}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nvoid RequestGroup::AddExchangeNode(ExchangeNode::Ptr node) {\n  ExchangeNodeGroup::AddExchangeNode(node);\n  if (node->exclusive) {\n    std::vector<ExchangeNode::Ptr> nodes;\n    nodes.push_back(node);\n    ExchangeNodeGroup::AddExclGroup(nodes);\n  }\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\ndouble Capacity(const Arc& a) {\n  double ucap = Capacity(a.unode(), a);\n  double vcap = Capacity(a.vnode(), a);\n\n  CLOG(cyclus::LEV_DEBUG1) << \"Capacity for unode of arc: \" << ucap;\n  CLOG(cyclus::LEV_DEBUG1) << \"Capacity for vnode of arc: \" << vcap;\n  CLOG(cyclus::LEV_DEBUG1) << \"Capacity for arc         : \"\n                           << std::min(ucap, vcap);\n  \n  return std::min(ucap, vcap);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\ndouble Capacity(ExchangeNode& n, const Arc& a) {\n  if (n.group == NULL) {\n    throw cyclus::StateError(\"An notion of node capacity requires a nodegroup.\");\n  }\n\n  if (n.unit_capacities[a].size() == 0) {\n    return std::numeric_limits<double>::max();\n  }\n\n  std::vector<double>& unit_caps = n.unit_capacities[a];\n  const std::vector<double>& group_caps = n.group->capacities();\n  std::vector<double> caps;\n  for (int i = 0; i < unit_caps.size(); i++) {\n    CLOG(cyclus::LEV_DEBUG1) << \"Capacity for node: \";\n    CLOG(cyclus::LEV_DEBUG1) << \"   group capacity: \" << group_caps[i];\n    CLOG(cyclus::LEV_DEBUG1) << \"    unit capacity: \" << unit_caps[i];\n    CLOG(cyclus::LEV_DEBUG1) << \"         capacity: \"\n                             << group_caps[i] \/ unit_caps[i];\n    \n    \/\/ special case for unlimited capacities\n    if (group_caps[i] == std::numeric_limits<double>::max()) {\n      caps.push_back(std::numeric_limits<double>::max());\n    } else {\n      caps.push_back(group_caps[i] \/ unit_caps[i]);\n    }\n  }\n\n  return std::min(*std::min_element(caps.begin(), caps.end()), n.max_qty - n.qty);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\ndouble Capacity(ExchangeNode::Ptr pn, const Arc& a) {\n  return Capacity(*pn.get(), a);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nvoid UpdateCapacity(ExchangeNode& n, const Arc& a, double qty) {\n  using std::vector;\n  using cyclus::IsNegative;\n  using cyclus::ValueError;\n\n  if (n.group == NULL) {\n    throw cyclus::StateError(\"An notion of node capacity requires a nodegroup.\");\n  }\n  \n  vector<double>& unit_caps = n.unit_capacities[a];\n  vector<double>& caps = n.group->capacities();\n  for (int i = 0; i < caps.size(); i++) {\n    double prev = caps[i];\n    \/\/ special case for unlimited capacities\n    CLOG(cyclus::LEV_DEBUG1) << \"Updating capacity value from: \"\n                             << prev;\n    caps[i] = (prev == std::numeric_limits<double>::max()) ?\n              std::numeric_limits<double>::max() :\n              prev - qty * unit_caps[i];\n    CLOG(cyclus::LEV_DEBUG1) << \"                          to: \"\n                             << caps[i];\n  }\n\n  if (IsNegative(n.max_qty - qty)) {\n    throw ValueError(\"ExchangeNode quantities can not be reduced below 0.\");\n  }\n\n  n.qty += qty;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nvoid UpdateCapacity(ExchangeNode::Ptr pn, const Arc& a, double qty) {\n  return UpdateCapacity(*pn.get(), a, qty);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nExchangeGraph::ExchangeGraph() : next_arc_id_(0) { }\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nvoid ExchangeGraph::AddRequestGroup(RequestGroup::Ptr prs) {\n  request_groups_.push_back(prs);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nvoid ExchangeGraph::AddSupplyGroup(ExchangeNodeGroup::Ptr pss) {\n  supply_groups_.push_back(pss);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nvoid ExchangeGraph::AddArc(const Arc& a) {\n  arcs_.push_back(a);\n  int id = next_arc_id_++;\n  arc_ids_.insert(std::pair<Arc, int>(a, id));\n  arc_by_id_.insert(std::pair<int, Arc>(id, a));\n  node_arc_map_[a.unode()].push_back(a);\n  node_arc_map_[a.vnode()].push_back(a);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nvoid ExchangeGraph::AddMatch(const Arc& a, double qty) {\n  UpdateCapacity(a.unode(), a, qty);\n  UpdateCapacity(a.vnode(), a, qty);\n  matches_.push_back(std::make_pair(a, qty));\n}\n\n} \/\/ namespace cyclus\n<commit_msg>simplified arc constructor<commit_after>#include <algorithm>\n\n#include \"cyc_limits.h\"\n#include \"error.h\"\n#include \"logger.h\"\n\n#include \"exchange_graph.h\"\n\nnamespace cyclus {\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nExchangeNode::ExchangeNode(double max_qty, bool exclusive, std::string commod)\n  : max_qty(max_qty),\n    exclusive(exclusive),\n    commod(commod),\n    qty(0),\n    avg_pref(0),\n    group(NULL) {}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nbool operator==(const ExchangeNode& lhs, const ExchangeNode& rhs) {\n  return (lhs.unit_capacities == rhs.unit_capacities &&\n          lhs.max_qty == rhs.max_qty &&\n          lhs.exclusive == rhs.exclusive &&\n          lhs.group == rhs.group &&\n          lhs.commod == rhs.commod);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nArc::Arc(boost::shared_ptr<ExchangeNode> unode,\n         boost::shared_ptr<ExchangeNode> vnode)\n    : unode_(unode),\n      vnode_(vnode) {  \n  if (unode->exclusive || vnode->exclusive) {\n    double fqty = unode->max_qty;\n    double sqty = vnode->max_qty;\n    if (unode->exclusive && vnode->exclusive) {\n      excl_val_ = fqty == sqty ? fqty : 0;\n    } else if (unode->exclusive) {\n      excl_val_ = sqty >= fqty ? fqty : 0;\n    } else {\n      excl_val_ = fqty >= sqty ? sqty : 0;\n    }\n  } else {\n    excl_val_ = 0;\n  }\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nArc::Arc(const Arc& other)\n    : unode_(other.unode()),\n      vnode_(other.vnode()),\n      exclusive_(other.exclusive()),\n      excl_val_(other.excl_val()) { }\n    \n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nvoid ExchangeNodeGroup::AddExchangeNode(ExchangeNode::Ptr node) {\n  node->group = this;\n  nodes_.push_back(node);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nRequestGroup::RequestGroup(double qty) : qty_(qty) {}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nvoid RequestGroup::AddExchangeNode(ExchangeNode::Ptr node) {\n  ExchangeNodeGroup::AddExchangeNode(node);\n  if (node->exclusive) {\n    std::vector<ExchangeNode::Ptr> nodes;\n    nodes.push_back(node);\n    ExchangeNodeGroup::AddExclGroup(nodes);\n  }\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\ndouble Capacity(const Arc& a) {\n  double ucap = Capacity(a.unode(), a);\n  double vcap = Capacity(a.vnode(), a);\n\n  CLOG(cyclus::LEV_DEBUG1) << \"Capacity for unode of arc: \" << ucap;\n  CLOG(cyclus::LEV_DEBUG1) << \"Capacity for vnode of arc: \" << vcap;\n  CLOG(cyclus::LEV_DEBUG1) << \"Capacity for arc         : \"\n                           << std::min(ucap, vcap);\n  \n  return std::min(ucap, vcap);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\ndouble Capacity(ExchangeNode& n, const Arc& a) {\n  if (n.group == NULL) {\n    throw cyclus::StateError(\"An notion of node capacity requires a nodegroup.\");\n  }\n\n  if (n.unit_capacities[a].size() == 0) {\n    return std::numeric_limits<double>::max();\n  }\n\n  std::vector<double>& unit_caps = n.unit_capacities[a];\n  const std::vector<double>& group_caps = n.group->capacities();\n  std::vector<double> caps;\n  for (int i = 0; i < unit_caps.size(); i++) {\n    CLOG(cyclus::LEV_DEBUG1) << \"Capacity for node: \";\n    CLOG(cyclus::LEV_DEBUG1) << \"   group capacity: \" << group_caps[i];\n    CLOG(cyclus::LEV_DEBUG1) << \"    unit capacity: \" << unit_caps[i];\n    CLOG(cyclus::LEV_DEBUG1) << \"         capacity: \"\n                             << group_caps[i] \/ unit_caps[i];\n    \n    \/\/ special case for unlimited capacities\n    if (group_caps[i] == std::numeric_limits<double>::max()) {\n      caps.push_back(std::numeric_limits<double>::max());\n    } else {\n      caps.push_back(group_caps[i] \/ unit_caps[i]);\n    }\n  }\n\n  return std::min(*std::min_element(caps.begin(), caps.end()), n.max_qty - n.qty);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\ndouble Capacity(ExchangeNode::Ptr pn, const Arc& a) {\n  return Capacity(*pn.get(), a);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nvoid UpdateCapacity(ExchangeNode& n, const Arc& a, double qty) {\n  using std::vector;\n  using cyclus::IsNegative;\n  using cyclus::ValueError;\n\n  if (n.group == NULL) {\n    throw cyclus::StateError(\"An notion of node capacity requires a nodegroup.\");\n  }\n  \n  vector<double>& unit_caps = n.unit_capacities[a];\n  vector<double>& caps = n.group->capacities();\n  for (int i = 0; i < caps.size(); i++) {\n    double prev = caps[i];\n    \/\/ special case for unlimited capacities\n    CLOG(cyclus::LEV_DEBUG1) << \"Updating capacity value from: \"\n                             << prev;\n    caps[i] = (prev == std::numeric_limits<double>::max()) ?\n              std::numeric_limits<double>::max() :\n              prev - qty * unit_caps[i];\n    CLOG(cyclus::LEV_DEBUG1) << \"                          to: \"\n                             << caps[i];\n  }\n\n  if (IsNegative(n.max_qty - qty)) {\n    throw ValueError(\"ExchangeNode quantities can not be reduced below 0.\");\n  }\n\n  n.qty += qty;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nvoid UpdateCapacity(ExchangeNode::Ptr pn, const Arc& a, double qty) {\n  return UpdateCapacity(*pn.get(), a, qty);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nExchangeGraph::ExchangeGraph() : next_arc_id_(0) { }\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nvoid ExchangeGraph::AddRequestGroup(RequestGroup::Ptr prs) {\n  request_groups_.push_back(prs);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nvoid ExchangeGraph::AddSupplyGroup(ExchangeNodeGroup::Ptr pss) {\n  supply_groups_.push_back(pss);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nvoid ExchangeGraph::AddArc(const Arc& a) {\n  arcs_.push_back(a);\n  int id = next_arc_id_++;\n  arc_ids_.insert(std::pair<Arc, int>(a, id));\n  arc_by_id_.insert(std::pair<int, Arc>(id, a));\n  node_arc_map_[a.unode()].push_back(a);\n  node_arc_map_[a.vnode()].push_back(a);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nvoid ExchangeGraph::AddMatch(const Arc& a, double qty) {\n  UpdateCapacity(a.unode(), a, qty);\n  UpdateCapacity(a.vnode(), a, qty);\n  matches_.push_back(std::make_pair(a, qty));\n}\n\n} \/\/ namespace cyclus\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file\n * @author  Inmatarian <inmatarian@gmail.com>\n * @section LICENSE\n * Insert copyright and license information here.\n *\/\n\n#include <string>\n#include <vector>\n#include <dirent.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n#include <algorithm>\n\n#include \"debug.h\"\n#include \"fileListModel.h\"\n\nstruct FilePair\n{\n  std::string name;\n  std::string data;\n  bool isDirectory;\n\n  FilePair( const std::string &n, const std::string d, bool i )\n    : name(n), data(d), isDirectory(i) {\/* *\/};\n\n  bool operator<( const FilePair &other ) const\n  {\n    if ( this->isDirectory && !other.isDirectory ) return true;\n    if ( !this->isDirectory && other.isDirectory ) return false;\n\n    std::string left;\n    std::transform( this->name.begin(), this->name.end(),\n                    std::back_inserter(left), tolower );\n\n    std::string right;\n    std::transform( other.name.begin(), other.name.end(), \n                    std::back_inserter(right), tolower );\n\n    return left < right;\n  };\n};\n\nclass FileListModelPrivate\n{\n  public:\n    FileListModelPrivate( FileListModel *pSelf );\n    void makeDirList( const std::string &dir );\n    static std::string cwd();\n\n  public:\n    std::vector<FilePair> fileList;\n\n  private:\n    FileListModel *self;\n};\n\nFileListModelPrivate::FileListModelPrivate( FileListModel *pSelf )\n  : self( pSelf )\n{\n  \/* *\/\n}\n\nvoid FileListModelPrivate::makeDirList( const std::string &dir )\n{\n  DIR *d = 0;\n  struct dirent *e = 0;\n\n  fileList.clear();\n\n  d = opendir( dir.c_str() );\n  if ( !d ) {\n    zwarn() << \"Error listing\" << dir;\n    return;\n  }\n\n  while ( (e = readdir( d )) )\n  {\n    struct stat inode;\n    std::string path = dir + \"\/\" + std::string(e->d_name);\n    bool yes = false;\n    bool dir = false;\n    if ( stat(path.c_str(), &inode) == 0 ) {\n      if ( S_ISDIR(inode.st_mode) ) {\n        yes = true;\n        dir = true;\n      }\n      else if ( S_ISREG(inode.st_mode) ) {\n        yes = true;\n        dir = false;\n      }\n    }\n\n    if (yes) {\n      fileList.push_back( FilePair( e->d_name, path, dir ) );\n    }\n  }\n  closedir( d );\n\n  sort( fileList.begin(), fileList.end() );\n}\n\nstd::string FileListModelPrivate::cwd()\n{\n  char c[128];\n  getcwd(c, 128);\n  c[127] = 0;\n  std::string d(c);\n  return d;\n}\n\nFileListModel::FileListModel()\n  : d( new FileListModelPrivate(this) )\n{\n  d->makeDirList( d->cwd() ); \n}\n\nFileListModel::~FileListModel()\n{\n  delete d;\n  d = 0;\n}\n\nstd::string FileListModel::getTitleMessage() const\n{\n  return std::string(\"Load World\");\n}\n\nstd::string FileListModel::getLineMessage( int line ) const\n{\n  if ( line < 0 || line >= lineCount() ) {\n    return std::string();\n  }\n\n  return d->fileList.at(line).name;\n}\n\nstd::string FileListModel::getLineData( int line ) const\n{\n  if ( line < 0 || line >= lineCount() ) {\n    return std::string();\n  }\n\n  return d->fileList.at(line).data;\n}\n\nint FileListModel::getLineColorFG( int line ) const\n{\n  if ( line < 0 || line >= lineCount() ) {\n    return 0;\n  }\n  \n  return d->fileList.at(line).isDirectory ? 0x0f : 0x0e;\n}\n\nint FileListModel::lineCount() const\n{\n  return d->fileList.size();\n}\n\n<commit_msg>Use some RAII to wrap those posix style directory listing functions.<commit_after>\/**\n * @file\n * @author  Inmatarian <inmatarian@gmail.com>\n * @section LICENSE\n * Insert copyright and license information here.\n *\/\n\n#include <string>\n#include <vector>\n#include <dirent.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n#include <algorithm>\n\n#include \"debug.h\"\n#include \"fileListModel.h\"\n\nstruct FilePair\n{\n  std::string name;\n  std::string data;\n  bool isDirectory;\n\n  FilePair( const std::string &n, const std::string d, bool i )\n    : name(n), data(d), isDirectory(i) {\/* *\/};\n\n  bool operator<( const FilePair &other ) const\n  {\n    if ( this->isDirectory && !other.isDirectory ) return true;\n    if ( !this->isDirectory && other.isDirectory ) return false;\n\n    std::string left;\n    std::transform( this->name.begin(), this->name.end(),\n                    std::back_inserter(left), tolower );\n\n    std::string right;\n    std::transform( other.name.begin(), other.name.end(), \n                    std::back_inserter(right), tolower );\n\n    return left < right;\n  };\n};\n\n\/\/ -------------------------------------\n\nclass DirList\n{\n  public:\n    DirList( const std::string &dirpath );\n    ~DirList();\n\n    bool next();\n    std::string currentName() const;\n    std::string currentPath() const;\n    bool currentIsDirectory();\n    bool currentIsValid() const;\n\n  private:\n    DIR *dir;\n    struct dirent *ent;\n    std::string path;\n    std::string c_fullpath;\n    bool c_valid;\n    bool c_dir;\n};\n\nDirList::DirList( const std::string &dirpath )\n  : dir(0), ent(0), path(dirpath), c_valid(false), c_dir(false)\n{\n  dir = opendir( path.c_str() );\n  if ( !dir ) zwarn() << \"Error listing\" << dir;\n}\n\nDirList::~DirList()\n{\n  if ( dir ) closedir( dir );\n}\n\nbool DirList::next()\n{\n  if ( !dir ) return false;\n\n  ent = readdir( dir );\n  if ( ent )\n  {\n    struct stat inode;\n    c_fullpath = path + \"\/\" + std::string(ent->d_name);\n    if ( stat(c_fullpath.c_str(), &inode) == 0 ) {\n      if ( S_ISDIR(inode.st_mode) ) {\n        c_valid = true;\n        c_dir = true;\n      }\n      else if ( S_ISREG(inode.st_mode) ) {\n        c_valid = true;\n        c_dir = false;\n      }\n      else {\n        c_valid = false;\n        c_dir = false;\n      }\n    }\n    else {\n      c_valid = false;\n      c_dir = false;\n    }\n    return true;\n  }\n\n  return false;\n}\n\nstd::string DirList::currentName() const\n{\n  return ent->d_name;\n}\n\nstd::string DirList::currentPath() const\n{\n  return c_fullpath;\n}\n\nbool DirList::currentIsDirectory()\n{\n  return c_dir;\n}\n\nbool DirList::currentIsValid() const\n{\n  return c_valid;\n}\n\n\/\/ -------------------------------------\n\nclass FileListModelPrivate\n{\n  public:\n    FileListModelPrivate( FileListModel *pSelf );\n    void makeDirList( const std::string &dir );\n    static std::string cwd();\n\n  public:\n    std::vector<FilePair> fileList;\n\n  private:\n    FileListModel *self;\n};\n\nFileListModelPrivate::FileListModelPrivate( FileListModel *pSelf )\n  : self( pSelf )\n{\n  \/* *\/\n}\n\nvoid FileListModelPrivate::makeDirList( const std::string &dir )\n{\n  fileList.clear();\n  DirList dirlist(dir);\n\n  while ( dirlist.next() )\n  {\n    if ( !dirlist.currentIsValid() ) continue;\n\n    fileList.push_back( FilePair( dirlist.currentName(),\n                                  dirlist.currentPath(),\n                                  dirlist.currentIsDirectory() ) );\n  }\n\n  sort( fileList.begin(), fileList.end() );\n}\n\nstd::string FileListModelPrivate::cwd()\n{\n  char c[128];\n  getcwd(c, 128);\n  c[127] = 0;\n  std::string d(c);\n  return d;\n}\n\n\/\/ -------------------------------------\n\nFileListModel::FileListModel()\n  : d( new FileListModelPrivate(this) )\n{\n  d->makeDirList( d->cwd() ); \n}\n\nFileListModel::~FileListModel()\n{\n  delete d;\n  d = 0;\n}\n\nstd::string FileListModel::getTitleMessage() const\n{\n  return std::string(\"Load World\");\n}\n\nstd::string FileListModel::getLineMessage( int line ) const\n{\n  if ( line < 0 || line >= lineCount() ) {\n    return std::string();\n  }\n\n  return d->fileList.at(line).name;\n}\n\nstd::string FileListModel::getLineData( int line ) const\n{\n  if ( line < 0 || line >= lineCount() ) {\n    return std::string();\n  }\n\n  return d->fileList.at(line).data;\n}\n\nint FileListModel::getLineColorFG( int line ) const\n{\n  if ( line < 0 || line >= lineCount() ) {\n    return 0;\n  }\n  \n  return d->fileList.at(line).isDirectory ? 0x0f : 0x0e;\n}\n\nint FileListModel::lineCount() const\n{\n  return d->fileList.size();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2013 Yangqing Jia\n\n#include <vector>\n\n#include \"caffe\/layer.hpp\"\n#include \"caffe\/vision_layers.hpp\"\n#include \"caffe\/util\/im2col.hpp\"\n#include \"caffe\/filler.hpp\"\n#include \"caffe\/util\/math_functions.hpp\"\n\nnamespace caffe {\n\ntemplate <typename Dtype>\nvoid ConvolutionLayer<Dtype>::SetUp(const vector<Blob<Dtype>*>& bottom,\n      vector<Blob<Dtype>*>* top) {\n  CHECK_EQ(bottom.size(), 1) << \"Conv Layer takes a single blob as input.\";\n  CHECK_EQ(top->size(), 1) << \"Conv Layer takes a single blob as output.\";\n  KSIZE_ = this->layer_param_.kernelsize();\n  STRIDE_ = this->layer_param_.stride();\n  GROUP_ = this->layer_param_.group();\n  NUM_ = bottom[0]->num();\n  CHANNELS_ = bottom[0]->channels();\n  HEIGHT_ = bottom[0]->height();\n  WIDTH_ = bottom[0]->width();\n  NUM_OUTPUT_ = this->layer_param_.num_output();\n  CHECK_GT(NUM_OUTPUT_, 0);\n  CHECK_EQ(CHANNELS_ % GROUP_, 0);\n  \/\/ The im2col result buffer would only hold one image at a time to avoid\n  \/\/ overly large memory usage.\n  int height_out = (HEIGHT_ - KSIZE_) \/ STRIDE_ + 1;\n  int width_out = (WIDTH_ - KSIZE_) \/ STRIDE_ + 1;\n  col_buffer_.Reshape(1, CHANNELS_ * KSIZE_ * KSIZE_, height_out, width_out);\n  \/\/ Set the parameters\n  CHECK_EQ(NUM_OUTPUT_ % GROUP_, 0)\n      << \"Number of output should be multiples of group.\";\n  biasterm_ = this->layer_param_.biasterm();\n  \/\/ Figure out the dimensions for individual gemms.\n  M_ = NUM_OUTPUT_ \/ GROUP_;\n  K_ = CHANNELS_ * KSIZE_ * KSIZE_ \/ GROUP_;\n  N_ = height_out * width_out;\n  (*top)[0]->Reshape(bottom[0]->num(), NUM_OUTPUT_, height_out, width_out);\n  \/\/ Check if we need to set up the weights\n  if (this->blobs_.size() > 0) {\n    LOG(INFO) << \"Skipping parameter initialization\";\n  } else {\n    if (biasterm_) {\n      this->blobs_.resize(2);\n    } else {\n      this->blobs_.resize(1);\n    }\n    \/\/ Intialize the weight\n    this->blobs_[0].reset(\n        new Blob<Dtype>(NUM_OUTPUT_, CHANNELS_ \/ GROUP_, KSIZE_, KSIZE_));\n    \/\/ fill the weights\n    shared_ptr<Filler<Dtype> > weight_filler(\n        GetFiller<Dtype>(this->layer_param_.weight_filler()));\n    weight_filler->Fill(this->blobs_[0].get());\n    \/\/ If necessary, intiialize and fill the bias term\n    if (biasterm_) {\n      this->blobs_[1].reset(new Blob<Dtype>(1, 1, 1, NUM_OUTPUT_));\n      shared_ptr<Filler<Dtype> > bias_filler(\n          GetFiller<Dtype>(this->layer_param_.bias_filler()));\n      bias_filler->Fill(this->blobs_[1].get());\n    }\n  }\n  \/\/ Set up the bias filler\n  if (biasterm_) {\n    bias_multiplier_.reset(new SyncedMemory(N_ * sizeof(Dtype)));\n    Dtype* bias_multiplier_data =\n        reinterpret_cast<Dtype*>(bias_multiplier_->mutable_cpu_data());\n    for (int i = 0; i < N_; ++i) {\n        bias_multiplier_data[i] = 1.;\n    }\n  }\n};\n\n\ntemplate <typename Dtype>\nvoid ConvolutionLayer<Dtype>::Forward_cpu(const vector<Blob<Dtype>*>& bottom,\n      vector<Blob<Dtype>*>* top) {\n  const Dtype* bottom_data = bottom[0]->cpu_data();\n  Dtype* top_data = (*top)[0]->mutable_cpu_data();\n  Dtype* col_data = col_buffer_.mutable_cpu_data();\n  const Dtype* weight = this->blobs_[0]->cpu_data();\n  int weight_offset = M_ * K_;\n  int col_offset = K_ * N_;\n  int top_offset = M_ * N_;\n  for (int n = 0; n < NUM_; ++n) {\n    \/\/ First, im2col\n    im2col_cpu(bottom_data + bottom[0]->offset(n), CHANNELS_, HEIGHT_,\n        WIDTH_, KSIZE_, STRIDE_, col_data);\n    \/\/ Second, innerproduct with groups\n    for (int g = 0; g < GROUP_; ++g) {\n      caffe_cpu_gemm<Dtype>(CblasNoTrans, CblasNoTrans, M_, N_, K_,\n        (Dtype)1., weight + weight_offset * g, col_data + col_offset * g,\n        (Dtype)0., top_data + (*top)[0]->offset(n) + top_offset * g);\n    }\n    \/\/ third, add bias\n    if (biasterm_) {\n      caffe_cpu_gemm<Dtype>(CblasNoTrans, CblasNoTrans, NUM_OUTPUT_,\n          N_, 1, (Dtype)1., this->blobs_[1]->cpu_data(),\n          reinterpret_cast<const Dtype*>(bias_multiplier_->cpu_data()),\n          (Dtype)1., top_data + (*top)[0]->offset(n));\n    }\n  }\n}\n\ntemplate <typename Dtype>\nvoid ConvolutionLayer<Dtype>::Forward_gpu(const vector<Blob<Dtype>*>& bottom,\n      vector<Blob<Dtype>*>* top) {\n  const Dtype* bottom_data = bottom[0]->gpu_data();\n  Dtype* top_data = (*top)[0]->mutable_gpu_data();\n  Dtype* col_data = col_buffer_.mutable_gpu_data();\n  const Dtype* weight = this->blobs_[0]->gpu_data();\n  int weight_offset = M_ * K_;\n  int col_offset = K_ * N_;\n  int top_offset = M_ * N_;\n  for (int n = 0; n < NUM_; ++n) {\n    \/\/ First, im2col\n    im2col_gpu(bottom_data + bottom[0]->offset(n), CHANNELS_, HEIGHT_,\n        WIDTH_, KSIZE_, STRIDE_, col_data);\n    \/\/ Second, innerproduct with groups\n    for (int g = 0; g < GROUP_; ++g) {\n      caffe_gpu_gemm<Dtype>(CblasNoTrans, CblasNoTrans, M_, N_, K_,\n        (Dtype)1., weight + weight_offset * g, col_data + col_offset * g,\n        (Dtype)0., top_data + (*top)[0]->offset(n) + top_offset * g);\n    }\n    \/\/ third, add bias\n    if (biasterm_) {\n      caffe_gpu_gemm<Dtype>(CblasNoTrans, CblasNoTrans, NUM_OUTPUT_,\n          N_, 1, (Dtype)1., this->blobs_[1]->gpu_data(),\n          reinterpret_cast<const Dtype*>(bias_multiplier_->gpu_data()),\n          (Dtype)1., top_data + (*top)[0]->offset(n));\n    }\n  }\n}\n\ntemplate <typename Dtype>\nDtype ConvolutionLayer<Dtype>::Backward_cpu(const vector<Blob<Dtype>*>& top,\n      const bool propagate_down, vector<Blob<Dtype>*>* bottom) {\n  const Dtype* top_diff = top[0]->cpu_diff();\n  const Dtype* weight = this->blobs_[0]->cpu_data();\n  Dtype* weight_diff = this->blobs_[0]->mutable_cpu_diff();\n  const Dtype* bottom_data = (*bottom)[0]->cpu_data();\n  Dtype* bottom_diff = (*bottom)[0]->mutable_cpu_diff();\n  Dtype* col_data = col_buffer_.mutable_cpu_data();\n  Dtype* col_diff = col_buffer_.mutable_cpu_diff();\n  \/\/ bias gradient if necessary\n  Dtype* bias_diff = NULL;\n\n  if (biasterm_) {\n    bias_diff = this->blobs_[1]->mutable_cpu_diff();\n    memset(bias_diff, 0, sizeof(Dtype) * this->blobs_[1]->count());\n    for (int n = 0; n < NUM_; ++n) {\n      caffe_cpu_gemv<Dtype>(CblasNoTrans, NUM_OUTPUT_, N_,\n          1., top_diff + top[0]->offset(n),\n          reinterpret_cast<const Dtype*>(bias_multiplier_->cpu_data()), 1.,\n          bias_diff);\n    }\n  }\n\n  int weight_offset = M_ * K_;\n  int col_offset = K_ * N_;\n  int top_offset = M_ * N_;\n  memset(weight_diff, 0, sizeof(Dtype) * this->blobs_[0]->count());\n  for (int n = 0; n < NUM_; ++n) {\n    \/\/ since we saved memory in the forward pass by not storing all col data,\n    \/\/ we will need to recompute them.\n    im2col_cpu(bottom_data + (*bottom)[0]->offset(n), CHANNELS_, HEIGHT_,\n        WIDTH_, KSIZE_, STRIDE_, col_data);\n    \/\/ gradient w.r.t. weight. Note that we will accumulate diffs.\n    for (int g = 0; g < GROUP_; ++g) {\n      caffe_cpu_gemm<Dtype>(CblasNoTrans, CblasTrans, M_, K_, N_,\n        (Dtype)1., top_diff + top[0]->offset(n) + top_offset * g,\n        col_data + col_offset * g, (Dtype)1.,\n        weight_diff + weight_offset * g);\n    }\n    \/\/ gradient w.r.t. bottom data, if necessary\n    if (propagate_down) {\n      for (int g = 0; g < GROUP_; ++g) {\n        caffe_cpu_gemm<Dtype>(CblasTrans, CblasNoTrans, K_, N_, M_,\n          (Dtype)1., weight + weight_offset * g,\n          top_diff + top[0]->offset(n) + top_offset * g,\n          (Dtype)0., col_diff + col_offset * g);\n      }\n      \/\/ col2im back to the data\n      col2im_cpu(col_diff, CHANNELS_, HEIGHT_,\n        WIDTH_, KSIZE_, STRIDE_, bottom_diff + (*bottom)[0]->offset(n));\n    }\n  }\n  return Dtype(0.);\n}\n\ntemplate <typename Dtype>\nDtype ConvolutionLayer<Dtype>::Backward_gpu(const vector<Blob<Dtype>*>& top,\n      const bool propagate_down, vector<Blob<Dtype>*>* bottom) {\n  const Dtype* top_diff = top[0]->gpu_diff();\n  const Dtype* weight = this->blobs_[0]->gpu_data();\n  Dtype* weight_diff = this->blobs_[0]->mutable_gpu_diff();\n  const Dtype* bottom_data = (*bottom)[0]->gpu_data();\n  Dtype* bottom_diff = (*bottom)[0]->mutable_gpu_diff();\n  Dtype* col_data = col_buffer_.mutable_gpu_data();\n  Dtype* col_diff = col_buffer_.mutable_gpu_diff();\n  \/\/ bias gradient if necessary\n  Dtype* bias_diff = NULL;\n\n  if (biasterm_) {\n    bias_diff = this->blobs_[1]->mutable_gpu_diff();\n    CUDA_CHECK(cudaMemset(bias_diff, 0.,\n        sizeof(Dtype) * this->blobs_[1]->count()));\n    for (int n = 0; n < NUM_; ++n) {\n      caffe_gpu_gemv<Dtype>(CblasNoTrans, NUM_OUTPUT_, N_,\n          1., top_diff + top[0]->offset(n),\n          reinterpret_cast<const Dtype*>(bias_multiplier_->gpu_data()),\n          1., bias_diff);\n    }\n  }\n\n  int weight_offset = M_ * K_;\n  int col_offset = K_ * N_;\n  int top_offset = M_ * N_;\n  CUDA_CHECK(cudaMemset(weight_diff, 0.,\n      sizeof(Dtype) * this->blobs_[0]->count()));\n  for (int n = 0; n < NUM_; ++n) {\n    \/\/ since we saved memory in the forward pass by not storing all col data,\n    \/\/ we will need to recompute them.\n    im2col_gpu(bottom_data + (*bottom)[0]->offset(n), CHANNELS_, HEIGHT_,\n        WIDTH_, KSIZE_, STRIDE_, col_data);\n    \/\/ gradient w.r.t. weight. Note that we will accumulate diffs.\n    for (int g = 0; g < GROUP_; ++g) {\n      caffe_gpu_gemm<Dtype>(CblasNoTrans, CblasTrans, M_, K_, N_,\n        (Dtype)1., top_diff + top[0]->offset(n) + top_offset * g,\n        col_data + col_offset * g, (Dtype)1.,\n        weight_diff + weight_offset * g);\n    }\n    \/\/ gradient w.r.t. bottom data, if necessary\n    if (propagate_down) {\n      for (int g = 0; g < GROUP_; ++g) {\n        caffe_gpu_gemm<Dtype>(CblasTrans, CblasNoTrans, K_, N_, M_,\n          (Dtype)1., weight + weight_offset * g,\n          top_diff + top[0]->offset(n) + top_offset * g,\n          (Dtype)0., col_diff + col_offset * g);\n      }\n      \/\/ col2im back to the data\n      col2im_gpu(col_diff, CHANNELS_, HEIGHT_,\n          WIDTH_, KSIZE_, STRIDE_, bottom_diff + (*bottom)[0]->offset(n));\n    }\n  }\n  return Dtype(0.);\n}\n\nINSTANTIATE_CLASS(ConvolutionLayer);\n\n}  \/\/ namespace caffe\n<commit_msg>conv layer warning<commit_after>\/\/ Copyright 2013 Yangqing Jia\n\n#include <vector>\n\n#include \"caffe\/layer.hpp\"\n#include \"caffe\/vision_layers.hpp\"\n#include \"caffe\/util\/im2col.hpp\"\n#include \"caffe\/filler.hpp\"\n#include \"caffe\/util\/math_functions.hpp\"\n\nnamespace caffe {\n\ntemplate <typename Dtype>\nvoid ConvolutionLayer<Dtype>::SetUp(const vector<Blob<Dtype>*>& bottom,\n      vector<Blob<Dtype>*>* top) {\n  CHECK_EQ(bottom.size(), 1) << \"Conv Layer takes a single blob as input.\";\n  CHECK_EQ(top->size(), 1) << \"Conv Layer takes a single blob as output.\";\n  KSIZE_ = this->layer_param_.kernelsize();\n  STRIDE_ = this->layer_param_.stride();\n  GROUP_ = this->layer_param_.group();\n  NUM_ = bottom[0]->num();\n  CHANNELS_ = bottom[0]->channels();\n  HEIGHT_ = bottom[0]->height();\n  WIDTH_ = bottom[0]->width();\n  NUM_OUTPUT_ = this->layer_param_.num_output();\n  CHECK_GT(NUM_OUTPUT_, 0);\n  CHECK_EQ(CHANNELS_ % GROUP_, 0);\n  \/\/ The im2col result buffer would only hold one image at a time to avoid\n  \/\/ overly large memory usage.\n  int height_out = (HEIGHT_ - KSIZE_) \/ STRIDE_ + 1;\n  int width_out = (WIDTH_ - KSIZE_) \/ STRIDE_ + 1;\n  col_buffer_.Reshape(1, CHANNELS_ * KSIZE_ * KSIZE_, height_out, width_out);\n  \/\/ Set the parameters\n  CHECK_EQ(NUM_OUTPUT_ % GROUP_, 0)\n      << \"Number of output should be multiples of group.\";\n  biasterm_ = this->layer_param_.biasterm();\n  \/\/ Figure out the dimensions for individual gemms.\n  M_ = NUM_OUTPUT_ \/ GROUP_;\n  K_ = CHANNELS_ * KSIZE_ * KSIZE_ \/ GROUP_;\n  N_ = height_out * width_out;\n  (*top)[0]->Reshape(bottom[0]->num(), NUM_OUTPUT_, height_out, width_out);\n  \/\/ Check if we need to set up the weights\n  if (this->blobs_.size() > 0) {\n    LOG(INFO) << \"Skipping parameter initialization\";\n  } else {\n    if (biasterm_) {\n      this->blobs_.resize(2);\n    } else {\n      this->blobs_.resize(1);\n    }\n    \/\/ Intialize the weight\n    this->blobs_[0].reset(\n        new Blob<Dtype>(NUM_OUTPUT_, CHANNELS_ \/ GROUP_, KSIZE_, KSIZE_));\n    \/\/ fill the weights\n    shared_ptr<Filler<Dtype> > weight_filler(\n        GetFiller<Dtype>(this->layer_param_.weight_filler()));\n    weight_filler->Fill(this->blobs_[0].get());\n    \/\/ If necessary, intiialize and fill the bias term\n    if (biasterm_) {\n      this->blobs_[1].reset(new Blob<Dtype>(1, 1, 1, NUM_OUTPUT_));\n      shared_ptr<Filler<Dtype> > bias_filler(\n          GetFiller<Dtype>(this->layer_param_.bias_filler()));\n      bias_filler->Fill(this->blobs_[1].get());\n    }\n  }\n  \/\/ Set up the bias filler\n  if (biasterm_) {\n    bias_multiplier_.reset(new SyncedMemory(N_ * sizeof(Dtype)));\n    Dtype* bias_multiplier_data =\n        reinterpret_cast<Dtype*>(bias_multiplier_->mutable_cpu_data());\n    for (int i = 0; i < N_; ++i) {\n        bias_multiplier_data[i] = 1.;\n    }\n  }\n};\n\n\ntemplate <typename Dtype>\nvoid ConvolutionLayer<Dtype>::Forward_cpu(const vector<Blob<Dtype>*>& bottom,\n      vector<Blob<Dtype>*>* top) {\n  const Dtype* bottom_data = bottom[0]->cpu_data();\n  Dtype* top_data = (*top)[0]->mutable_cpu_data();\n  Dtype* col_data = col_buffer_.mutable_cpu_data();\n  const Dtype* weight = this->blobs_[0]->cpu_data();\n  int weight_offset = M_ * K_;\n  int col_offset = K_ * N_;\n  int top_offset = M_ * N_;\n  for (int n = 0; n < NUM_; ++n) {\n    \/\/ First, im2col\n    im2col_cpu(bottom_data + bottom[0]->offset(n), CHANNELS_, HEIGHT_,\n        WIDTH_, KSIZE_, STRIDE_, col_data);\n    \/\/ Second, innerproduct with groups\n    for (int g = 0; g < GROUP_; ++g) {\n      caffe_cpu_gemm<Dtype>(CblasNoTrans, CblasNoTrans, M_, N_, K_,\n        (Dtype)1., weight + weight_offset * g, col_data + col_offset * g,\n        (Dtype)0., top_data + (*top)[0]->offset(n) + top_offset * g);\n    }\n    \/\/ third, add bias\n    if (biasterm_) {\n      caffe_cpu_gemm<Dtype>(CblasNoTrans, CblasNoTrans, NUM_OUTPUT_,\n          N_, 1, (Dtype)1., this->blobs_[1]->cpu_data(),\n          reinterpret_cast<const Dtype*>(bias_multiplier_->cpu_data()),\n          (Dtype)1., top_data + (*top)[0]->offset(n));\n    }\n  }\n}\n\ntemplate <typename Dtype>\nvoid ConvolutionLayer<Dtype>::Forward_gpu(const vector<Blob<Dtype>*>& bottom,\n      vector<Blob<Dtype>*>* top) {\n  const Dtype* bottom_data = bottom[0]->gpu_data();\n  Dtype* top_data = (*top)[0]->mutable_gpu_data();\n  Dtype* col_data = col_buffer_.mutable_gpu_data();\n  const Dtype* weight = this->blobs_[0]->gpu_data();\n  int weight_offset = M_ * K_;\n  int col_offset = K_ * N_;\n  int top_offset = M_ * N_;\n  for (int n = 0; n < NUM_; ++n) {\n    \/\/ First, im2col\n    im2col_gpu(bottom_data + bottom[0]->offset(n), CHANNELS_, HEIGHT_,\n        WIDTH_, KSIZE_, STRIDE_, col_data);\n    \/\/ Second, innerproduct with groups\n    for (int g = 0; g < GROUP_; ++g) {\n      caffe_gpu_gemm<Dtype>(CblasNoTrans, CblasNoTrans, M_, N_, K_,\n        (Dtype)1., weight + weight_offset * g, col_data + col_offset * g,\n        (Dtype)0., top_data + (*top)[0]->offset(n) + top_offset * g);\n    }\n    \/\/ third, add bias\n    if (biasterm_) {\n      caffe_gpu_gemm<Dtype>(CblasNoTrans, CblasNoTrans, NUM_OUTPUT_,\n          N_, 1, (Dtype)1., this->blobs_[1]->gpu_data(),\n          reinterpret_cast<const Dtype*>(bias_multiplier_->gpu_data()),\n          (Dtype)1., top_data + (*top)[0]->offset(n));\n    }\n  }\n}\n\ntemplate <typename Dtype>\nDtype ConvolutionLayer<Dtype>::Backward_cpu(const vector<Blob<Dtype>*>& top,\n      const bool propagate_down, vector<Blob<Dtype>*>* bottom) {\n  const Dtype* top_diff = top[0]->cpu_diff();\n  const Dtype* weight = this->blobs_[0]->cpu_data();\n  Dtype* weight_diff = this->blobs_[0]->mutable_cpu_diff();\n  const Dtype* bottom_data = (*bottom)[0]->cpu_data();\n  Dtype* bottom_diff = (*bottom)[0]->mutable_cpu_diff();\n  Dtype* col_data = col_buffer_.mutable_cpu_data();\n  Dtype* col_diff = col_buffer_.mutable_cpu_diff();\n  \/\/ bias gradient if necessary\n  Dtype* bias_diff = NULL;\n\n  if (biasterm_) {\n    bias_diff = this->blobs_[1]->mutable_cpu_diff();\n    memset(bias_diff, 0, sizeof(Dtype) * this->blobs_[1]->count());\n    for (int n = 0; n < NUM_; ++n) {\n      caffe_cpu_gemv<Dtype>(CblasNoTrans, NUM_OUTPUT_, N_,\n          1., top_diff + top[0]->offset(n),\n          reinterpret_cast<const Dtype*>(bias_multiplier_->cpu_data()), 1.,\n          bias_diff);\n    }\n  }\n\n  int weight_offset = M_ * K_;\n  int col_offset = K_ * N_;\n  int top_offset = M_ * N_;\n  memset(weight_diff, 0, sizeof(Dtype) * this->blobs_[0]->count());\n  for (int n = 0; n < NUM_; ++n) {\n    \/\/ since we saved memory in the forward pass by not storing all col data,\n    \/\/ we will need to recompute them.\n    im2col_cpu(bottom_data + (*bottom)[0]->offset(n), CHANNELS_, HEIGHT_,\n        WIDTH_, KSIZE_, STRIDE_, col_data);\n    \/\/ gradient w.r.t. weight. Note that we will accumulate diffs.\n    for (int g = 0; g < GROUP_; ++g) {\n      caffe_cpu_gemm<Dtype>(CblasNoTrans, CblasTrans, M_, K_, N_,\n        (Dtype)1., top_diff + top[0]->offset(n) + top_offset * g,\n        col_data + col_offset * g, (Dtype)1.,\n        weight_diff + weight_offset * g);\n    }\n    \/\/ gradient w.r.t. bottom data, if necessary\n    if (propagate_down) {\n      for (int g = 0; g < GROUP_; ++g) {\n        caffe_cpu_gemm<Dtype>(CblasTrans, CblasNoTrans, K_, N_, M_,\n          (Dtype)1., weight + weight_offset * g,\n          top_diff + top[0]->offset(n) + top_offset * g,\n          (Dtype)0., col_diff + col_offset * g);\n      }\n      \/\/ col2im back to the data\n      col2im_cpu(col_diff, CHANNELS_, HEIGHT_,\n        WIDTH_, KSIZE_, STRIDE_, bottom_diff + (*bottom)[0]->offset(n));\n    }\n  }\n  return Dtype(0.);\n}\n\ntemplate <typename Dtype>\nDtype ConvolutionLayer<Dtype>::Backward_gpu(const vector<Blob<Dtype>*>& top,\n      const bool propagate_down, vector<Blob<Dtype>*>* bottom) {\n  const Dtype* top_diff = top[0]->gpu_diff();\n  const Dtype* weight = this->blobs_[0]->gpu_data();\n  Dtype* weight_diff = this->blobs_[0]->mutable_gpu_diff();\n  const Dtype* bottom_data = (*bottom)[0]->gpu_data();\n  Dtype* bottom_diff = (*bottom)[0]->mutable_gpu_diff();\n  Dtype* col_data = col_buffer_.mutable_gpu_data();\n  Dtype* col_diff = col_buffer_.mutable_gpu_diff();\n  \/\/ bias gradient if necessary\n  Dtype* bias_diff = NULL;\n\n  if (biasterm_) {\n    bias_diff = this->blobs_[1]->mutable_gpu_diff();\n    CUDA_CHECK(cudaMemset(bias_diff, 0,\n        sizeof(Dtype) * this->blobs_[1]->count()));\n    for (int n = 0; n < NUM_; ++n) {\n      caffe_gpu_gemv<Dtype>(CblasNoTrans, NUM_OUTPUT_, N_,\n          1., top_diff + top[0]->offset(n),\n          reinterpret_cast<const Dtype*>(bias_multiplier_->gpu_data()),\n          1., bias_diff);\n    }\n  }\n\n  int weight_offset = M_ * K_;\n  int col_offset = K_ * N_;\n  int top_offset = M_ * N_;\n  CUDA_CHECK(cudaMemset(weight_diff, 0,\n      sizeof(Dtype) * this->blobs_[0]->count()));\n  for (int n = 0; n < NUM_; ++n) {\n    \/\/ since we saved memory in the forward pass by not storing all col data,\n    \/\/ we will need to recompute them.\n    im2col_gpu(bottom_data + (*bottom)[0]->offset(n), CHANNELS_, HEIGHT_,\n        WIDTH_, KSIZE_, STRIDE_, col_data);\n    \/\/ gradient w.r.t. weight. Note that we will accumulate diffs.\n    for (int g = 0; g < GROUP_; ++g) {\n      caffe_gpu_gemm<Dtype>(CblasNoTrans, CblasTrans, M_, K_, N_,\n        (Dtype)1., top_diff + top[0]->offset(n) + top_offset * g,\n        col_data + col_offset * g, (Dtype)1.,\n        weight_diff + weight_offset * g);\n    }\n    \/\/ gradient w.r.t. bottom data, if necessary\n    if (propagate_down) {\n      for (int g = 0; g < GROUP_; ++g) {\n        caffe_gpu_gemm<Dtype>(CblasTrans, CblasNoTrans, K_, N_, M_,\n          (Dtype)1., weight + weight_offset * g,\n          top_diff + top[0]->offset(n) + top_offset * g,\n          (Dtype)0., col_diff + col_offset * g);\n      }\n      \/\/ col2im back to the data\n      col2im_gpu(col_diff, CHANNELS_, HEIGHT_,\n          WIDTH_, KSIZE_, STRIDE_, bottom_diff + (*bottom)[0]->offset(n));\n    }\n  }\n  return Dtype(0.);\n}\n\nINSTANTIATE_CLASS(ConvolutionLayer);\n\n}  \/\/ namespace caffe\n<|endoftext|>"}
{"text":"<commit_before>#ifndef SIGNALLP1FILTER_HPP_INCLUDED\n#define SIGNALLP1FILTER_HPP_INCLUDED\n\n#include \"HopsanCore.h\"\n\nclass SignalLP1Filter : public ComponentSignal\n{\n\nprivate:\n    double mCofrequency;\r\n    double mTimestep;\r\n    TransferFunction Filter;\n    enum {in, out};\n\npublic:\n    static Component *Creator()\n    {\n        std::cout << \"running lp1 filter creator\" << std::endl;\n        return new SignalLP1Filter(\"DefaultLP1FilterName\");\n    }\n\n    SignalLP1Filter(const string name,\n                 const double cofrequency = 100,\n                 const double timestep = 0.001)\n\t: ComponentSignal(name, timestep)\n    {\n        mCofrequency = cofrequency;\r\n        mTimestep = timestep;\n\n        addPort(\"in\", \"NodeSignal\", in);\n        addPort(\"out\", \"NodeSignal\", out);\n\n        registerParameter(\"Frequency\", \"Cut-Off Frequency\", \"[rad\/s]\", mCofrequency);\n    }\n\n\n\tvoid initialize()\n\t{\r\n\t    double num [3] = {1.0, 0.0, 0.0};\r\n\t    double den [3] = {1.0, 1.0\/mCofrequency, 0.0};\n        Filter.setCoefficients(num, den, mTimestep);\n\t}\n\n\n    void simulateOneTimestep()\n    {\n        \/\/read fron nodes\n   \t\tNode* p1_ptr = mPorts[in].getNodePtr();\n   \t\tNode* p2_ptr = mPorts[out].getNodePtr();\n\n        \/\/Get variable values from nodes\n        double u = p1_ptr->getData(NodeSignal::VALUE);\n\n        \/\/Filter equations\n\t\tdouble y = Filter.filter(u);\n\n        \/\/Write new values to nodes\n        p2_ptr->setData(NodeSignal::VALUE, y);\n    }\n};\n\n#endif \/\/ SIGNALLP1FILTER_HPP_INCLUDED\n\r\n\r\n<commit_msg>changed filter instantiation<commit_after>#ifndef SIGNALLP1FILTER_HPP_INCLUDED\n#define SIGNALLP1FILTER_HPP_INCLUDED\n\n#include \"HopsanCore.h\"\n\nclass SignalLP1Filter : public ComponentSignal\n{\n\nprivate:\n    double mCofrequency;\r\n    double mTimestep;\r\n    TransferFunction Filter;\n    enum {in, out};\n\npublic:\n    static Component *Creator()\n    {\n        std::cout << \"running lp1 filter creator\" << std::endl;\n        return new SignalLP1Filter(\"DefaultLP1FilterName\");\n    }\n\n    SignalLP1Filter(const string name,\n                 const double cofrequency = 100,\n                 const double timestep = 0.001)\n\t: ComponentSignal(name, timestep)\n    {\n        mCofrequency = cofrequency;\r\n        mTimestep = timestep;\n\n        addPort(\"in\", \"NodeSignal\", in);\n        addPort(\"out\", \"NodeSignal\", out);\n\n        registerParameter(\"Frequency\", \"Cut-Off Frequency\", \"[rad\/s]\", mCofrequency);\n    }\n\n\n\tvoid initialize()\n\t{\r\n\t    double num [3] = {1.0, 0.0, 0.0};\r\n\t    double den [3] = {1.0, 1.0\/mCofrequency, 0.0};\n        Filter.setCoefficients(num, den, mTimestep);\n\t}\n\n\n    void simulateOneTimestep()\n    {\n        \/\/read fron nodes\n   \t\tNode* p1_ptr = mPorts[in].getNodePtr();\n   \t\tNode* p2_ptr = mPorts[out].getNodePtr();\n\n        \/\/Get variable values from nodes\n        double u = p1_ptr->getData(NodeSignal::VALUE);\n\n        \/\/Filter equations\n\t\tdouble y = Filter.getValue();\n\n        \/\/Write new values to nodes\n        p2_ptr->setData(NodeSignal::VALUE, y);\r\n\r\n        \/\/Update filter:\r\n        Filter.update(u);\n    }\n};\n\n#endif \/\/ SIGNALLP1FILTER_HPP_INCLUDED\n\r\n\r\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2010-2014 RethinkDB, all rights reserved.\n#ifndef CLUSTERING_ADMINISTRATION_LOGS_LOGS_BACKEND_HPP_\n#define CLUSTERING_ADMINISTRATION_LOGS_LOGS_BACKEND_HPP_\n\n#include <string>\n#include <vector>\n\n#include \"rdb_protocol\/artificial_table\/caching_cfeed_backend.hpp\"\n#include \"clustering\/administration\/metadata.hpp\"\n\nclass server_config_client_t;\n\n\/* This backend assumes that the entries in the log file have timestamps that are unique\nand monotonically increasing. These assumptions can be broken if the system clock runs\nbackwards while the server is turned off, or if the user manually edits the log file. If\nthese assumptions are broken, the system shouldn't crash, but the contents of\n`rethinkdb.logs` are undefined. In particular, the following things will go wrong:\n  * The `rethinkdb.logs` table might have multiple entries with the same primary key.\n  * Log entries might appear in `r.db(\"rethinkdb\").table(\"logs\")` but not if the user\n    runs `r.db(\"rethinkdb\").table(\"logs\").get(primary_key)`\n  * Changefeeds on `rethinkdb.logs` might skip some changes.\n*\/\n\nclass logs_artificial_table_backend_t :\n    public cfeed_artificial_table_backend_t\n{\npublic:\n    logs_artificial_table_backend_t(\n            mailbox_manager_t *_mailbox_manager,\n            watchable_map_t<peer_id_t, cluster_directory_metadata_t> *_directory,\n            server_config_client_t *_server_config_client,\n            admin_identifier_format_t _identifier_format) :\n        mailbox_manager(_mailbox_manager),\n        directory(_directory),\n        server_config_client(_server_config_client),\n        identifier_format(_identifier_format) { }\n    ~logs_artificial_table_backend_t();\n\n    std::string get_primary_key_name();\n\n    bool read_all_rows_as_vector(signal_t *interruptor,\n                                 std::vector<ql::datum_t> *rows_out,\n                                 std::string *error_out);\n\n    bool read_row(ql::datum_t primary_key,\n                  signal_t *interruptor,\n                  ql::datum_t *row_out,\n                  std::string *error_out);\n\n    bool write_row(ql::datum_t primary_key,\n                   bool pkey_was_autogenerated,\n                   ql::datum_t *new_value_inout,\n                   signal_t *interruptor,\n                   std::string *error_out);\n\nprivate:\n    class cfeed_machinery_t : public cfeed_artificial_table_backend_t::machinery_t {\n    public:\n        cfeed_machinery_t(logs_artificial_table_backend_t *_parent);\n\n        \/* `on_change()` checks for newly-connected peers. If it finds one, it puts an\n        entry in `peers_handled` and spawns an instance of `run()`. *\/\n        void on_change(const peer_id_t &peer, const cluster_directory_metadata_t *dir);\n\n        \/* One instance of `run` will be running for each server we're in contact with\n        that hasn't been permanently removed. It first fetches the latest entry of each\n        server's log, then repeatedly checks for newer log entries at a regular interval.\n        If it sees that the server is disconnected, then it removes itself from\n        `peers_handled` and stops. *\/\n        void run(\n            const peer_id_t &peer,\n            const server_id_t &server_id,\n            const log_server_business_card_t &bcard,\n            bool is_a_starter,\n            auto_drainer_t::lock_t keepalive);\n\n        \/* Helper function for `run()`. Checks if the server is no longer present in the\n        directory; if so, removes the entry from `peers_handled` and returns `false`. *\/\n        bool check_disconnected(const peer_id_t &peer);\n\n        logs_artificial_table_backend_t *parent;\n        std::set<peer_id_t> peers_handled;\n\n        \/* `all_starters_done` is pulsed when we've fetched logs from every peer that was\n        connected to the `cfeed_machinery_t` when it was first created. When the\n        `cfeed_machinery_t` is first created, `starting` is true, and any instance of\n        `run()` that are spawned in the first group have `is_a_starter` set to `true`.\n        `num_starters_left` is initially the number of such coroutines. As soon as the\n        initial batch are spawned, `starting` is set to `false`, so any further instances\n        that are spawned for newly-connected servers will have `is_a_starter` set to\n        `false`. As each instance with `is_a_starter` set to `true` finishes fetching the\n        initial timestamp, it decrements `num_starters_left`. The last one pulses\n        `all_starters_done`.*\/\n        bool starting;\n        int num_starters_left;\n        cond_t all_starters_done;\n\n        auto_drainer_t drainer;\n        watchable_map_t<peer_id_t, cluster_directory_metadata_t>::all_subs_t dir_subs;\n    };\n\n    scoped_ptr_t<cfeed_artificial_table_backend_t::machinery_t>\n        construct_changefeed_machinery(signal_t *interruptor);\n\n    mailbox_manager_t *mailbox_manager;\n    watchable_map_t<peer_id_t, cluster_directory_metadata_t> *directory;\n    server_config_client_t *server_config_client;\n    admin_identifier_format_t identifier_format;\n};\n\n#endif \/* CLUSTERING_ADMINISTRATION_LOGS_LOGS_BACKEND_HPP_ *\/\n\n<commit_msg>Fix cpplint bug by adding explicit<commit_after>\/\/ Copyright 2010-2014 RethinkDB, all rights reserved.\n#ifndef CLUSTERING_ADMINISTRATION_LOGS_LOGS_BACKEND_HPP_\n#define CLUSTERING_ADMINISTRATION_LOGS_LOGS_BACKEND_HPP_\n\n#include <string>\n#include <vector>\n\n#include \"rdb_protocol\/artificial_table\/caching_cfeed_backend.hpp\"\n#include \"clustering\/administration\/metadata.hpp\"\n\nclass server_config_client_t;\n\n\/* This backend assumes that the entries in the log file have timestamps that are unique\nand monotonically increasing. These assumptions can be broken if the system clock runs\nbackwards while the server is turned off, or if the user manually edits the log file. If\nthese assumptions are broken, the system shouldn't crash, but the contents of\n`rethinkdb.logs` are undefined. In particular, the following things will go wrong:\n  * The `rethinkdb.logs` table might have multiple entries with the same primary key.\n  * Log entries might appear in `r.db(\"rethinkdb\").table(\"logs\")` but not if the user\n    runs `r.db(\"rethinkdb\").table(\"logs\").get(primary_key)`\n  * Changefeeds on `rethinkdb.logs` might skip some changes.\n*\/\n\nclass logs_artificial_table_backend_t :\n    public cfeed_artificial_table_backend_t\n{\npublic:\n    logs_artificial_table_backend_t(\n            mailbox_manager_t *_mailbox_manager,\n            watchable_map_t<peer_id_t, cluster_directory_metadata_t> *_directory,\n            server_config_client_t *_server_config_client,\n            admin_identifier_format_t _identifier_format) :\n        mailbox_manager(_mailbox_manager),\n        directory(_directory),\n        server_config_client(_server_config_client),\n        identifier_format(_identifier_format) { }\n    ~logs_artificial_table_backend_t();\n\n    std::string get_primary_key_name();\n\n    bool read_all_rows_as_vector(signal_t *interruptor,\n                                 std::vector<ql::datum_t> *rows_out,\n                                 std::string *error_out);\n\n    bool read_row(ql::datum_t primary_key,\n                  signal_t *interruptor,\n                  ql::datum_t *row_out,\n                  std::string *error_out);\n\n    bool write_row(ql::datum_t primary_key,\n                   bool pkey_was_autogenerated,\n                   ql::datum_t *new_value_inout,\n                   signal_t *interruptor,\n                   std::string *error_out);\n\nprivate:\n    class cfeed_machinery_t : public cfeed_artificial_table_backend_t::machinery_t {\n    public:\n        explicit cfeed_machinery_t(logs_artificial_table_backend_t *_parent);\n\n        \/* `on_change()` checks for newly-connected peers. If it finds one, it puts an\n        entry in `peers_handled` and spawns an instance of `run()`. *\/\n        void on_change(const peer_id_t &peer, const cluster_directory_metadata_t *dir);\n\n        \/* One instance of `run` will be running for each server we're in contact with\n        that hasn't been permanently removed. It first fetches the latest entry of each\n        server's log, then repeatedly checks for newer log entries at a regular interval.\n        If it sees that the server is disconnected, then it removes itself from\n        `peers_handled` and stops. *\/\n        void run(\n            const peer_id_t &peer,\n            const server_id_t &server_id,\n            const log_server_business_card_t &bcard,\n            bool is_a_starter,\n            auto_drainer_t::lock_t keepalive);\n\n        \/* Helper function for `run()`. Checks if the server is no longer present in the\n        directory; if so, removes the entry from `peers_handled` and returns `false`. *\/\n        bool check_disconnected(const peer_id_t &peer);\n\n        logs_artificial_table_backend_t *parent;\n        std::set<peer_id_t> peers_handled;\n\n        \/* `all_starters_done` is pulsed when we've fetched logs from every peer that was\n        connected to the `cfeed_machinery_t` when it was first created. When the\n        `cfeed_machinery_t` is first created, `starting` is true, and any instance of\n        `run()` that are spawned in the first group have `is_a_starter` set to `true`.\n        `num_starters_left` is initially the number of such coroutines. As soon as the\n        initial batch are spawned, `starting` is set to `false`, so any further instances\n        that are spawned for newly-connected servers will have `is_a_starter` set to\n        `false`. As each instance with `is_a_starter` set to `true` finishes fetching the\n        initial timestamp, it decrements `num_starters_left`. The last one pulses\n        `all_starters_done`.*\/\n        bool starting;\n        int num_starters_left;\n        cond_t all_starters_done;\n\n        auto_drainer_t drainer;\n        watchable_map_t<peer_id_t, cluster_directory_metadata_t>::all_subs_t dir_subs;\n    };\n\n    scoped_ptr_t<cfeed_artificial_table_backend_t::machinery_t>\n        construct_changefeed_machinery(signal_t *interruptor);\n\n    mailbox_manager_t *mailbox_manager;\n    watchable_map_t<peer_id_t, cluster_directory_metadata_t> *directory;\n    server_config_client_t *server_config_client;\n    admin_identifier_format_t identifier_format;\n};\n\n#endif \/* CLUSTERING_ADMINISTRATION_LOGS_LOGS_BACKEND_HPP_ *\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"plane_sweeper_2d3d.hpp\"\n\n#include <cmath>\n#include <iostream>\n#include <iomanip>\n\n#include \"error.hpp\"\n\nusing std::cout;\nusing std::endl;\nusing std::cin;\nusing std::setfill;\nusing std::setw;\n\nnamespace mocc {\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/\/ \\todo make sure to check the angular quadratures for conformance\n    PlaneSweeper_2D3D::PlaneSweeper_2D3D( const pugi::xml_node &input,\n            const CoreMesh &mesh ):\n        mesh_(mesh),\n        sn_sweeper_(input.child(\"sn_sweeper\"), mesh),\n        moc_sweeper_(input.child(\"moc_sweeper\"), mesh),\n        ang_quad_(moc_sweeper_.get_ang_quad()),\n        corrections_( sn_sweeper_.n_reg(), ang_quad_.ndir()\/2,\n                sn_sweeper_.n_group() ),\n        tl_( sn_sweeper_.n_group(), mesh_.n_pin() ),\n        sn_resid_( sn_sweeper_.n_group() ),\n        i_outer_( 0 )\n    {\n        \/\/\/ \\todo initialize the rest of the data members on the TS base type\n        core_mesh_ = &mesh;\n        xs_mesh_ = moc_sweeper_.get_xs_mesh();\n        n_reg_ = moc_sweeper_.n_reg();\n        n_group_ = xs_mesh_->n_group();\n        flux_.reference(moc_sweeper_.flux());\n\n        sn_sweeper_.set_corrections( &corrections_ );\n        const XSMeshHomogenized* sn_xs_mesh =\n            sn_sweeper_.get_homogenized_xsmesh().get();\n        moc_sweeper_.set_coupling( &corrections_, sn_xs_mesh );\n\n        sn_sweeper_.set_ang_quad(ang_quad_);\n\n        sn_sweeper_.get_homogenized_xsmesh()->set_flux( flux_ );\n\n        coarse_data_ = nullptr;\n\n        this->parse_options( input );\n\n        return;\n    }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    void PlaneSweeper_2D3D::sweep( int group ) {\n        if( !coarse_data_ ) {\n            throw EXCEPT(\"CMFD must be enabled to do 2D3D.\");\n        }\n\n        \/\/\/ \\todo do something less brittle\n        if( group == 0 ) {\n            i_outer_++;\n        }\n\n        sn_sweeper_.get_homogenized_xsmesh()->update( );\n        sn_sweeper_.sweep( group );\n\n        if( do_snproject_ ) {\n            ArrayB1 sn_flux;\n            sn_sweeper_.get_pin_flux_1g( group, sn_flux );\n            moc_sweeper_.set_pin_flux_1g( group, sn_flux );\n        }\n\n        \/\/ Calculate transverse leakage source\n        if( do_tl_ ) {\n            this->add_tl( group );\n        }\n\n        if( i_outer_ > n_inactive_moc_ ) {\n            moc_sweeper_.sweep( group );\n        }\n\n        \/\/ Compute Sn-MoC residual\n        ArrayB1 moc_flux( mesh_.n_pin() );\n        moc_sweeper_.get_pin_flux_1g( group, moc_flux );\n\n        real_t residual = 0.0;\n        for( size_t i=0; i<moc_flux.size(); i++ ) {\n            residual += (moc_flux(i) - sn_sweeper_.flux( group, i )) *\n                        (moc_flux(i) - sn_sweeper_.flux( group, i ));\n        }\n        residual = sqrt(residual)\/mesh_.n_pin();\n\n        sn_resid_[group].push_back(residual);\n        cout << \"MoC\/Sn residual: \" << residual << endl;\n    }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    void PlaneSweeper_2D3D::initialize() {\n        sn_sweeper_.initialize();\n        moc_sweeper_.initialize();\n    }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    void PlaneSweeper_2D3D::get_pin_flux_1g( int ig, ArrayB1 &flux ) const {\n        if( expose_sn_ ) {\n            sn_sweeper_.get_pin_flux_1g( ig, flux );\n        } else {\n            moc_sweeper_.get_pin_flux_1g( ig, flux );\n        }\n    }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    real_t PlaneSweeper_2D3D::total_fission( bool old ) const {\n        \/\/ using the MoC for now, but once things start to converge, might want\n        \/\/ to use Sn, since it should yield the same result at convergence and\n        \/\/ is cheaper to evaluate.\n        real_t tfis = moc_sweeper_.total_fission( old );\n        return tfis;\n    }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    void PlaneSweeper_2D3D::calc_fission_source( real_t k,\n            ArrayF &fission_source ) const {\n        moc_sweeper_.calc_fission_source( k, fission_source );\n        return;\n    }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    void PlaneSweeper_2D3D::add_tl( int group ) {\n        assert( coarse_data_ );\n        ArrayB1 tl_fsr( n_reg_ );\n\n        int ireg_pin = 0;\n        int ipin = 0;\n\n        blitz::Array<real_t, 1> tl_g = tl_(group, blitz::Range::all());\n\n        for( const auto &pin: mesh_ ) {\n            Position pos = mesh_.pin_position( ipin );\n            size_t icell = mesh_.coarse_cell( pos );\n            real_t dz = mesh_.dz( pos.z );\n            int surf_up = mesh_.coarse_surf( icell, Surface::TOP );\n            int surf_down = mesh_.coarse_surf( icell, Surface::BOTTOM );\n            real_t j_up = coarse_data_->current(surf_up, group);\n            real_t j_down = coarse_data_->current(surf_down, group);\n            tl_g(ipin) = ( j_down - j_up ) \/ dz;\n\n            for( int ir=0; ir<pin->n_reg(); ir++ ) {\n                tl_fsr( ir+ireg_pin ) = tl_g(ipin);\n            }\n            ipin++;\n            ireg_pin += pin->n_reg();\n        }\n\n        \/\/ Can add the TL as an auxiliary source directly to the Source_2D3D,\n        \/\/ since it extends the MoC source in the first place\n        source_->auxiliary( tl_fsr );\n    }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    void PlaneSweeper_2D3D::output( H5::CommonFG *file ) const {\n        \/\/ Put the Sn data in its own location\n        {\n            H5::Group g = file->createGroup( \"\/Sn\" );\n            sn_sweeper_.output( &g );\n        }\n\n        \/\/ Put the MoC data in its own location\n        {\n            H5::Group g = file->createGroup( \"\/MoC\" );\n            moc_sweeper_.output( &g );\n        }\n\n        VecI dims;\n        dims.push_back(mesh_.nz());\n        dims.push_back(mesh_.ny());\n        dims.push_back(mesh_.nx());\n\n        \/\/ Write out the Sn-MoC residual convergence\n        file->createGroup(\"\/SnResid\");\n        for( size_t g=0; g<n_group_; g++ ) {\n            std::stringstream setname;\n            setname << \"\/SnResid\/\" << setfill('0') << setw(3) << g;\n            VecI niter(1, sn_resid_[g].size());\n            HDF::Write( file, setname.str(), sn_resid_[g], niter );\n        }\n\n        \/\/ Write out the transverse leakages\n        file->createGroup(\"\/TL\");\n        for( size_t g=0; g<n_group_; g++ ) {\n            std::stringstream setname;\n            setname << \"\/TL\/\" << setfill('0') << setw(3) << g;\n\n            const auto tl_slice = tl_((int)g, blitz::Range::all());\n\n            HDF::Write( file, setname.str(), tl_slice.begin(), tl_slice.end(),\n                    dims );\n        }\n\n        \/\/ Write out the correction factors\n        file->createGroup(\"\/alpha_x\");\n        file->createGroup(\"\/alpha_y\");\n        file->createGroup(\"\/beta\");\n\n        for( size_t g=0; g<n_group_; g++ ) {\n            for( int a=0; a<ang_quad_.ndir_oct()*4; a++ ) {\n                VecF alpha_x( mesh_.n_pin(), 0.0 );\n                VecF alpha_y( mesh_.n_pin(), 0.0 );\n                VecF beta( mesh_.n_pin(), 0.0 );\n                for( size_t i=0; i<mesh_.n_pin(); i++ ) {\n                    alpha_x[i] = corrections_.alpha( i, a, g, Normal::X_NORM );\n                    alpha_y[i] = corrections_.alpha( i, a, g, Normal::Y_NORM );\n                    beta[i] = corrections_.beta( i, a, g );\n                }\n\n                {\n                    std::stringstream setname;\n                    setname << \"\/beta\/\" << g << \"_\" << a;\n                    HDF::Write( file, setname.str(), beta, dims );\n                }\n\n                {\n                    std::stringstream setname;\n                    setname << \"\/alpha_x\/\" << setfill('0') << setw(3) << g\n                            << \"_\"         << setfill('0') << setw(3) << a;\n                    HDF::Write( file, setname.str(), alpha_x, dims );\n                }\n\n                {\n                    std::stringstream setname;\n                    setname << \"\/alpha_y\/\" << setfill('0') << setw(3) << g\n                            << \"_\"         << setfill('0') << setw(3) << a;\n                    HDF::Write( file, setname.str(), alpha_y, dims );\n                }\n            }\n        }\n    }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ At some point it might be nice to make the options const and initialized\n    \/\/ them in the initializer list, then just check for validity later. This if\n    \/\/ fine for now.\n    void PlaneSweeper_2D3D::parse_options( const pugi::xml_node &input ) {\n        \/\/ Set defaults for everything\n        expose_sn_ = false;\n        do_snproject_ = true;\n        do_tl_ = true;\n        n_inactive_moc_ = 0;\n\n        \/\/ Override with entries in the input node\n        if( !input.attribute(\"sn_expose\").empty() ) {\n            expose_sn_ = input.attribute(\"sn_expose\").as_bool();\n        }\n        if( !input.attribute(\"sn_project\").empty() ) {\n            do_snproject_ = input.attribute(\"sn_project\").as_bool();\n        }\n        if( !input.attribute(\"tl\").empty() ) {\n            do_tl_ = input.attribute(\"tl\").as_bool();\n        }\n        if( !input.attribute(\"inactive_moc\").empty() ) {\n            n_inactive_moc_ = input.attribute(\"inactive_moc\").as_int();\n        }\n\n        LogFile << \"2D3D Sweeper options:\" << std::endl;\n        LogFile << \"    Sn Projection: \" << do_snproject_ << std::endl;\n        LogFile << \"    Transversd Leakage: \" << do_snproject_ << std::endl;\n        LogFile << \"    Inactive MoC Outer Iterations: \" \n            << n_inactive_moc_ << std::endl;\n\n\n    }\n}\n<commit_msg>Fix bug in Sn flux projection<commit_after>#include \"plane_sweeper_2d3d.hpp\"\n\n#include <cmath>\n#include <iostream>\n#include <iomanip>\n\n#include \"error.hpp\"\n\nusing std::cout;\nusing std::endl;\nusing std::cin;\nusing std::setfill;\nusing std::setw;\n\nnamespace mocc {\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/\/ \\todo make sure to check the angular quadratures for conformance\n    PlaneSweeper_2D3D::PlaneSweeper_2D3D( const pugi::xml_node &input,\n            const CoreMesh &mesh ):\n        mesh_(mesh),\n        sn_sweeper_(input.child(\"sn_sweeper\"), mesh),\n        moc_sweeper_(input.child(\"moc_sweeper\"), mesh),\n        ang_quad_(moc_sweeper_.get_ang_quad()),\n        corrections_( sn_sweeper_.n_reg(), ang_quad_.ndir()\/2,\n                sn_sweeper_.n_group() ),\n        tl_( sn_sweeper_.n_group(), mesh_.n_pin() ),\n        sn_resid_( sn_sweeper_.n_group() ),\n        i_outer_( 0 )\n    {\n        \/\/\/ \\todo initialize the rest of the data members on the TS base type\n        core_mesh_ = &mesh;\n        xs_mesh_ = moc_sweeper_.get_xs_mesh();\n        n_reg_ = moc_sweeper_.n_reg();\n        n_group_ = xs_mesh_->n_group();\n        flux_.reference(moc_sweeper_.flux());\n\n        sn_sweeper_.set_corrections( &corrections_ );\n        const XSMeshHomogenized* sn_xs_mesh =\n            sn_sweeper_.get_homogenized_xsmesh().get();\n        moc_sweeper_.set_coupling( &corrections_, sn_xs_mesh );\n\n        sn_sweeper_.set_ang_quad(ang_quad_);\n\n        sn_sweeper_.get_homogenized_xsmesh()->set_flux( flux_ );\n\n        coarse_data_ = nullptr;\n\n        this->parse_options( input );\n\n        return;\n    }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    void PlaneSweeper_2D3D::sweep( int group ) {\n        if( !coarse_data_ ) {\n            throw EXCEPT(\"CMFD must be enabled to do 2D3D.\");\n        }\n\n        \/\/\/ \\todo do something less brittle\n        if( group == 0 ) {\n            i_outer_++;\n        }\n\n        \/\/ Sn sweeper\n        sn_sweeper_.get_homogenized_xsmesh()->update( );\n        sn_sweeper_.sweep( group );\n\n        if( do_snproject_ ) {\n            ArrayB1 sn_flux(sn_sweeper_.n_reg());\n            sn_sweeper_.get_pin_flux_1g( group, sn_flux );\n            moc_sweeper_.set_pin_flux_1g( group, sn_flux );\n        }\n\n        \/\/ Calculate transverse leakage source\n        if( do_tl_ ) {\n            this->add_tl( group );\n        }\n\n        \/\/ MoC Sweeper\n        if( i_outer_ > n_inactive_moc_ ) {\n            moc_sweeper_.sweep( group );\n        }\n\n        \/\/ Compute Sn-MoC residual\n        ArrayB1 moc_flux( mesh_.n_pin() );\n        moc_sweeper_.get_pin_flux_1g( group, moc_flux );\n\n        real_t residual = 0.0;\n        for( size_t i=0; i<moc_flux.size(); i++ ) {\n            residual += (moc_flux(i) - sn_sweeper_.flux( group, i )) *\n                        (moc_flux(i) - sn_sweeper_.flux( group, i ));\n        }\n        residual = sqrt(residual)\/mesh_.n_pin();\n\n        sn_resid_[group].push_back(residual);\n        cout << \"MoC\/Sn residual: \" << residual << endl;\n    }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    void PlaneSweeper_2D3D::initialize() {\n        sn_sweeper_.initialize();\n        moc_sweeper_.initialize();\n    }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    void PlaneSweeper_2D3D::get_pin_flux_1g( int ig, ArrayB1 &flux ) const {\n        if( expose_sn_ ) {\n            sn_sweeper_.get_pin_flux_1g( ig, flux );\n        } else {\n            moc_sweeper_.get_pin_flux_1g( ig, flux );\n        }\n    }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    real_t PlaneSweeper_2D3D::total_fission( bool old ) const {\n        \/\/ using the MoC for now, but once things start to converge, might want\n        \/\/ to use Sn, since it should yield the same result at convergence and\n        \/\/ is cheaper to evaluate.\n        real_t tfis = moc_sweeper_.total_fission( old );\n        return tfis;\n    }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    void PlaneSweeper_2D3D::calc_fission_source( real_t k,\n            ArrayF &fission_source ) const {\n        moc_sweeper_.calc_fission_source( k, fission_source );\n        return;\n    }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    void PlaneSweeper_2D3D::add_tl( int group ) {\n        assert( coarse_data_ );\n        ArrayB1 tl_fsr( n_reg_ );\n\n        int ireg_pin = 0;\n        int ipin = 0;\n\n        blitz::Array<real_t, 1> tl_g = tl_(group, blitz::Range::all());\n\n        for( const auto &pin: mesh_ ) {\n            Position pos = mesh_.pin_position( ipin );\n            size_t icell = mesh_.coarse_cell( pos );\n            real_t dz = mesh_.dz( pos.z );\n            int surf_up = mesh_.coarse_surf( icell, Surface::TOP );\n            int surf_down = mesh_.coarse_surf( icell, Surface::BOTTOM );\n            real_t j_up = coarse_data_->current(surf_up, group);\n            real_t j_down = coarse_data_->current(surf_down, group);\n            tl_g(ipin) = ( j_down - j_up ) \/ dz;\n\n            for( int ir=0; ir<pin->n_reg(); ir++ ) {\n                tl_fsr( ir+ireg_pin ) = tl_g(ipin);\n            }\n            ipin++;\n            ireg_pin += pin->n_reg();\n        }\n\n        \/\/ Can add the TL as an auxiliary source directly to the Source_2D3D,\n        \/\/ since it extends the MoC source in the first place\n        source_->auxiliary( tl_fsr );\n    }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    void PlaneSweeper_2D3D::output( H5::CommonFG *file ) const {\n        \/\/ Put the Sn data in its own location\n        {\n            H5::Group g = file->createGroup( \"\/Sn\" );\n            sn_sweeper_.output( &g );\n        }\n\n        \/\/ Put the MoC data in its own location\n        {\n            H5::Group g = file->createGroup( \"\/MoC\" );\n            moc_sweeper_.output( &g );\n        }\n\n        VecI dims;\n        dims.push_back(mesh_.nz());\n        dims.push_back(mesh_.ny());\n        dims.push_back(mesh_.nx());\n\n        \/\/ Write out the Sn-MoC residual convergence\n        file->createGroup(\"\/SnResid\");\n        for( size_t g=0; g<n_group_; g++ ) {\n            std::stringstream setname;\n            setname << \"\/SnResid\/\" << setfill('0') << setw(3) << g;\n            VecI niter(1, sn_resid_[g].size());\n            HDF::Write( file, setname.str(), sn_resid_[g], niter );\n        }\n\n        \/\/ Write out the transverse leakages\n        file->createGroup(\"\/TL\");\n        for( size_t g=0; g<n_group_; g++ ) {\n            std::stringstream setname;\n            setname << \"\/TL\/\" << setfill('0') << setw(3) << g;\n\n            const auto tl_slice = tl_((int)g, blitz::Range::all());\n\n            HDF::Write( file, setname.str(), tl_slice.begin(), tl_slice.end(),\n                    dims );\n        }\n\n        \/\/ Write out the correction factors\n        file->createGroup(\"\/alpha_x\");\n        file->createGroup(\"\/alpha_y\");\n        file->createGroup(\"\/beta\");\n\n        for( size_t g=0; g<n_group_; g++ ) {\n            for( int a=0; a<ang_quad_.ndir_oct()*4; a++ ) {\n                VecF alpha_x( mesh_.n_pin(), 0.0 );\n                VecF alpha_y( mesh_.n_pin(), 0.0 );\n                VecF beta( mesh_.n_pin(), 0.0 );\n                for( size_t i=0; i<mesh_.n_pin(); i++ ) {\n                    alpha_x[i] = corrections_.alpha( i, a, g, Normal::X_NORM );\n                    alpha_y[i] = corrections_.alpha( i, a, g, Normal::Y_NORM );\n                    beta[i] = corrections_.beta( i, a, g );\n                }\n\n                {\n                    std::stringstream setname;\n                    setname << \"\/beta\/\" << g << \"_\" << a;\n                    HDF::Write( file, setname.str(), beta, dims );\n                }\n\n                {\n                    std::stringstream setname;\n                    setname << \"\/alpha_x\/\" << setfill('0') << setw(3) << g\n                            << \"_\"         << setfill('0') << setw(3) << a;\n                    HDF::Write( file, setname.str(), alpha_x, dims );\n                }\n\n                {\n                    std::stringstream setname;\n                    setname << \"\/alpha_y\/\" << setfill('0') << setw(3) << g\n                            << \"_\"         << setfill('0') << setw(3) << a;\n                    HDF::Write( file, setname.str(), alpha_y, dims );\n                }\n            }\n        }\n    }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \/\/ At some point it might be nice to make the options const and initialized\n    \/\/ them in the initializer list, then just check for validity later. This if\n    \/\/ fine for now.\n    void PlaneSweeper_2D3D::parse_options( const pugi::xml_node &input ) {\n        \/\/ Set defaults for everything\n        expose_sn_ = false;\n        do_snproject_ = true;\n        do_tl_ = true;\n        n_inactive_moc_ = 0;\n\n        \/\/ Override with entries in the input node\n        if( !input.attribute(\"sn_expose\").empty() ) {\n            expose_sn_ = input.attribute(\"sn_expose\").as_bool();\n        }\n        if( !input.attribute(\"sn_project\").empty() ) {\n            do_snproject_ = input.attribute(\"sn_project\").as_bool();\n        }\n        if( !input.attribute(\"tl\").empty() ) {\n            do_tl_ = input.attribute(\"tl\").as_bool();\n        }\n        if( !input.attribute(\"inactive_moc\").empty() ) {\n            n_inactive_moc_ = input.attribute(\"inactive_moc\").as_int();\n        }\n\n        LogFile << \"2D3D Sweeper options:\" << std::endl;\n        LogFile << \"    Sn Projection: \" << do_snproject_ << std::endl;\n        LogFile << \"    Transversd Leakage: \" << do_snproject_ << std::endl;\n        LogFile << \"    Inactive MoC Outer Iterations: \" \n            << n_inactive_moc_ << std::endl;\n\n\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"fuel_fab.h\"\n\n#include <gtest\/gtest.h>\n#include <sstream>\n#include \"cyclus.h\"\n\nusing pyne::nucname::id;\nusing cyclus::Composition;\nusing cyclus::CompMap;\nusing cyclus::Material;\nusing cyclus::QueryResult;\nusing cyclus::Cond;\nusing cyclus::toolkit::MatQuery;\n\nnamespace cycamore {\n\nComposition::Ptr c_uox() {\n  CompMap m;\n  m[id(\"u235\")] = 0.04;\n  m[id(\"u238\")] = 0.96;\n  return Composition::CreateFromMass(m);\n};\n\nComposition::Ptr c_mox() {\n  CompMap m;\n  m[id(\"u235\")] = .7;\n  m[id(\"u238\")] = 100;\n  m[id(\"pu239\")] = 3.3;\n  return Composition::CreateFromMass(m);\n};\n\nComposition::Ptr c_natu() {\n  CompMap m;\n  m[id(\"u235\")] =  .007;\n  m[id(\"u238\")] =  .993;\n  return Composition::CreateFromMass(m);\n};\n\nComposition::Ptr c_pustream() {\n  CompMap m;\n  m[id(\"pu239\")] = 100;\n  m[id(\"pu240\")] = 10;\n  m[id(\"pu241\")] = 1;\n  m[id(\"pu242\")] = 1;\n  return Composition::CreateFromMass(m);\n};\n\nComposition::Ptr c_pustreamlow() {\n  CompMap m;\n  m[id(\"pu239\")] = 80;\n  m[id(\"pu240\")] = 10;\n  m[id(\"pu241\")] = 1;\n  m[id(\"pu242\")] = 1;\n  return Composition::CreateFromMass(m);\n};\n\nComposition::Ptr c_pustreambad() {\n  CompMap m;\n  m[id(\"pu239\")] = 10;\n  m[id(\"pu240\")] = 10;\n  m[id(\"pu241\")] = 1;\n  m[id(\"pu242\")] = 1;\n  return Composition::CreateFromMass(m);\n};\n\nComposition::Ptr c_water() {\n  CompMap m;\n  m[id(\"O16\")] =  1;\n  m[id(\"H1\")] =  2;\n  return Composition::CreateFromAtom(m);\n};\n\nTEST(FuelFabTests, CosiWeight) {\n  cyclus::Env::SetNucDataPath();\n  CompMap m;\n  m[942390000] = 1;\n  Composition::Ptr c = Composition::CreateFromMass(m);\n  double w = CosiWeight(c, \"thermal\");\n  EXPECT_DOUBLE_EQ(1.0, w);\n\n  m.clear();\n  m[922380000] = 1;\n  c = Composition::CreateFromMass(m);\n  w = CosiWeight(c, \"thermal\");\n  EXPECT_DOUBLE_EQ(0.0, w);\n\n  m.clear();\n  m[942390000] = 1;\n  c = Composition::CreateFromMass(m);\n  w = CosiWeight(c, \"fission_spectrum_ave\");\n  EXPECT_DOUBLE_EQ(1.0, w);\n\n  m.clear();\n  m[922380000] = 1;\n  c = Composition::CreateFromMass(m);\n  w = CosiWeight(c, \"fission_spectrum_ave\");\n  EXPECT_DOUBLE_EQ(0.0, w);\n\n  m.clear();\n  m[922380000] = 1;\n  m[942390000] = 1;\n  c = Composition::CreateFromAtom(m);\n  w = CosiWeight(c, \"thermal\");\n  EXPECT_DOUBLE_EQ(0.5, w) << \"might be using mass-fractions instead of atom\";\n\n  m.clear();\n  m[922380000] = 1;\n  m[942390000] = 1;\n  c = Composition::CreateFromAtom(m);\n  w = CosiWeight(c, \"fission_spectrum_ave\");\n  EXPECT_DOUBLE_EQ(0.5, w) << \"might be using mass-fractions instead of atom\";\n\n  m.clear();\n  m[922380000] = 1;\n  m[942390000] = 1;\n  m[922350000] = 1;\n  c = Composition::CreateFromAtom(m);\n  double w_therm = CosiWeight(c, \"thermal\");\n  double w_fast = CosiWeight(c, \"fission_spectrum_ave\");\n  EXPECT_GT(w_therm, w_fast);\n}\n\nTEST(FuelFabTests, HighFrac) {\n  double w_fill = CosiWeight(c_natu(), \"thermal\");\n  double w_fiss = CosiWeight(c_pustream(), \"thermal\");\n  double w_target = CosiWeight(c_uox(), \"thermal\");\n\n  EXPECT_THROW(HighFrac(w_fiss, w_target, w_fill), cyclus::ValueError);\n  EXPECT_THROW(HighFrac(w_target, w_fill, w_fiss), cyclus::ValueError);\n  EXPECT_THROW(HighFrac(w_target, w_fiss, w_fill), cyclus::ValueError);\n\n  double f = HighFrac(w_fill, w_target, w_fiss);\n  EXPECT_DOUBLE_EQ((w_target-w_fill)\/(w_fiss-w_fill), f);\n}\n\nTEST(FuelFabTests, LowFrac) {\n  double w_fill = CosiWeight(c_natu(), \"thermal\");\n  double w_fiss = CosiWeight(c_pustream(), \"thermal\");\n  double w_target = CosiWeight(c_uox(), \"thermal\");\n\n  EXPECT_THROW(LowFrac(w_fiss, w_target, w_fill), cyclus::ValueError);\n  EXPECT_THROW(LowFrac(w_target, w_fill, w_fiss), cyclus::ValueError);\n  EXPECT_THROW(LowFrac(w_target, w_fiss, w_fill), cyclus::ValueError);\n\n  double f = LowFrac(w_fill, w_target, w_fiss);\n  EXPECT_DOUBLE_EQ((w_fiss-w_target)\/(w_fiss-w_fill), f);\n}\n\nTEST(FuelFabTests, ValidWeights) {\n  double w_fill = CosiWeight(c_natu(), \"thermal\");\n  double w_fiss = CosiWeight(c_pustream(), \"thermal\");\n  double w_target = CosiWeight(c_uox(), \"thermal\");\n\n  EXPECT_EQ(true, ValidWeights(w_fill, w_target, w_fiss));\n  EXPECT_EQ(false, ValidWeights(w_fiss, w_target, w_fill));\n  EXPECT_EQ(false, ValidWeights(w_target, w_fill, w_fiss));\n  EXPECT_EQ(false, ValidWeights(w_fiss, w_fill, w_target));\n  EXPECT_EQ(false, ValidWeights(w_target, w_fiss, w_fill));\n  EXPECT_EQ(false, ValidWeights(w_fill, w_fiss, w_target));\n}\n\nTEST(FuelFabTests, Template) {\n  std::string config = \n     \"<fill_commod>commod<\/fill_commod>\"\n     \"<fill_recipe>recipe<\/fill_recipe>\"\n     \"<fill_size>1<\/fill_size>\"\n     \"\"\n     \"<fiss_commods> <val>commod<\/val> <val>commod<\/val> <\/fiss_commods>\"\n     \"<fiss_size>1<\/fiss_size>\"\n     \"\"\n     \"<topup_commod>commod<\/topup_commod>\"\n     \"<topup_recipe>recipe<\/topup_recipe>\"\n     \"<topup_size>1<\/topup_size>\"\n     \"\"\n     \"<outcommod>commod<\/outcommod>\"\n     \"<spectrum>thermal<\/spectrum>\"\n     \"<throughput>1<\/throughput>\"\n     ;\n\n  int simdur = 50;\n  cyclus::MockSim sim(cyclus::AgentSpec(\":cycamore:FuelFab\"), config, simdur);\n  \/\/sim.AddSource(\"enriched_u\").Finalize();\n  \/\/sim.AddRecipe(\"lwr_fresh\", c_uox());\n  \/\/sim.AddRecipe(\"lwr_spent\", c_spentuox());\n  \/\/int id = sim.Run();\n\n  \/\/QueryResult qr = sim.db().Query(\"Transactions\", NULL);\n  \/\/EXPECT_EQ(simdur, qr.rows.size()) << \"failed to order+run on fresh fuel inside 1 time step\";\n}\n\n\/\/ request (and receive) a specific recipe for fissile stream correctly.\nTEST(FuelFabTests, FissRecipe) {\n  std::string config = \n     \"<fill_commod>dummy<\/fill_commod>\"\n     \"<fill_recipe>natu<\/fill_recipe>\"\n     \"<fill_size>1<\/fill_size>\"\n     \"\"\n     \"<fiss_commods> <val>stream1<\/val> <val>stream2<\/val> <val>stream3<\/val> <\/fiss_commods>\"\n     \"<fiss_size>2.5<\/fiss_size>\"\n     \"<fiss_recipe>spentuox<\/fiss_recipe>\"\n     \"\"\n     \"<outcommod>dummyout<\/outcommod>\"\n     \"<spectrum>thermal<\/spectrum>\"\n     \"<throughput>0<\/throughput>\"\n     ;\n\n  int simdur = 1;\n  cyclus::MockSim sim(cyclus::AgentSpec(\":cycamore:FuelFab\"), config, simdur);\n  sim.AddSource(\"stream1\").Finalize();\n  sim.AddRecipe(\"spentuox\", c_pustream());\n  sim.AddRecipe(\"natu\", c_natu());\n  int id = sim.Run();\n\n  int resid = sim.db().Query(\"Transactions\", NULL).GetVal<int>(\"ResourceId\");\n  CompMap got = sim.GetMaterial(resid)->comp()->mass();\n  CompMap want = c_pustream()->mass();\n  cyclus::compmath::Normalize(&got);\n  cyclus::compmath::Normalize(&want);\n  CompMap::iterator it;\n  for (it = want.begin(); it != want.end(); ++it) {\n    EXPECT_DOUBLE_EQ(it->second, got[it->first]) << \"nuclide qty off: \" << pyne::nucname::name(it->first);\n  }\n}\n\n\/\/ multiple fissile streams can be correctly requested and used as\n\/\/ fissile material inventory.\nTEST(FuelFabTests, MultipleFissStreams) {\n  std::string config = \n     \"<fill_commod>dummy<\/fill_commod>\"\n     \"<fill_recipe>natu<\/fill_recipe>\"\n     \"<fill_size>1<\/fill_size>\"\n     \"\"\n     \"<fiss_commods> <val>stream1<\/val> <val>stream2<\/val> <val>stream3<\/val> <\/fiss_commods>\"\n     \"<fiss_size>2.5<\/fiss_size>\"\n     \"\"\n     \"<outcommod>dummyout<\/outcommod>\"\n     \"<spectrum>thermal<\/spectrum>\"\n     \"<throughput>0<\/throughput>\"\n     ;\n\n  int simdur = 1;\n  cyclus::MockSim sim(cyclus::AgentSpec(\":cycamore:FuelFab\"), config, simdur);\n  sim.AddSource(\"stream1\").recipe(\"spentuox\").capacity(1).Finalize();\n  sim.AddSource(\"stream2\").recipe(\"spentuox\").capacity(1).Finalize();\n  sim.AddSource(\"stream3\").recipe(\"spentuox\").capacity(1).Finalize();\n  sim.AddRecipe(\"spentuox\", c_pustream());\n  sim.AddRecipe(\"natu\", c_natu());\n  int id = sim.Run();\n\n  QueryResult qr = sim.db().Query(\"Transactions\", NULL);\n  EXPECT_EQ(3, qr.rows.size());\n\n  std::vector<Cond> conds;\n  conds.push_back(Cond(\"Commodity\", \"==\", std::string(\"stream1\")));\n  qr = sim.db().Query(\"Transactions\", &conds);\n  EXPECT_EQ(1, qr.rows.size());\n\n  conds[0] = Cond(\"Commodity\", \"==\", std::string(\"stream2\"));\n  qr = sim.db().Query(\"Transactions\", &conds);\n  EXPECT_EQ(1, qr.rows.size());\n\n  conds[0] = Cond(\"Commodity\", \"==\", std::string(\"stream3\"));\n  qr = sim.db().Query(\"Transactions\", &conds);\n  EXPECT_EQ(1, qr.rows.size());\n}\n\n\/\/ fill, fiss, and topup inventories are all requested for and\n\/\/ filled as expected\nTEST(FuelFabTests, FillInventories) {\n  FAIL() << \"not implemented\";\n}\n\n\/\/ throughput is properly restricted when faced with many fuel\n\/\/ requests and with ample material inventory.\nTEST(FuelFabTests, ThroughputLimit) {\n  FAIL() << \"not implemented\";\n}\n\n\/\/ supplied fuel has proper equivalence weights as requested.\nTEST(FuelFabTests, CorrectMixing) {\n  FAIL() << \"not implemented\";\n}\n\n\/\/ fuel is requested requiring more filler than is available with plenty of\n\/\/ fissile.\nTEST(FuelFabTests, FillConstrained) {\n  FAIL() << \"not implemented\";\n}\n\n\/\/ fuel is requested requiring more fissile material than is available with\n\/\/ plenty of filler.\nTEST(FuelFabTests, FissConstrained) {\n  FAIL() << \"not implemented\";\n}\n\n\/\/ swap to topup inventory because fissile has too low reactivity.\nTEST(FuelFabTests, SwapTopup) {\n  FAIL() << \"not implemented\";\n}\n\n\/\/ swap to topup inventory but are limited by topup inventory quantity.\nTEST(FuelFabTests, SwapTopup_TopupConstrained) {\n  FAIL() << \"not implemented\";\n}\n\n\/\/ swap to topup inventory but are limited by fissile (used as filler)\n\/\/ inventory.\nTEST(FuelFabTests, SwapTopup_FissConstrained) {\n  FAIL() << \"not implemented\";\n}\n\n} \/\/ namespace cycamore\n\n<commit_msg>another test stub<commit_after>#include \"fuel_fab.h\"\n\n#include <gtest\/gtest.h>\n#include <sstream>\n#include \"cyclus.h\"\n\nusing pyne::nucname::id;\nusing cyclus::Composition;\nusing cyclus::CompMap;\nusing cyclus::Material;\nusing cyclus::QueryResult;\nusing cyclus::Cond;\nusing cyclus::toolkit::MatQuery;\n\nnamespace cycamore {\n\nComposition::Ptr c_uox() {\n  CompMap m;\n  m[id(\"u235\")] = 0.04;\n  m[id(\"u238\")] = 0.96;\n  return Composition::CreateFromMass(m);\n};\n\nComposition::Ptr c_mox() {\n  CompMap m;\n  m[id(\"u235\")] = .7;\n  m[id(\"u238\")] = 100;\n  m[id(\"pu239\")] = 3.3;\n  return Composition::CreateFromMass(m);\n};\n\nComposition::Ptr c_natu() {\n  CompMap m;\n  m[id(\"u235\")] =  .007;\n  m[id(\"u238\")] =  .993;\n  return Composition::CreateFromMass(m);\n};\n\nComposition::Ptr c_pustream() {\n  CompMap m;\n  m[id(\"pu239\")] = 100;\n  m[id(\"pu240\")] = 10;\n  m[id(\"pu241\")] = 1;\n  m[id(\"pu242\")] = 1;\n  return Composition::CreateFromMass(m);\n};\n\nComposition::Ptr c_pustreamlow() {\n  CompMap m;\n  m[id(\"pu239\")] = 80;\n  m[id(\"pu240\")] = 10;\n  m[id(\"pu241\")] = 1;\n  m[id(\"pu242\")] = 1;\n  return Composition::CreateFromMass(m);\n};\n\nComposition::Ptr c_pustreambad() {\n  CompMap m;\n  m[id(\"pu239\")] = 10;\n  m[id(\"pu240\")] = 10;\n  m[id(\"pu241\")] = 1;\n  m[id(\"pu242\")] = 1;\n  return Composition::CreateFromMass(m);\n};\n\nComposition::Ptr c_water() {\n  CompMap m;\n  m[id(\"O16\")] =  1;\n  m[id(\"H1\")] =  2;\n  return Composition::CreateFromAtom(m);\n};\n\nTEST(FuelFabTests, CosiWeight) {\n  cyclus::Env::SetNucDataPath();\n  CompMap m;\n  m[942390000] = 1;\n  Composition::Ptr c = Composition::CreateFromMass(m);\n  double w = CosiWeight(c, \"thermal\");\n  EXPECT_DOUBLE_EQ(1.0, w);\n\n  m.clear();\n  m[922380000] = 1;\n  c = Composition::CreateFromMass(m);\n  w = CosiWeight(c, \"thermal\");\n  EXPECT_DOUBLE_EQ(0.0, w);\n\n  m.clear();\n  m[942390000] = 1;\n  c = Composition::CreateFromMass(m);\n  w = CosiWeight(c, \"fission_spectrum_ave\");\n  EXPECT_DOUBLE_EQ(1.0, w);\n\n  m.clear();\n  m[922380000] = 1;\n  c = Composition::CreateFromMass(m);\n  w = CosiWeight(c, \"fission_spectrum_ave\");\n  EXPECT_DOUBLE_EQ(0.0, w);\n\n  m.clear();\n  m[922380000] = 1;\n  m[942390000] = 1;\n  c = Composition::CreateFromAtom(m);\n  w = CosiWeight(c, \"thermal\");\n  EXPECT_DOUBLE_EQ(0.5, w) << \"might be using mass-fractions instead of atom\";\n\n  m.clear();\n  m[922380000] = 1;\n  m[942390000] = 1;\n  c = Composition::CreateFromAtom(m);\n  w = CosiWeight(c, \"fission_spectrum_ave\");\n  EXPECT_DOUBLE_EQ(0.5, w) << \"might be using mass-fractions instead of atom\";\n\n  m.clear();\n  m[922380000] = 1;\n  m[942390000] = 1;\n  m[922350000] = 1;\n  c = Composition::CreateFromAtom(m);\n  double w_therm = CosiWeight(c, \"thermal\");\n  double w_fast = CosiWeight(c, \"fission_spectrum_ave\");\n  EXPECT_GT(w_therm, w_fast);\n}\n\nTEST(FuelFabTests, HighFrac) {\n  double w_fill = CosiWeight(c_natu(), \"thermal\");\n  double w_fiss = CosiWeight(c_pustream(), \"thermal\");\n  double w_target = CosiWeight(c_uox(), \"thermal\");\n\n  EXPECT_THROW(HighFrac(w_fiss, w_target, w_fill), cyclus::ValueError);\n  EXPECT_THROW(HighFrac(w_target, w_fill, w_fiss), cyclus::ValueError);\n  EXPECT_THROW(HighFrac(w_target, w_fiss, w_fill), cyclus::ValueError);\n\n  double f = HighFrac(w_fill, w_target, w_fiss);\n  EXPECT_DOUBLE_EQ((w_target-w_fill)\/(w_fiss-w_fill), f);\n}\n\nTEST(FuelFabTests, LowFrac) {\n  double w_fill = CosiWeight(c_natu(), \"thermal\");\n  double w_fiss = CosiWeight(c_pustream(), \"thermal\");\n  double w_target = CosiWeight(c_uox(), \"thermal\");\n\n  EXPECT_THROW(LowFrac(w_fiss, w_target, w_fill), cyclus::ValueError);\n  EXPECT_THROW(LowFrac(w_target, w_fill, w_fiss), cyclus::ValueError);\n  EXPECT_THROW(LowFrac(w_target, w_fiss, w_fill), cyclus::ValueError);\n\n  double f = LowFrac(w_fill, w_target, w_fiss);\n  EXPECT_DOUBLE_EQ((w_fiss-w_target)\/(w_fiss-w_fill), f);\n}\n\nTEST(FuelFabTests, ValidWeights) {\n  double w_fill = CosiWeight(c_natu(), \"thermal\");\n  double w_fiss = CosiWeight(c_pustream(), \"thermal\");\n  double w_target = CosiWeight(c_uox(), \"thermal\");\n\n  EXPECT_EQ(true, ValidWeights(w_fill, w_target, w_fiss));\n  EXPECT_EQ(false, ValidWeights(w_fiss, w_target, w_fill));\n  EXPECT_EQ(false, ValidWeights(w_target, w_fill, w_fiss));\n  EXPECT_EQ(false, ValidWeights(w_fiss, w_fill, w_target));\n  EXPECT_EQ(false, ValidWeights(w_target, w_fiss, w_fill));\n  EXPECT_EQ(false, ValidWeights(w_fill, w_fiss, w_target));\n}\n\nTEST(FuelFabTests, Template) {\n  std::string config = \n     \"<fill_commod>commod<\/fill_commod>\"\n     \"<fill_recipe>recipe<\/fill_recipe>\"\n     \"<fill_size>1<\/fill_size>\"\n     \"\"\n     \"<fiss_commods> <val>commod<\/val> <val>commod<\/val> <\/fiss_commods>\"\n     \"<fiss_size>1<\/fiss_size>\"\n     \"\"\n     \"<topup_commod>commod<\/topup_commod>\"\n     \"<topup_recipe>recipe<\/topup_recipe>\"\n     \"<topup_size>1<\/topup_size>\"\n     \"\"\n     \"<outcommod>commod<\/outcommod>\"\n     \"<spectrum>thermal<\/spectrum>\"\n     \"<throughput>1<\/throughput>\"\n     ;\n\n  int simdur = 50;\n  cyclus::MockSim sim(cyclus::AgentSpec(\":cycamore:FuelFab\"), config, simdur);\n  \/\/sim.AddSource(\"enriched_u\").Finalize();\n  \/\/sim.AddRecipe(\"lwr_fresh\", c_uox());\n  \/\/sim.AddRecipe(\"lwr_spent\", c_spentuox());\n  \/\/int id = sim.Run();\n\n  \/\/QueryResult qr = sim.db().Query(\"Transactions\", NULL);\n  \/\/EXPECT_EQ(simdur, qr.rows.size()) << \"failed to order+run on fresh fuel inside 1 time step\";\n}\n\n\/\/ request (and receive) a specific recipe for fissile stream correctly.\nTEST(FuelFabTests, FissRecipe) {\n  std::string config = \n     \"<fill_commod>dummy<\/fill_commod>\"\n     \"<fill_recipe>natu<\/fill_recipe>\"\n     \"<fill_size>1<\/fill_size>\"\n     \"\"\n     \"<fiss_commods> <val>stream1<\/val> <val>stream2<\/val> <val>stream3<\/val> <\/fiss_commods>\"\n     \"<fiss_size>2.5<\/fiss_size>\"\n     \"<fiss_recipe>spentuox<\/fiss_recipe>\"\n     \"\"\n     \"<outcommod>dummyout<\/outcommod>\"\n     \"<spectrum>thermal<\/spectrum>\"\n     \"<throughput>0<\/throughput>\"\n     ;\n\n  int simdur = 1;\n  cyclus::MockSim sim(cyclus::AgentSpec(\":cycamore:FuelFab\"), config, simdur);\n  sim.AddSource(\"stream1\").Finalize();\n  sim.AddRecipe(\"spentuox\", c_pustream());\n  sim.AddRecipe(\"natu\", c_natu());\n  int id = sim.Run();\n\n  int resid = sim.db().Query(\"Transactions\", NULL).GetVal<int>(\"ResourceId\");\n  CompMap got = sim.GetMaterial(resid)->comp()->mass();\n  CompMap want = c_pustream()->mass();\n  cyclus::compmath::Normalize(&got);\n  cyclus::compmath::Normalize(&want);\n  CompMap::iterator it;\n  for (it = want.begin(); it != want.end(); ++it) {\n    EXPECT_DOUBLE_EQ(it->second, got[it->first]) << \"nuclide qty off: \" << pyne::nucname::name(it->first);\n  }\n}\n\n\/\/ multiple fissile streams can be correctly requested and used as\n\/\/ fissile material inventory.\nTEST(FuelFabTests, MultipleFissStreams) {\n  std::string config = \n     \"<fill_commod>dummy<\/fill_commod>\"\n     \"<fill_recipe>natu<\/fill_recipe>\"\n     \"<fill_size>1<\/fill_size>\"\n     \"\"\n     \"<fiss_commods> <val>stream1<\/val> <val>stream2<\/val> <val>stream3<\/val> <\/fiss_commods>\"\n     \"<fiss_size>2.5<\/fiss_size>\"\n     \"\"\n     \"<outcommod>dummyout<\/outcommod>\"\n     \"<spectrum>thermal<\/spectrum>\"\n     \"<throughput>0<\/throughput>\"\n     ;\n\n  int simdur = 1;\n  cyclus::MockSim sim(cyclus::AgentSpec(\":cycamore:FuelFab\"), config, simdur);\n  sim.AddSource(\"stream1\").recipe(\"spentuox\").capacity(1).Finalize();\n  sim.AddSource(\"stream2\").recipe(\"spentuox\").capacity(1).Finalize();\n  sim.AddSource(\"stream3\").recipe(\"spentuox\").capacity(1).Finalize();\n  sim.AddRecipe(\"spentuox\", c_pustream());\n  sim.AddRecipe(\"natu\", c_natu());\n  int id = sim.Run();\n\n  QueryResult qr = sim.db().Query(\"Transactions\", NULL);\n  EXPECT_EQ(3, qr.rows.size());\n\n  std::vector<Cond> conds;\n  conds.push_back(Cond(\"Commodity\", \"==\", std::string(\"stream1\")));\n  qr = sim.db().Query(\"Transactions\", &conds);\n  EXPECT_EQ(1, qr.rows.size());\n\n  conds[0] = Cond(\"Commodity\", \"==\", std::string(\"stream2\"));\n  qr = sim.db().Query(\"Transactions\", &conds);\n  EXPECT_EQ(1, qr.rows.size());\n\n  conds[0] = Cond(\"Commodity\", \"==\", std::string(\"stream3\"));\n  qr = sim.db().Query(\"Transactions\", &conds);\n  EXPECT_EQ(1, qr.rows.size());\n}\n\n\/\/ fissile stream preferences can be specified.\nTEST(FuelFabTests, FissStreamPrefs) {\n  FAIL() << \"not implemented\";\n}\n\n\/\/ fill, fiss, and topup inventories are all requested for and\n\/\/ filled as expected\nTEST(FuelFabTests, FillInventories) {\n  FAIL() << \"not implemented\";\n}\n\n\/\/ throughput is properly restricted when faced with many fuel\n\/\/ requests and with ample material inventory.\nTEST(FuelFabTests, ThroughputLimit) {\n  FAIL() << \"not implemented\";\n}\n\n\/\/ supplied fuel has proper equivalence weights as requested.\nTEST(FuelFabTests, CorrectMixing) {\n  FAIL() << \"not implemented\";\n}\n\n\/\/ fuel is requested requiring more filler than is available with plenty of\n\/\/ fissile.\nTEST(FuelFabTests, FillConstrained) {\n  FAIL() << \"not implemented\";\n}\n\n\/\/ fuel is requested requiring more fissile material than is available with\n\/\/ plenty of filler.\nTEST(FuelFabTests, FissConstrained) {\n  FAIL() << \"not implemented\";\n}\n\n\/\/ swap to topup inventory because fissile has too low reactivity.\nTEST(FuelFabTests, SwapTopup) {\n  FAIL() << \"not implemented\";\n}\n\n\/\/ swap to topup inventory but are limited by topup inventory quantity.\nTEST(FuelFabTests, SwapTopup_TopupConstrained) {\n  FAIL() << \"not implemented\";\n}\n\n\/\/ swap to topup inventory but are limited by fissile (used as filler)\n\/\/ inventory.\nTEST(FuelFabTests, SwapTopup_FissConstrained) {\n  FAIL() << \"not implemented\";\n}\n\n} \/\/ namespace cycamore\n\n<|endoftext|>"}
{"text":"<commit_before>{\n\/\/  Prints a summary of all ROOT benchmarks (must be run before)\n\/\/  The ROOTMARK number printed is by reference to an HP735\/99\n\/\/  taken by definition as 27 ROOTMARKS in interactive mode\n\/\/  and 46 ROOTMARKS in batch mode.\n\n   Int_t nbench  = 0;\n   Float_t rtall = 0;\n   Float_t cpall = 0;\n   Float_t hp735 = 27;\n   Float_t norm  = hp735;\n   Float_t rtmark,cpmark;\n\n   printf(\"---------------ROOT %s benchmarks summary--------------------\\n\",gROOT->GetVersion());\n   gBenchmark->Summary();\n   printf(\"\\n---------------ROOT %s benchmarks summary (in ROOTMARKS)-----\\n\",gROOT->GetVersion());\n   printf(\"   For comparison, an HP735\/99 is benchmarked at 27 ROOTMARKS\\n\");\n   Float_t hsimple_rt = gBenchmark->GetRealTime(\"hsimple\");\n   Float_t hsimple_ct = gBenchmark->GetCpuTime(\"hsimple\");\n   if (hsimple_rt > 0) {\n      rtmark = norm*(10.62\/hsimple_rt);\n      cpmark = norm*(8.19\/hsimple_ct);\n      nbench++;\n      rtall += rtmark;\n      cpall += cpmark;\n      printf(\"hsimple     = %7.2f RealMARKS,  = %7.2f CpuMARKS\\n\",rtmark,cpmark);\n   }\n\n   Float_t hsum_rt = gBenchmark->GetRealTime(\"hsum\");\n   Float_t hsum_ct = gBenchmark->GetCpuTime(\"hsum\");\n   if (hsum_rt > 0) {\n      rtmark = norm*(6.09\/hsum_rt);\n      cpmark = norm*(4.21\/hsum_ct);\n      nbench++;\n      rtall += rtmark;\n      cpall += cpmark;\n      printf(\"hsum        = %7.2f RealMARKS,  = %7.2f CpuMARKS\\n\",rtmark,cpmark);\n   }\n\n   Float_t fillrandom_rt = gBenchmark->GetRealTime(\"fillrandom\");\n   Float_t fillrandom_ct = gBenchmark->GetCpuTime(\"fillrandom\");\n   if (fillrandom_rt > 0) {\n      rtmark = norm*(0.92\/fillrandom_rt);\n      cpmark = norm*(0.29\/fillrandom_ct);\n      nbench++;\n      rtall += rtmark;\n      cpall += cpmark;\n      printf(\"fillrandom  = %7.2f RealMARKS,  = %7.2f CpuMARKS\\n\",rtmark,cpmark);\n   }\n\n   Float_t fit1_rt = gBenchmark->GetRealTime(\"fit1\");\n   Float_t fit1_ct = gBenchmark->GetCpuTime(\"fit1\");\n   if (fit1_rt > 0) {\n      rtmark = norm*(1.42\/fit1_rt);\n      cpmark = norm*(0.76\/fit1_ct);\n      nbench++;\n      rtall += rtmark;\n      cpall += cpmark;\n      printf(\"fit1        = %7.2f RealMARKS,  = %7.2f CpuMARKS\\n\",rtmark,cpmark);\n   }\n\n   Float_t tornado_rt = gBenchmark->GetRealTime(\"tornado\");\n   Float_t tornado_ct = gBenchmark->GetCpuTime(\"tornado\");\n   if (tornado_rt > 0) {\n      rtmark = norm*(1.04\/tornado_rt);\n      cpmark = norm*(0.88\/tornado_ct);\n      nbench++;\n      rtall += rtmark;\n      cpall += cpmark;\n      printf(\"tornado     = %7.2f RealMARKS,  = %7.2f CpuMARKS\\n\",rtmark,cpmark);\n   }\n\n   Float_t na49_rt = gBenchmark->GetRealTime(\"na49\");\n   Float_t na49_ct = gBenchmark->GetCpuTime(\"na49\");\n   if (na49_rt > 0) {\n      rtmark = norm*(31.08\/na49_rt);\n      cpmark = norm*(30.64\/na49_ct);\n      nbench++;\n      rtall += rtmark;\n      cpall += cpmark;\n      printf(\"na49        = %7.2f RealMARKS,  = %7.2f CpuMARKS\\n\",rtmark,cpmark);\n   }\n\n   Float_t na49view_rt = gBenchmark->GetRealTime(\"na49view\");\n   Float_t na49view_ct = gBenchmark->GetCpuTime(\"na49view\");\n   if (na49view_rt > 0) {\n      rtmark = norm*(2.82\/na49view_rt);\n      cpmark = norm*(1.48\/na49view_ct);\n      nbench++;\n      rtall += rtmark;\n      cpall += cpmark;\n      printf(\"na49view    = %7.2f RealMARKS,  = %7.2f CpuMARKS\\n\",rtmark,cpmark);\n   }\n\n   Float_t ntuple1_rt = gBenchmark->GetRealTime(\"ntuple1\");\n   Float_t ntuple1_ct = gBenchmark->GetCpuTime(\"ntuple1\");\n   if (ntuple1_rt > 0) {\n      rtmark = norm*(8.27\/ntuple1_rt);\n      cpmark = norm*(7.24\/ntuple1_ct);\n      nbench++;\n      rtall += rtmark;\n      cpall += cpmark;\n      printf(\"ntuple1     = %7.2f RealMARKS,  = %7.2f CpuMARKS\\n\",rtmark,cpmark);\n   }\n\n   Float_t tree_rt = gBenchmark->GetRealTime(\"tree\");\n   Float_t tree_ct = gBenchmark->GetCpuTime(\"tree\");\n   if (tree_rt > 0) {\n      rtmark = norm*(1.35\/tree_rt);\n      cpmark = norm*(0.90\/tree_ct);\n      nbench++;\n      rtall += rtmark;\n      cpall += cpmark;\n      printf(\"tree        = %7.2f RealMARKS,  = %7.2f CpuMARKS\\n\",rtmark,cpmark);\n   }\n\n   Float_t geometry_rt = gBenchmark->GetRealTime(\"geometry\");\n   Float_t geometry_ct = gBenchmark->GetCpuTime(\"geometry\");\n   if (geometry_rt > 0) {\n      rtmark = norm*(7.15\/geometry_rt);\n      cpmark = norm*(6.14\/geometry_ct);\n      nbench++;\n      rtall += rtmark;\n      cpall += cpmark;\n      printf(\"geometry    = %7.2f RealMARKS,  = %7.2f CpuMARKS\\n\",rtmark,cpmark);\n   }\n\n   if (nbench) {\n      Float_t rtmean  = rtall\/nbench;\n      Float_t cpmean  = cpall\/nbench;\n      Float_t rtmarks = (rtall+cpall)\/(2*nbench);\n      if (gROOT->IsBatch()) rtmarks *= 27.\/46.;\n      printf(\"MEAN        = %7.2f RealMARKS,  = %7.2f CpuMARKS\\n\",rtmean,cpmean);\n      printf(\"\\n\");\n      printf(\"****************************************************\\n\");\n      printf(\"* Your machine is estimated at %7.2f ROOTMARKS   *\\n\",rtmarks);\n      printf(\"****************************************************\\n\");\n   } else {\n      printf(\" You must run the ROOT benchmarks before executing this command\\n\");\n   }\n}\n<commit_msg>- Mods in tutorial rootmarks.C. The new rootmarks are normalized to the results   obtained on a DELL Inspiron Pentium III 600 Mhz and set to 200 rootmarks   on this machine.<commit_after>{\n\/\/  Prints a summary of all ROOT benchmarks (must be run before)\n\/\/  The ROOTMARK number printed is by reference to a Pentium III 600 Mhz\n\/\/  (DELL Inspiron 7500 with 256 MBytes memory and 18 GBytes IDE disk)\n\/\/  taken by definition as 200 ROOTMARKS in batch mode in executing\n\/\/     root -b -q benchmarks.C\n\/\/\n\n   Float_t rtall   = 0;\n   Float_t cpall   = 0;\n   Float_t norm    = 200;  \/\/obtained rootmarks on Dell Inspiron 600 Mhz\n   Float_t rtmark,cpmark;\n   Bool_t batch = gROOT->IsBatch();\n\n   printf(\"---------------ROOT %s benchmarks summary--------------------\\n\",gROOT->GetVersion());\n   gBenchmark->Summary(rtall,cpall);\n   printf(\"\\n---------------ROOT %s benchmarks summary (in ROOTMARKS)-----\\n\",gROOT->GetVersion());\n   printf(\"   For comparison, an Pentium III 600Mhz is benchmarked at 200 ROOTMARKS\\n\");\n   Float_t hsimple_rt = gBenchmark->GetRealTime(\"hsimple\");\n   Float_t hsimple_ct = gBenchmark->GetCpuTime(\"hsimple\");\n   if (hsimple_rt > 0) {\n      if (batch) {\n         rtmark = norm*(0.78\/hsimple_rt);\n         cpmark = norm*(0.78\/hsimple_ct);\n      } else {\n         rtmark = norm*(2.31\/hsimple_rt);\n         cpmark = norm*(1.27\/hsimple_ct);\n      }\n      printf(\"hsimple     = %7.2f RealMARKS,  = %7.2f CpuMARKS\\n\",rtmark,cpmark);\n   }\n\n   Float_t hsum_rt = gBenchmark->GetRealTime(\"hsum\");\n   Float_t hsum_ct = gBenchmark->GetCpuTime(\"hsum\");\n   if (hsum_rt > 0) {\n      if (batch) {\n         rtmark = norm*(0.42\/hsum_rt);\n         cpmark = norm*(0.42\/hsum_ct);\n      } else {\n         rtmark = norm*(1.42\/hsum_rt);\n         cpmark = norm*(0.81\/hsum_ct);\n      }\n      printf(\"hsum        = %7.2f RealMARKS,  = %7.2f CpuMARKS\\n\",rtmark,cpmark);\n   }\n\n   Float_t fillrandom_rt = gBenchmark->GetRealTime(\"fillrandom\");\n   Float_t fillrandom_ct = gBenchmark->GetCpuTime(\"fillrandom\");\n   if (fillrandom_rt > 0) {\n      if (batch) {\n         rtmark = norm*(0.03\/fillrandom_rt);\n         cpmark = norm*(0.03\/fillrandom_ct);\n      } else {\n         rtmark = norm*(0.20\/fillrandom_rt);\n         cpmark = norm*(0.06\/fillrandom_ct);\n      }\n      printf(\"fillrandom  = %7.2f RealMARKS,  = %7.2f CpuMARKS\\n\",rtmark,cpmark);\n   }\n\n   Float_t fit1_rt = gBenchmark->GetRealTime(\"fit1\");\n   Float_t fit1_ct = gBenchmark->GetCpuTime(\"fit1\");\n   if (fit1_rt > 0) {\n      if (batch) {\n         rtmark = norm*(0.10\/fit1_rt);\n         cpmark = norm*(0.08\/fit1_ct);\n      } else {\n         rtmark = norm*(0.22\/fit1_rt);\n         cpmark = norm*(0.13\/fit1_ct);\n      }\n      printf(\"fit1        = %7.2f RealMARKS,  = %7.2f CpuMARKS\\n\",rtmark,cpmark);\n   }\n\n   Float_t tornado_rt = gBenchmark->GetRealTime(\"tornado\");\n   Float_t tornado_ct = gBenchmark->GetCpuTime(\"tornado\");\n   if (tornado_rt > 0) {\n      if (batch) {\n         rtmark = norm*(0.12\/tornado_rt);\n         cpmark = norm*(0.11\/tornado_ct);\n      } else {\n         rtmark = norm*(0.19\/tornado_rt);\n         cpmark = norm*(0.11\/tornado_ct);\n      }\n      printf(\"tornado     = %7.2f RealMARKS,  = %7.2f CpuMARKS\\n\",rtmark,cpmark);\n   }\n\n   Float_t na49_rt = gBenchmark->GetRealTime(\"na49\");\n   Float_t na49_ct = gBenchmark->GetCpuTime(\"na49\");\n   if (na49_rt > 0) {\n      rtmark = norm*(6.59\/na49_rt);\n      cpmark = norm*(6.59\/na49_ct);\n      printf(\"na49        = %7.2f RealMARKS,  = %7.2f CpuMARKS\\n\",rtmark,cpmark);\n   }\n\n   Float_t geometry_rt = gBenchmark->GetRealTime(\"geometry\");\n   Float_t geometry_ct = gBenchmark->GetCpuTime(\"geometry\");\n   if (geometry_rt > 0) {\n      rtmark = norm*(0.39\/geometry_rt);\n      cpmark = norm*(0.39\/geometry_ct);\n      printf(\"geometry    = %7.2f RealMARKS,  = %7.2f CpuMARKS\\n\",rtmark,cpmark);\n   }\n\n   Float_t na49view_rt = gBenchmark->GetRealTime(\"na49view\");\n   Float_t na49view_ct = gBenchmark->GetCpuTime(\"na49view\");\n   if (na49view_rt > 0) {\n      if (batch) {\n         rtmark = norm*(0.11\/na49view_rt);\n         cpmark = norm*(0.11\/na49view_ct);\n      } else {\n         rtmark = norm*(0.73\/na49view_rt);\n         cpmark = norm*(0.24\/na49view_ct);\n      }\n      printf(\"na49view    = %7.2f RealMARKS,  = %7.2f CpuMARKS\\n\",rtmark,cpmark);\n   }\n\n   Float_t ntuple1_rt = gBenchmark->GetRealTime(\"ntuple1\");\n   Float_t ntuple1_ct = gBenchmark->GetCpuTime(\"ntuple1\");\n   if (ntuple1_rt > 0) {\n      if (batch) {\n         rtmark = norm*(0.78\/ntuple1_rt);\n         cpmark = norm*(0.78\/ntuple1_ct);\n      } else {\n         rtmark = norm*(1.25\/ntuple1_rt);\n         cpmark = norm*(0.89\/ntuple1_ct);\n      }\n      printf(\"ntuple1     = %7.2f RealMARKS,  = %7.2f CpuMARKS\\n\",rtmark,cpmark);\n   }\n\n   if (rtall) {\n      Float_t rtdell, cpdell;\n      if (batch) {\n         rtdell    = 9.00;\n         cpdell    = 8.83;\n      } else {\n         rtdell    = 13.04;\n         cpdell    = 10.33;\n      }\n      Float_t rootmarks = norm*(rtdell+cpdell)\/(rtall+cpall);\n      printf(\"\\n\");\n      printf(\"****************************************************\\n\");\n      printf(\"* Your machine is estimated at %7.2f ROOTMARKS   *\\n\",rootmarks);\n      printf(\"****************************************************\\n\");\n   } else {\n      printf(\" You must run the ROOT benchmarks before executing this command\\n\");\n   }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"TCanvas.h\"\n#include \"TStyle.h\"\n#include \"TH1.h\"\n#include \"TGaxis.h\"\n#include \"TRandom.h\"\n   \nvoid twoscales()\n{\n   \/\/example of macro illustrating how to superimpose two histograms\n   \/\/with different scales in the \"same\" pad.\n   \/\/ To see the output of this macro, click begin_html <a href=\"gif\/twoscales.gif\" >here<\/a> end_html\n      \n   TCanvas *c1 = new TCanvas(\"c1\",\"hists with different scales\",600,400);\n\n   \/\/create\/fill draw h1\n   gStyle->SetOptStat(kFALSE);\n   TH1F *h1 = new TH1F(\"h1\",\"my histogram\",100,-3,3);\n   Int_t i;\n   for (i=0;i<10000;i++) h1->Fill(gRandom->Gaus(0,1));\n   h1->Draw();\n   c1->Update();  \n    \n   \/\/create hint1 filled with the bins integral of h1\n   TH1F *hint1 = new TH1F(\"hint1\",\"h1 bins integral\",100,-3,3);\n   Float_t sum = 0;\n   for (i=1;i<=100;i++) {\n      sum += h1->GetBinContent(i); \n      hint1->SetBinContent(i,sum);\n   }\n\n   \/\/scale hint1 to the pad coordinates\n   Float_t rightmax = 1.1*hint1->GetMaximum();\n   Float_t scale = gPad->GetUymax()\/rightmax;\n   hint1->SetLineColor(kRed);\n   hint1->Scale(scale);\n   hint1->Draw(\"same\");\n   \n   \/\/draw an axis on the right side\n   TGaxis *axis = new TGaxis(gPad->GetUxmax(),gPad->GetUymin(),\n         gPad->GetUxmax(), gPad->GetUymax(),0,rightmax,510,\"+L\");\n   axis->SetLineColor(kRed);\n   axis->SetTextColor(kRed);\n   axis->Draw();\n}\n<commit_msg>Replace call to SetTextColor by SetLabelColor<commit_after>#include \"TCanvas.h\"\n#include \"TStyle.h\"\n#include \"TH1.h\"\n#include \"TGaxis.h\"\n#include \"TRandom.h\"\n   \nvoid twoscales()\n{\n   \/\/example of macro illustrating how to superimpose two histograms\n   \/\/with different scales in the \"same\" pad.\n   \/\/ To see the output of this macro, click begin_html <a href=\"gif\/twoscales.gif\" >here<\/a> end_html\n      \n   TCanvas *c1 = new TCanvas(\"c1\",\"hists with different scales\",600,400);\n\n   \/\/create\/fill draw h1\n   gStyle->SetOptStat(kFALSE);\n   TH1F *h1 = new TH1F(\"h1\",\"my histogram\",100,-3,3);\n   Int_t i;\n   for (i=0;i<10000;i++) h1->Fill(gRandom->Gaus(0,1));\n   h1->Draw();\n   c1->Update();  \n    \n   \/\/create hint1 filled with the bins integral of h1\n   TH1F *hint1 = new TH1F(\"hint1\",\"h1 bins integral\",100,-3,3);\n   Float_t sum = 0;\n   for (i=1;i<=100;i++) {\n      sum += h1->GetBinContent(i); \n      hint1->SetBinContent(i,sum);\n   }\n\n   \/\/scale hint1 to the pad coordinates\n   Float_t rightmax = 1.1*hint1->GetMaximum();\n   Float_t scale = gPad->GetUymax()\/rightmax;\n   hint1->SetLineColor(kRed);\n   hint1->Scale(scale);\n   hint1->Draw(\"same\");\n   \n   \/\/draw an axis on the right side\n   TGaxis *axis = new TGaxis(gPad->GetUxmax(),gPad->GetUymin(),\n         gPad->GetUxmax(), gPad->GetUymax(),0,rightmax,510,\"+L\");\n   axis->SetLineColor(kRed);\n   axis->SetLabelColor(kRed);\n   axis->Draw();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"mitkStateMachine.h\"\n#include \"mitkStateMachineFactory.h\"\n#include \"mitkStateTransitionOperation.h\"\n#include \"mitkOperationEvent.h\"\n#include \"mitkUndoController.h\"\n#include \"mitkStatusBar.h\"\n#include \"mitkInteractionConst.h\"\n#include <itkMacro.h>\n\n#define INTERDEBUG\n\n\/\/##ModelId=3E5B2DB301FD\n\/\/##Documentation\n\/\/## Constructor\n\/\/## daclares a new StateMachine and connects\n\/\/## it to a StateMachine of Type type;\nmitk::StateMachine::StateMachine(const char * type) : m_CurrentState(NULL)\n{\n  if(type!=NULL)\n  {\n    m_Type = type;\n\t  m_CurrentState = mitk::StateMachineFactory::GetStartState(type);\n  }\n  else\n    mitk::StatusBar::DisplayText(\"Error! Sender: StateMachine; Message: Type of StateMachine is NULL!\", 10000);\n  \n  m_UndoController = new UndoController(LIMITEDLINEARUNDO);\/\/switch to LLU or add LLU\n\tm_UndoEnabled = true;\n}\n\n\/\/##ModelId=3E5B2E660087\nstd::string mitk::StateMachine::GetType() const\n{\n\treturn m_Type;\n}\n\nconst mitk::State* mitk::StateMachine::GetCurrentState() const\n{\n  if (m_CurrentState)\n    return m_CurrentState;\n  return NULL;\n}\n\n\/\/##ModelId=3E5B2DE30378\nbool mitk::StateMachine::HandleEvent(StateEvent const* stateEvent, int objectEventId, int groupEventId)\n{\n  if (m_CurrentState == NULL)\n  return false;\/\/m_CurrentState needs to be set first!\n\n  \/\/get Transition from m_Current State with equals ID\n  const Transition *tempTransition = m_CurrentState->GetTransition(stateEvent->GetId());\n  if (tempTransition == NULL) return false;\n  \/\/get next State\n  State *tempNextState = tempTransition->GetNextState();\n  if (tempNextState == NULL) return false;\n  \/\/and ActionId to execute later on\n  if ( m_CurrentState->GetId() != tempNextState->GetId() )\/\/statechange only if there is a real statechange\n  {\n    if ( m_UndoEnabled )\t\/\/write to UndoMechanism if Undo is enabled\n    {\n      \/\/UNDO for this statechange\n\t  StateTransitionOperation* doOp = new StateTransitionOperation(OpSTATECHANGE, tempNextState);\n      StateTransitionOperation* undoOp = new StateTransitionOperation(OpSTATECHANGE, m_CurrentState);\n\t  OperationEvent *operationEvent = new OperationEvent(((mitk::OperationActor*)(this)),\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tdoOp, undoOp,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tobjectEventId ,groupEventId);\n\t  m_UndoController->SetOperationEvent(operationEvent);\n    }\n#ifdef INTERDEBUG\n\/\/Debug StateChanges through cout output! Thus very slow!\nstd::cout<<this->GetType()<<\": Changing from StateId \"<<m_CurrentState->GetId()<<\" to StateId \"<<tempNextState->GetId()<<std::endl;\nstd::cout<<this->GetType()<<\": Changing from State \"<<m_CurrentState->GetName()<<\" to State \"<<tempNextState->GetName()<<std::endl;\n#endif\n    \/\/first following StateChange(or calling ExecuteOperation(tempNextStateOp)), then operation(action)\n    m_CurrentState = tempNextState;\n  }\n\n  std::vector<int>::iterator actionIdIterator = tempTransition->GetActionIdBeginIterator();\n  const std::vector<int>::iterator actionIdIteratorEnd = tempTransition->GetActionIdEndIterator();\n  bool ok = true;\n\n  while ( actionIdIterator != actionIdIteratorEnd ) \n  {\n    if ( !ExecuteAction(*actionIdIterator, stateEvent, objectEventId, groupEventId) )\n    {\n      ok = false;\n\n      #ifdef INTERDEBUG\n      itkWarningMacro( << \"Warning: no action defind for \" << *actionIdIterator << \" in \" << m_Type );\n      #endif            \n    }\n\n    actionIdIterator++;\n  }\n  return ok;\n}\n\n\/\/##ModelId=3EDCAECB0175\nvoid mitk::StateMachine::EnableUndo(bool enable)\n{\n\tm_UndoEnabled = enable;\n}\n\n\/\/##ModelId=3EF099EA03C0\nint mitk::StateMachine::IncCurrGroupEventId()\n{\n\treturn mitk::OperationEvent::IncCurrGroupEventId();\n}\n\nvoid mitk::StateMachine::ExecuteOperation(Operation* operation)\n{\n\tswitch (operation->GetOperationType())\n\t{\n\tcase OpNOTHING:\n\t\tbreak;\n\tcase OpSTATECHANGE:\n\t\t{\n\t\t\tmitk::StateTransitionOperation* stateTransOp = dynamic_cast<mitk::StateTransitionOperation *>(operation);\n\t\t\tif (stateTransOp == NULL)\n\t\t\t{\n\t\t\t\tmitk::StatusBar::DisplayText(\"Error! see mitkStateMachine.cpp\", 10000);\n\t\t\t\treturn;\n\t\t\t}\n#ifdef INTERDEBUG\n\/\/Debug StateChanges through cout output! Thus very slow!\nstd::cout<<this->GetType()<<\": Undo: Changing from StateId \"<<m_CurrentState->GetId()<<\" to StateId \"<<stateTransOp->GetState()->GetId<<std::endl;\nstd::cout<<this->GetType()<<\": Undo: Changing from State \"<<m_CurrentState->GetName()<<\" to State \"<<stateTransOp->GetState()->GetName()<<std::endl;\n#endif\n\t\t\tm_CurrentState = stateTransOp->GetState();\n\t\t}\n\t\tbreak;\n  case OpDELETE:\n    {\n      \/\/delete this!\n      \/\/before all lower statemachines has to be deleted in a action\n      \/\/this->Delete();\/\/might not work!!!check itk!\n    }\n  case OpUNDELETE:\n    {\n      \/\/this is just new! and now the m_CurrentState has to be set on a special State\n      \/\/that way a delete of a StateMachine can be undone \n      \/\/IMPORTANT: The type has to be the same!!!Done by a higher instance, that creates this!\n      mitk::StateTransitionOperation* stateTransOp = dynamic_cast<mitk::StateTransitionOperation *>(operation);\n\t\t\tif (stateTransOp != NULL)\n      {\n        m_CurrentState = stateTransOp->GetState();\n      }\n    }\n\tdefault:\n\t\t;\n\t}\n}\n<commit_msg>fixed ostream error... missing () after GetId<commit_after>#include \"mitkStateMachine.h\"\n#include \"mitkStateMachineFactory.h\"\n#include \"mitkStateTransitionOperation.h\"\n#include \"mitkOperationEvent.h\"\n#include \"mitkUndoController.h\"\n#include \"mitkStatusBar.h\"\n#include \"mitkInteractionConst.h\"\n#include <itkMacro.h>\n\n#define INTERDEBUG\n\n\/\/##ModelId=3E5B2DB301FD\n\/\/##Documentation\n\/\/## Constructor\n\/\/## daclares a new StateMachine and connects\n\/\/## it to a StateMachine of Type type;\nmitk::StateMachine::StateMachine(const char * type) : m_CurrentState(NULL)\n{\n  if(type!=NULL)\n  {\n    m_Type = type;\n\t  m_CurrentState = mitk::StateMachineFactory::GetStartState(type);\n  }\n  else\n    mitk::StatusBar::DisplayText(\"Error! Sender: StateMachine; Message: Type of StateMachine is NULL!\", 10000);\n  \n  m_UndoController = new UndoController(LIMITEDLINEARUNDO);\/\/switch to LLU or add LLU\n\tm_UndoEnabled = true;\n}\n\n\/\/##ModelId=3E5B2E660087\nstd::string mitk::StateMachine::GetType() const\n{\n\treturn m_Type;\n}\n\nconst mitk::State* mitk::StateMachine::GetCurrentState() const\n{\n  if (m_CurrentState)\n    return m_CurrentState;\n  return NULL;\n}\n\n\/\/##ModelId=3E5B2DE30378\nbool mitk::StateMachine::HandleEvent(StateEvent const* stateEvent, int objectEventId, int groupEventId)\n{\n  if (m_CurrentState == NULL)\n  return false;\/\/m_CurrentState needs to be set first!\n\n  \/\/get Transition from m_Current State with equals ID\n  const Transition *tempTransition = m_CurrentState->GetTransition(stateEvent->GetId());\n  if (tempTransition == NULL) return false;\n  \/\/get next State\n  State *tempNextState = tempTransition->GetNextState();\n  if (tempNextState == NULL) return false;\n  \/\/and ActionId to execute later on\n  if ( m_CurrentState->GetId() != tempNextState->GetId() )\/\/statechange only if there is a real statechange\n  {\n    if ( m_UndoEnabled )\t\/\/write to UndoMechanism if Undo is enabled\n    {\n      \/\/UNDO for this statechange\n\t  StateTransitionOperation* doOp = new StateTransitionOperation(OpSTATECHANGE, tempNextState);\n      StateTransitionOperation* undoOp = new StateTransitionOperation(OpSTATECHANGE, m_CurrentState);\n\t  OperationEvent *operationEvent = new OperationEvent(((mitk::OperationActor*)(this)),\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tdoOp, undoOp,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tobjectEventId ,groupEventId);\n\t  m_UndoController->SetOperationEvent(operationEvent);\n    }\n#ifdef INTERDEBUG\n\/\/Debug StateChanges through cout output! Thus very slow!\nstd::cout<<this->GetType()<<\": Changing from StateId \"<<m_CurrentState->GetId()<<\" to StateId \"<<tempNextState->GetId()<<std::endl;\nstd::cout<<this->GetType()<<\": Changing from State \"<<m_CurrentState->GetName()<<\" to State \"<<tempNextState->GetName()<<std::endl;\n#endif\n    \/\/first following StateChange(or calling ExecuteOperation(tempNextStateOp)), then operation(action)\n    m_CurrentState = tempNextState;\n  }\n\n  std::vector<int>::iterator actionIdIterator = tempTransition->GetActionIdBeginIterator();\n  const std::vector<int>::iterator actionIdIteratorEnd = tempTransition->GetActionIdEndIterator();\n  bool ok = true;\n\n  while ( actionIdIterator != actionIdIteratorEnd ) \n  {\n    if ( !ExecuteAction(*actionIdIterator, stateEvent, objectEventId, groupEventId) )\n    {\n      ok = false;\n\n      #ifdef INTERDEBUG\n      itkWarningMacro( << \"Warning: no action defind for \" << *actionIdIterator << \" in \" << m_Type );\n      #endif            \n    }\n\n    actionIdIterator++;\n  }\n  return ok;\n}\n\n\/\/##ModelId=3EDCAECB0175\nvoid mitk::StateMachine::EnableUndo(bool enable)\n{\n\tm_UndoEnabled = enable;\n}\n\n\/\/##ModelId=3EF099EA03C0\nint mitk::StateMachine::IncCurrGroupEventId()\n{\n\treturn mitk::OperationEvent::IncCurrGroupEventId();\n}\n\nvoid mitk::StateMachine::ExecuteOperation(Operation* operation)\n{\n\tswitch (operation->GetOperationType())\n\t{\n\tcase OpNOTHING:\n\t\tbreak;\n\tcase OpSTATECHANGE:\n\t\t{\n\t\t\tmitk::StateTransitionOperation* stateTransOp = dynamic_cast<mitk::StateTransitionOperation *>(operation);\n\t\t\tif (stateTransOp == NULL)\n\t\t\t{\n\t\t\t\tmitk::StatusBar::DisplayText(\"Error! see mitkStateMachine.cpp\", 10000);\n\t\t\t\treturn;\n\t\t\t}\n#ifdef INTERDEBUG\n\/\/Debug StateChanges through cout output! Thus very slow!\nstd::cout<<this->GetType()<<\": Undo: Changing from StateId \"<<m_CurrentState->GetId()<<\" to StateId \"<<stateTransOp->GetState()->GetId()<<std::endl;\nstd::cout<<this->GetType()<<\": Undo: Changing from State \"<<m_CurrentState->GetName()<<\" to State \"<<stateTransOp->GetState()->GetName()<<std::endl;\n#endif\n\t\t\tm_CurrentState = stateTransOp->GetState();\n\t\t}\n\t\tbreak;\n  case OpDELETE:\n    {\n      \/\/delete this!\n      \/\/before all lower statemachines has to be deleted in a action\n      \/\/this->Delete();\/\/might not work!!!check itk!\n    }\n  case OpUNDELETE:\n    {\n      \/\/this is just new! and now the m_CurrentState has to be set on a special State\n      \/\/that way a delete of a StateMachine can be undone \n      \/\/IMPORTANT: The type has to be the same!!!Done by a higher instance, that creates this!\n      mitk::StateTransitionOperation* stateTransOp = dynamic_cast<mitk::StateTransitionOperation *>(operation);\n\t\t\tif (stateTransOp != NULL)\n      {\n        m_CurrentState = stateTransOp->GetState();\n      }\n    }\n\tdefault:\n\t\t;\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ cfiles, an analysis frontend for the Chemfiles library\n\/\/ Copyright (C) Guillaume Fraux and contributors -- BSD license\n\n#include <docopt\/docopt.h>\n#include <sstream>\n#include <fstream>\n\n#include \"DensityProfile.hpp\"\n#include \"Errors.hpp\"\n#include \"utils.hpp\"\n#include \"warnings.hpp\"\n\nusing namespace chemfiles;\n\nstatic const char OPTIONS[] =\nR\"(Compute the density profile of particles along a given axis or radially.\nThe output for the radial density profile is normalized by r.\nSelections for the particles can be specified using the chemfiles selection\nlanguage. It is possible to provide an alternative unit cell or topology for the\ntrajectory file if they are not defined in the trajectory format. The axis can\nbe specified using a coordinate vector (e.g. z axis would be (0,0,1)).\n\nIt is also possible to compute 2D profiles by specifying 2 axis (see --axis and\n--radial options). Other options (--points, --max, --min) may accept two values,\none for each axis. If only one is specified, the same value will be used for\nboth axis (see Examples). The output is a 2D histogram with the first dimension\nbeing the first axis and the second dimension the second axis. If two axis of\nthe same type are used (e.g. twice --axis option), the order will be the one the\nuser gave. If the axis types are different (e.g. --axis and --radial), the\n--axis will be first. Two axis of type radial are forbidden.\n\nFor more information about chemfiles selection language, please see\nhttp:\/\/chemfiles.org\/chemfiles\/latest\/selections.html\n\nUsage:\n  cfiles density [options] <trajectory> [--axis=<axis>...] [--radial=<axis>...]\n  cfiles density (-h | --help)\n\nExamples:\n  cfiles density water.xyz --cell 15:15:25 --guess-bonds --axis=1:1:1\n  cfiles density in.pdb --selection=\"x > 3\" --points=500\n  cfiles density nt.pdb --radial=Z --max=3 --origin=0:0:2\n  cfiles density nt.pdb --profile=Z --radial=Z --max=10:5 --origin=0:0:2\n\nOptions:\n  -h --help                     show this help\n  -o <file>, --output=<file>    write result to <file>. This default to the\n                                trajectory file name with the `.density.dat`\n                                extension.\n  --format=<format>             force the input file format to be <format>\n  -t <path>, --topology=<path>  alternative topology file for the input\n  --topology-format=<format>    use <format> as format for the topology file\n  --guess-bonds                 guess the bonds in the input\n  -c <cell>, --cell=<cell>      alternative unit cell. <cell> format is one of\n                                <a:b:c:α:β:γ> or <a:b:c> or <a>. 'a', 'b' and\n                                'c' are in angstroms, 'α', 'β', and 'γ' are in\n                                degrees.\n  --steps=<steps>               steps to use from the input. <steps> format\n                                is <start>:<end>[:<stride>] with <start>, <end>\n                                and <stride> optional. The used steps goes from\n                                <start> to <end> (excluded) by steps of\n                                <stride>. The default values are 0 for <start>,\n                                the number of steps for <end> and 1 for\n                                <stride>.\n  -s <sel>, --selection=<sel>   selection to use for the particles. This must\n                                be a selection of size 1. [default: atoms: all]\n  --axis=<axis>...              computes a linear density profile along <axis>.\n                                It should be either one of 'X','Y','Z'\n                                or a vector defining the axis (e.g. 1:1:1).\n  --radial=<axis>...            computes a radial density profile using the\n                                distance to <axis>.\n                                It should be either one of 'X','Y','Z'\n                                or a vector defining the axis (e.g. 1:1:1).\n  --origin=<coord>              coordinates for the origin of the axis (only\n                                relevant for radial profiles). [default: 0:0:0]\n  -p <n>, --points=<n>          number of points in the profile [default: 200]\n  --max=<max>                   maximum distance in the profile. [default: 10]\n  --min=<min>                   minimum distance in the profile. [default: 0]\n                                For radial profiles, <min> must be positive.\n)\";\n\nAverager<double> DensityProfile::setup(int argc, const char* argv[]) {\n    auto options_str = command_header(\"density\", DensityProfile().description()) + \"\\n\";\n    options_str += \"Laura Scalfi <laura.scalfi@ens.fr>\\n\";\n    options_str += OPTIONS;\n    auto args = docopt::docopt(options_str, {argv, argv + argc}, true, \"\");\n\n    AveCommand::parse_options(args);\n\n    options_.selection = args.at(\"--selection\").asString();\n    selection_ = Selection(options_.selection);\n    if (selection_.size() != 1) {\n        throw CFilesError(\"Can not use a selection with size different than 1.\");\n    }\n\n    if (args.at(\"--output\")){\n        options_.outfile = args.at(\"--output\").asString();\n    } else {\n        options_.outfile = AveCommand::options().trajectory + \".density.dat\";\n    }\n\n    if (args.at(\"--axis\")) {\n        for (auto axis: args.at(\"--axis\").asStringList()) {\n            axis_.push_back(Axis::parse(axis, Axis::Linear));\n        }\n    }\n\n    if (args.at(\"--radial\")) {\n        for (auto axis: args.at(\"--radial\").asStringList()) {\n            axis_.push_back(Axis::parse(axis, Axis::Radial));\n        }\n    }\n\n    size_t dimension = dimensionality();\n\n    if (dimension == 0 or dimension > 2) {\n        throw CFilesError(\"No axis or too many axis were given\");\n    }\n\n    if (args.at(\"--points\")) {\n        auto splitted = split(args.at(\"--points\").asString(),':');\n        if (splitted.size() == 1) {\n            options_.npoints[0] = string2long(splitted[0]);\n            options_.npoints[1] = string2long(splitted[0]);\n        } else if (splitted.size() == 2) {\n            if (dimension < 2) {\n                throw CFilesError(\"More --points options than axis\");\n            }\n            options_.npoints[0] = string2long(splitted[0]);\n            options_.npoints[1] = string2long(splitted[1]);\n        } else {\n            throw CFilesError(\"Too many arguments for --points option\");\n        }\n    }\n\n    if (args.at(\"--origin\")) {\n        auto splitted = split(args.at(\"--origin\").asString(),':');\n        if (splitted.size() != 3) {\n            throw CFilesError(\"Origin for density profile should be a vector of size 3\");\n        }\n        auto a = string2double(splitted[0]);\n        auto b = string2double(splitted[1]);\n        auto c = string2double(splitted[2]);\n        options_.origin = Vector3D(a, b, c);\n    }\n\n    if (args.at(\"--max\")) {\n        auto splitted = split(args.at(\"--max\").asString(),':');\n        if (splitted.size() == 1) {\n            options_.max[0] = string2double(splitted[0]);\n            options_.max[1] = string2double(splitted[0]);\n        } else if (splitted.size() == 2) {\n            if (dimension < 2) {\n                throw CFilesError(\"More --max options than axis\");\n            }\n            options_.max[0] = string2double(splitted[0]);\n            options_.max[1] = string2double(splitted[1]);\n        } else {\n            throw CFilesError(\"Too many arguments for --max option\");\n        }\n    }\n\n    if (args.at(\"--min\")) {\n         auto splitted = split(args.at(\"--min\").asString(),':');\n         if (splitted.size() == 1) {\n             options_.min[0] = string2double(splitted[0]);\n             options_.min[1] = string2double(splitted[0]);\n         } else if (splitted.size() == 2) {\n             if (dimension < 2) {\n                 throw CFilesError(\"More --min options than axis\");\n             }\n             options_.min[0] = string2double(splitted[0]);\n             options_.min[1] = string2double(splitted[1]);\n         } else {\n             throw CFilesError(\"Too many arguments for --min option\");\n         }\n    }\n\n    if (options_.min[0] > options_.max[0]) {\n        throw CFilesError(\"Min > Max for first dimension\");\n    }\n\n    if (options_.min[1] > options_.max[1]) {\n        throw CFilesError(\"Min > Max for second dimension\");\n    }\n\n    if (dimension == 1) {\n        if (axis_[0].is_radial()) {\n            if (options_.min[0] < 0) {\n                throw CFilesError(\"Min value for radial axis should be positive\");\n            }\n        }\n        return Averager<double>(options_.npoints[0], options_.min[0], options_.max[0]);\n    } else {\n        assert(dimension == 2);\n        if (axis_[0].is_radial()) {\n            if (options_.min[1] < 0) {\n                throw CFilesError(\"Min value for radial axis should be positive\");\n            }\n        }\n        return Averager<double>(options_.npoints[0], options_.min[0], options_.max[0], options_.npoints[1], options_.min[1], options_.max[1]);\n    }\n}\n\n\nstd::string DensityProfile::description() const {\n    return \"compute density profiles\";\n}\n\nvoid DensityProfile::accumulate(const chemfiles::Frame& frame, Histogram<double>& profile) {\n    auto positions = frame.positions();\n    auto cell = frame.cell();\n\n    assert(selection_.size() == 1);\n    auto selected = selection_.list(frame);\n    if (selected.empty()) {\n        warn(\n            \"No matching atom for selection '\" + selection_.string() +\n            \"' at step \" + std::to_string(frame.step())\n        );\n    }\n\n    for (auto i: selected) {\n        double x = 0;\n        double y = 0;\n        if (axis_[0].is_linear()) {\n            x = axis_[0].projection(cell.wrap(positions[i]));\n        } else {\n            assert(axis_[0].is_radial());\n            x = axis_[0].projection(cell.wrap(positions[i] - options_.origin));\n        }\n        if (dimensionality() == 2) {\n            if (axis_[1].is_linear()) {\n                y = axis_[1].projection(cell.wrap(positions[i]));\n            } else {\n                assert(axis_[1].is_radial());\n                y = axis_[1].projection(cell.wrap(positions[i] - options_.origin));\n            }\n        }\n        try {\n            if (dimensionality() == 1) {\n                profile.insert(x);\n            } else {\n                profile.insert(x,y);\n            }\n        } catch (const OutOfBoundsError& e) {\n            warn_once(e.what());\n        }\n    }\n}\n\nvoid DensityProfile::finish(const Histogram<double>& profile) {\n    std::ofstream outfile(options_.outfile, std::ios::out);\n    if (outfile.is_open()) {\n        outfile << \"# Density profile in trajectory \" << AveCommand::options().trajectory << std::endl;\n        outfile << \"# along axis \" << axis_[0].str() << std::endl;\n        if (dimensionality() == 2) {\n            outfile << \"# and along axis \" << axis_[1].str() << std::endl;\n        }\n        outfile << \"# Selection: \" << options_.selection << std::endl;\n\n        if (dimensionality() == 1) {\n            for (size_t i = 0; i < profile.size(); i++){\n                if (axis_[0].is_linear()) {\n                    outfile << profile.first_coord(i) << \"  \" << profile[i] << \"\\n\";\n                } else {\n                    assert(axis_[0].is_radial());\n                    outfile << profile.first_coord(i) << \"  \" << profile[i] \/ profile.first_coord(i) << \"\\n\";\n                }\n            }\n        } else {\n            outfile << \"# FirstDimension SecondDimension Density\" << std::endl;\n\n            for (size_t i = 0; i < profile.first().nbins; i++){\n                for (size_t j = 0; j < profile.second().nbins; j++){\n                    outfile << profile.first_coord(i) << \"\\t\" << profile.second_coord(j) << \"\\t\";\n                    if (axis_[0].is_linear() and axis_[1].is_linear()) {\n                        outfile << profile(i,j) << \"\\n\";\n                    } else {\n                        assert(axis_[0].is_linear() and axis_[1].is_radial());\n                        outfile << profile(i,j) \/ profile.second_coord(j) << \"\\n\";\n                    }\n                }\n            }\n        }\n    } else {\n        throw CFilesError(\"Could not open the '\" + options_.outfile + \"' file.\");\n    }\n}\n<commit_msg>Use the default options for density<commit_after>\/\/ cfiles, an analysis frontend for the Chemfiles library\n\/\/ Copyright (C) Guillaume Fraux and contributors -- BSD license\n\n#include <docopt\/docopt.h>\n#include <sstream>\n#include <fstream>\n\n#include \"DensityProfile.hpp\"\n#include \"Errors.hpp\"\n#include \"utils.hpp\"\n#include \"warnings.hpp\"\n\nusing namespace chemfiles;\n\nstatic const char OPTIONS[] =\nR\"(Compute the density profile of particles along a given axis or radially.\nThe output for the radial density profile is normalized by r.\nSelections for the particles can be specified using the chemfiles selection\nlanguage. It is possible to provide an alternative unit cell or topology for the\ntrajectory file if they are not defined in the trajectory format. The axis can\nbe specified using a coordinate vector (e.g. z axis would be (0,0,1)).\n\nIt is also possible to compute 2D profiles by specifying 2 axis (see --axis and\n--radial options). Other options (--points, --max, --min) may accept two values,\none for each axis. If only one is specified, the same value will be used for\nboth axis (see Examples). The output is a 2D histogram with the first dimension\nbeing the first axis and the second dimension the second axis. If two axis of\nthe same type are used (e.g. twice --axis option), the order will be the one the\nuser gave. If the axis types are different (e.g. --axis and --radial), the\n--axis will be first. Two axis of type radial are forbidden.\n\nFor more information about chemfiles selection language, please see\nhttp:\/\/chemfiles.org\/chemfiles\/latest\/selections.html\n\nUsage:\n  cfiles density [options] <trajectory> [--axis=<axis>...] [--radial=<axis>...]\n  cfiles density (-h | --help)\n\nExamples:\n  cfiles density water.xyz --cell 15:15:25 --guess-bonds --axis=1:1:1\n  cfiles density in.pdb --selection=\"x > 3\" --points=500\n  cfiles density nt.pdb --radial=Z --max=3 --origin=0:0:2\n  cfiles density nt.pdb --profile=Z --radial=Z --max=10:5 --origin=0:0:2\n\nOptions:\n  -h --help                     show this help\n  -o <file>, --output=<file>    write result to <file>. This default to the\n                                trajectory file name with the `.density.dat`\n                                extension.\n  -s <sel>, --selection=<sel>   selection to use for the particles. This must\n                                be a selection of size 1. [default: atoms: all]\n  --axis=<axis>...              computes a linear density profile along <axis>.\n                                It should be either one of 'X','Y','Z'\n                                or a vector defining the axis (e.g. 1:1:1).\n  --radial=<axis>...            computes a radial density profile using the\n                                distance to <axis>.\n                                It should be either one of 'X','Y','Z'\n                                or a vector defining the axis (e.g. 1:1:1).\n  --origin=<coord>              coordinates for the origin of the axis (only\n                                relevant for radial profiles). [default: 0:0:0]\n  -p <n>, --points=<n>          number of points in the profile [default: 200]\n  --max=<max>                   maximum distance in the profile. [default: 10]\n  --min=<min>                   minimum distance in the profile. [default: 0]\n                                For radial profiles, <min> must be positive.)\";\n\nAverager<double> DensityProfile::setup(int argc, const char* argv[]) {\n    auto options = command_header(\"density\", DensityProfile().description()) + \"\\n\";\n    options += \"Laura Scalfi <laura.scalfi@ens.fr>\\n\\n\";\n    options += std::string(OPTIONS) + AveCommand::AVERAGE_OPTIONS;\n    auto args = docopt::docopt(options, {argv, argv + argc}, true, \"\");\n\n    AveCommand::parse_options(args);\n\n    options_.selection = args.at(\"--selection\").asString();\n    selection_ = Selection(options_.selection);\n    if (selection_.size() != 1) {\n        throw CFilesError(\"Can not use a selection with size different than 1.\");\n    }\n\n    if (args.at(\"--output\")){\n        options_.outfile = args.at(\"--output\").asString();\n    } else {\n        options_.outfile = AveCommand::options().trajectory + \".density.dat\";\n    }\n\n    if (args.at(\"--axis\")) {\n        for (auto axis: args.at(\"--axis\").asStringList()) {\n            axis_.push_back(Axis::parse(axis, Axis::Linear));\n        }\n    }\n\n    if (args.at(\"--radial\")) {\n        for (auto axis: args.at(\"--radial\").asStringList()) {\n            axis_.push_back(Axis::parse(axis, Axis::Radial));\n        }\n    }\n\n    size_t dimension = dimensionality();\n\n    if (dimension == 0 or dimension > 2) {\n        throw CFilesError(\"No axis or too many axis were given\");\n    }\n\n    if (args.at(\"--points\")) {\n        auto splitted = split(args.at(\"--points\").asString(),':');\n        if (splitted.size() == 1) {\n            options_.npoints[0] = string2long(splitted[0]);\n            options_.npoints[1] = string2long(splitted[0]);\n        } else if (splitted.size() == 2) {\n            if (dimension < 2) {\n                throw CFilesError(\"More --points options than axis\");\n            }\n            options_.npoints[0] = string2long(splitted[0]);\n            options_.npoints[1] = string2long(splitted[1]);\n        } else {\n            throw CFilesError(\"Too many arguments for --points option\");\n        }\n    }\n\n    if (args.at(\"--origin\")) {\n        auto splitted = split(args.at(\"--origin\").asString(),':');\n        if (splitted.size() != 3) {\n            throw CFilesError(\"Origin for density profile should be a vector of size 3\");\n        }\n        auto a = string2double(splitted[0]);\n        auto b = string2double(splitted[1]);\n        auto c = string2double(splitted[2]);\n        options_.origin = Vector3D(a, b, c);\n    }\n\n    if (args.at(\"--max\")) {\n        auto splitted = split(args.at(\"--max\").asString(),':');\n        if (splitted.size() == 1) {\n            options_.max[0] = string2double(splitted[0]);\n            options_.max[1] = string2double(splitted[0]);\n        } else if (splitted.size() == 2) {\n            if (dimension < 2) {\n                throw CFilesError(\"More --max options than axis\");\n            }\n            options_.max[0] = string2double(splitted[0]);\n            options_.max[1] = string2double(splitted[1]);\n        } else {\n            throw CFilesError(\"Too many arguments for --max option\");\n        }\n    }\n\n    if (args.at(\"--min\")) {\n         auto splitted = split(args.at(\"--min\").asString(),':');\n         if (splitted.size() == 1) {\n             options_.min[0] = string2double(splitted[0]);\n             options_.min[1] = string2double(splitted[0]);\n         } else if (splitted.size() == 2) {\n             if (dimension < 2) {\n                 throw CFilesError(\"More --min options than axis\");\n             }\n             options_.min[0] = string2double(splitted[0]);\n             options_.min[1] = string2double(splitted[1]);\n         } else {\n             throw CFilesError(\"Too many arguments for --min option\");\n         }\n    }\n\n    if (options_.min[0] > options_.max[0]) {\n        throw CFilesError(\"Min > Max for first dimension\");\n    }\n\n    if (options_.min[1] > options_.max[1]) {\n        throw CFilesError(\"Min > Max for second dimension\");\n    }\n\n    if (dimension == 1) {\n        if (axis_[0].is_radial()) {\n            if (options_.min[0] < 0) {\n                throw CFilesError(\"Min value for radial axis should be positive\");\n            }\n        }\n        return Averager<double>(options_.npoints[0], options_.min[0], options_.max[0]);\n    } else {\n        assert(dimension == 2);\n        if (axis_[0].is_radial()) {\n            if (options_.min[1] < 0) {\n                throw CFilesError(\"Min value for radial axis should be positive\");\n            }\n        }\n        return Averager<double>(options_.npoints[0], options_.min[0], options_.max[0], options_.npoints[1], options_.min[1], options_.max[1]);\n    }\n}\n\n\nstd::string DensityProfile::description() const {\n    return \"compute density profiles\";\n}\n\nvoid DensityProfile::accumulate(const chemfiles::Frame& frame, Histogram<double>& profile) {\n    auto positions = frame.positions();\n    auto cell = frame.cell();\n\n    assert(selection_.size() == 1);\n    auto selected = selection_.list(frame);\n    if (selected.empty()) {\n        warn(\n            \"No matching atom for selection '\" + selection_.string() +\n            \"' at step \" + std::to_string(frame.step())\n        );\n    }\n\n    for (auto i: selected) {\n        double x = 0;\n        double y = 0;\n        if (axis_[0].is_linear()) {\n            x = axis_[0].projection(cell.wrap(positions[i]));\n        } else {\n            assert(axis_[0].is_radial());\n            x = axis_[0].projection(cell.wrap(positions[i] - options_.origin));\n        }\n        if (dimensionality() == 2) {\n            if (axis_[1].is_linear()) {\n                y = axis_[1].projection(cell.wrap(positions[i]));\n            } else {\n                assert(axis_[1].is_radial());\n                y = axis_[1].projection(cell.wrap(positions[i] - options_.origin));\n            }\n        }\n        try {\n            if (dimensionality() == 1) {\n                profile.insert(x);\n            } else {\n                profile.insert(x,y);\n            }\n        } catch (const OutOfBoundsError& e) {\n            warn_once(e.what());\n        }\n    }\n}\n\nvoid DensityProfile::finish(const Histogram<double>& profile) {\n    std::ofstream outfile(options_.outfile, std::ios::out);\n    if (outfile.is_open()) {\n        outfile << \"# Density profile in trajectory \" << AveCommand::options().trajectory << std::endl;\n        outfile << \"# along axis \" << axis_[0].str() << std::endl;\n        if (dimensionality() == 2) {\n            outfile << \"# and along axis \" << axis_[1].str() << std::endl;\n        }\n        outfile << \"# Selection: \" << options_.selection << std::endl;\n\n        if (dimensionality() == 1) {\n            for (size_t i = 0; i < profile.size(); i++){\n                if (axis_[0].is_linear()) {\n                    outfile << profile.first_coord(i) << \"  \" << profile[i] << \"\\n\";\n                } else {\n                    assert(axis_[0].is_radial());\n                    outfile << profile.first_coord(i) << \"  \" << profile[i] \/ profile.first_coord(i) << \"\\n\";\n                }\n            }\n        } else {\n            outfile << \"# FirstDimension SecondDimension Density\" << std::endl;\n\n            for (size_t i = 0; i < profile.first().nbins; i++){\n                for (size_t j = 0; j < profile.second().nbins; j++){\n                    outfile << profile.first_coord(i) << \"\\t\" << profile.second_coord(j) << \"\\t\";\n                    if (axis_[0].is_linear() and axis_[1].is_linear()) {\n                        outfile << profile(i,j) << \"\\n\";\n                    } else {\n                        assert(axis_[0].is_linear() and axis_[1].is_radial());\n                        outfile << profile(i,j) \/ profile.second_coord(j) << \"\\n\";\n                    }\n                }\n            }\n        }\n    } else {\n        throw CFilesError(\"Could not open the '\" + options_.outfile + \"' file.\");\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: PaneDockingWindow.cxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: hr $ $Date: 2004-11-26 15:14: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#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    const Link& rCallback)\n{\n    \/\/ Add the menu before the closer button.\n    int nItemCount (mpTitleToolBox->GetItemCount());\n    mpTitleToolBox->InsertItem (\n        nItemCount+1,\n        rsMenuName,\n        TIB_DROPDOWN,\n        nItemCount-1);\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& rDCEvt )\n{\n    SfxDockingWindow::DataChanged (rDCEvt);\n}\n\n\n\n} \/\/ end of namespace ::sd\n<commit_msg>INTEGRATION: CWS iha06 (1.6.40); FILE MERGED 2005\/01\/18 15:14:59 iha 1.6.40.1: #i40783# added missing helpids<commit_after>\/*************************************************************************\n *\n *  $RCSfile: PaneDockingWindow.cxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: rt $ $Date: 2005-01-31 14:50: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#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_DROPDOWN,\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& rDCEvt )\n{\n    SfxDockingWindow::DataChanged (rDCEvt);\n}\n\n\n\n} \/\/ end of namespace ::sd\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * BeetleConfig.cpp\n *\n *  Created on: May 23, 2016\n *      Author: james\n *\/\n\n#include \"BeetleConfig.h\"\n\n#include <unistd.h>\n#include <json\/json.hpp>\n#include <cassert>\n#include <iostream>\n#include <fstream>\n#include <stdexcept>\n\n#include \"util\/file.h\"\n\nstatic std::string getDefaultName() {\n\tchar name[100];\n\tassert(gethostname(name, sizeof(name)) == 0);\n\treturn \"btl@\" + std::string(name);\n}\n\nBeetleConfig::BeetleConfig(std::string filename) {\n\tusing json = nlohmann::json;\n\n\tjson config;\n\tif (filename != \"\") {\n\t\tif (!file_exists(filename)) {\n\t\t\tthrow std::invalid_argument(\"configuration file not found\");\n\t\t}\n\t\tstd::ifstream ifs(filename);\n\t\tifs >> config;\n\t}\n\n\tif (config.count(\"name\")) {\n\t\tname = config[\"name\"];\n\t} else {\n\t\tname = getDefaultName();\n\t}\n\n\tif (config.count(\"scan\")) {\n\t\tjson scanConfig = config[\"scan\"];\n\t\tfor (json::iterator it = scanConfig.begin(); it != scanConfig.end(); ++it) {\n\t\t\tif (it.key() == \"enable\") {\n\t\t\t\tscanEnabled = it.value();\n\t\t\t} else {\n\t\t\t\tthrow std::invalid_argument(\"unknown scan param: \" + it.key());\n\t\t\t}\n\t\t}\n\t}\n\n\tif (config.count(\"tcp\")) {\n\t\tjson tcpConfig = config[\"tcp\"];\n\t\tfor (json::iterator it = tcpConfig.begin(); it != tcpConfig.end(); ++it) {\n\t\t\tif (it.key() ==  \"enable\") {\n\t\t\t\ttcpEnabled = it.value();\n\t\t\t} else if (it.key() == \"port\") {\n\t\t\t\ttcpPort = it.value();\n\t\t\t} else {\n\t\t\t\tthrow std::invalid_argument(\"unknown tcp param: \" + it.key());\n\t\t\t}\n\t\t}\n\t}\n\n\tif (config.count(\"ipc\")) {\n\t\tjson ipcConfig = config[\"ipc\"];\n\t\tfor (json::iterator it = ipcConfig.begin(); it != ipcConfig.end(); ++it) {\n\t\t\tif (it.key() ==  \"enable\") {\n\t\t\t\tipcEnabled = it.value();\n\t\t\t} else if (it.key() == \"path\") {\n\t\t\t\tipcPath = it.value();\n\t\t\t} else {\n\t\t\t\tthrow std::invalid_argument(\"unknown ipc param: \" + it.key());\n\t\t\t}\n\t\t}\n\t}\n\n\tif (config.count(\"controller\")) {\n\t\tjson controllerConfig = config[\"controller\"];\n\t\tfor (json::iterator it = controllerConfig.begin(); it != controllerConfig.end(); ++it) {\n\t\t\tif (it.key() ==  \"enable\") {\n\t\t\t\tcontrollerEnabled = it.value();\n\t\t\t} else if (it.key() == \"host\") {\n\t\t\t\tcontrollerHost = it.value();\n\t\t\t} else if (it.key() == \"port\") {\n\t\t\t\tcontrollerPort = it.value();\n\t\t\t} else {\n\t\t\t\tthrow std::invalid_argument(\"unknown controller param: \" + it.key());\n\t\t\t}\n\t\t}\n\t}\n\n\tif (config.count(\"ssl\")) {\n\t\tjson sslConfig = config[\"ssl\"];\n\t\tfor (json::iterator it = sslConfig.begin(); it != sslConfig.end(); ++it) {\n\t\t\tif (it.key() == \"verifyPeers\") {\n\t\t\t\tsslVerifyPeers = it.value();\n\t\t\t} else if (it.key() == \"serverKey\") {\n\t\t\t\tsslServerKey = it.value();\n\t\t\t} else if (it.key() == \"serverCert\") {\n\t\t\t\tsslServerCert = it.value();\n\t\t\t} else if (it.key() == \"clientKey\") {\n\t\t\t\tsslClientKey = it.value();\n\t\t\t} else if (it.key() == \"clientCert\") {\n\t\t\t\tsslClientCert = it.value();\n\t\t\t} else {\n\t\t\t\tthrow std::invalid_argument(\"unknown ssl param: \" + it.key());\n\t\t\t}\n\t\t}\n\t}\n\n\tif (config.count(\"debug\")) {\n\t\tjson debugConfig = config[\"debug\"];\n\t\tfor (json::iterator it = debugConfig.begin(); it != debugConfig.end(); ++it) {\n\t\t\tif (it.key() == \"discovery\") {\n\t\t\t\tdebugDiscovery = it.value();\n\t\t\t} else if (it.key() == \"scan\") {\n\t\t\t\tdebugScan = it.value();\n\t\t\t} else if (it.key() == \"socket\") {\n\t\t\t\tdebugSocket = it.value();\n\t\t\t} else if (it.key() == \"router\") {\n\t\t\t\tdebugRouter = it.value();\n\t\t\t} else if (it.key() == \"performance\") {\n\t\t\t\tdebugPerformance = it.value();\n\t\t\t} else if (it.key() == \"controller\") {\n\t\t\t\tdebugController = it.value();\n\t\t\t} else {\n\t\t\t\tthrow std::invalid_argument(\"unknown debug param: \" + it.key());\n\t\t\t}\n\t\t}\n\t}\n}\n\nBeetleConfig::~BeetleConfig() {\n\t\/\/ nothing to do\n}\n\nstd::string BeetleConfig::getControllerHostAndPort() const {\n\treturn controllerHost + \":\" + std::to_string(controllerPort);\n}\n\nstd::string BeetleConfig::str(unsigned int indent) const {\n\tusing json = nlohmann::json;\n\n\tjson config;\n\tconfig[\"name\"] = name;\n\n\tjson scan;\n\tscan[\"enable\"] = scanEnabled;\n\tconfig[\"scan\"] = scan;\n\n\tjson tcp;\n\ttcp[\"enable\"] = tcpEnabled;\n\ttcp[\"port\"] = tcpPort;\n\tconfig[\"tcp\"] = tcp;\n\n\tjson ipc;\n\tipc[\"enable\"] = ipcEnabled;\n\tipc[\"path\"] = ipcPath;\n\tconfig[\"ipc\"] = ipc;\n\n\tjson controller;\n\tcontroller[\"enable\"] = controllerEnabled;\n\tcontroller[\"host\"] = controllerHost;\n\tcontroller[\"port\"] = controllerPort;\n\tconfig[\"controller\"] = controller;\n\n\tjson ssl;\n\tssl[\"verifyPeers\"] = sslVerifyPeers;\n\tssl[\"serverCert\"] = sslServerCert;\n\tssl[\"serverKey\"] = sslServerKey;\n\tssl[\"clientCert\"] = sslClientCert;\n\tssl[\"clientKey\"] = sslClientKey;\n\tconfig[\"ssl\"] = ssl;\n\n\tjson debug;\n\tdebug[\"controller\"] = debugController;\n\tdebug[\"discovery\"] = debugDiscovery;\n\tdebug[\"performance\"] = debugPerformance;\n\tdebug[\"router\"] = debugRouter;\n\tdebug[\"scan\"] = debugScan;\n\tdebug[\"socket\"] = debugSocket;\n\tconfig[\"debug\"] = debug;\n\n\treturn config.dump(indent);\n}\n<commit_msg>Validate files in config.<commit_after>\/*\n * BeetleConfig.cpp\n *\n *  Created on: May 23, 2016\n *      Author: james\n *\/\n\n#include \"BeetleConfig.h\"\n\n#include <unistd.h>\n#include <json\/json.hpp>\n#include <cassert>\n#include <iostream>\n#include <fstream>\n#include <stdexcept>\n\n#include \"util\/file.h\"\n\nstatic std::string getDefaultName() {\n\tchar name[100];\n\tassert(gethostname(name, sizeof(name)) == 0);\n\treturn \"btl@\" + std::string(name);\n}\n\nBeetleConfig::BeetleConfig(std::string filename) {\n\tusing json = nlohmann::json;\n\n\tjson config;\n\tif (filename != \"\") {\n\t\tif (!file_exists(filename)) {\n\t\t\tthrow std::invalid_argument(\"configuration file not found\");\n\t\t}\n\t\tstd::ifstream ifs(filename);\n\t\tifs >> config;\n\t}\n\n\tif (config.count(\"name\")) {\n\t\tname = config[\"name\"];\n\t} else {\n\t\tname = getDefaultName();\n\t}\n\n\tif (config.count(\"scan\")) {\n\t\tjson scanConfig = config[\"scan\"];\n\t\tfor (json::iterator it = scanConfig.begin(); it != scanConfig.end(); ++it) {\n\t\t\tif (it.key() == \"enable\") {\n\t\t\t\tscanEnabled = it.value();\n\t\t\t} else {\n\t\t\t\tthrow std::invalid_argument(\"unknown scan param: \" + it.key());\n\t\t\t}\n\t\t}\n\t}\n\n\tif (config.count(\"tcp\")) {\n\t\tjson tcpConfig = config[\"tcp\"];\n\t\tfor (json::iterator it = tcpConfig.begin(); it != tcpConfig.end(); ++it) {\n\t\t\tif (it.key() ==  \"enable\") {\n\t\t\t\ttcpEnabled = it.value();\n\t\t\t} else if (it.key() == \"port\") {\n\t\t\t\ttcpPort = it.value();\n\t\t\t} else {\n\t\t\t\tthrow std::invalid_argument(\"unknown tcp param: \" + it.key());\n\t\t\t}\n\t\t}\n\t}\n\n\tif (config.count(\"ipc\")) {\n\t\tjson ipcConfig = config[\"ipc\"];\n\t\tfor (json::iterator it = ipcConfig.begin(); it != ipcConfig.end(); ++it) {\n\t\t\tif (it.key() ==  \"enable\") {\n\t\t\t\tipcEnabled = it.value();\n\t\t\t} else if (it.key() == \"path\") {\n\t\t\t\tipcPath = it.value();\n\t\t\t} else {\n\t\t\t\tthrow std::invalid_argument(\"unknown ipc param: \" + it.key());\n\t\t\t}\n\t\t}\n\t}\n\n\tif (config.count(\"controller\")) {\n\t\tjson controllerConfig = config[\"controller\"];\n\t\tfor (json::iterator it = controllerConfig.begin(); it != controllerConfig.end(); ++it) {\n\t\t\tif (it.key() ==  \"enable\") {\n\t\t\t\tcontrollerEnabled = it.value();\n\t\t\t} else if (it.key() == \"host\") {\n\t\t\t\tcontrollerHost = it.value();\n\t\t\t} else if (it.key() == \"port\") {\n\t\t\t\tcontrollerPort = it.value();\n\t\t\t} else {\n\t\t\t\tthrow std::invalid_argument(\"unknown controller param: \" + it.key());\n\t\t\t}\n\t\t}\n\t}\n\n\tif (config.count(\"ssl\")) {\n\t\tjson sslConfig = config[\"ssl\"];\n\t\tfor (json::iterator it = sslConfig.begin(); it != sslConfig.end(); ++it) {\n\t\t\tif (it.key() == \"verifyPeers\") {\n\t\t\t\tsslVerifyPeers = it.value();\n\t\t\t} else if (it.key() == \"serverKey\") {\n\t\t\t\tsslServerKey = it.value();\n\t\t\t\tif (!file_exists(sslServerKey)) {\n\t\t\t\t\tthrow std::invalid_argument(\"file does not exist: \" + sslServerKey);\n\t\t\t\t}\n\t\t\t} else if (it.key() == \"serverCert\") {\n\t\t\t\tsslServerCert = it.value();\n\t\t\t\tif (!file_exists(sslServerCert)) {\n\t\t\t\t\tthrow std::invalid_argument(\"file does not exist: \" + sslServerCert);\n\t\t\t\t}\n\t\t\t} else if (it.key() == \"clientKey\") {\n\t\t\t\tsslClientKey = it.value();\n\t\t\t\tif (!file_exists(sslClientKey)) {\n\t\t\t\t\tthrow std::invalid_argument(\"file does not exist: \" + sslClientKey);\n\t\t\t\t}\n\t\t\t} else if (it.key() == \"clientCert\") {\n\t\t\t\tsslClientCert = it.value();\n\t\t\t\tif (!file_exists(sslClientCert)) {\n\t\t\t\t\tthrow std::invalid_argument(\"file does not exist: \" + sslClientCert);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tthrow std::invalid_argument(\"unknown ssl param: \" + it.key());\n\t\t\t}\n\t\t}\n\t}\n\n\tif (config.count(\"debug\")) {\n\t\tjson debugConfig = config[\"debug\"];\n\t\tfor (json::iterator it = debugConfig.begin(); it != debugConfig.end(); ++it) {\n\t\t\tif (it.key() == \"discovery\") {\n\t\t\t\tdebugDiscovery = it.value();\n\t\t\t} else if (it.key() == \"scan\") {\n\t\t\t\tdebugScan = it.value();\n\t\t\t} else if (it.key() == \"socket\") {\n\t\t\t\tdebugSocket = it.value();\n\t\t\t} else if (it.key() == \"router\") {\n\t\t\t\tdebugRouter = it.value();\n\t\t\t} else if (it.key() == \"performance\") {\n\t\t\t\tdebugPerformance = it.value();\n\t\t\t} else if (it.key() == \"controller\") {\n\t\t\t\tdebugController = it.value();\n\t\t\t} else {\n\t\t\t\tthrow std::invalid_argument(\"unknown debug param: \" + it.key());\n\t\t\t}\n\t\t}\n\t}\n}\n\nBeetleConfig::~BeetleConfig() {\n\t\/\/ nothing to do\n}\n\nstd::string BeetleConfig::getControllerHostAndPort() const {\n\treturn controllerHost + \":\" + std::to_string(controllerPort);\n}\n\nstd::string BeetleConfig::str(unsigned int indent) const {\n\tusing json = nlohmann::json;\n\n\tjson config;\n\tconfig[\"name\"] = name;\n\n\tjson scan;\n\tscan[\"enable\"] = scanEnabled;\n\tconfig[\"scan\"] = scan;\n\n\tjson tcp;\n\ttcp[\"enable\"] = tcpEnabled;\n\ttcp[\"port\"] = tcpPort;\n\tconfig[\"tcp\"] = tcp;\n\n\tjson ipc;\n\tipc[\"enable\"] = ipcEnabled;\n\tipc[\"path\"] = ipcPath;\n\tconfig[\"ipc\"] = ipc;\n\n\tjson controller;\n\tcontroller[\"enable\"] = controllerEnabled;\n\tcontroller[\"host\"] = controllerHost;\n\tcontroller[\"port\"] = controllerPort;\n\tconfig[\"controller\"] = controller;\n\n\tjson ssl;\n\tssl[\"verifyPeers\"] = sslVerifyPeers;\n\tssl[\"serverCert\"] = sslServerCert;\n\tssl[\"serverKey\"] = sslServerKey;\n\tssl[\"clientCert\"] = sslClientCert;\n\tssl[\"clientKey\"] = sslClientKey;\n\tconfig[\"ssl\"] = ssl;\n\n\tjson debug;\n\tdebug[\"controller\"] = debugController;\n\tdebug[\"discovery\"] = debugDiscovery;\n\tdebug[\"performance\"] = debugPerformance;\n\tdebug[\"router\"] = debugRouter;\n\tdebug[\"scan\"] = debugScan;\n\tdebug[\"socket\"] = debugSocket;\n\tconfig[\"debug\"] = debug;\n\n\treturn config.dump(indent);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file freeimage.cpp\n * @brief Graphics layer using FreeImage\n *\n * (c) 2014 by Mega Limited, Wellsford, New Zealand\n *\n * This file is part of the MEGA SDK - Client Access Engine.\n *\n * Applications using the MEGA API must present a valid application key\n * and comply with the the rules set forth in the Terms of Service.\n *\n * The MEGA SDK is distributed in the hope 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 * @copyright Simplified (2-clause) BSD License.\n *\n * You should have received a copy of the license along with this\n * program.\n *\/\n\n#include \"mega.h\"\n#include \"mega\/gfx\/freeimage.h\"\n\n#ifdef _WIN32\n#define FreeImage_GetFileTypeX FreeImage_GetFileTypeU\n#define FreeImage_LoadX FreeImage_LoadU\ntypedef const wchar_t freeimage_filename_char_t;\n#else\n#define FreeImage_GetFileTypeX FreeImage_GetFileType\n#define FreeImage_LoadX FreeImage_Load\ntypedef const char freeimage_filename_char_t;\n#endif\n\nnamespace mega {\n\nGfxProcFreeImage::GfxProcFreeImage()\n{\n#ifdef FREEIMAGE_LIB\n\tFreeImage_Initialise(TRUE);\n#endif\n}\n\nconst char* GfxProcFreeImage::supportedformats()\n{\n    return \".jpg.png.bmp.tif.tiff.jpeg.cut.dds.exr.g3.gif.hdr.ico.iff.ilbm\"\n           \".jbig.jng.jif.koala.pcd.mng.pcx.pbm.pgm.ppm.pfm.pict.pic.pct.pds.raw.3fr.ari\"\n           \".arw.bay.crw.cr2.cap.dcs.dcr.dng.drf.eip.erf.fff.iiq.k25.kdc.mdc.mef.mos.mrw\"\n           \".nef.nrw.obm.orf.pef.ptx.pxn.r3d.raf.raw.rwl.rw2.rwz.sr2.srf.srw.x3f.ras.tga\"\n           \".xbm.xpm.jp2.j2k.jpf.jpx.\";\n}\n\nbool GfxProcFreeImage::readbitmap(FileAccess* fa, string* localname, int size)\n{\n#ifdef _WIN32\n    localname->append(\"\", 1);\n#endif\n\n    \/\/ FIXME: race condition, need to use open file instead of filename\n    FREE_IMAGE_FORMAT fif = FreeImage_GetFileTypeX((freeimage_filename_char_t*)localname->data());\n\n    if (fif == FIF_UNKNOWN)\n    {\n#ifdef _WIN32\n        localname->resize(localname->size()-1);\n#endif\n        return false;\n    }\n\n    if (fif == FIF_JPEG)\n    {\n        \/\/ load JPEG (scale & EXIF-rotate)\n        FITAG *tag;\n\n        if (!(dib = FreeImage_LoadX(fif, (freeimage_filename_char_t*) localname->data(),\n                                    JPEG_EXIFROTATE | JPEG_FAST | (size << 16))))\n        {\n#ifdef _WIN32\n            localname->resize(localname->size()-1);\n#endif\n            return false;\n        }\n\n        if (FreeImage_GetMetadata(FIMD_COMMENTS, dib, \"OriginalJPEGWidth\", &tag))\n        {\n            w = atoi((char*)FreeImage_GetTagValue(tag));\n        }\n        else\n        {\n            w = FreeImage_GetWidth(dib);\n        }\n\n        if (FreeImage_GetMetadata(FIMD_COMMENTS, dib, \"OriginalJPEGHeight\", &tag))\n        {\n            h = atoi((char*)FreeImage_GetTagValue(tag));\n        }\n        else\n        {\n            h = FreeImage_GetHeight(dib);\n        }\n    }\n    else\n    {\n        \/\/ load all other image types - for RAW formats, rely on embedded preview\n        if (!(dib = FreeImage_LoadX(fif, (freeimage_filename_char_t*)localname->data(),\n                                    (fif == FIF_RAW) ? RAW_PREVIEW : 0)))\n        {\n#ifdef _WIN32\n            localname->resize(localname->size()-1);\n#endif\n            return false;\n        }\n\n        w = FreeImage_GetWidth(dib);\n        h = FreeImage_GetHeight(dib);\n    }\n    \n    return true;\n}\n\nbool GfxProcFreeImage::resizebitmap(int rw, int rh, string* jpegout)\n{\n    FIBITMAP* tdib;\n    FIMEMORY* hmem;\n    int px, py;\n\n    if (!w || !h) return false;\n    \n    transform(w, h, rw, rh, px, py);\n\n    if (!w || !h) return false;\n\n    jpegout->clear();\n\n    if ((tdib = FreeImage_Rescale(dib, w, h, FILTER_BILINEAR)))\n    {\n        FreeImage_Unload(dib);\n\n        dib = tdib;\n\n        if ((tdib = FreeImage_Copy(dib, px, py, px + rw, py + rh)))\n        {\n            FreeImage_Unload(dib);\n\n            dib = tdib;\n\n            if ((hmem = FreeImage_OpenMemory()))\n            {\n                if (FreeImage_SaveToMemory(FIF_JPEG, dib, hmem, JPEG_BASELINE | JPEG_OPTIMIZE | 85))\n                {\n                    BYTE* tdata;\n                    DWORD tlen;\n\n                    FreeImage_AcquireMemory(hmem, &tdata, &tlen);\n                    jpegout->assign((char*)tdata, tlen);\n                }\n\n                FreeImage_CloseMemory(hmem);\n            }\n        }\n    }\n\n    return !!jpegout->size();\n}\n\nvoid GfxProcFreeImage::freebitmap()\n{\n    FreeImage_Unload(dib);\n}\n} \/\/ namespace\n<commit_msg>Compatibility with old FreeImage versions<commit_after>\/**\n * @file freeimage.cpp\n * @brief Graphics layer using FreeImage\n *\n * (c) 2014 by Mega Limited, Wellsford, New Zealand\n *\n * This file is part of the MEGA SDK - Client Access Engine.\n *\n * Applications using the MEGA API must present a valid application key\n * and comply with the the rules set forth in the Terms of Service.\n *\n * The MEGA SDK is distributed in the hope 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 * @copyright Simplified (2-clause) BSD License.\n *\n * You should have received a copy of the license along with this\n * program.\n *\/\n\n#include \"mega.h\"\n#include \"mega\/gfx\/freeimage.h\"\n\n#ifdef _WIN32\n#define FreeImage_GetFileTypeX FreeImage_GetFileTypeU\n#define FreeImage_LoadX FreeImage_LoadU\ntypedef const wchar_t freeimage_filename_char_t;\n#else\n#define FreeImage_GetFileTypeX FreeImage_GetFileType\n#define FreeImage_LoadX FreeImage_Load\ntypedef const char freeimage_filename_char_t;\n#endif\n\n#if FREEIMAGE_MAJOR_VERSION < 3 || FREEIMAGE_MINOR_VERSION < 13\n#define OLD_FREEIMAGE\n#endif\n\n\nnamespace mega {\n\nGfxProcFreeImage::GfxProcFreeImage()\n{\n#ifdef FREEIMAGE_LIB\n\tFreeImage_Initialise(TRUE);\n#endif\n}\n\nconst char* GfxProcFreeImage::supportedformats()\n{\n    return \".jpg.png.bmp.tif.tiff.jpeg.cut.dds.exr.g3.gif.hdr.ico.iff.ilbm\"\n           \".jbig.jng.jif.koala.pcd.mng.pcx.pbm.pgm.ppm.pfm.pict.pic.pct.pds.raw.3fr.ari\"\n           \".arw.bay.crw.cr2.cap.dcs.dcr.dng.drf.eip.erf.fff.iiq.k25.kdc.mdc.mef.mos.mrw\"\n           \".nef.nrw.obm.orf.pef.ptx.pxn.r3d.raf.raw.rwl.rw2.rwz.sr2.srf.srw.x3f.ras.tga\"\n           \".xbm.xpm.jp2.j2k.jpf.jpx.\";\n}\n\nbool GfxProcFreeImage::readbitmap(FileAccess* fa, string* localname, int size)\n{\n#ifdef _WIN32\n    localname->append(\"\", 1);\n#endif\n\n    \/\/ FIXME: race condition, need to use open file instead of filename\n    FREE_IMAGE_FORMAT fif = FreeImage_GetFileTypeX((freeimage_filename_char_t*)localname->data());\n\n    if (fif == FIF_UNKNOWN)\n    {\n#ifdef _WIN32\n        localname->resize(localname->size()-1);\n#endif\n        return false;\n    }\n\n #ifndef OLD_FREEIMAGE\n    if (fif == FIF_JPEG)\n    {\n        \/\/ load JPEG (scale & EXIF-rotate)\n        FITAG *tag;\n\n        if (!(dib = FreeImage_LoadX(fif, (freeimage_filename_char_t*) localname->data(),\n                                    JPEG_EXIFROTATE | JPEG_FAST | (size << 16))))\n        {\n#ifdef _WIN32\n            localname->resize(localname->size()-1);\n#endif\n            return false;\n        }\n\n        if (FreeImage_GetMetadata(FIMD_COMMENTS, dib, \"OriginalJPEGWidth\", &tag))\n        {\n            w = atoi((char*)FreeImage_GetTagValue(tag));\n        }\n        else\n        {\n            w = FreeImage_GetWidth(dib);\n        }\n\n        if (FreeImage_GetMetadata(FIMD_COMMENTS, dib, \"OriginalJPEGHeight\", &tag))\n        {\n            h = atoi((char*)FreeImage_GetTagValue(tag));\n        }\n        else\n        {\n            h = FreeImage_GetHeight(dib);\n        }\n    }\n    else\n#endif\n    {\n        \/\/ load all other image types - for RAW formats, rely on embedded preview\n        if (!(dib = FreeImage_LoadX(fif, (freeimage_filename_char_t*)localname->data(),\n                #ifndef OLD_FREEIMAGE\n                                    (fif == FIF_RAW) ? RAW_PREVIEW : 0)))\n                #else\n                                    0)))\n                #endif\n        {\n#ifdef _WIN32\n            localname->resize(localname->size()-1);\n#endif\n            return false;\n        }\n\n        w = FreeImage_GetWidth(dib);\n        h = FreeImage_GetHeight(dib);\n    }\n    \n    return true;\n}\n\nbool GfxProcFreeImage::resizebitmap(int rw, int rh, string* jpegout)\n{\n    FIBITMAP* tdib;\n    FIMEMORY* hmem;\n    int px, py;\n\n    if (!w || !h) return false;\n    \n    transform(w, h, rw, rh, px, py);\n\n    if (!w || !h) return false;\n\n    jpegout->clear();\n\n    if ((tdib = FreeImage_Rescale(dib, w, h, FILTER_BILINEAR)))\n    {\n        FreeImage_Unload(dib);\n\n        dib = tdib;\n\n        if ((tdib = FreeImage_Copy(dib, px, py, px + rw, py + rh)))\n        {\n            FreeImage_Unload(dib);\n\n            dib = tdib;\n\n            if ((hmem = FreeImage_OpenMemory()))\n            {\n                if (FreeImage_SaveToMemory(FIF_JPEG, dib, hmem,\n                #ifndef OLD_FREEIMAGE\n                    JPEG_BASELINE | JPEG_OPTIMIZE |\n                #endif\n                    85))\n                {\n                    BYTE* tdata;\n                    DWORD tlen;\n\n                    FreeImage_AcquireMemory(hmem, &tdata, &tlen);\n                    jpegout->assign((char*)tdata, tlen);\n                }\n\n                FreeImage_CloseMemory(hmem);\n            }\n        }\n    }\n\n    return !!jpegout->size();\n}\n\nvoid GfxProcFreeImage::freebitmap()\n{\n    FreeImage_Unload(dib);\n}\n} \/\/ namespace\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\nvoid\nast_type_specifier::print(void) const\n{\n   if (structure) {\n      structure->print();\n   } else {\n      printf(\"%s \", type_name);\n   }\n\n   if (array_specifier) {\n      array_specifier->print();\n   }\n}\n\nbool\nast_fully_specified_type::has_qualifiers() const\n{\n   return this->qualifier.flags.i != 0;\n}\n\nbool ast_type_qualifier::has_interpolation() const\n{\n   return this->flags.q.smooth\n          || this->flags.q.flat\n          || this->flags.q.noperspective;\n}\n\nbool\nast_type_qualifier::has_layout() const\n{\n   return this->flags.q.origin_upper_left\n          || this->flags.q.pixel_center_integer\n          || this->flags.q.depth_any\n          || this->flags.q.depth_greater\n          || this->flags.q.depth_less\n          || this->flags.q.depth_unchanged\n          || this->flags.q.std140\n          || this->flags.q.shared\n          || this->flags.q.column_major\n          || this->flags.q.row_major\n          || this->flags.q.packed\n          || this->flags.q.explicit_location\n          || this->flags.q.explicit_index\n          || this->flags.q.explicit_binding\n          || this->flags.q.explicit_offset;\n}\n\nbool\nast_type_qualifier::has_storage() const\n{\n   return this->flags.q.constant\n          || this->flags.q.attribute\n          || this->flags.q.varying\n          || this->flags.q.in\n          || this->flags.q.out\n          || this->flags.q.uniform;\n}\n\nbool\nast_type_qualifier::has_auxiliary_storage() const\n{\n   return this->flags.q.centroid\n          || this->flags.q.sample;\n}\n\nconst char*\nast_type_qualifier::interpolation_string() const\n{\n   if (this->flags.q.smooth)\n      return \"smooth\";\n   else if (this->flags.q.flat)\n      return \"flat\";\n   else if (this->flags.q.noperspective)\n      return \"noperspective\";\n   else\n      return NULL;\n}\n\nbool\nast_type_qualifier::merge_qualifier(YYLTYPE *loc,\n\t\t\t\t    _mesa_glsl_parse_state *state,\n\t\t\t\t    ast_type_qualifier q)\n{\n   ast_type_qualifier ubo_mat_mask;\n   ubo_mat_mask.flags.i = 0;\n   ubo_mat_mask.flags.q.row_major = 1;\n   ubo_mat_mask.flags.q.column_major = 1;\n\n   ast_type_qualifier ubo_layout_mask;\n   ubo_layout_mask.flags.i = 0;\n   ubo_layout_mask.flags.q.std140 = 1;\n   ubo_layout_mask.flags.q.packed = 1;\n   ubo_layout_mask.flags.q.shared = 1;\n\n   ast_type_qualifier ubo_binding_mask;\n   ubo_binding_mask.flags.i = 0;\n   ubo_binding_mask.flags.q.explicit_binding = 1;\n   ubo_binding_mask.flags.q.explicit_offset = 1;\n\n   \/* Uniform block layout qualifiers get to overwrite each\n    * other (rightmost having priority), while all other\n    * qualifiers currently don't allow duplicates.\n    *\n    * Geometry shaders can have several layout qualifiers\n    * assigning different stream values.\n    *\/\n\n   if ((state->stage != MESA_SHADER_GEOMETRY) &&\n       (this->flags.i & q.flags.i & ~(ubo_mat_mask.flags.i |\n\t\t\t\t      ubo_layout_mask.flags.i |\n                                      ubo_binding_mask.flags.i)) != 0) {\n      _mesa_glsl_error(loc, state,\n\t\t       \"duplicate layout qualifiers used\");\n      return false;\n   }\n\n   if (q.flags.q.prim_type) {\n      if (this->flags.q.prim_type && this->prim_type != q.prim_type) {\n\t _mesa_glsl_error(loc, state,\n\t\t\t  \"conflicting primitive type qualifiers used\");\n\t return false;\n      }\n      this->prim_type = q.prim_type;\n   }\n\n   if (q.flags.q.max_vertices) {\n      if (this->flags.q.max_vertices && this->max_vertices != q.max_vertices) {\n\t _mesa_glsl_error(loc, state,\n\t\t\t  \"geometry shader set conflicting max_vertices \"\n\t\t\t  \"(%d and %d)\", this->max_vertices, q.max_vertices);\n\t return false;\n      }\n      this->max_vertices = q.max_vertices;\n   }\n\n   if (state->stage == MESA_SHADER_GEOMETRY &&\n       state->has_explicit_attrib_stream()) {\n      if (q.flags.q.stream && q.stream >= state->ctx->Const.MaxVertexStreams) {\n         _mesa_glsl_error(loc, state,\n                          \"`stream' value is larger than MAX_VERTEX_STREAMS - 1 \"\n                          \"(%d > %d)\",\n                          q.stream, state->ctx->Const.MaxVertexStreams - 1);\n      }\n      if (this->flags.q.explicit_stream &&\n          this->stream >= state->ctx->Const.MaxVertexStreams) {\n         _mesa_glsl_error(loc, state,\n                          \"`stream' value is larger than MAX_VERTEX_STREAMS - 1 \"\n                          \"(%d > %d)\",\n                          this->stream, state->ctx->Const.MaxVertexStreams - 1);\n      }\n\n      if (!this->flags.q.explicit_stream) {\n         if (q.flags.q.stream) {\n            this->flags.q.stream = 1;\n            this->stream = q.stream;\n         } else if (!this->flags.q.stream && this->flags.q.out) {\n            \/* Assign default global stream value *\/\n            this->flags.q.stream = 1;\n            this->stream = state->out_qualifier->stream;\n         }\n      } else {\n         if (q.flags.q.explicit_stream) {\n            _mesa_glsl_error(loc, state,\n                             \"duplicate layout `stream' qualifier\");\n         }\n      }\n   }\n\n   if ((q.flags.i & ubo_mat_mask.flags.i) != 0)\n      this->flags.i &= ~ubo_mat_mask.flags.i;\n   if ((q.flags.i & ubo_layout_mask.flags.i) != 0)\n      this->flags.i &= ~ubo_layout_mask.flags.i;\n\n   for (int i = 0; i < 3; i++) {\n      if (q.flags.q.local_size & (1 << i)) {\n         if ((this->flags.q.local_size & (1 << i)) &&\n             this->local_size[i] != q.local_size[i]) {\n            _mesa_glsl_error(loc, state,\n                             \"compute shader set conflicting values for \"\n                             \"local_size_%c (%d and %d)\", 'x' + i,\n                             this->local_size[i], q.local_size[i]);\n            return false;\n         }\n         this->local_size[i] = q.local_size[i];\n      }\n   }\n\n   this->flags.i |= q.flags.i;\n\n   if (q.flags.q.explicit_location)\n      this->location = q.location;\n\n   if (q.flags.q.explicit_index)\n      this->index = q.index;\n\n   if (q.flags.q.explicit_binding)\n      this->binding = q.binding;\n\n   if (q.flags.q.explicit_offset)\n      this->offset = q.offset;\n\n   if (q.precision != ast_precision_none)\n      this->precision = q.precision;\n\n   if (q.flags.q.explicit_image_format) {\n      this->image_format = q.image_format;\n      this->image_base_type = q.image_base_type;\n   }\n\n   return true;\n}\n\nbool\nast_type_qualifier::merge_in_qualifier(YYLTYPE *loc,\n                                       _mesa_glsl_parse_state *state,\n                                       ast_type_qualifier q,\n                                       ast_node* &node)\n{\n   void *mem_ctx = state;\n   bool create_gs_ast = false;\n   bool create_cs_ast = false;\n   ast_type_qualifier valid_in_mask;\n   valid_in_mask.flags.i = 0;\n\n   switch (state->stage) {\n   case MESA_SHADER_GEOMETRY:\n      if (q.flags.q.prim_type) {\n         \/* Make sure this is a valid input primitive type. *\/\n         switch (q.prim_type) {\n         case GL_POINTS:\n         case GL_LINES:\n         case GL_LINES_ADJACENCY:\n         case GL_TRIANGLES:\n         case GL_TRIANGLES_ADJACENCY:\n            break;\n         default:\n            _mesa_glsl_error(loc, state,\n                             \"invalid geometry shader input primitive type\");\n            break;\n         }\n      }\n\n      create_gs_ast |=\n         q.flags.q.prim_type &&\n         !state->in_qualifier->flags.q.prim_type;\n\n      valid_in_mask.flags.q.prim_type = 1;\n      valid_in_mask.flags.q.invocations = 1;\n      break;\n   case MESA_SHADER_FRAGMENT:\n      if (q.flags.q.early_fragment_tests) {\n         state->early_fragment_tests = true;\n      } else {\n         _mesa_glsl_error(loc, state, \"invalid input layout qualifier\");\n      }\n      break;\n   case MESA_SHADER_COMPUTE:\n      create_cs_ast |=\n         q.flags.q.local_size != 0 &&\n         state->in_qualifier->flags.q.local_size == 0;\n\n      valid_in_mask.flags.q.local_size = 7;\n      break;\n   default:\n      _mesa_glsl_error(loc, state,\n                       \"input layout qualifiers only valid in \"\n                       \"geometry, fragment and compute shaders\");\n      break;\n   }\n\n   \/* Generate an error when invalid input layout qualifiers are used. *\/\n   if ((q.flags.i & ~valid_in_mask.flags.i) != 0) {\n      _mesa_glsl_error(loc, state,\n\t\t       \"invalid input layout qualifiers used\");\n      return false;\n   }\n\n   \/* Input layout qualifiers can be specified multiple\n    * times in separate declarations, as long as they match.\n    *\/\n   if (this->flags.q.prim_type) {\n      if (q.flags.q.prim_type &&\n          this->prim_type != q.prim_type) {\n         _mesa_glsl_error(loc, state,\n                          \"conflicting input primitive types specified\");\n      }\n   } else if (q.flags.q.prim_type) {\n      state->in_qualifier->flags.q.prim_type = 1;\n      state->in_qualifier->prim_type = q.prim_type;\n   }\n\n   if (this->flags.q.invocations &&\n       q.flags.q.invocations &&\n       this->invocations != q.invocations) {\n      _mesa_glsl_error(loc, state,\n                       \"conflicting invocations counts specified\");\n      return false;\n   } else if (q.flags.q.invocations) {\n      this->flags.q.invocations = 1;\n      this->invocations = q.invocations;\n   }\n\n   if (create_gs_ast) {\n      node = new(mem_ctx) ast_gs_input_layout(*loc, q.prim_type);\n   } else if (create_cs_ast) {\n      \/* Infer a local_size of 1 for every unspecified dimension *\/\n      unsigned local_size[3];\n      for (int i = 0; i < 3; i++) {\n         if (q.flags.q.local_size & (1 << i))\n            local_size[i] = q.local_size[i];\n         else\n            local_size[i] = 1;\n      }\n      node = new(mem_ctx) ast_cs_input_layout(*loc, local_size);\n   }\n\n   return true;\n}\n<commit_msg>glsl: fix duplicated layout qualifier detection for GS<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\nvoid\nast_type_specifier::print(void) const\n{\n   if (structure) {\n      structure->print();\n   } else {\n      printf(\"%s \", type_name);\n   }\n\n   if (array_specifier) {\n      array_specifier->print();\n   }\n}\n\nbool\nast_fully_specified_type::has_qualifiers() const\n{\n   return this->qualifier.flags.i != 0;\n}\n\nbool ast_type_qualifier::has_interpolation() const\n{\n   return this->flags.q.smooth\n          || this->flags.q.flat\n          || this->flags.q.noperspective;\n}\n\nbool\nast_type_qualifier::has_layout() const\n{\n   return this->flags.q.origin_upper_left\n          || this->flags.q.pixel_center_integer\n          || this->flags.q.depth_any\n          || this->flags.q.depth_greater\n          || this->flags.q.depth_less\n          || this->flags.q.depth_unchanged\n          || this->flags.q.std140\n          || this->flags.q.shared\n          || this->flags.q.column_major\n          || this->flags.q.row_major\n          || this->flags.q.packed\n          || this->flags.q.explicit_location\n          || this->flags.q.explicit_index\n          || this->flags.q.explicit_binding\n          || this->flags.q.explicit_offset;\n}\n\nbool\nast_type_qualifier::has_storage() const\n{\n   return this->flags.q.constant\n          || this->flags.q.attribute\n          || this->flags.q.varying\n          || this->flags.q.in\n          || this->flags.q.out\n          || this->flags.q.uniform;\n}\n\nbool\nast_type_qualifier::has_auxiliary_storage() const\n{\n   return this->flags.q.centroid\n          || this->flags.q.sample;\n}\n\nconst char*\nast_type_qualifier::interpolation_string() const\n{\n   if (this->flags.q.smooth)\n      return \"smooth\";\n   else if (this->flags.q.flat)\n      return \"flat\";\n   else if (this->flags.q.noperspective)\n      return \"noperspective\";\n   else\n      return NULL;\n}\n\nbool\nast_type_qualifier::merge_qualifier(YYLTYPE *loc,\n\t\t\t\t    _mesa_glsl_parse_state *state,\n\t\t\t\t    ast_type_qualifier q)\n{\n   ast_type_qualifier ubo_mat_mask;\n   ubo_mat_mask.flags.i = 0;\n   ubo_mat_mask.flags.q.row_major = 1;\n   ubo_mat_mask.flags.q.column_major = 1;\n\n   ast_type_qualifier ubo_layout_mask;\n   ubo_layout_mask.flags.i = 0;\n   ubo_layout_mask.flags.q.std140 = 1;\n   ubo_layout_mask.flags.q.packed = 1;\n   ubo_layout_mask.flags.q.shared = 1;\n\n   ast_type_qualifier ubo_binding_mask;\n   ubo_binding_mask.flags.i = 0;\n   ubo_binding_mask.flags.q.explicit_binding = 1;\n   ubo_binding_mask.flags.q.explicit_offset = 1;\n\n   ast_type_qualifier stream_layout_mask;\n   stream_layout_mask.flags.i = 0;\n   stream_layout_mask.flags.q.stream = 1;\n\n   \/* Uniform block layout qualifiers get to overwrite each\n    * other (rightmost having priority), while all other\n    * qualifiers currently don't allow duplicates.\n    *\/\n   ast_type_qualifier allowed_duplicates_mask;\n   allowed_duplicates_mask.flags.i =\n      ubo_mat_mask.flags.i |\n      ubo_layout_mask.flags.i |\n      ubo_binding_mask.flags.i;\n\n   \/* Geometry shaders can have several layout qualifiers\n    * assigning different stream values.\n    *\/\n   if (state->stage == MESA_SHADER_GEOMETRY)\n      allowed_duplicates_mask.flags.i |=\n         stream_layout_mask.flags.i;\n\n   if ((this->flags.i & q.flags.i & ~allowed_duplicates_mask.flags.i) != 0) {\n      _mesa_glsl_error(loc, state,\n\t\t       \"duplicate layout qualifiers used\");\n      return false;\n   }\n\n   if (q.flags.q.prim_type) {\n      if (this->flags.q.prim_type && this->prim_type != q.prim_type) {\n\t _mesa_glsl_error(loc, state,\n\t\t\t  \"conflicting primitive type qualifiers used\");\n\t return false;\n      }\n      this->prim_type = q.prim_type;\n   }\n\n   if (q.flags.q.max_vertices) {\n      if (this->flags.q.max_vertices && this->max_vertices != q.max_vertices) {\n\t _mesa_glsl_error(loc, state,\n\t\t\t  \"geometry shader set conflicting max_vertices \"\n\t\t\t  \"(%d and %d)\", this->max_vertices, q.max_vertices);\n\t return false;\n      }\n      this->max_vertices = q.max_vertices;\n   }\n\n   if (state->stage == MESA_SHADER_GEOMETRY &&\n       state->has_explicit_attrib_stream()) {\n      if (q.flags.q.stream && q.stream >= state->ctx->Const.MaxVertexStreams) {\n         _mesa_glsl_error(loc, state,\n                          \"`stream' value is larger than MAX_VERTEX_STREAMS - 1 \"\n                          \"(%d > %d)\",\n                          q.stream, state->ctx->Const.MaxVertexStreams - 1);\n      }\n      if (this->flags.q.explicit_stream &&\n          this->stream >= state->ctx->Const.MaxVertexStreams) {\n         _mesa_glsl_error(loc, state,\n                          \"`stream' value is larger than MAX_VERTEX_STREAMS - 1 \"\n                          \"(%d > %d)\",\n                          this->stream, state->ctx->Const.MaxVertexStreams - 1);\n      }\n\n      if (!this->flags.q.explicit_stream) {\n         if (q.flags.q.stream) {\n            this->flags.q.stream = 1;\n            this->stream = q.stream;\n         } else if (!this->flags.q.stream && this->flags.q.out) {\n            \/* Assign default global stream value *\/\n            this->flags.q.stream = 1;\n            this->stream = state->out_qualifier->stream;\n         }\n      } else {\n         if (q.flags.q.explicit_stream) {\n            _mesa_glsl_error(loc, state,\n                             \"duplicate layout `stream' qualifier\");\n         }\n      }\n   }\n\n   if ((q.flags.i & ubo_mat_mask.flags.i) != 0)\n      this->flags.i &= ~ubo_mat_mask.flags.i;\n   if ((q.flags.i & ubo_layout_mask.flags.i) != 0)\n      this->flags.i &= ~ubo_layout_mask.flags.i;\n\n   for (int i = 0; i < 3; i++) {\n      if (q.flags.q.local_size & (1 << i)) {\n         if ((this->flags.q.local_size & (1 << i)) &&\n             this->local_size[i] != q.local_size[i]) {\n            _mesa_glsl_error(loc, state,\n                             \"compute shader set conflicting values for \"\n                             \"local_size_%c (%d and %d)\", 'x' + i,\n                             this->local_size[i], q.local_size[i]);\n            return false;\n         }\n         this->local_size[i] = q.local_size[i];\n      }\n   }\n\n   this->flags.i |= q.flags.i;\n\n   if (q.flags.q.explicit_location)\n      this->location = q.location;\n\n   if (q.flags.q.explicit_index)\n      this->index = q.index;\n\n   if (q.flags.q.explicit_binding)\n      this->binding = q.binding;\n\n   if (q.flags.q.explicit_offset)\n      this->offset = q.offset;\n\n   if (q.precision != ast_precision_none)\n      this->precision = q.precision;\n\n   if (q.flags.q.explicit_image_format) {\n      this->image_format = q.image_format;\n      this->image_base_type = q.image_base_type;\n   }\n\n   return true;\n}\n\nbool\nast_type_qualifier::merge_in_qualifier(YYLTYPE *loc,\n                                       _mesa_glsl_parse_state *state,\n                                       ast_type_qualifier q,\n                                       ast_node* &node)\n{\n   void *mem_ctx = state;\n   bool create_gs_ast = false;\n   bool create_cs_ast = false;\n   ast_type_qualifier valid_in_mask;\n   valid_in_mask.flags.i = 0;\n\n   switch (state->stage) {\n   case MESA_SHADER_GEOMETRY:\n      if (q.flags.q.prim_type) {\n         \/* Make sure this is a valid input primitive type. *\/\n         switch (q.prim_type) {\n         case GL_POINTS:\n         case GL_LINES:\n         case GL_LINES_ADJACENCY:\n         case GL_TRIANGLES:\n         case GL_TRIANGLES_ADJACENCY:\n            break;\n         default:\n            _mesa_glsl_error(loc, state,\n                             \"invalid geometry shader input primitive type\");\n            break;\n         }\n      }\n\n      create_gs_ast |=\n         q.flags.q.prim_type &&\n         !state->in_qualifier->flags.q.prim_type;\n\n      valid_in_mask.flags.q.prim_type = 1;\n      valid_in_mask.flags.q.invocations = 1;\n      break;\n   case MESA_SHADER_FRAGMENT:\n      if (q.flags.q.early_fragment_tests) {\n         state->early_fragment_tests = true;\n      } else {\n         _mesa_glsl_error(loc, state, \"invalid input layout qualifier\");\n      }\n      break;\n   case MESA_SHADER_COMPUTE:\n      create_cs_ast |=\n         q.flags.q.local_size != 0 &&\n         state->in_qualifier->flags.q.local_size == 0;\n\n      valid_in_mask.flags.q.local_size = 7;\n      break;\n   default:\n      _mesa_glsl_error(loc, state,\n                       \"input layout qualifiers only valid in \"\n                       \"geometry, fragment and compute shaders\");\n      break;\n   }\n\n   \/* Generate an error when invalid input layout qualifiers are used. *\/\n   if ((q.flags.i & ~valid_in_mask.flags.i) != 0) {\n      _mesa_glsl_error(loc, state,\n\t\t       \"invalid input layout qualifiers used\");\n      return false;\n   }\n\n   \/* Input layout qualifiers can be specified multiple\n    * times in separate declarations, as long as they match.\n    *\/\n   if (this->flags.q.prim_type) {\n      if (q.flags.q.prim_type &&\n          this->prim_type != q.prim_type) {\n         _mesa_glsl_error(loc, state,\n                          \"conflicting input primitive types specified\");\n      }\n   } else if (q.flags.q.prim_type) {\n      state->in_qualifier->flags.q.prim_type = 1;\n      state->in_qualifier->prim_type = q.prim_type;\n   }\n\n   if (this->flags.q.invocations &&\n       q.flags.q.invocations &&\n       this->invocations != q.invocations) {\n      _mesa_glsl_error(loc, state,\n                       \"conflicting invocations counts specified\");\n      return false;\n   } else if (q.flags.q.invocations) {\n      this->flags.q.invocations = 1;\n      this->invocations = q.invocations;\n   }\n\n   if (create_gs_ast) {\n      node = new(mem_ctx) ast_gs_input_layout(*loc, q.prim_type);\n   } else if (create_cs_ast) {\n      \/* Infer a local_size of 1 for every unspecified dimension *\/\n      unsigned local_size[3];\n      for (int i = 0; i < 3; i++) {\n         if (q.flags.q.local_size & (1 << i))\n            local_size[i] = q.local_size[i];\n         else\n            local_size[i] = 1;\n      }\n      node = new(mem_ctx) ast_cs_input_layout(*loc, local_size);\n   }\n\n   return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**************************************************************************\n**\n** This file is part of Qt Creator\n**\n** Copyright (c) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n**\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** Commercial Usage\n**\n** Licensees holding valid Qt Commercial licenses may use this file in\n** accordance with the Qt Commercial License Agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Nokia.\n**\n** GNU Lesser General Public License Usage\n**\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at http:\/\/qt.nokia.com\/contact.\n**\n**************************************************************************\/\n\n#include \"outputparser_test.h\"\n\n#if defined(WITH_TESTS)\n\n#include <QtTest>\n\nusing namespace ProjectExplorer;\n\nOutputParserTester::OutputParserTester() :\n        m_debug(false)\n{\n}\n\nOutputParserTester::~OutputParserTester()\n{\n    if (childParser())\n        childParser()->takeOutputParserChain();\n}\n\n\/\/ test methods:\nvoid OutputParserTester::testParsing(const QString &lines,\n                                     Channel inputChannel,\n                                     QList<Task> tasks,\n                                     const QString &childStdOutLines,\n                                     const QString &childStdErrLines,\n                                     const QString &outputLines)\n{\n    reset();\n    Q_ASSERT(childParser());\n\n    QStringList inputLines = lines.split(QChar('\\n'));\n    foreach (const QString &input, inputLines) {\n        if (inputChannel == STDOUT)\n            childParser()->stdOutput(input);\n        else\n            childParser()->stdError(input);\n    }\n\n    QCOMPARE(m_receivedOutput, outputLines);\n    QCOMPARE(m_receivedStdErrChildLine, childStdErrLines);\n    QCOMPARE(m_receivedStdOutChildLine, childStdOutLines);\n    QCOMPARE(m_receivedTasks.size(), tasks.size());\n    if (m_receivedTasks.size() == tasks.size()) {\n        for(int i = 0; i < tasks.size(); ++i) {\n            QCOMPARE(m_receivedTasks.at(i).category, tasks.at(i).category);\n            QCOMPARE(m_receivedTasks.at(i).description, tasks.at(i).description);\n            QCOMPARE(m_receivedTasks.at(i).file, tasks.at(i).file);\n            QCOMPARE(m_receivedTasks.at(i).line, tasks.at(i).line);\n            QCOMPARE(m_receivedTasks.at(i).type, tasks.at(i).type);\n        }\n    }\n}\n\nvoid OutputParserTester::testTaskMangling(const Task input,\n                                          const Task output)\n{\n    reset();\n    childParser()->taskAdded(input);\n\n    QVERIFY(m_receivedOutput.isNull());\n    QVERIFY(m_receivedStdErrChildLine.isNull());\n    QVERIFY(m_receivedStdOutChildLine.isNull());\n    QVERIFY(m_receivedTasks.size() == 1);\n    if (m_receivedTasks.size() == 1) {\n        QCOMPARE(m_receivedTasks.at(0).category, output.category);\n        QCOMPARE(m_receivedTasks.at(0).description, output.description);\n        QCOMPARE(m_receivedTasks.at(0).file, output.file);\n        QCOMPARE(m_receivedTasks.at(0).line, output.line);\n        QCOMPARE(m_receivedTasks.at(0).type, output.type);\n    }\n}\n\nvoid OutputParserTester::testOutputMangling(const QString &input,\n                                            const QString &output)\n{\n    reset();\n\n    QTextCharFormat textCharFormat;\n    childParser()->outputAdded(input, textCharFormat);\n\n    QCOMPARE(m_receivedOutput, output);\n    QVERIFY(m_receivedStdErrChildLine.isNull());\n    QVERIFY(m_receivedStdOutChildLine.isNull());\n    QVERIFY(m_receivedTasks.isEmpty());\n}\n\nvoid OutputParserTester::setDebugEnabled(bool debug)\n{\n    m_debug = debug;\n}\n\nvoid OutputParserTester::stdOutput(const QString &line)\n{\n    if (!m_receivedStdOutChildLine.isEmpty())\n        m_receivedStdOutChildLine.append(QChar('\\n'));\n    m_receivedStdOutChildLine.append(line);\n}\n\nvoid OutputParserTester::stdError(const QString &line)\n{\n    if (!m_receivedStdErrChildLine.isEmpty())\n        m_receivedStdErrChildLine.append(QChar('\\n'));\n    m_receivedStdErrChildLine.append(line);\n}\n\nvoid OutputParserTester::appendOutputParser(IOutputParser *parser)\n{\n    Q_ASSERT(!childParser());\n\n    IOutputParser::appendOutputParser(parser);\n    parser->appendOutputParser(this);\n}\n\nvoid OutputParserTester::outputAdded(const QString &line, const QTextCharFormat &textCharFormat)\n{\n    if (!m_receivedOutput.isEmpty())\n        m_receivedOutput.append(QChar('\\n'));\n    m_receivedOutput.append(line);\n}\n\nvoid OutputParserTester::taskAdded(const ProjectExplorer::Task &task)\n{\n    m_receivedTasks.append(task);\n}\n\nvoid OutputParserTester::reset()\n{\n    m_receivedStdErrChildLine = QString();\n    m_receivedStdOutChildLine = QString();\n    m_receivedTasks.clear();\n    m_receivedOutput = QString();\n}\n\n#endif\n<commit_msg>Fix unused parameter warning<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 \"outputparser_test.h\"\n\n#if defined(WITH_TESTS)\n\n#include <QtTest>\n\nusing namespace ProjectExplorer;\n\nOutputParserTester::OutputParserTester() :\n        m_debug(false)\n{\n}\n\nOutputParserTester::~OutputParserTester()\n{\n    if (childParser())\n        childParser()->takeOutputParserChain();\n}\n\n\/\/ test methods:\nvoid OutputParserTester::testParsing(const QString &lines,\n                                     Channel inputChannel,\n                                     QList<Task> tasks,\n                                     const QString &childStdOutLines,\n                                     const QString &childStdErrLines,\n                                     const QString &outputLines)\n{\n    reset();\n    Q_ASSERT(childParser());\n\n    QStringList inputLines = lines.split(QChar('\\n'));\n    foreach (const QString &input, inputLines) {\n        if (inputChannel == STDOUT)\n            childParser()->stdOutput(input);\n        else\n            childParser()->stdError(input);\n    }\n\n    QCOMPARE(m_receivedOutput, outputLines);\n    QCOMPARE(m_receivedStdErrChildLine, childStdErrLines);\n    QCOMPARE(m_receivedStdOutChildLine, childStdOutLines);\n    QCOMPARE(m_receivedTasks.size(), tasks.size());\n    if (m_receivedTasks.size() == tasks.size()) {\n        for(int i = 0; i < tasks.size(); ++i) {\n            QCOMPARE(m_receivedTasks.at(i).category, tasks.at(i).category);\n            QCOMPARE(m_receivedTasks.at(i).description, tasks.at(i).description);\n            QCOMPARE(m_receivedTasks.at(i).file, tasks.at(i).file);\n            QCOMPARE(m_receivedTasks.at(i).line, tasks.at(i).line);\n            QCOMPARE(m_receivedTasks.at(i).type, tasks.at(i).type);\n        }\n    }\n}\n\nvoid OutputParserTester::testTaskMangling(const Task input,\n                                          const Task output)\n{\n    reset();\n    childParser()->taskAdded(input);\n\n    QVERIFY(m_receivedOutput.isNull());\n    QVERIFY(m_receivedStdErrChildLine.isNull());\n    QVERIFY(m_receivedStdOutChildLine.isNull());\n    QVERIFY(m_receivedTasks.size() == 1);\n    if (m_receivedTasks.size() == 1) {\n        QCOMPARE(m_receivedTasks.at(0).category, output.category);\n        QCOMPARE(m_receivedTasks.at(0).description, output.description);\n        QCOMPARE(m_receivedTasks.at(0).file, output.file);\n        QCOMPARE(m_receivedTasks.at(0).line, output.line);\n        QCOMPARE(m_receivedTasks.at(0).type, output.type);\n    }\n}\n\nvoid OutputParserTester::testOutputMangling(const QString &input,\n                                            const QString &output)\n{\n    reset();\n\n    QTextCharFormat textCharFormat;\n    childParser()->outputAdded(input, textCharFormat);\n\n    QCOMPARE(m_receivedOutput, output);\n    QVERIFY(m_receivedStdErrChildLine.isNull());\n    QVERIFY(m_receivedStdOutChildLine.isNull());\n    QVERIFY(m_receivedTasks.isEmpty());\n}\n\nvoid OutputParserTester::setDebugEnabled(bool debug)\n{\n    m_debug = debug;\n}\n\nvoid OutputParserTester::stdOutput(const QString &line)\n{\n    if (!m_receivedStdOutChildLine.isEmpty())\n        m_receivedStdOutChildLine.append(QChar('\\n'));\n    m_receivedStdOutChildLine.append(line);\n}\n\nvoid OutputParserTester::stdError(const QString &line)\n{\n    if (!m_receivedStdErrChildLine.isEmpty())\n        m_receivedStdErrChildLine.append(QChar('\\n'));\n    m_receivedStdErrChildLine.append(line);\n}\n\nvoid OutputParserTester::appendOutputParser(IOutputParser *parser)\n{\n    Q_ASSERT(!childParser());\n\n    IOutputParser::appendOutputParser(parser);\n    parser->appendOutputParser(this);\n}\n\nvoid OutputParserTester::outputAdded(const QString &line, const QTextCharFormat &textCharFormat)\n{\n    Q_UNUSED(textCharFormat);\n    if (!m_receivedOutput.isEmpty())\n        m_receivedOutput.append(QChar('\\n'));\n    m_receivedOutput.append(line);\n}\n\nvoid OutputParserTester::taskAdded(const ProjectExplorer::Task &task)\n{\n    m_receivedTasks.append(task);\n}\n\nvoid OutputParserTester::reset()\n{\n    m_receivedStdErrChildLine = QString();\n    m_receivedStdOutChildLine = QString();\n    m_receivedTasks.clear();\n    m_receivedOutput = QString();\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \".\/mesh.h\"\n#include <Eigen\/Geometry>\n#include <QDebug>\n#include <QLoggingCategory>\n#include <string>\n#include <vector>\n#include \".\/gl.h\"\n#include \".\/shader_program.h\"\n#include \".\/texture_manager.h\"\n#include \".\/shader_manager.h\"\n#include \"..\/utils\/path_helper.h\"\n#include \"..\/eigen_qdebug.h\"\n\nnamespace Graphics\n{\n\nQLoggingCategory meshChan(\"Graphics.Mesh\");\n\nMesh::Mesh(std::string filename, aiMesh *mesh, aiMaterial *material)\n  : filename(filename)\n{\n  qCInfo(meshChan) << \"Loading \" << mesh->mName.C_Str();\n\n  for (unsigned int i = 0; i < material->mNumProperties; ++i)\n  {\n    auto property = material->mProperties[i];\n    qCDebug(meshChan) << property->mKey.C_Str() << \": \" << property->mType\n                      << \"|\" << property->mDataLength;\n  }\n\n  phongMaterial.ambientColor =\n      loadVector4FromMaterial(\"$clr.ambient\", material);\n  phongMaterial.diffuseColor =\n      loadVector4FromMaterial(\"$clr.diffuse\", material);\n  phongMaterial.specularColor =\n      loadVector4FromMaterial(\"$clr.specular\", material);\n  phongMaterial.shininess = loadFloatFromMaterial(\"$mat.shininess\", material);\n\n  qCDebug(meshChan) << \"diffuse: \" << phongMaterial.diffuseColor\n                    << \" ambient: \" << phongMaterial.ambientColor\n                    << \" specular: \" << phongMaterial.specularColor\n                    << \" shininess: \" << phongMaterial.shininess;\n\n  unsigned int indicesPerFace = mesh->mFaces[0].mNumIndices;\n  indexCount = indicesPerFace * mesh->mNumFaces;\n  assert(indexCount > 0);\n\n  indexData = new unsigned int[indexCount];\n  auto indexInsertPoint = indexData;\n  for (unsigned int i = 0; i < mesh->mNumFaces; i++)\n  {\n    const aiFace &face = mesh->mFaces[i];\n    assert(face.mNumIndices == indicesPerFace);\n    memcpy(indexInsertPoint, face.mIndices,\n           sizeof(unsigned int) * face.mNumIndices);\n    indexInsertPoint += face.mNumIndices;\n  }\n\n  vertexCount = mesh->mNumVertices;\n  positionData = new float[mesh->mNumVertices * 3];\n  memcpy(positionData, mesh->mVertices, sizeof(float) * 3 * mesh->mNumVertices);\n  normalData = new float[mesh->mNumVertices * 3];\n  if (mesh->mNormals)\n  {\n    memcpy(normalData, mesh->mNormals, sizeof(float) * 3 * mesh->mNumVertices);\n  }\n  else\n  {\n    qCWarning(meshChan) << \"No normals in\" << mesh->mName.C_Str();\n  }\n  textureCoordinateData = new float[mesh->mNumVertices * 2];\n\n  hasTexture = mesh->GetNumUVChannels() > 0;\n  if (hasTexture)\n  {\n    aiString texturePath;\n    if (material->GetTexture(aiTextureType_DIFFUSE, 0, &texturePath, nullptr,\n                             nullptr, nullptr, nullptr, nullptr) == AI_SUCCESS)\n    {\n      std::string textureName(texturePath.C_Str());\n      textureFilePath = \"assets\/\" + textureName;\n      qCDebug(meshChan) << \"texture\" << textureFilePath.c_str();\n    }\n    else\n    {\n      qCWarning(meshChan) << \"Could not load texture from material\";\n      hasTexture = false;\n    }\n  }\n\n  if (hasTexture)\n  {\n    for (int i = 0; i < vertexCount; ++i)\n    {\n      textureCoordinateData[i * 2] = mesh->mTextureCoords[0][i].x;\n      textureCoordinateData[i * 2 + 1] = -mesh->mTextureCoords[0][i].y;\n    }\n  }\n  else\n  {\n    for (int i = 0; i < vertexCount; ++i)\n    {\n      textureCoordinateData[i * 2] = 0.0f;\n      textureCoordinateData[i * 2 + 1] = 0.0f;\n    }\n  }\n\n  createObb();\n}\n\nMesh::~Mesh()\n{\n  qCInfo(meshChan) << \"Destructor of mesh\" << filename.c_str();\n  delete[] indexData;\n  delete[] positionData;\n  delete[] normalData;\n  delete[] textureCoordinateData;\n}\n\nvoid Mesh::render(Gl *gl, std::shared_ptr<Managers> managers,\n                  const RenderData &renderData)\n{\n  if (!hasTexture)\n  {\n    Eigen::Matrix4f modelViewMatrix =\n        renderData.viewMatrix * objectData.modelMatrix;\n    normalMatrix = modelViewMatrix.inverse().transpose();\n  }\n\n  Renderable::render(gl, managers, renderData);\n}\n\nvoid Mesh::createObb()\n{\n  Eigen::MatrixXf data(3, vertexCount);\n  for (int i = 0; i < vertexCount; ++i)\n    data.col(i) = Eigen::Vector3f(positionData[i * 3], positionData[i * 3 + 1],\n                                  positionData[i * 3 + 2]);\n\n  obb = Math::Obb(data);\n}\n\nObjectData Mesh::createBuffers(std::shared_ptr<ObjectManager> objectManager,\n                               std::shared_ptr<TextureManager> textureManager,\n                               std::shared_ptr<ShaderManager> shaderManager)\n{\n  std::vector<float> pos(positionData, positionData + vertexCount * 3);\n  std::vector<float> nor(normalData, normalData + vertexCount * 3);\n  std::vector<float> tex(textureCoordinateData,\n                         textureCoordinateData + vertexCount * 2);\n  std::vector<float> col(vertexCount * 4, 1.0f);\n  std::vector<unsigned int> idx(indexData, indexData + indexCount);\n\n  int shaderProgramId = hasTexture\n                            ? shaderManager->addShader(\":\/shader\/pass.vert\",\n                                                       \":\/shader\/texture.frag\")\n                            : shaderManager->addShader(\":\/shader\/phong.vert\",\n                                                       \":\/shader\/phong.frag\");\n\n  ObjectData objectData =\n      objectManager->addObject(pos, nor, col, tex, idx, shaderProgramId);\n\n  if (hasTexture)\n  {\n    int textureId = textureManager->addTexture(\n        absolutePathOfProjectRelativePath(std::string(textureFilePath)));\n    objectData.setCustomBufferFor<Graphics::TextureAddress>(\n        1, [textureManager, textureId]() {\n          return textureManager->getAddressFor(textureId);\n        });\n  }\n  else\n  {\n    objectData.setCustomBufferFor(1, &this->phongMaterial);\n    objectData.setCustomBufferFor(2, &this->normalMatrix);\n  }\n\n  return objectData;\n}\n\nEigen::Vector4f Mesh::loadVector4FromMaterial(const char *key,\n                                              aiMaterial *material)\n{\n  float values[4];\n  unsigned int size = 4;\n  if (material->Get(key, 0, 0, values, &size) != 0)\n  {\n    qCritical() << \"Could not load \" << key << \" from material\";\n    exit(1);\n  }\n\n  return Eigen::Vector4f(values[0], values[1], values[2], values[3]);\n}\n\nfloat Mesh::loadFloatFromMaterial(const char *key, aiMaterial *material)\n{\n  float result;\n  if (material->Get(key, 0, 0, result) != 0)\n  {\n    qCritical() << \"Could not load \" << key << \" from material\";\n    exit(1);\n  }\n\n  return result;\n}\n\n}  \/\/ namespace Graphics\n\n<commit_msg>Add support for texture in a subfolder.<commit_after>#include \".\/mesh.h\"\n#include <Eigen\/Geometry>\n#include <boost\/filesystem.hpp>\n#include <QDebug>\n#include <QLoggingCategory>\n#include <string>\n#include <vector>\n#include \".\/gl.h\"\n#include \".\/shader_program.h\"\n#include \".\/texture_manager.h\"\n#include \".\/shader_manager.h\"\n#include \"..\/utils\/path_helper.h\"\n#include \"..\/eigen_qdebug.h\"\n\nnamespace Graphics\n{\n\nQLoggingCategory meshChan(\"Graphics.Mesh\");\n\nMesh::Mesh(std::string filename, aiMesh *mesh, aiMaterial *material)\n  : filename(filename)\n{\n  qCInfo(meshChan) << \"Loading \" << mesh->mName.C_Str();\n\n  for (unsigned int i = 0; i < material->mNumProperties; ++i)\n  {\n    auto property = material->mProperties[i];\n    qCDebug(meshChan) << property->mKey.C_Str() << \": \" << property->mType\n                      << \"|\" << property->mDataLength;\n  }\n\n  phongMaterial.ambientColor =\n      loadVector4FromMaterial(\"$clr.ambient\", material);\n  phongMaterial.diffuseColor =\n      loadVector4FromMaterial(\"$clr.diffuse\", material);\n  phongMaterial.specularColor =\n      loadVector4FromMaterial(\"$clr.specular\", material);\n  phongMaterial.shininess = loadFloatFromMaterial(\"$mat.shininess\", material);\n\n  qCDebug(meshChan) << \"diffuse: \" << phongMaterial.diffuseColor\n                    << \" ambient: \" << phongMaterial.ambientColor\n                    << \" specular: \" << phongMaterial.specularColor\n                    << \" shininess: \" << phongMaterial.shininess;\n\n  unsigned int indicesPerFace = mesh->mFaces[0].mNumIndices;\n  indexCount = indicesPerFace * mesh->mNumFaces;\n  assert(indexCount > 0);\n\n  indexData = new unsigned int[indexCount];\n  auto indexInsertPoint = indexData;\n  for (unsigned int i = 0; i < mesh->mNumFaces; i++)\n  {\n    const aiFace &face = mesh->mFaces[i];\n    assert(face.mNumIndices == indicesPerFace);\n    memcpy(indexInsertPoint, face.mIndices,\n           sizeof(unsigned int) * face.mNumIndices);\n    indexInsertPoint += face.mNumIndices;\n  }\n\n  vertexCount = mesh->mNumVertices;\n  positionData = new float[mesh->mNumVertices * 3];\n  memcpy(positionData, mesh->mVertices, sizeof(float) * 3 * mesh->mNumVertices);\n  normalData = new float[mesh->mNumVertices * 3];\n  if (mesh->mNormals)\n  {\n    memcpy(normalData, mesh->mNormals, sizeof(float) * 3 * mesh->mNumVertices);\n  }\n  else\n  {\n    qCWarning(meshChan) << \"No normals in\" << mesh->mName.C_Str();\n  }\n  textureCoordinateData = new float[mesh->mNumVertices * 2];\n\n  hasTexture = mesh->GetNumUVChannels() > 0;\n  if (hasTexture)\n  {\n    aiString texturePath;\n    if (material->GetTexture(aiTextureType_DIFFUSE, 0, &texturePath, nullptr,\n                             nullptr, nullptr, nullptr, nullptr) == AI_SUCCESS)\n    {\n      std::string textureName =\n          replaceBackslashesWithSlashes(texturePath.C_Str());\n      auto baseFolder = boost::filesystem::path{ filename }.parent_path();\n      auto texturePath = baseFolder \/ textureName;\n      textureFilePath = texturePath.string();\n      qCDebug(meshChan) << \"texture\" << textureFilePath.c_str();\n    }\n    else\n    {\n      qCWarning(meshChan) << \"Could not load texture from material\";\n      hasTexture = false;\n    }\n  }\n\n  if (hasTexture)\n  {\n    for (int i = 0; i < vertexCount; ++i)\n    {\n      textureCoordinateData[i * 2] = mesh->mTextureCoords[0][i].x;\n      textureCoordinateData[i * 2 + 1] = -mesh->mTextureCoords[0][i].y;\n    }\n  }\n  else\n  {\n    for (int i = 0; i < vertexCount; ++i)\n    {\n      textureCoordinateData[i * 2] = 0.0f;\n      textureCoordinateData[i * 2 + 1] = 0.0f;\n    }\n  }\n\n  createObb();\n}\n\nMesh::~Mesh()\n{\n  qCInfo(meshChan) << \"Destructor of mesh\" << filename.c_str();\n  delete[] indexData;\n  delete[] positionData;\n  delete[] normalData;\n  delete[] textureCoordinateData;\n}\n\nvoid Mesh::render(Gl *gl, std::shared_ptr<Managers> managers,\n                  const RenderData &renderData)\n{\n  if (!hasTexture)\n  {\n    Eigen::Matrix4f modelViewMatrix =\n        renderData.viewMatrix * objectData.modelMatrix;\n    normalMatrix = modelViewMatrix.inverse().transpose();\n  }\n\n  Renderable::render(gl, managers, renderData);\n}\n\nvoid Mesh::createObb()\n{\n  Eigen::MatrixXf data(3, vertexCount);\n  for (int i = 0; i < vertexCount; ++i)\n    data.col(i) = Eigen::Vector3f(positionData[i * 3], positionData[i * 3 + 1],\n                                  positionData[i * 3 + 2]);\n\n  obb = Math::Obb(data);\n}\n\nObjectData Mesh::createBuffers(std::shared_ptr<ObjectManager> objectManager,\n                               std::shared_ptr<TextureManager> textureManager,\n                               std::shared_ptr<ShaderManager> shaderManager)\n{\n  std::vector<float> pos(positionData, positionData + vertexCount * 3);\n  std::vector<float> nor(normalData, normalData + vertexCount * 3);\n  std::vector<float> tex(textureCoordinateData,\n                         textureCoordinateData + vertexCount * 2);\n  std::vector<float> col(vertexCount * 4, 1.0f);\n  std::vector<unsigned int> idx(indexData, indexData + indexCount);\n\n  int shaderProgramId = hasTexture\n                            ? shaderManager->addShader(\":\/shader\/pass.vert\",\n                                                       \":\/shader\/texture.frag\")\n                            : shaderManager->addShader(\":\/shader\/phong.vert\",\n                                                       \":\/shader\/phong.frag\");\n\n  ObjectData objectData =\n      objectManager->addObject(pos, nor, col, tex, idx, shaderProgramId);\n\n  if (hasTexture)\n  {\n    int textureId = textureManager->addTexture(\n        absolutePathOfProjectRelativePath(std::string(textureFilePath)));\n    objectData.setCustomBufferFor<Graphics::TextureAddress>(\n        1, [textureManager, textureId]() {\n          return textureManager->getAddressFor(textureId);\n        });\n  }\n  else\n  {\n    objectData.setCustomBufferFor(1, &this->phongMaterial);\n    objectData.setCustomBufferFor(2, &this->normalMatrix);\n  }\n\n  return objectData;\n}\n\nEigen::Vector4f Mesh::loadVector4FromMaterial(const char *key,\n                                              aiMaterial *material)\n{\n  float values[4];\n  unsigned int size = 4;\n  if (material->Get(key, 0, 0, values, &size) != 0)\n  {\n    qCritical() << \"Could not load \" << key << \" from material\";\n    exit(1);\n  }\n\n  return Eigen::Vector4f(values[0], values[1], values[2], values[3]);\n}\n\nfloat Mesh::loadFloatFromMaterial(const char *key, aiMaterial *material)\n{\n  float result;\n  if (material->Get(key, 0, 0, result) != 0)\n  {\n    qCritical() << \"Could not load \" << key << \" from material\";\n    exit(1);\n  }\n\n  return result;\n}\n\n}  \/\/ namespace Graphics\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\n * GLBall.cpp\r\n *\r\n *  Created on: Oct 12, 2015\r\n *      Author: Ian Shef\r\n *\/\r\n\r\n#include \"GLBall.h\"\r\n\r\nGLBall::GLBall(ST7735 *st7735)\r\n\t: frameTime (10)\r\n\t, radius (4)\r\n\t, xCurrent (radius)\r\n\t, yCurrent (radius)\r\n\t, ballColor (0xFFFF)\r\n\t, trailColor (ballColor)\r\n\t, xVel (1)\r\n\t, yVel (xVel)\r\n\t, lcd (st7735)\r\n  {}\r\n\r\nvoid        GLBall::begin() {\r\n\tthis->previousTime = millis() ;\r\n}\r\n\r\nboolean        GLBall::update() {\r\n\tboolean returnValue = false ;\r\n\tcurrentTime = millis() ;\r\n\tif ( (currentTime - previousTime) >= frameTime) {\r\n\t\treturnValue = true ;\r\n\t\tpreviousTime = currentTime ;\r\n\t\txPrevious = xCurrent ;\r\n\t\tyPrevious = yCurrent ;\r\n\t\txCurrent += xVel ;\r\n\t\tyCurrent += yVel ;\r\n\t\tif (xVel>0) {\r\n\t\t\tif ((xCurrent+radius)>=lcd->width) {\r\n\t\t\t\txVel = -xVel ;\r\n\t\t\t\txCurrent += xVel ;\r\n\t\t\t}\r\n\t\t} else if (xVel<0) {\r\n\t\t\tif ((xCurrent-radius) <=0) {\r\n\t\t\t\txVel = -xVel ;\r\n\t\t\t\txCurrent += xVel ;\r\n\t\t\t}\r\n\t\t}\r\n\t\tif (yVel>0) {\r\n\t\t\tif ((yCurrent+radius)>=lcd->height) {\r\n\t\t\t\tyVel = -yVel ;\r\n\t\t\t\tyCurrent += yVel ;\r\n\t\t\t}\r\n\t\t} else if (yVel<0) {\r\n\t\t\tif ((yCurrent-radius) <=0) {\r\n\t\t\t\tyVel = -yVel ;\r\n\t\t\t\tyCurrent += yVel ;\r\n\t\t\t}\r\n\t\t}\r\n\t\tlcd->fillCircle(xPrevious, yPrevious, radius, trailColor) ;\r\n\t\tlcd->fillCircle(xCurrent, yCurrent, radius, ballColor) ;\r\n\t}\r\n\treturn returnValue ;\r\n}\r\n\r\nunsigned int  GLBall::getBallColor() const {return ballColor;}\r\nunsigned long GLBall::getFrameTime() const {return frameTime;}\r\nunsigned int  GLBall::getRadius()    const {return radius;}\r\nunsigned int  GLBall::getTrailColor()const {return trailColor;}\r\nunsigned int  GLBall::getXCurrent()  const {return xCurrent;}\r\nunsigned int  GLBall::getXPrevious() const {return xPrevious;}\r\n         int  GLBall::getXVel()      const {return xVel;}\r\nunsigned int  GLBall::getYCurrent()  const {return yCurrent;}\r\nunsigned int  GLBall::getYPrevious() const {return yPrevious;}\r\n         int  GLBall::getYVel()      const {return yVel;}\r\nGLBall& GLBall::setBallColor(unsigned int ballColor) {\r\n\tthis->ballColor = ballColor;\r\n\treturn *this ;\r\n}\r\nGLBall& GLBall::setFrameTime(unsigned long frameTime = 10) {\r\n\tthis->frameTime = frameTime;\r\n\treturn *this ;\r\n}\r\nGLBall& GLBall::setRadius(int radius = 4) {\r\n\tthis->radius = radius;\r\n\treturn *this ;\r\n}\r\nGLBall& GLBall::setTrailColor(unsigned int trailColor) {\r\n\tthis->trailColor = trailColor;\r\n\treturn *this ;\r\n}\r\nGLBall& GLBall::setXCurrent(int current = 4) {\r\n\txCurrent = current;\r\n\treturn *this ;\r\n}\r\nGLBall& GLBall::setXPrevious(int previous) {\r\n\txPrevious = previous;\r\n\treturn *this ;\r\n}\r\nGLBall& GLBall::setXVel(int vel = 1) {\r\n\txVel = vel;\r\n\treturn *this ;\r\n}\r\nGLBall& GLBall::setYCurrent(int current = 4) {\r\n\tyCurrent = current;\r\n\treturn *this ;\r\n}\r\nGLBall& GLBall::setYPrevious(int previous) {\r\n\tyPrevious = previous;\r\n\treturn *this ;\r\n}\r\nGLBall& GLBall::setYVel(int vel = 1) {\r\n\tyVel = vel;\r\n\treturn *this ;\r\n}\r\n\r\n\r\n<commit_msg>Update how reversal of velocity is calculated at height and width limits.<commit_after>\/*\r\n * GLBall.cpp\r\n *\r\n *  Created on: Oct 12, 2015\r\n *      Author: Ian Shef\r\n *\/\r\n\r\n#include \"GLBall.h\"\r\n\r\nGLBall::GLBall(ST7735 *st7735)\r\n\t: frameTime (10)\r\n\t, radius (4)\r\n\t, xCurrent (radius)\r\n\t, yCurrent (radius)\r\n\t, ballColor (0xFFFF)\r\n\t, trailColor (ballColor)\r\n\t, xVel (1)\r\n\t, yVel (xVel)\r\n\t, lcd (st7735)\r\n  {}\r\n\r\nvoid        GLBall::begin() {\r\n\tthis->previousTime = millis() ;\r\n}\r\n\r\nboolean        GLBall::update() {\r\n\tboolean returnValue = false ;\r\n\tcurrentTime = millis() ;\r\n\tif ( (currentTime - previousTime) >= frameTime) {\r\n\t\treturnValue = true ;\r\n\t\tpreviousTime = currentTime ;\r\n\t\txPrevious = xCurrent ;\r\n\t\tyPrevious = yCurrent ;\r\n\t\txCurrent += xVel ;\r\n\t\tyCurrent += yVel ;\r\n\t\tunsigned int xMax = lcd->width  - 1 ;\r\n\t\tunsigned int yMax = lcd->height - 1 ;\r\n\t\tif (xVel>0) {\r\n\t\t\tif ((xCurrent+radius)>xMax) {\r\n\t\t\t\txVel = -xVel ;\r\n\t\t\t\txCurrent += xVel ;\r\n\t\t\t}\r\n\t\t} else if (xVel<0) {\r\n\t\t\tif ((xCurrent-radius) <=0) {\r\n\t\t\t\txVel = -xVel ;\r\n\t\t\t\txCurrent += xVel ;\r\n\t\t\t}\r\n\t\t}\r\n\t\tif (yVel>0) {\r\n\t\t\tif ((yCurrent+radius)>yMax) {\r\n\t\t\t\tyVel = -yVel ;\r\n\t\t\t\tyCurrent += yVel ;\r\n\t\t\t}\r\n\t\t} else if (yVel<0) {\r\n\t\t\tif ((yCurrent-radius) <=0) {\r\n\t\t\t\tyVel = -yVel ;\r\n\t\t\t\tyCurrent += yVel ;\r\n\t\t\t}\r\n\t\t}\r\n\t\tlcd->fillCircle(xPrevious, yPrevious, radius, trailColor) ;\r\n\t\tlcd->fillCircle(xCurrent, yCurrent, radius, ballColor) ;\r\n\t}\r\n\treturn returnValue ;\r\n}\r\n\r\nunsigned int  GLBall::getBallColor() const {return ballColor;}\r\nunsigned long GLBall::getFrameTime() const {return frameTime;}\r\nunsigned int  GLBall::getRadius()    const {return radius;}\r\nunsigned int  GLBall::getTrailColor()const {return trailColor;}\r\nunsigned int  GLBall::getXCurrent()  const {return xCurrent;}\r\nunsigned int  GLBall::getXPrevious() const {return xPrevious;}\r\n         int  GLBall::getXVel()      const {return xVel;}\r\nunsigned int  GLBall::getYCurrent()  const {return yCurrent;}\r\nunsigned int  GLBall::getYPrevious() const {return yPrevious;}\r\n         int  GLBall::getYVel()      const {return yVel;}\r\nGLBall& GLBall::setBallColor(unsigned int ballColor) {\r\n\tthis->ballColor = ballColor;\r\n\treturn *this ;\r\n}\r\nGLBall& GLBall::setFrameTime(unsigned long frameTime = 10) {\r\n\tthis->frameTime = frameTime;\r\n\treturn *this ;\r\n}\r\nGLBall& GLBall::setRadius(int radius = 4) {\r\n\tthis->radius = radius;\r\n\treturn *this ;\r\n}\r\nGLBall& GLBall::setTrailColor(unsigned int trailColor) {\r\n\tthis->trailColor = trailColor;\r\n\treturn *this ;\r\n}\r\nGLBall& GLBall::setXCurrent(int current = 4) {\r\n\txCurrent = current;\r\n\treturn *this ;\r\n}\r\nGLBall& GLBall::setXPrevious(int previous) {\r\n\txPrevious = previous;\r\n\treturn *this ;\r\n}\r\nGLBall& GLBall::setXVel(int vel = 1) {\r\n\txVel = vel;\r\n\treturn *this ;\r\n}\r\nGLBall& GLBall::setYCurrent(int current = 4) {\r\n\tyCurrent = current;\r\n\treturn *this ;\r\n}\r\nGLBall& GLBall::setYPrevious(int previous) {\r\n\tyPrevious = previous;\r\n\treturn *this ;\r\n}\r\nGLBall& GLBall::setYVel(int vel = 1) {\r\n\tyVel = vel;\r\n\treturn *this ;\r\n}\r\n\r\n\r\n<|endoftext|>"}
{"text":"<commit_before>#ifndef FILESERVER_RECURSIVE_DIRECTORY_WATCHER_HPP\n#define FILESERVER_RECURSIVE_DIRECTORY_WATCHER_HPP\n\n#include \"pool_executor.hpp\"\n#include <silicium\/linux\/inotify.hpp>\n#include <silicium\/file_notification.hpp>\n#include <silicium\/c_string.hpp>\n#include <silicium\/observable\/erased_observer.hpp>\n#include <silicium\/observable\/transform.hpp>\n#include <silicium\/std_threading.hpp>\n#include <silicium\/asio\/posting_observable.hpp>\n#include <silicium\/linux\/single_directory_watcher.hpp>\n#include <silicium\/observable\/total_consumer.hpp>\n#include <silicium\/utility.hpp>\n#include <boost\/filesystem\/operations.hpp>\n#include <boost\/asio\/strand.hpp>\n\nnamespace fileserver\n{\n\tnamespace detail\n\t{\n\t\ttemplate <class OutputIterator>\n\t\tvoid convert_to_portable_notifications_generic(std::vector<Si::linux::file_notification> &&linux_notifications, OutputIterator portable_out)\n\t\t{\n\t\t\tfor (Si::linux::file_notification &linux_notification : linux_notifications)\n\t\t\t{\n\t\t\t\tauto portable = Si::linux::to_portable_file_notification(std::move(linux_notification));\n\t\t\t\tif (!portable)\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\t*portable_out = std::move(*portable);\n\t\t\t\t++portable_out;\n\t\t\t}\n\t\t}\n\n\t\tstd::vector<Si::file_notification> convert_to_portable_notifications(std::vector<Si::linux::file_notification> &&linux_notifications)\n\t\t{\n\t\t\tstd::vector<Si::file_notification> portable_notifications;\n\t\t\tportable_notifications.reserve(linux_notifications.size());\n\t\t\tconvert_to_portable_notifications_generic(std::move(linux_notifications), std::back_inserter(portable_notifications));\n\t\t\treturn portable_notifications;\n\t\t}\n\t}\n\n\tstruct recursive_directory_watcher\n\t{\n\t\ttypedef Si::error_or<std::vector<Si::file_notification>> element_type;\n\n\t\texplicit recursive_directory_watcher(boost::asio::io_service &io, Si::native_path_string root)\n\t\t{\n\t\t\tauto ec = start(io, root);\n\t\t\tif (!!ec)\n\t\t\t{\n\t\t\t\tboost::throw_exception(boost::system::system_error(ec));\n\t\t\t}\n\t\t}\n\n\t\tboost::system::error_code start(boost::asio::io_service &io, Si::native_path_string root)\n\t\t{\n\t\t\tm_root_strand = Si::make_unique<boost::asio::io_service::strand>(io);\n\t\t\tm_inotify = notification_consumer(\n\t\t\t\tnotification_handler(\n\t\t\t\t\t[this](std::vector<Si::linux::file_notification> notifications)\n\t\t\t\t\t{\n\t\t\t\t\t\thandle_file_notifications(std::move(notifications));\n\t\t\t\t\t\treturn Si::nothing();\n\t\t\t\t\t},\n\t\t\t\t\tSi::asio::posting_observable<Si::linux::inotify_observable, boost::asio::io_service::strand>(\n\t\t\t\t\t\t*m_root_strand,\n\t\t\t\t\t\tSi::linux::inotify_observable(io)\n\t\t\t\t\t)\n\t\t\t\t)\n\t\t\t);\n\t\t\tm_scanners = pool_executor<Si::std_threading>(1);\n\t\t\tm_root_strand->dispatch([this, root_path = Si::path(root.c_str())]() mutable\n\t\t\t{\n\t\t\t\tbegin_scan(nullptr, std::move(root_path));\n\t\t\t});\n\t\t\tm_inotify.start();\n\t\t\treturn {};\n\t\t}\n\n\t\ttemplate <class Observer>\n\t\tvoid async_get_one(Observer &&receiver)\n\t\t{\n\t\t\t\/\/TODO: avoid the additional indirection (shared_ptr -> unique_ptr -> observer)\n\t\t\tauto movable_receiver = Si::to_shared(Si::erased_observer<element_type>(std::forward<Observer>(receiver)));\n\t\t\tm_root_strand->dispatch(\n\t\t\t\t[movable_receiver, this]()\n\t\t\t{\n\t\t\t\tSi::visit<void>(\n\t\t\t\t\tm_receiver_or_result,\n\t\t\t\t\t[this, movable_receiver](Si::nothing)\n\t\t\t\t\t{\n\t\t\t\t\t\tm_receiver_or_result = std::move(*movable_receiver);\n\t\t\t\t\t},\n\t\t\t\t\t[](Si::erased_observer<element_type> &)\n\t\t\t\t\t{\n\t\t\t\t\t\tSILICIUM_UNREACHABLE();\n\t\t\t\t\t},\n\t\t\t\t\t[this, movable_receiver](Si::error_or<std::vector<Si::file_notification>> &existing_result)\n\t\t\t\t\t{\n\t\t\t\t\t\telement_type result = std::move(existing_result);\n\t\t\t\t\t\tm_receiver_or_result = Si::nothing();\n\t\t\t\t\t\tmovable_receiver->got_element(std::move(result));\n\t\t\t\t\t}\n\t\t\t\t);\n\t\t\t});\n\t\t}\n\n\tprivate:\n\n\t\tstruct directory\n\t\t{\n\t\t\tSi::path absolute_path;\n\t\t\tSi::linux::watch_descriptor watch;\n\t\t\tstd::map<Si::path, directory> sub_directories;\n\t\t};\n\n\t\ttypedef Si::transformation<\n\t\t\tstd::function<Si::nothing (std::vector<Si::linux::file_notification>)>,\n\t\t\tSi::asio::posting_observable<\n\t\t\t\tSi::linux::inotify_observable,\n\t\t\t\tboost::asio::io_service::strand\n\t\t\t>\n\t\t> notification_handler;\n\n\t\ttypedef Si::total_consumer<notification_handler> notification_consumer;\n\n\t\tstd::unique_ptr<boost::asio::io_service::strand> m_root_strand;\n\t\tnotification_consumer m_inotify;\n\t\tdirectory m_root;\n\t\tstd::map<int, directory *> m_watch_descriptor_to_directory;\n\t\tSi::fast_variant<\n\t\t\tSi::nothing,\n\t\t\tSi::erased_observer<element_type>,\n\t\t\tSi::error_or<std::vector<Si::file_notification>>\n\t\t> m_receiver_or_result;\n\t\tpool_executor<Si::std_threading> m_scanners;\n\n\t\tdirectory *find_directory_by_watch_descriptor(int wd) const BOOST_NOEXCEPT\n\t\t{\n\t\t\tassert(wd >= 0);\n\t\t\tauto i = m_watch_descriptor_to_directory.find(wd);\n\t\t\tif (i == m_watch_descriptor_to_directory.end())\n\t\t\t{\n\t\t\t\treturn nullptr;\n\t\t\t}\n\t\t\tassert(i->second);\n\t\t\treturn i->second;\n\t\t}\n\n\t\tvoid handle_file_notifications(std::vector<Si::linux::file_notification> notifications)\n\t\t{\n\t\t\t\/\/ precondition: Method is running on the root strand\n\t\t\tassert(m_root_strand->running_in_this_thread());\n\n\t\t\tfor (Si::linux::file_notification const &notification : notifications)\n\t\t\t{\n\t\t\t\tauto type = Si::linux::to_portable_file_notification_type(notification.mask);\n\t\t\t\tif (!type)\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tswitch (*type)\n\t\t\t\t{\n\t\t\t\tcase Si::file_notification_type::add:\n\t\t\t\t\t{\n\t\t\t\t\t\tif ((notification.mask & IN_ISDIR) != IN_ISDIR)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdirectory * const parent_of_the_new_dir = find_directory_by_watch_descriptor(notification.watch_descriptor);\n\t\t\t\t\t\tif (!parent_of_the_new_dir)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbegin_scan(parent_of_the_new_dir, parent_of_the_new_dir->absolute_path \/ notification.name);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\tcase Si::file_notification_type::remove:\n\t\t\t\tcase Si::file_notification_type::move_self:\n\t\t\t\tcase Si::file_notification_type::remove_self:\n\t\t\t\tcase Si::file_notification_type::change_content:\n\t\t\t\tcase Si::file_notification_type::change_metadata:\n\t\t\t\tcase Si::file_notification_type::change_content_or_metadata:\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tnotify_observer(std::move(notifications));\n\t\t}\n\n\t\tvoid notify_observer(Si::error_or<std::vector<Si::linux::file_notification>> &&notifications)\n\t\t{\n\t\t\t\/\/ precondition: Method is running on the root strand\n\t\t\tassert(m_root_strand->running_in_this_thread());\n\n\t\t\tSi::visit<void>(\n\t\t\t\tm_receiver_or_result,\n\t\t\t\t[this, &notifications](Si::nothing)\n\t\t\t\t{\n\t\t\t\t\tm_receiver_or_result = Si::map(std::move(notifications), &detail::convert_to_portable_notifications);\n\t\t\t\t},\n\t\t\t\t[this, &notifications](Si::erased_observer<element_type> &receiver)\n\t\t\t\t{\n\t\t\t\t\tauto receiver_on_stack = std::move(receiver);\n\t\t\t\t\tm_receiver_or_result = Si::nothing();\n\t\t\t\t\treceiver_on_stack.got_element(Si::map(std::move(notifications), &detail::convert_to_portable_notifications));\n\t\t\t\t},\n\t\t\t\t[this, &notifications](Si::error_or<std::vector<Si::file_notification>> &existing_result)\n\t\t\t\t{\n\t\t\t\t\tboost::ignore_unused_variable_warning(existing_result);\n\t\t\t\t\tthrow std::logic_error(\"todo\");\n\t\t\t\t}\n\t\t\t);\n\t\t}\n\n\t\tvoid begin_scan(directory *parent, Si::path directory_to_scan)\n\t\t{\n\t\t\tassert(m_root_strand->running_in_this_thread());\n\n\t\t\tdirectory *scanned;\n\t\t\tif (parent)\n\t\t\t{\n\t\t\t\tSi::path name = leaf(directory_to_scan);\n\t\t\t\tdirectory &child = parent->sub_directories[name];\n\t\t\t\tscanned = &child;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tscanned = &m_root;\n\t\t\t}\n\t\t\tscanned->absolute_path = directory_to_scan;\n\n\t\t\tm_scanners.submit([this, scanned, directory_to_scan = std::move(directory_to_scan)]() mutable\n\t\t\t{\n\t\t\t\tauto result = scan(*scanned, std::move(directory_to_scan));\n\t\t\t\tm_root_strand->dispatch([this, result = std::move(result)]() mutable\n\t\t\t\t{\n\t\t\t\t\tnotify_observer(std::move(result));\n\t\t\t\t});\n\t\t\t});\n\t\t}\n\n\t\tSi::error_or<std::vector<Si::linux::file_notification>> scan(directory &scanned, Si::path directory_to_scan)\n\t\t{\n\t\t\tscanned.watch = m_inotify.get_input().get_input().get_input().watch(directory_to_scan.c_str(), IN_ALL_EVENTS).get();\n\t\t\tm_watch_descriptor_to_directory.insert(std::make_pair(scanned.watch.get_watch_descriptor(), &scanned));\n\n\t\t\tboost::system::error_code ec;\n\t\t\tboost::filesystem::directory_iterator i(directory_to_scan.c_str(), ec);\n\t\t\tif (!!ec)\n\t\t\t{\n\t\t\t\treturn ec;\n\t\t\t}\n\t\t\tstd::vector<Si::linux::file_notification> artifical_notifications;\n\t\t\twhile (i != boost::filesystem::directory_iterator())\n\t\t\t{\n\t\t\t\tauto leaf = i->path().leaf();\n\t\t\t\tSi::path sub_name(leaf);\n\n\t\t\t\tswitch (i->status().type())\n\t\t\t\t{\n\t\t\t\tcase boost::filesystem::directory_file:\n\t\t\t\t\t{\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tSi::path child(i->path().c_str());\n\t\t\t\t\t\t\tm_root_strand->dispatch([this, &scanned, child = std::move(child)]() mutable\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tbegin_scan(&scanned, std::move(child));\n\t\t\t\t\t\t\t});\n\t\t\t\t\t\t}\n\t\t\t\t\t\tartifical_notifications.emplace_back(IN_ISDIR | IN_CREATE, std::move(sub_name), -1);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\tcase boost::filesystem::regular_file:\n\t\t\t\t\t{\n\t\t\t\t\t\tartifical_notifications.emplace_back(IN_CREATE, std::move(sub_name), -1);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\tdefault:\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\ti.increment(ec);\n\t\t\t\tif (!!ec)\n\t\t\t\t{\n\t\t\t\t\treturn ec;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn std::move(artifical_notifications);\n\t\t}\n\t};\n}\n\n#endif\n<commit_msg>use more threads for enumerating directories<commit_after>#ifndef FILESERVER_RECURSIVE_DIRECTORY_WATCHER_HPP\n#define FILESERVER_RECURSIVE_DIRECTORY_WATCHER_HPP\n\n#include \"pool_executor.hpp\"\n#include <silicium\/linux\/inotify.hpp>\n#include <silicium\/file_notification.hpp>\n#include <silicium\/c_string.hpp>\n#include <silicium\/observable\/erased_observer.hpp>\n#include <silicium\/observable\/transform.hpp>\n#include <silicium\/std_threading.hpp>\n#include <silicium\/asio\/posting_observable.hpp>\n#include <silicium\/linux\/single_directory_watcher.hpp>\n#include <silicium\/observable\/total_consumer.hpp>\n#include <silicium\/utility.hpp>\n#include <boost\/filesystem\/operations.hpp>\n#include <boost\/asio\/strand.hpp>\n\nnamespace fileserver\n{\n\tnamespace detail\n\t{\n\t\ttemplate <class OutputIterator>\n\t\tvoid convert_to_portable_notifications_generic(std::vector<Si::linux::file_notification> &&linux_notifications, OutputIterator portable_out)\n\t\t{\n\t\t\tfor (Si::linux::file_notification &linux_notification : linux_notifications)\n\t\t\t{\n\t\t\t\tauto portable = Si::linux::to_portable_file_notification(std::move(linux_notification));\n\t\t\t\tif (!portable)\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\t*portable_out = std::move(*portable);\n\t\t\t\t++portable_out;\n\t\t\t}\n\t\t}\n\n\t\tstd::vector<Si::file_notification> convert_to_portable_notifications(std::vector<Si::linux::file_notification> &&linux_notifications)\n\t\t{\n\t\t\tstd::vector<Si::file_notification> portable_notifications;\n\t\t\tportable_notifications.reserve(linux_notifications.size());\n\t\t\tconvert_to_portable_notifications_generic(std::move(linux_notifications), std::back_inserter(portable_notifications));\n\t\t\treturn portable_notifications;\n\t\t}\n\t}\n\n\tstruct recursive_directory_watcher\n\t{\n\t\ttypedef Si::error_or<std::vector<Si::file_notification>> element_type;\n\n\t\texplicit recursive_directory_watcher(boost::asio::io_service &io, Si::native_path_string root)\n\t\t{\n\t\t\tauto ec = start(io, root);\n\t\t\tif (!!ec)\n\t\t\t{\n\t\t\t\tboost::throw_exception(boost::system::system_error(ec));\n\t\t\t}\n\t\t}\n\n\t\tboost::system::error_code start(boost::asio::io_service &io, Si::native_path_string root)\n\t\t{\n\t\t\tm_root_strand = Si::make_unique<boost::asio::io_service::strand>(io);\n\t\t\tm_inotify = notification_consumer(\n\t\t\t\tnotification_handler(\n\t\t\t\t\t[this](std::vector<Si::linux::file_notification> notifications)\n\t\t\t\t\t{\n\t\t\t\t\t\thandle_file_notifications(std::move(notifications));\n\t\t\t\t\t\treturn Si::nothing();\n\t\t\t\t\t},\n\t\t\t\t\tSi::asio::posting_observable<Si::linux::inotify_observable, boost::asio::io_service::strand>(\n\t\t\t\t\t\t*m_root_strand,\n\t\t\t\t\t\tSi::linux::inotify_observable(io)\n\t\t\t\t\t)\n\t\t\t\t)\n\t\t\t);\n\t\t\tm_scanners = pool_executor<Si::std_threading>(std::thread::hardware_concurrency());\n\t\t\tm_root_strand->dispatch([this, root_path = Si::path(root.c_str())]() mutable\n\t\t\t{\n\t\t\t\tbegin_scan(nullptr, std::move(root_path));\n\t\t\t});\n\t\t\tm_inotify.start();\n\t\t\treturn {};\n\t\t}\n\n\t\ttemplate <class Observer>\n\t\tvoid async_get_one(Observer &&receiver)\n\t\t{\n\t\t\t\/\/TODO: avoid the additional indirection (shared_ptr -> unique_ptr -> observer)\n\t\t\tauto movable_receiver = Si::to_shared(Si::erased_observer<element_type>(std::forward<Observer>(receiver)));\n\t\t\tm_root_strand->dispatch(\n\t\t\t\t[movable_receiver, this]()\n\t\t\t{\n\t\t\t\tSi::visit<void>(\n\t\t\t\t\tm_receiver_or_result,\n\t\t\t\t\t[this, movable_receiver](Si::nothing)\n\t\t\t\t\t{\n\t\t\t\t\t\tm_receiver_or_result = std::move(*movable_receiver);\n\t\t\t\t\t},\n\t\t\t\t\t[](Si::erased_observer<element_type> &)\n\t\t\t\t\t{\n\t\t\t\t\t\tSILICIUM_UNREACHABLE();\n\t\t\t\t\t},\n\t\t\t\t\t[this, movable_receiver](Si::error_or<std::vector<Si::file_notification>> &existing_result)\n\t\t\t\t\t{\n\t\t\t\t\t\telement_type result = std::move(existing_result);\n\t\t\t\t\t\tm_receiver_or_result = Si::nothing();\n\t\t\t\t\t\tmovable_receiver->got_element(std::move(result));\n\t\t\t\t\t}\n\t\t\t\t);\n\t\t\t});\n\t\t}\n\n\tprivate:\n\n\t\tstruct directory\n\t\t{\n\t\t\tSi::path absolute_path;\n\t\t\tSi::linux::watch_descriptor watch;\n\t\t\tstd::map<Si::path, directory> sub_directories;\n\t\t};\n\n\t\ttypedef Si::transformation<\n\t\t\tstd::function<Si::nothing (std::vector<Si::linux::file_notification>)>,\n\t\t\tSi::asio::posting_observable<\n\t\t\t\tSi::linux::inotify_observable,\n\t\t\t\tboost::asio::io_service::strand\n\t\t\t>\n\t\t> notification_handler;\n\n\t\ttypedef Si::total_consumer<notification_handler> notification_consumer;\n\n\t\tstd::unique_ptr<boost::asio::io_service::strand> m_root_strand;\n\t\tnotification_consumer m_inotify;\n\t\tdirectory m_root;\n\t\tstd::map<int, directory *> m_watch_descriptor_to_directory;\n\t\tSi::fast_variant<\n\t\t\tSi::nothing,\n\t\t\tSi::erased_observer<element_type>,\n\t\t\tSi::error_or<std::vector<Si::file_notification>>\n\t\t> m_receiver_or_result;\n\t\tpool_executor<Si::std_threading> m_scanners;\n\n\t\tdirectory *find_directory_by_watch_descriptor(int wd) const BOOST_NOEXCEPT\n\t\t{\n\t\t\tassert(wd >= 0);\n\t\t\tauto i = m_watch_descriptor_to_directory.find(wd);\n\t\t\tif (i == m_watch_descriptor_to_directory.end())\n\t\t\t{\n\t\t\t\treturn nullptr;\n\t\t\t}\n\t\t\tassert(i->second);\n\t\t\treturn i->second;\n\t\t}\n\n\t\tvoid handle_file_notifications(std::vector<Si::linux::file_notification> notifications)\n\t\t{\n\t\t\t\/\/ precondition: Method is running on the root strand\n\t\t\tassert(m_root_strand->running_in_this_thread());\n\n\t\t\tfor (Si::linux::file_notification const &notification : notifications)\n\t\t\t{\n\t\t\t\tauto type = Si::linux::to_portable_file_notification_type(notification.mask);\n\t\t\t\tif (!type)\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tswitch (*type)\n\t\t\t\t{\n\t\t\t\tcase Si::file_notification_type::add:\n\t\t\t\t\t{\n\t\t\t\t\t\tif ((notification.mask & IN_ISDIR) != IN_ISDIR)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdirectory * const parent_of_the_new_dir = find_directory_by_watch_descriptor(notification.watch_descriptor);\n\t\t\t\t\t\tif (!parent_of_the_new_dir)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbegin_scan(parent_of_the_new_dir, parent_of_the_new_dir->absolute_path \/ notification.name);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\tcase Si::file_notification_type::remove:\n\t\t\t\tcase Si::file_notification_type::move_self:\n\t\t\t\tcase Si::file_notification_type::remove_self:\n\t\t\t\tcase Si::file_notification_type::change_content:\n\t\t\t\tcase Si::file_notification_type::change_metadata:\n\t\t\t\tcase Si::file_notification_type::change_content_or_metadata:\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tnotify_observer(std::move(notifications));\n\t\t}\n\n\t\tvoid notify_observer(Si::error_or<std::vector<Si::linux::file_notification>> &&notifications)\n\t\t{\n\t\t\t\/\/ precondition: Method is running on the root strand\n\t\t\tassert(m_root_strand->running_in_this_thread());\n\n\t\t\tSi::visit<void>(\n\t\t\t\tm_receiver_or_result,\n\t\t\t\t[this, &notifications](Si::nothing)\n\t\t\t\t{\n\t\t\t\t\tm_receiver_or_result = Si::map(std::move(notifications), &detail::convert_to_portable_notifications);\n\t\t\t\t},\n\t\t\t\t[this, &notifications](Si::erased_observer<element_type> &receiver)\n\t\t\t\t{\n\t\t\t\t\tauto receiver_on_stack = std::move(receiver);\n\t\t\t\t\tm_receiver_or_result = Si::nothing();\n\t\t\t\t\treceiver_on_stack.got_element(Si::map(std::move(notifications), &detail::convert_to_portable_notifications));\n\t\t\t\t},\n\t\t\t\t[this, &notifications](Si::error_or<std::vector<Si::file_notification>> &existing_result)\n\t\t\t\t{\n\t\t\t\t\tboost::ignore_unused_variable_warning(existing_result);\n\t\t\t\t\tthrow std::logic_error(\"todo\");\n\t\t\t\t}\n\t\t\t);\n\t\t}\n\n\t\tvoid begin_scan(directory *parent, Si::path directory_to_scan)\n\t\t{\n\t\t\tassert(m_root_strand->running_in_this_thread());\n\n\t\t\tdirectory *scanned;\n\t\t\tif (parent)\n\t\t\t{\n\t\t\t\tSi::path name = leaf(directory_to_scan);\n\t\t\t\tdirectory &child = parent->sub_directories[name];\n\t\t\t\tscanned = &child;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tscanned = &m_root;\n\t\t\t}\n\t\t\tscanned->absolute_path = directory_to_scan;\n\n\t\t\tm_scanners.submit([this, scanned, directory_to_scan = std::move(directory_to_scan)]() mutable\n\t\t\t{\n\t\t\t\tauto result = scan(*scanned, std::move(directory_to_scan));\n\t\t\t\tm_root_strand->dispatch([this, result = std::move(result)]() mutable\n\t\t\t\t{\n\t\t\t\t\tnotify_observer(std::move(result));\n\t\t\t\t});\n\t\t\t});\n\t\t}\n\n\t\tSi::error_or<std::vector<Si::linux::file_notification>> scan(directory &scanned, Si::path directory_to_scan)\n\t\t{\n\t\t\tscanned.watch = m_inotify.get_input().get_input().get_input().watch(directory_to_scan.c_str(), IN_ALL_EVENTS).get();\n\t\t\tm_watch_descriptor_to_directory.insert(std::make_pair(scanned.watch.get_watch_descriptor(), &scanned));\n\n\t\t\tboost::system::error_code ec;\n\t\t\tboost::filesystem::directory_iterator i(directory_to_scan.c_str(), ec);\n\t\t\tif (!!ec)\n\t\t\t{\n\t\t\t\treturn ec;\n\t\t\t}\n\t\t\tstd::vector<Si::linux::file_notification> artifical_notifications;\n\t\t\twhile (i != boost::filesystem::directory_iterator())\n\t\t\t{\n\t\t\t\tauto leaf = i->path().leaf();\n\t\t\t\tSi::path sub_name(leaf);\n\n\t\t\t\tswitch (i->status().type())\n\t\t\t\t{\n\t\t\t\tcase boost::filesystem::directory_file:\n\t\t\t\t\t{\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tSi::path child(i->path().c_str());\n\t\t\t\t\t\t\tm_root_strand->dispatch([this, &scanned, child = std::move(child)]() mutable\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tbegin_scan(&scanned, std::move(child));\n\t\t\t\t\t\t\t});\n\t\t\t\t\t\t}\n\t\t\t\t\t\tartifical_notifications.emplace_back(IN_ISDIR | IN_CREATE, std::move(sub_name), -1);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\tcase boost::filesystem::regular_file:\n\t\t\t\t\t{\n\t\t\t\t\t\tartifical_notifications.emplace_back(IN_CREATE, std::move(sub_name), -1);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\tdefault:\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\ti.increment(ec);\n\t\t\t\tif (!!ec)\n\t\t\t\t{\n\t\t\t\t\treturn ec;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn std::move(artifical_notifications);\n\t\t}\n\t};\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include <jsoncons\/json.hpp>\n#include \"GEK\/Utility\/JSON.hpp\"\n#include \"GEK\/Utility\/FileSystem.hpp\"\n#include \"GEK\/Utility\/Context.hpp\"\n\nnamespace Gek\n{\n    const JSON::Array JSON::EmptyArray = JSON::Array();\n    const JSON::Object JSON::EmptyObject = JSON::Object();\n    const JSON JSON::Empty = JSON();\n\n    JSON GetFromJSON(jsoncons::json const &object)\n    {\n        if (object.empty() || object.is_null())\n        {\n            return JSON::Empty;\n        }\n\n        JSON value;\n        switch (object.kind())\n        {\n        case jsoncons::value_kind::short_string_value:\n        case jsoncons::value_kind::long_string_value:\n        case jsoncons::value_kind::byte_string_value:\n            value = object.as_string();\n            break;\n\n        case jsoncons::value_kind::bool_value:\n            value = object.as<bool>();\n            break;\n\n        case jsoncons::value_kind::double_value:\n            value = object.as<float>();\n            break;\n\n        case jsoncons::value_kind::int64_value:\n            value = object.as<int64_t>();\n            break;\n\n        case jsoncons::value_kind::uint64_value:\n            value = object.as<uint64_t>();\n            break;\n\n        case jsoncons::value_kind::array_value:\n            value = JSON::Array(object.size());\n            for (size_t index = 0; index < object.size(); ++index)\n            {\n                value[index] = GetFromJSON(object[index]);\n            }\n\n            break;\n\n        case jsoncons::value_kind::object_value:\n            value = JSON::Object();\n            for (auto &pair : object.object_range())\n            {\n                value[pair.key()] = GetFromJSON(pair.value());\n            }\n\n            break;\n        };\n\n        return value;\n    }\n\n    void JSON::load(FileSystem::Path const &filePath)\n    {\n        if (filePath.isFile())\n        {\n            std::string object(FileSystem::Load(filePath, String::Empty));\n            std::istringstream dataStream(object);\n            jsoncons::json_decoder<jsoncons::json> decoder;\n            jsoncons::json_reader reader(dataStream, decoder);\n\n            std::error_code errorCode;\n            reader.read(errorCode);\n            if (errorCode)\n            {\n                LockedWrite{ std::cerr } << errorCode.message() << \" at line \" << reader.line() << \", and column \" << reader.column() << \", in \" << filePath.getString();\n            }\n            else\n            {\n                *this = GetFromJSON(decoder.get_result());\n            }\n        }\n    }\n\n    void JSON::save(FileSystem::Path const &filePath)\n    {\n        FileSystem::Save(filePath, getString());\n    }\n\n    std::string escapeJsonString(const std::string& input)\n    {\n        std::ostringstream ss;\n        for (auto iter = input.cbegin(); iter != input.cend(); iter++)\n        {\n            \/\/C++98\/03:\n            \/\/for (std::string::const_iterator iter = input.begin(); iter != input.end(); iter++) {\n            switch (*iter)\n            {\n            case '\\\\': ss << \"\\\\\\\\\"; break;\n            case '\"': ss << \"\\\\\\\"\"; break;\n            case '\/': ss << \"\\\\\/\"; break;\n            case '\\b': ss << \"\\\\b\"; break;\n            case '\\f': ss << \"\\\\f\"; break;\n            case '\\n': ss << \"\\\\n\"; break;\n            case '\\r': ss << \"\\\\r\"; break;\n            case '\\t': ss << \"\\\\t\"; break;\n            default: ss << *iter; break;\n            };\n        }\n\n        return ss.str();\n    }\n\n    std::string JSON::getString(void) const\n    {\n        return visit(\n            [](std::string const &visitedData)\n        {\n            return String::Format(\"\\\"{}\\\"\", escapeJsonString(visitedData));\n        },\n            [](JSON::Array const &visitedData)\n        {\n            std::stringstream stream;\n\n            stream << \"[ \";\n            bool writtenPrevious = false;\n            for (auto &index : visitedData)\n            {\n                if (writtenPrevious)\n                {\n                    stream << \", \";\n                }\n\n                stream << index.getString();\n                writtenPrevious = true;\n            }\n\n            stream << \"]\";\n            return stream.str();\n        },\n            [](JSON::Object const &visitedData)\n        {\n            std::stringstream stream;\n\n            stream << \"{ \";\n            bool writtenPrevious = false;\n            for (auto &index : visitedData)\n            {\n                if (writtenPrevious)\n                {\n                    stream << \", \";\n                }\n\n                stream << \"\\\"\" << index.first << \"\\\": \";\n                stream << index.second.getString();\n                writtenPrevious = true;\n            }\n\n            stream << \"}\";\n            return stream.str();\n        },\n            [](auto && visitedData)\n        {\n            return String::Format(\"{}\", visitedData);\n        });\n    }\n\n    JSON const &JSON::getIndex(size_t index) const\n    {\n        if (auto value = std::get_if<Array>(&data))\n        {\n            return value->at(index);\n        }\n        else\n        {\n            return Empty;\n        }\n    }\n\n    JSON const &JSON::getMember(std::string_view name) const\n    {\n        if (auto value = std::get_if<Object>(&data))\n        {\n            auto search = value->find(name.data());\n            if (search == std::end(*value))\n            {\n                return Empty;\n            }\n            else\n            {\n                return search->second;\n            }\n        }\n        else\n        {\n            return Empty;\n        }\n    }\n\n    JSON &JSON::operator [] (size_t index)\n    {\n        if (!isType<Array>())\n        {\n            data = EmptyArray;\n        }\n\n        return std::get<Array>(data)[index];\n    }\n\n    JSON &JSON::operator [] (std::string_view name)\n    {\n        if (!isType<Object>())\n        {\n            data = EmptyObject;\n        }\n\n        return std::get<Object>(data)[name.data()];\n    }\n\n    Math::Float2 JSON::evaluate(ShuntingYard &shuntingYard, Math::Float2 const &defaultValue) const\n    {\n        auto data = asType(EmptyArray);\n        switch (data.size())\n        {\n        case 1:\n            return Math::Float2(data[0].evaluate(shuntingYard, 0.0f));\n\n        default:\n            return Math::Float2(\n                data[0].evaluate(shuntingYard, defaultValue.x),\n                data[1].evaluate(shuntingYard, defaultValue.y));\n        };\n    }\n\n    Math::Float3 JSON::evaluate(ShuntingYard &shuntingYard, Math::Float3 const &defaultValue) const\n    {\n        auto data = asType(EmptyArray);\n        switch (data.size())\n        {\n        case 1:\n            return Math::Float3(data[0].evaluate(shuntingYard, 0.0f));\n\n        case 3:\n            return Math::Float3(\n                data[0].evaluate(shuntingYard, defaultValue.x),\n                data[1].evaluate(shuntingYard, defaultValue.y),\n                data[2].evaluate(shuntingYard, defaultValue.z));\n\n        default:\n            return defaultValue;\n        };\n    }\n\n    Math::Float4 JSON::evaluate(ShuntingYard &shuntingYard, Math::Float4 const &defaultValue) const\n    {\n        auto data = asType(EmptyArray);\n        switch (data.size())\n        {\n        case 1:\n            return Math::Float4(data[0].evaluate(shuntingYard, 0.0f));\n\n        case 3:\n            return Math::Float4(\n                data[0].evaluate(shuntingYard, defaultValue.x),\n                data[1].evaluate(shuntingYard, defaultValue.y),\n                data[2].evaluate(shuntingYard, defaultValue.z),\n                defaultValue.w);\n\n        case 4:\n            return Math::Float4(\n                data[0].evaluate(shuntingYard, defaultValue.x),\n                data[1].evaluate(shuntingYard, defaultValue.y),\n                data[2].evaluate(shuntingYard, defaultValue.z),\n                data[3].evaluate(shuntingYard, defaultValue.w));\n\n        default:\n            return defaultValue;\n        };\n    }\n\n    Math::Quaternion JSON::evaluate(ShuntingYard &shuntingYard, Math::Quaternion const &defaultValue) const\n    {\n        auto data = asType(EmptyArray);\n        switch (data.size())\n        {\n        case 3:\n            if (true)\n            {\n                float pitch = data[0].evaluate(shuntingYard, Math::Infinity);\n                float yaw = data[1].evaluate(shuntingYard, Math::Infinity);\n                float roll = data[2].evaluate(shuntingYard, Math::Infinity);\n                if (pitch != Math::Infinity && yaw != Math::Infinity && roll != Math::Infinity)\n                {\n                    return Math::Quaternion::MakeEulerRotation(pitch, yaw, roll);\n                }\n\n                return defaultValue;\n            }\n\n        case 4:\n            return Math::Quaternion(\n                data[0].evaluate(shuntingYard, defaultValue.x),\n                data[1].evaluate(shuntingYard, defaultValue.y),\n                data[2].evaluate(shuntingYard, defaultValue.z),\n                data[3].evaluate(shuntingYard, defaultValue.w));\n\n        default:\n            return defaultValue;\n        };\n    }\n\n    std::string JSON::evaluate(ShuntingYard &shuntingYard, std::string const &defaultValue) const\n    {\n        return visit(\n            [](std::string const &visitedData)\n        {\n            return visitedData;\n        },\n            [defaultValue](Object const &visitedData)\n        {\n            return defaultValue;\n        },\n            [defaultValue](Array const &visitedData)\n        {\n            return defaultValue;\n        },\n            [defaultValue](auto const &visitedData)\n        {\n            return String::Format(\"{}\", GetValueOrDefault(visitedData, defaultValue));\n        });\n    }\n}; \/\/ namespace Gek\n<commit_msg>Fixing json export for more readable output<commit_after>#include <jsoncons\/json.hpp>\n#include \"GEK\/Utility\/JSON.hpp\"\n#include \"GEK\/Utility\/FileSystem.hpp\"\n#include \"GEK\/Utility\/Context.hpp\"\n\nnamespace Gek\n{\n    const JSON::Array JSON::EmptyArray = JSON::Array();\n    const JSON::Object JSON::EmptyObject = JSON::Object();\n    const JSON JSON::Empty = JSON();\n\n    JSON GetFromJSON(jsoncons::json const &object)\n    {\n        if (object.empty() || object.is_null())\n        {\n            return JSON::Empty;\n        }\n\n        JSON value;\n        switch (object.kind())\n        {\n        case jsoncons::value_kind::short_string_value:\n        case jsoncons::value_kind::long_string_value:\n        case jsoncons::value_kind::byte_string_value:\n            value = object.as_string();\n            break;\n\n        case jsoncons::value_kind::bool_value:\n            value = object.as<bool>();\n            break;\n\n        case jsoncons::value_kind::double_value:\n            value = object.as<float>();\n            break;\n\n        case jsoncons::value_kind::int64_value:\n            value = object.as<int64_t>();\n            break;\n\n        case jsoncons::value_kind::uint64_value:\n            value = object.as<uint64_t>();\n            break;\n\n        case jsoncons::value_kind::array_value:\n            value = JSON::Array(object.size());\n            for (size_t index = 0; index < object.size(); ++index)\n            {\n                value[index] = GetFromJSON(object[index]);\n            }\n\n            break;\n\n        case jsoncons::value_kind::object_value:\n            value = JSON::Object();\n            for (auto &pair : object.object_range())\n            {\n                value[pair.key()] = GetFromJSON(pair.value());\n            }\n\n            break;\n        };\n\n        return value;\n    }\n\n    void JSON::load(FileSystem::Path const &filePath)\n    {\n        if (filePath.isFile())\n        {\n            std::string object(FileSystem::Load(filePath, String::Empty));\n            std::istringstream dataStream(object);\n            jsoncons::json_decoder<jsoncons::json> decoder;\n            jsoncons::json_reader reader(dataStream, decoder);\n\n            std::error_code errorCode;\n            reader.read(errorCode);\n            if (errorCode)\n            {\n                LockedWrite{ std::cerr } << errorCode.message() << \" at line \" << reader.line() << \", and column \" << reader.column() << \", in \" << filePath.getString();\n            }\n            else\n            {\n                *this = GetFromJSON(decoder.get_result());\n            }\n        }\n    }\n\n    void JSON::save(FileSystem::Path const &filePath)\n    {\n        FileSystem::Save(filePath, getString());\n    }\n\n    std::string escapeJsonString(const std::string& input)\n    {\n        std::ostringstream ss;\n        for (auto iter = input.cbegin(); iter != input.cend(); iter++)\n        {\n            \/\/C++98\/03:\n            \/\/for (std::string::const_iterator iter = input.begin(); iter != input.end(); iter++) {\n            switch (*iter)\n            {\n            case '\\\\': ss << \"\\\\\\\\\"; break;\n            case '\"': ss << \"\\\\\\\"\"; break;\n            case '\/': ss << \"\\\\\/\"; break;\n            case '\\b': ss << \"\\\\b\"; break;\n            case '\\f': ss << \"\\\\f\"; break;\n            case '\\n': ss << \"\\\\n\"; break;\n            case '\\r': ss << \"\\\\r\"; break;\n            case '\\t': ss << \"\\\\t\"; break;\n            default: ss << *iter; break;\n            };\n        }\n\n        return ss.str();\n    }\n\n    std::string JSON::getString(void) const\n    {\n        return visit(\n            [](std::string const &visitedData)\n        {\n            return String::Format(\"\\\"{}\\\"\", escapeJsonString(visitedData));\n        },\n            [](JSON::Array const &visitedData)\n        {\n            std::stringstream stream;\n\n            stream << \"[ \";\n            bool writtenPrevious = false;\n            for (auto &index : visitedData)\n            {\n                if (writtenPrevious)\n                {\n                    stream << \", \";\n                }\n\n                stream << index.getString();\n                writtenPrevious = true;\n            }\n\n            stream << (std::empty(visitedData) ? \"]\" : \" ]\");\n            return stream.str();\n        },\n            [](JSON::Object const &visitedData)\n        {\n            std::stringstream stream;\n\n            stream << \"{ \";\n            bool writtenPrevious = false;\n            for (auto &index : visitedData)\n            {\n                if (writtenPrevious)\n                {\n                    stream << \", \";\n                }\n\n                stream << \"\\\"\" << index.first << \"\\\": \";\n                stream << index.second.getString();\n                writtenPrevious = true;\n            }\n\n            stream << (std::empty(visitedData) ? \"}\" : \" }\");\n            return stream.str();\n        },\n            [](auto && visitedData)\n        {\n            return String::Format(\"{}\", visitedData);\n        });\n    }\n\n    JSON const &JSON::getIndex(size_t index) const\n    {\n        if (auto value = std::get_if<Array>(&data))\n        {\n            return value->at(index);\n        }\n        else\n        {\n            return Empty;\n        }\n    }\n\n    JSON const &JSON::getMember(std::string_view name) const\n    {\n        if (auto value = std::get_if<Object>(&data))\n        {\n            auto search = value->find(name.data());\n            if (search == std::end(*value))\n            {\n                return Empty;\n            }\n            else\n            {\n                return search->second;\n            }\n        }\n        else\n        {\n            return Empty;\n        }\n    }\n\n    JSON &JSON::operator [] (size_t index)\n    {\n        if (!isType<Array>())\n        {\n            data = EmptyArray;\n        }\n\n        return std::get<Array>(data)[index];\n    }\n\n    JSON &JSON::operator [] (std::string_view name)\n    {\n        if (!isType<Object>())\n        {\n            data = EmptyObject;\n        }\n\n        return std::get<Object>(data)[name.data()];\n    }\n\n    Math::Float2 JSON::evaluate(ShuntingYard &shuntingYard, Math::Float2 const &defaultValue) const\n    {\n        auto data = asType(EmptyArray);\n        switch (data.size())\n        {\n        case 1:\n            return Math::Float2(data[0].evaluate(shuntingYard, 0.0f));\n\n        default:\n            return Math::Float2(\n                data[0].evaluate(shuntingYard, defaultValue.x),\n                data[1].evaluate(shuntingYard, defaultValue.y));\n        };\n    }\n\n    Math::Float3 JSON::evaluate(ShuntingYard &shuntingYard, Math::Float3 const &defaultValue) const\n    {\n        auto data = asType(EmptyArray);\n        switch (data.size())\n        {\n        case 1:\n            return Math::Float3(data[0].evaluate(shuntingYard, 0.0f));\n\n        case 3:\n            return Math::Float3(\n                data[0].evaluate(shuntingYard, defaultValue.x),\n                data[1].evaluate(shuntingYard, defaultValue.y),\n                data[2].evaluate(shuntingYard, defaultValue.z));\n\n        default:\n            return defaultValue;\n        };\n    }\n\n    Math::Float4 JSON::evaluate(ShuntingYard &shuntingYard, Math::Float4 const &defaultValue) const\n    {\n        auto data = asType(EmptyArray);\n        switch (data.size())\n        {\n        case 1:\n            return Math::Float4(data[0].evaluate(shuntingYard, 0.0f));\n\n        case 3:\n            return Math::Float4(\n                data[0].evaluate(shuntingYard, defaultValue.x),\n                data[1].evaluate(shuntingYard, defaultValue.y),\n                data[2].evaluate(shuntingYard, defaultValue.z),\n                defaultValue.w);\n\n        case 4:\n            return Math::Float4(\n                data[0].evaluate(shuntingYard, defaultValue.x),\n                data[1].evaluate(shuntingYard, defaultValue.y),\n                data[2].evaluate(shuntingYard, defaultValue.z),\n                data[3].evaluate(shuntingYard, defaultValue.w));\n\n        default:\n            return defaultValue;\n        };\n    }\n\n    Math::Quaternion JSON::evaluate(ShuntingYard &shuntingYard, Math::Quaternion const &defaultValue) const\n    {\n        auto data = asType(EmptyArray);\n        switch (data.size())\n        {\n        case 3:\n            if (true)\n            {\n                float pitch = data[0].evaluate(shuntingYard, Math::Infinity);\n                float yaw = data[1].evaluate(shuntingYard, Math::Infinity);\n                float roll = data[2].evaluate(shuntingYard, Math::Infinity);\n                if (pitch != Math::Infinity && yaw != Math::Infinity && roll != Math::Infinity)\n                {\n                    return Math::Quaternion::MakeEulerRotation(pitch, yaw, roll);\n                }\n\n                return defaultValue;\n            }\n\n        case 4:\n            return Math::Quaternion(\n                data[0].evaluate(shuntingYard, defaultValue.x),\n                data[1].evaluate(shuntingYard, defaultValue.y),\n                data[2].evaluate(shuntingYard, defaultValue.z),\n                data[3].evaluate(shuntingYard, defaultValue.w));\n\n        default:\n            return defaultValue;\n        };\n    }\n\n    std::string JSON::evaluate(ShuntingYard &shuntingYard, std::string const &defaultValue) const\n    {\n        return visit(\n            [](std::string const &visitedData)\n        {\n            return visitedData;\n        },\n            [defaultValue](Object const &visitedData)\n        {\n            return defaultValue;\n        },\n            [defaultValue](Array const &visitedData)\n        {\n            return defaultValue;\n        },\n            [defaultValue](auto const &visitedData)\n        {\n            return String::Format(\"{}\", GetValueOrDefault(visitedData, defaultValue));\n        });\n    }\n}; \/\/ namespace Gek\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include \"linesearch.h\"\n#include <algorithm>\n\nnamespace ncv\n{\n        namespace optimize\n        {\n                \/\/\/\n                \/\/\/ \\brief heuristics to initialize the step length,\n                \/\/\/     see \"Numerical optimization\", Nocedal & Wright, 2nd edition, p.59\n                \/\/\/\n                template\n                <\n                        typename tstate,\n\n                        typename tscalar = typename tstate::tscalar\n                >\n                class linesearch_init_t\n                {\n                public:\n\n                        \/\/\/\n                        \/\/\/ \\brief constructor\n                        \/\/\/\n                        explicit linesearch_init_t(ls_initializer type)\n                                :       m_type(type),\n                                        m_first(true),\n                                        m_prevf(0),\n                                        m_prevt0(1),\n                                        m_prevdg(1)\n                        {\n                        }\n\n                        \/\/\/\n                        \/\/\/ \\brief compute the initial step length\n                        \/\/\/\n                        tscalar operator()(const tstate& cstate)\n                        {\n                                const tscalar unit = tscalar(1.0);\n\n                                tscalar t0 = unit;\n\n                                if (m_first)\n                                {\n                                        \/\/ following CG_DESCENT's initial procedure ...\n                                        const tscalar phi0(0.01);\n\n                                        const tscalar xnorm = cstate.x.template lpNorm<Eigen::Infinity>();\n                                        const tscalar fnorm = std::fabs(cstate.f);\n\n                                        if (xnorm > 0)\n                                        {\n                                                t0 = phi0 * xnorm \/ cstate.g.template lpNorm<Eigen::Infinity>();\n                                        }\n                                        else if (fnorm > 0)\n                                        {\n                                                t0 = phi0 * fnorm \/ cstate.g.squaredNorm();\n                                        }\n                                        else\n                                        {\n                                                t0 = unit;\n                                        }\n                                }\n\n                                else\n                                {\n                                        switch (m_type)\n                                        {\n                                        case ls_initializer::consistent:\n                                                {\n                                                        const tscalar dg = cstate.d.dot(cstate.g);\n\n                                                        t0 =    m_first ? unit :\n                                                                (m_prevt0 * m_prevdg \/ dg);\n\n                                                        m_prevdg = dg;\n                                                        m_prevt0 = t0;\n                                                }\n                                                break;\n\n                                        case ls_initializer::quadratic:\n                                                {\n                                                        const tscalar dg = cstate.d.dot(cstate.g);\n\n                                                        t0 =    m_first ? unit :\n                                                                std::min(unit, tscalar(1.01 * 2.0 * (cstate.f - m_prevf) \/ dg));\n\n                                                        m_prevf = cstate.f;\n                                                }\n                                                break;\n\n                                        case ls_initializer::unit:\n                                        default:\n                                                t0 = unit;\n                                                break;\n                                        }\n                                }\n\n                                \/\/ OK\n                                m_first = false;\n                                return t0;\n                        }\n\n                private:\n\n                        ls_initializer  m_type;\n                        bool            m_first;        \/\/\/< check if first iteration\n                        tscalar         m_prevf;        \/\/\/< previous function evaluation\n                        tscalar         m_prevt0;       \/\/\/< previous step length\n                        tscalar         m_prevdg;       \/\/\/< previous direction dot product\n                };\n        }\n}\n\n<commit_msg>fix initialization (store previous state)<commit_after>#pragma once\n\n#include \"linesearch.h\"\n#include <algorithm>\n\nnamespace ncv\n{\n        namespace optimize\n        {\n                \/\/\/\n                \/\/\/ \\brief heuristics to initialize the step length,\n                \/\/\/     see \"Numerical optimization\", Nocedal & Wright, 2nd edition, p.59\n                \/\/\/\n                template\n                <\n                        typename tstate,\n\n                        typename tscalar = typename tstate::tscalar\n                >\n                class linesearch_init_t\n                {\n                public:\n\n                        \/\/\/\n                        \/\/\/ \\brief constructor\n                        \/\/\/\n                        explicit linesearch_init_t(ls_initializer type)\n                                :       m_type(type),\n                                        m_first(true),\n                                        m_prevf(0),\n                                        m_prevt0(1),\n                                        m_prevdg(1)\n                        {\n                        }\n\n                        \/\/\/\n                        \/\/\/ \\brief compute the initial step length\n                        \/\/\/\n                        tscalar operator()(const tstate& cstate)\n                        {\n                                const tscalar unit = tscalar(1.0);\n\n                                tscalar t0 = unit;\n\n                                if (m_first)\n                                {\n                                        \/\/ following CG_DESCENT's initial procedure ...\n                                        const tscalar phi0(0.01);\n\n                                        const tscalar xnorm = cstate.x.template lpNorm<Eigen::Infinity>();\n                                        const tscalar fnorm = std::fabs(cstate.f);\n\n                                        if (xnorm > 0)\n                                        {\n                                                t0 = phi0 * xnorm \/ cstate.g.template lpNorm<Eigen::Infinity>();\n                                        }\n                                        else if (fnorm > 0)\n                                        {\n                                                t0 = phi0 * fnorm \/ cstate.g.squaredNorm();\n                                        }\n                                        else\n                                        {\n                                                t0 = unit;\n                                        }\n\n                                        \/\/ also, keep track of previous direction\n                                        switch (m_type)\n                                        {\n                                        case ls_initializer::consistent:\n                                                m_prevdg = cstate.d.dot(cstate.g);\n                                                break;\n\n                                        default:\n                                                break;\n                                        }\n                                }\n\n                                else\n                                {\n                                        switch (m_type)\n                                        {\n                                        case ls_initializer::consistent:\n                                                {\n                                                        const tscalar dg = cstate.d.dot(cstate.g);\n\n                                                        t0 = (m_prevt0 * m_prevdg \/ dg);\n\n                                                        m_prevdg = dg;\n                                                }\n                                                break;\n\n                                        case ls_initializer::quadratic:\n                                                {\n                                                        const tscalar dg = cstate.d.dot(cstate.g);\n                                                        const tscalar ro = tscalar(1.01 * 2.0);\n\n                                                        t0 = std::min(unit, ro * (cstate.f - m_prevf) \/ dg);\n                                                }\n                                                break;\n\n                                        case ls_initializer::unit:\n                                        default:\n                                                t0 = unit;\n                                                break;\n                                        }\n                                }\n\n                                \/\/ OK, keep track of previous function value & step length\n                                m_first = false;\n                                m_prevf = cstate.f;\n                                m_prevt0 = t0;\n                                return t0;\n                        }\n\n                private:\n\n                        ls_initializer  m_type;\n                        bool            m_first;        \/\/\/< check if first iteration\n                        tscalar         m_prevf;        \/\/\/< previous function evaluation\n                        tscalar         m_prevt0;       \/\/\/< previous step length\n                        tscalar         m_prevdg;       \/\/\/< previous direction dot product\n                };\n        }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"Pegmatite\/pegmatite.hh\"\nnamespace Parser\n{\n\tusing pegmatite::Rule;\n\tusing pegmatite::operator\"\"_E;\n\tusing pegmatite::operator\"\"_S;\n\tusing pegmatite::ExprPtr;\n\tusing pegmatite::BindAST;\n\tusing pegmatite::any;\n\tusing pegmatite::nl;\n\tusing pegmatite::trace;\n\n\/**\n * Grammar for the MysoreScript language.\n *\/\nstruct MysoreScriptGrammar\n{\n\t\/**\n\t * Whitespace: spaces, tabs, newlines\n\t *\/\n\tRule whitespace  = ' '_E | '\\t' | nl('\\n');\n\t\/**\n\t * Comments, including tracking newlines inside comments via the\n\t * whitespace rule.\n\t *\/\n\tRule comment     = (\"\/*\"_E >>\n\t                   (*(!ExprPtr(\"*\/\") >> (nl('\\n') | any()))) >>\n\t                   \"*\/\") |\n\t                   \"\/\/\"_E >> *(!(ExprPtr(\"\\n\")) >> any()) >> nl('\\n');\n\t\/**\n\t * Rule for treating both comments and whitespace as ignored tokens.\n\t *\/\n\tRule ignored     = *(comment | whitespace);\n\t\/**\n\t * Digits are things in the range 0-9.\n\t *\/\n\tExprPtr digit = '0'_E - '9';\n\t\/**\n\t * Numbers are one or more digits, optionally followed by a decimal point,\n\t * and one or more digits, optionally followed by an exponent (which may\n\t * also be negative.\n\t *\/\n\tRule num    = +digit >> -('.'_E >> +digit >> -(\"eE\"_S >> -(\"+-\"_S) >> +digit));\n\t\/**\n\t * Values are either numbers or expressions in brackets (highest precedence).\n\t *\/\n\tRule val    = num |  '(' >> arith_expr >> ')';\n\t\/**\n\t * Multiply operations are values or multiply, or divide operations,\n\t * followed by a multiply symbol, followed by a value.  The sides can never\n\t * be add or subtract operations, because they have lower precedence and so\n\t * can only be parents of multiply or divide operations (or children via\n\t * parenthetical expressions), not direct children.\n\t *\/\n\tRule mul_op = mul >> '*' >> val;\n\t\/**\n\t * Divide operations follow the same syntax as multiply.\n\t *\/\n\tRule div_op = mul >> '\/' >> val;\n\t\/**\n\t * Multiply-precedence operations are either multiply or divide operations,\n\t * or simple values (numbers of parenthetical expressions).\n\t *\/\n\tRule mul    = mul_op | div_op | val;\n\t\/**\n\t * Add operations can have any expression on the left (including other add\n\t * expressions), but only higher-precedence operations on the right.\n\t *\/\n\tRule add_op = arith_expr >> '+' >> arith_expr;\n\t\/**\n\t * Subtract operations follow the same structure as add.\n\t *\/\n\tRule sub_op = arith_expr >> '-' >> arith_expr;\n\t\/**\n\t * Not-equal comparison.\n\t *\/\n\tRule ne_cmp = arith_expr >> \"!=\" >> arith_expr;\n\t\/**\n\t * Equal comparison.\n\t *\/\n\tRule eq_cmp = arith_expr >> \"==\" >> arith_expr;\n\t\/**\n\t * Less-than comparison.\n\t *\/\n\tRule lt_cmp = arith_expr >> '<' >> arith_expr;\n\t\/**\n\t * Greater-than comparison.\n\t *\/\n\tRule gt_cmp = arith_expr >> '>' >> arith_expr;\n\t\/**\n\t * Less-than-or-equal comparison.\n\t *\/\n\tRule le_cmp = arith_expr >> \">=\" >> arith_expr;\n\t\/**\n\t * Greater-than-or-equal comparison.\n\t *\/\n\tRule ge_cmp = arith_expr >> \"<=\" >> arith_expr;\n\t\/**\n\t * General rule for comparisons.  Matches one of the comparison types above.\n\t *\/\n\tRule cmp    = eq_cmp | ne_cmp | lt_cmp | gt_cmp | le_cmp | ge_cmp;\n\t\/**\n\t * Expressions can be any of the other types.\n\t *\/\n\tRule arith_expr   = add_op | sub_op | mul | cmp | expression;\n\t\/**\n\t * A character in a string.  Matches anything except the closing quote.\n\t *\/\n\tExprPtr character = term((\"\\\\\\\"\"_E | !ExprPtr('\"') >> (nl('\\n') | any())));\n\t\/**\n\t * The body of a string.  An AST builder can use this to get just the\n\t * characters in the string, without the enclosing quotes.\n\t *\/\n\tRule string_body      = *character;\n\t\/**\n\t * Strings any characters, enclosed in quotes.\n\t *\/\n\tRule string  = term('\"' >> string_body >> '\"');\n\t\/**\n\t * Letters - valid characters for the start of an identifier.\n\t *\/\n\tExprPtr letter    = (('a'_E - 'z') | ('A'_E - 'Z'));\n\t\/**\n\t * Identifiers are a letter followed by zero or more alphanumeric\n\t * characters.\n\t *\/\n\tRule identifier   = term(letter >> *(letter | digit));\n\t\/**\n\t * Argument list.  Zero or more comma-separated arguments, wrapped in\n\t * brackets.\n\t *\/\n\tRule argList      = '('_E >> -(identifier >> *(',' >> identifier)) >> ')';\n\t\/**\n\t * A closure starts with the keyword 'func', followed by a function name, a\n\t * list of arguments in brackets and a list of statements in braces.\n\t *\/\n\tRule closure      = \"func\"_E  >> identifier >> argList >>\n\t                    '{' >> statements >> '}';\n\t\/**\n\t * Variable references are single identifiers.\n\t *\/\n\tRule variable     = identifier;\n\t\/**\n\t * Assignments are variables, followed by a single equals sign, and then the\n\t * expression to assign to the variable.\n\t *\/\n\tRule assignment   = variable >> '=' >> expression;\n\t\/**\n\t * The argument list for a call.  This is a separate rule to allow automatic\n\t * AST construction to distinguish between the expressions that are part of\n\t * the argument list from others in the call.\n\t *\/\n\tRule callArgList  = '('_E >> -(expression >> *(',' >> expression)) >> ')';\n\t\/**\n\t * A call is something that is callable, followed eventually by an argument\n\t * list.  If the callable expression is followed by a dot and a method name,\n\t * then this is a method invocation, otherwise the expression on the left is\n\t * assumed to be a closure and is invoked directly.\n\t *\/\n\tRule call         = callable >> -('.'_E >> identifier) >> callArgList;\n\t\/**\n\t * Callable expression.  This is the same as an expression, but with the\n\t * call at the end so that each of the other possibilities will be tried\n\t * before hitting left recursion.\n\t *\/\n\tRule callable     = closure | newExpr | arith_expr | variable | string |\n\t                    call;\n\t\/**\n\t * All of the valid kinds of expression.  Note that the order places calls\n\t * first, as greedy matching will try cause them to then be matched in the\n\t * `callable` order (which places call last) and then parse the argument\n\t * list, but would just successfully parse an expression and stop if call\n\t * were not first here.  Note also that expression types that start with a\n\t * keyword are placed before those that (may) begin with identifiers so that\n\t * we can trivially disambiguate these cases.\n\t *\/\n\tRule expression   = call | closure | newExpr | arith_expr | variable |\n\t                    string;\n\t\/**\n\t * A `new` expression: the keyword new followed by a class name.\n\t *\/\n\tRule newExpr      = \"new\"_E >> identifier;\n\t\/**\n\t * A variable declaration, optionally with an initialiser.\n\t *\/\n\tRule decl         = \"var\"_E >> identifier >> -('='_E >> expression) >> ';';\n\t\/**\n\t * A return statement.\n\t *\/\n\tRule ret          = \"return\"_E >> expression >> ';';\n\t\/**\n\t * An if statement, with a condition in brackets followed by the body in\n\t * braces.\n\t *\/\n\tRule ifStatement  = \"if\"_E >> '(' >> expression >> ')' >>\n\t                    '{' >> statements >> '}';\n\t\/**\n\t * A while loop, with the condition in brackets followed by the body in\n\t * braces.\n\t *\/\n\tRule whileLoop    = \"while\"_E >> '(' >> expression >> ')' >>\n\t                    '{' >> statements >> '}';\n\t\/**\n\t * Classes are the keyword class, followed by the class name and optionally\n\t * a superclass.  Instance variables must be declared first, then methods.\n\t *\/\n\tRule cls          = \"class\"_E >> identifier >> -(':'_E >> identifier) >> '{'\n\t                     >> *decl >> *closure >> '}';\n\t\/**\n\t * All valid statement types.  Statements that are disambiguated by keywords\n\t * are first.  All expressions are valid statements.\n\t *\/\n\tRule statement    = cls | ret | ifStatement | whileLoop | decl |\n\t                    ((assignment | expression) >> ';');\n\t\/**\n\t * A list of statements: the top-level for programs in this grammar.\n\t *\/\n\tRule statements   = *(statement);\n\t\/**\n\t * Returns a singleton instance of this grammar.\n\t *\/\n\tstatic const MysoreScriptGrammar& get()\n\t{\n\t\tstatic MysoreScriptGrammar g;\n\t\treturn g;\n\t}\n\tprivate:\n\t\/**\n\t * Private constructor.  This class is immutable, and so only the `get()`\n\t * method should be used to return the singleton instance.\n\t *\/\n\tMysoreScriptGrammar() {};\n};\n}\n\n<commit_msg>Fix symbols for >= and <=<commit_after>#include \"Pegmatite\/pegmatite.hh\"\nnamespace Parser\n{\n\tusing pegmatite::Rule;\n\tusing pegmatite::operator\"\"_E;\n\tusing pegmatite::operator\"\"_S;\n\tusing pegmatite::ExprPtr;\n\tusing pegmatite::BindAST;\n\tusing pegmatite::any;\n\tusing pegmatite::nl;\n\tusing pegmatite::trace;\n\n\/**\n * Grammar for the MysoreScript language.\n *\/\nstruct MysoreScriptGrammar\n{\n\t\/**\n\t * Whitespace: spaces, tabs, newlines\n\t *\/\n\tRule whitespace  = ' '_E | '\\t' | nl('\\n');\n\t\/**\n\t * Comments, including tracking newlines inside comments via the\n\t * whitespace rule.\n\t *\/\n\tRule comment     = (\"\/*\"_E >>\n\t                   (*(!ExprPtr(\"*\/\") >> (nl('\\n') | any()))) >>\n\t                   \"*\/\") |\n\t                   \"\/\/\"_E >> *(!(ExprPtr(\"\\n\")) >> any()) >> nl('\\n');\n\t\/**\n\t * Rule for treating both comments and whitespace as ignored tokens.\n\t *\/\n\tRule ignored     = *(comment | whitespace);\n\t\/**\n\t * Digits are things in the range 0-9.\n\t *\/\n\tExprPtr digit = '0'_E - '9';\n\t\/**\n\t * Numbers are one or more digits, optionally followed by a decimal point,\n\t * and one or more digits, optionally followed by an exponent (which may\n\t * also be negative.\n\t *\/\n\tRule num    = +digit >> -('.'_E >> +digit >> -(\"eE\"_S >> -(\"+-\"_S) >> +digit));\n\t\/**\n\t * Values are either numbers or expressions in brackets (highest precedence).\n\t *\/\n\tRule val    = num |  '(' >> arith_expr >> ')';\n\t\/**\n\t * Multiply operations are values or multiply, or divide operations,\n\t * followed by a multiply symbol, followed by a value.  The sides can never\n\t * be add or subtract operations, because they have lower precedence and so\n\t * can only be parents of multiply or divide operations (or children via\n\t * parenthetical expressions), not direct children.\n\t *\/\n\tRule mul_op = mul >> '*' >> val;\n\t\/**\n\t * Divide operations follow the same syntax as multiply.\n\t *\/\n\tRule div_op = mul >> '\/' >> val;\n\t\/**\n\t * Multiply-precedence operations are either multiply or divide operations,\n\t * or simple values (numbers of parenthetical expressions).\n\t *\/\n\tRule mul    = mul_op | div_op | val;\n\t\/**\n\t * Add operations can have any expression on the left (including other add\n\t * expressions), but only higher-precedence operations on the right.\n\t *\/\n\tRule add_op = arith_expr >> '+' >> arith_expr;\n\t\/**\n\t * Subtract operations follow the same structure as add.\n\t *\/\n\tRule sub_op = arith_expr >> '-' >> arith_expr;\n\t\/**\n\t * Not-equal comparison.\n\t *\/\n\tRule ne_cmp = arith_expr >> \"!=\" >> arith_expr;\n\t\/**\n\t * Equal comparison.\n\t *\/\n\tRule eq_cmp = arith_expr >> \"==\" >> arith_expr;\n\t\/**\n\t * Less-than comparison.\n\t *\/\n\tRule lt_cmp = arith_expr >> '<' >> arith_expr;\n\t\/**\n\t * Greater-than comparison.\n\t *\/\n\tRule gt_cmp = arith_expr >> '>' >> arith_expr;\n\t\/**\n\t * Less-than-or-equal comparison.\n\t *\/\n\tRule le_cmp = arith_expr >> \"<=\" >> arith_expr;\n\t\/**\n\t * Greater-than-or-equal comparison.\n\t *\/\n\tRule ge_cmp = arith_expr >> \">=\" >> arith_expr;\n\t\/**\n\t * General rule for comparisons.  Matches one of the comparison types above.\n\t *\/\n\tRule cmp    = eq_cmp | ne_cmp | lt_cmp | gt_cmp | le_cmp | ge_cmp;\n\t\/**\n\t * Expressions can be any of the other types.\n\t *\/\n\tRule arith_expr   = add_op | sub_op | mul | cmp | expression;\n\t\/**\n\t * A character in a string.  Matches anything except the closing quote.\n\t *\/\n\tExprPtr character = term((\"\\\\\\\"\"_E | !ExprPtr('\"') >> (nl('\\n') | any())));\n\t\/**\n\t * The body of a string.  An AST builder can use this to get just the\n\t * characters in the string, without the enclosing quotes.\n\t *\/\n\tRule string_body      = *character;\n\t\/**\n\t * Strings any characters, enclosed in quotes.\n\t *\/\n\tRule string  = term('\"' >> string_body >> '\"');\n\t\/**\n\t * Letters - valid characters for the start of an identifier.\n\t *\/\n\tExprPtr letter    = (('a'_E - 'z') | ('A'_E - 'Z'));\n\t\/**\n\t * Identifiers are a letter followed by zero or more alphanumeric\n\t * characters.\n\t *\/\n\tRule identifier   = term(letter >> *(letter | digit));\n\t\/**\n\t * Argument list.  Zero or more comma-separated arguments, wrapped in\n\t * brackets.\n\t *\/\n\tRule argList      = '('_E >> -(identifier >> *(',' >> identifier)) >> ')';\n\t\/**\n\t * A closure starts with the keyword 'func', followed by a function name, a\n\t * list of arguments in brackets and a list of statements in braces.\n\t *\/\n\tRule closure      = \"func\"_E  >> identifier >> argList >>\n\t                    '{' >> statements >> '}';\n\t\/**\n\t * Variable references are single identifiers.\n\t *\/\n\tRule variable     = identifier;\n\t\/**\n\t * Assignments are variables, followed by a single equals sign, and then the\n\t * expression to assign to the variable.\n\t *\/\n\tRule assignment   = variable >> '=' >> expression;\n\t\/**\n\t * The argument list for a call.  This is a separate rule to allow automatic\n\t * AST construction to distinguish between the expressions that are part of\n\t * the argument list from others in the call.\n\t *\/\n\tRule callArgList  = '('_E >> -(expression >> *(',' >> expression)) >> ')';\n\t\/**\n\t * A call is something that is callable, followed eventually by an argument\n\t * list.  If the callable expression is followed by a dot and a method name,\n\t * then this is a method invocation, otherwise the expression on the left is\n\t * assumed to be a closure and is invoked directly.\n\t *\/\n\tRule call         = callable >> -('.'_E >> identifier) >> callArgList;\n\t\/**\n\t * Callable expression.  This is the same as an expression, but with the\n\t * call at the end so that each of the other possibilities will be tried\n\t * before hitting left recursion.\n\t *\/\n\tRule callable     = closure | newExpr | arith_expr | variable | string |\n\t                    call;\n\t\/**\n\t * All of the valid kinds of expression.  Note that the order places calls\n\t * first, as greedy matching will try cause them to then be matched in the\n\t * `callable` order (which places call last) and then parse the argument\n\t * list, but would just successfully parse an expression and stop if call\n\t * were not first here.  Note also that expression types that start with a\n\t * keyword are placed before those that (may) begin with identifiers so that\n\t * we can trivially disambiguate these cases.\n\t *\/\n\tRule expression   = call | closure | newExpr | arith_expr | variable |\n\t                    string;\n\t\/**\n\t * A `new` expression: the keyword new followed by a class name.\n\t *\/\n\tRule newExpr      = \"new\"_E >> identifier;\n\t\/**\n\t * A variable declaration, optionally with an initialiser.\n\t *\/\n\tRule decl         = \"var\"_E >> identifier >> -('='_E >> expression) >> ';';\n\t\/**\n\t * A return statement.\n\t *\/\n\tRule ret          = \"return\"_E >> expression >> ';';\n\t\/**\n\t * An if statement, with a condition in brackets followed by the body in\n\t * braces.\n\t *\/\n\tRule ifStatement  = \"if\"_E >> '(' >> expression >> ')' >>\n\t                    '{' >> statements >> '}';\n\t\/**\n\t * A while loop, with the condition in brackets followed by the body in\n\t * braces.\n\t *\/\n\tRule whileLoop    = \"while\"_E >> '(' >> expression >> ')' >>\n\t                    '{' >> statements >> '}';\n\t\/**\n\t * Classes are the keyword class, followed by the class name and optionally\n\t * a superclass.  Instance variables must be declared first, then methods.\n\t *\/\n\tRule cls          = \"class\"_E >> identifier >> -(':'_E >> identifier) >> '{'\n\t                     >> *decl >> *closure >> '}';\n\t\/**\n\t * All valid statement types.  Statements that are disambiguated by keywords\n\t * are first.  All expressions are valid statements.\n\t *\/\n\tRule statement    = cls | ret | ifStatement | whileLoop | decl |\n\t                    ((assignment | expression) >> ';');\n\t\/**\n\t * A list of statements: the top-level for programs in this grammar.\n\t *\/\n\tRule statements   = *(statement);\n\t\/**\n\t * Returns a singleton instance of this grammar.\n\t *\/\n\tstatic const MysoreScriptGrammar& get()\n\t{\n\t\tstatic MysoreScriptGrammar g;\n\t\treturn g;\n\t}\n\tprivate:\n\t\/**\n\t * Private constructor.  This class is immutable, and so only the `get()`\n\t * method should be used to return the singleton instance.\n\t *\/\n\tMysoreScriptGrammar() {};\n};\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/* mbed Microcontroller Library\n * Copyright (c) 2018 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#include \"DeviceKey.h\"\n#include \"mbedtls\/config.h\"\n#include \"mbedtls\/cmac.h\"\n#include \"nvstore.h\"\n#include \"trng_api.h\"\n#include \"mbed_wait_api.h\"\n#include \"stdlib.h\"\n\n#if !defined(MBEDTLS_CMAC_C)\n#error [NOT_SUPPORTED] MBEDTLS_CMAC_C needs to be enabled for this driver\n#else\n\n#if NVSTORE_ENABLED\n\nnamespace mbed {\n\n#define DEVKEY_WRITE_UINT32_LE( dst, src )                              \\\n    do                                                                  \\\n    {                                                                   \\\n        (dst)[0] = ( (src) >> 0 ) & 0xFF;                               \\\n        (dst)[1] = ( (src) >> 8 ) & 0xFF;                               \\\n        (dst)[2] = ( (src) >> 16 ) & 0xFF;                              \\\n        (dst)[3] = ( (src) >> 24 ) & 0xFF;                              \\\n    } while( 0 )\n\n#define DEVKEY_WRITE_UINT8_LE( dst, src )                               \\\n    do                                                                  \\\n    {                                                                   \\\n        (dst)[0] = (src) & 0xFF;                                        \\\n    } while( 0 )\n\n\nDeviceKey::DeviceKey()\n{\n    return;\n}\n\nDeviceKey::~DeviceKey()\n{\n    return;\n}\n\nint DeviceKey::generate_derived_key(const unsigned char *salt, size_t isalt_size, unsigned char *output,\n                                    uint16_t ikey_type)\n{\n    uint32_t key_buff[DEVICE_KEY_32BYTE \/ sizeof(uint32_t)];\n    size_t actual_size = DEVICE_KEY_32BYTE;\n\n    if (DEVICE_KEY_16BYTE != ikey_type && DEVICE_KEY_32BYTE != ikey_type) {\n        return DEVICEKEY_INVALID_KEY_TYPE;\n    }\n\n    \/\/First try to read the key from NVStore\n    int ret = read_key_from_nvstore(key_buff, actual_size);\n    if (DEVICEKEY_SUCCESS != ret && DEVICEKEY_NOT_FOUND != ret) {\n        return ret;\n    }\n\n    if (DEVICE_KEY_16BYTE != actual_size && DEVICE_KEY_32BYTE != actual_size) {\n        return DEVICEKEY_READ_FAILED;\n    }\n\n    \/\/If the key was not found in NVStore we will create it by using TRNG and then save it to NVStore\n    if (DEVICEKEY_NOT_FOUND == ret) {\n        ret = generate_key_by_trng(key_buff, actual_size);\n        if (DEVICEKEY_SUCCESS != ret) {\n            return ret;\n        }\n\n        ret = device_inject_root_of_trust(key_buff, actual_size);\n        if (DEVICEKEY_SUCCESS != ret) {\n            return ret;\n        }\n    }\n\n    ret = get_derived_key(key_buff, actual_size, salt, isalt_size, output, ikey_type);\n    return ret;\n}\n\nint DeviceKey::device_inject_root_of_trust(uint32_t *value, size_t isize)\n{\n    return write_key_to_nvstore(value, isize);\n}\n\nint DeviceKey::write_key_to_nvstore(uint32_t *input, size_t isize)\n{\n    if (DEVICE_KEY_16BYTE != isize && DEVICE_KEY_32BYTE != isize) {\n        return DEVICEKEY_INVALID_KEY_SIZE;\n    }\n\n    \/\/First we read if key exist. If it is exists, we return DEVICEKEY_ALREADY_EXIST error\n    uint32_t read_key[DEVICE_KEY_32BYTE \/ sizeof(uint32_t)] = {0};\n    size_t read_size = DEVICE_KEY_32BYTE;\n    int ret = read_key_from_nvstore(read_key, read_size);\n    if (DEVICEKEY_SUCCESS == ret) {\n        return DEVICEKEY_ALREADY_EXIST;\n    }\n    if (DEVICEKEY_NOT_FOUND != ret) {\n        return ret;\n    }\n\n    NVStore& nvstore = NVStore::get_instance();\n    ret = nvstore.set(NVSTORE_DEVICEKEY_KEY, (uint16_t)isize, input);\n    if (NVSTORE_WRITE_ERROR == ret || NVSTORE_BUFF_TOO_SMALL == ret) {\n        return DEVICEKEY_SAVE_FAILED;\n    }\n\n    if (NVSTORE_SUCCESS != ret) {\n        return DEVICEKEY_NVSTORE_UNPREDICTED_ERROR;\n    }\n\n    return DEVICEKEY_SUCCESS;\n}\n\nint DeviceKey::read_key_from_nvstore(uint32_t *output, size_t& size)\n{\n    if (size > UINT16_MAX) {\n        return DEVICEKEY_INVALID_PARAM;\n    }\n\n    uint16_t in_size = size;\n    uint16_t out_size = 0;\n    NVStore& nvstore = NVStore::get_instance();\n    int nvStatus = nvstore.get(NVSTORE_DEVICEKEY_KEY, in_size, output, out_size);\n    if (NVSTORE_NOT_FOUND == nvStatus) {\n        return DEVICEKEY_NOT_FOUND;\n    }\n\n    if (NVSTORE_READ_ERROR == nvStatus || NVSTORE_BUFF_TOO_SMALL == nvStatus) {\n        return DEVICEKEY_READ_FAILED;\n    }\n\n    if (NVSTORE_SUCCESS != nvStatus) {\n        return DEVICEKEY_NVSTORE_UNPREDICTED_ERROR;\n    }\n\n    size = out_size;\n    return DEVICEKEY_SUCCESS;\n}\n\nint DeviceKey::get_derived_key(uint32_t *ikey_buff, size_t ikey_size, const unsigned char *isalt,\n                               size_t isalt_size, unsigned char *output, uint32_t ikey_type)\n{\n    \/\/KDF in counter mode implementation as described in Section 5.1\n    \/\/of NIST SP 800-108, Recommendation for Key Derivation Using Pseudorandom Functions\n    int ret;\n    size_t counter = 0;\n    char separator = 0x00;\n    mbedtls_cipher_context_t ctx;\n    unsigned char output_len_enc[ 4 ] = {0};\n    unsigned char counter_enc[ 1 ] = {0};\n\n    DEVKEY_WRITE_UINT32_LE(output_len_enc, ikey_type);\n\n    mbedtls_cipher_type_t mbedtls_cipher_type = MBEDTLS_CIPHER_AES_128_ECB;\n    if (DEVICE_KEY_32BYTE == ikey_size) {\n        mbedtls_cipher_type = MBEDTLS_CIPHER_AES_256_ECB;\n    }\n\n    const mbedtls_cipher_info_t *cipher_info = mbedtls_cipher_info_from_type(mbedtls_cipher_type);\n\n    mbedtls_cipher_init(&ctx);\n    ret = mbedtls_cipher_setup(&ctx, cipher_info);\n    if (ret != 0) {\n        goto finish;\n    }\n\n    do {\n\n        ret = mbedtls_cipher_cmac_starts(&ctx, (unsigned char *)ikey_buff, ikey_size * 8);\n        if (ret != 0) {\n            goto finish;\n        }\n\n        DEVKEY_WRITE_UINT8_LE(counter_enc, (counter+1));\n\n        ret = mbedtls_cipher_cmac_update(&ctx, (unsigned char *)counter_enc, sizeof(counter_enc));\n        if (ret != 0) {\n            goto finish;\n        }\n\n        ret = mbedtls_cipher_cmac_update(&ctx, isalt, isalt_size);\n        if (ret != 0) {\n            goto finish;\n        }\n\n        ret = mbedtls_cipher_cmac_update(&ctx, (unsigned char *)&separator, sizeof(char));\n        if (ret != 0) {\n            goto finish;\n        }\n\n        ret = mbedtls_cipher_cmac_update(&ctx, (unsigned char *)&output_len_enc, sizeof(output_len_enc));\n        if (ret != 0) {\n            goto finish;\n        }\n\n        ret = mbedtls_cipher_cmac_finish(&ctx, output + (DEVICE_KEY_16BYTE * (counter)));\n        if (ret != 0) {\n            goto finish;\n        }\n\n        counter++;\n\n    } while (DEVICE_KEY_16BYTE * counter < ikey_type);\n\nfinish:\n    mbedtls_cipher_free( &ctx );\n\n    if (DEVICEKEY_SUCCESS != ret) {\n        return DEVICEKEY_ERR_CMAC_GENERIC_FAILURE;\n    }\n\n    return DEVICEKEY_SUCCESS;\n}\n\nint DeviceKey::generate_key_by_trng(uint32_t *output, size_t size)\n{\n#if defined(DEVICE_TRNG)\n    size_t in_size;\n    size_t ongoing_size;\n    size_t final_size;\n    trng_t trng_obj;\n    int ret = DEVICEKEY_SUCCESS;\n    unsigned char *pBuffer = (unsigned char *)output;\n\n    memset(output, 0, size);\n\n    if (DEVICE_KEY_16BYTE > size) {\n        return DEVICEKEY_BUFFER_TOO_SMALL;\n    } else if (DEVICE_KEY_16BYTE != size && DEVICE_KEY_32BYTE != size) {\n        return DEVICEKEY_INVALID_PARAM;\n    }\n\n    trng_init(&trng_obj);\n\n    in_size = size;\n    while (in_size > 0) {\n\n        ongoing_size = 0;\n        ret = trng_get_bytes(&trng_obj, (unsigned char *)pBuffer, in_size, &ongoing_size);\n        if (0 != ret || ongoing_size > in_size) {\n            ret = DEVICEKEY_TRNG_ERROR;\n            goto finish;\n        }\n\n        pBuffer += ongoing_size;\n        in_size -= ongoing_size;\n    }\n\n    ret = DEVICEKEY_SUCCESS;\n\nfinish:\n    trng_free(&trng_obj);\n    size = final_size;\n    return ret;\n\n#else\n    return DEVICEKEY_NO_KEY_INJECTED;\n#endif\n}\n\n} \/\/ namespace mbed\n\n#endif \/\/NVSTORE_ENABLED\n#endif\n\n\n<commit_msg>Remove uneeded variables<commit_after>\/* mbed Microcontroller Library\n * Copyright (c) 2018 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#include \"DeviceKey.h\"\n#include \"mbedtls\/config.h\"\n#include \"mbedtls\/cmac.h\"\n#include \"nvstore.h\"\n#include \"trng_api.h\"\n#include \"mbed_wait_api.h\"\n#include \"stdlib.h\"\n\n#if !defined(MBEDTLS_CMAC_C)\n#error [NOT_SUPPORTED] MBEDTLS_CMAC_C needs to be enabled for this driver\n#else\n\n#if NVSTORE_ENABLED\n\nnamespace mbed {\n\n#define DEVKEY_WRITE_UINT32_LE( dst, src )                              \\\n    do                                                                  \\\n    {                                                                   \\\n        (dst)[0] = ( (src) >> 0 ) & 0xFF;                               \\\n        (dst)[1] = ( (src) >> 8 ) & 0xFF;                               \\\n        (dst)[2] = ( (src) >> 16 ) & 0xFF;                              \\\n        (dst)[3] = ( (src) >> 24 ) & 0xFF;                              \\\n    } while( 0 )\n\n#define DEVKEY_WRITE_UINT8_LE( dst, src )                               \\\n    do                                                                  \\\n    {                                                                   \\\n        (dst)[0] = (src) & 0xFF;                                        \\\n    } while( 0 )\n\n\nDeviceKey::DeviceKey()\n{\n    return;\n}\n\nDeviceKey::~DeviceKey()\n{\n    return;\n}\n\nint DeviceKey::generate_derived_key(const unsigned char *salt, size_t isalt_size, unsigned char *output,\n                                    uint16_t ikey_type)\n{\n    uint32_t key_buff[DEVICE_KEY_32BYTE \/ sizeof(uint32_t)];\n    size_t actual_size = DEVICE_KEY_32BYTE;\n\n    if (DEVICE_KEY_16BYTE != ikey_type && DEVICE_KEY_32BYTE != ikey_type) {\n        return DEVICEKEY_INVALID_KEY_TYPE;\n    }\n\n    \/\/First try to read the key from NVStore\n    int ret = read_key_from_nvstore(key_buff, actual_size);\n    if (DEVICEKEY_SUCCESS != ret && DEVICEKEY_NOT_FOUND != ret) {\n        return ret;\n    }\n\n    if (DEVICE_KEY_16BYTE != actual_size && DEVICE_KEY_32BYTE != actual_size) {\n        return DEVICEKEY_READ_FAILED;\n    }\n\n    \/\/If the key was not found in NVStore we will create it by using TRNG and then save it to NVStore\n    if (DEVICEKEY_NOT_FOUND == ret) {\n        ret = generate_key_by_trng(key_buff, actual_size);\n        if (DEVICEKEY_SUCCESS != ret) {\n            return ret;\n        }\n\n        ret = device_inject_root_of_trust(key_buff, actual_size);\n        if (DEVICEKEY_SUCCESS != ret) {\n            return ret;\n        }\n    }\n\n    ret = get_derived_key(key_buff, actual_size, salt, isalt_size, output, ikey_type);\n    return ret;\n}\n\nint DeviceKey::device_inject_root_of_trust(uint32_t *value, size_t isize)\n{\n    return write_key_to_nvstore(value, isize);\n}\n\nint DeviceKey::write_key_to_nvstore(uint32_t *input, size_t isize)\n{\n    if (DEVICE_KEY_16BYTE != isize && DEVICE_KEY_32BYTE != isize) {\n        return DEVICEKEY_INVALID_KEY_SIZE;\n    }\n\n    \/\/First we read if key exist. If it is exists, we return DEVICEKEY_ALREADY_EXIST error\n    uint32_t read_key[DEVICE_KEY_32BYTE \/ sizeof(uint32_t)] = {0};\n    size_t read_size = DEVICE_KEY_32BYTE;\n    int ret = read_key_from_nvstore(read_key, read_size);\n    if (DEVICEKEY_SUCCESS == ret) {\n        return DEVICEKEY_ALREADY_EXIST;\n    }\n    if (DEVICEKEY_NOT_FOUND != ret) {\n        return ret;\n    }\n\n    NVStore& nvstore = NVStore::get_instance();\n    ret = nvstore.set(NVSTORE_DEVICEKEY_KEY, (uint16_t)isize, input);\n    if (NVSTORE_WRITE_ERROR == ret || NVSTORE_BUFF_TOO_SMALL == ret) {\n        return DEVICEKEY_SAVE_FAILED;\n    }\n\n    if (NVSTORE_SUCCESS != ret) {\n        return DEVICEKEY_NVSTORE_UNPREDICTED_ERROR;\n    }\n\n    return DEVICEKEY_SUCCESS;\n}\n\nint DeviceKey::read_key_from_nvstore(uint32_t *output, size_t& size)\n{\n    if (size > UINT16_MAX) {\n        return DEVICEKEY_INVALID_PARAM;\n    }\n\n    uint16_t in_size = size;\n    uint16_t out_size = 0;\n    NVStore& nvstore = NVStore::get_instance();\n    int nvStatus = nvstore.get(NVSTORE_DEVICEKEY_KEY, in_size, output, out_size);\n    if (NVSTORE_NOT_FOUND == nvStatus) {\n        return DEVICEKEY_NOT_FOUND;\n    }\n\n    if (NVSTORE_READ_ERROR == nvStatus || NVSTORE_BUFF_TOO_SMALL == nvStatus) {\n        return DEVICEKEY_READ_FAILED;\n    }\n\n    if (NVSTORE_SUCCESS != nvStatus) {\n        return DEVICEKEY_NVSTORE_UNPREDICTED_ERROR;\n    }\n\n    size = out_size;\n    return DEVICEKEY_SUCCESS;\n}\n\nint DeviceKey::get_derived_key(uint32_t *ikey_buff, size_t ikey_size, const unsigned char *isalt,\n                               size_t isalt_size, unsigned char *output, uint32_t ikey_type)\n{\n    \/\/KDF in counter mode implementation as described in Section 5.1\n    \/\/of NIST SP 800-108, Recommendation for Key Derivation Using Pseudorandom Functions\n    int ret;\n    size_t counter = 0;\n    char separator = 0x00;\n    mbedtls_cipher_context_t ctx;\n    unsigned char output_len_enc[ 4 ] = {0};\n    unsigned char counter_enc[ 1 ] = {0};\n\n    DEVKEY_WRITE_UINT32_LE(output_len_enc, ikey_type);\n\n    mbedtls_cipher_type_t mbedtls_cipher_type = MBEDTLS_CIPHER_AES_128_ECB;\n    if (DEVICE_KEY_32BYTE == ikey_size) {\n        mbedtls_cipher_type = MBEDTLS_CIPHER_AES_256_ECB;\n    }\n\n    const mbedtls_cipher_info_t *cipher_info = mbedtls_cipher_info_from_type(mbedtls_cipher_type);\n\n    mbedtls_cipher_init(&ctx);\n    ret = mbedtls_cipher_setup(&ctx, cipher_info);\n    if (ret != 0) {\n        goto finish;\n    }\n\n    do {\n\n        ret = mbedtls_cipher_cmac_starts(&ctx, (unsigned char *)ikey_buff, ikey_size * 8);\n        if (ret != 0) {\n            goto finish;\n        }\n\n        DEVKEY_WRITE_UINT8_LE(counter_enc, (counter+1));\n\n        ret = mbedtls_cipher_cmac_update(&ctx, (unsigned char *)counter_enc, sizeof(counter_enc));\n        if (ret != 0) {\n            goto finish;\n        }\n\n        ret = mbedtls_cipher_cmac_update(&ctx, isalt, isalt_size);\n        if (ret != 0) {\n            goto finish;\n        }\n\n        ret = mbedtls_cipher_cmac_update(&ctx, (unsigned char *)&separator, sizeof(char));\n        if (ret != 0) {\n            goto finish;\n        }\n\n        ret = mbedtls_cipher_cmac_update(&ctx, (unsigned char *)&output_len_enc, sizeof(output_len_enc));\n        if (ret != 0) {\n            goto finish;\n        }\n\n        ret = mbedtls_cipher_cmac_finish(&ctx, output + (DEVICE_KEY_16BYTE * (counter)));\n        if (ret != 0) {\n            goto finish;\n        }\n\n        counter++;\n\n    } while (DEVICE_KEY_16BYTE * counter < ikey_type);\n\nfinish:\n    mbedtls_cipher_free( &ctx );\n\n    if (DEVICEKEY_SUCCESS != ret) {\n        return DEVICEKEY_ERR_CMAC_GENERIC_FAILURE;\n    }\n\n    return DEVICEKEY_SUCCESS;\n}\n\nint DeviceKey::generate_key_by_trng(uint32_t *output, size_t size)\n{\n#if defined(DEVICE_TRNG)\n    size_t in_size;\n    size_t ongoing_size;\n    trng_t trng_obj;\n    int ret = DEVICEKEY_SUCCESS;\n    unsigned char *pBuffer = (unsigned char *)output;\n\n    memset(output, 0, size);\n\n    if (DEVICE_KEY_16BYTE > size) {\n        return DEVICEKEY_BUFFER_TOO_SMALL;\n    } else if (DEVICE_KEY_16BYTE != size && DEVICE_KEY_32BYTE != size) {\n        return DEVICEKEY_INVALID_PARAM;\n    }\n\n    trng_init(&trng_obj);\n\n    in_size = size;\n    while (in_size > 0) {\n\n        ongoing_size = 0;\n        ret = trng_get_bytes(&trng_obj, (unsigned char *)pBuffer, in_size, &ongoing_size);\n        if (0 != ret || ongoing_size > in_size) {\n            ret = DEVICEKEY_TRNG_ERROR;\n            goto finish;\n        }\n\n        pBuffer += ongoing_size;\n        in_size -= ongoing_size;\n    }\n\n    ret = DEVICEKEY_SUCCESS;\n\nfinish:\n    trng_free(&trng_obj);\n    return ret;\n\n#else\n    return DEVICEKEY_NO_KEY_INJECTED;\n#endif\n}\n\n} \/\/ namespace mbed\n\n#endif \/\/NVSTORE_ENABLED\n#endif\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"stdafx.h\"\n#include \"safearray.h\"\n\nusing namespace safearray;\n\n\nstruct Entry {\n\tJClassID* clazz;\n\tVARTYPE vt;\n\tSAFEARRAY* (* handler)( JNIEnv* env, jarray javaArray );\n};\n\n\/\/ conversion table\nstatic Entry entries[] = {\n\t{ &booleanArray,VT_BOOL,\tPrimitiveArrayXducer<VT_BOOL,VARIANT_BOOL,jboolean>::toNative },\n\t{ &byteArray,\tVT_UI1,\t\t PrimitiveArrayXducer<VT_UI1,byte,jbyte>::toNative },\n\t{ &charArray,\tVT_UI2,\t\tPrimitiveArrayXducer<VT_UI2,unsigned short,jchar>::toNative },\n\t{ &doubleArray,\tVT_R4,\t\tPrimitiveArrayXducer<VT_R8,double,jdouble>::toNative },\n\t{ &floatArray,\tVT_R8,\t\tPrimitiveArrayXducer<VT_R4,float,jfloat>::toNative },\n\t{ &intArray,\tVT_I4,\t\tPrimitiveArrayXducer<VT_I4,INT32,jint>::toNative },\n\t{ &longArray,\tVT_I8,\t\tPrimitiveArrayXducer<VT_I8,INT64,jlong>::toNative },\n\t{ &shortArray,\tVT_I2,\t\tPrimitiveArrayXducer<VT_I2,short,jshort>::toNative },\n\t{ &stringArray,\tVT_BSTR,\tBasicArrayXducer<VT_BSTR,xducer::StringXducer>::toNative },\n\t{ &objectArray,\tVT_VARIANT,\tBasicArrayXducer<VT_VARIANT,xducer::VariantXducer>::toNative },\n\t{ NULL, NULL }\n};\n\n\npair<SafeArrayXducer::NativeType,VARTYPE> SafeArrayXducer::toNative2(\n\tJNIEnv* env, SafeArrayXducer::JavaType a ) {\n\n\n\tjclass clz = env->GetObjectClass(a);\n\n\tfor( Entry* e=entries; e->clazz!=NULL; e++ ) {\n\t\tif(env->IsSameObject(clz,*(e->clazz)))\n\t\t\treturn pair<SAFEARRAY*,VARTYPE>( (e->handler)(env,a), e->vt );\n\t}\n\treturn pair<SAFEARRAY*,VARTYPE>(NULL,VT_EMPTY);\n}\n\nSafeArrayXducer::JavaType SafeArrayXducer::toJava( JNIEnv* env, SAFEARRAY* value ) {\n\tWORD feature = value->fFeatures;\n\n\tif((feature&FADF_BSTR)!=0)\n\t\treturn BasicArrayXducer<VT_BSTR,xducer::StringXducer>::toJava(env,value);\n\tif((feature&(FADF_UNKNOWN|FADF_DISPATCH))!=0)\n\t\treturn BasicArrayXducer<VT_UNKNOWN,xducer::Com4jObjectXducer>::toJava(env,value);\n\tif((feature&FADF_VARIANT)!=0)\n\t\treturn BasicArrayXducer<VT_VARIANT,xducer::VariantXducer>::toJava(env,value);\n\n\treturn NULL;\n}\n<commit_msg>bug fix contributed by Michael.Messinides@invista.com<commit_after>#include \"stdafx.h\"\n#include \"safearray.h\"\n\nusing namespace safearray;\n\n\nstruct Entry {\n\tJClassID* clazz;\n\tVARTYPE vt;\n\tSAFEARRAY* (* handler)( JNIEnv* env, jarray javaArray );\n};\n\n\/\/ conversion table\nstatic Entry entries[] = {\n\t{ &booleanArray,VT_BOOL,\tPrimitiveArrayXducer<VT_BOOL,VARIANT_BOOL,jboolean>::toNative },\n\t{ &byteArray,\tVT_UI1,\t\t PrimitiveArrayXducer<VT_UI1,byte,jbyte>::toNative },\n\t{ &charArray,\tVT_UI2,\t\tPrimitiveArrayXducer<VT_UI2,unsigned short,jchar>::toNative },\n\t{ &doubleArray,\tVT_R8,\t\tPrimitiveArrayXducer<VT_R8,double,jdouble>::toNative },\n\t{ &floatArray,\tVT_R4,\t\tPrimitiveArrayXducer<VT_R4,float,jfloat>::toNative },\n\t{ &intArray,\tVT_I4,\t\tPrimitiveArrayXducer<VT_I4,INT32,jint>::toNative },\n\t{ &longArray,\tVT_I8,\t\tPrimitiveArrayXducer<VT_I8,INT64,jlong>::toNative },\n\t{ &shortArray,\tVT_I2,\t\tPrimitiveArrayXducer<VT_I2,short,jshort>::toNative },\n\t{ &stringArray,\tVT_BSTR,\tBasicArrayXducer<VT_BSTR,xducer::StringXducer>::toNative },\n\t{ &objectArray,\tVT_VARIANT,\tBasicArrayXducer<VT_VARIANT,xducer::VariantXducer>::toNative },\n\t{ NULL, NULL }\n};\n\n\npair<SafeArrayXducer::NativeType,VARTYPE> SafeArrayXducer::toNative2(\n\tJNIEnv* env, SafeArrayXducer::JavaType a ) {\n\n\n\tjclass clz = env->GetObjectClass(a);\n\n\tfor( Entry* e=entries; e->clazz!=NULL; e++ ) {\n\t\tif(env->IsSameObject(clz,*(e->clazz)))\n\t\t\treturn pair<SAFEARRAY*,VARTYPE>( (e->handler)(env,a), e->vt );\n\t}\n\treturn pair<SAFEARRAY*,VARTYPE>(NULL,VT_EMPTY);\n}\n\nSafeArrayXducer::JavaType SafeArrayXducer::toJava( JNIEnv* env, SAFEARRAY* value ) {\n\tWORD feature = value->fFeatures;\n\n\tif((feature&FADF_BSTR)!=0)\n\t\treturn BasicArrayXducer<VT_BSTR,xducer::StringXducer>::toJava(env,value);\n\tif((feature&(FADF_UNKNOWN|FADF_DISPATCH))!=0)\n\t\treturn BasicArrayXducer<VT_UNKNOWN,xducer::Com4jObjectXducer>::toJava(env,value);\n\tif((feature&FADF_VARIANT)!=0)\n\t\treturn BasicArrayXducer<VT_VARIANT,xducer::VariantXducer>::toJava(env,value);\n\n\treturn NULL;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2004-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#include <folly\/experimental\/logging\/LogStream.h>\n\nnamespace folly {\n\nLogStreamBuffer::int_type LogStreamBuffer::overflow(int_type ch) {\n  auto currentSize = str_.size();\n  size_t newSize;\n  if (currentSize == 0) {\n    newSize = kInitialCapacity;\n  } else {\n    \/\/ Increase by 1.25 each time\n    newSize = currentSize + (currentSize >> 2);\n  }\n\n  try {\n    str_.resize(newSize);\n\n    if (ch == EOF) {\n      setp((&str_.front()) + currentSize, (&str_.front()) + newSize);\n      return 'x';\n    } else {\n      str_[currentSize] = static_cast<char>(ch);\n      setp((&str_.front()) + currentSize + 1, (&str_.front()) + newSize);\n      return ch;\n    }\n  } catch (const std::exception& ex) {\n    \/\/ Return EOF to indicate that the operation failed.\n    \/\/ In general the only exception we really expect to see here is\n    \/\/ std::bad_alloc() from the str_.resize() call.\n    return EOF;\n  }\n}\n\nLogStream::LogStream() {\n  rdbuf(&buffer_);\n}\n\nLogStream::~LogStream() {}\n}\n<commit_msg>Explicitly initialize the base class of LogStream<commit_after>\/*\n * Copyright 2004-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#include <folly\/experimental\/logging\/LogStream.h>\n\nnamespace folly {\n\nLogStreamBuffer::int_type LogStreamBuffer::overflow(int_type ch) {\n  auto currentSize = str_.size();\n  size_t newSize;\n  if (currentSize == 0) {\n    newSize = kInitialCapacity;\n  } else {\n    \/\/ Increase by 1.25 each time\n    newSize = currentSize + (currentSize >> 2);\n  }\n\n  try {\n    str_.resize(newSize);\n\n    if (ch == EOF) {\n      setp((&str_.front()) + currentSize, (&str_.front()) + newSize);\n      return 'x';\n    } else {\n      str_[currentSize] = static_cast<char>(ch);\n      setp((&str_.front()) + currentSize + 1, (&str_.front()) + newSize);\n      return ch;\n    }\n  } catch (const std::exception& ex) {\n    \/\/ Return EOF to indicate that the operation failed.\n    \/\/ In general the only exception we really expect to see here is\n    \/\/ std::bad_alloc() from the str_.resize() call.\n    return EOF;\n  }\n}\n\nLogStream::LogStream() : std::ostream(nullptr) {\n  rdbuf(&buffer_);\n}\n\nLogStream::~LogStream() {}\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <miopen\/conv\/invokers\/impl_gemm.hpp>\n\n#include <miopen\/conv\/data_invoke_params.hpp>\n#include <miopen\/algorithm.hpp>\n#include <miopen\/handle.hpp>\n#include <miopen\/tensor_ops.hpp>\n\n#include <boost\/any.hpp>\n\nnamespace miopen {\nnamespace conv {\n\nInvokerFactory MakeImplGemmDataInvokerFactory(const ConvolutionContext& ctx)\n{\n    if(ctx.direction.IsForward())\n    {\n        return [](const std::vector<Kernel>& kernels) {\n            return [=](const Handle& handle, const boost::any& primitive_parameters) {\n                const auto data_ctx = boost::any_cast<conv::DataInvokeParams>(primitive_parameters);\n                const auto& tensors = data_ctx.tensors;\n                handle.Run(kernels[0])(tensors.in, tensors.w, tensors.out);\n            };\n        };\n    }\n    else\n    {\n        if(ctx.direction.IsBackwardWrW())\n            MIOPEN_THROW(\"MakeImplGemmDataInvokerFactory shouldn't be used for WrW invokers.\");\n\n        const auto& conv       = ctx.conv_problem.GetConv();\n        const auto& lowp_quant = conv.lowp_quant;\n\n        return [conv, lowp_quant](const std::vector<Kernel>& kernels) {\n            return [=](const Handle& handle, const boost::any& primitive_parameters) {\n                const auto data_ctx = boost::any_cast<conv::DataInvokeParams>(primitive_parameters);\n                const auto& tensors = data_ctx.tensors;\n                const auto& workSpace = data_ctx.workSpace;\n\n                \/\/ Miminum checks. Only check what is required to select\n                \/\/ proper invocation procedure & workspace sanity.\n                auto kernel = handle.Run(kernels[0]);\n\n                float elapsed = 0;\n                \/\/ clang-format off\n                if((tensors.outDesc.GetType() == miopenHalf ||\n                    tensors.outDesc.GetType() == miopenBFloat16) &&\n                   (kernel.GetName() == \"gridwise_convolution_backward_data_implicit_gemm_v1r1_xdlops_nchw_kcyx_nkhw\" ||\n                    kernel.GetName() == \"gridwise_convolution_backward_data_implicit_gemm_v1r1_xdlops_gnchw_gkcyx_gnkhw\" ||\n                    kernel.GetName() == \"gridwise_convolution_backward_data_implicit_gemm_v1r1_nchw_kcyx_nkhw\" ||\n                    kernel.GetName() == \"gridwise_convolution_backward_data_implicit_gemm_v1r1_ncdhw_kczyx_nkdhw\"))\n                \/\/ clang-format on\n                {\n                    const auto y          = tensors.wDesc.GetLengths()[2];\n                    const auto x          = tensors.wDesc.GetLengths()[3];\n                    const auto stride_h   = conv.GetConvStrides()[0];\n                    const auto stride_w   = conv.GetConvStrides()[1];\n                    const auto dilation_h = conv.GetConvDilations()[0];\n                    const auto dilation_w = conv.GetConvDilations()[1];\n\n                    if((stride_h >= dilation_h * (y - 1) + 1) &&\n                       (stride_w >= dilation_w * (x - 1) + 1))\n                    {\n                        kernel(tensors.in, tensors.w, tensors.out);\n                        if(handle.IsProfilingEnabled())\n                            elapsed += handle.GetKernelTime();\n                    }\n                    else\n                    {\n                        float zero = 0.f;\n                        TensorDescriptor workspaceDesc(miopenFloat,\n                                                       tensors.outDesc.GetLengths(),\n                                                       tensors.outDesc.GetStrides());\n                        SetTensor(handle, workspaceDesc, workSpace, &zero);\n                        if(handle.IsProfilingEnabled())\n                            elapsed += handle.GetKernelTime();\n\n                        kernel(tensors.in, tensors.w, workSpace);\n                        if(handle.IsProfilingEnabled())\n                            elapsed += handle.GetKernelTime();\n\n                        CastTensor(handle,\n                                   &lowp_quant,\n                                   workspaceDesc,\n                                   workSpace,\n                                   tensors.outDesc,\n                                   tensors.out,\n                                   0,\n                                   0);\n                        if(handle.IsProfilingEnabled())\n                            elapsed += handle.GetKernelTime();\n                    }\n                }\n                \/\/ clang-format off\n                else if(kernel.GetName() == \"gridwise_convolution_backward_data_implicit_gemm_v1r1_xdlops_nchw_kcyx_nkhw\" ||\n                        kernel.GetName() == \"gridwise_convolution_backward_data_implicit_gemm_v1r1_xdlops_gnchw_gkcyx_gnkhw\")\n                \/\/ clang-format on\n                {\n                    float zero = 0.f;\n                    SetTensor(handle, tensors.outDesc, tensors.out, &zero);\n                    if(handle.IsProfilingEnabled())\n                        elapsed += handle.GetKernelTime();\n\n                    kernel(tensors.in, tensors.w, tensors.out);\n                    if(handle.IsProfilingEnabled())\n                        elapsed += handle.GetKernelTime();\n                }\n                \/\/ clang-format off\n                else if(\n                    kernel.GetName() == \"gridwise_convolution_backward_data_implicit_gemm_v1r1_nchw_kcyx_nkhw\" ||\n                    kernel.GetName() == \"gridwise_convolution_backward_data_implicit_gemm_v1r1_ncdhw_kczyx_nkdhw\")\n                \/\/ clang-format on\n                {\n                    \/\/ this kernel accumulate results into input tensor, therefore need to set zero\n                    bool is_1x1_s1 = false;\n                    if(miopen::all_of(conv.GetConvPads(), [](auto v) { return v == 0; }) &&\n                       miopen::all_of(conv.GetConvStrides(), [](auto v) { return v == 1; }))\n                    {\n                        if(tensors.wDesc.GetLengths()[2] == 1 && tensors.wDesc.GetLengths()[3] == 1)\n                        { \/\/ filter = 1\n                            if(tensors.wDesc.GetSize() == 4 ||\n                               (tensors.wDesc.GetSize() == 5 && tensors.wDesc.GetLengths()[4] == 1))\n                            {\n                                is_1x1_s1 = true;\n                            }\n                        }\n                    }\n\n                    if(!is_1x1_s1)\n                    {\n                        float zero = 0.f;\n                        SetTensor(handle, tensors.outDesc, tensors.out, &zero);\n                        if(handle.IsProfilingEnabled())\n                            elapsed += handle.GetKernelTime();\n                    }\n\n                    kernel(tensors.in, tensors.w, tensors.out);\n                    if(handle.IsProfilingEnabled())\n                        elapsed += handle.GetKernelTime();\n                }\n                \/\/ clang-format off\n                else if(\n                    kernel.GetName() == \"gridwise_convolution_backward_data_implicit_gemm_v4r1_nchw_kcyx_nkhw\" ||\n                    kernel.GetName() == \"gridwise_convolution_backward_data_implicit_gemm_v4r1_xdlops_nchw_kcyx_nkhw\" ||\n                    kernel.GetName() == \"gridwise_convolution_backward_data_implicit_gemm_v4r1_xdlops_gnchw_gkcyx_gnkhw\" ||\n                    kernel.GetName() == \"gridwise_convolution_backward_data_implicit_gemm_v4r1_ncdhw_kczyx_nkdhw\")\n                \/\/ clang-format on\n                {\n                    \/\/ \\todo this kernel doesn't always need to set-zero\n                    bool filterGeStride = false;\n                    if(miopen::all_of(conv.GetConvPads(), [](auto v) { return v == 0; }))\n                    {\n                        if(tensors.wDesc.GetSize() == 4)\n                        { \/\/ 2d\n                            if(tensors.wDesc.GetLengths()[2] >= conv.GetConvStrides()[0] &&\n                               tensors.wDesc.GetLengths()[3] >= conv.GetConvStrides()[1])\n                            {\n                                filterGeStride = true;\n                            }\n                        }\n                        else\n                        { \/\/ 3d\n                            if(tensors.wDesc.GetLengths()[2] >= conv.GetConvStrides()[0] &&\n                               tensors.wDesc.GetLengths()[3] >= conv.GetConvStrides()[1] &&\n                               tensors.wDesc.GetLengths()[4] >= conv.GetConvStrides()[2])\n                            {\n                                filterGeStride = true;\n                            }\n                        }\n                    }\n\n                    if(!filterGeStride)\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                    \/\/ a group kernels (compiled from same source code) will be launched\n                    for(const auto& k : kernels)\n                    {\n                        handle.Run(k)(tensors.in, tensors.w, tensors.out);\n                        elapsed += handle.GetKernelTime();\n                    }\n                }\n                else\n                {\n                    MIOPEN_THROW(\n                        \"Error running implicit GEMM backward data convolution (none workspace?)\");\n                }\n\n                if(handle.IsProfilingEnabled())\n                {\n                    handle.ResetKernelTime();\n                    handle.AccumKernelTime(elapsed);\n                }\n            };\n        };\n    }\n}\n\n} \/\/ namespace conv\n} \/\/ namespace miopen\n<commit_msg>Fix nan issue in bwd v1r1 kernel (#362)<commit_after>#include <miopen\/conv\/invokers\/impl_gemm.hpp>\n\n#include <miopen\/conv\/data_invoke_params.hpp>\n#include <miopen\/algorithm.hpp>\n#include <miopen\/handle.hpp>\n#include <miopen\/tensor_ops.hpp>\n\n#include <boost\/any.hpp>\n\nnamespace miopen {\nnamespace conv {\n\nInvokerFactory MakeImplGemmDataInvokerFactory(const ConvolutionContext& ctx)\n{\n    if(ctx.direction.IsForward())\n    {\n        return [](const std::vector<Kernel>& kernels) {\n            return [=](const Handle& handle, const boost::any& primitive_parameters) {\n                const auto data_ctx = boost::any_cast<conv::DataInvokeParams>(primitive_parameters);\n                const auto& tensors = data_ctx.tensors;\n                handle.Run(kernels[0])(tensors.in, tensors.w, tensors.out);\n            };\n        };\n    }\n    else\n    {\n        if(ctx.direction.IsBackwardWrW())\n            MIOPEN_THROW(\"MakeImplGemmDataInvokerFactory shouldn't be used for WrW invokers.\");\n\n        const auto& conv       = ctx.conv_problem.GetConv();\n        const auto& lowp_quant = conv.lowp_quant;\n\n        return [conv, lowp_quant](const std::vector<Kernel>& kernels) {\n            return [=](const Handle& handle, const boost::any& primitive_parameters) {\n                const auto data_ctx = boost::any_cast<conv::DataInvokeParams>(primitive_parameters);\n                const auto& tensors = data_ctx.tensors;\n                const auto& workSpace = data_ctx.workSpace;\n\n                \/\/ Miminum checks. Only check what is required to select\n                \/\/ proper invocation procedure & workspace sanity.\n                auto kernel = handle.Run(kernels[0]);\n\n                float elapsed = 0;\n                \/\/ clang-format off\n                if((tensors.outDesc.GetType() == miopenHalf ||\n                    tensors.outDesc.GetType() == miopenBFloat16) &&\n                   (kernel.GetName() == \"gridwise_convolution_backward_data_implicit_gemm_v1r1_xdlops_nchw_kcyx_nkhw\" ||\n                    kernel.GetName() == \"gridwise_convolution_backward_data_implicit_gemm_v1r1_xdlops_gnchw_gkcyx_gnkhw\" ||\n                    kernel.GetName() == \"gridwise_convolution_backward_data_implicit_gemm_v1r1_nchw_kcyx_nkhw\" ||\n                    kernel.GetName() == \"gridwise_convolution_backward_data_implicit_gemm_v1r1_ncdhw_kczyx_nkdhw\"))\n                \/\/ clang-format on\n                {\n                    const auto y          = tensors.wDesc.GetLengths()[2];\n                    const auto x          = tensors.wDesc.GetLengths()[3];\n                    const auto stride_h   = conv.GetConvStrides()[0];\n                    const auto stride_w   = conv.GetConvStrides()[1];\n                    const auto dilation_h = conv.GetConvDilations()[0];\n                    const auto dilation_w = conv.GetConvDilations()[1];\n\n                    bool need_atomic_add = (stride_h < dilation_h * (y - 1) + 1) ||\n                                           (stride_w < dilation_w * (x - 1) + 1);\n                    bool every_pixel_is_written =\n                        (dilation_h == 1 && stride_h <= y) && (dilation_w == 1 && stride_w <= x);\n                    bool need_set_zero = need_atomic_add || !(every_pixel_is_written);\n                    bool need_cast     = need_atomic_add;\n\n                    if(need_set_zero && !need_cast)\n                    {\n                        float zero = 0.f;\n                        SetTensor(handle, tensors.outDesc, tensors.out, &zero);\n                        if(handle.IsProfilingEnabled())\n                            elapsed += handle.GetKernelTime();\n\n                        kernel(tensors.in, tensors.w, tensors.out);\n                        if(handle.IsProfilingEnabled())\n                            elapsed += handle.GetKernelTime();\n                    }\n                    else if(!need_set_zero && !need_cast)\n                    {\n                        kernel(tensors.in, tensors.w, tensors.out);\n                        if(handle.IsProfilingEnabled())\n                            elapsed += handle.GetKernelTime();\n                    }\n                    else\n                    {\n                        float zero = 0.f;\n                        TensorDescriptor workspaceDesc(miopenFloat,\n                                                       tensors.outDesc.GetLengths(),\n                                                       tensors.outDesc.GetStrides());\n                        SetTensor(handle, workspaceDesc, workSpace, &zero);\n                        if(handle.IsProfilingEnabled())\n                            elapsed += handle.GetKernelTime();\n\n                        kernel(tensors.in, tensors.w, workSpace);\n                        if(handle.IsProfilingEnabled())\n                            elapsed += handle.GetKernelTime();\n\n                        CastTensor(handle,\n                                   &lowp_quant,\n                                   workspaceDesc,\n                                   workSpace,\n                                   tensors.outDesc,\n                                   tensors.out,\n                                   0,\n                                   0);\n                        if(handle.IsProfilingEnabled())\n                            elapsed += handle.GetKernelTime();\n                    }\n                }\n                \/\/ clang-format off\n                else if(kernel.GetName() == \"gridwise_convolution_backward_data_implicit_gemm_v1r1_xdlops_nchw_kcyx_nkhw\" ||\n                        kernel.GetName() == \"gridwise_convolution_backward_data_implicit_gemm_v1r1_xdlops_gnchw_gkcyx_gnkhw\")\n                \/\/ clang-format on\n                {\n                    float zero = 0.f;\n                    SetTensor(handle, tensors.outDesc, tensors.out, &zero);\n                    if(handle.IsProfilingEnabled())\n                        elapsed += handle.GetKernelTime();\n\n                    kernel(tensors.in, tensors.w, tensors.out);\n                    if(handle.IsProfilingEnabled())\n                        elapsed += handle.GetKernelTime();\n                }\n                \/\/ clang-format off\n                else if(\n                    kernel.GetName() == \"gridwise_convolution_backward_data_implicit_gemm_v1r1_nchw_kcyx_nkhw\" ||\n                    kernel.GetName() == \"gridwise_convolution_backward_data_implicit_gemm_v1r1_ncdhw_kczyx_nkdhw\")\n                \/\/ clang-format on\n                {\n                    \/\/ this kernel accumulate results into input tensor, therefore need to set zero\n                    bool is_1x1_s1 = false;\n                    if(miopen::all_of(conv.GetConvPads(), [](auto v) { return v == 0; }) &&\n                       miopen::all_of(conv.GetConvStrides(), [](auto v) { return v == 1; }))\n                    {\n                        if(tensors.wDesc.GetLengths()[2] == 1 && tensors.wDesc.GetLengths()[3] == 1)\n                        { \/\/ filter = 1\n                            if(tensors.wDesc.GetSize() == 4 ||\n                               (tensors.wDesc.GetSize() == 5 && tensors.wDesc.GetLengths()[4] == 1))\n                            {\n                                is_1x1_s1 = true;\n                            }\n                        }\n                    }\n\n                    if(!is_1x1_s1)\n                    {\n                        float zero = 0.f;\n                        SetTensor(handle, tensors.outDesc, tensors.out, &zero);\n                        if(handle.IsProfilingEnabled())\n                            elapsed += handle.GetKernelTime();\n                    }\n\n                    kernel(tensors.in, tensors.w, tensors.out);\n                    if(handle.IsProfilingEnabled())\n                        elapsed += handle.GetKernelTime();\n                }\n                \/\/ clang-format off\n                else if(\n                    kernel.GetName() == \"gridwise_convolution_backward_data_implicit_gemm_v4r1_nchw_kcyx_nkhw\" ||\n                    kernel.GetName() == \"gridwise_convolution_backward_data_implicit_gemm_v4r1_xdlops_nchw_kcyx_nkhw\" ||\n                    kernel.GetName() == \"gridwise_convolution_backward_data_implicit_gemm_v4r1_xdlops_gnchw_gkcyx_gnkhw\" ||\n                    kernel.GetName() == \"gridwise_convolution_backward_data_implicit_gemm_v4r1_ncdhw_kczyx_nkdhw\")\n                \/\/ clang-format on\n                {\n                    \/\/ \\todo this kernel doesn't always need to set-zero\n                    bool filterGeStride = false;\n                    if(miopen::all_of(conv.GetConvPads(), [](auto v) { return v == 0; }))\n                    {\n                        if(tensors.wDesc.GetSize() == 4)\n                        { \/\/ 2d\n                            if(tensors.wDesc.GetLengths()[2] >= conv.GetConvStrides()[0] &&\n                               tensors.wDesc.GetLengths()[3] >= conv.GetConvStrides()[1])\n                            {\n                                filterGeStride = true;\n                            }\n                        }\n                        else\n                        { \/\/ 3d\n                            if(tensors.wDesc.GetLengths()[2] >= conv.GetConvStrides()[0] &&\n                               tensors.wDesc.GetLengths()[3] >= conv.GetConvStrides()[1] &&\n                               tensors.wDesc.GetLengths()[4] >= conv.GetConvStrides()[2])\n                            {\n                                filterGeStride = true;\n                            }\n                        }\n                    }\n\n                    if(!filterGeStride)\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                    \/\/ a group kernels (compiled from same source code) will be launched\n                    for(const auto& k : kernels)\n                    {\n                        handle.Run(k)(tensors.in, tensors.w, tensors.out);\n                        elapsed += handle.GetKernelTime();\n                    }\n                }\n                else\n                {\n                    MIOPEN_THROW(\n                        \"Error running implicit GEMM backward data convolution (none workspace?)\");\n                }\n\n                if(handle.IsProfilingEnabled())\n                {\n                    handle.ResetKernelTime();\n                    handle.AccumKernelTime(elapsed);\n                }\n            };\n        };\n    }\n}\n\n} \/\/ namespace conv\n} \/\/ namespace miopen\n<|endoftext|>"}
{"text":"<commit_before>\/**\n *   Copyright 2011-2015 Quickstep Technologies LLC.\n *   Copyright 2015 Pivotal Software, 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 standalone command-line interface to QuickStep *\/\n\n#include <chrono>\n#include <cstddef>\n#include <cstdio>\n#include <exception>\n#include <memory>\n#include <string>\n#include <utility>\n#include <vector>\n#include <thread>  \/\/ NOLINT(build\/c++11)\n\n\n#include \"cli\/CliConfig.h\"  \/\/ For QUICKSTEP_USE_LINENOISE.\n#include \"cli\/DropRelation.hpp\"\n\n#ifdef QUICKSTEP_USE_LINENOISE\n#include \"cli\/LineReaderLineNoise.hpp\"\ntypedef quickstep::LineReaderLineNoise LineReaderImpl;\n#else\n#include \"cli\/LineReaderDumb.hpp\"\ntypedef quickstep::LineReaderDumb LineReaderImpl;\n#endif\n\n#include \"cli\/InputParserUtil.hpp\"\n#include \"cli\/PrintToScreen.hpp\"\n#include \"parser\/ParseStatement.hpp\"\n#include \"parser\/SqlParserWrapper.hpp\"\n#include \"query_execution\/Foreman.hpp\"\n#include \"query_execution\/QueryExecutionTypedefs.hpp\"\n#include \"query_execution\/QueryContext.hpp\"\n#include \"query_execution\/Worker.hpp\"\n#include \"query_execution\/WorkerDirectory.hpp\"\n#include \"query_execution\/WorkerMessage.hpp\"\n#include \"query_optimizer\/QueryHandle.hpp\"\n#include \"query_optimizer\/QueryPlan.hpp\"\n#include \"query_optimizer\/QueryProcessor.hpp\"\n#include \"storage\/StorageConfig.h\"  \/\/ For QUICKSTEP_HAVE_FILE_MANAGER_HDFS.\n\n#ifdef QUICKSTEP_HAVE_FILE_MANAGER_HDFS\n#include \"storage\/FileManagerHdfs.hpp\"\n#endif\n\n#include \"storage\/PreloaderThread.hpp\"\n#include \"threading\/ThreadIDBasedMap.hpp\"\n#include \"utility\/Macros.hpp\"\n#include \"utility\/PtrVector.hpp\"\n#include \"utility\/SqlError.hpp\"\n\n#include \"gflags\/gflags.h\"\n\n#include \"glog\/logging.h\"\n\n#include \"tmb\/address.h\"\n#include \"tmb\/id_typedefs.h\"\n#include \"tmb\/message_bus.h\"\n#include \"tmb\/message_style.h\"\n#include \"tmb\/tagged_message.h\"\n\nnamespace quickstep {\nclass CatalogRelation;\n}\n\nusing std::fflush;\nusing std::fprintf;\nusing std::printf;\nusing std::string;\nusing std::vector;\n\nusing quickstep::Address;\nusing quickstep::CatalogRelation;\nusing quickstep::DropRelation;\nusing quickstep::Foreman;\nusing quickstep::InputParserUtil;\nusing quickstep::MessageBusImpl;\nusing quickstep::MessageStyle;\nusing quickstep::ParseResult;\nusing quickstep::ParseStatement;\nusing quickstep::PrintToScreen;\nusing quickstep::PtrVector;\nusing quickstep::QueryContext;\nusing quickstep::QueryHandle;\nusing quickstep::QueryPlan;\nusing quickstep::QueryProcessor;\nusing quickstep::SqlParserWrapper;\nusing quickstep::TaggedMessage;\nusing quickstep::Worker;\nusing quickstep::WorkerDirectory;\nusing quickstep::WorkerMessage;\nusing quickstep::kPoisonMessage;\n\nusing tmb::client_id;\n\nnamespace quickstep {\n\n#ifdef QUICKSTEP_OS_WINDOWS\nstatic constexpr char kPathSeparator = '\\\\';\nstatic constexpr char kDefaultStoragePath[] = \"qsstor\\\\\";\n#else\nstatic constexpr char kPathSeparator = '\/';\nstatic constexpr char kDefaultStoragePath[] = \"qsstor\/\";\n#endif\n\nDEFINE_int32(num_workers, 0, \"Number of worker threads. If this values is \"\n                             \"specified and is greater than 0, then this \"\n                             \"user-supplied value is used. Else (i.e. the\"\n                             \"default case), we examine the reported \"\n                             \"hardware concurrency level, and use that.\");\nDEFINE_bool(preload_buffer_pool, false,\n            \"If true, pre-load all known blocks into buffer pool before \"\n            \"accepting queries (should also set --buffer_pool_slots to be \"\n            \"large enough to accomodate the entire database).\");\nDEFINE_string(storage_path, kDefaultStoragePath,\n              \"Filesystem path for quickstep database storage.\");\nDEFINE_string(worker_affinities, \"\",\n              \"A comma-separated list of CPU IDs to pin worker threads to \"\n              \"(leaving this empty will cause all worker threads to inherit \"\n              \"the affinity mask of the Quickstep process, which typically \"\n              \"means that they will all be runable on any CPU according to \"\n              \"the kernel's own scheduling policy).\");\n}  \/\/ namespace quickstep\n\nint main(int argc, char* argv[]) {\n  gflags::ParseCommandLineFlags(&argc, &argv, true);\n  google::InitGoogleLogging(argv[0]);\n\n  \/\/ Detect the hardware concurrency level. Note this call will return 0\n  \/\/ if it fails (which it may on some machines\/environments).\n  const unsigned int num_hw_threads = std::thread::hardware_concurrency();\n\n  \/\/ Use the command-line value if that was supplied, else use the value\n  \/\/ that we computed above, provided it did return a valid value.\n  \/\/ TODO(jmp): May need to change this at some point to keep one thread\n  \/\/            available for the OS if the hardware concurrency level is high.\n  const unsigned int real_num_workers = quickstep::FLAGS_num_workers != 0\n                                      ? quickstep::FLAGS_num_workers\n                                      : (num_hw_threads != 0 ?\n                                         num_hw_threads\n                                         : 1);\n\n  if (real_num_workers > 0) {\n    printf(\"Starting Quickstep with %d worker thread(s)\\n\", real_num_workers);\n  } else {\n    LOG(FATAL) << \"Quickstep needs at least one worker thread\";\n  }\n\n#ifdef QUICKSTEP_HAVE_FILE_MANAGER_HDFS\n  if (quickstep::FLAGS_use_hdfs) {\n    LOG(INFO) << \"Using HDFS as the default persistent storage, with namenode at \"\n              << quickstep::FLAGS_hdfs_namenode_host << \":\"\n              << quickstep::FLAGS_hdfs_namenode_port << \" and block replication factor \"\n              << quickstep::FLAGS_hdfs_num_replications << \"\\n\";\n  }\n#endif\n\n  \/\/ Initialize the thread ID based map here before the Foreman and workers are\n  \/\/ constructed because the initialization isn't thread safe.\n  quickstep::ClientIDMap::Instance();\n\n  MessageBusImpl bus;\n  bus.Initialize();\n\n  \/\/ The TMB client id for the main thread, used to kill workers at the end.\n  const client_id main_thread_client_id = bus.Connect();\n  bus.RegisterClientAsSender(main_thread_client_id, kPoisonMessage);\n\n  Foreman foreman(&bus);\n\n  \/\/ Setup the paths used by StorageManager.\n  string fixed_storage_path(quickstep::FLAGS_storage_path);\n  if (!fixed_storage_path.empty()\n      && (fixed_storage_path.back() != quickstep::kPathSeparator)) {\n    fixed_storage_path.push_back(quickstep::kPathSeparator);\n  }\n\n  string catalog_path(fixed_storage_path);\n  catalog_path.append(\"catalog.pb.bin\");\n\n  \/\/ Setup QueryProcessor, including CatalogDatabase and StorageManager.\n  std::unique_ptr<QueryProcessor> query_processor;\n  try {\n    \/\/ TODO(zuyu): Remove passing 'bus' once WorkOrder serialization is done.\n    query_processor.reset(new QueryProcessor(catalog_path, fixed_storage_path, foreman.getBusClientID(), &bus));\n  } catch (const std::exception &e) {\n    LOG(FATAL) << \"FATAL ERROR DURING STARTUP: \" << e.what();\n  } catch (...) {\n    LOG(FATAL) << \"NON-STANDARD EXCEPTION DURING STARTUP\";\n  }\n\n  \/\/ Parse the CPU affinities for workers and the preloader thread, if enabled\n  \/\/ to warm up the buffer pool.\n  const vector<int> worker_cpu_affinities =\n      InputParserUtil::ParseWorkerAffinities(real_num_workers,\n                                             quickstep::FLAGS_worker_affinities);\n\n  if (quickstep::FLAGS_preload_buffer_pool) {\n    quickstep::PreloaderThread preloader(*query_processor->getDefaultDatabase(),\n                                         query_processor->getStorageManager(),\n                                         worker_cpu_affinities.front());\n    printf(\"Preloading buffer pool... \");\n    fflush(stdout);\n    preloader.start();\n    preloader.join();\n    printf(\"DONE\\n\");\n  }\n\n  \/\/ Get the NUMA affinities for workers.\n  vector<int> cpu_numa_nodes = InputParserUtil::GetNUMANodesForCPUs();\n  if (cpu_numa_nodes.empty()) {\n    \/\/ libnuma is not present. Assign -1 as the NUMA node for every worker.\n    cpu_numa_nodes.assign(worker_cpu_affinities.size(), -1);\n  }\n\n  vector<int> worker_numa_nodes;\n  PtrVector<Worker> workers;\n  vector<client_id> worker_client_ids;\n\n  \/\/ TODO(zuyu): Construct QueryContext in Shiftboss to avoid Worker's access.\n  std::unique_ptr<QueryContext> query_context;\n\n  \/\/ Initialize the worker threads.\n  DCHECK_EQ(static_cast<std::size_t>(real_num_workers),\n            worker_cpu_affinities.size());\n  for (std::size_t worker_idx = 0;\n       worker_idx < worker_cpu_affinities.size();\n       ++worker_idx) {\n    int numa_node_id = -1;\n    if (worker_cpu_affinities[worker_idx] >= 0) {\n      \/\/ This worker can be NUMA affinitized.\n      numa_node_id = cpu_numa_nodes[worker_cpu_affinities[worker_idx]];\n    }\n    worker_numa_nodes.push_back(numa_node_id);\n\n    workers.push_back(new Worker(worker_idx,\n                                 query_context,\n                                 &bus,\n                                 query_processor->getDefaultDatabase(),\n                                 query_processor->getStorageManager(),\n                                 worker_cpu_affinities[worker_idx]));\n    worker_client_ids.push_back(workers.back().getBusClientID());\n  }\n\n  \/\/ TODO(zuyu): Move WorkerDirectory within Shiftboss once the latter is added.\n  WorkerDirectory worker_directory(worker_cpu_affinities.size(),\n                                   worker_client_ids,\n                                   worker_numa_nodes);\n\n  foreman.setWorkerDirectory(&worker_directory);\n\n  \/\/ Start the worker threads.\n  for (Worker &worker : workers) {\n    worker.start();\n  }\n\n  LineReaderImpl line_reader(\"quickstep> \",\n                             \"      ...> \");\n  SqlParserWrapper parser_wrapper;\n  std::chrono::time_point<std::chrono::steady_clock> start, end;\n\n  for (;;) {\n    string *command_string = new string();\n    *command_string = line_reader.getNextCommand();\n    if (command_string->size() == 0) {\n      delete command_string;\n      break;\n    }\n\n    parser_wrapper.feedNextBuffer(command_string);\n\n    bool quitting = false;\n    for (;;) {\n      ParseResult result = parser_wrapper.getNextStatement();\n      if (result.condition == ParseResult::kSuccess) {\n        if (result.parsed_statement->getStatementType() == ParseStatement::kQuit) {\n          quitting = true;\n          break;\n        }\n\n        std::unique_ptr<QueryHandle> query_handle;\n        try {\n          query_handle.reset(query_processor->generateQueryHandle(*result.parsed_statement));\n        } catch (const quickstep::SqlError &sql_error) {\n          fprintf(stderr, \"%s\", sql_error.formatMessage(*command_string).c_str());\n          break;\n        }\n\n        DCHECK(query_handle->getQueryPlanMutable() != nullptr);\n        foreman.setQueryPlan(query_handle->getQueryPlanMutable()->getQueryPlanDAGMutable());\n\n        try {\n          start = std::chrono::steady_clock::now();\n          query_context.reset(new QueryContext(query_handle->getQueryContextProto(),\n                                               query_processor->getDefaultDatabase(),\n                                               query_processor->getStorageManager(),\n                                               &bus));\n          foreman.setQueryContext(query_context.get());\n          foreman.start();\n          foreman.join();\n          end = std::chrono::steady_clock::now();\n\n          const CatalogRelation *query_result_relation = query_handle->getQueryResultRelation();\n          if (query_result_relation) {\n            PrintToScreen::PrintRelation(*query_result_relation,\n                                         query_processor->getStorageManager(),\n                                         stdout);\n\n            DropRelation::Drop(*query_result_relation,\n                               query_processor->getDefaultDatabase(),\n                               query_processor->getStorageManager());\n          }\n\n          query_processor->saveCatalog();\n          printf(\"Execution time: %g seconds\\n\",\n                 std::chrono::duration<double>(end - start).count());\n        } catch (const std::exception &e) {\n          fprintf(stderr, \"QUERY EXECUTION ERROR: %s\\n\", e.what());\n          break;\n        }\n        printf(\"Query Complete\\n\");\n      } else {\n        if (result.condition == ParseResult::kError) {\n          fprintf(stderr, \"%s\", result.error_message.c_str());\n        }\n        break;\n      }\n    }\n\n    if (quitting) {\n      break;\n    }\n  }\n\n  \/\/ Terminate all workers before exiting.\n  \/\/ The main thread broadcasts poison message to the workers. Each worker dies\n  \/\/ after receiving poison message. The order of workers' death is irrelavant.\n  MessageStyle style;\n  style.Broadcast(true);\n  Address address;\n  address.All(true);\n  WorkerMessage poison_message(WorkerMessage::PoisonMessage());\n  TaggedMessage poison_tagged_message;\n  poison_tagged_message.set_message(\n      &poison_message,\n      sizeof(poison_message),\n      quickstep::kPoisonMessage);\n\n  bus.Send(main_thread_client_id,\n           address,\n           style,\n           std::move(poison_tagged_message));\n\n  for (Worker &worker : workers) {\n    worker.join();\n  }\n\n  return 0;\n}\n<commit_msg>Update QuickstepCli.cpp<commit_after>\/**\n *   Copyright 2011-2015 Quickstep Technologies LLC.\n *   Copyright 2015 Pivotal Software, 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 standalone command-line interface to QuickStep *\/\n\n#include <chrono>\n#include <cstddef>\n#include <cstdio>\n#include <exception>\n#include <memory>\n#include <string>\n#include <utility>\n#include <vector>\n#include <thread>  \/\/ NOLINT(build\/c++11)\n\n\n#include \"cli\/CliConfig.h\"  \/\/ For QUICKSTEP_USE_LINENOISE.\n#include \"cli\/DropRelation.hpp\"\n\n#ifdef QUICKSTEP_USE_LINENOISE\n#include \"cli\/LineReaderLineNoise.hpp\"\ntypedef quickstep::LineReaderLineNoise LineReaderImpl;\n#else\n#include \"cli\/LineReaderDumb.hpp\"\ntypedef quickstep::LineReaderDumb LineReaderImpl;\n#endif\n\n#include \"cli\/InputParserUtil.hpp\"\n#include \"cli\/PrintToScreen.hpp\"\n#include \"parser\/ParseStatement.hpp\"\n#include \"parser\/SqlParserWrapper.hpp\"\n#include \"query_execution\/Foreman.hpp\"\n#include \"query_execution\/QueryExecutionTypedefs.hpp\"\n#include \"query_execution\/QueryContext.hpp\"\n#include \"query_execution\/Worker.hpp\"\n#include \"query_execution\/WorkerDirectory.hpp\"\n#include \"query_execution\/WorkerMessage.hpp\"\n#include \"query_optimizer\/QueryHandle.hpp\"\n#include \"query_optimizer\/QueryPlan.hpp\"\n#include \"query_optimizer\/QueryProcessor.hpp\"\n#include \"storage\/StorageConfig.h\"  \/\/ For QUICKSTEP_HAVE_FILE_MANAGER_HDFS.\n\n#ifdef QUICKSTEP_HAVE_FILE_MANAGER_HDFS\n#include \"storage\/FileManagerHdfs.hpp\"\n#endif\n\n#include \"storage\/PreloaderThread.hpp\"\n#include \"threading\/ThreadIDBasedMap.hpp\"\n#include \"utility\/Macros.hpp\"\n#include \"utility\/PtrVector.hpp\"\n#include \"utility\/SqlError.hpp\"\n\n#include \"gflags\/gflags.h\"\n\n#include \"glog\/logging.h\"\n\n#include \"tmb\/address.h\"\n#include \"tmb\/id_typedefs.h\"\n#include \"tmb\/message_bus.h\"\n#include \"tmb\/message_style.h\"\n#include \"tmb\/tagged_message.h\"\n\nnamespace quickstep {\nclass CatalogRelation;\n}\n\nusing std::fflush;\nusing std::fprintf;\nusing std::printf;\nusing std::string;\nusing std::vector;\n\nusing quickstep::Address;\nusing quickstep::CatalogRelation;\nusing quickstep::DropRelation;\nusing quickstep::Foreman;\nusing quickstep::InputParserUtil;\nusing quickstep::MessageBusImpl;\nusing quickstep::MessageStyle;\nusing quickstep::ParseResult;\nusing quickstep::ParseStatement;\nusing quickstep::PrintToScreen;\nusing quickstep::PtrVector;\nusing quickstep::QueryContext;\nusing quickstep::QueryHandle;\nusing quickstep::QueryPlan;\nusing quickstep::QueryProcessor;\nusing quickstep::SqlParserWrapper;\nusing quickstep::TaggedMessage;\nusing quickstep::Worker;\nusing quickstep::WorkerDirectory;\nusing quickstep::WorkerMessage;\nusing quickstep::kPoisonMessage;\n\nusing tmb::client_id;\n\nnamespace quickstep {\n\n#ifdef QUICKSTEP_OS_WINDOWS\nstatic constexpr char kPathSeparator = '\\\\';\nstatic constexpr char kDefaultStoragePath[] = \"qsstor\\\\\";\n#else\nstatic constexpr char kPathSeparator = '\/';\nstatic constexpr char kDefaultStoragePath[] = \"qsstor\/\";\n#endif\n\nDEFINE_int32(num_workers, 0, \"Number of worker threads. If this value is \"\n                             \"specified and is greater than 0, then this \"\n                             \"user-supplied value is used. Else (i.e. the\"\n                             \"default case), we examine the reported \"\n                             \"hardware concurrency level, and use that.\");\nDEFINE_bool(preload_buffer_pool, false,\n            \"If true, pre-load all known blocks into buffer pool before \"\n            \"accepting queries (should also set --buffer_pool_slots to be \"\n            \"large enough to accomodate the entire database).\");\nDEFINE_string(storage_path, kDefaultStoragePath,\n              \"Filesystem path for quickstep database storage.\");\nDEFINE_string(worker_affinities, \"\",\n              \"A comma-separated list of CPU IDs to pin worker threads to \"\n              \"(leaving this empty will cause all worker threads to inherit \"\n              \"the affinity mask of the Quickstep process, which typically \"\n              \"means that they will all be runable on any CPU according to \"\n              \"the kernel's own scheduling policy).\");\n}  \/\/ namespace quickstep\n\nint main(int argc, char* argv[]) {\n  gflags::ParseCommandLineFlags(&argc, &argv, true);\n  google::InitGoogleLogging(argv[0]);\n\n  \/\/ Detect the hardware concurrency level. Note this call will return 0\n  \/\/ if it fails (which it may on some machines\/environments).\n  const unsigned int num_hw_threads = std::thread::hardware_concurrency();\n\n  \/\/ Use the command-line value if that was supplied, else use the value\n  \/\/ that we computed above, provided it did return a valid value.\n  \/\/ TODO(jmp): May need to change this at some point to keep one thread\n  \/\/            available for the OS if the hardware concurrency level is high.\n  const unsigned int real_num_workers = quickstep::FLAGS_num_workers != 0\n                                      ? quickstep::FLAGS_num_workers\n                                      : (num_hw_threads != 0 ?\n                                         num_hw_threads\n                                         : 1);\n\n  if (real_num_workers > 0) {\n    printf(\"Starting Quickstep with %d worker thread(s)\\n\", real_num_workers);\n  } else {\n    LOG(FATAL) << \"Quickstep needs at least one worker thread\";\n  }\n\n#ifdef QUICKSTEP_HAVE_FILE_MANAGER_HDFS\n  if (quickstep::FLAGS_use_hdfs) {\n    LOG(INFO) << \"Using HDFS as the default persistent storage, with namenode at \"\n              << quickstep::FLAGS_hdfs_namenode_host << \":\"\n              << quickstep::FLAGS_hdfs_namenode_port << \" and block replication factor \"\n              << quickstep::FLAGS_hdfs_num_replications << \"\\n\";\n  }\n#endif\n\n  \/\/ Initialize the thread ID based map here before the Foreman and workers are\n  \/\/ constructed because the initialization isn't thread safe.\n  quickstep::ClientIDMap::Instance();\n\n  MessageBusImpl bus;\n  bus.Initialize();\n\n  \/\/ The TMB client id for the main thread, used to kill workers at the end.\n  const client_id main_thread_client_id = bus.Connect();\n  bus.RegisterClientAsSender(main_thread_client_id, kPoisonMessage);\n\n  Foreman foreman(&bus);\n\n  \/\/ Setup the paths used by StorageManager.\n  string fixed_storage_path(quickstep::FLAGS_storage_path);\n  if (!fixed_storage_path.empty()\n      && (fixed_storage_path.back() != quickstep::kPathSeparator)) {\n    fixed_storage_path.push_back(quickstep::kPathSeparator);\n  }\n\n  string catalog_path(fixed_storage_path);\n  catalog_path.append(\"catalog.pb.bin\");\n\n  \/\/ Setup QueryProcessor, including CatalogDatabase and StorageManager.\n  std::unique_ptr<QueryProcessor> query_processor;\n  try {\n    \/\/ TODO(zuyu): Remove passing 'bus' once WorkOrder serialization is done.\n    query_processor.reset(new QueryProcessor(catalog_path, fixed_storage_path, foreman.getBusClientID(), &bus));\n  } catch (const std::exception &e) {\n    LOG(FATAL) << \"FATAL ERROR DURING STARTUP: \" << e.what();\n  } catch (...) {\n    LOG(FATAL) << \"NON-STANDARD EXCEPTION DURING STARTUP\";\n  }\n\n  \/\/ Parse the CPU affinities for workers and the preloader thread, if enabled\n  \/\/ to warm up the buffer pool.\n  const vector<int> worker_cpu_affinities =\n      InputParserUtil::ParseWorkerAffinities(real_num_workers,\n                                             quickstep::FLAGS_worker_affinities);\n\n  if (quickstep::FLAGS_preload_buffer_pool) {\n    quickstep::PreloaderThread preloader(*query_processor->getDefaultDatabase(),\n                                         query_processor->getStorageManager(),\n                                         worker_cpu_affinities.front());\n    printf(\"Preloading buffer pool... \");\n    fflush(stdout);\n    preloader.start();\n    preloader.join();\n    printf(\"DONE\\n\");\n  }\n\n  \/\/ Get the NUMA affinities for workers.\n  vector<int> cpu_numa_nodes = InputParserUtil::GetNUMANodesForCPUs();\n  if (cpu_numa_nodes.empty()) {\n    \/\/ libnuma is not present. Assign -1 as the NUMA node for every worker.\n    cpu_numa_nodes.assign(worker_cpu_affinities.size(), -1);\n  }\n\n  vector<int> worker_numa_nodes;\n  PtrVector<Worker> workers;\n  vector<client_id> worker_client_ids;\n\n  \/\/ TODO(zuyu): Construct QueryContext in Shiftboss to avoid Worker's access.\n  std::unique_ptr<QueryContext> query_context;\n\n  \/\/ Initialize the worker threads.\n  DCHECK_EQ(static_cast<std::size_t>(real_num_workers),\n            worker_cpu_affinities.size());\n  for (std::size_t worker_idx = 0;\n       worker_idx < worker_cpu_affinities.size();\n       ++worker_idx) {\n    int numa_node_id = -1;\n    if (worker_cpu_affinities[worker_idx] >= 0) {\n      \/\/ This worker can be NUMA affinitized.\n      numa_node_id = cpu_numa_nodes[worker_cpu_affinities[worker_idx]];\n    }\n    worker_numa_nodes.push_back(numa_node_id);\n\n    workers.push_back(new Worker(worker_idx,\n                                 query_context,\n                                 &bus,\n                                 query_processor->getDefaultDatabase(),\n                                 query_processor->getStorageManager(),\n                                 worker_cpu_affinities[worker_idx]));\n    worker_client_ids.push_back(workers.back().getBusClientID());\n  }\n\n  \/\/ TODO(zuyu): Move WorkerDirectory within Shiftboss once the latter is added.\n  WorkerDirectory worker_directory(worker_cpu_affinities.size(),\n                                   worker_client_ids,\n                                   worker_numa_nodes);\n\n  foreman.setWorkerDirectory(&worker_directory);\n\n  \/\/ Start the worker threads.\n  for (Worker &worker : workers) {\n    worker.start();\n  }\n\n  LineReaderImpl line_reader(\"quickstep> \",\n                             \"      ...> \");\n  SqlParserWrapper parser_wrapper;\n  std::chrono::time_point<std::chrono::steady_clock> start, end;\n\n  for (;;) {\n    string *command_string = new string();\n    *command_string = line_reader.getNextCommand();\n    if (command_string->size() == 0) {\n      delete command_string;\n      break;\n    }\n\n    parser_wrapper.feedNextBuffer(command_string);\n\n    bool quitting = false;\n    for (;;) {\n      ParseResult result = parser_wrapper.getNextStatement();\n      if (result.condition == ParseResult::kSuccess) {\n        if (result.parsed_statement->getStatementType() == ParseStatement::kQuit) {\n          quitting = true;\n          break;\n        }\n\n        std::unique_ptr<QueryHandle> query_handle;\n        try {\n          query_handle.reset(query_processor->generateQueryHandle(*result.parsed_statement));\n        } catch (const quickstep::SqlError &sql_error) {\n          fprintf(stderr, \"%s\", sql_error.formatMessage(*command_string).c_str());\n          break;\n        }\n\n        DCHECK(query_handle->getQueryPlanMutable() != nullptr);\n        foreman.setQueryPlan(query_handle->getQueryPlanMutable()->getQueryPlanDAGMutable());\n\n        try {\n          start = std::chrono::steady_clock::now();\n          query_context.reset(new QueryContext(query_handle->getQueryContextProto(),\n                                               query_processor->getDefaultDatabase(),\n                                               query_processor->getStorageManager(),\n                                               &bus));\n          foreman.setQueryContext(query_context.get());\n          foreman.start();\n          foreman.join();\n          end = std::chrono::steady_clock::now();\n\n          const CatalogRelation *query_result_relation = query_handle->getQueryResultRelation();\n          if (query_result_relation) {\n            PrintToScreen::PrintRelation(*query_result_relation,\n                                         query_processor->getStorageManager(),\n                                         stdout);\n\n            DropRelation::Drop(*query_result_relation,\n                               query_processor->getDefaultDatabase(),\n                               query_processor->getStorageManager());\n          }\n\n          query_processor->saveCatalog();\n          printf(\"Execution time: %g seconds\\n\",\n                 std::chrono::duration<double>(end - start).count());\n        } catch (const std::exception &e) {\n          fprintf(stderr, \"QUERY EXECUTION ERROR: %s\\n\", e.what());\n          break;\n        }\n        printf(\"Query Complete\\n\");\n      } else {\n        if (result.condition == ParseResult::kError) {\n          fprintf(stderr, \"%s\", result.error_message.c_str());\n        }\n        break;\n      }\n    }\n\n    if (quitting) {\n      break;\n    }\n  }\n\n  \/\/ Terminate all workers before exiting.\n  \/\/ The main thread broadcasts poison message to the workers. Each worker dies\n  \/\/ after receiving poison message. The order of workers' death is irrelavant.\n  MessageStyle style;\n  style.Broadcast(true);\n  Address address;\n  address.All(true);\n  WorkerMessage poison_message(WorkerMessage::PoisonMessage());\n  TaggedMessage poison_tagged_message;\n  poison_tagged_message.set_message(\n      &poison_message,\n      sizeof(poison_message),\n      quickstep::kPoisonMessage);\n\n  bus.Send(main_thread_client_id,\n           address,\n           style,\n           std::move(poison_tagged_message));\n\n  for (Worker &worker : workers) {\n    worker.join();\n  }\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"clone.hpp\"\n#include \"http_file_service.hpp\"\n#include <server\/directory_listing.hpp>\n#include <silicium\/virtualized_source.hpp>\n#include <silicium\/observable_source.hpp>\n#include <silicium\/received_from_socket_source.hpp>\n#include <silicium\/ref.hpp>\n#include <silicium\/coroutine.hpp>\n#include <silicium\/total_consumer.hpp>\n#include <silicium\/open.hpp>\n#include <boost\/filesystem\/operations.hpp>\n#include <boost\/asio\/posix\/stream_descriptor.hpp>\n#include <boost\/asio\/write.hpp>\n\nnamespace fileserver\n{\n\tnamespace\n\t{\n\t\tboost::system::error_code clone_regular_file(file_service &service, std::string const &file_name, unknown_digest const &blob_digest, directory_manipulator &destination, Si::yield_context yield)\n\t\t{\n\t\t\tauto opening_remote = service.open(blob_digest);\n\t\t\tauto maybe_remote_file = *yield.get_one(opening_remote);\n\t\t\tif (maybe_remote_file.error())\n\t\t\t{\n\t\t\t\treturn *maybe_remote_file.error();\n\t\t\t}\n\t\t\tlinear_file remote_file = std::move(maybe_remote_file).get();\n\t\t\tauto maybe_local_file = destination.create_regular_file(file_name);\n\t\t\tif (maybe_local_file.error())\n\t\t\t{\n\t\t\t\treturn *maybe_local_file.error();\n\t\t\t}\n\t\t\tauto local_file = std::move(maybe_local_file).get();\n\t\t\tfile_offset total_written = 0;\n\t\t\twhile (total_written < remote_file.size)\n\t\t\t{\n\t\t\t\tSi::error_or<Si::incoming_bytes> const received = *yield.get_one(remote_file.content);\n\t\t\t\tif (received.error())\n\t\t\t\t{\n\t\t\t\t\treturn *received.error();\n\t\t\t\t}\n\t\t\t\tif (received->size() == 0)\n\t\t\t\t{\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif (static_cast<file_offset>(received->size()) > (remote_file.size - total_written))\n\t\t\t\t{\n\t\t\t\t\tthrow std::logic_error(\"todo received too much\");\n\t\t\t\t}\n\t\t\t\tboost::system::error_code const written = local_file->write(boost::make_iterator_range(received->begin, received->end));\n\t\t\t\tif (written)\n\t\t\t\t{\n\t\t\t\t\treturn written;\n\t\t\t\t}\n\t\t\t\ttotal_written += received->size();\n\t\t\t}\n\t\t\treturn boost::system::error_code();\n\t\t}\n\n\t\tboost::system::error_code clone_recursively(file_service &service, unknown_digest const &tree_digest, directory_manipulator &destination, Si::yield_context yield, boost::asio::io_service &io)\n\t\t{\n\t\t\t{\n\t\t\t\tboost::system::error_code const ec = destination.require_exists();\n\t\t\t\tif (ec)\n\t\t\t\t{\n\t\t\t\t\treturn ec;\n\t\t\t\t}\n\t\t\t}\n\t\t\tauto tree_file_opening = service.open(tree_digest);\n\t\t\tboost::optional<Si::error_or<linear_file>> maybe_tree_file = yield.get_one(tree_file_opening);\n\t\t\tif (maybe_tree_file->is_error())\n\t\t\t{\n\t\t\t\treturn *maybe_tree_file->error();\n\t\t\t}\n\t\t\tlinear_file tree_file = std::move(*maybe_tree_file).get();\n\t\t\tauto receiving_source = Si::virtualize_source(Si::make_observable_source(Si::ref(tree_file.content), yield));\n\t\t\tSi::received_from_socket_source content_source(receiving_source);\n\t\t\tauto parsed = deserialize_json(std::move(content_source));\n\t\t\treturn Si::visit<boost::system::error_code>(\n\t\t\t\tparsed,\n\t\t\t\t[&](std::unique_ptr<directory_listing> const &listing) -> boost::system::error_code\n\t\t\t{\n\t\t\t\tfor (auto const &entry : listing->entries)\n\t\t\t\t{\n\t\t\t\t\tif (entry.second.type == \"blob\")\n\t\t\t\t\t{\n\t\t\t\t\t\tauto const ec = clone_regular_file(service, entry.first, to_unknown_digest(entry.second.referenced), destination, yield);\n\t\t\t\t\t\tif (ec)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\treturn ec;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse if (entry.second.type == \"json_v1\")\n\t\t\t\t\t{\n\t\t\t\t\t\tauto const ec = clone_recursively(service, to_unknown_digest(entry.second.referenced), *destination.edit_subdirectory(entry.first), yield, io);\n\t\t\t\t\t\tif (ec)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\treturn ec;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tthrow std::logic_error(\"unknown directory entry type\"); \/\/TODO\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn boost::system::error_code();\n\t\t\t},\n\t\t\t\t[](std::size_t) -> boost::system::error_code\n\t\t\t{\n\t\t\t\tthrow std::logic_error(\"todo\");\n\t\t\t});\n\t\t}\n\t}\n\n\tSi::unique_observable<boost::system::error_code>\n\tclone_directory(unknown_digest const &root_digest, directory_manipulator &destination, file_service &server, boost::asio::io_service &io)\n\t{\n\t\treturn Si::erase_unique(Si::make_coroutine<boost::system::error_code>([&root_digest, &destination, &server, &io](Si::push_context<boost::system::error_code> yield)\n\t\t{\n\t\t\tauto ec = clone_recursively(server, root_digest, destination, yield, io);\n\t\t\tyield(ec);\n\t\t}));\n\t}\n}\n<commit_msg>replace a few autos with types<commit_after>#include \"clone.hpp\"\n#include \"http_file_service.hpp\"\n#include <server\/directory_listing.hpp>\n#include <silicium\/virtualized_source.hpp>\n#include <silicium\/observable_source.hpp>\n#include <silicium\/received_from_socket_source.hpp>\n#include <silicium\/ref.hpp>\n#include <silicium\/coroutine.hpp>\n#include <silicium\/total_consumer.hpp>\n#include <silicium\/open.hpp>\n#include <boost\/filesystem\/operations.hpp>\n#include <boost\/asio\/posix\/stream_descriptor.hpp>\n#include <boost\/asio\/write.hpp>\n\nnamespace fileserver\n{\n\tnamespace\n\t{\n\t\tboost::system::error_code clone_regular_file(file_service &service, std::string const &file_name, unknown_digest const &blob_digest, directory_manipulator &destination, Si::yield_context yield)\n\t\t{\n\t\t\tSi::unique_observable<Si::error_or<linear_file>> opening_remote = service.open(blob_digest);\n\t\t\tSi::error_or<linear_file> maybe_remote_file = *yield.get_one(opening_remote);\n\t\t\tif (maybe_remote_file.error())\n\t\t\t{\n\t\t\t\treturn *maybe_remote_file.error();\n\t\t\t}\n\t\t\tlinear_file remote_file = std::move(maybe_remote_file).get();\n\t\t\tSi::error_or<std::unique_ptr<writeable_file>> maybe_local_file = destination.create_regular_file(file_name);\n\t\t\tif (maybe_local_file.error())\n\t\t\t{\n\t\t\t\treturn *maybe_local_file.error();\n\t\t\t}\n\t\t\tstd::unique_ptr<writeable_file> const local_file = std::move(maybe_local_file).get();\n\t\t\tfile_offset total_written = 0;\n\t\t\twhile (total_written < remote_file.size)\n\t\t\t{\n\t\t\t\tSi::error_or<Si::incoming_bytes> const received = *yield.get_one(remote_file.content);\n\t\t\t\tif (received.error())\n\t\t\t\t{\n\t\t\t\t\treturn *received.error();\n\t\t\t\t}\n\t\t\t\tif (received->size() == 0)\n\t\t\t\t{\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif (static_cast<file_offset>(received->size()) > (remote_file.size - total_written))\n\t\t\t\t{\n\t\t\t\t\tthrow std::logic_error(\"todo received too much\");\n\t\t\t\t}\n\t\t\t\tboost::system::error_code const written = local_file->write(boost::make_iterator_range(received->begin, received->end));\n\t\t\t\tif (written)\n\t\t\t\t{\n\t\t\t\t\treturn written;\n\t\t\t\t}\n\t\t\t\ttotal_written += received->size();\n\t\t\t}\n\t\t\treturn boost::system::error_code();\n\t\t}\n\n\t\tboost::system::error_code clone_recursively(file_service &service, unknown_digest const &tree_digest, directory_manipulator &destination, Si::yield_context yield, boost::asio::io_service &io)\n\t\t{\n\t\t\t{\n\t\t\t\tboost::system::error_code const ec = destination.require_exists();\n\t\t\t\tif (ec)\n\t\t\t\t{\n\t\t\t\t\treturn ec;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSi::unique_observable<Si::error_or<linear_file>> tree_file_opening = service.open(tree_digest);\n\t\t\tboost::optional<Si::error_or<linear_file>> maybe_tree_file = yield.get_one(tree_file_opening);\n\t\t\tif (maybe_tree_file->is_error())\n\t\t\t{\n\t\t\t\treturn *maybe_tree_file->error();\n\t\t\t}\n\t\t\tlinear_file tree_file = std::move(*maybe_tree_file).get();\n\t\t\tauto receiving_source = Si::virtualize_source(Si::make_observable_source(Si::ref(tree_file.content), yield));\n\t\t\tSi::received_from_socket_source content_source(receiving_source);\n\t\t\tSi::fast_variant<std::unique_ptr<fileserver::directory_listing>, std::size_t> parsed = deserialize_json(std::move(content_source));\n\t\t\treturn Si::visit<boost::system::error_code>(\n\t\t\t\tparsed,\n\t\t\t\t[&](std::unique_ptr<directory_listing> const &listing) -> boost::system::error_code\n\t\t\t{\n\t\t\t\tfor (auto const &entry : listing->entries)\n\t\t\t\t{\n\t\t\t\t\tif (entry.second.type == \"blob\")\n\t\t\t\t\t{\n\t\t\t\t\t\tboost::system::error_code const ec = clone_regular_file(service, entry.first, to_unknown_digest(entry.second.referenced), destination, yield);\n\t\t\t\t\t\tif (ec)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\treturn ec;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse if (entry.second.type == \"json_v1\")\n\t\t\t\t\t{\n\t\t\t\t\t\tboost::system::error_code const ec = clone_recursively(service, to_unknown_digest(entry.second.referenced), *destination.edit_subdirectory(entry.first), yield, io);\n\t\t\t\t\t\tif (ec)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\treturn ec;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tthrow std::logic_error(\"unknown directory entry type\"); \/\/TODO\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn boost::system::error_code();\n\t\t\t},\n\t\t\t\t[](std::size_t) -> boost::system::error_code\n\t\t\t{\n\t\t\t\tthrow std::logic_error(\"todo\");\n\t\t\t});\n\t\t}\n\t}\n\n\tSi::unique_observable<boost::system::error_code>\n\tclone_directory(unknown_digest const &root_digest, directory_manipulator &destination, file_service &server, boost::asio::io_service &io)\n\t{\n\t\treturn Si::erase_unique(Si::make_coroutine<boost::system::error_code>([&root_digest, &destination, &server, &io](Si::push_context<boost::system::error_code> yield)\n\t\t{\n\t\t\tboost::system::error_code const ec = clone_recursively(server, root_digest, destination, yield, io);\n\t\t\tyield(ec);\n\t\t}));\n\t}\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\/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    delete baseInterface;\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<commit_msg>Removed unnecessary initialization on AccountManager::Private.<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      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    delete baseInterface;\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>#include \"MethodResult.h\"\n\n#include \"common\/RhodesApp.h\"\n#include \"common\/StringConverter.h\"\n\n#include \"rubyext\/WebView.h\"\n\n#include \"MethodResultConvertor.h\"\n#include \"RubyResultConvertor.h\"\n#include \"JSONResultConvertor.h\"\n\nnamespace rho\n{\nnamespace apiGenerator\n{\n\nusing namespace rho::json;\nusing namespace rho::common;\n\nIMPLEMENT_LOGCLASS(CMethodResult, \"MethodResult\");\n\nrho::String CMethodResult::toJSON()\n{\n    rho::String strRes = CMethodResultConvertor().toJSON(*this);\n    return strRes;\n}\n\nrho::String CMethodResult::toString()\n{\n    if ( m_ResType == eString)\n        return m_strRes;\n    if ( m_ResType == eStringW)\n        return convertToStringA(m_strResW);\n    else if ( m_ResType == eJSON)\n        return m_strJSONRes;\n    else if ( m_ResType == eBool)\n        return convertToStringA(m_bRes);\n    else if ( m_ResType == eInt)\n        return convertToStringA(m_nRes);\n    else if ( m_ResType == eDouble)\n        return convertToStringA(m_dRes);\n\n    return rho::String();\n}\n\nvoid CMethodResult::convertToType(const ETypes& eType)\n{\n    if ( eType == m_ResType || eType == eNone || eError == m_ResType )\n        return;\n\n    switch(eType)\n    {\n    case eString:\n        if ( m_ResType != eJSON )\n        {\n            m_strRes = toString();\n            m_ResType = eString;\n        }\n        break;\n    case eStringW:\n        m_strResW = convertToStringW(toString());\n        m_ResType = eStringW;\n        break;\n    case eBool:\n        {\n            switch(m_ResType)\n            {\n            case eString:\n                convertFromStringA(m_strRes.c_str(), m_bRes);\n                m_ResType = eBool;\n                break;\n#if defined(WINDOWS_PLATFORM)\n            case eStringW:\n                convertFromStringW(m_strResW.c_str(), m_bRes);\n                m_ResType = eBool;\n                break;\n#endif\n            case eInt:\n                m_bRes = m_nRes != 0;\n                m_ResType = eBool;\n                break;\n            case eDouble:\n                m_bRes = m_dRes != 0;\n                m_ResType = eBool;\n                break;\n            default:;\n            }\n        }\n        break;\n\n    case eInt:\n        {\n            switch(m_ResType)\n            {\n            case eString:\n                convertFromStringA(m_strRes.c_str(), m_nRes);\n                m_ResType = eInt;\n                break;\n#if defined(WINDOWS_PLATFORM)\n            case eStringW:\n                convertFromStringW(m_strResW.c_str(), m_nRes);\n                m_ResType = eInt;\n                break;\n#endif\n            case eBool:\n                m_nRes = m_bRes ? 1 :0;\n                m_ResType = eInt;\n                break;\n            default:;\n            }\n        }\n        break;\n    case eDouble:\n        {\n            switch(m_ResType)\n            {\n            case eString:\n                convertFromStringA(m_strRes.c_str(), m_dRes);\n                m_ResType = eDouble;\n                break;\n#if defined(WINDOWS_PLATFORM)\n            case eStringW:\n                convertFromStringW(m_strResW.c_str(), m_dRes);\n                m_ResType = eDouble;\n                break;\n#endif\n            case eBool:\n                m_dRes = m_bRes ? 1 :0;\n                m_ResType = eDouble;\n                break;\n            case eInt:\n                m_dRes = static_cast<double>(m_nRes);\n                m_ResType = eDouble;\n                break;\n            default:;\n            }\n        }\n        break;\n    default:;\n    }\n}\n\n\nVALUE CMethodResult::toRuby(bool bForCallback\/* = false*\/)\n{\n#ifndef RHORC_NO_RUBY\n    VALUE valRes = CMethodResultConvertor().toRuby(*this, bForCallback);\n#elif\n    VALUE valRes = 0;\n#endif \/\/RHORC_NO_RUBY\n    return valRes;\n}\n\nbool CMethodResult::hasCallback()\n{\n    return m_strRubyCallback.length() != 0 ||\n#ifndef RHORC_NO_RUBY\n        m_pRubyCallbackProc ||\n#endif \/\/RHORC_NO_RUBY\n        m_strJSCallback.length() != 0;\n\n}\n\nbool CMethodResult::isEqualCallback(CMethodResult& oResult)\n{\n    if (!hasCallback())\n    {\n        return hasCallback() == oResult.hasCallback();\n    }\n\n    if ( m_strRubyCallback.length() != 0 )\n    {\n        return m_strRubyCallback == oResult.m_strRubyCallback;\n    }\n#ifndef RHORC_NO_RUBY\n    if ( m_pRubyCallbackProc )\n    {\n        return m_pRubyCallbackProc == oResult.m_pRubyCallbackProc;\n    }\n#endif\n    return m_strJSCallback == oResult.m_strJSCallback;\n}\n    \nCMethodResult::ECallbackType CMethodResult::getCallbackType()\n{\n    CMethodResult::ECallbackType cbType = ctNone;\n    \n    if ( m_strRubyCallback.length() != 0 )\n    {\n        cbType = ctRubyStr;\n    }\n#ifndef RHORC_NO_RUBY\n    else if ( m_pRubyCallbackProc )\n    {\n        cbType = ctRubyProc;\n    }\n#endif\n    else if ( m_strJSCallback.length() != 0 )\n    {\n        cbType = ctJavaScript;\n    }\n\n    return cbType;\n}\n\nvoid CMethodResult::callCallback()\n{\n    if ( m_bCollectionMode )\n        return;\n    \n    if ( m_ResType != eNone )\n    {\n        ECallbackType cbType = getCallbackType();\n        \n        if (cbType != ctNone)\n        {\n            switch (cbType)\n            {\n#ifndef RHORC_NO_RUBY\n                case ctRubyStr:\n                {\n                    rho::String strResBody = RHODESAPP().addCallbackObject( new CRubyCallbackResult<CMethodResult>(*this), \"__rho_inline\");\n                    \n                    RHODESAPP().callCallbackWithData( m_strRubyCallback, strResBody, m_strCallbackParam, true);\n                    break;\n                }\n                    \n                case ctRubyProc:\n                {\n                    \/\/ CRubyCallbackResult<CMethodResult>(*this) will reset m_pRubyCallbackProc, save a copy\n                    CMethodRubyValue rubyCallProcCopy(m_pRubyCallbackProc->getValue());\n                    \n                    VALUE oProc = m_pRubyCallbackProc->getValue();\n                    rho::String strResBody = RHODESAPP().addCallbackObject( new CRubyCallbackResult<CMethodResult>(*this), \"body\");\n                    \n                    \/\/ restore original value\n                    m_pRubyCallbackProc = new CMethodRubyValue(rubyCallProcCopy.getValue());\n                    \n                    RHODESAPP().callCallbackProcWithData( oProc, strResBody, m_strCallbackParam, true);\n                    break;\n                }\n#endif \/\/RHORC_NO_RUBY                                    \n                case ctJavaScript:\n                {\n                    String strRes(CMethodResultConvertor().toJSON(*this));\n                    \n                    String strCallback(\"Rho.callbackHandler( \\\"\");\n                    strCallback += m_strJSCallback;\n                    strCallback += \"\\\", {\";\n                    strCallback += strRes;\n                    strCallback += \"},\\\"\";\n                    strCallback += m_strCallbackParam + \"\\\")\";\n                    \n                    if (m_synchronousCallback)\n                    {\n                        rho_webview_execute_js_sync(strCallback.c_str(), m_iTabId);\n                    } else\n                    {\n                        rho_webview_execute_js(strCallback.c_str(), m_iTabId);\n                    }\n                    break;\n                }\n                   \n                default:\n                    break;\n            }\n            m_ResType = eNone;\n            m_synchronousCallback = false;\n        }\n    }\n}\n\n#ifndef RHORC_NO_RUBY \nCMethodResult::CMethodRubyValue::CMethodRubyValue(unsigned long val) : m_value(val)\n{ \n    rho_ruby_holdValue(m_value); \n}\n\nCMethodResult::CMethodRubyValue::~CMethodRubyValue()\n{ \n    rho_ruby_releaseValue(m_value); \n}\n#endif \/\/RHORC_NO_RUBY\n\nvoid CMethodResult::setRubyCallbackProc(unsigned long oRubyCallbackProc)\n{\n    LOG(TRACE) + \"setRubyCallbackProc\";\n#ifndef RHORC_NO_RUBY \n    m_pRubyCallbackProc = new CMethodRubyValue(oRubyCallbackProc);\n#endif \/\/RHORC_NO_RUBY\n}\n\n\nvoid CMethodResult::setJSCallback(const rho::String& strCallback)\n{\n    LOG(TRACE) + \"setJSCallback: \" + strCallback;\n\n    m_strJSCallback = strCallback;\n    m_iTabId = rho_webview_active_tab();\n}\n    \nbool CMethodResult::isSynchronousCallback()\n{\n    return m_synchronousCallback;\n}\nvoid CMethodResult::setSynchronousCallback(bool executeSynchronous)\n{\n    m_synchronousCallback = executeSynchronous;\n}\n    \n}\n}\n<commit_msg>fix mac build<commit_after>#include \"MethodResult.h\"\n\n#include \"common\/RhodesApp.h\"\n#include \"common\/StringConverter.h\"\n\n#include \"rubyext\/WebView.h\"\n\n#include \"MethodResultConvertor.h\"\n#include \"RubyResultConvertor.h\"\n#include \"JSONResultConvertor.h\"\n\nnamespace rho\n{\nnamespace apiGenerator\n{\n\nusing namespace rho::json;\nusing namespace rho::common;\n\nIMPLEMENT_LOGCLASS(CMethodResult, \"MethodResult\");\n\nrho::String CMethodResult::toJSON()\n{\n    rho::String strRes = CMethodResultConvertor().toJSON(*this);\n    return strRes;\n}\n\nrho::String CMethodResult::toString()\n{\n    if ( m_ResType == eString)\n        return m_strRes;\n    if ( m_ResType == eStringW)\n        return convertToStringA(m_strResW);\n    else if ( m_ResType == eJSON)\n        return m_strJSONRes;\n    else if ( m_ResType == eBool)\n        return convertToStringA(m_bRes);\n    else if ( m_ResType == eInt)\n        return convertToStringA(m_nRes);\n    else if ( m_ResType == eDouble)\n        return convertToStringA(m_dRes);\n\n    return rho::String();\n}\n\nvoid CMethodResult::convertToType(const ETypes& eType)\n{\n    if ( eType == m_ResType || eType == eNone || eError == m_ResType )\n        return;\n\n    switch(eType)\n    {\n    case eString:\n        if ( m_ResType != eJSON )\n        {\n            m_strRes = toString();\n            m_ResType = eString;\n        }\n        break;\n    case eStringW:\n        m_strResW = convertToStringW(toString());\n        m_ResType = eStringW;\n        break;\n    case eBool:\n        {\n            switch(m_ResType)\n            {\n            case eString:\n                convertFromStringA(m_strRes.c_str(), m_bRes);\n                m_ResType = eBool;\n                break;\n#if defined(WINDOWS_PLATFORM)\n            case eStringW:\n                convertFromStringW(m_strResW.c_str(), m_bRes);\n                m_ResType = eBool;\n                break;\n#endif\n            case eInt:\n                m_bRes = m_nRes != 0;\n                m_ResType = eBool;\n                break;\n            case eDouble:\n                m_bRes = m_dRes != 0;\n                m_ResType = eBool;\n                break;\n            default:;\n            }\n        }\n        break;\n\n    case eInt:\n        {\n            switch(m_ResType)\n            {\n            case eString:\n                convertFromStringA(m_strRes.c_str(), m_nRes);\n                m_ResType = eInt;\n                break;\n#if defined(WINDOWS_PLATFORM)\n            case eStringW:\n                convertFromStringW(m_strResW.c_str(), m_nRes);\n                m_ResType = eInt;\n                break;\n#endif\n            case eBool:\n                m_nRes = m_bRes ? 1 :0;\n                m_ResType = eInt;\n                break;\n            default:;\n            }\n        }\n        break;\n    case eDouble:\n        {\n            switch(m_ResType)\n            {\n            case eString:\n                convertFromStringA(m_strRes.c_str(), m_dRes);\n                m_ResType = eDouble;\n                break;\n#if defined(WINDOWS_PLATFORM)\n            case eStringW:\n                convertFromStringW(m_strResW.c_str(), m_dRes);\n                m_ResType = eDouble;\n                break;\n#endif\n            case eBool:\n                m_dRes = m_bRes ? 1 :0;\n                m_ResType = eDouble;\n                break;\n            case eInt:\n                m_dRes = static_cast<double>(m_nRes);\n                m_ResType = eDouble;\n                break;\n            default:;\n            }\n        }\n        break;\n    default:;\n    }\n}\n\n\nVALUE CMethodResult::toRuby(bool bForCallback\/* = false*\/)\n{\n#ifndef RHORC_NO_RUBY\n    VALUE valRes = CMethodResultConvertor().toRuby(*this, bForCallback);\n#else\n    VALUE valRes = 0;\n#endif \/\/RHORC_NO_RUBY\n    return valRes;\n}\n\nbool CMethodResult::hasCallback()\n{\n    return m_strRubyCallback.length() != 0 ||\n#ifndef RHORC_NO_RUBY\n        m_pRubyCallbackProc ||\n#endif \/\/RHORC_NO_RUBY\n        m_strJSCallback.length() != 0;\n\n}\n\nbool CMethodResult::isEqualCallback(CMethodResult& oResult)\n{\n    if (!hasCallback())\n    {\n        return hasCallback() == oResult.hasCallback();\n    }\n\n    if ( m_strRubyCallback.length() != 0 )\n    {\n        return m_strRubyCallback == oResult.m_strRubyCallback;\n    }\n#ifndef RHORC_NO_RUBY\n    if ( m_pRubyCallbackProc )\n    {\n        return m_pRubyCallbackProc == oResult.m_pRubyCallbackProc;\n    }\n#endif\n    return m_strJSCallback == oResult.m_strJSCallback;\n}\n    \nCMethodResult::ECallbackType CMethodResult::getCallbackType()\n{\n    CMethodResult::ECallbackType cbType = ctNone;\n    \n    if ( m_strRubyCallback.length() != 0 )\n    {\n        cbType = ctRubyStr;\n    }\n#ifndef RHORC_NO_RUBY\n    else if ( m_pRubyCallbackProc )\n    {\n        cbType = ctRubyProc;\n    }\n#endif\n    else if ( m_strJSCallback.length() != 0 )\n    {\n        cbType = ctJavaScript;\n    }\n\n    return cbType;\n}\n\nvoid CMethodResult::callCallback()\n{\n    if ( m_bCollectionMode )\n        return;\n    \n    if ( m_ResType != eNone )\n    {\n        ECallbackType cbType = getCallbackType();\n        \n        if (cbType != ctNone)\n        {\n            switch (cbType)\n            {\n#ifndef RHORC_NO_RUBY\n                case ctRubyStr:\n                {\n                    rho::String strResBody = RHODESAPP().addCallbackObject( new CRubyCallbackResult<CMethodResult>(*this), \"__rho_inline\");\n                    \n                    RHODESAPP().callCallbackWithData( m_strRubyCallback, strResBody, m_strCallbackParam, true);\n                    break;\n                }\n                    \n                case ctRubyProc:\n                {\n                    \/\/ CRubyCallbackResult<CMethodResult>(*this) will reset m_pRubyCallbackProc, save a copy\n                    CMethodRubyValue rubyCallProcCopy(m_pRubyCallbackProc->getValue());\n                    \n                    VALUE oProc = m_pRubyCallbackProc->getValue();\n                    rho::String strResBody = RHODESAPP().addCallbackObject( new CRubyCallbackResult<CMethodResult>(*this), \"body\");\n                    \n                    \/\/ restore original value\n                    m_pRubyCallbackProc = new CMethodRubyValue(rubyCallProcCopy.getValue());\n                    \n                    RHODESAPP().callCallbackProcWithData( oProc, strResBody, m_strCallbackParam, true);\n                    break;\n                }\n#endif \/\/RHORC_NO_RUBY                                    \n                case ctJavaScript:\n                {\n                    String strRes(CMethodResultConvertor().toJSON(*this));\n                    \n                    String strCallback(\"Rho.callbackHandler( \\\"\");\n                    strCallback += m_strJSCallback;\n                    strCallback += \"\\\", {\";\n                    strCallback += strRes;\n                    strCallback += \"},\\\"\";\n                    strCallback += m_strCallbackParam + \"\\\")\";\n                    \n                    if (m_synchronousCallback)\n                    {\n                        rho_webview_execute_js_sync(strCallback.c_str(), m_iTabId);\n                    } else\n                    {\n                        rho_webview_execute_js(strCallback.c_str(), m_iTabId);\n                    }\n                    break;\n                }\n                   \n                default:\n                    break;\n            }\n            m_ResType = eNone;\n            m_synchronousCallback = false;\n        }\n    }\n}\n\n#ifndef RHORC_NO_RUBY \nCMethodResult::CMethodRubyValue::CMethodRubyValue(unsigned long val) : m_value(val)\n{ \n    rho_ruby_holdValue(m_value); \n}\n\nCMethodResult::CMethodRubyValue::~CMethodRubyValue()\n{ \n    rho_ruby_releaseValue(m_value); \n}\n#endif \/\/RHORC_NO_RUBY\n\nvoid CMethodResult::setRubyCallbackProc(unsigned long oRubyCallbackProc)\n{\n    LOG(TRACE) + \"setRubyCallbackProc\";\n#ifndef RHORC_NO_RUBY \n    m_pRubyCallbackProc = new CMethodRubyValue(oRubyCallbackProc);\n#endif \/\/RHORC_NO_RUBY\n}\n\n\nvoid CMethodResult::setJSCallback(const rho::String& strCallback)\n{\n    LOG(TRACE) + \"setJSCallback: \" + strCallback;\n\n    m_strJSCallback = strCallback;\n    m_iTabId = rho_webview_active_tab();\n}\n    \nbool CMethodResult::isSynchronousCallback()\n{\n    return m_synchronousCallback;\n}\nvoid CMethodResult::setSynchronousCallback(bool executeSynchronous)\n{\n    m_synchronousCallback = executeSynchronous;\n}\n    \n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Jubatus: Online machine learning framework for distributed environment\n\/\/ Copyright (C) 2014 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 \"bandit.hpp\"\n\n#include <map>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include \"..\/bandit\/bandit_factory.hpp\"\n\nusing jubatus::util::lang::shared_ptr;\nusing jubatus::core::bandit::bandit_factory;\n\nnamespace jubatus {\nnamespace core {\nnamespace driver {\n\nbandit::bandit(const std::string& method_name,\n               const common::jsonconfig::config& param) {\n  bandit_ = bandit_factory::create(method_name, param);\n  mixable_storage_.set_model(bandit_);\n\n  register_mixable(&mixable_storage_);\n}\n\nbool bandit::register_arm(const std::string& arm_id) {\n  return bandit_->register_arm(arm_id);\n}\nbool bandit::delete_arm(const std::string& arm_id) {\n  return bandit_->delete_arm(arm_id);\n}\n\nstd::string bandit::select_arm(const std::string& player_id) {\n  return bandit_->select_arm(player_id);\n}\n\nbool bandit::register_reward(const std::string& player_id,\n                             const std::string& arm_id,\n                             double reward) {\n  return bandit_->register_reward(player_id, arm_id, reward);\n}\n\ncore::bandit::arm_info_map bandit::get_arm_info(\n      const std::string& player_id) const {\n  return bandit_->get_arm_info(player_id);\n}\n\nbool bandit::reset(const std::string& player_id) {\n  return bandit_->reset(player_id);\n}\n\nvoid bandit::clear() {\n  bandit_->clear();\n}\nvoid bandit::pack(framework::packer& pk) const {\n  bandit_->pack(pk);\n}\nvoid bandit::unpack(msgpack::object o) {\n  bandit_->unpack(o);\n}\n\n}  \/\/ namespace driver\n}  \/\/ namespace core\n}  \/\/ namespace jubatus\n<commit_msg>Fix bandit driver<commit_after>\/\/ Jubatus: Online machine learning framework for distributed environment\n\/\/ Copyright (C) 2014 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 \"bandit.hpp\"\n\n#include <map>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include \"..\/bandit\/bandit_factory.hpp\"\n\nusing jubatus::util::lang::shared_ptr;\nusing jubatus::core::bandit::bandit_factory;\n\nnamespace jubatus {\nnamespace core {\nnamespace driver {\n\nbandit::bandit(const std::string& method_name,\n               const common::jsonconfig::config& param)\n    : bandit_(bandit_factory::create(method_name, param)),\n      mixable_storage_(bandit_) {\n  register_mixable(&mixable_storage_);\n}\n\nbool bandit::register_arm(const std::string& arm_id) {\n  return bandit_->register_arm(arm_id);\n}\nbool bandit::delete_arm(const std::string& arm_id) {\n  return bandit_->delete_arm(arm_id);\n}\n\nstd::string bandit::select_arm(const std::string& player_id) {\n  return bandit_->select_arm(player_id);\n}\n\nbool bandit::register_reward(const std::string& player_id,\n                             const std::string& arm_id,\n                             double reward) {\n  return bandit_->register_reward(player_id, arm_id, reward);\n}\n\ncore::bandit::arm_info_map bandit::get_arm_info(\n      const std::string& player_id) const {\n  return bandit_->get_arm_info(player_id);\n}\n\nbool bandit::reset(const std::string& player_id) {\n  return bandit_->reset(player_id);\n}\n\nvoid bandit::clear() {\n  bandit_->clear();\n}\nvoid bandit::pack(framework::packer& pk) const {\n  bandit_->pack(pk);\n}\nvoid bandit::unpack(msgpack::object o) {\n  bandit_->unpack(o);\n}\n\n}  \/\/ namespace driver\n}  \/\/ namespace core\n}  \/\/ namespace jubatus\n<|endoftext|>"}
{"text":"<commit_before>\/\/ unit-test-path.cpp\n\n#include \"..\/..\/source\/core\/slang-io.h\"\n\n\n#include \"test-context.h\"\n\nusing namespace Slang;\n\nstatic void pathUnitTest()\n{\n    {\n        String path;\n        SlangResult res = Path::getCanonical(\".\", path);\n        SLANG_CHECK(SLANG_SUCCEEDED(res));\n\n        String parentPath;\n        res = Path::getCanonical(\"..\", parentPath);\n        SLANG_CHECK(SLANG_SUCCEEDED(res));\n\n        String parentPath2 = Path::getParentDirectory(path);\n        SLANG_CHECK(parentPath == parentPath2);\n    }\n    \/\/ Test the paths\n    {\n        SLANG_CHECK(Path::simplify(\".\") == \".\");\n        SLANG_CHECK(Path::simplify(\"..\") == \"..\");\n        SLANG_CHECK(Path::simplify(\"blah\/..\") == \".\");\n\n        SLANG_CHECK(Path::simplify(\"blah\/..\/.\/a\") == \"a\");\n\n        SLANG_CHECK(Path::simplify(\"a:\/what\/..\/.\/..\/is\/.\/..\/this\/.\") == \"a:\/..\/this\");\n\n        SLANG_CHECK(Path::simplify(\"a:\/what\/..\/.\/..\/is\/.\/..\/this\/.\/\") == \"a:\/..\/this\");\n\n        SLANG_CHECK(Path::simplify(\"a:\\\\what\\\\..\\\\.\\\\..\\\\is\\\\.\\\\..\\\\this\\\\.\\\\\") == \"a:\/..\/this\");\n\n        SLANG_CHECK(Path::simplify(\"tests\/preprocessor\/.\\\\pragma-once-a.h\") == \"tests\/preprocessor\/pragma-once-a.h\");\n\n\n        SLANG_CHECK(Path::hasRelativeElement(\".\"));\n        SLANG_CHECK(Path::hasRelativeElement(\"..\"));\n        SLANG_CHECK(Path::hasRelativeElement(\"blah\/..\"));\n\n        SLANG_CHECK(Path::hasRelativeElement(\"blah\/..\/.\/a\"));\n        SLANG_CHECK(Path::hasRelativeElement(\"a\") == false);\n        SLANG_CHECK(Path::hasRelativeElement(\"blah\/a\") == false);\n        SLANG_CHECK(Path::hasRelativeElement(\"a:\\\\blah\/a\") == false);\n\n\n        SLANG_CHECK(Path::hasRelativeElement(\"a:\/what\/..\/.\/..\/is\/.\/..\/this\/.\"));\n\n        SLANG_CHECK(Path::hasRelativeElement(\"a:\/what\/..\/.\/..\/is\/.\/..\/this\/.\/\"));\n\n        SLANG_CHECK(Path::hasRelativeElement(\"a:\\\\what\\\\..\\\\.\\\\..\\\\is\\\\.\\\\..\\\\this\\\\.\\\\\"));\n\n\n    }\n}\n\nSLANG_UNIT_TEST(\"Path\", pathUnitTest);\n<commit_msg>Fix for TC problem with Path unit test (#1621)<commit_after>\/\/ unit-test-path.cpp\n\n#include \"..\/..\/source\/core\/slang-io.h\"\n\n\n#include \"test-context.h\"\n\nusing namespace Slang;\n\nstatic void pathUnitTest()\n{\n    {\n        String path;\n        SlangResult res = Path::getCanonical(\"source\/slang\", path);\n        SLANG_CHECK(SLANG_SUCCEEDED(res));\n\n        String parentPath;\n        res = Path::getCanonical(\"source\", parentPath);\n        SLANG_CHECK(SLANG_SUCCEEDED(res));\n\n        String parentPath2 = Path::getParentDirectory(path);\n        SLANG_CHECK(parentPath == parentPath2);\n    }\n    \/\/ Test the paths\n    {\n        SLANG_CHECK(Path::simplify(\".\") == \".\");\n        SLANG_CHECK(Path::simplify(\"..\") == \"..\");\n        SLANG_CHECK(Path::simplify(\"blah\/..\") == \".\");\n\n        SLANG_CHECK(Path::simplify(\"blah\/..\/.\/a\") == \"a\");\n\n        SLANG_CHECK(Path::simplify(\"a:\/what\/..\/.\/..\/is\/.\/..\/this\/.\") == \"a:\/..\/this\");\n\n        SLANG_CHECK(Path::simplify(\"a:\/what\/..\/.\/..\/is\/.\/..\/this\/.\/\") == \"a:\/..\/this\");\n\n        SLANG_CHECK(Path::simplify(\"a:\\\\what\\\\..\\\\.\\\\..\\\\is\\\\.\\\\..\\\\this\\\\.\\\\\") == \"a:\/..\/this\");\n\n        SLANG_CHECK(Path::simplify(\"tests\/preprocessor\/.\\\\pragma-once-a.h\") == \"tests\/preprocessor\/pragma-once-a.h\");\n\n\n        SLANG_CHECK(Path::hasRelativeElement(\".\"));\n        SLANG_CHECK(Path::hasRelativeElement(\"..\"));\n        SLANG_CHECK(Path::hasRelativeElement(\"blah\/..\"));\n\n        SLANG_CHECK(Path::hasRelativeElement(\"blah\/..\/.\/a\"));\n        SLANG_CHECK(Path::hasRelativeElement(\"a\") == false);\n        SLANG_CHECK(Path::hasRelativeElement(\"blah\/a\") == false);\n        SLANG_CHECK(Path::hasRelativeElement(\"a:\\\\blah\/a\") == false);\n\n\n        SLANG_CHECK(Path::hasRelativeElement(\"a:\/what\/..\/.\/..\/is\/.\/..\/this\/.\"));\n\n        SLANG_CHECK(Path::hasRelativeElement(\"a:\/what\/..\/.\/..\/is\/.\/..\/this\/.\/\"));\n\n        SLANG_CHECK(Path::hasRelativeElement(\"a:\\\\what\\\\..\\\\.\\\\..\\\\is\\\\.\\\\..\\\\this\\\\.\\\\\"));\n\n\n    }\n}\n\nSLANG_UNIT_TEST(\"Path\", pathUnitTest);\n<|endoftext|>"}
{"text":"<commit_before>#include \"UdpSocket.hpp\"\r\n\r\n#include <boost\/lexical_cast.hpp>\r\n#include <boost\/make_shared.hpp>\r\n#include <boost\/bind.hpp>\r\n#include <boost\/thread\/locks.hpp>\r\n\r\nusing namespace boost::asio::ip;\r\n\r\nUdpSocket::UdpSocket() :\r\n\t\tcommonMutex_(), sendqueue_(), receivequeue_(), asyncSendInProgress_(\r\n\t\t\t\tfalse), ipv4socket_(Asio::getIoService()), ipv6socket_(\r\n\t\t\t\tAsio::getIoService()), resolver_(Asio::getIoService()), hasError_(false), errorMessage_(), localPort_(\r\n\t\t\t\t0), remoteIp_(), remotePort_(), receiveBuffer_(new Buffer()), sendBuffer_(\r\n\t\t\t\tnew Buffer()) {\r\n}\r\n\r\nUdpSocket::~UdpSocket() {\r\n}\r\n\r\n\/*\r\n * This code is intended to work on both WinXP and Vista\/7, and allow binding to a random\r\n * unused port. Unfortunately there is no \"safe\" way to bind the same unused port for IPv4\r\n * and IPv6 in WinXP, and unfortunately binding a port with a Vista dual stack socket will\r\n * succeed even if the port is in use for IPv4 already, which would leave you with an IPv6\r\n * only socket which is not useful for most people at the moment.\r\n *\r\n * To work around these problems, I'm making some assumptions: First, binding a dual stack\r\n * socket to an unused port will actually bind to a port that is unused for both IPv4 and\r\n * IPv6, and not just for IPv6. Second, \"displacing\" the v4 part of a dual stack socket by\r\n * binding an explicit IPv4 socket to the same port is a well-behaved operation. Based on\r\n * this, here is how we bind:\r\n *\r\n * If the port number is not 0, we simply try binding an IPv4 and IPv6 socket to the given\r\n * port. If it is 0 and we are on Vista\/7, we bind a dual stack socket first and steal its\r\n * IPv4 part for a seperate socket afterwards, which should always work if the assumptions\r\n * above hold. On WinXP with port 0, the dual stack socket creation will fail, and we just\r\n * attempt to open an IPv4 socket with an unused port, and then an IPv6 socket on the same\r\n * port.\r\n *\r\n * As a consequence, this operation is not reliable on WinXP, since the IPv6 part may fail\r\n * even though there might be free ports available.\r\n *\/\r\nboost::shared_ptr<UdpSocket> UdpSocket::bind(uint16_t portnr) {\r\n\tboost::shared_ptr<UdpSocket> socketPtr(new UdpSocket());\r\n\tboost::system::error_code ignoredError, v4Error, v6Error;\r\n\r\n\tif (portnr == 0) {\r\n\t\ttry {\r\n\t\t\tsocketPtr->ipv6socket_.open(udp::v6());\r\n\t\t\tsocketPtr->ipv6socket_.set_option(v6_only(false));\r\n\t\t\tsocketPtr->ipv6socket_.bind(udp::endpoint(udp::v6(), portnr));\r\n\t\t\tportnr = socketPtr->ipv6socket_.local_endpoint().port();\r\n\t\t} catch (boost::system::system_error &e) {\r\n\t\t\t\/\/ Error -> Probably no dual stack support or no v6 support at all\r\n\t\t\tsocketPtr->ipv6socket_.close(ignoredError);\r\n\t\t}\r\n\t}\r\n\r\n\ttry {\r\n\t\tsocketPtr->ipv4socket_.open(udp::v4());\r\n\t\tsocketPtr->ipv4socket_.bind(udp::endpoint(udp::v4(), portnr));\r\n\t\tportnr = socketPtr->ipv4socket_.local_endpoint().port();\r\n\t} catch (boost::system::system_error &e) {\r\n\t\t\/\/ Error -> IPv4 port is probably in use\r\n\t\tv4Error = e.code();\r\n\t\tsocketPtr->ipv4socket_.close(ignoredError);\r\n\t}\r\n\r\n\tif (!socketPtr->ipv6socket_.is_open()) {\r\n\t\t\/\/ We didn't create a dual stack socket earlier, try simple v6\r\n\t\ttry {\r\n\t\t\tsocketPtr->ipv6socket_.open(udp::v6());\r\n\t\t\tsocketPtr->ipv6socket_.set_option(v6_only(true), ignoredError);\r\n\t\t\tsocketPtr->ipv6socket_.bind(udp::endpoint(udp::v6(), portnr));\r\n\t\t\tportnr = socketPtr->ipv6socket_.local_endpoint().port();\r\n\t\t} catch (boost::system::system_error &e) {\r\n\t\t\tv6Error = e.code();\r\n\t\t\tsocketPtr->ipv6socket_.close(ignoredError);\r\n\t\t}\r\n\t}\r\n\r\n\tif (!socketPtr->ipv4socket_.is_open()\r\n\t\t\t&& !socketPtr->ipv6socket_.is_open()) {\r\n\t\tsocketPtr->hasError_ = true;\r\n\t\tsocketPtr->errorMessage_ = \"IPv4: \" + v4Error.message() + \", IPv6:\"\r\n\t\t\t\t+ v6Error.message();\r\n\t} else {\r\n\t\tsocketPtr->localPort_ = portnr;\r\n\t\tif (socketPtr->ipv4socket_.is_open()) {\r\n\t\t\tboost::shared_array<uint8_t> buf(new uint8_t[65536]);\r\n\t\t\tsocketPtr->asyncReceive(&(socketPtr->ipv4socket_), buf);\r\n\t\t}\r\n\t\tif (socketPtr->ipv6socket_.is_open()) {\r\n\t\t\tboost::shared_array<uint8_t> buf(new uint8_t[65536]);\r\n\t\t\tsocketPtr->asyncReceive(&(socketPtr->ipv6socket_), buf);\r\n\t\t}\r\n\t}\r\n\treturn socketPtr;\r\n}\r\n\r\nboost::shared_ptr<UdpSocket> UdpSocket::error(const std::string &message) {\r\n\tboost::shared_ptr<UdpSocket> socketPtr(new UdpSocket());\r\n\tsocketPtr->hasError_ = true;\r\n\tsocketPtr->errorMessage_ = message;\r\n\treturn socketPtr;\r\n}\r\n\r\nstd::string UdpSocket::getErrorMessage() {\r\n\tboost::lock_guard<boost::recursive_mutex> guard(commonMutex_);\r\n\treturn errorMessage_;\r\n}\r\n\r\nbool UdpSocket::hasError() {\r\n\tboost::lock_guard<boost::recursive_mutex> guard(commonMutex_);\r\n\treturn hasError_;\r\n}\r\n\r\nvoid UdpSocket::write(const uint8_t *in, size_t size) {\r\n\tsendBuffer_->write(in, size);\r\n}\r\n\r\nsize_t UdpSocket::read(uint8_t *out, size_t size) {\r\n\treturn receiveBuffer_->read(out, size);\r\n}\r\n\r\nstd::string UdpSocket::readString(size_t size) {\r\n\treturn receiveBuffer_->readString(size);\r\n}\r\n\r\nsize_t UdpSocket::bytesRemaining() const {\r\n\treturn receiveBuffer_->bytesRemaining();\r\n}\r\n\r\nsize_t UdpSocket::getSendbufferSize() {\r\n\tboost::lock_guard<boost::recursive_mutex> guard(commonMutex_);\r\n\treturn sendqueue_.getMemSize() + sendBuffer_->size();\r\n}\r\n\r\nsize_t UdpSocket::getReceivebufferSize() {\r\n\treturn receiveBuffer_->size();\r\n}\r\n\r\nvoid UdpSocket::setSendbufferLimit(size_t maxSize) {\r\n\tsendqueue_.setMemSizeLimit(maxSize);\r\n}\r\n\r\nBuffer &UdpSocket::getReceiveBuffer() {\r\n\treturn *receiveBuffer_;\r\n}\r\n\r\nuint16_t UdpSocket::getLocalPort() {\r\n\treturn localPort_;\r\n}\r\n\r\nbool UdpSocket::send(const std::string &ip, uint16_t port) {\r\n\tboost::lock_guard<boost::recursive_mutex> guard(commonMutex_);\r\n\r\n\tQueueItem item(sendBuffer_, ip, port);\r\n\tbool datagramsDiscarded = sendqueue_.push(item);\r\n\tif(!asyncSendInProgress_) {\r\n\t\tasyncSend();\r\n\t}\r\n\r\n\tsendBuffer_.reset(new Buffer());\r\n\treturn datagramsDiscarded;\r\n}\r\n\r\nvoid UdpSocket::handleResolve(const boost::system::error_code &error,\r\n\t\tudp::resolver::iterator endpointIterator,\r\n\t\tboost::shared_ptr<Buffer> buffer) {\r\n\thandleSend(error ? error : boost::asio::error::host_not_found, buffer, V4FirstIterator<udp>(endpointIterator));\r\n}\r\n\r\nbool UdpSocket::receive() {\r\n\tboost::lock_guard<boost::recursive_mutex> guard(commonMutex_);\r\n\tif (receivequeue_.isEmpty()) {\r\n\t\treceiveBuffer_->clear();\r\n\t\tremoteIp_ = \"\";\r\n\t\tremotePort_ = 0;\r\n\t\treturn false;\r\n\t}\r\n\r\n\treceiveBuffer_ = receivequeue_.peek().buffer;\r\n\tremoteIp_ = receivequeue_.peek().remoteHost;\r\n\tremotePort_ = receivequeue_.peek().remotePort;\r\n\treceivequeue_.pop();\r\n\treturn true;\r\n}\r\n\r\nvoid UdpSocket::close() {\r\n\tboost::lock_guard<boost::recursive_mutex> guard(commonMutex_);\r\n\tsendqueue_.clear();\r\n\treceivequeue_.clear();\r\n\tsendBuffer_->clear();\r\n\treceiveBuffer_->clear();\r\n}\r\n\r\nstd::string UdpSocket::getRemoteIp() {\r\n\treturn remoteIp_;\r\n}\r\n\r\nuint16_t UdpSocket::getRemotePort() {\r\n\treturn remotePort_;\r\n}\r\n\r\nvoid UdpSocket::asyncSend() {\r\n\tboost::lock_guard<boost::recursive_mutex> guard(commonMutex_);\r\n\r\n\tif (sendqueue_.isEmpty()) {\r\n\t\treturn;\r\n\t}\r\n\r\n\tQueueItem item = sendqueue_.peek();\r\n\tsendqueue_.pop();\r\n\tasyncSendInProgress_ = true;\r\n\r\n\tboost::system::error_code ec;\r\n\tudp::endpoint endpoint(address::from_string(item.remoteHost, ec), item.remotePort);\r\n\tif(!ec) {\r\n\t\tudp::resolver::iterator iter;\r\n\t\thandleResolve(ec, udp::resolver::iterator::create(endpoint, \"\", \"\"), item.buffer);\r\n\t} else {\r\n\t\tudp::resolver::query query(item.remoteHost, boost::lexical_cast<std::string>(item.remotePort), udp::resolver::query::numeric_service | udp::resolver::query::address_configured);\r\n\t\tresolver_.async_resolve(query, boost::bind(&UdpSocket::handleResolve, shared_from_this(),\r\n\t\t\t\tboost::asio::placeholders::error, boost::asio::placeholders::iterator, sendqueue_.peek().buffer));\r\n\t}\r\n}\r\n\r\nudp::socket *UdpSocket::getAppropriateSocket(const udp::endpoint &endpoint) {\r\n\tif (endpoint.protocol() == udp::v4()) {\r\n\t\treturn &ipv4socket_;\r\n\t} else {\r\n\t\treturn &ipv6socket_;\r\n\t}\r\n}\r\n\r\nvoid UdpSocket::handleSend(const boost::system::error_code &err, boost::shared_ptr<Buffer> buffer, V4FirstIterator<udp> endpoints) {\r\n\tboost::lock_guard<boost::recursive_mutex> guard(commonMutex_);\r\n\r\n\tif(!err) {\r\n\t\tasyncSendInProgress_ = false;\r\n\r\n\t\tif (!sendqueue_.isEmpty()) {\r\n\t\t\tasyncSend();\r\n\t\t}\r\n\t} else if(endpoints.hasNext()) {\r\n\t\tudp::endpoint endpoint = endpoints.next();\r\n\t\tudp::socket *sock = getAppropriateSocket(endpoint);\r\n\t\tif(sock->is_open()) {\r\n\t\t\tsock->async_send_to(\r\n\t\t\t\t\tboost::asio::const_buffers_1(buffer->getData(), buffer->size()),\r\n\t\t\t\t\tendpoint,\r\n\t\t\t\t\tboost::bind(&UdpSocket::handleSend, shared_from_this(), boost::asio::placeholders::error, buffer, endpoints));\r\n\t\t\treturn;\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid UdpSocket::asyncReceive(boost::asio::ip::udp::socket *sock,\r\n\t\tboost::shared_array<uint8_t> recvbuffer) {\r\n\tboost::lock_guard<boost::recursive_mutex> guard(commonMutex_);\r\n\tboost::shared_ptr<udp::endpoint> endpoint =\r\n\t\t\tboost::make_shared<udp::endpoint>();\r\n\tsock->async_receive_from(\r\n\t\t\tboost::asio::mutable_buffers_1(recvbuffer.get(), 65536),\r\n\t\t\t*endpoint,\r\n\t\t\tboost::bind(&UdpSocket::handleReceive, boost::weak_ptr<UdpSocket>(shared_from_this()),\r\n\t\t\t\t\tboost::asio::placeholders::error,\r\n\t\t\t\t\tboost::asio::placeholders::bytes_transferred, endpoint,\r\n\t\t\t\t\tsock, recvbuffer));\r\n}\r\n\r\nvoid UdpSocket::handleReceive(boost::weak_ptr<UdpSocket> ptr, const boost::system::error_code &err,\r\n\t\tsize_t bytesTransferred,\r\n\t\tboost::shared_ptr<boost::asio::ip::udp::endpoint> endpoint,\r\n\t\tboost::asio::ip::udp::socket *sock,\r\n\t\tboost::shared_array<uint8_t> recvbuffer) {\r\n\tboost::shared_ptr<UdpSocket> sockPtr = ptr.lock();\r\n\tif(!sockPtr) {\r\n\t\treturn;\r\n\t}\r\n\r\n\tboost::lock_guard<boost::recursive_mutex> guard(sockPtr->commonMutex_);\r\n\tif (!err) {\r\n\t\tboost::shared_ptr<Buffer> buffer = boost::make_shared<Buffer>();\r\n\t\tbuffer->write(recvbuffer.get(), bytesTransferred);\r\n\t\tboost::system::error_code ec;\r\n\t\tsockPtr->receivequeue_.push(QueueItem(buffer, endpoint->address().to_string(ec), endpoint->port()));\r\n\t\tsockPtr->asyncReceive(sock, recvbuffer);\r\n\t} else if (!sock->is_open()) {\r\n\t\tsockPtr->hasError_ = true;\r\n\t\tsockPtr->errorMessage_ = err.message();\r\n\t}\r\n}\r\n<commit_msg>Fixed some bugs related to UDP sending.<commit_after>#include \"UdpSocket.hpp\"\r\n\r\n#include <boost\/lexical_cast.hpp>\r\n#include <boost\/make_shared.hpp>\r\n#include <boost\/bind.hpp>\r\n#include <boost\/thread\/locks.hpp>\r\n\r\nusing namespace boost::asio::ip;\r\n\r\nUdpSocket::UdpSocket() :\r\n\t\tcommonMutex_(), sendqueue_(), receivequeue_(), asyncSendInProgress_(\r\n\t\t\t\tfalse), ipv4socket_(Asio::getIoService()), ipv6socket_(\r\n\t\t\t\tAsio::getIoService()), resolver_(Asio::getIoService()), hasError_(false), errorMessage_(), localPort_(\r\n\t\t\t\t0), remoteIp_(), remotePort_(), receiveBuffer_(new Buffer()), sendBuffer_(\r\n\t\t\t\tnew Buffer()) {\r\n}\r\n\r\nUdpSocket::~UdpSocket() {\r\n}\r\n\r\n\/*\r\n * This code is intended to work on both WinXP and Vista\/7, and allow binding to a random\r\n * unused port. Unfortunately there is no \"safe\" way to bind the same unused port for IPv4\r\n * and IPv6 in WinXP, and unfortunately binding a port with a Vista dual stack socket will\r\n * succeed even if the port is in use for IPv4 already, which would leave you with an IPv6\r\n * only socket which is not useful for most people at the moment.\r\n *\r\n * To work around these problems, I'm making some assumptions: First, binding a dual stack\r\n * socket to an unused port will actually bind to a port that is unused for both IPv4 and\r\n * IPv6, and not just for IPv6. Second, \"displacing\" the v4 part of a dual stack socket by\r\n * binding an explicit IPv4 socket to the same port is a well-behaved operation. Based on\r\n * this, here is how we bind:\r\n *\r\n * If the port number is not 0, we simply try binding an IPv4 and IPv6 socket to the given\r\n * port. If it is 0 and we are on Vista\/7, we bind a dual stack socket first and steal its\r\n * IPv4 part for a seperate socket afterwards, which should always work if the assumptions\r\n * above hold. On WinXP with port 0, the dual stack socket creation will fail, and we just\r\n * attempt to open an IPv4 socket with an unused port, and then an IPv6 socket on the same\r\n * port.\r\n *\r\n * As a consequence, this operation is not reliable on WinXP, since the IPv6 part may fail\r\n * even though there might be free ports available.\r\n *\/\r\nboost::shared_ptr<UdpSocket> UdpSocket::bind(uint16_t portnr) {\r\n\tboost::shared_ptr<UdpSocket> socketPtr(new UdpSocket());\r\n\tboost::system::error_code ignoredError, v4Error, v6Error;\r\n\r\n\tif (portnr == 0) {\r\n\t\ttry {\r\n\t\t\tsocketPtr->ipv6socket_.open(udp::v6());\r\n\t\t\tsocketPtr->ipv6socket_.set_option(v6_only(false));\r\n\t\t\tsocketPtr->ipv6socket_.bind(udp::endpoint(udp::v6(), portnr));\r\n\t\t\tportnr = socketPtr->ipv6socket_.local_endpoint().port();\r\n\t\t} catch (boost::system::system_error &e) {\r\n\t\t\t\/\/ Error -> Probably no dual stack support or no v6 support at all\r\n\t\t\tsocketPtr->ipv6socket_.close(ignoredError);\r\n\t\t}\r\n\t}\r\n\r\n\ttry {\r\n\t\tsocketPtr->ipv4socket_.open(udp::v4());\r\n\t\tsocketPtr->ipv4socket_.bind(udp::endpoint(udp::v4(), portnr));\r\n\t\tportnr = socketPtr->ipv4socket_.local_endpoint().port();\r\n\t} catch (boost::system::system_error &e) {\r\n\t\t\/\/ Error -> IPv4 port is probably in use\r\n\t\tv4Error = e.code();\r\n\t\tsocketPtr->ipv4socket_.close(ignoredError);\r\n\t}\r\n\r\n\tif (!socketPtr->ipv6socket_.is_open()) {\r\n\t\t\/\/ We didn't create a dual stack socket earlier, try simple v6\r\n\t\ttry {\r\n\t\t\tsocketPtr->ipv6socket_.open(udp::v6());\r\n\t\t\tsocketPtr->ipv6socket_.set_option(v6_only(true), ignoredError);\r\n\t\t\tsocketPtr->ipv6socket_.bind(udp::endpoint(udp::v6(), portnr));\r\n\t\t\tportnr = socketPtr->ipv6socket_.local_endpoint().port();\r\n\t\t} catch (boost::system::system_error &e) {\r\n\t\t\tv6Error = e.code();\r\n\t\t\tsocketPtr->ipv6socket_.close(ignoredError);\r\n\t\t}\r\n\t}\r\n\r\n\tif (!socketPtr->ipv4socket_.is_open()\r\n\t\t\t&& !socketPtr->ipv6socket_.is_open()) {\r\n\t\tsocketPtr->hasError_ = true;\r\n\t\tsocketPtr->errorMessage_ = \"IPv4: \" + v4Error.message() + \", IPv6:\"\r\n\t\t\t\t+ v6Error.message();\r\n\t} else {\r\n\t\tsocketPtr->localPort_ = portnr;\r\n\t\tif (socketPtr->ipv4socket_.is_open()) {\r\n\t\t\tboost::shared_array<uint8_t> buf(new uint8_t[65536]);\r\n\t\t\tsocketPtr->asyncReceive(&(socketPtr->ipv4socket_), buf);\r\n\t\t}\r\n\t\tif (socketPtr->ipv6socket_.is_open()) {\r\n\t\t\tboost::shared_array<uint8_t> buf(new uint8_t[65536]);\r\n\t\t\tsocketPtr->asyncReceive(&(socketPtr->ipv6socket_), buf);\r\n\t\t}\r\n\t}\r\n\treturn socketPtr;\r\n}\r\n\r\nboost::shared_ptr<UdpSocket> UdpSocket::error(const std::string &message) {\r\n\tboost::shared_ptr<UdpSocket> socketPtr(new UdpSocket());\r\n\tsocketPtr->hasError_ = true;\r\n\tsocketPtr->errorMessage_ = message;\r\n\treturn socketPtr;\r\n}\r\n\r\nstd::string UdpSocket::getErrorMessage() {\r\n\tboost::lock_guard<boost::recursive_mutex> guard(commonMutex_);\r\n\treturn errorMessage_;\r\n}\r\n\r\nbool UdpSocket::hasError() {\r\n\tboost::lock_guard<boost::recursive_mutex> guard(commonMutex_);\r\n\treturn hasError_;\r\n}\r\n\r\nvoid UdpSocket::write(const uint8_t *in, size_t size) {\r\n\tsendBuffer_->write(in, size);\r\n}\r\n\r\nsize_t UdpSocket::read(uint8_t *out, size_t size) {\r\n\treturn receiveBuffer_->read(out, size);\r\n}\r\n\r\nstd::string UdpSocket::readString(size_t size) {\r\n\treturn receiveBuffer_->readString(size);\r\n}\r\n\r\nsize_t UdpSocket::bytesRemaining() const {\r\n\treturn receiveBuffer_->bytesRemaining();\r\n}\r\n\r\nsize_t UdpSocket::getSendbufferSize() {\r\n\tboost::lock_guard<boost::recursive_mutex> guard(commonMutex_);\r\n\treturn sendqueue_.getMemSize() + sendBuffer_->size();\r\n}\r\n\r\nsize_t UdpSocket::getReceivebufferSize() {\r\n\treturn receiveBuffer_->size();\r\n}\r\n\r\nvoid UdpSocket::setSendbufferLimit(size_t maxSize) {\r\n\tsendqueue_.setMemSizeLimit(maxSize);\r\n}\r\n\r\nBuffer &UdpSocket::getReceiveBuffer() {\r\n\treturn *receiveBuffer_;\r\n}\r\n\r\nuint16_t UdpSocket::getLocalPort() {\r\n\treturn localPort_;\r\n}\r\n\r\nbool UdpSocket::send(const std::string &host, uint16_t port) {\r\n\tboost::lock_guard<boost::recursive_mutex> guard(commonMutex_);\r\n\r\n\tQueueItem item(sendBuffer_, host, port);\r\n\tbool datagramsDiscarded = sendqueue_.push(item);\r\n\tif(!asyncSendInProgress_) {\r\n\t\tasyncSend();\r\n\t}\r\n\r\n\tsendBuffer_.reset(new Buffer());\r\n\treturn datagramsDiscarded;\r\n}\r\n\r\nvoid UdpSocket::handleResolve(const boost::system::error_code &error,\r\n\t\tudp::resolver::iterator endpointIterator,\r\n\t\tboost::shared_ptr<Buffer> buffer) {\r\n\thandleSend(error ? error : boost::asio::error::host_not_found, buffer, V4FirstIterator<udp>(endpointIterator));\r\n}\r\n\r\nbool UdpSocket::receive() {\r\n\tboost::lock_guard<boost::recursive_mutex> guard(commonMutex_);\r\n\tif (receivequeue_.isEmpty()) {\r\n\t\treceiveBuffer_->clear();\r\n\t\tremoteIp_ = \"\";\r\n\t\tremotePort_ = 0;\r\n\t\treturn false;\r\n\t}\r\n\r\n\treceiveBuffer_ = receivequeue_.peek().buffer;\r\n\tremoteIp_ = receivequeue_.peek().remoteHost;\r\n\tremotePort_ = receivequeue_.peek().remotePort;\r\n\treceivequeue_.pop();\r\n\treturn true;\r\n}\r\n\r\nvoid UdpSocket::close() {\r\n\tboost::lock_guard<boost::recursive_mutex> guard(commonMutex_);\r\n\tsendqueue_.clear();\r\n\treceivequeue_.clear();\r\n\tsendBuffer_->clear();\r\n\treceiveBuffer_->clear();\r\n}\r\n\r\nstd::string UdpSocket::getRemoteIp() {\r\n\treturn remoteIp_;\r\n}\r\n\r\nuint16_t UdpSocket::getRemotePort() {\r\n\treturn remotePort_;\r\n}\r\n\r\nvoid UdpSocket::asyncSend() {\r\n\tboost::lock_guard<boost::recursive_mutex> guard(commonMutex_);\r\n\r\n\tif (sendqueue_.isEmpty()) {\r\n\t\treturn;\r\n\t}\r\n\r\n\tQueueItem item = sendqueue_.peek();\r\n\tsendqueue_.pop();\r\n\tasyncSendInProgress_ = true;\r\n\r\n\tboost::system::error_code ec;\r\n\tudp::endpoint endpoint(address::from_string(item.remoteHost, ec), item.remotePort);\r\n\tif(!ec) {\r\n\t\tudp::resolver::iterator iter;\r\n\t\thandleResolve(ec, udp::resolver::iterator::create(endpoint, \"\", \"\"), item.buffer);\r\n\t} else {\r\n\t\tudp::resolver::query query(item.remoteHost, boost::lexical_cast<std::string>(item.remotePort), udp::resolver::query::numeric_service | udp::resolver::query::address_configured);\r\n\t\tresolver_.async_resolve(query, boost::bind(&UdpSocket::handleResolve, shared_from_this(),\r\n\t\t\t\tboost::asio::placeholders::error, boost::asio::placeholders::iterator, item.buffer));\r\n\t}\r\n}\r\n\r\nudp::socket *UdpSocket::getAppropriateSocket(const udp::endpoint &endpoint) {\r\n\tif (endpoint.protocol() == udp::v4()) {\r\n\t\treturn &ipv4socket_;\r\n\t} else {\r\n\t\treturn &ipv6socket_;\r\n\t}\r\n}\r\n\r\nvoid UdpSocket::handleSend(const boost::system::error_code &err, boost::shared_ptr<Buffer> buffer, V4FirstIterator<udp> endpoints) {\r\n\tboost::lock_guard<boost::recursive_mutex> guard(commonMutex_);\r\n\r\n\tif(err && endpoints.hasNext()) {\r\n\t\tudp::endpoint endpoint;\r\n\t\tudp::socket *sock;\r\n\t\tdo {\r\n\t\t\tendpoint = endpoints.next();\r\n\t\t\tsock = getAppropriateSocket(endpoint);\r\n\t\t} while(!sock->is_open() && endpoints.hasNext());\r\n\r\n\t\tif(sock->is_open()) {\r\n\t\t\tsock->async_send_to(\r\n\t\t\t\t\tboost::asio::const_buffers_1(buffer->getData(), buffer->size()),\r\n\t\t\t\t\tendpoint,\r\n\t\t\t\t\tboost::bind(&UdpSocket::handleSend, shared_from_this(), boost::asio::placeholders::error, buffer, endpoints));\r\n\t\t\treturn;\r\n\t\t}\r\n\t}\r\n\r\n\tasyncSendInProgress_ = false;\r\n\r\n\tif (!sendqueue_.isEmpty()) {\r\n\t\tasyncSend();\r\n\t}\r\n}\r\n\r\nvoid UdpSocket::asyncReceive(boost::asio::ip::udp::socket *sock,\r\n\t\tboost::shared_array<uint8_t> recvbuffer) {\r\n\tboost::lock_guard<boost::recursive_mutex> guard(commonMutex_);\r\n\tboost::shared_ptr<udp::endpoint> endpoint =\r\n\t\t\tboost::make_shared<udp::endpoint>();\r\n\tsock->async_receive_from(\r\n\t\t\tboost::asio::mutable_buffers_1(recvbuffer.get(), 65536),\r\n\t\t\t*endpoint,\r\n\t\t\tboost::bind(&UdpSocket::handleReceive, boost::weak_ptr<UdpSocket>(shared_from_this()),\r\n\t\t\t\t\tboost::asio::placeholders::error,\r\n\t\t\t\t\tboost::asio::placeholders::bytes_transferred, endpoint,\r\n\t\t\t\t\tsock, recvbuffer));\r\n}\r\n\r\nvoid UdpSocket::handleReceive(boost::weak_ptr<UdpSocket> ptr, const boost::system::error_code &err,\r\n\t\tsize_t bytesTransferred,\r\n\t\tboost::shared_ptr<boost::asio::ip::udp::endpoint> endpoint,\r\n\t\tboost::asio::ip::udp::socket *sock,\r\n\t\tboost::shared_array<uint8_t> recvbuffer) {\r\n\tboost::shared_ptr<UdpSocket> sockPtr = ptr.lock();\r\n\tif(!sockPtr) {\r\n\t\treturn;\r\n\t}\r\n\r\n\tboost::lock_guard<boost::recursive_mutex> guard(sockPtr->commonMutex_);\r\n\tif (!err) {\r\n\t\tboost::shared_ptr<Buffer> buffer = boost::make_shared<Buffer>();\r\n\t\tbuffer->write(recvbuffer.get(), bytesTransferred);\r\n\t\tboost::system::error_code ec;\r\n\t\tsockPtr->receivequeue_.push(QueueItem(buffer, endpoint->address().to_string(ec), endpoint->port()));\r\n\t\tsockPtr->asyncReceive(sock, recvbuffer);\r\n\t} else if (!sock->is_open()) {\r\n\t\tsockPtr->hasError_ = true;\r\n\t\tsockPtr->errorMessage_ = err.message();\r\n\t}\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2017 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\/core\/SkStream.h\"\n#include \"include\/private\/SkThreadID.h\"\n#include \"src\/core\/SkOSFile.h\"\n#include \"src\/core\/SkTraceEvent.h\"\n#include \"src\/utils\/SkJSONWriter.h\"\n#include \"src\/utils\/SkOSPath.h\"\n#include \"tools\/trace\/ChromeTracingTracer.h\"\n\n#include <chrono>\n\nnamespace {\n\n\/**\n * All events have a fixed block of information (TraceEvent), plus variable length payload:\n * {TraceEvent} {TraceEventArgs} {Inline Payload}\n *\/\nstruct TraceEventArg {\n    uint8_t     fArgType;\n    const char* fArgName;\n    uint64_t    fArgValue;\n};\n\n\/\/ These fields are ordered to minimize size due to alignment. Argument types could be packed\n\/\/ better, but very few events have many arguments, so the net loss is pretty small.\nstruct TraceEvent {\n    char     fPhase;\n    uint8_t  fNumArgs;\n    uint32_t fSize;\n\n    const char* fName;\n    \/\/ TODO: Merge fID and fClockEnd (never used together)\n    uint64_t   fID;\n    uint64_t   fClockBegin;\n    uint64_t   fClockEnd;\n    SkThreadID fThreadID;\n\n    TraceEvent* next() {\n        return reinterpret_cast<TraceEvent*>(reinterpret_cast<char*>(this) + fSize);\n    }\n    TraceEventArg* args() { return reinterpret_cast<TraceEventArg*>(this + 1); }\n    char*          stringTable() { return reinterpret_cast<char*>(this->args() + fNumArgs); }\n};\n\n}  \/\/ namespace\n\nChromeTracingTracer::ChromeTracingTracer(const char* filename) : fFilename(filename) {\n    this->createBlock();\n}\n\nChromeTracingTracer::~ChromeTracingTracer() { this->flush(); }\n\nvoid ChromeTracingTracer::createBlock() {\n    fCurBlock.fBlock         = BlockPtr(new uint8_t[kBlockSize]);\n    fCurBlock.fEventsInBlock = 0;\n    fCurBlockUsed            = 0;\n}\n\nSkEventTracer::Handle ChromeTracingTracer::appendEvent(const void* data, size_t size) {\n    SkASSERT(size > 0 && size <= kBlockSize);\n\n    SkAutoSpinlock lock(fMutex);\n    if (fCurBlockUsed + size > kBlockSize) {\n        fBlocks.push_back(std::move(fCurBlock));\n        this->createBlock();\n    }\n    memcpy(fCurBlock.fBlock.get() + fCurBlockUsed, data, size);\n    Handle handle = reinterpret_cast<Handle>(fCurBlock.fBlock.get() + fCurBlockUsed);\n    fCurBlockUsed += size;\n    fCurBlock.fEventsInBlock++;\n    return handle;\n}\n\nSkEventTracer::Handle ChromeTracingTracer::addTraceEvent(char            phase,\n                                                         const uint8_t*  categoryEnabledFlag,\n                                                         const char*     name,\n                                                         uint64_t        id,\n                                                         int             numArgs,\n                                                         const char**    argNames,\n                                                         const uint8_t*  argTypes,\n                                                         const uint64_t* argValues,\n                                                         uint8_t         flags) {\n    \/\/ TODO: Respect flags (or assert). INSTANT events encode scope in flags, should be stored\n    \/\/ using \"s\" key in JSON. COPY flag should be supported or rejected.\n\n    \/\/ Figure out how much extra storage we need for copied strings\n    int size = static_cast<int>(sizeof(TraceEvent) + numArgs * sizeof(TraceEventArg));\n    for (int i = 0; i < numArgs; ++i) {\n        if (TRACE_VALUE_TYPE_COPY_STRING == argTypes[i]) {\n            skia::tracing_internals::TraceValueUnion value;\n            value.as_uint = argValues[i];\n            size += strlen(value.as_string) + 1;\n        }\n    }\n\n    size = SkAlign8(size);\n\n    SkSTArray<128, uint8_t, true> storage;\n    uint8_t*                      storagePtr = storage.push_back_n(size);\n\n    TraceEvent* traceEvent  = reinterpret_cast<TraceEvent*>(storagePtr);\n    traceEvent->fPhase      = phase;\n    traceEvent->fNumArgs    = numArgs;\n    traceEvent->fSize       = size;\n    traceEvent->fName       = name;\n    traceEvent->fID         = id;\n    traceEvent->fClockBegin = std::chrono::steady_clock::now().time_since_epoch().count();\n    traceEvent->fClockEnd   = 0;\n    traceEvent->fThreadID   = SkGetThreadID();\n\n    TraceEventArg* traceEventArgs  = traceEvent->args();\n    char*          stringTableBase = traceEvent->stringTable();\n    char*          stringTable     = stringTableBase;\n    for (int i = 0; i < numArgs; ++i) {\n        traceEventArgs[i].fArgName = argNames[i];\n        traceEventArgs[i].fArgType = argTypes[i];\n        if (TRACE_VALUE_TYPE_COPY_STRING == argTypes[i]) {\n            \/\/ Just write an offset into the arguments array\n            traceEventArgs[i].fArgValue = stringTable - stringTableBase;\n\n            \/\/ Copy string into our buffer (and advance)\n            skia::tracing_internals::TraceValueUnion value;\n            value.as_uint = argValues[i];\n            while (*value.as_string) {\n                *stringTable++ = *value.as_string++;\n            }\n            *stringTable++ = 0;\n        } else {\n            traceEventArgs[i].fArgValue = argValues[i];\n        }\n    }\n\n    return this->appendEvent(storagePtr, size);\n}\n\nvoid ChromeTracingTracer::updateTraceEventDuration(const uint8_t*        categoryEnabledFlag,\n                                                   const char*           name,\n                                                   SkEventTracer::Handle handle) {\n    \/\/ We could probably get away with not locking here, but let's be totally safe.\n    SkAutoSpinlock lock(fMutex);\n    TraceEvent*    traceEvent = reinterpret_cast<TraceEvent*>(handle);\n    traceEvent->fClockEnd         = std::chrono::steady_clock::now().time_since_epoch().count();\n}\n\nstatic void trace_value_to_json(SkJSONWriter* writer,\n                                uint64_t      argValue,\n                                uint8_t       argType,\n                                const char*   stringTableBase) {\n    skia::tracing_internals::TraceValueUnion value;\n    value.as_uint = argValue;\n\n    switch (argType) {\n        case TRACE_VALUE_TYPE_BOOL: writer->appendBool(value.as_bool); break;\n        case TRACE_VALUE_TYPE_UINT: writer->appendU64(value.as_uint); break;\n        case TRACE_VALUE_TYPE_INT: writer->appendS64(value.as_int); break;\n        case TRACE_VALUE_TYPE_DOUBLE: writer->appendDouble(value.as_double); break;\n        case TRACE_VALUE_TYPE_POINTER: writer->appendPointer(value.as_pointer); break;\n        case TRACE_VALUE_TYPE_STRING: writer->appendString(value.as_string); break;\n        case TRACE_VALUE_TYPE_COPY_STRING:\n            writer->appendString(stringTableBase + value.as_uint);\n            break;\n        default: writer->appendString(\"<unknown type>\"); break;\n    }\n}\n\nnamespace {\n\nstruct TraceEventSerializationState {\n    TraceEventSerializationState(uint64_t clockOffset)\n            : fClockOffset(clockOffset), fNextThreadID(0) {}\n\n    int getShortThreadID(SkThreadID id) {\n        if (int* shortIDPtr = fShortThreadIDMap.find(id)) {\n            return *shortIDPtr;\n        }\n        int shortID = fNextThreadID++;\n        fShortThreadIDMap.set(id, shortID);\n        return shortID;\n    }\n\n    uint64_t                          fClockOffset;\n    SkTHashMap<uint64_t, const char*> fBaseTypeResolver;\n    int                               fNextThreadID;\n    SkTHashMap<SkThreadID, int>       fShortThreadIDMap;\n};\n\n}  \/\/ namespace\n\nstatic void trace_event_to_json(SkJSONWriter*                 writer,\n                                TraceEvent*                   traceEvent,\n                                TraceEventSerializationState* serializationState) {\n    \/\/ We track the original (creation time) \"name\" of each currently live object, so we can\n    \/\/ automatically insert \"base_name\" fields in object snapshot events.\n    auto baseTypeResolver = &(serializationState->fBaseTypeResolver);\n    if (TRACE_EVENT_PHASE_CREATE_OBJECT == traceEvent->fPhase) {\n        SkASSERT(nullptr == baseTypeResolver->find(traceEvent->fID));\n        baseTypeResolver->set(traceEvent->fID, traceEvent->fName);\n    } else if (TRACE_EVENT_PHASE_DELETE_OBJECT == traceEvent->fPhase) {\n        SkASSERT(nullptr != baseTypeResolver->find(traceEvent->fID));\n        baseTypeResolver->remove(traceEvent->fID);\n    }\n\n    writer->beginObject();\n\n    char phaseString[2] = {traceEvent->fPhase, 0};\n    writer->appendString(\"ph\", phaseString);\n    writer->appendString(\"name\", traceEvent->fName);\n    if (0 != traceEvent->fID) {\n        \/\/ IDs are (almost) always pointers\n        writer->appendPointer(\"id\", reinterpret_cast<void*>(traceEvent->fID));\n    }\n\n    \/\/ Offset timestamps to reduce JSON length, then convert nanoseconds to microseconds\n    \/\/ (standard time unit for tracing JSON files).\n    uint64_t relativeTimestamp =\n            static_cast<int64_t>(traceEvent->fClockBegin - serializationState->fClockOffset);\n    writer->appendDoubleDigits(\"ts\", static_cast<double>(relativeTimestamp) * 1E-3, 3);\n    if (0 != traceEvent->fClockEnd) {\n        double dur = static_cast<double>(traceEvent->fClockEnd - traceEvent->fClockBegin) * 1E-3;\n        writer->appendDoubleDigits(\"dur\", dur, 3);\n    }\n\n    writer->appendS64(\"tid\", serializationState->getShortThreadID(traceEvent->fThreadID));\n    \/\/ Trace events *must* include a process ID, but for internal tools this isn't particularly\n    \/\/ important (and certainly not worth adding a cross-platform API to get it).\n    writer->appendS32(\"pid\", 0);\n\n    if (traceEvent->fNumArgs) {\n        writer->beginObject(\"args\");\n        const char* stringTable   = traceEvent->stringTable();\n        bool        addedSnapshot = false;\n        if (TRACE_EVENT_PHASE_SNAPSHOT_OBJECT == traceEvent->fPhase &&\n            baseTypeResolver->find(traceEvent->fID) &&\n            0 != strcmp(*baseTypeResolver->find(traceEvent->fID), traceEvent->fName)) {\n            \/\/ Special handling for snapshots where the name differs from creation.\n            writer->beginObject(\"snapshot\");\n            writer->appendString(\"base_type\", *baseTypeResolver->find(traceEvent->fID));\n            addedSnapshot = true;\n        }\n\n        for (int i = 0; i < traceEvent->fNumArgs; ++i) {\n            const TraceEventArg* arg = traceEvent->args() + i;\n            \/\/ TODO: Skip '#'\n            writer->appendName(arg->fArgName);\n\n            if (arg->fArgName && '#' == arg->fArgName[0]) {\n                writer->beginObject();\n                writer->appendName(\"id_ref\");\n                trace_value_to_json(writer, arg->fArgValue, arg->fArgType, stringTable);\n                writer->endObject();\n            } else {\n                trace_value_to_json(writer, arg->fArgValue, arg->fArgType, stringTable);\n            }\n        }\n\n        if (addedSnapshot) {\n            writer->endObject();\n        }\n\n        writer->endObject();\n    }\n\n    writer->endObject();\n}\n\nvoid ChromeTracingTracer::flush() {\n    SkAutoSpinlock lock(fMutex);\n\n    SkString dirname = SkOSPath::Dirname(fFilename.c_str());\n    if (!dirname.isEmpty() && !sk_exists(dirname.c_str(), kWrite_SkFILE_Flag)) {\n        if (!sk_mkdir(dirname.c_str())) {\n            SkDebugf(\"Failed to create directory.\");\n        }\n    }\n\n    SkFILEWStream fileStream(fFilename.c_str());\n    SkJSONWriter  writer(&fileStream, SkJSONWriter::Mode::kFast);\n    writer.beginArray();\n\n    uint64_t clockOffset = 0;\n    if (fBlocks.count() > 0) {\n        clockOffset = reinterpret_cast<TraceEvent*>(fBlocks[0].fBlock.get())->fClockBegin;\n    } else if (fCurBlock.fEventsInBlock > 0) {\n        clockOffset = reinterpret_cast<TraceEvent*>(fCurBlock.fBlock.get())->fClockBegin;\n    }\n\n    TraceEventSerializationState serializationState(clockOffset);\n\n    auto event_block_to_json = [](SkJSONWriter*                 writer,\n                                  const TraceEventBlock&        block,\n                                  TraceEventSerializationState* serializationState) {\n        TraceEvent* traceEvent = reinterpret_cast<TraceEvent*>(block.fBlock.get());\n        for (int i = 0; i < block.fEventsInBlock; ++i) {\n            trace_event_to_json(writer, traceEvent, serializationState);\n            traceEvent = traceEvent->next();\n        }\n    };\n\n    for (int i = 0; i < fBlocks.count(); ++i) {\n        event_block_to_json(&writer, fBlocks[i], &serializationState);\n    }\n    event_block_to_json(&writer, fCurBlock, &serializationState);\n\n    writer.endArray();\n    writer.flush();\n    fileStream.flush();\n}\n<commit_msg>Add some precision back to timestamps when using --trace<commit_after>\/*\n * Copyright 2017 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\/core\/SkStream.h\"\n#include \"include\/private\/SkThreadID.h\"\n#include \"src\/core\/SkOSFile.h\"\n#include \"src\/core\/SkTraceEvent.h\"\n#include \"src\/utils\/SkJSONWriter.h\"\n#include \"src\/utils\/SkOSPath.h\"\n#include \"tools\/trace\/ChromeTracingTracer.h\"\n\n#include <chrono>\n\nnamespace {\n\n\/**\n * All events have a fixed block of information (TraceEvent), plus variable length payload:\n * {TraceEvent} {TraceEventArgs} {Inline Payload}\n *\/\nstruct TraceEventArg {\n    uint8_t     fArgType;\n    const char* fArgName;\n    uint64_t    fArgValue;\n};\n\n\/\/ These fields are ordered to minimize size due to alignment. Argument types could be packed\n\/\/ better, but very few events have many arguments, so the net loss is pretty small.\nstruct TraceEvent {\n    char     fPhase;\n    uint8_t  fNumArgs;\n    uint32_t fSize;\n\n    const char* fName;\n    \/\/ TODO: Merge fID and fClockEnd (never used together)\n    uint64_t   fID;\n    uint64_t   fClockBegin;\n    uint64_t   fClockEnd;\n    SkThreadID fThreadID;\n\n    TraceEvent* next() {\n        return reinterpret_cast<TraceEvent*>(reinterpret_cast<char*>(this) + fSize);\n    }\n    TraceEventArg* args() { return reinterpret_cast<TraceEventArg*>(this + 1); }\n    char*          stringTable() { return reinterpret_cast<char*>(this->args() + fNumArgs); }\n};\n\n}  \/\/ namespace\n\nChromeTracingTracer::ChromeTracingTracer(const char* filename) : fFilename(filename) {\n    this->createBlock();\n}\n\nChromeTracingTracer::~ChromeTracingTracer() { this->flush(); }\n\nvoid ChromeTracingTracer::createBlock() {\n    fCurBlock.fBlock         = BlockPtr(new uint8_t[kBlockSize]);\n    fCurBlock.fEventsInBlock = 0;\n    fCurBlockUsed            = 0;\n}\n\nSkEventTracer::Handle ChromeTracingTracer::appendEvent(const void* data, size_t size) {\n    SkASSERT(size > 0 && size <= kBlockSize);\n\n    SkAutoSpinlock lock(fMutex);\n    if (fCurBlockUsed + size > kBlockSize) {\n        fBlocks.push_back(std::move(fCurBlock));\n        this->createBlock();\n    }\n    memcpy(fCurBlock.fBlock.get() + fCurBlockUsed, data, size);\n    Handle handle = reinterpret_cast<Handle>(fCurBlock.fBlock.get() + fCurBlockUsed);\n    fCurBlockUsed += size;\n    fCurBlock.fEventsInBlock++;\n    return handle;\n}\n\nSkEventTracer::Handle ChromeTracingTracer::addTraceEvent(char            phase,\n                                                         const uint8_t*  categoryEnabledFlag,\n                                                         const char*     name,\n                                                         uint64_t        id,\n                                                         int             numArgs,\n                                                         const char**    argNames,\n                                                         const uint8_t*  argTypes,\n                                                         const uint64_t* argValues,\n                                                         uint8_t         flags) {\n    \/\/ TODO: Respect flags (or assert). INSTANT events encode scope in flags, should be stored\n    \/\/ using \"s\" key in JSON. COPY flag should be supported or rejected.\n\n    \/\/ Figure out how much extra storage we need for copied strings\n    int size = static_cast<int>(sizeof(TraceEvent) + numArgs * sizeof(TraceEventArg));\n    for (int i = 0; i < numArgs; ++i) {\n        if (TRACE_VALUE_TYPE_COPY_STRING == argTypes[i]) {\n            skia::tracing_internals::TraceValueUnion value;\n            value.as_uint = argValues[i];\n            size += strlen(value.as_string) + 1;\n        }\n    }\n\n    size = SkAlign8(size);\n\n    SkSTArray<128, uint8_t, true> storage;\n    uint8_t*                      storagePtr = storage.push_back_n(size);\n\n    TraceEvent* traceEvent  = reinterpret_cast<TraceEvent*>(storagePtr);\n    traceEvent->fPhase      = phase;\n    traceEvent->fNumArgs    = numArgs;\n    traceEvent->fSize       = size;\n    traceEvent->fName       = name;\n    traceEvent->fID         = id;\n    traceEvent->fClockBegin = std::chrono::steady_clock::now().time_since_epoch().count();\n    traceEvent->fClockEnd   = 0;\n    traceEvent->fThreadID   = SkGetThreadID();\n\n    TraceEventArg* traceEventArgs  = traceEvent->args();\n    char*          stringTableBase = traceEvent->stringTable();\n    char*          stringTable     = stringTableBase;\n    for (int i = 0; i < numArgs; ++i) {\n        traceEventArgs[i].fArgName = argNames[i];\n        traceEventArgs[i].fArgType = argTypes[i];\n        if (TRACE_VALUE_TYPE_COPY_STRING == argTypes[i]) {\n            \/\/ Just write an offset into the arguments array\n            traceEventArgs[i].fArgValue = stringTable - stringTableBase;\n\n            \/\/ Copy string into our buffer (and advance)\n            skia::tracing_internals::TraceValueUnion value;\n            value.as_uint = argValues[i];\n            while (*value.as_string) {\n                *stringTable++ = *value.as_string++;\n            }\n            *stringTable++ = 0;\n        } else {\n            traceEventArgs[i].fArgValue = argValues[i];\n        }\n    }\n\n    return this->appendEvent(storagePtr, size);\n}\n\nvoid ChromeTracingTracer::updateTraceEventDuration(const uint8_t*        categoryEnabledFlag,\n                                                   const char*           name,\n                                                   SkEventTracer::Handle handle) {\n    \/\/ We could probably get away with not locking here, but let's be totally safe.\n    SkAutoSpinlock lock(fMutex);\n    TraceEvent*    traceEvent = reinterpret_cast<TraceEvent*>(handle);\n    traceEvent->fClockEnd         = std::chrono::steady_clock::now().time_since_epoch().count();\n}\n\nstatic void trace_value_to_json(SkJSONWriter* writer,\n                                uint64_t      argValue,\n                                uint8_t       argType,\n                                const char*   stringTableBase) {\n    skia::tracing_internals::TraceValueUnion value;\n    value.as_uint = argValue;\n\n    switch (argType) {\n        case TRACE_VALUE_TYPE_BOOL: writer->appendBool(value.as_bool); break;\n        case TRACE_VALUE_TYPE_UINT: writer->appendU64(value.as_uint); break;\n        case TRACE_VALUE_TYPE_INT: writer->appendS64(value.as_int); break;\n        case TRACE_VALUE_TYPE_DOUBLE: writer->appendDouble(value.as_double); break;\n        case TRACE_VALUE_TYPE_POINTER: writer->appendPointer(value.as_pointer); break;\n        case TRACE_VALUE_TYPE_STRING: writer->appendString(value.as_string); break;\n        case TRACE_VALUE_TYPE_COPY_STRING:\n            writer->appendString(stringTableBase + value.as_uint);\n            break;\n        default: writer->appendString(\"<unknown type>\"); break;\n    }\n}\n\nnamespace {\n\nstruct TraceEventSerializationState {\n    TraceEventSerializationState(uint64_t clockOffset)\n            : fClockOffset(clockOffset), fNextThreadID(0) {}\n\n    int getShortThreadID(SkThreadID id) {\n        if (int* shortIDPtr = fShortThreadIDMap.find(id)) {\n            return *shortIDPtr;\n        }\n        int shortID = fNextThreadID++;\n        fShortThreadIDMap.set(id, shortID);\n        return shortID;\n    }\n\n    uint64_t                          fClockOffset;\n    SkTHashMap<uint64_t, const char*> fBaseTypeResolver;\n    int                               fNextThreadID;\n    SkTHashMap<SkThreadID, int>       fShortThreadIDMap;\n};\n\n}  \/\/ namespace\n\nstatic void trace_event_to_json(SkJSONWriter*                 writer,\n                                TraceEvent*                   traceEvent,\n                                TraceEventSerializationState* serializationState) {\n    \/\/ We track the original (creation time) \"name\" of each currently live object, so we can\n    \/\/ automatically insert \"base_name\" fields in object snapshot events.\n    auto baseTypeResolver = &(serializationState->fBaseTypeResolver);\n    if (TRACE_EVENT_PHASE_CREATE_OBJECT == traceEvent->fPhase) {\n        SkASSERT(nullptr == baseTypeResolver->find(traceEvent->fID));\n        baseTypeResolver->set(traceEvent->fID, traceEvent->fName);\n    } else if (TRACE_EVENT_PHASE_DELETE_OBJECT == traceEvent->fPhase) {\n        SkASSERT(nullptr != baseTypeResolver->find(traceEvent->fID));\n        baseTypeResolver->remove(traceEvent->fID);\n    }\n\n    writer->beginObject();\n\n    char phaseString[2] = {traceEvent->fPhase, 0};\n    writer->appendString(\"ph\", phaseString);\n    writer->appendString(\"name\", traceEvent->fName);\n    if (0 != traceEvent->fID) {\n        \/\/ IDs are (almost) always pointers\n        writer->appendPointer(\"id\", reinterpret_cast<void*>(traceEvent->fID));\n    }\n\n    \/\/ Offset timestamps to reduce JSON length, then convert nanoseconds to microseconds\n    \/\/ (standard time unit for tracing JSON files).\n    uint64_t relativeTimestamp =\n            static_cast<int64_t>(traceEvent->fClockBegin - serializationState->fClockOffset);\n    writer->appendDouble(\"ts\", static_cast<double>(relativeTimestamp) * 1E-3);\n    if (0 != traceEvent->fClockEnd) {\n        double dur = static_cast<double>(traceEvent->fClockEnd - traceEvent->fClockBegin) * 1E-3;\n        writer->appendDouble(\"dur\", dur);\n    }\n\n    writer->appendS64(\"tid\", serializationState->getShortThreadID(traceEvent->fThreadID));\n    \/\/ Trace events *must* include a process ID, but for internal tools this isn't particularly\n    \/\/ important (and certainly not worth adding a cross-platform API to get it).\n    writer->appendS32(\"pid\", 0);\n\n    if (traceEvent->fNumArgs) {\n        writer->beginObject(\"args\");\n        const char* stringTable   = traceEvent->stringTable();\n        bool        addedSnapshot = false;\n        if (TRACE_EVENT_PHASE_SNAPSHOT_OBJECT == traceEvent->fPhase &&\n            baseTypeResolver->find(traceEvent->fID) &&\n            0 != strcmp(*baseTypeResolver->find(traceEvent->fID), traceEvent->fName)) {\n            \/\/ Special handling for snapshots where the name differs from creation.\n            writer->beginObject(\"snapshot\");\n            writer->appendString(\"base_type\", *baseTypeResolver->find(traceEvent->fID));\n            addedSnapshot = true;\n        }\n\n        for (int i = 0; i < traceEvent->fNumArgs; ++i) {\n            const TraceEventArg* arg = traceEvent->args() + i;\n            \/\/ TODO: Skip '#'\n            writer->appendName(arg->fArgName);\n\n            if (arg->fArgName && '#' == arg->fArgName[0]) {\n                writer->beginObject();\n                writer->appendName(\"id_ref\");\n                trace_value_to_json(writer, arg->fArgValue, arg->fArgType, stringTable);\n                writer->endObject();\n            } else {\n                trace_value_to_json(writer, arg->fArgValue, arg->fArgType, stringTable);\n            }\n        }\n\n        if (addedSnapshot) {\n            writer->endObject();\n        }\n\n        writer->endObject();\n    }\n\n    writer->endObject();\n}\n\nvoid ChromeTracingTracer::flush() {\n    SkAutoSpinlock lock(fMutex);\n\n    SkString dirname = SkOSPath::Dirname(fFilename.c_str());\n    if (!dirname.isEmpty() && !sk_exists(dirname.c_str(), kWrite_SkFILE_Flag)) {\n        if (!sk_mkdir(dirname.c_str())) {\n            SkDebugf(\"Failed to create directory.\");\n        }\n    }\n\n    SkFILEWStream fileStream(fFilename.c_str());\n    SkJSONWriter  writer(&fileStream, SkJSONWriter::Mode::kFast);\n    writer.beginArray();\n\n    uint64_t clockOffset = 0;\n    if (fBlocks.count() > 0) {\n        clockOffset = reinterpret_cast<TraceEvent*>(fBlocks[0].fBlock.get())->fClockBegin;\n    } else if (fCurBlock.fEventsInBlock > 0) {\n        clockOffset = reinterpret_cast<TraceEvent*>(fCurBlock.fBlock.get())->fClockBegin;\n    }\n\n    TraceEventSerializationState serializationState(clockOffset);\n\n    auto event_block_to_json = [](SkJSONWriter*                 writer,\n                                  const TraceEventBlock&        block,\n                                  TraceEventSerializationState* serializationState) {\n        TraceEvent* traceEvent = reinterpret_cast<TraceEvent*>(block.fBlock.get());\n        for (int i = 0; i < block.fEventsInBlock; ++i) {\n            trace_event_to_json(writer, traceEvent, serializationState);\n            traceEvent = traceEvent->next();\n        }\n    };\n\n    for (int i = 0; i < fBlocks.count(); ++i) {\n        event_block_to_json(&writer, fBlocks[i], &serializationState);\n    }\n    event_block_to_json(&writer, fCurBlock, &serializationState);\n\n    writer.endArray();\n    writer.flush();\n    fileStream.flush();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    This file is part of KOrganizer.\n    Copyright (c) 2002 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 \"entry.h\"\n\nusing namespace KNS;\n\nEntry::Entry() :\n  mRelease( 0 ), mReleaseDate( QDate::currentDate() ), mRating( 0 ),\n  mDownloads( 0 )\n{\n}\n\nEntry::Entry( const QDomElement &e )\n{\n  parseDomElement( e );\n}\n\nEntry::~Entry()\n{\n}\n\n\nvoid Entry::setName( const QString &name )\n{\n  mName = name;\n}\n\nQString Entry::name() const\n{\n  return mName;\n}\n\n\nvoid Entry::setType( const QString &type )\n{\n  mType = type;\n}\n\nQString Entry::type() const\n{\n  return mType;\n}\n\n\nvoid Entry::setAuthor( const QString &author )\n{\n  mAuthor = author;\n}\n\nQString Entry::author() const\n{\n  return mAuthor;\n}\n\n\nvoid Entry::setLicence( const QString &license )\n{\n  mLicence = license;\n}\n\nQString Entry::license() const\n{\n  return mLicence;\n}\n\n\nvoid Entry::setSummary( const QString &text, const QString &lang )\n{\n  mSummaryMap.insert( lang, text );\n\n  if ( mLangs.find( lang ) == mLangs.end() ) mLangs.append( lang );\n}\n\nQString Entry::summary( const QString &lang ) const\n{\n  if ( mSummaryMap.isEmpty() ) return QString::null;\n\n  if ( lang.isEmpty() ) {\n    if ( !mSummaryMap[ lang ].isEmpty() ) return mSummaryMap[ lang ];\n    else return *(mSummaryMap.begin());\n  } else {\n    return mSummaryMap[ lang ];\n  }\n}\n\n\nvoid Entry::setVersion( const QString &version )\n{\n  mVersion = version;\n}\n\nQString Entry::version() const\n{\n  return mVersion;\n}\n\n\nvoid Entry::setRelease( int release )\n{\n  mRelease = release;\n}\n\nint Entry::release() const\n{\n  return mRelease;\n}\n\n\nvoid Entry::setReleaseDate( const QDate &d )\n{\n  mReleaseDate = d;\n}\n\nQDate Entry::releaseDate() const\n{\n  return mReleaseDate;\n}\n\n\nvoid Entry::setPayload( const KURL &url, const QString &lang )\n{\n  mPayloadMap.insert( lang, url );\n\n  if ( mLangs.find( lang ) == mLangs.end() ) mLangs.append( lang );\n}\n\nKURL Entry::payload( const QString &lang ) const\n{\n  KURL payload = mPayloadMap[ lang ];\n  if ( payload.isEmpty() && !mPayloadMap.isEmpty() ) {\n    payload = *(mPayloadMap.begin());\n  }\n  return payload;\n}\n\n\nvoid Entry::setPreview( const KURL &url, const QString &lang )\n{\n  mPreviewMap.insert( lang, url );\n  \n  if ( mLangs.find( lang ) == mLangs.end() ) mLangs.append( lang );\n}\n\nKURL Entry::preview( const QString &lang ) const\n{\n  KURL preview = mPreviewMap[ lang ];\n  if ( preview.isEmpty() && !mPreviewMap.isEmpty() ) {\n    preview = *(mPreviewMap.begin());\n  }\n  return preview;\n}\n\n\nvoid Entry::setRating( int rating )\n{\n  mRating = rating;\n}\n\nint Entry::rating()\n{\n  return mRating;\n}\n\n\nvoid Entry::setDownloads( int downloads )\n{\n  mDownloads = downloads;\n}\n\nint Entry::downloads()\n{\n  return mDownloads;\n}\n\nQString Entry::fullName()\n{\n  return name() + \"-\" + version() + \"-\" + QString::number( release() );\n}\n\nQStringList Entry::langs()\n{\n  return mLangs;\n}\n\nvoid Entry::parseDomElement( const QDomElement &element )\n{\n  if ( element.tagName() != \"stuff\" ) return;\n  mType = element.attribute(\"type\");\n\n  QDomNode n;\n  for( n = element.firstChild(); !n.isNull(); n = n.nextSibling() ) {\n    QDomElement e = n.toElement();\n    if ( e.tagName() == \"name\" ) setName( e.text().stripWhiteSpace() );\n    if ( e.tagName() == \"author\" ) setAuthor( e.text().stripWhiteSpace() );\n    if ( e.tagName() == \"licence\" ) setLicense( e.text().stripWhiteSpace() );\n    if ( e.tagName() == \"summary\" ) {\n      QString lang = e.attribute( \"lang \" );\n      setSummary( e.text().stripWhiteSpace(), lang );\n    }\n    if ( e.tagName() == \"version\" ) setVersion( e.text().stripWhiteSpace() );\n    if ( e.tagName() == \"release\" ) setRelease( e.text().toInt() );\n    if ( e.tagName() == \"releasedate\" ) {\n      QDate date = QDate::fromString( e.text().stripWhiteSpace(), Qt::ISODate );\n      setReleaseDate( date );\n    }\n    if ( e.tagName() == \"preview\" ) {\n      QString lang = e.attribute( \"lang\" );\n      setPreview( e.text().stripWhiteSpace(), lang );\n    }\n    if ( e.tagName() == \"payload\" ) {\n      QString lang = e.attribute( \"lang\" );\n      setPayload( e.text().stripWhiteSpace(), lang );\n    }\n    if ( e.tagName() == \"rating\" ) setRating( e.text().toInt() );\n    if ( e.tagName() == \"downloads\" ) setDownloads( e.text().toInt() );\n  }\n}\n\nQDomElement Entry::createDomElement( QDomDocument &doc,\n                                              QDomElement &parent )\n{\n  QDomElement entry = doc.createElement( \"stuff\" );\n  parent.appendChild( entry );\n\n  addElement( doc, entry, \"name\", name() );\n  addElement( doc, entry, \"author\", author() );\n  addElement( doc, entry, \"licence\", license() );\n  addElement( doc, entry, \"version\", version() );\n  addElement( doc, entry, \"release\", QString::number( release() ) );\n  addElement( doc, entry, \"rating\", QString::number( rating() ) );\n  addElement( doc, entry, \"downloads\", QString::number( downloads() ) );\n\n  addElement( doc, entry, \"releasedate\",\n              releaseDate().toString( Qt::ISODate ) );\n\n  QStringList ls = langs();\n  QStringList::ConstIterator it;\n  for( it = ls.begin(); it != ls.end(); ++it ) {\n    QDomElement e = addElement( doc, entry, \"summary\", summary( *it ) );\n    e.setAttribute( \"lang\", *it );\n    e = addElement( doc, entry, \"preview\", preview( *it ).url() );\n    e.setAttribute( \"lang\", *it );\n    e = addElement( doc, entry, \"payload\", payload( *it ).url() );\n    e.setAttribute( \"lang\", *it );\n  }\n\n  return entry;\n}\n\nQDomElement Entry::addElement( QDomDocument &doc, QDomElement &parent,\n                               const QString &tag, const QString &value )\n{\n  QDomElement n = doc.createElement( tag );\n  n.appendChild( doc.createTextNode( value ) );\n  parent.appendChild( n );\n  \n  return n;\n}\n<commit_msg>it's nice if it's spelled at least in one country correctly, but even cooler if it compiles in all countries<commit_after>\/*\n    This file is part of KOrganizer.\n    Copyright (c) 2002 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 \"entry.h\"\n\nusing namespace KNS;\n\nEntry::Entry() :\n  mRelease( 0 ), mReleaseDate( QDate::currentDate() ), mRating( 0 ),\n  mDownloads( 0 )\n{\n}\n\nEntry::Entry( const QDomElement &e )\n{\n  parseDomElement( e );\n}\n\nEntry::~Entry()\n{\n}\n\n\nvoid Entry::setName( const QString &name )\n{\n  mName = name;\n}\n\nQString Entry::name() const\n{\n  return mName;\n}\n\n\nvoid Entry::setType( const QString &type )\n{\n  mType = type;\n}\n\nQString Entry::type() const\n{\n  return mType;\n}\n\n\nvoid Entry::setAuthor( const QString &author )\n{\n  mAuthor = author;\n}\n\nQString Entry::author() const\n{\n  return mAuthor;\n}\n\n\nvoid Entry::setLicence( const QString &license )\n{\n  mLicence = license;\n}\n\nQString Entry::license() const\n{\n  return mLicence;\n}\n\n\nvoid Entry::setSummary( const QString &text, const QString &lang )\n{\n  mSummaryMap.insert( lang, text );\n\n  if ( mLangs.find( lang ) == mLangs.end() ) mLangs.append( lang );\n}\n\nQString Entry::summary( const QString &lang ) const\n{\n  if ( mSummaryMap.isEmpty() ) return QString::null;\n\n  if ( lang.isEmpty() ) {\n    if ( !mSummaryMap[ lang ].isEmpty() ) return mSummaryMap[ lang ];\n    else return *(mSummaryMap.begin());\n  } else {\n    return mSummaryMap[ lang ];\n  }\n}\n\n\nvoid Entry::setVersion( const QString &version )\n{\n  mVersion = version;\n}\n\nQString Entry::version() const\n{\n  return mVersion;\n}\n\n\nvoid Entry::setRelease( int release )\n{\n  mRelease = release;\n}\n\nint Entry::release() const\n{\n  return mRelease;\n}\n\n\nvoid Entry::setReleaseDate( const QDate &d )\n{\n  mReleaseDate = d;\n}\n\nQDate Entry::releaseDate() const\n{\n  return mReleaseDate;\n}\n\n\nvoid Entry::setPayload( const KURL &url, const QString &lang )\n{\n  mPayloadMap.insert( lang, url );\n\n  if ( mLangs.find( lang ) == mLangs.end() ) mLangs.append( lang );\n}\n\nKURL Entry::payload( const QString &lang ) const\n{\n  KURL payload = mPayloadMap[ lang ];\n  if ( payload.isEmpty() && !mPayloadMap.isEmpty() ) {\n    payload = *(mPayloadMap.begin());\n  }\n  return payload;\n}\n\n\nvoid Entry::setPreview( const KURL &url, const QString &lang )\n{\n  mPreviewMap.insert( lang, url );\n  \n  if ( mLangs.find( lang ) == mLangs.end() ) mLangs.append( lang );\n}\n\nKURL Entry::preview( const QString &lang ) const\n{\n  KURL preview = mPreviewMap[ lang ];\n  if ( preview.isEmpty() && !mPreviewMap.isEmpty() ) {\n    preview = *(mPreviewMap.begin());\n  }\n  return preview;\n}\n\n\nvoid Entry::setRating( int rating )\n{\n  mRating = rating;\n}\n\nint Entry::rating()\n{\n  return mRating;\n}\n\n\nvoid Entry::setDownloads( int downloads )\n{\n  mDownloads = downloads;\n}\n\nint Entry::downloads()\n{\n  return mDownloads;\n}\n\nQString Entry::fullName()\n{\n  return name() + \"-\" + version() + \"-\" + QString::number( release() );\n}\n\nQStringList Entry::langs()\n{\n  return mLangs;\n}\n\nvoid Entry::parseDomElement( const QDomElement &element )\n{\n  if ( element.tagName() != \"stuff\" ) return;\n  mType = element.attribute(\"type\");\n\n  QDomNode n;\n  for( n = element.firstChild(); !n.isNull(); n = n.nextSibling() ) {\n    QDomElement e = n.toElement();\n    if ( e.tagName() == \"name\" ) setName( e.text().stripWhiteSpace() );\n    if ( e.tagName() == \"author\" ) setAuthor( e.text().stripWhiteSpace() );\n    if ( e.tagName() == \"licence\" ) setLicence( e.text().stripWhiteSpace() );\n    if ( e.tagName() == \"summary\" ) {\n      QString lang = e.attribute( \"lang \" );\n      setSummary( e.text().stripWhiteSpace(), lang );\n    }\n    if ( e.tagName() == \"version\" ) setVersion( e.text().stripWhiteSpace() );\n    if ( e.tagName() == \"release\" ) setRelease( e.text().toInt() );\n    if ( e.tagName() == \"releasedate\" ) {\n      QDate date = QDate::fromString( e.text().stripWhiteSpace(), Qt::ISODate );\n      setReleaseDate( date );\n    }\n    if ( e.tagName() == \"preview\" ) {\n      QString lang = e.attribute( \"lang\" );\n      setPreview( e.text().stripWhiteSpace(), lang );\n    }\n    if ( e.tagName() == \"payload\" ) {\n      QString lang = e.attribute( \"lang\" );\n      setPayload( e.text().stripWhiteSpace(), lang );\n    }\n    if ( e.tagName() == \"rating\" ) setRating( e.text().toInt() );\n    if ( e.tagName() == \"downloads\" ) setDownloads( e.text().toInt() );\n  }\n}\n\nQDomElement Entry::createDomElement( QDomDocument &doc,\n                                              QDomElement &parent )\n{\n  QDomElement entry = doc.createElement( \"stuff\" );\n  parent.appendChild( entry );\n\n  addElement( doc, entry, \"name\", name() );\n  addElement( doc, entry, \"author\", author() );\n  addElement( doc, entry, \"licence\", license() );\n  addElement( doc, entry, \"version\", version() );\n  addElement( doc, entry, \"release\", QString::number( release() ) );\n  addElement( doc, entry, \"rating\", QString::number( rating() ) );\n  addElement( doc, entry, \"downloads\", QString::number( downloads() ) );\n\n  addElement( doc, entry, \"releasedate\",\n              releaseDate().toString( Qt::ISODate ) );\n\n  QStringList ls = langs();\n  QStringList::ConstIterator it;\n  for( it = ls.begin(); it != ls.end(); ++it ) {\n    QDomElement e = addElement( doc, entry, \"summary\", summary( *it ) );\n    e.setAttribute( \"lang\", *it );\n    e = addElement( doc, entry, \"preview\", preview( *it ).url() );\n    e.setAttribute( \"lang\", *it );\n    e = addElement( doc, entry, \"payload\", payload( *it ).url() );\n    e.setAttribute( \"lang\", *it );\n  }\n\n  return entry;\n}\n\nQDomElement Entry::addElement( QDomDocument &doc, QDomElement &parent,\n                               const QString &tag, const QString &value )\n{\n  QDomElement n = doc.createElement( tag );\n  n.appendChild( doc.createTextNode( value ) );\n  parent.appendChild( n );\n  \n  return n;\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 <grpc\/support\/port_platform.h>\n\n#include <grpc\/support\/alloc.h>\n#include <grpc\/support\/log.h>\n\n#include \"src\/core\/lib\/compression\/stream_compression_gzip.h\"\n#include \"src\/core\/lib\/iomgr\/exec_ctx.h\"\n#include \"src\/core\/lib\/slice\/slice_internal.h\"\n\n#define OUTPUT_BLOCK_SIZE (1024)\n\ntypedef struct grpc_stream_compression_context_gzip {\n  grpc_stream_compression_context base;\n\n  z_stream zs;\n  int (*flate)(z_stream* zs, int flush);\n} grpc_stream_compression_context_gzip;\n\nstatic bool gzip_flate(grpc_stream_compression_context_gzip* ctx,\n                       grpc_slice_buffer* in, grpc_slice_buffer* out,\n                       size_t* output_size, size_t max_output_size, int flush,\n                       bool* end_of_context) {\n  GPR_ASSERT(flush == 0 || flush == Z_SYNC_FLUSH || flush == Z_FINISH);\n  \/* Full flush is not allowed when inflating. *\/\n  GPR_ASSERT(!(ctx->flate == inflate && (flush == Z_FINISH)));\n\n  grpc_core::ExecCtx exec_ctx;\n  int r;\n  bool eoc = false;\n  size_t original_max_output_size = max_output_size;\n  while (max_output_size > 0 && (in->length > 0 || flush) && !eoc) {\n    size_t slice_size = max_output_size < OUTPUT_BLOCK_SIZE ? max_output_size\n                                                            : OUTPUT_BLOCK_SIZE;\n    grpc_slice slice_out = GRPC_SLICE_MALLOC(slice_size);\n    ctx->zs.avail_out = static_cast<uInt>(slice_size);\n    ctx->zs.next_out = GRPC_SLICE_START_PTR(slice_out);\n    while (ctx->zs.avail_out > 0 && in->length > 0 && !eoc) {\n      grpc_slice slice = grpc_slice_buffer_take_first(in);\n      ctx->zs.avail_in = static_cast<uInt> GRPC_SLICE_LENGTH(slice);\n      ctx->zs.next_in = GRPC_SLICE_START_PTR(slice);\n      r = ctx->flate(&ctx->zs, Z_NO_FLUSH);\n      if (r < 0 && r != Z_BUF_ERROR) {\n        gpr_log(GPR_ERROR, \"zlib error (%d)\", r);\n        grpc_slice_unref_internal(slice_out);\n\n        return false;\n      } else if (r == Z_STREAM_END && ctx->flate == inflate) {\n        eoc = true;\n      }\n      if (ctx->zs.avail_in > 0) {\n        grpc_slice_buffer_undo_take_first(\n            in,\n            grpc_slice_sub(slice, GRPC_SLICE_LENGTH(slice) - ctx->zs.avail_in,\n                           GRPC_SLICE_LENGTH(slice)));\n      }\n      grpc_slice_unref_internal(slice);\n    }\n    if (flush != 0 && ctx->zs.avail_out > 0 && !eoc) {\n      GPR_ASSERT(in->length == 0);\n      r = ctx->flate(&ctx->zs, flush);\n      if (flush == Z_SYNC_FLUSH) {\n        switch (r) {\n          case Z_OK:\n            \/* Maybe flush is not complete; just made some partial progress. *\/\n            if (ctx->zs.avail_out > 0) {\n              flush = 0;\n            }\n            break;\n          case Z_BUF_ERROR:\n          case Z_STREAM_END:\n            flush = 0;\n            break;\n          default:\n            gpr_log(GPR_ERROR, \"zlib error (%d)\", r);\n            grpc_slice_unref_internal(slice_out);\n\n            return false;\n        }\n      } else if (flush == Z_FINISH) {\n        switch (r) {\n          case Z_OK:\n          case Z_BUF_ERROR:\n            \/* Wait for the next loop to assign additional output space. *\/\n            GPR_ASSERT(ctx->zs.avail_out == 0);\n            break;\n          case Z_STREAM_END:\n            flush = 0;\n            break;\n          default:\n            gpr_log(GPR_ERROR, \"zlib error (%d)\", r);\n            grpc_slice_unref_internal(slice_out);\n\n            return false;\n        }\n      }\n    }\n\n    if (ctx->zs.avail_out == 0) {\n      grpc_slice_buffer_add(out, slice_out);\n    } else if (ctx->zs.avail_out < slice_size) {\n      size_t len = GRPC_SLICE_LENGTH(slice_out);\n      GRPC_SLICE_SET_LENGTH(slice_out, len - ctx->zs.avail_out);\n      grpc_slice_buffer_add(out, slice_out);\n    } else {\n      grpc_slice_unref_internal(slice_out);\n    }\n    max_output_size -= (slice_size - ctx->zs.avail_out);\n  }\n\n  if (end_of_context) {\n    *end_of_context = eoc;\n  }\n  if (output_size) {\n    *output_size = original_max_output_size - max_output_size;\n  }\n  return true;\n}\n\nstatic bool grpc_stream_compress_gzip(grpc_stream_compression_context* ctx,\n                                      grpc_slice_buffer* in,\n                                      grpc_slice_buffer* out,\n                                      size_t* output_size,\n                                      size_t max_output_size,\n                                      grpc_stream_compression_flush flush) {\n  if (ctx == nullptr) {\n    return false;\n  }\n  grpc_stream_compression_context_gzip* gzip_ctx =\n      reinterpret_cast<grpc_stream_compression_context_gzip*>(ctx);\n  GPR_ASSERT(gzip_ctx->flate == deflate);\n  int gzip_flush;\n  switch (flush) {\n    case GRPC_STREAM_COMPRESSION_FLUSH_NONE:\n      gzip_flush = 0;\n      break;\n    case GRPC_STREAM_COMPRESSION_FLUSH_SYNC:\n      gzip_flush = Z_SYNC_FLUSH;\n      break;\n    case GRPC_STREAM_COMPRESSION_FLUSH_FINISH:\n      gzip_flush = Z_FINISH;\n      break;\n    default:\n      gzip_flush = 0;\n  }\n  return gzip_flate(gzip_ctx, in, out, output_size, max_output_size, gzip_flush,\n                    nullptr);\n}\n\nstatic bool grpc_stream_decompress_gzip(grpc_stream_compression_context* ctx,\n                                        grpc_slice_buffer* in,\n                                        grpc_slice_buffer* out,\n                                        size_t* output_size,\n                                        size_t max_output_size,\n                                        bool* end_of_context) {\n  if (ctx == nullptr) {\n    return false;\n  }\n  grpc_stream_compression_context_gzip* gzip_ctx =\n      reinterpret_cast<grpc_stream_compression_context_gzip*>(ctx);\n  GPR_ASSERT(gzip_ctx->flate == inflate);\n  return gzip_flate(gzip_ctx, in, out, output_size, max_output_size,\n                    Z_SYNC_FLUSH, end_of_context);\n}\n\nstatic grpc_stream_compression_context*\ngrpc_stream_compression_context_create_gzip(\n    grpc_stream_compression_method method) {\n  GPR_ASSERT(method == GRPC_STREAM_COMPRESSION_GZIP_COMPRESS ||\n             method == GRPC_STREAM_COMPRESSION_GZIP_DECOMPRESS);\n  grpc_stream_compression_context_gzip* gzip_ctx =\n      static_cast<grpc_stream_compression_context_gzip*>(\n          gpr_zalloc(sizeof(grpc_stream_compression_context_gzip)));\n  int r;\n  if (gzip_ctx == nullptr) {\n    return nullptr;\n  }\n  if (method == GRPC_STREAM_COMPRESSION_GZIP_DECOMPRESS) {\n    r = inflateInit2(&gzip_ctx->zs, 0x1F);\n    gzip_ctx->flate = inflate;\n  } else {\n    r = deflateInit2(&gzip_ctx->zs, Z_DEFAULT_COMPRESSION, Z_DEFLATED, 0x1F, 8,\n                     Z_DEFAULT_STRATEGY);\n    gzip_ctx->flate = deflate;\n  }\n  if (r != Z_OK) {\n    gpr_free(gzip_ctx);\n    return nullptr;\n  }\n\n  gzip_ctx->base.vtable = &grpc_stream_compression_gzip_vtable;\n  return reinterpret_cast<grpc_stream_compression_context*>(gzip_ctx);\n}\n\nstatic void grpc_stream_compression_context_destroy_gzip(\n    grpc_stream_compression_context* ctx) {\n  if (ctx == nullptr) {\n    return;\n  }\n  grpc_stream_compression_context_gzip* gzip_ctx =\n      reinterpret_cast<grpc_stream_compression_context_gzip*>(ctx);\n  if (gzip_ctx->flate == inflate) {\n    inflateEnd(&gzip_ctx->zs);\n  } else {\n    deflateEnd(&gzip_ctx->zs);\n  }\n  gpr_free(ctx);\n}\n\nconst grpc_stream_compression_vtable grpc_stream_compression_gzip_vtable = {\n    grpc_stream_compress_gzip, grpc_stream_decompress_gzip,\n    grpc_stream_compression_context_create_gzip,\n    grpc_stream_compression_context_destroy_gzip};\n<commit_msg>Fix a memory leak<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 <grpc\/support\/port_platform.h>\n\n#include <grpc\/support\/alloc.h>\n#include <grpc\/support\/log.h>\n\n#include \"src\/core\/lib\/compression\/stream_compression_gzip.h\"\n#include \"src\/core\/lib\/iomgr\/exec_ctx.h\"\n#include \"src\/core\/lib\/slice\/slice_internal.h\"\n\n#define OUTPUT_BLOCK_SIZE (1024)\n\ntypedef struct grpc_stream_compression_context_gzip {\n  grpc_stream_compression_context base;\n\n  z_stream zs;\n  int (*flate)(z_stream* zs, int flush);\n} grpc_stream_compression_context_gzip;\n\nstatic bool gzip_flate(grpc_stream_compression_context_gzip* ctx,\n                       grpc_slice_buffer* in, grpc_slice_buffer* out,\n                       size_t* output_size, size_t max_output_size, int flush,\n                       bool* end_of_context) {\n  GPR_ASSERT(flush == 0 || flush == Z_SYNC_FLUSH || flush == Z_FINISH);\n  \/* Full flush is not allowed when inflating. *\/\n  GPR_ASSERT(!(ctx->flate == inflate && (flush == Z_FINISH)));\n\n  grpc_core::ExecCtx exec_ctx;\n  int r;\n  bool eoc = false;\n  size_t original_max_output_size = max_output_size;\n  while (max_output_size > 0 && (in->length > 0 || flush) && !eoc) {\n    size_t slice_size = max_output_size < OUTPUT_BLOCK_SIZE ? max_output_size\n                                                            : OUTPUT_BLOCK_SIZE;\n    grpc_slice slice_out = GRPC_SLICE_MALLOC(slice_size);\n    ctx->zs.avail_out = static_cast<uInt>(slice_size);\n    ctx->zs.next_out = GRPC_SLICE_START_PTR(slice_out);\n    while (ctx->zs.avail_out > 0 && in->length > 0 && !eoc) {\n      grpc_slice slice = grpc_slice_buffer_take_first(in);\n      ctx->zs.avail_in = static_cast<uInt> GRPC_SLICE_LENGTH(slice);\n      ctx->zs.next_in = GRPC_SLICE_START_PTR(slice);\n      r = ctx->flate(&ctx->zs, Z_NO_FLUSH);\n      if (r < 0 && r != Z_BUF_ERROR) {\n        gpr_log(GPR_ERROR, \"zlib error (%d)\", r);\n        grpc_slice_unref_internal(slice_out);\n        grpc_slice_unref_internal(slice);\n        return false;\n      } else if (r == Z_STREAM_END && ctx->flate == inflate) {\n        eoc = true;\n      }\n      if (ctx->zs.avail_in > 0) {\n        grpc_slice_buffer_undo_take_first(\n            in,\n            grpc_slice_sub(slice, GRPC_SLICE_LENGTH(slice) - ctx->zs.avail_in,\n                           GRPC_SLICE_LENGTH(slice)));\n      }\n      grpc_slice_unref_internal(slice);\n    }\n    if (flush != 0 && ctx->zs.avail_out > 0 && !eoc) {\n      GPR_ASSERT(in->length == 0);\n      r = ctx->flate(&ctx->zs, flush);\n      if (flush == Z_SYNC_FLUSH) {\n        switch (r) {\n          case Z_OK:\n            \/* Maybe flush is not complete; just made some partial progress. *\/\n            if (ctx->zs.avail_out > 0) {\n              flush = 0;\n            }\n            break;\n          case Z_BUF_ERROR:\n          case Z_STREAM_END:\n            flush = 0;\n            break;\n          default:\n            gpr_log(GPR_ERROR, \"zlib error (%d)\", r);\n            grpc_slice_unref_internal(slice_out);\n\n            return false;\n        }\n      } else if (flush == Z_FINISH) {\n        switch (r) {\n          case Z_OK:\n          case Z_BUF_ERROR:\n            \/* Wait for the next loop to assign additional output space. *\/\n            GPR_ASSERT(ctx->zs.avail_out == 0);\n            break;\n          case Z_STREAM_END:\n            flush = 0;\n            break;\n          default:\n            gpr_log(GPR_ERROR, \"zlib error (%d)\", r);\n            grpc_slice_unref_internal(slice_out);\n\n            return false;\n        }\n      }\n    }\n\n    if (ctx->zs.avail_out == 0) {\n      grpc_slice_buffer_add(out, slice_out);\n    } else if (ctx->zs.avail_out < slice_size) {\n      size_t len = GRPC_SLICE_LENGTH(slice_out);\n      GRPC_SLICE_SET_LENGTH(slice_out, len - ctx->zs.avail_out);\n      grpc_slice_buffer_add(out, slice_out);\n    } else {\n      grpc_slice_unref_internal(slice_out);\n    }\n    max_output_size -= (slice_size - ctx->zs.avail_out);\n  }\n\n  if (end_of_context) {\n    *end_of_context = eoc;\n  }\n  if (output_size) {\n    *output_size = original_max_output_size - max_output_size;\n  }\n  return true;\n}\n\nstatic bool grpc_stream_compress_gzip(grpc_stream_compression_context* ctx,\n                                      grpc_slice_buffer* in,\n                                      grpc_slice_buffer* out,\n                                      size_t* output_size,\n                                      size_t max_output_size,\n                                      grpc_stream_compression_flush flush) {\n  if (ctx == nullptr) {\n    return false;\n  }\n  grpc_stream_compression_context_gzip* gzip_ctx =\n      reinterpret_cast<grpc_stream_compression_context_gzip*>(ctx);\n  GPR_ASSERT(gzip_ctx->flate == deflate);\n  int gzip_flush;\n  switch (flush) {\n    case GRPC_STREAM_COMPRESSION_FLUSH_NONE:\n      gzip_flush = 0;\n      break;\n    case GRPC_STREAM_COMPRESSION_FLUSH_SYNC:\n      gzip_flush = Z_SYNC_FLUSH;\n      break;\n    case GRPC_STREAM_COMPRESSION_FLUSH_FINISH:\n      gzip_flush = Z_FINISH;\n      break;\n    default:\n      gzip_flush = 0;\n  }\n  return gzip_flate(gzip_ctx, in, out, output_size, max_output_size, gzip_flush,\n                    nullptr);\n}\n\nstatic bool grpc_stream_decompress_gzip(grpc_stream_compression_context* ctx,\n                                        grpc_slice_buffer* in,\n                                        grpc_slice_buffer* out,\n                                        size_t* output_size,\n                                        size_t max_output_size,\n                                        bool* end_of_context) {\n  if (ctx == nullptr) {\n    return false;\n  }\n  grpc_stream_compression_context_gzip* gzip_ctx =\n      reinterpret_cast<grpc_stream_compression_context_gzip*>(ctx);\n  GPR_ASSERT(gzip_ctx->flate == inflate);\n  return gzip_flate(gzip_ctx, in, out, output_size, max_output_size,\n                    Z_SYNC_FLUSH, end_of_context);\n}\n\nstatic grpc_stream_compression_context*\ngrpc_stream_compression_context_create_gzip(\n    grpc_stream_compression_method method) {\n  GPR_ASSERT(method == GRPC_STREAM_COMPRESSION_GZIP_COMPRESS ||\n             method == GRPC_STREAM_COMPRESSION_GZIP_DECOMPRESS);\n  grpc_stream_compression_context_gzip* gzip_ctx =\n      static_cast<grpc_stream_compression_context_gzip*>(\n          gpr_zalloc(sizeof(grpc_stream_compression_context_gzip)));\n  int r;\n  if (gzip_ctx == nullptr) {\n    return nullptr;\n  }\n  if (method == GRPC_STREAM_COMPRESSION_GZIP_DECOMPRESS) {\n    r = inflateInit2(&gzip_ctx->zs, 0x1F);\n    gzip_ctx->flate = inflate;\n  } else {\n    r = deflateInit2(&gzip_ctx->zs, Z_DEFAULT_COMPRESSION, Z_DEFLATED, 0x1F, 8,\n                     Z_DEFAULT_STRATEGY);\n    gzip_ctx->flate = deflate;\n  }\n  if (r != Z_OK) {\n    gpr_free(gzip_ctx);\n    return nullptr;\n  }\n\n  gzip_ctx->base.vtable = &grpc_stream_compression_gzip_vtable;\n  return reinterpret_cast<grpc_stream_compression_context*>(gzip_ctx);\n}\n\nstatic void grpc_stream_compression_context_destroy_gzip(\n    grpc_stream_compression_context* ctx) {\n  if (ctx == nullptr) {\n    return;\n  }\n  grpc_stream_compression_context_gzip* gzip_ctx =\n      reinterpret_cast<grpc_stream_compression_context_gzip*>(ctx);\n  if (gzip_ctx->flate == inflate) {\n    inflateEnd(&gzip_ctx->zs);\n  } else {\n    deflateEnd(&gzip_ctx->zs);\n  }\n  gpr_free(ctx);\n}\n\nconst grpc_stream_compression_vtable grpc_stream_compression_gzip_vtable = {\n    grpc_stream_compress_gzip, grpc_stream_decompress_gzip,\n    grpc_stream_compression_context_create_gzip,\n    grpc_stream_compression_context_destroy_gzip};\n<|endoftext|>"}
{"text":"<commit_before>\/\/---------------------------------------------------------------------------\/\/\n\/*\n  Copyright (c) 2012, Stuart R. Slattery\n  All 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 the University of Wisconsin - Madison 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\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\/\/ \\file Chimera_MCSA.cpp\n\/\/ \\author Stuart R. Slattery\n\/\/ \\brief Monte Carlo Synthetic Acceleration solver definition.\n\/\/---------------------------------------------------------------------------\/\/\n\n#include \"Chimera_MCSA.hpp\"\n#include \"Chimera_AdjointMC.hpp\"\n\n#include <Epetra_Map.h>\n#include <Epetra_Vector.h>\n\nnamespace Chimera\n{\n\/\/---------------------------------------------------------------------------\/\/\n\/*! \n * \\brief Constructor.\n *\/\nMCSA::MCSA( Teuchos::RCP<Epetra_LinearProblem> &linear_problem )\n    : d_linear_problem( linear_problem )\n    , d_num_iters( 0 )\n{ \/* ... *\/ }\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Destructor.\n *\/\nMCSA::~MCSA()\n{ \/* ... *\/ }\n \n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Solve.\n *\/\nvoid MCSA::iterate( const int max_iters, const double tolerance,\n\t\t    const int num_histories, const double weight_cutoff )\n{\n    \/\/ Extract the linear problem.\n    Epetra_CrsMatrix *A = \n\tdynamic_cast<Epetra_CrsMatrix*>( d_linear_problem->GetMatrix() );\n    Epetra_Vector *x = \n\tdynamic_cast<Epetra_Vector*>( d_linear_problem->GetLHS() );\n    const Epetra_Vector *b = \n\tdynamic_cast<Epetra_Vector*>( d_linear_problem->GetRHS() );\n\n    \/\/ Setup the residual Adjoint MC solver.\n    Epetra_Map row_map = A->RowMap();\n    Epetra_Vector delta_x( row_map );\n    Epetra_Vector residual( row_map );\n    Teuchos::RCP<Epetra_LinearProblem> residual_problem = Teuchos::rcp(\n\tnew Epetra_LinearProblem( A, &delta_x, &residual ) );\n    AdjointMC mc_solver = AdjointMC( residual_problem );\n\n    \/\/ Iterate.\n    Epetra_CrsMatrix H = mc_solver.getH();\n    Epetra_Vector temp_vec( row_map );\n    d_num_iters = 0;\n    double residual_norm = 1.0;\n    double b_norm;\n    b->NormInf( &b_norm );\n    double conv_crit = b_norm*tolerance;\n    while ( residual_norm > conv_crit && d_num_iters < max_iters )\n    {\n\t\/\/ Richardson iteration.\n\tH.Apply( *x, temp_vec );\n\tx->Update( 1.0, temp_vec, 1.0, *b, 0.0 );\n\n\t\/\/ Compute the residual.\n\tA->Apply( *x, temp_vec );\n\tresidual.Update( 1.0, *b, -1.0, temp_vec, 0.0 );\n\n\t\/\/ Solve for delta_x.\n\tmc_solver.walk( num_histories, weight_cutoff );\n\n\t\/\/ Apply delta_x.\n\tx->Update( 1.0, delta_x, 1.0 );\n\n\t\/\/ Update convergence check.\n\tresidual.NormInf( &residual_norm );\n\t++d_num_iters;\n    }\n\n    std::cout << \"MCSA Iterations: \" << d_num_iters << std::endl;\n    std::cout << \"Residual: \" << residual_norm << std::endl;\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\n} \/\/ end namespace Chimera\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ end Chimera_MCSA.cpp\n\/\/---------------------------------------------------------------------------\/\/\n\n<commit_msg>adding adjoint dev to mcsa<commit_after>\/\/---------------------------------------------------------------------------\/\/\n\/*\n  Copyright (c) 2012, Stuart R. Slattery\n  All 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 the University of Wisconsin - Madison 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\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\/\/ \\file Chimera_MCSA.cpp\n\/\/ \\author Stuart R. Slattery\n\/\/ \\brief Monte Carlo Synthetic Acceleration solver definition.\n\/\/---------------------------------------------------------------------------\/\/\n\n#include \"Chimera_MCSA.hpp\"\n#include \"Chimera_AdjointMCDev.hpp\"\n\n#include <Epetra_Map.h>\n#include <Epetra_Vector.h>\n\nnamespace Chimera\n{\n\/\/---------------------------------------------------------------------------\/\/\n\/*! \n * \\brief Constructor.\n *\/\nMCSA::MCSA( Teuchos::RCP<Epetra_LinearProblem> &linear_problem )\n    : d_linear_problem( linear_problem )\n    , d_num_iters( 0 )\n{ \/* ... *\/ }\n\n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Destructor.\n *\/\nMCSA::~MCSA()\n{ \/* ... *\/ }\n \n\/\/---------------------------------------------------------------------------\/\/\n\/*!\n * \\brief Solve.\n *\/\nvoid MCSA::iterate( const int max_iters, const double tolerance,\n\t\t    const int num_histories, const double weight_cutoff )\n{\n    \/\/ Extract the linear problem.\n    Epetra_CrsMatrix *A = \n\tdynamic_cast<Epetra_CrsMatrix*>( d_linear_problem->GetMatrix() );\n    Epetra_Vector *x = \n\tdynamic_cast<Epetra_Vector*>( d_linear_problem->GetLHS() );\n    const Epetra_Vector *b = \n\tdynamic_cast<Epetra_Vector*>( d_linear_problem->GetRHS() );\n\n    \/\/ Setup the residual Adjoint MC solver.\n    Epetra_Map row_map = A->RowMap();\n    Epetra_Vector delta_x( row_map );\n    Epetra_Vector residual( row_map );\n    Teuchos::RCP<Epetra_LinearProblem> residual_problem = Teuchos::rcp(\n\tnew Epetra_LinearProblem( A, &delta_x, &residual ) );\n    AdjointMC mc_solver = AdjointMC( residual_problem );\n\n    \/\/ Iterate.\n    Epetra_CrsMatrix H = mc_solver.getH();\n    Epetra_Vector temp_vec( row_map );\n    d_num_iters = 0;\n    double residual_norm = 1.0;\n    double b_norm;\n    b->NormInf( &b_norm );\n    double conv_crit = b_norm*tolerance;\n    while ( residual_norm > conv_crit && d_num_iters < max_iters )\n    {\n\t\/\/ Richardson iteration.\n\tH.Apply( *x, temp_vec );\n\tx->Update( 1.0, temp_vec, 1.0, *b, 0.0 );\n\n\t\/\/ Compute the residual.\n\tA->Apply( *x, temp_vec );\n\tresidual.Update( 1.0, *b, -1.0, temp_vec, 0.0 );\n\n\t\/\/ Solve for delta_x.\n\tmc_solver.walk( num_histories, weight_cutoff );\n\n\t\/\/ Apply delta_x.\n\tx->Update( 1.0, delta_x, 1.0 );\n\n\t\/\/ Update convergence check.\n\tresidual.NormInf( &residual_norm );\n\t++d_num_iters;\n    }\n\n    std::cout << \"MCSA Iterations: \" << d_num_iters << std::endl;\n    std::cout << \"Residual: \" << residual_norm << std::endl;\n}\n\n\/\/---------------------------------------------------------------------------\/\/\n\n} \/\/ end namespace Chimera\n\n\/\/---------------------------------------------------------------------------\/\/\n\/\/ end Chimera_MCSA.cpp\n\/\/---------------------------------------------------------------------------\/\/\n\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <client\/dbclient.h>\n#include \"mongo_cxx_extension.h\"\n#include \"utils.h\"\n#include \"common.h\"\n\n\/\/ FIXME: client pointer is keep, review Lua binding in order to avoid\n\/\/ unexpected garbage collection of DBClientBase\n\nusing namespace mongo;\n\nextern void lua_to_bson(lua_State *L, int stackpos, BSONObj &obj);\nextern void bson_to_lua(lua_State *L, const BSONObj &obj);\nextern int gridfile_create(lua_State *L, GridFile gf);\nextern DBClientBase* userdata_to_dbclient(lua_State *L, int stackpos);\n\nnamespace {\n  inline mongo_cxx_extension::GridFileBuilder* userdata_to_gridfilebuilder(lua_State* L,\n                                                                           int index) {\n    void *ud = 0;\n\n    ud = luaL_checkudata(L, index, LUAMONGO_GRIDFILEBUILDER);\n    mongo_cxx_extension::GridFileBuilder *gridfilebuilder;\n    gridfilebuilder = *((mongo_cxx_extension::GridFileBuilder **)ud);\n\n    return gridfilebuilder;\n  }\n} \/\/ anonymous namespace\n\n\/*\n * builder, err = mongo.GridFileBuilder.New(connection, dbname[, chunksize[, prefix]])\n *\/\nstatic int gridfilebuilder_new(lua_State *L) {\n  int n = lua_gettop(L);\n  int resultcount = 1;\n\n  try {\n    DBClientBase *connection = userdata_to_dbclient(L, 1);\n    const char *dbname = lua_tostring(L, 2);\n\n    mongo_cxx_extension::GridFileBuilder **builder;\n    builder = (mongo_cxx_extension::GridFileBuilder **)\n      lua_newuserdata(L, sizeof(mongo_cxx_extension::GridFileBuilder *));\n\n    if (n >= 4) {\n      unsigned int chunksize = static_cast<unsigned int>(luaL_checkint(L, 3));\n      const char *prefix = luaL_checkstring(L, 4);\n\n      *builder = new mongo_cxx_extension::GridFileBuilder(connection,\n                                                          dbname,\n                                                          chunksize,\n                                                          prefix);\n    } else if (n == 3) {\n      unsigned int chunksize = static_cast<unsigned int>(luaL_checkint(L, 3));\n          \n      *builder = new mongo_cxx_extension::GridFileBuilder(connection,\n                                                          dbname, chunksize);\n    } else {\n      *builder = new mongo_cxx_extension::GridFileBuilder(connection, dbname);\n    }\n\n    luaL_getmetatable(L, LUAMONGO_GRIDFILEBUILDER);\n    lua_setmetatable(L, -2);\n  } catch (std::exception &e) {\n    lua_pushnil(L);\n    lua_pushfstring(L, LUAMONGO_ERR_CONNECTION_FAILED, e.what());\n    resultcount = 2;\n  }\n\n  return resultcount;\n}\n\n\/*\n * ok, err = builder:append(data_string)\n *\/\nstatic int gridfilebuilder_append(lua_State *L) {\n  mongo_cxx_extension::GridFileBuilder *builder;\n  builder = userdata_to_gridfilebuilder(L, 1);\n  int resultcount = 1;\n  try {\n    size_t length = 0;\n    const char *data = luaL_checklstring(L, 2, &length);\n    builder->appendChunk(data, length);\n    lua_pushboolean(L, 1);\n  } catch (std::exception &e) {\n    lua_pushnil(L);\n    lua_pushfstring(L, LUAMONGO_ERR_CALLING, LUAMONGO_GRIDFILEBUILDER,\n                    \"append\", e.what());\n    resultcount = 2;\n  }\n  return resultcount;\n}\n\n\/*\n * bson, err = builder:build(remote_file[, content_type])\n *\/\nstatic int gridfilebuilder_build(lua_State *L) {\n  int resultcount = 1;\n  mongo_cxx_extension::GridFileBuilder *builder;\n  builder = userdata_to_gridfilebuilder(L, 1);\n  const char *remote = luaL_checkstring(L, 2);\n  const char *content_type = luaL_optstring(L, 3, \"\");\n  try {\n    BSONObj res = builder->buildFile(remote, content_type);\n    bson_to_lua(L, res);\n  } catch (std::exception &e) {\n    lua_pushnil(L);\n    lua_pushfstring(L, LUAMONGO_ERR_CALLING, LUAMONGO_GRIDFILEBUILDER,\n                    \"build\", e.what());\n    resultcount = 2;\n  }\n  return resultcount;\n}\n\n\/*\n * __gc\n *\/\nstatic int gridfilebuilder_gc(lua_State *L) {\n  mongo_cxx_extension::GridFileBuilder *builder;\n  builder = userdata_to_gridfilebuilder(L, 1);\n  \n  delete builder;\n\n  return 0;\n}\n\n\/*\n * __tostring\n *\/\nstatic int gridfilebuilder_tostring(lua_State *L) {\n  mongo_cxx_extension::GridFileBuilder *builder;\n  builder = userdata_to_gridfilebuilder(L, 1);\n\n  lua_pushfstring(L, \"%s: %p\", LUAMONGO_GRIDFILEBUILDER, builder);\n\n  return 1;\n}\n\nint mongo_gridfilebuilder_register(lua_State *L) {\n  static const luaL_Reg gridfilebuilder_methods[] = {\n    {\"append\", gridfilebuilder_append},\n    {\"build\", gridfilebuilder_build},\n    {NULL, NULL}\n  };\n\n  static const luaL_Reg gridfilebuilder_class_methods[] = {\n    {\"New\", gridfilebuilder_new},\n    {NULL, NULL}\n  };\n\n  luaL_newmetatable(L, LUAMONGO_GRIDFILEBUILDER);\n  \/\/luaL_register(L, 0, gridfs_methods);\n  luaL_setfuncs(L, gridfilebuilder_methods, 0);\n  lua_pushvalue(L,-1);\n  lua_setfield(L, -2, \"__index\");\n\n  lua_pushcfunction(L, gridfilebuilder_gc);\n  lua_setfield(L, -2, \"__gc\");\n\n  lua_pushcfunction(L, gridfilebuilder_tostring);\n  lua_setfield(L, -2, \"__tostring\");\n    \n  lua_pop(L,1);\n\n  luaL_newlib(L, gridfilebuilder_class_methods);\n\n  return 1;\n}\n<commit_msg>Added write synonim in luamongo<commit_after>#include <iostream>\n#include <client\/dbclient.h>\n#include \"mongo_cxx_extension.h\"\n#include \"utils.h\"\n#include \"common.h\"\n\n\/\/ FIXME: client pointer is keep, review Lua binding in order to avoid\n\/\/ unexpected garbage collection of DBClientBase\n\nusing namespace mongo;\n\nextern void lua_to_bson(lua_State *L, int stackpos, BSONObj &obj);\nextern void bson_to_lua(lua_State *L, const BSONObj &obj);\nextern int gridfile_create(lua_State *L, GridFile gf);\nextern DBClientBase* userdata_to_dbclient(lua_State *L, int stackpos);\n\nnamespace {\n  inline mongo_cxx_extension::GridFileBuilder* userdata_to_gridfilebuilder(lua_State* L,\n                                                                           int index) {\n    void *ud = 0;\n\n    ud = luaL_checkudata(L, index, LUAMONGO_GRIDFILEBUILDER);\n    mongo_cxx_extension::GridFileBuilder *gridfilebuilder;\n    gridfilebuilder = *((mongo_cxx_extension::GridFileBuilder **)ud);\n\n    return gridfilebuilder;\n  }\n} \/\/ anonymous namespace\n\n\/*\n * builder, err = mongo.GridFileBuilder.New(connection, dbname[, chunksize[, prefix]])\n *\/\nstatic int gridfilebuilder_new(lua_State *L) {\n  int n = lua_gettop(L);\n  int resultcount = 1;\n\n  try {\n    DBClientBase *connection = userdata_to_dbclient(L, 1);\n    const char *dbname = lua_tostring(L, 2);\n\n    mongo_cxx_extension::GridFileBuilder **builder;\n    builder = (mongo_cxx_extension::GridFileBuilder **)\n      lua_newuserdata(L, sizeof(mongo_cxx_extension::GridFileBuilder *));\n\n    if (n >= 4) {\n      unsigned int chunksize = static_cast<unsigned int>(luaL_checkint(L, 3));\n      const char *prefix = luaL_checkstring(L, 4);\n\n      *builder = new mongo_cxx_extension::GridFileBuilder(connection,\n                                                          dbname,\n                                                          chunksize,\n                                                          prefix);\n    } else if (n == 3) {\n      unsigned int chunksize = static_cast<unsigned int>(luaL_checkint(L, 3));\n          \n      *builder = new mongo_cxx_extension::GridFileBuilder(connection,\n                                                          dbname, chunksize);\n    } else {\n      *builder = new mongo_cxx_extension::GridFileBuilder(connection, dbname);\n    }\n\n    luaL_getmetatable(L, LUAMONGO_GRIDFILEBUILDER);\n    lua_setmetatable(L, -2);\n  } catch (std::exception &e) {\n    lua_pushnil(L);\n    lua_pushfstring(L, LUAMONGO_ERR_CONNECTION_FAILED, e.what());\n    resultcount = 2;\n  }\n\n  return resultcount;\n}\n\n\/*\n * ok, err = builder:append(data_string)\n *\/\nstatic int gridfilebuilder_append(lua_State *L) {\n  mongo_cxx_extension::GridFileBuilder *builder;\n  builder = userdata_to_gridfilebuilder(L, 1);\n  int resultcount = 1;\n  try {\n    size_t length = 0;\n    const char *data = luaL_checklstring(L, 2, &length);\n    builder->appendChunk(data, length);\n    lua_pushboolean(L, 1);\n  } catch (std::exception &e) {\n    lua_pushnil(L);\n    lua_pushfstring(L, LUAMONGO_ERR_CALLING, LUAMONGO_GRIDFILEBUILDER,\n                    \"append\", e.what());\n    resultcount = 2;\n  }\n  return resultcount;\n}\n\n\/*\n * bson, err = builder:build(remote_file[, content_type])\n *\/\nstatic int gridfilebuilder_build(lua_State *L) {\n  int resultcount = 1;\n  mongo_cxx_extension::GridFileBuilder *builder;\n  builder = userdata_to_gridfilebuilder(L, 1);\n  const char *remote = luaL_checkstring(L, 2);\n  const char *content_type = luaL_optstring(L, 3, \"\");\n  try {\n    BSONObj res = builder->buildFile(remote, content_type);\n    bson_to_lua(L, res);\n  } catch (std::exception &e) {\n    lua_pushnil(L);\n    lua_pushfstring(L, LUAMONGO_ERR_CALLING, LUAMONGO_GRIDFILEBUILDER,\n                    \"build\", e.what());\n    resultcount = 2;\n  }\n  return resultcount;\n}\n\n\/*\n * __gc\n *\/\nstatic int gridfilebuilder_gc(lua_State *L) {\n  mongo_cxx_extension::GridFileBuilder *builder;\n  builder = userdata_to_gridfilebuilder(L, 1);\n  \n  delete builder;\n\n  return 0;\n}\n\n\/*\n * __tostring\n *\/\nstatic int gridfilebuilder_tostring(lua_State *L) {\n  mongo_cxx_extension::GridFileBuilder *builder;\n  builder = userdata_to_gridfilebuilder(L, 1);\n\n  lua_pushfstring(L, \"%s: %p\", LUAMONGO_GRIDFILEBUILDER, builder);\n\n  return 1;\n}\n\nint mongo_gridfilebuilder_register(lua_State *L) {\n  static const luaL_Reg gridfilebuilder_methods[] = {\n    {\"append\", gridfilebuilder_append},\n    {\"write\", gridfilebuilder_append},\n    {\"build\", gridfilebuilder_build},\n    {NULL, NULL}\n  };\n\n  static const luaL_Reg gridfilebuilder_class_methods[] = {\n    {\"New\", gridfilebuilder_new},\n    {NULL, NULL}\n  };\n\n  luaL_newmetatable(L, LUAMONGO_GRIDFILEBUILDER);\n  \/\/luaL_register(L, 0, gridfs_methods);\n  luaL_setfuncs(L, gridfilebuilder_methods, 0);\n  lua_pushvalue(L,-1);\n  lua_setfield(L, -2, \"__index\");\n\n  lua_pushcfunction(L, gridfilebuilder_gc);\n  lua_setfield(L, -2, \"__gc\");\n\n  lua_pushcfunction(L, gridfilebuilder_tostring);\n  lua_setfield(L, -2, \"__tostring\");\n    \n  lua_pop(L,1);\n\n  luaL_newlib(L, gridfilebuilder_class_methods);\n\n  return 1;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"cukebins\/internal\/CukeCommands.hpp\"\n\n#include <sstream>\n#include <boost\/algorithm\/string.hpp>\n\nnamespace cukebins {\nnamespace internal {\n\nshared_ptr<Scenario> CukeCommands::currentScenario;\n\nvoid CukeCommands::beginScenario(const TagExpression::tag_list *tags) {\n    currentScenario = shared_ptr<Scenario>(new Scenario(tags));\n    hookRegistrar.execBeforeHooks(currentScenario.get());\n}\n\nvoid CukeCommands::endScenario() {\n    contextManager.purgeContexts();\n    hookRegistrar.execAfterHooks(currentScenario.get());\n    currentScenario.reset();\n}\n\nconst std::string CukeCommands::snippetText(const std::string stepKeyword, const std::string stepName) const {\n    std::stringstream snippetText; \/\/ TODO Escape stepName\n    snippetText << boost::to_upper_copy(stepKeyword) << \"(\\\"^\" << stepName << \"$\\\") {\" << std::endl;\n    snippetText << \"    pending();\" << std::endl;\n    snippetText << \"}\" << std::endl;\n    return snippetText.str();\n}\n\nMatchResult CukeCommands::stepMatches(const std::string description) {\n    return stepManager.stepMatches(description);\n}\n\nInvokeResult CukeCommands::invoke(step_id_type id, const InvokeArgs *pArgs) {\n    StepInfo *stepInfo = stepManager.getStep(id);\n    InvokeResult result = hookRegistrar.execStepChain(currentScenario.get(), stepInfo, pArgs);\n    hookRegistrar.execAfterStepHooks(currentScenario.get());\n    return result;\n}\n\n}\n}\n<commit_msg>Fixed AFTER hook ordering issue<commit_after>#include \"cukebins\/internal\/CukeCommands.hpp\"\n\n#include <sstream>\n#include <boost\/algorithm\/string.hpp>\n\nnamespace cukebins {\nnamespace internal {\n\nshared_ptr<Scenario> CukeCommands::currentScenario;\n\nvoid CukeCommands::beginScenario(const TagExpression::tag_list *tags) {\n    currentScenario = shared_ptr<Scenario>(new Scenario(tags));\n    hookRegistrar.execBeforeHooks(currentScenario.get());\n}\n\nvoid CukeCommands::endScenario() {\n    hookRegistrar.execAfterHooks(currentScenario.get());\n    contextManager.purgeContexts();\n    currentScenario.reset();\n}\n\nconst std::string CukeCommands::snippetText(const std::string stepKeyword, const std::string stepName) const {\n    std::stringstream snippetText; \/\/ TODO Escape stepName\n    snippetText << boost::to_upper_copy(stepKeyword) << \"(\\\"^\" << stepName << \"$\\\") {\" << std::endl;\n    snippetText << \"    pending();\" << std::endl;\n    snippetText << \"}\" << std::endl;\n    return snippetText.str();\n}\n\nMatchResult CukeCommands::stepMatches(const std::string description) {\n    return stepManager.stepMatches(description);\n}\n\nInvokeResult CukeCommands::invoke(step_id_type id, const InvokeArgs *pArgs) {\n    StepInfo *stepInfo = stepManager.getStep(id);\n    InvokeResult result = hookRegistrar.execStepChain(currentScenario.get(), stepInfo, pArgs);\n    hookRegistrar.execAfterStepHooks(currentScenario.get());\n    return result;\n}\n\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: filedlgimpl.hxx,v $\n *\n *  $Revision: 1.12 $\n *\n *  last change: $Author: hr $ $Date: 2007-06-27 23:11:56 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n#ifndef _SFX_FILEDLGIMPL_HXX\n#define _SFX_FILEDLGIMPL_HXX\n\n#ifndef _SV_TIMER_HXX\n#include <vcl\/timer.hxx>\n#endif\n#ifndef _SV_GRAPH_HXX\n#include <vcl\/graph.hxx>\n#endif\n\n#ifndef  _CPPUHELPER_IMPLBASE2_HXX_\n#include <cppuhelper\/implbase2.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_STRINGPAIR_HPP_\n#include <com\/sun\/star\/beans\/StringPair.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_UI_DIALOGS_XFILEPICKER_HPP_\n#include <com\/sun\/star\/ui\/dialogs\/XFilePicker.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_XDIALOGCLOSEDLISTENER_HPP_\n#include <com\/sun\/star\/ui\/dialogs\/XDialogClosedListener.hpp>\n#endif\n\n#ifndef _SFX_FCONTNR_HXX\n#include <sfx2\/fcontnr.hxx>\n#endif\n\n#define _SVSTDARR_STRINGSDTOR\n#include <svtools\/svstdarr.hxx>\n\n#include <sfx2\/filedlghelper.hxx>\n\nclass SfxFilterMatcher;\nclass GraphicFilter;\nclass FileDialogHelper;\n\nnamespace sfx2\n{\n    typedef ::com::sun::star::beans::StringPair FilterPair;\n\n    class FileDialogHelper_Impl :\n        public ::cppu::WeakImplHelper2<\n            ::com::sun::star::ui::dialogs::XFilePickerListener,\n            ::com::sun::star::ui::dialogs::XDialogClosedListener >\n    {\n        friend class FileDialogHelper;\n\n        ::com::sun::star::uno::Reference < ::com::sun::star::ui::dialogs::XFilePicker > mxFileDlg;\n        ::com::sun::star::uno::Reference < ::com::sun::star::container::XNameAccess >   mxFilterCFG;\n\n        std::vector< FilterPair >   maFilters;\n\n        SfxFilterMatcher*           mpMatcher;\n        GraphicFilter*              mpGraphicFilter;\n        FileDialogHelper*           mpAntiImpl;\n        Window*                     mpPreferredParentWindow;\n\n        ::rtl::OUString             maPath;\n        ::rtl::OUString             maFileName;\n        ::rtl::OUString             maCurFilter;\n        ::rtl::OUString             maSelectFilter;\n        ::rtl::OUString             maButtonLabel;\n\n        Timer                       maPreViewTimer;\n        Graphic                     maGraphic;\n\n        const short                 m_nDialogType;\n\n        SfxFilterFlags              m_nMustFlags;\n        SfxFilterFlags              m_nDontFlags;\n\n        ULONG                       mnPostUserEventId;\n\n        ErrCode                     mnError;\n\n        FileDialogHelper::Context   meContext;\n\n        sal_Bool                    mbHasPassword           : 1;\n        sal_Bool                    mbIsPwdEnabled          : 1;\n        sal_Bool                    m_bHaveFilterOptions    : 1;\n        sal_Bool                    mbHasVersions           : 1;\n        sal_Bool                    mbHasAutoExt            : 1;\n        sal_Bool                    mbHasLink               : 1;\n        sal_Bool                    mbHasPreview            : 1;\n        sal_Bool                    mbShowPreview           : 1;\n        sal_Bool                    mbIsSaveDlg             : 1;\n        sal_Bool                    mbExport                : 1;\n\n        sal_Bool                    mbDeleteMatcher         : 1;\n        sal_Bool                    mbInsert                : 1;\n        sal_Bool                    mbSystemPicker          : 1;\n        sal_Bool                    mbPwdCheckBoxState      : 1;\n        sal_Bool                    mbSelection             : 1;\n        sal_Bool                    mbSelectionEnabled      : 1;\n\n    private:\n        void                    addFilters( sal_Int64 nFlags,\n                                            const String& rFactory,\n                                            SfxFilterFlags nMust,\n                                            SfxFilterFlags nDont );\n        void                    addFilter( const ::rtl::OUString& rFilterName,\n                                           const ::rtl::OUString& rExtension );\n        void                    addGraphicFilter();\n        void                    enablePasswordBox( sal_Bool bInit );\n        void                    updateFilterOptionsBox();\n        void                    updateExportButton();\n        void                    updateSelectionBox();\n        void                    updateVersions();\n        void                    updatePreviewState( sal_Bool _bUpdatePreviewWindow = sal_True );\n        void                    dispose();\n\n        void                    loadConfig();\n        void                    saveConfig();\n\n        const SfxFilter*        getCurentSfxFilter();\n        sal_Bool                updateExtendedControl( sal_Int16 _nExtendedControlId, sal_Bool _bEnable );\n\n        ErrCode                 getGraphic( const ::rtl::OUString& rURL, Graphic& rGraphic ) const;\n        void                    setDefaultValues();\n\n        void                    preExecute();\n        void                    postExecute( sal_Int16 _nResult );\n        sal_Int16               implDoExecute();\n        void                    implStartExecute();\n\n        void                    correctVirtualDialogType();\n\n        void                    setControlHelpIds( const sal_Int16* _pControlId, const sal_Int32* _pHelpId );\n        void                    setDialogHelpId( const sal_Int32 _nHelpId );\n\n        sal_Bool                CheckFilterOptionsCapability( const SfxFilter* _pFilter );\n\n        sal_Bool                isInOpenMode() const;\n        String                  getCurrentFilterUIName() const;\n\n        void                    LoadLastUsedFilter( const ::rtl::OUString& _rContextIdentifier );\n        void                    SaveLastUsedFilter( const ::rtl::OUString& _rContextIdentifier );\n        void                    SaveLastUsedFilter( void );\n\n        void                    implInitializeFileName( );\n\n        DECL_LINK( TimeOutHdl_Impl, Timer* );\n        DECL_LINK( HandleEvent, FileDialogHelper* );\n        DECL_LINK( InitControls, void* );\n\n    public:\n        \/\/ XFilePickerListener methods\n        virtual void SAL_CALL               fileSelectionChanged( const ::com::sun::star::ui::dialogs::FilePickerEvent& aEvent ) throw( ::com::sun::star::uno::RuntimeException );\n        virtual void SAL_CALL               directoryChanged( const ::com::sun::star::ui::dialogs::FilePickerEvent& aEvent ) throw( ::com::sun::star::uno::RuntimeException );\n        virtual ::rtl::OUString SAL_CALL    helpRequested( const ::com::sun::star::ui::dialogs::FilePickerEvent& aEvent ) throw( ::com::sun::star::uno::RuntimeException );\n        virtual void SAL_CALL               controlStateChanged( const ::com::sun::star::ui::dialogs::FilePickerEvent& aEvent ) throw( ::com::sun::star::uno::RuntimeException );\n        virtual void SAL_CALL               dialogSizeChanged() throw( ::com::sun::star::uno::RuntimeException );\n\n        \/\/ XDialogClosedListener methods\n        virtual void SAL_CALL               dialogClosed( const ::com::sun::star::ui::dialogs::DialogClosedEvent& _rEvent ) throw (::com::sun::star::uno::RuntimeException);\n\n        \/\/ XEventListener methods\n        virtual void SAL_CALL       disposing( const ::com::sun::star::lang::EventObject& Source ) throw( ::com::sun::star::uno::RuntimeException );\n\n        \/\/ handle XFilePickerListener events\n        void                    handleFileSelectionChanged( const ::com::sun::star::ui::dialogs::FilePickerEvent& aEvent );\n        void                    handleDirectoryChanged( const ::com::sun::star::ui::dialogs::FilePickerEvent& aEvent );\n        ::rtl::OUString         handleHelpRequested( const ::com::sun::star::ui::dialogs::FilePickerEvent& aEvent );\n        void                    handleControlStateChanged( const ::com::sun::star::ui::dialogs::FilePickerEvent& aEvent );\n        void                    handleDialogSizeChanged();\n\n        \/\/ Own methods\n                                FileDialogHelper_Impl(\n                                    FileDialogHelper* _pAntiImpl,\n                                    const short nDialogType,\n                                    sal_Int64 nFlags,\n                                    Window* _pPreferredParentWindow = NULL\n                                );\n        virtual                 ~FileDialogHelper_Impl();\n\n        ErrCode                 execute( SvStringsDtor*& rpURLList,\n                                         SfxItemSet *&   rpSet,\n                                         String&         rFilter );\n        ErrCode                 execute();\n\n        void                    setFilter( const ::rtl::OUString& rFilter );\n\n        \/** sets the directory which should be browsed\n\n            <p>If the given path does not point to a valid (existent and accessible) folder, the request\n            is silently dropped<\/p>\n        *\/\n        void                    displayFolder( const ::rtl::OUString& rPath );\n        void                    setFileName( const ::rtl::OUString& _rFile );\n\n        ::rtl::OUString         getPath() const;\n        ::rtl::OUString         getFilter() const;\n        void                    getRealFilter( String& _rFilter ) const;\n\n        ErrCode                 getGraphic( Graphic& rGraphic ) const;\n        void                    createMatcher( const String& rFactory );\n\n        sal_Bool                isShowFilterExtensionEnabled() const;\n        void                    addFilterPair( const ::rtl::OUString& rFilter,\n                                               const ::rtl::OUString& rFilterWithExtension );\n        ::rtl::OUString         getFilterName( const ::rtl::OUString& rFilterWithExtension ) const;\n        ::rtl::OUString         getFilterWithExtension( const ::rtl::OUString& rFilter ) const;\n\n        void                    SetContext( FileDialogHelper::Context _eNewContext );\n\n        inline sal_Bool         isSystemFilePicker() const { return mbSystemPicker; }\n        inline sal_Bool         isPasswordEnabled() const { return mbIsPwdEnabled; }\n    };\n\n}   \/\/ end of namespace sfx2\n\n#endif \/\/ _SFX_FILEDLGIMPL_HXX\n\n<commit_msg>INTEGRATION: CWS as6 (1.12.16); FILE MERGED 2007\/08\/16 10:09:16 as 1.12.16.1: #i63263# support new multi selection API; #i78854# make AuoExtension working for file dialog in general<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: filedlgimpl.hxx,v $\n *\n *  $Revision: 1.13 $\n *\n *  last change: $Author: ihi $ $Date: 2007-11-19 16:32: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 _SFX_FILEDLGIMPL_HXX\n#define _SFX_FILEDLGIMPL_HXX\n\n#ifndef _SV_TIMER_HXX\n#include <vcl\/timer.hxx>\n#endif\n#ifndef _SV_GRAPH_HXX\n#include <vcl\/graph.hxx>\n#endif\n\n#ifndef  _CPPUHELPER_IMPLBASE2_HXX_\n#include <cppuhelper\/implbase2.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_STRINGPAIR_HPP_\n#include <com\/sun\/star\/beans\/StringPair.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_UI_DIALOGS_XFILEPICKER_HPP_\n#include <com\/sun\/star\/ui\/dialogs\/XFilePicker.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_XDIALOGCLOSEDLISTENER_HPP_\n#include <com\/sun\/star\/ui\/dialogs\/XDialogClosedListener.hpp>\n#endif\n\n#ifndef _SFX_FCONTNR_HXX\n#include <sfx2\/fcontnr.hxx>\n#endif\n\n#define _SVSTDARR_STRINGSDTOR\n#include <svtools\/svstdarr.hxx>\n\n#include <sfx2\/filedlghelper.hxx>\n#include <comphelper\/sequenceasvector.hxx>\n\nclass SfxFilterMatcher;\nclass GraphicFilter;\nclass FileDialogHelper;\n\nnamespace sfx2\n{\n    typedef ::com::sun::star::beans::StringPair FilterPair;\n\n    class FileDialogHelper_Impl :\n        public ::cppu::WeakImplHelper2<\n            ::com::sun::star::ui::dialogs::XFilePickerListener,\n            ::com::sun::star::ui::dialogs::XDialogClosedListener >\n    {\n        friend class FileDialogHelper;\n\n        ::com::sun::star::uno::Reference < ::com::sun::star::ui::dialogs::XFilePicker > mxFileDlg;\n        ::com::sun::star::uno::Reference < ::com::sun::star::container::XNameAccess >   mxFilterCFG;\n\n        std::vector< FilterPair >   maFilters;\n\n        SfxFilterMatcher*           mpMatcher;\n        GraphicFilter*              mpGraphicFilter;\n        FileDialogHelper*           mpAntiImpl;\n        Window*                     mpPreferredParentWindow;\n\n        ::comphelper::SequenceAsVector< ::rtl::OUString > mlLastURLs;\n\n        ::rtl::OUString             maPath;\n        ::rtl::OUString             maFileName;\n        ::rtl::OUString             maCurFilter;\n        ::rtl::OUString             maSelectFilter;\n        ::rtl::OUString             maButtonLabel;\n\n        Timer                       maPreViewTimer;\n        Graphic                     maGraphic;\n\n        const short                 m_nDialogType;\n\n        SfxFilterFlags              m_nMustFlags;\n        SfxFilterFlags              m_nDontFlags;\n\n        ULONG                       mnPostUserEventId;\n\n        ErrCode                     mnError;\n\n        FileDialogHelper::Context   meContext;\n\n        sal_Bool                    mbHasPassword           : 1;\n        sal_Bool                    mbIsPwdEnabled          : 1;\n        sal_Bool                    m_bHaveFilterOptions    : 1;\n        sal_Bool                    mbHasVersions           : 1;\n        sal_Bool                    mbHasAutoExt            : 1;\n        sal_Bool                    mbHasLink               : 1;\n        sal_Bool                    mbHasPreview            : 1;\n        sal_Bool                    mbShowPreview           : 1;\n        sal_Bool                    mbIsSaveDlg             : 1;\n        sal_Bool                    mbExport                : 1;\n\n        sal_Bool                    mbDeleteMatcher         : 1;\n        sal_Bool                    mbInsert                : 1;\n        sal_Bool                    mbSystemPicker          : 1;\n        sal_Bool                    mbPwdCheckBoxState      : 1;\n        sal_Bool                    mbSelection             : 1;\n        sal_Bool                    mbSelectionEnabled      : 1;\n\n    private:\n        void                    addFilters( sal_Int64 nFlags,\n                                            const String& rFactory,\n                                            SfxFilterFlags nMust,\n                                            SfxFilterFlags nDont );\n        void                    addFilter( const ::rtl::OUString& rFilterName,\n                                           const ::rtl::OUString& rExtension );\n        void                    addGraphicFilter();\n        void                    enablePasswordBox( sal_Bool bInit );\n        void                    updateFilterOptionsBox();\n        void                    updateExportButton();\n        void                    updateSelectionBox();\n        void                    updateVersions();\n        void                    updatePreviewState( sal_Bool _bUpdatePreviewWindow = sal_True );\n        void                    dispose();\n\n        void                    loadConfig();\n        void                    saveConfig();\n\n        const SfxFilter*        getCurentSfxFilter();\n        sal_Bool                updateExtendedControl( sal_Int16 _nExtendedControlId, sal_Bool _bEnable );\n\n        ErrCode                 getGraphic( const ::rtl::OUString& rURL, Graphic& rGraphic ) const;\n        void                    setDefaultValues();\n\n        void                    preExecute();\n        void                    postExecute( sal_Int16 _nResult );\n        sal_Int16               implDoExecute();\n        void                    implStartExecute();\n\n        void                    correctVirtualDialogType();\n\n        void                    setControlHelpIds( const sal_Int16* _pControlId, const sal_Int32* _pHelpId );\n        void                    setDialogHelpId( const sal_Int32 _nHelpId );\n\n        sal_Bool                CheckFilterOptionsCapability( const SfxFilter* _pFilter );\n\n        sal_Bool                isInOpenMode() const;\n        String                  getCurrentFilterUIName() const;\n\n        void                    LoadLastUsedFilter( const ::rtl::OUString& _rContextIdentifier );\n        void                    SaveLastUsedFilter( const ::rtl::OUString& _rContextIdentifier );\n        void                    SaveLastUsedFilter( void );\n\n        void                    implInitializeFileName( );\n\n        void                    implGetAndCacheFiles( const ::com::sun::star::uno::Reference< XInterface >& xPicker  ,\n                                                            SvStringsDtor*&               rpURLList,\n                                                      const SfxFilter*                    pFilter  );\n        String                  implEnsureURLExtension(const String& sURL      ,\n                                                       const String& sExtension);\n\n        DECL_LINK( TimeOutHdl_Impl, Timer* );\n        DECL_LINK( HandleEvent, FileDialogHelper* );\n        DECL_LINK( InitControls, void* );\n\n    public:\n        \/\/ XFilePickerListener methods\n        virtual void SAL_CALL               fileSelectionChanged( const ::com::sun::star::ui::dialogs::FilePickerEvent& aEvent ) throw( ::com::sun::star::uno::RuntimeException );\n        virtual void SAL_CALL               directoryChanged( const ::com::sun::star::ui::dialogs::FilePickerEvent& aEvent ) throw( ::com::sun::star::uno::RuntimeException );\n        virtual ::rtl::OUString SAL_CALL    helpRequested( const ::com::sun::star::ui::dialogs::FilePickerEvent& aEvent ) throw( ::com::sun::star::uno::RuntimeException );\n        virtual void SAL_CALL               controlStateChanged( const ::com::sun::star::ui::dialogs::FilePickerEvent& aEvent ) throw( ::com::sun::star::uno::RuntimeException );\n        virtual void SAL_CALL               dialogSizeChanged() throw( ::com::sun::star::uno::RuntimeException );\n\n        \/\/ XDialogClosedListener methods\n        virtual void SAL_CALL               dialogClosed( const ::com::sun::star::ui::dialogs::DialogClosedEvent& _rEvent ) throw (::com::sun::star::uno::RuntimeException);\n\n        \/\/ XEventListener methods\n        virtual void SAL_CALL       disposing( const ::com::sun::star::lang::EventObject& Source ) throw( ::com::sun::star::uno::RuntimeException );\n\n        \/\/ handle XFilePickerListener events\n        void                    handleFileSelectionChanged( const ::com::sun::star::ui::dialogs::FilePickerEvent& aEvent );\n        void                    handleDirectoryChanged( const ::com::sun::star::ui::dialogs::FilePickerEvent& aEvent );\n        ::rtl::OUString         handleHelpRequested( const ::com::sun::star::ui::dialogs::FilePickerEvent& aEvent );\n        void                    handleControlStateChanged( const ::com::sun::star::ui::dialogs::FilePickerEvent& aEvent );\n        void                    handleDialogSizeChanged();\n\n        \/\/ Own methods\n                                FileDialogHelper_Impl(\n                                    FileDialogHelper* _pAntiImpl,\n                                    const short nDialogType,\n                                    sal_Int64 nFlags,\n                                    Window* _pPreferredParentWindow = NULL\n                                );\n        virtual                 ~FileDialogHelper_Impl();\n\n        ErrCode                 execute( SvStringsDtor*& rpURLList,\n                                         SfxItemSet *&   rpSet,\n                                         String&         rFilter );\n        ErrCode                 execute();\n\n        void                    setFilter( const ::rtl::OUString& rFilter );\n\n        \/** sets the directory which should be browsed\n\n            <p>If the given path does not point to a valid (existent and accessible) folder, the request\n            is silently dropped<\/p>\n        *\/\n        void                    displayFolder( const ::rtl::OUString& rPath );\n        void                    setFileName( const ::rtl::OUString& _rFile );\n\n        ::rtl::OUString         getPath() const;\n        ::rtl::OUString         getFilter() const;\n        void                    getRealFilter( String& _rFilter ) const;\n\n        ErrCode                 getGraphic( Graphic& rGraphic ) const;\n        void                    createMatcher( const String& rFactory );\n\n        sal_Bool                isShowFilterExtensionEnabled() const;\n        void                    addFilterPair( const ::rtl::OUString& rFilter,\n                                               const ::rtl::OUString& rFilterWithExtension );\n        ::rtl::OUString         getFilterName( const ::rtl::OUString& rFilterWithExtension ) const;\n        ::rtl::OUString         getFilterWithExtension( const ::rtl::OUString& rFilter ) const;\n\n        void                    SetContext( FileDialogHelper::Context _eNewContext );\n\n        inline sal_Bool         isSystemFilePicker() const { return mbSystemPicker; }\n        inline sal_Bool         isPasswordEnabled() const { return mbIsPwdEnabled; }\n    };\n\n}   \/\/ end of namespace sfx2\n\n#endif \/\/ _SFX_FILEDLGIMPL_HXX\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: XMLEventImportHelper.hxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: dvo $ $Date: 2001-01-23 13:20:03 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _XMLOFF_EVENTIMPORTHELPER_HXX\n#define _XMLOFF_EVENTIMPORTHELPER_HXX\n\n#ifndef _COM_SUN_STAR_UNO_REFERENCE_HXX_\n#include <com\/sun\/star\/uno\/Reference.hxx>\n#endif\n\n#ifndef _XMLOFF_XMLEVENT_HXX\n#include \"xmlevent.hxx\"\n#endif\n\n#include <map>\n#include <list>\n\n\nnamespace com { namespace sun { namespace star {\n    namespace xml { namespace sax { class XAttributeList; } }\n} } }\nnamespace rtl { class OUString; }\nclass XMLEventContextFactory;\nclass XMLEventsImportContext;\nstruct XMLEventNameTranslation;\n\ntypedef ::std::map< ::rtl::OUString, XMLEventContextFactory* > FactoryMap;\ntypedef ::std::map< ::rtl::OUString, ::rtl::OUString > NameMap;\ntypedef ::std::list< NameMap* > NameMapList;\n\n\n\/**\n * Helps the XMLEventsImportContext.\n *\n * This class stores\n * a) the translation from XML event names to API event names, and\n * b) a mapping from script language names to XMLEventContextFactory objects\n *    (that handle particular languages).\n *\n * Event name translation tables may be added, i.e. they will be joined\n * together. If different translations are needed (i.e., if the same XML name\n * needs to be translated to different API names in different contexts), then\n * translation tables may be saved on a translation table stack.\n *\/\nclass XMLEventImportHelper\n{\n    \/\/\/ map of XMLEventContextFactory objects\n    FactoryMap aFactoryMap;\n\n    \/\/\/ map from XML to API names\n    NameMap* pEventNameMap;\n\n    \/\/\/ stack of previous aEventNameMap\n    NameMapList aEventNameMapList;\n\npublic:\n    XMLEventImportHelper();\n\n    ~XMLEventImportHelper();\n\n    \/\/\/ register a handler for a particular language type\n    void RegisterFactory( const ::rtl::OUString& rLanguage,\n                          XMLEventContextFactory* aFactory );\n\n    \/\/\/ add event name translation to the internal table\n    void AddTranslationTable( const XMLEventNameTranslation* pTransTable );\n\n    \/\/\/ save the old translation table on a stack and install an empty table\n    void PushTranslationTable();\n\n    \/\/\/ recover the top-most previously saved translation table\n    void PopTranslationTable();\n\n    \/\/\/ create an appropriate import context for a particular event\n    SvXMLImportContext* CreateContext(\n        SvXMLImport& rImport,\n        sal_uInt16 nPrefix,\n        const ::rtl::OUString& rLocalName,\n        const ::com::sun::star::uno::Reference<\n            ::com::sun::star::xml::sax::XAttributeList> & xAttrList,\n        XMLEventsImportContext* rEvents,\n        const ::rtl::OUString& rXmlEventName,\n        const ::rtl::OUString& rLanguage);\n\n};\n\n#endif\n<commit_msg>INTEGRATION: CWS oasis (1.2.286); FILE MERGED 2004\/05\/28 16:40:19 mib 1.2.286.1: - #i20153#: Events<commit_after>\/*************************************************************************\n *\n *  $RCSfile: XMLEventImportHelper.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2004-07-13 07:54:52 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _XMLOFF_EVENTIMPORTHELPER_HXX\n#define _XMLOFF_EVENTIMPORTHELPER_HXX\n\n#ifndef _COM_SUN_STAR_UNO_REFERENCE_HXX_\n#include <com\/sun\/star\/uno\/Reference.hxx>\n#endif\n\n#ifndef _XMLOFF_XMLEVENT_HXX\n#include \"xmlevent.hxx\"\n#endif\n\n#include <map>\n#include <list>\n\n\nnamespace com { namespace sun { namespace star {\n    namespace xml { namespace sax { class XAttributeList; } }\n} } }\nnamespace rtl { class OUString; }\nclass XMLEventContextFactory;\nclass XMLEventsImportContext;\nstruct XMLEventNameTranslation;\n\ntypedef ::std::map< ::rtl::OUString, XMLEventContextFactory* > FactoryMap;\ntypedef ::std::map< XMLEventName, ::rtl::OUString > NameMap;\ntypedef ::std::list< NameMap* > NameMapList;\n\n\n\/**\n * Helps the XMLEventsImportContext.\n *\n * This class stores\n * a) the translation from XML event names to API event names, and\n * b) a mapping from script language names to XMLEventContextFactory objects\n *    (that handle particular languages).\n *\n * Event name translation tables may be added, i.e. they will be joined\n * together. If different translations are needed (i.e., if the same XML name\n * needs to be translated to different API names in different contexts), then\n * translation tables may be saved on a translation table stack.\n *\/\nclass XMLEventImportHelper\n{\n    \/\/\/ map of XMLEventContextFactory objects\n    FactoryMap aFactoryMap;\n\n    \/\/\/ map from XML to API names\n    NameMap* pEventNameMap;\n\n    \/\/\/ stack of previous aEventNameMap\n    NameMapList aEventNameMapList;\n\npublic:\n    XMLEventImportHelper();\n\n    ~XMLEventImportHelper();\n\n    \/\/\/ register a handler for a particular language type\n    void RegisterFactory( const ::rtl::OUString& rLanguage,\n                          XMLEventContextFactory* aFactory );\n\n    \/\/\/ add event name translation to the internal table\n    void AddTranslationTable( const XMLEventNameTranslation* pTransTable );\n\n    \/\/\/ save the old translation table on a stack and install an empty table\n    void PushTranslationTable();\n\n    \/\/\/ recover the top-most previously saved translation table\n    void PopTranslationTable();\n\n    \/\/\/ create an appropriate import context for a particular event\n    SvXMLImportContext* CreateContext(\n        SvXMLImport& rImport,\n        sal_uInt16 nPrefix,\n        const ::rtl::OUString& rLocalName,\n        const ::com::sun::star::uno::Reference<\n            ::com::sun::star::xml::sax::XAttributeList> & xAttrList,\n        XMLEventsImportContext* rEvents,\n        const ::rtl::OUString& rXmlEventName,\n        const ::rtl::OUString& rLanguage);\n\n};\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: eventimport.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: rt $ $Date: 2006-07-25 09:23: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_FORMS_EVENTIMPORT_HXX_\n#define _XMLOFF_FORMS_EVENTIMPORT_HXX_\n\n#ifndef _XMLOFF_XMLEVENTSIMPORTCONTEXT_HXX\n#include \"XMLEventsImportContext.hxx\"\n#endif\n#ifndef _XMLOFF_FORMS_CALLBACKS_HXX_\n#include \"callbacks.hxx\"\n#endif\n#ifndef _XMLOFF_FORMS_IFACECOMPARE_HXX_\n#include \"ifacecompare.hxx\"\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XINDEXACCESS_HPP_\n#include <com\/sun\/star\/container\/XIndexAccess.hpp>\n#endif\n\nclass SvXMLImport;\n\/\/.........................................................................\nnamespace xmloff\n{\n\/\/.........................................................................\n\n    \/\/=====================================================================\n    \/\/= OFormEventsImportContext\n    \/\/=====================================================================\n    class OFormEventsImportContext : public XMLEventsImportContext\n    {\n    protected:\n        IEventAttacher& m_rEventAttacher;\n\n    public:\n        OFormEventsImportContext(SvXMLImport& _rImport, sal_uInt16 _nPrefix, const ::rtl::OUString& _rLocalName,\n            IEventAttacher& _rEventAttacher);\n\n    protected:\n        virtual void EndElement();\n    };\n\n    \/\/=====================================================================\n    \/\/= ODefaultEventAttacherManager\n    \/\/=====================================================================\n    class ODefaultEventAttacherManager : public IEventAttacherManager\n    {\n    protected:\n        DECLARE_STL_MAP(\n            ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >,              \/\/ map from\n            ::com::sun::star::uno::Sequence< ::com::sun::star::script::ScriptEventDescriptor >,     \/\/ map to\n            OPropertySetCompare,                                                                    \/\/ compare method\n            MapPropertySet2ScriptSequence);                                                         \/\/ class name\n        \/\/ usually an event attacher manager will need to collect all script events registered, 'cause\n        \/\/ the _real_ XEventAttacherManager handles it's events by index, but out indicies are not fixed\n        \/\/ until _all_ controls have been inserted.\n\n        MapPropertySet2ScriptSequence   m_aEvents;\n\n    public:\n        \/\/ IEventAttacherManager\n        virtual void registerEvents(\n            const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& _rxElement,\n            const ::com::sun::star::uno::Sequence< ::com::sun::star::script::ScriptEventDescriptor >& _rEvents\n            );\n\n    protected:\n        void setEvents(\n            const ::com::sun::star::uno::Reference< ::com::sun::star::container::XIndexAccess >& _rxContainer\n            );\n\n        virtual ~ODefaultEventAttacherManager();\n    };\n\n\/\/.........................................................................\n}   \/\/ namespace xmloff\n\/\/.........................................................................\n\n#endif \/\/ _XMLOFF_FORMS_EVENTIMPORT_HXX_\n\n<commit_msg>INTEGRATION: CWS vgbugs07 (1.4.142); FILE MERGED 2007\/06\/04 13:23:26 vg 1.4.142.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: eventimport.hxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: hr $ $Date: 2007-06-27 15:14:23 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; 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_FORMS_EVENTIMPORT_HXX_\n#define _XMLOFF_FORMS_EVENTIMPORT_HXX_\n\n#ifndef _XMLOFF_XMLEVENTSIMPORTCONTEXT_HXX\n#include <xmloff\/XMLEventsImportContext.hxx>\n#endif\n#ifndef _XMLOFF_FORMS_CALLBACKS_HXX_\n#include \"callbacks.hxx\"\n#endif\n#ifndef _XMLOFF_FORMS_IFACECOMPARE_HXX_\n#include \"ifacecompare.hxx\"\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XINDEXACCESS_HPP_\n#include <com\/sun\/star\/container\/XIndexAccess.hpp>\n#endif\n\nclass SvXMLImport;\n\/\/.........................................................................\nnamespace xmloff\n{\n\/\/.........................................................................\n\n    \/\/=====================================================================\n    \/\/= OFormEventsImportContext\n    \/\/=====================================================================\n    class OFormEventsImportContext : public XMLEventsImportContext\n    {\n    protected:\n        IEventAttacher& m_rEventAttacher;\n\n    public:\n        OFormEventsImportContext(SvXMLImport& _rImport, sal_uInt16 _nPrefix, const ::rtl::OUString& _rLocalName,\n            IEventAttacher& _rEventAttacher);\n\n    protected:\n        virtual void EndElement();\n    };\n\n    \/\/=====================================================================\n    \/\/= ODefaultEventAttacherManager\n    \/\/=====================================================================\n    class ODefaultEventAttacherManager : public IEventAttacherManager\n    {\n    protected:\n        DECLARE_STL_MAP(\n            ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >,              \/\/ map from\n            ::com::sun::star::uno::Sequence< ::com::sun::star::script::ScriptEventDescriptor >,     \/\/ map to\n            OPropertySetCompare,                                                                    \/\/ compare method\n            MapPropertySet2ScriptSequence);                                                         \/\/ class name\n        \/\/ usually an event attacher manager will need to collect all script events registered, 'cause\n        \/\/ the _real_ XEventAttacherManager handles it's events by index, but out indicies are not fixed\n        \/\/ until _all_ controls have been inserted.\n\n        MapPropertySet2ScriptSequence   m_aEvents;\n\n    public:\n        \/\/ IEventAttacherManager\n        virtual void registerEvents(\n            const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& _rxElement,\n            const ::com::sun::star::uno::Sequence< ::com::sun::star::script::ScriptEventDescriptor >& _rEvents\n            );\n\n    protected:\n        void setEvents(\n            const ::com::sun::star::uno::Reference< ::com::sun::star::container::XIndexAccess >& _rxContainer\n            );\n\n        virtual ~ODefaultEventAttacherManager();\n    };\n\n\/\/.........................................................................\n}   \/\/ namespace xmloff\n\/\/.........................................................................\n\n#endif \/\/ _XMLOFF_FORMS_EVENTIMPORT_HXX_\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 <nix\/hdf5\/FileHDF5.hpp>\n\n#include <nix\/util\/util.hpp>\n#include <nix\/hdf5\/BlockHDF5.hpp>\n#include <nix\/hdf5\/SectionHDF5.hpp>\n#include <nix\/hdf5\/ExceptionHDF5.hpp>\n\n#include <fstream>\n#include <vector>\n#include <ctime>\n\nusing namespace std;\n\nnamespace nix {\nnamespace hdf5 {\n\n\n\/\/ Format definition\n#define FILE_VERSION std::vector<int>{1, 0, 0}\n#define FILE_FORMAT  std::string(\"nix\")\n\n\nstatic unsigned int map_file_mode(FileMode mode) {\n    switch (mode) {\n        case FileMode::ReadWrite:\n            return H5F_ACC_RDWR;\n\n        case FileMode::ReadOnly:\n            return H5F_ACC_RDONLY;\n\n        case FileMode::Overwrite:\n            return H5F_ACC_TRUNC;\n\n        default:\n            return H5F_ACC_DEFAULT;\n    }\n\n}\n\n\nFileHDF5::FileHDF5(const string &name, FileMode mode)\n{\n    if (!fileExists(name)) {\n        mode = FileMode::Overwrite;\n    }\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    BaseHDF5 fcpl = H5Pcreate(H5P_FILE_CREATE);\n    fcpl.check(\"Could not create file creation plist\");\n    HErr res = H5Pset_link_creation_order(fcpl.h5id(), H5P_CRT_ORDER_TRACKED|H5P_CRT_ORDER_INDEXED);\n    res.check(\"Unable to create file (H5Pset_link_creation_order failed.)\");\n\n    unsigned int h5mode =  map_file_mode(mode);\n\n    if (h5mode & H5F_ACC_TRUNC) {\n        hid = H5Fcreate(name.c_str(), h5mode, fcpl.h5id(), H5P_DEFAULT);\n    } else {\n        hid = H5Fopen(name.c_str(), h5mode, H5P_DEFAULT);\n    }\n\n    if (!H5Iis_valid(hid)) {\n        throw H5Exception(\"Could not open\/create file\");\n    }\n\n    root = Group(H5Gopen2(hid, \"\/\", H5P_DEFAULT));\n    root.check(\"Could not root group\");\n\n    metadata = root.openGroup(\"metadata\");\n    data = root.openGroup(\"data\");\n\n    setCreatedAt();\n    setUpdatedAt();\n\n    if (!checkHeader()) {\n        throw std::runtime_error(\"Invalid file header: either file format or file version not correct\");\n    }\n}\n\n\/\/--------------------------------------------------\n\/\/ Methods concerning blocks\n\/\/--------------------------------------------------\n\n\nbool FileHDF5::hasBlock(const std::string &name_or_id) const {\n    return getBlock(name_or_id) != nullptr;\n}\n\n\nshared_ptr<base::IBlock> FileHDF5::getBlock(const std::string &name_or_id) const {\n    shared_ptr<BlockHDF5> block;\n\n    boost::optional<Group> group = data.findGroupByNameOrAttribute(\"entity_id\", name_or_id);\n    if (group)\n        block = make_shared<BlockHDF5>(file(), *group);\n\n    return block;\n}\n\n\nshared_ptr<base::IBlock> FileHDF5::getBlock(size_t index) const {\n    string name = data.objectName(index);\n    return getBlock(name);\n}\n\n\nshared_ptr<base::IBlock> FileHDF5::createBlock(const string &name, const string &type) {\n    if (hasBlock(name)) {\n        throw DuplicateName(\"createBlock\");\n    }\n    string id = util::createId();\n\n    Group group = data.openGroup(name, true);\n    return make_shared<BlockHDF5>(file(), group, id, type, name);\n}\n\n\nbool FileHDF5::deleteBlock(const std::string &name_or_id) {\n    bool deleted = false;\n\n    if (hasBlock(name_or_id)) {\n        \/\/ we get first \"entity\" link by name, but delete all others whatever their name with it\n        deleted = data.removeAllLinks(getBlock(name_or_id)->name());\n    }\n\n    return deleted;\n}\n\n\nsize_t FileHDF5::blockCount() const {\n    return data.objectCount();\n}\n\n\n\/\/--------------------------------------------------\n\/\/ Methods concerning sections\n\/\/--------------------------------------------------\n\n\nbool FileHDF5::hasSection(const std::string &name_or_id) const {\n    return getSection(name_or_id) != nullptr;\n}\n\n\nshared_ptr<base::ISection> FileHDF5::getSection(const std::string &name_or_id) const {\n    shared_ptr<SectionHDF5> sec;\n\n    boost::optional<Group> group = metadata.findGroupByNameOrAttribute(\"entity_id\", name_or_id);\n    if (group)\n        sec = make_shared<SectionHDF5>(file(), *group);\n\n    return sec;\n}\n\n\nshared_ptr<base::ISection> FileHDF5::getSection(size_t index) const{\n    string name = metadata.objectName(index);\n    return getSection(name);\n}\n\n\nshared_ptr<base::ISection> FileHDF5::createSection(const string &name, const  string &type) {\n    if (hasSection(name)) {\n        throw DuplicateName(\"createSection\");\n    }\n    string id = util::createId();\n\n    Group group = metadata.openGroup(name, true);\n    return make_shared<SectionHDF5>(file(), group, id, type, name);\n}\n\n\nbool FileHDF5::deleteSection(const std::string &name_or_id) {\n    bool deleted = false;\n\n    \/\/ call deleteSection on sections to trigger recursive call to all sub-sections\n    if (hasSection(name_or_id)) {\n        \/\/ get instance of section about to get deleted\n        Section section = getSection(name_or_id);\n        \/\/ loop through all child sections and call deleteSection on them\n        for(auto &child : section.sections()) {\n            section.deleteSection(child.id());\n        }\n        \/\/ if hasSection is true then section_group always exists\n        deleted = metadata.removeAllLinks(section.name());\n    }\n\n    return deleted;\n}\n\n\nsize_t FileHDF5::sectionCount() const {\n    return metadata.objectCount();\n}\n\n\n\/\/--------------------------------------------------\n\/\/ Local attributes\n\/\/--------------------------------------------------\n\n\ntime_t FileHDF5::updatedAt() const {\n    string t;\n    root.getAttr(\"updated_at\", t);\n    return util::strToTime(t);\n}\n\n\nvoid FileHDF5::setUpdatedAt() {\n    if (!root.hasAttr(\"updated_at\")) {\n        time_t t = time(NULL);\n        root.setAttr(\"updated_at\", util::timeToStr(t));\n    }\n}\n\n\nvoid FileHDF5::forceUpdatedAt() {\n    time_t t = time(NULL);\n    root.setAttr(\"updated_at\", util::timeToStr(t));\n}\n\n\ntime_t FileHDF5::createdAt() const {\n    string t;\n    root.getAttr(\"created_at\", t);\n    return util::strToTime(t);\n}\n\n\nvoid FileHDF5::setCreatedAt() {\n    if (!root.hasAttr(\"created_at\")) {\n        time_t t = time(NULL);\n        root.setAttr(\"created_at\", util::timeToStr(t));\n    }\n}\n\n\nvoid FileHDF5::forceCreatedAt(time_t t) {\n    root.setAttr(\"created_at\", util::timeToStr(t));\n}\n\n\nvector<int> FileHDF5::version() const {\n    vector<int> version;\n    root.getAttr(\"version\",version);\n    return version;\n}\n\n\nstring FileHDF5::format() const {\n    string t;\n    root.getAttr(\"format\", t);\n    return t;\n}\n\n\nstring FileHDF5::location() const {\n    ssize_t size = H5Fget_name(hid, nullptr, 0);\n\n    if (size < 0) {\n        throw H5Exception(\"H5Fget_name failed\");\n    }\n\n    std::vector<char> buf(static_cast<size_t>(size + 1), 0);\n    size = H5Fget_name(hid, buf.data(), buf.size());\n    if (size < 0) {\n        throw H5Exception(\"H5Fget_name failed\");\n    }\n\n    return std::string(buf.data());\n}\n\n\nvoid FileHDF5::close() {\n\n    if (!isOpen())\n        return;\n\n    data.close();\n    metadata.close();\n    root.close();\n\n    unsigned types = H5F_OBJ_GROUP|H5F_OBJ_DATASET|H5F_OBJ_DATATYPE;\n\n    ssize_t obj_count = H5Fget_obj_count(hid, types);\n\n    if (obj_count < 0) {\n        throw H5Exception(\"FileHDF5::close(): Could not get object count\");\n    }\n\n    std::vector<hid_t> objs(static_cast<size_t>(obj_count));\n\n    if (obj_count > 0) {\n        obj_count = H5Fget_obj_ids(hid, types, objs.size(), objs.data());\n\n        if (obj_count < 0) {\n            throw H5Exception(\"FileHDF5::close(): Could not get objs\");\n        }\n    }\n    \n    for (auto obj : objs) {\n        int ref_count = H5Iget_ref(obj);\n\n        for (int j = 0; j < ref_count; j++) {\n            H5Oclose(obj);\n        }\n    }\n\n    BaseHDF5::close();\n}\n\n\nbool FileHDF5::isOpen() const {\n\n    if (! H5Iis_valid(hid))\n        return false;\n\n    H5I_type_t id_type = H5Iget_type(hid);\n\n    if (id_type <= H5I_BADID || id_type >= H5I_NTYPES)\n        return false;\n    else\n        return true;\n}\n\n\nshared_ptr<base::IFile> FileHDF5::file() const {\n    return  const_pointer_cast<FileHDF5>(shared_from_this());\n}\n\n\nbool FileHDF5::checkHeader() const {\n    bool check = true;\n    vector<int> version;\n    string str;\n    \/\/ check format\n    if (root.hasAttr(\"format\")) {\n        if (!root.getAttr(\"format\", str) || str != FILE_FORMAT) {\n            check = false;\n        }\n    } else {\n        root.setAttr(\"format\", FILE_FORMAT);\n    }\n    \/\/ check version\n    if (root.hasAttr(\"version\")) {\n        if (!root.getAttr(\"version\", version) || version != FILE_VERSION) {\n            check = false;\n        }\n    } else {\n        root.setAttr(\"version\", FILE_VERSION);\n    }\n    return check;\n}\n\n\nbool FileHDF5::fileExists(const string &name) const {\n    ifstream f(name.c_str());\n    if (f) {\n        f.close();\n        return true;\n    } else {\n        return false;\n    }\n}\n\n\nbool FileHDF5::operator==(const FileHDF5 &other) const {\n    return location() == other.location();\n}\n\n\nbool FileHDF5::operator!=(const FileHDF5 &other) const {\n    return !(*this == other);\n}\n\n\nFileHDF5::~FileHDF5() {\n    close();\n}\n\n} \/\/ ns nix::hdf5\n} \/\/ ns nix\n\n\n\n<commit_msg>[h5] File: use isValid for isOpen<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 <nix\/hdf5\/FileHDF5.hpp>\n\n#include <nix\/util\/util.hpp>\n#include <nix\/hdf5\/BlockHDF5.hpp>\n#include <nix\/hdf5\/SectionHDF5.hpp>\n#include <nix\/hdf5\/ExceptionHDF5.hpp>\n\n#include <fstream>\n#include <vector>\n#include <ctime>\n\nusing namespace std;\n\nnamespace nix {\nnamespace hdf5 {\n\n\n\/\/ Format definition\n#define FILE_VERSION std::vector<int>{1, 0, 0}\n#define FILE_FORMAT  std::string(\"nix\")\n\n\nstatic unsigned int map_file_mode(FileMode mode) {\n    switch (mode) {\n        case FileMode::ReadWrite:\n            return H5F_ACC_RDWR;\n\n        case FileMode::ReadOnly:\n            return H5F_ACC_RDONLY;\n\n        case FileMode::Overwrite:\n            return H5F_ACC_TRUNC;\n\n        default:\n            return H5F_ACC_DEFAULT;\n    }\n\n}\n\n\nFileHDF5::FileHDF5(const string &name, FileMode mode)\n{\n    if (!fileExists(name)) {\n        mode = FileMode::Overwrite;\n    }\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    BaseHDF5 fcpl = H5Pcreate(H5P_FILE_CREATE);\n    fcpl.check(\"Could not create file creation plist\");\n    HErr res = H5Pset_link_creation_order(fcpl.h5id(), H5P_CRT_ORDER_TRACKED|H5P_CRT_ORDER_INDEXED);\n    res.check(\"Unable to create file (H5Pset_link_creation_order failed.)\");\n\n    unsigned int h5mode =  map_file_mode(mode);\n\n    if (h5mode & H5F_ACC_TRUNC) {\n        hid = H5Fcreate(name.c_str(), h5mode, fcpl.h5id(), H5P_DEFAULT);\n    } else {\n        hid = H5Fopen(name.c_str(), h5mode, H5P_DEFAULT);\n    }\n\n    if (!H5Iis_valid(hid)) {\n        throw H5Exception(\"Could not open\/create file\");\n    }\n\n    root = Group(H5Gopen2(hid, \"\/\", H5P_DEFAULT));\n    root.check(\"Could not root group\");\n\n    metadata = root.openGroup(\"metadata\");\n    data = root.openGroup(\"data\");\n\n    setCreatedAt();\n    setUpdatedAt();\n\n    if (!checkHeader()) {\n        throw std::runtime_error(\"Invalid file header: either file format or file version not correct\");\n    }\n}\n\n\/\/--------------------------------------------------\n\/\/ Methods concerning blocks\n\/\/--------------------------------------------------\n\n\nbool FileHDF5::hasBlock(const std::string &name_or_id) const {\n    return getBlock(name_or_id) != nullptr;\n}\n\n\nshared_ptr<base::IBlock> FileHDF5::getBlock(const std::string &name_or_id) const {\n    shared_ptr<BlockHDF5> block;\n\n    boost::optional<Group> group = data.findGroupByNameOrAttribute(\"entity_id\", name_or_id);\n    if (group)\n        block = make_shared<BlockHDF5>(file(), *group);\n\n    return block;\n}\n\n\nshared_ptr<base::IBlock> FileHDF5::getBlock(size_t index) const {\n    string name = data.objectName(index);\n    return getBlock(name);\n}\n\n\nshared_ptr<base::IBlock> FileHDF5::createBlock(const string &name, const string &type) {\n    if (hasBlock(name)) {\n        throw DuplicateName(\"createBlock\");\n    }\n    string id = util::createId();\n\n    Group group = data.openGroup(name, true);\n    return make_shared<BlockHDF5>(file(), group, id, type, name);\n}\n\n\nbool FileHDF5::deleteBlock(const std::string &name_or_id) {\n    bool deleted = false;\n\n    if (hasBlock(name_or_id)) {\n        \/\/ we get first \"entity\" link by name, but delete all others whatever their name with it\n        deleted = data.removeAllLinks(getBlock(name_or_id)->name());\n    }\n\n    return deleted;\n}\n\n\nsize_t FileHDF5::blockCount() const {\n    return data.objectCount();\n}\n\n\n\/\/--------------------------------------------------\n\/\/ Methods concerning sections\n\/\/--------------------------------------------------\n\n\nbool FileHDF5::hasSection(const std::string &name_or_id) const {\n    return getSection(name_or_id) != nullptr;\n}\n\n\nshared_ptr<base::ISection> FileHDF5::getSection(const std::string &name_or_id) const {\n    shared_ptr<SectionHDF5> sec;\n\n    boost::optional<Group> group = metadata.findGroupByNameOrAttribute(\"entity_id\", name_or_id);\n    if (group)\n        sec = make_shared<SectionHDF5>(file(), *group);\n\n    return sec;\n}\n\n\nshared_ptr<base::ISection> FileHDF5::getSection(size_t index) const{\n    string name = metadata.objectName(index);\n    return getSection(name);\n}\n\n\nshared_ptr<base::ISection> FileHDF5::createSection(const string &name, const  string &type) {\n    if (hasSection(name)) {\n        throw DuplicateName(\"createSection\");\n    }\n    string id = util::createId();\n\n    Group group = metadata.openGroup(name, true);\n    return make_shared<SectionHDF5>(file(), group, id, type, name);\n}\n\n\nbool FileHDF5::deleteSection(const std::string &name_or_id) {\n    bool deleted = false;\n\n    \/\/ call deleteSection on sections to trigger recursive call to all sub-sections\n    if (hasSection(name_or_id)) {\n        \/\/ get instance of section about to get deleted\n        Section section = getSection(name_or_id);\n        \/\/ loop through all child sections and call deleteSection on them\n        for(auto &child : section.sections()) {\n            section.deleteSection(child.id());\n        }\n        \/\/ if hasSection is true then section_group always exists\n        deleted = metadata.removeAllLinks(section.name());\n    }\n\n    return deleted;\n}\n\n\nsize_t FileHDF5::sectionCount() const {\n    return metadata.objectCount();\n}\n\n\n\/\/--------------------------------------------------\n\/\/ Local attributes\n\/\/--------------------------------------------------\n\n\ntime_t FileHDF5::updatedAt() const {\n    string t;\n    root.getAttr(\"updated_at\", t);\n    return util::strToTime(t);\n}\n\n\nvoid FileHDF5::setUpdatedAt() {\n    if (!root.hasAttr(\"updated_at\")) {\n        time_t t = time(NULL);\n        root.setAttr(\"updated_at\", util::timeToStr(t));\n    }\n}\n\n\nvoid FileHDF5::forceUpdatedAt() {\n    time_t t = time(NULL);\n    root.setAttr(\"updated_at\", util::timeToStr(t));\n}\n\n\ntime_t FileHDF5::createdAt() const {\n    string t;\n    root.getAttr(\"created_at\", t);\n    return util::strToTime(t);\n}\n\n\nvoid FileHDF5::setCreatedAt() {\n    if (!root.hasAttr(\"created_at\")) {\n        time_t t = time(NULL);\n        root.setAttr(\"created_at\", util::timeToStr(t));\n    }\n}\n\n\nvoid FileHDF5::forceCreatedAt(time_t t) {\n    root.setAttr(\"created_at\", util::timeToStr(t));\n}\n\n\nvector<int> FileHDF5::version() const {\n    vector<int> version;\n    root.getAttr(\"version\",version);\n    return version;\n}\n\n\nstring FileHDF5::format() const {\n    string t;\n    root.getAttr(\"format\", t);\n    return t;\n}\n\n\nstring FileHDF5::location() const {\n    ssize_t size = H5Fget_name(hid, nullptr, 0);\n\n    if (size < 0) {\n        throw H5Exception(\"H5Fget_name failed\");\n    }\n\n    std::vector<char> buf(static_cast<size_t>(size + 1), 0);\n    size = H5Fget_name(hid, buf.data(), buf.size());\n    if (size < 0) {\n        throw H5Exception(\"H5Fget_name failed\");\n    }\n\n    return std::string(buf.data());\n}\n\n\nvoid FileHDF5::close() {\n\n    if (!isOpen())\n        return;\n\n    data.close();\n    metadata.close();\n    root.close();\n\n    unsigned types = H5F_OBJ_GROUP|H5F_OBJ_DATASET|H5F_OBJ_DATATYPE;\n\n    ssize_t obj_count = H5Fget_obj_count(hid, types);\n\n    if (obj_count < 0) {\n        throw H5Exception(\"FileHDF5::close(): Could not get object count\");\n    }\n\n    std::vector<hid_t> objs(static_cast<size_t>(obj_count));\n\n    if (obj_count > 0) {\n        obj_count = H5Fget_obj_ids(hid, types, objs.size(), objs.data());\n\n        if (obj_count < 0) {\n            throw H5Exception(\"FileHDF5::close(): Could not get objs\");\n        }\n    }\n    \n    for (auto obj : objs) {\n        int ref_count = H5Iget_ref(obj);\n\n        for (int j = 0; j < ref_count; j++) {\n            H5Oclose(obj);\n        }\n    }\n\n    BaseHDF5::close();\n}\n\n\nbool FileHDF5::isOpen() const {\n    return isValid();\n}\n\n\nshared_ptr<base::IFile> FileHDF5::file() const {\n    return  const_pointer_cast<FileHDF5>(shared_from_this());\n}\n\n\nbool FileHDF5::checkHeader() const {\n    bool check = true;\n    vector<int> version;\n    string str;\n    \/\/ check format\n    if (root.hasAttr(\"format\")) {\n        if (!root.getAttr(\"format\", str) || str != FILE_FORMAT) {\n            check = false;\n        }\n    } else {\n        root.setAttr(\"format\", FILE_FORMAT);\n    }\n    \/\/ check version\n    if (root.hasAttr(\"version\")) {\n        if (!root.getAttr(\"version\", version) || version != FILE_VERSION) {\n            check = false;\n        }\n    } else {\n        root.setAttr(\"version\", FILE_VERSION);\n    }\n    return check;\n}\n\n\nbool FileHDF5::fileExists(const string &name) const {\n    ifstream f(name.c_str());\n    if (f) {\n        f.close();\n        return true;\n    } else {\n        return false;\n    }\n}\n\n\nbool FileHDF5::operator==(const FileHDF5 &other) const {\n    return location() == other.location();\n}\n\n\nbool FileHDF5::operator!=(const FileHDF5 &other) const {\n    return !(*this == other);\n}\n\n\nFileHDF5::~FileHDF5() {\n    close();\n}\n\n} \/\/ ns nix::hdf5\n} \/\/ ns nix\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include <cstdlib>\n#include <sstream>\n\n#include \"headers.hpp\"\n#include \"helloByeProto.hpp\"\n#include \"IPv4_5TupleL2Ident.hpp\"\n#include \"samplePacket.hpp\"\n\nusing namespace Headers;\nusing namespace std;\n\n\/*\n * ===================================\n * HelloByeServerHello\n * ===================================\n *\n *\/\n\ntemplate <class Identifier, class Packet>\nHelloByeServerHello<Identifier, Packet>::HelloByeServerHello() {\n\tthis->serverCookie = rand();\n};\n\ntemplate <class Identifier, class Packet>\nvoid HelloByeServerHello<Identifier, Packet>::fun(\n\ttypename SM::State &state, Packet *pkt, typename SM::FunIface &funIface) {\n\n\t\/\/ Get info from packet\n\tEthernet *ether = reinterpret_cast<Ethernet *>(pkt->getData());\n\tIPv4 *ipv4 = reinterpret_cast<IPv4 *>(ether->getPayload());\n\tUdp *udp = reinterpret_cast<Udp *>(ipv4->getPayload());\n\n\tchar clientStr[] = \"CLIENT HELLO:\";\n\tif (memcmp(udp->getPayload(), clientStr, sizeof(clientStr) - 1) == 0) {\n\t\tcout << \"HelloByeServerHello::fun() clientStr didn't match\" << endl;\n\t\tstate.transition(HelloByeServer::Terminate);\n\t\treturn;\n\t}\n\n\t\/\/ Get client cookie\n\tuint8_t cookieChar = reinterpret_cast<uint8_t *>(udp->getPayload())[sizeof(clientStr)];\n\tthis->clientCookie = static_cast<int>(cookieChar) - 48; \/\/ ASCII Conversion\n\n\t\/\/ Prepare new packet\n\t\/\/ Set payload string\n\tstringstream sstream;\n\tsstream << \"SERVER HELLO:\" << this->serverCookie << endl;\n\tstring serverHelloStr = sstream.str();\n\tmemcpy(udp->getPayload(), serverHelloStr.c_str(), serverHelloStr.length());\n\n\t\/\/ Set the IP header stuff\n\t\/\/ Leave the payload length alone for now...\n\tipv4->ip_ttl = 64;\n\tuint32_t tmp = ipv4->ip_dst.s_addr;\n\tipv4->ip_dst.s_addr = ipv4->ip_src.s_addr;\n\tipv4->ip_src.s_addr = tmp;\n\tipv4->calcChecksum();\n\n\t\/\/ Set UDP checksum to 0 and hope for the best\n\tudp->check = 0;\n\tuint16_t tmp16 = udp->dest;\n\tudp->dest = udp->source;\n\tudp->source = tmp16;\n\n\tfunIface.addPktToSend(pkt);\n};\n\n\/*\n * ===================================\n * HelloByeServerBye\n * ===================================\n *\n *\/\n\ntemplate <class Identifier, class Packet>\nHelloByeServerBye<Identifier, Packet>::HelloByeServerBye(\n\tconst HelloByeServerHello<Identifier, Packet> *in)\n\t: clientCookie(in->clientCookie), serverCookie(in->serverCookie) {}\n\ntemplate <class Identifier, class Packet>\nvoid HelloByeServerBye<Identifier, Packet>::fun(\n\ttypename SM::State &state, Packet *pkt, typename SM::FunIface &funIface) {\n\n\t\/\/ Get info from packet\n\tEthernet *ether = reinterpret_cast<Ethernet *>(pkt->getData());\n\tIPv4 *ipv4 = reinterpret_cast<IPv4 *>(ether->getPayload());\n\tUdp *udp = reinterpret_cast<Udp *>(ipv4->getPayload());\n\n\tchar clientStr[] = \"CLIENT BYE:\";\n\tif (memcmp(udp->getPayload(), clientStr, sizeof(clientStr) - 1) == 0) {\n\t\tcout << \"HelloByeServerBye::fun() clientStr didn't match\" << endl;\n\t\tstate.transition(HelloByeServer::Terminate);\n\t\treturn;\n\t}\n\n\t\/\/ Get client cookie\n\tuint8_t cookieChar = reinterpret_cast<uint8_t *>(udp->getPayload())[sizeof(clientStr)];\n\tint recvCookie = static_cast<int>(cookieChar) - 48; \/\/ ASCII Conversion\n\n\tif(recvCookie != this->serverCookie){\n\t\tcout << \"HelloByeServerBye::fun() Client sent over wrong cookie\" << endl;\n\t\tstate.transition(HelloByeServer::Terminate);\n\t\treturn;\n\t}\n\n\t\/\/ Prepare new packet\n\t\/\/ Set payload string\n\tstringstream sstream;\n\tsstream << \"SERVER BYE:\" << this->clientCookie << endl;\n\tstring serverByeStr = sstream.str();\n\tmemcpy(udp->getPayload(), serverByeStr.c_str(), serverByeStr.length());\n\n\t\/\/ Set the IP header stuff\n\t\/\/ Leave the payload length alone for now...\n\tipv4->ip_ttl = 64;\n\tuint32_t tmp = ipv4->ip_dst.s_addr;\n\tipv4->ip_dst.s_addr = ipv4->ip_src.s_addr;\n\tipv4->ip_src.s_addr = tmp;\n\tipv4->calcChecksum();\n\n\t\/\/ Set UDP checksum to 0 and hope for the best\n\tudp->check = 0;\n\tuint16_t tmp16 = udp->dest;\n\tudp->dest = udp->source;\n\tudp->source = tmp16;\n\n\t\/\/ We are done after this -> transition to Terminate\n\tstate.transition(HelloByeServer::Terminate);\n\n\tfunIface.addPktToSend(pkt);\n};\n\n\/*\n * ===================================\n * HelloByeClientHello\n * ===================================\n *\n *\/\n\ntemplate <class Identifier, class Packet>\nHelloByeClientHello<Identifier, Packet>::HelloByeClientHello(uint32_t dstIp, uint16_t srcPort)\n\t: dstIp(dstIp), srcPort(srcPort) {\n\tthis->clientCookie = rand();\n};\n\ntemplate <class Identifier, class Packet>\nvoid HelloByeClientHello<Identifier, Packet>::fun(\n\ttypename SM::State &state, Packet *pkt, typename SM::FunIface &funIface) {\n\n\t\/\/ pkt is empty -> get one\n\tpkt = funIface.getPkt();\n\tmemset(pkt->getData(), 0, pkt->getDataLen());\n\n\t\/\/ Get info from packet\n\tEthernet *ether = reinterpret_cast<Ethernet *>(pkt->getData());\n\tIPv4 *ipv4 = reinterpret_cast<IPv4 *>(ether->getPayload());\n\tUdp *udp = reinterpret_cast<Udp *>(ipv4->getPayload());\n\n\tHelloByeClientConfig *config = HelloByeClientConfig::getInstance();\n\n\t\/\/ Prepare new packet\n\t\/\/ Set payload string\n\tstringstream sstream;\n\tsstream << \"CLIENT HELLO:\" << this->clientCookie << endl;\n\tstring clientHelloStr = sstream.str();\n\tmemcpy(udp->getPayload(), clientHelloStr.c_str(), clientHelloStr.length());\n\n\t\/\/ Set the IP header stuff\n\t\/\/ Leave the payload length alone for now...\n\tipv4->ip_ttl = 64;\n\tipv4->ip_dst.s_addr = dstIp;\n\tipv4->ip_src.s_addr = config->getSrcIP();\n\tipv4->calcChecksum();\n\n\t\/\/ Set UDP checksum to 0 and hope for the best\n\tudp->check = 0;\n\tudp->dest = config->getDstPort();\n\tudp->source = srcPort;\n\n\tstate.transition(HelloByeClient::Bye);\n\n\tfunIface.addPktToSend(pkt);\n};\n\n\/*\n * ===================================\n * HelloByeClientBye\n * ===================================\n *\n *\/\n\ntemplate <class Identifier, class Packet>\nHelloByeClientBye<Identifier, Packet>::HelloByeClientBye(\n\tconst HelloByeClientHello<Identifier, Packet> *in)\n\t: clientCookie(in->clientCookie) {}\n\ntemplate <class Identifier, class Packet>\nvoid HelloByeClientBye<Identifier, Packet>::fun(\n\ttypename SM::State &state, Packet *pkt, typename SM::FunIface &funIface) {\n\n\t\/\/ Get info from packet\n\tEthernet *ether = reinterpret_cast<Ethernet *>(pkt->getData());\n\tIPv4 *ipv4 = reinterpret_cast<IPv4 *>(ether->getPayload());\n\tUdp *udp = reinterpret_cast<Udp *>(ipv4->getPayload());\n\n\tchar serverStr[] = \"SERVER HELLO:\";\n\tif (memcmp(udp->getPayload(), serverStr, sizeof(serverStr) - 1) == 0) {\n\t\tcout << \"HelloByeClientBye::fun() serverStr didn't match\" << endl;\n\t\tstate.transition(HelloByeClient::Terminate);\n\t\treturn;\n\t}\n\n\t\/\/ Get server cookie\n\tuint8_t cookieChar = reinterpret_cast<uint8_t *>(udp->getPayload())[sizeof(serverStr)];\n\tthis->serverCookie = static_cast<int>(cookieChar) - 48; \/\/ ASCII Conversion\n\n\t\/\/ Prepare new packet\n\t\/\/ Set payload string\n\tstringstream sstream;\n\tsstream << \"CLIENT BYE:\" << this->serverCookie << endl;\n\tstring serverByeStr = sstream.str();\n\tmemcpy(udp->getPayload(), serverByeStr.c_str(), serverByeStr.length());\n\n\t\/\/ Set the IP header stuff\n\t\/\/ Leave the payload length alone for now...\n\tipv4->ip_ttl = 64;\n\tuint32_t tmp = ipv4->ip_dst.s_addr;\n\tipv4->ip_dst.s_addr = ipv4->ip_src.s_addr;\n\tipv4->ip_src.s_addr = tmp;\n\tipv4->calcChecksum();\n\n\t\/\/ Set UDP checksum to 0 and hope for the best\n\tudp->check = 0;\n\tuint16_t tmp16 = udp->dest;\n\tudp->dest = udp->source;\n\tudp->source = tmp16;\n\n\t\/\/ We are done after this -> transition to Terminate\n\tstate.transition(HelloByeClient::RecvBye);\n\n\tfunIface.addPktToSend(pkt);\n};\n\n\/*\n * ===================================\n * Prepare template instances\n * ===================================\n *\n *\/\n\ntemplate class HelloByeServerHello<IPv4_5TupleL2Ident<SamplePacket>, SamplePacket>;\ntemplate class HelloByeServerBye<IPv4_5TupleL2Ident<SamplePacket>, SamplePacket>;\ntemplate class HelloByeClientHello<IPv4_5TupleL2Ident<SamplePacket>, SamplePacket>;\ntemplate class HelloByeClientBye<IPv4_5TupleL2Ident<SamplePacket>, SamplePacket>;\n<commit_msg>rename variables<commit_after>#include <cstdlib>\n#include <sstream>\n\n#include \"headers.hpp\"\n#include \"helloByeProto.hpp\"\n#include \"IPv4_5TupleL2Ident.hpp\"\n#include \"samplePacket.hpp\"\n\nusing namespace Headers;\nusing namespace std;\n\n\/*\n * ===================================\n * HelloByeServerHello\n * ===================================\n *\n *\/\n\ntemplate <class Identifier, class Packet>\nHelloByeServerHello<Identifier, Packet>::HelloByeServerHello() {\n\tthis->serverCookie = rand();\n};\n\ntemplate <class Identifier, class Packet>\nvoid HelloByeServerHello<Identifier, Packet>::fun(\n\ttypename SM::State &state, Packet *pkt, typename SM::FunIface &funIface) {\n\n\t\/\/ Get info from packet\n\tEthernet *ether = reinterpret_cast<Ethernet *>(pkt->getData());\n\tIPv4 *ipv4 = reinterpret_cast<IPv4 *>(ether->getPayload());\n\tUdp *udp = reinterpret_cast<Udp *>(ipv4->getPayload());\n\n\tchar clientStr[] = \"CLIENT HELLO:\";\n\tif (memcmp(udp->getPayload(), clientStr, sizeof(clientStr) - 1) == 0) {\n\t\tcout << \"HelloByeServerHello::fun() clientStr didn't match\" << endl;\n\t\tstate.transition(HelloByeServer::Terminate);\n\t\treturn;\n\t}\n\n\t\/\/ Get client cookie\n\tuint8_t cookieChar = reinterpret_cast<uint8_t *>(udp->getPayload())[sizeof(clientStr)];\n\tthis->clientCookie = static_cast<int>(cookieChar) - 48; \/\/ ASCII Conversion\n\n\t\/\/ Prepare new packet\n\t\/\/ Set payload string\n\tstringstream sstream;\n\tsstream << \"SERVER HELLO:\" << this->serverCookie << endl;\n\tstring serverHelloStr = sstream.str();\n\tmemcpy(udp->getPayload(), serverHelloStr.c_str(), serverHelloStr.length());\n\n\t\/\/ Set the IP header stuff\n\t\/\/ Leave the payload length alone for now...\n\tipv4->ip_ttl = 64;\n\tuint32_t tmp = ipv4->ip_dst.s_addr;\n\tipv4->ip_dst.s_addr = ipv4->ip_src.s_addr;\n\tipv4->ip_src.s_addr = tmp;\n\tipv4->calcChecksum();\n\n\t\/\/ Set UDP checksum to 0 and hope for the best\n\tudp->check = 0;\n\tuint16_t tmp16 = udp->dest;\n\tudp->dest = udp->source;\n\tudp->source = tmp16;\n\n\tfunIface.addPktToSend(pkt);\n};\n\n\/*\n * ===================================\n * HelloByeServerBye\n * ===================================\n *\n *\/\n\ntemplate <class Identifier, class Packet>\nHelloByeServerBye<Identifier, Packet>::HelloByeServerBye(\n\tconst HelloByeServerHello<Identifier, Packet> *in)\n\t: clientCookie(in->clientCookie), serverCookie(in->serverCookie) {}\n\ntemplate <class Identifier, class Packet>\nvoid HelloByeServerBye<Identifier, Packet>::fun(\n\ttypename SM::State &state, Packet *pkt, typename SM::FunIface &funIface) {\n\n\t\/\/ Get info from packet\n\tEthernet *ether = reinterpret_cast<Ethernet *>(pkt->getData());\n\tIPv4 *ipv4 = reinterpret_cast<IPv4 *>(ether->getPayload());\n\tUdp *udp = reinterpret_cast<Udp *>(ipv4->getPayload());\n\n\tchar clientStr[] = \"CLIENT BYE:\";\n\tif (memcmp(udp->getPayload(), clientStr, sizeof(clientStr) - 1) == 0) {\n\t\tcout << \"HelloByeServerBye::fun() clientStr didn't match\" << endl;\n\t\tstate.transition(HelloByeServer::Terminate);\n\t\treturn;\n\t}\n\n\t\/\/ Get client cookie\n\tuint8_t cookieChar = reinterpret_cast<uint8_t *>(udp->getPayload())[sizeof(clientStr)];\n\tint recvCookie = static_cast<int>(cookieChar) - 48; \/\/ ASCII Conversion\n\n\tif(recvCookie != this->serverCookie){\n\t\tcout << \"HelloByeServerBye::fun() Client sent over wrong cookie\" << endl;\n\t\tstate.transition(HelloByeServer::Terminate);\n\t\treturn;\n\t}\n\n\t\/\/ Prepare new packet\n\t\/\/ Set payload string\n\tstringstream sstream;\n\tsstream << \"SERVER BYE:\" << this->clientCookie << endl;\n\tstring serverByeStr = sstream.str();\n\tmemcpy(udp->getPayload(), serverByeStr.c_str(), serverByeStr.length());\n\n\t\/\/ Set the IP header stuff\n\t\/\/ Leave the payload length alone for now...\n\tipv4->ip_ttl = 64;\n\tuint32_t tmp = ipv4->ip_dst.s_addr;\n\tipv4->ip_dst.s_addr = ipv4->ip_src.s_addr;\n\tipv4->ip_src.s_addr = tmp;\n\tipv4->calcChecksum();\n\n\t\/\/ Set UDP checksum to 0 and hope for the best\n\tudp->check = 0;\n\tuint16_t tmp16 = udp->dest;\n\tudp->dest = udp->source;\n\tudp->source = tmp16;\n\n\t\/\/ We are done after this -> transition to Terminate\n\tstate.transition(HelloByeServer::Terminate);\n\n\tfunIface.addPktToSend(pkt);\n};\n\n\/*\n * ===================================\n * HelloByeClientHello\n * ===================================\n *\n *\/\n\ntemplate <class Identifier, class Packet>\nHelloByeClientHello<Identifier, Packet>::HelloByeClientHello(uint32_t dstIp, uint16_t srcPort)\n\t: dstIp(dstIp), srcPort(srcPort) {\n\tthis->clientCookie = rand();\n};\n\ntemplate <class Identifier, class Packet>\nvoid HelloByeClientHello<Identifier, Packet>::fun(\n\ttypename SM::State &state, Packet *pkt, typename SM::FunIface &funIface) {\n\n\t\/\/ pkt is empty -> get one\n\tpkt = funIface.getPkt();\n\tmemset(pkt->getData(), 0, pkt->getDataLen());\n\n\t\/\/ Get info from packet\n\tEthernet *ether = reinterpret_cast<Ethernet *>(pkt->getData());\n\tIPv4 *ipv4 = reinterpret_cast<IPv4 *>(ether->getPayload());\n\tUdp *udp = reinterpret_cast<Udp *>(ipv4->getPayload());\n\n\tHelloByeClientConfig *config = HelloByeClientConfig::getInstance();\n\n\t\/\/ Prepare new packet\n\t\/\/ Set payload string\n\tstringstream sstream;\n\tsstream << \"CLIENT HELLO:\" << this->clientCookie << endl;\n\tstring clientHelloStr = sstream.str();\n\tmemcpy(udp->getPayload(), clientHelloStr.c_str(), clientHelloStr.length());\n\n\t\/\/ Set the IP header stuff\n\t\/\/ Leave the payload length alone for now...\n\tipv4->ip_ttl = 64;\n\tipv4->ip_dst.s_addr = dstIp;\n\tipv4->ip_src.s_addr = config->getSrcIP();\n\tipv4->calcChecksum();\n\n\t\/\/ Set UDP checksum to 0 and hope for the best\n\tudp->check = 0;\n\tudp->dest = config->getDstPort();\n\tudp->source = srcPort;\n\n\tstate.transition(HelloByeClient::Bye);\n\n\tfunIface.addPktToSend(pkt);\n};\n\n\/*\n * ===================================\n * HelloByeClientBye\n * ===================================\n *\n *\/\n\ntemplate <class Identifier, class Packet>\nHelloByeClientBye<Identifier, Packet>::HelloByeClientBye(\n\tconst HelloByeClientHello<Identifier, Packet> *in)\n\t: clientCookie(in->clientCookie) {}\n\ntemplate <class Identifier, class Packet>\nvoid HelloByeClientBye<Identifier, Packet>::fun(\n\ttypename SM::State &state, Packet *pkt, typename SM::FunIface &funIface) {\n\n\t\/\/ Get info from packet\n\tEthernet *ether = reinterpret_cast<Ethernet *>(pkt->getData());\n\tIPv4 *ipv4 = reinterpret_cast<IPv4 *>(ether->getPayload());\n\tUdp *udp = reinterpret_cast<Udp *>(ipv4->getPayload());\n\n\tchar serverStr[] = \"SERVER HELLO:\";\n\tif (memcmp(udp->getPayload(), serverStr, sizeof(serverStr) - 1) == 0) {\n\t\tcout << \"HelloByeClientBye::fun() serverStr didn't match\" << endl;\n\t\tstate.transition(HelloByeClient::Terminate);\n\t\treturn;\n\t}\n\n\t\/\/ Get server cookie\n\tuint8_t cookieChar = reinterpret_cast<uint8_t *>(udp->getPayload())[sizeof(serverStr)];\n\tthis->serverCookie = static_cast<int>(cookieChar) - 48; \/\/ ASCII Conversion\n\n\t\/\/ Prepare new packet\n\t\/\/ Set payload string\n\tstringstream sstream;\n\tsstream << \"CLIENT BYE:\" << this->serverCookie << endl;\n\tstring clientByeStr = sstream.str();\n\tmemcpy(udp->getPayload(), clientByeStr.c_str(), clientByeStr.length());\n\n\t\/\/ Set the IP header stuff\n\t\/\/ Leave the payload length alone for now...\n\tipv4->ip_ttl = 64;\n\tuint32_t tmp = ipv4->ip_dst.s_addr;\n\tipv4->ip_dst.s_addr = ipv4->ip_src.s_addr;\n\tipv4->ip_src.s_addr = tmp;\n\tipv4->calcChecksum();\n\n\t\/\/ Set UDP checksum to 0 and hope for the best\n\tudp->check = 0;\n\tuint16_t tmp16 = udp->dest;\n\tudp->dest = udp->source;\n\tudp->source = tmp16;\n\n\t\/\/ We are done after this -> transition to Terminate\n\tstate.transition(HelloByeClient::RecvBye);\n\n\tfunIface.addPktToSend(pkt);\n};\n\n\/*\n * ===================================\n * Prepare template instances\n * ===================================\n *\n *\/\n\ntemplate class HelloByeServerHello<IPv4_5TupleL2Ident<SamplePacket>, SamplePacket>;\ntemplate class HelloByeServerBye<IPv4_5TupleL2Ident<SamplePacket>, SamplePacket>;\ntemplate class HelloByeClientHello<IPv4_5TupleL2Ident<SamplePacket>, SamplePacket>;\ntemplate class HelloByeClientBye<IPv4_5TupleL2Ident<SamplePacket>, SamplePacket>;\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n** libebml : parse EBML files, see http:\/\/embl.sourceforge.net\/\n**\n** <file\/class description>\n**\n** Copyright (C) 2002-2010 Steve Lhomme.  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 Street, Fifth Floor, Boston, MA  02110-1301  USA\n**\n** See http:\/\/www.gnu.org\/licenses\/lgpl-2.1.html for LGPL licensing information.\n**\n** Contact license@matroska.org if any conditions of this licensing are\n** not clear to you.\n**\n**********************************************************************\/\n\n\/*!\n  \\file\n  \\version \\$Id$\n  \\author Steve Lhomme     <robux4 @ users.sf.net>\n  \\author Moritz Bunkus <moritz @ bunkus.org>\n*\/\n#include <cassert>\n#include <limits>\n\n#include \"ebml\/EbmlSInteger.h\"\n\n\/\/ Converting unsigned int types to signed ints assuming the\n\/\/ underlying bits in memory should represent the 2's complement of a\n\/\/ signed integer. See https:\/\/stackoverflow.com\/a\/13208789\/507077\n\nnamespace {\n\nint64\nToSigned(uint64 u) {\n  if (u <= static_cast<uint64>(std::numeric_limits<int64>::max()))\n    return static_cast<int64>(u);\n\n  return static_cast<int64>(u - std::numeric_limits<int64>::min()) + std::numeric_limits<int64>::min();\n}\n\n}\n\nSTART_LIBEBML_NAMESPACE\n\nEbmlSInteger::EbmlSInteger()\n  :EbmlElement(DEFAULT_INT_SIZE, false)\n{}\n\nEbmlSInteger::EbmlSInteger(int64 aDefaultValue)\n  :EbmlElement(DEFAULT_INT_SIZE, true), Value(aDefaultValue)\n{\n  SetDefaultIsSet();\n}\n\nEbmlSInteger::operator int8() const {return  int8(Value);}\nEbmlSInteger::operator int16() const {return int16(Value);}\nEbmlSInteger::operator int32() const {return int32(Value);}\nEbmlSInteger::operator int64() const {return Value;}\n\nint64 EbmlSInteger::GetValue() const {return Value;}\n\nEbmlSInteger & EbmlSInteger::SetValue(int64 NewValue) {\n  return *this = NewValue;\n}\n\n\/*!\n  \\todo handle exception on errors\n*\/\nfilepos_t EbmlSInteger::RenderData(IOCallback & output, bool \/* bForceRender *\/, bool \/* bWithDefault *\/)\n{\n  binary FinalData[8]; \/\/ we don't handle more than 64 bits integers\n  unsigned int i;\n\n  if (GetSizeLength() > 8)\n    return 0; \/\/ integer bigger coded on more than 64 bits are not supported\n\n  int64 TempValue = Value;\n  for (i=0; i<GetSize();i++) {\n    FinalData[GetSize()-i-1] = binary(TempValue & 0xFF);\n    TempValue >>= 8;\n  }\n\n  output.writeFully(FinalData,GetSize());\n\n  return GetSize();\n}\n\nuint64 EbmlSInteger::UpdateSize(bool bWithDefault, bool \/* bForceRender *\/)\n{\n  if (!bWithDefault && IsDefaultValue())\n    return 0;\n\n  if (Value <= 0x7F && Value >= (-0x80)) {\n    SetSize_(1);\n  } else if (Value <= 0x7FFF && Value >= (-0x8000)) {\n    SetSize_(2);\n  } else if (Value <= 0x7FFFFF && Value >= (-0x800000)) {\n    SetSize_(3);\n  } else if (Value <= EBML_PRETTYLONGINT(0x7FFFFFFF) && Value >= (EBML_PRETTYLONGINT(-0x80000000))) {\n    SetSize_(4);\n  } else if (Value <= EBML_PRETTYLONGINT(0x7FFFFFFFFF) &&\n             Value >= EBML_PRETTYLONGINT(-0x8000000000)) {\n    SetSize_(5);\n  } else if (Value <= EBML_PRETTYLONGINT(0x7FFFFFFFFFFF) &&\n             Value >= EBML_PRETTYLONGINT(-0x800000000000)) {\n    SetSize_(6);\n  } else if (Value <= EBML_PRETTYLONGINT(0x7FFFFFFFFFFFFF) &&\n             Value >= EBML_PRETTYLONGINT(-0x80000000000000)) {\n    SetSize_(7);\n  } else {\n    SetSize_(8);\n  }\n\n  if (GetDefaultSize() > GetSize()) {\n    SetSize_(GetDefaultSize());\n  }\n\n  return GetSize();\n}\n\nfilepos_t EbmlSInteger::ReadData(IOCallback & input, ScopeMode ReadFully)\n{\n  if (ReadFully != SCOPE_NO_DATA) {\n    binary Buffer[8];\n    input.readFully(Buffer, GetSize());\n\n    uint64 TempValue = Buffer[0] & 0x80 ? std::numeric_limits<uint64>::max() : 0;\n\n    for (unsigned int i=0; i<GetSize(); i++) {\n      TempValue <<= 8;\n      TempValue |= Buffer[i];\n    }\n\n    Value = ToSigned(TempValue);\n\n    SetValueIsSet();\n  }\n\n  return GetSize();\n}\n\nbool EbmlSInteger::IsSmallerThan(const EbmlElement *Cmp) const\n{\n  if (EbmlId(*this) == EbmlId(*Cmp))\n    return this->Value < static_cast<const EbmlSInteger *>(Cmp)->Value;\n\n  return false;\n}\n\nEND_LIBEBML_NAMESPACE\n<commit_msg>[clang-tidy] terminate anonymous namespace<commit_after>\/****************************************************************************\n** libebml : parse EBML files, see http:\/\/embl.sourceforge.net\/\n**\n** <file\/class description>\n**\n** Copyright (C) 2002-2010 Steve Lhomme.  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 Street, Fifth Floor, Boston, MA  02110-1301  USA\n**\n** See http:\/\/www.gnu.org\/licenses\/lgpl-2.1.html for LGPL licensing information.\n**\n** Contact license@matroska.org if any conditions of this licensing are\n** not clear to you.\n**\n**********************************************************************\/\n\n\/*!\n  \\file\n  \\version \\$Id$\n  \\author Steve Lhomme     <robux4 @ users.sf.net>\n  \\author Moritz Bunkus <moritz @ bunkus.org>\n*\/\n#include <cassert>\n#include <limits>\n\n#include \"ebml\/EbmlSInteger.h\"\n\n\/\/ Converting unsigned int types to signed ints assuming the\n\/\/ underlying bits in memory should represent the 2's complement of a\n\/\/ signed integer. See https:\/\/stackoverflow.com\/a\/13208789\/507077\n\nnamespace {\n\nint64\nToSigned(uint64 u) {\n  if (u <= static_cast<uint64>(std::numeric_limits<int64>::max()))\n    return static_cast<int64>(u);\n\n  return static_cast<int64>(u - std::numeric_limits<int64>::min()) + std::numeric_limits<int64>::min();\n}\n\n} \/\/ namespace\n\nSTART_LIBEBML_NAMESPACE\n\nEbmlSInteger::EbmlSInteger()\n  :EbmlElement(DEFAULT_INT_SIZE, false)\n{}\n\nEbmlSInteger::EbmlSInteger(int64 aDefaultValue)\n  :EbmlElement(DEFAULT_INT_SIZE, true), Value(aDefaultValue)\n{\n  SetDefaultIsSet();\n}\n\nEbmlSInteger::operator int8() const {return  int8(Value);}\nEbmlSInteger::operator int16() const {return int16(Value);}\nEbmlSInteger::operator int32() const {return int32(Value);}\nEbmlSInteger::operator int64() const {return Value;}\n\nint64 EbmlSInteger::GetValue() const {return Value;}\n\nEbmlSInteger & EbmlSInteger::SetValue(int64 NewValue) {\n  return *this = NewValue;\n}\n\n\/*!\n  \\todo handle exception on errors\n*\/\nfilepos_t EbmlSInteger::RenderData(IOCallback & output, bool \/* bForceRender *\/, bool \/* bWithDefault *\/)\n{\n  binary FinalData[8]; \/\/ we don't handle more than 64 bits integers\n  unsigned int i;\n\n  if (GetSizeLength() > 8)\n    return 0; \/\/ integer bigger coded on more than 64 bits are not supported\n\n  int64 TempValue = Value;\n  for (i=0; i<GetSize();i++) {\n    FinalData[GetSize()-i-1] = binary(TempValue & 0xFF);\n    TempValue >>= 8;\n  }\n\n  output.writeFully(FinalData,GetSize());\n\n  return GetSize();\n}\n\nuint64 EbmlSInteger::UpdateSize(bool bWithDefault, bool \/* bForceRender *\/)\n{\n  if (!bWithDefault && IsDefaultValue())\n    return 0;\n\n  if (Value <= 0x7F && Value >= (-0x80)) {\n    SetSize_(1);\n  } else if (Value <= 0x7FFF && Value >= (-0x8000)) {\n    SetSize_(2);\n  } else if (Value <= 0x7FFFFF && Value >= (-0x800000)) {\n    SetSize_(3);\n  } else if (Value <= EBML_PRETTYLONGINT(0x7FFFFFFF) && Value >= (EBML_PRETTYLONGINT(-0x80000000))) {\n    SetSize_(4);\n  } else if (Value <= EBML_PRETTYLONGINT(0x7FFFFFFFFF) &&\n             Value >= EBML_PRETTYLONGINT(-0x8000000000)) {\n    SetSize_(5);\n  } else if (Value <= EBML_PRETTYLONGINT(0x7FFFFFFFFFFF) &&\n             Value >= EBML_PRETTYLONGINT(-0x800000000000)) {\n    SetSize_(6);\n  } else if (Value <= EBML_PRETTYLONGINT(0x7FFFFFFFFFFFFF) &&\n             Value >= EBML_PRETTYLONGINT(-0x80000000000000)) {\n    SetSize_(7);\n  } else {\n    SetSize_(8);\n  }\n\n  if (GetDefaultSize() > GetSize()) {\n    SetSize_(GetDefaultSize());\n  }\n\n  return GetSize();\n}\n\nfilepos_t EbmlSInteger::ReadData(IOCallback & input, ScopeMode ReadFully)\n{\n  if (ReadFully != SCOPE_NO_DATA) {\n    binary Buffer[8];\n    input.readFully(Buffer, GetSize());\n\n    uint64 TempValue = Buffer[0] & 0x80 ? std::numeric_limits<uint64>::max() : 0;\n\n    for (unsigned int i=0; i<GetSize(); i++) {\n      TempValue <<= 8;\n      TempValue |= Buffer[i];\n    }\n\n    Value = ToSigned(TempValue);\n\n    SetValueIsSet();\n  }\n\n  return GetSize();\n}\n\nbool EbmlSInteger::IsSmallerThan(const EbmlElement *Cmp) const\n{\n  if (EbmlId(*this) == EbmlId(*Cmp))\n    return this->Value < static_cast<const EbmlSInteger *>(Cmp)->Value;\n\n  return false;\n}\n\nEND_LIBEBML_NAMESPACE\n<|endoftext|>"}
{"text":"<commit_before>#include \"dijkstra.h\"\n#include <thread>\n\nint main(int argc, char * argv[]) {\n    Dijkstra(argc, argv);\n}<commit_msg>Removed unnecessary include<commit_after>#include \"dijkstra.h\"\n\nint main(int argc, char * argv[]) {\n    Dijkstra(argc, argv);\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2019-2022, 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\n#include \"src\/fastertransformer\/models\/t5\/T5DecodingWeight.h\"\n#include \"src\/fastertransformer\/utils\/logger.h\"\n\nnamespace fastertransformer {\n\ntemplate<typename T>\nT5DecodingWeight<T>::T5DecodingWeight(const size_t                head_num,\n                                      const size_t                size_per_head,\n                                      const size_t                d_model,\n                                      const size_t                inter_size,\n                                      const size_t                vocab_size,\n                                      const size_t                num_layer,\n                                      const size_t                mem_d_model,\n                                      const size_t                num_bucket_or_max_seq_len,\n                                      const size_t                tensor_para_size,\n                                      const size_t                tensor_para_rank,\n                                      const size_t                pipeline_para_size,\n                                      const size_t                pipeline_para_rank,\n                                      const bool                  t5_with_bias_para,\n                                      const bool                  use_gated_activation_para,\n                                      const PositionEmbeddingType pe_type):\n    head_num_(head_num),\n    size_per_head_(size_per_head),\n    d_model_(d_model),\n    inter_size_(inter_size),\n    vocab_size_(vocab_size),\n    num_layer_(num_layer),\n    mem_d_model_(mem_d_model),\n    num_bucket_or_max_seq_len_(num_bucket_or_max_seq_len),\n    tensor_para_size_(tensor_para_size),\n    tensor_para_rank_(tensor_para_rank),\n    pipeline_para_size_(pipeline_para_size),\n    pipeline_para_rank_(pipeline_para_rank),\n    t5_with_bias(t5_with_bias_para),\n    use_gated_activation(use_gated_activation_para),\n    position_embedding_type(pe_type),\n    real_weights_num_(t5_with_bias ? 6 : 4)\n{\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" start\");\n    FT_CHECK(num_layer_ % pipeline_para_size_ == 0);\n    initialize();\n    mallocWeights();\n    setWeightPtr();\n\n    decoder_layer_weights.clear();\n    decoder_layer_weights.reserve(num_layer_);\n    for (int l = 0; l < num_layer_; l++) {\n        if (isValidLayerParallelId(l)) {\n            decoder_layer_weights.push_back(new T5DecoderLayerWeight<T>(head_num_,\n                                                                        size_per_head_,\n                                                                        d_model_,\n                                                                        inter_size_,\n                                                                        mem_d_model_,\n                                                                        tensor_para_size_,\n                                                                        tensor_para_rank_,\n                                                                        t5_with_bias,\n                                                                        use_gated_activation));\n        }\n        else {\n            decoder_layer_weights.push_back(new T5DecoderLayerWeight<T>());\n        }\n    }\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" end\");\n}\n\ntemplate<typename T>\nvoid T5DecodingWeight<T>::initialize()\n{\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" start\");\n    weights_size[0] = d_model_ * vocab_size_;\n    if (position_embedding_type == PositionEmbeddingType::absolute) {\n        weights_size[1] = num_bucket_or_max_seq_len_ * d_model_;\n    }\n    else {\n        weights_size[1] = (head_num_ \/ tensor_para_size_) * num_bucket_or_max_seq_len_;\n    }\n    weights_size[2] = d_model_;\n    weights_size[3] = d_model_ * vocab_size_;\n    weights_size[4] = d_model_;\n    weights_size[5] = vocab_size_;\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" end\");\n}\n\ntemplate<typename T>\nT5DecodingWeight<T>::~T5DecodingWeight()\n{\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" start\");\n    if (is_maintain_buffer == true) {\n        decoder_layer_weights.clear();\n        for (int i = 0; i < real_weights_num_; i++) {\n            deviceFree(weights_ptr[i]);\n        }\n\n        pre_decoder_embedding_table             = nullptr;\n        absolute_or_relative_position_embedding = nullptr;\n        post_decoder_layernorm.gamma            = nullptr;\n        post_decoder_embedding.kernel           = nullptr;\n        post_decoder_embedding.bias             = nullptr;\n        post_decoder_layernorm.beta             = nullptr;\n        is_maintain_buffer                      = false;\n    }\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" end\");\n}\n\ntemplate<typename T>\nT5DecodingWeight<T>::T5DecodingWeight(const T5DecodingWeight& other):\n    head_num_(other.head_num_),\n    size_per_head_(other.size_per_head_),\n    d_model_(other.d_model_),\n    inter_size_(other.inter_size_),\n    vocab_size_(other.vocab_size_),\n    num_layer_(other.num_layer_),\n    mem_d_model_(other.mem_d_model_),\n    num_bucket_or_max_seq_len_(other.num_bucket_or_max_seq_len_),\n    tensor_para_size_(other.tensor_para_size_),\n    tensor_para_rank_(other.tensor_para_rank_),\n    pipeline_para_size_(other.pipeline_para_size_),\n    pipeline_para_rank_(other.pipeline_para_rank_),\n    t5_with_bias(other.t5_with_bias),\n    use_gated_activation(other.use_gated_activation),\n    position_embedding_type(other.position_embedding_type),\n    real_weights_num_(other.real_weights_num_)\n{\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" start\");\n    initialize();\n    mallocWeights();\n    for (int i = 0; i < real_weights_num_; i++) {\n        cudaD2Dcpy(weights_ptr[i], other.weights_ptr[i], weights_size[i]);\n    }\n    setWeightPtr();\n\n    decoder_layer_weights.clear();\n    decoder_layer_weights.reserve(num_layer_);\n    for (int l = 0; l < num_layer_; l++) {\n        decoder_layer_weights.push_back(new T5DecoderLayerWeight<T>(*other.decoder_layer_weights[l]));\n    }\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" end\");\n}\n\ntemplate<typename T>\nT5DecodingWeight<T>& T5DecodingWeight<T>::operator=(const T5DecodingWeight& other)\n{\n    head_num_                  = other.head_num_;\n    size_per_head_             = other.size_per_head_;\n    d_model_                   = other.d_model_;\n    inter_size_                = other.inter_size_;\n    vocab_size_                = other.vocab_size_;\n    num_layer_                 = other.num_layer_;\n    mem_d_model_               = other.mem_d_model_;\n    num_bucket_or_max_seq_len_ = other.num_bucket_or_max_seq_len_;\n    tensor_para_size_          = other.tensor_para_size_;\n    tensor_para_rank_          = other.tensor_para_rank_;\n    pipeline_para_size_        = other.pipeline_para_size_;\n    pipeline_para_rank_        = other.pipeline_para_rank_;\n    t5_with_bias               = other.t5_with_bias;\n    use_gated_activation       = other.use_gated_activation;\n    position_embedding_type    = other.position_embedding_type;\n    real_weights_num_          = other.real_weights_num_;\n\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" start\");\n    initialize();\n    mallocWeights();\n    for (int i = 0; i < real_weights_num_; i++) {\n        cudaD2Dcpy(weights_ptr[i], other.weights_ptr[i], weights_size[i]);\n    }\n    setWeightPtr();\n\n    decoder_layer_weights.clear();\n    decoder_layer_weights.reserve(num_layer_);\n    for (int l = 0; l < num_layer_; l++) {\n        decoder_layer_weights.push_back(new T5DecoderLayerWeight<T>(*other.decoder_layer_weights[l]));\n    }\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" end\");\n    return *this;\n}\n\ntemplate<typename T>\nvoid T5DecodingWeight<T>::mallocWeights()\n{\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" start\");\n    for (int i = 0; i < real_weights_num_; i++) {\n        deviceMalloc(&weights_ptr[i], weights_size[i]);\n    }\n    is_maintain_buffer = true;\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" end\");\n}\n\ntemplate<typename T>\nvoid T5DecodingWeight<T>::setWeightPtr()\n{\n    pre_decoder_embedding_table             = weights_ptr[0];\n    absolute_or_relative_position_embedding = weights_ptr[1];\n    post_decoder_layernorm.gamma            = weights_ptr[2];\n    post_decoder_embedding.kernel           = weights_ptr[3];\n    if (t5_with_bias) {\n        post_decoder_layernorm.beta = weights_ptr[4];\n        post_decoder_embedding.bias = weights_ptr[5];\n    }\n}\n\ntemplate<typename T>\nvoid T5DecodingWeight<T>::loadModel(std::string dir_path)\n{\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" start\");\n    FT_CHECK(is_maintain_buffer == true);\n    FtCudaDataType model_file_type = getModelFileType(dir_path + \"\/config.ini\", \"decoder\");\n\n    loadWeightFromBin<T>(weights_ptr[0], {(size_t)weights_size[0]}, dir_path + \"\/shared.weight_T.bin\", model_file_type);\n    if (position_embedding_type == PositionEmbeddingType::absolute) {\n        loadWeightFromBin<T>(weights_ptr[1], {(size_t)weights_size[1]}, dir_path + \"\/shared.ape.bin\", model_file_type);\n    }\n    else {\n        loadWeightFromBin<T>(weights_ptr[1],\n                             {(size_t)weights_size[1]},\n                             dir_path + \"\/decoder.block.0.layer.0.SelfAttention.relative_attention_bias.weight.\"\n                                 + std::to_string(tensor_para_rank_) + \".bin\",\n                             model_file_type);\n    }\n    loadWeightFromBin<T>(\n        weights_ptr[2], {(size_t)weights_size[2]}, dir_path + \"\/decoder.final_layer_norm.weight.bin\", model_file_type);\n    loadWeightFromBin<T>(weights_ptr[3], {(size_t)weights_size[3]}, dir_path + \"\/shared.weight_T.bin\", model_file_type);\n\n    if (t5_with_bias) {\n        loadWeightFromBin<T>(\n            weights_ptr[4], {(size_t)weights_size[4]}, dir_path + \"\/decoder.final_layer_norm.bias.bin\");\n        loadWeightFromBin<T>(weights_ptr[5], {(size_t)weights_size[5]}, dir_path + \"\/shared.bias.bin\");\n    }\n\n    for (int l = 0; l < num_layer_; l++) {\n        if (isValidLayerParallelId(l)) {\n            decoder_layer_weights[l]->loadModel(dir_path + \"\/decoder.block.\" + std::to_string(l) + \".\",\n                                                model_file_type);\n        }\n    }\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" end\");\n}\n\ntemplate<typename T>\nbool T5DecodingWeight<T>::isValidLayerParallelId(int l)\n{\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" start\");\n    int local_num_layer = (int)(ceil(num_layer_ * 1.0f \/ pipeline_para_size_));\n    return l < num_layer_ && (l >= local_num_layer * pipeline_para_rank_)\n           && (l < local_num_layer * (pipeline_para_rank_ + 1));\n}\n\ntemplate<typename T>\nvoid T5DecodingWeight<T>::resizeLayer(const int num_layer)\n{\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" start\");\n    decoder_layer_weights.clear();\n    num_layer_ = num_layer;\n    decoder_layer_weights.reserve(num_layer_);\n    for (int l = 0; l < num_layer_; l++) {\n        decoder_layer_weights.push_back(new T5DecoderLayerWeight<T>());\n    }\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" end\");\n}\n\ntemplate<typename T>\nvoid T5DecodingWeight<T>::setT5StructureDiff(bool                  t5_with_bias_para,\n                                             bool                  use_gated_activation_para,\n                                             PositionEmbeddingType position_embedding_type_para)\n{\n    t5_with_bias            = t5_with_bias_para;\n    use_gated_activation    = use_gated_activation_para;\n    position_embedding_type = position_embedding_type_para;\n    for (int i = 0; i < num_layer_; i++) {\n        decoder_layer_weights[i]->setT5WithBias(t5_with_bias_para, use_gated_activation_para);\n    }\n}\n\ntemplate struct T5DecodingWeight<float>;\ntemplate struct T5DecodingWeight<half>;\n#ifdef ENABLE_BF16\ntemplate struct T5DecodingWeight<__nv_bfloat16>;\n#endif\n\n}  \/\/ namespace fastertransformer\n<commit_msg>Update T5DecodingWeight.cc<commit_after>\/*\n * Copyright (c) 2019-2022, 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\n#include \"src\/fastertransformer\/models\/t5\/T5DecodingWeight.h\"\n#include \"src\/fastertransformer\/utils\/logger.h\"\n\nnamespace fastertransformer {\n\ntemplate<typename T>\nT5DecodingWeight<T>::T5DecodingWeight(const size_t                head_num,\n                                      const size_t                size_per_head,\n                                      const size_t                d_model,\n                                      const size_t                inter_size,\n                                      const size_t                vocab_size,\n                                      const size_t                num_layer,\n                                      const size_t                mem_d_model,\n                                      const size_t                num_bucket_or_max_seq_len,\n                                      const size_t                tensor_para_size,\n                                      const size_t                tensor_para_rank,\n                                      const size_t                pipeline_para_size,\n                                      const size_t                pipeline_para_rank,\n                                      const bool                  t5_with_bias_para,\n                                      const bool                  use_gated_activation_para,\n                                      const PositionEmbeddingType pe_type):\n    head_num_(head_num),\n    size_per_head_(size_per_head),\n    d_model_(d_model),\n    inter_size_(inter_size),\n    vocab_size_(vocab_size),\n    num_layer_(num_layer),\n    mem_d_model_(mem_d_model),\n    num_bucket_or_max_seq_len_(num_bucket_or_max_seq_len),\n    tensor_para_size_(tensor_para_size),\n    tensor_para_rank_(tensor_para_rank),\n    pipeline_para_size_(pipeline_para_size),\n    pipeline_para_rank_(pipeline_para_rank),\n    t5_with_bias(t5_with_bias_para),\n    use_gated_activation(use_gated_activation_para),\n    position_embedding_type(pe_type),\n    real_weights_num_(t5_with_bias ? 6 : 4)\n{\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" start\");\n    FT_CHECK(num_layer_ % pipeline_para_size_ == 0);\n    initialize();\n    mallocWeights();\n    setWeightPtr();\n\n    decoder_layer_weights.clear();\n    decoder_layer_weights.reserve(num_layer_);\n    for (int l = 0; l < num_layer_; l++) {\n        if (isValidLayerParallelId(l)) {\n            decoder_layer_weights.push_back(new T5DecoderLayerWeight<T>(head_num_,\n                                                                        size_per_head_,\n                                                                        d_model_,\n                                                                        inter_size_,\n                                                                        mem_d_model_,\n                                                                        tensor_para_size_,\n                                                                        tensor_para_rank_,\n                                                                        t5_with_bias,\n                                                                        use_gated_activation));\n        }\n        else {\n            decoder_layer_weights.push_back(new T5DecoderLayerWeight<T>());\n        }\n    }\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" end\");\n}\n\ntemplate<typename T>\nvoid T5DecodingWeight<T>::initialize()\n{\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" start\");\n    weights_size[0] = d_model_ * vocab_size_;\n    if (position_embedding_type == PositionEmbeddingType::absolute) {\n        weights_size[1] = num_bucket_or_max_seq_len_ * d_model_;\n    }\n    else {\n        weights_size[1] = (head_num_ \/ tensor_para_size_) * num_bucket_or_max_seq_len_;\n    }\n    weights_size[2] = d_model_;\n    weights_size[3] = d_model_ * vocab_size_;\n    weights_size[4] = d_model_;\n    weights_size[5] = vocab_size_;\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" end\");\n}\n\ntemplate<typename T>\nT5DecodingWeight<T>::~T5DecodingWeight()\n{\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" start\");\n    if (is_maintain_buffer == true) {\n        decoder_layer_weights.clear();\n        for (int i = 0; i < real_weights_num_; i++) {\n            deviceFree(weights_ptr[i]);\n        }\n\n        pre_decoder_embedding_table             = nullptr;\n        absolute_or_relative_position_embedding = nullptr;\n        post_decoder_layernorm.gamma            = nullptr;\n        post_decoder_embedding.kernel           = nullptr;\n        post_decoder_embedding.bias             = nullptr;\n        post_decoder_layernorm.beta             = nullptr;\n        is_maintain_buffer                      = false;\n    }\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" end\");\n}\n\ntemplate<typename T>\nT5DecodingWeight<T>::T5DecodingWeight(const T5DecodingWeight& other):\n    head_num_(other.head_num_),\n    size_per_head_(other.size_per_head_),\n    d_model_(other.d_model_),\n    inter_size_(other.inter_size_),\n    vocab_size_(other.vocab_size_),\n    num_layer_(other.num_layer_),\n    mem_d_model_(other.mem_d_model_),\n    num_bucket_or_max_seq_len_(other.num_bucket_or_max_seq_len_),\n    tensor_para_size_(other.tensor_para_size_),\n    tensor_para_rank_(other.tensor_para_rank_),\n    pipeline_para_size_(other.pipeline_para_size_),\n    pipeline_para_rank_(other.pipeline_para_rank_),\n    t5_with_bias(other.t5_with_bias),\n    use_gated_activation(other.use_gated_activation),\n    position_embedding_type(other.position_embedding_type),\n    real_weights_num_(other.real_weights_num_)\n{\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" start\");\n    initialize();\n    mallocWeights();\n    for (int i = 0; i < real_weights_num_; i++) {\n        cudaD2Dcpy(weights_ptr[i], other.weights_ptr[i], weights_size[i]);\n    }\n    setWeightPtr();\n\n    decoder_layer_weights.clear();\n    decoder_layer_weights.reserve(num_layer_);\n    for (int l = 0; l < num_layer_; l++) {\n        decoder_layer_weights.push_back(new T5DecoderLayerWeight<T>(*other.decoder_layer_weights[l]));\n    }\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" end\");\n}\n\ntemplate<typename T>\nT5DecodingWeight<T>& T5DecodingWeight<T>::operator=(const T5DecodingWeight& other)\n{\n    head_num_                  = other.head_num_;\n    size_per_head_             = other.size_per_head_;\n    d_model_                   = other.d_model_;\n    inter_size_                = other.inter_size_;\n    vocab_size_                = other.vocab_size_;\n    num_layer_                 = other.num_layer_;\n    mem_d_model_               = other.mem_d_model_;\n    num_bucket_or_max_seq_len_ = other.num_bucket_or_max_seq_len_;\n    tensor_para_size_          = other.tensor_para_size_;\n    tensor_para_rank_          = other.tensor_para_rank_;\n    pipeline_para_size_        = other.pipeline_para_size_;\n    pipeline_para_rank_        = other.pipeline_para_rank_;\n    t5_with_bias               = other.t5_with_bias;\n    use_gated_activation       = other.use_gated_activation;\n    position_embedding_type    = other.position_embedding_type;\n    real_weights_num_          = other.real_weights_num_;\n\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" start\");\n    initialize();\n    mallocWeights();\n    for (int i = 0; i < real_weights_num_; i++) {\n        cudaD2Dcpy(weights_ptr[i], other.weights_ptr[i], weights_size[i]);\n    }\n    setWeightPtr();\n\n    decoder_layer_weights.clear();\n    decoder_layer_weights.reserve(num_layer_);\n    for (int l = 0; l < num_layer_; l++) {\n        decoder_layer_weights.push_back(new T5DecoderLayerWeight<T>(*other.decoder_layer_weights[l]));\n    }\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" end\");\n    return *this;\n}\n\ntemplate<typename T>\nvoid T5DecodingWeight<T>::mallocWeights()\n{\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" start\");\n    for (int i = 0; i < real_weights_num_; i++) {\n        deviceMalloc(&weights_ptr[i], weights_size[i]);\n    }\n    is_maintain_buffer = true;\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" end\");\n}\n\ntemplate<typename T>\nvoid T5DecodingWeight<T>::setWeightPtr()\n{\n    pre_decoder_embedding_table             = weights_ptr[0];\n    absolute_or_relative_position_embedding = weights_ptr[1];\n    post_decoder_layernorm.gamma            = weights_ptr[2];\n    post_decoder_embedding.kernel           = weights_ptr[3];\n    if (t5_with_bias) {\n        post_decoder_layernorm.beta = weights_ptr[4];\n        post_decoder_embedding.bias = weights_ptr[5];\n    }\n}\n\ntemplate<typename T>\nvoid T5DecodingWeight<T>::loadModel(std::string dir_path)\n{\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" start\");\n    FT_CHECK(is_maintain_buffer == true);\n    FtCudaDataType model_file_type = getModelFileType(dir_path + \"\/config.ini\", \"decoder\");\n\n    loadWeightFromBin<T>(weights_ptr[0], {(size_t)weights_size[0]}, dir_path + \"\/shared.weight_T.bin\", model_file_type);\n    if (position_embedding_type == PositionEmbeddingType::absolute) {\n        loadWeightFromBin<T>(weights_ptr[1], {(size_t)weights_size[1]}, dir_path + \"\/shared.ape.bin\", model_file_type);\n    }\n    else {\n        loadWeightFromBin<T>(weights_ptr[1],\n                             {(size_t)weights_size[1]},\n                             dir_path + \"\/decoder.block.0.layer.0.SelfAttention.relative_attention_bias.weight.\"\n                                 + std::to_string(tensor_para_rank_) + \".bin\",\n                             model_file_type);\n    }\n    loadWeightFromBin<T>(\n        weights_ptr[2], {(size_t)weights_size[2]}, dir_path + \"\/decoder.final_layer_norm.weight.bin\", model_file_type);\n    loadWeightFromBin<T>(weights_ptr[3], {(size_t)weights_size[3]}, dir_path + \"\/lm_head.weight.bin\", model_file_type);\n\n    if (t5_with_bias) {\n        loadWeightFromBin<T>(\n            weights_ptr[4], {(size_t)weights_size[4]}, dir_path + \"\/decoder.final_layer_norm.bias.bin\");\n        loadWeightFromBin<T>(weights_ptr[5], {(size_t)weights_size[5]}, dir_path + \"\/shared.bias.bin\");\n    }\n\n    for (int l = 0; l < num_layer_; l++) {\n        if (isValidLayerParallelId(l)) {\n            decoder_layer_weights[l]->loadModel(dir_path + \"\/decoder.block.\" + std::to_string(l) + \".\",\n                                                model_file_type);\n        }\n    }\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" end\");\n}\n\ntemplate<typename T>\nbool T5DecodingWeight<T>::isValidLayerParallelId(int l)\n{\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" start\");\n    int local_num_layer = (int)(ceil(num_layer_ * 1.0f \/ pipeline_para_size_));\n    return l < num_layer_ && (l >= local_num_layer * pipeline_para_rank_)\n           && (l < local_num_layer * (pipeline_para_rank_ + 1));\n}\n\ntemplate<typename T>\nvoid T5DecodingWeight<T>::resizeLayer(const int num_layer)\n{\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" start\");\n    decoder_layer_weights.clear();\n    num_layer_ = num_layer;\n    decoder_layer_weights.reserve(num_layer_);\n    for (int l = 0; l < num_layer_; l++) {\n        decoder_layer_weights.push_back(new T5DecoderLayerWeight<T>());\n    }\n    FT_LOG_DEBUG(\"T5DecodingWeight \" + std::string(__func__) + \" end\");\n}\n\ntemplate<typename T>\nvoid T5DecodingWeight<T>::setT5StructureDiff(bool                  t5_with_bias_para,\n                                             bool                  use_gated_activation_para,\n                                             PositionEmbeddingType position_embedding_type_para)\n{\n    t5_with_bias            = t5_with_bias_para;\n    use_gated_activation    = use_gated_activation_para;\n    position_embedding_type = position_embedding_type_para;\n    for (int i = 0; i < num_layer_; i++) {\n        decoder_layer_weights[i]->setT5WithBias(t5_with_bias_para, use_gated_activation_para);\n    }\n}\n\ntemplate struct T5DecodingWeight<float>;\ntemplate struct T5DecodingWeight<half>;\n#ifdef ENABLE_BF16\ntemplate struct T5DecodingWeight<__nv_bfloat16>;\n#endif\n\n}  \/\/ namespace fastertransformer\n<|endoftext|>"}
{"text":"<commit_before>#include <miopen\/handle.hpp>\n#include <miopen\/errors.hpp>\n#include <miopen\/device_name.hpp>\n#include <miopen\/kernel_cache.hpp>\n#include <algorithm>\n\n#ifndef _WIN32\n#include <unistd.h>\n#endif\n\n#include <cassert>\n#include <chrono>\n#include <thread>\n\nnamespace miopen {\n\nhipDevice_t get_device(int id)\n{\n    hipDevice_t device;\n    auto status = hipDeviceGet(&device, id);\n    if (status != hipSuccess) MIOPEN_THROW(\"No device\");\n    return device;\n}\n\nint get_device_id() \/\/ Get random device\n{\n    int device;\n    auto status = hipGetDevice(&device);\n    if (status != hipSuccess) MIOPEN_THROW(\"No device\");\n    return device;\n}\n\nvoid set_device(int id)\n{\n    auto status = hipSetDevice(id);\n    if (status != hipSuccess) MIOPEN_THROW(\"Error setting device\");\n}\n\nvoid set_default_device()\n{\n    int n;\n    auto status = hipGetDeviceCount(&n);\n    if (status != hipSuccess) MIOPEN_THROW(\"Error getting device count\");\n    \/\/ Pick device based on process id\n    auto pid = ::getpid();\n    assert(pid > 0);\n    set_device(pid % n);\n}\n\nstruct HandleImpl\n{\n    \/\/ typedef MIOPEN_MANAGE_PTR(hipStream_t, hipStreamDestroy) StreamPtr;\n    using StreamPtr = std::shared_ptr<typename std::remove_pointer<hipStream_t>::type>;\n\n    HandleImpl()\n    {}\n\n    StreamPtr create_stream()\n    {\n        hipStream_t result;\n        auto status = hipStreamCreate(&result);\n        if (status != hipSuccess) MIOPEN_THROW_HIP_STATUS(status, \"Failed to allocate stream\");\n        return StreamPtr{result, &hipStreamDestroy};\n    }\n\n    static StreamPtr reference_stream(hipStream_t s)\n    {\n        return StreamPtr{s, null_deleter{}};\n    }\n\n    void elapsed_time(hipEvent_t start, hipEvent_t stop)\n    {\n        hipEventElapsedTime(&this->profiling_result, start, stop);\n    }\n\n    std::function<void(hipEvent_t, hipEvent_t)> elapsed_time_handler()\n    {\n        return std::bind(&HandleImpl::elapsed_time, this, std::placeholders::_1, std::placeholders::_2);\n    }\n\n    bool enable_profiling = false;\n    StreamPtr stream;\n    float profiling_result = 0.0;\n    KernelCache cache;\n};\n\nHandle::Handle (miopenAcceleratorQueue_t stream) \n: impl(new HandleImpl())\n{\n    if (stream == nullptr) this->impl->stream = HandleImpl::reference_stream(nullptr);\n    else this->impl->stream = HandleImpl::reference_stream(stream);\n}\n\nHandle::Handle ()\n: impl(new HandleImpl())\n{\n    set_default_device();\n    \/\/ this->impl->stream = impl->create_stream();\n    this->impl->stream = HandleImpl::reference_stream(nullptr);\n}\n\nHandle::~Handle() {}\n\nvoid Handle::SetStream(miopenAcceleratorQueue_t streamID) const\n{\n    this->impl->stream = HandleImpl::reference_stream(streamID);\n}\n\nmiopenAcceleratorQueue_t Handle::GetStream() const\n{\n    return impl->stream.get();\n}\n\nvoid Handle::EnableProfiling(bool enable)\n{\n    this->impl->enable_profiling = enable;\n}\n\nfloat Handle::GetKernelTime() const\n{\n    return this->impl->profiling_result;\n}\n\nstd::size_t GetAvailableMemory()\n{\n    size_t free, total;\n    auto status = hipMemGetInfo(&free, &total);\n    if (status != hipSuccess) MIOPEN_THROW_HIP_STATUS(status, \"Failed getting available memory\");\n    return free;\n}\n\nManageDataPtr Handle::Create(std::size_t sz)\n{\n    this->Finish();\n    if (sz > GetAvailableMemory()) MIOPEN_THROW(\"Memory not available to allocate buffer: \" + std::to_string(sz));\n    void * result;\n    auto status = hipMalloc(&result, sz);\n    if (status != hipSuccess)\n    {\n        status = hipHostMalloc(&result, sz);\n        if (status != hipSuccess) MIOPEN_THROW_HIP_STATUS(status, \"Hip error creating buffer \" + std::to_string(sz) + \": \");\n    }\n    return ManageDataPtr{result};\n}\nManageDataPtr& Handle::WriteTo(const void* data, ManageDataPtr& ddata, std::size_t sz)\n{\n    this->Finish();\n    auto status = hipMemcpy(ddata.get(), data, sz, hipMemcpyHostToDevice);\n    if (status != hipSuccess) MIOPEN_THROW_HIP_STATUS(status, \"Hip error writing to buffer: \");\n    return ddata;\n}\nvoid Handle::ReadTo(void* data, const ManageDataPtr& ddata, std::size_t sz)\n{\n    this->Finish();\n    auto status = hipMemcpy(data, ddata.get(), sz, hipMemcpyDeviceToHost);\n    if (status != hipSuccess) MIOPEN_THROW_HIP_STATUS(status, \"Hip error reading from buffer: \");\n}\n\nvoid Handle::Copy(ConstData_t src, Data_t dest, std::size_t size)\n{\n    auto status = hipMemcpy(dest, src, size, hipMemcpyDeviceToDevice);\n    if (status != hipSuccess) MIOPEN_THROW_HIP_STATUS(status, \"Hip error copying buffer: \");\n}\n\nKernelInvoke Handle::GetKernel(\n        const std::string& algorithm,\n        const std::string& network_config,\n        const std::string& program_name,\n        const std::string& kernel_name,\n        const std::vector<size_t>& vld,\n        const std::vector<size_t>& vgd,\n        const std::string& params)\n{\n    auto k = this->impl->cache.GetKernel(*this,\n            algorithm,\n            network_config,\n            program_name,\n            kernel_name,\n            vld,\n            vgd,\n            params);\n    if (this->impl->enable_profiling) return k.Invoke(this->GetStream(), this->impl->elapsed_time_handler());\n    else return k.Invoke(this->GetStream());\n}\n\nKernelInvoke Handle::GetKernel(\n    const std::string& algorithm,\n    const std::string& network_config)\n{\n    auto k = this->impl->cache.GetKernel(\n            algorithm,\n            network_config);\n    if (this->impl->enable_profiling) return k.Invoke(this->GetStream(), this->impl->elapsed_time_handler());\n    else return k.Invoke(this->GetStream());\n}\n\nProgram Handle::LoadProgram(const std::string &program_name, std::string params, bool is_kernel_str)\n{\n    params += \" -mcpu=\" + this->GetDeviceName();\n    return HIPOCProgram{program_name, params, is_kernel_str};\n}\n\nvoid Handle::Finish() const\n{\n#if MIOPEN_BUILD_DEV\n    auto start = std::chrono::system_clock::now();\n    auto ev = make_hip_event();\n    hipEventRecord(ev.get(), this->GetStream());\n    while(hipEventQuery(ev.get()) == hipErrorNotReady)\n    {\n        std::this_thread::yield();\n        if ((std::chrono::system_clock::now()-start) > std::chrono::seconds(60)) \n        {\n            std::cerr << \"Timeout: Handle::Finish\" << std::endl;\n            std::abort();\n        }\n    }\n#else\n    auto status = hipStreamSynchronize(this->GetStream());\n    if (status != hipSuccess) MIOPEN_THROW_HIP_STATUS(status, \"Failed hip sychronization\");\n#endif\n}\nvoid Handle::Flush() const\n{\n\n}\n\nbool Handle::IsProfilingEnabled() const\n{\n\treturn this->impl->enable_profiling;\n}\n\nvoid Handle::ResetKernelTime()\n{\n    this->impl->profiling_result = 0.0;\n}\nvoid Handle::AccumKernelTime(float x)\n{\n    this->impl->profiling_result += x;\n}\n\nstd::size_t Handle::GetLocalMemorySize()\n{\n    int result;\n    auto status = hipDeviceGetAttribute(&result, hipDeviceAttributeMaxSharedMemoryPerBlock, get_device_id());\n    if (status != hipSuccess) MIOPEN_THROW_HIP_STATUS(status);\n\n    return result;\n}\n\nstd::size_t Handle::GetMaxComputeUnits()\n{\n    int result;\n    auto status = hipDeviceGetAttribute(&result, hipDeviceAttributeMultiprocessorCount, get_device_id());\n    if (status != hipSuccess) MIOPEN_THROW_HIP_STATUS(status);\n\n    return result;\n}\n\nstd::string Handle::GetDeviceName()\n{\n    hipDeviceProp_t props;\n    hipGetDeviceProperties(&props, get_device_id());\n    std::string n(\"gfx\"+std::to_string(props.gcnArch));\n\treturn GetDeviceNameFromMap(n);\n}\n} \/\/ namespace miopen\n<commit_msg>Set device on hip stream<commit_after>#include <miopen\/handle.hpp>\n#include <miopen\/errors.hpp>\n#include <miopen\/device_name.hpp>\n#include <miopen\/kernel_cache.hpp>\n#include <algorithm>\n\n#ifndef _WIN32\n#include <unistd.h>\n#endif\n\n#include <cassert>\n#include <chrono>\n#include <thread>\n\nnamespace miopen {\n\nhipDevice_t get_device(int id)\n{\n    hipDevice_t device;\n    auto status = hipDeviceGet(&device, id);\n    if (status != hipSuccess) MIOPEN_THROW(\"No device\");\n    return device;\n}\n\nint get_device_id() \/\/ Get random device\n{\n    int device;\n    auto status = hipGetDevice(&device);\n    if (status != hipSuccess) MIOPEN_THROW(\"No device\");\n    return device;\n}\n\nvoid set_device(int id)\n{\n    auto status = hipSetDevice(id);\n    if (status != hipSuccess) MIOPEN_THROW(\"Error setting device\");\n}\n\nint set_default_device()\n{\n    int n;\n    auto status = hipGetDeviceCount(&n);\n    if (status != hipSuccess) MIOPEN_THROW(\"Error getting device count\");\n    \/\/ Pick device based on process id\n    auto pid = ::getpid();\n    assert(pid > 0);\n    set_device(pid % n);\n    return (pid % n);\n}\n\nstruct HandleImpl\n{\n    \/\/ typedef MIOPEN_MANAGE_PTR(hipStream_t, hipStreamDestroy) StreamPtr;\n    using StreamPtr = std::shared_ptr<typename std::remove_pointer<hipStream_t>::type>;\n\n    HandleImpl()\n    : device(get_device_id())\n    {}\n\n    StreamPtr create_stream()\n    {\n        hipStream_t result;\n        auto status = hipStreamCreate(&result);\n        if (status != hipSuccess) MIOPEN_THROW_HIP_STATUS(status, \"Failed to allocate stream\");\n        return StreamPtr{result, &hipStreamDestroy};\n    }\n\n    static StreamPtr reference_stream(hipStream_t s)\n    {\n        return StreamPtr{s, null_deleter{}};\n    }\n\n    void elapsed_time(hipEvent_t start, hipEvent_t stop)\n    {\n        hipEventElapsedTime(&this->profiling_result, start, stop);\n    }\n\n    std::function<void(hipEvent_t, hipEvent_t)> elapsed_time_handler()\n    {\n        return std::bind(&HandleImpl::elapsed_time, this, std::placeholders::_1, std::placeholders::_2);\n    }\n\n    void set_device() const\n    {\n        miopen::set_device(device);\n    }\n\n    bool enable_profiling = false;\n    StreamPtr stream = nullptr;\n    float profiling_result = 0.0;\n    KernelCache cache;\n    int device;\n};\n\nHandle::Handle (miopenAcceleratorQueue_t stream) \n: impl(new HandleImpl())\n{\n    if (stream == nullptr) this->impl->stream = HandleImpl::reference_stream(nullptr);\n    else this->impl->stream = HandleImpl::reference_stream(stream);\n}\n\nHandle::Handle ()\n: impl(new HandleImpl())\n{\n#if MIOPEN_BUILD_DEV\n    this->impl->device = set_default_device();\n    this->impl->stream = impl->create_stream();\n#else\n    this->impl->stream = HandleImpl::reference_stream(nullptr);\n#endif\n}\n\nHandle::~Handle() {}\n\nvoid Handle::SetStream(miopenAcceleratorQueue_t streamID) const\n{\n    this->impl->stream = HandleImpl::reference_stream(streamID);\n}\n\nmiopenAcceleratorQueue_t Handle::GetStream() const\n{\n    return impl->stream.get();\n}\n\nvoid Handle::EnableProfiling(bool enable)\n{\n    this->impl->enable_profiling = enable;\n}\n\nfloat Handle::GetKernelTime() const\n{\n    return this->impl->profiling_result;\n}\n\nstd::size_t GetAvailableMemory()\n{\n    size_t free, total;\n    auto status = hipMemGetInfo(&free, &total);\n    if (status != hipSuccess) MIOPEN_THROW_HIP_STATUS(status, \"Failed getting available memory\");\n    return free;\n}\n\nManageDataPtr Handle::Create(std::size_t sz)\n{\n    this->Finish();\n    if (sz > GetAvailableMemory()) MIOPEN_THROW(\"Memory not available to allocate buffer: \" + std::to_string(sz));\n    void * result;\n    auto status = hipMalloc(&result, sz);\n    if (status != hipSuccess)\n    {\n        status = hipHostMalloc(&result, sz);\n        if (status != hipSuccess) MIOPEN_THROW_HIP_STATUS(status, \"Hip error creating buffer \" + std::to_string(sz) + \": \");\n    }\n    return ManageDataPtr{result};\n}\nManageDataPtr& Handle::WriteTo(const void* data, ManageDataPtr& ddata, std::size_t sz)\n{\n    this->Finish();\n    auto status = hipMemcpy(ddata.get(), data, sz, hipMemcpyHostToDevice);\n    if (status != hipSuccess) MIOPEN_THROW_HIP_STATUS(status, \"Hip error writing to buffer: \");\n    return ddata;\n}\nvoid Handle::ReadTo(void* data, const ManageDataPtr& ddata, std::size_t sz)\n{\n    this->Finish();\n    auto status = hipMemcpy(data, ddata.get(), sz, hipMemcpyDeviceToHost);\n    if (status != hipSuccess) MIOPEN_THROW_HIP_STATUS(status, \"Hip error reading from buffer: \");\n}\n\nvoid Handle::Copy(ConstData_t src, Data_t dest, std::size_t size)\n{\n    this->impl->set_device();\n    auto status = hipMemcpy(dest, src, size, hipMemcpyDeviceToDevice);\n    if (status != hipSuccess) MIOPEN_THROW_HIP_STATUS(status, \"Hip error copying buffer: \");\n}\n\nKernelInvoke Handle::GetKernel(\n        const std::string& algorithm,\n        const std::string& network_config,\n        const std::string& program_name,\n        const std::string& kernel_name,\n        const std::vector<size_t>& vld,\n        const std::vector<size_t>& vgd,\n        const std::string& params)\n{\n    this->impl->set_device();\n    auto k = this->impl->cache.GetKernel(*this,\n            algorithm,\n            network_config,\n            program_name,\n            kernel_name,\n            vld,\n            vgd,\n            params);\n    if (this->impl->enable_profiling) return k.Invoke(this->GetStream(), this->impl->elapsed_time_handler());\n    else return k.Invoke(this->GetStream());\n}\n\nKernelInvoke Handle::GetKernel(\n    const std::string& algorithm,\n    const std::string& network_config)\n{\n    this->impl->set_device();\n    auto k = this->impl->cache.GetKernel(\n            algorithm,\n            network_config);\n    if (this->impl->enable_profiling) return k.Invoke(this->GetStream(), this->impl->elapsed_time_handler());\n    else return k.Invoke(this->GetStream());\n}\n\nProgram Handle::LoadProgram(const std::string &program_name, std::string params, bool is_kernel_str)\n{\n    this->impl->set_device();\n    params += \" -mcpu=\" + this->GetDeviceName();\n    return HIPOCProgram{program_name, params, is_kernel_str};\n}\n\nvoid Handle::Finish() const\n{\n    this->impl->set_device();\n#if MIOPEN_BUILD_DEV\n    auto start = std::chrono::system_clock::now();\n    auto ev = make_hip_event();\n    hipEventRecord(ev.get(), this->GetStream());\n    while(hipEventQuery(ev.get()) == hipErrorNotReady)\n    {\n        std::this_thread::yield();\n        if ((std::chrono::system_clock::now()-start) > std::chrono::seconds(60)) \n        {\n            std::cerr << \"Timeout: Handle::Finish\" << std::endl;\n            std::abort();\n        }\n    }\n#else\n    auto status = hipStreamSynchronize(this->GetStream());\n    if (status != hipSuccess) MIOPEN_THROW_HIP_STATUS(status, \"Failed hip sychronization\");\n#endif\n}\nvoid Handle::Flush() const\n{\n\n}\n\nbool Handle::IsProfilingEnabled() const\n{\n\treturn this->impl->enable_profiling;\n}\n\nvoid Handle::ResetKernelTime()\n{\n    this->impl->profiling_result = 0.0;\n}\nvoid Handle::AccumKernelTime(float x)\n{\n    this->impl->profiling_result += x;\n}\n\nstd::size_t Handle::GetLocalMemorySize()\n{\n    int result;\n    auto status = hipDeviceGetAttribute(&result, hipDeviceAttributeMaxSharedMemoryPerBlock, this->impl->device);\n    if (status != hipSuccess) MIOPEN_THROW_HIP_STATUS(status);\n\n    return result;\n}\n\nstd::size_t Handle::GetMaxComputeUnits()\n{\n    int result;\n    auto status = hipDeviceGetAttribute(&result, hipDeviceAttributeMultiprocessorCount, this->impl->device);\n    if (status != hipSuccess) MIOPEN_THROW_HIP_STATUS(status);\n\n    return result;\n}\n\nstd::string Handle::GetDeviceName()\n{\n    hipDeviceProp_t props;\n    hipGetDeviceProperties(&props, this->impl->device);\n    std::string n(\"gfx\"+std::to_string(props.gcnArch));\n\treturn GetDeviceNameFromMap(n);\n}\n} \/\/ namespace miopen\n<|endoftext|>"}
{"text":"<commit_before>#include    \"FTVectoriser.h\"\n#include    \"FTGL.h\"\n\n\n#ifndef CALLBACK\n#define CALLBACK\n#endif\n\n#ifdef __APPLE_CC__    \n    typedef GLvoid (*GLUTesselatorFunction)(...);\n#elif defined( __mips ) || defined( __linux__ )\n    typedef GLvoid (*GLUTesselatorFunction)();\n#elif defined ( WIN32)\n    typedef GLvoid (CALLBACK *GLUTesselatorFunction)( );\n#else\n    #error \"Error - need to define type GLUTesselatorFunction for this platform\/compiler\"\n#endif\n    \n\nvoid CALLBACK ftglError( GLenum errCode, FTMesh* mesh)\n{\n    mesh->Error( errCode);\n}\n\n\nvoid CALLBACK ftglVertex( void* data, FTMesh* mesh)\n{\n    FTGL_DOUBLE* vertex = static_cast<FTGL_DOUBLE*>(data);\n    mesh->AddPoint( vertex[0], vertex[1], vertex[2]);\n}\n\n\nvoid CALLBACK ftglCombine( FTGL_DOUBLE coords[3], void* vertex_data[4], GLfloat weight[4], void** outData, FTMesh* mesh)\n{\n    FTGL_DOUBLE* vertex = static_cast<FTGL_DOUBLE*>(coords);\n    *outData = mesh->Combine( vertex[0], vertex[1], vertex[2]);\n}\n        \n\nvoid CALLBACK ftglBegin( GLenum type, FTMesh* mesh)\n{\n    mesh->Begin( type);\n}\n\n\nvoid CALLBACK ftglEnd( FTMesh* mesh)\n{\n    mesh->End();\n}\n\n\nFTMesh::FTMesh()\n:\tcurrentTesselation(0),\n    err(0)\n{\n    tesselationList.reserve( 16);\n}\n\n\nFTMesh::~FTMesh()\n{\n    for( size_t t = 0; t < tesselationList.size(); ++t)\n    {\n        delete tesselationList[t];\n    }\n    tesselationList.clear();\n}\n\n\nvoid FTMesh::AddPoint( const FTGL_DOUBLE x, const FTGL_DOUBLE y, const FTGL_DOUBLE z)\n{\n    currentTesselation->AddPoint( x, y, z);\n}\n\n\nFTGL_DOUBLE* FTMesh::Combine( const FTGL_DOUBLE x, const FTGL_DOUBLE y, const FTGL_DOUBLE z)\n{\n    tempPointList.push_back( FTPoint( x, y,z));\n    return &tempPointList.back().x;\n}\n\n\nvoid FTMesh::Begin( GLenum meshType)\n{\n    currentTesselation = new FTTesselation( meshType);\n}\n\n\nvoid FTMesh::End()\n{\n    tesselationList.push_back( currentTesselation);\n}\n\n\nconst FTTesselation* const FTMesh::Tesselation( unsigned int index) const\n{\n    return ( index < tesselationList.size()) ? tesselationList[index] : NULL;\n}\n\n\nFTVectoriser::FTVectoriser( const FT_Glyph glyph)\n:   contourList(0),\n    mesh(0),\n    ftContourCount(0),\n    contourFlag(0)\n{\n    if( glyph)\n    {\n        FT_OutlineGlyph outline = (FT_OutlineGlyph)glyph;\n        ftOutline = outline->outline;\n        \n        ftContourCount = ftOutline.n_contours;;\n        contourList = 0;\n        contourFlag = ftOutline.flags;\n        \n        ProcessContours();\n    }\n}\n\n\nFTVectoriser::~FTVectoriser()\n{\n    for( size_t c = 0; c < ContourCount(); ++c)\n    {\n        delete contourList[c];\n    }\n\n    delete [] contourList;\n    \n    delete mesh;\n}\n\n\nvoid FTVectoriser::ProcessContours()\n{\n    short contourLength = 0;\n    short startIndex = 0;\n    short endIndex = 0;\n    \n    contourList = new (FTContour*)[ftContourCount];\n    \n    for( short contourIndex = 0; contourIndex < ftContourCount; ++contourIndex)\n    {\n        FT_Vector* pointList = &ftOutline.points[startIndex];\n        char* tagList = &ftOutline.tags[startIndex];\n        \n        endIndex = ftOutline.contours[contourIndex];\n        contourLength =  ( endIndex - startIndex) + 1;\n\n        FTContour* contour = new FTContour( pointList, tagList, contourLength);\n        \n        contourList[contourIndex] = contour;\n        \n        startIndex = endIndex + 1;\n    }\n}\n\n\nsize_t FTVectoriser::PointCount()\n{\n    size_t s = 0;\n    for( size_t c = 0; c < ContourCount(); ++c)\n    {\n        s += contourList[c]->PointCount();\n    }\n    \n    return s;\n}\n\n\nconst FTContour* const FTVectoriser::Contour( unsigned int index) const\n{\n    return ( index < ContourCount()) ? contourList[index] : NULL;\n}\n\n\nvoid FTVectoriser::MakeMesh( FTGL_DOUBLE zNormal)\n{\n    if( mesh)\n    {\n        delete mesh;\n    }\n        \n    mesh = new FTMesh;\n    \n    GLUtesselator* tobj = gluNewTess();\n\n    gluTessCallback( tobj, GLU_TESS_BEGIN_DATA,     (GLUTesselatorFunction)ftglBegin);\n    gluTessCallback( tobj, GLU_TESS_VERTEX_DATA,    (GLUTesselatorFunction)ftglVertex);\n    gluTessCallback( tobj, GLU_TESS_COMBINE_DATA,   (GLUTesselatorFunction)ftglCombine);\n    gluTessCallback( tobj, GLU_TESS_END_DATA,       (GLUTesselatorFunction)ftglEnd);\n    gluTessCallback( tobj, GLU_TESS_ERROR_DATA,     (GLUTesselatorFunction)ftglError);\n    \n    if( contourFlag & ft_outline_even_odd_fill) \/\/ ft_outline_reverse_fill\n    {\n        gluTessProperty( tobj, GLU_TESS_WINDING_RULE, GLU_TESS_WINDING_ODD);\n    }\n    else\n    {\n        gluTessProperty( tobj, GLU_TESS_WINDING_RULE, GLU_TESS_WINDING_NONZERO);\n    }\n    \n    \n    gluTessProperty( tobj, GLU_TESS_TOLERANCE, 0);\n    gluTessNormal( tobj, 0.0f, 0.0f, zNormal);\n    gluTessBeginPolygon( tobj, mesh);\n    \n        for( size_t c = 0; c < ContourCount(); ++c)\n        {\n            const FTContour* contour = contourList[c];\n\n            gluTessBeginContour( tobj);\n            \n                for( size_t p = 0; p < contour->PointCount(); ++p)\n                {\n                    FTGL_DOUBLE* d = const_cast<FTGL_DOUBLE*>(&contour->Point(p).x);\n                    gluTessVertex( tobj, d, d);\n                }\n\n            gluTessEndContour( tobj);\n        }\n        \n    gluTessEndPolygon( tobj);\n\n    gluDeleteTess( tobj);\n}\n\n<commit_msg>The parser in the IRIX C++ compiler has a bug and the result of:<commit_after>#include    \"FTVectoriser.h\"\n#include    \"FTGL.h\"\n\n\n#ifndef CALLBACK\n#define CALLBACK\n#endif\n\n#ifdef __APPLE_CC__    \n    typedef GLvoid (*GLUTesselatorFunction)(...);\n#elif defined( __mips ) || defined( __linux__ )\n    typedef GLvoid (*GLUTesselatorFunction)();\n#elif defined ( WIN32)\n    typedef GLvoid (CALLBACK *GLUTesselatorFunction)( );\n#else\n    #error \"Error - need to define type GLUTesselatorFunction for this platform\/compiler\"\n#endif\n    \n\nvoid CALLBACK ftglError( GLenum errCode, FTMesh* mesh)\n{\n    mesh->Error( errCode);\n}\n\n\nvoid CALLBACK ftglVertex( void* data, FTMesh* mesh)\n{\n    FTGL_DOUBLE* vertex = static_cast<FTGL_DOUBLE*>(data);\n    mesh->AddPoint( vertex[0], vertex[1], vertex[2]);\n}\n\n\nvoid CALLBACK ftglCombine( FTGL_DOUBLE coords[3], void* vertex_data[4], GLfloat weight[4], void** outData, FTMesh* mesh)\n{\n    FTGL_DOUBLE* vertex = static_cast<FTGL_DOUBLE*>(coords);\n    *outData = mesh->Combine( vertex[0], vertex[1], vertex[2]);\n}\n        \n\nvoid CALLBACK ftglBegin( GLenum type, FTMesh* mesh)\n{\n    mesh->Begin( type);\n}\n\n\nvoid CALLBACK ftglEnd( FTMesh* mesh)\n{\n    mesh->End();\n}\n\n\nFTMesh::FTMesh()\n:\tcurrentTesselation(0),\n    err(0)\n{\n    tesselationList.reserve( 16);\n}\n\n\nFTMesh::~FTMesh()\n{\n    for( size_t t = 0; t < tesselationList.size(); ++t)\n    {\n        delete tesselationList[t];\n    }\n    tesselationList.clear();\n}\n\n\nvoid FTMesh::AddPoint( const FTGL_DOUBLE x, const FTGL_DOUBLE y, const FTGL_DOUBLE z)\n{\n    currentTesselation->AddPoint( x, y, z);\n}\n\n\nFTGL_DOUBLE* FTMesh::Combine( const FTGL_DOUBLE x, const FTGL_DOUBLE y, const FTGL_DOUBLE z)\n{\n    tempPointList.push_back( FTPoint( x, y,z));\n    return &tempPointList.back().x;\n}\n\n\nvoid FTMesh::Begin( GLenum meshType)\n{\n    currentTesselation = new FTTesselation( meshType);\n}\n\n\nvoid FTMesh::End()\n{\n    tesselationList.push_back( currentTesselation);\n}\n\n\nconst FTTesselation* const FTMesh::Tesselation( unsigned int index) const\n{\n    return ( index < tesselationList.size()) ? tesselationList[index] : NULL;\n}\n\n\nFTVectoriser::FTVectoriser( const FT_Glyph glyph)\n:   contourList(0),\n    mesh(0),\n    ftContourCount(0),\n    contourFlag(0)\n{\n    if( glyph)\n    {\n        FT_OutlineGlyph outline = (FT_OutlineGlyph)glyph;\n        ftOutline = outline->outline;\n        \n        ftContourCount = ftOutline.n_contours;;\n        contourList = 0;\n        contourFlag = ftOutline.flags;\n        \n        ProcessContours();\n    }\n}\n\n\nFTVectoriser::~FTVectoriser()\n{\n    for( size_t c = 0; c < ContourCount(); ++c)\n    {\n        delete contourList[c];\n    }\n\n    delete [] contourList;\n    \n    delete mesh;\n}\n\n\nvoid FTVectoriser::ProcessContours()\n{\n    short contourLength = 0;\n    short startIndex = 0;\n    short endIndex = 0;\n    \n    typedef FTContour* FTContourP;\n    contourList = new FTContourP[ftContourCount];\n    \n    for( short contourIndex = 0; contourIndex < ftContourCount; ++contourIndex)\n    {\n        FT_Vector* pointList = &ftOutline.points[startIndex];\n        char* tagList = &ftOutline.tags[startIndex];\n        \n        endIndex = ftOutline.contours[contourIndex];\n        contourLength =  ( endIndex - startIndex) + 1;\n\n        FTContour* contour = new FTContour( pointList, tagList, contourLength);\n        \n        contourList[contourIndex] = contour;\n        \n        startIndex = endIndex + 1;\n    }\n}\n\n\nsize_t FTVectoriser::PointCount()\n{\n    size_t s = 0;\n    for( size_t c = 0; c < ContourCount(); ++c)\n    {\n        s += contourList[c]->PointCount();\n    }\n    \n    return s;\n}\n\n\nconst FTContour* const FTVectoriser::Contour( unsigned int index) const\n{\n    return ( index < ContourCount()) ? contourList[index] : NULL;\n}\n\n\nvoid FTVectoriser::MakeMesh( FTGL_DOUBLE zNormal)\n{\n    if( mesh)\n    {\n        delete mesh;\n    }\n        \n    mesh = new FTMesh;\n    \n    GLUtesselator* tobj = gluNewTess();\n\n    gluTessCallback( tobj, GLU_TESS_BEGIN_DATA,     (GLUTesselatorFunction)ftglBegin);\n    gluTessCallback( tobj, GLU_TESS_VERTEX_DATA,    (GLUTesselatorFunction)ftglVertex);\n    gluTessCallback( tobj, GLU_TESS_COMBINE_DATA,   (GLUTesselatorFunction)ftglCombine);\n    gluTessCallback( tobj, GLU_TESS_END_DATA,       (GLUTesselatorFunction)ftglEnd);\n    gluTessCallback( tobj, GLU_TESS_ERROR_DATA,     (GLUTesselatorFunction)ftglError);\n    \n    if( contourFlag & ft_outline_even_odd_fill) \/\/ ft_outline_reverse_fill\n    {\n        gluTessProperty( tobj, GLU_TESS_WINDING_RULE, GLU_TESS_WINDING_ODD);\n    }\n    else\n    {\n        gluTessProperty( tobj, GLU_TESS_WINDING_RULE, GLU_TESS_WINDING_NONZERO);\n    }\n    \n    \n    gluTessProperty( tobj, GLU_TESS_TOLERANCE, 0);\n    gluTessNormal( tobj, 0.0f, 0.0f, zNormal);\n    gluTessBeginPolygon( tobj, mesh);\n    \n        for( size_t c = 0; c < ContourCount(); ++c)\n        {\n            const FTContour* contour = contourList[c];\n\n            gluTessBeginContour( tobj);\n            \n                for( size_t p = 0; p < contour->PointCount(); ++p)\n                {\n                    FTGL_DOUBLE* d = const_cast<FTGL_DOUBLE*>(&contour->Point(p).x);\n                    gluTessVertex( tobj, d, d);\n                }\n\n            gluTessEndContour( tobj);\n        }\n        \n    gluTessEndPolygon( tobj);\n\n    gluDeleteTess( tobj);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ FbWindow.hh for FbTk - fluxbox toolkit\n\/\/ Copyright (c) 2002 - 2005 Henrik Kinnunen (fluxgen at fluxbox dot org)\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a\n\/\/ copy of this software and associated documentation files (the \"Software\"),\n\/\/ to deal in the Software without restriction, including without limitation\n\/\/ the rights to use, copy, modify, merge, publish, distribute, sublicense,\n\/\/ and\/or sell copies of the Software, and to permit persons to whom the\n\/\/ Software is furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n\/\/ THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n\/\/ FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n\/\/ DEALINGS IN THE SOFTWARE.\n\n\/\/ $Id$\n\n#ifndef FBTK_FBWINDOW_HH\n#define FBTK_FBWINDOW_HH\n\n#include \"FbDrawable.hh\"\n\n#include <X11\/Xlib.h>\n#include <memory>\n#include <string>\n\nnamespace FbTk {\n\nclass Color;\nclass Transparent;\nclass FbPixmap;\nclass FbWindowRenderer;\n\n\/\/\/   Wrapper for X window\n\/**\n * Example:\n * FbWindow window(0, 10, 10, 100, 100, ExposeMask | ButtonPressMask); \\n\n * this will create a window on screen 0, position 10 10, size 100 100 \\n\n * and with eventmask Expose and ButtonPress. \\n\n * You need to register it to some eventhandler so you can catch events: \\n\n * EventManager::instance()->add(your_eventhandler, window); \\n\n * @see EventHandler\n * @see EventManager\n *\/\nclass FbWindow: public FbDrawable {\npublic:\n    FbWindow();\n\n    FbWindow(const FbWindow &win_copy);\n\n    FbWindow(int screen_num,\n             int x, int y, unsigned int width, unsigned int height, long eventmask, \n             bool overrride_redirect = false,\n             bool save_unders = false,\n             int depth = CopyFromParent, \n             int class_type = InputOutput);\n\n    FbWindow(const FbWindow &parent,\n             int x, int y, \n             unsigned int width, unsigned int height, \n             long eventmask, \n             bool overrride_redirect = false,\n             bool save_unders = false,\n             int depth = CopyFromParent, \n             int class_type = InputOutput);\n\n    virtual ~FbWindow();\n    virtual void setBackgroundColor(const FbTk::Color &bg_color);\n    virtual void setBackgroundPixmap(Pixmap bg_pixmap);\n    virtual void setBorderColor(const FbTk::Color &border_color);\n    virtual void setBorderWidth(unsigned int size);\n    \/\/\/ set window name (\"title\")\n    void setName(const char *name);\n    void setEventMask(long mask);\n    \/\/\/ clear window with background pixmap or color\n    virtual void clear();\n    \/\/\/ @param exposures wheter Expose event should be generated\n    virtual void clearArea(int x, int y, \n                           unsigned int width, unsigned int height, \n                           bool exposures = false);\n    void updateTransparent(int x = -1, int y = -1, unsigned int width = 0, unsigned int height = 0, Pixmap dest_override = None, bool override_is_offset = false);\n\n    void setAlpha(unsigned char alpha);\n\n    virtual FbWindow &operator = (const FbWindow &win);\n    \/\/\/ assign a new X window to this\n    virtual FbWindow &operator = (Window win);    \n    virtual void hide();\n    virtual void show();\n    virtual void showSubwindows();\n\n    \/\/\/ Notify that the parent window was moved,\n    \/\/\/ thus the absolute position of this one moved\n    virtual inline void parentMoved() {\n        updateBackground(true);\n    }\n\n    virtual inline void move(int x, int y) {\n        if (x == m_x && y == m_y)\n            return;\n        XMoveWindow(s_display, m_window, x, y);\n        m_x = x;\n        m_y = y;\n        updateBackground(true);\n    }\n\n    virtual inline void resize(unsigned int width, unsigned int height) {\n        if (width == m_width && height == m_height)\n            return;\n        XResizeWindow(s_display, m_window, width, height);\n        m_width = width;\n        m_height = height;\n        updateBackground(false);\n    }\n\n    virtual inline void moveResize(int x, int y, unsigned int width, unsigned int height) {\n        if (x == m_x && y == m_y && width == m_width && height == m_height)\n            return;\n        XMoveResizeWindow(s_display, m_window, x, y, width, height);\n        m_x = x;\n        m_y = y;\n        m_width = width;\n        m_height = height;\n        updateBackground(false);\n\n    }\n    virtual void lower();\n    virtual void raise();\n    void setInputFocus(int revert_to, int time);\n    \/\/\/ defines a cursor for this window\n    void setCursor(Cursor cur);\n    \/\/\/ uses the parents cursor instead\n    void unsetCursor();\n    void reparent(const FbWindow &parent, int x, int y, bool continuing = true);\n\n    bool property(Atom property,\n                  long long_offset, long long_length,\n                  bool do_delete,\n                  Atom req_type,\n                  Atom *actual_type_return,\n                  int *actual_format_return,\n                  unsigned long *nitems_return,\n                  unsigned long *bytes_after_return,\n                  unsigned char **prop_return) const;\n\n    void changeProperty(Atom property, Atom type,\n                        int format,\n                        int mode,\n                        unsigned char *data,\n                        int nelements);\n\n    void deleteProperty(Atom property);\n\n    std::string textProperty(Atom property) const;\n\n    \/\/\/ @return parent FbWindow\n    const FbWindow *parent() const { return m_parent; }\n    \/\/\/ @return real X window\n    inline Window window() const { return m_window; }\n    \/\/\/ @return drawable (the X window)\n    inline Drawable drawable() const { return window(); }\n    inline int x() const { return m_x; }\n    inline int y() const { return m_y; }\n    inline unsigned int width() const { return m_width; }\n    inline unsigned int height() const { return m_height; }\n    inline unsigned int borderWidth() const { return m_border_width; }\n    inline int depth() const { return m_depth; }\n    unsigned char alpha() const;\n    int screenNumber() const;\n    long eventMask() const;\n    \/\/\/ compare X window\n    inline bool operator == (Window win) const { return m_window == win; }\t\n    inline bool operator != (Window win) const { return m_window != win; }\n    \/\/\/ compare two windows\n    inline bool operator == (const FbWindow &win) const { return m_window == win.m_window; }\n    inline bool operator != (const FbWindow &win) const { return m_window != win.m_window; }\n\n    \/\/ used for composite\n    void setOpaque(unsigned char alpha);\n\n    void setRenderer(FbWindowRenderer &renderer) { m_renderer = &renderer; }\n    void sendConfigureNotify(int x, int y, unsigned int width, unsigned int height);\n\n    \/\/\/ forces full background change, recalcing of alpha values if necessary\n    void updateBackground(bool only_if_alpha);\n\nprotected:\n    \/\/\/ creates a window with x window client (m_window = client)\n    explicit FbWindow(Window client);\n\n    \/\/\/ updates x,y, width, height and screen num from X window\n    void updateGeometry();\nprivate:\n    \/\/\/ sets new X window and destroys old\n    void setNew(Window win);\n    \/\/\/ creates a new X window\n    void create(Window parent, int x, int y, unsigned int width, unsigned int height,\n                long eventmask, \n                bool override_redirect, \n                bool save_unders,\n                int depth, \n                int class_type);\n\n    const FbWindow *m_parent; \/\/\/< parent FbWindow\n    int m_screen_num;  \/\/\/< screen num on which this window exist\n    mutable Window m_window; \/\/\/< the X window\n    int m_x, m_y; \/\/\/< position of window\n    unsigned int m_width, m_height;  \/\/\/< size of window\n    unsigned int m_border_width; \/\/\/< border size\n    int m_depth; \/\/\/< bit depth\n    bool m_destroy; \/\/\/< wheter the x window was created before\n    std::auto_ptr<FbTk::Transparent> m_transparent;\n    bool m_lastbg_color_set;\n    unsigned long m_lastbg_color;\n    Pixmap m_lastbg_pm;\n\n    FbWindowRenderer *m_renderer;\n};\n\nbool operator == (Window win, const FbWindow &fbwin);\n\n\/\/\/ helper class for some STL routines\nclass ChangeProperty {\npublic:\n    ChangeProperty(Display *disp, Atom prop, int mode,\n                   unsigned char *state, int num):m_disp(disp),\n                                                  m_prop(prop), m_state(state), m_num(num), m_mode(mode){\n        \n    }\n    void operator () (FbTk::FbWindow *win) {\n        XChangeProperty(m_disp, win->window(), m_prop, m_prop, 32, m_mode,\n                        m_state, m_num);\n    }\nprivate:\n    Display *m_disp;\n    Atom m_prop;\n    unsigned char *m_state;\n    int m_num;\n    int m_mode;\n};\n\n\/\/\/ Interface class to render FbWindow foregrounds.\nclass FbWindowRenderer {\npublic:\n    virtual void renderForeground(FbWindow &win, FbDrawable &drawable) = 0;\n};\n\n\n} \/\/ end namespace FbTk\n\n#endif \/\/ FBTK_FBWINDOW_HH\n<commit_msg>display accessor<commit_after>\/\/ FbWindow.hh for FbTk - fluxbox toolkit\n\/\/ Copyright (c) 2002 - 2005 Henrik Kinnunen (fluxgen at fluxbox dot org)\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a\n\/\/ copy of this software and associated documentation files (the \"Software\"),\n\/\/ to deal in the Software without restriction, including without limitation\n\/\/ the rights to use, copy, modify, merge, publish, distribute, sublicense,\n\/\/ and\/or sell copies of the Software, and to permit persons to whom the\n\/\/ Software is furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n\/\/ THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n\/\/ FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n\/\/ DEALINGS IN THE SOFTWARE.\n\n\/\/ $Id$\n\n#ifndef FBTK_FBWINDOW_HH\n#define FBTK_FBWINDOW_HH\n\n#include \"FbDrawable.hh\"\n\n#include <X11\/Xlib.h>\n#include <memory>\n#include <string>\n\nnamespace FbTk {\n\nclass Color;\nclass Transparent;\nclass FbPixmap;\nclass FbWindowRenderer;\n\n\/\/\/   Wrapper for X window\n\/**\n * Example:\n * FbWindow window(0, 10, 10, 100, 100, ExposeMask | ButtonPressMask); \\n\n * this will create a window on screen 0, position 10 10, size 100 100 \\n\n * and with eventmask Expose and ButtonPress. \\n\n * You need to register it to some eventhandler so you can catch events: \\n\n * EventManager::instance()->add(your_eventhandler, window); \\n\n * @see EventHandler\n * @see EventManager\n *\/\nclass FbWindow: public FbDrawable {\npublic:\n    FbWindow();\n\n    FbWindow(const FbWindow &win_copy);\n\n    FbWindow(int screen_num,\n             int x, int y, unsigned int width, unsigned int height, long eventmask, \n             bool overrride_redirect = false,\n             bool save_unders = false,\n             int depth = CopyFromParent, \n             int class_type = InputOutput);\n\n    FbWindow(const FbWindow &parent,\n             int x, int y, \n             unsigned int width, unsigned int height, \n             long eventmask, \n             bool overrride_redirect = false,\n             bool save_unders = false,\n             int depth = CopyFromParent, \n             int class_type = InputOutput);\n\n    virtual ~FbWindow();\n    virtual void setBackgroundColor(const FbTk::Color &bg_color);\n    virtual void setBackgroundPixmap(Pixmap bg_pixmap);\n    virtual void setBorderColor(const FbTk::Color &border_color);\n    virtual void setBorderWidth(unsigned int size);\n    \/\/\/ set window name (\"title\")\n    void setName(const char *name);\n    void setEventMask(long mask);\n    \/\/\/ clear window with background pixmap or color\n    virtual void clear();\n    \/\/\/ @param exposures wheter Expose event should be generated\n    virtual void clearArea(int x, int y, \n                           unsigned int width, unsigned int height, \n                           bool exposures = false);\n    void updateTransparent(int x = -1, int y = -1, unsigned int width = 0, unsigned int height = 0, Pixmap dest_override = None, bool override_is_offset = false);\n\n    void setAlpha(unsigned char alpha);\n\n    virtual FbWindow &operator = (const FbWindow &win);\n    \/\/\/ assign a new X window to this\n    virtual FbWindow &operator = (Window win);    \n    virtual void hide();\n    virtual void show();\n    virtual void showSubwindows();\n\n    \/\/\/ Notify that the parent window was moved,\n    \/\/\/ thus the absolute position of this one moved\n    virtual inline void parentMoved() {\n        updateBackground(true);\n    }\n\n    virtual inline void move(int x, int y) {\n        if (x == m_x && y == m_y)\n            return;\n        XMoveWindow(s_display, m_window, x, y);\n        m_x = x;\n        m_y = y;\n        updateBackground(true);\n    }\n\n    virtual inline void resize(unsigned int width, unsigned int height) {\n        if (width == m_width && height == m_height)\n            return;\n        XResizeWindow(s_display, m_window, width, height);\n        m_width = width;\n        m_height = height;\n        updateBackground(false);\n    }\n\n    virtual inline void moveResize(int x, int y, unsigned int width, unsigned int height) {\n        if (x == m_x && y == m_y && width == m_width && height == m_height)\n            return;\n        XMoveResizeWindow(s_display, m_window, x, y, width, height);\n        m_x = x;\n        m_y = y;\n        m_width = width;\n        m_height = height;\n        updateBackground(false);\n\n    }\n    virtual void lower();\n    virtual void raise();\n    void setInputFocus(int revert_to, int time);\n    \/\/\/ defines a cursor for this window\n    void setCursor(Cursor cur);\n    \/\/\/ uses the parents cursor instead\n    void unsetCursor();\n    void reparent(const FbWindow &parent, int x, int y, bool continuing = true);\n\n    bool property(Atom property,\n                  long long_offset, long long_length,\n                  bool do_delete,\n                  Atom req_type,\n                  Atom *actual_type_return,\n                  int *actual_format_return,\n                  unsigned long *nitems_return,\n                  unsigned long *bytes_after_return,\n                  unsigned char **prop_return) const;\n\n    void changeProperty(Atom property, Atom type,\n                        int format,\n                        int mode,\n                        unsigned char *data,\n                        int nelements);\n\n    void deleteProperty(Atom property);\n\n    std::string textProperty(Atom property) const;\n\n    \/\/\/ @return parent FbWindow\n    const FbWindow *parent() const { return m_parent; }\n    \/\/\/ @return real X window\n    inline Window window() const { return m_window; }\n    \/\/\/ @return drawable (the X window)\n    inline Drawable drawable() const { return window(); }\n    inline int x() const { return m_x; }\n    inline int y() const { return m_y; }\n    inline unsigned int width() const { return m_width; }\n    inline unsigned int height() const { return m_height; }\n    inline unsigned int borderWidth() const { return m_border_width; }\n    inline int depth() const { return m_depth; }\n    unsigned char alpha() const;\n    int screenNumber() const;\n    long eventMask() const;\n    Display *display() const { return s_display; }\n\n    \/\/\/ compare X window\n    inline bool operator == (Window win) const { return m_window == win; }\t\n    inline bool operator != (Window win) const { return m_window != win; }\n    \/\/\/ compare two windows\n    inline bool operator == (const FbWindow &win) const { return m_window == win.m_window; }\n    inline bool operator != (const FbWindow &win) const { return m_window != win.m_window; }\n\n    \/\/ used for composite\n    void setOpaque(unsigned char alpha);\n\n    void setRenderer(FbWindowRenderer &renderer) { m_renderer = &renderer; }\n    void sendConfigureNotify(int x, int y, unsigned int width, unsigned int height);\n\n    \/\/\/ forces full background change, recalcing of alpha values if necessary\n    void updateBackground(bool only_if_alpha);\n\nprotected:\n    \/\/\/ creates a window with x window client (m_window = client)\n    explicit FbWindow(Window client);\n\n    \/\/\/ updates x,y, width, height and screen num from X window\n    void updateGeometry();\nprivate:\n    \/\/\/ sets new X window and destroys old\n    void setNew(Window win);\n    \/\/\/ creates a new X window\n    void create(Window parent, int x, int y, unsigned int width, unsigned int height,\n                long eventmask, \n                bool override_redirect, \n                bool save_unders,\n                int depth, \n                int class_type);\n\n    const FbWindow *m_parent; \/\/\/< parent FbWindow\n    int m_screen_num;  \/\/\/< screen num on which this window exist\n    mutable Window m_window; \/\/\/< the X window\n    int m_x, m_y; \/\/\/< position of window\n    unsigned int m_width, m_height;  \/\/\/< size of window\n    unsigned int m_border_width; \/\/\/< border size\n    int m_depth; \/\/\/< bit depth\n    bool m_destroy; \/\/\/< wheter the x window was created before\n    std::auto_ptr<FbTk::Transparent> m_transparent;\n    bool m_lastbg_color_set;\n    unsigned long m_lastbg_color;\n    Pixmap m_lastbg_pm;\n\n    FbWindowRenderer *m_renderer;\n};\n\nbool operator == (Window win, const FbWindow &fbwin);\n\n\/\/\/ helper class for some STL routines\nclass ChangeProperty {\npublic:\n    ChangeProperty(Display *disp, Atom prop, int mode,\n                   unsigned char *state, int num):m_disp(disp),\n                                                  m_prop(prop), m_state(state), m_num(num), m_mode(mode){\n        \n    }\n    void operator () (FbTk::FbWindow *win) {\n        XChangeProperty(m_disp, win->window(), m_prop, m_prop, 32, m_mode,\n                        m_state, m_num);\n    }\nprivate:\n    Display *m_disp;\n    Atom m_prop;\n    unsigned char *m_state;\n    int m_num;\n    int m_mode;\n};\n\n\/\/\/ Interface class to render FbWindow foregrounds.\nclass FbWindowRenderer {\npublic:\n    virtual void renderForeground(FbWindow &win, FbDrawable &drawable) = 0;\n};\n\n\n} \/\/ end namespace FbTk\n\n#endif \/\/ FBTK_FBWINDOW_HH\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2014 Toggl Desktop developers.\n\n#include \".\/errorviewcontroller.h\"\n#include \".\/ui_errorviewcontroller.h\"\n#include \".\/toggl.h\"\n#include \".\/bugsnag.h\"\n\nErrorViewController::ErrorViewController(QWidget *parent)\n    : QWidget(parent)\n, ui(new Ui::ErrorViewController)\n, networkError(false)\n, loginError(false)\n, uid(0) {\n    ui->setupUi(this);\n    setVisible(false);\n\n    connect(TogglApi::instance, SIGNAL(displayError(QString,bool)),  \/\/ NOLINT\n            this, SLOT(displayError(QString,bool)));  \/\/ NOLINT\n\n    connect(TogglApi::instance, SIGNAL(displayOnlineState(bool,QString)),  \/\/ NOLINT\n            this, SLOT(displayOnlineState(bool,QString)));  \/\/ NOLINT\n\n    connect(TogglApi::instance, SIGNAL(displayLogin(bool,uint64_t)),  \/\/ NOLINT\n            this, SLOT(displayLogin(bool,uint64_t)));  \/\/ NOLINT\n}\n\nErrorViewController::~ErrorViewController() {\n    delete ui;\n}\n\nvoid ErrorViewController::on_pushButton_clicked() {\n    setVisible(false);\n}\n\nvoid ErrorViewController::displayError(\n    const QString errmsg,\n    const bool user_error) {\n    networkError = false;\n    loginError = !uid;\n    ui->errorMessage->setText(errmsg);\n    setVisible(true);\n    if (!user_error) {\n        Bugsnag().notify(\"error in shared lib\", errmsg, \"ErrorViewController\");\n    }\n}\n\nvoid ErrorViewController::displayOnlineState(\n    const bool is_online,\n    const QString reason) {\n    if (!is_online && !reason.isEmpty()) {\n        networkError = true;\n        ui->errorMessage->setText(reason);\n        setVisible(true);\n    } else if (is_online && networkError) {\n        setVisible(false);\n    }\n}\n\nvoid ErrorViewController::displayLogin(\n    const bool open,\n    const uint64_t user_id) {\n    uid = user_id;\n    Bugsnag::user.id = QString::number(user_id);\n    if (user_id && isVisible() && loginError) {\n        loginError = false;\n        setVisible(false);\n    }\n}\n<commit_msg>Use static Bugsnag::notify (linux)<commit_after>\/\/ Copyright 2014 Toggl Desktop developers.\n\n#include \".\/errorviewcontroller.h\"\n#include \".\/ui_errorviewcontroller.h\"\n#include \".\/toggl.h\"\n#include \".\/bugsnag.h\"\n\nErrorViewController::ErrorViewController(QWidget *parent)\n    : QWidget(parent)\n, ui(new Ui::ErrorViewController)\n, networkError(false)\n, loginError(false)\n, uid(0) {\n    ui->setupUi(this);\n    setVisible(false);\n\n    connect(TogglApi::instance, SIGNAL(displayError(QString,bool)),  \/\/ NOLINT\n            this, SLOT(displayError(QString,bool)));  \/\/ NOLINT\n\n    connect(TogglApi::instance, SIGNAL(displayOnlineState(bool,QString)),  \/\/ NOLINT\n            this, SLOT(displayOnlineState(bool,QString)));  \/\/ NOLINT\n\n    connect(TogglApi::instance, SIGNAL(displayLogin(bool,uint64_t)),  \/\/ NOLINT\n            this, SLOT(displayLogin(bool,uint64_t)));  \/\/ NOLINT\n}\n\nErrorViewController::~ErrorViewController() {\n    delete ui;\n}\n\nvoid ErrorViewController::on_pushButton_clicked() {\n    setVisible(false);\n}\n\nvoid ErrorViewController::displayError(\n    const QString errmsg,\n    const bool user_error) {\n    networkError = false;\n    loginError = !uid;\n    ui->errorMessage->setText(errmsg);\n    setVisible(true);\n    if (!user_error) {\n        Bugsnag::notify(\"error in shared lib\", errmsg, \"ErrorViewController\");\n    }\n}\n\nvoid ErrorViewController::displayOnlineState(\n    const bool is_online,\n    const QString reason) {\n    if (!is_online && !reason.isEmpty()) {\n        networkError = true;\n        ui->errorMessage->setText(reason);\n        setVisible(true);\n    } else if (is_online && networkError) {\n        setVisible(false);\n    }\n}\n\nvoid ErrorViewController::displayLogin(\n    const bool open,\n    const uint64_t user_id) {\n    uid = user_id;\n    Bugsnag::user.id = QString::number(user_id);\n    if (user_id && isVisible() && loginError) {\n        loginError = false;\n        setVisible(false);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*---------------------------------------------------------------------\\\n|                                                                      |\n|                     _     _   _   _     __     _                     |\n|                    | |   | | | \\_\/ |   \/  \\   | |                    |\n|                    | |   | | | |_| |  \/ \/\\ \\  | |                    |\n|                    | |__ | | | | | | \/ ____ \\ | |__                  |\n|                    |____||_| |_| |_|\/ \/    \\ \\|____|                 |\n|                                                                      |\n|                             ca-mgm library                           |\n|                                                                      |\n|                                         (C) SUSE Linux Products GmbH |\n\\----------------------------------------------------------------------\/\n\n  File:       OpenSSLUtils.hpp\n\n  Author:     Michael Calmer\n  Maintainer: Michael Calmer\n\/-*\/\n\/**\n * @file   OpenSSLUtils.hpp\n * @brief  This file is private for the ca-mgm library.\n *         It defines functions from openssl \n *\/\n#ifndef   LIMAL_CA_MGM_OPENSSL_UTILS_HPP\n#define   LIMAL_CA_MGM_OPENSSL_UTILS_HPP\n\n#include <limal\/ca-mgm\/config.h>\n#include <limal\/ca-mgm\/CommonData.hpp>\n#include <limal\/ca-mgm\/DNObject.hpp>\n#include <limal\/ca-mgm\/CRLReason.hpp>\n#include <limal\/ByteBuffer.hpp>\n\n#include \"Commands.hpp\"\n\nnamespace LIMAL_NAMESPACE {\n\nnamespace CA_MGM_NAMESPACE {\n\n    class OpenSSLUtils {\n\n    public:\n\n        OpenSSLUtils(const blocxx::String &onfigFile,\n                     const blocxx::String &command = OPENSSL_COMMAND,\n                     const blocxx::String &tmpDir = \"\/tmp\/\");\n\n        void createRSAKey(const blocxx::String &outFile,\n                          const blocxx::String &password,\n                          blocxx::UInt32        bits = 2048,\n                          const blocxx::String &cryptAlgorithm = \"des3\");\n\n        void createRequest(const DNObject       &dn,\n                           const blocxx::String &outFile,\n                           const blocxx::String &keyFile,\n                           const blocxx::String &password,\n                           const blocxx::String &extension,\n                           FormatType            outForm           = E_PEM,\n                           const blocxx::String &challengePassword = \"\",\n                           const blocxx::String &unstructuredName  = \"\");\n\n        void createSelfSignedCertificate(const blocxx::String &outFile,\n                                         const blocxx::String &keyFile,\n                                         const blocxx::String &requestFile,\n                                         const blocxx::String &password,\n                                         const blocxx::String &extension,\n                                         const blocxx::UInt32  days,\n                                         bool                  noEmailDN = false);\n\n        void signRequest(const blocxx::String &requestFile,\n                         const blocxx::String &outFile,\n                         const blocxx::String &caKeyFile,\n                         const blocxx::String &caPassword,\n                         const blocxx::String &extension,\n                         const blocxx::String &startDate,\n                         const blocxx::String &endDate,\n                         const blocxx::String &caSection,\n                         const blocxx::String &outDir     = \"\",\n                         bool                  noEmailDN  = false,\n                         bool                  noUniqueDN = false,\n                         bool                  noText     = true);\n        \n        void revokeCertificate(const blocxx::String &caCertFile,\n                               const blocxx::String &caKeyFile,\n                               const blocxx::String &caPassword,\n                               const blocxx::String &certFile,\n                               const CRLReason      &reason     = CRLReason(),\n                               bool                  noUniqueDN = false);\n\n        void issueCRL(const blocxx::String &caCertFile,\n                      const blocxx::String &caKeyFile,\n                      const blocxx::String &caPassword,\n                      blocxx::UInt32        hours,\n                      const blocxx::String &outfile,\n                      const blocxx::String &extension,\n                      bool                  noUniqueDN = false);\n\n        void updateDB(const blocxx::String &caCertFile,\n                      const blocxx::String &caKeyFile,\n                      const blocxx::String &caPassword);\n                      \n        blocxx::String verify(const blocxx::String &certFile,\n                              const blocxx::String &caPath,\n                              bool                  crlCheck = false,\n                              const blocxx::String &purpose  = \"\");\n\n        blocxx::String status(const blocxx::String &serial);\n\n        bool checkKey(const blocxx::String &caName,\n                      const blocxx::String &password,\n                      const blocxx::String &certificateName = \"cacert\",\n                      const blocxx::String &repository      = REPOSITORY);\n\n        \n        \/\/ ###################################################\n        \/\/ ### static functions\n        \/\/ ###################################################\n\n        static ByteBuffer\n        x509Convert(const ByteBuffer &certificate,\n                    FormatType inform,\n                    FormatType outform );\n\n        static ByteBuffer\n        rsaConvert(const ByteBuffer &key,\n                   FormatType inform,\n                   FormatType outform,\n                   const String &inPassword,\n                   const String &outPassword,\n                   const String &algorithm = \"des3\" );\n\n        static ByteBuffer\n        crlConvert(const ByteBuffer &crl,\n                   FormatType inform,\n                   FormatType outform );\n\n        \/**\n         * certificate and key has to be in PEM format\n         *\/\n        static ByteBuffer\n        createPKCS12(const ByteBuffer &certificate,\n                     const ByteBuffer &key,\n                     const String     &inPassword,\n                     const String     &outPassword,\n                     const ByteBuffer &caCert,\n                     const String     &caPath,\n                     bool              withChain );\n\n        \/**\n         * PKCS12 => PEM format\n         *\/\n        static ByteBuffer\n        pkcs12ToPEM(const ByteBuffer &pkcs12,\n                    const String     &inPassword,\n                    const String     &outPassword,\n                    const String     &algorithm = \"des3\");\n        \n        static blocxx::Array<blocxx::String>\n        listCA(const String &repository = REPOSITORY);\n\n        static blocxx::String\n        nextSerial(const String &serialFile);\n\n        static void\n        addCAM(const String &caName,\n               const String &md5,\n               const String &dnString,\n               const String &repository = REPOSITORY);\n\n        static void\n        delCAM(const String &caName,\n               const String &md5,\n               const String &repository = REPOSITORY);\n\n        static blocxx::Array<blocxx::Array<blocxx::String> >\n        OpenSSLUtils::parseCAMDB(const String &caName,\n                                 const String &repository = REPOSITORY);\n\n        static blocxx::Array<blocxx::Array<blocxx::String> >\n        OpenSSLUtils::parseIndexTXT(const String &caName,\n                                    const String &repository = REPOSITORY);\n        \n        static blocxx::Array<blocxx::Map<blocxx::String, blocxx::String> >\n        OpenSSLUtils::listRequests(const String &caName,\n                                   const String &repository = REPOSITORY);\n\n        static blocxx::Array<blocxx::Map<blocxx::String, blocxx::String> >\n        OpenSSLUtils::listCertificates(const String &caName,\n                                       const String &repository = REPOSITORY);\n\n        static void\n        OpenSSLUtils::createCaInfrastructure(const String &caName, \n                                             const String &repository = REPOSITORY);\n\n    private:\n\n        blocxx::String   m_cmd;\n        blocxx::String   m_tmp;\n        blocxx::String   m_conf;\n        blocxx::String   m_rand;\n\n        OpenSSLUtils();\n        OpenSSLUtils(const OpenSSLUtils&);\n        \n        OpenSSLUtils& operator=(const OpenSSLUtils&);\n\n    };\n}\n}\n\n#endif \/\/ LIMAL_CA_MGM_OPENSSL_UTILS_HPP\n<commit_msg>remove OpenSSLUtils:: from methods<commit_after>\/*---------------------------------------------------------------------\\\n|                                                                      |\n|                     _     _   _   _     __     _                     |\n|                    | |   | | | \\_\/ |   \/  \\   | |                    |\n|                    | |   | | | |_| |  \/ \/\\ \\  | |                    |\n|                    | |__ | | | | | | \/ ____ \\ | |__                  |\n|                    |____||_| |_| |_|\/ \/    \\ \\|____|                 |\n|                                                                      |\n|                             ca-mgm library                           |\n|                                                                      |\n|                                         (C) SUSE Linux Products GmbH |\n\\----------------------------------------------------------------------\/\n\n  File:       OpenSSLUtils.hpp\n\n  Author:     Michael Calmer\n  Maintainer: Michael Calmer\n\/-*\/\n\/**\n * @file   OpenSSLUtils.hpp\n * @brief  This file is private for the ca-mgm library.\n *         It defines functions from openssl \n *\/\n#ifndef   LIMAL_CA_MGM_OPENSSL_UTILS_HPP\n#define   LIMAL_CA_MGM_OPENSSL_UTILS_HPP\n\n#include <limal\/ca-mgm\/config.h>\n#include <limal\/ca-mgm\/CommonData.hpp>\n#include <limal\/ca-mgm\/DNObject.hpp>\n#include <limal\/ca-mgm\/CRLReason.hpp>\n#include <limal\/ByteBuffer.hpp>\n\n#include \"Commands.hpp\"\n\nnamespace LIMAL_NAMESPACE {\n\nnamespace CA_MGM_NAMESPACE {\n\n\tclass OpenSSLUtils {\n\n\tpublic:\n\n\t\tOpenSSLUtils(const blocxx::String &onfigFile,\n\t\t             const blocxx::String &command = OPENSSL_COMMAND,\n\t\t             const blocxx::String &tmpDir = \"\/tmp\/\");\n\n\t\tvoid createRSAKey(const blocxx::String &outFile,\n\t\t                  const blocxx::String &password,\n\t\t                  blocxx::UInt32        bits = 2048,\n\t\t                  const blocxx::String &cryptAlgorithm = \"des3\");\n\n\t\tvoid createRequest(const DNObject       &dn,\n\t\t                   const blocxx::String &outFile,\n\t\t                   const blocxx::String &keyFile,\n\t\t                   const blocxx::String &password,\n\t\t                   const blocxx::String &extension,\n\t\t                   FormatType            outForm           = E_PEM,\n\t\t                   const blocxx::String &challengePassword = \"\",\n\t\t                   const blocxx::String &unstructuredName  = \"\");\n\n\t\tvoid createSelfSignedCertificate(const blocxx::String &outFile,\n\t\t                                 const blocxx::String &keyFile,\n\t\t                                 const blocxx::String &requestFile,\n\t\t                                 const blocxx::String &password,\n\t\t                                 const blocxx::String &extension,\n\t\t                                 const blocxx::UInt32  days,\n\t\t                                 bool                  noEmailDN = false);\n\n\t\tvoid signRequest(const blocxx::String &requestFile,\n\t\t                 const blocxx::String &outFile,\n\t\t                 const blocxx::String &caKeyFile,\n\t\t                 const blocxx::String &caPassword,\n\t\t                 const blocxx::String &extension,\n\t\t                 const blocxx::String &startDate,\n\t\t                 const blocxx::String &endDate,\n\t\t                 const blocxx::String &caSection,\n\t\t                 const blocxx::String &outDir     = \"\",\n\t\t                 bool                  noEmailDN  = false,\n\t\t                 bool                  noUniqueDN = false,\n\t\t                 bool                  noText     = true);\n        \n\t\tvoid revokeCertificate(const blocxx::String &caCertFile,\n\t\t                       const blocxx::String &caKeyFile,\n\t\t                       const blocxx::String &caPassword,\n\t\t                       const blocxx::String &certFile,\n\t\t                       const CRLReason      &reason     = CRLReason(),\n\t\t                       bool                  noUniqueDN = false);\n\n\t\tvoid issueCRL(const blocxx::String &caCertFile,\n\t\t              const blocxx::String &caKeyFile,\n\t\t              const blocxx::String &caPassword,\n\t\t              blocxx::UInt32        hours,\n\t\t              const blocxx::String &outfile,\n\t\t              const blocxx::String &extension,\n\t\t              bool                  noUniqueDN = false);\n\n\t\tvoid updateDB(const blocxx::String &caCertFile,\n\t\t              const blocxx::String &caKeyFile,\n\t\t              const blocxx::String &caPassword);\n                      \n\t\tblocxx::String verify(const blocxx::String &certFile,\n\t\t                      const blocxx::String &caPath,\n\t\t                      bool                  crlCheck = false,\n\t\t                      const blocxx::String &purpose  = \"\");\n\n\t\tblocxx::String status(const blocxx::String &serial);\n\n\t\tbool checkKey(const blocxx::String &caName,\n\t\t              const blocxx::String &password,\n\t\t              const blocxx::String &certificateName = \"cacert\",\n\t\t              const blocxx::String &repository      = REPOSITORY);\n\n        \n\t\t\/\/ ###################################################\n\t\t\/\/ ### static functions\n\t\t\/\/ ###################################################\n\n\t\tstatic ByteBuffer\n\t\tx509Convert(const ByteBuffer &certificate,\n\t\t            FormatType inform,\n\t\t            FormatType outform );\n\n\t\tstatic ByteBuffer\n\t\trsaConvert(const ByteBuffer &key,\n\t\t           FormatType inform,\n\t\t           FormatType outform,\n\t\t           const String &inPassword,\n\t\t           const String &outPassword,\n\t\t           const String &algorithm = \"des3\" );\n\n\t\tstatic ByteBuffer\n\t\tcrlConvert(const ByteBuffer &crl,\n\t\t           FormatType inform,\n\t\t           FormatType outform );\n\n\t\t\/**\n         * certificate and key has to be in PEM format\n         *\/\n\t\tstatic ByteBuffer\n\t\tcreatePKCS12(const ByteBuffer &certificate,\n\t\t             const ByteBuffer &key,\n\t\t             const String     &inPassword,\n\t\t             const String     &outPassword,\n\t\t             const ByteBuffer &caCert,\n\t\t             const String     &caPath,\n\t\t             bool              withChain );\n\n\t\t\/**\n         * PKCS12 => PEM format\n         *\/\n\t\tstatic ByteBuffer\n\t\tpkcs12ToPEM(const ByteBuffer &pkcs12,\n\t\t            const String     &inPassword,\n\t\t            const String     &outPassword,\n\t\t            const String     &algorithm = \"des3\");\n        \n\t\tstatic blocxx::Array<blocxx::String>\n\t\tlistCA(const String &repository = REPOSITORY);\n\n\t\tstatic blocxx::String\n\t\tnextSerial(const String &serialFile);\n\n\t\tstatic void\n\t\taddCAM(const String &caName,\n\t\t       const String &md5,\n\t\t       const String &dnString,\n\t\t       const String &repository = REPOSITORY);\n\n\t\tstatic void\n\t\tdelCAM(const String &caName,\n\t\t       const String &md5,\n\t\t       const String &repository = REPOSITORY);\n\n\t\tstatic blocxx::Array<blocxx::Array<blocxx::String> >\n\t\tparseCAMDB(const String &caName,\n\t\t           const String &repository = REPOSITORY);\n\n\t\tstatic blocxx::Array<blocxx::Array<blocxx::String> >\n\t\tparseIndexTXT(const String &caName,\n\t\t              const String &repository = REPOSITORY);\n        \n\t\tstatic blocxx::Array<blocxx::Map<blocxx::String, blocxx::String> >\n\t\tlistRequests(const String &caName,\n\t\t             const String &repository = REPOSITORY);\n    \t\n\t\tstatic blocxx::Array<blocxx::Map<blocxx::String, blocxx::String> >\n\t\tlistCertificates(const String &caName,\n\t\t                 const String &repository = REPOSITORY);\n    \t\n\t\tstatic void\n\t\tcreateCaInfrastructure(const String &caName, \n\t\t                       const String &repository = REPOSITORY);\n\n\tprivate:\n\n\t\tblocxx::String   m_cmd;\n\t\tblocxx::String   m_tmp;\n\t\tblocxx::String   m_conf;\n\t\tblocxx::String   m_rand;\n\n\t\tOpenSSLUtils();\n\t\tOpenSSLUtils(const OpenSSLUtils&);\n        \n\t\tOpenSSLUtils& operator=(const OpenSSLUtils&);\n\n    };\n}\n}\n\n#endif \/\/ LIMAL_CA_MGM_OPENSSL_UTILS_HPP\n<|endoftext|>"}
{"text":"<commit_before>#include \"Oscilloscope.h\"\n#include \"Renderer.h\"\n#include \"Color.h\"\n#include \"Sample.h\"\n#include \"Value.h\"\n#include \"IPlayer.h\"\n#include \"ITrackState.h\"\n#include \"IOscillator.h\"\n\nOscilloscope::Oscilloscope(EditorState& editorState, IPlayer& player, int channel)\n\t: Editor(editorState, false), mPlayer(player), mChannel(channel), mOscilloscopePos(0)\n{\n}\n\n\t\nOscilloscope::~Oscilloscope()\n{\n}\n\n\nvoid Oscilloscope::setBuffer(const Sample16 *buffer, int length)\n{\n\tmBuffer = buffer;\n\tmBufferLength = length;\n\tsetDirty(true);\n}\n\n\nvoid Oscilloscope::onDraw(Renderer& renderer, const SDL_Rect& area)\n{\n\tsetDirty(false);\n\trenderer.renderBackground(area);\n\t\n\tSDL_Point points[area.w];\n\n\tfor (int x = 0 ; x < area.w ; ++x)\n\t{\n\t\tint bufferPos = mBufferLength * x \/ area.w;\n\t\tint y = mBuffer[(bufferPos + mOscilloscopePos) % mBufferLength].left * area.h \/ IOscillator::oscillatorResolution \/ 2 + area.h \/ 2;\n\t\t\n\t\tif (y >= area.h)\n\t\t\ty = area.h - 1;\n\t\telse if (y < 0)\n\t\t\ty = 0;\n\t\t\n\t\tpoints[x].x = area.x + x;\n\t\tpoints[x].y = area.y + y;\n\t}\n\t\n\trenderer.renderPoints(points, area.w, Color());\n}\n\n\nbool Oscilloscope::onEvent(SDL_Event& event)\n{\n\tif (event.type == SDL_MOUSEBUTTONDOWN)\n\t{\n\t\tmPlayer.getTrackState(mChannel).enabled ^= true;\n\t\treturn true;\n\t}\n\t\n\treturn false;\n}\n\n\nvoid Oscilloscope::onListenableChange(Listenable *listenable)\n{\n\tsetDirty(true);\n\t\n\t\/\/ Assumes this will always be called by mOscillatorsProbePos->notify()\n\tmOscilloscopePos = *static_cast<Value*>(listenable);\n}\n<commit_msg>Oscilloscope did not show both left and right channels<commit_after>#include \"Oscilloscope.h\"\n#include \"Renderer.h\"\n#include \"Color.h\"\n#include \"Sample.h\"\n#include \"Value.h\"\n#include \"IPlayer.h\"\n#include \"ITrackState.h\"\n#include \"IOscillator.h\"\n\nOscilloscope::Oscilloscope(EditorState& editorState, IPlayer& player, int channel)\n\t: Editor(editorState, false), mPlayer(player), mChannel(channel), mOscilloscopePos(0)\n{\n}\n\n\t\nOscilloscope::~Oscilloscope()\n{\n}\n\n\nvoid Oscilloscope::setBuffer(const Sample16 *buffer, int length)\n{\n\tmBuffer = buffer;\n\tmBufferLength = length;\n\tsetDirty(true);\n}\n\n\nvoid Oscilloscope::onDraw(Renderer& renderer, const SDL_Rect& area)\n{\n\tsetDirty(false);\n\trenderer.renderBackground(area);\n\t\n\tSDL_Point points[area.w];\n\n\tfor (int x = 0 ; x < area.w ; ++x)\n\t{\n\t\tint bufferPos = mBufferLength * x \/ area.w;\n\t\tconst Sample16& sample = mBuffer[(bufferPos + mOscilloscopePos) % mBufferLength];\n\t\tint y = (sample.left + sample.right) * area.h \/ IOscillator::oscillatorResolution \/ 2 + area.h \/ 2;\n\t\t\n\t\tif (y >= area.h)\n\t\t\ty = area.h - 1;\n\t\telse if (y < 0)\n\t\t\ty = 0;\n\t\t\n\t\tpoints[x].x = area.x + x;\n\t\tpoints[x].y = area.y + y;\n\t}\n\t\n\trenderer.renderPoints(points, area.w, Color());\n}\n\n\nbool Oscilloscope::onEvent(SDL_Event& event)\n{\n\tif (event.type == SDL_MOUSEBUTTONDOWN)\n\t{\n\t\tmPlayer.getTrackState(mChannel).enabled ^= true;\n\t\treturn true;\n\t}\n\t\n\treturn false;\n}\n\n\nvoid Oscilloscope::onListenableChange(Listenable *listenable)\n{\n\tsetDirty(true);\n\t\n\t\/\/ Assumes this will always be called by mOscillatorsProbePos->notify()\n\tmOscilloscopePos = *static_cast<Value*>(listenable);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    c2ffi\n    Copyright (C) 2013  Ryan Pavlik\n\n    This file is part of c2ffi.\n\n    c2ffi is free software: you can redistribute it and\/or modify\n    it under the terms of the GNU General Public License as published by\n    the Free Software Foundation, either version 2 of the License, or\n    (at your option) any later version.\n\n    c2ffi is distributed in the hope that it will be useful,\n    but WITHOUT ANY WARRANTY; without even the implied warranty of\n    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n    GNU General Public License for more details.\n\n    You should have received a copy of the GNU General Public License\n    along with c2ffi.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include <stdarg.h>\n#include <stdio.h>\n#include \"c2ffi.h\"\n\n\/*** Add new OutputDrivers here: ***************************************\/\n\nnamespace c2ffi {\n    OutputDriver* MakeNullOutputDriver(std::ostream *os);\n    OutputDriver* MakeJSONOutputDriver(std::ostream *os);\n    OutputDriver* MakeSexpOutputDriver(std::ostream *os);\n\n    OutputDriverField OutputDrivers[] = {\n        { \"null\", &MakeNullOutputDriver },\n        { \"json\", &MakeJSONOutputDriver },\n        { \"sexp\", &MakeSexpOutputDriver },\n        { 0, 0 }\n    };\n}\n\n\/***********************************************************************\/\n\nnamespace c2ffi {\n    void OutputDriver::comment(char *fmt, ...) {\n        va_list ap;\n        char buf[1024];\n        va_start(ap, fmt);\n\n        vsnprintf(buf, sizeof(buf), fmt, ap);\n        write_comment(buf);\n\n        va_end(ap);\n    }\n}\n<commit_msg>Don't make Null the default output driver :P<commit_after>\/*\n    c2ffi\n    Copyright (C) 2013  Ryan Pavlik\n\n    This file is part of c2ffi.\n\n    c2ffi is free software: you can redistribute it and\/or modify\n    it under the terms of the GNU General Public License as published by\n    the Free Software Foundation, either version 2 of the License, or\n    (at your option) any later version.\n\n    c2ffi is distributed in the hope that it will be useful,\n    but WITHOUT ANY WARRANTY; without even the implied warranty of\n    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n    GNU General Public License for more details.\n\n    You should have received a copy of the GNU General Public License\n    along with c2ffi.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include <stdarg.h>\n#include <stdio.h>\n#include \"c2ffi.h\"\n\n\/*** Add new OutputDrivers here: ***************************************\/\n\nnamespace c2ffi {\n    OutputDriver* MakeNullOutputDriver(std::ostream *os);\n    OutputDriver* MakeJSONOutputDriver(std::ostream *os);\n    OutputDriver* MakeSexpOutputDriver(std::ostream *os);\n\n    OutputDriverField OutputDrivers[] = {\n        { \"json\", &MakeJSONOutputDriver },\n        { \"sexp\", &MakeSexpOutputDriver },\n        { \"null\", &MakeNullOutputDriver },\n        { 0, 0 }\n    };\n}\n\n\/***********************************************************************\/\n\nnamespace c2ffi {\n    void OutputDriver::comment(char *fmt, ...) {\n        va_list ap;\n        char buf[1024];\n        va_start(ap, fmt);\n\n        vsnprintf(buf, sizeof(buf), fmt, ap);\n        write_comment(buf);\n\n        va_end(ap);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef MERGESORT_HPP\n#define MERGESORT_HPP 1\n\n#include <algorithm>\n#include <functional>\n#include <iterator>\n#include <vector>\n\n#include <iostream>\n\nnamespace MergeSort {\n\n\tenum class MergeType { InPlace, ExtraSpace };\n\n\ttemplate<class RandomIt, class Compare>\n\tvoid InPlaceMerge(RandomIt begin, RandomIt middle, RandomIt end, Compare Comp) {\n\t\twhile (middle != end) {\n\t\t\twhile (begin != middle && Comp(*begin, *middle)) {\n\t\t\t\t++begin;\n\t\t\t}\n\t\t\tif (begin == middle) {\n\t\t\t\t\/\/All good\n\t\t\t\treturn;\n\t\t\t} else {\n\t\t\t\t\/\/Need to do a rotate\n\t\t\t\t\/\/\tThis moves 'middle' to the position of 'begin',\n\t\t\t\t\/\/\tand shifts [begin, middle) to the right one\n\t\t\t\tstd::rotate(begin, middle, middle+1);\n\t\t\t\t++begin;\n\t\t\t\t++middle;\n\t\t\t}\n\t\t}\n\t}\n\n\ttemplate<class LeftRandomIt, class RightRandomIt, class InsertRandomIt, class Compare>\n\tvoid Merge(LeftRandomIt leftBegin, LeftRandomIt leftEnd, RightRandomIt rightBegin, RightRandomIt rightEnd, InsertRandomIt insertionPoint, Compare Comp) {\n\t\twhile (leftBegin != leftEnd && rightBegin != rightEnd) {\n\t\t\tauto leftValue = *leftBegin;\n\t\t\tauto rightValue = *rightBegin;\n\t\t\t\/\/While there are elements in both lists\n\t\t\tif (Comp(leftValue, rightValue)) {\n\t\t\t\t\/\/Left list's begin element goes begin\n\t\t\t\t*insertionPoint = leftValue;\n\t\t\t\t++leftBegin;\n\t\t\t} else {\n\t\t\t\t\/\/Right list's begin element goes begin\n\t\t\t\t*insertionPoint = rightValue;\n\t\t\t\t++rightBegin;\n\t\t\t}\n\t\t\t++insertionPoint;\n\t\t}\n\t\t\/\/Now at least one list is empty\n\t\tif (leftBegin != leftEnd) {\n\t\t\t\/\/Insert all of the left list into the list (right is empty)\n\t\t\tstd::move(leftBegin, leftEnd, insertionPoint);\n\t\t} else if (rightBegin != rightEnd) {\n\t\t\t\/\/Insert all of the right list into the list (left is empty)\n\t\t\tstd::move(rightBegin, rightEnd, insertionPoint);\n\t\t}\n\t}\n\n\ttemplate<class RandomIt, class Compare>\n\tvoid MergeLeft(RandomIt begin, RandomIt middle, RandomIt end, Compare Comp) {\n\t\t\/\/Merging the right into the place of the left (left is smaller)\n\t\t\n\t\t\/\/Determine if there are any leftmost positions that are already in place\n\t\tRandomIt newLeftBegin = std::upper_bound(begin, middle, *middle, Comp);\n\t\tif (newLeftBegin == middle) {\n\t\t\t\/\/Everything in the left list is smaller than the first in the right list, we're done\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ newLeftBegin saved std::distance(begin, newLeftBegin)*sizeof(RandomIt) bytes of extra space usage\n\t\t\/\/Save the left list in a temp because we'll be overwriting it as we insert\n\t\tusing ValueType = typename std::iterator_traits<RandomIt>::value_type;\n\t\tstd::vector<ValueType> tempList(newLeftBegin, middle);\n\t\tauto leftIt = tempList.begin();\n\t\tauto leftEnd = tempList.end();\n\n\t\tRandomIt rightIt = middle;\n\t\tRandomIt rightEnd = end;\n\n\t\tRandomIt insertIt = newLeftBegin;\n\n\t\tMerge(leftIt, leftEnd, rightIt, rightEnd, insertIt, Comp);\n\t}\n\n\ttemplate<class RandomIt, class Compare>\n\tvoid MergeRight(RandomIt begin, RandomIt middle, RandomIt end, Compare Comp) {\n\t\t\/\/Merging the left into the place of the right (right is smaller)\n\t\t\n\t\tusing RevIt = std::reverse_iterator<RandomIt>;\n\n\t\t\/\/Save the left list in a temp because we'll be overwriting it as we insert\n\t\tusing ValueType = typename std::iterator_traits<RandomIt>::value_type;\n\t\tstd::vector<ValueType> tempList(middle, end);\n\t\tauto rightIt = std::reverse_iterator<typename std::vector<ValueType>::iterator>(tempList.end());\n\t\tauto rightEnd = std::reverse_iterator<typename std::vector<ValueType>::iterator>(tempList.begin());\n\n\t\tRevIt leftIt = RevIt(middle);\n\t\tRevIt leftEnd = RevIt(begin);\n\n\t\tRevIt insertIt = RevIt(end);\n\n\t\tauto NewComp = [&Comp](const auto &a, const auto &b) -> bool {\n\t\t\treturn Comp(b, a);\n\t\t};\n\n\t\tMerge(leftIt, leftEnd, rightIt, rightEnd, insertIt, NewComp);\n\t}\n\n\ttemplate<class RandomIt, class Compare>\n\tvoid Merge(RandomIt begin, RandomIt middle, RandomIt end, Compare Comp) {\n\t\tsize_t leftLength = std::distance(begin, middle);\n\t\tsize_t rightLength = std::distance(middle, end);\n\n\t\t\/\/MergeLeft or MergeRight depending on whether the\n\t\t\/\/\tleft or right is smaller\n\t\tif (leftLength <= rightLength) {\n\t\t\tMergeLeft(begin, middle, end, Comp);\n\t\t} else {\n\t\t\tMergeRight(begin, middle, end, Comp);\n\t\t}\n\t}\n\n\ttemplate<class RandomIt, class Compare = std::less<>>\n\tvoid Sort(RandomIt begin, RandomIt end, MergeType mergeType = MergeType::ExtraSpace, Compare Comp = Compare()) {\n\t\tstd::function<void(RandomIt,RandomIt,RandomIt,Compare)> MergeFunction;\n\t\t\n\t\tif (mergeType == MergeType::ExtraSpace) {\n\t\t\tMergeFunction = Merge<RandomIt,Compare>;\n\t\t} else {\n\t\t\tMergeFunction = InPlaceMerge<RandomIt,Compare>;\n\t\t}\n\n\t\tsize_t length = std::distance(begin,end);\n\n\t\tfor (size_t width=1; width<length; width*=2) {\n\t\t\t\/\/We are going to merge lists of length 'width'\n\t\t\tfor (size_t listStart=0; listStart<length; listStart+=(width*2)) {\n\t\t\t\t\/\/These 2 lists are [listStart, listStart+width) and [listStart+width, listStart+(width*2))\n\t\t\t\tsize_t firstPos = listStart;\n\t\t\t\tsize_t middlePos = listStart+width;\n\t\t\t\tsize_t endPos = listStart+(width*2);\n\t\t\t\tif (middlePos >= length) {\n\t\t\t\t\tmiddlePos = length;\n\t\t\t\t\tendPos = length;\n\t\t\t\t} else if (endPos >= length) {\n\t\t\t\t\tendPos = length;\n\t\t\t\t}\n\t\t\t\tMergeFunction(begin+firstPos, begin+middlePos, begin+endPos, Comp);\n\t\t\t}\n\t\t}\n\t}\n} \/\/namespace MergeSort\n\n#endif \/\/MERGESORT_HPP<commit_msg>implemented single function for both merge directions<commit_after>#ifndef MERGESORT_HPP\n#define MERGESORT_HPP 1\n\n#include <algorithm>\n#include <functional>\n#include <iterator>\n#include <vector>\n\n#include <iostream>\n\nnamespace MergeSort {\n\n\tenum class MergeType { InPlace, ExtraSpace };\n\n\ttemplate<class RandomIt, class Compare>\n\tvoid InPlaceMerge(RandomIt begin, RandomIt middle, RandomIt end, Compare Comp) {\n\t\twhile (middle != end) {\n\t\t\twhile (begin != middle && Comp(*begin, *middle)) {\n\t\t\t\t++begin;\n\t\t\t}\n\t\t\tif (begin == middle) {\n\t\t\t\t\/\/All good\n\t\t\t\treturn;\n\t\t\t} else {\n\t\t\t\t\/\/Need to do a rotate\n\t\t\t\t\/\/\tThis moves 'middle' to the position of 'begin',\n\t\t\t\t\/\/\tand shifts [begin, middle) to the right one\n\t\t\t\tstd::rotate(begin, middle, middle+1);\n\t\t\t\t++begin;\n\t\t\t\t++middle;\n\t\t\t}\n\t\t}\n\t}\n\n\ttemplate <class RandomIt>\n\tRandomIt ReverseIt(std::reverse_iterator<RandomIt> it) {\n\t\treturn it.base();\n\t}\n\n\ttemplate <class RandomIt>\n\tstd::reverse_iterator<RandomIt> ReverseIt(RandomIt it) {\n\t\treturn std::reverse_iterator<RandomIt>(it);\n\t}\n\n\ttemplate<class Compare>\n\tstruct ReversedCompare {\n\t\tCompare compare;\n\t\ttemplate<class Left, class Right>\n\t\tbool operator()(const Left& left, const Right& right) {\n\t\t\treturn compare(right,left);\n\t\t}\n\t};\n\n\ttemplate <class Compare>\n\tCompare ReverseComp(ReversedCompare<Compare> compare) {\n\t\treturn compare.compare;\n\t}\n\n\ttemplate <class Compare>\n\tReversedCompare<Compare> ReverseComp(Compare compare) {\n\t\treturn ReversedCompare<Compare>{compare};\n\t}\n\n\ttemplate<class RandomIt, class Compare>\n\tvoid Merge(RandomIt begin, RandomIt middle, RandomIt end, Compare Comp) {\n\t\tsize_t leftLength = std::distance(begin, middle);\n\t\tsize_t rightLength = std::distance(middle, end);\n\n\t\tif (leftLength > rightLength) {\n\t\t\t\/\/Left list is bigger, swap everything around and recursively call this function\n\t\t\tMerge(ReverseIt(end), ReverseIt(middle), ReverseIt(begin), ReverseComp(Comp));\n\t\t\treturn;\n\t\t}\n\t\t\/\/Now guaranteed that [begin,middle) <= [middle,end)\n\n\t\t\/\/Determine if there are any leftmost positions that are already in place\n\t\t\/\/\t\"These preliminary searches may not pay off, and can be expected *not* to\n\t\t\/\/\trepay their cost if the data is random.  But they can win huge in all of\n\t\t\/\/\ttime, copying, and memory savings when they do pay\"\n\t\t\/\/\tAccording to https:\/\/svn.python.org\/projects\/python\/trunk\/Objects\/listsort.txt\n\t\tRandomIt newLeftBegin = std::upper_bound(begin, middle, *middle, Comp);\n\t\tif (newLeftBegin == middle) {\n\t\t\t\/\/Everything in the left list is smaller than the first in the right list, we're done\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ newLeftBegin saved std::distance(begin, newLeftBegin)*sizeof(RandomIt) bytes of extra space usage\n\t\t\/\/Save the left list in a temp because we'll be overwriting it as we insert\n\t\tusing ValueType = typename std::iterator_traits<RandomIt>::value_type;\n\t\tstd::vector<ValueType> tempList(newLeftBegin, middle);\n\t\tauto leftIt = tempList.begin();\n\t\tauto leftEnd = tempList.end();\n\n\t\tRandomIt rightIt = middle;\n\t\tRandomIt rightEnd = end;\n\n\t\tRandomIt insertIt = newLeftBegin;\n\n\t\twhile (leftIt != leftEnd && rightIt != rightEnd) {\n\t\t\tauto leftValue = *leftIt;\n\t\t\tauto rightValue = *rightIt;\n\t\t\t\/\/While there are elements in both lists\n\t\t\tif (Comp(leftValue, rightValue)) {\n\t\t\t\t\/\/Left list's begin element goes begin\n\t\t\t\t*insertIt = leftValue;\n\t\t\t\t++leftIt;\n\t\t\t} else {\n\t\t\t\t\/\/Right list's begin element goes begin\n\t\t\t\t*insertIt = rightValue;\n\t\t\t\t++rightIt;\n\t\t\t}\n\t\t\t++insertIt;\n\t\t}\n\t\t\/\/Now at least one list is empty\n\t\tif (leftIt != leftEnd) {\n\t\t\t\/\/Insert all of the left list into the list (right is empty)\n\t\t\tstd::move(leftIt, leftEnd, insertIt);\n\t\t} else if (rightIt != rightEnd) {\n\t\t\t\/\/Insert all of the right list into the list (left is empty)\n\t\t\tstd::move(rightIt, rightEnd, insertIt);\n\t\t}\n\t}\n\n\ttemplate<class RandomIt, class Compare = std::less<>>\n\tvoid Sort(RandomIt begin, RandomIt end, MergeType mergeType = MergeType::ExtraSpace, Compare Comp = Compare()) {\n\t\tstd::function<void(RandomIt,RandomIt,RandomIt,Compare)> MergeFunction;\n\t\t\n\t\tif (mergeType == MergeType::ExtraSpace) {\n\t\t\tMergeFunction = Merge<RandomIt,Compare>;\n\t\t} else {\n\t\t\tMergeFunction = InPlaceMerge<RandomIt,Compare>;\n\t\t}\n\n\t\tsize_t length = std::distance(begin,end);\n\n\t\tfor (size_t width=1; width<length; width*=2) {\n\t\t\t\/\/We are going to merge lists of length 'width'\n\t\t\tfor (size_t listStart=0; listStart<length; listStart+=(width*2)) {\n\t\t\t\t\/\/These 2 lists are [listStart, listStart+width) and [listStart+width, listStart+(width*2))\n\t\t\t\tsize_t firstPos = listStart;\n\t\t\t\tsize_t middlePos = listStart+width;\n\t\t\t\tsize_t endPos = listStart+(width*2);\n\t\t\t\tif (middlePos >= length) {\n\t\t\t\t\tmiddlePos = length;\n\t\t\t\t\tendPos = length;\n\t\t\t\t} else if (endPos >= length) {\n\t\t\t\t\tendPos = length;\n\t\t\t\t}\n\t\t\t\tMergeFunction(begin+firstPos, begin+middlePos, begin+endPos, Comp);\n\t\t\t}\n\t\t}\n\t}\n} \/\/namespace MergeSort\n\n#endif \/\/MERGESORT_HPP<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2011 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 <iostream>\n#include <fstream>\n#include <cxxtools\/log.h>\n#include <cxxtools\/arg.h>\n#include <cxxtools\/jsonserializer.h>\n#include <cxxtools\/serializationinfo.h>\n#include <cxxtools\/thread.h>\n#include <cxxtools\/http\/server.h>\n#include <cxxtools\/http\/service.h>\n#include <cxxtools\/http\/responder.h>\n#include <cxxtools\/http\/reply.h>\n#include <cxxtools\/eventloop.h>\n\nstruct ProcStat\n{\n  ProcStat()\n    : user(0),\n      nice(0),\n      system(0),\n      idle(0),\n      iowait(0),\n      irq(0),\n      softirq(0)\n      { }\n\n  std::string cpu;\n  unsigned user;\n  unsigned nice;\n  unsigned system;\n  unsigned idle;\n  unsigned iowait;\n  unsigned irq;\n  unsigned softirq;\n};\n\nstd::istream& operator>> (std::istream& in, ProcStat& p)\n{\n  in >> p.cpu >> p.user >> p.nice >> p.system >> p.idle >> p.iowait >> p.irq >> p.softirq;\n  return in;\n}\n\nstd::ostream& operator<< (std::ostream& out, ProcStat& p)\n{\n  out << p.cpu << ' ' << p.user << ' ' << p.nice << ' ' << p.system << ' ' << p.idle << ' ' << p.iowait << ' ' << p.irq << ' ' << p.softirq;\n  return out;\n}\n\nvoid operator<<= (cxxtools::SerializationInfo& si, const ProcStat& p)\n{\n  si.addMember(\"cpu\") <<= p.cpu;\n  si.addMember(\"user\") <<= p.user;\n  si.addMember(\"nice\") <<= p.nice;\n  si.addMember(\"system\") <<= p.system;\n  si.addMember(\"idle\") <<= p.idle;\n  si.addMember(\"iowait\") <<= p.iowait;\n  si.addMember(\"irq\") <<= p.irq;\n  si.addMember(\"softirq\") <<= p.softirq;\n}\n\nProcStat operator- (const ProcStat& p1, const ProcStat& p2)\n{\n  ProcStat p;\n  p.cpu       = p1.cpu;\n  p.user      = p1.user    - p2.user;\n  p.nice      = p1.nice    - p2.nice;\n  p.system    = p1.system  - p2.system;\n  p.idle      = p1.idle    - p2.idle;\n  p.iowait    = p1.iowait  - p2.iowait;\n  p.irq       = p1.irq     - p2.irq;\n  p.softirq   = p1.softirq - p2.softirq;\n  return p;\n}\n\nProcStat currentStat;\ncxxtools::Mutex statMutex;\n\nvoid statThread()\n{\n  ProcStat p0;\n  {\n    std::ifstream f(\"\/proc\/stat\");\n    f >> p0;\n  }\n\n  while (true)\n  {\n    cxxtools::Thread::sleep(1000);\n    std::ifstream f(\"\/proc\/stat\");\n    ProcStat p1;\n    f >> p1;\n    cxxtools::MutexLock lock(statMutex);\n    currentStat = p1 - p0;\n    p0 = p1;\n  }\n}\n\nclass MainResponder : public cxxtools::http::Responder\n{\n  public:\n    explicit MainResponder(cxxtools::http::Service& service)\n      : cxxtools::http::Responder(service)\n      { }\n\n    virtual void reply(std::ostream&, cxxtools::http::Request& request, cxxtools::http::Reply& reply);\n};\n\nvoid MainResponder::reply(std::ostream& out, cxxtools::http::Request& request, cxxtools::http::Reply& reply)\n{\n  reply.addHeader(\"Content-Type\", \"text\/html\");\n  out << \"<!DOCTYPE HTML PUBLIC \\\"-\/\/W3C\/\/DTD HTML 4.0 Transitional\/\/EN\\\">\\n\"\n         \"<html>\\n\"\n         \" <head>\\n\"\n         \"  <script type='text\/javascript'>\\n\"\n         \"    function getRequest()\\n\"\n         \"    {\\n\"\n         \"      try { return new XMLHttpRequest();                   } catch (e) { }\\n\"\n         \"      try { return new ActiveXObject(\\\"Msxml2.XMLHttp\\\");    } catch (e) { }\\n\"\n         \"      try { return new ActiveXObject(\\\"Microsoft.XMLHTTP\\\"); } catch (e) { }\\n\"\n         \"      return null;\\n\"\n         \"    }\\n\"\n         \"\\n\"\n         \"    function ajaxGet(url, fn)\\n\"\n         \"    {\\n\"\n         \"      request = getRequest();\\n\"\n         \"      request.open('GET', url);\\n\"\n         \"      request.onreadystatechange = function () {\\n\"\n         \"          if (request.readyState == 4)\\n\"\n         \"          {\\n\"\n         \"            if (request.status == 200)\\n\"\n         \"              fn(request);\\n\"\n         \"          }\\n\"\n         \"        }\\n\"\n         \"      request.send(null);\\n\"\n         \"    }\\n\"\n         \"\\n\"\n         \"    function updateStat()\\n\"\n         \"    {\\n\"\n         \"      ajaxGet('\/stat',\\n\"\n         \"        function(request)\\n\"\n         \"        {\\n\"\n         \"          var r = eval('(' + request.responseText + ')');\\n\"\n         \"          document.getElementById('cpu').innerHTML = r.stat.cpu;\\n\"\n         \"          document.getElementById('user').innerHTML = r.stat.user;\\n\"\n         \"          document.getElementById('nice').innerHTML = r.stat.nice;\\n\"\n         \"          document.getElementById('system').innerHTML = r.stat.system;\\n\"\n         \"          document.getElementById('idle').innerHTML = r.stat.idle;\\n\"\n         \"          document.getElementById('iowait').innerHTML = r.stat.iowait;\\n\"\n         \"          document.getElementById('irq').innerHTML = r.stat.irq;\\n\"\n         \"          document.getElementById('softirq').innerHTML = r.stat.softirq;\\n\"\n         \"          document.getElementById('user').innerHTML = r.stat.user;\\n\"\n         \"        });\\n\"\n         \"    }\\n\"\n         \"\\n\"\n         \"    window.setInterval('updateStat()', 1000);\\n\"\n         \"   <\/script>\\n\"\n         \" <\/head>\\n\"\n         \"\\n\"\n         \" <body bgcolor='#FFFFFF'>\\n\"\n         \"\\n\"\n         \"  <table>\\n\"\n         \"   <tr><th>cpu<\/th><td id='cpu'><\/td><\/tr>\\n\"\n         \"   <tr><th>user<\/th><td id='user'><\/td><\/tr>\\n\"\n         \"   <tr><th>nice<\/th><td id='nice'><\/td><\/tr>\\n\"\n         \"   <tr><th>system<\/th><td id='system'><\/td><\/tr>\\n\"\n         \"   <tr><th>idle<\/th><td id='idle'><\/td><\/tr>\\n\"\n         \"   <tr><th>iowait<\/th><td id='iowait'><\/td><\/tr>\\n\"\n         \"   <tr><th>irq<\/th><td id='irq'><\/td><\/tr>\\n\"\n         \"   <tr><th>softirq<\/th><td id='softirq'><\/td><\/tr>\\n\"\n         \"  <\/table>\\n\"\n         \"\\n\"\n         \" <\/body>\\n\"\n         \"<\/html>\\n\";\n}\n\nclass StatResponder : public cxxtools::http::Responder\n{\n  public:\n    explicit StatResponder(cxxtools::http::Service& service)\n      : cxxtools::http::Responder(service)\n      { }\n\n    virtual void reply(std::ostream&, cxxtools::http::Request& request, cxxtools::http::Reply& reply);\n};\n\nvoid StatResponder::reply(std::ostream& out, cxxtools::http::Request& request, cxxtools::http::Reply& reply)\n{\n  cxxtools::MutexLock lock(statMutex);\n  reply.addHeader(\"Content-Type\", \"application\/json\");\n  cxxtools::JsonSerializer serializer(out);\n  serializer.serialize(currentStat, \"stat\");\n  serializer.finish();\n}\n\ntypedef cxxtools::http::CachedService<StatResponder> StatService;\ntypedef cxxtools::http::CachedService<MainResponder> MainService;\n\nint main(int argc, char* argv[])\n{\n  try\n  {\n    log_init();\n    cxxtools::Arg<std::string> listenIp(argc, argv, 'l');\n    cxxtools::Arg<unsigned short int> listenPort(argc, argv, 'p', 8001);\n    cxxtools::EventLoop loop;\n    cxxtools::http::Server server(loop, listenIp, listenPort);\n    MainService mainService;\n    StatService statService;\n    server.addService(\"\/\", mainService);\n    server.addService(\"\/stat\", statService);\n\n    cxxtools::AttachedThread thread(cxxtools::callable(statThread));\n    thread.start();\n    loop.run();\n  }\n  catch (const std::exception& e)\n  {\n    std::cerr << e.what() << std::endl;\n  }\n}\n\n<commit_msg>use new shorter variant of json serializer in json demo<commit_after>\/*\n * Copyright (C) 2011 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 <iostream>\n#include <fstream>\n#include <cxxtools\/log.h>\n#include <cxxtools\/arg.h>\n#include <cxxtools\/jsonserializer.h>\n#include <cxxtools\/serializationinfo.h>\n#include <cxxtools\/thread.h>\n#include <cxxtools\/http\/server.h>\n#include <cxxtools\/http\/service.h>\n#include <cxxtools\/http\/responder.h>\n#include <cxxtools\/http\/reply.h>\n#include <cxxtools\/eventloop.h>\n\nstruct ProcStat\n{\n  ProcStat()\n    : user(0),\n      nice(0),\n      system(0),\n      idle(0),\n      iowait(0),\n      irq(0),\n      softirq(0)\n      { }\n\n  std::string cpu;\n  unsigned user;\n  unsigned nice;\n  unsigned system;\n  unsigned idle;\n  unsigned iowait;\n  unsigned irq;\n  unsigned softirq;\n};\n\nstd::istream& operator>> (std::istream& in, ProcStat& p)\n{\n  in >> p.cpu >> p.user >> p.nice >> p.system >> p.idle >> p.iowait >> p.irq >> p.softirq;\n  return in;\n}\n\nstd::ostream& operator<< (std::ostream& out, ProcStat& p)\n{\n  out << p.cpu << ' ' << p.user << ' ' << p.nice << ' ' << p.system << ' ' << p.idle << ' ' << p.iowait << ' ' << p.irq << ' ' << p.softirq;\n  return out;\n}\n\nvoid operator<<= (cxxtools::SerializationInfo& si, const ProcStat& p)\n{\n  si.addMember(\"cpu\") <<= p.cpu;\n  si.addMember(\"user\") <<= p.user;\n  si.addMember(\"nice\") <<= p.nice;\n  si.addMember(\"system\") <<= p.system;\n  si.addMember(\"idle\") <<= p.idle;\n  si.addMember(\"iowait\") <<= p.iowait;\n  si.addMember(\"irq\") <<= p.irq;\n  si.addMember(\"softirq\") <<= p.softirq;\n}\n\nProcStat operator- (const ProcStat& p1, const ProcStat& p2)\n{\n  ProcStat p;\n  p.cpu       = p1.cpu;\n  p.user      = p1.user    - p2.user;\n  p.nice      = p1.nice    - p2.nice;\n  p.system    = p1.system  - p2.system;\n  p.idle      = p1.idle    - p2.idle;\n  p.iowait    = p1.iowait  - p2.iowait;\n  p.irq       = p1.irq     - p2.irq;\n  p.softirq   = p1.softirq - p2.softirq;\n  return p;\n}\n\nProcStat currentStat;\ncxxtools::Mutex statMutex;\n\nvoid statThread()\n{\n  ProcStat p0;\n  {\n    std::ifstream f(\"\/proc\/stat\");\n    f >> p0;\n  }\n\n  while (true)\n  {\n    cxxtools::Thread::sleep(1000);\n    std::ifstream f(\"\/proc\/stat\");\n    ProcStat p1;\n    f >> p1;\n    cxxtools::MutexLock lock(statMutex);\n    currentStat = p1 - p0;\n    p0 = p1;\n  }\n}\n\nclass MainResponder : public cxxtools::http::Responder\n{\n  public:\n    explicit MainResponder(cxxtools::http::Service& service)\n      : cxxtools::http::Responder(service)\n      { }\n\n    virtual void reply(std::ostream&, cxxtools::http::Request& request, cxxtools::http::Reply& reply);\n};\n\nvoid MainResponder::reply(std::ostream& out, cxxtools::http::Request& request, cxxtools::http::Reply& reply)\n{\n  reply.addHeader(\"Content-Type\", \"text\/html\");\n  out << \"<!DOCTYPE HTML PUBLIC \\\"-\/\/W3C\/\/DTD HTML 4.0 Transitional\/\/EN\\\">\\n\"\n         \"<html>\\n\"\n         \" <head>\\n\"\n         \"  <script type='text\/javascript'>\\n\"\n         \"    function getRequest()\\n\"\n         \"    {\\n\"\n         \"      try { return new XMLHttpRequest();                   } catch (e) { }\\n\"\n         \"      try { return new ActiveXObject(\\\"Msxml2.XMLHttp\\\");    } catch (e) { }\\n\"\n         \"      try { return new ActiveXObject(\\\"Microsoft.XMLHTTP\\\"); } catch (e) { }\\n\"\n         \"      return null;\\n\"\n         \"    }\\n\"\n         \"\\n\"\n         \"    function ajaxGet(url, fn)\\n\"\n         \"    {\\n\"\n         \"      request = getRequest();\\n\"\n         \"      request.open('GET', url);\\n\"\n         \"      request.onreadystatechange = function () {\\n\"\n         \"          if (request.readyState == 4)\\n\"\n         \"          {\\n\"\n         \"            if (request.status == 200)\\n\"\n         \"              fn(request);\\n\"\n         \"          }\\n\"\n         \"        }\\n\"\n         \"      request.send(null);\\n\"\n         \"    }\\n\"\n         \"\\n\"\n         \"    function updateStat()\\n\"\n         \"    {\\n\"\n         \"      ajaxGet('\/stat',\\n\"\n         \"        function(request)\\n\"\n         \"        {\\n\"\n         \"          var r = eval('(' + request.responseText + ')');\\n\"\n         \"          document.getElementById('cpu').innerHTML = r.cpu;\\n\"\n         \"          document.getElementById('user').innerHTML = r.user;\\n\"\n         \"          document.getElementById('nice').innerHTML = r.nice;\\n\"\n         \"          document.getElementById('system').innerHTML = r.system;\\n\"\n         \"          document.getElementById('idle').innerHTML = r.idle;\\n\"\n         \"          document.getElementById('iowait').innerHTML = r.iowait;\\n\"\n         \"          document.getElementById('irq').innerHTML = r.irq;\\n\"\n         \"          document.getElementById('softirq').innerHTML = r.softirq;\\n\"\n         \"          document.getElementById('user').innerHTML = r.user;\\n\"\n         \"        });\\n\"\n         \"    }\\n\"\n         \"\\n\"\n         \"    window.setInterval('updateStat()', 1000);\\n\"\n         \"   <\/script>\\n\"\n         \" <\/head>\\n\"\n         \"\\n\"\n         \" <body bgcolor='#FFFFFF'>\\n\"\n         \"\\n\"\n         \"  <table>\\n\"\n         \"   <tr><th>cpu<\/th><td id='cpu'><\/td><\/tr>\\n\"\n         \"   <tr><th>user<\/th><td id='user'><\/td><\/tr>\\n\"\n         \"   <tr><th>nice<\/th><td id='nice'><\/td><\/tr>\\n\"\n         \"   <tr><th>system<\/th><td id='system'><\/td><\/tr>\\n\"\n         \"   <tr><th>idle<\/th><td id='idle'><\/td><\/tr>\\n\"\n         \"   <tr><th>iowait<\/th><td id='iowait'><\/td><\/tr>\\n\"\n         \"   <tr><th>irq<\/th><td id='irq'><\/td><\/tr>\\n\"\n         \"   <tr><th>softirq<\/th><td id='softirq'><\/td><\/tr>\\n\"\n         \"  <\/table>\\n\"\n         \"\\n\"\n         \" <\/body>\\n\"\n         \"<\/html>\\n\";\n}\n\nclass StatResponder : public cxxtools::http::Responder\n{\n  public:\n    explicit StatResponder(cxxtools::http::Service& service)\n      : cxxtools::http::Responder(service)\n      { }\n\n    virtual void reply(std::ostream&, cxxtools::http::Request& request, cxxtools::http::Reply& reply);\n};\n\nvoid StatResponder::reply(std::ostream& out, cxxtools::http::Request& request, cxxtools::http::Reply& reply)\n{\n  cxxtools::MutexLock lock(statMutex);\n  reply.addHeader(\"Content-Type\", \"application\/json\");\n  cxxtools::JsonSerializer serializer(out);\n  serializer.serialize(currentStat);\n  serializer.finish();\n}\n\ntypedef cxxtools::http::CachedService<StatResponder> StatService;\ntypedef cxxtools::http::CachedService<MainResponder> MainService;\n\nint main(int argc, char* argv[])\n{\n  try\n  {\n    log_init();\n    cxxtools::Arg<std::string> listenIp(argc, argv, 'l');\n    cxxtools::Arg<unsigned short int> listenPort(argc, argv, 'p', 8001);\n    cxxtools::EventLoop loop;\n    cxxtools::http::Server server(loop, listenIp, listenPort);\n    MainService mainService;\n    StatService statService;\n    server.addService(\"\/\", mainService);\n    server.addService(\"\/stat\", statService);\n\n    cxxtools::AttachedThread thread(cxxtools::callable(statThread));\n    thread.start();\n    loop.run();\n  }\n  catch (const std::exception& e)\n  {\n    std::cerr << e.what() << std::endl;\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  \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#if !defined(REUSABLEARENABLOCK_INCLUDE_GUARD_1357924680)\n#define REUSABLEARENABLOCK_INCLUDE_GUARD_1357924680\n\n\n#include <xalanc\/PlatformSupport\/ArenaBlockBase.hpp>\n\n\n\n#include <xalanc\/Include\/XalanMemMgrAutoPtr.hpp>\n\n\n\nXALAN_CPP_NAMESPACE_BEGIN\n\n\n\ntemplate <class ObjectType,\n#if defined(XALAN_NO_DEFAULT_TEMPLATE_ARGUMENTS)\n         class SizeType>\n#else\n         class SizeType = unsigned short>\n#endif\nclass ReusableArenaBlock : public ArenaBlockBase<ObjectType, SizeType>\n{\n\npublic:\n\n    typedef ArenaBlockBase<ObjectType, SizeType>        BaseClassType;\n\n    typedef typename BaseClassType::size_type           size_type;\n\n    typedef ReusableArenaBlock<ObjectType, SizeType>    ThisType;\n\n    struct NextBlock\n    {\n        enum { VALID_OBJECT_STAMP = 0xffddffdd };\n\n        size_type       next;\n        const int       verificationStamp;\n        \n        NextBlock( size_type _next):\n            next(_next),\n            verificationStamp(VALID_OBJECT_STAMP)\n        {\n        }\n\n        bool\n        isValidFor( size_type  rightBorder ) const\n        {\n            return ( ( verificationStamp == int(VALID_OBJECT_STAMP)) &&\n                ( next <= rightBorder ) ) ? true : false ;\n        }\n\n        static NextBlock*\n        cast(void*  thePointer)\n        {\n            return reinterpret_cast<NextBlock*>(thePointer);\n        }\n\n        static const NextBlock*\n        cast(const void*    thePointer)\n        {\n            return reinterpret_cast<const NextBlock*>(thePointer);\n        }\n    };\n\n    \/*\n     * Construct an ArenaBlock of the specified size\n     * of objects.\n     *\n     * @param theBlockSize The size of the block (the\n     * number of objects it can contain).\n     *\/\n    ReusableArenaBlock(\n                MemoryManagerType&  theManager,\n                size_type           theBlockSize) :\n        BaseClassType(theManager, theBlockSize),\n        m_firstFreeBlock(0),\n        m_nextFreeBlock(0)\n\n    {\n        XALAN_STATIC_ASSERT(sizeof(ObjectType) >= sizeof(NextBlock));\n        \n        for( size_type i = 0; i < this->m_blockSize; ++i )\n        {\n            new (&this->m_objectBlock[i]) NextBlock(size_type(i + 1));\n        }\n    }\n\n    ~ReusableArenaBlock()\n    {\n        size_type removedObjects = 0;\n\n        for (size_type i = 0;\n                i < this->m_blockSize &&\n                removedObjects < this->m_objectCount;\n                    ++i)\n        {\n            NextBlock* const    pStruct =\n                NextBlock::cast(&this->m_objectBlock[i]);\n\n            if ( isOccupiedBlock(pStruct) )\n            {\n                this->m_objectBlock[i].~ObjectType();\n\n                ++removedObjects;\n            }\n        }\n    }\n\n    static ThisType*\n    create(\n                MemoryManagerType&  theManager,\n                size_type           theBlockSize)\n    {\n        ThisType* theInstance;\n\n        return XalanConstruct(\n                    theManager,\n                    theInstance,\n                    theManager,\n                    theBlockSize);\n    }\n\n    \/*\n     * Allocate a block.  Once the object is constructed, you must call\n     * commitAllocation().\n     *\n     * @return a pointer to the new block.\n     *\/\n    ObjectType*\n    allocateBlock()\n    {\n        if ( this->m_objectCount == this->m_blockSize )\n        {\n            assert ( this->m_firstFreeBlock == (this->m_blockSize + 1) );\n\n            return 0;\n        }\n        else\n        {\n            assert( this->m_objectCount < this->m_blockSize );\n\n            ObjectType*     theResult = 0;\n\n            assert ( this->m_firstFreeBlock <= this->m_blockSize );\n            assert ( this->m_nextFreeBlock <= this->m_blockSize );\n\n            \/\/ check if any part was allocated but not commited\n            if(this->m_firstFreeBlock != this->m_nextFreeBlock)\n            {\n                \/\/ return the previously allocated block and wait for a commit\n                theResult = this->m_objectBlock + this->m_firstFreeBlock;\n            }\n            else\n            {\n                theResult = this->m_objectBlock + this->m_firstFreeBlock;\n\n                assert(size_type(theResult - this->m_objectBlock) < this->m_blockSize);\n\n                this->m_nextFreeBlock = NextBlock::cast(theResult)->next;\n\n                assert(NextBlock::cast(theResult)->isValidFor(this->m_blockSize));\n                assert(this->m_nextFreeBlock <= this->m_blockSize);\n\n                ++this->m_objectCount;\n            }\n\n            return theResult;\n        }\n    }\n\n    \/*\n     * Commit the previous allocation.\n     *\n     * @param theBlock the address that was returned by allocateBlock()\n     *\/\n    void\n    commitAllocation(ObjectType* \/* theBlock *\/)\n    {\n        assert ( this->m_objectCount <= this->m_blockSize );\n\n        this->m_firstFreeBlock = this->m_nextFreeBlock;\n    }\n\n    \/*\n     * Destroy the object, and return the block to the free list.\n     * The behavior is undefined if the object pointed to is not\n     * owned by the block.\n     *\n     * @param theObject the address of the object.\n     *\/\n    void\n    destroyObject(ObjectType*   theObject)\n    {\n        assert(theObject != 0);\n\n        \/\/ check if any uncommited block is there, add it to the list\n        if ( this->m_firstFreeBlock != this->m_nextFreeBlock )\n        {\n            \/\/ Return it to the pool of free blocks\n            void* const     p = this->m_objectBlock + this->m_firstFreeBlock;\n\n            new (p) NextBlock(this->m_nextFreeBlock);\n\n            this->m_nextFreeBlock = this->m_firstFreeBlock;\n        }\n\n        assert(ownsObject(theObject) == true);\n        assert(shouldDestroyBlock(theObject));\n\n        XalanDestroy(*theObject);\n\n        new (theObject) NextBlock(this->m_firstFreeBlock);\n\n        m_firstFreeBlock =\n            this->m_nextFreeBlock =\n            size_type(theObject - this->m_objectBlock);\n\n        assert (this->m_firstFreeBlock <= this->m_blockSize);\n\n        --this->m_objectCount;\n    }\n\n    \/*\n     * Determine if this block owns the specified object.  Note\n     * that even if the object address is within our block, this\n     * call will return false if no object currently occupies the\n     * block.  See also ownsBlock().\n     *\n     * @param theObject the address of the object.\n     * @return true if we own the object, false if not.\n     *\/\n    bool\n    ownsObject(const ObjectType*    theObject) const\n    {\n        assert ( theObject != 0 );\n\n        return isOccupiedBlock(NextBlock::cast(theObject));\n    }\n\nprotected:\n\n    \/*\n     * Determine if the block should be destroyed.  Returns true,\n     * unless the object is on the free list.  The behavior is\n     * undefined if the object pointed to is not owned by the\n     * block.\n     *\n     * @param theObject the address of the object\n     * @return true if block should be destroyed, false if not.\n     *\/\n    bool\n    shouldDestroyBlock(const ObjectType*    theObject) const\n    {\n        assert(size_type(theObject - this->m_objectBlock) < this->m_blockSize);\n\n        return !isOnFreeList(theObject);\n    }\n\n    bool\n    isOccupiedBlock(const NextBlock*    block) const\n    {\n        assert( block !=0 );\n\n        return !(this->ownsBlock(reinterpret_cast<const ObjectType*>(block)) &&\n                 block->isValidFor(this->m_blockSize));\n    }\n\nprivate:\n\n    \/\/ Not implemented...\n    ReusableArenaBlock(const ReusableArenaBlock<ObjectType, SizeType>&);\n\n    ReusableArenaBlock<ObjectType, SizeType>&\n    operator=(const ReusableArenaBlock<ObjectType, SizeType>&);\n\n    bool\n    operator==(const ReusableArenaBlock<ObjectType, SizeType>&) const;\n\n\n    \/*\n     * Determine if the block is on the free list.  The behavior is\n     * undefined if the object pointed to is not owned by the\n     * block.\n     *\n     * @param theObject the address of the object\n     * @return true if block is on the free list, false if not.\n     *\/\n    bool\n    isOnFreeList(const ObjectType*  theObject) const\n    {\n        if ( this->m_objectCount == 0 )\n        {\n            return false;\n        }\n        else\n        {\n            ObjectType*     pRunPtr = this->m_objectBlock + this->m_firstFreeBlock;\n\n            for (size_type i = 0;\n                    i < this->m_blockSize - this->m_objectCount;\n                        ++i)\n            {\n                assert(this->ownsBlock(pRunPtr));\n\n                if (pRunPtr == theObject)\n                {\n                    return true;\n                }\n                else\n                {\n                    NextBlock* const    p = reinterpret_cast<NextBlock*>(pRunPtr);\n\n                    assert(p->isValidFor(this->m_blockSize));\n\n                    pRunPtr = this->m_objectBlock + p->next;\n                }\n            }\n\n            return false;\n        }\n    }\n\n    \/\/ Data members...\n    size_type   m_firstFreeBlock;\n\n    size_type   m_nextFreeBlock;\n};\n\n\n\nXALAN_CPP_NAMESPACE_END\n\n\n\n#endif  \/\/ !defined(REUSABLEARENABLOCK_INCLUDE_GUARD_1357924680)\n<commit_msg>Patch for XALANC-659.<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#if !defined(REUSABLEARENABLOCK_INCLUDE_GUARD_1357924680)\n#define REUSABLEARENABLOCK_INCLUDE_GUARD_1357924680\n\n\n#include <xalanc\/PlatformSupport\/ArenaBlockBase.hpp>\n\n\n\n#include <xalanc\/Include\/XalanMemMgrAutoPtr.hpp>\n\n\n\nXALAN_CPP_NAMESPACE_BEGIN\n\n\n\ntemplate <class ObjectType,\n#if defined(XALAN_NO_DEFAULT_TEMPLATE_ARGUMENTS)\n         class SizeType>\n#else\n         class SizeType = unsigned short>\n#endif\nclass ReusableArenaBlock : public ArenaBlockBase<ObjectType, SizeType>\n{\n\npublic:\n\n    typedef ArenaBlockBase<ObjectType, SizeType>        BaseClassType;\n\n    typedef typename BaseClassType::size_type           size_type;\n\n    typedef ReusableArenaBlock<ObjectType, SizeType>    ThisType;\n\n    struct NextBlock\n    {\n        enum { VALID_OBJECT_STAMP = 0xffddffdd };\n\n        size_type       next;\n        const int       verificationStamp;\n        \n        NextBlock( size_type _next):\n            next(_next),\n            verificationStamp(VALID_OBJECT_STAMP)\n        {\n        }\n\n        bool\n        isValidFor( size_type  rightBorder ) const\n        {\n            return ( ( verificationStamp == int(VALID_OBJECT_STAMP)) &&\n                ( next <= rightBorder ) ) ? true : false ;\n        }\n    };\n\n    \/*\n     * Construct an ArenaBlock of the specified size\n     * of objects.\n     *\n     * @param theBlockSize The size of the block (the\n     * number of objects it can contain).\n     *\/\n    ReusableArenaBlock(\n                MemoryManagerType&  theManager,\n                size_type           theBlockSize) :\n        BaseClassType(theManager, theBlockSize),\n        m_firstFreeBlock(0),\n        m_nextFreeBlock(0)\n\n    {\n        XALAN_STATIC_ASSERT(sizeof(ObjectType) >= sizeof(NextBlock));\n        \n        for( size_type i = 0; i < this->m_blockSize; ++i )\n        {\n            new (&this->m_objectBlock[i]) NextBlock(size_type(i + 1));\n        }\n    }\n\n    ~ReusableArenaBlock()\n    {\n        size_type removedObjects = 0;\n\n        for (size_type i = 0;\n                i < this->m_blockSize &&\n                removedObjects < this->m_objectCount;\n                    ++i)\n        {\n            if ( isOccupiedBlock(&this->m_objectBlock[i]) )\n            {\n                this->m_objectBlock[i].~ObjectType();\n\n                ++removedObjects;\n            }\n        }\n    }\n\n    static ThisType*\n    create(\n                MemoryManagerType&  theManager,\n                size_type           theBlockSize)\n    {\n        ThisType* theInstance;\n\n        return XalanConstruct(\n                    theManager,\n                    theInstance,\n                    theManager,\n                    theBlockSize);\n    }\n\n    \/*\n     * Allocate a block.  Once the object is constructed, you must call\n     * commitAllocation().\n     *\n     * @return a pointer to the new block.\n     *\/\n    ObjectType*\n    allocateBlock()\n    {\n        if ( this->m_objectCount == this->m_blockSize )\n        {\n            assert ( this->m_firstFreeBlock == (this->m_blockSize + 1) );\n\n            return 0;\n        }\n        else\n        {\n            assert( this->m_objectCount < this->m_blockSize );\n\n            ObjectType*     theResult = 0;\n\n            assert ( this->m_firstFreeBlock <= this->m_blockSize );\n            assert ( this->m_nextFreeBlock <= this->m_blockSize );\n\n            \/\/ check if any part was allocated but not commited\n            if(this->m_firstFreeBlock != this->m_nextFreeBlock)\n            {\n                \/\/ return the previously allocated block and wait for a commit\n                theResult = this->m_objectBlock + this->m_firstFreeBlock;\n            }\n            else\n            {\n                theResult = this->m_objectBlock + this->m_firstFreeBlock;\n\n                assert(size_type(theResult - this->m_objectBlock) < this->m_blockSize);\n\n                NextBlock* const    theBlock =\n                    reinterpret_cast<NextBlock*>(theResult);\n\n                this->m_nextFreeBlock = theBlock->next;\n\n                assert(theBlock->isValidFor(this->m_blockSize));\n                assert(this->m_nextFreeBlock <= this->m_blockSize);\n\n                ++this->m_objectCount;\n            }\n\n            return theResult;\n        }\n    }\n\n    \/*\n     * Commit the previous allocation.\n     *\n     * @param theBlock the address that was returned by allocateBlock()\n     *\/\n    void\n    commitAllocation(ObjectType* \/* theBlock *\/)\n    {\n        assert ( this->m_objectCount <= this->m_blockSize );\n\n        this->m_firstFreeBlock = this->m_nextFreeBlock;\n    }\n\n    \/*\n     * Destroy the object, and return the block to the free list.\n     * The behavior is undefined if the object pointed to is not\n     * owned by the block.\n     *\n     * @param theObject the address of the object.\n     *\/\n    void\n    destroyObject(ObjectType*   theObject)\n    {\n        assert(theObject != 0);\n\n        \/\/ check if any uncommited block is there, add it to the list\n        if ( this->m_firstFreeBlock != this->m_nextFreeBlock )\n        {\n            \/\/ Return it to the pool of free blocks\n            void* const     p = this->m_objectBlock + this->m_firstFreeBlock;\n\n            new (p) NextBlock(this->m_nextFreeBlock);\n\n            this->m_nextFreeBlock = this->m_firstFreeBlock;\n        }\n\n        assert(ownsObject(theObject) == true);\n        assert(shouldDestroyBlock(theObject));\n\n        XalanDestroy(*theObject);\n\n        new (theObject) NextBlock(this->m_firstFreeBlock);\n\n        m_firstFreeBlock =\n            this->m_nextFreeBlock =\n            size_type(theObject - this->m_objectBlock);\n\n        assert (this->m_firstFreeBlock <= this->m_blockSize);\n\n        --this->m_objectCount;\n    }\n\n    \/*\n     * Determine if this block owns the specified object.  Note\n     * that even if the object address is within our block, this\n     * call will return false if no object currently occupies the\n     * block.  See also ownsBlock().\n     *\n     * @param theObject the address of the object.\n     * @return true if we own the object, false if not.\n     *\/\n    bool\n    ownsObject(const ObjectType*    theObject) const\n    {\n        assert ( theObject != 0 );\n\n        return isOccupiedBlock(theObject);\n    }\n\nprotected:\n\n    \/*\n     * Determine if the block should be destroyed.  Returns true,\n     * unless the object is on the free list.  The behavior is\n     * undefined if the object pointed to is not owned by the\n     * block.\n     *\n     * @param theObject the address of the object\n     * @return true if block should be destroyed, false if not.\n     *\/\n    bool\n    shouldDestroyBlock(const ObjectType*    theObject) const\n    {\n        assert(size_type(theObject - this->m_objectBlock) < this->m_blockSize);\n\n        return !isOnFreeList(theObject);\n    }\n\n    bool\n    isOccupiedBlock(const ObjectType*    block) const\n    {\n        assert( block !=0 );\n\n        return !(this->ownsBlock(block) &&\n                 reinterpret_cast<const NextBlock*>(block)->isValidFor(this->m_blockSize));\n    }\n\nprivate:\n\n    \/\/ Not implemented...\n    ReusableArenaBlock(const ReusableArenaBlock<ObjectType, SizeType>&);\n\n    ReusableArenaBlock<ObjectType, SizeType>&\n    operator=(const ReusableArenaBlock<ObjectType, SizeType>&);\n\n    bool\n    operator==(const ReusableArenaBlock<ObjectType, SizeType>&) const;\n\n\n    \/*\n     * Determine if the block is on the free list.  The behavior is\n     * undefined if the object pointed to is not owned by the\n     * block.\n     *\n     * @param theObject the address of the object\n     * @return true if block is on the free list, false if not.\n     *\/\n    bool\n    isOnFreeList(const ObjectType*  theObject) const\n    {\n        if ( this->m_objectCount == 0 )\n        {\n            return false;\n        }\n        else\n        {\n            ObjectType*     pRunPtr = this->m_objectBlock + this->m_firstFreeBlock;\n\n            for (size_type i = 0;\n                    i < this->m_blockSize - this->m_objectCount;\n                        ++i)\n            {\n                assert(this->ownsBlock(pRunPtr));\n\n                if (pRunPtr == theObject)\n                {\n                    return true;\n                }\n                else\n                {\n                    NextBlock* const    p = reinterpret_cast<NextBlock*>(pRunPtr);\n\n                    assert(p->isValidFor(this->m_blockSize));\n\n                    pRunPtr = this->m_objectBlock + p->next;\n                }\n            }\n\n            return false;\n        }\n    }\n\n    \/\/ Data members...\n    size_type   m_firstFreeBlock;\n\n    size_type   m_nextFreeBlock;\n};\n\n\n\nXALAN_CPP_NAMESPACE_END\n\n\n\n#endif  \/\/ !defined(REUSABLEARENABLOCK_INCLUDE_GUARD_1357924680)\n<|endoftext|>"}
{"text":"<commit_before>\/*!\n * \\copy\n *     Copyright (c)  2009-2013, Cisco Systems\n *     All 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 *\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 *     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 *\n *\n * \\file\tcpu.cpp\n *\n * \\brief\tCPU compatibility detection\n *\n * \\date\t04\/29\/2009 Created\n *\n *************************************************************************************\n *\/\n#include <string.h>\n#ifdef ANDROID_NDK\n#include <cpu-features.h>\n#endif\n#ifdef APPLE_IOS\n#include <sys\/utsname.h>\n#endif\n#include \"cpu.h\"\n#include \"cpu_core.h\"\n\n\n\n#define    CPU_Vendor_AMD    \"AuthenticAMD\"\n#define    CPU_Vendor_INTEL  \"GenuineIntel\"\n#define    CPU_Vendor_CYRIX  \"CyrixInstead\"\n\n#if defined(X86_ASM)\n\nuint32_t WelsCPUFeatureDetect (int32_t* pNumberOfLogicProcessors) {\n  uint32_t uiCPU = 0;\n  uint32_t uiFeatureA = 0, uiFeatureB = 0, uiFeatureC = 0, uiFeatureD = 0;\n  int32_t  CacheLineSize = 0;\n  int8_t   chVendorName[16] = { 0 };\n  uint32_t uiMaxCpuidLevel = 0;\n\n  if (!WelsCPUIdVerify()) {\n    \/* cpuid is not supported in cpu *\/\n    return 0;\n  }\n\n  WelsCPUId (0, &uiFeatureA, (uint32_t*)&chVendorName[0], (uint32_t*)&chVendorName[8], (uint32_t*)&chVendorName[4]);\n  uiMaxCpuidLevel = uiFeatureA;\n  if (uiMaxCpuidLevel == 0) {\n    \/* maximum input value for basic cpuid information *\/\n    return 0;\n  }\n\n  WelsCPUId (1, &uiFeatureA, &uiFeatureB, &uiFeatureC, &uiFeatureD);\n  if ((uiFeatureD & 0x00800000) == 0) {\n    \/* Basic MMX technology is not support in cpu, mean nothing for us so return here *\/\n    return 0;\n  }\n\n  uiCPU = WELS_CPU_MMX;\n  if (uiFeatureD & 0x02000000) {\n    \/* SSE technology is identical to AMD MMX extensions *\/\n    uiCPU |= WELS_CPU_MMXEXT | WELS_CPU_SSE;\n  }\n  if (uiFeatureD & 0x04000000) {\n    \/* SSE2 support here *\/\n    uiCPU |= WELS_CPU_SSE2;\n  }\n  if (uiFeatureD & 0x00000001) {\n    \/* x87 FPU on-chip checking *\/\n    uiCPU |= WELS_CPU_FPU;\n  }\n  if (uiFeatureD & 0x00008000) {\n    \/* CMOV instruction checking *\/\n    uiCPU |= WELS_CPU_CMOV;\n  }\n  if ((!strcmp ((const char*)chVendorName, CPU_Vendor_INTEL)) ||\n      (!strcmp((const char*)chVendorName, CPU_Vendor_AMD)) ) {\t\/\/ confirmed_safe_unsafe_usage\n    if (uiFeatureD & 0x10000000) {\n      \/* Multi-Threading checking: contains of multiple logic processors *\/\n      uiCPU |= WELS_CPU_HTT;\n    }\n  }\n\n  if (uiFeatureC & 0x00000001) {\n    \/* SSE3 support here *\/\n    uiCPU |= WELS_CPU_SSE3;\n  }\n  if (uiFeatureC & 0x00000200) {\n    \/* SSSE3 support here *\/\n    uiCPU |= WELS_CPU_SSSE3;\n  }\n  if (uiFeatureC & 0x00080000) {\n    \/* SSE4.1 support here, 45nm Penryn processor *\/\n    uiCPU |= WELS_CPU_SSE41;\n  }\n  if (uiFeatureC & 0x00100000) {\n    \/* SSE4.2 support here, next generation Nehalem processor *\/\n    uiCPU |= WELS_CPU_SSE42;\n  }\n  if (WelsCPUSupportAVX (uiFeatureA, uiFeatureC)) {\n    \/* AVX supported *\/\n    uiCPU |= WELS_CPU_AVX;\n  }\n  if (WelsCPUSupportFMA (uiFeatureA, uiFeatureC)) {\n    \/* AVX FMA supported *\/\n    uiCPU |= WELS_CPU_FMA;\n  }\n  if (uiFeatureC & 0x02000000) {\n    \/* AES checking *\/\n    uiCPU |= WELS_CPU_AES;\n  }\n  if (uiFeatureC & 0x00400000) {\n    \/* MOVBE checking *\/\n    uiCPU |= WELS_CPU_MOVBE;\n  }\n\n  if( pNumberOfLogicProcessors != NULL ){\n    if( uiCPU & WELS_CPU_HTT){\n      *pNumberOfLogicProcessors = (uiFeatureB & 0x00ff0000) >> 16; \/\/ feature bits: 23-16 on returned EBX\n    } else {\n      *pNumberOfLogicProcessors = 0;\n    }\n    if( !strcmp((const char*)chVendorName, CPU_Vendor_INTEL) ){\n      if( uiMaxCpuidLevel >= 4 ){\n        uiFeatureC = 0;\n        WelsCPUId(0x4, &uiFeatureA, &uiFeatureB, &uiFeatureC, &uiFeatureD);\n        if( uiFeatureA != 0 ){\n          *pNumberOfLogicProcessors = ((uiFeatureA&0xfc000000)>>26) + 1;\n        }\n      }\n    }\n  }\n\n  WelsCPUId (0x80000000, &uiFeatureA, &uiFeatureB, &uiFeatureC, &uiFeatureD);\n\n  if ((!strcmp ((const char*)chVendorName, CPU_Vendor_AMD))\n      && (uiFeatureA >= 0x80000001)) {\t\/\/ confirmed_safe_unsafe_usage\n    WelsCPUId (0x80000001, &uiFeatureA, &uiFeatureB, &uiFeatureC, &uiFeatureD);\n    if (uiFeatureD & 0x00400000) {\n      uiCPU |= WELS_CPU_MMXEXT;\n    }\n    if (uiFeatureD & 0x80000000) {\n      uiCPU |= WELS_CPU_3DNOW;\n    }\n  }\n\n  if (!strcmp ((const char*)chVendorName, CPU_Vendor_INTEL)) {\t\/\/ confirmed_safe_unsafe_usage\n    int32_t  family, model;\n\n    WelsCPUId (1, &uiFeatureA, &uiFeatureB, &uiFeatureC, &uiFeatureD);\n    family = ((uiFeatureA >> 8) & 0xf) + ((uiFeatureA >> 20) & 0xff);\n    model  = ((uiFeatureA >> 4) & 0xf) + ((uiFeatureA >> 12) & 0xf0);\n\n    if ((family == 6) && (model == 9 || model == 13 || model == 14)) {\n      uiCPU &= ~ (WELS_CPU_SSE2 | WELS_CPU_SSE3);\n    }\n  }\n\n  \/\/ get cache line size\n  if ((!strcmp ((const char*)chVendorName, CPU_Vendor_INTEL))\n      || ! (strcmp ((const char*)chVendorName, CPU_Vendor_CYRIX))) {\t\/\/ confirmed_safe_unsafe_usage\n    WelsCPUId (1, &uiFeatureA, &uiFeatureB, &uiFeatureC, &uiFeatureD);\n\n    CacheLineSize = (uiFeatureB & 0xff00) >>\n                    5;\t\/\/ ((clflush_line_size >> 8) << 3), CLFLUSH_line_size * 8 = CacheLineSize_in_byte\n\n    if (CacheLineSize == 128) {\n      uiCPU |= WELS_CPU_CACHELINE_128;\n    } else if (CacheLineSize == 64) {\n      uiCPU |= WELS_CPU_CACHELINE_64;\n    } else if (CacheLineSize == 32) {\n      uiCPU |= WELS_CPU_CACHELINE_32;\n    } else if (CacheLineSize == 16) {\n      uiCPU |= WELS_CPU_CACHELINE_16;\n    }\n  }\n\n  return uiCPU;\n}\n\n\nvoid WelsCPURestore (const uint32_t kuiCPU) {\n  if (kuiCPU & (WELS_CPU_MMX | WELS_CPU_MMXEXT | WELS_CPU_3DNOW | WELS_CPU_3DNOWEXT)) {\n    WelsEmms();\n  }\n}\n\nvoid WelsXmmRegEmptyOp(void * pSrc) {\n}\n\n#elif defined(HAVE_NEON) \/\/For supporting both android platform and iOS platform\n#if defined(ANDROID_NDK)\nuint32_t WelsCPUFeatureDetect (int32_t* pNumberOfLogicProcessors)\n{\n  uint32_t         uiCPU = 0;\n  AndroidCpuFamily cpuFamily = ANDROID_CPU_FAMILY_UNKNOWN;\n  uint64_t         uiFeatures = 0;\n  cpuFamily = android_getCpuFamily();\n  if (cpuFamily == ANDROID_CPU_FAMILY_ARM)\t{\n    uiFeatures = android_getCpuFeatures();\n    if (uiFeatures & ANDROID_CPU_ARM_FEATURE_ARMv7){\n      uiCPU |= WELS_CPU_ARMv7;\n    }\n    if (uiFeatures & ANDROID_CPU_ARM_FEATURE_VFPv3){\n      uiCPU |= WELS_CPU_VFPv3;\n    }\n    if (uiFeatures & ANDROID_CPU_ARM_FEATURE_NEON){\n      uiCPU |= WELS_CPU_NEON;\n    }\n  }\n\n  if( pNumberOfLogicProcessors != NULL ){\n    *pNumberOfLogicProcessors = android_getCpuCount();\n  }\n\n  return uiCPU;\n}\n\n#elif defined(APPLE_IOS)\nuint32_t WelsCPUFeatureDetect (int32_t* pNumberOfLogicProcessors)\n{\n    uint32_t       uiCPU = 0;\n    struct utsname sSystemInfo;\n    uname (&sSystemInfo);\n\n    if ((0 != strcmp(sSystemInfo.machine, \"iPhone1,1\")) && \/\/iPhone 2G\n        (0 != strcmp(sSystemInfo.machine, \"iPhone1,2\")) && \/\/iPhone 3G\n        (0 != strcmp(sSystemInfo.machine, \"iPod1,1\")) &&   \/\/iPod 1G\n        (0 != strcmp(sSystemInfo.machine, \"iPod2,1\")))     \/\/iPod 2G\n    {\n        uiCPU |= WELS_CPU_ARMv7;\n        uiCPU |= WELS_CPU_VFPv3;\n        uiCPU |= WELS_CPU_NEON;\n    }\n    return uiCPU;\n}\n#else \/* HAVE_NEON enabled but no runtime detection *\/\nuint32_t WelsCPUFeatureDetect (int32_t* pNumberOfLogicProcessors) {\n  return 0;\n}\n#endif\n#else \/* Neither X86_ASM nor HAVE_NEON *\/\n\nuint32_t WelsCPUFeatureDetect (int32_t* pNumberOfLogicProcessors) {\n  return 0;\n}\n\n#endif\n\n\n<commit_msg>Add cpu feature detection for generic arm\/linux<commit_after>\/*!\n * \\copy\n *     Copyright (c)  2009-2013, Cisco Systems\n *     All 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 *\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 *     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 *\n *\n * \\file\tcpu.cpp\n *\n * \\brief\tCPU compatibility detection\n *\n * \\date\t04\/29\/2009 Created\n *\n *************************************************************************************\n *\/\n#include <string.h>\n#include <stdio.h>\n#ifdef ANDROID_NDK\n#include <cpu-features.h>\n#endif\n#ifdef APPLE_IOS\n#include <sys\/utsname.h>\n#endif\n#include \"cpu.h\"\n#include \"cpu_core.h\"\n\n\n\n#define    CPU_Vendor_AMD    \"AuthenticAMD\"\n#define    CPU_Vendor_INTEL  \"GenuineIntel\"\n#define    CPU_Vendor_CYRIX  \"CyrixInstead\"\n\n#if defined(X86_ASM)\n\nuint32_t WelsCPUFeatureDetect (int32_t* pNumberOfLogicProcessors) {\n  uint32_t uiCPU = 0;\n  uint32_t uiFeatureA = 0, uiFeatureB = 0, uiFeatureC = 0, uiFeatureD = 0;\n  int32_t  CacheLineSize = 0;\n  int8_t   chVendorName[16] = { 0 };\n  uint32_t uiMaxCpuidLevel = 0;\n\n  if (!WelsCPUIdVerify()) {\n    \/* cpuid is not supported in cpu *\/\n    return 0;\n  }\n\n  WelsCPUId (0, &uiFeatureA, (uint32_t*)&chVendorName[0], (uint32_t*)&chVendorName[8], (uint32_t*)&chVendorName[4]);\n  uiMaxCpuidLevel = uiFeatureA;\n  if (uiMaxCpuidLevel == 0) {\n    \/* maximum input value for basic cpuid information *\/\n    return 0;\n  }\n\n  WelsCPUId (1, &uiFeatureA, &uiFeatureB, &uiFeatureC, &uiFeatureD);\n  if ((uiFeatureD & 0x00800000) == 0) {\n    \/* Basic MMX technology is not support in cpu, mean nothing for us so return here *\/\n    return 0;\n  }\n\n  uiCPU = WELS_CPU_MMX;\n  if (uiFeatureD & 0x02000000) {\n    \/* SSE technology is identical to AMD MMX extensions *\/\n    uiCPU |= WELS_CPU_MMXEXT | WELS_CPU_SSE;\n  }\n  if (uiFeatureD & 0x04000000) {\n    \/* SSE2 support here *\/\n    uiCPU |= WELS_CPU_SSE2;\n  }\n  if (uiFeatureD & 0x00000001) {\n    \/* x87 FPU on-chip checking *\/\n    uiCPU |= WELS_CPU_FPU;\n  }\n  if (uiFeatureD & 0x00008000) {\n    \/* CMOV instruction checking *\/\n    uiCPU |= WELS_CPU_CMOV;\n  }\n  if ((!strcmp ((const char*)chVendorName, CPU_Vendor_INTEL)) ||\n      (!strcmp((const char*)chVendorName, CPU_Vendor_AMD)) ) {\t\/\/ confirmed_safe_unsafe_usage\n    if (uiFeatureD & 0x10000000) {\n      \/* Multi-Threading checking: contains of multiple logic processors *\/\n      uiCPU |= WELS_CPU_HTT;\n    }\n  }\n\n  if (uiFeatureC & 0x00000001) {\n    \/* SSE3 support here *\/\n    uiCPU |= WELS_CPU_SSE3;\n  }\n  if (uiFeatureC & 0x00000200) {\n    \/* SSSE3 support here *\/\n    uiCPU |= WELS_CPU_SSSE3;\n  }\n  if (uiFeatureC & 0x00080000) {\n    \/* SSE4.1 support here, 45nm Penryn processor *\/\n    uiCPU |= WELS_CPU_SSE41;\n  }\n  if (uiFeatureC & 0x00100000) {\n    \/* SSE4.2 support here, next generation Nehalem processor *\/\n    uiCPU |= WELS_CPU_SSE42;\n  }\n  if (WelsCPUSupportAVX (uiFeatureA, uiFeatureC)) {\n    \/* AVX supported *\/\n    uiCPU |= WELS_CPU_AVX;\n  }\n  if (WelsCPUSupportFMA (uiFeatureA, uiFeatureC)) {\n    \/* AVX FMA supported *\/\n    uiCPU |= WELS_CPU_FMA;\n  }\n  if (uiFeatureC & 0x02000000) {\n    \/* AES checking *\/\n    uiCPU |= WELS_CPU_AES;\n  }\n  if (uiFeatureC & 0x00400000) {\n    \/* MOVBE checking *\/\n    uiCPU |= WELS_CPU_MOVBE;\n  }\n\n  if( pNumberOfLogicProcessors != NULL ){\n    if( uiCPU & WELS_CPU_HTT){\n      *pNumberOfLogicProcessors = (uiFeatureB & 0x00ff0000) >> 16; \/\/ feature bits: 23-16 on returned EBX\n    } else {\n      *pNumberOfLogicProcessors = 0;\n    }\n    if( !strcmp((const char*)chVendorName, CPU_Vendor_INTEL) ){\n      if( uiMaxCpuidLevel >= 4 ){\n        uiFeatureC = 0;\n        WelsCPUId(0x4, &uiFeatureA, &uiFeatureB, &uiFeatureC, &uiFeatureD);\n        if( uiFeatureA != 0 ){\n          *pNumberOfLogicProcessors = ((uiFeatureA&0xfc000000)>>26) + 1;\n        }\n      }\n    }\n  }\n\n  WelsCPUId (0x80000000, &uiFeatureA, &uiFeatureB, &uiFeatureC, &uiFeatureD);\n\n  if ((!strcmp ((const char*)chVendorName, CPU_Vendor_AMD))\n      && (uiFeatureA >= 0x80000001)) {\t\/\/ confirmed_safe_unsafe_usage\n    WelsCPUId (0x80000001, &uiFeatureA, &uiFeatureB, &uiFeatureC, &uiFeatureD);\n    if (uiFeatureD & 0x00400000) {\n      uiCPU |= WELS_CPU_MMXEXT;\n    }\n    if (uiFeatureD & 0x80000000) {\n      uiCPU |= WELS_CPU_3DNOW;\n    }\n  }\n\n  if (!strcmp ((const char*)chVendorName, CPU_Vendor_INTEL)) {\t\/\/ confirmed_safe_unsafe_usage\n    int32_t  family, model;\n\n    WelsCPUId (1, &uiFeatureA, &uiFeatureB, &uiFeatureC, &uiFeatureD);\n    family = ((uiFeatureA >> 8) & 0xf) + ((uiFeatureA >> 20) & 0xff);\n    model  = ((uiFeatureA >> 4) & 0xf) + ((uiFeatureA >> 12) & 0xf0);\n\n    if ((family == 6) && (model == 9 || model == 13 || model == 14)) {\n      uiCPU &= ~ (WELS_CPU_SSE2 | WELS_CPU_SSE3);\n    }\n  }\n\n  \/\/ get cache line size\n  if ((!strcmp ((const char*)chVendorName, CPU_Vendor_INTEL))\n      || ! (strcmp ((const char*)chVendorName, CPU_Vendor_CYRIX))) {\t\/\/ confirmed_safe_unsafe_usage\n    WelsCPUId (1, &uiFeatureA, &uiFeatureB, &uiFeatureC, &uiFeatureD);\n\n    CacheLineSize = (uiFeatureB & 0xff00) >>\n                    5;\t\/\/ ((clflush_line_size >> 8) << 3), CLFLUSH_line_size * 8 = CacheLineSize_in_byte\n\n    if (CacheLineSize == 128) {\n      uiCPU |= WELS_CPU_CACHELINE_128;\n    } else if (CacheLineSize == 64) {\n      uiCPU |= WELS_CPU_CACHELINE_64;\n    } else if (CacheLineSize == 32) {\n      uiCPU |= WELS_CPU_CACHELINE_32;\n    } else if (CacheLineSize == 16) {\n      uiCPU |= WELS_CPU_CACHELINE_16;\n    }\n  }\n\n  return uiCPU;\n}\n\n\nvoid WelsCPURestore (const uint32_t kuiCPU) {\n  if (kuiCPU & (WELS_CPU_MMX | WELS_CPU_MMXEXT | WELS_CPU_3DNOW | WELS_CPU_3DNOWEXT)) {\n    WelsEmms();\n  }\n}\n\nvoid WelsXmmRegEmptyOp(void * pSrc) {\n}\n\n#elif defined(HAVE_NEON) \/\/For supporting both android platform and iOS platform\n#if defined(ANDROID_NDK)\nuint32_t WelsCPUFeatureDetect (int32_t* pNumberOfLogicProcessors)\n{\n  uint32_t         uiCPU = 0;\n  AndroidCpuFamily cpuFamily = ANDROID_CPU_FAMILY_UNKNOWN;\n  uint64_t         uiFeatures = 0;\n  cpuFamily = android_getCpuFamily();\n  if (cpuFamily == ANDROID_CPU_FAMILY_ARM)\t{\n    uiFeatures = android_getCpuFeatures();\n    if (uiFeatures & ANDROID_CPU_ARM_FEATURE_ARMv7){\n      uiCPU |= WELS_CPU_ARMv7;\n    }\n    if (uiFeatures & ANDROID_CPU_ARM_FEATURE_VFPv3){\n      uiCPU |= WELS_CPU_VFPv3;\n    }\n    if (uiFeatures & ANDROID_CPU_ARM_FEATURE_NEON){\n      uiCPU |= WELS_CPU_NEON;\n    }\n  }\n\n  if( pNumberOfLogicProcessors != NULL ){\n    *pNumberOfLogicProcessors = android_getCpuCount();\n  }\n\n  return uiCPU;\n}\n\n#elif defined(APPLE_IOS)\nuint32_t WelsCPUFeatureDetect (int32_t* pNumberOfLogicProcessors)\n{\n    uint32_t       uiCPU = 0;\n    struct utsname sSystemInfo;\n    uname (&sSystemInfo);\n\n    if ((0 != strcmp(sSystemInfo.machine, \"iPhone1,1\")) && \/\/iPhone 2G\n        (0 != strcmp(sSystemInfo.machine, \"iPhone1,2\")) && \/\/iPhone 3G\n        (0 != strcmp(sSystemInfo.machine, \"iPod1,1\")) &&   \/\/iPod 1G\n        (0 != strcmp(sSystemInfo.machine, \"iPod2,1\")))     \/\/iPod 2G\n    {\n        uiCPU |= WELS_CPU_ARMv7;\n        uiCPU |= WELS_CPU_VFPv3;\n        uiCPU |= WELS_CPU_NEON;\n    }\n    return uiCPU;\n}\n#elif defined(__linux__)\n\n\/* Generic arm\/linux cpu feature detection *\/\nuint32_t WelsCPUFeatureDetect (int32_t* pNumberOfLogicProcessors) {\n  FILE *f = fopen(\"\/proc\/cpuinfo\", \"r\");\n\n  if (!f)\n    return 0;\n\n  char buf[200];\n  int flags = 0;\n  while (fgets(buf, sizeof(buf), f)) {\n    if (!strncmp(buf, \"Features\", strlen(\"Features\"))) {\n      if (strstr(buf, \" neon \"))\n        flags |= WELS_CPU_NEON;\n      if (strstr(buf, \" vfpv3 \"))\n        flags |= WELS_CPU_VFPv3;\n      break;\n    }\n  }\n  fclose(f);\n  return flags;\n}\n\n#else \/* HAVE_NEON enabled but no runtime detection *\/\n\n\/* No runtime feature detection available, but built with HAVE_NEON - assume\n * that NEON and all associated features are available. *\/\n\nuint32_t WelsCPUFeatureDetect (int32_t* pNumberOfLogicProcessors) {\n  return WELS_CPU_ARMv7 |\n         WELS_CPU_VFPv3 |\n         WELS_CPU_NEON;\n}\n#endif\n#else \/* Neither X86_ASM nor HAVE_NEON *\/\n\nuint32_t WelsCPUFeatureDetect (int32_t* pNumberOfLogicProcessors) {\n  return 0;\n}\n\n#endif\n\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef CPPJIEBA_QUERYSEGMENT_H\n#define CPPJIEBA_QUERYSEGMENT_H\n\n#include <algorithm>\n#include <set>\n#include <cassert>\n#include \"Limonp\/logger.hpp\"\n#include \"Trie.hpp\"\n#include \"ISegment.hpp\"\n#include \"SegmentBase.hpp\"\n#include \"FullSegment.hpp\"\n#include \"MixSegment.hpp\"\n#include \"TransCode.hpp\"\n#include \"TrieManager.hpp\"\n\nnamespace CppJieba\n{\n    class QuerySegment: public SegmentBase\n    {\n    private:\n        MixSegment _mixSeg;\n        FullSegment _fullSeg;\n        int _maxWordLen;\n\n    public:\n        QuerySegment(const char* dict, const char* model, int maxWordLen): _mixSeg(dict, model), _fullSeg(dict), _maxWordLen(maxWordLen){};\n        virtual ~QuerySegment(){dispose();};\n    public:\n        bool init()\n        {\n            if (_getInitFlag())\n            {\n                LogError(\"inited.\");\n            }\n            if (!_mixSeg.init())\n            {\n                LogError(\"_mixSeg init\");\n                return false;\n            }\n            if (!_fullSeg.init())\n            {\n                LogError(\"_fullSeg init\");\n                return false;\n            }\n            return _setInitFlag(true);\n        }\n        bool dispose()\n        {\n            if(!_getInitFlag())\n            {\n                return true;\n            }\n            _fullSeg.dispose();\n            _mixSeg.dispose();\n            _setInitFlag(false);\n            return true;\n        }\n\n    public:\n        using SegmentBase::cut;\n\n    public:\n        bool cut(Unicode::const_iterator begin, Unicode::const_iterator end, vector<Unicode>& res) const\n        {\n            assert(_getInitFlag());\n            if (begin >= end)\n            {\n                LogError(\"begin >= end\");\n                return false;\n            }\n\n            \/\/use mix cut first\n            vector<Unicode> mixRes;\n            if (!_mixSeg.cut(begin, end, mixRes))\n            {\n                LogError(\"_mixSeg cut failed.\");\n                return false;\n            }\n\n            vector<Unicode> fullRes;\n            for (vector<Unicode>::const_iterator mixResItr = mixRes.begin(); mixResItr != mixRes.end(); mixResItr++)\n            {\n                \n                \/\/ if it's too long, cut with _fullSeg, put fullRes in res\n                if (mixResItr->size() > _maxWordLen)\n                {\n                    if (_fullSeg.cut(mixResItr->begin(), mixResItr->end(), fullRes))\n                    {\n                       for (vector<Unicode>::const_iterator fullResItr = fullRes.begin(); fullResItr != fullRes.end(); fullResItr++)\n                       {\n                           res.push_back(*fullResItr);\n                       }\n                    }\n\n                    \/\/clear fullRes\n                    fullRes.clear();\n                }\n                else \/\/ just use the mix result\n                {\n                    res.push_back(*mixResItr);\n                }\n            }\n\n            return true;\n        }\n\n\n        bool cut(Unicode::const_iterator begin, Unicode::const_iterator end, vector<string>& res) const\n        {\n            assert(_getInitFlag());\n            if (begin >= end)\n            {\n                LogError(\"begin >= end\");\n                return false;\n            }\n\n            vector<Unicode> uRes;\n            if (!cut(begin, end, uRes))\n            {\n                LogError(\"get unicode cut result error.\");\n                return false;\n            }\n\n            string tmp;\n            for (vector<Unicode>::const_iterator uItr = uRes.begin(); uItr != uRes.end(); uItr++)\n            {\n                if (TransCode::encode(*uItr, tmp))\n                {\n                    res.push_back(tmp);\n                }\n                else\n                {\n                    LogError(\"encode failed.\");\n                }\n            }\n\n            return true;\n        }\n    };\n}\n\n#endif\n<commit_msg>fix a little bug in QuerySegment.hpp<commit_after>#ifndef CPPJIEBA_QUERYSEGMENT_H\n#define CPPJIEBA_QUERYSEGMENT_H\n\n#include <algorithm>\n#include <set>\n#include <cassert>\n#include \"Limonp\/logger.hpp\"\n#include \"Trie.hpp\"\n#include \"ISegment.hpp\"\n#include \"SegmentBase.hpp\"\n#include \"FullSegment.hpp\"\n#include \"MixSegment.hpp\"\n#include \"TransCode.hpp\"\n#include \"TrieManager.hpp\"\n\nnamespace CppJieba\n{\n    class QuerySegment: public SegmentBase\n    {\n    private:\n        MixSegment _mixSeg;\n        FullSegment _fullSeg;\n        int _maxWordLen;\n\n    public:\n        QuerySegment(const char* dict, const char* model, int maxWordLen): _mixSeg(dict, model), _fullSeg(dict), _maxWordLen(maxWordLen){};\n        virtual ~QuerySegment(){dispose();};\n    public:\n        bool init()\n        {\n            if (_getInitFlag())\n            {\n                LogError(\"inited.\");\n                return false;\n            }\n            if (!_mixSeg.init())\n            {\n                LogError(\"_mixSeg init\");\n                return false;\n            }\n            if (!_fullSeg.init())\n            {\n                LogError(\"_fullSeg init\");\n                return false;\n            }\n            return _setInitFlag(true);\n        }\n        bool dispose()\n        {\n            if(!_getInitFlag())\n            {\n                return true;\n            }\n            _fullSeg.dispose();\n            _mixSeg.dispose();\n            _setInitFlag(false);\n            return true;\n        }\n\n    public:\n        using SegmentBase::cut;\n\n    public:\n        bool cut(Unicode::const_iterator begin, Unicode::const_iterator end, vector<Unicode>& res) const\n        {\n            assert(_getInitFlag());\n            if (begin >= end)\n            {\n                LogError(\"begin >= end\");\n                return false;\n            }\n\n            \/\/use mix cut first\n            vector<Unicode> mixRes;\n            if (!_mixSeg.cut(begin, end, mixRes))\n            {\n                LogError(\"_mixSeg cut failed.\");\n                return false;\n            }\n\n            vector<Unicode> fullRes;\n            for (vector<Unicode>::const_iterator mixResItr = mixRes.begin(); mixResItr != mixRes.end(); mixResItr++)\n            {\n                \n                \/\/ if it's too long, cut with _fullSeg, put fullRes in res\n                if (mixResItr->size() > _maxWordLen)\n                {\n                    if (_fullSeg.cut(mixResItr->begin(), mixResItr->end(), fullRes))\n                    {\n                       for (vector<Unicode>::const_iterator fullResItr = fullRes.begin(); fullResItr != fullRes.end(); fullResItr++)\n                       {\n                           res.push_back(*fullResItr);\n                       }\n                    }\n\n                    \/\/clear fullRes\n                    fullRes.clear();\n                }\n                else \/\/ just use the mix result\n                {\n                    res.push_back(*mixResItr);\n                }\n            }\n\n            return true;\n        }\n\n\n        bool cut(Unicode::const_iterator begin, Unicode::const_iterator end, vector<string>& res) const\n        {\n            assert(_getInitFlag());\n            if (begin >= end)\n            {\n                LogError(\"begin >= end\");\n                return false;\n            }\n\n            vector<Unicode> uRes;\n            if (!cut(begin, end, uRes))\n            {\n                LogError(\"get unicode cut result error.\");\n                return false;\n            }\n\n            string tmp;\n            for (vector<Unicode>::const_iterator uItr = uRes.begin(); uItr != uRes.end(); uItr++)\n            {\n                if (TransCode::encode(*uItr, tmp))\n                {\n                    res.push_back(tmp);\n                }\n                else\n                {\n                    LogError(\"encode failed.\");\n                }\n            }\n\n            return true;\n        }\n    };\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include <stdio.h>\n#include <stdlib.h>\n#include <graphics.h>\n#include <conio.h>\n#include <string.h>\n#include \"global.h\"\n#include \"passenger.h\"\n#include \"window.h\"\n\n\n#define BOX_WIDTH\t200\n#define BOX_HEGIHT\t70\n\n int NumOfWin;\t\t\t\/\/1.ͨĿ\n int NumOfVIPWin;\t\t\/\/2.VIPĿ\n int MinCheck;\t\t\t\/\/3.ٿŰ\n int MaxCustCheck;\t\t\/\/4.ڶ󳤶\n int MinRestSec;\t\t\/\/5.СϢʱ\n int MaxRestSec;\t\t\/\/6.Ϣʱ\n int MaxSec;\t\t\t\/\/7.󰲼ʱ λ\n int MinSec;\t\t\t\/\/8.Сʱ λ\n int MaxCustSingleLine;\t\/\/9.˿\n int MaxLines;\t\t\t\/\/10.λMaxLinesֱ\n int MaxSeqLen;\t\t\t\/\/11.ȴ\n int EasySeqLen;\t\t\/\/12.ڵȴ\n\nint ParaData()\n{\n\tFILE * fp; \/\/ļָ\n\tif ((fp = fopen(\"para.dat\", \"rb\")) == NULL) \/\/ֻʽļpara.dat\n\t{\n\t\tprintf(\"Error! Can not open para.dat!\\n\");  \/\/޷򿪣򱨴\n\t\texit(EXIT_FAILURE);\n\t}\n\tfseek(fp, 0, SEEK_SET); \/\/ļָļͷ\n\t\/\/ļȡ\n\tfread(&NumOfWin, sizeof(int), 1, fp);\n\tfread(&NumOfVIPWin, sizeof(int), 1, fp);\n\tfread(&MinCheck, sizeof(int), 1, fp);\n\tfread(&MaxCustCheck, sizeof(int), 1, fp);\n\tfread(&MaxRestSec, sizeof(int), 1, fp);\n\tfread(&MinRestSec, sizeof(int), 1, fp);\n\tfread(&MaxSec, sizeof(int), 1, fp);\n\tfread(&MinSec, sizeof(int), 1, fp);\n\tfread(&MaxCustSingleLine, sizeof(int), 1, fp);\n\tfread(&MaxLines, sizeof(int), 1, fp);\n\tfread(&MaxSeqLen, sizeof(int), 1, fp);\n\tfread(&EasySeqLen, sizeof(int), 1, fp);\n\tfclose(fp);\/\/رļָ\n}\n\nvoid PrintPara(int *NumOfData,TCHAR StrNumOfData[],TCHAR *tems) {\n\t\n\tIMAGE airport;\n\n\tTCHAR OriginalStr[12][50] = {\n\t\t\"1.ͨĿ:\",\n\t\t\"2.VIPĿ:\",\n\t\t\"3.ٿŰ:\",\n\t\t\"4.ڶ󳤶:\",\n\t\t\"5.СϢʱ:\",\n\t\t\"6.Ϣʱ:\",\n\t\t\"7.󰲼ʱ:\",\n\t\t\"8.Сʱ:\",\n\t\t\"9.˿:\",\n\t\t\"10.λֱ:\",\n\t\t\"11.ȴ:\",\n\t\t\"12.ڵȴ:\",\n\t};\n\n\tloadimage(&airport, _T(\"ļ.jpg\"), WINDOWS_X, WINDOWS_Y);\n\tputimage(0, 0, &airport);\n\tfor (int i = 0; i < 12; i++) {\n\t\tif (i < 6) {\n\t\t\titoa(NumOfData[i], StrNumOfData, 10);\n\t\t\tlstrcpy(tems, OriginalStr[i]);\n\t\t\tlstrcat(tems, StrNumOfData);\n\t\t\tdrawButton(200, 50 + 80 * i, BOX_WIDTH, BOX_HEGIHT, tems);\n\t\t}\n\t\telse {\n\t\t\titoa(NumOfData[i], StrNumOfData, 10);\n\t\t\tlstrcpy(tems, OriginalStr[i]);\n\t\t\tlstrcat(tems, StrNumOfData);\n\t\t\tdrawButton(740, 50 + 80 * (i - 6), BOX_WIDTH, BOX_HEGIHT, tems);\n\t\t}\n\t}\n\tdrawButton(250, 600 ,100 ,50 , \"\");\n\tdrawButton(790, 600, 100, 50, \"ʼ\");\n}\n\nvoid MainPara() {\n\n\tint NumOfData[12];\n\n\tNumOfData[0] = NumOfWin;\n\tNumOfData[1] = NumOfVIPWin;\n\tNumOfData[2] = MinCheck;\n\tNumOfData[3] = MaxCustCheck;\n\tNumOfData[4] = MaxRestSec;\n\tNumOfData[5] = MinRestSec;\n\tNumOfData[6] = MaxSec;\n\tNumOfData[7] = MinSec;\n\tNumOfData[8] = MaxCustSingleLine;\n\tNumOfData[9] = MaxLines;\n\tNumOfData[10] = MaxSeqLen;\n\tNumOfData[11] = EasySeqLen;\n\t\n\n\tTCHAR StrNumOfData[5];\n\t\n\tTCHAR temNum[5]; \/\/޸ĵַ\n\tTCHAR tems[30];\n\n\tPrintPara(NumOfData,StrNumOfData,tems);\n\n\tFILE * fp; \/\/ļָ\n\tif ((fp = fopen(\"para.dat\", \"rb+\")) == NULL) \/\/ֻʽļpara.dat\n\t{\n\t\tprintf(\"Error! Can not open para.dat!\\n\");  \/\/޷򿪣򱨴\n\t\texit(EXIT_FAILURE);\n\t}\n\tfseek(fp, 0, SEEK_SET); \/\/ļָļͷ\n\n\t\n\tMOUSEMSG msg;\n\twhile (true) {\n\t\tif (MouseHit())\/\/ Ϣʱִ\n\t\t{\n\t\t\tmsg = GetMouseMsg();\n\t\t\tif (msg.uMsg == WM_LBUTTONDOWN) {\n\t\t\t\tif (judgeButton(msg.x, msg.y, 200, 50, BOX_WIDTH, BOX_HEGIHT)) {\n\t\t\t\t\tInputBox(temNum, 3, \"Ҫ޸ĵֵ:\");\n\t\t\t\t\tNumOfWin = _ttoi(temNum);\n\t\t\t\t\tNumOfData[0] = NumOfWin;\n\t\t\t\t\tPrintPara(NumOfData, StrNumOfData, tems);\n\t\t\t\t\tfseek(fp, sizeof(int) * 0, SEEK_SET);\n\t\t\t\t\tfwrite(&NumOfWin, sizeof(int), 1, fp);\n\t\t\t\t}\n\t\t\t\tif (judgeButton(msg.x, msg.y, 200, 130, BOX_WIDTH, BOX_HEGIHT)) {\n\t\t\t\t\tInputBox(temNum, 3, \"Ҫ޸ĵֵ:\");\n\t\t\t\t\tNumOfVIPWin = _ttoi(temNum);\n\t\t\t\t\tNumOfData[1] = NumOfVIPWin;\n\t\t\t\t\tPrintPara(NumOfData, StrNumOfData, tems);\n\t\t\t\t\tfseek(fp, sizeof(int) * 1, SEEK_SET);\n\t\t\t\t\tfwrite(&NumOfVIPWin, sizeof(int), 1, fp);\n\t\t\t\t}\n\t\t\t\tif (judgeButton(msg.x, msg.y, 200, 210, BOX_WIDTH, BOX_HEGIHT)) {\n\t\t\t\t\tInputBox(temNum, 3, \"Ҫ޸ĵֵ:\");\n\t\t\t\t\tMinCheck = _ttoi(temNum);\n\t\t\t\t\tNumOfData[2] = MinCheck;\n\t\t\t\t\tPrintPara(NumOfData, StrNumOfData, tems);\n\t\t\t\t\tfseek(fp, sizeof(int) * 2, SEEK_SET);\n\t\t\t\t\tfwrite(&MinCheck, sizeof(int), 1, fp);\n\t\t\t\t}\n\t\t\t\tif (judgeButton(msg.x, msg.y, 200, 290, BOX_WIDTH, BOX_HEGIHT)) {\n\t\t\t\t\tInputBox(temNum, 3, \"Ҫ޸ĵֵ:\");\n\t\t\t\t\tMaxCustCheck = _ttoi(temNum);\n\t\t\t\t\tNumOfData[3] = MaxCustCheck;\n\t\t\t\t\tPrintPara(NumOfData, StrNumOfData, tems);\n\t\t\t\t\tfseek(fp, sizeof(int) * 3, SEEK_SET);\n\t\t\t\t\tfwrite(&MaxCustCheck, sizeof(int), 1, fp);\n\t\t\t\t}\n\t\t\t\tif (judgeButton(msg.x, msg.y, 200, 370, BOX_WIDTH, BOX_HEGIHT)) {\n\t\t\t\t\tInputBox(temNum, 3, \"Ҫ޸ĵֵ:\");\n\t\t\t\t\tMaxRestSec = _ttoi(temNum);\n\t\t\t\t\tNumOfData[4] = MaxRestSec;\n\t\t\t\t\tPrintPara(NumOfData, StrNumOfData, tems);\n\t\t\t\t\tfseek(fp, sizeof(int) * 4, SEEK_SET);\n\t\t\t\t\tfwrite(&MaxRestSec, sizeof(int), 1, fp);\n\t\t\t\t}\n\t\t\t\tif (judgeButton(msg.x, msg.y, 200, 450, BOX_WIDTH, BOX_HEGIHT)) {\n\t\t\t\t\tInputBox(temNum, 3, \"Ҫ޸ĵֵ:\");\n\t\t\t\t\tMinRestSec = _ttoi(temNum);\n\t\t\t\t\tNumOfData[5] = MinRestSec;\n\t\t\t\t\tPrintPara(NumOfData, StrNumOfData, tems);\n\t\t\t\t\tfseek(fp, sizeof(int) * 5, SEEK_SET);\n\t\t\t\t\tfwrite(&MinRestSec, sizeof(int), 1, fp);\n\t\t\t\t}\n\t\t\t\tif (judgeButton(msg.x, msg.y, 740, 50, BOX_WIDTH, BOX_HEGIHT)) {\n\t\t\t\t\tInputBox(temNum, 3, \"Ҫ޸ĵֵ:\");\n\t\t\t\t\tMaxSec = _ttoi(temNum);\n\t\t\t\t\tNumOfData[6] = MaxSec;\n\t\t\t\t\tPrintPara(NumOfData, StrNumOfData, tems);\n\t\t\t\t\tfseek(fp, sizeof(int) * 6, SEEK_SET);\n\t\t\t\t\tfwrite(&MaxSec, sizeof(int), 1, fp);\n\t\t\t\t}\n\t\t\t\tif (judgeButton(msg.x, msg.y, 740, 130, BOX_WIDTH, BOX_HEGIHT)) {\n\t\t\t\t\tInputBox(temNum, 3, \"Ҫ޸ĵֵ:\");\n\t\t\t\t\tMinSec = _ttoi(temNum);\n\t\t\t\t\tNumOfData[7] = MinSec;\n\t\t\t\t\tPrintPara(NumOfData, StrNumOfData, tems);\n\t\t\t\t\tfseek(fp, sizeof(int) * 7, SEEK_SET);\n\t\t\t\t\tfwrite(&MinSec, sizeof(int), 1, fp);\n\t\t\t\t}\n\t\t\t\tif (judgeButton(msg.x, msg.y, 740, 210, BOX_WIDTH, BOX_HEGIHT)) {\n\t\t\t\t\tInputBox(temNum, 3, \"Ҫ޸ĵֵ:\");\n\t\t\t\t\tMaxCustSingleLine = _ttoi(temNum);\n\t\t\t\t\tNumOfData[8] = MaxCustSingleLine;\n\t\t\t\t\tPrintPara(NumOfData, StrNumOfData, tems);\n\t\t\t\t\tfseek(fp, sizeof(int) * 8, SEEK_SET);\n\t\t\t\t\tfwrite(&MaxCustSingleLine, sizeof(int), 1, fp);\n\t\t\t\t}\n\t\t\t\tif (judgeButton(msg.x, msg.y, 740, 290, BOX_WIDTH, BOX_HEGIHT)) {\n\t\t\t\t\tInputBox(temNum, 3, \"Ҫ޸ĵֵ:\");\n\t\t\t\t\tMaxLines = _ttoi(temNum);\n\t\t\t\t\tNumOfData[9] = MaxLines;\n\t\t\t\t\tPrintPara(NumOfData, StrNumOfData, tems);\n\t\t\t\t\tfseek(fp, sizeof(int) * 9, SEEK_SET);\n\t\t\t\t\tfwrite(&MaxLines, sizeof(int), 1, fp);\n\t\t\t\t}\n\t\t\t\tif (judgeButton(msg.x, msg.y, 740, 370, BOX_WIDTH, BOX_HEGIHT)) {\n\t\t\t\t\tInputBox(temNum, 3, \"Ҫ޸ĵֵ:\");\n\t\t\t\t\tMaxSeqLen = _ttoi(temNum);\n\t\t\t\t\tNumOfData[10] = MaxSeqLen;\n\t\t\t\t\tPrintPara(NumOfData, StrNumOfData, tems);\n\t\t\t\t\tfseek(fp, sizeof(int) * 10, SEEK_SET);\n\t\t\t\t\tfwrite(&MaxSeqLen, sizeof(int), 1, fp);\n\t\t\t\t}\n\t\t\t\tif (judgeButton(msg.x, msg.y, 740, 450, BOX_WIDTH, BOX_HEGIHT)) {\n\t\t\t\t\tInputBox(temNum, 3, \"Ҫ޸ĵֵ:\");\n\t\t\t\t\tEasySeqLen = _ttoi(temNum);\n\t\t\t\t\tNumOfData[11] = EasySeqLen;\n\t\t\t\t\tPrintPara(NumOfData, StrNumOfData, tems);\n\t\t\t\t\tfseek(fp, sizeof(int) * 11, SEEK_SET);\n\t\t\t\t\tfwrite(&EasySeqLen, sizeof(int), 1, fp);\n\t\t\t\t}\n\t\t\t\tif (judgeButton(msg.x, msg.y, 250, 600, 100, 50)) {\n\t\t\t\t\tfclose(fp);\n\t\t\t\t\tclosegraph();\n\t\t\t\t\tInitInter();\n\t\t\t\t\tInitInterCheck();\n\t\t\t\t}\n\t\t\t\tif (judgeButton(msg.x, msg.y, 790, 600, 100, 50)) {\n\t\t\t\t\tfclose(fp);\n\t\t\t\t\tTCHAR OriginalStr[10];\n\t\t\t\t\tInputBox(OriginalStr, 10, _T(\"¼\"));\n\t\t\t\t\tEventNum = _ttoi(OriginalStr);\n\t\t\t\t\tclosegraph();\n\t\t\t\t\tBeginServe();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}<commit_msg>Revert \"配置文件无法修改bug\"<commit_after>#include <stdio.h>\n#include <stdlib.h>\n#include <graphics.h>\n#include <conio.h>\n#include <string.h>\n#include \"global.h\"\n#include \"passenger.h\"\n#include \"window.h\"\n\n\n#define BOX_WIDTH\t200\n#define BOX_HEGIHT\t70\n\n int NumOfWin;\t\t\t\/\/1.ͨĿ\n int NumOfVIPWin;\t\t\/\/2.VIPĿ\n int MinCheck;\t\t\t\/\/3.ٿŰ\n int MaxCustCheck;\t\t\/\/4.ڶ󳤶\n int MinRestSec;\t\t\/\/5.СϢʱ\n int MaxRestSec;\t\t\/\/6.Ϣʱ\n int MaxSec;\t\t\t\/\/7.󰲼ʱ λ\n int MinSec;\t\t\t\/\/8.Сʱ λ\n int MaxCustSingleLine;\t\/\/9.˿\n int MaxLines;\t\t\t\/\/10.λMaxLinesֱ\n int MaxSeqLen;\t\t\t\/\/11.ȴ\n int EasySeqLen;\t\t\/\/12.ڵȴ\n\nint ParaData()\n{\n\tFILE * fp; \/\/ļָ\n\tif ((fp = fopen(\"para.dat\", \"rb\")) == NULL) \/\/ֻʽļpara.dat\n\t{\n\t\tprintf(\"Error! Can not open para.dat!\\n\");  \/\/޷򿪣򱨴\n\t\texit(EXIT_FAILURE);\n\t}\n\tfseek(fp, 0, SEEK_SET); \/\/ļָļͷ\n\t\/\/ļȡ\n\tfread(&NumOfWin, sizeof(int), 1, fp);\n\tfread(&NumOfVIPWin, sizeof(int), 1, fp);\n\tfread(&MinCheck, sizeof(int), 1, fp);\n\tfread(&MaxCustCheck, sizeof(int), 1, fp);\n\tfread(&MaxRestSec, sizeof(int), 1, fp);\n\tfread(&MinRestSec, sizeof(int), 1, fp);\n\tfread(&MaxSec, sizeof(int), 1, fp);\n\tfread(&MinSec, sizeof(int), 1, fp);\n\tfread(&MaxCustSingleLine, sizeof(int), 1, fp);\n\tfread(&MaxLines, sizeof(int), 1, fp);\n\tfread(&MaxSeqLen, sizeof(int), 1, fp);\n\tfread(&EasySeqLen, sizeof(int), 1, fp);\n\tfclose(fp);\/\/رļָ\n}\n\nvoid PrintPara(int *NumOfData,TCHAR StrNumOfData[],TCHAR *tems) {\n\t\n\tIMAGE airport;\n\n\tTCHAR OriginalStr[12][50] = {\n\t\t\"1.ͨĿ:\",\n\t\t\"2.VIPĿ:\",\n\t\t\"3.ٿŰ:\",\n\t\t\"4.ڶ󳤶:\",\n\t\t\"5.СϢʱ:\",\n\t\t\"6.Ϣʱ:\",\n\t\t\"7.󰲼ʱ:\",\n\t\t\"8.Сʱ:\",\n\t\t\"9.˿:\",\n\t\t\"10.λֱ:\",\n\t\t\"11.ȴ:\",\n\t\t\"12.ڵȴ:\",\n\t};\n\n\tloadimage(&airport, _T(\"ļ.jpg\"), WINDOWS_X, WINDOWS_Y);\n\tputimage(0, 0, &airport);\n\tfor (int i = 0; i < 12; i++) {\n\t\tif (i < 6) {\n\t\t\titoa(NumOfData[i], StrNumOfData, 10);\n\t\t\tlstrcpy(tems, OriginalStr[i]);\n\t\t\tlstrcat(tems, StrNumOfData);\n\t\t\tdrawButton(200, 50 + 80 * i, BOX_WIDTH, BOX_HEGIHT, tems);\n\t\t}\n\t\telse {\n\t\t\titoa(NumOfData[i], StrNumOfData, 10);\n\t\t\tlstrcpy(tems, OriginalStr[i]);\n\t\t\tlstrcat(tems, StrNumOfData);\n\t\t\tdrawButton(740, 50 + 80 * (i - 6), BOX_WIDTH, BOX_HEGIHT, tems);\n\t\t}\n\t}\n\tdrawButton(250, 600 ,100 ,50 , \"\");\n\tdrawButton(790, 600, 100, 50, \"ʼ\");\n}\n\nvoid MainPara() {\n\n\tint NumOfData[12];\n\n\tNumOfData[0] = NumOfWin;\n\tNumOfData[1] = NumOfVIPWin;\n\tNumOfData[2] = MinCheck;\n\tNumOfData[3] = MaxCustCheck;\n\tNumOfData[4] = MaxRestSec;\n\tNumOfData[5] = MinRestSec;\n\tNumOfData[6] = MaxSec;\n\tNumOfData[7] = MinSec;\n\tNumOfData[8] = MaxCustSingleLine;\n\tNumOfData[9] = MaxLines;\n\tNumOfData[10] = MaxSeqLen;\n\tNumOfData[11] = EasySeqLen;\n\t\n\n\tTCHAR StrNumOfData[5];\n\t\n\tTCHAR temNum[5]; \/\/޸ĵַ\n\tTCHAR tems[30];\n\n\tPrintPara(NumOfData,StrNumOfData,tems);\n\n\tFILE * fp; \/\/ļָ\n\tif ((fp = fopen(\"para.dat\", \"rb+\")) == NULL) \/\/ֻʽļpara.dat\n\t{\n\t\tprintf(\"Error! Can not open para.dat!\\n\");  \/\/޷򿪣򱨴\n\t\texit(EXIT_FAILURE);\n\t}\n\tfseek(fp, 0, SEEK_SET); \/\/ļָļͷ\n\n\t\n\tMOUSEMSG msg;\n\twhile (true) {\n\t\tif (MouseHit())\/\/ Ϣʱִ\n\t\t{\n\t\t\tmsg = GetMouseMsg();\n\t\t\tif (msg.uMsg == WM_LBUTTONDOWN) {\n\t\t\t\tif (judgeButton(msg.x, msg.y, 200, 50, BOX_WIDTH, BOX_HEGIHT)) {\n\t\t\t\t\tInputBox(temNum, 3, \"Ҫ޸ĵֵ:\");\n\t\t\t\t\tNumOfWin = _ttoi(temNum);\n\t\t\t\t\tNumOfData[0] = NumOfWin;\n\t\t\t\t\tPrintPara(NumOfData, StrNumOfData, tems);\n\t\t\t\t\tfseek(fp, sizeof(int) * 0, SEEK_SET);\n\t\t\t\t\tfwrite(&NumOfWin, sizeof(int), 1, fp);\n\t\t\t\t}\n\t\t\t\tif (judgeButton(msg.x, msg.y, 200, 130, BOX_WIDTH, BOX_HEGIHT)) {\n\t\t\t\t\tInputBox(temNum, 3, \"Ҫ޸ĵֵ:\");\n\t\t\t\t\tNumOfVIPWin = _ttoi(temNum);\n\t\t\t\t\tNumOfData[1] = NumOfVIPWin;\n\t\t\t\t\tPrintPara(NumOfData, StrNumOfData, tems);\n\t\t\t\t\tfseek(fp, sizeof(int) * 1, SEEK_SET);\n\t\t\t\t\tfwrite(&NumOfVIPWin, sizeof(int), 1, fp);\n\t\t\t\t}\n\t\t\t\tif (judgeButton(msg.x, msg.y, 200, 210, BOX_WIDTH, BOX_HEGIHT)) {\n\t\t\t\t\tInputBox(temNum, 3, \"Ҫ޸ĵֵ:\");\n\t\t\t\t\tMinCheck = _ttoi(temNum);\n\t\t\t\t\tNumOfData[2] = MinCheck;\n\t\t\t\t\tPrintPara(NumOfData, StrNumOfData, tems);\n\t\t\t\t\tfseek(fp, sizeof(int) * 2, SEEK_SET);\n\t\t\t\t\tfwrite(&MinCheck, sizeof(int), 1, fp);\n\t\t\t\t}\n\t\t\t\tif (judgeButton(msg.x, msg.y, 200, 290, BOX_WIDTH, BOX_HEGIHT)) {\n\t\t\t\t\tInputBox(temNum, 3, \"Ҫ޸ĵֵ:\");\n\t\t\t\t\tMaxCustCheck = _ttoi(temNum);\n\t\t\t\t\tNumOfData[3] = MaxCustCheck;\n\t\t\t\t\tPrintPara(NumOfData, StrNumOfData, tems);\n\t\t\t\t\tfseek(fp, sizeof(int) * 3, SEEK_SET);\n\t\t\t\t\tfwrite(&MaxCustCheck, sizeof(int), 1, fp);\n\t\t\t\t}\n\t\t\t\tif (judgeButton(msg.x, msg.y, 200, 370, BOX_WIDTH, BOX_HEGIHT)) {\n\t\t\t\t\tInputBox(temNum, 3, \"Ҫ޸ĵֵ:\");\n\t\t\t\t\tMaxRestSec = _ttoi(temNum);\n\t\t\t\t\tNumOfData[4] = MaxRestSec;\n\t\t\t\t\tPrintPara(NumOfData, StrNumOfData, tems);\n\t\t\t\t\tfseek(fp, sizeof(int) * 4, SEEK_SET);\n\t\t\t\t\tfwrite(&MaxRestSec, sizeof(int), 1, fp);\n\t\t\t\t}\n\t\t\t\tif (judgeButton(msg.x, msg.y, 200, 450, BOX_WIDTH, BOX_HEGIHT)) {\n\t\t\t\t\tInputBox(temNum, 3, \"Ҫ޸ĵֵ:\");\n\t\t\t\t\tMinRestSec = _ttoi(temNum);\n\t\t\t\t\tNumOfData[5] = MinRestSec;\n\t\t\t\t\tPrintPara(NumOfData, StrNumOfData, tems);\n\t\t\t\t\tfseek(fp, sizeof(int) * 5, SEEK_SET);\n\t\t\t\t\tfwrite(&MinRestSec, sizeof(int), 1, fp);\n\t\t\t\t}\n\t\t\t\tif (judgeButton(msg.x, msg.y, 740, 50, BOX_WIDTH, BOX_HEGIHT)) {\n\t\t\t\t\tInputBox(temNum, 3, \"Ҫ޸ĵֵ:\");\n\t\t\t\t\tMaxSec = _ttoi(temNum);\n\t\t\t\t\tNumOfData[6] = MaxSec;\n\t\t\t\t\tPrintPara(NumOfData, StrNumOfData, tems);\n\t\t\t\t\tfseek(fp, sizeof(int) * 6, SEEK_SET);\n\t\t\t\t\tfwrite(&MaxSec, sizeof(int), 1, fp);\n\t\t\t\t}\n\t\t\t\tif (judgeButton(msg.x, msg.y, 740, 130, BOX_WIDTH, BOX_HEGIHT)) {\n\t\t\t\t\tInputBox(temNum, 3, \"Ҫ޸ĵֵ:\");\n\t\t\t\t\tMinSec = _ttoi(temNum);\n\t\t\t\t\tNumOfData[7] = MinSec;\n\t\t\t\t\tPrintPara(NumOfData, StrNumOfData, tems);\n\t\t\t\t\tfseek(fp, sizeof(int) * 7, SEEK_SET);\n\t\t\t\t\tfwrite(&MinSec, sizeof(int), 1, fp);\n\t\t\t\t}\n\t\t\t\tif (judgeButton(msg.x, msg.y, 740, 210, BOX_WIDTH, BOX_HEGIHT)) {\n\t\t\t\t\tInputBox(temNum, 3, \"Ҫ޸ĵֵ:\");\n\t\t\t\t\tMaxCustSingleLine = _ttoi(temNum);\n\t\t\t\t\tNumOfData[8] = MaxCustSingleLine;\n\t\t\t\t\tPrintPara(NumOfData, StrNumOfData, tems);\n\t\t\t\t\tfseek(fp, sizeof(int) * 8, SEEK_SET);\n\t\t\t\t\tfwrite(&MaxCustSingleLine, sizeof(int), 1, fp);\n\t\t\t\t}\n\t\t\t\tif (judgeButton(msg.x, msg.y, 740, 290, BOX_WIDTH, BOX_HEGIHT)) {\n\t\t\t\t\tInputBox(temNum, 3, \"Ҫ޸ĵֵ:\");\n\t\t\t\t\tMaxLines = _ttoi(temNum);\n\t\t\t\t\tNumOfData[9] = MaxLines;\n\t\t\t\t\tPrintPara(NumOfData, StrNumOfData, tems);\n\t\t\t\t\tfseek(fp, sizeof(int) * 9, SEEK_SET);\n\t\t\t\t\tfwrite(&MaxLines, sizeof(int), 1, fp);\n\t\t\t\t}\n\t\t\t\tif (judgeButton(msg.x, msg.y, 740, 370, BOX_WIDTH, BOX_HEGIHT)) {\n\t\t\t\t\tInputBox(temNum, 3, \"Ҫ޸ĵֵ:\");\n\t\t\t\t\tMaxSeqLen = _ttoi(temNum);\n\t\t\t\t\tNumOfData[10] = MaxSeqLen;\n\t\t\t\t\tPrintPara(NumOfData, StrNumOfData, tems);\n\t\t\t\t\tfseek(fp, sizeof(int) * 10, SEEK_SET);\n\t\t\t\t\tfwrite(&MaxSeqLen, sizeof(int), 1, fp);\n\t\t\t\t}\n\t\t\t\tif (judgeButton(msg.x, msg.y, 740, 450, BOX_WIDTH, BOX_HEGIHT)) {\n\t\t\t\t\tInputBox(temNum, 3, \"Ҫ޸ĵֵ:\");\n\t\t\t\t\tEasySeqLen = _ttoi(temNum);\n\t\t\t\t\tNumOfData[11] = EasySeqLen;\n\t\t\t\t\tPrintPara(NumOfData, StrNumOfData, tems);\n\t\t\t\t\tfseek(fp, sizeof(int) * 11, SEEK_SET);\n\t\t\t\t\tfwrite(&EasySeqLen, sizeof(int), 1, fp);\n\t\t\t\t}\n\t\t\t\tif (judgeButton(msg.x, msg.y, 250, 600, 100, 50)) {\n\t\t\t\t\tclosegraph();\n\t\t\t\t\tInitInter();\n\t\t\t\t\tInitInterCheck();\n\t\t\t\t}\n\t\t\t\tif (judgeButton(msg.x, msg.y, 790, 600, 100, 50)) {\n\t\t\t\t\tTCHAR OriginalStr[10];\n\t\t\t\t\tInputBox(OriginalStr, 10, _T(\"¼\"));\n\t\t\t\t\tEventNum = _ttoi(OriginalStr);\n\t\t\t\t\tclosegraph();\n\t\t\t\t\tBeginServe();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfclose(fp);\n}<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  AmstradCPC.hpp\n\/\/  Clock Signal\n\/\/\n\/\/  Created by Thomas Harte on 30\/07\/2017.\n\/\/  Copyright © 2017 Thomas Harte. All rights reserved.\n\/\/\n\n#ifndef AmstradCPC_hpp\n#define AmstradCPC_hpp\n\n#include \"..\/ConfigurationTarget.hpp\"\n#include \"..\/CRTMachine.hpp\"\n\n#include \"..\/..\/Processors\/Z80\/Z80.hpp\"\n#include \"..\/..\/Components\/AY38910\/AY38910.hpp\"\n#include \"..\/..\/Components\/6845\/CRTC6845.hpp\"\n\nnamespace AmstradCPC {\n\nenum ROMType: uint8_t {\n\tOS464, OS664, OS6128,\n\tBASIC464, BASIC664, BASIC6128,\n\tAMSDOS\n};\n\nstruct CRTCBusHandler {\n\tpublic:\n\t\tCRTCBusHandler() : cycles_(0), was_enabled_(false), was_sync_(false) {\n\t\t}\n\n\t\tinline void perform_bus_cycle(const Motorola::CRTC::BusState &state) {\n\t\t\tcycles_++;\n\t\t\tbool is_sync = state.hsync || state.vsync;\n\t\t\tif(state.display_enable != was_enabled_ || is_sync != was_sync_) {\n\t\t\t\tif(was_sync_) {\n\t\t\t\t\tcrt_->output_sync((unsigned int)(cycles_ * 2));\n\t\t\t\t} else {\n\t\t\t\t\tuint8_t *colour_pointer = (uint8_t *)crt_->allocate_write_area(1);\n\t\t\t\t\tif(colour_pointer) *colour_pointer = was_enabled_ ? 0xff : 0x00;\n\t\t\t\t\tcrt_->output_level((unsigned int)(cycles_ * 2));\n\t\t\t\t}\n\n\t\t\t\tcycles_ = 0;\n\t\t\t\twas_sync_ = is_sync;\n\t\t\t\twas_enabled_ = state.display_enable;\n\t\t\t}\n\t\t}\n\n\t\tstd::shared_ptr<Outputs::CRT::CRT> crt_;\n\n\tprivate:\n\t\tint cycles_;\n\t\tbool was_enabled_, was_sync_;\n};\n\nclass Machine:\n\tpublic CPU::Z80::Processor<Machine>,\n\tpublic CRTMachine::Machine,\n\tpublic ConfigurationTarget::Machine {\n\tpublic:\n\t\tMachine();\n\n\t\tHalfCycles perform_machine_cycle(const CPU::Z80::PartialMachineCycle &cycle);\n\t\tvoid flush();\n\n\t\tvoid setup_output(float aspect_ratio);\n\t\tvoid close_output();\n\n\t\tstd::shared_ptr<Outputs::CRT::CRT> get_crt();\n\t\tstd::shared_ptr<Outputs::Speaker> get_speaker();\n\n\t\tvoid run_for(const Cycles cycles);\n\n\t\tvoid configure_as_target(const StaticAnalyser::Target &target);\n\n\t\tvoid set_rom(ROMType type, std::vector<uint8_t> data);\n\n\tprivate:\n\t\tCRTCBusHandler crtc_bus_handler_;\n\t\tMotorola::CRTC::CRTC6845<CRTCBusHandler> crtc_;\n\n\t\tHalfCycles clock_offset_;\n\t\tHalfCycles crtc_counter_;\n\n\t\tuint8_t ram_[65536];\n\t\tstd::vector<uint8_t> os_, basic_;\n\n\t\tuint8_t *read_pointers_[4];\n\t\tuint8_t *write_pointers_[4];\n};\n\n}\n\n#endif \/* AmstradCPC_hpp *\/\n<commit_msg>Fixed multiplier: the dot clock I've used to instantiate the CRT is the pixel clock, not the character clock.<commit_after>\/\/\n\/\/  AmstradCPC.hpp\n\/\/  Clock Signal\n\/\/\n\/\/  Created by Thomas Harte on 30\/07\/2017.\n\/\/  Copyright © 2017 Thomas Harte. All rights reserved.\n\/\/\n\n#ifndef AmstradCPC_hpp\n#define AmstradCPC_hpp\n\n#include \"..\/ConfigurationTarget.hpp\"\n#include \"..\/CRTMachine.hpp\"\n\n#include \"..\/..\/Processors\/Z80\/Z80.hpp\"\n#include \"..\/..\/Components\/AY38910\/AY38910.hpp\"\n#include \"..\/..\/Components\/6845\/CRTC6845.hpp\"\n\nnamespace AmstradCPC {\n\nenum ROMType: uint8_t {\n\tOS464, OS664, OS6128,\n\tBASIC464, BASIC664, BASIC6128,\n\tAMSDOS\n};\n\nstruct CRTCBusHandler {\n\tpublic:\n\t\tCRTCBusHandler() : cycles_(0), was_enabled_(false), was_sync_(false) {\n\t\t}\n\n\t\tinline void perform_bus_cycle(const Motorola::CRTC::BusState &state) {\n\t\t\tcycles_++;\n\t\t\tbool is_sync = state.hsync || state.vsync;\n\t\t\tif(state.display_enable != was_enabled_ || is_sync != was_sync_) {\n\t\t\t\tif(was_sync_) {\n\t\t\t\t\tcrt_->output_sync((unsigned int)(cycles_ * 2) * 8);\n\t\t\t\t} else {\n\t\t\t\t\tuint8_t *colour_pointer = (uint8_t *)crt_->allocate_write_area(1);\n\t\t\t\t\tif(colour_pointer) *colour_pointer = was_enabled_ ? 0xff : 0x00;\n\t\t\t\t\tcrt_->output_level((unsigned int)(cycles_ * 2) * 8);\n\t\t\t\t}\n\n\t\t\t\tcycles_ = 0;\n\t\t\t\twas_sync_ = is_sync;\n\t\t\t\twas_enabled_ = state.display_enable;\n\t\t\t}\n\t\t}\n\n\t\tstd::shared_ptr<Outputs::CRT::CRT> crt_;\n\n\tprivate:\n\t\tint cycles_;\n\t\tbool was_enabled_, was_sync_;\n};\n\nclass Machine:\n\tpublic CPU::Z80::Processor<Machine>,\n\tpublic CRTMachine::Machine,\n\tpublic ConfigurationTarget::Machine {\n\tpublic:\n\t\tMachine();\n\n\t\tHalfCycles perform_machine_cycle(const CPU::Z80::PartialMachineCycle &cycle);\n\t\tvoid flush();\n\n\t\tvoid setup_output(float aspect_ratio);\n\t\tvoid close_output();\n\n\t\tstd::shared_ptr<Outputs::CRT::CRT> get_crt();\n\t\tstd::shared_ptr<Outputs::Speaker> get_speaker();\n\n\t\tvoid run_for(const Cycles cycles);\n\n\t\tvoid configure_as_target(const StaticAnalyser::Target &target);\n\n\t\tvoid set_rom(ROMType type, std::vector<uint8_t> data);\n\n\tprivate:\n\t\tCRTCBusHandler crtc_bus_handler_;\n\t\tMotorola::CRTC::CRTC6845<CRTCBusHandler> crtc_;\n\n\t\tHalfCycles clock_offset_;\n\t\tHalfCycles crtc_counter_;\n\n\t\tuint8_t ram_[65536];\n\t\tstd::vector<uint8_t> os_, basic_;\n\n\t\tuint8_t *read_pointers_[4];\n\t\tuint8_t *write_pointers_[4];\n};\n\n}\n\n#endif \/* AmstradCPC_hpp *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/ This file should match src\/Console\/Touch.cpp\n\n#include \"Touch.h\"\n\n\/\/ Walkthrough: https:\/\/learn.adafruit.com\/adafruit-mpr121-12-key-capacitive-touch-sensor-breakout-tutorial\/wiring\n\/\/ MPR121 Datasheet: http:\/\/www.adafruit.com\/datasheets\/MPR121.pdf\n\n#define MPR121_I2CADDR_DEFAULT 0x5A\n#define DEBUG true\n\nboolean touchStart() {\n    \/\/ some reasonable defaults are set.\n    \/\/ expect this to be called after startup\n    \/\/ and again between games.\n    Serial << F(\"Touch: startup.\") << endl;\n\n    \/\/ following Examples->BareConductive_MPR->SimpleTouch\n\n    \/\/ 0x5C is the MPR121 I2C address on the Bare Touch Board\n    if (!MPR121.begin(MPR121_I2CADDR_DEFAULT)) {\n        Serial << F(\"Touch: error setting up MPR121\");\n        switch (MPR121.getError()) {\n            case ADDRESS_UNKNOWN:\n                Serial << F(\"Touch: incorrect address\") << endl;\n                return ( false );\n                break;\n            case READBACK_FAIL:\n                Serial << F(\"readback failure\") << endl;\n                return ( false );\n                break;\n            case OVERCURRENT_FLAG:\n                Serial << F(\"overcurrent on REXT pin\") << endl;\n                return ( false );\n                break;\n            case OUT_OF_RANGE:\n                Serial << F(\"electrode out of range\") << endl;\n                return ( false );\n                break;\n            case NOT_INITED:\n                Serial << F(\"not initialised\") << endl;\n                return ( false );\n                break;\n            default:\n                Serial << F(\"unknown error\") << endl;\n                return ( false );\n                break;\n        }\n    }\n    else {\n        Serial << F(\"Touch: no error\") << endl;\n        \/\/ set the interrupt handler.\n        MPR121.setInterruptPin(TOUCH_IRQ);\n        \/\/ initial data update\n        touchCalibrate();\n        MPR121.updateTouchData();\n        return (true);\n    }\n\n}\n\n\/\/ calibrates the Touch interface\nvoid touchCalibrate() {}\n\n\/\/ returns true if any of the buttons have switched states.\n\/\/ avoid short-circuit eval so that each button gets an update\n\/\/ TODO: this should call MPR121.TouchPressed(I_RED)\nboolean touchAnyPressed() {\n    return (\n            touchPressed(I_RED) ||\n            touchPressed(I_GRN) ||\n            touchPressed(I_BLU) ||\n            touchPressed(I_YEL)\n           );\n\n    \/*\n    bool statusChanged = MPR121.touchStatusChanged();\n    if (statusChanged) {\n        Serial << F(\"TOUCH ANY PRESSED: \") << statusChanged << endl;\n    }\n    return statusChanged;\n    *\/\n}\n\/\/ returns true if any of the buttons are pressed.\nboolean touchAnyChanged() {\n    return (\n            touchChanged(I_RED) ||\n            touchChanged(I_GRN) ||\n            touchChanged(I_BLU) ||\n            touchChanged(I_YEL)\n           );\n}\n\/\/ returns true if a specific sensor IS PRESSED\n\/\/ this function will be called after touchChanged() asserts a change.\n\/\/ TODO: MPR121.getToucheData(i)\nboolean touchPressed(byte touchIndex) {\n    if (touchIndex == I_ALL) return touchAnyPressed();\n\n    MPR121.updateTouchData();\n    return MPR121.getTouchData(touchIndex);\n\n    if (MPR121.isNewTouch(touchIndex)) {\n        Serial << \"isNewTouch: \" << touchIndex << endl;\n        return true;\n    } else if (MPR121.isNewRelease(touchIndex)) {\n        Serial << \"isNewRelease: \" << touchIndex << endl;\n        return false;\n    } else {\n        return false;\n    }\n}\n\n\/\/ this is working\nboolean touchChanged(byte touchIndex) {\n    MPR121.updateTouchData();\n    if (touchIndex == I_ALL) return touchAnyChanged();\n    static boolean previousState[N_COLORS];\n    boolean currentState = MPR121.getTouchData(touchIndex);\n    if (previousState[touchIndex] != currentState) {\n        previousState[touchIndex] = currentState;\n        return true;\n    }\n    return false;\n}\n\n\n<commit_msg>Remove unused code, update comments<commit_after>\/\/ This file should match src\/Console\/Touch.cpp\n\n#include \"Touch.h\"\n\n\/\/ Walkthrough: https:\/\/learn.adafruit.com\/adafruit-mpr121-12-key-capacitive-touch-sensor-breakout-tutorial\/wiring\n\/\/ MPR121 Datasheet: http:\/\/www.adafruit.com\/datasheets\/MPR121.pdf\n\n#define MPR121_I2CADDR_DEFAULT 0x5A\n#define DEBUG true\n\nboolean touchStart() {\n    \/\/ some reasonable defaults are set.\n    \/\/ expect this to be called after startup\n    \/\/ and again between games.\n    Serial << F(\"Touch: startup.\") << endl;\n\n    \/\/ following Examples->BareConductive_MPR->SimpleTouch\n\n    \/\/ 0x5C is the MPR121 I2C address on the Bare Touch Board\n    if (!MPR121.begin(MPR121_I2CADDR_DEFAULT)) {\n        Serial << F(\"Touch: error setting up MPR121\");\n        switch (MPR121.getError()) {\n            case ADDRESS_UNKNOWN:\n                Serial << F(\"Touch: incorrect address\") << endl;\n                return ( false );\n                break;\n            case READBACK_FAIL:\n                Serial << F(\"readback failure\") << endl;\n                return ( false );\n                break;\n            case OVERCURRENT_FLAG:\n                Serial << F(\"overcurrent on REXT pin\") << endl;\n                return ( false );\n                break;\n            case OUT_OF_RANGE:\n                Serial << F(\"electrode out of range\") << endl;\n                return ( false );\n                break;\n            case NOT_INITED:\n                Serial << F(\"not initialised\") << endl;\n                return ( false );\n                break;\n            default:\n                Serial << F(\"unknown error\") << endl;\n                return ( false );\n                break;\n        }\n    }\n    else {\n        Serial << F(\"Touch: no error\") << endl;\n        \/\/ set the interrupt handler.\n        MPR121.setInterruptPin(TOUCH_IRQ);\n        \/\/ initial data update\n        touchCalibrate();\n        MPR121.updateTouchData();\n        return (true);\n    }\n\n}\n\n\/\/ calibrates the Touch interface\nvoid touchCalibrate() {}\n\n\/\/ returns true if any of the buttons have switched states.\n\/\/ avoid short-circuit eval so that each button gets an update\nboolean touchAnyPressed() {\n    return (\n            touchPressed(I_RED) ||\n            touchPressed(I_GRN) ||\n            touchPressed(I_BLU) ||\n            touchPressed(I_YEL)\n           );\n}\n\n\/\/ returns true if any of the buttons are pressed.\nboolean touchAnyChanged() {\n    return (\n            touchChanged(I_RED) ||\n            touchChanged(I_GRN) ||\n            touchChanged(I_BLU) ||\n            touchChanged(I_YEL)\n           );\n}\n\n\/\/ returns true WHILE a specific sensor IS PRESSED\n\/\/ this function will be called after touchChanged() asserts a change.\nboolean touchPressed(byte touchIndex) {\n    if (touchIndex == I_ALL) return touchAnyPressed();\n\n    MPR121.updateTouchData();\n    return MPR121.getTouchData(touchIndex);\n}\n\n\/\/ Returns true if the state of a specific button has changed\n\/\/ based on what it was previously.\nboolean touchChanged(byte touchIndex) {\n    if (touchIndex == I_ALL) return touchAnyChanged();\n\n    MPR121.updateTouchData();\n    static boolean previousState[N_COLORS];\n    boolean currentState = MPR121.getTouchData(touchIndex);\n    if (previousState[touchIndex] != currentState) {\n        previousState[touchIndex] = currentState;\n        return true;\n    }\n    return false;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"DirectedGraph.h\"\n\n#include <cassert>\n#include <iostream>\n\n#include \"RawStatistics.h\"\n\nusing namespace std;\n\nDirectedGraph::DirectedGraph(int _id) : Graph(_id) {\n\n}\n\nDirectedGraph::DirectedGraph(const DirectedGraph & other) : Graph(other) {\n  \n}\n\nstd::shared_ptr<Graph>\nDirectedGraph::createSimilar() const {\n  std::shared_ptr<Graph> graph(new DirectedGraph(getId()));\n  graph->setLocationGraphValid(false);\n  graph->setNodeVisibility(getNodeVisibility());\n  graph->setEdgeVisibility(getEdgeVisibility());\n  graph->setFaceVisibility(getFaceVisibility());\n  graph->setLabelVisibility(getLabelVisibility());\n  graph->setLineWidth(getLineWidth());\n  graph->setNodeArray(nodes);\n  \n  return graph;\n}\n\nvoid\nDirectedGraph::breakNodePair(int node_id) {\n  auto it = node_pairs.find(node_id);\n  if (it != node_pairs.end()) {\n    removeChild(node_id);\n    int other_id = it->second;\n    node_pairs.erase(it);\n\n    auto it_b = onedegree_nodes.find(node_id);\n    if (it_b != onedegree_nodes.end()) {\n      onedegree_nodes.erase(it_b);\n    }\n    \n    auto it2 = node_pairs.find(other_id);\n    assert(it2 != node_pairs.end());\n    if (it2 != node_pairs.end()) {\n      removeChild(other_id);\n      node_pairs.erase(it2);\n\n      auto it2_b = onedegree_nodes.find(other_id);\n      if (it2_b != onedegree_nodes.end()) {\n\tonedegree_nodes.erase(it2_b);\n      } else {\n\t\/\/ if a pair is broken, we add the other node to first one's group\n\tint o = getNodeArray().getOneDegreeNode(node_id);\n\taddChild(o, other_id);\n\tonedegree_nodes[other_id] = node_id;\n      }\n    }\n  }\n}\n\nvoid\nDirectedGraph::breakOneDegreeNode(int node_id) {\n  breakNodePair(node_id);\n  \n  auto it = onedegree_nodes.find(node_id);\n  if (it != onedegree_nodes.end()) {\n    removeChild(node_id);\n    onedegree_nodes.erase(it);\n  }\n}\n\nvoid\nDirectedGraph::breakZeroDegreeNode(int node_id) {\n  auto it = zerodegree_nodes.find(node_id);\n  if (it != zerodegree_nodes.end()) {\n    removeChild(node_id);\n    zerodegree_nodes.erase(it);\n  }\n}\n\nbool\nDirectedGraph::updateData(time_t start_time, time_t end_time, float start_sentiment, float end_sentiment, Graph & source_graph, RawStatistics & stats, bool is_first_level, Graph * base_graph) {\n  if (getNodeArray().hasTemporalCoverage() && !(end_time > start_time)) {\n    cerr << \"invalid time range for updateData: \" << start_time << \" - \" << end_time << endl;\n    return false;\n  }\n  \n  assert(base_graph);\n  \n  auto & sid = source_graph.getNodeArray().getTable()[\"source\"];\n  auto & soid = source_graph.getNodeArray().getTable()[\"id\"];\n  auto & user_type = source_graph.getNodeArray().getTable()[\"type\"];\n  auto & political_party = source_graph.getNodeArray().getTable()[\"party\"];\n  auto & name_column = source_graph.getNodeArray().getTable()[\"name\"];\n  auto & uname_column = source_graph.getNodeArray().getTable()[\"uname\"];\n\n  auto begin = source_graph.begin_edges();\n  auto end = source_graph.end_edges();\n  auto it = begin;\n  \n  if (current_pos == -1) {\n    clear();\n    edge_attributes.clear();\n    current_pos = 0;\n    cerr << \"restarting update, begin = \" << begin.get() << \", cp = \" << current_pos << \", end = \" << end.get() << \", source = \" << &source_graph << \", edges = \" << source_graph.getEdgeCount() << endl;\n  } else {\n    cerr << \"continuing update, begin = \" << begin.get() << \", cp = \" << current_pos << \", end = \" << end.get() << \", source = \" << &source_graph << \", edges = \" << source_graph.getEdgeCount() << endl;\n    for (int i = 0; i < current_pos; i++) ++it;\n  }\n\n  auto & nodes = getNodeArray();\n\n  unsigned int skipped_count = 0;\n  bool is_changed = false;\n  unsigned int num_edges_processed = 0;\n  for ( ; it != end; ++it, current_pos++) {\n    num_edges_processed++;\n\n    time_t t = 0;\n    float se = 0;\n    short lang = 0;\n    long long app_id = -1, filter_id = -1;\n    bool is_first = false;\n\n    assert(it->face != -1);\n    if (it->face != -1) {\n      auto & fd = source_graph.getFaceAttributes(it->face);\n      t = fd.timestamp;\n      se = fd.sentiment;\n      lang = fd.lang;\n      app_id = fd.app_id;\n      filter_id = fd.filter_id;\n      is_first = fd.first_edge == current_pos;\n    }\n\n    if (it->tail < 0 || it->head < 0 || it->tail >= nodes.size() || it->head >= nodes.size()) {\n      cerr << \"invalid values: tail = \" << it->tail << \", head = \" << it->head << \", t = \" << t << \", count = \" << nodes.size() << \", n = \" << num_edges_processed << endl;\n      assert(0);\n    }\n\n    if ((!start_time || t >= start_time) && (!end_time || t < end_time) &&\n\tse >= start_sentiment && se <= end_sentiment) {\n      if (t < min_time || min_time == 0) min_time = t;\n      if (t > max_time) max_time = t;\n\n      pair<int, int> np(it->tail, it->head);\n      short first_user_sid = sid.getInt(np.first);\n      short target_user_sid = sid.getInt(np.second);\n      long long first_user_soid = soid.getInt64(np.first);\n      long long target_user_soid = soid.getInt64(np.second);\n      \n      auto td1 = base_graph->getNodeTertiaryData(np.first); \/\/ data is copied, since the backing array might change\n      auto td2 = base_graph->getNodeTertiaryData(np.second);\n      \n      if (!is_first_level) {\n\tif (td1.indegree < getMinSignificance()) {\n\t  skipped_count++;\n\t  continue;\n\t}\n\tif (td2.indegree < getMinSignificance()) {\n\t  skipped_count++;\n\t  continue;\n\t}\n      }\n\n      is_changed = true;\n\n      auto & target_nd_old = nodes.getNodeData(np.second);\n      NodeType target_type = target_nd_old.type;\n\n      if (is_first_level && is_first) {\n\tstats.addActivity(t, first_user_sid, first_user_soid, lang, app_id, filter_id, PoliticalParty(political_party.getInt(np.first)));\n      }\n      \n      if (is_first_level && !seen_nodes.count(np.second)) {\n\tseen_nodes.insert(np.second);\n\tUserType ut = UserType(user_type.getInt(np.second));\n\tif (ut != UNKNOWN_TYPE) stats.addUserType(ut);\n\t\/\/ stats.addPoliticalParty(PoliticalParty(political_party.getInt(np.first)));\n      }\n\n      if (target_type == NODE_HASHTAG) {\n\tstats.addHashtag(name_column.getText(np.second));\n\tnum_hashtags++;\n      } else if (target_type == NODE_URL) {\n\tstats.addLink(name_column.getText(np.second), uname_column.getText(np.second));\n\tnum_links++;\n      } else {\n\tif (is_first_level && target_type == NODE_ANY) {\n\t  stats.addReceivedActivity(t, target_user_sid, target_user_soid, app_id, filter_id);\n\t}\n\n\tlong long coverage = 0;\n\tif (getNodeArray().hasTemporalCoverage()) {\n\t  assert(end_time > start_time);\n\t  int time_pos = 63LL * (t - start_time) \/ (end_time - start_time);\n\t  assert(time_pos >= 0 && time_pos < 64);\n\t  coverage |= 1 << time_pos;\n\t}\n\t\n\tunordered_map<int, unordered_map<int, int> >::iterator it1;\n\tunordered_map<int, int>::iterator it2;\n\tif ((it1 = seen_edges.find(np.first)) != seen_edges.end() &&\n\t    (it2 = it1->second.find(np.second)) != it1->second.end()) {\n#if 0\n\t  updateOutdegree(np.first, 1.0f);\n\t  updateIndegree(np.second, 1.0f);\n\t  updateNodeSize(np.first);\n\t  updateNodeSize(np.second);\n#endif\n\t  if (getNodeArray().hasTemporalCoverage()) {\n\t    auto & ed = getEdgeAttributes(it2->second);\n\t    ed.coverage |= coverage;\n\t    float new_weight = 0;\n\t    for (int i = 0; i < 64; i++) {\n\t      if (ed.coverage & (1 << i)) new_weight += 1.0f;\n\t    }\n\t    new_weight \/= 64.0f;\n\t    updateEdgeWeight(it2->second, new_weight - ed.weight);\n\t  }\n\t} else {\n\t  if (td1.indegree == 0 && td1.outdegree == 0) {\n\t    bool has_zero = zerodegree_nodes.count(np.first) != 0;\n\t    if (np.first == np.second && !has_zero) {\n\t      int z = nodes.getZeroDegreeNode();\n\t      cerr << \"DEBUG: adding node \" << np.first << \" to zero degree node (id = \" << z << \")\\n\";\n\t      addChild(z, np.first);\n\t      zerodegree_nodes.insert(np.first);\n\t    } else if (np.first != np.second && has_zero) {\n\t      cerr << \"DEBUG: removing node \" << np.first << \" from zero degree node (A)\\n\";\n\t      removeChild(np.first);\n\t      zerodegree_nodes.erase(np.first);\n\t    }\n\t    if (np.first != np.second) {\n\t      if (td2.indegree == 0 && td2.outdegree == 0) {\n\t\tbreakZeroDegreeNode(np.second);\n\t\tassert(node_pairs.find(np.first) == node_pairs.end());\n\t\tassert(node_pairs.find(np.second) == node_pairs.end());\n\t\tint o = nodes.getPairsNode();\n\t\tcerr << \"adding to pairs node\\n\";\n\t\taddChild(o, np.first);\n\t\taddChild(o, np.second);\n\t\tnode_pairs[np.first] = np.second;\n\t\tnode_pairs[np.second] = np.first;\n\t      } else if (!onedegree_nodes.count(np.first)) {\n\t\tcerr << \"adding to onedegree node (A)\\n\";\n\t\tassert(node_pairs.find(np.first) == node_pairs.end());\n\t\tbreakOneDegreeNode(np.second);\n\t\tbreakNodePair(np.second);\n\t\tint o = nodes.getOneDegreeNode(np.second);\n\t\taddChild(o, np.first);\n\t\tonedegree_nodes[np.first] = np.second;\n\t      }\n\t    }\n\t  } else {\n\t    breakNodePair(np.first);\n\t  }\n\t  if (np.first != np.second) {\n\t    if (td2.indegree == 0 && td2.outdegree == 0) {\n\t      breakZeroDegreeNode(np.second);\t      \n\t      if (td1.indegree == 0 && td1.outdegree == 0) {\n\t\t\/\/ pair was created\n\t      } else if (!onedegree_nodes.count(np.second)) {\n\t\tif (node_pairs.count(np.second)) {\n\t\t  cerr << \"ERROR!\\n\";\n\t\t} else {\n\t\t  cerr << \"adding child \" << np.second << \" to onedegree node (B) [td1.i = \" << td1.indegree << \", td1.o = \" << td1.outdegree << \"]\\n\";\n\t\t  assert(node_pairs.find(np.second) == node_pairs.end());\n\t\t  breakOneDegreeNode(np.first);\n\t\t  breakNodePair(np.first);\n\t\t  int o = nodes.getOneDegreeNode(np.first);\n\t\t  addChild(o, np.second);\n\t\t  onedegree_nodes[np.second] = np.first;\n\t\t}\n\t      }\n\t    } else {\n\t      breakNodePair(np.second);\n\t    }\n\n\t    auto od1 = onedegree_nodes.find(np.first), od2 = onedegree_nodes.find(np.second);\n\t    auto pd1 = node_pairs.find(np.first), pd2 = node_pairs.find(np.second);\n\t    bool have_same_base = od1 != onedegree_nodes.end() && od2 != onedegree_nodes.end() && od1->second == od2->second && ((pd1 == node_pairs.end() && pd2 == node_pairs.end()) || (pd1 != node_pairs.end() && pd2 != node_pairs.end() && pd1->second == np.second && pd2->second == np.first));\n\t    \n\t    if (have_same_base) {\n\t      node_pairs[np.first] = np.second;\n\t      node_pairs[np.second] = np.first;\n\t    } else {\n\t      if (td1.indegree != 0 || td1.outdegree != 0) {\n\t\tbreakOneDegreeNode(np.first);\n\t      }\n\t      if (td2.indegree != 0 || td2.outdegree != 0) {\n\t\tbreakOneDegreeNode(np.second);\n\t      }\n\t    }\n\t  }\n\t  seen_edges[np.first][np.second] = addEdge(np.first, np.second, -1, 1.0f \/ 64.0f, 0, getNodeArray().hasTemporalCoverage() ? coverage : 1.0f);\n\t}\n      }\n    }  \n  }\n\n  cerr << \"updated graph data, nodes = \" << nodes.size() << \", edges = \" << getEdgeCount() << \", min_sig = \" << getMinSignificance() << \", skipped = \" << skipped_count << \", first = \" << is_first_level << endl;\n\n  if (is_first_level) {\n    stats.setTimeRange(min_time, max_time);\n    stats.setNumRawNodes(nodes.size());\n    stats.setNumRawEdges(source_graph.getEdgeCount());\n    \/\/ stats.setNumPosts(num_posts);\n    \/\/ stats.setNumActiveUsers(num_active_users);\n  }\n\n  return is_changed;\n}\n<commit_msg>disable debug print<commit_after>#include \"DirectedGraph.h\"\n\n#include <cassert>\n#include <iostream>\n\n#include \"RawStatistics.h\"\n\nusing namespace std;\n\nDirectedGraph::DirectedGraph(int _id) : Graph(_id) {\n\n}\n\nDirectedGraph::DirectedGraph(const DirectedGraph & other) : Graph(other) {\n  \n}\n\nstd::shared_ptr<Graph>\nDirectedGraph::createSimilar() const {\n  std::shared_ptr<Graph> graph(new DirectedGraph(getId()));\n  graph->setLocationGraphValid(false);\n  graph->setNodeVisibility(getNodeVisibility());\n  graph->setEdgeVisibility(getEdgeVisibility());\n  graph->setFaceVisibility(getFaceVisibility());\n  graph->setLabelVisibility(getLabelVisibility());\n  graph->setLineWidth(getLineWidth());\n  graph->setNodeArray(nodes);\n  \n  return graph;\n}\n\nvoid\nDirectedGraph::breakNodePair(int node_id) {\n  auto it = node_pairs.find(node_id);\n  if (it != node_pairs.end()) {\n    removeChild(node_id);\n    int other_id = it->second;\n    node_pairs.erase(it);\n\n    auto it_b = onedegree_nodes.find(node_id);\n    if (it_b != onedegree_nodes.end()) {\n      onedegree_nodes.erase(it_b);\n    }\n    \n    auto it2 = node_pairs.find(other_id);\n    assert(it2 != node_pairs.end());\n    if (it2 != node_pairs.end()) {\n      removeChild(other_id);\n      node_pairs.erase(it2);\n\n      auto it2_b = onedegree_nodes.find(other_id);\n      if (it2_b != onedegree_nodes.end()) {\n\tonedegree_nodes.erase(it2_b);\n      } else {\n\t\/\/ if a pair is broken, we add the other node to first one's group\n\tint o = getNodeArray().getOneDegreeNode(node_id);\n\taddChild(o, other_id);\n\tonedegree_nodes[other_id] = node_id;\n      }\n    }\n  }\n}\n\nvoid\nDirectedGraph::breakOneDegreeNode(int node_id) {\n  breakNodePair(node_id);\n  \n  auto it = onedegree_nodes.find(node_id);\n  if (it != onedegree_nodes.end()) {\n    removeChild(node_id);\n    onedegree_nodes.erase(it);\n  }\n}\n\nvoid\nDirectedGraph::breakZeroDegreeNode(int node_id) {\n  auto it = zerodegree_nodes.find(node_id);\n  if (it != zerodegree_nodes.end()) {\n    removeChild(node_id);\n    zerodegree_nodes.erase(it);\n  }\n}\n\nbool\nDirectedGraph::updateData(time_t start_time, time_t end_time, float start_sentiment, float end_sentiment, Graph & source_graph, RawStatistics & stats, bool is_first_level, Graph * base_graph) {\n  if (getNodeArray().hasTemporalCoverage() && !(end_time > start_time)) {\n    cerr << \"invalid time range for updateData: \" << start_time << \" - \" << end_time << endl;\n    return false;\n  }\n  \n  assert(base_graph);\n  \n  auto & sid = source_graph.getNodeArray().getTable()[\"source\"];\n  auto & soid = source_graph.getNodeArray().getTable()[\"id\"];\n  auto & user_type = source_graph.getNodeArray().getTable()[\"type\"];\n  auto & political_party = source_graph.getNodeArray().getTable()[\"party\"];\n  auto & name_column = source_graph.getNodeArray().getTable()[\"name\"];\n  auto & uname_column = source_graph.getNodeArray().getTable()[\"uname\"];\n\n  auto begin = source_graph.begin_edges();\n  auto end = source_graph.end_edges();\n  auto it = begin;\n  \n  if (current_pos == -1) {\n    clear();\n    edge_attributes.clear();\n    current_pos = 0;\n    cerr << \"restarting update, begin = \" << begin.get() << \", cp = \" << current_pos << \", end = \" << end.get() << \", source = \" << &source_graph << \", edges = \" << source_graph.getEdgeCount() << endl;\n  } else {\n    cerr << \"continuing update, begin = \" << begin.get() << \", cp = \" << current_pos << \", end = \" << end.get() << \", source = \" << &source_graph << \", edges = \" << source_graph.getEdgeCount() << endl;\n    for (int i = 0; i < current_pos; i++) ++it;\n  }\n\n  auto & nodes = getNodeArray();\n\n  unsigned int skipped_count = 0;\n  bool is_changed = false;\n  unsigned int num_edges_processed = 0;\n  for ( ; it != end; ++it, current_pos++) {\n    num_edges_processed++;\n\n    time_t t = 0;\n    float se = 0;\n    short lang = 0;\n    long long app_id = -1, filter_id = -1;\n    bool is_first = false;\n\n    assert(it->face != -1);\n    if (it->face != -1) {\n      auto & fd = source_graph.getFaceAttributes(it->face);\n      t = fd.timestamp;\n      se = fd.sentiment;\n      lang = fd.lang;\n      app_id = fd.app_id;\n      filter_id = fd.filter_id;\n      is_first = fd.first_edge == current_pos;\n    }\n\n    if (it->tail < 0 || it->head < 0 || it->tail >= nodes.size() || it->head >= nodes.size()) {\n      cerr << \"invalid values: tail = \" << it->tail << \", head = \" << it->head << \", t = \" << t << \", count = \" << nodes.size() << \", n = \" << num_edges_processed << endl;\n      assert(0);\n    }\n\n    if ((!start_time || t >= start_time) && (!end_time || t < end_time) &&\n\tse >= start_sentiment && se <= end_sentiment) {\n      if (t < min_time || min_time == 0) min_time = t;\n      if (t > max_time) max_time = t;\n\n      pair<int, int> np(it->tail, it->head);\n      short first_user_sid = sid.getInt(np.first);\n      short target_user_sid = sid.getInt(np.second);\n      long long first_user_soid = soid.getInt64(np.first);\n      long long target_user_soid = soid.getInt64(np.second);\n      \n      auto td1 = base_graph->getNodeTertiaryData(np.first); \/\/ data is copied, since the backing array might change\n      auto td2 = base_graph->getNodeTertiaryData(np.second);\n      \n      if (!is_first_level) {\n\tif (td1.indegree < getMinSignificance()) {\n\t  skipped_count++;\n\t  continue;\n\t}\n\tif (td2.indegree < getMinSignificance()) {\n\t  skipped_count++;\n\t  continue;\n\t}\n      }\n\n      is_changed = true;\n\n      auto & target_nd_old = nodes.getNodeData(np.second);\n      NodeType target_type = target_nd_old.type;\n\n      if (is_first_level && is_first) {\n\tstats.addActivity(t, first_user_sid, first_user_soid, lang, app_id, filter_id, PoliticalParty(political_party.getInt(np.first)));\n      }\n      \n      if (is_first_level && !seen_nodes.count(np.second)) {\n\tseen_nodes.insert(np.second);\n\tUserType ut = UserType(user_type.getInt(np.second));\n\tif (ut != UNKNOWN_TYPE) stats.addUserType(ut);\n\t\/\/ stats.addPoliticalParty(PoliticalParty(political_party.getInt(np.first)));\n      }\n\n      if (target_type == NODE_HASHTAG) {\n\tstats.addHashtag(name_column.getText(np.second));\n\tnum_hashtags++;\n      } else if (target_type == NODE_URL) {\n\tstats.addLink(name_column.getText(np.second), uname_column.getText(np.second));\n\tnum_links++;\n      } else {\n\tif (is_first_level && target_type == NODE_ANY) {\n\t  stats.addReceivedActivity(t, target_user_sid, target_user_soid, app_id, filter_id);\n\t}\n\n\tlong long coverage = 0;\n\tif (getNodeArray().hasTemporalCoverage()) {\n\t  assert(end_time > start_time);\n\t  int time_pos = 63LL * (t - start_time) \/ (end_time - start_time);\n\t  assert(time_pos >= 0 && time_pos < 64);\n\t  coverage |= 1 << time_pos;\n\t}\n\t\n\tunordered_map<int, unordered_map<int, int> >::iterator it1;\n\tunordered_map<int, int>::iterator it2;\n\tif ((it1 = seen_edges.find(np.first)) != seen_edges.end() &&\n\t    (it2 = it1->second.find(np.second)) != it1->second.end()) {\n#if 0\n\t  updateOutdegree(np.first, 1.0f);\n\t  updateIndegree(np.second, 1.0f);\n\t  updateNodeSize(np.first);\n\t  updateNodeSize(np.second);\n#endif\n\t  if (getNodeArray().hasTemporalCoverage()) {\n\t    auto & ed = getEdgeAttributes(it2->second);\n\t    ed.coverage |= coverage;\n\t    float new_weight = 0;\n\t    for (int i = 0; i < 64; i++) {\n\t      if (ed.coverage & (1 << i)) new_weight += 1.0f;\n\t    }\n\t    new_weight \/= 64.0f;\n\t    updateEdgeWeight(it2->second, new_weight - ed.weight);\n\t  }\n\t} else {\n\t  if (td1.indegree == 0 && td1.outdegree == 0) {\n\t    bool has_zero = zerodegree_nodes.count(np.first) != 0;\n\t    if (np.first == np.second && !has_zero) {\n\t      int z = nodes.getZeroDegreeNode();\n\t      cerr << \"DEBUG: adding node \" << np.first << \" to zero degree node (id = \" << z << \")\\n\";\n\t      addChild(z, np.first);\n\t      zerodegree_nodes.insert(np.first);\n\t    } else if (np.first != np.second && has_zero) {\n\t      cerr << \"DEBUG: removing node \" << np.first << \" from zero degree node (A)\\n\";\n\t      removeChild(np.first);\n\t      zerodegree_nodes.erase(np.first);\n\t    }\n\t    if (np.first != np.second) {\n\t      if (td2.indegree == 0 && td2.outdegree == 0) {\n\t\tbreakZeroDegreeNode(np.second);\n\t\tassert(node_pairs.find(np.first) == node_pairs.end());\n\t\tassert(node_pairs.find(np.second) == node_pairs.end());\n\t\tint o = nodes.getPairsNode();\n\t\tcerr << \"adding to pairs node\\n\";\n\t\taddChild(o, np.first);\n\t\taddChild(o, np.second);\n\t\tnode_pairs[np.first] = np.second;\n\t\tnode_pairs[np.second] = np.first;\n\t      } else if (!onedegree_nodes.count(np.first)) {\n\t\tcerr << \"adding to onedegree node (A)\\n\";\n\t\tassert(node_pairs.find(np.first) == node_pairs.end());\n\t\tbreakOneDegreeNode(np.second);\n\t\tbreakNodePair(np.second);\n\t\tint o = nodes.getOneDegreeNode(np.second);\n\t\taddChild(o, np.first);\n\t\tonedegree_nodes[np.first] = np.second;\n\t      }\n\t    }\n\t  } else {\n\t    breakNodePair(np.first);\n\t  }\n\t  if (np.first != np.second) {\n\t    if (td2.indegree == 0 && td2.outdegree == 0) {\n\t      breakZeroDegreeNode(np.second);\t      \n\t      if (td1.indegree == 0 && td1.outdegree == 0) {\n\t\t\/\/ pair was created\n\t      } else if (!onedegree_nodes.count(np.second)) {\n\t\tif (node_pairs.count(np.second)) {\n\t\t  cerr << \"ERROR!\\n\";\n\t\t} else {\n\t\t  cerr << \"adding child \" << np.second << \" to onedegree node (B) [td1.i = \" << td1.indegree << \", td1.o = \" << td1.outdegree << \"]\\n\";\n\t\t  assert(node_pairs.find(np.second) == node_pairs.end());\n\t\t  breakOneDegreeNode(np.first);\n\t\t  breakNodePair(np.first);\n\t\t  int o = nodes.getOneDegreeNode(np.first);\n\t\t  addChild(o, np.second);\n\t\t  onedegree_nodes[np.second] = np.first;\n\t\t}\n\t      }\n\t    } else {\n\t      breakNodePair(np.second);\n\t    }\n\n\t    auto od1 = onedegree_nodes.find(np.first), od2 = onedegree_nodes.find(np.second);\n\t    auto pd1 = node_pairs.find(np.first), pd2 = node_pairs.find(np.second);\n\t    bool have_same_base = od1 != onedegree_nodes.end() && od2 != onedegree_nodes.end() && od1->second == od2->second && ((pd1 == node_pairs.end() && pd2 == node_pairs.end()) || (pd1 != node_pairs.end() && pd2 != node_pairs.end() && pd1->second == np.second && pd2->second == np.first));\n\t    \n\t    if (have_same_base) {\n\t      node_pairs[np.first] = np.second;\n\t      node_pairs[np.second] = np.first;\n\t    } else {\n\t      if (td1.indegree != 0 || td1.outdegree != 0) {\n\t\tbreakOneDegreeNode(np.first);\n\t      }\n\t      if (td2.indegree != 0 || td2.outdegree != 0) {\n\t\tbreakOneDegreeNode(np.second);\n\t      }\n\t    }\n\t  }\n\t  seen_edges[np.first][np.second] = addEdge(np.first, np.second, -1, 1.0f \/ 64.0f, 0, getNodeArray().hasTemporalCoverage() ? coverage : 1.0f);\n\t}\n      }\n    }  \n  }\n\n  \/\/ cerr << \"updated graph data, nodes = \" << nodes.size() << \", edges = \" << getEdgeCount() << \", min_sig = \" << getMinSignificance() << \", skipped = \" << skipped_count << \", first = \" << is_first_level << endl;\n\n  if (is_first_level) {\n    stats.setTimeRange(min_time, max_time);\n    stats.setNumRawNodes(nodes.size());\n    stats.setNumRawEdges(source_graph.getEdgeCount());\n    \/\/ stats.setNumPosts(num_posts);\n    \/\/ stats.setNumActiveUsers(num_active_users);\n  }\n\n  return is_changed;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"stdafx.h\"\n#include \"AnnGameObject.hpp\"\n#include \"AnnTools.h\"\n#include \"AnnEngine.hpp\"\n#include \"AnnLogger.hpp\"\n\nusing namespace Annwvyn;\n\nAnnGameObject::AnnGameObject() :\n\tNode(NULL),\n\tEntity(NULL),\n\tbulletReady(false),\n\tDynamicsWorld(NULL),\n\tBody(NULL),\n\tShape(NULL),\n\tanim(NULL),\n\tanimIsLooping(false),\n\tanimIsPlaying(false),\n\tanimIsSetted(false),\n\tvisible(true)\n{\n\talGenSources(1,&source);\t\n}\n\nAnnGameObject::~AnnGameObject()\n{\n\t\/\/Clean OpenAL desaloc\n\talSourceStop(source);\n\talDeleteSources(1, &source);\n\talDeleteBuffers(1, &buffer);\n}\n\nvoid AnnGameObject::playSound(std::string path, bool loop, float volume)\n{\n\tauto engine(AnnEngine::Instance());\n\t\n\t\/\/Get sound buffer from file (will not load if allready loaded)\n\tbuffer = AnnEngine::Instance()->getAudioEngine()->loadSndFile(path);\n\t\n\talSourcei(source, AL_BUFFER, buffer);\n\tif(loop)\n\t\talSourcei(source, AL_LOOPING, AL_TRUE);\n\n\talSourcef(source, AL_GAIN, volume);\n\n\tauto currentPosition = Node->getPosition();\n\talSource3f(source, AL_POSITION,\n\t\tcurrentPosition.x,\n\t\tcurrentPosition.y,\n\t\tcurrentPosition.z);\n\talSourcePlay(source);\n}\n\nvoid AnnGameObject::updateOpenAlPos()\n{\n\tAnnVect3 pos(getPosition());\n\talSource3f(source, AL_POSITION,\n\t\tpos.x,\n\t\tpos.y,\n\t\tpos.z);\n}\n\nvoid AnnGameObject::setPosition(float x, float y, float z)\n{\n\tif(Node == NULL)\n\t\treturn;\n\n\tAnnVect3 newPosition(x,y,z);\n\n\t\/*\n\t*Position of object have to be the same in each part of the engine\n\t*(graphics, physics, audio)\n\t*\/\n\t\/\/change BulletPosition\n\tif(bulletReady)\n\t{\n\t\tauto currentPosition = Node->getPosition();\n\t\tBody->translate(btVector3(x - currentPosition.x,\n\t\t\ty - currentPosition.y,\n\t\t\tz - currentPosition.z));\n\t}\n\t\/\/change OgrePosition\n\tNode->setPosition(x, y, z);\n\n\t\/\/change OpenAL Source Position\n\talSource3f(source, AL_POSITION,\n\t\tnewPosition.x,\n\t\tnewPosition.y,\n\t\tnewPosition.z);\n}\n\nvoid AnnGameObject::translate(float x, float y, float z)\t\t  \n{\n\t\/\/Ogre\n\tNode->translate(x, y, z);\n\t\/\/Bullet\n\tif(Body)\n\tBody->translate(btVector3(x, y, z));\n\t\/\/OpenAL\n\tauto currentPosition = Node->getPosition();\n\talSource3f(source, AL_POSITION,\n\t\tcurrentPosition.x,\n\t\tcurrentPosition.y,\n\t\tcurrentPosition.z);\n\n}\n\nvoid AnnGameObject::setPosition(AnnVect3 pos)\n{\n\tsetPosition(pos.x, pos.y, pos.z);\n}\n\nvoid AnnGameObject::setPos(AnnVect3 pos)\n{\n\tsetPosition(pos);\n}\n\nvoid AnnGameObject::setPos(float x, float y, float z)\n{\n\tsetPosition(x,y,z);\n}\n\nvoid AnnGameObject::setOrientation(float w, float x, float y, float z)\n{\n\tsetOrientation(AnnQuaternion(w, x, y, z));\n\n}\n\nvoid AnnGameObject::setOrientation(AnnQuaternion orient)\n{\n\t\/\/setOrientation(orient.w,orient.x,orient.y,orient.z);\n\t\/\/beware : Ogre Quaternion convetion is WXYZ. Bullet use XYZW\n\t\/\/Ogre3D\n\tif(Node != NULL)\n\t\tNode->setOrientation(orient);\n\t\/\/bullet\n\tif(Body != NULL)\n\t{\n\t\tbtTransform t = Body->getCenterOfMassTransform();\n\t\tt.setRotation(orient.getBtQuaternion());\n\t\tBody->setCenterOfMassTransform(t);\n\t}\n}\n\nvoid AnnGameObject::setScale(AnnVect3 scale)\n{\n\tNode->setScale(scale);\n}\n\n\nvoid AnnGameObject::setScale(float x, float y, float z)\n{\n\tNode->setScale(AnnVect3(x, y, z));\n}\n\nAnnVect3 AnnGameObject::pos()\n{\n\treturn getPosition();\n}\n\nAnnVect3 AnnGameObject::getPosition()\n{\n\tif(Node != NULL)\n\t\treturn Node->getPosition();\n\treturn AnnVect3::ZERO;\n}\n\nAnnQuaternion AnnGameObject::Orientation()\n{\n\treturn getOrientation();\n}\n\nAnnQuaternion AnnGameObject::getOrientation()\n{\n\tif(Node != NULL)\n\t\treturn Node->getOrientation();\n\treturn AnnQuaternion::IDENTITY;\n}\n\nvoid AnnGameObject::setNode(Ogre::SceneNode* newNode)\n{\n\tNode = newNode;\n}\n\nvoid AnnGameObject::setEntity(Ogre::Entity* newEntity)\n{\n\tEntity = newEntity;\n}\n\nvoid AnnGameObject::setBulletDynamicsWorld(btDiscreteDynamicsWorld* dynamicsWorld)\n{\n\tDynamicsWorld = dynamicsWorld;\n}\n\nvoid AnnGameObject::setUpBullet(float mass, phyShapeType type, bool colideWithPlayer)\n{\n\t\/\/check if everything is OK\n\tif(DynamicsWorld == NULL)\n\t\treturn;\n\tif(Node == NULL)\n\t\treturn;\n\tif(Entity == NULL)\n\t\treturn;\n\n\t\/\/init shape converter\n\tBtOgre::StaticMeshToShapeConverter converter(Entity);\n\n\t\/\/create the correct shape\n\tswitch(type)\n\t{\n\tcase boxShape:\n\t\tShape = converter.createBox();\n\t\tbreak;\n\tcase cylinderShape:\n\t\tShape = converter.createCylinder();\n\t\tbreak;\n\tcase capsuleShape:\n\t\tShape = converter.createCapsule();\n\t\tbreak;\n\tcase convexShape:\n\t\tShape = converter.createConvex();\n\t\tbreak;\n\tcase staticShape:\n\t\tShape = converter.createTrimesh();\n\t\tbreak;\n\tcase sphereShape:\n\t\tShape = converter.createSphere();\n\t\tbreak;\n\tdefault:\n\t\t\/\/non valid;\n\t\treturn;\n\t}\n\n\tif(Shape == NULL)\n\t\treturn;\n\n\tAnnVect3 scale =  getNode()->getScale();\n\tShape->setLocalScaling(scale.getBtVector());\n\n\tbtVector3 inertia;\n\n\tif(mass != 0)\n\t\tShape->calculateLocalInertia(mass, inertia);\n\telse\n\t\tinertia = btVector3(0, 0, 0); \/\/No influence. But mass zero objects are static\n\n\t\/\/create rigidBody from shape\n\tif(!Body)\n\t{\n\t\tBtOgre::RigidBodyState *state = new BtOgre::RigidBodyState(Node);\n\t\tBody = new btRigidBody(mass, state, Shape, inertia);\n\t}\n\n\n\tif(Body)\n\t\tif(colideWithPlayer)\n\t\t{\n\t\t\tDynamicsWorld->addRigidBody(Body, MASK(1), MASK(0) | MASK(1));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tDynamicsWorld->addRigidBody(Body, MASK(1), MASK(1));\n\t\t}\n\telse\n\t\treturn; \/\/Unable to create the physical representation\n\n\tbulletReady = true;\n}\n\n\nOgre::SceneNode* AnnGameObject::node()\n{\n\treturn getNode();\n}\n\nOgre::SceneNode* AnnGameObject::getNode()\n{\n\treturn Node;\n}\n\nOgre::Entity* AnnGameObject::getEntity()\n{\n\treturn Entity;\n}\n\n\nbtRigidBody* AnnGameObject::RigidBody()\n{\n\treturn getBody();\n}\n\nfloat AnnGameObject::getDistance(AnnGameObject *otherObject)\n{\n\treturn Tools::Geometry::distance(this, otherObject);\n}\n\nbtRigidBody* AnnGameObject::getBody()\n{\n\treturn Body;\n}\n\nstd::vector<struct collisionTest*> AnnGameObject::getCollisionMask()\n{\n\treturn collisionMask;\n}\n\nbool AnnGameObject::collideWith(AnnGameObject* Object)\n{\n\tfor(size_t i = 0; i < collisionMask.size(); i++)\n\t\tif(collisionMask[i]->Object == Object)\n\t\t\treturn collisionMask[i]->collisionState;\n\treturn false;\n}\n\nvoid AnnGameObject::updateCollisionStateWith(AnnGameObject* Object, bool state)\n{\n\tfor(size_t i = 0; i < collisionMask.size(); i++)\n\t\tif(collisionMask[i]->Object == Object)\n\t\t\tcollisionMask[i]->collisionState = state;\n}\n\nvoid AnnGameObject::cleanCollisionMask()\n{\n\tfor(size_t i = 0; i < collisionMask.size(); i++)\n\t{\n\t\tdelete collisionMask[i];\n\t\tcollisionMask.erase(collisionMask.begin() + i);\n\t}\n}\n\nvoid AnnGameObject::resetCollisionMask()\n{\n\tfor (size_t i = 0; i < collisionMask.size(); i++)\n\t\tcollisionMask[i]->collisionState = false;\n}\n\nvoid AnnGameObject::testCollisionWith(AnnGameObject* Object)\n{\n\tif(Object == this) return; \/\/Explain me how I can colide with myself o.O\n\n\tstruct collisionTest* tester = new collisionTest;\n\n\ttester->collisionState = false;\n\ttester->Object = Object;\n\n\ttester->Receiver = this;\n\n\tcollisionMask.push_back(tester);\n}\n\nvoid AnnGameObject::stopGettingCollisionWith(AnnGameObject* Object)\n{\n\tif(!Object) return;\n\tfor(size_t i = 0; i < collisionMask.size(); i++)\n\t\tif(collisionMask[i]->Object == Object)\n\t\t{\n\t\t\tdelete(collisionMask[i]);\n\t\t\tcollisionMask[i] = NULL;\n\t\t}\n}\n\nvoid AnnGameObject::setAnimation(const char name[])\n{\n\tif(animIsSetted)\n\t{\n\t\tanim->setEnabled(false);\n\t\tanim->setLoop(false);\n\t\tanimIsSetted = false;\n\t\tanimIsLooping = false;\n\t\tanimIsPlaying = false;\n\t\tanim = NULL;\n\t}\n\n\tanim = Entity->getAnimationState(name);\n\tif (anim != NULL)\n\t\tanimIsSetted = true;\n}\n\nvoid AnnGameObject::playAnimation(bool play)\n{\n\tif(animIsSetted)\n\t{\n\t\tanim->setEnabled(play);\n\t\tanimIsPlaying = play;\n\t}\n}\n\nvoid AnnGameObject::loopAnimation(bool loop)\n{\n\tif(animIsSetted)\n\t{\n\t\tanim->setLoop(loop);\n\t\tanimIsLooping = loop;\n\t}\n}\n\nvoid AnnGameObject::addAnimationTime(double offset)\n{\n\tif(!animIsSetted || !animIsPlaying)\n\t\treturn;\n\n\tanim->addTime(float(offset));\n}\n\nvoid AnnGameObject::applyImpulse(AnnVect3 force)\n{\n\tBody->applyCentralImpulse(force.getBtVector());\n}\n\nvoid AnnGameObject::applyForce(AnnVect3 force)\n{\n\tBody->applyCentralForce(force.getBtVector());\n}\n\nvoid AnnGameObject::setLinearSpeed(AnnVect3 v)\n{\n\tif(bulletReady)\n\t\tBody->setLinearVelocity(v.getBtVector());\n}\n\n\nvoid AnnGameObject::setVisible()\n{\n\tvisible = true;\n\tgetNode()->setVisible(true);\n}\n\nvoid AnnGameObject::setInvisible()\n{\n\tvisible = false;\n\tgetNode()->setVisible(false);\n}\n\nbool AnnGameObject::isVisible()\n{\n\treturn visible;\n}\n\nvoid AnnGameObject::setID(std::string ID)\n{\n\tid = ID;\n}\n\nstd::string AnnGameObject::getID()\n{\n\treturn id;\n}\n<commit_msg>Remove useless pointer<commit_after>#include \"stdafx.h\"\n#include \"AnnGameObject.hpp\"\n#include \"AnnTools.h\"\n#include \"AnnEngine.hpp\"\n#include \"AnnLogger.hpp\"\n\nusing namespace Annwvyn;\n\nAnnGameObject::AnnGameObject() :\n\tNode(NULL),\n\tEntity(NULL),\n\tbulletReady(false),\n\tDynamicsWorld(NULL),\n\tBody(NULL),\n\tShape(NULL),\n\tanim(NULL),\n\tanimIsLooping(false),\n\tanimIsPlaying(false),\n\tanimIsSetted(false),\n\tvisible(true)\n{\n\talGenSources(1,&source);\t\n}\n\nAnnGameObject::~AnnGameObject()\n{\n\t\/\/Clean OpenAL desaloc\n\talSourceStop(source);\n\talDeleteSources(1, &source);\n\talDeleteBuffers(1, &buffer);\n}\n\nvoid AnnGameObject::playSound(std::string path, bool loop, float volume)\n{\n\t\/\/Get sound buffer from file (will not load if allready loaded)\n\tbuffer = AnnEngine::Instance()->getAudioEngine()->loadSndFile(path);\n\t\n\talSourcei(source, AL_BUFFER, buffer);\n\tif(loop)\n\t\talSourcei(source, AL_LOOPING, AL_TRUE);\n\n\talSourcef(source, AL_GAIN, volume);\n\n\tauto currentPosition = Node->getPosition();\n\talSource3f(source, AL_POSITION,\n\t\tcurrentPosition.x,\n\t\tcurrentPosition.y,\n\t\tcurrentPosition.z);\n\talSourcePlay(source);\n}\n\nvoid AnnGameObject::updateOpenAlPos()\n{\n\tAnnVect3 pos(getPosition());\n\talSource3f(source, AL_POSITION,\n\t\tpos.x,\n\t\tpos.y,\n\t\tpos.z);\n}\n\nvoid AnnGameObject::setPosition(float x, float y, float z)\n{\n\tif(Node == NULL)\n\t\treturn;\n\n\tAnnVect3 newPosition(x,y,z);\n\n\t\/*\n\t*Position of object have to be the same in each part of the engine\n\t*(graphics, physics, audio)\n\t*\/\n\t\/\/change BulletPosition\n\tif(bulletReady)\n\t{\n\t\tauto currentPosition = Node->getPosition();\n\t\tBody->translate(btVector3(x - currentPosition.x,\n\t\t\ty - currentPosition.y,\n\t\t\tz - currentPosition.z));\n\t}\n\t\/\/change OgrePosition\n\tNode->setPosition(x, y, z);\n\n\t\/\/change OpenAL Source Position\n\talSource3f(source, AL_POSITION,\n\t\tnewPosition.x,\n\t\tnewPosition.y,\n\t\tnewPosition.z);\n}\n\nvoid AnnGameObject::translate(float x, float y, float z)\t\t  \n{\n\t\/\/Ogre\n\tNode->translate(x, y, z);\n\t\/\/Bullet\n\tif(Body)\n\tBody->translate(btVector3(x, y, z));\n\t\/\/OpenAL\n\tauto currentPosition = Node->getPosition();\n\talSource3f(source, AL_POSITION,\n\t\tcurrentPosition.x,\n\t\tcurrentPosition.y,\n\t\tcurrentPosition.z);\n\n}\n\nvoid AnnGameObject::setPosition(AnnVect3 pos)\n{\n\tsetPosition(pos.x, pos.y, pos.z);\n}\n\nvoid AnnGameObject::setPos(AnnVect3 pos)\n{\n\tsetPosition(pos);\n}\n\nvoid AnnGameObject::setPos(float x, float y, float z)\n{\n\tsetPosition(x,y,z);\n}\n\nvoid AnnGameObject::setOrientation(float w, float x, float y, float z)\n{\n\tsetOrientation(AnnQuaternion(w, x, y, z));\n\n}\n\nvoid AnnGameObject::setOrientation(AnnQuaternion orient)\n{\n\t\/\/setOrientation(orient.w,orient.x,orient.y,orient.z);\n\t\/\/beware : Ogre Quaternion convetion is WXYZ. Bullet use XYZW\n\t\/\/Ogre3D\n\tif(Node != NULL)\n\t\tNode->setOrientation(orient);\n\t\/\/bullet\n\tif(Body != NULL)\n\t{\n\t\tbtTransform t = Body->getCenterOfMassTransform();\n\t\tt.setRotation(orient.getBtQuaternion());\n\t\tBody->setCenterOfMassTransform(t);\n\t}\n}\n\nvoid AnnGameObject::setScale(AnnVect3 scale)\n{\n\tNode->setScale(scale);\n}\n\n\nvoid AnnGameObject::setScale(float x, float y, float z)\n{\n\tNode->setScale(AnnVect3(x, y, z));\n}\n\nAnnVect3 AnnGameObject::pos()\n{\n\treturn getPosition();\n}\n\nAnnVect3 AnnGameObject::getPosition()\n{\n\tif(Node != NULL)\n\t\treturn Node->getPosition();\n\treturn AnnVect3::ZERO;\n}\n\nAnnQuaternion AnnGameObject::Orientation()\n{\n\treturn getOrientation();\n}\n\nAnnQuaternion AnnGameObject::getOrientation()\n{\n\tif(Node != NULL)\n\t\treturn Node->getOrientation();\n\treturn AnnQuaternion::IDENTITY;\n}\n\nvoid AnnGameObject::setNode(Ogre::SceneNode* newNode)\n{\n\tNode = newNode;\n}\n\nvoid AnnGameObject::setEntity(Ogre::Entity* newEntity)\n{\n\tEntity = newEntity;\n}\n\nvoid AnnGameObject::setBulletDynamicsWorld(btDiscreteDynamicsWorld* dynamicsWorld)\n{\n\tDynamicsWorld = dynamicsWorld;\n}\n\nvoid AnnGameObject::setUpBullet(float mass, phyShapeType type, bool colideWithPlayer)\n{\n\t\/\/check if everything is OK\n\tif(DynamicsWorld == NULL)\n\t\treturn;\n\tif(Node == NULL)\n\t\treturn;\n\tif(Entity == NULL)\n\t\treturn;\n\n\t\/\/init shape converter\n\tBtOgre::StaticMeshToShapeConverter converter(Entity);\n\n\t\/\/create the correct shape\n\tswitch(type)\n\t{\n\tcase boxShape:\n\t\tShape = converter.createBox();\n\t\tbreak;\n\tcase cylinderShape:\n\t\tShape = converter.createCylinder();\n\t\tbreak;\n\tcase capsuleShape:\n\t\tShape = converter.createCapsule();\n\t\tbreak;\n\tcase convexShape:\n\t\tShape = converter.createConvex();\n\t\tbreak;\n\tcase staticShape:\n\t\tShape = converter.createTrimesh();\n\t\tbreak;\n\tcase sphereShape:\n\t\tShape = converter.createSphere();\n\t\tbreak;\n\tdefault:\n\t\t\/\/non valid;\n\t\treturn;\n\t}\n\n\tif(Shape == NULL)\n\t\treturn;\n\n\tAnnVect3 scale =  getNode()->getScale();\n\tShape->setLocalScaling(scale.getBtVector());\n\n\tbtVector3 inertia;\n\n\tif(mass != 0)\n\t\tShape->calculateLocalInertia(mass, inertia);\n\telse\n\t\tinertia = btVector3(0, 0, 0); \/\/No influence. But mass zero objects are static\n\n\t\/\/create rigidBody from shape\n\tif(!Body)\n\t{\n\t\tBtOgre::RigidBodyState *state = new BtOgre::RigidBodyState(Node);\n\t\tBody = new btRigidBody(mass, state, Shape, inertia);\n\t}\n\n\n\tif(Body)\n\t\tif(colideWithPlayer)\n\t\t{\n\t\t\tDynamicsWorld->addRigidBody(Body, MASK(1), MASK(0) | MASK(1));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tDynamicsWorld->addRigidBody(Body, MASK(1), MASK(1));\n\t\t}\n\telse\n\t\treturn; \/\/Unable to create the physical representation\n\n\tbulletReady = true;\n}\n\n\nOgre::SceneNode* AnnGameObject::node()\n{\n\treturn getNode();\n}\n\nOgre::SceneNode* AnnGameObject::getNode()\n{\n\treturn Node;\n}\n\nOgre::Entity* AnnGameObject::getEntity()\n{\n\treturn Entity;\n}\n\n\nbtRigidBody* AnnGameObject::RigidBody()\n{\n\treturn getBody();\n}\n\nfloat AnnGameObject::getDistance(AnnGameObject *otherObject)\n{\n\treturn Tools::Geometry::distance(this, otherObject);\n}\n\nbtRigidBody* AnnGameObject::getBody()\n{\n\treturn Body;\n}\n\nstd::vector<struct collisionTest*> AnnGameObject::getCollisionMask()\n{\n\treturn collisionMask;\n}\n\nbool AnnGameObject::collideWith(AnnGameObject* Object)\n{\n\tfor(size_t i = 0; i < collisionMask.size(); i++)\n\t\tif(collisionMask[i]->Object == Object)\n\t\t\treturn collisionMask[i]->collisionState;\n\treturn false;\n}\n\nvoid AnnGameObject::updateCollisionStateWith(AnnGameObject* Object, bool state)\n{\n\tfor(size_t i = 0; i < collisionMask.size(); i++)\n\t\tif(collisionMask[i]->Object == Object)\n\t\t\tcollisionMask[i]->collisionState = state;\n}\n\nvoid AnnGameObject::cleanCollisionMask()\n{\n\tfor(size_t i = 0; i < collisionMask.size(); i++)\n\t{\n\t\tdelete collisionMask[i];\n\t\tcollisionMask.erase(collisionMask.begin() + i);\n\t}\n}\n\nvoid AnnGameObject::resetCollisionMask()\n{\n\tfor (size_t i = 0; i < collisionMask.size(); i++)\n\t\tcollisionMask[i]->collisionState = false;\n}\n\nvoid AnnGameObject::testCollisionWith(AnnGameObject* Object)\n{\n\tif(Object == this) return; \/\/Explain me how I can colide with myself o.O\n\n\tstruct collisionTest* tester = new collisionTest;\n\n\ttester->collisionState = false;\n\ttester->Object = Object;\n\n\ttester->Receiver = this;\n\n\tcollisionMask.push_back(tester);\n}\n\nvoid AnnGameObject::stopGettingCollisionWith(AnnGameObject* Object)\n{\n\tif(!Object) return;\n\tfor(size_t i = 0; i < collisionMask.size(); i++)\n\t\tif(collisionMask[i]->Object == Object)\n\t\t{\n\t\t\tdelete(collisionMask[i]);\n\t\t\tcollisionMask[i] = NULL;\n\t\t}\n}\n\nvoid AnnGameObject::setAnimation(const char name[])\n{\n\tif(animIsSetted)\n\t{\n\t\tanim->setEnabled(false);\n\t\tanim->setLoop(false);\n\t\tanimIsSetted = false;\n\t\tanimIsLooping = false;\n\t\tanimIsPlaying = false;\n\t\tanim = NULL;\n\t}\n\n\tanim = Entity->getAnimationState(name);\n\tif (anim != NULL)\n\t\tanimIsSetted = true;\n}\n\nvoid AnnGameObject::playAnimation(bool play)\n{\n\tif(animIsSetted)\n\t{\n\t\tanim->setEnabled(play);\n\t\tanimIsPlaying = play;\n\t}\n}\n\nvoid AnnGameObject::loopAnimation(bool loop)\n{\n\tif(animIsSetted)\n\t{\n\t\tanim->setLoop(loop);\n\t\tanimIsLooping = loop;\n\t}\n}\n\nvoid AnnGameObject::addAnimationTime(double offset)\n{\n\tif(!animIsSetted || !animIsPlaying)\n\t\treturn;\n\n\tanim->addTime(float(offset));\n}\n\nvoid AnnGameObject::applyImpulse(AnnVect3 force)\n{\n\tBody->applyCentralImpulse(force.getBtVector());\n}\n\nvoid AnnGameObject::applyForce(AnnVect3 force)\n{\n\tBody->applyCentralForce(force.getBtVector());\n}\n\nvoid AnnGameObject::setLinearSpeed(AnnVect3 v)\n{\n\tif(bulletReady)\n\t\tBody->setLinearVelocity(v.getBtVector());\n}\n\n\nvoid AnnGameObject::setVisible()\n{\n\tvisible = true;\n\tgetNode()->setVisible(true);\n}\n\nvoid AnnGameObject::setInvisible()\n{\n\tvisible = false;\n\tgetNode()->setVisible(false);\n}\n\nbool AnnGameObject::isVisible()\n{\n\treturn visible;\n}\n\nvoid AnnGameObject::setID(std::string ID)\n{\n\tid = ID;\n}\n\nstd::string AnnGameObject::getID()\n{\n\treturn id;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"RemotePlayer.hpp\"\n\nRemotePlayer::RemotePlayer(\n\tstd::string name,\n\tOgreBulletDynamics::DynamicsWorld *world,\n\tBombManager *bombManager\n):\n\tOgrePlayer(name, world, bombManager),\n\tmBombCooldown(0)\n{\n}\n\nRemotePlayer::~RemotePlayer(){\n}\n\nvoid RemotePlayer::generateGraphics(){\n\n\tif(mGraphicsSetUp)\n\t\treturn;\n\n\tusing namespace Ogre;\n\n\tmEntity = mWorld->getSceneManager()->createEntity(\"bomberman.mesh\");\n\tmEntity->setCastShadows(true);\n\tVector3 size = computeHitboxSize();\n\n\tSceneNode *bodyNode = mWorld->getSceneManager()->getRootSceneNode()->createChildSceneNode();\n\n\tSceneNode *entityNode = bodyNode->createChildSceneNode();\n\tentityNode->attachObject(mEntity);\n\tentityNode->scale(0.1, 0.1, 0.1);\n\tentityNode->setPosition(0, -0.3, 0);\n\n\tgenerateHitbox(size, bodyNode);\n\n\tmPlayerAnimationState = new PlayerAnimation(mWorld->getSceneManager(), mEntity);\n\n\tmGraphicsSetUp = true;\n\n}\n\nbool RemotePlayer::frameRenderingQueued(const Ogre::FrameEvent &evt){\n\n\tcomputeAcceleration();\n\tcomputeVelocity(evt);\n\tcomputeNodePosition(evt);\n\n\tmBombCooldown -= evt.timeSinceLastFrame;\n\n\tif(mPuttingBomb && mBombCooldown <= 0) {\n\t\tmBombManager->add(mNickname + \"bomb\", Ogre::Vector3(getX() ,getY() ,getZ()) + getForwardDirection());\n\t\tmBombCooldown = 1;\n\t}\n\n\tif(mGraphicsSetUp){\n\t\tif (mVelocity.x != 0 && mVelocity.z != 0)\n\t\t\tmPlayerAnimationState->doRunAnimation();\n\t\telse {\n\t\t\tmPlayerAnimationState->doIdleAnimation();\n\t\t}\n\n\t\tmBody->getBulletRigidBody()->proceedToTransform(\n\t\t\tbtTransform(\n\t\t\t\tbtQuaternion(Ogre::Degree(mYaw + 180).valueRadians(), 0, 0),\n\t\t\t\tbtVector3(mX, mY, mZ)\n\t\t\t)\n\t\t);\n\n\t\tmBody->setLinearVelocity(Ogre::Vector3::ZERO);\n\n\t\tmPlayerAnimationState->getPlayerAnimationState()->addTime(evt.timeSinceLastFrame);\n\t}\n\n\tresetCorrection();\n\n\treturn true;\n\n}\n\nvoid RemotePlayer::win(){\n\n\tif(mIsDead)\n\t\treturn;\n\n\tmHasWon = true;\n\n\tmGoingForward = false;\n\tmGoingBack = false;\n\tmGoingLeft = false;\n\tmGoingRight = false;\n\tmGoingUp = false;\n\tmGoingDown = false;\n\tmFastMove = false;\n\n\tmX = mStartingX;\n\tmY = mStartingY + 10;\n\tmZ = mStartingZ;\n\n\tmWasTeleported = true;\n\n}\n\nvoid RemotePlayer::die(){\n\n\tif(mHasWon)\n\t\treturn;\n\n\tmIsDead = true;\n\n\tmGoingForward = false;\n\tmGoingBack = false;\n\tmGoingLeft = false;\n\tmGoingRight = false;\n\tmGoingUp = false;\n\tmGoingDown = false;\n\tmFastMove = false;\n\n\tmX = mStartingX;\n\tmY = mStartingY + 10;\n\tmZ = mStartingZ;\n\n\tmWasTeleported = true;\n\n}\n<commit_msg>RemotePlayer now stop placing bombs after death as well<commit_after>#include \"RemotePlayer.hpp\"\n\nRemotePlayer::RemotePlayer(\n\tstd::string name,\n\tOgreBulletDynamics::DynamicsWorld *world,\n\tBombManager *bombManager\n):\n\tOgrePlayer(name, world, bombManager),\n\tmBombCooldown(0)\n{\n}\n\nRemotePlayer::~RemotePlayer(){\n}\n\nvoid RemotePlayer::generateGraphics(){\n\n\tif(mGraphicsSetUp)\n\t\treturn;\n\n\tusing namespace Ogre;\n\n\tmEntity = mWorld->getSceneManager()->createEntity(\"bomberman.mesh\");\n\tmEntity->setCastShadows(true);\n\tVector3 size = computeHitboxSize();\n\n\tSceneNode *bodyNode = mWorld->getSceneManager()->getRootSceneNode()->createChildSceneNode();\n\n\tSceneNode *entityNode = bodyNode->createChildSceneNode();\n\tentityNode->attachObject(mEntity);\n\tentityNode->scale(0.1, 0.1, 0.1);\n\tentityNode->setPosition(0, -0.3, 0);\n\n\tgenerateHitbox(size, bodyNode);\n\n\tmPlayerAnimationState = new PlayerAnimation(mWorld->getSceneManager(), mEntity);\n\n\tmGraphicsSetUp = true;\n\n}\n\nbool RemotePlayer::frameRenderingQueued(const Ogre::FrameEvent &evt){\n\n\tcomputeAcceleration();\n\tcomputeVelocity(evt);\n\tcomputeNodePosition(evt);\n\n\tmBombCooldown -= evt.timeSinceLastFrame;\n\n\tif(mPuttingBomb && mBombCooldown <= 0) {\n\t\tmBombManager->add(mNickname + \"bomb\", Ogre::Vector3(getX() ,getY() ,getZ()) + getForwardDirection());\n\t\tmBombCooldown = 1;\n\t}\n\n\tif(mGraphicsSetUp){\n\t\tif (mVelocity.x != 0 && mVelocity.z != 0)\n\t\t\tmPlayerAnimationState->doRunAnimation();\n\t\telse {\n\t\t\tmPlayerAnimationState->doIdleAnimation();\n\t\t}\n\n\t\tmBody->getBulletRigidBody()->proceedToTransform(\n\t\t\tbtTransform(\n\t\t\t\tbtQuaternion(Ogre::Degree(mYaw + 180).valueRadians(), 0, 0),\n\t\t\t\tbtVector3(mX, mY, mZ)\n\t\t\t)\n\t\t);\n\n\t\tmBody->setLinearVelocity(Ogre::Vector3::ZERO);\n\n\t\tmPlayerAnimationState->getPlayerAnimationState()->addTime(evt.timeSinceLastFrame);\n\t}\n\n\tresetCorrection();\n\n\treturn true;\n\n}\n\nvoid RemotePlayer::win(){\n\n\tif(mIsDead)\n\t\treturn;\n\n\tmHasWon = true;\n\n\tmGoingForward = false;\n\tmGoingBack = false;\n\tmGoingLeft = false;\n\tmGoingRight = false;\n\tmPuttingBomb = false;\n\tmGoingUp = false;\n\tmGoingDown = false;\n\tmFastMove = false;\n\n\tmX = mStartingX;\n\tmY = mStartingY + 10;\n\tmZ = mStartingZ;\n\n\tmWasTeleported = true;\n\n}\n\nvoid RemotePlayer::die(){\n\n\tif(mHasWon)\n\t\treturn;\n\n\tmIsDead = true;\n\n\tmGoingForward = false;\n\tmGoingBack = false;\n\tmGoingLeft = false;\n\tmGoingRight = false;\n\tmPuttingBomb = false;\n\tmGoingUp = false;\n\tmGoingDown = false;\n\tmFastMove = false;\n\n\tmX = mStartingX;\n\tmY = mStartingY + 10;\n\tmZ = mStartingZ;\n\n\tmWasTeleported = true;\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/                     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#include <cassert>\n#include <vector>\n#include <set>\n\n#include \"llvm\/IR\/DataLayout.h\"\n#include \"llvm\/IR\/BasicBlock.h\"\n#include \"llvm\/IR\/Constants.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/IR\/GlobalVariable.h\"\n#include \"llvm\/IR\/Instructions.h\"\n#include \"llvm\/IR\/Module.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/IR\/Type.h\"\n#include \"llvm\/IR\/TypeBuilder.h\"\n#if (LLVM_VERSION_MINOR >= 5)\n  #include \"llvm\/IR\/InstIterator.h\"\n#else\n  #include \"llvm\/Support\/InstIterator.h\"\n#endif\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Transforms\/Utils\/BasicBlockUtils.h\"\n#include <llvm\/IR\/DebugInfoMetadata.h>\n\nusing namespace llvm;\n\nnamespace {\n\nstatic void CallAddMetadata(CallInst *CI, Instruction *I)\n{\n  if (const DISubprogram *DS = I->getParent()->getParent()->getSubprogram()) {\n    \/\/ no metadata? then it is going to be the instrumentation\n    \/\/ of alloca or such at the beggining of function,\n    \/\/ so just add debug loc of the beginning of the function\n    CI->setDebugLoc(DebugLoc::get(DS->getLine(), 0, DS));\n  }\n}\n\nclass ReplaceUBSan : public FunctionPass {\n  public:\n    static char ID;\n\n    ReplaceUBSan() : FunctionPass(ID) {}\n\n    virtual bool runOnFunction(Function &F);\n};\n\nbool ReplaceUBSan::runOnFunction(Function &F)\n{\n  bool modified = false;\n  Module *M = F.getParent();\n  Function *ver_err = nullptr;\n\n  for (inst_iterator I = inst_begin(F), E = inst_end(F); I != E;) {\n    Instruction *ins = &*I;\n    ++I;\n    if (CallInst *CI = dyn_cast<CallInst>(ins)) {\n      if (CI->isInlineAsm())\n        continue;\n\n      const Value *val = CI->getCalledValue()->stripPointerCasts();\n      const Function *callee = dyn_cast<Function>(val);\n      if (!callee || callee->isIntrinsic())\n        continue;\n\n      assert(callee->hasName());\n      StringRef name = callee->getName();\n\n      if (!name.startswith(\"__ubsan_handle\"))\n        continue;\n\n      if (callee->isDeclaration()) {\n        if (!ver_err) {\n          LLVMContext& Ctx = M->getContext();\n          ver_err = cast<Function>(M->getOrInsertFunction(\"__VERIFIER_error\",\n                                                          Type::getVoidTy(Ctx),\n                                                          nullptr));\n        }\n\n        auto CI2 = CallInst::Create(ver_err);\n        CallAddMetadata(CI2, CI);\n\n        CI2->insertAfter(CI);\n        CI->eraseFromParent();\n\n        modified = true;\n      }\n    }\n  }\n  return modified;\n}\n\n} \/\/ namespace\n\nstatic RegisterPass<ReplaceUBSan> RUBS(\"replace-ubsan\",\n                                       \"Replace ubsan calls with calls to __VERIFIER_error\");\nchar ReplaceUBSan::ID;\n\n\nnamespace {\n\nclass RemoveErrorCalls : public FunctionPass {\n  public:\n    static char ID;\n\n    RemoveErrorCalls() : FunctionPass(ID) {}\n\n    virtual bool runOnFunction(Function &F);\n};\n\nbool RemoveErrorCalls::runOnFunction(Function &F)\n{\n  bool modified = false;\n  Module *M = F.getParent();\n  std::unique_ptr<CallInst> ext;\n\n  for (inst_iterator I = inst_begin(F), E = inst_end(F); I != E;) {\n    Instruction *ins = &*I;\n    ++I;\n    if (CallInst *CI = dyn_cast<CallInst>(ins)) {\n      if (CI->isInlineAsm())\n        continue;\n\n      const Value *val = CI->getCalledValue()->stripPointerCasts();\n      const Function *callee = dyn_cast<Function>(val);\n      if (!callee || callee->isIntrinsic())\n        continue;\n\n      assert(callee->hasName());\n      StringRef name = callee->getName();\n\n      if (name.equals(\"__VERIFIER_error\")) {\n        if (!ext) {\n          LLVMContext& Ctx = M->getContext();\n          Type *argTy = Type::getInt32Ty(Ctx);\n          Function *extF\n            = cast<Function>(M->getOrInsertFunction(\"exit\",\n                                                    Type::getVoidTy(Ctx),\n                                                    argTy, nullptr));\n\n          std::vector<Value *> args = { ConstantInt::get(argTy, 0) };\n          ext = std::unique_ptr<CallInst>(CallInst::Create(extF, args));\n        }\n\n        auto CI2 = ext->clone();\n        CI2->insertAfter(CI);\n        CI->eraseFromParent();\n\n        modified = true;\n      } else if (name.equals(\"__VERIFIER_assert\")) {\n        CI->eraseFromParent();\n        modified = true;\n      }\n    }\n  }\n  return modified;\n}\n\n} \/\/ namespace\n\nstatic RegisterPass<RemoveErrorCalls> RERC(\"remove-error-calls\",\n                                           \"Remove calls to __VERIFIER_error\");\nchar RemoveErrorCalls::ID;\n\n<commit_msg>replace-ubsan: do not cast the functions to Function<commit_after>\/\/                     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#include <cassert>\n#include <vector>\n#include <set>\n\n#include \"llvm\/IR\/DataLayout.h\"\n#include \"llvm\/IR\/BasicBlock.h\"\n#include \"llvm\/IR\/Constants.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/IR\/GlobalVariable.h\"\n#include \"llvm\/IR\/Instructions.h\"\n#include \"llvm\/IR\/Module.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/IR\/Type.h\"\n#include \"llvm\/IR\/TypeBuilder.h\"\n#if (LLVM_VERSION_MINOR >= 5)\n  #include \"llvm\/IR\/InstIterator.h\"\n#else\n  #include \"llvm\/Support\/InstIterator.h\"\n#endif\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Transforms\/Utils\/BasicBlockUtils.h\"\n#include <llvm\/IR\/DebugInfoMetadata.h>\n\nusing namespace llvm;\n\nnamespace {\n\nstatic void CallAddMetadata(CallInst *CI, Instruction *I)\n{\n  if (const DISubprogram *DS = I->getParent()->getParent()->getSubprogram()) {\n    \/\/ no metadata? then it is going to be the instrumentation\n    \/\/ of alloca or such at the beggining of function,\n    \/\/ so just add debug loc of the beginning of the function\n    CI->setDebugLoc(DebugLoc::get(DS->getLine(), 0, DS));\n  }\n}\n\nclass ReplaceUBSan : public FunctionPass {\n  public:\n    static char ID;\n\n    ReplaceUBSan() : FunctionPass(ID) {}\n\n    virtual bool runOnFunction(Function &F);\n};\n\nbool ReplaceUBSan::runOnFunction(Function &F)\n{\n  bool modified = false;\n  Module *M = F.getParent();\n  Constant *ver_err = nullptr;\n\n  for (inst_iterator I = inst_begin(F), E = inst_end(F); I != E;) {\n    Instruction *ins = &*I;\n    ++I;\n    if (CallInst *CI = dyn_cast<CallInst>(ins)) {\n      if (CI->isInlineAsm())\n        continue;\n\n      const Value *val = CI->getCalledValue()->stripPointerCasts();\n      const Function *callee = dyn_cast<Function>(val);\n      if (!callee || callee->isIntrinsic())\n        continue;\n\n      assert(callee->hasName());\n      StringRef name = callee->getName();\n\n      if (!name.startswith(\"__ubsan_handle\"))\n        continue;\n\n      if (callee->isDeclaration()) {\n        if (!ver_err) {\n          LLVMContext& Ctx = M->getContext();\n          ver_err = M->getOrInsertFunction(\"__VERIFIER_error\",\n                                           Type::getVoidTy(Ctx),\n                                           nullptr);\n        }\n\n        auto CI2 = CallInst::Create(ver_err);\n        CallAddMetadata(CI2, CI);\n\n        CI2->insertAfter(CI);\n        CI->eraseFromParent();\n\n        modified = true;\n      }\n    }\n  }\n  return modified;\n}\n\n} \/\/ namespace\n\nstatic RegisterPass<ReplaceUBSan> RUBS(\"replace-ubsan\",\n                                       \"Replace ubsan calls with calls to __VERIFIER_error\");\nchar ReplaceUBSan::ID;\n\n\nnamespace {\n\nclass RemoveErrorCalls : public FunctionPass {\n  public:\n    static char ID;\n\n    RemoveErrorCalls() : FunctionPass(ID) {}\n\n    virtual bool runOnFunction(Function &F);\n};\n\nbool RemoveErrorCalls::runOnFunction(Function &F)\n{\n  bool modified = false;\n  Module *M = F.getParent();\n  std::unique_ptr<CallInst> ext;\n\n  for (inst_iterator I = inst_begin(F), E = inst_end(F); I != E;) {\n    Instruction *ins = &*I;\n    ++I;\n    if (CallInst *CI = dyn_cast<CallInst>(ins)) {\n      if (CI->isInlineAsm())\n        continue;\n\n      const Value *val = CI->getCalledValue()->stripPointerCasts();\n      const Function *callee = dyn_cast<Function>(val);\n      if (!callee || callee->isIntrinsic())\n        continue;\n\n      assert(callee->hasName());\n      StringRef name = callee->getName();\n\n      if (name.equals(\"__VERIFIER_error\")) {\n        if (!ext) {\n          LLVMContext& Ctx = M->getContext();\n          Type *argTy = Type::getInt32Ty(Ctx);\n          Constant *extF\n            = M->getOrInsertFunction(\"exit\", Type::getVoidTy(Ctx),\n                                     argTy, nullptr);\n\n          std::vector<Value *> args = { ConstantInt::get(argTy, 0) };\n          ext = std::unique_ptr<CallInst>(CallInst::Create(extF, args));\n        }\n\n        auto CI2 = ext->clone();\n        CI2->insertAfter(CI);\n        CI->eraseFromParent();\n\n        modified = true;\n      } else if (name.equals(\"__VERIFIER_assert\")) {\n        CI->eraseFromParent();\n        modified = true;\n      }\n    }\n  }\n  return modified;\n}\n\n} \/\/ namespace\n\nstatic RegisterPass<RemoveErrorCalls> RERC(\"remove-error-calls\",\n                                           \"Remove calls to __VERIFIER_error\");\nchar RemoveErrorCalls::ID;\n\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright (c) 2017 Wenova - Rise of Conquerors. All rights reserved.\n *\n * This work is licensed under the terms of the MIT license.\n * For a copy, see <https:\/\/opensource.org\/licenses\/MIT>.\n *\/\n\/**\n * @file EditableFloor.cpp\n * Implements class EditableFloor methods.\n *\/\n\n\/**\n * Commented debugs should be used with extreme care because it causes\n * extremelly lose of performance and giant log files.\n *\/\n\n#include \"EditableFloor.h\"\n\n#include \"Collision.h\"\n#include \"InputManager.h\"\n#include \"Rectangle.h\"\n\n#include <cstdio>\n\n#define BACKGROUND_WIDTH 1280\n#define BACKGROUND_HEIGHT 720\n\n#define RESIZING_SPEED 0.005\n#define ROTATING_SPEED 0.01\n#define MOVE_SPEED 0.5\n\n#define ACCELERATION 1\n#define MAXIMUM_ACCELERATION 4\n#define ACCELERATION_INCREASE_STEP 0.2\n\n#define RIGID_PLATFORM_PATH \"edit_state\/floor\/editable_floor.png\"\n#define CROSSINGABLE_PLATFORM_PATH \"edit_state\/floor\/editable_platform.png\"\n#define SELECTED_CROSSINGABLE_PLATFORM_PATH \\\n    \"edit_state\/floor\/selected_editable_floor.png\"\n\n#define DEBUG_SIZE 500\n#define FILL_MISSING_PIXELS_DEBUGRMATIONS 15\n\n#define LAYER 0\n#define FLOOR_INITIAL_WIDTH 100\n#define PI 3.14159265358979\n#define PI_DEGREES 180\n\n\/**\n * Create box with default width of 100px.\n *\n * @param x Position in X axis. Unit: px, [0,screen_width]\n * @param y Position in Y axis. Unit: px, [0,screen_height]\n * @param crotation Unit: degrees\n * @param cplatform [0,1]\n *\/\nEditableFloor::EditableFloor(float x, float y, float crotation, bool cplatform)\n    : Floor(x, y, FLOOR_INITIAL_WIDTH, crotation, cplatform),\n      standard_sprite(Sprite(RIGID_PLATFORM_PATH)),\n      platform_sprite(Sprite(CROSSINGABLE_PLATFORM_PATH)),\n      selected_sprite(Sprite(SELECTED_CROSSINGABLE_PLATFORM_PATH)) {\n#ifndef NDEBUG\n    try {\n        std::string log_message = \"Starting EditableFloor constructor with x: \";\n        log_message += std::to_string(x) + \", y: \" + std::to_string(y);\n        log_message += \", crotation: \" + std::to_string(crotation);\n        log_message +=\n            \", cplatfrom: \" + std::to_string(static_cast<int>(cplatform));\n\n        LOG(DEBUG) << log_message;\n    } catch (std::bad_alloc &error) {\n        string str_error(error.what());\n        string log_message = \"Couldn't convert to string: \" + str_error + '\\n';\n        LOG(FATAL) << log_message;\n    }\n#endif\n\n    box = Rectangle(x, y, standard_sprite.get_width(),\n                    standard_sprite.get_height());\n\n    is_deleted = false;\n    is_selected = false;\n\n    LOG(DEBUG) << \"Ending EditableFloor constructor\";\n}\n\n\/**\n * Create box with specific width.\n *\n * @param x Position in X axis. Unit: px, [0,screen_width]\n * @param y Position in Y axis. Unit: px, [0,screen_height]\n * @param width Unit: px, [0,]\n * @param crotation Unit: degrees\n * @param cplatform [0,1]\n *\/\nEditableFloor::EditableFloor(float x, float y, float width, float crotation,\n                             bool cplatform)\n    : EditableFloor(x, y, crotation, cplatform) {\n#ifndef NDEBUG\n    try {\n        std::string log_message = \"Starting EditableFloor constructor with x: \";\n        log_message += std::to_string(x) + \", y: \" + std::to_string(y);\n        log_message += \", width:\" + std::to_string(width);\n        log_message += \", crotation: \" + std::to_string(crotation);\n        log_message +=\n            \", cplatfrom: \" + std::to_string(static_cast<int>(cplatform));\n        LOG(DEBUG) << log_message;\n    } catch (std::bad_alloc &error) {\n        string str_error(error.what());\n        string log_message = \"Couldn't convert to string: \" + str_error + '\\n';\n        LOG(FATAL) << log_message;\n    }\n\n    if (x <= BACKGROUND_WIDTH) {\n        \/* Nothing to do. *\/\n    } else {\n        LOG(FATAL) << \"platform is out of screen in axis x\";\n    }\n\n    if (x <= BACKGROUND_WIDTH) {\n        \/* Nothing to do. *\/\n    } else {\n        LOG(FATAL) << \"platform is out of screen in axis y\";\n    }\n#endif\n\n    standard_sprite.set_scale_x(width \/ standard_sprite.get_width());\n    platform_sprite.set_scale_x(width \/ platform_sprite.get_width());\n    selected_sprite.set_scale_x(width \/ selected_sprite.get_width());\n\n    box.width = standard_sprite.get_width();\n\n    LOG(DEBUG) << \"Ending EditableFloor init\";\n}\n\n\/**\n * Not implemented.\n *\/\nEditableFloor::~EditableFloor() {\n}\n\n\/**\n * Get information about many aspects of an box.\n *\n * @returns String in format: \"x y width rotated level is_crossingable?\"\n *\/\nstring EditableFloor::get_information() {\n    LOG(DEBUG) << \"Starting EditableFloor get_information\";\n\n    char info_c[DEBUG_SIZE];\n    int snprint_return = snprintf(\n        info_c, sizeof(info_c), \"%f %f %f %f %d\", box.x, box.y, box.width,\n        rotation * PI_DEGREES \/ PI, static_cast<int>(is_crossingable));\n\n    if (snprint_return == 5) {\n        \/* Nothing to do. *\/\n    } else {\n        LOG(ERROR) << \"Could not get the complete information\";\n    }\n\n    string info(info_c);\n\n    for (auto &c : info) {\n        c += FILL_MISSING_PIXELS_DEBUGRMATIONS;\n    }\n\n    string return_value = info;\n\n    \/*\n     * Check if string reallyhas the elements.\n     * info == info_c for sure\n     *\/\n    float float1, float2, float3, float4;\n    int int1;\n    if (sscanf(info_c, \"%f %f %f %f %d\", &float1, &float2, &float3, &float4,\n               &int1) == 5) {\n        \/* Nothing to do. *\/\n    } else {\n        LOG(WARNING) << \"Info doesn't has all the information it should have\";\n    }\n\n    std::string log_message =\n        \"Ending EditableFloor get_information returning value: \" + return_value;\n    LOG(DEBUG) << log_message;\n\n    return return_value;\n}\n\n\/**\n * Select elements which will be edited.\n *\n * @param cis_selected [0,1]\n *\/\nvoid EditableFloor::set_selected(bool cis_selected) {\n#ifndef NDEBUG\n    std::string log_message =\n        \"Starting EditableFloor set_selected with cis_selected: \" +\n        static_cast<int>(cis_selected);\n    LOG(DEBUG) << log_message;\n#endif\n\n    is_selected = cis_selected;\n\n    LOG(DEBUG) << \"Ending EditableFloor set_selected\";\n}\n\n\/**\n * Render selected box considering if it is selected.\n *\/\nvoid EditableFloor::render() {\n    \/\/ LOG(DEBUG) << \"Starting EditableFloor render\";\n\n    if (is_selected) {\n        selected_sprite.render(box.get_draw_x(), box.get_draw_y(), rotation);\n    } else {\n        \/* Nothing to do. *\/\n    }\n\n    if (is_crossingable) {\n        platform_sprite.render(box.get_draw_x(), box.get_draw_y(), rotation);\n    } else {\n        standard_sprite.render(box.get_draw_x(), box.get_draw_y(), rotation);\n    }\n\n    \/\/ LOG(DEBUG) << \"Ending EditableFloor render\";\n}\n\n\/**\n * Manages player interaction with the box.\n *\n * @param delta_time Difference in position of the box.\n *\/\nvoid EditableFloor::update(float delta_time) {\n    \/*\n    #ifndef NDEBUG\n    char log_message_c[60];\n    snprintf(log_message_c, sizeof(log_message_c), \"Starting EditableFloor\n    update with delta_time: %.2f\", delta_time);\n\n    std::string log_message(log_message_c);\n    LOG(DEBUG) << log_message;\n    #endif\n    *\/\n\n    handle_platforms_interaction(delta_time);\n\n    \/\/ LOG(DEBUG) << \"Ending EditableFloor update\";\n}\n\n\/**\n * True if box has been deleted.\n *\n * @returns [0,1]\n *\/\nbool EditableFloor::is_dead() {\n    \/\/ LOG(DEBUG) << \"Starting EditableFloor is_dead\";\n\n    bool return_value = is_deleted;\n\n    \/*\n    #ifndef NDEBUG\n    std::string log_message = \"Ending EditableFloor is_dead returning value: \" +\n    std::to_string(static_cast<int>(return_value));\n    LOG(DEBUG) << log_message;\n    #endif\n    *\/\n\n    return return_value;\n}\n\n\/**\n * Will handle all interaction of the user with the platform.\n *\n * @param delta_time time spent on each frame of sprites\n *\/\nvoid EditableFloor::handle_platforms_interaction(float delta_time) {\n    \/\/ LOG(DEBUG) << \"Starting EditableFloor handle_platforms_interaction\n    \/\/ method\";\n\n    InputManager *input_manager = InputManager::get_instance();\n\n    if (input_manager->mouse_press(InputManager::LEFT_MOUSE_BUTTON)) {\n        int x = input_manager->get_mouse_x_position();\n        int y = input_manager->get_mouse_y_position();\n\n        Rectangle mouse = Rectangle(x, y, 1, 1);\n        is_selected = Collision::is_colliding(box, mouse, rotation, 0);\n    } else {\n        \/* Nothing to do. *\/\n    }\n\n    if (is_selected) {\n        static float acceleration = ACCELERATION;\n        float delta_space = MOVE_SPEED * delta_time * acceleration;\n        bool moved = false;\n\n        handle_box_moving(moved, delta_space);\n        handle_box_resizing(moved, delta_time);\n        handle_box_rotating(acceleration, delta_space);\n        handle_acceleration_increasing(moved, acceleration);\n\n        \/**\n         * Toggle Floor.\n         *\/\n        if (input_manager->key_press(InputManager::K_C)) {\n            is_crossingable = not is_crossingable;\n        } else {\n            \/* Nothing to do. *\/\n        }\n\n        \/**\n         * Delete floor.\n         *\/\n        if (input_manager->is_key_down(InputManager::K_DEL)) {\n            is_deleted = true;\n        } else {\n            \/* Nothing to do. *\/\n        }\n    } else {\n        \/* Nothing to do. *\/\n    }\n\n    \/\/ LOG(DEBUG) << \"Ending EditableFloor handle_platforms_interaction method\";\n}\n\n\/**\n * Handle platform player interaction with the platforms.\n *\n * @param moved will become true if platform move\n * @param delta_space how much platform will move\n *\/\nvoid EditableFloor::handle_box_moving(bool &moved, float delta_space) {\n    \/\/ LOG(DEBUG) << \"Starting EditableFloor handle_box_moving method\";\n\n    InputManager *input_manager = InputManager::get_instance();\n\n    if (input_manager->is_key_down(InputManager::K_ARROW_RIGHT)) {\n        box.x += delta_space;\n        moved = true;\n    } else if (input_manager->is_key_down(InputManager::K_ARROW_LEFT)) {\n        box.x -= delta_space;\n        moved = true;\n    } else {\n        \/* Nothing to do. *\/\n    }\n\n    if (input_manager->is_key_down(InputManager::K_ARROW_UP)) {\n        box.y -= delta_space;\n        moved = true;\n    } else if (input_manager->is_key_down(InputManager::K_ARROW_DOWN)) {\n        box.y += delta_space;\n        moved = true;\n    } else {\n        \/* Nothing to do. *\/\n    }\n\n    \/\/ LOG(DEBUG) << \"Ending EditableFloor handle_box_moving method\";\n}\n\n\/**\n * Handle platform player interaction with the platforms.\n *\n * @param moved will become true if platform move\n * @param delta_space how much platform will move\n *\/\nvoid EditableFloor::handle_box_resizing(bool &moved, float delta_space) {\n    \/\/ LOG(DEBUG) << \"Starting EditableFloor handle_box_resizing method\";\n\n    \/**\n     * Limit box sizes.\n     *\/\n    if (box.x < 0) {\n        box.x = 0;\n    } else if (box.x > BACKGROUND_WIDTH) {\n        box.x = BACKGROUND_WIDTH;\n    } else if (box.y < 0) {\n        box.y = 0;\n    } else if (box.y > BACKGROUND_HEIGHT) {\n        box.y = BACKGROUND_HEIGHT;\n    } else {\n        \/* Nothing to do. *\/\n    }\n\n    InputManager *input_manager = InputManager::get_instance();\n\n    \/**\n     * Resizing platform.\n     *\/\n    if (input_manager->is_key_down(InputManager::K_INC_W)) {\n        standard_sprite.update_scale_x(RESIZING_SPEED * delta_space);\n        platform_sprite.update_scale_x(RESIZING_SPEED * delta_space);\n        selected_sprite.update_scale_x(RESIZING_SPEED * delta_space);\n\n        box.width = standard_sprite.get_width();\n        moved = true;\n    } else if (input_manager->is_key_down(InputManager::K_DEC_W)) {\n        standard_sprite.update_scale_x(-RESIZING_SPEED * delta_space);\n        platform_sprite.update_scale_x(-RESIZING_SPEED * delta_space);\n        selected_sprite.update_scale_x(-RESIZING_SPEED * delta_space);\n\n        box.width = standard_sprite.get_width();\n        moved = true;\n    } else {\n        \/* Nothing to do. *\/\n    }\n\n    \/\/ LOG(DEBUG) << \"Ending EditableFloor handle_box_resizing method\";\n}\n\n\/**\n * Will handle rotation for both sides and reset.\n *\n * @param acceleration acceleration for rotating platform\n * @param delta_space intensifies rotating speed\n *\/\nvoid EditableFloor::handle_box_rotating(float acceleration, float delta_space) {\n    \/\/ LOG(DEBUG) << \"Starting EditableFloor handle_box_rotating method\";\n\n    InputManager *input_manager = InputManager::get_instance();\n\n    \/**\n     * Rotate box to corresponding direction or reset it.\n     *\/\n    if (input_manager->is_key_down(InputManager::K_ROT_LEFT)) {\n        rotation += ROTATING_SPEED * delta_space \/ acceleration;\n    } else if (input_manager->is_key_down(InputManager::K_ROT_RIGHT)) {\n        rotation -= ROTATING_SPEED * delta_space \/ acceleration;\n    } else if (input_manager->is_key_down(InputManager::K_ROT_RESET)) {\n        rotation = 0;\n    } else {\n        \/* Nothing to do. *\/\n    }\n\n    \/\/ LOG(DEBUG) << \"Ending EditableFloor handle_box_rotating method\";\n}\n\n\/**\n * Will handle if acceleration increase keeps ou reset\n *\n * @param moved if platform was moved, it will change behavior\n * @param acceleration acceleration that will be changed\n *\/\nvoid EditableFloor::handle_acceleration_increasing(bool &moved,\n                                                   float &acceleration) {\n    \/\/ LOG(DEBUG) << \"Starting EditableFloor handle_acceleration_increasing\n    \/\/ method\";\n\n    if (moved) {\n        acceleration = fmin(acceleration + ACCELERATION_INCREASE_STEP,\n                            MAXIMUM_ACCELERATION);\n    } else {\n        acceleration = ACCELERATION;\n    }\n\n    \/\/ LOG(DEBUG) << \"Ending EditableFloor handle_acceleration_increasing\n    \/\/ method\";\n}\n\n\/**\n * Not implemented.\n *\n * @param unamed An game object.\n *\/\nvoid EditableFloor::notify_collision(GameObject &) {\n}\n<commit_msg>Apply \"simple code and good presentation\" to EditableFloor<commit_after>\/* Copyright (c) 2017 Wenova - Rise of Conquerors. All rights reserved.\n *\n * This work is licensed under the terms of the MIT license.\n * For a copy, see <https:\/\/opensource.org\/licenses\/MIT>.\n *\/\n\/**\n * @file EditableFloor.cpp\n * Implements class EditableFloor methods.\n *\/\n\n\/**\n * Commented debugs should be used with extreme care because it causes\n * extremelly lose of performance and giant log files.\n *\/\n\n#include \"EditableFloor.h\"\n\n#include \"Collision.h\"\n#include \"InputManager.h\"\n#include \"Rectangle.h\"\n\n#include <cstdio>\n\n#define BACKGROUND_WIDTH 1280\n#define BACKGROUND_HEIGHT 720\n\n#define RESIZING_SPEED 0.005\n#define ROTATING_SPEED 0.01\n#define MOVE_SPEED 0.5\n\n#define ACCELERATION 1\n#define MAXIMUM_ACCELERATION 4\n#define ACCELERATION_INCREASE_STEP 0.2\n\n#define RIGID_PLATFORM_PATH \"edit_state\/floor\/editable_floor.png\"\n#define CROSSINGABLE_PLATFORM_PATH \"edit_state\/floor\/editable_platform.png\"\n#define SELECTED_CROSSINGABLE_PLATFORM_PATH \\\n    \"edit_state\/floor\/selected_editable_floor.png\"\n\n#define DEBUG_SIZE 500\n#define FILL_MISSING_PIXELS_DEBUGRMATIONS 15\n\n#define LAYER 0\n#define FLOOR_INITIAL_WIDTH 100\n#define PI 3.14159265358979\n#define PI_DEGREES 180\n\n\/**\n * Create box with default width of 100px.\n *\n * @param x Position in X axis. Unit: px, [0,screen_width]\n * @param y Position in Y axis. Unit: px, [0,screen_height]\n * @param crotation Unit: degrees\n * @param cplatform [0,1]\n *\/\nEditableFloor::EditableFloor(float x, float y, float crotation, bool cplatform)\n    : Floor(x, y, FLOOR_INITIAL_WIDTH, crotation, cplatform),\n      standard_sprite(Sprite(RIGID_PLATFORM_PATH)),\n      platform_sprite(Sprite(CROSSINGABLE_PLATFORM_PATH)),\n      selected_sprite(Sprite(SELECTED_CROSSINGABLE_PLATFORM_PATH)) {\n#ifndef NDEBUG\n    try {\n        std::string log_message = \"Starting EditableFloor constructor with x: \";\n        log_message += std::to_string(x) + \", y: \" + std::to_string(y);\n        log_message += \", crotation: \" + std::to_string(crotation);\n        log_message +=\n            \", cplatfrom: \" + std::to_string(static_cast<int>(cplatform));\n\n        LOG(DEBUG) << log_message;\n    } catch (std::bad_alloc &error) {\n        string str_error(error.what());\n        string log_message = \"Couldn't convert to string: \" + str_error + '\\n';\n        LOG(FATAL) << log_message;\n    }\n#endif\n\n    box = Rectangle(x, y, standard_sprite.get_width(),\n                    standard_sprite.get_height());\n\n    is_deleted = false;\n    is_selected = false;\n\n    LOG(DEBUG) << \"Ending EditableFloor constructor\";\n}\n\n\/**\n * Create box with specific width.\n *\n * @param x Position in X axis. Unit: px, [0,screen_width]\n * @param y Position in Y axis. Unit: px, [0,screen_height]\n * @param width Unit: px, [0,]\n * @param crotation Unit: degrees\n * @param cplatform [0,1]\n *\/\nEditableFloor::EditableFloor(float x, float y, float width, float crotation,\n                             bool cplatform)\n    : EditableFloor(x, y, crotation, cplatform) {\n#ifndef NDEBUG\n    try {\n        std::string log_message = \"Starting EditableFloor constructor with x: \";\n        log_message += std::to_string(x) + \", y: \" + std::to_string(y);\n        log_message += \", width:\" + std::to_string(width);\n        log_message += \", crotation: \" + std::to_string(crotation);\n        log_message +=\n            \", cplatfrom: \" + std::to_string(static_cast<int>(cplatform));\n        LOG(DEBUG) << log_message;\n    } catch (std::bad_alloc &error) {\n        string str_error(error.what());\n        string log_message = \"Couldn't convert to string: \" + str_error + '\\n';\n        LOG(FATAL) << log_message;\n    }\n\n    if (x <= BACKGROUND_WIDTH) {\n        \/* Nothing to do. *\/\n    } else {\n        LOG(FATAL) << \"platform is out of screen in axis x\";\n    }\n\n    if (x <= BACKGROUND_WIDTH) {\n        \/* Nothing to do. *\/\n    } else {\n        LOG(FATAL) << \"platform is out of screen in axis y\";\n    }\n#endif\n\n    standard_sprite.set_scale_x(width \/ standard_sprite.get_width());\n    platform_sprite.set_scale_x(width \/ platform_sprite.get_width());\n    selected_sprite.set_scale_x(width \/ selected_sprite.get_width());\n\n    box.width = standard_sprite.get_width();\n\n    LOG(DEBUG) << \"Ending EditableFloor init\";\n}\n\n\/**\n * Not implemented.\n *\/\nEditableFloor::~EditableFloor() {\n}\n\n\/**\n * Get information about many aspects of an box.\n *\n * @returns String in format: \"x y width rotated level is_crossingable?\"\n *\/\nstring EditableFloor::get_information() {\n    LOG(DEBUG) << \"Starting EditableFloor get_information\";\n\n    char info_c[DEBUG_SIZE];\n    int snprint_return = snprintf(\n        info_c, sizeof(info_c), \"%f %f %f %f %d\", box.x, box.y, box.width,\n        rotation * PI_DEGREES \/ PI, static_cast<int>(is_crossingable));\n\n    string info(info_c);\n    string return_value = info;\n\n    if (snprint_return == 5) {\n        \/* Nothing to do. *\/\n    } else {\n        LOG(ERROR) << \"Could not get the complete information\";\n    }\n\n    for (auto &c : info) {\n        c += FILL_MISSING_PIXELS_DEBUGRMATIONS;\n    }\n\n    \/*\n     * Check if string really has the elements.\n     * info == info_c for sure\n     *\/\n    float float1, float2, float3, float4;\n    int int1;\n    if (sscanf(info_c, \"%f %f %f %f %d\", &float1, &float2, &float3, &float4,\n               &int1) == 5) {\n        \/* Nothing to do. *\/\n    } else {\n        LOG(WARNING) << \"Info doesn't has all the information it should have\";\n    }\n\n    std::string log_message =\n        \"Ending EditableFloor get_information returning value: \" + return_value;\n    LOG(DEBUG) << log_message;\n\n    return return_value;\n}\n\n\/**\n * Select elements which will be edited.\n *\n * @param cis_selected [0,1]\n *\/\nvoid EditableFloor::set_selected(bool cis_selected) {\n#ifndef NDEBUG\n    std::string log_message =\n        \"Starting EditableFloor set_selected with cis_selected: \" +\n        static_cast<int>(cis_selected);\n    LOG(DEBUG) << log_message;\n#endif\n\n    is_selected = cis_selected;\n\n    LOG(DEBUG) << \"Ending EditableFloor set_selected\";\n}\n\n\/**\n * Render selected box considering if it is selected.\n *\/\nvoid EditableFloor::render() {\n    \/\/ LOG(DEBUG) << \"Starting EditableFloor render\";\n\n    if (is_selected) {\n        selected_sprite.render(box.get_draw_x(), box.get_draw_y(), rotation);\n    } else {\n        \/* Nothing to do. *\/\n    }\n\n    if (is_crossingable) {\n        platform_sprite.render(box.get_draw_x(), box.get_draw_y(), rotation);\n    } else {\n        standard_sprite.render(box.get_draw_x(), box.get_draw_y(), rotation);\n    }\n\n    \/\/ LOG(DEBUG) << \"Ending EditableFloor render\";\n}\n\n\/**\n * Manages player interaction with the box.\n *\n * @param delta_time Difference in position of the box.\n *\/\nvoid EditableFloor::update(float delta_time) {\n    \/*\n    #ifndef NDEBUG\n    char log_message_c[60];\n    snprintf(log_message_c, sizeof(log_message_c), \"Starting EditableFloor\n    update with delta_time: %.2f\", delta_time);\n\n    std::string log_message(log_message_c);\n    LOG(DEBUG) << log_message;\n    #endif\n    *\/\n\n    handle_platforms_interaction(delta_time);\n\n    \/\/ LOG(DEBUG) << \"Ending EditableFloor update\";\n}\n\n\/**\n * True if box has been deleted.\n *\n * @returns [0,1]\n *\/\nbool EditableFloor::is_dead() {\n    \/\/ LOG(DEBUG) << \"Starting EditableFloor is_dead\";\n\n    bool return_value = is_deleted;\n\n    \/*\n    #ifndef NDEBUG\n    std::string log_message = \"Ending EditableFloor is_dead returning value: \" +\n    std::to_string(static_cast<int>(return_value));\n    LOG(DEBUG) << log_message;\n    #endif\n    *\/\n\n    return return_value;\n}\n\n\/**\n * Will handle all interaction of the user with the platform.\n *\n * @param delta_time time spent on each frame of sprites\n *\/\nvoid EditableFloor::handle_platforms_interaction(float delta_time) {\n    \/\/ LOG(DEBUG) << \"Starting EditableFloor handle_platforms_interaction\n    \/\/ method\";\n\n    InputManager *input_manager = InputManager::get_instance();\n\n    if (input_manager->mouse_press(InputManager::LEFT_MOUSE_BUTTON)) {\n        int x = input_manager->get_mouse_x_position();\n        int y = input_manager->get_mouse_y_position();\n\n        Rectangle mouse = Rectangle(x, y, 1, 1);\n        is_selected = Collision::is_colliding(box, mouse, rotation, 0);\n    } else {\n        \/* Nothing to do. *\/\n    }\n\n    if (is_selected) {\n        static float acceleration = ACCELERATION;\n        float delta_space = MOVE_SPEED * delta_time * acceleration;\n        bool moved = false;\n\n        handle_box_moving(moved, delta_space);\n        handle_box_resizing(moved, delta_time);\n        handle_box_rotating(acceleration, delta_space);\n        handle_acceleration_increasing(moved, acceleration);\n\n        \/**\n         * Toggle Floor.\n         *\/\n        if (input_manager->key_press(InputManager::K_C)) {\n            is_crossingable = not is_crossingable;\n        } else {\n            \/* Nothing to do. *\/\n        }\n\n        \/**\n         * Delete floor.\n         *\/\n        if (input_manager->is_key_down(InputManager::K_DEL)) {\n            is_deleted = true;\n        } else {\n            \/* Nothing to do. *\/\n        }\n    } else {\n        \/* Nothing to do. *\/\n    }\n\n    \/\/ LOG(DEBUG) << \"Ending EditableFloor handle_platforms_interaction method\";\n}\n\n\/**\n * Handle platform player interaction with the platforms.\n *\n * @param moved will become true if platform move\n * @param delta_space how much platform will move\n *\/\nvoid EditableFloor::handle_box_moving(bool &moved, float delta_space) {\n    \/\/ LOG(DEBUG) << \"Starting EditableFloor handle_box_moving method\";\n\n    InputManager *input_manager = InputManager::get_instance();\n\n    if (input_manager->is_key_down(InputManager::K_ARROW_RIGHT)) {\n        box.x += delta_space;\n        moved = true;\n    } else if (input_manager->is_key_down(InputManager::K_ARROW_LEFT)) {\n        box.x -= delta_space;\n        moved = true;\n    } else {\n        \/* Nothing to do. *\/\n    }\n\n    if (input_manager->is_key_down(InputManager::K_ARROW_UP)) {\n        box.y -= delta_space;\n        moved = true;\n    } else if (input_manager->is_key_down(InputManager::K_ARROW_DOWN)) {\n        box.y += delta_space;\n        moved = true;\n    } else {\n        \/* Nothing to do. *\/\n    }\n\n    \/\/ LOG(DEBUG) << \"Ending EditableFloor handle_box_moving method\";\n}\n\n\/**\n * Handle platform player interaction with the platforms.\n *\n * @param moved will become true if platform move\n * @param delta_space how much platform will move\n *\/\nvoid EditableFloor::handle_box_resizing(bool &moved, float delta_space) {\n    \/\/ LOG(DEBUG) << \"Starting EditableFloor handle_box_resizing method\";\n\n    \/**\n     * Limit box sizes.\n     *\/\n    if (box.x < 0) {\n        box.x = 0;\n    } else if (box.x > BACKGROUND_WIDTH) {\n        box.x = BACKGROUND_WIDTH;\n    } else if (box.y < 0) {\n        box.y = 0;\n    } else if (box.y > BACKGROUND_HEIGHT) {\n        box.y = BACKGROUND_HEIGHT;\n    } else {\n        \/* Nothing to do. *\/\n    }\n\n    InputManager *input_manager = InputManager::get_instance();\n\n    \/**\n     * Resizing platform.\n     *\/\n    if (input_manager->is_key_down(InputManager::K_INC_W)) {\n        standard_sprite.update_scale_x(RESIZING_SPEED * delta_space);\n        platform_sprite.update_scale_x(RESIZING_SPEED * delta_space);\n        selected_sprite.update_scale_x(RESIZING_SPEED * delta_space);\n\n        box.width = standard_sprite.get_width();\n        moved = true;\n    } else if (input_manager->is_key_down(InputManager::K_DEC_W)) {\n        standard_sprite.update_scale_x(-RESIZING_SPEED * delta_space);\n        platform_sprite.update_scale_x(-RESIZING_SPEED * delta_space);\n        selected_sprite.update_scale_x(-RESIZING_SPEED * delta_space);\n\n        box.width = standard_sprite.get_width();\n        moved = true;\n    } else {\n        \/* Nothing to do. *\/\n    }\n\n    \/\/ LOG(DEBUG) << \"Ending EditableFloor handle_box_resizing method\";\n}\n\n\/**\n * Will handle rotation for both sides and reset.\n *\n * @param acceleration acceleration for rotating platform\n * @param delta_space intensifies rotating speed\n *\/\nvoid EditableFloor::handle_box_rotating(float acceleration, float delta_space) {\n    \/\/ LOG(DEBUG) << \"Starting EditableFloor handle_box_rotating method\";\n\n    InputManager *input_manager = InputManager::get_instance();\n    float rate = ROTATING_SPEED * delta_space \/ acceleration;\n\n    \/**\n     * Rotate box to corresponding direction or reset it.\n     *\/\n    if (input_manager->is_key_down(InputManager::K_ROT_LEFT)) {\n        rotation += rate;\n    } else if (input_manager->is_key_down(InputManager::K_ROT_RIGHT)) {\n        rotation -= rate;\n    } else if (input_manager->is_key_down(InputManager::K_ROT_RESET)) {\n        rotation = 0;\n    } else {\n        \/* Nothing to do. *\/\n    }\n\n    \/\/ LOG(DEBUG) << \"Ending EditableFloor handle_box_rotating method\";\n}\n\n\/**\n * Will handle if acceleration increase keeps ou reset\n *\n * @param moved if platform was moved, it will change behavior\n * @param acceleration acceleration that will be changed\n *\/\nvoid EditableFloor::handle_acceleration_increasing(bool &moved,\n                                                   float &acceleration) {\n    \/\/ LOG(DEBUG) << \"Starting EditableFloor handle_acceleration_increasing\n    \/\/ method\";\n\n    if (moved) {\n        float new_acceleration = acceleration + ACCELERATION_INCREASE_STEP;\n        acceleration = fmin(new_acceleration, MAXIMUM_ACCELERATION);\n    } else {\n        acceleration = ACCELERATION;\n    }\n\n    \/\/ LOG(DEBUG) << \"Ending EditableFloor handle_acceleration_increasing\n    \/\/ method\";\n}\n\n\/**\n * Not implemented.\n *\n * @param unamed An game object.\n *\/\nvoid EditableFloor::notify_collision(GameObject &) {\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/            Copyright (c) 2016 Ronnie Brohn (EpicBrownie)      \n\/\/\n\/\/                Distributed under The MIT License (MIT).\n\/\/             (See accompanying file License.txt or copy at \n\/\/                 https:\/\/opensource.org\/licenses\/MIT)\n\/\/\n\/\/           Please report any bugs, typos, or suggestions to\n\/\/              https:\/\/github.com\/epicbrownie\/Epic\/issues\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#pragma once\n\n#include <type_traits>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ Sequence<T>\nnamespace Epic::TMP\n{\n\ttemplate<typename T, T... Items>\n\tusing Sequence = std::integer_sequence<T, Items...>;\n\n\ttemplate<typename T, T N>\n\tusing MakeSequence = std::make_integer_sequence<T, N>;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ ForEach - Iterate over a Sequence<T>\nnamespace Epic::TMP\n{\n\ttemplate<class Seq>\n\tstruct ForEach;\n\n\ttemplate<typename T, T Item, T... Items>\n\tstruct ForEach<Sequence<T, Item, Items...>>\n\t{\n\t\ttemplate<class Function, class... Args>\n\t\tstatic void Apply(Function fn, Args&&... args)\n\t\t{\n\t\t\tfn(Item, std::forward<Args>(args)...);\n\n\t\t\tForEach<Sequence<T, Items...>>\n\t\t\t\t::Apply(fn, std::forward<Args>(args)...);\n\t\t}\n\t};\n\n\ttemplate<typename T, T Item>\n\tstruct ForEach<Sequence<T, Item>>\n\t{\n\t\ttemplate<class Function, class... Args>\n\t\tstatic void Apply(Function fn, Args&&... args)\n\t\t{\n\t\t\tfn(Item, std::forward<Args>(args)...);\n\t\t}\n\t};\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ ForEach2 - Iterate over 2 Sequence<T> simultaneously\nnamespace Epic::TMP\n{\n\ttemplate<class Seq1, class Seq2>\n\tstruct ForEach2;\n\n\ttemplate<typename T, T Item1, T Item2, T... Items1, T... Items2>\n\tstruct ForEach2<Sequence<T, Item1, Items1...>, Sequence<T, Item2, Items2...>>\n\t{\n\t\ttemplate<class Function, class... Args>\n\t\tstatic void Apply(Function fn, Args&&... args)\n\t\t{\n\t\t\tfn(Item1, Item2, std::forward<Args>(args)...);\n\n\t\t\tForEach2<Sequence<T, Items1...>, Sequence<T, Items2...>>\n\t\t\t\t::Apply(fn, std::forward<Args>(args)...);\n\t\t}\n\t};\n\n\ttemplate<typename T, T Item1, T Item2>\n\tstruct ForEach2<Sequence<T, Item1>, Sequence<T, Item2>>\n\t{\n\t\ttemplate<class Function, class... Args>\n\t\tstatic void Apply(Function fn, Args&&... args)\n\t\t{\n\t\t\tfn(Item1, Item2, std::forward<Args>(args)...);\n\t\t}\n\t};\n\n\ttemplate<typename T, T... ExtraItems>\n\tstruct ForEach2<Sequence<T, ExtraItems...>, Sequence<T>>\n\t{\n\t\ttemplate<class Function, class... Args>\n\t\tstatic void Apply(Function, Args&&...)\n\t\t{\n\t\t\t\/* The first sequence had too many items. *\/\n\t\t}\n\t};\n\n\ttemplate<typename T, T... ExtraItems>\n\tstruct ForEach2<Sequence<T>, Sequence<T, ExtraItems...>>\n\t{\n\t\ttemplate<class Function, class... Args>\n\t\tstatic void Apply(Function, Args&&...)\n\t\t{\n\t\t\t\/* The second sequence had too many items. *\/\n\t\t}\n\t};\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ SequenceContains - Determine whether Query is contained within a Sequence<T>\nnamespace Epic::TMP\n{\n\ttemplate<typename T, T Query, class Seq>\n\tstruct SequenceContains : public std::false_type \n\t{ };\n\n\ttemplate<typename T, T Query, T Item, T... Items>\n\tstruct SequenceContains<T, Query, Sequence<T, Item, Items...>>\n\t\t: public std::conditional_t<\n\t\t\t((Query == Item) || SequenceContains<T, Query, Sequence<T, Items...>>::value),\n\t\t\tstd::true_type,\n\t\t\tstd::false_type>\n\t{ };\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ IsSequenceUnique - Determine whether every T within a Sequence<T> is unique\nnamespace Epic::TMP\n{\n\ttemplate<class Seq>\n\tstruct IsSequenceUnique : public std::true_type \n\t{ };\n\n\ttemplate<typename T, T Item, T... Items>\n\tstruct IsSequenceUnique<Sequence<T, Item, Items...>>\n\t\t: public std::conditional_t<\n\t\t\t(!SequenceContains<T, Item, Sequence<T, Items...>>::value &&\n\t\t\t\tIsSequenceUnique<Sequence<T, Items...>>::value),\n\t\t\tstd::true_type,\n\t\t\tstd::false_type>\n\t{ };\n\n\ttemplate<typename T, T Item, T Last>\n\tstruct IsSequenceUnique<Sequence<T, Item, Last>>\n\t\t: public std::conditional_t<Item != Last, std::true_type, std::false_type>\n\t{ };\n}\n<commit_msg>Added ForEachN<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/            Copyright (c) 2016 Ronnie Brohn (EpicBrownie)      \n\/\/\n\/\/                Distributed under The MIT License (MIT).\n\/\/             (See accompanying file License.txt or copy at \n\/\/                 https:\/\/opensource.org\/licenses\/MIT)\n\/\/\n\/\/           Please report any bugs, typos, or suggestions to\n\/\/              https:\/\/github.com\/epicbrownie\/Epic\/issues\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#pragma once\n\n#include <type_traits>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ Sequence<T>\nnamespace Epic::TMP\n{\n\ttemplate<typename T, T... Items>\n\tusing Sequence = std::integer_sequence<T, Items...>;\n\n\ttemplate<typename T, T N>\n\tusing MakeSequence = std::make_integer_sequence<T, N>;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ ForEach - Iterate over a Sequence<T>\nnamespace Epic::TMP\n{\n\ttemplate<class Seq>\n\tstruct ForEach;\n\n\ttemplate<typename T, T Item, T... Items>\n\tstruct ForEach<Sequence<T, Item, Items...>>\n\t{\n\t\ttemplate<class Function, class... Args>\n\t\tstatic void Apply(Function fn, Args&&... args)\n\t\t{\n\t\t\tfn(Item, std::forward<Args>(args)...);\n\n\t\t\tForEach<Sequence<T, Items...>>\n\t\t\t\t::Apply(fn, std::forward<Args>(args)...);\n\t\t}\n\t};\n\n\ttemplate<typename T, T Item>\n\tstruct ForEach<Sequence<T, Item>>\n\t{\n\t\ttemplate<class Function, class... Args>\n\t\tstatic void Apply(Function fn, Args&&... args)\n\t\t{\n\t\t\tfn(Item, std::forward<Args>(args)...);\n\t\t}\n\t};\n\n\ttemplate<size_t N>\n\tstruct ForEachN\n\t{\n\t\ttemplate<class Function, class... Args>\n\t\tstatic void Apply(Function fn, Args&&... args)\n\t\t{\n\t\t\tForEach<MakeSequence<size_t, N>>::Apply(fn, std::forward<Args>(args)...);\n\t\t}\n\t};\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ ForEach2 - Iterate over 2 Sequence<T> simultaneously\nnamespace Epic::TMP\n{\n\ttemplate<class Seq1, class Seq2>\n\tstruct ForEach2;\n\n\ttemplate<typename T, T Item1, T Item2, T... Items1, T... Items2>\n\tstruct ForEach2<Sequence<T, Item1, Items1...>, Sequence<T, Item2, Items2...>>\n\t{\n\t\ttemplate<class Function, class... Args>\n\t\tstatic void Apply(Function fn, Args&&... args)\n\t\t{\n\t\t\tfn(Item1, Item2, std::forward<Args>(args)...);\n\n\t\t\tForEach2<Sequence<T, Items1...>, Sequence<T, Items2...>>\n\t\t\t\t::Apply(fn, std::forward<Args>(args)...);\n\t\t}\n\t};\n\n\ttemplate<typename T, T Item1, T Item2>\n\tstruct ForEach2<Sequence<T, Item1>, Sequence<T, Item2>>\n\t{\n\t\ttemplate<class Function, class... Args>\n\t\tstatic void Apply(Function fn, Args&&... args)\n\t\t{\n\t\t\tfn(Item1, Item2, std::forward<Args>(args)...);\n\t\t}\n\t};\n\n\ttemplate<typename T, T... ExtraItems>\n\tstruct ForEach2<Sequence<T, ExtraItems...>, Sequence<T>>\n\t{\n\t\ttemplate<class Function, class... Args>\n\t\tstatic void Apply(Function, Args&&...)\n\t\t{\n\t\t\t\/* The first sequence had too many items. *\/\n\t\t}\n\t};\n\n\ttemplate<typename T, T... ExtraItems>\n\tstruct ForEach2<Sequence<T>, Sequence<T, ExtraItems...>>\n\t{\n\t\ttemplate<class Function, class... Args>\n\t\tstatic void Apply(Function, Args&&...)\n\t\t{\n\t\t\t\/* The second sequence had too many items. *\/\n\t\t}\n\t};\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ SequenceContains - Determine whether Query is contained within a Sequence<T>\nnamespace Epic::TMP\n{\n\ttemplate<typename T, T Query, class Seq>\n\tstruct SequenceContains : public std::false_type \n\t{ };\n\n\ttemplate<typename T, T Query, T Item, T... Items>\n\tstruct SequenceContains<T, Query, Sequence<T, Item, Items...>>\n\t\t: public std::conditional_t<\n\t\t\t((Query == Item) || SequenceContains<T, Query, Sequence<T, Items...>>::value),\n\t\t\tstd::true_type,\n\t\t\tstd::false_type>\n\t{ };\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ IsSequenceUnique - Determine whether every T within a Sequence<T> is unique\nnamespace Epic::TMP\n{\n\ttemplate<class Seq>\n\tstruct IsSequenceUnique : public std::true_type \n\t{ };\n\n\ttemplate<typename T, T Item, T... Items>\n\tstruct IsSequenceUnique<Sequence<T, Item, Items...>>\n\t\t: public std::conditional_t<\n\t\t\t(!SequenceContains<T, Item, Sequence<T, Items...>>::value &&\n\t\t\t\tIsSequenceUnique<Sequence<T, Items...>>::value),\n\t\t\tstd::true_type,\n\t\t\tstd::false_type>\n\t{ };\n\n\ttemplate<typename T, T Item, T Last>\n\tstruct IsSequenceUnique<Sequence<T, Item, Last>>\n\t\t: public std::conditional_t<Item != Last, std::true_type, std::false_type>\n\t{ };\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2015.  All rights reserved\n *\/\n#include    \"..\/StroikaPreComp.h\"\n\n#if     !qCompilerAndStdLib_string_conversions_Buggy\n#include    <codecvt>\n#endif\n#include    <cstdarg>\n\n#include    \"..\/Characters\/CodePage.h\"\n#include    \"..\/Characters\/Format.h\"\n#include    \"..\/Characters\/String_Constant.h\"\n#include    \"..\/Containers\/Common.h\"\n#include    \"..\/Debug\/AssertExternallySynchronizedLock.h\"\n#include    \"..\/Execution\/Common.h\"\n#include    \"..\/Execution\/StringException.h\"\n#include    \"..\/Execution\/OperationNotSupportedException.h\"\n#include    \"..\/Memory\/SmallStackBuffer.h\"\n\n#include    \"TextWriter.h\"\n\n\nusing   namespace   Stroika::Foundation;\nusing   namespace   Stroika::Foundation::Characters;\nusing   namespace   Stroika::Foundation::Streams;\n\nusing   Execution::make_unique_lock;\n\n#if     !qCompilerAndStdLib_string_conversions_Buggy\nnamespace {\n    const   codecvt_utf8<wchar_t>   kConverter_;        \/\/ safe to keep static because only read-only const methods used\n}\n#endif\n\nclass   TextWriter::UnSeekable_UTF8_Rep_ : public OutputStream<Character>::_IRep, private Debug::AssertExternallySynchronizedLock  {\npublic:\n    UnSeekable_UTF8_Rep_ (const OutputStream<Byte>& src, bool useBOM)\n        : _fSource (src)\n    {\n        constexpr   Byte    kBOM[]  =    { 0xEF, 0xBB, 0xBF};   \/\/  see http:\/\/en.wikipedia.org\/wiki\/Byte_order_mark\n        if (useBOM) {\n            _fSource.Write (std::begin (kBOM), std::end (kBOM));\n        }\n    }\n\nprotected:\n    virtual bool    IsSeekable () const override\n    {\n        return false;\n    }\n    virtual SeekOffsetType  GetWriteOffset () const override\n    {\n        AssertNotImplemented ();\n        return 0;\n    }\n    virtual SeekOffsetType  SeekWrite (Whence whence, SignedSeekOffsetType offset) override\n    {\n        AssertNotImplemented ();\n        return 0;\n    }\n    virtual void    Write (const Character* start, const Character* end)  override\n    {\n#if     !qCompilerAndStdLib_string_conversions_Buggy\n        const wchar_t*  sc  =   CVT_CHARACTER_2_wchar_t (start);\n        const wchar_t*  ec  =   CVT_CHARACTER_2_wchar_t (end);\n        const wchar_t*  pc  =   sc;\n\n        mbstate_t mb {};\n\n        char  outBuf[10 * 1024];\n        \/\/char    outBuf[10]; \/\/ to test\n        lock_guard<const AssertExternallySynchronizedLock> critSec { *this };\nAgain:\n        char*   p   =   std::begin (outBuf);\n        codecvt_utf8<wchar_t>::result r = kConverter_.out (mb, sc, ec, pc, std::begin (outBuf), std::end (outBuf), p);\n        Assert (std::begin (outBuf) <= p and p <= std::end (outBuf));\n        _fSource.Write (reinterpret_cast<const Byte*> (std::begin (outBuf)), reinterpret_cast<const Byte*> (p));\n        if (r == codecvt_utf8<wchar_t>::partial or pc < ec) {\n            sc = pc;\n            goto Again;\n        }\n        if (r != codecvt_utf8<wchar_t>::ok) {\n            \/\/ not sure waht to throw!\n            Execution::DoThrow (Execution::StringException (String_Constant (L\"Error converting characters codepage\")));\n        }\n#else\n        const wchar_t*  sc  =   CVT_CHARACTER_2_wchar_t (start);\n        const wchar_t*  ec  =   CVT_CHARACTER_2_wchar_t (end);\n        string tmp = Characters::WideStringToUTF8 (wstring (sc, ec));\n        _fSource.Write (reinterpret_cast<const Byte*> (Containers::Start (tmp)), reinterpret_cast<const Byte*> (Containers::Start (tmp) + tmp.length ()));\n#endif\n    }\n    virtual void    Flush () override\n    {\n        \/\/ NYI\n    }\n\nprotected:\n    OutputStream<Byte>          _fSource;\n};\n\n\nclass   TextWriter::UnSeekable_WCharT_Rep_ : public OutputStream<Character>::_IRep, private Debug::AssertExternallySynchronizedLock  {\npublic:\n    UnSeekable_WCharT_Rep_ (const OutputStream<Byte>& src, bool useBOM)\n        : _fSource (src)\n    {\n        constexpr   Character   kBOM    =    L'\\xFEFF'; \/\/  same whether 16 or 32 bit encoding -- see http:\/\/en.wikipedia.org\/wiki\/Byte_order_mark\n        if (useBOM) {\n            Write (&kBOM, &kBOM + 1);\n        }\n    }\n\nprotected:\n    virtual bool    IsSeekable () const override\n    {\n        return false;\n    }\n    virtual SeekOffsetType  GetWriteOffset () const override\n    {\n        AssertNotImplemented ();\n        return 0;\n    }\n    virtual SeekOffsetType  SeekWrite (Whence whence, SignedSeekOffsetType offset) override\n    {\n        AssertNotImplemented ();\n        return 0;\n    }\n    virtual void    Write (const Character* start, const Character* end)  override\n    {\n        lock_guard<const AssertExternallySynchronizedLock> critSec { *this };\n        _fSource.Write (reinterpret_cast<const Byte*> (start), reinterpret_cast<const Byte*> (end));\n    }\n    virtual void    Flush () override\n    {\n        lock_guard<const AssertExternallySynchronizedLock> critSec { *this };\n        _fSource.Flush ();\n    }\n\nprotected:\n    OutputStream<Byte>          _fSource;\n};\n\n\nclass   TextWriter::Seekable_UTF8_Rep_ : public UnSeekable_UTF8_Rep_ {\npublic:\n    Seekable_UTF8_Rep_ (const OutputStream<Byte>& src, bool useBOM)\n        : UnSeekable_UTF8_Rep_ (src, useBOM)\n        , fOffset_ (0)\n    {\n    }\n\nprotected:\n    virtual bool    IsSeekable () const override\n    {\n        return true;\n    }\n#if 0\n    virtual void    Write (const Character* start, const Character* end)  override\n    {\n        SeekOffsetType  offset  =   fOffset_;\n        \/\/ Take into account seek offset...\n    }\n#endif\n\n    virtual SeekOffsetType  GetWriteOffset () const override\n    {\n        AssertNotImplemented ();\n        return fOffset_;\n    }\n\n    virtual SeekOffsetType  SeekWrite (Whence whence, SignedSeekOffsetType offset) override\n    {\n        AssertNotImplemented ();\n        return 0;\n    }\n\nprivate:\n    size_t              fOffset_;\n};\n\n\nclass   TextWriter::Seekable_WCharT_Rep_ : public UnSeekable_WCharT_Rep_ {\npublic:\n    Seekable_WCharT_Rep_ (const OutputStream<Byte>& src, bool useBOM)\n        : UnSeekable_WCharT_Rep_ (src, useBOM)\n        , fOffset_ (0)\n    {\n    }\n\nprotected:\n    virtual bool    IsSeekable () const override\n    {\n        return true;\n    }\n#if 0\n    virtual void    Write (const Character* start, const Character* end)  override\n    {\n        SeekOffsetType  offset  =   fOffset_;\n        \/\/ Take into account seek offset...\n    }\n#endif\n\n    virtual SeekOffsetType  GetWriteOffset () const override\n    {\n        AssertNotImplemented ();\n        return fOffset_;\n    }\n\n    virtual SeekOffsetType  SeekWrite (Whence whence, SignedSeekOffsetType offset) override\n    {\n        AssertNotImplemented ();\n        return 0;\n    }\n\nprivate:\n    size_t              fOffset_;\n};\n\n\n\n\/*\n ********************************************************************************\n ****************************** Streams::TextWriter *****************************\n ********************************************************************************\n *\/\nTextWriter::TextWriter (const OutputStream<Byte>& src, Format format)\n    : OutputStream<Character> (mk_ (src, format))\n{\n}\n\nshared_ptr<TextWriter::_IRep> TextWriter::mk_ (const OutputStream<Byte>& src, Format format)\n{\n    bool    newOneSeekable  =   src.IsSeekable ();\n    bool    withBOM         =   (format == Format::eUTF8WithBOM or format == Format::eWCharTWithBOM);\n    switch (format) {\n        case Format::eUTF8WithBOM:\n        case Format::eUTF8WithoutBOM:\n            return shared_ptr<_IRep> (newOneSeekable ? new Seekable_UTF8_Rep_ (src, withBOM) : new UnSeekable_UTF8_Rep_ (src, withBOM));\n        case Format::eWCharTWithBOM:\n        case Format::eWCharTWithoutBOM:\n            return shared_ptr<_IRep> (newOneSeekable ? new Seekable_WCharT_Rep_ (src, withBOM) : new UnSeekable_WCharT_Rep_ (src, withBOM));\n        default:\n            RequireNotReached();\n            return shared_ptr<_IRep> ();\n    }\n}\n\nvoid    TextWriter::PrintF (const wchar_t* format, ...)\n{\n    RequireNotNull (format);\n    va_list     argsList;\n    va_start (argsList, format);\n    Write (Characters::FormatV (format, argsList));\n    va_end (argsList);\n}\n<commit_msg>cleanup Streams\/TextWriter<commit_after>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2015.  All rights reserved\n *\/\n#include    \"..\/StroikaPreComp.h\"\n\n#if     !qCompilerAndStdLib_string_conversions_Buggy\n#include    <codecvt>\n#endif\n#include    <cstdarg>\n\n#include    \"..\/Characters\/CodePage.h\"\n#include    \"..\/Characters\/Format.h\"\n#include    \"..\/Characters\/String_Constant.h\"\n#include    \"..\/Containers\/Common.h\"\n#include    \"..\/Debug\/AssertExternallySynchronizedLock.h\"\n#include    \"..\/Execution\/Common.h\"\n#include    \"..\/Execution\/StringException.h\"\n#include    \"..\/Execution\/OperationNotSupportedException.h\"\n#include    \"..\/Memory\/SmallStackBuffer.h\"\n\n#include    \"TextWriter.h\"\n\n\nusing   namespace   Stroika::Foundation;\nusing   namespace   Stroika::Foundation::Characters;\nusing   namespace   Stroika::Foundation::Streams;\n\nusing   Execution::make_unique_lock;\n\n#if     !qCompilerAndStdLib_string_conversions_Buggy\nnamespace {\n    const   codecvt_utf8<wchar_t>   kConverter_;        \/\/ safe to keep static because only read-only const methods used\n}\n#endif\n\nclass   TextWriter::UnSeekable_UTF8_Rep_ : public OutputStream<Character>::_IRep, private Debug::AssertExternallySynchronizedLock  {\npublic:\n    UnSeekable_UTF8_Rep_ (const OutputStream<Byte>& src, bool useBOM)\n        : _fSource (src)\n    {\n        constexpr   Byte    kBOM[]  =    { 0xEF, 0xBB, 0xBF};   \/\/  see http:\/\/en.wikipedia.org\/wiki\/Byte_order_mark\n        if (useBOM) {\n            _fSource.Write (std::begin (kBOM), std::end (kBOM));\n        }\n    }\n\nprotected:\n    virtual bool    IsSeekable () const override\n    {\n        return false;\n    }\n    virtual SeekOffsetType  GetWriteOffset () const override\n    {\n        AssertNotImplemented ();\n        return 0;\n    }\n    virtual SeekOffsetType  SeekWrite (Whence whence, SignedSeekOffsetType offset) override\n    {\n        AssertNotImplemented ();\n        return 0;\n    }\n    virtual void    Write (const Character* start, const Character* end)  override\n    {\n#if     !qCompilerAndStdLib_string_conversions_Buggy\n        const wchar_t*  sc  =   CVT_CHARACTER_2_wchar_t (start);\n        const wchar_t*  ec  =   CVT_CHARACTER_2_wchar_t (end);\n        const wchar_t*  pc  =   sc;\n\n        mbstate_t mb {};\n\n        char  outBuf[10 * 1024];\n        \/\/char    outBuf[10]; \/\/ to test\n        lock_guard<const AssertExternallySynchronizedLock> critSec { *this };\nAgain:\n        char*   p   =   std::begin (outBuf);\n        codecvt_utf8<wchar_t>::result r = kConverter_.out (mb, sc, ec, pc, std::begin (outBuf), std::end (outBuf), p);\n        Assert (std::begin (outBuf) <= p and p <= std::end (outBuf));\n        _fSource.Write (reinterpret_cast<const Byte*> (std::begin (outBuf)), reinterpret_cast<const Byte*> (p));\n        if (r == codecvt_utf8<wchar_t>::partial or pc < ec) {\n            sc = pc;\n            goto Again;\n        }\n        if (r != codecvt_utf8<wchar_t>::ok) {\n            \/\/ not sure waht to throw!\n            Execution::DoThrow (Execution::StringException (String_Constant (L\"Error converting characters codepage\")));\n        }\n#else\n        const wchar_t*  sc  =   CVT_CHARACTER_2_wchar_t (start);\n        const wchar_t*  ec  =   CVT_CHARACTER_2_wchar_t (end);\n        string tmp = Characters::WideStringToUTF8 (wstring (sc, ec));\n        _fSource.Write (reinterpret_cast<const Byte*> (Containers::Start (tmp)), reinterpret_cast<const Byte*> (Containers::Start (tmp) + tmp.length ()));\n#endif\n    }\n    virtual void    Flush () override\n    {\n        \/\/ NYI\n    }\n\nprotected:\n    OutputStream<Byte>          _fSource;\n};\n\n\nclass   TextWriter::UnSeekable_WCharT_Rep_ : public OutputStream<Character>::_IRep, private Debug::AssertExternallySynchronizedLock  {\npublic:\n    UnSeekable_WCharT_Rep_ (const OutputStream<Byte>& src, bool useBOM)\n        : _fSource (src)\n    {\n        constexpr   Character   kBOM    =    L'\\xFEFF'; \/\/  same whether 16 or 32 bit encoding -- see http:\/\/en.wikipedia.org\/wiki\/Byte_order_mark\n        if (useBOM) {\n            Write (&kBOM, &kBOM + 1);\n        }\n    }\n\nprotected:\n    virtual bool    IsSeekable () const override\n    {\n        return false;\n    }\n    virtual SeekOffsetType  GetWriteOffset () const override\n    {\n        AssertNotImplemented ();\n        return 0;\n    }\n    virtual SeekOffsetType  SeekWrite (Whence whence, SignedSeekOffsetType offset) override\n    {\n        AssertNotImplemented ();\n        return 0;\n    }\n    virtual void    Write (const Character* start, const Character* end)  override\n    {\n        lock_guard<const AssertExternallySynchronizedLock> critSec { *this };\n        _fSource.Write (reinterpret_cast<const Byte*> (start), reinterpret_cast<const Byte*> (end));\n    }\n    virtual void    Flush () override\n    {\n        lock_guard<const AssertExternallySynchronizedLock> critSec { *this };\n        _fSource.Flush ();\n    }\n\nprotected:\n    OutputStream<Byte>          _fSource;\n};\n\n\nclass   TextWriter::Seekable_UTF8_Rep_ : public UnSeekable_UTF8_Rep_ {\npublic:\n    Seekable_UTF8_Rep_ (const OutputStream<Byte>& src, bool useBOM)\n        : UnSeekable_UTF8_Rep_ (src, useBOM)\n        , fOffset_ (0)\n    {\n    }\n\nprotected:\n    virtual bool    IsSeekable () const override\n    {\n        return true;\n    }\n#if 0\n    virtual void    Write (const Character* start, const Character* end)  override\n    {\n        SeekOffsetType  offset  =   fOffset_;\n        \/\/ Take into account seek offset...\n    }\n#endif\n\n    virtual SeekOffsetType  GetWriteOffset () const override\n    {\n        AssertNotImplemented ();\n        return fOffset_;\n    }\n\n    virtual SeekOffsetType  SeekWrite (Whence whence, SignedSeekOffsetType offset) override\n    {\n        AssertNotImplemented ();\n        return 0;\n    }\n\nprivate:\n    size_t              fOffset_;\n};\n\n\nclass   TextWriter::Seekable_WCharT_Rep_ : public UnSeekable_WCharT_Rep_ {\npublic:\n    Seekable_WCharT_Rep_ (const OutputStream<Byte>& src, bool useBOM)\n        : UnSeekable_WCharT_Rep_ (src, useBOM)\n        , fOffset_ (0)\n    {\n    }\n\nprotected:\n    virtual bool    IsSeekable () const override\n    {\n        return true;\n    }\n#if 0\n    virtual void    Write (const Character* start, const Character* end)  override\n    {\n        SeekOffsetType  offset  =   fOffset_;\n        \/\/ Take into account seek offset...\n    }\n#endif\n\n    virtual SeekOffsetType  GetWriteOffset () const override\n    {\n        AssertNotImplemented ();\n        return fOffset_;\n    }\n\n    virtual SeekOffsetType  SeekWrite (Whence whence, SignedSeekOffsetType offset) override\n    {\n        AssertNotImplemented ();\n        return 0;\n    }\n\nprivate:\n    size_t              fOffset_;\n};\n\n\n\n\/*\n ********************************************************************************\n ****************************** Streams::TextWriter *****************************\n ********************************************************************************\n *\/\nTextWriter::TextWriter (const OutputStream<Byte>& src, Format format)\n    : OutputStream<Character> (mk_ (src, format))\n{\n}\n\nshared_ptr<TextWriter::_IRep> TextWriter::mk_ (const OutputStream<Byte>& src, Format format)\n{\n    bool    newOneSeekable  =   src.IsSeekable ();\n    bool    withBOM         =   (format == Format::eUTF8WithBOM or format == Format::eWCharTWithBOM);\n    switch (format) {\n        case Format::eUTF8WithBOM:\n        case Format::eUTF8WithoutBOM:\n            return newOneSeekable ? make_shared<Seekable_UTF8_Rep_> (src, withBOM) : make_shared<UnSeekable_UTF8_Rep_> (src, withBOM);\n        case Format::eWCharTWithBOM:\n        case Format::eWCharTWithoutBOM:\n            return newOneSeekable ? make_shared<Seekable_WCharT_Rep_> (src, withBOM) : make_shared<UnSeekable_WCharT_Rep_> (src, withBOM);\n        default:\n            RequireNotReached();\n            return nullptr;\n    }\n}\n\nvoid    TextWriter::PrintF (const wchar_t* format, ...)\n{\n    RequireNotNull (format);\n    va_list     argsList;\n    va_start (argsList, format);\n    Write (Characters::FormatV (format, argsList));\n    va_end (argsList);\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Fixing the memory leak in AudioEncoderCopyRedDeathTest.NullSpeechEncoder<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"p2Defs.h\"\n#include \"p2Log.h\"\n#include \"j1App.h\"\n#include \"j1Input.h\"\n#include \"j1Textures.h\"\n#include \"j1Audio.h\"\n#include \"j1Render.h\"\n#include \"j1Window.h\"\n#include \"j1Map.h\"\n#include \"j1Colliders.h\"\n#include \"j1Pathfinding.h\"\n#include \"j1Scene.h\"\n#include \"j1Scene2.h\"\n#include \"j1Player.h\"\n#include \"j1Entities.h\"\n#include \"Player.h\"\n\nj1Scene::j1Scene() : j1Module()\n{\n\tname.create(\"scene\");\n}\n\n\/\/ Destructor\nj1Scene::~j1Scene()\n{}\n\n\/\/ Called before render is available\nbool j1Scene::Awake(pugi::xml_node& config)\n{\n\tLOG(\"Loading Scene\");\n\tbool ret = true;\n\tMap_1 = true;\n\tMap_2 = false;\n\n\n\treturn ret;\n}\n\n\/\/ Called before the first frame\nbool j1Scene::Start()\n{\n\t\n\tif (Map_1)\n\t{\n\t\tApp->map->Load(\"Map_1.tmx\");\n\t\tApp->audio->PlayMusic(\"audio\/music\/map1_music.ogg\");\n\t\tApp->map->Draw_Colliders();\n\t\tApp->colliders->AddCollider({ 25400,0,50,380 }, COLLIDER_WIN, this);\n\n\t\t\/\/App->entities->AddEnemy(PLAYER, 10, 0);\n\n\t\t\/\/enemies\n\t\tApp->entities->AddEnemy(ZOMBIE, 1300, 600);\n\t\tApp->entities->AddEnemy(ZOMBIE, 2500, 600);\n\t\t\/\/App->entities->AddEnemy(ZOMBIE, 7000, 600);\n\t\t\/\/App->entities->AddEnemy(ZOMBIE, 1300, 600);\n\t\t\/\/App->entities->AddEnemy(ZOMBIE, 9812, 668);\n\t\t\/\/App->colliders->AddCollider({ 32,600,32,1 }, COLLIDER_FLOOR, this);\n\t\t\/\/App->colliders->AddCollider({ 64,600,32,1 }, COLLIDER_FLOOR, this);\n\t\tApp->entities->AddEnemy(PLANE, 1500, 100);\n\t\t\/\/App->entities->AddEnemy(PLANE, 2000, 100);\n\t\tApp->colliders->AddCollider({ 11104,636,608,64 }, COLLIDER_DEATH);\n\t\tApp->colliders->AddCollider({ 22112,829,288,32 }, COLLIDER_DEATH);\n\t}\n\n\tif (Map_2)\n\t{\n\t\tApp->map->Load(\"Map_2.tmx\");\n\t\tApp->audio->PlayMusic(\"audio\/music\/map1_music.ogg\");\n\t\tApp->map->Draw_Colliders();\n\n\t\tApp->colliders->AddCollider({ 25400,0,50,310 }, COLLIDER_WIN2, this);\n\t\tApp->colliders->AddCollider({ 18923,0,50,310 }, COLLIDER_WIN2, this);\n\t\tApp->colliders->AddCollider({ 21087,828,320,32 }, COLLIDER_DEATH);\n\n\t\t\/\/App->enemies->AddEnemy(ZOMBIE, 10, 10);\n\t\tApp->entities->AddEnemy(ZOMBIE, 20076,284);\n\t\tApp->entities->AddEnemy(ZOMBIE, 19088, 60);\n\t}\n\n\treturn true;\n}\n\n\/\/ Called each loop iteration\nbool j1Scene::PreUpdate()\n{\n\tBROFILER_CATEGORY(\"PreUpdate_Scene1 \", Profiler::Color::Orchid)\n\treturn true;\n}\n\n\/\/ Called each loop iteration\nbool j1Scene::Update(float dt)\n{\n\tBROFILER_CATEGORY(\"Update_Scene1 \", Profiler::Color::MediumOrchid)\n\n\tif(App->input->GetKey(SDL_SCANCODE_F5) == KEY_DOWN)\n\t\tApp->SaveGame();\n\n\tif(App->input->GetKey(SDL_SCANCODE_F6) == KEY_DOWN)\n\t\tApp->LoadGame();\n\n\tif (App->input->GetKey(SDL_SCANCODE_F1) == KEY_DOWN)\n\t{\n\t\tif (Map_1)\n\t\t{\n\t\t\tStartCurrentScene();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tChangeScene(60, 215);\n\t\t}\n\t}\n\n\tif (App->input->GetKey(SDL_SCANCODE_F2) == KEY_DOWN)\n\t\tStartCurrentScene();\n\n\tif (App->input->GetKey(SDL_SCANCODE_F7) == KEY_DOWN)\n\t\tChangeScene(60,215);\n\n\tif (App->input->GetKey(SDL_SCANCODE_F8) == KEY_DOWN)\n\t{\n\t\tApp->pathfinding->ResetPath();\n\t\tiPoint PlayerPosition = { App->player->position.x, App->player->position.y+50 };\n\t\t\n\t\tif (App->pathfinding->CreatePath({ 0,0 }, PlayerPosition) != -1)\n\t\t{\n\t\t\tApp->pathfinding->Path(PlayerPosition.x, PlayerPosition.y, path_test);\n\t\t}\n\t\tLOG(\"Path created\");\n\t}\n\n\tif (App->input->GetKey(SDL_SCANCODE_F11) == KEY_DOWN)\n\t{\n\t\tif (App->Cap_on)\n\t\t{\n\t\t\tApp->Cap_on = false;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tApp->Cap_on = true;\n\t\t}\n\t}\n\t\t\n\t\/*if (App->player->position.x > dist1 && App->player->position.x <= 24630)\n\t{\n\t\tApp->render->camera.x = -App->player->position.x + App->player->win_width \/ 2;\n\t}*\/\n\t\n\n\t\/\/Camera Movement--------------------------------------\n\tint map_height = App->map->data.height * App->map->data.tile_height;\n\tint map_width = App->map->data.width * App->map->data.tile_width;\n\tint win_height = App->player->win_height;\n\tint win_width = App->player->win_width;\n\tint win_position_x = App->render->camera.x;\n\tint win_position_y = App->render->camera.y*-1;\n\tint limit_y = map_height - win_height;\n\tint limit_x = map_width - win_width;\n\n\tif (App->entities->player->original_pos.x > App->player->win_width \/ 2 && App->entities->player->original_pos.x <= limit_x)\n\t{\n\t\tApp->render->camera.x = App->entities->player->win_width \/ 2 - App->entities->player->original_pos.x;\n\t}\n\tif (!App->win->fullscreen_window && App->entities->player->original_pos.y > win_height \/ 2 && win_position_y+win_height <map_height)\n\t{\n\t\tif (App->entities->player->original_pos.y + App->player->win_height \/ 2 < map_height)\n\t\t{\n\t\t\tApp->render->camera.y = -App->entities->player->original_pos.y + App->player->win_height \/ 2;\n\t\t}\n\t}\n\t\n\t\/*if (App->entities->player->original_pos.y > win_height\/2 && win_position_y <= limit_y * 0.9)\n\t{\n\t\tApp->render->camera.y = App->entities->player->win_height \/ 2 - (int)App->entities->player->original_pos.y;\n\t}*\/\n\t\n\t\/\/if (App->entities->player->original_pos.y >  && App->entities->player->original_pos.y < App->player->win_height - 50 && !App->win->fullscreen_window)\n\t\/\/{\n\t\/\/\tApp->render->camera.y = App->player->win_height \/ 2 - (int)App->entities->player->original_pos.y;\n\t\/\/}\n\n\n\n\t\n\n\n\n\tApp->map->Draw();\n\tApp->pathfinding->DrawPath(path_test);\n\n\tp2SString title(\"%s\",App->GetTitle());\n\n\t\/\/App->win->SetTitle(title.GetString());\n\treturn true;\n}\n\n\/\/ Called each loop iteration\nbool j1Scene::PostUpdate()\n{\n\tbool ret = true;\n\tBROFILER_CATEGORY(\"PosUpdate_Scene1 \", Profiler::Color::DarkOrchid)\n\tif(App->input->GetKey(SDL_SCANCODE_ESCAPE) == KEY_DOWN)\n\t\tret = false;\n\n\treturn ret;\n}\n\n\/\/ Called before quitting\nbool j1Scene::CleanUp()\n{\n\tLOG(\"Freeing scene\");\n\t\n\tApp->entities->CleanUp();\n\tApp->colliders->CleanUp();\n\tApp->map->CleanUp();\n\tApp->pathfinding->CleanUp();\n\tApp->tex->CleanUp();\n\n\treturn true;\n}\n\n\/\/go to the begining\nvoid j1Scene::StartCurrentScene()\n{\n\tApp->entities->player->original_pos.x = 60;\n\tApp->entities->player->original_pos.y = 215;\n\tApp->render->camera.x = 0;\n\tApp->render->camera.y = 0;\n}\n\n\/\/Change to scene 2\nvoid j1Scene::ChangeScene(int x, int y)\n{\n\tCleanUp();\n\t\n\tif (Map_1 && App->entities->player->Curr_map==1)\n\t{\n\t\tMap_1 = false;\n\t\tMap_2 = true;\n\n\t\tApp->scene->Start();\n\t\tApp->pathfinding->Start();\n\t\tApp->entities->player->original_pos.y = y;\n\t\tApp->entities->player->original_pos.x = x;\n\t\tApp->render->camera.x = 0;\n\t\tApp->render->camera.y = 0;\n\t\tApp->entities->player->Curr_map = 2;\n\t\tApp->entities->player->Start();\n\t}\n\telse\n\t{\n\t\tMap_1 = true;\n\t\tMap_2 = false;\n\n\t\tApp->scene->Start();\n\t\tApp->pathfinding->Start();\n\t\tApp->entities->player->original_pos.y = y;\n\t\tApp->entities->player->original_pos.x = x;\n\t\tApp->render->camera.x = 0;\n\t\tApp->render->camera.y = 0;\n\t\tApp->entities->player->Curr_map = 1;\n\t\tApp->entities->player->Start();\n\t}\n\t\n}<commit_msg>clening code<commit_after>#include \"p2Defs.h\"\n#include \"p2Log.h\"\n#include \"j1App.h\"\n#include \"j1Input.h\"\n#include \"j1Textures.h\"\n#include \"j1Audio.h\"\n#include \"j1Render.h\"\n#include \"j1Window.h\"\n#include \"j1Map.h\"\n#include \"j1Colliders.h\"\n#include \"j1Pathfinding.h\"\n#include \"j1Scene.h\"\n#include \"j1Scene2.h\"\n#include \"j1Player.h\"\n#include \"j1Entities.h\"\n#include \"Player.h\"\n\nj1Scene::j1Scene() : j1Module()\n{\n\tname.create(\"scene\");\n}\n\n\/\/ Destructor\nj1Scene::~j1Scene()\n{}\n\n\/\/ Called before render is available\nbool j1Scene::Awake(pugi::xml_node& config)\n{\n\tLOG(\"Loading Scene\");\n\tbool ret = true;\n\tMap_1 = true;\n\tMap_2 = false;\n\n\n\treturn ret;\n}\n\n\/\/ Called before the first frame\nbool j1Scene::Start()\n{\n\t\n\tif (Map_1)\n\t{\n\t\tApp->map->Load(\"Map_1.tmx\");\n\t\tApp->audio->PlayMusic(\"audio\/music\/map1_music.ogg\");\n\t\tApp->map->Draw_Colliders();\n\t\tApp->colliders->AddCollider({ 25400,0,50,380 }, COLLIDER_WIN, this);\n\n\t\t\/\/App->entities->AddEnemy(PLAYER, 10, 0);\n\n\t\t\/\/enemies\n\t\tApp->entities->AddEnemy(ZOMBIE, 1300, 600);\n\t\tApp->entities->AddEnemy(ZOMBIE, 2500, 600);\n\t\t\/\/App->entities->AddEnemy(ZOMBIE, 7000, 600);\n\t\t\/\/App->entities->AddEnemy(ZOMBIE, 1300, 600);\n\t\t\/\/App->entities->AddEnemy(ZOMBIE, 9812, 668);\n\t\t\/\/App->colliders->AddCollider({ 32,600,32,1 }, COLLIDER_FLOOR, this);\n\t\t\/\/App->colliders->AddCollider({ 64,600,32,1 }, COLLIDER_FLOOR, this);\n\t\tApp->entities->AddEnemy(PLANE, 1500, 100);\n\t\t\/\/App->entities->AddEnemy(PLANE, 2000, 100);\n\t\tApp->colliders->AddCollider({ 11104,636,608,64 }, COLLIDER_DEATH);\n\t\tApp->colliders->AddCollider({ 22112,829,288,32 }, COLLIDER_DEATH);\n\t}\n\n\tif (Map_2)\n\t{\n\t\tApp->map->Load(\"Map_2.tmx\");\n\t\tApp->audio->PlayMusic(\"audio\/music\/map1_music.ogg\");\n\t\tApp->map->Draw_Colliders();\n\n\t\tApp->colliders->AddCollider({ 25400,0,50,310 }, COLLIDER_WIN2, this);\n\t\tApp->colliders->AddCollider({ 18923,0,50,310 }, COLLIDER_WIN2, this);\n\t\tApp->colliders->AddCollider({ 21087,828,320,32 }, COLLIDER_DEATH);\n\n\t\t\/\/App->enemies->AddEnemy(ZOMBIE, 10, 10);\n\t\tApp->entities->AddEnemy(ZOMBIE, 20076,284);\n\t\tApp->entities->AddEnemy(ZOMBIE, 19088, 60);\n\t}\n\n\treturn true;\n}\n\n\/\/ Called each loop iteration\nbool j1Scene::PreUpdate()\n{\n\tBROFILER_CATEGORY(\"PreUpdate_Scene1 \", Profiler::Color::Orchid)\n\treturn true;\n}\n\n\/\/ Called each loop iteration\nbool j1Scene::Update(float dt)\n{\n\tBROFILER_CATEGORY(\"Update_Scene1 \", Profiler::Color::MediumOrchid)\n\n\tif(App->input->GetKey(SDL_SCANCODE_F5) == KEY_DOWN)\n\t\tApp->SaveGame();\n\n\tif(App->input->GetKey(SDL_SCANCODE_F6) == KEY_DOWN)\n\t\tApp->LoadGame();\n\n\tif (App->input->GetKey(SDL_SCANCODE_F1) == KEY_DOWN)\n\t{\n\t\tif (Map_1)\n\t\t{\n\t\t\tStartCurrentScene();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tChangeScene(60, 215);\n\t\t}\n\t}\n\n\tif (App->input->GetKey(SDL_SCANCODE_F2) == KEY_DOWN)\n\t\tStartCurrentScene();\n\n\tif (App->input->GetKey(SDL_SCANCODE_F7) == KEY_DOWN)\n\t\tChangeScene(60,215);\n\n\tif (App->input->GetKey(SDL_SCANCODE_F8) == KEY_DOWN)\n\t{\n\t\tApp->pathfinding->ResetPath();\n\t\tiPoint PlayerPosition = { App->player->position.x, App->player->position.y+50 };\n\t\t\n\t\tif (App->pathfinding->CreatePath({ 0,0 }, PlayerPosition) != -1)\n\t\t{\n\t\t\tApp->pathfinding->Path(PlayerPosition.x, PlayerPosition.y, path_test);\n\t\t}\n\t\tLOG(\"Path created\");\n\t}\n\n\tif (App->input->GetKey(SDL_SCANCODE_F11) == KEY_DOWN)\n\t{\n\t\tif (App->Cap_on)\n\t\t{\n\t\t\tApp->Cap_on = false;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tApp->Cap_on = true;\n\t\t}\n\t}\t\n\n\t\/\/Camera Movement--------------------------------------\n\tint map_height = App->map->data.height * App->map->data.tile_height;\n\tint map_width = App->map->data.width * App->map->data.tile_width;\n\tint win_height = App->player->win_height;\n\tint win_width = App->player->win_width;\n\tint win_position_y = App->render->camera.y*-1;\n\tint limit_y = map_height - win_height;\n\tint limit_x = map_width - win_width;\n\n\tif (App->entities->player->original_pos.x > App->player->win_width \/ 2 && App->entities->player->original_pos.x <= limit_x)\n\t{\n\t\tApp->render->camera.x = App->entities->player->win_width \/ 2 - App->entities->player->original_pos.x;\n\t}\n\t\n\tif (!App->win->fullscreen_window && App->entities->player->original_pos.y > win_height \/ 2 && win_position_y+win_height <map_height)\n\t{\n\t\tif (App->entities->player->original_pos.y + App->player->win_height \/ 2 < map_height)\n\t\t{\n\t\t\tApp->render->camera.y = -App->entities->player->original_pos.y + App->player->win_height \/ 2;\n\t\t}\n\t}\n\n\tApp->map->Draw();\n\tApp->pathfinding->DrawPath(path_test);\n\n\tp2SString title(\"%s\",App->GetTitle());\n\n\t\/\/App->win->SetTitle(title.GetString());\n\treturn true;\n}\n\n\/\/ Called each loop iteration\nbool j1Scene::PostUpdate()\n{\n\tbool ret = true;\n\tBROFILER_CATEGORY(\"PosUpdate_Scene1 \", Profiler::Color::DarkOrchid)\n\tif(App->input->GetKey(SDL_SCANCODE_ESCAPE) == KEY_DOWN)\n\t\tret = false;\n\n\treturn ret;\n}\n\n\/\/ Called before quitting\nbool j1Scene::CleanUp()\n{\n\tLOG(\"Freeing scene\");\n\t\n\tApp->entities->CleanUp();\n\tApp->colliders->CleanUp();\n\tApp->map->CleanUp();\n\tApp->pathfinding->CleanUp();\n\tApp->tex->CleanUp();\n\n\treturn true;\n}\n\n\/\/go to the begining\nvoid j1Scene::StartCurrentScene()\n{\n\tApp->entities->player->original_pos.x = 60;\n\tApp->entities->player->original_pos.y = 215;\n\tApp->render->camera.x = 0;\n\tApp->render->camera.y = 0;\n}\n\n\/\/Change to scene 2\nvoid j1Scene::ChangeScene(int x, int y)\n{\n\tCleanUp();\n\t\n\tif (Map_1 && App->entities->player->Curr_map==1)\n\t{\n\t\tMap_1 = false;\n\t\tMap_2 = true;\n\n\t\tApp->scene->Start();\n\t\tApp->pathfinding->Start();\n\t\tApp->entities->player->original_pos.y = y;\n\t\tApp->entities->player->original_pos.x = x;\n\t\tApp->render->camera.x = 0;\n\t\tApp->render->camera.y = 0;\n\t\tApp->entities->player->Curr_map = 2;\n\t\tApp->entities->player->Start();\n\t}\n\telse\n\t{\n\t\tMap_1 = true;\n\t\tMap_2 = false;\n\n\t\tApp->scene->Start();\n\t\tApp->pathfinding->Start();\n\t\tApp->entities->player->original_pos.y = y;\n\t\tApp->entities->player->original_pos.x = x;\n\t\tApp->render->camera.x = 0;\n\t\tApp->render->camera.y = 0;\n\t\tApp->entities->player->Curr_map = 1;\n\t\tApp->entities->player->Start();\n\t}\n\t\n}<|endoftext|>"}
{"text":"<commit_before>\/* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- *\/\n\/\/ vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4:\n#ident \"$Id$\"\n\/*\nCOPYING CONDITIONS NOTICE:\n\n  This program is free software; you can redistribute it and\/or modify\n  it under the terms of version 2 of the GNU General Public License as\n  published by the Free Software Foundation, and provided that the\n  following conditions are met:\n\n      * Redistributions of source code must retain this COPYING\n        CONDITIONS NOTICE, the COPYRIGHT NOTICE (below), the\n        DISCLAIMER (below), the UNIVERSITY PATENT NOTICE (below), the\n        PATENT MARKING NOTICE (below), and the PATENT RIGHTS\n        GRANT (below).\n\n      * Redistributions in binary form must reproduce this COPYING\n        CONDITIONS NOTICE, the COPYRIGHT NOTICE (below), the\n        DISCLAIMER (below), the UNIVERSITY PATENT NOTICE (below), the\n        PATENT MARKING NOTICE (below), and the PATENT RIGHTS\n        GRANT (below) in the documentation and\/or other materials\n        provided with the distribution.\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\nCOPYRIGHT NOTICE:\n\n  TokuFT, Tokutek Fractal Tree Indexing Library.\n  Copyright (C) 2007-2013 Tokutek, Inc.\n\nDISCLAIMER:\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\nUNIVERSITY PATENT NOTICE:\n\n  The technology is licensed by the Massachusetts Institute of\n  Technology, Rutgers State University of New Jersey, and the Research\n  Foundation of State University of New York at Stony Brook under\n  United States of America Serial No. 11\/760379 and to the patents\n  and\/or patent applications resulting from it.\n\nPATENT MARKING NOTICE:\n\n  This software is covered by US Patent No. 8,185,551.\n  This software is covered by US Patent No. 8,489,638.\n\nPATENT RIGHTS GRANT:\n\n  \"THIS IMPLEMENTATION\" means the copyrightable works distributed by\n  Tokutek as part of the Fractal Tree project.\n\n  \"PATENT CLAIMS\" means the claims of patents that are owned or\n  licensable by Tokutek, both currently or in the future; and that in\n  the absence of this license would be infringed by THIS\n  IMPLEMENTATION or by using or running THIS IMPLEMENTATION.\n\n  \"PATENT CHALLENGE\" shall mean a challenge to the validity,\n  patentability, enforceability and\/or non-infringement of any of the\n  PATENT CLAIMS or otherwise opposing any of the PATENT CLAIMS.\n\n  Tokutek hereby grants to you, for the term and geographical scope of\n  the PATENT CLAIMS, a non-exclusive, no-charge, royalty-free,\n  irrevocable (except as stated in this section) patent license to\n  make, have made, use, offer to sell, sell, import, transfer, and\n  otherwise run, modify, and propagate the contents of THIS\n  IMPLEMENTATION, where such license applies only to the PATENT\n  CLAIMS.  This grant does not include claims that would be infringed\n  only as a consequence of further modifications of THIS\n  IMPLEMENTATION.  If you or your agent or licensee institute or order\n  or agree to the institution of patent litigation against any entity\n  (including a cross-claim or counterclaim in a lawsuit) alleging that\n  THIS IMPLEMENTATION constitutes direct or contributory patent\n  infringement, or inducement of patent infringement, then any rights\n  granted to you under this License shall terminate as of the date\n  such litigation is filed.  If you or your agent or exclusive\n  licensee institute or order or agree to the institution of a PATENT\n  CHALLENGE, then Tokutek may terminate any rights granted to you\n  under this License.\n*\/\n\n#ident \"Copyright (c) 2014 Tokutek Inc.  All rights reserved.\"\n#ident \"The technology is licensed by the Massachusetts Institute of Technology, Rutgers State University of New Jersey, and the Research Foundation of State University of New York at Stony Brook under United States of America Serial No. 11\/760379 and to the patents and\/or patent applications resulting from it.\"\n\n#include \"test.h\"\n#include \"locktree.h\"\n#include \"lock_request.h\"\n\n\/\/ Test FT-633, the data race on the lock request between ::start and ::retry\n\/\/ This test is non-deterministic.  It uses sleeps at 2 critical places to\n\/\/ expose the data race on the lock requests state.\n\nnamespace toku {\n\nstruct locker_arg {\n    locktree *_lt;\n    TXNID _id;\n    const DBT *_key;\n\n    locker_arg(locktree *lt, TXNID id, const DBT *key) : _lt(lt), _id(id), _key(key) {\n    }\n};\n\nstatic void locker_callback(void) {\n    usleep(10000);\n}\n\nstatic void run_locker(locktree *lt, TXNID txnid, const DBT *key) {\n    int i;\n    for (i = 0; i < 1000; i++) {\n\n        lock_request request;\n        request.create();\n\n        request.set(lt, txnid, key, key, lock_request::type::WRITE, false);\n\n        \/\/ set the test callbacks\n        request.set_start_test_callback(locker_callback);\n        request.set_retry_test_callback(locker_callback);\n\n        \/\/ try to acquire the lock\n        int r = request.start();\n        if (r == DB_LOCK_NOTGRANTED) {\n            \/\/ wait for the lock to be granted\n            r = request.wait(10 * 1000);\n        }\n\n        if (r == 0) {\n            \/\/ release the lock\n            range_buffer buffer;\n            buffer.create();\n            buffer.append(key, key);\n            lt->release_locks(txnid, &buffer);\n            buffer.destroy();\n\n            \/\/ retry pending lock requests\n            lock_request::retry_all_lock_requests(lt);\n        }\n\n        request.destroy();\n        memset(&request, 0xab, sizeof request);\n\n        toku_pthread_yield();\n        if ((i % 10) == 0)\n            printf(\"%lu %d\\n\", toku_pthread_self(), i);\n    }\n}\n\nstatic void *locker(void *v_arg) {\n    locker_arg *arg = static_cast<locker_arg *>(v_arg);\n    run_locker(arg->_lt, arg->_id, arg->_key);\n    return arg;\n}\n\n} \/* namespace toku *\/\n\nint main(void) {\n    int r;\n\n    toku::locktree lt;\n    DICTIONARY_ID dict_id = { 1 };\n    lt.create(nullptr, dict_id, toku::dbt_comparator);\n\n    const DBT *one = toku::get_dbt(1);\n\n    const int n_workers = 2;\n    toku_pthread_t ids[n_workers];\n    for (int i = 0; i < n_workers; i++) {\n        toku::locker_arg *arg = new toku::locker_arg(&lt, i, one);\n        r = toku_pthread_create(&ids[i], nullptr, toku::locker, arg);\n        assert_zero(r);\n    }\n    for (int i = 0; i < n_workers; i++) {\n        void *ret;\n        r = toku_pthread_join(ids[i], &ret);\n        assert_zero(r);\n        toku::locker_arg *arg = static_cast<toku::locker_arg *>(ret);\n        delete arg;\n    }\n\n    lt.release_reference();\n    lt.destroy();\n    return 0;\n}\n\n<commit_msg>FT-633 build on osx<commit_after>\/* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- *\/\n\/\/ vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4:\n#ident \"$Id$\"\n\/*\nCOPYING CONDITIONS NOTICE:\n\n  This program is free software; you can redistribute it and\/or modify\n  it under the terms of version 2 of the GNU General Public License as\n  published by the Free Software Foundation, and provided that the\n  following conditions are met:\n\n      * Redistributions of source code must retain this COPYING\n        CONDITIONS NOTICE, the COPYRIGHT NOTICE (below), the\n        DISCLAIMER (below), the UNIVERSITY PATENT NOTICE (below), the\n        PATENT MARKING NOTICE (below), and the PATENT RIGHTS\n        GRANT (below).\n\n      * Redistributions in binary form must reproduce this COPYING\n        CONDITIONS NOTICE, the COPYRIGHT NOTICE (below), the\n        DISCLAIMER (below), the UNIVERSITY PATENT NOTICE (below), the\n        PATENT MARKING NOTICE (below), and the PATENT RIGHTS\n        GRANT (below) in the documentation and\/or other materials\n        provided with the distribution.\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\nCOPYRIGHT NOTICE:\n\n  TokuFT, Tokutek Fractal Tree Indexing Library.\n  Copyright (C) 2007-2013 Tokutek, Inc.\n\nDISCLAIMER:\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\nUNIVERSITY PATENT NOTICE:\n\n  The technology is licensed by the Massachusetts Institute of\n  Technology, Rutgers State University of New Jersey, and the Research\n  Foundation of State University of New York at Stony Brook under\n  United States of America Serial No. 11\/760379 and to the patents\n  and\/or patent applications resulting from it.\n\nPATENT MARKING NOTICE:\n\n  This software is covered by US Patent No. 8,185,551.\n  This software is covered by US Patent No. 8,489,638.\n\nPATENT RIGHTS GRANT:\n\n  \"THIS IMPLEMENTATION\" means the copyrightable works distributed by\n  Tokutek as part of the Fractal Tree project.\n\n  \"PATENT CLAIMS\" means the claims of patents that are owned or\n  licensable by Tokutek, both currently or in the future; and that in\n  the absence of this license would be infringed by THIS\n  IMPLEMENTATION or by using or running THIS IMPLEMENTATION.\n\n  \"PATENT CHALLENGE\" shall mean a challenge to the validity,\n  patentability, enforceability and\/or non-infringement of any of the\n  PATENT CLAIMS or otherwise opposing any of the PATENT CLAIMS.\n\n  Tokutek hereby grants to you, for the term and geographical scope of\n  the PATENT CLAIMS, a non-exclusive, no-charge, royalty-free,\n  irrevocable (except as stated in this section) patent license to\n  make, have made, use, offer to sell, sell, import, transfer, and\n  otherwise run, modify, and propagate the contents of THIS\n  IMPLEMENTATION, where such license applies only to the PATENT\n  CLAIMS.  This grant does not include claims that would be infringed\n  only as a consequence of further modifications of THIS\n  IMPLEMENTATION.  If you or your agent or licensee institute or order\n  or agree to the institution of patent litigation against any entity\n  (including a cross-claim or counterclaim in a lawsuit) alleging that\n  THIS IMPLEMENTATION constitutes direct or contributory patent\n  infringement, or inducement of patent infringement, then any rights\n  granted to you under this License shall terminate as of the date\n  such litigation is filed.  If you or your agent or exclusive\n  licensee institute or order or agree to the institution of a PATENT\n  CHALLENGE, then Tokutek may terminate any rights granted to you\n  under this License.\n*\/\n\n#ident \"Copyright (c) 2014 Tokutek Inc.  All rights reserved.\"\n#ident \"The technology is licensed by the Massachusetts Institute of Technology, Rutgers State University of New Jersey, and the Research Foundation of State University of New York at Stony Brook under United States of America Serial No. 11\/760379 and to the patents and\/or patent applications resulting from it.\"\n\n#include <iostream>\n#include \"test.h\"\n#include \"locktree.h\"\n#include \"lock_request.h\"\n\n\/\/ Test FT-633, the data race on the lock request between ::start and ::retry\n\/\/ This test is non-deterministic.  It uses sleeps at 2 critical places to\n\/\/ expose the data race on the lock requests state.\n\nnamespace toku {\n\nstruct locker_arg {\n    locktree *_lt;\n    TXNID _id;\n    const DBT *_key;\n\n    locker_arg(locktree *lt, TXNID id, const DBT *key) : _lt(lt), _id(id), _key(key) {\n    }\n};\n\nstatic void locker_callback(void) {\n    usleep(10000);\n}\n\nstatic void run_locker(locktree *lt, TXNID txnid, const DBT *key) {\n    int i;\n    for (i = 0; i < 1000; i++) {\n\n        lock_request request;\n        request.create();\n\n        request.set(lt, txnid, key, key, lock_request::type::WRITE, false);\n\n        \/\/ set the test callbacks\n        request.set_start_test_callback(locker_callback);\n        request.set_retry_test_callback(locker_callback);\n\n        \/\/ try to acquire the lock\n        int r = request.start();\n        if (r == DB_LOCK_NOTGRANTED) {\n            \/\/ wait for the lock to be granted\n            r = request.wait(10 * 1000);\n        }\n\n        if (r == 0) {\n            \/\/ release the lock\n            range_buffer buffer;\n            buffer.create();\n            buffer.append(key, key);\n            lt->release_locks(txnid, &buffer);\n            buffer.destroy();\n\n            \/\/ retry pending lock requests\n            lock_request::retry_all_lock_requests(lt);\n        }\n\n        request.destroy();\n        memset(&request, 0xab, sizeof request);\n\n        toku_pthread_yield();\n        if ((i % 10) == 0)\n            std::cout << toku_pthread_self() << \" \" << i << std::endl;\n    }\n}\n\nstatic void *locker(void *v_arg) {\n    locker_arg *arg = static_cast<locker_arg *>(v_arg);\n    run_locker(arg->_lt, arg->_id, arg->_key);\n    return arg;\n}\n\n} \/* namespace toku *\/\n\nint main(void) {\n    int r;\n\n    toku::locktree lt;\n    DICTIONARY_ID dict_id = { 1 };\n    lt.create(nullptr, dict_id, toku::dbt_comparator);\n\n    const DBT *one = toku::get_dbt(1);\n\n    const int n_workers = 2;\n    toku_pthread_t ids[n_workers];\n    for (int i = 0; i < n_workers; i++) {\n        toku::locker_arg *arg = new toku::locker_arg(&lt, i, one);\n        r = toku_pthread_create(&ids[i], nullptr, toku::locker, arg);\n        assert_zero(r);\n    }\n    for (int i = 0; i < n_workers; i++) {\n        void *ret;\n        r = toku_pthread_join(ids[i], &ret);\n        assert_zero(r);\n        toku::locker_arg *arg = static_cast<toku::locker_arg *>(ret);\n        delete arg;\n    }\n\n    lt.release_reference();\n    lt.destroy();\n    return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ 22 january 2017\n\/\/ based on ..\/wind2dmingwtest.cpp\n#define UNICODE\n#define _UNICODE\n#define STRICT\n#define STRICT_TYPED_ITEMIDS\n#define INITGUID\n#define WINVER\t\t\t0x0600\n#define _WIN32_WINNT\t\t0x0600\n#define _WIN32_WINDOWS\t0x0600\n#define _WIN32_IE\t\t\t0x0700\n#define NTDDI_VERSION\t\t0x06000000\n#define CHARTYPE wchar_t\n#define TOCHAR(s) L##s\n#include <windows.h>\n#include <windowsx.h>\n#include <d2d1.h>\n#include <stdio.h>\n#include \"shared.h\"\n\nID2D1Factory *d2dfactory;\nHWND chooser;\nHWND ra;\n\nvoid loghr(const char *f, HRESULT hr)\n{\n\tchar hrs[20];\n\n\tOutputDebugStringA(f);\n\tOutputDebugStringA(\" \");\n\tsprintf(hrs, \"0x%08I32X\\n\", hr);\n\tOutputDebugStringA(hrs);\n}\n\nHRESULT doPaint(ID2D1RenderTarget *rt)\n{\n\tCOLORREF cref;\n\tD2D1_COLOR_F color;\n\tID2D1SolidColorBrush *brush;\n\tD2D1_RECT_F rect;\n\tconst struct rect *cr;\n\tint cc = 0;\n\tHRESULT hr;\n\n\trt->BeginDraw();\n\n\tcref = GetSysColor(COLOR_BTNFACE);\n\tcolor.r = ((double) GetRValue(cref)) \/ 255;\n\tcolor.g = ((double) GetGValue(cref)) \/ 255;\n\tcolor.b = ((double) GetBValue(cref)) \/ 255;\n\tcolor.a = 1.0;\n\trt->Clear(&color);\n\n\tcr = rectList[SendMessageW(chooser, CB_GETCURSEL, 0, 0)].rects;\n\twhile (cr->x < 50) {\n\t\tcolor.r = fillcolors[cc].r;\n\t\tcolor.g = fillcolors[cc].g;\n\t\tcolor.b = fillcolors[cc].b;\n\t\tcolor.a = fillcolors[cc].a;\n\t\thr = rt->CreateSolidColorBrush(&color, NULL, &brush);\n\t\tif (hr != S_OK) {\n\t\t\tloghr(\"CreateSolidColorBrush()\", hr);\n\t\t\trt->EndDraw(NULL, NULL);\n\t\t\treturn hr;\n\t\t}\n\n\t\trect.left = cr->x;\n\t\trect.top = cr->y;\n\t\trect.right = cr->x + cr->width;\n\t\trect.bottom = cr->y + cr->height;\n\t\trt->FillRectangle(&rect, brush);\n\n\t\tbrush->Release();\n\t\tcr++;\n\t\tcc = (cc + 1) % 4;\n\t}\n\n\thr = rt->EndDraw(NULL, NULL);\n\tif (hr != S_OK && hr != D2DERR_RECREATE_TARGET)\n\t\tloghr(\"EndDraw()\", hr);\n\treturn hr;\n}\n\nID2D1HwndRenderTarget *mkRenderTarget(HWND hwnd)\n{\n\tD2D1_RENDER_TARGET_PROPERTIES props;\n\tD2D1_HWND_RENDER_TARGET_PROPERTIES hprops;\n\tHDC dc;\n\tRECT r;\n\tID2D1HwndRenderTarget *rt;\n\tHRESULT hr;\n\n\tdc = GetDC(hwnd);\n\tZeroMemory(&props, sizeof (D2D1_RENDER_TARGET_PROPERTIES));\n\tprops.type = D2D1_RENDER_TARGET_TYPE_DEFAULT;\n\tprops.pixelFormat.format = DXGI_FORMAT_UNKNOWN;\n\tprops.pixelFormat.alphaMode = D2D1_ALPHA_MODE_UNKNOWN;\n\tprops.dpiX = GetDeviceCaps(dc, LOGPIXELSX);\n\tprops.dpiY = GetDeviceCaps(dc, LOGPIXELSY);\n\tprops.usage = D2D1_RENDER_TARGET_USAGE_NONE;\n\tprops.minLevel = D2D1_FEATURE_LEVEL_DEFAULT;\n\tReleaseDC(hwnd, dc);\n\n\tGetClientRect(hwnd, &r);\n\tZeroMemory(&hprops, sizeof (D2D1_HWND_RENDER_TARGET_PROPERTIES));\n\thprops.hwnd = hwnd;\n\thprops.pixelSize.width = r.right - r.left;\n\thprops.pixelSize.height = r.bottom - r.top;\n\t\/\/ according to Rick Brewster, some drivers will misbehave if we don't specify this (see http:\/\/stackoverflow.com\/a\/33222983\/3408572)\n\thprops.presentOptions = D2D1_PRESENT_OPTIONS_RETAIN_CONTENTS;\n\n\thr = d2dfactory->CreateHwndRenderTarget(\n\t\t&props,\n\t\t&hprops,\n\t\t&rt);\n\tif (hr != S_OK) {\n\t\tloghr(\"CreateHwndRenderTarget()\", hr);\n\t\treturn NULL;\n\t}\n\treturn rt;\n}\n\nLRESULT CALLBACK rawndproc(HWND hwnd, UINT uMsg, WPARAM wParam, LPARAM lParam)\n{\n\tLONG_PTR userdata;\n\tID2D1HwndRenderTarget *rt = NULL;\n\tWINDOWPOS *wp = (WINDOWPOS *) lParam;\n\tRECT client;\n\tD2D1_SIZE_U size;\n\n\tuserdata = GetWindowLongPtrW(hwnd, GWLP_USERDATA);\n\tif (userdata == 0) {\n\t\tif (uMsg == WM_CREATE)\n\t\t\tSetWindowLongPtrW(hwnd, GWLP_USERDATA, 1);\n\t\treturn DefWindowProcW(hwnd, uMsg, wParam, lParam);\n\t}\n\n\tif (userdata == 1) {\n\t\trt = mkRenderTarget(hwnd);\n\t\tif (rt == NULL) {\n\t\t\tPostQuitMessage(1);\n\t\t\treturn DefWindowProcW(hwnd, uMsg, wParam, lParam);\n\t\t}\n\t\tSetWindowLongPtrW(hwnd, GWLP_USERDATA, (LONG_PTR) rt);\n\t} else\n\t\trt = (ID2D1HwndRenderTarget *) userdata;\n\n\tswitch (uMsg) {\n\tcase WM_PAINT:\n\t\tswitch (doPaint(rt)) {\n\t\tcase S_OK:\n\t\t\tValidateRect(hwnd, NULL);\n\t\t\treturn 0;\n\t\tcase D2DERR_RECREATE_TARGET:\n\t\t\trt->Release();\n\t\t\tSetWindowLongPtrW(hwnd, GWLP_USERDATA, 1);\n\t\t\treturn 0;\n\t\t}\n\t\trt->Release();\n\t\tPostQuitMessage(1);\n\t\tbreak;\n\tcase WM_WINDOWPOSCHANGED:\n\t\tif ((wp->flags & SWP_NOSIZE) != 0)\n\t\t\tbreak;\n\t\tGetClientRect(hwnd, &client);\n\t\tsize.width = client.right - client.left;\n\t\tsize.height = client.bottom - client.top;\n\t\trt->Resize(&size);\n\t\tInvalidateRect(hwnd, NULL, TRUE);\n\t\treturn 0;\n\tcase WM_DESTROY:\n\t\trt->Release();\n\t\tSetWindowLongPtrW(hwnd, GWLP_USERDATA, 0);\n\t}\n\treturn DefWindowProcW(hwnd, uMsg, wParam, lParam);\n}\n\nLRESULT CALLBACK wndproc(HWND hwnd, UINT uMsg, WPARAM wParam, LPARAM lParam)\n{\n\tHWND hc;\n\n\tswitch (uMsg) {\n\tcase WM_COMMAND:\n\t\t\/\/ TODO make this more specific?\n\t\thc = (HWND) lParam;\n\t\tif (hc == chooser)\n\t\t\tInvalidateRect(ra, NULL, TRUE);\n\t\tbreak;\n\tcase WM_CLOSE:\n\t\tPostQuitMessage(0);\n\t}\n\treturn DefWindowProcW(hwnd, uMsg, wParam, lParam);\n}\n\nint main(int argc, char *argv[])\n{\n\tD2D1_FACTORY_OPTIONS opts;\n\tWNDCLASSW wc;\n\tRECT r;\n\tHWND mainwin;\n\tCOMBOBOXINFO cbi;\n\tint i;\n\tMSG msg;\n\tHRESULT hr;\n\n\tCoInitialize(NULL);\n\tZeroMemory(&opts, sizeof (D2D1_FACTORY_OPTIONS));\n\topts.debugLevel = D2D1_DEBUG_LEVEL_NONE;\n\thr = D2D1CreateFactory(D2D1_FACTORY_TYPE_SINGLE_THREADED,\n\t\tIID_ID2D1Factory,\n\t\t&opts,\n\t\t(void **) (&d2dfactory));\n\tif (hr != S_OK) {\n\t\tloghr(\"D2D1CreateFactory()\", hr);\n\t\treturn 1;\n\t}\n\n\tZeroMemory(&wc, sizeof (WNDCLASSW));\n\twc.lpszClassName = L\"mainwin\";\n\twc.lpfnWndProc = wndproc;\n\twc.hbrBackground = (HBRUSH) (COLOR_BTNFACE + 1);\n\tRegisterClassW(&wc);\n\tZeroMemory(&wc, sizeof (WNDCLASSW));\n\twc.lpszClassName = L\"rectArea\";\n\twc.lpfnWndProc = rawndproc;\n\twc.hbrBackground = (HBRUSH) (COLOR_BTNFACE + 1);\n\tRegisterClassW(&wc);\n\n\tr.left = 0;\n\tr.top = 0;\n\tr.right = 640;\n\tr.bottom = 480;\n\tAdjustWindowRectEx(&r,\n\t\tWS_OVERLAPPEDWINDOW,\n\t\tFALSE,\n\t\t0);\n\tmainwin = CreateWindowExW(0,\n\t\tL\"mainwin\", L\"mainwin\",\n\t\tWS_OVERLAPPEDWINDOW,\n\t\tCW_USEDEFAULT, CW_USEDEFAULT,\n\t\tr.right - r.left, r.bottom - r.top,\n\t\tNULL, NULL, NULL, NULL);\n\n\t\/\/ convert to client\n\tr.right = 640;\n\tr.bottom = 480;\n\t\/\/ and set everything up\n\tr.left = 7;\n\tr.right -= 7;\n\tr.top = 7;\n\tchooser = CreateWindowExW(0,\n\t\tL\"COMBOBOX\", L\"\",\n\t\tWS_CHILD | WS_VISIBLE | CBS_DROPDOWNLIST,\n\t\tr.left, r.top,\n\t\tr.right - r.left, 150,\n\t\tmainwin, (HMENU) 100, NULL, NULL);\n\tZeroMemory(&cbi, sizeof (COMBOBOXINFO));\n\tcbi.cbSize = sizeof (COMBOBOXINFO);\n\tSendMessageW(chooser, CB_GETCOMBOBOXINFO, 0, (LPARAM) (&cbi));\n\t\/\/ this I figured out is right (or at least seems to be right) on my own\n\tGetWindowRect(cbi.hwndCombo, &(cbi.rcItem));\n\tr.top += (cbi.rcItem.bottom - cbi.rcItem.top) + 4;\n\n\tr.bottom -= 7;\n\tra = CreateWindowExW(0,\n\t\tL\"rectArea\", L\"\",\n\t\tWS_CHILD | WS_VISIBLE,\n\t\tr.left, r.top,\n\t\tr.right - r.left, r.bottom - r.top,\n\t\tmainwin, (HMENU) 103, NULL, NULL);\n\n\tfor (i = 0; rectList[i].name != NULL; i++)\n\t\tSendMessageW(chooser, CB_ADDSTRING, 0, (LPARAM) (rectList[i].name));\n\tSendMessageW(chooser, CB_SETCURSEL, 0, 0);\n\n\tShowWindow(mainwin, SW_SHOWDEFAULT);\n\tUpdateWindow(mainwin);\n\n\twhile (GetMessageW(&msg, NULL, 0, 0)) {\n\t\tTranslateMessage(&msg);\n\t\tDispatchMessageW(&msg);\n\t}\n\n\td2dfactory->Release();\n\tCoUninitialize();\n\treturn msg.wParam;\n}\n<commit_msg>Finished the Windows equivalent code. Ugh, antialiasing works differently, so now I'm not sure what the solution is.<commit_after>\/\/ 22 january 2017\n\/\/ based on ..\/wind2dmingwtest.cpp\n#define UNICODE\n#define _UNICODE\n#define STRICT\n#define STRICT_TYPED_ITEMIDS\n#define INITGUID\n#define WINVER\t\t\t0x0600\n#define _WIN32_WINNT\t\t0x0600\n#define _WIN32_WINDOWS\t0x0600\n#define _WIN32_IE\t\t\t0x0700\n#define NTDDI_VERSION\t\t0x06000000\n#define CHARTYPE wchar_t\n#define TOCHAR(s) L##s\n#include <windows.h>\n#include <windowsx.h>\n#include <d2d1.h>\n#include <stdio.h>\n#include \"shared.h\"\n\nID2D1Factory *d2dfactory;\nHWND chooser;\nHWND antialias;\nHWND sameColor;\nHWND ra;\n\nvoid loghr(const char *f, HRESULT hr)\n{\n\tchar hrs[20];\n\n\tOutputDebugStringA(f);\n\tOutputDebugStringA(\" \");\n\tsprintf(hrs, \"0x%08I32X\\n\", hr);\n\tOutputDebugStringA(hrs);\n}\n\nHRESULT doPaint(ID2D1RenderTarget *rt)\n{\n\tCOLORREF cref;\n\tD2D1_COLOR_F color;\n\tID2D1SolidColorBrush *brush;\n\tD2D1_RECT_F rect;\n\tconst struct rect *cr;\n\tint cc = 0;\n\tD2D1_ANTIALIAS_MODE curaa, newaa;\n\tHRESULT hr;\n\n\trt->BeginDraw();\n\n\tcref = GetSysColor(COLOR_BTNFACE);\n\tcolor.r = ((double) GetRValue(cref)) \/ 255;\n\tcolor.g = ((double) GetGValue(cref)) \/ 255;\n\tcolor.b = ((double) GetBValue(cref)) \/ 255;\n\tcolor.a = 1.0;\n\trt->Clear(&color);\n\n\tcuraa = rt->GetAntialiasMode();\n\tnewaa = D2D1_ANTIALIAS_MODE_ALIASED;\n\tif (SendMessageW(antialias, BM_GETCHECK, 0, 0) != BST_UNCHECKED)\n\t\tnewaa = D2D1_ANTIALIAS_MODE_PER_PRIMITIVE;\n\trt->SetAntialiasMode(newaa);\n\n\tcr = rectList[SendMessageW(chooser, CB_GETCURSEL, 0, 0)].rects;\n\twhile (cr->x < 50) {\n\t\tcolor.r = fillcolors[cc].r;\n\t\tcolor.g = fillcolors[cc].g;\n\t\tcolor.b = fillcolors[cc].b;\n\t\tcolor.a = fillcolors[cc].a;\n\t\thr = rt->CreateSolidColorBrush(&color, NULL, &brush);\n\t\tif (hr != S_OK) {\n\t\t\tloghr(\"CreateSolidColorBrush()\", hr);\n\t\t\trt->SetAntialiasMode(curaa);\n\t\t\trt->EndDraw(NULL, NULL);\n\t\t\treturn hr;\n\t\t}\n\n\t\trect.left = cr->x;\n\t\trect.top = cr->y;\n\t\trect.right = cr->x + cr->width;\n\t\trect.bottom = cr->y + cr->height;\n\t\trt->FillRectangle(&rect, brush);\n\n\t\tbrush->Release();\n\t\tcr++;\n\t\tif (SendMessageW(sameColor, BM_GETCHECK, 0, 0) == BST_UNCHECKED)\n\t\t\tcc = (cc + 1) % 4;\n\t}\n\n\trt->SetAntialiasMode(curaa);\n\thr = rt->EndDraw(NULL, NULL);\n\tif (hr != S_OK && hr != D2DERR_RECREATE_TARGET)\n\t\tloghr(\"EndDraw()\", hr);\n\treturn hr;\n}\n\nID2D1HwndRenderTarget *mkRenderTarget(HWND hwnd)\n{\n\tD2D1_RENDER_TARGET_PROPERTIES props;\n\tD2D1_HWND_RENDER_TARGET_PROPERTIES hprops;\n\tHDC dc;\n\tRECT r;\n\tID2D1HwndRenderTarget *rt;\n\tHRESULT hr;\n\n\tdc = GetDC(hwnd);\n\tZeroMemory(&props, sizeof (D2D1_RENDER_TARGET_PROPERTIES));\n\tprops.type = D2D1_RENDER_TARGET_TYPE_DEFAULT;\n\tprops.pixelFormat.format = DXGI_FORMAT_UNKNOWN;\n\tprops.pixelFormat.alphaMode = D2D1_ALPHA_MODE_UNKNOWN;\n\tprops.dpiX = GetDeviceCaps(dc, LOGPIXELSX);\n\tprops.dpiY = GetDeviceCaps(dc, LOGPIXELSY);\n\tprops.usage = D2D1_RENDER_TARGET_USAGE_NONE;\n\tprops.minLevel = D2D1_FEATURE_LEVEL_DEFAULT;\n\tReleaseDC(hwnd, dc);\n\n\tGetClientRect(hwnd, &r);\n\tZeroMemory(&hprops, sizeof (D2D1_HWND_RENDER_TARGET_PROPERTIES));\n\thprops.hwnd = hwnd;\n\thprops.pixelSize.width = r.right - r.left;\n\thprops.pixelSize.height = r.bottom - r.top;\n\t\/\/ according to Rick Brewster, some drivers will misbehave if we don't specify this (see http:\/\/stackoverflow.com\/a\/33222983\/3408572)\n\thprops.presentOptions = D2D1_PRESENT_OPTIONS_RETAIN_CONTENTS;\n\n\thr = d2dfactory->CreateHwndRenderTarget(\n\t\t&props,\n\t\t&hprops,\n\t\t&rt);\n\tif (hr != S_OK) {\n\t\tloghr(\"CreateHwndRenderTarget()\", hr);\n\t\treturn NULL;\n\t}\n\treturn rt;\n}\n\nLRESULT CALLBACK rawndproc(HWND hwnd, UINT uMsg, WPARAM wParam, LPARAM lParam)\n{\n\tLONG_PTR userdata;\n\tID2D1HwndRenderTarget *rt = NULL;\n\tWINDOWPOS *wp = (WINDOWPOS *) lParam;\n\tRECT client;\n\tD2D1_SIZE_U size;\n\n\tuserdata = GetWindowLongPtrW(hwnd, GWLP_USERDATA);\n\tif (userdata == 0) {\n\t\tif (uMsg == WM_CREATE)\n\t\t\tSetWindowLongPtrW(hwnd, GWLP_USERDATA, 1);\n\t\treturn DefWindowProcW(hwnd, uMsg, wParam, lParam);\n\t}\n\n\tif (userdata == 1) {\n\t\trt = mkRenderTarget(hwnd);\n\t\tif (rt == NULL) {\n\t\t\tPostQuitMessage(1);\n\t\t\treturn DefWindowProcW(hwnd, uMsg, wParam, lParam);\n\t\t}\n\t\tSetWindowLongPtrW(hwnd, GWLP_USERDATA, (LONG_PTR) rt);\n\t} else\n\t\trt = (ID2D1HwndRenderTarget *) userdata;\n\n\tswitch (uMsg) {\n\tcase WM_PAINT:\n\t\tswitch (doPaint(rt)) {\n\t\tcase S_OK:\n\t\t\tValidateRect(hwnd, NULL);\n\t\t\treturn 0;\n\t\tcase D2DERR_RECREATE_TARGET:\n\t\t\trt->Release();\n\t\t\tSetWindowLongPtrW(hwnd, GWLP_USERDATA, 1);\n\t\t\treturn 0;\n\t\t}\n\t\trt->Release();\n\t\tPostQuitMessage(1);\n\t\tbreak;\n\tcase WM_WINDOWPOSCHANGED:\n\t\tif ((wp->flags & SWP_NOSIZE) != 0)\n\t\t\tbreak;\n\t\tGetClientRect(hwnd, &client);\n\t\tsize.width = client.right - client.left;\n\t\tsize.height = client.bottom - client.top;\n\t\trt->Resize(&size);\n\t\tInvalidateRect(hwnd, NULL, TRUE);\n\t\treturn 0;\n\tcase WM_DESTROY:\n\t\trt->Release();\n\t\tSetWindowLongPtrW(hwnd, GWLP_USERDATA, 0);\n\t}\n\treturn DefWindowProcW(hwnd, uMsg, wParam, lParam);\n}\n\nLRESULT CALLBACK wndproc(HWND hwnd, UINT uMsg, WPARAM wParam, LPARAM lParam)\n{\n\tHWND hc;\n\n\tswitch (uMsg) {\n\tcase WM_COMMAND:\n\t\t\/\/ TODO make this more specific?\n\t\thc = (HWND) lParam;\n\t\tif (hc == chooser || hc == antialias || hc == sameColor)\n\t\t\tInvalidateRect(ra, NULL, TRUE);\n\t\tbreak;\n\tcase WM_CLOSE:\n\t\tPostQuitMessage(0);\n\t}\n\treturn DefWindowProcW(hwnd, uMsg, wParam, lParam);\n}\n\nint main(int argc, char *argv[])\n{\n\tD2D1_FACTORY_OPTIONS opts;\n\tWNDCLASSW wc;\n\tRECT r;\n\tHWND mainwin;\n\tCOMBOBOXINFO cbi;\n\tint i;\n\tMSG msg;\n\tHRESULT hr;\n\n\tCoInitialize(NULL);\n\tZeroMemory(&opts, sizeof (D2D1_FACTORY_OPTIONS));\n\topts.debugLevel = D2D1_DEBUG_LEVEL_NONE;\n\thr = D2D1CreateFactory(D2D1_FACTORY_TYPE_SINGLE_THREADED,\n\t\tIID_ID2D1Factory,\n\t\t&opts,\n\t\t(void **) (&d2dfactory));\n\tif (hr != S_OK) {\n\t\tloghr(\"D2D1CreateFactory()\", hr);\n\t\treturn 1;\n\t}\n\n\tZeroMemory(&wc, sizeof (WNDCLASSW));\n\twc.lpszClassName = L\"mainwin\";\n\twc.lpfnWndProc = wndproc;\n\twc.hbrBackground = (HBRUSH) (COLOR_BTNFACE + 1);\n\tRegisterClassW(&wc);\n\tZeroMemory(&wc, sizeof (WNDCLASSW));\n\twc.lpszClassName = L\"rectArea\";\n\twc.lpfnWndProc = rawndproc;\n\twc.hbrBackground = (HBRUSH) (COLOR_BTNFACE + 1);\n\tRegisterClassW(&wc);\n\n\tr.left = 0;\n\tr.top = 0;\n\tr.right = 640;\n\tr.bottom = 480;\n\tAdjustWindowRectEx(&r,\n\t\tWS_OVERLAPPEDWINDOW,\n\t\tFALSE,\n\t\t0);\n\tmainwin = CreateWindowExW(0,\n\t\tL\"mainwin\", L\"mainwin\",\n\t\tWS_OVERLAPPEDWINDOW,\n\t\tCW_USEDEFAULT, CW_USEDEFAULT,\n\t\tr.right - r.left, r.bottom - r.top,\n\t\tNULL, NULL, NULL, NULL);\n\n\t\/\/ convert to client\n\tr.right = 640;\n\tr.bottom = 480;\n\t\/\/ and set everything up\n\tr.left = 7;\n\tr.right -= 7;\n\tr.top = 7;\n\tchooser = CreateWindowExW(0,\n\t\tL\"COMBOBOX\", L\"\",\n\t\tWS_CHILD | WS_VISIBLE | CBS_DROPDOWNLIST,\n\t\tr.left, r.top,\n\t\tr.right - r.left, 150,\n\t\tmainwin, (HMENU) 100, NULL, NULL);\n\tZeroMemory(&cbi, sizeof (COMBOBOXINFO));\n\tcbi.cbSize = sizeof (COMBOBOXINFO);\n\tSendMessageW(chooser, CB_GETCOMBOBOXINFO, 0, (LPARAM) (&cbi));\n\t\/\/ this I figured out is right (or at least seems to be right) on my own\n\tGetWindowRect(cbi.hwndCombo, &(cbi.rcItem));\n\tr.top += (cbi.rcItem.bottom - cbi.rcItem.top);\n\n\tantialias = CreateWindowExW(0,\n\t\tL\"BUTTON\", L\"Antialias\",\n\t\tWS_CHILD | WS_VISIBLE | BS_AUTOCHECKBOX,\n\t\tr.left, r.top,\n\t\t(r.right - r.left) \/ 2, 15,\n\t\tmainwin, (HMENU) 101, NULL, NULL);\n\tSendMessageW(antialias, BM_SETCHECK, BST_CHECKED, 0);\n\n\tsameColor = CreateWindowExW(0,\n\t\tL\"BUTTON\", L\"Same Color\",\n\t\tWS_CHILD | WS_VISIBLE | BS_AUTOCHECKBOX,\n\t\tr.left + (r.right - r.left) \/ 2, r.top,\n\t\t(r.right - r.left) \/ 2, 15,\n\t\tmainwin, (HMENU) 102, NULL, NULL);\n\tSendMessageW(sameColor, BM_SETCHECK, BST_UNCHECKED, 0);\n\tr.top += 15;\n\n\tr.top += 4;\n\tr.bottom -= 7;\n\tra = CreateWindowExW(0,\n\t\tL\"rectArea\", L\"\",\n\t\tWS_CHILD | WS_VISIBLE,\n\t\tr.left, r.top,\n\t\tr.right - r.left, r.bottom - r.top,\n\t\tmainwin, (HMENU) 103, NULL, NULL);\n\n\tfor (i = 0; rectList[i].name != NULL; i++)\n\t\tSendMessageW(chooser, CB_ADDSTRING, 0, (LPARAM) (rectList[i].name));\n\tSendMessageW(chooser, CB_SETCURSEL, 0, 0);\n\n\tShowWindow(mainwin, SW_SHOWDEFAULT);\n\tUpdateWindow(mainwin);\n\n\twhile (GetMessageW(&msg, NULL, 0, 0)) {\n\t\tTranslateMessage(&msg);\n\t\tDispatchMessageW(&msg);\n\t}\n\n\td2dfactory->Release();\n\tCoUninitialize();\n\treturn msg.wParam;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2013 Jeff Epler <jepler@unpythonic.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 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#include <stdlib.h>\n\n\/* Size of certain arrays *\/\n#define ACTIVE_G_CODES 16\n#define ACTIVE_M_CODES 10\n#define ACTIVE_SETTINGS 3\n\nclass InterpBase {\npublic:\n    virtual ~InterpBase();\n    virtual char *error_text(int errcode, char *buf, size_t buflen) = 0;\n    virtual char *line_text(char *buf, size_t buflen) = 0;\n    virtual char *file_name(char *buf, size_t buflen) = 0;\n    virtual char *stack_name(int index, char *buf, size_t buflen) = 0;\n    virtual size_t line_length() = 0;\n    virtual int sequence_number() = 0;\n    virtual int ini_load(const char *inifile) = 0;\n    virtual int init() = 0;\n    virtual int execute() = 0;\n    virtual int execute(const char *line) = 0;\n    virtual int execute(const char *line, int line_number) = 0;\n    virtual int synch() = 0;\n    virtual int exit() = 0;\n    virtual int open(const char *filename) = 0;\n    virtual int read() = 0;\n    virtual int read(const char *line) = 0;\n    virtual int close() = 0;\n    virtual int reset() = 0;\n    virtual int line() = 0;\n    virtual int call_level() = 0;\n    virtual char *command(char *buf, size_t buflen) = 0;\n    virtual char *file(char *buf, size_t buflen) = 0;\n    virtual int on_abort(int reason, const char *message) = 0;\n    virtual void active_g_codes(int active_gcodes[ACTIVE_G_CODES]) = 0;\n    virtual void active_m_codes(int active_mcodes[ACTIVE_M_CODES]) = 0;\n    virtual void active_settings(double active_settings[ACTIVE_SETTINGS]) = 0;\n    virtual void set_loglevel(int level) = 0;\n};\n\nInterpBase *interp_from_shlib(const char *shlib);\nextern \"C\" InterpBase *makeInterp();\n<commit_msg>interp: explicitly make Interp{,Base} noncopyable<commit_after>\/*\n * Copyright (C) 2013 Jeff Epler <jepler@unpythonic.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 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#include <stdlib.h>\n#include <boost\/noncopyable.hpp>\n\n\/* Size of certain arrays *\/\n#define ACTIVE_G_CODES 16\n#define ACTIVE_M_CODES 10\n#define ACTIVE_SETTINGS 3\n\nclass InterpBase : boost::noncopyable {\npublic:\n    virtual ~InterpBase();\n    virtual char *error_text(int errcode, char *buf, size_t buflen) = 0;\n    virtual char *line_text(char *buf, size_t buflen) = 0;\n    virtual char *file_name(char *buf, size_t buflen) = 0;\n    virtual char *stack_name(int index, char *buf, size_t buflen) = 0;\n    virtual size_t line_length() = 0;\n    virtual int sequence_number() = 0;\n    virtual int ini_load(const char *inifile) = 0;\n    virtual int init() = 0;\n    virtual int execute() = 0;\n    virtual int execute(const char *line) = 0;\n    virtual int execute(const char *line, int line_number) = 0;\n    virtual int synch() = 0;\n    virtual int exit() = 0;\n    virtual int open(const char *filename) = 0;\n    virtual int read() = 0;\n    virtual int read(const char *line) = 0;\n    virtual int close() = 0;\n    virtual int reset() = 0;\n    virtual int line() = 0;\n    virtual int call_level() = 0;\n    virtual char *command(char *buf, size_t buflen) = 0;\n    virtual char *file(char *buf, size_t buflen) = 0;\n    virtual int on_abort(int reason, const char *message) = 0;\n    virtual void active_g_codes(int active_gcodes[ACTIVE_G_CODES]) = 0;\n    virtual void active_m_codes(int active_mcodes[ACTIVE_M_CODES]) = 0;\n    virtual void active_settings(double active_settings[ACTIVE_SETTINGS]) = 0;\n    virtual void set_loglevel(int level) = 0;\n};\n\nInterpBase *interp_from_shlib(const char *shlib);\nextern \"C\" InterpBase *makeInterp();\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * Copyright (c) 2016 zScale Technology GmbH <legal@zscale.io>\n * Authors:\n *   - Paul Asmuth <paul@zscale.io>\n *   - Laura Schlimmer <laura@zscale.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 <eventql\/eventql.h>\n#include <eventql\/util\/stdtypes.h>\n#include <eventql\/util\/application.h>\n#include <eventql\/util\/cli\/flagparser.h>\n#include <eventql\/util\/csv\/BinaryCSVOutputStream.h>\n#include <eventql\/util\/http\/httpclient.h>\n#include <eventql\/util\/json\/jsonoutputstream.h>\n#include \"eventql\/util\/thread\/FixedSizeThreadPool.h\"\n#include \"eventql\/util\/util\/SimpleRateLimit.h\"\n#include <eventql\/util\/mysql\/MySQL.h>\n#include <eventql\/util\/mysql\/MySQLConnection.h>\n\nusing namespace eventql;\n\nstruct UploadShard {\n  Buffer data;\n  size_t nrows;\n};\n\nbool run(const cli::FlagParser& flags) {\n  auto source_table = flags.getString(\"source_table\");\n  auto destination_table = flags.getString(\"destination_table\");\n  auto shard_size = flags.getInt(\"shard_size\");\n  auto num_upload_threads = flags.getInt(\"upload_threads\");\n  auto mysql_addr = flags.getString(\"mysql\");\n  auto host = flags.getString(\"host\");\n  auto port = flags.getInt(\"port\");\n  auto db = flags.getString(\"database\");\n  auto max_retries = flags.getInt(\"max_retries\");\n\n  logInfo(\"mysql2evql\", \"Connecting to MySQL Server...\");\n\n  util::mysql::mysqlInit();\n  auto mysql_conn = util::mysql::MySQLConnection::openConnection(URI(mysql_addr));\n\n  logInfo(\n      \"mysql2evql\",\n      \"Analyzing the input table. This might take a few minutes...\");\n\n  auto schema = mysql_conn->getTableSchema(source_table);\n  logDebug(\"mysql2evql\", \"Table Schema:\\n$0\", schema->toString());\n  Vector<String> column_names;\n  for (const auto& field : schema->fields()) {\n    column_names.emplace_back(field.name);\n  }\n\n  \/* status line *\/\n  std::atomic<size_t> num_rows_uploaded(0);\n  util::SimpleRateLimitedFn status_line(kMicrosPerSecond, [&] () {\n    logInfo(\n        \"mysql2evql\",\n        \"Uploading... $0 rows\",\n        num_rows_uploaded.load());\n  });\n\n  \/* start upload threads *\/\n  http::HTTPMessage::HeaderList auth_headers;\n  if (flags.isSet(\"auth_token\")) {\n    auth_headers.emplace_back(\n        \"Authorization\",\n        StringUtil::format(\"Token $0\", flags.getString(\"auth_token\")));\n  \/\/} else if (!cfg_.getPassword().isEmpty()) {\n  \/\/  auth_headers.emplace_back(\n  \/\/      \"Authorization\",\n  \/\/      StringUtil::format(\"Basic $0\",\n  \/\/          util::Base64::encode(\n  \/\/              cfg_.getUser() + \":\" + cfg_.getPassword().get())));\n  }\n\n  auto insert_uri = StringUtil::format(\n      \"http:\/\/$0:$1\/api\/v1\/tables\/insert\",\n      host,\n      port);\n\n  bool upload_done = false;\n  bool upload_error = false;\n  thread::Queue<UploadShard> upload_queue(1);\n  Vector<std::thread> upload_threads(num_upload_threads);\n  for (size_t i = 0; i < num_upload_threads; ++i) {\n    upload_threads[i] = std::thread([&] {\n      while (!upload_done) {\n        auto shard = upload_queue.interruptiblePop();\n        if (shard.isEmpty()) {\n          continue;\n        }\n\n        bool success = false;\n        for (size_t retry = 0; retry < max_retries; ++retry) {\n          sleep(2 * retry);\n        \n          logDebug(\n              \"mysql2evql\",\n              \"Uploading batch; target=$0:$1 size=$2MB\",\n              host,\n              port,\n              shard.get().data.size() \/ 1000000.0);\n\n          try {\n            http::HTTPClient http_client;\n            auto upload_res = http_client.executeRequest(\n                http::HTTPRequest::mkPost(\n                    insert_uri,\n                    \"[\" + shard.get().data.toString() + \"]\",\n                    auth_headers));\n\n            if (upload_res.statusCode() != 201) {\n              status_code = upload_res.statusCode();\n              logError(\n                  \"mysql2evql\", \"[FATAL ERROR]: HTTP Status Code $0 $1\",\n                  upload_res.statusCode(),\n                  upload_res.body().toString());\n                  \n              if (status_code == 403) {\n                break;\n              } else {\n                continue;\n              }\n            }\n\n            num_rows_uploaded += shard.get().nrows;\n            status_line.runMaybe();\n            success = true;\n            break;\n          } catch (const std::exception& e) {\n            logError(\"mysql2evql\", e, \"error while uploading table data\");\n          }\n        }\n        \n        if (!sucess) {\n          upload_error = true;\n        }\n      }\n    });\n  }\n\n  \/* fetch rows from mysql *\/\n  UploadShard shard;\n  shard.nrows = 0;\n  json::JSONOutputStream json(BufferOutputStream::fromBuffer(&shard.data));\n\n  String where_expr;\n  if (flags.isSet(\"filter\")) {\n    where_expr = \"WHERE \" + flags.getString(\"filter\");\n  }\n\n  auto get_rows_qry = StringUtil::format(\n      \"SELECT * FROM `$0` $1;\",\n     source_table,\n     where_expr);\n\n  mysql_conn->executeQuery(\n      get_rows_qry,\n      [&] (const Vector<String>& column_values) -> bool {\n    ++shard.nrows;\n\n    if (shard.nrows > 1) {\n      json.addComma();\n    }\n\n    json.beginObject();\n    json.addObjectEntry(\"database\");\n    json.addString(db);\n    json.addComma();\n    json.addObjectEntry(\"table\");\n    json.addString(destination_table);\n    json.addComma();\n    json.addObjectEntry(\"data\");\n    json.beginObject();\n\n    for (size_t i = 0; i < column_names.size() && i < column_values.size(); ++i) {\n      if (i > 0 ){\n        json.addComma();\n      }\n\n      json.addObjectEntry(column_names[i]);\n      json.addString(column_values[i]);\n    }\n\n    json.endObject();\n    json.endObject();\n\n    if (shard.nrows == shard_size) {\n      upload_queue.insert(shard, true);\n      shard.data.clear();\n      shard.nrows = 0;\n    }\n\n    status_line.runMaybe();\n    return !upload_error;\n  });\n\n  if (shard.nrows > 0) {\n    upload_queue.insert(shard, true);\n  }\n\n  upload_queue.waitUntilEmpty();\n  upload_done = true;\n  upload_queue.wakeup();\n  for (auto& t : upload_threads) {\n    t.join();\n  }\n\n  status_line.runForce();\n\n  if (upload_error) {\n    logInfo(\"mysql2evql\", \"Upload finished with errors\");\n    return false;\n  } else {\n    logInfo(\"mysql2evql\", \"Upload finished successfully :)\");\n    return true;\n  }\n}\n\nint main(int argc, const char** argv) {\n  Application::init();\n  Application::logToStderr(\"mysql2evql\");\n\n  cli::FlagParser flags;\n\n  flags.defineFlag(\n      \"loglevel\",\n      cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      \"INFO\",\n      \"loglevel\",\n      \"<level>\");\n\n  flags.defineFlag(\n      \"source_table\",\n      cli::FlagParser::T_STRING,\n      true,\n      \"t\",\n      NULL,\n      \"table name\",\n      \"<name>\");\n\n  flags.defineFlag(\n      \"destination_table\",\n      cli::FlagParser::T_STRING,\n      true,\n      \"t\",\n      NULL,\n      \"table name\",\n      \"<name>\");\n\n  flags.defineFlag(\n      \"host\",\n      cli::FlagParser::T_STRING,\n      true,\n      \"h\",\n      NULL,\n      \"eventql server hostname\",\n      \"<host>\");\n\n  flags.defineFlag(\n      \"port\",\n      cli::FlagParser::T_INTEGER,\n      true,\n      \"p\",\n      NULL,\n      \"eventql server port\",\n      \"<port>\");\n\n  flags.defineFlag(\n      \"database\",\n      cli::FlagParser::T_STRING,\n      true,\n      \"db\",\n      \"\",\n      \"eventql database\",\n      \"<database>\");\n\n  flags.defineFlag(\n      \"auth_token\",\n      cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"auth token\",\n      \"<token>\");\n\n  flags.defineFlag(\n      \"mysql\",\n      cli::FlagParser::T_STRING,\n      true,\n      \"x\",\n      \"mysql:\/\/localhost:3306\/mydb?user=root\",\n      \"MySQL connection string\",\n      \"<url>\");\n\n  flags.defineFlag(\n      \"filter\",\n      cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"boolean sql expression\",\n      \"<sql_expr>\");\n\n\n  flags.defineFlag(\n      \"shard_size\",\n      cli::FlagParser::T_INTEGER,\n      false,\n      NULL,\n      \"128\",\n      \"shard size\",\n      \"<num>\");\n\n  flags.defineFlag(\n      \"upload_threads\",\n      cli::FlagParser::T_INTEGER,\n      false,\n      NULL,\n      \"8\",\n      \"concurrent uploads\",\n      \"<num>\");\n\n  flags.defineFlag(\n      \"max_retries\",\n      cli::FlagParser::T_INTEGER,\n      false,\n      NULL,\n      \"20\",\n      \"max number of upload retries\",\n      \"<num>\");\n\n  try {\n    flags.parseArgv(argc, argv);\n  } catch (const StandardException& e) {\n    logError(\"mysql2evql\", \"$0\", e.what());\n    auto stdout_os = OutputStream::getStdout();\n    flags.printUsage(stdout_os.get());\n    return 0;\n  }\n\n  Logger::get()->setMinimumLogLevel(\n      strToLogLevel(flags.getString(\"loglevel\")));\n\n  try {\n    if (run(flags)) {\n      return 0;\n    } else {\n      return 1;\n    }\n  } catch (const StandardException& e) {\n    logFatal(\"mysql2evql\", \"$0\", e.what());\n    return 1;\n  }\n}\n<commit_msg>fixes<commit_after>\/**\n * Copyright (c) 2016 zScale Technology GmbH <legal@zscale.io>\n * Authors:\n *   - Paul Asmuth <paul@zscale.io>\n *   - Laura Schlimmer <laura@zscale.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 <eventql\/eventql.h>\n#include <eventql\/util\/stdtypes.h>\n#include <eventql\/util\/application.h>\n#include <eventql\/util\/cli\/flagparser.h>\n#include <eventql\/util\/csv\/BinaryCSVOutputStream.h>\n#include <eventql\/util\/http\/httpclient.h>\n#include <eventql\/util\/json\/jsonoutputstream.h>\n#include \"eventql\/util\/thread\/FixedSizeThreadPool.h\"\n#include \"eventql\/util\/util\/SimpleRateLimit.h\"\n#include <eventql\/util\/mysql\/MySQL.h>\n#include <eventql\/util\/mysql\/MySQLConnection.h>\n#include <unistd.h>\n\nusing namespace eventql;\n\nstruct UploadShard {\n  Buffer data;\n  size_t nrows;\n};\n\nbool run(const cli::FlagParser& flags) {\n  auto source_table = flags.getString(\"source_table\");\n  auto destination_table = flags.getString(\"destination_table\");\n  auto shard_size = flags.getInt(\"shard_size\");\n  auto num_upload_threads = flags.getInt(\"upload_threads\");\n  auto mysql_addr = flags.getString(\"mysql\");\n  auto host = flags.getString(\"host\");\n  auto port = flags.getInt(\"port\");\n  auto db = flags.getString(\"database\");\n  auto max_retries = flags.getInt(\"max_retries\");\n\n  logInfo(\"mysql2evql\", \"Connecting to MySQL Server...\");\n\n  util::mysql::mysqlInit();\n  auto mysql_conn = util::mysql::MySQLConnection::openConnection(URI(mysql_addr));\n\n  logInfo(\n      \"mysql2evql\",\n      \"Analyzing the input table. This might take a few minutes...\");\n\n  auto schema = mysql_conn->getTableSchema(source_table);\n  logDebug(\"mysql2evql\", \"Table Schema:\\n$0\", schema->toString());\n  Vector<String> column_names;\n  for (const auto& field : schema->fields()) {\n    column_names.emplace_back(field.name);\n  }\n\n  \/* status line *\/\n  std::atomic<size_t> num_rows_uploaded(0);\n  util::SimpleRateLimitedFn status_line(kMicrosPerSecond, [&] () {\n    logInfo(\n        \"mysql2evql\",\n        \"Uploading... $0 rows\",\n        num_rows_uploaded.load());\n  });\n\n  \/* start upload threads *\/\n  http::HTTPMessage::HeaderList auth_headers;\n  if (flags.isSet(\"auth_token\")) {\n    auth_headers.emplace_back(\n        \"Authorization\",\n        StringUtil::format(\"Token $0\", flags.getString(\"auth_token\")));\n  \/\/} else if (!cfg_.getPassword().isEmpty()) {\n  \/\/  auth_headers.emplace_back(\n  \/\/      \"Authorization\",\n  \/\/      StringUtil::format(\"Basic $0\",\n  \/\/          util::Base64::encode(\n  \/\/              cfg_.getUser() + \":\" + cfg_.getPassword().get())));\n  }\n\n  auto insert_uri = StringUtil::format(\n      \"http:\/\/$0:$1\/api\/v1\/tables\/insert\",\n      host,\n      port);\n\n  bool upload_done = false;\n  bool upload_error = false;\n  thread::Queue<UploadShard> upload_queue(1);\n  Vector<std::thread> upload_threads(num_upload_threads);\n  for (size_t i = 0; i < num_upload_threads; ++i) {\n    upload_threads[i] = std::thread([&] {\n      while (!upload_done) {\n        auto shard = upload_queue.interruptiblePop();\n        if (shard.isEmpty()) {\n          continue;\n        }\n\n        bool success = false;\n        for (size_t retry = 0; retry < max_retries; ++retry) {\n          sleep(2 * retry);\n        \n          logDebug(\n              \"mysql2evql\",\n              \"Uploading batch; target=$0:$1 size=$2MB\",\n              host,\n              port,\n              shard.get().data.size() \/ 1000000.0);\n\n          try {\n            http::HTTPClient http_client;\n            auto upload_res = http_client.executeRequest(\n                http::HTTPRequest::mkPost(\n                    insert_uri,\n                    \"[\" + shard.get().data.toString() + \"]\",\n                    auth_headers));\n\n            if (upload_res.statusCode() != 201) {\n              logError(\n                  \"mysql2evql\", \"[FATAL ERROR]: HTTP Status Code $0 $1\",\n                  upload_res.statusCode(),\n                  upload_res.body().toString());\n                  \n              if (upload_res.statusCode() == 403) {\n                break;\n              } else {\n                continue;\n              }\n            }\n\n            num_rows_uploaded += shard.get().nrows;\n            status_line.runMaybe();\n            success = true;\n            break;\n          } catch (const std::exception& e) {\n            logError(\"mysql2evql\", e, \"error while uploading table data\");\n          }\n        }\n        \n        if (!success) {\n          upload_error = true;\n        }\n      }\n    });\n  }\n\n  \/* fetch rows from mysql *\/\n  UploadShard shard;\n  shard.nrows = 0;\n  json::JSONOutputStream json(BufferOutputStream::fromBuffer(&shard.data));\n\n  String where_expr;\n  if (flags.isSet(\"filter\")) {\n    where_expr = \"WHERE \" + flags.getString(\"filter\");\n  }\n\n  auto get_rows_qry = StringUtil::format(\n      \"SELECT * FROM `$0` $1;\",\n     source_table,\n     where_expr);\n\n  mysql_conn->executeQuery(\n      get_rows_qry,\n      [&] (const Vector<String>& column_values) -> bool {\n    ++shard.nrows;\n\n    if (shard.nrows > 1) {\n      json.addComma();\n    }\n\n    json.beginObject();\n    json.addObjectEntry(\"database\");\n    json.addString(db);\n    json.addComma();\n    json.addObjectEntry(\"table\");\n    json.addString(destination_table);\n    json.addComma();\n    json.addObjectEntry(\"data\");\n    json.beginObject();\n\n    for (size_t i = 0; i < column_names.size() && i < column_values.size(); ++i) {\n      if (i > 0 ){\n        json.addComma();\n      }\n\n      json.addObjectEntry(column_names[i]);\n      json.addString(column_values[i]);\n    }\n\n    json.endObject();\n    json.endObject();\n\n    if (shard.nrows == shard_size) {\n      upload_queue.insert(shard, true);\n      shard.data.clear();\n      shard.nrows = 0;\n    }\n\n    status_line.runMaybe();\n    return !upload_error;\n  });\n\n  if (shard.nrows > 0) {\n    upload_queue.insert(shard, true);\n  }\n\n  upload_queue.waitUntilEmpty();\n  upload_done = true;\n  upload_queue.wakeup();\n  for (auto& t : upload_threads) {\n    t.join();\n  }\n\n  status_line.runForce();\n\n  if (upload_error) {\n    logInfo(\"mysql2evql\", \"Upload finished with errors\");\n    return false;\n  } else {\n    logInfo(\"mysql2evql\", \"Upload finished successfully :)\");\n    return true;\n  }\n}\n\nint main(int argc, const char** argv) {\n  Application::init();\n  Application::logToStderr(\"mysql2evql\");\n\n  cli::FlagParser flags;\n\n  flags.defineFlag(\n      \"loglevel\",\n      cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      \"INFO\",\n      \"loglevel\",\n      \"<level>\");\n\n  flags.defineFlag(\n      \"source_table\",\n      cli::FlagParser::T_STRING,\n      true,\n      \"t\",\n      NULL,\n      \"table name\",\n      \"<name>\");\n\n  flags.defineFlag(\n      \"destination_table\",\n      cli::FlagParser::T_STRING,\n      true,\n      \"t\",\n      NULL,\n      \"table name\",\n      \"<name>\");\n\n  flags.defineFlag(\n      \"host\",\n      cli::FlagParser::T_STRING,\n      true,\n      \"h\",\n      NULL,\n      \"eventql server hostname\",\n      \"<host>\");\n\n  flags.defineFlag(\n      \"port\",\n      cli::FlagParser::T_INTEGER,\n      true,\n      \"p\",\n      NULL,\n      \"eventql server port\",\n      \"<port>\");\n\n  flags.defineFlag(\n      \"database\",\n      cli::FlagParser::T_STRING,\n      true,\n      \"db\",\n      \"\",\n      \"eventql database\",\n      \"<database>\");\n\n  flags.defineFlag(\n      \"auth_token\",\n      cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"auth token\",\n      \"<token>\");\n\n  flags.defineFlag(\n      \"mysql\",\n      cli::FlagParser::T_STRING,\n      true,\n      \"x\",\n      \"mysql:\/\/localhost:3306\/mydb?user=root\",\n      \"MySQL connection string\",\n      \"<url>\");\n\n  flags.defineFlag(\n      \"filter\",\n      cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"boolean sql expression\",\n      \"<sql_expr>\");\n\n\n  flags.defineFlag(\n      \"shard_size\",\n      cli::FlagParser::T_INTEGER,\n      false,\n      NULL,\n      \"128\",\n      \"shard size\",\n      \"<num>\");\n\n  flags.defineFlag(\n      \"upload_threads\",\n      cli::FlagParser::T_INTEGER,\n      false,\n      NULL,\n      \"8\",\n      \"concurrent uploads\",\n      \"<num>\");\n\n  flags.defineFlag(\n      \"max_retries\",\n      cli::FlagParser::T_INTEGER,\n      false,\n      NULL,\n      \"20\",\n      \"max number of upload retries\",\n      \"<num>\");\n\n  try {\n    flags.parseArgv(argc, argv);\n  } catch (const StandardException& e) {\n    logError(\"mysql2evql\", \"$0\", e.what());\n    auto stdout_os = OutputStream::getStdout();\n    flags.printUsage(stdout_os.get());\n    return 0;\n  }\n\n  Logger::get()->setMinimumLogLevel(\n      strToLogLevel(flags.getString(\"loglevel\")));\n\n  try {\n    if (run(flags)) {\n      return 0;\n    } else {\n      return 1;\n    }\n  } catch (const StandardException& e) {\n    logFatal(\"mysql2evql\", \"$0\", e.what());\n    return 1;\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"..\/sigma.h\"\n\n#include \"..\/..\/test\/test_bitcoin.h\"\n\n#include <boost\/test\/unit_test.hpp>\n\n#include <vector>\n\nnamespace exodus {\n\nBOOST_FIXTURE_TEST_SUITE(exodus_sigma_tests, TestingSetup)\n\nBOOST_AUTO_TEST_CASE(private_key)\n{\n    SigmaPrivateKey key;\n\n    auto serial = key.GetSerial();\n    auto randomness = key.GetRandomness();\n\n    key.Generate();\n\n    BOOST_CHECK(key.IsValid());\n    BOOST_CHECK_NE(key.GetSerial(), serial);\n    BOOST_CHECK_NE(key.GetRandomness(), randomness);\n}\n\nBOOST_AUTO_TEST_CASE(private_key_hash)\n{\n    SigmaPrivateKey key1, key2;\n    std::hash<SigmaPrivateKey> hasher;\n\n    key1.Generate();\n    key2.Generate();\n\n    BOOST_CHECK_EQUAL(hasher(key1), hasher(key1));\n    BOOST_CHECK_NE(hasher(key1), hasher(key2));\n}\n\nBOOST_AUTO_TEST_CASE(public_key)\n{\n    SigmaPrivateKey priv;\n    SigmaPublicKey pub;\n\n    auto commit = pub.GetCommitment();\n\n    priv.Generate();\n    pub.Generate(priv);\n\n    BOOST_CHECK(pub.IsValid());\n    BOOST_CHECK_NE(pub.GetCommitment(), commit);\n\n    \/\/ Try a second time to see if we still get the same result.\n    commit = pub.GetCommitment();\n    pub.Generate(priv);\n\n    BOOST_CHECK_EQUAL(pub.GetCommitment(), commit);\n}\n\nBOOST_AUTO_TEST_CASE(public_key_hash)\n{\n    SigmaPrivateKey key1, key2;\n    std::hash<SigmaPublicKey> hasher;\n\n    key1.Generate();\n    key2.Generate();\n\n    BOOST_CHECK_EQUAL(hasher(SigmaPublicKey(key1)), hasher(SigmaPublicKey(key1)));\n    BOOST_CHECK_NE(hasher(SigmaPublicKey(key1)), hasher(SigmaPublicKey(key2)));\n}\n\nBOOST_AUTO_TEST_CASE(proof)\n{\n    \/\/ Create keys.\n    SigmaPrivateKey key1, key2, key3;\n\n    key1.Generate();\n    key2.Generate();\n    key3.Generate();\n\n    \/\/ Crete proof.\n    SigmaProof proof;\n    std::vector<SigmaPublicKey> pubs({\n        SigmaPublicKey(key1),\n        SigmaPublicKey(key2),\n        SigmaPublicKey(key3)\n    });\n\n    proof.Generate(key2, pubs.begin(), pubs.end());\n\n    BOOST_CHECK_EQUAL(proof.Verify(sigma::Params::get_default(), pubs.begin(), pubs.end()), true);\n    BOOST_CHECK_EQUAL(proof.Verify(sigma::Params::get_default(), pubs.begin(), pubs.end() - 1), false);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n} \/\/ namespace exodus\n<commit_msg>Add spending with large anonimity group size test<commit_after>#include \"..\/sigma.h\"\n\n#include \"..\/..\/test\/test_bitcoin.h\"\n\n#include <boost\/test\/unit_test.hpp>\n\n#include <vector>\n\nnamespace exodus {\n\nBOOST_FIXTURE_TEST_SUITE(exodus_sigma_tests, TestingSetup)\n\nBOOST_AUTO_TEST_CASE(private_key)\n{\n    SigmaPrivateKey key;\n\n    auto serial = key.GetSerial();\n    auto randomness = key.GetRandomness();\n\n    key.Generate();\n\n    BOOST_CHECK(key.IsValid());\n    BOOST_CHECK_NE(key.GetSerial(), serial);\n    BOOST_CHECK_NE(key.GetRandomness(), randomness);\n}\n\nBOOST_AUTO_TEST_CASE(private_key_hash)\n{\n    SigmaPrivateKey key1, key2;\n    std::hash<SigmaPrivateKey> hasher;\n\n    key1.Generate();\n    key2.Generate();\n\n    BOOST_CHECK_EQUAL(hasher(key1), hasher(key1));\n    BOOST_CHECK_NE(hasher(key1), hasher(key2));\n}\n\nBOOST_AUTO_TEST_CASE(public_key)\n{\n    SigmaPrivateKey priv;\n    SigmaPublicKey pub;\n\n    auto commit = pub.GetCommitment();\n\n    priv.Generate();\n    pub.Generate(priv);\n\n    BOOST_CHECK(pub.IsValid());\n    BOOST_CHECK_NE(pub.GetCommitment(), commit);\n\n    \/\/ Try a second time to see if we still get the same result.\n    commit = pub.GetCommitment();\n    pub.Generate(priv);\n\n    BOOST_CHECK_EQUAL(pub.GetCommitment(), commit);\n}\n\nBOOST_AUTO_TEST_CASE(public_key_hash)\n{\n    SigmaPrivateKey key1, key2;\n    std::hash<SigmaPublicKey> hasher;\n\n    key1.Generate();\n    key2.Generate();\n\n    BOOST_CHECK_EQUAL(hasher(SigmaPublicKey(key1)), hasher(SigmaPublicKey(key1)));\n    BOOST_CHECK_NE(hasher(SigmaPublicKey(key1)), hasher(SigmaPublicKey(key2)));\n}\n\nBOOST_AUTO_TEST_CASE(proof)\n{\n    \/\/ Create keys.\n    SigmaPrivateKey key1, key2, key3;\n\n    key1.Generate();\n    key2.Generate();\n    key3.Generate();\n\n    \/\/ Crete proof.\n    SigmaProof proof;\n    std::vector<SigmaPublicKey> pubs({\n        SigmaPublicKey(key1),\n        SigmaPublicKey(key2),\n        SigmaPublicKey(key3)\n    });\n\n    proof.Generate(key2, pubs.begin(), pubs.end());\n\n    BOOST_CHECK_EQUAL(proof.Verify(sigma::Params::get_default(), pubs.begin(), pubs.end()), true);\n    BOOST_CHECK_EQUAL(proof.Verify(sigma::Params::get_default(), pubs.begin(), pubs.end() - 1), false);\n}\n\nBOOST_AUTO_TEST_CASE(spend_with_large_anonimity_group)\n{\n    std::vector<SigmaPublicKey> pubs;\n\n    \/\/ 2 ^ 14 coins\n    int limit = 1 << 14;\n\n    \/\/ generate 2 ^ 14 + 1 coins\n    SigmaPrivateKey key;\n    for (int i = 0; i < limit + 1; i++) {\n        key.Generate();\n        pubs.push_back(SigmaPublicKey(key));\n    }\n\n    SigmaProof validProof, invalidProof;\n    validProof.Generate(key, pubs.begin() + 1, pubs.end()); \/\/ prove with 2 ^ 14 coins\n    invalidProof.Generate(key, pubs.begin(), pubs.end()); \/\/ prove with 2 ^ 14 + 1 coins\n\n    BOOST_CHECK_EQUAL(validProof.Verify(sigma::Params::get_default(), pubs.begin() + 1, pubs.end()), true);\n    BOOST_CHECK_EQUAL(invalidProof.Verify(sigma::Params::get_default(), pubs.begin(), pubs.end()), false);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n} \/\/ namespace exodus\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2015 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 \"GrDrawBatch.h\"\n\nGrDrawBatch::GrDrawBatch(uint32_t classID) : INHERITED(classID), fPipelineInstalled(false) { }\n\nGrDrawBatch::~GrDrawBatch() {\n    if (fPipelineInstalled) {\n        this->pipeline()->~GrPipeline();\n    }\n}\n\nvoid GrDrawBatch::getPipelineOptimizations(GrPipelineOptimizations* opt) const {\n    GrInitInvariantOutput color;\n    GrInitInvariantOutput coverage;\n    this->computePipelineOptimizations(&color, &coverage, &opt->fOverrides);\n    opt->fColorPOI.initUsingInvariantOutput(color);\n    opt->fCoveragePOI.initUsingInvariantOutput(coverage);\n}\n\nbool GrDrawBatch::installPipeline(const GrPipeline::CreateArgs& args) {\n    GrXPOverridesForBatch overrides;\n    void* location = fPipelineStorage.get();\n    if (!GrPipeline::CreateAt(location, args, &overrides)) {\n        return false;\n    }\n    this->initBatchTracker(overrides);\n    fPipelineInstalled = true;\n    return true;\n}\n<commit_msg>Fix assert accessing pipeline from initBatchTracker<commit_after>\/*\n * Copyright 2015 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 \"GrDrawBatch.h\"\n\nGrDrawBatch::GrDrawBatch(uint32_t classID) : INHERITED(classID), fPipelineInstalled(false) { }\n\nGrDrawBatch::~GrDrawBatch() {\n    if (fPipelineInstalled) {\n        this->pipeline()->~GrPipeline();\n    }\n}\n\nvoid GrDrawBatch::getPipelineOptimizations(GrPipelineOptimizations* opt) const {\n    GrInitInvariantOutput color;\n    GrInitInvariantOutput coverage;\n    this->computePipelineOptimizations(&color, &coverage, &opt->fOverrides);\n    opt->fColorPOI.initUsingInvariantOutput(color);\n    opt->fCoveragePOI.initUsingInvariantOutput(coverage);\n}\n\nbool GrDrawBatch::installPipeline(const GrPipeline::CreateArgs& args) {\n    GrXPOverridesForBatch overrides;\n    void* location = fPipelineStorage.get();\n    if (!GrPipeline::CreateAt(location, args, &overrides)) {\n        return false;\n    }\n    fPipelineInstalled = true;\n    this->initBatchTracker(overrides);\n    return true;\n}\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    commandsBuffer(GL_DRAW_INDIRECT_BUFFER)\n{\n  int customBufferCount = 1;\n  for (int customBufferIndex = 0; customBufferIndex < customBufferCount;\n       ++customBufferIndex)\n    customBuffers.push_back(ShaderBuffer(GL_SHADER_STORAGE_BUFFER));\n}\n\nObjectManager::~ObjectManager()\n{\n  qCInfo(omChan) << \"Destructor of ObjectManager\";\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  for (auto &customBuffer : customBuffers)\n    customBuffer.initialize(gl, 24 * 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,\n                    static_cast<int>(indices.size()), shaderProgramId,\n                    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\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->bindForHABuffer(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 = static_cast<uint>(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 = customBuffers[0].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    auto modelMatrix = objectData.modelMatrix;\n\n    \/\/ encode objectId into modelMatrix\n    int objectId = objectData.getId();\n    modelMatrix(3, 0) = *reinterpret_cast<float *>(&objectId);\n\n    memcpy(transform, modelMatrix.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    customBuffers[0].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    customBuffers[0].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>Start to handle multiple custom buffers in ObjectManager.<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    commandsBuffer(GL_DRAW_INDIRECT_BUFFER)\n{\n  int customBufferCount = 1;\n  for (int customBufferIndex = 0; customBufferIndex < customBufferCount;\n       ++customBufferIndex)\n    customBuffers.push_back(ShaderBuffer(GL_SHADER_STORAGE_BUFFER));\n}\n\nObjectManager::~ObjectManager()\n{\n  qCInfo(omChan) << \"Destructor of ObjectManager\";\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  for (auto &customBuffer : customBuffers)\n    customBuffer.initialize(gl, 24 * 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,\n                    static_cast<int>(indices.size()), shaderProgramId,\n                    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\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->bindForHABuffer(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 = static_cast<uint>(objects.size());\n  DrawElementsIndirectCommand *commands = commandsBuffer.reserve(objectCount);\n  auto *matrices = transformBuffer.reserve(objectCount);\n\n  int customBufferIndex = 0;\n  std::vector<void *> customBufferPointers;\n  std::vector<int> customBufferSizes;\n  for (auto &customBuffer : customBuffers)\n  {\n    int customBufferSize =\n        objects[0].getCustomBufferSize(customBufferIndex) * objectCount;\n\n    if (customBufferSize)\n    {\n      void *custom = customBuffer.reserve(customBufferSize);\n      qCDebug(omChan) << \"Index\" << customBufferIndex << \"customBufferSize\"\n                      << customBufferSize << \"custom\" << custom << \"matrices\"\n                      << matrices;\n      customBufferPointers.push_back(custom);\n      customBufferSizes.push_back(customBufferSize);\n    }\n\n    ++customBufferIndex;\n  }\n\n  int counter = 0;\n  for (auto &objectData : objects)\n  {\n    commands[counter] = createDrawCommand(objectData, counter);\n\n    auto *transform = &matrices[counter];\n    auto modelMatrix = objectData.modelMatrix;\n\n    \/\/ encode objectId into modelMatrix\n    int objectId = objectData.getId();\n    modelMatrix(3, 0) = *reinterpret_cast<float *>(&objectId);\n\n    memcpy(transform, modelMatrix.data(), sizeof(float[16]));\n\n    if (objectData.hasCustomBuffer())\n    {\n      for (size_t customBufferIndex = 0;\n           customBufferIndex < customBufferPointers.size(); ++customBufferIndex)\n        objectData.fillBufferElementFor(customBufferIndex,\n                                        customBufferPointers[customBufferIndex],\n                                        counter);\n    }\n\n    ++counter;\n  }\n\n  transformBuffer.bindBufferRange(0, objectCount);\n  for (size_t customBufferIndex = 0;\n       customBufferIndex < customBufferPointers.size(); ++customBufferIndex)\n  {\n    customBuffers[customBufferIndex].bindBufferRange(\n        1, customBufferSizes[customBufferIndex]);\n  }\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  for (size_t customBufferIndex = 0;\n       customBufferIndex < customBufferPointers.size(); ++customBufferIndex)\n  {\n    customBuffers[customBufferIndex].onUsageComplete(\n        customBufferSizes[customBufferIndex]);\n  }\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>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** Contact: Qt Software Information (qt-info@nokia.com)\n**\n** This file is part of the QtGui module of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the either Technology Preview License Agreement or the\n** Beta Release License Agreement.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain\n** additional rights. These rights are described in the Nokia Qt LGPL\n** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this\n** package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at qt-sales@nokia.com.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"qstylehelper_p.h\"\n\n#include <qstyleoption.h>\n#include <qpainter.h>\n#include <qpixmapcache.h>\n#include <private\/qmath_p.h>\n#include <private\/qstyle_p.h>\n#include <qmath.h>\n\nQT_BEGIN_NAMESPACE\n\nconst bool QStyleHelper::UsePixmapCache = true;\n\nQString QStyleHelper::uniqueName(const QString &key, const QStyleOption *option, const QSize &size)\n{\n    QString tmp;\n    const QStyleOptionComplex *complexOption = qstyleoption_cast<const QStyleOptionComplex *>(option);\n    tmp.sprintf(\"%s-%d-%d-%lld-%dx%d-%d\", key.toLatin1().constData(), uint(option->state),\n                complexOption ? uint(complexOption->activeSubControls) : uint(0),\n                option->palette.cacheKey(), size.width(), size.height(), option->direction);\n#ifndef QT_NO_SPINBOX\n    if (const QStyleOptionSpinBox *spinBox = qstyleoption_cast<const QStyleOptionSpinBox *>(option)) {\n        tmp.append(QLatin1Char('-'));\n        tmp.append(QString::number(spinBox->buttonSymbols));\n        tmp.append(QLatin1Char('-'));\n        tmp.append(QString::number(spinBox->stepEnabled));\n        tmp.append(QLatin1Char('-'));\n        tmp.append(QLatin1Char(spinBox->frame ? '1' : '0'));\n    }\n#endif \/\/ QT_NO_SPINBOX\n    return tmp;\n}\n\n#ifndef QT_NO_DIAL\n\nint QStyleHelper::calcBigLineSize(int radius)\n{\n    int bigLineSize = radius \/ 6;\n    if (bigLineSize < 4)\n        bigLineSize = 4;\n    if (bigLineSize > radius \/ 2)\n        bigLineSize = radius \/ 2;\n    return bigLineSize;\n}\n\nstatic QPointF calcRadialPos(const QStyleOptionSlider *dial, qreal offset)\n{\n    const int width = dial->rect.width();\n    const int height = dial->rect.height();\n    const int r = qMin(width, height) \/ 2;\n    const int currentSliderPosition = dial->upsideDown ? dial->sliderPosition : (dial->maximum - dial->sliderPosition);\n    qreal a = 0;\n    if (dial->maximum == dial->minimum)\n        a = Q_PI \/ 2;\n    else if (dial->dialWrapping)\n        a = Q_PI * 3 \/ 2 - (currentSliderPosition - dial->minimum) * 2 * Q_PI\n            \/ (dial->maximum - dial->minimum);\n    else\n        a = (Q_PI * 8 - (currentSliderPosition - dial->minimum) * 10 * Q_PI\n            \/ (dial->maximum - dial->minimum)) \/ 6;\n    qreal xc = width \/ 2.0;\n    qreal yc = height \/ 2.0;\n    qreal len = r - QStyleHelper::calcBigLineSize(r) - 3;\n    qreal back = offset * len;\n    QPointF pos(QPointF(xc + back * qCos(a), yc - back * qSin(a)));\n    return pos;\n}\n\nqreal QStyleHelper::angle(const QPointF &p1, const QPointF &p2)\n{\n    static const qreal rad_factor = 180 \/ Q_PI;\n    qreal _angle = 0;\n\n    if (p1.x() == p2.x()) {\n        if (p1.y() < p2.y())\n            _angle = 270;\n        else\n            _angle = 90;\n    } else  {\n        qreal x1, x2, y1, y2;\n\n        if (p1.x() <= p2.x()) {\n            x1 = p1.x(); y1 = p1.y();\n            x2 = p2.x(); y2 = p2.y();\n        } else {\n            x2 = p1.x(); y2 = p1.y();\n            x1 = p2.x(); y1 = p2.y();\n        }\n\n        qreal m = -(y2 - y1) \/ (x2 - x1);\n        _angle = atan(m) *  rad_factor;\n\n        if (p1.x() < p2.x())\n            _angle = 180 - _angle;\n        else\n            _angle = -_angle;\n    }\n    return _angle;\n}\n\nQPolygonF QStyleHelper::calcLines(const QStyleOptionSlider *dial)\n{\n    QPolygonF poly;\n    int width = dial->rect.width();\n    int height = dial->rect.height();\n    qreal r = qMin(width, height) \/ 2;\n    int bigLineSize = calcBigLineSize(int(r));\n\n    qreal xc = width \/ 2 + 0.5;\n    qreal yc = height \/ 2 + 0.5;\n    int ns = dial->tickInterval;\n    int notches = (dial->maximum + ns - 1 - dial->minimum) \/ ns;\n    if (notches <= 0)\n        return poly;\n    if (dial->maximum < dial->minimum || dial->maximum - dial->minimum > 1000) {\n        int maximum = dial->minimum + 1000;\n        notches = (maximum + ns - 1 - dial->minimum) \/ ns;\n    }\n\n    poly.resize(2 + 2 * notches);\n    int smallLineSize = bigLineSize \/ 2;\n    for (int i = 0; i <= notches; ++i) {\n        qreal angle = dial->dialWrapping ? Q_PI * 3 \/ 2 - i * 2 * Q_PI \/ notches\n                  : (Q_PI * 8 - i * 10 * Q_PI \/ notches) \/ 6;\n        qreal s = qSin(angle);\n        qreal c = qCos(angle);\n        if (i == 0 || (((ns * i) % (dial->pageStep ? dial->pageStep : 1)) == 0)) {\n            poly[2 * i] = QPointF(xc + (r - bigLineSize) * c,\n                                  yc - (r - bigLineSize) * s);\n            poly[2 * i + 1] = QPointF(xc + r * c, yc - r * s);\n        } else {\n            poly[2 * i] = QPointF(xc + (r - 1 - smallLineSize) * c,\n                                  yc - (r - 1 - smallLineSize) * s);\n            poly[2 * i + 1] = QPointF(xc + (r - 1) * c, yc -(r - 1) * s);\n        }\n    }\n    return poly;\n}\n\n\n\/\/ This will draw a nice and shiny QDial for us. We don't want\n\/\/ all the shinyness in QWindowsStyle, hence we place it here\n\nvoid QStyleHelper::drawDial(const QStyleOptionSlider *option, QPainter *painter)\n{\n    QPalette pal = option->palette;\n    QColor buttonColor = pal.button().color();\n    const int width = option->rect.width();\n    const int height = option->rect.height();\n    const bool enabled = option->state & QStyle::State_Enabled;\n    qreal r = qMin(width, height) \/ 2;\n    r -= r\/50;\n    const qreal penSize = r\/20.0;\n\n    painter->save();\n    painter->setRenderHint(QPainter::Antialiasing);\n\n    \/\/ Draw notches\n    if (option->subControls & QStyle::SC_DialTickmarks) {\n        painter->setPen(option->palette.dark().color().darker(120));\n        painter->drawLines(QStyleHelper::calcLines(option));\n    }\n\n    \/\/ Cache dial background\n    BEGIN_STYLE_PIXMAPCACHE(QString::fromLatin1(\"qdial\"));\n    p->setRenderHint(QPainter::Antialiasing);\n\n    const qreal d_ = r \/ 6;\n    const qreal dx = option->rect.x() + d_ + (width - 2 * r) \/ 2 + 1;\n    const qreal dy = option->rect.y() + d_ + (height - 2 * r) \/ 2 + 1;\n\n    QRectF br = QRectF(dx + 0.5, dy + 0.5,\n                       int(r * 2 - 2 * d_ - 2),\n                       int(r * 2 - 2 * d_ - 2));\n    buttonColor.setHsv(buttonColor .hue(),\n                       qMin(140, buttonColor .saturation()),\n                       qMax(180, buttonColor.value()));\n    QColor shadowColor(0, 0, 0, 20);\n\n    if (enabled) {\n        \/\/ Drop shadow\n        qreal shadowSize = qMax(1.0, penSize\/2.0);\n        QRectF shadowRect= br.adjusted(-2*shadowSize, -2*shadowSize,\n                                       2*shadowSize, 2*shadowSize);\n        QRadialGradient shadowGradient(shadowRect.center().x(),\n                                       shadowRect.center().y(), shadowRect.width()\/2.0,\n                                       shadowRect.center().x(), shadowRect.center().y());\n        shadowGradient.setColorAt(0.91, QColor(0, 0, 0, 40));\n        shadowGradient.setColorAt(1.0, Qt::transparent);\n        p->setBrush(shadowGradient);\n        p->setPen(Qt::NoPen);\n        p->translate(shadowSize, shadowSize);\n        p->drawEllipse(shadowRect);\n        p->translate(-shadowSize, -shadowSize);\n\n        \/\/ Main gradient\n        QRadialGradient gradient(br.center().x() - br.width()\/3, dy,\n                                 br.width()*1.3, br.center().x(),\n                                 br.center().y() - br.height()\/2);\n        gradient.setColorAt(0, buttonColor.lighter(110));\n        gradient.setColorAt(0.5, buttonColor);\n        gradient.setColorAt(0.501, buttonColor.darker(102));\n        gradient.setColorAt(1, buttonColor.darker(115));\n        p->setBrush(gradient);\n    } else {\n        p->setBrush(Qt::NoBrush);\n    }\n\n    p->setPen(QPen(buttonColor.darker(280)));\n    p->drawEllipse(br);\n    p->setBrush(Qt::NoBrush);\n    p->setPen(buttonColor.lighter(110));\n    p->drawEllipse(br.adjusted(1, 1, -1, -1));\n    if (option->state & QStyle::State_HasFocus) {\n        QColor highlight = pal.highlight().color();\n        highlight.setHsv(highlight.hue(),\n                         qMin(160, highlight.saturation()),\n                         qMax(230, highlight.value()));\n        highlight.setAlpha(127);\n        p->setPen(QPen(highlight, 2.0));\n        p->setBrush(Qt::NoBrush);\n        p->drawEllipse(br.adjusted(-1, -1, 1, 1));\n    }\n\n    END_STYLE_PIXMAPCACHE\n\n    QPointF dp = calcRadialPos(option, 0.70);\n    buttonColor = buttonColor.lighter(104);\n    buttonColor.setAlphaF(0.8);\n    const qreal ds = r\/7.0;\n    QRectF dialRect(dp.x() - ds, dp.y() - ds, 2*ds, 2*ds);\n    QRadialGradient dialGradient(dialRect.center().x() + dialRect.width()\/2,\n                                 dialRect.center().y() + dialRect.width(),\n                                 dialRect.width()*2,\n                                 dialRect.center().x(), dialRect.center().y());\n    dialGradient.setColorAt(1, buttonColor.darker(130));\n    dialGradient.setColorAt(0.201, buttonColor.darker(105));\n    dialGradient.setColorAt(0.2, buttonColor.darker(104));\n    dialGradient.setColorAt(0, buttonColor.darker(102));\n\n    painter->setBrush(dialGradient);\n    painter->setPen(QColor(255, 255, 255, 150));\n    painter->drawEllipse(dialRect.adjusted(-1, -1, 1, 1));\n    painter->setPen(QColor(0, 0, 0, 50));\n    painter->drawEllipse(dialRect);\n    if (penSize > 3.0) {\n        painter->setPen(QPen(QColor(0, 0, 0, 16), penSize\/2.0));\n        painter->drawLine(calcRadialPos(option, 0.95), calcRadialPos(option, 0.97));\n    }\n    painter->restore();\n}\n#endif \/\/QT_NO_DIAL\n\nQT_END_NAMESPACE\n<commit_msg>Visual tweaks on the new dial Increased contrast and size of indicator line. Reviewed-by: nrc<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** Contact: Qt Software Information (qt-info@nokia.com)\n**\n** This file is part of the QtGui module of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the either Technology Preview License Agreement or the\n** Beta Release License Agreement.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain\n** additional rights. These rights are described in the Nokia Qt LGPL\n** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this\n** package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at qt-sales@nokia.com.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"qstylehelper_p.h\"\n\n#include <qstyleoption.h>\n#include <qpainter.h>\n#include <qpixmapcache.h>\n#include <private\/qmath_p.h>\n#include <private\/qstyle_p.h>\n#include <qmath.h>\n\nQT_BEGIN_NAMESPACE\n\nconst bool QStyleHelper::UsePixmapCache = true;\n\nQString QStyleHelper::uniqueName(const QString &key, const QStyleOption *option, const QSize &size)\n{\n    QString tmp;\n    const QStyleOptionComplex *complexOption = qstyleoption_cast<const QStyleOptionComplex *>(option);\n    tmp.sprintf(\"%s-%d-%d-%lld-%dx%d-%d\", key.toLatin1().constData(), uint(option->state),\n                complexOption ? uint(complexOption->activeSubControls) : uint(0),\n                option->palette.cacheKey(), size.width(), size.height(), option->direction);\n#ifndef QT_NO_SPINBOX\n    if (const QStyleOptionSpinBox *spinBox = qstyleoption_cast<const QStyleOptionSpinBox *>(option)) {\n        tmp.append(QLatin1Char('-'));\n        tmp.append(QString::number(spinBox->buttonSymbols));\n        tmp.append(QLatin1Char('-'));\n        tmp.append(QString::number(spinBox->stepEnabled));\n        tmp.append(QLatin1Char('-'));\n        tmp.append(QLatin1Char(spinBox->frame ? '1' : '0'));\n    }\n#endif \/\/ QT_NO_SPINBOX\n    return tmp;\n}\n\n#ifndef QT_NO_DIAL\n\nint QStyleHelper::calcBigLineSize(int radius)\n{\n    int bigLineSize = radius \/ 6;\n    if (bigLineSize < 4)\n        bigLineSize = 4;\n    if (bigLineSize > radius \/ 2)\n        bigLineSize = radius \/ 2;\n    return bigLineSize;\n}\n\nstatic QPointF calcRadialPos(const QStyleOptionSlider *dial, qreal offset)\n{\n    const int width = dial->rect.width();\n    const int height = dial->rect.height();\n    const int r = qMin(width, height) \/ 2;\n    const int currentSliderPosition = dial->upsideDown ? dial->sliderPosition : (dial->maximum - dial->sliderPosition);\n    qreal a = 0;\n    if (dial->maximum == dial->minimum)\n        a = Q_PI \/ 2;\n    else if (dial->dialWrapping)\n        a = Q_PI * 3 \/ 2 - (currentSliderPosition - dial->minimum) * 2 * Q_PI\n            \/ (dial->maximum - dial->minimum);\n    else\n        a = (Q_PI * 8 - (currentSliderPosition - dial->minimum) * 10 * Q_PI\n            \/ (dial->maximum - dial->minimum)) \/ 6;\n    qreal xc = width \/ 2.0;\n    qreal yc = height \/ 2.0;\n    qreal len = r - QStyleHelper::calcBigLineSize(r) - 3;\n    qreal back = offset * len;\n    QPointF pos(QPointF(xc + back * qCos(a), yc - back * qSin(a)));\n    return pos;\n}\n\nqreal QStyleHelper::angle(const QPointF &p1, const QPointF &p2)\n{\n    static const qreal rad_factor = 180 \/ Q_PI;\n    qreal _angle = 0;\n\n    if (p1.x() == p2.x()) {\n        if (p1.y() < p2.y())\n            _angle = 270;\n        else\n            _angle = 90;\n    } else  {\n        qreal x1, x2, y1, y2;\n\n        if (p1.x() <= p2.x()) {\n            x1 = p1.x(); y1 = p1.y();\n            x2 = p2.x(); y2 = p2.y();\n        } else {\n            x2 = p1.x(); y2 = p1.y();\n            x1 = p2.x(); y1 = p2.y();\n        }\n\n        qreal m = -(y2 - y1) \/ (x2 - x1);\n        _angle = atan(m) *  rad_factor;\n\n        if (p1.x() < p2.x())\n            _angle = 180 - _angle;\n        else\n            _angle = -_angle;\n    }\n    return _angle;\n}\n\nQPolygonF QStyleHelper::calcLines(const QStyleOptionSlider *dial)\n{\n    QPolygonF poly;\n    int width = dial->rect.width();\n    int height = dial->rect.height();\n    qreal r = qMin(width, height) \/ 2;\n    int bigLineSize = calcBigLineSize(int(r));\n\n    qreal xc = width \/ 2 + 0.5;\n    qreal yc = height \/ 2 + 0.5;\n    int ns = dial->tickInterval;\n    int notches = (dial->maximum + ns - 1 - dial->minimum) \/ ns;\n    if (notches <= 0)\n        return poly;\n    if (dial->maximum < dial->minimum || dial->maximum - dial->minimum > 1000) {\n        int maximum = dial->minimum + 1000;\n        notches = (maximum + ns - 1 - dial->minimum) \/ ns;\n    }\n\n    poly.resize(2 + 2 * notches);\n    int smallLineSize = bigLineSize \/ 2;\n    for (int i = 0; i <= notches; ++i) {\n        qreal angle = dial->dialWrapping ? Q_PI * 3 \/ 2 - i * 2 * Q_PI \/ notches\n                  : (Q_PI * 8 - i * 10 * Q_PI \/ notches) \/ 6;\n        qreal s = qSin(angle);\n        qreal c = qCos(angle);\n        if (i == 0 || (((ns * i) % (dial->pageStep ? dial->pageStep : 1)) == 0)) {\n            poly[2 * i] = QPointF(xc + (r - bigLineSize) * c,\n                                  yc - (r - bigLineSize) * s);\n            poly[2 * i + 1] = QPointF(xc + r * c, yc - r * s);\n        } else {\n            poly[2 * i] = QPointF(xc + (r - 1 - smallLineSize) * c,\n                                  yc - (r - 1 - smallLineSize) * s);\n            poly[2 * i + 1] = QPointF(xc + (r - 1) * c, yc -(r - 1) * s);\n        }\n    }\n    return poly;\n}\n\n\n\/\/ This will draw a nice and shiny QDial for us. We don't want\n\/\/ all the shinyness in QWindowsStyle, hence we place it here\n\nvoid QStyleHelper::drawDial(const QStyleOptionSlider *option, QPainter *painter)\n{\n    QPalette pal = option->palette;\n    QColor buttonColor = pal.button().color();\n    const int width = option->rect.width();\n    const int height = option->rect.height();\n    const bool enabled = option->state & QStyle::State_Enabled;\n    qreal r = qMin(width, height) \/ 2;\n    r -= r\/50;\n    const qreal penSize = r\/20.0;\n\n    painter->save();\n    painter->setRenderHint(QPainter::Antialiasing);\n\n    \/\/ Draw notches\n    if (option->subControls & QStyle::SC_DialTickmarks) {\n        painter->setPen(option->palette.dark().color().darker(120));\n        painter->drawLines(QStyleHelper::calcLines(option));\n    }\n\n    \/\/ Cache dial background\n    BEGIN_STYLE_PIXMAPCACHE(QString::fromLatin1(\"qdial\"));\n    p->setRenderHint(QPainter::Antialiasing);\n\n    const qreal d_ = r \/ 6;\n    const qreal dx = option->rect.x() + d_ + (width - 2 * r) \/ 2 + 1;\n    const qreal dy = option->rect.y() + d_ + (height - 2 * r) \/ 2 + 1;\n\n    QRectF br = QRectF(dx + 0.5, dy + 0.5,\n                       int(r * 2 - 2 * d_ - 2),\n                       int(r * 2 - 2 * d_ - 2));\n    buttonColor.setHsv(buttonColor .hue(),\n                       qMin(140, buttonColor .saturation()),\n                       qMax(180, buttonColor.value()));\n    QColor shadowColor(0, 0, 0, 20);\n\n    if (enabled) {\n        \/\/ Drop shadow\n        qreal shadowSize = qMax(1.0, penSize\/2.0);\n        QRectF shadowRect= br.adjusted(-2*shadowSize, -2*shadowSize,\n                                       2*shadowSize, 2*shadowSize);\n        QRadialGradient shadowGradient(shadowRect.center().x(),\n                                       shadowRect.center().y(), shadowRect.width()\/2.0,\n                                       shadowRect.center().x(), shadowRect.center().y());\n        shadowGradient.setColorAt(0.91, QColor(0, 0, 0, 40));\n        shadowGradient.setColorAt(1.0, Qt::transparent);\n        p->setBrush(shadowGradient);\n        p->setPen(Qt::NoPen);\n        p->translate(shadowSize, shadowSize);\n        p->drawEllipse(shadowRect);\n        p->translate(-shadowSize, -shadowSize);\n\n        \/\/ Main gradient\n        QRadialGradient gradient(br.center().x() - br.width()\/3, dy,\n                                 br.width()*1.3, br.center().x(),\n                                 br.center().y() - br.height()\/2);\n        gradient.setColorAt(0, buttonColor.lighter(110));\n        gradient.setColorAt(0.5, buttonColor);\n        gradient.setColorAt(0.501, buttonColor.darker(102));\n        gradient.setColorAt(1, buttonColor.darker(115));\n        p->setBrush(gradient);\n    } else {\n        p->setBrush(Qt::NoBrush);\n    }\n\n    p->setPen(QPen(buttonColor.darker(280)));\n    p->drawEllipse(br);\n    p->setBrush(Qt::NoBrush);\n    p->setPen(buttonColor.lighter(110));\n    p->drawEllipse(br.adjusted(1, 1, -1, -1));\n\n    if (option->state & QStyle::State_HasFocus) {\n        QColor highlight = pal.highlight().color();\n        highlight.setHsv(highlight.hue(),\n                         qMin(160, highlight.saturation()),\n                         qMax(230, highlight.value()));\n        highlight.setAlpha(127);\n        p->setPen(QPen(highlight, 2.0));\n        p->setBrush(Qt::NoBrush);\n        p->drawEllipse(br.adjusted(-1, -1, 1, 1));\n    }\n\n    END_STYLE_PIXMAPCACHE\n\n    QPointF dp = calcRadialPos(option, 0.70);\n    buttonColor = buttonColor.lighter(104);\n    buttonColor.setAlphaF(0.8);\n    const qreal ds = r\/7.0;\n    QRectF dialRect(dp.x() - ds, dp.y() - ds, 2*ds, 2*ds);\n    QRadialGradient dialGradient(dialRect.center().x() + dialRect.width()\/2,\n                                 dialRect.center().y() + dialRect.width(),\n                                 dialRect.width()*2,\n                                 dialRect.center().x(), dialRect.center().y());\n    dialGradient.setColorAt(1, buttonColor.darker(140));\n    dialGradient.setColorAt(0.4, buttonColor.darker(120));\n    dialGradient.setColorAt(0, buttonColor.darker(110));\n    if (penSize > 3.0) {\n        painter->setPen(QPen(QColor(0, 0, 0, 25), penSize));\n        painter->drawLine(calcRadialPos(option, 0.90), calcRadialPos(option, 0.96));\n    }\n\n    painter->setBrush(dialGradient);\n    painter->setPen(QColor(255, 255, 255, 150));\n    painter->drawEllipse(dialRect.adjusted(-1, -1, 1, 1));\n    painter->setPen(QColor(0, 0, 0, 80));\n    painter->drawEllipse(dialRect);\n    painter->restore();\n}\n#endif \/\/QT_NO_DIAL\n\nQT_END_NAMESPACE\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\nModule:  getconfig_thisboard.cpp\n\nFunction:\n        Return a suitable LMIC config for this board.\n\nCopyright & License:\n        See accompanying LICENSE file.\n\nAuthor:\n        Terry Moore, MCCI       November 2018\n\n*\/\n\n#include <arduino_lmic_hal_boards.h>\n\nnamespace Arduino_LMIC {\n\nconst HalPinmap_t *GetPinmap_ThisBoard(void)\n        {\n#if defined(ARDUINO_SAMD_FEATHER_M0)\n# if defined(ARDUINO_MCCI_CATENA_4420)\n        \/\/ this uses a radiowing and an odd configuration\n        return GetPinmap_Catena4420();\n# else\n        \/\/ others use Feather M0 LoRa\n        return GetPinmap_FeatherM0LoRa();\n# endif\n#elif defined(ARDUINO_AVR_FEATHER32U4)\n        return GetPinmap_Feather32U4LoRa();\n#elif defined(ARDUINO_MCCI_CATENA_4551) || \\\n      \/* legacy names *\/ \\\n      defined(ARDUINO_CATENA_4551)\n        return GetPinmap_Catena4551();\n#elif defined(ARDUINO_MCCI_CATENA_4610)\n        return GetPinmap_Catena4610();\n#elif defined(ARDUINO_MCCI_CATENA_4611) || \\\n      \/* legacy names *\/ \\\n      defined(ARDUINO_CATENA_4611)\n        return GetPinmap_Catena4611();\n#elif defined(ARDUINO_MCCI_CATENA_4612) || \\\n      \/* legacy names *\/ \\\n      defined(ARDUINO_CATENA_4612)\n        return GetPinmap_Catena4612();\n#elif defined(ARDUINO_MCCI_CATENA_4801)\n        return GetPinmap_Catena4801();\n#elif defined(PINNOCHIO_SCOUT)\n        return GetPinmap_PinnochioScount();\n#else\n        #warning Board not supported -- use an explicit pinmap\n        return nullptr;\n#endif\n        }\n\n}; \/\/ namespace Arduino_LMIC\n\n<commit_msg>Update getpinmap_thisboard.cpp<commit_after>\/*\n\nModule:  getconfig_thisboard.cpp\n\nFunction:\n        Return a suitable LMIC config for this board.\n\nCopyright & License:\n        See accompanying LICENSE file.\n\nAuthor:\n        Terry Moore, MCCI       November 2018\n\n*\/\n\n#include <arduino_lmic_hal_boards.h>\n\nnamespace Arduino_LMIC {\n\nconst HalPinmap_t *GetPinmap_ThisBoard(void)\n        {\n#if defined(ARDUINO_SAMD_FEATHER_M0)\n# if defined(ARDUINO_MCCI_CATENA_4420)\n        \/\/ this uses a radiowing and an odd configuration\n        return GetPinmap_Catena4420();\n# else\n        \/\/ others use Feather M0 LoRa\n        return GetPinmap_FeatherM0LoRa();\n# endif\n#elif defined(ARDUINO_AVR_FEATHER32U4)\n        return GetPinmap_Feather32U4LoRa();\n#elif defined(ARDUINO_MCCI_CATENA_4551) || \\\n      \/* legacy names *\/ \\\n      defined(ARDUINO_CATENA_4551)\n        return GetPinmap_Catena4551();\n#elif defined(ARDUINO_MCCI_CATENA_4610)\n        return GetPinmap_Catena4610();\n#elif defined(ARDUINO_MCCI_CATENA_4611) || \\\n      \/* legacy names *\/ \\\n      defined(ARDUINO_CATENA_4611)\n        return GetPinmap_Catena4611();\n#elif defined(ARDUINO_MCCI_CATENA_4612) || \\\n      \/* legacy names *\/ \\\n      defined(ARDUINO_CATENA_4612)\n        return GetPinmap_Catena4612();\n#elif defined(ARDUINO_MCCI_CATENA_4801)\n        return GetPinmap_Catena4801();\n#elif defined(PINNOCHIO_SCOUT)\n        return GetPinmap_PinnochioScount();\n#else\n        #pragma message(\"Board not supported -- use an explicit pinmap\")\n        return nullptr;\n#endif\n        }\n\n}; \/\/ namespace Arduino_LMIC\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"stdafx.h\"\n\n#include \"..\/liblazyloader\/Image.h\"\n#include \"..\/liblazyloader\/ImageCollection.h\"\n#include \"..\/liblazyloader\/GdiPlus.h\"\n\n\nBOOST_AUTO_TEST_SUITE(Check_class_CImage)\nCGdiPlus gdiInit;\nBOOST_AUTO_TEST_CASE(constructor_wchar)\n{\n\tBOOST_CHECK_NO_THROW(lload::CImage(L\".\/images\/0.png\"));\n}\n\nBOOST_AUTO_TEST_CASE(copy_constructor)\n{\n\tlload::CImage original(L\".\/images\/0.png\");\n\tlload::CImage copy(original);\n\tBOOST_CHECK_EQUAL(original.GetFileName().c_str(), copy.GetFileName().c_str());\n\tBOOST_CHECK_EQUAL(original.GetBitmap().GetWidth(), copy.GetBitmap().GetWidth());\n\tBOOST_CHECK_EQUAL(original.GetBitmap().GetHeight(), copy.GetBitmap().GetWidth());\n\tBOOST_CHECK_EQUAL(original.GetBitmap().GetPixelFormat(), copy.GetBitmap().GetPixelFormat());\n\tBOOST_CHECK(std::addressof(original.GetBitmap()) != std::addressof(copy.GetBitmap()));\n}\n\nBOOST_AUTO_TEST_CASE(move_constructor)\n{\n\tlload::CImage original(L\".\/images\/0.png\");\n\tlload::CImage copy(original);\n\n\tlload::CImage move(std::move(original));\n\n\tBOOST_CHECK_EQUAL(move.GetFileName().c_str(), copy.GetFileName().c_str());\n\tBOOST_CHECK_EQUAL(move.GetBitmap().GetWidth(), copy.GetBitmap().GetWidth());\n\tBOOST_CHECK_EQUAL(move.GetBitmap().GetHeight(), copy.GetBitmap().GetWidth());\n\tBOOST_CHECK_EQUAL(move.GetBitmap().GetPixelFormat(), copy.GetBitmap().GetPixelFormat());\n}\n\nBOOST_AUTO_TEST_CASE(check_image_resize)\n{\n\tlload::CImage image(L\".\/images\/0.png\");\n\n\n\tauto width = image.GetBitmap().GetWidth();\n\tauto height = image.GetBitmap().GetHeight();\n\n\timage.Resize(100);\n\tBOOST_CHECK(width != image.GetBitmap().GetWidth());\n\tBOOST_CHECK(height != image.GetBitmap().GetHeight());\n\n\timage.Resize(100);\n\tBOOST_CHECK(100 == image.GetBitmap().GetWidth());\n\tBOOST_CHECK(100 == image.GetBitmap().GetHeight());\n}\n\nBOOST_AUTO_TEST_CASE(check_get_file_name)\n{\n\tlload::CImage image(L\".\/images\/0.png\");\n\tBOOST_CHECK_EQUAL(image.GetFileName().c_str(), L\".\/images\/0.png\");\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n\nBOOST_AUTO_TEST_SUITE(Check_class_CImageCollection)\nCGdiPlus gdiInit;\nBOOST_AUTO_TEST_CASE(collection_constructor)\n{\n\tBOOST_CHECK_NO_THROW(lload::CImageCollection({ L\".\/images\/0.png\" }));\n\tstd::vector<std::wstring> vec({ L\".\/images\/0.png\" });\n\tBOOST_CHECK_NO_THROW(lload::CImageCollection(vec.begin(), vec.end()));\n}\n\nBOOST_AUTO_TEST_SUITE_END()<commit_msg>Добавлены тесты к методу CImageCollection.GetImage<commit_after>#include \"stdafx.h\"\n\n#include \"..\/liblazyloader\/Image.h\"\n#include \"..\/liblazyloader\/ImageCollection.h\"\n#include \"..\/liblazyloader\/GdiPlus.h\"\n\n\nBOOST_AUTO_TEST_SUITE(Check_class_CImage)\nCGdiPlus gdiInit;\nBOOST_AUTO_TEST_CASE(constructor_wchar)\n{\n\tBOOST_CHECK_NO_THROW(lload::CImage(L\".\/images\/0.png\"));\n}\n\nBOOST_AUTO_TEST_CASE(copy_constructor)\n{\n\tlload::CImage original(L\".\/images\/0.png\");\n\tlload::CImage copy(original);\n\tBOOST_CHECK_EQUAL(original.GetFileName().c_str(), copy.GetFileName().c_str());\n\tBOOST_CHECK_EQUAL(original.GetBitmap().GetWidth(), copy.GetBitmap().GetWidth());\n\tBOOST_CHECK_EQUAL(original.GetBitmap().GetHeight(), copy.GetBitmap().GetWidth());\n\tBOOST_CHECK_EQUAL(original.GetBitmap().GetPixelFormat(), copy.GetBitmap().GetPixelFormat());\n\tBOOST_CHECK(std::addressof(original.GetBitmap()) != std::addressof(copy.GetBitmap()));\n}\n\nBOOST_AUTO_TEST_CASE(move_constructor)\n{\n\tlload::CImage original(L\".\/images\/0.png\");\n\tlload::CImage copy(original);\n\n\tlload::CImage move(std::move(original));\n\n\tBOOST_CHECK_EQUAL(move.GetFileName().c_str(), copy.GetFileName().c_str());\n\tBOOST_CHECK_EQUAL(move.GetBitmap().GetWidth(), copy.GetBitmap().GetWidth());\n\tBOOST_CHECK_EQUAL(move.GetBitmap().GetHeight(), copy.GetBitmap().GetWidth());\n\tBOOST_CHECK_EQUAL(move.GetBitmap().GetPixelFormat(), copy.GetBitmap().GetPixelFormat());\n}\n\nBOOST_AUTO_TEST_CASE(check_image_resize)\n{\n\tlload::CImage image(L\".\/images\/0.png\");\n\n\n\tauto width = image.GetBitmap().GetWidth();\n\tauto height = image.GetBitmap().GetHeight();\n\n\timage.Resize(100);\n\tBOOST_CHECK(width != image.GetBitmap().GetWidth());\n\tBOOST_CHECK(height != image.GetBitmap().GetHeight());\n\n\timage.Resize(100);\n\tBOOST_CHECK(100 == image.GetBitmap().GetWidth());\n\tBOOST_CHECK(100 == image.GetBitmap().GetHeight());\n}\n\nBOOST_AUTO_TEST_CASE(check_get_file_name)\n{\n\tlload::CImage image(L\".\/images\/0.png\");\n\tBOOST_CHECK_EQUAL(image.GetFileName().c_str(), L\".\/images\/0.png\");\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\n\nBOOST_AUTO_TEST_SUITE(Check_class_CImageCollection)\nCGdiPlus gdiInit;\nBOOST_AUTO_TEST_CASE(collection_constructor)\n{\n\tBOOST_CHECK_NO_THROW(lload::CImageCollection({ L\".\/images\/0.png\" }));\n\tstd::vector<std::wstring> vec({ L\".\/images\/0.png\" });\n\tBOOST_CHECK_NO_THROW(lload::CImageCollection(vec.begin(), vec.end()));\n}\n\nBOOST_AUTO_TEST_CASE(get_image)\n{\n\tlload::CImageCollection imageCollection({ L\".\/images\/0.png\" });\n\tBOOST_CHECK_EQUAL(imageCollection.GetImage(0).GetFileName().c_str(), L\".\/images\/0.png\");\n}\n\nBOOST_AUTO_TEST_SUITE_END()<|endoftext|>"}
{"text":"<commit_before>\/*\n *\n * Author: Jeffrey Leung\n * Last edited: 2015-12-28\n *\n * This C++ header file contains the LabyrinthMap class which creates, updates,\n * and displays a map of a given Labyrinth.\n *\n *\/\n\n#include <cstring>\n#include <iostream>\n#include <stdexcept>\n\n#include \"..\/include\/room_properties.hpp\"\n#include \"..\/include\/labyrinth.hpp\"\n#include \"..\/include\/labyrinth_map.hpp\"\n\n\/\/ This method returns whether a given Wall coordinate has a wall in the\n\/\/ given direction.\n\/\/ An exception is thrown if:\n\/\/   d is kNone (invalid_argument)\nbool LabyrinthMapCoordinateBorder::IsWall( Direction d ) const\n{\n  switch( d )\n  {\n    case Direction::kNorth:\n      return wall_north_;\n    case Direction::kEast:\n      return wall_east_;\n    case Direction::kSouth:\n      return wall_south_;\n    case Direction::kWest:\n      return wall_west_;\n    default:\n      throw std::invalid_argument( \"Error: IsWall() was given an invalid \" \\\n        \"direction (kNone).\\n\" );\n  }\n}\n\n\/\/ This method creates the Wall of a given Wall coordinate.\n\/\/ May be used to set a Wall which has already been set.\n\/\/ An exception is thrown if:\n\/\/   d is kNone (invalid_argument)\nvoid LabyrinthMapCoordinateBorder::RemoveWall( Direction d )\n{\n  switch( d )\n  {\n    case Direction::kNorth:\n      wall_north_ = false;\n      return;\n    case Direction::kEast:\n      wall_east_ = false;\n      return;\n    case Direction::kSouth:\n      wall_south_ = false;\n      return;\n    case Direction::kWest:\n      wall_west_ = false;\n      return;\n    default:\n      throw std::invalid_argument( \"Error: SetWall() was given an invalid \"\\\n        \"direction (kNone).\\n\" );\n  }\n  return;\n}\n\n\/\/ This method returns whether a given Wall coordinate has the exit.\nbool LabyrinthMapCoordinateBorder::IsExit() const\n{\n  return exit_;\n}\n\n\/\/ This method sets whether or not a given Wall coordinate has the exit.\n\/\/ May be used to set an exit where the exit already exists, or to remove\n\/\/ an exit where none exists.\nvoid LabyrinthMapCoordinateBorder::SetExit( bool b )\n{\n  exit_ = b;\n}\n\n\/\/ This method returns the inhabitant of the current Room.\nInhabitant LabyrinthMapCoordinateRoom::HasInhabitant() const\n{\n  return i_;\n}\n\n\/\/ This method sets the current inhabitant of the map's Room.\n\/\/ May be used to set the inhabitant to the same inhabitant, or to\n\/\/ no inhabitant.\nvoid LabyrinthMapCoordinateRoom::SetInhabitant( Inhabitant inh )\n{\n  i_ = inh;\n}\n\n\/\/ This method returns whether the treasure is in a given Room.\nbool LabyrinthMapCoordinateRoom::HasTreasure() const\n{\n  return treasure_;\n}\n\n\/\/ This method sets whether or not the treasure is in the given map's Room.\n\/\/ May be used to set the treasure when there is already a treasure in\n\/\/ the Room, or to remove the treasure when there is no treasure already.\nvoid LabyrinthMapCoordinateRoom::SetTreasure( bool b )\n{\n  treasure_ = b;\n}\n\n\/\/ Parameterized constructor\n\/\/ An exception is thrown if:\n\/\/   l is null (invalid_argument)\nLabyrinthMap::LabyrinthMap( Labyrinth* l,\n                            unsigned int x_size,\n                            unsigned int y_size )\n{\n  if( l == nullptr )\n  {\n    throw std::invalid_argument( \"Error: LabyrinthMap() was given an \"\\\n      \"invalid (null) pointer for the Labyrinth.\\n\" );\n  }\n\n  l_ = l;\n  x_size_ = x_size;\n  y_size_ = y_size;\n\n  map_x_size_ = x_size * 2 + 1;\n  map_y_size_ = y_size * 2 + 1;\n\n  \/\/ Creation of the map array\n  map_ = new LabyrinthMapCoordinate**[ map_y_size_ ];\n  Coordinate c;\n  for( unsigned int y = 0; y < map_y_size_; ++y )\n  {\n    map_[y] = new LabyrinthMapCoordinate*[ map_x_size_ ];\n    for( unsigned int x = 0; x < map_x_size_; ++x )\n    {\n      c.x = x;\n      c.y = y;\n      if( IsRoom(c) )\n      {\n        map_[y][x] = new LabyrinthMapCoordinateRoom;\n      }\n      else\n      {\n        map_[y][x] = new LabyrinthMapCoordinateBorder;\n      }\n    }\n  }\n\n  \/\/ Removing excess bounds on the exterior of the Labyrinth\n  for( unsigned int x = 0; x < map_x_size_; ++x )\n  {\n    map_[0][x]->RemoveWall( Direction::kNorth );\n    map_[map_y_size_-1][x]->RemoveWall( Direction::kSouth );\n  }\n  for( unsigned int y = 0; y < map_y_size_; ++y )\n  {\n    map_[y][0]->RemoveWall( Direction::kWest );\n    map_[y][map_x_size_-1]->RemoveWall( Direction::kEast );\n  }\n\n  \/\/ Sets the Borders to emulate the Labyrinth\n  Coordinate c_laby;\n  Coordinate c_map;\n  Coordinate c_mapborder_remove;\n  RoomBorder rb;\n  \/\/ Loops through the labyrinth\n  for( unsigned int y = 0; y < y_size_; ++y )\n  {\n    for( unsigned int x = 0; x < x_size_; ++y )\n    {\n      c_laby.x = x;\n      c_laby.y = y;\n      c_map = c_laby;\n      try\n      {\n        LabyrinthToMap(c_map);\n      }\n      catch( const std::exception& e )\n      {\n        std::cout << e.what();\n      }\n\n      \/\/ Removes the east border of the relevant Map coordinate if necessary\n      try\n      {\n        rb = l_->DirectionCheck(c_laby, Direction::kEast);\n      }\n      catch( const std::exception& e )\n      {\n        std::cout << e.what();\n      }\n      if( rb == RoomBorder::kRoom )\n      {\n        c_mapborder_remove = c_map;\n        (c_mapborder_remove.x)++;\n\n        (c_mapborder_remove.y)--;\n        (MapCoordinateAt(c_mapborder_remove)).RemoveWall( Direction::kSouth );\n\n        (c_mapborder_remove.y)++;\n        (MapCoordinateAt(c_mapborder_remove)).RemoveWall( Direction::kNorth );\n        (MapCoordinateAt(c_mapborder_remove)).RemoveWall( Direction::kSouth );\n\n        (c_mapborder_remove.y)++;\n        (MapCoordinateAt(c_mapborder_remove)).RemoveWall( Direction::kNorth );\n      }\n\n      \/\/ Removes the south border of the relevant Map coordinate if necessary\n      try\n      {\n        rb = l_->DirectionCheck(c_laby, Direction::kSouth);\n      }\n      catch( const std::exception& e )\n      {\n        std::cout << e.what();\n      }\n      if( rb == RoomBorder::kRoom )\n      {\n        c_mapborder_remove = c_map;\n        (c_mapborder_remove.y)++;\n\n        (c_mapborder_remove.x)--;\n        (MapCoordinateAt(c_mapborder_remove)).RemoveWall( Direction::kEast );\n\n        (c_mapborder_remove.x)++;\n        (MapCoordinateAt(c_mapborder_remove)).RemoveWall( Direction::kWest );\n        (MapCoordinateAt(c_mapborder_remove)).RemoveWall( Direction::kEast );\n\n        (c_mapborder_remove.x)++;\n        (MapCoordinateAt(c_mapborder_remove)).RemoveWall( Direction::kWest );\n      }\n    }\n  }\n\n  \/\/Update();  \/\/TODO Uncomment when Update() is implemented\n}\n\n\/\/ Destructor\nLabyrinthMap::~LabyrinthMap()\n{\n  for( unsigned int y = 0; y < map_y_size_; ++y )\n  {\n    for( unsigned int x = 0; x < map_x_size_; ++x )\n    {\n      delete map_[y][x];\n    }\n    delete [] map_[y];\n  }\n  delete [] map_;\n}\n\n\/\/ This method displays a map of the current Labyrinth.\nvoid LabyrinthMap::Display()\n{\n  Coordinate c;\n  for( unsigned int y = 0; y < map_y_size_; ++y )\n  {\n    for( unsigned int x = 0; x < map_x_size_; ++x )\n    {\n      c.x = x;\n      c.y = y;\n      if( IsRoom(c) )\n      {\n        std::cout << \" \";\n      }\n      else\n      {\n        std::cout << DisplayBorder(c);\n      }\n    }\n    std::cout << std::endl;\n  }\n\n  return;\n}\n\n\/\/ This private method returns true if the Coordinate is within the bounds\n\/\/ of the Map, and false otherwise.\nbool LabyrinthMap::WithinBoundsOfMap( const Coordinate c ) const\n{\n  return ( c.x < map_x_size_ &&\n           c.y < map_y_size_ );\n}\n\n\/\/ This private method returns true if the Coordinate designates a Room\n\/\/ in the map, and false if it designates a Border.\n\/\/ An exception is thrown if:\n\/\/   The Coordinate is outside of the Map (domain_error)\nbool LabyrinthMap::IsRoom( const Coordinate c ) const\n{\n  if( WithinBoundsOfMap(c) )\n  {\n    return c.x % 2 == 1 && c.y % 2 == 1;\n  }\n  else\n  {\n    throw std::domain_error( \"Error: IsRoom() was given a Coordinate \"\\\n      \"outside of the Map.\\n\" );\n  }\n}\n\n\/\/ This private method returns a reference to the Map Coordinate at\n\/\/ the given Coordinate.\n\/\/ An exception is thrown if:\n\/\/   The Coordinate is outside of the Map (domain_error)\nLabyrinthMapCoordinate&\nLabyrinthMap::MapCoordinateAt( const Coordinate c ) const\n{\n  if( !WithinBoundsOfMap(c) )\n  {\n    throw std::domain_error( \"Error: MapCoordinateAt() was given a \"\\\n      \"Coordinate outside of the Map.\\n\" );\n  }\n\n  return *(map_[c.y][c.x]);\n}\n\n\/\/ This private method converts a Labyrinth Coordinate to the same\n\/\/ location in the Map.\n\/\/ An exception is thrown if:\n\/\/   The Coordinate is outside of the Labyrinth (invalid_argument)\nvoid LabyrinthMap::LabyrinthToMap( Coordinate c ) const\n{\n  if( c.x < x_size_ &&\n      c.y < y_size_ )\n  {\n    c.x = c.x * 2 + 1;\n    c.y = c.y * 2 + 1;\n  }\n  else\n  {\n    throw std::invalid_argument( \"Error: LabyrinthToMap() was given a \"\\\n      \"Coordinate outside of the Labyrinth.\\n\" );\n  }\n}\n\n\/\/ This private method converts a Map Room Coordinate to the same\n\/\/ Room in the Labyrinth.\n\/\/ An exception is thrown if:\n\/\/   The Coordinate is outside of the Labyrinth (domain_error)\n\/\/   The Coordinate designates a border (logic_error)\nvoid LabyrinthMap::MapToLabyrinth( Coordinate c ) const\n{\n  if( !WithinBoundsOfMap(c) )\n  {\n    throw std::domain_error( \"Error: MapToLabyrinth() was given a \"\\\n      \"Coordinate outside of the LabyrinthMap.\\n\" );\n  }\n  else if( !IsRoom(c) )\n  {\n    throw std::logic_error( \"Error: MapToLabyrinth() was given a \"\\\n      \"Coordinate designating a Border, not a Room.\\n\" );\n  }\n  else\n  {\n    c.x = (c.x - 1) \/ 2;\n    c.y = (c.y - 1) \/ 2;\n  }\n}\n\n\/\/ This private method returns a character representing the given\n\/\/ Border Coordinate.\n\/\/ An exception is thrown if:\n\/\/   The Coordinate is outside of the Labyrinth (domain_error)\n\/\/   The Coordinate designates a Room (logic_error)\nstd::string LabyrinthMap::DisplayBorder( const Coordinate c ) const\n{\n  if( !WithinBoundsOfMap(c) )\n  {\n    throw std::domain_error( \"Error: DisplayBorder() was given an invalid \"\\\n      \"Coordinate.\\n\" );\n  }\n  else if( IsRoom(c) )\n  {\n    throw std::logic_error( \"Error: DisplayBorder() was given a \"\\\n      \"Room Coordinate.\\n\" );\n  }\n\n  RoomBorder rb_n;\n  RoomBorder rb_e;\n  RoomBorder rb_s;\n  RoomBorder rb_w;\n\n  try\n  {\n    MapToLabyrinth( c );\n    rb_n = l_->DirectionCheck( c, Direction::kNorth );\n    rb_e = l_->DirectionCheck( c, Direction::kEast );\n    rb_s = l_->DirectionCheck( c, Direction::kSouth );\n    rb_w = l_->DirectionCheck( c, Direction::kWest );\n  }\n  catch( std::exception& e )\n  {\n    std::cout << e.what();\n  }\n\n  char borders_nesw[5] = \"0000\";\n\n  if( rb_n != RoomBorder::kRoom )\n  {\n    borders_nesw[0] = '1';\n  }\n  if( rb_e != RoomBorder::kRoom )\n  {\n    borders_nesw[1] = '1';\n  }\n  if( rb_s != RoomBorder::kRoom )\n  {\n    borders_nesw[2] = '1';\n  }\n  if( rb_w != RoomBorder::kRoom )\n  {\n    borders_nesw[3] = '1';\n  }\n\n  \/\/ A true abomination lies ahead.\n  \/\/ Please let me know if you have any alternative ideas so I can put this\n  \/\/ out of its misery.\n  \/\/\n  \/\/ Characters taken from the Unicode section of:\n  \/\/ https:\/\/en.wikipedia.org\/wiki\/Box-drawing_character\n\n  if( strcmp(borders_nesw, \"0000\") ) return \" \";\n\n  else if( strcmp(borders_nesw, \"1000\") ) return u8\"╵\";\n  else if( strcmp(borders_nesw, \"0100\") ) return u8\"╶\";\n  else if( strcmp(borders_nesw, \"0010\") ) return u8\"╷\";\n  else if( strcmp(borders_nesw, \"0001\") ) return u8\"╴\";\n\n  else if( strcmp(borders_nesw, \"1100\") ) return u8\"└\";\n  else if( strcmp(borders_nesw, \"1010\") ) return u8\"│\";\n  else if( strcmp(borders_nesw, \"1001\") ) return u8\"┘\";\n  else if( strcmp(borders_nesw, \"0110\") ) return u8\"┌\";\n  else if( strcmp(borders_nesw, \"0101\") ) return u8\"─\";\n  else if( strcmp(borders_nesw, \"0011\") ) return u8\"┐\";\n\n  else if( strcmp(borders_nesw, \"1110\") ) return u8\"├\";\n  else if( strcmp(borders_nesw, \"1101\") ) return u8\"┴\";\n  else if( strcmp(borders_nesw, \"1011\") ) return u8\"┤\";\n  else if( strcmp(borders_nesw, \"0111\") ) return u8\"┬\";\n\n  else if( strcmp(borders_nesw, \"1111\") ) return u8\"┼\";\n\n  else\n  {\n    throw std::logic_error( \"Error: DisplayBorder()'s check for \"\\\n      \"NESW values missed a possible value.\\n\" );\n  }\n}\n\/\/TODO Implementation of labyrinth_map.hpp\n<commit_msg>Map Constructor: Fixing wrong increment in for loop.<commit_after>\/*\n *\n * Author: Jeffrey Leung\n * Last edited: 2015-12-28\n *\n * This C++ header file contains the LabyrinthMap class which creates, updates,\n * and displays a map of a given Labyrinth.\n *\n *\/\n\n#include <cstring>\n#include <iostream>\n#include <stdexcept>\n\n#include \"..\/include\/room_properties.hpp\"\n#include \"..\/include\/labyrinth.hpp\"\n#include \"..\/include\/labyrinth_map.hpp\"\n\n\/\/ This method returns whether a given Wall coordinate has a wall in the\n\/\/ given direction.\n\/\/ An exception is thrown if:\n\/\/   d is kNone (invalid_argument)\nbool LabyrinthMapCoordinateBorder::IsWall( Direction d ) const\n{\n  switch( d )\n  {\n    case Direction::kNorth:\n      return wall_north_;\n    case Direction::kEast:\n      return wall_east_;\n    case Direction::kSouth:\n      return wall_south_;\n    case Direction::kWest:\n      return wall_west_;\n    default:\n      throw std::invalid_argument( \"Error: IsWall() was given an invalid \" \\\n        \"direction (kNone).\\n\" );\n  }\n}\n\n\/\/ This method creates the Wall of a given Wall coordinate.\n\/\/ May be used to set a Wall which has already been set.\n\/\/ An exception is thrown if:\n\/\/   d is kNone (invalid_argument)\nvoid LabyrinthMapCoordinateBorder::RemoveWall( Direction d )\n{\n  switch( d )\n  {\n    case Direction::kNorth:\n      wall_north_ = false;\n      return;\n    case Direction::kEast:\n      wall_east_ = false;\n      return;\n    case Direction::kSouth:\n      wall_south_ = false;\n      return;\n    case Direction::kWest:\n      wall_west_ = false;\n      return;\n    default:\n      throw std::invalid_argument( \"Error: SetWall() was given an invalid \"\\\n        \"direction (kNone).\\n\" );\n  }\n  return;\n}\n\n\/\/ This method returns whether a given Wall coordinate has the exit.\nbool LabyrinthMapCoordinateBorder::IsExit() const\n{\n  return exit_;\n}\n\n\/\/ This method sets whether or not a given Wall coordinate has the exit.\n\/\/ May be used to set an exit where the exit already exists, or to remove\n\/\/ an exit where none exists.\nvoid LabyrinthMapCoordinateBorder::SetExit( bool b )\n{\n  exit_ = b;\n}\n\n\/\/ This method returns the inhabitant of the current Room.\nInhabitant LabyrinthMapCoordinateRoom::HasInhabitant() const\n{\n  return i_;\n}\n\n\/\/ This method sets the current inhabitant of the map's Room.\n\/\/ May be used to set the inhabitant to the same inhabitant, or to\n\/\/ no inhabitant.\nvoid LabyrinthMapCoordinateRoom::SetInhabitant( Inhabitant inh )\n{\n  i_ = inh;\n}\n\n\/\/ This method returns whether the treasure is in a given Room.\nbool LabyrinthMapCoordinateRoom::HasTreasure() const\n{\n  return treasure_;\n}\n\n\/\/ This method sets whether or not the treasure is in the given map's Room.\n\/\/ May be used to set the treasure when there is already a treasure in\n\/\/ the Room, or to remove the treasure when there is no treasure already.\nvoid LabyrinthMapCoordinateRoom::SetTreasure( bool b )\n{\n  treasure_ = b;\n}\n\n\/\/ Parameterized constructor\n\/\/ An exception is thrown if:\n\/\/   l is null (invalid_argument)\nLabyrinthMap::LabyrinthMap( Labyrinth* l,\n                            unsigned int x_size,\n                            unsigned int y_size )\n{\n  if( l == nullptr )\n  {\n    throw std::invalid_argument( \"Error: LabyrinthMap() was given an \"\\\n      \"invalid (null) pointer for the Labyrinth.\\n\" );\n  }\n\n  l_ = l;\n  x_size_ = x_size;\n  y_size_ = y_size;\n\n  map_x_size_ = x_size * 2 + 1;\n  map_y_size_ = y_size * 2 + 1;\n\n  \/\/ Creation of the map array\n  map_ = new LabyrinthMapCoordinate**[ map_y_size_ ];\n  Coordinate c;\n  for( unsigned int y = 0; y < map_y_size_; ++y )\n  {\n    map_[y] = new LabyrinthMapCoordinate*[ map_x_size_ ];\n    for( unsigned int x = 0; x < map_x_size_; ++x )\n    {\n      c.x = x;\n      c.y = y;\n      if( IsRoom(c) )\n      {\n        map_[y][x] = new LabyrinthMapCoordinateRoom;\n      }\n      else\n      {\n        map_[y][x] = new LabyrinthMapCoordinateBorder;\n      }\n    }\n  }\n\n  \/\/ Removing excess bounds on the exterior of the Labyrinth\n  for( unsigned int x = 0; x < map_x_size_; ++x )\n  {\n    map_[0][x]->RemoveWall( Direction::kNorth );\n    map_[map_y_size_-1][x]->RemoveWall( Direction::kSouth );\n  }\n  for( unsigned int y = 0; y < map_y_size_; ++y )\n  {\n    map_[y][0]->RemoveWall( Direction::kWest );\n    map_[y][map_x_size_-1]->RemoveWall( Direction::kEast );\n  }\n\n  \/\/ Sets the Borders to emulate the Labyrinth\n  Coordinate c_laby;\n  Coordinate c_map;\n  Coordinate c_mapborder_remove;\n  RoomBorder rb;\n  \/\/ Loops through the labyrinth\n  for( unsigned int y = 0; y < y_size_; ++y )\n  {\n    for( unsigned int x = 0; x < x_size_; ++x )\n    {\n      c_laby.x = x;\n      c_laby.y = y;\n      c_map = c_laby;\n      try\n      {\n        LabyrinthToMap(c_map);\n      }\n      catch( const std::exception& e )\n      {\n        std::cout << e.what();\n      }\n\n      \/\/ Removes the east border of the relevant Map coordinate if necessary\n      try\n      {\n        rb = l_->DirectionCheck(c_laby, Direction::kEast);\n      }\n      catch( const std::exception& e )\n      {\n        std::cout << e.what();\n      }\n      if( rb == RoomBorder::kRoom )\n      {\n        c_mapborder_remove = c_map;\n        (c_mapborder_remove.x)++;\n\n        (c_mapborder_remove.y)--;\n        (MapCoordinateAt(c_mapborder_remove)).RemoveWall( Direction::kSouth );\n\n        (c_mapborder_remove.y)++;\n        (MapCoordinateAt(c_mapborder_remove)).RemoveWall( Direction::kNorth );\n        (MapCoordinateAt(c_mapborder_remove)).RemoveWall( Direction::kSouth );\n\n        (c_mapborder_remove.y)++;\n        (MapCoordinateAt(c_mapborder_remove)).RemoveWall( Direction::kNorth );\n      }\n\n      \/\/ Removes the south border of the relevant Map coordinate if necessary\n      try\n      {\n        rb = l_->DirectionCheck(c_laby, Direction::kSouth);\n      }\n      catch( const std::exception& e )\n      {\n        std::cout << e.what();\n      }\n      if( rb == RoomBorder::kRoom )\n      {\n        c_mapborder_remove = c_map;\n        (c_mapborder_remove.y)++;\n\n        (c_mapborder_remove.x)--;\n        (MapCoordinateAt(c_mapborder_remove)).RemoveWall( Direction::kEast );\n\n        (c_mapborder_remove.x)++;\n        (MapCoordinateAt(c_mapborder_remove)).RemoveWall( Direction::kWest );\n        (MapCoordinateAt(c_mapborder_remove)).RemoveWall( Direction::kEast );\n\n        (c_mapborder_remove.x)++;\n        (MapCoordinateAt(c_mapborder_remove)).RemoveWall( Direction::kWest );\n      }\n    }\n  }\n\n  \/\/Update();  \/\/TODO Uncomment when Update() is implemented\n}\n\n\/\/ Destructor\nLabyrinthMap::~LabyrinthMap()\n{\n  for( unsigned int y = 0; y < map_y_size_; ++y )\n  {\n    for( unsigned int x = 0; x < map_x_size_; ++x )\n    {\n      delete map_[y][x];\n    }\n    delete [] map_[y];\n  }\n  delete [] map_;\n}\n\n\/\/ This method displays a map of the current Labyrinth.\nvoid LabyrinthMap::Display()\n{\n  Coordinate c;\n  for( unsigned int y = 0; y < map_y_size_; ++y )\n  {\n    for( unsigned int x = 0; x < map_x_size_; ++x )\n    {\n      c.x = x;\n      c.y = y;\n      if( IsRoom(c) )\n      {\n        std::cout << \" \";\n      }\n      else\n      {\n        std::cout << DisplayBorder(c);\n      }\n    }\n    std::cout << std::endl;\n  }\n\n  return;\n}\n\n\/\/ This private method returns true if the Coordinate is within the bounds\n\/\/ of the Map, and false otherwise.\nbool LabyrinthMap::WithinBoundsOfMap( const Coordinate c ) const\n{\n  return ( c.x < map_x_size_ &&\n           c.y < map_y_size_ );\n}\n\n\/\/ This private method returns true if the Coordinate designates a Room\n\/\/ in the map, and false if it designates a Border.\n\/\/ An exception is thrown if:\n\/\/   The Coordinate is outside of the Map (domain_error)\nbool LabyrinthMap::IsRoom( const Coordinate c ) const\n{\n  if( WithinBoundsOfMap(c) )\n  {\n    return c.x % 2 == 1 && c.y % 2 == 1;\n  }\n  else\n  {\n    throw std::domain_error( \"Error: IsRoom() was given a Coordinate \"\\\n      \"outside of the Map.\\n\" );\n  }\n}\n\n\/\/ This private method returns a reference to the Map Coordinate at\n\/\/ the given Coordinate.\n\/\/ An exception is thrown if:\n\/\/   The Coordinate is outside of the Map (domain_error)\nLabyrinthMapCoordinate&\nLabyrinthMap::MapCoordinateAt( const Coordinate c ) const\n{\n  if( !WithinBoundsOfMap(c) )\n  {\n    throw std::domain_error( \"Error: MapCoordinateAt() was given a \"\\\n      \"Coordinate outside of the Map.\\n\" );\n  }\n\n  return *(map_[c.y][c.x]);\n}\n\n\/\/ This private method converts a Labyrinth Coordinate to the same\n\/\/ location in the Map.\n\/\/ An exception is thrown if:\n\/\/   The Coordinate is outside of the Labyrinth (invalid_argument)\nvoid LabyrinthMap::LabyrinthToMap( Coordinate c ) const\n{\n  if( c.x < x_size_ &&\n      c.y < y_size_ )\n  {\n    c.x = c.x * 2 + 1;\n    c.y = c.y * 2 + 1;\n  }\n  else\n  {\n    throw std::invalid_argument( \"Error: LabyrinthToMap() was given a \"\\\n      \"Coordinate outside of the Labyrinth.\\n\" );\n  }\n}\n\n\/\/ This private method converts a Map Room Coordinate to the same\n\/\/ Room in the Labyrinth.\n\/\/ An exception is thrown if:\n\/\/   The Coordinate is outside of the Labyrinth (domain_error)\n\/\/   The Coordinate designates a border (logic_error)\nvoid LabyrinthMap::MapToLabyrinth( Coordinate c ) const\n{\n  if( !WithinBoundsOfMap(c) )\n  {\n    throw std::domain_error( \"Error: MapToLabyrinth() was given a \"\\\n      \"Coordinate outside of the LabyrinthMap.\\n\" );\n  }\n  else if( !IsRoom(c) )\n  {\n    throw std::logic_error( \"Error: MapToLabyrinth() was given a \"\\\n      \"Coordinate designating a Border, not a Room.\\n\" );\n  }\n  else\n  {\n    c.x = (c.x - 1) \/ 2;\n    c.y = (c.y - 1) \/ 2;\n  }\n}\n\n\/\/ This private method returns a character representing the given\n\/\/ Border Coordinate.\n\/\/ An exception is thrown if:\n\/\/   The Coordinate is outside of the Labyrinth (domain_error)\n\/\/   The Coordinate designates a Room (logic_error)\nstd::string LabyrinthMap::DisplayBorder( const Coordinate c ) const\n{\n  if( !WithinBoundsOfMap(c) )\n  {\n    throw std::domain_error( \"Error: DisplayBorder() was given an invalid \"\\\n      \"Coordinate.\\n\" );\n  }\n  else if( IsRoom(c) )\n  {\n    throw std::logic_error( \"Error: DisplayBorder() was given a \"\\\n      \"Room Coordinate.\\n\" );\n  }\n\n  RoomBorder rb_n;\n  RoomBorder rb_e;\n  RoomBorder rb_s;\n  RoomBorder rb_w;\n\n  try\n  {\n    MapToLabyrinth( c );\n    rb_n = l_->DirectionCheck( c, Direction::kNorth );\n    rb_e = l_->DirectionCheck( c, Direction::kEast );\n    rb_s = l_->DirectionCheck( c, Direction::kSouth );\n    rb_w = l_->DirectionCheck( c, Direction::kWest );\n  }\n  catch( std::exception& e )\n  {\n    std::cout << e.what();\n  }\n\n  char borders_nesw[5] = \"0000\";\n\n  if( rb_n != RoomBorder::kRoom )\n  {\n    borders_nesw[0] = '1';\n  }\n  if( rb_e != RoomBorder::kRoom )\n  {\n    borders_nesw[1] = '1';\n  }\n  if( rb_s != RoomBorder::kRoom )\n  {\n    borders_nesw[2] = '1';\n  }\n  if( rb_w != RoomBorder::kRoom )\n  {\n    borders_nesw[3] = '1';\n  }\n\n  \/\/ A true abomination lies ahead.\n  \/\/ Please let me know if you have any alternative ideas so I can put this\n  \/\/ out of its misery.\n  \/\/\n  \/\/ Characters taken from the Unicode section of:\n  \/\/ https:\/\/en.wikipedia.org\/wiki\/Box-drawing_character\n\n  if( strcmp(borders_nesw, \"0000\") ) return \" \";\n\n  else if( strcmp(borders_nesw, \"1000\") ) return u8\"╵\";\n  else if( strcmp(borders_nesw, \"0100\") ) return u8\"╶\";\n  else if( strcmp(borders_nesw, \"0010\") ) return u8\"╷\";\n  else if( strcmp(borders_nesw, \"0001\") ) return u8\"╴\";\n\n  else if( strcmp(borders_nesw, \"1100\") ) return u8\"└\";\n  else if( strcmp(borders_nesw, \"1010\") ) return u8\"│\";\n  else if( strcmp(borders_nesw, \"1001\") ) return u8\"┘\";\n  else if( strcmp(borders_nesw, \"0110\") ) return u8\"┌\";\n  else if( strcmp(borders_nesw, \"0101\") ) return u8\"─\";\n  else if( strcmp(borders_nesw, \"0011\") ) return u8\"┐\";\n\n  else if( strcmp(borders_nesw, \"1110\") ) return u8\"├\";\n  else if( strcmp(borders_nesw, \"1101\") ) return u8\"┴\";\n  else if( strcmp(borders_nesw, \"1011\") ) return u8\"┤\";\n  else if( strcmp(borders_nesw, \"0111\") ) return u8\"┬\";\n\n  else if( strcmp(borders_nesw, \"1111\") ) return u8\"┼\";\n\n  else\n  {\n    throw std::logic_error( \"Error: DisplayBorder()'s check for \"\\\n      \"NESW values missed a possible value.\\n\" );\n  }\n}\n\/\/TODO Implementation of labyrinth_map.hpp\n<|endoftext|>"}
{"text":"<commit_before>\/*\n*\n* Copyright 2018 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: Burak Karaboga\n*\/\n#include <string>\n\n#include \"logMsg\/logMsg.h\"\n#include \"common\/JsonHelper.h\"\n\n#include \"apiTypesV2\/MqttInfo.h\"\n\n#include \"mongoBackend\/dbConstants.h\"\n\n#include \"mongoDriver\/safeMongo.h\"\n\n\nnamespace ngsiv2\n{\n\/* ****************************************************************************\n*\n* MqttInfo::MqttInfo - \n*\/\nMqttInfo::MqttInfo() : qos(0), custom(false), includePayload(true), providedAuth(false)\n{\n}\n\n\n\n\/* ****************************************************************************\n*\n* MqttInfo::MqttInfo - \n*\/\nMqttInfo::MqttInfo(const std::string& _url) : url(_url), qos(0), custom(false), includePayload(true), providedAuth(false)\n{\n}\n\n\n\n\/* ****************************************************************************\n*\n* MqttInfo::toJson -\n*\/\nstd::string MqttInfo::toJson()\n{\n  JsonObjectHelper jh;\n\n  jh.addString(\"url\", this->url);\n  jh.addString(\"topic\", this->topic);\n  jh.addNumber(\"qos\", (long long) this->qos);\n\n  if (providedAuth)\n  {\n    jh.addString(\"user\", this->user);\n    jh.addString(\"passwd\", \"*****\");\n  }\n\n  if (custom)\n  {\n    if (!this->includePayload)\n    {\n      jh.addNull(\"payload\");\n    }\n    else if (!this->payload.empty())\n    {\n      jh.addString(\"payload\", this->payload);\n    }\n  }\n\n  return jh.str();\n}\n\n\n\n\/* ****************************************************************************\n*\n* MqttInfo::fill -\n*\/\nvoid MqttInfo::fill(const orion::BSONObj& bo)\n{\n  this->url    = bo.hasField(CSUB_REFERENCE)? getStringFieldF(bo, CSUB_REFERENCE) : \"\";\n  this->topic  = bo.hasField(CSUB_MQTTTOPIC)? getStringFieldF(bo, CSUB_MQTTTOPIC) : \"\";\n  this->qos    = bo.hasField(CSUB_MQTTQOS)?   getIntFieldF(bo, CSUB_MQTTQOS)      : 0;  \n  this->custom = bo.hasField(CSUB_CUSTOM)?    getBoolFieldF(bo, CSUB_CUSTOM)      : false;\n\n  \/\/ both user and passwd have to be used at the same time\n  if ((bo.hasField(CSUB_USER)) && (bo.hasField(CSUB_PASSWD)))\n  {\n    this->user   = getStringFieldF(bo, CSUB_USER);\n    this->passwd = getStringFieldF(bo, CSUB_PASSWD);\n    this->providedAuth = true;\n  }\n  else\n  {\n    this->user   = \"\";\n    this->passwd = \"\";\n    this->providedAuth = false;\n  }\n\n  if (this->custom)\n  {\n    if (bo.hasField(CSUB_PAYLOAD))\n    {\n      if (getFieldF(bo, CSUB_PAYLOAD).isNull())\n      {\n        \/\/ We initialize also this->payload in this case, although its value is irrelevant\n        this->payload = \"\";\n        this->includePayload = false;\n      }\n      else\n      {\n        this->payload = getStringFieldF(bo, CSUB_PAYLOAD);\n        this->includePayload = true;\n      }\n    }\n    else\n    {\n      this->payload = \"\";\n      this->includePayload = true;\n    }\n  }\n}\n}\n<commit_msg>FIX lint<commit_after>\/*\n*\n* Copyright 2018 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: Burak Karaboga\n*\/\n#include <string>\n\n#include \"logMsg\/logMsg.h\"\n#include \"common\/JsonHelper.h\"\n\n#include \"apiTypesV2\/MqttInfo.h\"\n\n#include \"mongoBackend\/dbConstants.h\"\n\n#include \"mongoDriver\/safeMongo.h\"\n\n\nnamespace ngsiv2\n{\n\/* ****************************************************************************\n*\n* MqttInfo::MqttInfo - \n*\/\nMqttInfo::MqttInfo() : qos(0), custom(false), includePayload(true), providedAuth(false)\n{\n}\n\n\n\n\/* ****************************************************************************\n*\n* MqttInfo::MqttInfo - \n*\/\nMqttInfo::MqttInfo(const std::string& _url) : url(_url), qos(0), custom(false), includePayload(true), providedAuth(false)\n{\n}\n\n\n\n\/* ****************************************************************************\n*\n* MqttInfo::toJson -\n*\/\nstd::string MqttInfo::toJson()\n{\n  JsonObjectHelper jh;\n\n  jh.addString(\"url\", this->url);\n  jh.addString(\"topic\", this->topic);\n  jh.addNumber(\"qos\", (long long) this->qos);\n\n  if (providedAuth)\n  {\n    jh.addString(\"user\", this->user);\n    jh.addString(\"passwd\", \"*****\");\n  }\n\n  if (custom)\n  {\n    if (!this->includePayload)\n    {\n      jh.addNull(\"payload\");\n    }\n    else if (!this->payload.empty())\n    {\n      jh.addString(\"payload\", this->payload);\n    }\n  }\n\n  return jh.str();\n}\n\n\n\n\/* ****************************************************************************\n*\n* MqttInfo::fill -\n*\/\nvoid MqttInfo::fill(const orion::BSONObj& bo)\n{\n  this->url    = bo.hasField(CSUB_REFERENCE)? getStringFieldF(bo, CSUB_REFERENCE) : \"\";\n  this->topic  = bo.hasField(CSUB_MQTTTOPIC)? getStringFieldF(bo, CSUB_MQTTTOPIC) : \"\";\n  this->qos    = bo.hasField(CSUB_MQTTQOS)?   getIntFieldF(bo, CSUB_MQTTQOS)      : 0;\n  this->custom = bo.hasField(CSUB_CUSTOM)?    getBoolFieldF(bo, CSUB_CUSTOM)      : false;\n\n  \/\/ both user and passwd have to be used at the same time\n  if ((bo.hasField(CSUB_USER)) && (bo.hasField(CSUB_PASSWD)))\n  {\n    this->user   = getStringFieldF(bo, CSUB_USER);\n    this->passwd = getStringFieldF(bo, CSUB_PASSWD);\n    this->providedAuth = true;\n  }\n  else\n  {\n    this->user   = \"\";\n    this->passwd = \"\";\n    this->providedAuth = false;\n  }\n\n  if (this->custom)\n  {\n    if (bo.hasField(CSUB_PAYLOAD))\n    {\n      if (getFieldF(bo, CSUB_PAYLOAD).isNull())\n      {\n        \/\/ We initialize also this->payload in this case, although its value is irrelevant\n        this->payload = \"\";\n        this->includePayload = false;\n      }\n      else\n      {\n        this->payload = getStringFieldF(bo, CSUB_PAYLOAD);\n        this->includePayload = true;\n      }\n    }\n    else\n    {\n      this->payload = \"\";\n      this->includePayload = true;\n    }\n  }\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"lexer.hpp\"\n#include \"..\/symbol-pool.hpp\"\n#include \"..\/parser\/parser.hpp\"\n\nnamespace Mirb\n{\n\tvoid Lexer::build_simple_string(const char_t *start, char_t *str, size_t length prelude_unused)\n\t{\n\t\tchar_t *writer = str;\n\t\tconst char_t *input = start;\n\t \n\t\twhile(true)\n\t\t\tswitch(*input)\n\t\t\t{\n\t\t\t\tcase '\\'':\n\t\t\t\t\tgoto done;\n\t\t\t\t\t\n\t\t\t\tcase '\\\\':\n\t\t\t\t\tinput++;\n\t\t\t\t\t\n\t\t\t\t\tswitch(*input)\n\t\t\t\t\t{\n\t\t\t\t\t\tcase '\\'':\n\t\t\t\t\t\tcase '\\\\':\n\t\t\t\t\t\t\t*writer++ = *input++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tcase 0:\n\t\t\t\t\t\t\tif(process_null(input, true))\n\t\t\t\t\t\t\t\tgoto done;\n\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t*writer++ = '\\\\';\n\t\t\t\t\t\t\t*writer++ = *input++;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t\n\t\t\t\tcase 0:\n\t\t\t\t\tif(process_null(input, true))\n\t\t\t\t\t\tgoto done;\n\t\t\t\t\n\t\t\t\tdefault:\n\t\t\t\t\t*writer++ = *input++;\n\t\t\t}\n\t\t\t\n\t\tdone:\n\t\tmirb_debug_assert((size_t)(writer - str) == length);\n\t}\n\n\tvoid Lexer::simple_string()\n\t{\n\t\tinput++;\n\t\t\n\t\tlexeme.type = Lexeme::STRING;\n\t\tsize_t overhead = 2;\n\n\t\twhile(true)\n\t\t\tswitch(input)\n\t\t\t{\n\t\t\t\tcase '\\'':\n\t\t\t\t\tinput++;\n\t\t\t\t\tgoto done;\n\n\t\t\t\tcase '\\n':\n\t\t\t\t\tinput++;\n\t\t\t\t\tlexeme.line++;\n\t\t\t\t\tlexeme.line_start = &input;\n\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\tcase '\\r':\n\t\t\t\t\tinput++;\n\t\t\t\t\tlexeme.line++;\n\n\t\t\t\t\tif(input == '\\n')\n\t\t\t\t\t\tinput++;\n\n\t\t\t\t\tlexeme.line_start = &input;\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase '\\\\':\n\t\t\t\t\tinput++;\n\n\t\t\t\t\tswitch(input)\n\t\t\t\t\t{\n\t\t\t\t\t\tcase '\\'':\n\t\t\t\t\t\tcase '\\\\':\n\t\t\t\t\t\t\toverhead++;\n\t\t\t\t\t\t\tinput++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tcase 0:\n\t\t\t\t\t\t\tif(process_null(&input))\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tlexeme.stop = &input;\n\t\t\t\t\t\t\t\tparser.report(lexeme.dup(memory_pool), \"Unterminated string\");\n\t\t\t\t\t\t\t\tgoto error;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\tinput++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\tconst char_t *start = lexeme.start;\n\t\t\t\t\t\t\tlexeme.start = &input - 1;\n\t\t\t\t\t\t\tlexeme.stop = &input + 1;\n\t\t\t\t\t\t\tparser.report(lexeme.dup(memory_pool), \"Invalid escape string\");\n\t\t\t\t\t\t\tlexeme.start = start;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase 0:\n\t\t\t\t\tif(process_null(&input))\n\t\t\t\t\t{\n\t\t\t\t\t\tlexeme.stop = &input;\n\t\t\t\t\t\tparser.report(lexeme.dup(memory_pool), \"Unterminated string\");\n\t\t\t\t\t\tgoto error;\n\t\t\t\t\t}\n\t\t\t\t\n\t\t\t\tdefault:\n\t\t\t\t\tinput++;\t\t\n\t\t\t}\n\n\t\terror:\n\t\tlexeme.stop = &input;\n\t\tlexeme.str.data = (const char_t *)\"\";\n\t\tlexeme.str.length = 0;\n\t\treturn;\n\t\t\n\t\tdone:\n\t\tlexeme.stop = &input;\n\t\t\n\t\tsize_t str_length = lexeme.length() - overhead;\n\t\tchar_t *str = new (memory_pool) char_t[str_length];\n\t\t\n\t\tbuild_simple_string(lexeme.start + 1, str, str_length);\n\t\t\n\t\tlexeme.str.data = str;\n\t\tlexeme.str.length = str_length;\n\t}\n\t\n\tvoid Lexer::build_string(const char_t *start, char_t *str, size_t length prelude_unused)\n\t{\n\t\tchar_t *writer = str;\n\t\tconst char_t *input = start;\n\t\t\n\t\twhile(true)\n\t\t\tswitch(*input)\n\t\t\t{\n\t\t\t\tcase '#':\n\t\t\t\t{\n\t\t\t\t\tinput++;\n\t\t\t\t\t\n\t\t\t\t\tif(*input == '{')\n\t\t\t\t\t{\n\t\t\t\t\t\tgoto done;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t\t*writer++ = '#';\n\t\t\t\t\t\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tcase '\"':\n\t\t\t\t\tgoto done;\n\t\t\t\t\n\t\t\t\tcase '\\\\':\n\t\t\t\t\tinput++;\n\n\t\t\t\t\tswitch(*input)\n\t\t\t\t\t{\n\t\t\t\t\t\tcase '\\'':\n\t\t\t\t\t\tcase '\\\"':\n\t\t\t\t\t\tcase '\\\\':\n\t\t\t\t\t\t\t*writer++ = *input++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tcase '0':\n\t\t\t\t\t\t\t*writer++ = 0;\n\t\t\t\t\t\t\tinput++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tcase 'a':\n\t\t\t\t\t\t\t*writer++ = 7;\n\t\t\t\t\t\t\tinput++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tcase 'b':\n\t\t\t\t\t\t\t*writer++ = 8;\n\t\t\t\t\t\t\tinput++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tcase 'f':\n\t\t\t\t\t\t\t*writer++ = 12;\n\t\t\t\t\t\t\tinput++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tcase 'n':\n\t\t\t\t\t\t\t*writer++ = 10;\n\t\t\t\t\t\t\tinput++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tcase 'r':\n\t\t\t\t\t\t\t*writer++ = 13;\n\t\t\t\t\t\t\tinput++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tcase 't':\n\t\t\t\t\t\t\t*writer++ = 9;\n\t\t\t\t\t\t\tinput++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tcase 'v':\n\t\t\t\t\t\t\t*writer++ = 11;\n\t\t\t\t\t\t\tinput++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tcase 0:\n\t\t\t\t\t\t\tif(process_null(input))\n\t\t\t\t\t\t\t\tgoto done;\n\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t*writer++ = '\\\\';\n\t\t\t\t\t\t\t*writer++ = *input++;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\tcase 0:\n\t\t\t\t\tif(process_null(input))\n\t\t\t\t\t\tgoto done;\n\n\t\t\t\tdefault:\n\t\t\t\t\t*writer++ = *input++;\n\t\t\t}\n\t\t\t\n\t\tdone:\n\t\tmirb_debug_assert((size_t)(writer - str) == length);\n\t}\n\n\tvoid Lexer::parse_string(bool initial)\n\t{\n\t\tlexeme.type = Lexeme::STRING;\n\t\tsize_t overhead = 2;\n\t\t\n\t\twhile(true)\n\t\t\tswitch(input)\n\t\t\t{\n\t\t\t\tcase '#':\n\t\t\t\t{\n\t\t\t\t\tinput++;\n\t\t\t\t\t\n\t\t\t\t\tif(input == '{')\n\t\t\t\t\t{\n\t\t\t\t\t\tinput++;\n\t\t\t\t\t\t\n\t\t\t\t\t\tlexeme.curlies.push(true);\n\t\t\t\t\t\t\n\t\t\t\t\t\tlexeme.type = Lexeme::STRING_START;\n\t\t\t\t\t\t\n\t\t\t\t\t\toverhead += 1;\n\n\t\t\t\t\t\tgoto done;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tcase '\"':\n\t\t\t\t\tinput++;\n\t\t\t\t\tgoto done;\n\n\t\t\t\tcase '\\n':\n\t\t\t\t\tinput++;\n\t\t\t\t\tlexeme.line++;\n\t\t\t\t\tlexeme.line_start = &input;\n\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\tcase '\\r':\n\t\t\t\t\tinput++;\n\t\t\t\t\tlexeme.line++;\n\n\t\t\t\t\tif(input == '\\n')\n\t\t\t\t\t\tinput++;\n\n\t\t\t\t\tlexeme.line_start = &input;\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase '\\\\':\n\t\t\t\t\tinput++;\n\n\t\t\t\t\tswitch(input)\n\t\t\t\t\t{\n\t\t\t\t\t\tcase '\\'':\n\t\t\t\t\t\tcase '\\\"':\n\t\t\t\t\t\tcase '\\\\':\n\t\t\t\t\t\tcase '0':\n\t\t\t\t\t\tcase 'a':\n\t\t\t\t\t\tcase 'b':\n\t\t\t\t\t\tcase 'f':\n\t\t\t\t\t\tcase 'n':\n\t\t\t\t\t\tcase 'r':\n\t\t\t\t\t\tcase 't':\n\t\t\t\t\t\tcase 'v':\n\t\t\t\t\t\t\toverhead++;\n\t\t\t\t\t\t\tinput++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tcase 0:\n\t\t\t\t\t\t\tif(process_null(&input))\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tlexeme.stop = &input;\n\n\t\t\t\t\t\t\t\tparser.report(lexeme.dup(memory_pool), \"Unterminated string\");\n\t\t\t\t\t\t\t\tgoto error;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\tinput++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\tconst char_t *start = lexeme.start;\n\t\t\t\t\t\t\tlexeme.start = &input - 1;\n\t\t\t\t\t\t\tlexeme.stop = &input + 1;\n\t\t\t\t\t\t\tparser.report(lexeme.dup(memory_pool), \"Invalid escape string\");\n\t\t\t\t\t\t\tlexeme.start = start;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase 0:\n\t\t\t\t\tif(process_null(&input))\n\t\t\t\t\t{\n\t\t\t\t\t\tlexeme.stop = &input;\n\t\t\t\t\t\tparser.report(lexeme.dup(memory_pool), \"Unterminated string\");\n\t\t\t\t\t\tgoto error;\n\t\t\t\t\t}\n\t\t\t\t\n\t\t\t\tdefault:\n\t\t\t\t\tinput++;\t\t\n\t\t\t}\n\t\t\n\t\terror:\n\t\tlexeme.stop = &input;\n\t\tlexeme.str.data = (const char_t *)\"\";\n\t\tlexeme.str.length = 0;\n\t\treturn;\n\t\t\n\t\tdone:\n\t\tlexeme.stop = &input;\n\t\t\n\t\tif(!initial)\n\t\t\tlexeme.type = (Lexeme::Type)((int)lexeme.type + 1);\n\t\t\n\t\tsize_t str_length = lexeme.length() - overhead;\n\t\tchar_t *str = new (memory_pool) char_t[str_length + 1]; \/\/TODO: Fix memory leak\n\t\t\n\t\tbuild_string(lexeme.start + 1, str, str_length);\n\t\t\n\t\tlexeme.str.data = str;\n\t\tlexeme.str.length = str_length;\n\t}\n\t\n\tvoid Lexer::curly_close()\n\t{\n\t\tinput++;\n\t\tlexeme.stop = &input;\n\t\tlexeme.type = Lexeme::CURLY_CLOSE;\n\t\t\n\t\tif(lexeme.curlies.size() == 0)\n\t\t\treturn;\n\t\t\n\t\tbool string = lexeme.curlies.pop();\n\t\t\n\t\tif(!string)\n\t\t\treturn;\n\t\t\n\t\tparse_string(false);\n\t}\n\n\tvoid Lexer::string()\n\t{\n\t\tinput++;\n\t\t\n\t\tparse_string(true);\n\t}\n};\n<commit_msg>Tweak string escape codes.<commit_after>#include \"lexer.hpp\"\n#include \"..\/symbol-pool.hpp\"\n#include \"..\/parser\/parser.hpp\"\n\nnamespace Mirb\n{\n\tvoid Lexer::build_simple_string(const char_t *start, char_t *str, size_t length prelude_unused)\n\t{\n\t\tchar_t *writer = str;\n\t\tconst char_t *input = start;\n\t \n\t\twhile(true)\n\t\t\tswitch(*input)\n\t\t\t{\n\t\t\t\tcase '\\'':\n\t\t\t\t\tgoto done;\n\t\t\t\t\t\n\t\t\t\tcase '\\\\':\n\t\t\t\t\tinput++;\n\t\t\t\t\t\n\t\t\t\t\tswitch(*input)\n\t\t\t\t\t{\n\t\t\t\t\t\tcase '\\'':\n\t\t\t\t\t\tcase '\\\\':\n\t\t\t\t\t\t\t*writer++ = *input++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tcase 0:\n\t\t\t\t\t\t\tif(process_null(input, true))\n\t\t\t\t\t\t\t\tgoto done;\n\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t*writer++ = '\\\\';\n\t\t\t\t\t\t\t*writer++ = *input++;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t\n\t\t\t\tcase 0:\n\t\t\t\t\tif(process_null(input, true))\n\t\t\t\t\t\tgoto done;\n\t\t\t\t\n\t\t\t\tdefault:\n\t\t\t\t\t*writer++ = *input++;\n\t\t\t}\n\t\t\t\n\t\tdone:\n\t\tmirb_debug_assert((size_t)(writer - str) == length);\n\t}\n\n\tvoid Lexer::simple_string()\n\t{\n\t\tinput++;\n\t\t\n\t\tlexeme.type = Lexeme::STRING;\n\t\tsize_t overhead = 2;\n\n\t\twhile(true)\n\t\t\tswitch(input)\n\t\t\t{\n\t\t\t\tcase '\\'':\n\t\t\t\t\tinput++;\n\t\t\t\t\tgoto done;\n\n\t\t\t\tcase '\\n':\n\t\t\t\t\tinput++;\n\t\t\t\t\tlexeme.line++;\n\t\t\t\t\tlexeme.line_start = &input;\n\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\tcase '\\r':\n\t\t\t\t\tinput++;\n\t\t\t\t\tlexeme.line++;\n\n\t\t\t\t\tif(input == '\\n')\n\t\t\t\t\t\tinput++;\n\n\t\t\t\t\tlexeme.line_start = &input;\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase '\\\\':\n\t\t\t\t\tinput++;\n\n\t\t\t\t\tswitch(input)\n\t\t\t\t\t{\n\t\t\t\t\t\tcase '\\'':\n\t\t\t\t\t\tcase '\\\\':\n\t\t\t\t\t\t\toverhead++;\n\t\t\t\t\t\t\tinput++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tcase 0:\n\t\t\t\t\t\t\tif(process_null(&input))\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tlexeme.stop = &input;\n\t\t\t\t\t\t\t\tparser.report(lexeme.dup(memory_pool), \"Unterminated string\");\n\t\t\t\t\t\t\t\tgoto error;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\tinput++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\tconst char_t *start = lexeme.start;\n\t\t\t\t\t\t\tlexeme.start = &input - 1;\n\t\t\t\t\t\t\tlexeme.stop = &input + 1;\n\t\t\t\t\t\t\tparser.report(lexeme.dup(memory_pool), \"Invalid escape string\");\n\t\t\t\t\t\t\tlexeme.start = start;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase 0:\n\t\t\t\t\tif(process_null(&input))\n\t\t\t\t\t{\n\t\t\t\t\t\tlexeme.stop = &input;\n\t\t\t\t\t\tparser.report(lexeme.dup(memory_pool), \"Unterminated string\");\n\t\t\t\t\t\tgoto error;\n\t\t\t\t\t}\n\t\t\t\t\n\t\t\t\tdefault:\n\t\t\t\t\tinput++;\t\t\n\t\t\t}\n\n\t\terror:\n\t\tlexeme.stop = &input;\n\t\tlexeme.str.data = (const char_t *)\"\";\n\t\tlexeme.str.length = 0;\n\t\treturn;\n\t\t\n\t\tdone:\n\t\tlexeme.stop = &input;\n\t\t\n\t\tsize_t str_length = lexeme.length() - overhead;\n\t\tchar_t *str = new (memory_pool) char_t[str_length];\n\t\t\n\t\tbuild_simple_string(lexeme.start + 1, str, str_length);\n\t\t\n\t\tlexeme.str.data = str;\n\t\tlexeme.str.length = str_length;\n\t}\n\t\n\tvoid Lexer::build_string(const char_t *start, char_t *str, size_t length prelude_unused)\n\t{\n\t\tchar_t *writer = str;\n\t\tconst char_t *input = start;\n\t\t\n\t\twhile(true)\n\t\t\tswitch(*input)\n\t\t\t{\n\t\t\t\tcase '#':\n\t\t\t\t{\n\t\t\t\t\tinput++;\n\t\t\t\t\t\n\t\t\t\t\tif(*input == '{')\n\t\t\t\t\t{\n\t\t\t\t\t\tgoto done;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t\t*writer++ = '#';\n\t\t\t\t\t\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tcase '\"':\n\t\t\t\t\tgoto done;\n\t\t\t\t\n\t\t\t\tcase '\\\\':\n\t\t\t\t\tinput++;\n\n\t\t\t\t\tswitch(*input)\n\t\t\t\t\t{\n\t\t\t\t\t\tcase '\\'':\n\t\t\t\t\t\tcase '\\\"':\n\t\t\t\t\t\tcase '\\\\':\n\t\t\t\t\t\t\t*writer++ = *input++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tcase '0':\n\t\t\t\t\t\t\t*writer++ = 0;\n\t\t\t\t\t\t\tinput++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tcase 'n':\n\t\t\t\t\t\t\t*writer++ = 0xA;\n\t\t\t\t\t\t\tinput++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tcase 't':\n\t\t\t\t\t\t\t*writer++ = 0x9;\n\t\t\t\t\t\t\tinput++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tcase 'r':\n\t\t\t\t\t\t\t*writer++ = 0xD;\n\t\t\t\t\t\t\tinput++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tcase 'f':\n\t\t\t\t\t\t\t*writer++ = 0xC;\n\t\t\t\t\t\t\tinput++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tcase 'v':\n\t\t\t\t\t\t\t*writer++ = 0xB;\n\t\t\t\t\t\t\tinput++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tcase 'a':\n\t\t\t\t\t\t\t*writer++ = 0x7;\n\t\t\t\t\t\t\tinput++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tcase 'e':\n\t\t\t\t\t\t\t*writer++ = 0x1B;\n\t\t\t\t\t\t\tinput++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tcase 'b':\n\t\t\t\t\t\t\t*writer++ = 0x8;\n\t\t\t\t\t\t\tinput++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tcase 's':\n\t\t\t\t\t\t\t*writer++ = 0x20;\n\t\t\t\t\t\t\tinput++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tcase 0:\n\t\t\t\t\t\t\tif(process_null(input))\n\t\t\t\t\t\t\t\tgoto done;\n\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t*writer++ = '\\\\';\n\t\t\t\t\t\t\t*writer++ = *input++;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\tcase 0:\n\t\t\t\t\tif(process_null(input))\n\t\t\t\t\t\tgoto done;\n\n\t\t\t\tdefault:\n\t\t\t\t\t*writer++ = *input++;\n\t\t\t}\n\t\t\t\n\t\tdone:\n\t\tmirb_debug_assert((size_t)(writer - str) == length);\n\t}\n\n\tvoid Lexer::parse_string(bool initial)\n\t{\n\t\tlexeme.type = Lexeme::STRING;\n\t\tsize_t overhead = 2;\n\t\t\n\t\twhile(true)\n\t\t\tswitch(input)\n\t\t\t{\n\t\t\t\tcase '#':\n\t\t\t\t{\n\t\t\t\t\tinput++;\n\t\t\t\t\t\n\t\t\t\t\tif(input == '{')\n\t\t\t\t\t{\n\t\t\t\t\t\tinput++;\n\t\t\t\t\t\t\n\t\t\t\t\t\tlexeme.curlies.push(true);\n\t\t\t\t\t\t\n\t\t\t\t\t\tlexeme.type = Lexeme::STRING_START;\n\t\t\t\t\t\t\n\t\t\t\t\t\toverhead += 1;\n\n\t\t\t\t\t\tgoto done;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tcase '\"':\n\t\t\t\t\tinput++;\n\t\t\t\t\tgoto done;\n\n\t\t\t\tcase '\\n':\n\t\t\t\t\tinput++;\n\t\t\t\t\tlexeme.line++;\n\t\t\t\t\tlexeme.line_start = &input;\n\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\tcase '\\r':\n\t\t\t\t\tinput++;\n\t\t\t\t\tlexeme.line++;\n\n\t\t\t\t\tif(input == '\\n')\n\t\t\t\t\t\tinput++;\n\n\t\t\t\t\tlexeme.line_start = &input;\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase '\\\\':\n\t\t\t\t\tinput++;\n\n\t\t\t\t\tswitch(input)\n\t\t\t\t\t{\n\t\t\t\t\t\tcase '\\'':\n\t\t\t\t\t\tcase '\\\"':\n\t\t\t\t\t\tcase '\\\\':\n\t\t\t\t\t\tcase '0':\n\t\t\t\t\t\tcase 'n':\n\t\t\t\t\t\tcase 't':\n\t\t\t\t\t\tcase 'r':\n\t\t\t\t\t\tcase 'f':\n\t\t\t\t\t\tcase 'v':\n\t\t\t\t\t\tcase 'a':\n\t\t\t\t\t\tcase 'e':\n\t\t\t\t\t\tcase 'b':\n\t\t\t\t\t\tcase 's':\n\t\t\t\t\t\t\toverhead++;\n\t\t\t\t\t\t\tinput++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\n\t\t\t\t\t\tcase 0:\n\t\t\t\t\t\t\tif(process_null(&input))\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tlexeme.stop = &input;\n\n\t\t\t\t\t\t\t\tparser.report(lexeme.dup(memory_pool), \"Unterminated string\");\n\t\t\t\t\t\t\t\tgoto error;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\tinput++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\tconst char_t *start = lexeme.start;\n\t\t\t\t\t\t\tlexeme.start = &input - 1;\n\t\t\t\t\t\t\tlexeme.stop = &input + 1;\n\t\t\t\t\t\t\tparser.report(lexeme.dup(memory_pool), \"Invalid escape string\");\n\t\t\t\t\t\t\tlexeme.start = start;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase 0:\n\t\t\t\t\tif(process_null(&input))\n\t\t\t\t\t{\n\t\t\t\t\t\tlexeme.stop = &input;\n\t\t\t\t\t\tparser.report(lexeme.dup(memory_pool), \"Unterminated string\");\n\t\t\t\t\t\tgoto error;\n\t\t\t\t\t}\n\t\t\t\t\n\t\t\t\tdefault:\n\t\t\t\t\tinput++;\t\t\n\t\t\t}\n\t\t\n\t\terror:\n\t\tlexeme.stop = &input;\n\t\tlexeme.str.data = (const char_t *)\"\";\n\t\tlexeme.str.length = 0;\n\t\treturn;\n\t\t\n\t\tdone:\n\t\tlexeme.stop = &input;\n\t\t\n\t\tif(!initial)\n\t\t\tlexeme.type = (Lexeme::Type)((int)lexeme.type + 1);\n\t\t\n\t\tsize_t str_length = lexeme.length() - overhead;\n\t\tchar_t *str = new (memory_pool) char_t[str_length + 1]; \/\/TODO: Fix memory leak\n\t\t\n\t\tbuild_string(lexeme.start + 1, str, str_length);\n\t\t\n\t\tlexeme.str.data = str;\n\t\tlexeme.str.length = str_length;\n\t}\n\t\n\tvoid Lexer::curly_close()\n\t{\n\t\tinput++;\n\t\tlexeme.stop = &input;\n\t\tlexeme.type = Lexeme::CURLY_CLOSE;\n\t\t\n\t\tif(lexeme.curlies.size() == 0)\n\t\t\treturn;\n\t\t\n\t\tbool string = lexeme.curlies.pop();\n\t\t\n\t\tif(!string)\n\t\t\treturn;\n\t\t\n\t\tparse_string(false);\n\t}\n\n\tvoid Lexer::string()\n\t{\n\t\tinput++;\n\t\t\n\t\tparse_string(true);\n\t}\n};\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"lhttp_address.hxx\"\n#include \"pool.hxx\"\n#include \"uri\/uri_base.hxx\"\n#include \"uri\/uri_relative.hxx\"\n#include \"uri\/uri_escape.hxx\"\n#include \"uri\/uri_extract.hxx\"\n#include \"puri_edit.hxx\"\n#include \"puri_relative.hxx\"\n#include \"pexpand.hxx\"\n#include \"translate_quark.hxx\"\n#include \"spawn\/Prepared.hxx\"\n#include \"util\/StringView.hxx\"\n\n#include <string.h>\n\nLhttpAddress::LhttpAddress(const char *_path)\n    :path(_path),\n     host_and_port(nullptr),\n     uri(nullptr), expand_uri(nullptr),\n     concurrency(1),\n     blocking(true)\n{\n    assert(path != nullptr);\n\n    args.Init();\n    options.Init();\n}\n\nLhttpAddress::LhttpAddress(struct pool &pool, const LhttpAddress &src)\n    :path(p_strdup(&pool, src.path)),\n     host_and_port(p_strdup_checked(&pool, src.host_and_port)),\n     uri(p_strdup(&pool, src.uri)),\n     expand_uri(p_strdup_checked(&pool, src.expand_uri)),\n     concurrency(src.concurrency),\n     blocking(src.blocking)\n{\n    assert(src.path != nullptr);\n\n    args.CopyFrom(&pool, src.args);\n    options.CopyFrom(&pool, &src.options);\n}\n\nconst char *\nLhttpAddress::GetServerId(struct pool *pool) const\n{\n    char child_options_buffer[4096];\n    *options.MakeId(child_options_buffer) = 0;\n\n    const char *p = p_strcat(pool, path,\n                             child_options_buffer,\n                             nullptr);\n\n    for (auto i : args)\n        p = p_strcat(pool, p, \"!\", i, nullptr);\n\n    return p;\n}\n\nconst char *\nLhttpAddress::GetId(struct pool *pool) const\n{\n    const char *p = GetServerId(pool);\n\n    if (uri != nullptr)\n        p = p_strcat(pool, p, \";u=\", uri, nullptr);\n\n    return p;\n}\n\nLhttpAddress *\nLhttpAddress::Dup(struct pool &pool) const\n{\n    return NewFromPool<LhttpAddress>(pool, pool, *this);\n}\n\nbool\nLhttpAddress::Check(GError **error_r) const\n{\n    if (uri == nullptr) {\n        g_set_error_literal(error_r, translate_quark(), 0,\n                            \"missing LHTTP_URI\");\n        return false;\n    }\n\n    return options.Check(error_r);\n}\n\nLhttpAddress *\nLhttpAddress::DupWithUri(struct pool &pool, const char *new_uri) const\n{\n    LhttpAddress *p = Dup(pool);\n    p->uri = new_uri;\n    return p;\n}\n\nbool\nLhttpAddress::HasQueryString() const\n{\n    return strchr(uri, '?') != nullptr;\n}\n\nLhttpAddress *\nLhttpAddress::InsertQueryString(struct pool &pool,\n                                const char *query_string) const\n{\n    return DupWithUri(pool, uri_insert_query_string(&pool, uri, query_string));\n}\n\nLhttpAddress *\nLhttpAddress::InsertArgs(struct pool &pool,\n                          const char *new_args, size_t new_args_length,\n                          const char *path_info, size_t path_info_length) const\n{\n    return DupWithUri(pool,\n                      uri_insert_args(&pool, uri,\n                                      new_args, new_args_length,\n                                      path_info, path_info_length));\n}\n\nbool\nLhttpAddress::IsValidBase() const\n{\n    return IsExpandable() || is_base(uri);\n}\n\nLhttpAddress *\nLhttpAddress::SaveBase(struct pool *pool, const char *suffix) const\n{\n    assert(pool != nullptr);\n    assert(suffix != nullptr);\n\n    size_t length = base_string(uri, suffix);\n    if (length == (size_t)-1)\n        return nullptr;\n\n    return DupWithUri(*pool, p_strndup(pool, uri, length));\n}\n\nLhttpAddress *\nLhttpAddress::LoadBase(struct pool *pool, const char *suffix) const\n{\n    assert(pool != nullptr);\n    assert(suffix != nullptr);\n    assert(uri != nullptr);\n    assert(*uri != 0);\n    assert(uri[strlen(uri) - 1] == '\/');\n    assert(suffix != nullptr);\n\n    return DupWithUri(*pool, p_strcat(pool, uri, suffix, nullptr));\n}\n\nconst LhttpAddress *\nLhttpAddress::Apply(struct pool *pool, const char *relative,\n                     size_t relative_length) const\n{\n    if (relative_length == 0)\n        return this;\n\n    if (uri_has_authority({relative, relative_length}))\n        return nullptr;\n\n    const char *p = uri_absolute(pool, path,\n                                 relative, relative_length);\n    assert(p != nullptr);\n\n    return DupWithUri(*pool, p);\n}\n\nStringView\nLhttpAddress::RelativeTo(const LhttpAddress &base) const\n{\n    if (strcmp(base.path, path) != 0)\n        return nullptr;\n\n    StringView uri2(uri);\n    return uri_relative(base.uri, uri2);\n}\n\nbool\nLhttpAddress::Expand(struct pool *pool, const MatchInfo &match_info,\n                      Error &error_r)\n{\n    assert(pool != NULL);\n\n    if (!options.Expand(*pool, match_info, error_r))\n        return false;\n\n    if (expand_uri != NULL) {\n        uri = expand_string(pool, expand_uri, match_info, error_r);\n        if (uri == NULL)\n            return false;\n    }\n\n    return args.Expand(pool, match_info, error_r);\n}\n\nbool\nLhttpAddress::CopyTo(PreparedChildProcess &dest, GError **error_r) const\n{\n    dest.Append(path);\n\n    for (const char *i : args)\n        dest.Append(i);\n\n    return options.CopyTo(dest, true, nullptr, error_r);\n}\n<commit_msg>lhttp_address: use ChildOptions copy constructor<commit_after>\/*\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"lhttp_address.hxx\"\n#include \"pool.hxx\"\n#include \"uri\/uri_base.hxx\"\n#include \"uri\/uri_relative.hxx\"\n#include \"uri\/uri_escape.hxx\"\n#include \"uri\/uri_extract.hxx\"\n#include \"puri_edit.hxx\"\n#include \"puri_relative.hxx\"\n#include \"pexpand.hxx\"\n#include \"translate_quark.hxx\"\n#include \"spawn\/Prepared.hxx\"\n#include \"util\/StringView.hxx\"\n\n#include <string.h>\n\nLhttpAddress::LhttpAddress(const char *_path)\n    :path(_path),\n     host_and_port(nullptr),\n     uri(nullptr), expand_uri(nullptr),\n     concurrency(1),\n     blocking(true)\n{\n    assert(path != nullptr);\n\n    args.Init();\n    options.Init();\n}\n\nLhttpAddress::LhttpAddress(struct pool &pool, const LhttpAddress &src)\n    :path(p_strdup(&pool, src.path)),\n     args(pool, src.args),\n     options(&pool, src.options),\n     host_and_port(p_strdup_checked(&pool, src.host_and_port)),\n     uri(p_strdup(&pool, src.uri)),\n     expand_uri(p_strdup_checked(&pool, src.expand_uri)),\n     concurrency(src.concurrency),\n     blocking(src.blocking)\n{\n}\n\nconst char *\nLhttpAddress::GetServerId(struct pool *pool) const\n{\n    char child_options_buffer[4096];\n    *options.MakeId(child_options_buffer) = 0;\n\n    const char *p = p_strcat(pool, path,\n                             child_options_buffer,\n                             nullptr);\n\n    for (auto i : args)\n        p = p_strcat(pool, p, \"!\", i, nullptr);\n\n    return p;\n}\n\nconst char *\nLhttpAddress::GetId(struct pool *pool) const\n{\n    const char *p = GetServerId(pool);\n\n    if (uri != nullptr)\n        p = p_strcat(pool, p, \";u=\", uri, nullptr);\n\n    return p;\n}\n\nLhttpAddress *\nLhttpAddress::Dup(struct pool &pool) const\n{\n    return NewFromPool<LhttpAddress>(pool, pool, *this);\n}\n\nbool\nLhttpAddress::Check(GError **error_r) const\n{\n    if (uri == nullptr) {\n        g_set_error_literal(error_r, translate_quark(), 0,\n                            \"missing LHTTP_URI\");\n        return false;\n    }\n\n    return options.Check(error_r);\n}\n\nLhttpAddress *\nLhttpAddress::DupWithUri(struct pool &pool, const char *new_uri) const\n{\n    LhttpAddress *p = Dup(pool);\n    p->uri = new_uri;\n    return p;\n}\n\nbool\nLhttpAddress::HasQueryString() const\n{\n    return strchr(uri, '?') != nullptr;\n}\n\nLhttpAddress *\nLhttpAddress::InsertQueryString(struct pool &pool,\n                                const char *query_string) const\n{\n    return DupWithUri(pool, uri_insert_query_string(&pool, uri, query_string));\n}\n\nLhttpAddress *\nLhttpAddress::InsertArgs(struct pool &pool,\n                          const char *new_args, size_t new_args_length,\n                          const char *path_info, size_t path_info_length) const\n{\n    return DupWithUri(pool,\n                      uri_insert_args(&pool, uri,\n                                      new_args, new_args_length,\n                                      path_info, path_info_length));\n}\n\nbool\nLhttpAddress::IsValidBase() const\n{\n    return IsExpandable() || is_base(uri);\n}\n\nLhttpAddress *\nLhttpAddress::SaveBase(struct pool *pool, const char *suffix) const\n{\n    assert(pool != nullptr);\n    assert(suffix != nullptr);\n\n    size_t length = base_string(uri, suffix);\n    if (length == (size_t)-1)\n        return nullptr;\n\n    return DupWithUri(*pool, p_strndup(pool, uri, length));\n}\n\nLhttpAddress *\nLhttpAddress::LoadBase(struct pool *pool, const char *suffix) const\n{\n    assert(pool != nullptr);\n    assert(suffix != nullptr);\n    assert(uri != nullptr);\n    assert(*uri != 0);\n    assert(uri[strlen(uri) - 1] == '\/');\n    assert(suffix != nullptr);\n\n    return DupWithUri(*pool, p_strcat(pool, uri, suffix, nullptr));\n}\n\nconst LhttpAddress *\nLhttpAddress::Apply(struct pool *pool, const char *relative,\n                     size_t relative_length) const\n{\n    if (relative_length == 0)\n        return this;\n\n    if (uri_has_authority({relative, relative_length}))\n        return nullptr;\n\n    const char *p = uri_absolute(pool, path,\n                                 relative, relative_length);\n    assert(p != nullptr);\n\n    return DupWithUri(*pool, p);\n}\n\nStringView\nLhttpAddress::RelativeTo(const LhttpAddress &base) const\n{\n    if (strcmp(base.path, path) != 0)\n        return nullptr;\n\n    StringView uri2(uri);\n    return uri_relative(base.uri, uri2);\n}\n\nbool\nLhttpAddress::Expand(struct pool *pool, const MatchInfo &match_info,\n                      Error &error_r)\n{\n    assert(pool != NULL);\n\n    if (!options.Expand(*pool, match_info, error_r))\n        return false;\n\n    if (expand_uri != NULL) {\n        uri = expand_string(pool, expand_uri, match_info, error_r);\n        if (uri == NULL)\n            return false;\n    }\n\n    return args.Expand(pool, match_info, error_r);\n}\n\nbool\nLhttpAddress::CopyTo(PreparedChildProcess &dest, GError **error_r) const\n{\n    dest.Append(path);\n\n    for (const char *i : args)\n        dest.Append(i);\n\n    return options.CopyTo(dest, true, nullptr, error_r);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* (C) 2015,2016,2017 Jack Lloyd\n* (C) 2016 Daniel Neus\n*\n* Botan is released under the Simplified BSD License (see license.txt)\n*\/\n\n#include <botan\/internal\/socket.h>\n#include <botan\/exceptn.h>\n#include <botan\/mem_ops.h>\n#include <chrono>\n\n#if defined(BOTAN_HAS_BOOST_ASIO)\n  \/*\n  * We don't need serial port support anyway, and asking for it causes\n  * macro conflicts with termios.h when this file is included in the\n  * amalgamation.\n  *\/\n  #define BOOST_ASIO_DISABLE_SERIAL_PORT\n  #include <boost\/asio.hpp>\n  #include <boost\/asio\/system_timer.hpp>\n\n#elif defined(BOTAN_TARGET_OS_HAS_SOCKETS)\n  #include <sys\/socket.h>\n  #include <sys\/time.h>\n  #include <netinet\/in.h>\n  #include <netdb.h>\n  #include <string.h>\n  #include <unistd.h>\n  #include <errno.h>\n  #include <fcntl.h>\n\n#elif defined(BOTAN_TARGET_OS_HAS_WINSOCK2)\n  #define NOMINMAX 1\n  #include <winsock2.h>\n  #include <ws2tcpip.h>\n  #include <windows.h>\n#endif\n\nnamespace Botan {\n\nnamespace {\n\n#if defined(BOTAN_HAS_BOOST_ASIO)\n\nclass Asio_Socket final : public OS::Socket\n   {\n   public:\n      Asio_Socket(const std::string& hostname,\n                  const std::string& service,\n                  std::chrono::milliseconds timeout) :\n         m_timeout(timeout), m_timer(m_io), m_tcp(m_io)\n         {\n         m_timer.expires_from_now(m_timeout);\n         check_timeout();\n\n         boost::asio::ip::tcp::resolver resolver(m_io);\n         boost::asio::ip::tcp::resolver::query query(hostname, service);\n         boost::asio::ip::tcp::resolver::iterator dns_iter = resolver.resolve(query);\n\n         boost::system::error_code ec = boost::asio::error::would_block;\n\n         auto connect_cb = [&ec](const boost::system::error_code& e,\n                                 boost::asio::ip::tcp::resolver::iterator) { ec = e; };\n\n         boost::asio::async_connect(m_tcp, dns_iter, connect_cb);\n\n         while(ec == boost::asio::error::would_block)\n            {\n            m_io.run_one();\n            }\n\n         if(ec)\n            throw boost::system::system_error(ec);\n         if(ec || m_tcp.is_open() == false)\n            throw System_Error(\"Connection to host \" + hostname + \" failed\");\n         }\n\n      void write(const uint8_t buf[], size_t len) override\n         {\n         m_timer.expires_from_now(m_timeout);\n\n         boost::system::error_code ec = boost::asio::error::would_block;\n\n         boost::asio::async_write(m_tcp, boost::asio::buffer(buf, len),\n                                  [&ec](boost::system::error_code e, size_t) { ec = e; });\n\n         while(ec == boost::asio::error::would_block) { m_io.run_one(); }\n\n         if(ec)\n            {\n            throw boost::system::system_error(ec);\n            }\n         }\n\n      size_t read(uint8_t buf[], size_t len) override\n         {\n         m_timer.expires_from_now(m_timeout);\n\n         boost::system::error_code ec = boost::asio::error::would_block;\n         size_t got = 0;\n\n         auto read_cb = [&](const boost::system::error_code cb_ec, size_t cb_got) {\n            ec = cb_ec; got = cb_got;\n         };\n\n         m_tcp.async_read_some(boost::asio::buffer(buf, len), read_cb);\n\n         while(ec == boost::asio::error::would_block) { m_io.run_one(); }\n\n         if(ec)\n            {\n            if(ec == boost::asio::error::eof)\n               return 0;\n            throw boost::system::system_error(ec); \/\/ Some other error.\n            }\n\n         return got;\n         }\n\n   private:\n      void check_timeout()\n         {\n         if(m_tcp.is_open() && m_timer.expires_at() < std::chrono::system_clock::now())\n            {\n            boost::system::error_code err;\n            m_tcp.close(err);\n            }\n\n         m_timer.async_wait(std::bind(&Asio_Socket::check_timeout, this));\n         }\n\n      const std::chrono::milliseconds m_timeout;\n      boost::asio::io_service m_io;\n      boost::asio::system_timer m_timer;\n      boost::asio::ip::tcp::socket m_tcp;\n   };\n\n#elif defined(BOTAN_TARGET_OS_HAS_SOCKETS) || defined(BOTAN_TARGET_OS_HAS_WINSOCK2)\n\nclass BSD_Socket final : public OS::Socket\n   {\n   private:\n#if defined(BOTAN_TARGET_OS_HAS_WINSOCK2)\n      typedef SOCKET socket_type;\n      typedef int socket_op_ret_type;\n      typedef int socklen_type;\n      static socket_type invalid_socket() { return INVALID_SOCKET; }\n      static void close_socket(socket_type s) { ::closesocket(s); }\n      static std::string get_last_socket_error() { return std::to_string(::WSAGetLastError()); }\n\n      static bool nonblocking_connect_in_progress()\n         {\n         return (::WSAGetLastError() == WSAEWOULDBLOCK);\n         }\n\n      static void set_nonblocking(socket_type s)\n         {\n         u_long nonblocking = 1;\n         ::ioctlsocket(s, FIONBIO, &nonblocking);\n         }\n\n      static void socket_init()\n         {\n         WSAData wsa_data;\n         WORD wsa_version = MAKEWORD(2, 2);\n\n         if (::WSAStartup(wsa_version, &wsa_data) != 0)\n            {\n            throw System_Error(\"WSAStartup() failed\", WSAGetLastError());\n            }\n\n         if (LOBYTE(wsa_data.wVersion) != 2 || HIBYTE(wsa_data.wVersion) != 2)\n            {\n            ::WSACleanup();\n            throw System_Error(\"Could not find a usable version of Winsock.dll\");\n            }\n         }\n\n      static void socket_fini()\n         {\n         ::WSACleanup();\n         }\n#else\n      typedef int socket_type;\n      typedef ssize_t socket_op_ret_type;\n      typedef socklen_t socklen_type;\n      static socket_type invalid_socket() { return -1; }\n      static void close_socket(socket_type s) { ::close(s); }\n      static std::string get_last_socket_error() { return ::strerror(errno); }\n      static bool nonblocking_connect_in_progress() { return (errno == EINPROGRESS); }\n      static void set_nonblocking(socket_type s)\n         {\n         if(::fcntl(s, F_SETFL, O_NONBLOCK) < 0)\n            throw System_Error(\"Setting socket to non-blocking state failed\", errno);\n         }\n\n      static void socket_init() {}\n      static void socket_fini() {}\n#endif\n\n   public:\n      BSD_Socket(const std::string& hostname,\n                 const std::string& service,\n                 std::chrono::microseconds timeout) : m_timeout(timeout)\n         {\n         socket_init();\n\n         m_socket = invalid_socket();\n\n         addrinfo hints;\n         clear_mem(&hints, 1);\n         hints.ai_family = AF_UNSPEC;\n         hints.ai_socktype = SOCK_STREAM;\n         addrinfo* res;\n\n         int rc = ::getaddrinfo(hostname.c_str(), service.c_str(), &hints, &res);\n\n         if(rc != 0)\n            {\n            throw System_Error(\"Name resolution failed for \" + hostname, rc);\n            }\n\n         for(addrinfo* rp = res; (m_socket == invalid_socket()) && (rp != nullptr); rp = rp->ai_next)\n            {\n            if(rp->ai_family != AF_INET && rp->ai_family != AF_INET6)\n               continue;\n\n            m_socket = ::socket(rp->ai_family, rp->ai_socktype, rp->ai_protocol);\n\n            if(m_socket == invalid_socket())\n               {\n               \/\/ unsupported socket type?\n               continue;\n               }\n\n            set_nonblocking(m_socket);\n\n            int err = ::connect(m_socket, rp->ai_addr, static_cast<socklen_type>(rp->ai_addrlen));\n\n            if(err == -1)\n               {\n               int active = 0;\n               if(nonblocking_connect_in_progress())\n                  {\n                  struct timeval timeout_tv = make_timeout_tv();\n                  fd_set write_set;\n                  FD_ZERO(&write_set);\n                  \/\/ Weirdly, Winsock uses a SOCKET type but wants FD_SET to get an int instead\n                  FD_SET(static_cast<int>(m_socket), &write_set);\n\n                  active = ::select(m_socket + 1, nullptr, &write_set, nullptr, &timeout_tv);\n\n                  if(active)\n                     {\n                     int socket_error = 0;\n                     socklen_t len = sizeof(socket_error);\n\n                     if(::getsockopt(m_socket, SOL_SOCKET, SO_ERROR, reinterpret_cast<char*>(&socket_error), &len) < 0)\n                        throw System_Error(\"Error calling getsockopt\", errno);\n\n                     if(socket_error != 0)\n                        {\n                        active = 0;\n                        }\n                     }\n                  }\n\n               if(active == 0)\n                  {\n                  close_socket(m_socket);\n                  m_socket = invalid_socket();\n                  continue;\n                  }\n               }\n            }\n\n         ::freeaddrinfo(res);\n\n         if(m_socket == invalid_socket())\n            {\n            throw System_Error(\"Connecting to \" + hostname +\n                                \" for service \" + service + \" failed\", errno);\n            }\n         }\n\n      ~BSD_Socket()\n         {\n         close_socket(m_socket);\n         m_socket = invalid_socket();\n         socket_fini();\n         }\n\n      void write(const uint8_t buf[], size_t len) override\n         {\n         fd_set write_set;\n         FD_ZERO(&write_set);\n         FD_SET(m_socket, &write_set);\n\n         size_t sent_so_far = 0;\n         while(sent_so_far != len)\n            {\n            struct timeval timeout = make_timeout_tv();\n            int active = ::select(m_socket + 1, nullptr, &write_set, nullptr, &timeout);\n\n            if(active == 0)\n               throw System_Error(\"Timeout during socket write\");\n\n            const size_t left = len - sent_so_far;\n            socket_op_ret_type sent = ::send(m_socket, cast_uint8_ptr_to_char(&buf[sent_so_far]), left, 0);\n            if(sent < 0)\n               throw System_Error(\"Socket write failed\", errno);\n            else\n               sent_so_far += static_cast<size_t>(sent);\n            }\n         }\n\n      size_t read(uint8_t buf[], size_t len) override\n         {\n         fd_set read_set;\n         FD_ZERO(&read_set);\n         FD_SET(m_socket, &read_set);\n\n         struct timeval timeout = make_timeout_tv();\n         int active = ::select(m_socket + 1, &read_set, nullptr, nullptr, &timeout);\n\n         if(active == 0)\n            throw System_Error(\"Timeout during socket read\");\n\n         socket_op_ret_type got = ::recv(m_socket, cast_uint8_ptr_to_char(buf), len, 0);\n\n         if(got < 0)\n            throw System_Error(\"Socket read failed\", errno);\n\n         return static_cast<size_t>(got);\n         }\n\n   private:\n      struct timeval make_timeout_tv() const\n         {\n         struct timeval tv;\n         tv.tv_sec = static_cast<time_t>(m_timeout.count() \/ 1000000);\n         tv.tv_usec = static_cast<long>(m_timeout.count() % 1000000);;\n         return tv;\n         }\n\n      const std::chrono::microseconds m_timeout;\n      socket_type m_socket;\n   };\n\n#endif\n\n}\n\nstd::unique_ptr<OS::Socket>\nOS::open_socket(const std::string& hostname,\n                const std::string& service,\n                std::chrono::milliseconds timeout)\n   {\n#if defined(BOTAN_HAS_BOOST_ASIO)\n   return std::unique_ptr<OS::Socket>(new Asio_Socket(hostname, service, timeout));\n\n#elif defined(BOTAN_TARGET_OS_HAS_SOCKETS) || defined(BOTAN_TARGET_OS_HAS_WINSOCK2)\n   return std::unique_ptr<OS::Socket>(new BSD_Socket(hostname, service, timeout));\n\n#else\n   \/\/ No sockets for you\n   return std::unique_ptr<Socket>();\n#endif\n   }\n\n}\n<commit_msg>Style fix * remove always false ec check * make write and read some similar: use asio member functions and anonymous lambda in both<commit_after>\/*\n* (C) 2015,2016,2017 Jack Lloyd\n* (C) 2016 Daniel Neus\n*\n* Botan is released under the Simplified BSD License (see license.txt)\n*\/\n\n#include <botan\/internal\/socket.h>\n#include <botan\/exceptn.h>\n#include <botan\/mem_ops.h>\n#include <chrono>\n\n#if defined(BOTAN_HAS_BOOST_ASIO)\n  \/*\n  * We don't need serial port support anyway, and asking for it causes\n  * macro conflicts with termios.h when this file is included in the\n  * amalgamation.\n  *\/\n  #define BOOST_ASIO_DISABLE_SERIAL_PORT\n  #include <boost\/asio.hpp>\n  #include <boost\/asio\/system_timer.hpp>\n\n#elif defined(BOTAN_TARGET_OS_HAS_SOCKETS)\n  #include <sys\/socket.h>\n  #include <sys\/time.h>\n  #include <netinet\/in.h>\n  #include <netdb.h>\n  #include <string.h>\n  #include <unistd.h>\n  #include <errno.h>\n  #include <fcntl.h>\n\n#elif defined(BOTAN_TARGET_OS_HAS_WINSOCK2)\n  #include <ws2tcpip.h>\n#endif\n\nnamespace Botan {\n\nnamespace {\n\n#if defined(BOTAN_HAS_BOOST_ASIO)\n\nclass Asio_Socket final : public OS::Socket\n   {\n   public:\n      Asio_Socket(const std::string& hostname,\n                  const std::string& service,\n                  std::chrono::milliseconds timeout) :\n         m_timeout(timeout), m_timer(m_io), m_tcp(m_io)\n         {\n         m_timer.expires_from_now(m_timeout);\n         check_timeout();\n\n         boost::asio::ip::tcp::resolver resolver(m_io);\n         boost::asio::ip::tcp::resolver::query query(hostname, service);\n         boost::asio::ip::tcp::resolver::iterator dns_iter = resolver.resolve(query);\n\n         boost::system::error_code ec = boost::asio::error::would_block;\n\n         auto connect_cb = [&ec](const boost::system::error_code& e,\n                                 boost::asio::ip::tcp::resolver::iterator) { ec = e; };\n\n         boost::asio::async_connect(m_tcp, dns_iter, connect_cb);\n\n         while(ec == boost::asio::error::would_block)\n            {\n            m_io.run_one();\n            }\n\n         if(ec)\n            throw boost::system::system_error(ec);\n         if(m_tcp.is_open() == false)\n            throw System_Error(\"Connection to host \" + hostname + \" failed\");\n         }\n\n      void write(const uint8_t buf[], size_t len) override\n         {\n         m_timer.expires_from_now(m_timeout);\n\n         boost::system::error_code ec = boost::asio::error::would_block;\n\n         m_tcp.async_send(boost::asio::buffer(buf, len),\n                           [&ec](boost::system::error_code e, size_t) { ec = e; });\n\n         while(ec == boost::asio::error::would_block) { m_io.run_one(); }\n\n         if(ec)\n            {\n            throw boost::system::system_error(ec);\n            }\n         }\n\n      size_t read(uint8_t buf[], size_t len) override\n         {\n         m_timer.expires_from_now(m_timeout);\n\n         boost::system::error_code ec = boost::asio::error::would_block;\n         size_t got = 0;\n\n         m_tcp.async_read_some(boost::asio::buffer(buf, len),\n                               [&](boost::system::error_code cb_ec, size_t cb_got) { ec = cb_ec; got = cb_got; });\n\n         while(ec == boost::asio::error::would_block) { m_io.run_one(); }\n\n         if(ec)\n            {\n            if(ec == boost::asio::error::eof)\n               return 0;\n            throw boost::system::system_error(ec); \/\/ Some other error.\n            }\n\n         return got;\n         }\n\n   private:\n      void check_timeout()\n         {\n         if(m_tcp.is_open() && m_timer.expires_at() < std::chrono::system_clock::now())\n            {\n            boost::system::error_code err;\n            m_tcp.close(err);\n            }\n\n         m_timer.async_wait(std::bind(&Asio_Socket::check_timeout, this));\n         }\n\n      const std::chrono::milliseconds m_timeout;\n      boost::asio::io_service m_io;\n      boost::asio::system_timer m_timer;\n      boost::asio::ip::tcp::socket m_tcp;\n   };\n\n#elif defined(BOTAN_TARGET_OS_HAS_SOCKETS) || defined(BOTAN_TARGET_OS_HAS_WINSOCK2)\n\nclass BSD_Socket final : public OS::Socket\n   {\n   private:\n#if defined(BOTAN_TARGET_OS_HAS_WINSOCK2)\n      typedef SOCKET socket_type;\n      typedef int socket_op_ret_type;\n      typedef int socklen_type;\n      static socket_type invalid_socket() { return INVALID_SOCKET; }\n      static void close_socket(socket_type s) { ::closesocket(s); }\n      static std::string get_last_socket_error() { return std::to_string(::WSAGetLastError()); }\n\n      static bool nonblocking_connect_in_progress()\n         {\n         return (::WSAGetLastError() == WSAEWOULDBLOCK);\n         }\n\n      static void set_nonblocking(socket_type s)\n         {\n         u_long nonblocking = 1;\n         ::ioctlsocket(s, FIONBIO, &nonblocking);\n         }\n\n      static void socket_init()\n         {\n         WSAData wsa_data;\n         WORD wsa_version = MAKEWORD(2, 2);\n\n         if (::WSAStartup(wsa_version, &wsa_data) != 0)\n            {\n            throw System_Error(\"WSAStartup() failed\", WSAGetLastError());\n            }\n\n         if (LOBYTE(wsa_data.wVersion) != 2 || HIBYTE(wsa_data.wVersion) != 2)\n            {\n            ::WSACleanup();\n            throw System_Error(\"Could not find a usable version of Winsock.dll\");\n            }\n         }\n\n      static void socket_fini()\n         {\n         ::WSACleanup();\n         }\n#else\n      typedef int socket_type;\n      typedef ssize_t socket_op_ret_type;\n      typedef socklen_t socklen_type;\n      static socket_type invalid_socket() { return -1; }\n      static void close_socket(socket_type s) { ::close(s); }\n      static std::string get_last_socket_error() { return ::strerror(errno); }\n      static bool nonblocking_connect_in_progress() { return (errno == EINPROGRESS); }\n      static void set_nonblocking(socket_type s)\n         {\n         if(::fcntl(s, F_SETFL, O_NONBLOCK) < 0)\n            throw System_Error(\"Setting socket to non-blocking state failed\", errno);\n         }\n\n      static void socket_init() {}\n      static void socket_fini() {}\n#endif\n\n   public:\n      BSD_Socket(const std::string& hostname,\n                 const std::string& service,\n                 std::chrono::microseconds timeout) : m_timeout(timeout)\n         {\n         socket_init();\n\n         m_socket = invalid_socket();\n\n         addrinfo hints;\n         clear_mem(&hints, 1);\n         hints.ai_family = AF_UNSPEC;\n         hints.ai_socktype = SOCK_STREAM;\n         addrinfo* res;\n\n         int rc = ::getaddrinfo(hostname.c_str(), service.c_str(), &hints, &res);\n\n         if(rc != 0)\n            {\n            throw System_Error(\"Name resolution failed for \" + hostname, rc);\n            }\n\n         for(addrinfo* rp = res; (m_socket == invalid_socket()) && (rp != nullptr); rp = rp->ai_next)\n            {\n            if(rp->ai_family != AF_INET && rp->ai_family != AF_INET6)\n               continue;\n\n            m_socket = ::socket(rp->ai_family, rp->ai_socktype, rp->ai_protocol);\n\n            if(m_socket == invalid_socket())\n               {\n               \/\/ unsupported socket type?\n               continue;\n               }\n\n            set_nonblocking(m_socket);\n\n            int err = ::connect(m_socket, rp->ai_addr, static_cast<socklen_type>(rp->ai_addrlen));\n\n            if(err == -1)\n               {\n               int active = 0;\n               if(nonblocking_connect_in_progress())\n                  {\n                  struct timeval timeout_tv = make_timeout_tv();\n                  fd_set write_set;\n                  FD_ZERO(&write_set);\n                  \/\/ Weirdly, Winsock uses a SOCKET type but wants FD_SET to get an int instead\n                  FD_SET(static_cast<int>(m_socket), &write_set);\n\n                  active = ::select(m_socket + 1, nullptr, &write_set, nullptr, &timeout_tv);\n\n                  if(active)\n                     {\n                     int socket_error = 0;\n                     socklen_t len = sizeof(socket_error);\n\n                     if(::getsockopt(m_socket, SOL_SOCKET, SO_ERROR, reinterpret_cast<char*>(&socket_error), &len) < 0)\n                        throw System_Error(\"Error calling getsockopt\", errno);\n\n                     if(socket_error != 0)\n                        {\n                        active = 0;\n                        }\n                     }\n                  }\n\n               if(active == 0)\n                  {\n                  close_socket(m_socket);\n                  m_socket = invalid_socket();\n                  continue;\n                  }\n               }\n            }\n\n         ::freeaddrinfo(res);\n\n         if(m_socket == invalid_socket())\n            {\n            throw System_Error(\"Connecting to \" + hostname +\n                                \" for service \" + service + \" failed\", errno);\n            }\n         }\n\n      ~BSD_Socket()\n         {\n         close_socket(m_socket);\n         m_socket = invalid_socket();\n         socket_fini();\n         }\n\n      void write(const uint8_t buf[], size_t len) override\n         {\n         fd_set write_set;\n         FD_ZERO(&write_set);\n         FD_SET(m_socket, &write_set);\n\n         size_t sent_so_far = 0;\n         while(sent_so_far != len)\n            {\n            struct timeval timeout = make_timeout_tv();\n            int active = ::select(m_socket + 1, nullptr, &write_set, nullptr, &timeout);\n\n            if(active == 0)\n               throw System_Error(\"Timeout during socket write\");\n\n            const size_t left = len - sent_so_far;\n            socket_op_ret_type sent = ::send(m_socket, cast_uint8_ptr_to_char(&buf[sent_so_far]), left, 0);\n            if(sent < 0)\n               throw System_Error(\"Socket write failed\", errno);\n            else\n               sent_so_far += static_cast<size_t>(sent);\n            }\n         }\n\n      size_t read(uint8_t buf[], size_t len) override\n         {\n         fd_set read_set;\n         FD_ZERO(&read_set);\n         FD_SET(m_socket, &read_set);\n\n         struct timeval timeout = make_timeout_tv();\n         int active = ::select(m_socket + 1, &read_set, nullptr, nullptr, &timeout);\n\n         if(active == 0)\n            throw System_Error(\"Timeout during socket read\");\n\n         socket_op_ret_type got = ::recv(m_socket, cast_uint8_ptr_to_char(buf), len, 0);\n\n         if(got < 0)\n            throw System_Error(\"Socket read failed\", errno);\n\n         return static_cast<size_t>(got);\n         }\n\n   private:\n      struct timeval make_timeout_tv() const\n         {\n         struct timeval tv;\n         tv.tv_sec = static_cast<time_t>(m_timeout.count() \/ 1000000);\n         tv.tv_usec = static_cast<long>(m_timeout.count() % 1000000);;\n         return tv;\n         }\n\n      const std::chrono::microseconds m_timeout;\n      socket_type m_socket;\n   };\n\n#endif\n\n}\n\nstd::unique_ptr<OS::Socket>\nOS::open_socket(const std::string& hostname,\n                const std::string& service,\n                std::chrono::milliseconds timeout)\n   {\n#if defined(BOTAN_HAS_BOOST_ASIO)\n   return std::unique_ptr<OS::Socket>(new Asio_Socket(hostname, service, timeout));\n\n#elif defined(BOTAN_TARGET_OS_HAS_SOCKETS) || defined(BOTAN_TARGET_OS_HAS_WINSOCK2)\n   return std::unique_ptr<OS::Socket>(new BSD_Socket(hostname, service, timeout));\n\n#else\n   \/\/ No sockets for you\n   return std::unique_ptr<Socket>();\n#endif\n   }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"primops.hh\"\n#include \"eval-inline.hh\"\n\n#include \"..\/..\/toml11\/toml.hpp\"\n\nnamespace nix {\n\nstatic void prim_fromTOML(EvalState & state, const Pos & pos, Value * * args, Value & val)\n{\n    auto toml = state.forceStringNoCtx(*args[0], pos);\n\n    std::istringstream tomlStream(toml);\n\n    std::function<void(Value &, toml::value)> visit;\n\n    visit = [&](Value & v, toml::value t) {\n\n        switch(t.type())\n        {\n            case toml::value_t::table:\n                {\n                    auto table = toml::get<toml::table>(t);\n\n                    size_t size = 0;\n                    for (auto & i : table) { (void) i; size++; }\n\n                    state.mkAttrs(v, size);\n\n                    for(auto & elem: table) {\n\n                        auto & v2 = *state.allocAttr(v, state.symbols.create(elem.first));\n\n                        \/\/ TODO: note about creating children here in old code\n                        visit(v2, elem.second);\n                    }\n                }\n                break;;\n            case toml::value_t::array:\n                {\n                    auto array = toml::get<std::vector<toml::value>>(t);\n\n                    size_t size = array.size();\n                    state.mkList(v, size);\n                    for (size_t i = 0; i < size; ++i)\n                        visit(*(v.listElems()[i] = state.allocValue()), array[i]);\n                }\n                break;;\n            case toml::value_t::boolean:\n                mkBool(v, toml::get<bool>(t));\n                break;;\n            case toml::value_t::integer:\n                mkInt(v, toml::get<long>(t));\n                break;;\n            case toml::value_t::floating:\n                mkFloat(v, toml::get<double>(t));\n                break;;\n            case toml::value_t::string:\n                mkString(v, toml::get<std::string>(t));\n                break;;\n            case toml::value_t::local_datetime:\n            case toml::value_t::offset_datetime:\n            case toml::value_t::local_date:\n            case toml::value_t::local_time:\n                \/\/ TODO: convert to string?\n                throw std::runtime_error(\"Dates and times are not supported\");\n                break;;\n            case toml::value_t::empty:\n                mkNull(v);\n                break;;\n\n        }\n    };\n\n    try {\n        visit(val, toml::parse(tomlStream)); \/\/ TODO give filename\n    } catch (std::exception & e) { \/\/ TODO: toml::syntax_error\n        throw EvalError({\n            .msg = hintfmt(\"while parsing a TOML string: %s\", e.what()),\n            .errPos = pos\n        });\n    }\n}\n\nstatic RegisterPrimOp primop_fromTOML(\"fromTOML\", 1, prim_fromTOML);\n\n}\n<commit_msg>Clean up toml parsing code<commit_after>#include \"primops.hh\"\n#include \"eval-inline.hh\"\n\n#include \"..\/..\/toml11\/toml.hpp\"\n\nnamespace nix {\n\nstatic void prim_fromTOML(EvalState & state, const Pos & pos, Value * * args, Value & val)\n{\n    auto toml = state.forceStringNoCtx(*args[0], pos);\n\n    std::istringstream tomlStream(toml);\n\n    std::function<void(Value &, toml::value)> visit;\n\n    visit = [&](Value & v, toml::value t) {\n\n        switch(t.type())\n        {\n            case toml::value_t::table:\n                {\n                    auto table = toml::get<toml::table>(t);\n\n                    size_t size = 0;\n                    for (auto & i : table) { (void) i; size++; }\n\n                    state.mkAttrs(v, size);\n\n                    for(auto & elem: table) {\n\n                        auto & v2 = *state.allocAttr(v, state.symbols.create(elem.first));\n                        visit(v2, elem.second);\n                    }\n                }\n                break;;\n            case toml::value_t::array:\n                {\n                    auto array = toml::get<std::vector<toml::value>>(t);\n\n                    size_t size = array.size();\n                    state.mkList(v, size);\n                    for (size_t i = 0; i < size; ++i)\n                        visit(*(v.listElems()[i] = state.allocValue()), array[i]);\n                }\n                break;;\n            case toml::value_t::boolean:\n                mkBool(v, toml::get<bool>(t));\n                break;;\n            case toml::value_t::integer:\n                mkInt(v, toml::get<long>(t));\n                break;;\n            case toml::value_t::floating:\n                mkFloat(v, toml::get<double>(t));\n                break;;\n            case toml::value_t::string:\n                mkString(v, toml::get<std::string>(t));\n                break;;\n            case toml::value_t::local_datetime:\n            case toml::value_t::offset_datetime:\n            case toml::value_t::local_date:\n            case toml::value_t::local_time:\n                \/\/ We fail since Nix doesn't have date and time types\n                throw std::runtime_error(\"Dates and times are not supported\");\n                break;;\n            case toml::value_t::empty:\n                mkNull(v);\n                break;;\n\n        }\n    };\n\n    try {\n        visit(val, toml::parse(tomlStream, \"fromTOML\" \/* the \"filename\" *\/));\n    } catch (std::exception & e) { \/\/ TODO: toml::syntax_error\n        throw EvalError({\n            .msg = hintfmt(\"while parsing a TOML string: %s\", e.what()),\n            .errPos = pos\n        });\n    }\n}\n\nstatic RegisterPrimOp primop_fromTOML(\"fromTOML\", 1, prim_fromTOML);\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- RegAllocSimple.cpp - A simple generic register allocator ----------===\/\/\n\/\/\n\/\/ This file implements a simple register allocator. *Very* simple.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/CodeGen\/MachineFunction.h\"\n#include \"llvm\/CodeGen\/MachineInstr.h\"\n#include \"llvm\/Target\/MachineInstrInfo.h\"\n#include \"llvm\/Target\/TargetMachine.h\"\n#include \"Support\/Statistic.h\"\n#include <iostream>\n#include <set>\n\nnamespace {\n  Statistic<> NumSpilled (\"ra-simple\", \"Number of registers spilled\");\n  Statistic<> NumReloaded(\"ra-simple\", \"Number of registers reloaded\");\n\n  class RegAllocSimple : public FunctionPass {\n    TargetMachine &TM;\n    MachineFunction *MF;\n    const MRegisterInfo *RegInfo;\n    unsigned NumBytesAllocated;\n    \n    \/\/ Maps SSA Regs => offsets on the stack where these values are stored\n    std::map<unsigned, unsigned> VirtReg2OffsetMap;\n\n    \/\/ RegsUsed - Keep track of what registers are currently in use.\n    std::set<unsigned> RegsUsed;\n\n    \/\/ RegClassIdx - Maps RegClass => which index we can take a register\n    \/\/ from. Since this is a simple register allocator, when we need a register\n    \/\/ of a certain class, we just take the next available one.\n    std::map<const TargetRegisterClass*, unsigned> RegClassIdx;\n\n  public:\n\n    RegAllocSimple(TargetMachine &tm)\n      : TM(tm), RegInfo(tm.getRegisterInfo()) {\n      RegsUsed.insert(RegInfo->getFramePointer());\n      RegsUsed.insert(RegInfo->getStackPointer());\n\n      cleanupAfterFunction();\n    }\n\n    bool runOnFunction(Function &Fn) {\n      return runOnMachineFunction(MachineFunction::get(&Fn));\n    }\n\n    virtual const char *getPassName() const {\n      return \"Simple Register Allocator\";\n    }\n\n  private:\n    \/\/\/ runOnMachineFunction - Register allocate the whole function\n    bool runOnMachineFunction(MachineFunction &Fn);\n\n    \/\/\/ AllocateBasicBlock - Register allocate the specified basic block.\n    void AllocateBasicBlock(MachineBasicBlock &MBB);\n\n    \/\/\/ EliminatePHINodes - Eliminate phi nodes by inserting copy instructions\n    \/\/\/ in predecessor basic blocks.\n    void EliminatePHINodes(MachineBasicBlock &MBB);\n\n\n    \/\/\/ getStackSpaceFor - This returns the offset of the specified virtual\n    \/\/\/ register on the stack, allocating space if neccesary.\n    unsigned getStackSpaceFor(unsigned VirtReg, \n                              const TargetRegisterClass *regClass);\n\n    \/\/\/ Given a virtual register, return a compatible physical register that is\n    \/\/\/ currently unused.\n    \/\/\/\n    \/\/\/ Side effect: marks that register as being used until manually cleared\n    \/\/\/\n    unsigned getFreeReg(unsigned virtualReg);\n\n    \/\/\/ Returns all `borrowed' registers back to the free pool\n    void clearAllRegs() {\n      RegClassIdx.clear();\n    }\n\n    \/\/\/ Invalidates any references, real or implicit, to physical registers\n    \/\/\/\n    void invalidatePhysRegs(const MachineInstr *MI) {\n      unsigned Opcode = MI->getOpcode();\n      const MachineInstrDescriptor &Desc = TM.getInstrInfo().get(Opcode);\n      const unsigned *regs = Desc.ImplicitUses;\n      while (*regs)\n        RegsUsed.insert(*regs++);\n\n      regs = Desc.ImplicitDefs;\n      while (*regs)\n        RegsUsed.insert(*regs++);\n    }\n\n    void cleanupAfterFunction() {\n      VirtReg2OffsetMap.clear();\n      NumBytesAllocated = 4;   \/\/ FIXME: This is X86 specific\n    }\n\n    \/\/\/ Moves value from memory into that register\n    unsigned reloadVirtReg(MachineBasicBlock &MBB,\n                           MachineBasicBlock::iterator &I, unsigned VirtReg);\n\n    \/\/\/ Saves reg value on the stack (maps virtual register to stack value)\n    void spillVirtReg(MachineBasicBlock &MBB, MachineBasicBlock::iterator &I,\n                      unsigned VirtReg, unsigned PhysReg);\n  };\n\n}\n\n\/\/\/ getStackSpaceFor - This allocates space for the specified virtual\n\/\/\/ register to be held on the stack.\nunsigned RegAllocSimple::getStackSpaceFor(unsigned VirtReg,\n                                          const TargetRegisterClass *regClass) {\n  \/\/ Find the location VirtReg would belong...\n  std::map<unsigned, unsigned>::iterator I =\n    VirtReg2OffsetMap.lower_bound(VirtReg);\n\n  if (I != VirtReg2OffsetMap.end() && I->first == VirtReg)\n    return I->second;          \/\/ Already has space allocated?\n\n  unsigned RegSize = regClass->getDataSize();\n\n  \/\/ Align NumBytesAllocated.  We should be using TargetData alignment stuff\n  \/\/ to determine this, but we don't know the LLVM type associated with the\n  \/\/ virtual register.  Instead, just align to a multiple of the size for now.\n  NumBytesAllocated += RegSize-1;\n  NumBytesAllocated = NumBytesAllocated\/RegSize*RegSize;\n  \n  \/\/ Assign the slot...\n  VirtReg2OffsetMap.insert(I, std::make_pair(VirtReg, NumBytesAllocated));\n  \n  \/\/ Reserve the space!\n  NumBytesAllocated += RegSize;\n  return NumBytesAllocated-RegSize;\n}\n\nunsigned RegAllocSimple::getFreeReg(unsigned virtualReg) {\n  const TargetRegisterClass* regClass = MF->getRegClass(virtualReg);\n  \n  unsigned regIdx = RegClassIdx[regClass]++;\n  assert(regIdx < regClass->getNumRegs() && \"Not enough registers!\");\n  unsigned physReg = regClass->getRegister(regIdx);\n\n  if (RegsUsed.find(physReg) == RegsUsed.end())\n    return physReg;\n  else\n    return getFreeReg(virtualReg);\n}\n\nunsigned RegAllocSimple::reloadVirtReg(MachineBasicBlock &MBB,\n                                       MachineBasicBlock::iterator &I,\n                                       unsigned VirtReg) {\n  const TargetRegisterClass* regClass = MF->getRegClass(VirtReg);\n  unsigned stackOffset = getStackSpaceFor(VirtReg, regClass);\n  unsigned PhysReg = getFreeReg(VirtReg);\n\n  \/\/ Add move instruction(s)\n  ++NumReloaded;\n  I = RegInfo->loadRegOffset2Reg(MBB, I, PhysReg, RegInfo->getFramePointer(),\n                                 -stackOffset, regClass->getDataSize());\n  return PhysReg;\n}\n\nvoid RegAllocSimple::spillVirtReg(MachineBasicBlock &MBB,\n                                  MachineBasicBlock::iterator &I,\n                                  unsigned VirtReg, unsigned PhysReg)\n{\n  const TargetRegisterClass* regClass = MF->getRegClass(VirtReg);\n  unsigned stackOffset = getStackSpaceFor(VirtReg, regClass);\n\n  \/\/ Add move instruction(s)\n  ++NumSpilled;\n  I = RegInfo->storeReg2RegOffset(MBB, I, PhysReg, RegInfo->getFramePointer(),\n                                  -stackOffset, regClass->getDataSize());\n}\n\n\n\/\/\/ EliminatePHINodes - Eliminate phi nodes by inserting copy instructions in\n\/\/\/ predecessor basic blocks.\n\/\/\/\nvoid RegAllocSimple::EliminatePHINodes(MachineBasicBlock &MBB) {\n  const MachineInstrInfo &MII = TM.getInstrInfo();\n\n  while (MBB.front()->getOpcode() == MachineInstrInfo::PHI) {\n    MachineInstr *MI = MBB.front();\n    \/\/ Unlink the PHI node from the basic block... but don't delete the PHI yet\n    MBB.erase(MBB.begin());\n    \n    DEBUG(std::cerr << \"num ops: \" << MI->getNumOperands() << \"\\n\");\n    assert(MI->getOperand(0).isVirtualRegister() &&\n           \"PHI node doesn't write virt reg?\");\n\n    unsigned virtualReg = MI->getOperand(0).getAllocatedRegNum();\n    \n    for (int i = MI->getNumOperands() - 1; i >= 2; i-=2) {\n      MachineOperand &opVal = MI->getOperand(i-1);\n      \n      \/\/ Get the MachineBasicBlock equivalent of the BasicBlock that is the\n      \/\/ source path the phi\n      MachineBasicBlock &opBlock = *MI->getOperand(i).getMachineBasicBlock();\n\n      \/\/ Check to make sure we haven't already emitted the copy for this block.\n      \/\/ This can happen because PHI nodes may have multiple entries for the\n      \/\/ same basic block.  It doesn't matter which entry we use though, because\n      \/\/ all incoming values are guaranteed to be the same for a particular bb.\n      \/\/\n      \/\/ Note that this is N^2 in the number of phi node entries, but since the\n      \/\/ # of entries is tiny, this is not a problem.\n      \/\/\n      bool HaveNotEmitted = true;\n      for (int op = MI->getNumOperands() - 1; op != i; op -= 2)\n        if (&opBlock == MI->getOperand(op).getMachineBasicBlock()) {\n          HaveNotEmitted = false;\n          break;\n        }\n\n      if (HaveNotEmitted) {\n        MachineBasicBlock::iterator opI = opBlock.end();\n        MachineInstr *opMI = *--opI;\n        \n        \/\/ must backtrack over ALL the branches in the previous block\n        while (MII.isBranch(opMI->getOpcode()) && opI != opBlock.begin())\n          opMI = *--opI;\n        \n        \/\/ move back to the first branch instruction so new instructions\n        \/\/ are inserted right in front of it and not in front of a non-branch\n        if (!MII.isBranch(opMI->getOpcode()))\n          ++opI;\n\n        unsigned dataSize = MF->getRegClass(virtualReg)->getDataSize();\n\n        \/\/ Retrieve the constant value from this op, move it to target\n        \/\/ register of the phi\n        if (opVal.isImmediate()) {\n          opI = RegInfo->moveImm2Reg(opBlock, opI, virtualReg,\n                                     (unsigned) opVal.getImmedValue(),\n                                     dataSize);\n        } else {\n          opI = RegInfo->moveReg2Reg(opBlock, opI, virtualReg,\n                                     opVal.getAllocatedRegNum(), dataSize);\n        }\n      }\n    }\n    \n    \/\/ really delete the PHI instruction now!\n    delete MI;\n  }\n}\n\n\nvoid RegAllocSimple::AllocateBasicBlock(MachineBasicBlock &MBB) {\n  \/\/ loop over each instruction\n  for (MachineBasicBlock::iterator I = MBB.begin(); I != MBB.end(); ++I) {\n    \/\/ Made to combat the incorrect allocation of r2 = add r1, r1\n    std::map<unsigned, unsigned> Virt2PhysRegMap;\n\n    MachineInstr *MI = *I;\n    \n    \/\/ a preliminary pass that will invalidate any registers that\n    \/\/ are used by the instruction (including implicit uses)\n    invalidatePhysRegs(MI);\n    \n    \/\/ Loop over uses, move from memory into registers\n    for (int i = MI->getNumOperands() - 1; i >= 0; --i) {\n      MachineOperand &op = MI->getOperand(i);\n      \n      if (op.isVirtualRegister()) {\n        unsigned virtualReg = (unsigned) op.getAllocatedRegNum();\n        DEBUG(std::cerr << \"op: \" << op << \"\\n\");\n        DEBUG(std::cerr << \"\\t inst[\" << i << \"]: \";\n              MI->print(std::cerr, TM));\n        \n        \/\/ make sure the same virtual register maps to the same physical\n        \/\/ register in any given instruction\n        unsigned physReg = Virt2PhysRegMap[virtualReg];\n        if (physReg == 0) {\n          if (op.opIsDef()) {\n            if (TM.getInstrInfo().isTwoAddrInstr(MI->getOpcode()) && i == 0) {\n              \/\/ must be same register number as the first operand\n              \/\/ This maps a = b + c into b += c, and saves b into a's spot\n              assert(MI->getOperand(1).isRegister()  &&\n                     MI->getOperand(1).getAllocatedRegNum() &&\n                     MI->getOperand(1).opIsUse() &&\n                     \"Two address instruction invalid!\");\n\n              physReg = MI->getOperand(1).getAllocatedRegNum();\n            } else {\n              physReg = getFreeReg(virtualReg);\n            }\n            ++I;\n            spillVirtReg(MBB, I, virtualReg, physReg);\n            --I;\n          } else {\n            physReg = reloadVirtReg(MBB, I, virtualReg);\n            Virt2PhysRegMap[virtualReg] = physReg;\n          }\n        }\n        MI->SetMachineOperandReg(i, physReg);\n        DEBUG(std::cerr << \"virt: \" << virtualReg << \n              \", phys: \" << op.getAllocatedRegNum() << \"\\n\");\n      }\n    }\n    clearAllRegs();\n  }\n}\n\n\/\/\/ runOnMachineFunction - Register allocate the whole function\n\/\/\/\nbool RegAllocSimple::runOnMachineFunction(MachineFunction &Fn) {\n  DEBUG(std::cerr << \"Machine Function \" << \"\\n\");\n  MF = &Fn;\n\n  \/\/ First pass: eliminate PHI instructions by inserting copies into predecessor\n  \/\/ blocks.\n  for (MachineFunction::iterator MBB = Fn.begin(), MBBe = Fn.end();\n       MBB != MBBe; ++MBB)\n    EliminatePHINodes(*MBB);\n\n  \/\/ Loop over all of the basic blocks, eliminating virtual register references\n  for (MachineFunction::iterator MBB = Fn.begin(), MBBe = Fn.end();\n       MBB != MBBe; ++MBB)\n    AllocateBasicBlock(*MBB);\n\n  \/\/ Add prologue to the function...\n  RegInfo->emitPrologue(Fn, NumBytesAllocated);\n\n  const MachineInstrInfo &MII = TM.getInstrInfo();\n\n  \/\/ Add epilogue to restore the callee-save registers in each exiting block\n  for (MachineFunction::iterator MBB = Fn.begin(), MBBe = Fn.end();\n       MBB != MBBe; ++MBB) {\n    \/\/ If last instruction is a return instruction, add an epilogue\n    if (MII.isReturn(MBB->back()->getOpcode()))\n      RegInfo->emitEpilogue(*MBB, NumBytesAllocated);\n  }\n\n  cleanupAfterFunction();\n  return true;\n}\n\nPass *createSimpleRegisterAllocator(TargetMachine &TM) {\n  return new RegAllocSimple(TM);\n}\n<commit_msg>Keep the stack frame aligned.<commit_after>\/\/===-- RegAllocSimple.cpp - A simple generic register allocator ----------===\/\/\n\/\/\n\/\/ This file implements a simple register allocator. *Very* simple.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/CodeGen\/MachineFunction.h\"\n#include \"llvm\/CodeGen\/MachineInstr.h\"\n#include \"llvm\/Target\/MachineInstrInfo.h\"\n#include \"llvm\/Target\/TargetMachine.h\"\n#include \"Support\/Statistic.h\"\n#include <iostream>\n#include <set>\n\nnamespace {\n  Statistic<> NumSpilled (\"ra-simple\", \"Number of registers spilled\");\n  Statistic<> NumReloaded(\"ra-simple\", \"Number of registers reloaded\");\n\n  class RegAllocSimple : public FunctionPass {\n    TargetMachine &TM;\n    MachineFunction *MF;\n    const MRegisterInfo *RegInfo;\n    unsigned NumBytesAllocated;\n    \n    \/\/ Maps SSA Regs => offsets on the stack where these values are stored\n    std::map<unsigned, unsigned> VirtReg2OffsetMap;\n\n    \/\/ RegsUsed - Keep track of what registers are currently in use.\n    std::set<unsigned> RegsUsed;\n\n    \/\/ RegClassIdx - Maps RegClass => which index we can take a register\n    \/\/ from. Since this is a simple register allocator, when we need a register\n    \/\/ of a certain class, we just take the next available one.\n    std::map<const TargetRegisterClass*, unsigned> RegClassIdx;\n\n  public:\n\n    RegAllocSimple(TargetMachine &tm)\n      : TM(tm), RegInfo(tm.getRegisterInfo()) {\n      RegsUsed.insert(RegInfo->getFramePointer());\n      RegsUsed.insert(RegInfo->getStackPointer());\n\n      cleanupAfterFunction();\n    }\n\n    bool runOnFunction(Function &Fn) {\n      return runOnMachineFunction(MachineFunction::get(&Fn));\n    }\n\n    virtual const char *getPassName() const {\n      return \"Simple Register Allocator\";\n    }\n\n  private:\n    \/\/\/ runOnMachineFunction - Register allocate the whole function\n    bool runOnMachineFunction(MachineFunction &Fn);\n\n    \/\/\/ AllocateBasicBlock - Register allocate the specified basic block.\n    void AllocateBasicBlock(MachineBasicBlock &MBB);\n\n    \/\/\/ EliminatePHINodes - Eliminate phi nodes by inserting copy instructions\n    \/\/\/ in predecessor basic blocks.\n    void EliminatePHINodes(MachineBasicBlock &MBB);\n\n\n    \/\/\/ getStackSpaceFor - This returns the offset of the specified virtual\n    \/\/\/ register on the stack, allocating space if neccesary.\n    unsigned getStackSpaceFor(unsigned VirtReg, \n                              const TargetRegisterClass *regClass);\n\n    \/\/\/ Given a virtual register, return a compatible physical register that is\n    \/\/\/ currently unused.\n    \/\/\/\n    \/\/\/ Side effect: marks that register as being used until manually cleared\n    \/\/\/\n    unsigned getFreeReg(unsigned virtualReg);\n\n    \/\/\/ Returns all `borrowed' registers back to the free pool\n    void clearAllRegs() {\n      RegClassIdx.clear();\n    }\n\n    \/\/\/ Invalidates any references, real or implicit, to physical registers\n    \/\/\/\n    void invalidatePhysRegs(const MachineInstr *MI) {\n      unsigned Opcode = MI->getOpcode();\n      const MachineInstrDescriptor &Desc = TM.getInstrInfo().get(Opcode);\n      const unsigned *regs = Desc.ImplicitUses;\n      while (*regs)\n        RegsUsed.insert(*regs++);\n\n      regs = Desc.ImplicitDefs;\n      while (*regs)\n        RegsUsed.insert(*regs++);\n    }\n\n    void cleanupAfterFunction() {\n      VirtReg2OffsetMap.clear();\n      NumBytesAllocated = 4;   \/\/ FIXME: This is X86 specific\n    }\n\n    \/\/\/ Moves value from memory into that register\n    unsigned reloadVirtReg(MachineBasicBlock &MBB,\n                           MachineBasicBlock::iterator &I, unsigned VirtReg);\n\n    \/\/\/ Saves reg value on the stack (maps virtual register to stack value)\n    void spillVirtReg(MachineBasicBlock &MBB, MachineBasicBlock::iterator &I,\n                      unsigned VirtReg, unsigned PhysReg);\n  };\n\n}\n\n\/\/\/ getStackSpaceFor - This allocates space for the specified virtual\n\/\/\/ register to be held on the stack.\nunsigned RegAllocSimple::getStackSpaceFor(unsigned VirtReg,\n                                          const TargetRegisterClass *regClass) {\n  \/\/ Find the location VirtReg would belong...\n  std::map<unsigned, unsigned>::iterator I =\n    VirtReg2OffsetMap.lower_bound(VirtReg);\n\n  if (I != VirtReg2OffsetMap.end() && I->first == VirtReg)\n    return I->second;          \/\/ Already has space allocated?\n\n  unsigned RegSize = regClass->getDataSize();\n\n  \/\/ Align NumBytesAllocated.  We should be using TargetData alignment stuff\n  \/\/ to determine this, but we don't know the LLVM type associated with the\n  \/\/ virtual register.  Instead, just align to a multiple of the size for now.\n  NumBytesAllocated += RegSize-1;\n  NumBytesAllocated = NumBytesAllocated\/RegSize*RegSize;\n  \n  \/\/ Assign the slot...\n  VirtReg2OffsetMap.insert(I, std::make_pair(VirtReg, NumBytesAllocated));\n  \n  \/\/ Reserve the space!\n  NumBytesAllocated += RegSize;\n  return NumBytesAllocated-RegSize;\n}\n\nunsigned RegAllocSimple::getFreeReg(unsigned virtualReg) {\n  const TargetRegisterClass* regClass = MF->getRegClass(virtualReg);\n  \n  unsigned regIdx = RegClassIdx[regClass]++;\n  assert(regIdx < regClass->getNumRegs() && \"Not enough registers!\");\n  unsigned physReg = regClass->getRegister(regIdx);\n\n  if (RegsUsed.find(physReg) == RegsUsed.end())\n    return physReg;\n  else\n    return getFreeReg(virtualReg);\n}\n\nunsigned RegAllocSimple::reloadVirtReg(MachineBasicBlock &MBB,\n                                       MachineBasicBlock::iterator &I,\n                                       unsigned VirtReg) {\n  const TargetRegisterClass* regClass = MF->getRegClass(VirtReg);\n  unsigned stackOffset = getStackSpaceFor(VirtReg, regClass);\n  unsigned PhysReg = getFreeReg(VirtReg);\n\n  \/\/ Add move instruction(s)\n  ++NumReloaded;\n  I = RegInfo->loadRegOffset2Reg(MBB, I, PhysReg, RegInfo->getFramePointer(),\n                                 -stackOffset, regClass->getDataSize());\n  return PhysReg;\n}\n\nvoid RegAllocSimple::spillVirtReg(MachineBasicBlock &MBB,\n                                  MachineBasicBlock::iterator &I,\n                                  unsigned VirtReg, unsigned PhysReg)\n{\n  const TargetRegisterClass* regClass = MF->getRegClass(VirtReg);\n  unsigned stackOffset = getStackSpaceFor(VirtReg, regClass);\n\n  \/\/ Add move instruction(s)\n  ++NumSpilled;\n  I = RegInfo->storeReg2RegOffset(MBB, I, PhysReg, RegInfo->getFramePointer(),\n                                  -stackOffset, regClass->getDataSize());\n}\n\n\n\/\/\/ EliminatePHINodes - Eliminate phi nodes by inserting copy instructions in\n\/\/\/ predecessor basic blocks.\n\/\/\/\nvoid RegAllocSimple::EliminatePHINodes(MachineBasicBlock &MBB) {\n  const MachineInstrInfo &MII = TM.getInstrInfo();\n\n  while (MBB.front()->getOpcode() == MachineInstrInfo::PHI) {\n    MachineInstr *MI = MBB.front();\n    \/\/ Unlink the PHI node from the basic block... but don't delete the PHI yet\n    MBB.erase(MBB.begin());\n    \n    DEBUG(std::cerr << \"num ops: \" << MI->getNumOperands() << \"\\n\");\n    assert(MI->getOperand(0).isVirtualRegister() &&\n           \"PHI node doesn't write virt reg?\");\n\n    unsigned virtualReg = MI->getOperand(0).getAllocatedRegNum();\n    \n    for (int i = MI->getNumOperands() - 1; i >= 2; i-=2) {\n      MachineOperand &opVal = MI->getOperand(i-1);\n      \n      \/\/ Get the MachineBasicBlock equivalent of the BasicBlock that is the\n      \/\/ source path the phi\n      MachineBasicBlock &opBlock = *MI->getOperand(i).getMachineBasicBlock();\n\n      \/\/ Check to make sure we haven't already emitted the copy for this block.\n      \/\/ This can happen because PHI nodes may have multiple entries for the\n      \/\/ same basic block.  It doesn't matter which entry we use though, because\n      \/\/ all incoming values are guaranteed to be the same for a particular bb.\n      \/\/\n      \/\/ Note that this is N^2 in the number of phi node entries, but since the\n      \/\/ # of entries is tiny, this is not a problem.\n      \/\/\n      bool HaveNotEmitted = true;\n      for (int op = MI->getNumOperands() - 1; op != i; op -= 2)\n        if (&opBlock == MI->getOperand(op).getMachineBasicBlock()) {\n          HaveNotEmitted = false;\n          break;\n        }\n\n      if (HaveNotEmitted) {\n        MachineBasicBlock::iterator opI = opBlock.end();\n        MachineInstr *opMI = *--opI;\n        \n        \/\/ must backtrack over ALL the branches in the previous block\n        while (MII.isBranch(opMI->getOpcode()) && opI != opBlock.begin())\n          opMI = *--opI;\n        \n        \/\/ move back to the first branch instruction so new instructions\n        \/\/ are inserted right in front of it and not in front of a non-branch\n        if (!MII.isBranch(opMI->getOpcode()))\n          ++opI;\n\n        unsigned dataSize = MF->getRegClass(virtualReg)->getDataSize();\n\n        \/\/ Retrieve the constant value from this op, move it to target\n        \/\/ register of the phi\n        if (opVal.isImmediate()) {\n          opI = RegInfo->moveImm2Reg(opBlock, opI, virtualReg,\n                                     (unsigned) opVal.getImmedValue(),\n                                     dataSize);\n        } else {\n          opI = RegInfo->moveReg2Reg(opBlock, opI, virtualReg,\n                                     opVal.getAllocatedRegNum(), dataSize);\n        }\n      }\n    }\n    \n    \/\/ really delete the PHI instruction now!\n    delete MI;\n  }\n}\n\n\nvoid RegAllocSimple::AllocateBasicBlock(MachineBasicBlock &MBB) {\n  \/\/ loop over each instruction\n  for (MachineBasicBlock::iterator I = MBB.begin(); I != MBB.end(); ++I) {\n    \/\/ Made to combat the incorrect allocation of r2 = add r1, r1\n    std::map<unsigned, unsigned> Virt2PhysRegMap;\n\n    MachineInstr *MI = *I;\n    \n    \/\/ a preliminary pass that will invalidate any registers that\n    \/\/ are used by the instruction (including implicit uses)\n    invalidatePhysRegs(MI);\n    \n    \/\/ Loop over uses, move from memory into registers\n    for (int i = MI->getNumOperands() - 1; i >= 0; --i) {\n      MachineOperand &op = MI->getOperand(i);\n      \n      if (op.isVirtualRegister()) {\n        unsigned virtualReg = (unsigned) op.getAllocatedRegNum();\n        DEBUG(std::cerr << \"op: \" << op << \"\\n\");\n        DEBUG(std::cerr << \"\\t inst[\" << i << \"]: \";\n              MI->print(std::cerr, TM));\n        \n        \/\/ make sure the same virtual register maps to the same physical\n        \/\/ register in any given instruction\n        unsigned physReg = Virt2PhysRegMap[virtualReg];\n        if (physReg == 0) {\n          if (op.opIsDef()) {\n            if (TM.getInstrInfo().isTwoAddrInstr(MI->getOpcode()) && i == 0) {\n              \/\/ must be same register number as the first operand\n              \/\/ This maps a = b + c into b += c, and saves b into a's spot\n              assert(MI->getOperand(1).isRegister()  &&\n                     MI->getOperand(1).getAllocatedRegNum() &&\n                     MI->getOperand(1).opIsUse() &&\n                     \"Two address instruction invalid!\");\n\n              physReg = MI->getOperand(1).getAllocatedRegNum();\n            } else {\n              physReg = getFreeReg(virtualReg);\n            }\n            ++I;\n            spillVirtReg(MBB, I, virtualReg, physReg);\n            --I;\n          } else {\n            physReg = reloadVirtReg(MBB, I, virtualReg);\n            Virt2PhysRegMap[virtualReg] = physReg;\n          }\n        }\n        MI->SetMachineOperandReg(i, physReg);\n        DEBUG(std::cerr << \"virt: \" << virtualReg << \n              \", phys: \" << op.getAllocatedRegNum() << \"\\n\");\n      }\n    }\n    clearAllRegs();\n  }\n}\n\n\/\/\/ runOnMachineFunction - Register allocate the whole function\n\/\/\/\nbool RegAllocSimple::runOnMachineFunction(MachineFunction &Fn) {\n  DEBUG(std::cerr << \"Machine Function \" << \"\\n\");\n  MF = &Fn;\n\n  \/\/ First pass: eliminate PHI instructions by inserting copies into predecessor\n  \/\/ blocks.\n  for (MachineFunction::iterator MBB = Fn.begin(), MBBe = Fn.end();\n       MBB != MBBe; ++MBB)\n    EliminatePHINodes(*MBB);\n\n  \/\/ Loop over all of the basic blocks, eliminating virtual register references\n  for (MachineFunction::iterator MBB = Fn.begin(), MBBe = Fn.end();\n       MBB != MBBe; ++MBB)\n    AllocateBasicBlock(*MBB);\n\n  \/\/ Round stack allocation up to a nice alignment to keep the stack aligned\n  \/\/ FIXME: This is X86 specific!  Move to frame manager\n  NumBytesAllocated = (NumBytesAllocated + 3) & ~3;\n\n  \/\/ Add prologue to the function...\n  RegInfo->emitPrologue(Fn, NumBytesAllocated);\n\n  const MachineInstrInfo &MII = TM.getInstrInfo();\n\n  \/\/ Add epilogue to restore the callee-save registers in each exiting block\n  for (MachineFunction::iterator MBB = Fn.begin(), MBBe = Fn.end();\n       MBB != MBBe; ++MBB) {\n    \/\/ If last instruction is a return instruction, add an epilogue\n    if (MII.isReturn(MBB->back()->getOpcode()))\n      RegInfo->emitEpilogue(*MBB, NumBytesAllocated);\n  }\n\n  cleanupAfterFunction();\n  return true;\n}\n\nPass *createSimpleRegisterAllocator(TargetMachine &TM) {\n  return new RegAllocSimple(TM);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- LCSSA.cpp - Convert loops into loop-closed SSA form ---------------===\/\/\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 pass transforms loops by placing phi nodes at the end of the loops for\n\/\/ all values that are live across the loop boundary.  For example, it turns\n\/\/ the left into the right code:\n\/\/ \n\/\/ for (...)                for (...)\n\/\/   if (c)                   if (c)\n\/\/     X1 = ...                 X1 = ...\n\/\/   else                     else\n\/\/     X2 = ...                 X2 = ...\n\/\/   X3 = phi(X1, X2)         X3 = phi(X1, X2)\n\/\/ ... = X3 + 4             X4 = phi(X3)\n\/\/                          ... = X4 + 4\n\/\/\n\/\/ This is still valid LLVM; the extra phi nodes are purely redundant, and will\n\/\/ be trivially eliminated by InstCombine.  The major benefit of this \n\/\/ transformation is that it makes many other loop optimizations, such as \n\/\/ LoopUnswitching, simpler.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Transforms\/Utils\/LCSSA.h\"\n#include \"llvm\/ADT\/STLExtras.h\"\n#include \"llvm\/ADT\/Statistic.h\"\n#include \"llvm\/Analysis\/AliasAnalysis.h\"\n#include \"llvm\/Analysis\/BasicAliasAnalysis.h\"\n#include \"llvm\/Analysis\/GlobalsModRef.h\"\n#include \"llvm\/Analysis\/LoopPass.h\"\n#include \"llvm\/Analysis\/ScalarEvolution.h\"\n#include \"llvm\/Analysis\/ScalarEvolutionAliasAnalysis.h\"\n#include \"llvm\/IR\/Constants.h\"\n#include \"llvm\/IR\/Dominators.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/IR\/Instructions.h\"\n#include \"llvm\/IR\/PredIteratorCache.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/Transforms\/Scalar.h\"\n#include \"llvm\/Transforms\/Utils\/LoopUtils.h\"\n#include \"llvm\/Transforms\/Utils\/SSAUpdater.h\"\nusing namespace llvm;\n\n#define DEBUG_TYPE \"lcssa\"\n\nSTATISTIC(NumLCSSA, \"Number of live out of a loop variables\");\n\n\/\/\/ Return true if the specified block is in the list.\nstatic bool isExitBlock(BasicBlock *BB,\n                        const SmallVectorImpl<BasicBlock *> &ExitBlocks) {\n  return is_contained(ExitBlocks, BB);\n}\n\n\/\/\/ For every instruction from the worklist, check to see if it has any uses\n\/\/\/ that are outside the current loop.  If so, insert LCSSA PHI nodes and\n\/\/\/ rewrite the uses.\nbool llvm::formLCSSAForInstructions(SmallVectorImpl<Instruction *> &Worklist,\n                                    DominatorTree &DT, LoopInfo &LI) {\n  SmallVector<Use *, 16> UsesToRewrite;\n  SmallVector<BasicBlock *, 8> ExitBlocks;\n  SmallSetVector<PHINode *, 16> PHIsToRemove;\n  PredIteratorCache PredCache;\n  bool Changed = false;\n\n  while (!Worklist.empty()) {\n    UsesToRewrite.clear();\n    ExitBlocks.clear();\n\n    Instruction *I = Worklist.pop_back_val();\n    BasicBlock *InstBB = I->getParent();\n    Loop *L = LI.getLoopFor(InstBB);\n    L->getExitBlocks(ExitBlocks);\n\n    if (ExitBlocks.empty())\n      continue;\n\n    \/\/ Tokens cannot be used in PHI nodes, so we skip over them.\n    \/\/ We can run into tokens which are live out of a loop with catchswitch\n    \/\/ instructions in Windows EH if the catchswitch has one catchpad which\n    \/\/ is inside the loop and another which is not.\n    if (I->getType()->isTokenTy())\n      continue;\n\n    for (Use &U : I->uses()) {\n      Instruction *User = cast<Instruction>(U.getUser());\n      BasicBlock *UserBB = User->getParent();\n      if (PHINode *PN = dyn_cast<PHINode>(User))\n        UserBB = PN->getIncomingBlock(U);\n\n      if (InstBB != UserBB && !L->contains(UserBB))\n        UsesToRewrite.push_back(&U);\n    }\n\n    \/\/ If there are no uses outside the loop, exit with no change.\n    if (UsesToRewrite.empty())\n      continue;\n\n    ++NumLCSSA; \/\/ We are applying the transformation\n\n    \/\/ Invoke instructions are special in that their result value is not\n    \/\/ available along their unwind edge. The code below tests to see whether\n    \/\/ DomBB dominates the value, so adjust DomBB to the normal destination\n    \/\/ block, which is effectively where the value is first usable.\n    BasicBlock *DomBB = InstBB;\n    if (InvokeInst *Inv = dyn_cast<InvokeInst>(I))\n      DomBB = Inv->getNormalDest();\n\n    DomTreeNode *DomNode = DT.getNode(DomBB);\n\n    SmallVector<PHINode *, 16> AddedPHIs;\n    SmallVector<PHINode *, 8> PostProcessPHIs;\n\n    SmallVector<PHINode *, 4> InsertedPHIs;\n    SSAUpdater SSAUpdate(&InsertedPHIs);\n    SSAUpdate.Initialize(I->getType(), I->getName());\n\n    \/\/ Insert the LCSSA phi's into all of the exit blocks dominated by the\n    \/\/ value, and add them to the Phi's map.\n    for (BasicBlock *ExitBB : ExitBlocks) {\n      if (!DT.dominates(DomNode, DT.getNode(ExitBB)))\n        continue;\n\n      \/\/ If we already inserted something for this BB, don't reprocess it.\n      if (SSAUpdate.HasValueForBlock(ExitBB))\n        continue;\n\n      PHINode *PN = PHINode::Create(I->getType(), PredCache.size(ExitBB),\n                                    I->getName() + \".lcssa\", &ExitBB->front());\n\n      \/\/ Add inputs from inside the loop for this PHI.\n      for (BasicBlock *Pred : PredCache.get(ExitBB)) {\n        PN->addIncoming(I, Pred);\n\n        \/\/ If the exit block has a predecessor not within the loop, arrange for\n        \/\/ the incoming value use corresponding to that predecessor to be\n        \/\/ rewritten in terms of a different LCSSA PHI.\n        if (!L->contains(Pred))\n          UsesToRewrite.push_back(\n              &PN->getOperandUse(PN->getOperandNumForIncomingValue(\n                  PN->getNumIncomingValues() - 1)));\n      }\n\n      AddedPHIs.push_back(PN);\n\n      \/\/ Remember that this phi makes the value alive in this block.\n      SSAUpdate.AddAvailableValue(ExitBB, PN);\n\n      \/\/ LoopSimplify might fail to simplify some loops (e.g. when indirect\n      \/\/ branches are involved). In such situations, it might happen that an\n      \/\/ exit for Loop L1 is the header of a disjoint Loop L2. Thus, when we\n      \/\/ create PHIs in such an exit block, we are also inserting PHIs into L2's\n      \/\/ header. This could break LCSSA form for L2 because these inserted PHIs\n      \/\/ can also have uses outside of L2. Remember all PHIs in such situation\n      \/\/ as to revisit than later on. FIXME: Remove this if indirectbr support\n      \/\/ into LoopSimplify gets improved.\n      if (auto *OtherLoop = LI.getLoopFor(ExitBB))\n        if (!L->contains(OtherLoop))\n          PostProcessPHIs.push_back(PN);\n    }\n\n    \/\/ Rewrite all uses outside the loop in terms of the new PHIs we just\n    \/\/ inserted.\n    for (Use *UseToRewrite : UsesToRewrite) {\n      \/\/ If this use is in an exit block, rewrite to use the newly inserted PHI.\n      \/\/ This is required for correctness because SSAUpdate doesn't handle uses\n      \/\/ in the same block.  It assumes the PHI we inserted is at the end of the\n      \/\/ block.\n      Instruction *User = cast<Instruction>(UseToRewrite->getUser());\n      BasicBlock *UserBB = User->getParent();\n      if (PHINode *PN = dyn_cast<PHINode>(User))\n        UserBB = PN->getIncomingBlock(*UseToRewrite);\n\n      if (isa<PHINode>(UserBB->begin()) && isExitBlock(UserBB, ExitBlocks)) {\n        \/\/ Tell the VHs that the uses changed. This updates SCEV's caches.\n        if (UseToRewrite->get()->hasValueHandle())\n          ValueHandleBase::ValueIsRAUWd(*UseToRewrite, &UserBB->front());\n        UseToRewrite->set(&UserBB->front());\n        continue;\n      }\n\n      \/\/ Otherwise, do full PHI insertion.\n      SSAUpdate.RewriteUse(*UseToRewrite);\n    }\n\n    \/\/ SSAUpdater might have inserted phi-nodes inside other loops. We'll need\n    \/\/ to post-process them to keep LCSSA form.\n    for (PHINode *InsertedPN : InsertedPHIs) {\n      if (auto *OtherLoop = LI.getLoopFor(InsertedPN->getParent()))\n        if (!L->contains(OtherLoop))\n          PostProcessPHIs.push_back(InsertedPN);\n    }\n\n    \/\/ Post process PHI instructions that were inserted into another disjoint\n    \/\/ loop and update their exits properly.\n    for (auto *PostProcessPN : PostProcessPHIs) {\n      if (PostProcessPN->use_empty())\n        continue;\n\n      \/\/ Reprocess each PHI instruction.\n      Worklist.push_back(PostProcessPN);\n    }\n\n    \/\/ Keep track of PHI nodes that we want to remove because they did not have\n    \/\/ any uses rewritten.\n    for (PHINode *PN : AddedPHIs)\n      if (PN->use_empty())\n        PHIsToRemove.insert(PN);\n\n    Changed = true;\n  }\n  \/\/ Remove PHI nodes that did not have any uses rewritten.\n  for (PHINode *PN : PHIsToRemove) {\n    assert (PN->use_empty() && \"Trying to remove a phi with uses.\");\n    PN->eraseFromParent();\n  }\n  return Changed;\n}\n\n\/\/\/ Return true if the specified block dominates at least\n\/\/\/ one of the blocks in the specified list.\nstatic bool\nblockDominatesAnExit(BasicBlock *BB,\n                     DominatorTree &DT,\n                     const SmallVectorImpl<BasicBlock *> &ExitBlocks) {\n  DomTreeNode *DomNode = DT.getNode(BB);\n  return any_of(ExitBlocks, [&](BasicBlock *EB) {\n    return DT.dominates(DomNode, DT.getNode(EB));\n  });\n}\n\nbool llvm::formLCSSA(Loop &L, DominatorTree &DT, LoopInfo *LI,\n                     ScalarEvolution *SE) {\n  bool Changed = false;\n\n  \/\/ Get the set of exiting blocks.\n  SmallVector<BasicBlock *, 8> ExitBlocks;\n  L.getExitBlocks(ExitBlocks);\n\n  if (ExitBlocks.empty())\n    return false;\n\n  SmallVector<Instruction *, 8> Worklist;\n\n  \/\/ Look at all the instructions in the loop, checking to see if they have uses\n  \/\/ outside the loop.  If so, put them into the worklist to rewrite those uses.\n  for (BasicBlock *BB : L.blocks()) {\n    \/\/ For large loops, avoid use-scanning by using dominance information:  In\n    \/\/ particular, if a block does not dominate any of the loop exits, then none\n    \/\/ of the values defined in the block could be used outside the loop.\n    if (!blockDominatesAnExit(BB, DT, ExitBlocks))\n      continue;\n\n    for (Instruction &I : *BB) {\n      \/\/ Reject two common cases fast: instructions with no uses (like stores)\n      \/\/ and instructions with one use that is in the same block as this.\n      if (I.use_empty() ||\n          (I.hasOneUse() && I.user_back()->getParent() == BB &&\n           !isa<PHINode>(I.user_back())))\n        continue;\n\n      Worklist.push_back(&I);\n    }\n  }\n  Changed = formLCSSAForInstructions(Worklist, DT, *LI);\n\n  \/\/ If we modified the code, remove any caches about the loop from SCEV to\n  \/\/ avoid dangling entries.\n  \/\/ FIXME: This is a big hammer, can we clear the cache more selectively?\n  if (SE && Changed)\n    SE->forgetLoop(&L);\n\n  assert(L.isLCSSAForm(DT));\n\n  return Changed;\n}\n\n\/\/\/ Process a loop nest depth first.\nbool llvm::formLCSSARecursively(Loop &L, DominatorTree &DT, LoopInfo *LI,\n                                ScalarEvolution *SE) {\n  bool Changed = false;\n\n  \/\/ Recurse depth-first through inner loops.\n  for (Loop *SubLoop : L.getSubLoops())\n    Changed |= formLCSSARecursively(*SubLoop, DT, LI, SE);\n\n  Changed |= formLCSSA(L, DT, LI, SE);\n  return Changed;\n}\n\n\/\/\/ Process all loops in the function, inner-most out.\nstatic bool formLCSSAOnAllLoops(LoopInfo *LI, DominatorTree &DT,\n                                ScalarEvolution *SE) {\n  bool Changed = false;\n  for (auto &L : *LI)\n    Changed |= formLCSSARecursively(*L, DT, LI, SE);\n  return Changed;\n}\n\nnamespace {\nstruct LCSSAWrapperPass : public FunctionPass {\n  static char ID; \/\/ Pass identification, replacement for typeid\n  LCSSAWrapperPass() : FunctionPass(ID) {\n    initializeLCSSAWrapperPassPass(*PassRegistry::getPassRegistry());\n  }\n\n  \/\/ Cached analysis information for the current function.\n  DominatorTree *DT;\n  LoopInfo *LI;\n  ScalarEvolution *SE;\n\n  bool runOnFunction(Function &F) override;\n  void verifyAnalysis() const override {\n    assert(\n        all_of(*LI, [&](Loop *L) { return L->isRecursivelyLCSSAForm(*DT); }) &&\n        \"LCSSA form is broken!\");\n  };\n\n  \/\/\/ This transformation requires natural loop information & requires that\n  \/\/\/ loop preheaders be inserted into the CFG.  It maintains both of these,\n  \/\/\/ as well as the CFG.  It also requires dominator information.\n  void getAnalysisUsage(AnalysisUsage &AU) const override {\n    AU.setPreservesCFG();\n\n    AU.addRequired<DominatorTreeWrapperPass>();\n    AU.addRequired<LoopInfoWrapperPass>();\n    AU.addPreservedID(LoopSimplifyID);\n    AU.addPreserved<AAResultsWrapperPass>();\n    AU.addPreserved<BasicAAWrapperPass>();\n    AU.addPreserved<GlobalsAAWrapperPass>();\n    AU.addPreserved<ScalarEvolutionWrapperPass>();\n    AU.addPreserved<SCEVAAWrapperPass>();\n  }\n};\n}\n\nchar LCSSAWrapperPass::ID = 0;\nINITIALIZE_PASS_BEGIN(LCSSAWrapperPass, \"lcssa\", \"Loop-Closed SSA Form Pass\",\n                      false, false)\nINITIALIZE_PASS_DEPENDENCY(DominatorTreeWrapperPass)\nINITIALIZE_PASS_DEPENDENCY(LoopInfoWrapperPass)\nINITIALIZE_PASS_END(LCSSAWrapperPass, \"lcssa\", \"Loop-Closed SSA Form Pass\",\n                    false, false)\n\nPass *llvm::createLCSSAPass() { return new LCSSAWrapperPass(); }\nchar &llvm::LCSSAID = LCSSAWrapperPass::ID;\n\n\/\/\/ Transform \\p F into loop-closed SSA form.\nbool LCSSAWrapperPass::runOnFunction(Function &F) {\n  LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();\n  DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();\n  auto *SEWP = getAnalysisIfAvailable<ScalarEvolutionWrapperPass>();\n  SE = SEWP ? &SEWP->getSE() : nullptr;\n\n  return formLCSSAOnAllLoops(LI, *DT, SE);\n}\n\nPreservedAnalyses LCSSAPass::run(Function &F, FunctionAnalysisManager &AM) {\n  auto &LI = AM.getResult<LoopAnalysis>(F);\n  auto &DT = AM.getResult<DominatorTreeAnalysis>(F);\n  auto *SE = AM.getCachedResult<ScalarEvolutionAnalysis>(F);\n  if (!formLCSSAOnAllLoops(&LI, DT, SE))\n    return PreservedAnalyses::all();\n\n  \/\/ FIXME: This should also 'preserve the CFG'.\n  PreservedAnalyses PA;\n  PA.preserve<BasicAA>();\n  PA.preserve<GlobalsAA>();\n  PA.preserve<SCEVAA>();\n  PA.preserve<ScalarEvolutionAnalysis>();\n  return PA;\n}\n<commit_msg>[LCSSA] Cache LoopExits to avoid wasted work<commit_after>\/\/===-- LCSSA.cpp - Convert loops into loop-closed SSA form ---------------===\/\/\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 pass transforms loops by placing phi nodes at the end of the loops for\n\/\/ all values that are live across the loop boundary.  For example, it turns\n\/\/ the left into the right code:\n\/\/ \n\/\/ for (...)                for (...)\n\/\/   if (c)                   if (c)\n\/\/     X1 = ...                 X1 = ...\n\/\/   else                     else\n\/\/     X2 = ...                 X2 = ...\n\/\/   X3 = phi(X1, X2)         X3 = phi(X1, X2)\n\/\/ ... = X3 + 4             X4 = phi(X3)\n\/\/                          ... = X4 + 4\n\/\/\n\/\/ This is still valid LLVM; the extra phi nodes are purely redundant, and will\n\/\/ be trivially eliminated by InstCombine.  The major benefit of this \n\/\/ transformation is that it makes many other loop optimizations, such as \n\/\/ LoopUnswitching, simpler.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Transforms\/Utils\/LCSSA.h\"\n#include \"llvm\/ADT\/STLExtras.h\"\n#include \"llvm\/ADT\/Statistic.h\"\n#include \"llvm\/Analysis\/AliasAnalysis.h\"\n#include \"llvm\/Analysis\/BasicAliasAnalysis.h\"\n#include \"llvm\/Analysis\/GlobalsModRef.h\"\n#include \"llvm\/Analysis\/LoopPass.h\"\n#include \"llvm\/Analysis\/ScalarEvolution.h\"\n#include \"llvm\/Analysis\/ScalarEvolutionAliasAnalysis.h\"\n#include \"llvm\/IR\/Constants.h\"\n#include \"llvm\/IR\/Dominators.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/IR\/Instructions.h\"\n#include \"llvm\/IR\/PredIteratorCache.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/Transforms\/Scalar.h\"\n#include \"llvm\/Transforms\/Utils\/LoopUtils.h\"\n#include \"llvm\/Transforms\/Utils\/SSAUpdater.h\"\nusing namespace llvm;\n\n#define DEBUG_TYPE \"lcssa\"\n\nSTATISTIC(NumLCSSA, \"Number of live out of a loop variables\");\n\n\/\/\/ Return true if the specified block is in the list.\nstatic bool isExitBlock(BasicBlock *BB,\n                        const SmallVectorImpl<BasicBlock *> &ExitBlocks) {\n  return is_contained(ExitBlocks, BB);\n}\n\n\/\/\/ For every instruction from the worklist, check to see if it has any uses\n\/\/\/ that are outside the current loop.  If so, insert LCSSA PHI nodes and\n\/\/\/ rewrite the uses.\nbool llvm::formLCSSAForInstructions(SmallVectorImpl<Instruction *> &Worklist,\n                                    DominatorTree &DT, LoopInfo &LI) {\n  SmallVector<Use *, 16> UsesToRewrite;\n  SmallSetVector<PHINode *, 16> PHIsToRemove;\n  PredIteratorCache PredCache;\n  bool Changed = false;\n\n  \/\/ Cache the Loop ExitBlocks across this loop.  We expect to get a lot of\n  \/\/ instructions within the same loops, computing the exit blocks is\n  \/\/ expensive, and we're not mutating the loop structure.\n  SmallDenseMap<Loop*, SmallVector<BasicBlock *,1>> LoopExitBlocks;\n\n  while (!Worklist.empty()) {\n    UsesToRewrite.clear();\n\n    Instruction *I = Worklist.pop_back_val();\n    BasicBlock *InstBB = I->getParent();\n    Loop *L = LI.getLoopFor(InstBB);\n    if (!LoopExitBlocks.count(L))   \n      L->getExitBlocks(LoopExitBlocks[L]);\n    assert(LoopExitBlocks.count(L));\n    const SmallVectorImpl<BasicBlock *> &ExitBlocks = LoopExitBlocks[L];\n\n    if (ExitBlocks.empty())\n      continue;\n\n    \/\/ Tokens cannot be used in PHI nodes, so we skip over them.\n    \/\/ We can run into tokens which are live out of a loop with catchswitch\n    \/\/ instructions in Windows EH if the catchswitch has one catchpad which\n    \/\/ is inside the loop and another which is not.\n    if (I->getType()->isTokenTy())\n      continue;\n\n    for (Use &U : I->uses()) {\n      Instruction *User = cast<Instruction>(U.getUser());\n      BasicBlock *UserBB = User->getParent();\n      if (PHINode *PN = dyn_cast<PHINode>(User))\n        UserBB = PN->getIncomingBlock(U);\n\n      if (InstBB != UserBB && !L->contains(UserBB))\n        UsesToRewrite.push_back(&U);\n    }\n\n    \/\/ If there are no uses outside the loop, exit with no change.\n    if (UsesToRewrite.empty())\n      continue;\n\n    ++NumLCSSA; \/\/ We are applying the transformation\n\n    \/\/ Invoke instructions are special in that their result value is not\n    \/\/ available along their unwind edge. The code below tests to see whether\n    \/\/ DomBB dominates the value, so adjust DomBB to the normal destination\n    \/\/ block, which is effectively where the value is first usable.\n    BasicBlock *DomBB = InstBB;\n    if (InvokeInst *Inv = dyn_cast<InvokeInst>(I))\n      DomBB = Inv->getNormalDest();\n\n    DomTreeNode *DomNode = DT.getNode(DomBB);\n\n    SmallVector<PHINode *, 16> AddedPHIs;\n    SmallVector<PHINode *, 8> PostProcessPHIs;\n\n    SmallVector<PHINode *, 4> InsertedPHIs;\n    SSAUpdater SSAUpdate(&InsertedPHIs);\n    SSAUpdate.Initialize(I->getType(), I->getName());\n\n    \/\/ Insert the LCSSA phi's into all of the exit blocks dominated by the\n    \/\/ value, and add them to the Phi's map.\n    for (BasicBlock *ExitBB : ExitBlocks) {\n      if (!DT.dominates(DomNode, DT.getNode(ExitBB)))\n        continue;\n\n      \/\/ If we already inserted something for this BB, don't reprocess it.\n      if (SSAUpdate.HasValueForBlock(ExitBB))\n        continue;\n\n      PHINode *PN = PHINode::Create(I->getType(), PredCache.size(ExitBB),\n                                    I->getName() + \".lcssa\", &ExitBB->front());\n\n      \/\/ Add inputs from inside the loop for this PHI.\n      for (BasicBlock *Pred : PredCache.get(ExitBB)) {\n        PN->addIncoming(I, Pred);\n\n        \/\/ If the exit block has a predecessor not within the loop, arrange for\n        \/\/ the incoming value use corresponding to that predecessor to be\n        \/\/ rewritten in terms of a different LCSSA PHI.\n        if (!L->contains(Pred))\n          UsesToRewrite.push_back(\n              &PN->getOperandUse(PN->getOperandNumForIncomingValue(\n                  PN->getNumIncomingValues() - 1)));\n      }\n\n      AddedPHIs.push_back(PN);\n\n      \/\/ Remember that this phi makes the value alive in this block.\n      SSAUpdate.AddAvailableValue(ExitBB, PN);\n\n      \/\/ LoopSimplify might fail to simplify some loops (e.g. when indirect\n      \/\/ branches are involved). In such situations, it might happen that an\n      \/\/ exit for Loop L1 is the header of a disjoint Loop L2. Thus, when we\n      \/\/ create PHIs in such an exit block, we are also inserting PHIs into L2's\n      \/\/ header. This could break LCSSA form for L2 because these inserted PHIs\n      \/\/ can also have uses outside of L2. Remember all PHIs in such situation\n      \/\/ as to revisit than later on. FIXME: Remove this if indirectbr support\n      \/\/ into LoopSimplify gets improved.\n      if (auto *OtherLoop = LI.getLoopFor(ExitBB))\n        if (!L->contains(OtherLoop))\n          PostProcessPHIs.push_back(PN);\n    }\n\n    \/\/ Rewrite all uses outside the loop in terms of the new PHIs we just\n    \/\/ inserted.\n    for (Use *UseToRewrite : UsesToRewrite) {\n      \/\/ If this use is in an exit block, rewrite to use the newly inserted PHI.\n      \/\/ This is required for correctness because SSAUpdate doesn't handle uses\n      \/\/ in the same block.  It assumes the PHI we inserted is at the end of the\n      \/\/ block.\n      Instruction *User = cast<Instruction>(UseToRewrite->getUser());\n      BasicBlock *UserBB = User->getParent();\n      if (PHINode *PN = dyn_cast<PHINode>(User))\n        UserBB = PN->getIncomingBlock(*UseToRewrite);\n\n      if (isa<PHINode>(UserBB->begin()) && isExitBlock(UserBB, ExitBlocks)) {\n        \/\/ Tell the VHs that the uses changed. This updates SCEV's caches.\n        if (UseToRewrite->get()->hasValueHandle())\n          ValueHandleBase::ValueIsRAUWd(*UseToRewrite, &UserBB->front());\n        UseToRewrite->set(&UserBB->front());\n        continue;\n      }\n\n      \/\/ Otherwise, do full PHI insertion.\n      SSAUpdate.RewriteUse(*UseToRewrite);\n    }\n\n    \/\/ SSAUpdater might have inserted phi-nodes inside other loops. We'll need\n    \/\/ to post-process them to keep LCSSA form.\n    for (PHINode *InsertedPN : InsertedPHIs) {\n      if (auto *OtherLoop = LI.getLoopFor(InsertedPN->getParent()))\n        if (!L->contains(OtherLoop))\n          PostProcessPHIs.push_back(InsertedPN);\n    }\n\n    \/\/ Post process PHI instructions that were inserted into another disjoint\n    \/\/ loop and update their exits properly.\n    for (auto *PostProcessPN : PostProcessPHIs) {\n      if (PostProcessPN->use_empty())\n        continue;\n\n      \/\/ Reprocess each PHI instruction.\n      Worklist.push_back(PostProcessPN);\n    }\n\n    \/\/ Keep track of PHI nodes that we want to remove because they did not have\n    \/\/ any uses rewritten.\n    for (PHINode *PN : AddedPHIs)\n      if (PN->use_empty())\n        PHIsToRemove.insert(PN);\n\n    Changed = true;\n  }\n  \/\/ Remove PHI nodes that did not have any uses rewritten.\n  for (PHINode *PN : PHIsToRemove) {\n    assert (PN->use_empty() && \"Trying to remove a phi with uses.\");\n    PN->eraseFromParent();\n  }\n  return Changed;\n}\n\n\/\/\/ Return true if the specified block dominates at least\n\/\/\/ one of the blocks in the specified list.\nstatic bool\nblockDominatesAnExit(BasicBlock *BB,\n                     DominatorTree &DT,\n                     const SmallVectorImpl<BasicBlock *> &ExitBlocks) {\n  DomTreeNode *DomNode = DT.getNode(BB);\n  return any_of(ExitBlocks, [&](BasicBlock *EB) {\n    return DT.dominates(DomNode, DT.getNode(EB));\n  });\n}\n\nbool llvm::formLCSSA(Loop &L, DominatorTree &DT, LoopInfo *LI,\n                     ScalarEvolution *SE) {\n  bool Changed = false;\n\n  \/\/ Get the set of exiting blocks.\n  SmallVector<BasicBlock *, 8> ExitBlocks;\n  L.getExitBlocks(ExitBlocks);\n\n  if (ExitBlocks.empty())\n    return false;\n\n  SmallVector<Instruction *, 8> Worklist;\n\n  \/\/ Look at all the instructions in the loop, checking to see if they have uses\n  \/\/ outside the loop.  If so, put them into the worklist to rewrite those uses.\n  for (BasicBlock *BB : L.blocks()) {\n    \/\/ For large loops, avoid use-scanning by using dominance information:  In\n    \/\/ particular, if a block does not dominate any of the loop exits, then none\n    \/\/ of the values defined in the block could be used outside the loop.\n    if (!blockDominatesAnExit(BB, DT, ExitBlocks))\n      continue;\n\n    for (Instruction &I : *BB) {\n      \/\/ Reject two common cases fast: instructions with no uses (like stores)\n      \/\/ and instructions with one use that is in the same block as this.\n      if (I.use_empty() ||\n          (I.hasOneUse() && I.user_back()->getParent() == BB &&\n           !isa<PHINode>(I.user_back())))\n        continue;\n\n      Worklist.push_back(&I);\n    }\n  }\n  Changed = formLCSSAForInstructions(Worklist, DT, *LI);\n\n  \/\/ If we modified the code, remove any caches about the loop from SCEV to\n  \/\/ avoid dangling entries.\n  \/\/ FIXME: This is a big hammer, can we clear the cache more selectively?\n  if (SE && Changed)\n    SE->forgetLoop(&L);\n\n  assert(L.isLCSSAForm(DT));\n\n  return Changed;\n}\n\n\/\/\/ Process a loop nest depth first.\nbool llvm::formLCSSARecursively(Loop &L, DominatorTree &DT, LoopInfo *LI,\n                                ScalarEvolution *SE) {\n  bool Changed = false;\n\n  \/\/ Recurse depth-first through inner loops.\n  for (Loop *SubLoop : L.getSubLoops())\n    Changed |= formLCSSARecursively(*SubLoop, DT, LI, SE);\n\n  Changed |= formLCSSA(L, DT, LI, SE);\n  return Changed;\n}\n\n\/\/\/ Process all loops in the function, inner-most out.\nstatic bool formLCSSAOnAllLoops(LoopInfo *LI, DominatorTree &DT,\n                                ScalarEvolution *SE) {\n  bool Changed = false;\n  for (auto &L : *LI)\n    Changed |= formLCSSARecursively(*L, DT, LI, SE);\n  return Changed;\n}\n\nnamespace {\nstruct LCSSAWrapperPass : public FunctionPass {\n  static char ID; \/\/ Pass identification, replacement for typeid\n  LCSSAWrapperPass() : FunctionPass(ID) {\n    initializeLCSSAWrapperPassPass(*PassRegistry::getPassRegistry());\n  }\n\n  \/\/ Cached analysis information for the current function.\n  DominatorTree *DT;\n  LoopInfo *LI;\n  ScalarEvolution *SE;\n\n  bool runOnFunction(Function &F) override;\n  void verifyAnalysis() const override {\n    assert(\n        all_of(*LI, [&](Loop *L) { return L->isRecursivelyLCSSAForm(*DT); }) &&\n        \"LCSSA form is broken!\");\n  };\n\n  \/\/\/ This transformation requires natural loop information & requires that\n  \/\/\/ loop preheaders be inserted into the CFG.  It maintains both of these,\n  \/\/\/ as well as the CFG.  It also requires dominator information.\n  void getAnalysisUsage(AnalysisUsage &AU) const override {\n    AU.setPreservesCFG();\n\n    AU.addRequired<DominatorTreeWrapperPass>();\n    AU.addRequired<LoopInfoWrapperPass>();\n    AU.addPreservedID(LoopSimplifyID);\n    AU.addPreserved<AAResultsWrapperPass>();\n    AU.addPreserved<BasicAAWrapperPass>();\n    AU.addPreserved<GlobalsAAWrapperPass>();\n    AU.addPreserved<ScalarEvolutionWrapperPass>();\n    AU.addPreserved<SCEVAAWrapperPass>();\n  }\n};\n}\n\nchar LCSSAWrapperPass::ID = 0;\nINITIALIZE_PASS_BEGIN(LCSSAWrapperPass, \"lcssa\", \"Loop-Closed SSA Form Pass\",\n                      false, false)\nINITIALIZE_PASS_DEPENDENCY(DominatorTreeWrapperPass)\nINITIALIZE_PASS_DEPENDENCY(LoopInfoWrapperPass)\nINITIALIZE_PASS_END(LCSSAWrapperPass, \"lcssa\", \"Loop-Closed SSA Form Pass\",\n                    false, false)\n\nPass *llvm::createLCSSAPass() { return new LCSSAWrapperPass(); }\nchar &llvm::LCSSAID = LCSSAWrapperPass::ID;\n\n\/\/\/ Transform \\p F into loop-closed SSA form.\nbool LCSSAWrapperPass::runOnFunction(Function &F) {\n  LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();\n  DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();\n  auto *SEWP = getAnalysisIfAvailable<ScalarEvolutionWrapperPass>();\n  SE = SEWP ? &SEWP->getSE() : nullptr;\n\n  return formLCSSAOnAllLoops(LI, *DT, SE);\n}\n\nPreservedAnalyses LCSSAPass::run(Function &F, FunctionAnalysisManager &AM) {\n  auto &LI = AM.getResult<LoopAnalysis>(F);\n  auto &DT = AM.getResult<DominatorTreeAnalysis>(F);\n  auto *SE = AM.getCachedResult<ScalarEvolutionAnalysis>(F);\n  if (!formLCSSAOnAllLoops(&LI, DT, SE))\n    return PreservedAnalyses::all();\n\n  \/\/ FIXME: This should also 'preserve the CFG'.\n  PreservedAnalyses PA;\n  PA.preserve<BasicAA>();\n  PA.preserve<GlobalsAA>();\n  PA.preserve<SCEVAA>();\n  PA.preserve<ScalarEvolutionAnalysis>();\n  return PA;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- Local.cpp - Functions to perform local transformations ------------===\/\/\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 family of functions perform various local transformations to the\n\/\/ program.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Transforms\/Utils\/Local.h\"\n#include \"llvm\/Constants.h\"\n#include \"llvm\/DerivedTypes.h\"\n#include \"llvm\/Instructions.h\"\n#include \"llvm\/Intrinsics.h\"\n#include \"llvm\/IntrinsicInst.h\"\n#include \"llvm\/Analysis\/ConstantFolding.h\"\n#include \"llvm\/Target\/TargetData.h\"\n#include \"llvm\/Support\/GetElementPtrTypeIterator.h\"\n#include \"llvm\/Support\/MathExtras.h\"\nusing namespace llvm;\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/  Local constant propagation.\n\/\/\n\n\/\/ ConstantFoldTerminator - If a terminator instruction is predicated on a\n\/\/ constant value, convert it into an unconditional branch to the constant\n\/\/ destination.\n\/\/\nbool llvm::ConstantFoldTerminator(BasicBlock *BB) {\n  TerminatorInst *T = BB->getTerminator();\n\n  \/\/ Branch - See if we are conditional jumping on constant\n  if (BranchInst *BI = dyn_cast<BranchInst>(T)) {\n    if (BI->isUnconditional()) return false;  \/\/ Can't optimize uncond branch\n    BasicBlock *Dest1 = cast<BasicBlock>(BI->getOperand(0));\n    BasicBlock *Dest2 = cast<BasicBlock>(BI->getOperand(1));\n\n    if (ConstantInt *Cond = dyn_cast<ConstantInt>(BI->getCondition())) {\n      \/\/ Are we branching on constant?\n      \/\/ YES.  Change to unconditional branch...\n      BasicBlock *Destination = Cond->getZExtValue() ? Dest1 : Dest2;\n      BasicBlock *OldDest     = Cond->getZExtValue() ? Dest2 : Dest1;\n\n      \/\/cerr << \"Function: \" << T->getParent()->getParent()\n      \/\/     << \"\\nRemoving branch from \" << T->getParent()\n      \/\/     << \"\\n\\nTo: \" << OldDest << endl;\n\n      \/\/ Let the basic block know that we are letting go of it.  Based on this,\n      \/\/ it will adjust it's PHI nodes.\n      assert(BI->getParent() && \"Terminator not inserted in block!\");\n      OldDest->removePredecessor(BI->getParent());\n\n      \/\/ Set the unconditional destination, and change the insn to be an\n      \/\/ unconditional branch.\n      BI->setUnconditionalDest(Destination);\n      return true;\n    } else if (Dest2 == Dest1) {       \/\/ Conditional branch to same location?\n      \/\/ This branch matches something like this:\n      \/\/     br bool %cond, label %Dest, label %Dest\n      \/\/ and changes it into:  br label %Dest\n\n      \/\/ Let the basic block know that we are letting go of one copy of it.\n      assert(BI->getParent() && \"Terminator not inserted in block!\");\n      Dest1->removePredecessor(BI->getParent());\n\n      \/\/ Change a conditional branch to unconditional.\n      BI->setUnconditionalDest(Dest1);\n      return true;\n    }\n  } else if (SwitchInst *SI = dyn_cast<SwitchInst>(T)) {\n    \/\/ If we are switching on a constant, we can convert the switch into a\n    \/\/ single branch instruction!\n    ConstantInt *CI = dyn_cast<ConstantInt>(SI->getCondition());\n    BasicBlock *TheOnlyDest = SI->getSuccessor(0);  \/\/ The default dest\n    BasicBlock *DefaultDest = TheOnlyDest;\n    assert(TheOnlyDest == SI->getDefaultDest() &&\n           \"Default destination is not successor #0?\");\n\n    \/\/ Figure out which case it goes to...\n    for (unsigned i = 1, e = SI->getNumSuccessors(); i != e; ++i) {\n      \/\/ Found case matching a constant operand?\n      if (SI->getSuccessorValue(i) == CI) {\n        TheOnlyDest = SI->getSuccessor(i);\n        break;\n      }\n\n      \/\/ Check to see if this branch is going to the same place as the default\n      \/\/ dest.  If so, eliminate it as an explicit compare.\n      if (SI->getSuccessor(i) == DefaultDest) {\n        \/\/ Remove this entry...\n        DefaultDest->removePredecessor(SI->getParent());\n        SI->removeCase(i);\n        --i; --e;  \/\/ Don't skip an entry...\n        continue;\n      }\n\n      \/\/ Otherwise, check to see if the switch only branches to one destination.\n      \/\/ We do this by reseting \"TheOnlyDest\" to null when we find two non-equal\n      \/\/ destinations.\n      if (SI->getSuccessor(i) != TheOnlyDest) TheOnlyDest = 0;\n    }\n\n    if (CI && !TheOnlyDest) {\n      \/\/ Branching on a constant, but not any of the cases, go to the default\n      \/\/ successor.\n      TheOnlyDest = SI->getDefaultDest();\n    }\n\n    \/\/ If we found a single destination that we can fold the switch into, do so\n    \/\/ now.\n    if (TheOnlyDest) {\n      \/\/ Insert the new branch..\n      BranchInst::Create(TheOnlyDest, SI);\n      BasicBlock *BB = SI->getParent();\n\n      \/\/ Remove entries from PHI nodes which we no longer branch to...\n      for (unsigned i = 0, e = SI->getNumSuccessors(); i != e; ++i) {\n        \/\/ Found case matching a constant operand?\n        BasicBlock *Succ = SI->getSuccessor(i);\n        if (Succ == TheOnlyDest)\n          TheOnlyDest = 0;  \/\/ Don't modify the first branch to TheOnlyDest\n        else\n          Succ->removePredecessor(BB);\n      }\n\n      \/\/ Delete the old switch...\n      BB->getInstList().erase(SI);\n      return true;\n    } else if (SI->getNumSuccessors() == 2) {\n      \/\/ Otherwise, we can fold this switch into a conditional branch\n      \/\/ instruction if it has only one non-default destination.\n      Value *Cond = new ICmpInst(ICmpInst::ICMP_EQ, SI->getCondition(),\n                                 SI->getSuccessorValue(1), \"cond\", SI);\n      \/\/ Insert the new branch...\n      BranchInst::Create(SI->getSuccessor(1), SI->getSuccessor(0), Cond, SI);\n\n      \/\/ Delete the old switch...\n      SI->eraseFromParent();\n      return true;\n    }\n  }\n  return false;\n}\n\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/  Local dead code elimination...\n\/\/\n\n\/\/\/ isInstructionTriviallyDead - Return true if the result produced by the\n\/\/\/ instruction is not used, and the instruction has no side effects.\n\/\/\/\nbool llvm::isInstructionTriviallyDead(Instruction *I) {\n  if (!I->use_empty() || isa<TerminatorInst>(I)) return false;\n\n  if (!I->mayWriteToMemory())\n    return true;\n\n  \/\/ Special case intrinsics that \"may write to memory\" but can be deleted when\n  \/\/ dead.\n  if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I))\n    \/\/ Safe to delete llvm.stacksave if dead.\n    if (II->getIntrinsicID() == Intrinsic::stacksave)\n      return true;\n  \n  return false;\n}\n\n\/\/\/ RecursivelyDeleteTriviallyDeadInstructions - If the specified value is a\n\/\/\/ trivially dead instruction, delete it.  If that makes any of its operands\n\/\/\/ trivially dead, delete them too, recursively.\n\/\/\/\n\/\/\/ If DeadInst is specified, the vector is filled with the instructions that\n\/\/\/ are actually deleted.\nvoid llvm::RecursivelyDeleteTriviallyDeadInstructions(Value *V,\n                                      SmallVectorImpl<Instruction*> *DeadInst) {\n  Instruction *I = dyn_cast<Instruction>(V);\n  if (!I || !I->use_empty() || !isInstructionTriviallyDead(I))\n    return;\n  \n  SmallVector<Instruction*, 16> DeadInsts;\n  DeadInsts.push_back(I);\n  \n  while (!DeadInsts.empty()) {\n    I = DeadInsts.back();\n    DeadInsts.pop_back();\n\n    \/\/ If the client wanted to know, tell it about deleted instructions.\n    if (DeadInst)\n      DeadInst->push_back(I);\n    \n    \/\/ Null out all of the instruction's operands to see if any operand becomes\n    \/\/ dead as we go.\n    for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i) {\n      Value *OpV = I->getOperand(i);\n      I->setOperand(i, 0);\n      \n      if (!OpV->use_empty()) continue;\n    \n      \/\/ If the operand is an instruction that became dead as we nulled out the\n      \/\/ operand, and if it is 'trivially' dead, delete it in a future loop\n      \/\/ iteration.\n      if (Instruction *OpI = dyn_cast<Instruction>(OpV))\n        if (isInstructionTriviallyDead(OpI))\n          DeadInsts.push_back(OpI);\n    }\n    \n    I->eraseFromParent();\n  }\n}\n\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/  Control Flow Graph Restructuring...\n\/\/\n\n\/\/\/ MergeBasicBlockIntoOnlyPred - DestBB is a block with one predecessor and its\n\/\/\/ predecessor is known to have one successor (DestBB!).  Eliminate the edge\n\/\/\/ between them, moving the instructions in the predecessor into DestBB and\n\/\/\/ deleting the predecessor block.\n\/\/\/\nvoid llvm::MergeBasicBlockIntoOnlyPred(BasicBlock *DestBB) {\n  \/\/ If BB has single-entry PHI nodes, fold them.\n  while (PHINode *PN = dyn_cast<PHINode>(DestBB->begin())) {\n    Value *NewVal = PN->getIncomingValue(0);\n    \/\/ Replace self referencing PHI with undef, it must be dead.\n    if (NewVal == PN) NewVal = UndefValue::get(PN->getType());\n    PN->replaceAllUsesWith(NewVal);\n    PN->eraseFromParent();\n  }\n  \n  BasicBlock *PredBB = DestBB->getSinglePredecessor();\n  assert(PredBB && \"Block doesn't have a single predecessor!\");\n  \n  \/\/ Splice all the instructions from PredBB to DestBB.\n  PredBB->getTerminator()->eraseFromParent();\n  DestBB->getInstList().splice(DestBB->begin(), PredBB->getInstList());\n  \n  \/\/ Anything that branched to PredBB now branches to DestBB.\n  PredBB->replaceAllUsesWith(DestBB);\n  \n  \/\/ Nuke BB.\n  PredBB->eraseFromParent();\n}\n<commit_msg>use precise getters<commit_after>\/\/===-- Local.cpp - Functions to perform local transformations ------------===\/\/\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 family of functions perform various local transformations to the\n\/\/ program.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Transforms\/Utils\/Local.h\"\n#include \"llvm\/Constants.h\"\n#include \"llvm\/DerivedTypes.h\"\n#include \"llvm\/Instructions.h\"\n#include \"llvm\/Intrinsics.h\"\n#include \"llvm\/IntrinsicInst.h\"\n#include \"llvm\/Analysis\/ConstantFolding.h\"\n#include \"llvm\/Target\/TargetData.h\"\n#include \"llvm\/Support\/GetElementPtrTypeIterator.h\"\n#include \"llvm\/Support\/MathExtras.h\"\nusing namespace llvm;\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/  Local constant propagation.\n\/\/\n\n\/\/ ConstantFoldTerminator - If a terminator instruction is predicated on a\n\/\/ constant value, convert it into an unconditional branch to the constant\n\/\/ destination.\n\/\/\nbool llvm::ConstantFoldTerminator(BasicBlock *BB) {\n  TerminatorInst *T = BB->getTerminator();\n\n  \/\/ Branch - See if we are conditional jumping on constant\n  if (BranchInst *BI = dyn_cast<BranchInst>(T)) {\n    if (BI->isUnconditional()) return false;  \/\/ Can't optimize uncond branch\n    BasicBlock *Dest1 = BI->getSuccessor(0);\n    BasicBlock *Dest2 = BI->getSuccessor(1);\n\n    if (ConstantInt *Cond = dyn_cast<ConstantInt>(BI->getCondition())) {\n      \/\/ Are we branching on constant?\n      \/\/ YES.  Change to unconditional branch...\n      BasicBlock *Destination = Cond->getZExtValue() ? Dest1 : Dest2;\n      BasicBlock *OldDest     = Cond->getZExtValue() ? Dest2 : Dest1;\n\n      \/\/cerr << \"Function: \" << T->getParent()->getParent()\n      \/\/     << \"\\nRemoving branch from \" << T->getParent()\n      \/\/     << \"\\n\\nTo: \" << OldDest << endl;\n\n      \/\/ Let the basic block know that we are letting go of it.  Based on this,\n      \/\/ it will adjust it's PHI nodes.\n      assert(BI->getParent() && \"Terminator not inserted in block!\");\n      OldDest->removePredecessor(BI->getParent());\n\n      \/\/ Set the unconditional destination, and change the insn to be an\n      \/\/ unconditional branch.\n      BI->setUnconditionalDest(Destination);\n      return true;\n    } else if (Dest2 == Dest1) {       \/\/ Conditional branch to same location?\n      \/\/ This branch matches something like this:\n      \/\/     br bool %cond, label %Dest, label %Dest\n      \/\/ and changes it into:  br label %Dest\n\n      \/\/ Let the basic block know that we are letting go of one copy of it.\n      assert(BI->getParent() && \"Terminator not inserted in block!\");\n      Dest1->removePredecessor(BI->getParent());\n\n      \/\/ Change a conditional branch to unconditional.\n      BI->setUnconditionalDest(Dest1);\n      return true;\n    }\n  } else if (SwitchInst *SI = dyn_cast<SwitchInst>(T)) {\n    \/\/ If we are switching on a constant, we can convert the switch into a\n    \/\/ single branch instruction!\n    ConstantInt *CI = dyn_cast<ConstantInt>(SI->getCondition());\n    BasicBlock *TheOnlyDest = SI->getSuccessor(0);  \/\/ The default dest\n    BasicBlock *DefaultDest = TheOnlyDest;\n    assert(TheOnlyDest == SI->getDefaultDest() &&\n           \"Default destination is not successor #0?\");\n\n    \/\/ Figure out which case it goes to...\n    for (unsigned i = 1, e = SI->getNumSuccessors(); i != e; ++i) {\n      \/\/ Found case matching a constant operand?\n      if (SI->getSuccessorValue(i) == CI) {\n        TheOnlyDest = SI->getSuccessor(i);\n        break;\n      }\n\n      \/\/ Check to see if this branch is going to the same place as the default\n      \/\/ dest.  If so, eliminate it as an explicit compare.\n      if (SI->getSuccessor(i) == DefaultDest) {\n        \/\/ Remove this entry...\n        DefaultDest->removePredecessor(SI->getParent());\n        SI->removeCase(i);\n        --i; --e;  \/\/ Don't skip an entry...\n        continue;\n      }\n\n      \/\/ Otherwise, check to see if the switch only branches to one destination.\n      \/\/ We do this by reseting \"TheOnlyDest\" to null when we find two non-equal\n      \/\/ destinations.\n      if (SI->getSuccessor(i) != TheOnlyDest) TheOnlyDest = 0;\n    }\n\n    if (CI && !TheOnlyDest) {\n      \/\/ Branching on a constant, but not any of the cases, go to the default\n      \/\/ successor.\n      TheOnlyDest = SI->getDefaultDest();\n    }\n\n    \/\/ If we found a single destination that we can fold the switch into, do so\n    \/\/ now.\n    if (TheOnlyDest) {\n      \/\/ Insert the new branch..\n      BranchInst::Create(TheOnlyDest, SI);\n      BasicBlock *BB = SI->getParent();\n\n      \/\/ Remove entries from PHI nodes which we no longer branch to...\n      for (unsigned i = 0, e = SI->getNumSuccessors(); i != e; ++i) {\n        \/\/ Found case matching a constant operand?\n        BasicBlock *Succ = SI->getSuccessor(i);\n        if (Succ == TheOnlyDest)\n          TheOnlyDest = 0;  \/\/ Don't modify the first branch to TheOnlyDest\n        else\n          Succ->removePredecessor(BB);\n      }\n\n      \/\/ Delete the old switch...\n      BB->getInstList().erase(SI);\n      return true;\n    } else if (SI->getNumSuccessors() == 2) {\n      \/\/ Otherwise, we can fold this switch into a conditional branch\n      \/\/ instruction if it has only one non-default destination.\n      Value *Cond = new ICmpInst(ICmpInst::ICMP_EQ, SI->getCondition(),\n                                 SI->getSuccessorValue(1), \"cond\", SI);\n      \/\/ Insert the new branch...\n      BranchInst::Create(SI->getSuccessor(1), SI->getSuccessor(0), Cond, SI);\n\n      \/\/ Delete the old switch...\n      SI->eraseFromParent();\n      return true;\n    }\n  }\n  return false;\n}\n\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/  Local dead code elimination...\n\/\/\n\n\/\/\/ isInstructionTriviallyDead - Return true if the result produced by the\n\/\/\/ instruction is not used, and the instruction has no side effects.\n\/\/\/\nbool llvm::isInstructionTriviallyDead(Instruction *I) {\n  if (!I->use_empty() || isa<TerminatorInst>(I)) return false;\n\n  if (!I->mayWriteToMemory())\n    return true;\n\n  \/\/ Special case intrinsics that \"may write to memory\" but can be deleted when\n  \/\/ dead.\n  if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I))\n    \/\/ Safe to delete llvm.stacksave if dead.\n    if (II->getIntrinsicID() == Intrinsic::stacksave)\n      return true;\n  \n  return false;\n}\n\n\/\/\/ RecursivelyDeleteTriviallyDeadInstructions - If the specified value is a\n\/\/\/ trivially dead instruction, delete it.  If that makes any of its operands\n\/\/\/ trivially dead, delete them too, recursively.\n\/\/\/\n\/\/\/ If DeadInst is specified, the vector is filled with the instructions that\n\/\/\/ are actually deleted.\nvoid llvm::RecursivelyDeleteTriviallyDeadInstructions(Value *V,\n                                      SmallVectorImpl<Instruction*> *DeadInst) {\n  Instruction *I = dyn_cast<Instruction>(V);\n  if (!I || !I->use_empty() || !isInstructionTriviallyDead(I))\n    return;\n  \n  SmallVector<Instruction*, 16> DeadInsts;\n  DeadInsts.push_back(I);\n  \n  while (!DeadInsts.empty()) {\n    I = DeadInsts.back();\n    DeadInsts.pop_back();\n\n    \/\/ If the client wanted to know, tell it about deleted instructions.\n    if (DeadInst)\n      DeadInst->push_back(I);\n    \n    \/\/ Null out all of the instruction's operands to see if any operand becomes\n    \/\/ dead as we go.\n    for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i) {\n      Value *OpV = I->getOperand(i);\n      I->setOperand(i, 0);\n      \n      if (!OpV->use_empty()) continue;\n    \n      \/\/ If the operand is an instruction that became dead as we nulled out the\n      \/\/ operand, and if it is 'trivially' dead, delete it in a future loop\n      \/\/ iteration.\n      if (Instruction *OpI = dyn_cast<Instruction>(OpV))\n        if (isInstructionTriviallyDead(OpI))\n          DeadInsts.push_back(OpI);\n    }\n    \n    I->eraseFromParent();\n  }\n}\n\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/  Control Flow Graph Restructuring...\n\/\/\n\n\/\/\/ MergeBasicBlockIntoOnlyPred - DestBB is a block with one predecessor and its\n\/\/\/ predecessor is known to have one successor (DestBB!).  Eliminate the edge\n\/\/\/ between them, moving the instructions in the predecessor into DestBB and\n\/\/\/ deleting the predecessor block.\n\/\/\/\nvoid llvm::MergeBasicBlockIntoOnlyPred(BasicBlock *DestBB) {\n  \/\/ If BB has single-entry PHI nodes, fold them.\n  while (PHINode *PN = dyn_cast<PHINode>(DestBB->begin())) {\n    Value *NewVal = PN->getIncomingValue(0);\n    \/\/ Replace self referencing PHI with undef, it must be dead.\n    if (NewVal == PN) NewVal = UndefValue::get(PN->getType());\n    PN->replaceAllUsesWith(NewVal);\n    PN->eraseFromParent();\n  }\n  \n  BasicBlock *PredBB = DestBB->getSinglePredecessor();\n  assert(PredBB && \"Block doesn't have a single predecessor!\");\n  \n  \/\/ Splice all the instructions from PredBB to DestBB.\n  PredBB->getTerminator()->eraseFromParent();\n  DestBB->getInstList().splice(DestBB->begin(), PredBB->getInstList());\n  \n  \/\/ Anything that branched to PredBB now branches to DestBB.\n  PredBB->replaceAllUsesWith(DestBB);\n  \n  \/\/ Nuke BB.\n  PredBB->eraseFromParent();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2013 The ETW2CTF 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\/\/   * 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\"\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY\n\/\/ DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n\/\/ (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\/\/ LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n\/\/ ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF\n\/\/ THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include \"converter\/metadata.h\"\n\n#include <cassert>\n#include <string>\n\nnamespace converter {\n\nbool Metadata::Event::operator==(const Event& event) const {\n  if (guid_ != event.guid_ ||\n      opcode_ != event.opcode_ ||\n      version_ != event.version_ ||\n      event_id_ != event.event_id_ ||\n      name_.compare(event.name_) != 0) {\n    return false;\n  }\n\n  if (fields_.size() != event.fields_.size())\n    return false;\n  for (size_t i = 0; i < fields_.size(); ++i) {\n    if (fields_[i] != event.fields_[i])\n      return false;\n  }\n\n  return true;\n}\n\nbool Metadata::Field::operator==(const Field& field) const {\n  return type_ == field.type_ &&\n      size_ == field.size_ &&\n      parent_ == field.parent_ &&\n      name_.compare(field.name_) == 0 &&\n      field_size_.compare(field.field_size_) == 0;\n}\n\nsize_t Metadata::GetIdForEvent(const Event& event) {\n  for (size_t i = 0; i < events_.size(); ++i) {\n    if (event == events_[i])\n      return i + 1;\n  }\n  events_.push_back(event);\n  return events_.size();\n}\n\nvoid Metadata::Event::AddField(const Field& field) {\n  for (size_t i = 0; i < fields_.size(); ++i) {\n    \/\/ Avoid same field name in a scope.\n    if (field.parent() == fields_[i].parent()) {\n      assert(fields_[i].name() == field.name());\n    }\n  }\n  fields_.push_back(field);\n}\n\nsize_t Metadata::Packet::size() const {\n  return buffer_.size();\n}\n\nconst uint8_t* Metadata::Packet::raw_bytes() const {\n  if (buffer_.empty())\n    return NULL;\n  return reinterpret_cast<const uint8_t*>(&buffer_[0]);\n}\n\nvoid Metadata::Packet::Reset(size_t offset) {\n  buffer_.resize(offset);\n}\n\nvoid Metadata::Packet::UpdateUInt32(size_t offset, uint32_t value) {\n  assert(offset + 3 < buffer_.size());\n  buffer_[offset] = static_cast<char>(value);\n  buffer_[offset + 1] = static_cast<char>(value >> 8);\n  buffer_[offset + 2] = static_cast<char>(value >> 16);\n  buffer_[offset + 3] = static_cast<char>(value >> 24);\n}\n\nvoid Metadata::Packet::EncodeUInt8(uint8_t value) {\n  buffer_.push_back(value);\n}\n\nvoid Metadata::Packet::EncodeUInt16(uint16_t value) {\n  EncodeUInt8(static_cast<uint8_t>(value));\n  EncodeUInt8(static_cast<uint8_t>(value >> 8));\n}\n\nvoid Metadata::Packet::EncodeUInt32(uint32_t value) {\n  EncodeUInt16(static_cast<uint16_t>(value));\n  EncodeUInt16(static_cast<uint16_t>(value >> 16));\n}\n\nvoid Metadata::Packet::EncodeUInt64(uint64_t value) {\n  EncodeUInt32(static_cast<uint32_t>(value));\n  EncodeUInt32(static_cast<uint32_t>(value >> 32));\n}\n\nvoid Metadata::Packet::EncodeBytes(const uint8_t* value, size_t length) {\n  for (size_t i = 0; i < length; ++i)\n    EncodeUInt8(value[i]);\n}\n\nvoid Metadata::Packet::EncodeString(const std::string& str) {\n  const uint8_t* raw = reinterpret_cast<const uint8_t*>(str.c_str());\n  \/\/ The length must take into account the terminal '\\0'.\n  EncodeBytes(raw, str.length() + 1);\n}\n\n}  \/\/ namespace converter\n<commit_msg>Fix invalid assert on field insertion in Debug mode.<commit_after>\/\/ Copyright (c) 2013 The ETW2CTF 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\/\/   * 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\"\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY\n\/\/ DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n\/\/ (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\/\/ LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n\/\/ ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF\n\/\/ THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include \"converter\/metadata.h\"\n\n#include <cassert>\n#include <string>\n\nnamespace converter {\n\nbool Metadata::Event::operator==(const Event& event) const {\n  if (guid_ != event.guid_ ||\n      opcode_ != event.opcode_ ||\n      version_ != event.version_ ||\n      event_id_ != event.event_id_ ||\n      name_.compare(event.name_) != 0) {\n    return false;\n  }\n\n  if (fields_.size() != event.fields_.size())\n    return false;\n  for (size_t i = 0; i < fields_.size(); ++i) {\n    if (fields_[i] != event.fields_[i])\n      return false;\n  }\n\n  return true;\n}\n\nbool Metadata::Field::operator==(const Field& field) const {\n  return type_ == field.type_ &&\n      size_ == field.size_ &&\n      parent_ == field.parent_ &&\n      name_.compare(field.name_) == 0 &&\n      field_size_.compare(field.field_size_) == 0;\n}\n\nsize_t Metadata::GetIdForEvent(const Event& event) {\n  for (size_t i = 0; i < events_.size(); ++i) {\n    if (event == events_[i])\n      return i + 1;\n  }\n  events_.push_back(event);\n  return events_.size();\n}\n\nvoid Metadata::Event::AddField(const Field& field) {\n  for (size_t i = 0; i < fields_.size(); ++i) {\n    \/\/ Avoid same field name in a scope.\n    if (field.parent() == fields_[i].parent()) {\n      assert(fields_[i].name() != field.name());\n    }\n  }\n  fields_.push_back(field);\n}\n\nsize_t Metadata::Packet::size() const {\n  return buffer_.size();\n}\n\nconst uint8_t* Metadata::Packet::raw_bytes() const {\n  if (buffer_.empty())\n    return NULL;\n  return reinterpret_cast<const uint8_t*>(&buffer_[0]);\n}\n\nvoid Metadata::Packet::Reset(size_t offset) {\n  buffer_.resize(offset);\n}\n\nvoid Metadata::Packet::UpdateUInt32(size_t offset, uint32_t value) {\n  assert(offset + 3 < buffer_.size());\n  buffer_[offset] = static_cast<char>(value);\n  buffer_[offset + 1] = static_cast<char>(value >> 8);\n  buffer_[offset + 2] = static_cast<char>(value >> 16);\n  buffer_[offset + 3] = static_cast<char>(value >> 24);\n}\n\nvoid Metadata::Packet::EncodeUInt8(uint8_t value) {\n  buffer_.push_back(value);\n}\n\nvoid Metadata::Packet::EncodeUInt16(uint16_t value) {\n  EncodeUInt8(static_cast<uint8_t>(value));\n  EncodeUInt8(static_cast<uint8_t>(value >> 8));\n}\n\nvoid Metadata::Packet::EncodeUInt32(uint32_t value) {\n  EncodeUInt16(static_cast<uint16_t>(value));\n  EncodeUInt16(static_cast<uint16_t>(value >> 16));\n}\n\nvoid Metadata::Packet::EncodeUInt64(uint64_t value) {\n  EncodeUInt32(static_cast<uint32_t>(value));\n  EncodeUInt32(static_cast<uint32_t>(value >> 32));\n}\n\nvoid Metadata::Packet::EncodeBytes(const uint8_t* value, size_t length) {\n  for (size_t i = 0; i < length; ++i)\n    EncodeUInt8(value[i]);\n}\n\nvoid Metadata::Packet::EncodeString(const std::string& str) {\n  const uint8_t* raw = reinterpret_cast<const uint8_t*>(str.c_str());\n  \/\/ The length must take into account the terminal '\\0'.\n  EncodeBytes(raw, str.length() + 1);\n}\n\n}  \/\/ namespace converter\n<|endoftext|>"}
{"text":"<commit_before>\/* BEGIN_COMMON_COPYRIGHT_HEADER\n * (c)LGPL2+\n *\n * Flacon - audio File Encoder\n * https:\/\/github.com\/flacon\/flacon\n *\n * Copyright: 2012-2013\n *   Alexander Sokoloff <sokoloff.a@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 * END_COMMON_COPYRIGHT_HEADER *\/\n\n#include \"splitter.h\"\n#include \"disc.h\"\n#include \"decoder.h\"\n#include <QDebug>\n#include <QLoggingCategory>\n#include <QFile>\n\nnamespace {\nQ_LOGGING_CATEGORY(LOG, \"Splitter\")\n}\n\nusing namespace Conv;\n\nstruct Splitter::Job\n{\n    struct Chunk\n    {\n        InputAudioFile file;\n        CueTime        start;\n        CueTime        end;\n        Decoder *      decoder = nullptr;\n    };\n\n    const Disc *    disk = nullptr;\n    Conv::ConvTrack track;\n    QList<Chunk>    chunks;\n    QString         outFileName;\n    bool            isPregap = false;\n\n    Job(const Disc *disk, Conv::ConvTrack track, bool addPregap, bool addTrack, bool addPostgap);\n    QList<Chunk>   getPart(const CueIndex &from, const CueIndex &to) const;\n    void           merge();\n    InputAudioFile getInputAudioFile(const QByteArray &fileTag) const;\n};\n\n\/************************************************\n *\n ************************************************\/\nSplitter::Job::Job(const Disc *disk, Conv::ConvTrack track, bool addPregap, bool addTrack, bool addPostgap) :\n    disk(disk),\n    track(track)\n{\n    const Track cur  = *(disk->track(track.index()));\n    const Track next = (cur.index() + 1 < disk->count()) ? *(disk->track(cur.index() + 1)) : Track();\n\n    if (addPregap) {\n        chunks << getPart(cur.cueIndex(0), cur.cueIndex(1));\n    }\n\n    if (addTrack) {\n        chunks << getPart(cur.cueIndex(1), next.cueIndex(0));\n    }\n\n    if (addPostgap) {\n        chunks << getPart(next.cueIndex(0), next.cueIndex(1));\n    }\n\n    merge();\n}\n\n\/************************************************\n *\n ************************************************\/\nvoid Splitter::Job::merge()\n{\n    for (int i = chunks.size() - 2; i >= 0; --i) {\n        if (chunks.at(i).file == chunks.at(i + 1).file) {\n            chunks[i].end = chunks.at(i + 1).end;\n            chunks.removeAt(i + 1);\n        }\n    }\n}\n\n\/************************************************\n *\n ************************************************\/\nQList<Splitter::Job::Chunk> Splitter::Job::getPart(const CueIndex &from, const CueIndex &to) const\n{\n    \/\/qDebug() << \"***************************\";\n    \/\/qDebug() << \"* FROM: \" << from.file() << from.toString(true);\n    \/\/qDebug() << \"* TO:   \" << to.file() << to.toString(true);\n    \/\/qDebug() << \"***************************\";\n\n    \/\/ The 00 and 01 indexes are in the same file, or is it the last track (01 index is empty)\n    if (from.file() == to.file() || to.file().isEmpty()) {\n        if (from == to) {\n            return {};\n        }\n\n        Chunk res;\n        res.file  = getInputAudioFile(from.file());\n        res.start = from;\n        res.end   = to;\n        return { res };\n    }\n\n    Chunk first;\n    first.file  = getInputAudioFile(from.file());\n    first.start = from;\n\n    Chunk second;\n    first.file = getInputAudioFile(to.file());\n    first.end  = to;\n\n    return { first, second };\n}\n\n\/************************************************\n *\n ************************************************\/\nInputAudioFile Splitter::Job::getInputAudioFile(const QByteArray &fileTag) const\n{\n    QByteArray prevTag;\n\n    int n = 0;\n    for (int i = 0; i < disk->count(); ++i) {\n        const Track *t = disk->track(i);\n\n        for (int j = 0; j <= 1; ++j) {\n            if (t->cueIndex(j).file() == fileTag) {\n                return disk->audioFiles().at(n);\n            }\n\n            if (t->cueIndex(j).file() != prevTag) {\n                n++;\n                prevTag = t->cueIndex(j).file();\n            }\n        }\n    }\n\n    throw FlaconError(QString(\"Incorrect file tag %1\").arg(fileTag.data()));\n}\n\n\/************************************************\n *\n ************************************************\/\nSplitter::Splitter(Disc *disk, const ConvTracks &tracks, const QString &outDir, QObject *parent) :\n    Worker(parent),\n    mDisc(disk),\n    mTracks(tracks),\n    mOutDir(outDir)\n{\n}\n\n\/************************************************\n *\n ************************************************\/\nvoid Splitter::setPregapType(const PreGapType &pregapType)\n{\n    mPregapType = pregapType;\n}\n\n\/************************************************\n *\n ************************************************\/\nvoid Splitter::run()\n{\n    static QAtomicInteger<quint32> globalUid(1);\n    QString                        uid = QString(\"%1\").arg(globalUid.fetchAndAddRelaxed(1), 4, 10, QLatin1Char('0'));\n\n    \/\/ ******************************************\n    \/\/ Create jobs\n    QList<Job> jobs;\n    for (const ConvTrack &track : mTracks) {\n        if (track.isPregap()) {\n            Job job(mDisc, mTracks.first(), true, false, false);\n            job.outFileName = QString(\"%1\/pregap-%2.wav\").arg(mOutDir, uid);\n            job.isPregap    = true;\n            jobs << job;\n            continue;\n        }\n\n        bool addPregap = (track.index() == 0 && mPregapType == PreGapType::AddToFirstTrack);\n        Job  job(mDisc, track, addPregap, true, true);\n        job.outFileName = QString(\"%1\/track-%2_%3.wav\").arg(mOutDir, uid).arg(track.trackNum(), 2, 10, QLatin1Char('0'));\n        jobs << job;\n    }\n\n    for (const Job &job : jobs) {\n        qCDebug(LOG) << \"Spliter job _________________________\";\n        qCDebug(LOG) << \"  track index: \" << job.track.index();\n        qCDebug(LOG) << \"  outFileName: \" << job.outFileName;\n        qCDebug(LOG) << \"  isPregap:    \" << job.isPregap;\n        qCDebug(LOG) << \"  chunks:    \";\n        for (const Job::Chunk &chunk : job.chunks) {\n            qCDebug(LOG) << \"  * \" << chunk.start.toString() << \":\" << chunk.end.toString() << \" file\" << chunk.file.filePath();\n        }\n    }\n\n    \/\/ ******************************************\n    \/\/ Validate jobs\n    try {\n        if (jobs.isEmpty()) {\n            throw FlaconError(\"Jobs is empty\");\n        }\n\n        for (const Job &job : jobs) {\n            if (job.chunks.isEmpty()) {\n                throw FlaconError(\"Job chunks is empty\");\n            }\n        }\n    }\n    catch (FlaconError &err) {\n        qCWarning(LOG) << \"Incorrect splitter jobs : \" << err.what();\n        emit error(mTracks.first(), err.what());\n        return;\n    }\n\n    \/\/ ******************************************\n    \/\/ Create and open decoders\n    QObject                  keeper;\n    QMap<QString, Decoder *> decoders;\n    for (const Job &job : jobs) {\n        for (const Job::Chunk &chunk : job.chunks) {\n            decoders.insert(chunk.file.filePath(), nullptr);\n        }\n    }\n\n    for (const QString &file : decoders.keys()) {\n        try {\n            Decoder *decoder = new Decoder(&keeper);\n            decoder->open(file);\n            decoders[file] = decoder;\n        }\n        catch (FlaconError &err) {\n            emit error(mTracks.first(), tr(\"I can't read <b>%1<\/b>:<br>%2\", \"Splitter error. %1 is a file name, %2 is a system error text.\").arg(file, err.what()));\n            return;\n        }\n    }\n\n    for (Job &job : jobs) {\n        for (Job::Chunk &chunk : job.chunks) {\n            chunk.decoder = decoders.value(chunk.file.filePath());\n        }\n    }\n\n    \/\/ ******************************************\n    \/\/ Decode data\n    for (const Job &job : jobs) {\n        try {\n            processTrack(job);\n            qCDebug(LOG) << \"Splitter trackReady:\" << job.track << job.outFileName;\n            emit trackReady(job.track, job.outFileName);\n        }\n        catch (FlaconError &err) {\n            if (job.isPregap) {\n                qCWarning(LOG) << \"Splitter error for pregap track : \" << err.what();\n            }\n            else {\n                qCWarning(LOG) << \"Splitter error for track \" << job.track.trackNum() << \": \" << err.what();\n            }\n\n            emit error(job.track, err.what());\n            deleteFile(job.outFileName);\n            return;\n        }\n    }\n}\n\nstruct ProgressCalc\n{\n    uint64_t totalSize = 0;\n    uint64_t chunkSize = 0;\n    uint64_t chunkDone = 0;\n    uint64_t done      = 0;\n};\n\n\/************************************************\n *\n ************************************************\/\nvoid Splitter::processTrack(const Job &job)\n{\n\n    emit trackProgress(job.track, TrackState::Splitting, 0);\n\n    QFile outFile(job.outFileName);\n    if (!outFile.open(QFile::WriteOnly)) {\n        throw outFile.errorString();\n    }\n\n    uint32_t bytes = 0;\n    for (const Job::Chunk &chunk : job.chunks) {\n        bytes += chunk.decoder->bytesCount(chunk.start, chunk.end);\n    }\n\n    WavHeader hdr = job.chunks.first().decoder->wavHeader();\n    hdr.resizeData(bytes);\n    outFile.write(hdr.toLegacyWav());\n\n    ProgressCalc progress;\n    progress.totalSize = bytes;\n\n    for (const Job::Chunk &chunk : job.chunks) {\n        progress.chunkSize = chunk.decoder->bytesCount(chunk.start, chunk.end);\n\n        \/\/ Extract chunk .............................\n        QObject keeper;\n        connect(chunk.decoder, &Decoder::progress, &keeper, [this, job, progress](int percents) {\n            double chunkDone = double(percents) \/ 100 * progress.chunkSize;\n            emit   trackProgress(job.track, TrackState::Splitting, (progress.done + chunkDone) \/ progress.totalSize * 100);\n        });\n        progress.done += progress.chunkSize;\n\n        qCDebug(LOG) << \"extract: \" << chunk.file.filePath() << \" [\" << chunk.start.toString() << \":\" << chunk.end.toString() << \"] OUT:\" << job.outFileName;\n        chunk.decoder->extract(chunk.start, chunk.end, &outFile, false);\n    }\n\n    outFile.close();\n    emit trackProgress(job.track, TrackState::Splitting, 100);\n}\n<commit_msg>Close issue #186: Convertation error with two or more audio files<commit_after>\/* BEGIN_COMMON_COPYRIGHT_HEADER\n * (c)LGPL2+\n *\n * Flacon - audio File Encoder\n * https:\/\/github.com\/flacon\/flacon\n *\n * Copyright: 2012-2013\n *   Alexander Sokoloff <sokoloff.a@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 * END_COMMON_COPYRIGHT_HEADER *\/\n\n#include \"splitter.h\"\n#include \"disc.h\"\n#include \"decoder.h\"\n#include <QDebug>\n#include <QLoggingCategory>\n#include <QFile>\n\nnamespace {\nQ_LOGGING_CATEGORY(LOG, \"Splitter\")\n}\n\nusing namespace Conv;\n\nstruct Splitter::Job\n{\n    struct Chunk\n    {\n        InputAudioFile file;\n        CueTime        start;\n        CueTime        end;\n        Decoder *      decoder = nullptr;\n    };\n\n    const Disc *    disk = nullptr;\n    Conv::ConvTrack track;\n    QList<Chunk>    chunks;\n    QString         outFileName;\n    bool            isPregap = false;\n\n    Job(const Disc *disk, Conv::ConvTrack track, bool addPregap, bool addTrack, bool addPostgap);\n    QList<Chunk>   getPart(const CueIndex &from, const CueIndex &to) const;\n    void           merge();\n    InputAudioFile getInputAudioFile(const QByteArray &fileTag) const;\n};\n\n\/************************************************\n *\n ************************************************\/\nSplitter::Job::Job(const Disc *disk, Conv::ConvTrack track, bool addPregap, bool addTrack, bool addPostgap) :\n    disk(disk),\n    track(track)\n{\n    const Track cur  = *(disk->track(track.index()));\n    const Track next = (cur.index() + 1 < disk->count()) ? *(disk->track(cur.index() + 1)) : Track();\n\n    if (addPregap) {\n        chunks << getPart(cur.cueIndex(0), cur.cueIndex(1));\n    }\n\n    if (addTrack) {\n        chunks << getPart(cur.cueIndex(1), next.cueIndex(0));\n    }\n\n    if (addPostgap) {\n        chunks << getPart(next.cueIndex(0), next.cueIndex(1));\n    }\n\n    merge();\n}\n\n\/************************************************\n *\n ************************************************\/\nvoid Splitter::Job::merge()\n{\n    for (int i = chunks.size() - 2; i >= 0; --i) {\n        if (chunks.at(i).file == chunks.at(i + 1).file) {\n            chunks[i].end = chunks.at(i + 1).end;\n            chunks.removeAt(i + 1);\n        }\n    }\n}\n\n\/************************************************\n *\n ************************************************\/\nQList<Splitter::Job::Chunk> Splitter::Job::getPart(const CueIndex &from, const CueIndex &to) const\n{\n    \/\/qDebug() << \"***************************\";\n    \/\/qDebug() << \"* FROM: \" << from.file() << from.toString(true);\n    \/\/qDebug() << \"* TO:   \" << to.file() << to.toString(true);\n    \/\/qDebug() << \"***************************\";\n\n    \/\/ The 00 and 01 indexes are in the same file, or is it the last track (01 index is empty)\n    if (from.file() == to.file() || to.file().isEmpty()) {\n        if (from == to) {\n            return {};\n        }\n\n        Chunk res;\n        res.file  = getInputAudioFile(from.file());\n        res.start = from;\n        res.end   = to;\n        return { res };\n    }\n\n    Chunk first;\n    first.file  = getInputAudioFile(from.file());\n    first.start = from;\n\n    Chunk second;\n    second.file = getInputAudioFile(to.file());\n    second.end  = to;\n\n    return { first, second };\n}\n\n\/************************************************\n *\n ************************************************\/\nInputAudioFile Splitter::Job::getInputAudioFile(const QByteArray &fileTag) const\n{\n    QByteArray prevTag;\n\n    int n = 0;\n    for (int i = 0; i < disk->count(); ++i) {\n        const Track *t = disk->track(i);\n\n        for (int j = 0; j <= 1; ++j) {\n            if (t->cueIndex(j).file() == fileTag) {\n                return disk->audioFiles().at(n);\n            }\n\n            if (t->cueIndex(j).file() != prevTag) {\n                n++;\n                prevTag = t->cueIndex(j).file();\n            }\n        }\n    }\n\n    throw FlaconError(QString(\"Incorrect file tag %1\").arg(fileTag.data()));\n}\n\n\/************************************************\n *\n ************************************************\/\nSplitter::Splitter(Disc *disk, const ConvTracks &tracks, const QString &outDir, QObject *parent) :\n    Worker(parent),\n    mDisc(disk),\n    mTracks(tracks),\n    mOutDir(outDir)\n{\n}\n\n\/************************************************\n *\n ************************************************\/\nvoid Splitter::setPregapType(const PreGapType &pregapType)\n{\n    mPregapType = pregapType;\n}\n\n\/************************************************\n *\n ************************************************\/\nvoid Splitter::run()\n{\n    static QAtomicInteger<quint32> globalUid(1);\n    QString                        uid = QString(\"%1\").arg(globalUid.fetchAndAddRelaxed(1), 4, 10, QLatin1Char('0'));\n\n    \/\/ ******************************************\n    \/\/ Create jobs\n    QList<Job> jobs;\n    for (const ConvTrack &track : mTracks) {\n        if (track.isPregap()) {\n            Job job(mDisc, mTracks.first(), true, false, false);\n            job.outFileName = QString(\"%1\/pregap-%2.wav\").arg(mOutDir, uid);\n            job.isPregap    = true;\n            jobs << job;\n            continue;\n        }\n\n        bool addPregap = (track.index() == 0 && mPregapType == PreGapType::AddToFirstTrack);\n        Job  job(mDisc, track, addPregap, true, true);\n        job.outFileName = QString(\"%1\/track-%2_%3.wav\").arg(mOutDir, uid).arg(track.trackNum(), 2, 10, QLatin1Char('0'));\n        jobs << job;\n    }\n\n    for (const Job &job : jobs) {\n        qCDebug(LOG) << \"Spliter job _________________________\";\n        qCDebug(LOG) << \"  track index: \" << job.track.index();\n        qCDebug(LOG) << \"  outFileName: \" << job.outFileName;\n        qCDebug(LOG) << \"  isPregap:    \" << job.isPregap;\n        qCDebug(LOG) << \"  chunks:    \";\n        for (const Job::Chunk &chunk : job.chunks) {\n            qCDebug(LOG) << \"  * \" << chunk.start.toString() << \":\" << chunk.end.toString() << \" file\" << chunk.file.filePath();\n        }\n    }\n\n    \/\/ ******************************************\n    \/\/ Validate jobs\n    try {\n        if (jobs.isEmpty()) {\n            throw FlaconError(\"Jobs is empty\");\n        }\n\n        for (const Job &job : jobs) {\n            if (job.chunks.isEmpty()) {\n                throw FlaconError(\"Job chunks is empty\");\n            }\n        }\n    }\n    catch (FlaconError &err) {\n        qCWarning(LOG) << \"Incorrect splitter jobs : \" << err.what();\n        emit error(mTracks.first(), err.what());\n        return;\n    }\n\n    \/\/ ******************************************\n    \/\/ Create and open decoders\n    QObject                  keeper;\n    QMap<QString, Decoder *> decoders;\n    for (const Job &job : jobs) {\n        for (const Job::Chunk &chunk : job.chunks) {\n            decoders.insert(chunk.file.filePath(), nullptr);\n        }\n    }\n\n    for (const QString &file : decoders.keys()) {\n        try {\n            Decoder *decoder = new Decoder(&keeper);\n            decoder->open(file);\n            decoders[file] = decoder;\n        }\n        catch (FlaconError &err) {\n            emit error(mTracks.first(), tr(\"I can't read <b>%1<\/b>:<br>%2\", \"Splitter error. %1 is a file name, %2 is a system error text.\").arg(file, err.what()));\n            return;\n        }\n    }\n\n    for (Job &job : jobs) {\n        for (Job::Chunk &chunk : job.chunks) {\n            chunk.decoder = decoders.value(chunk.file.filePath());\n        }\n    }\n\n    \/\/ ******************************************\n    \/\/ Decode data\n    for (const Job &job : jobs) {\n        try {\n            processTrack(job);\n            qCDebug(LOG) << \"Splitter trackReady:\" << job.track << job.outFileName;\n            emit trackReady(job.track, job.outFileName);\n        }\n        catch (FlaconError &err) {\n            if (job.isPregap) {\n                qCWarning(LOG) << \"Splitter error for pregap track : \" << err.what();\n            }\n            else {\n                qCWarning(LOG) << \"Splitter error for track \" << job.track.trackNum() << \": \" << err.what();\n            }\n\n            emit error(job.track, err.what());\n            deleteFile(job.outFileName);\n            return;\n        }\n    }\n}\n\nstruct ProgressCalc\n{\n    uint64_t totalSize = 0;\n    uint64_t chunkSize = 0;\n    uint64_t chunkDone = 0;\n    uint64_t done      = 0;\n};\n\n\/************************************************\n *\n ************************************************\/\nvoid Splitter::processTrack(const Job &job)\n{\n\n    emit trackProgress(job.track, TrackState::Splitting, 0);\n\n    QFile outFile(job.outFileName);\n    if (!outFile.open(QFile::WriteOnly)) {\n        throw outFile.errorString();\n    }\n\n    uint32_t bytes = 0;\n    for (const Job::Chunk &chunk : job.chunks) {\n        bytes += chunk.decoder->bytesCount(chunk.start, chunk.end);\n    }\n\n    WavHeader hdr = job.chunks.first().decoder->wavHeader();\n    hdr.resizeData(bytes);\n    outFile.write(hdr.toLegacyWav());\n\n    ProgressCalc progress;\n    progress.totalSize = bytes;\n\n    for (const Job::Chunk &chunk : job.chunks) {\n        progress.chunkSize = chunk.decoder->bytesCount(chunk.start, chunk.end);\n\n        \/\/ Extract chunk .............................\n        QObject keeper;\n        connect(chunk.decoder, &Decoder::progress, &keeper, [this, job, progress](int percents) {\n            double chunkDone = double(percents) \/ 100 * progress.chunkSize;\n            emit   trackProgress(job.track, TrackState::Splitting, (progress.done + chunkDone) \/ progress.totalSize * 100);\n        });\n        progress.done += progress.chunkSize;\n\n        qCDebug(LOG) << \"extract: \" << chunk.file.filePath() << \" [\" << chunk.start.toString() << \":\" << chunk.end.toString() << \"] OUT:\" << job.outFileName;\n        chunk.decoder->extract(chunk.start, chunk.end, &outFile, false);\n    }\n\n    outFile.close();\n    emit trackProgress(job.track, TrackState::Splitting, 100);\n}\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 <boost\/range\/adaptors.hpp>\n\n#include \"GlobalContext.hpp\"\n#include \"FunctionContext.hpp\"\n#include \"Type.hpp\"\n#include \"Variable.hpp\"\n\n#include \"ltac\/prologue.hpp\"\n#include \"ltac\/Utils.hpp\"\n\nusing namespace eddic;\n\nnamespace {\n\nbool callee_save(mtac::function_p function, ltac::Register reg, Platform platform){\n    auto definition = function->definition; \n    auto return_type = definition->returnType;\n    auto descriptor = getPlatformDescriptor(platform);\n\n    if((return_type == INT || return_type == BOOL || return_type == CHAR) && reg.reg == descriptor->int_return_register1()){\n        return false;\n    } else if(return_type == STRING && (reg.reg == descriptor->int_return_register1() || reg.reg == descriptor->int_return_register2())){\n        return false;\n    } else if(return_type->is_pointer() && reg.reg == descriptor->int_return_register1()){ \n        return false;\n    }\n\n    return true;\n}\n\nvoid save_registers(mtac::function_p function, mtac::basic_block_p bb, Platform platform){\n    \/\/Save registers for all other functions than main\n    if(!function->is_main()){\n        \/\/TODO Ignore return register (if used as return), parameter register (if used as parameter)\n\n        for(auto& reg : function->use_registers()){\n            if(callee_save(function, reg, platform)){\n                ltac::add_instruction(bb, ltac::Operator::PUSH, reg);\n            }\n        }\n\n        for(auto& float_reg : function->use_float_registers()){\n            ltac::add_instruction(bb, ltac::Operator::SUB, ltac::SP, static_cast<int>(FLOAT->size(platform)));\n            ltac::add_instruction(bb, ltac::Operator::FMOV, ltac::Address(ltac::SP, 0), float_reg);\n        }\n    }\n}\n\nvoid restore_registers(mtac::function_p function, mtac::basic_block_p bb, Platform platform){\n    \/\/Save registers for all other functions than main\n    if(!function->is_main()){\n        \/\/TODO Ignore return register (if used as return), parameter register (if used as parameter)\n\n        for(auto& float_reg : boost::adaptors::reverse(function->use_float_registers())){\n            ltac::add_instruction(bb, ltac::Operator::FMOV, float_reg, ltac::Address(ltac::SP, 0));\n            ltac::add_instruction(bb, ltac::Operator::ADD, ltac::SP, static_cast<int>(FLOAT->size(platform)));\n        }\n\n        for(auto& reg : boost::adaptors::reverse(function->use_registers())){\n            if(callee_save(function, reg, platform)){\n                ltac::add_instruction(bb, ltac::Operator::POP, reg);\n            }\n        }\n    }\n}\n\ntemplate<typename It>\nvoid restore_registers(mtac::function_p function, It& it, Platform platform){\n    \/\/Save registers for all other functions than main\n    if(!function->is_main()){\n        \/\/TODO Ignore return register (if used as return), parameter register (if used as parameter)\n\n        for(auto& reg : function->use_registers()){\n            if(callee_save(function, reg, platform)){\n                it.insert(std::make_shared<ltac::Instruction>(ltac::Operator::POP, reg));\n            }\n        }\n\n        for(auto& float_reg : function->use_float_registers()){\n            it.insert(std::make_shared<ltac::Instruction>(ltac::Operator::ADD, ltac::SP, static_cast<int>(FLOAT->size(platform))));\n            it.insert(std::make_shared<ltac::Instruction>(ltac::Operator::FMOV, float_reg, ltac::Address(ltac::SP, 0)));\n        }\n    }\n}\n\n} \/\/End of anonymous\n\nvoid ltac::generate_prologue_epilogue(std::shared_ptr<mtac::Program> ltac_program, std::shared_ptr<Configuration> configuration){\n    bool omit_fp = configuration->option_defined(\"fomit-frame-pointer\");\n    auto platform = ltac_program->context->target_platform();\n\n    for(auto function : ltac_program->functions){\n        auto size = function->context->size();\n\n        \/\/1. Generate prologue\n        \n        auto bb = function->entry_bb();\n    \n        \/\/Enter stack frame\n        if(!omit_fp){\n            ltac::add_instruction(bb, ltac::Operator::ENTER);\n        }\n\n        \/\/Allocate stack space for locals\n        ltac::add_instruction(bb, ltac::Operator::SUB, ltac::SP, size);\n\n        auto iter = function->context->begin();\n        auto end = function->context->end();\n\n        \/\/Clear stack variables\n        for(; iter != end; iter++){\n            auto var = iter->second;\n\n            \/\/Only stack variables needs to be cleared\n            if(var->position().isStack()){\n                auto type = var->type();\n                int position = var->position().offset();\n\n                auto int_size = INT->size(platform);\n\n                if(type->is_array() && type->has_elements()){\n                    ltac::add_instruction(bb, ltac::Operator::MOV, ltac::Address(ltac::BP, position), static_cast<int>(type->elements()));\n                    ltac::add_instruction(bb, ltac::Operator::MEMSET, ltac::Address(ltac::BP, position + int_size), \n                            static_cast<int>((type->data_type()->size(platform) \/ int_size * type->elements())));\n                } else if(type->is_custom_type()){\n                    ltac::add_instruction(bb, ltac::Operator::MEMSET, ltac::Address(ltac::BP, position), static_cast<int>(type->size(platform) \/ int_size));\n                }\n            }\n        }\n\n        save_registers(function, bb, platform);\n\n        \/\/2. Generate epilogue\n\n        bb = function->exit_bb();\n\n        restore_registers(function, bb, platform);\n\n        ltac::add_instruction(bb, ltac::Operator::ADD, ltac::SP, size);\n\n        \/\/Leave stack frame\n        if(!omit_fp){\n            ltac::add_instruction(bb, ltac::Operator::LEAVE);\n        }\n\n        ltac::add_instruction(bb, ltac::Operator::RET);\n        \n        \/\/3. Generate epilogue for each unresolved RET\n        \n        for(auto& bb : function){\n            auto it = iterate(bb->l_statements);\n\n            while(it.has_next()){\n                auto statement = *it;\n\n                if(auto* ptr = boost::get<std::shared_ptr<ltac::Instruction>>(&statement)){\n                    if((*ptr)->op == ltac::Operator::PRE_RET){\n                        (*ptr)->op = ltac::Operator::RET;\n\n                        \/\/Leave stack frame\n                        if(!omit_fp){\n                            it.insert(std::make_shared<ltac::Instruction>(ltac::Operator::LEAVE));\n                        }\n\n                        it.insert(std::make_shared<ltac::Instruction>(ltac::Operator::ADD, ltac::SP, size));\n\n                        restore_registers(function, it, platform);\n                    }\n                }\n\n                ++it;\n            }\n        }\n    }\n}\n<commit_msg>Do not save float return register as well<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 <boost\/range\/adaptors.hpp>\n\n#include \"GlobalContext.hpp\"\n#include \"FunctionContext.hpp\"\n#include \"Type.hpp\"\n#include \"Variable.hpp\"\n\n#include \"ltac\/prologue.hpp\"\n#include \"ltac\/Utils.hpp\"\n\nusing namespace eddic;\n\nnamespace {\n\nbool callee_save(mtac::function_p function, ltac::Register reg, Platform platform){\n    auto definition = function->definition; \n    auto return_type = definition->returnType;\n    auto descriptor = getPlatformDescriptor(platform);\n\n    if((return_type == INT || return_type == BOOL || return_type == CHAR) && reg.reg == descriptor->int_return_register1()){\n        return false;\n    } else if(return_type == STRING && (reg.reg == descriptor->int_return_register1() || reg.reg == descriptor->int_return_register2())){\n        return false;\n    } else if(return_type->is_pointer() && reg.reg == descriptor->int_return_register1()){ \n        return false;\n    }\n\n    return true;\n}\n\nbool callee_save(mtac::function_p function, ltac::FloatRegister reg, Platform platform){\n    auto definition = function->definition; \n    auto return_type = definition->returnType;\n    auto descriptor = getPlatformDescriptor(platform);\n\n    if(return_type == FLOAT && reg.reg == descriptor->float_return_register()){\n        return false;\n    } \n\n    return true;\n}\n\nvoid save_registers(mtac::function_p function, mtac::basic_block_p bb, Platform platform){\n    \/\/Save registers for all other functions than main\n    if(!function->is_main()){\n        \/\/TODO Ignore return register (if used as return), parameter register (if used as parameter)\n\n        for(auto& reg : function->use_registers()){\n            if(callee_save(function, reg, platform)){\n                ltac::add_instruction(bb, ltac::Operator::PUSH, reg);\n            }\n        }\n\n        for(auto& float_reg : function->use_float_registers()){\n            if(callee_save(function, float_reg, platform)){\n                ltac::add_instruction(bb, ltac::Operator::SUB, ltac::SP, static_cast<int>(FLOAT->size(platform)));\n                ltac::add_instruction(bb, ltac::Operator::FMOV, ltac::Address(ltac::SP, 0), float_reg);\n            }\n        }\n    }\n}\n\nvoid restore_registers(mtac::function_p function, mtac::basic_block_p bb, Platform platform){\n    \/\/Save registers for all other functions than main\n    if(!function->is_main()){\n        \/\/TODO Ignore return register (if used as return), parameter register (if used as parameter)\n\n        for(auto& float_reg : boost::adaptors::reverse(function->use_float_registers())){\n            if(callee_save(function, float_reg, platform)){\n                ltac::add_instruction(bb, ltac::Operator::FMOV, float_reg, ltac::Address(ltac::SP, 0));\n                ltac::add_instruction(bb, ltac::Operator::ADD, ltac::SP, static_cast<int>(FLOAT->size(platform)));\n            }\n        }\n\n        for(auto& reg : boost::adaptors::reverse(function->use_registers())){\n            if(callee_save(function, reg, platform)){\n                ltac::add_instruction(bb, ltac::Operator::POP, reg);\n            }\n        }\n    }\n}\n\ntemplate<typename It>\nvoid restore_registers(mtac::function_p function, It& it, Platform platform){\n    \/\/Save registers for all other functions than main\n    if(!function->is_main()){\n        \/\/TODO Ignore return register (if used as return), parameter register (if used as parameter)\n\n        for(auto& reg : function->use_registers()){\n            if(callee_save(function, reg, platform)){\n                it.insert(std::make_shared<ltac::Instruction>(ltac::Operator::POP, reg));\n            }\n        }\n\n        for(auto& float_reg : function->use_float_registers()){\n            if(callee_save(function, float_reg, platform)){\n                it.insert(std::make_shared<ltac::Instruction>(ltac::Operator::ADD, ltac::SP, static_cast<int>(FLOAT->size(platform))));\n                it.insert(std::make_shared<ltac::Instruction>(ltac::Operator::FMOV, float_reg, ltac::Address(ltac::SP, 0)));\n            }\n        }\n    }\n}\n\n} \/\/End of anonymous\n\nvoid ltac::generate_prologue_epilogue(std::shared_ptr<mtac::Program> ltac_program, std::shared_ptr<Configuration> configuration){\n    bool omit_fp = configuration->option_defined(\"fomit-frame-pointer\");\n    auto platform = ltac_program->context->target_platform();\n\n    for(auto function : ltac_program->functions){\n        auto size = function->context->size();\n\n        \/\/1. Generate prologue\n        \n        auto bb = function->entry_bb();\n    \n        \/\/Enter stack frame\n        if(!omit_fp){\n            ltac::add_instruction(bb, ltac::Operator::ENTER);\n        }\n\n        \/\/Allocate stack space for locals\n        ltac::add_instruction(bb, ltac::Operator::SUB, ltac::SP, size);\n\n        auto iter = function->context->begin();\n        auto end = function->context->end();\n\n        \/\/Clear stack variables\n        for(; iter != end; iter++){\n            auto var = iter->second;\n\n            \/\/Only stack variables needs to be cleared\n            if(var->position().isStack()){\n                auto type = var->type();\n                int position = var->position().offset();\n\n                auto int_size = INT->size(platform);\n\n                if(type->is_array() && type->has_elements()){\n                    ltac::add_instruction(bb, ltac::Operator::MOV, ltac::Address(ltac::BP, position), static_cast<int>(type->elements()));\n                    ltac::add_instruction(bb, ltac::Operator::MEMSET, ltac::Address(ltac::BP, position + int_size), \n                            static_cast<int>((type->data_type()->size(platform) \/ int_size * type->elements())));\n                } else if(type->is_custom_type()){\n                    ltac::add_instruction(bb, ltac::Operator::MEMSET, ltac::Address(ltac::BP, position), static_cast<int>(type->size(platform) \/ int_size));\n                }\n            }\n        }\n\n        save_registers(function, bb, platform);\n\n        \/\/2. Generate epilogue\n\n        bb = function->exit_bb();\n\n        restore_registers(function, bb, platform);\n\n        ltac::add_instruction(bb, ltac::Operator::ADD, ltac::SP, size);\n\n        \/\/Leave stack frame\n        if(!omit_fp){\n            ltac::add_instruction(bb, ltac::Operator::LEAVE);\n        }\n\n        ltac::add_instruction(bb, ltac::Operator::RET);\n        \n        \/\/3. Generate epilogue for each unresolved RET\n        \n        for(auto& bb : function){\n            auto it = iterate(bb->l_statements);\n\n            while(it.has_next()){\n                auto statement = *it;\n\n                if(auto* ptr = boost::get<std::shared_ptr<ltac::Instruction>>(&statement)){\n                    if((*ptr)->op == ltac::Operator::PRE_RET){\n                        (*ptr)->op = ltac::Operator::RET;\n\n                        \/\/Leave stack frame\n                        if(!omit_fp){\n                            it.insert(std::make_shared<ltac::Instruction>(ltac::Operator::LEAVE));\n                        }\n\n                        it.insert(std::make_shared<ltac::Instruction>(ltac::Operator::ADD, ltac::SP, size));\n\n                        restore_registers(function, it, platform);\n                    }\n                }\n\n                ++it;\n            }\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\nThis file is part of Bohrium and copyright (c) 2012 the Bohrium\nteam <http:\/\/www.bh107.org>.\n\nBohrium is free software: you can redistribute it and\/or modify\nit under the terms of the GNU Lesser General Public License as\npublished by the Free Software Foundation, either version 3\nof the License, or (at your option) any later version.\n\nBohrium is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\nGNU General Public License for more details.\n\nYou should have received a copy of the\nGNU Lesser General Public License along with Bohrium.\n\nIf not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <string>\n#include <cstring>\n#include <bh.h>\n#include \"bh_fuse.h\"\n#include \"bh_fuse_cache.h\"\n#include <fstream>\n#include <exception>\n#include <boost\/archive\/text_oarchive.hpp>\n#include <boost\/archive\/text_iarchive.hpp>\n#include <boost\/serialization\/vector.hpp>\n#include <boost\/filesystem.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/version.hpp>\n#include <boost\/algorithm\/string\/predicate.hpp> \/\/For iequals()\n\nusing namespace std;\nusing namespace boost;\nusing namespace boost::filesystem;\n\nnamespace bohrium {\n\n    \/\/Constructor of the InstrHash class\n    InstrHash::InstrHash(BatchHash &batch, const bh_instruction &instr)\n    {\n        BOOST_FOREACH(const bh_view &view, instr.operand)\n        {\n            if(bh_is_constant(&view))\/\/We ignore constants\n                continue;\n\n            \/\/Hash the base array pointer\n            uint64_t base_id;\n            map<const bh_base*, uint64_t>::iterator it = batch.base2id.find(view.base);\n            if(it != batch.base2id.end())\n            {\n                base_id = it->second;\n            }\n            else\n            {\n                base_id = batch.base_id_count++;\n                batch.base2id.insert(make_pair(view.base, base_id));\n            }\n            this->append((char*)&base_id, sizeof(base_id));\n\n            \/\/Hash ndim and start\n            this->append((char*)&view.ndim, sizeof(view.ndim));\n            this->append((char*)&view.start, sizeof(view.start));\n\n            \/\/Hash shape and stride\n            this->append((char*)view.shape, sizeof(bh_index)*view.ndim);\n            this->append((char*)view.stride, sizeof(bh_index)*view.ndim);\n        }\n    }\n\n    \/\/Constructor of the BatchHash class\n    BatchHash::BatchHash(const vector<bh_instruction> &instr_list):base_id_count(0)\n    {\n        string data;\n        BOOST_FOREACH(const bh_instruction &instr, instr_list)\n        {\n            data.append(InstrHash(*this, instr));\n        }\n        boost::hash<string> hasher;\n        _hash = hasher(data);\n    }\n\n    void FuseCache::insert(const BatchHash &batch,\n                           const vector<bh_ir_kernel> &kernel_list)\n    {\n        cache[batch.hash()] = InstrIndexesList(kernel_list, batch.hash(), fuser_name);\n    }\n\n    bool FuseCache::lookup(const BatchHash &batch,\n                           bh_ir &bhir,\n                           vector<bh_ir_kernel> &kernel_list) const\n    {\n\/\/        cout << \"looking up \" << batch.hash() << \": \";\n\n        assert(kernel_list.size() == 0);\n        CacheMap::const_iterator it = cache.find(batch.hash());\n        if(it == cache.end())\n        {\n\/\/            cout << \"cache miss!\" << endl;\n            return false;\n        }\n        else\n        {\n            it->second.fill_kernel_list(bhir, kernel_list);\n\/\/          cout << \"cache hit!\" << endl;\n          return true;\n        }\n    }\n\n    void FuseCache::write_to_files() const\n    {\n        if(dir_path == NULL)\n        {\n            cout << \"[FUSE-CACHE] Couldn't find the 'cache_path' key in \"\\\n            \"the configure file thus no cache files are written to disk!\" << endl;\n            return;\n        }\n        path cache_dir(dir_path);\n        if(create_directories(cache_dir))\n        {\n            cout << \"[FUSE-CACHE] Creating cache diretory \" << cache_dir << endl;\n        #if BOOST_VERSION > 104900\n            permissions(cache_dir, all_all);\n        #endif\n        }\n\n        path tmp_dir = cache_dir \/ unique_path();\n        create_directories(tmp_dir);\n        for(CacheMap::const_iterator it=cache.begin(); it != cache.end(); ++it)\n        {\n            string name;\n            it->second.get_filename(name);\n            path shared_name = cache_dir \/ name;\n\n            if(exists(shared_name))\n                continue;\/\/No need to overwrite an existing file\n\n            path unique_name = tmp_dir \/ name;\n            ofstream ofs(unique_name.string().c_str());\n            boost::archive::text_oarchive oa(ofs);\n            oa << it->second;\n            ofs.close();\n        #if BOOST_VERSION > 104900\n            permissions(unique_name, all_all);\n        #endif\n            rename(unique_name, shared_name);\n        }\n        remove(tmp_dir);\n    }\n\n    void FuseCache::load_from_files()\n    {\n        if(dir_path == NULL)\n        {\n            cout << \"[FUSE-CACHE] Couldn't find the 'cache_path' key in \"\\\n            \"the configure file thus no cache files are loaded from disk!\" << endl;\n            return;\n        }\n        path p(dir_path);\n        if(not (exists(p) and is_directory(p)))\n            return;\n\n        string fuse_model_name;\n        fuse_model_text(fuse_get_selected_model(), fuse_model_name);\n\n        \/\/Iterate the 'dir_path' diretory and load each file\n        directory_iterator it(p), eod;\n        BOOST_FOREACH(const path &f, make_pair(it, eod))\n        {\n            if(is_regular_file(f))\n            {\n                int tries = 0;\n                while(1)\n                {\n                    try\n                    {\n                        ifstream ifs(f.string().c_str());\n                        boost::archive::text_iarchive ia(ifs);\n                        InstrIndexesList t;\n                        ia >> t;\n                        if(iequals(t.fuser_name(), fuser_name) and\n                           iequals(t.fuse_model(), fuse_model_name))\n                        {\n                            cache[t.hash()] = t;\n                        }\n                    }\n                    catch(const std::exception &e)\n                    {\n                        if(++tries >= 10)\n                        {\n                            cerr << \"[FUSE-CACHE] failed to open file '\" << f.string();\n                            cerr << \"' (\" << tries << \" tries): \" << e.what() << endl;\n                        }\n                        else\n                            continue;\n                    }\n                    break;\n                }\n            }\n        }\n    }\n} \/\/namespace bohrium\n<commit_msg>fuse-cache: now FuseCache::load_from_files() ignores cache files with a higher cost<commit_after>\/*\nThis file is part of Bohrium and copyright (c) 2012 the Bohrium\nteam <http:\/\/www.bh107.org>.\n\nBohrium is free software: you can redistribute it and\/or modify\nit under the terms of the GNU Lesser General Public License as\npublished by the Free Software Foundation, either version 3\nof the License, or (at your option) any later version.\n\nBohrium is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\nGNU General Public License for more details.\n\nYou should have received a copy of the\nGNU Lesser General Public License along with Bohrium.\n\nIf not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <string>\n#include <cstring>\n#include <bh.h>\n#include \"bh_fuse.h\"\n#include \"bh_fuse_cache.h\"\n#include <fstream>\n#include <exception>\n#include <boost\/archive\/text_oarchive.hpp>\n#include <boost\/archive\/text_iarchive.hpp>\n#include <boost\/serialization\/vector.hpp>\n#include <boost\/filesystem.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/version.hpp>\n#include <boost\/algorithm\/string\/predicate.hpp> \/\/For iequals()\n\nusing namespace std;\nusing namespace boost;\nusing namespace boost::filesystem;\n\nnamespace bohrium {\n\n    \/\/Constructor of the InstrHash class\n    InstrHash::InstrHash(BatchHash &batch, const bh_instruction &instr)\n    {\n        BOOST_FOREACH(const bh_view &view, instr.operand)\n        {\n            if(bh_is_constant(&view))\/\/We ignore constants\n                continue;\n\n            \/\/Hash the base array pointer\n            uint64_t base_id;\n            map<const bh_base*, uint64_t>::iterator it = batch.base2id.find(view.base);\n            if(it != batch.base2id.end())\n            {\n                base_id = it->second;\n            }\n            else\n            {\n                base_id = batch.base_id_count++;\n                batch.base2id.insert(make_pair(view.base, base_id));\n            }\n            this->append((char*)&base_id, sizeof(base_id));\n\n            \/\/Hash ndim and start\n            this->append((char*)&view.ndim, sizeof(view.ndim));\n            this->append((char*)&view.start, sizeof(view.start));\n\n            \/\/Hash shape and stride\n            this->append((char*)view.shape, sizeof(bh_index)*view.ndim);\n            this->append((char*)view.stride, sizeof(bh_index)*view.ndim);\n        }\n    }\n\n    \/\/Constructor of the BatchHash class\n    BatchHash::BatchHash(const vector<bh_instruction> &instr_list):base_id_count(0)\n    {\n        string data;\n        BOOST_FOREACH(const bh_instruction &instr, instr_list)\n        {\n            data.append(InstrHash(*this, instr));\n        }\n        boost::hash<string> hasher;\n        _hash = hasher(data);\n    }\n\n    void FuseCache::insert(const BatchHash &batch,\n                           const vector<bh_ir_kernel> &kernel_list)\n    {\n        cache[batch.hash()] = InstrIndexesList(kernel_list, batch.hash(), fuser_name);\n    }\n\n    bool FuseCache::lookup(const BatchHash &batch,\n                           bh_ir &bhir,\n                           vector<bh_ir_kernel> &kernel_list) const\n    {\n\/\/        cout << \"looking up \" << batch.hash() << \": \";\n\n        assert(kernel_list.size() == 0);\n        CacheMap::const_iterator it = cache.find(batch.hash());\n        if(it == cache.end())\n        {\n\/\/            cout << \"cache miss!\" << endl;\n            return false;\n        }\n        else\n        {\n            it->second.fill_kernel_list(bhir, kernel_list);\n\/\/          cout << \"cache hit!\" << endl;\n          return true;\n        }\n    }\n\n    void FuseCache::write_to_files() const\n    {\n        if(dir_path == NULL)\n        {\n            cout << \"[FUSE-CACHE] Couldn't find the 'cache_path' key in \"\\\n            \"the configure file thus no cache files are written to disk!\" << endl;\n            return;\n        }\n        path cache_dir(dir_path);\n        if(create_directories(cache_dir))\n        {\n            cout << \"[FUSE-CACHE] Creating cache diretory \" << cache_dir << endl;\n        #if BOOST_VERSION > 104900\n            permissions(cache_dir, all_all);\n        #endif\n        }\n\n        path tmp_dir = cache_dir \/ unique_path();\n        create_directories(tmp_dir);\n        for(CacheMap::const_iterator it=cache.begin(); it != cache.end(); ++it)\n        {\n            string name;\n            it->second.get_filename(name);\n            path shared_name = cache_dir \/ name;\n\n            if(exists(shared_name))\n                continue;\/\/No need to overwrite an existing file\n\n            path unique_name = tmp_dir \/ name;\n            ofstream ofs(unique_name.string().c_str());\n            boost::archive::text_oarchive oa(ofs);\n            oa << it->second;\n            ofs.close();\n        #if BOOST_VERSION > 104900\n            permissions(unique_name, all_all);\n        #endif\n            rename(unique_name, shared_name);\n        }\n        remove(tmp_dir);\n    }\n\n    void FuseCache::load_from_files()\n    {\n        if(dir_path == NULL)\n        {\n            cout << \"[FUSE-CACHE] Couldn't find the 'cache_path' key in \"\\\n            \"the configure file thus no cache files are loaded from disk!\" << endl;\n            return;\n        }\n        path p(dir_path);\n        if(not (exists(p) and is_directory(p)))\n            return;\n\n        string fuse_model_name;\n        fuse_model_text(fuse_get_selected_model(), fuse_model_name);\n\n        \/\/Iterate the 'dir_path' diretory and load each file\n        directory_iterator it(p), eod;\n        BOOST_FOREACH(const path &f, make_pair(it, eod))\n        {\n            if(is_regular_file(f))\n            {\n                int tries = 0;\n                while(1)\n                {\n                    try\n                    {\n                        ifstream ifs(f.string().c_str());\n                        boost::archive::text_iarchive ia(ifs);\n                        InstrIndexesList t;\n                        ia >> t;\n                        if(iequals(t.fuser_name(), fuser_name) and\n                           iequals(t.fuse_model(), fuse_model_name))\n                        {\n                            if(cache.find(t.hash()) != cache.end())\n                            {\n                                if(cache[t.hash()].cost() < t.cost())\n                                {\n                                    cout << \"[FUSE-CACHE] ignoring cache file with higher cost\" << endl;\n                                    break;\n                                }\n                            }\n                            cache[t.hash()] = t;\n                        }\n                    }\n                    catch(const std::exception &e)\n                    {\n                        if(++tries >= 10)\n                        {\n                            cerr << \"[FUSE-CACHE] failed to open file '\" << f.string();\n                            cerr << \"' (\" << tries << \" tries): \" << e.what() << endl;\n                        }\n                        else\n                            continue;\n                    }\n                    break;\n                }\n            }\n        }\n    }\n} \/\/namespace bohrium\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\r\n#include <algorithm>\r\n#include <numeric>\r\n#include <string>\r\n#include <type_traits>\r\n\r\ntemplate<typename T>\r\ninline T gcd(T a, T b) {\r\n\twhile (b != 0) {\r\n\t\ta %= b;\r\n\t\tstd::swap(a, b);\r\n\t}\r\n\treturn a;\r\n}\r\n\r\ntemplate<typename T>\r\ninline T lcm(const T& a, const T& b) {\r\n\treturn a \/ gcd(a, b) * b;\r\n}\r\n\r\ntemplate<typename T>\r\nconstexpr inline T sqr(const T& x) {\r\n\treturn x * x;\r\n}\r\n\r\ntemplate<typename T>\r\nT factorial(T n) {\r\n\tT ret = 1;\r\n\tfor (int i = 2; i <= n; ++i) {\r\n\t\tret *= i;\r\n\t}\r\n\treturn ret;\r\n}\r\n\r\ntemplate<typename T, typename U>\r\ninline T binpow(T a, U b) {\r\n\tstatic_assert(std::is_integral<U>::value, \"Degree must be integral. For real degree use pow.\");\r\n\tT ret = 1;\r\n\twhile (b != 0) {\r\n\t\tif ((b & 1) != 0) {\r\n\t\t\tret *= a;\r\n\t\t}\r\n\t\ta *= a;\r\n\t\tb >>= 1;\r\n\t}\r\n\treturn ret;\r\n}\r\n\r\ntemplate<typename T, typename U, typename Q>\r\ninline T binpow(T a, U b, Q mod) {\r\n\tstatic_assert(std::is_integral<U>::value, \"Degree must be integral. For real degree use pow.\");\r\n\tlong long ret = 1;\r\n\ta %= mod;\r\n\twhile (b != 0) {\r\n\t\tif ((b & 1) != 0) {\r\n\t\t\tret = ret * a % mod;\r\n\t\t}\r\n\t\ta = a * a % mod;\r\n\t\tb >>= 1;\r\n\t}\r\n\treturn ret % mod;\r\n}\r\n\r\ntemplate<typename T>\r\nT digit_sum(const T n) {\r\n\tT res = 0;\r\n\tT tmp = abs(n);\r\n\twhile (tmp > 0) {\r\n\t\tres += tmp % 10;\r\n\t\ttmp \/= 10;\r\n\t}\r\n\treturn res;\r\n}\r\n\r\ntemplate<typename T>\r\nstd::vector<size_t> digits(const T n) {\r\n\tif (n == 0) {\r\n\t\treturn{ 0 };\r\n\t}\r\n\tstd::vector<size_t> res;\r\n\tT tmp = abs(n);\r\n\twhile (tmp > 0) {\r\n\t\tres.emplace_back(tmp % 10);\r\n\t\ttmp \/= 10;\r\n\t}\r\n\treturn res;\r\n}\r\n\r\ntemplate<typename T>\r\nsize_t digit_count(const T n) {\r\n\treturn digits(n).size();\r\n}\r\n\r\ntemplate<typename T>\r\nstd::vector<T> divisors_vector(const T n) {\r\n\tconst auto approximate_divisors_count = static_cast<size_t>(cbrt(n));\r\n\tstd::vector<T> ans;\r\n\tans.reserve(approximate_divisors_count);\r\n\tconst auto floored_square_root = static_cast<T>(sqrt(n));\r\n\tfor (T i = 1; i <= floored_square_root; ++i) {\r\n\t\tif (n % i == 0) {\r\n\t\t\tans.emplace_back(i);\r\n\t\t\tif (n \/ i != i) {\r\n\t\t\t\tans.emplace_back(n \/ i);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\treturn ans;\r\n}\r\n\r\ntemplate<typename T>\r\nT euler_function(T n) {\r\n\tT res = n;\r\n\tfor (T i = 2; i * i <= n; ++i) {\r\n\t\tif (n % i == 0) {\r\n\t\t\twhile (n % i == 0) {\r\n\t\t\t\tn \/= i;\r\n\t\t\t}\r\n\t\t\tres -= res \/ i;\r\n\t\t}\r\n\t}\r\n\tif (n > 1) {\r\n\t\tres -= res \/ n;\r\n\t}\r\n\treturn res;\r\n}\r\n\r\ntemplate<typename T, typename U>\r\nT inverse_element(const T n, const U mod)\r\n\/\/ inverse element for prime mod\r\n{\r\n\treturn binpow(static_cast<long long>(n), mod - 2, mod);\r\n}\r\n\r\ninline void inverseElementForSegment(int r[], const int n, const int mod)\r\n\/\/ inverse element for prime mod for numbers [1; mod - 1]\r\n{\r\n\tr[1] = 1;\r\n\tfor (int i = 2; i < n; ++i) {\r\n\t\tr[i] = (mod - static_cast<long long>(mod) \/ i * r[mod % i] % mod) % mod;\r\n\t}\r\n}\r\n\r\ntemplate<typename T>\r\nT inverse_element_comp_mod(const T n, const T mod)\r\n\/\/ inverse element for composite mod using formula inv(n) = n^(phi(mod) - 1)\r\n{\r\n\treturn binpow(n, euler_function(mod) - 1, mod);\r\n}\r\n\r\ntemplate<typename T>\r\nvoid binomial_coefficients(const size_t n, std::vector<std::vector<T>>* c) {\r\n\tstd::vector<std::vector<T>> result(n, std::vector<T>(n));\r\n\tfor (size_t i = 0; i < n; ++i) {\r\n\t\tresult[i][0] = 1;\r\n\t\tresult[i][i] = 1;\r\n\t\tfor (size_t j = 1; j < i; ++j) {\r\n\t\t\tresult[i][j] = result[i - 1][j - 1] + result[i - 1][j];\r\n\t\t}\r\n\t}\r\n\tc->swap(result);\r\n}\r\n\r\ntemplate<class T> std::string toRoman(T n) {\r\n\tconst int ValsCount = 13;\r\n\tconst int Vals[] = { 1, 4, 5, 9, 10, 40, 50, 90, 100, 400, 500, 900, 1000 };\r\n\tconst char * Digits[] = { \"I\", \"IV\", \"V\", \"IX\", \"X\", \"XL\", \"L\", \"XC\", \"C\", \"CD\", \"D\", \"CM\", \"M\" };\r\n\tstd::string res = \"\";\r\n\tint x = ValsCount - 1;\r\n\twhile (n) {\r\n\t\twhile (Vals[x] > n) {\r\n\t\t\t--x;\r\n\t\t}\r\n\t\tn -= Vals[x];\r\n\t\tres += Digits[x];\r\n\t}\r\n\treturn res;\r\n}\r\n\r\ntemplate<typename T>\r\nstd::vector<T> calc_powers(const T base, const size_t n) {\r\n\tstd::vector<T> powers(n + 1);\r\n\tpowers[0] = 1;\r\n\tfor (size_t i = 1; i < powers.size(); ++i) {\r\n\t\tpowers[i] = powers[i - 1] * base;\r\n\t}\r\n\treturn powers;\r\n}\r\n\r\ntemplate<typename T>\r\nstd::vector<T> calc_factorial(const size_t n) {\r\n\tstd::vector<T> factorial(n + 1);\r\n\tfactorial[0] = 1;\r\n\tfor (size_t i = 1; i < factorial.size(); ++i) {\r\n\t\tfactorial[i] = factorial[i - 1] * i;\r\n\t}\r\n\treturn factorial;\r\n}\r\n\r\ninline uint32_t abs(const uint32_t x) {\r\n\treturn x;\r\n}\r\n\r\ninline uint64_t abs(const uint64_t x) {\r\n\treturn x;\r\n}\r\n<commit_msg>Minor fixes in maths\/maths.hpp.<commit_after>#pragma once\r\n#include <algorithm>\r\n#include <numeric>\r\n#include <string>\r\n#include <type_traits>\r\n\r\ntemplate<typename T>\r\ninline T gcd(T a, T b) {\r\n\twhile (b != 0) {\r\n\t\ta %= b;\r\n\t\tstd::swap(a, b);\r\n\t}\r\n\treturn a;\r\n}\r\n\r\ntemplate<typename T>\r\ninline T lcm(const T& a, const T& b) {\r\n    return a \/ gcd(a, b) * b;\r\n}\r\n\r\ntemplate<typename T>\r\nconstexpr inline T sqr(const T& x) {\r\n    return x * x;\r\n}\r\n\r\ntemplate<typename T>\r\nT factorial(const size_t n) {\r\n\tT ret = 1;\r\n\tfor (size_t i = 2; i <= n; ++i) {\r\n\t\tret *= i;\r\n\t}\r\n\treturn ret;\r\n}\r\n\r\ntemplate<typename T, typename U>\r\ninline T binpow(T a, U b) {\r\n\tstatic_assert(std::is_integral<U>::value, \"Degree must be integral. For real degree use pow().\");\r\n\tT ret = 1;\r\n\twhile (b != 0) {\r\n\t\tif ((b & 1) != 0) {\r\n\t\t\tret *= a;\r\n\t\t}\r\n\t\ta *= a;\r\n\t\tb >>= 1;\r\n\t}\r\n\treturn ret;\r\n}\r\n\r\ntemplate<typename T, typename U, typename Q>\r\ninline T binpow(T a, U b, Q mod) {\r\n\tstatic_assert(std::is_integral<U>::value, \"Degree must be integral. For real degree use pow().\");\r\n\tlong long ret = 1;\r\n\ta %= mod;\r\n\twhile (b != 0) {\r\n\t\tif ((b & 1) != 0) {\r\n\t\t\tret = ret * a % mod;\r\n\t\t}\r\n\t\ta = a * a % mod;\r\n\t\tb >>= 1;\r\n\t}\r\n\treturn ret % mod;\r\n}\r\n\r\ntemplate<typename T>\r\nT digit_sum(const T n) {\r\n\tT res = 0;\r\n\tT tmp = abs(n);\r\n\twhile (tmp > 0) {\r\n\t\tres += tmp % 10;\r\n\t\ttmp \/= 10;\r\n\t}\r\n\treturn res;\r\n}\r\n\r\ntemplate<typename T>\r\nstd::vector<size_t> digits(const T n) {\r\n\tif (n == 0) {\r\n\t\treturn{ 0 };\r\n\t}\r\n\tstd::vector<size_t> res;\r\n\tT tmp = abs(n);\r\n\twhile (tmp > 0) {\r\n\t\tres.emplace_back(tmp % 10);\r\n\t\ttmp \/= 10;\r\n\t}\r\n\treturn res;\r\n}\r\n\r\ntemplate<typename T>\r\nsize_t digit_count(const T n) {\r\n\treturn digits(n).size();\r\n}\r\n\r\ntemplate<typename T>\r\nstd::vector<T> divisors_vector(const T n) {\r\n\tconst auto approximate_divisors_count = static_cast<size_t>(std::cbrt(n));\r\n\tstd::vector<T> ans;\r\n\tans.reserve(approximate_divisors_count);\r\n\tconst auto floored_square_root = static_cast<T>(sqrt(n));\r\n\tfor (T i = 1; i <= floored_square_root; ++i) {\r\n\t\tif (n % i == 0) {\r\n\t\t\tans.emplace_back(i);\r\n\t\t\tif (n \/ i != i) {\r\n\t\t\t\tans.emplace_back(n \/ i);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\treturn ans;\r\n}\r\n\r\ntemplate<typename T>\r\nT euler_function(T n) {\r\n\tT res = n;\r\n\tfor (T i = 2; i * i <= n; ++i) {\r\n\t\tif (n % i == 0) {\r\n\t\t\twhile (n % i == 0) {\r\n\t\t\t\tn \/= i;\r\n\t\t\t}\r\n\t\t\tres -= res \/ i;\r\n\t\t}\r\n\t}\r\n\tif (n > 1) {\r\n\t\tres -= res \/ n;\r\n\t}\r\n\treturn res;\r\n}\r\n\r\ntemplate<typename T, typename U>\r\nT inverse_element(const T n, const U mod)\r\n\/\/ inverse element for prime mod\r\n{\r\n\treturn binpow(static_cast<long long>(n), mod - 2, mod);\r\n}\r\n\r\ninline void inverseElementForSegment(int r[], const int n, const int mod)\r\n\/\/ inverse element for prime mod for numbers [1; mod - 1]\r\n{\r\n\tr[1] = 1;\r\n\tfor (int i = 2; i < n; ++i) {\r\n\t\tr[i] = (mod - static_cast<long long>(mod) \/ i * r[mod % i] % mod) % mod;\r\n\t}\r\n}\r\n\r\ntemplate<typename T>\r\nT inverse_element_comp_mod(const T n, const T mod)\r\n\/\/ inverse element for composite mod using formula inv(n) = n^(phi(mod) - 1)\r\n{\r\n\treturn binpow(n, euler_function(mod) - 1, mod);\r\n}\r\n\r\ntemplate<typename T>\r\nvoid binomial_coefficients(const size_t n, std::vector<std::vector<T>>* c) {\r\n\tstd::vector<std::vector<T>> result(n, std::vector<T>(n));\r\n\tfor (size_t i = 0; i < n; ++i) {\r\n\t\tresult[i][0] = 1;\r\n\t\tresult[i][i] = 1;\r\n\t\tfor (size_t j = 1; j < i; ++j) {\r\n\t\t\tresult[i][j] = result[i - 1][j - 1] + result[i - 1][j];\r\n\t\t}\r\n\t}\r\n\tc->swap(result);\r\n}\r\n\r\ntemplate<class T> std::string toRoman(T n) {\r\n\tconst int ValsCount = 13;\r\n\tconst int Vals[] = { 1, 4, 5, 9, 10, 40, 50, 90, 100, 400, 500, 900, 1000 };\r\n\tconst char * Digits[] = { \"I\", \"IV\", \"V\", \"IX\", \"X\", \"XL\", \"L\", \"XC\", \"C\", \"CD\", \"D\", \"CM\", \"M\" };\r\n\tstd::string res = \"\";\r\n\tint x = ValsCount - 1;\r\n\twhile (n) {\r\n\t\twhile (Vals[x] > n) {\r\n\t\t\t--x;\r\n\t\t}\r\n\t\tn -= Vals[x];\r\n\t\tres += Digits[x];\r\n\t}\r\n\treturn res;\r\n}\r\n\r\ntemplate<typename T>\r\nstd::vector<T> calc_powers(const T base, const size_t n) {\r\n\tstd::vector<T> powers(n + 1);\r\n\tpowers[0] = 1;\r\n\tfor (size_t i = 1; i < powers.size(); ++i) {\r\n\t\tpowers[i] = powers[i - 1] * base;\r\n\t}\r\n\treturn powers;\r\n}\r\n\r\ntemplate<typename T>\r\nstd::vector<T> calc_factorial(const size_t n) {\r\n\tstd::vector<T> factorial(n + 1);\r\n\tfactorial[0] = 1;\r\n\tfor (size_t i = 1; i < factorial.size(); ++i) {\r\n\t\tfactorial[i] = factorial[i - 1] * i;\r\n\t}\r\n\treturn factorial;\r\n}\r\n\r\ninline uint32_t abs(const uint32_t x) {\r\n\treturn x;\r\n}\r\n\r\ninline uint64_t abs(const uint64_t x) {\r\n\treturn x;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2002-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\/\/ FIX ME: make trackBlkAddr use blocksize from actual cache, not hard coded\n\n#include <string>\n#include <sstream>\n#include <iomanip>\n#include <vector>\n\n#include \"base\/misc.hh\"\n#include \"base\/statistics.hh\"\n#include \"cpu\/memtest\/memtest.hh\"\n#include \"mem\/cache\/base_cache.hh\"\n#include \"mem\/functional_mem\/main_memory.hh\"\n#include \"sim\/builder.hh\"\n#include \"sim\/sim_events.hh\"\n#include \"sim\/stats.hh\"\n\nusing namespace std;\n\nMemTest::MemTest(const string &name,\n                 MemInterface *_cache_interface,\n                 FunctionalMemory *main_mem,\n                 FunctionalMemory *check_mem,\n                 unsigned _memorySize,\n                 unsigned _percentReads,\n                 unsigned _percentCopies,\n                 unsigned _percentUncacheable,\n                 unsigned _progressInterval,\n                 unsigned _percentSourceUnaligned,\n                 unsigned _percentDestUnaligned,\n                 Addr _traceAddr,\n                 Counter max_loads_any_thread,\n                 Counter max_loads_all_threads)\n    : BaseCPU(name, 1, 0, 0, max_loads_any_thread, max_loads_all_threads),\n      tickEvent(this),\n      cacheInterface(_cache_interface),\n      mainMem(main_mem),\n      checkMem(check_mem),\n      size(_memorySize),\n      percentReads(_percentReads),\n      percentCopies(_percentCopies),\n      percentUncacheable(_percentUncacheable),\n      progressInterval(_progressInterval),\n      nextProgressMessage(_progressInterval),\n      percentSourceUnaligned(_percentSourceUnaligned),\n      percentDestUnaligned(percentDestUnaligned)\n{\n    vector<string> cmd;\n    cmd.push_back(\"\/bin\/ls\");\n    vector<string> null_vec;\n    xc = new ExecContext(this ,0,mainMem,0);\n\n    blockSize = cacheInterface->getBlockSize();\n    blockAddrMask = blockSize - 1;\n    traceBlockAddr = blockAddr(_traceAddr);\n\n    \/\/setup data storage with interesting values\n    uint8_t *data1 = new uint8_t[size];\n    uint8_t *data2 = new uint8_t[size];\n    uint8_t *data3 = new uint8_t[size];\n    memset(data1, 1, size);\n    memset(data2, 2, size);\n    memset(data3, 3, size);\n    curTick = 0;\n\n    baseAddr1 = 0x100000;\n    baseAddr2 = 0x400000;\n    uncacheAddr = 0x800000;\n\n    \/\/ set up intial memory contents here\n    mainMem->prot_write(baseAddr1, data1, size);\n    checkMem->prot_write(baseAddr1, data1, size);\n    mainMem->prot_write(baseAddr2, data2, size);\n    checkMem->prot_write(baseAddr2, data2, size);\n    mainMem->prot_write(uncacheAddr, data3, size);\n    checkMem->prot_write(uncacheAddr, data3, size);\n\n    delete [] data1;\n    delete [] data2;\n    delete [] data3;\n\n    \/\/ set up counters\n    noResponseCycles = 0;\n    numReads = 0;\n    tickEvent.schedule(0);\n}\n\nstatic void\nprintData(ostream &os, uint8_t *data, int nbytes)\n{\n    os << hex << setfill('0');\n    \/\/ assume little-endian: print bytes from highest address to lowest\n    for (uint8_t *dp = data + nbytes - 1; dp >= data; --dp) {\n        os << setw(2) << (unsigned)*dp;\n    }\n    os << dec;\n}\n\nvoid\nMemTest::completeRequest(MemReqPtr &req, uint8_t *data)\n{\n    switch (req->cmd) {\n      case Read:\n        if (memcmp(req->data, data, req->size) != 0) {\n            cerr << name() << \": on read of 0x\" << hex << req->paddr\n                 << \" (0x\" << hex << blockAddr(req->paddr) << \")\"\n                 << \"@ cycle \" << dec << curTick\n                 << \", cache returns 0x\";\n            printData(cerr, req->data, req->size);\n            cerr << \", expected 0x\";\n            printData(cerr, data, req->size);\n            cerr << endl;\n            fatal(\"\");\n        }\n\n        numReads++;\n        numReadsStat++;\n\n        if (numReads == nextProgressMessage) {\n            ccprintf(cerr, \"%s: completed %d read accesses @%d\\n\",\n                     name(), numReads, curTick);\n            nextProgressMessage += progressInterval;\n        }\n\n        comLoadEventQueue[0]->serviceEvents(numReads);\n        break;\n\n      case Write:\n        numWritesStat++;\n        break;\n\n      case Copy:\n        numCopiesStat++;\n        break;\n\n      default:\n        panic(\"invalid command\");\n    }\n\n    if (blockAddr(req->paddr) == traceBlockAddr) {\n        cerr << name() << \": completed \"\n             << (req->cmd.isWrite() ? \"write\" : \"read\")\n             << \" access of \"\n             << dec << req->size << \" bytes at address 0x\"\n             << hex << req->paddr\n             << \" (0x\" << hex << blockAddr(req->paddr) << \")\"\n             << \", value = 0x\";\n        printData(cerr, req->data, req->size);\n        cerr << \" @ cycle \" << dec << curTick;\n\n        cerr << endl;\n    }\n\n    noResponseCycles = 0;\n    delete [] data;\n}\n\n\nvoid\nMemTest::regStats()\n{\n    using namespace Stats;\n\n\n    numReadsStat\n        .name(name() + \".num_reads\")\n        .desc(\"number of read accesses completed\")\n        ;\n\n    numWritesStat\n        .name(name() + \".num_writes\")\n        .desc(\"number of write accesses completed\")\n        ;\n\n    numCopiesStat\n        .name(name() + \".num_copies\")\n        .desc(\"number of copy accesses completed\")\n        ;\n}\n\nvoid\nMemTest::tick()\n{\n    if (!tickEvent.scheduled())\n        tickEvent.schedule(curTick + 1);\n\n    if (++noResponseCycles >= 5000) {\n        cerr << name() << \": deadlocked at cycle \" << curTick << endl;\n        fatal(\"\");\n    }\n\n    if (cacheInterface->isBlocked()) {\n        return;\n    }\n\n    \/\/make new request\n    unsigned cmd = rand() % 100;\n    unsigned offset1 = random() % size;\n    unsigned offset2 = random() % size;\n    unsigned base = random() % 2;\n    uint64_t data = random();\n    unsigned access_size = random() % 4;\n    unsigned cacheable = rand() % 100;\n    unsigned source_align = rand() % 100;\n    unsigned dest_align = rand() % 100;\n\n    MemReqPtr req = new MemReq();\n\n    if (cacheable < percentUncacheable) {\n        req->flags |= UNCACHEABLE;\n        req->paddr = uncacheAddr + offset1;\n    } else {\n        req->paddr = ((base) ? baseAddr1 : baseAddr2) + offset1;\n    }\n    bool probe = (rand() % 2 == 1) && !req->isUncacheable();\n    probe = false;\n\n    req->size = 1 << access_size;\n    req->data = new uint8_t[req->size];\n    req->paddr &= ~(req->size - 1);\n    req->time = curTick;\n    req->xc = xc;\n\n    if (cmd < percentReads) {\n        \/\/ read\n        req->cmd = Read;\n        uint8_t *result = new uint8_t[8];\n        checkMem->access(Read, req->paddr, result, req->size);\n        if (blockAddr(req->paddr) == traceBlockAddr) {\n            cerr << name()\n                 << \": initiating read \"\n                 << ((probe)?\"probe of \":\"access of \")\n                 << dec << req->size << \" bytes from addr 0x\"\n                 << hex << req->paddr\n                 << \" (0x\" << hex << blockAddr(req->paddr) << \")\"\n                 << \" at cycle \"\n                 << dec << curTick << endl;\n        }\n        if (probe) {\n            cacheInterface->probeAndUpdate(req);\n            completeRequest(req, result);\n        } else {\n            req->completionEvent = new MemCompleteEvent(req, result, this);\n            cacheInterface->access(req);\n        }\n    } else if (cmd < (100 - percentCopies)){\n        \/\/ write\n        req->cmd = Write;\n        memcpy(req->data, &data, req->size);\n        checkMem->access(Write, req->paddr, req->data, req->size);\n        if (blockAddr(req->paddr) == traceBlockAddr) {\n            cerr << name() << \": initiating write \"\n                 << ((probe)?\"probe of \":\"access of \")\n                 << dec << req->size << \" bytes (value = 0x\";\n            printData(cerr, req->data, req->size);\n            cerr << \") to addr 0x\"\n                 << hex << req->paddr\n                 << \" (0x\" << hex << blockAddr(req->paddr) << \")\"\n                 << \" at cycle \"\n                 << dec << curTick << endl;\n        }\n        if (probe) {\n            cacheInterface->probeAndUpdate(req);\n            completeRequest(req, NULL);\n        } else {\n            req->completionEvent = new MemCompleteEvent(req, NULL, this);\n            cacheInterface->access(req);\n        }\n    } else {\n        \/\/ copy\n        Addr source = ((base) ? baseAddr1 : baseAddr2) + offset1;\n        Addr dest = ((base) ? baseAddr2 : baseAddr1) + offset2;\n        if (source_align >= percentSourceUnaligned) {\n            source = blockAddr(source);\n        }\n        if (dest_align >= percentDestUnaligned) {\n            dest = blockAddr(dest);\n        }\n        req->cmd = Copy;\n        req->flags &= ~UNCACHEABLE;\n        req->paddr = source;\n        req->dest = dest;\n        delete [] req->data;\n        req->data = new uint8_t[blockSize];\n        req->size = blockSize;\n        if (source == traceBlockAddr || dest == traceBlockAddr) {\n            cerr << name()\n                 << \": initiating copy of \"\n                 << dec << req->size << \" bytes from addr 0x\"\n                 << hex << source\n                 << \" (0x\" << hex << blockAddr(source) << \")\"\n                 << \" to addr 0x\"\n                 << hex << dest\n                 << \" (0x\" << hex << blockAddr(dest) << \")\"\n                 << \" at cycle \"\n                 << dec << curTick << endl;\n        }\n        cacheInterface->access(req);\n        uint8_t result[blockSize];\n        checkMem->access(Read, source, &result, blockSize);\n        checkMem->access(Write, dest, &result, blockSize);\n    }\n}\n\n\nvoid\nMemCompleteEvent::process()\n{\n    tester->completeRequest(req, data);\n    delete this;\n}\n\n\nconst char *\nMemCompleteEvent::description()\n{\n    return \"memory access completion\";\n}\n\n\nBEGIN_DECLARE_SIM_OBJECT_PARAMS(MemTest)\n\n    SimObjectParam<BaseCache *> cache;\n    SimObjectParam<FunctionalMemory *> main_mem;\n    SimObjectParam<FunctionalMemory *> check_mem;\n    Param<unsigned> memory_size;\n    Param<unsigned> percent_reads;\n    Param<unsigned> percent_copies;\n    Param<unsigned> percent_uncacheable;\n    Param<unsigned> progress_interval;\n    Param<unsigned> percent_source_unaligned;\n    Param<unsigned> percent_dest_unaligned;\n    Param<Addr> trace_addr;\n    Param<Counter> max_loads_any_thread;\n    Param<Counter> max_loads_all_threads;\n\nEND_DECLARE_SIM_OBJECT_PARAMS(MemTest)\n\n\nBEGIN_INIT_SIM_OBJECT_PARAMS(MemTest)\n\n    INIT_PARAM(cache, \"L1 cache\"),\n    INIT_PARAM(main_mem, \"hierarchical memory\"),\n    INIT_PARAM(check_mem, \"check memory\"),\n    INIT_PARAM_DFLT(memory_size, \"memory size\", 65536),\n    INIT_PARAM_DFLT(percent_reads, \"target read percentage\", 65),\n    INIT_PARAM_DFLT(percent_copies, \"target copy percentage\", 0),\n    INIT_PARAM_DFLT(percent_uncacheable, \"target uncacheable percentage\", 10),\n    INIT_PARAM_DFLT(progress_interval,\n                    \"progress report interval (in accesses)\", 1000000),\n    INIT_PARAM_DFLT(percent_source_unaligned, \"percent of copy source address \"\n                    \"that are unaligned\", 50),\n    INIT_PARAM_DFLT(percent_dest_unaligned, \"percent of copy dest address \"\n                    \"that are unaligned\", 50),\n    INIT_PARAM_DFLT(trace_addr, \"address to trace\", 0),\n    INIT_PARAM_DFLT(max_loads_any_thread,\n                    \"terminate when any thread reaches this load count\",\n                    0),\n    INIT_PARAM_DFLT(max_loads_all_threads,\n                    \"terminate when all threads have reached this load count\",\n                    0)\n\nEND_INIT_SIM_OBJECT_PARAMS(MemTest)\n\n\nCREATE_SIM_OBJECT(MemTest)\n{\n    return new MemTest(getInstanceName(), cache->getInterface(), main_mem,\n                       check_mem, memory_size, percent_reads, percent_copies,\n                       percent_uncacheable, progress_interval,\n                       percent_source_unaligned, percent_dest_unaligned,\n                       trace_addr, max_loads_any_thread,\n                       max_loads_all_threads);\n}\n\nREGISTER_SIM_OBJECT(\"MemTest\", MemTest)\n<commit_msg>Fix to deal with the new base class parameter for registration deferral<commit_after>\/*\n * Copyright (c) 2002-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\/\/ FIX ME: make trackBlkAddr use blocksize from actual cache, not hard coded\n\n#include <string>\n#include <sstream>\n#include <iomanip>\n#include <vector>\n\n#include \"base\/misc.hh\"\n#include \"base\/statistics.hh\"\n#include \"cpu\/memtest\/memtest.hh\"\n#include \"mem\/cache\/base_cache.hh\"\n#include \"mem\/functional_mem\/main_memory.hh\"\n#include \"sim\/builder.hh\"\n#include \"sim\/sim_events.hh\"\n#include \"sim\/stats.hh\"\n\nusing namespace std;\n\nMemTest::MemTest(const string &name,\n                 MemInterface *_cache_interface,\n                 FunctionalMemory *main_mem,\n                 FunctionalMemory *check_mem,\n                 unsigned _memorySize,\n                 unsigned _percentReads,\n                 unsigned _percentCopies,\n                 unsigned _percentUncacheable,\n                 unsigned _progressInterval,\n                 unsigned _percentSourceUnaligned,\n                 unsigned _percentDestUnaligned,\n                 Addr _traceAddr,\n                 Counter max_loads_any_thread,\n                 Counter max_loads_all_threads)\n    : BaseCPU(name, 1, true, 0, 0, max_loads_any_thread,\n              max_loads_all_threads),\n      tickEvent(this),\n      cacheInterface(_cache_interface),\n      mainMem(main_mem),\n      checkMem(check_mem),\n      size(_memorySize),\n      percentReads(_percentReads),\n      percentCopies(_percentCopies),\n      percentUncacheable(_percentUncacheable),\n      progressInterval(_progressInterval),\n      nextProgressMessage(_progressInterval),\n      percentSourceUnaligned(_percentSourceUnaligned),\n      percentDestUnaligned(percentDestUnaligned)\n{\n    vector<string> cmd;\n    cmd.push_back(\"\/bin\/ls\");\n    vector<string> null_vec;\n    xc = new ExecContext(this ,0,mainMem,0);\n\n    blockSize = cacheInterface->getBlockSize();\n    blockAddrMask = blockSize - 1;\n    traceBlockAddr = blockAddr(_traceAddr);\n\n    \/\/setup data storage with interesting values\n    uint8_t *data1 = new uint8_t[size];\n    uint8_t *data2 = new uint8_t[size];\n    uint8_t *data3 = new uint8_t[size];\n    memset(data1, 1, size);\n    memset(data2, 2, size);\n    memset(data3, 3, size);\n    curTick = 0;\n\n    baseAddr1 = 0x100000;\n    baseAddr2 = 0x400000;\n    uncacheAddr = 0x800000;\n\n    \/\/ set up intial memory contents here\n    mainMem->prot_write(baseAddr1, data1, size);\n    checkMem->prot_write(baseAddr1, data1, size);\n    mainMem->prot_write(baseAddr2, data2, size);\n    checkMem->prot_write(baseAddr2, data2, size);\n    mainMem->prot_write(uncacheAddr, data3, size);\n    checkMem->prot_write(uncacheAddr, data3, size);\n\n    delete [] data1;\n    delete [] data2;\n    delete [] data3;\n\n    \/\/ set up counters\n    noResponseCycles = 0;\n    numReads = 0;\n    tickEvent.schedule(0);\n}\n\nstatic void\nprintData(ostream &os, uint8_t *data, int nbytes)\n{\n    os << hex << setfill('0');\n    \/\/ assume little-endian: print bytes from highest address to lowest\n    for (uint8_t *dp = data + nbytes - 1; dp >= data; --dp) {\n        os << setw(2) << (unsigned)*dp;\n    }\n    os << dec;\n}\n\nvoid\nMemTest::completeRequest(MemReqPtr &req, uint8_t *data)\n{\n    switch (req->cmd) {\n      case Read:\n        if (memcmp(req->data, data, req->size) != 0) {\n            cerr << name() << \": on read of 0x\" << hex << req->paddr\n                 << \" (0x\" << hex << blockAddr(req->paddr) << \")\"\n                 << \"@ cycle \" << dec << curTick\n                 << \", cache returns 0x\";\n            printData(cerr, req->data, req->size);\n            cerr << \", expected 0x\";\n            printData(cerr, data, req->size);\n            cerr << endl;\n            fatal(\"\");\n        }\n\n        numReads++;\n        numReadsStat++;\n\n        if (numReads == nextProgressMessage) {\n            ccprintf(cerr, \"%s: completed %d read accesses @%d\\n\",\n                     name(), numReads, curTick);\n            nextProgressMessage += progressInterval;\n        }\n\n        comLoadEventQueue[0]->serviceEvents(numReads);\n        break;\n\n      case Write:\n        numWritesStat++;\n        break;\n\n      case Copy:\n        numCopiesStat++;\n        break;\n\n      default:\n        panic(\"invalid command\");\n    }\n\n    if (blockAddr(req->paddr) == traceBlockAddr) {\n        cerr << name() << \": completed \"\n             << (req->cmd.isWrite() ? \"write\" : \"read\")\n             << \" access of \"\n             << dec << req->size << \" bytes at address 0x\"\n             << hex << req->paddr\n             << \" (0x\" << hex << blockAddr(req->paddr) << \")\"\n             << \", value = 0x\";\n        printData(cerr, req->data, req->size);\n        cerr << \" @ cycle \" << dec << curTick;\n\n        cerr << endl;\n    }\n\n    noResponseCycles = 0;\n    delete [] data;\n}\n\n\nvoid\nMemTest::regStats()\n{\n    using namespace Stats;\n\n\n    numReadsStat\n        .name(name() + \".num_reads\")\n        .desc(\"number of read accesses completed\")\n        ;\n\n    numWritesStat\n        .name(name() + \".num_writes\")\n        .desc(\"number of write accesses completed\")\n        ;\n\n    numCopiesStat\n        .name(name() + \".num_copies\")\n        .desc(\"number of copy accesses completed\")\n        ;\n}\n\nvoid\nMemTest::tick()\n{\n    if (!tickEvent.scheduled())\n        tickEvent.schedule(curTick + 1);\n\n    if (++noResponseCycles >= 5000) {\n        cerr << name() << \": deadlocked at cycle \" << curTick << endl;\n        fatal(\"\");\n    }\n\n    if (cacheInterface->isBlocked()) {\n        return;\n    }\n\n    \/\/make new request\n    unsigned cmd = rand() % 100;\n    unsigned offset1 = random() % size;\n    unsigned offset2 = random() % size;\n    unsigned base = random() % 2;\n    uint64_t data = random();\n    unsigned access_size = random() % 4;\n    unsigned cacheable = rand() % 100;\n    unsigned source_align = rand() % 100;\n    unsigned dest_align = rand() % 100;\n\n    MemReqPtr req = new MemReq();\n\n    if (cacheable < percentUncacheable) {\n        req->flags |= UNCACHEABLE;\n        req->paddr = uncacheAddr + offset1;\n    } else {\n        req->paddr = ((base) ? baseAddr1 : baseAddr2) + offset1;\n    }\n    bool probe = (rand() % 2 == 1) && !req->isUncacheable();\n    probe = false;\n\n    req->size = 1 << access_size;\n    req->data = new uint8_t[req->size];\n    req->paddr &= ~(req->size - 1);\n    req->time = curTick;\n    req->xc = xc;\n\n    if (cmd < percentReads) {\n        \/\/ read\n        req->cmd = Read;\n        uint8_t *result = new uint8_t[8];\n        checkMem->access(Read, req->paddr, result, req->size);\n        if (blockAddr(req->paddr) == traceBlockAddr) {\n            cerr << name()\n                 << \": initiating read \"\n                 << ((probe)?\"probe of \":\"access of \")\n                 << dec << req->size << \" bytes from addr 0x\"\n                 << hex << req->paddr\n                 << \" (0x\" << hex << blockAddr(req->paddr) << \")\"\n                 << \" at cycle \"\n                 << dec << curTick << endl;\n        }\n        if (probe) {\n            cacheInterface->probeAndUpdate(req);\n            completeRequest(req, result);\n        } else {\n            req->completionEvent = new MemCompleteEvent(req, result, this);\n            cacheInterface->access(req);\n        }\n    } else if (cmd < (100 - percentCopies)){\n        \/\/ write\n        req->cmd = Write;\n        memcpy(req->data, &data, req->size);\n        checkMem->access(Write, req->paddr, req->data, req->size);\n        if (blockAddr(req->paddr) == traceBlockAddr) {\n            cerr << name() << \": initiating write \"\n                 << ((probe)?\"probe of \":\"access of \")\n                 << dec << req->size << \" bytes (value = 0x\";\n            printData(cerr, req->data, req->size);\n            cerr << \") to addr 0x\"\n                 << hex << req->paddr\n                 << \" (0x\" << hex << blockAddr(req->paddr) << \")\"\n                 << \" at cycle \"\n                 << dec << curTick << endl;\n        }\n        if (probe) {\n            cacheInterface->probeAndUpdate(req);\n            completeRequest(req, NULL);\n        } else {\n            req->completionEvent = new MemCompleteEvent(req, NULL, this);\n            cacheInterface->access(req);\n        }\n    } else {\n        \/\/ copy\n        Addr source = ((base) ? baseAddr1 : baseAddr2) + offset1;\n        Addr dest = ((base) ? baseAddr2 : baseAddr1) + offset2;\n        if (source_align >= percentSourceUnaligned) {\n            source = blockAddr(source);\n        }\n        if (dest_align >= percentDestUnaligned) {\n            dest = blockAddr(dest);\n        }\n        req->cmd = Copy;\n        req->flags &= ~UNCACHEABLE;\n        req->paddr = source;\n        req->dest = dest;\n        delete [] req->data;\n        req->data = new uint8_t[blockSize];\n        req->size = blockSize;\n        if (source == traceBlockAddr || dest == traceBlockAddr) {\n            cerr << name()\n                 << \": initiating copy of \"\n                 << dec << req->size << \" bytes from addr 0x\"\n                 << hex << source\n                 << \" (0x\" << hex << blockAddr(source) << \")\"\n                 << \" to addr 0x\"\n                 << hex << dest\n                 << \" (0x\" << hex << blockAddr(dest) << \")\"\n                 << \" at cycle \"\n                 << dec << curTick << endl;\n        }\n        cacheInterface->access(req);\n        uint8_t result[blockSize];\n        checkMem->access(Read, source, &result, blockSize);\n        checkMem->access(Write, dest, &result, blockSize);\n    }\n}\n\n\nvoid\nMemCompleteEvent::process()\n{\n    tester->completeRequest(req, data);\n    delete this;\n}\n\n\nconst char *\nMemCompleteEvent::description()\n{\n    return \"memory access completion\";\n}\n\n\nBEGIN_DECLARE_SIM_OBJECT_PARAMS(MemTest)\n\n    SimObjectParam<BaseCache *> cache;\n    SimObjectParam<FunctionalMemory *> main_mem;\n    SimObjectParam<FunctionalMemory *> check_mem;\n    Param<unsigned> memory_size;\n    Param<unsigned> percent_reads;\n    Param<unsigned> percent_copies;\n    Param<unsigned> percent_uncacheable;\n    Param<unsigned> progress_interval;\n    Param<unsigned> percent_source_unaligned;\n    Param<unsigned> percent_dest_unaligned;\n    Param<Addr> trace_addr;\n    Param<Counter> max_loads_any_thread;\n    Param<Counter> max_loads_all_threads;\n\nEND_DECLARE_SIM_OBJECT_PARAMS(MemTest)\n\n\nBEGIN_INIT_SIM_OBJECT_PARAMS(MemTest)\n\n    INIT_PARAM(cache, \"L1 cache\"),\n    INIT_PARAM(main_mem, \"hierarchical memory\"),\n    INIT_PARAM(check_mem, \"check memory\"),\n    INIT_PARAM_DFLT(memory_size, \"memory size\", 65536),\n    INIT_PARAM_DFLT(percent_reads, \"target read percentage\", 65),\n    INIT_PARAM_DFLT(percent_copies, \"target copy percentage\", 0),\n    INIT_PARAM_DFLT(percent_uncacheable, \"target uncacheable percentage\", 10),\n    INIT_PARAM_DFLT(progress_interval,\n                    \"progress report interval (in accesses)\", 1000000),\n    INIT_PARAM_DFLT(percent_source_unaligned, \"percent of copy source address \"\n                    \"that are unaligned\", 50),\n    INIT_PARAM_DFLT(percent_dest_unaligned, \"percent of copy dest address \"\n                    \"that are unaligned\", 50),\n    INIT_PARAM_DFLT(trace_addr, \"address to trace\", 0),\n    INIT_PARAM_DFLT(max_loads_any_thread,\n                    \"terminate when any thread reaches this load count\",\n                    0),\n    INIT_PARAM_DFLT(max_loads_all_threads,\n                    \"terminate when all threads have reached this load count\",\n                    0)\n\nEND_INIT_SIM_OBJECT_PARAMS(MemTest)\n\n\nCREATE_SIM_OBJECT(MemTest)\n{\n    return new MemTest(getInstanceName(), cache->getInterface(), main_mem,\n                       check_mem, memory_size, percent_reads, percent_copies,\n                       percent_uncacheable, progress_interval,\n                       percent_source_unaligned, percent_dest_unaligned,\n                       trace_addr, max_loads_any_thread,\n                       max_loads_all_threads);\n}\n\nREGISTER_SIM_OBJECT(\"MemTest\", MemTest)\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- StringRef.cpp - Lightweight String References ---------------------===\/\/\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\/ADT\/StringRef.h\"\n#include \"llvm\/ADT\/Hashing.h\"\n#include \"llvm\/ADT\/edit_distance.h\"\n#include <bitset>\n\nusing namespace llvm;\n\n\/\/ MSVC emits references to this into the translation units which reference it.\n#ifndef _MSC_VER\nconst size_t StringRef::npos;\n#endif\n\nstatic char ascii_tolower(char x) {\n  if (x >= 'A' && x <= 'Z')\n    return x - 'A' + 'a';\n  return x;\n}\n\nstatic char ascii_toupper(char x) {\n  if (x >= 'a' && x <= 'z')\n    return x - 'a' + 'A';\n  return x;\n}\n\nstatic bool ascii_isdigit(char x) {\n  return x >= '0' && x <= '9';\n}\n\n\/\/ strncasecmp() is not available on non-POSIX systems, so define an\n\/\/ alternative function here.\nstatic int ascii_strncasecmp(const char *LHS, const char *RHS, size_t Length) {\n  for (size_t I = 0; I < Length; ++I) {\n    unsigned char LHC = ascii_tolower(LHS[I]);\n    unsigned char RHC = ascii_tolower(RHS[I]);\n    if (LHC != RHC)\n      return LHC < RHC ? -1 : 1;\n  }\n  return 0;\n}\n\n\/\/\/ compare_lower - Compare strings, ignoring case.\nint StringRef::compare_lower(StringRef RHS) const {\n  if (int Res = ascii_strncasecmp(Data, RHS.Data, std::min(Length, RHS.Length)))\n    return Res;\n  if (Length == RHS.Length)\n    return 0;\n  return Length < RHS.Length ? -1 : 1;\n}\n\n\/\/\/ Check if this string starts with the given \\p Prefix, ignoring case.\nbool StringRef::startswith_lower(StringRef Prefix) const {\n  return Length >= Prefix.Length &&\n      ascii_strncasecmp(Data, Prefix.Data, Prefix.Length) == 0;\n}\n\n\/\/\/ Check if this string ends with the given \\p Suffix, ignoring case.\nbool StringRef::endswith_lower(StringRef Suffix) const {\n  return Length >= Suffix.Length &&\n      ascii_strncasecmp(end() - Suffix.Length, Suffix.Data, Suffix.Length) == 0;\n}\n\n\/\/\/ compare_numeric - Compare strings, handle embedded numbers.\nint StringRef::compare_numeric(StringRef RHS) const {\n  for (size_t I = 0, E = std::min(Length, RHS.Length); I != E; ++I) {\n    \/\/ Check for sequences of digits.\n    if (ascii_isdigit(Data[I]) && ascii_isdigit(RHS.Data[I])) {\n      \/\/ The longer sequence of numbers is considered larger.\n      \/\/ This doesn't really handle prefixed zeros well.\n      size_t J;\n      for (J = I + 1; J != E + 1; ++J) {\n        bool ld = J < Length && ascii_isdigit(Data[J]);\n        bool rd = J < RHS.Length && ascii_isdigit(RHS.Data[J]);\n        if (ld != rd)\n          return rd ? -1 : 1;\n        if (!rd)\n          break;\n      }\n      \/\/ The two number sequences have the same length (J-I), just memcmp them.\n      if (int Res = compareMemory(Data + I, RHS.Data + I, J - I))\n        return Res < 0 ? -1 : 1;\n      \/\/ Identical number sequences, continue search after the numbers.\n      I = J - 1;\n      continue;\n    }\n    if (Data[I] != RHS.Data[I])\n      return (unsigned char)Data[I] < (unsigned char)RHS.Data[I] ? -1 : 1;\n  }\n  if (Length == RHS.Length)\n    return 0;\n  return Length < RHS.Length ? -1 : 1;\n}\n\n\/\/ Compute the edit distance between the two given strings.\nunsigned StringRef::edit_distance(llvm::StringRef Other,\n                                  bool AllowReplacements,\n                                  unsigned MaxEditDistance) const {\n  return llvm::ComputeEditDistance(\n      makeArrayRef(data(), size()),\n      makeArrayRef(Other.data(), Other.size()),\n      AllowReplacements, MaxEditDistance);\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ String Operations\n\/\/===----------------------------------------------------------------------===\/\/\n\nstd::string StringRef::lower() const {\n  std::string Result(size(), char());\n  for (size_type i = 0, e = size(); i != e; ++i) {\n    Result[i] = ascii_tolower(Data[i]);\n  }\n  return Result;\n}\n\nstd::string StringRef::upper() const {\n  std::string Result(size(), char());\n  for (size_type i = 0, e = size(); i != e; ++i) {\n    Result[i] = ascii_toupper(Data[i]);\n  }\n  return Result;\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ String Searching\n\/\/===----------------------------------------------------------------------===\/\/\n\n\n\/\/\/ find - Search for the first string \\arg Str in the string.\n\/\/\/\n\/\/\/ \\return - The index of the first occurrence of \\arg Str, or npos if not\n\/\/\/ found.\nsize_t StringRef::find(StringRef Str, size_t From) const {\n  size_t N = Str.size();\n  if (N > Length)\n    return npos;\n\n  \/\/ For short haystacks or unsupported needles fall back to the naive algorithm\n  if (Length < 16 || N > 255 || N == 0) {\n    for (size_t e = Length - N + 1, i = std::min(From, e); i != e; ++i)\n      if (substr(i, N).equals(Str))\n        return i;\n    return npos;\n  }\n\n  if (From >= Length)\n    return npos;\n\n  \/\/ Build the bad char heuristic table, with uint8_t to reduce cache thrashing.\n  uint8_t BadCharSkip[256];\n  std::memset(BadCharSkip, N, 256);\n  for (unsigned i = 0; i != N-1; ++i)\n    BadCharSkip[(uint8_t)Str[i]] = N-1-i;\n\n  unsigned Len = Length-From, Pos = From;\n  while (Len >= N) {\n    if (substr(Pos, N).equals(Str)) \/\/ See if this is the correct substring.\n      return Pos;\n\n    \/\/ Otherwise skip the appropriate number of bytes.\n    uint8_t Skip = BadCharSkip[(uint8_t)(*this)[Pos+N-1]];\n    Len -= Skip;\n    Pos += Skip;\n  }\n\n  return npos;\n}\n\n\/\/\/ rfind - Search for the last string \\arg Str in the string.\n\/\/\/\n\/\/\/ \\return - The index of the last occurrence of \\arg Str, or npos if not\n\/\/\/ found.\nsize_t StringRef::rfind(StringRef Str) const {\n  size_t N = Str.size();\n  if (N > Length)\n    return npos;\n  for (size_t i = Length - N + 1, e = 0; i != e;) {\n    --i;\n    if (substr(i, N).equals(Str))\n      return i;\n  }\n  return npos;\n}\n\n\/\/\/ find_first_of - Find the first character in the string that is in \\arg\n\/\/\/ Chars, or npos if not found.\n\/\/\/\n\/\/\/ Note: O(size() + Chars.size())\nStringRef::size_type StringRef::find_first_of(StringRef Chars,\n                                              size_t From) const {\n  std::bitset<1 << CHAR_BIT> CharBits;\n  for (size_type i = 0; i != Chars.size(); ++i)\n    CharBits.set((unsigned char)Chars[i]);\n\n  for (size_type i = std::min(From, Length), e = Length; i != e; ++i)\n    if (CharBits.test((unsigned char)Data[i]))\n      return i;\n  return npos;\n}\n\n\/\/\/ find_first_not_of - Find the first character in the string that is not\n\/\/\/ \\arg C or npos if not found.\nStringRef::size_type StringRef::find_first_not_of(char C, size_t From) const {\n  for (size_type i = std::min(From, Length), e = Length; i != e; ++i)\n    if (Data[i] != C)\n      return i;\n  return npos;\n}\n\n\/\/\/ find_first_not_of - Find the first character in the string that is not\n\/\/\/ in the string \\arg Chars, or npos if not found.\n\/\/\/\n\/\/\/ Note: O(size() + Chars.size())\nStringRef::size_type StringRef::find_first_not_of(StringRef Chars,\n                                                  size_t From) const {\n  std::bitset<1 << CHAR_BIT> CharBits;\n  for (size_type i = 0; i != Chars.size(); ++i)\n    CharBits.set((unsigned char)Chars[i]);\n\n  for (size_type i = std::min(From, Length), e = Length; i != e; ++i)\n    if (!CharBits.test((unsigned char)Data[i]))\n      return i;\n  return npos;\n}\n\n\/\/\/ find_last_of - Find the last character in the string that is in \\arg C,\n\/\/\/ or npos if not found.\n\/\/\/\n\/\/\/ Note: O(size() + Chars.size())\nStringRef::size_type StringRef::find_last_of(StringRef Chars,\n                                             size_t From) const {\n  std::bitset<1 << CHAR_BIT> CharBits;\n  for (size_type i = 0; i != Chars.size(); ++i)\n    CharBits.set((unsigned char)Chars[i]);\n\n  for (size_type i = std::min(From, Length) - 1, e = -1; i != e; --i)\n    if (CharBits.test((unsigned char)Data[i]))\n      return i;\n  return npos;\n}\n\n\/\/\/ find_last_not_of - Find the last character in the string that is not\n\/\/\/ \\arg C, or npos if not found.\nStringRef::size_type StringRef::find_last_not_of(char C, size_t From) const {\n  for (size_type i = std::min(From, Length) - 1, e = -1; i != e; --i)\n    if (Data[i] != C)\n      return i;\n  return npos;\n}\n\n\/\/\/ find_last_not_of - Find the last character in the string that is not in\n\/\/\/ \\arg Chars, or npos if not found.\n\/\/\/\n\/\/\/ Note: O(size() + Chars.size())\nStringRef::size_type StringRef::find_last_not_of(StringRef Chars,\n                                                 size_t From) const {\n  std::bitset<1 << CHAR_BIT> CharBits;\n  for (size_type i = 0, e = Chars.size(); i != e; ++i)\n    CharBits.set((unsigned char)Chars[i]);\n\n  for (size_type i = std::min(From, Length) - 1, e = -1; i != e; --i)\n    if (!CharBits.test((unsigned char)Data[i]))\n      return i;\n  return npos;\n}\n\nvoid StringRef::split(SmallVectorImpl<StringRef> &A,\n                      StringRef Separators, int MaxSplit,\n                      bool KeepEmpty) const {\n  StringRef rest = *this;\n\n  \/\/ rest.data() is used to distinguish cases like \"a,\" that splits into\n  \/\/ \"a\" + \"\" and \"a\" that splits into \"a\" + 0.\n  for (int splits = 0;\n       rest.data() != nullptr && (MaxSplit < 0 || splits < MaxSplit);\n       ++splits) {\n    std::pair<StringRef, StringRef> p = rest.split(Separators);\n\n    if (KeepEmpty || p.first.size() != 0)\n      A.push_back(p.first);\n    rest = p.second;\n  }\n  \/\/ If we have a tail left, add it.\n  if (rest.data() != nullptr && (rest.size() != 0 || KeepEmpty))\n    A.push_back(rest);\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Helpful Algorithms\n\/\/===----------------------------------------------------------------------===\/\/\n\n\/\/\/ count - Return the number of non-overlapped occurrences of \\arg Str in\n\/\/\/ the string.\nsize_t StringRef::count(StringRef Str) const {\n  size_t Count = 0;\n  size_t N = Str.size();\n  if (N > Length)\n    return 0;\n  for (size_t i = 0, e = Length - N + 1; i != e; ++i)\n    if (substr(i, N).equals(Str))\n      ++Count;\n  return Count;\n}\n\nstatic unsigned GetAutoSenseRadix(StringRef &Str) {\n  if (Str.startswith(\"0x\")) {\n    Str = Str.substr(2);\n    return 16;\n  }\n  \n  if (Str.startswith(\"0b\")) {\n    Str = Str.substr(2);\n    return 2;\n  }\n\n  if (Str.startswith(\"0o\")) {\n    Str = Str.substr(2);\n    return 8;\n  }\n\n  if (Str.startswith(\"0\"))\n    return 8;\n  \n  return 10;\n}\n\n\n\/\/\/ GetAsUnsignedInteger - Workhorse method that converts a integer character\n\/\/\/ sequence of radix up to 36 to an unsigned long long value.\nbool llvm::getAsUnsignedInteger(StringRef Str, unsigned Radix,\n                                unsigned long long &Result) {\n  \/\/ Autosense radix if not specified.\n  if (Radix == 0)\n    Radix = GetAutoSenseRadix(Str);\n\n  \/\/ Empty strings (after the radix autosense) are invalid.\n  if (Str.empty()) return true;\n\n  \/\/ Parse all the bytes of the string given this radix.  Watch for overflow.\n  Result = 0;\n  while (!Str.empty()) {\n    unsigned CharVal;\n    if (Str[0] >= '0' && Str[0] <= '9')\n      CharVal = Str[0]-'0';\n    else if (Str[0] >= 'a' && Str[0] <= 'z')\n      CharVal = Str[0]-'a'+10;\n    else if (Str[0] >= 'A' && Str[0] <= 'Z')\n      CharVal = Str[0]-'A'+10;\n    else\n      return true;\n\n    \/\/ If the parsed value is larger than the integer radix, the string is\n    \/\/ invalid.\n    if (CharVal >= Radix)\n      return true;\n\n    \/\/ Add in this character.\n    unsigned long long PrevResult = Result;\n    Result = Result*Radix+CharVal;\n\n    \/\/ Check for overflow by shifting back and seeing if bits were lost.\n    if (Result\/Radix < PrevResult)\n      return true;\n\n    Str = Str.substr(1);\n  }\n\n  return false;\n}\n\nbool llvm::getAsSignedInteger(StringRef Str, unsigned Radix,\n                              long long &Result) {\n  unsigned long long ULLVal;\n\n  \/\/ Handle positive strings first.\n  if (Str.empty() || Str.front() != '-') {\n    if (getAsUnsignedInteger(Str, Radix, ULLVal) ||\n        \/\/ Check for value so large it overflows a signed value.\n        (long long)ULLVal < 0)\n      return true;\n    Result = ULLVal;\n    return false;\n  }\n\n  \/\/ Get the positive part of the value.\n  if (getAsUnsignedInteger(Str.substr(1), Radix, ULLVal) ||\n      \/\/ Reject values so large they'd overflow as negative signed, but allow\n      \/\/ \"-0\".  This negates the unsigned so that the negative isn't undefined\n      \/\/ on signed overflow.\n      (long long)-ULLVal > 0)\n    return true;\n\n  Result = -ULLVal;\n  return false;\n}\n\n\n\/\/ Implementation of StringRef hashing.\nhash_code llvm::hash_value(StringRef S) {\n  return hash_combine_range(S.begin(), S.end());\n}\n<commit_msg>[portability] Add a missing include.<commit_after>\/\/===-- StringRef.cpp - Lightweight String References ---------------------===\/\/\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\/ADT\/StringRef.h\"\n#include \"llvm\/ADT\/Hashing.h\"\n#include \"llvm\/ADT\/edit_distance.h\"\n#include <bitset>\n#include <climits>\n\nusing namespace llvm;\n\n\/\/ MSVC emits references to this into the translation units which reference it.\n#ifndef _MSC_VER\nconst size_t StringRef::npos;\n#endif\n\nstatic char ascii_tolower(char x) {\n  if (x >= 'A' && x <= 'Z')\n    return x - 'A' + 'a';\n  return x;\n}\n\nstatic char ascii_toupper(char x) {\n  if (x >= 'a' && x <= 'z')\n    return x - 'a' + 'A';\n  return x;\n}\n\nstatic bool ascii_isdigit(char x) {\n  return x >= '0' && x <= '9';\n}\n\n\/\/ strncasecmp() is not available on non-POSIX systems, so define an\n\/\/ alternative function here.\nstatic int ascii_strncasecmp(const char *LHS, const char *RHS, size_t Length) {\n  for (size_t I = 0; I < Length; ++I) {\n    unsigned char LHC = ascii_tolower(LHS[I]);\n    unsigned char RHC = ascii_tolower(RHS[I]);\n    if (LHC != RHC)\n      return LHC < RHC ? -1 : 1;\n  }\n  return 0;\n}\n\n\/\/\/ compare_lower - Compare strings, ignoring case.\nint StringRef::compare_lower(StringRef RHS) const {\n  if (int Res = ascii_strncasecmp(Data, RHS.Data, std::min(Length, RHS.Length)))\n    return Res;\n  if (Length == RHS.Length)\n    return 0;\n  return Length < RHS.Length ? -1 : 1;\n}\n\n\/\/\/ Check if this string starts with the given \\p Prefix, ignoring case.\nbool StringRef::startswith_lower(StringRef Prefix) const {\n  return Length >= Prefix.Length &&\n      ascii_strncasecmp(Data, Prefix.Data, Prefix.Length) == 0;\n}\n\n\/\/\/ Check if this string ends with the given \\p Suffix, ignoring case.\nbool StringRef::endswith_lower(StringRef Suffix) const {\n  return Length >= Suffix.Length &&\n      ascii_strncasecmp(end() - Suffix.Length, Suffix.Data, Suffix.Length) == 0;\n}\n\n\/\/\/ compare_numeric - Compare strings, handle embedded numbers.\nint StringRef::compare_numeric(StringRef RHS) const {\n  for (size_t I = 0, E = std::min(Length, RHS.Length); I != E; ++I) {\n    \/\/ Check for sequences of digits.\n    if (ascii_isdigit(Data[I]) && ascii_isdigit(RHS.Data[I])) {\n      \/\/ The longer sequence of numbers is considered larger.\n      \/\/ This doesn't really handle prefixed zeros well.\n      size_t J;\n      for (J = I + 1; J != E + 1; ++J) {\n        bool ld = J < Length && ascii_isdigit(Data[J]);\n        bool rd = J < RHS.Length && ascii_isdigit(RHS.Data[J]);\n        if (ld != rd)\n          return rd ? -1 : 1;\n        if (!rd)\n          break;\n      }\n      \/\/ The two number sequences have the same length (J-I), just memcmp them.\n      if (int Res = compareMemory(Data + I, RHS.Data + I, J - I))\n        return Res < 0 ? -1 : 1;\n      \/\/ Identical number sequences, continue search after the numbers.\n      I = J - 1;\n      continue;\n    }\n    if (Data[I] != RHS.Data[I])\n      return (unsigned char)Data[I] < (unsigned char)RHS.Data[I] ? -1 : 1;\n  }\n  if (Length == RHS.Length)\n    return 0;\n  return Length < RHS.Length ? -1 : 1;\n}\n\n\/\/ Compute the edit distance between the two given strings.\nunsigned StringRef::edit_distance(llvm::StringRef Other,\n                                  bool AllowReplacements,\n                                  unsigned MaxEditDistance) const {\n  return llvm::ComputeEditDistance(\n      makeArrayRef(data(), size()),\n      makeArrayRef(Other.data(), Other.size()),\n      AllowReplacements, MaxEditDistance);\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ String Operations\n\/\/===----------------------------------------------------------------------===\/\/\n\nstd::string StringRef::lower() const {\n  std::string Result(size(), char());\n  for (size_type i = 0, e = size(); i != e; ++i) {\n    Result[i] = ascii_tolower(Data[i]);\n  }\n  return Result;\n}\n\nstd::string StringRef::upper() const {\n  std::string Result(size(), char());\n  for (size_type i = 0, e = size(); i != e; ++i) {\n    Result[i] = ascii_toupper(Data[i]);\n  }\n  return Result;\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ String Searching\n\/\/===----------------------------------------------------------------------===\/\/\n\n\n\/\/\/ find - Search for the first string \\arg Str in the string.\n\/\/\/\n\/\/\/ \\return - The index of the first occurrence of \\arg Str, or npos if not\n\/\/\/ found.\nsize_t StringRef::find(StringRef Str, size_t From) const {\n  size_t N = Str.size();\n  if (N > Length)\n    return npos;\n\n  \/\/ For short haystacks or unsupported needles fall back to the naive algorithm\n  if (Length < 16 || N > 255 || N == 0) {\n    for (size_t e = Length - N + 1, i = std::min(From, e); i != e; ++i)\n      if (substr(i, N).equals(Str))\n        return i;\n    return npos;\n  }\n\n  if (From >= Length)\n    return npos;\n\n  \/\/ Build the bad char heuristic table, with uint8_t to reduce cache thrashing.\n  uint8_t BadCharSkip[256];\n  std::memset(BadCharSkip, N, 256);\n  for (unsigned i = 0; i != N-1; ++i)\n    BadCharSkip[(uint8_t)Str[i]] = N-1-i;\n\n  unsigned Len = Length-From, Pos = From;\n  while (Len >= N) {\n    if (substr(Pos, N).equals(Str)) \/\/ See if this is the correct substring.\n      return Pos;\n\n    \/\/ Otherwise skip the appropriate number of bytes.\n    uint8_t Skip = BadCharSkip[(uint8_t)(*this)[Pos+N-1]];\n    Len -= Skip;\n    Pos += Skip;\n  }\n\n  return npos;\n}\n\n\/\/\/ rfind - Search for the last string \\arg Str in the string.\n\/\/\/\n\/\/\/ \\return - The index of the last occurrence of \\arg Str, or npos if not\n\/\/\/ found.\nsize_t StringRef::rfind(StringRef Str) const {\n  size_t N = Str.size();\n  if (N > Length)\n    return npos;\n  for (size_t i = Length - N + 1, e = 0; i != e;) {\n    --i;\n    if (substr(i, N).equals(Str))\n      return i;\n  }\n  return npos;\n}\n\n\/\/\/ find_first_of - Find the first character in the string that is in \\arg\n\/\/\/ Chars, or npos if not found.\n\/\/\/\n\/\/\/ Note: O(size() + Chars.size())\nStringRef::size_type StringRef::find_first_of(StringRef Chars,\n                                              size_t From) const {\n  std::bitset<1 << CHAR_BIT> CharBits;\n  for (size_type i = 0; i != Chars.size(); ++i)\n    CharBits.set((unsigned char)Chars[i]);\n\n  for (size_type i = std::min(From, Length), e = Length; i != e; ++i)\n    if (CharBits.test((unsigned char)Data[i]))\n      return i;\n  return npos;\n}\n\n\/\/\/ find_first_not_of - Find the first character in the string that is not\n\/\/\/ \\arg C or npos if not found.\nStringRef::size_type StringRef::find_first_not_of(char C, size_t From) const {\n  for (size_type i = std::min(From, Length), e = Length; i != e; ++i)\n    if (Data[i] != C)\n      return i;\n  return npos;\n}\n\n\/\/\/ find_first_not_of - Find the first character in the string that is not\n\/\/\/ in the string \\arg Chars, or npos if not found.\n\/\/\/\n\/\/\/ Note: O(size() + Chars.size())\nStringRef::size_type StringRef::find_first_not_of(StringRef Chars,\n                                                  size_t From) const {\n  std::bitset<1 << CHAR_BIT> CharBits;\n  for (size_type i = 0; i != Chars.size(); ++i)\n    CharBits.set((unsigned char)Chars[i]);\n\n  for (size_type i = std::min(From, Length), e = Length; i != e; ++i)\n    if (!CharBits.test((unsigned char)Data[i]))\n      return i;\n  return npos;\n}\n\n\/\/\/ find_last_of - Find the last character in the string that is in \\arg C,\n\/\/\/ or npos if not found.\n\/\/\/\n\/\/\/ Note: O(size() + Chars.size())\nStringRef::size_type StringRef::find_last_of(StringRef Chars,\n                                             size_t From) const {\n  std::bitset<1 << CHAR_BIT> CharBits;\n  for (size_type i = 0; i != Chars.size(); ++i)\n    CharBits.set((unsigned char)Chars[i]);\n\n  for (size_type i = std::min(From, Length) - 1, e = -1; i != e; --i)\n    if (CharBits.test((unsigned char)Data[i]))\n      return i;\n  return npos;\n}\n\n\/\/\/ find_last_not_of - Find the last character in the string that is not\n\/\/\/ \\arg C, or npos if not found.\nStringRef::size_type StringRef::find_last_not_of(char C, size_t From) const {\n  for (size_type i = std::min(From, Length) - 1, e = -1; i != e; --i)\n    if (Data[i] != C)\n      return i;\n  return npos;\n}\n\n\/\/\/ find_last_not_of - Find the last character in the string that is not in\n\/\/\/ \\arg Chars, or npos if not found.\n\/\/\/\n\/\/\/ Note: O(size() + Chars.size())\nStringRef::size_type StringRef::find_last_not_of(StringRef Chars,\n                                                 size_t From) const {\n  std::bitset<1 << CHAR_BIT> CharBits;\n  for (size_type i = 0, e = Chars.size(); i != e; ++i)\n    CharBits.set((unsigned char)Chars[i]);\n\n  for (size_type i = std::min(From, Length) - 1, e = -1; i != e; --i)\n    if (!CharBits.test((unsigned char)Data[i]))\n      return i;\n  return npos;\n}\n\nvoid StringRef::split(SmallVectorImpl<StringRef> &A,\n                      StringRef Separators, int MaxSplit,\n                      bool KeepEmpty) const {\n  StringRef rest = *this;\n\n  \/\/ rest.data() is used to distinguish cases like \"a,\" that splits into\n  \/\/ \"a\" + \"\" and \"a\" that splits into \"a\" + 0.\n  for (int splits = 0;\n       rest.data() != nullptr && (MaxSplit < 0 || splits < MaxSplit);\n       ++splits) {\n    std::pair<StringRef, StringRef> p = rest.split(Separators);\n\n    if (KeepEmpty || p.first.size() != 0)\n      A.push_back(p.first);\n    rest = p.second;\n  }\n  \/\/ If we have a tail left, add it.\n  if (rest.data() != nullptr && (rest.size() != 0 || KeepEmpty))\n    A.push_back(rest);\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Helpful Algorithms\n\/\/===----------------------------------------------------------------------===\/\/\n\n\/\/\/ count - Return the number of non-overlapped occurrences of \\arg Str in\n\/\/\/ the string.\nsize_t StringRef::count(StringRef Str) const {\n  size_t Count = 0;\n  size_t N = Str.size();\n  if (N > Length)\n    return 0;\n  for (size_t i = 0, e = Length - N + 1; i != e; ++i)\n    if (substr(i, N).equals(Str))\n      ++Count;\n  return Count;\n}\n\nstatic unsigned GetAutoSenseRadix(StringRef &Str) {\n  if (Str.startswith(\"0x\")) {\n    Str = Str.substr(2);\n    return 16;\n  }\n  \n  if (Str.startswith(\"0b\")) {\n    Str = Str.substr(2);\n    return 2;\n  }\n\n  if (Str.startswith(\"0o\")) {\n    Str = Str.substr(2);\n    return 8;\n  }\n\n  if (Str.startswith(\"0\"))\n    return 8;\n  \n  return 10;\n}\n\n\n\/\/\/ GetAsUnsignedInteger - Workhorse method that converts a integer character\n\/\/\/ sequence of radix up to 36 to an unsigned long long value.\nbool llvm::getAsUnsignedInteger(StringRef Str, unsigned Radix,\n                                unsigned long long &Result) {\n  \/\/ Autosense radix if not specified.\n  if (Radix == 0)\n    Radix = GetAutoSenseRadix(Str);\n\n  \/\/ Empty strings (after the radix autosense) are invalid.\n  if (Str.empty()) return true;\n\n  \/\/ Parse all the bytes of the string given this radix.  Watch for overflow.\n  Result = 0;\n  while (!Str.empty()) {\n    unsigned CharVal;\n    if (Str[0] >= '0' && Str[0] <= '9')\n      CharVal = Str[0]-'0';\n    else if (Str[0] >= 'a' && Str[0] <= 'z')\n      CharVal = Str[0]-'a'+10;\n    else if (Str[0] >= 'A' && Str[0] <= 'Z')\n      CharVal = Str[0]-'A'+10;\n    else\n      return true;\n\n    \/\/ If the parsed value is larger than the integer radix, the string is\n    \/\/ invalid.\n    if (CharVal >= Radix)\n      return true;\n\n    \/\/ Add in this character.\n    unsigned long long PrevResult = Result;\n    Result = Result*Radix+CharVal;\n\n    \/\/ Check for overflow by shifting back and seeing if bits were lost.\n    if (Result\/Radix < PrevResult)\n      return true;\n\n    Str = Str.substr(1);\n  }\n\n  return false;\n}\n\nbool llvm::getAsSignedInteger(StringRef Str, unsigned Radix,\n                              long long &Result) {\n  unsigned long long ULLVal;\n\n  \/\/ Handle positive strings first.\n  if (Str.empty() || Str.front() != '-') {\n    if (getAsUnsignedInteger(Str, Radix, ULLVal) ||\n        \/\/ Check for value so large it overflows a signed value.\n        (long long)ULLVal < 0)\n      return true;\n    Result = ULLVal;\n    return false;\n  }\n\n  \/\/ Get the positive part of the value.\n  if (getAsUnsignedInteger(Str.substr(1), Radix, ULLVal) ||\n      \/\/ Reject values so large they'd overflow as negative signed, but allow\n      \/\/ \"-0\".  This negates the unsigned so that the negative isn't undefined\n      \/\/ on signed overflow.\n      (long long)-ULLVal > 0)\n    return true;\n\n  Result = -ULLVal;\n  return false;\n}\n\n\n\/\/ Implementation of StringRef hashing.\nhash_code llvm::hash_value(StringRef S) {\n  return hash_combine_range(S.begin(), S.end());\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma ident \"$Id$\"\n\n\/**\n * @file MWCSDetector.hpp\n * This is a class to detect cycle slips using the Melbourne-Wubbena\n * combination.\n *\/\n\n#ifndef MWCSDETECTOR_HPP\n#define MWCSDETECTOR_HPP\n\n\/\/============================================================================\n\/\/\n\/\/  This file is part of GPSTk, the GPS Toolkit.\n\/\/\n\/\/  The GPSTk is free software; you can redistribute it and\/or modify\n\/\/  it under the terms of the GNU Lesser General Public License as published\n\/\/  by the Free Software Foundation; either version 2.1 of the License, or\n\/\/  any later version.\n\/\/\n\/\/  The GPSTk is distributed in the hope that it will be useful,\n\/\/  but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n\/\/  GNU Lesser General Public License for more details.\n\/\/\n\/\/  You should have received a copy of the GNU Lesser General Public\n\/\/  License along with GPSTk; if not, write to the Free Software Foundation,\n\/\/  Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA\n\/\/\n\/\/  Dagoberto Salazar - gAGE ( http:\/\/www.gage.es ). 2007, 2008\n\/\/\n\/\/============================================================================\n\n\n\n#include \"ProcessingClass.hpp\"\n#include <list>\n\n\nnamespace gpstk\n{\n\n      \/** @addtogroup GPSsolutions *\/\n      \/\/@{\n\n\n      \/** This is a class to detect cycle slips using MW observables.\n       *\n       * This class is meant to be used with the GNSS data structures objects\n       * found in \"DataStructures\" class.\n       *\n       * A typical way to use this class follows:\n       *\n       * @code\n       *   RinexObsStream rin(\"ebre0300.02o\");\n       *\n       *   gnssRinex gRin;\n       *   ComputeMelbourneWubbena getMW;\n       *   MWCSDetector markCSMW;\n       *\n       *   while(rin >> gRin)\n       *   {\n       *      gRin >> getMW >> markCSMW;\n       *   }\n       * @endcode\n       *\n       * The \"MWCSDetector\" object will visit every satellite in the GNSS data\n       * structure that is \"gRin\" and will decide if a cycle slip has happened\n       * in the given observable.\n       *\n       * The algorithm will use MW observables, and the LLI1 and LLI2 indexes.\n       * The result (a 1 if a cycle slip is found, 0 otherwise) will be stored\n       * in the data structure both as the CSL1 and CSL2 indexes.\n       *\n       * In taking the decision, this algorithm will use criteria as the\n       * maximum interval of time between two successive epochs and the\n       * maximum number of Melbourne-Wubbena wavelenghts allowed above or\n       * below the MW combination average for that arc.\n       *\n       * The default values are usually fine, but you may change them with the\n       * appropriate methods. This is of special importance for the maximum\n       * interval time, that should be adjusted for your sampling rate. It is\n       * 61 seconds by default, which is appropriate for 30 seconds per sample\n       * RINEX observation files.\n       *\n       * When used with the \">>\" operator, this class returns the same\n       * incoming data structure with the cycle slip indexes inserted along\n       * their corresponding satellites. Be warned that if a given satellite\n       * does not have the observations required, it will be summarily deleted\n       * from the data structure.\n       *\n       * You should be aware that the Melbourne-Wubbena combination is based\n       * on a mix of code and phase observations, so it is very noisy.\n       * Therefore, it has a tendency to yield a high number of false\n       * positives if you are not careful with its parameters. Because of\n       * this, the default parameters are very conservative, i.e., the\n       * detector is NOT very sensitive by default.\n       *\n       * Best results are achieved when using this detector as a \"backup\"\n       * detector for detectors based in LI combination, like this:\n       *\n       * @code\n       *   RinexObsStream rin(\"ebre0300.02o\");\n       *\n       *   gnssRinex gRin;\n       *   ComputeLI getLI;\n       *   LICSDetector markCSLI;\n       *   ComputeMelbourneWubbena getMW;\n       *   MWCSDetector markCSMW;\n       *\n       *   while(rin >> gRin)\n       *   {\n       *      gRin >> getLI >> getMW >> markCSLI >> markCSMW;\n       *   }\n       * @endcode\n       *\n       * @sa LICSDetector.hpp for more information.\n       *\n       * \\warning Cycle slip detectors are objets that store their internal\n       * state, so you MUST NOT use the SAME object to process DIFFERENT data\n       * streams.\n       *\n       *\/\n   class MWCSDetector : public ProcessingClass\n   {\n   public:\n\n         \/\/\/ Default constructor, setting default parameters.\n      MWCSDetector() : obsType(TypeID::MWubbena), lliType1(TypeID::LLI1),\n                       lliType2(TypeID::LLI2), resultType1(TypeID::CSL1),\n                       resultType2(TypeID::CSL2), deltaTMax(61.0),\n                       maxNumLambdas(10.0), useLLI(true)\n      { setIndex(); };\n\n\n         \/** Common constructor\n          *\n          * @param mLambdas      Maximum deviation allowed before declaring\n          *                      cycle slip (in number of Melbourne-Wubbena\n          *                      wavelenghts).\n          * @param dtMax         Maximum interval of time allowed between two\n          *                      successive epochs, in seconds.\n          *\/\n      MWCSDetector( const double& mLambdas,\n                    const double& dtMax = 61.0,\n                    const bool& use = true );\n\n\n         \/** Returns a satTypeValueMap object, adding the new data generated\n          *  when calling this object.\n          *\n          * @param epoch     Time of observations.\n          * @param gData     Data object holding the data.\n          * @param epochflag Epoch flag.\n          *\/\n      virtual satTypeValueMap& Process( const DayTime& epoch,\n                                        satTypeValueMap& gData,\n                                        const short& epochflag = 0 )\n         throw(ProcessingException);\n\n\n         \/** Method to set the maximum interval of time allowed between two\n          *  successive epochs.\n          *\n          * @param maxDelta      Maximum interval of time, in seconds\n          *\/\n      virtual MWCSDetector& setDeltaTMax(const double& maxDelta);\n\n\n         \/** Method to get the maximum interval of time allowed between two\n          *  successive epochs, in seconds.\n          *\/\n      virtual double getDeltaTMax() const\n      { return deltaTMax; };\n\n\n         \/** Method to set the maximum deviation allowed before declaring\n          *  cycle slip (in number of Melbourne-Wubbena wavelenghts).\n          *\n          * @param mLambdas     Maximum deviation allowed before declaring\n          *                     cycle slip (in number of Melbourne-Wubbena\n          *                     wavelenghts).\n          *\/\n      virtual MWCSDetector& setMaxNumLambdas(const double& mLambdas);\n\n\n         \/** Method to get the maximum deviation allowed before declaring\n          *  cycle slip (in number of Melbourne-Wubbena wavelenghts).\n          *\/\n      virtual double getMaxNumLambdas() const\n      { return maxNumLambdas; };\n\n\n         \/** Method to set whether the LLI indexes will be used as\n          *  an aid or not.\n          *\n          * @param use   Boolean value enabling\/disabling LLI check.\n          *\/\n      virtual MWCSDetector& setUseLLI(const bool& use)\n      { useLLI = use; return (*this); };\n\n\n         \/\/\/ Method to know if the LLI check is enabled or disabled.\n      virtual bool getUseLLI() const\n      { return useLLI; };\n\n\n         \/** Returns a gnnsSatTypeValue object, adding the new data generated\n          *  when calling this object.\n          *\n          * @param gData    Data object holding the data.\n          *\/\n      virtual gnssSatTypeValue& Process(gnssSatTypeValue& gData)\n         throw(ProcessingException)\n      { (*this).Process(gData.header.epoch, gData.body); return gData; };\n\n\n         \/** Returns a gnnsRinex object, adding the new data generated when\n          *  calling this object.\n          *\n          * @param gData    Data object holding the data.\n          *\/\n      virtual gnssRinex& Process(gnssRinex& gData)\n         throw(ProcessingException);\n\n\n         \/\/\/ Returns an index identifying this object.\n      virtual int getIndex(void) const;\n\n\n         \/\/\/ Returns a string identifying this object.\n      virtual std::string getClassName(void) const;\n\n\n         \/\/\/ Destructor\n      virtual ~MWCSDetector() {};\n\n\n   private:\n\n\n         \/\/\/ Type of observation.\n      TypeID obsType;\n\n\n         \/\/\/ Type of LMW1 record.\n      TypeID lliType1;\n\n\n         \/\/\/ Type of LMW2 record.\n      TypeID lliType2;\n\n\n         \/\/\/ Type of result #1.\n      TypeID resultType1;\n\n\n         \/\/\/ Type of result #2.\n      TypeID resultType2;\n\n\n         \/** Maximum interval of time allowed between two successive\n          *  epochs, in seconds.\n          *\/\n      double deltaTMax;\n\n\n         \/** Maximum deviation allowed before declaring cycle slip,\n          *  in number of Melbourne-Wubbena wavelenghts.\n          *\/\n      double maxNumLambdas;\n\n\n         \/\/\/ Whether use or ignore the LLI indexes as an aid. \n      bool useLLI;\n\n\n         \/\/\/ A structure used to store filter data for a SV.\n      struct filterData\n      {\n            \/\/ Default constructor initializing the data in the structure\n         filterData() : formerEpoch(DayTime::BEGINNING_OF_TIME),\n                        windowSize(0), meanMW(0.0) {};\n\n         DayTime formerEpoch;    \/\/\/< The previous epoch time stamp.\n         int windowSize;         \/\/\/< Size of current window, in samples.\n         double meanMW;          \/\/\/< Accumulated mean value of combination.\n      };\n\n\n         \/\/\/ Map holding the information regarding every satellite\n      std::map<SatID, filterData> MWData;\n\n\n         \/** Method that implements the Melbourne-Wubbena cycle slip\n          *  detection algorithm\n          *\n          * @param epoch     Time of observations.\n          * @param sat       SatID.\n          * @param tvMap     Data structure of TypeID and values.\n          * @param epochflag Epoch flag.\n          * @param mw        Current MW observation value.\n          * @param lli1      LLI1 index.\n          * @param lli2      LLI2 index.\n          *\/\n      virtual double getDetection( const DayTime& epoch,\n                                   const SatID& sat,\n                                   typeValueMap& tvMap,\n                                   const short& epochflag,\n                                   const double& mw,\n                                   const double& lli1,\n                                   const double& lli2 );\n\n\n         \/\/\/ Initial index assigned to this class.\n      static int classIndex;\n\n\n         \/\/\/ Index belonging to this object.\n      int index;\n\n\n         \/\/\/ Sets the index and increment classIndex.\n      void setIndex(void)\n      { (*this).index = classIndex++; };\n\n\n   }; \/\/ End of class 'MWCSDetector'\n\n      \/\/@}\n\n}\n#endif   \/\/ MWCSDETECTOR_HPP\n<commit_msg>Minor documentation improvements.<commit_after>#pragma ident \"$Id$\"\n\n\/**\n * @file MWCSDetector.hpp\n * This is a class to detect cycle slips using the Melbourne-Wubbena\n * combination.\n *\/\n\n#ifndef GPSTK_MWCSDETECTOR_HPP\n#define GPSTK_MWCSDETECTOR_HPP\n\n\/\/============================================================================\n\/\/\n\/\/  This file is part of GPSTk, the GPS Toolkit.\n\/\/\n\/\/  The GPSTk is free software; you can redistribute it and\/or modify\n\/\/  it under the terms of the GNU Lesser General Public License as published\n\/\/  by the Free Software Foundation; either version 2.1 of the License, or\n\/\/  any later version.\n\/\/\n\/\/  The GPSTk is distributed in the hope that it will be useful,\n\/\/  but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n\/\/  GNU Lesser General Public License for more details.\n\/\/\n\/\/  You should have received a copy of the GNU Lesser General Public\n\/\/  License along with GPSTk; if not, write to the Free Software Foundation,\n\/\/  Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA\n\/\/\n\/\/  Dagoberto Salazar - gAGE ( http:\/\/www.gage.es ). 2007, 2008, 2009\n\/\/\n\/\/============================================================================\n\n\n\n#include \"ProcessingClass.hpp\"\n#include <list>\n\n\nnamespace gpstk\n{\n\n      \/** @addtogroup GPSsolutions *\/\n      \/\/@{\n\n\n      \/** This is a class to detect cycle slips using MW observables.\n       *\n       * This class is meant to be used with the GNSS data structures objects\n       * found in \"DataStructures\" class.\n       *\n       * A typical way to use this class follows:\n       *\n       * @code\n       *   RinexObsStream rin(\"ebre0300.02o\");\n       *\n       *   gnssRinex gRin;\n       *   ComputeMelbourneWubbena getMW;\n       *   MWCSDetector markCSMW;\n       *\n       *   while(rin >> gRin)\n       *   {\n       *      gRin >> getMW >> markCSMW;\n       *   }\n       * @endcode\n       *\n       * The \"MWCSDetector\" object will visit every satellite in the GNSS data\n       * structure that is \"gRin\" and will decide if a cycle slip has happened\n       * in the given observable.\n       *\n       * The algorithm will use MW observables, and the LLI1 and LLI2 indexes.\n       * The result (a 1 if a cycle slip is found, 0 otherwise) will be stored\n       * in the data structure both as the CSL1 and CSL2 indexes.\n       *\n       * In taking the decision, this algorithm will use criteria as the\n       * maximum interval of time between two successive epochs and the\n       * maximum number of Melbourne-Wubbena wavelenghts allowed above or\n       * below the MW combination average for that arc.\n       *\n       * The default values are usually fine, but you may change them with the\n       * appropriate methods. This is of special importance for the maximum\n       * interval time, that should be adjusted for your sampling rate. It is\n       * 61 seconds by default, which is appropriate for 30 seconds per sample\n       * RINEX observation files.\n       *\n       * When used with the \">>\" operator, this class returns the same\n       * incoming data structure with the cycle slip indexes inserted along\n       * their corresponding satellites. Be warned that if a given satellite\n       * does not have the observations required, it will be summarily deleted\n       * from the data structure.\n       *\n       * You should be aware that the Melbourne-Wubbena combination is based\n       * on a mix of code and phase observations, so it is very noisy.\n       * Therefore, it has a tendency to yield a high number of false\n       * positives if you are not careful with its parameters. Because of\n       * this, the default parameters are very conservative, i.e., the\n       * detector is NOT very sensitive by default.\n       *\n       * Best results are achieved when using this detector as a \"backup\"\n       * detector for detectors based in LI combination, like this:\n       *\n       * @code\n       *   RinexObsStream rin(\"ebre0300.02o\");\n       *\n       *   gnssRinex gRin;\n       *   ComputeLI getLI;\n       *   LICSDetector markCSLI;\n       *   ComputeMelbourneWubbena getMW;\n       *   MWCSDetector markCSMW;\n       *\n       *   while(rin >> gRin)\n       *   {\n       *      gRin >> getLI >> getMW >> markCSLI >> markCSMW;\n       *   }\n       * @endcode\n       *\n       * @sa LICSDetector.hpp and LICSDetector2.hpp for more information.\n       *\n       * \\warning Cycle slip detectors are objets that store their internal\n       * state, so you MUST NOT use the SAME object to process DIFFERENT data\n       * streams.\n       *\n       *\/\n   class MWCSDetector : public ProcessingClass\n   {\n   public:\n\n         \/\/\/ Default constructor, setting default parameters.\n      MWCSDetector() : obsType(TypeID::MWubbena), lliType1(TypeID::LLI1),\n                       lliType2(TypeID::LLI2), resultType1(TypeID::CSL1),\n                       resultType2(TypeID::CSL2), deltaTMax(61.0),\n                       maxNumLambdas(10.0), useLLI(true)\n      { setIndex(); };\n\n\n         \/** Common constructor\n          *\n          * @param mLambdas      Maximum deviation allowed before declaring\n          *                      cycle slip (in number of Melbourne-Wubbena\n          *                      wavelenghts).\n          * @param dtMax         Maximum interval of time allowed between two\n          *                      successive epochs, in seconds.\n          *\/\n      MWCSDetector( const double& mLambdas,\n                    const double& dtMax = 61.0,\n                    const bool& use = true );\n\n\n         \/** Returns a satTypeValueMap object, adding the new data generated\n          *  when calling this object.\n          *\n          * @param epoch     Time of observations.\n          * @param gData     Data object holding the data.\n          * @param epochflag Epoch flag.\n          *\/\n      virtual satTypeValueMap& Process( const DayTime& epoch,\n                                        satTypeValueMap& gData,\n                                        const short& epochflag = 0 )\n         throw(ProcessingException);\n\n\n         \/** Method to set the maximum interval of time allowed between two\n          *  successive epochs.\n          *\n          * @param maxDelta      Maximum interval of time, in seconds\n          *\/\n      virtual MWCSDetector& setDeltaTMax(const double& maxDelta);\n\n\n         \/** Method to get the maximum interval of time allowed between two\n          *  successive epochs, in seconds.\n          *\/\n      virtual double getDeltaTMax() const\n      { return deltaTMax; };\n\n\n         \/** Method to set the maximum deviation allowed before declaring\n          *  cycle slip (in number of Melbourne-Wubbena wavelenghts).\n          *\n          * @param mLambdas     Maximum deviation allowed before declaring\n          *                     cycle slip (in number of Melbourne-Wubbena\n          *                     wavelenghts).\n          *\/\n      virtual MWCSDetector& setMaxNumLambdas(const double& mLambdas);\n\n\n         \/** Method to get the maximum deviation allowed before declaring\n          *  cycle slip (in number of Melbourne-Wubbena wavelenghts).\n          *\/\n      virtual double getMaxNumLambdas() const\n      { return maxNumLambdas; };\n\n\n         \/** Method to set whether the LLI indexes will be used as\n          *  an aid or not.\n          *\n          * @param use   Boolean value enabling\/disabling LLI check.\n          *\/\n      virtual MWCSDetector& setUseLLI(const bool& use)\n      { useLLI = use; return (*this); };\n\n\n         \/\/\/ Method to know if the LLI check is enabled or disabled.\n      virtual bool getUseLLI() const\n      { return useLLI; };\n\n\n         \/** Returns a gnnsSatTypeValue object, adding the new data generated\n          *  when calling this object.\n          *\n          * @param gData    Data object holding the data.\n          *\/\n      virtual gnssSatTypeValue& Process(gnssSatTypeValue& gData)\n         throw(ProcessingException)\n      { (*this).Process(gData.header.epoch, gData.body); return gData; };\n\n\n         \/** Returns a gnnsRinex object, adding the new data generated when\n          *  calling this object.\n          *\n          * @param gData    Data object holding the data.\n          *\/\n      virtual gnssRinex& Process(gnssRinex& gData)\n         throw(ProcessingException);\n\n\n         \/\/\/ Returns an index identifying this object.\n      virtual int getIndex(void) const;\n\n\n         \/\/\/ Returns a string identifying this object.\n      virtual std::string getClassName(void) const;\n\n\n         \/\/\/ Destructor\n      virtual ~MWCSDetector() {};\n\n\n   private:\n\n\n         \/\/\/ Type of observation.\n      TypeID obsType;\n\n\n         \/\/\/ Type of LMW1 record.\n      TypeID lliType1;\n\n\n         \/\/\/ Type of LMW2 record.\n      TypeID lliType2;\n\n\n         \/\/\/ Type of result #1.\n      TypeID resultType1;\n\n\n         \/\/\/ Type of result #2.\n      TypeID resultType2;\n\n\n         \/** Maximum interval of time allowed between two successive\n          *  epochs, in seconds.\n          *\/\n      double deltaTMax;\n\n\n         \/** Maximum deviation allowed before declaring cycle slip,\n          *  in number of Melbourne-Wubbena wavelenghts.\n          *\/\n      double maxNumLambdas;\n\n\n         \/\/\/ Whether use or ignore the LLI indexes as an aid. \n      bool useLLI;\n\n\n         \/\/\/ A structure used to store filter data for a SV.\n      struct filterData\n      {\n            \/\/ Default constructor initializing the data in the structure\n         filterData() : formerEpoch(DayTime::BEGINNING_OF_TIME),\n                        windowSize(0), meanMW(0.0) {};\n\n         DayTime formerEpoch;    \/\/\/< The previous epoch time stamp.\n         int windowSize;         \/\/\/< Size of current window, in samples.\n         double meanMW;          \/\/\/< Accumulated mean value of combination.\n      };\n\n\n         \/\/\/ Map holding the information regarding every satellite\n      std::map<SatID, filterData> MWData;\n\n\n         \/** Method that implements the Melbourne-Wubbena cycle slip\n          *  detection algorithm\n          *\n          * @param epoch     Time of observations.\n          * @param sat       SatID.\n          * @param tvMap     Data structure of TypeID and values.\n          * @param epochflag Epoch flag.\n          * @param mw        Current MW observation value.\n          * @param lli1      LLI1 index.\n          * @param lli2      LLI2 index.\n          *\/\n      virtual double getDetection( const DayTime& epoch,\n                                   const SatID& sat,\n                                   typeValueMap& tvMap,\n                                   const short& epochflag,\n                                   const double& mw,\n                                   const double& lli1,\n                                   const double& lli2 );\n\n\n         \/\/\/ Initial index assigned to this class.\n      static int classIndex;\n\n\n         \/\/\/ Index belonging to this object.\n      int index;\n\n\n         \/\/\/ Sets the index and increment classIndex.\n      void setIndex(void)\n      { (*this).index = classIndex++; };\n\n\n   }; \/\/ End of class 'MWCSDetector'\n\n\n      \/\/@}\n\n}  \/\/ End of namespace gpstk\n\n#endif   \/\/ GPSTK_MWCSDETECTOR_HPP\n<|endoftext|>"}
{"text":"<commit_before>#include <puppet\/runtime\/values\/value.hpp>\n#include <puppet\/cast.hpp>\n#include <boost\/functional\/hash.hpp>\n\nusing namespace std;\n\nnamespace puppet { namespace runtime { namespace types {\n\n    array const array::instance;\n\n    array::array(unique_ptr<values::type> type, int64_t from, int64_t to) :\n        _element_type(rvalue_cast(type)),\n        _from(from),\n        _to(to)\n    {\n        if (!_element_type) {\n            _element_type.reset(new values::type(data()));\n        }\n    }\n\n    array::array(array const& other) :\n        _element_type(new values::type(other.element_type())),\n        _from(other.from()),\n        _to(other.to())\n    {\n    }\n\n    array& array::operator=(array const& other)\n    {\n        _element_type.reset(new values::type(other.element_type()));\n        _from = other.from();\n        _to = other.to();\n        return *this;\n    }\n\n    values::type const& array::element_type() const\n    {\n        return *_element_type;\n    }\n\n    int64_t array::from() const\n    {\n        return _from;\n    }\n\n    int64_t array::to() const\n    {\n        return _to;\n    }\n\n    char const* array::name()\n    {\n        return \"Array\";\n    }\n\n    bool array::is_instance(values::value const& value, recursion_guard& guard) const\n    {\n        \/\/ Check for array\n        auto ptr = value.as<values::array>();\n        if (!ptr) {\n            return false;\n        }\n\n        \/\/ Check for size is range\n        int64_t size = static_cast<int64_t>(ptr->size());\n        if (!(_to < _from ? (size >= _to && size <= _from) : (size >= _from && size <= _to))) {\n            return false;\n        }\n\n        \/\/ Check that each element is of the type\n        for (auto const& element : *ptr) {\n            if (!_element_type->is_instance(*element, guard)) {\n                return false;\n            }\n        }\n        return true;\n    }\n\n    bool array::is_assignable(values::type const& other, recursion_guard& guard) const\n    {\n        int64_t from, to;\n        if (auto array = boost::get<types::array>(&other)) {\n            \/\/ Ensure element type is assignable\n            if (!_element_type->is_assignable(*array->_element_type, guard)) {\n                return false;\n            }\n            from = array->_from;\n            to = array->_to;\n        } else if (auto tuple = boost::get<types::tuple>(&other)) {\n            if (tuple->types().empty()) {\n                \/\/ Not assignable from an empty tuple\n                return false;\n            }\n            \/\/ Ensure the element type is assignable from all of the tuple's types\n            for (auto& type : tuple->types()) {\n                if (!_element_type->is_assignable(*type, guard)) {\n                    return false;\n                }\n            }\n            from = tuple->from();\n            to = tuple->to();\n        } else {\n            \/\/ Not a Tuple or Array\n            return false;\n        }\n        return std::min(from, to) >= std::min(_from, _to) &&\n               std::max(from, to) <= std::max(_from, _to);\n    }\n\n    void array::write(ostream& stream, bool expand) const\n    {\n        stream << array::name() << '[';\n        _element_type->write(stream, false);\n        bool from_default = _from == 0;\n        bool to_default = _to == numeric_limits<int64_t>::max();\n        if (from_default && to_default) {\n            \/\/ Only output the type\n            stream << ']';\n            return;\n        }\n        stream << \", \";\n        if (from_default) {\n            stream << \"default\";\n        } else {\n            stream << _from;\n        }\n        stream << \", \";\n        if (to_default) {\n            stream << \"default\";\n        } else {\n            stream << _to;\n        }\n        stream << ']';\n    }\n\n    ostream& operator<<(ostream& os, array const& type)\n    {\n        type.write(os);\n        return os;\n    }\n\n    bool operator==(array const& left, array const& right)\n    {\n        return left.from() == right.from() && left.to() == right.to() && left.element_type() == right.element_type();\n    }\n\n    bool operator!=(array const& left, array const& right)\n    {\n        return !(left == right);\n    }\n\n    size_t hash_value(array const& type)\n    {\n        static const size_t name_hash = boost::hash_value(array::name());\n\n        size_t seed = 0;\n        boost::hash_combine(seed, name_hash);\n        boost::hash_combine(seed, type.element_type());\n        boost::hash_combine(seed, type.from());\n        boost::hash_combine(seed, type.to());\n        return seed;\n    }\n\n}}}  \/\/ namespace puppet::runtime::types\n<commit_msg>(maint) Fix Array type to present without type if \"empty\".<commit_after>#include <puppet\/runtime\/values\/value.hpp>\n#include <puppet\/cast.hpp>\n#include <boost\/functional\/hash.hpp>\n\nusing namespace std;\n\nnamespace puppet { namespace runtime { namespace types {\n\n    array const array::instance;\n\n    array::array(unique_ptr<values::type> type, int64_t from, int64_t to) :\n        _element_type(rvalue_cast(type)),\n        _from(from),\n        _to(to)\n    {\n        if (!_element_type) {\n            _element_type.reset(new values::type(data()));\n        }\n    }\n\n    array::array(array const& other) :\n        _element_type(new values::type(other.element_type())),\n        _from(other.from()),\n        _to(other.to())\n    {\n    }\n\n    array& array::operator=(array const& other)\n    {\n        _element_type.reset(new values::type(other.element_type()));\n        _from = other.from();\n        _to = other.to();\n        return *this;\n    }\n\n    values::type const& array::element_type() const\n    {\n        return *_element_type;\n    }\n\n    int64_t array::from() const\n    {\n        return _from;\n    }\n\n    int64_t array::to() const\n    {\n        return _to;\n    }\n\n    char const* array::name()\n    {\n        return \"Array\";\n    }\n\n    bool array::is_instance(values::value const& value, recursion_guard& guard) const\n    {\n        \/\/ Check for array\n        auto ptr = value.as<values::array>();\n        if (!ptr) {\n            return false;\n        }\n\n        \/\/ Check for size is range\n        int64_t size = static_cast<int64_t>(ptr->size());\n        if (!(_to < _from ? (size >= _to && size <= _from) : (size >= _from && size <= _to))) {\n            return false;\n        }\n\n        \/\/ Check that each element is of the type\n        for (auto const& element : *ptr) {\n            if (!_element_type->is_instance(*element, guard)) {\n                return false;\n            }\n        }\n        return true;\n    }\n\n    bool array::is_assignable(values::type const& other, recursion_guard& guard) const\n    {\n        int64_t from, to;\n        if (auto array = boost::get<types::array>(&other)) {\n            \/\/ Ensure element type is assignable\n            if (!_element_type->is_assignable(*array->_element_type, guard)) {\n                return false;\n            }\n            from = array->_from;\n            to = array->_to;\n        } else if (auto tuple = boost::get<types::tuple>(&other)) {\n            if (tuple->types().empty()) {\n                \/\/ Not assignable from an empty tuple\n                return false;\n            }\n            \/\/ Ensure the element type is assignable from all of the tuple's types\n            for (auto& type : tuple->types()) {\n                if (!_element_type->is_assignable(*type, guard)) {\n                    return false;\n                }\n            }\n            from = tuple->from();\n            to = tuple->to();\n        } else {\n            \/\/ Not a Tuple or Array\n            return false;\n        }\n        return std::min(from, to) >= std::min(_from, _to) &&\n               std::max(from, to) <= std::max(_from, _to);\n    }\n\n    void array::write(ostream& stream, bool expand) const\n    {\n        stream << array::name();\n\n        \/\/ Write empty arrays in a special format, without the element type\n        if (_from == 0 && _to == 0) {\n            stream << \"[0, 0]\";\n            return;\n        }\n\n        bool from_default = _from == 0;\n        bool to_default = _to == numeric_limits<int64_t>::max();\n\n        if (from_default && to_default) {\n            \/\/ Only output the type, provided it is not default\n            if (*_element_type != data::instance) {\n                stream << '[';\n                _element_type->write(stream, false);\n                stream << ']';\n            }\n            return;\n        }\n\n        stream << '[';\n        _element_type->write(stream, false);\n        stream << \", \";\n        if (from_default) {\n            stream << \"default\";\n        } else {\n            stream << _from;\n        }\n        stream << \", \";\n        if (to_default) {\n            stream << \"default\";\n        } else {\n            stream << _to;\n        }\n        stream << ']';\n    }\n\n    ostream& operator<<(ostream& os, array const& type)\n    {\n        type.write(os);\n        return os;\n    }\n\n    bool operator==(array const& left, array const& right)\n    {\n        return left.from() == right.from() && left.to() == right.to() && left.element_type() == right.element_type();\n    }\n\n    bool operator!=(array const& left, array const& right)\n    {\n        return !(left == right);\n    }\n\n    size_t hash_value(array const& type)\n    {\n        static const size_t name_hash = boost::hash_value(array::name());\n\n        size_t seed = 0;\n        boost::hash_combine(seed, name_hash);\n        boost::hash_combine(seed, type.element_type());\n        boost::hash_combine(seed, type.from());\n        boost::hash_combine(seed, type.to());\n        return seed;\n    }\n\n}}}  \/\/ namespace puppet::runtime::types\n<|endoftext|>"}
{"text":"<commit_before>#include \"consts.h\"\n#include \"matrix\/matrix.h\"\n#include <iostream>\n#include <iomanip>\n#include <cmath>\n#include <cstdio>\n\nusing namespace std;\n\n\nvoid init(int nv, double Yn[MAX_NODES+1][MAX_NODES+2]){\n    for (int i=0; i<=nv; i++){\n        for (int j=0; j<=nv+1; j++)\n            Yn[i][j]=0;\n    }\n}\n\n\nvoid print(int nv, double Yn[MAX_NODES+1][MAX_NODES+2]){\n    \/* Opcional: Mostra o sistema apos a montagem da estampa *\/\n    for (int k=1; k<=nv; k++) {\n        for (int j=1; j<=nv+1; j++)\n            if (Yn[k][j]!=0){\n                cout << setprecision(1) << fixed << setw(3) << showpos;\n                cout << Yn[k][j] << \" \";\n            }\n            else cout << \" ... \";\n        cout << endl;\n    }\n    cout << endl;\n}\n\n\nint solve( int nv, double Yn[MAX_NODES+1][MAX_NODES+2] ){\n    int i, j, l, a;\n    double t, p;\n\n    for( i = 1; i <= nv; i++ ){\n        t = 0.0;\n        a = i;\n        for( l = i; l <= nv; l++ ){\n            if( fabs( Yn[l][i] ) > fabs( t ) ){\n                a = l;\n                t = Yn[l][i];\n            }\n        }\n        if( i != a){\n            for( l = 1; l <= nv + 1; l++ ){\n                p = Yn[i][l];\n                Yn[i][l] = Yn[a][l];\n                Yn[a][l] = p;\n            }\n        }\n        if( fabs( t ) < TOLG ){\n            printf(\"Sistema singular\\n\");\n            return 1;\n        }\n        for( j = nv + 1; j > 0; j-- ){  \/* Basta j>i em vez de j>0 *\/\n            Yn[i][j] \/= t;\n            p = Yn[i][j];\n            for( l = 1; l <= nv; l++ ){\n                if( l != i )\n                    Yn[l][j] -= Yn[l][i] * p;\n            }\n        }\n    }\n    return 0;\n}\n\n\nvoid getSolution(int numVariables,\n                 double Yn[MAX_NODES+1][MAX_NODES+2],\n                 double solution[MAX_NODES+1]){\n    solution[0] = 0; \/\/ gnd\n    for (int i=1; i<=numVariables; i++) {\n        solution[i] = Yn[i][numVariables+1];\n    }\n}\n\nvoid copySolution(int numVariables,\n                  double originalSolution[MAX_NODES+1],\n                  double targetSolution[MAX_NODES+1]){\n    for (int i=1; i<=numVariables; i++) {\n        targetSolution[i] = originalSolution[i];\n    }\n}\n<commit_msg>Fixed CopySolution Function :satisfied::stuck_out_tongue_closed_eyes::joy::muscle::raised_hands::raised_hands::beers::beers:<commit_after>#include \"consts.h\"\n#include \"matrix\/matrix.h\"\n#include <iostream>\n#include <iomanip>\n#include <cmath>\n#include <cstdio>\n\nusing namespace std;\n\n\nvoid init(int nv, double Yn[MAX_NODES+1][MAX_NODES+2]){\n    for (int i=0; i<=nv; i++){\n        for (int j=0; j<=nv+1; j++)\n            Yn[i][j]=0;\n    }\n}\n\n\nvoid print(int nv, double Yn[MAX_NODES+1][MAX_NODES+2]){\n    \/* Opcional: Mostra o sistema apos a montagem da estampa *\/\n    for (int k=1; k<=nv; k++) {\n        for (int j=1; j<=nv+1; j++)\n            if (Yn[k][j]!=0){\n                cout << setprecision(1) << fixed << setw(3) << showpos;\n                cout << Yn[k][j] << \" \";\n            }\n            else cout << \" ... \";\n        cout << endl;\n    }\n    cout << endl;\n}\n\n\nint solve( int nv, double Yn[MAX_NODES+1][MAX_NODES+2] ){\n    int i, j, l, a;\n    double t, p;\n\n    for( i = 1; i <= nv; i++ ){\n        t = 0.0;\n        a = i;\n        for( l = i; l <= nv; l++ ){\n            if( fabs( Yn[l][i] ) > fabs( t ) ){\n                a = l;\n                t = Yn[l][i];\n            }\n        }\n        if( i != a){\n            for( l = 1; l <= nv + 1; l++ ){\n                p = Yn[i][l];\n                Yn[i][l] = Yn[a][l];\n                Yn[a][l] = p;\n            }\n        }\n        if( fabs( t ) < TOLG ){\n            printf(\"Sistema singular\\n\");\n            return 1;\n        }\n        for( j = nv + 1; j > 0; j-- ){  \/* Basta j>i em vez de j>0 *\/\n            Yn[i][j] \/= t;\n            p = Yn[i][j];\n            for( l = 1; l <= nv; l++ ){\n                if( l != i )\n                    Yn[l][j] -= Yn[l][i] * p;\n            }\n        }\n    }\n    return 0;\n}\n\n\nvoid getSolution(int numVariables,\n                 double Yn[MAX_NODES+1][MAX_NODES+2],\n                 double solution[MAX_NODES+1]){\n    solution[0] = 0; \/\/ gnd\n    for (int i=1; i<=numVariables; i++) {\n        solution[i] = Yn[i][numVariables+1];\n    }\n}\n\nvoid copySolution(int numVariables,\n                  double originalSolution[MAX_NODES+1],\n                  double targetSolution[MAX_NODES+1]){\n    for (int i=0; i<=numVariables; i++) {\n        targetSolution[i] = originalSolution[i];\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <config.h>\n\n#include <algorithm>\n#include <iterator>\n#include <iostream>\n#include <memory>\n#include <string>\n#include <set>\n#include <vector>\n#include <stack>\n\n#include <mcrl2\/atermpp\/aterm_init.h>\n#include <mcrl2\/lps\/ltsmin.h>\n\nextern \"C\" {\n#include <assert.h>\n#include <limits.h>\n#include <popt.h>\n\n#include <mcrl2-greybox.h>\n#include <dm\/dm.h>\n#include <runtime.h>\n}\n\nstatic std::string mcrl2_rewriter_strategy;\n#ifdef MCRL2_JITTYC_AVAILABLE\nstatic char const* mcrl2_args=\"--rewriter=jittyc\";\n#else\nstatic char const* mcrl2_args=\"--rewriter=jitty\";\n#endif\n\nstruct state_cb\n{\n    typedef int *state_vector;\n    TransitionCB& cb;\n    void* ctx;\n    int& count;\n\n    state_cb (TransitionCB& cb_, void *ctx_, int& count_)\n        : cb(cb_), ctx(ctx_), count(count_)\n    {}\n\n    void operator()(int edge_label, state_vector& next_state, int group)\n    {\n        \/\/ int labels[1] = { edge_label };\n        transition_info_t ti = { &edge_label, group };\n        cb (ctx, &ti, next_state);\n        ++count;\n    }\n};\n\nclass mcrl2_index {\npublic:\n    mcrl2_index(mcrl2::lps::pins* pins, int tag)\n        : pins_(pins), tag_(tag) {}\n    mcrl2::lps::pins* get_pins() const { return pins_; }\n    int tag() const { return tag_; }\nprotected:\n    mcrl2::lps::pins* pins_;\n    \/\/ crucially relies on that tag == typeno, although they\n    \/\/ are created separately\n    int tag_;\n};\n\nextern \"C\" {\n\nstatic void *\nmcrl2_newmap (void *ctx)\n{\n    static int tag = 0; \/\/ XXX typemap\n    return (void*)new mcrl2_index((mcrl2::lps::pins*)ctx, tag++);\n}\n\nstatic int\nmcrl2_chunk2int (void *map_, void *chunk, int len)\n{\n    mcrl2_index *map = (mcrl2_index *)map_;\n    mcrl2::lps::pins& pins = *map->get_pins();\n    return pins.data_type(map->tag()).deserialize(std::string((char*)chunk,len));\n}\n\nstatic const void *\nmcrl2_int2chunk (void *map_, int idx, int *len)\n{\n    mcrl2_index *map = (mcrl2_index *)map_;\n    mcrl2::lps::pins& pins = *map->get_pins();\n    std::string const& buf = pins.data_type(map->tag()).print(idx); \/\/ XXX serialize\n    *len = buf.length();\n    return buf.data(); \/\/ XXX life-time\n}\n\nstatic int\nmcrl2_chunk_count(void *map_)\n{\n    mcrl2_index *map = (mcrl2_index *)map_;\n    return map->get_pins()->data_type(map->tag()).size();\n}\n\nstatic void\noverride_chunk_methods(model_t model, mcrl2::lps::pins* pins)\n{\n    Warning(info, \"This mcrl2 language module does not work with the MPI backend.\");\n    GBsetChunkMethods(model, mcrl2_newmap, pins,\n                      (int2chunk_t)mcrl2_int2chunk,\n                      mcrl2_chunk2int, mcrl2_chunk_count);\n}\n\nstatic void\nmcrl2_popt (poptContext con, enum poptCallbackReason reason,\n            const struct poptOption *opt, const char *arg, void *data)\n{\n    (void)con;(void)opt;(void)arg;(void)data;\n    switch (reason) {\n    case POPT_CALLBACK_REASON_PRE:\n        break;\n    case POPT_CALLBACK_REASON_POST: {\n        Warning(debug,\"mcrl2 init\");\n        int argc;\n        char **argv;\n        RTparseOptions (mcrl2_args,&argc,&argv);\n        Warning (debug,\"ATerm init\");\n        MCRL2_ATERMPP_INIT(argc, argv);\n        char *rewriter = NULL;\n        struct poptOption options[] = {\n            { \"rewriter\", 0 , POPT_ARG_STRING , &rewriter , 0 , \"select rewriter\" , NULL },\n            POPT_TABLEEND\n        };\n        Warning (debug,\"options\");\n        poptContext optCon = poptGetContext(NULL, argc,(const char **) argv, options, 0);\n        int res = poptGetNextOpt(optCon);\n        if (res != -1 || poptPeekArg(optCon)!=NULL) {\n            Fatal(1,error,\"Bad mcrl2 options: %s\",mcrl2_args);\n        }\n        poptFreeContext(optCon);\n        if (rewriter) {\n            mcrl2_rewriter_strategy = std::string(rewriter);\n        } else {\n            Fatal(1,error,\"unrecognized rewriter: %s (jitty, jittyc, inner and innerc supported)\",rewriter);\n        }\n        GBregisterLoader(\"lps\",MCRL2loadGreyboxModel);\n        Warning(info,\"mCRL2 language module initialized\");\n        return;\n    }\n    case POPT_CALLBACK_REASON_OPTION:\n        break;\n    }\n    Fatal(1,error,\"unexpected call to mcrl2_popt\");\n}\n\nstruct poptOption mcrl2_options[] = {\n    { NULL, 0 , POPT_ARG_CALLBACK|POPT_CBFLAG_POST|POPT_CBFLAG_SKIPOPTION , (void*)mcrl2_popt , 0 , NULL , NULL},\n    { \"mcrl2\" , 0 , POPT_ARG_STRING|POPT_ARGFLAG_SHOW_DEFAULT , &mcrl2_args , 0, \"Pass options to the mcrl2 library.\",\"<mcrl2 options>\" },\n    POPT_TABLEEND\n};\n\nvoid\nMCRL2initGreybox (int argc,char *argv[],void* stack_bottom)\n{\n    Warning(debug,\"ATerm init\");\n    MCRL2_ATERMPP_INIT(argc, argv);\n    (void)stack_bottom;\n}\n\nstatic int\nMCRL2getTransitionsLong (model_t m, int group, int *src, TransitionCB cb, void *ctx)\n{\n    using namespace mcrl2;\n    lps::pins *pins = (lps::pins *)GBgetContext (m);\n    int count = 0;\n    state_cb f(cb, ctx, count);\n    pins->next_state_long(src, group, f);\n    return count;\n}\n\nstatic int\nMCRL2getTransitionsAll (model_t m, int* src, TransitionCB cb, void *ctx)\n{\n    using namespace mcrl2;\n    lps::pins *pins = (lps::pins *)GBgetContext (m);\n    int count = 0;\n    state_cb f(cb, ctx, count);\n    pins->next_state_all(src, f);\n    return count;\n}\n\nvoid\nMCRL2loadGreyboxModel (model_t m, const char *model_name)\n{\n    using namespace mcrl2;\n    Warning(info, \"mCRL2 rewriter: %s\", mcrl2_rewriter_strategy.c_str());\n    lps::pins *pins = new lps::pins(std::string(model_name), mcrl2_rewriter_strategy);\n    assert (pins != 0);\n    GBsetContext(m,pins);\n\n    lts_type_t ltstype=lts_type_create();\n    lts_type_set_state_length(ltstype, pins->process_parameter_count());\n\n    \/\/ create ltsmin type for each mcrl2-provided type\n    for(size_t i = 0; i < pins->datatype_count(); ++i) {\n        lts_type_add_type(ltstype, pins->data_type(i).name().c_str(), NULL);\n    }\n\n    \/\/ process parameters\n    for(size_t i = 0; i < pins->process_parameter_count(); ++i) {\n        lts_type_set_state_name(ltstype, i, pins->process_parameter_name(i).c_str());\n        lts_type_set_state_type(ltstype, i, pins->data_type(pins->process_parameter_type(i)).name().c_str());\n    }\n\n    \/\/ edge labels\n    lts_type_set_edge_label_count(ltstype, pins->edge_label_count());\n    for (size_t i = 0; i < pins->edge_label_count(); ++i) {\n        lts_type_set_edge_label_name(ltstype, i, pins->edge_label_name(i).c_str());\n        lts_type_set_edge_label_type(ltstype, i, pins->data_type(pins->edge_label_type(i)).name().c_str());\n    }\n\n    override_chunk_methods(m, pins);\n    GBsetLTStype(m,ltstype);\n\n    int s0[pins->process_parameter_count()];\n    lps::pins::ltsmin_state_type p_s0 = s0;\n    pins->get_initial_state(p_s0);\n    GBsetInitialState(m, s0);\n\n    matrix_t *p_dm_info       = (matrix_t *)RTmalloc(sizeof *p_dm_info);\n    matrix_t *p_dm_read_info  = (matrix_t *)RTmalloc(sizeof *p_dm_read_info);\n    matrix_t *p_dm_write_info = (matrix_t *)RTmalloc(sizeof *p_dm_write_info);\n    dm_create(p_dm_info, pins->group_count(),\n              pins->process_parameter_count());\n    dm_create(p_dm_read_info, pins->group_count(),\n              pins->process_parameter_count());\n    dm_create(p_dm_write_info, pins->group_count(),\n              pins->process_parameter_count());\n\n    for (int i = 0; i <dm_nrows (p_dm_info); i++) {\n        std::vector<size_t> const& vec_r = pins->read_group(i);\n        for (size_t j=0; j <vec_r.size(); j++) {\n            dm_set (p_dm_info, i, vec_r[j]);\n            dm_set (p_dm_read_info, i, vec_r[j]);\n        }\n        std::vector<size_t> const& vec_w = pins->write_group(i);\n        for (size_t j=0; j <vec_w.size(); j++) {\n            dm_set (p_dm_info, i, vec_w[j]);\n            dm_set (p_dm_write_info, i, vec_w[j]);\n        }\n    }\n\n    GBsetDMInfo (m, p_dm_info);\n    GBsetDMInfoRead (m, p_dm_read_info);\n    GBsetDMInfoWrite (m, p_dm_write_info);\n    matrix_t *p_sl_info = (matrix_t *)RTmalloc(sizeof *p_sl_info);\n    dm_create (p_sl_info, 0, pins->process_parameter_count());\n    GBsetStateLabelInfo (m, p_sl_info);\n    GBsetNextStateLong (m, MCRL2getTransitionsLong);\n    GBsetNextStateAll (m, MCRL2getTransitionsAll);\n}\n\n}\n<commit_msg>Pass in storage for destination state and labels to next_state_{all,long}<commit_after>#include <config.h>\n\n#include <algorithm>\n#include <iterator>\n#include <iostream>\n#include <memory>\n#include <string>\n#include <set>\n#include <vector>\n#include <stack>\n\n#include <mcrl2\/atermpp\/aterm_init.h>\n#include <mcrl2\/lps\/ltsmin.h>\n\nextern \"C\" {\n#include <assert.h>\n#include <limits.h>\n#include <popt.h>\n\n#include <mcrl2-greybox.h>\n#include <dm\/dm.h>\n#include <runtime.h>\n}\n\nstatic std::string mcrl2_rewriter_strategy;\n#ifdef MCRL2_JITTYC_AVAILABLE\nstatic char const* mcrl2_args=\"--rewriter=jittyc\";\n#else\nstatic char const* mcrl2_args=\"--rewriter=jitty\";\n#endif\n\nstruct state_cb\n{\n    typedef int *state_vector;\n    typedef int *label_vector;\n    TransitionCB& cb;\n    void* ctx;\n    int& count;\n\n    state_cb (TransitionCB& cb_, void *ctx_, int& count_)\n        : cb(cb_), ctx(ctx_), count(count_)\n    {}\n\n    void operator()(state_vector const& next_state, label_vector const& edge_labels, int group = -1)\n    {\n        transition_info_t ti = { edge_labels, group };\n        cb (ctx, &ti, next_state);\n        ++count;\n    }\n};\n\nclass mcrl2_index {\npublic:\n    std::string buffer_;\n    mcrl2_index(mcrl2::lps::pins* pins, int tag)\n        : pins_(pins), tag_(tag) {}\n    mcrl2::lps::pins* get_pins() const { return pins_; }\n    int tag() const { return tag_; }\nprotected:\n    mcrl2::lps::pins* pins_;\n    \/\/ crucially relies on that tag == typeno, although they\n    \/\/ are created separately\n    int tag_;\n};\n\nextern \"C\" {\n\nstatic void *\nmcrl2_newmap (void *ctx)\n{\n    static int tag = 0; \/\/ XXX typemap\n    return (void*)new mcrl2_index(reinterpret_cast<mcrl2::lps::pins*>(ctx), tag++);\n}\n\nstatic int\nmcrl2_chunk2int (void *map_, void *chunk, int len)\n{\n    mcrl2_index *map = reinterpret_cast<mcrl2_index*>(map_);\n    mcrl2::lps::pins& pins = *map->get_pins();\n    return pins.data_type(map->tag()).deserialize(std::string((char*)chunk,len));\n}\n\nstatic const void *\nmcrl2_int2chunk (void *map_, int idx, int *len)\n{\n    mcrl2_index *map = reinterpret_cast<mcrl2_index*>(map_);\n    mcrl2::lps::pins& pins = *map->get_pins();\n    map->buffer_ = pins.data_type(map->tag()).print(idx); \/\/ XXX serialize\n    *len = map->buffer_.length();\n    return map->buffer_.data(); \/\/ XXX life-time\n}\n\nstatic int\nmcrl2_chunk_count(void *map_)\n{\n    mcrl2_index *map = reinterpret_cast<mcrl2_index*>(map_);\n    return map->get_pins()->data_type(map->tag()).size();\n}\n\nstatic void\noverride_chunk_methods(model_t model, mcrl2::lps::pins* pins)\n{\n    Warning(info, \"This mcrl2 language module does not work with the MPI backend.\");\n    GBsetChunkMethods(model, mcrl2_newmap, pins,\n                      (int2chunk_t)mcrl2_int2chunk,\n                      mcrl2_chunk2int, mcrl2_chunk_count);\n}\n\nstatic void\nmcrl2_popt (poptContext con, enum poptCallbackReason reason,\n            const struct poptOption *opt, const char *arg, void *data)\n{\n    (void)con;(void)opt;(void)arg;(void)data;\n    switch (reason) {\n    case POPT_CALLBACK_REASON_PRE:\n        break;\n    case POPT_CALLBACK_REASON_POST: {\n        Warning(debug,\"mcrl2 init\");\n        int argc;\n        char **argv;\n        RTparseOptions (mcrl2_args,&argc,&argv);\n        Warning (debug,\"ATerm init\");\n        MCRL2_ATERMPP_INIT(argc, argv);\n        char *rewriter = NULL;\n        struct poptOption options[] = {\n            { \"rewriter\", 0 , POPT_ARG_STRING , &rewriter , 0 , \"select rewriter\" , NULL },\n            POPT_TABLEEND\n        };\n        Warning (debug,\"options\");\n        poptContext optCon = poptGetContext(NULL, argc,const_cast<const char**>(argv), options, 0);\n        int res = poptGetNextOpt(optCon);\n        if (res != -1 || poptPeekArg(optCon)!=NULL) {\n            Fatal(1,error,\"Bad mcrl2 options: %s\",mcrl2_args);\n        }\n        poptFreeContext(optCon);\n        if (rewriter) {\n            mcrl2_rewriter_strategy = std::string(rewriter);\n        } else {\n            Fatal(1,error,\"unrecognized rewriter: %s (jitty, jittyc, inner and innerc supported)\",rewriter);\n        }\n        GBregisterLoader(\"lps\",MCRL2loadGreyboxModel);\n        Warning(info,\"mCRL2 language module initialized\");\n        return;\n    }\n    case POPT_CALLBACK_REASON_OPTION:\n        break;\n    }\n    Fatal(1,error,\"unexpected call to mcrl2_popt\");\n}\n\nstruct poptOption mcrl2_options[] = {\n    { NULL, 0 , POPT_ARG_CALLBACK|POPT_CBFLAG_POST|POPT_CBFLAG_SKIPOPTION , (void*)mcrl2_popt , 0 , NULL , NULL},\n    { \"mcrl2\" , 0 , POPT_ARG_STRING|POPT_ARGFLAG_SHOW_DEFAULT , &mcrl2_args , 0, \"Pass options to the mcrl2 library.\",\"<mcrl2 options>\" },\n    POPT_TABLEEND\n};\n\nvoid\nMCRL2initGreybox (int argc,char *argv[],void* stack_bottom)\n{\n    Warning(debug,\"ATerm init\");\n    MCRL2_ATERMPP_INIT(argc, argv);\n    (void)stack_bottom;\n}\n\nstatic int\nMCRL2getTransitionsLong (model_t m, int group, int *src, TransitionCB cb, void *ctx)\n{\n    mcrl2::lps::pins *pins = (mcrl2::lps::pins *)GBgetContext (m);\n    int count = 0;\n    int dst[pins->process_parameter_count()];\n    int labels[pins->edge_label_count()];\n    state_cb f(cb, ctx, count);\n    pins->next_state_long(src, group, f, dst, labels);\n    return count;\n}\n\nstatic int\nMCRL2getTransitionsAll (model_t m, int* src, TransitionCB cb, void *ctx)\n{\n    mcrl2::lps::pins *pins = (mcrl2::lps::pins *)GBgetContext (m);\n    int count = 0;\n    int dst[pins->process_parameter_count()];\n    int labels[pins->edge_label_count()];\n    state_cb f(cb, ctx, count);\n    pins->next_state_all(src, f, dst, labels);\n    return count;\n}\n\nvoid\nMCRL2loadGreyboxModel (model_t m, const char *model_name)\n{\n    Warning(info, \"mCRL2 rewriter: %s\", mcrl2_rewriter_strategy.c_str());\n    mcrl2::lps::pins *pins = new mcrl2::lps::pins(std::string(model_name), mcrl2_rewriter_strategy);\n    GBsetContext(m,pins);\n\n    lts_type_t ltstype = lts_type_create();\n    lts_type_set_state_length (ltstype, pins->process_parameter_count());\n\n    \/\/ create ltsmin type for each mcrl2-provided type\n    for(size_t i = 0; i < pins->datatype_count(); ++i) {\n        lts_type_add_type(ltstype, pins->data_type(i).name().c_str(), NULL);\n    }\n\n    \/\/ process parameters\n    for(size_t i = 0; i < pins->process_parameter_count(); ++i) {\n        lts_type_set_state_name(ltstype, i, pins->process_parameter_name(i).c_str());\n        lts_type_set_state_type(ltstype, i, pins->data_type(pins->process_parameter_type(i)).name().c_str());\n    }\n\n    \/\/ edge labels\n    lts_type_set_edge_label_count(ltstype, pins->edge_label_count());\n    for (size_t i = 0; i < pins->edge_label_count(); ++i) {\n        lts_type_set_edge_label_name(ltstype, i, pins->edge_label_name(i).c_str());\n        lts_type_set_edge_label_type(ltstype, i, pins->data_type(pins->edge_label_type(i)).name().c_str());\n    }\n\n    override_chunk_methods(m, pins);\n    GBsetLTStype(m,ltstype);\n\n    int s0[pins->process_parameter_count()];\n    mcrl2::lps::pins::ltsmin_state_type p_s0 = s0;\n    pins->get_initial_state(p_s0);\n    GBsetInitialState(m, s0);\n\n    matrix_t *p_dm_info       = reinterpret_cast<matrix_t *>(RTmalloc(sizeof *p_dm_info));\n    matrix_t *p_dm_read_info  = reinterpret_cast<matrix_t *>(RTmalloc(sizeof *p_dm_read_info));\n    matrix_t *p_dm_write_info = reinterpret_cast<matrix_t *>(RTmalloc(sizeof *p_dm_write_info));\n    dm_create(p_dm_info, pins->group_count(),\n              pins->process_parameter_count());\n    dm_create(p_dm_read_info, pins->group_count(),\n              pins->process_parameter_count());\n    dm_create(p_dm_write_info, pins->group_count(),\n              pins->process_parameter_count());\n\n    for (int i = 0; i <dm_nrows (p_dm_info); i++) {\n        std::vector<size_t> const& vec_r = pins->read_group(i);\n        for (size_t j=0; j <vec_r.size(); j++) {\n            dm_set (p_dm_info, i, vec_r[j]);\n            dm_set (p_dm_read_info, i, vec_r[j]);\n        }\n        std::vector<size_t> const& vec_w = pins->write_group(i);\n        for (size_t j=0; j <vec_w.size(); j++) {\n            dm_set (p_dm_info, i, vec_w[j]);\n            dm_set (p_dm_write_info, i, vec_w[j]);\n        }\n    }\n\n    GBsetDMInfo (m, p_dm_info);\n    GBsetDMInfoRead (m, p_dm_read_info);\n    GBsetDMInfoWrite (m, p_dm_write_info);\n    matrix_t *p_sl_info = reinterpret_cast<matrix_t *>(RTmalloc(sizeof *p_sl_info));\n    dm_create (p_sl_info, 0, pins->process_parameter_count());\n    GBsetStateLabelInfo (m, p_sl_info);\n    GBsetNextStateLong (m, MCRL2getTransitionsLong);\n    GBsetNextStateAll (m, MCRL2getTransitionsAll);\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- tsan_rtl_mutex.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 (TSan), a race detector.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"tsan_rtl.h\"\n#include \"tsan_flags.h\"\n#include \"tsan_sync.h\"\n#include \"tsan_report.h\"\n#include \"tsan_symbolize.h\"\n#include \"tsan_platform.h\"\n\nnamespace __tsan {\n\nvoid MutexCreate(ThreadState *thr, uptr pc, uptr addr,\n                 bool rw, bool recursive, bool linker_init) {\n  Context *ctx = CTX();\n  CHECK_GT(thr->in_rtl, 0);\n  DPrintf(\"#%d: MutexCreate %zx\\n\", thr->tid, addr);\n  StatInc(thr, StatMutexCreate);\n  if (!linker_init && IsAppMem(addr)) {\n    CHECK(!thr->is_freeing);\n    thr->is_freeing = true;\n    MemoryWrite(thr, pc, addr, kSizeLog1);\n    thr->is_freeing = false;\n  }\n  SyncVar *s = ctx->synctab.GetOrCreateAndLock(thr, pc, addr, true);\n  s->is_rw = rw;\n  s->is_recursive = recursive;\n  s->is_linker_init = linker_init;\n  s->mtx.Unlock();\n}\n\nvoid MutexDestroy(ThreadState *thr, uptr pc, uptr addr) {\n  Context *ctx = CTX();\n  CHECK_GT(thr->in_rtl, 0);\n  DPrintf(\"#%d: MutexDestroy %zx\\n\", thr->tid, addr);\n  StatInc(thr, StatMutexDestroy);\n#ifndef TSAN_GO\n  \/\/ Global mutexes not marked as LINKER_INITIALIZED\n  \/\/ cause tons of not interesting reports, so just ignore it.\n  if (IsGlobalVar(addr))\n    return;\n#endif\n  SyncVar *s = ctx->synctab.GetAndRemove(thr, pc, addr);\n  if (s == 0)\n    return;\n  if (IsAppMem(addr)) {\n    CHECK(!thr->is_freeing);\n    thr->is_freeing = true;\n    MemoryWrite(thr, pc, addr, kSizeLog1);\n    thr->is_freeing = false;\n  }\n  if (flags()->report_destroy_locked\n      && s->owner_tid != SyncVar::kInvalidTid\n      && !s->is_broken) {\n    s->is_broken = true;\n    ThreadRegistryLock l(ctx->thread_registry);\n    ScopedReport rep(ReportTypeMutexDestroyLocked);\n    rep.AddMutex(s);\n    StackTrace trace;\n    trace.ObtainCurrent(thr, pc);\n    rep.AddStack(&trace);\n    FastState last(s->last_lock);\n    RestoreStack(last.tid(), last.epoch(), &trace, 0);\n    rep.AddStack(&trace);\n    rep.AddLocation(s->addr, 1);\n    OutputReport(ctx, rep);\n  }\n  thr->mset.Remove(s->GetId());\n  DestroyAndFree(s);\n}\n\nvoid MutexLock(ThreadState *thr, uptr pc, uptr addr, int rec) {\n  CHECK_GT(thr->in_rtl, 0);\n  DPrintf(\"#%d: MutexLock %zx rec=%d\\n\", thr->tid, addr, rec);\n  CHECK_GT(rec, 0);\n  if (IsAppMem(addr))\n    MemoryReadAtomic(thr, pc, addr, kSizeLog1);\n  SyncVar *s = CTX()->synctab.GetOrCreateAndLock(thr, pc, addr, true);\n  thr->fast_state.IncrementEpoch();\n  TraceAddEvent(thr, thr->fast_state, EventTypeLock, s->GetId());\n  if (s->owner_tid == SyncVar::kInvalidTid) {\n    CHECK_EQ(s->recursion, 0);\n    s->owner_tid = thr->tid;\n    s->last_lock = thr->fast_state.raw();\n  } else if (s->owner_tid == thr->tid) {\n    CHECK_GT(s->recursion, 0);\n  } else {\n    Printf(\"ThreadSanitizer WARNING: double lock\\n\");\n    PrintCurrentStack(thr, pc);\n  }\n  if (s->recursion == 0) {\n    StatInc(thr, StatMutexLock);\n    thr->clock.set(thr->tid, thr->fast_state.epoch());\n    thr->clock.acquire(&s->clock);\n    StatInc(thr, StatSyncAcquire);\n    thr->clock.acquire(&s->read_clock);\n    StatInc(thr, StatSyncAcquire);\n  } else if (!s->is_recursive) {\n    StatInc(thr, StatMutexRecLock);\n  }\n  s->recursion += rec;\n  thr->mset.Add(s->GetId(), true, thr->fast_state.epoch());\n  s->mtx.Unlock();\n}\n\nint MutexUnlock(ThreadState *thr, uptr pc, uptr addr, bool all) {\n  CHECK_GT(thr->in_rtl, 0);\n  DPrintf(\"#%d: MutexUnlock %zx all=%d\\n\", thr->tid, addr, all);\n  if (IsAppMem(addr))\n    MemoryReadAtomic(thr, pc, addr, kSizeLog1);\n  SyncVar *s = CTX()->synctab.GetOrCreateAndLock(thr, pc, addr, true);\n  thr->fast_state.IncrementEpoch();\n  TraceAddEvent(thr, thr->fast_state, EventTypeUnlock, s->GetId());\n  int rec = 0;\n  if (s->recursion == 0) {\n    if (!s->is_broken) {\n      s->is_broken = true;\n      Printf(\"ThreadSanitizer WARNING: unlock of unlocked mutex\\n\");\n      PrintCurrentStack(thr, pc);\n    }\n  } else if (s->owner_tid != thr->tid) {\n    if (!s->is_broken) {\n      s->is_broken = true;\n      Printf(\"ThreadSanitizer WARNING: mutex unlock by another thread\\n\");\n      PrintCurrentStack(thr, pc);\n    }\n  } else {\n    rec = all ? s->recursion : 1;\n    s->recursion -= rec;\n    if (s->recursion == 0) {\n      StatInc(thr, StatMutexUnlock);\n      s->owner_tid = SyncVar::kInvalidTid;\n      thr->clock.set(thr->tid, thr->fast_state.epoch());\n      thr->fast_synch_epoch = thr->fast_state.epoch();\n      thr->clock.ReleaseStore(&s->clock);\n      StatInc(thr, StatSyncRelease);\n    } else {\n      StatInc(thr, StatMutexRecUnlock);\n    }\n  }\n  thr->mset.Del(s->GetId(), true);\n  s->mtx.Unlock();\n  return rec;\n}\n\nvoid MutexReadLock(ThreadState *thr, uptr pc, uptr addr) {\n  CHECK_GT(thr->in_rtl, 0);\n  DPrintf(\"#%d: MutexReadLock %zx\\n\", thr->tid, addr);\n  StatInc(thr, StatMutexReadLock);\n  if (IsAppMem(addr))\n    MemoryReadAtomic(thr, pc, addr, kSizeLog1);\n  SyncVar *s = CTX()->synctab.GetOrCreateAndLock(thr, pc, addr, false);\n  thr->fast_state.IncrementEpoch();\n  TraceAddEvent(thr, thr->fast_state, EventTypeRLock, s->GetId());\n  if (s->owner_tid != SyncVar::kInvalidTid) {\n    Printf(\"ThreadSanitizer WARNING: read lock of a write locked mutex\\n\");\n    PrintCurrentStack(thr, pc);\n  }\n  thr->clock.set(thr->tid, thr->fast_state.epoch());\n  thr->clock.acquire(&s->clock);\n  s->last_lock = thr->fast_state.raw();\n  StatInc(thr, StatSyncAcquire);\n  thr->mset.Add(s->GetId(), false, thr->fast_state.epoch());\n  s->mtx.ReadUnlock();\n}\n\nvoid MutexReadUnlock(ThreadState *thr, uptr pc, uptr addr) {\n  CHECK_GT(thr->in_rtl, 0);\n  DPrintf(\"#%d: MutexReadUnlock %zx\\n\", thr->tid, addr);\n  StatInc(thr, StatMutexReadUnlock);\n  if (IsAppMem(addr))\n    MemoryReadAtomic(thr, pc, addr, kSizeLog1);\n  SyncVar *s = CTX()->synctab.GetOrCreateAndLock(thr, pc, addr, true);\n  thr->fast_state.IncrementEpoch();\n  TraceAddEvent(thr, thr->fast_state, EventTypeRUnlock, s->GetId());\n  if (s->owner_tid != SyncVar::kInvalidTid) {\n    Printf(\"ThreadSanitizer WARNING: read unlock of a write \"\n               \"locked mutex\\n\");\n    PrintCurrentStack(thr, pc);\n  }\n  thr->clock.set(thr->tid, thr->fast_state.epoch());\n  thr->fast_synch_epoch = thr->fast_state.epoch();\n  thr->clock.release(&s->read_clock);\n  StatInc(thr, StatSyncRelease);\n  s->mtx.Unlock();\n  thr->mset.Del(s->GetId(), false);\n}\n\nvoid MutexReadOrWriteUnlock(ThreadState *thr, uptr pc, uptr addr) {\n  CHECK_GT(thr->in_rtl, 0);\n  DPrintf(\"#%d: MutexReadOrWriteUnlock %zx\\n\", thr->tid, addr);\n  if (IsAppMem(addr))\n    MemoryReadAtomic(thr, pc, addr, kSizeLog1);\n  SyncVar *s = CTX()->synctab.GetOrCreateAndLock(thr, pc, addr, true);\n  bool write = true;\n  if (s->owner_tid == SyncVar::kInvalidTid) {\n    \/\/ Seems to be read unlock.\n    write = false;\n    StatInc(thr, StatMutexReadUnlock);\n    thr->fast_state.IncrementEpoch();\n    TraceAddEvent(thr, thr->fast_state, EventTypeRUnlock, s->GetId());\n    thr->clock.set(thr->tid, thr->fast_state.epoch());\n    thr->fast_synch_epoch = thr->fast_state.epoch();\n    thr->clock.release(&s->read_clock);\n    StatInc(thr, StatSyncRelease);\n  } else if (s->owner_tid == thr->tid) {\n    \/\/ Seems to be write unlock.\n    thr->fast_state.IncrementEpoch();\n    TraceAddEvent(thr, thr->fast_state, EventTypeUnlock, s->GetId());\n    CHECK_GT(s->recursion, 0);\n    s->recursion--;\n    if (s->recursion == 0) {\n      StatInc(thr, StatMutexUnlock);\n      s->owner_tid = SyncVar::kInvalidTid;\n      \/\/ FIXME: Refactor me, plz.\n      \/\/ The sequence of events is quite tricky and doubled in several places.\n      \/\/ First, it's a bug to increment the epoch w\/o writing to the trace.\n      \/\/ Then, the acquire\/release logic can be factored out as well.\n      thr->clock.set(thr->tid, thr->fast_state.epoch());\n      thr->fast_synch_epoch = thr->fast_state.epoch();\n      thr->clock.ReleaseStore(&s->clock);\n      StatInc(thr, StatSyncRelease);\n    } else {\n      StatInc(thr, StatMutexRecUnlock);\n    }\n  } else if (!s->is_broken) {\n    s->is_broken = true;\n    Printf(\"ThreadSanitizer WARNING: mutex unlock by another thread\\n\");\n    PrintCurrentStack(thr, pc);\n  }\n  thr->mset.Del(s->GetId(), write);\n  s->mtx.Unlock();\n}\n\nvoid Acquire(ThreadState *thr, uptr pc, uptr addr) {\n  CHECK_GT(thr->in_rtl, 0);\n  DPrintf(\"#%d: Acquire %zx\\n\", thr->tid, addr);\n  SyncVar *s = CTX()->synctab.GetOrCreateAndLock(thr, pc, addr, false);\n  thr->clock.set(thr->tid, thr->fast_state.epoch());\n  thr->clock.acquire(&s->clock);\n  StatInc(thr, StatSyncAcquire);\n  s->mtx.ReadUnlock();\n}\n\nstatic void UpdateClockCallback(ThreadContextBase *tctx_base, void *arg) {\n  ThreadState *thr = reinterpret_cast<ThreadState*>(arg);\n  ThreadContext *tctx = static_cast<ThreadContext*>(tctx_base);\n  if (tctx->status == ThreadStatusRunning)\n    thr->clock.set(tctx->tid, tctx->thr->fast_state.epoch());\n  else\n    thr->clock.set(tctx->tid, tctx->epoch1);\n}\n\nvoid AcquireGlobal(ThreadState *thr, uptr pc) {\n  ThreadRegistryLock l(CTX()->thread_registry);\n  CTX()->thread_registry->RunCallbackForEachThreadLocked(\n      UpdateClockCallback, thr);\n}\n\nvoid Release(ThreadState *thr, uptr pc, uptr addr) {\n  CHECK_GT(thr->in_rtl, 0);\n  DPrintf(\"#%d: Release %zx\\n\", thr->tid, addr);\n  SyncVar *s = CTX()->synctab.GetOrCreateAndLock(thr, pc, addr, true);\n  thr->clock.set(thr->tid, thr->fast_state.epoch());\n  thr->clock.release(&s->clock);\n  StatInc(thr, StatSyncRelease);\n  s->mtx.Unlock();\n}\n\nvoid ReleaseStore(ThreadState *thr, uptr pc, uptr addr) {\n  CHECK_GT(thr->in_rtl, 0);\n  DPrintf(\"#%d: ReleaseStore %zx\\n\", thr->tid, addr);\n  SyncVar *s = CTX()->synctab.GetOrCreateAndLock(thr, pc, addr, true);\n  thr->clock.set(thr->tid, thr->fast_state.epoch());\n  thr->clock.ReleaseStore(&s->clock);\n  StatInc(thr, StatSyncRelease);\n  s->mtx.Unlock();\n}\n\n#ifndef TSAN_GO\nstatic void UpdateSleepClockCallback(ThreadContextBase *tctx_base, void *arg) {\n  ThreadState *thr = reinterpret_cast<ThreadState*>(arg);\n  ThreadContext *tctx = static_cast<ThreadContext*>(tctx_base);\n  if (tctx->status == ThreadStatusRunning)\n    thr->last_sleep_clock.set(tctx->tid, tctx->thr->fast_state.epoch());\n  else\n    thr->last_sleep_clock.set(tctx->tid, tctx->epoch1);\n}\n\nvoid AfterSleep(ThreadState *thr, uptr pc) {\n  thr->last_sleep_stack_id = CurrentStackId(thr, pc);\n  ThreadRegistryLock l(CTX()->thread_registry);\n  CTX()->thread_registry->RunCallbackForEachThreadLocked(\n      UpdateSleepClockCallback, thr);\n}\n#endif\n\n}  \/\/ namespace __tsan\n<commit_msg>tsan: improve diagnostics for incorrect usages of mutexes<commit_after>\/\/===-- tsan_rtl_mutex.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 (TSan), a race detector.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"tsan_rtl.h\"\n#include \"tsan_flags.h\"\n#include \"tsan_sync.h\"\n#include \"tsan_report.h\"\n#include \"tsan_symbolize.h\"\n#include \"tsan_platform.h\"\n\nnamespace __tsan {\n\nvoid MutexCreate(ThreadState *thr, uptr pc, uptr addr,\n                 bool rw, bool recursive, bool linker_init) {\n  Context *ctx = CTX();\n  CHECK_GT(thr->in_rtl, 0);\n  DPrintf(\"#%d: MutexCreate %zx\\n\", thr->tid, addr);\n  StatInc(thr, StatMutexCreate);\n  if (!linker_init && IsAppMem(addr)) {\n    CHECK(!thr->is_freeing);\n    thr->is_freeing = true;\n    MemoryWrite(thr, pc, addr, kSizeLog1);\n    thr->is_freeing = false;\n  }\n  SyncVar *s = ctx->synctab.GetOrCreateAndLock(thr, pc, addr, true);\n  s->is_rw = rw;\n  s->is_recursive = recursive;\n  s->is_linker_init = linker_init;\n  s->mtx.Unlock();\n}\n\nvoid MutexDestroy(ThreadState *thr, uptr pc, uptr addr) {\n  Context *ctx = CTX();\n  CHECK_GT(thr->in_rtl, 0);\n  DPrintf(\"#%d: MutexDestroy %zx\\n\", thr->tid, addr);\n  StatInc(thr, StatMutexDestroy);\n#ifndef TSAN_GO\n  \/\/ Global mutexes not marked as LINKER_INITIALIZED\n  \/\/ cause tons of not interesting reports, so just ignore it.\n  if (IsGlobalVar(addr))\n    return;\n#endif\n  SyncVar *s = ctx->synctab.GetAndRemove(thr, pc, addr);\n  if (s == 0)\n    return;\n  if (IsAppMem(addr)) {\n    CHECK(!thr->is_freeing);\n    thr->is_freeing = true;\n    MemoryWrite(thr, pc, addr, kSizeLog1);\n    thr->is_freeing = false;\n  }\n  if (flags()->report_destroy_locked\n      && s->owner_tid != SyncVar::kInvalidTid\n      && !s->is_broken) {\n    s->is_broken = true;\n    ThreadRegistryLock l(ctx->thread_registry);\n    ScopedReport rep(ReportTypeMutexDestroyLocked);\n    rep.AddMutex(s);\n    StackTrace trace;\n    trace.ObtainCurrent(thr, pc);\n    rep.AddStack(&trace);\n    FastState last(s->last_lock);\n    RestoreStack(last.tid(), last.epoch(), &trace, 0);\n    rep.AddStack(&trace);\n    rep.AddLocation(s->addr, 1);\n    OutputReport(ctx, rep);\n  }\n  thr->mset.Remove(s->GetId());\n  DestroyAndFree(s);\n}\n\nvoid MutexLock(ThreadState *thr, uptr pc, uptr addr, int rec) {\n  CHECK_GT(thr->in_rtl, 0);\n  DPrintf(\"#%d: MutexLock %zx rec=%d\\n\", thr->tid, addr, rec);\n  CHECK_GT(rec, 0);\n  if (IsAppMem(addr))\n    MemoryReadAtomic(thr, pc, addr, kSizeLog1);\n  SyncVar *s = CTX()->synctab.GetOrCreateAndLock(thr, pc, addr, true);\n  thr->fast_state.IncrementEpoch();\n  TraceAddEvent(thr, thr->fast_state, EventTypeLock, s->GetId());\n  if (s->owner_tid == SyncVar::kInvalidTid) {\n    CHECK_EQ(s->recursion, 0);\n    s->owner_tid = thr->tid;\n    s->last_lock = thr->fast_state.raw();\n  } else if (s->owner_tid == thr->tid) {\n    CHECK_GT(s->recursion, 0);\n  } else {\n    Printf(\"ThreadSanitizer WARNING: double lock of mutex %p\\n\", addr);\n    PrintCurrentStack(thr, pc);\n  }\n  if (s->recursion == 0) {\n    StatInc(thr, StatMutexLock);\n    thr->clock.set(thr->tid, thr->fast_state.epoch());\n    thr->clock.acquire(&s->clock);\n    StatInc(thr, StatSyncAcquire);\n    thr->clock.acquire(&s->read_clock);\n    StatInc(thr, StatSyncAcquire);\n  } else if (!s->is_recursive) {\n    StatInc(thr, StatMutexRecLock);\n  }\n  s->recursion += rec;\n  thr->mset.Add(s->GetId(), true, thr->fast_state.epoch());\n  s->mtx.Unlock();\n}\n\nint MutexUnlock(ThreadState *thr, uptr pc, uptr addr, bool all) {\n  CHECK_GT(thr->in_rtl, 0);\n  DPrintf(\"#%d: MutexUnlock %zx all=%d\\n\", thr->tid, addr, all);\n  if (IsAppMem(addr))\n    MemoryReadAtomic(thr, pc, addr, kSizeLog1);\n  SyncVar *s = CTX()->synctab.GetOrCreateAndLock(thr, pc, addr, true);\n  thr->fast_state.IncrementEpoch();\n  TraceAddEvent(thr, thr->fast_state, EventTypeUnlock, s->GetId());\n  int rec = 0;\n  if (s->recursion == 0) {\n    if (!s->is_broken) {\n      s->is_broken = true;\n      Printf(\"ThreadSanitizer WARNING: unlock of unlocked mutex %p\\n\", addr);\n      PrintCurrentStack(thr, pc);\n    }\n  } else if (s->owner_tid != thr->tid) {\n    if (!s->is_broken) {\n      s->is_broken = true;\n      Printf(\"ThreadSanitizer WARNING: mutex %p is unlocked by wrong thread\\n\",\n             addr);\n      PrintCurrentStack(thr, pc);\n    }\n  } else {\n    rec = all ? s->recursion : 1;\n    s->recursion -= rec;\n    if (s->recursion == 0) {\n      StatInc(thr, StatMutexUnlock);\n      s->owner_tid = SyncVar::kInvalidTid;\n      thr->clock.set(thr->tid, thr->fast_state.epoch());\n      thr->fast_synch_epoch = thr->fast_state.epoch();\n      thr->clock.ReleaseStore(&s->clock);\n      StatInc(thr, StatSyncRelease);\n    } else {\n      StatInc(thr, StatMutexRecUnlock);\n    }\n  }\n  thr->mset.Del(s->GetId(), true);\n  s->mtx.Unlock();\n  return rec;\n}\n\nvoid MutexReadLock(ThreadState *thr, uptr pc, uptr addr) {\n  CHECK_GT(thr->in_rtl, 0);\n  DPrintf(\"#%d: MutexReadLock %zx\\n\", thr->tid, addr);\n  StatInc(thr, StatMutexReadLock);\n  if (IsAppMem(addr))\n    MemoryReadAtomic(thr, pc, addr, kSizeLog1);\n  SyncVar *s = CTX()->synctab.GetOrCreateAndLock(thr, pc, addr, false);\n  thr->fast_state.IncrementEpoch();\n  TraceAddEvent(thr, thr->fast_state, EventTypeRLock, s->GetId());\n  if (s->owner_tid != SyncVar::kInvalidTid) {\n    Printf(\"ThreadSanitizer WARNING: read lock of a write locked mutex %p\\n\",\n           addr);\n    PrintCurrentStack(thr, pc);\n  }\n  thr->clock.set(thr->tid, thr->fast_state.epoch());\n  thr->clock.acquire(&s->clock);\n  s->last_lock = thr->fast_state.raw();\n  StatInc(thr, StatSyncAcquire);\n  thr->mset.Add(s->GetId(), false, thr->fast_state.epoch());\n  s->mtx.ReadUnlock();\n}\n\nvoid MutexReadUnlock(ThreadState *thr, uptr pc, uptr addr) {\n  CHECK_GT(thr->in_rtl, 0);\n  DPrintf(\"#%d: MutexReadUnlock %zx\\n\", thr->tid, addr);\n  StatInc(thr, StatMutexReadUnlock);\n  if (IsAppMem(addr))\n    MemoryReadAtomic(thr, pc, addr, kSizeLog1);\n  SyncVar *s = CTX()->synctab.GetOrCreateAndLock(thr, pc, addr, true);\n  thr->fast_state.IncrementEpoch();\n  TraceAddEvent(thr, thr->fast_state, EventTypeRUnlock, s->GetId());\n  if (s->owner_tid != SyncVar::kInvalidTid) {\n    Printf(\"ThreadSanitizer WARNING: read unlock of a write locked mutex %p\\n\",\n           addr);\n    PrintCurrentStack(thr, pc);\n  }\n  thr->clock.set(thr->tid, thr->fast_state.epoch());\n  thr->fast_synch_epoch = thr->fast_state.epoch();\n  thr->clock.release(&s->read_clock);\n  StatInc(thr, StatSyncRelease);\n  s->mtx.Unlock();\n  thr->mset.Del(s->GetId(), false);\n}\n\nvoid MutexReadOrWriteUnlock(ThreadState *thr, uptr pc, uptr addr) {\n  CHECK_GT(thr->in_rtl, 0);\n  DPrintf(\"#%d: MutexReadOrWriteUnlock %zx\\n\", thr->tid, addr);\n  if (IsAppMem(addr))\n    MemoryReadAtomic(thr, pc, addr, kSizeLog1);\n  SyncVar *s = CTX()->synctab.GetOrCreateAndLock(thr, pc, addr, true);\n  bool write = true;\n  if (s->owner_tid == SyncVar::kInvalidTid) {\n    \/\/ Seems to be read unlock.\n    write = false;\n    StatInc(thr, StatMutexReadUnlock);\n    thr->fast_state.IncrementEpoch();\n    TraceAddEvent(thr, thr->fast_state, EventTypeRUnlock, s->GetId());\n    thr->clock.set(thr->tid, thr->fast_state.epoch());\n    thr->fast_synch_epoch = thr->fast_state.epoch();\n    thr->clock.release(&s->read_clock);\n    StatInc(thr, StatSyncRelease);\n  } else if (s->owner_tid == thr->tid) {\n    \/\/ Seems to be write unlock.\n    thr->fast_state.IncrementEpoch();\n    TraceAddEvent(thr, thr->fast_state, EventTypeUnlock, s->GetId());\n    CHECK_GT(s->recursion, 0);\n    s->recursion--;\n    if (s->recursion == 0) {\n      StatInc(thr, StatMutexUnlock);\n      s->owner_tid = SyncVar::kInvalidTid;\n      \/\/ FIXME: Refactor me, plz.\n      \/\/ The sequence of events is quite tricky and doubled in several places.\n      \/\/ First, it's a bug to increment the epoch w\/o writing to the trace.\n      \/\/ Then, the acquire\/release logic can be factored out as well.\n      thr->clock.set(thr->tid, thr->fast_state.epoch());\n      thr->fast_synch_epoch = thr->fast_state.epoch();\n      thr->clock.ReleaseStore(&s->clock);\n      StatInc(thr, StatSyncRelease);\n    } else {\n      StatInc(thr, StatMutexRecUnlock);\n    }\n  } else if (!s->is_broken) {\n    s->is_broken = true;\n    Printf(\"ThreadSanitizer WARNING: mutex %p is unlock by wrong thread\\n\",\n           addr);\n    PrintCurrentStack(thr, pc);\n  }\n  thr->mset.Del(s->GetId(), write);\n  s->mtx.Unlock();\n}\n\nvoid Acquire(ThreadState *thr, uptr pc, uptr addr) {\n  CHECK_GT(thr->in_rtl, 0);\n  DPrintf(\"#%d: Acquire %zx\\n\", thr->tid, addr);\n  SyncVar *s = CTX()->synctab.GetOrCreateAndLock(thr, pc, addr, false);\n  thr->clock.set(thr->tid, thr->fast_state.epoch());\n  thr->clock.acquire(&s->clock);\n  StatInc(thr, StatSyncAcquire);\n  s->mtx.ReadUnlock();\n}\n\nstatic void UpdateClockCallback(ThreadContextBase *tctx_base, void *arg) {\n  ThreadState *thr = reinterpret_cast<ThreadState*>(arg);\n  ThreadContext *tctx = static_cast<ThreadContext*>(tctx_base);\n  if (tctx->status == ThreadStatusRunning)\n    thr->clock.set(tctx->tid, tctx->thr->fast_state.epoch());\n  else\n    thr->clock.set(tctx->tid, tctx->epoch1);\n}\n\nvoid AcquireGlobal(ThreadState *thr, uptr pc) {\n  ThreadRegistryLock l(CTX()->thread_registry);\n  CTX()->thread_registry->RunCallbackForEachThreadLocked(\n      UpdateClockCallback, thr);\n}\n\nvoid Release(ThreadState *thr, uptr pc, uptr addr) {\n  CHECK_GT(thr->in_rtl, 0);\n  DPrintf(\"#%d: Release %zx\\n\", thr->tid, addr);\n  SyncVar *s = CTX()->synctab.GetOrCreateAndLock(thr, pc, addr, true);\n  thr->clock.set(thr->tid, thr->fast_state.epoch());\n  thr->clock.release(&s->clock);\n  StatInc(thr, StatSyncRelease);\n  s->mtx.Unlock();\n}\n\nvoid ReleaseStore(ThreadState *thr, uptr pc, uptr addr) {\n  CHECK_GT(thr->in_rtl, 0);\n  DPrintf(\"#%d: ReleaseStore %zx\\n\", thr->tid, addr);\n  SyncVar *s = CTX()->synctab.GetOrCreateAndLock(thr, pc, addr, true);\n  thr->clock.set(thr->tid, thr->fast_state.epoch());\n  thr->clock.ReleaseStore(&s->clock);\n  StatInc(thr, StatSyncRelease);\n  s->mtx.Unlock();\n}\n\n#ifndef TSAN_GO\nstatic void UpdateSleepClockCallback(ThreadContextBase *tctx_base, void *arg) {\n  ThreadState *thr = reinterpret_cast<ThreadState*>(arg);\n  ThreadContext *tctx = static_cast<ThreadContext*>(tctx_base);\n  if (tctx->status == ThreadStatusRunning)\n    thr->last_sleep_clock.set(tctx->tid, tctx->thr->fast_state.epoch());\n  else\n    thr->last_sleep_clock.set(tctx->tid, tctx->epoch1);\n}\n\nvoid AfterSleep(ThreadState *thr, uptr pc) {\n  thr->last_sleep_stack_id = CurrentStackId(thr, pc);\n  ThreadRegistryLock l(CTX()->thread_registry);\n  CTX()->thread_registry->RunCallbackForEachThreadLocked(\n      UpdateSleepClockCallback, thr);\n}\n#endif\n\n}  \/\/ namespace __tsan\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2011, Peter Thorson. All 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 WebSocket++ Project nor the\n *       names of its contributors may be used to endorse or promote products\n *       derived from this software without specific prior written permission.\n * \n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" \n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE \n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE \n * ARE DISCLAIMED. IN NO EVENT SHALL PETER THORSON BE LIABLE FOR ANY\n * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n * \n *\/\n\n#include \"data.hpp\"\n\n#include \"..\/processors\/processor.hpp\"\n#include \"..\/processors\/hybi_header.hpp\"\n\nusing websocketpp::message::data;\n\ndata::data(data::pool_ptr p, size_t s) : m_prepared(false),m_index(s),m_ref_count(0),m_pool(p),m_live(false) {\n    m_payload.reserve(PAYLOAD_SIZE_INIT);\n}\n    \nwebsocketpp::frame::opcode::value data::get_opcode() const {\n    return m_opcode;\n}\n\t\nconst std::string& data::get_payload() const {\n    return m_payload;\n}\nconst std::string& data::get_header() const {\n    return m_header;\n}\n\t\nuint64_t data::process_payload(std::istream& input,uint64_t size) {\n    unsigned char c;\n    const uint64_t new_size = m_payload.size() + size;\n    uint64_t i;\n    \n    if (new_size > PAYLOAD_SIZE_MAX) {\n        throw processor::exception(\"Message too big\",processor::error::MESSAGE_TOO_BIG);\n    }\n    \n    if (new_size > m_payload.capacity()) {\n        m_payload.reserve(std::max(new_size,static_cast<uint64_t>(2*m_payload.capacity())));\n    }\n    \n    for (i = 0; i < size; ++i) {\n        if (input.good()) {\n            c = input.get();\n        } else if (input.eof()) {\n            break;\n        } else {\n            \/\/ istream read error? throw?\n            throw processor::exception(\"istream read error\",\n                                       processor::error::FATAL_ERROR);\n        }\n        if (input.good()) {\n            process_character(c);\n        } else if (input.eof()) {\n            break;\n        } else {\n            \/\/ istream read error? throw?\n            throw processor::exception(\"istream read error\",\n                                       processor::error::FATAL_ERROR);\n        }\n    }\n    \n    \/\/ successfully read all bytes\n    return i;\n}\n\t\nvoid data::process_character(unsigned char c) {\n    if (m_masking_index >= 0) {\n        c = c ^ m_masking_key[m_masking_index];\n        m_masking_index = index_value((m_masking_index+1)%4);\n    }\n    \n    if (m_opcode == frame::opcode::TEXT && \n        !m_validator.consume(static_cast<uint32_t>((unsigned char)(c))))\n    {\n        throw processor::exception(\"Invalid UTF8 data\",processor::error::PAYLOAD_VIOLATION);\n    }\n    \n    \/\/ add c to payload \n    m_payload.push_back(c);\n}\n    \nvoid data::reset(frame::opcode::value opcode) {\n    m_opcode = opcode;\n    m_masking_index = M_NOT_MASKED; \/\/ -1 indicates do not mask\/unmask\n    m_payload.resize(0);\n    m_validator.reset();\n    m_prepared = false;\n}\n\t\t\nvoid data::complete() {\n    if (m_opcode == frame::opcode::TEXT) {\n        if (!m_validator.complete()) {\n            throw processor::exception(\"Invalid UTF8 data\",processor::error::PAYLOAD_VIOLATION);\n        }\n    }\n}\n\nvoid data::validate_payload() {\n    if (m_opcode == frame::opcode::TEXT) {\n        if (!m_validator.decode(m_payload.begin(), m_payload.end())) {\n            throw exception(\"Invalid UTF8 data\",error::PAYLOAD_VIOLATION);\n        }\n        \n        if (!m_validator.complete()) {\n            throw exception(\"Invalid UTF8 data\",error::PAYLOAD_VIOLATION);\n        }\n    }\n}\n\nvoid data::set_masking_key(int32_t key) {\n    *reinterpret_cast<int32_t*>(m_masking_key) = key;\n    \/\/ -2 indicates a masked frame whose key is zero.\n    m_masking_index = (key == 0 ? M_MASK_KEY_ZERO : M_BYTE_0); \n}\n\nvoid data::set_prepared(bool b) {\n    m_prepared = b;\n}\n\nbool data::get_prepared() const {\n    return m_prepared;\n}\n\n\/\/ This could be further optimized using methods that write directly into the\n\/\/ m_payload buffer\nvoid data::set_payload(const std::string& payload) {\n    m_payload.reserve(payload.size());\n    m_payload = payload;\n}\nvoid data::append_payload(const std::string& payload) {\n    m_payload.reserve(m_payload.size()+payload.size());\n    m_payload.append(payload);\n}\nvoid data::mask() {\n    if (m_masking_index >= 0) {\n        for (std::string::iterator it = m_payload.begin(); it != m_payload.end(); it++) {\n            (*it) = *it ^ m_masking_key[m_masking_index];\n            m_masking_index = index_value((m_masking_index+1)%4);\n        }\n    }\n}\n\nvoid data::set_header(const std::string& header) {\n    m_header = header;\n}\n\n\n\n\n\n\/\/\nvoid data::set_live() {\n    m_live = true;\n}\nsize_t data::get_index() const {\n    return m_index;\n}\n\n<commit_msg>are clear() and resize(0) different?<commit_after>\/*\n * Copyright (c) 2011, Peter Thorson. All 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 WebSocket++ Project nor the\n *       names of its contributors may be used to endorse or promote products\n *       derived from this software without specific prior written permission.\n * \n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" \n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE \n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE \n * ARE DISCLAIMED. IN NO EVENT SHALL PETER THORSON BE LIABLE FOR ANY\n * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n * \n *\/\n\n#include \"data.hpp\"\n\n#include \"..\/processors\/processor.hpp\"\n#include \"..\/processors\/hybi_header.hpp\"\n\nusing websocketpp::message::data;\n\ndata::data(data::pool_ptr p, size_t s) : m_prepared(false),m_index(s),m_ref_count(0),m_pool(p),m_live(false) {\n    m_payload.reserve(PAYLOAD_SIZE_INIT);\n}\n    \nwebsocketpp::frame::opcode::value data::get_opcode() const {\n    return m_opcode;\n}\n\t\nconst std::string& data::get_payload() const {\n    return m_payload;\n}\nconst std::string& data::get_header() const {\n    return m_header;\n}\n\t\nuint64_t data::process_payload(std::istream& input,uint64_t size) {\n    unsigned char c;\n    const uint64_t new_size = m_payload.size() + size;\n    uint64_t i;\n    \n    if (new_size > PAYLOAD_SIZE_MAX) {\n        throw processor::exception(\"Message too big\",processor::error::MESSAGE_TOO_BIG);\n    }\n    \n    if (new_size > m_payload.capacity()) {\n        m_payload.reserve(std::max(new_size,static_cast<uint64_t>(2*m_payload.capacity())));\n    }\n    \n    for (i = 0; i < size; ++i) {\n        if (input.good()) {\n            c = input.get();\n        } else if (input.eof()) {\n            break;\n        } else {\n            \/\/ istream read error? throw?\n            throw processor::exception(\"istream read error\",\n                                       processor::error::FATAL_ERROR);\n        }\n        if (input.good()) {\n            process_character(c);\n        } else if (input.eof()) {\n            break;\n        } else {\n            \/\/ istream read error? throw?\n            throw processor::exception(\"istream read error\",\n                                       processor::error::FATAL_ERROR);\n        }\n    }\n    \n    \/\/ successfully read all bytes\n    return i;\n}\n\t\nvoid data::process_character(unsigned char c) {\n    if (m_masking_index >= 0) {\n        c = c ^ m_masking_key[m_masking_index];\n        m_masking_index = index_value((m_masking_index+1)%4);\n    }\n    \n    if (m_opcode == frame::opcode::TEXT && \n        !m_validator.consume(static_cast<uint32_t>((unsigned char)(c))))\n    {\n        throw processor::exception(\"Invalid UTF8 data\",processor::error::PAYLOAD_VIOLATION);\n    }\n    \n    \/\/ add c to payload \n    m_payload.push_back(c);\n}\n    \nvoid data::reset(frame::opcode::value opcode) {\n    m_opcode = opcode;\n    m_masking_index = M_NOT_MASKED;\n    m_payload.clear();\n    m_validator.reset();\n    m_prepared = false;\n}\n\t\t\nvoid data::complete() {\n    if (m_opcode == frame::opcode::TEXT) {\n        if (!m_validator.complete()) {\n            throw processor::exception(\"Invalid UTF8 data\",processor::error::PAYLOAD_VIOLATION);\n        }\n    }\n}\n\nvoid data::validate_payload() {\n    if (m_opcode == frame::opcode::TEXT) {\n        if (!m_validator.decode(m_payload.begin(), m_payload.end())) {\n            throw exception(\"Invalid UTF8 data\",error::PAYLOAD_VIOLATION);\n        }\n        \n        if (!m_validator.complete()) {\n            throw exception(\"Invalid UTF8 data\",error::PAYLOAD_VIOLATION);\n        }\n    }\n}\n\nvoid data::set_masking_key(int32_t key) {\n    *reinterpret_cast<int32_t*>(m_masking_key) = key;\n    m_masking_index = (key == 0 ? M_MASK_KEY_ZERO : M_BYTE_0); \n}\n\nvoid data::set_prepared(bool b) {\n    m_prepared = b;\n}\n\nbool data::get_prepared() const {\n    return m_prepared;\n}\n\n\/\/ This could be further optimized using methods that write directly into the\n\/\/ m_payload buffer\nvoid data::set_payload(const std::string& payload) {\n    m_payload.reserve(payload.size());\n    m_payload = payload;\n}\nvoid data::append_payload(const std::string& payload) {\n    m_payload.reserve(m_payload.size()+payload.size());\n    m_payload.append(payload);\n}\nvoid data::mask() {\n    if (m_masking_index >= 0) {\n        for (std::string::iterator it = m_payload.begin(); it != m_payload.end(); it++) {\n            (*it) = *it ^ m_masking_key[m_masking_index];\n            m_masking_index = index_value((m_masking_index+1)%4);\n        }\n    }\n}\n\nvoid data::set_header(const std::string& header) {\n    m_header = header;\n}\n\n\n\n\n\n\/\/\nvoid data::set_live() {\n    m_live = true;\n}\nsize_t data::get_index() const {\n    return m_index;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\/\r\n\/*                                                  ###                      *\/\r\n\/*       #####          ###    ###                  ###  CREATE: 2010-05-22  *\/\r\n\/*     #######          ###    ###      [KRNL]      ###  ~~~~~~~~~~~~~~~~~~  *\/\r\n\/*    ########          ###    ###                  ###  MODIFY: XXXX-XX-XX  *\/\r\n\/*    ####  ##          ###    ###                  ###  ~~~~~~~~~~~~~~~~~~  *\/\r\n\/*   ###       ### ###  ###    ###    ####    ####  ###   ##  +-----------+  *\/\r\n\/*  ####       ######## ##########  #######  ###### ###  ###  |  A NEW C  |  *\/\r\n\/*  ###        ######## ########## ########  ###### ### ###   | FRAMEWORK |  *\/\r\n\/*  ###     ## #### ### ########## ###  ### ###     ######    |  FOR ALL  |  *\/\r\n\/*  ####   ### ###  ### ###    ### ###  ### ###     ######    | PLATFORMS |  *\/\r\n\/*  ########## ###      ###    ### ######## ####### #######   |  AND ALL  |  *\/\r\n\/*   #######   ###      ###    ### ########  ###### ###  ###  | COMPILERS |  *\/\r\n\/*    #####    ###      ###    ###  #### ##   ####  ###   ##  +-----------+  *\/\r\n\/*  =======================================================================  *\/\r\n\/*  >>>>>>>>>>>>>>>>>>>>>> CrHack 模拟 I2C 函数库模板 <<<<<<<<<<<<<<<<<<<<<  *\/\r\n\/*  =======================================================================  *\/\r\n\/*****************************************************************************\/\r\n\r\n\/* 管脚相关配置 *\/\r\n#ifndef _I2C_INIT_\r\n    #define _I2C_INIT_\r\n#endif\r\n#ifndef I2C_SCL_DIRO\r\n    #define I2C_SCL_DIRO\r\n#endif\r\n#ifndef I2C_SDA_DIRO\r\n    #define I2C_SDA_DIRO\r\n#endif\r\n#ifndef I2C_SCL_DIRI\r\n    #define I2C_SCL_DIRI    I2C_SCL_SETB\r\n#endif\r\n#ifndef I2C_SDA_DIRI\r\n    #define I2C_SDA_DIRI    I2C_SDA_SETB\r\n#endif\r\n\r\n\/* 器件地址类型 *\/\r\n#if     defined(_I2C_256B_)\r\n    #define i2c_addr_t  byte_t\r\n#elif   defined(_I2C_64KB_) || \\\r\n        defined(_I2C_2048B_)\r\n    #define i2c_addr_t  int16u\r\n#elif   defined(_I2C_LARGE_)\r\n    #define i2c_addr_t  int32u\r\n#else\r\n    #error \"i2c.inl: missing I2C TYPE define!\"\r\n#endif\r\n\r\n\/* 缺省的额外 ACK 等待 *\/\r\n#ifndef I2C_DELAY_ACK_EX\r\n    #define I2C_DELAY_ACK_EX\r\n#endif\r\n\r\n\/* 缺省的额外读位等待 *\/\r\n#ifndef I2C_DELAY_GET_EX\r\n    #define I2C_DELAY_GET_EX\r\n#endif\r\n\r\n\/* 器件数据长度 *\/\r\n#ifndef i2c_leng_t\r\n    #define i2c_leng_t  i2c_addr_t\r\n#endif\r\n\r\n\/*\r\n=======================================\r\n    模拟 I2C 初始化\r\n=======================================\r\n*\/\r\n#if defined(i2c_init)\r\nCR_API void_t\r\ni2c_init (void_t)\r\n{\r\n    _I2C_INIT_\r\n    \/* ------ *\/\r\n    I2C_SDA_DIRI\r\n    I2C_SCL_DIRI\r\n    \/* ------ *\/\r\n}\r\n#endif  \/* i2c_init *\/\r\n\r\n\/*\r\n=======================================\r\n    模拟 I2C 起始信号\r\n=======================================\r\n*\/\r\n#if defined(i2c_enter)\r\nCR_API void_t\r\ni2c_enter (void_t)\r\n{\r\n    \/* ------ *\/\r\n    I2C_SDA_DIRO\r\n    I2C_SCL_DIRO\r\n    \/* ------ *\/\r\n    I2C_SDA_SETB\r\n    I2C_SCL_SETB\r\n    I2C_DELAY_4_7_US\r\n    I2C_SDA_CLRB\r\n    I2C_DELAY_4___US\r\n    I2C_SCL_CLRB\r\n    I2C_DELAY_4_7_US\r\n}\r\n#endif  \/* i2c_enter *\/\r\n\r\n\/*\r\n=======================================\r\n    模拟 I2C 结束信号\r\n=======================================\r\n*\/\r\n#if defined(i2c_leave)\r\nCR_API void_t\r\ni2c_leave (void_t)\r\n{\r\n    \/* ------ *\/\r\n    I2C_SDA_DIRO\r\n    \/* ------ *\/\r\n    I2C_SDA_CLRB\r\n    I2C_SCL_SETB\r\n    I2C_DELAY_4___US\r\n    I2C_SDA_SETB\r\n    I2C_DELAY_4_7_US\r\n    \/* ------ *\/\r\n    I2C_SDA_DIRI\r\n    I2C_SCL_DIRI\r\n    \/* ------ *\/\r\n}\r\n#endif  \/* i2c_leave *\/\r\n\r\n\/*\r\n=======================================\r\n    模拟 I2C 释放总线\r\n=======================================\r\n*\/\r\n#if defined(i2c_release)\r\nCR_API void_t\r\ni2c_release (void_t)\r\n{\r\n    ufast_t idx;\r\n\r\n    I2C_SCL_CLRB\r\n    \/* ------ *\/\r\n    I2C_SDA_DIRI\r\n    \/* ------ *\/\r\n    I2C_DELAY_GET_EX\r\n    if (I2C_SDA_GETB)\r\n        return;\r\n    for (idx = 9; idx != 0; idx--) {\r\n        I2C_SCL_CLRB\r\n        I2C_DELAY_4_7_US\r\n        I2C_SCL_SETB\r\n        I2C_DELAY_4___US\r\n    }\r\n    I2C_SCL_CLRB\r\n}\r\n#endif  \/* i2c_release *\/\r\n\r\n\/*\r\n=======================================\r\n    模拟 I2C 发送 ACK 信号\r\n=======================================\r\n*\/\r\n#if defined(i2c_send_ack)\r\nCR_API void_t\r\ni2c_send_ack (void_t)\r\n{\r\n    \/* ------ *\/\r\n    I2C_SDA_DIRO\r\n    \/* ------ *\/\r\n    I2C_SDA_CLRB\r\n    I2C_SCL_SETB\r\n    I2C_DELAY_4___US\r\n    I2C_SCL_CLRB\r\n    I2C_DELAY_4_7_US\r\n}\r\n#endif  \/* i2c_send_ack *\/\r\n\r\n\/*\r\n=======================================\r\n    模拟 I2C 发送 NACK 信号\r\n=======================================\r\n*\/\r\n#if defined(i2c_send_nack)\r\nCR_API void_t\r\ni2c_send_nack (void_t)\r\n{\r\n    \/* ------ *\/\r\n    I2C_SDA_DIRO\r\n    \/* ------ *\/\r\n    I2C_SDA_SETB\r\n    I2C_SCL_SETB\r\n    I2C_DELAY_4___US\r\n    I2C_SCL_CLRB\r\n    I2C_DELAY_4_7_US\r\n}\r\n#endif  \/* i2c_send_nack *\/\r\n\r\n\/*\r\n=======================================\r\n    模拟 I2C 检测 ACK 信号\r\n=======================================\r\n*\/\r\n#if defined(i2c_test_ack)\r\nCR_API retc_t\r\ni2c_test_ack (void_t)\r\n{\r\n    retc_t  ack;\r\n\r\n    \/* ------ *\/\r\n    I2C_SDA_DIRI\r\n    \/* ------ *\/\r\n    I2C_SCL_SETB\r\n    I2C_DELAY_4___US\r\n    I2C_DELAY_ACK_EX\r\n    if (I2C_SDA_GETB)\r\n        ack = FALSE;\r\n    else\r\n        ack = TRUE;\r\n    I2C_DELAY_4_7_US\r\n    I2C_SCL_CLRB\r\n    I2C_DELAY_4___US\r\n    return (ack);\r\n}\r\n#endif  \/* i2c_test_ack *\/\r\n\r\n\/*\r\n=======================================\r\n    模拟 I2C 接收一个字节\r\n=======================================\r\n*\/\r\n#if defined(i2c_recv_byte)\r\nCR_API byte_t\r\ni2c_recv_byte (void_t)\r\n{\r\n    byte_t  val = 0;\r\n    ufast_t idx = 8;\r\n\r\n    \/* ------ *\/\r\n    I2C_SDA_DIRI\r\n    \/* ------ *\/\r\n    for (; idx != 0; idx--)\r\n    {\r\n        I2C_SCL_CLRB\r\n        I2C_DELAY_4_7_US\r\n        I2C_SCL_SETB\r\n        I2C_DELAY_GET_EX\r\n        val <<= 1;\r\n        if (I2C_SDA_GETB)\r\n            val |= 1;\r\n        I2C_DELAY_4___US\r\n    }\r\n    I2C_SCL_CLRB\r\n    I2C_DELAY_4_7_US\r\n    return (val);\r\n}\r\n#endif  \/* i2c_recv_byte *\/\r\n\r\n\/*\r\n=======================================\r\n    模拟 I2C 发送一个字节\r\n=======================================\r\n*\/\r\n#if defined(i2c_send_byte)\r\nCR_API retc_t\r\ni2c_send_byte (\r\n  __CR_IN__ byte_t  val\r\n    )\r\n{\r\n    ufast_t idx = 8;\r\n\r\n    \/* ------ *\/\r\n    I2C_SDA_DIRO\r\n    \/* ------ *\/\r\n    for (; idx != 0; idx--)\r\n    {\r\n        if (val & 0x80)\r\n            I2C_SDA_SETB\r\n        else\r\n            I2C_SDA_CLRB\r\n        val <<= 1;\r\n        I2C_SCL_SETB\r\n        I2C_DELAY_4___US\r\n        I2C_SCL_CLRB\r\n        I2C_DELAY_4_7_US\r\n    }\r\n    return (i2c_test_ack());\r\n}\r\n#endif  \/* i2c_send_byte *\/\r\n\r\n\/*\r\n=======================================\r\n    模拟 I2C 发送器件地址\r\n=======================================\r\n*\/\r\n#if defined(i2c_send_slave)\r\nCR_API retc_t\r\ni2c_send_slave (\r\n  __CR_IO__ byte_t*     devs,\r\n  __CR_IN__ i2c_addr_t  addr\r\n    )\r\n{\r\n    byte_t  temp = *devs;\r\n\r\n    \/* <= 256B 的器件 *\/\r\n#if     defined(_I2C_256B_)\r\n\r\n    CR_NOUSE(addr);\r\n\r\n    \/* <= 2048B 的器件 *\/\r\n#elif   defined(_I2C_2048B_)\r\n\r\n    \/* 地址过滤 *\/\r\n    if (addr >= 2048)\r\n        return (FALSE);\r\n    temp |= (byte_t)(addr >> 7) & 0x0E;\r\n    *devs = temp;\r\n\r\n#elif   !defined(_I2C_64KB_)\r\n\r\n    \/* 地址过滤 *\/\r\n    if (addr >= 524288UL)\r\n        return (FALSE);\r\n    temp |= (byte_t)(addr >> 15) & 0x0E;\r\n    *devs = temp;\r\n\r\n#endif  \/* device size predefines *\/\r\n\r\n    \/* 发送起始位 *\/\r\n    i2c_enter();\r\n\r\n    \/* 输出器件地址 *\/\r\n    return (i2c_send_byte(temp));\r\n}\r\n#endif  \/* i2c_send_slave *\/\r\n\r\n\/*\r\n=======================================\r\n    模拟 I2C 发送数据地址\r\n=======================================\r\n*\/\r\n#if defined(i2c_send_address)\r\nCR_API retc_t\r\ni2c_send_address (\r\n  __CR_IN__ i2c_addr_t  addr\r\n    )\r\n{\r\n    \/* <= 2048B 的器件 *\/\r\n#if defined(_I2C_256B_) || \\\r\n    defined(_I2C_2048B_)\r\n\r\n    \/* 输出8位地址 *\/\r\n    if (!i2c_send_byte((byte_t)addr))\r\n        return (FALSE);\r\n\r\n    \/* > 2048B 的器件 *\/\r\n#else\r\n    byte_t  hi = (byte_t)(addr >> 8);\r\n\r\n    \/* 输出16位地址 *\/\r\n    if (!i2c_send_byte((byte_t)(hi)))\r\n        return (FALSE);\r\n    if (!i2c_send_byte((byte_t)addr))\r\n        return (FALSE);\r\n\r\n#endif  \/* device size predefines *\/\r\n\r\n    return (TRUE);\r\n}\r\n#endif  \/* i2c_send_address *\/\r\n\r\n\/*\r\n=======================================\r\n    模拟 I2C 读取器件地址数据\r\n=======================================\r\n*\/\r\n#if defined(i2c_read_device)\r\nCR_API i2c_leng_t\r\ni2c_read_device (\r\n  __CR_IN__ byte_t      devs,\r\n  __CR_IN__ i2c_addr_t  addr,\r\n  __CR_OT__ void_t*     data,\r\n  __CR_IN__ i2c_leng_t  size\r\n    )\r\n{\r\n    i2c_leng_t  ptr;\r\n\r\n    \/* 过滤长度 *\/\r\n    if (size == 0)\r\n        return (0);\r\n    ptr = 0;\r\n    devs &= 0xFE;\r\n\r\n    \/* 指定读取的地址 *\/\r\n    if (!i2c_send_slave(&devs, addr))\r\n        goto _func_out;\r\n    if (!i2c_send_address(addr))\r\n        goto _func_out;\r\n\r\n    \/* 发送起始位 *\/\r\n    i2c_enter();\r\n\r\n    \/* 输出器件地址 *\/\r\n    if (!i2c_send_byte(devs | 0x01))\r\n        goto _func_out;\r\n    size--;\r\n\r\n    \/* 开始连续读取数据 *\/\r\n    for (; ptr < size; ptr++) {\r\n        *(uchar*)data = i2c_recv_byte();\r\n        i2c_send_ack();\r\n        data = (uchar*)data + 1;\r\n    }\r\n\r\n    \/* 最后一个字节发 NACK *\/\r\n    *(uchar*)data = i2c_recv_byte();\r\n    i2c_send_nack();\r\n    ptr++;\r\n\r\n_func_out:\r\n    i2c_leave();\r\n    return (ptr);\r\n}\r\n#endif  \/* i2c_read_device *\/\r\n\r\n\/*\r\n=======================================\r\n    模拟 I2C 写入器件地址数据\r\n=======================================\r\n*\/\r\n#if defined(i2c_write_device)\r\nCR_API i2c_leng_t\r\ni2c_write_device (\r\n  __CR_IN__ byte_t          devs,\r\n  __CR_IN__ i2c_addr_t      addr,\r\n  __CR_IN__ const void_t*   data,\r\n  __CR_IN__ i2c_leng_t      size\r\n    )\r\n{\r\n    i2c_leng_t  ptr;\r\n\r\n    \/* 过滤长度 *\/\r\n    if (size == 0)\r\n        return (0);\r\n    ptr = 0;\r\n    devs &= 0xFE;\r\n\r\n    \/* 指定写入的地址 *\/\r\n    if (!i2c_send_slave(&devs, addr))\r\n        goto _func_out;\r\n    if (!i2c_send_address(addr))\r\n        goto _func_out;\r\n\r\n    \/* 开始连续写入数据 *\/\r\n    for (; ptr < size; ptr++) {\r\n        if (!i2c_send_byte(*(uchar*)data))\r\n            break;\r\n        data = (uchar*)data + 1;\r\n    }\r\n\r\n_func_out:\r\n    i2c_leave();\r\n    return (ptr);\r\n}\r\n#endif  \/* i2c_write_device *\/\r\n\r\n\/*****************************************************************************\/\r\n\/* _________________________________________________________________________ *\/\r\n\/* uBMAzRBoAKAHaACQD6FoAIAPqbgA\/7rIA+5CM9uKw8D4Au7u7mSIJ0t18mYz0mYz9rAQZCgHc *\/\r\n\/* wRIZIgHZovGBXUAZg+v0GbB+gRmgcJ7BAAAisIlAwB1Av7LSHUC\/s9IdQL+w0h1Av7HZkZmgf *\/\r\n\/* 4JLgIAdb262gPsqAh0+zP\/uQB9ZYsFZYktq+L3sMi\/AAK7gAKJAUtLdfq5IANXvT8BiQzfBIv *\/\r\n\/* FLaAAweAEmff53wb+Adjx3kQE2xwy5Io8ithkigcFgACJBN8E3sneNvwB2xyLHDkdfA2JHSyA *\/\r\n\/* adtAAQPdZYgHR0dNdbZfSYP5UHWr\/kQEtAHNFg+Eef\/DWAKgDw== |~~~~~~~~~~~~~~~~~~~ *\/\r\n\/* ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ >>> END OF FILE <<< *\/\r\n\/*****************************************************************************\/\r\n<commit_msg>i2c fix<commit_after>\/*****************************************************************************\/\r\n\/*                                                  ###                      *\/\r\n\/*       #####          ###    ###                  ###  CREATE: 2010-05-22  *\/\r\n\/*     #######          ###    ###      [KRNL]      ###  ~~~~~~~~~~~~~~~~~~  *\/\r\n\/*    ########          ###    ###                  ###  MODIFY: XXXX-XX-XX  *\/\r\n\/*    ####  ##          ###    ###                  ###  ~~~~~~~~~~~~~~~~~~  *\/\r\n\/*   ###       ### ###  ###    ###    ####    ####  ###   ##  +-----------+  *\/\r\n\/*  ####       ######## ##########  #######  ###### ###  ###  |  A NEW C  |  *\/\r\n\/*  ###        ######## ########## ########  ###### ### ###   | FRAMEWORK |  *\/\r\n\/*  ###     ## #### ### ########## ###  ### ###     ######    |  FOR ALL  |  *\/\r\n\/*  ####   ### ###  ### ###    ### ###  ### ###     ######    | PLATFORMS |  *\/\r\n\/*  ########## ###      ###    ### ######## ####### #######   |  AND ALL  |  *\/\r\n\/*   #######   ###      ###    ### ########  ###### ###  ###  | COMPILERS |  *\/\r\n\/*    #####    ###      ###    ###  #### ##   ####  ###   ##  +-----------+  *\/\r\n\/*  =======================================================================  *\/\r\n\/*  >>>>>>>>>>>>>>>>>>>>>> CrHack 模拟 I2C 函数库模板 <<<<<<<<<<<<<<<<<<<<<  *\/\r\n\/*  =======================================================================  *\/\r\n\/*****************************************************************************\/\r\n\r\n\/* 管脚相关配置 *\/\r\n#ifndef _I2C_INIT_\r\n    #define _I2C_INIT_\r\n#endif\r\n#ifndef I2C_SCL_DIRO\r\n    #define I2C_SCL_DIRO\r\n#endif\r\n#ifndef I2C_SDA_DIRO\r\n    #define I2C_SDA_DIRO\r\n#endif\r\n#ifndef I2C_SCL_DIRI\r\n    #define I2C_SCL_DIRI    I2C_SCL_SETB\r\n#endif\r\n#ifndef I2C_SDA_DIRI\r\n    #define I2C_SDA_DIRI    I2C_SDA_SETB\r\n#endif\r\n\r\n\/* 器件地址类型 *\/\r\n#if     defined(_I2C_256B_)\r\n    #define i2c_addr_t  byte_t\r\n#elif   defined(_I2C_64KB_) || \\\r\n        defined(_I2C_2048B_)\r\n    #define i2c_addr_t  int16u\r\n#elif   defined(_I2C_LARGE_)\r\n    #define i2c_addr_t  int32u\r\n#else\r\n    #error \"i2c.inl: missing I2C TYPE define!\"\r\n#endif\r\n\r\n\/* 缺省的额外 ACK 等待 *\/\r\n#ifndef I2C_DELAY_ACK_EX\r\n    #define I2C_DELAY_ACK_EX\r\n#endif\r\n\r\n\/* 缺省的额外读位等待 *\/\r\n#ifndef I2C_DELAY_GET_EX\r\n    #define I2C_DELAY_GET_EX\r\n#endif\r\n\r\n\/* 器件数据长度 *\/\r\n#ifndef i2c_leng_t\r\n    #define i2c_leng_t  i2c_addr_t\r\n#endif\r\n\r\n\/*\r\n=======================================\r\n    模拟 I2C 初始化\r\n=======================================\r\n*\/\r\n#if defined(i2c_init)\r\nCR_API void_t\r\ni2c_init (void_t)\r\n{\r\n    _I2C_INIT_\r\n    \/* ------ *\/\r\n    I2C_SDA_DIRI\r\n    I2C_SCL_DIRI\r\n    \/* ------ *\/\r\n}\r\n#endif  \/* i2c_init *\/\r\n\r\n\/*\r\n=======================================\r\n    模拟 I2C 起始信号\r\n=======================================\r\n*\/\r\n#if defined(i2c_enter)\r\nCR_API void_t\r\ni2c_enter (void_t)\r\n{\r\n    \/* ------ *\/\r\n    I2C_SDA_DIRO\r\n    I2C_SCL_DIRO\r\n    \/* ------ *\/\r\n    I2C_SDA_SETB\r\n    I2C_SCL_SETB\r\n    I2C_DELAY_4_7_US\r\n    I2C_SDA_CLRB\r\n    I2C_DELAY_4___US\r\n    I2C_SCL_CLRB\r\n    I2C_DELAY_4_7_US\r\n}\r\n#endif  \/* i2c_enter *\/\r\n\r\n\/*\r\n=======================================\r\n    模拟 I2C 结束信号\r\n=======================================\r\n*\/\r\n#if defined(i2c_leave)\r\nCR_API void_t\r\ni2c_leave (void_t)\r\n{\r\n    \/* ------ *\/\r\n    I2C_SDA_DIRO\r\n    \/* ------ *\/\r\n    I2C_SDA_CLRB\r\n    I2C_SCL_SETB\r\n    I2C_DELAY_4___US\r\n    I2C_SDA_SETB\r\n    I2C_DELAY_4_7_US\r\n    \/* ------ *\/\r\n    I2C_SDA_DIRI\r\n    I2C_SCL_DIRI\r\n    \/* ------ *\/\r\n}\r\n#endif  \/* i2c_leave *\/\r\n\r\n\/*\r\n=======================================\r\n    模拟 I2C 释放总线\r\n=======================================\r\n*\/\r\n#if defined(i2c_release)\r\nCR_API void_t\r\ni2c_release (void_t)\r\n{\r\n    ufast_t idx;\r\n\r\n    \/* ------ *\/\r\n    I2C_SCL_DIRO\r\n    \/* ------ *\/\r\n    I2C_SCL_CLRB\r\n    \/* ------ *\/\r\n    I2C_SDA_DIRI\r\n    \/* ------ *\/\r\n    I2C_DELAY_GET_EX\r\n    if (I2C_SDA_GETB)\r\n        return;\r\n    for (idx = 9; idx != 0; idx--) {\r\n        I2C_SCL_CLRB\r\n        I2C_DELAY_4_7_US\r\n        I2C_SCL_SETB\r\n        I2C_DELAY_4___US\r\n    }\r\n    I2C_SCL_CLRB\r\n}\r\n#endif  \/* i2c_release *\/\r\n\r\n\/*\r\n=======================================\r\n    模拟 I2C 发送 ACK 信号\r\n=======================================\r\n*\/\r\n#if defined(i2c_send_ack)\r\nCR_API void_t\r\ni2c_send_ack (void_t)\r\n{\r\n    \/* ------ *\/\r\n    I2C_SDA_DIRO\r\n    \/* ------ *\/\r\n    I2C_SDA_CLRB\r\n    I2C_SCL_SETB\r\n    I2C_DELAY_4___US\r\n    I2C_SCL_CLRB\r\n    I2C_DELAY_4_7_US\r\n}\r\n#endif  \/* i2c_send_ack *\/\r\n\r\n\/*\r\n=======================================\r\n    模拟 I2C 发送 NACK 信号\r\n=======================================\r\n*\/\r\n#if defined(i2c_send_nack)\r\nCR_API void_t\r\ni2c_send_nack (void_t)\r\n{\r\n    \/* ------ *\/\r\n    I2C_SDA_DIRO\r\n    \/* ------ *\/\r\n    I2C_SDA_SETB\r\n    I2C_SCL_SETB\r\n    I2C_DELAY_4___US\r\n    I2C_SCL_CLRB\r\n    I2C_DELAY_4_7_US\r\n}\r\n#endif  \/* i2c_send_nack *\/\r\n\r\n\/*\r\n=======================================\r\n    模拟 I2C 检测 ACK 信号\r\n=======================================\r\n*\/\r\n#if defined(i2c_test_ack)\r\nCR_API retc_t\r\ni2c_test_ack (void_t)\r\n{\r\n    retc_t  ack;\r\n\r\n    \/* ------ *\/\r\n    I2C_SDA_DIRI\r\n    \/* ------ *\/\r\n    I2C_SCL_SETB\r\n    I2C_DELAY_4___US\r\n    I2C_DELAY_ACK_EX\r\n    if (I2C_SDA_GETB)\r\n        ack = FALSE;\r\n    else\r\n        ack = TRUE;\r\n    I2C_DELAY_4_7_US\r\n    I2C_SCL_CLRB\r\n    I2C_DELAY_4___US\r\n    return (ack);\r\n}\r\n#endif  \/* i2c_test_ack *\/\r\n\r\n\/*\r\n=======================================\r\n    模拟 I2C 接收一个字节\r\n=======================================\r\n*\/\r\n#if defined(i2c_recv_byte)\r\nCR_API byte_t\r\ni2c_recv_byte (void_t)\r\n{\r\n    byte_t  val = 0;\r\n    ufast_t idx = 8;\r\n\r\n    \/* ------ *\/\r\n    I2C_SDA_DIRI\r\n    \/* ------ *\/\r\n    for (; idx != 0; idx--)\r\n    {\r\n        I2C_SCL_CLRB\r\n        I2C_DELAY_4_7_US\r\n        I2C_SCL_SETB\r\n        I2C_DELAY_GET_EX\r\n        val <<= 1;\r\n        if (I2C_SDA_GETB)\r\n            val |= 1;\r\n        I2C_DELAY_4___US\r\n    }\r\n    I2C_SCL_CLRB\r\n    I2C_DELAY_4_7_US\r\n    return (val);\r\n}\r\n#endif  \/* i2c_recv_byte *\/\r\n\r\n\/*\r\n=======================================\r\n    模拟 I2C 发送一个字节\r\n=======================================\r\n*\/\r\n#if defined(i2c_send_byte)\r\nCR_API retc_t\r\ni2c_send_byte (\r\n  __CR_IN__ byte_t  val\r\n    )\r\n{\r\n    ufast_t idx = 8;\r\n\r\n    \/* ------ *\/\r\n    I2C_SDA_DIRO\r\n    \/* ------ *\/\r\n    for (; idx != 0; idx--)\r\n    {\r\n        if (val & 0x80)\r\n            I2C_SDA_SETB\r\n        else\r\n            I2C_SDA_CLRB\r\n        val <<= 1;\r\n        I2C_SCL_SETB\r\n        I2C_DELAY_4___US\r\n        I2C_SCL_CLRB\r\n        I2C_DELAY_4_7_US\r\n    }\r\n    return (i2c_test_ack());\r\n}\r\n#endif  \/* i2c_send_byte *\/\r\n\r\n\/*\r\n=======================================\r\n    模拟 I2C 发送器件地址\r\n=======================================\r\n*\/\r\n#if defined(i2c_send_slave)\r\nCR_API retc_t\r\ni2c_send_slave (\r\n  __CR_IO__ byte_t*     devs,\r\n  __CR_IN__ i2c_addr_t  addr\r\n    )\r\n{\r\n    byte_t  temp = *devs;\r\n\r\n    \/* <= 256B 的器件 *\/\r\n#if     defined(_I2C_256B_)\r\n\r\n    CR_NOUSE(addr);\r\n\r\n    \/* <= 2048B 的器件 *\/\r\n#elif   defined(_I2C_2048B_)\r\n\r\n    \/* 地址过滤 *\/\r\n    if (addr >= 2048)\r\n        return (FALSE);\r\n    temp |= (byte_t)(addr >> 7) & 0x0E;\r\n    *devs = temp;\r\n\r\n#elif   !defined(_I2C_64KB_)\r\n\r\n    \/* 地址过滤 *\/\r\n    if (addr >= 524288UL)\r\n        return (FALSE);\r\n    temp |= (byte_t)(addr >> 15) & 0x0E;\r\n    *devs = temp;\r\n\r\n#endif  \/* device size predefines *\/\r\n\r\n    \/* 发送起始位 *\/\r\n    i2c_enter();\r\n\r\n    \/* 输出器件地址 *\/\r\n    return (i2c_send_byte(temp));\r\n}\r\n#endif  \/* i2c_send_slave *\/\r\n\r\n\/*\r\n=======================================\r\n    模拟 I2C 发送数据地址\r\n=======================================\r\n*\/\r\n#if defined(i2c_send_address)\r\nCR_API retc_t\r\ni2c_send_address (\r\n  __CR_IN__ i2c_addr_t  addr\r\n    )\r\n{\r\n    \/* <= 2048B 的器件 *\/\r\n#if defined(_I2C_256B_) || \\\r\n    defined(_I2C_2048B_)\r\n\r\n    \/* 输出8位地址 *\/\r\n    if (!i2c_send_byte((byte_t)addr))\r\n        return (FALSE);\r\n\r\n    \/* > 2048B 的器件 *\/\r\n#else\r\n    byte_t  hi = (byte_t)(addr >> 8);\r\n\r\n    \/* 输出16位地址 *\/\r\n    if (!i2c_send_byte((byte_t)(hi)))\r\n        return (FALSE);\r\n    if (!i2c_send_byte((byte_t)addr))\r\n        return (FALSE);\r\n\r\n#endif  \/* device size predefines *\/\r\n\r\n    return (TRUE);\r\n}\r\n#endif  \/* i2c_send_address *\/\r\n\r\n\/*\r\n=======================================\r\n    模拟 I2C 读取器件地址数据\r\n=======================================\r\n*\/\r\n#if defined(i2c_read_device)\r\nCR_API i2c_leng_t\r\ni2c_read_device (\r\n  __CR_IN__ byte_t      devs,\r\n  __CR_IN__ i2c_addr_t  addr,\r\n  __CR_OT__ void_t*     data,\r\n  __CR_IN__ i2c_leng_t  size\r\n    )\r\n{\r\n    i2c_leng_t  ptr;\r\n\r\n    \/* 过滤长度 *\/\r\n    if (size == 0)\r\n        return (0);\r\n    ptr = 0;\r\n    devs &= 0xFE;\r\n\r\n    \/* 指定读取的地址 *\/\r\n    if (!i2c_send_slave(&devs, addr))\r\n        goto _func_out;\r\n    if (!i2c_send_address(addr))\r\n        goto _func_out;\r\n\r\n    \/* 发送起始位 *\/\r\n    i2c_enter();\r\n\r\n    \/* 输出器件地址 *\/\r\n    if (!i2c_send_byte(devs | 0x01))\r\n        goto _func_out;\r\n    size--;\r\n\r\n    \/* 开始连续读取数据 *\/\r\n    for (; ptr < size; ptr++) {\r\n        *(uchar*)data = i2c_recv_byte();\r\n        i2c_send_ack();\r\n        data = (uchar*)data + 1;\r\n    }\r\n\r\n    \/* 最后一个字节发 NACK *\/\r\n    *(uchar*)data = i2c_recv_byte();\r\n    i2c_send_nack();\r\n    ptr++;\r\n\r\n_func_out:\r\n    i2c_leave();\r\n    return (ptr);\r\n}\r\n#endif  \/* i2c_read_device *\/\r\n\r\n\/*\r\n=======================================\r\n    模拟 I2C 写入器件地址数据\r\n=======================================\r\n*\/\r\n#if defined(i2c_write_device)\r\nCR_API i2c_leng_t\r\ni2c_write_device (\r\n  __CR_IN__ byte_t          devs,\r\n  __CR_IN__ i2c_addr_t      addr,\r\n  __CR_IN__ const void_t*   data,\r\n  __CR_IN__ i2c_leng_t      size\r\n    )\r\n{\r\n    i2c_leng_t  ptr;\r\n\r\n    \/* 过滤长度 *\/\r\n    if (size == 0)\r\n        return (0);\r\n    ptr = 0;\r\n    devs &= 0xFE;\r\n\r\n    \/* 指定写入的地址 *\/\r\n    if (!i2c_send_slave(&devs, addr))\r\n        goto _func_out;\r\n    if (!i2c_send_address(addr))\r\n        goto _func_out;\r\n\r\n    \/* 开始连续写入数据 *\/\r\n    for (; ptr < size; ptr++) {\r\n        if (!i2c_send_byte(*(uchar*)data))\r\n            break;\r\n        data = (uchar*)data + 1;\r\n    }\r\n\r\n_func_out:\r\n    i2c_leave();\r\n    return (ptr);\r\n}\r\n#endif  \/* i2c_write_device *\/\r\n\r\n\/*****************************************************************************\/\r\n\/* _________________________________________________________________________ *\/\r\n\/* uBMAzRBoAKAHaACQD6FoAIAPqbgA\/7rIA+5CM9uKw8D4Au7u7mSIJ0t18mYz0mYz9rAQZCgHc *\/\r\n\/* wRIZIgHZovGBXUAZg+v0GbB+gRmgcJ7BAAAisIlAwB1Av7LSHUC\/s9IdQL+w0h1Av7HZkZmgf *\/\r\n\/* 4JLgIAdb262gPsqAh0+zP\/uQB9ZYsFZYktq+L3sMi\/AAK7gAKJAUtLdfq5IANXvT8BiQzfBIv *\/\r\n\/* FLaAAweAEmff53wb+Adjx3kQE2xwy5Io8ithkigcFgACJBN8E3sneNvwB2xyLHDkdfA2JHSyA *\/\r\n\/* adtAAQPdZYgHR0dNdbZfSYP5UHWr\/kQEtAHNFg+Eef\/DWAKgDw== |~~~~~~~~~~~~~~~~~~~ *\/\r\n\/* ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ >>> END OF FILE <<< *\/\r\n\/*****************************************************************************\/\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2017-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#include <algorithm>\n#include <map>\n#include <sstream>\n\n#include \"..\/hy-subject.h\"\n#include \"..\/nevra.hpp\"\n\n#include \"RPMItem.hpp\"\n\nnamespace libdnf {\n\nRPMItem::RPMItem(SQLite3Ptr conn)\n  : Item{conn}\n{\n}\n\nRPMItem::RPMItem(SQLite3Ptr conn, int64_t pk)\n  : Item{conn}\n{\n    dbSelect(pk);\n}\n\nvoid\nRPMItem::save()\n{\n    if (getId() == 0) {\n        dbSelectOrInsert();\n    } else {\n        \/\/ TODO: dbUpdate() ?\n    }\n}\n\nvoid\nRPMItem::dbSelect(int64_t pk)\n{\n    const char *sql =\n        \"SELECT \"\n        \"  name, \"\n        \"  epoch, \"\n        \"  version, \"\n        \"  release, \"\n        \"  arch \"\n        \"FROM \"\n        \"  rpm \"\n        \"WHERE \"\n        \"  item_id = ?\";\n    SQLite3::Statement query(*conn.get(), sql);\n    query.bindv(pk);\n    query.step();\n\n    setId(pk);\n    setName(query.get< std::string >(0));\n    setEpoch(query.get< int >(1));\n    setVersion(query.get< std::string >(2));\n    setRelease(query.get< std::string >(3));\n    setArch(query.get< std::string >(4));\n}\n\nvoid\nRPMItem::dbInsert()\n{\n    \/\/ populates this->id\n    Item::save();\n\n    const char *sql =\n        \"INSERT INTO \"\n        \"  rpm \"\n        \"VALUES \"\n        \"  (?, ?, ?, ?, ?, ?)\";\n    SQLite3::Statement query(*conn.get(), sql);\n    query.bindv(getId(), getName(), getEpoch(), getVersion(), getRelease(), getArch());\n    query.step();\n}\n\nstatic TransactionItemPtr\ntransactionItemFromQuery(SQLite3Ptr conn, SQLite3::Query &query, int64_t transID)\n{\n    auto trans_item = std::make_shared< TransactionItem >(conn, transID);\n    auto item = std::make_shared< RPMItem >(conn);\n    trans_item->setItem(item);\n    trans_item->setId(query.get< int >(\"id\"));\n    trans_item->setAction(static_cast< TransactionItemAction >(query.get< int >(\"action\")));\n    trans_item->setReason(static_cast< TransactionItemReason >(query.get< int >(\"reason\")));\n    trans_item->setRepoid(query.get< std::string >(\"repoid\"));\n    trans_item->setState(static_cast< TransactionItemState >(query.get< int >(\"state\")));\n    item->setId(query.get< int >(\"item_id\"));\n    item->setName(query.get< std::string >(\"name\"));\n    item->setEpoch(query.get< int >(\"epoch\"));\n    item->setVersion(query.get< std::string >(\"version\"));\n    item->setRelease(query.get< std::string >(\"release\"));\n    item->setArch(query.get< std::string >(\"arch\"));\n    return trans_item;\n}\n\nstd::vector< TransactionItemPtr >\nRPMItem::getTransactionItems(SQLite3Ptr conn, int64_t transaction_id)\n{\n    std::vector< TransactionItemPtr > result;\n\n    const char *sql =\n        \"SELECT \"\n        \/\/ trans_item\n        \"  ti.id, \"\n        \"  ti.action, \"\n        \"  ti.reason, \"\n        \"  ti.state, \"\n        \/\/ repo\n        \"  r.repoid, \"\n        \/\/ rpm\n        \"  i.item_id, \"\n        \"  i.name, \"\n        \"  i.epoch, \"\n        \"  i.version, \"\n        \"  i.release, \"\n        \"  i.arch \"\n        \"FROM \"\n        \"  trans_item ti, \"\n        \"  repo r, \"\n        \"  rpm i \"\n        \"WHERE \"\n        \"  ti.trans_id = ? \"\n        \"  AND ti.repo_id = r.id \"\n        \"  AND ti.item_id = i.item_id\";\n    SQLite3::Query query(*conn.get(), sql);\n    query.bindv(transaction_id);\n\n    while (query.step() == SQLite3::Statement::StepResult::ROW) {\n        result.push_back(transactionItemFromQuery(conn, query, transaction_id));\n    }\n    return result;\n}\n\nstd::string\nRPMItem::getNEVRA() const\n{\n    \/\/ TODO: use string formatting\n    if (epoch > 0) {\n        return name + \"-\" + std::to_string(epoch) + \":\" + version + \"-\" + release + \".\" + arch;\n    }\n    return name + \"-\" + version + \"-\" + release + \".\" + arch;\n}\n\nstd::string\nRPMItem::toStr() const\n{\n    return getNEVRA();\n}\n\nvoid\nRPMItem::dbSelectOrInsert()\n{\n    const char *sql =\n        \"SELECT \"\n        \"  item_id \"\n        \"FROM \"\n        \"  rpm \"\n        \"WHERE \"\n        \"  name = ? \"\n        \"  AND epoch = ? \"\n        \"  AND version = ? \"\n        \"  AND release = ? \"\n        \"  AND arch = ?\";\n\n    SQLite3::Statement query(*conn.get(), sql);\n\n    query.bindv(getName(), getEpoch(), getVersion(), getRelease(), getArch());\n    SQLite3::Statement::StepResult result = query.step();\n\n    if (result == SQLite3::Statement::StepResult::ROW) {\n        setId(query.get< int >(0));\n    } else {\n        \/\/ insert and get the ID back\n        dbInsert();\n    }\n}\n\nTransactionItemPtr\nRPMItem::getTransactionItem(SQLite3Ptr conn, const std::string &nevra)\n{\n    Nevra nevraObject;\n    if (!nevraObject.parse(nevra.c_str(), HY_FORM_NEVRA)) {\n        return nullptr;\n    }\n    \/\/ TODO: hy_nevra_possibility should set epoch to 0 if epoch is not specified and HY_FORM_NEVRA\n    \/\/ is used\n    if (nevraObject.getEpoch() < 0) {\n        nevraObject.setEpoch(0);\n    }\n\n    const char *sql = R\"**(\n        SELECT\n            ti.trans_id,\n            ti.id,\n            ti.action,\n            ti.reason,\n            ti.state,\n            r.repoid,\n            i.item_id,\n            i.name,\n            i.epoch,\n            i.version,\n            i.release,\n            i.arch\n        FROM\n            trans_item ti,\n            repo r,\n            rpm i\n        WHERE\n            ti.repo_id = r.id\n            AND ti.item_id = i.item_id\n            AND i.name = ?\n            AND i.epoch = ?\n            AND i.version = ?\n            AND i.release = ?\n            AND i.arch = ?\n        ORDER BY\n           ti.id DESC\n        LIMIT 1\n    )**\";\n    SQLite3::Query query(*conn, sql);\n    query.bindv(nevraObject.getName(),\n                nevraObject.getEpoch(),\n                nevraObject.getVersion(),\n                nevraObject.getRelease(),\n                nevraObject.getArch());\n    if (query.step() == SQLite3::Statement::StepResult::ROW) {\n        return transactionItemFromQuery(conn, query, query.get< int64_t >(\"trans_id\"));\n    }\n    return nullptr;\n}\n\nTransactionItemReason\nRPMItem::resolveTransactionItemReason(SQLite3Ptr conn,\n                                      const std::string &name,\n                                      const std::string &arch,\n                                      int64_t maxTransactionId)\n{\n    const char *sql = R\"**(\n        SELECT\n            ti.action as action,\n            ti.reason as reason\n        FROM\n            trans_item ti\n        JOIN\n            trans t ON ti.trans_id = t.id\n        JOIN\n            rpm i USING (item_id)\n        WHERE\n            t.state = 1\n            \/* see comment in TransactionItem.hpp - TransactionItemAction *\/\n            AND ti.action not in (3, 5, 7, 10)\n            AND i.name = ?\n            AND i.arch = ?\n        ORDER BY\n            ti.trans_id DESC\n        LIMIT 1\n    )**\";\n\n    if (arch != \"\") {\n        SQLite3::Query query(*conn, sql);\n        query.bindv(name, arch);\n\n        if (query.step() == SQLite3::Statement::StepResult::ROW) {\n            auto action = static_cast< TransactionItemAction >(query.get< int64_t >(\"action\"));\n            if (action == TransactionItemAction::REMOVE) {\n                return TransactionItemReason::UNKNOWN;\n            }\n            auto reason = static_cast< TransactionItemReason >(query.get< int64_t >(\"reason\"));\n            return reason;\n        }\n    } else {\n        const char *arch_sql = R\"**(\n            SELECT DISTINCT\n                arch\n            FROM\n                rpm\n            WHERE\n                name = ?\n        )**\";\n\n        SQLite3::Query arch_query(*conn, arch_sql);\n        arch_query.bindv(name);\n\n        TransactionItemReason result = TransactionItemReason::UNKNOWN;\n\n        while (arch_query.step() == SQLite3::Statement::StepResult::ROW) {\n            auto rpm_arch = arch_query.get< std::string >(\"arch\");\n\n            SQLite3::Query query(*conn, sql);\n            query.bindv(name, rpm_arch);\n            while (query.step() == SQLite3::Statement::StepResult::ROW) {\n                auto action = static_cast< TransactionItemAction >(query.get< int64_t >(\"action\"));\n                if (action == TransactionItemAction::REMOVE) {\n                    continue;\n                }\n                auto reason = static_cast< TransactionItemReason >(query.get< int64_t >(\"reason\"));\n                if (reason > result) {\n                    result = reason;\n                }\n            }\n        }\n        return result;\n    }\n    return TransactionItemReason::UNKNOWN;\n}\n\n\/**\n * Compare RPM packages\n * This method doesn't care about compare package names\n * \\param other RPMItem to compare with\n * \\return true if other package is newer (has higher version and\/or epoch)\n *\/\nbool\nRPMItem::operator<(const RPMItem &other) const\n{\n    \/\/ compare epochs\n    int32_t epochDif = other.getEpoch() - getEpoch();\n    if (epochDif > 0) {\n        return true;\n    } else if (epoch < 0) {\n        return false;\n    }\n\n    \/\/ compare versions\n    std::stringstream versionThis(getVersion());\n    std::stringstream versionOther(other.getVersion());\n\n    std::string bufferThis;\n    std::string bufferOther;\n    while (std::getline(versionThis, bufferThis, '.') &&\n           std::getline(versionOther, bufferOther, '.')) {\n        int subVersionThis = std::stoi(bufferThis);\n        int subVersionOther = std::stoi(bufferOther);\n        if (subVersionThis == subVersionOther) {\n            continue;\n        }\n        return subVersionOther > subVersionThis;\n    }\n    return false;\n}\n\nstd::vector< int64_t >\nRPMItem::searchTransactions(SQLite3Ptr conn, const std::vector< std::string > &patterns)\n{\n    std::vector< int64_t > result;\n\n    const char *sql = R\"**(\n        SELECT DISTINCT\n            t.id\n        FROM\n            trans t\n        JOIN\n            trans_item ti ON ti.trans_id = t.id\n        JOIN\n            rpm i USING (item_id)\n        WHERE\n            t.state = 1\n            AND (\n                i.name = ?\n                OR i.epoch = ?\n                OR i.version = ?\n                OR i.release = ?\n                OR i.arch = ?\n            )\n        ORDER BY\n           trans_id DESC\n    )**\";\n    SQLite3::Query query(*conn, sql);\n    for (auto pattern : patterns) {\n        query.bindv(pattern, pattern, pattern, pattern, pattern);\n        while (query.step() == SQLite3::Statement::StepResult::ROW) {\n            result.push_back(query.get< int64_t >(\"id\"));\n        }\n    }\n    std::sort(result.begin(), result.end());\n    auto last = std::unique(result.begin(), result.end());\n    result.erase(last, result.end());\n    return result;\n}\n\n} \/\/ namespace libdnf\n<commit_msg>libdnf\/transaction\/RPMItem: Fix handling transaction id in resolveTransactionItemReason<commit_after>\/*\n * Copyright (C) 2017-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#include <algorithm>\n#include <map>\n#include <sstream>\n\n#include \"..\/hy-subject.h\"\n#include \"..\/nevra.hpp\"\n\n#include \"RPMItem.hpp\"\n\nnamespace libdnf {\n\nRPMItem::RPMItem(SQLite3Ptr conn)\n  : Item{conn}\n{\n}\n\nRPMItem::RPMItem(SQLite3Ptr conn, int64_t pk)\n  : Item{conn}\n{\n    dbSelect(pk);\n}\n\nvoid\nRPMItem::save()\n{\n    if (getId() == 0) {\n        dbSelectOrInsert();\n    } else {\n        \/\/ TODO: dbUpdate() ?\n    }\n}\n\nvoid\nRPMItem::dbSelect(int64_t pk)\n{\n    const char *sql =\n        \"SELECT \"\n        \"  name, \"\n        \"  epoch, \"\n        \"  version, \"\n        \"  release, \"\n        \"  arch \"\n        \"FROM \"\n        \"  rpm \"\n        \"WHERE \"\n        \"  item_id = ?\";\n    SQLite3::Statement query(*conn.get(), sql);\n    query.bindv(pk);\n    query.step();\n\n    setId(pk);\n    setName(query.get< std::string >(0));\n    setEpoch(query.get< int >(1));\n    setVersion(query.get< std::string >(2));\n    setRelease(query.get< std::string >(3));\n    setArch(query.get< std::string >(4));\n}\n\nvoid\nRPMItem::dbInsert()\n{\n    \/\/ populates this->id\n    Item::save();\n\n    const char *sql =\n        \"INSERT INTO \"\n        \"  rpm \"\n        \"VALUES \"\n        \"  (?, ?, ?, ?, ?, ?)\";\n    SQLite3::Statement query(*conn.get(), sql);\n    query.bindv(getId(), getName(), getEpoch(), getVersion(), getRelease(), getArch());\n    query.step();\n}\n\nstatic TransactionItemPtr\ntransactionItemFromQuery(SQLite3Ptr conn, SQLite3::Query &query, int64_t transID)\n{\n    auto trans_item = std::make_shared< TransactionItem >(conn, transID);\n    auto item = std::make_shared< RPMItem >(conn);\n    trans_item->setItem(item);\n    trans_item->setId(query.get< int >(\"id\"));\n    trans_item->setAction(static_cast< TransactionItemAction >(query.get< int >(\"action\")));\n    trans_item->setReason(static_cast< TransactionItemReason >(query.get< int >(\"reason\")));\n    trans_item->setRepoid(query.get< std::string >(\"repoid\"));\n    trans_item->setState(static_cast< TransactionItemState >(query.get< int >(\"state\")));\n    item->setId(query.get< int >(\"item_id\"));\n    item->setName(query.get< std::string >(\"name\"));\n    item->setEpoch(query.get< int >(\"epoch\"));\n    item->setVersion(query.get< std::string >(\"version\"));\n    item->setRelease(query.get< std::string >(\"release\"));\n    item->setArch(query.get< std::string >(\"arch\"));\n    return trans_item;\n}\n\nstd::vector< TransactionItemPtr >\nRPMItem::getTransactionItems(SQLite3Ptr conn, int64_t transaction_id)\n{\n    std::vector< TransactionItemPtr > result;\n\n    const char *sql =\n        \"SELECT \"\n        \/\/ trans_item\n        \"  ti.id, \"\n        \"  ti.action, \"\n        \"  ti.reason, \"\n        \"  ti.state, \"\n        \/\/ repo\n        \"  r.repoid, \"\n        \/\/ rpm\n        \"  i.item_id, \"\n        \"  i.name, \"\n        \"  i.epoch, \"\n        \"  i.version, \"\n        \"  i.release, \"\n        \"  i.arch \"\n        \"FROM \"\n        \"  trans_item ti, \"\n        \"  repo r, \"\n        \"  rpm i \"\n        \"WHERE \"\n        \"  ti.trans_id = ? \"\n        \"  AND ti.repo_id = r.id \"\n        \"  AND ti.item_id = i.item_id\";\n    SQLite3::Query query(*conn.get(), sql);\n    query.bindv(transaction_id);\n\n    while (query.step() == SQLite3::Statement::StepResult::ROW) {\n        result.push_back(transactionItemFromQuery(conn, query, transaction_id));\n    }\n    return result;\n}\n\nstd::string\nRPMItem::getNEVRA() const\n{\n    \/\/ TODO: use string formatting\n    if (epoch > 0) {\n        return name + \"-\" + std::to_string(epoch) + \":\" + version + \"-\" + release + \".\" + arch;\n    }\n    return name + \"-\" + version + \"-\" + release + \".\" + arch;\n}\n\nstd::string\nRPMItem::toStr() const\n{\n    return getNEVRA();\n}\n\nvoid\nRPMItem::dbSelectOrInsert()\n{\n    const char *sql =\n        \"SELECT \"\n        \"  item_id \"\n        \"FROM \"\n        \"  rpm \"\n        \"WHERE \"\n        \"  name = ? \"\n        \"  AND epoch = ? \"\n        \"  AND version = ? \"\n        \"  AND release = ? \"\n        \"  AND arch = ?\";\n\n    SQLite3::Statement query(*conn.get(), sql);\n\n    query.bindv(getName(), getEpoch(), getVersion(), getRelease(), getArch());\n    SQLite3::Statement::StepResult result = query.step();\n\n    if (result == SQLite3::Statement::StepResult::ROW) {\n        setId(query.get< int >(0));\n    } else {\n        \/\/ insert and get the ID back\n        dbInsert();\n    }\n}\n\nTransactionItemPtr\nRPMItem::getTransactionItem(SQLite3Ptr conn, const std::string &nevra)\n{\n    Nevra nevraObject;\n    if (!nevraObject.parse(nevra.c_str(), HY_FORM_NEVRA)) {\n        return nullptr;\n    }\n    \/\/ TODO: hy_nevra_possibility should set epoch to 0 if epoch is not specified and HY_FORM_NEVRA\n    \/\/ is used\n    if (nevraObject.getEpoch() < 0) {\n        nevraObject.setEpoch(0);\n    }\n\n    const char *sql = R\"**(\n        SELECT\n            ti.trans_id,\n            ti.id,\n            ti.action,\n            ti.reason,\n            ti.state,\n            r.repoid,\n            i.item_id,\n            i.name,\n            i.epoch,\n            i.version,\n            i.release,\n            i.arch\n        FROM\n            trans_item ti,\n            repo r,\n            rpm i\n        WHERE\n            ti.repo_id = r.id\n            AND ti.item_id = i.item_id\n            AND i.name = ?\n            AND i.epoch = ?\n            AND i.version = ?\n            AND i.release = ?\n            AND i.arch = ?\n        ORDER BY\n           ti.id DESC\n        LIMIT 1\n    )**\";\n    SQLite3::Query query(*conn, sql);\n    query.bindv(nevraObject.getName(),\n                nevraObject.getEpoch(),\n                nevraObject.getVersion(),\n                nevraObject.getRelease(),\n                nevraObject.getArch());\n    if (query.step() == SQLite3::Statement::StepResult::ROW) {\n        return transactionItemFromQuery(conn, query, query.get< int64_t >(\"trans_id\"));\n    }\n    return nullptr;\n}\n\nTransactionItemReason\nRPMItem::resolveTransactionItemReason(SQLite3Ptr conn,\n                                      const std::string &name,\n                                      const std::string &arch,\n                                      int64_t maxTransactionId)\n{\n    \/\/ NOTE: All negative maxTransactionId values are treated the same. The\n    \/\/ method is called with maxTransactionId = -2 in a couple of places, the\n    \/\/ semantics here have been the same as with -1 for a long time. If it\n    \/\/ ain't broke...\n    std::string sql = R\"**(\n        SELECT\n            ti.action as action,\n            ti.reason as reason\n        FROM\n            trans_item ti\n        JOIN\n            trans t ON ti.trans_id = t.id\n        JOIN\n            rpm i USING (item_id)\n        WHERE\n            t.state = 1\n            \/* see comment in TransactionItem.hpp - TransactionItemAction *\/\n            AND ti.action not in (3, 5, 7, 10)\n            AND i.name = ?\n            AND i.arch = ?\n    )**\";\n\n    if (maxTransactionId >= 0) {\n        sql.append(\" AND ti.trans_id <= ?\");\n    }\n\n    sql.append(R\"**(\n        ORDER BY\n            ti.trans_id DESC\n        LIMIT 1\n    )**\");\n\n    if (arch != \"\") {\n        SQLite3::Query query(*conn, sql);\n        if (maxTransactionId >= 0) {\n            query.bindv(name, arch, maxTransactionId);\n        } else {\n            query.bindv(name, arch);\n        }\n\n        if (query.step() == SQLite3::Statement::StepResult::ROW) {\n            auto action = static_cast< TransactionItemAction >(query.get< int64_t >(\"action\"));\n            if (action == TransactionItemAction::REMOVE) {\n                return TransactionItemReason::UNKNOWN;\n            }\n            auto reason = static_cast< TransactionItemReason >(query.get< int64_t >(\"reason\"));\n            return reason;\n        }\n    } else {\n        const char *arch_sql = R\"**(\n            SELECT DISTINCT\n                arch\n            FROM\n                rpm\n            WHERE\n                name = ?\n        )**\";\n\n        SQLite3::Query arch_query(*conn, arch_sql);\n        arch_query.bindv(name);\n\n        TransactionItemReason result = TransactionItemReason::UNKNOWN;\n\n        while (arch_query.step() == SQLite3::Statement::StepResult::ROW) {\n            auto rpm_arch = arch_query.get< std::string >(\"arch\");\n\n            SQLite3::Query query(*conn, sql);\n            query.bindv(name, rpm_arch);\n            while (query.step() == SQLite3::Statement::StepResult::ROW) {\n                auto action = static_cast< TransactionItemAction >(query.get< int64_t >(\"action\"));\n                if (action == TransactionItemAction::REMOVE) {\n                    continue;\n                }\n                auto reason = static_cast< TransactionItemReason >(query.get< int64_t >(\"reason\"));\n                if (reason > result) {\n                    result = reason;\n                }\n            }\n        }\n        return result;\n    }\n    return TransactionItemReason::UNKNOWN;\n}\n\n\/**\n * Compare RPM packages\n * This method doesn't care about compare package names\n * \\param other RPMItem to compare with\n * \\return true if other package is newer (has higher version and\/or epoch)\n *\/\nbool\nRPMItem::operator<(const RPMItem &other) const\n{\n    \/\/ compare epochs\n    int32_t epochDif = other.getEpoch() - getEpoch();\n    if (epochDif > 0) {\n        return true;\n    } else if (epoch < 0) {\n        return false;\n    }\n\n    \/\/ compare versions\n    std::stringstream versionThis(getVersion());\n    std::stringstream versionOther(other.getVersion());\n\n    std::string bufferThis;\n    std::string bufferOther;\n    while (std::getline(versionThis, bufferThis, '.') &&\n           std::getline(versionOther, bufferOther, '.')) {\n        int subVersionThis = std::stoi(bufferThis);\n        int subVersionOther = std::stoi(bufferOther);\n        if (subVersionThis == subVersionOther) {\n            continue;\n        }\n        return subVersionOther > subVersionThis;\n    }\n    return false;\n}\n\nstd::vector< int64_t >\nRPMItem::searchTransactions(SQLite3Ptr conn, const std::vector< std::string > &patterns)\n{\n    std::vector< int64_t > result;\n\n    const char *sql = R\"**(\n        SELECT DISTINCT\n            t.id\n        FROM\n            trans t\n        JOIN\n            trans_item ti ON ti.trans_id = t.id\n        JOIN\n            rpm i USING (item_id)\n        WHERE\n            t.state = 1\n            AND (\n                i.name = ?\n                OR i.epoch = ?\n                OR i.version = ?\n                OR i.release = ?\n                OR i.arch = ?\n            )\n        ORDER BY\n           trans_id DESC\n    )**\";\n    SQLite3::Query query(*conn, sql);\n    for (auto pattern : patterns) {\n        query.bindv(pattern, pattern, pattern, pattern, pattern);\n        while (query.step() == SQLite3::Statement::StepResult::ROW) {\n            result.push_back(query.get< int64_t >(\"id\"));\n        }\n    }\n    std::sort(result.begin(), result.end());\n    auto last = std::unique(result.begin(), result.end());\n    result.erase(last, result.end());\n    return result;\n}\n\n} \/\/ namespace libdnf\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n *\n * This file is part of libkdepim.\n *\n * Copyright (C) 2008 Szymon Tomasz Stefanek <pragma@kvirc.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 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 \"foldertreewidget.h\"\n\n#include <KMenu>\n#include <KConfig>\n#include <KConfigGroup>\n#include <KLocale>\n\n#include <QHeaderView>\n\nnamespace KPIM {\n\nFolderTreeWidgetBase::FolderTreeWidgetBase( QWidget * parent, const char * name )\n: QTreeWidget( parent )\n{\n  setObjectName( name );\n  setColumnCount( 0 );\n\n  header()->setMovable( true );\n\n  setManualColumnHidingEnabled( true );\n}\n\nbool FolderTreeWidgetBase::saveLayout( KConfigGroup &group , const char * keyName )\n{\n  if( !keyName )\n    return false;\n\n  group.writeEntry( keyName , QVariant( header()->saveState() ) );\n\n  return true;\n}\n\nbool FolderTreeWidgetBase::saveLayout( KConfig * config , const char * groupName , const char * keyName )\n{\n  if( !config || !groupName || !keyName )\n    return false;\n\n  KConfigGroup group( config , groupName );\n  return saveLayout( group , keyName );\n}\n\nbool FolderTreeWidgetBase::restoreLayout( KConfigGroup &group , const char * keyName )\n{\n  if( !keyName )\n    return false;\n\n  \/\/ Restore the view column order, width and visibility\n  QByteArray state = group.readEntry(\n                             keyName , QVariant( QVariant::ByteArray )\n                         ).toByteArray();\n\n  if( state.isEmpty() )\n    return false;\n\n  \/\/ Qt writes also some options that can be set only\n  \/\/ programmatically. This can drive you crazy if you\n  \/\/ first setup the view and then restore the layout:\n  \/\/ it will overwrite your previous settings...\n\n  bool sectionsWereClickable = header()->isClickable();\n  bool sectionsWereMovable = header()->isMovable();\n  bool lastSectionWasStretched = header()->stretchLastSection();\n  bool sortIndicatorWasShown = header()->isSortIndicatorShown();\n  Qt::Alignment originalDefaultAlignment = header()->defaultAlignment();\n  int defaultSectionSize = header()->defaultSectionSize();\n  int minimumSectionSize = header()->minimumSectionSize();\n  bool cascadingSectionResizes = header()->cascadingSectionResizes();\n\n  if ( !header()->restoreState( state ) )\n    return false;\n\n\n  header()->setClickable( sectionsWereClickable );\n  header()->setMovable( sectionsWereMovable );\n  header()->setSortIndicatorShown( sortIndicatorWasShown );\n  header()->setDefaultAlignment( originalDefaultAlignment );\n  header()->setMinimumSectionSize( minimumSectionSize );\n  header()->setCascadingSectionResizes( cascadingSectionResizes );\n  \/\/ FIXME: This would cause the sections to be resized and thus\n  \/\/        can't be reliably reset after the configuration\n  \/\/        has been read. Can do nothing about that except warning\n  \/\/        the user in the docs.\n  \/\/header()->setDefaultSectionSize( defaultSectionSize );\n  \/\/header()->setStretchLastSection( lastSectionWasStretched ); \n\n  return true;\n}\n\nbool FolderTreeWidgetBase::restoreLayout( KConfig * config , const char * groupName , const char * keyName )\n{\n  if( !config || !groupName || !keyName )\n    return false;\n\n  if ( !config->hasGroup( groupName ) )\n    return false;\n\n  KConfigGroup group( config , groupName );\n  return restoreLayout( group , keyName );\n}\n\nvoid FolderTreeWidgetBase::setManualColumnHidingEnabled( bool enable )\n{\n  if( enable )\n  {\n     header()->setContextMenuPolicy( Qt::CustomContextMenu ); \/\/ make sure it's true\n     QObject::connect( header(), SIGNAL( customContextMenuRequested( const QPoint& ) ),\n                       this, SLOT( slotHeaderContextMenuRequested( const QPoint& ) ) );\n  } else {\n     if ( mEnableManualColumnHiding )\n         QObject::disconnect( header(), SIGNAL( customContextMenuRequested( const QPoint& ) ),\n                              this, SLOT( slotHeaderContextMenuRequested( const QPoint& ) ) );\n  }\n\n  mEnableManualColumnHiding = enable;\n}\n\nvoid FolderTreeWidgetBase::setColumnHidden( int logicalIndex, bool hide )\n{\n  header()->setSectionHidden( logicalIndex , hide );\n}\n\nbool FolderTreeWidgetBase::isColumnHidden( int logicalIndex ) const\n{\n  return header()->isSectionHidden( logicalIndex );\n}\n\n#define KFOLDERTREEWIDGETBASE_COLUMN_ACTION_ID_BASE 0x10000\n\nbool FolderTreeWidgetBase::fillHeaderContextMenu( KMenu * menu , const QPoint & )\n{\n  if ( !menu || !mEnableManualColumnHiding )\n    return false;\n\n  menu->addTitle( i18n(\"View Columns\") );\n\n  QTreeWidgetItem * hitem = headerItem();\n  if ( !hitem )\n    return false; \/\/ oops..\n\n  \/\/ Dynamically build the menu and check the items for visible columns\n  int cc = hitem->columnCount();\n  if ( cc < 1 )\n    return false;\n\n  for ( int i = 1 ; i < cc; i++ )\n  {\n    QAction * act = menu->addAction( hitem->text( i ) );\n    act->setCheckable( true );\n    if ( !header()->isSectionHidden( i ) )\n        act->setChecked( true );\n    act->setData( QVariant( KFOLDERTREEWIDGETBASE_COLUMN_ACTION_ID_BASE + i ) );\n  }\n\n  return true;\n}\n\nvoid FolderTreeWidgetBase::slotToggleColumnActionTriggered( QAction *act )\n{\n  if ( !act )\n    return;\n\n  QVariant data = act->data();\n\n  bool ok;\n  int id = data.toInt( &ok );\n  if ( !ok )\n    return;\n\n  if ( id <= KFOLDERTREEWIDGETBASE_COLUMN_ACTION_ID_BASE )\n    return;\n\n  id -= KFOLDERTREEWIDGETBASE_COLUMN_ACTION_ID_BASE;\n\n  if ( id > columnCount() )\n    return;\n\n  header()->setSectionHidden( id , !act->isChecked() );\n}\n\nvoid FolderTreeWidgetBase::slotHeaderContextMenuRequested( const QPoint &clickPoint )\n{\n  KMenu menu( this );\n\n  if ( !fillHeaderContextMenu( &menu , clickPoint ) )\n    return;\n\n  connect( &menu , SIGNAL( triggered( QAction* ) ) ,\n           this , SLOT( slotToggleColumnActionTriggered( QAction* ) ) );\n\n  menu.exec( header()->mapToGlobal( clickPoint ) );\n}\n\nint FolderTreeWidgetBase::addColumn( const QString &label )\n{\n  QTreeWidgetItem * hitem = headerItem();\n  if ( !hitem )\n  {\n    \/\/ In fact this seems to never happen\n    hitem = new QTreeWidgetItem( this );\n    hitem->setText( 0 , label );\n    setHeaderItem( hitem ); \/\/ will set column count to 1\n    return 0;\n  }\n\n  int cc = columnCount();\n\n  setColumnCount( cc + 1 );\n  hitem->setText( cc , label );\n  return cc;\n}\n\nbool FolderTreeWidgetBase::setColumnText( int columnIndex , const QString &label )\n{\n  if ( columnIndex >= columnCount() )\n    return false;\n  QTreeWidgetItem * hitem = headerItem();\n  if ( !hitem )\n    return false;\n  hitem->setText( columnIndex , label );\n  return true;\n}\n\n\n\n\n\n\nFolderTreeWidget::FolderTreeWidget( QWidget *parent , const char *name )\n: FolderTreeWidgetBase( parent , name )\n{\n  setAlternatingRowColors( true );\n  setAcceptDrops( true );\n  setAllColumnsShowFocus( true );\n  setRootIsDecorated( true );\n  setSortingEnabled( true );\n  header()->setSortIndicatorShown( true );\n  header()->setClickable( true );\n  \/\/setSelectionMode( Extended );\n}\n\n\n\n\nFolderTreeWidgetItem::FolderTreeWidgetItem(\n        FolderTreeWidget *parent,\n        const QString &label,\n        Protocol protocol,\n        FolderType folderType\n    ) : QTreeWidgetItem( parent ), mProtocol(protocol), mFolderType(folderType)\n{\n}\n\nFolderTreeWidgetItem::FolderTreeWidgetItem(\n        FolderTreeWidgetItem *parent,\n        const QString &label,\n        Protocol protocol,\n        FolderType folderType,\n        int unread,\n        int total\n    ) : QTreeWidgetItem( parent ), mProtocol(protocol), mFolderType(folderType)\n{\n}\n\nbool FolderTreeWidgetItem::operator < ( const QTreeWidgetItem &other ) const\n{\n  int sortCol = treeWidget()->sortColumn();\n  if ( sortCol < 0 )\n     return true; \/\/ just \"yes\" :D\n\n  \/\/ WIP\n\n  return text(sortCol) < other.text(sortCol);\n}\n\n};\n<commit_msg>compile with -pedantic<commit_after>\/******************************************************************************\n *\n * This file is part of libkdepim.\n *\n * Copyright (C) 2008 Szymon Tomasz Stefanek <pragma@kvirc.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 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 \"foldertreewidget.h\"\n\n#include <KMenu>\n#include <KConfig>\n#include <KConfigGroup>\n#include <KLocale>\n\n#include <QHeaderView>\n\nnamespace KPIM {\n\nFolderTreeWidgetBase::FolderTreeWidgetBase( QWidget * parent, const char * name )\n: QTreeWidget( parent )\n{\n  setObjectName( name );\n  setColumnCount( 0 );\n\n  header()->setMovable( true );\n\n  setManualColumnHidingEnabled( true );\n}\n\nbool FolderTreeWidgetBase::saveLayout( KConfigGroup &group , const char * keyName )\n{\n  if( !keyName )\n    return false;\n\n  group.writeEntry( keyName , QVariant( header()->saveState() ) );\n\n  return true;\n}\n\nbool FolderTreeWidgetBase::saveLayout( KConfig * config , const char * groupName , const char * keyName )\n{\n  if( !config || !groupName || !keyName )\n    return false;\n\n  KConfigGroup group( config , groupName );\n  return saveLayout( group , keyName );\n}\n\nbool FolderTreeWidgetBase::restoreLayout( KConfigGroup &group , const char * keyName )\n{\n  if( !keyName )\n    return false;\n\n  \/\/ Restore the view column order, width and visibility\n  QByteArray state = group.readEntry(\n                             keyName , QVariant( QVariant::ByteArray )\n                         ).toByteArray();\n\n  if( state.isEmpty() )\n    return false;\n\n  \/\/ Qt writes also some options that can be set only\n  \/\/ programmatically. This can drive you crazy if you\n  \/\/ first setup the view and then restore the layout:\n  \/\/ it will overwrite your previous settings...\n\n  bool sectionsWereClickable = header()->isClickable();\n  bool sectionsWereMovable = header()->isMovable();\n  bool lastSectionWasStretched = header()->stretchLastSection();\n  bool sortIndicatorWasShown = header()->isSortIndicatorShown();\n  Qt::Alignment originalDefaultAlignment = header()->defaultAlignment();\n  int defaultSectionSize = header()->defaultSectionSize();\n  int minimumSectionSize = header()->minimumSectionSize();\n  bool cascadingSectionResizes = header()->cascadingSectionResizes();\n\n  if ( !header()->restoreState( state ) )\n    return false;\n\n\n  header()->setClickable( sectionsWereClickable );\n  header()->setMovable( sectionsWereMovable );\n  header()->setSortIndicatorShown( sortIndicatorWasShown );\n  header()->setDefaultAlignment( originalDefaultAlignment );\n  header()->setMinimumSectionSize( minimumSectionSize );\n  header()->setCascadingSectionResizes( cascadingSectionResizes );\n  \/\/ FIXME: This would cause the sections to be resized and thus\n  \/\/        can't be reliably reset after the configuration\n  \/\/        has been read. Can do nothing about that except warning\n  \/\/        the user in the docs.\n  \/\/header()->setDefaultSectionSize( defaultSectionSize );\n  \/\/header()->setStretchLastSection( lastSectionWasStretched ); \n\n  return true;\n}\n\nbool FolderTreeWidgetBase::restoreLayout( KConfig * config , const char * groupName , const char * keyName )\n{\n  if( !config || !groupName || !keyName )\n    return false;\n\n  if ( !config->hasGroup( groupName ) )\n    return false;\n\n  KConfigGroup group( config , groupName );\n  return restoreLayout( group , keyName );\n}\n\nvoid FolderTreeWidgetBase::setManualColumnHidingEnabled( bool enable )\n{\n  if( enable )\n  {\n     header()->setContextMenuPolicy( Qt::CustomContextMenu ); \/\/ make sure it's true\n     QObject::connect( header(), SIGNAL( customContextMenuRequested( const QPoint& ) ),\n                       this, SLOT( slotHeaderContextMenuRequested( const QPoint& ) ) );\n  } else {\n     if ( mEnableManualColumnHiding )\n         QObject::disconnect( header(), SIGNAL( customContextMenuRequested( const QPoint& ) ),\n                              this, SLOT( slotHeaderContextMenuRequested( const QPoint& ) ) );\n  }\n\n  mEnableManualColumnHiding = enable;\n}\n\nvoid FolderTreeWidgetBase::setColumnHidden( int logicalIndex, bool hide )\n{\n  header()->setSectionHidden( logicalIndex , hide );\n}\n\nbool FolderTreeWidgetBase::isColumnHidden( int logicalIndex ) const\n{\n  return header()->isSectionHidden( logicalIndex );\n}\n\n#define KFOLDERTREEWIDGETBASE_COLUMN_ACTION_ID_BASE 0x10000\n\nbool FolderTreeWidgetBase::fillHeaderContextMenu( KMenu * menu , const QPoint & )\n{\n  if ( !menu || !mEnableManualColumnHiding )\n    return false;\n\n  menu->addTitle( i18n(\"View Columns\") );\n\n  QTreeWidgetItem * hitem = headerItem();\n  if ( !hitem )\n    return false; \/\/ oops..\n\n  \/\/ Dynamically build the menu and check the items for visible columns\n  int cc = hitem->columnCount();\n  if ( cc < 1 )\n    return false;\n\n  for ( int i = 1 ; i < cc; i++ )\n  {\n    QAction * act = menu->addAction( hitem->text( i ) );\n    act->setCheckable( true );\n    if ( !header()->isSectionHidden( i ) )\n        act->setChecked( true );\n    act->setData( QVariant( KFOLDERTREEWIDGETBASE_COLUMN_ACTION_ID_BASE + i ) );\n  }\n\n  return true;\n}\n\nvoid FolderTreeWidgetBase::slotToggleColumnActionTriggered( QAction *act )\n{\n  if ( !act )\n    return;\n\n  QVariant data = act->data();\n\n  bool ok;\n  int id = data.toInt( &ok );\n  if ( !ok )\n    return;\n\n  if ( id <= KFOLDERTREEWIDGETBASE_COLUMN_ACTION_ID_BASE )\n    return;\n\n  id -= KFOLDERTREEWIDGETBASE_COLUMN_ACTION_ID_BASE;\n\n  if ( id > columnCount() )\n    return;\n\n  header()->setSectionHidden( id , !act->isChecked() );\n}\n\nvoid FolderTreeWidgetBase::slotHeaderContextMenuRequested( const QPoint &clickPoint )\n{\n  KMenu menu( this );\n\n  if ( !fillHeaderContextMenu( &menu , clickPoint ) )\n    return;\n\n  connect( &menu , SIGNAL( triggered( QAction* ) ) ,\n           this , SLOT( slotToggleColumnActionTriggered( QAction* ) ) );\n\n  menu.exec( header()->mapToGlobal( clickPoint ) );\n}\n\nint FolderTreeWidgetBase::addColumn( const QString &label )\n{\n  QTreeWidgetItem * hitem = headerItem();\n  if ( !hitem )\n  {\n    \/\/ In fact this seems to never happen\n    hitem = new QTreeWidgetItem( this );\n    hitem->setText( 0 , label );\n    setHeaderItem( hitem ); \/\/ will set column count to 1\n    return 0;\n  }\n\n  int cc = columnCount();\n\n  setColumnCount( cc + 1 );\n  hitem->setText( cc , label );\n  return cc;\n}\n\nbool FolderTreeWidgetBase::setColumnText( int columnIndex , const QString &label )\n{\n  if ( columnIndex >= columnCount() )\n    return false;\n  QTreeWidgetItem * hitem = headerItem();\n  if ( !hitem )\n    return false;\n  hitem->setText( columnIndex , label );\n  return true;\n}\n\n\n\n\n\n\nFolderTreeWidget::FolderTreeWidget( QWidget *parent , const char *name )\n: FolderTreeWidgetBase( parent , name )\n{\n  setAlternatingRowColors( true );\n  setAcceptDrops( true );\n  setAllColumnsShowFocus( true );\n  setRootIsDecorated( true );\n  setSortingEnabled( true );\n  header()->setSortIndicatorShown( true );\n  header()->setClickable( true );\n  \/\/setSelectionMode( Extended );\n}\n\n\n\n\nFolderTreeWidgetItem::FolderTreeWidgetItem(\n        FolderTreeWidget *parent,\n        const QString &label,\n        Protocol protocol,\n        FolderType folderType\n    ) : QTreeWidgetItem( parent ), mProtocol(protocol), mFolderType(folderType)\n{\n}\n\nFolderTreeWidgetItem::FolderTreeWidgetItem(\n        FolderTreeWidgetItem *parent,\n        const QString &label,\n        Protocol protocol,\n        FolderType folderType,\n        int unread,\n        int total\n    ) : QTreeWidgetItem( parent ), mProtocol(protocol), mFolderType(folderType)\n{\n}\n\nbool FolderTreeWidgetItem::operator < ( const QTreeWidgetItem &other ) const\n{\n  int sortCol = treeWidget()->sortColumn();\n  if ( sortCol < 0 )\n     return true; \/\/ just \"yes\" :D\n\n  \/\/ WIP\n\n  return text(sortCol) < other.text(sortCol);\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    kopeteaway.cpp  -  Kopete Away Action\n\n    Copyright (c) 2003     Jason Keirstead   <jason@keirstead.org>\n\n    Kopete    (c) 2002-2005 by the Kopete developers  <kopete-devel@kde.org>\n\n    *************************************************************************\n    *                                                                       *\n    * This library is free software; you can redistribute it and\/or         *\n    * modify it under the terms of the GNU Lesser General Public            *\n    * License as published by the Free Software Foundation; either          *\n    * version 2 of the License, or (at your option) any later version.      *\n    *                                                                       *\n    *************************************************************************\n*\/\n\n#include <klocale.h>\n#include <kdeversion.h>\n#include <kinputdialog.h>\n#include <kstringhandler.h>\n\n#include \"kopeteawayaction.h\"\n#include \"kopeteaway.h\"\n#include \"kopeteonlinestatus.h\"\n\n\nnamespace Kopete {\n\nclass AwayAction::Private\n{\npublic:\n\tPrivate(const OnlineStatus& s) : reasonCount(0) , status(s) {};\n\tint reasonCount;\n\tOnlineStatus status;\n};\n\n\nAwayAction::AwayAction(const QString &text, const QIconSet &pix, const KShortcut &cut,\n\tconst QObject *receiver, const char *slot, QObject *parent, const char *name )\n\t: KSelectAction(text, pix, cut, parent, name ) , d(new Private( OnlineStatus() ) )\n{\n\tQObject::connect( Kopete::Away::getInstance(), SIGNAL( messagesChanged() ),\n\t\tthis, SLOT( slotAwayChanged() ) );\n\n\tQObject::connect( this, SIGNAL( awayMessageSelected( const QString & ) ),\n\t\treceiver, slot );\n\n\tQObject::connect( this, SIGNAL( activated( int ) ),\n\t\tthis, SLOT( slotSelectAway( int ) ) );\n\n\tslotAwayChanged();\n}\n\nAwayAction::AwayAction( const OnlineStatus& status, const QString &text, const QIconSet &pix, const KShortcut &cut,\n\t\t\t\t\t   const QObject *receiver, const char *slot, QObject *parent, const char *name )\n\t: KSelectAction(text, pix, cut, parent, name ) , d(new Private( status ) )\n{\n\tQObject::connect( Kopete::Away::getInstance(), SIGNAL( messagesChanged() ),\n\t\t\t\t\t  this, SLOT( slotAwayChanged() ) );\n\n\tQObject::connect( this, SIGNAL( awayMessageSelected( const Kopete::OnlineStatus &, const QString & ) ),\n\t\t\t\t\t  receiver, slot );\n\n\tQObject::connect( this, SIGNAL( activated( int ) ),\n\t\t\t\t\t  this, SLOT( slotSelectAway( int ) ) );\n\n\tslotAwayChanged();\n}\n\nAwayAction::~AwayAction()\n{\n\tdelete d;\n}\n\nvoid AwayAction::slotAwayChanged()\n{\n\tQStringList awayMessages = Kopete::Away::getInstance()->getMessages();\n\tfor( QStringList::iterator it = awayMessages.begin(); it != awayMessages.end(); ++it )\n\t{\n\t\t(*it) = KStringHandler::rsqueeze( *it );\n\t}\n\td->reasonCount = awayMessages.count();\n\tQStringList menu;\n\tmenu << i18n( \"No Message\" );\n\tmenu << i18n( \"New Message...\" );\n\tmenu << QString::null ;  \/\/separator\n\tmenu += awayMessages ;\n\tsetItems( menu );\n\tsetCurrentItem( -1 );\n}\n\nvoid AwayAction::slotSelectAway( int index )\n{\n\tKopete::Away *mAway = Kopete::Away::getInstance();\n\tQString awayReason;\n\n\t\/\/ Index == -1 means this is a result of Global Away all.\n\t\/\/ Use the last entered message (0)\n\tif( index == -1 )\n\t\tindex = 0;\n\t\n\tswitch(index)\n\t{\n\t\tcase 0:\n\t\t\tawayReason = QString::null;\n\t\t\tbreak;\n\t\tcase 1:\n\t\t\tbool ok;\n\t\t\tawayReason = KInputDialog::getText( i18n( \"New Away Message\" ), i18n( \"Please enter your away reason:\" ) , QString::null , &ok );\n\t\t\tif(!ok) \/\/the user canceled\n\t\t\t\treturn;\n\t\t\tif( !awayReason.isEmpty() )\n\t\t\t\tKopete::Away::getInstance()->addMessage( awayReason );\n\t\t\tbreak;\n\t\tcase 2:\n\t\t\t\/\/not possible case, that's a separator\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tif( index-3 < d->reasonCount )\n\t\t\t\tawayReason = mAway->getMessage( index-3 );\n\t}\n\n\temit awayMessageSelected( awayReason ) ;\n\temit awayMessageSelected( d->status, awayReason );\n\tsetCurrentItem( -1 );\n}\n\n} \/\/END namespace Kopete\n\n#include \"kopeteawayaction.moc\"\n\n<commit_msg>Fix Bug 119862: if you press escape or cancel in the new message status-window there is a checkbox next to it and you can't click on it anymore BUG: 119862<commit_after>\/*\n    kopeteaway.cpp  -  Kopete Away Action\n\n    Copyright (c) 2003     Jason Keirstead   <jason@keirstead.org>\n\n    Kopete    (c) 2002-2005 by the Kopete developers  <kopete-devel@kde.org>\n\n    *************************************************************************\n    *                                                                       *\n    * This library is free software; you can redistribute it and\/or         *\n    * modify it under the terms of the GNU Lesser General Public            *\n    * License as published by the Free Software Foundation; either          *\n    * version 2 of the License, or (at your option) any later version.      *\n    *                                                                       *\n    *************************************************************************\n*\/\n\n#include <klocale.h>\n#include <kdeversion.h>\n#include <kinputdialog.h>\n#include <kstringhandler.h>\n\n#include \"kopeteawayaction.h\"\n#include \"kopeteaway.h\"\n#include \"kopeteonlinestatus.h\"\n\n\nnamespace Kopete {\n\nclass AwayAction::Private\n{\npublic:\n\tPrivate(const OnlineStatus& s) : reasonCount(0) , status(s) {};\n\tint reasonCount;\n\tOnlineStatus status;\n};\n\n\nAwayAction::AwayAction(const QString &text, const QIconSet &pix, const KShortcut &cut,\n\tconst QObject *receiver, const char *slot, QObject *parent, const char *name )\n\t: KSelectAction(text, pix, cut, parent, name ) , d(new Private( OnlineStatus() ) )\n{\n\tQObject::connect( Kopete::Away::getInstance(), SIGNAL( messagesChanged() ),\n\t\tthis, SLOT( slotAwayChanged() ) );\n\n\tQObject::connect( this, SIGNAL( awayMessageSelected( const QString & ) ),\n\t\treceiver, slot );\n\n\tQObject::connect( this, SIGNAL( activated( int ) ),\n\t\tthis, SLOT( slotSelectAway( int ) ) );\n\n\tslotAwayChanged();\n}\n\nAwayAction::AwayAction( const OnlineStatus& status, const QString &text, const QIconSet &pix, const KShortcut &cut,\n\t\t\t\t\t   const QObject *receiver, const char *slot, QObject *parent, const char *name )\n\t: KSelectAction(text, pix, cut, parent, name ) , d(new Private( status ) )\n{\n\tQObject::connect( Kopete::Away::getInstance(), SIGNAL( messagesChanged() ),\n\t\t\t\t\t  this, SLOT( slotAwayChanged() ) );\n\n\tQObject::connect( this, SIGNAL( awayMessageSelected( const Kopete::OnlineStatus &, const QString & ) ),\n\t\t\t\t\t  receiver, slot );\n\n\tQObject::connect( this, SIGNAL( activated( int ) ),\n\t\t\t\t\t  this, SLOT( slotSelectAway( int ) ) );\n\n\tslotAwayChanged();\n}\n\nAwayAction::~AwayAction()\n{\n\tdelete d;\n}\n\nvoid AwayAction::slotAwayChanged()\n{\n\tQStringList awayMessages = Kopete::Away::getInstance()->getMessages();\n\tfor( QStringList::iterator it = awayMessages.begin(); it != awayMessages.end(); ++it )\n\t{\n\t\t(*it) = KStringHandler::rsqueeze( *it );\n\t}\n\td->reasonCount = awayMessages.count();\n\tQStringList menu;\n\tmenu << i18n( \"No Message\" );\n\tmenu << i18n( \"New Message...\" );\n\tmenu << QString::null ;  \/\/separator\n\tmenu += awayMessages ;\n\tsetItems( menu );\n\tsetCurrentItem( -1 );\n}\n\nvoid AwayAction::slotSelectAway( int index )\n{\n\t\/\/remove that crappy check mark  cf bug 119862\n\tsetCurrentItem( -1 );\n\t\n\tKopete::Away *mAway = Kopete::Away::getInstance();\n\tQString awayReason;\n\n\t\/\/ Index == -1 means this is a result of Global Away all.\n\t\/\/ Use the last entered message (0)\n\tif( index == -1 )\n\t\tindex = 0;\n\t\n\tswitch(index)\n\t{\n\t\tcase 0:\n\t\t\tawayReason = QString::null;\n\t\t\tbreak;\n\t\tcase 1:\n\t\t\tbool ok;\n\t\t\tawayReason = KInputDialog::getText( i18n( \"New Away Message\" ), i18n( \"Please enter your away reason:\" ) , QString::null , &ok );\n\t\t\tif(!ok) \/\/the user canceled\n\t\t\t\treturn;\n\t\t\tif( !awayReason.isEmpty() )\n\t\t\t\tKopete::Away::getInstance()->addMessage( awayReason );\n\t\t\tbreak;\n\t\tcase 2:\n\t\t\t\/\/not possible case, that's a separator\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tif( index-3 < d->reasonCount )\n\t\t\t\tawayReason = mAway->getMessage( index-3 );\n\t}\n\n\temit awayMessageSelected( awayReason ) ;\n\temit awayMessageSelected( d->status, awayReason );\n}\n\n} \/\/END namespace Kopete\n\n#include \"kopeteawayaction.moc\"\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"..\/stdafx.h\"\r\n\r\n#include <node_buffer.h>\r\n\r\n#include \"wkey.h\"\r\n\r\nvoid WKey::Init(v8::Handle<v8::Object> exports){\r\n\tMETHOD_BEGIN();\r\n\r\n\tv8::Local<v8::String> className = Nan::New(\"Key\").ToLocalChecked();\r\n\r\n\t\/\/ Basic instance setup\r\n\tv8::Local<v8::FunctionTemplate> tpl = Nan::New<v8::FunctionTemplate>(New);\r\n\r\n\ttpl->SetClassName(className);\r\n\ttpl->InstanceTemplate()->SetInternalFieldCount(1); \/\/ req'd by ObjectWrap\r\n\r\n\tNan::SetPrototypeMethod(tpl, \"generate\", Generate);\r\n\tNan::SetPrototypeMethod(tpl, \"compare\", Compare);\r\n\tNan::SetPrototypeMethod(tpl, \"duplicate\", Duplicate);\r\n\r\n\tNan::SetPrototypeMethod(tpl, \"readPrivateKey\", ReadPrivateKey);\r\n\tNan::SetPrototypeMethod(tpl, \"writePrivateKey\", WritePrivateKey);\r\n\r\n\tNan::SetPrototypeMethod(tpl, \"readPublicKey\", ReadPublicKey);\r\n\tNan::SetPrototypeMethod(tpl, \"writePublicKey\", WritePublicKey);\r\n\r\n\t\/\/ Store the constructor in the target bindings.\r\n\tconstructor().Reset(Nan::GetFunction(tpl).ToLocalChecked());\r\n\r\n\texports->Set(className, tpl->GetFunction());\r\n}\r\n\r\nNAN_METHOD(WKey::New){\r\n\tMETHOD_BEGIN();\r\n\r\n\ttry{\r\n\t\tWKey *obj = new WKey();\r\n\t\tobj->data_ = new Key();\r\n\r\n\t\tobj->Wrap(info.This());\r\n\r\n\t\tinfo.GetReturnValue().Set(info.This());\r\n\t\treturn;\r\n\t}\r\n\tTRY_END();\r\n}\r\n\r\nNAN_METHOD(WKey::Generate){\r\n\tMETHOD_BEGIN();\r\n\r\n\ttry{\r\n\t\tLOGGER_ARG(\"format\");\r\n\t\tint format = info[0]->ToNumber()->Int32Value();\r\n\r\n\t\tLOGGER_ARG(\"pubExp\");\r\n\t\tint pubExp = info[1]->ToNumber()->Int32Value();\r\n\r\n\t\tLOGGER_ARG(\"keySize\");\r\n\t\tint keySize = info[2]->ToNumber()->Int32Value();\r\n\r\n\t\tUNWRAP_DATA(Key);\r\n\r\n\t\tHandle<Key> key = _this->generate(DataFormat::get(format), PublicExponent::get(pubExp), keySize);\r\n\t\tv8::Local<v8::Object> v8Key = WKey::NewInstance(key);\r\n\t\tinfo.GetReturnValue().Set(v8Key);\r\n\r\n\t\treturn;\r\n\t}\r\n\tTRY_END();\r\n}\r\n\r\nNAN_METHOD(WKey::Compare) {\r\n\tMETHOD_BEGIN();\r\n\r\n\ttry {\r\n\t\tUNWRAP_DATA(Key);\r\n\r\n\t\tLOGGER_ARG(\"key\");\r\n\t\tWKey * wKey = WKey::Unwrap<WKey>(info[0]->ToObject());\r\n\t\t\r\n\t\tint res = _this->compare(wKey->data_);\r\n\r\n\t\tv8::Local<v8::Number> v8Number = Nan::New<v8::Number>(res);\r\n\r\n\t\tinfo.GetReturnValue().Set(v8Number);\r\n\t\treturn;\r\n\t}\r\n\tTRY_END();\r\n}\r\n\r\nNAN_METHOD(WKey::Duplicate)\r\n{\r\n\tMETHOD_BEGIN();\r\n\r\n\ttry {\r\n\t\tUNWRAP_DATA(Key);\r\n\r\n\t\tHandle<Key> key = _this->duplicate();\r\n\t\tv8::Local<v8::Object> v8Key = WKey::NewInstance(key);\r\n\t\tinfo.GetReturnValue().Set(v8Key);\r\n\r\n\t\tinfo.GetReturnValue().Set(v8Key);\r\n\t\treturn;\r\n\t}\r\n\tTRY_END();\r\n}\r\n\r\nNAN_METHOD(WKey::ReadPrivateKey){\r\n\tMETHOD_BEGIN();\r\n\r\n\ttry{\r\n\t\tLOGGER_ARG(\"filename\");\r\n\t\tv8::String::Utf8Value v8Name(info[0]->ToString());\r\n\t\tchar *filename = *v8Name;\r\n\r\n\t\tLOGGER_ARG(\"format\");\r\n\t\tint format = info[1]->ToNumber()->Int32Value();\r\n\r\n\t\tLOGGER_ARG(\"password\");\r\n\t\tv8::String::Utf8Value v8Pass(info[2]->ToString());\r\n\t\tchar *password = *v8Pass;\r\n\r\n\t\tHandle<Bio> in = NULL;\r\n\r\n\t\tin = new Bio(BIO_TYPE_FILE, filename, \"rb\");\r\n\r\n\t\tUNWRAP_DATA(Key);\r\n\r\n\t\t_this->readPrivateKey(in, DataFormat::get(format), new std::string(password));\r\n\r\n\t\tinfo.GetReturnValue().Set(info.This());\r\n\t\treturn;\r\n\t}\r\n\tTRY_END();\r\n}\r\n\r\nNAN_METHOD(WKey::ReadPublicKey){\r\n\tMETHOD_BEGIN();\r\n\r\n\ttry{\r\n\t\tv8::String::Utf8Value v8Str(info[0]->ToString());\r\n\t\tchar *filename = *v8Str;\r\n\r\n\t\tLOGGER_ARG(\"format\");\r\n\t\tint format = info[1]->ToNumber()->Int32Value();\r\n\r\n\t\tHandle<Bio> in = NULL;\r\n\r\n\t\tin = new Bio(BIO_TYPE_FILE, filename, \"rb\");\r\n\r\n\t\tUNWRAP_DATA(Key);\r\n\r\n\t\t_this->readPublicKey(in, DataFormat::get(format));\r\n\r\n\t\tinfo.GetReturnValue().Set(info.This());\r\n\t\treturn;\r\n\t}\r\n\tTRY_END();\r\n}\r\n\r\nNAN_METHOD(WKey::WritePrivateKey) {\r\n\tMETHOD_BEGIN();\r\n\r\n\ttry {\r\n\t\tLOGGER_ARG(\"filename\");\r\n\t\tv8::String::Utf8Value v8Filename(info[0]->ToString());\r\n\t\tchar *filename = *v8Filename;\r\n\r\n\t\tLOGGER_ARG(\"format\");\r\n\t\tint format = info[1]->ToNumber()->Int32Value();\r\n\r\n\t\tLOGGER_ARG(\"password\");\r\n\t\tv8::String::Utf8Value v8Pass(info[2]->ToString());\r\n\t\tchar *password = *v8Pass;\r\n\r\n\t\tHandle<Bio> out = new Bio(BIO_TYPE_FILE, filename, \"wb\");\r\n\r\n\t\tUNWRAP_DATA(Key);\r\n\r\n\t\t_this->writePrivateKey(out, DataFormat::get(format), new std::string(password));\r\n\r\n\t\tinfo.GetReturnValue().Set(info.This());\r\n\t\treturn;\r\n\t}\r\n\tTRY_END();\r\n}\r\n\r\nNAN_METHOD(WKey::WritePublicKey) {\r\n\tMETHOD_BEGIN();\r\n\r\n\ttry {\r\n\t\tLOGGER_ARG(\"filename\");\r\n\t\tv8::String::Utf8Value v8Filename(info[0]->ToString());\r\n\t\tchar *filename = *v8Filename;\r\n\r\n\t\tLOGGER_ARG(\"format\");\r\n\t\tint format = info[1]->ToNumber()->Int32Value();\r\n\r\n\t\tHandle<Bio> out = new Bio(BIO_TYPE_FILE, filename, \"wb\");\r\n\r\n\t\tUNWRAP_DATA(Key);\r\n\r\n\t\t_this->writePublicKey(out, DataFormat::get(format));\r\n\r\n\t\tinfo.GetReturnValue().Set(info.This());\r\n\t\treturn;\r\n\t}\r\n\tTRY_END();\r\n}\r\n<commit_msg>add check password args<commit_after>#include \"..\/stdafx.h\"\r\n\r\n#include <node_buffer.h>\r\n\r\n#include \"wkey.h\"\r\n\r\nvoid WKey::Init(v8::Handle<v8::Object> exports){\r\n\tMETHOD_BEGIN();\r\n\r\n\tv8::Local<v8::String> className = Nan::New(\"Key\").ToLocalChecked();\r\n\r\n\t\/\/ Basic instance setup\r\n\tv8::Local<v8::FunctionTemplate> tpl = Nan::New<v8::FunctionTemplate>(New);\r\n\r\n\ttpl->SetClassName(className);\r\n\ttpl->InstanceTemplate()->SetInternalFieldCount(1); \/\/ req'd by ObjectWrap\r\n\r\n\tNan::SetPrototypeMethod(tpl, \"generate\", Generate);\r\n\tNan::SetPrototypeMethod(tpl, \"compare\", Compare);\r\n\tNan::SetPrototypeMethod(tpl, \"duplicate\", Duplicate);\r\n\r\n\tNan::SetPrototypeMethod(tpl, \"readPrivateKey\", ReadPrivateKey);\r\n\tNan::SetPrototypeMethod(tpl, \"writePrivateKey\", WritePrivateKey);\r\n\r\n\tNan::SetPrototypeMethod(tpl, \"readPublicKey\", ReadPublicKey);\r\n\tNan::SetPrototypeMethod(tpl, \"writePublicKey\", WritePublicKey);\r\n\r\n\t\/\/ Store the constructor in the target bindings.\r\n\tconstructor().Reset(Nan::GetFunction(tpl).ToLocalChecked());\r\n\r\n\texports->Set(className, tpl->GetFunction());\r\n}\r\n\r\nNAN_METHOD(WKey::New){\r\n\tMETHOD_BEGIN();\r\n\r\n\ttry{\r\n\t\tWKey *obj = new WKey();\r\n\t\tobj->data_ = new Key();\r\n\r\n\t\tobj->Wrap(info.This());\r\n\r\n\t\tinfo.GetReturnValue().Set(info.This());\r\n\t\treturn;\r\n\t}\r\n\tTRY_END();\r\n}\r\n\r\nNAN_METHOD(WKey::Generate){\r\n\tMETHOD_BEGIN();\r\n\r\n\ttry{\r\n\t\tLOGGER_ARG(\"format\");\r\n\t\tint format = info[0]->ToNumber()->Int32Value();\r\n\r\n\t\tLOGGER_ARG(\"pubExp\");\r\n\t\tint pubExp = info[1]->ToNumber()->Int32Value();\r\n\r\n\t\tLOGGER_ARG(\"keySize\");\r\n\t\tint keySize = info[2]->ToNumber()->Int32Value();\r\n\r\n\t\tUNWRAP_DATA(Key);\r\n\r\n\t\tHandle<Key> key = _this->generate(DataFormat::get(format), PublicExponent::get(pubExp), keySize);\r\n\t\tv8::Local<v8::Object> v8Key = WKey::NewInstance(key);\r\n\t\tinfo.GetReturnValue().Set(v8Key);\r\n\r\n\t\treturn;\r\n\t}\r\n\tTRY_END();\r\n}\r\n\r\nNAN_METHOD(WKey::Compare) {\r\n\tMETHOD_BEGIN();\r\n\r\n\ttry {\r\n\t\tUNWRAP_DATA(Key);\r\n\r\n\t\tLOGGER_ARG(\"key\");\r\n\t\tWKey * wKey = WKey::Unwrap<WKey>(info[0]->ToObject());\r\n\t\t\r\n\t\tint res = _this->compare(wKey->data_);\r\n\r\n\t\tv8::Local<v8::Number> v8Number = Nan::New<v8::Number>(res);\r\n\r\n\t\tinfo.GetReturnValue().Set(v8Number);\r\n\t\treturn;\r\n\t}\r\n\tTRY_END();\r\n}\r\n\r\nNAN_METHOD(WKey::Duplicate)\r\n{\r\n\tMETHOD_BEGIN();\r\n\r\n\ttry {\r\n\t\tUNWRAP_DATA(Key);\r\n\r\n\t\tHandle<Key> key = _this->duplicate();\r\n\t\tv8::Local<v8::Object> v8Key = WKey::NewInstance(key);\r\n\t\tinfo.GetReturnValue().Set(v8Key);\r\n\r\n\t\tinfo.GetReturnValue().Set(v8Key);\r\n\t\treturn;\r\n\t}\r\n\tTRY_END();\r\n}\r\n\r\nNAN_METHOD(WKey::ReadPrivateKey){\r\n\tMETHOD_BEGIN();\r\n\r\n\ttry{\r\n\t\tLOGGER_ARG(\"filename\");\r\n\t\tv8::String::Utf8Value v8Name(info[0]->ToString());\r\n\t\tchar *filename = *v8Name;\r\n\r\n\t\tLOGGER_ARG(\"format\");\r\n\t\tint format = info[1]->ToNumber()->Int32Value();\r\n\r\n\t\tchar *password = \"\";\r\n\r\n\t\tLOGGER_ARG(\"password\");\r\n\t\tif (!info[2]->IsUndefined()) {\r\n\t\t\tv8::String::Utf8Value v8Pass(info[2]->ToString());\r\n\t\t\tchar *password = *v8Pass;\r\n\t\t}\r\n\r\n\t\tHandle<Bio> in = NULL;\r\n\r\n\t\tin = new Bio(BIO_TYPE_FILE, filename, \"rb\");\r\n\r\n\t\tUNWRAP_DATA(Key);\r\n\r\n\t\t_this->readPrivateKey(in, DataFormat::get(format), new std::string(password));\r\n\r\n\t\tinfo.GetReturnValue().Set(info.This());\r\n\t\treturn;\r\n\t}\r\n\tTRY_END();\r\n}\r\n\r\nNAN_METHOD(WKey::ReadPublicKey){\r\n\tMETHOD_BEGIN();\r\n\r\n\ttry{\r\n\t\tv8::String::Utf8Value v8Str(info[0]->ToString());\r\n\t\tchar *filename = *v8Str;\r\n\r\n\t\tLOGGER_ARG(\"format\");\r\n\t\tint format = info[1]->ToNumber()->Int32Value();\r\n\r\n\t\tHandle<Bio> in = NULL;\r\n\r\n\t\tin = new Bio(BIO_TYPE_FILE, filename, \"rb\");\r\n\r\n\t\tUNWRAP_DATA(Key);\r\n\r\n\t\t_this->readPublicKey(in, DataFormat::get(format));\r\n\r\n\t\tinfo.GetReturnValue().Set(info.This());\r\n\t\treturn;\r\n\t}\r\n\tTRY_END();\r\n}\r\n\r\nNAN_METHOD(WKey::WritePrivateKey) {\r\n\tMETHOD_BEGIN();\r\n\r\n\ttry {\r\n\t\tLOGGER_ARG(\"filename\");\r\n\t\tv8::String::Utf8Value v8Filename(info[0]->ToString());\r\n\t\tchar *filename = *v8Filename;\r\n\r\n\t\tLOGGER_ARG(\"format\");\r\n\t\tint format = info[1]->ToNumber()->Int32Value();\r\n\r\n\t\tchar *password = \"\";\r\n\r\n\t\tLOGGER_ARG(\"password\");\r\n\t\tif (!info[2]->IsUndefined()) {\r\n\t\t\tv8::String::Utf8Value v8Pass(info[2]->ToString());\r\n\t\t\tpassword = *v8Pass;\r\n\t\t}\r\n\t\t\r\n\r\n\t\tHandle<Bio> out = new Bio(BIO_TYPE_FILE, filename, \"wb\");\r\n\r\n\t\tUNWRAP_DATA(Key);\r\n\r\n\t\t_this->writePrivateKey(out, DataFormat::get(format), new std::string(password));\r\n\r\n\t\tinfo.GetReturnValue().Set(info.This());\r\n\t\treturn;\r\n\t}\r\n\tTRY_END();\r\n}\r\n\r\nNAN_METHOD(WKey::WritePublicKey) {\r\n\tMETHOD_BEGIN();\r\n\r\n\ttry {\r\n\t\tLOGGER_ARG(\"filename\");\r\n\t\tv8::String::Utf8Value v8Filename(info[0]->ToString());\r\n\t\tchar *filename = *v8Filename;\r\n\r\n\t\tLOGGER_ARG(\"format\");\r\n\t\tint format = info[1]->ToNumber()->Int32Value();\r\n\r\n\t\tHandle<Bio> out = new Bio(BIO_TYPE_FILE, filename, \"wb\");\r\n\r\n\t\tUNWRAP_DATA(Key);\r\n\r\n\t\t_this->writePublicKey(out, DataFormat::get(format));\r\n\r\n\t\tinfo.GetReturnValue().Set(info.This());\r\n\t\treturn;\r\n\t}\r\n\tTRY_END();\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>#include \"packet\/framing.h\"\n#include \"osal.h\"\n\n\/*\n * Packet framing uses the Consistent Overhead Byte Stuffing algorithm for\n * encoding data bytes. The maximum length for each packet is limited to 254 bytes.\n * Refer to: https:\/\/en.wikipedia.org\/wiki\/Consistent_Overhead_Byte_Stuffing\n *\/\n\nnamespace {\n    constexpr uint8_t COBS_MAX_SIZE_DATA_SET = 254;\n} \/\/ namespace\n\nnamespace packet {\nnamespace framing {\n\nvoid stuff(const uint8_t* source, uint8_t* dest, uint8_t length) {\n    osalDbgCheck(source != nullptr);\n    osalDbgCheck(dest != nullptr);\n    osalDbgAssert(length <= COBS_MAX_SIZE_DATA_SET, \"invalid data length\");\n\n    const uint8_t* end = source + length;\n    uint8_t* code_p = dest++; \/* pointer to write code *\/\n    uint8_t code = 0x01;\n\n    auto write_code = [&]() {\n        *code_p = code;\n        code_p = dest++;\n        code = 0x01;\n    };\n\n    while (source < end) {\n        if (*source == 0) { \/* handle zero byte in data *\/\n            write_code();\n        } else { \/* handle non-zero byte *\/\n            *dest++ = *source;\n            if (++code == 0xff) { \/* reached max data length *\/\n                write_code();\n            }\n        }\n        ++source;\n    }\n    write_code();\n}\n\nvoid unstuff(const uint8_t* source, uint8_t* dest, uint8_t length) {\n    osalDbgCheck(source != nullptr);\n    osalDbgCheck(dest != nullptr);\n    \/\/ osalDbgAssert(length <= COBS_MAX_SIZE_DATA_SET + 1, \"invalid data length\"); always true due to data type\n\n    const uint8_t* end = source + length;\n    while (source < end) {\n        uint8_t code = *source++;\n\n        osalDbgAssert(code != 0, \"zero byte input\");\n        osalDbgAssert(code <= (end - source), \"input too short\");\n        for (uint8_t i = 1; i < code; ++i) {\n            *dest++ = *source++;\n        }\n        if (code < 0xff) { \/* don't write the last zero for max data length *\/\n            *dest++ = 0;\n        }\n    }\n}\n\n} \/\/ namespace framing\n} \/\/ namespace packet\n<commit_msg>Fix debug checks when unstuffing packets<commit_after>#include \"packet\/framing.h\"\n#include \"osal.h\"\n\n\/*\n * Packet framing uses the Consistent Overhead Byte Stuffing algorithm for\n * encoding data bytes. The maximum length for each packet is limited to 254 bytes.\n * Refer to: https:\/\/en.wikipedia.org\/wiki\/Consistent_Overhead_Byte_Stuffing\n *\/\n\nnamespace {\n    constexpr uint8_t COBS_MAX_SIZE_DATA_SET = 254;\n} \/\/ namespace\n\nnamespace packet {\nnamespace framing {\n\nvoid stuff(const uint8_t* source, uint8_t* dest, uint8_t length) {\n    osalDbgCheck(source != nullptr);\n    osalDbgCheck(dest != nullptr);\n    osalDbgAssert(length <= COBS_MAX_SIZE_DATA_SET, \"invalid data length\");\n\n    const uint8_t* end = source + length;\n    uint8_t* code_p = dest++; \/* pointer to write code *\/\n    uint8_t code = 0x01;\n\n    auto write_code = [&]() {\n        *code_p = code;\n        code_p = dest++;\n        code = 0x01;\n    };\n\n    while (source < end) {\n        if (*source == 0) { \/* handle zero byte in data *\/\n            write_code();\n        } else { \/* handle non-zero byte *\/\n            *dest++ = *source;\n            if (++code == 0xff) { \/* reached max data length *\/\n                write_code();\n            }\n        }\n        ++source;\n    }\n    write_code();\n}\n\nvoid unstuff(const uint8_t* source, uint8_t* dest, uint8_t length) {\n    osalDbgCheck(source != nullptr);\n    osalDbgCheck(dest != nullptr);\n    \/\/ osalDbgAssert(length <= COBS_MAX_SIZE_DATA_SET + 1, \"invalid data length\"); always true due to data type\n\n    const uint8_t* end = source + length;\n    while (source < end) {\n        uint8_t code = *source++;\n\n        osalDbgAssert(code != 0, \"zero byte input\");\n        osalDbgAssert(code - 1 <= (end - source), \"input too short\");\n        for (uint8_t i = 1; i < code; ++i) {\n            *dest++ = *source++;\n        }\n        if (code < 0xff) { \/* don't write the end-of-packet zero if data length = 0xff *\/\n            *dest++ = 0;\n        }\n    }\n}\n\n} \/\/ namespace framing\n} \/\/ namespace packet\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 <posix\/file_fd.hpp>\n#include <errno.h>\n#include <dirent.h>\n#include <sys\/uio.h>\n\nssize_t File_FD::read(void* p, size_t n)\n{\n  Expects(p != nullptr);\n\n  if(UNLIKELY(ent_.is_dir()))\n    return -EISDIR;\n\n  if(UNLIKELY(n == 0))\n    return 0;\n\n  auto buf = ent_.read(offset_, n);\n  memcpy(p, buf.data(), std::min(n, buf.size()));\n  offset_ += buf.size();\n  return buf.size();\n}\n\nssize_t File_FD::readv(const struct iovec* iov, int iovcnt)\n{\n  if(UNLIKELY(iovcnt <= 0 and iovcnt > IOV_MAX))\n    return -EINVAL;\n\n  ssize_t total = 0;\n  \/\/ TODO: return EINVAL if total overflow ssize_t\n  for(int i = 0; i < iovcnt; i++)\n  {\n    auto& vec = iov[i];\n    if(vec.iov_len > 0)\n      total += this->read(vec.iov_base, vec.iov_len);\n  }\n\n  return total;\n}\n\nint File_FD::write(const void*, size_t) {\n  return -1;\n}\n\nint File_FD::close() {\n  return 0;\n}\n\noff_t File_FD::lseek(off_t offset, int whence)\n{\n  if ((whence != SEEK_SET) && (whence != SEEK_CUR) && (whence != SEEK_END)) {\n    \/\/PRINT(\"lseek(%lu, %d) == %d\\n\", offset, whence, -1);\n    return -EINVAL;\n  }\n  off_t calculated_offset = offset_;\n  if (whence == SEEK_SET) {\n    calculated_offset = offset;\n  }\n  else if (whence == SEEK_CUR) {\n    calculated_offset += offset;\n  }\n  else if (whence == SEEK_END) {\n    const off_t end = ent_.size();\n    calculated_offset = end + offset;\n  }\n  if (calculated_offset < 0) calculated_offset = 0;\n  offset_ = calculated_offset;\n  \/\/PRINT(\"lseek(%lu, %d) == %d\\n\", offset, whence, offset_);\n  return offset_;\n}\n\nlong File_FD::getdents(struct dirent *dirp, unsigned int count)\n{\n  static_assert(sizeof(dirent::d_name) > 0);\n\n  if(not ent_.is_dir())\n    return -ENOTDIR;\n\n  \/\/ open (ls) directory if it havent yet\n  if(dir_ == nullptr)\n  {\n    auto list = ent_.ls();\n    if(UNLIKELY(list.error))\n      return -ENOENT;\n\n    dir_ = std::move(list.entries);\n    dir_pos = 0;\n  }\n\n  \/\/ we've read every entry\n  if(dir_pos == dir_->size())\n    return 0;\n\n  auto* ptr = reinterpret_cast<char*>(dirp);\n  unsigned int written = 0;\n\n  while(dir_pos != dir_->size())\n  {\n    \/\/ retreive the next entry from the read directory\n    const auto& ent = dir_->at(dir_pos);\n\n    \/\/ move to next dirent ptr\n    dirp = reinterpret_cast<dirent*>(ptr);\n\n    \/\/ inode number\n    dirp->d_ino = ent.block();\n    \/\/ offset to next dirent (we dont care, i think..)\n    dirp->d_off = 0;\n\n    \/\/ file type\n    switch(ent.type())\n    {\n      case fs::DIR:\n        dirp->d_type = DT_DIR;\n        break;\n      default:\n        dirp->d_type = DT_REG;\n    }\n\n    \/\/ filename (make sure it fits in buffer)\n    auto name = ent.name();\n    const auto namelen = std::min(sizeof(dirp->d_name)-1, name.length());\n\n    \/\/ length of this dirent (struct + name)\n    const auto len = sizeof(dirent) - sizeof(dirp->d_name) + namelen + 1;\n\n    \/\/ if this entry do not fit in the buffer, break\n    if((written + len) > count)\n      break;\n\n    \/\/ set the length\n    dirp->d_reclen = len;\n\n    \/\/ increase how much we've written\n    written += dirp->d_reclen;\n\n    \/\/ add the filename\n    std::strncpy(dirp->d_name, name.data(), namelen);\n\n    \/\/ iterate to next\n    ptr += dirp->d_reclen;\n    dir_pos++;\n  }\n\n  \/\/ we haven't written a single entry, which means it didnt fit\n  if(UNLIKELY(written == 0))\n    return -EINVAL;\n\n  return written;\n}\n<commit_msg>posix: Read error is EIO<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 <posix\/file_fd.hpp>\n#include <errno.h>\n#include <dirent.h>\n#include <sys\/uio.h>\n\nssize_t File_FD::read(void* p, size_t n)\n{\n  Expects(p != nullptr);\n\n  if(UNLIKELY(ent_.is_dir()))\n    return -EISDIR;\n\n  if(UNLIKELY(n == 0))\n    return 0;\n\n  auto buf = ent_.read(offset_, n);\n  if (not buf.is_valid()) return -EIO;\n\n  memcpy(p, buf.data(), std::min(n, buf.size()));\n  offset_ += buf.size();\n  return buf.size();\n}\n\nssize_t File_FD::readv(const struct iovec* iov, int iovcnt)\n{\n  if(UNLIKELY(iovcnt <= 0 and iovcnt > IOV_MAX))\n    return -EINVAL;\n\n  ssize_t total = 0;\n  \/\/ TODO: return EINVAL if total overflow ssize_t\n  for(int i = 0; i < iovcnt; i++)\n  {\n    auto& vec = iov[i];\n    if(vec.iov_len > 0)\n      total += this->read(vec.iov_base, vec.iov_len);\n  }\n\n  return total;\n}\n\nint File_FD::write(const void*, size_t) {\n  return -1;\n}\n\nint File_FD::close() {\n  return 0;\n}\n\noff_t File_FD::lseek(off_t offset, int whence)\n{\n  if ((whence != SEEK_SET) && (whence != SEEK_CUR) && (whence != SEEK_END)) {\n    \/\/PRINT(\"lseek(%lu, %d) == %d\\n\", offset, whence, -1);\n    return -EINVAL;\n  }\n  off_t calculated_offset = offset_;\n  if (whence == SEEK_SET) {\n    calculated_offset = offset;\n  }\n  else if (whence == SEEK_CUR) {\n    calculated_offset += offset;\n  }\n  else if (whence == SEEK_END) {\n    const off_t end = ent_.size();\n    calculated_offset = end + offset;\n  }\n  if (calculated_offset < 0) calculated_offset = 0;\n  offset_ = calculated_offset;\n  \/\/PRINT(\"lseek(%lu, %d) == %d\\n\", offset, whence, offset_);\n  return offset_;\n}\n\nlong File_FD::getdents(struct dirent *dirp, unsigned int count)\n{\n  static_assert(sizeof(dirent::d_name) > 0);\n\n  if(not ent_.is_dir())\n    return -ENOTDIR;\n\n  \/\/ open (ls) directory if it havent yet\n  if(dir_ == nullptr)\n  {\n    auto list = ent_.ls();\n    if(UNLIKELY(list.error))\n      return -ENOENT;\n\n    dir_ = std::move(list.entries);\n    dir_pos = 0;\n  }\n\n  \/\/ we've read every entry\n  if(dir_pos == dir_->size())\n    return 0;\n\n  auto* ptr = reinterpret_cast<char*>(dirp);\n  unsigned int written = 0;\n\n  while(dir_pos != dir_->size())\n  {\n    \/\/ retreive the next entry from the read directory\n    const auto& ent = dir_->at(dir_pos);\n\n    \/\/ move to next dirent ptr\n    dirp = reinterpret_cast<dirent*>(ptr);\n\n    \/\/ inode number\n    dirp->d_ino = ent.block();\n    \/\/ offset to next dirent (we dont care, i think..)\n    dirp->d_off = 0;\n\n    \/\/ file type\n    switch(ent.type())\n    {\n      case fs::DIR:\n        dirp->d_type = DT_DIR;\n        break;\n      default:\n        dirp->d_type = DT_REG;\n    }\n\n    \/\/ filename (make sure it fits in buffer)\n    auto name = ent.name();\n    const auto namelen = std::min(sizeof(dirp->d_name)-1, name.length());\n\n    \/\/ length of this dirent (struct + name)\n    const auto len = sizeof(dirent) - sizeof(dirp->d_name) + namelen + 1;\n\n    \/\/ if this entry do not fit in the buffer, break\n    if((written + len) > count)\n      break;\n\n    \/\/ set the length\n    dirp->d_reclen = len;\n\n    \/\/ increase how much we've written\n    written += dirp->d_reclen;\n\n    \/\/ add the filename\n    std::strncpy(dirp->d_name, name.data(), namelen);\n\n    \/\/ iterate to next\n    ptr += dirp->d_reclen;\n    dir_pos++;\n  }\n\n  \/\/ we haven't written a single entry, which means it didnt fit\n  if(UNLIKELY(written == 0))\n    return -EINVAL;\n\n  return written;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"rpcconsole.h\"\n#include \"ui_rpcconsole.h\"\n\n#include \"clientmodel.h\"\n#include \"bitcoinrpc.h\"\n#include \"guiutil.h\"\n\n#include <QTime>\n#include <QTimer>\n#include <QThread>\n#include <QTextEdit>\n#include <QKeyEvent>\n\n#include <boost\/tokenizer.hpp>\n\n\/\/ TODO: make it possible to filter out categories (esp debug messages when implemented)\n\/\/ TODO: receive errors and debug messages through ClientModel\n\nconst int CONSOLE_SCROLLBACK = 50;\nconst int CONSOLE_HISTORY = 50;\n\n\/* Object for executing console RPC commands in a separate thread.\n*\/\nclass RPCExecutor: public QObject\n{\n    Q_OBJECT\npublic slots:\n    void start();\n    void request(const QString &command);\nsignals:\n    void reply(int category, const QString &command);\n};\n\n#include \"rpcconsole.moc\"\n\nvoid RPCExecutor::start()\n{\n   \/\/ Nothing to do\n}\n\nvoid RPCExecutor::request(const QString &command)\n{\n    \/\/ Parse shell-like command line into separate arguments\n    boost::escaped_list_separator<char> els('\\\\',' ','\\\"');\n    std::string strCommand = command.toStdString();\n    boost::tokenizer<boost::escaped_list_separator<char> > tok(strCommand, els);\n\n    std::string strMethod;\n    std::vector<std::string> strParams;\n    int n = 0;\n    for(boost::tokenizer<boost::escaped_list_separator<char> >::iterator beg=tok.begin(); beg!=tok.end();++beg,++n)\n    {\n        if(n == 0) \/\/ First parameter is the command\n            strMethod = *beg;\n        else\n            strParams.push_back(*beg);\n    }\n\n    try {\n        std::string strPrint;\n        json_spirit::Value result = tableRPC.execute(strMethod, RPCConvertValues(strMethod, strParams));\n\n        \/\/ Format result reply\n        if (result.type() == json_spirit::null_type)\n            strPrint = \"\";\n        else if (result.type() == json_spirit::str_type)\n            strPrint = result.get_str();\n        else\n            strPrint = write_string(result, true);\n\n        emit reply(RPCConsole::CMD_REPLY, QString::fromStdString(strPrint));\n    }\n    catch (json_spirit::Object& objError)\n    {\n        emit reply(RPCConsole::CMD_ERROR, QString::fromStdString(write_string(json_spirit::Value(objError), false)));\n    }\n    catch (std::exception& e)\n    {\n        emit reply(RPCConsole::CMD_ERROR, QString(\"Error: \") + QString::fromStdString(e.what()));\n    }\n}\n\nRPCConsole::RPCConsole(QWidget *parent) :\n    QDialog(parent),\n    ui(new Ui::RPCConsole),\n    firstLayout(true),\n    historyPtr(0)\n{\n    ui->setupUi(this);\n    ui->messagesWidget->horizontalHeader()->setResizeMode(1, QHeaderView::Stretch);\n    ui->messagesWidget->setContextMenuPolicy(Qt::ActionsContextMenu);\n\n#ifndef WIN32\n    \/\/ Show Debug logfile label and Open button only for Windows\n    ui->labelDebugLogfile->setVisible(false);\n    ui->openDebugLogfileButton->setVisible(false);\n#endif\n\n    \/\/ Install event filter for up and down arrow\n    ui->lineEdit->installEventFilter(this);\n\n    \/\/ Add \"Copy message\" to context menu explicitly\n    QAction *copyMessageAction = new QAction(tr(\"&Copy\"), this);\n    copyMessageAction->setShortcut(QKeySequence(Qt::CTRL | Qt::Key_C));\n    copyMessageAction->setShortcutContext(Qt::WidgetShortcut);\n    connect(copyMessageAction, SIGNAL(triggered()), this, SLOT(copyMessage()));\n    ui->messagesWidget->addAction(copyMessageAction);\n\n    connect(ui->clearButton, SIGNAL(clicked()), this, SLOT(clear()));\n    connect(ui->openDebugLogfileButton, SIGNAL(clicked()), this, SLOT(on_openDebugLogfileButton_clicked()));\n\n    startExecutor();\n\n    clear();\n}\n\nRPCConsole::~RPCConsole()\n{\n    emit stopExecutor();\n    delete ui;\n}\n\nbool RPCConsole::eventFilter(QObject* obj, QEvent *event)\n{\n    if(obj == ui->lineEdit)\n    {\n        if(event->type() == QEvent::KeyPress)\n        {\n            QKeyEvent *key = static_cast<QKeyEvent*>(event);\n            switch(key->key())\n            {\n            case Qt::Key_Up: browseHistory(-1); return true;\n            case Qt::Key_Down: browseHistory(1); return true;\n            }\n        }\n    }\n    return QDialog::eventFilter(obj, event);\n}\n\nvoid RPCConsole::setClientModel(ClientModel *model)\n{\n    this->clientModel = model;\n    if(model)\n    {\n        \/\/ Subscribe to information, replies, messages, errors\n        connect(model, SIGNAL(numConnectionsChanged(int)), this, SLOT(setNumConnections(int)));\n        connect(model, SIGNAL(numBlocksChanged(int)), this, SLOT(setNumBlocks(int)));\n\n        \/\/ Provide initial values\n        ui->clientVersion->setText(model->formatFullVersion());\n        ui->clientName->setText(model->clientName());\n        ui->buildDate->setText(model->formatBuildDate());\n\n        setNumConnections(model->getNumConnections());\n        ui->isTestNet->setChecked(model->isTestNet());\n\n        setNumBlocks(model->getNumBlocks());\n    }\n}\n\nstatic QColor categoryColor(int category)\n{\n    switch(category)\n    {\n    case RPCConsole::MC_ERROR:     return QColor(255,0,0); break;\n    case RPCConsole::MC_DEBUG:     return QColor(192,192,192); break;\n    case RPCConsole::CMD_REQUEST:  return QColor(128,128,128); break;\n    case RPCConsole::CMD_REPLY:    return QColor(128,255,128); break;\n    case RPCConsole::CMD_ERROR:    return QColor(255,128,128); break;\n    default:           return QColor(0,0,0);\n    }\n}\n\nvoid RPCConsole::clear()\n{\n    ui->messagesWidget->clear();\n    ui->messagesWidget->setRowCount(0);\n    ui->lineEdit->clear();\n    ui->lineEdit->setFocus();\n\n    message(CMD_REPLY, tr(\"Welcome to the bitcoin RPC console.\")+\"\\n\"+\n                       tr(\"Use up and down arrows to navigate history, and Ctrl-L to clear screen.\")+\"\\n\"+\n                       tr(\"Type \\\"help\\\" for an overview of available commands.\"));\n}\n\nvoid RPCConsole::message(int category, const QString &message)\n{\n    \/\/ Add row to messages widget\n    int row = ui->messagesWidget->rowCount();\n    ui->messagesWidget->setRowCount(row+1);\n\n    QTime time = QTime::currentTime();\n    QTableWidgetItem *newTime = new QTableWidgetItem(time.toString());\n    newTime->setData(Qt::DecorationRole, categoryColor(category));\n    newTime->setForeground(QColor(128,128,128));\n    newTime->setFlags(Qt::ItemIsSelectable|Qt::ItemIsEnabled); \/\/ make non-editable\n\n    int numLines = message.count(\"\\n\") + 1;\n    \/\/ As Qt doesn't like very tall cells (they break scrolling) keep only short messages in\n    \/\/ the cell text, longer messages trigger a display widget with scroll bar\n    if(numLines < 5)\n    {\n        QTableWidgetItem *newItem = new QTableWidgetItem(message);\n        newItem->setFlags(Qt::ItemIsSelectable|Qt::ItemIsEnabled); \/\/ make non-editable\n        if(category == CMD_ERROR) \/\/ Coloring error messages in red\n            newItem->setForeground(QColor(255,16,16));\n        ui->messagesWidget->setItem(row, 1, newItem);\n    } else {\n        QTextEdit *newWidget = new QTextEdit;\n        newWidget->setText(message);\n        newWidget->setMaximumHeight(100);\n        newWidget->setReadOnly(true);\n        ui->messagesWidget->setCellWidget(row, 1, newWidget);\n    }\n\n    ui->messagesWidget->setItem(row, 0, newTime);\n    ui->messagesWidget->resizeRowToContents(row);\n    \/\/ Preserve only limited scrollback buffer\n    while(ui->messagesWidget->rowCount() > CONSOLE_SCROLLBACK)\n        ui->messagesWidget->removeRow(0);\n    \/\/ Scroll to bottom after table is updated\n    QTimer::singleShot(0, ui->messagesWidget, SLOT(scrollToBottom()));\n}\n\nvoid RPCConsole::setNumConnections(int count)\n{\n    ui->numberOfConnections->setText(QString::number(count));\n}\n\nvoid RPCConsole::setNumBlocks(int count)\n{\n    ui->numberOfBlocks->setText(QString::number(count));\n    if(clientModel)\n    {\n        ui->totalBlocks->setText(QString::number(clientModel->getNumBlocksOfPeers()));\n        ui->lastBlockTime->setText(clientModel->getLastBlockDate().toString());\n    }\n}\n\nvoid RPCConsole::on_lineEdit_returnPressed()\n{\n    QString cmd = ui->lineEdit->text();\n    ui->lineEdit->clear();\n\n    if(!cmd.isEmpty())\n    {\n        message(CMD_REQUEST, cmd);\n        emit cmdRequest(cmd);\n        \/\/ Truncate history from current position\n        history.erase(history.begin() + historyPtr, history.end());\n        \/\/ Append command to history\n        history.append(cmd);\n        \/\/ Enforce maximum history size\n        while(history.size() > CONSOLE_HISTORY)\n            history.removeFirst();\n        \/\/ Set pointer to end of history\n        historyPtr = history.size();\n    }\n}\n\nvoid RPCConsole::browseHistory(int offset)\n{\n    historyPtr += offset;\n    if(historyPtr < 0)\n        historyPtr = 0;\n    if(historyPtr > history.size())\n        historyPtr = history.size();\n    QString cmd;\n    if(historyPtr < history.size())\n        cmd = history.at(historyPtr);\n    ui->lineEdit->setText(cmd);\n}\n\nvoid RPCConsole::startExecutor()\n{\n    QThread* thread = new QThread;\n    RPCExecutor *executor = new RPCExecutor();\n    executor->moveToThread(thread);\n\n    \/\/ Notify executor when thread started (in executor thread)\n    connect(thread, SIGNAL(started()), executor, SLOT(start()));\n    \/\/ Replies from executor object must go to this object\n    connect(executor, SIGNAL(reply(int,QString)), this, SLOT(message(int,QString)));\n    \/\/ Requests from this object must go to executor\n    connect(this, SIGNAL(cmdRequest(QString)), executor, SLOT(request(QString)));\n    \/\/ On stopExecutor signal\n    \/\/ - queue executor for deletion (in execution thread)\n    \/\/ - quit the Qt event loop in the execution thread\n    connect(this, SIGNAL(stopExecutor()), executor, SLOT(deleteLater()));\n    connect(this, SIGNAL(stopExecutor()), thread, SLOT(quit()));\n    \/\/ Queue the thread for deletion (in this thread) when it is finished\n    connect(thread, SIGNAL(finished()), thread, SLOT(deleteLater()));\n\n    \/\/ Default implementation of QThread::run() simply spins up an event loop in the thread,\n    \/\/ which is what we want.\n    thread->start();\n}\n\nvoid RPCConsole::copyMessage()\n{\n    GUIUtil::copyEntryData(ui->messagesWidget, 1, Qt::EditRole);\n}\n\nvoid RPCConsole::on_tabWidget_currentChanged(int index)\n{\n    if(ui->tabWidget->widget(index) == ui->tab_console)\n    {\n        if(firstLayout)\n        {\n            \/\/ Work around QTableWidget issue:\n            \/\/ Call resizeRowsToContents on first Layout request with widget visible,\n            \/\/ to make sure multiline messages that were added before the console was shown\n            \/\/ have the right height.\n            firstLayout = false;\n            ui->messagesWidget->resizeRowsToContents();\n        }\n        ui->lineEdit->setFocus();\n    }\n}\n\nvoid RPCConsole::on_openDebugLogfileButton_clicked()\n{\n    GUIUtil::openDebugLogfile();\n}\n<commit_msg>if there is no current block number available display N\/A on totalBlocks label, instead of 0, which can not ever be true<commit_after>#include \"rpcconsole.h\"\n#include \"ui_rpcconsole.h\"\n\n#include \"clientmodel.h\"\n#include \"bitcoinrpc.h\"\n#include \"guiutil.h\"\n\n#include <QTime>\n#include <QTimer>\n#include <QThread>\n#include <QTextEdit>\n#include <QKeyEvent>\n\n#include <boost\/tokenizer.hpp>\n\n\/\/ TODO: make it possible to filter out categories (esp debug messages when implemented)\n\/\/ TODO: receive errors and debug messages through ClientModel\n\nconst int CONSOLE_SCROLLBACK = 50;\nconst int CONSOLE_HISTORY = 50;\n\n\/* Object for executing console RPC commands in a separate thread.\n*\/\nclass RPCExecutor: public QObject\n{\n    Q_OBJECT\npublic slots:\n    void start();\n    void request(const QString &command);\nsignals:\n    void reply(int category, const QString &command);\n};\n\n#include \"rpcconsole.moc\"\n\nvoid RPCExecutor::start()\n{\n   \/\/ Nothing to do\n}\n\nvoid RPCExecutor::request(const QString &command)\n{\n    \/\/ Parse shell-like command line into separate arguments\n    boost::escaped_list_separator<char> els('\\\\',' ','\\\"');\n    std::string strCommand = command.toStdString();\n    boost::tokenizer<boost::escaped_list_separator<char> > tok(strCommand, els);\n\n    std::string strMethod;\n    std::vector<std::string> strParams;\n    int n = 0;\n    for(boost::tokenizer<boost::escaped_list_separator<char> >::iterator beg=tok.begin(); beg!=tok.end();++beg,++n)\n    {\n        if(n == 0) \/\/ First parameter is the command\n            strMethod = *beg;\n        else\n            strParams.push_back(*beg);\n    }\n\n    try {\n        std::string strPrint;\n        json_spirit::Value result = tableRPC.execute(strMethod, RPCConvertValues(strMethod, strParams));\n\n        \/\/ Format result reply\n        if (result.type() == json_spirit::null_type)\n            strPrint = \"\";\n        else if (result.type() == json_spirit::str_type)\n            strPrint = result.get_str();\n        else\n            strPrint = write_string(result, true);\n\n        emit reply(RPCConsole::CMD_REPLY, QString::fromStdString(strPrint));\n    }\n    catch (json_spirit::Object& objError)\n    {\n        emit reply(RPCConsole::CMD_ERROR, QString::fromStdString(write_string(json_spirit::Value(objError), false)));\n    }\n    catch (std::exception& e)\n    {\n        emit reply(RPCConsole::CMD_ERROR, QString(\"Error: \") + QString::fromStdString(e.what()));\n    }\n}\n\nRPCConsole::RPCConsole(QWidget *parent) :\n    QDialog(parent),\n    ui(new Ui::RPCConsole),\n    firstLayout(true),\n    historyPtr(0)\n{\n    ui->setupUi(this);\n    ui->messagesWidget->horizontalHeader()->setResizeMode(1, QHeaderView::Stretch);\n    ui->messagesWidget->setContextMenuPolicy(Qt::ActionsContextMenu);\n\n#ifndef WIN32\n    \/\/ Show Debug logfile label and Open button only for Windows\n    ui->labelDebugLogfile->setVisible(false);\n    ui->openDebugLogfileButton->setVisible(false);\n#endif\n\n    \/\/ Install event filter for up and down arrow\n    ui->lineEdit->installEventFilter(this);\n\n    \/\/ Add \"Copy message\" to context menu explicitly\n    QAction *copyMessageAction = new QAction(tr(\"&Copy\"), this);\n    copyMessageAction->setShortcut(QKeySequence(Qt::CTRL | Qt::Key_C));\n    copyMessageAction->setShortcutContext(Qt::WidgetShortcut);\n    connect(copyMessageAction, SIGNAL(triggered()), this, SLOT(copyMessage()));\n    ui->messagesWidget->addAction(copyMessageAction);\n\n    connect(ui->clearButton, SIGNAL(clicked()), this, SLOT(clear()));\n    connect(ui->openDebugLogfileButton, SIGNAL(clicked()), this, SLOT(on_openDebugLogfileButton_clicked()));\n\n    startExecutor();\n\n    clear();\n}\n\nRPCConsole::~RPCConsole()\n{\n    emit stopExecutor();\n    delete ui;\n}\n\nbool RPCConsole::eventFilter(QObject* obj, QEvent *event)\n{\n    if(obj == ui->lineEdit)\n    {\n        if(event->type() == QEvent::KeyPress)\n        {\n            QKeyEvent *key = static_cast<QKeyEvent*>(event);\n            switch(key->key())\n            {\n            case Qt::Key_Up: browseHistory(-1); return true;\n            case Qt::Key_Down: browseHistory(1); return true;\n            }\n        }\n    }\n    return QDialog::eventFilter(obj, event);\n}\n\nvoid RPCConsole::setClientModel(ClientModel *model)\n{\n    this->clientModel = model;\n    if(model)\n    {\n        \/\/ Subscribe to information, replies, messages, errors\n        connect(model, SIGNAL(numConnectionsChanged(int)), this, SLOT(setNumConnections(int)));\n        connect(model, SIGNAL(numBlocksChanged(int)), this, SLOT(setNumBlocks(int)));\n\n        \/\/ Provide initial values\n        ui->clientVersion->setText(model->formatFullVersion());\n        ui->clientName->setText(model->clientName());\n        ui->buildDate->setText(model->formatBuildDate());\n\n        setNumConnections(model->getNumConnections());\n        ui->isTestNet->setChecked(model->isTestNet());\n\n        setNumBlocks(model->getNumBlocks());\n    }\n}\n\nstatic QColor categoryColor(int category)\n{\n    switch(category)\n    {\n    case RPCConsole::MC_ERROR:     return QColor(255,0,0); break;\n    case RPCConsole::MC_DEBUG:     return QColor(192,192,192); break;\n    case RPCConsole::CMD_REQUEST:  return QColor(128,128,128); break;\n    case RPCConsole::CMD_REPLY:    return QColor(128,255,128); break;\n    case RPCConsole::CMD_ERROR:    return QColor(255,128,128); break;\n    default:           return QColor(0,0,0);\n    }\n}\n\nvoid RPCConsole::clear()\n{\n    ui->messagesWidget->clear();\n    ui->messagesWidget->setRowCount(0);\n    ui->lineEdit->clear();\n    ui->lineEdit->setFocus();\n\n    message(CMD_REPLY, tr(\"Welcome to the bitcoin RPC console.\")+\"\\n\"+\n                       tr(\"Use up and down arrows to navigate history, and Ctrl-L to clear screen.\")+\"\\n\"+\n                       tr(\"Type \\\"help\\\" for an overview of available commands.\"));\n}\n\nvoid RPCConsole::message(int category, const QString &message)\n{\n    \/\/ Add row to messages widget\n    int row = ui->messagesWidget->rowCount();\n    ui->messagesWidget->setRowCount(row+1);\n\n    QTime time = QTime::currentTime();\n    QTableWidgetItem *newTime = new QTableWidgetItem(time.toString());\n    newTime->setData(Qt::DecorationRole, categoryColor(category));\n    newTime->setForeground(QColor(128,128,128));\n    newTime->setFlags(Qt::ItemIsSelectable|Qt::ItemIsEnabled); \/\/ make non-editable\n\n    int numLines = message.count(\"\\n\") + 1;\n    \/\/ As Qt doesn't like very tall cells (they break scrolling) keep only short messages in\n    \/\/ the cell text, longer messages trigger a display widget with scroll bar\n    if(numLines < 5)\n    {\n        QTableWidgetItem *newItem = new QTableWidgetItem(message);\n        newItem->setFlags(Qt::ItemIsSelectable|Qt::ItemIsEnabled); \/\/ make non-editable\n        if(category == CMD_ERROR) \/\/ Coloring error messages in red\n            newItem->setForeground(QColor(255,16,16));\n        ui->messagesWidget->setItem(row, 1, newItem);\n    } else {\n        QTextEdit *newWidget = new QTextEdit;\n        newWidget->setText(message);\n        newWidget->setMaximumHeight(100);\n        newWidget->setReadOnly(true);\n        ui->messagesWidget->setCellWidget(row, 1, newWidget);\n    }\n\n    ui->messagesWidget->setItem(row, 0, newTime);\n    ui->messagesWidget->resizeRowToContents(row);\n    \/\/ Preserve only limited scrollback buffer\n    while(ui->messagesWidget->rowCount() > CONSOLE_SCROLLBACK)\n        ui->messagesWidget->removeRow(0);\n    \/\/ Scroll to bottom after table is updated\n    QTimer::singleShot(0, ui->messagesWidget, SLOT(scrollToBottom()));\n}\n\nvoid RPCConsole::setNumConnections(int count)\n{\n    ui->numberOfConnections->setText(QString::number(count));\n}\n\nvoid RPCConsole::setNumBlocks(int count)\n{\n    ui->numberOfBlocks->setText(QString::number(count));\n    if(clientModel)\n    {\n        \/\/ If there is no current number available display N\/A instead of 0, which can't ever be true\n        ui->totalBlocks->setText(clientModel->getNumBlocksOfPeers() == 0 ? tr(\"N\/A\") : QString::number(clientModel->getNumBlocksOfPeers()));\n        ui->lastBlockTime->setText(clientModel->getLastBlockDate().toString());\n    }\n}\n\nvoid RPCConsole::on_lineEdit_returnPressed()\n{\n    QString cmd = ui->lineEdit->text();\n    ui->lineEdit->clear();\n\n    if(!cmd.isEmpty())\n    {\n        message(CMD_REQUEST, cmd);\n        emit cmdRequest(cmd);\n        \/\/ Truncate history from current position\n        history.erase(history.begin() + historyPtr, history.end());\n        \/\/ Append command to history\n        history.append(cmd);\n        \/\/ Enforce maximum history size\n        while(history.size() > CONSOLE_HISTORY)\n            history.removeFirst();\n        \/\/ Set pointer to end of history\n        historyPtr = history.size();\n    }\n}\n\nvoid RPCConsole::browseHistory(int offset)\n{\n    historyPtr += offset;\n    if(historyPtr < 0)\n        historyPtr = 0;\n    if(historyPtr > history.size())\n        historyPtr = history.size();\n    QString cmd;\n    if(historyPtr < history.size())\n        cmd = history.at(historyPtr);\n    ui->lineEdit->setText(cmd);\n}\n\nvoid RPCConsole::startExecutor()\n{\n    QThread* thread = new QThread;\n    RPCExecutor *executor = new RPCExecutor();\n    executor->moveToThread(thread);\n\n    \/\/ Notify executor when thread started (in executor thread)\n    connect(thread, SIGNAL(started()), executor, SLOT(start()));\n    \/\/ Replies from executor object must go to this object\n    connect(executor, SIGNAL(reply(int,QString)), this, SLOT(message(int,QString)));\n    \/\/ Requests from this object must go to executor\n    connect(this, SIGNAL(cmdRequest(QString)), executor, SLOT(request(QString)));\n    \/\/ On stopExecutor signal\n    \/\/ - queue executor for deletion (in execution thread)\n    \/\/ - quit the Qt event loop in the execution thread\n    connect(this, SIGNAL(stopExecutor()), executor, SLOT(deleteLater()));\n    connect(this, SIGNAL(stopExecutor()), thread, SLOT(quit()));\n    \/\/ Queue the thread for deletion (in this thread) when it is finished\n    connect(thread, SIGNAL(finished()), thread, SLOT(deleteLater()));\n\n    \/\/ Default implementation of QThread::run() simply spins up an event loop in the thread,\n    \/\/ which is what we want.\n    thread->start();\n}\n\nvoid RPCConsole::copyMessage()\n{\n    GUIUtil::copyEntryData(ui->messagesWidget, 1, Qt::EditRole);\n}\n\nvoid RPCConsole::on_tabWidget_currentChanged(int index)\n{\n    if(ui->tabWidget->widget(index) == ui->tab_console)\n    {\n        if(firstLayout)\n        {\n            \/\/ Work around QTableWidget issue:\n            \/\/ Call resizeRowsToContents on first Layout request with widget visible,\n            \/\/ to make sure multiline messages that were added before the console was shown\n            \/\/ have the right height.\n            firstLayout = false;\n            ui->messagesWidget->resizeRowsToContents();\n        }\n        ui->lineEdit->setFocus();\n    }\n}\n\nvoid RPCConsole::on_openDebugLogfileButton_clicked()\n{\n    GUIUtil::openDebugLogfile();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <Eigen\/Geometry>\n\n#include \"recalibration.h\"\n\nvoid Recalibration::translate (std::vector<float>& vertices, const QVector3D &p) {\n\n    for (int i = 0; i < vertices.size(); i += 3) {\n        vertices[i] += p[0];\n        vertices[i+1] += p[1];\n        vertices[i+2] += p[2];\n    }\n}\n\nvoid Recalibration::rotate (std::vector<float>& vertices, const QVector3D &angle) {\n\n    Eigen::Vector4f vec;\n    Eigen::Vector4f vecRot;\n\n    Eigen::Quaternionf q = Eigen::Quaternionf(0, angle.x(), angle.y(), angle.z());\n    Eigen::Quaternionf qInv = q.inverse();\n\n    for (int i = 0; i < vertices.size(); i += 3) {\n\n        vec = Eigen::Vector4f(vertices[i], vertices[i+1], vertices[i+2], 0);\n\n        vecRot = q * vec * qInv;\n\n        vertices[i] = vecRot.x();\n        vertices[i+1] = vecRot.y();\n        vertices[i+2] = vecRot.z();\n    }\n}\n\nvoid Recalibration::recalibrate (std::vector<float>& vertices, const QVector3D &v1, const QVector3D &v2, const QVector3D &v3, const QVector3D &v1p, const QVector3D &v2p, const QVector3D &v3p) {\n\n    \/\/ Translation\n    QVector3D vecTranslation = vectorPointToPoint(v1, v1p);\n    translate(vertices, vecTranslation);\n\n    \/\/ Rotation\n    QVector3D angle1 = angleBetweenVectors(v1p, v2, v1p, v2); \/\/ A vérifier\n    QVector3D angle2 = angleBetweenVectors(v1p, v3, v1p, v3); \/\/ A vérifier\n\n    rotate (vertices, angle1 + angle2);\n}\n\nQVector3D Recalibration::vectorPointToPoint(const QVector3D &p1,const  QVector3D &p2) const{\n\n    return QVector3D(p2.x() - p1.x(), p2.y() - p1.y(), p2.z() - p1.z());\n}\n\n\nQVector3D Recalibration::angleBetweenVectors(const QVector3D& ov1, const QVector3D& fv1, const QVector3D& ov2, const QVector3D& fv2) const {\n\n    QVector3D res;\n\n    \/\/ Axe X\n\n    QVector3D dirv1 = QVector3D(fv1.x() - fv1.x(), 0, 0);\n    QVector3D dirv2 = QVector3D(fv2.x() - fv2.x(), 0, 0);\n\n    float scalar = dirv1.x() * dirv2.x();\n\n    float norm = sqrt(dirv1.x() * dirv1.x()) * sqrt(dirv2.x() * dirv2.x());\n\n    res.setX(acos(scalar \/ norm));\n\n    \/\/ Axe Y\n\n    dirv1 = QVector3D(0, fv1.y() - fv1.y(), 0);\n    dirv2 = QVector3D(0, fv2.y() - fv2.y(), 0);\n\n    scalar = dirv1.y() * dirv2.y();\n\n    norm = sqrt(dirv1.y() * dirv1.y()) * sqrt(dirv2.y() * dirv2.y());\n\n    res.setY(acos(scalar \/ norm));\n\n    \/\/ Axe Z\n\n    dirv1 = QVector3D(fv1.z() - fv1.z(), 0, 0);\n    dirv2 = QVector3D(fv2.z() - fv2.z(), 0, 0);\n\n    scalar = dirv1.z() * dirv2.z();\n\n    norm = sqrt(dirv1.z() * dirv1.z()) * sqrt(dirv2.z() * dirv2.z());\n\n    res.setZ(acos(scalar \/ norm));\n\n    return res;\n\n    \/*\n\n    QVector3D dirv1 = QVector3D(fv1.x - fv1.x, fv1.y - ov1.y, fv1.z - ov1.z);\n    QVector3D dirv2 = QVector3D(fv2.x - fv2.x, fv2.y - ov2.y, fv2.z - ov2.z);\n\n    float scalar = dirv1.x * dirv2.x + irv1.y * dirv2.y + irv1.z * dirv2.z;\n\n    float norm = sqrt(dirv1.x() * dirv1.x() + dirv1.y() * dirv1.y() + dirv1.z() * dirv1.z()) *\n                 sqrt(dirv2.x() * dirv2.x() + dirv2.y() * dirv2.y() + dirv2.z() * dirv2.z());\n\n    return acos(scalarP \/ norm);*\/\n}\n<commit_msg>correction recalibration<commit_after>#include <Eigen\/Geometry>\n\n#include \"recalibration.h\"\n\nvoid Recalibration::translate (std::vector<float>& vertices, const QVector3D &p) {\n\n    for (int i = 0; i < vertices.size(); i += 6) {\n        vertices[i] += p[0];\n        vertices[i+1] += p[1];\n        vertices[i+2] += p[2];\n    }\n}\n\nvoid Recalibration::rotate (std::vector<float>& vertices, const QVector3D &angle) {\n\n    Eigen::Vector4f vec;\n    Eigen::Vector4f vecRot;\n\n    Eigen::Quaternionf q = Eigen::Quaternionf(0, angle.x(), angle.y(), angle.z());\n    Eigen::Quaternionf qInv = q.inverse();\n\n    for (int i = 0; i < vertices.size(); i += 6) {\n\n        vec = Eigen::Vector4f(vertices[i], vertices[i+1], vertices[i+2], 0);\n\n        vecRot = q * vec * qInv;\n\n        vertices[i] = vecRot.x();\n        vertices[i+1] = vecRot.y();\n        vertices[i+2] = vecRot.z();\n    }\n}\n\nvoid Recalibration::recalibrate (std::vector<float>& vertices, const QVector3D &v1, const QVector3D &v2, const QVector3D &v3, const QVector3D &v1p, const QVector3D &v2p, const QVector3D &v3p) {\n\n    \/\/ Translation\n    QVector3D vecTranslation = vectorPointToPoint(v1, v1p);\n    translate(vertices, vecTranslation);\n\n    \/\/ Rotation\n    QVector3D angle1 = angleBetweenVectors(v1p, v2, v1p, v2); \/\/ A vérifier\n    QVector3D angle2 = angleBetweenVectors(v1p, v3, v1p, v3); \/\/ A vérifier\n\n    rotate (vertices, angle1 + angle2);\n}\n\nQVector3D Recalibration::vectorPointToPoint(const QVector3D &p1,const  QVector3D &p2) const{\n\n    return QVector3D(p2.x() - p1.x(), p2.y() - p1.y(), p2.z() - p1.z());\n}\n\n\nQVector3D Recalibration::angleBetweenVectors(const QVector3D& ov1, const QVector3D& fv1, const QVector3D& ov2, const QVector3D& fv2) const {\n\n    QVector3D res;\n\n    \/\/ Axe X\n\n    QVector3D dirv1 = QVector3D(fv1.x() - fv1.x(), 0, 0);\n    QVector3D dirv2 = QVector3D(fv2.x() - fv2.x(), 0, 0);\n\n    float scalar = dirv1.x() * dirv2.x();\n\n    float norm = sqrt(dirv1.x() * dirv1.x()) * sqrt(dirv2.x() * dirv2.x());\n\n    res.setX(acos(scalar \/ norm));\n\n    \/\/ Axe Y\n\n    dirv1 = QVector3D(0, fv1.y() - fv1.y(), 0);\n    dirv2 = QVector3D(0, fv2.y() - fv2.y(), 0);\n\n    scalar = dirv1.y() * dirv2.y();\n\n    norm = sqrt(dirv1.y() * dirv1.y()) * sqrt(dirv2.y() * dirv2.y());\n\n    res.setY(acos(scalar \/ norm));\n\n    \/\/ Axe Z\n\n    dirv1 = QVector3D(fv1.z() - fv1.z(), 0, 0);\n    dirv2 = QVector3D(fv2.z() - fv2.z(), 0, 0);\n\n    scalar = dirv1.z() * dirv2.z();\n\n    norm = sqrt(dirv1.z() * dirv1.z()) * sqrt(dirv2.z() * dirv2.z());\n\n    res.setZ(acos(scalar \/ norm));\n\n    return res;\n\n    \/*\n\n    QVector3D dirv1 = QVector3D(fv1.x - fv1.x, fv1.y - ov1.y, fv1.z - ov1.z);\n    QVector3D dirv2 = QVector3D(fv2.x - fv2.x, fv2.y - ov2.y, fv2.z - ov2.z);\n\n    float scalar = dirv1.x * dirv2.x + irv1.y * dirv2.y + irv1.z * dirv2.z;\n\n    float norm = sqrt(dirv1.x() * dirv1.x() + dirv1.y() * dirv1.y() + dirv1.z() * dirv1.z()) *\n                 sqrt(dirv2.x() * dirv2.x() + dirv2.y() * dirv2.y() + dirv2.z() * dirv2.z());\n\n    return acos(scalarP \/ norm);*\/\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Functions deal with the regex banning.\n *\n * Copyright (c) eQualit.ie 2013 under GNU AGPL v3.0 or later\n *\n *  Vmon: June 2013, Initial version\n *\/\n#include <vector>\n#include <sys\/time.h>\n\n#include \"regex_manager.h\"\n\nusing namespace std;\n\n\/**\n  reads all the regular expressions from the database.\n  and compile them\n *\/\nvoid RegexManager::load_config()\n{\n  try\n  {\n    TSDebug(BANJAX_PLUGIN_NAME, \"Setting regex re2 options\");\n    RE2::Options opt;\n    opt.set_log_errors(false);\n    opt.set_perl_classes(true);\n    opt.set_posix_syntax(true);\n\n    TSDebug(BANJAX_PLUGIN_NAME, \"Loading regex manager conf\");\n\n    for (const auto& node : cfg) {\n      string cur_rule = node[\"rule\"].as<std::string>();\n\n      TSDebug(BANJAX_PLUGIN_NAME, \"initiating rule %s\", cur_rule.c_str());\n\n      unsigned int observation_interval = node[\"interval\"].as<unsigned int>();\n      unsigned int threshold = node[\"hits_per_interval\"].as<unsigned int>();\n\n      rated_banning_regexes.emplace_back(\n          new RatedRegex(rated_banning_regexes.size(),\n                         cur_rule,\n                         new RE2(node[\"regex\"].as<std::string>(), opt),\n                         observation_interval * 1000,\n                         threshold \/(double)(observation_interval* 1000)));\n    }\n\n    total_no_of_rules = rated_banning_regexes.size();\n  }\n  catch(YAML::RepresentationException& e)\n  {\n    TSDebug(BANJAX_PLUGIN_NAME, \"Error loading regex manager conf [%s].\", e.what());\n    throw;\n  }\n\n  TSDebug(BANJAX_PLUGIN_NAME, \"Done loading regex manager conf\");\n}\n\n\/**\n  applies all regex to an ATS record\n\n  @param ats_record: the full request record including time url agent etc\n  @return: 1 match 0 not match < 0 error.\n*\/\npair<RegexManager::RegexResult,RegexManager::RatedRegex*>\nRegexManager::parse_request(string ip, string ats_record) const\n{\n  boost::optional<IpDb::IpState> ip_state;\n\n  for(const auto& rule : rated_banning_regexes) {\n    if (RE2::FullMatch(ats_record, *(rule->re2_regex))) {\n      TSDebug(BANJAX_PLUGIN_NAME, \"requests matched %s\", (rule->re2_regex->pattern()).c_str());\n      \/\/if it is a simple regex i.e. with rate 0 we bans immidiately without\n      \/\/wasting time and mem\n      if (rule->rate == 0) {\n        TSDebug(BANJAX_PLUGIN_NAME, \"simple regex, ban immediately\");\n        return make_pair(REGEX_MATCHED, rule.get());\n      }\n      \/\/select appropriate rate, dependent on whether GET or POST request\n\n      \/* we need to check the rate condition here *\/\n      \/\/getting current time in msec\n      timeval cur_time; gettimeofday(&cur_time, NULL);\n      long cur_time_msec = cur_time.tv_sec * 1000 + cur_time.tv_usec \/ 1000.0;\n\n      \/* first we check if we already have retreived the state for this ip *\/\n      if (!ip_state || ip_state->size() == 0) {\n        ip_state =  regex_manager_ip_db->get_ip_state(ip);\n        if (!ip_state) \/\/we failed to read the database we make no judgement\n          continue;\n      }\n\n      \/\/if we succeeded in retreiving but the size is zero then it meaens we don't have a record of this ip at all\n      if (ip_state->size() == 0) {\n        ip_state->resize(total_no_of_rules);\n      }\n\n      \/\/now we check the begining of the hit for this regex (if the vector is just created everything is 0, in case\n      \/\/this is the first regex this ip hits)\n      RegexState state = (*ip_state)[rule->id];\n\n      \/\/if it is 0, then we don't have a record for\n      \/\/the current regex\n      if (state.begin_msec == 0) {\n        state.begin_msec = cur_time_msec;\n      }\n\n      \/\/now we have a record, update the rate and ban if necessary.\n      \/\/we move the interval by the differences of the \"begin_in_ms - cur_time_msec - interval*1000\"\n      \/\/if it is less than zero we don't do anything just augument the rate\n      long time_window_movement = cur_time_msec - state.begin_msec - rule->interval;\n      if (time_window_movement > 0) { \/\/we need to move\n         state.begin_msec += time_window_movement;\n         state.rate = state.rate - (state.rate * time_window_movement - 1)\/(double) rule->interval;\n         state.rate = state.rate < 0 ? 1\/(double) rule->interval : state.rate; \/\/if time_window_movement > time_window_movementrule->interval, then we just wipe history and start as a new interval\n       }\n       else {\n         \/\/we are still in the same interval so just increase the hit by 1\n         state.rate += 1\/(double) rule->interval;\n       }\n\n      TSDebug(BANJAX_PLUGIN_NAME, \"with rate %f \/msec\", state.rate);\n\n      (*ip_state)[rule->id] = state;\n\n      if (state.rate >= rule->rate) {\n        TSDebug(BANJAX_PLUGIN_NAME, \"exceeding excessive rate %f \/msec\", rule->rate);\n        \/\/clear the record to avoid multiple reporting to swabber\n        \/\/we are not clearing the state cause it is not for sure that\n        \/\/swabber ban the ip due to possible failure of acquiring lock\n        \/\/ ip_state.detail.begin_msec = 0;\n        \/\/ ip_state.detail.rate = 0;\n        \/\/ regex_manager_ip_db->set_ip_state(ip, ip_state.state_allocator);\n\n        \/\/before calling swabber we need to delete the memory as swabber will\n        \/\/delete the ip database entery and the memory will be lost.\n        \/\/However, if swabber fails to acquire a lock this means\n        \/\/the ip can escape the banning, this however is a miner\n        \/\/concern compared to the fact that we might ran out of\n        \/\/memory.\n\n        regex_manager_ip_db->set_ip_state(ip, *ip_state);\n        return make_pair(REGEX_MATCHED, rule.get());\n      }\n    }\n  }\n\n  \/\/if we managed to get\/make a valid state we are going to store it\n  if (ip_state && ip_state->size() > 0)\n    regex_manager_ip_db->set_ip_state(ip, *ip_state);\n\n  \/\/no match\n  return make_pair(REGEX_MISSED, (RatedRegex*)NULL);\n}\n\nFilterResponse RegexManager::on_http_request(const TransactionParts& transaction_parts)\n{\n  const string sep(\" \");\n  TransactionParts ats_record_parts = (TransactionParts) transaction_parts;\n\n  string ats_record =  ats_record_parts[TransactionMuncher::METHOD] + sep;\n  ats_record+= ats_record_parts[TransactionMuncher::URL] + sep;\n  ats_record+= ats_record_parts[TransactionMuncher::HOST] + sep;\n  ats_record+= ats_record_parts[TransactionMuncher::UA];\n\n  TSDebug(BANJAX_PLUGIN_NAME, \"Examining '%s' for banned matches\", ats_record.c_str());\n  pair<RegexResult,RatedRegex*> result = parse_request(\n\t\t\t\t\t\tats_record_parts[TransactionMuncher::IP],\n\t\t\t\t\t\tats_record\n\t\t\t\t\t\t);\n\n  if (result.first == REGEX_MATCHED) {\n    TSDebug(BANJAX_PLUGIN_NAME, \"asking swabber to ban client ip: %s\", ats_record_parts[TransactionMuncher::IP].c_str());\n\n    \/\/here instead we are calling nosmos's banning client\n    string ats_rec_comma_sep =\n      ats_record_parts[TransactionMuncher::METHOD] + \", \" +\n      encapsulate_in_quotes(ats_record_parts[TransactionMuncher::URL]) + \", \" +\n      ats_record_parts[TransactionMuncher::HOST] + \", \" +\n      encapsulate_in_quotes(ats_record_parts[TransactionMuncher::UA]);\n\n    string banning_reason = \"matched regex rule \" + result.second->rule_name + \", \" + ats_rec_comma_sep;\n\n    swabber->ban(ats_record_parts[TransactionMuncher::IP], banning_reason);\n    return FilterResponse([&](const TransactionParts& a, const FilterResponse& b) { return this->generate_response(a, b); });\n\n  } else if (result.first != REGEX_MISSED) {\n    TSError(\"Regex failed with error: %d\\n\", result.first);\n  }\n\n  return FilterResponse(FilterResponse::GO_AHEAD_NO_COMMENT);\n\n}\n\nstd::string RegexManager::generate_response(const TransactionParts& transaction_parts, const FilterResponse& response_info)\n{\n  (void)transaction_parts; (void)response_info;\n  return forbidden_message;\n}\n<commit_msg>regex_manager.cpp: TSDebug -> print::debug<commit_after>\/*\n * Functions deal with the regex banning.\n *\n * Copyright (c) eQualit.ie 2013 under GNU AGPL v3.0 or later\n *\n *  Vmon: June 2013, Initial version\n *\/\n#include <vector>\n#include <sys\/time.h>\n\n#include \"regex_manager.h\"\n\nusing namespace std;\n\n\/**\n  reads all the regular expressions from the database.\n  and compile them\n *\/\nvoid RegexManager::load_config()\n{\n  try\n  {\n    print::debug(\"RegexManager::load_config\");\n\n    RE2::Options opt;\n    opt.set_log_errors(false);\n    opt.set_perl_classes(true);\n    opt.set_posix_syntax(true);\n\n    for (const auto& node : cfg) {\n      string cur_rule = node[\"rule\"].as<std::string>();\n\n      print::debug(\"RegexManager: Initiating rule \", cur_rule);\n\n      unsigned int observation_interval = node[\"interval\"].as<unsigned int>();\n      unsigned int threshold = node[\"hits_per_interval\"].as<unsigned int>();\n\n      rated_banning_regexes.emplace_back(\n          new RatedRegex(rated_banning_regexes.size(),\n                         cur_rule,\n                         new RE2(node[\"regex\"].as<std::string>(), opt),\n                         observation_interval * 1000,\n                         threshold \/(double)(observation_interval* 1000)));\n    }\n\n    total_no_of_rules = rated_banning_regexes.size();\n  }\n  catch(YAML::RepresentationException& e)\n  {\n    print::debug(\"RegexManager: Error loading regex manager conf [\",e.what(),\"].\");\n    throw;\n  }\n}\n\n\/**\n  applies all regex to an ATS record\n\n  @param ats_record: the full request record including time url agent etc\n  @return: 1 match 0 not match < 0 error.\n*\/\npair<RegexManager::RegexResult,RegexManager::RatedRegex*>\nRegexManager::parse_request(string ip, string ats_record) const\n{\n  boost::optional<IpDb::IpState> ip_state;\n\n  for(const auto& rule : rated_banning_regexes) {\n    if (RE2::FullMatch(ats_record, *(rule->re2_regex))) {\n      print::debug(\"RegexManager: Request matched \", rule->re2_regex->pattern());\n      \/\/if it is a simple regex i.e. with rate 0 we bans immidiately without\n      \/\/wasting time and mem\n      if (rule->rate == 0) {\n        print::debug(\"RegexManager: Simple regex, ban immediately\");\n        return make_pair(REGEX_MATCHED, rule.get());\n      }\n      \/\/select appropriate rate, dependent on whether GET or POST request\n\n      \/* we need to check the rate condition here *\/\n      \/\/getting current time in msec\n      timeval cur_time; gettimeofday(&cur_time, NULL);\n      long cur_time_msec = cur_time.tv_sec * 1000 + cur_time.tv_usec \/ 1000.0;\n\n      \/* first we check if we already have retreived the state for this ip *\/\n      if (!ip_state || ip_state->size() == 0) {\n        ip_state =  regex_manager_ip_db->get_ip_state(ip);\n        if (!ip_state) \/\/we failed to read the database we make no judgement\n          continue;\n      }\n\n      \/\/if we succeeded in retreiving but the size is zero then it meaens we don't have a record of this ip at all\n      if (ip_state->size() == 0) {\n        ip_state->resize(total_no_of_rules);\n      }\n\n      \/\/now we check the begining of the hit for this regex (if the vector is just created everything is 0, in case\n      \/\/this is the first regex this ip hits)\n      RegexState state = (*ip_state)[rule->id];\n\n      \/\/if it is 0, then we don't have a record for\n      \/\/the current regex\n      if (state.begin_msec == 0) {\n        state.begin_msec = cur_time_msec;\n      }\n\n      \/\/now we have a record, update the rate and ban if necessary.\n      \/\/we move the interval by the differences of the \"begin_in_ms - cur_time_msec - interval*1000\"\n      \/\/if it is less than zero we don't do anything just augument the rate\n      long time_window_movement = cur_time_msec - state.begin_msec - rule->interval;\n      if (time_window_movement > 0) { \/\/we need to move\n        state.begin_msec += time_window_movement;\n        state.rate = state.rate - (state.rate * time_window_movement - 1)\/(double) rule->interval;\n        state.rate = state.rate < 0 ? 1\/(double) rule->interval : state.rate; \/\/if time_window_movement > time_window_movementrule->interval, then we just wipe history and start as a new interval\n      }\n      else {\n        \/\/we are still in the same interval so just increase the hit by 1\n        state.rate += 1\/(double) rule->interval;\n      }\n\n      print::debug(\"RegexManager: with rate \",state.rate,\" \/msec\");\n\n      (*ip_state)[rule->id] = state;\n\n      if (state.rate >= rule->rate) {\n        print::debug(\"Exceeding excessive rate \",rule->rate,\" \/msec\");\n        \/\/clear the record to avoid multiple reporting to swabber\n        \/\/we are not clearing the state cause it is not for sure that\n        \/\/swabber ban the ip due to possible failure of acquiring lock\n        \/\/ ip_state.detail.begin_msec = 0;\n        \/\/ ip_state.detail.rate = 0;\n        \/\/ regex_manager_ip_db->set_ip_state(ip, ip_state.state_allocator);\n\n        \/\/before calling swabber we need to delete the memory as swabber will\n        \/\/delete the ip database entery and the memory will be lost.\n        \/\/However, if swabber fails to acquire a lock this means\n        \/\/the ip can escape the banning, this however is a miner\n        \/\/concern compared to the fact that we might ran out of\n        \/\/memory.\n\n        regex_manager_ip_db->set_ip_state(ip, *ip_state);\n        return make_pair(REGEX_MATCHED, rule.get());\n      }\n    }\n  }\n\n  \/\/if we managed to get\/make a valid state we are going to store it\n  if (ip_state && ip_state->size() > 0)\n    regex_manager_ip_db->set_ip_state(ip, *ip_state);\n\n  \/\/no match\n  return make_pair(REGEX_MISSED, (RatedRegex*)NULL);\n}\n\nFilterResponse RegexManager::on_http_request(const TransactionParts& transaction_parts)\n{\n  const string sep(\" \");\n  TransactionParts ats_record_parts = (TransactionParts) transaction_parts;\n\n  string ats_record =  ats_record_parts[TransactionMuncher::METHOD] + sep;\n  ats_record+= ats_record_parts[TransactionMuncher::URL] + sep;\n  ats_record+= ats_record_parts[TransactionMuncher::HOST] + sep;\n  ats_record+= ats_record_parts[TransactionMuncher::UA];\n\n  print::debug(\"RegexManager: Examining '\",ats_record,\"' for banned matches\");\n\n  pair<RegexResult,RatedRegex*> result = parse_request(\n\t\t\t\t\t\tats_record_parts[TransactionMuncher::IP],\n\t\t\t\t\t\tats_record\n\t\t\t\t\t\t);\n\n  if (result.first == REGEX_MATCHED) {\n    print::debug(\"Asking swabber to ban client ip: \", ats_record_parts[TransactionMuncher::IP]);\n\n    \/\/here instead we are calling nosmos's banning client\n    string ats_rec_comma_sep =\n      ats_record_parts[TransactionMuncher::METHOD] + \", \" +\n      encapsulate_in_quotes(ats_record_parts[TransactionMuncher::URL]) + \", \" +\n      ats_record_parts[TransactionMuncher::HOST] + \", \" +\n      encapsulate_in_quotes(ats_record_parts[TransactionMuncher::UA]);\n\n    string banning_reason = \"matched regex rule \" + result.second->rule_name + \", \" + ats_rec_comma_sep;\n\n    swabber->ban(ats_record_parts[TransactionMuncher::IP], banning_reason);\n    return FilterResponse([&](const TransactionParts& a, const FilterResponse& b) { return this->generate_response(a, b); });\n\n  } else if (result.first != REGEX_MISSED) {\n    print::debug(\"Regex failed with error: \", result.first);\n  }\n\n  return FilterResponse(FilterResponse::GO_AHEAD_NO_COMMENT);\n}\n\nstd::string RegexManager::generate_response(const TransactionParts& transaction_parts, const FilterResponse& response_info)\n{\n  (void)transaction_parts; (void)response_info;\n  return forbidden_message;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"ncv.h\"\n#include <boost\/program_options.hpp>\n\n\/\/ display the formatted optimization history\ntemplate\n<\n        typename tproblem\n>\nvoid print(const tproblem& problem,\n           const ncv::string_t& header,\n           ncv::size_t trial,\n           ncv::size_t trials,\n           const ncv::string_t& time)\n{\n        static const ncv::index_t col_size = 32;\n        static const ncv::string_t del_line(4 * col_size + 4, '-');\n\n        const ncv::string_t test =\n                \" [\" + ncv::text::to_string(trial + 1) + \"\/\" + ncv::text::to_string(trials) + \"]\";\n\n        std::cout << del_line << std::endl;\n        std::cout << header << test << \": x  = \" << problem.opt_x().transpose() << std::endl;\n        std::cout << header << test << \": fx = \" << problem.opt_fx() << std::endl;\n        std::cout << header << test << \": gn = \" << problem.opt_gn() << std::endl;\n        std::cout << header << test\n                  << \": #fevals = \" << problem.fevals()\n                  << \", #gevals = \" << problem.gevals()\n                  << \", #iterations = \" << problem.iterations() << \"\/\" << problem.max_iterations()\n                  << \" [done in \" << time << \"].\" << std::endl;\n        std::cout << del_line << std::endl;\n}\n\n\/\/ optimize a problem starting from random points\ntemplate\n<\n        typename tproblem\n>\nvoid test(const tproblem& problem, const ncv::string_t& name, ncv::size_t trials)\n{\n        const ncv::size_t size = problem.size();\n\n        ncv::random<typename tproblem::scalar_t> rgen(-1.0, 1.0);\n        for (size_t trial = 0; trial < trials; trial ++)\n        {\n                typename tproblem::vector_t x0(size);\n                rgen(x0.data(), x0.data() + x0.size());\n\n                ncv::timer timer;\n\n                timer.start();\n                ncv::optimize::gradient_descent(problem, x0);\n                print(problem, name + \" (GD)\", trial, trials, timer.elapsed_string());\n\n                timer.start();\n                ncv::optimize::conjugate_gradient_descent(problem, x0);\n                print(problem, name + \" (CGD)\", trial, trials, timer.elapsed_string());\n        }\n}\n\nint main(int argc, char *argv[])\n{\n        typedef ncv::size_t                             size_t;\n        typedef ncv::scalar_t                           scalar_t;\n        typedef ncv::vector_t                           vector_t;\n\n        typedef std::function<size_t(void)>                                     op_size_t;\n        typedef std::function<scalar_t(const vector_t&)>                        op_fval_t;\n        typedef std::function<scalar_t(const vector_t&, vector_t&)>             op_fval_grad_t;\n\n        typedef ncv::optimize::problem<\n                        scalar_t,\n                        op_size_t,\n                        op_fval_t,\n                        op_fval_grad_t>                 problem_t;\n\n        \/\/ parse the command line\n        boost::program_options::options_description po_desc(\"\", 160);\n        po_desc.add_options()(\"help,h\", \"help message\");\n        po_desc.add_options()(\"iters,i\",\n                boost::program_options::value<size_t>()->default_value(128),\n                \"number of iterations [8, 16000]\");\n        po_desc.add_options()(\"eps,e\",\n                boost::program_options::value<scalar_t>()->default_value(0.00001),\n                \"convergence accuracy [1e-20, 1e-1]\");\n        po_desc.add_options()(\"dim,d\",\n                boost::program_options::value<size_t>()->default_value(16),\n                \"maximum dimension [2, 1024]\");\n\n        boost::program_options::variables_map po_vm;\n        boost::program_options::store(\n                boost::program_options::command_line_parser(argc, argv).options(po_desc).run(),\n                po_vm);\n        boost::program_options::notify(po_vm);\n\n        \/\/ check arguments and options\n        if (\tpo_vm.empty() ||\n                po_vm.count(\"help\"))\n        {\n                std::cout << po_desc;\n                return EXIT_FAILURE;\n        }\n\n        const size_t cmd_iters = ncv::math::clamp(po_vm[\"iters\"].as<size_t>(), 8, 16000);\n        const scalar_t cmd_eps = ncv::math::clamp(po_vm[\"eps\"].as<scalar_t>(), 1e-20, 1e-1);\n        const size_t cmd_dims = ncv::math::clamp(po_vm[\"dim\"].as<size_t>(), 2, 1024);\n        const size_t cmd_trials = 16;\n\n\/\/        \/\/ sphere function\n\/\/        for (size_t n = 2; n <= cmd_dims; n *= 2)\n\/\/        {\n\/\/                const auto op_size = [=] ()\n\/\/                {\n\/\/                        return n;\n\/\/                };\n\n\/\/                const auto op_fval = [=] (const vector_t& x)\n\/\/                {\n\/\/                        return x.dot(x);\n\/\/                };\n\n\/\/                const auto op_grad = [=] (const vector_t& x, vector_t& g)\n\/\/                {\n\/\/                        g = 2.0 * x;\n\/\/                };\n\n\/\/                const auto op_fval_grad = [=] (const vector_t& x, vector_t& g)\n\/\/                {\n\/\/                        op_grad(x, g);\n\/\/                        return op_fval(x);\n\/\/                };\n\n\/\/                const problem_t problem(op_size, op_fval, op_fval_grad, cmd_iters, cmd_eps);\n\/\/                test(problem, \"sphere [\" + ncv::text::to_string(n) + \"D]\", cmd_trials);\n\/\/        }\n\n\/\/        \/\/ ellipsoidal function\n\/\/        for (size_t n = 2; n <= cmd_dims; n *= 2)\n\/\/        {\n\/\/                const auto op_size = [=] ()\n\/\/                {\n\/\/                        return n;\n\/\/                };\n\n\/\/                const auto op_fval = [=] (const vector_t& x)\n\/\/                {\n\/\/                        scalar_t f = 0.0;\n\/\/                        for (size_t i = 0; i < n; i ++)\n\/\/                        {\n\/\/                                f += (i + 1.0) * ncv::math::square(x[i]);\n\/\/                        }\n\/\/                        return f;\n\/\/                };\n\n\/\/                const auto op_grad = [=] (const vector_t& x, vector_t& g)\n\/\/                {\n\/\/                        g.resize(n);\n\/\/                        for (size_t i = 0; i < n; i ++)\n\/\/                        {\n\/\/                                g(i) = 2.0 * (i + 1.0) * x[i];\n\/\/                        }\n\/\/                };\n\n\/\/                const auto op_fval_grad = [=] (const vector_t& x, vector_t& g)\n\/\/                {\n\/\/                        op_grad(x, g);\n\/\/                        return op_fval(x);\n\/\/                };\n\n\/\/                const problem_t problem(op_size, op_fval, op_fval_grad, cmd_iters, cmd_eps);\n\/\/                test(problem, \"ellipsoidal [\" + ncv::text::to_string(n) + \"D]\", cmd_trials);\n\/\/        }\n\n\/\/        \/\/ rotated ellipsoidal function\n\/\/        for (size_t n = 2; n <= cmd_dims; n *= 2)\n\/\/        {\n\/\/                const auto op_size = [=] ()\n\/\/                {\n\/\/                        return n;\n\/\/                };\n\n\/\/                const auto op_fval = [=] (const vector_t& x)\n\/\/                {\n\/\/                        scalar_t f = 0.0;\n\n\/\/                        for (size_t i = 0; i < n; i ++)\n\/\/                        {\n\/\/                                scalar_t s = 0.0;\n\/\/                                for (size_t j = 0; j <= i; j ++)\n\/\/                                {\n\/\/                                        s += x[j];\n\/\/                                }\n\n\/\/                                f += ncv::math::square(s);\n\/\/                        }\n\/\/                        return f;\n\/\/                };\n\n\/\/                const problem_t problem(op_size, op_fval, cmd_iters, cmd_eps);\n\/\/                test(problem, \"rotated ellipsoidal [\" + ncv::text::to_string(n) + \"D]\", cmd_trials);\n\/\/        }\n\n        \/\/ Whitley's function\n        for (size_t n = 2; n <= cmd_dims; n *= 2)\n        {\n                const auto op_size = [=] ()\n                {\n                        return n;\n                };\n\n                const auto op_fval = [=] (const vector_t& x)\n                {\n                        scalar_t f = 0.0;\n                        for (size_t i = 0; i < n; i ++)\n                        {\n                                for (size_t j = 0; j < n; j ++)\n                                {\n                                        const scalar_t d = 100.0 * ncv::math::square(x[i] * x[i] - x[j]) +\n                                                           ncv::math::square(1.0 - x[j]);\n                                        f += d * d \/ 4000.0 - std::cos(d) + 1.0;\n                                }\n                        }\n\n                        return f;\n                };\n\n                const problem_t problem(op_size, op_fval, cmd_iters, cmd_eps);\n                test(problem, \"whitley [\" + ncv::text::to_string(n) + \"D]\", cmd_trials);\n        }\n\n        \/\/ Rosenbrock problem\n        for (size_t n = 2; n <= cmd_dims; n *= 2)\n        {\n                const auto op_size = [=] ()\n                {\n                        return n;\n                };\n\n                const auto op_fval = [=] (const vector_t& x)\n                {\n                        scalar_t f = 0.0;\n                        for (size_t i = 0; i + 1 < n; i ++)\n                        {\n                                f += 100.0 * ncv::math::square(x[i + 1] - ncv::math::square(x[i])) +\n                                     ncv::math::square(x[i] - 1.0);\n                        }\n\n                        return f;\n                };\n\n                const problem_t problem(op_size, op_fval, cmd_iters, cmd_eps);\n                test(problem, \"rosenbrock [\" + ncv::text::to_string(n) + \"D]\", cmd_trials);\n        }\n\n        \/\/ Himmelblau problem\n        {\n                const auto op_size = [=] ()\n                {\n                        return 2;\n                };\n\n                const auto op_fval = [=] (const vector_t& x)\n                {\n                        return std::pow(x[0] * x[0] + x[1] - 11.0, 2.0) + std::pow(x[0] + x[1] * x[1] - 7.0, 2.0);\n                };\n\n                const auto op_grad = [=] (const vector_t& x, vector_t& g)\n                {\n                        g.resize(2);\n                        g[0] = 4.0 * x[0] * (x[0] * x[0] + x[1] - 11.0) + 2.0 * (x[0] + x[1] * x[1] - 7.0);\n                        g[1] = 2.0 * (x[0] * x[0] + x[1] - 11.0) + 4.0 * x[1] * (x[0] + x[1] * x[1] - 7.0);\n                };\n\n                const auto op_fval_grad = [=] (const vector_t& x, vector_t& g)\n                {\n                        op_grad(x, g);\n                        return op_fval(x);\n                };\n\n                const problem_t problem(op_size, op_fval, op_fval_grad, cmd_iters, cmd_eps);\n                test(problem, \"himmelblau [2D]\", cmd_trials);\n        }\n\n        \/\/ OK\n        ncv::log_info() << ncv::done;\n        return EXIT_SUCCESS;\n}\n<commit_msg>update test program<commit_after>#include \"ncv.h\"\n#include <boost\/program_options.hpp>\n\n\/\/ display the formatted optimization history\ntemplate\n<\n        typename tproblem\n>\nvoid print(const tproblem& problem,\n           const ncv::string_t& header,\n           ncv::size_t trial,\n           ncv::size_t trials,\n           const ncv::string_t& time)\n{\n        static const ncv::index_t col_size = 32;\n        static const ncv::string_t del_line(4 * col_size + 4, '-');\n\n        const ncv::string_t test =\n                \" [\" + ncv::text::to_string(trial + 1) + \"\/\" + ncv::text::to_string(trials) + \"]\";\n\n        std::cout << del_line << std::endl;\n        std::cout << header << test << \": x  = \" << problem.opt_x().transpose() << std::endl;\n        std::cout << header << test << \": fx = \" << problem.opt_fx() << std::endl;\n        std::cout << header << test << \": gn = \" << problem.opt_gn() << std::endl;\n        std::cout << header << test\n                  << \": #fevals = \" << problem.fevals()\n                  << \", #gevals = \" << problem.gevals()\n                  << \", #iterations = \" << problem.iterations() << \"\/\" << problem.max_iterations()\n                  << \" [done in \" << time << \"].\" << std::endl;\n        std::cout << del_line << std::endl;\n}\n\n\/\/ optimize a problem starting from random points\ntemplate\n<\n        typename tproblem\n>\nvoid test(const tproblem& problem, const ncv::string_t& name, ncv::size_t trials)\n{\n        const ncv::size_t size = problem.size();\n\n        ncv::random<typename tproblem::scalar_t> rgen(-1.0, 1.0);\n        for (size_t trial = 0; trial < trials; trial ++)\n        {\n                typename tproblem::vector_t x0(size);\n                rgen(x0.data(), x0.data() + x0.size());\n\n                ncv::timer timer;\n\n                timer.start();\n                ncv::optimize::gradient_descent(problem, x0);\n                print(problem, name + \" (GD)\", trial, trials, timer.elapsed_string());\n\n                timer.start();\n                ncv::optimize::conjugate_gradient_descent(problem, x0);\n                print(problem, name + \" (CGD)\", trial, trials, timer.elapsed_string());\n        }\n}\n\nint main(int argc, char *argv[])\n{\n        typedef ncv::size_t                             size_t;\n        typedef ncv::scalar_t                           scalar_t;\n        typedef ncv::vector_t                           vector_t;\n\n        typedef std::function<size_t(void)>                                     op_size_t;\n        typedef std::function<scalar_t(const vector_t&)>                        op_fval_t;\n        typedef std::function<scalar_t(const vector_t&, vector_t&)>             op_fval_grad_t;\n\n        typedef ncv::optimize::problem<\n                        scalar_t,\n                        op_size_t,\n                        op_fval_t,\n                        op_fval_grad_t>                 problem_t;\n\n        \/\/ parse the command line\n        boost::program_options::options_description po_desc(\"\", 160);\n        po_desc.add_options()(\"help,h\", \"help message\");\n        po_desc.add_options()(\"iters,i\",\n                boost::program_options::value<size_t>()->default_value(128),\n                \"number of iterations [8, 16000]\");\n        po_desc.add_options()(\"eps,e\",\n                boost::program_options::value<scalar_t>()->default_value(0.00001),\n                \"convergence accuracy [1e-20, 1e-1]\");\n        po_desc.add_options()(\"dim,d\",\n                boost::program_options::value<size_t>()->default_value(16),\n                \"maximum dimension [2, 1024]\");\n\n        boost::program_options::variables_map po_vm;\n        boost::program_options::store(\n                boost::program_options::command_line_parser(argc, argv).options(po_desc).run(),\n                po_vm);\n        boost::program_options::notify(po_vm);\n\n        \/\/ check arguments and options\n        if (\tpo_vm.empty() ||\n                po_vm.count(\"help\"))\n        {\n                std::cout << po_desc;\n                return EXIT_FAILURE;\n        }\n\n        const size_t cmd_iters = ncv::math::clamp(po_vm[\"iters\"].as<size_t>(), 8, 16000);\n        const scalar_t cmd_eps = ncv::math::clamp(po_vm[\"eps\"].as<scalar_t>(), 1e-20, 1e-1);\n        const size_t cmd_dims = ncv::math::clamp(po_vm[\"dim\"].as<size_t>(), 2, 1024);\n        const size_t cmd_trials = 16;\n\n\/\/        \/\/ sphere function\n\/\/        for (size_t n = 2; n <= cmd_dims; n *= 2)\n\/\/        {\n\/\/                const auto op_size = [=] ()\n\/\/                {\n\/\/                        return n;\n\/\/                };\n\n\/\/                const auto op_fval = [=] (const vector_t& x)\n\/\/                {\n\/\/                        return x.dot(x);\n\/\/                };\n\n\/\/                const auto op_grad = [=] (const vector_t& x, vector_t& g)\n\/\/                {\n\/\/                        g = 2.0 * x;\n\/\/                };\n\n\/\/                const auto op_fval_grad = [=] (const vector_t& x, vector_t& g)\n\/\/                {\n\/\/                        op_grad(x, g);\n\/\/                        return op_fval(x);\n\/\/                };\n\n\/\/                const problem_t problem(op_size, op_fval, op_fval_grad, cmd_iters, cmd_eps);\n\/\/                test(problem, \"sphere [\" + ncv::text::to_string(n) + \"D]\", cmd_trials);\n\/\/        }\n\n\/\/        \/\/ ellipsoidal function\n\/\/        for (size_t n = 2; n <= cmd_dims; n *= 2)\n\/\/        {\n\/\/                const auto op_size = [=] ()\n\/\/                {\n\/\/                        return n;\n\/\/                };\n\n\/\/                const auto op_fval = [=] (const vector_t& x)\n\/\/                {\n\/\/                        scalar_t f = 0.0;\n\/\/                        for (size_t i = 0; i < n; i ++)\n\/\/                        {\n\/\/                                f += (i + 1.0) * ncv::math::square(x[i]);\n\/\/                        }\n\/\/                        return f;\n\/\/                };\n\n\/\/                const auto op_grad = [=] (const vector_t& x, vector_t& g)\n\/\/                {\n\/\/                        g.resize(n);\n\/\/                        for (size_t i = 0; i < n; i ++)\n\/\/                        {\n\/\/                                g(i) = 2.0 * (i + 1.0) * x[i];\n\/\/                        }\n\/\/                };\n\n\/\/                const auto op_fval_grad = [=] (const vector_t& x, vector_t& g)\n\/\/                {\n\/\/                        op_grad(x, g);\n\/\/                        return op_fval(x);\n\/\/                };\n\n\/\/                const problem_t problem(op_size, op_fval, op_fval_grad, cmd_iters, cmd_eps);\n\/\/                test(problem, \"ellipsoidal [\" + ncv::text::to_string(n) + \"D]\", cmd_trials);\n\/\/        }\n\n\/\/        \/\/ rotated ellipsoidal function\n\/\/        for (size_t n = 2; n <= cmd_dims; n *= 2)\n\/\/        {\n\/\/                const auto op_size = [=] ()\n\/\/                {\n\/\/                        return n;\n\/\/                };\n\n\/\/                const auto op_fval = [=] (const vector_t& x)\n\/\/                {\n\/\/                        scalar_t f = 0.0;\n\n\/\/                        for (size_t i = 0; i < n; i ++)\n\/\/                        {\n\/\/                                scalar_t s = 0.0;\n\/\/                                for (size_t j = 0; j <= i; j ++)\n\/\/                                {\n\/\/                                        s += x[j];\n\/\/                                }\n\n\/\/                                f += ncv::math::square(s);\n\/\/                        }\n\/\/                        return f;\n\/\/                };\n\n\/\/                const problem_t problem(op_size, op_fval, cmd_iters, cmd_eps);\n\/\/                test(problem, \"rotated ellipsoidal [\" + ncv::text::to_string(n) + \"D]\", cmd_trials);\n\/\/        }\n\n        \/\/ Whitley's function\n        for (size_t n = 2; n <= cmd_dims; n *= 2)\n        {\n                const auto op_size = [=] ()\n                {\n                        return n;\n                };\n\n                TODO: this does not converge nicely!\n\n                const auto op_fval = [=] (const vector_t& x)\n                {\n                        scalar_t f = 0.0;\n                        for (size_t i = 0; i < n; i ++)\n                        {\n                                for (size_t j = 0; j < n; j ++)\n                                {\n                                        const scalar_t d = 100.0 * ncv::math::square(x[i] * x[i] - x[j]) +\n                                                           ncv::math::square(1.0 - x[j]);\n                                        f += d * d \/ 4000.0 - std::cos(d) + 1.0;\n                                }\n                        }\n\n                        return f;\n                };\n\n                const problem_t problem(op_size, op_fval, cmd_iters, cmd_eps);\n                test(problem, \"whitley [\" + ncv::text::to_string(n) + \"D]\", cmd_trials);\n        }\n\n        \/\/ Rosenbrock problem\n        for (size_t n = 2; n <= cmd_dims; n *= 2)\n        {\n                const auto op_size = [=] ()\n                {\n                        return n;\n                };\n\n                const auto op_fval = [=] (const vector_t& x)\n                {\n                        scalar_t f = 0.0;\n                        for (size_t i = 0; i + 1 < n; i ++)\n                        {\n                                f += 100.0 * ncv::math::square(x[i + 1] - ncv::math::square(x[i])) +\n                                     ncv::math::square(x[i] - 1.0);\n                        }\n\n                        return f;\n                };\n\n                const problem_t problem(op_size, op_fval, cmd_iters, cmd_eps);\n                test(problem, \"rosenbrock [\" + ncv::text::to_string(n) + \"D]\", cmd_trials);\n        }\n\n        \/\/ Himmelblau problem\n        {\n                const auto op_size = [=] ()\n                {\n                        return 2;\n                };\n\n                const auto op_fval = [=] (const vector_t& x)\n                {\n                        return std::pow(x[0] * x[0] + x[1] - 11.0, 2.0) + std::pow(x[0] + x[1] * x[1] - 7.0, 2.0);\n                };\n\n                const auto op_grad = [=] (const vector_t& x, vector_t& g)\n                {\n                        g.resize(2);\n                        g[0] = 4.0 * x[0] * (x[0] * x[0] + x[1] - 11.0) + 2.0 * (x[0] + x[1] * x[1] - 7.0);\n                        g[1] = 2.0 * (x[0] * x[0] + x[1] - 11.0) + 4.0 * x[1] * (x[0] + x[1] * x[1] - 7.0);\n                };\n\n                const auto op_fval_grad = [=] (const vector_t& x, vector_t& g)\n                {\n                        op_grad(x, g);\n                        return op_fval(x);\n                };\n\n                const problem_t problem(op_size, op_fval, op_fval_grad, cmd_iters, cmd_eps);\n                test(problem, \"himmelblau [2D]\", cmd_trials);\n        }\n\n        \/\/ OK\n        ncv::log_info() << ncv::done;\n        return EXIT_SUCCESS;\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 \"rpcserver.h\"\n#include \"main.h\"\n#include \"kernel.h\"\n#include \"checkpoints.h\"\n\nusing namespace json_spirit;\nusing namespace std;\n\nextern void TxToJSON(const CTransaction& tx, const uint256 hashBlock, json_spirit::Object& entry);\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    {\n        if (pindexBest == NULL)\n            return 1.0;\n        else\n            blockindex = GetLastBlockIndex(pindexBest, false);\n    }\n\n    int nShift = (blockindex->nBits >> 24) & 0xff;\n\n    double dDiff =\n        (double)0x0000ffff \/ (double)(blockindex->nBits & 0x00ffffff);\n\n    while (nShift < 29)\n    {\n        dDiff *= 256.0;\n        nShift++;\n    }\n    while (nShift > 29)\n    {\n        dDiff \/= 256.0;\n        nShift--;\n    }\n\n    return dDiff;\n}\n\ndouble GetPoWMHashPS()\n{\n    if (pindexBest->nHeight >= LAST_POW_TIME)\n        return 0;\n\n    int nPoWInterval = 72;\n    int64_t nTargetSpacingWorkMin = 30, nTargetSpacingWork = 30;\n\n    CBlockIndex* pindex = pindexGenesisBlock;\n    CBlockIndex* pindexPrevWork = pindexGenesisBlock;\n\n    while (pindex)\n    {\n        if (pindex->IsProofOfWork())\n        {\n            int64_t nActualSpacingWork = pindex->GetBlockTime() - pindexPrevWork->GetBlockTime();\n            nTargetSpacingWork = ((nPoWInterval - 1) * nTargetSpacingWork + nActualSpacingWork + nActualSpacingWork) \/ (nPoWInterval + 1);\n            nTargetSpacingWork = max(nTargetSpacingWork, nTargetSpacingWorkMin);\n            pindexPrevWork = pindex;\n        }\n\n        pindex = 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    CBlockIndex* pindex = pindexBest;;\n    CBlockIndex* pindexPrevStake = NULL;\n\n    while (pindex && nStakesHandled < nPoSInterval)\n    {\n        if (pindex->IsProofOfStake())\n        {\n            if (pindexPrevStake)\n            {\n                dStakeKernelsTriedAvg += GetDifficulty(pindexPrevStake) * 4294967296.0;\n                nStakesTime += pindexPrevStake->nTime - pindex->nTime;\n                nStakesHandled++;\n            }\n            pindexPrevStake = pindex;\n        }\n\n        pindex = pindex->pprev;\n    }\n\n    double result = 0;\n\n    if (nStakesTime)\n        result = dStakeKernelsTriedAvg \/ nStakesTime;\n\n    if (IsProtocolV2(nBestHeight))\n        result *= STAKE_TIMESTAMP_MASK + 1;\n\n    return result;\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    int confirmations = -1;\n    \/\/ Only report confirmations if the block is on the main chain\n    if (blockindex->IsInMainChain())\n        confirmations = nBestHeight - blockindex->nHeight + 1;\n    result.push_back(Pair(\"confirmations\", confirmations));\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(\"flags\", strprintf(\"%s%s\", blockindex->IsProofOfStake()? \"proof-of-stake\" : \"proof-of-work\", 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(\"%016x\", blockindex->nStakeModifier)));\n    result.push_back(Pair(\"modifierv2\", blockindex->bnStakeModifierV2.GetHex()));\n    Array txinfo;\n    BOOST_FOREACH (const CTransaction& tx, block.vtx)\n    {\n        if (fPrintTransactionDetail)\n        {\n            Object entry;\n\n            entry.push_back(Pair(\"txid\", tx.GetHash().GetHex()));\n            TxToJSON(tx, 0, entry);\n\n            txinfo.push_back(entry);\n        }\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(\n            \"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(\n            \"getblockcount\\n\"\n            \"Returns the number of blocks in the longest block chain.\");\n\n    return nBestHeight;\n}\n\n\nValue getdifficulty(const Array& params, bool fHelp)\n{\n    if (fHelp || params.size() != 0)\n        throw runtime_error(\n            \"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, true))));\n    return obj;\n}\n\n\nValue getrawmempool(const Array& params, bool fHelp)\n{\n    if (fHelp || params.size() != 0)\n        throw runtime_error(\n            \"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(\n            \"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    CBlockIndex* pblockindex = FindBlockByHeight(nHeight);\n    return pblockindex->phashBlock->GetHex();\n}\n\nValue getblock(const JSONRPCRequest& request)\n{\n    if (request.fHelp || request.params.size() < 1 || request.params.size() > 2)\n        throw std::runtime_error(\n            \"getblock \\\"blockhash\\\" ( verbosity ) \\n\"\n            \"\\nIf verbosity is 0, returns a string that is serialized, hex-encoded data for block 'hash'.\\n\"\n            \"If verbosity is 1, returns an Object with information about block <hash>.\\n\"\n            \"If verbosity is 2, returns an Object with information about block <hash> and information about each transaction. \\n\"\n            \"\\nArguments:\\n\"\n            \"1. \\\"blockhash\\\"          (string, required) The block hash\\n\"\n            \"2. verbosity              (numeric, optional, default=1) 0 for hex encoded data, 1 for a json object, and 2 for json object with transaction data\\n\"\n            \"\\nResult (for verbosity = 0):\\n\"\n            \"\\\"data\\\"             (string) A string that is serialized, hex-encoded data for block 'hash'.\\n\"\n            \"\\nResult (for verbosity = 1):\\n\"\n            \"{\\n\"\n            \"  \\\"hash\\\" : \\\"hash\\\",     (string) the block hash (same as provided)\\n\"\n            \"  \\\"confirmations\\\" : n,   (numeric) The number of confirmations, or -1 if the block is not on the main chain\\n\"\n            \"  \\\"size\\\" : n,            (numeric) The block size\\n\"\n            \"  \\\"strippedsize\\\" : n,    (numeric) The block size excluding witness data\\n\"\n            \"  \\\"weight\\\" : n           (numeric) The block weight as defined in BIP 141\\n\"\n            \"  \\\"height\\\" : n,          (numeric) The block height or index\\n\"\n            \"  \\\"version\\\" : n,         (numeric) The block version\\n\"\n            \"  \\\"versionHex\\\" : \\\"00000000\\\", (string) The block version formatted in hexadecimal\\n\"\n            \"  \\\"merkleroot\\\" : \\\"xxxx\\\", (string) The merkle root\\n\"\n            \"  \\\"tx\\\" : [               (array of string) The transaction ids\\n\"\n            \"     \\\"transactionid\\\"     (string) The transaction id\\n\"\n            \"     ,...\\n\"\n            \"  ],\\n\"\n            \"  \\\"time\\\" : ttt,          (numeric) The block time in seconds since epoch (Jan 1 1970 GMT)\\n\"\n            \"  \\\"mediantime\\\" : ttt,    (numeric) The median block time in seconds since epoch (Jan 1 1970 GMT)\\n\"\n            \"  \\\"nonce\\\" : n,           (numeric) The nonce\\n\"\n            \"  \\\"bits\\\" : \\\"1d00ffff\\\", (string) The bits\\n\"\n            \"  \\\"difficulty\\\" : x.xxx,  (numeric) The difficulty\\n\"\n            \"  \\\"chainwork\\\" : \\\"xxxx\\\",  (string) Expected number of hashes required to produce the chain up to this block (in hex)\\n\"\n            \"  \\\"previousblockhash\\\" : \\\"hash\\\",  (string) The hash of the previous block\\n\"\n            \"  \\\"nextblockhash\\\" : \\\"hash\\\"       (string) The hash of the next block\\n\"\n            \"}\\n\"\n            \"\\nResult (for verbosity = 2):\\n\"\n            \"{\\n\"\n            \"  ...,                     Same output as verbosity = 1.\\n\"\n            \"  \\\"tx\\\" : [               (array of Objects) The transactions in the format of the getrawtransaction RPC. Different from verbosity = 1 \\\"tx\\\" result.\\n\"\n            \"         ,...\\n\"\n            \"  ],\\n\"\n            \"  ,...                     Same output as verbosity = 1.\\n\"\n            \"}\\n\"\n            \"\\nExamples:\\n\"\n            + HelpExampleCli(\"getblock\", \"\\\"00000000c937983704a73af28acdec37b049d214adbda81d7e2a3dd146f6ed09\\\"\")\n            + HelpExampleRpc(\"getblock\", \"\\\"00000000c937983704a73af28acdec37b049d214adbda81d7e2a3dd146f6ed09\\\"\")\n        );\n\n    LOCK(cs_main);\n\n    std::string strHash = request.params[0].get_str();\n    uint256 hash(uint256S(strHash));\n\n    int verbosity = 1;\n    if (request.params.size() > 1) {\n        if(request.params[1].isNum())\n            verbosity = request.params[1].get_int();\n        else\n            verbosity = request.params[1].get_bool() ? 1 : 0;\n    }\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\n    if (fHavePruned && !(pblockindex->nStatus & BLOCK_HAVE_DATA) && pblockindex->nTx > 0)\n        throw JSONRPCError(RPC_MISC_ERROR, \"Block not available (pruned data)\");\n\n    if (!ReadBlockFromDisk(block, pblockindex, Params().GetConsensus()))\n        \/\/ Block not found on disk. This could be because we have the block\n        \/\/ header in our index but don't have the block (for example if a\n        \/\/ non-whitelisted node sends us an unrequested long chain of valid\n        \/\/ blocks, we add the headers to our index, but don't accept the\n        \/\/ block).\n        throw JSONRPCError(RPC_MISC_ERROR, \"Block not found on disk\");\n\n    if (verbosity <= 0)\n    {\n        CDataStream ssBlock(SER_NETWORK, PROTOCOL_VERSION | RPCSerializationFlags());\n        ssBlock << block;\n        std::string strHex = HexStr(ssBlock.begin(), ssBlock.end());\n        return strHex;\n    }\n\n    return blockToJSON(block, pblockindex, verbosity >= 2);\n}\nValue getblockbynumber(const Array& params, bool fHelp)\n{\n    if (fHelp || params.size() < 1 || params.size() > 2)\n        throw runtime_error(\n            \"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    CBlockIndex* pblockindex = mapBlockIndex[hashBestChain];\n    while (pblockindex->nHeight > nHeight)\n        pblockindex = pblockindex->pprev;\n\n    uint256 hash = *pblockindex->phashBlock;\n\n    pblockindex = mapBlockIndex[hash];\n    block.ReadFromDisk(pblockindex, true);\n\n    return blockToJSON(block, pblockindex, 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(\n            \"getcheckpoint\\n\"\n            \"Show info of synchronized checkpoint.\\n\");\n\n    Object result;\n    const CBlockIndex* pindexCheckpoint = Checkpoints::AutoSelectSyncCheckpoint();\n\n    result.push_back(Pair(\"synccheckpoint\", pindexCheckpoint->GetBlockHash().ToString().c_str()));\n    result.push_back(Pair(\"height\", pindexCheckpoint->nHeight));\n    result.push_back(Pair(\"timestamp\", DateTimeStrFormat(pindexCheckpoint->GetBlockTime()).c_str()));\n\n    result.push_back(Pair(\"policy\", \"rolling\"));\n\n    return result;\n}\n<commit_msg>Updated getblock() - fix<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 \"rpcserver.h\"\n#include \"main.h\"\n#include \"kernel.h\"\n#include \"checkpoints.h\"\n\nusing namespace json_spirit;\nusing namespace std;\n\nextern void TxToJSON(const CTransaction& tx, const uint256 hashBlock, json_spirit::Object& entry);\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    {\n        if (pindexBest == NULL)\n            return 1.0;\n        else\n            blockindex = GetLastBlockIndex(pindexBest, false);\n    }\n\n    int nShift = (blockindex->nBits >> 24) & 0xff;\n\n    double dDiff =\n        (double)0x0000ffff \/ (double)(blockindex->nBits & 0x00ffffff);\n\n    while (nShift < 29)\n    {\n        dDiff *= 256.0;\n        nShift++;\n    }\n    while (nShift > 29)\n    {\n        dDiff \/= 256.0;\n        nShift--;\n    }\n\n    return dDiff;\n}\n\ndouble GetPoWMHashPS()\n{\n    if (pindexBest->nHeight >= LAST_POW_TIME)\n        return 0;\n\n    int nPoWInterval = 72;\n    int64_t nTargetSpacingWorkMin = 30, nTargetSpacingWork = 30;\n\n    CBlockIndex* pindex = pindexGenesisBlock;\n    CBlockIndex* pindexPrevWork = pindexGenesisBlock;\n\n    while (pindex)\n    {\n        if (pindex->IsProofOfWork())\n        {\n            int64_t nActualSpacingWork = pindex->GetBlockTime() - pindexPrevWork->GetBlockTime();\n            nTargetSpacingWork = ((nPoWInterval - 1) * nTargetSpacingWork + nActualSpacingWork + nActualSpacingWork) \/ (nPoWInterval + 1);\n            nTargetSpacingWork = max(nTargetSpacingWork, nTargetSpacingWorkMin);\n            pindexPrevWork = pindex;\n        }\n\n        pindex = 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    CBlockIndex* pindex = pindexBest;;\n    CBlockIndex* pindexPrevStake = NULL;\n\n    while (pindex && nStakesHandled < nPoSInterval)\n    {\n        if (pindex->IsProofOfStake())\n        {\n            if (pindexPrevStake)\n            {\n                dStakeKernelsTriedAvg += GetDifficulty(pindexPrevStake) * 4294967296.0;\n                nStakesTime += pindexPrevStake->nTime - pindex->nTime;\n                nStakesHandled++;\n            }\n            pindexPrevStake = pindex;\n        }\n\n        pindex = pindex->pprev;\n    }\n\n    double result = 0;\n\n    if (nStakesTime)\n        result = dStakeKernelsTriedAvg \/ nStakesTime;\n\n    if (IsProtocolV2(nBestHeight))\n        result *= STAKE_TIMESTAMP_MASK + 1;\n\n    return result;\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    int confirmations = -1;\n    \/\/ Only report confirmations if the block is on the main chain\n    if (blockindex->IsInMainChain())\n        confirmations = nBestHeight - blockindex->nHeight + 1;\n    result.push_back(Pair(\"confirmations\", confirmations));\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(\"flags\", strprintf(\"%s%s\", blockindex->IsProofOfStake()? \"proof-of-stake\" : \"proof-of-work\", 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(\"%016x\", blockindex->nStakeModifier)));\n    result.push_back(Pair(\"modifierv2\", blockindex->bnStakeModifierV2.GetHex()));\n    Array txinfo;\n    BOOST_FOREACH (const CTransaction& tx, block.vtx)\n    {\n        if (fPrintTransactionDetail)\n        {\n            Object entry;\n\n            entry.push_back(Pair(\"txid\", tx.GetHash().GetHex()));\n            TxToJSON(tx, 0, entry);\n\n            txinfo.push_back(entry);\n        }\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(\n            \"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(\n            \"getblockcount\\n\"\n            \"Returns the number of blocks in the longest block chain.\");\n\n    return nBestHeight;\n}\n\n\nValue getdifficulty(const Array& params, bool fHelp)\n{\n    if (fHelp || params.size() != 0)\n        throw runtime_error(\n            \"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, true))));\n    return obj;\n}\n\n\nValue getrawmempool(const Array& params, bool fHelp)\n{\n    if (fHelp || params.size() != 0)\n        throw runtime_error(\n            \"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(\n            \"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    CBlockIndex* pblockindex = FindBlockByHeight(nHeight);\n    return pblockindex->phashBlock->GetHex();\n}\n\nValue getblock(const Array& params, bool fHelp)\n{\n    if (fHelp || params.size() < 1 || params.size() > 2)\n        throw runtime_error(\n            \"getblock \\\"blockhash\\\" ( verbosity ) \\n\"\n            \"\\nIf verbosity is 0, returns a string that is serialized, hex-encoded data for block 'hash'.\\n\"\n            \"If verbosity is 1, returns an Object with information about block <hash>.\\n\"\n            \"If verbosity is 2, returns an Object with information about block <hash> and information about each transaction. \\n\"\n            \"\\nArguments:\\n\"\n            \"1. \\\"blockhash\\\"          (string, required) The block hash\\n\"\n            \"2. verbosity              (numeric, optional, default=1) 0 for hex encoded data, 1 for a json object, and 2 for json object with transaction data\\n\"\n            \"\\nResult (for verbosity = 0):\\n\"\n            \"\\\"data\\\"             (string) A string that is serialized, hex-encoded data for block 'hash'.\\n\"\n            \"\\nResult (for verbosity = 1):\\n\"\n            \"{\\n\"\n            \"  \\\"hash\\\" : \\\"hash\\\",     (string) the block hash (same as provided)\\n\"\n            \"  \\\"confirmations\\\" : n,   (numeric) The number of confirmations, or -1 if the block is not on the main chain\\n\"\n            \"  \\\"size\\\" : n,            (numeric) The block size\\n\"\n            \"  \\\"strippedsize\\\" : n,    (numeric) The block size excluding witness data\\n\"\n            \"  \\\"weight\\\" : n           (numeric) The block weight as defined in BIP 141\\n\"\n            \"  \\\"height\\\" : n,          (numeric) The block height or index\\n\"\n            \"  \\\"version\\\" : n,         (numeric) The block version\\n\"\n            \"  \\\"versionHex\\\" : \\\"00000000\\\", (string) The block version formatted in hexadecimal\\n\"\n            \"  \\\"merkleroot\\\" : \\\"xxxx\\\", (string) The merkle root\\n\"\n            \"  \\\"tx\\\" : [               (array of string) The transaction ids\\n\"\n            \"     \\\"transactionid\\\"     (string) The transaction id\\n\"\n            \"     ,...\\n\"\n            \"  ],\\n\"\n            \"  \\\"time\\\" : ttt,          (numeric) The block time in seconds since epoch (Jan 1 1970 GMT)\\n\"\n            \"  \\\"mediantime\\\" : ttt,    (numeric) The median block time in seconds since epoch (Jan 1 1970 GMT)\\n\"\n            \"  \\\"nonce\\\" : n,           (numeric) The nonce\\n\"\n            \"  \\\"bits\\\" : \\\"1d00ffff\\\", (string) The bits\\n\"\n            \"  \\\"difficulty\\\" : x.xxx,  (numeric) The difficulty\\n\"\n            \"  \\\"chainwork\\\" : \\\"xxxx\\\",  (string) Expected number of hashes required to produce the chain up to this block (in hex)\\n\"\n            \"  \\\"previousblockhash\\\" : \\\"hash\\\",  (string) The hash of the previous block\\n\"\n            \"  \\\"nextblockhash\\\" : \\\"hash\\\"       (string) The hash of the next block\\n\"\n            \"}\\n\"\n            \"\\nResult (for verbosity = 2):\\n\"\n            \"{\\n\"\n            \"  ...,                     Same output as verbosity = 1.\\n\"\n            \"  \\\"tx\\\" : [               (array of Objects) The transactions in the format of the getrawtransaction RPC. Different from verbosity = 1 \\\"tx\\\" result.\\n\"\n            \"         ,...\\n\"\n            \"  ],\\n\"\n            \"  ,...                     Same output as verbosity = 1.\\n\"\n            \"}\\n\"\n            \"\\nExamples:\\n\"\n        );\n\n    LOCK(cs_main);\n\n    std::string strHash = params[0].get_str();\n    uint256 hash(strHash);\n\n    int verbosity = 1;\n\t\n\tstd::string check_verbosity = params[1].get_str();\n    if (params.size() > 1) {\n        \/\/if(params[1].isNum())\n\t\tif(params[1].get_int())\n            verbosity = params[1].get_int();\n        else\n            verbosity = params[1].get_bool() ? 1 : 0;\n    }\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\n    if (verbosity <= 0)\n    {\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, verbosity >= 2);\n}\nValue getblockbynumber(const Array& params, bool fHelp)\n{\n    if (fHelp || params.size() < 1 || params.size() > 2)\n        throw runtime_error(\n            \"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    CBlockIndex* pblockindex = mapBlockIndex[hashBestChain];\n    while (pblockindex->nHeight > nHeight)\n        pblockindex = pblockindex->pprev;\n\n    uint256 hash = *pblockindex->phashBlock;\n\n    pblockindex = mapBlockIndex[hash];\n    block.ReadFromDisk(pblockindex, true);\n\n    return blockToJSON(block, pblockindex, 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(\n            \"getcheckpoint\\n\"\n            \"Show info of synchronized checkpoint.\\n\");\n\n    Object result;\n    const CBlockIndex* pindexCheckpoint = Checkpoints::AutoSelectSyncCheckpoint();\n\n    result.push_back(Pair(\"synccheckpoint\", pindexCheckpoint->GetBlockHash().ToString().c_str()));\n    result.push_back(Pair(\"height\", pindexCheckpoint->nHeight));\n    result.push_back(Pair(\"timestamp\", DateTimeStrFormat(pindexCheckpoint->GetBlockTime()).c_str()));\n\n    result.push_back(Pair(\"policy\", \"rolling\"));\n\n    return result;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Fix WebGL build.<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>Remove unneeded ATL header includes.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ -*- coding: us-ascii-unix -*-\n\/\/ Copyright 2013 Lukas Kemmer\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\"); you\n\/\/ may not use this file except in compliance with the License. You\n\/\/ may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n\/\/ implied. See the License for the specific language governing\n\/\/ permissions and limitations under the License.\n\n#include \"wx\/button.h\"\n#include \"wx\/dialog.h\"\n#include \"wx\/sizer.h\"\n#include \"wx\/stattext.h\"\n#include \"gui\/ui-constants.hh\"\n#include \"util-wx\/layout-wx.hh\"\n#include \"util\/iter.hh\"\n\nnamespace faint{namespace layout{\n\nconst int EXPAND = wxEXPAND;\nconst int DOWN = wxDOWN;\nconst int UP = wxUP;\nconst int ALIGN_RIGHT = wxALIGN_RIGHT;\n\nSizerItem::SizerItem(wxWindow* item, Proportion p, int flags, int border)\n  : border(border),\n    flags(flags),\n    proportion(p),\n    windowItem(item)\n{}\n\nSizerItem::SizerItem(wxWindow* item)\n  : flags(wxALIGN_CENTER),\n    windowItem(item)\n{}\n\nSizerItem::SizerItem(wxButton* item)\n  : SizerItem(static_cast<wxWindow*>(item))\n{}\n\nSizerItem::SizerItem(wxStaticText* item)\n  : SizerItem(static_cast<wxWindow*>(item))\n{}\n\nSizerItem::SizerItem(wxSizer* item, Proportion p, int flags, int border)\n  : border(border),\n    flags(flags),\n    proportion(p),\n    sizerItem(item)\n{}\n\nSizerItem::SizerItem(wxSizer* item)\n  : flags(wxALIGN_CENTER),\n    sizerItem(item)\n{}\n\nSizerItem::SizerItem(wxButton* item, int flags)\n  : flags(flags),\n    windowItem(item)\n{}\n\nbool add(wxBoxSizer* sizer, const SizerItem& item){\n  if (item.windowItem != nullptr){\n    sizer->Add(item.windowItem, item.proportion.Get(), item.flags, item.border);\n    return true;\n  }\n  else if (item.sizerItem != nullptr){\n    sizer->Add(item.sizerItem, item.proportion.Get(), item.flags, item.border);\n    return true;\n  }\n  return false;\n}\n\nwxSizer* create_row(const std::vector<SizerItem>& items){\n  wxBoxSizer* row = new wxBoxSizer(wxHORIZONTAL);\n\n  row->AddSpacer(ui::panel_padding);\n  for (auto& item : but_last(items)){\n    if (add(row, item)){\n      row->AddSpacer(ui::item_spacing);\n    }\n  }\n  add(row, items.back());\n  row->AddSpacer(ui::panel_padding);\n  return row;\n}\n\nwxSizer* create_row(OuterSpacing os, ItemSpacing is,\n  const std::vector<SizerItem>& items)\n{\n  \/\/ Fixme: Unify this and create_column\n  wxBoxSizer* column = new wxBoxSizer(wxHORIZONTAL);\n  if (os != 0){\n    column->AddSpacer(os);\n  }\n\n  for (auto& item : but_last(items)){\n    if (item.windowItem != nullptr){\n      column->Add(item.windowItem, item.proportion.Get(), item.flags, item.border);\n    }\n    else{\n      column->Add(item.sizerItem, item.proportion.Get(), item.flags, item.border);\n    }\n    if (is != 0){\n      column->AddSpacer(is);\n    }\n  }\n  auto& last = items.back();\n  if (last.windowItem != nullptr){\n    column->Add(last.windowItem, last.proportion.Get(), last.flags, last.border);\n  }\n  else{\n    column->Add(last.sizerItem, last.proportion.Get(), last.flags, last.border);\n  }\n  if (os != 0){\n    column->AddSpacer(os);\n  }\n\n  return column;\n}\n\n\nwxSizer* create_row_outer_pad(const std::vector<SizerItem>& items){\n  wxBoxSizer* row = new wxBoxSizer(wxHORIZONTAL);\n  row->AddSpacer(ui::panel_padding);\n  for (auto& item : but_last(items)){\n    add(row, item);\n  }\n  add(row, items.back());\n  row->AddSpacer(ui::panel_padding);\n  return row;\n}\n\nwxSizer* create_row_no_pad(const std::vector<SizerItem>& items){\n  wxBoxSizer* row = new wxBoxSizer(wxHORIZONTAL);\n  for (auto& item : items){\n    if (item.windowItem != nullptr){\n      row->Add(item.windowItem, item.proportion.Get(), item.flags, item.border);\n    }\n    else{\n      row->Add(item.sizerItem, item.proportion.Get(), item.flags, item.border);\n    }\n  }\n  return row;\n}\n\nwxSizer* create_column(OuterSpacing os, ItemSpacing is,\n  const std::vector<SizerItem>& items)\n{\n  wxBoxSizer* column = new wxBoxSizer(wxVERTICAL);\n  if (os != 0){\n    column->AddSpacer(os);\n  }\n\n  for (auto& item : but_last(items)){\n    if (item.windowItem != nullptr){\n      column->Add(item.windowItem, item.proportion.Get(), item.flags, item.border);\n    }\n    else{\n      column->Add(item.sizerItem, item.proportion.Get(), item.flags, item.border);\n    }\n    if (is != 0){\n      column->AddSpacer(is);\n    }\n  }\n  auto& last = items.back();\n  if (last.windowItem != nullptr){\n    column->Add(last.windowItem, last.proportion.Get(), last.flags, last.border);\n  }\n  else{\n    column->Add(last.sizerItem, last.proportion.Get(), last.flags, last.border);\n  }\n  if (os != 0){\n    column->AddSpacer(os);\n  }\n\n  return column;\n}\n\nwxSizer* create_column(const std::vector<SizerItem>& items){\n  return create_column(OuterSpacing(ui::panel_padding), ui::item_spacing, items);\n\n}\nSizerItem grow(wxSizer* sizer){\n  return SizerItem(sizer, 1, wxEXPAND);\n}\n\nSizerItem grow(wxWindow* window){\n  return SizerItem(window, 1, wxEXPAND);\n}\n\nSizerItem center(wxSizer* sizer){\n  return SizerItem(sizer, 0, wxALIGN_CENTER);\n}\n\nwxWindow* make_default(wxDialog* parent, wxWindow* item){\n  parent->SetDefaultItem(item);\n  return item;\n}\n\nwxButton* make_default(wxDialog* parent, wxButton* item){\n  parent->SetDefaultItem(item);\n  return item;\n}\n\nwxStaticText* label(wxWindow* parent, const wxString& text){\n  return new wxStaticText(parent, wxID_ANY, text);\n}\n\n}} \/\/ namespace\n<commit_msg>Changed default sizer flags to 0 to fix align<commit_after>\/\/ -*- coding: us-ascii-unix -*-\n\/\/ Copyright 2013 Lukas Kemmer\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\"); you\n\/\/ may not use this file except in compliance with the License. You\n\/\/ may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n\/\/ implied. See the License for the specific language governing\n\/\/ permissions and limitations under the License.\n\n#include \"wx\/button.h\"\n#include \"wx\/dialog.h\"\n#include \"wx\/sizer.h\"\n#include \"wx\/stattext.h\"\n#include \"gui\/ui-constants.hh\"\n#include \"util-wx\/layout-wx.hh\"\n#include \"util\/iter.hh\"\n\nnamespace faint{namespace layout{\n\nconst int EXPAND = wxEXPAND;\nconst int DOWN = wxDOWN;\nconst int UP = wxUP;\nconst int ALIGN_RIGHT = wxALIGN_RIGHT;\n\nSizerItem::SizerItem(wxWindow* item, Proportion p, int flags, int border)\n  : border(border),\n    flags(flags),\n    proportion(p),\n    windowItem(item)\n{}\n\nSizerItem::SizerItem(wxWindow* item)\n  : flags(0),\n    windowItem(item)\n{}\n\nSizerItem::SizerItem(wxButton* item)\n  : SizerItem(static_cast<wxWindow*>(item))\n{}\n\nSizerItem::SizerItem(wxStaticText* item)\n  : SizerItem(static_cast<wxWindow*>(item))\n{}\n\nSizerItem::SizerItem(wxSizer* item, Proportion p, int flags, int border)\n  : border(border),\n    flags(flags),\n    proportion(p),\n    sizerItem(item)\n{}\n\nSizerItem::SizerItem(wxSizer* item)\n  : flags(0),\n    sizerItem(item)\n{}\n\nSizerItem::SizerItem(wxButton* item, int flags)\n  : flags(flags),\n    windowItem(item)\n{}\n\nbool add(wxBoxSizer* sizer, const SizerItem& item){\n  if (item.windowItem != nullptr){\n    sizer->Add(item.windowItem, item.proportion.Get(), item.flags, item.border);\n    return true;\n  }\n  else if (item.sizerItem != nullptr){\n    sizer->Add(item.sizerItem, item.proportion.Get(), item.flags, item.border);\n    return true;\n  }\n  return false;\n}\n\nwxSizer* create_row(const std::vector<SizerItem>& items){\n  wxBoxSizer* row = new wxBoxSizer(wxHORIZONTAL);\n\n  row->AddSpacer(ui::panel_padding);\n  for (auto& item : but_last(items)){\n    if (add(row, item)){\n      row->AddSpacer(ui::item_spacing);\n    }\n  }\n  add(row, items.back());\n  row->AddSpacer(ui::panel_padding);\n  return row;\n}\n\nwxSizer* create_row(OuterSpacing os, ItemSpacing is,\n  const std::vector<SizerItem>& items)\n{\n  \/\/ Fixme: Unify this and create_column\n  wxBoxSizer* column = new wxBoxSizer(wxHORIZONTAL);\n  if (os != 0){\n    column->AddSpacer(os);\n  }\n\n  for (auto& item : but_last(items)){\n    if (item.windowItem != nullptr){\n      column->Add(item.windowItem, item.proportion.Get(), item.flags, item.border);\n    }\n    else{\n      column->Add(item.sizerItem, item.proportion.Get(), item.flags, item.border);\n    }\n    if (is != 0){\n      column->AddSpacer(is);\n    }\n  }\n  auto& last = items.back();\n  if (last.windowItem != nullptr){\n    column->Add(last.windowItem, last.proportion.Get(), last.flags, last.border);\n  }\n  else{\n    column->Add(last.sizerItem, last.proportion.Get(), last.flags, last.border);\n  }\n  if (os != 0){\n    column->AddSpacer(os);\n  }\n\n  return column;\n}\n\n\nwxSizer* create_row_outer_pad(const std::vector<SizerItem>& items){\n  wxBoxSizer* row = new wxBoxSizer(wxHORIZONTAL);\n  row->AddSpacer(ui::panel_padding);\n  for (auto& item : but_last(items)){\n    add(row, item);\n  }\n  add(row, items.back());\n  row->AddSpacer(ui::panel_padding);\n  return row;\n}\n\nwxSizer* create_row_no_pad(const std::vector<SizerItem>& items){\n  wxBoxSizer* row = new wxBoxSizer(wxHORIZONTAL);\n  for (auto& item : items){\n    if (item.windowItem != nullptr){\n      row->Add(item.windowItem, item.proportion.Get(), item.flags, item.border);\n    }\n    else{\n      row->Add(item.sizerItem, item.proportion.Get(), item.flags, item.border);\n    }\n  }\n  return row;\n}\n\nwxSizer* create_column(OuterSpacing os, ItemSpacing is,\n  const std::vector<SizerItem>& items)\n{\n  wxBoxSizer* column = new wxBoxSizer(wxVERTICAL);\n  if (os != 0){\n    column->AddSpacer(os);\n  }\n\n  for (auto& item : but_last(items)){\n    if (item.windowItem != nullptr){\n      column->Add(item.windowItem, item.proportion.Get(), item.flags, item.border);\n    }\n    else{\n      column->Add(item.sizerItem, item.proportion.Get(), item.flags, item.border);\n    }\n    if (is != 0){\n      column->AddSpacer(is);\n    }\n  }\n  auto& last = items.back();\n  if (last.windowItem != nullptr){\n    column->Add(last.windowItem, last.proportion.Get(), last.flags, last.border);\n  }\n  else{\n    column->Add(last.sizerItem, last.proportion.Get(), last.flags, last.border);\n  }\n  if (os != 0){\n    column->AddSpacer(os);\n  }\n\n  return column;\n}\n\nwxSizer* create_column(const std::vector<SizerItem>& items){\n  return create_column(OuterSpacing(ui::panel_padding), ui::item_spacing, items);\n\n}\nSizerItem grow(wxSizer* sizer){\n  return SizerItem(sizer, 1, wxEXPAND);\n}\n\nSizerItem grow(wxWindow* window){\n  return SizerItem(window, 1, wxEXPAND);\n}\n\nSizerItem center(wxSizer* sizer){\n  return SizerItem(sizer, 0, wxALIGN_CENTER);\n}\n\nwxWindow* make_default(wxDialog* parent, wxWindow* item){\n  parent->SetDefaultItem(item);\n  return item;\n}\n\nwxButton* make_default(wxDialog* parent, wxButton* item){\n  parent->SetDefaultItem(item);\n  return item;\n}\n\nwxStaticText* label(wxWindow* parent, const wxString& text){\n  return new wxStaticText(parent, wxID_ANY, text);\n}\n\n}} \/\/ namespace\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * FTGL - OpenGL font library\n *\n * Copyright (c) 2001-2004 Henry Maddocks <ftgl@opengl.geek.nz>\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 \"config.h\"\n\n#include \"FTInternals.h\"\n#include \"FTUnicode.h\"\n\n#include \"FTFontImpl.h\"\n\n#include \"FTBitmapFontImpl.h\"\n#include \"FTExtrudeFontImpl.h\"\n#include \"FTOutlineFontImpl.h\"\n#include \"FTPixmapFontImpl.h\"\n#include \"FTPolygonFontImpl.h\"\n#include \"FTTextureFontImpl.h\"\n\n#include \"FTGlyphContainer.h\"\n#include \"FTFace.h\"\n\n\n\/\/\n\/\/  FTFont\n\/\/\n\n\nFTFont::FTFont(char const *fontFilePath)\n{\n    impl = new FTFontImpl(this, fontFilePath);\n}\n\n\nFTFont::FTFont(const unsigned char *pBufferBytes, size_t bufferSizeInBytes)\n{\n    impl = new FTFontImpl(this, pBufferBytes, bufferSizeInBytes);\n}\n\n\nFTFont::FTFont(FTFontImpl *pImpl)\n{\n    impl = pImpl;\n}\n\n\nFTFont::~FTFont()\n{\n    delete impl;\n}\n\n\nbool FTFont::Attach(const char* fontFilePath)\n{\n    return impl->Attach(fontFilePath);\n}\n\n\nbool FTFont::Attach(const unsigned char *pBufferBytes, size_t bufferSizeInBytes)\n{\n    return impl->Attach(pBufferBytes, bufferSizeInBytes);\n}\n\n\nbool FTFont::FaceSize(const unsigned int size, const unsigned int res)\n{\n    return impl->FaceSize(size, res);\n}\n\n\nunsigned int FTFont::FaceSize() const\n{\n    return impl->FaceSize();\n}\n\n\nvoid FTFont::Depth(float depth)\n{\n    return impl->Depth(depth);\n}\n\n\nvoid FTFont::Outset(float outset)\n{\n    return impl->Outset(outset);\n}\n\n\nvoid FTFont::Outset(float front, float back)\n{\n    return impl->Outset(front, back);\n}\n\n\nbool FTFont::CharMap(FT_Encoding encoding)\n{\n    return impl->CharMap(encoding);\n}\n\n\nunsigned int FTFont::CharMapCount() const\n{\n    return impl->CharMapCount();\n}\n\n\nFT_Encoding* FTFont::CharMapList()\n{\n    return impl->CharMapList();\n}\n\n\nvoid FTFont::UseDisplayList(bool useList)\n{\n    return impl->UseDisplayList(useList);\n}\n\n\nfloat FTFont::Ascender() const\n{\n    return impl->Ascender();\n}\n\n\nfloat FTFont::Descender() const\n{\n    return impl->Descender();\n}\n\n\nfloat FTFont::LineHeight() const\n{\n    return impl->LineHeight();\n}\n\n\nFTPoint FTFont::Render(const char * string, const int len,\n                       FTPoint position, FTPoint spacing, int renderMode)\n{\n    return impl->Render(string, len, position, spacing, renderMode);\n}\n\n\nFTPoint FTFont::Render(const wchar_t * string, const int len,\n                       FTPoint position, FTPoint spacing, int renderMode)\n{\n    return impl->Render(string, len, position, spacing, renderMode);\n}\n\n\nFTPoint FTFont::Advance(const char * string, const int len,\n                        FTPoint position, FTPoint spacing)\n{\n    return impl->Advance(string, len, position, spacing);\n}\n\n\nFTPoint FTFont::Advance(const wchar_t * string, const int len,\n                        FTPoint position, FTPoint spacing)\n{\n    return impl->Advance(string, len, position, spacing);\n}\n\n\nFTBBox FTFont::BBox(const char *string, const int len,\n                    FTPoint position, FTPoint spacing)\n{\n    return impl->BBox(string, len, position, spacing);\n}\n\n\nFTBBox FTFont::BBox(const wchar_t *string, const int len,\n                    FTPoint position, FTPoint spacing)\n{\n    return impl->BBox(string, len, position, spacing);\n}\n\n\nFT_Error FTFont::Error() const\n{\n    return impl->err;\n}\n\n\n\/\/\n\/\/  FTFontImpl\n\/\/\n\n\nFTFontImpl::FTFontImpl(FTFont *ftFont, char const *fontFilePath) :\n    face(fontFilePath),\n    useDisplayLists(true),\n    intf(ftFont),\n    glyphList(0)\n{\n    err = face.Error();\n    if(err == 0)\n    {\n        glyphList = new FTGlyphContainer(&face);\n    }\n}\n\n\nFTFontImpl::FTFontImpl(FTFont *ftFont, const unsigned char *pBufferBytes,\n                       size_t bufferSizeInBytes) :\n    face(pBufferBytes, bufferSizeInBytes),\n    useDisplayLists(true),\n    intf(ftFont),\n    glyphList(0)\n{\n    err = face.Error();\n    if(err == 0)\n    {\n        glyphList = new FTGlyphContainer(&face);\n    }\n}\n\n\nFTFontImpl::~FTFontImpl()\n{\n    if(glyphList)\n    {\n        delete glyphList;\n    }\n}\n\n\nbool FTFontImpl::Attach(const char* fontFilePath)\n{\n    if(!face.Attach(fontFilePath))\n    {\n        err = face.Error();\n        return false;\n    }\n\n    err = 0;\n    return true;\n}\n\n\nbool FTFontImpl::Attach(const unsigned char *pBufferBytes,\n                        size_t bufferSizeInBytes)\n{\n    if(!face.Attach(pBufferBytes, bufferSizeInBytes))\n    {\n        err = face.Error();\n        return false;\n    }\n\n    err = 0;\n    return true;\n}\n\n\nbool FTFontImpl::FaceSize(const unsigned int size, const unsigned int res)\n{\n    if(glyphList != NULL)\n    {\n        delete glyphList;\n        glyphList = NULL;\n    }\n\n    charSize = face.Size(size, res);\n    err = face.Error();\n\n    if(err != 0)\n    {\n        return false;\n    }\n\n    glyphList = new FTGlyphContainer(&face);\n    return true;\n}\n\n\nunsigned int FTFontImpl::FaceSize() const\n{\n    return charSize.CharSize();\n}\n\n\nvoid FTFontImpl::Depth(float depth)\n{\n    ;\n}\n\n\nvoid FTFontImpl::Outset(float outset)\n{\n    ;\n}\n\n\nvoid FTFontImpl::Outset(float front, float back)\n{\n    ;\n}\n\n\nbool FTFontImpl::CharMap(FT_Encoding encoding)\n{\n    bool result = glyphList->CharMap(encoding);\n    err = glyphList->Error();\n    return result;\n}\n\n\nunsigned int FTFontImpl::CharMapCount() const\n{\n    return face.CharMapCount();\n}\n\n\nFT_Encoding* FTFontImpl::CharMapList()\n{\n    return face.CharMapList();\n}\n\n\nvoid FTFontImpl::UseDisplayList(bool useList)\n{\n    useDisplayLists = useList;\n}\n\n\nfloat FTFontImpl::Ascender() const\n{\n    return charSize.Ascender();\n}\n\n\nfloat FTFontImpl::Descender() const\n{\n    return charSize.Descender();\n}\n\n\nfloat FTFontImpl::LineHeight() const\n{\n    return charSize.Height();\n}\n\n\ntemplate <typename T>\ninline FTBBox FTFontImpl::BBoxI(const T* string, const int len,\n                                FTPoint position, FTPoint spacing)\n{\n    FTBBox totalBBox;\n\n    \/* Only compute the bounds if string is non-empty. *\/\n    if(string && ('\\0' != string[0]))\n    {\n        \/\/ for multibyte - we can't rely on sizeof(T) == character\n        FTUnicodeStringItr<T> ustr(string);\n        unsigned int thisChar = *ustr++;\n        unsigned int nextChar = *ustr;\n\n        if(CheckGlyph(thisChar))\n        {\n            totalBBox = glyphList->BBox(thisChar);\n            totalBBox += position;\n\n            position += glyphList->Advance(thisChar, nextChar);\n        }\n\n        \/* Expand totalBox by each glyph in string *\/\n        for(int i = 1; (len < 0 && *ustr) || (len >= 0 && i < len); i++)\n        {\n            unsigned int thisChar = *ustr++;\n            unsigned int nextChar = *ustr;\n\n            if(CheckGlyph(thisChar))\n            {\n                position += spacing;\n\n                FTBBox tempBBox = glyphList->BBox(thisChar);\n                tempBBox += position;\n                totalBBox |= tempBBox;\n\n                position += glyphList->Advance(thisChar, nextChar);\n            }\n        }\n    }\n\n    return totalBBox;\n}\n\n\nFTBBox FTFontImpl::BBox(const char *string, const int len,\n                        FTPoint position, FTPoint spacing)\n{\n    \/* The chars need to be unsigned because they are cast to int later *\/\n    return BBoxI((const unsigned char *)string, len, position, spacing);\n}\n\n\nFTBBox FTFontImpl::BBox(const wchar_t *string, const int len,\n                        FTPoint position, FTPoint spacing)\n{\n    return BBoxI(string, len, position, spacing);\n}\n\n\ntemplate <typename T>\ninline FTPoint FTFontImpl::AdvanceI(const T* string, const int len,\n                                    FTPoint position, FTPoint spacing)\n{\n    FTUnicodeStringItr<T> ustr(string);\n\n    for(int i = 0; (len < 0 && *ustr) || (len >= 0 && i < len); i++)\n    {\n        unsigned int thisChar = *ustr++;\n        unsigned int nextChar = *ustr;\n\n        if(CheckGlyph(thisChar))\n        {\n            position += glyphList->Advance(thisChar, nextChar);\n        }\n\n        if(nextChar)\n        {\n            position += spacing;\n        }\n    }\n\n    return position;\n}\n\n\nFTPoint FTFontImpl::Advance(const char* string, const int len,\n                            FTPoint position, FTPoint spacing)\n{\n    \/* The chars need to be unsigned because they are cast to int later *\/\n    return AdvanceI((const unsigned char *)string,\n                    len, position, spacing);\n}\n\n\nFTPoint FTFontImpl::Advance(const wchar_t* string, const int len,\n                            FTPoint position, FTPoint spacing)\n{\n    return AdvanceI(string, len, position, spacing);\n}\n\n\ntemplate <typename T>\ninline FTPoint FTFontImpl::RenderI(const T* string, const int len,\n                                   FTPoint position, FTPoint spacing,\n                                   int renderMode)\n{\n     \/\/ for multibyte - we can't rely on sizeof(T) == character\n    FTUnicodeStringItr<T> ustr(string);\n\n    for(int i = 0; (len < 0 && *ustr) || (len >= 0 && i < len); i++)\n    {\n        unsigned int thisChar = *ustr++;\n        unsigned int nextChar = *ustr;\n\n        if(CheckGlyph(thisChar))\n        {\n            position += glyphList->Render(thisChar, nextChar,\n                                          position, renderMode);\n        }\n\n        if(nextChar)\n        {\n            position += spacing;\n        }\n    }\n    \n    return position;\n}\n\n\nFTPoint FTFontImpl::Render(const char * string, const int len,\n                           FTPoint position, FTPoint spacing, int renderMode)\n{\n    return RenderI((const unsigned char *)string,\n                   len, position, spacing, renderMode);\n}\n\n\nFTPoint FTFontImpl::Render(const wchar_t * string, const int len,\n                           FTPoint position, FTPoint spacing, int renderMode)\n{\n    return RenderI(string, len, position, spacing, renderMode);\n}\n\n\nbool FTFontImpl::CheckGlyph(const unsigned int characterCode)\n{\n    if(glyphList->Glyph(characterCode))\n    {\n        return true;\n    }\n\n    \/*\n     * FIXME: load options are not the same for all subclasses:\n     *  FTBitmapGlyph: FT_LOAD_DEFAULT\n     *  FTExtrudeGlyph: FT_LOAD_NO_HINTING\n     *  FTOutlineGlyph: FT_LOAD_NO_HINTING\n     *  FTPixmapGlyph: FT_LOAD_NO_HINTING | FT_LOAD_NO_BITMAP\n     *  FTPolygonGlyph: FT_LOAD_NO_HINTING\n     *  FTTextureGlyph: FT_LOAD_NO_HINTING | FT_LOAD_NO_BITMAP\n     *\/\n    unsigned int glyphIndex = glyphList->FontIndex(characterCode);\n    FT_GlyphSlot ftSlot = face.Glyph(glyphIndex, FT_LOAD_NO_HINTING);\n    if(!ftSlot)\n    {\n        err = face.Error();\n        return false;\n    }\n\n    FTGlyph* tempGlyph = intf->MakeGlyph(ftSlot);\n    if(!tempGlyph)\n    {\n        if(0 == err)\n        {\n            err = 0x13;\n        }\n\n        return false;\n    }\n\n    glyphList->Add(tempGlyph, characterCode);\n\n    return true;\n}\n\n<commit_msg>no need to shadow variables<commit_after>\/*\n * FTGL - OpenGL font library\n *\n * Copyright (c) 2001-2004 Henry Maddocks <ftgl@opengl.geek.nz>\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 \"config.h\"\n\n#include \"FTInternals.h\"\n#include \"FTUnicode.h\"\n\n#include \"FTFontImpl.h\"\n\n#include \"FTBitmapFontImpl.h\"\n#include \"FTExtrudeFontImpl.h\"\n#include \"FTOutlineFontImpl.h\"\n#include \"FTPixmapFontImpl.h\"\n#include \"FTPolygonFontImpl.h\"\n#include \"FTTextureFontImpl.h\"\n\n#include \"FTGlyphContainer.h\"\n#include \"FTFace.h\"\n\n\n\/\/\n\/\/  FTFont\n\/\/\n\n\nFTFont::FTFont(char const *fontFilePath)\n{\n    impl = new FTFontImpl(this, fontFilePath);\n}\n\n\nFTFont::FTFont(const unsigned char *pBufferBytes, size_t bufferSizeInBytes)\n{\n    impl = new FTFontImpl(this, pBufferBytes, bufferSizeInBytes);\n}\n\n\nFTFont::FTFont(FTFontImpl *pImpl)\n{\n    impl = pImpl;\n}\n\n\nFTFont::~FTFont()\n{\n    delete impl;\n}\n\n\nbool FTFont::Attach(const char* fontFilePath)\n{\n    return impl->Attach(fontFilePath);\n}\n\n\nbool FTFont::Attach(const unsigned char *pBufferBytes, size_t bufferSizeInBytes)\n{\n    return impl->Attach(pBufferBytes, bufferSizeInBytes);\n}\n\n\nbool FTFont::FaceSize(const unsigned int size, const unsigned int res)\n{\n    return impl->FaceSize(size, res);\n}\n\n\nunsigned int FTFont::FaceSize() const\n{\n    return impl->FaceSize();\n}\n\n\nvoid FTFont::Depth(float depth)\n{\n    return impl->Depth(depth);\n}\n\n\nvoid FTFont::Outset(float outset)\n{\n    return impl->Outset(outset);\n}\n\n\nvoid FTFont::Outset(float front, float back)\n{\n    return impl->Outset(front, back);\n}\n\n\nbool FTFont::CharMap(FT_Encoding encoding)\n{\n    return impl->CharMap(encoding);\n}\n\n\nunsigned int FTFont::CharMapCount() const\n{\n    return impl->CharMapCount();\n}\n\n\nFT_Encoding* FTFont::CharMapList()\n{\n    return impl->CharMapList();\n}\n\n\nvoid FTFont::UseDisplayList(bool useList)\n{\n    return impl->UseDisplayList(useList);\n}\n\n\nfloat FTFont::Ascender() const\n{\n    return impl->Ascender();\n}\n\n\nfloat FTFont::Descender() const\n{\n    return impl->Descender();\n}\n\n\nfloat FTFont::LineHeight() const\n{\n    return impl->LineHeight();\n}\n\n\nFTPoint FTFont::Render(const char * string, const int len,\n                       FTPoint position, FTPoint spacing, int renderMode)\n{\n    return impl->Render(string, len, position, spacing, renderMode);\n}\n\n\nFTPoint FTFont::Render(const wchar_t * string, const int len,\n                       FTPoint position, FTPoint spacing, int renderMode)\n{\n    return impl->Render(string, len, position, spacing, renderMode);\n}\n\n\nFTPoint FTFont::Advance(const char * string, const int len,\n                        FTPoint position, FTPoint spacing)\n{\n    return impl->Advance(string, len, position, spacing);\n}\n\n\nFTPoint FTFont::Advance(const wchar_t * string, const int len,\n                        FTPoint position, FTPoint spacing)\n{\n    return impl->Advance(string, len, position, spacing);\n}\n\n\nFTBBox FTFont::BBox(const char *string, const int len,\n                    FTPoint position, FTPoint spacing)\n{\n    return impl->BBox(string, len, position, spacing);\n}\n\n\nFTBBox FTFont::BBox(const wchar_t *string, const int len,\n                    FTPoint position, FTPoint spacing)\n{\n    return impl->BBox(string, len, position, spacing);\n}\n\n\nFT_Error FTFont::Error() const\n{\n    return impl->err;\n}\n\n\n\/\/\n\/\/  FTFontImpl\n\/\/\n\n\nFTFontImpl::FTFontImpl(FTFont *ftFont, char const *fontFilePath) :\n    face(fontFilePath),\n    useDisplayLists(true),\n    intf(ftFont),\n    glyphList(0)\n{\n    err = face.Error();\n    if(err == 0)\n    {\n        glyphList = new FTGlyphContainer(&face);\n    }\n}\n\n\nFTFontImpl::FTFontImpl(FTFont *ftFont, const unsigned char *pBufferBytes,\n                       size_t bufferSizeInBytes) :\n    face(pBufferBytes, bufferSizeInBytes),\n    useDisplayLists(true),\n    intf(ftFont),\n    glyphList(0)\n{\n    err = face.Error();\n    if(err == 0)\n    {\n        glyphList = new FTGlyphContainer(&face);\n    }\n}\n\n\nFTFontImpl::~FTFontImpl()\n{\n    if(glyphList)\n    {\n        delete glyphList;\n    }\n}\n\n\nbool FTFontImpl::Attach(const char* fontFilePath)\n{\n    if(!face.Attach(fontFilePath))\n    {\n        err = face.Error();\n        return false;\n    }\n\n    err = 0;\n    return true;\n}\n\n\nbool FTFontImpl::Attach(const unsigned char *pBufferBytes,\n                        size_t bufferSizeInBytes)\n{\n    if(!face.Attach(pBufferBytes, bufferSizeInBytes))\n    {\n        err = face.Error();\n        return false;\n    }\n\n    err = 0;\n    return true;\n}\n\n\nbool FTFontImpl::FaceSize(const unsigned int size, const unsigned int res)\n{\n    if(glyphList != NULL)\n    {\n        delete glyphList;\n        glyphList = NULL;\n    }\n\n    charSize = face.Size(size, res);\n    err = face.Error();\n\n    if(err != 0)\n    {\n        return false;\n    }\n\n    glyphList = new FTGlyphContainer(&face);\n    return true;\n}\n\n\nunsigned int FTFontImpl::FaceSize() const\n{\n    return charSize.CharSize();\n}\n\n\nvoid FTFontImpl::Depth(float depth)\n{\n    ;\n}\n\n\nvoid FTFontImpl::Outset(float outset)\n{\n    ;\n}\n\n\nvoid FTFontImpl::Outset(float front, float back)\n{\n    ;\n}\n\n\nbool FTFontImpl::CharMap(FT_Encoding encoding)\n{\n    bool result = glyphList->CharMap(encoding);\n    err = glyphList->Error();\n    return result;\n}\n\n\nunsigned int FTFontImpl::CharMapCount() const\n{\n    return face.CharMapCount();\n}\n\n\nFT_Encoding* FTFontImpl::CharMapList()\n{\n    return face.CharMapList();\n}\n\n\nvoid FTFontImpl::UseDisplayList(bool useList)\n{\n    useDisplayLists = useList;\n}\n\n\nfloat FTFontImpl::Ascender() const\n{\n    return charSize.Ascender();\n}\n\n\nfloat FTFontImpl::Descender() const\n{\n    return charSize.Descender();\n}\n\n\nfloat FTFontImpl::LineHeight() const\n{\n    return charSize.Height();\n}\n\n\ntemplate <typename T>\ninline FTBBox FTFontImpl::BBoxI(const T* string, const int len,\n                                FTPoint position, FTPoint spacing)\n{\n    FTBBox totalBBox;\n\n    \/* Only compute the bounds if string is non-empty. *\/\n    if(string && ('\\0' != string[0]))\n    {\n        \/\/ for multibyte - we can't rely on sizeof(T) == character\n        FTUnicodeStringItr<T> ustr(string);\n        unsigned int thisChar = *ustr++;\n        unsigned int nextChar = *ustr;\n\n        if(CheckGlyph(thisChar))\n        {\n            totalBBox = glyphList->BBox(thisChar);\n            totalBBox += position;\n\n            position += glyphList->Advance(thisChar, nextChar);\n        }\n\n        \/* Expand totalBox by each glyph in string *\/\n        for(int i = 1; (len < 0 && *ustr) || (len >= 0 && i < len); i++)\n        {\n            thisChar = *ustr++;\n            nextChar = *ustr;\n\n            if(CheckGlyph(thisChar))\n            {\n                position += spacing;\n\n                FTBBox tempBBox = glyphList->BBox(thisChar);\n                tempBBox += position;\n                totalBBox |= tempBBox;\n\n                position += glyphList->Advance(thisChar, nextChar);\n            }\n        }\n    }\n\n    return totalBBox;\n}\n\n\nFTBBox FTFontImpl::BBox(const char *string, const int len,\n                        FTPoint position, FTPoint spacing)\n{\n    \/* The chars need to be unsigned because they are cast to int later *\/\n    return BBoxI((const unsigned char *)string, len, position, spacing);\n}\n\n\nFTBBox FTFontImpl::BBox(const wchar_t *string, const int len,\n                        FTPoint position, FTPoint spacing)\n{\n    return BBoxI(string, len, position, spacing);\n}\n\n\ntemplate <typename T>\ninline FTPoint FTFontImpl::AdvanceI(const T* string, const int len,\n                                    FTPoint position, FTPoint spacing)\n{\n    FTUnicodeStringItr<T> ustr(string);\n\n    for(int i = 0; (len < 0 && *ustr) || (len >= 0 && i < len); i++)\n    {\n        unsigned int thisChar = *ustr++;\n        unsigned int nextChar = *ustr;\n\n        if(CheckGlyph(thisChar))\n        {\n            position += glyphList->Advance(thisChar, nextChar);\n        }\n\n        if(nextChar)\n        {\n            position += spacing;\n        }\n    }\n\n    return position;\n}\n\n\nFTPoint FTFontImpl::Advance(const char* string, const int len,\n                            FTPoint position, FTPoint spacing)\n{\n    \/* The chars need to be unsigned because they are cast to int later *\/\n    return AdvanceI((const unsigned char *)string,\n                    len, position, spacing);\n}\n\n\nFTPoint FTFontImpl::Advance(const wchar_t* string, const int len,\n                            FTPoint position, FTPoint spacing)\n{\n    return AdvanceI(string, len, position, spacing);\n}\n\n\ntemplate <typename T>\ninline FTPoint FTFontImpl::RenderI(const T* string, const int len,\n                                   FTPoint position, FTPoint spacing,\n                                   int renderMode)\n{\n     \/\/ for multibyte - we can't rely on sizeof(T) == character\n    FTUnicodeStringItr<T> ustr(string);\n\n    for(int i = 0; (len < 0 && *ustr) || (len >= 0 && i < len); i++)\n    {\n        unsigned int thisChar = *ustr++;\n        unsigned int nextChar = *ustr;\n\n        if(CheckGlyph(thisChar))\n        {\n            position += glyphList->Render(thisChar, nextChar,\n                                          position, renderMode);\n        }\n\n        if(nextChar)\n        {\n            position += spacing;\n        }\n    }\n    \n    return position;\n}\n\n\nFTPoint FTFontImpl::Render(const char * string, const int len,\n                           FTPoint position, FTPoint spacing, int renderMode)\n{\n    return RenderI((const unsigned char *)string,\n                   len, position, spacing, renderMode);\n}\n\n\nFTPoint FTFontImpl::Render(const wchar_t * string, const int len,\n                           FTPoint position, FTPoint spacing, int renderMode)\n{\n    return RenderI(string, len, position, spacing, renderMode);\n}\n\n\nbool FTFontImpl::CheckGlyph(const unsigned int characterCode)\n{\n    if(glyphList->Glyph(characterCode))\n    {\n        return true;\n    }\n\n    \/*\n     * FIXME: load options are not the same for all subclasses:\n     *  FTBitmapGlyph: FT_LOAD_DEFAULT\n     *  FTExtrudeGlyph: FT_LOAD_NO_HINTING\n     *  FTOutlineGlyph: FT_LOAD_NO_HINTING\n     *  FTPixmapGlyph: FT_LOAD_NO_HINTING | FT_LOAD_NO_BITMAP\n     *  FTPolygonGlyph: FT_LOAD_NO_HINTING\n     *  FTTextureGlyph: FT_LOAD_NO_HINTING | FT_LOAD_NO_BITMAP\n     *\/\n    unsigned int glyphIndex = glyphList->FontIndex(characterCode);\n    FT_GlyphSlot ftSlot = face.Glyph(glyphIndex, FT_LOAD_NO_HINTING);\n    if(!ftSlot)\n    {\n        err = face.Error();\n        return false;\n    }\n\n    FTGlyph* tempGlyph = intf->MakeGlyph(ftSlot);\n    if(!tempGlyph)\n    {\n        if(0 == err)\n        {\n            err = 0x13;\n        }\n\n        return false;\n    }\n\n    glyphList->Add(tempGlyph, characterCode);\n\n    return true;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2015 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\n\/**\n * @file    clear_cache.cpp\n * @ingroup\n * @author  tpan\n * @brief   clears cache on a linux system\n * @details for use before doing file io benchmark.\n *\n * Copyright (c) 2016 Georgia Institute of Technology.  All Rights Reserved.\n *\n * TODO add License\n *\/\n#include \"bliss-config.hpp\"\n\n#include \"utils\/memory_usage.hpp\"\n#include <cstring>\n\n#ifdef USE_MPI\n#include <mxx\/env.hpp>\n#include <mxx\/comm.hpp>\n#endif\n\n#ifdef USE_OPENMP\n#include <omp.h>\n#endif\n\n\/**\n * @brief  clear the disk cache in linux by allocating a bunch of memory.\n * @details  in 1MB chunks to workaround memory fragmentation preventing allocation.\n *           can potentially use swap, or if there is not enough physical + swap, be killed.\n *\n *\/\nvoid clear_cache() {\n  size_t avail = MemUsage::get_usable_mem();\n  size_t rem = avail;\n\n  size_t minchunk = 1UL << 24;    \/\/ 16MB chunks\n  size_t chunk = minchunk;\n\n  size_t maxchunk = std::min(1UL << 36, (avail >> 4));\n  for ( ;chunk < maxchunk; chunk <<= 1) ;   \/\/ keep increasing chunks until larger than 1\/16 of avail, or until 1GB.\n\n  std::vector<size_t *> dummy;\n\n  size_t nchunks;\n  size_t j = 0, lj;\n\n#if defined(USE_OPENMP)\n\tint max_threads = omp_get_max_threads();\n\n\tif (max_threads > 8) max_threads -= 2;\n\telse if (max_threads > 4) max_threads -= 1;\n#else\n\tint max_threads = 1;\n#endif\n\n\n  printf(\"begin clearing %lu bytes using %d threads\\n\", avail, max_threads);\n  size_t iter_cleared = 0;\n\n  while ((chunk >= minchunk) && (rem > minchunk)) {\n    nchunks = rem \/ chunk;\n\n    iter_cleared = 0;\n    lj = 0;\n#if defined(USE_OPENMP)\n#pragma omp parallel for num_threads(max_threads) shared(nchunks, chunk, dummy) reduction(+:lj, iter_cleared)\n#endif\n      for (size_t i = 0; i < nchunks; ++i) {\n      \/\/ (c|m)alloc\/free seems to be optimized out.  using new works.\n      size_t * ptr = new size_t[(chunk \/ sizeof(size_t))];\n\n      iter_cleared += chunk;\n      memset(ptr, 0, chunk);\n      ptr[0] = i;\n\n#if defined(USE_OPENMP)\n#pragma omp critical\n#endif\n      {\n        dummy.push_back(ptr);\n      }\n\n      ++lj;\n    }\n\n    j += lj;\n\n    \/\/    \/\/ check for available memory, every 64 MBs\n    \/\/    if ((i % 64) == 0) {\n    \/\/      avail = MemUsage::get_usable_mem();\n    \/\/      if (avail < (64 << 20)) break;   \/\/ less than 64MB available.\n    \/\/    }\n    rem -= iter_cleared;\n\n    printf(\"cleared %lu bytes using %lu chunk %lu bytes. total cleared %lu bytes, rem %lu bytes \\n\", iter_cleared, nchunks, chunk, avail - rem, rem);\n    fflush(stdout);\n\n\n    \/\/ reduce the size of the chunk by 4\n    chunk >>= 4;\n\n  }\n  printf(\"finished clearing %lu\/%lu bytes with %lu remaining\\n\", avail - rem, avail, rem);\n  fflush(stdout);\n\n  size_t sum = 0;\n  size_t ii = 0;\n  size_t *ptr;\n  for (; ii < dummy.size(); ++ii) {\n    ptr = dummy[ii];\n\n    if (ptr != nullptr) {\n\/\/      if ((ii % 16) == 0) {\n\/\/        printf(\"%lu \", ii);  \/\/ 16 outputs.\n\/\/        fflush(stdout);\n\/\/      }\n      sum += ptr[ii >> 10];\n      delete [] ptr;\n      \/\/free(ptr);\n      dummy[ii] = nullptr;\n    } else {\n      break;\n    }\n  }\n  printf(\"\\n\");\n  printf(\"disk cache cleared (dummy %lu). %lu blocks %lu bytes\\n\", sum, j, avail - rem);\n}\n\n\nint main(int argc, char** argv) {\n\n#ifdef USE_MPI\n  ::mxx::env e(argc, argv);\n  ::mxx::comm world;\n\n\n  if (world.size() > 1) {\n    ::mxx::comm node = world.split_shared();\n\n    if (node.rank() == 0) {\n\tprintf(\"rank %d clearing\\n\", world.rank());\n\tclear_cache();\n    } else {\n\t\/\/printf(\"rank %d waiting\\n\", world.rank());\n    }\n\n    node.barrier();\n    if (node.rank() == 0) \n\tprintf(\"rank %d cache cleared\\n\", world.rank());\n  } else {\n\/\/\tstd::cout << \"world size is \" << world.size() << std::endl;\n\n\/\/#else\n\/\/\tstd::cout << \"non-mpi.\" << std::endl;\n#endif\n\t\n  clear_cache();\n\n#ifdef USE_MPI\n}\n#endif\n\n  return 0;\n}\n<commit_msg>FIX: missing namespace in clear_cache.cpp<commit_after>\/*\n * Copyright 2015 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\n\/**\n * @file    clear_cache.cpp\n * @ingroup\n * @author  tpan\n * @brief   clears cache on a linux system\n * @details for use before doing file io benchmark.\n *\n * Copyright (c) 2016 Georgia Institute of Technology.  All Rights Reserved.\n *\n * TODO add License\n *\/\n#include \"bliss-config.hpp\"\n\n#include \"utils\/memory_usage.hpp\"\n#include <cstring>\n\n#ifdef USE_MPI\n#include <mxx\/env.hpp>\n#include <mxx\/comm.hpp>\n#endif\n\n#ifdef USE_OPENMP\n#include <omp.h>\n#endif\n\n\/**\n * @brief  clear the disk cache in linux by allocating a bunch of memory.\n * @details  in 1MB chunks to workaround memory fragmentation preventing allocation.\n *           can potentially use swap, or if there is not enough physical + swap, be killed.\n *\n *\/\nvoid clear_cache() {\n  size_t avail = ::plog::MemUsage::get_usable_mem();\n  size_t rem = avail;\n\n  size_t minchunk = 1UL << 24;    \/\/ 16MB chunks\n  size_t chunk = minchunk;\n\n  size_t maxchunk = std::min(1UL << 36, (avail >> 4));\n  for ( ;chunk < maxchunk; chunk <<= 1) ;   \/\/ keep increasing chunks until larger than 1\/16 of avail, or until 1GB.\n\n  std::vector<size_t *> dummy;\n\n  size_t nchunks;\n  size_t j = 0, lj;\n\n#if defined(USE_OPENMP)\n\tint max_threads = omp_get_max_threads();\n\n\tif (max_threads > 8) max_threads -= 2;\n\telse if (max_threads > 4) max_threads -= 1;\n#else\n\tint max_threads = 1;\n#endif\n\n\n  printf(\"begin clearing %lu bytes using %d threads\\n\", avail, max_threads);\n  size_t iter_cleared = 0;\n\n  while ((chunk >= minchunk) && (rem > minchunk)) {\n    nchunks = rem \/ chunk;\n\n    iter_cleared = 0;\n    lj = 0;\n#if defined(USE_OPENMP)\n#pragma omp parallel for num_threads(max_threads) shared(nchunks, chunk, dummy) reduction(+:lj, iter_cleared)\n#endif\n      for (size_t i = 0; i < nchunks; ++i) {\n      \/\/ (c|m)alloc\/free seems to be optimized out.  using new works.\n      size_t * ptr = new size_t[(chunk \/ sizeof(size_t))];\n\n      iter_cleared += chunk;\n      memset(ptr, 0, chunk);\n      ptr[0] = i;\n\n#if defined(USE_OPENMP)\n#pragma omp critical\n#endif\n      {\n        dummy.push_back(ptr);\n      }\n\n      ++lj;\n    }\n\n    j += lj;\n\n    \/\/    \/\/ check for available memory, every 64 MBs\n    \/\/    if ((i % 64) == 0) {\n    \/\/      avail = ::plog::MemUsage::get_usable_mem();\n    \/\/      if (avail < (64 << 20)) break;   \/\/ less than 64MB available.\n    \/\/    }\n    rem -= iter_cleared;\n\n    printf(\"cleared %lu bytes using %lu chunk %lu bytes. total cleared %lu bytes, rem %lu bytes \\n\", iter_cleared, nchunks, chunk, avail - rem, rem);\n    fflush(stdout);\n\n\n    \/\/ reduce the size of the chunk by 4\n    chunk >>= 4;\n\n  }\n  printf(\"finished clearing %lu\/%lu bytes with %lu remaining\\n\", avail - rem, avail, rem);\n  fflush(stdout);\n\n  size_t sum = 0;\n  size_t ii = 0;\n  size_t *ptr;\n  for (; ii < dummy.size(); ++ii) {\n    ptr = dummy[ii];\n\n    if (ptr != nullptr) {\n\/\/      if ((ii % 16) == 0) {\n\/\/        printf(\"%lu \", ii);  \/\/ 16 outputs.\n\/\/        fflush(stdout);\n\/\/      }\n      sum += ptr[ii >> 10];\n      delete [] ptr;\n      \/\/free(ptr);\n      dummy[ii] = nullptr;\n    } else {\n      break;\n    }\n  }\n  printf(\"\\n\");\n  printf(\"disk cache cleared (dummy %lu). %lu blocks %lu bytes\\n\", sum, j, avail - rem);\n}\n\n\nint main(int argc, char** argv) {\n\n#ifdef USE_MPI\n  ::mxx::env e(argc, argv);\n  ::mxx::comm world;\n\n\n  if (world.size() > 1) {\n    ::mxx::comm node = world.split_shared();\n\n    if (node.rank() == 0) {\n\tprintf(\"rank %d clearing\\n\", world.rank());\n\tclear_cache();\n    } else {\n\t\/\/printf(\"rank %d waiting\\n\", world.rank());\n    }\n\n    node.barrier();\n    if (node.rank() == 0) \n\tprintf(\"rank %d cache cleared\\n\", world.rank());\n  } else {\n\/\/\tstd::cout << \"world size is \" << world.size() << std::endl;\n\n\/\/#else\n\/\/\tstd::cout << \"non-mpi.\" << std::endl;\n#endif\n\t\n  clear_cache();\n\n#ifdef USE_MPI\n}\n#endif\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma ident \"$Id$\"\n\n\n\n\/\/============================================================================\n\/\/\n\/\/  This file is part of GPSTk, the GPS Toolkit.\n\/\/\n\/\/  The GPSTk is free software; you can redistribute it and\/or modify\n\/\/  it under the terms of the GNU Lesser General Public License as published\n\/\/  by the Free Software Foundation; either version 2.1 of the License, or\n\/\/  any later version.\n\/\/\n\/\/  The GPSTk is distributed in the hope that it will be useful,\n\/\/  but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n\/\/  GNU Lesser General Public License for more details.\n\/\/\n\/\/  You should have received a copy of the GNU Lesser General Public\n\/\/  License along with GPSTk; if not, write to the Free Software Foundation,\n\/\/  Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA\n\/\/  \n\/\/  Copyright 2004, The University of Texas at Austin\n\/\/\n\/\/============================================================================\n\n#include \"GPSWeekSecond.hpp\"\n#include \"TimeConstants.hpp\"\n\nnamespace gpstk\n{\n   GPSWeekSecond& \n   GPSWeekSecond::operator=( const GPSWeekSecond& right )\n      throw()\n   {\n      GPSWeek::operator=(right);\n      sow = right.sow;\n      return *this;\n   }\n   \n   CommonTime GPSWeekSecond::convertToCommonTime() const\n      throw(InvalidRequest)\n   {\n      try\n      {\n         int dow = static_cast<int>( sow * DAY_PER_SEC );\n         int jday = GPS_EPOCH_JDAY + ( 7 * week ) + dow;\n         double sod(  sow - SEC_PER_DAY * dow );\n         return CommonTime( jday, \n                            static_cast<long>( sod ),\n                            sod - static_cast<long>( sod ) );\n      }\n      catch (InvalidParameter& ip)\n      {\n         InvalidRequest ir(ip);\n         GPSTK_THROW(ir);\n      }\n   }\n   \n   void GPSWeekSecond::convertFromCommonTime( const CommonTime& ct )\n      throw(InvalidRequest)\n   {\n         \/\/\/ This is the earliest CommonTime convertible to GPSWeekSecond.\n      static const CommonTime MIN_CT = GPSWeekSecond();\n\n      if (ct < MIN_CT)\n      {\n         InvalidRequest ir(\"Unable to convert CommonTime to GPSWeekSecond.\");\n         GPSTK_THROW(ir);\n      }\n      \n      long day, sod;\n      double fsod;\n      ct.get( day, sod, fsod );\n\n         \/\/ find the number of days since the beginning of the GPS Epoch\n      day -= GPS_EPOCH_JDAY;\n         \/\/ find out how many weeks that is\n      week = static_cast<int>( day \/ 7 );\n         \/\/ find out what the day of week is\n      day %= 7;\n\n      sow = static_cast<double>( day * SEC_PER_DAY + sod ) + fsod;\n   }\n   \n   std::string GPSWeekSecond::printf( const std::string& fmt ) const\n      throw( gpstk::StringUtils::StringException )\n   {\n      try\n      {\n         using gpstk::StringUtils::formattedPrint;\n         \n         std::string rv = GPSWeek::printf( fmt );\n         \n         rv = formattedPrint( rv, getFormatPrefixInt() + \"w\",\n                              \"wu\", getDayOfWeek() );\n         rv = formattedPrint( rv, getFormatPrefixFloat() + \"g\",\n                              \"gf\", sow);\n         return rv;\n      }\n      catch( gpstk::StringUtils::StringException& exc )\n      {\n         GPSTK_RETHROW( exc );\n      }\n   }\n      \n   std::string GPSWeekSecond::printError( const std::string& fmt ) const\n      throw( gpstk::StringUtils::StringException )\n   {\n      try\n      {\n         using gpstk::StringUtils::formattedPrint;\n         \n         std::string rv = GPSWeek::printError( fmt );\n         \n         rv = formattedPrint( rv, getFormatPrefixInt() + \"w\",\n                              \"ws\", getError().c_str() );\n         rv = formattedPrint( rv, getFormatPrefixFloat() + \"g\",\n                              \"gs\", getError().c_str() );               \n         return rv;\n      }\n      catch( gpstk::StringUtils::StringException& exc )\n      {\n         GPSTK_RETHROW( exc );\n      }\n   }\n   \n   bool GPSWeekSecond::setFromInfo( const IdToValue& info )\n      throw()\n   {\n      using namespace gpstk::StringUtils;\n\n      GPSWeek::setFromInfo( info );\n\n      for( IdToValue::const_iterator i = info.begin(); i != info.end(); i++ )\n      {\n            \/\/ based on the character, we know what to do...\n         switch ( i->first ) \n         {\n            case 'w':\n               sow = static_cast<double>( asInt( i->second ) ) * SEC_PER_DAY;\n               break;\n            case 'g':\n               sow = asDouble( i->second );\n               break;\n            default:\n                  \/\/ do nothing\n               break;\n         };\n         \n      } \/\/ end of for loop\n      \n      return true;\n   }\n\n   bool GPSWeekSecond::isValid() const\n      throw()\n   {\n      return ( GPSWeek::isValid() &&\n               sow < FULLWEEK );\n   }\n\n   void GPSWeekSecond::reset()\n      throw()\n   {\n      GPSWeek::reset();\n      sow = 0.0;\n   }\n\n   bool \n   GPSWeekSecond::operator==( const GPSWeekSecond& right ) const\n      throw()\n   {\n      return ( GPSWeek::operator==(right) &&\n               sow == right.sow );\n   }\n\n   bool \n   GPSWeekSecond::operator!=( const GPSWeekSecond& right ) const\n      throw()\n   {\n      return (! operator==( right ) );\n   }\n\n   bool \n   GPSWeekSecond::operator<( const GPSWeekSecond& right ) const\n      throw()\n   {\n      if( GPSWeek::operator<(right) )\n      {\n         return true;\n      }\n      if( GPSWeek::operator>(right) )\n      {\n         return false;\n      }\n      if( sow < right.sow )\n      {\n         return true;\n      }\n      return false;\n   }\n\n   bool \n   GPSWeekSecond::operator>( const GPSWeekSecond& right ) const\n      throw()\n   {\n      return (! operator<=( right ) );\n   }\n\n   bool \n   GPSWeekSecond::operator<=( const GPSWeekSecond& right ) const\n      throw()\n   {\n      return ( operator<( right ) || operator==( right ) );\n   }\n\n   bool \n   GPSWeekSecond::operator>=( const GPSWeekSecond& right ) const\n      throw()\n   {\n      return (! operator<( right ) );\n   }\n\n} \/\/ namespace\n<commit_msg>Fix from Georg Beyerle for 32-bit roundoff error during day of week calculation.<commit_after>#pragma ident \"$Id$\"\n\n\n\n\/\/============================================================================\n\/\/\n\/\/  This file is part of GPSTk, the GPS Toolkit.\n\/\/\n\/\/  The GPSTk is free software; you can redistribute it and\/or modify\n\/\/  it under the terms of the GNU Lesser General Public License as published\n\/\/  by the Free Software Foundation; either version 2.1 of the License, or\n\/\/  any later version.\n\/\/\n\/\/  The GPSTk is distributed in the hope that it will be useful,\n\/\/  but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n\/\/  GNU Lesser General Public License for more details.\n\/\/\n\/\/  You should have received a copy of the GNU Lesser General Public\n\/\/  License along with GPSTk; if not, write to the Free Software Foundation,\n\/\/  Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA\n\/\/  \n\/\/  Copyright 2004, The University of Texas at Austin\n\/\/\n\/\/============================================================================\n\n#include \"GPSWeekSecond.hpp\"\n#include \"TimeConstants.hpp\"\n\nnamespace gpstk\n{\n   GPSWeekSecond& \n   GPSWeekSecond::operator=( const GPSWeekSecond& right )\n      throw()\n   {\n      GPSWeek::operator=(right);\n      sow = right.sow;\n      return *this;\n   }\n   \n   CommonTime GPSWeekSecond::convertToCommonTime() const\n      throw(InvalidRequest)\n   {\n      try\n      {\n\t\/\/int dow = static_cast<int>( sow * DAY_PER_SEC ); \/\/ Appears to have rounding issues on 32-bit platforms\n         int dow = sow \/ SEC_PER_DAY;\n         int jday = GPS_EPOCH_JDAY + ( 7 * week ) + dow;\n         double sod(  sow - SEC_PER_DAY * dow );\n         return CommonTime( jday, \n                            static_cast<long>( sod ),\n                            sod - static_cast<long>( sod ) );\n      }\n      catch (InvalidParameter& ip)\n      {\n         InvalidRequest ir(ip);\n         GPSTK_THROW(ir);\n      }\n   }\n   \n   void GPSWeekSecond::convertFromCommonTime( const CommonTime& ct )\n      throw(InvalidRequest)\n   {\n         \/\/\/ This is the earliest CommonTime convertible to GPSWeekSecond.\n      static const CommonTime MIN_CT = GPSWeekSecond();\n\n      if (ct < MIN_CT)\n      {\n         InvalidRequest ir(\"Unable to convert CommonTime to GPSWeekSecond.\");\n         GPSTK_THROW(ir);\n      }\n      \n      long day, sod;\n      double fsod;\n      ct.get( day, sod, fsod );\n\n         \/\/ find the number of days since the beginning of the GPS Epoch\n      day -= GPS_EPOCH_JDAY;\n         \/\/ find out how many weeks that is\n      week = static_cast<int>( day \/ 7 );\n         \/\/ find out what the day of week is\n      day %= 7;\n\n      sow = static_cast<double>( day * SEC_PER_DAY + sod ) + fsod;\n   }\n   \n   std::string GPSWeekSecond::printf( const std::string& fmt ) const\n      throw( gpstk::StringUtils::StringException )\n   {\n      try\n      {\n         using gpstk::StringUtils::formattedPrint;\n         \n         std::string rv = GPSWeek::printf( fmt );\n         \n         rv = formattedPrint( rv, getFormatPrefixInt() + \"w\",\n                              \"wu\", getDayOfWeek() );\n         rv = formattedPrint( rv, getFormatPrefixFloat() + \"g\",\n                              \"gf\", sow);\n         return rv;\n      }\n      catch( gpstk::StringUtils::StringException& exc )\n      {\n         GPSTK_RETHROW( exc );\n      }\n   }\n      \n   std::string GPSWeekSecond::printError( const std::string& fmt ) const\n      throw( gpstk::StringUtils::StringException )\n   {\n      try\n      {\n         using gpstk::StringUtils::formattedPrint;\n         \n         std::string rv = GPSWeek::printError( fmt );\n         \n         rv = formattedPrint( rv, getFormatPrefixInt() + \"w\",\n                              \"ws\", getError().c_str() );\n         rv = formattedPrint( rv, getFormatPrefixFloat() + \"g\",\n                              \"gs\", getError().c_str() );               \n         return rv;\n      }\n      catch( gpstk::StringUtils::StringException& exc )\n      {\n         GPSTK_RETHROW( exc );\n      }\n   }\n   \n   bool GPSWeekSecond::setFromInfo( const IdToValue& info )\n      throw()\n   {\n      using namespace gpstk::StringUtils;\n\n      GPSWeek::setFromInfo( info );\n\n      for( IdToValue::const_iterator i = info.begin(); i != info.end(); i++ )\n      {\n            \/\/ based on the character, we know what to do...\n         switch ( i->first ) \n         {\n            case 'w':\n               sow = static_cast<double>( asInt( i->second ) ) * SEC_PER_DAY;\n               break;\n            case 'g':\n               sow = asDouble( i->second );\n               break;\n            default:\n                  \/\/ do nothing\n               break;\n         };\n         \n      } \/\/ end of for loop\n      \n      return true;\n   }\n\n   bool GPSWeekSecond::isValid() const\n      throw()\n   {\n      return ( GPSWeek::isValid() &&\n               sow < FULLWEEK );\n   }\n\n   void GPSWeekSecond::reset()\n      throw()\n   {\n      GPSWeek::reset();\n      sow = 0.0;\n   }\n\n   bool \n   GPSWeekSecond::operator==( const GPSWeekSecond& right ) const\n      throw()\n   {\n      return ( GPSWeek::operator==(right) &&\n               sow == right.sow );\n   }\n\n   bool \n   GPSWeekSecond::operator!=( const GPSWeekSecond& right ) const\n      throw()\n   {\n      return (! operator==( right ) );\n   }\n\n   bool \n   GPSWeekSecond::operator<( const GPSWeekSecond& right ) const\n      throw()\n   {\n      if( GPSWeek::operator<(right) )\n      {\n         return true;\n      }\n      if( GPSWeek::operator>(right) )\n      {\n         return false;\n      }\n      if( sow < right.sow )\n      {\n         return true;\n      }\n      return false;\n   }\n\n   bool \n   GPSWeekSecond::operator>( const GPSWeekSecond& right ) const\n      throw()\n   {\n      return (! operator<=( right ) );\n   }\n\n   bool \n   GPSWeekSecond::operator<=( const GPSWeekSecond& right ) const\n      throw()\n   {\n      return ( operator<( right ) || operator==( right ) );\n   }\n\n   bool \n   GPSWeekSecond::operator>=( const GPSWeekSecond& right ) const\n      throw()\n   {\n      return (! operator<( right ) );\n   }\n\n} \/\/ namespace\n<|endoftext|>"}
{"text":"<commit_before>#include \"Kick.hpp\"\n\n#include <stdio.h>\n#include <algorithm>\n#include <Utils.hpp>\n\nusing namespace std;\nusing namespace Geometry2d;\n\nnamespace Gameplay {\nnamespace Behaviors {\nREGISTER_CONFIGURABLE(Kick)\n}\n}\n\nConfigDouble *Gameplay::Behaviors::Kick::_chip_min_range;\nConfigDouble *Gameplay::Behaviors::Kick::_chip_max_range;\nConfigInt *Gameplay::Behaviors::Kick::_chip_min_power;\nConfigInt *Gameplay::Behaviors::Kick::_chip_max_power;\n\nnamespace Gameplay\n{\nnamespace Behaviors\n{\n\nvoid Gameplay::Behaviors::Kick::createConfiguration(Configuration *cfg)\n{\n\t_chip_min_range = new ConfigDouble(cfg, \"Kick\/Chip Min Range\", 0.3);\n\t_chip_max_range\t= new ConfigDouble(cfg, \"Kick\/Chip Max Range\", 4.0);\n\t_chip_min_power = new ConfigInt(cfg, \"Kick\/Chip Min Power\", 100);\n\t_chip_max_power = new ConfigInt(cfg, \"Kick\/Chip Max Power\", 255);\n}\n\nKick::Kick(GameplayModule *gameplay)\n\t: SingleRobotBehavior(gameplay),\n\tenableGoalLineShot(false),\n\tenableLeftDownfieldShot(false),\n\tenableRightDownfieldShot(false),\n\tenablePushing(false),\n\ttake_open_kicks(true),\n\t_pivotKick(gameplay),\n\t_lineKick(gameplay),\n\tlucky(gameplay)\n{\n\trestart();\n\tsetTargetGoal();\n}\n\nvoid Kick::restart() {\n\t\/\/ chipping parameters - should get calculated somehow\n\t_done = false;\n\tuse_chipper = false;\n\tuse_line_kick = false;\n\toverride_aim = false;\n\tforceChip = false;\n\tenableKick = true;\n\tdribbler_speed = 127;\n\tkick_power = 255;\n\tchip_power = 255;\n\tminChipRange = 0.3;\n\tmaxChipRange = 0.5;\n\t_pivotKick.restart();\n\t_lineKick.restart();\n}\n\nvoid Kick::setTargetGoal() {\n\t_target.pt[0] = Point(Field_GoalWidth \/ 2, Field_Length);\n\t_target.pt[1] = Point(-Field_GoalWidth \/ 2, Field_Length);\n\t_pivotKick.target = _target;\n}\n\nvoid Kick::setTarget(const Geometry2d::Segment &seg) {\n\t_target = seg;\n\t_pivotKick.target = _target;\n}\n\nvoid Kick::calculateChipPower(double dist)\n{\n\tdouble range_area = *_chip_max_range - *_chip_min_range;\n\tdouble ratio = (dist - *_chip_min_range)\/range_area;\n\tuint8_t power_area = *_chip_max_power - *_chip_min_power;\n\tdouble power = ratio * (double) power_area + *_chip_min_power;\n\tchip_power = (uint8_t) clamp((double) power, (double) _chip_min_power->value(), 255.0);\n}\n\nbool Kick::findShot(const Geometry2d::Segment& segment, Geometry2d::Segment& result, bool chip, float min_segment_length) const {\n\t\/\/ calculate available target segments\n\tWindowEvaluator evaluator(state());\n\tevaluator.enable_chip = chip;\n\tevaluator.chip_min_range = minChipRange;\n\tevaluator.chip_max_range = maxChipRange;\n\tevaluator.run(ball().pos, segment);\n\tWindow *window = evaluator.best();\n\n\t\/\/ check for output\n\tif(window && window->segment.length() > min_segment_length)\t{\n\t\tresult = window->segment;\n\t\treturn true;\n\t} else {\n\t\treturn false;\n\t}\n}\n\nvoid Kick::setLineKickVelocityScale(double scale_speed, double scale_acc, double scale_w)\n{\n\t_lineKick.scaleSpeed = scale_speed;\n\t_lineKick.scaleAcc = scale_acc;\n\t_lineKick.scaleW = scale_w;\n}\n\nbool Kick::run() {\n\tif (!robot || !robot->visible)\n\t{\n\t\treturn false;\n\t}\n\n\t\/\/ assign robots - assume updated from driver play\n\t_pivotKick.robot = robot;\n\t_lineKick.robot = robot;\n\n\tconst Segment goal_line(Point(Field_Width \/ 2, Field_Length), Point(-Field_Width \/ 2, Field_Length));\n\tconst Segment left_downfield(Point(-Field_Width \/ 2, Field_Length * 0.8), Point(-Field_Width \/ 2, Field_Length));\n\tconst Segment right_downfield(Point(Field_Width \/ 2, Field_Length * 0.8), Point(Field_Width \/ 2, Field_Length));\n\n\t\/\/ check for shot on goal\n\tbool badshot = false;\n\tGeometry2d::Segment available_target = _target;\n\tbool must_use_chip = false;\n\tif (!override_aim)\n\t{\n\t\tif (!forceChip && !(findShot(_target, available_target, false, 0.1) \t\t\t\t\/\/\/ try target first with kicker\n\t\t\t\t|| (enableGoalLineShot && findShot(goal_line, available_target, false, 0.5)) \t\t\/\/\/ try anywhere on goal line\n\t\t\t\t|| (enableLeftDownfieldShot && findShot(left_downfield, available_target, false, 0.5))  \/\/\/ shot off edge of field\n\t\t\t\t|| (enableRightDownfieldShot && findShot(right_downfield, available_target, false, 0.5))\n\t\t))\n\t\t{\n\t\t\trobot->addText(QString(\"Kick: no kick target\"));\n\t\t\tbadshot = true;\n\t\t\tavailable_target = _target;   \/\/\/ if no other option, try kicking anyway\n\t\t} else if (use_chipper && (findShot(_target, available_target, true, 0.1)  \t\t\t\t\/\/\/ try target with chipper\n\t\t\t\t|| (enableGoalLineShot && findShot(goal_line, available_target, true, 0.5)) \t\t\/\/\/ try anywhere on goal line\n\t\t\t\t|| (enableLeftDownfieldShot && findShot(left_downfield, available_target, true, 0.5))  \/\/\/ shot off edge of field\n\t\t\t\t|| (enableRightDownfieldShot && findShot(right_downfield, available_target, true, 0.5))\n\t\t))\n\t\t{\n\t\t\trobot->addText(QString(\"Kick:chipping\"));\n\t\t\tavailable_target = _target;   \/\/\/ if no other option, try kicking anyway\n\t\t\tmust_use_chip = true;\n\t\t} else {\n\t\t\tbadshot = true;\n\t\t}\n\t}\n\n\tconst Geometry2d::Point& rPos = robot->pos;\n\tconst float close_thresh = Robot_Radius + Ball_Radius + 0.10;\n\n\t\/\/ disable obstacle avoidance if we are close to the ball\n\tif (enablePushing && rPos.nearPoint(ball().pos, close_thresh))\n\t\trobot->avoidOpponents(false);\n\telse\n\t\trobot->avoidOpponents(true);\n\n\tbool result;\n\t\/\/ there are robots in the way and we are close, disable opponent obstacle avoidance\n\tif (enablePushing && badshot && rPos.nearPoint(ball().pos, close_thresh)) {\n\t\trobot->addText(QString(\"PushingOpponent\"));\n\t\tGeometry2d::Point push_goal = rPos + (_target.center() - rPos).normalized() * 2.0;\n\n\t\t\/\/ drive forward through robots\n\t\trobot->move(push_goal);\n\t\trobot->face(_target.center());\n\t\tresult = true;\n\n\t} else if (use_line_kick)\n\t{\n\t\t_lineKick.target = available_target.center();\n\t\t_lineKick.use_chipper = must_use_chip;\n\t\t_lineKick.kick_power = (must_use_chip) ? chip_power : kick_power;\n\t\t_lineKick.enable_kick = enableKick;\n\t\tkickReady = _lineKick.kick_ready;\n\t\tbool result = _lineKick.run();\n\t\tif (_lineKick.done())\n\t\t{\n\t\t\t_done = true;\n\t\t}\n\t} else\n\t{\n\t\t_pivotKick.target = available_target;\n\t\t_pivotKick.dribble_speed = dribbler_speed;\n\t\t_pivotKick.use_chipper = use_chipper;\n\t\t_pivotKick.kick_power = (use_chipper) ? chip_power : kick_power;\n\t\t_pivotKick.enable_kick = enableKick;\n\t\tbool result = _pivotKick.run();\n\t\tif (_pivotKick.done())\n\t\t{\n\t\t\t_done = true;\n\t\t}\n\t}\n\t\/\/ Take opportunities!\n\tif(take_open_kicks) {\n\t\tLuck_Options opt = lucky.get_options();\n\t\tbool ok = lucky.use_kick(robot, opt);\n\t\tok &= lucky.open_kick(robot, opt); \/\/ Checks if E open shot to goal\n\t\tif(ok) {\n\t\t\trobot->addText(\"Taking Opportunity!\", Qt::magenta, \"Kick\");\n\t\t\trobot->kick(255);\n\t\t}\n\t}\n\n\treturn result;\n}\n\n} \/\/ \\namespace Behaviors\n} \/\/ \\namespace Gameplay\n<commit_msg>FIXED FUCKING BALL AVOID FUCKAGE<commit_after>#include \"Kick.hpp\"\n\n#include <stdio.h>\n#include <algorithm>\n#include <Utils.hpp>\n\nusing namespace std;\nusing namespace Geometry2d;\n\nnamespace Gameplay {\nnamespace Behaviors {\nREGISTER_CONFIGURABLE(Kick)\n}\n}\n\nConfigDouble *Gameplay::Behaviors::Kick::_chip_min_range;\nConfigDouble *Gameplay::Behaviors::Kick::_chip_max_range;\nConfigInt *Gameplay::Behaviors::Kick::_chip_min_power;\nConfigInt *Gameplay::Behaviors::Kick::_chip_max_power;\n\nnamespace Gameplay\n{\nnamespace Behaviors\n{\n\nvoid Gameplay::Behaviors::Kick::createConfiguration(Configuration *cfg)\n{\n\t_chip_min_range = new ConfigDouble(cfg, \"Kick\/Chip Min Range\", 0.3);\n\t_chip_max_range\t= new ConfigDouble(cfg, \"Kick\/Chip Max Range\", 4.0);\n\t_chip_min_power = new ConfigInt(cfg, \"Kick\/Chip Min Power\", 100);\n\t_chip_max_power = new ConfigInt(cfg, \"Kick\/Chip Max Power\", 255);\n}\n\nKick::Kick(GameplayModule *gameplay)\n\t: SingleRobotBehavior(gameplay),\n\tenableGoalLineShot(false),\n\tenableLeftDownfieldShot(false),\n\tenableRightDownfieldShot(false),\n\tenablePushing(false),\n\ttake_open_kicks(true),\n\t_pivotKick(gameplay),\n\t_lineKick(gameplay),\n\tlucky(gameplay)\n{\n\trestart();\n\tsetTargetGoal();\n}\n\nvoid Kick::restart() {\n\t\/\/ chipping parameters - should get calculated somehow\n\t_done = false;\n\tuse_chipper = false;\n\tuse_line_kick = false;\n\toverride_aim = false;\n\tforceChip = false;\n\tenableKick = true;\n\tdribbler_speed = 127;\n\tkick_power = 255;\n\tchip_power = 255;\n\tminChipRange = 0.3;\n\tmaxChipRange = 0.5;\n\t_pivotKick.restart();\n\t_lineKick.restart();\n}\n\nvoid Kick::setTargetGoal() {\n\t_target.pt[0] = Point(Field_GoalWidth \/ 2, Field_Length);\n\t_target.pt[1] = Point(-Field_GoalWidth \/ 2, Field_Length);\n\t_pivotKick.target = _target;\n}\n\nvoid Kick::setTarget(const Geometry2d::Segment &seg) {\n\t_target = seg;\n\t_pivotKick.target = _target;\n}\n\nvoid Kick::calculateChipPower(double dist)\n{\n\tdouble range_area = *_chip_max_range - *_chip_min_range;\n\tdouble ratio = (dist - *_chip_min_range)\/range_area;\n\tuint8_t power_area = *_chip_max_power - *_chip_min_power;\n\tdouble power = ratio * (double) power_area + *_chip_min_power;\n\tchip_power = (uint8_t) clamp((double) power, (double) _chip_min_power->value(), 255.0);\n}\n\nbool Kick::findShot(const Geometry2d::Segment& segment, Geometry2d::Segment& result, bool chip, float min_segment_length) const {\n\t\/\/ calculate available target segments\n\tWindowEvaluator evaluator(state());\n\tevaluator.enable_chip = chip;\n\tevaluator.chip_min_range = minChipRange;\n\tevaluator.chip_max_range = maxChipRange;\n\tevaluator.run(ball().pos, segment);\n\tWindow *window = evaluator.best();\n\n\t\/\/ check for output\n\tif(window && window->segment.length() > min_segment_length)\t{\n\t\tresult = window->segment;\n\t\treturn true;\n\t} else {\n\t\treturn false;\n\t}\n}\n\nvoid Kick::setLineKickVelocityScale(double scale_speed, double scale_acc, double scale_w)\n{\n\t_lineKick.scaleSpeed = scale_speed;\n\t_lineKick.scaleAcc = scale_acc;\n\t_lineKick.scaleW = scale_w;\n}\n\nbool Kick::run() {\n\tif (!robot || !robot->visible)\n\t{\n\t\treturn false;\n\t}\n\n\t\/\/ assign robots - assume updated from driver play\n\t_pivotKick.robot = robot;\n\t_lineKick.robot = robot;\n\n\tconst Segment goal_line(Point(Field_Width \/ 2, Field_Length), Point(-Field_Width \/ 2, Field_Length));\n\tconst Segment left_downfield(Point(-Field_Width \/ 2, Field_Length * 0.8), Point(-Field_Width \/ 2, Field_Length));\n\tconst Segment right_downfield(Point(Field_Width \/ 2, Field_Length * 0.8), Point(Field_Width \/ 2, Field_Length));\n\n\t\/\/ check for shot on goal\n\tbool badshot = false;\n\tGeometry2d::Segment available_target = _target;\n\tbool must_use_chip = false;\n\tif (!override_aim)\n\t{\n\t\tif (!forceChip && !(findShot(_target, available_target, false, 0.1) \t\t\t\t\/\/\/ try target first with kicker\n\t\t\t\t|| (enableGoalLineShot && findShot(goal_line, available_target, false, 0.5)) \t\t\/\/\/ try anywhere on goal line\n\t\t\t\t|| (enableLeftDownfieldShot && findShot(left_downfield, available_target, false, 0.5))  \/\/\/ shot off edge of field\n\t\t\t\t|| (enableRightDownfieldShot && findShot(right_downfield, available_target, false, 0.5))\n\t\t))\n\t\t{\n\t\t\trobot->addText(QString(\"Kick: no kick target\"));\n\t\t\tbadshot = true;\n\t\t\tavailable_target = _target;   \/\/\/ if no other option, try kicking anyway\n\t\t} else if (use_chipper && (findShot(_target, available_target, true, 0.1)  \t\t\t\t\/\/\/ try target with chipper\n\t\t\t\t|| (enableGoalLineShot && findShot(goal_line, available_target, true, 0.5)) \t\t\/\/\/ try anywhere on goal line\n\t\t\t\t|| (enableLeftDownfieldShot && findShot(left_downfield, available_target, true, 0.5))  \/\/\/ shot off edge of field\n\t\t\t\t|| (enableRightDownfieldShot && findShot(right_downfield, available_target, true, 0.5))\n\t\t))\n\t\t{\n\t\t\trobot->addText(QString(\"Kick:chipping\"));\n\t\t\tavailable_target = _target;   \/\/\/ if no other option, try kicking anyway\n\t\t\tmust_use_chip = true;\n\t\t} else {\n\t\t\tbadshot = true;\n\t\t}\n\t}\n\n\tconst Geometry2d::Point& rPos = robot->pos;\n\tconst float close_thresh = Robot_Radius + Ball_Radius + 0.10;\n\n\t\/\/ disable obstacle avoidance if we are close to the ball\n\tif (enablePushing && rPos.nearPoint(ball().pos, close_thresh))\n\t\trobot->avoidOpponents(false);\n\telse\n\t\trobot->avoidOpponents(true);\n\n\tbool result = true;\n\t\/\/ there are robots in the way and we are close, disable opponent obstacle avoidance\n\tif (enablePushing && badshot && rPos.nearPoint(ball().pos, close_thresh)) {\n\t\trobot->addText(QString(\"PushingOpponent\"));\n\t\tGeometry2d::Point push_goal = rPos + (_target.center() - rPos).normalized() * 2.0;\n\n\t\t\/\/ drive forward through robots\n\t\trobot->move(push_goal);\n\t\trobot->face(_target.center());\n\t\tresult = true;\n\n\t} else if (use_line_kick)\n\t{\n\t\t_lineKick.target = available_target.center();\n\t\t_lineKick.use_chipper = must_use_chip;\n\t\t_lineKick.kick_power = (must_use_chip) ? chip_power : kick_power;\n\t\t_lineKick.enable_kick = enableKick;\n\t\tkickReady = _lineKick.kick_ready;\n\t\tresult = _lineKick.run();\n\t\tif (_lineKick.done())\n\t\t{\n\t\t\t_done = true;\n\t\t}\n\t} else\n\t{\n\t\t_pivotKick.target = available_target;\n\t\t_pivotKick.dribble_speed = dribbler_speed;\n\t\t_pivotKick.use_chipper = use_chipper;\n\t\t_pivotKick.kick_power = (use_chipper) ? chip_power : kick_power;\n\t\t_pivotKick.enable_kick = enableKick;\n\t\tresult = _pivotKick.run();\n\t\tif (_pivotKick.done())\n\t\t{\n\t\t\t_done = true;\n\t\t}\n\t}\n\t\/\/ Take opportunities!\n\tif(take_open_kicks) {\n\t\tLuck_Options opt = lucky.get_options();\n\t\tbool ok = lucky.use_kick(robot, opt);\n\t\tok &= lucky.open_kick(robot, opt); \/\/ Checks if E open shot to goal\n\t\tif(ok) {\n\t\t\trobot->addText(\"Taking Opportunity!\", Qt::magenta, \"Kick\");\n\t\t\trobot->kick(255);\n\n\t\t\t\/\/ We kicked, therefore exit\n\t\t\tresult = false;\n\t\t}\n\t}\n\n\treturn result;\n}\n\n} \/\/ \\namespace Behaviors\n} \/\/ \\namespace Gameplay\n<|endoftext|>"}
{"text":"<commit_before>#include \"MainFrame.hpp\"\n#include \"misc_ui.hpp\"\n#include <wx\/accel.h>\n#include <wx\/utils.h> \n\n#include \"AboutDialog.hpp\"\n#include \"libslic3r.h\"\n\nnamespace Slic3r { namespace GUI {\n\nwxBEGIN_EVENT_TABLE(MainFrame, wxFrame)\nwxEND_EVENT_TABLE()\n\nMainFrame::MainFrame(const wxString& title, const wxPoint& pos, const wxSize& size)\n        : MainFrame(title, pos, size, nullptr) {}\nMainFrame::MainFrame(const wxString& title, const wxPoint& pos, const wxSize& size, std::shared_ptr<Settings> _gui_config)\n        : wxFrame(NULL, wxID_ANY, title, pos, size), loaded(false),\n        tabpanel(nullptr), controller(nullptr), plater(nullptr), gui_config(_gui_config), preset_editor_tabs(std::map<wxWindowID, PresetEditor*>())\n{\n    \/\/ Set icon to either the .ico if windows or png for everything else.\n    if (the_os == OS::Windows) \n        this->SetIcon(wxIcon(var(\"Slic3r.ico\"), wxBITMAP_TYPE_ICO));\n    else\n        this->SetIcon(wxIcon(var(\"Slic3r_128px.png\"), wxBITMAP_TYPE_PNG));        \n    \n\n    this->init_tabpanel();\n    this->init_menubar();\n\n    wxToolTip::SetAutoPop(TOOLTIP_TIMER);\n\n    \/\/ initialize status bar\n    \/\/ we call SetStatusBar() here because MainFrame is the direct owner. \n    this->statusbar = new ProgressStatusBar(this, -1);\n    wxString welcome_text {_(\"Version SLIC3R_VERSION_REPLACE - Remember to check for updates at http:\/\/slic3r.org\/\")};\n    welcome_text.Replace(\"SLIC3R_VERSION_REPLACE\", wxString(SLIC3R_VERSION));\n    this->statusbar->SetStatusText(welcome_text);\n    this->SetStatusBar(this->statusbar);\n\n    this->loaded = 1;\n\n    \/\/ Initialize layout\n    {\n        wxSizer* sizer = new wxBoxSizer(wxVERTICAL);\n        sizer->Add(this->tabpanel, 1, wxEXPAND);\n        sizer->SetSizeHints(this);\n        this->Fit();\n        this->SetMinSize(wxSize(760, 490));\n        this->SetSize(this->GetMinSize());\n        wxTheApp->SetTopWindow(this);\n        gui_config->restore_window_pos(this, \"main_frame\");\n        this->Show();\n        this->Layout();\n    }\n    \/\/ Set up event handlers.\n    this->Bind(wxEVT_CLOSE_WINDOW, [=](wxCloseEvent& e) {\n        if (e.CanVeto()) {\n            if (!this->plater->prompt_unsaved_changes()) {\n                e.Veto();\n                return;\n            }\n            \/*\n            if ($self->{controller} && $self->{controller}->printing) {\n                my $confirm = Wx::MessageDialog->new($self, \"You are currently printing. Do you want to stop printing and continue anyway?\",\n                    'Unfinished Print', wxICON_QUESTION | wxYES_NO | wxNO_DEFAULT);\n                if ($confirm->ShowModal == wxID_NO) {\n                    $event->Veto;\n                    return;\n                }\n            }\n\n            *\/\n            \/\/ save window size\n            gui_config->save_window_pos(this, \"main_frame\");\n\n            \/\/ Propagate event\n            e.Skip();\n        }\n    });\n}\n\n\/\/\/ Private initialization function for the main frame tab panel.\nvoid MainFrame::init_tabpanel()\n{\n    this->tabpanel = new wxAuiNotebook(this, -1, wxDefaultPosition, wxDefaultSize, wxAUI_NB_TOP);\n    auto panel = this->tabpanel; \n\n    panel->Bind(wxEVT_AUINOTEBOOK_PAGE_CHANGED, ([=](wxAuiNotebookEvent& e) \n    { \n        auto tabpanel = this->tabpanel;\n        \/\/ TODO: trigger processing for activation event\n        if (tabpanel->GetSelection() > 1) {\n            tabpanel->SetWindowStyle(tabpanel->GetWindowStyleFlag() | wxAUI_NB_CLOSE_ON_ACTIVE_TAB);\n        } else if (this->gui_config->show_host == false && tabpanel->GetSelection() == 1) {\n            tabpanel->SetWindowStyle(tabpanel->GetWindowStyleFlag() | wxAUI_NB_CLOSE_ON_ACTIVE_TAB);\n        } else {\n            tabpanel->SetWindowStyle(tabpanel->GetWindowStyleFlag() | ~wxAUI_NB_CLOSE_ON_ACTIVE_TAB);\n        }\n    }), panel->GetId());\n\n    panel->Bind(wxEVT_AUINOTEBOOK_PAGE_CLOSE, ([=](wxAuiNotebookEvent& e) \n    {\n        if (typeid(panel) == typeid(Slic3r::GUI::PresetEditor)) {\n            wxDELETE(this->preset_editor_tabs[panel->GetId()]);\n        }\n        wxTheApp->CallAfter([=] { this->tabpanel->SetSelection(0); });\n    }), panel->GetId());\n\n    this->plater = new Slic3r::GUI::Plater(panel, _(\"Plater\"), gui_config);\n    this->controller = new Slic3r::GUI::Controller(panel, _(\"Controller\"));\n\n    panel->AddPage(this->plater, this->plater->GetName());\n    if (this->gui_config->show_host) panel->AddPage(this->controller, this->controller->GetName());\n    \n}\n\nvoid MainFrame::init_menubar()\n{\n\n    wxMenu* menuFile = new wxMenu();\n    {\n        append_menu_item(menuFile, _(L\"Open STL\/OBJ\/AMF\/3MF…\"), _(\"Open a model\"), [=](wxCommandEvent& e) { if (this->plater != nullptr) this->plater->add();}, wxID_ANY, \"brick_add.png\", \"Ctrl+O\");\n    }\n    \n    wxMenu* menuPlater = new wxMenu();\n    {\n    }\n    wxMenu* menuObject = new wxMenu();\n    {\n    }\n    wxMenu* menuSettings = new wxMenu();\n    {\n    }\n    wxMenu* menuView = new wxMenu();\n    {\n    }\n    wxMenu* menuWindow = new wxMenu();\n    {\n    }\n    wxMenu* menuHelp = new wxMenu();\n    {\n        \/\/ TODO: Reimplement config wizard\n        \/\/menuHelp->AppendSeparator();\n        append_menu_item(menuHelp, _(\"Slic3r &Website\"), _(\"Open the Slic3r website in your browser\"), [=](wxCommandEvent& e) \n        {\n            wxLaunchDefaultBrowser(\"http:\/\/www.slic3r.org\");\n        });\n        append_menu_item(menuHelp, _(\"Check for &Updates...\"), _(\"Check for new Slic3r versions\"), [=](wxCommandEvent& e)\n        {\n            check_version(true);\n        });\n        append_menu_item(menuHelp, _(\"Slic3r &Manual\"), _(\"Open the Slic3r manual in your browser\"), [=](wxCommandEvent& e) \n        {\n            wxLaunchDefaultBrowser(\"http:\/\/manual.slic3r.org\/\");\n        });\n        append_menu_item(menuHelp, _(\"&About Slic3r\"), _(\"Show about dialog\"), [=](wxCommandEvent& e) \n        {\n            auto about = new AboutDialog(nullptr);\n            about->ShowModal();\n            about->Destroy();\n        }, wxID_ABOUT);\n        \n    }\n\n    wxMenuBar* menubar = new wxMenuBar();\n    menubar->Append(menuFile, _(\"&File\"));\n    menubar->Append(menuPlater, _(\"&Plater\"));\n    menubar->Append(menuObject, _(\"&Object\"));\n    menubar->Append(menuSettings, _(\"&Settings\"));\n    menubar->Append(menuView, _(\"&View\"));\n    menubar->Append(menuWindow, _(\"&Window\"));\n    menubar->Append(menuHelp, _(\"&Help\"));\n\n    this->SetMenuBar(menubar);\n\n}\n\n}} \/\/ Namespace Slic3r::GUI\n<commit_msg>Remember to actually set the sizer.<commit_after>#include \"MainFrame.hpp\"\n#include \"misc_ui.hpp\"\n#include <wx\/accel.h>\n#include <wx\/utils.h> \n\n#include \"AboutDialog.hpp\"\n#include \"libslic3r.h\"\n\nnamespace Slic3r { namespace GUI {\n\nwxBEGIN_EVENT_TABLE(MainFrame, wxFrame)\nwxEND_EVENT_TABLE()\n\nMainFrame::MainFrame(const wxString& title, const wxPoint& pos, const wxSize& size)\n        : MainFrame(title, pos, size, nullptr) {}\nMainFrame::MainFrame(const wxString& title, const wxPoint& pos, const wxSize& size, std::shared_ptr<Settings> _gui_config)\n        : wxFrame(NULL, wxID_ANY, title, pos, size), loaded(false),\n        tabpanel(nullptr), controller(nullptr), plater(nullptr), gui_config(_gui_config), preset_editor_tabs(std::map<wxWindowID, PresetEditor*>())\n{\n    \/\/ Set icon to either the .ico if windows or png for everything else.\n    if (the_os == OS::Windows) \n        this->SetIcon(wxIcon(var(\"Slic3r.ico\"), wxBITMAP_TYPE_ICO));\n    else\n        this->SetIcon(wxIcon(var(\"Slic3r_128px.png\"), wxBITMAP_TYPE_PNG));        \n    \n\n    this->init_tabpanel();\n    this->init_menubar();\n\n    wxToolTip::SetAutoPop(TOOLTIP_TIMER);\n\n    \/\/ initialize status bar\n    this->statusbar = new ProgressStatusBar(this, -1);\n    wxString welcome_text {_(\"Version SLIC3R_VERSION_REPLACE - Remember to check for updates at http:\/\/slic3r.org\/\")};\n    welcome_text.Replace(\"SLIC3R_VERSION_REPLACE\", wxString(SLIC3R_VERSION));\n    this->statusbar->SetStatusText(welcome_text);\n    this->SetStatusBar(this->statusbar);\n\n    this->loaded = 1;\n\n    \/\/ Initialize layout\n    {\n        wxSizer* sizer = new wxBoxSizer(wxVERTICAL);\n        sizer->Add(this->tabpanel, 1, wxEXPAND);\n        sizer->SetSizeHints(this);\n        this->SetSizer(sizer);\n        this->Fit();\n        this->SetMinSize(wxSize(760, 490));\n        this->SetSize(this->GetMinSize());\n        wxTheApp->SetTopWindow(this);\n        gui_config->restore_window_pos(this, \"main_frame\");\n        this->Show();\n        this->Layout();\n    }\n    \/\/ Set up event handlers.\n    this->Bind(wxEVT_CLOSE_WINDOW, [=](wxCloseEvent& e) {\n        if (e.CanVeto()) {\n            if (!this->plater->prompt_unsaved_changes()) {\n                e.Veto();\n                return;\n            }\n            \/*\n            if ($self->{controller} && $self->{controller}->printing) {\n                my $confirm = Wx::MessageDialog->new($self, \"You are currently printing. Do you want to stop printing and continue anyway?\",\n                    'Unfinished Print', wxICON_QUESTION | wxYES_NO | wxNO_DEFAULT);\n                if ($confirm->ShowModal == wxID_NO) {\n                    $event->Veto;\n                    return;\n                }\n            }\n\n            *\/\n            \/\/ save window size\n            gui_config->save_window_pos(this, \"main_frame\");\n\n            \/\/ Propagate event\n            e.Skip();\n        }\n    });\n}\n\n\/\/\/ Private initialization function for the main frame tab panel.\nvoid MainFrame::init_tabpanel()\n{\n    this->tabpanel = new wxAuiNotebook(this, -1, wxDefaultPosition, wxDefaultSize, wxAUI_NB_TOP);\n    auto panel = this->tabpanel; \n\n    panel->Bind(wxEVT_AUINOTEBOOK_PAGE_CHANGED, ([=](wxAuiNotebookEvent& e) \n    { \n        auto tabpanel = this->tabpanel;\n        \/\/ TODO: trigger processing for activation event\n        if (tabpanel->GetSelection() > 1) {\n            tabpanel->SetWindowStyle(tabpanel->GetWindowStyleFlag() | wxAUI_NB_CLOSE_ON_ACTIVE_TAB);\n        } else if (this->gui_config->show_host == false && tabpanel->GetSelection() == 1) {\n            tabpanel->SetWindowStyle(tabpanel->GetWindowStyleFlag() | wxAUI_NB_CLOSE_ON_ACTIVE_TAB);\n        } else {\n            tabpanel->SetWindowStyle(tabpanel->GetWindowStyleFlag() | ~wxAUI_NB_CLOSE_ON_ACTIVE_TAB);\n        }\n    }), panel->GetId());\n\n    panel->Bind(wxEVT_AUINOTEBOOK_PAGE_CLOSE, ([=](wxAuiNotebookEvent& e) \n    {\n        if (typeid(panel) == typeid(Slic3r::GUI::PresetEditor)) {\n            wxDELETE(this->preset_editor_tabs[panel->GetId()]);\n        }\n        wxTheApp->CallAfter([=] { this->tabpanel->SetSelection(0); });\n    }), panel->GetId());\n\n    this->plater = new Slic3r::GUI::Plater(panel, _(\"Plater\"), gui_config);\n    this->controller = new Slic3r::GUI::Controller(panel, _(\"Controller\"));\n\n    panel->AddPage(this->plater, this->plater->GetName());\n    if (this->gui_config->show_host) panel->AddPage(this->controller, this->controller->GetName());\n    \n}\n\nvoid MainFrame::init_menubar()\n{\n\n    wxMenu* menuFile = new wxMenu();\n    {\n        append_menu_item(menuFile, _(L\"Open STL\/OBJ\/AMF\/3MF…\"), _(\"Open a model\"), [=](wxCommandEvent& e) { if (this->plater != nullptr) this->plater->add();}, wxID_ANY, \"brick_add.png\", \"Ctrl+O\");\n    }\n    \n    wxMenu* menuPlater = new wxMenu();\n    {\n    }\n    wxMenu* menuObject = new wxMenu();\n    {\n    }\n    wxMenu* menuSettings = new wxMenu();\n    {\n    }\n    wxMenu* menuView = new wxMenu();\n    {\n    }\n    wxMenu* menuWindow = new wxMenu();\n    {\n    }\n    wxMenu* menuHelp = new wxMenu();\n    {\n        \/\/ TODO: Reimplement config wizard\n        \/\/menuHelp->AppendSeparator();\n        append_menu_item(menuHelp, _(\"Slic3r &Website\"), _(\"Open the Slic3r website in your browser\"), [=](wxCommandEvent& e) \n        {\n            wxLaunchDefaultBrowser(\"http:\/\/www.slic3r.org\");\n        });\n        append_menu_item(menuHelp, _(\"Check for &Updates...\"), _(\"Check for new Slic3r versions\"), [=](wxCommandEvent& e)\n        {\n            check_version(true);\n        });\n        append_menu_item(menuHelp, _(\"Slic3r &Manual\"), _(\"Open the Slic3r manual in your browser\"), [=](wxCommandEvent& e) \n        {\n            wxLaunchDefaultBrowser(\"http:\/\/manual.slic3r.org\/\");\n        });\n        append_menu_item(menuHelp, _(\"&About Slic3r\"), _(\"Show about dialog\"), [=](wxCommandEvent& e) \n        {\n            auto about = new AboutDialog(nullptr);\n            about->ShowModal();\n            about->Destroy();\n        }, wxID_ABOUT);\n        \n    }\n\n    wxMenuBar* menubar = new wxMenuBar();\n    menubar->Append(menuFile, _(\"&File\"));\n    menubar->Append(menuPlater, _(\"&Plater\"));\n    menubar->Append(menuObject, _(\"&Object\"));\n    menubar->Append(menuSettings, _(\"&Settings\"));\n    menubar->Append(menuView, _(\"&View\"));\n    menubar->Append(menuWindow, _(\"&Window\"));\n    menubar->Append(menuHelp, _(\"&Help\"));\n\n    this->SetMenuBar(menubar);\n\n}\n\n}} \/\/ Namespace Slic3r::GUI\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2016 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 \"bytes_ostream.hh\"\n\nnamespace utils {\n\nclass fragmented_input_stream {\n    bytes_ostream::fragment_iterator _it;\n    bytes_view _current;\n    size_t _size;\nprivate:\n    template<typename Func>\n    \/\/requires requires(Func f, bytes_view bv) { { f(bv) } -> void; }\n    void for_each_fragment(size_t size, Func&& func) {\n        if (size > _size) {\n            throw std::out_of_range(\"deserialization buffer underflow\");\n        }\n        _size -= size;\n        while (size) {\n            if (_current.empty()) {\n                _current = *_it++;\n            }\n            auto this_size = std::min(_current.size(), size);\n            func(_current.substr(0, this_size));\n            _current.remove_prefix(this_size);\n            size -= this_size;\n        }\n    }\npublic:\n    explicit fragmented_input_stream(bytes_view bv)\n        : _it(nullptr), _current(bv), _size(_current.size()) { }\n    fragmented_input_stream(bytes_ostream::fragment_iterator it, size_t size)\n        : _it(it), _current(size ? *_it++ : bytes_view()), _size(size) { }\n    fragmented_input_stream(bytes_ostream::fragment_iterator it, bytes_view bv, size_t size)\n        : _it(it), _current(bv), _size(size) { }\n\n    void skip(size_t size) {\n        for_each_fragment(size, [] (auto) { });\n    }\n    fragmented_input_stream read_substream(size_t size) {\n        if (size > _size) {\n            throw std::out_of_range(\"deserialization buffer underflow\");\n        }\n        fragmented_input_stream substream(_it, _current, size);\n        skip(size);\n        return substream;\n    }\n    void read(char* p, size_t size) {\n        for_each_fragment(size, [&p] (auto bv) {\n            p = std::copy_n(bv.data(), bv.size(), p);\n        });\n    }\n    template<typename Output>\n    void copy_to(Output& out) {\n        for_each_fragment(_size, [&out] (auto bv) {\n            out.write(reinterpret_cast<const char*>(bv.data()), bv.size());\n        });\n    }\n    const size_t size() const {\n        return _size;\n    }\n};\n\n}<commit_msg>utils: add input_stream<commit_after>\/*\n * Copyright (C) 2016 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\/simple-stream.hh>\n\n#include \"bytes_ostream.hh\"\n\nnamespace utils {\n\nclass fragmented_input_stream {\n    bytes_ostream::fragment_iterator _it;\n    bytes_view _current;\n    size_t _size;\nprivate:\n    template<typename Func>\n    \/\/requires requires(Func f, bytes_view bv) { { f(bv) } -> void; }\n    void for_each_fragment(size_t size, Func&& func) {\n        if (size > _size) {\n            throw std::out_of_range(\"deserialization buffer underflow\");\n        }\n        _size -= size;\n        while (size) {\n            if (_current.empty()) {\n                _current = *_it++;\n            }\n            auto this_size = std::min(_current.size(), size);\n            func(_current.substr(0, this_size));\n            _current.remove_prefix(this_size);\n            size -= this_size;\n        }\n    }\npublic:\n    explicit fragmented_input_stream(bytes_view bv)\n        : _it(nullptr), _current(bv), _size(_current.size()) { }\n    fragmented_input_stream(bytes_ostream::fragment_iterator it, size_t size)\n        : _it(it), _current(size ? *_it++ : bytes_view()), _size(size) { }\n    fragmented_input_stream(bytes_ostream::fragment_iterator it, bytes_view bv, size_t size)\n        : _it(it), _current(bv), _size(size) { }\n\n    void skip(size_t size) {\n        for_each_fragment(size, [] (auto) { });\n    }\n    fragmented_input_stream read_substream(size_t size) {\n        if (size > _size) {\n            throw std::out_of_range(\"deserialization buffer underflow\");\n        }\n        fragmented_input_stream substream(_it, _current, size);\n        skip(size);\n        return substream;\n    }\n    void read(char* p, size_t size) {\n        for_each_fragment(size, [&p] (auto bv) {\n            p = std::copy_n(bv.data(), bv.size(), p);\n        });\n    }\n    template<typename Output>\n    void copy_to(Output& out) {\n        for_each_fragment(_size, [&out] (auto bv) {\n            out.write(reinterpret_cast<const char*>(bv.data()), bv.size());\n        });\n    }\n    const size_t size() const {\n        return _size;\n    }\n};\n\n\/*\ntemplate<typename Visitor>\nconcept bool StreamVisitor() {\n    return requires(Visitor visitor, seastar::simple_input_stream& simple, fragmented_input_stream& fragmented) {\n        visitor(simple);\n        visitor(fragmented);\n    };\n}\n*\/\n\/\/ input_stream performs type erasure optimised for cases where\n\/\/ seastar::simple_input_stream is used.\n\/\/ By using a lot of [[gnu::always_inline]] attributes this class attempts to\n\/\/ make the compiler generate code with simple_input_stream functions inlined\n\/\/ directly in the user of the intput_stream.\nclass input_stream {\n    const bool _is_simple;\n    union {\n        seastar::simple_input_stream _simple;\n        fragmented_input_stream _fragmented;\n    };\nprivate:\n    template<typename StreamVisitor>\n    [[gnu::always_inline]]\n    decltype(auto) with_stream(StreamVisitor&& visitor) {\n        if (__builtin_expect(_is_simple, true)) {\n            return visitor(_simple);\n        }\n        return visitor(_fragmented);\n    }\n\n    template<typename StreamVisitor>\n    [[gnu::always_inline]]\n    decltype(auto) with_stream(StreamVisitor&& visitor) const {\n        if (__builtin_expect(_is_simple, true)) {\n            return visitor(_simple);\n        }\n        return visitor(_fragmented);\n    }\npublic:\n    input_stream(seastar::simple_input_stream stream)\n            : _is_simple(true), _simple(std::move(stream)) { }\n    input_stream(fragmented_input_stream stream)\n            : _is_simple(false), _fragmented(std::move(stream)) { }\n\n    [[gnu::always_inline]]\n    input_stream(const input_stream& other) noexcept : _is_simple(other._is_simple) {\n        \/\/ Making this copy constructor noexcept makes copy assignment simpler.\n        \/\/ Besides, performance of input_stream relies on the fact that both\n        \/\/ fragmented and simple input stream are PODs and the branch below\n        \/\/ is optimized away, so throwable copy constructors aren't something\n        \/\/ we want.\n        static_assert(std::is_nothrow_copy_constructible<fragmented_input_stream>::value,\n                      \"fragmented_input_stream should be copy constructible\");\n        static_assert(std::is_nothrow_copy_constructible<seastar::simple_input_stream>::value,\n                      \"seastar::simple_input_stream should be copy constructible\");\n        if (_is_simple) {\n            new (&_simple) seastar::simple_input_stream(other._simple);\n        } else {\n            new (&_fragmented) fragmented_input_stream(other._fragmented);\n        }\n    }\n\n    [[gnu::always_inline]]\n    input_stream(input_stream&& other) noexcept : _is_simple(other._is_simple) {\n        if (_is_simple) {\n            new (&_simple) seastar::simple_input_stream(std::move(other._simple));\n        } else {\n            new (&_fragmented) fragmented_input_stream(std::move(other._fragmented));\n        }\n    }\n\n    [[gnu::always_inline]]\n    input_stream& operator=(const input_stream& other) noexcept {\n        \/\/ Copy constructor being noexcept makes copy assignment simpler.\n        static_assert(std::is_nothrow_copy_constructible<input_stream>::value,\n                      \"input_stream copy constructor shouldn't throw\");\n        if (this != &other) {\n            this->~input_stream();\n            new (this) input_stream(other);\n        }\n        return *this;\n    }\n\n    [[gnu::always_inline]]\n    input_stream& operator=(input_stream&& other) noexcept {\n        if (this != &other) {\n            this->~input_stream();\n            new (this) input_stream(std::move(other));\n        }\n        return *this;\n    }\n\n    [[gnu::always_inline]]\n    ~input_stream() {\n        if (_is_simple) {\n            _simple.~simple_input_stream();\n        } else {\n            _fragmented.~fragmented_input_stream();\n        }\n    }\n\n    [[gnu::always_inline]]\n    void skip(size_t size) {\n        with_stream([size] (auto& stream) {\n            stream.skip(size);\n        });\n    }\n\n    [[gnu::always_inline]]\n    input_stream read_substream(size_t size) {\n        return with_stream([size] (auto& stream) -> input_stream {\n            return stream.read_substream(size);\n        });\n    }\n\n    [[gnu::always_inline]]\n    void read(char* p, size_t size) {\n        with_stream([p, size] (auto& stream) {\n            stream.read(p, size);\n        });\n    }\n\n    template<typename Output>\n    [[gnu::always_inline]]\n    void copy_to(Output& out) {\n        with_stream([&out] (auto& stream) {\n            stream.copy_to(out);\n        });\n    }\n\n    [[gnu::always_inline]]\n    size_t size() const {\n        return with_stream([] (auto& stream) {\n            return stream.size();\n        });\n    }\npublic:\n    \/\/ The purpose of the with_stream() is to minimize number of dynamic\n    \/\/ dispatches. For example, a lot of IDL-generated code looks like this:\n    \/\/ auto some_value() const {\n    \/\/     return utils::input_stream::with_stream(v, [] (auto& v) {\n    \/\/         auto in = v;\n    \/\/         ser::skip(in, boost::type<type1>());\n    \/\/         ser::skip(in, boost::type<type2>());\n    \/\/         return deserialize(in, boost::type<type3>());\n    \/\/     });\n    \/\/ }\n    \/\/ Using with_stream() there is at most one dynamic dispatch per such\n    \/\/ function, instead of one per each skip() and deserialize() call.\n\n    template<typename Stream, typename StreamVisitor>\n    [[gnu::always_inline]]\n    static std::enable_if_t<std::is_same<std::decay_t<Stream>, input_stream>::value, std::result_of_t<StreamVisitor(Stream&)>>\n    with_stream(Stream& stream, StreamVisitor&& visitor) {\n        return stream.with_stream(std::forward<StreamVisitor>(visitor));\n    }\n\n    template<typename Stream, typename StreamVisitor>\n    [[gnu::always_inline]]\n    static std::enable_if_t<!std::is_same<std::decay_t<Stream>, input_stream>::value, std::result_of_t<StreamVisitor(Stream&)>>\n    with_stream(Stream& stream, StreamVisitor&& visitor) {\n        return visitor(stream);\n    }\n};\n\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#include \"compiler\/cstring.h\"\n#include \"compiler\/compiler.h\"\n#include \"compiler\/scope.h\"\n#include \"compiler\/value.h\"\n#include \"interpreter\/location.hh\"\n#include \"types\/native_types.h\"\n\nnamespace clever {\n\n\/**\n * Declaration of namespace global type ptrs for Clever native types\n *\/\nDECLARE_CLEVER_NATIVE_TYPES();\n\n\/**\n * Compiler initialization phase\n *\/\nvoid Compiler::init()\n{\n\tm_scope = new Scope;\n\n\tm_ir.reserve(20);\n\tm_scope_pool.reserve(10);\n\tm_value_pool.reserve(30);\n\tm_type_pool.reserve(15);\n\n\tm_value_pool[m_value_id++] = NULL;\n\tm_scope_pool[m_scope_id++] = m_scope;\n\n\t\/**\n\t * Native type allocation\n\t *\/\n\tm_type_pool[m_type_id++] = CLEVER_INT_TYPE    = new IntType;\n\tm_type_pool[m_type_id++] = CLEVER_DOUBLE_TYPE = new DoubleType;\n}\n\n\/**\n * Frees all resource used by the compiler\n *\/\nvoid Compiler::shutdown()\n{\n\tCLEVER_SAFE_DELETE(g_cstring_tbl);\n\tCLEVER_SAFE_DELETE(m_scope);\n\n\tValuePool::const_iterator it = m_value_pool.begin(),\n\t\tend = m_value_pool.end();\n\n\twhile (it != end) {\n\t\tif (*it) {\n\t\t\t(*it)->delRef();\n\t\t}\n\t\t++it;\n\t}\n\n\tTypePool::const_iterator it2 = m_type_pool.begin(),\n\t\tend2 = m_type_pool.end();\n\n\twhile (it2 != end2) {\n\t\tdelete *it2;\n\t\t++it2;\n\t}\n}\n\n\/**\n * Compiler termination phase\n *\/\nvoid Compiler::end()\n{\n\tm_ir.push_back(IR(OP_HALT));\n}\n\n\/**\n * Displays an error message and exits\n *\/\nvoid Compiler::error(const char* msg) const\n{\n\tstd::cerr << \"Compile error: \" << msg << std::endl;\n\tCLEVER_EXIT_FATAL();\n}\n\n\/**\n * Displays an error message\n *\/\nvoid Compiler::error(const std::string& message, const location& loc) const\n{\n\tif (loc.begin.filename) {\n\t\tstd::cerr << \"Compile error: \" << message << \" on \"\n\t\t\t<< *loc.begin.filename << \" line \" << loc.begin.line << \"\\n\";\n\t} else {\n\t\tstd::cerr << \"Compile error: \" << message << \" on line \"\n\t\t\t<< loc.begin.line << \"\\n\";\n\t}\n\tCLEVER_EXIT_FATAL();\n}\n\n\/**\n * Displays a formatted error message and abort the compilation\n *\/\nvoid Compiler::errorf(const location& loc, const char* format, ...) const\n{\n\tstd::ostringstream out;\n\tva_list args;\n\n\tva_start(args, format);\n\n\tvsprintf(out, format, args);\n\n\tva_end(args);\n\n\terror(out.str(), loc);\n}\n\n\/**\n * Abstracts the Value* ptr gets from Node\n * NOTE: When the Node is a STRCONST, it automatically increments the Value's\n * refcount related to the Symbol\n *\/\nValue* Compiler::getValue(Node& node, size_t* val_id, const location& loc) const\n{\n\tif (node.type == VALUE) {\n\t\treturn node.data.val;\n\t} else if (node.type == STRCONST) {\n\t\tSymbol* sym = m_scope->getSymbol(node.data.str);\n\n\t\tif (!sym) {\n\t\t\terrorf(loc, \"Variable `%S' cannot be found!\", node.data.str);\n\t\t}\n\t\tif (val_id) {\n\t\t\t*val_id = sym->getValueId();\n\t\t}\n\t\treturn m_value_pool[sym->getValueId()];\n\t}\n\treturn NULL;\n}\n\n\/**\n * Compiles a variable declaration\n *\/\nvoid Compiler::varDeclaration(Node& var, Node* node, const location& loc)\n{\n\t\/\/\/ A NULL value is created for uninitialized declaration\n\tsize_t val_id = 0;\n\tValue* val = node ? getValue(*node, &val_id, loc) : new Value();\n\n\tm_scope->push(var.data.str, m_value_id);\n\n\t\/\/\/ Symbol value\n\tm_value_pool[m_value_id++] = new Value();\n\n\t\/\/\/ Value to be assigned\n\tif (val_id) {\n\t\tm_ir.push_back(\n\t\t\tIR(OP_ASSIGN, FETCH_VAL, m_value_id-1, FETCH_VAL, val_id));\n\t} else {\n\t\tm_ir.push_back(\n\t\t\tIR(OP_ASSIGN, FETCH_VAL, m_value_id-1, FETCH_VAL, m_value_id));\n\n\t\tm_value_pool[m_value_id++] = val;\n\t}\n}\n\n\/**\n * Compiles a variable assignment\n *\/\nvoid Compiler::assignment(Node& var, Node& value, const location& loc)\n{\n\tsize_t var_id = 0, val_id = 0;\n\t(void)getValue(var, &var_id, loc);\n\tValue* val = getValue(value, &val_id, loc);\n\n\tif (val_id) {\n\t\tm_ir.push_back(\n\t\t\tIR(OP_ASSIGN, FETCH_VAL, var_id, FETCH_VAL, val_id));\n\t} else {\n\t\tm_ir.push_back(\n\t\t\tIR(OP_ASSIGN, FETCH_VAL, var_id, FETCH_VAL, m_value_id));\n\n\t\tm_value_pool[m_value_id++] = val;\n\t}\n}\n\n\/**\n * Compiles a set of binary operation\n *\/\nvoid Compiler::binOp(Opcode op, Node& lhs, Node& rhs, Node& res,\n\tconst location& loc)\n{\n\tValue* result = new Value();\n\n\tm_ir.push_back(\n\t\tIR(OP_PLUS, FETCH_VAL, m_value_id, FETCH_VAL, m_value_id+1, result));\n\n\tm_value_pool[m_value_id++] = getValue(lhs, NULL, loc);\n\tm_value_pool[m_value_id++] = getValue(rhs, NULL, loc);\n\n\tres.type = VALUE;\n\tres.data.val = result;\n}\n\n\/**\n * Temporary print statement compilation\n *\/\nvoid Compiler::print(Node& node, const location& loc)\n{\n\tif (node.type == STRCONST) {\n\t\tSymbol* sym = m_scope->getSymbol(node.data.str);\n\n\t\tif (!sym) {\n\t\t\terrorf(loc, \"Variable `%S' cannot be found!\", node.data.str);\n\t\t}\n\t\tm_ir.push_back(IR(OP_PRINT, FETCH_VAL, sym->getValueId()));\n\t} else {\n\t\tm_ir.push_back(IR(OP_PRINT, FETCH_VAL, m_value_id));\n\t\tm_value_pool[m_value_id++] = node.data.val;\n\t}\n}\n\n\/**\n * Starts the function compilation\n *\/\nvoid Compiler::funcDecl(Node& node)\n{\n\tm_curr_func = m_ir.size();\n\tm_ir.push_back(IR(OP_JMP, JMP_ADDR, 0));\n}\n\n\/**\n * Ends the current function compilation\n *\/\nvoid Compiler::funcEndDecl()\n{\n\tm_ir[m_curr_func].op1 = m_ir.size();\n}\n\n\/**\n * Creates a new lexical scope\n *\/\nvoid Compiler::newScope()\n{\n\tm_scope = m_scope->newLexicalScope();\n\tm_scope->setId(m_scope_id);\n\n\tm_scope_pool[m_scope_id++] = m_scope;\n}\n\n\/**\n * Scope end marker to switch to parent scope\n *\/\nvoid Compiler::endScope()\n{\n\tm_scope = m_scope->getParent();\n}\n\n} \/\/ clever\n<commit_msg>- More comment is good :)<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#include \"compiler\/cstring.h\"\n#include \"compiler\/compiler.h\"\n#include \"compiler\/scope.h\"\n#include \"compiler\/value.h\"\n#include \"interpreter\/location.hh\"\n#include \"types\/native_types.h\"\n\nnamespace clever {\n\n\/**\n * Declaration of namespace global type ptrs for Clever native types\n *\/\nDECLARE_CLEVER_NATIVE_TYPES();\n\n\/**\n * Compiler initialization phase\n *\/\nvoid Compiler::init()\n{\n\tm_scope = new Scope;\n\n\tm_ir.reserve(20);\n\tm_scope_pool.reserve(10);\n\tm_value_pool.reserve(30);\n\tm_type_pool.reserve(15);\n\n\tm_value_pool[m_value_id++] = NULL;\n\tm_scope_pool[m_scope_id++] = m_scope;\n\n\t\/**\n\t * Native type allocation\n\t *\/\n\tm_type_pool[m_type_id++] = CLEVER_INT_TYPE    = new IntType;\n\tm_type_pool[m_type_id++] = CLEVER_DOUBLE_TYPE = new DoubleType;\n}\n\n\/**\n * Frees all resource used by the compiler\n *\/\nvoid Compiler::shutdown()\n{\n\tCLEVER_SAFE_DELETE(g_cstring_tbl);\n\tCLEVER_SAFE_DELETE(m_scope);\n\n\tValuePool::const_iterator it = m_value_pool.begin(),\n\t\tend = m_value_pool.end();\n\n\twhile (it != end) {\n\t\tif (*it) {\n\t\t\t(*it)->delRef();\n\t\t}\n\t\t++it;\n\t}\n\n\tTypePool::const_iterator it2 = m_type_pool.begin(),\n\t\tend2 = m_type_pool.end();\n\n\twhile (it2 != end2) {\n\t\tdelete *it2;\n\t\t++it2;\n\t}\n}\n\n\/**\n * Compiler termination phase\n *\/\nvoid Compiler::end()\n{\n\tm_ir.push_back(IR(OP_HALT));\n}\n\n\/**\n * Displays an error message and exits\n *\/\nvoid Compiler::error(const char* msg) const\n{\n\tstd::cerr << \"Compile error: \" << msg << std::endl;\n\tCLEVER_EXIT_FATAL();\n}\n\n\/**\n * Displays an error message\n *\/\nvoid Compiler::error(const std::string& message, const location& loc) const\n{\n\tif (loc.begin.filename) {\n\t\tstd::cerr << \"Compile error: \" << message << \" on \"\n\t\t\t<< *loc.begin.filename << \" line \" << loc.begin.line << \"\\n\";\n\t} else {\n\t\tstd::cerr << \"Compile error: \" << message << \" on line \"\n\t\t\t<< loc.begin.line << \"\\n\";\n\t}\n\tCLEVER_EXIT_FATAL();\n}\n\n\/**\n * Displays a formatted error message and abort the compilation\n *\/\nvoid Compiler::errorf(const location& loc, const char* format, ...) const\n{\n\tstd::ostringstream out;\n\tva_list args;\n\n\tva_start(args, format);\n\n\tvsprintf(out, format, args);\n\n\tva_end(args);\n\n\terror(out.str(), loc);\n}\n\n\/**\n * Abstracts the Value* ptr gets from Node\n * NOTE: When the Node is a STRCONST, it automatically increments the Value's\n * refcount related to the Symbol\n *\/\nValue* Compiler::getValue(Node& node, size_t* val_id, const location& loc) const\n{\n\tif (node.type == VALUE) {\n\t\treturn node.data.val;\n\t} else if (node.type == STRCONST) {\n\t\tSymbol* sym = m_scope->getSymbol(node.data.str);\n\n\t\tif (!sym) {\n\t\t\terrorf(loc, \"Variable `%S' cannot be found!\", node.data.str);\n\t\t}\n\t\tif (val_id) {\n\t\t\t*val_id = sym->getValueId();\n\t\t}\n\t\treturn m_value_pool[sym->getValueId()];\n\t}\n\treturn NULL;\n}\n\n\/**\n * Compiles a variable declaration\n *\/\nvoid Compiler::varDeclaration(Node& var, Node* node, const location& loc)\n{\n\t\/\/\/ A NULL value is created for uninitialized declaration\n\tsize_t val_id = 0;\n\tValue* val = node ? getValue(*node, &val_id, loc) : new Value();\n\n\tm_scope->push(var.data.str, m_value_id);\n\n\t\/\/\/ Symbol value\n\tm_value_pool[m_value_id++] = new Value();\n\n\t\/\/\/ Value to be assigned\n\tif (val_id) {\n\t\tm_ir.push_back(\n\t\t\tIR(OP_ASSIGN, FETCH_VAL, m_value_id-1, FETCH_VAL, val_id));\n\t} else {\n\t\tm_ir.push_back(\n\t\t\tIR(OP_ASSIGN, FETCH_VAL, m_value_id-1, FETCH_VAL, m_value_id));\n\n\t\tm_value_pool[m_value_id++] = val;\n\t}\n}\n\n\/**\n * Compiles a variable assignment\n *\/\nvoid Compiler::assignment(Node& var, Node& value, const location& loc)\n{\n\tsize_t var_id = 0, val_id = 0;\n\t(void)getValue(var, &var_id, loc);\n\tValue* val = getValue(value, &val_id, loc);\n\n\tif (val_id) {\n\t\tm_ir.push_back(\n\t\t\tIR(OP_ASSIGN, FETCH_VAL, var_id, FETCH_VAL, val_id));\n\t} else {\n\t\tm_ir.push_back(\n\t\t\tIR(OP_ASSIGN, FETCH_VAL, var_id, FETCH_VAL, m_value_id));\n\n\t\tm_value_pool[m_value_id++] = val;\n\t}\n}\n\n\/**\n * Compiles a set of binary operation\n *\/\nvoid Compiler::binOp(Opcode op, Node& lhs, Node& rhs, Node& res,\n\tconst location& loc)\n{\n\tValue* result = new Value();\n\n\tm_ir.push_back(\n\t\tIR(OP_PLUS, FETCH_VAL, m_value_id, FETCH_VAL, m_value_id+1, result));\n\n\tm_value_pool[m_value_id++] = getValue(lhs, NULL, loc);\n\tm_value_pool[m_value_id++] = getValue(rhs, NULL, loc);\n\n\tres.type = VALUE;\n\tres.data.val = result;\n}\n\n\/**\n * Temporary print statement compilation\n *\/\nvoid Compiler::print(Node& node, const location& loc)\n{\n\tif (node.type == STRCONST) {\n\t\tSymbol* sym = m_scope->getSymbol(node.data.str);\n\n\t\tif (!sym) {\n\t\t\terrorf(loc, \"Variable `%S' cannot be found!\", node.data.str);\n\t\t}\n\t\tm_ir.push_back(IR(OP_PRINT, FETCH_VAL, sym->getValueId()));\n\t} else {\n\t\tm_ir.push_back(IR(OP_PRINT, FETCH_VAL, m_value_id));\n\t\tm_value_pool[m_value_id++] = node.data.val;\n\t}\n}\n\n\/**\n * Starts the function compilation\n *\/\nvoid Compiler::funcDecl(Node& node)\n{\n\tm_curr_func = m_ir.size();\n\tm_ir.push_back(IR(OP_JMP, JMP_ADDR, 0));\n}\n\n\/**\n * Ends the current function compilation\n *\/\nvoid Compiler::funcEndDecl()\n{\n\t\/**\n\t * Changes the JMP's addr created right before the func declaration\n\t * to point to the end of current function, thus skipping its opcodes\n\t *\/\n\tm_ir[m_curr_func].op1 = m_ir.size();\n}\n\n\/**\n * Creates a new lexical scope\n *\/\nvoid Compiler::newScope()\n{\n\tm_scope = m_scope->newLexicalScope();\n\tm_scope->setId(m_scope_id);\n\n\tm_scope_pool[m_scope_id++] = m_scope;\n}\n\n\/**\n * Scope end marker to switch to parent scope\n *\/\nvoid Compiler::endScope()\n{\n\tm_scope = m_scope->getParent();\n}\n\n} \/\/ clever\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#include \"compiler\/cstring.h\"\n#include \"compiler\/compiler.h\"\n#include \"compiler\/scope.h\"\n#include \"compiler\/value.h\"\n#include \"interpreter\/location.hh\"\n#include \"types\/native_types.h\"\n\nnamespace clever {\n\n\/\/ Declaration of namespace global type ptrs for Clever native types\nDECLARE_CLEVER_NATIVE_TYPES();\n\n\/\/\/ Compiler initialization phase\nvoid Compiler::init()\n{\n\tm_scope = new Scope;\n\n\tm_ir.reserve(20);\n\tm_scope_pool.reserve(10);\n\tm_type_pool.reserve(15);\n\n\tm_scope_pool[m_scope_id++] = m_scope;\n\n\t\/\/ Native type allocation\n\tm_type_pool[m_type_id++] = CLEVER_INT_TYPE    = new IntType;\n\tm_type_pool[m_type_id++] = CLEVER_DOUBLE_TYPE = new DoubleType;\n\tm_type_pool[m_type_id++] = CLEVER_STR_TYPE    = new StrType;\n\tm_type_pool[m_type_id++] = CLEVER_FUNC_TYPE   = new FuncType;\n\n\tm_pkg.init();\n}\n\n\/\/\/ Frees all resource used by the compiler\nvoid Compiler::shutdown()\n{\n\tm_pkg.shutdown();\n\n\tCLEVER_SAFE_DELETE(g_cstring_tbl);\n\tCLEVER_SAFE_DELETE(m_scope);\n\n\tTypePool::const_iterator it2 = m_type_pool.begin(),\n\t\tend2 = m_type_pool.end();\n\n\twhile (it2 != end2) {\n\t\tdelete *it2;\n\t\t++it2;\n\t}\n}\n\n\/\/ Compiler termination phase\nvoid Compiler::end()\n{\n}\n\n\/\/\/ Displays an error message and exits\nvoid Compiler::error(const char* msg) const\n{\n\tstd::cerr << \"Compile error: \" << msg << std::endl;\n\tCLEVER_EXIT_FATAL();\n}\n\n\/\/\/ Displays an error message\nvoid Compiler::error(const std::string& message, const location& loc) const\n{\n\tif (loc.begin.filename) {\n\t\tstd::cerr << \"Compile error: \" << message << \" on \"\n\t\t\t<< *loc.begin.filename << \" line \" << loc.begin.line << \"\\n\";\n\t} else {\n\t\tstd::cerr << \"Compile error: \" << message << \" on line \"\n\t\t\t<< loc.begin.line << \"\\n\";\n\t}\n\tCLEVER_EXIT_FATAL();\n}\n\n\/\/\/ Displays a formatted error message and abort the compilation\nvoid Compiler::errorf(const location& loc, const char* format, ...) const\n{\n\tstd::ostringstream out;\n\tva_list args;\n\n\tva_start(args, format);\n\n\tvsprintf(out, format, args);\n\n\tva_end(args);\n\n\terror(out.str(), loc);\n}\n\n\/\/\/ Abstracts the Value* ptr gets from Node\n\/\/ NOTE: When the Node is a STRCONST, it automatically increments the Value's\n\/\/ refcount related to the Symbol\nValue* Compiler::getValue(Node& node, Symbol** symbol, const location& loc) const\n{\n\tif (node.type == VALUE) {\n\t\treturn node.data.val;\n\t} else if (node.type == STRCONST) {\n\t\tSymbol* sym = m_scope->getAny(node.data.str);\n\n\t\tif (!sym) {\n\t\t\terrorf(loc, \"Variable `%S' cannot be found!\", node.data.str);\n\t\t}\n\t\tif (symbol) {\n\t\t\t*symbol = sym;\n\t\t}\n\n\t\treturn m_scope_pool[sym->scope->getId()]->getVar(sym->value_id);\n\t}\n\treturn NULL;\n}\n\n\/\/\/ Compiles a variable declaration\nvoid Compiler::varDeclaration(Node& var, Node* node, const location& loc)\n{\n\tSymbol* sym = m_scope->getLocal(var.data.str);\n\n\tif (sym) {\n\t\terrorf(loc, \"Variable `%S' already declared in the scope!\", var.data.str);\n\t}\n\n\tsize_t sym_id = m_scope->pushVar(var.data.str, new Value());\n\n\t\/\/ A NULL value is created for uninitialized declaration\n\tsym = NULL;\n\tValue* val = node ? getValue(*node, &sym, loc) : new Value();\n\n\t\/\/ Value to be assigned\n\tif (sym) {\n\t\tm_ir.push_back(\n\t\t\tIR(OP_ASSIGN, FETCH_VAL, sym_id, FETCH_VAL, sym->value_id));\n\n\t\tm_ir.back().op2_scope = sym->scope->getId();\n\t} else {\n\t\tm_ir.push_back(\n\t\t\tIR(OP_ASSIGN, FETCH_VAL, sym_id, FETCH_VAL, m_scope->pushConst(val)));\n\n\t\tm_ir.back().op2_scope = m_scope->getId();\n\t}\n\tm_ir.back().op1_scope = m_scope->getId();\n}\n\n\/\/\/ Compiles a variable assignment\nvoid Compiler::assignment(Node& var, Node& value, const location& loc)\n{\n\tSymbol* var_sym = NULL, *val_sym = NULL;\n\t(void)getValue(var, &var_sym, loc);\n\tValue* val = getValue(value, &val_sym, loc);\n\n\tif (val_sym) {\n\t\tm_ir.push_back(\n\t\t\tIR(OP_ASSIGN, FETCH_VAL, var_sym->value_id, FETCH_VAL, val_sym->value_id));\n\n\t\tm_ir.back().op1_scope = var_sym->scope->getId();\n\t\tm_ir.back().op2_scope = val_sym->scope->getId();\n\t} else {\n\t\tm_ir.push_back(\n\t\t\tIR(OP_ASSIGN, FETCH_VAL, var_sym->value_id, FETCH_VAL, m_scope->pushConst(val)));\n\n\t\tm_ir.back().op1_scope = var_sym->scope->getId();\n\t\tm_ir.back().op1_scope = m_scope->getId();\n\n\t}\n}\n\n\/\/\/ Compiles a set of binary operation\nvoid Compiler::binOp(Opcode op, Node& lhs, Node& rhs, Node& res,\n\tconst location& loc)\n{\/*\n\tsize_t rhs_id = 0, lhs_id = 0;\n\tValue* result = new Value();\n\n\tValue* val = getValue(lhs, &lhs_id, loc);\n\n\tif (!lhs_id) {\n\t\tlhs_id = m_value_id++;\n\t\tm_value_pool[lhs_id] = val;\n\t}\n\n\tval = getValue(rhs, &rhs_id, loc);\n\n\tif (!rhs_id) {\n\t\trhs_id = m_value_id++;\n\t\tm_value_pool[rhs_id] = val;\n\t}\n\n\tm_ir.push_back(\n\t\tIR(op, FETCH_VAL, lhs_id, FETCH_VAL, rhs_id, result));\n\n\tres.type = VALUE;\n\tres.data.val = result;*\/\n}\n\n\/\/\/ Creates a list of arguments\nArgDeclList* Compiler::newArgDeclList(const CString* arg) const\n{\n\tArgDeclList* arg_list = new ArgDeclList;\n\targ_list->push_back(arg);\n\n\treturn arg_list;\n}\n\n\/\/\/ Starts the function compilation\nvoid Compiler::funcDecl(Node& node, ArgDeclList* arg_list, const location& loc)\n{\n\tSymbol* sym = m_scope->getAny(node.data.str);\n\n\tif (sym) {\n\t\terrorf(loc, \"Name `%S' already in used!\", node.data.str);\n\t}\n\t\/\/ Saves the current instruction size to be used as a index for\n\t\/\/ changing the jmp address to right after the end of function declaration\n\tm_curr_func = m_ir.size();\n\n\tValue* func = new Value();\n\tFunction* funcdata = static_cast<Function*>(CLEVER_FUNC_TYPE->allocData());\n\n\tfunc->setType(CLEVER_FUNC_TYPE);\n\tfunc->setObj(funcdata);\n\n\tfuncdata->setName(*node.data.str);\n\tfuncdata->setUserDefined();\n\tfuncdata->setAddr(m_curr_func + 1);\n\n\tm_ir.push_back(IR(OP_JMP, JMP_ADDR, 0));\n\n\t\/\/ Adds the function symbol to the current scope\n\tm_scope->pushVar(node.data.str, func);\n\n\t\/\/ Create a scope for argument list when used\n\tif (arg_list) {\n\t\tArgDeclList::const_iterator it = arg_list->begin(),\n\t\t\tend = arg_list->end();\n\n\t\tnewScope();\n\n\t\twhile (it != end) {\n\t\t\tm_scope->pushVar(*it, new Value());\n\t\t\t++it;\n\t\t}\n\t\tdelete arg_list;\n\n\t\tfuncdata->setArgVars(m_scope);\n\t}\n\n\t\/\/ Creates a scope for the local vars\n\tnewScope();\n\n\tfuncdata->setLocalVars(m_scope);\n}\n\n\/\/\/ Adds new argument to the call argument list\nArgCallList* Compiler::addArgCall(ArgCallList* arg_list, Node& arg, const location& loc)\n{\n\tSymbol* sym = NULL;\n\tValue* val = getValue(arg, &sym, loc);\n\n\tif (!arg_list) {\n\t\targ_list = new ArgCallList;\n\t}\n\n\tif (sym) {\n\t\targ_list->push_back(std::pair<size_t, size_t>(sym->scope->getId(), sym->value_id));\n\t} else {\n\t\targ_list->push_back(std::pair<size_t, size_t>(m_scope->getId(), m_scope->pushConst(val)));\n\t}\n\n\treturn arg_list;\n}\n\n\/\/\/ Ends the current function compilation\nvoid Compiler::funcEndDecl(bool has_args)\n{\n\tm_ir.push_back(IR(OP_LEAVE));\n\t\/\/ Changes the JMP's addr created right before the func declaration\n\t\/\/ to point to the end of current function, thus skipping its opcodes\n\tm_ir[m_curr_func].op1 = m_ir.size();\n\n\t\/\/ Switchs to the global scope again\n\tif (has_args) {\n\t\tendScope();\n\t}\n\tendScope();\n}\n\n\/\/\/ Function call compilation\nvoid Compiler::funcCall(Node& name, ArgCallList* arg_list, Node& res,\n\tconst location& loc)\n{\n\tSymbol* sym = m_scope->getAny(name.data.str);\n\n\tif (!sym) {\n\t\terrorf(loc, \"Function `%S' cannot be found!\", name.data.str);\n\t}\n\n\tValue* result = new Value();\n\n\tif (arg_list) {\n\t\tfor (size_t i = 0, j = arg_list->size(); i < j; ++i) {\n\t\t\tm_ir.push_back(IR(OP_SEND_VAL, FETCH_VAL, arg_list->at(i).second));\n\n\t\t\tm_ir.back().op1_scope = arg_list->at(i).first;\n\t\t}\n\t}\n\n\tres.type = VALUE;\n\tres.data.val = result;\n\n\tm_ir.push_back(\n\t\tIR(OP_FCALL, FETCH_VAL, sym->value_id, result));\n\n\tm_ir.back().op1_scope = sym->scope->getId();\n\n\tif (arg_list) {\n\t\tdelete arg_list;\n\t}\n}\n\n\/\/\/ Compiles a return statement\nvoid Compiler::retStmt(Node* expr, const location& loc)\n{\n\tif (expr) {\n\t\tSymbol* sym = NULL;\n\t\tValue* value = getValue(*expr, &sym, loc);\n\n\t\tif (sym) {\n\t\t\tm_ir.push_back(IR(OP_RET, FETCH_VAL, sym->value_id));\n\t\t\tm_ir.back().op1_scope = sym->scope->getId();\n\t\t} else {\n\t\t\tm_ir.push_back(IR(OP_RET, FETCH_VAL, m_scope->pushConst(value)));\n\t\t\tm_ir.back().op1_scope = m_scope->getId();\n\t\t}\n\t} else {\n\t\tm_ir.push_back(IR(OP_RET));\n\t\tm_ir.back().op1_scope = m_scope->getId();\n\t}\n}\n\nvoid Compiler::importStmt(Node& package)\n{\n\tm_pkg.importPackage(m_scope, package.data.str);\n}\n\nvoid Compiler::importStmt(Node& package, Node& module)\n{\n\tm_pkg.importModule(m_scope, package.data.str, module.data.str);\n}\n\nvoid Compiler::whileLoop(Node& cond, const location& loc)\n{\n\tSymbol* sym = NULL;\n\tValue* val = getValue(cond, &sym, loc);\n\n\tm_jmps.push(std::vector<size_t>());\n\tm_jmps.top().push_back(m_ir.size());\n\n\tif (sym) {\n\t\tm_ir.push_back(IR(OP_JMPZ, FETCH_VAL, sym->value_id, JMP_ADDR, 0));\n\t\tm_ir.back().op1_scope = sym->scope->getId();\n\t} else {\n\t\tm_ir.push_back(IR(OP_JMPZ, FETCH_VAL, m_scope->pushConst(val), JMP_ADDR, 0));\n\t\tm_ir.back().op1_scope = m_scope->getId();\n\t}\n}\n\n\/\/\/ Handles end of while loop\nvoid Compiler::endWhileLoop()\n{\n\t\/\/ Adds a JMP to the loop condition\n\tm_ir.push_back(IR(OP_JMP, JMP_ADDR, m_jmps.top().at(0)));\n\n\t\/\/ Sets the jmp address of JMPZ instructon related to the loop condition\n\tm_ir[m_jmps.top().at(0)].op2 = m_ir.size();\n}\n\n\/\/\/ Creates a new lexical scope\nvoid Compiler::newScope()\n{\n\tm_scope = m_scope->newLexicalScope();\n\tm_scope->setId(m_scope_id);\n\n\tm_scope_pool[m_scope_id++] = m_scope;\n}\n\n\/\/\/ Scope end marker to switch to parent scope\nvoid Compiler::endScope()\n{\n\tm_scope = m_scope->getParent();\n}\n\n} \/\/ clever\n<commit_msg>- Fixed typo on Compiler::assignment()<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#include \"compiler\/cstring.h\"\n#include \"compiler\/compiler.h\"\n#include \"compiler\/scope.h\"\n#include \"compiler\/value.h\"\n#include \"interpreter\/location.hh\"\n#include \"types\/native_types.h\"\n\nnamespace clever {\n\n\/\/ Declaration of namespace global type ptrs for Clever native types\nDECLARE_CLEVER_NATIVE_TYPES();\n\n\/\/\/ Compiler initialization phase\nvoid Compiler::init()\n{\n\tm_scope = new Scope;\n\n\tm_ir.reserve(20);\n\tm_scope_pool.reserve(10);\n\tm_type_pool.reserve(15);\n\n\tm_scope_pool[m_scope_id++] = m_scope;\n\n\t\/\/ Native type allocation\n\tm_type_pool[m_type_id++] = CLEVER_INT_TYPE    = new IntType;\n\tm_type_pool[m_type_id++] = CLEVER_DOUBLE_TYPE = new DoubleType;\n\tm_type_pool[m_type_id++] = CLEVER_STR_TYPE    = new StrType;\n\tm_type_pool[m_type_id++] = CLEVER_FUNC_TYPE   = new FuncType;\n\n\tm_pkg.init();\n}\n\n\/\/\/ Frees all resource used by the compiler\nvoid Compiler::shutdown()\n{\n\tm_pkg.shutdown();\n\n\tCLEVER_SAFE_DELETE(g_cstring_tbl);\n\tCLEVER_SAFE_DELETE(m_scope);\n\n\tTypePool::const_iterator it2 = m_type_pool.begin(),\n\t\tend2 = m_type_pool.end();\n\n\twhile (it2 != end2) {\n\t\tdelete *it2;\n\t\t++it2;\n\t}\n}\n\n\/\/ Compiler termination phase\nvoid Compiler::end()\n{\n}\n\n\/\/\/ Displays an error message and exits\nvoid Compiler::error(const char* msg) const\n{\n\tstd::cerr << \"Compile error: \" << msg << std::endl;\n\tCLEVER_EXIT_FATAL();\n}\n\n\/\/\/ Displays an error message\nvoid Compiler::error(const std::string& message, const location& loc) const\n{\n\tif (loc.begin.filename) {\n\t\tstd::cerr << \"Compile error: \" << message << \" on \"\n\t\t\t<< *loc.begin.filename << \" line \" << loc.begin.line << \"\\n\";\n\t} else {\n\t\tstd::cerr << \"Compile error: \" << message << \" on line \"\n\t\t\t<< loc.begin.line << \"\\n\";\n\t}\n\tCLEVER_EXIT_FATAL();\n}\n\n\/\/\/ Displays a formatted error message and abort the compilation\nvoid Compiler::errorf(const location& loc, const char* format, ...) const\n{\n\tstd::ostringstream out;\n\tva_list args;\n\n\tva_start(args, format);\n\n\tvsprintf(out, format, args);\n\n\tva_end(args);\n\n\terror(out.str(), loc);\n}\n\n\/\/\/ Abstracts the Value* ptr gets from Node\n\/\/ NOTE: When the Node is a STRCONST, it automatically increments the Value's\n\/\/ refcount related to the Symbol\nValue* Compiler::getValue(Node& node, Symbol** symbol, const location& loc) const\n{\n\tif (node.type == VALUE) {\n\t\treturn node.data.val;\n\t} else if (node.type == STRCONST) {\n\t\tSymbol* sym = m_scope->getAny(node.data.str);\n\n\t\tif (!sym) {\n\t\t\terrorf(loc, \"Variable `%S' cannot be found!\", node.data.str);\n\t\t}\n\t\tif (symbol) {\n\t\t\t*symbol = sym;\n\t\t}\n\n\t\treturn m_scope_pool[sym->scope->getId()]->getVar(sym->value_id);\n\t}\n\treturn NULL;\n}\n\n\/\/\/ Compiles a variable declaration\nvoid Compiler::varDeclaration(Node& var, Node* node, const location& loc)\n{\n\tSymbol* sym = m_scope->getLocal(var.data.str);\n\n\tif (sym) {\n\t\terrorf(loc, \"Variable `%S' already declared in the scope!\", var.data.str);\n\t}\n\n\tsize_t sym_id = m_scope->pushVar(var.data.str, new Value());\n\n\t\/\/ A NULL value is created for uninitialized declaration\n\tsym = NULL;\n\tValue* val = node ? getValue(*node, &sym, loc) : new Value();\n\n\t\/\/ Value to be assigned\n\tif (sym) {\n\t\tm_ir.push_back(\n\t\t\tIR(OP_ASSIGN, FETCH_VAL, sym_id, FETCH_VAL, sym->value_id));\n\n\t\tm_ir.back().op2_scope = sym->scope->getId();\n\t} else {\n\t\tm_ir.push_back(\n\t\t\tIR(OP_ASSIGN, FETCH_VAL, sym_id, FETCH_VAL, m_scope->pushConst(val)));\n\n\t\tm_ir.back().op2_scope = m_scope->getId();\n\t}\n\tm_ir.back().op1_scope = m_scope->getId();\n}\n\n\/\/\/ Compiles a variable assignment\nvoid Compiler::assignment(Node& var, Node& value, const location& loc)\n{\n\tSymbol* var_sym = NULL, *val_sym = NULL;\n\t(void)getValue(var, &var_sym, loc);\n\tValue* val = getValue(value, &val_sym, loc);\n\n\tif (val_sym) {\n\t\tm_ir.push_back(\n\t\t\tIR(OP_ASSIGN, FETCH_VAL, var_sym->value_id, FETCH_VAL, val_sym->value_id));\n\n\t\tm_ir.back().op1_scope = var_sym->scope->getId();\n\t\tm_ir.back().op2_scope = val_sym->scope->getId();\n\t} else {\n\t\tm_ir.push_back(\n\t\t\tIR(OP_ASSIGN, FETCH_VAL, var_sym->value_id, FETCH_VAL, m_scope->pushConst(val)));\n\n\t\tm_ir.back().op1_scope = var_sym->scope->getId();\n\t\tm_ir.back().op2_scope = m_scope->getId();\n\n\t}\n}\n\n\/\/\/ Compiles a set of binary operation\nvoid Compiler::binOp(Opcode op, Node& lhs, Node& rhs, Node& res,\n\tconst location& loc)\n{\/*\n\tsize_t rhs_id = 0, lhs_id = 0;\n\tValue* result = new Value();\n\n\tValue* val = getValue(lhs, &lhs_id, loc);\n\n\tif (!lhs_id) {\n\t\tlhs_id = m_value_id++;\n\t\tm_value_pool[lhs_id] = val;\n\t}\n\n\tval = getValue(rhs, &rhs_id, loc);\n\n\tif (!rhs_id) {\n\t\trhs_id = m_value_id++;\n\t\tm_value_pool[rhs_id] = val;\n\t}\n\n\tm_ir.push_back(\n\t\tIR(op, FETCH_VAL, lhs_id, FETCH_VAL, rhs_id, result));\n\n\tres.type = VALUE;\n\tres.data.val = result;*\/\n}\n\n\/\/\/ Creates a list of arguments\nArgDeclList* Compiler::newArgDeclList(const CString* arg) const\n{\n\tArgDeclList* arg_list = new ArgDeclList;\n\targ_list->push_back(arg);\n\n\treturn arg_list;\n}\n\n\/\/\/ Starts the function compilation\nvoid Compiler::funcDecl(Node& node, ArgDeclList* arg_list, const location& loc)\n{\n\tSymbol* sym = m_scope->getAny(node.data.str);\n\n\tif (sym) {\n\t\terrorf(loc, \"Name `%S' already in used!\", node.data.str);\n\t}\n\t\/\/ Saves the current instruction size to be used as a index for\n\t\/\/ changing the jmp address to right after the end of function declaration\n\tm_curr_func = m_ir.size();\n\n\tValue* func = new Value();\n\tFunction* funcdata = static_cast<Function*>(CLEVER_FUNC_TYPE->allocData());\n\n\tfunc->setType(CLEVER_FUNC_TYPE);\n\tfunc->setObj(funcdata);\n\n\tfuncdata->setName(*node.data.str);\n\tfuncdata->setUserDefined();\n\tfuncdata->setAddr(m_curr_func + 1);\n\n\tm_ir.push_back(IR(OP_JMP, JMP_ADDR, 0));\n\n\t\/\/ Adds the function symbol to the current scope\n\tm_scope->pushVar(node.data.str, func);\n\n\t\/\/ Create a scope for argument list when used\n\tif (arg_list) {\n\t\tArgDeclList::const_iterator it = arg_list->begin(),\n\t\t\tend = arg_list->end();\n\n\t\tnewScope();\n\n\t\twhile (it != end) {\n\t\t\tm_scope->pushVar(*it, new Value());\n\t\t\t++it;\n\t\t}\n\t\tdelete arg_list;\n\n\t\tfuncdata->setArgVars(m_scope);\n\t}\n\n\t\/\/ Creates a scope for the local vars\n\tnewScope();\n\n\tfuncdata->setLocalVars(m_scope);\n}\n\n\/\/\/ Adds new argument to the call argument list\nArgCallList* Compiler::addArgCall(ArgCallList* arg_list, Node& arg, const location& loc)\n{\n\tSymbol* sym = NULL;\n\tValue* val = getValue(arg, &sym, loc);\n\n\tif (!arg_list) {\n\t\targ_list = new ArgCallList;\n\t}\n\n\tif (sym) {\n\t\targ_list->push_back(std::pair<size_t, size_t>(sym->scope->getId(), sym->value_id));\n\t} else {\n\t\targ_list->push_back(std::pair<size_t, size_t>(m_scope->getId(), m_scope->pushConst(val)));\n\t}\n\n\treturn arg_list;\n}\n\n\/\/\/ Ends the current function compilation\nvoid Compiler::funcEndDecl(bool has_args)\n{\n\tm_ir.push_back(IR(OP_LEAVE));\n\t\/\/ Changes the JMP's addr created right before the func declaration\n\t\/\/ to point to the end of current function, thus skipping its opcodes\n\tm_ir[m_curr_func].op1 = m_ir.size();\n\n\t\/\/ Switchs to the global scope again\n\tif (has_args) {\n\t\tendScope();\n\t}\n\tendScope();\n}\n\n\/\/\/ Function call compilation\nvoid Compiler::funcCall(Node& name, ArgCallList* arg_list, Node& res,\n\tconst location& loc)\n{\n\tSymbol* sym = m_scope->getAny(name.data.str);\n\n\tif (!sym) {\n\t\terrorf(loc, \"Function `%S' cannot be found!\", name.data.str);\n\t}\n\n\tValue* result = new Value();\n\n\tif (arg_list) {\n\t\tfor (size_t i = 0, j = arg_list->size(); i < j; ++i) {\n\t\t\tm_ir.push_back(IR(OP_SEND_VAL, FETCH_VAL, arg_list->at(i).second));\n\n\t\t\tm_ir.back().op1_scope = arg_list->at(i).first;\n\t\t}\n\t}\n\n\tres.type = VALUE;\n\tres.data.val = result;\n\n\tm_ir.push_back(\n\t\tIR(OP_FCALL, FETCH_VAL, sym->value_id, result));\n\n\tm_ir.back().op1_scope = sym->scope->getId();\n\n\tif (arg_list) {\n\t\tdelete arg_list;\n\t}\n}\n\n\/\/\/ Compiles a return statement\nvoid Compiler::retStmt(Node* expr, const location& loc)\n{\n\tif (expr) {\n\t\tSymbol* sym = NULL;\n\t\tValue* value = getValue(*expr, &sym, loc);\n\n\t\tif (sym) {\n\t\t\tm_ir.push_back(IR(OP_RET, FETCH_VAL, sym->value_id));\n\t\t\tm_ir.back().op1_scope = sym->scope->getId();\n\t\t} else {\n\t\t\tm_ir.push_back(IR(OP_RET, FETCH_VAL, m_scope->pushConst(value)));\n\t\t\tm_ir.back().op1_scope = m_scope->getId();\n\t\t}\n\t} else {\n\t\tm_ir.push_back(IR(OP_RET));\n\t\tm_ir.back().op1_scope = m_scope->getId();\n\t}\n}\n\nvoid Compiler::importStmt(Node& package)\n{\n\tm_pkg.importPackage(m_scope, package.data.str);\n}\n\nvoid Compiler::importStmt(Node& package, Node& module)\n{\n\tm_pkg.importModule(m_scope, package.data.str, module.data.str);\n}\n\nvoid Compiler::whileLoop(Node& cond, const location& loc)\n{\n\tSymbol* sym = NULL;\n\tValue* val = getValue(cond, &sym, loc);\n\n\tm_jmps.push(std::vector<size_t>());\n\tm_jmps.top().push_back(m_ir.size());\n\n\tif (sym) {\n\t\tm_ir.push_back(IR(OP_JMPZ, FETCH_VAL, sym->value_id, JMP_ADDR, 0));\n\t\tm_ir.back().op1_scope = sym->scope->getId();\n\t} else {\n\t\tm_ir.push_back(IR(OP_JMPZ, FETCH_VAL, m_scope->pushConst(val), JMP_ADDR, 0));\n\t\tm_ir.back().op1_scope = m_scope->getId();\n\t}\n}\n\n\/\/\/ Handles end of while loop\nvoid Compiler::endWhileLoop()\n{\n\t\/\/ Adds a JMP to the loop condition\n\tm_ir.push_back(IR(OP_JMP, JMP_ADDR, m_jmps.top().at(0)));\n\n\t\/\/ Sets the jmp address of JMPZ instructon related to the loop condition\n\tm_ir[m_jmps.top().at(0)].op2 = m_ir.size();\n}\n\n\/\/\/ Creates a new lexical scope\nvoid Compiler::newScope()\n{\n\tm_scope = m_scope->newLexicalScope();\n\tm_scope->setId(m_scope_id);\n\n\tm_scope_pool[m_scope_id++] = m_scope;\n}\n\n\/\/\/ Scope end marker to switch to parent scope\nvoid Compiler::endScope()\n{\n\tm_scope = m_scope->getParent();\n}\n\n} \/\/ clever\n<|endoftext|>"}
{"text":"<commit_before>\n#ifdef __APPLE__\n\t#include <Glut\/glut.h>\n#else\n    \/\/#define FREEGLUT_STATIC\n    #include <GL\/glut.h>\n#endif\n\n#include <cstdlib>\n#include \"HillsModel.h\"\n\nHillsModel::HillsModel(void)\n{\n}\n\nvoid HillsModel::render() {\n    glPushMatrix();\n\n\t\tglPushMatrix();\n\t\t\tglColor3f(1.0f,1.0f,1.0f);\n\t\t\tglScalef(0.2f, 0.3f, 0.3f);\n\t\t\tdrawPeak();\n\t\tglPopMatrix();\n\n\n\t\tglPushMatrix();\n\t\t\tglColor3f(0.6f,0.6f,0.6f);\n\t\t\tglTranslatef(0.5f,0.0f,0.0f);\n\t\t\tglScalef(0.5f, 0.8f, 0.5f);\n\t\t\tdrawPeak();\n\t\tglPopMatrix();\n\n\t\tglPushMatrix();\n\t\t\tglColor3f(1.0f,1.0f,1.0f);\n\t\t\tglTranslatef(0.5f,0.0f,0.7f);\n\t\t\tglScalef(0.5f, 0.5f, 0.3f);\n\t\t\tdrawPeak();\n\t\tglPopMatrix();\n\n\t\tglPushMatrix();\n\t\t\tglColor3f(0.6f,0.6f,0.6f);\n\t\t\tglTranslatef(0.0f,0.0f,0.5f);\n\t\t\tglScalef(0.2f, 0.8f, 0.5f);\n\t\t\tdrawPeak();\n\t\tglPopMatrix();\n\n\t\tglPushMatrix();\n\t\t\tglColor3f(1.0f,1.0f,1.0f);\n\t\t\tglTranslatef(0.2f,0.0f,0.2f);\n\t\t\tglScalef(0.5f, 1.0f, 0.5f);\n\t\t\tdrawPeak();\n\t\tglPopMatrix();\n\n\t\tglPushMatrix();\n\t\t\tglColor3f(0.8f,0.8f,0.8f);\n\t\t\tglTranslatef(0.0f,0.0f,0.3f);\n\t\t\tglScalef(0.2f, 0.4f, 0.3f);\n\t\t\tdrawPeak();\n\t\tglPopMatrix();\n\n\t\tglPushMatrix();\n\t\t\tglColor3f(0.8f,0.8f,0.8f);\n\t\t\tglTranslatef(0.2f,0.0f,0.7f);\n\t\t\tglScalef(0.3f, 0.3f, 0.3f);\n\t\t\tdrawPeak();\n\t\tglPopMatrix();\n\n\t\tglPushMatrix();\n\t\t\tglColor3f(0.8f,0.8f,0.8f);\n\t\t\tglTranslatef(0.2f,0.0f,0.0f);\n\t\t\tglScalef(0.3f, 0.6f, 0.3f);\n\t\t\tdrawPeak();\n\t\tglPopMatrix();\n\n\t\tglPushMatrix();\n\t\t\tglColor3f(0.8f,0.8f,0.8f);\n\t\t\tglTranslatef(0.7f,0.0f,0.5f);\n\t\t\tglScalef(0.3f, 0.4f, 0.3f);\n\t\t\tdrawPeak();\n\t\tglPopMatrix();\n      \n    glPopMatrix();\n}\n\nvoid HillsModel::drawPeak() {\n    glBegin(GL_TRIANGLES);\n        glVertex3f(0.0f, 0.0f, 0.0f);\n        glVertex3f(1.0f, 0.0f, 0.0f);\n        glVertex3f(0.5f, 1, 0.5f);\n        \n        glVertex3f(1.0f, 0.0f, 0.0f);\n        glVertex3f(1.0f, 0.0f, 1.0f);\n        glVertex3f(0.5f, 1.0f, 0.5f);\n        \n        glVertex3f(1.0f, 0.0f, 1.0f);\n        glVertex3f(0.0f, 0.0f, 1.0f);\n        glVertex3f(0.5f, 1.0f, 0.5f);\n        \n        glVertex3f(0.0f, 0.0f, 1.0f);\n        glVertex3f(0.0f, 0.0f, 0.0f);\n        glVertex3f(0.5f, 1.0f, 0.5f);        \n    glEnd();\n}\n<commit_msg>Removed commented include<commit_after>\n#ifdef __APPLE__\n\t#include <Glut\/glut.h>\n#else\n    #define FREEGLUT_STATIC\n    #include <GL\/glut.h>\n#endif\n\n#include <cstdlib>\n#include \"HillsModel.h\"\n\nHillsModel::HillsModel(void)\n{\n}\n\nvoid HillsModel::render() {\n    glPushMatrix();\n\n\t\tglPushMatrix();\n\t\t\tglColor3f(1.0f,1.0f,1.0f);\n\t\t\tglScalef(0.2f, 0.3f, 0.3f);\n\t\t\tdrawPeak();\n\t\tglPopMatrix();\n\n\n\t\tglPushMatrix();\n\t\t\tglColor3f(0.6f,0.6f,0.6f);\n\t\t\tglTranslatef(0.5f,0.0f,0.0f);\n\t\t\tglScalef(0.5f, 0.8f, 0.5f);\n\t\t\tdrawPeak();\n\t\tglPopMatrix();\n\n\t\tglPushMatrix();\n\t\t\tglColor3f(1.0f,1.0f,1.0f);\n\t\t\tglTranslatef(0.5f,0.0f,0.7f);\n\t\t\tglScalef(0.5f, 0.5f, 0.3f);\n\t\t\tdrawPeak();\n\t\tglPopMatrix();\n\n\t\tglPushMatrix();\n\t\t\tglColor3f(0.6f,0.6f,0.6f);\n\t\t\tglTranslatef(0.0f,0.0f,0.5f);\n\t\t\tglScalef(0.2f, 0.8f, 0.5f);\n\t\t\tdrawPeak();\n\t\tglPopMatrix();\n\n\t\tglPushMatrix();\n\t\t\tglColor3f(1.0f,1.0f,1.0f);\n\t\t\tglTranslatef(0.2f,0.0f,0.2f);\n\t\t\tglScalef(0.5f, 1.0f, 0.5f);\n\t\t\tdrawPeak();\n\t\tglPopMatrix();\n\n\t\tglPushMatrix();\n\t\t\tglColor3f(0.8f,0.8f,0.8f);\n\t\t\tglTranslatef(0.0f,0.0f,0.3f);\n\t\t\tglScalef(0.2f, 0.4f, 0.3f);\n\t\t\tdrawPeak();\n\t\tglPopMatrix();\n\n\t\tglPushMatrix();\n\t\t\tglColor3f(0.8f,0.8f,0.8f);\n\t\t\tglTranslatef(0.2f,0.0f,0.7f);\n\t\t\tglScalef(0.3f, 0.3f, 0.3f);\n\t\t\tdrawPeak();\n\t\tglPopMatrix();\n\n\t\tglPushMatrix();\n\t\t\tglColor3f(0.8f,0.8f,0.8f);\n\t\t\tglTranslatef(0.2f,0.0f,0.0f);\n\t\t\tglScalef(0.3f, 0.6f, 0.3f);\n\t\t\tdrawPeak();\n\t\tglPopMatrix();\n\n\t\tglPushMatrix();\n\t\t\tglColor3f(0.8f,0.8f,0.8f);\n\t\t\tglTranslatef(0.7f,0.0f,0.5f);\n\t\t\tglScalef(0.3f, 0.4f, 0.3f);\n\t\t\tdrawPeak();\n\t\tglPopMatrix();\n      \n    glPopMatrix();\n}\n\nvoid HillsModel::drawPeak() {\n    glBegin(GL_TRIANGLES);\n        glVertex3f(0.0f, 0.0f, 0.0f);\n        glVertex3f(1.0f, 0.0f, 0.0f);\n        glVertex3f(0.5f, 1, 0.5f);\n        \n        glVertex3f(1.0f, 0.0f, 0.0f);\n        glVertex3f(1.0f, 0.0f, 1.0f);\n        glVertex3f(0.5f, 1.0f, 0.5f);\n        \n        glVertex3f(1.0f, 0.0f, 1.0f);\n        glVertex3f(0.0f, 0.0f, 1.0f);\n        glVertex3f(0.5f, 1.0f, 0.5f);\n        \n        glVertex3f(0.0f, 0.0f, 1.0f);\n        glVertex3f(0.0f, 0.0f, 0.0f);\n        glVertex3f(0.5f, 1.0f, 0.5f);        \n    glEnd();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2019 The Android Open Source Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <filaflat\/ChunkContainer.h>\n\n#include <filament\/MaterialEnums.h>\n\n#include <backend\/DriverEnums.h>\n\n#include <matdbg\/TextWriter.h>\n#include <matdbg\/ShaderInfo.h>\n\n#include <sstream>\n#include <iomanip>\n\n#include \"CommonWriter.h\"\n\nusing namespace filament;\nusing namespace backend;\nusing namespace filaflat;\nusing namespace filamat;\nusing namespace std;\nusing namespace utils;\n\nnamespace filament {\nnamespace matdbg {\n\nstatic const int alignment = 24;\n\nstatic string arraySizeToString(uint64_t size) {\n    if (size > 1) {\n        string s = \"[\";\n        s += size;\n        s += \"]\";\n        return s;\n    }\n    return \"\";\n}\n\ntemplate<typename T, typename V>\nstatic void printChunk(ostream& text, const ChunkContainer& container, ChunkType type,\n        const char* title) {\n    T value;\n    if (read(container, type, reinterpret_cast<V*>(&value))) {\n        text << \"    \" << setw(alignment) << left << title;\n        text << toString(value) << endl;\n    }\n}\n\nstatic void printFloatChunk(ostream& text, const ChunkContainer& container, ChunkType type,\n        const char* title) {\n    float value;\n    if (read(container, type, &value)) {\n        text << \"    \" << setw(alignment) << left << title;\n        text << setprecision(2) << value << endl;\n    }\n}\n\nstatic void printUint32Chunk(ostream& text, const ChunkContainer& container,\n        ChunkType type, const char* title) {\n    uint32_t value;\n    if (read(container, type, &value)) {\n        text << \"\\\"\" << title << \"\\\": \" << value << \",\\n\";\n    }\n}\n\nstatic void printStringChunk(ostream& text, const ChunkContainer& container,\n        ChunkType type, const char* title) {\n    CString value;\n    if (read(container, type, &value)) {\n        text << \"\\\"\" << title << \"\\\": \\\"\" << value.c_str() << \"\\\",\\n\";\n    }\n}\n\nstatic bool printMaterial(ostream& text, const ChunkContainer& container) {\n    text << \"Material:\" << endl;\n\n    uint32_t version;\n    if (read(container, MaterialVersion, &version)) {\n        text << \"    \" << setw(alignment) << left << \"Version: \";\n        text << version << endl;\n    }\n\n    CString name;\n    if (read(container, MaterialName, &name)) {\n        text << \"    \" << setw(alignment) << left << \"Name: \";\n        text << name.c_str() << endl;\n    }\n\n    text << endl;\n\n    text << \"Shading:\" << endl;\n    printChunk<Shading, uint8_t>(text, container, MaterialShading, \"Model: \");\n    printChunk<VertexDomain, uint8_t>(text, container, MaterialVertexDomain, \"Vertex domain: \");\n    printChunk<Interpolation, uint8_t>(text, container, MaterialInterpolation, \"Interpolation: \");\n    printChunk<bool, bool>(text, container, MaterialShadowMultiplier, \"Shadow multiply: \");\n    printChunk<bool, bool>(text, container, MaterialSpecularAntiAliasing, \"Specular anti-aliasing: \");\n    printFloatChunk(text, container, MaterialSpecularAntiAliasingVariance, \"    Variance: \");\n    printFloatChunk(text, container, MaterialSpecularAntiAliasingThreshold, \"    Threshold: \");\n    printChunk<bool, bool>(text, container, MaterialClearCoatIorChange, \"Clear coat IOR change: \");\n\n    text << endl;\n\n    text << \"Raster state:\" << endl;\n    printChunk<BlendingMode, uint8_t>(text, container, MaterialBlendingMode, \"Blending: \");\n    printFloatChunk(text, container, MaterialMaskThreshold, \"Mask threshold: \");\n    printChunk<bool, bool>(text, container, MaterialColorWrite, \"Color write: \");\n    printChunk<bool, bool>(text, container, MaterialDepthWrite, \"Depth write: \");\n    printChunk<bool, bool>(text, container, MaterialDepthTest, \"Depth test: \");\n    printChunk<bool, bool>(text, container, MaterialDoubleSided, \"Double sided: \");\n    printChunk<CullingMode, uint8_t>(text, container, MaterialCullingMode, \"Culling: \");\n    printChunk<TransparencyMode, uint8_t>(text, container, MaterialTransparencyMode, \"Transparency: \");\n\n    text << endl;\n\n    uint32_t requiredAttributes;\n    if (read(container, MaterialRequiredAttributes, &requiredAttributes)) {\n        AttributeBitset bitset;\n        bitset.setValue(requiredAttributes);\n\n        if (bitset.count() > 0) {\n            text << \"Required attributes:\" << endl;\n            for (size_t i = 0; i < bitset.size(); i++) {\n                if (bitset.test(i)) {\n                    text << \"    \" << toString(static_cast<VertexAttribute>(i)) << endl;\n                }\n            }\n            text << endl;\n        }\n    }\n\n    return true;\n}\n\nstatic bool printParametersInfo(ostream& text, const ChunkContainer& container) {\n    if (!container.hasChunk(ChunkType::MaterialUib)) {\n        return true;\n    }\n\n    Unflattener uib(\n            container.getChunkStart(ChunkType::MaterialUib),\n            container.getChunkEnd(ChunkType::MaterialUib));\n\n    CString name;\n    if (!uib.read(&name)) {\n        return false;\n    }\n\n    uint64_t uibCount;\n    if (!uib.read(&uibCount)) {\n        return false;\n    }\n\n    Unflattener sib(\n            container.getChunkStart(ChunkType::MaterialSib),\n            container.getChunkEnd(ChunkType::MaterialSib));\n\n    if (!sib.read(&name)) {\n        return false;\n    }\n\n    uint64_t sibCount;\n    if (!sib.read(&sibCount)) {\n        return false;\n    }\n\n    if (uibCount == 0 && sibCount == 0) {\n        return true;\n    }\n\n    text << \"Parameters:\" << endl;\n\n    for (uint64_t i = 0; i < uibCount; i++) {\n        CString fieldName;\n        uint64_t fieldSize;\n        uint8_t fieldType;\n        uint8_t fieldPrecision;\n\n        if (!uib.read(&fieldName)) {\n            return false;\n        }\n\n        if (!uib.read(&fieldSize)) {\n            return false;\n        }\n\n        if (!uib.read(&fieldType)) {\n            return false;\n        }\n\n        if (!uib.read(&fieldPrecision)) {\n            return false;\n        }\n\n        text << \"    \"\n                  << setw(alignment) << fieldName.c_str()\n                  << setw(alignment) << toString(UniformType(fieldType))\n                  << arraySizeToString(fieldSize)\n                  << setw(10) << toString(Precision(fieldPrecision))\n                  << endl;\n    }\n\n    for (uint64_t i = 0; i < sibCount; i++) {\n        CString fieldName;\n        uint8_t fieldType;\n        uint8_t fieldFormat;\n        uint8_t fieldPrecision;\n        bool fieldMultisample;\n\n        if (!sib.read(&fieldName)) {\n            return false;\n        }\n\n        if (!sib.read(&fieldType)) {\n            return false;\n        }\n\n        if (!sib.read(&fieldFormat))\n            return false;\n\n        if (!sib.read(&fieldPrecision)) {\n            return false;\n        }\n\n        if (!sib.read(&fieldMultisample)) {\n            return false;\n        }\n\n        text << \"    \"\n                << setw(alignment) << fieldName.c_str()\n                << setw(alignment) << toString(SamplerType(fieldType))\n                << setw(10) << toString(Precision(fieldPrecision))\n                << toString(SamplerFormat(fieldFormat))\n                << endl;\n    }\n\n    text << endl;\n\n    return true;\n}\n\n\/\/ Unpack a 64 bit integer into a string\ninline utils::CString typeToString(uint64_t v) {\n    uint8_t* raw = (uint8_t*) &v;\n    char str[9];\n    for (size_t i = 0; i < 8; i++) {\n        str[7 - i] = raw[i];\n    }\n    str[8] = '\\0';\n    return utils::CString(str, strnlen(str, 8));\n}\n\nstatic void printChunks(ostream& text, const ChunkContainer& container) {\n    text << \"Chunks:\" << endl;\n\n    text << \"    \" << setw(9) << left << \"Name \";\n    text << setw(7) << right << \"Size\" << endl;\n\n    size_t count = container.getChunkCount();\n    for (size_t i = 0; i < count; i++) {\n        auto chunk = container.getChunk(i);\n        text << \"    \" << typeToString(chunk.type).c_str() << \" \";\n        text << setw(7) << right << chunk.desc.size << endl;\n    }\n}\n\nstatic void printShaderInfo(ostream& text, const vector<ShaderInfo>& info) {\n    for (uint64_t i = 0; i < info.size(); ++i) {\n        const auto& item = info[i];\n        text << \"    #\";\n        text << setw(4) << left << i;\n        text << setw(6) << left << toString(item.shaderModel);\n        text << \" \";\n        text << setw(2) << left << toString(item.pipelineStage);\n        text << \" \";\n        text << \"0x\" << hex << setfill('0') << setw(2)\n             << right << (int) item.variant;\n        text << setfill(' ') << dec << endl;\n    }\n    text << endl;\n}\n\nstatic bool printGlslInfo(ostream& text, const ChunkContainer& container) {\n    vector<ShaderInfo> info;\n    info.resize(getShaderCount(container, ChunkType::MaterialGlsl));\n    if (!getGlShaderInfo(container, info.data())) {\n        return false;\n    }\n    text << \"GLSL shaders:\" << endl;\n    printShaderInfo(text, info);\n    return true;\n}\n\nstatic bool printVkInfo(ostream& text, const ChunkContainer& container) {\n    vector<ShaderInfo> info;\n    info.resize(getShaderCount(container, ChunkType::MaterialSpirv));\n    if (!getVkShaderInfo(container, info.data())) {\n        return false;\n    }\n    text << \"Vulkan shaders:\" << endl;\n    printShaderInfo(text, info);\n    return true;\n}\n\nstatic bool printMetalInfo(ostream& text, const ChunkContainer& container) {\n    vector<ShaderInfo> info;\n    info.resize(getShaderCount(container, ChunkType::MaterialMetal));\n    if (!getMetalShaderInfo(container, info.data())) {\n        return false;\n    }\n    text << \"Metal shaders:\" << endl;\n    printShaderInfo(text, info);\n    return true;\n}\n\nbool TextWriter::writeMaterialInfo(const filaflat::ChunkContainer& container) {\n    ostringstream text;\n    if (!printMaterial(text, container)) {\n        return false;\n    }\n    if (!printParametersInfo(text, container)) {\n        return false;\n    }\n    if (!printGlslInfo(text, container)) {\n        return false;\n    }\n    if (!printVkInfo(text, container)) {\n        return false;\n    }\n    if (!printMetalInfo(text, container)) {\n        return false;\n    }\n\n    printChunks(text, container);\n\n    text << endl;\n\n    mTextString = CString(text.str().c_str());\n    return true;\n}\n\nconst char* TextWriter::getString() const {\n    return mTextString.c_str();\n}\n\nsize_t TextWriter::getSize() const {\n    return mTextString.size();\n}\n\n} \/\/ namespace matdbg\n} \/\/ namespace filament\n<commit_msg>Improve matinfo output<commit_after>\/*\n * Copyright (C) 2019 The Android Open Source Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <filaflat\/ChunkContainer.h>\n\n#include <filament\/MaterialEnums.h>\n\n#include <backend\/DriverEnums.h>\n\n#include <matdbg\/TextWriter.h>\n#include <matdbg\/ShaderInfo.h>\n\n#include <sstream>\n#include <iomanip>\n\n#include \"CommonWriter.h\"\n\nusing namespace filament;\nusing namespace backend;\nusing namespace filaflat;\nusing namespace filamat;\nusing namespace std;\nusing namespace utils;\n\nnamespace filament {\nnamespace matdbg {\n\nconstexpr int alignment = 32;\nconstexpr int shortAlignment = 12;\n\nstatic string arraySizeToString(uint64_t size) {\n    if (size > 1) {\n        string s = \"[\";\n        s += size;\n        s += \"]\";\n        return s;\n    }\n    return \"\";\n}\n\ntemplate<typename T, typename V>\nstatic void printChunk(ostream& text, const ChunkContainer& container, ChunkType type,\n        const char* title) {\n    T value;\n    if (read(container, type, reinterpret_cast<V*>(&value))) {\n        text << \"    \" << setw(alignment) << left << title;\n        text << toString(value) << endl;\n    }\n}\n\nstatic void printFloatChunk(ostream& text, const ChunkContainer& container, ChunkType type,\n        const char* title) {\n    float value;\n    if (read(container, type, &value)) {\n        text << \"    \" << setw(alignment) << left << title;\n        text << setprecision(2) << value << endl;\n    }\n}\n\nstatic void printUint32Chunk(ostream& text, const ChunkContainer& container,\n        ChunkType type, const char* title) {\n    uint32_t value;\n    if (read(container, type, &value)) {\n        text << \"\\\"\" << title << \"\\\": \" << value << \",\\n\";\n    }\n}\n\nstatic void printStringChunk(ostream& text, const ChunkContainer& container,\n        ChunkType type, const char* title) {\n    CString value;\n    if (read(container, type, &value)) {\n        text << \"\\\"\" << title << \"\\\": \\\"\" << value.c_str() << \"\\\",\\n\";\n    }\n}\n\nstatic bool printMaterial(ostream& text, const ChunkContainer& container) {\n    text << \"Material:\" << endl;\n\n    uint32_t version;\n    if (read(container, MaterialVersion, &version)) {\n        text << \"    \" << setw(alignment) << left << \"Version: \";\n        text << version << endl;\n    }\n\n    CString name;\n    if (read(container, MaterialName, &name)) {\n        text << \"    \" << setw(alignment) << left << \"Name: \";\n        text << name.c_str() << endl;\n    }\n\n    text << endl;\n\n    text << \"Shading:\" << endl;\n    printChunk<Shading, uint8_t>(text, container, MaterialShading, \"Model: \");\n    printChunk<VertexDomain, uint8_t>(text, container, MaterialVertexDomain, \"Vertex domain: \");\n    printChunk<Interpolation, uint8_t>(text, container, MaterialInterpolation, \"Interpolation: \");\n    printChunk<bool, bool>(text, container, MaterialShadowMultiplier, \"Shadow multiply: \");\n    printChunk<bool, bool>(text, container, MaterialSpecularAntiAliasing, \"Specular anti-aliasing: \");\n    printFloatChunk(text, container, MaterialSpecularAntiAliasingVariance, \"    Variance: \");\n    printFloatChunk(text, container, MaterialSpecularAntiAliasingThreshold, \"    Threshold: \");\n    printChunk<bool, bool>(text, container, MaterialClearCoatIorChange, \"Clear coat IOR change: \");\n\n    text << endl;\n\n    text << \"Raster state:\" << endl;\n    printChunk<BlendingMode, uint8_t>(text, container, MaterialBlendingMode, \"Blending: \");\n    printFloatChunk(text, container, MaterialMaskThreshold, \"Mask threshold: \");\n    printChunk<bool, bool>(text, container, MaterialColorWrite, \"Color write: \");\n    printChunk<bool, bool>(text, container, MaterialDepthWrite, \"Depth write: \");\n    printChunk<bool, bool>(text, container, MaterialDepthTest, \"Depth test: \");\n    printChunk<bool, bool>(text, container, MaterialDoubleSided, \"Double sided: \");\n    printChunk<CullingMode, uint8_t>(text, container, MaterialCullingMode, \"Culling: \");\n    printChunk<TransparencyMode, uint8_t>(text, container, MaterialTransparencyMode, \"Transparency: \");\n\n    text << endl;\n\n    uint32_t requiredAttributes;\n    if (read(container, MaterialRequiredAttributes, &requiredAttributes)) {\n        AttributeBitset bitset;\n        bitset.setValue(requiredAttributes);\n\n        if (bitset.count() > 0) {\n            text << \"Required attributes:\" << endl;\n            for (size_t i = 0; i < bitset.size(); i++) {\n                if (bitset.test(i)) {\n                    text << \"    \" << toString(static_cast<VertexAttribute>(i)) << endl;\n                }\n            }\n            text << endl;\n        }\n    }\n\n    return true;\n}\n\nstatic bool printParametersInfo(ostream& text, const ChunkContainer& container) {\n    if (!container.hasChunk(ChunkType::MaterialUib)) {\n        return true;\n    }\n\n    Unflattener uib(\n            container.getChunkStart(ChunkType::MaterialUib),\n            container.getChunkEnd(ChunkType::MaterialUib));\n\n    CString name;\n    if (!uib.read(&name)) {\n        return false;\n    }\n\n    uint64_t uibCount;\n    if (!uib.read(&uibCount)) {\n        return false;\n    }\n\n    Unflattener sib(\n            container.getChunkStart(ChunkType::MaterialSib),\n            container.getChunkEnd(ChunkType::MaterialSib));\n\n    if (!sib.read(&name)) {\n        return false;\n    }\n\n    uint64_t sibCount;\n    if (!sib.read(&sibCount)) {\n        return false;\n    }\n\n    if (uibCount == 0 && sibCount == 0) {\n        return true;\n    }\n\n    text << \"Parameters:\" << endl;\n\n    for (uint64_t i = 0; i < uibCount; i++) {\n        CString fieldName;\n        uint64_t fieldSize;\n        uint8_t fieldType;\n        uint8_t fieldPrecision;\n\n        if (!uib.read(&fieldName)) {\n            return false;\n        }\n\n        if (!uib.read(&fieldSize)) {\n            return false;\n        }\n\n        if (!uib.read(&fieldType)) {\n            return false;\n        }\n\n        if (!uib.read(&fieldPrecision)) {\n            return false;\n        }\n\n        text << \"    \"\n                  << setw(alignment) << fieldName.c_str()\n                  << setw(shortAlignment) << toString(UniformType(fieldType))\n                  << arraySizeToString(fieldSize)\n                  << setw(shortAlignment) << toString(Precision(fieldPrecision))\n                  << endl;\n    }\n\n    for (uint64_t i = 0; i < sibCount; i++) {\n        CString fieldName;\n        uint8_t fieldType;\n        uint8_t fieldFormat;\n        uint8_t fieldPrecision;\n        bool fieldMultisample;\n\n        if (!sib.read(&fieldName)) {\n            return false;\n        }\n\n        if (!sib.read(&fieldType)) {\n            return false;\n        }\n\n        if (!sib.read(&fieldFormat))\n            return false;\n\n        if (!sib.read(&fieldPrecision)) {\n            return false;\n        }\n\n        if (!sib.read(&fieldMultisample)) {\n            return false;\n        }\n\n        text << \"    \"\n                << setw(alignment) << fieldName.c_str()\n                << setw(shortAlignment) << toString(SamplerType(fieldType))\n                << setw(shortAlignment) << toString(Precision(fieldPrecision))\n                << toString(SamplerFormat(fieldFormat))\n                << endl;\n    }\n\n    text << endl;\n\n    return true;\n}\n\n\/\/ Unpack a 64 bit integer into a string\ninline utils::CString typeToString(uint64_t v) {\n    uint8_t* raw = (uint8_t*) &v;\n    char str[9];\n    for (size_t i = 0; i < 8; i++) {\n        str[7 - i] = raw[i];\n    }\n    str[8] = '\\0';\n    return utils::CString(str, strnlen(str, 8));\n}\n\nstatic void printChunks(ostream& text, const ChunkContainer& container) {\n    text << \"Chunks:\" << endl;\n\n    text << \"    \" << setw(9) << left << \"Name \";\n    text << setw(7) << right << \"Size\" << endl;\n\n    size_t count = container.getChunkCount();\n    for (size_t i = 0; i < count; i++) {\n        auto chunk = container.getChunk(i);\n        text << \"    \" << typeToString(chunk.type).c_str() << \" \";\n        text << setw(7) << right << chunk.desc.size << endl;\n    }\n}\n\nstatic void printShaderInfo(ostream& text, const vector<ShaderInfo>& info) {\n    for (uint64_t i = 0; i < info.size(); ++i) {\n        const auto& item = info[i];\n        text << \"    #\";\n        text << setw(4) << left << i;\n        text << setw(6) << left << toString(item.shaderModel);\n        text << \" \";\n        text << setw(2) << left << toString(item.pipelineStage);\n        text << \" \";\n        text << \"0x\" << hex << setfill('0') << setw(2)\n             << right << (int) item.variant;\n        text << setfill(' ') << dec << endl;\n    }\n    text << endl;\n}\n\nstatic bool printGlslInfo(ostream& text, const ChunkContainer& container) {\n    vector<ShaderInfo> info;\n    info.resize(getShaderCount(container, ChunkType::MaterialGlsl));\n    if (!getGlShaderInfo(container, info.data())) {\n        return false;\n    }\n    text << \"GLSL shaders:\" << endl;\n    printShaderInfo(text, info);\n    return true;\n}\n\nstatic bool printVkInfo(ostream& text, const ChunkContainer& container) {\n    vector<ShaderInfo> info;\n    info.resize(getShaderCount(container, ChunkType::MaterialSpirv));\n    if (!getVkShaderInfo(container, info.data())) {\n        return false;\n    }\n    text << \"Vulkan shaders:\" << endl;\n    printShaderInfo(text, info);\n    return true;\n}\n\nstatic bool printMetalInfo(ostream& text, const ChunkContainer& container) {\n    vector<ShaderInfo> info;\n    info.resize(getShaderCount(container, ChunkType::MaterialMetal));\n    if (!getMetalShaderInfo(container, info.data())) {\n        return false;\n    }\n    text << \"Metal shaders:\" << endl;\n    printShaderInfo(text, info);\n    return true;\n}\n\nbool TextWriter::writeMaterialInfo(const filaflat::ChunkContainer& container) {\n    ostringstream text;\n    if (!printMaterial(text, container)) {\n        return false;\n    }\n    if (!printParametersInfo(text, container)) {\n        return false;\n    }\n    if (!printGlslInfo(text, container)) {\n        return false;\n    }\n    if (!printVkInfo(text, container)) {\n        return false;\n    }\n    if (!printMetalInfo(text, container)) {\n        return false;\n    }\n\n    printChunks(text, container);\n\n    text << endl;\n\n    mTextString = CString(text.str().c_str());\n    return true;\n}\n\nconst char* TextWriter::getString() const {\n    return mTextString.c_str();\n}\n\nsize_t TextWriter::getSize() const {\n    return mTextString.size();\n}\n\n} \/\/ namespace matdbg\n} \/\/ namespace filament\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\n#if defined(__ANDROID__)\n\n#include <aaudio\/AAudio.h>\n#include \"AAudioHostThread.h\"\n\nvoid AAudioHostThread::callHostThread() {\n    \/\/printf(\"%s() enter >>>>>>>>> mDone = %d\\n\", __func__, mDone);\n    \/\/ The callback returns AAUDIO_CALLBACK_RESULT_CONTINUE instead\n    \/\/ of AAUDIO_CALLBACK_RESULT_STOP because a race condition\n    \/\/ was causing a hang. So we may get called more than once.\n    \/\/ So check mDone to prevent mProcedure from running more than once.\n    if (!mDone) {\n        std::lock_guard<std::mutex> lock(mDoneLock);\n        (*mProcedure)(mArgument); \/\/ This should take a long time.\n        mDone = true; \/\/ Let join() know we are done.\n    }\n    \/\/printf(\"%s() exit <<<<<<<<<<\", __func__);\n}\n\nstatic aaudio_data_callback_result_t sm_aaudio_data_callback(\n        AAudioStream *stream __unused,\n        void *userData,\n        void *audioData __unused,\n        int32_t numFrames __unused) {\n    AAudioHostThread *hostThread = (AAudioHostThread *) userData;\n    hostThread->callHostThread();\n    \/\/ Note: returning STOP caused an intermittent hang in AAudioStream_close()!\n    return AAUDIO_CALLBACK_RESULT_CONTINUE;\n}\n\n\/** Start the thread and call the specified proc. *\/\nint AAudioHostThread::start(host_thread_proc_t proc, void *arg) {\n\n    mProcedure = proc;\n    mArgument = arg;\n\n    AAudioStreamBuilder *aaudioBuilder = nullptr;\n\n    \/\/ Use an AAudioStreamBuilder to contain requested parameters.\n    aaudio_result_t result = AAudio_createStreamBuilder(&aaudioBuilder);\n    if (result != AAUDIO_OK) {\n        return result;\n    }\n\n    \/\/ Request stream properties.\n    AAudioStreamBuilder_setDataCallback(aaudioBuilder, sm_aaudio_data_callback, this);\n    AAudioStreamBuilder_setPerformanceMode(aaudioBuilder, AAUDIO_PERFORMANCE_MODE_LOW_LATENCY);\n\n    \/\/ Create an AAudioStream using the Builder.\n    result = AAudioStreamBuilder_openStream(aaudioBuilder, &mAaudioStream);\n    AAudioStreamBuilder_delete(aaudioBuilder);\n    if (result != AAUDIO_OK) {\n        return result;\n    }\n    \/\/ Start it running.\n    result = AAudioStream_requestStart(mAaudioStream);\n    if (result != AAUDIO_OK) {\n        join();\n        return result;\n    }\n    return result;\n}\n\n\/** Wait for the thread proc to return. *\/\nint AAudioHostThread::join() {\n    AAudioStream *stream = mAaudioStream;\n    if (stream != nullptr) {\n        while (true) {\n            {\n                std::lock_guard<std::mutex> lock(mDoneLock); \/\/ will block if the thread is running\n                if (mDone) break;\n            }\n            usleep(50 * 1000); \/\/ sleep then check again\n        }\n        mAaudioStream = nullptr;\n        return AAudioStream_close(stream);\n    }\n    return AAUDIO_ERROR_INVALID_STATE;\n}\n\n#endif \/\/ __ANDROID__\n<commit_msg>aaudio: clear callback buffer to prevent pop<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\n#if defined(__ANDROID__)\n\n#include <aaudio\/AAudio.h>\n#include \"AAudioHostThread.h\"\n\nvoid AAudioHostThread::callHostThread() {\n    \/\/printf(\"%s() enter >>>>>>>>> mDone = %d\\n\", __func__, mDone);\n    \/\/ The callback returns AAUDIO_CALLBACK_RESULT_CONTINUE instead\n    \/\/ of AAUDIO_CALLBACK_RESULT_STOP because a race condition\n    \/\/ was causing a hang. So we may get called more than once.\n    \/\/ So check mDone to prevent mProcedure from running more than once.\n    if (!mDone) {\n        std::lock_guard<std::mutex> lock(mDoneLock);\n        (*mProcedure)(mArgument); \/\/ This should take a long time.\n        mDone = true; \/\/ Let join() know we are done.\n    }\n    \/\/printf(\"%s() exit <<<<<<<<<<\", __func__);\n}\n\nstatic aaudio_data_callback_result_t sm_aaudio_data_callback(\n        AAudioStream *stream __unused,\n        void *userData,\n        void *audioData __unused,\n        int32_t numFrames __unused) {\n    AAudioHostThread *hostThread = (AAudioHostThread *) userData;\n    hostThread->callHostThread();\n    \/\/ Note: returning STOP caused an intermittent hang in AAudioStream_close()!\n    int32_t numChannels = AAudioStream_getChannelCount(stream);\n    if (numChannels > 0) {\n        size_t numBytes = sizeof(int16_t) * numChannels * numFrames;\n        memset(audioData, 0, numBytes); \/\/ play silence to prevent pop\n    }\n    return AAUDIO_CALLBACK_RESULT_CONTINUE;\n}\n\n\/** Start the thread and call the specified proc. *\/\nint AAudioHostThread::start(host_thread_proc_t proc, void *arg) {\n\n    mProcedure = proc;\n    mArgument = arg;\n\n    AAudioStreamBuilder *aaudioBuilder = nullptr;\n\n    \/\/ Use an AAudioStreamBuilder to contain requested parameters.\n    aaudio_result_t result = AAudio_createStreamBuilder(&aaudioBuilder);\n    if (result != AAUDIO_OK) {\n        return result;\n    }\n\n    \/\/ Request stream properties.\n    AAudioStreamBuilder_setDataCallback(aaudioBuilder, sm_aaudio_data_callback, this);\n    AAudioStreamBuilder_setPerformanceMode(aaudioBuilder, AAUDIO_PERFORMANCE_MODE_LOW_LATENCY);\n    AAudioStreamBuilder_setFormat(aaudioBuilder, AAUDIO_FORMAT_PCM_I16);\n\n    \/\/ Create an AAudioStream using the Builder.\n    result = AAudioStreamBuilder_openStream(aaudioBuilder, &mAaudioStream);\n    AAudioStreamBuilder_delete(aaudioBuilder);\n    if (result != AAUDIO_OK) {\n        return result;\n    }\n    \/\/ Start it running.\n    result = AAudioStream_requestStart(mAaudioStream);\n    if (result != AAUDIO_OK) {\n        join();\n        return result;\n    }\n    return result;\n}\n\n\/** Wait for the thread proc to return. *\/\nint AAudioHostThread::join() {\n    AAudioStream *stream = mAaudioStream;\n    if (stream != nullptr) {\n        while (true) {\n            {\n                std::lock_guard<std::mutex> lock(mDoneLock); \/\/ will block if the thread is running\n                if (mDone) break;\n            }\n            usleep(50 * 1000); \/\/ sleep then check again\n        }\n        mAaudioStream = nullptr;\n        return AAudioStream_close(stream);\n    }\n    return AAUDIO_ERROR_INVALID_STATE;\n}\n\n#endif \/\/ __ANDROID__\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Macro to run AliDhcTask - A. Adare, Apr 2011\n\/\/ Choose dataType = \"esd\" or \"aod\".\n\/\/ Choose runMode  = \"local\", \"proof\", \"grid\", or \"terminate\".\n\/\/ Choose proofCluster = \"skaf.saske.sk\" or \"alice-caf.cern.ch\".\n\/\/ When running on proof: use root, not aliroot.\n\nInt_t verbosity      = 0;\nLong64_t nEvents     = 200;\nTString runMode      = \"local\";\nTString dataType     = \"aod\";\nTString localDir     = \"\/Users\/adare\/esd\/alice\/data\/2010\/LHC10h\/000139107\/ESDs\/pass2\/\";\nTString esdDir       = localDir + TString(\"10000139107001.120\/\");\nTString aodDir       = localDir + TString(\"AOD049\/0008\/\");\nTString proofDataset = \"\/alice\/data\/LHC10h_000137848_p2_AOD049\";\n\/\/TString proofCluster = \"aadare@alice-caf.cern.ch\";\nTString proofCluster = \"aadare@skaf.saske.sk\";\nTString alirootVer   = \"VO_ALICE@AliRoot::v4-21-21-AN\";\nTString libsBase     = \"Tree:Geom:VMC:STEERBase:ESD:AOD\";\n\/\/TString libsExtra    = \"ANALYSIS:ANALYSISalice:CORRFW:JETAN:PWG4JetTasks\";\nTString libsExtra    = \"ANALYSIS:ANALYSISalice\";\nTList* libList = new TList();\nTChain* chain = 0;\n\nvoid RunDhcTask()\n{\n  \/\/ Creates the large file memstat_<pid>.root.\n  \/\/ Call TMemStat::Show() on the promp to analyze it.\n  if (0)\n    TMemStat mm(\"gnubuiltin\");\n\n  if (runMode==\"local\")\n    LocalSetup();\n  else if (runMode==\"proof\") {\n    ProofSetup();\n  }\n\n  AddDhcTask();\n  \n  \/\/\/ ---  All set up now...run Analysis!  ---\n  AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n  if (!mgr->InitAnalysis()) \n    return;\n  if (verbosity > 0)\n    mgr->PrintStatus();\n  \n  if (runMode==\"local\") {\n    mgr->StartAnalysis(runMode.Data(), chain, nEvents);\n  }\n  else if (runMode==\"proof\") {\n    mgr->StartAnalysis(runMode.Data(), proofDataset.Data(), nEvents);\n  }\n  return;\n}\n\nvoid LocalSetup()\n{\n  \/\/ Load libraries \n  TObjArray* libs = libsExtra.Tokenize(\":\");\n  for (Int_t i=0; i<libs->GetEntries(); i++) {\n    const char* name = libs->At(i)->GetName();\n    Int_t ret = gSystem->Load(Form(\"lib%s\", name));\n    if (ret > 0)\n      Warning(\"LocalSetup()\", \"lib%s already loaded\", name);\n    if (ret < 0)\n      Warning(\"LocalSetup()\", \"lib%s failed to load\", name);\n  }\n  \n  \/\/ Add headers\n  gSystem->AddIncludePath(\"-I$ALICE_ROOT\/include\");\n  \n  \/\/ Load macros\/tasks\n  if (dataType == \"esd\") {\n    gROOT->LoadMacro(\"$ALICE_ROOT\/ANALYSIS\/macros\/AddTaskCentrality.C\");\n  }\n  gROOT->LoadMacro(\"$ALICE_ROOT\/ANALYSIS\/macros\/AddTaskPhysicsSelection.C\");\n  gROOT->LoadMacro(\"KiddiePoolClasses.cxx+g\");  \n  gROOT->LoadMacro(\"AliDhcTask.cxx+g\");  \n  \n  \/\/ Setup chain\n  TString chainName = dataType.Contains(\"aod\") ? \"aodTree\" : \"esdTree\";\n  chain = new TChain(chainName.Data());\n  if (dataType.Contains(\"aod\"))\n    chain->Add(Form(\"%sAliAOD.root\", aodDir.Data()));\n  if (dataType.Contains(\"esd\"))\n    chain->Add(Form(\"%sAliESDs.root\", esdDir.Data()));\n  return;\n}\n\nvoid ProofSetup()\n{\n  gEnv->SetValue(\"XSec.GSI.DelegProxy\", \"2\");\n      \n  \/\/ Get PROOF pointer\n  TProof *proof = gProof;\n  if (proof) {\n    TProof::Reset(proofCluster.Data()); \/\/ add kTRUE as a 2nd arg for hard reset\n    \/\/    proof->Reset(\"\");\n    cerr << \"Trying to reset proof\" << endl;\n  } else {\n    proof = TProof::Open(proofCluster.Data(), \"workers=60\");\n  }\n  if (!proof) {\n    cerr << \"Connection to \" << proofCluster.Data()\n\t << \" failed!\" << endl;\n    return;\n  }\n\n  if (0) {\n    proof->ShowPackages();\n    proof->ShowDataSets();\n  }\n  \n  \/\/ Load libraries   \n  int  ret = 0;\n  libList->Add(new TNamed(\"ALIROOT_EXTRA_LIBS\", libsBase.Data()));\n  libList->Add(new TNamed(\"ALIROOT_EXTRA_LIBS\", libsExtra.Data()));\n\n  ret = proof->EnablePackage(alirootVer.Data(), libList);\n  \n  proof->EnablePackage(alirootVer.Data(), 0);\n  if (ret) {\n    Error(\"ProofSetup()\", \"Failed to load all libs.\");\n    return;\n  }\n\n  \/\/ Load macros\/tasks\n  if (dataType == \"esd\") {\n    proof->Load(\"AddTaskCentrality.C\");\n  }\n  proof->Load(\"AddTaskPhysicsSelection.C\");\n  proof->Load(\"KiddiePoolClasses.cxx+g\");  \n  proof->Load(\"AliDhcTask.cxx+g\", 0);\n  return;\n}\n\nvoid AddDhcTask()\n{\n  \/\/ Need the following macros loaded beforehand:\n  \/\/ \"$ALICE_ROOT\/ANALYSIS\/macros\/AddTaskCentrality.C\" (ESD only)\n  \/\/ \"$ALICE_ROOT\/ANALYSIS\/macros\/AddTaskPhysicsSelection.C\"\n  \/\/ \"AliDhcTask.cxx+g\"\n\n  AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n  if (!mgr)\n    mgr = new AliAnalysisManager(\"DhcAnalysis\");\n  AliESDInputHandler* esdH = new AliESDInputHandler();\n  AliAODInputHandler* aodH = new AliAODInputHandler();\n  \n  if (dataType.Contains(\"aod\"))\n    mgr->SetInputEventHandler(aodH);\n  if (dataType.Contains(\"esd\"))\n    mgr->SetInputEventHandler(esdH);\n  \n  if (dataType == \"esd\") {\n    AliCentralitySelectionTask *centTask = AddTaskCentrality();\n    centTask->SelectCollisionCandidates(AliVEvent::kAny);\n    centTask->SetPass(2);\n  }\n  \n  AliPhysicsSelectionTask* physSelTask = AddTaskPhysicsSelection();\n  \n  AliDhcTask *dhcTask = new AliDhcTask(\"DhcTask\");\n  dhcTask->SelectCollisionCandidates(AliVEvent::kMB);\n  dhcTask->SetVerbosity(verbosity);\n\n  \/\/ Add task(s)\n  mgr->AddTask(dhcTask);\n  \n  \/\/ Create containers for input\/output\n  AliAnalysisDataContainer *cinput = mgr->GetCommonInputContainer();\n  AliAnalysisDataContainer *coutput = \n    mgr->CreateContainer(\"dhclist\", TList::Class(),   \n\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t \"dhctask_output.root\");\n  \n  \/\/ Connect input\/output\n  mgr->ConnectInput(dhcTask, 0, cinput);\n  mgr->ConnectOutput(dhcTask, 1, coutput);\n  \n  \/\/ Enable debug printouts\n  mgr->SetDebugLevel(verbosity);\n\n  return;\n}\n\n<commit_msg>switch from aclic compiled libs to libPWGCFCorrelationsDPhi for train running - use only in local mode<commit_after>\/\/ Macro to run AliDhcTask - A. Adare, Mar 2012\n\/\/ Choose dataType = \"esd\" or \"aod\".\n\/\/ Choose runMode  = \"local\", \"proof\", \"grid\", or \"terminate\".\n\/\/ Choose proofCluster = \"skaf.saske.sk\" or \"alice-caf.cern.ch\".\n\/\/ When running on proof: use root, not aliroot.\n\nInt_t verbosity      = 0;\nLong64_t nEvents     = 123456789;\nTString runMode      = \"local\"; \/\/ \"proof\";\nTString dataType     = \"aod\";\nTString localDir     = \"\/Users\/adare\/esd\/alice\/data\/2010\/LHC10h\/000139107\/ESDs\/pass2\/\";\nTString esdDir       = localDir + TString(\"10000139107001.120\/\");\nTString aodDir       = localDir + TString(\"AOD049\/0008\/\");\nTString proofDataset = \"\/alice\/data\/LHC10h_000137848_p2_AOD049\";\nTString proofCluster = \"aadare@skaf.saske.sk\"; \/\/ or \"aadare@alice-caf.cern.ch\";\nTString alirootVer   = \"VO_ALICE@AliRoot::v4-21-21-AN\"; \/\/ for PROOF\nTString libsBase     = \"Tree:Geom:VMC:STEERBase:ESD:AOD\";\nTString libsExtra    = \"ANALYSIS:ANALYSISalice:PWGCFCorrelationsDPhi\";\nTList* libList = new TList();\nTChain* chain = 0;\n\nvoid RunDhcTask()\n{\n  \/\/ Creates the large file memstat_<pid>.root.\n  \/\/ Call TMemStat::Show() on the promp to analyze it.\n  if (0)\n    TMemStat mm(\"gnubuiltin\");\n\n  if (runMode==\"local\")\n    LocalSetup();\n  else if (runMode==\"proof\") {\n    ProofSetup();\n  }\n\n  AddDhcTask();\n  \n  \/\/\/ ---  All set up now...run Analysis!  ---\n  AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n  if (!mgr->InitAnalysis()) \n    return;\n  if (verbosity > 0)\n    mgr->PrintStatus();\n  \n  if (runMode==\"local\") {\n    mgr->StartAnalysis(runMode.Data(), chain, nEvents);\n  }\n  else if (runMode==\"proof\") {\n    mgr->StartAnalysis(runMode.Data(), proofDataset.Data(), nEvents);\n  }\n  return;\n}\n\nvoid LocalSetup()\n{\n  \/\/ Load libraries \n  TObjArray* libs = libsExtra.Tokenize(\":\");\n  for (Int_t i=0; i<libs->GetEntries(); i++) {\n    const char* name = libs->At(i)->GetName();\n    Int_t ret = gSystem->Load(Form(\"lib%s\", name));\n    if (ret > 0)\n      Warning(\"LocalSetup()\", \"lib%s already loaded\", name);\n    if (ret < 0)\n      Warning(\"LocalSetup()\", \"lib%s failed to load\", name);\n  }\n  \n  \/\/ Add headers\n  gSystem->AddIncludePath(\"-I$ALICE_ROOT\/include\");\n  \n  \/\/ Load macros\/tasks\n  if (dataType == \"esd\") {\n    gROOT->LoadMacro(\"$ALICE_ROOT\/ANALYSIS\/macros\/AddTaskCentrality.C\");\n  }\n  gROOT->LoadMacro(\"$ALICE_ROOT\/ANALYSIS\/macros\/AddTaskPhysicsSelection.C\");\n  \/\/ gROOT->LoadMacro(\"AliPool.cxx+g\");  \n  \/\/ gROOT->LoadMacro(\"AliDhcTask.cxx+g\");  \n  \n  \/\/ Setup chain\n  TString chainName = dataType.Contains(\"aod\") ? \"aodTree\" : \"esdTree\";\n  chain = new TChain(chainName.Data());\n  if (dataType.Contains(\"aod\"))\n    chain->Add(Form(\"%sAliAOD.root\", aodDir.Data()));\n  if (dataType.Contains(\"esd\"))\n    chain->Add(Form(\"%sAliESDs.root\", esdDir.Data()));\n  return;\n}\n\nvoid ProofSetup()\n{\n  gEnv->SetValue(\"XSec.GSI.DelegProxy\", \"2\");\n      \n  \/\/ Get PROOF pointer\n  TProof *proof = gProof;\n  if (proof) {\n    TProof::Reset(proofCluster.Data()); \/\/ add kTRUE as a 2nd arg for hard reset\n    \/\/    proof->Reset(\"\");\n    cerr << \"Trying to reset proof\" << endl;\n  } else {\n    proof = TProof::Open(proofCluster.Data(), \"workers=60\");\n  }\n  if (!proof) {\n    cerr << \"Connection to \" << proofCluster.Data()\n\t << \" failed!\" << endl;\n    return;\n  }\n\n  if (0) {\n    proof->ShowPackages();\n    proof->ShowDataSets();\n  }\n  \n  \/\/ Load libraries   \n  int  ret = 0;\n  libList->Add(new TNamed(\"ALIROOT_EXTRA_LIBS\", libsBase.Data()));\n  libList->Add(new TNamed(\"ALIROOT_EXTRA_LIBS\", libsExtra.Data()));\n\n  ret = proof->EnablePackage(alirootVer.Data(), libList);\n  \n  proof->EnablePackage(alirootVer.Data(), 0);\n  if (ret) {\n    Error(\"ProofSetup()\", \"Failed to load all libs.\");\n    return;\n  }\n\n  \/\/ Load macros\/tasks\n  if (dataType == \"esd\") {\n    proof->Load(\"AddTaskCentrality.C\");\n  }\n  proof->Load(\"AddTaskPhysicsSelection.C\");\n  proof->Load(\"AliPool.cxx+g\");  \n  proof->Load(\"AliDhcTask.cxx+g\", 0);\n  return;\n}\n\nvoid AddDhcTask()\n{\n  \/\/ Need the following macros loaded beforehand:\n  \/\/ \"$ALICE_ROOT\/ANALYSIS\/macros\/AddTaskCentrality.C\" (ESD only)\n  \/\/ \"$ALICE_ROOT\/ANALYSIS\/macros\/AddTaskPhysicsSelection.C\"\n  \/\/ \"AliDhcTask.cxx+g\"\n\n  AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n  if (!mgr)\n    mgr = new AliAnalysisManager(\"DhcAnalysis\");\n  AliESDInputHandler* esdH = new AliESDInputHandler();\n  AliAODInputHandler* aodH = new AliAODInputHandler();\n  \n  if (dataType.Contains(\"aod\"))\n    mgr->SetInputEventHandler(aodH);\n  if (dataType.Contains(\"esd\"))\n    mgr->SetInputEventHandler(esdH);\n  \n  if (dataType == \"esd\") {\n    AliCentralitySelectionTask *centTask = AddTaskCentrality();\n    centTask->SelectCollisionCandidates(AliVEvent::kAny);\n    centTask->SetPass(2);\n  }\n  \n  AliPhysicsSelectionTask* physSelTask = AddTaskPhysicsSelection();\n  \n  AliDhcTask *dhcTask = new AliDhcTask(\"DhcTask\");\n  dhcTask->SelectCollisionCandidates(AliVEvent::kMB);\n  dhcTask->SetVerbosity(verbosity);\n\n  \/\/ Add task(s)\n  mgr->AddTask(dhcTask);\n  \n  \/\/ Create containers for input\/output\n  AliAnalysisDataContainer *cinput = mgr->GetCommonInputContainer();\n  AliAnalysisDataContainer *coutput = \n    mgr->CreateContainer(\"dhclist\", TList::Class(),   \n\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t \"dhctask_output.root\");\n  \n  \/\/ Connect input\/output\n  mgr->ConnectInput(dhcTask, 0, cinput);\n  mgr->ConnectOutput(dhcTask, 1, coutput);\n  \n  \/\/ Enable debug printouts\n  mgr->SetDebugLevel(verbosity);\n\n  return;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (C) 2016 Elviss Strazdins\n\/\/ This file is part of the Ouzel engine.\n\n#include \"Node.h\"\n#include \"core\/Engine.h\"\n#include \"SceneManager.h\"\n#include \"Layer.h\"\n#include \"animators\/Animator.h\"\n#include \"Camera.h\"\n#include \"utils\/Utils.h\"\n#include \"math\/MathUtils.h\"\n#include \"Component.h\"\n\nnamespace ouzel\n{\n    namespace scene\n    {\n        Node::Node()\n        {\n            animationUpdateCallback.callback = std::bind(&Node::updateAnimation, this, std::placeholders::_1);\n        }\n\n        Node::~Node()\n        {\n            for (const ComponentPtr& component : components)\n            {\n                component->setNode(nullptr);\n            }\n        }\n\n        void Node::visit(const Matrix4& newTransformMatrix, bool parentTransformDirty, Layer* currentLayer, float depth)\n        {\n            if (parentTransformDirty)\n            {\n                updateTransform(newTransformMatrix);\n            }\n\n            if (transformDirty)\n            {\n                calculateTransform();\n            }\n\n            if (cullDisabled || currentLayer->checkVisibility(std::static_pointer_cast<Node>(shared_from_this())))\n            {\n                currentLayer->addToDrawQueue(std::static_pointer_cast<Node>(shared_from_this()), depth + z);\n            }\n\n            for (const NodePtr& child : children)\n            {\n                if (!child->isHidden())\n                {\n                    child->visit(transform, updateChildrenTransform, currentLayer, depth + z);\n                }\n            }\n\n            updateChildrenTransform = false;\n        }\n\n        void Node::draw(Layer* currentLayer)\n        {\n            if (transformDirty)\n            {\n                calculateTransform();\n            }\n\n            if (currentLayer->getCamera())\n            {\n                graphics::Color drawColor(color.r, color.g, color.b, static_cast<uint8_t>(color.a * opacity));\n\n                for (const ComponentPtr& component : components)\n                {\n                    if (!component->isHidden())\n                    {\n                        component->draw(currentLayer->getCamera()->getViewProjection(),\n                                        transform,\n                                        drawColor,\n                                        currentLayer->getRenderTarget());\n                    }\n                }\n            }\n        }\n\n        void Node::drawWireframe(Layer* currentLayer)\n        {\n            if (transformDirty)\n            {\n                calculateTransform();\n            }\n\n            if (currentLayer->getCamera())\n            {\n                graphics::Color drawColor(color.r, color.g, color.b, static_cast<uint8_t>(color.a * opacity));\n\n                for (const ComponentPtr& component : components)\n                {\n                    if (!component->isHidden())\n                    {\n                        component->drawWireframe(currentLayer->getCamera()->getViewProjection(),\n                                                 transform,\n                                                 drawColor,\n                                                 currentLayer->getRenderTarget());\n                    }\n                }\n            }\n        }\n\n        bool Node::addChild(const NodePtr& node)\n        {\n            if (NodeContainer::addChild(node))\n            {\n                node->updateTransform(getTransform());\n\n                return true;\n            }\n            else\n            {\n                return false;\n            }\n        }\n\n        void Node::setZ(float newZ)\n        {\n            z = newZ;\n\n            \/\/ Currently z does not affect transformation\n            \/\/localTransformDirty = transformDirty = inverseTransformDirty = true;\n        }\n\n        void Node::setPosition(const Vector2& newPosition)\n        {\n            position = newPosition;\n\n            localTransformDirty = transformDirty = inverseTransformDirty = true;\n        }\n\n        void Node::setRotation(float newRotation)\n        {\n            rotation = newRotation;\n\n            localTransformDirty = transformDirty = inverseTransformDirty = true;\n        }\n\n        void Node::setScale(const Vector2& newScale)\n        {\n            scale = newScale;\n\n            localTransformDirty = transformDirty = inverseTransformDirty = true;\n        }\n\n        void Node::setColor(const graphics::Color& newColor)\n        {\n            color = newColor;\n        }\n\n        void Node::setOpacity(float newOpacity)\n        {\n            opacity = clamp(newOpacity, 0.0f, 1.0f);\n        }\n\n        void Node::setFlipX(bool newFlipX)\n        {\n            flipX = newFlipX;\n\n            localTransformDirty = transformDirty = inverseTransformDirty = true;\n        }\n\n        void Node::setFlipY(bool newFlipY)\n        {\n            flipY = newFlipY;\n\n            localTransformDirty = transformDirty = inverseTransformDirty = true;\n        }\n\n        void Node::setHidden(bool newHidden)\n        {\n            hidden = newHidden;\n        }\n\n        bool Node::pointOn(const Vector2& worldPosition) const\n        {\n            Vector2 localPosition = convertWorldToLocal(worldPosition);\n\n            for (const ComponentPtr& component : components)\n            {\n                if (component->pointOn(localPosition))\n                {\n                    return true;\n                }\n            }\n\n            return false;\n        }\n\n        bool Node::shapeOverlaps(const std::vector<Vector2>& edges) const\n        {\n            Matrix4 inverse = getInverseTransform();\n\n            std::vector<Vector2> transformedEdges;\n\n            for (const Vector2& edge : edges)\n            {\n                Vector3 transformedEdge = edge;\n\n                inverse.transformPoint(transformedEdge);\n\n                transformedEdges.push_back(Vector2(transformedEdge.x, transformedEdge.y));\n            }\n\n            for (const ComponentPtr& component : components)\n            {\n                if (component->shapeOverlaps(transformedEdges))\n                {\n                    return true;\n                }\n            }\n\n            return false;\n        }\n\n        void Node::updateTransform(const Matrix4& newParentTransform)\n        {\n            parentTransform = newParentTransform;\n            transformDirty = inverseTransformDirty = true;\n        }\n\n        Vector2 Node::convertWorldToLocal(const Vector2& worldPosition) const\n        {\n            Vector3 localPosition = worldPosition;\n\n            const Matrix4& currentInverseTransform = getInverseTransform();\n            currentInverseTransform.transformPoint(localPosition);\n\n            return Vector2(localPosition.x, localPosition.y);\n        }\n\n        Vector2 Node::convertLocalToWorld(const Vector2& localPosition) const\n        {\n            Vector3 worldPosition = localPosition;\n\n            const Matrix4& currentTransform = getTransform();\n            currentTransform.transformPoint(worldPosition);\n\n            return Vector2(worldPosition.x, worldPosition.y);\n        }\n\n        void Node::animate(const AnimatorPtr& animator)\n        {\n            removeAnimation();\n            currentAnimator = animator;\n\n            if (currentAnimator)\n            {\n                currentAnimator->start(std::static_pointer_cast<Node>(shared_from_this()));\n                sharedEngine->scheduleUpdate(animationUpdateCallback);\n            }\n        }\n\n        void Node::removeAnimation()\n        {\n            if (currentAnimator)\n            {\n                currentAnimator->stop();\n                currentAnimator.reset();\n                sharedEngine->unscheduleUpdate(animationUpdateCallback);\n            }\n        }\n\n        void Node::calculateLocalTransform() const\n        {\n            localTransform = Matrix4::IDENTITY;\n            localTransform.translate(Vector3(position.x, position.y, 0.0f));\n            if (rotation != 0.0f) localTransform.rotateZ(-rotation);\n\n            Vector3 realScale = Vector3(scale.x * (flipX ? -1.0f : 1.0f),\n                                        scale.y * (flipY ? -1.0f : 1.0f),\n                                        1.0f);\n\n            localTransform.scale(realScale);\n\n            localTransformDirty = false;\n        }\n\n        void Node::calculateTransform() const\n        {\n            if (localTransformDirty)\n            {\n                calculateLocalTransform();\n            }\n\n            transform = parentTransform * localTransform;\n            transformDirty = false;\n\n            updateChildrenTransform = true;\n        }\n\n        void Node::calculateInverseTransform() const\n        {\n            if (transformDirty)\n            {\n                calculateTransform();\n            }\n\n            inverseTransform = transform;\n            inverseTransform.invert();\n            inverseTransformDirty = false;\n        }\n\n        bool Node::addComponent(const ComponentPtr& component)\n        {\n            if (component->isAddedToNode())\n            {\n                return false;\n            }\n\n            components.push_back(component);\n            component->setNode(this);\n\n            return true;\n        }\n\n        bool Node::removeComponent(uint32_t index)\n        {\n            if (index >= components.size())\n            {\n                return false;\n            }\n\n            const ComponentPtr& component = components[index];\n            component->setNode(nullptr);\n\n            components.erase(components.begin() + static_cast<int>(index));\n\n            return true;\n        }\n\n        bool Node::removeComponent(const ComponentPtr& component)\n        {\n            for (auto i = components.begin(); i != components.end();)\n            {\n                if (*i == component)\n                {\n                    component->setNode(nullptr);\n                    components.erase(i);\n                    return true;\n                }\n                else\n                {\n                    ++i;\n                }\n            }\n\n            return false;\n        }\n\n        void Node::removeAllComponents()\n        {\n            components.clear();\n        }\n\n        void Node::updateAnimation(float delta)\n        {\n            if (currentAnimator)\n            {\n                currentAnimator->update(delta);\n\n                if (currentAnimator->isDone())\n                {\n                    removeAnimation();\n                }\n            }\n            else\n            {\n                sharedEngine->unscheduleUpdate(animationUpdateCallback);\n            }\n        }\n    } \/\/ namespace scene\n} \/\/ namespace ouzel\n<commit_msg>Draw wireframes fully opaque<commit_after>\/\/ Copyright (C) 2016 Elviss Strazdins\n\/\/ This file is part of the Ouzel engine.\n\n#include \"Node.h\"\n#include \"core\/Engine.h\"\n#include \"SceneManager.h\"\n#include \"Layer.h\"\n#include \"animators\/Animator.h\"\n#include \"Camera.h\"\n#include \"utils\/Utils.h\"\n#include \"math\/MathUtils.h\"\n#include \"Component.h\"\n\nnamespace ouzel\n{\n    namespace scene\n    {\n        Node::Node()\n        {\n            animationUpdateCallback.callback = std::bind(&Node::updateAnimation, this, std::placeholders::_1);\n        }\n\n        Node::~Node()\n        {\n            for (const ComponentPtr& component : components)\n            {\n                component->setNode(nullptr);\n            }\n        }\n\n        void Node::visit(const Matrix4& newTransformMatrix, bool parentTransformDirty, Layer* currentLayer, float depth)\n        {\n            if (parentTransformDirty)\n            {\n                updateTransform(newTransformMatrix);\n            }\n\n            if (transformDirty)\n            {\n                calculateTransform();\n            }\n\n            if (cullDisabled || currentLayer->checkVisibility(std::static_pointer_cast<Node>(shared_from_this())))\n            {\n                currentLayer->addToDrawQueue(std::static_pointer_cast<Node>(shared_from_this()), depth + z);\n            }\n\n            for (const NodePtr& child : children)\n            {\n                if (!child->isHidden())\n                {\n                    child->visit(transform, updateChildrenTransform, currentLayer, depth + z);\n                }\n            }\n\n            updateChildrenTransform = false;\n        }\n\n        void Node::draw(Layer* currentLayer)\n        {\n            if (transformDirty)\n            {\n                calculateTransform();\n            }\n\n            if (currentLayer->getCamera())\n            {\n                graphics::Color drawColor(color.r, color.g, color.b, static_cast<uint8_t>(color.a * opacity));\n\n                for (const ComponentPtr& component : components)\n                {\n                    if (!component->isHidden())\n                    {\n                        component->draw(currentLayer->getCamera()->getViewProjection(),\n                                        transform,\n                                        drawColor,\n                                        currentLayer->getRenderTarget());\n                    }\n                }\n            }\n        }\n\n        void Node::drawWireframe(Layer* currentLayer)\n        {\n            if (transformDirty)\n            {\n                calculateTransform();\n            }\n\n            if (currentLayer->getCamera())\n            {\n                graphics::Color drawColor(color.r, color.g, color.b, 255);\n\n                for (const ComponentPtr& component : components)\n                {\n                    if (!component->isHidden())\n                    {\n                        component->drawWireframe(currentLayer->getCamera()->getViewProjection(),\n                                                 transform,\n                                                 drawColor,\n                                                 currentLayer->getRenderTarget());\n                    }\n                }\n            }\n        }\n\n        bool Node::addChild(const NodePtr& node)\n        {\n            if (NodeContainer::addChild(node))\n            {\n                node->updateTransform(getTransform());\n\n                return true;\n            }\n            else\n            {\n                return false;\n            }\n        }\n\n        void Node::setZ(float newZ)\n        {\n            z = newZ;\n\n            \/\/ Currently z does not affect transformation\n            \/\/localTransformDirty = transformDirty = inverseTransformDirty = true;\n        }\n\n        void Node::setPosition(const Vector2& newPosition)\n        {\n            position = newPosition;\n\n            localTransformDirty = transformDirty = inverseTransformDirty = true;\n        }\n\n        void Node::setRotation(float newRotation)\n        {\n            rotation = newRotation;\n\n            localTransformDirty = transformDirty = inverseTransformDirty = true;\n        }\n\n        void Node::setScale(const Vector2& newScale)\n        {\n            scale = newScale;\n\n            localTransformDirty = transformDirty = inverseTransformDirty = true;\n        }\n\n        void Node::setColor(const graphics::Color& newColor)\n        {\n            color = newColor;\n        }\n\n        void Node::setOpacity(float newOpacity)\n        {\n            opacity = clamp(newOpacity, 0.0f, 1.0f);\n        }\n\n        void Node::setFlipX(bool newFlipX)\n        {\n            flipX = newFlipX;\n\n            localTransformDirty = transformDirty = inverseTransformDirty = true;\n        }\n\n        void Node::setFlipY(bool newFlipY)\n        {\n            flipY = newFlipY;\n\n            localTransformDirty = transformDirty = inverseTransformDirty = true;\n        }\n\n        void Node::setHidden(bool newHidden)\n        {\n            hidden = newHidden;\n        }\n\n        bool Node::pointOn(const Vector2& worldPosition) const\n        {\n            Vector2 localPosition = convertWorldToLocal(worldPosition);\n\n            for (const ComponentPtr& component : components)\n            {\n                if (component->pointOn(localPosition))\n                {\n                    return true;\n                }\n            }\n\n            return false;\n        }\n\n        bool Node::shapeOverlaps(const std::vector<Vector2>& edges) const\n        {\n            Matrix4 inverse = getInverseTransform();\n\n            std::vector<Vector2> transformedEdges;\n\n            for (const Vector2& edge : edges)\n            {\n                Vector3 transformedEdge = edge;\n\n                inverse.transformPoint(transformedEdge);\n\n                transformedEdges.push_back(Vector2(transformedEdge.x, transformedEdge.y));\n            }\n\n            for (const ComponentPtr& component : components)\n            {\n                if (component->shapeOverlaps(transformedEdges))\n                {\n                    return true;\n                }\n            }\n\n            return false;\n        }\n\n        void Node::updateTransform(const Matrix4& newParentTransform)\n        {\n            parentTransform = newParentTransform;\n            transformDirty = inverseTransformDirty = true;\n        }\n\n        Vector2 Node::convertWorldToLocal(const Vector2& worldPosition) const\n        {\n            Vector3 localPosition = worldPosition;\n\n            const Matrix4& currentInverseTransform = getInverseTransform();\n            currentInverseTransform.transformPoint(localPosition);\n\n            return Vector2(localPosition.x, localPosition.y);\n        }\n\n        Vector2 Node::convertLocalToWorld(const Vector2& localPosition) const\n        {\n            Vector3 worldPosition = localPosition;\n\n            const Matrix4& currentTransform = getTransform();\n            currentTransform.transformPoint(worldPosition);\n\n            return Vector2(worldPosition.x, worldPosition.y);\n        }\n\n        void Node::animate(const AnimatorPtr& animator)\n        {\n            removeAnimation();\n            currentAnimator = animator;\n\n            if (currentAnimator)\n            {\n                currentAnimator->start(std::static_pointer_cast<Node>(shared_from_this()));\n                sharedEngine->scheduleUpdate(animationUpdateCallback);\n            }\n        }\n\n        void Node::removeAnimation()\n        {\n            if (currentAnimator)\n            {\n                currentAnimator->stop();\n                currentAnimator.reset();\n                sharedEngine->unscheduleUpdate(animationUpdateCallback);\n            }\n        }\n\n        void Node::calculateLocalTransform() const\n        {\n            localTransform = Matrix4::IDENTITY;\n            localTransform.translate(Vector3(position.x, position.y, 0.0f));\n            if (rotation != 0.0f) localTransform.rotateZ(-rotation);\n\n            Vector3 realScale = Vector3(scale.x * (flipX ? -1.0f : 1.0f),\n                                        scale.y * (flipY ? -1.0f : 1.0f),\n                                        1.0f);\n\n            localTransform.scale(realScale);\n\n            localTransformDirty = false;\n        }\n\n        void Node::calculateTransform() const\n        {\n            if (localTransformDirty)\n            {\n                calculateLocalTransform();\n            }\n\n            transform = parentTransform * localTransform;\n            transformDirty = false;\n\n            updateChildrenTransform = true;\n        }\n\n        void Node::calculateInverseTransform() const\n        {\n            if (transformDirty)\n            {\n                calculateTransform();\n            }\n\n            inverseTransform = transform;\n            inverseTransform.invert();\n            inverseTransformDirty = false;\n        }\n\n        bool Node::addComponent(const ComponentPtr& component)\n        {\n            if (component->isAddedToNode())\n            {\n                return false;\n            }\n\n            components.push_back(component);\n            component->setNode(this);\n\n            return true;\n        }\n\n        bool Node::removeComponent(uint32_t index)\n        {\n            if (index >= components.size())\n            {\n                return false;\n            }\n\n            const ComponentPtr& component = components[index];\n            component->setNode(nullptr);\n\n            components.erase(components.begin() + static_cast<int>(index));\n\n            return true;\n        }\n\n        bool Node::removeComponent(const ComponentPtr& component)\n        {\n            for (auto i = components.begin(); i != components.end();)\n            {\n                if (*i == component)\n                {\n                    component->setNode(nullptr);\n                    components.erase(i);\n                    return true;\n                }\n                else\n                {\n                    ++i;\n                }\n            }\n\n            return false;\n        }\n\n        void Node::removeAllComponents()\n        {\n            components.clear();\n        }\n\n        void Node::updateAnimation(float delta)\n        {\n            if (currentAnimator)\n            {\n                currentAnimator->update(delta);\n\n                if (currentAnimator->isDone())\n                {\n                    removeAnimation();\n                }\n            }\n            else\n            {\n                sharedEngine->unscheduleUpdate(animationUpdateCallback);\n            }\n        }\n    } \/\/ namespace scene\n} \/\/ namespace ouzel\n<|endoftext|>"}
{"text":"<commit_before>\/**\n  * @file distance.cpp\n  * @brief Calcula la longitud total de un trayecto determinado por una secuencia de dos o más puntos\n  * @author Miguel Lentisco & Antonio Coín\n  *\/\n\n#include <iostream>\n#include <fstream>\n#include \"point.h\"\n\nusing namespace std;\n\n\/**\n  * @brief Elimina comentarios de un archivo de cara a una posterior lectura del contenido\n  * @pre Los comentarios comienzan con \"delim\" y acaban al final de línea\n  *\/\nvoid EraseComment ( istream& is, char delim )\n{\n  \/\/ Avanzamos hasta encontrar algo distinto a un blanco o el carácter \"delim\"\n  while ( isspace( is.peek() ) || is.peek() == delim )\n  {\n    if ( is.peek() == delim )\n      is.ignore( 1024, '\\n' );  \/\/ Suponemos que las líneas tienen menos de 1024 caracteres\n    else\n      is.ignore();\n  }\n}\n\n\/**\n  * @brief Calcula la distancia total de un trayecto, leyendo la secuencia de puntos que lo determinan\n  * con ReadPoint\n  * @param Flujo de entrada de datos (is)\n  *\/\ndouble TotalDistance ( istream& is )\n{\n  double distance = 0;\n  const char DELIM = '#';\n  Point p[2];\n\n  \/\/ Leemos el primer punto, eliminando comentarios\n  EraseComment( is, DELIM );\n  ReadPoint( is, p[0] );\n  EraseComment( is, DELIM );\n\n  while ( ReadPoint( is, p[1] ) )\n  {\n    distance += Distance( p[0], p[1] );\n    p[0] = p[1];\n    EraseComment( is, DELIM );\n  }\n\n  return distance;\n}\n\nint main( int argc, char* argv[] )\n{\n  double total_distance;\n  bool input_finished;\n\n  if ( argc == 1 ){ \/\/ Si no se ha introducido el nombre del archivo como parámetro\n    total_distance = TotalDistance( cin );\n    input_finished = cin.eof();   \/\/ Comprueba si se ha leído hasta el final\n  }\n  else {\n    ifstream f( argv[1] );\n\n    if ( !f ) {\n      cerr << \"No se puede abrir el archivo \" << argv[1] << endl;\n      return 1;   \/\/ Forzamos el cierre, devolviendo al sistema un error\n    }\n\n    total_distance = TotalDistance( f );\n    input_finished = f.eof();\n  }\n\n  if ( !input_finished ) {\n    cerr << \"Error inesperado: no se han podido leer todos los datos.\" << endl;\n    return 1;\n  }\n\n  cout << \"La distancia total del trayecto es: \" << total_distance << endl;\n}\n<commit_msg>Minnor fixes to distance.cpp<commit_after>\/**\n  * @file distance.cpp\n  * @brief Calcula la longitud total de un trayecto determinado por una secuencia de dos o más puntos\n  * @author Miguel Lentisco & Antonio Coín\n  *\/\n\n#include <iostream>\n#include <fstream>\n#include \"point.h\"\nusing namespace std;\n\n\/**\n  * @brief Elimina comentarios de un archivo de cara a una posterior lectura del contenido\n  * @pre Los comentarios comienzan con \"delim\" y acaban al final de línea\n  *\/\nvoid EraseComment( istream& is, char delim )\n{\n  \/\/ Avanzamos hasta encontrar algo distinto a un blanco o el carácter \"delim\"\n  while( isspace( is.peek() ) || is.peek() == delim )\n  {\n    if( is.peek() == delim )\n      is.ignore( 1024, '\\n' );  \/\/ Suponemos que las líneas tienen menos de 1024 caracteres\n    else\n      is.ignore();\n  }\n}\n\n\/**\n  * @brief Calcula la distancia total de un trayecto, leyendo la secuencia de puntos que lo determinan\n  * con ReadPoint\n  * @param Flujo de entrada de datos (is)\n  *\/\ndouble TotalDistance( istream& is )\n{\n  double distance = 0;\n  const char DELIM = '#';\n  Point p[2];\n\n  \/\/ Leemos el primer punto, eliminando comentarios\n  EraseComment( is, DELIM );\n  ReadPoint( is, p[0] );\n  EraseComment( is, DELIM );\n\n  while( ReadPoint( is, p[1] ) )\n  {\n    distance += Distance( p[0], p[1] );\n    p[0] = p[1];\n    EraseComment( is, DELIM );\n  }\n\n  return distance;\n}\n\nint main( int argc, char* argv[] )\n{\n  double total_distance;\n  bool input_finished;\n\n  if( argc == 1 ) \/\/ Si no se ha introducido el nombre del archivo como parámetro\n  {\n    total_distance = TotalDistance( cin );\n    input_finished = cin.eof();   \/\/ Comprueba si se ha leído hasta el final\n  }\n  else\n  {\n    ifstream f( argv[1] );\n\n    if( !f )\n    {\n      cerr << \"No se puede abrir el archivo \" << argv[1] << endl;\n      return 1;   \/\/ Forzamos el cierre, devolviendo al sistema un error\n    }\n\n    total_distance = TotalDistance( f );\n    input_finished = f.eof();\n  }\n\n  if( !input_finished ) \n  {\n    cerr << \"Error inesperado: no se han podido leer todos los datos.\" << endl;\n    return 1;\n  }\n\n  cout << \"La distancia total del trayecto es: \" << total_distance << endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  mcbResourceNode.cpp\n\/\/  mcb\n\/\/\n\/\/  Created by Radif Sharafullin on 6\/9\/13.\n\/\/\n\/\/\n\n#include \"mcbResourceNode.h\"\n\n#include \"mcbPlatformSupport.h\"\n#include \"mcbNumber.h\"\n#include \"mcbPlatformSupportFunctions.h\"\n#include <stack>\n\nusing namespace cocos2d;\nnamespace mcb{namespace PlatformSupport{\n    REGISTER_RESOURCE_NODE_CLASS_FOR_REFLECTION_CPP(ResourceNode);\n\n    bool _isNavigationStackMarker(const std::string & markerCandidate){\n        if (markerCandidate.empty())\n            return false;\n        return markerCandidate.front()==':';\n    }\n    static std::stack<std::string> _navigationStack;\n\n#pragma mark lifecycle\n    ResourceNode::ResourceNode(){\n        \n        \n        auto setNodePropertiesL([](cocos2d::CCNode * node, CCDictionary * data){\n        \n            CCPoint pos(Functions::pointForObjectKey(data, \"position\"));\n            float rotation(Functions::floatForObjectKey(data, \"rotation\"));\n            \n            \/\/scale\n            bool useScaleXY(false);\n            float scaleX(1.f);\n            float scaleY(1.f);\n            \n            float scale(1.f);\n            Number * num((Number *)data->objectForKey(\"scale\"));\n            if (num)\n                scale=*num;\n            else{\n                Number * pScaleX((Number *)data->objectForKey(\"scaleX\"));\n                Number * pScaleY((Number *)data->objectForKey(\"scaleY\"));\n                \n                if (pScaleX || pScaleY) {\n                    useScaleXY=true;\n                    if (pScaleX)\n                        scaleX=*pScaleX;\n                    if (pScaleY)\n                        scaleY=*pScaleY;\n                }\n                \n            }\n            \n            if (data->objectForKey(\"anchorPoint\"))\n                node->setAnchorPoint(Functions::pointForObjectKey(data, \"anchorPoint\", {.5f,.5f}));\n            \n            if (data->objectForKey(\"contentSize\"))\n                node->setContentSize(Functions::sizeForObjectKey(data, \"contentSize\", {0.f,0.f}));\n\n            node->setPosition(pos);\n            \n            if (useScaleXY){\n                node->setScaleX(scaleX);\n                node->setScaleY(scaleY);\n            }else\n                node->setScale(scale);\n            \n            node->setRotation(rotation);\n        });\n        \n        _generators[\"node\"]=[=](CCDictionary * data)->CCNode *{\n            cocos2d::CCNode * node(cocos2d::CCNode::create());\n            setNodePropertiesL(node, data);\n            return node;\n            \n        };\n\n        \n        _generators[\"label-ttf\"]=[=](CCDictionary * data)->cocos2d::CCNode *{\n            std::string text(Functions::stringForObjectKey(data, \"text\"));\n            std::string fontName(Functions::stringForObjectKey(data, \"font_name\", \"Georgia\"));\n            float fontSize(Functions::floatForObjectKey(data, \"font_size\", 24));\n            \n            ccColor3B color(Functions::colorForObjectKey(data, \"text_color\"));\n            color=Functions::webColorForObjectKey(data, \"text_webColor\", color);\n            CCTextAlignment hAlignment(Functions::textAlignmentForObjectKey(data, \"alignment\"));\n            \n            CCLabelTTF * letterLabel(CCLabelTTF::create(text.c_str(), fontName.c_str(), fontSize, CCSizeZero, hAlignment));\n            setNodePropertiesL(letterLabel, data);\n            letterLabel->setColor(color);\n            return letterLabel;\n        };\n\n        _generators[\"label-bmf\"]=[=](CCDictionary * data)->cocos2d::CCNode *{\n            std::string text(Functions::stringForObjectKey(data, \"text\"));\n            std::string fontPath(mcbPath(Functions::stringForObjectKey(data, \"font_path\")));\n            assert(fontPath.length());\n            \n            CCTextAlignment hAlignment(Functions::textAlignmentForObjectKey(data, \"alignment\"));\n            float width(Functions::floatForObjectKey(data, \"width\"));\n            CCPoint imageOffset(Functions::pointForObjectKey(data, \"imageOffset\"));\n            \n            CCLabelBMFont * letterLabel(CCLabelBMFont::create(text.c_str(), fontPath.c_str(), width, hAlignment, imageOffset));\n            setNodePropertiesL(letterLabel, data);\n            if (data->objectForKey(\"text_color\"))\n                letterLabel->setColor(Functions::colorForObjectKey(data, \"text_color\"));\n            else if(data->objectForKey(\"text_webColor\"))\n                letterLabel->setColor(Functions::webColorForObjectKey(data, \"text_webColor\"));\n            \n            return letterLabel;\n        };\n\n        _generators[\"menu-item-text\"]=[=](CCDictionary * data)->cocos2d::CCNode *{\n            std::string text(Functions::stringForObjectKey(data, \"text\"));\n            std::string fontName(Functions::stringForObjectKey(data, \"font_name\", \"Georgia\"));            \n            float fontSize(Functions::floatForObjectKey(data, \"font_size\", 24));\n            ccColor3B color(Functions::colorForObjectKey(data, \"text_color\"));\n            color=Functions::webColorForObjectKey(data, \"text_webColor\",color);\n            \/\/CCTextAlignment hAlignment(textAlignmentForObjectKeyL(data, \"alignment\"));\n            \n            CCMenuItemFont * item=CCMenuItemFont::create(text.c_str());\n            item->setTarget(this, menu_selector(ResourceNode::_buttonWithTagPressed));\n            Number * tag=(Number *)data->objectForKey(\"tag\");\n            if (tag)\n                item->setTag(*tag);\n            item->setColor(color);\n            item->setFontName(fontName.c_str());\n            item->setFontSize(fontSize);\n            \n            CCMenu*m(CCMenu::createWithItem(item));\n            setNodePropertiesL(m, data);\n            return m;\n            \n            \n        };\n        \n        _generators[\"sprite\"]=[=](CCDictionary * data)->CCNode *{\n            std::string imagePath(Functions::stringForObjectKey(data, \"image\"));\n            assert(imagePath.length());\n            imagePath=mcbPath(imagePath);\n            cocos2d::CCSprite * spr(cocos2d::CCSprite::create(imagePath.c_str()));\n            setNodePropertiesL(spr, data);\n            return spr;\n            \n        };\n        \n        _generators[\"menu-item-image\"]=[=](CCDictionary * data)->CCNode *{\n            CCAssert(data, \"MenuItem data is missing!\");\n            \n            std::string str(mcbPath(Functions::stringForObjectKey(data, \"normalImage\")));\n            std::string str1(mcbPath(Functions::stringForObjectKey(data, \"selectedImage\")));\n\n            assert(str.length());\n            assert(str1.length());\n            \n            CCMenuItemImage * item=CCMenuItemImage::create(str.c_str(), str1.c_str());\n            item->setTarget(this, menu_selector(ResourceNode::_buttonWithTagPressed));\n            item->setTag(Functions::floatForObjectKey(data, \"tag\"));\n            \n            CCMenu*m(CCMenu::createWithItem(item));\n            setNodePropertiesL(m, data);\n            return m;\n        };\n        \n    }\n    ResourceNode::~ResourceNode(){\n        CC_SAFE_RELEASE(_data);\n    };\n\n    bool ResourceNode::init(cocos2d::CCDictionary * data){\n        auto retVal(super::init());\n        std::string viewDataStr(\"viewData\");\n        std::string deviceSufixViewDataStr(viewDataStr+PlatformSupport::getDeviceSuffix());\n        std::string deviceIdiomViewDataStr(viewDataStr+PlatformSupport::getDeviceIdiom());\n        \n        CCDictionary * viewData((CCDictionary *)data->objectForKey(deviceIdiomViewDataStr.c_str()));\n        if (!viewData)\n            viewData=((CCDictionary *)data->objectForKey(deviceSufixViewDataStr.c_str()));\n        if (!viewData)\n            viewData=((CCDictionary *)data->objectForKey(viewDataStr.c_str()));\n        if (viewData)\n            buildViewWithData(viewData);\n        \n        return retVal;\n    }\n    void ResourceNode::setData(cocos2d::CCDictionary * data){\n        CC_SAFE_RELEASE(_data);\n        _data=data;\n        CC_SAFE_RETAIN(_data);\n    }\n\n#pragma mark construction\n    \n    cocos2d::CCScene * ResourceNode::createWithScene(const std::string & localPath){\n        CCScene *scene(CCScene::create());\n        while (!_navigationStack.empty())\n            _navigationStack.pop();\n        _navigationStack.push(localPath);\n        auto node(mcb::PlatformSupport::ResourceNode::create(localPath));\n        scene->addChild(node);\n        return scene;\n    }\n    \n    ResourceNode * ResourceNode::create(const std::string & localPath){\n        const std::string path(PlatformSupport::resolvePath(localPath));\n        CCDictionary * data(PlatformSupport::dictionaryFromPlist(std::string(path+\"\/manifest.data\").c_str()));\n        if (data)\n            return create(path, data);\n        return nullptr;\n    }\n    ResourceNode * ResourceNode::create(const std::string & localPath, cocos2d::CCDictionary * data){\n        ResourceNode * retVal(nullptr);\n        CCString * name((CCString *)data->objectForKey(\"class\"));\n        if (name) {\n            retVal=ResourceNodeFactory::createInstance(name->m_sString);\n            if (retVal) {\n                retVal->_localPath=localPath;\n                retVal->setData(data);\n                if (!retVal->init(data)){\n                    delete retVal;\n                    retVal = nullptr;\n                }\n                    \n            }\n        }\n        \n        return retVal;\n    }\n#pragma mark transition\n    void ResourceNode::mcbCleanup(){\n        ;\/\/when override, please, call super\n    }\n    void ResourceNode::_processCleanup(){\n        if (_mcbCleanupCalled)\n            return;\n        beforeCleanup();\n        mcbCleanup();\n        _mcbCleanupCalled=true;\n        afterCleanup();\n    }\n    \n    void ResourceNode::beforeCleanup(){\n        ;\/\/when override, please, call super\n    }\n    void ResourceNode::afterCleanup(){\n        ;\/\/when override, please, call super\n    }\n    \n    \n    bool ResourceNode::transitionBack(const std::function<void(ResourceNode * newNode, const std::function<void()> & transitionHandle)> & transitionHandle, const std::string & marker){\n        if (_navigationStack.empty())\n            return false;\n        \n        if (!marker.empty())\n            popNavigationStackUntilMarker(marker);\n        \n        \n        _navigationStack.pop();\n        std::string prevPath;\n        if (!_navigationStack.empty()) {\n            prevPath=_navigationStack.top();\n            \n            while (_isNavigationStackMarker(prevPath) && !_navigationStack.empty()) {\n                _navigationStack.pop();\n                prevPath=_navigationStack.top();\n            }\n            \n            return transitionToANodeWithPath(prevPath, transitionHandle, false);\n        }\n        return false;\n    }\n    bool ResourceNode::transitionToANodeWithPath(const std::string & path, const std::function<void(ResourceNode * newNode, const std::function<void()> & transitionHandle)> & transitionHandle, bool isStack){\n        std::string fullPath(mcbPath(path));\n        if (isStack)\n            _navigationStack.push(fullPath);\n        \n        ResourceNode * newNode(create(fullPath));\n        if (!newNode)\n            return false;\n        \n        auto completedHandle([=](){\n            _processCleanup();\n            auto p(getParent());\n            p->removeChild(this);\n            p->addChild(newNode);\n        });\n        \n        if (transitionHandle) {\n            newNode->retain();\n            transitionHandle(newNode, [=]{\n                completedHandle();\n                newNode->release();\n            });\n        }else\n            completedHandle();\n        \n        return true;\n    }\n    \n    void ResourceNode::popNavigationStack(){\n        if (!_navigationStack.empty())\n            _navigationStack.pop();\n    }\n    void ResourceNode::rewindNavigationStack(){\n        while (!_navigationStack.empty())\n            _navigationStack.pop();\n    }\n    void ResourceNode::pushNavigationStackMarker(const std::string & marker){\n        _navigationStack.push(':'+marker);\n    }\n    void ResourceNode::popNavigationStackUntilMarker(const std::string & marker){\n        std::string m(':'+marker);\n        while (!_navigationStack.empty()){\n            if (_navigationStack.top()!=m)\n                _navigationStack.pop();\n            else\n                break;\n        }\n    }\n#pragma mark view builder\n    void ResourceNode::setFactoryForKey(const std::function<cocos2d::CCNode *(cocos2d::CCDictionary *)> & lambda, const std::string & key){\n        _generators[key]=lambda;\n    }\n    std::function<cocos2d::CCNode *(cocos2d::CCDictionary *)> ResourceNode::factoryForKey(const std::string & key){\n        auto it(_generators.find(key));\n        if (it!=_generators.end())\n            return (*it).second;\n        return nullptr;\n    }\n    void ResourceNode::buildViewWithData(cocos2d::CCDictionary * data){\n        if (!data)\n            return;\n        CCArray * children=(CCArray *)data->objectForKey(\"children\");\n        _populateChildren(children, this);\n    }\n    void ResourceNode::_populateChildren(cocos2d::CCArray * children, CCNode * parent){\n        \n        mcbForEachBegin(CCDictionary *, child, children)\n        CCString * typeS((CCString *)child->objectForKey(\"type\"));\n        if (typeS) {\n            std::string type(typeS->m_sString);\n            CCNode * childNode(nullptr);\n            auto lambda(factoryForKey(type));\n            if (lambda)\n                childNode=lambda(child);\n            \n            if (childNode) {\n                \n                Number * tag=(Number *)child->objectForKey(\"tag\");\n                if (tag)\n                    childNode->setTag(*tag);\n                \n                Number * zOrder=(Number *)child->objectForKey(\"zOrder\");\n                \n                if (zOrder)\n                    parent->addChild(childNode, *zOrder);\n                else\n                    parent->addChild(childNode);\n                \n                \n                CCArray * m_children=(CCArray *)child->objectForKey(\"children\");\n                if (m_children)\n                    _populateChildren(m_children, childNode);\n            }\n            \n        }\n        mcbForEachEnd\n    }\n#pragma mark callbacks\n    void ResourceNode::_buttonWithTagPressed(cocos2d::CCObject * button){\n        CCMenuItem * item(dynamic_cast<CCMenuItem *>(button));\n        if (!item)\n            return;\n        buttonWithTagPressed(button, item->getTag());\n    }\n}}<commit_msg>added visible prop<commit_after>\/\/\n\/\/  mcbResourceNode.cpp\n\/\/  mcb\n\/\/\n\/\/  Created by Radif Sharafullin on 6\/9\/13.\n\/\/\n\/\/\n\n#include \"mcbResourceNode.h\"\n\n#include \"mcbPlatformSupport.h\"\n#include \"mcbNumber.h\"\n#include \"mcbPlatformSupportFunctions.h\"\n#include <stack>\n\nusing namespace cocos2d;\nnamespace mcb{namespace PlatformSupport{\n    REGISTER_RESOURCE_NODE_CLASS_FOR_REFLECTION_CPP(ResourceNode);\n\n    bool _isNavigationStackMarker(const std::string & markerCandidate){\n        if (markerCandidate.empty())\n            return false;\n        return markerCandidate.front()==':';\n    }\n    static std::stack<std::string> _navigationStack;\n\n#pragma mark lifecycle\n    ResourceNode::ResourceNode(){\n        \n        \n        auto setNodePropertiesL([](cocos2d::CCNode * node, CCDictionary * data){\n        \n            CCPoint pos(Functions::pointForObjectKey(data, \"position\"));\n            float rotation(Functions::floatForObjectKey(data, \"rotation\"));\n            \n            \/\/scale\n            bool useScaleXY(false);\n            float scaleX(1.f);\n            float scaleY(1.f);\n            \n            float scale(1.f);\n            Number * num((Number *)data->objectForKey(\"scale\"));\n            if (num)\n                scale=*num;\n            else{\n                Number * pScaleX((Number *)data->objectForKey(\"scaleX\"));\n                Number * pScaleY((Number *)data->objectForKey(\"scaleY\"));\n                \n                if (pScaleX || pScaleY) {\n                    useScaleXY=true;\n                    if (pScaleX)\n                        scaleX=*pScaleX;\n                    if (pScaleY)\n                        scaleY=*pScaleY;\n                }\n                \n            }\n            \n            if (data->objectForKey(\"anchorPoint\"))\n                node->setAnchorPoint(Functions::pointForObjectKey(data, \"anchorPoint\", node->getAnchorPoint()));\n            \n            if (data->objectForKey(\"contentSize\"))\n                node->setContentSize(Functions::sizeForObjectKey(data, \"contentSize\", node->getContentSize()));\n\n            node->setPosition(pos);\n            \n            if (useScaleXY){\n                node->setScaleX(scaleX);\n                node->setScaleY(scaleY);\n            }else\n                node->setScale(scale);\n            \n            node->setRotation(rotation);\n            \n            if (data->objectForKey(\"visible\"))\n                node->setVisible(Functions::boolForObjectKey(data, \"visible\", node->isVisible()));\n            \n        });\n        \n        _generators[\"node\"]=[=](CCDictionary * data)->CCNode *{\n            cocos2d::CCNode * node(cocos2d::CCNode::create());\n            setNodePropertiesL(node, data);\n            return node;\n            \n        };\n\n        \n        _generators[\"label-ttf\"]=[=](CCDictionary * data)->cocos2d::CCNode *{\n            std::string text(Functions::stringForObjectKey(data, \"text\"));\n            std::string fontName(Functions::stringForObjectKey(data, \"font_name\", \"Georgia\"));\n            float fontSize(Functions::floatForObjectKey(data, \"font_size\", 24));\n            \n            ccColor3B color(Functions::colorForObjectKey(data, \"text_color\"));\n            color=Functions::webColorForObjectKey(data, \"text_webColor\", color);\n            CCTextAlignment hAlignment(Functions::textAlignmentForObjectKey(data, \"alignment\"));\n            \n            CCLabelTTF * letterLabel(CCLabelTTF::create(text.c_str(), fontName.c_str(), fontSize, CCSizeZero, hAlignment));\n            setNodePropertiesL(letterLabel, data);\n            letterLabel->setColor(color);\n            return letterLabel;\n        };\n\n        _generators[\"label-bmf\"]=[=](CCDictionary * data)->cocos2d::CCNode *{\n            std::string text(Functions::stringForObjectKey(data, \"text\"));\n            std::string fontPath(mcbPath(Functions::stringForObjectKey(data, \"font_path\")));\n            assert(fontPath.length());\n            \n            CCTextAlignment hAlignment(Functions::textAlignmentForObjectKey(data, \"alignment\"));\n            float width(Functions::floatForObjectKey(data, \"width\"));\n            CCPoint imageOffset(Functions::pointForObjectKey(data, \"imageOffset\"));\n            \n            CCLabelBMFont * letterLabel(CCLabelBMFont::create(text.c_str(), fontPath.c_str(), width, hAlignment, imageOffset));\n            setNodePropertiesL(letterLabel, data);\n            if (data->objectForKey(\"text_color\"))\n                letterLabel->setColor(Functions::colorForObjectKey(data, \"text_color\"));\n            else if(data->objectForKey(\"text_webColor\"))\n                letterLabel->setColor(Functions::webColorForObjectKey(data, \"text_webColor\"));\n            \n            return letterLabel;\n        };\n\n        _generators[\"menu-item-text\"]=[=](CCDictionary * data)->cocos2d::CCNode *{\n            std::string text(Functions::stringForObjectKey(data, \"text\"));\n            std::string fontName(Functions::stringForObjectKey(data, \"font_name\", \"Georgia\"));            \n            float fontSize(Functions::floatForObjectKey(data, \"font_size\", 24));\n            ccColor3B color(Functions::colorForObjectKey(data, \"text_color\"));\n            color=Functions::webColorForObjectKey(data, \"text_webColor\",color);\n            \/\/CCTextAlignment hAlignment(textAlignmentForObjectKeyL(data, \"alignment\"));\n            \n            CCMenuItemFont * item=CCMenuItemFont::create(text.c_str());\n            item->setTarget(this, menu_selector(ResourceNode::_buttonWithTagPressed));\n            Number * tag=(Number *)data->objectForKey(\"tag\");\n            if (tag)\n                item->setTag(*tag);\n            item->setColor(color);\n            item->setFontName(fontName.c_str());\n            item->setFontSize(fontSize);\n            \n            CCMenu*m(CCMenu::createWithItem(item));\n            setNodePropertiesL(m, data);\n            return m;\n            \n            \n        };\n        \n        _generators[\"sprite\"]=[=](CCDictionary * data)->CCNode *{\n            std::string imagePath(Functions::stringForObjectKey(data, \"image\"));\n            assert(imagePath.length());\n            imagePath=mcbPath(imagePath);\n            cocos2d::CCSprite * spr(cocos2d::CCSprite::create(imagePath.c_str()));\n            setNodePropertiesL(spr, data);\n            return spr;\n            \n        };\n        \n        _generators[\"menu-item-image\"]=[=](CCDictionary * data)->CCNode *{\n            CCAssert(data, \"MenuItem data is missing!\");\n            \n            std::string str(mcbPath(Functions::stringForObjectKey(data, \"normalImage\")));\n            std::string str1(mcbPath(Functions::stringForObjectKey(data, \"selectedImage\")));\n\n            assert(str.length());\n            assert(str1.length());\n            \n            CCMenuItemImage * item=CCMenuItemImage::create(str.c_str(), str1.c_str());\n            item->setTarget(this, menu_selector(ResourceNode::_buttonWithTagPressed));\n            item->setTag(Functions::floatForObjectKey(data, \"tag\"));\n            \n            CCMenu*m(CCMenu::createWithItem(item));\n            setNodePropertiesL(m, data);\n            return m;\n        };\n        \n    }\n    ResourceNode::~ResourceNode(){\n        CC_SAFE_RELEASE(_data);\n    };\n\n    bool ResourceNode::init(cocos2d::CCDictionary * data){\n        auto retVal(super::init());\n        std::string viewDataStr(\"viewData\");\n        std::string deviceSufixViewDataStr(viewDataStr+PlatformSupport::getDeviceSuffix());\n        std::string deviceIdiomViewDataStr(viewDataStr+PlatformSupport::getDeviceIdiom());\n        \n        CCDictionary * viewData((CCDictionary *)data->objectForKey(deviceIdiomViewDataStr.c_str()));\n        if (!viewData)\n            viewData=((CCDictionary *)data->objectForKey(deviceSufixViewDataStr.c_str()));\n        if (!viewData)\n            viewData=((CCDictionary *)data->objectForKey(viewDataStr.c_str()));\n        if (viewData)\n            buildViewWithData(viewData);\n        \n        return retVal;\n    }\n    void ResourceNode::setData(cocos2d::CCDictionary * data){\n        CC_SAFE_RELEASE(_data);\n        _data=data;\n        CC_SAFE_RETAIN(_data);\n    }\n\n#pragma mark construction\n    \n    cocos2d::CCScene * ResourceNode::createWithScene(const std::string & localPath){\n        CCScene *scene(CCScene::create());\n        while (!_navigationStack.empty())\n            _navigationStack.pop();\n        _navigationStack.push(localPath);\n        auto node(mcb::PlatformSupport::ResourceNode::create(localPath));\n        scene->addChild(node);\n        return scene;\n    }\n    \n    ResourceNode * ResourceNode::create(const std::string & localPath){\n        const std::string path(PlatformSupport::resolvePath(localPath));\n        CCDictionary * data(PlatformSupport::dictionaryFromPlist(std::string(path+\"\/manifest.data\").c_str()));\n        if (data)\n            return create(path, data);\n        return nullptr;\n    }\n    ResourceNode * ResourceNode::create(const std::string & localPath, cocos2d::CCDictionary * data){\n        ResourceNode * retVal(nullptr);\n        CCString * name((CCString *)data->objectForKey(\"class\"));\n        if (name) {\n            retVal=ResourceNodeFactory::createInstance(name->m_sString);\n            if (retVal) {\n                retVal->_localPath=localPath;\n                retVal->setData(data);\n                if (!retVal->init(data)){\n                    delete retVal;\n                    retVal = nullptr;\n                }\n                    \n            }\n        }\n        \n        return retVal;\n    }\n#pragma mark transition\n    void ResourceNode::mcbCleanup(){\n        ;\/\/when override, please, call super\n    }\n    void ResourceNode::_processCleanup(){\n        if (_mcbCleanupCalled)\n            return;\n        beforeCleanup();\n        mcbCleanup();\n        _mcbCleanupCalled=true;\n        afterCleanup();\n    }\n    \n    void ResourceNode::beforeCleanup(){\n        ;\/\/when override, please, call super\n    }\n    void ResourceNode::afterCleanup(){\n        ;\/\/when override, please, call super\n    }\n    \n    \n    bool ResourceNode::transitionBack(const std::function<void(ResourceNode * newNode, const std::function<void()> & transitionHandle)> & transitionHandle, const std::string & marker){\n        if (_navigationStack.empty())\n            return false;\n        \n        if (!marker.empty())\n            popNavigationStackUntilMarker(marker);\n        \n        \n        _navigationStack.pop();\n        std::string prevPath;\n        if (!_navigationStack.empty()) {\n            prevPath=_navigationStack.top();\n            \n            while (_isNavigationStackMarker(prevPath) && !_navigationStack.empty()) {\n                _navigationStack.pop();\n                prevPath=_navigationStack.top();\n            }\n            \n            return transitionToANodeWithPath(prevPath, transitionHandle, false);\n        }\n        return false;\n    }\n    bool ResourceNode::transitionToANodeWithPath(const std::string & path, const std::function<void(ResourceNode * newNode, const std::function<void()> & transitionHandle)> & transitionHandle, bool isStack){\n        std::string fullPath(mcbPath(path));\n        if (isStack)\n            _navigationStack.push(fullPath);\n        \n        ResourceNode * newNode(create(fullPath));\n        if (!newNode)\n            return false;\n        \n        auto completedHandle([=](){\n            _processCleanup();\n            auto p(getParent());\n            p->removeChild(this);\n            p->addChild(newNode);\n        });\n        \n        if (transitionHandle) {\n            newNode->retain();\n            transitionHandle(newNode, [=]{\n                completedHandle();\n                newNode->release();\n            });\n        }else\n            completedHandle();\n        \n        return true;\n    }\n    \n    void ResourceNode::popNavigationStack(){\n        if (!_navigationStack.empty())\n            _navigationStack.pop();\n    }\n    void ResourceNode::rewindNavigationStack(){\n        while (!_navigationStack.empty())\n            _navigationStack.pop();\n    }\n    void ResourceNode::pushNavigationStackMarker(const std::string & marker){\n        _navigationStack.push(':'+marker);\n    }\n    void ResourceNode::popNavigationStackUntilMarker(const std::string & marker){\n        std::string m(':'+marker);\n        while (!_navigationStack.empty()){\n            if (_navigationStack.top()!=m)\n                _navigationStack.pop();\n            else\n                break;\n        }\n    }\n#pragma mark view builder\n    void ResourceNode::setFactoryForKey(const std::function<cocos2d::CCNode *(cocos2d::CCDictionary *)> & lambda, const std::string & key){\n        _generators[key]=lambda;\n    }\n    std::function<cocos2d::CCNode *(cocos2d::CCDictionary *)> ResourceNode::factoryForKey(const std::string & key){\n        auto it(_generators.find(key));\n        if (it!=_generators.end())\n            return (*it).second;\n        return nullptr;\n    }\n    void ResourceNode::buildViewWithData(cocos2d::CCDictionary * data){\n        if (!data)\n            return;\n        CCArray * children=(CCArray *)data->objectForKey(\"children\");\n        _populateChildren(children, this);\n    }\n    void ResourceNode::_populateChildren(cocos2d::CCArray * children, CCNode * parent){\n        \n        mcbForEachBegin(CCDictionary *, child, children)\n        CCString * typeS((CCString *)child->objectForKey(\"type\"));\n        if (typeS) {\n            std::string type(typeS->m_sString);\n            CCNode * childNode(nullptr);\n            auto lambda(factoryForKey(type));\n            if (lambda)\n                childNode=lambda(child);\n            \n            if (childNode) {\n                \n                Number * tag=(Number *)child->objectForKey(\"tag\");\n                if (tag)\n                    childNode->setTag(*tag);\n                \n                Number * zOrder=(Number *)child->objectForKey(\"zOrder\");\n                \n                if (zOrder)\n                    parent->addChild(childNode, *zOrder);\n                else\n                    parent->addChild(childNode);\n                \n                \n                CCArray * m_children=(CCArray *)child->objectForKey(\"children\");\n                if (m_children)\n                    _populateChildren(m_children, childNode);\n            }\n            \n        }\n        mcbForEachEnd\n    }\n#pragma mark callbacks\n    void ResourceNode::_buttonWithTagPressed(cocos2d::CCObject * button){\n        CCMenuItem * item(dynamic_cast<CCMenuItem *>(button));\n        if (!item)\n            return;\n        buttonWithTagPressed(button, item->getTag());\n    }\n}}<|endoftext|>"}
{"text":"<commit_before>#include <sys\/select.h>\n#include <sys\/socket.h>\n#include <sys\/types.h>\n#include <sys\/uio.h>\n#include <sys\/un.h>\n#include <stdio.h>\n\n#include \"getActiveApplicationName.h\"\n#include \"server.hpp\"\n\nvoid\nKeyRemap4MacBook_server::Server::initialize(void)\n{\n  \/\/ --------------------\n  \/\/ setup thread pool\n  pthread_attr_t attr;\n  pthread_t thread;\n  pthread_attr_init(&attr);\n  pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_DETACHED);\n  for (int i = 0; i < NUM_THREAD; ++i) {\n    pthread_create(&thread, &attr, handleRequestThread, this);\n  }\n\n  \/\/ --------------------\n  makeSocket();\n}\n\nvoid\nKeyRemap4MacBook_server::Server::terminate(void)\n{\n  deleteSocket();\n}\n\nvoid\nKeyRemap4MacBook_server::Server::sendReply(int sock, void *data, size_t size, int error)\n{\n  struct iovec iov[2];\n  iov[0].iov_base = reinterpret_cast<caddr_t>(&error);\n  iov[0].iov_len = sizeof(error);\n  if (size > 0) {\n    iov[1].iov_base = reinterpret_cast<caddr_t>(data);\n    iov[1].iov_len = size;\n  }\n\n  struct msghdr msg;\n  memset(&msg, 0, sizeof(msg));\n  msg.msg_iov = iov;\n  if (size > 0) {\n    msg.msg_iovlen = 2;\n  } else {\n    msg.msg_iovlen = 1;\n  }\n\n  sendmsg(sock, &msg, 0);\n}\n\nvoid\nKeyRemap4MacBook_server::Server::dispatchOperator(int sock)\n{\n  int operation;\n  if (read(sock, &operation, sizeof(operation)) < 0) goto error;\n\n  switch (operation) {\n    case KeyRemap4MacBook_bridge::REQUEST_ACTIVE_APPLICATION_INFO:\n    {\n      KeyRemap4MacBook_bridge::ActiveApplicationInfo::Reply reply;\n      KeyRemap4MacBook_bridge::Error error = do_ActiveApplicationInfo(&reply);\n      sendReply(sock, &reply, sizeof(reply), error);\n      break;\n    }\n    default:\n      goto error;\n  }\n\n  return;\n\nerror:\n  sendReply(sock, NULL, 0, KeyRemap4MacBook_bridge::ERROR);\n}\n\nvoid *\nKeyRemap4MacBook_server::Server::handleRequestThread(void *arg)\n{\n  KeyRemap4MacBook_server::Server *serv = reinterpret_cast<KeyRemap4MacBook_server::Server *>(arg);\n\n  KeyRemap4MacBook_server::Thread::Mutex &mutex = (serv->requestsMutex);\n  KeyRemap4MacBook_server::Thread::Cond &cond = (serv->requestCond);\n  std::queue<int> &queue = (serv->queueRequestSocket);\n\n  for (;;) {\n    mutex.lock();\n    if (queue.empty()) {\n      cond.wait(&mutex);\n      mutex.unlock();\n      continue;\n\n    } else {\n      int sock = queue.front();\n      queue.pop();\n\n      mutex.unlock();\n      (serv->dispatchOperator)(sock);\n      close(sock);\n    }\n  }\n\n  return NULL;\n}\n\nbool\nKeyRemap4MacBook_server::Server::enqueueRequest(int sock)\n{\n  requestsMutex.lock();\n\n  queueRequestSocket.push(sock);\n  requestCond.signal();\n\n  requestsMutex.unlock();\n  return true;\n}\n\nvoid\nKeyRemap4MacBook_server::Server::doLoop(void)\n{\n  initialize();\n\n  listen(listenSocket, 128);\n\n  exitLoopFlag = false;\n  while (! exitLoopFlag) {\n    fd_set readfds;\n    FD_ZERO(&readfds);\n    FD_SET(listenSocket, &readfds);\n\n    int nfds = listenSocket + 1;\n    struct timeval timeout;\n    timeout.tv_sec = 1;\n    timeout.tv_usec = 0;\n    if (select(nfds, &readfds, NULL, NULL, &timeout) == -1) {\n      return;\n    }\n\n    if (FD_ISSET(listenSocket, &readfds)) {\n      struct sockaddr_un addr;\n      socklen_t addrlen;\n\n      int s = accept(listenSocket, reinterpret_cast<struct sockaddr *>(&addr), &addrlen);\n      if (s < 0) {\n        return;\n      }\n      enqueueRequest(s);\n    }\n  }\n\n  terminate();\n}\n\n\/\/ --------------------------------------------------\nbool\nKeyRemap4MacBook_server::Server::makeSocket(void)\n{\n  deleteSocket();\n\n  listenSocket = socket(PF_LOCAL, SOCK_STREAM, 0);\n  if (listenSocket < 0) return false;\n\n  struct sockaddr_un listenSocketAddr;\n  memset(&listenSocketAddr, 0, sizeof(listenSocketAddr));\n  listenSocketAddr.sun_len = sizeof(listenSocketAddr);\n  listenSocketAddr.sun_family = AF_LOCAL;\n  snprintf(listenSocketAddr.sun_path, sizeof(listenSocketAddr.sun_path), KeyRemap4MacBook_bridge::socketPath);\n\n  if (bind(listenSocket, reinterpret_cast<struct sockaddr *>(&listenSocketAddr), sizeof(listenSocketAddr)) < 0) return false;\n\n  return true;\n}\n\nvoid\nKeyRemap4MacBook_server::Server::deleteSocket(void)\n{\n  unlink(KeyRemap4MacBook_bridge::socketPath);\n}\n\n\n\/\/ --------------------------------------------------\nKeyRemap4MacBook_bridge::Error\nKeyRemap4MacBook_server::Server::do_ActiveApplicationInfo(KeyRemap4MacBook_bridge::ActiveApplicationInfo::Reply *reply)\n{\n  if (! reply) return KeyRemap4MacBook_bridge::ERROR;\n\n  char applicationName[128];\n  getActiveApplicationName(applicationName, sizeof(applicationName));\n\n  reply->is_emacs = false;\n  reply->is_terminal = false;\n  reply->is_virtualmachine = false;\n\n  if (strcmp(applicationName, \"org.gnu.Emacs\") == 0) {\n    reply->is_emacs = true;\n  }\n  if (strcmp(applicationName, \"com.apple.Terminal\") == 0 ||\n      strcmp(applicationName, \"iTerm\") == 0) {\n    reply->is_terminal = true;\n  }\n  if (strcmp(applicationName, \"com.vmware.fusion\") == 0 ||\n      strcmp(applicationName, \"com.parallels.desktop\") == 0) {\n    reply->is_virtualmachine = true;\n  }\n\n  return KeyRemap4MacBook_bridge::SUCCESS;\n}\n<commit_msg>support AquamacsEmacs<commit_after>#include <sys\/select.h>\n#include <sys\/socket.h>\n#include <sys\/types.h>\n#include <sys\/uio.h>\n#include <sys\/un.h>\n#include <stdio.h>\n\n#include \"getActiveApplicationName.h\"\n#include \"server.hpp\"\n\nvoid\nKeyRemap4MacBook_server::Server::initialize(void)\n{\n  \/\/ --------------------\n  \/\/ setup thread pool\n  pthread_attr_t attr;\n  pthread_t thread;\n  pthread_attr_init(&attr);\n  pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_DETACHED);\n  for (int i = 0; i < NUM_THREAD; ++i) {\n    pthread_create(&thread, &attr, handleRequestThread, this);\n  }\n\n  \/\/ --------------------\n  makeSocket();\n}\n\nvoid\nKeyRemap4MacBook_server::Server::terminate(void)\n{\n  deleteSocket();\n}\n\nvoid\nKeyRemap4MacBook_server::Server::sendReply(int sock, void *data, size_t size, int error)\n{\n  struct iovec iov[2];\n  iov[0].iov_base = reinterpret_cast<caddr_t>(&error);\n  iov[0].iov_len = sizeof(error);\n  if (size > 0) {\n    iov[1].iov_base = reinterpret_cast<caddr_t>(data);\n    iov[1].iov_len = size;\n  }\n\n  struct msghdr msg;\n  memset(&msg, 0, sizeof(msg));\n  msg.msg_iov = iov;\n  if (size > 0) {\n    msg.msg_iovlen = 2;\n  } else {\n    msg.msg_iovlen = 1;\n  }\n\n  sendmsg(sock, &msg, 0);\n}\n\nvoid\nKeyRemap4MacBook_server::Server::dispatchOperator(int sock)\n{\n  int operation;\n  if (read(sock, &operation, sizeof(operation)) < 0) goto error;\n\n  switch (operation) {\n    case KeyRemap4MacBook_bridge::REQUEST_ACTIVE_APPLICATION_INFO:\n    {\n      KeyRemap4MacBook_bridge::ActiveApplicationInfo::Reply reply;\n      KeyRemap4MacBook_bridge::Error error = do_ActiveApplicationInfo(&reply);\n      sendReply(sock, &reply, sizeof(reply), error);\n      break;\n    }\n    default:\n      goto error;\n  }\n\n  return;\n\nerror:\n  sendReply(sock, NULL, 0, KeyRemap4MacBook_bridge::ERROR);\n}\n\nvoid *\nKeyRemap4MacBook_server::Server::handleRequestThread(void *arg)\n{\n  KeyRemap4MacBook_server::Server *serv = reinterpret_cast<KeyRemap4MacBook_server::Server *>(arg);\n\n  KeyRemap4MacBook_server::Thread::Mutex &mutex = (serv->requestsMutex);\n  KeyRemap4MacBook_server::Thread::Cond &cond = (serv->requestCond);\n  std::queue<int> &queue = (serv->queueRequestSocket);\n\n  for (;;) {\n    mutex.lock();\n    if (queue.empty()) {\n      cond.wait(&mutex);\n      mutex.unlock();\n      continue;\n\n    } else {\n      int sock = queue.front();\n      queue.pop();\n\n      mutex.unlock();\n      (serv->dispatchOperator)(sock);\n      close(sock);\n    }\n  }\n\n  return NULL;\n}\n\nbool\nKeyRemap4MacBook_server::Server::enqueueRequest(int sock)\n{\n  requestsMutex.lock();\n\n  queueRequestSocket.push(sock);\n  requestCond.signal();\n\n  requestsMutex.unlock();\n  return true;\n}\n\nvoid\nKeyRemap4MacBook_server::Server::doLoop(void)\n{\n  initialize();\n\n  listen(listenSocket, 128);\n\n  exitLoopFlag = false;\n  while (! exitLoopFlag) {\n    fd_set readfds;\n    FD_ZERO(&readfds);\n    FD_SET(listenSocket, &readfds);\n\n    int nfds = listenSocket + 1;\n    struct timeval timeout;\n    timeout.tv_sec = 1;\n    timeout.tv_usec = 0;\n    if (select(nfds, &readfds, NULL, NULL, &timeout) == -1) {\n      return;\n    }\n\n    if (FD_ISSET(listenSocket, &readfds)) {\n      struct sockaddr_un addr;\n      socklen_t addrlen;\n\n      int s = accept(listenSocket, reinterpret_cast<struct sockaddr *>(&addr), &addrlen);\n      if (s < 0) {\n        return;\n      }\n      enqueueRequest(s);\n    }\n  }\n\n  terminate();\n}\n\n\/\/ --------------------------------------------------\nbool\nKeyRemap4MacBook_server::Server::makeSocket(void)\n{\n  deleteSocket();\n\n  listenSocket = socket(PF_LOCAL, SOCK_STREAM, 0);\n  if (listenSocket < 0) return false;\n\n  struct sockaddr_un listenSocketAddr;\n  memset(&listenSocketAddr, 0, sizeof(listenSocketAddr));\n  listenSocketAddr.sun_len = sizeof(listenSocketAddr);\n  listenSocketAddr.sun_family = AF_LOCAL;\n  snprintf(listenSocketAddr.sun_path, sizeof(listenSocketAddr.sun_path), KeyRemap4MacBook_bridge::socketPath);\n\n  if (bind(listenSocket, reinterpret_cast<struct sockaddr *>(&listenSocketAddr), sizeof(listenSocketAddr)) < 0) return false;\n\n  return true;\n}\n\nvoid\nKeyRemap4MacBook_server::Server::deleteSocket(void)\n{\n  unlink(KeyRemap4MacBook_bridge::socketPath);\n}\n\n\n\/\/ --------------------------------------------------\nKeyRemap4MacBook_bridge::Error\nKeyRemap4MacBook_server::Server::do_ActiveApplicationInfo(KeyRemap4MacBook_bridge::ActiveApplicationInfo::Reply *reply)\n{\n  if (! reply) return KeyRemap4MacBook_bridge::ERROR;\n\n  char applicationName[128];\n  getActiveApplicationName(applicationName, sizeof(applicationName));\n\n  reply->is_emacs = false;\n  reply->is_terminal = false;\n  reply->is_virtualmachine = false;\n\n  if (strcmp(applicationName, \"org.gnu.Emacs\") == 0 ||\n      strcmp(applicationName, \"org.gnu.AquamacsEmacs\") == 0) {\n    reply->is_emacs = true;\n  }\n  if (strcmp(applicationName, \"com.apple.Terminal\") == 0 ||\n      strcmp(applicationName, \"iTerm\") == 0) {\n    reply->is_terminal = true;\n  }\n  if (strcmp(applicationName, \"com.vmware.fusion\") == 0 ||\n      strcmp(applicationName, \"com.parallels.desktop\") == 0) {\n    reply->is_virtualmachine = true;\n  }\n\n  return KeyRemap4MacBook_bridge::SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"sitkImageFileReader.h\"\n#include <itkImageIOBase.h>\n#include <itkImageFileReader.h>\n\nnamespace itk {\n  namespace simple {\n    \n    ImageFileReader& ImageFileReader::SetFilename ( std::string fn ) {\n      this->m_Filename = fn;\n      return *this;\n    }\n\n    std::string ImageFileReader::GetFilename() {\n      return this->m_Filename;\n    }\n\n    Image::Pointer ImageFileReader::Execute () {\n      Image::Pointer image = NULL;\n      \/\/ Figure out what type of image we have\n      typedef itk::Image<signed short,3> ImageType;\n      typedef itk::ImageFileReader<ImageType> Reader;\n      Reader::Pointer reader = Reader::New();\n      reader->SetFileName ( this->m_Filename.c_str() );\n      reader->UpdateOutputInformation();\n\n      switch ( reader->GetImageIO()->GetComponentType() ) {\n      case itk::ImageIOBase::FLOAT:\n        image = ExecuteInternal<float> ( );\n        break;\n      case itk::ImageIOBase::UCHAR:\n        image = ExecuteInternal<uint8_t> ( );\n        break;\n      default:\n      case itk::ImageIOBase::SHORT:\n        \n        image = ExecuteInternal<int16_t> ( );\n        break;\n      case itk::ImageIOBase::INT:\n        image = ExecuteInternal<int32_t> ( );\n        break;\n      }\n    return image;\n    }\n\n  template <class T>\n  Image::Pointer ImageFileReader::ExecuteInternal( void ) {\n    Image::Pointer image = NULL;\n    typedef itk::Image<T,3> ImageType;\n    typedef itk::ImageFileReader<ImageType> Reader;\n    typename Reader::Pointer reader = Reader::New();\n    reader->SetFileName( this->m_Filename.c_str() );\n    reader->Update();\n    image = new Image( reader->GetOutput() );\n    reader->GetOutput()->DisconnectPipeline();\n    return image;\n  }\n      \n\n      \n\n    \n\n  }\n}\n<commit_msg>Added #pragma to remove warning<commit_after>#ifdef _MFC_VER\n#pragma warning(disable:4996)\n#endif\n\n#include \"sitkImageFileReader.h\"\n#include <itkImageIOBase.h>\n#include <itkImageFileReader.h>\n\n\nnamespace itk {\n  namespace simple {\n    \n    ImageFileReader& ImageFileReader::SetFilename ( std::string fn ) {\n      this->m_Filename = fn;\n      return *this;\n    }\n\n    std::string ImageFileReader::GetFilename() {\n      return this->m_Filename;\n    }\n\n    Image::Pointer ImageFileReader::Execute () {\n      Image::Pointer image = NULL;\n      \/\/ Figure out what type of image we have\n      typedef itk::Image<signed short,3> ImageType;\n      typedef itk::ImageFileReader<ImageType> Reader;\n      Reader::Pointer reader = Reader::New();\n      reader->SetFileName ( this->m_Filename.c_str() );\n      reader->UpdateOutputInformation();\n\n      switch ( reader->GetImageIO()->GetComponentType() ) {\n      case itk::ImageIOBase::FLOAT:\n        image = ExecuteInternal<float> ( );\n        break;\n      case itk::ImageIOBase::UCHAR:\n        image = ExecuteInternal<uint8_t> ( );\n        break;\n      default:\n      case itk::ImageIOBase::SHORT:\n        \n        image = ExecuteInternal<int16_t> ( );\n        break;\n      case itk::ImageIOBase::INT:\n        image = ExecuteInternal<int32_t> ( );\n        break;\n      }\n    return image;\n    }\n\n  template <class T>\n  Image::Pointer ImageFileReader::ExecuteInternal( void ) {\n    Image::Pointer image = NULL;\n    typedef itk::Image<T,3> ImageType;\n    typedef itk::ImageFileReader<ImageType> Reader;\n    typename Reader::Pointer reader = Reader::New();\n    reader->SetFileName( this->m_Filename.c_str() );\n    reader->Update();\n    image = new Image( reader->GetOutput() );\n    reader->GetOutput()->DisconnectPipeline();\n    return image;\n  }\n      \n\n      \n\n    \n\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"..\/USB.h\"\n#include \"resource.h\"\n#include \"Config.h\"\n#include \"..\/deviceproxy.h\"\n#include \"..\/usb-pad\/padproxy.h\"\n#include \"..\/usb-mic\/audiodeviceproxy.h\"\n#include \"..\/configuration.h\"\n\nHINSTANCE hInst;\nextern bool configChanged;\n\nvoid SysMessageA(const char *fmt, ...) {\n\tva_list list;\n\tchar tmp[512];\n\n\tva_start(list, fmt);\n\tvsprintf_s(tmp, 512, fmt, list);\n\tva_end(list);\n\tMessageBoxA(0, tmp, \"Qemu USB Msg\", 0);\n}\n\nvoid SysMessageW(const wchar_t *fmt, ...) {\n\tva_list list;\n\twchar_t tmp[512];\n\n\tva_start(list, fmt);\n\tvswprintf_s(tmp, 512, fmt, list);\n\tva_end(list);\n\tMessageBoxW(0, tmp, L\"Qemu USB Msg\", 0);\n}\n\nvoid SelChangedAPI(HWND hW, int port)\n{\n\tint sel = SendDlgItemMessage(hW, port ? IDC_COMBO_API1 : IDC_COMBO_API2, CB_GETCURSEL, 0, 0);\n\tint devtype = SendDlgItemMessage(hW, port ? IDC_COMBO1 : IDC_COMBO2, CB_GETCURSEL, 0, 0);\n\tif (devtype == 0)\n\t\treturn;\n\tdevtype--;\n\tauto& rd = RegisterDevice::instance();\n\tauto devName = rd.Name(devtype);\n\tauto apis = rd.Device(devtype)->ListAPIs();\n\tauto it = apis.begin();\n\tstd::advance(it, sel);\n\tchangedAPIs[std::make_pair(port, devName)] = *it;\n}\n\nvoid PopulateAPIs(HWND hW, int port)\n{\n\tOSDebugOut(TEXT(\"Populate api %d\\n\"), port);\n\tSendDlgItemMessage(hW, port ? IDC_COMBO_API1 : IDC_COMBO_API2, CB_RESETCONTENT, 0, 0);\n\tint devtype = SendDlgItemMessage(hW, port ? IDC_COMBO1 : IDC_COMBO2, CB_GETCURSEL, 0, 0);\n\tif (devtype == 0)\n\t\treturn;\n\tdevtype--;\n\tauto& rd = RegisterDevice::instance();\n\tauto dev = rd.Device(devtype);\n\tauto devName = rd.Name(devtype);\n\tauto apis = dev->ListAPIs();\n\n\tstd::string selApi = GetSelectedAPI(std::make_pair(port, devName));\n\n\tstd::string var;\n\tif (LoadSetting(nullptr, port, rd.Name(devtype), N_DEVICE_API, var))\n\t\tOSDebugOut(L\"Current API: %S\\n\", var.c_str());\n\telse\n\t{\n\t\tif (apis.begin() != apis.end())\n\t\t{\n\t\t\tselApi = *apis.begin();\n\t\t\tchangedAPIs[std::make_pair(port, devName)] = selApi;\n\t\t}\n\t}\n\n\tint i = 0, sel = 0;\n\tfor (auto& api : apis)\n\t{\n\t\tauto name = dev->LongAPIName(api);\n\t\tif (!name)\n\t\t\tcontinue;\n\t\tSendDlgItemMessageW(hW, port ? IDC_COMBO_API1 : IDC_COMBO_API2, CB_ADDSTRING, 0, (LPARAM)name);\n\t\tif (api == var)\n\t\t\tsel = i;\n\t\ti++;\n\t}\n\tSendDlgItemMessage(hW, port ? IDC_COMBO_API1 : IDC_COMBO_API2, CB_SETCURSEL, sel, 0);\n}\n\nBOOL CALLBACK ConfigureDlgProc(HWND hW, UINT uMsg, WPARAM wParam, LPARAM lParam) {\n\n\tint port;\n\tswitch(uMsg) {\n\t\tcase WM_INITDIALOG:\n\t\t\tSendDlgItemMessageA(hW, IDC_BUILD_DATE, WM_SETTEXT, 0, (LPARAM)__DATE__ \" \" __TIME__);\n\t\t\tLoadConfig();\n\t\t\tCheckDlgButton(hW, IDC_LOGGING, conf.Log);\n\t\t\t\/\/Selected emulated devices.\n\t\t\tSendDlgItemMessageA(hW, IDC_COMBO1, CB_ADDSTRING, 0, (LPARAM)\"None\");\n\t\t\tSendDlgItemMessageA(hW, IDC_COMBO2, CB_ADDSTRING, 0, (LPARAM)\"None\");\n\n\t\t\t{\n\t\t\t\tauto& rd = RegisterDevice::instance();\n\t\t\t\tint i = 0, p1 = 0, p2 = 0;\n\t\t\t\tfor (auto& name : rd.Names())\n\t\t\t\t{\n\t\t\t\t\ti++; \/\/jump over \"None\"\n\t\t\t\t\tauto dev = rd.Device(name);\n\t\t\t\t\tSendDlgItemMessageW(hW, IDC_COMBO1, CB_ADDSTRING, 0, (LPARAM)dev->Name());\n\t\t\t\t\tSendDlgItemMessageW(hW, IDC_COMBO2, CB_ADDSTRING, 0, (LPARAM)dev->Name());\n\n\t\t\t\t\t\/\/Port 1 aka device\/player 1\n\t\t\t\t\tif (conf.Port[1] == name)\n\t\t\t\t\t\tp1 = i;\n\t\t\t\t\t\/\/Port 0 aka device\/player 2\n\t\t\t\t\tif (conf.Port[0] == name)\n\t\t\t\t\t\tp2 = i;\n\t\t\t\t}\n\t\t\t\tSendDlgItemMessage(hW, IDC_COMBO1, CB_SETCURSEL, p1, 0);\n\t\t\t\tSendDlgItemMessage(hW, IDC_COMBO2, CB_SETCURSEL, p2, 0);\n\t\t\t\tPopulateAPIs(hW, 0);\n\t\t\t\tPopulateAPIs(hW, 1);\n\t\t\t}\n\n\t\t\tSendDlgItemMessageA(hW, IDC_COMBO_WHEEL_TYPE1, CB_ADDSTRING, 0, (LPARAM)\"Driving Force\");\n\t\t\tSendDlgItemMessageA(hW, IDC_COMBO_WHEEL_TYPE1, CB_ADDSTRING, 0, (LPARAM)\"Driving Force Pro\");\n\t\t\tSendDlgItemMessageA(hW, IDC_COMBO_WHEEL_TYPE1, CB_ADDSTRING, 0, (LPARAM)\"Driving Force Pro (rev11.02)\");\n\t\t\tSendDlgItemMessageA(hW, IDC_COMBO_WHEEL_TYPE1, CB_ADDSTRING, 0, (LPARAM)\"GT Force\");\n\t\t\tSendDlgItemMessage(hW, IDC_COMBO_WHEEL_TYPE1, CB_SETCURSEL, conf.WheelType[PLAYER_ONE_PORT], 0);\n\n\t\t\tSendDlgItemMessageA(hW, IDC_COMBO_WHEEL_TYPE2, CB_ADDSTRING, 0, (LPARAM)\"Driving Force\");\n\t\t\tSendDlgItemMessageA(hW, IDC_COMBO_WHEEL_TYPE2, CB_ADDSTRING, 0, (LPARAM)\"Driving Force Pro\");\n\t\t\tSendDlgItemMessageA(hW, IDC_COMBO_WHEEL_TYPE2, CB_ADDSTRING, 0, (LPARAM)\"Driving Force Pro (rev11.02)\");\n\t\t\tSendDlgItemMessageA(hW, IDC_COMBO_WHEEL_TYPE2, CB_ADDSTRING, 0, (LPARAM)\"GT Force\");\n\t\t\tSendDlgItemMessage(hW, IDC_COMBO_WHEEL_TYPE2, CB_SETCURSEL, conf.WheelType[PLAYER_TWO_PORT], 0);\n\n\t\t\treturn TRUE;\n\t\t\tbreak;\n\t\tcase WM_COMMAND:\n\t\t\tswitch (HIWORD(wParam))\n\t\t\t{\n\t\t\tcase CBN_SELCHANGE:\n\t\t\t\tswitch (LOWORD(wParam)) {\n\t\t\t\tcase IDC_COMBO_API1:\n\t\t\t\tcase IDC_COMBO_API2:\n\t\t\t\t\tport = (LOWORD(wParam) == IDC_COMBO_API1) ? 1 : 0;\n\t\t\t\t\tSelChangedAPI(hW, port);\n\t\t\t\t\tbreak;\n\t\t\t\tcase IDC_COMBO1:\n\t\t\t\tcase IDC_COMBO2:\n\t\t\t\t\tport = (LOWORD(wParam) == IDC_COMBO1) ? 1 : 0;\n\t\t\t\t\tPopulateAPIs(hW, port);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\tbreak;\n\t\t\tcase BN_CLICKED:\n\t\t\t\tswitch(LOWORD(wParam)) {\n\t\t\t\tcase IDC_CONFIGURE1:\n\t\t\t\tcase IDC_CONFIGURE2:\n\t\t\t\t{\n\t\t\t\t\tLRESULT devtype, apitype;\n\t\t\t\t\tport = (LOWORD(wParam) == IDC_CONFIGURE1) ? 1 : 0;\n\t\t\t\t\tdevtype = SendDlgItemMessage(hW, port ? IDC_COMBO1 : IDC_COMBO2, CB_GETCURSEL, 0, 0);\n\t\t\t\t\tapitype = SendDlgItemMessage(hW, port ? IDC_COMBO_API1 : IDC_COMBO_API2, CB_GETCURSEL, 0, 0);\n\n\t\t\t\t\tif (devtype > 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tdevtype--;\n\t\t\t\t\t\tauto device = RegisterDevice::instance().Device(devtype);\n\t\t\t\t\t\tif (device)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tauto list = device->ListAPIs();\n\t\t\t\t\t\t\tauto it = list.begin();\n\t\t\t\t\t\t\tstd::advance(it, apitype);\n\t\t\t\t\t\t\tif (it == list.end())\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tstd::string api = *it;\n\t\t\t\t\t\t\tWin32Handles handles(hInst, hW);\n\t\t\t\t\t\t\tif (device->Configure(port, api, &handles) == RESULT_FAILED)\n\t\t\t\t\t\t\t\tSysMessage(TEXT(\"Some settings may not have been saved!\\n\"));\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t\tcase IDCANCEL:\n\t\t\t\t\tEndDialog(hW, TRUE);\n\t\t\t\t\treturn TRUE;\n\t\t\t\tcase IDOK:\n\t\t\t\t\tconf.Log = IsDlgButtonChecked(hW, IDC_LOGGING);\n\t\t\t\t\t{\n\t\t\t\t\t\tauto& regInst = RegisterDevice::instance();\n\t\t\t\t\t\tint i;\n\t\t\t\t\t\t\/\/device type\n\t\t\t\t\t\ti = SendDlgItemMessage(hW, IDC_COMBO1, CB_GETCURSEL, 0, 0);\n\t\t\t\t\t\tconf.Port[1] = regInst.Name(i - 1);\n\t\t\t\t\t\ti = SendDlgItemMessage(hW, IDC_COMBO2, CB_GETCURSEL, 0, 0);\n\t\t\t\t\t\tconf.Port[0] = regInst.Name(i - 1);\n\t\t\t\t\t}\n\t\t\t\t\t\/\/wheel type\n\t\t\t\t\tconf.WheelType[PLAYER_ONE_PORT] = SendDlgItemMessage(hW, IDC_COMBO_WHEEL_TYPE1, CB_GETCURSEL, 0, 0);\n\t\t\t\t\tconf.WheelType[PLAYER_TWO_PORT] = SendDlgItemMessage(hW, IDC_COMBO_WHEEL_TYPE2, CB_GETCURSEL, 0, 0);\n\n\t\t\t\t\tSaveConfig();\n\t\t\t\t\tCreateDevices();\n\t\t\t\t\tEndDialog(hW, RESULT_OK);\n\t\t\t\t\tconfigChanged = true;\n\t\t\t\t\treturn TRUE;\n\t\t\t\t}\n\t\t\t}\n\t}\n\n\treturn FALSE;\n}\n\n\nEXPORT_C_(BOOL) AboutDlgProc(HWND hW, UINT uMsg, WPARAM wParam, LPARAM lParam) {\n\tswitch(uMsg) {\n\t\tcase WM_INITDIALOG:\n\t\t\treturn TRUE;\n\n\t\tcase WM_COMMAND:\n\t\t\tswitch(LOWORD(wParam)) {\n\t\t\t\tcase IDOK:\n\t\t\t\t\tEndDialog(hW, FALSE);\n\t\t\t\t\treturn TRUE;\n\t\t\t}\n\t}\n\treturn FALSE;\n}\n\nEXPORT_C_(void) USBconfigure() {\n    RegisterAPIs();\n    DialogBox(hInst,\n              MAKEINTRESOURCE(IDD_CONFIG),\n              GetActiveWindow(),\n              (DLGPROC)ConfigureDlgProc);\n}\n\nEXPORT_C_(void) USBabout() {\n    DialogBox(hInst,\n              MAKEINTRESOURCE(IDD_ABOUT),\n              GetActiveWindow(),\n              (DLGPROC)AboutDlgProc);\n}\n\nBOOL APIENTRY DllMain(HANDLE hModule,\n                      DWORD  dwReason,\n                      LPVOID lpReserved) {\n\thInst = (HINSTANCE)hModule;\n\treturn TRUE;\n}\n<commit_msg>win32: register devices in Configure()<commit_after>#include \"..\/USB.h\"\n#include \"resource.h\"\n#include \"Config.h\"\n#include \"..\/deviceproxy.h\"\n#include \"..\/usb-pad\/padproxy.h\"\n#include \"..\/usb-mic\/audiodeviceproxy.h\"\n#include \"..\/configuration.h\"\n\nHINSTANCE hInst;\nextern bool configChanged;\n\nvoid SysMessageA(const char *fmt, ...) {\n\tva_list list;\n\tchar tmp[512];\n\n\tva_start(list, fmt);\n\tvsprintf_s(tmp, 512, fmt, list);\n\tva_end(list);\n\tMessageBoxA(0, tmp, \"Qemu USB Msg\", 0);\n}\n\nvoid SysMessageW(const wchar_t *fmt, ...) {\n\tva_list list;\n\twchar_t tmp[512];\n\n\tva_start(list, fmt);\n\tvswprintf_s(tmp, 512, fmt, list);\n\tva_end(list);\n\tMessageBoxW(0, tmp, L\"Qemu USB Msg\", 0);\n}\n\nvoid SelChangedAPI(HWND hW, int port)\n{\n\tint sel = SendDlgItemMessage(hW, port ? IDC_COMBO_API1 : IDC_COMBO_API2, CB_GETCURSEL, 0, 0);\n\tint devtype = SendDlgItemMessage(hW, port ? IDC_COMBO1 : IDC_COMBO2, CB_GETCURSEL, 0, 0);\n\tif (devtype == 0)\n\t\treturn;\n\tdevtype--;\n\tauto& rd = RegisterDevice::instance();\n\tauto devName = rd.Name(devtype);\n\tauto apis = rd.Device(devtype)->ListAPIs();\n\tauto it = apis.begin();\n\tstd::advance(it, sel);\n\tchangedAPIs[std::make_pair(port, devName)] = *it;\n}\n\nvoid PopulateAPIs(HWND hW, int port)\n{\n\tOSDebugOut(TEXT(\"Populate api %d\\n\"), port);\n\tSendDlgItemMessage(hW, port ? IDC_COMBO_API1 : IDC_COMBO_API2, CB_RESETCONTENT, 0, 0);\n\tint devtype = SendDlgItemMessage(hW, port ? IDC_COMBO1 : IDC_COMBO2, CB_GETCURSEL, 0, 0);\n\tif (devtype == 0)\n\t\treturn;\n\tdevtype--;\n\tauto& rd = RegisterDevice::instance();\n\tauto dev = rd.Device(devtype);\n\tauto devName = rd.Name(devtype);\n\tauto apis = dev->ListAPIs();\n\n\tstd::string selApi = GetSelectedAPI(std::make_pair(port, devName));\n\n\tstd::string var;\n\tif (LoadSetting(nullptr, port, rd.Name(devtype), N_DEVICE_API, var))\n\t\tOSDebugOut(L\"Current API: %S\\n\", var.c_str());\n\telse\n\t{\n\t\tif (apis.begin() != apis.end())\n\t\t{\n\t\t\tselApi = *apis.begin();\n\t\t\tchangedAPIs[std::make_pair(port, devName)] = selApi;\n\t\t}\n\t}\n\n\tint i = 0, sel = 0;\n\tfor (auto& api : apis)\n\t{\n\t\tauto name = dev->LongAPIName(api);\n\t\tif (!name)\n\t\t\tcontinue;\n\t\tSendDlgItemMessageW(hW, port ? IDC_COMBO_API1 : IDC_COMBO_API2, CB_ADDSTRING, 0, (LPARAM)name);\n\t\tif (api == var)\n\t\t\tsel = i;\n\t\ti++;\n\t}\n\tSendDlgItemMessage(hW, port ? IDC_COMBO_API1 : IDC_COMBO_API2, CB_SETCURSEL, sel, 0);\n}\n\nBOOL CALLBACK ConfigureDlgProc(HWND hW, UINT uMsg, WPARAM wParam, LPARAM lParam) {\n\n\tint port;\n\tswitch(uMsg) {\n\t\tcase WM_INITDIALOG:\n\t\t\tSendDlgItemMessageA(hW, IDC_BUILD_DATE, WM_SETTEXT, 0, (LPARAM)__DATE__ \" \" __TIME__);\n\t\t\tLoadConfig();\n\t\t\tCheckDlgButton(hW, IDC_LOGGING, conf.Log);\n\t\t\t\/\/Selected emulated devices.\n\t\t\tSendDlgItemMessageA(hW, IDC_COMBO1, CB_ADDSTRING, 0, (LPARAM)\"None\");\n\t\t\tSendDlgItemMessageA(hW, IDC_COMBO2, CB_ADDSTRING, 0, (LPARAM)\"None\");\n\n\t\t\t{\n\t\t\t\tauto& rd = RegisterDevice::instance();\n\t\t\t\tint i = 0, p1 = 0, p2 = 0;\n\t\t\t\tfor (auto& name : rd.Names())\n\t\t\t\t{\n\t\t\t\t\ti++; \/\/jump over \"None\"\n\t\t\t\t\tauto dev = rd.Device(name);\n\t\t\t\t\tSendDlgItemMessageW(hW, IDC_COMBO1, CB_ADDSTRING, 0, (LPARAM)dev->Name());\n\t\t\t\t\tSendDlgItemMessageW(hW, IDC_COMBO2, CB_ADDSTRING, 0, (LPARAM)dev->Name());\n\n\t\t\t\t\t\/\/Port 1 aka device\/player 1\n\t\t\t\t\tif (conf.Port[1] == name)\n\t\t\t\t\t\tp1 = i;\n\t\t\t\t\t\/\/Port 0 aka device\/player 2\n\t\t\t\t\tif (conf.Port[0] == name)\n\t\t\t\t\t\tp2 = i;\n\t\t\t\t}\n\t\t\t\tSendDlgItemMessage(hW, IDC_COMBO1, CB_SETCURSEL, p1, 0);\n\t\t\t\tSendDlgItemMessage(hW, IDC_COMBO2, CB_SETCURSEL, p2, 0);\n\t\t\t\tPopulateAPIs(hW, 0);\n\t\t\t\tPopulateAPIs(hW, 1);\n\t\t\t}\n\n\t\t\tSendDlgItemMessageA(hW, IDC_COMBO_WHEEL_TYPE1, CB_ADDSTRING, 0, (LPARAM)\"Driving Force\");\n\t\t\tSendDlgItemMessageA(hW, IDC_COMBO_WHEEL_TYPE1, CB_ADDSTRING, 0, (LPARAM)\"Driving Force Pro\");\n\t\t\tSendDlgItemMessageA(hW, IDC_COMBO_WHEEL_TYPE1, CB_ADDSTRING, 0, (LPARAM)\"Driving Force Pro (rev11.02)\");\n\t\t\tSendDlgItemMessageA(hW, IDC_COMBO_WHEEL_TYPE1, CB_ADDSTRING, 0, (LPARAM)\"GT Force\");\n\t\t\tSendDlgItemMessage(hW, IDC_COMBO_WHEEL_TYPE1, CB_SETCURSEL, conf.WheelType[PLAYER_ONE_PORT], 0);\n\n\t\t\tSendDlgItemMessageA(hW, IDC_COMBO_WHEEL_TYPE2, CB_ADDSTRING, 0, (LPARAM)\"Driving Force\");\n\t\t\tSendDlgItemMessageA(hW, IDC_COMBO_WHEEL_TYPE2, CB_ADDSTRING, 0, (LPARAM)\"Driving Force Pro\");\n\t\t\tSendDlgItemMessageA(hW, IDC_COMBO_WHEEL_TYPE2, CB_ADDSTRING, 0, (LPARAM)\"Driving Force Pro (rev11.02)\");\n\t\t\tSendDlgItemMessageA(hW, IDC_COMBO_WHEEL_TYPE2, CB_ADDSTRING, 0, (LPARAM)\"GT Force\");\n\t\t\tSendDlgItemMessage(hW, IDC_COMBO_WHEEL_TYPE2, CB_SETCURSEL, conf.WheelType[PLAYER_TWO_PORT], 0);\n\n\t\t\treturn TRUE;\n\t\t\tbreak;\n\t\tcase WM_COMMAND:\n\t\t\tswitch (HIWORD(wParam))\n\t\t\t{\n\t\t\tcase CBN_SELCHANGE:\n\t\t\t\tswitch (LOWORD(wParam)) {\n\t\t\t\tcase IDC_COMBO_API1:\n\t\t\t\tcase IDC_COMBO_API2:\n\t\t\t\t\tport = (LOWORD(wParam) == IDC_COMBO_API1) ? 1 : 0;\n\t\t\t\t\tSelChangedAPI(hW, port);\n\t\t\t\t\tbreak;\n\t\t\t\tcase IDC_COMBO1:\n\t\t\t\tcase IDC_COMBO2:\n\t\t\t\t\tport = (LOWORD(wParam) == IDC_COMBO1) ? 1 : 0;\n\t\t\t\t\tPopulateAPIs(hW, port);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\tbreak;\n\t\t\tcase BN_CLICKED:\n\t\t\t\tswitch(LOWORD(wParam)) {\n\t\t\t\tcase IDC_CONFIGURE1:\n\t\t\t\tcase IDC_CONFIGURE2:\n\t\t\t\t{\n\t\t\t\t\tLRESULT devtype, apitype;\n\t\t\t\t\tport = (LOWORD(wParam) == IDC_CONFIGURE1) ? 1 : 0;\n\t\t\t\t\tdevtype = SendDlgItemMessage(hW, port ? IDC_COMBO1 : IDC_COMBO2, CB_GETCURSEL, 0, 0);\n\t\t\t\t\tapitype = SendDlgItemMessage(hW, port ? IDC_COMBO_API1 : IDC_COMBO_API2, CB_GETCURSEL, 0, 0);\n\n\t\t\t\t\tif (devtype > 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tdevtype--;\n\t\t\t\t\t\tauto device = RegisterDevice::instance().Device(devtype);\n\t\t\t\t\t\tif (device)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tauto list = device->ListAPIs();\n\t\t\t\t\t\t\tauto it = list.begin();\n\t\t\t\t\t\t\tstd::advance(it, apitype);\n\t\t\t\t\t\t\tif (it == list.end())\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tstd::string api = *it;\n\t\t\t\t\t\t\tWin32Handles handles(hInst, hW);\n\t\t\t\t\t\t\tif (device->Configure(port, api, &handles) == RESULT_FAILED)\n\t\t\t\t\t\t\t\tSysMessage(TEXT(\"Some settings may not have been saved!\\n\"));\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t\tcase IDCANCEL:\n\t\t\t\t\tEndDialog(hW, TRUE);\n\t\t\t\t\treturn TRUE;\n\t\t\t\tcase IDOK:\n\t\t\t\t\tconf.Log = IsDlgButtonChecked(hW, IDC_LOGGING);\n\t\t\t\t\t{\n\t\t\t\t\t\tauto& regInst = RegisterDevice::instance();\n\t\t\t\t\t\tint i;\n\t\t\t\t\t\t\/\/device type\n\t\t\t\t\t\ti = SendDlgItemMessage(hW, IDC_COMBO1, CB_GETCURSEL, 0, 0);\n\t\t\t\t\t\tconf.Port[1] = regInst.Name(i - 1);\n\t\t\t\t\t\ti = SendDlgItemMessage(hW, IDC_COMBO2, CB_GETCURSEL, 0, 0);\n\t\t\t\t\t\tconf.Port[0] = regInst.Name(i - 1);\n\t\t\t\t\t}\n\t\t\t\t\t\/\/wheel type\n\t\t\t\t\tconf.WheelType[PLAYER_ONE_PORT] = SendDlgItemMessage(hW, IDC_COMBO_WHEEL_TYPE1, CB_GETCURSEL, 0, 0);\n\t\t\t\t\tconf.WheelType[PLAYER_TWO_PORT] = SendDlgItemMessage(hW, IDC_COMBO_WHEEL_TYPE2, CB_GETCURSEL, 0, 0);\n\n\t\t\t\t\tSaveConfig();\n\t\t\t\t\tCreateDevices();\n\t\t\t\t\tEndDialog(hW, RESULT_OK);\n\t\t\t\t\tconfigChanged = true;\n\t\t\t\t\treturn TRUE;\n\t\t\t\t}\n\t\t\t}\n\t}\n\n\treturn FALSE;\n}\n\n\nEXPORT_C_(BOOL) AboutDlgProc(HWND hW, UINT uMsg, WPARAM wParam, LPARAM lParam) {\n\tswitch(uMsg) {\n\t\tcase WM_INITDIALOG:\n\t\t\treturn TRUE;\n\n\t\tcase WM_COMMAND:\n\t\t\tswitch(LOWORD(wParam)) {\n\t\t\t\tcase IDOK:\n\t\t\t\t\tEndDialog(hW, FALSE);\n\t\t\t\t\treturn TRUE;\n\t\t\t}\n\t}\n\treturn FALSE;\n}\n\nEXPORT_C_(void) USBconfigure() {\n    RegisterDevice::Register();\n    DialogBox(hInst,\n              MAKEINTRESOURCE(IDD_CONFIG),\n              GetActiveWindow(),\n              (DLGPROC)ConfigureDlgProc);\n}\n\nEXPORT_C_(void) USBabout() {\n    DialogBox(hInst,\n              MAKEINTRESOURCE(IDD_ABOUT),\n              GetActiveWindow(),\n              (DLGPROC)AboutDlgProc);\n}\n\nBOOL APIENTRY DllMain(HANDLE hModule,\n                      DWORD  dwReason,\n                      LPVOID lpReserved) {\n\thInst = (HINSTANCE)hModule;\n\treturn TRUE;\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_MAPPER_FEM_HH\n#define DUNE_GDT_MAPPER_FEM_HH\n\n#include <type_traits>\n\n#include <dune\/common\/dynvector.hh>\n#include <dune\/common\/typetraits.hh>\n\n#if HAVE_DUNE_FEM\n#include <dune\/fem\/space\/mapper\/dofmapper.hh>\n#endif\n\n#include \"interface.hh\"\n\nnamespace Dune {\nnamespace GDT {\nnamespace Mapper {\n\n#if HAVE_DUNE_FEM\n\n\n\/\/ forward, to be used in the traits and to allow for specialization\ntemplate <class FemDofMapperImp>\nclass FemDofWrapper;\n\n\ntemplate <class FemDofMapperImp>\nclass FemDofWrapperTraits\n{\npublic:\n  typedef FemDofWrapper<FemDofMapperImp> derived_type;\n  typedef Dune::Fem::DofMapper<typename FemDofMapperImp::Traits> BackendType;\n};\n\n\ntemplate <class FemDofMapperImp>\nclass FemDofWrapper : public MapperInterface<FemDofWrapperTraits<FemDofMapperImp>>\n{\n  typedef MapperInterface<FemDofWrapperTraits<FemDofMapperImp>> InterfaceType;\n\npublic:\n  typedef FemDofWrapperTraits<FemDofMapperImp> Traits;\n  typedef typename Traits::BackendType BackendType;\n\n  FemDofWrapper(const BackendType& femMapper)\n    : backend_(femMapper)\n  {\n  }\n\n  const BackendType& backend() const\n  {\n    return backend_;\n  }\n\n  size_t size() const\n  {\n    return backend_.size();\n  }\n\n  template <class EntityType>\n  size_t numDofs(const EntityType& entity) const\n  {\n    return backend_.numDofs(entity);\n  }\n\n  size_t maxNumDofs() const\n  {\n    return backend_.maxNumDofs();\n  }\n\nprivate:\n  class Functor\n  {\n  public:\n    Functor(Dune::DynamicVector<size_t>& globalIndices)\n      : globalIndices_(globalIndices)\n    {\n    }\n\n    void operator()(int localDoF, int globalDoF)\n    {\n      assert(localDoF < int(globalIndices_.size()));\n      globalIndices_[localDoF] = globalDoF;\n    }\n\n  private:\n    Dune::DynamicVector<size_t>& globalIndices_;\n  };\n\npublic:\n  template <class EntityType>\n  void globalIndices(const EntityType& entity, Dune::DynamicVector<size_t>& ret) const\n  {\n    \/\/ some checks\n    const size_t numLocalDofs = numDofs(entity);\n    if (ret.size() < numLocalDofs)\n      ret.resize(numLocalDofs);\n    \/\/ compute\n    Functor functor(ret);\n    backend_.mapEachEntityDof(entity, functor);\n  }\n\n  using InterfaceType::globalIndices;\n\n  \/**\n   *  \\attention  This method is implemented using globalIndices() and thus not optimal!\n   *\/\n  template <class EntityType>\n  size_t mapToGlobal(const EntityType& entity, const size_t& localIndex) const\n  {\n    const size_t numLocalDofs = numDofs(entity);\n    assert(localIndex < numLocalDofs);\n    Dune::DynamicVector<size_t> tmpGlobalIndices(numLocalDofs);\n    globalIndices(entity, tmpGlobalIndices);\n    return tmpGlobalIndices[localIndex];\n  }\n\nprivate:\n  const BackendType& backend_;\n}; \/\/ class FemDofWrapper\n\n\n#else \/\/ HAVE_DUNE_FEM\n\n\ntemplate <class FemDofMapperImp>\nclass FemDofWrapper\n{\n  static_assert(Dune::AlwaysFalse<FemDofMapperImp>::value, \"You are missing dune-fem!\");\n};\n\n\n#endif \/\/ HAVE_DUNE_FEM\n\n} \/\/ namespace Mapper\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_MAPPER_FEM_HH\n<commit_msg>[mapper.fem] update to newer dune-fem<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_MAPPER_FEM_HH\n#define DUNE_GDT_MAPPER_FEM_HH\n\n#include <type_traits>\n\n#include <dune\/common\/dynvector.hh>\n#include <dune\/common\/typetraits.hh>\n\n#include \"interface.hh\"\n\nnamespace Dune {\nnamespace GDT {\nnamespace Mapper {\n\n#if HAVE_DUNE_FEM\n\n\n\/\/ forward, to be used in the traits and to allow for specialization\ntemplate <class FemDofMapperImp>\nclass FemDofWrapper;\n\n\ntemplate <class FemDofMapperImp>\nclass FemDofWrapperTraits\n{\npublic:\n  typedef FemDofWrapper<FemDofMapperImp> derived_type;\n  typedef FemDofMapperImp BackendType;\n};\n\n\ntemplate <class FemDofMapperImp>\nclass FemDofWrapper : public MapperInterface<FemDofWrapperTraits<FemDofMapperImp>>\n{\n  typedef MapperInterface<FemDofWrapperTraits<FemDofMapperImp>> InterfaceType;\n\npublic:\n  typedef FemDofWrapperTraits<FemDofMapperImp> Traits;\n  typedef typename Traits::BackendType BackendType;\n\n  FemDofWrapper(const BackendType& femMapper)\n    : backend_(femMapper)\n  {\n  }\n\n  const BackendType& backend() const\n  {\n    return backend_;\n  }\n\n  size_t size() const\n  {\n    return backend_.size();\n  }\n\n  template <class EntityType>\n  size_t numDofs(const EntityType& entity) const\n  {\n    return backend_.numDofs(entity);\n  }\n\n  size_t maxNumDofs() const\n  {\n    return backend_.maxNumDofs();\n  }\n\nprivate:\n  class Functor\n  {\n  public:\n    Functor(Dune::DynamicVector<size_t>& globalIndices)\n      : globalIndices_(globalIndices)\n    {\n    }\n\n    void operator()(int localDoF, int globalDoF)\n    {\n      assert(localDoF < int(globalIndices_.size()));\n      globalIndices_[localDoF] = globalDoF;\n    }\n\n  private:\n    Dune::DynamicVector<size_t>& globalIndices_;\n  };\n\npublic:\n  template <class EntityType>\n  void globalIndices(const EntityType& entity, Dune::DynamicVector<size_t>& ret) const\n  {\n    \/\/ some checks\n    const size_t numLocalDofs = numDofs(entity);\n    if (ret.size() < numLocalDofs)\n      ret.resize(numLocalDofs);\n    \/\/ compute\n    Functor functor(ret);\n    backend_.mapEach(entity, functor);\n  }\n\n  using InterfaceType::globalIndices;\n\n  \/**\n   *  \\attention  This method is implemented using globalIndices() and thus not optimal!\n   *\/\n  template <class EntityType>\n  size_t mapToGlobal(const EntityType& entity, const size_t& localIndex) const\n  {\n    const size_t numLocalDofs = numDofs(entity);\n    assert(localIndex < numLocalDofs);\n    Dune::DynamicVector<size_t> tmpGlobalIndices(numLocalDofs);\n    globalIndices(entity, tmpGlobalIndices);\n    return tmpGlobalIndices[localIndex];\n  }\n\nprivate:\n  const BackendType& backend_;\n}; \/\/ class FemDofWrapper\n\n\n#else \/\/ HAVE_DUNE_FEM\n\n\ntemplate <class FemDofMapperImp>\nclass FemDofWrapper\n{\n  static_assert(Dune::AlwaysFalse<FemDofMapperImp>::value, \"You are missing dune-fem!\");\n};\n\n\n#endif \/\/ HAVE_DUNE_FEM\n\n} \/\/ namespace Mapper\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_MAPPER_FEM_HH\n<|endoftext|>"}
{"text":"<commit_before>#ifndef AX_INVERSE_MATRIX_H\n#define AX_INVERSE_MATRIX_H\n#include \"Matrix.hpp\"\n\nnamespace ax\n{\n\n\/\/ for 2x2 dimentional\ntemplate<class L, typename std::enable_if<\n             is_MatrixExpression<typename L::value_trait>::value&&\n             is_SameSize<L::col, L::row>::value&&\n             is_SameSize<L::col, 2>::value\n             >::type*& = enabler>\nconst double determinant(const L& lhs)\n{\n    return lhs(0,0) * lhs(1,1) - lhs(1,0) * lhs(0,1);\n}\n\n\/\/ for 3x3 dimentional\ntemplate<class L, typename std::enable_if<\n             is_MatrixExpression<typename L::value_trait>::value&&\n             is_SameSize<L::col, L::row>::value&&\n             is_SameSize<L::col, 3>::value\n             >::type*& = enabler>\nconst double determinant(const L& lhs)\n{\n    return lhs(0,0) * lhs(1,1) * lhs(2,2) +\n           lhs(1,0) * lhs(2,1) * lhs(0,2) +\n           lhs(2,0) * lhs(0,1) * lhs(1,2) - \n           lhs(0,0) * lhs(2,1) * lhs(1,2) - \n           lhs(2,0) * lhs(1,1) * lhs(0,2) - \n           lhs(1,0) * lhs(0,1) * lhs(2,2);\n}\n\n\/\/ XXX: for 2x2 matrix, cost of temporal object is small\ntemplate<class L, typename std::enable_if<\n             is_MatrixExpression<typename L::value_trait>::value&&\n             is_SameSize<L::col, L::row>::value&&\n             is_SameSize<L::col, 2>::value\n             >::type*& = enabler>\nRealMatrix<L::row, L::col> inverse(const L& lhs)\n{\n    const double det_inv = 1e0 \/ determinant(lhs);\n    RealMatrix<L::row, L::col> inv;\n    inv(0,0) =  det_inv * lhs(1,1);\n    inv(1,1) =  det_inv * lhs(0,0);\n    inv(0,1) = -det_inv * lhs(0,1);\n    inv(1,0) = -det_inv * lhs(1,0);\n    return inv;\n}\n\n\/\/ XXX: for 3x3 matrix, cost of temporal object is small\ntemplate<class L, typename std::enable_if<\n             is_MatrixExpression<typename L::value_trait>::value&&\n             is_SameSize<L::col, L::row>::value&&\n             is_SameSize<L::col, 3>::value\n             >::type*& = enabler>\nRealMatrix<L::row, L::col> inverse(const L& lhs_)\n{\n    const L lhs = lhs_;\n    const double det_inv = 1e0 \/ determinant(lhs);\n\n    RealMatrix<L::row, L::col> inv;\n    inv(0,0) = det_inv * (lhs(1,1) * lhs(2,2) - lhs(1,2) * lhs(2,1));\n    inv(1,1) = det_inv * (lhs(0,0) * lhs(2,2) - lhs(0,2) * lhs(2,0));\n    inv(2,2) = det_inv * (lhs(0,0) * lhs(1,1) - lhs(0,1) * lhs(1,0));\n\n    inv(0,1) = det_inv * (lhs(0,2) * lhs(2,1) - lhs(0,1) * lhs(2,2));\n    inv(0,2) = det_inv * (lhs(0,1) * lhs(1,2) - lhs(0,2) * lhs(1,1));\n    inv(1,2) = det_inv * (lhs(0,2) * lhs(1,0) - lhs(0,0) * lhs(1,2));\n\n    inv(1,0) = det_inv * (lhs(1,2) * lhs(2,0) - lhs(1,0) * lhs(2,2));\n    inv(2,0) = det_inv * (lhs(1,0) * lhs(2,1) - lhs(2,0) * lhs(1,1));\n    inv(2,1) = det_inv * (lhs(2,0) * lhs(0,1) - lhs(0,0) * lhs(2,1));\n    return inv;\n}\n\n}\n#endif \/* AX_INVERSE_MATRIX_H *\/\n<commit_msg>rm unnecessary comments<commit_after>#ifndef AX_INVERSE_MATRIX_H\n#define AX_INVERSE_MATRIX_H\n#include \"Matrix.hpp\"\n\nnamespace ax\n{\n\n\/\/ for 2x2 dimentional\ntemplate<class L, typename std::enable_if<\n             is_MatrixExpression<typename L::value_trait>::value&&\n             is_SameSize<L::col, L::row>::value&&\n             is_SameSize<L::col, 2>::value\n             >::type*& = enabler>\nconst double determinant(const L& lhs)\n{\n    return lhs(0,0) * lhs(1,1) - lhs(1,0) * lhs(0,1);\n}\n\n\/\/ for 3x3 dimentional\ntemplate<class L, typename std::enable_if<\n             is_MatrixExpression<typename L::value_trait>::value&&\n             is_SameSize<L::col, L::row>::value&&\n             is_SameSize<L::col, 3>::value\n             >::type*& = enabler>\nconst double determinant(const L& lhs)\n{\n    return lhs(0,0) * lhs(1,1) * lhs(2,2) +\n           lhs(1,0) * lhs(2,1) * lhs(0,2) +\n           lhs(2,0) * lhs(0,1) * lhs(1,2) - \n           lhs(0,0) * lhs(2,1) * lhs(1,2) - \n           lhs(2,0) * lhs(1,1) * lhs(0,2) - \n           lhs(1,0) * lhs(0,1) * lhs(2,2);\n}\n\ntemplate<class L, typename std::enable_if<\n             is_MatrixExpression<typename L::value_trait>::value&&\n             is_SameSize<L::col, L::row>::value&&\n             is_SameSize<L::col, 2>::value\n             >::type*& = enabler>\nRealMatrix<L::row, L::col> inverse(const L& lhs)\n{\n    const double det_inv = 1e0 \/ determinant(lhs);\n    RealMatrix<L::row, L::col> inv;\n    inv(0,0) =  det_inv * lhs(1,1);\n    inv(1,1) =  det_inv * lhs(0,0);\n    inv(0,1) = -det_inv * lhs(0,1);\n    inv(1,0) = -det_inv * lhs(1,0);\n    return inv;\n}\n\ntemplate<class L, typename std::enable_if<\n             is_MatrixExpression<typename L::value_trait>::value&&\n             is_SameSize<L::col, L::row>::value&&\n             is_SameSize<L::col, 3>::value\n             >::type*& = enabler>\nRealMatrix<L::row, L::col> inverse(const L& lhs_)\n{\n    const L lhs = lhs_;\n    const double det_inv = 1e0 \/ determinant(lhs);\n\n    RealMatrix<L::row, L::col> inv;\n    inv(0,0) = det_inv * (lhs(1,1) * lhs(2,2) - lhs(1,2) * lhs(2,1));\n    inv(1,1) = det_inv * (lhs(0,0) * lhs(2,2) - lhs(0,2) * lhs(2,0));\n    inv(2,2) = det_inv * (lhs(0,0) * lhs(1,1) - lhs(0,1) * lhs(1,0));\n\n    inv(0,1) = det_inv * (lhs(0,2) * lhs(2,1) - lhs(0,1) * lhs(2,2));\n    inv(0,2) = det_inv * (lhs(0,1) * lhs(1,2) - lhs(0,2) * lhs(1,1));\n    inv(1,2) = det_inv * (lhs(0,2) * lhs(1,0) - lhs(0,0) * lhs(1,2));\n\n    inv(1,0) = det_inv * (lhs(1,2) * lhs(2,0) - lhs(1,0) * lhs(2,2));\n    inv(2,0) = det_inv * (lhs(1,0) * lhs(2,1) - lhs(2,0) * lhs(1,1));\n    inv(2,1) = det_inv * (lhs(2,0) * lhs(0,1) - lhs(0,0) * lhs(2,1));\n    return inv;\n}\n\n}\n#endif \/* AX_INVERSE_MATRIX_H *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Aspia Project\n\/\/ Copyright (C) 2020 Dmitry Chapyshev <dmitry@aspia.ru>\n\/\/\n\/\/ This program is free software: you can redistribute it and\/or modify\n\/\/ it under the terms of the GNU General Public License as published by\n\/\/ the Free Software Foundation, either version 3 of the License, or\n\/\/ (at your option) any later version.\n\/\/\n\/\/ This program is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\/\/ GNU General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU General Public License\n\/\/ along with this program. If not, see <https:\/\/www.gnu.org\/licenses\/>.\n\/\/\n\n#include \"client\/ui\/session_window.h\"\n\n#include \"base\/logging.h\"\n#include \"client\/client.h\"\n#include \"client\/client_proxy.h\"\n#include \"client\/status_window_proxy.h\"\n#include \"client\/ui\/authorization_dialog.h\"\n#include \"common\/ui\/status_dialog.h\"\n#include \"qt_base\/application.h\"\n\nnamespace client {\n\nSessionWindow::SessionWindow(QWidget* parent)\n    : QWidget(parent),\n      status_window_proxy_(\n          std::make_shared<StatusWindowProxy>(qt_base::Application::uiTaskRunner(), this))\n{\n    LOG(LS_INFO) << \"SessionWindow Ctor\";\n}\n\nSessionWindow::~SessionWindow()\n{\n    LOG(LS_INFO) << \"SessionWindow Dtor\";\n    status_window_proxy_->dettach();\n}\n\nbool SessionWindow::connectToHost(Config config)\n{\n    LOG(LS_INFO) << \"Connecting to host\";\n\n    if (client_proxy_)\n    {\n        LOG(LS_ERROR) << \"Attempt to start an already running client\";\n        return false;\n    }\n\n    \/\/ Set the window title.\n    setClientTitle(config);\n\n    if (config.username.empty() || config.password.empty())\n    {\n        LOG(LS_INFO) << \"Empty user name or password\";\n\n        AuthorizationDialog auth_dialog(this);\n\n        auth_dialog.setOneTimePasswordEnabled(config.router_config.has_value());\n        auth_dialog.setUserName(QString::fromStdU16String(config.username));\n        auth_dialog.setPassword(QString::fromStdU16String(config.password));\n\n        if (auth_dialog.exec() == AuthorizationDialog::Rejected)\n        {\n            LOG(LS_INFO) << \"Authorization rejected by user\";\n            return false;\n        }\n\n        config.username = auth_dialog.userName().toStdU16String();\n        config.password = auth_dialog.password().toStdU16String();\n    }\n\n    \/\/ When connecting with a one-time password, the username must be in the following format:\n    \/\/ #host_id.\n    if (config.username.empty())\n    {\n        LOG(LS_INFO) << \"User name is empty. Connection by ID\";\n        config.username = u\"#\" + config.address_or_id;\n    }\n\n    \/\/ Create a client instance.\n    std::unique_ptr<Client> client = createClient();\n\n    \/\/ Set the window that will receive notifications.\n    client->setStatusWindow(status_window_proxy_);\n\n    client_proxy_ = std::make_unique<ClientProxy>(\n        qt_base::Application::ioTaskRunner(), std::move(client), config);\n\n    LOG(LS_INFO) << \"Start clinet proxy\";\n    client_proxy_->start();\n    return true;\n}\n\nConfig SessionWindow::config() const\n{\n    return client_proxy_->config();\n}\n\nvoid SessionWindow::closeEvent(QCloseEvent* \/* event *\/)\n{\n    LOG(LS_INFO) << \"Close event\";\n\n    if (client_proxy_)\n    {\n        LOG(LS_INFO) << \"Stopping client proxy\";\n        client_proxy_->stop();\n        client_proxy_.reset();\n    }\n    else\n    {\n        LOG(LS_INFO) << \"No client proxy\";\n    }\n}\n\nvoid SessionWindow::onStarted(const std::u16string& address_or_id)\n{\n    LOG(LS_INFO) << \"Attempt to establish a connection\";\n\n    \/\/ Create a dialog to display the connection status.\n    status_dialog_ = new common::StatusDialog(this);\n\n    \/\/ After closing the status dialog, close the session window.\n    connect(status_dialog_, &common::StatusDialog::finished, this, &SessionWindow::close);\n\n    status_dialog_->setWindowFlag(Qt::WindowStaysOnTopHint);\n    status_dialog_->addMessageAndActivate(tr(\"Attempt to connect to %1.\").arg(address_or_id));\n}\n\nvoid SessionWindow::onStopped()\n{\n    LOG(LS_INFO) << \"Connection stopped\";\n    status_dialog_->close();\n}\n\nvoid SessionWindow::onConnected()\n{\n    LOG(LS_INFO) << \"Connection established\";\n\n    status_dialog_->addMessageAndActivate(tr(\"Connection established.\"));\n    status_dialog_->hide();\n}\n\nvoid SessionWindow::onDisconnected(base::NetworkChannel::ErrorCode error_code)\n{\n    LOG(LS_INFO) << \"Network error\";\n    onErrorOccurred(netErrorToString(error_code));\n}\n\nvoid SessionWindow::onAccessDenied(base::ClientAuthenticator::ErrorCode error_code)\n{\n    LOG(LS_INFO) << \"Authentication error\";\n    onErrorOccurred(authErrorToString(error_code));\n}\n\nvoid SessionWindow::onRouterError(const RouterController::Error& error)\n{\n    LOG(LS_INFO) << \"Router error\";\n\n    switch (error.type)\n    {\n        case RouterController::ErrorType::NETWORK:\n        {\n            onErrorOccurred(tr(\"Network error when connecting to the router: %1\")\n                            .arg(netErrorToString(error.code.network)));\n        }\n        break;\n\n        case RouterController::ErrorType::AUTHENTICATION:\n        {\n            onErrorOccurred(tr(\"Authentication error when connecting to the router: %1\")\n                            .arg(authErrorToString(error.code.authentication)));\n        }\n        break;\n\n        case RouterController::ErrorType::ROUTER:\n        {\n            onErrorOccurred(routerErrorToString(error.code.router));\n        }\n        break;\n\n        default:\n            NOTREACHED();\n            break;\n    }\n}\n\nvoid SessionWindow::setClientTitle(const Config& config)\n{\n    QString session_name;\n\n    switch (config.session_type)\n    {\n        case proto::SESSION_TYPE_DESKTOP_MANAGE:\n            session_name = tr(\"Desktop Manage\");\n            break;\n\n        case proto::SESSION_TYPE_DESKTOP_VIEW:\n            session_name = tr(\"Desktop View\");\n            break;\n\n        case proto::SESSION_TYPE_FILE_TRANSFER:\n            session_name = tr(\"File Transfer\");\n            break;\n\n        default:\n            NOTREACHED();\n            break;\n    }\n\n    QString computer_name = QString::fromStdU16String(config.computer_name);\n    if (computer_name.isEmpty())\n    {\n        if (config.router_config.has_value())\n            computer_name = QString::fromStdU16String(config.address_or_id);\n        else\n            computer_name = QString(\"%1:%2\").arg(config.address_or_id).arg(config.port);\n    }\n\n    setWindowTitle(QString(\"%1 - %2\").arg(computer_name).arg(session_name));\n}\n\nvoid SessionWindow::onErrorOccurred(const QString& message)\n{\n    hide();\n\n    for (const auto& object : children())\n    {\n        QWidget* widget = dynamic_cast<QWidget*>(object);\n        if (widget)\n            widget->hide();\n    }\n\n    status_dialog_->addMessageAndActivate(message);\n}\n\n\/\/ static\nQString SessionWindow::netErrorToString(base::NetworkChannel::ErrorCode error_code)\n{\n    const char* message;\n\n    switch (error_code)\n    {\n        case base::NetworkChannel::ErrorCode::INVALID_PROTOCOL:\n            message = QT_TR_NOOP(\"Violation of the communication protocol.\");\n            break;\n\n        case base::NetworkChannel::ErrorCode::ACCESS_DENIED:\n            message = QT_TR_NOOP(\"Cryptography error (message encryption or decryption failed).\");\n            break;\n\n        case base::NetworkChannel::ErrorCode::NETWORK_ERROR:\n            message = QT_TR_NOOP(\"An error occurred with the network (e.g., the network cable was accidentally plugged out).\");\n            break;\n\n        case base::NetworkChannel::ErrorCode::CONNECTION_REFUSED:\n            message = QT_TR_NOOP(\"Connection was refused by the peer (or timed out).\");\n            break;\n\n        case base::NetworkChannel::ErrorCode::REMOTE_HOST_CLOSED:\n            message = QT_TR_NOOP(\"Remote host closed the connection.\");\n            break;\n\n        case base::NetworkChannel::ErrorCode::SPECIFIED_HOST_NOT_FOUND:\n            message = QT_TR_NOOP(\"Host address was not found.\");\n            break;\n\n        case base::NetworkChannel::ErrorCode::SOCKET_TIMEOUT:\n            message = QT_TR_NOOP(\"Socket operation timed out.\");\n            break;\n\n        case base::NetworkChannel::ErrorCode::ADDRESS_IN_USE:\n            message = QT_TR_NOOP(\"Address specified is already in use and was set to be exclusive.\");\n            break;\n\n        case base::NetworkChannel::ErrorCode::ADDRESS_NOT_AVAILABLE:\n            message = QT_TR_NOOP(\"Address specified does not belong to the host.\");\n            break;\n\n        default:\n        {\n            if (error_code != base::NetworkChannel::ErrorCode::UNKNOWN)\n            {\n                LOG(LS_WARNING) << \"Unknown error code: \" << static_cast<int>(error_code);\n            }\n\n            message = QT_TR_NOOP(\"An unknown error occurred.\");\n        }\n        break;\n    }\n\n    return tr(message);\n}\n\n\/\/ static\nQString SessionWindow::authErrorToString(base::ClientAuthenticator::ErrorCode error_code)\n{\n    const char* message;\n\n    switch (error_code)\n    {\n        case base::ClientAuthenticator::ErrorCode::SUCCESS:\n            message = QT_TR_NOOP(\"Authentication successfully completed.\");\n            break;\n\n        case base::ClientAuthenticator::ErrorCode::NETWORK_ERROR:\n            message = QT_TR_NOOP(\"Network authentication error.\");\n            break;\n\n        case base::ClientAuthenticator::ErrorCode::PROTOCOL_ERROR:\n            message = QT_TR_NOOP(\"Violation of the data exchange protocol.\");\n            break;\n\n        case base::ClientAuthenticator::ErrorCode::ACCESS_DENIED:\n            message = QT_TR_NOOP(\"Wrong user name or password.\");\n            break;\n\n        case base::ClientAuthenticator::ErrorCode::SESSION_DENIED:\n            message = QT_TR_NOOP(\"Specified session type is not allowed for the user.\");\n            break;\n\n        default:\n            message = QT_TR_NOOP(\"An unknown error occurred.\");\n            break;\n    }\n\n    return tr(message);\n}\n\n\/\/ static\nQString SessionWindow::routerErrorToString(RouterController::ErrorCode error_code)\n{\n    const char* message;\n\n    switch (error_code)\n    {\n        case RouterController::ErrorCode::PEER_NOT_FOUND:\n            message = QT_TR_NOOP(\"No host with the specified ID was found.\");\n            break;\n\n        case RouterController::ErrorCode::KEY_POOL_EMPTY:\n            message = QT_TR_NOOP(\"There are no relays available or the key pool is empty.\");\n            break;\n\n        case RouterController::ErrorCode::RELAY_ERROR:\n            message = QT_TR_NOOP(\"Failed to connect to the relay server.\");\n            break;\n\n        case RouterController::ErrorCode::ACCESS_DENIED:\n            message = QT_TR_NOOP(\"Access is denied.\");\n            break;\n\n        default:\n            message = QT_TR_NOOP(\"Unknown error.\");\n            break;\n    }\n\n    return tr(message);\n}\n\n} \/\/ namespace client\n<commit_msg>Fix typo.<commit_after>\/\/\n\/\/ Aspia Project\n\/\/ Copyright (C) 2020 Dmitry Chapyshev <dmitry@aspia.ru>\n\/\/\n\/\/ This program is free software: you can redistribute it and\/or modify\n\/\/ it under the terms of the GNU General Public License as published by\n\/\/ the Free Software Foundation, either version 3 of the License, or\n\/\/ (at your option) any later version.\n\/\/\n\/\/ This program is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\/\/ GNU General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU General Public License\n\/\/ along with this program. If not, see <https:\/\/www.gnu.org\/licenses\/>.\n\/\/\n\n#include \"client\/ui\/session_window.h\"\n\n#include \"base\/logging.h\"\n#include \"client\/client.h\"\n#include \"client\/client_proxy.h\"\n#include \"client\/status_window_proxy.h\"\n#include \"client\/ui\/authorization_dialog.h\"\n#include \"common\/ui\/status_dialog.h\"\n#include \"qt_base\/application.h\"\n\nnamespace client {\n\nSessionWindow::SessionWindow(QWidget* parent)\n    : QWidget(parent),\n      status_window_proxy_(\n          std::make_shared<StatusWindowProxy>(qt_base::Application::uiTaskRunner(), this))\n{\n    LOG(LS_INFO) << \"SessionWindow Ctor\";\n}\n\nSessionWindow::~SessionWindow()\n{\n    LOG(LS_INFO) << \"SessionWindow Dtor\";\n    status_window_proxy_->dettach();\n}\n\nbool SessionWindow::connectToHost(Config config)\n{\n    LOG(LS_INFO) << \"Connecting to host\";\n\n    if (client_proxy_)\n    {\n        LOG(LS_ERROR) << \"Attempt to start an already running client\";\n        return false;\n    }\n\n    \/\/ Set the window title.\n    setClientTitle(config);\n\n    if (config.username.empty() || config.password.empty())\n    {\n        LOG(LS_INFO) << \"Empty user name or password\";\n\n        AuthorizationDialog auth_dialog(this);\n\n        auth_dialog.setOneTimePasswordEnabled(config.router_config.has_value());\n        auth_dialog.setUserName(QString::fromStdU16String(config.username));\n        auth_dialog.setPassword(QString::fromStdU16String(config.password));\n\n        if (auth_dialog.exec() == AuthorizationDialog::Rejected)\n        {\n            LOG(LS_INFO) << \"Authorization rejected by user\";\n            return false;\n        }\n\n        config.username = auth_dialog.userName().toStdU16String();\n        config.password = auth_dialog.password().toStdU16String();\n    }\n\n    \/\/ When connecting with a one-time password, the username must be in the following format:\n    \/\/ #host_id.\n    if (config.username.empty())\n    {\n        LOG(LS_INFO) << \"User name is empty. Connection by ID\";\n        config.username = u\"#\" + config.address_or_id;\n    }\n\n    \/\/ Create a client instance.\n    std::unique_ptr<Client> client = createClient();\n\n    \/\/ Set the window that will receive notifications.\n    client->setStatusWindow(status_window_proxy_);\n\n    client_proxy_ = std::make_unique<ClientProxy>(\n        qt_base::Application::ioTaskRunner(), std::move(client), config);\n\n    LOG(LS_INFO) << \"Start client proxy\";\n    client_proxy_->start();\n    return true;\n}\n\nConfig SessionWindow::config() const\n{\n    return client_proxy_->config();\n}\n\nvoid SessionWindow::closeEvent(QCloseEvent* \/* event *\/)\n{\n    LOG(LS_INFO) << \"Close event\";\n\n    if (client_proxy_)\n    {\n        LOG(LS_INFO) << \"Stopping client proxy\";\n        client_proxy_->stop();\n        client_proxy_.reset();\n    }\n    else\n    {\n        LOG(LS_INFO) << \"No client proxy\";\n    }\n}\n\nvoid SessionWindow::onStarted(const std::u16string& address_or_id)\n{\n    LOG(LS_INFO) << \"Attempt to establish a connection\";\n\n    \/\/ Create a dialog to display the connection status.\n    status_dialog_ = new common::StatusDialog(this);\n\n    \/\/ After closing the status dialog, close the session window.\n    connect(status_dialog_, &common::StatusDialog::finished, this, &SessionWindow::close);\n\n    status_dialog_->setWindowFlag(Qt::WindowStaysOnTopHint);\n    status_dialog_->addMessageAndActivate(tr(\"Attempt to connect to %1.\").arg(address_or_id));\n}\n\nvoid SessionWindow::onStopped()\n{\n    LOG(LS_INFO) << \"Connection stopped\";\n    status_dialog_->close();\n}\n\nvoid SessionWindow::onConnected()\n{\n    LOG(LS_INFO) << \"Connection established\";\n\n    status_dialog_->addMessageAndActivate(tr(\"Connection established.\"));\n    status_dialog_->hide();\n}\n\nvoid SessionWindow::onDisconnected(base::NetworkChannel::ErrorCode error_code)\n{\n    LOG(LS_INFO) << \"Network error\";\n    onErrorOccurred(netErrorToString(error_code));\n}\n\nvoid SessionWindow::onAccessDenied(base::ClientAuthenticator::ErrorCode error_code)\n{\n    LOG(LS_INFO) << \"Authentication error\";\n    onErrorOccurred(authErrorToString(error_code));\n}\n\nvoid SessionWindow::onRouterError(const RouterController::Error& error)\n{\n    LOG(LS_INFO) << \"Router error\";\n\n    switch (error.type)\n    {\n        case RouterController::ErrorType::NETWORK:\n        {\n            onErrorOccurred(tr(\"Network error when connecting to the router: %1\")\n                            .arg(netErrorToString(error.code.network)));\n        }\n        break;\n\n        case RouterController::ErrorType::AUTHENTICATION:\n        {\n            onErrorOccurred(tr(\"Authentication error when connecting to the router: %1\")\n                            .arg(authErrorToString(error.code.authentication)));\n        }\n        break;\n\n        case RouterController::ErrorType::ROUTER:\n        {\n            onErrorOccurred(routerErrorToString(error.code.router));\n        }\n        break;\n\n        default:\n            NOTREACHED();\n            break;\n    }\n}\n\nvoid SessionWindow::setClientTitle(const Config& config)\n{\n    QString session_name;\n\n    switch (config.session_type)\n    {\n        case proto::SESSION_TYPE_DESKTOP_MANAGE:\n            session_name = tr(\"Desktop Manage\");\n            break;\n\n        case proto::SESSION_TYPE_DESKTOP_VIEW:\n            session_name = tr(\"Desktop View\");\n            break;\n\n        case proto::SESSION_TYPE_FILE_TRANSFER:\n            session_name = tr(\"File Transfer\");\n            break;\n\n        default:\n            NOTREACHED();\n            break;\n    }\n\n    QString computer_name = QString::fromStdU16String(config.computer_name);\n    if (computer_name.isEmpty())\n    {\n        if (config.router_config.has_value())\n            computer_name = QString::fromStdU16String(config.address_or_id);\n        else\n            computer_name = QString(\"%1:%2\").arg(config.address_or_id).arg(config.port);\n    }\n\n    setWindowTitle(QString(\"%1 - %2\").arg(computer_name).arg(session_name));\n}\n\nvoid SessionWindow::onErrorOccurred(const QString& message)\n{\n    hide();\n\n    for (const auto& object : children())\n    {\n        QWidget* widget = dynamic_cast<QWidget*>(object);\n        if (widget)\n            widget->hide();\n    }\n\n    status_dialog_->addMessageAndActivate(message);\n}\n\n\/\/ static\nQString SessionWindow::netErrorToString(base::NetworkChannel::ErrorCode error_code)\n{\n    const char* message;\n\n    switch (error_code)\n    {\n        case base::NetworkChannel::ErrorCode::INVALID_PROTOCOL:\n            message = QT_TR_NOOP(\"Violation of the communication protocol.\");\n            break;\n\n        case base::NetworkChannel::ErrorCode::ACCESS_DENIED:\n            message = QT_TR_NOOP(\"Cryptography error (message encryption or decryption failed).\");\n            break;\n\n        case base::NetworkChannel::ErrorCode::NETWORK_ERROR:\n            message = QT_TR_NOOP(\"An error occurred with the network (e.g., the network cable was accidentally plugged out).\");\n            break;\n\n        case base::NetworkChannel::ErrorCode::CONNECTION_REFUSED:\n            message = QT_TR_NOOP(\"Connection was refused by the peer (or timed out).\");\n            break;\n\n        case base::NetworkChannel::ErrorCode::REMOTE_HOST_CLOSED:\n            message = QT_TR_NOOP(\"Remote host closed the connection.\");\n            break;\n\n        case base::NetworkChannel::ErrorCode::SPECIFIED_HOST_NOT_FOUND:\n            message = QT_TR_NOOP(\"Host address was not found.\");\n            break;\n\n        case base::NetworkChannel::ErrorCode::SOCKET_TIMEOUT:\n            message = QT_TR_NOOP(\"Socket operation timed out.\");\n            break;\n\n        case base::NetworkChannel::ErrorCode::ADDRESS_IN_USE:\n            message = QT_TR_NOOP(\"Address specified is already in use and was set to be exclusive.\");\n            break;\n\n        case base::NetworkChannel::ErrorCode::ADDRESS_NOT_AVAILABLE:\n            message = QT_TR_NOOP(\"Address specified does not belong to the host.\");\n            break;\n\n        default:\n        {\n            if (error_code != base::NetworkChannel::ErrorCode::UNKNOWN)\n            {\n                LOG(LS_WARNING) << \"Unknown error code: \" << static_cast<int>(error_code);\n            }\n\n            message = QT_TR_NOOP(\"An unknown error occurred.\");\n        }\n        break;\n    }\n\n    return tr(message);\n}\n\n\/\/ static\nQString SessionWindow::authErrorToString(base::ClientAuthenticator::ErrorCode error_code)\n{\n    const char* message;\n\n    switch (error_code)\n    {\n        case base::ClientAuthenticator::ErrorCode::SUCCESS:\n            message = QT_TR_NOOP(\"Authentication successfully completed.\");\n            break;\n\n        case base::ClientAuthenticator::ErrorCode::NETWORK_ERROR:\n            message = QT_TR_NOOP(\"Network authentication error.\");\n            break;\n\n        case base::ClientAuthenticator::ErrorCode::PROTOCOL_ERROR:\n            message = QT_TR_NOOP(\"Violation of the data exchange protocol.\");\n            break;\n\n        case base::ClientAuthenticator::ErrorCode::ACCESS_DENIED:\n            message = QT_TR_NOOP(\"Wrong user name or password.\");\n            break;\n\n        case base::ClientAuthenticator::ErrorCode::SESSION_DENIED:\n            message = QT_TR_NOOP(\"Specified session type is not allowed for the user.\");\n            break;\n\n        default:\n            message = QT_TR_NOOP(\"An unknown error occurred.\");\n            break;\n    }\n\n    return tr(message);\n}\n\n\/\/ static\nQString SessionWindow::routerErrorToString(RouterController::ErrorCode error_code)\n{\n    const char* message;\n\n    switch (error_code)\n    {\n        case RouterController::ErrorCode::PEER_NOT_FOUND:\n            message = QT_TR_NOOP(\"No host with the specified ID was found.\");\n            break;\n\n        case RouterController::ErrorCode::KEY_POOL_EMPTY:\n            message = QT_TR_NOOP(\"There are no relays available or the key pool is empty.\");\n            break;\n\n        case RouterController::ErrorCode::RELAY_ERROR:\n            message = QT_TR_NOOP(\"Failed to connect to the relay server.\");\n            break;\n\n        case RouterController::ErrorCode::ACCESS_DENIED:\n            message = QT_TR_NOOP(\"Access is denied.\");\n            break;\n\n        default:\n            message = QT_TR_NOOP(\"Unknown error.\");\n            break;\n    }\n\n    return tr(message);\n}\n\n} \/\/ namespace client\n<|endoftext|>"}
{"text":"<commit_before>\/\/你们火星商店脑子有点问题的！\n\n#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\nint main()\n{\n\tint nc,np;\n\tvector<int> vc,vp;\n\tcin>>nc;\n\tfor(int i = 0;i < nc;i++)\n    {\n        int temp;\n        cin>>temp;\n        vc.push_back(temp);\n    }\n    sort(vc.begin(),vc.end());\n    cin>>np;\n\tfor(int i = 0;i < np;i++)\n    {\n        int temp;\n        cin>>temp;\n        vp.push_back(temp);\n    }\n    sort(vp.begin(),vp.end());\n    long long money = 0;\n    bool flag = false;\n    for(auto itc = vc.begin(),itp = vp.begin();itc != vc.end() && itp != vp.end();itc++,itp++)\n    {\n        if((*itc)*(*itp) > 0) money += (*itc)*(*itp);\n        else {flag = true;break;}\n    }\n    if(flag)\n    {\n        for(auto itrc = vc.rbegin(),itrp = vp.rbegin();itrc != vc.rend() && itrp != vp.rend();itrc++,itrp++)\n        {\n            if((*itrc)*(*itrp) > 0) money += (*itrc)*(*itrp);\n            else break;\n        }\n    }\n    cout<<money<<endl;\n}\n<commit_msg>你们火星商店脑子有点问题的！！<commit_after>\/\/你们火星商店脑子有点问题的！\n\n#include <iostream>\n#include <functional>\n#include <algorithm>\n#include <deque>\nusing namespace std;\nint main()\n{\n\tint nc,np,countpn,countnn;\n\tcountpn = countnn = 0;\n\tdeque<int> vc,vp;\n\tcin>>nc;\n\tfor(int i = 0;i < nc;i++)\n    {\n        int temp;\n        cin>>temp;\n        if(temp < 0) {vc.push_back(temp);countnn++;}\n        else {vc.push_front(temp);countpn++;}\n    }\n    sort(vc.begin(),vc.begin()+countpn,greater<int>());\n    sort(vc.end()-countnn,vc.end());\n    countpn = countnn = 0;\n    cin>>np;\n\tfor(int i = 0;i < np;i++)\n    {\n        int temp;\n        cin>>temp;\n        if(temp < 0) {vp.push_back(temp);countnn++;}\n        else {vp.push_front(temp);countpn++;}\n    }\n    sort(vp.begin(),vp.begin()+countpn,greater<int>());\n    sort(vp.end()-countnn,vp.end());\n    for(int &n : vc) {cout<<n<<\" \";}cout<<endl;\n    for(int &n : vp) {cout<<n<<\" \";}cout<<endl;\n    long long money = 0;\n    bool flag = false;\n    for(auto itc = vc.begin(),itp = vp.begin();itc != vc.end() && itp != vp.end();itc++,itp++)\n    {\n        if((*itc)*(*itp) > 0) money += (*itc)*(*itp);\n        else {flag = true;break;}\n    }\n    if(flag)\n    {\n        for(auto itrc = vc.rbegin(),itrp = vp.rbegin();itrc != vc.rend() && itrp != vp.rend();itrc++,itrp++)\n        {\n            if((*itrc)*(*itrp) > 0) money += (*itrc)*(*itrp);\n            else break;\n        }\n    }\n    cout<<money<<endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include <QGuiApplication>\n#include <QQmlFileSelector>\n#include <QStringList>\n#include <QTranslator>\n#include <QWindow>\n\n#include <qmltoolbox\/qmltoolbox-version.h>\n#include <qmltoolbox\/QmlApplicationEngine.h>\n#include <qmltoolbox\/MessageHandler.h>\n\n\nint main(int argc, char *argv[])\n{\n    qInstallMessageHandler(qmltoolbox::globalMessageHandler);\n    qmltoolbox::MessageHandler::instance().installStdHandlers();\n\n#ifndef QMLTOOLBOX_QT57\n    QGuiApplication::setAttribute(Qt::AA_EnableHighDpiScaling);\n#endif\n\n    QGuiApplication app(argc, argv);\n    app.setOrganizationName(QMLTOOLBOX_AUTHOR_ORGANIZATION);\n    app.setOrganizationDomain(\"cginternals.com\");\n    app.setApplicationName(QString(QMLTOOLBOX_PROJECT_NAME) + \"_uiconcept\");\n\n    \/\/ Create QtQuick engine\n    qmltoolbox::QmlApplicationEngine engine;\n\n    \/\/ Setup Localization\n    QTranslator translator;\n    translator.load(QLocale::system(), \"uiconcept\", \".\", engine.qmlToolboxModulePath() + \"\/examples\/uiconcept\/i18n\");\n    app.installTranslator(&translator);\n\n#ifdef QMLTOOLBOX_QT54\n    auto fileSelector = QQmlFileSelector::get(&engine);\n    fileSelector->setExtraSelectors(QStringList{ QMLTOOLBOX_QT54 });\n#endif\n\n    \/\/ Load and show QML\n    engine.load(QUrl::fromLocalFile(engine.qmlToolboxModulePath() + \"\/examples\/uiconcept\/window.qml\"));\n    \n    for(auto& window : app.allWindows())\n    {\n        QObject::connect(window, SIGNAL(toFullScreenMode()), window, SLOT(showFullScreen()));\n        QObject::connect(window, SIGNAL(toWindowedMode()), window, SLOT(showNormal()));\n    }\n       \n    \/\/ Run application\n    int res = app.exec();\n\n    \/\/ Stop application\n    return res;\n}\n<commit_msg>Fix compilation for qt < 5.7<commit_after>\n#include <QGuiApplication>\n#include <QQmlFileSelector>\n#include <QStringList>\n#include <QTranslator>\n#include <QWindow>\n\n#include <qmltoolbox\/qmltoolbox-version.h>\n#include <qmltoolbox\/QmlApplicationEngine.h>\n#include <qmltoolbox\/MessageHandler.h>\n\n\nint main(int argc, char *argv[])\n{\n    qInstallMessageHandler(qmltoolbox::globalMessageHandler);\n    qmltoolbox::MessageHandler::instance().installStdHandlers();\n\n#ifdef QMLTOOLBOX_QT57\n    QGuiApplication::setAttribute(Qt::AA_EnableHighDpiScaling);\n#endif\n\n    QGuiApplication app(argc, argv);\n    app.setOrganizationName(QMLTOOLBOX_AUTHOR_ORGANIZATION);\n    app.setOrganizationDomain(\"cginternals.com\");\n    app.setApplicationName(QString(QMLTOOLBOX_PROJECT_NAME) + \"_uiconcept\");\n\n    \/\/ Create QtQuick engine\n    qmltoolbox::QmlApplicationEngine engine;\n\n    \/\/ Setup Localization\n    QTranslator translator;\n    translator.load(QLocale::system(), \"uiconcept\", \".\", engine.qmlToolboxModulePath() + \"\/examples\/uiconcept\/i18n\");\n    app.installTranslator(&translator);\n\n#ifdef QMLTOOLBOX_QT54\n    auto fileSelector = QQmlFileSelector::get(&engine);\n    fileSelector->setExtraSelectors(QStringList{ QMLTOOLBOX_QT54 });\n#endif\n\n    \/\/ Load and show QML\n    engine.load(QUrl::fromLocalFile(engine.qmlToolboxModulePath() + \"\/examples\/uiconcept\/window.qml\"));\n    \n    for(auto& window : app.allWindows())\n    {\n        QObject::connect(window, SIGNAL(toFullScreenMode()), window, SLOT(showFullScreen()));\n        QObject::connect(window, SIGNAL(toWindowedMode()), window, SLOT(showNormal()));\n    }\n       \n    \/\/ Run application\n    int res = app.exec();\n\n    \/\/ Stop application\n    return res;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file   RenderingLoop.hpp\n * @brief  RenderingLoop class prototype.\n * @author zer0\n * @date   2016-04-28\n *\/\n\n#ifndef __INCLUDE_LIBTBAG__LIBTBAG_LOOP_RENDERINGLOOP_HPP__\n#define __INCLUDE_LIBTBAG__LIBTBAG_LOOP_RENDERINGLOOP_HPP__\n\n\/\/ MS compatible compilers support #pragma once\n#if defined(_MSC_VER) && (_MSC_VER >= 1020)\n#pragma once\n#endif\n\n#include <libtbag\/config.h>\n#include <libtbag\/Noncopyable.hpp>\n#include <libtbag\/log\/Log.hpp>\n\n#include <cassert>\n\n#include <mutex>\n#include <atomic>\n#include <chrono>\n#include <thread>\n\n\/\/ Developer only.\n\/\/#define ENABLE_RENDERING_LOOP_DEBUG_VERBOSE\n\n#if defined(ENABLE_RENDERING_LOOP_DEBUG_VERBOSE)\n# define __RENDERING_LOOP_DEBUG_VERBOSE_LOG(format, ...) \\\n    _DIRECT_CONSOLE_LOG(format, __VA_ARGS__)\n#else\n# define __RENDERING_LOOP_DEBUG_VERBOSE_LOG(format, ...)\n#endif\n\n\/\/ -------------------\nNAMESPACE_LIBTBAG_OPEN\n\/\/ -------------------\n\nnamespace loop {\n\n\/**\n * RenderingLoop class prototype.\n *\n * @author zer0\n * @date   2016-04-28\n *\/\ntemplate <typename Unit = std::chrono::nanoseconds>\nclass RenderingLoop : public Noncopyable\n{\npublic:\n    using SystemClock = std::chrono::system_clock;\n    using TimePoint   = SystemClock::time_point;\n    using TimeUnit    = Unit;\n\npublic:\n    struct Callback\n    {\n        using Looper   = RenderingLoop<TimeUnit>;\n\n        virtual void onStart (Looper &) { \/* EMPTY. *\/ }\n        virtual void onEnd   (Looper &) { \/* EMPTY. *\/ }\n\n        virtual void update  (Looper &) { \/* EMPTY. *\/ }\n        virtual void render  (Looper &) { \/* EMPTY. *\/ }\n\n        virtual bool isExit  (Looper &) { return false;   }\n    };\n\n\/\/ User's settings.\nprivate:\n    Callback & _callback;\n    TimeUnit   _time_step;\n\n\/\/ Sync object.\nprivate:\n    std::mutex       _mutex;\n    std::atomic_bool _exit;\n    std::atomic_int  _result_code;\n\n\/\/ Loop variables.\nprivate:\n    TimePoint  _pre_start;\n    TimePoint  _now_start;\n    TimeUnit   _duration;\n    TimeUnit   _time_lag;\n\npublic:\n    RenderingLoop(Callback & callback, TimeUnit step)\n            : _callback(callback)\n            , _time_step(step)\n            , _exit(false)\n            , _result_code(0) {\n        \/\/ EMPTY.\n    }\n\n    ~RenderingLoop() {\n        this->_exit.store(true);\n    }\n\npublic:\n    int run(bool enable_sleep_step = true)\n    {\n        std::lock_guard<std::mutex> guard(_mutex);\n        this->init();\n        this->_callback.onStart(*this);\n        this->loop(enable_sleep_step);\n        this->_callback.onEnd(*this);\n        return _result_code;\n    }\n\n    inline bool isRunning() const noexcept\n    {\n        if (_mutex.try_lock()) {\n            _mutex.unlock();\n            return false;\n        }\n        return true;\n    }\n\nprivate:\n    void init() {\n        this->_pre_start = SystemClock::now();\n        this->_now_start = this->_pre_start;\n        this->_duration  = TimeUnit(0);\n        this->_time_lag  = TimeUnit(0);\n    }\n\nprivate:\n    \/**\n     * Main loop.\n     *\n     * @remarks\n     *  Graphviz code:\n     *   @code\n     *     digraph MainLoop {\n     *         now_time -> duration -> pre_time -> lag -> check_lag;\n     *         check_lag -> update_loop;\n     *         check_lag -> render;\n     *         update_loop -> render;\n     *     }\n     *   @endcode\n     *\/\n    void loop(bool enable_sleep_step) {\n        TimeUnit sleep_time;\n\n        while (!_exit.load()) {\n            _pre_start = _now_start;\n            _now_start = SystemClock::now();\n            _duration  = _now_start - _pre_start;\n            _time_lag += _duration; \/\/ 직전 루프의 경과시간을 TIME_LAG에 더해 준다.\n                                    \/\/ 1루프당 1TIME_STEP을 초과하였는지 확인할 수 있다.\n                                    \/\/ TIME_LAG는 항상 양수를 보장받아야 한다.\n\n            __RENDERING_LOOP_DEBUG_VERBOSE_LOG(\n                    \"START LOOP: PRE[%09lld] NOW[%09lld] LAG[%09lld] DUR[%09lld] STEP[%09lld]\\n\"\n                    , _pre_start.time_since_epoch().count()\n                    , _now_start.time_since_epoch().count()\n                    , _time_lag.count()\n                    , _duration.count()\n                    , _time_step.count());\n\n            assert(_pre_start.time_since_epoch().count() <= _now_start.time_since_epoch().count());\n            assert(_duration.count() >= 0);\n            assert(_time_lag.count() >= 0);\n\n            \/\/ 1루프 당 1회의 업데이트를 위한 중첩 LOOP.\n            while (_time_lag >= _time_step) {\n\n                \/\/ 1루프 당 1회의 업데이트를 보장하기 위해 아래와 같이 TIME_STEP 뺀다.\n                _time_lag -= _time_step;\n\n                __RENDERING_LOOP_DEBUG_VERBOSE_LOG(\n                        \"UPDATE LOOP: LAG[%09lld] DUR[%09lld]\\n\"\n                        , _time_lag.count()\n                        , _duration.count());\n\n                \/\/ 만약 이벤트 확보를 위한 EVENT 콜백이 필요하다면 UPDATE 콜백에 추가한다.\n                _callback.update(*this);\n            }\n\n            assert(_time_lag.count() >= 0);\n\n            __RENDERING_LOOP_DEBUG_VERBOSE_LOG(\n                    \"RENDER: LAG[%09lld] DURA[%09lld]\\n\"\n                    , _time_lag.count()\n                    , _duration.count());\n\n            _callback.render(*this);\n\n            if (enable_sleep_step) {\n                \/\/ 1루프를 1TIME_STEP 보다 더 빠르게 끝냈을 경우\n                \/\/ 강제로 1TIME_STEP을 맞추기 위한 SLEEP.\n                sleep_time = SystemClock::now() - _now_start;\n                if (sleep_time < _time_step) {\n\n                    __RENDERING_LOOP_DEBUG_VERBOSE_LOG(\n                            \"SLEEP TIME: %09lld\\n\", sleep_time.count());\n\n                    \/\/ std::this_thread::yield();\n                    std::this_thread::sleep_for(_time_step - sleep_time);\n                }\n            }\n\n            if (_callback.isExit(*this) == true) {\n                _exit.store(true);\n                break;\n            }\n        }\n    }\n\npublic:\n    inline TimeUnit getTimeStep() const noexcept {\n        return this->_time_step;\n    }\n\n\/\/ Sync object.\npublic:\n    inline void setExit(bool exit = true) noexcept {\n        this->_exit = exit;\n    }\n\n    inline void exit() noexcept {\n        this->setExit(true);\n    }\n\n    inline void setResultCode(int code) noexcept {\n        this->_result_code = code;\n    }\n\n\/\/ Loop variables.\npublic:\n    inline TimePoint getPreStart() const noexcept {\n        return this->_pre_start;\n    }\n\n    inline TimePoint getNowStart() const noexcept {\n        return this->_now_start;\n    }\n\n    inline TimeUnit  getDuration() const noexcept {\n        return this->_duration;\n    }\n\n    inline TimeUnit  getTimeLag() const noexcept {\n        return this->_time_lag;\n    }\n};\n\n} \/\/ namespace loop\n\n\/\/ --------------------\nNAMESPACE_LIBTBAG_CLOSE\n\/\/ --------------------\n\n#endif \/\/ __INCLUDE_LIBTBAG__LIBTBAG_LOOP_RENDERINGLOOP_HPP__\n\n<commit_msg>Fix the compile error.<commit_after>\/**\n * @file   RenderingLoop.hpp\n * @brief  RenderingLoop class prototype.\n * @author zer0\n * @date   2016-04-28\n *\/\n\n#ifndef __INCLUDE_LIBTBAG__LIBTBAG_LOOP_RENDERINGLOOP_HPP__\n#define __INCLUDE_LIBTBAG__LIBTBAG_LOOP_RENDERINGLOOP_HPP__\n\n\/\/ MS compatible compilers support #pragma once\n#if defined(_MSC_VER) && (_MSC_VER >= 1020)\n#pragma once\n#endif\n\n#include <libtbag\/config.h>\n#include <libtbag\/Noncopyable.hpp>\n#include <libtbag\/log\/Log.hpp>\n\n#include <cassert>\n\n#include <mutex>\n#include <atomic>\n#include <chrono>\n#include <thread>\n\n\/\/ Developer only.\n\/\/#define ENABLE_RENDERING_LOOP_DEBUG_VERBOSE\n\n#if defined(ENABLE_RENDERING_LOOP_DEBUG_VERBOSE)\n# define __RENDERING_LOOP_DEBUG_VERBOSE_LOG(format, ...) \\\n    _DIRECT_CONSOLE_LOG(format, __VA_ARGS__)\n#else\n# define __RENDERING_LOOP_DEBUG_VERBOSE_LOG(format, ...)\n#endif\n\n\/\/ -------------------\nNAMESPACE_LIBTBAG_OPEN\n\/\/ -------------------\n\nnamespace loop {\n\n\/**\n * RenderingLoop class prototype.\n *\n * @author zer0\n * @date   2016-04-28\n *\/\ntemplate <typename Unit = std::chrono::nanoseconds>\nclass RenderingLoop : public Noncopyable\n{\npublic:\n    using SystemClock = std::chrono::system_clock;\n    using TimePoint   = SystemClock::time_point;\n    using TimeUnit    = Unit;\n\npublic:\n    struct Callback\n    {\n        using Looper   = RenderingLoop<TimeUnit>;\n\n        virtual void onStart (Looper &) { \/* EMPTY. *\/ }\n        virtual void onEnd   (Looper &) { \/* EMPTY. *\/ }\n\n        virtual void update  (Looper &) { \/* EMPTY. *\/ }\n        virtual void render  (Looper &) { \/* EMPTY. *\/ }\n\n        virtual bool isExit  (Looper &) { return false;   }\n    };\n\n\/\/ User's settings.\nprivate:\n    Callback & _callback;\n    TimeUnit   _time_step;\n\n\/\/ Sync object.\nprivate:\n    mutable std::mutex _mutex;\n    std::atomic_bool   _exit;\n    std::atomic_int    _result_code;\n\n\/\/ Loop variables.\nprivate:\n    TimePoint  _pre_start;\n    TimePoint  _now_start;\n    TimeUnit   _duration;\n    TimeUnit   _time_lag;\n\npublic:\n    RenderingLoop(Callback & callback, TimeUnit step)\n            : _callback(callback)\n            , _time_step(step)\n            , _exit(false)\n            , _result_code(0) {\n        \/\/ EMPTY.\n    }\n\n    ~RenderingLoop() {\n        this->_exit.store(true);\n    }\n\npublic:\n    int run(bool enable_sleep_step = true)\n    {\n        std::lock_guard<std::mutex> guard(_mutex);\n        this->init();\n        this->_callback.onStart(*this);\n        this->loop(enable_sleep_step);\n        this->_callback.onEnd(*this);\n        return _result_code;\n    }\n\n    inline bool isRunning() const noexcept\n    {\n        if (_mutex.try_lock()) {\n            _mutex.unlock();\n            return false;\n        }\n        return true;\n    }\n\nprivate:\n    void init() {\n        this->_pre_start = SystemClock::now();\n        this->_now_start = this->_pre_start;\n        this->_duration  = TimeUnit(0);\n        this->_time_lag  = TimeUnit(0);\n    }\n\nprivate:\n    \/**\n     * Main loop.\n     *\n     * @remarks\n     *  Graphviz code:\n     *   @code\n     *     digraph MainLoop {\n     *         now_time -> duration -> pre_time -> lag -> check_lag;\n     *         check_lag -> update_loop;\n     *         check_lag -> render;\n     *         update_loop -> render;\n     *     }\n     *   @endcode\n     *\/\n    void loop(bool enable_sleep_step) {\n        TimeUnit sleep_time;\n\n        while (!_exit.load()) {\n            _pre_start = _now_start;\n            _now_start = SystemClock::now();\n            _duration  = _now_start - _pre_start;\n            _time_lag += _duration; \/\/ 직전 루프의 경과시간을 TIME_LAG에 더해 준다.\n                                    \/\/ 1루프당 1TIME_STEP을 초과하였는지 확인할 수 있다.\n                                    \/\/ TIME_LAG는 항상 양수를 보장받아야 한다.\n\n            __RENDERING_LOOP_DEBUG_VERBOSE_LOG(\n                    \"START LOOP: PRE[%09lld] NOW[%09lld] LAG[%09lld] DUR[%09lld] STEP[%09lld]\\n\"\n                    , _pre_start.time_since_epoch().count()\n                    , _now_start.time_since_epoch().count()\n                    , _time_lag.count()\n                    , _duration.count()\n                    , _time_step.count());\n\n            assert(_pre_start.time_since_epoch().count() <= _now_start.time_since_epoch().count());\n            assert(_duration.count() >= 0);\n            assert(_time_lag.count() >= 0);\n\n            \/\/ 1루프 당 1회의 업데이트를 위한 중첩 LOOP.\n            while (_time_lag >= _time_step) {\n\n                \/\/ 1루프 당 1회의 업데이트를 보장하기 위해 아래와 같이 TIME_STEP 뺀다.\n                _time_lag -= _time_step;\n\n                __RENDERING_LOOP_DEBUG_VERBOSE_LOG(\n                        \"UPDATE LOOP: LAG[%09lld] DUR[%09lld]\\n\"\n                        , _time_lag.count()\n                        , _duration.count());\n\n                \/\/ 만약 이벤트 확보를 위한 EVENT 콜백이 필요하다면 UPDATE 콜백에 추가한다.\n                _callback.update(*this);\n            }\n\n            assert(_time_lag.count() >= 0);\n\n            __RENDERING_LOOP_DEBUG_VERBOSE_LOG(\n                    \"RENDER: LAG[%09lld] DURA[%09lld]\\n\"\n                    , _time_lag.count()\n                    , _duration.count());\n\n            _callback.render(*this);\n\n            if (enable_sleep_step) {\n                \/\/ 1루프를 1TIME_STEP 보다 더 빠르게 끝냈을 경우\n                \/\/ 강제로 1TIME_STEP을 맞추기 위한 SLEEP.\n                sleep_time = SystemClock::now() - _now_start;\n                if (sleep_time < _time_step) {\n\n                    __RENDERING_LOOP_DEBUG_VERBOSE_LOG(\n                            \"SLEEP TIME: %09lld\\n\", sleep_time.count());\n\n                    \/\/ std::this_thread::yield();\n                    std::this_thread::sleep_for(_time_step - sleep_time);\n                }\n            }\n\n            if (_callback.isExit(*this) == true) {\n                _exit.store(true);\n                break;\n            }\n        }\n    }\n\npublic:\n    inline TimeUnit getTimeStep() const noexcept {\n        return this->_time_step;\n    }\n\n\/\/ Sync object.\npublic:\n    inline void setExit(bool exit = true) noexcept {\n        this->_exit = exit;\n    }\n\n    inline void exit() noexcept {\n        this->setExit(true);\n    }\n\n    inline void setResultCode(int code) noexcept {\n        this->_result_code = code;\n    }\n\n\/\/ Loop variables.\npublic:\n    inline TimePoint getPreStart() const noexcept {\n        return this->_pre_start;\n    }\n\n    inline TimePoint getNowStart() const noexcept {\n        return this->_now_start;\n    }\n\n    inline TimeUnit  getDuration() const noexcept {\n        return this->_duration;\n    }\n\n    inline TimeUnit  getTimeLag() const noexcept {\n        return this->_time_lag;\n    }\n};\n\n} \/\/ namespace loop\n\n\/\/ --------------------\nNAMESPACE_LIBTBAG_CLOSE\n\/\/ --------------------\n\n#endif \/\/ __INCLUDE_LIBTBAG__LIBTBAG_LOOP_RENDERINGLOOP_HPP__\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: RegressionCurveHelper.cxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: fa $ $Date: 2004-03-08 16:03:50 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2003 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#include \"RegressionCurveHelper.hxx\"\n#include \"ContextHelper.hxx\"\n#include \"MeanValueRegressionCurveCalculator.hxx\"\n#include \"LinearRegressionCurveCalculator.hxx\"\n#include \"LogarithmicRegressionCurveCalculator.hxx\"\n#include \"ExponentialRegressionCurveCalculator.hxx\"\n#include \"PotentialRegressionCurveCalculator.hxx\"\n#include \"CommonConverters.hxx\"\n#include \"RegressionCurveModel.hxx\"\n#include \"ChartTypeHelper.hxx\"\n#include \"ChartModelHelper.hxx\"\n#include \"macros.hxx\"\n\n#ifndef _COM_SUN_STAR_CHART2_XCHARTDOCUMENT_HPP_\n#include <com\/sun\/star\/chart2\/XChartDocument.hpp>\n#endif\n\n\/\/.............................................................................\nnamespace chart\n{\n\/\/.............................................................................\n\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::chart2;\n\nusing ::com::sun::star::uno::Reference;\nusing ::com::sun::star::uno::Sequence;\nusing ::com::sun::star::uno::XComponentContext;\nusing ::com::sun::star::lang::XServiceName;\nusing ::com::sun::star::beans::XPropertySet;\nusing ::com::sun::star::uno::Exception;\n\n\/\/ static\nReference< XRegressionCurve > RegressionCurveHelper::createMeanValueLine(\n    const Reference< XComponentContext > & xContext )\n{\n    ContextHelper::tContextEntryMapType aContextValues(\n        ContextHelper::MakeContextEntryMap(\n            ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"Identifier\" )), uno::makeAny(\n                ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"@mean-value-line\" )))));\n\n    return Reference< XRegressionCurve >(\n        new RegressionCurveModel( ContextHelper::createContext( aContextValues, xContext ),\n                                  RegressionCurveModel::CURVE_TYPE_MEAN_VALUE ));\n}\n\n\/\/ static\nReference< XRegressionCurve > RegressionCurveHelper::createRegressionCurveByServiceName(\n    const Reference< XComponentContext > & xContext,\n    ::rtl::OUString aServiceName )\n{\n    Reference< XRegressionCurve > xResult;\n\n    \/\/ todo: use factory methods with service name\n    if( aServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(\n                \"com.sun.star.chart2.LinearRegressionCurve\" )))\n    {\n        ContextHelper::tContextEntryMapType aContextValues(\n            ContextHelper::MakeContextEntryMap(\n                ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"Identifier\" )), uno::makeAny(\n                    ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"@linear-regression\" )))));\n\n        xResult.set(\n            new RegressionCurveModel( ContextHelper::createContext( aContextValues, xContext ),\n                                      RegressionCurveModel::CURVE_TYPE_LINEAR ));\n    }\n    else if( aServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(\n                     \"com.sun.star.chart2.LogarithmicRegressionCurve\" )))\n    {\n        ContextHelper::tContextEntryMapType aContextValues(\n            ContextHelper::MakeContextEntryMap(\n                ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"Identifier\" )), uno::makeAny(\n                    ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"@logarithmic-regression\" )))));\n\n        xResult.set(\n            new RegressionCurveModel( ContextHelper::createContext( aContextValues, xContext ),\n                                      RegressionCurveModel::CURVE_TYPE_LOGARITHM ));\n    }\n    else if( aServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(\n                     \"com.sun.star.chart2.ExponentialRegressionCurve\" )))\n    {\n        ContextHelper::tContextEntryMapType aContextValues(\n            ContextHelper::MakeContextEntryMap(\n                ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"Identifier\" )), uno::makeAny(\n                    ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"@exponential-regression\" )))));\n\n        xResult.set(\n            new RegressionCurveModel( ContextHelper::createContext( aContextValues, xContext ),\n                                      RegressionCurveModel::CURVE_TYPE_EXPONENTIAL ));\n    }\n    else if( aServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(\n                     \"com.sun.star.chart2.PotentialRegressionCurve\" )))\n    {\n        ContextHelper::tContextEntryMapType aContextValues(\n            ContextHelper::MakeContextEntryMap(\n                ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"Identifier\" )), uno::makeAny(\n                    ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"@potential-regression\" )))));\n\n        xResult.set(\n            new RegressionCurveModel( ContextHelper::createContext( aContextValues, xContext ),\n                                      RegressionCurveModel::CURVE_TYPE_POWER ));\n    }\n\n    return xResult;\n}\n\n\/\/ ------------------------------------------------------------\n\n\/\/ static\nReference< XRegressionCurveCalculator > RegressionCurveHelper::createMeanValueLineCalculator()\n{\n    return Reference< XRegressionCurveCalculator >( new MeanValueRegressionCurveCalculator());\n}\n\n\/\/ static\nReference< XRegressionCurveCalculator > RegressionCurveHelper::createRegressionCurveCalculatorByServiceName(\n    ::rtl::OUString aServiceName )\n{\n    Reference< XRegressionCurveCalculator > xResult;\n\n    \/\/ todo: use factory methods with service name\n    if( aServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(\n                     \"com.sun.star.chart2.MeanValueRegressionCurve\" )))\n    {\n        xResult.set( new MeanValueRegressionCurveCalculator());\n    }\n    if( aServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(\n                     \"com.sun.star.chart2.LinearRegressionCurve\" )))\n    {\n        xResult.set( new LinearRegressionCurveCalculator());\n    }\n    else if( aServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(\n                     \"com.sun.star.chart2.LogarithmicRegressionCurve\" )))\n    {\n        xResult.set( new LogarithmicRegressionCurveCalculator());\n    }\n    else if( aServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(\n                     \"com.sun.star.chart2.ExponentialRegressionCurve\" )))\n    {\n        xResult.set( new ExponentialRegressionCurveCalculator());\n    }\n    else if( aServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(\n                     \"com.sun.star.chart2.PotentialRegressionCurve\" )))\n    {\n        xResult.set( new PotentialRegressionCurveCalculator());\n    }\n\n    return xResult;\n}\n\n\/\/ static\nvoid RegressionCurveHelper::initializeCurveCalculator(\n    const Reference< XRegressionCurveCalculator > & xOutCurveCalculator,\n    const Reference< XDataSource > & xSource,\n    bool bUseXValuesIfAvailable \/* = true *\/ )\n{\n    if( ! (xOutCurveCalculator.is() &&\n           xSource.is() ))\n        return;\n\n    Sequence< double > aXValues, aYValues;\n    bool bXValuesFound = false, bYValuesFound = false;\n\n    Sequence< Reference< XDataSequence > > aDataSeqs( xSource->getDataSequences());\n    sal_Int32 i = 0;\n    for( i=0;\n         ! (bXValuesFound && bYValuesFound) && i<aDataSeqs.getLength();\n         ++i )\n    {\n        try\n        {\n            Reference< XPropertySet > xProp( aDataSeqs[i], uno::UNO_QUERY_THROW );\n            ::rtl::OUString aRole;\n            if( xProp->getPropertyValue(\n                    ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"Role\" ))) >>= aRole )\n            {\n                if( bUseXValuesIfAvailable &&\n                    ! bXValuesFound &&\n                    aRole.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM( \"x-values\" )))\n                {\n                    aXValues = DataSequenceToDoubleSequence( aDataSeqs[i] );\n                    bXValuesFound = true;\n                }\n                else if( ! bYValuesFound &&\n                         aRole.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM( \"y-values\" )))\n                {\n                    aYValues = DataSequenceToDoubleSequence( aDataSeqs[i] );\n                    bYValuesFound = true;\n                }\n            }\n        }\n        catch( Exception )\n        {\n        }\n    }\n\n    if( ! bXValuesFound &&\n        bYValuesFound )\n    {\n        \/\/ initialize with 1, 2, ...\n        aXValues.realloc( aYValues.getLength());\n        for( i=0; i<aXValues.getLength(); ++i )\n            aXValues[i] = i+1;\n        bXValuesFound = true;\n    }\n\n    if( bXValuesFound && bYValuesFound &&\n        aXValues.getLength() > 0 &&\n        aYValues.getLength() > 0 )\n        xOutCurveCalculator->recalculateRegression( aXValues, aYValues );\n}\n\n\/\/ static\nvoid RegressionCurveHelper::initializeCurveCalculator(\n    const Reference< XRegressionCurveCalculator > & xOutCurveCalculator,\n    const Reference< XDataSeries > & xSeries,\n    const Reference< frame::XModel > & xModel )\n{\n    AxisType eAxisType = ChartTypeHelper::getAxisType(\n        ChartModelHelper::getChartTypeOfSeries( xModel, xSeries ), 0 ); \/\/ x-axis\n\n    initializeCurveCalculator( xOutCurveCalculator,\n                               uno::Reference< XDataSource >( xSeries, uno::UNO_QUERY ),\n                               (eAxisType == AxisType_REALNUMBER) );\n}\n\n\/\/ ----------------------------------------\n\n\/\/ static\nbool RegressionCurveHelper::hasMeanValueLine(\n    const uno::Reference< XRegressionCurveContainer > & xRegCnt )\n{\n    bool bResult = false;\n\n    if( !xRegCnt.is())\n        return bResult;\n\n    try\n    {\n        uno::Sequence< uno::Reference< XRegressionCurve > > aCurves(\n            xRegCnt->getRegressionCurves());\n        for( sal_Int32 i = 0; i < aCurves.getLength(); ++i )\n        {\n            uno::Reference< XServiceName > xServName( aCurves[i], uno::UNO_QUERY );\n            if( xServName.is() &&\n                xServName->getServiceName().equals(\n                    C2U( \"com.sun.star.chart2.MeanValueRegressionCurve\" )))\n            {\n                bResult = true;\n                break;\n            }\n        }\n    }\n    catch( Exception & ex )\n    {\n        ASSERT_EXCEPTION( ex );\n    }\n\n    return bResult;\n}\n\n\/\/ static\nvoid RegressionCurveHelper::addMeanValueLine(\n    uno::Reference< XRegressionCurveContainer > & xRegCnt,\n    const uno::Reference< XComponentContext > & xContext,\n    const uno::Reference< XPropertySet > & xSeriesProp )\n{\n    if( !xRegCnt.is() ||\n        ::chart::RegressionCurveHelper::hasMeanValueLine( xRegCnt ) )\n        return;\n\n    \/\/ todo: use a valid context\n    uno::Reference< XRegressionCurve > xCurve( createMeanValueLine( xContext ));\n    xRegCnt->addRegressionCurve( xCurve );\n\n    if( xSeriesProp.is())\n    {\n        uno::Reference< XPropertySet > xProp( xCurve, uno::UNO_QUERY );\n        if( xProp.is())\n        {\n            xProp->setPropertyValue( C2U( \"LineColor\" ),\n                                     xSeriesProp->getPropertyValue( C2U( \"Color\" )));\n        }\n    }\n}\n\n\/\/ static\nvoid RegressionCurveHelper::removeMeanValueLine(\n    Reference< XRegressionCurveContainer > & xRegCnt )\n{\n    if( !xRegCnt.is())\n        return;\n\n    try\n    {\n        Sequence< Reference< XRegressionCurve > > aCurves(\n            xRegCnt->getRegressionCurves());\n        for( sal_Int32 i = 0; i < aCurves.getLength(); ++i )\n        {\n            Reference< XServiceName > xServName( aCurves[i], uno::UNO_QUERY );\n            if( xServName.is() &&\n                xServName->getServiceName().equals(\n                    C2U( \"com.sun.star.chart2.MeanValueRegressionCurve\" )))\n            {\n                xRegCnt->removeRegressionCurve( aCurves[i] );\n                \/\/ attention: the iterator i has become invalid now\n\n                \/\/ note: assume that there is only one mean-value curve\n                \/\/ to remove multiple mean-value curves remove the break\n                break;\n            }\n        }\n    }\n    catch( Exception & ex )\n    {\n        ASSERT_EXCEPTION( ex );\n    }\n}\n\n\/\/ static\nRegressionCurveHelper::tRegressionType RegressionCurveHelper::getRegressType(\n    const Reference< XRegressionCurveContainer > & xRegCnt )\n{\n    tRegressionType eResult = REGRESSION_TYPE_NONE;\n\n    if( xRegCnt.is())\n    {\n        try\n        {\n            Sequence< Reference< XRegressionCurve > > aCurves(\n                xRegCnt->getRegressionCurves());\n            for( sal_Int32 i = 0; i < aCurves.getLength(); ++i )\n            {\n                Reference< lang::XServiceName > xServName( aCurves[i], uno::UNO_QUERY );\n                if( xServName.is())\n                {\n                    ::rtl::OUString aServiceName( xServName->getServiceName() );\n\n                    \/\/ note: take first regression curve that matches any known\n                    \/\/ type (except mean-value line)\n                    if( aServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(\n                                \"com.sun.star.chart2.LinearRegressionCurve\" )))\n                    {\n                        eResult = REGRESSION_TYPE_LINEAR;\n                        break;\n                    }\n                    else if( aServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(\n                                \"com.sun.star.chart2.LogarithmicRegressionCurve\" )))\n                    {\n                        eResult = REGRESSION_TYPE_LOG;\n                        break;\n                    }\n                    else if( aServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(\n                                \"com.sun.star.chart2.ExponentialRegressionCurve\" )))\n                    {\n                        eResult = REGRESSION_TYPE_EXP;\n                        break;\n                    }\n                    else if( aServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(\n                                \"com.sun.star.chart2.PotentialRegressionCurve\" )))\n                    {\n                        eResult = REGRESSION_TYPE_POWER;\n                        break;\n                    }\n                }\n            }\n        }\n        catch( Exception & ex )\n        {\n            ASSERT_EXCEPTION( ex );\n        }\n    }\n\n    return eResult;\n}\n\n\/\/.............................................................................\n} \/\/namespace chart\n\/\/.............................................................................\n<commit_msg>INTEGRATION: CWS ooo19126 (1.7.106); FILE MERGED 2005\/09\/05 18:43:34 rt 1.7.106.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: RegressionCurveHelper.cxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 01:33: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#include \"RegressionCurveHelper.hxx\"\n#include \"ContextHelper.hxx\"\n#include \"MeanValueRegressionCurveCalculator.hxx\"\n#include \"LinearRegressionCurveCalculator.hxx\"\n#include \"LogarithmicRegressionCurveCalculator.hxx\"\n#include \"ExponentialRegressionCurveCalculator.hxx\"\n#include \"PotentialRegressionCurveCalculator.hxx\"\n#include \"CommonConverters.hxx\"\n#include \"RegressionCurveModel.hxx\"\n#include \"ChartTypeHelper.hxx\"\n#include \"ChartModelHelper.hxx\"\n#include \"macros.hxx\"\n\n#ifndef _COM_SUN_STAR_CHART2_XCHARTDOCUMENT_HPP_\n#include <com\/sun\/star\/chart2\/XChartDocument.hpp>\n#endif\n\n\/\/.............................................................................\nnamespace chart\n{\n\/\/.............................................................................\n\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::chart2;\n\nusing ::com::sun::star::uno::Reference;\nusing ::com::sun::star::uno::Sequence;\nusing ::com::sun::star::uno::XComponentContext;\nusing ::com::sun::star::lang::XServiceName;\nusing ::com::sun::star::beans::XPropertySet;\nusing ::com::sun::star::uno::Exception;\n\n\/\/ static\nReference< XRegressionCurve > RegressionCurveHelper::createMeanValueLine(\n    const Reference< XComponentContext > & xContext )\n{\n    ContextHelper::tContextEntryMapType aContextValues(\n        ContextHelper::MakeContextEntryMap(\n            ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"Identifier\" )), uno::makeAny(\n                ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"@mean-value-line\" )))));\n\n    return Reference< XRegressionCurve >(\n        new RegressionCurveModel( ContextHelper::createContext( aContextValues, xContext ),\n                                  RegressionCurveModel::CURVE_TYPE_MEAN_VALUE ));\n}\n\n\/\/ static\nReference< XRegressionCurve > RegressionCurveHelper::createRegressionCurveByServiceName(\n    const Reference< XComponentContext > & xContext,\n    ::rtl::OUString aServiceName )\n{\n    Reference< XRegressionCurve > xResult;\n\n    \/\/ todo: use factory methods with service name\n    if( aServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(\n                \"com.sun.star.chart2.LinearRegressionCurve\" )))\n    {\n        ContextHelper::tContextEntryMapType aContextValues(\n            ContextHelper::MakeContextEntryMap(\n                ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"Identifier\" )), uno::makeAny(\n                    ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"@linear-regression\" )))));\n\n        xResult.set(\n            new RegressionCurveModel( ContextHelper::createContext( aContextValues, xContext ),\n                                      RegressionCurveModel::CURVE_TYPE_LINEAR ));\n    }\n    else if( aServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(\n                     \"com.sun.star.chart2.LogarithmicRegressionCurve\" )))\n    {\n        ContextHelper::tContextEntryMapType aContextValues(\n            ContextHelper::MakeContextEntryMap(\n                ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"Identifier\" )), uno::makeAny(\n                    ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"@logarithmic-regression\" )))));\n\n        xResult.set(\n            new RegressionCurveModel( ContextHelper::createContext( aContextValues, xContext ),\n                                      RegressionCurveModel::CURVE_TYPE_LOGARITHM ));\n    }\n    else if( aServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(\n                     \"com.sun.star.chart2.ExponentialRegressionCurve\" )))\n    {\n        ContextHelper::tContextEntryMapType aContextValues(\n            ContextHelper::MakeContextEntryMap(\n                ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"Identifier\" )), uno::makeAny(\n                    ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"@exponential-regression\" )))));\n\n        xResult.set(\n            new RegressionCurveModel( ContextHelper::createContext( aContextValues, xContext ),\n                                      RegressionCurveModel::CURVE_TYPE_EXPONENTIAL ));\n    }\n    else if( aServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(\n                     \"com.sun.star.chart2.PotentialRegressionCurve\" )))\n    {\n        ContextHelper::tContextEntryMapType aContextValues(\n            ContextHelper::MakeContextEntryMap(\n                ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"Identifier\" )), uno::makeAny(\n                    ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"@potential-regression\" )))));\n\n        xResult.set(\n            new RegressionCurveModel( ContextHelper::createContext( aContextValues, xContext ),\n                                      RegressionCurveModel::CURVE_TYPE_POWER ));\n    }\n\n    return xResult;\n}\n\n\/\/ ------------------------------------------------------------\n\n\/\/ static\nReference< XRegressionCurveCalculator > RegressionCurveHelper::createMeanValueLineCalculator()\n{\n    return Reference< XRegressionCurveCalculator >( new MeanValueRegressionCurveCalculator());\n}\n\n\/\/ static\nReference< XRegressionCurveCalculator > RegressionCurveHelper::createRegressionCurveCalculatorByServiceName(\n    ::rtl::OUString aServiceName )\n{\n    Reference< XRegressionCurveCalculator > xResult;\n\n    \/\/ todo: use factory methods with service name\n    if( aServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(\n                     \"com.sun.star.chart2.MeanValueRegressionCurve\" )))\n    {\n        xResult.set( new MeanValueRegressionCurveCalculator());\n    }\n    if( aServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(\n                     \"com.sun.star.chart2.LinearRegressionCurve\" )))\n    {\n        xResult.set( new LinearRegressionCurveCalculator());\n    }\n    else if( aServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(\n                     \"com.sun.star.chart2.LogarithmicRegressionCurve\" )))\n    {\n        xResult.set( new LogarithmicRegressionCurveCalculator());\n    }\n    else if( aServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(\n                     \"com.sun.star.chart2.ExponentialRegressionCurve\" )))\n    {\n        xResult.set( new ExponentialRegressionCurveCalculator());\n    }\n    else if( aServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(\n                     \"com.sun.star.chart2.PotentialRegressionCurve\" )))\n    {\n        xResult.set( new PotentialRegressionCurveCalculator());\n    }\n\n    return xResult;\n}\n\n\/\/ static\nvoid RegressionCurveHelper::initializeCurveCalculator(\n    const Reference< XRegressionCurveCalculator > & xOutCurveCalculator,\n    const Reference< XDataSource > & xSource,\n    bool bUseXValuesIfAvailable \/* = true *\/ )\n{\n    if( ! (xOutCurveCalculator.is() &&\n           xSource.is() ))\n        return;\n\n    Sequence< double > aXValues, aYValues;\n    bool bXValuesFound = false, bYValuesFound = false;\n\n    Sequence< Reference< XDataSequence > > aDataSeqs( xSource->getDataSequences());\n    sal_Int32 i = 0;\n    for( i=0;\n         ! (bXValuesFound && bYValuesFound) && i<aDataSeqs.getLength();\n         ++i )\n    {\n        try\n        {\n            Reference< XPropertySet > xProp( aDataSeqs[i], uno::UNO_QUERY_THROW );\n            ::rtl::OUString aRole;\n            if( xProp->getPropertyValue(\n                    ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"Role\" ))) >>= aRole )\n            {\n                if( bUseXValuesIfAvailable &&\n                    ! bXValuesFound &&\n                    aRole.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM( \"x-values\" )))\n                {\n                    aXValues = DataSequenceToDoubleSequence( aDataSeqs[i] );\n                    bXValuesFound = true;\n                }\n                else if( ! bYValuesFound &&\n                         aRole.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM( \"y-values\" )))\n                {\n                    aYValues = DataSequenceToDoubleSequence( aDataSeqs[i] );\n                    bYValuesFound = true;\n                }\n            }\n        }\n        catch( Exception )\n        {\n        }\n    }\n\n    if( ! bXValuesFound &&\n        bYValuesFound )\n    {\n        \/\/ initialize with 1, 2, ...\n        aXValues.realloc( aYValues.getLength());\n        for( i=0; i<aXValues.getLength(); ++i )\n            aXValues[i] = i+1;\n        bXValuesFound = true;\n    }\n\n    if( bXValuesFound && bYValuesFound &&\n        aXValues.getLength() > 0 &&\n        aYValues.getLength() > 0 )\n        xOutCurveCalculator->recalculateRegression( aXValues, aYValues );\n}\n\n\/\/ static\nvoid RegressionCurveHelper::initializeCurveCalculator(\n    const Reference< XRegressionCurveCalculator > & xOutCurveCalculator,\n    const Reference< XDataSeries > & xSeries,\n    const Reference< frame::XModel > & xModel )\n{\n    AxisType eAxisType = ChartTypeHelper::getAxisType(\n        ChartModelHelper::getChartTypeOfSeries( xModel, xSeries ), 0 ); \/\/ x-axis\n\n    initializeCurveCalculator( xOutCurveCalculator,\n                               uno::Reference< XDataSource >( xSeries, uno::UNO_QUERY ),\n                               (eAxisType == AxisType_REALNUMBER) );\n}\n\n\/\/ ----------------------------------------\n\n\/\/ static\nbool RegressionCurveHelper::hasMeanValueLine(\n    const uno::Reference< XRegressionCurveContainer > & xRegCnt )\n{\n    bool bResult = false;\n\n    if( !xRegCnt.is())\n        return bResult;\n\n    try\n    {\n        uno::Sequence< uno::Reference< XRegressionCurve > > aCurves(\n            xRegCnt->getRegressionCurves());\n        for( sal_Int32 i = 0; i < aCurves.getLength(); ++i )\n        {\n            uno::Reference< XServiceName > xServName( aCurves[i], uno::UNO_QUERY );\n            if( xServName.is() &&\n                xServName->getServiceName().equals(\n                    C2U( \"com.sun.star.chart2.MeanValueRegressionCurve\" )))\n            {\n                bResult = true;\n                break;\n            }\n        }\n    }\n    catch( Exception & ex )\n    {\n        ASSERT_EXCEPTION( ex );\n    }\n\n    return bResult;\n}\n\n\/\/ static\nvoid RegressionCurveHelper::addMeanValueLine(\n    uno::Reference< XRegressionCurveContainer > & xRegCnt,\n    const uno::Reference< XComponentContext > & xContext,\n    const uno::Reference< XPropertySet > & xSeriesProp )\n{\n    if( !xRegCnt.is() ||\n        ::chart::RegressionCurveHelper::hasMeanValueLine( xRegCnt ) )\n        return;\n\n    \/\/ todo: use a valid context\n    uno::Reference< XRegressionCurve > xCurve( createMeanValueLine( xContext ));\n    xRegCnt->addRegressionCurve( xCurve );\n\n    if( xSeriesProp.is())\n    {\n        uno::Reference< XPropertySet > xProp( xCurve, uno::UNO_QUERY );\n        if( xProp.is())\n        {\n            xProp->setPropertyValue( C2U( \"LineColor\" ),\n                                     xSeriesProp->getPropertyValue( C2U( \"Color\" )));\n        }\n    }\n}\n\n\/\/ static\nvoid RegressionCurveHelper::removeMeanValueLine(\n    Reference< XRegressionCurveContainer > & xRegCnt )\n{\n    if( !xRegCnt.is())\n        return;\n\n    try\n    {\n        Sequence< Reference< XRegressionCurve > > aCurves(\n            xRegCnt->getRegressionCurves());\n        for( sal_Int32 i = 0; i < aCurves.getLength(); ++i )\n        {\n            Reference< XServiceName > xServName( aCurves[i], uno::UNO_QUERY );\n            if( xServName.is() &&\n                xServName->getServiceName().equals(\n                    C2U( \"com.sun.star.chart2.MeanValueRegressionCurve\" )))\n            {\n                xRegCnt->removeRegressionCurve( aCurves[i] );\n                \/\/ attention: the iterator i has become invalid now\n\n                \/\/ note: assume that there is only one mean-value curve\n                \/\/ to remove multiple mean-value curves remove the break\n                break;\n            }\n        }\n    }\n    catch( Exception & ex )\n    {\n        ASSERT_EXCEPTION( ex );\n    }\n}\n\n\/\/ static\nRegressionCurveHelper::tRegressionType RegressionCurveHelper::getRegressType(\n    const Reference< XRegressionCurveContainer > & xRegCnt )\n{\n    tRegressionType eResult = REGRESSION_TYPE_NONE;\n\n    if( xRegCnt.is())\n    {\n        try\n        {\n            Sequence< Reference< XRegressionCurve > > aCurves(\n                xRegCnt->getRegressionCurves());\n            for( sal_Int32 i = 0; i < aCurves.getLength(); ++i )\n            {\n                Reference< lang::XServiceName > xServName( aCurves[i], uno::UNO_QUERY );\n                if( xServName.is())\n                {\n                    ::rtl::OUString aServiceName( xServName->getServiceName() );\n\n                    \/\/ note: take first regression curve that matches any known\n                    \/\/ type (except mean-value line)\n                    if( aServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(\n                                \"com.sun.star.chart2.LinearRegressionCurve\" )))\n                    {\n                        eResult = REGRESSION_TYPE_LINEAR;\n                        break;\n                    }\n                    else if( aServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(\n                                \"com.sun.star.chart2.LogarithmicRegressionCurve\" )))\n                    {\n                        eResult = REGRESSION_TYPE_LOG;\n                        break;\n                    }\n                    else if( aServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(\n                                \"com.sun.star.chart2.ExponentialRegressionCurve\" )))\n                    {\n                        eResult = REGRESSION_TYPE_EXP;\n                        break;\n                    }\n                    else if( aServiceName.equalsAsciiL( RTL_CONSTASCII_STRINGPARAM(\n                                \"com.sun.star.chart2.PotentialRegressionCurve\" )))\n                    {\n                        eResult = REGRESSION_TYPE_POWER;\n                        break;\n                    }\n                }\n            }\n        }\n        catch( Exception & ex )\n        {\n            ASSERT_EXCEPTION( ex );\n        }\n    }\n\n    return eResult;\n}\n\n\/\/.............................................................................\n} \/\/namespace chart\n\/\/.............................................................................\n<|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/treeplayer:$Id$\n\/\/ Author: Axel Naumann, 2011-09-21\n\n\/*************************************************************************\n * Copyright (C) 1995-2013, Rene Brun and Fons Rademakers and al.        *\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 \"TTreeReader.h\"\n\n#include \"TChain.h\"\n#include \"TDirectory.h\"\n#include \"TTreeReaderValue.h\"\n\n\/** \\class TTreeReader\n TTreeReader is a simple, robust and fast interface to read values from a TTree,\n TChain or TNtuple.\n\n It uses TTreeReaderValue<T> and TTreeReaderArray<T> to access the data.\n\n Example code can be found in\n tutorials\/tree\/hsimpleReader.C and tutorials\/trees\/h1analysisTreeReader.h and\n tutorials\/trees\/h1analysisTreeReader.C for a TSelector.\n\n Roottest contains an\n <a href=\"http:\/\/root.cern.ch\/gitweb?p=roottest.git;a=tree;f=root\/tree\/reader;hb=HEAD\">example<\/a>\n showing the full power.\n\nA simpler analysis example - the one from the tutorials - can be found below:\nit histograms a function of the px and py branches.\n\n~~~{.cpp}\n\/\/ A simple TTreeReader use: read data from hsimple.root (written by hsimple.C)\n\n#include \"TFile.h\n#include \"TH1F.h\n#include \"TTreeReader.h\n#include \"TTreeReaderValue.h\n\nvoid hsimpleReader() {\n   \/\/ Create a histogram for the values we read.\n   TH1F(\"h1\", \"ntuple\", 100, -4, 4);\n\n   \/\/ Open the file containing the tree.\n   TFile *myFile = TFile::Open(\"$ROOTSYS\/tutorials\/hsimple.root\");\n\n   \/\/ Create a TTreeReader for the tree, for instance by passing the\n   \/\/ TTree's name and the TDirectory \/ TFile it is in.\n   TTreeReader myReader(\"ntuple\", myFile);\n\n   \/\/ The branch \"px\" contains floats; access them as myPx.\n   TTreeReaderValue<Float_t> myPx(myReader, \"px\");\n   \/\/ The branch \"py\" contains floats, too; access those as myPy.\n   TTreeReaderValue<Float_t> myPy(myReader, \"py\");\n\n   \/\/ Loop over all entries of the TTree or TChain.\n   while (myReader.Next()) {\n      \/\/ Just access the data as if myPx and myPy were iterators (note the '*'\n      \/\/ in front of them):\n      myHist->Fill(*myPx + *myPy);\n   }\n\n   myHist->Draw();\n}\n~~~\n\nA more complete example including error handling and a few combinations of\nTTreeReaderValue and TTreeReaderArray would look like this:\n\n~~~{.cpp}\n#include <TFile.h>\n#include <TH1.h>\n#include <TTreeReader.h>\n#include <TTreeReaderValue.h>\n#include <TTreeReaderArray.h>\n\n#include \"TriggerInfo.h\"\n#include \"Muon.h\"\n#include \"Tau.h\"\n\n#include <vector>\n#include <iostream>\n\nbool CheckValue(ROOT::TTreeReaderValueBase* value) {\n   if (value->GetSetupStatus() < 0) {\n      std::cerr << \"Error \" << value->GetSetupStatus()\n                << \"setting up reader for \" << value->GetBranchName() << '\\n';\n      return false;\n   }\n   return true;\n}\n\n\n\/\/ Analyze the tree \"MyTree\" in the file passed into the function.\n\/\/ Returns false in case of errors.\nbool analyze(TFile* file) {\n   \/\/ Create a TTreeReader named \"MyTree\" from the given TDirectory.\n   \/\/ The TTreeReader gives access to the TTree to the TTreeReaderValue and\n   \/\/ TTreeReaderArray objects. It knows the current entry number and knows\n   \/\/ how to iterate through the TTree.\n   TTreeReader reader(\"MyTree\", file);\n\n   \/\/ Read a single float value in each tree entries:\n   TTreeReaderValue<float> weight(reader, \"event.weight\");\n   if (!CheckValue(weight)) return false;\n\n   \/\/ Read a TriggerInfo object from the tree entries:\n   TTreeReaderValue<TriggerInfo> triggerInfo(reader, \"triggerInfo\");\n   if (!CheckValue(triggerInfo)) return false;\n\n   \/\/Read a vector of Muon objects from the tree entries:\n   TTreeReaderValue<std::vector<Muon>> muons(reader, \"muons\");\n   if (!CheckValue(muons)) return false;\n\n   \/\/Read the pT for all jets in the tree entry:\n   TTreeReaderArray<double> jetPt(reader, \"jets.pT\");\n   if (!CheckValue(jetPt)) return false;\n\n   \/\/ Read the taus in the tree entry:\n   TTreeReaderArray<Tau> taus(reader, \"taus\");\n   if (!CheckValue(taus)) return false;\n\n\n   \/\/ Now iterate through the TTree entries and fill a histogram.\n\n   TH1F(\"hist\", \"TTreeReader example histogram\", 10, 0., 100.);\n\n   while (reader.Next()) {\n\n      if (reader.GetEntryStatus() == kEntryValid) {\n         std::cout << \"Loaded entry \" << reader.GetCurrentEntry() << '\\n';\n      } else {\n         switch (reader.GetEntryStatus()) {\n         kEntryValid:\n            \/\/ Handled above.\n            break;\n         kEntryNotLoaded:\n            std::cerr << \"Error: TTreeReader has not loaded any data yet!\\n\";\n            break;\n         kEntryNoTree:\n            std::cerr << \"Error: TTreeReader cannot find a tree names \\\"MyTree\\\"!\\n\";\n            break;\n         kEntryNotFound:\n            \/\/ Can't really happen as TTreeReader::Next() knows when to stop.\n            std::cerr << \"Error: The entry number doe not exist\\n\";\n            break;\n         kEntryChainSetupError:\n            std::cerr << \"Error: TTreeReader cannot access a chain element, e.g. file without the tree\\n\";\n            break;\n         kEntryChainFileError:\n            std::cerr << \"Error: TTreeReader cannot open a chain element, e.g. missing file\\n\";\n            break;\n         kEntryDictionaryError:\n            std::cerr << \"Error: TTreeReader cannot find the dictionary for some data\\n\";\n            break;\n         }\n         return false;\n      }\n\n      \/\/ Access the TriggerInfo object as if it's a pointer.\n      if (!triggerInfo->hasMuonL1())\n         continue;\n\n      \/\/ Ditto for the vector<Muon>.\n      if (!muons->size())\n         continue;\n\n      \/\/ Access the jetPt as an array, whether the TTree stores this as\n      \/\/ a std::vector, std::list, TClonesArray or Jet* C-style array, with\n      \/\/ fixed or variable array size.\n      if (jetPt.GetSize() < 2 || jetPt[0] < 100)\n         continue;\n\n      \/\/ Access the array of taus.\n      if (!taus.IsEmpty()) {\n         float currentWeight = *weight;\n         for (int iTau = 0, nTau = taus.GetSize(); iTau < nTau; ++iTau) {\n            \/\/ Access a float value - need to dereference as TTreeReaderValue\n            \/\/ behaves like an iterator\n            hist->Fill(taus[iTau].eta(), currentWeight);\n         }\n      }\n   } \/\/ TTree entry \/ event loop\n}\n~~~\n*\/\n\nClassImp(TTreeReader)\n\nusing namespace ROOT::Internal;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Access data from tree.\n\nTTreeReader::TTreeReader(TTree* tree):\n   fTree(tree),\n   fDirectory(0),\n   fEntryStatus(kEntryNotLoaded),\n   fMostRecentTreeNumber(-1),\n   fDirector(0),\n   fLastEntry(-1),\n   fProxiesSet(kFALSE)\n{\n   if (!fTree) {\n      Error(\"TTreeReader\", \"TTree is NULL!\");\n   } else {\n      Initialize();\n   }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Access data from the tree called keyname in the directory (e.g. TFile)\n\/\/\/ dir, or the current directory if dir is NULL. If keyname cannot be\n\/\/\/ found, or if it is not a TTree, IsZombie() will return true.\n\nTTreeReader::TTreeReader(const char* keyname, TDirectory* dir \/*= NULL*\/):\n   fTree(0),\n   fDirectory(dir),\n   fEntryStatus(kEntryNotLoaded),\n   fMostRecentTreeNumber(-1),\n   fDirector(0),\n   fLastEntry(-1),\n   fProxiesSet(kFALSE)\n{\n   if (!fDirectory) fDirectory = gDirectory;\n   fDirectory->GetObject(keyname, fTree);\n   Initialize();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Tell all value readers that the tree reader does not exist anymore.\n\nTTreeReader::~TTreeReader()\n{\n   for (std::deque<ROOT::Internal::TTreeReaderValueBase*>::const_iterator\n           i = fValues.begin(), e = fValues.end(); i != e; ++i) {\n      (*i)->MarkTreeReaderUnavailable();\n   }\n   delete fDirector;\n   fProxies.SetOwner();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Initialization of the director.\n\nvoid TTreeReader::Initialize()\n{\n   if (!fTree) {\n      MakeZombie();\n      fEntryStatus = kEntryNoTree;\n      fMostRecentTreeNumber = -1;\n   } else {\n      ResetBit(kZombie);\n      if (fTree->InheritsFrom(TChain::Class())) {\n         SetBit(kBitIsChain);\n      }\n      fDirector = new ROOT::Internal::TBranchProxyDirector(fTree, -1);\n   }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Set the range of entries to be processed. This call is usually followed by\n\/\/\/ an iteration of the range using TTreeReader::Next(), which will visit the\n\/\/\/ the entries from `first` to `last - 1`.\n\/\/\/ If last > first, this call is equivalent to\n\/\/\/ `SetEntry(first - 1); SetLastEntry(last);`. Otherwise `last` is ignored and\n\/\/\/ only `first` is set.\n\/\/\/ \\return the EEntryStatus that would be returned by SetEntry(first - 1)\n\nTTreeReader::EEntryStatus TTreeReader::SetEntriesRange(Long64_t first, Long64_t last)\n{\n   if(last > first)\n      fLastEntry = last;\n   else\n      fLastEntry = -1;\n   return SetEntry(first - 1);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Restart a Next() loop from the first entry.\n\nvoid TTreeReader::Restart() {\n   fDirector->SetTree(nullptr);\n   fDirector->SetReadEntry(-1);\n   fProxiesSet = false; \/\/ we might get more value readers, meaning new proxies.\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Returns the index of the current entry being read\n\nLong64_t TTreeReader::GetCurrentEntry() const {\n   if (!fDirector) return -1;\n   Long64_t currentTreeEntry = fDirector->GetReadEntry();\n   if (TestBit(kBitIsChain) && currentTreeEntry >= 0) {\n      return ((TChain*)fTree)->GetChainEntryNumber(currentTreeEntry);\n   }\n   return currentTreeEntry;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Load an entry into the tree, return the status of the read.\n\/\/\/ For chains, entry is the global (i.e. not tree-local) entry number, unless\n\/\/\/ `local` is `true`, in which case `entry` specifies the entry number within\n\/\/\/ the current tree. This is needed for instance for TSelector::Process().\n\nTTreeReader::EEntryStatus TTreeReader::SetEntryBase(Long64_t entry, Bool_t local)\n{\n   if (!fTree) {\n      fEntryStatus = kEntryNoTree;\n      return fEntryStatus;\n   }\n\n   Int_t treeNumberBeforeLoadTree = fTree->GetTreeNumber();\n\n   TTree* prevTree = fDirector->GetTree();\n\n   TTree* treeToCallLoadOn = local ? fTree->GetTree() : fTree;\n   Long64_t loadResult = treeToCallLoadOn->LoadTree(entry);\n\n   if (loadResult == -2) {\n      fDirector->SetTree(nullptr);\n      fEntryStatus = kEntryNotFound;\n      return fEntryStatus;\n   }\n\n   if (fMostRecentTreeNumber != treeNumberBeforeLoadTree) {\n      \/\/ This can happen if someone switched trees behind us.\n      \/\/ Likely cause: a TChain::LoadTree() e.g. from TTree::Process().\n      \/\/ This means that \"local\" should be set!\n\n      if (fTree->GetTreeNumber() != treeNumberBeforeLoadTree) {\n         \/\/ we have switched trees again, which means that \"local\" was not set!\n         \/\/ There are two entities switching trees which is bad.\n         R__ASSERT(!local && \"Logic error - !local but tree number changed?\");\n         Warning(\"SetEntryBase()\",\n                 \"The current tree in the TChain %s has changed (e.g. by TTree::Process) \"\n                 \"even though TTreeReader::SetEntry() was called, which switched the tree \"\n                 \"again. Did you mean to call TTreeReader::SetLocalEntry()?\",\n                 fTree->GetName());\n      }\n   }\n\n   if (fMostRecentTreeNumber != fTree->GetTreeNumber()) {\n      fDirector->SetTree(fTree->GetTree());\n      fMostRecentTreeNumber = fTree->GetTreeNumber();\n   }\n\n   if (!prevTree || fDirector->GetReadEntry() == -1 || !fProxiesSet) {\n      \/\/ Tell readers we now have a tree\n      for (std::deque<ROOT::Internal::TTreeReaderValueBase*>::const_iterator\n              i = fValues.begin(); i != fValues.end(); ++i) { \/\/ Iterator end changes when parameterized arrays are read\n         (*i)->CreateProxy();\n\n         if (!(*i)->GetProxy()){\n            fEntryStatus = kEntryDictionaryError;\n            return fEntryStatus;\n         }\n      }\n      \/\/ If at least one proxy was there and no error occurred, we assume the proxies to be set.\n      fProxiesSet = !fValues.empty();\n   }\n\n   if (fLastEntry >= 0 && entry >= fLastEntry) {\n      fEntryStatus = kEntryLast;\n      return fEntryStatus;\n   }\n   fDirector->SetReadEntry(loadResult);\n   fEntryStatus = kEntryValid;\n   return fEntryStatus;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Set (or update) the which tree to reader from. tree can be\n\/\/\/ a TTree or a TChain.\n\nvoid TTreeReader::SetTree(TTree* tree)\n{\n   fTree = tree;\n   if (fTree) {\n      ResetBit(kZombie);\n      if (fTree->InheritsFrom(TChain::Class())) {\n         SetBit(kBitIsChain);\n      }\n   }\n\n   if (!fDirector) {\n      Initialize();\n   }\n   else {\n      fDirector->SetTree(fTree);\n      fDirector->SetReadEntry(-1);\n   }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Add a value reader for this tree.\n\nBool_t TTreeReader::RegisterValueReader(ROOT::Internal::TTreeReaderValueBase* reader)\n{\n   if (fProxiesSet) {\n      Error(\"RegisterValueReader\",\n            \"TTreeReaders must be created before the call to Next() \/ SetEntry() \/ SetLocalEntry()!\");\n      return false;\n   }\n   fValues.push_back(reader);\n   return true;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Remove a value reader for this tree.\n\nvoid TTreeReader::DeregisterValueReader(ROOT::Internal::TTreeReaderValueBase* reader)\n{\n   std::deque<ROOT::Internal::TTreeReaderValueBase*>::iterator iReader\n      = std::find(fValues.begin(), fValues.end(), reader);\n   if (iReader == fValues.end()) {\n      Error(\"DeregisterValueReader\", \"Cannot find reader of type %s for branch %s\", reader->GetDerivedTypeName(), reader->fBranchName.Data());\n      return;\n   }\n   fValues.erase(iReader);\n}\n<commit_msg>Use the tree number, not the pointer; return early if end-of-chain; simplify condition for setting proxies.<commit_after>\/\/ @(#)root\/treeplayer:$Id$\n\/\/ Author: Axel Naumann, 2011-09-21\n\n\/*************************************************************************\n * Copyright (C) 1995-2013, Rene Brun and Fons Rademakers and al.        *\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 \"TTreeReader.h\"\n\n#include \"TChain.h\"\n#include \"TDirectory.h\"\n#include \"TTreeReaderValue.h\"\n\n\/** \\class TTreeReader\n TTreeReader is a simple, robust and fast interface to read values from a TTree,\n TChain or TNtuple.\n\n It uses TTreeReaderValue<T> and TTreeReaderArray<T> to access the data.\n\n Example code can be found in\n tutorials\/tree\/hsimpleReader.C and tutorials\/trees\/h1analysisTreeReader.h and\n tutorials\/trees\/h1analysisTreeReader.C for a TSelector.\n\n Roottest contains an\n <a href=\"http:\/\/root.cern.ch\/gitweb?p=roottest.git;a=tree;f=root\/tree\/reader;hb=HEAD\">example<\/a>\n showing the full power.\n\nA simpler analysis example - the one from the tutorials - can be found below:\nit histograms a function of the px and py branches.\n\n~~~{.cpp}\n\/\/ A simple TTreeReader use: read data from hsimple.root (written by hsimple.C)\n\n#include \"TFile.h\n#include \"TH1F.h\n#include \"TTreeReader.h\n#include \"TTreeReaderValue.h\n\nvoid hsimpleReader() {\n   \/\/ Create a histogram for the values we read.\n   TH1F(\"h1\", \"ntuple\", 100, -4, 4);\n\n   \/\/ Open the file containing the tree.\n   TFile *myFile = TFile::Open(\"$ROOTSYS\/tutorials\/hsimple.root\");\n\n   \/\/ Create a TTreeReader for the tree, for instance by passing the\n   \/\/ TTree's name and the TDirectory \/ TFile it is in.\n   TTreeReader myReader(\"ntuple\", myFile);\n\n   \/\/ The branch \"px\" contains floats; access them as myPx.\n   TTreeReaderValue<Float_t> myPx(myReader, \"px\");\n   \/\/ The branch \"py\" contains floats, too; access those as myPy.\n   TTreeReaderValue<Float_t> myPy(myReader, \"py\");\n\n   \/\/ Loop over all entries of the TTree or TChain.\n   while (myReader.Next()) {\n      \/\/ Just access the data as if myPx and myPy were iterators (note the '*'\n      \/\/ in front of them):\n      myHist->Fill(*myPx + *myPy);\n   }\n\n   myHist->Draw();\n}\n~~~\n\nA more complete example including error handling and a few combinations of\nTTreeReaderValue and TTreeReaderArray would look like this:\n\n~~~{.cpp}\n#include <TFile.h>\n#include <TH1.h>\n#include <TTreeReader.h>\n#include <TTreeReaderValue.h>\n#include <TTreeReaderArray.h>\n\n#include \"TriggerInfo.h\"\n#include \"Muon.h\"\n#include \"Tau.h\"\n\n#include <vector>\n#include <iostream>\n\nbool CheckValue(ROOT::TTreeReaderValueBase* value) {\n   if (value->GetSetupStatus() < 0) {\n      std::cerr << \"Error \" << value->GetSetupStatus()\n                << \"setting up reader for \" << value->GetBranchName() << '\\n';\n      return false;\n   }\n   return true;\n}\n\n\n\/\/ Analyze the tree \"MyTree\" in the file passed into the function.\n\/\/ Returns false in case of errors.\nbool analyze(TFile* file) {\n   \/\/ Create a TTreeReader named \"MyTree\" from the given TDirectory.\n   \/\/ The TTreeReader gives access to the TTree to the TTreeReaderValue and\n   \/\/ TTreeReaderArray objects. It knows the current entry number and knows\n   \/\/ how to iterate through the TTree.\n   TTreeReader reader(\"MyTree\", file);\n\n   \/\/ Read a single float value in each tree entries:\n   TTreeReaderValue<float> weight(reader, \"event.weight\");\n   if (!CheckValue(weight)) return false;\n\n   \/\/ Read a TriggerInfo object from the tree entries:\n   TTreeReaderValue<TriggerInfo> triggerInfo(reader, \"triggerInfo\");\n   if (!CheckValue(triggerInfo)) return false;\n\n   \/\/Read a vector of Muon objects from the tree entries:\n   TTreeReaderValue<std::vector<Muon>> muons(reader, \"muons\");\n   if (!CheckValue(muons)) return false;\n\n   \/\/Read the pT for all jets in the tree entry:\n   TTreeReaderArray<double> jetPt(reader, \"jets.pT\");\n   if (!CheckValue(jetPt)) return false;\n\n   \/\/ Read the taus in the tree entry:\n   TTreeReaderArray<Tau> taus(reader, \"taus\");\n   if (!CheckValue(taus)) return false;\n\n\n   \/\/ Now iterate through the TTree entries and fill a histogram.\n\n   TH1F(\"hist\", \"TTreeReader example histogram\", 10, 0., 100.);\n\n   while (reader.Next()) {\n\n      if (reader.GetEntryStatus() == kEntryValid) {\n         std::cout << \"Loaded entry \" << reader.GetCurrentEntry() << '\\n';\n      } else {\n         switch (reader.GetEntryStatus()) {\n         kEntryValid:\n            \/\/ Handled above.\n            break;\n         kEntryNotLoaded:\n            std::cerr << \"Error: TTreeReader has not loaded any data yet!\\n\";\n            break;\n         kEntryNoTree:\n            std::cerr << \"Error: TTreeReader cannot find a tree names \\\"MyTree\\\"!\\n\";\n            break;\n         kEntryNotFound:\n            \/\/ Can't really happen as TTreeReader::Next() knows when to stop.\n            std::cerr << \"Error: The entry number doe not exist\\n\";\n            break;\n         kEntryChainSetupError:\n            std::cerr << \"Error: TTreeReader cannot access a chain element, e.g. file without the tree\\n\";\n            break;\n         kEntryChainFileError:\n            std::cerr << \"Error: TTreeReader cannot open a chain element, e.g. missing file\\n\";\n            break;\n         kEntryDictionaryError:\n            std::cerr << \"Error: TTreeReader cannot find the dictionary for some data\\n\";\n            break;\n         }\n         return false;\n      }\n\n      \/\/ Access the TriggerInfo object as if it's a pointer.\n      if (!triggerInfo->hasMuonL1())\n         continue;\n\n      \/\/ Ditto for the vector<Muon>.\n      if (!muons->size())\n         continue;\n\n      \/\/ Access the jetPt as an array, whether the TTree stores this as\n      \/\/ a std::vector, std::list, TClonesArray or Jet* C-style array, with\n      \/\/ fixed or variable array size.\n      if (jetPt.GetSize() < 2 || jetPt[0] < 100)\n         continue;\n\n      \/\/ Access the array of taus.\n      if (!taus.IsEmpty()) {\n         float currentWeight = *weight;\n         for (int iTau = 0, nTau = taus.GetSize(); iTau < nTau; ++iTau) {\n            \/\/ Access a float value - need to dereference as TTreeReaderValue\n            \/\/ behaves like an iterator\n            hist->Fill(taus[iTau].eta(), currentWeight);\n         }\n      }\n   } \/\/ TTree entry \/ event loop\n}\n~~~\n*\/\n\nClassImp(TTreeReader)\n\nusing namespace ROOT::Internal;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Access data from tree.\n\nTTreeReader::TTreeReader(TTree* tree):\n   fTree(tree),\n   fDirectory(0),\n   fEntryStatus(kEntryNotLoaded),\n   fMostRecentTreeNumber(-1),\n   fDirector(0),\n   fLastEntry(-1),\n   fProxiesSet(kFALSE)\n{\n   if (!fTree) {\n      Error(\"TTreeReader\", \"TTree is NULL!\");\n   } else {\n      Initialize();\n   }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Access data from the tree called keyname in the directory (e.g. TFile)\n\/\/\/ dir, or the current directory if dir is NULL. If keyname cannot be\n\/\/\/ found, or if it is not a TTree, IsZombie() will return true.\n\nTTreeReader::TTreeReader(const char* keyname, TDirectory* dir \/*= NULL*\/):\n   fTree(0),\n   fDirectory(dir),\n   fEntryStatus(kEntryNotLoaded),\n   fMostRecentTreeNumber(-1),\n   fDirector(0),\n   fLastEntry(-1),\n   fProxiesSet(kFALSE)\n{\n   if (!fDirectory) fDirectory = gDirectory;\n   fDirectory->GetObject(keyname, fTree);\n   Initialize();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Tell all value readers that the tree reader does not exist anymore.\n\nTTreeReader::~TTreeReader()\n{\n   for (std::deque<ROOT::Internal::TTreeReaderValueBase*>::const_iterator\n           i = fValues.begin(), e = fValues.end(); i != e; ++i) {\n      (*i)->MarkTreeReaderUnavailable();\n   }\n   delete fDirector;\n   fProxies.SetOwner();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Initialization of the director.\n\nvoid TTreeReader::Initialize()\n{\n   if (!fTree) {\n      MakeZombie();\n      fEntryStatus = kEntryNoTree;\n      fMostRecentTreeNumber = -1;\n   } else {\n      ResetBit(kZombie);\n      if (fTree->InheritsFrom(TChain::Class())) {\n         SetBit(kBitIsChain);\n      }\n      fDirector = new ROOT::Internal::TBranchProxyDirector(fTree, -1);\n   }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Set the range of entries to be processed. This call is usually followed by\n\/\/\/ an iteration of the range using TTreeReader::Next(), which will visit the\n\/\/\/ the entries from `first` to `last - 1`.\n\/\/\/ If last > first, this call is equivalent to\n\/\/\/ `SetEntry(first - 1); SetLastEntry(last);`. Otherwise `last` is ignored and\n\/\/\/ only `first` is set.\n\/\/\/ \\return the EEntryStatus that would be returned by SetEntry(first - 1)\n\nTTreeReader::EEntryStatus TTreeReader::SetEntriesRange(Long64_t first, Long64_t last)\n{\n   if(last > first)\n      fLastEntry = last;\n   else\n      fLastEntry = -1;\n   return SetEntry(first - 1);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Restart a Next() loop from the first entry.\n\nvoid TTreeReader::Restart() {\n   fDirector->SetTree(nullptr);\n   fDirector->SetReadEntry(-1);\n   fProxiesSet = false; \/\/ we might get more value readers, meaning new proxies.\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Returns the index of the current entry being read\n\nLong64_t TTreeReader::GetCurrentEntry() const {\n   if (!fDirector) return -1;\n   Long64_t currentTreeEntry = fDirector->GetReadEntry();\n   if (TestBit(kBitIsChain) && currentTreeEntry >= 0) {\n      return ((TChain*)fTree)->GetChainEntryNumber(currentTreeEntry);\n   }\n   return currentTreeEntry;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Load an entry into the tree, return the status of the read.\n\/\/\/ For chains, entry is the global (i.e. not tree-local) entry number, unless\n\/\/\/ `local` is `true`, in which case `entry` specifies the entry number within\n\/\/\/ the current tree. This is needed for instance for TSelector::Process().\n\nTTreeReader::EEntryStatus TTreeReader::SetEntryBase(Long64_t entry, Bool_t local)\n{\n   if (!fTree) {\n      fEntryStatus = kEntryNoTree;\n      return fEntryStatus;\n   }\n\n   if (fProxiesSet && fDirector && fDirector->GetReadEntry() == -1) {\n      \/\/ Passed the end of the chain, Restart() was not called:\n      \/\/ don't try to load entries anymore. Can happen in these cases:\n      \/\/ while (tr.Next()) {something()};\n      \/\/ while (tr.Next()) {somethingelse()}; \/\/ should not be calling somethingelse().\n      fEntryStatus = kEntryNotFound;\n      return fEntryStatus;\n   }\n\n   Int_t treeNumberBeforeLoadTree = fTree->GetTreeNumber();\n\n   TTree* treeToCallLoadOn = local ? fTree->GetTree() : fTree;\n   Long64_t loadResult = treeToCallLoadOn->LoadTree(entry);\n\n   if (loadResult == -2) {\n      fDirector->SetTree(nullptr);\n      fEntryStatus = kEntryNotFound;\n      return fEntryStatus;\n   }\n\n   if (fMostRecentTreeNumber != treeNumberBeforeLoadTree) {\n      \/\/ This can happen if someone switched trees behind us.\n      \/\/ Likely cause: a TChain::LoadTree() e.g. from TTree::Process().\n      \/\/ This means that \"local\" should be set!\n\n      if (fTree->GetTreeNumber() != treeNumberBeforeLoadTree) {\n         \/\/ we have switched trees again, which means that \"local\" was not set!\n         \/\/ There are two entities switching trees which is bad.\n         R__ASSERT(!local && \"Logic error - !local but tree number changed?\");\n         Warning(\"SetEntryBase()\",\n                 \"The current tree in the TChain %s has changed (e.g. by TTree::Process) \"\n                 \"even though TTreeReader::SetEntry() was called, which switched the tree \"\n                 \"again. Did you mean to call TTreeReader::SetLocalEntry()?\",\n                 fTree->GetName());\n      }\n   }\n\n   if (fDirector->GetTree() != fTree->GetTree())\n      fDirector->SetTree(fTree->GetTree());\n\n   fMostRecentTreeNumber = fTree->GetTreeNumber();\n\n   if (!fProxiesSet) {\n      \/\/ Tell readers we now have a tree\n      for (std::deque<ROOT::Internal::TTreeReaderValueBase*>::const_iterator\n              i = fValues.begin(); i != fValues.end(); ++i) { \/\/ Iterator end changes when parameterized arrays are read\n         (*i)->CreateProxy();\n\n         if (!(*i)->GetProxy()){\n            fEntryStatus = kEntryDictionaryError;\n            return fEntryStatus;\n         }\n      }\n      \/\/ If at least one proxy was there and no error occurred, we assume the proxies to be set.\n      fProxiesSet = !fValues.empty();\n   }\n\n   if (fLastEntry >= 0 && entry >= fLastEntry) {\n      fEntryStatus = kEntryLast;\n      return fEntryStatus;\n   }\n   fDirector->SetReadEntry(loadResult);\n   fEntryStatus = kEntryValid;\n   return fEntryStatus;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Set (or update) the which tree to reader from. tree can be\n\/\/\/ a TTree or a TChain.\n\nvoid TTreeReader::SetTree(TTree* tree)\n{\n   fTree = tree;\n   if (fTree) {\n      ResetBit(kZombie);\n      if (fTree->InheritsFrom(TChain::Class())) {\n         SetBit(kBitIsChain);\n      }\n   }\n\n   if (!fDirector) {\n      Initialize();\n   }\n   else {\n      fDirector->SetTree(fTree);\n      fDirector->SetReadEntry(-1);\n   }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Add a value reader for this tree.\n\nBool_t TTreeReader::RegisterValueReader(ROOT::Internal::TTreeReaderValueBase* reader)\n{\n   if (fProxiesSet) {\n      Error(\"RegisterValueReader\",\n            \"TTreeReaders must be created before the call to Next() \/ SetEntry() \/ SetLocalEntry()!\");\n      return false;\n   }\n   fValues.push_back(reader);\n   return true;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Remove a value reader for this tree.\n\nvoid TTreeReader::DeregisterValueReader(ROOT::Internal::TTreeReaderValueBase* reader)\n{\n   std::deque<ROOT::Internal::TTreeReaderValueBase*>::iterator iReader\n      = std::find(fValues.begin(), fValues.end(), reader);\n   if (iReader == fValues.end()) {\n      Error(\"DeregisterValueReader\", \"Cannot find reader of type %s for branch %s\", reader->GetDerivedTypeName(), reader->fBranchName.Data());\n      return;\n   }\n   fValues.erase(iReader);\n}\n<|endoftext|>"}
{"text":"<commit_before>AliAnalysisTask *AddTaskHFEemcQA(\n     Bool_t UseTender=kTRUE,\n     Bool_t FillElecSparse=kFALSE,\n     Bool_t ispPb=kFALSE,\n     Int_t thEG1ADC=140, Int_t thEG2ADC=89,\n     Bool_t ClsTypeEMC=kTRUE, Bool_t ClsTypeDCAL=kTRUE,\n     Int_t MimCent = -1, Int_t MaxCent = -1)\n     {\n    \/\/get the current analysis manager\n    AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n    if (!mgr) {\n        Error(\"AddTaskHFE\", \"No analysis manager found.\");\n        return NULL;\n    }\n    if (!mgr->GetInputEventHandler()) {\n        ::Error(\"AddTaskHFE\", \"This task requires an input event handler\");\n        return NULL;\n    }\n    TString type = mgr->GetInputEventHandler()->GetDataType(); \/\/ can be \"ESD\" or \"AOD\"\n    \n    Bool_t MCthere=kFALSE;\n    AliMCEventHandler *mcH = dynamic_cast<AliMCEventHandler*>(mgr->GetMCtruthEventHandler());\n    if(!mcH){\n        MCthere=kFALSE;\n    }else{\n        MCthere=kTRUE;\n    }\n    \n    char calib[100];\n    if(UseTender)\n    {\n        sprintf(calib,\"wTender\");\n    }\n    else\n    {\n        sprintf(calib,\"woTender\");\n    }\n    \n    \/\/ +++ EMCal MB\n    \/\/ INT8\n    AliAnalysisTaskHFEemcQA *hfecalqa = new AliAnalysisTaskHFEemcQA(\"emcqa\");\n    mgr->AddTask(hfecalqa);\n    hfecalqa->SelectCollisionCandidates(AliVEvent::kINT8);\n    hfecalqa->SetElecIDsparse(FillElecSparse);\n    hfecalqa->SetTenderSwitch(UseTender);\n    hfecalqa->SetThresholdEG1(thEG1ADC);\n    hfecalqa->SetThresholdEG2(thEG2ADC);\n    hfecalqa->SetClusterTypeEMC(ClsTypeEMC);\n    hfecalqa->SetClusterTypeDCAL(ClsTypeDCAL);\n    hfecalqa->SetCentralityMim(MimCent);\n    hfecalqa->SetCentralityMax(MaxCent);\n    \n\n    TString containerName = mgr->GetCommonFileName();\n    containerName += \":PWGHF_hfeHFEemcQAINT8\";\n    AliAnalysisDataContainer *cinput  = mgr->GetCommonInputContainer();\n    AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(Form(\"HFEemcQAINT8_%s\",calib), TList::Class(),AliAnalysisManager::kOutputContainer, containerName.Data());\n    mgr->ConnectInput(hfecalqa, 0, cinput);\n    mgr->ConnectOutput(hfecalqa, 1, coutput1);\n    \n    \/\/ INT7\n    AliAnalysisTaskHFEemcQA *hfecalqa7 = new AliAnalysisTaskHFEemcQA(\"emcqa\");\n    mgr->AddTask(hfecalqa7);\n    hfecalqa7->SelectCollisionCandidates(AliVEvent::kINT7);\n    hfecalqa7->SetElecIDsparse(FillElecSparse);\n    hfecalqa7->SetTenderSwitch(UseTender);\n    hfecalqa7->SetThresholdEG1(thEG1ADC);\n    hfecalqa7->SetThresholdEG2(thEG2ADC);\n    hfecalqa7->SetClusterTypeEMC(ClsTypeEMC);\n    hfecalqa7->SetClusterTypeDCAL(ClsTypeDCAL);\n    hfecalqa7->SetCentralityMim(MimCent);\n    hfecalqa7->SetCentralityMax(MaxCent);\n    \n    TString containerName7 = mgr->GetCommonFileName();\n    containerName7 += \":PWGHF_hfeHFEemcQAINT7\";\n    AliAnalysisDataContainer *cinput  = mgr->GetCommonInputContainer();\n    AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(Form(\"HFEemcQAINT7_%s\",calib), TList::Class(),AliAnalysisManager::kOutputContainer, containerName7.Data());\n    mgr->ConnectInput(hfecalqa7, 0, cinput);\n    mgr->ConnectOutput(hfecalqa7, 1, coutput1);\n    \n    \/\/ EMCal L0\n    \/\/ + kEMC7\n    AliAnalysisTaskHFEemcQA *hfecalqaL07 = new AliAnalysisTaskHFEemcQA(\"emcqa\");\n    mgr->AddTask(hfecalqaL07);\n    hfecalqaL07->SelectCollisionCandidates(AliVEvent::kEMC7);\n    hfecalqaL07->SetElecIDsparse(FillElecSparse);\n    hfecalqaL07->SetTenderSwitch(UseTender);\n    hfecalqaL07->SetThresholdEG1(thEG1ADC);\n    hfecalqaL07->SetThresholdEG2(thEG2ADC);\n    hfecalqaL07->SetClusterTypeEMC(ClsTypeEMC);\n    hfecalqaL07->SetClusterTypeDCAL(ClsTypeDCAL);\n    hfecalqaL07->SetCentralityMim(MimCent);\n    hfecalqaL07->SetCentralityMax(MaxCent);\n    \n    TString containerNameL07 = mgr->GetCommonFileName();\n    containerNameL07 += \":PWGHF_hfeHFEemcQAEMC7\";\n    AliAnalysisDataContainer *cinput  = mgr->GetCommonInputContainer();\n    AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(Form(\"HFEemcQAEMC7_%s\",calib), TList::Class(),AliAnalysisManager::kOutputContainer, containerNameL07.Data());\n    mgr->ConnectInput(hfecalqaL07, 0, cinput);\n    mgr->ConnectOutput(hfecalqaL07, 1, coutput1);\n    \n    \/\/ + kEMC8\n    AliAnalysisTaskHFEemcQA *hfecalqaL08 = new AliAnalysisTaskHFEemcQA(\"emcqa\");\n    mgr->AddTask(hfecalqaL08);\n    hfecalqaL08->SelectCollisionCandidates(AliVEvent::kEMC8);\n    hfecalqaL08->SetElecIDsparse(FillElecSparse);\n    hfecalqaL08->SetTenderSwitch(UseTender);\n    hfecalqaL08->SetThresholdEG1(thEG1ADC);\n    hfecalqaL08->SetThresholdEG2(thEG2ADC);\n    hfecalqaL08->SetClusterTypeEMC(ClsTypeEMC);\n    hfecalqaL08->SetClusterTypeDCAL(ClsTypeDCAL);\n    hfecalqaL08->SetCentralityMim(MimCent);\n    hfecalqaL08->SetCentralityMax(MaxCent);\n    \n    TString containerNameL08 = mgr->GetCommonFileName();\n    containerNameL08 += \":PWGHF_hfeHFEemcQAEMC8\";\n    AliAnalysisDataContainer *cinput  = mgr->GetCommonInputContainer();\n    AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(Form(\"HFEemcQAEMC8_%s\",calib), TList::Class(),AliAnalysisManager::kOutputContainer, containerNameL08.Data());\n    mgr->ConnectInput(hfecalqaL08, 0, cinput);\n    mgr->ConnectOutput(hfecalqaL08, 1, coutput1);\n    \n    \n    \/\/ EMCal EGA\n    if(ispPb)\n    {\n        \/\/ EMCal EGA EG1\n        AliAnalysisTaskHFEemcQA *hfecalqaTrig01 = new AliAnalysisTaskHFEemcQA(\"emcqa\");\n        mgr->AddTask(hfecalqaTrig01);\n        hfecalqaTrig01->SelectCollisionCandidates(AliVEvent::kEMCEGA);\n        hfecalqaTrig01->SetEMCalTriggerEG1(kTRUE);\n        hfecalqaTrig01->SetElecIDsparse(FillElecSparse);\n        hfecalqaTrig01->SetTenderSwitch(UseTender);\n        hfecalqaTrig01->SetThresholdEG1(thEG1ADC);\n        hfecalqaTrig01->SetThresholdEG2(thEG2ADC);\n        hfecalqaTrig01->SetClusterTypeEMC(ClsTypeEMC);\n        hfecalqaTrig01->SetClusterTypeDCAL(ClsTypeDCAL);\n        hfecalqaTrig01->SetCentralityMim(MimCent);\n        hfecalqaTrig01->SetCentralityMax(MaxCent);\n        \n        TString containerName01 = mgr->GetCommonFileName();\n        containerName01 += \":PWGHF_hfeHFEemcQATrigGAEG1\";\n        AliAnalysisDataContainer *cinput  = mgr->GetCommonInputContainer();\n        AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(Form(\"HFEemcQATrigGAEG1_%s\",calib), TList::Class(),AliAnalysisManager::kOutputContainer, containerName01.Data());\n        mgr->ConnectInput(hfecalqaTrig01, 0, cinput);\n        mgr->ConnectOutput(hfecalqaTrig01, 1, coutput1);\n        \n        \/\/ EMCal EGA EG2\n        AliAnalysisTaskHFEemcQA *hfecalqaTrig02 = new AliAnalysisTaskHFEemcQA(\"emcqa\");\n        mgr->AddTask(hfecalqaTrig02);\n        hfecalqaTrig02->SelectCollisionCandidates(AliVEvent::kEMCEGA);\n        hfecalqaTrig02->SetEMCalTriggerEG2(kTRUE);\n        hfecalqaTrig02->SetElecIDsparse(FillElecSparse);\n        hfecalqaTrig02->SetTenderSwitch(UseTender);\n        hfecalqaTrig02->SetThresholdEG1(thEG1ADC);\n        hfecalqaTrig02->SetThresholdEG2(thEG2ADC);\n        hfecalqaTrig02->SetClusterTypeEMC(ClsTypeEMC);\n        hfecalqaTrig02->SetClusterTypeDCAL(ClsTypeDCAL);\n        hfecalqaTrig02->SetCentralityMim(MimCent);\n        hfecalqaTrig02->SetCentralityMax(MaxCent);\n        \n        TString containerName02 = mgr->GetCommonFileName();\n        containerName02 += \":PWGHF_hfeHFEemcQATrigGAEG2\";\n        AliAnalysisDataContainer *cinput  = mgr->GetCommonInputContainer();\n        AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(Form(\"HFEemcQATrigGAEG2_%s\",calib), TList::Class(),AliAnalysisManager::kOutputContainer, containerName02.Data());\n        mgr->ConnectInput(hfecalqaTrig02, 0, cinput);\n        mgr->ConnectOutput(hfecalqaTrig02, 1, coutput1);\n    }\n    if(!ispPb)\n    {\n        \/\/ EMCal EGA\n        AliAnalysisTaskHFEemcQA *hfecalqaTrig0 = new AliAnalysisTaskHFEemcQA(\"emcqa\");\n        mgr->AddTask(hfecalqaTrig0);\n        hfecalqaTrig0->SelectCollisionCandidates(AliVEvent::kEMCEGA);\n        hfecalqaTrig0->SetElecIDsparse(FillElecSparse);\n        hfecalqaTrig0->SetTenderSwitch(UseTender);\n        hfecalqaTrig0->SetThresholdEG1(thEG1ADC);\n        hfecalqaTrig0->SetThresholdEG2(thEG2ADC);\n        hfecalqaTrig0->SetClusterTypeEMC(ClsTypeEMC);\n        hfecalqaTrig0->SetClusterTypeDCAL(ClsTypeDCAL);\n        hfecalqaTrig0->SetCentralityMim(MimCent);\n        hfecalqaTrig0->SetCentralityMax(MaxCent);\n        \n        TString containerName1 = mgr->GetCommonFileName();\n        containerName1 += \":PWGHF_hfeHFEemcQATrigGA\";\n        AliAnalysisDataContainer *cinput  = mgr->GetCommonInputContainer();\n        AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(Form(\"HFEemcQATrigGA_%s\",calib), TList::Class(),AliAnalysisManager::kOutputContainer, containerName1.Data());\n        mgr->ConnectInput(hfecalqaTrig0, 0, cinput);\n        mgr->ConnectOutput(hfecalqaTrig0, 1, coutput1);\n    }\n    \n    \/\/ EMCal EJE\n    AliAnalysisTaskHFEemcQA *hfecalqaTrig1 = new AliAnalysisTaskHFEemcQA(\"emcqa\");\n    mgr->AddTask(hfecalqaTrig1);\n    hfecalqaTrig1->SelectCollisionCandidates(AliVEvent::kEMCEJE);\n    hfecalqaTrig1->SetElecIDsparse(FillElecSparse);\n    hfecalqaTrig1->SetTenderSwitch(UseTender);\n    hfecalqaTrig1->SetThresholdEG1(thEG1ADC);\n    hfecalqaTrig1->SetThresholdEG2(thEG2ADC);\n    hfecalqaTrig1->SetClusterTypeEMC(ClsTypeEMC);\n    hfecalqaTrig1->SetClusterTypeDCAL(ClsTypeDCAL);\n    hfecalqaTrig1->SetCentralityMim(MimCent);\n    hfecalqaTrig1->SetCentralityMax(MaxCent);\n    \n    TString containerName2 = mgr->GetCommonFileName();\n    containerName2 += \":PWGHF_hfeHFEemcQATrigJE\";\n    AliAnalysisDataContainer *cinput  = mgr->GetCommonInputContainer();\n    AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(Form(\"HFEemcQATrigJE_%s\",calib), TList::Class(),AliAnalysisManager::kOutputContainer, containerName2.Data());\n    mgr->ConnectInput(hfecalqaTrig1, 0, cinput);\n    mgr->ConnectOutput(hfecalqaTrig1, 1, coutput1); \n    \n    \/\/return hfecalqa;\n    return NULL;\n}\n<commit_msg>update to QA for separate centralities<commit_after>AliAnalysisTask *AddTaskHFEemcQA(\n     Bool_t UseTender=kTRUE,\n     Bool_t FillElecSparse=kFALSE,\n     Bool_t ispPb=kFALSE,\n     Int_t thEG1ADC=140, Int_t thEG2ADC=89,\n     Bool_t ClsTypeEMC=kTRUE, Bool_t ClsTypeDCAL=kTRUE,\n     Int_t MimCent = -1, Int_t MaxCent = -1)\n     {\n    \/\/get the current analysis manager\n    AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n    if (!mgr) {\n        Error(\"AddTaskHFE\", \"No analysis manager found.\");\n        return NULL;\n    }\n    if (!mgr->GetInputEventHandler()) {\n        ::Error(\"AddTaskHFE\", \"This task requires an input event handler\");\n        return NULL;\n    }\n    TString type = mgr->GetInputEventHandler()->GetDataType(); \/\/ can be \"ESD\" or \"AOD\"\n    \n    Bool_t MCthere=kFALSE;\n    AliMCEventHandler *mcH = dynamic_cast<AliMCEventHandler*>(mgr->GetMCtruthEventHandler());\n    if(!mcH){\n        MCthere=kFALSE;\n    }else{\n        MCthere=kTRUE;\n    }\n    \n    char calib[100];\n    if(UseTender)\n    {\n     if(MimCent==-1 && MaxCent==-1)\n       {  \n        sprintf(calib,\"wTender\");\n       }\n     else\n       {  \n        sprintf(calib,\"wTender_%d_%d\",MimCent,MaxCent);\n       }\n    }\n    else\n    {\n     if(MimCent==-1 && MaxCent==-1)\n       {  \n        sprintf(calib,\"woTender\");\n      }\n     else\n       {  \n        sprintf(calib,\"woTender_%d_%d\",MimCent,MaxCent);\n       }\n    }\n    \n    \/\/ +++ EMCal MB\n    \/\/ INT8\n    AliAnalysisTaskHFEemcQA *hfecalqa = new AliAnalysisTaskHFEemcQA(\"emcqa\");\n    mgr->AddTask(hfecalqa);\n    hfecalqa->SelectCollisionCandidates(AliVEvent::kINT8);\n    hfecalqa->SetElecIDsparse(FillElecSparse);\n    hfecalqa->SetTenderSwitch(UseTender);\n    hfecalqa->SetThresholdEG1(thEG1ADC);\n    hfecalqa->SetThresholdEG2(thEG2ADC);\n    hfecalqa->SetClusterTypeEMC(ClsTypeEMC);\n    hfecalqa->SetClusterTypeDCAL(ClsTypeDCAL);\n    hfecalqa->SetCentralityMim(MimCent);\n    hfecalqa->SetCentralityMax(MaxCent);\n    \n\n    TString containerName = mgr->GetCommonFileName();\n    containerName += \":PWGHF_hfeHFEemcQAINT8\";\n    AliAnalysisDataContainer *cinput  = mgr->GetCommonInputContainer();\n    AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(Form(\"HFEemcQAINT8_%s\",calib), TList::Class(),AliAnalysisManager::kOutputContainer, containerName.Data());\n    mgr->ConnectInput(hfecalqa, 0, cinput);\n    mgr->ConnectOutput(hfecalqa, 1, coutput1);\n    \n    \/\/ INT7\n    AliAnalysisTaskHFEemcQA *hfecalqa7 = new AliAnalysisTaskHFEemcQA(\"emcqa\");\n    mgr->AddTask(hfecalqa7);\n    hfecalqa7->SelectCollisionCandidates(AliVEvent::kINT7);\n    hfecalqa7->SetElecIDsparse(FillElecSparse);\n    hfecalqa7->SetTenderSwitch(UseTender);\n    hfecalqa7->SetThresholdEG1(thEG1ADC);\n    hfecalqa7->SetThresholdEG2(thEG2ADC);\n    hfecalqa7->SetClusterTypeEMC(ClsTypeEMC);\n    hfecalqa7->SetClusterTypeDCAL(ClsTypeDCAL);\n    hfecalqa7->SetCentralityMim(MimCent);\n    hfecalqa7->SetCentralityMax(MaxCent);\n    \n    TString containerName7 = mgr->GetCommonFileName();\n    containerName7 += \":PWGHF_hfeHFEemcQAINT7\";\n    AliAnalysisDataContainer *cinput  = mgr->GetCommonInputContainer();\n    AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(Form(\"HFEemcQAINT7_%s\",calib), TList::Class(),AliAnalysisManager::kOutputContainer, containerName7.Data());\n    mgr->ConnectInput(hfecalqa7, 0, cinput);\n    mgr->ConnectOutput(hfecalqa7, 1, coutput1);\n    \n    \/\/ EMCal L0\n    \/\/ + kEMC7\n    AliAnalysisTaskHFEemcQA *hfecalqaL07 = new AliAnalysisTaskHFEemcQA(\"emcqa\");\n    mgr->AddTask(hfecalqaL07);\n    hfecalqaL07->SelectCollisionCandidates(AliVEvent::kEMC7);\n    hfecalqaL07->SetElecIDsparse(FillElecSparse);\n    hfecalqaL07->SetTenderSwitch(UseTender);\n    hfecalqaL07->SetThresholdEG1(thEG1ADC);\n    hfecalqaL07->SetThresholdEG2(thEG2ADC);\n    hfecalqaL07->SetClusterTypeEMC(ClsTypeEMC);\n    hfecalqaL07->SetClusterTypeDCAL(ClsTypeDCAL);\n    hfecalqaL07->SetCentralityMim(MimCent);\n    hfecalqaL07->SetCentralityMax(MaxCent);\n    \n    TString containerNameL07 = mgr->GetCommonFileName();\n    containerNameL07 += \":PWGHF_hfeHFEemcQAEMC7\";\n    AliAnalysisDataContainer *cinput  = mgr->GetCommonInputContainer();\n    AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(Form(\"HFEemcQAEMC7_%s\",calib), TList::Class(),AliAnalysisManager::kOutputContainer, containerNameL07.Data());\n    mgr->ConnectInput(hfecalqaL07, 0, cinput);\n    mgr->ConnectOutput(hfecalqaL07, 1, coutput1);\n    \n    \/\/ + kEMC8\n    AliAnalysisTaskHFEemcQA *hfecalqaL08 = new AliAnalysisTaskHFEemcQA(\"emcqa\");\n    mgr->AddTask(hfecalqaL08);\n    hfecalqaL08->SelectCollisionCandidates(AliVEvent::kEMC8);\n    hfecalqaL08->SetElecIDsparse(FillElecSparse);\n    hfecalqaL08->SetTenderSwitch(UseTender);\n    hfecalqaL08->SetThresholdEG1(thEG1ADC);\n    hfecalqaL08->SetThresholdEG2(thEG2ADC);\n    hfecalqaL08->SetClusterTypeEMC(ClsTypeEMC);\n    hfecalqaL08->SetClusterTypeDCAL(ClsTypeDCAL);\n    hfecalqaL08->SetCentralityMim(MimCent);\n    hfecalqaL08->SetCentralityMax(MaxCent);\n    \n    TString containerNameL08 = mgr->GetCommonFileName();\n    containerNameL08 += \":PWGHF_hfeHFEemcQAEMC8\";\n    AliAnalysisDataContainer *cinput  = mgr->GetCommonInputContainer();\n    AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(Form(\"HFEemcQAEMC8_%s\",calib), TList::Class(),AliAnalysisManager::kOutputContainer, containerNameL08.Data());\n    mgr->ConnectInput(hfecalqaL08, 0, cinput);\n    mgr->ConnectOutput(hfecalqaL08, 1, coutput1);\n    \n    \n    \/\/ EMCal EGA\n    if(ispPb)\n    {\n        \/\/ EMCal EGA EG1\n        AliAnalysisTaskHFEemcQA *hfecalqaTrig01 = new AliAnalysisTaskHFEemcQA(\"emcqa\");\n        mgr->AddTask(hfecalqaTrig01);\n        hfecalqaTrig01->SelectCollisionCandidates(AliVEvent::kEMCEGA);\n        hfecalqaTrig01->SetEMCalTriggerEG1(kTRUE);\n        hfecalqaTrig01->SetElecIDsparse(FillElecSparse);\n        hfecalqaTrig01->SetTenderSwitch(UseTender);\n        hfecalqaTrig01->SetThresholdEG1(thEG1ADC);\n        hfecalqaTrig01->SetThresholdEG2(thEG2ADC);\n        hfecalqaTrig01->SetClusterTypeEMC(ClsTypeEMC);\n        hfecalqaTrig01->SetClusterTypeDCAL(ClsTypeDCAL);\n        hfecalqaTrig01->SetCentralityMim(MimCent);\n        hfecalqaTrig01->SetCentralityMax(MaxCent);\n        \n        TString containerName01 = mgr->GetCommonFileName();\n        containerName01 += \":PWGHF_hfeHFEemcQATrigGAEG1\";\n        AliAnalysisDataContainer *cinput  = mgr->GetCommonInputContainer();\n        AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(Form(\"HFEemcQATrigGAEG1_%s\",calib), TList::Class(),AliAnalysisManager::kOutputContainer, containerName01.Data());\n        mgr->ConnectInput(hfecalqaTrig01, 0, cinput);\n        mgr->ConnectOutput(hfecalqaTrig01, 1, coutput1);\n        \n        \/\/ EMCal EGA EG2\n        AliAnalysisTaskHFEemcQA *hfecalqaTrig02 = new AliAnalysisTaskHFEemcQA(\"emcqa\");\n        mgr->AddTask(hfecalqaTrig02);\n        hfecalqaTrig02->SelectCollisionCandidates(AliVEvent::kEMCEGA);\n        hfecalqaTrig02->SetEMCalTriggerEG2(kTRUE);\n        hfecalqaTrig02->SetElecIDsparse(FillElecSparse);\n        hfecalqaTrig02->SetTenderSwitch(UseTender);\n        hfecalqaTrig02->SetThresholdEG1(thEG1ADC);\n        hfecalqaTrig02->SetThresholdEG2(thEG2ADC);\n        hfecalqaTrig02->SetClusterTypeEMC(ClsTypeEMC);\n        hfecalqaTrig02->SetClusterTypeDCAL(ClsTypeDCAL);\n        hfecalqaTrig02->SetCentralityMim(MimCent);\n        hfecalqaTrig02->SetCentralityMax(MaxCent);\n        \n        TString containerName02 = mgr->GetCommonFileName();\n        containerName02 += \":PWGHF_hfeHFEemcQATrigGAEG2\";\n        AliAnalysisDataContainer *cinput  = mgr->GetCommonInputContainer();\n        AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(Form(\"HFEemcQATrigGAEG2_%s\",calib), TList::Class(),AliAnalysisManager::kOutputContainer, containerName02.Data());\n        mgr->ConnectInput(hfecalqaTrig02, 0, cinput);\n        mgr->ConnectOutput(hfecalqaTrig02, 1, coutput1);\n    }\n    if(!ispPb)\n    {\n        \/\/ EMCal EGA\n        AliAnalysisTaskHFEemcQA *hfecalqaTrig0 = new AliAnalysisTaskHFEemcQA(\"emcqa\");\n        mgr->AddTask(hfecalqaTrig0);\n        hfecalqaTrig0->SelectCollisionCandidates(AliVEvent::kEMCEGA);\n        hfecalqaTrig0->SetElecIDsparse(FillElecSparse);\n        hfecalqaTrig0->SetTenderSwitch(UseTender);\n        hfecalqaTrig0->SetThresholdEG1(thEG1ADC);\n        hfecalqaTrig0->SetThresholdEG2(thEG2ADC);\n        hfecalqaTrig0->SetClusterTypeEMC(ClsTypeEMC);\n        hfecalqaTrig0->SetClusterTypeDCAL(ClsTypeDCAL);\n        hfecalqaTrig0->SetCentralityMim(MimCent);\n        hfecalqaTrig0->SetCentralityMax(MaxCent);\n        \n        TString containerName1 = mgr->GetCommonFileName();\n        containerName1 += \":PWGHF_hfeHFEemcQATrigGA\";\n        AliAnalysisDataContainer *cinput  = mgr->GetCommonInputContainer();\n        AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(Form(\"HFEemcQATrigGA_%s\",calib), TList::Class(),AliAnalysisManager::kOutputContainer, containerName1.Data());\n        mgr->ConnectInput(hfecalqaTrig0, 0, cinput);\n        mgr->ConnectOutput(hfecalqaTrig0, 1, coutput1);\n    }\n    \n    \/\/ EMCal EJE\n    AliAnalysisTaskHFEemcQA *hfecalqaTrig1 = new AliAnalysisTaskHFEemcQA(\"emcqa\");\n    mgr->AddTask(hfecalqaTrig1);\n    hfecalqaTrig1->SelectCollisionCandidates(AliVEvent::kEMCEJE);\n    hfecalqaTrig1->SetElecIDsparse(FillElecSparse);\n    hfecalqaTrig1->SetTenderSwitch(UseTender);\n    hfecalqaTrig1->SetThresholdEG1(thEG1ADC);\n    hfecalqaTrig1->SetThresholdEG2(thEG2ADC);\n    hfecalqaTrig1->SetClusterTypeEMC(ClsTypeEMC);\n    hfecalqaTrig1->SetClusterTypeDCAL(ClsTypeDCAL);\n    hfecalqaTrig1->SetCentralityMim(MimCent);\n    hfecalqaTrig1->SetCentralityMax(MaxCent);\n    \n    TString containerName2 = mgr->GetCommonFileName();\n    containerName2 += \":PWGHF_hfeHFEemcQATrigJE\";\n    AliAnalysisDataContainer *cinput  = mgr->GetCommonInputContainer();\n    AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(Form(\"HFEemcQATrigJE_%s\",calib), TList::Class(),AliAnalysisManager::kOutputContainer, containerName2.Data());\n    mgr->ConnectInput(hfecalqaTrig1, 0, cinput);\n    mgr->ConnectOutput(hfecalqaTrig1, 1, coutput1); \n    \n    \/\/return hfecalqa;\n    return NULL;\n}\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n\nnamespace AD{\n#ifdef CODI_REVERSE_TYPE\n\n  typedef codi::DataStore CheckpointHandler;\n\n  \/*--- Stores the indices of the input variables (they might be overwritten) ---*\/\n\n  extern std::vector<unsigned int> inputValues;\n\n  \/*--- Current position inside the adjoint vector ---*\/\n\n  extern int adjointVectorPosition;\n\n  \/*--- Reference to the tape ---*\/\n\n  extern codi::ChunkTape<double, int>& globalTape;\n\n  extern bool Status;\n\n  extern bool PreaccActive;\n\n  extern codi::ChunkTape<double, int>::Position StartPosition, EndPosition;\n\n  extern std::vector<unsigned int> localInputValues;\n\n  extern std::vector<su2double*> localOutputValues;\n\n  inline void RegisterInput(su2double &data){AD::globalTape.registerInput(data);\n                                             inputValues.push_back(data.getGradientData());}\n\n  inline void RegisterOutput(su2double& data){AD::globalTape.registerOutput(data);}\n\n  inline void ResetInput(su2double &data){data.getGradientData() = 0;}\n\n  inline void StartRecording(){AD::globalTape.setActive();}\n\n  inline void StopRecording(){AD::globalTape.setPassive();}\n\n  inline void ClearAdjoints(){AD::globalTape.clearAdjoints(); }\n\n  inline void ComputeAdjoint(){AD::globalTape.evaluate();\n                               adjointVectorPosition = 0;}\n\n  inline void Reset(){\n    if (inputValues.size() != 0){\n      globalTape.reset();\n      adjointVectorPosition = 0;\n      inputValues.clear();\n    }\n  }\n\n  inline void SetPreaccIn(const su2double &data){\n    if (data.getGradientData() != 0){\n      localInputValues.push_back(data.getGradientData());\n    }\n  }\n\n  inline void SetPreaccIn(su2double* data, const int size){\n    for (unsigned short i = 0; i < size; i++){\n      if (data[i].getGradientData() != 0){\n        localInputValues.push_back(data[i].getGradientData());\n      }\n    }\n  }\n\n  inline void SetPreaccIn(su2double** data, const int size_x, const int size_y){\n    for (unsigned short i = 0; i < size_x; i++){\n      for (unsigned short j = 0; j < size_y; j++){\n        if (data[i][j].getGradientData() != 0){\n          localInputValues.push_back(data[i][j].getGradientData());\n        }\n      }\n    }\n  }\n\n  inline void StartPreacc(){\n    if (globalTape.isActive()){\n      StartPosition = globalTape.getPosition();\n      PreaccActive = true;\n    }\n  }\n\n  inline void SetPreaccOut(su2double& data){\n    if (data.getGradientData() != 0){\n      localOutputValues.push_back(&data);\n    }\n  }\n\n  inline void SetPreaccOut(su2double* data, const int size){\n    for (unsigned short i = 0; i < size; i++){\n      if (data[i].getGradientData() != 0){\n        localOutputValues.push_back(&data[i]);\n      }\n    }\n  }\n\n  inline void SetPreaccOut(su2double** data, const int size_x, const int size_y){\n    for (unsigned short i = 0; i < size_x; i++){\n      for (unsigned short j = 0; j < size_y; j++){\n        if (data[i][j].getGradientData() != 0){\n          localOutputValues.push_back(&data[i][j]);\n        }\n      }\n    }\n  }\n\n\n  inline void delete_handler(void *handler){\n    CheckpointHandler *checkpoint = static_cast<CheckpointHandler*>(handler);\n    checkpoint->clear();\n  }\n#else\n\n  \/*--- Default implementation if reverse mode is disabled ---*\/\n\n  inline void RegisterInput(su2double &data){}\n\n  inline void RegisterOutput(su2double& data){}\n\n  inline void StartRecording(){}\n\n  inline void StopRecording(){}\n\n  inline void ClearAdjoints(){}\n\n  inline void ComputeAdjoint(){}\n\n  inline void Reset(){}\n\n  inline void ResetInput(su2double &data){}\n\n  inline void SetPreaccIn(const su2double &data){}\n\n  inline void SetPreaccIn(su2double* data, const int size){}\n\n  inline void SetPreaccIn(su2double** data, const int size_x, const int size_y){}\n\n  inline void SetPreaccOut(su2double &data){}\n\n  inline void SetPreaccOut(su2double* data, const int size){}\n\n  inline void SetPreaccOut(su2double** data, const int size_x, const int size_y){}\n\n  inline void EndPreacc(){}\n#endif\n}\n<commit_msg>Fixed missing function implementation.<commit_after>#pragma once\n\n\nnamespace AD{\n#ifdef CODI_REVERSE_TYPE\n\n  typedef codi::DataStore CheckpointHandler;\n\n  \/*--- Stores the indices of the input variables (they might be overwritten) ---*\/\n\n  extern std::vector<unsigned int> inputValues;\n\n  \/*--- Current position inside the adjoint vector ---*\/\n\n  extern int adjointVectorPosition;\n\n  \/*--- Reference to the tape ---*\/\n\n  extern codi::ChunkTape<double, int>& globalTape;\n\n  extern bool Status;\n\n  extern bool PreaccActive;\n\n  extern codi::ChunkTape<double, int>::Position StartPosition, EndPosition;\n\n  extern std::vector<unsigned int> localInputValues;\n\n  extern std::vector<su2double*> localOutputValues;\n\n  inline void RegisterInput(su2double &data){AD::globalTape.registerInput(data);\n                                             inputValues.push_back(data.getGradientData());}\n\n  inline void RegisterOutput(su2double& data){AD::globalTape.registerOutput(data);}\n\n  inline void ResetInput(su2double &data){data.getGradientData() = 0;}\n\n  inline void StartRecording(){AD::globalTape.setActive();}\n\n  inline void StopRecording(){AD::globalTape.setPassive();}\n\n  inline void ClearAdjoints(){AD::globalTape.clearAdjoints(); }\n\n  inline void ComputeAdjoint(){AD::globalTape.evaluate();\n                               adjointVectorPosition = 0;}\n\n  inline void Reset(){\n    if (inputValues.size() != 0){\n      globalTape.reset();\n      adjointVectorPosition = 0;\n      inputValues.clear();\n    }\n  }\n\n  inline void SetPreaccIn(const su2double &data){\n    if (data.getGradientData() != 0){\n      localInputValues.push_back(data.getGradientData());\n    }\n  }\n\n  inline void SetPreaccIn(su2double* data, const int size){\n    for (unsigned short i = 0; i < size; i++){\n      if (data[i].getGradientData() != 0){\n        localInputValues.push_back(data[i].getGradientData());\n      }\n    }\n  }\n\n  inline void SetPreaccIn(su2double** data, const int size_x, const int size_y){\n    for (unsigned short i = 0; i < size_x; i++){\n      for (unsigned short j = 0; j < size_y; j++){\n        if (data[i][j].getGradientData() != 0){\n          localInputValues.push_back(data[i][j].getGradientData());\n        }\n      }\n    }\n  }\n\n  inline void StartPreacc(){\n    if (globalTape.isActive()){\n      StartPosition = globalTape.getPosition();\n      PreaccActive = true;\n    }\n  }\n\n  inline void SetPreaccOut(su2double& data){\n    if (data.getGradientData() != 0){\n      localOutputValues.push_back(&data);\n    }\n  }\n\n  inline void SetPreaccOut(su2double* data, const int size){\n    for (unsigned short i = 0; i < size; i++){\n      if (data[i].getGradientData() != 0){\n        localOutputValues.push_back(&data[i]);\n      }\n    }\n  }\n\n  inline void SetPreaccOut(su2double** data, const int size_x, const int size_y){\n    for (unsigned short i = 0; i < size_x; i++){\n      for (unsigned short j = 0; j < size_y; j++){\n        if (data[i][j].getGradientData() != 0){\n          localOutputValues.push_back(&data[i][j]);\n        }\n      }\n    }\n  }\n\n\n  inline void delete_handler(void *handler){\n    CheckpointHandler *checkpoint = static_cast<CheckpointHandler*>(handler);\n    checkpoint->clear();\n  }\n#else\n\n  \/*--- Default implementation if reverse mode is disabled ---*\/\n\n  inline void RegisterInput(su2double &data){}\n\n  inline void RegisterOutput(su2double& data){}\n\n  inline void StartRecording(){}\n\n  inline void StopRecording(){}\n\n  inline void ClearAdjoints(){}\n\n  inline void ComputeAdjoint(){}\n\n  inline void Reset(){}\n\n  inline void ResetInput(su2double &data){}\n\n  inline void SetPreaccIn(const su2double &data){}\n\n  inline void SetPreaccIn(su2double* data, const int size){}\n\n  inline void SetPreaccIn(su2double** data, const int size_x, const int size_y){}\n\n  inline void SetPreaccOut(su2double &data){}\n\n  inline void SetPreaccOut(su2double* data, const int size){}\n\n  inline void SetPreaccOut(su2double** data, const int size_x, const int size_y){}\n\n  inline void StartPreacc(){}\n\n  inline void EndPreacc(){}\n#endif\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2014 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"media\/cast\/transport\/transport\/udp_transport.h\"\n\n#include <algorithm>\n#include <string>\n\n#include \"base\/bind.h\"\n#include \"base\/logging.h\"\n#include \"base\/memory\/ref_counted.h\"\n#include \"base\/memory\/scoped_ptr.h\"\n#include \"base\/message_loop\/message_loop.h\"\n#include \"base\/rand_util.h\"\n#include \"net\/base\/io_buffer.h\"\n#include \"net\/base\/net_errors.h\"\n#include \"net\/base\/rand_callback.h\"\n\nnamespace media {\nnamespace cast {\nnamespace transport {\n\nnamespace {\nconst int kMaxPacketSize = 1500;\n\nbool IsEmpty(const net::IPEndPoint& addr) {\n  net::IPAddressNumber empty_addr(addr.address().size());\n  return std::equal(\n             empty_addr.begin(), empty_addr.end(), addr.address().begin()) &&\n         !addr.port();\n}\n\nbool IsEqual(const net::IPEndPoint& addr1, const net::IPEndPoint& addr2) {\n  return addr1.port() == addr2.port() && std::equal(addr1.address().begin(),\n                                                    addr1.address().end(),\n                                                    addr2.address().begin());\n}\n}  \/\/ namespace\n\nUdpTransport::UdpTransport(\n    const scoped_refptr<base::SingleThreadTaskRunner>& io_thread_proxy,\n    const net::IPEndPoint& local_end_point,\n    const net::IPEndPoint& remote_end_point,\n    const CastTransportStatusCallback& status_callback)\n    : io_thread_proxy_(io_thread_proxy),\n      local_addr_(local_end_point),\n      remote_addr_(remote_end_point),\n      udp_socket_(new net::UDPSocket(net::DatagramSocket::DEFAULT_BIND,\n                                     net::RandIntCallback(),\n                                     NULL,\n                                     net::NetLog::Source())),\n      send_pending_(false),\n      recv_buf_(new net::IOBuffer(kMaxPacketSize)),\n      status_callback_(status_callback),\n      weak_factory_(this) {\n  DCHECK(!IsEmpty(local_end_point) || !IsEmpty(remote_end_point));\n}\n\nUdpTransport::~UdpTransport() {}\n\nvoid UdpTransport::StartReceiving(\n    const PacketReceiverCallback& packet_receiver) {\n  DCHECK(io_thread_proxy_->RunsTasksOnCurrentThread());\n\n  packet_receiver_ = packet_receiver;\n  udp_socket_->AllowAddressReuse();\n  udp_socket_->SetMulticastLoopbackMode(true);\n  if (!IsEmpty(local_addr_)) {\n    if (udp_socket_->Bind(local_addr_) < 0) {\n      status_callback_.Run(TRANSPORT_SOCKET_ERROR);\n      LOG(ERROR) << \"Failed to bind local address.\";\n      return;\n    }\n  } else if (!IsEmpty(remote_addr_)) {\n    if (udp_socket_->Connect(remote_addr_) < 0) {\n      status_callback_.Run(TRANSPORT_SOCKET_ERROR);\n      LOG(ERROR) << \"Failed to connect to remote address.\";\n      return;\n    }\n  } else {\n    NOTREACHED() << \"Either local or remote address has to be defined.\";\n  }\n  ReceiveOnePacket();\n}\n\nvoid UdpTransport::ReceiveOnePacket() {\n  DCHECK(io_thread_proxy_->RunsTasksOnCurrentThread());\n\n  int result = udp_socket_->RecvFrom(\n      recv_buf_,\n      kMaxPacketSize,\n      &recv_addr_,\n      base::Bind(&UdpTransport::OnReceived, weak_factory_.GetWeakPtr()));\n  if (result > 0) {\n    OnReceived(result);\n  } else if (result != net::ERR_IO_PENDING) {\n    LOG(ERROR) << \"Failed to receive packet: \" << result << \".\"\n               << \" Stop receiving packets.\";\n    status_callback_.Run(TRANSPORT_SOCKET_ERROR);\n  }\n}\n\nvoid UdpTransport::OnReceived(int result) {\n  DCHECK(io_thread_proxy_->RunsTasksOnCurrentThread());\n  if (result < 0) {\n    LOG(ERROR) << \"Failed to receive packet: \" << result << \".\"\n               << \" Stop receiving packets.\";\n    status_callback_.Run(TRANSPORT_SOCKET_ERROR);\n    return;\n  }\n\n  if (IsEmpty(remote_addr_)) {\n    remote_addr_ = recv_addr_;\n    VLOG(1) << \"First packet received from: \" << remote_addr_.ToString() << \".\";\n  } else if (!IsEqual(remote_addr_, recv_addr_)) {\n    LOG(ERROR) << \"Received from an unrecognized address: \"\n               << recv_addr_.ToString() << \".\";\n    return;\n  }\n  \/\/ TODO(hclam): The interfaces should use net::IOBuffer to eliminate memcpy.\n  scoped_ptr<Packet> packet(\n      new Packet(recv_buf_->data(), recv_buf_->data() + result));\n  packet_receiver_.Run(packet.Pass());\n  ReceiveOnePacket();\n}\n\nbool UdpTransport::SendPacket(const Packet& packet) {\n  DCHECK(io_thread_proxy_->RunsTasksOnCurrentThread());\n\n  if (send_pending_) {\n    VLOG(1) << \"Cannot send because of pending IO.\";\n    return false;\n  }\n\n  \/\/ TODO(hclam): This interface should take a net::IOBuffer to minimize\n  \/\/ memcpy.\n  scoped_refptr<net::IOBuffer> buf =\n      new net::IOBuffer(static_cast<int>(packet.size()));\n  memcpy(buf->data(), &packet[0], packet.size());\n  int ret = udp_socket_->SendTo(\n      buf,\n      static_cast<int>(packet.size()),\n      remote_addr_,\n      base::Bind(&UdpTransport::OnSent, weak_factory_.GetWeakPtr(), buf));\n  if (ret == net::ERR_IO_PENDING)\n    send_pending_ = true;\n  \/\/ When ok, will return a positive value equal the number of bytes sent.\n  return ret >= net::OK;\n}\n\nvoid UdpTransport::OnSent(const scoped_refptr<net::IOBuffer>& buf, int result) {\n  DCHECK(io_thread_proxy_->RunsTasksOnCurrentThread());\n\n  send_pending_ = false;\n  if (result < 0) {\n    LOG(ERROR) << \"Failed to send packet: \" << result << \".\";\n    status_callback_.Run(TRANSPORT_SOCKET_ERROR);\n  }\n}\n\n}  \/\/ namespace transport\n}  \/\/ namespace cast\n}  \/\/ namespace media\n<commit_msg>Remove indirect recursion when receiving packets.<commit_after>\/\/ Copyright 2014 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"media\/cast\/transport\/transport\/udp_transport.h\"\n\n#include <algorithm>\n#include <string>\n\n#include \"base\/bind.h\"\n#include \"base\/logging.h\"\n#include \"base\/memory\/ref_counted.h\"\n#include \"base\/memory\/scoped_ptr.h\"\n#include \"base\/message_loop\/message_loop.h\"\n#include \"base\/rand_util.h\"\n#include \"net\/base\/io_buffer.h\"\n#include \"net\/base\/net_errors.h\"\n#include \"net\/base\/rand_callback.h\"\n\nnamespace media {\nnamespace cast {\nnamespace transport {\n\nnamespace {\nconst int kMaxPacketSize = 1500;\n\nbool IsEmpty(const net::IPEndPoint& addr) {\n  net::IPAddressNumber empty_addr(addr.address().size());\n  return std::equal(\n             empty_addr.begin(), empty_addr.end(), addr.address().begin()) &&\n         !addr.port();\n}\n\nbool IsEqual(const net::IPEndPoint& addr1, const net::IPEndPoint& addr2) {\n  return addr1.port() == addr2.port() && std::equal(addr1.address().begin(),\n                                                    addr1.address().end(),\n                                                    addr2.address().begin());\n}\n}  \/\/ namespace\n\nUdpTransport::UdpTransport(\n    const scoped_refptr<base::SingleThreadTaskRunner>& io_thread_proxy,\n    const net::IPEndPoint& local_end_point,\n    const net::IPEndPoint& remote_end_point,\n    const CastTransportStatusCallback& status_callback)\n    : io_thread_proxy_(io_thread_proxy),\n      local_addr_(local_end_point),\n      remote_addr_(remote_end_point),\n      udp_socket_(new net::UDPSocket(net::DatagramSocket::DEFAULT_BIND,\n                                     net::RandIntCallback(),\n                                     NULL,\n                                     net::NetLog::Source())),\n      send_pending_(false),\n      recv_buf_(new net::IOBuffer(kMaxPacketSize)),\n      status_callback_(status_callback),\n      weak_factory_(this) {\n  DCHECK(!IsEmpty(local_end_point) || !IsEmpty(remote_end_point));\n}\n\nUdpTransport::~UdpTransport() {}\n\nvoid UdpTransport::StartReceiving(\n    const PacketReceiverCallback& packet_receiver) {\n  DCHECK(io_thread_proxy_->RunsTasksOnCurrentThread());\n\n  packet_receiver_ = packet_receiver;\n  udp_socket_->AllowAddressReuse();\n  udp_socket_->SetMulticastLoopbackMode(true);\n  if (!IsEmpty(local_addr_)) {\n    if (udp_socket_->Bind(local_addr_) < 0) {\n      status_callback_.Run(TRANSPORT_SOCKET_ERROR);\n      LOG(ERROR) << \"Failed to bind local address.\";\n      return;\n    }\n  } else if (!IsEmpty(remote_addr_)) {\n    if (udp_socket_->Connect(remote_addr_) < 0) {\n      status_callback_.Run(TRANSPORT_SOCKET_ERROR);\n      LOG(ERROR) << \"Failed to connect to remote address.\";\n      return;\n    }\n  } else {\n    NOTREACHED() << \"Either local or remote address has to be defined.\";\n  }\n  ReceiveOnePacket();\n}\n\nvoid UdpTransport::ReceiveOnePacket() {\n  DCHECK(io_thread_proxy_->RunsTasksOnCurrentThread());\n\n  int result = udp_socket_->RecvFrom(\n      recv_buf_,\n      kMaxPacketSize,\n      &recv_addr_,\n      base::Bind(&UdpTransport::OnReceived, weak_factory_.GetWeakPtr()));\n  if (result > 0) {\n    OnReceived(result);\n  } else if (result != net::ERR_IO_PENDING) {\n    LOG(ERROR) << \"Failed to receive packet: \" << result << \".\"\n               << \" Stop receiving packets.\";\n    status_callback_.Run(TRANSPORT_SOCKET_ERROR);\n  }\n}\n\nvoid UdpTransport::OnReceived(int result) {\n  DCHECK(io_thread_proxy_->RunsTasksOnCurrentThread());\n  if (result < 0) {\n    LOG(ERROR) << \"Failed to receive packet: \" << result << \".\"\n               << \" Stop receiving packets.\";\n    status_callback_.Run(TRANSPORT_SOCKET_ERROR);\n    return;\n  }\n\n  if (IsEmpty(remote_addr_)) {\n    remote_addr_ = recv_addr_;\n    VLOG(1) << \"First packet received from: \" << remote_addr_.ToString() << \".\";\n  } else if (!IsEqual(remote_addr_, recv_addr_)) {\n    LOG(ERROR) << \"Received from an unrecognized address: \"\n               << recv_addr_.ToString() << \".\";\n    return;\n  }\n  \/\/ TODO(hclam): The interfaces should use net::IOBuffer to eliminate memcpy.\n  scoped_ptr<Packet> packet(\n      new Packet(recv_buf_->data(), recv_buf_->data() + result));\n  packet_receiver_.Run(packet.Pass());\n\n  \/\/ TODO(hguihot): Read packet iteratively when crbug.com\/344628 is fixed.\n  io_thread_proxy_->PostTask(\n      FROM_HERE,\n      base::Bind(&UdpTransport::ReceiveOnePacket, weak_factory_.GetWeakPtr()));\n}\n\nbool UdpTransport::SendPacket(const Packet& packet) {\n  DCHECK(io_thread_proxy_->RunsTasksOnCurrentThread());\n\n  if (send_pending_) {\n    VLOG(1) << \"Cannot send because of pending IO.\";\n    return false;\n  }\n\n  \/\/ TODO(hclam): This interface should take a net::IOBuffer to minimize\n  \/\/ memcpy.\n  scoped_refptr<net::IOBuffer> buf =\n      new net::IOBuffer(static_cast<int>(packet.size()));\n  memcpy(buf->data(), &packet[0], packet.size());\n  int ret = udp_socket_->SendTo(\n      buf,\n      static_cast<int>(packet.size()),\n      remote_addr_,\n      base::Bind(&UdpTransport::OnSent, weak_factory_.GetWeakPtr(), buf));\n  if (ret == net::ERR_IO_PENDING)\n    send_pending_ = true;\n  \/\/ When ok, will return a positive value equal the number of bytes sent.\n  return ret >= net::OK;\n}\n\nvoid UdpTransport::OnSent(const scoped_refptr<net::IOBuffer>& buf, int result) {\n  DCHECK(io_thread_proxy_->RunsTasksOnCurrentThread());\n\n  send_pending_ = false;\n  if (result < 0) {\n    LOG(ERROR) << \"Failed to send packet: \" << result << \".\";\n    status_callback_.Run(TRANSPORT_SOCKET_ERROR);\n  }\n}\n\n}  \/\/ namespace transport\n}  \/\/ namespace cast\n}  \/\/ namespace media\n<|endoftext|>"}
{"text":"<commit_before>\/\/ For conditions of distribution and use, see copyright notice in license.txt\n\n#include \"StableHeaders.h\"\n#include \"EC_VolumeTrigger.h\"\n#include \"EC_RigidBody.h\"\n#include \"EC_Placeable.h\"\n#include \"Entity.h\"\n#include \"PhysicsModule.h\"\n#include \"PhysicsWorld.h\"\n#include \"PhysicsUtils.h\"\n#include <OgreAxisAlignedBox.h>\n#include \"btBulletDynamicsCommon.h\"\n\n#include \"LoggingFunctions.h\"\nDEFINE_POCO_LOGGING_FUNCTIONS(\"EC_VolumeTrigger\");\n\n\nEC_VolumeTrigger::EC_VolumeTrigger(IModule* module) :\n    IComponent(module->GetFramework()),\n    byPivot(this, \"By Pivot\", false),\n    entities(this, \"Entities\"),\n    owner_(checked_static_cast<Physics::PhysicsModule*>(module))\n{\n    QObject::connect(this, SIGNAL(OnAttributeChanged(IAttribute*, AttributeChange::Type)),\n            SLOT(AttributeUpdated(IAttribute*)));\n\n    connect(this, SIGNAL(ParentEntitySet()), this, SLOT(UpdateSignals()));\n}\n\nEC_VolumeTrigger::~EC_VolumeTrigger()\n{\n\n}\n\nQList<Scene::EntityWeakPtr> EC_VolumeTrigger::GetEntitiesInside() const\n{\n    return entities_.keys();\n}\n\nint EC_VolumeTrigger::GetNumEntitiesInside() const\n{\n    return entities_.size();\n}\n\nScene::Entity* EC_VolumeTrigger::GetEntityInside(int idx) const\n{\n    QList<Scene::EntityWeakPtr> entities = entities_.keys();\n    if (idx >=0 && idx < entities.size())\n    {\n        Scene::EntityPtr entity = entities.at(idx).lock();\n        if (entity)\n            return entity.get();\n    }\n    return 0;\n}\n\nQStringList EC_VolumeTrigger::GetEntityNamesInside() const\n{\n    QStringList entitynames;\n    QList<Scene::EntityWeakPtr> entities = entities_.keys();\n    foreach (Scene::EntityWeakPtr entityw, entities)\n    {\n        Scene::EntityPtr entity = entityw.lock();\n        if (entity)\n            entitynames.append(entity->GetName());\n    }\n\n    return entitynames;\n}\n\nfloat EC_VolumeTrigger::GetEntityInsidePercent(const Scene::Entity *entity) const\n{\n    if (entity)\n    {\n        boost::shared_ptr<EC_RigidBody> otherRigidbody = entity->GetComponent<EC_RigidBody>();\n\n        boost::shared_ptr<EC_RigidBody> rigidbody = rigidbody_.lock();\n        if (rigidbody && otherRigidbody)\n        {\n            Vector3df thisBoxMin, thisBoxMax;\n            rigidbody->GetAabbox(thisBoxMin, thisBoxMax);\n\n            Vector3df otherBoxMin, otherBoxMax;\n            otherRigidbody->GetAabbox(otherBoxMin, otherBoxMax);\n\n            Ogre::AxisAlignedBox thisBox(thisBoxMin.x, thisBoxMin.y, thisBoxMin.z, thisBoxMax.x, thisBoxMax.y, thisBoxMax.z);\n            Ogre::AxisAlignedBox otherBox(otherBoxMin.x, otherBoxMin.y, otherBoxMin.z, otherBoxMax.x, otherBoxMax.y, otherBoxMax.z);\n\n            return (thisBox.intersection(otherBox).volume() \/ otherBox.volume());\n        } else\n            LogWarning(\"EC_VolumeTrigger: no EC_RigidBody for entity or volume.\");\n    }\n    return 0.0f;\n}\n\n\nfloat EC_VolumeTrigger::GetEntityInsidePercentByName(const QString &name) const\n{\n    QList<Scene::EntityWeakPtr> entities = entities_.keys();\n    foreach(Scene::EntityWeakPtr wentity, entities)\n    {\n        Scene::EntityPtr entity = wentity.lock();\n        if (entity && entity->GetName().compare(name) == 0)\n            return GetEntityInsidePercent(entity.get());\n    }\n    return 0.f;\n}\n\nbool EC_VolumeTrigger::IsInterestingEntity(const QString &name) const\n{\n    QVariantList interestingEntities = entities.Get();\n    if (interestingEntities.isEmpty())\n        return true;\n\n    foreach (QVariant intname, interestingEntities)\n    {\n        if (intname.toString().compare(name) == 0)\n        {\n            return true;\n        }\n    }\n    return false;\n}\n\nbool EC_VolumeTrigger::IsPivotInside(Scene::Entity *entity) const\n{\n    boost::shared_ptr<EC_Placeable> placeable = entity->GetComponent<EC_Placeable>();\n    boost::shared_ptr<EC_RigidBody> rigidbody = rigidbody_.lock();\n    if (placeable && rigidbody)\n    {\n        const Transform& trans = placeable->transform.Get();\n        const Vector3df& pivot = trans.position;\n\n        return ( RayTestSingle(Vector3df(pivot.x, pivot.y, pivot.z - 1e7), pivot, rigidbody->GetRigidBody()) &&\n                 RayTestSingle(Vector3df(pivot.x, pivot.y, pivot.z + 1e7), pivot, rigidbody->GetRigidBody()) );\n    }\n    LogWarning(\"EC_VolumeTrigger::IsPivotInside(): entity has no EC_Placeable or volume has no EC_RigidBody.\");\n    return false;\n}\n\nvoid EC_VolumeTrigger::AttributeUpdated(IAttribute* attribute)\n{\n    \/\/! \\todo Attribute updates not handled yet, there are a bit too many problems of what signals to send after the update -cm\n\n    \/\/if (attribute == &mass)\n    \/\/    ReadBody();\n}\n\nvoid EC_VolumeTrigger::UpdateSignals()\n{\n    Scene::Entity* parent = GetParentEntity();\n    if (!parent)\n        return;\n    \n    connect(parent, SIGNAL(ComponentAdded(IComponent*, AttributeChange::Type)), this, SLOT(CheckForRigidBody()));\n\n    Scene::SceneManager* scene = parent->GetScene();\n    Physics::PhysicsWorld* world = owner_->GetPhysicsWorldForScene(scene);\n    if (world)\n        connect(world, SIGNAL(Updated(float)), this, SLOT(OnPhysicsUpdate()));\n}\n\nvoid EC_VolumeTrigger::CheckForRigidBody()\n{\n    Scene::Entity* parent = GetParentEntity();\n    if (!parent)\n        return;\n    \n    if (!rigidbody_.lock().get())\n    {\n        boost::shared_ptr<EC_RigidBody> rigidbody = parent->GetComponent<EC_RigidBody>();\n        if (rigidbody)\n        {\n            rigidbody_ = rigidbody;\n            connect(rigidbody.get(), SIGNAL(PhysicsCollision(Scene::Entity*, const Vector3df&, const Vector3df&, float, float, bool)),\n                this, SLOT(OnPhysicsCollision(Scene::Entity*, const Vector3df&, const Vector3df&, float, float, bool)));\n        }\n    }\n}\n\nvoid EC_VolumeTrigger::OnPhysicsUpdate()\n{\n    QMap<Scene::EntityWeakPtr, bool>::iterator i = entities_.begin();\n    while (i != entities_.end())\n    {\n        if (!i.value())\n        {\n            bool active = true;\n            Scene::EntityPtr entity = i.key().lock();\n            \/\/ inactive rigid bodies don't generate collisions, so before emitting EntityLeave -event, make sure the body is active.\n            if (entity)\n            {\n                boost::shared_ptr<EC_RigidBody> rigidbody = entity->GetComponent<EC_RigidBody>();\n                if (rigidbody)\n                    active = rigidbody->IsActive();\n            }\n            if (active)\n            {\n                i = entities_.erase(i);\n                \n                if (entity)\n                {\n                    emit EntityLeave(entity.get());\n                    disconnect(entity.get(), SIGNAL(EntityRemoved(Scene::Entity*, AttributeChange::Type)), this, SLOT(OnEntityRemoved(Scene::Entity*)));\n                    LogDebug(\"Entity \" + entity->GetName().toStdString() + \" left volume trigger \" + GetParentEntity()->GetName().toStdString() + \".\");\n                }\n                continue;\n            }\n        } else\n        {\n            entities_.insert(i.key(), false);\n        }\n        i++;\n    }\n}\n\nvoid EC_VolumeTrigger::OnPhysicsCollision(Scene::Entity* otherEntity, const Vector3df& position, const Vector3df& normal, float distance, float impulse, bool newCollision)\n{\n    assert (otherEntity && \"Physics collision with no entity.\");\n\n    if (!entities.Get().isEmpty() && !IsInterestingEntity(otherEntity->GetName()))\n        return;\n\n    Scene::EntityPtr entity = otherEntity->GetSharedPtr();\n\n    if (byPivot.Get())\n    {\n        if (IsPivotInside(entity.get()))\n        {\n            if (entities_.find(entity) == entities_.end())\n            {\n                emit EntityEnter(otherEntity);\n                connect(otherEntity, SIGNAL(EntityRemoved(Scene::Entity*, AttributeChange::Type)), this, SLOT(OnEntityRemoved(Scene::Entity*)));\n                LogDebug(\"Entity \" + entity->GetName().toStdString() + \" entered volume trigger \" + GetParentEntity()->GetName().toStdString() + \".\");\n            }\n\n            entities_.insert(entity, true);\n        }\n    } else\n    {\n        if (newCollision)\n        {\n            \/\/ make sure the entity isn't already inside the volume\n            if (entities_.find(entity) == entities_.end())\n            {\n                emit EntityEnter(otherEntity);\n                connect(otherEntity, SIGNAL(EntityRemoved(Scene::Entity*, AttributeChange::Type)), this, SLOT(OnEntityRemoved(Scene::Entity*)));\n                LogDebug(\"Entity \" + entity->GetName().toStdString() + \" entered volume trigger \" + GetParentEntity()->GetName().toStdString() + \".\");\n            }\n        }\n        entities_.insert(entity, true);\n    }\n}\n\nvoid EC_VolumeTrigger::OnEntityRemoved(Scene::Entity *entity)\n{\n    Scene::EntityWeakPtr ptr = entity->GetSharedPtr();\n    QMap<Scene::EntityWeakPtr, bool>::iterator i = entities_.find(ptr);\n    if (i != entities_.end())\n    {\n        entities_.erase(i);\n\n        emit EntityLeave(entity);\n        LogDebug(\"Entity \" + entity->GetName().toStdString() + \" left volume trigger \" + GetParentEntity()->GetName().toStdString() + \".\");\n    }\n}\n\n<commit_msg>EC_VolumeTrigger: removed debug log messages.<commit_after>\/\/ For conditions of distribution and use, see copyright notice in license.txt\n\n#include \"StableHeaders.h\"\n#include \"EC_VolumeTrigger.h\"\n#include \"EC_RigidBody.h\"\n#include \"EC_Placeable.h\"\n#include \"Entity.h\"\n#include \"PhysicsModule.h\"\n#include \"PhysicsWorld.h\"\n#include \"PhysicsUtils.h\"\n#include <OgreAxisAlignedBox.h>\n#include \"btBulletDynamicsCommon.h\"\n\n#include \"LoggingFunctions.h\"\nDEFINE_POCO_LOGGING_FUNCTIONS(\"EC_VolumeTrigger\");\n\n\nEC_VolumeTrigger::EC_VolumeTrigger(IModule* module) :\n    IComponent(module->GetFramework()),\n    byPivot(this, \"By Pivot\", false),\n    entities(this, \"Entities\"),\n    owner_(checked_static_cast<Physics::PhysicsModule*>(module))\n{\n    QObject::connect(this, SIGNAL(OnAttributeChanged(IAttribute*, AttributeChange::Type)),\n            SLOT(AttributeUpdated(IAttribute*)));\n\n    connect(this, SIGNAL(ParentEntitySet()), this, SLOT(UpdateSignals()));\n}\n\nEC_VolumeTrigger::~EC_VolumeTrigger()\n{\n\n}\n\nQList<Scene::EntityWeakPtr> EC_VolumeTrigger::GetEntitiesInside() const\n{\n    return entities_.keys();\n}\n\nint EC_VolumeTrigger::GetNumEntitiesInside() const\n{\n    return entities_.size();\n}\n\nScene::Entity* EC_VolumeTrigger::GetEntityInside(int idx) const\n{\n    QList<Scene::EntityWeakPtr> entities = entities_.keys();\n    if (idx >=0 && idx < entities.size())\n    {\n        Scene::EntityPtr entity = entities.at(idx).lock();\n        if (entity)\n            return entity.get();\n    }\n    return 0;\n}\n\nQStringList EC_VolumeTrigger::GetEntityNamesInside() const\n{\n    QStringList entitynames;\n    QList<Scene::EntityWeakPtr> entities = entities_.keys();\n    foreach (Scene::EntityWeakPtr entityw, entities)\n    {\n        Scene::EntityPtr entity = entityw.lock();\n        if (entity)\n            entitynames.append(entity->GetName());\n    }\n\n    return entitynames;\n}\n\nfloat EC_VolumeTrigger::GetEntityInsidePercent(const Scene::Entity *entity) const\n{\n    if (entity)\n    {\n        boost::shared_ptr<EC_RigidBody> otherRigidbody = entity->GetComponent<EC_RigidBody>();\n\n        boost::shared_ptr<EC_RigidBody> rigidbody = rigidbody_.lock();\n        if (rigidbody && otherRigidbody)\n        {\n            Vector3df thisBoxMin, thisBoxMax;\n            rigidbody->GetAabbox(thisBoxMin, thisBoxMax);\n\n            Vector3df otherBoxMin, otherBoxMax;\n            otherRigidbody->GetAabbox(otherBoxMin, otherBoxMax);\n\n            Ogre::AxisAlignedBox thisBox(thisBoxMin.x, thisBoxMin.y, thisBoxMin.z, thisBoxMax.x, thisBoxMax.y, thisBoxMax.z);\n            Ogre::AxisAlignedBox otherBox(otherBoxMin.x, otherBoxMin.y, otherBoxMin.z, otherBoxMax.x, otherBoxMax.y, otherBoxMax.z);\n\n            return (thisBox.intersection(otherBox).volume() \/ otherBox.volume());\n        } else\n            LogWarning(\"EC_VolumeTrigger: no EC_RigidBody for entity or volume.\");\n    }\n    return 0.0f;\n}\n\n\nfloat EC_VolumeTrigger::GetEntityInsidePercentByName(const QString &name) const\n{\n    QList<Scene::EntityWeakPtr> entities = entities_.keys();\n    foreach(Scene::EntityWeakPtr wentity, entities)\n    {\n        Scene::EntityPtr entity = wentity.lock();\n        if (entity && entity->GetName().compare(name) == 0)\n            return GetEntityInsidePercent(entity.get());\n    }\n    return 0.f;\n}\n\nbool EC_VolumeTrigger::IsInterestingEntity(const QString &name) const\n{\n    QVariantList interestingEntities = entities.Get();\n    if (interestingEntities.isEmpty())\n        return true;\n\n    foreach (QVariant intname, interestingEntities)\n    {\n        if (intname.toString().compare(name) == 0)\n        {\n            return true;\n        }\n    }\n    return false;\n}\n\nbool EC_VolumeTrigger::IsPivotInside(Scene::Entity *entity) const\n{\n    boost::shared_ptr<EC_Placeable> placeable = entity->GetComponent<EC_Placeable>();\n    boost::shared_ptr<EC_RigidBody> rigidbody = rigidbody_.lock();\n    if (placeable && rigidbody)\n    {\n        const Transform& trans = placeable->transform.Get();\n        const Vector3df& pivot = trans.position;\n\n        return ( RayTestSingle(Vector3df(pivot.x, pivot.y, pivot.z - 1e7), pivot, rigidbody->GetRigidBody()) &&\n                 RayTestSingle(Vector3df(pivot.x, pivot.y, pivot.z + 1e7), pivot, rigidbody->GetRigidBody()) );\n    }\n    LogWarning(\"EC_VolumeTrigger::IsPivotInside(): entity has no EC_Placeable or volume has no EC_RigidBody.\");\n    return false;\n}\n\nvoid EC_VolumeTrigger::AttributeUpdated(IAttribute* attribute)\n{\n    \/\/! \\todo Attribute updates not handled yet, there are a bit too many problems of what signals to send after the update -cm\n\n    \/\/if (attribute == &mass)\n    \/\/    ReadBody();\n}\n\nvoid EC_VolumeTrigger::UpdateSignals()\n{\n    Scene::Entity* parent = GetParentEntity();\n    if (!parent)\n        return;\n    \n    connect(parent, SIGNAL(ComponentAdded(IComponent*, AttributeChange::Type)), this, SLOT(CheckForRigidBody()));\n\n    Scene::SceneManager* scene = parent->GetScene();\n    Physics::PhysicsWorld* world = owner_->GetPhysicsWorldForScene(scene);\n    if (world)\n        connect(world, SIGNAL(Updated(float)), this, SLOT(OnPhysicsUpdate()));\n}\n\nvoid EC_VolumeTrigger::CheckForRigidBody()\n{\n    Scene::Entity* parent = GetParentEntity();\n    if (!parent)\n        return;\n    \n    if (!rigidbody_.lock().get())\n    {\n        boost::shared_ptr<EC_RigidBody> rigidbody = parent->GetComponent<EC_RigidBody>();\n        if (rigidbody)\n        {\n            rigidbody_ = rigidbody;\n            connect(rigidbody.get(), SIGNAL(PhysicsCollision(Scene::Entity*, const Vector3df&, const Vector3df&, float, float, bool)),\n                this, SLOT(OnPhysicsCollision(Scene::Entity*, const Vector3df&, const Vector3df&, float, float, bool)));\n        }\n    }\n}\n\nvoid EC_VolumeTrigger::OnPhysicsUpdate()\n{\n    QMap<Scene::EntityWeakPtr, bool>::iterator i = entities_.begin();\n    while (i != entities_.end())\n    {\n        if (!i.value())\n        {\n            bool active = true;\n            Scene::EntityPtr entity = i.key().lock();\n            \/\/ inactive rigid bodies don't generate collisions, so before emitting EntityLeave -event, make sure the body is active.\n            if (entity)\n            {\n                boost::shared_ptr<EC_RigidBody> rigidbody = entity->GetComponent<EC_RigidBody>();\n                if (rigidbody)\n                    active = rigidbody->IsActive();\n            }\n            if (active)\n            {\n                i = entities_.erase(i);\n                \n                if (entity)\n                {\n                    emit EntityLeave(entity.get());\n                    disconnect(entity.get(), SIGNAL(EntityRemoved(Scene::Entity*, AttributeChange::Type)), this, SLOT(OnEntityRemoved(Scene::Entity*)));\n                }\n                continue;\n            }\n        } else\n        {\n            entities_.insert(i.key(), false);\n        }\n        i++;\n    }\n}\n\nvoid EC_VolumeTrigger::OnPhysicsCollision(Scene::Entity* otherEntity, const Vector3df& position, const Vector3df& normal, float distance, float impulse, bool newCollision)\n{\n    assert (otherEntity && \"Physics collision with no entity.\");\n\n    if (!entities.Get().isEmpty() && !IsInterestingEntity(otherEntity->GetName()))\n        return;\n\n    Scene::EntityPtr entity = otherEntity->GetSharedPtr();\n\n    if (byPivot.Get())\n    {\n        if (IsPivotInside(entity.get()))\n        {\n            if (entities_.find(entity) == entities_.end())\n            {\n                emit EntityEnter(otherEntity);\n                connect(otherEntity, SIGNAL(EntityRemoved(Scene::Entity*, AttributeChange::Type)), this, SLOT(OnEntityRemoved(Scene::Entity*)));\n            }\n\n            entities_.insert(entity, true);\n        }\n    } else\n    {\n        if (newCollision)\n        {\n            \/\/ make sure the entity isn't already inside the volume\n            if (entities_.find(entity) == entities_.end())\n            {\n                emit EntityEnter(otherEntity);\n                connect(otherEntity, SIGNAL(EntityRemoved(Scene::Entity*, AttributeChange::Type)), this, SLOT(OnEntityRemoved(Scene::Entity*)));\n            }\n        }\n        entities_.insert(entity, true);\n    }\n}\n\nvoid EC_VolumeTrigger::OnEntityRemoved(Scene::Entity *entity)\n{\n    Scene::EntityWeakPtr ptr = entity->GetSharedPtr();\n    QMap<Scene::EntityWeakPtr, bool>::iterator i = entities_.find(ptr);\n    if (i != entities_.end())\n    {\n        entities_.erase(i);\n\n        emit EntityLeave(entity);\n    }\n}\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Updated WaterMaterial::isReadyForSubMesh function to pass material context<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\/prerender\/prerender_manager.h\"\n\n#include \"base\/logging.h\"\n#include \"base\/metrics\/histogram.h\"\n#include \"base\/time.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/fav_icon_helper.h\"\n#include \"chrome\/browser\/prerender\/prerender_contents.h\"\n#include \"chrome\/browser\/prerender\/prerender_final_status.h\"\n#include \"chrome\/common\/render_messages.h\"\n#include \"content\/browser\/browser_thread.h\"\n#include \"content\/browser\/renderer_host\/render_view_host.h\"\n#include \"content\/browser\/renderer_host\/render_process_host.h\"\n#include \"content\/browser\/tab_contents\/tab_contents.h\"\n#include \"content\/browser\/tab_contents\/render_view_host_manager.h\"\n\nnamespace prerender {\n\n\/\/ static\nbase::TimeTicks PrerenderManager::last_prefetch_seen_time_;\n\n\/\/ static\nPrerenderManager::PrerenderManagerMode PrerenderManager::mode_ =\n    PRERENDER_MODE_ENABLED;\n\n\/\/ static\nPrerenderManager::PrerenderManagerMode PrerenderManager::GetMode() {\n  return mode_;\n}\n\n\/\/ static\nvoid PrerenderManager::SetMode(PrerenderManagerMode mode) {\n  mode_ = mode;\n}\n\n\/\/ static\nbool PrerenderManager::IsPrerenderingEnabled() {\n  return\n      GetMode() == PRERENDER_MODE_ENABLED ||\n      GetMode() == PRERENDER_MODE_EXPERIMENT_PRERENDER_GROUP;\n}\n\nstruct PrerenderManager::PrerenderContentsData {\n  PrerenderContents* contents_;\n  base::Time start_time_;\n  PrerenderContentsData(PrerenderContents* contents, base::Time start_time)\n      : contents_(contents),\n        start_time_(start_time) {\n  }\n};\n\nPrerenderManager::PrerenderManager(Profile* profile)\n    : profile_(profile),\n      max_prerender_age_(base::TimeDelta::FromSeconds(\n          kDefaultMaxPrerenderAgeSeconds)),\n      max_elements_(kDefaultMaxPrerenderElements),\n      prerender_contents_factory_(PrerenderContents::CreateFactory()) {\n}\n\nPrerenderManager::~PrerenderManager() {\n  while (prerender_list_.size() > 0) {\n    PrerenderContentsData data = prerender_list_.front();\n    prerender_list_.pop_front();\n    data.contents_->set_final_status(FINAL_STATUS_MANAGER_SHUTDOWN);\n    delete data.contents_;\n  }\n}\n\nvoid PrerenderManager::SetPrerenderContentsFactory(\n    PrerenderContents::Factory* prerender_contents_factory) {\n  prerender_contents_factory_.reset(prerender_contents_factory);\n}\n\nbool PrerenderManager::AddPreload(const GURL& url,\n                                  const std::vector<GURL>& alias_urls,\n                                  const GURL& referrer) {\n  DCHECK(BrowserThread::CurrentlyOn(BrowserThread::UI));\n  DeleteOldEntries();\n  if (FindEntry(url))\n    return false;\n  \/\/ Do not prerender if there are too many render processes, and we would\n  \/\/ have to use an existing one.  We do not want prerendering to happen in\n  \/\/ a shared process, so that we can always reliably lower the CPU\n  \/\/ priority for prerendering.\n  \/\/ TODO(tburkard): Figure out how to cancel prerendering in the opposite\n  \/\/ case, when a new tab is added to a process used for prerendering.\n  if (RenderProcessHost::ShouldTryToUseExistingProcessHost()) {\n    RecordFinalStatus(FINAL_STATUS_TOO_MANY_PROCESSES);\n    return false;\n  }\n  \/\/ TODO(cbentzel): Move invalid checks here instead of PrerenderContents?\n  PrerenderContentsData data(CreatePrerenderContents(url, alias_urls, referrer),\n                             GetCurrentTime());\n  prerender_list_.push_back(data);\n  data.contents_->StartPrerendering();\n  while (prerender_list_.size() > max_elements_) {\n    data = prerender_list_.front();\n    prerender_list_.pop_front();\n    data.contents_->set_final_status(FINAL_STATUS_EVICTED);\n    delete data.contents_;\n  }\n  StartSchedulingPeriodicCleanups();\n  return true;\n}\n\nvoid PrerenderManager::DeleteOldEntries() {\n  while (prerender_list_.size() > 0) {\n    PrerenderContentsData data = prerender_list_.front();\n    if (IsPrerenderElementFresh(data.start_time_))\n      return;\n    prerender_list_.pop_front();\n    data.contents_->set_final_status(FINAL_STATUS_TIMED_OUT);\n    delete data.contents_;\n  }\n  if (prerender_list_.empty())\n    StopSchedulingPeriodicCleanups();\n}\n\nPrerenderContents* PrerenderManager::GetEntry(const GURL& url) {\n  DeleteOldEntries();\n  for (std::list<PrerenderContentsData>::iterator it = prerender_list_.begin();\n       it != prerender_list_.end();\n       ++it) {\n    PrerenderContents* pc = it->contents_;\n    if (pc->MatchesURL(url)) {\n      PrerenderContents* pc = it->contents_;\n      prerender_list_.erase(it);\n      return pc;\n    }\n  }\n  \/\/ Entry not found.\n  return NULL;\n}\n\nbool PrerenderManager::MaybeUsePreloadedPage(TabContents* tc, const GURL& url) {\n  DCHECK(BrowserThread::CurrentlyOn(BrowserThread::UI));\n  scoped_ptr<PrerenderContents> pc(GetEntry(url));\n  if (pc.get() == NULL)\n    return false;\n\n  if (!pc->load_start_time().is_null())\n    RecordTimeUntilUsed(base::TimeTicks::Now() - pc->load_start_time());\n  pc->set_final_status(FINAL_STATUS_USED);\n\n  RenderViewHost* rvh = pc->render_view_host();\n  \/\/ RenderViewHosts in PrerenderContents start out hidden.\n  \/\/ Since we are actually using it now, restore it.\n  rvh->WasRestored();\n  pc->set_render_view_host(NULL);\n  rvh->Send(new ViewMsg_DisplayPrerenderedPage(rvh->routing_id()));\n  tc->SwapInRenderViewHost(rvh);\n\n  ViewHostMsg_FrameNavigate_Params* p = pc->navigate_params();\n  if (p != NULL)\n    tc->DidNavigate(rvh, *p);\n\n  string16 title = pc->title();\n  if (!title.empty())\n    tc->UpdateTitle(rvh, pc->page_id(), UTF16ToWideHack(title));\n\n  GURL icon_url = pc->icon_url();\n  if (!icon_url.is_empty())\n    tc->fav_icon_helper().OnUpdateFavIconURL(pc->page_id(), icon_url);\n\n  if (pc->has_stopped_loading())\n    tc->DidStopLoading();\n\n  tc->set_was_prerendered(true);\n\n  return true;\n}\n\nvoid PrerenderManager::RemoveEntry(PrerenderContents* entry) {\n  DCHECK(BrowserThread::CurrentlyOn(BrowserThread::UI));\n  for (std::list<PrerenderContentsData>::iterator it = prerender_list_.begin();\n       it != prerender_list_.end();\n       ++it) {\n    if (it->contents_ == entry) {\n      prerender_list_.erase(it);\n      break;\n    }\n  }\n  DeleteOldEntries();\n}\n\nbase::Time PrerenderManager::GetCurrentTime() const {\n  return base::Time::Now();\n}\n\nbool PrerenderManager::IsPrerenderElementFresh(const base::Time start) const {\n  base::Time now = GetCurrentTime();\n  return (now - start < max_prerender_age_);\n}\n\nPrerenderContents* PrerenderManager::CreatePrerenderContents(\n    const GURL& url,\n    const std::vector<GURL>& alias_urls,\n    const GURL& referrer) {\n  return prerender_contents_factory_->CreatePrerenderContents(\n      this, profile_, url, alias_urls, referrer);\n}\n\nvoid PrerenderManager::RecordPerceivedPageLoadTime(base::TimeDelta pplt) {\n  bool record_windowed_pplt = ShouldRecordWindowedPPLT();\n  switch (mode_) {\n    case PRERENDER_MODE_EXPERIMENT_CONTROL_GROUP:\n      UMA_HISTOGRAM_TIMES(\"Prerender.PerceivedPageLoadTime_Control\", pplt);\n      if (record_windowed_pplt) {\n        UMA_HISTOGRAM_TIMES(\"Prerender.PerceivedPageLoadTime_WindowControl\",\n                            pplt);\n      }\n      break;\n    case PRERENDER_MODE_EXPERIMENT_PRERENDER_GROUP:\n      UMA_HISTOGRAM_TIMES(\"Prerender.PerceivedPageLoadTime_Treatment\", pplt);\n      if (record_windowed_pplt) {\n        UMA_HISTOGRAM_TIMES(\"Prerender.PerceivedPageLoadTime_WindowTreatment\",\n                            pplt);\n      }\n      break;\n    default:\n      break;\n  }\n}\n\nvoid PrerenderManager::RecordTimeUntilUsed(base::TimeDelta time_until_used) {\n  if (mode_ == PRERENDER_MODE_EXPERIMENT_PRERENDER_GROUP) {\n    UMA_HISTOGRAM_TIMES(\"Prerender.TimeUntilUsed\", time_until_used);\n  }\n}\n\nPrerenderContents* PrerenderManager::FindEntry(const GURL& url) {\n  for (std::list<PrerenderContentsData>::iterator it = prerender_list_.begin();\n       it != prerender_list_.end();\n       ++it) {\n    if (it->contents_->MatchesURL(url))\n      return it->contents_;\n  }\n  \/\/ Entry not found.\n  return NULL;\n}\n\nvoid PrerenderManager::RecordPrefetchTagObserved() {\n  \/\/ Ensure that we are in the UI thread, and post to the UI thread if\n  \/\/ necessary.\n  if (!BrowserThread::CurrentlyOn(BrowserThread::UI)) {\n    BrowserThread::PostTask(\n        BrowserThread::UI,\n        FROM_HERE,\n        NewRunnableFunction(\n            &PrerenderManager::RecordPrefetchTagObservedOnUIThread));\n  } else {\n    RecordPrefetchTagObservedOnUIThread();\n  }\n}\n\nvoid PrerenderManager::RecordPrefetchTagObservedOnUIThread() {\n  \/\/ Once we get here, we have to be on the UI thread.\n  DCHECK(BrowserThread::CurrentlyOn(BrowserThread::UI));\n\n  \/\/ If we observe multiple tags within the 30 second window, we will still\n  \/\/ reset the window to begin at the most recent occurrence, so that we will\n  \/\/ always be in a window in the 30 seconds from each occurrence.\n  last_prefetch_seen_time_ = base::TimeTicks::Now();\n}\n\nbool PrerenderManager::ShouldRecordWindowedPPLT() const {\n  DCHECK(BrowserThread::CurrentlyOn(BrowserThread::UI));\n  if (last_prefetch_seen_time_.is_null())\n    return false;\n  base::TimeDelta elapsed_time =\n      base::TimeTicks::Now() - last_prefetch_seen_time_;\n  return elapsed_time <= base::TimeDelta::FromSeconds(kWindowedPPLTSeconds);\n}\n\nvoid PrerenderManager::StartSchedulingPeriodicCleanups() {\n  if (repeating_timer_.IsRunning())\n    return;\n  repeating_timer_.Start(\n      base::TimeDelta::FromMilliseconds(kPeriodicCleanupIntervalMs),\n      this,\n      &PrerenderManager::PeriodicCleanup);\n}\n\nvoid PrerenderManager::StopSchedulingPeriodicCleanups() {\n  repeating_timer_.Stop();\n}\n\nvoid PrerenderManager::PeriodicCleanup() {\n  DeleteOldEntries();\n  \/\/ Grab a copy of the current PrerenderContents pointers, so that we\n  \/\/ will not interfere with potential deletions of the list.\n  std::vector<PrerenderContents*> prerender_contents;\n  for (std::list<PrerenderContentsData>::iterator it = prerender_list_.begin();\n       it != prerender_list_.end();\n       ++it) {\n    prerender_contents.push_back(it->contents_);\n  }\n  for (std::vector<PrerenderContents*>::iterator it =\n           prerender_contents.begin();\n       it != prerender_contents.end();\n       ++it) {\n    (*it)->DestroyWhenUsingTooManyResources();\n  }\n}\n\n}  \/\/ namespace prerender\n<commit_msg>Always record Prerender.TimeUntilUsed.<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_manager.h\"\n\n#include \"base\/logging.h\"\n#include \"base\/metrics\/histogram.h\"\n#include \"base\/time.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/fav_icon_helper.h\"\n#include \"chrome\/browser\/prerender\/prerender_contents.h\"\n#include \"chrome\/browser\/prerender\/prerender_final_status.h\"\n#include \"chrome\/common\/render_messages.h\"\n#include \"content\/browser\/browser_thread.h\"\n#include \"content\/browser\/renderer_host\/render_view_host.h\"\n#include \"content\/browser\/renderer_host\/render_process_host.h\"\n#include \"content\/browser\/tab_contents\/tab_contents.h\"\n#include \"content\/browser\/tab_contents\/render_view_host_manager.h\"\n\nnamespace prerender {\n\n\/\/ static\nbase::TimeTicks PrerenderManager::last_prefetch_seen_time_;\n\n\/\/ static\nPrerenderManager::PrerenderManagerMode PrerenderManager::mode_ =\n    PRERENDER_MODE_ENABLED;\n\n\/\/ static\nPrerenderManager::PrerenderManagerMode PrerenderManager::GetMode() {\n  return mode_;\n}\n\n\/\/ static\nvoid PrerenderManager::SetMode(PrerenderManagerMode mode) {\n  mode_ = mode;\n}\n\n\/\/ static\nbool PrerenderManager::IsPrerenderingEnabled() {\n  return\n      GetMode() == PRERENDER_MODE_ENABLED ||\n      GetMode() == PRERENDER_MODE_EXPERIMENT_PRERENDER_GROUP;\n}\n\nstruct PrerenderManager::PrerenderContentsData {\n  PrerenderContents* contents_;\n  base::Time start_time_;\n  PrerenderContentsData(PrerenderContents* contents, base::Time start_time)\n      : contents_(contents),\n        start_time_(start_time) {\n  }\n};\n\nPrerenderManager::PrerenderManager(Profile* profile)\n    : profile_(profile),\n      max_prerender_age_(base::TimeDelta::FromSeconds(\n          kDefaultMaxPrerenderAgeSeconds)),\n      max_elements_(kDefaultMaxPrerenderElements),\n      prerender_contents_factory_(PrerenderContents::CreateFactory()) {\n}\n\nPrerenderManager::~PrerenderManager() {\n  while (prerender_list_.size() > 0) {\n    PrerenderContentsData data = prerender_list_.front();\n    prerender_list_.pop_front();\n    data.contents_->set_final_status(FINAL_STATUS_MANAGER_SHUTDOWN);\n    delete data.contents_;\n  }\n}\n\nvoid PrerenderManager::SetPrerenderContentsFactory(\n    PrerenderContents::Factory* prerender_contents_factory) {\n  prerender_contents_factory_.reset(prerender_contents_factory);\n}\n\nbool PrerenderManager::AddPreload(const GURL& url,\n                                  const std::vector<GURL>& alias_urls,\n                                  const GURL& referrer) {\n  DCHECK(BrowserThread::CurrentlyOn(BrowserThread::UI));\n  DeleteOldEntries();\n  if (FindEntry(url))\n    return false;\n  \/\/ Do not prerender if there are too many render processes, and we would\n  \/\/ have to use an existing one.  We do not want prerendering to happen in\n  \/\/ a shared process, so that we can always reliably lower the CPU\n  \/\/ priority for prerendering.\n  \/\/ TODO(tburkard): Figure out how to cancel prerendering in the opposite\n  \/\/ case, when a new tab is added to a process used for prerendering.\n  if (RenderProcessHost::ShouldTryToUseExistingProcessHost()) {\n    RecordFinalStatus(FINAL_STATUS_TOO_MANY_PROCESSES);\n    return false;\n  }\n  \/\/ TODO(cbentzel): Move invalid checks here instead of PrerenderContents?\n  PrerenderContentsData data(CreatePrerenderContents(url, alias_urls, referrer),\n                             GetCurrentTime());\n  prerender_list_.push_back(data);\n  data.contents_->StartPrerendering();\n  while (prerender_list_.size() > max_elements_) {\n    data = prerender_list_.front();\n    prerender_list_.pop_front();\n    data.contents_->set_final_status(FINAL_STATUS_EVICTED);\n    delete data.contents_;\n  }\n  StartSchedulingPeriodicCleanups();\n  return true;\n}\n\nvoid PrerenderManager::DeleteOldEntries() {\n  while (prerender_list_.size() > 0) {\n    PrerenderContentsData data = prerender_list_.front();\n    if (IsPrerenderElementFresh(data.start_time_))\n      return;\n    prerender_list_.pop_front();\n    data.contents_->set_final_status(FINAL_STATUS_TIMED_OUT);\n    delete data.contents_;\n  }\n  if (prerender_list_.empty())\n    StopSchedulingPeriodicCleanups();\n}\n\nPrerenderContents* PrerenderManager::GetEntry(const GURL& url) {\n  DeleteOldEntries();\n  for (std::list<PrerenderContentsData>::iterator it = prerender_list_.begin();\n       it != prerender_list_.end();\n       ++it) {\n    PrerenderContents* pc = it->contents_;\n    if (pc->MatchesURL(url)) {\n      PrerenderContents* pc = it->contents_;\n      prerender_list_.erase(it);\n      return pc;\n    }\n  }\n  \/\/ Entry not found.\n  return NULL;\n}\n\nbool PrerenderManager::MaybeUsePreloadedPage(TabContents* tc, const GURL& url) {\n  DCHECK(BrowserThread::CurrentlyOn(BrowserThread::UI));\n  scoped_ptr<PrerenderContents> pc(GetEntry(url));\n  if (pc.get() == NULL)\n    return false;\n\n  if (!pc->load_start_time().is_null())\n    RecordTimeUntilUsed(base::TimeTicks::Now() - pc->load_start_time());\n  pc->set_final_status(FINAL_STATUS_USED);\n\n  RenderViewHost* rvh = pc->render_view_host();\n  \/\/ RenderViewHosts in PrerenderContents start out hidden.\n  \/\/ Since we are actually using it now, restore it.\n  rvh->WasRestored();\n  pc->set_render_view_host(NULL);\n  rvh->Send(new ViewMsg_DisplayPrerenderedPage(rvh->routing_id()));\n  tc->SwapInRenderViewHost(rvh);\n\n  ViewHostMsg_FrameNavigate_Params* p = pc->navigate_params();\n  if (p != NULL)\n    tc->DidNavigate(rvh, *p);\n\n  string16 title = pc->title();\n  if (!title.empty())\n    tc->UpdateTitle(rvh, pc->page_id(), UTF16ToWideHack(title));\n\n  GURL icon_url = pc->icon_url();\n  if (!icon_url.is_empty())\n    tc->fav_icon_helper().OnUpdateFavIconURL(pc->page_id(), icon_url);\n\n  if (pc->has_stopped_loading())\n    tc->DidStopLoading();\n\n  tc->set_was_prerendered(true);\n\n  return true;\n}\n\nvoid PrerenderManager::RemoveEntry(PrerenderContents* entry) {\n  DCHECK(BrowserThread::CurrentlyOn(BrowserThread::UI));\n  for (std::list<PrerenderContentsData>::iterator it = prerender_list_.begin();\n       it != prerender_list_.end();\n       ++it) {\n    if (it->contents_ == entry) {\n      prerender_list_.erase(it);\n      break;\n    }\n  }\n  DeleteOldEntries();\n}\n\nbase::Time PrerenderManager::GetCurrentTime() const {\n  return base::Time::Now();\n}\n\nbool PrerenderManager::IsPrerenderElementFresh(const base::Time start) const {\n  base::Time now = GetCurrentTime();\n  return (now - start < max_prerender_age_);\n}\n\nPrerenderContents* PrerenderManager::CreatePrerenderContents(\n    const GURL& url,\n    const std::vector<GURL>& alias_urls,\n    const GURL& referrer) {\n  return prerender_contents_factory_->CreatePrerenderContents(\n      this, profile_, url, alias_urls, referrer);\n}\n\nvoid PrerenderManager::RecordPerceivedPageLoadTime(base::TimeDelta pplt) {\n  bool record_windowed_pplt = ShouldRecordWindowedPPLT();\n  switch (mode_) {\n    case PRERENDER_MODE_EXPERIMENT_CONTROL_GROUP:\n      UMA_HISTOGRAM_TIMES(\"Prerender.PerceivedPageLoadTime_Control\", pplt);\n      if (record_windowed_pplt) {\n        UMA_HISTOGRAM_TIMES(\"Prerender.PerceivedPageLoadTime_WindowControl\",\n                            pplt);\n      }\n      break;\n    case PRERENDER_MODE_EXPERIMENT_PRERENDER_GROUP:\n      UMA_HISTOGRAM_TIMES(\"Prerender.PerceivedPageLoadTime_Treatment\", pplt);\n      if (record_windowed_pplt) {\n        UMA_HISTOGRAM_TIMES(\"Prerender.PerceivedPageLoadTime_WindowTreatment\",\n                            pplt);\n      }\n      break;\n    default:\n      break;\n  }\n}\n\nvoid PrerenderManager::RecordTimeUntilUsed(base::TimeDelta time_until_used) {\n  UMA_HISTOGRAM_TIMES(\"Prerender.TimeUntilUsed\", time_until_used);\n}\n\nPrerenderContents* PrerenderManager::FindEntry(const GURL& url) {\n  for (std::list<PrerenderContentsData>::iterator it = prerender_list_.begin();\n       it != prerender_list_.end();\n       ++it) {\n    if (it->contents_->MatchesURL(url))\n      return it->contents_;\n  }\n  \/\/ Entry not found.\n  return NULL;\n}\n\nvoid PrerenderManager::RecordPrefetchTagObserved() {\n  \/\/ Ensure that we are in the UI thread, and post to the UI thread if\n  \/\/ necessary.\n  if (!BrowserThread::CurrentlyOn(BrowserThread::UI)) {\n    BrowserThread::PostTask(\n        BrowserThread::UI,\n        FROM_HERE,\n        NewRunnableFunction(\n            &PrerenderManager::RecordPrefetchTagObservedOnUIThread));\n  } else {\n    RecordPrefetchTagObservedOnUIThread();\n  }\n}\n\nvoid PrerenderManager::RecordPrefetchTagObservedOnUIThread() {\n  \/\/ Once we get here, we have to be on the UI thread.\n  DCHECK(BrowserThread::CurrentlyOn(BrowserThread::UI));\n\n  \/\/ If we observe multiple tags within the 30 second window, we will still\n  \/\/ reset the window to begin at the most recent occurrence, so that we will\n  \/\/ always be in a window in the 30 seconds from each occurrence.\n  last_prefetch_seen_time_ = base::TimeTicks::Now();\n}\n\nbool PrerenderManager::ShouldRecordWindowedPPLT() const {\n  DCHECK(BrowserThread::CurrentlyOn(BrowserThread::UI));\n  if (last_prefetch_seen_time_.is_null())\n    return false;\n  base::TimeDelta elapsed_time =\n      base::TimeTicks::Now() - last_prefetch_seen_time_;\n  return elapsed_time <= base::TimeDelta::FromSeconds(kWindowedPPLTSeconds);\n}\n\nvoid PrerenderManager::StartSchedulingPeriodicCleanups() {\n  if (repeating_timer_.IsRunning())\n    return;\n  repeating_timer_.Start(\n      base::TimeDelta::FromMilliseconds(kPeriodicCleanupIntervalMs),\n      this,\n      &PrerenderManager::PeriodicCleanup);\n}\n\nvoid PrerenderManager::StopSchedulingPeriodicCleanups() {\n  repeating_timer_.Stop();\n}\n\nvoid PrerenderManager::PeriodicCleanup() {\n  DeleteOldEntries();\n  \/\/ Grab a copy of the current PrerenderContents pointers, so that we\n  \/\/ will not interfere with potential deletions of the list.\n  std::vector<PrerenderContents*> prerender_contents;\n  for (std::list<PrerenderContentsData>::iterator it = prerender_list_.begin();\n       it != prerender_list_.end();\n       ++it) {\n    prerender_contents.push_back(it->contents_);\n  }\n  for (std::vector<PrerenderContents*>::iterator it =\n           prerender_contents.begin();\n       it != prerender_contents.end();\n       ++it) {\n    (*it)->DestroyWhenUsingTooManyResources();\n  }\n}\n\n}  \/\/ namespace prerender\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/ \\file player.cpp\n\/\/\/ Holds all code for the MistPlayer application used for VoD streams.\n\n#include <iostream>\/\/for std::cerr\n#include <stdio.h> \/\/for fileno\n#include <stdlib.h> \/\/for atoi\n#include <sys\/time.h>\n#include <mist\/dtsc.h>\n#include <mist\/json.h>\n#include <mist\/config.h>\n#include <mist\/socket.h>\n#include <mist\/timing.h>\n#include <mist\/procs.h>\n\n\/\/under cygwin, recv blocks for ~15ms if no data is available.\n\/\/This is a hack to keep performance decent with that bug present.\n#ifdef __CYGWIN__\n#define CYG_DEFI int cyg_count;\n#define CYG_INCR cyg_count++;\n#define CYG_LOOP (cyg_count % 20 == 0) &&\n#else\n#define CYG_DEFI \n#define CYG_INCR \n#define CYG_LOOP \n#endif\n\n\/\/\/Converts a stats line to up, down, host, connector and conntime values.\nclass Stats{\n  public:\n    unsigned int up;\/\/\/<The amount of bytes sent upstream.\n    unsigned int down;\/\/\/<The amount of bytes received downstream.\n    std::string host;\/\/\/<The connected host.\n    std::string connector;\/\/\/<The connector the user is connected with.\n    unsigned int conntime;\/\/\/<The amount of time the user is connected.\n    \/\/\/\\brief Default stats constructor.\n    \/\/\/\n    \/\/\/Should not be used.\n    Stats(){\n      up = 0;\n      down = 0;\n      conntime = 0;\n    }\n    ;\n    \/\/\/\\brief Stats constructor reading a string.\n    \/\/\/\n    \/\/\/Reads a stats string and parses it to the internal representation.\n    \/\/\/\\param s The string of stats.\n    Stats(std::string s){\n      size_t f = s.find(' ');\n      if (f != std::string::npos){\n        host = s.substr(0, f);\n        s.erase(0, f + 1);\n      }\n      f = s.find(' ');\n      if (f != std::string::npos){\n        connector = s.substr(0, f);\n        s.erase(0, f + 1);\n      }\n      f = s.find(' ');\n      if (f != std::string::npos){\n        conntime = atoi(s.substr(0, f).c_str());\n        s.erase(0, f + 1);\n      }\n      f = s.find(' ');\n      if (f != std::string::npos){\n        up = atoi(s.substr(0, f).c_str());\n        s.erase(0, f + 1);\n        down = atoi(s.c_str());\n      }\n    }\n};\n\nint main(int argc, char** argv){\n  Util::Config conf(argv[0], PACKAGE_VERSION);\n  conf.addOption(\"filename\", JSON::fromString(\"{\\\"arg_num\\\":1, \\\"help\\\":\\\"Name of the file to write to stdout.\\\"}\"));\n  conf.parseArgs(argc, argv);\n  conf.activate();\n  int playing = 0;\n\n  Socket::Connection in_out = Socket::Connection(fileno(stdout), fileno(stdin));\n\n  DTSC::File source = DTSC::File(conf.getString(\"filename\"));\n  JSON::Value meta = source.getMeta();\n\n  \/\/send the header\n  std::string meta_str = meta.toNetPacked();\n  in_out.Send(meta_str);\n\n  if ( !(meta.isMember(\"keytime\") && meta.isMember(\"keybpos\") && meta.isMember(\"keynum\") && meta.isMember(\"keylen\") && meta.isMember(\"frags\"))\n      && meta.isMember(\"video\")){\n    \/\/file needs to be DTSCFix'ed! Run MistDTSCFix executable on it first\n    std::cerr << \"Calculating \/ writing \/ updating VoD metadata...\" << std::endl;\n    Util::Procs::Start(\"Fixer\", Util::getMyPath() + \"MistDTSCFix \" + conf.getString(\"filename\"));\n    while (Util::Procs::isActive(\"Fixer\")){\n      Util::sleep(5000);\n    }\n    std::cerr << \"Done! Aborting this request to make sure all goes well.\" << std::endl;\n    return 1;\n  }\n\n  JSON::Value pausemark;\n  pausemark[\"datatype\"] = \"pause_marker\";\n  pausemark[\"time\"] = (long long int)0;\n\n  Socket::Connection StatsSocket = Socket::Connection(\"\/tmp\/mist\/statistics\", true);\n  int lasttime = Util::epoch(); \/\/time last packet was sent\n\n  if (meta[\"video\"][\"keyms\"].asInt() < 11){\n    meta[\"video\"][\"keyms\"] = (long long int)1000;\n  }\n  JSON::Value last_pack;\n\n  bool meta_sent = false;\n  int playUntil = -1;\n  long long now = 0; \/\/for timing of sending packets\n  long long bench = 0; \/\/for benchmarking\n  std::set<int> newSelect;\n  Stats sts;\n  CYG_DEFI\n\n  while (in_out.connected() && (Util::epoch() - lasttime < 60) && conf.is_active){\n    CYG_INCR\n    if (CYG_LOOP in_out.spool()){\n      while (in_out.Received().size()){\n        \/\/delete anything that doesn't end with a newline\n        if ( *(in_out.Received().get().rbegin()) != '\\n'){\n          in_out.Received().get().clear();\n          continue;\n        }\n        in_out.Received().get().resize(in_out.Received().get().size() - 1);\n        if ( !in_out.Received().get().empty()){\n          switch (in_out.Received().get()[0]){\n            case 'P': { \/\/Push\n#if DEBUG >= 4\n              std::cerr << \"Received push - ignoring (\" << in_out.Received().get() << \")\" << std::endl;\n#endif\n              in_out.close(); \/\/pushing to VoD makes no sense\n              break;\n            }\n            case 'S': { \/\/Stats\n              if ( !StatsSocket.connected()){\n                StatsSocket = Socket::Connection(\"\/tmp\/mist\/statistics\", true);\n              }\n              if (StatsSocket.connected()){\n                sts = Stats(in_out.Received().get().substr(2));\n                JSON::Value json_sts;\n                json_sts[\"vod\"][\"down\"] = (long long int)sts.down;\n                json_sts[\"vod\"][\"up\"] = (long long int)sts.up;\n                json_sts[\"vod\"][\"time\"] = (long long int)sts.conntime;\n                json_sts[\"vod\"][\"host\"] = sts.host;\n                json_sts[\"vod\"][\"connector\"] = sts.connector;\n                json_sts[\"vod\"][\"filename\"] = conf.getString(\"filename\");\n                json_sts[\"vod\"][\"now\"] = Util::epoch();\n                json_sts[\"vod\"][\"start\"] = Util::epoch() - sts.conntime;\n                if ( !meta_sent){\n                  json_sts[\"vod\"][\"meta\"] = meta;\n                  for (JSON::ObjIter oIt = json_sts[\"vod\"][\"meta\"][\"tracks\"].ObjBegin(); oIt != json_sts[\"vod\"][\"meta\"][\"tracks\"].ObjEnd(); oIt++){\n                    oIt->second.removeMember(\"init\");\n                    oIt->second.removeMember(\"keys\");\n                    oIt->second.removeMember(\"frags\");\n                  }\n                  meta_sent = true;\n                }\n                StatsSocket.Send(json_sts.toString().c_str());\n                StatsSocket.Send(\"\\n\\n\");\n                StatsSocket.flush();\n              }\n              break;\n            }\n            case 's': { \/\/second-seek\n              int ms = JSON::Value(in_out.Received().get().substr(2)).asInt();\n              bool ret = source.seek_time(ms);\n              break;\n            }\n            case 'p': { \/\/play\n              playing = -1;\n              in_out.setBlocking(false);\n              if (in_out.Received().get().size() >= 2){\n                playUntil = atoi(in_out.Received().get().substr(2).c_str());\n              }else{\n                playUntil = 0;\n              }\n              break;\n            }\n            case 'o': { \/\/once-play\n              if (playing <= 0){\n                playing = 1;\n              }\n              ++playing;\n              in_out.setBlocking(false);\n              bench = Util::getMS();\n              break;\n            }\n            case 'q': { \/\/quit-playing\n              playing = 0;\n              in_out.setBlocking(true);\n              break;\n            }\n            case 't': {\n              newSelect.clear();\n              std::string tmp = in_out.Received().get().substr(2);\n              while (tmp != \"\"){\n                newSelect.insert(atoi(tmp.substr(0,tmp.find(' ')).c_str()));\n                if (tmp.find(' ') != std::string::npos){\n                  tmp.erase(0,tmp.find(' ')+1);\n                }else{\n                  tmp = \"\";\n                }\n              }\n              source.selectTracks(newSelect);\n              break;\n            }\n#if DEBUG >= 4\n            default: {\n              std::cerr << \"MistPlayer received an unknown command: \" << in_out.Received().get() << std::endl;\n              break;\n            }\n#endif\n          }\n          in_out.Received().get().clear();\n        }\n      }\n    }\n    if (playing != 0){\n      now = Util::getMS();\n      source.seekNext();\n      if ( !source.getJSON()){\n        playing = 0;\n      }\n      if (source.atKeyframe()){\n        if (playing > 0){\n          --playing;\n        }\n      }\n      if ( playUntil && playUntil <= source.getJSON()[\"time\"].asInt()){\n        playing = 0;\n      }\n      if (playing == 0){\n#if DEBUG >= 4\n        std::cerr << \"Completed VoD request in MistPlayer (\" << (Util::getMS() - bench) << \"ms)\" << std::endl;\n#endif\n        pausemark[\"time\"] = source.getJSON()[\"time\"];\n        pausemark.netPrepare();\n        in_out.SendNow(pausemark.toNetPacked());\n        in_out.setBlocking(true);\n      }else{\n        lasttime = Util::epoch();\n        \/\/insert proper header for this type of data\n        in_out.Send(\"DTP2\");\n        \/\/insert the packet length\n        unsigned int size = htonl( source.getPacket().size());\n        in_out.Send((char*) &size, 4);\n        in_out.SendNow(source.getPacket());\n      }\n    }else{\n      Util::sleep(10);\n    }\n  }\n  StatsSocket.close();\n  in_out.close();\n#if DEBUG >= 5\n  if (Util::epoch() - lasttime < 60){\n    std::cerr << \"MistPlayer exited (disconnect).\" << std::endl;\n  }else{\n    std::cerr << \"MistPlayer exited (command timeout).\" << std::endl;\n  }\n#endif\n  return 0;\n}\n<commit_msg>Fixed MistPlayer CPU usage and benchmarking texts.<commit_after>\/\/\/ \\file player.cpp\n\/\/\/ Holds all code for the MistPlayer application used for VoD streams.\n\n#include <iostream>\/\/for std::cerr\n#include <stdio.h> \/\/for fileno\n#include <stdlib.h> \/\/for atoi\n#include <sys\/time.h>\n#include <mist\/dtsc.h>\n#include <mist\/json.h>\n#include <mist\/config.h>\n#include <mist\/socket.h>\n#include <mist\/timing.h>\n#include <mist\/procs.h>\n\n\/\/under cygwin, recv blocks for ~15ms if no data is available.\n\/\/This is a hack to keep performance decent with that bug present.\n#ifdef __CYGWIN__\n#define CYG_DEFI int cyg_count;\n#define CYG_INCR cyg_count++;\n#define CYG_LOOP (cyg_count % 20 == 0) &&\n#else\n#define CYG_DEFI \n#define CYG_INCR \n#define CYG_LOOP \n#endif\n\n\/\/\/Converts a stats line to up, down, host, connector and conntime values.\nclass Stats{\n  public:\n    unsigned int up;\/\/\/<The amount of bytes sent upstream.\n    unsigned int down;\/\/\/<The amount of bytes received downstream.\n    std::string host;\/\/\/<The connected host.\n    std::string connector;\/\/\/<The connector the user is connected with.\n    unsigned int conntime;\/\/\/<The amount of time the user is connected.\n    \/\/\/\\brief Default stats constructor.\n    \/\/\/\n    \/\/\/Should not be used.\n    Stats(){\n      up = 0;\n      down = 0;\n      conntime = 0;\n    }\n    ;\n    \/\/\/\\brief Stats constructor reading a string.\n    \/\/\/\n    \/\/\/Reads a stats string and parses it to the internal representation.\n    \/\/\/\\param s The string of stats.\n    Stats(std::string s){\n      size_t f = s.find(' ');\n      if (f != std::string::npos){\n        host = s.substr(0, f);\n        s.erase(0, f + 1);\n      }\n      f = s.find(' ');\n      if (f != std::string::npos){\n        connector = s.substr(0, f);\n        s.erase(0, f + 1);\n      }\n      f = s.find(' ');\n      if (f != std::string::npos){\n        conntime = atoi(s.substr(0, f).c_str());\n        s.erase(0, f + 1);\n      }\n      f = s.find(' ');\n      if (f != std::string::npos){\n        up = atoi(s.substr(0, f).c_str());\n        s.erase(0, f + 1);\n        down = atoi(s.c_str());\n      }\n    }\n};\n\nint main(int argc, char** argv){\n  Util::Config conf(argv[0], PACKAGE_VERSION);\n  conf.addOption(\"filename\", JSON::fromString(\"{\\\"arg_num\\\":1, \\\"help\\\":\\\"Name of the file to write to stdout.\\\"}\"));\n  conf.parseArgs(argc, argv);\n  conf.activate();\n  int playing = 0;\n\n  Socket::Connection in_out = Socket::Connection(fileno(stdout), fileno(stdin));\n\n  DTSC::File source = DTSC::File(conf.getString(\"filename\"));\n  JSON::Value meta = source.getMeta();\n\n  \/\/send the header\n  std::string meta_str = meta.toNetPacked();\n  in_out.Send(meta_str);\n\n  if ( !(meta.isMember(\"keytime\") && meta.isMember(\"keybpos\") && meta.isMember(\"keynum\") && meta.isMember(\"keylen\") && meta.isMember(\"frags\"))\n      && meta.isMember(\"video\")){\n    \/\/file needs to be DTSCFix'ed! Run MistDTSCFix executable on it first\n    std::cerr << \"Calculating \/ writing \/ updating VoD metadata...\" << std::endl;\n    Util::Procs::Start(\"Fixer\", Util::getMyPath() + \"MistDTSCFix \" + conf.getString(\"filename\"));\n    while (Util::Procs::isActive(\"Fixer\")){\n      Util::sleep(5000);\n    }\n    std::cerr << \"Done! Aborting this request to make sure all goes well.\" << std::endl;\n    return 1;\n  }\n\n  JSON::Value pausemark;\n  pausemark[\"datatype\"] = \"pause_marker\";\n  pausemark[\"time\"] = (long long int)0;\n\n  Socket::Connection StatsSocket = Socket::Connection(\"\/tmp\/mist\/statistics\", true);\n  int lasttime = Util::epoch(); \/\/time last packet was sent\n\n  if (meta[\"video\"][\"keyms\"].asInt() < 11){\n    meta[\"video\"][\"keyms\"] = (long long int)1000;\n  }\n  JSON::Value last_pack;\n\n  bool meta_sent = false;\n  int playUntil = -1;\n  long long now, lastTime = 0; \/\/for timing of sending packets\n  long long bench = 0; \/\/for benchmarking\n  std::set<int> newSelect;\n  Stats sts;\n  CYG_DEFI\n\n  while (in_out.connected() && (Util::epoch() - lasttime < 60) && conf.is_active){\n    CYG_INCR\n    if (CYG_LOOP in_out.spool()){\n      while (in_out.Received().size()){\n        \/\/delete anything that doesn't end with a newline\n        if ( *(in_out.Received().get().rbegin()) != '\\n'){\n          in_out.Received().get().clear();\n          continue;\n        }\n        in_out.Received().get().resize(in_out.Received().get().size() - 1);\n        if ( !in_out.Received().get().empty()){\n          switch (in_out.Received().get()[0]){\n            case 'P': { \/\/Push\n#if DEBUG >= 4\n              std::cerr << \"Received push - ignoring (\" << in_out.Received().get() << \")\" << std::endl;\n#endif\n              in_out.close(); \/\/pushing to VoD makes no sense\n              break;\n            }\n            case 'S': { \/\/Stats\n              if ( !StatsSocket.connected()){\n                StatsSocket = Socket::Connection(\"\/tmp\/mist\/statistics\", true);\n              }\n              if (StatsSocket.connected()){\n                sts = Stats(in_out.Received().get().substr(2));\n                JSON::Value json_sts;\n                json_sts[\"vod\"][\"down\"] = (long long int)sts.down;\n                json_sts[\"vod\"][\"up\"] = (long long int)sts.up;\n                json_sts[\"vod\"][\"time\"] = (long long int)sts.conntime;\n                json_sts[\"vod\"][\"host\"] = sts.host;\n                json_sts[\"vod\"][\"connector\"] = sts.connector;\n                json_sts[\"vod\"][\"filename\"] = conf.getString(\"filename\");\n                json_sts[\"vod\"][\"now\"] = Util::epoch();\n                json_sts[\"vod\"][\"start\"] = Util::epoch() - sts.conntime;\n                if ( !meta_sent){\n                  json_sts[\"vod\"][\"meta\"] = meta;\n                  for (JSON::ObjIter oIt = json_sts[\"vod\"][\"meta\"][\"tracks\"].ObjBegin(); oIt != json_sts[\"vod\"][\"meta\"][\"tracks\"].ObjEnd(); oIt++){\n                    oIt->second.removeMember(\"init\");\n                    oIt->second.removeMember(\"keys\");\n                    oIt->second.removeMember(\"frags\");\n                  }\n                  meta_sent = true;\n                }\n                StatsSocket.Send(json_sts.toString().c_str());\n                StatsSocket.Send(\"\\n\\n\");\n                StatsSocket.flush();\n              }\n              break;\n            }\n            case 's': { \/\/second-seek\n              int ms = JSON::Value(in_out.Received().get().substr(2)).asInt();\n              bool ret = source.seek_time(ms);\n              lasttime = 0;\n              break;\n            }\n            case 'p': { \/\/play\n              playing = -1;\n              lasttime = 0;\n              in_out.setBlocking(false);\n              if (in_out.Received().get().size() >= 2){\n                playUntil = atoi(in_out.Received().get().substr(2).c_str());\n                bench = Util::getMS();\n              }else{\n                playUntil = 0;\n              }\n              break;\n            }\n            case 'o': { \/\/once-play\n              if (playing <= 0){\n                playing = 1;\n              }\n              ++playing;\n              in_out.setBlocking(false);\n              bench = Util::getMS();\n              break;\n            }\n            case 'q': { \/\/quit-playing\n              playing = 0;\n              in_out.setBlocking(true);\n              break;\n            }\n            case 't': {\n              newSelect.clear();\n              std::string tmp = in_out.Received().get().substr(2);\n              while (tmp != \"\"){\n                newSelect.insert(atoi(tmp.substr(0,tmp.find(' ')).c_str()));\n                if (tmp.find(' ') != std::string::npos){\n                  tmp.erase(0,tmp.find(' ')+1);\n                }else{\n                  tmp = \"\";\n                }\n              }\n              source.selectTracks(newSelect);\n              break;\n            }\n#if DEBUG >= 4\n            default: {\n              std::cerr << \"MistPlayer received an unknown command: \" << in_out.Received().get() << std::endl;\n              break;\n            }\n#endif\n          }\n          in_out.Received().get().clear();\n        }\n      }\n    }\n    if (playing != 0){\n      now = Util::getMS();\n      source.seekNext();\n      if ( !source.getJSON()){\n        playing = 0;\n      }\n      if (source.atKeyframe()){\n        if (playing > 0){\n          --playing;\n        }\n      }\n      if (lastTime == 0){\n        lastTime = now - source.getJSON()[\"time\"].asInt();\n      }\n      if (playing == -1 && playUntil == 0 && source.getJSON()[\"time\"].asInt() > now - lastTime + 2500){\n        std::cerr << (source.getJSON()[\"time\"].asInt() - (now - lastTime)) << \" sleepytimes\" << std::endl;\n        Util::sleep(source.getJSON()[\"time\"].asInt() - (now - lastTime));\n      }\n      if ( playUntil && playUntil < source.getJSON()[\"time\"].asInt()){\n        playing = 0;\n      }\n      if (playing == 0){\n#if DEBUG >= 4\n        std::cerr << \"Completed VoD request in MistPlayer (\" << (Util::getMS() - bench) << \"ms)\" << std::endl;\n#endif\n        pausemark[\"time\"] = source.getJSON()[\"time\"];\n        pausemark.netPrepare();\n        in_out.SendNow(pausemark.toNetPacked());\n        in_out.setBlocking(true);\n      }else{\n        lasttime = Util::epoch();\n        \/\/insert proper header for this type of data\n        in_out.Send(\"DTP2\");\n        \/\/insert the packet length\n        unsigned int size = htonl( source.getPacket().size());\n        in_out.Send((char*) &size, 4);\n        in_out.SendNow(source.getPacket());\n      }\n    }else{\n      Util::sleep(10);\n    }\n  }\n  StatsSocket.close();\n  in_out.close();\n#if DEBUG >= 5\n  if (Util::epoch() - lasttime < 60){\n    std::cerr << \"MistPlayer exited (disconnect).\" << std::endl;\n  }else{\n    std::cerr << \"MistPlayer exited (command timeout).\" << std::endl;\n  }\n#endif\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"MenuManager.hpp\"\n#include \"Globals.hpp\"\n#include <exception>\n#include \"GameEngine\/GameEngine.h\"\n#include \"Events\/UIChangeEvent.hpp\"\n#include \"Events\/UISelectEvent.hpp\"\n#include \"Events\/ShutdownEvent.hpp\"\n#include \"Events\/QuitRequestEvent.hpp\"\n#include \"Events\/GameStartEvent.hpp\"\n#include \"Events\/KeyboardEvent.hpp\"\n#include \"Events\/PauseToggleEvent.hpp\"\n#include \"Components\/SpriteComponent.hpp\"\n\n\nnamespace ASSB\n{\n\t\/\/ Static initialization\n\tMenuManager *MenuManager::Instance = nullptr;\n\n\n\t\/\/ Constructor\n\tMenuManager::MenuManager()\n\t\t: EventSystem::ObjectEventManager(Globals::EventSystemInstance)\n\t\t, onMainMenu_(true)\n\t\t, onPauseMenu_(false)\n\t{\n\t\t\/\/ Singleton enforcement\n\t\tif (Instance == nullptr)\n\t\t\tInstance = this;\n\t\telse\n\t\t\tthrow std::exception(\"One set of menus is enough, don't you think?\");\n\n\t\t\/\/ Main Menu System\n\t\tASSB::Globals::ObjectID obj = GameEngine::Instance->CreateGameObject(\"mainMenu\");\n\t\tGameEngine::Instance->AddComponent<MenuComponent>(obj);\n\t\tGameEngine::Instance->GetComponent<SpriteComponent>(obj)->Visible = false;\n\t\tASSB::ComponentHandle<MenuComponent> comp = GameEngine::Instance->GetComponent<MenuComponent>(obj);\n\t\tcomp->SetSpacing({ 0, -.4f, 0 });\n\t\tcomp->SetPosition({ -0.5f, 3.0f, 0 });\n\t\tcomp->SetIndicatorTag(\"selectImage\", { 1.75f, .4f, 0 });\n\t\tcomp->AddInteractable(\"start\", { 1.5f,.3f,0 }, new GameStartEvent());\n\t\tcomp->AddInteractable(\"options\", { 1.5f,.3f,0 }, new QuitRequestEvent());\n\t\tcomp->AddInteractable(\"credits\", { 1.5f,.3f,0 }, new QuitRequestEvent());\n\t\tcomp->AddInteractable(\"quit\", { 1.5f,.3f,0 }, new ShutdownEvent());\n\t\t\n\t\t\/\/ Pause Menu System\n\t\tASSB::Globals::ObjectID pause = GameEngine::Instance->CreateGameObject(\"pauseMenu\");\n\t\tGameEngine::Instance->AddComponent<MenuComponent>(pause);\n\t\tGameEngine::Instance->GetComponent<SpriteComponent>(pause)->Visible = false;\n\t\tASSB::ComponentHandle<MenuComponent> pauseComp = GameEngine::Instance->GetComponent<MenuComponent>(pause);\n\t\tpauseComp->SetSpacing({ 0, -.4f, 0 });\n\t\tpauseComp->SetPosition({ 1, 2, 0 });\n\t\tpauseComp->SetIndicatorTag(\"selectImage\", { 1.75f, .4f, 0 });\n\t\tpauseComp->AddInteractable(\"resume\", { 1.5f,.3f,0 }, new PauseToggleEvent(false));\n\t\t\/\/pauseComp->AddInteractable(\"restart\", { 1.5f,.3f,0 }, new QuitRequestEvent());\n\t\tpauseComp->AddInteractable(\"exit\", { 1.5f,.3f,0 }, new ShutdownEvent());\n\t\tpauseComp->SetActive(false);\n\t\tpauseComp->SetVisible(false);\n\n\t\t\/\/ Audio\n\t\tinitializeSFX();\n\n\t\t\/\/ Event connection\n\t\tConnect(this, &MenuManager::quitRequest);\n\t\tConnect(this, &MenuManager::shutdownRequest);\n\t\tConnect(this, &MenuManager::shutdownRequest);\n\t\tConnect(this, &MenuManager::gameStart);\n\t\tConnect(this, &MenuManager::handleKeyboard);\n\t\tConnect(this, &MenuManager::pauseToggle);\n\n\t\t\/\/ Dispatch\n\t\tASSB::Globals::EventSystemInstance.Dispatch(new PauseToggleEvent(true));\n\t}\n\n\t\/\/ Creates necessary SFX Objects\n\tvoid MenuManager::initializeSFX()\n\t{\n\t\t\/\/ Select\n\t\tGlobals::ObjectID id = GameEngine::Instance->CreateGameObject();\n\t\tGameEngine::Instance->AddComponent<SoundEmitterComponent>(id);\n\t\tComponentHandle<SoundEmitterComponent> se = GameEngine::Instance->GetComponent<SoundEmitterComponent>(id);\n\t\tGameEngine::Instance->GetComponent<SpriteComponent>(id)->Visible = false;\n\t\tse->SetSource(\"Select1\");\n\t\tse->PlayOnEvent<UIChangeEvent>();\n\n\t\t\/\/ Confirm\n\t\tGlobals::ObjectID id2 = GameEngine::Instance->CreateGameObject();\n\t\tGameEngine::Instance->AddComponent<SoundEmitterComponent>(id2);\n\t\tComponentHandle<SoundEmitterComponent> se2 = GameEngine::Instance->GetComponent<SoundEmitterComponent>(id2);\n\t\tGameEngine::Instance->GetComponent<SpriteComponent>(id2)->Visible = false;\n\t\tse2->SetSource(\"Confirm1\");\n\t\tse2->PlayOnEvent<UISelectEvent>();\n\t}\n\n\t\/\/ Game will prompt for confirmation of action;\n\tvoid MenuManager::quitRequest(QuitRequestEvent *e)\n\t{\n\t\t\/\/ confirm?\n\t\tUNUSED(e);\n\t}\n\n\t\/\/ Game window will be terminated.\n\tvoid MenuManager::shutdownRequest(ShutdownEvent *e)\n\t{\n\t\tGameEngine::Instance->Shutdown();\n\t\tUNUSED(e);\n\t}\n\n\t\/\/ Start the game\n\tvoid MenuManager::gameStart(GameStartEvent *e)\n\t{\n\t\tGlobals::ObjectID id = GameEngine::Instance->GetIdOf(\"player\");\n\t\tGlobals::ObjectID id2 = GameEngine::Instance->GetIdOf(\"mainMenu\");\n\t\tGameEngine::Instance->GetComponent<PlayerManagerComponent>(id)->SetActive(true);\n\t\tGameEngine::Instance->GetComponent<MenuComponent>(id2)->SetActive(false);\n\t\tGameEngine::Instance->GetComponent<MenuComponent>(id2)->SetVisible(false);\n\t\tonMainMenu_ = false;\n\t\tUNUSED(e);\n\t}\n\n\t\/\/ Catch relevant keyboard input\n\tvoid MenuManager::handleKeyboard(KeyboardEvent *e)\n\t{\n\t\tif (e->Down)\n\t\t{\n\t\t\tif (e->Key == Key::P || e->Key == Key::Escape)\n\t\t\t{\n\t\t\t\tif (!onMainMenu_)\n\t\t\t\t{\n\t\t\t\t\tif (onPauseMenu_)\n\t\t\t\t\t{\n\t\t\t\t\t\tASSB::Globals::EventSystemInstance.Dispatch(new PauseToggleEvent(false));\n\t\t\t\t\t\tonPauseMenu_ = false;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tASSB::Globals::EventSystemInstance.Dispatch(new PauseToggleEvent(true));\n\t\t\t\t\t\tonPauseMenu_ = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\n\t\/\/ Pause was hit on or off\n\tvoid MenuManager::pauseToggle(PauseToggleEvent *e)\n\t{\n\t\tGlobals::ObjectID id = GameEngine::Instance->GetIdOf(\"player\");\n\t\tGlobals::ObjectID id2 = GameEngine::Instance->GetIdOf(\"pauseMenu\");\n\t\tif(e->Paused)\n\t\t{\n\t\t\t\/\/ Show menu and stop player\n\t\t\tGameEngine::Instance->GetComponent<PlayerManagerComponent>(id)->SetActive(false);\n\t\t\tComponentHandle<MenuComponent> menuComp = GameEngine::Instance->GetComponent<MenuComponent>(id2);\n\t\t\tmenuComp->SetActive(true);\n\t\t\tmenuComp->SetVisible(true);\n\t\t\tmenuComp->SetPosition(GameEngine::Instance->Camera.GetPosition());\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ enable player and hide menu\n\t\t\tGameEngine::Instance->GetComponent<PlayerManagerComponent>(id)->SetActive(true);\n\t\t\tGameEngine::Instance->GetComponent<MenuComponent>(id2)->SetActive(false);\n\t\t\tGameEngine::Instance->GetComponent<MenuComponent>(id2)->SetVisible(false);\n\t\t}\n\t}\n}\n<commit_msg>= Menu component behaves I think<commit_after>#include \"MenuManager.hpp\"\n#include \"Globals.hpp\"\n#include <exception>\n#include \"GameEngine\/GameEngine.h\"\n#include \"Events\/UIChangeEvent.hpp\"\n#include \"Events\/UISelectEvent.hpp\"\n#include \"Events\/ShutdownEvent.hpp\"\n#include \"Events\/QuitRequestEvent.hpp\"\n#include \"Events\/GameStartEvent.hpp\"\n#include \"Events\/KeyboardEvent.hpp\"\n#include \"Events\/PauseToggleEvent.hpp\"\n#include \"Events\/LoseEvent.hpp\"\n#include \"Components\/SpriteComponent.hpp\"\n\n\nnamespace ASSB\n{\n\t\/\/ Static initialization\n\tMenuManager *MenuManager::Instance = nullptr;\n\n\n\t\/\/ Constructor\n\tMenuManager::MenuManager()\n\t\t: EventSystem::ObjectEventManager(Globals::EventSystemInstance)\n\t\t, onMainMenu_(true)\n\t\t, onPauseMenu_(false)\n\t{\n\t\t\/\/ Singleton enforcement\n\t\tif (Instance == nullptr)\n\t\t\tInstance = this;\n\t\telse\n\t\t\tthrow std::exception(\"One set of menus is enough, don't you think?\");\n\n\t\t\/\/ Main Menu System\n\t\tASSB::Globals::ObjectID obj = GameEngine::Instance->CreateGameObject(\"mainMenu\");\n\t\tGameEngine::Instance->AddComponent<MenuComponent>(obj);\n\t\tGameEngine::Instance->GetComponent<SpriteComponent>(obj)->Visible = false;\n\t\tASSB::ComponentHandle<MenuComponent> comp = GameEngine::Instance->GetComponent<MenuComponent>(obj);\n\t\tcomp->SetSpacing({ 0, -.4f, 0 });\n\t\tcomp->SetPosition({ -0.5f, 3.0f, 0 });\n\t\tcomp->SetIndicatorTag(\"selectImage\", { 1.75f, .4f, 0 });\n\t\tcomp->AddInteractable(\"start\", { 1.5f,.3f,0 }, new GameStartEvent());\n\t\tcomp->AddInteractable(\"options\", { 1.5f,.3f,0 }, new QuitRequestEvent());\n\t\tcomp->AddInteractable(\"credits\", { 1.5f,.3f,0 }, new QuitRequestEvent());\n\t\tcomp->AddInteractable(\"quit\", { 1.5f,.3f,0 }, new ShutdownEvent());\n\t\t\n\t\t\/\/ Pause Menu System\n\t\tASSB::Globals::ObjectID pause = GameEngine::Instance->CreateGameObject(\"pauseMenu\");\n\t\tGameEngine::Instance->AddComponent<MenuComponent>(pause);\n\t\tGameEngine::Instance->GetComponent<SpriteComponent>(pause)->Visible = false;\n\t\tASSB::ComponentHandle<MenuComponent> pauseComp = GameEngine::Instance->GetComponent<MenuComponent>(pause);\n\t\tpauseComp->SetSpacing({ 0, -.4f, 0 });\n\t\tpauseComp->SetPosition({ 1, 2, 0 });\n\t\tpauseComp->SetIndicatorTag(\"selectImage\", { 1.75f, .4f, 0 });\n\t\tpauseComp->AddInteractable(\"resume\", { 1.5f,.3f,0 }, new PauseToggleEvent(false));\n\t\tpauseComp->AddInteractable(\"restart\", { 1.5f,.3f,0 }, new LoseEvent(GameTime()));\n\t\tpauseComp->AddInteractable(\"exit\", { 1.5f,.3f,0 }, new ShutdownEvent());\n\t\tpauseComp->SetActive(false);\n\t\tpauseComp->SetVisible(false);\n\n\t\t\/\/ Audio\n\t\tinitializeSFX();\n\n\t\t\/\/ Event connection\n\t\tConnect(this, &MenuManager::quitRequest);\n\t\tConnect(this, &MenuManager::shutdownRequest);\n\t\tConnect(this, &MenuManager::shutdownRequest);\n\t\tConnect(this, &MenuManager::gameStart);\n\t\tConnect(this, &MenuManager::handleKeyboard);\n\t\tConnect(this, &MenuManager::pauseToggle);\n\n\t\t\/\/ Initial paused\n\t\tASSB::Globals::EventSystemInstance.Dispatch(new PauseToggleEvent(true));\n\t}\n\n\t\/\/ Creates necessary SFX Objects\n\tvoid MenuManager::initializeSFX()\n\t{\n\t\t\/\/ Select\n\t\tGlobals::ObjectID id = GameEngine::Instance->CreateGameObject();\n\t\tGameEngine::Instance->AddComponent<SoundEmitterComponent>(id);\n\t\tComponentHandle<SoundEmitterComponent> se = GameEngine::Instance->GetComponent<SoundEmitterComponent>(id);\n\t\tGameEngine::Instance->GetComponent<SpriteComponent>(id)->Visible = false;\n\t\tse->SetSource(\"Select1\");\n\t\tse->PlayOnEvent<UIChangeEvent>();\n\n\t\t\/\/ Confirm\n\t\tGlobals::ObjectID id2 = GameEngine::Instance->CreateGameObject();\n\t\tGameEngine::Instance->AddComponent<SoundEmitterComponent>(id2);\n\t\tComponentHandle<SoundEmitterComponent> se2 = GameEngine::Instance->GetComponent<SoundEmitterComponent>(id2);\n\t\tGameEngine::Instance->GetComponent<SpriteComponent>(id2)->Visible = false;\n\t\tse2->SetSource(\"Confirm1\");\n\t\tse2->PlayOnEvent<UISelectEvent>();\n\t}\n\n\t\/\/ Game will prompt for confirmation of action;\n\tvoid MenuManager::quitRequest(QuitRequestEvent *e)\n\t{\n\t\t\/\/ confirm?\n\t\tUNUSED(e);\n\t}\n\n\t\/\/ Game window will be terminated.\n\tvoid MenuManager::shutdownRequest(ShutdownEvent *e)\n\t{\n\t\tGameEngine::Instance->Shutdown();\n\t\tUNUSED(e);\n\t}\n\n\t\/\/ Start the game\n\tvoid MenuManager::gameStart(GameStartEvent *)\n\t{\n\t\tGlobals::ObjectID id = GameEngine::Instance->GetIdOf(\"player\");\n\t\tGlobals::ObjectID id2 = GameEngine::Instance->GetIdOf(\"mainMenu\");\n\t\tGameEngine::Instance->GetComponent<PlayerManagerComponent>(id)->SetActive(true);\n\t\tGameEngine::Instance->GetComponent<MenuComponent>(id2)->SetActive(false);\n\t\tGameEngine::Instance->GetComponent<MenuComponent>(id2)->SetVisible(false);\n\t\tASSB::Globals::EventSystemInstance.Dispatch(new PauseToggleEvent(false));\n\t\tonMainMenu_ = false;\n\t}\n\n\t\/\/ Catch relevant keyboard input\n\tvoid MenuManager::handleKeyboard(KeyboardEvent *e)\n\t{\n\t\tif (e->Down)\n\t\t{\n\t\t\tif (e->Key == Key::P || e->Key == Key::Escape)\n\t\t\t{\n\t\t\t\tif (!onMainMenu_)\n\t\t\t\t{\n\t\t\t\t\tif (onPauseMenu_)\n\t\t\t\t\t{\n\t\t\t\t\t\tASSB::Globals::EventSystemInstance.Dispatch(new PauseToggleEvent(false));\n\t\t\t\t\t\tonPauseMenu_ = false;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tASSB::Globals::EventSystemInstance.Dispatch(new PauseToggleEvent(true));\n\t\t\t\t\t\tonPauseMenu_ = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\n\t\/\/ Pause was hit on or off\n\tvoid MenuManager::pauseToggle(PauseToggleEvent *e)\n\t{\n\t\tif (onMainMenu_)\n\t\t\treturn;\n\n\t\tGlobals::ObjectID id = GameEngine::Instance->GetIdOf(\"player\");\n\t\tGlobals::ObjectID id2 = GameEngine::Instance->GetIdOf(\"pauseMenu\");\n\t\tif(e->Paused)\n\t\t{\n\t\t\t\/\/ Show menu and stop player\n\t\t\tGameEngine::Instance->GetComponent<PlayerManagerComponent>(id)->SetActive(false);\n\t\t\tComponentHandle<MenuComponent> menuComp = GameEngine::Instance->GetComponent<MenuComponent>(id2);\n\t\t\tmenuComp->SetActive(true);\n\t\t\tmenuComp->SetVisible(true);\n\t\t\tmenuComp->SetPosition(GameEngine::Instance->Camera.GetPosition());\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ enable player and hide menu\n\t\t\tGameEngine::Instance->GetComponent<PlayerManagerComponent>(id)->SetActive(true);\n\t\t\tGameEngine::Instance->GetComponent<MenuComponent>(id2)->SetActive(false);\n\t\t\tGameEngine::Instance->GetComponent<MenuComponent>(id2)->SetVisible(false);\n\t\t}\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  File: DKEventLoop.cpp\n\/\/  Author: Hongtae Kim (tiff2766@gmail.com)\n\/\/\n\/\/  Copyright (c) 2004-2016 Hongtae Kim. All rights reserved.\n\/\/\n\n#include \"DKObject.h\"\n#include \"DKEventLoop.h\"\n#include \"DKMap.h\"\n#include \"DKArray.h\"\n#include \"DKSpinLock.h\"\n#include \"DKFunction.h\"\n#include \"DKLog.h\"\n#include \"DKCondition.h\"\n\nnamespace DKFoundation\n{\n\tnamespace Private\n\t{\n#if defined(__APPLE__) && defined(__MACH__)\n\t\tvoid PerformOperationInsidePool(DKOperation* op);\n#else\n\t\tFORCEINLINE void PerformOperationInsidePool(DKOperation* op) { op->Perform(); }\n#endif\n\n\t\ttypedef DKMap<DKThread::ThreadId, DKObject<DKEventLoop>, DKDummyLock> EventLoopMap;\n\t\tstatic EventLoopMap& GetEventLoopMap()\n\t\t{\n\t\t\tstatic EventLoopMap eventLoopMap;\n\t\t\treturn eventLoopMap;\n\t\t}\n\t\tstatic DKSpinLock& GetEventLoopMapLock()\n\t\t{\n\t\t\tstatic DKSpinLock lock;\n\t\t\treturn lock;\n\t\t}\n\t\tstatic bool RegisterEventLoop(DKThread::ThreadId id, DKEventLoop* eventLoop)\n\t\t{\n\t\t\tbool ret = false;\n\t\t\tGetEventLoopMapLock().Lock();\n\t\t\tret = GetEventLoopMap().Insert(id, eventLoop);\n\t\t\tGetEventLoopMapLock().Unlock();\n\t\t\treturn ret;\n\t\t}\n\t\tstatic void UnregisterEventLoop(DKThread::ThreadId id)\n\t\t{\n\t\t\tGetEventLoopMapLock().Lock();\n\t\t\tGetEventLoopMap().Remove(id);\n\t\t\tGetEventLoopMapLock().Unlock();\n\t\t}\n\t\tstatic DKObject<DKEventLoop> GetEventLoop(DKThread::ThreadId id)\n\t\t{\n\t\t\tDKObject<DKEventLoop> ret = NULL;\n\t\t\tGetEventLoopMapLock().Lock();\n\t\t\tEventLoopMap::Pair* p = GetEventLoopMap().Find(id);\n\t\t\tif (p)\n\t\t\t\tret = p->value;\n\t\t\tGetEventLoopMapLock().Unlock();\n\t\t\treturn ret;\n\t\t}\n\t\tstatic bool IsEventLoopExist(const DKEventLoop* eventLoop)\n\t\t{\n\t\t\tbool found = false;\n\t\t\tGetEventLoopMapLock().Lock();\n\t\t\tGetEventLoopMap().EnumerateForward([&](EventLoopMap::Pair& pair, bool* stop)\n\t\t\t{\n\t\t\t\tif (pair.value == eventLoop)\n\t\t\t\t{\n\t\t\t\t\t*stop = true;\n\t\t\t\t\tfound = true;\n\t\t\t\t}\n\t\t\t});\n\t\t\tGetEventLoopMapLock().Unlock();\n\t\t\treturn found;\n\t\t}\n\n\t\tstatic DKCondition resultCond;\n\t\tstruct EventLoopPendingState : public DKEventLoop::PendingState\n\t\t{\n\t\t\tenum State\n\t\t\t{\n\t\t\t\tStatePending,\n\t\t\t\tStateProcessing,\n\t\t\t\tStateProcessed,\n\t\t\t\tStateRevoked,\n\t\t\t};\n\t\t\tmutable State state;\n\n\t\t\tEventLoopPendingState() : state(StatePending)\n\t\t\t{\n\t\t\t}\n\t\t\tbool EnterOperation() const\n\t\t\t{\n\t\t\t\tDKCriticalSection<DKCondition> guard(resultCond);\n\t\t\t\tif (state == StatePending)\n\t\t\t\t{\n\t\t\t\t\tstate = StateProcessing;\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tvoid LeaveOperation() const\n\t\t\t{\n\t\t\t\tDKCriticalSection<DKCondition> guard(resultCond);\n\t\t\t\tDKASSERT(state == StateProcessing);\n\t\t\t\tstate = StateProcessed;\n\t\t\t\tresultCond.Broadcast();\n\t\t\t}\n\t\t\tbool Revoke() const override\n\t\t\t{\n\t\t\t\tDKCriticalSection<DKCondition> guard(resultCond);\n\t\t\t\tif (state == StatePending)\n\t\t\t\t{\n\t\t\t\t\tstate = StateRevoked;\n\t\t\t\t\tresultCond.Broadcast();\n\t\t\t\t}\n\t\t\t\treturn state == StateRevoked;\n\t\t\t}\n\t\t\tbool Result() const override\n\t\t\t{\n\t\t\t\tDKCriticalSection<DKCondition> guard(resultCond);\n\t\t\t\twhile (state != StateProcessed && state != StateRevoked)\n\t\t\t\t\tresultCond.Wait();\n\n\t\t\t\treturn state == StateProcessed;\n\t\t\t}\n\t\t\tbool IsDone() const override\n\t\t\t{\n\t\t\t\tDKCriticalSection<DKCondition> guard(resultCond);\n\t\t\t\treturn state == StateProcessed;\n\t\t\t}\n\t\t\tbool IsRevoked() const override\n\t\t\t{\n\t\t\t\tDKCriticalSection<DKCondition> guard(resultCond);\n\t\t\t\treturn state == StateRevoked;\n\t\t\t}\n\t\t\tbool IsPending() const override\n\t\t\t{\n\t\t\t\tDKCriticalSection<DKCondition> guard(resultCond);\n\t\t\t\treturn state == StatePending;\n\t\t\t}\n\t\t};\n\t}\n}\n\nusing namespace DKFoundation;\nusing namespace DKFoundation::Private;\n\nbool DKEventLoop::InternalCommandCompareOrder(const InternalCommandTick& lhs, const InternalCommandTick& rhs)\n{\n\treturn lhs.fire < rhs.fire;\n}\n\nbool DKEventLoop::InternalCommandCompareOrder(const InternalCommandTime& lhs, const InternalCommandTime& rhs)\n{\n\treturn lhs.fire < rhs.fire;\n}\n\nDKEventLoop::DKEventLoop()\n: running(false)\n, threadId(DKThread::invalidId)\n, commandQueueTick(&DKEventLoop::InternalCommandCompareOrder)\n, commandQueueTime(&DKEventLoop::InternalCommandCompareOrder)\n{\n}\n\nDKEventLoop::~DKEventLoop()\n{\n\tif (threadId != DKThread::invalidId)\n\t{\n\t\tDKERROR_THROW_DEBUG(\"EventLoop must be terminated before destroy!\");\n\t}\n\n\tRevokeAll();\n}\n\nbool DKEventLoop::Run()\n{\n\tif (BindThread())\n\t{\n\t\tbool loop = true;\n\t\tbool next = true;\n\t\twhile (loop)\n\t\t{\n\t\t\tnext = this->Dispatch();\n\t\t\tloop = this->running;\n\t\t\tif (!next && loop)\n\t\t\t\tOnIdle();\n\t\t}\n\t\tUnbindThread();\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nbool DKEventLoop::IsRunning() const\n{\n\tif (threadId != DKThread::invalidId)\n\t{\n\t\tDKASSERT_DEBUG(IsEventLoopExist(this));\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid DKEventLoop::InternalPostCommand(const InternalCommandTick& cmd)\n{\n\tDKCriticalSection<DKCondition> guard(commandQueueCond);\n\tcommandQueueTick.Insert(cmd);\n\tcommandQueueCond.Signal();\n}\n\nvoid DKEventLoop::InternalPostCommand(const InternalCommandTime& cmd)\n{\n\tDKCriticalSection<DKCondition> guard(commandQueueCond);\n\tcommandQueueTime.Insert(cmd);\n\tcommandQueueCond.Signal();\n}\n\nbool DKEventLoop::BindThread()\n{\n\tif (this->threadId == DKThread::invalidId)\n\t{\n\t\tDKASSERT_DEBUG(IsEventLoopExist(this) == false);\n\t\tDKThread::ThreadId tid = DKThread::CurrentThreadId();\n\t\tif (RegisterEventLoop(tid, this))\n\t\t{\n\t\t\tthis->threadId = tid;\n\t\t\trunning = true;\n\t\t\treturn true;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tDKLog(\"BindThread failed!\\n\");\n\t\t}\n\t}\n\treturn false;\n}\n\nvoid DKEventLoop::UnbindThread()\n{\n\tDKASSERT_DEBUG(IsEventLoopExist(this));\n\tDKASSERT_DEBUG(threadId != DKThread::invalidId);\n\tDKASSERT_DEBUG(GetEventLoop(threadId) == this);\n\tUnregisterEventLoop(this->threadId);\n\tthreadId = DKThread::invalidId;\n}\n\nvoid DKEventLoop::Stop()\n{\n\tif (IsRunning())\n\t{\n\t\tthis->Post(DKFunction([this]() {\n\t\t\tthis->running = false;\n\t\t})->Invocation());\n\t}\n}\n\nDKObject<DKEventLoop::PendingState> DKEventLoop::Post(const DKOperation* operation, double delay)\n{\n\tif (operation)\n\t{\n\t\tInternalCommandTick cmd;\n\t\tcmd.operation = const_cast<DKOperation*>(operation);\n\t\tcmd.state = DKOBJECT_NEW EventLoopPendingState();\n\t\tcmd.fire = DKTimer::SystemTick() + static_cast<DKTimer::Tick>(DKTimer::SystemTickFrequency() * Max(delay, 0.0));\n\t\tInternalPostCommand(cmd);\n\n\t\treturn cmd.state;\n\t}\n\telse\n\t{\n\t\t\/\/ Just wake up the dispatch thread\n\t\tDKCriticalSection<DKCondition> guard(commandQueueCond);\n\t\tcommandQueueCond.Signal();\n\t}\n\treturn NULL;\n}\n\nDKObject<DKEventLoop::PendingState> DKEventLoop::Post(const DKOperation* operation, const DKDateTime& runAfter)\n{\n\tif (operation)\n\t{\n\t\tInternalCommandTime cmd;\n\t\tcmd.operation = const_cast<DKOperation*>(operation);\n\t\tcmd.state = DKOBJECT_NEW EventLoopPendingState();\n\t\tcmd.fire = runAfter;\n\t\tInternalPostCommand(cmd);\n\n\t\treturn cmd.state;\n\t}\n\telse\n\t{\n\t\t\/\/ Just wake up the dispatch thread\n\t\tDKCriticalSection<DKCondition> guard(commandQueueCond);\n\t\tcommandQueueCond.Signal();\n\t}\n\treturn NULL;\n}\n\nbool DKEventLoop::Process(const DKOperation* op)\n{\n\tif (op)\n\t{\n\t\tif (this->IsWrokingThread())\n\t\t{\n\t\t\top->Perform();\n\t\t\treturn true;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tauto p = this->Post(op);\n\t\t\tif (p)\n\t\t\t\treturn p->Result();\n\t\t}\n\t}\n\treturn false;\n}\n\nsize_t DKEventLoop::RevokeAll()\n{\n\tDKCriticalSection<DKCondition> guard(this->commandQueueCond);\n\n\t\/\/DKTimer::Tick tick = DKTimer::SystemTick();\n\n\tsize_t numItems = this->commandQueueTick.Count() + this->commandQueueTime.Count();\n\n\tauto revoke = [](const InternalCommand& ic)\n\t{\n\t\tconst EventLoopPendingState* state = ic.state.StaticCast<EventLoopPendingState>();\n\t\tif (state)\n\t\t\tstate->Revoke();\n\t};\n\n\tfor (const InternalCommand& ic : this->commandQueueTick)\n\t\trevoke(ic);\n\tfor (const InternalCommand& ic : this->commandQueueTime)\n\t\trevoke(ic);\n\n\tthis->commandQueueTick.Clear();\n\tthis->commandQueueTime.Clear();\n\treturn numItems;\n}\n\nbool DKEventLoop::GetNextLoopIntervalNL(double* d) const\n{\n\tDKTimer::Tick currentTick = DKTimer::SystemTick();\n\tDKDateTime currentDate = DKDateTime::Now();\n\n\tsize_t numTickCmd = 0;\n\tsize_t numTimeCmd = 0;\n\tdouble tickDelay = 0;\n\tdouble timeDelay = 0;\n\n\tnumTickCmd = commandQueueTick.Count();\n\tnumTimeCmd = commandQueueTime.Count();\n\n\tdouble freq = 1.0 \/ static_cast<double>(DKTimer::SystemTickFrequency());\n\tif (numTickCmd > 0)\n\t{\n\t\tconst InternalCommandTick& cmd = commandQueueTick.Value(0);\n\t\tif (cmd.fire > currentTick && freq > 0)\n\t\t\ttickDelay = static_cast<double>(cmd.fire - currentTick) * freq;\n\t}\n\tif (numTimeCmd > 0)\n\t{\n\t\tconst InternalCommandTime& cmd = commandQueueTime.Value(0);\n\t\tif (cmd.fire > currentDate)\n\t\t\ttimeDelay = cmd.fire.Interval(currentDate);\n\t}\n\n\tif (numTickCmd > 0 || numTimeCmd > 0)\n\t{\n\t\tdouble delay = 0;\n\n\t\tif (numTickCmd > 0 && numTimeCmd > 0)\n\t\t\tdelay = Min(tickDelay, timeDelay);\n\t\telse if (numTickCmd > 0)\n\t\t\tdelay = tickDelay;\n\t\telse\n\t\t\tdelay = timeDelay;\n\n\t\t*d = delay;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid DKEventLoop::WaitNextLoop()\n{\n\tDKCriticalSection<DKCondition> guard(this->commandQueueCond);\n\n\tdouble d = 0.0;\n\tif (GetNextLoopIntervalNL(&d))\n\t{\n\t\td = Max(d, 0.0);\n\t\tif (d > 0.0)\n\t\t\tthis->commandQueueCond.WaitTimeout(d);\n\t}\n\telse\n\t{\n\t\tthis->commandQueueCond.Wait();\n\t}\n}\n\nbool DKEventLoop::WaitNextLoopTimeout(double t)\n{\n\tif (t > 0.0)\n\t{\n\t\tDKCriticalSection<DKCondition> guard(this->commandQueueCond);\n\n\t\tdouble d = 0.0;\n\t\tif (GetNextLoopIntervalNL(&d))\n\t\t{\n\t\t\tdouble delay = Clamp(d, 0.0, t);\n\t\t\tif (delay > 0.0)\n\t\t\t{\n\t\t\t\tthis->commandQueueCond.WaitTimeout(delay);\n\t\t\t}\n\t\t\treturn delay < t;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthis->commandQueueCond.WaitTimeout(t);\n\t\t}\n\t}\n\treturn false;\n}\n\ndouble DKEventLoop::PendingEventInterval() const\n{\n\tDKCriticalSection<DKCondition> guard(this->commandQueueCond);\n\n\tdouble d = 0.0;\n\tif (GetNextLoopIntervalNL(&d))\n\t{\n\t\treturn Max(d, 0.0);\n\t}\n\treturn -1.0;\n}\n\nvoid DKEventLoop::PerformOperation(const DKOperation* operation)\n{\n\toperation->Perform();\n}\n\nbool DKEventLoop::Dispatch()\n{\n\tDKASSERT_DEBUG(this->threadId == DKThread::CurrentThreadId());\n\n\tDKObject<DKOperation> operation = NULL;\n\tDKObject<PendingState> state = NULL;\n\n\tcommandQueueCond.Lock();\n\n\tDKDateTime currentTime = DKDateTime::Now();\n\tDKTimer::Tick currentTick = DKTimer::SystemTick();\n\n\tif (operation == NULL && this->commandQueueTick.Count() > 0)\n\t{\n\t\tconst InternalCommandTick& cmd = this->commandQueueTick.Value(0);\n\t\tif (cmd.fire <= currentTick)\n\t\t{\n\t\t\toperation = cmd.operation;\n\t\t\tstate = cmd.state;\n\t\t\tthis->commandQueueTick.Remove(0);\n\t\t}\n\t}\n\tif (operation == NULL && this->commandQueueTime.Count() > 0)\n\t{\n\t\tconst InternalCommandTime& cmd = this->commandQueueTime.Value(0);\n\t\tif (cmd.fire <= currentTime)\n\t\t{\n\t\t\toperation = cmd.operation;\n\t\t\tstate = cmd.state;\n\t\t\tthis->commandQueueTime.Remove(0);\n\t\t}\n\t}\n\tcommandQueueCond.Unlock();\n\n\tif (operation)\n\t{\n\t\tstruct OpWrapper : public DKOperation\n\t\t{\n\t\t\tOpWrapper(DKEventLoop* e, DKOperation* o) : el(e), op(o) {}\n\t\t\tDKEventLoop* el;\n\t\t\tDKOperation* op;\n\n\t\t\tvoid Perform() const override\n\t\t\t{\n\t\t\t\tel->PerformOperation(op);\n\t\t\t}\n\t\t};\n\t\tOpWrapper op(this, operation);\n\t\tEventLoopPendingState* stateCallback = state.StaticCast<EventLoopPendingState>();\n\t\tif (stateCallback)\n\t\t{\n\t\t\tif (stateCallback->EnterOperation())\n\t\t\t{\n\t\t\t\tPrivate::PerformOperationInsidePool(&op);\n\t\t\t\tstateCallback->LeaveOperation();\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tPrivate::PerformOperationInsidePool(&op);\n\t\t}\n\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nbool DKEventLoop::IsWrokingThread() const\n{\n\treturn DKThread::CurrentThreadId() == this->threadId;\n}\n\nDKThread::ThreadId DKEventLoop::RunningThreadId() const\n{\n\treturn this->threadId;\n}\n\nDKObject<DKEventLoop> DKEventLoop::CurrentEventLoop()\n{\n\treturn GetEventLoop(DKThread::CurrentThreadId());\n}\n\nDKObject<DKEventLoop> DKEventLoop::EventLoopForThreadId(DKThread::ThreadId id)\n{\n\treturn GetEventLoop(id);\n}\n\nbool DKEventLoop::IsRunning(DKEventLoop* eventLoop)\n{\n\treturn IsEventLoopExist(eventLoop);\n}\n<commit_msg>no message<commit_after>\/\/\n\/\/  File: DKEventLoop.cpp\n\/\/  Author: Hongtae Kim (tiff2766@gmail.com)\n\/\/\n\/\/  Copyright (c) 2004-2016 Hongtae Kim. All rights reserved.\n\/\/\n\n#include \"DKObject.h\"\n#include \"DKEventLoop.h\"\n#include \"DKMap.h\"\n#include \"DKArray.h\"\n#include \"DKSpinLock.h\"\n#include \"DKFunction.h\"\n#include \"DKLog.h\"\n#include \"DKCondition.h\"\n\nnamespace DKFoundation\n{\n\tnamespace Private\n\t{\n#if defined(__APPLE__) && defined(__MACH__)\n\t\tvoid PerformOperationInsidePool(DKOperation* op);\n#else\n\t\tFORCEINLINE void PerformOperationInsidePool(DKOperation* op) { op->Perform(); }\n#endif\n\n\t\ttypedef DKMap<DKThread::ThreadId, DKObject<DKEventLoop>, DKDummyLock> EventLoopMap;\n\t\tstatic EventLoopMap& GetEventLoopMap()\n\t\t{\n\t\t\tstatic EventLoopMap eventLoopMap;\n\t\t\treturn eventLoopMap;\n\t\t}\n\t\tstatic DKSpinLock& GetEventLoopMapLock()\n\t\t{\n\t\t\tstatic DKSpinLock lock;\n\t\t\treturn lock;\n\t\t}\n\t\tstatic bool RegisterEventLoop(DKThread::ThreadId id, DKEventLoop* eventLoop)\n\t\t{\n\t\t\tbool ret = false;\n\t\t\tGetEventLoopMapLock().Lock();\n\t\t\tret = GetEventLoopMap().Insert(id, eventLoop);\n\t\t\tGetEventLoopMapLock().Unlock();\n\t\t\treturn ret;\n\t\t}\n\t\tstatic void UnregisterEventLoop(DKThread::ThreadId id)\n\t\t{\n\t\t\tGetEventLoopMapLock().Lock();\n\t\t\tGetEventLoopMap().Remove(id);\n\t\t\tGetEventLoopMapLock().Unlock();\n\t\t}\n\t\tstatic DKObject<DKEventLoop> GetEventLoop(DKThread::ThreadId id)\n\t\t{\n\t\t\tDKObject<DKEventLoop> ret = NULL;\n\t\t\tGetEventLoopMapLock().Lock();\n\t\t\tEventLoopMap::Pair* p = GetEventLoopMap().Find(id);\n\t\t\tif (p)\n\t\t\t\tret = p->value;\n\t\t\tGetEventLoopMapLock().Unlock();\n\t\t\treturn ret;\n\t\t}\n\t\tstatic bool IsEventLoopExist(const DKEventLoop* eventLoop)\n\t\t{\n\t\t\tbool found = false;\n\t\t\tGetEventLoopMapLock().Lock();\n\t\t\tGetEventLoopMap().EnumerateForward([&](EventLoopMap::Pair& pair, bool* stop)\n\t\t\t{\n\t\t\t\tif (pair.value == eventLoop)\n\t\t\t\t{\n\t\t\t\t\t*stop = true;\n\t\t\t\t\tfound = true;\n\t\t\t\t}\n\t\t\t});\n\t\t\tGetEventLoopMapLock().Unlock();\n\t\t\treturn found;\n\t\t}\n\n\t\tstatic DKCondition resultCond;\n\t\tstruct EventLoopPendingState : public DKEventLoop::PendingState\n\t\t{\n\t\t\tenum State\n\t\t\t{\n\t\t\t\tStatePending,\n\t\t\t\tStateProcessing,\n\t\t\t\tStateProcessed,\n\t\t\t\tStateRevoked,\n\t\t\t};\n\t\t\tmutable State state;\n\n\t\t\tEventLoopPendingState() : state(StatePending)\n\t\t\t{\n\t\t\t}\n\t\t\tbool EnterOperation() const\n\t\t\t{\n\t\t\t\tDKCriticalSection<DKCondition> guard(resultCond);\n\t\t\t\tif (state == StatePending)\n\t\t\t\t{\n\t\t\t\t\tstate = StateProcessing;\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tvoid LeaveOperation() const\n\t\t\t{\n\t\t\t\tDKCriticalSection<DKCondition> guard(resultCond);\n\t\t\t\tDKASSERT(state == StateProcessing);\n\t\t\t\tstate = StateProcessed;\n\t\t\t\tresultCond.Broadcast();\n\t\t\t}\n\t\t\tbool Revoke() const override\n\t\t\t{\n\t\t\t\tDKCriticalSection<DKCondition> guard(resultCond);\n\t\t\t\tif (state == StatePending)\n\t\t\t\t{\n\t\t\t\t\tstate = StateRevoked;\n\t\t\t\t\tresultCond.Broadcast();\n\t\t\t\t}\n\t\t\t\treturn state == StateRevoked;\n\t\t\t}\n\t\t\tbool Result() const override\n\t\t\t{\n\t\t\t\tDKCriticalSection<DKCondition> guard(resultCond);\n\t\t\t\twhile (state != StateProcessed && state != StateRevoked)\n\t\t\t\t\tresultCond.Wait();\n\n\t\t\t\treturn state == StateProcessed;\n\t\t\t}\n\t\t\tbool IsDone() const override\n\t\t\t{\n\t\t\t\tDKCriticalSection<DKCondition> guard(resultCond);\n\t\t\t\treturn state == StateProcessed;\n\t\t\t}\n\t\t\tbool IsRevoked() const override\n\t\t\t{\n\t\t\t\tDKCriticalSection<DKCondition> guard(resultCond);\n\t\t\t\treturn state == StateRevoked;\n\t\t\t}\n\t\t\tbool IsPending() const override\n\t\t\t{\n\t\t\t\tDKCriticalSection<DKCondition> guard(resultCond);\n\t\t\t\treturn state == StatePending;\n\t\t\t}\n\t\t};\n\t}\n}\n\nusing namespace DKFoundation;\nusing namespace DKFoundation::Private;\n\nbool DKEventLoop::InternalCommandCompareOrder(const InternalCommandTick& lhs, const InternalCommandTick& rhs)\n{\n\treturn lhs.fire < rhs.fire;\n}\n\nbool DKEventLoop::InternalCommandCompareOrder(const InternalCommandTime& lhs, const InternalCommandTime& rhs)\n{\n\treturn lhs.fire < rhs.fire;\n}\n\nDKEventLoop::DKEventLoop()\n: running(false)\n, threadId(DKThread::invalidId)\n, commandQueueTick(&DKEventLoop::InternalCommandCompareOrder)\n, commandQueueTime(&DKEventLoop::InternalCommandCompareOrder)\n{\n}\n\nDKEventLoop::~DKEventLoop()\n{\n\tif (threadId != DKThread::invalidId)\n\t{\n\t\tDKERROR_THROW_DEBUG(\"EventLoop must be terminated before destroy!\");\n\t}\n\n\tRevokeAll();\n}\n\nbool DKEventLoop::Run()\n{\n\tif (BindThread())\n\t{\n\t\tbool loop = true;\n\t\tbool next = true;\n\t\twhile (loop)\n\t\t{\n\t\t\tnext = this->Dispatch();\n\t\t\tloop = this->running;\n\t\t\tif (!next && loop)\n\t\t\t\tOnIdle();\n\t\t}\n\t\tUnbindThread();\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nbool DKEventLoop::IsRunning() const\n{\n\tif (threadId != DKThread::invalidId)\n\t{\n\t\tDKASSERT_DEBUG(IsEventLoopExist(this));\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid DKEventLoop::InternalPostCommand(const InternalCommandTick& cmd)\n{\n\tDKCriticalSection<DKCondition> guard(commandQueueCond);\n\tcommandQueueTick.Insert(cmd);\n\tcommandQueueCond.Signal();\n}\n\nvoid DKEventLoop::InternalPostCommand(const InternalCommandTime& cmd)\n{\n\tDKCriticalSection<DKCondition> guard(commandQueueCond);\n\tcommandQueueTime.Insert(cmd);\n\tcommandQueueCond.Signal();\n}\n\nbool DKEventLoop::BindThread()\n{\n\tif (this->threadId == DKThread::invalidId)\n\t{\n\t\tDKASSERT_DEBUG(IsEventLoopExist(this) == false);\n\t\tDKThread::ThreadId tid = DKThread::CurrentThreadId();\n\t\tif (RegisterEventLoop(tid, this))\n\t\t{\n\t\t\tthis->threadId = tid;\n\t\t\trunning = true;\n\t\t\treturn true;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tDKLog(\"BindThread failed!\\n\");\n\t\t}\n\t}\n\treturn false;\n}\n\nvoid DKEventLoop::UnbindThread()\n{\n\tDKASSERT_DEBUG(IsEventLoopExist(this));\n\tDKASSERT_DEBUG(threadId != DKThread::invalidId);\n\tDKASSERT_DEBUG(GetEventLoop(threadId) == this);\n\tUnregisterEventLoop(this->threadId);\n\tthreadId = DKThread::invalidId;\n}\n\nvoid DKEventLoop::Stop()\n{\n\tif (IsRunning())\n\t{\n\t\tthis->Post(DKFunction([this]() {\n\t\t\tthis->running = false;\n\t\t})->Invocation());\n\t}\n}\n\nDKObject<DKEventLoop::PendingState> DKEventLoop::Post(const DKOperation* operation, double delay)\n{\n\tif (operation)\n\t{\n\t\tInternalCommandTick cmd;\n\t\tcmd.operation = const_cast<DKOperation*>(operation);\n\t\tcmd.state = DKOBJECT_NEW EventLoopPendingState();\n\t\tcmd.fire = DKTimer::SystemTick() + static_cast<DKTimer::Tick>(DKTimer::SystemTickFrequency() * Max(delay, 0.0));\n\t\tInternalPostCommand(cmd);\n\n\t\treturn cmd.state;\n\t}\n\telse\n\t{\n\t\t\/\/ Just wake up the dispatch thread\n\t\tDKCriticalSection<DKCondition> guard(commandQueueCond);\n\t\tcommandQueueCond.Signal();\n\t}\n\treturn NULL;\n}\n\nDKObject<DKEventLoop::PendingState> DKEventLoop::Post(const DKOperation* operation, const DKDateTime& runAfter)\n{\n\tif (operation)\n\t{\n\t\tInternalCommandTime cmd;\n\t\tcmd.operation = const_cast<DKOperation*>(operation);\n\t\tcmd.state = DKOBJECT_NEW EventLoopPendingState();\n\t\tcmd.fire = runAfter;\n\t\tInternalPostCommand(cmd);\n\n\t\treturn cmd.state;\n\t}\n\telse\n\t{\n\t\t\/\/ Just wake up the dispatch thread\n\t\tDKCriticalSection<DKCondition> guard(commandQueueCond);\n\t\tcommandQueueCond.Signal();\n\t}\n\treturn NULL;\n}\n\nbool DKEventLoop::Process(const DKOperation* op)\n{\n\tif (op)\n\t{\n\t\tif (this->IsWrokingThread())\n\t\t{\n            this->PerformOperation(op);\n\t\t\treturn true;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tauto p = this->Post(op);\n\t\t\tif (p)\n\t\t\t\treturn p->Result();\n\t\t}\n\t}\n\treturn false;\n}\n\nsize_t DKEventLoop::RevokeAll()\n{\n\tDKCriticalSection<DKCondition> guard(this->commandQueueCond);\n\n\t\/\/DKTimer::Tick tick = DKTimer::SystemTick();\n\n\tsize_t numItems = this->commandQueueTick.Count() + this->commandQueueTime.Count();\n\n\tauto revoke = [](const InternalCommand& ic)\n\t{\n\t\tconst EventLoopPendingState* state = ic.state.StaticCast<EventLoopPendingState>();\n\t\tif (state)\n\t\t\tstate->Revoke();\n\t};\n\n\tfor (const InternalCommand& ic : this->commandQueueTick)\n\t\trevoke(ic);\n\tfor (const InternalCommand& ic : this->commandQueueTime)\n\t\trevoke(ic);\n\n\tthis->commandQueueTick.Clear();\n\tthis->commandQueueTime.Clear();\n\treturn numItems;\n}\n\nbool DKEventLoop::GetNextLoopIntervalNL(double* d) const\n{\n\tDKTimer::Tick currentTick = DKTimer::SystemTick();\n\tDKDateTime currentDate = DKDateTime::Now();\n\n\tsize_t numTickCmd = 0;\n\tsize_t numTimeCmd = 0;\n\tdouble tickDelay = 0;\n\tdouble timeDelay = 0;\n\n\tnumTickCmd = commandQueueTick.Count();\n\tnumTimeCmd = commandQueueTime.Count();\n\n\tdouble freq = 1.0 \/ static_cast<double>(DKTimer::SystemTickFrequency());\n\tif (numTickCmd > 0)\n\t{\n\t\tconst InternalCommandTick& cmd = commandQueueTick.Value(0);\n\t\tif (cmd.fire > currentTick && freq > 0)\n\t\t\ttickDelay = static_cast<double>(cmd.fire - currentTick) * freq;\n\t}\n\tif (numTimeCmd > 0)\n\t{\n\t\tconst InternalCommandTime& cmd = commandQueueTime.Value(0);\n\t\tif (cmd.fire > currentDate)\n\t\t\ttimeDelay = cmd.fire.Interval(currentDate);\n\t}\n\n\tif (numTickCmd > 0 || numTimeCmd > 0)\n\t{\n\t\tdouble delay = 0;\n\n\t\tif (numTickCmd > 0 && numTimeCmd > 0)\n\t\t\tdelay = Min(tickDelay, timeDelay);\n\t\telse if (numTickCmd > 0)\n\t\t\tdelay = tickDelay;\n\t\telse\n\t\t\tdelay = timeDelay;\n\n\t\t*d = delay;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid DKEventLoop::WaitNextLoop()\n{\n\tDKCriticalSection<DKCondition> guard(this->commandQueueCond);\n\n\tdouble d = 0.0;\n\tif (GetNextLoopIntervalNL(&d))\n\t{\n\t\td = Max(d, 0.0);\n\t\tif (d > 0.0)\n\t\t\tthis->commandQueueCond.WaitTimeout(d);\n\t}\n\telse\n\t{\n\t\tthis->commandQueueCond.Wait();\n\t}\n}\n\nbool DKEventLoop::WaitNextLoopTimeout(double t)\n{\n\tif (t > 0.0)\n\t{\n\t\tDKCriticalSection<DKCondition> guard(this->commandQueueCond);\n\n\t\tdouble d = 0.0;\n\t\tif (GetNextLoopIntervalNL(&d))\n\t\t{\n\t\t\tdouble delay = Clamp(d, 0.0, t);\n\t\t\tif (delay > 0.0)\n\t\t\t{\n\t\t\t\tthis->commandQueueCond.WaitTimeout(delay);\n\t\t\t}\n\t\t\treturn delay < t;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthis->commandQueueCond.WaitTimeout(t);\n\t\t}\n\t}\n\treturn false;\n}\n\ndouble DKEventLoop::PendingEventInterval() const\n{\n\tDKCriticalSection<DKCondition> guard(this->commandQueueCond);\n\n\tdouble d = 0.0;\n\tif (GetNextLoopIntervalNL(&d))\n\t{\n\t\treturn Max(d, 0.0);\n\t}\n\treturn -1.0;\n}\n\nvoid DKEventLoop::PerformOperation(const DKOperation* operation)\n{\n\toperation->Perform();\n}\n\nbool DKEventLoop::Dispatch()\n{\n\tDKASSERT_DEBUG(this->threadId == DKThread::CurrentThreadId());\n\n\tDKObject<DKOperation> operation = NULL;\n\tDKObject<PendingState> state = NULL;\n\n\tcommandQueueCond.Lock();\n\n\tDKDateTime currentTime = DKDateTime::Now();\n\tDKTimer::Tick currentTick = DKTimer::SystemTick();\n\n\tif (operation == NULL && this->commandQueueTick.Count() > 0)\n\t{\n\t\tconst InternalCommandTick& cmd = this->commandQueueTick.Value(0);\n\t\tif (cmd.fire <= currentTick)\n\t\t{\n\t\t\toperation = cmd.operation;\n\t\t\tstate = cmd.state;\n\t\t\tthis->commandQueueTick.Remove(0);\n\t\t}\n\t}\n\tif (operation == NULL && this->commandQueueTime.Count() > 0)\n\t{\n\t\tconst InternalCommandTime& cmd = this->commandQueueTime.Value(0);\n\t\tif (cmd.fire <= currentTime)\n\t\t{\n\t\t\toperation = cmd.operation;\n\t\t\tstate = cmd.state;\n\t\t\tthis->commandQueueTime.Remove(0);\n\t\t}\n\t}\n\tcommandQueueCond.Unlock();\n\n\tif (operation)\n\t{\n\t\tstruct OpWrapper : public DKOperation\n\t\t{\n\t\t\tOpWrapper(DKEventLoop* e, DKOperation* o) : el(e), op(o) {}\n\t\t\tDKEventLoop* el;\n\t\t\tDKOperation* op;\n\n\t\t\tvoid Perform() const override\n\t\t\t{\n\t\t\t\tel->PerformOperation(op);\n\t\t\t}\n\t\t};\n\t\tOpWrapper op(this, operation);\n\t\tEventLoopPendingState* stateCallback = state.StaticCast<EventLoopPendingState>();\n\t\tif (stateCallback)\n\t\t{\n\t\t\tif (stateCallback->EnterOperation())\n\t\t\t{\n\t\t\t\tPrivate::PerformOperationInsidePool(&op);\n\t\t\t\tstateCallback->LeaveOperation();\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tPrivate::PerformOperationInsidePool(&op);\n\t\t}\n\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nbool DKEventLoop::IsWrokingThread() const\n{\n\treturn DKThread::CurrentThreadId() == this->threadId;\n}\n\nDKThread::ThreadId DKEventLoop::RunningThreadId() const\n{\n\treturn this->threadId;\n}\n\nDKObject<DKEventLoop> DKEventLoop::CurrentEventLoop()\n{\n\treturn GetEventLoop(DKThread::CurrentThreadId());\n}\n\nDKObject<DKEventLoop> DKEventLoop::EventLoopForThreadId(DKThread::ThreadId id)\n{\n\treturn GetEventLoop(id);\n}\n\nbool DKEventLoop::IsRunning(DKEventLoop* eventLoop)\n{\n\treturn IsEventLoopExist(eventLoop);\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\/file_path.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/browser_process.h\"\n#include \"chrome\/browser\/extensions\/extension_browsertest.h\"\n#include \"chrome\/browser\/extensions\/extension_service.h\"\n#include \"chrome\/browser\/first_run\/first_run.h\"\n#include \"chrome\/browser\/prefs\/pref_service.h\"\n#include \"chrome\/browser\/prefs\/session_startup_pref.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/browser\/ui\/browser_init.h\"\n#include \"chrome\/browser\/ui\/browser_list.h\"\n#include \"chrome\/browser\/ui\/browser_window.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"chrome\/test\/base\/in_process_browser_test.h\"\n#include \"chrome\/test\/base\/ui_test_utils.h\"\n#include \"content\/browser\/tab_contents\/tab_contents.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nclass BrowserInitTest : public ExtensionBrowserTest {\n protected:\n  virtual void SetUpCommandLine(CommandLine* command_line) {\n    ExtensionBrowserTest::SetUpCommandLine(command_line);\n    command_line->AppendSwitch(switches::kEnablePanels);\n  }\n\n  \/\/ Helper functions return void so that we can ASSERT*().\n  \/\/ Use ASSERT_NO_FATAL_FAILURE around calls to these functions to stop the\n  \/\/ test if an assert fails.\n  void LoadApp(const std::string& app_name,\n               const Extension** out_app_extension) {\n    ASSERT_TRUE(LoadExtension(test_data_dir_.AppendASCII(app_name.c_str())));\n\n    ExtensionService* service = browser()->profile()->GetExtensionService();\n    *out_app_extension = service->GetExtensionById(\n        last_loaded_extension_id_, false);\n    ASSERT_TRUE(*out_app_extension);\n\n    \/\/ Code that opens a new browser assumes we start with exactly one.\n    ASSERT_EQ(1u, BrowserList::GetBrowserCount(browser()->profile()));\n  }\n\n  void SetAppLaunchPref(const std::string& app_id,\n                        ExtensionPrefs::LaunchType launch_type) {\n    ExtensionService* service = browser()->profile()->GetExtensionService();\n    service->extension_prefs()->SetLaunchType(app_id, launch_type);\n  }\n\n  \/\/ Check that there are two browsers.  Find the one that is not |browser()|.\n  void FindOneOtherBrowser(Browser** out_other_browser) {\n    \/\/ There should only be one other browser.\n    ASSERT_EQ(2u, BrowserList::GetBrowserCount(browser()->profile()));\n\n    \/\/ Find the new browser.\n    Browser* other_browser = NULL;\n    for (BrowserList::const_iterator i = BrowserList::begin();\n         i != BrowserList::end() && !other_browser; ++i) {\n      if (*i != browser())\n        other_browser = *i;\n    }\n    ASSERT_TRUE(other_browser);\n    ASSERT_TRUE(other_browser != browser());\n    *out_other_browser = other_browser;\n  }\n};\n\nclass OpenURLsPopupObserver : public BrowserList::Observer {\n public:\n  OpenURLsPopupObserver() : added_browser_(NULL) { }\n\n  virtual void OnBrowserAdded(const Browser* browser) {\n    added_browser_ = browser;\n  }\n\n  virtual void OnBrowserRemoved(const Browser* browser) { }\n\n  const Browser* added_browser_;\n};\n\n\/\/ Test that when there is a popup as the active browser any requests to\n\/\/ BrowserInit::LaunchWithProfile::OpenURLsInBrowser don't crash because\n\/\/ there's no explicit profile given.\nIN_PROC_BROWSER_TEST_F(BrowserInitTest, OpenURLsPopup) {\n  std::vector<GURL> urls;\n  urls.push_back(GURL(\"http:\/\/localhost\"));\n\n  \/\/ Note that in our testing we do not ever query the BrowserList for the \"last\n  \/\/ active\" browser. That's because the browsers are set as \"active\" by\n  \/\/ platform UI toolkit messages, and those messages are not sent during unit\n  \/\/ testing sessions.\n\n  OpenURLsPopupObserver observer;\n  BrowserList::AddObserver(&observer);\n\n  Browser* popup = Browser::CreateForType(Browser::TYPE_POPUP,\n                                          browser()->profile());\n  ASSERT_TRUE(popup->is_type_popup());\n  ASSERT_EQ(popup, observer.added_browser_);\n\n  CommandLine dummy(CommandLine::NO_PROGRAM);\n  BrowserInit::IsFirstRun first_run = FirstRun::IsChromeFirstRun() ?\n      BrowserInit::IS_FIRST_RUN : BrowserInit::IS_NOT_FIRST_RUN;\n  BrowserInit::LaunchWithProfile launch(FilePath(), dummy, first_run);\n  \/\/ This should create a new window, but re-use the profile from |popup|. If\n  \/\/ it used a NULL or invalid profile, it would crash.\n  launch.OpenURLsInBrowser(popup, false, urls);\n  ASSERT_NE(popup, observer.added_browser_);\n  BrowserList::RemoveObserver(&observer);\n}\n\n#if defined(USE_AURA)\n\/\/ Fails on aura. See crbug.com\/106248.\n#define MAYBE_StartupURLsOnNewWindowWithNoTabbedBrowsers DISABLED_StartupURLsOnNewWindowWithNoTabbedBrowsers\n#else\n#define MAYBE_StartupURLsOnNewWindowWithNoTabbedBrowsers StartupURLsOnNewWindowWithNoTabbedBrowsers\n#endif\n\n\/\/ Verify that startup URLs are honored when the process already exists but has\n\/\/ no tabbed browser windows (eg. as if the process is running only due to a\n\/\/ background application.\nIN_PROC_BROWSER_TEST_F(BrowserInitTest,\n                       MAYBE_StartupURLsOnNewWindowWithNoTabbedBrowsers) {\n  \/\/ Use a couple arbitrary URLs.\n  std::vector<GURL> urls;\n  urls.push_back(ui_test_utils::GetTestUrl(\n      FilePath(FilePath::kCurrentDirectory),\n      FilePath(FILE_PATH_LITERAL(\"title1.html\"))));\n  urls.push_back(ui_test_utils::GetTestUrl(\n      FilePath(FilePath::kCurrentDirectory),\n      FilePath(FILE_PATH_LITERAL(\"title2.html\"))));\n\n  \/\/ Set the startup preference to open these URLs.\n  SessionStartupPref pref(SessionStartupPref::URLS);\n  pref.urls = urls;\n  SessionStartupPref::SetStartupPref(browser()->profile(), pref);\n\n  \/\/ Close the browser.\n  browser()->window()->Close();\n\n  \/\/ Do a simple non-process-startup browser launch.\n  CommandLine dummy(CommandLine::NO_PROGRAM);\n  BrowserInit::IsFirstRun first_run = FirstRun::IsChromeFirstRun() ?\n      BrowserInit::IS_FIRST_RUN : BrowserInit::IS_NOT_FIRST_RUN;\n  BrowserInit::LaunchWithProfile launch(FilePath(), dummy, first_run);\n  ASSERT_TRUE(launch.Launch(browser()->profile(), std::vector<GURL>(), false));\n\n  \/\/ This should have created a new browser window.  |browser()| is still\n  \/\/ around at this point, even though we've closed it's window.\n  Browser* new_browser = NULL;\n  ASSERT_NO_FATAL_FAILURE(FindOneOtherBrowser(&new_browser));\n\n  \/\/ The new browser should have one tab for each URL.\n  ASSERT_EQ(static_cast<int>(urls.size()), new_browser->tab_count());\n  for (size_t i=0; i < urls.size(); i++) {\n    EXPECT_EQ(urls[i], new_browser->GetTabContentsAt(i)->GetURL());\n  }\n}\n\n\/\/ Verify that startup URLs aren't used when the process already exists\n\/\/ and has other tabbed browser windows.  This is the common case of starting a\n\/\/ new browser.\nIN_PROC_BROWSER_TEST_F(BrowserInitTest,\n                       StartupURLsOnNewWindow) {\n  \/\/ Use a couple arbitrary URLs.\n  std::vector<GURL> urls;\n  urls.push_back(ui_test_utils::GetTestUrl(\n      FilePath(FilePath::kCurrentDirectory),\n      FilePath(FILE_PATH_LITERAL(\"title1.html\"))));\n  urls.push_back(ui_test_utils::GetTestUrl(\n      FilePath(FilePath::kCurrentDirectory),\n      FilePath(FILE_PATH_LITERAL(\"title2.html\"))));\n\n  \/\/ Set the startup preference to open these URLs.\n  SessionStartupPref pref(SessionStartupPref::URLS);\n  pref.urls = urls;\n  SessionStartupPref::SetStartupPref(browser()->profile(), pref);\n\n  \/\/ Do a simple non-process-startup browser launch.\n  CommandLine dummy(CommandLine::NO_PROGRAM);\n  BrowserInit::IsFirstRun first_run = FirstRun::IsChromeFirstRun() ?\n      BrowserInit::IS_FIRST_RUN : BrowserInit::IS_NOT_FIRST_RUN;\n  BrowserInit::LaunchWithProfile launch(FilePath(), dummy, first_run);\n  ASSERT_TRUE(launch.Launch(browser()->profile(), std::vector<GURL>(), false));\n\n  \/\/ This should have created a new browser window.\n  Browser* new_browser = NULL;\n  ASSERT_NO_FATAL_FAILURE(FindOneOtherBrowser(&new_browser));\n\n  \/\/ The new browser should have exactly one tab (not the startup URLs).\n  ASSERT_EQ(1, new_browser->tab_count());\n}\n\n\/\/ App shortcuts are not implemented on mac os.\n#if !defined(OS_MACOSX)\nIN_PROC_BROWSER_TEST_F(BrowserInitTest, OpenAppShortcutNoPref) {\n  \/\/ Load an app with launch.container = 'tab'.\n  const Extension* extension_app = NULL;\n  ASSERT_NO_FATAL_FAILURE(LoadApp(\"app_with_tab_container\", &extension_app));\n\n  \/\/ Add --app-id=<extension->id()> to the command line.\n  CommandLine command_line(CommandLine::NO_PROGRAM);\n  command_line.AppendSwitchASCII(switches::kAppId, extension_app->id());\n\n  BrowserInit::IsFirstRun first_run = FirstRun::IsChromeFirstRun() ?\n      BrowserInit::IS_FIRST_RUN : BrowserInit::IS_NOT_FIRST_RUN;\n  BrowserInit::LaunchWithProfile launch(FilePath(), command_line, first_run);\n  ASSERT_TRUE(launch.Launch(browser()->profile(), std::vector<GURL>(), false));\n\n  \/\/ No pref was set, so the app should have opened in a window.\n  \/\/ The launch should have created a new browser.\n  Browser* new_browser = NULL;\n  ASSERT_NO_FATAL_FAILURE(FindOneOtherBrowser(&new_browser));\n\n  \/\/ Expect an app window.\n  EXPECT_TRUE(new_browser->is_app());\n\n  \/\/ The browser's app_name should include the app's ID.\n  EXPECT_NE(\n      new_browser->app_name_.find(extension_app->id()),\n      std::string::npos) << new_browser->app_name_;\n}\n\nIN_PROC_BROWSER_TEST_F(BrowserInitTest, OpenAppShortcutWindowPref) {\n  const Extension* extension_app = NULL;\n  ASSERT_NO_FATAL_FAILURE(LoadApp(\"app_with_tab_container\", &extension_app));\n\n  \/\/ Set a pref indicating that the user wants to open this app in a window.\n  SetAppLaunchPref(extension_app->id(), ExtensionPrefs::LAUNCH_WINDOW);\n\n  CommandLine command_line(CommandLine::NO_PROGRAM);\n  command_line.AppendSwitchASCII(switches::kAppId, extension_app->id());\n  BrowserInit::IsFirstRun first_run = FirstRun::IsChromeFirstRun() ?\n      BrowserInit::IS_FIRST_RUN : BrowserInit::IS_NOT_FIRST_RUN;\n  BrowserInit::LaunchWithProfile launch(FilePath(), command_line, first_run);\n  ASSERT_TRUE(launch.Launch(browser()->profile(), std::vector<GURL>(), false));\n\n  \/\/ Pref was set to open in a window, so the app should have opened in a\n  \/\/ window.  The launch should have created a new browser. Find the new\n  \/\/ browser.\n  Browser* new_browser = NULL;\n  ASSERT_NO_FATAL_FAILURE(FindOneOtherBrowser(&new_browser));\n\n  \/\/ Expect an app window.\n  EXPECT_TRUE(new_browser->is_app());\n\n  \/\/ The browser's app_name should include the app's ID.\n  EXPECT_NE(\n      new_browser->app_name_.find(extension_app->id()),\n      std::string::npos) << new_browser->app_name_;\n}\n\nIN_PROC_BROWSER_TEST_F(BrowserInitTest, OpenAppShortcutTabPref) {\n  \/\/ Load an app with launch.container = 'tab'.\n  const Extension* extension_app = NULL;\n  ASSERT_NO_FATAL_FAILURE(LoadApp(\"app_with_tab_container\", &extension_app));\n\n  \/\/ Set a pref indicating that the user wants to open this app in a window.\n  SetAppLaunchPref(extension_app->id(), ExtensionPrefs::LAUNCH_REGULAR);\n\n  CommandLine command_line(CommandLine::NO_PROGRAM);\n  command_line.AppendSwitchASCII(switches::kAppId, extension_app->id());\n  BrowserInit::IsFirstRun first_run = FirstRun::IsChromeFirstRun() ?\n      BrowserInit::IS_FIRST_RUN : BrowserInit::IS_NOT_FIRST_RUN;\n  BrowserInit::LaunchWithProfile launch(FilePath(), command_line, first_run);\n  ASSERT_TRUE(launch.Launch(browser()->profile(), std::vector<GURL>(), false));\n\n  \/\/ When an app shortcut is open and the pref indicates a tab should\n  \/\/ open, the tab is open in a new browser window.  Expect a new window.\n  ASSERT_EQ(2u, BrowserList::GetBrowserCount(browser()->profile()));\n\n  Browser* new_browser = NULL;\n  ASSERT_NO_FATAL_FAILURE(FindOneOtherBrowser(&new_browser));\n\n  \/\/ The tab should be in a tabbed window.\n  EXPECT_TRUE(new_browser->is_type_tabbed());\n\n  \/\/ The browser's app_name should not include the app's ID: It is in a\n  \/\/ normal browser.\n  EXPECT_EQ(\n      new_browser->app_name_.find(extension_app->id()),\n      std::string::npos) << new_browser->app_name_;\n}\n\nIN_PROC_BROWSER_TEST_F(BrowserInitTest, OpenAppShortcutPanel) {\n  \/\/ Load an app with launch.container = 'panel'.\n  const Extension* extension_app = NULL;\n  ASSERT_NO_FATAL_FAILURE(LoadApp(\"app_with_panel_container\", &extension_app));\n\n  CommandLine command_line(CommandLine::NO_PROGRAM);\n  command_line.AppendSwitchASCII(switches::kAppId, extension_app->id());\n  BrowserInit::IsFirstRun first_run = FirstRun::IsChromeFirstRun() ?\n      BrowserInit::IS_FIRST_RUN : BrowserInit::IS_NOT_FIRST_RUN;\n  BrowserInit::LaunchWithProfile launch(FilePath(), command_line, first_run);\n  ASSERT_TRUE(launch.Launch(browser()->profile(), std::vector<GURL>(), false));\n\n  \/\/ The launch should have created a new browser, with a panel type.\n  Browser* new_browser = NULL;\n  ASSERT_NO_FATAL_FAILURE(FindOneOtherBrowser(&new_browser));\n\n  \/\/ Expect an app panel.\n  EXPECT_TRUE(new_browser->is_type_panel() && new_browser->is_app());\n\n  \/\/ The new browser's app_name should include the app's ID.\n  EXPECT_NE(\n      new_browser->app_name_.find(extension_app->id()),\n      std::string::npos) << new_browser->app_name_;\n}\n\nIN_PROC_BROWSER_TEST_F(BrowserInitTest, ReadingWasRestartedAfterRestart) {\n  \/\/ Tests that BrowserInit::WasRestarted reads and resets the preference\n  \/\/ kWasRestarted correctly.\n  PrefService* pref_service = g_browser_process->local_state();\n  pref_service->SetBoolean(prefs::kWasRestarted, true);\n  EXPECT_TRUE(BrowserInit::WasRestarted());\n  EXPECT_FALSE(pref_service->GetBoolean(prefs::kWasRestarted));\n  EXPECT_TRUE(BrowserInit::WasRestarted());\n}\n\nIN_PROC_BROWSER_TEST_F(BrowserInitTest, ReadingWasRestartedAfterNormalStart) {\n  \/\/ Tests that BrowserInit::WasRestarted reads and resets the preference\n  \/\/ kWasRestarted correctly.\n  PrefService* pref_service = g_browser_process->local_state();\n  pref_service->SetBoolean(prefs::kWasRestarted, false);\n  EXPECT_FALSE(BrowserInit::WasRestarted());\n  EXPECT_FALSE(pref_service->GetBoolean(prefs::kWasRestarted));\n  EXPECT_FALSE(BrowserInit::WasRestarted());\n}\n\n#endif  \/\/ !defined(OS_MACOSX)\n<commit_msg>Revert r112850 \"Disable StartupURLsOnNewWindowWithNoTabbedBrowsers on aura\"<commit_after>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/command_line.h\"\n#include \"base\/file_path.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/browser_process.h\"\n#include \"chrome\/browser\/extensions\/extension_browsertest.h\"\n#include \"chrome\/browser\/extensions\/extension_service.h\"\n#include \"chrome\/browser\/first_run\/first_run.h\"\n#include \"chrome\/browser\/prefs\/pref_service.h\"\n#include \"chrome\/browser\/prefs\/session_startup_pref.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/browser\/ui\/browser_init.h\"\n#include \"chrome\/browser\/ui\/browser_list.h\"\n#include \"chrome\/browser\/ui\/browser_window.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"chrome\/test\/base\/in_process_browser_test.h\"\n#include \"chrome\/test\/base\/ui_test_utils.h\"\n#include \"content\/browser\/tab_contents\/tab_contents.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nclass BrowserInitTest : public ExtensionBrowserTest {\n protected:\n  virtual void SetUpCommandLine(CommandLine* command_line) {\n    ExtensionBrowserTest::SetUpCommandLine(command_line);\n    command_line->AppendSwitch(switches::kEnablePanels);\n  }\n\n  \/\/ Helper functions return void so that we can ASSERT*().\n  \/\/ Use ASSERT_NO_FATAL_FAILURE around calls to these functions to stop the\n  \/\/ test if an assert fails.\n  void LoadApp(const std::string& app_name,\n               const Extension** out_app_extension) {\n    ASSERT_TRUE(LoadExtension(test_data_dir_.AppendASCII(app_name.c_str())));\n\n    ExtensionService* service = browser()->profile()->GetExtensionService();\n    *out_app_extension = service->GetExtensionById(\n        last_loaded_extension_id_, false);\n    ASSERT_TRUE(*out_app_extension);\n\n    \/\/ Code that opens a new browser assumes we start with exactly one.\n    ASSERT_EQ(1u, BrowserList::GetBrowserCount(browser()->profile()));\n  }\n\n  void SetAppLaunchPref(const std::string& app_id,\n                        ExtensionPrefs::LaunchType launch_type) {\n    ExtensionService* service = browser()->profile()->GetExtensionService();\n    service->extension_prefs()->SetLaunchType(app_id, launch_type);\n  }\n\n  \/\/ Check that there are two browsers.  Find the one that is not |browser()|.\n  void FindOneOtherBrowser(Browser** out_other_browser) {\n    \/\/ There should only be one other browser.\n    ASSERT_EQ(2u, BrowserList::GetBrowserCount(browser()->profile()));\n\n    \/\/ Find the new browser.\n    Browser* other_browser = NULL;\n    for (BrowserList::const_iterator i = BrowserList::begin();\n         i != BrowserList::end() && !other_browser; ++i) {\n      if (*i != browser())\n        other_browser = *i;\n    }\n    ASSERT_TRUE(other_browser);\n    ASSERT_TRUE(other_browser != browser());\n    *out_other_browser = other_browser;\n  }\n};\n\nclass OpenURLsPopupObserver : public BrowserList::Observer {\n public:\n  OpenURLsPopupObserver() : added_browser_(NULL) { }\n\n  virtual void OnBrowserAdded(const Browser* browser) {\n    added_browser_ = browser;\n  }\n\n  virtual void OnBrowserRemoved(const Browser* browser) { }\n\n  const Browser* added_browser_;\n};\n\n\/\/ Test that when there is a popup as the active browser any requests to\n\/\/ BrowserInit::LaunchWithProfile::OpenURLsInBrowser don't crash because\n\/\/ there's no explicit profile given.\nIN_PROC_BROWSER_TEST_F(BrowserInitTest, OpenURLsPopup) {\n  std::vector<GURL> urls;\n  urls.push_back(GURL(\"http:\/\/localhost\"));\n\n  \/\/ Note that in our testing we do not ever query the BrowserList for the \"last\n  \/\/ active\" browser. That's because the browsers are set as \"active\" by\n  \/\/ platform UI toolkit messages, and those messages are not sent during unit\n  \/\/ testing sessions.\n\n  OpenURLsPopupObserver observer;\n  BrowserList::AddObserver(&observer);\n\n  Browser* popup = Browser::CreateForType(Browser::TYPE_POPUP,\n                                          browser()->profile());\n  ASSERT_TRUE(popup->is_type_popup());\n  ASSERT_EQ(popup, observer.added_browser_);\n\n  CommandLine dummy(CommandLine::NO_PROGRAM);\n  BrowserInit::IsFirstRun first_run = FirstRun::IsChromeFirstRun() ?\n      BrowserInit::IS_FIRST_RUN : BrowserInit::IS_NOT_FIRST_RUN;\n  BrowserInit::LaunchWithProfile launch(FilePath(), dummy, first_run);\n  \/\/ This should create a new window, but re-use the profile from |popup|. If\n  \/\/ it used a NULL or invalid profile, it would crash.\n  launch.OpenURLsInBrowser(popup, false, urls);\n  ASSERT_NE(popup, observer.added_browser_);\n  BrowserList::RemoveObserver(&observer);\n}\n\n\/\/ Verify that startup URLs are honored when the process already exists but has\n\/\/ no tabbed browser windows (eg. as if the process is running only due to a\n\/\/ background application.\nIN_PROC_BROWSER_TEST_F(BrowserInitTest,\n                       StartupURLsOnNewWindowWithNoTabbedBrowsers) {\n  \/\/ Use a couple arbitrary URLs.\n  std::vector<GURL> urls;\n  urls.push_back(ui_test_utils::GetTestUrl(\n      FilePath(FilePath::kCurrentDirectory),\n      FilePath(FILE_PATH_LITERAL(\"title1.html\"))));\n  urls.push_back(ui_test_utils::GetTestUrl(\n      FilePath(FilePath::kCurrentDirectory),\n      FilePath(FILE_PATH_LITERAL(\"title2.html\"))));\n\n  \/\/ Set the startup preference to open these URLs.\n  SessionStartupPref pref(SessionStartupPref::URLS);\n  pref.urls = urls;\n  SessionStartupPref::SetStartupPref(browser()->profile(), pref);\n\n  \/\/ Close the browser.\n  browser()->window()->Close();\n\n  \/\/ Do a simple non-process-startup browser launch.\n  CommandLine dummy(CommandLine::NO_PROGRAM);\n  BrowserInit::IsFirstRun first_run = FirstRun::IsChromeFirstRun() ?\n      BrowserInit::IS_FIRST_RUN : BrowserInit::IS_NOT_FIRST_RUN;\n  BrowserInit::LaunchWithProfile launch(FilePath(), dummy, first_run);\n  ASSERT_TRUE(launch.Launch(browser()->profile(), std::vector<GURL>(), false));\n\n  \/\/ This should have created a new browser window.  |browser()| is still\n  \/\/ around at this point, even though we've closed it's window.\n  Browser* new_browser = NULL;\n  ASSERT_NO_FATAL_FAILURE(FindOneOtherBrowser(&new_browser));\n\n  \/\/ The new browser should have one tab for each URL.\n  ASSERT_EQ(static_cast<int>(urls.size()), new_browser->tab_count());\n  for (size_t i=0; i < urls.size(); i++) {\n    EXPECT_EQ(urls[i], new_browser->GetTabContentsAt(i)->GetURL());\n  }\n}\n\n\/\/ Verify that startup URLs aren't used when the process already exists\n\/\/ and has other tabbed browser windows.  This is the common case of starting a\n\/\/ new browser.\nIN_PROC_BROWSER_TEST_F(BrowserInitTest,\n                       StartupURLsOnNewWindow) {\n  \/\/ Use a couple arbitrary URLs.\n  std::vector<GURL> urls;\n  urls.push_back(ui_test_utils::GetTestUrl(\n      FilePath(FilePath::kCurrentDirectory),\n      FilePath(FILE_PATH_LITERAL(\"title1.html\"))));\n  urls.push_back(ui_test_utils::GetTestUrl(\n      FilePath(FilePath::kCurrentDirectory),\n      FilePath(FILE_PATH_LITERAL(\"title2.html\"))));\n\n  \/\/ Set the startup preference to open these URLs.\n  SessionStartupPref pref(SessionStartupPref::URLS);\n  pref.urls = urls;\n  SessionStartupPref::SetStartupPref(browser()->profile(), pref);\n\n  \/\/ Do a simple non-process-startup browser launch.\n  CommandLine dummy(CommandLine::NO_PROGRAM);\n  BrowserInit::IsFirstRun first_run = FirstRun::IsChromeFirstRun() ?\n      BrowserInit::IS_FIRST_RUN : BrowserInit::IS_NOT_FIRST_RUN;\n  BrowserInit::LaunchWithProfile launch(FilePath(), dummy, first_run);\n  ASSERT_TRUE(launch.Launch(browser()->profile(), std::vector<GURL>(), false));\n\n  \/\/ This should have created a new browser window.\n  Browser* new_browser = NULL;\n  ASSERT_NO_FATAL_FAILURE(FindOneOtherBrowser(&new_browser));\n\n  \/\/ The new browser should have exactly one tab (not the startup URLs).\n  ASSERT_EQ(1, new_browser->tab_count());\n}\n\n\/\/ App shortcuts are not implemented on mac os.\n#if !defined(OS_MACOSX)\nIN_PROC_BROWSER_TEST_F(BrowserInitTest, OpenAppShortcutNoPref) {\n  \/\/ Load an app with launch.container = 'tab'.\n  const Extension* extension_app = NULL;\n  ASSERT_NO_FATAL_FAILURE(LoadApp(\"app_with_tab_container\", &extension_app));\n\n  \/\/ Add --app-id=<extension->id()> to the command line.\n  CommandLine command_line(CommandLine::NO_PROGRAM);\n  command_line.AppendSwitchASCII(switches::kAppId, extension_app->id());\n\n  BrowserInit::IsFirstRun first_run = FirstRun::IsChromeFirstRun() ?\n      BrowserInit::IS_FIRST_RUN : BrowserInit::IS_NOT_FIRST_RUN;\n  BrowserInit::LaunchWithProfile launch(FilePath(), command_line, first_run);\n  ASSERT_TRUE(launch.Launch(browser()->profile(), std::vector<GURL>(), false));\n\n  \/\/ No pref was set, so the app should have opened in a window.\n  \/\/ The launch should have created a new browser.\n  Browser* new_browser = NULL;\n  ASSERT_NO_FATAL_FAILURE(FindOneOtherBrowser(&new_browser));\n\n  \/\/ Expect an app window.\n  EXPECT_TRUE(new_browser->is_app());\n\n  \/\/ The browser's app_name should include the app's ID.\n  EXPECT_NE(\n      new_browser->app_name_.find(extension_app->id()),\n      std::string::npos) << new_browser->app_name_;\n}\n\nIN_PROC_BROWSER_TEST_F(BrowserInitTest, OpenAppShortcutWindowPref) {\n  const Extension* extension_app = NULL;\n  ASSERT_NO_FATAL_FAILURE(LoadApp(\"app_with_tab_container\", &extension_app));\n\n  \/\/ Set a pref indicating that the user wants to open this app in a window.\n  SetAppLaunchPref(extension_app->id(), ExtensionPrefs::LAUNCH_WINDOW);\n\n  CommandLine command_line(CommandLine::NO_PROGRAM);\n  command_line.AppendSwitchASCII(switches::kAppId, extension_app->id());\n  BrowserInit::IsFirstRun first_run = FirstRun::IsChromeFirstRun() ?\n      BrowserInit::IS_FIRST_RUN : BrowserInit::IS_NOT_FIRST_RUN;\n  BrowserInit::LaunchWithProfile launch(FilePath(), command_line, first_run);\n  ASSERT_TRUE(launch.Launch(browser()->profile(), std::vector<GURL>(), false));\n\n  \/\/ Pref was set to open in a window, so the app should have opened in a\n  \/\/ window.  The launch should have created a new browser. Find the new\n  \/\/ browser.\n  Browser* new_browser = NULL;\n  ASSERT_NO_FATAL_FAILURE(FindOneOtherBrowser(&new_browser));\n\n  \/\/ Expect an app window.\n  EXPECT_TRUE(new_browser->is_app());\n\n  \/\/ The browser's app_name should include the app's ID.\n  EXPECT_NE(\n      new_browser->app_name_.find(extension_app->id()),\n      std::string::npos) << new_browser->app_name_;\n}\n\nIN_PROC_BROWSER_TEST_F(BrowserInitTest, OpenAppShortcutTabPref) {\n  \/\/ Load an app with launch.container = 'tab'.\n  const Extension* extension_app = NULL;\n  ASSERT_NO_FATAL_FAILURE(LoadApp(\"app_with_tab_container\", &extension_app));\n\n  \/\/ Set a pref indicating that the user wants to open this app in a window.\n  SetAppLaunchPref(extension_app->id(), ExtensionPrefs::LAUNCH_REGULAR);\n\n  CommandLine command_line(CommandLine::NO_PROGRAM);\n  command_line.AppendSwitchASCII(switches::kAppId, extension_app->id());\n  BrowserInit::IsFirstRun first_run = FirstRun::IsChromeFirstRun() ?\n      BrowserInit::IS_FIRST_RUN : BrowserInit::IS_NOT_FIRST_RUN;\n  BrowserInit::LaunchWithProfile launch(FilePath(), command_line, first_run);\n  ASSERT_TRUE(launch.Launch(browser()->profile(), std::vector<GURL>(), false));\n\n  \/\/ When an app shortcut is open and the pref indicates a tab should\n  \/\/ open, the tab is open in a new browser window.  Expect a new window.\n  ASSERT_EQ(2u, BrowserList::GetBrowserCount(browser()->profile()));\n\n  Browser* new_browser = NULL;\n  ASSERT_NO_FATAL_FAILURE(FindOneOtherBrowser(&new_browser));\n\n  \/\/ The tab should be in a tabbed window.\n  EXPECT_TRUE(new_browser->is_type_tabbed());\n\n  \/\/ The browser's app_name should not include the app's ID: It is in a\n  \/\/ normal browser.\n  EXPECT_EQ(\n      new_browser->app_name_.find(extension_app->id()),\n      std::string::npos) << new_browser->app_name_;\n}\n\nIN_PROC_BROWSER_TEST_F(BrowserInitTest, OpenAppShortcutPanel) {\n  \/\/ Load an app with launch.container = 'panel'.\n  const Extension* extension_app = NULL;\n  ASSERT_NO_FATAL_FAILURE(LoadApp(\"app_with_panel_container\", &extension_app));\n\n  CommandLine command_line(CommandLine::NO_PROGRAM);\n  command_line.AppendSwitchASCII(switches::kAppId, extension_app->id());\n  BrowserInit::IsFirstRun first_run = FirstRun::IsChromeFirstRun() ?\n      BrowserInit::IS_FIRST_RUN : BrowserInit::IS_NOT_FIRST_RUN;\n  BrowserInit::LaunchWithProfile launch(FilePath(), command_line, first_run);\n  ASSERT_TRUE(launch.Launch(browser()->profile(), std::vector<GURL>(), false));\n\n  \/\/ The launch should have created a new browser, with a panel type.\n  Browser* new_browser = NULL;\n  ASSERT_NO_FATAL_FAILURE(FindOneOtherBrowser(&new_browser));\n\n  \/\/ Expect an app panel.\n  EXPECT_TRUE(new_browser->is_type_panel() && new_browser->is_app());\n\n  \/\/ The new browser's app_name should include the app's ID.\n  EXPECT_NE(\n      new_browser->app_name_.find(extension_app->id()),\n      std::string::npos) << new_browser->app_name_;\n}\n\nIN_PROC_BROWSER_TEST_F(BrowserInitTest, ReadingWasRestartedAfterRestart) {\n  \/\/ Tests that BrowserInit::WasRestarted reads and resets the preference\n  \/\/ kWasRestarted correctly.\n  PrefService* pref_service = g_browser_process->local_state();\n  pref_service->SetBoolean(prefs::kWasRestarted, true);\n  EXPECT_TRUE(BrowserInit::WasRestarted());\n  EXPECT_FALSE(pref_service->GetBoolean(prefs::kWasRestarted));\n  EXPECT_TRUE(BrowserInit::WasRestarted());\n}\n\nIN_PROC_BROWSER_TEST_F(BrowserInitTest, ReadingWasRestartedAfterNormalStart) {\n  \/\/ Tests that BrowserInit::WasRestarted reads and resets the preference\n  \/\/ kWasRestarted correctly.\n  PrefService* pref_service = g_browser_process->local_state();\n  pref_service->SetBoolean(prefs::kWasRestarted, false);\n  EXPECT_FALSE(BrowserInit::WasRestarted());\n  EXPECT_FALSE(pref_service->GetBoolean(prefs::kWasRestarted));\n  EXPECT_FALSE(BrowserInit::WasRestarted());\n}\n\n#endif  \/\/ !defined(OS_MACOSX)\n<|endoftext|>"}
{"text":"<commit_before>#include <algorithm>\n#include <condition_variable>\n#include <exception>\n#include <thread>\n#include <iostream>\n#include <sstream>\n#include <mutex>\n#include <utility>\n#include <vector>\n\n#ifdef HAVE_CONFIG_H\n#include \"config.h\"\n#endif\n\n#include \"collector.grpc.pb.h\"\n#include \"lightstep\/impl.h\"\n#include \"lightstep\/options.h\"\n#include \"lightstep\/recorder.h\"\n#include \"lightstep\/tracer.h\"\n#include \"lightstep\/util.h\"\n\n#include <grpc++\/create_channel.h>\n\nnamespace lightstep {\n\nstd::string hostPortOf(const TracerOptions& options) {\n  std::ostringstream os;\n  os << options.collector_host << \":\" << options.collector_port;\n  return os.str();\n}\n\nBasicRecorderOptions::BasicRecorderOptions()\n  : time_limit(std::chrono::milliseconds(500)),\n    span_limit(2000),\n    report_timeout(std::chrono::seconds(5)) { }\n\nclass BasicRecorder : public Recorder {\npublic:\n  BasicRecorder(const TracerImpl& impl, const BasicRecorderOptions& options);\n\n  ~BasicRecorder() {\n    make_writer_exit();\n    writer_.join();\n  }\n\n  void RecordSpan(collector::Span&& span) override {\n    MutexLock lock(write_mutex_);\n    if (builder_.pendingSpans() >= options_.span_limit) {\n      dropped_spans_++;\n      return;\n    }\n    builder_.addSpan(std::move(span));\n    if (builder_.pendingSpans() >= options_.span_limit) {\n      write_cond_.notify_all();\n    }\n  }\n\n  bool FlushWithTimeout(SystemDuration timeout) override;\n\nprivate:\n  void write();\n  bool write_report(const collector::ReportRequest&);\n  void flush_one();\n\n  \/\/ Forces the writer thread to exit immediately.\n  void make_writer_exit() {\n    MutexLock lock(write_mutex_);\n    write_exit_ = true;\n    write_cond_.notify_all();\n  }\n\n  \/\/ Waits until either the timeout or the writer thread is forced to\n  \/\/ exit.  Returns true if it should continue writing, false if it\n  \/\/ should exit.\n  bool wait_for_next_write(const SteadyClock::time_point &next) {\n    std::unique_lock<std::mutex> lock(write_mutex_);\n    write_cond_.wait_until(lock, next, [this]() {\n  \treturn this->write_exit_ ||\n\t       this->builder_.pendingSpans() >= options_.span_limit;\n      });\n    return !write_exit_;\n  }\n    \n  const TracerImpl& tracer_;\n  const BasicRecorderOptions options_;\n\n  \/\/ Writer state.\n  std::mutex write_mutex_;\n  std::condition_variable write_cond_;\n  bool write_exit_;\n  std::thread writer_;\n\n  \/\/ Buffer state (protected by write_mutex_).\n  ReportBuilder builder_;\n  collector::ReportRequest inflight_;\n  size_t flushed_seqno_;\n  size_t encoding_seqno_;\n  size_t dropped_spans_;\n\n  \/\/ Collector service stub.\n  collector::CollectorService::Stub client_;\n};\n\nBasicRecorder::BasicRecorder(const TracerImpl& tracer, const BasicRecorderOptions& options)\n  : tracer_(tracer),\n    options_(options),\n    write_exit_(false),\n    writer_(std::thread(&BasicRecorder::write, this)),\n    builder_(tracer),\n    flushed_seqno_(0),\n    encoding_seqno_(1),\n    dropped_spans_(0),\n    client_(grpc::CreateChannel(hostPortOf(tracer.options()),\n\t\t\t\t(tracer.options().collector_encryption == \"tls\") ?\n\t\t\t\tgrpc::SslCredentials(grpc::SslCredentialsOptions()) :\n\t\t\t\tgrpc::InsecureChannelCredentials())) {}\n\nvoid BasicRecorder::write() {\n  auto next = SteadyClock::now() + options_.time_limit;\n\n  while (wait_for_next_write(next)) {\n    flush_one();\n\n    auto end = SteadyClock::now();\n    auto elapsed = end - next;\n\n    if (elapsed > options_.time_limit) {\n      next = end;\n    } else {\n      next = end + options_.time_limit - elapsed;\n    }\n  }\n}\n\nvoid BasicRecorder::flush_one() {\n  size_t seq;\n  size_t save_dropped;\n  size_t save_pending;\n  {\n    \/\/ Swap the pending encoder with the inflight encoder, then use\n    \/\/ inflight without a lock. Assumption is that this thread is the\n    \/\/ only place inflight_ is used.\n    MutexLock lock(write_mutex_);\n    save_pending = builder_.pendingSpans();\n    if (save_pending == 0) {\n      return;\n    }\n    \/\/ TODO Compute and set timestamp_offset_micros\n    save_dropped = dropped_spans_;\n    builder_.setPendingClientDroppedSpans(save_dropped);\n    dropped_spans_ = 0;\n    std::swap(builder_.pending(), inflight_);\n    ++encoding_seqno_;\n  }\n  bool success = write_report(inflight_);\n  {\n    MutexLock lock(write_mutex_);\n    ++flushed_seqno_;\n    write_cond_.notify_all();\n    inflight_.Clear();\n\n    if (!success) {\n      dropped_spans_ += save_dropped + save_pending;\n    }\n  }\n}\n\nbool BasicRecorder::write_report(const collector::ReportRequest& report) {\n  grpc::ClientContext context;\n  collector::ReportResponse resp;\n  context.set_fail_fast(true);\n  context.set_deadline(SystemClock::now() + options_.report_timeout);\n  grpc::Status status = client_.Report(&context, report, &resp);\n  if (!status.ok()) {\n    std::cout << \"Report RPC failed: \" << status.error_message();\n    \/\/ TODO Put some of these back into a buffer, etc. (Presently they all drop.)\n    return false;\n  }\n  \/\/ TODO Use response.\n  return true;\n}\n\nbool BasicRecorder::FlushWithTimeout(SystemDuration timeout) {\n  \/\/ Note: there is no effort made to speed up the flush when\n  \/\/ requested, it simply waits for the regularly scheduled flush\n  \/\/ operations to clear out all the presently pending data.\n  std::unique_lock<std::mutex> lock(write_mutex_);\n\n  bool has_encoded = builder_.pendingSpans() != 0;\n\n  if (!has_encoded && encoding_seqno_ == 1 + flushed_seqno_) {\n    return true;\n  }\n\n  size_t wait_seq = encoding_seqno_ - (has_encoded ? 0 : 1);\n\n  return write_cond_.wait_for(lock, timeout, [this, wait_seq]() {\n    return this->flushed_seqno_ >= wait_seq;\n  });\n}\n\nTracer NewLightStepTracer(const TracerOptions& topts,\n\t\t\t  const BasicRecorderOptions& bopts) {\n  ImplPtr impl(new TracerImpl(topts));\n  impl->set_recorder(std::unique_ptr<Recorder>(new BasicRecorder(*impl, bopts)));\n  return Tracer(impl);\n}\n\n}  \/\/ namespace lightstep\n<commit_msg>Fix race condition in BasicRecorder's constructor.<commit_after>#include <algorithm>\n#include <condition_variable>\n#include <exception>\n#include <thread>\n#include <iostream>\n#include <sstream>\n#include <mutex>\n#include <utility>\n#include <vector>\n\n#ifdef HAVE_CONFIG_H\n#include \"config.h\"\n#endif\n\n#include \"collector.grpc.pb.h\"\n#include \"lightstep\/impl.h\"\n#include \"lightstep\/options.h\"\n#include \"lightstep\/recorder.h\"\n#include \"lightstep\/tracer.h\"\n#include \"lightstep\/util.h\"\n\n#include <grpc++\/create_channel.h>\n\nnamespace lightstep {\n\nstd::string hostPortOf(const TracerOptions& options) {\n  std::ostringstream os;\n  os << options.collector_host << \":\" << options.collector_port;\n  return os.str();\n}\n\nBasicRecorderOptions::BasicRecorderOptions()\n  : time_limit(std::chrono::milliseconds(500)),\n    span_limit(2000),\n    report_timeout(std::chrono::seconds(5)) { }\n\nclass BasicRecorder : public Recorder {\npublic:\n  BasicRecorder(const TracerImpl& impl, const BasicRecorderOptions& options);\n\n  ~BasicRecorder() {\n    make_writer_exit();\n    writer_.join();\n  }\n\n  void RecordSpan(collector::Span&& span) override {\n    MutexLock lock(write_mutex_);\n    if (builder_.pendingSpans() >= options_.span_limit) {\n      dropped_spans_++;\n      return;\n    }\n    builder_.addSpan(std::move(span));\n    if (builder_.pendingSpans() >= options_.span_limit) {\n      write_cond_.notify_all();\n    }\n  }\n\n  bool FlushWithTimeout(SystemDuration timeout) override;\n\nprivate:\n  void write();\n  bool write_report(const collector::ReportRequest&);\n  void flush_one();\n\n  \/\/ Forces the writer thread to exit immediately.\n  void make_writer_exit() {\n    MutexLock lock(write_mutex_);\n    write_exit_ = true;\n    write_cond_.notify_all();\n  }\n\n  \/\/ Waits until either the timeout or the writer thread is forced to\n  \/\/ exit.  Returns true if it should continue writing, false if it\n  \/\/ should exit.\n  bool wait_for_next_write(const SteadyClock::time_point &next) {\n    std::unique_lock<std::mutex> lock(write_mutex_);\n    write_cond_.wait_until(lock, next, [this]() {\n  \treturn this->write_exit_ ||\n\t       this->builder_.pendingSpans() >= options_.span_limit;\n      });\n    return !write_exit_;\n  }\n    \n  const TracerImpl& tracer_;\n  const BasicRecorderOptions options_;\n\n  \/\/ Writer state.\n  std::mutex write_mutex_;\n  std::condition_variable write_cond_;\n  bool write_exit_;\n  std::thread writer_;\n\n  \/\/ Buffer state (protected by write_mutex_).\n  ReportBuilder builder_;\n  collector::ReportRequest inflight_;\n  size_t flushed_seqno_;\n  size_t encoding_seqno_;\n  size_t dropped_spans_;\n\n  \/\/ Collector service stub.\n  collector::CollectorService::Stub client_;\n};\n\nBasicRecorder::BasicRecorder(const TracerImpl& tracer, const BasicRecorderOptions& options)\n  : tracer_(tracer),\n    options_(options),\n    write_exit_(false),\n    builder_(tracer),\n    flushed_seqno_(0),\n    encoding_seqno_(1),\n    dropped_spans_(0),\n    client_(grpc::CreateChannel(hostPortOf(tracer.options()),\n\t\t\t\t(tracer.options().collector_encryption == \"tls\") ?\n\t\t\t\tgrpc::SslCredentials(grpc::SslCredentialsOptions()) :\n\t\t\t\tgrpc::InsecureChannelCredentials())) {\n      writer_ = std::thread(&BasicRecorder::write, this);\n    }\n\nvoid BasicRecorder::write() {\n  auto next = SteadyClock::now() + options_.time_limit;\n\n  while (wait_for_next_write(next)) {\n    flush_one();\n\n    auto end = SteadyClock::now();\n    auto elapsed = end - next;\n\n    if (elapsed > options_.time_limit) {\n      next = end;\n    } else {\n      next = end + options_.time_limit - elapsed;\n    }\n  }\n}\n\nvoid BasicRecorder::flush_one() {\n  size_t seq;\n  size_t save_dropped;\n  size_t save_pending;\n  {\n    \/\/ Swap the pending encoder with the inflight encoder, then use\n    \/\/ inflight without a lock. Assumption is that this thread is the\n    \/\/ only place inflight_ is used.\n    MutexLock lock(write_mutex_);\n    save_pending = builder_.pendingSpans();\n    if (save_pending == 0) {\n      return;\n    }\n    \/\/ TODO Compute and set timestamp_offset_micros\n    save_dropped = dropped_spans_;\n    builder_.setPendingClientDroppedSpans(save_dropped);\n    dropped_spans_ = 0;\n    std::swap(builder_.pending(), inflight_);\n    ++encoding_seqno_;\n  }\n  bool success = write_report(inflight_);\n  {\n    MutexLock lock(write_mutex_);\n    ++flushed_seqno_;\n    write_cond_.notify_all();\n    inflight_.Clear();\n\n    if (!success) {\n      dropped_spans_ += save_dropped + save_pending;\n    }\n  }\n}\n\nbool BasicRecorder::write_report(const collector::ReportRequest& report) {\n  grpc::ClientContext context;\n  collector::ReportResponse resp;\n  context.set_fail_fast(true);\n  context.set_deadline(SystemClock::now() + options_.report_timeout);\n  grpc::Status status = client_.Report(&context, report, &resp);\n  if (!status.ok()) {\n    std::cout << \"Report RPC failed: \" << status.error_message();\n    \/\/ TODO Put some of these back into a buffer, etc. (Presently they all drop.)\n    return false;\n  }\n  \/\/ TODO Use response.\n  return true;\n}\n\nbool BasicRecorder::FlushWithTimeout(SystemDuration timeout) {\n  \/\/ Note: there is no effort made to speed up the flush when\n  \/\/ requested, it simply waits for the regularly scheduled flush\n  \/\/ operations to clear out all the presently pending data.\n  std::unique_lock<std::mutex> lock(write_mutex_);\n\n  bool has_encoded = builder_.pendingSpans() != 0;\n\n  if (!has_encoded && encoding_seqno_ == 1 + flushed_seqno_) {\n    return true;\n  }\n\n  size_t wait_seq = encoding_seqno_ - (has_encoded ? 0 : 1);\n\n  return write_cond_.wait_for(lock, timeout, [this, wait_seq]() {\n    return this->flushed_seqno_ >= wait_seq;\n  });\n}\n\nTracer NewLightStepTracer(const TracerOptions& topts,\n\t\t\t  const BasicRecorderOptions& bopts) {\n  ImplPtr impl(new TracerImpl(topts));\n  impl->set_recorder(std::unique_ptr<Recorder>(new BasicRecorder(*impl, bopts)));\n  return Tracer(impl);\n}\n\n}  \/\/ namespace lightstep\n<|endoftext|>"}
{"text":"<commit_before>\/*-----------------------------------------------------------------------------\n This source file is a part of Hopsan\n\n Copyright (c) 2009 to present year, Hopsan Group\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 For license details and information about the Hopsan Group see the files\n GPLv3 and HOPSANGROUP in the Hopsan source code root directory\n\n For author and contributor information see the AUTHORS file\n-----------------------------------------------------------------------------*\/\n\n\/\/!\n\/\/! @file   NodeRWHelpfuncs.h\n\/\/! @author peter.nordin@liu.se\n\/\/! @date   2015-06-25\n\/\/! @brief Contains help functions for more convenient read and write access to nodes\n\/\/!\n\/\/$Id$\n\n#ifndef NODERWHELPFUNCS_HPP\n#define NODERWHELPFUNCS_HPP\n\n#include \"Nodes.h\"\n#include \"Port.h\"\n\nnamespace hopsan {\n\n\/\/ ---------------------------------------------------------------------\n\/\/ Signal Node Access (input output variables)\n\/\/ ---------------------------------------------------------------------\n\ninline double readSignalPort(Port *pPort)\n{\n    return pPort->readNode(NodeSignal::Value);\n}\n\ninline double readInputVariable(Port *pPort)\n{\n    return readSignalPort(pPort);\n}\n\n\/\/inline double readOutputVariable(Port *pPort)\n\/\/{\n\/\/    return readSignalPort(pPort);\n\/\/}\n\ninline void readSignalPort(Port *pPort, double &y)\n{\n    y = pPort->readNode(NodeSignal::Value);\n}\n\ninline void readInputVariable(Port *pPort, double &y)\n{\n    readSignalPort(pPort, y);\n}\n\ninline void writeSignalPort(Port *pPort, const double y)\n{\n    pPort->writeNode(NodeSignal::Value, y);\n}\n\ninline void writeOutputVariable(Port *pPort, const double y)\n{\n    writeSignalPort(pPort, y);\n}\n\n\/\/inline double writeInputVariable(Port *pPort)\n\/\/{\n\/\/    return writeSignalPort(pPort);\n\/\/}\n\n\n\n\/\/ ---------------------------------------------------------------------\n\/\/ Hydraulic Node Access\n\/\/ ---------------------------------------------------------------------\n\nclass HydraulicNodeDataValueStructT\n{\npublic:\n    double q;\n    double p;\n    double c;\n    double Zc;\n};\n\nclass HydraulicNodeDataPointerStructT\n{\npublic:\n    double *pQ;\n    double *pP;\n    double *pC;\n    double *pZc;\n\n    inline double q() const\n    {\n        return *pQ;\n    }\n\n    inline double p() const\n    {\n        return *pP;\n    }\n\n    inline double c() const\n    {\n        return *pC;\n    }\n\n    inline double Zc() const\n    {\n        return *pZc;\n    }\n\n    inline double &rq()\n    {\n        return *pQ;\n    }\n\n    inline double &rp()\n    {\n        return *pP;\n    }\n\n    inline double &rc()\n    {\n        return *pC;\n    }\n\n    inline double &rZc()\n    {\n        return *pZc;\n    }\n};\n\ninline void readHydraulicPort_pq(Port *pPort, double &p, double &q)\n{\n    const std::vector<double> &rData = pPort->getNodeDataVector();\n    q = rData[NodeHydraulic::Flow];\n    p = rData[NodeHydraulic::Pressure];\n}\n\ninline void readHydraulicPort_cZc(Port *pPort, double &c, double &Zc)\n{\n    const std::vector<double> &rData = pPort->getNodeDataVector();\n    c = rData[NodeHydraulic::WaveVariable];\n    Zc = rData[NodeHydraulic::CharImpedance];\n}\n\ninline void readHydraulicPort_all(Port *pPort, double &p, double &q, double &c, double &Zc)\n{\n    const std::vector<double> &rData = pPort->getNodeDataVector();\n    q = rData[NodeHydraulic::Flow];\n    p = rData[NodeHydraulic::Pressure];\n    c = rData[NodeHydraulic::WaveVariable];\n    Zc = rData[NodeHydraulic::CharImpedance];\n}\n\ninline void readHydraulicPort_all(Port *pPort, HydraulicNodeDataValueStructT &rValues)\n{\n    const std::vector<double> &rData = pPort->getNodeDataVector();\n    rValues.q = rData[NodeHydraulic::Flow];\n    rValues.p = rData[NodeHydraulic::Pressure];\n    rValues.c = rData[NodeHydraulic::WaveVariable];\n    rValues.Zc = rData[NodeHydraulic::CharImpedance];\n}\n\ninline void getHydraulicPortNodeDataPointers(Port *pPort, HydraulicNodeDataPointerStructT &rPointers)\n{\n    rPointers.pQ  = pPort->getNodeDataPtr(NodeHydraulic::Flow, 0);\n    rPointers.pP  = pPort->getNodeDataPtr(NodeHydraulic::Pressure, 0);\n    rPointers.pC  = pPort->getNodeDataPtr(NodeHydraulic::WaveVariable, 0);\n    rPointers.pZc = pPort->getNodeDataPtr(NodeHydraulic::CharImpedance, 0);\n}\n\ninline void getHydraulicMultiPortNodeDataPointers(Port *pMainPort, const size_t subPortIdx, HydraulicNodeDataPointerStructT &rPointers)\n{\n    rPointers.pQ  = pMainPort->getNodeDataPtr(NodeHydraulic::Flow, subPortIdx);\n    rPointers.pP  = pMainPort->getNodeDataPtr(NodeHydraulic::Pressure, subPortIdx);\n    rPointers.pC  = pMainPort->getNodeDataPtr(NodeHydraulic::WaveVariable, subPortIdx);\n    rPointers.pZc = pMainPort->getNodeDataPtr(NodeHydraulic::CharImpedance, subPortIdx);\n}\n\ninline void getHydraulicMultiPortNodeDataPointers(Port *pMainPort, std::vector<HydraulicNodeDataPointerStructT> &rPointers)\n{\n    \/\/ nsp = numSubPorts\n    \/\/ spi = subPortIndex\n    const size_t nsp = pMainPort->getNumPorts();\n    rPointers.resize(nsp);\n    for (size_t spi=0; spi<nsp; ++spi)\n    {\n        getHydraulicMultiPortNodeDataPointers(pMainPort, spi, rPointers[spi]);\n    }\n}\n\ninline void writeHydraulicPort_pq(Port *pPort, const double p, const double q)\n{\n    std::vector<double> &rData = pPort->getNodeDataVector();\n    rData[NodeHydraulic::Flow] = q;\n    rData[NodeHydraulic::Pressure] = p;\n}\n\ninline void writeHydraulicMultiPort_pq(Port *pPort, const size_t subPortIdx, const double p, const double q)\n{\n    std::vector<double> &rData = pPort->getNodeDataVector(subPortIdx);\n    rData[NodeHydraulic::Flow] = q;\n    rData[NodeHydraulic::Pressure] = p;\n}\n\ninline void writeHydraulicPort_cZc(Port *pPort, const double c, const double Zc)\n{\n    std::vector<double> &rData = pPort->getNodeDataVector();\n    rData[NodeHydraulic::WaveVariable] = c;\n    rData[NodeHydraulic::CharImpedance] = Zc;\n}\n\ninline void writeHydraulicMultiPort_cZc(Port *pPort, const size_t subPortIdx, const double c, const double Zc)\n{\n    std::vector<double> &rData = pPort->getNodeDataVector(subPortIdx);\n    rData[NodeHydraulic::WaveVariable] = c;\n    rData[NodeHydraulic::CharImpedance] = Zc;\n}\n\ninline void writeHydraulicPort_all(Port *pPort, const double p, const double q, const double c, const double Zc)\n{\n    std::vector<double> &rData = pPort->getNodeDataVector();\n    rData[NodeHydraulic::Flow] = q;\n    rData[NodeHydraulic::Pressure] = p;\n    rData[NodeHydraulic::WaveVariable] = c;\n    rData[NodeHydraulic::CharImpedance] = Zc;\n}\n\ninline void writeHydraulicPort_all(Port *pPort, const HydraulicNodeDataValueStructT &rValues)\n{\n    std::vector<double> &rData = pPort->getNodeDataVector();\n    rData[NodeHydraulic::Flow] = rValues.q;\n    rData[NodeHydraulic::Pressure] = rValues.p;\n    rData[NodeHydraulic::WaveVariable] = rValues.c;\n    rData[NodeHydraulic::CharImpedance] = rValues.Zc;\n}\n\n\n\n\/\/ ---------------------------------------------------------------------\n\/\/ Mechanic Node Access\n\/\/ ---------------------------------------------------------------------\n\ntypedef struct\n{\n    double v;\n    double f;\n    double x;\n    double c;\n    double Zc;\n    double me;\n} MechanicNodeDataValueStructT;\n\ninline void readMechanicPort_vfx(Port *pPort, double &v, double &f, double &x)\n{\n    const std::vector<double> &rData = pPort->getNodeDataVector();\n    v = rData[NodeMechanic::Velocity];\n    f = rData[NodeMechanic::Force];\n    x = rData[NodeMechanic::Position];\n}\n\ninline void readMechanicPort_cZc(Port *pPort, double &c, double &Zc)\n{\n    const std::vector<double> &rData = pPort->getNodeDataVector();\n    c = rData[NodeMechanic::WaveVariable];\n    Zc = rData[NodeMechanic::CharImpedance];\n}\n\ninline void readMechanicPort_all(Port *pPort, double &v, double &f, double &x, double &c, double &Zc, double &me)\n{\n    const std::vector<double> &rData = pPort->getNodeDataVector();\n    v = rData[NodeMechanic::Velocity];\n    f = rData[NodeMechanic::Force];\n    x = rData[NodeMechanic::Position];\n    c = rData[NodeMechanic::WaveVariable];\n    Zc = rData[NodeMechanic::CharImpedance];\n    me = rData[NodeMechanic::EquivalentMass];\n}\n\ninline void readMechanicPort_all(Port *pPort, MechanicNodeDataValueStructT &rValues)\n{\n    const std::vector<double> &rData = pPort->getNodeDataVector();\n    rValues.v = rData[NodeMechanic::Velocity];\n    rValues.f = rData[NodeMechanic::Force];\n    rValues.x = rData[NodeMechanic::Position];\n    rValues.c = rData[NodeMechanic::WaveVariable];\n    rValues.Zc = rData[NodeMechanic::CharImpedance];\n    rValues.me = rData[NodeMechanic::EquivalentMass];\n}\n\ninline void writeMechanicPort_vfx(Port *pPort, const double v, const double f, const double x)\n{\n    std::vector<double> &rData = pPort->getNodeDataVector();\n    rData[NodeMechanic::Velocity] = v;\n    rData[NodeMechanic::Force] = f;\n    rData[NodeMechanic::Position] = x;\n}\n\ninline void writeMechanicPort_cZc(Port *pPort, const double c, const double Zc)\n{\n    std::vector<double> &rData = pPort->getNodeDataVector();\n    rData[NodeMechanic::WaveVariable] = c;\n    rData[NodeMechanic::CharImpedance] = Zc;\n}\n\ninline void writeMechanicPort_all(Port *pPort, const double v, const double f, const double x, const double c, const double Zc, const double me)\n{\n    std::vector<double> &rData = pPort->getNodeDataVector();\n    rData[NodeMechanic::Velocity] = v;\n    rData[NodeMechanic::Force] = f;\n    rData[NodeMechanic::Position] = x;\n    rData[NodeMechanic::WaveVariable] = c;\n    rData[NodeMechanic::CharImpedance] = Zc;\n    rData[NodeMechanic::EquivalentMass] = me;\n}\n\ninline void writeMechanicPort_all(Port *pPort, const MechanicNodeDataValueStructT &rValues)\n{\n    std::vector<double> &rData = pPort->getNodeDataVector();\n    rData[NodeMechanic::Velocity] = rValues.v;\n    rData[NodeMechanic::Force] = rValues.f;\n    rData[NodeMechanic::Position] = rValues.x;\n    rData[NodeMechanic::WaveVariable] = rValues.c;\n    rData[NodeMechanic::CharImpedance] = rValues.Zc;\n    rData[NodeMechanic::EquivalentMass] = rValues.me;\n}\n\n}\n\n#endif \/\/ NODERWHELPFUNCS_HPP\n\n<commit_msg>More convenience function for hydraulic multiports<commit_after>\/*-----------------------------------------------------------------------------\n This source file is a part of Hopsan\n\n Copyright (c) 2009 to present year, Hopsan Group\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 For license details and information about the Hopsan Group see the files\n GPLv3 and HOPSANGROUP in the Hopsan source code root directory\n\n For author and contributor information see the AUTHORS file\n-----------------------------------------------------------------------------*\/\n\n\/\/!\n\/\/! @file   NodeRWHelpfuncs.h\n\/\/! @author peter.nordin@liu.se\n\/\/! @date   2015-06-25\n\/\/! @brief Contains help functions for more convenient read and write access to nodes\n\/\/!\n\/\/$Id$\n\n#ifndef NODERWHELPFUNCS_HPP\n#define NODERWHELPFUNCS_HPP\n\n#include \"Nodes.h\"\n#include \"Port.h\"\n\nnamespace hopsan {\n\n\/\/ ---------------------------------------------------------------------\n\/\/ Signal Node Access (input output variables)\n\/\/ ---------------------------------------------------------------------\n\ninline double readSignalPort(Port *pPort)\n{\n    return pPort->readNode(NodeSignal::Value);\n}\n\ninline double readInputVariable(Port *pPort)\n{\n    return readSignalPort(pPort);\n}\n\n\/\/inline double readOutputVariable(Port *pPort)\n\/\/{\n\/\/    return readSignalPort(pPort);\n\/\/}\n\ninline void readSignalPort(Port *pPort, double &y)\n{\n    y = pPort->readNode(NodeSignal::Value);\n}\n\ninline void readInputVariable(Port *pPort, double &y)\n{\n    readSignalPort(pPort, y);\n}\n\ninline void writeSignalPort(Port *pPort, const double y)\n{\n    pPort->writeNode(NodeSignal::Value, y);\n}\n\ninline void writeOutputVariable(Port *pPort, const double y)\n{\n    writeSignalPort(pPort, y);\n}\n\n\/\/inline double writeInputVariable(Port *pPort)\n\/\/{\n\/\/    return writeSignalPort(pPort);\n\/\/}\n\n\n\n\/\/ ---------------------------------------------------------------------\n\/\/ Hydraulic Node Access\n\/\/ ---------------------------------------------------------------------\n\nclass HydraulicNodeDataValueStructT\n{\npublic:\n    double q;\n    double p;\n    double c;\n    double Zc;\n};\n\nclass HydraulicNodeDataPointerStructT\n{\npublic:\n    double *pQ;\n    double *pP;\n    double *pC;\n    double *pZc;\n\n    inline double q() const\n    {\n        return *pQ;\n    }\n\n    inline double p() const\n    {\n        return *pP;\n    }\n\n    inline double c() const\n    {\n        return *pC;\n    }\n\n    inline double Zc() const\n    {\n        return *pZc;\n    }\n\n    inline double &rq()\n    {\n        return *pQ;\n    }\n\n    inline double &rp()\n    {\n        return *pP;\n    }\n\n    inline double &rc()\n    {\n        return *pC;\n    }\n\n    inline double &rZc()\n    {\n        return *pZc;\n    }\n};\n\ninline void readHydraulicPort_pq(Port *pPort, double &p, double &q)\n{\n    const std::vector<double> &rData = pPort->getNodeDataVector();\n    q = rData[NodeHydraulic::Flow];\n    p = rData[NodeHydraulic::Pressure];\n}\n\ninline void readHydraulicPort_cZc(Port *pPort, double &c, double &Zc)\n{\n    const std::vector<double> &rData = pPort->getNodeDataVector();\n    c = rData[NodeHydraulic::WaveVariable];\n    Zc = rData[NodeHydraulic::CharImpedance];\n}\n\ninline void readHydraulicPort_all(Port *pPort, double &p, double &q, double &c, double &Zc)\n{\n    const std::vector<double> &rData = pPort->getNodeDataVector();\n    q = rData[NodeHydraulic::Flow];\n    p = rData[NodeHydraulic::Pressure];\n    c = rData[NodeHydraulic::WaveVariable];\n    Zc = rData[NodeHydraulic::CharImpedance];\n}\n\ninline void readHydraulicPort_all(Port *pPort, HydraulicNodeDataValueStructT &rValues)\n{\n    const std::vector<double> &rData = pPort->getNodeDataVector();\n    rValues.q = rData[NodeHydraulic::Flow];\n    rValues.p = rData[NodeHydraulic::Pressure];\n    rValues.c = rData[NodeHydraulic::WaveVariable];\n    rValues.Zc = rData[NodeHydraulic::CharImpedance];\n}\n\ninline void getHydraulicPortNodeDataPointers(Port *pPort, HydraulicNodeDataPointerStructT &rPointers)\n{\n    rPointers.pQ  = pPort->getNodeDataPtr(NodeHydraulic::Flow, 0);\n    rPointers.pP  = pPort->getNodeDataPtr(NodeHydraulic::Pressure, 0);\n    rPointers.pC  = pPort->getNodeDataPtr(NodeHydraulic::WaveVariable, 0);\n    rPointers.pZc = pPort->getNodeDataPtr(NodeHydraulic::CharImpedance, 0);\n}\n\ninline void getHydraulicMultiPortValues_pq(Port *pMainPort, const size_t subPortIdx, std::vector<HydraulicNodeDataValueStructT> &rValues)\n{\n    const std::vector<double> &rData = pMainPort->getNodeDataVector(subPortIdx);\n    rValues[subPortIdx].q = rData[NodeHydraulic::Flow];\n    rValues[subPortIdx].p = rData[NodeHydraulic::Pressure];\n\/\/    rValues[subPortIdx].c = rData[NodeHydraulic::WaveVariable];\n\/\/    rValues[subPortIdx].Zc = rData[NodeHydraulic::CharImpedance];\n}\n\ninline void getHydraulicMultiPortValues_cZc(Port *pMainPort, const size_t subPortIdx, std::vector<HydraulicNodeDataValueStructT> &rValues)\n{\n    const std::vector<double> &rData = pMainPort->getNodeDataVector(subPortIdx);\n\/\/    rValues[subPortIdx].q = rData[NodeHydraulic::Flow];\n\/\/    rValues[subPortIdx].p = rData[NodeHydraulic::Pressure];\n    rValues[subPortIdx].c = rData[NodeHydraulic::WaveVariable];\n    rValues[subPortIdx].Zc = rData[NodeHydraulic::CharImpedance];\n}\n\ninline void readHydraulicMultiPortValues_all(Port *pMainPort, const size_t subPortIdx, std::vector<HydraulicNodeDataValueStructT> &rValues)\n{\n    const std::vector<double> &rData = pMainPort->getNodeDataVector(subPortIdx);\n    rValues[subPortIdx].q = rData[NodeHydraulic::Flow];\n    rValues[subPortIdx].p = rData[NodeHydraulic::Pressure];\n    rValues[subPortIdx].c = rData[NodeHydraulic::WaveVariable];\n    rValues[subPortIdx].Zc = rData[NodeHydraulic::CharImpedance];\n}\n\ninline void readHydraulicMultiPortValues_all(Port *pMainPort, std::vector<HydraulicNodeDataValueStructT> &rValues)\n{\n    for (size_t i=0; i<pMainPort->getNumPorts(); ++i)\n    {\n        const std::vector<double> &rData = pMainPort->getNodeDataVector(i);\n        rValues[i].q = rData[NodeHydraulic::Flow];\n        rValues[i].p = rData[NodeHydraulic::Pressure];\n        rValues[i].c = rData[NodeHydraulic::WaveVariable];\n        rValues[i].Zc = rData[NodeHydraulic::CharImpedance];\n    }\n}\n\ninline void getHydraulicMultiPortNodeDataPointers(Port *pMainPort, const size_t subPortIdx, HydraulicNodeDataPointerStructT &rPointers)\n{\n    rPointers.pQ  = pMainPort->getNodeDataPtr(NodeHydraulic::Flow, subPortIdx);\n    rPointers.pP  = pMainPort->getNodeDataPtr(NodeHydraulic::Pressure, subPortIdx);\n    rPointers.pC  = pMainPort->getNodeDataPtr(NodeHydraulic::WaveVariable, subPortIdx);\n    rPointers.pZc = pMainPort->getNodeDataPtr(NodeHydraulic::CharImpedance, subPortIdx);\n}\n\ninline void getHydraulicMultiPortNodeDataPointers(Port *pMainPort, std::vector<HydraulicNodeDataPointerStructT> &rPointers)\n{\n    \/\/ nsp = numSubPorts\n    \/\/ spi = subPortIndex\n    const size_t nsp = pMainPort->getNumPorts();\n    rPointers.resize(nsp);\n    for (size_t spi=0; spi<nsp; ++spi)\n    {\n        getHydraulicMultiPortNodeDataPointers(pMainPort, spi, rPointers[spi]);\n    }\n}\n\ninline void writeHydraulicPort_pq(Port *pPort, const double p, const double q)\n{\n    std::vector<double> &rData = pPort->getNodeDataVector();\n    rData[NodeHydraulic::Flow] = q;\n    rData[NodeHydraulic::Pressure] = p;\n}\n\ninline void writeHydraulicMultiPort_pq(Port *pPort, const size_t subPortIdx, const double p, const double q)\n{\n    std::vector<double> &rData = pPort->getNodeDataVector(subPortIdx);\n    rData[NodeHydraulic::Flow] = q;\n    rData[NodeHydraulic::Pressure] = p;\n}\n\ninline void writeHydraulicPort_cZc(Port *pPort, const double c, const double Zc)\n{\n    std::vector<double> &rData = pPort->getNodeDataVector();\n    rData[NodeHydraulic::WaveVariable] = c;\n    rData[NodeHydraulic::CharImpedance] = Zc;\n}\n\ninline void writeHydraulicMultiPort_cZc(Port *pPort, const size_t subPortIdx, const double c, const double Zc)\n{\n    std::vector<double> &rData = pPort->getNodeDataVector(subPortIdx);\n    rData[NodeHydraulic::WaveVariable] = c;\n    rData[NodeHydraulic::CharImpedance] = Zc;\n}\n\ninline void writeHydraulicPort_all(Port *pPort, const double p, const double q, const double c, const double Zc)\n{\n    std::vector<double> &rData = pPort->getNodeDataVector();\n    rData[NodeHydraulic::Flow] = q;\n    rData[NodeHydraulic::Pressure] = p;\n    rData[NodeHydraulic::WaveVariable] = c;\n    rData[NodeHydraulic::CharImpedance] = Zc;\n}\n\ninline void writeHydraulicPort_all(Port *pPort, const HydraulicNodeDataValueStructT &rValues)\n{\n    std::vector<double> &rData = pPort->getNodeDataVector();\n    rData[NodeHydraulic::Flow] = rValues.q;\n    rData[NodeHydraulic::Pressure] = rValues.p;\n    rData[NodeHydraulic::WaveVariable] = rValues.c;\n    rData[NodeHydraulic::CharImpedance] = rValues.Zc;\n}\n\n\n\n\/\/ ---------------------------------------------------------------------\n\/\/ Mechanic Node Access\n\/\/ ---------------------------------------------------------------------\n\ntypedef struct\n{\n    double v;\n    double f;\n    double x;\n    double c;\n    double Zc;\n    double me;\n} MechanicNodeDataValueStructT;\n\ninline void readMechanicPort_vfx(Port *pPort, double &v, double &f, double &x)\n{\n    const std::vector<double> &rData = pPort->getNodeDataVector();\n    v = rData[NodeMechanic::Velocity];\n    f = rData[NodeMechanic::Force];\n    x = rData[NodeMechanic::Position];\n}\n\ninline void readMechanicPort_cZc(Port *pPort, double &c, double &Zc)\n{\n    const std::vector<double> &rData = pPort->getNodeDataVector();\n    c = rData[NodeMechanic::WaveVariable];\n    Zc = rData[NodeMechanic::CharImpedance];\n}\n\ninline void readMechanicPort_all(Port *pPort, double &v, double &f, double &x, double &c, double &Zc, double &me)\n{\n    const std::vector<double> &rData = pPort->getNodeDataVector();\n    v = rData[NodeMechanic::Velocity];\n    f = rData[NodeMechanic::Force];\n    x = rData[NodeMechanic::Position];\n    c = rData[NodeMechanic::WaveVariable];\n    Zc = rData[NodeMechanic::CharImpedance];\n    me = rData[NodeMechanic::EquivalentMass];\n}\n\ninline void readMechanicPort_all(Port *pPort, MechanicNodeDataValueStructT &rValues)\n{\n    const std::vector<double> &rData = pPort->getNodeDataVector();\n    rValues.v = rData[NodeMechanic::Velocity];\n    rValues.f = rData[NodeMechanic::Force];\n    rValues.x = rData[NodeMechanic::Position];\n    rValues.c = rData[NodeMechanic::WaveVariable];\n    rValues.Zc = rData[NodeMechanic::CharImpedance];\n    rValues.me = rData[NodeMechanic::EquivalentMass];\n}\n\ninline void writeMechanicPort_vfx(Port *pPort, const double v, const double f, const double x)\n{\n    std::vector<double> &rData = pPort->getNodeDataVector();\n    rData[NodeMechanic::Velocity] = v;\n    rData[NodeMechanic::Force] = f;\n    rData[NodeMechanic::Position] = x;\n}\n\ninline void writeMechanicPort_cZc(Port *pPort, const double c, const double Zc)\n{\n    std::vector<double> &rData = pPort->getNodeDataVector();\n    rData[NodeMechanic::WaveVariable] = c;\n    rData[NodeMechanic::CharImpedance] = Zc;\n}\n\ninline void writeMechanicPort_all(Port *pPort, const double v, const double f, const double x, const double c, const double Zc, const double me)\n{\n    std::vector<double> &rData = pPort->getNodeDataVector();\n    rData[NodeMechanic::Velocity] = v;\n    rData[NodeMechanic::Force] = f;\n    rData[NodeMechanic::Position] = x;\n    rData[NodeMechanic::WaveVariable] = c;\n    rData[NodeMechanic::CharImpedance] = Zc;\n    rData[NodeMechanic::EquivalentMass] = me;\n}\n\ninline void writeMechanicPort_all(Port *pPort, const MechanicNodeDataValueStructT &rValues)\n{\n    std::vector<double> &rData = pPort->getNodeDataVector();\n    rData[NodeMechanic::Velocity] = rValues.v;\n    rData[NodeMechanic::Force] = rValues.f;\n    rData[NodeMechanic::Position] = rValues.x;\n    rData[NodeMechanic::WaveVariable] = rValues.c;\n    rData[NodeMechanic::CharImpedance] = rValues.Zc;\n    rData[NodeMechanic::EquivalentMass] = rValues.me;\n}\n\n}\n\n#endif \/\/ NODERWHELPFUNCS_HPP\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 \"HilbertValue.h\"\n\nuint64_t HilbertCode::GetHilbertNumberForCoordinate(\n    const FixedPointCoordinate & current_coordinate\n) {\n    unsigned location[2];\n    location[0] = current_coordinate.lat+( 90*COORDINATE_PRECISION);\n    location[1] = current_coordinate.lon+(180*COORDINATE_PRECISION);\n\n    TransposeCoordinate(location);\n    const uint64_t result = BitInterleaving(location[0], location[1]);\n    return result;\n}\n\nuint64_t HilbertCode::BitInterleaving(const uint32_t a, const uint32_t b) {\n    uint64_t result = 0;\n    for(int8_t index = 31; index >= 0; --index){\n        result |= (a >> index) & 1;\n        result <<= 1;\n        result |= (b >> index) & 1;\n        if(0 != index){\n            result <<= 1;\n        }\n    }\n    return result;\n}\n\nvoid HilbertCode::TransposeCoordinate( uint32_t * X) {\n    uint32_t M = 1 << (32-1), P, Q, t;\n    int i;\n    \/\/ Inverse undo\n    for( Q = M; Q > 1; Q >>= 1 ) {\n        P=Q-1;\n        for( i = 0; i < 2; ++i ) {\n            if( X[i] & Q ) {\n                X[0] ^= P; \/\/ invert\n            } else {\n                t = (X[0]^X[i]) & P;\n                X[0] ^= t;\n                X[i] ^= t;\n            }\n        } \/\/ exchange\n    }\n    \/\/ Gray encode\n    for( i = 1; i < 2; ++i ) {\n        X[i] ^= X[i-1];\n    }\n    t=0;\n    for( Q = M; Q > 1; Q >>= 1 ) {\n        if( X[2-1] & Q ) {\n            t ^= Q-1;\n        }\n    } \/\/check if this for loop is wrong\n    for( i = 0; i < 2; ++i ) {\n        X[i] ^= t;\n    }\n}\n<commit_msg>move bit-wise operator out of conditions<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 \"HilbertValue.h\"\n\nuint64_t HilbertCode::GetHilbertNumberForCoordinate(\n    const FixedPointCoordinate & current_coordinate\n) {\n    unsigned location[2];\n    location[0] = current_coordinate.lat+( 90*COORDINATE_PRECISION);\n    location[1] = current_coordinate.lon+(180*COORDINATE_PRECISION);\n\n    TransposeCoordinate(location);\n    const uint64_t result = BitInterleaving(location[0], location[1]);\n    return result;\n}\n\nuint64_t HilbertCode::BitInterleaving(const uint32_t a, const uint32_t b) {\n    uint64_t result = 0;\n    for(int8_t index = 31; index >= 0; --index){\n        result |= (a >> index) & 1;\n        result <<= 1;\n        result |= (b >> index) & 1;\n        if(0 != index){\n            result <<= 1;\n        }\n    }\n    return result;\n}\n\nvoid HilbertCode::TransposeCoordinate( uint32_t * X) {\n    uint32_t M = 1 << (32-1), P, Q, t;\n    int i;\n    \/\/ Inverse undo\n    for( Q = M; Q > 1; Q >>= 1 ) {\n        P=Q-1;\n        for( i = 0; i < 2; ++i ) {\n\n            const bool condition = (X[i] & Q);\n            if( condition ) {\n                X[0] ^= P; \/\/ invert\n            } else {\n                t = (X[0]^X[i]) & P;\n                X[0] ^= t;\n                X[i] ^= t;\n            }\n        } \/\/ exchange\n    }\n    \/\/ Gray encode\n    for( i = 1; i < 2; ++i ) {\n        X[i] ^= X[i-1];\n    }\n    t=0;\n    for( Q = M; Q > 1; Q >>= 1 ) {\n        const bool condition = (X[2-1] & Q);\n        if( condition ) {\n            t ^= Q-1;\n        }\n    } \/\/check if this for loop is wrong\n    for( i = 0; i < 2; ++i ) {\n        X[i] ^= t;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* -*-  mode: c++; c-default-style: \"google\"; indent-tabs-mode: nil -*- *\/\n\/\/! CompressiblePorosityModel : a simple model for allowing porosity to vary with pressure\n\n\/*\n  Authors: Ethan Coon (ecoon@lanl.gov)\n*\/\n\n\/*!\nBased on a linear increase, i.e.\n\n$$ \\phi = \\phi_{base} + H(p - p_{atm}) * \\alpha $$\n\nwhere $H$ is the heaviside function and $\\alpha$ is the provided\ncompressibility.  If the inflection point is set to zero, the above function\nis exact.  However, then the porosity function is not smooth (has\ndiscontinuous derivatives).\n  \n* `\"pore compressibility [Pa^-1]`\" ``[double]``\n\n  $\\alpha$ as described above\n  \n* `\"pore compressibility inflection point [Pa]`\" ``[double]`` **1000**\n\n  The inflection point above which the function is linear.\n\n.. code-block::xml  \n  <!-- Native Spec Example -->\n  <ParameterList name=\"soil\" type=\"ParameterList\">\n    <Parameter name=\"region\" type=\"string\" value=\"soil\" \/>\n    <Parameter name=\"pore compressibility [Pa^-1]\" type=\"double\" value=\"1.e-9\" \/>\n    <Parameter name=\"pore compressibility inflection point [Pa]\" type=\"double\" value=\"1000.\" \/>\n  <\/ParameterList>\n\n*\/\n\n\n#ifndef AMANZI_FLOWRELATIONS_COMPRESSIBLE_POROSITY_MODEL_HH_\n#define AMANZI_FLOWRELATIONS_COMPRESSIBLE_POROSITY_MODEL_HH_\n\n#include \"Teuchos_ParameterList.hpp\"\n#include \"dbc.hh\"\n\nnamespace Amanzi {\nnamespace Flow {\nnamespace FlowRelations {\n\nclass CompressiblePorosityModel {\n public:\n  explicit\n  CompressiblePorosityModel(Teuchos::ParameterList& plist) :\n      plist_(plist) {\n    InitializeFromPlist_();\n  }\n\n  virtual double Porosity(double base_poro, double pres, double patm) {\n    double poro = base_poro;\n    double p_over = pres - patm;\n    if (p_over > cutoff_) {\n      poro = base_poro + compressibility_ * ( cutoff_ \/ 2. + (p_over - cutoff_));\n    } else if (p_over > 0.) {\n      poro = base_poro + compressibility_ * (std::pow(p_over,2.) \/ 2. \/ cutoff_);\n    }\n\n    return poro > 1. ? 1. : poro;\n  }\n\n  virtual double DPorosityDPressure(double base_poro, double pres, double patm) {\n    double p_over = pres - patm;\n    double poro = Porosity(base_poro, pres, patm);\n    if (poro == 1.) {\n      return 0.;\n    } else if (p_over > cutoff_) {\n      return compressibility_;\n    } else if (p_over > 0.) {\n      return compressibility_ * p_over \/ cutoff_;\n    }\n\n    return 0.;\n  }\n\n  virtual double DPorosityDBasePorosity(double base_poro, double pres, double patm) {\n    return pres > patm ? (Porosity(base_poro, pres, patm) > 1.0 ? 0. : 1.) : 1.;\n  }\n\n protected:\n  void InitializeFromPlist_() {\n    compressibility_ = plist_.get<double>(\"pore compressibility [Pa^-1]\");\n    cutoff_ = plist_.get<double>(\"pore compressibility inflection point [Pa]\", 1000.);\n  }\n\n protected:\n\n  Teuchos::ParameterList plist_;\n  double compressibility_;\n  double cutoff_;\n\n};\n\n} \/\/ namespace\n} \/\/ namespace\n} \/\/ namespace\n\n#endif\n<commit_msg>tweaks to auto-doc<commit_after>\/* -*-  mode: c++; c-default-style: \"google\"; indent-tabs-mode: nil -*- *\/\n\/\/! A simple model for allowing porosity to vary with pressure.\n\n\/*\n  ATS is released under the three-clause BSD License. \n  The terms of use and \"as is\" disclaimer for this license are \n  provided in the top-level COPYRIGHT file.\n\n  Authors: Ethan Coon (ecoon@lanl.gov)\n*\/\n\n\n\/*!\n\nBased on a linear increase, i.e.\n\n$$ \\phi = \\phi_{base} + H(p - p_{atm}) * \\alpha $$\n\nwhere $H$ is the heaviside function and $\\alpha$ is the provided\ncompressibility.  If the inflection point is set to zero, the above function\nis exact.  However, then the porosity function is not smooth (has\ndiscontinuous derivatives).\n  \n* `\"pore compressibility [Pa^-1]`\" ``[double]``\n\n  $\\alpha$ as described above\n  \n* `\"pore compressibility inflection point [Pa]`\" ``[double]`` **1000**\n\n  The inflection point above which the function is linear.\n\n.. code-block::xml  \n  <!-- Native Spec Example -->\n  <ParameterList name=\"soil\" type=\"ParameterList\">\n    <Parameter name=\"region\" type=\"string\" value=\"soil\" \/>\n    <Parameter name=\"pore compressibility [Pa^-1]\" type=\"double\" value=\"1.e-9\" \/>\n    <Parameter name=\"pore compressibility inflection point [Pa]\" type=\"double\" value=\"1000.\" \/>\n  <\/ParameterList>\n\n*\/\n\n\n#ifndef AMANZI_FLOWRELATIONS_COMPRESSIBLE_POROSITY_MODEL_HH_\n#define AMANZI_FLOWRELATIONS_COMPRESSIBLE_POROSITY_MODEL_HH_\n\n#include \"Teuchos_ParameterList.hpp\"\n#include \"dbc.hh\"\n\nnamespace Amanzi {\nnamespace Flow {\nnamespace FlowRelations {\n\nclass CompressiblePorosityModel {\n public:\n  explicit\n  CompressiblePorosityModel(Teuchos::ParameterList& plist) :\n      plist_(plist) {\n    InitializeFromPlist_();\n  }\n\n  virtual double Porosity(double base_poro, double pres, double patm) {\n    double poro = base_poro;\n    double p_over = pres - patm;\n    if (p_over > cutoff_) {\n      poro = base_poro + compressibility_ * ( cutoff_ \/ 2. + (p_over - cutoff_));\n    } else if (p_over > 0.) {\n      poro = base_poro + compressibility_ * (std::pow(p_over,2.) \/ 2. \/ cutoff_);\n    }\n\n    return poro > 1. ? 1. : poro;\n  }\n\n  virtual double DPorosityDPressure(double base_poro, double pres, double patm) {\n    double p_over = pres - patm;\n    double poro = Porosity(base_poro, pres, patm);\n    if (poro == 1.) {\n      return 0.;\n    } else if (p_over > cutoff_) {\n      return compressibility_;\n    } else if (p_over > 0.) {\n      return compressibility_ * p_over \/ cutoff_;\n    }\n\n    return 0.;\n  }\n\n  virtual double DPorosityDBasePorosity(double base_poro, double pres, double patm) {\n    return pres > patm ? (Porosity(base_poro, pres, patm) > 1.0 ? 0. : 1.) : 1.;\n  }\n\n protected:\n  void InitializeFromPlist_() {\n    compressibility_ = plist_.get<double>(\"pore compressibility [Pa^-1]\");\n    cutoff_ = plist_.get<double>(\"pore compressibility inflection point [Pa]\", 1000.);\n  }\n\n protected:\n\n  Teuchos::ParameterList plist_;\n  double compressibility_;\n  double cutoff_;\n\n};\n\n} \/\/ namespace\n} \/\/ namespace\n} \/\/ namespace\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Small fixes to the QJsonRpcServiceProvider test.<commit_after><|endoftext|>"}
{"text":"<commit_before>#include <llvm\/IR\/IRBuilder.h>\n#include <llvm\/IR\/LLVMContext.h>\n#include <llvm\/IR\/Module.h>\n#include <llvm\/IR\/Verifier.h>\n#include <vector>\n#include <string>\n\n\nstruct LLVMCodeGen {\n  llvm::LLVMContext &Context;\n  llvm::Module &M;\n  llvm::IRBuilder<> &Builder;\n\n  LLVMCodeGen(llvm::LLVMContext &context, llvm::Module &m,\n              llvm::IRBuilder<> &builder)\n      : Context(context), M(m), Builder(builder) {}\n  void dump() const { M.dump(); }\n\n  struct Function {\n    llvm::Function &F;\n    Function(llvm::Function &f) : F(f) {}\n    void verify() const { llvm::verifyFunction(F); }\n  };\n\n  \/\/---------------------------------------------------------------------------\n\n  llvm::Type *int32() const { return Builder.getInt32Ty(); }\n\n  Function mkFunction(std::string fname) {\n    llvm::FunctionType *funcType = llvm::FunctionType::get(int32(), false);\n    llvm::Function *func = llvm::Function::Create(\n        funcType, llvm::Function::ExternalLinkage, fname, &M);\n    return Function{*func};\n  }\n};\n\nstatic llvm::LLVMContext &ContextRef = llvm::getGlobalContext();\nstatic llvm::Module *ModuleOb = new llvm::Module(\"my compiler\", ContextRef);\n\nint main(int argc, char *argv[]) {\n  static llvm::IRBuilder<> BuilderObj(ContextRef);\n  LLVMCodeGen cg(ContextRef, *ModuleOb, BuilderObj);\n  auto f = cg.mkFunction(\"foo\");\n  f.verify();\n  cg.dump();\n  return 0;\n}\n<commit_msg>can add func<commit_after>#include <llvm\/IR\/IRBuilder.h>\n#include <llvm\/IR\/LLVMContext.h>\n#include <llvm\/IR\/Module.h>\n#include <llvm\/IR\/Verifier.h>\n#include <vector>\n#include <string>\n\nstruct LLVMCodeGen {\n  using IRBuilder = llvm::IRBuilder<>;\n  llvm::LLVMContext &Context;\n  llvm::Module &M;\n  IRBuilder &Builder;\n\n  LLVMCodeGen(llvm::LLVMContext &context, llvm::Module &m,\n              llvm::IRBuilder<> &builder)\n      : Context(context), M(m), Builder(builder) {}\n  void dump() const { M.dump(); }\n\n\n  \/\/---------------------------------------------------------------------------\n\n  llvm::Type *int32() const { return Builder.getInt32Ty(); }\n  \n  \/\/---------------------- Function -------------------------------------------\n  \n  struct Function {\n    llvm::Function &F;\n    Function(llvm::Function &f) : F(f) {}\n    void verify() const { llvm::verifyFunction(F); }\n\n    operator llvm::Function *() { return &F; }\n  };\n\n  Function mkFunction(std::string name) {\n    llvm::FunctionType *funcType = llvm::FunctionType::get(int32(), false);\n    llvm::Function *func = llvm::Function::Create(\n        funcType, llvm::Function::ExternalLinkage, name, &M);\n    return Function{*func};\n  }\n\n\n  \/\/------------------- Basic Block -------------------------------------------\n  struct BasicBlock {\n    IRBuilder &Builder;\n    llvm::BasicBlock &BB;\n    BasicBlock(IRBuilder &builder, llvm::BasicBlock &bb)\n        : Builder(builder), BB(bb) {}\n    operator llvm::BasicBlock *() { return &BB; }\n    void set() { Builder.SetInsertPoint(&BB); }\n  };\n\n  BasicBlock mkBasicBlock(Function &func, std::string name) {\n    llvm::BasicBlock *bb = llvm::BasicBlock::Create(Context, name, func);\n    return BasicBlock{Builder, *bb};\n  }\n\n\n};\n\nstatic llvm::LLVMContext &ContextRef = llvm::getGlobalContext();\nstatic llvm::Module *ModuleOb = new llvm::Module(\"my compiler\", ContextRef);\n\nint main(int argc, char *argv[]) {\n  static llvm::IRBuilder<> BuilderObj(ContextRef);\n  LLVMCodeGen cg(ContextRef, *ModuleOb, BuilderObj);\n  auto f = cg.mkFunction(\"foo\");\n\n  auto entry = cg.mkBasicBlock(f, \"entry\");\n  entry.set();\n  f.verify();\n\n  cg.dump();\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"SimpleTransferModule.hpp\"\n\n#include <fstream>\n#include <limits>\n#include <memory>\n#include <new>\n#include <stdexcept>\n#include <string>\n#include <utility>\n\n#include \"core\/config\/exceptions.h\"\n#include \"core\/geometry\/PixelDetectorModel.hpp\"\n#include \"core\/utils\/log.h\"\n#include \"core\/utils\/unit.h\"\n\n#include \"objects\/PixelCharge.hpp\"\n\nusing namespace allpix;\n\n\/\/ constructor to load the module\nSimpleTransferModule::SimpleTransferModule(Configuration config, Messenger* messenger, std::shared_ptr<Detector> detector)\n    : Module(detector), config_(std::move(config)), messenger_(messenger), detector_(std::move(detector)),\n      propagated_message_() {\n    \/\/ fetch propagated deposits for single detector\n    messenger->bindSingle(this, &SimpleTransferModule::propagated_message_);\n}\n\n\/\/ compare two pixels for the pixel map\nstruct pixel_cmp {\n    bool operator()(const PixelCharge::Pixel& p1, const PixelCharge::Pixel& p2) const {\n        if(p1.x() == p2.x()) {\n            return p1.y() < p2.y();\n        }\n        return p1.x() < p2.x();\n    }\n};\n\n\/\/ run method that does the main computations for the module\nvoid SimpleTransferModule::run() {\n    \/\/ skip if this detector did not get any deposits\n    if(propagated_message_ == nullptr) {\n        return;\n    }\n\n    \/\/ get detector model\n    auto model = std::dynamic_pointer_cast<PixelDetectorModel>(detector_->getModel());\n    if(model == nullptr) {\n        \/\/ FIXME: exception can be more appropriate here\n        LOG(ERROR) << \"Detector \" << detector_->getName()\n                   << \" is not a PixelDetectorModel: ignored as other types are currently unsupported!\";\n        return;\n    }\n\n    \/\/ find pixels for all propagated charges\n    LOG(INFO) << \"Transferring charges to pixels\";\n    std::map<PixelCharge::Pixel, std::vector<PropagatedCharge>, pixel_cmp> pixel_map;\n    for(auto& propagated_charge : propagated_message_->getData()) {\n        auto position = propagated_charge.getPosition();\n        \/\/ find the nearest pixel\n        \/\/ NOTE: z position is ignored here\n        int xpixel = static_cast<int>(std::round(position.x() \/ model->getPixelSizeX()));\n        int ypixel = static_cast<int>(std::round(position.y() \/ model->getPixelSizeY()));\n\n        \/\/ add the pixel the list of hit pixels\n        PixelCharge::Pixel pixel(xpixel, ypixel);\n        pixel_map[pixel].push_back(propagated_charge);\n\n        LOG(DEBUG) << \"set of \" << propagated_charge.getCharge() << \" propagated charges at \"\n                   << propagated_charge.getPosition() << \" brought to pixel (\" << pixel.x() << \",\" << pixel.y() << \")\";\n    }\n\n    \/\/ create pixel charges\n    LOG(INFO) << \"Combining charges at same pixel\";\n    std::vector<PixelCharge> pixel_charges;\n    for(auto& pixel : pixel_map) {\n        unsigned int charge = 0;\n        for(auto& propagated_charge : pixel.second) {\n            charge += propagated_charge.getCharge();\n        }\n        pixel_charges.emplace_back(pixel.first, charge);\n\n        LOG(DEBUG) << \"set of \" << charge << \" charges at (\" << pixel.first.x() << \",\" << pixel.first.y() << \")\";\n    }\n\n    \/\/ dispatch message\n    PixelChargeMessage pixel_message(pixel_charges, detector_);\n    messenger_->dispatchMessage(pixel_message, \"pixel\");\n}\n<commit_msg>do not transfer pixels outside grid or too far from the bottom<commit_after>#include \"SimpleTransferModule.hpp\"\n\n#include <fstream>\n#include <limits>\n#include <memory>\n#include <new>\n#include <stdexcept>\n#include <string>\n#include <utility>\n\n#include \"core\/config\/exceptions.h\"\n#include \"core\/geometry\/PixelDetectorModel.hpp\"\n#include \"core\/utils\/log.h\"\n#include \"core\/utils\/unit.h\"\n\n#include \"objects\/PixelCharge.hpp\"\n\nusing namespace allpix;\n\n\/\/ constructor to load the module\nSimpleTransferModule::SimpleTransferModule(Configuration config, Messenger* messenger, std::shared_ptr<Detector> detector)\n    : Module(detector), config_(std::move(config)), messenger_(messenger), detector_(std::move(detector)),\n      propagated_message_() {\n    \/\/ fetch propagated deposits for single detector\n    messenger->bindSingle(this, &SimpleTransferModule::propagated_message_);\n}\n\n\/\/ compare two pixels for the pixel map\nstruct pixel_cmp {\n    bool operator()(const PixelCharge::Pixel& p1, const PixelCharge::Pixel& p2) const {\n        if(p1.x() == p2.x()) {\n            return p1.y() < p2.y();\n        }\n        return p1.x() < p2.x();\n    }\n};\n\n\/\/ run method that does the main computations for the module\nvoid SimpleTransferModule::run() {\n    \/\/ skip if this detector did not get any deposits\n    if(propagated_message_ == nullptr) {\n        return;\n    }\n\n    \/\/ get detector model\n    auto model = std::dynamic_pointer_cast<PixelDetectorModel>(detector_->getModel());\n    if(model == nullptr) {\n        \/\/ FIXME: exception can be more appropriate here\n        LOG(ERROR) << \"Detector \" << detector_->getName()\n                   << \" is not a PixelDetectorModel: ignored as other types are currently unsupported!\";\n        return;\n    }\n\n    \/\/ find pixels for all propagated charges\n    LOG(INFO) << \"Transferring charges to pixels\";\n    std::map<PixelCharge::Pixel, std::vector<PropagatedCharge>, pixel_cmp> pixel_map;\n    for(auto& propagated_charge : propagated_message_->getData()) {\n        auto position = propagated_charge.getPosition();\n        \/\/ ignore if outside z range of implant\n        \/\/ FIXME: this logic should be extended\n        if(std::fabs(position.z() - model->getSensorMinZ()) > config_.get<double>(\"max_depth_distance\")) {\n            LOG(DEBUG) << \"skipping set of \" << propagated_charge.getCharge() << \" propagated charges at \"\n                       << propagated_charge.getPosition() << \" because their local position is not in implant range\";\n            continue;\n        }\n\n        \/\/ find the nearest pixel\n        int xpixel = static_cast<int>(std::round(position.x() \/ model->getPixelSizeX()));\n        int ypixel = static_cast<int>(std::round(position.y() \/ model->getPixelSizeY()));\n        PixelCharge::Pixel pixel(xpixel, ypixel);\n\n        \/\/ ignore if out of pixel grid\n        if(xpixel < 0 || xpixel >= model->getNPixelsX() || ypixel < 0 || ypixel >= model->getNPixelsY()) {\n            LOG(DEBUG) << \"skipping set of \" << propagated_charge.getCharge() << \" propagated charges at \"\n                       << propagated_charge.getPosition() << \" because their nearest pixel (\" << pixel.x() << \",\"\n                       << pixel.y() << \") is outside the grid\";\n            continue;\n        }\n\n        \/\/ add the pixel the list of hit pixels\n        pixel_map[pixel].push_back(propagated_charge);\n\n        LOG(DEBUG) << \"set of \" << propagated_charge.getCharge() << \" propagated charges at \"\n                   << propagated_charge.getPosition() << \" brought to pixel (\" << pixel.x() << \",\" << pixel.y() << \")\";\n    }\n\n    \/\/ create pixel charges\n    LOG(INFO) << \"Combining charges at same pixel\";\n    std::vector<PixelCharge> pixel_charges;\n    for(auto& pixel : pixel_map) {\n        unsigned int charge = 0;\n        for(auto& propagated_charge : pixel.second) {\n            charge += propagated_charge.getCharge();\n        }\n        pixel_charges.emplace_back(pixel.first, charge);\n\n        LOG(DEBUG) << \"set of \" << charge << \" charges at (\" << pixel.first.x() << \",\" << pixel.first.y() << \")\";\n    }\n\n    \/\/ dispatch message\n    PixelChargeMessage pixel_message(pixel_charges, detector_);\n    messenger_->dispatchMessage(pixel_message, \"pixel\");\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <vector>\n#include <cerrno>\n\n#include <iostream>\n#include <fstream>\n#include <cstdarg>\n#include <cstring>\n#include <sstream>\n\n#include <sys\/wait.h>\n#include <unistd.h>\n\n#include \"vm\/call_frame.hpp\"\n\n#include \"vm\/object_utils.hpp\"\n#include \"vm\/vm.hpp\"\n\n#include \"compiled_file.hpp\"\n#include \"objectmemory.hpp\"\n#include \"global_cache.hpp\"\n#include \"config_parser.hpp\"\n\n#include \"builtin\/array.hpp\"\n#include \"builtin\/exception.hpp\"\n#include \"builtin\/fixnum.hpp\"\n#include \"builtin\/string.hpp\"\n#include \"builtin\/bignum.hpp\"\n#include \"builtin\/class.hpp\"\n#include \"builtin\/compactlookuptable.hpp\"\n#include \"builtin\/location.hpp\"\n#include \"builtin\/lookuptable.hpp\"\n#include \"builtin\/symbol.hpp\"\n#include \"builtin\/tuple.hpp\"\n#include \"builtin\/selector.hpp\"\n#include \"builtin\/taskprobe.hpp\"\n#include \"builtin\/float.hpp\"\n\n#include \"builtin\/staticscope.hpp\"\n\n#include \"builtin\/system.hpp\"\n#include \"signal.hpp\"\n#include \"lookup_data.hpp\"\n#include \"builtin\/sendsite.hpp\"\n\n#include \"instruments\/stats.hpp\"\n\n#include \"configuration.hpp\"\n\nnamespace rubinius {\n\n\n\/* Primitives *\/\n  \/\/\n  \/\/ HACK: remove this when performance is better and compiled_file.rb\n  \/\/ unmarshal_data method works.\n  Object* System::compiledfile_load(STATE, String* path, Object* version) {\n    if(!state->probe->nil_p()) {\n      state->probe->load_runtime(state, std::string(path->c_str()));\n    }\n\n    std::ifstream stream(path->c_str());\n    if(!stream) {\n      std::ostringstream msg;\n      msg << \"unable to open file to run: \" << path->c_str();\n      Exception::io_error(state, msg.str().c_str());\n    }\n\n    CompiledFile* cf = CompiledFile::load(stream);\n    if(cf->magic != \"!RBIX\") {\n      std::ostringstream msg;\n      msg << \"Invalid file: \" << path->c_str();\n      Exception::io_error(state, msg.str().c_str());\n    }\n\n    Object *body = cf->body(state);\n\n    delete cf;\n    return body;\n  }\n\n  Object* System::yield_gdb(STATE, Object* obj) {\n    obj->show(state);\n    Exception::assertion_error(state, \"yield_gdb called and not caught\");\n    return obj;\n  }\n\n  \/* @todo Improve error messages *\/\n  Object* System::vm_exec(VM* state, String* path, Array* args)\n  {\n    std::size_t argc = args->size();\n\n    \/* execvp() requires a NULL as last element *\/\n    std::vector<char*> argv((argc + 1), NULL);\n\n    for (std::size_t i = 0; i < argc; ++i) {\n      \/* strdup should be OK. Trying to exec with strings containing NUL == bad. --rue *\/\n      argv[i] = ::strdup(as<String>(args->get(state, i))->c_str());\n    }\n\n    (void) ::execvp(path->c_str(), &argv[0]); \/* std::vector is contiguous. --rue *\/\n\n    \/* execvp() returning means it failed. *\/\n    Exception::errno_error(state, \"execvp() failed!\");\n\n    return Qnil;\n  }\n\n  Object* System::vm_wait_pid(STATE, Fixnum* pid_obj, Object* no_hang) {\n    pid_t input_pid = pid_obj->to_native();\n    int options = 0;\n    int status;\n    pid_t pid;\n\n    if(no_hang == Qtrue) {\n      options |= WNOHANG;\n    }\n\n  retry:\n\n    {\n      GlobalLock::UnlockGuard lock(state->global_lock());\n      pid = waitpid(input_pid, &status, options);\n    }\n\n    if(pid == -1) {\n      if(errno == ECHILD) return Qfalse;\n      if(errno == EINTR)  goto retry;\n\n      \/\/ TODO handle other errnos?\n      return Qfalse;\n    }\n\n    if(no_hang == Qtrue && pid == 0) {\n      return Qnil;\n    }\n\n    Object* output;\n    if(WIFEXITED(status)) {\n      output = Fixnum::from(WEXITSTATUS(status));\n    } else {\n      output = Qnil;\n    }\n\n    if(input_pid > 0) {\n      return output;\n    }\n\n    return Tuple::from(state, 2, output, Fixnum::from(pid));\n  }\n\n  Object* System::vm_exit(STATE, Fixnum* code) {\n    state->thread_state()->raise_exit(code);\n    return NULL;\n  }\n\n  Fixnum* System::vm_fork(VM* state)\n  {\n    int result = ::fork();\n\n    if ( -1 == result ) {\n      Exception::errno_error(state, \"fork() failed!\");\n    }\n\n    \/*  @todo EVFLAG_FORKCHECK should remove need for any maintenance\n     *        here, but is there any other re-initialisation needed?\n     *\/\n\n    return Fixnum::from(result);\n  }\n\n  Object* System::vm_gc_start(STATE, Object* tenure) {\n    \/\/ Ignore tenure for now\n    state->om->collect_young_now = true;\n    state->om->collect_mature_now = true;\n    return Qnil;\n  }\n\n  Object* System::vm_get_config_item(STATE, String* var) {\n    ConfigParser::Entry* ent = state->shared.user_variables.find(var->c_str());\n    if(!ent) return Qnil;\n\n    if(ent->is_number()) {\n      return Fixnum::from(atoi(ent->value.c_str()));\n    } else if(ent->is_true()) {\n      return Qtrue;\n    }\n\n    return String::create(state, ent->value.c_str());\n  }\n\n  Object* System::vm_get_config_section(STATE, String* section) {\n    ConfigParser::EntryList* list;\n\n    list = state->shared.user_variables.get_section(section->byte_address());\n\n    Array* ary = Array::create(state, list->size());\n    for(size_t i = 0; i < list->size(); i++) {\n      String* var = String::create(state, list->at(i)->variable.c_str());\n      String* val = String::create(state, list->at(i)->value.c_str());\n\n      ary->set(state, i, Tuple::from(state, 2, var, val));\n    }\n\n    delete list;\n\n    return ary;\n  }\n\n  Object* System::vm_reset_method_cache(STATE, Symbol* name) {\n    \/\/ 1. clear the global cache\n    state->global_cache->clear(name);\n    \/\/ 2. clear the send site caches\n    Selector::clear_by_name(state, name);\n    return name;\n  }\n\n   \/*  @todo Could possibly capture the system backtrace at this\n   *        point. --rue\n   *\/\n  Array* System::vm_backtrace(STATE, Fixnum* skip, CallFrame* calling_environment) {\n    CallFrame* call_frame = calling_environment;\n\n    for(native_int i = skip->to_native(); call_frame && i > 0; --i) {\n      call_frame = static_cast<CallFrame*>(call_frame->previous);\n    }\n\n    Array* bt = Array::create(state, 5);\n\n    while(call_frame) {\n      \/\/ Ignore synthetic frames\n      if(call_frame->cm) {\n        bt->append(state, Location::create(state, call_frame));\n      }\n\n      call_frame = static_cast<CallFrame*>(call_frame->previous);\n    }\n\n    return bt;\n  }\n\n  Object* System::vm_show_backtrace(STATE, CallFrame* calling_environment) {\n    calling_environment->print_backtrace(state);\n    return Qnil;\n  }\n\n  Object* System::vm_profiler_instrumenter_available_p(STATE) {\n#ifdef RBX_PROFILER\n    return Qtrue;\n#else\n    return Qfalse;\n#endif\n  }\n\n  Object* System::vm_profiler_instrumenter_active_p(STATE) {\n    return state->shared.profiling() ? Qtrue : Qfalse;\n  }\n\n  Object* System::vm_profiler_instrumenter_start(STATE) {\n    state->shared.enable_profiling(state);\n    return Qtrue;\n  }\n\n  LookupTable* System::vm_profiler_instrumenter_stop(STATE) {\n    return state->shared.disable_profiling(state);\n  }\n\n  Object* System::vm_write_error(STATE, String* str) {\n    std::cerr << str->c_str() << std::endl;\n    return Qnil;\n  }\n\n  Object* System::vm_jit_info(STATE) {\n    if(!state->shared.config.jit_enabled) {\n      return Qnil;\n    }\n\n    Array* ary = Array::create(state, 2);\n    ary->set(state, 0, Integer::from(state, state->stats.jit_timing));\n    ary->set(state, 1, Integer::from(state, state->stats.jitted_methods));\n\n    return ary;\n  }\n\n  Object* System::vm_stats_gc_clear(STATE) {\n#ifdef RBX_GC_STATS\n    stats::GCStats::clear();\n#endif\n    return Qnil;\n  }\n\n  Object* System::vm_stats_gc_info(STATE) {\n#ifdef RBX_GC_STATS\n    return stats::GCStats::get()->to_ruby(state);\n#else\n    return Qnil;\n#endif\n  }\n\n  Object* System::vm_watch_signal(STATE, Fixnum* sig) {\n    SignalHandler* h = state->shared.signal_handler();\n    if(h) {\n      h->add_signal(sig->to_native());\n      return Qtrue;\n    } else {\n      return Qfalse;\n    }\n  }\n\n  Object* System::vm_time(STATE) {\n    return Integer::from(state, time(0));\n  }\n\n  Class* System::vm_open_class(STATE, Symbol* name, Object* sup, StaticScope* scope) {\n    Module* under;\n\n    if(scope->nil_p()) {\n      under = G(object);\n    } else {\n      under = scope->module();\n    }\n\n    return vm_open_class_under(state, name, sup, under);\n  }\n\n  \/\/ HACK: Internal helper for tracking subclasses for\n  \/\/ ObjectSpace.each_object(Class)\n  static void add_subclass(STATE, Object* super, Class* sub) {\n    Symbol* subclasses = state->symbol(\"@subclasses\");\n    Object* ivar = super->get_ivar(state, subclasses);\n\n    Array* ary = try_as<Array>(ivar);\n    if(!ary) {\n      ary = Array::create(state, 1);\n      ary->set(state, 0, sub);\n      super->set_ivar(state, subclasses, ary);\n    } else {\n      ary->append(state, sub);\n    }\n  }\n\n  Class* System::vm_open_class_under(STATE, Symbol* name, Object* super, Module* under) {\n    bool found = false;\n\n    Object* obj = under->get_const(state, name, &found);\n    if(found) {\n      Class* cls = as<Class>(obj);\n      if(super->nil_p()) return cls;\n\n      if(cls->direct_superclass(state) != super) {\n        std::ostringstream message;\n        message << \"Superclass mismatch: given \"\n                                         << as<Module>(super)->name()->c_str(state)\n                                         << \" but previously set to \"\n                                         << cls->direct_superclass(state)->name()->c_str(state);\n        Exception* exc =\n          Exception::make_type_error(state, Class::type, super, message.str().c_str());\n        \/\/ exc->locations(state, System::vm_backtrace(state, Fixnum::from(0), call_frame));\n        state->thread_state()->raise_exception(exc);\n        return NULL;\n      }\n\n      return cls;\n    }\n\n    \/\/ Create the class.\n    if(super->nil_p()) super = G(object);\n    Class* cls = Class::create(state, as<Class>(super));\n\n    if(under == G(object)) {\n      cls->name(state, name);\n    } else {\n      cls->set_name(state, under, name);\n    }\n\n    under->set_const(state, name, cls);\n\n    \/\/ HACK for ObjectSpace.each_object(Class)\n    add_subclass(state, super, cls);\n\n    return cls;\n  }\n\n  Module* System::vm_open_module(STATE, Symbol* name, StaticScope* scope) {\n    Module* under = G(object);\n\n    if(!scope->nil_p()) {\n      under = scope->module();\n    }\n\n    return vm_open_module_under(state, name, under);\n  }\n\n  Module* System::vm_open_module_under(STATE, Symbol* name, Module* under) {\n    bool found;\n\n    Object* obj = under->get_const(state, name, &found);\n\n    if(found) return as<Module>(obj);\n\n    Module* module = Module::create(state);\n\n    module->set_name(state, under, name);\n    under->set_const(state, name, module);\n\n    return module;\n  }\n\n  Class* System::vm_open_metaclass(STATE, Object* recv) {\n    \/\/ TODO check that recv's metaclass is openable\n    return recv->metaclass(state);\n  }\n\n  Tuple* System::vm_find_method(STATE, Object* recv, Symbol* name) {\n    LookupData lookup(recv, recv->lookup_begin(state));\n    lookup.priv = true;\n\n    Dispatch dis(name);\n\n    if(!GlobalCacheResolver::resolve(state, dis, lookup)) {\n      return (Tuple*)Qnil;\n    }\n\n    MethodVisibility* vis = try_as<MethodVisibility>(dis.method);\n\n    if(vis) {\n      return Tuple::from(state, 2, vis->method(), dis.module);\n    }\n\n    return Tuple::from(state, 2, dis.method, dis.module);\n  }\n\n  Object* System::vm_add_method(STATE, Symbol* name, CompiledMethod* method,\n                                StaticScope* scope, Object* vis) {\n    Module* mod = scope->for_method_definition();\n\n    method->scope(state, scope);\n    method->serial(state, Fixnum::from(0));\n    mod->method_table()->store(state, name, method);\n    state->global_cache->clear(mod, name);\n\n    if(Class* cls = try_as<Class>(mod)) {\n      method->formalize(state, false);\n\n      object_type type = (object_type)cls->instance_type()->to_native();\n      TypeInfo* ti = state->om->type_info[type];\n      if(ti) {\n        method->specialize(state, ti);\n      }\n    }\n\n    return method;\n  }\n\n  Object* System::vm_attach_method(STATE, Symbol* name, CompiledMethod* method,\n                                   StaticScope* scope, Object* recv) {\n    Module* mod = recv->metaclass(state);\n\n    method->scope(state, scope);\n    method->serial(state, Fixnum::from(0));\n    mod->method_table()->store(state, name, method);\n    state->global_cache->clear(mod, name);\n\n    return method;\n  }\n\n  Class* System::vm_object_class(STATE, Object* obj) {\n    return obj->class_object(state);\n  }\n\n  Object* System::vm_inc_global_serial(STATE) {\n    return Fixnum::from(state->shared.inc_global_serial());\n  }\n}\n<commit_msg>Manage the GIL around fork() properly<commit_after>#include <vector>\n#include <cerrno>\n\n#include <iostream>\n#include <fstream>\n#include <cstdarg>\n#include <cstring>\n#include <sstream>\n\n#include <sys\/wait.h>\n#include <unistd.h>\n\n#include \"vm\/call_frame.hpp\"\n\n#include \"vm\/object_utils.hpp\"\n#include \"vm\/vm.hpp\"\n\n#include \"compiled_file.hpp\"\n#include \"objectmemory.hpp\"\n#include \"global_cache.hpp\"\n#include \"config_parser.hpp\"\n\n#include \"builtin\/array.hpp\"\n#include \"builtin\/exception.hpp\"\n#include \"builtin\/fixnum.hpp\"\n#include \"builtin\/string.hpp\"\n#include \"builtin\/bignum.hpp\"\n#include \"builtin\/class.hpp\"\n#include \"builtin\/compactlookuptable.hpp\"\n#include \"builtin\/location.hpp\"\n#include \"builtin\/lookuptable.hpp\"\n#include \"builtin\/symbol.hpp\"\n#include \"builtin\/tuple.hpp\"\n#include \"builtin\/selector.hpp\"\n#include \"builtin\/taskprobe.hpp\"\n#include \"builtin\/float.hpp\"\n\n#include \"builtin\/staticscope.hpp\"\n\n#include \"builtin\/system.hpp\"\n#include \"signal.hpp\"\n#include \"lookup_data.hpp\"\n#include \"builtin\/sendsite.hpp\"\n\n#include \"instruments\/stats.hpp\"\n\n#include \"configuration.hpp\"\n\nnamespace rubinius {\n\n\n\/* Primitives *\/\n  \/\/\n  \/\/ HACK: remove this when performance is better and compiled_file.rb\n  \/\/ unmarshal_data method works.\n  Object* System::compiledfile_load(STATE, String* path, Object* version) {\n    if(!state->probe->nil_p()) {\n      state->probe->load_runtime(state, std::string(path->c_str()));\n    }\n\n    std::ifstream stream(path->c_str());\n    if(!stream) {\n      std::ostringstream msg;\n      msg << \"unable to open file to run: \" << path->c_str();\n      Exception::io_error(state, msg.str().c_str());\n    }\n\n    CompiledFile* cf = CompiledFile::load(stream);\n    if(cf->magic != \"!RBIX\") {\n      std::ostringstream msg;\n      msg << \"Invalid file: \" << path->c_str();\n      Exception::io_error(state, msg.str().c_str());\n    }\n\n    Object *body = cf->body(state);\n\n    delete cf;\n    return body;\n  }\n\n  Object* System::yield_gdb(STATE, Object* obj) {\n    obj->show(state);\n    Exception::assertion_error(state, \"yield_gdb called and not caught\");\n    return obj;\n  }\n\n  \/* @todo Improve error messages *\/\n  Object* System::vm_exec(VM* state, String* path, Array* args)\n  {\n    std::size_t argc = args->size();\n\n    \/* execvp() requires a NULL as last element *\/\n    std::vector<char*> argv((argc + 1), NULL);\n\n    for (std::size_t i = 0; i < argc; ++i) {\n      \/* strdup should be OK. Trying to exec with strings containing NUL == bad. --rue *\/\n      argv[i] = ::strdup(as<String>(args->get(state, i))->c_str());\n    }\n\n    (void) ::execvp(path->c_str(), &argv[0]); \/* std::vector is contiguous. --rue *\/\n\n    \/* execvp() returning means it failed. *\/\n    Exception::errno_error(state, \"execvp() failed!\");\n\n    return Qnil;\n  }\n\n  Object* System::vm_wait_pid(STATE, Fixnum* pid_obj, Object* no_hang) {\n    pid_t input_pid = pid_obj->to_native();\n    int options = 0;\n    int status;\n    pid_t pid;\n\n    if(no_hang == Qtrue) {\n      options |= WNOHANG;\n    }\n\n  retry:\n\n    {\n      GlobalLock::UnlockGuard lock(state->global_lock());\n      pid = waitpid(input_pid, &status, options);\n    }\n\n    if(pid == -1) {\n      if(errno == ECHILD) return Qfalse;\n      if(errno == EINTR)  goto retry;\n\n      \/\/ TODO handle other errnos?\n      return Qfalse;\n    }\n\n    if(no_hang == Qtrue && pid == 0) {\n      return Qnil;\n    }\n\n    Object* output;\n    if(WIFEXITED(status)) {\n      output = Fixnum::from(WEXITSTATUS(status));\n    } else {\n      output = Qnil;\n    }\n\n    if(input_pid > 0) {\n      return output;\n    }\n\n    return Tuple::from(state, 2, output, Fixnum::from(pid));\n  }\n\n  Object* System::vm_exit(STATE, Fixnum* code) {\n    state->thread_state()->raise_exit(code);\n    return NULL;\n  }\n\n  Fixnum* System::vm_fork(VM* state)\n  {\n    int result = 0;\n\n    \/\/ Unlock the lock and relock, that way both the parent and\n    \/\/ child relock independently, and correctly hold the lock.\n    {\n      GlobalLock::UnlockGuard guard(state->global_lock());\n      result = ::fork();\n    }\n\n    if ( -1 == result ) {\n      Exception::errno_error(state, \"fork() failed!\");\n    }\n\n    \/*  @todo EVFLAG_FORKCHECK should remove need for any maintenance\n     *        here, but is there any other re-initialisation needed?\n     *\/\n\n    return Fixnum::from(result);\n  }\n\n  Object* System::vm_gc_start(STATE, Object* tenure) {\n    \/\/ Ignore tenure for now\n    state->om->collect_young_now = true;\n    state->om->collect_mature_now = true;\n    return Qnil;\n  }\n\n  Object* System::vm_get_config_item(STATE, String* var) {\n    ConfigParser::Entry* ent = state->shared.user_variables.find(var->c_str());\n    if(!ent) return Qnil;\n\n    if(ent->is_number()) {\n      return Fixnum::from(atoi(ent->value.c_str()));\n    } else if(ent->is_true()) {\n      return Qtrue;\n    }\n\n    return String::create(state, ent->value.c_str());\n  }\n\n  Object* System::vm_get_config_section(STATE, String* section) {\n    ConfigParser::EntryList* list;\n\n    list = state->shared.user_variables.get_section(section->byte_address());\n\n    Array* ary = Array::create(state, list->size());\n    for(size_t i = 0; i < list->size(); i++) {\n      String* var = String::create(state, list->at(i)->variable.c_str());\n      String* val = String::create(state, list->at(i)->value.c_str());\n\n      ary->set(state, i, Tuple::from(state, 2, var, val));\n    }\n\n    delete list;\n\n    return ary;\n  }\n\n  Object* System::vm_reset_method_cache(STATE, Symbol* name) {\n    \/\/ 1. clear the global cache\n    state->global_cache->clear(name);\n    \/\/ 2. clear the send site caches\n    Selector::clear_by_name(state, name);\n    return name;\n  }\n\n   \/*  @todo Could possibly capture the system backtrace at this\n   *        point. --rue\n   *\/\n  Array* System::vm_backtrace(STATE, Fixnum* skip, CallFrame* calling_environment) {\n    CallFrame* call_frame = calling_environment;\n\n    for(native_int i = skip->to_native(); call_frame && i > 0; --i) {\n      call_frame = static_cast<CallFrame*>(call_frame->previous);\n    }\n\n    Array* bt = Array::create(state, 5);\n\n    while(call_frame) {\n      \/\/ Ignore synthetic frames\n      if(call_frame->cm) {\n        bt->append(state, Location::create(state, call_frame));\n      }\n\n      call_frame = static_cast<CallFrame*>(call_frame->previous);\n    }\n\n    return bt;\n  }\n\n  Object* System::vm_show_backtrace(STATE, CallFrame* calling_environment) {\n    calling_environment->print_backtrace(state);\n    return Qnil;\n  }\n\n  Object* System::vm_profiler_instrumenter_available_p(STATE) {\n#ifdef RBX_PROFILER\n    return Qtrue;\n#else\n    return Qfalse;\n#endif\n  }\n\n  Object* System::vm_profiler_instrumenter_active_p(STATE) {\n    return state->shared.profiling() ? Qtrue : Qfalse;\n  }\n\n  Object* System::vm_profiler_instrumenter_start(STATE) {\n    state->shared.enable_profiling(state);\n    return Qtrue;\n  }\n\n  LookupTable* System::vm_profiler_instrumenter_stop(STATE) {\n    return state->shared.disable_profiling(state);\n  }\n\n  Object* System::vm_write_error(STATE, String* str) {\n    std::cerr << str->c_str() << std::endl;\n    return Qnil;\n  }\n\n  Object* System::vm_jit_info(STATE) {\n    if(!state->shared.config.jit_enabled) {\n      return Qnil;\n    }\n\n    Array* ary = Array::create(state, 2);\n    ary->set(state, 0, Integer::from(state, state->stats.jit_timing));\n    ary->set(state, 1, Integer::from(state, state->stats.jitted_methods));\n\n    return ary;\n  }\n\n  Object* System::vm_stats_gc_clear(STATE) {\n#ifdef RBX_GC_STATS\n    stats::GCStats::clear();\n#endif\n    return Qnil;\n  }\n\n  Object* System::vm_stats_gc_info(STATE) {\n#ifdef RBX_GC_STATS\n    return stats::GCStats::get()->to_ruby(state);\n#else\n    return Qnil;\n#endif\n  }\n\n  Object* System::vm_watch_signal(STATE, Fixnum* sig) {\n    SignalHandler* h = state->shared.signal_handler();\n    if(h) {\n      h->add_signal(sig->to_native());\n      return Qtrue;\n    } else {\n      return Qfalse;\n    }\n  }\n\n  Object* System::vm_time(STATE) {\n    return Integer::from(state, time(0));\n  }\n\n  Class* System::vm_open_class(STATE, Symbol* name, Object* sup, StaticScope* scope) {\n    Module* under;\n\n    if(scope->nil_p()) {\n      under = G(object);\n    } else {\n      under = scope->module();\n    }\n\n    return vm_open_class_under(state, name, sup, under);\n  }\n\n  \/\/ HACK: Internal helper for tracking subclasses for\n  \/\/ ObjectSpace.each_object(Class)\n  static void add_subclass(STATE, Object* super, Class* sub) {\n    Symbol* subclasses = state->symbol(\"@subclasses\");\n    Object* ivar = super->get_ivar(state, subclasses);\n\n    Array* ary = try_as<Array>(ivar);\n    if(!ary) {\n      ary = Array::create(state, 1);\n      ary->set(state, 0, sub);\n      super->set_ivar(state, subclasses, ary);\n    } else {\n      ary->append(state, sub);\n    }\n  }\n\n  Class* System::vm_open_class_under(STATE, Symbol* name, Object* super, Module* under) {\n    bool found = false;\n\n    Object* obj = under->get_const(state, name, &found);\n    if(found) {\n      Class* cls = as<Class>(obj);\n      if(super->nil_p()) return cls;\n\n      if(cls->direct_superclass(state) != super) {\n        std::ostringstream message;\n        message << \"Superclass mismatch: given \"\n                                         << as<Module>(super)->name()->c_str(state)\n                                         << \" but previously set to \"\n                                         << cls->direct_superclass(state)->name()->c_str(state);\n        Exception* exc =\n          Exception::make_type_error(state, Class::type, super, message.str().c_str());\n        \/\/ exc->locations(state, System::vm_backtrace(state, Fixnum::from(0), call_frame));\n        state->thread_state()->raise_exception(exc);\n        return NULL;\n      }\n\n      return cls;\n    }\n\n    \/\/ Create the class.\n    if(super->nil_p()) super = G(object);\n    Class* cls = Class::create(state, as<Class>(super));\n\n    if(under == G(object)) {\n      cls->name(state, name);\n    } else {\n      cls->set_name(state, under, name);\n    }\n\n    under->set_const(state, name, cls);\n\n    \/\/ HACK for ObjectSpace.each_object(Class)\n    add_subclass(state, super, cls);\n\n    return cls;\n  }\n\n  Module* System::vm_open_module(STATE, Symbol* name, StaticScope* scope) {\n    Module* under = G(object);\n\n    if(!scope->nil_p()) {\n      under = scope->module();\n    }\n\n    return vm_open_module_under(state, name, under);\n  }\n\n  Module* System::vm_open_module_under(STATE, Symbol* name, Module* under) {\n    bool found;\n\n    Object* obj = under->get_const(state, name, &found);\n\n    if(found) return as<Module>(obj);\n\n    Module* module = Module::create(state);\n\n    module->set_name(state, under, name);\n    under->set_const(state, name, module);\n\n    return module;\n  }\n\n  Class* System::vm_open_metaclass(STATE, Object* recv) {\n    \/\/ TODO check that recv's metaclass is openable\n    return recv->metaclass(state);\n  }\n\n  Tuple* System::vm_find_method(STATE, Object* recv, Symbol* name) {\n    LookupData lookup(recv, recv->lookup_begin(state));\n    lookup.priv = true;\n\n    Dispatch dis(name);\n\n    if(!GlobalCacheResolver::resolve(state, dis, lookup)) {\n      return (Tuple*)Qnil;\n    }\n\n    MethodVisibility* vis = try_as<MethodVisibility>(dis.method);\n\n    if(vis) {\n      return Tuple::from(state, 2, vis->method(), dis.module);\n    }\n\n    return Tuple::from(state, 2, dis.method, dis.module);\n  }\n\n  Object* System::vm_add_method(STATE, Symbol* name, CompiledMethod* method,\n                                StaticScope* scope, Object* vis) {\n    Module* mod = scope->for_method_definition();\n\n    method->scope(state, scope);\n    method->serial(state, Fixnum::from(0));\n    mod->method_table()->store(state, name, method);\n    state->global_cache->clear(mod, name);\n\n    if(Class* cls = try_as<Class>(mod)) {\n      method->formalize(state, false);\n\n      object_type type = (object_type)cls->instance_type()->to_native();\n      TypeInfo* ti = state->om->type_info[type];\n      if(ti) {\n        method->specialize(state, ti);\n      }\n    }\n\n    return method;\n  }\n\n  Object* System::vm_attach_method(STATE, Symbol* name, CompiledMethod* method,\n                                   StaticScope* scope, Object* recv) {\n    Module* mod = recv->metaclass(state);\n\n    method->scope(state, scope);\n    method->serial(state, Fixnum::from(0));\n    mod->method_table()->store(state, name, method);\n    state->global_cache->clear(mod, name);\n\n    return method;\n  }\n\n  Class* System::vm_object_class(STATE, Object* obj) {\n    return obj->class_object(state);\n  }\n\n  Object* System::vm_inc_global_serial(STATE) {\n    return Fixnum::from(state->shared.inc_global_serial());\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2015-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#pragma once\n\n#include \"query-request.hh\"\n#include \"query-result.hh\"\n#include \"frozen_mutation.hh\"\n#include \"db\/timeout_clock.hh\"\n#include \"mutation.hh\"\n#include \"utils\/chunked_vector.hh\"\n\nclass reconcilable_result;\nclass frozen_reconcilable_result;\nclass mutation_source;\n\n\/\/ Can be read by other cores after publishing.\nstruct partition {\n    uint32_t _row_count_low_bits;\n    frozen_mutation _m; \/\/ FIXME: We don't need cf UUID, which frozen_mutation includes.\n    uint32_t _row_count_high_bits;\n    partition(uint32_t row_count_low_bits, frozen_mutation m, uint32_t row_count_high_bits)\n        : _row_count_low_bits(row_count_low_bits)\n        , _m(std::move(m))\n        , _row_count_high_bits(row_count_high_bits)\n    { }\n\n    partition(uint64_t row_count, frozen_mutation m)\n        : _row_count_low_bits(static_cast<uint32_t>(row_count))\n        , _m(std::move(m))\n        , _row_count_high_bits(static_cast<uint32_t>(row_count >> 32))\n    { }\n\n    uint32_t row_count_low_bits() const {\n        return _row_count_low_bits;\n    }\n\n    uint32_t row_count_high_bits() const {\n        return _row_count_high_bits;\n    }\n    \n    uint64_t row_count() const {\n        return (static_cast<uint64_t>(_row_count_high_bits) << 32) | _row_count_low_bits;\n    }\n\n    const frozen_mutation& mut() const {\n        return _m;\n    }\n\n    frozen_mutation& mut() {\n        return _m;\n    }\n\n\n    bool operator==(const partition& other) const {\n        return row_count() == other.row_count() && _m.representation() == other._m.representation();\n    }\n\n    bool operator!=(const partition& other) const {\n        return !(*this == other);\n    }\n};\n\n\/\/ The partitions held by this object are ordered according to dht::decorated_key ordering and non-overlapping.\n\/\/ Each mutation must have different key.\n\/\/\n\/\/ Can be read by other cores after publishing.\nclass reconcilable_result {\n    uint32_t _row_count_low_bits;\n    query::short_read _short_read;\n    query::result_memory_tracker _memory_tracker;\n    utils::chunked_vector<partition> _partitions;\n    uint32_t _row_count_high_bits;\npublic:\n    ~reconcilable_result();\n    reconcilable_result();\n    reconcilable_result(reconcilable_result&&) = default;\n    reconcilable_result& operator=(reconcilable_result&&) = default;\n    reconcilable_result(uint32_t row_count_low_bits, utils::chunked_vector<partition> partitions, query::short_read short_read,\n                        uint32_t row_count_high_bits, query::result_memory_tracker memory_tracker = { });\n    reconcilable_result(uint64_t row_count, utils::chunked_vector<partition> partitions, query::short_read short_read,\n                        query::result_memory_tracker memory_tracker = { });\n\n    const utils::chunked_vector<partition>& partitions() const;\n    utils::chunked_vector<partition>& partitions();\n\n    uint32_t row_count_low_bits() const {\n        return _row_count_low_bits;\n    }\n\n    uint32_t row_count_high_bits() const {\n        return _row_count_high_bits;\n    }\n\n    uint64_t row_count() const {\n        return (static_cast<uint64_t>(_row_count_high_bits) << 32) | _row_count_low_bits;\n    }\n\n    query::short_read is_short_read() const {\n        return _short_read;\n    }\n\n    size_t memory_usage() const {\n        return _memory_tracker.used_memory();\n    }\n\n    bool operator==(const reconcilable_result& other) const;\n    bool operator!=(const reconcilable_result& other) const;\n\n    struct printer {\n        const reconcilable_result& self;\n        schema_ptr schema;\n        friend std::ostream& operator<<(std::ostream&, const printer&);\n    };\n\n    printer pretty_printer(schema_ptr) const;\n};\n\nclass reconcilable_result_builder {\n    const schema& _schema;\n    const query::partition_slice& _slice;\n    bool _reversed;\n\n    bool _return_static_content_on_partition_with_no_rows{};\n    bool _static_row_is_alive{};\n    uint64_t _total_live_rows = 0;\n    query::result_memory_accounter _memory_accounter;\n    stop_iteration _stop;\n    std::optional<streamed_mutation_freezer> _mutation_consumer;\n\n    uint64_t _live_rows{};\n    \/\/ make this the last member so it is destroyed first. #7240\n    utils::chunked_vector<partition> _result;\npublic:\n    reconcilable_result_builder(const schema& s, const query::partition_slice& slice,\n                                query::result_memory_accounter&& accounter) noexcept\n        : _schema(s), _slice(slice), _reversed(_slice.options.contains(query::partition_slice::option::reversed))\n        , _memory_accounter(std::move(accounter))\n    { }\n\n    void consume_new_partition(const dht::decorated_key& dk);\n    void consume(tombstone t);\n    stop_iteration consume(static_row&& sr, tombstone, bool is_alive);\n    stop_iteration consume(clustering_row&& cr, row_tombstone, bool is_alive);\n    stop_iteration consume(range_tombstone&& rt);\n    stop_iteration consume_end_of_partition();\n    reconcilable_result consume_end_of_stream();\n};\n\nquery::result to_data_query_result(\n        const reconcilable_result&,\n        schema_ptr,\n        const query::partition_slice&,\n        uint64_t row_limit,\n        uint32_t partition_limit,\n        query::result_options opts = query::result_options::only_result());\n\n\/\/ Query the content of the mutation.\n\/\/\n\/\/ The mutation is destroyed in the process, see `mutation::consume()`.\nquery::result query_mutation(\n        mutation&& m,\n        const query::partition_slice& slice,\n        uint64_t row_limit = query::max_rows,\n        gc_clock::time_point now = gc_clock::now(),\n        query::result_options opts = query::result_options::only_result());\n\n\/\/ Performs a query for counter updates.\nfuture<mutation_opt> counter_write_query(schema_ptr, const mutation_source&, reader_permit permit,\n                                         const dht::decorated_key& dk,\n                                         const query::partition_slice& slice,\n                                         tracing::trace_state_ptr trace_ptr);\n\n<commit_msg>mutation_query: reconcilable_result_builder: document reverse query preconditions<commit_after>\/*\n * Copyright (C) 2015-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#pragma once\n\n#include \"query-request.hh\"\n#include \"query-result.hh\"\n#include \"frozen_mutation.hh\"\n#include \"db\/timeout_clock.hh\"\n#include \"mutation.hh\"\n#include \"utils\/chunked_vector.hh\"\n\nclass reconcilable_result;\nclass frozen_reconcilable_result;\nclass mutation_source;\n\n\/\/ Can be read by other cores after publishing.\nstruct partition {\n    uint32_t _row_count_low_bits;\n    frozen_mutation _m; \/\/ FIXME: We don't need cf UUID, which frozen_mutation includes.\n    uint32_t _row_count_high_bits;\n    partition(uint32_t row_count_low_bits, frozen_mutation m, uint32_t row_count_high_bits)\n        : _row_count_low_bits(row_count_low_bits)\n        , _m(std::move(m))\n        , _row_count_high_bits(row_count_high_bits)\n    { }\n\n    partition(uint64_t row_count, frozen_mutation m)\n        : _row_count_low_bits(static_cast<uint32_t>(row_count))\n        , _m(std::move(m))\n        , _row_count_high_bits(static_cast<uint32_t>(row_count >> 32))\n    { }\n\n    uint32_t row_count_low_bits() const {\n        return _row_count_low_bits;\n    }\n\n    uint32_t row_count_high_bits() const {\n        return _row_count_high_bits;\n    }\n    \n    uint64_t row_count() const {\n        return (static_cast<uint64_t>(_row_count_high_bits) << 32) | _row_count_low_bits;\n    }\n\n    const frozen_mutation& mut() const {\n        return _m;\n    }\n\n    frozen_mutation& mut() {\n        return _m;\n    }\n\n\n    bool operator==(const partition& other) const {\n        return row_count() == other.row_count() && _m.representation() == other._m.representation();\n    }\n\n    bool operator!=(const partition& other) const {\n        return !(*this == other);\n    }\n};\n\n\/\/ The partitions held by this object are ordered according to dht::decorated_key ordering and non-overlapping.\n\/\/ Each mutation must have different key.\n\/\/\n\/\/ Can be read by other cores after publishing.\nclass reconcilable_result {\n    uint32_t _row_count_low_bits;\n    query::short_read _short_read;\n    query::result_memory_tracker _memory_tracker;\n    utils::chunked_vector<partition> _partitions;\n    uint32_t _row_count_high_bits;\npublic:\n    ~reconcilable_result();\n    reconcilable_result();\n    reconcilable_result(reconcilable_result&&) = default;\n    reconcilable_result& operator=(reconcilable_result&&) = default;\n    reconcilable_result(uint32_t row_count_low_bits, utils::chunked_vector<partition> partitions, query::short_read short_read,\n                        uint32_t row_count_high_bits, query::result_memory_tracker memory_tracker = { });\n    reconcilable_result(uint64_t row_count, utils::chunked_vector<partition> partitions, query::short_read short_read,\n                        query::result_memory_tracker memory_tracker = { });\n\n    const utils::chunked_vector<partition>& partitions() const;\n    utils::chunked_vector<partition>& partitions();\n\n    uint32_t row_count_low_bits() const {\n        return _row_count_low_bits;\n    }\n\n    uint32_t row_count_high_bits() const {\n        return _row_count_high_bits;\n    }\n\n    uint64_t row_count() const {\n        return (static_cast<uint64_t>(_row_count_high_bits) << 32) | _row_count_low_bits;\n    }\n\n    query::short_read is_short_read() const {\n        return _short_read;\n    }\n\n    size_t memory_usage() const {\n        return _memory_tracker.used_memory();\n    }\n\n    bool operator==(const reconcilable_result& other) const;\n    bool operator!=(const reconcilable_result& other) const;\n\n    struct printer {\n        const reconcilable_result& self;\n        schema_ptr schema;\n        friend std::ostream& operator<<(std::ostream&, const printer&);\n    };\n\n    printer pretty_printer(schema_ptr) const;\n};\n\nclass reconcilable_result_builder {\n    const schema& _schema;\n    const query::partition_slice& _slice;\n    bool _reversed;\n\n    bool _return_static_content_on_partition_with_no_rows{};\n    bool _static_row_is_alive{};\n    uint64_t _total_live_rows = 0;\n    query::result_memory_accounter _memory_accounter;\n    stop_iteration _stop;\n    std::optional<streamed_mutation_freezer> _mutation_consumer;\n\n    uint64_t _live_rows{};\n    \/\/ make this the last member so it is destroyed first. #7240\n    utils::chunked_vector<partition> _result;\npublic:\n    \/\/ Expects table schema (non-reversed) and half-reversed (legacy) slice when building results for reverse query.\n    reconcilable_result_builder(const schema& s, const query::partition_slice& slice,\n                                query::result_memory_accounter&& accounter) noexcept\n        : _schema(s), _slice(slice), _reversed(_slice.options.contains(query::partition_slice::option::reversed))\n        , _memory_accounter(std::move(accounter))\n    { }\n\n    void consume_new_partition(const dht::decorated_key& dk);\n    void consume(tombstone t);\n    stop_iteration consume(static_row&& sr, tombstone, bool is_alive);\n    stop_iteration consume(clustering_row&& cr, row_tombstone, bool is_alive);\n    stop_iteration consume(range_tombstone&& rt);\n    stop_iteration consume_end_of_partition();\n    reconcilable_result consume_end_of_stream();\n};\n\nquery::result to_data_query_result(\n        const reconcilable_result&,\n        schema_ptr,\n        const query::partition_slice&,\n        uint64_t row_limit,\n        uint32_t partition_limit,\n        query::result_options opts = query::result_options::only_result());\n\n\/\/ Query the content of the mutation.\n\/\/\n\/\/ The mutation is destroyed in the process, see `mutation::consume()`.\nquery::result query_mutation(\n        mutation&& m,\n        const query::partition_slice& slice,\n        uint64_t row_limit = query::max_rows,\n        gc_clock::time_point now = gc_clock::now(),\n        query::result_options opts = query::result_options::only_result());\n\n\/\/ Performs a query for counter updates.\nfuture<mutation_opt> counter_write_query(schema_ptr, const mutation_source&, reader_permit permit,\n                                         const dht::decorated_key& dk,\n                                         const query::partition_slice& slice,\n                                         tracing::trace_state_ptr trace_ptr);\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2015 ScyllaDB\n *\/\n\n\/*\n * This file is part of Scylla.\n *\n * Scylla is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * Scylla is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with Scylla.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#pragma once\n\n#include \"query-request.hh\"\n#include \"query-result.hh\"\n#include \"mutation_reader.hh\"\n#include \"frozen_mutation.hh\"\n#include \"db\/timeout_clock.hh\"\n#include \"querier.hh\"\n#include \"utils\/chunked_vector.hh\"\n#include \"query_class_config.hh\"\n#include <seastar\/core\/execution_stage.hh>\n\nclass reconcilable_result;\nclass frozen_reconcilable_result;\n\n\/\/ Can be read by other cores after publishing.\nstruct partition {\n    uint32_t _row_count_low_bits;\n    frozen_mutation _m; \/\/ FIXME: We don't need cf UUID, which frozen_mutation includes.\n    uint32_t _row_count_high_bits;\n    partition(uint32_t row_count_low_bits, frozen_mutation m, uint32_t row_count_high_bits)\n        : _row_count_low_bits(row_count_low_bits)\n        , _m(std::move(m))\n        , _row_count_high_bits(row_count_high_bits)\n    { }\n\n    partition(uint64_t row_count, frozen_mutation m)\n        : _row_count_low_bits(static_cast<uint32_t>(row_count))\n        , _m(std::move(m))\n        , _row_count_high_bits(static_cast<uint32_t>(row_count >> 32))\n    { }\n\n    uint32_t row_count_low_bits() const {\n        return _row_count_low_bits;\n    }\n\n    uint32_t row_count_high_bits() const {\n        return _row_count_high_bits;\n    }\n    \n    uint64_t row_count() const {\n        return (static_cast<uint64_t>(_row_count_high_bits) << 32) | _row_count_low_bits;\n    }\n\n    const frozen_mutation& mut() const {\n        return _m;\n    }\n\n    frozen_mutation& mut() {\n        return _m;\n    }\n\n\n    bool operator==(const partition& other) const {\n        return row_count() == other.row_count() && _m.representation() == other._m.representation();\n    }\n\n    bool operator!=(const partition& other) const {\n        return !(*this == other);\n    }\n};\n\n\/\/ The partitions held by this object are ordered according to dht::decorated_key ordering and non-overlapping.\n\/\/ Each mutation must have different key.\n\/\/\n\/\/ Can be read by other cores after publishing.\nclass reconcilable_result {\n    uint32_t _row_count_low_bits;\n    query::short_read _short_read;\n    query::result_memory_tracker _memory_tracker;\n    utils::chunked_vector<partition> _partitions;\n    uint32_t _row_count_high_bits;\npublic:\n    ~reconcilable_result();\n    reconcilable_result();\n    reconcilable_result(reconcilable_result&&) = default;\n    reconcilable_result& operator=(reconcilable_result&&) = default;\n    reconcilable_result(uint32_t row_count_low_bits, utils::chunked_vector<partition> partitions, query::short_read short_read,\n                        uint32_t row_count_high_bits, query::result_memory_tracker memory_tracker = { });\n    reconcilable_result(uint64_t row_count, utils::chunked_vector<partition> partitions, query::short_read short_read,\n                        query::result_memory_tracker memory_tracker = { });\n\n    const utils::chunked_vector<partition>& partitions() const;\n    utils::chunked_vector<partition>& partitions();\n\n    uint32_t row_count_low_bits() const {\n        return _row_count_low_bits;\n    }\n\n    uint32_t row_count_high_bits() const {\n        return _row_count_high_bits;\n    }\n\n    uint64_t row_count() const {\n        return (static_cast<uint64_t>(_row_count_high_bits) << 32) | _row_count_low_bits;\n    }\n\n    query::short_read is_short_read() const {\n        return _short_read;\n    }\n\n    size_t memory_usage() const {\n        return _memory_tracker.used_memory();\n    }\n\n    bool operator==(const reconcilable_result& other) const;\n    bool operator!=(const reconcilable_result& other) const;\n\n    struct printer {\n        const reconcilable_result& self;\n        schema_ptr schema;\n        friend std::ostream& operator<<(std::ostream&, const printer&);\n    };\n\n    printer pretty_printer(schema_ptr) const;\n};\n\nclass reconcilable_result_builder {\n    const schema& _schema;\n    const query::partition_slice& _slice;\n\n    bool _return_static_content_on_partition_with_no_rows{};\n    bool _static_row_is_alive{};\n    uint64_t _total_live_rows = 0;\n    query::result_memory_accounter _memory_accounter;\n    stop_iteration _stop;\n    std::optional<streamed_mutation_freezer> _mutation_consumer;\n\n    uint64_t _live_rows{};\n    \/\/ make this the last member so it is destroyed first. #7240\n    utils::chunked_vector<partition> _result;\npublic:\n    reconcilable_result_builder(const schema& s, const query::partition_slice& slice,\n                                query::result_memory_accounter&& accounter)\n        : _schema(s), _slice(slice)\n        , _memory_accounter(std::move(accounter))\n    { }\n\n    void consume_new_partition(const dht::decorated_key& dk);\n    void consume(tombstone t);\n    stop_iteration consume(static_row&& sr, tombstone, bool is_alive);\n    stop_iteration consume(clustering_row&& cr, row_tombstone, bool is_alive);\n    stop_iteration consume(range_tombstone&& rt);\n    stop_iteration consume_end_of_partition();\n    reconcilable_result consume_end_of_stream();\n};\n\nquery::result to_data_query_result(\n        const reconcilable_result&,\n        schema_ptr,\n        const query::partition_slice&,\n        uint64_t row_limit,\n        uint32_t partition_limit,\n        query::result_options opts = query::result_options::only_result());\n\n\/\/ Query the content of the mutation.\n\/\/\n\/\/ The mutation is destroyed in the process, see `mutation::consume()`.\nquery::result query_mutation(\n        mutation&& m,\n        const query::partition_slice& slice,\n        uint64_t row_limit = query::max_rows,\n        gc_clock::time_point now = gc_clock::now(),\n        query::result_options opts = query::result_options::only_result());\n\n\/\/ Performs a query on given data source returning data in reconcilable form.\n\/\/\n\/\/ Reads at most row_limit rows. If less rows are returned, the data source\n\/\/ didn't have more live data satisfying the query.\n\/\/\n\/\/ Any cells which have expired according to query_time are returned as\n\/\/ deleted cells and do not count towards live data. The mutations are\n\/\/ compact, meaning that any cell which is covered by higher-level tombstone\n\/\/ is absent in the results.\n\/\/\n\/\/ 'source' doesn't have to survive deferring.\nfuture<reconcilable_result> mutation_query(\n    schema_ptr,\n    mutation_source source,\n    const dht::partition_range& range,\n    const query::partition_slice& slice,\n    uint64_t row_limit,\n    uint32_t partition_limit,\n    gc_clock::time_point query_time,\n    db::timeout_clock::time_point timeout,\n    query::query_class_config class_config,\n    query::result_memory_accounter&& accounter,\n    tracing::trace_state_ptr trace_ptr = nullptr,\n    query::querier_cache_context cache_ctx = { });\n\nfuture<> data_query(\n    schema_ptr s,\n    const mutation_source& source,\n    const dht::partition_range& range,\n    const query::partition_slice& slice,\n    uint64_t row_limit,\n    uint32_t partition_limit,\n    gc_clock::time_point query_time,\n    query::result::builder& builder,\n    db::timeout_clock::time_point timeout,\n    query::query_class_config class_config,\n    tracing::trace_state_ptr trace_ptr = nullptr,\n    query::querier_cache_context cache_ctx = { });\n\n\nclass mutation_query_stage {\n    inheriting_concrete_execution_stage<future<reconcilable_result>,\n        schema_ptr,\n        mutation_source,\n        const dht::partition_range&,\n        const query::partition_slice&,\n        uint32_t,\n        uint32_t,\n        gc_clock::time_point,\n        db::timeout_clock::time_point,\n        query::query_class_config,\n        query::result_memory_accounter&&,\n        tracing::trace_state_ptr,\n        query::querier_cache_context> _execution_stage;\npublic:\n    explicit mutation_query_stage();\n    template <typename... Args>\n    future<reconcilable_result> operator()(Args&&... args) { return _execution_stage(std::forward<Args>(args)...); }\n    inheriting_execution_stage::stats get_stats() const { return _execution_stage.get_stats(); }\n};\n\n\/\/ Performs a query for counter updates.\nfuture<mutation_opt> counter_write_query(schema_ptr, const mutation_source&, reader_permit permit,\n                                         const dht::decorated_key& dk,\n                                         const query::partition_slice& slice,\n                                         tracing::trace_state_ptr trace_ptr,\n                                         db::timeout_clock::time_point timeout);\n\n<commit_msg>mutation_query: mark reconcilable_result_builder constructor noexcept<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 \"query-request.hh\"\n#include \"query-result.hh\"\n#include \"mutation_reader.hh\"\n#include \"frozen_mutation.hh\"\n#include \"db\/timeout_clock.hh\"\n#include \"querier.hh\"\n#include \"utils\/chunked_vector.hh\"\n#include \"query_class_config.hh\"\n#include <seastar\/core\/execution_stage.hh>\n\nclass reconcilable_result;\nclass frozen_reconcilable_result;\n\n\/\/ Can be read by other cores after publishing.\nstruct partition {\n    uint32_t _row_count_low_bits;\n    frozen_mutation _m; \/\/ FIXME: We don't need cf UUID, which frozen_mutation includes.\n    uint32_t _row_count_high_bits;\n    partition(uint32_t row_count_low_bits, frozen_mutation m, uint32_t row_count_high_bits)\n        : _row_count_low_bits(row_count_low_bits)\n        , _m(std::move(m))\n        , _row_count_high_bits(row_count_high_bits)\n    { }\n\n    partition(uint64_t row_count, frozen_mutation m)\n        : _row_count_low_bits(static_cast<uint32_t>(row_count))\n        , _m(std::move(m))\n        , _row_count_high_bits(static_cast<uint32_t>(row_count >> 32))\n    { }\n\n    uint32_t row_count_low_bits() const {\n        return _row_count_low_bits;\n    }\n\n    uint32_t row_count_high_bits() const {\n        return _row_count_high_bits;\n    }\n    \n    uint64_t row_count() const {\n        return (static_cast<uint64_t>(_row_count_high_bits) << 32) | _row_count_low_bits;\n    }\n\n    const frozen_mutation& mut() const {\n        return _m;\n    }\n\n    frozen_mutation& mut() {\n        return _m;\n    }\n\n\n    bool operator==(const partition& other) const {\n        return row_count() == other.row_count() && _m.representation() == other._m.representation();\n    }\n\n    bool operator!=(const partition& other) const {\n        return !(*this == other);\n    }\n};\n\n\/\/ The partitions held by this object are ordered according to dht::decorated_key ordering and non-overlapping.\n\/\/ Each mutation must have different key.\n\/\/\n\/\/ Can be read by other cores after publishing.\nclass reconcilable_result {\n    uint32_t _row_count_low_bits;\n    query::short_read _short_read;\n    query::result_memory_tracker _memory_tracker;\n    utils::chunked_vector<partition> _partitions;\n    uint32_t _row_count_high_bits;\npublic:\n    ~reconcilable_result();\n    reconcilable_result();\n    reconcilable_result(reconcilable_result&&) = default;\n    reconcilable_result& operator=(reconcilable_result&&) = default;\n    reconcilable_result(uint32_t row_count_low_bits, utils::chunked_vector<partition> partitions, query::short_read short_read,\n                        uint32_t row_count_high_bits, query::result_memory_tracker memory_tracker = { });\n    reconcilable_result(uint64_t row_count, utils::chunked_vector<partition> partitions, query::short_read short_read,\n                        query::result_memory_tracker memory_tracker = { });\n\n    const utils::chunked_vector<partition>& partitions() const;\n    utils::chunked_vector<partition>& partitions();\n\n    uint32_t row_count_low_bits() const {\n        return _row_count_low_bits;\n    }\n\n    uint32_t row_count_high_bits() const {\n        return _row_count_high_bits;\n    }\n\n    uint64_t row_count() const {\n        return (static_cast<uint64_t>(_row_count_high_bits) << 32) | _row_count_low_bits;\n    }\n\n    query::short_read is_short_read() const {\n        return _short_read;\n    }\n\n    size_t memory_usage() const {\n        return _memory_tracker.used_memory();\n    }\n\n    bool operator==(const reconcilable_result& other) const;\n    bool operator!=(const reconcilable_result& other) const;\n\n    struct printer {\n        const reconcilable_result& self;\n        schema_ptr schema;\n        friend std::ostream& operator<<(std::ostream&, const printer&);\n    };\n\n    printer pretty_printer(schema_ptr) const;\n};\n\nclass reconcilable_result_builder {\n    const schema& _schema;\n    const query::partition_slice& _slice;\n\n    bool _return_static_content_on_partition_with_no_rows{};\n    bool _static_row_is_alive{};\n    uint64_t _total_live_rows = 0;\n    query::result_memory_accounter _memory_accounter;\n    stop_iteration _stop;\n    std::optional<streamed_mutation_freezer> _mutation_consumer;\n\n    uint64_t _live_rows{};\n    \/\/ make this the last member so it is destroyed first. #7240\n    utils::chunked_vector<partition> _result;\npublic:\n    reconcilable_result_builder(const schema& s, const query::partition_slice& slice,\n                                query::result_memory_accounter&& accounter) noexcept\n        : _schema(s), _slice(slice)\n        , _memory_accounter(std::move(accounter))\n    { }\n\n    void consume_new_partition(const dht::decorated_key& dk);\n    void consume(tombstone t);\n    stop_iteration consume(static_row&& sr, tombstone, bool is_alive);\n    stop_iteration consume(clustering_row&& cr, row_tombstone, bool is_alive);\n    stop_iteration consume(range_tombstone&& rt);\n    stop_iteration consume_end_of_partition();\n    reconcilable_result consume_end_of_stream();\n};\n\nquery::result to_data_query_result(\n        const reconcilable_result&,\n        schema_ptr,\n        const query::partition_slice&,\n        uint64_t row_limit,\n        uint32_t partition_limit,\n        query::result_options opts = query::result_options::only_result());\n\n\/\/ Query the content of the mutation.\n\/\/\n\/\/ The mutation is destroyed in the process, see `mutation::consume()`.\nquery::result query_mutation(\n        mutation&& m,\n        const query::partition_slice& slice,\n        uint64_t row_limit = query::max_rows,\n        gc_clock::time_point now = gc_clock::now(),\n        query::result_options opts = query::result_options::only_result());\n\n\/\/ Performs a query on given data source returning data in reconcilable form.\n\/\/\n\/\/ Reads at most row_limit rows. If less rows are returned, the data source\n\/\/ didn't have more live data satisfying the query.\n\/\/\n\/\/ Any cells which have expired according to query_time are returned as\n\/\/ deleted cells and do not count towards live data. The mutations are\n\/\/ compact, meaning that any cell which is covered by higher-level tombstone\n\/\/ is absent in the results.\n\/\/\n\/\/ 'source' doesn't have to survive deferring.\nfuture<reconcilable_result> mutation_query(\n    schema_ptr,\n    mutation_source source,\n    const dht::partition_range& range,\n    const query::partition_slice& slice,\n    uint64_t row_limit,\n    uint32_t partition_limit,\n    gc_clock::time_point query_time,\n    db::timeout_clock::time_point timeout,\n    query::query_class_config class_config,\n    query::result_memory_accounter&& accounter,\n    tracing::trace_state_ptr trace_ptr = nullptr,\n    query::querier_cache_context cache_ctx = { });\n\nfuture<> data_query(\n    schema_ptr s,\n    const mutation_source& source,\n    const dht::partition_range& range,\n    const query::partition_slice& slice,\n    uint64_t row_limit,\n    uint32_t partition_limit,\n    gc_clock::time_point query_time,\n    query::result::builder& builder,\n    db::timeout_clock::time_point timeout,\n    query::query_class_config class_config,\n    tracing::trace_state_ptr trace_ptr = nullptr,\n    query::querier_cache_context cache_ctx = { });\n\n\nclass mutation_query_stage {\n    inheriting_concrete_execution_stage<future<reconcilable_result>,\n        schema_ptr,\n        mutation_source,\n        const dht::partition_range&,\n        const query::partition_slice&,\n        uint32_t,\n        uint32_t,\n        gc_clock::time_point,\n        db::timeout_clock::time_point,\n        query::query_class_config,\n        query::result_memory_accounter&&,\n        tracing::trace_state_ptr,\n        query::querier_cache_context> _execution_stage;\npublic:\n    explicit mutation_query_stage();\n    template <typename... Args>\n    future<reconcilable_result> operator()(Args&&... args) { return _execution_stage(std::forward<Args>(args)...); }\n    inheriting_execution_stage::stats get_stats() const { return _execution_stage.get_stats(); }\n};\n\n\/\/ Performs a query for counter updates.\nfuture<mutation_opt> counter_write_query(schema_ptr, const mutation_source&, reader_permit permit,\n                                         const dht::decorated_key& dk,\n                                         const query::partition_slice& slice,\n                                         tracing::trace_state_ptr trace_ptr,\n                                         db::timeout_clock::time_point timeout);\n\n<|endoftext|>"}
{"text":"<commit_before>\n\/*\n    pbrt source code Copyright(c) 1998-2010 Matt Pharr and Greg Humphreys.\n\n    This file is part of pbrt.\n\n    pbrt 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.  Note that the text contents of\n    the book \"Physically Based Rendering\" are *not* licensed under the\n    GNU GPL.\n\n    pbrt is distributed in the hope that it will be 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 \"pbrt.h\"\n\n#include <cstdlib>\n#ifndef PBRT_IS_WINDOWS\n#include <libgen.h>\n#endif\n\nstatic string searchDirectory;\n\n#ifdef PBRT_IS_WINDOWS\nbool IsAbsolutePath(const string &filename)\n{\n    if (filename.size() == 0)\n        return false;\n    return (filename[0] == '\\\\' || filename[0] == '\/' || filename.find(':') != filename.end());\n}\n\n\nstring AbsolutePath(const string &filename)\n{\n    char full[_MAX_PATH];\n    if (_fullpath(full, filename.c_str(), _MAX_PATH) != NULL)\n        return std::string(full);\n    else\n        return filename;\n}\n\n\nstring ResolveFilename(const string &baseDir, const string &filename)\n{\n    if (searchDirectory.size() == 0 || filename.size() == 0)\n        return filename;\n    else if (IsAbsolutePath(filename))\n        return filename;\n\n    char searchDirectoryEnd = searchDirectory[searchDirectory.size() - 1];\n    if (searchDirectoryEnd == '\\\\' || searchDirectoryEnd == '\/')\n        return searchDirectory + filename;\n    else\n        return searchDirectory + \"\\\\\" + filename;\n}\n\n\nstring DirectoryContaining(const string &filename)\n{\n    \/\/ This code isn't tested but I believe it should work. Might need to add\n    \/\/ some const_casts to make it compile though.\n    char drive[_MAX_DRIVE];\n    char dir[_MAX_DIR];\n    char ext[_MAX_EXT];\n\n    errno_t err = _splitpath_s( filename.c_str(),\n                                drive, _MAX_DRIVE, dir, _MAX_DIR, NULL, 0, ext, _MAX_EXT );\n    if (err == 0) {\n        char fullDir[_MAX_PATH];\n        err = _makepath_s(fullDir, _MAX_PATH, drive, dir, NULL, ext);\n        if (err == 0) {\n            return std::string(fullDir);\n        }\n    }\n    return filename;\n}\n\n#else\n\nbool IsAbsolutePath(const string &filename)\n{\n    return (filename.size() > 0) && filename[0] == '\/';\n}\n\n\nstring AbsolutePath(const string &filename)\n{\n    char full[PATH_MAX];\n    if (realpath(filename.c_str(), full) != NULL)\n        return std::string(full);\n    else\n        return filename;\n}\n\n\nstring ResolveFilename(const string &filename)\n{\n    if (searchDirectory.size() == 0 || filename.size() == 0)\n        return filename;\n    else if (IsAbsolutePath(filename))\n        return filename;\n    else if (searchDirectory[searchDirectory.size() - 1] == '\/')\n        return searchDirectory + filename;\n    else\n        return searchDirectory + \"\/\" + filename;\n}\n\n\nstring DirectoryContaining(const string &filename)\n{\n    \/\/ dirname requires a char*, not a const char*, hence the const_cast. It \n    \/\/ doesn't modify it though (according to the docs on OS X).\n    string result = dirname(const_cast<char*>(filename.c_str()));\n    return result;\n}\n\n#endif\n\nvoid SetSearchDirectory(const string &dirname) {\n    searchDirectory = dirname;\n}\n\n\n\n<commit_msg>fixes for new file path handling in windows build<commit_after>\n\/*\n    pbrt source code Copyright(c) 1998-2010 Matt Pharr and Greg Humphreys.\n\n    This file is part of pbrt.\n\n    pbrt 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.  Note that the text contents of\n    the book \"Physically Based Rendering\" are *not* licensed under the\n    GNU GPL.\n\n    pbrt is distributed in the hope that it will be 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#include \"fileutil.h\"\n#include <cstdlib>\n#ifndef PBRT_IS_WINDOWS\n#include <libgen.h>\n#endif\n\nstatic string searchDirectory;\n\n#ifdef PBRT_IS_WINDOWS\nbool IsAbsolutePath(const string &filename)\n{\n    if (filename.size() == 0)\n        return false;\n    return (filename[0] == '\\\\' || filename[0] == '\/' || filename.find(':') != string::npos);\n}\n\n\nstring AbsolutePath(const string &filename)\n{\n    char full[_MAX_PATH];\n    if (_fullpath(full, filename.c_str(), _MAX_PATH) != NULL)\n        return std::string(full);\n    else\n        return filename;\n}\n\n\nstring ResolveFilename(const string &filename)\n{\n    if (searchDirectory.size() == 0 || filename.size() == 0)\n        return filename;\n    else if (IsAbsolutePath(filename))\n        return filename;\n\n    char searchDirectoryEnd = searchDirectory[searchDirectory.size() - 1];\n    if (searchDirectoryEnd == '\\\\' || searchDirectoryEnd == '\/')\n        return searchDirectory + filename;\n    else\n        return searchDirectory + \"\\\\\" + filename;\n}\n\n\nstring DirectoryContaining(const string &filename)\n{\n    \/\/ This code isn't tested but I believe it should work. Might need to add\n    \/\/ some const_casts to make it compile though.\n    char drive[_MAX_DRIVE];\n    char dir[_MAX_DIR];\n    char ext[_MAX_EXT];\n\n    errno_t err = _splitpath_s( filename.c_str(),\n                                drive, _MAX_DRIVE, dir, _MAX_DIR, NULL, 0, ext, _MAX_EXT );\n    if (err == 0) {\n        char fullDir[_MAX_PATH];\n        err = _makepath_s(fullDir, _MAX_PATH, drive, dir, NULL, NULL);\n        if (err == 0)\n            return std::string(fullDir);\n    }\n    return filename;\n}\n\n#else\n\nbool IsAbsolutePath(const string &filename)\n{\n    return (filename.size() > 0) && filename[0] == '\/';\n}\n\n\nstring AbsolutePath(const string &filename)\n{\n    char full[PATH_MAX];\n    if (realpath(filename.c_str(), full) != NULL)\n        return std::string(full);\n    else\n        return filename;\n}\n\n\nstring ResolveFilename(const string &filename)\n{\n    if (searchDirectory.size() == 0 || filename.size() == 0)\n        return filename;\n    else if (IsAbsolutePath(filename))\n        return filename;\n    else if (searchDirectory[searchDirectory.size() - 1] == '\/')\n        return searchDirectory + filename;\n    else\n        return searchDirectory + \"\/\" + filename;\n}\n\n\nstring DirectoryContaining(const string &filename)\n{\n    \/\/ dirname requires a char*, not a const char*, hence the const_cast. It \n    \/\/ doesn't modify it though (according to the docs on OS X).\n    string result = dirname(const_cast<char*>(filename.c_str()));\n    return result;\n}\n\n#endif\n\nvoid SetSearchDirectory(const string &dirname) {\n    searchDirectory = dirname;\n}\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>#if CC_TARGET_PLATFORM == CC_PLATFORM_ANDROID\n\n#include \"MWTcpSocket.h\"\n#include <sys\/socket.h>\n#include <netinet\/in.h>\n#include <netdb.h>\n#include <fcntl.h>\n#include <unistd.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <arpa\/inet.h>\n\n#define SOCKET_ERROR -1\n\nusing namespace cocos2d;\nusing namespace std;\n\nMW_FRAMEWORK_BEGIN\n\nMWTcpSocket *MWTcpSocket::create(int bindPort)\n{\n\tauto ret = new (std::nothrow) MWTcpSocket();\n\tif (ret && ret->_init(bindPort))\n\t{\n\t\tret->autorelease();\n\t\treturn ret;\n\t}\n\tCC_SAFE_RELEASE(ret);\n\treturn nullptr;\n}\n\nbool MWTcpSocket::_init(int bindPort)\n{\n\t_sock = socket(AF_INET, SOCK_STREAM, 0);\t\t\/\/ 0 indicates TCP\/IP\n\tif (_sock == -1)\n\t{\n\t\tCCLOG(\"Socket create failed.\");\n\t\treturn false;\n\t}\n\n\tif (bindPort != 0 && !bind(bindPort))\n\t{\n\t\treturn false;\n\t}\n\n\t_buffer = new char[1024];\n\n\treturn true;\n}\n\nMWTcpSocket::MWTcpSocket()\n: _connected(false)\n, _sock(-1)\n, _host(\"\")\n, _port(0)\n, _buffer(nullptr)\n{\n}\n\nMWTcpSocket::~MWTcpSocket()\n{\n\tif (_connected)\n\t{\n\t\tclose();\n\t}\n\tif (_buffer)\n\t{\n\t\tdelete[] _buffer;\n\t}\n}\n\nbool MWTcpSocket::bind(int port)\n{\n\tsockaddr_in addr;\n\taddr.sin_addr.s_addr = htonl(INADDR_ANY);\n\taddr.sin_family = AF_INET;\n\taddr.sin_port = htons(port);\n\n\tint opt = 1;\n\tif (::setsockopt(_sock, SOL_SOCKET, SO_REUSEADDR, (const char *)&opt, sizeof(opt)) < 0)\n\t{\n\t\treturn false;\n\t}\n\n\tint err = ::bind(_sock, (const sockaddr *)&addr, sizeof(sockaddr));\n\tif (err == SOCKET_ERROR)\n\t{\n\t\treturn false;\n\t}\n\t_bindPort = port;\n\t\n\treturn true;\n}\n\nbool MWTcpSocket::connect(const std::string &host, int port)\n{\n\tsockaddr_in addr;\n\taddr.sin_addr.s_addr = inet_addr(host.c_str());\n\taddr.sin_family = AF_INET;\n\taddr.sin_port = htons(port);\n\n\tint err = ::connect(_sock, (const sockaddr *)&addr, sizeof(sockaddr));\n\tif (err == SOCKET_ERROR)\n\t{\n\t\t_connected = false;\n\t\t_host = \"\";\n\t\t_port = 0;\n\t\treturn false;\n\t}\n\t_connected = true;\n\t_host = host;\n\t_port = port;\n\n\treturn true;\n}\n\nbool MWTcpSocket::listen(int count)\n{\n\tint err = ::listen(_sock, count);\n\tif (err == SOCKET_ERROR)\n\t{\n\t\treturn false;\n\t}\n\treturn true;\n}\n\nint MWTcpSocket::send(MWBinaryData *data)\n{\n\tint bytes, sent = 0;\n\tchar *buf = (char *)data->getData();\n\tint len = data->getSize();\n\twhile (sent < data->getSize())\n\t{\n\t\tbytes = ::send(_sock, buf + sent, len - sent, 0);\n\t\tif (bytes <= 0)\n\t\t{\n\t\t\tCCLOG(\"Socket data send failed. Sent bytes: %d, All bytes: %d\", sent, len);\n\t\t\tbreak;\n\t\t}\n\t\tsent += bytes;\n\t}\n\treturn sent;\n}\n\nMWBinaryData *MWTcpSocket::receive()\n{\n\tint received = ::recv(_sock, _buffer, 1024, 0);\n\tif (received <= 0)\n\t{\n\t\t_connected = false;\n\t\t_host = \"\";\n\t\t_port = 0;\n\t\tCCLOG(\"Socket disconnected\");\n\t\treturn nullptr;\n\t}\n\tauto ret = MWBinaryData::create(_buffer, received);\n\tret->retain();\n\t\/\/ clear buffer.\n\tmemset(_buffer, 0, received);\n\treturn ret;\n}\n\nvoid MWTcpSocket::close()\n{\n\t::close(_sock);\n\t_connected = false;\n\t_host = \"\";\n\t_port = 0;\n}\n\nMW_FRAMEWORK_END\n\n#endif<commit_msg>fix android<commit_after>#if CC_TARGET_PLATFORM == CC_PLATFORM_ANDROID\n\n#include \"MWTcpSocket.h\"\n#include <sys\/socket.h>\n#include <netinet\/in.h>\n#include <netdb.h>\n#include <fcntl.h>\n#include <unistd.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <arpa\/inet.h>\n\n#define SOCKET_ERROR -1\n\nusing namespace cocos2d;\nusing namespace std;\n\nMW_FRAMEWORK_BEGIN\n\nMWTcpSocket *MWTcpSocket::create(int bindPort)\n{\n\tauto ret = new (std::nothrow) MWTcpSocket();\n\tif (ret && ret->_init(bindPort))\n\t{\n\t\treturn ret;\n\t}\n\tCC_SAFE_RELEASE(ret);\n\treturn nullptr;\n}\n\nbool MWTcpSocket::_init(int bindPort)\n{\n\t_sock = socket(AF_INET, SOCK_STREAM, 0);\t\t\/\/ 0 indicates TCP\/IP\n\tif (_sock == -1)\n\t{\n\t\tCCLOG(\"Socket create failed.\");\n\t\treturn false;\n\t}\n\n\tif (bindPort != 0 && !bind(bindPort))\n\t{\n\t\treturn false;\n\t}\n\n\t_buffer = new char[1024];\n\n\treturn true;\n}\n\nMWTcpSocket::MWTcpSocket()\n: _connected(false)\n, _sock(-1)\n, _host(\"\")\n, _port(0)\n, _buffer(nullptr)\n{\n}\n\nMWTcpSocket::~MWTcpSocket()\n{\n\tif (_connected)\n\t{\n\t\tclose();\n\t}\n\tif (_buffer)\n\t{\n\t\tdelete[] _buffer;\n\t}\n}\n\nbool MWTcpSocket::bind(int port)\n{\n\tsockaddr_in addr;\n\taddr.sin_addr.s_addr = htonl(INADDR_ANY);\n\taddr.sin_family = AF_INET;\n\taddr.sin_port = htons(port);\n\n\tint opt = 1;\n\tif (::setsockopt(_sock, SOL_SOCKET, SO_REUSEADDR, (const char *)&opt, sizeof(opt)) < 0)\n\t{\n\t\treturn false;\n\t}\n\n\tint err = ::bind(_sock, (const sockaddr *)&addr, sizeof(sockaddr));\n\tif (err == SOCKET_ERROR)\n\t{\n\t\treturn false;\n\t}\n\t_bindPort = port;\n\t\n\treturn true;\n}\n\nbool MWTcpSocket::connect(const std::string &host, int port)\n{\n\tsockaddr_in addr;\n\taddr.sin_addr.s_addr = inet_addr(host.c_str());\n\taddr.sin_family = AF_INET;\n\taddr.sin_port = htons(port);\n\n\tint err = ::connect(_sock, (const sockaddr *)&addr, sizeof(sockaddr));\n\tif (err == SOCKET_ERROR)\n\t{\n\t\t_connected = false;\n\t\t_host = \"\";\n\t\t_port = 0;\n\t\treturn false;\n\t}\n\t_connected = true;\n\t_host = host;\n\t_port = port;\n\n\treturn true;\n}\n\nbool MWTcpSocket::listen(int count)\n{\n\tint err = ::listen(_sock, count);\n\tif (err == SOCKET_ERROR)\n\t{\n\t\treturn false;\n\t}\n\treturn true;\n}\n\nint MWTcpSocket::send(MWBinaryData *data)\n{\n\tint bytes, sent = 0;\n\tchar *buf = (char *)data->getData();\n\tint len = data->getSize();\n\twhile (sent < data->getSize())\n\t{\n\t\tbytes = ::send(_sock, buf + sent, len - sent, 0);\n\t\tif (bytes <= 0)\n\t\t{\n\t\t\tCCLOG(\"Socket data send failed. Sent bytes: %d, All bytes: %d\", sent, len);\n\t\t\tbreak;\n\t\t}\n\t\tsent += bytes;\n\t}\n\treturn sent;\n}\n\nMW_BYTE *MWTcpSocket::receive(MW_ULONG *size)\n{\n\tint received = ::recv(_sock, _buffer, 1024, 0);\n\tif (received <= 0)\n\t{\n\t\t_connected = false;\n\t\t_host = \"\";\n\t\t_port = 0;\n\t\tCCLOG(\"Socket disconnected\");\n\t\treturn nullptr;\n\t}\n\tMW_BYTE *ret = (MW_BYTE *)malloc(received);\n\tmemcpy(ret, _buffer, received);\n\t*size = received;\n\t\/\/ clear buffer.\n\tmemset(_buffer, 0, received);\n\treturn ret;\n}\n\nvoid MWTcpSocket::close()\n{\n\t::close(_sock);\n\t_connected = false;\n\t_host = \"\";\n\t_port = 0;\n}\n\nMW_FRAMEWORK_END\n\n#endif<|endoftext|>"}
{"text":"<commit_before>\/*\n * avs2wav.cpp\n *  extract audio data as RIFF WAV format, from avs file\n *  Copyright (C) 2010 janus_wel<janus.wel.3@gmail.com>\n *  see LICENSE for redistributing, modifying, and so on.\n * *\/\n\n#include \"..\/avsutil.hpp\"\n#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <iomanip>\n#include <memory>\n#include <string>\n#include <stdexcept>\n#include <vector>\n\n#ifdef WIN32\n#include <io.h>\n#include <fcntl.h>\n#else\n#include <unistd.h>\n#endif\n\nusing namespace std;\nusing namespace avsutil;\n\n\/\/ global object\n\/\/ progresss is abbr of \"progress stream\"\n\/\/ this stream is used in progress_cl()\n\/\/ streambuf is stdout fow now\nostream progresss(cout.rdbuf());\n\n\/\/ forward declarations\n\/\/ typical one\nvoid usage(ostream& out);\n\/\/ return true if redirected to file or connected to pipe\nbool is_connected(void);\n\/\/ set stdout to binary mode\nvoid set_stdout_binary(void);\n\/\/ convert string to number\nunsigned int str2num(const char* str);\n\/\/ callback function for IAudio::write()\nvoid progress_cl(const unsigned __int64, const unsigned __int64);\n\/\/ output audio informations\nostream& operator <<(ostream&, const AudioInfo&);\n\nint main(const int argc, const char* argv[]) {\n    \/\/ constants\n    const unsigned int header_width = 14;\n    const unsigned int buf_samples_def = 4096;\n    const unsigned int buf_size_def = 4096;\n    const unsigned int buf_samples_min = 1;\n    const unsigned int buf_size_min = 2;\n\n    \/\/ analyze options\n    string inputfile;\n    string outputfile;\n    unsigned int buf_samples = buf_samples_def;\n    unsigned int buf_size = buf_size_def;\n    for (int i = 1; i < argc; ++i) {\n        const char* arg = argv[i];\n        if (arg[0] == '-') {\n            switch (arg[1]) {\n                case 'h':\n                    usage(cout);\n                    exit(0);\n            }\n            if (i + 1 <= argc) {\n                switch (arg[1]) {\n                    case 'b':\n                        buf_size = str2num(argv[i + 1]);\n                        if (buf_size < buf_size_min) buf_size = buf_size_min;\n                        ++i;\n                        break;\n                    case 's':\n                        buf_samples = str2num(argv[i + 1]);\n                        if (buf_samples < buf_samples_min) buf_samples = buf_samples_min;\n                        ++i;\n                        break;\n                    case 'o':\n                        outputfile = argv[i + 1];\n                        ++i;\n                        break;\n                    default:\n                        cerr << \"Unknown option: \\\"-\" << arg[1] << \"\\\" is ignored.\" << endl;\n                        break;\n                }\n            }\n        }\n        else {\n            inputfile = arg;\n        }\n    }\n\n    if (inputfile.empty()) {\n        cerr << \"Specify <inputfile>.\" << endl;\n        usage(cerr);\n        exit(1);\n    }\n\n    try {\n        auto_ptr<IAvs> avs(CreateAvsObj(inputfile.c_str()));\n        if (!avs->is_fine()) {\n            cerr << avs->errmsg() << endl;\n            exit(1);\n        }\n\n        auto_ptr<IAudio> audio(avs->audio());\n        AudioInfo ai = audio->info();\n\n        if (!ai.exists) {\n            cerr << \"no audio in the file: \" << inputfile << endl;\n            exit(1);\n        }\n\n        \/\/ preparations\n        \/\/ output and information stream (to stdout for now)\n        ostream outputs(cout.rdbuf());\n        ostream infos(cout.rdbuf());\n        \/\/ settings for stream\n        progresss << right << fixed << setprecision(2);\n        infos << left;\n        \/\/ this is true if redirected to file or connected to pipe\n        bool is_stdout = !is_connected();\n        \/\/ settings for infos, outputs and progresss\n        if (is_stdout) {\n            \/\/ output to file\n            if (outputfile.empty()) outputfile.assign(argv[1]).append(\".wav\");\n            \/\/ create filebuf and set it output stream\n            filebuf* fbuf = new filebuf;\n            fbuf->open(outputfile.c_str(), ios::out | ios::binary | ios::trunc);\n            outputs.rdbuf(fbuf);\n        }\n        else {\n            \/\/ redirected or connected pipe\n            \/\/ output to stdout\n            outputfile.assign(\"stdout\");\n            progresss.rdbuf(cerr.rdbuf());\n            infos.rdbuf(cerr.rdbuf());\n            set_stdout_binary();\n        }\n\n        infos\n            << setw(header_width) << \"source:\"      << inputfile << endl\n            << setw(header_width) << \"destination:\" << outputfile << endl\n            << ai;\n\n        std::vector<char> internalbuf(buf_size);\n        outputs.rdbuf()->pubsetbuf(&internalbuf[0], buf_size);\n        audio->buf_samples(buf_samples);\n        audio->progress_callback(progress_cl);\n        outputs << audio.get();\n\n        infos\n            << endl\n            << \"done.\" << endl\n            << endl;\n    }\n    catch (exception& ex) {\n        cerr << endl << ex.what() << endl;\n        exit(1);\n    }\n\n    return 0;\n}\n\n\/\/ definitions of functions\nvoid usage(ostream& out) {\n    out << \"Usage: avs2wav [options] <inputfile> [| othercommands]\\n\"\n        << \"Options:\\n\"\n        << \"    -s N            Set a number of samples used when reading to N.\\n\"\n        << \"                    min: 1, default: 4096.\\n\"\n        << \"    -b N            Set buffer size used when writing to N.\\n\"\n        << \"                    Mutiple of a value of \\\"-s\\\" is preferable.\\n\"\n        << \"                    min: 2, default: 4096.\\n\"\n        << \"    -o <filename>   Output to filename.  This is ignored when redirected\\n\"\n        << \"                    to file or conneted to other command with pipe.\\n\"\n        << endl;\n}\n\nbool is_connected(void) {\n#ifdef WIN32\n    return !_isatty(_fileno(stdout));\n#else\n    return !isatty(fileno(stdout));\n#endif\n}\n\nvoid set_stdout_binary(void) {\n#ifdef WIN32\n    _setmode(_fileno(stdout), _O_BINARY);\n#endif\n}\n\nunsigned int str2num(const char* str) {\n    stringstream ss;\n    unsigned int num;\n    ss << dec << str;\n    ss >> num;\n    return num;\n}\n\nvoid progress_cl(const unsigned __int64 processed, const unsigned __int64 max) {\n    float percentage = (static_cast<float>(processed) \/ static_cast<float>(max)) * 100;\n    progresss\n        << \"\\rprocessing... \"\n        << setw(10) << processed << \"\/\" << max << \" samples\"\n        << \" (\" << setw(6) << percentage << \"%)\";\n}\n\nostream& operator <<(ostream& out, const AudioInfo& ai) {\n    \/\/ constants\n    static const unsigned int header_width = 18;\n\n    \/\/ preparations\n    string channels;\n    switch (ai.channels) {\n        case 1: channels = \"mono\";   break;\n        case 2: channels = \"stereo\"; break;\n        case 6: channels = \"5.1ch\";  break;\n        default:\n            stringstream ss;\n            ss << dec << ai.channels;\n            channels.assign(ss.str()).append(\"ch\");\n            break;\n    }\n    float sampling_rate = static_cast<float>(ai.sampling_rate) \/ 1000;\n\n    \/\/ instantiate new ostream object and set streambuf of \"out\" to it\n    \/\/ in order to save the formattings of \"out\"\n    ostream o(out.rdbuf());\n    o << left << setfill('.')\n        << endl\n        << setw(header_width) << \"bit depth \"     << ' ' << ai.bit_depth << \"bit\" << endl\n        << setw(header_width) << \"channels \"      << ' ' << channels << endl\n        << setw(header_width) << \"sampling rate \" << ' ' << sampling_rate << \"kHz\" << endl\n        << endl;\n\n    return out;\n}\n<commit_msg>Cut back on flashing output<commit_after>\/*\n * avs2wav.cpp\n *  extract audio data as RIFF WAV format, from avs file\n *  Copyright (C) 2010 janus_wel<janus.wel.3@gmail.com>\n *  see LICENSE for redistributing, modifying, and so on.\n * *\/\n\n#include \"..\/avsutil.hpp\"\n#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <iomanip>\n#include <memory>\n#include <string>\n#include <stdexcept>\n#include <vector>\n\n#ifdef WIN32\n#include <io.h>\n#include <fcntl.h>\n#else\n#include <unistd.h>\n#endif\n\nusing namespace std;\nusing namespace avsutil;\n\n\/\/ global object\n\/\/ progresss is abbr of \"progress stream\"\n\/\/ this stream is used in progress_cl()\n\/\/ streambuf is stdout fow now\nostream progresss(cout.rdbuf());\n\n\/\/ forward declarations\n\/\/ typical one\nvoid usage(ostream& out);\n\/\/ return true if redirected to file or connected to pipe\nbool is_connected(void);\n\/\/ set stdout to binary mode\nvoid set_stdout_binary(void);\n\/\/ convert string to number\nunsigned int str2num(const char* str);\n\/\/ callback function for IAudio::write()\nvoid progress_cl(const unsigned __int64, const unsigned __int64);\n\/\/ output audio informations\nostream& operator <<(ostream&, const AudioInfo&);\n\nint main(const int argc, const char* argv[]) {\n    \/\/ constants\n    const unsigned int header_width = 14;\n    const unsigned int buf_samples_def = 4096;\n    const unsigned int buf_size_def = 4096;\n    const unsigned int buf_samples_min = 1;\n    const unsigned int buf_size_min = 2;\n\n    \/\/ analyze options\n    string inputfile;\n    string outputfile;\n    unsigned int buf_samples = buf_samples_def;\n    unsigned int buf_size = buf_size_def;\n    for (int i = 1; i < argc; ++i) {\n        const char* arg = argv[i];\n        if (arg[0] == '-') {\n            switch (arg[1]) {\n                case 'h':\n                    usage(cout);\n                    exit(0);\n            }\n            if (i + 1 <= argc) {\n                switch (arg[1]) {\n                    case 'b':\n                        buf_size = str2num(argv[i + 1]);\n                        if (buf_size < buf_size_min) buf_size = buf_size_min;\n                        ++i;\n                        break;\n                    case 's':\n                        buf_samples = str2num(argv[i + 1]);\n                        if (buf_samples < buf_samples_min) buf_samples = buf_samples_min;\n                        ++i;\n                        break;\n                    case 'o':\n                        outputfile = argv[i + 1];\n                        ++i;\n                        break;\n                    default:\n                        cerr << \"Unknown option: \\\"-\" << arg[1] << \"\\\" is ignored.\" << endl;\n                        break;\n                }\n            }\n        }\n        else {\n            inputfile = arg;\n        }\n    }\n\n    if (inputfile.empty()) {\n        cerr << \"Specify <inputfile>.\" << endl;\n        usage(cerr);\n        exit(1);\n    }\n\n    try {\n        auto_ptr<IAvs> avs(CreateAvsObj(inputfile.c_str()));\n        if (!avs->is_fine()) {\n            cerr << avs->errmsg() << endl;\n            exit(1);\n        }\n\n        auto_ptr<IAudio> audio(avs->audio());\n        AudioInfo ai = audio->info();\n\n        if (!ai.exists) {\n            cerr << \"no audio in the file: \" << inputfile << endl;\n            exit(1);\n        }\n\n        \/\/ preparations\n        \/\/ output and information stream (to stdout for now)\n        ostream outputs(cout.rdbuf());\n        ostream infos(cout.rdbuf());\n        \/\/ settings for stream\n        progresss << right << fixed << setprecision(2);\n        infos << left;\n        \/\/ this is true if redirected to file or connected to pipe\n        bool is_stdout = !is_connected();\n        \/\/ settings for infos, outputs and progresss\n        if (is_stdout) {\n            \/\/ output to file\n            if (outputfile.empty()) outputfile.assign(argv[1]).append(\".wav\");\n            \/\/ create filebuf and set it output stream\n            filebuf* fbuf = new filebuf;\n            fbuf->open(outputfile.c_str(), ios::out | ios::binary | ios::trunc);\n            outputs.rdbuf(fbuf);\n        }\n        else {\n            \/\/ redirected or connected pipe\n            \/\/ output to stdout\n            outputfile.assign(\"stdout\");\n            progresss.rdbuf(cerr.rdbuf());\n            infos.rdbuf(cerr.rdbuf());\n            set_stdout_binary();\n        }\n\n        infos\n            << setw(header_width) << \"source:\"      << inputfile << endl\n            << setw(header_width) << \"destination:\" << outputfile << endl\n            << ai;\n\n        std::vector<char> internalbuf(buf_size);\n        outputs.rdbuf()->pubsetbuf(&internalbuf[0], buf_size);\n        audio->buf_samples(buf_samples);\n        audio->progress_callback(progress_cl);\n        outputs << audio.get();\n\n        infos\n            << endl\n            << \"done.\" << endl\n            << endl;\n    }\n    catch (exception& ex) {\n        cerr << endl << ex.what() << endl;\n        exit(1);\n    }\n\n    return 0;\n}\n\n\/\/ definitions of functions\nvoid usage(ostream& out) {\n    out << \"Usage: avs2wav [options] <inputfile> [| othercommands]\\n\"\n        << \"Options:\\n\"\n        << \"    -s N            Set a number of samples used when reading to N.\\n\"\n        << \"                    min: 1, default: 4096.\\n\"\n        << \"    -b N            Set buffer size used when writing to N.\\n\"\n        << \"                    Mutiple of a value of \\\"-s\\\" is preferable.\\n\"\n        << \"                    min: 2, default: 4096.\\n\"\n        << \"    -o <filename>   Output to filename.  This is ignored when redirected\\n\"\n        << \"                    to file or conneted to other command with pipe.\\n\"\n        << endl;\n}\n\nbool is_connected(void) {\n#ifdef WIN32\n    return !_isatty(_fileno(stdout));\n#else\n    return !isatty(fileno(stdout));\n#endif\n}\n\nvoid set_stdout_binary(void) {\n#ifdef WIN32\n    _setmode(_fileno(stdout), _O_BINARY);\n#endif\n}\n\nunsigned int str2num(const char* str) {\n    stringstream ss;\n    unsigned int num;\n    ss << dec << str;\n    ss >> num;\n    return num;\n}\n\nvoid progress_cl(const unsigned __int64 processed, const unsigned __int64 max) {\n    float percentage = (static_cast<float>(processed) \/ static_cast<float>(max)) * 100;\n    progresss\n        << \"\\rprocessing... \"\n        << setw(10) << processed << \"\/\" << max << \" samples\"\n        << \" (\" << setw(6) << percentage << \"%)\";\n}\n\nostream& operator <<(ostream& out, const AudioInfo& ai) {\n    \/\/ constants\n    static const unsigned int header_width = 18;\n\n    \/\/ preparations\n    string channels;\n    switch (ai.channels) {\n        case 1: channels = \"mono\";   break;\n        case 2: channels = \"stereo\"; break;\n        case 6: channels = \"5.1ch\";  break;\n        default:\n            stringstream ss;\n            ss << dec << ai.channels;\n            channels.assign(ss.str()).append(\"ch\");\n            break;\n    }\n    float sampling_rate = static_cast<float>(ai.sampling_rate) \/ 1000;\n\n    \/\/ instantiate new ostream object and set streambuf of \"out\" to it\n    \/\/ in order to save the formattings of \"out\"\n    ostream o(out.rdbuf());\n    o << left << setfill('.')\n        << \"\\n\"\n        << setw(header_width) << \"bit depth \"     << ' ' << ai.bit_depth << \"bit\\n\"\n        << setw(header_width) << \"channels \"      << ' ' << channels << \"\\n\"\n        << setw(header_width) << \"sampling rate \" << ' ' << sampling_rate << \"kHz\\n\"\n        << endl;\n\n    return out;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/  File: tpm_seal.cc\n\/\/  Author: Tom Roeder <tmroeder@google.com>\n\/\/\n\/\/  Description: A test of the TrouSerS API\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 <gflags\/gflags.h>\n#include <glog\/logging.h>\n\n#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n\n#include <tss\/tss_error.h>\n#include <tss\/platform.h>\n#include <tss\/tss_defines.h>\n#include <tss\/tss_typedef.h>\n#include <tss\/tss_structs.h>\n#include <tss\/tspi.h>\n#include <trousers\/trousers.h>\n\nint main(int argc, char **argv) {\n  google::ParseCommandLineFlags(&argc, &argv, true);\n  FLAGS_alsologtostderr = true;\n  google::InitGoogleLogging(argv[0]);\n\n  TSS_HCONTEXT tss_ctx;\n  TSS_HTPM tpm;\n  TSS_RESULT result;\n  TSS_HKEY srk = 0;\n  TSS_HPOLICY srk_policy = 0;\n  TSS_UUID srk_uuid = {0x00000000, 0x0000, 0x0000, 0x00, 0x00, {0x00, 0x00, 0x00, 0x00, 0x00, 0x01}};\n  BYTE secret[20];\n\n  \/\/ Use the well-known secret of 20 zeroes.\n  memset(secret, 0, 20);\n\n  result = Tspi_Context_Create(&tss_ctx);\n  CHECK_EQ(result, TSS_SUCCESS) << \"Could not create a TSS context.\";\n\n  result = Tspi_Context_Connect(tss_ctx,\n                                NULL \/* Default TPM *\/);\n  CHECK_EQ(result, TSS_SUCCESS) << \"Could not connect to the default TPM\";\n\n  result = Tspi_Context_GetTpmObject(tss_ctx, &tpm);\n  CHECK_EQ(result, TSS_SUCCESS) << \"Could not get a handle to the TPM\";\n\n  result = Tspi_Context_LoadKeyByUUID(tss_ctx,\n                                      TSS_PS_TYPE_SYSTEM,\n                                      srk_uuid,\n                                      &srk);\n  CHECK_EQ(result, TSS_SUCCESS) << \"Could not load the SRK handle\";\n\n  result = Tspi_GetPolicyObject(srk,\n                                        TSS_POLICY_USAGE,\n                                        &srk_policy);\n  CHECK_EQ(result, TSS_SUCCESS) << \"Could not get the SRK policy handle\";\n\n  result = Tspi_Policy_SetSecret(srk_policy,\n                                 TSS_SECRET_MODE_SHA1,\n                                 20,\n                                 secret);\n  CHECK_EQ(result, TSS_SUCCESS) << \"Could not set the well-known secret\";\n\n  result = Tspi_Context_FreeMemory(tss_ctx, NULL);\n  CHECK_EQ(result, TSS_SUCCESS) << \"Could not free the context\";\n\n  result = Tspi_Context_Close(tss_ctx);\n  CHECK_EQ(result, TSS_SUCCESS) << \"Could not clean up the context\";\n\n  return 0;\n}\n<commit_msg>A version of the TPM test code that seals and unseals data using the TrouSerS API.<commit_after>\/\/  File: tpm_seal.cc\n\/\/  Author: Tom Roeder <tmroeder@google.com>\n\/\/\n\/\/  Description: A test of the TrouSerS API\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 <gflags\/gflags.h>\n#include <glog\/logging.h>\n\n#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n\n#include <tss\/tss_error.h>\n#include <tss\/platform.h>\n#include <tss\/tss_defines.h>\n#include <tss\/tss_typedef.h>\n#include <tss\/tss_structs.h>\n#include <tss\/tspi.h>\n#include <trousers\/trousers.h>\n\n#include <list>\n\nusing std::list;\n\nint main(int argc, char **argv) {\n  google::ParseCommandLineFlags(&argc, &argv, true);\n  FLAGS_alsologtostderr = true;\n  google::InitGoogleLogging(argv[0]);\n\n  TSS_HCONTEXT tss_ctx;\n  TSS_HTPM tpm;\n  TSS_RESULT result;\n  TSS_HKEY srk = 0;\n  TSS_HPOLICY srk_policy = 0;\n  TSS_UUID srk_uuid = {0x00000000, 0x0000, 0x0000, 0x00, 0x00, {0x00, 0x00, 0x00, 0x00, 0x00, 0x01}};\n  BYTE secret[20];\n\n  \/\/ Use the well-known secret of 20 zeroes.\n  memset(secret, 0, 20);\n\n  \/\/ Set up the TSS context and the SRK + policy (with the right secret).\n  result = Tspi_Context_Create(&tss_ctx);\n  CHECK_EQ(result, TSS_SUCCESS) << \"Could not create a TSS context.\";\n\n  result = Tspi_Context_Connect(tss_ctx,\n                                NULL \/* Default TPM *\/);\n  CHECK_EQ(result, TSS_SUCCESS) << \"Could not connect to the default TPM\";\n\n  result = Tspi_Context_GetTpmObject(tss_ctx, &tpm);\n  CHECK_EQ(result, TSS_SUCCESS) << \"Could not get a handle to the TPM\";\n\n  result = Tspi_Context_LoadKeyByUUID(tss_ctx,\n                                      TSS_PS_TYPE_SYSTEM,\n                                      srk_uuid,\n                                      &srk);\n  CHECK_EQ(result, TSS_SUCCESS) << \"Could not load the SRK handle\";\n\n  result = Tspi_GetPolicyObject(srk,\n                                        TSS_POLICY_USAGE,\n                                        &srk_policy);\n  CHECK_EQ(result, TSS_SUCCESS) << \"Could not get the SRK policy handle\";\n\n  result = Tspi_Policy_SetSecret(srk_policy,\n                                 TSS_SECRET_MODE_SHA1,\n                                 20,\n                                 secret);\n  CHECK_EQ(result, TSS_SUCCESS) << \"Could not set the well-known secret\";\n\n  \/\/ Create and fill the PCR information.\n  TSS_HPCRS pcrs;\n  result = Tspi_Context_CreateObject(tss_ctx,\n                                     TSS_OBJECT_TYPE_PCRS,\n                                     0,\n                                     &pcrs);\n  CHECK_EQ(result, TSS_SUCCESS) << \"Could not create a PCRs object\";\n\n  \/\/ This seal operation is meant to be used with DRTM, so the only PCRs that it\n  \/\/ reads are 17 and 18. This is where you can set other PCRs to use.\n  list<UINT32> pcrs_to_seal{17, 18};\n  BYTE *pcr_value = NULL;\n  UINT32 pcr_value_len = 0;\n  for(UINT32 ui : pcrs_to_seal) {\n    result = Tspi_TPM_PcrRead(tpm, ui, &pcr_value_len, &pcr_value);\n    CHECK_EQ(result, TSS_SUCCESS) << \"Could not read the value of PCR \" << ui;\n\n    result = Tspi_PcrComposite_SetPcrValue(pcrs, ui, pcr_value_len, pcr_value);\n    CHECK_EQ(result, TSS_SUCCESS) << \"Could not set the PCR value\"\n                                  << ui << \" for sealing\";\n  }\n\n  TSS_HENCDATA enc_data;\n  result = Tspi_Context_CreateObject(tss_ctx,\n                                     TSS_OBJECT_TYPE_ENCDATA,\n                                     TSS_ENCDATA_SEAL,\n                                     &enc_data);\n  CHECK_EQ(result, TSS_SUCCESS) << \"Could not create the data for sealing\";\n\n  BYTE data[16] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15};\n  result = Tspi_Data_Seal(enc_data, srk, 16, data, pcrs);\n  CHECK_EQ(result, TSS_SUCCESS) << \"Could not seal the test data\";\n\n  \/\/ Extract the sealed data, then try to unseal it.\n  BYTE *sealed_data;\n  UINT32 sealed_data_len;\n  result = Tspi_GetAttribData(enc_data,\n                              TSS_TSPATTRIB_ENCDATA_BLOB,\n                              TSS_TSPATTRIB_ENCDATABLOB_BLOB,\n                              &sealed_data_len,\n                              &sealed_data);\n  CHECK_EQ(result, TSS_SUCCESS) << \"Could not get the sealed bits\";\n\n  BYTE *unsealed_data;\n  UINT32 unsealed_data_len;\n  result = Tspi_Data_Unseal(enc_data, srk, &unsealed_data_len, &unsealed_data);\n  CHECK_EQ(result, TSS_SUCCESS) << \"Could not unseal the data\";\n\n  \/\/ Check that the data was unsealed correctly.\n  CHECK_EQ(unsealed_data_len, 16U) << \"The unsealed data was the wrong length\";\n  CHECK_EQ(memcmp(unsealed_data, data, 16), 0)\n      << \"The unsealed data did not match the original data\";\n\n  \/\/ Clean-up code.\n  result = Tspi_Context_FreeMemory(tss_ctx, NULL);\n  CHECK_EQ(result, TSS_SUCCESS) << \"Could not free the context\";\n\n  result = Tspi_Context_Close(tss_ctx);\n  CHECK_EQ(result, TSS_SUCCESS) << \"Could not clean up the context\";\n\n  return 0;\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 <string>\n#include <vector>\n\n#include \"gflags\/gflags.h\"\n\n#include \"modules\/common\/configs\/config_gflags.h\"\n#include \"modules\/common\/log.h\"\n#include \"modules\/common\/util\/file.h\"\n#include \"modules\/common\/util\/points_downsampler.h\"\n#include \"modules\/map\/hdmap\/adapter\/opendrive_adapter.h\"\n#include \"modules\/map\/hdmap\/hdmap_util.h\"\n#include \"modules\/map\/proto\/map.pb.h\"\n\n\/**\n * A map tool to generate a downsampled map to be displayed by dreamview\n * frontend.\n *\/\n\nDEFINE_string(output_dir, \"\/tmp\/\", \"output map directory\");\nDEFINE_double(angle_threshold, 1 \/ 180 * M_PI, \/* 1 degree *\/\n              \"Points are sampled when the accumulated direction change \"\n              \"exceeds the threshold\");\nDEFINE_int32(downsample_distance, 5, \"downsample rate for a normal path\");\nDEFINE_int32(steep_turn_downsample_distance, 1,\n             \"downsample rate for a steep turn path\");\n\nusing apollo::common::PointENU;\nusing apollo::common::util::DownsampleByAngle;\nusing apollo::common::util::DownsampleByDistance;\nusing apollo::common::util::GetProtoFromFile;\nusing apollo::hdmap::Curve;\nusing apollo::hdmap::Map;\nusing apollo::hdmap::adapter::OpendriveAdapter;\n\nstatic void DownsampleCurve(Curve* curve) {\n  auto* line_segment = curve->mutable_segment(0)->mutable_line_segment();\n  std::vector<PointENU> points(line_segment->point().begin(),\n                               line_segment->point().end());\n  line_segment->clear_point();\n\n  \/\/ NOTE: this not the most efficient implementation, but since this map tool\n  \/\/ is only run once for each, we can probably live with that.\n\n  \/\/ Downsample points by angle then by distance.\n  auto sampled_indices = DownsampleByAngle(points, FLAGS_angle_threshold);\n  std::vector<PointENU> downsampled_points;\n  for (int index : sampled_indices) {\n    downsampled_points.push_back(points[index]);\n  }\n\n  sampled_indices =\n      DownsampleByDistance(downsampled_points, FLAGS_downsample_distance,\n                           FLAGS_steep_turn_downsample_distance);\n\n  for (int index : sampled_indices) {\n    *line_segment->add_point() = downsampled_points[index];\n  }\n  int new_size = line_segment->point_size();\n  CHECK_GT(new_size, 1);\n\n  AINFO << \"Lane curve downsampled from \" << points.size() << \" points to \"\n        << new_size << \" points.\";\n}\n\nstatic void DownsampleMap(Map* map_pb) {\n  for (int i = 0; i < map_pb->lane_size(); ++i) {\n    auto* lane = map_pb->mutable_lane(i);\n    lane->clear_left_sample();\n    lane->clear_right_sample();\n    lane->clear_left_road_sample();\n    lane->clear_right_road_sample();\n\n    AINFO << \"Downsampling lane \" << lane->id().id();\n    DownsampleCurve(lane->mutable_central_curve());\n    DownsampleCurve(lane->mutable_left_boundary()->mutable_curve());\n    DownsampleCurve(lane->mutable_right_boundary()->mutable_curve());\n  }\n}\n\nstatic void OutputMap(const Map& map_pb) {\n  std::ofstream map_txt_file(FLAGS_output_dir + \"\/sim_map.txt\");\n  map_txt_file << map_pb.DebugString();\n  map_txt_file.close();\n\n  std::ofstream map_bin_file(FLAGS_output_dir + \"\/sim_map.bin\");\n  std::string map_str;\n  map_pb.SerializeToString(&map_str);\n  map_bin_file << map_str;\n  map_bin_file.close();\n}\n\nint main(int32_t argc, char** argv) {\n  google::InitGoogleLogging(argv[0]);\n  FLAGS_alsologtostderr = true;\n  FLAGS_v = 3;\n\n  google::ParseCommandLineFlags(&argc, &argv, true);\n\n  Map map_pb;\n  const auto map_file = apollo::hdmap::BaseMapFile();\n  if (apollo::common::util::EndWith(map_file, \".xml\")) {\n    CHECK(OpendriveAdapter::LoadData(map_file, &map_pb));\n  } else {\n    CHECK(GetProtoFromFile(map_file, &map_pb)) << \"Fail to open: \" << map_file;\n  }\n\n  DownsampleMap(&map_pb);\n  OutputMap(map_pb);\n  AINFO << \"sim_map generated at:\" << FLAGS_output_dir;\n\n  return 0;\n}\n<commit_msg>fix #4789.<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 <string>\n#include <vector>\n\n#include \"gflags\/gflags.h\"\n\n#include \"modules\/common\/configs\/config_gflags.h\"\n#include \"modules\/common\/log.h\"\n#include \"modules\/common\/util\/file.h\"\n#include \"modules\/common\/util\/points_downsampler.h\"\n#include \"modules\/map\/hdmap\/adapter\/opendrive_adapter.h\"\n#include \"modules\/map\/hdmap\/hdmap_util.h\"\n#include \"modules\/map\/proto\/map.pb.h\"\n\n\/**\n * A map tool to generate a downsampled map to be displayed by dreamview\n * frontend.\n *\/\n\nDEFINE_string(output_dir, \"\/tmp\/\", \"output map directory\");\nDEFINE_double(angle_threshold, 1. \/ 180 * M_PI, \/* 1 degree *\/\n              \"Points are sampled when the accumulated direction change \"\n              \"exceeds the threshold\");\nDEFINE_int32(downsample_distance, 5, \"downsample rate for a normal path\");\nDEFINE_int32(steep_turn_downsample_distance, 1,\n             \"downsample rate for a steep turn path\");\n\nusing apollo::common::PointENU;\nusing apollo::common::util::DownsampleByAngle;\nusing apollo::common::util::DownsampleByDistance;\nusing apollo::common::util::GetProtoFromFile;\nusing apollo::hdmap::Curve;\nusing apollo::hdmap::Map;\nusing apollo::hdmap::adapter::OpendriveAdapter;\n\nstatic void DownsampleCurve(Curve* curve) {\n  auto* line_segment = curve->mutable_segment(0)->mutable_line_segment();\n  std::vector<PointENU> points(line_segment->point().begin(),\n                               line_segment->point().end());\n  line_segment->clear_point();\n\n  \/\/ NOTE: this not the most efficient implementation, but since this map tool\n  \/\/ is only run once for each, we can probably live with that.\n\n  \/\/ Downsample points by angle then by distance.\n  auto sampled_indices = DownsampleByAngle(points, FLAGS_angle_threshold);\n  std::vector<PointENU> downsampled_points;\n  for (int index : sampled_indices) {\n    downsampled_points.push_back(points[index]);\n  }\n\n  sampled_indices =\n      DownsampleByDistance(downsampled_points, FLAGS_downsample_distance,\n                           FLAGS_steep_turn_downsample_distance);\n\n  for (int index : sampled_indices) {\n    *line_segment->add_point() = downsampled_points[index];\n  }\n  int new_size = line_segment->point_size();\n  CHECK_GT(new_size, 1);\n\n  AINFO << \"Lane curve downsampled from \" << points.size() << \" points to \"\n        << new_size << \" points.\";\n}\n\nstatic void DownsampleMap(Map* map_pb) {\n  for (int i = 0; i < map_pb->lane_size(); ++i) {\n    auto* lane = map_pb->mutable_lane(i);\n    lane->clear_left_sample();\n    lane->clear_right_sample();\n    lane->clear_left_road_sample();\n    lane->clear_right_road_sample();\n\n    AINFO << \"Downsampling lane \" << lane->id().id();\n    DownsampleCurve(lane->mutable_central_curve());\n    DownsampleCurve(lane->mutable_left_boundary()->mutable_curve());\n    DownsampleCurve(lane->mutable_right_boundary()->mutable_curve());\n  }\n}\n\nstatic void OutputMap(const Map& map_pb) {\n  std::ofstream map_txt_file(FLAGS_output_dir + \"\/sim_map.txt\");\n  map_txt_file << map_pb.DebugString();\n  map_txt_file.close();\n\n  std::ofstream map_bin_file(FLAGS_output_dir + \"\/sim_map.bin\");\n  std::string map_str;\n  map_pb.SerializeToString(&map_str);\n  map_bin_file << map_str;\n  map_bin_file.close();\n}\n\nint main(int32_t argc, char** argv) {\n  google::InitGoogleLogging(argv[0]);\n  FLAGS_alsologtostderr = true;\n  FLAGS_v = 3;\n\n  google::ParseCommandLineFlags(&argc, &argv, true);\n\n  Map map_pb;\n  const auto map_file = apollo::hdmap::BaseMapFile();\n  if (apollo::common::util::EndWith(map_file, \".xml\")) {\n    CHECK(OpendriveAdapter::LoadData(map_file, &map_pb));\n  } else {\n    CHECK(GetProtoFromFile(map_file, &map_pb)) << \"Fail to open: \" << map_file;\n  }\n\n  DownsampleMap(&map_pb);\n  OutputMap(map_pb);\n  AINFO << \"sim_map generated at:\" << FLAGS_output_dir;\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*M\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/  IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.\n\/\/\n\/\/  By downloading, copying, installing or using the software you agree to this license.\n\/\/  If you do not agree to this license, do not download, install,\n\/\/  copy or use the software.\n\/\/\n\/\/\n\/\/                           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#include \"opencv2\/highgui.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    const Mat src  = _src.getMat();\n    const Mat dest = _dst.getMat();\n    const Mat mask = _mask.getMat();\n    _blend.create(dest.size(), CV_8UC3);\n    Mat blend = _blend.getMat();\n\n    int minx = INT_MAX, miny = INT_MAX, maxx = INT_MIN, maxy = INT_MIN;\n    int h = mask.size().height;\n    int w = mask.size().width;\n\n    Mat gray = Mat(mask.size(),CV_8UC1);\n    Mat dst_mask = Mat::zeros(dest.size(),CV_8UC1);\n    Mat cs_mask = Mat::zeros(src.size(),CV_8UC3);\n    Mat cd_mask = Mat::zeros(dest.size(),CV_8UC3);\n\n    if(mask.channels() == 3)\n        cvtColor(mask, gray, COLOR_BGR2GRAY );\n    else\n        gray = mask;\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                minx = std::min(minx,i);\n                maxx = std::max(maxx,i);\n                miny = std::min(miny,j);\n                maxy = std::max(maxy,j);\n            }\n        }\n    }\n\n    int lenx = maxx - minx;\n    int leny = maxy - miny;\n\n    Mat patch = Mat::zeros(Size(leny, lenx), CV_8UC3);\n\n    int minxd = p.y - lenx\/2;\n    int maxxd = p.y + lenx\/2;\n    int minyd = p.x - leny\/2;\n    int maxyd = p.x + leny\/2;\n\n    CV_Assert(minxd >= 0 && minyd >= 0 && maxxd <= dest.rows && maxyd <= dest.cols);\n\n    Rect roi_d(minyd,minxd,leny,lenx);\n    Rect roi_s(miny,minx,leny,lenx);\n\n    Mat destinationROI = dst_mask(roi_d);\n    Mat sourceROI = cs_mask(roi_s);\n\n    gray(roi_s).copyTo(destinationROI);\n    src(roi_s).copyTo(sourceROI,gray(roi_s));\n    src(roi_s).copyTo(patch, gray(roi_s));\n\n    destinationROI = cd_mask(roi_d);\n    cs_mask(roi_s).copyTo(destinationROI);\n\n\n    Cloning obj;\n    obj.normalClone(dest,cd_mask,dst_mask,blend,flags);\n\n}\n\nvoid cv::colorChange(InputArray _src, InputArray _mask, OutputArray _dst, float r, float g, float b)\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    float red = r;\n    float green = g;\n    float blue = b;\n\n    Mat gray = Mat::zeros(mask.size(),CV_8UC1);\n\n    if(mask.channels() == 3)\n        cvtColor(mask, gray, COLOR_BGR2GRAY );\n    else\n        gray = mask;\n\n    Mat cs_mask = Mat::zeros(src.size(),CV_8UC3);\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 a, float b)\n{\n\n    Mat src  = _src.getMat();\n    Mat mask  = _mask.getMat();\n    _dst.create(src.size(), src.type());\n    Mat blend = _dst.getMat();\n    float alpha = a;\n    float beta = b;\n\n    Mat gray = Mat::zeros(mask.size(),CV_8UC1);\n\n    if(mask.channels() == 3)\n        cvtColor(mask, gray, COLOR_BGR2GRAY );\n    else\n        gray = mask;\n\n    Mat cs_mask = Mat::zeros(src.size(),CV_8UC3);\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                           double low_threshold, double high_threshold, int kernel_size)\n{\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 = Mat::zeros(mask.size(),CV_8UC1);\n\n    if(mask.channels() == 3)\n        cvtColor(mask, gray, COLOR_BGR2GRAY );\n    else\n        gray = mask;\n\n    Mat cs_mask = Mat::zeros(src.size(),CV_8UC3);\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>another useless include<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\nvoid cv::seamlessClone(InputArray _src, InputArray _dst, InputArray _mask, Point p, OutputArray _blend, int flags)\n{\n    const Mat src  = _src.getMat();\n    const Mat dest = _dst.getMat();\n    const Mat mask = _mask.getMat();\n    _blend.create(dest.size(), CV_8UC3);\n    Mat blend = _blend.getMat();\n\n    int minx = INT_MAX, miny = INT_MAX, maxx = INT_MIN, maxy = INT_MIN;\n    int h = mask.size().height;\n    int w = mask.size().width;\n\n    Mat gray = Mat(mask.size(),CV_8UC1);\n    Mat dst_mask = Mat::zeros(dest.size(),CV_8UC1);\n    Mat cs_mask = Mat::zeros(src.size(),CV_8UC3);\n    Mat cd_mask = Mat::zeros(dest.size(),CV_8UC3);\n\n    if(mask.channels() == 3)\n        cvtColor(mask, gray, COLOR_BGR2GRAY );\n    else\n        gray = mask;\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                minx = std::min(minx,i);\n                maxx = std::max(maxx,i);\n                miny = std::min(miny,j);\n                maxy = std::max(maxy,j);\n            }\n        }\n    }\n\n    int lenx = maxx - minx;\n    int leny = maxy - miny;\n\n    Mat patch = Mat::zeros(Size(leny, lenx), CV_8UC3);\n\n    int minxd = p.y - lenx\/2;\n    int maxxd = p.y + lenx\/2;\n    int minyd = p.x - leny\/2;\n    int maxyd = p.x + leny\/2;\n\n    CV_Assert(minxd >= 0 && minyd >= 0 && maxxd <= dest.rows && maxyd <= dest.cols);\n\n    Rect roi_d(minyd,minxd,leny,lenx);\n    Rect roi_s(miny,minx,leny,lenx);\n\n    Mat destinationROI = dst_mask(roi_d);\n    Mat sourceROI = cs_mask(roi_s);\n\n    gray(roi_s).copyTo(destinationROI);\n    src(roi_s).copyTo(sourceROI,gray(roi_s));\n    src(roi_s).copyTo(patch, gray(roi_s));\n\n    destinationROI = cd_mask(roi_d);\n    cs_mask(roi_s).copyTo(destinationROI);\n\n\n    Cloning obj;\n    obj.normalClone(dest,cd_mask,dst_mask,blend,flags);\n\n}\n\nvoid cv::colorChange(InputArray _src, InputArray _mask, OutputArray _dst, float r, float g, float b)\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    float red = r;\n    float green = g;\n    float blue = b;\n\n    Mat gray = Mat::zeros(mask.size(),CV_8UC1);\n\n    if(mask.channels() == 3)\n        cvtColor(mask, gray, COLOR_BGR2GRAY );\n    else\n        gray = mask;\n\n    Mat cs_mask = Mat::zeros(src.size(),CV_8UC3);\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 a, float b)\n{\n\n    Mat src  = _src.getMat();\n    Mat mask  = _mask.getMat();\n    _dst.create(src.size(), src.type());\n    Mat blend = _dst.getMat();\n    float alpha = a;\n    float beta = b;\n\n    Mat gray = Mat::zeros(mask.size(),CV_8UC1);\n\n    if(mask.channels() == 3)\n        cvtColor(mask, gray, COLOR_BGR2GRAY );\n    else\n        gray = mask;\n\n    Mat cs_mask = Mat::zeros(src.size(),CV_8UC3);\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                           double low_threshold, double high_threshold, int kernel_size)\n{\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 = Mat::zeros(mask.size(),CV_8UC1);\n\n    if(mask.channels() == 3)\n        cvtColor(mask, gray, COLOR_BGR2GRAY );\n    else\n        gray = mask;\n\n    Mat cs_mask = Mat::zeros(src.size(),CV_8UC3);\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<|endoftext|>"}
{"text":"<commit_before>#include <cstdlib>\n#include <cstring>\n#include \"sass_interface.h\"\n#include \"emscripten_wrapper.hpp\"\n\nchar *sass_compile_emscripten(\n  char *source_string,\n  int output_style,\n  int source_comments,\n  char *include_paths,\n  char **error_message\n) {\n  char *output_string;\n  struct sass_options options;\n  struct sass_context *ctx = sass_new_context();\n\n  options.source_comments = source_comments;\n  options.output_style = output_style;\n  options.image_path = NULL;\n  options.include_paths = include_paths;\n\n  ctx->options = options;\n  ctx->source_string = source_string;\n\n  sass_compile(ctx);\n\n  if (ctx->output_string) {\n    output_string = strdup(ctx->output_string);\n  } else {\n    output_string = NULL;\n  }\n\n  if (ctx->error_status) {\n    *error_message = strdup(ctx->error_message);\n  } else {\n    *error_message = NULL;\n  }\n\n  sass_free_context(ctx);\n  return output_string;\n}\n\n<commit_msg>fix compiler warning about use of uninitialized stucture<commit_after>#include <cstdlib>\n#include <cstring>\n#include \"sass_interface.h\"\n#include \"emscripten_wrapper.hpp\"\n\nchar *sass_compile_emscripten(\n  char *source_string,\n  int output_style,\n  int source_comments,\n  char *include_paths,\n  char **error_message\n) {\n  char *output_string;\n  struct sass_options options;\n  struct sass_context *ctx = sass_new_context();\n\n  options.source_comments = source_comments;\n  options.output_style = output_style;\n  options.image_path = NULL;\n  options.include_paths = include_paths;\n  options.precision = 0; \/\/ 0 => use sass default numeric precision\n\n  ctx->options = options;\n  ctx->source_string = source_string;\n\n  sass_compile(ctx);\n\n  if (ctx->output_string) {\n    output_string = strdup(ctx->output_string);\n  } else {\n    output_string = NULL;\n  }\n\n  if (ctx->error_status) {\n    *error_message = strdup(ctx->error_message);\n  } else {\n    *error_message = NULL;\n  }\n\n  sass_free_context(ctx);\n  return output_string;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ This file is part of Poseidon.\n\/\/ Copyleft 2020, LH_Mouse. All wrongs reserved.\n\n#include \"..\/precompiled.hpp\"\n#include \"abstract_stream_socket.hpp\"\n#include \"socket_address.hpp\"\n#include \"..\/static\/network_driver.hpp\"\n#include \"..\/utilities.hpp\"\n\nnamespace poseidon {\n\nAbstract_Stream_Socket::\n~Abstract_Stream_Socket()\n  {\n  }\n\nIO_Result\nAbstract_Stream_Socket::\ndo_call_stream_preshutdown_nolock()\nnoexcept\n  {\n    \/\/ Call `do_stream_preshutdown_nolock()`, ignoring any exeptions.\n    auto io_res = io_result_eof;\n    try {\n      io_res = this->do_stream_preshutdown_nolock();\n    }\n    catch(const exception& stdex) {\n      POSEIDON_LOG_WARN(\"Failed to perform graceful shutdown on stream socket: $1\", this);\n    }\n    return io_res;\n  }\n\nvoid\nAbstract_Stream_Socket::\ndo_async_shutdown_nolock()\nnoexcept\n  {\n    switch(this->m_cstate) {\n      case connection_state_initial:\n      case connection_state_connecting:\n        \/\/ Shut down the connection. Discard pending data.\n        ::shutdown(this->get_fd(), SHUT_RDWR);\n        this->m_cstate = connection_state_closed;\n        POSEIDON_LOG_TRACE(\"Marked stream socket as CLOSED (not established): $1\", this);\n        break;\n\n      case connection_state_established:\n      case connection_state_closing:\n        \/\/ Ensure pending data are delivered.\n        if(this->m_wqueue.size() || (this->do_call_stream_preshutdown_nolock() != io_result_eof)) {\n          ::shutdown(this->get_fd(), SHUT_RD);\n          this->m_cstate = connection_state_closing;\n          POSEIDON_LOG_TRACE(\"Marked stream socket as CLOSING (data pending): $1\", this);\n        }\n        else {\n          ::shutdown(this->get_fd(), SHUT_RDWR);\n          this->m_cstate = connection_state_closed;\n          POSEIDON_LOG_TRACE(\"Marked stream socket as CLOSED (no data pending): $1\", this);\n        }\n        break;\n\n      case connection_state_closed:\n        \/\/ Do nothing.\n        break;\n    }\n  }\n\nIO_Result\nAbstract_Stream_Socket::\ndo_on_async_poll_read(Si_Mutex::unique_lock& lock, void* hint, size_t size)\n  {\n    lock.assign(this->m_mutex);\n\n    \/\/ If the stream is in CLOSED state, fail.\n    if(this->m_cstate == connection_state_closed)\n      return io_result_eof;\n\n    \/\/ Try reading some bytes.\n    auto io_res = this->do_stream_read_nolock(hint, size);\n    if(io_res < 0)\n      return io_res;\n\n    if(io_res == io_result_eof) {\n      this->do_async_shutdown_nolock();\n      return io_res;\n    }\n\n    \/\/ Process the data that have been read.\n    lock.unlock();\n    this->do_on_async_receive(hint, static_cast<size_t>(io_res));\n    lock.assign(this->m_mutex);\n    return io_res;\n  }\n\nsize_t\nAbstract_Stream_Socket::\ndo_write_queue_size(Si_Mutex::unique_lock& lock)\nconst\n  {\n    lock.assign(this->m_mutex);\n\n    \/\/ Get the size of pending data.\n    size_t size = this->m_wqueue.size();\n    if(size != 0)\n      return size;\n\n    \/\/ If a shutdown request is pending, report at least one byte.\n    if(this->m_cstate == connection_state_closing)\n      return 1;\n\n    \/\/ There is nothing to write.\n    return 0;\n  }\n\nIO_Result\nAbstract_Stream_Socket::\ndo_on_async_poll_write(Si_Mutex::unique_lock& lock, void* \/*hint*\/, size_t \/*size*\/)\n  {\n    lock.assign(this->m_mutex);\n\n    \/\/ If the stream is in CLOSED state, fail.\n    if(this->m_cstate == connection_state_closed)\n      return io_result_eof;\n\n    \/\/ If the stream is in CONNECTING state, mark it ESTABLISHED.\n    if(this->m_cstate < connection_state_established) {\n      this->m_cstate = connection_state_established;\n\n      lock.unlock();\n      this->do_on_async_establish();\n      lock.assign(this->m_mutex);\n    }\n\n    if(this->m_cstate <= connection_state_established) {\n      \/\/ Try writing some bytes.\n      size_t size = this->m_wqueue.size();\n      if(size == 0)\n        return io_result_eof;\n\n      auto io_res = this->do_stream_write_nolock(this->m_wqueue.data(), size);\n      if(io_res < 0)\n        return io_res;\n\n      \/\/ Remove data that have been written.\n      this->m_wqueue.discard(static_cast<size_t>(io_res));\n      return io_res;\n    }\n\n    \/\/ Shut down the connection completely now.\n    auto io_res = this->do_call_stream_preshutdown_nolock();\n    if(io_res != io_result_eof)\n      return io_res;\n\n    \/\/ Shutdown complete. Close thw connection now.\n    ::shutdown(this->get_fd(), SHUT_RDWR);\n    this->m_cstate = connection_state_closed;\n    POSEIDON_LOG_TRACE(\"Marked stream socket as CLOSED (pending data clear): $1\", this);\n    return io_res;\n  }\n\nvoid\nAbstract_Stream_Socket::\ndo_on_async_poll_shutdown(int err)\n  {\n    Si_Mutex::unique_lock lock(this->m_mutex);\n    this->m_cstate = connection_state_closed;\n    lock.unlock();\n\n    this->do_on_async_shutdown(err);\n  }\n\nvoid\nAbstract_Stream_Socket::\ndo_async_connect(const Socket_Address& addr)\n  {\n    \/\/ Lock the stream and examine connection state.\n    Si_Mutex::unique_lock lock(this->m_mutex);\n    if(this->m_cstate != connection_state_initial)\n      POSEIDON_THROW(\"another connection already in progress or established\");\n\n    \/\/ Initiate the connection.\n    this->do_stream_preconnect_nolock();\n\n    \/\/ No matter whether `::connect()` succeeds or fails with `EINPROGRESS`, the current\n    \/\/ socket is set to the CONNECTING state.\n    if(::connect(this->get_fd(), addr.data(), addr.size()) != 0) {\n      int err = errno;\n      if(err != EINPROGRESS)\n        POSEIDON_THROW(\"failed to initiate connection to '$2'\\n\",\n                       \"[`connect()` failed: $1]\",\n                       noadl::format_errno(err), addr);\n    }\n    this->m_cstate = connection_state_connecting;\n  }\n\nbool\nAbstract_Stream_Socket::\nasync_send(const void* data, size_t size)\n  {\n    Si_Mutex::unique_lock lock(this->m_mutex);\n    if(this->m_cstate > connection_state_established)\n      return false;\n\n    \/\/ Append data to the write queue.\n    this->m_wqueue.putn(static_cast<const char*>(data), size);\n    lock.unlock();\n\n    \/\/ Notify the driver about availability of outgoing data.\n    Network_Driver::notify_writable_internal(this);\n    return true;\n  }\n\nbool\nAbstract_Stream_Socket::\nasync_shutdown()\nnoexcept\n  {\n    Si_Mutex::unique_lock lock(this->m_mutex);\n    if(this->m_cstate == connection_state_closed)\n      return false;\n\n    \/\/ Initiate asynchronous shutdown.\n    this->do_async_shutdown_nolock();\n    lock.unlock();\n\n    \/\/ Notify the driver about availability of outgoing data.\n    Network_Driver::notify_writable_internal(this);\n    return true;\n  }\n\n}  \/\/ namespace poseidon\n<commit_msg>network\/abstract_stream_socket: Minor<commit_after>\/\/ This file is part of Poseidon.\n\/\/ Copyleft 2020, LH_Mouse. All wrongs reserved.\n\n#include \"..\/precompiled.hpp\"\n#include \"abstract_stream_socket.hpp\"\n#include \"socket_address.hpp\"\n#include \"..\/static\/network_driver.hpp\"\n#include \"..\/utilities.hpp\"\n\nnamespace poseidon {\n\nAbstract_Stream_Socket::\n~Abstract_Stream_Socket()\n  {\n  }\n\nIO_Result\nAbstract_Stream_Socket::\ndo_call_stream_preshutdown_nolock()\nnoexcept\n  {\n    \/\/ Call `do_stream_preshutdown_nolock()`, ignoring any exeptions.\n    auto io_res = io_result_eof;\n    try {\n      io_res = this->do_stream_preshutdown_nolock();\n    }\n    catch(const exception& stdex) {\n      POSEIDON_LOG_WARN(\"Failed to perform graceful shutdown on stream socket: $1\", this);\n    }\n    return io_res;\n  }\n\nvoid\nAbstract_Stream_Socket::\ndo_async_shutdown_nolock()\nnoexcept\n  {\n    switch(this->m_cstate) {\n      case connection_state_initial:\n      case connection_state_connecting:\n        \/\/ Shut down the connection. Discard pending data.\n        ::shutdown(this->get_fd(), SHUT_RDWR);\n        this->m_cstate = connection_state_closed;\n        POSEIDON_LOG_TRACE(\"Marked stream socket as CLOSED (not established): $1\", this);\n        break;\n\n      case connection_state_established:\n      case connection_state_closing:\n        \/\/ Ensure pending data are delivered.\n        if(this->m_wqueue.size() || (this->do_call_stream_preshutdown_nolock() != io_result_eof)) {\n          ::shutdown(this->get_fd(), SHUT_RD);\n          this->m_cstate = connection_state_closing;\n          POSEIDON_LOG_TRACE(\"Marked stream socket as CLOSING (data pending): $1\", this);\n        }\n        else {\n          ::shutdown(this->get_fd(), SHUT_RDWR);\n          this->m_cstate = connection_state_closed;\n          POSEIDON_LOG_TRACE(\"Marked stream socket as CLOSED (no data pending): $1\", this);\n        }\n        break;\n\n      case connection_state_closed:\n        \/\/ Do nothing.\n        break;\n    }\n  }\n\nIO_Result\nAbstract_Stream_Socket::\ndo_on_async_poll_read(Si_Mutex::unique_lock& lock, void* hint, size_t size)\n  {\n    lock.assign(this->m_mutex);\n\n    \/\/ If the stream is in CLOSED state, fail.\n    if(this->m_cstate == connection_state_closed)\n      return io_result_eof;\n\n    \/\/ Try reading some bytes.\n    auto io_res = this->do_stream_read_nolock(hint, size);\n    if(io_res < 0)\n      return io_res;\n\n    if(io_res == io_result_eof) {\n      this->do_async_shutdown_nolock();\n      return io_res;\n    }\n\n    \/\/ Process the data that have been read.\n    lock.unlock();\n    this->do_on_async_receive(hint, static_cast<size_t>(io_res));\n    lock.assign(this->m_mutex);\n    return io_res;\n  }\n\nsize_t\nAbstract_Stream_Socket::\ndo_write_queue_size(Si_Mutex::unique_lock& lock)\nconst\n  {\n    lock.assign(this->m_mutex);\n\n    \/\/ Get the size of pending data.\n    size_t size = this->m_wqueue.size();\n    if(size != 0)\n      return size;\n\n    \/\/ If a shutdown request is pending, report at least one byte.\n    if(this->m_cstate == connection_state_closing)\n      return 1;\n\n    \/\/ There is nothing to write.\n    return 0;\n  }\n\nIO_Result\nAbstract_Stream_Socket::\ndo_on_async_poll_write(Si_Mutex::unique_lock& lock, void* \/*hint*\/, size_t \/*size*\/)\n  {\n    lock.assign(this->m_mutex);\n\n    \/\/ If the stream is in CLOSED state, fail.\n    if(this->m_cstate == connection_state_closed)\n      return io_result_eof;\n\n    \/\/ If the stream is in CONNECTING state, mark it ESTABLISHED.\n    if(this->m_cstate < connection_state_established) {\n      this->m_cstate = connection_state_established;\n\n      lock.unlock();\n      this->do_on_async_establish();\n      lock.assign(this->m_mutex);\n    }\n\n    if(this->m_cstate <= connection_state_established) {\n      \/\/ Try writing some bytes.\n      size_t size = this->m_wqueue.size();\n      if(size == 0)\n        return io_result_eof;\n\n      auto io_res = this->do_stream_write_nolock(this->m_wqueue.data(), size);\n      if(io_res < 0)\n        return io_res;\n\n      \/\/ Remove data that have been written.\n      this->m_wqueue.discard(static_cast<size_t>(io_res));\n      return io_res;\n    }\n\n    \/\/ Shut down the connection completely now.\n    auto io_res = this->do_call_stream_preshutdown_nolock();\n    if(io_res != io_result_eof)\n      return io_res;\n\n    \/\/ Shutdown complete. Close thw connection now.\n    ::shutdown(this->get_fd(), SHUT_RDWR);\n    this->m_cstate = connection_state_closed;\n    POSEIDON_LOG_TRACE(\"Marked stream socket as CLOSED (pending data clear): $1\", this);\n    return io_res;\n  }\n\nvoid\nAbstract_Stream_Socket::\ndo_on_async_poll_shutdown(int err)\n  {\n    Si_Mutex::unique_lock lock(this->m_mutex);\n    this->m_cstate = connection_state_closed;\n    lock.unlock();\n\n    this->do_on_async_shutdown(err);\n  }\n\nvoid\nAbstract_Stream_Socket::\ndo_async_connect(const Socket_Address& addr)\n  {\n    \/\/ Lock the stream and examine connection state.\n    Si_Mutex::unique_lock lock(this->m_mutex);\n    if(this->m_cstate != connection_state_initial)\n      POSEIDON_THROW(\"another connection already in progress or established\");\n\n    \/\/ Initiate the connection.\n    this->do_stream_preconnect_nolock();\n\n    \/\/ No matter whether `::connect()` succeeds or fails with `EINPROGRESS`, the current\n    \/\/ socket is set to the CONNECTING state.\n    if(::connect(this->get_fd(), addr.data(), addr.size()) != 0) {\n      int err = errno;\n      if(err != EINPROGRESS)\n        POSEIDON_THROW(\"failed to initiate connection to '$2'\\n\",\n                       \"[`connect()` failed: $1]\",\n                       noadl::format_errno(err), addr);\n    }\n    this->m_cstate = connection_state_connecting;\n  }\n\nbool\nAbstract_Stream_Socket::\nasync_send(const void* data, size_t size)\n  {\n    Si_Mutex::unique_lock lock(this->m_mutex);\n    if(this->m_cstate > connection_state_established)\n      return false;\n\n    \/\/ Append data to the write queue.\n    this->m_wqueue.putn(static_cast<const char*>(data), size);\n    lock.unlock();\n\n    \/\/ Notify the driver about availability of outgoing data.\n    Network_Driver::notify_writable_internal(this);\n    return true;\n  }\n\nbool\nAbstract_Stream_Socket::\nasync_shutdown()\nnoexcept\n  {\n    Si_Mutex::unique_lock lock(this->m_mutex);\n    if(this->m_cstate > connection_state_established)\n      return false;\n\n    \/\/ Initiate asynchronous shutdown.\n    this->do_async_shutdown_nolock();\n    lock.unlock();\n\n    \/\/ Notify the driver about availability of outgoing data.\n    Network_Driver::notify_writable_internal(this);\n    return true;\n  }\n\n}  \/\/ namespace poseidon\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>planning: fixed obstacle history trajectory evaluate issue where there's only one point<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"canvas.hxx\"\n\n#include <utki\/debug.hpp>\n\nusing namespace svgren;\n\ncanvas::canvas(unsigned width, unsigned height) :\n\t\tdata(\n\t\t\t\twidth * height,\n#ifdef M_SVGREN_BACKGROUND\n\t\t\t\tM_SVGREN_BACKGROUND\n#else\n\t\t\t\t0\n#endif\n\t\t\t)\n#if SVGREN_BACKEND == SVGREN_BACKEND_CAIRO\n\t\t, surface(width, height, this->data.data())\n\t\t, cr(cairo_create(this->surface.surface))\n#endif\n{\n#if SVGREN_BACKEND == SVGREN_BACKEND_CAIRO\n\tif(!this->cr){\n\t\tthrow std::runtime_error(\"svgren::canvas::canvas(): could not create cairo context\");\n\t}\n#endif\n}\n\ncanvas::~canvas(){\n#if SVGREN_BACKEND == SVGREN_BACKEND_CAIRO\n\tcairo_destroy(this->cr);\n#endif\n}\n\nvoid canvas::scale(real x, real y){\n#if SVGREN_BACKEND == SVGREN_BACKEND_CAIRO\n\tcairo_scale(this->cr, x, y);\n\tASSERT(cairo_status(cr) == CAIRO_STATUS_SUCCESS)\n#endif\n}\n\nstd::vector<uint32_t> canvas::release(){\n#if SVGREN_BACKEND == SVGREN_BACKEND_CAIRO\n\tfor(auto &c : this->data){\n\t\t\/\/ swap red and blue channels, as cairo works in BGRA format, while we need to return RGBA\n\t\tc = (c & 0xff00ff00) | ((c << 16) & 0xff0000) | ((c >> 16) & 0xff);\n\n\t\t\/\/ unpremultiply alpha\n\t\tuint32_t a = (c >> 24);\n\t\tif(a == 0xff){\n\t\t\tcontinue;\n\t\t}\n\t\tif(a != 0){\n\t\t\tusing std::min;\n\t\t\tuint32_t r = (c & 0xff) * 0xff \/ a;\n\t\t\tr = min(r, uint32_t(0xff)); \/\/ clamp top\n\t\t\tuint32_t g = ((c >> 8) & 0xff) * 0xff \/ a;\n\t\t\tg = min(g, uint32_t(0xff)); \/\/ clamp top\n\t\t\tuint32_t b = ((c >> 16) & 0xff) * 0xff \/ a;\n\t\t\tb = min(b, uint32_t(0xff)); \/\/ clamp top\n\t\t\tc = ((a << 24) | (b << 16) | (g << 8) | r);\n\t\t}else{\n\t\t\tc = 0;\n\t\t}\n\t}\n#endif\n\n\treturn std::move(this->data);\n}<commit_msg>msvs build fix<commit_after>#include \"canvas.hxx\"\n\n#include <algorithm>\n\n#include <utki\/debug.hpp>\n\nusing namespace svgren;\n\ncanvas::canvas(unsigned width, unsigned height) :\n\t\tdata(\n\t\t\t\twidth * height,\n#ifdef M_SVGREN_BACKGROUND\n\t\t\t\tM_SVGREN_BACKGROUND\n#else\n\t\t\t\t0\n#endif\n\t\t\t)\n#if SVGREN_BACKEND == SVGREN_BACKEND_CAIRO\n\t\t, surface(width, height, this->data.data())\n\t\t, cr(cairo_create(this->surface.surface))\n#endif\n{\n#if SVGREN_BACKEND == SVGREN_BACKEND_CAIRO\n\tif(!this->cr){\n\t\tthrow std::runtime_error(\"svgren::canvas::canvas(): could not create cairo context\");\n\t}\n#endif\n}\n\ncanvas::~canvas(){\n#if SVGREN_BACKEND == SVGREN_BACKEND_CAIRO\n\tcairo_destroy(this->cr);\n#endif\n}\n\nvoid canvas::scale(real x, real y){\n#if SVGREN_BACKEND == SVGREN_BACKEND_CAIRO\n\tcairo_scale(this->cr, x, y);\n\tASSERT(cairo_status(cr) == CAIRO_STATUS_SUCCESS)\n#endif\n}\n\nstd::vector<uint32_t> canvas::release(){\n#if SVGREN_BACKEND == SVGREN_BACKEND_CAIRO\n\tfor(auto &c : this->data){\n\t\t\/\/ swap red and blue channels, as cairo works in BGRA format, while we need to return RGBA\n\t\tc = (c & 0xff00ff00) | ((c << 16) & 0xff0000) | ((c >> 16) & 0xff);\n\n\t\t\/\/ unpremultiply alpha\n\t\tuint32_t a = (c >> 24);\n\t\tif(a == 0xff){\n\t\t\tcontinue;\n\t\t}\n\t\tif(a != 0){\n\t\t\tusing std::min;\n\t\t\tuint32_t r = (c & 0xff) * 0xff \/ a;\n\t\t\tr = min(r, uint32_t(0xff)); \/\/ clamp top\n\t\t\tuint32_t g = ((c >> 8) & 0xff) * 0xff \/ a;\n\t\t\tg = min(g, uint32_t(0xff)); \/\/ clamp top\n\t\t\tuint32_t b = ((c >> 16) & 0xff) * 0xff \/ a;\n\t\t\tb = min(b, uint32_t(0xff)); \/\/ clamp top\n\t\t\tc = ((a << 24) | (b << 16) | (g << 8) | r);\n\t\t}else{\n\t\t\tc = 0;\n\t\t}\n\t}\n#endif\n\n\treturn std::move(this->data);\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\n\/\/ QtPropertyBrowser includes\n#include <QtVariantPropertyManager>\n\n\/\/ Visomics includes\n#include \"voKMeansClustering.h\"\n#include \"voTableDataObject.h\"\n#include \"voUtils.h\"\n#include \"vtkExtendedTable.h\"\n\n\/\/ VTK includes\n#include <vtkArrayData.h>\n#include <vtkIntArray.h>\n#include <vtkNew.h>\n#include <vtkRCalculatorFilter.h>\n#include <vtkSmartPointer.h>\n#include <vtkStringArray.h>\n#include <vtkTable.h>\n\n\/\/ --------------------------------------------------------------------------\n\/\/ voKMeansClustering methods\n\n\/\/ --------------------------------------------------------------------------\nvoKMeansClustering::voKMeansClustering():\n    Superclass()\n{\n  \/\/ Q_D(voKMeansClustering);\n}\n\n\/\/ --------------------------------------------------------------------------\nvoKMeansClustering::~voKMeansClustering()\n{\n}\n\n\/\/ --------------------------------------------------------------------------\nvoid voKMeansClustering::setInputInformation()\n{\n  this->addInputType(\"input\", \"vtkExtendedTable\");\n}\n\n\/\/ --------------------------------------------------------------------------\nvoid voKMeansClustering::setOutputInformation()\n{\n  this->addOutputType(\"cluster\", \"vtkTable\",\n                      \"voKMeansClusteringDynView\", \"Clusters (Dendogram)\",\n                      \"voTableView\", \"Clusters (Table)\");\n}\n\n\/\/ --------------------------------------------------------------------------\nvoid voKMeansClustering::setParameterInformation()\n{\n  QList<QtProperty*> kmeans_parameters;\n\n  \/\/ KMeans \/ Number of clusters (centers)\n  kmeans_parameters << this->addIntegerParameter(\"centers\", QObject::tr(\"Number of clusters\"), 2, 10, 4);\n\n  \/\/ KMeans \/ MaxIter\n  kmeans_parameters << this->addIntegerParameter(\"iter.max\", QObject::tr(\"Max. iteration\"), 5, 50, 10);\n\n  \/\/ KMeans \/ Algorithm\n  QStringList kmeans_algorithms;\n  kmeans_algorithms << \"Hartigan-Wong\" << \"Lloyd\" << \"Forgy\" << \"MacQueen\";\n  kmeans_parameters << this->addEnumParameter(\"algorithm\", \"Algorithm\", kmeans_algorithms);\n\n   \/\/ KMeans \/ number of random start\n  kmeans_parameters << this->addIntegerParameter(\"nstart\", QObject::tr(\"Number of random start\"), 1, 50, 10);\n\n  this->addParameterGroup(\"KMeans parameters\", kmeans_parameters);\n}\n\n\/\/ --------------------------------------------------------------------------\nQString voKMeansClustering::parameterDescription()const\n{\n  return QString(\"<dl>\"\n                 \"<dt><b>Number of clusters<\/b>:<\/dt>\"\n                 \"<dd>The value of <i>k<\/i>: the number of clusters.<\/dd>\"\n                 \"<dt><b>Max. iteration<\/b>:<\/dt>\"\n                 \"<dd>A larger number of iterations will take longer, \"\n                 \"but be more likely to converge on a better solution.<\/dd>\"\n                 \"<dt><b>Algorithm<\/b>:<\/dt>\"\n                 \"<dd>The specific algorithm for the k-means method.<\/dd>\"\n                 \"<dt><b>Number of random start<\/b>:<\/dt>\"\n                 \"<dd>Number of initially random cluster sets that the \"\n                 \"algorithm will attempt to refine. \"\n                 \"A larger number will take longer, \"\n                 \"but be more likely to converge on a better solution.<\/dd>\"\n                 \"<\/dl>\");\n}\n\nnamespace\n{\n\/\/ --------------------------------------------------------------------------\nQList<int> collectColumnIds(vtkTable* table, int value)\n{\n  Q_ASSERT(table);\n  QList<int> ids;\n  for(vtkIdType cid = 1; cid < table->GetNumberOfColumns(); ++cid)\n    {\n    vtkIntArray * currentColumn = vtkIntArray::SafeDownCast(table->GetColumn(cid));\n    int currentValue = currentColumn->GetValue(0);\n    if (currentValue == value)\n      {\n      ids << cid;\n      }\n    }\n  return ids;\n}\n\n\/\/ --------------------------------------------------------------------------\nvoid swapClusterIds(vtkTable* table, const QList<int>& columndIds1, int value1,\n                    const QList<int>& columnIds2, int value2)\n{\n  Q_ASSERT(table);\n  Q_ASSERT(!columndIds1.isEmpty());\n  Q_ASSERT(!columnIds2.isEmpty());\n  foreach(int cid, columndIds1)\n    {\n    vtkIntArray::SafeDownCast(table->GetColumn(cid))->SetValue(0, value2);\n    }\n  foreach(int cid, columnIds2)\n    {\n    vtkIntArray::SafeDownCast(table->GetColumn(cid))->SetValue(0, value1);\n    }\n}\n\n\/\/ --------------------------------------------------------------------------\nvoid displayClustedIds(const char* description, vtkTable* table)\n{\n  Q_ASSERT(table);\n  QList<int> columndIdsToDisplay;\n  for(vtkIdType cid = 1; cid < table->GetNumberOfColumns(); ++cid)\n    {\n    columndIdsToDisplay << vtkIntArray::SafeDownCast(table->GetColumn(cid))->GetValue(0);\n    }\n  qDebug() << description << columndIdsToDisplay;\n}\n\n} \/\/ end of anonymous namespace\n\n\/\/ --------------------------------------------------------------------------\nbool voKMeansClustering::execute()\n{\n  \/\/ Parameters\n  int kmeans_centers = this->integerParameter(\"centers\");\n  int kmeans_iter_max = this->integerParameter(\"iter.max\");\n  int kmeans_number_of_random_start = this->integerParameter(\"nstart\");\n  QString kmeans_algorithm = this->enumParameter(\"algorithm\");\n\n  \/\/ Import data table\n  vtkExtendedTable* extendedTable =  vtkExtendedTable::SafeDownCast(this->input()->dataAsVTKDataObject());\n  if (!extendedTable)\n    {\n    qCritical() << \"Input is Null\";\n    return false;\n    }\n\n  vtkSmartPointer<vtkTable> inputDataTable = extendedTable->GetData();\n\n  \/\/ Build ArrayData for input to R\n  vtkNew<vtkArrayData> RInputArrayData;\n    {\n    vtkSmartPointer<vtkArray> RInputArray;\n    voUtils::tableToArray(inputDataTable.GetPointer(), RInputArray);\n    RInputArrayData->AddArray(RInputArray.GetPointer());\n    }\n\n  \/\/ Run R\n  vtkNew<vtkRCalculatorFilter> RCalc;\n  RCalc->SetRoutput(0);\n  RCalc->SetInputData(RInputArrayData.GetPointer());\n  RCalc->PutArray(\"0\", \"metabData\");\n  RCalc->GetArray(\"kmCenters\", \"kmCenters\");\n  RCalc->GetArray(\"kmCluster\", \"kmCluster\");\n  RCalc->GetArray(\"kmWithinss\", \"kmWithinss\");\n  RCalc->GetArray(\"kmSize\", \"kmSize\");\n  RCalc->SetRscript(QString(\n                     \"metabDatat <- t(metabData)\\n\"\n                     \"km<-kmeans(metabDatat, %1, iter.max = %2, nstart = %3, algorithm = \\\"%4\\\")\\n\"\n                     \"kmCenters<-km$centers \\n\"\n                     \"kmCluster<-km$cluster\\n\"\n                     \"kmWithinss<-km$withinss\\n\"\n                     \"kmSize<-km$size\\n\"\n                     ).arg(kmeans_centers).arg(kmeans_iter_max).arg(kmeans_number_of_random_start).arg(kmeans_algorithm).toLatin1());\n  RCalc->Update();\n\n  \/\/ Get R output\n  vtkSmartPointer<vtkArrayData> outputArrayData = vtkArrayData::SafeDownCast(RCalc->GetOutput());\n  if(!outputArrayData || !outputArrayData->GetArrayByName(\"kmCluster\"))\n    {\n    qCritical() << QObject::tr(\"Fatal error in %1 R script\").arg(this->objectName());\n    return false;\n    }\n\n  \/\/ Get experiment names with column labels\n  vtkNew<vtkStringArray> columnNames;\n  voUtils::addCounterLabels(extendedTable->GetColumnMetaDataOfInterestAsString(),\n                            columnNames.GetPointer(), true);\n\n  \/\/ Get base cluster table\n  vtkNew<vtkTable> clusterTable;\n    {\n    vtkSmartPointer<vtkArray> rawClusterArray = outputArrayData->GetArrayByName(\"kmCluster\");\n\n    vtkNew<vtkStringArray> tempHeaderCol;\n    tempHeaderCol->InsertNextValue(QObject::tr(\"Cluster number\").toLatin1());\n    clusterTable->AddColumn(tempHeaderCol.GetPointer());\n\n    for(unsigned int i = 0; i < rawClusterArray->GetSize(); ++i)\n      {\n      vtkNew<vtkIntArray> newCol;\n      newCol->SetName(columnNames->GetValue(i));\n      newCol->InsertNextValue(rawClusterArray->GetVariantValue(i).ToInt());\n      clusterTable->AddColumn(newCol.GetPointer());\n      }\n    }\n  clusterTable->Dump();\n\n  \/\/ Renumber cluster table to be consistent\n  \/\/ Since the cluster id associated with each columns is arbitrary,\n  \/\/ let's make sure two successive execution of the analysis outputs\n  \/\/ the same result by re-labelling the cluster id of each column from left to right.\n  \/\/displayClustedIds(\"initial\", clusterTable.GetPointer());\n  int futureClusterId = 1;\n  QList<int> processedClusterIds;\n  for(vtkIdType cid = 1; cid < clusterTable->GetNumberOfColumns(); ++cid)\n    {\n    vtkIntArray * currentColumn = vtkIntArray::SafeDownCast(clusterTable->GetColumn(cid));\n    int currentClusterId = currentColumn->GetValue(0);\n    if (processedClusterIds.contains(currentClusterId))\n      {\n      continue;\n      }\n    QList<int> rightColumnIds = collectColumnIds(clusterTable.GetPointer(), currentClusterId);\n    QList<int> leftColumnIds = collectColumnIds(clusterTable.GetPointer(), futureClusterId);\n    swapClusterIds(clusterTable.GetPointer(), rightColumnIds, currentClusterId, leftColumnIds, futureClusterId);\n    processedClusterIds << futureClusterId;\n    ++futureClusterId;\n    }\n  \/\/displayClustedIds(\"final\", clusterTable.GetPointer());\n\n  voTableDataObject * dataObject = new voTableDataObject(\"cluster\", clusterTable.GetPointer());\n  dataObject->setProperty(\"kmeans_centers\", kmeans_centers);\n  this->setOutput(\"cluster\", dataObject);\n\n  return true;\n}\n<commit_msg>Remove unnecessary debug line<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\n\/\/ QtPropertyBrowser includes\n#include <QtVariantPropertyManager>\n\n\/\/ Visomics includes\n#include \"voKMeansClustering.h\"\n#include \"voTableDataObject.h\"\n#include \"voUtils.h\"\n#include \"vtkExtendedTable.h\"\n\n\/\/ VTK includes\n#include <vtkArrayData.h>\n#include <vtkIntArray.h>\n#include <vtkNew.h>\n#include <vtkRCalculatorFilter.h>\n#include <vtkSmartPointer.h>\n#include <vtkStringArray.h>\n#include <vtkTable.h>\n\n\/\/ --------------------------------------------------------------------------\n\/\/ voKMeansClustering methods\n\n\/\/ --------------------------------------------------------------------------\nvoKMeansClustering::voKMeansClustering():\n    Superclass()\n{\n  \/\/ Q_D(voKMeansClustering);\n}\n\n\/\/ --------------------------------------------------------------------------\nvoKMeansClustering::~voKMeansClustering()\n{\n}\n\n\/\/ --------------------------------------------------------------------------\nvoid voKMeansClustering::setInputInformation()\n{\n  this->addInputType(\"input\", \"vtkExtendedTable\");\n}\n\n\/\/ --------------------------------------------------------------------------\nvoid voKMeansClustering::setOutputInformation()\n{\n  this->addOutputType(\"cluster\", \"vtkTable\",\n                      \"voKMeansClusteringDynView\", \"Clusters (Dendogram)\",\n                      \"voTableView\", \"Clusters (Table)\");\n}\n\n\/\/ --------------------------------------------------------------------------\nvoid voKMeansClustering::setParameterInformation()\n{\n  QList<QtProperty*> kmeans_parameters;\n\n  \/\/ KMeans \/ Number of clusters (centers)\n  kmeans_parameters << this->addIntegerParameter(\"centers\", QObject::tr(\"Number of clusters\"), 2, 10, 4);\n\n  \/\/ KMeans \/ MaxIter\n  kmeans_parameters << this->addIntegerParameter(\"iter.max\", QObject::tr(\"Max. iteration\"), 5, 50, 10);\n\n  \/\/ KMeans \/ Algorithm\n  QStringList kmeans_algorithms;\n  kmeans_algorithms << \"Hartigan-Wong\" << \"Lloyd\" << \"Forgy\" << \"MacQueen\";\n  kmeans_parameters << this->addEnumParameter(\"algorithm\", \"Algorithm\", kmeans_algorithms);\n\n   \/\/ KMeans \/ number of random start\n  kmeans_parameters << this->addIntegerParameter(\"nstart\", QObject::tr(\"Number of random start\"), 1, 50, 10);\n\n  this->addParameterGroup(\"KMeans parameters\", kmeans_parameters);\n}\n\n\/\/ --------------------------------------------------------------------------\nQString voKMeansClustering::parameterDescription()const\n{\n  return QString(\"<dl>\"\n                 \"<dt><b>Number of clusters<\/b>:<\/dt>\"\n                 \"<dd>The value of <i>k<\/i>: the number of clusters.<\/dd>\"\n                 \"<dt><b>Max. iteration<\/b>:<\/dt>\"\n                 \"<dd>A larger number of iterations will take longer, \"\n                 \"but be more likely to converge on a better solution.<\/dd>\"\n                 \"<dt><b>Algorithm<\/b>:<\/dt>\"\n                 \"<dd>The specific algorithm for the k-means method.<\/dd>\"\n                 \"<dt><b>Number of random start<\/b>:<\/dt>\"\n                 \"<dd>Number of initially random cluster sets that the \"\n                 \"algorithm will attempt to refine. \"\n                 \"A larger number will take longer, \"\n                 \"but be more likely to converge on a better solution.<\/dd>\"\n                 \"<\/dl>\");\n}\n\nnamespace\n{\n\/\/ --------------------------------------------------------------------------\nQList<int> collectColumnIds(vtkTable* table, int value)\n{\n  Q_ASSERT(table);\n  QList<int> ids;\n  for(vtkIdType cid = 1; cid < table->GetNumberOfColumns(); ++cid)\n    {\n    vtkIntArray * currentColumn = vtkIntArray::SafeDownCast(table->GetColumn(cid));\n    int currentValue = currentColumn->GetValue(0);\n    if (currentValue == value)\n      {\n      ids << cid;\n      }\n    }\n  return ids;\n}\n\n\/\/ --------------------------------------------------------------------------\nvoid swapClusterIds(vtkTable* table, const QList<int>& columndIds1, int value1,\n                    const QList<int>& columnIds2, int value2)\n{\n  Q_ASSERT(table);\n  Q_ASSERT(!columndIds1.isEmpty());\n  Q_ASSERT(!columnIds2.isEmpty());\n  foreach(int cid, columndIds1)\n    {\n    vtkIntArray::SafeDownCast(table->GetColumn(cid))->SetValue(0, value2);\n    }\n  foreach(int cid, columnIds2)\n    {\n    vtkIntArray::SafeDownCast(table->GetColumn(cid))->SetValue(0, value1);\n    }\n}\n\n\/\/ --------------------------------------------------------------------------\nvoid displayClustedIds(const char* description, vtkTable* table)\n{\n  Q_ASSERT(table);\n  QList<int> columndIdsToDisplay;\n  for(vtkIdType cid = 1; cid < table->GetNumberOfColumns(); ++cid)\n    {\n    columndIdsToDisplay << vtkIntArray::SafeDownCast(table->GetColumn(cid))->GetValue(0);\n    }\n  qDebug() << description << columndIdsToDisplay;\n}\n\n} \/\/ end of anonymous namespace\n\n\/\/ --------------------------------------------------------------------------\nbool voKMeansClustering::execute()\n{\n  \/\/ Parameters\n  int kmeans_centers = this->integerParameter(\"centers\");\n  int kmeans_iter_max = this->integerParameter(\"iter.max\");\n  int kmeans_number_of_random_start = this->integerParameter(\"nstart\");\n  QString kmeans_algorithm = this->enumParameter(\"algorithm\");\n\n  \/\/ Import data table\n  vtkExtendedTable* extendedTable =  vtkExtendedTable::SafeDownCast(this->input()->dataAsVTKDataObject());\n  if (!extendedTable)\n    {\n    qCritical() << \"Input is Null\";\n    return false;\n    }\n\n  vtkSmartPointer<vtkTable> inputDataTable = extendedTable->GetData();\n\n  \/\/ Build ArrayData for input to R\n  vtkNew<vtkArrayData> RInputArrayData;\n    {\n    vtkSmartPointer<vtkArray> RInputArray;\n    voUtils::tableToArray(inputDataTable.GetPointer(), RInputArray);\n    RInputArrayData->AddArray(RInputArray.GetPointer());\n    }\n\n  \/\/ Run R\n  vtkNew<vtkRCalculatorFilter> RCalc;\n  RCalc->SetRoutput(0);\n  RCalc->SetInputData(RInputArrayData.GetPointer());\n  RCalc->PutArray(\"0\", \"metabData\");\n  RCalc->GetArray(\"kmCenters\", \"kmCenters\");\n  RCalc->GetArray(\"kmCluster\", \"kmCluster\");\n  RCalc->GetArray(\"kmWithinss\", \"kmWithinss\");\n  RCalc->GetArray(\"kmSize\", \"kmSize\");\n  RCalc->SetRscript(QString(\n                     \"metabDatat <- t(metabData)\\n\"\n                     \"km<-kmeans(metabDatat, %1, iter.max = %2, nstart = %3, algorithm = \\\"%4\\\")\\n\"\n                     \"kmCenters<-km$centers \\n\"\n                     \"kmCluster<-km$cluster\\n\"\n                     \"kmWithinss<-km$withinss\\n\"\n                     \"kmSize<-km$size\\n\"\n                     ).arg(kmeans_centers).arg(kmeans_iter_max).arg(kmeans_number_of_random_start).arg(kmeans_algorithm).toLatin1());\n  RCalc->Update();\n\n  \/\/ Get R output\n  vtkSmartPointer<vtkArrayData> outputArrayData = vtkArrayData::SafeDownCast(RCalc->GetOutput());\n  if(!outputArrayData || !outputArrayData->GetArrayByName(\"kmCluster\"))\n    {\n    qCritical() << QObject::tr(\"Fatal error in %1 R script\").arg(this->objectName());\n    return false;\n    }\n\n  \/\/ Get experiment names with column labels\n  vtkNew<vtkStringArray> columnNames;\n  voUtils::addCounterLabels(extendedTable->GetColumnMetaDataOfInterestAsString(),\n                            columnNames.GetPointer(), true);\n\n  \/\/ Get base cluster table\n  vtkNew<vtkTable> clusterTable;\n    {\n    vtkSmartPointer<vtkArray> rawClusterArray = outputArrayData->GetArrayByName(\"kmCluster\");\n\n    vtkNew<vtkStringArray> tempHeaderCol;\n    tempHeaderCol->InsertNextValue(QObject::tr(\"Cluster number\").toLatin1());\n    clusterTable->AddColumn(tempHeaderCol.GetPointer());\n\n    for(unsigned int i = 0; i < rawClusterArray->GetSize(); ++i)\n      {\n      vtkNew<vtkIntArray> newCol;\n      newCol->SetName(columnNames->GetValue(i));\n      newCol->InsertNextValue(rawClusterArray->GetVariantValue(i).ToInt());\n      clusterTable->AddColumn(newCol.GetPointer());\n      }\n    }\n\n  \/\/ Renumber cluster table to be consistent\n  \/\/ Since the cluster id associated with each columns is arbitrary,\n  \/\/ let's make sure two successive execution of the analysis outputs\n  \/\/ the same result by re-labelling the cluster id of each column from left to right.\n  \/\/displayClustedIds(\"initial\", clusterTable.GetPointer());\n  int futureClusterId = 1;\n  QList<int> processedClusterIds;\n  for(vtkIdType cid = 1; cid < clusterTable->GetNumberOfColumns(); ++cid)\n    {\n    vtkIntArray * currentColumn = vtkIntArray::SafeDownCast(clusterTable->GetColumn(cid));\n    int currentClusterId = currentColumn->GetValue(0);\n    if (processedClusterIds.contains(currentClusterId))\n      {\n      continue;\n      }\n    QList<int> rightColumnIds = collectColumnIds(clusterTable.GetPointer(), currentClusterId);\n    QList<int> leftColumnIds = collectColumnIds(clusterTable.GetPointer(), futureClusterId);\n    swapClusterIds(clusterTable.GetPointer(), rightColumnIds, currentClusterId, leftColumnIds, futureClusterId);\n    processedClusterIds << futureClusterId;\n    ++futureClusterId;\n    }\n  \/\/displayClustedIds(\"final\", clusterTable.GetPointer());\n\n  voTableDataObject * dataObject = new voTableDataObject(\"cluster\", clusterTable.GetPointer());\n  dataObject->setProperty(\"kmeans_centers\", kmeans_centers);\n  this->setOutput(\"cluster\", dataObject);\n\n  return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************************\n *                                                                                       *\n * OpenSpace                                                                             *\n *                                                                                       *\n * Copyright (c) 2014-2018                                                               *\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 <modules\/space\/translation\/keplertranslation.h>\n\n#include <openspace\/documentation\/verifier.h>\n#include <openspace\/util\/spicemanager.h>\n\n#include <openspace\/util\/updatestructures.h>\n\n#include <glm\/gtx\/transform.hpp>\n\n#include <math.h>\n\nnamespace {\n\ntemplate <typename T, typename Func>\nT solveIteration(Func function, T x0, const T& err = 0.0, int maxIterations = 100) {\n    T x = 0;\n    T x2 = x0;\n\n    for (int i = 0; i < maxIterations; ++i) {\n        x = x2;\n        x2 = function(x);\n        if (std::abs(x2 - x) < err) {\n            return x2;\n        }\n    }\n\n    return x2;\n}\n\n    static const openspace::properties::Property::PropertyInfo EccentricityInfo = {\n        \"Eccentricity\",\n        \"Eccentricity\",\n        \"This value determines the eccentricity, that is the deviation from a perfect \"\n        \"sphere, for this orbit. Currently, hyperbolic orbits using Keplerian elements \"\n        \"are not supported.\"\n    };\n\n    static const openspace::properties::Property::PropertyInfo SemiMajorAxisInfo = {\n        \"SemiMajorAxis\",\n        \"Semi-major axis\",\n        \"This value determines the semi-major axis, that is the distance of the object \"\n        \"from the central body in kilometers (semi-major axis = average of periapsis and \"\n        \"apoapsis).\"\n    };\n\n    static const openspace::properties::Property::PropertyInfo InclinationInfo = {\n        \"Inclination\",\n        \"Inclination\",\n        \"This value determines the degrees of inclination, or the angle of the orbital \"\n        \"plane, relative to the reference plane, on which the object orbits around the \"\n        \"central body.\"\n    };\n\n    static const openspace::properties::Property::PropertyInfo AscendingNodeInfo = {\n        \"AscendingNode\",\n        \"Right ascension of ascending Node\",\n        \"This value determines the right ascension of the ascending node in degrees, \"\n        \"that is the location of position along the orbit where the inclined plane and \"\n        \"the horizonal reference plane intersect.\"\n    };\n\n    static const openspace::properties::Property::PropertyInfo ArgumentOfPeriapsisInfo = {\n        \"ArgumentOfPeriapsis\",\n        \"Argument of Periapsis\",\n        \"This value determines the argument of periapsis in degrees, that is the \"\n        \"position on the orbit that is closest to the orbiting body.\"\n    };\n\n    static const openspace::properties::Property::PropertyInfo MeanAnomalyAtEpochInfo = {\n        \"MeanAnomaly\",\n        \"Mean anomaly at epoch\",\n        \"This value determines the mean anomaly at the epoch in degrees, which \"\n        \"determines the initial location of the object along the orbit at epoch.\"\n    };\n\n    static const openspace::properties::Property::PropertyInfo EpochInfo = {\n        \"Epoch\",\n        \"Epoch\",\n        \"This value determines the epoch for which the initial location is defined in \"\n        \"the form of YYYY MM DD HH:mm:ss.\"\n    };\n\n    static const openspace::properties::Property::PropertyInfo PeriodInfo = {\n        \"Period\",\n        \"Orbit period\",\n        \"Specifies the orbital period (in seconds).\"\n    };\n} \/\/ namespace\n\nnamespace openspace {\n\nKeplerTranslation::RangeError::RangeError(std::string off)\n    : ghoul::RuntimeError(\"Value '\" + off + \"' out of range\", \"KeplerTranslation\")\n    , offender(std::move(off))\n{}\n\ndocumentation::Documentation KeplerTranslation::Documentation() {\n    using namespace openspace::documentation;\n    return {\n        \"Kepler Translation\",\n        \"space_transform_kepler\",\n        {\n            {\n                \"Type\",\n                new StringEqualVerifier(\"KeplerTranslation\"),\n                Optional::No\n            },\n            {\n                EccentricityInfo.identifier,\n                new DoubleInRangeVerifier(0.0, 1.0),\n                Optional::No,\n                EccentricityInfo.description\n            },\n            {\n                SemiMajorAxisInfo.identifier,\n                new DoubleVerifier,\n                Optional::No,\n                SemiMajorAxisInfo.description\n            },\n            {\n                InclinationInfo.identifier,\n                new DoubleInRangeVerifier(0.0, 360.0),\n                Optional::No,\n                InclinationInfo.description\n            },\n            {\n                AscendingNodeInfo.identifier,\n                new DoubleInRangeVerifier(0.0, 360.0),\n                Optional::No,\n                AscendingNodeInfo.description\n            },\n            {\n                ArgumentOfPeriapsisInfo.identifier,\n                new DoubleInRangeVerifier(0.0, 360.0),\n                Optional::No,\n                ArgumentOfPeriapsisInfo.description\n            },\n            {\n                MeanAnomalyAtEpochInfo.identifier,\n                new DoubleInRangeVerifier(0.0, 360.0),\n                Optional::No,\n                MeanAnomalyAtEpochInfo.description\n            },\n            {\n                EpochInfo.identifier,\n                new StringVerifier,\n                Optional::No,\n                EpochInfo.description\n            },\n            {\n                PeriodInfo.identifier,\n                new DoubleGreaterVerifier(0.0),\n                Optional::No,\n                PeriodInfo.description\n            },\n        }\n    };\n}\n\nKeplerTranslation::KeplerTranslation()\n    : Translation()\n    , _eccentricity(EccentricityInfo, 0.0, 0.0, 1.0)\n    , _semiMajorAxis(SemiMajorAxisInfo, 0.0, 0.0, 1e6)\n    , _inclination(InclinationInfo, 0.0, 0.0, 360.0)\n    , _ascendingNode(AscendingNodeInfo, 0.0, 0.0, 360.0)\n    , _argumentOfPeriapsis(ArgumentOfPeriapsisInfo, 0.0, 0.0, 360.0)\n    , _meanAnomalyAtEpoch(MeanAnomalyAtEpochInfo, 0.0, 0.0, 360.0)\n    , _epoch(EpochInfo, 0.0, 0.0, 1e9)\n    , _period(PeriodInfo, 0.0, 0.0, 1e6)\n    , _orbitPlaneDirty(true)\n{\n    auto update = [this]() {\n        _orbitPlaneDirty = true;\n        requireUpdate();\n    };\n\n    \/\/ Only the eccentricity, semimajor axis, inclination, and location of ascending node\n    \/\/ invalidate the shape of the orbit. The other parameters only determine the location\n    \/\/ the spacecraft on that orbit\n    _eccentricity.onChange(update);\n    addProperty(_eccentricity);\n\n    _semiMajorAxis.onChange(update);\n    addProperty(_semiMajorAxis);\n\n    _inclination.onChange(update);\n    addProperty(_inclination);\n\n    _ascendingNode.onChange(update);\n    addProperty(_ascendingNode);\n\n    _argumentOfPeriapsis.onChange(update);\n    addProperty(_argumentOfPeriapsis);\n\n    addProperty(_meanAnomalyAtEpoch);\n    addProperty(_epoch);\n    addProperty(_period);\n}\n\nKeplerTranslation::KeplerTranslation(const ghoul::Dictionary& dictionary)\n    : KeplerTranslation()\n{\n    documentation::testSpecificationAndThrow(\n        Documentation(),\n        dictionary,\n        \"KeplerTranslation\"\n    );\n\n    setKeplerElements(\n        dictionary.value<double>(EccentricityInfo.identifier),\n        dictionary.value<double>(SemiMajorAxisInfo.identifier),\n        dictionary.value<double>(InclinationInfo.identifier),\n        dictionary.value<double>(AscendingNodeInfo.identifier),\n        dictionary.value<double>(ArgumentOfPeriapsisInfo.identifier),\n        dictionary.value<double>(MeanAnomalyAtEpochInfo.identifier),\n        dictionary.value<double>(PeriodInfo.identifier),\n        dictionary.value<std::string>(EpochInfo.identifier)\n    );\n}\n\ndouble KeplerTranslation::eccentricAnomaly(double meanAnomaly) const {\n    \/\/ Compute the eccentric anomaly (the location of the spacecraft taking the\n    \/\/ eccentricity of the orbit into account) using different solves for the regimes in\n    \/\/ which they are most efficient\n\n    if (_eccentricity == 0.0) {\n        \/\/ In a circular orbit, the eccentric anomaly = mean anomaly\n        return meanAnomaly;\n    }\n    else if (_eccentricity < 0.2) {\n        auto solver = [this, &meanAnomaly](double x) -> double {\n            \/\/ For low eccentricity, using a first order solver sufficient\n            return meanAnomaly + _eccentricity * sin(x);\n        };\n        return solveIteration(solver, meanAnomaly, 0.0, 5);\n    }\n    else if (_eccentricity < 0.9) {\n        auto solver = [this, &meanAnomaly](double x) -> double {\n            double e = _eccentricity;\n            return x + (meanAnomaly + e * sin(x) - x) \/ (1.0 - e * cos(x));\n        };\n        return solveIteration(solver, meanAnomaly, 0.0, 6);\n    }\n    else if (_eccentricity < 1.0) {\n        auto sign = [](double val) -> double {\n            return val > 0.0 ? 1.0 : ((val < 0.0) ? -1.0 : 0.0);\n        };\n        double e = meanAnomaly + 0.85 * _eccentricity * sign(sin(meanAnomaly));\n\n        auto solver = [this, &meanAnomaly, &sign](double x) -> double {\n            double s = _eccentricity * sin(x);\n            double c = _eccentricity * cos(x);\n            double f = x - s - meanAnomaly;\n            double f1 = 1 - c;\n            double f2 = s;\n            return x + (-5 * f \/ (f1 + sign(f1) *\n                sqrt(std::abs(16 * f1 * f1 - 20 * f * f2))));\n        };\n        return solveIteration(solver, e, 0.0, 8);\n    }\n    else {\n        ghoul_assert(false, \"Eccentricity must not be >= 1.0\");\n        LERRORC(\"KeplerTranslation\", \"Eccentricity must not be >= 1.0\");\n        return 0.0;\n    }\n}\n\nglm::dvec3 KeplerTranslation::position(const Time& time) const {\n    if (_orbitPlaneDirty) {\n        computeOrbitPlane();\n        _orbitPlaneDirty = false;\n    }\n\n    double t = time.j2000Seconds() - _epoch;\n    double meanMotion = 2.0 * glm::pi<double>() \/ _period;\n    double meanAnomaly = glm::radians(_meanAnomalyAtEpoch.value()) + t * meanMotion;\n    double e = eccentricAnomaly(meanAnomaly);\n\n    \/\/ Use the eccentric anomaly to compute the actual location\n    double a = _semiMajorAxis \/ (1.0 - _eccentricity) * 1000.0;\n    glm::dvec3 p = {\n        a * (cos(e) - _eccentricity),\n        a * sqrt(1.0 - _eccentricity * _eccentricity) * sin(e),\n        0.0\n    };\n    return _orbitPlaneRotation * p;\n}\n\nvoid KeplerTranslation::computeOrbitPlane() const {\n    \/\/ We assume the following coordinate system:\n    \/\/ z = axis of rotation\n    \/\/ x = pointing towards the first point of Aries\n    \/\/ y completes the righthanded coordinate system\n\n    \/\/ Perform three rotations:\n    \/\/ 1. Around the z axis to place the location of the ascending node\n    \/\/ 2. Around the x axis (now aligned with the ascending node) to get the correct\n    \/\/ inclination\n    \/\/ 3. Around the new z axis to place the closest approach to the correct location\n\n    const glm::vec3 ascendingNodeAxisRot = { 0.f, 0.f, 1.f };\n    const glm::vec3 inclinationAxisRot = { 1.f, 0.f, 0.f };\n    const glm::vec3 argPeriapsisAxisRot = { 0.f, 0.f, 1.f };\n\n    const double asc = glm::radians(_ascendingNode.value());\n    const double inc = glm::radians(_inclination.value());\n    const double per = glm::radians(_argumentOfPeriapsis.value());\n\n    _orbitPlaneRotation =\n        glm::rotate(asc, glm::dvec3(ascendingNodeAxisRot)) *\n        glm::rotate(inc, glm::dvec3(inclinationAxisRot)) *\n        glm::rotate(per, glm::dvec3(argPeriapsisAxisRot));\n\n    notifyObservers();\n    _orbitPlaneDirty = false;\n}\n\nvoid KeplerTranslation::setKeplerElements(double eccentricity, double semiMajorAxis,\n                                          double inclination, double ascendingNode,\n                                          double argumentOfPeriapsis,\n                                          double meanAnomalyAtEpoch,\n                                          double orbitalPeriod, const std::string& epoch)\n{\n    setKeplerElements(\n        eccentricity,\n        semiMajorAxis,\n        inclination,\n        ascendingNode,\n        argumentOfPeriapsis,\n        meanAnomalyAtEpoch,\n        orbitalPeriod,\n        SpiceManager::ref().ephemerisTimeFromDate(epoch)\n    );\n}\n\nvoid KeplerTranslation::setKeplerElements(double eccentricity, double semiMajorAxis,\n                                          double inclination, double ascendingNode,\n                                          double argumentOfPeriapsis,\n                                          double meanAnomalyAtEpoch,\n                                          double orbitalPeriod, double epoch)\n{\n    auto isInRange = [](double val, double min, double max) -> bool {\n        return val >= min && val <= max;\n    };\n\n    if (isInRange(eccentricity, 0.0, 1.0)) {\n        _eccentricity = eccentricity;\n    }\n    else {\n        throw RangeError(\"Eccentricity\");\n    }\n\n    _semiMajorAxis = semiMajorAxis;\n\n    if (isInRange(inclination, 0.0, 360.0)) {\n        _inclination = inclination;\n    }\n    else {\n        throw RangeError(\"Inclination\");\n    }\n\n    if (isInRange(_ascendingNode, 0.0, 360.0)) {\n        _ascendingNode = ascendingNode;\n    }\n    else {\n        throw RangeError(\"Ascending Node\");\n    }\n    if (isInRange(_argumentOfPeriapsis, 0.0, 360.0)) {\n        _argumentOfPeriapsis = argumentOfPeriapsis;\n    }\n    else {\n        throw RangeError(\"Argument of Periapsis\");\n    }\n\n    if (isInRange(_meanAnomalyAtEpoch, 0.0, 360.0)) {\n        _meanAnomalyAtEpoch = meanAnomalyAtEpoch;\n    }\n    else {\n        throw RangeError(\"Mean anomaly at epoch\");\n    }\n\n    _period = orbitalPeriod;\n    _epoch = epoch;\n\n    computeOrbitPlane();\n}\n\n} \/\/ namespace openspace\n<commit_msg>Fix KeplerTranslation to use the correct semi-major axis<commit_after>\/*****************************************************************************************\n *                                                                                       *\n * OpenSpace                                                                             *\n *                                                                                       *\n * Copyright (c) 2014-2018                                                               *\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 <modules\/space\/translation\/keplertranslation.h>\n\n#include <openspace\/documentation\/verifier.h>\n#include <openspace\/util\/spicemanager.h>\n\n#include <openspace\/util\/updatestructures.h>\n\n#include <glm\/gtx\/transform.hpp>\n\n#include <math.h>\n\nnamespace {\n\ntemplate <typename T, typename Func>\nT solveIteration(Func function, T x0, const T& err = 0.0, int maxIterations = 100) {\n    T x = 0;\n    T x2 = x0;\n\n    for (int i = 0; i < maxIterations; ++i) {\n        x = x2;\n        x2 = function(x);\n        if (std::abs(x2 - x) < err) {\n            return x2;\n        }\n    }\n\n    return x2;\n}\n\n    static const openspace::properties::Property::PropertyInfo EccentricityInfo = {\n        \"Eccentricity\",\n        \"Eccentricity\",\n        \"This value determines the eccentricity, that is the deviation from a perfect \"\n        \"sphere, for this orbit. Currently, hyperbolic orbits using Keplerian elements \"\n        \"are not supported.\"\n    };\n\n    static const openspace::properties::Property::PropertyInfo SemiMajorAxisInfo = {\n        \"SemiMajorAxis\",\n        \"Semi-major axis\",\n        \"This value determines the semi-major axis, that is the distance of the object \"\n        \"from the central body in kilometers (semi-major axis = average of periapsis and \"\n        \"apoapsis).\"\n    };\n\n    static const openspace::properties::Property::PropertyInfo InclinationInfo = {\n        \"Inclination\",\n        \"Inclination\",\n        \"This value determines the degrees of inclination, or the angle of the orbital \"\n        \"plane, relative to the reference plane, on which the object orbits around the \"\n        \"central body.\"\n    };\n\n    static const openspace::properties::Property::PropertyInfo AscendingNodeInfo = {\n        \"AscendingNode\",\n        \"Right ascension of ascending Node\",\n        \"This value determines the right ascension of the ascending node in degrees, \"\n        \"that is the location of position along the orbit where the inclined plane and \"\n        \"the horizonal reference plane intersect.\"\n    };\n\n    static const openspace::properties::Property::PropertyInfo ArgumentOfPeriapsisInfo = {\n        \"ArgumentOfPeriapsis\",\n        \"Argument of Periapsis\",\n        \"This value determines the argument of periapsis in degrees, that is the \"\n        \"position on the orbit that is closest to the orbiting body.\"\n    };\n\n    static const openspace::properties::Property::PropertyInfo MeanAnomalyAtEpochInfo = {\n        \"MeanAnomaly\",\n        \"Mean anomaly at epoch\",\n        \"This value determines the mean anomaly at the epoch in degrees, which \"\n        \"determines the initial location of the object along the orbit at epoch.\"\n    };\n\n    static const openspace::properties::Property::PropertyInfo EpochInfo = {\n        \"Epoch\",\n        \"Epoch\",\n        \"This value determines the epoch for which the initial location is defined in \"\n        \"the form of YYYY MM DD HH:mm:ss.\"\n    };\n\n    static const openspace::properties::Property::PropertyInfo PeriodInfo = {\n        \"Period\",\n        \"Orbit period\",\n        \"Specifies the orbital period (in seconds).\"\n    };\n} \/\/ namespace\n\nnamespace openspace {\n\nKeplerTranslation::RangeError::RangeError(std::string off)\n    : ghoul::RuntimeError(\"Value '\" + off + \"' out of range\", \"KeplerTranslation\")\n    , offender(std::move(off))\n{}\n\ndocumentation::Documentation KeplerTranslation::Documentation() {\n    using namespace openspace::documentation;\n    return {\n        \"Kepler Translation\",\n        \"space_transform_kepler\",\n        {\n            {\n                \"Type\",\n                new StringEqualVerifier(\"KeplerTranslation\"),\n                Optional::No\n            },\n            {\n                EccentricityInfo.identifier,\n                new DoubleInRangeVerifier(0.0, 1.0),\n                Optional::No,\n                EccentricityInfo.description\n            },\n            {\n                SemiMajorAxisInfo.identifier,\n                new DoubleVerifier,\n                Optional::No,\n                SemiMajorAxisInfo.description\n            },\n            {\n                InclinationInfo.identifier,\n                new DoubleInRangeVerifier(0.0, 360.0),\n                Optional::No,\n                InclinationInfo.description\n            },\n            {\n                AscendingNodeInfo.identifier,\n                new DoubleInRangeVerifier(0.0, 360.0),\n                Optional::No,\n                AscendingNodeInfo.description\n            },\n            {\n                ArgumentOfPeriapsisInfo.identifier,\n                new DoubleInRangeVerifier(0.0, 360.0),\n                Optional::No,\n                ArgumentOfPeriapsisInfo.description\n            },\n            {\n                MeanAnomalyAtEpochInfo.identifier,\n                new DoubleInRangeVerifier(0.0, 360.0),\n                Optional::No,\n                MeanAnomalyAtEpochInfo.description\n            },\n            {\n                EpochInfo.identifier,\n                new StringVerifier,\n                Optional::No,\n                EpochInfo.description\n            },\n            {\n                PeriodInfo.identifier,\n                new DoubleGreaterVerifier(0.0),\n                Optional::No,\n                PeriodInfo.description\n            },\n        }\n    };\n}\n\nKeplerTranslation::KeplerTranslation()\n    : Translation()\n    , _eccentricity(EccentricityInfo, 0.0, 0.0, 1.0)\n    , _semiMajorAxis(SemiMajorAxisInfo, 0.0, 0.0, 1e6)\n    , _inclination(InclinationInfo, 0.0, 0.0, 360.0)\n    , _ascendingNode(AscendingNodeInfo, 0.0, 0.0, 360.0)\n    , _argumentOfPeriapsis(ArgumentOfPeriapsisInfo, 0.0, 0.0, 360.0)\n    , _meanAnomalyAtEpoch(MeanAnomalyAtEpochInfo, 0.0, 0.0, 360.0)\n    , _epoch(EpochInfo, 0.0, 0.0, 1e9)\n    , _period(PeriodInfo, 0.0, 0.0, 1e6)\n    , _orbitPlaneDirty(true)\n{\n    auto update = [this]() {\n        _orbitPlaneDirty = true;\n        requireUpdate();\n    };\n\n    \/\/ Only the eccentricity, semimajor axis, inclination, and location of ascending node\n    \/\/ invalidate the shape of the orbit. The other parameters only determine the location\n    \/\/ the spacecraft on that orbit\n    _eccentricity.onChange(update);\n    addProperty(_eccentricity);\n\n    _semiMajorAxis.onChange(update);\n    addProperty(_semiMajorAxis);\n\n    _inclination.onChange(update);\n    addProperty(_inclination);\n\n    _ascendingNode.onChange(update);\n    addProperty(_ascendingNode);\n\n    _argumentOfPeriapsis.onChange(update);\n    addProperty(_argumentOfPeriapsis);\n\n    addProperty(_meanAnomalyAtEpoch);\n    addProperty(_epoch);\n    addProperty(_period);\n}\n\nKeplerTranslation::KeplerTranslation(const ghoul::Dictionary& dictionary)\n    : KeplerTranslation()\n{\n    documentation::testSpecificationAndThrow(\n        Documentation(),\n        dictionary,\n        \"KeplerTranslation\"\n    );\n\n    setKeplerElements(\n        dictionary.value<double>(EccentricityInfo.identifier),\n        dictionary.value<double>(SemiMajorAxisInfo.identifier),\n        dictionary.value<double>(InclinationInfo.identifier),\n        dictionary.value<double>(AscendingNodeInfo.identifier),\n        dictionary.value<double>(ArgumentOfPeriapsisInfo.identifier),\n        dictionary.value<double>(MeanAnomalyAtEpochInfo.identifier),\n        dictionary.value<double>(PeriodInfo.identifier),\n        dictionary.value<std::string>(EpochInfo.identifier)\n    );\n}\n\ndouble KeplerTranslation::eccentricAnomaly(double meanAnomaly) const {\n    \/\/ Compute the eccentric anomaly (the location of the spacecraft taking the\n    \/\/ eccentricity of the orbit into account) using different solves for the regimes in\n    \/\/ which they are most efficient\n\n    if (_eccentricity == 0.0) {\n        \/\/ In a circular orbit, the eccentric anomaly = mean anomaly\n        return meanAnomaly;\n    }\n    else if (_eccentricity < 0.2) {\n        auto solver = [this, &meanAnomaly](double x) -> double {\n            \/\/ For low eccentricity, using a first order solver sufficient\n            return meanAnomaly + _eccentricity * sin(x);\n        };\n        return solveIteration(solver, meanAnomaly, 0.0, 5);\n    }\n    else if (_eccentricity < 0.9) {\n        auto solver = [this, &meanAnomaly](double x) -> double {\n            double e = _eccentricity;\n            return x + (meanAnomaly + e * sin(x) - x) \/ (1.0 - e * cos(x));\n        };\n        return solveIteration(solver, meanAnomaly, 0.0, 6);\n    }\n    else if (_eccentricity < 1.0) {\n        auto sign = [](double val) -> double {\n            return val > 0.0 ? 1.0 : ((val < 0.0) ? -1.0 : 0.0);\n        };\n        double e = meanAnomaly + 0.85 * _eccentricity * sign(sin(meanAnomaly));\n\n        auto solver = [this, &meanAnomaly, &sign](double x) -> double {\n            double s = _eccentricity * sin(x);\n            double c = _eccentricity * cos(x);\n            double f = x - s - meanAnomaly;\n            double f1 = 1 - c;\n            double f2 = s;\n            return x + (-5 * f \/ (f1 + sign(f1) *\n                sqrt(std::abs(16 * f1 * f1 - 20 * f * f2))));\n        };\n        return solveIteration(solver, e, 0.0, 8);\n    }\n    else {\n        ghoul_assert(false, \"Eccentricity must not be >= 1.0\");\n        LERRORC(\"KeplerTranslation\", \"Eccentricity must not be >= 1.0\");\n        return 0.0;\n    }\n}\n\nglm::dvec3 KeplerTranslation::position(const Time& time) const {\n    if (_orbitPlaneDirty) {\n        computeOrbitPlane();\n        _orbitPlaneDirty = false;\n    }\n\n    double t = time.j2000Seconds() - _epoch;\n    double meanMotion = 2.0 * glm::pi<double>() \/ _period;\n    double meanAnomaly = glm::radians(_meanAnomalyAtEpoch.value()) + t * meanMotion;\n    double e = eccentricAnomaly(meanAnomaly);\n\n    \/\/ Use the eccentric anomaly to compute the actual location\n    glm::dvec3 p = {\n        _semiMajorAxis * 1000.0 * (cos(e) - _eccentricity),\n        _semiMajorAxis * 1000.0 * sin(e) * sqrt(1.0 - _eccentricity * _eccentricity),\n        0.0\n    };\n    return _orbitPlaneRotation * p;\n}\n\nvoid KeplerTranslation::computeOrbitPlane() const {\n    \/\/ We assume the following coordinate system:\n    \/\/ z = axis of rotation\n    \/\/ x = pointing towards the first point of Aries\n    \/\/ y completes the righthanded coordinate system\n\n    \/\/ Perform three rotations:\n    \/\/ 1. Around the z axis to place the location of the ascending node\n    \/\/ 2. Around the x axis (now aligned with the ascending node) to get the correct\n    \/\/ inclination\n    \/\/ 3. Around the new z axis to place the closest approach to the correct location\n\n    const glm::vec3 ascendingNodeAxisRot = { 0.f, 0.f, 1.f };\n    const glm::vec3 inclinationAxisRot = { 1.f, 0.f, 0.f };\n    const glm::vec3 argPeriapsisAxisRot = { 0.f, 0.f, 1.f };\n\n    const double asc = glm::radians(_ascendingNode.value());\n    const double inc = glm::radians(_inclination.value());\n    const double per = glm::radians(_argumentOfPeriapsis.value());\n\n    _orbitPlaneRotation =\n        glm::rotate(asc, glm::dvec3(ascendingNodeAxisRot)) *\n        glm::rotate(inc, glm::dvec3(inclinationAxisRot)) *\n        glm::rotate(per, glm::dvec3(argPeriapsisAxisRot));\n\n    notifyObservers();\n    _orbitPlaneDirty = false;\n}\n\nvoid KeplerTranslation::setKeplerElements(double eccentricity, double semiMajorAxis,\n                                          double inclination, double ascendingNode,\n                                          double argumentOfPeriapsis,\n                                          double meanAnomalyAtEpoch,\n                                          double orbitalPeriod, const std::string& epoch)\n{\n    setKeplerElements(\n        eccentricity,\n        semiMajorAxis,\n        inclination,\n        ascendingNode,\n        argumentOfPeriapsis,\n        meanAnomalyAtEpoch,\n        orbitalPeriod,\n        SpiceManager::ref().ephemerisTimeFromDate(epoch)\n    );\n}\n\nvoid KeplerTranslation::setKeplerElements(double eccentricity, double semiMajorAxis,\n                                          double inclination, double ascendingNode,\n                                          double argumentOfPeriapsis,\n                                          double meanAnomalyAtEpoch,\n                                          double orbitalPeriod, double epoch)\n{\n    auto isInRange = [](double val, double min, double max) -> bool {\n        return val >= min && val <= max;\n    };\n\n    if (isInRange(eccentricity, 0.0, 1.0)) {\n        _eccentricity = eccentricity;\n    }\n    else {\n        throw RangeError(\"Eccentricity\");\n    }\n\n    _semiMajorAxis = semiMajorAxis;\n\n    if (isInRange(inclination, 0.0, 360.0)) {\n        _inclination = inclination;\n    }\n    else {\n        throw RangeError(\"Inclination\");\n    }\n\n    if (isInRange(_ascendingNode, 0.0, 360.0)) {\n        _ascendingNode = ascendingNode;\n    }\n    else {\n        throw RangeError(\"Ascending Node\");\n    }\n    if (isInRange(_argumentOfPeriapsis, 0.0, 360.0)) {\n        _argumentOfPeriapsis = argumentOfPeriapsis;\n    }\n    else {\n        throw RangeError(\"Argument of Periapsis\");\n    }\n\n    if (isInRange(_meanAnomalyAtEpoch, 0.0, 360.0)) {\n        _meanAnomalyAtEpoch = meanAnomalyAtEpoch;\n    }\n    else {\n        throw RangeError(\"Mean anomaly at epoch\");\n    }\n\n    _period = orbitalPeriod;\n    _epoch = epoch;\n\n    computeOrbitPlane();\n}\n\n} \/\/ namespace openspace\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n\n    SDL Input Events Handling\n\n  Copyright (c) 2013 Jeffrey Carpenter\n  All rights reserved.\n\n******************************************************************************\/\n#include \"SDL_Input.hpp\"\n\nnom::SDL_Input::SDL_Input ( void )\n{\nNOMLIB_LOG_INFO;\n\n  if ( SDL_InitSubSystem ( SDL_INIT_JOYSTICK ) == -1 )\n  {\nNOMLIB_LOG_ERR ( SDL_GetError() );\n    return;\n  }\n\n  this->joystick = nullptr;\n\n  \/\/ Only initialize this joystick if we have yet to\n  if ( SDL_JoystickOpened ( 0 ) == 0 )\n  {\n    SDL_JoystickEventState ( SDL_ENABLE );\n\n    this->joystick = SDL_JoystickOpen ( 0 );\n\n    std::cout << SDL_NumJoysticks() << \" joysticks were found \" << std::endl << std::endl;\n\n    if ( SDL_NumJoysticks() > 0 )\n    {\n      for( int idx = 0; idx < SDL_NumJoysticks(); idx++ )\n      {\n        std::cout << SDL_JoystickName ( idx ) << std::endl << std::endl;\n      }\n    }\n  }\n}\n\nnom::SDL_Input::~SDL_Input ( void )\n{\nNOMLIB_LOG_INFO;\n\n  \/\/ Only close joysticks we have opened\n  \/\/if ( SDL_JoystickOpened ( 0 ) == 1 )\n  \/\/{\n    \/\/SDL_JoystickClose ( this->joystick );\n\n    \/\/if ( this->joystick )\n      \/\/this->joystick = nullptr;\n  \/\/}\n\n  \/\/SDL_QuitSubSystem ( SDL_INIT_JOYSTICK );\n}\n\n\nvoid nom::SDL_Input::HandleInput ( void* event )\n{\n  SDL_Event *input = (SDL_Event*) event;\n\n  switch ( input->type )\n  {\n    case SDL_ACTIVEEVENT:\n    {\n      switch ( input->active.state )\n      {\n        case SDL_APPMOUSEFOCUS:\n        {\n          if ( input->active.gain )\n            this->onMouseFocus();\n          else\n            this->onMouseBlur();\n          break;\n        }\n\n        case SDL_APPINPUTFOCUS:\n        {\n          if ( input->active.gain )\n            this->onInputFocus();\n          else\n            this->onInputBlur();\n          break;\n        }\n        case SDL_APPACTIVE:\n        {\n          if ( input->active.gain )\n            this->onRestore();\n          else\n            this->onMinimize();\n          break;\n        }\n\n      }\n    break;\n    }\n\n    default:\n    {\n      this->onUserEvent ( input->user.type, input->user.code, input->user.data1,\n                    input->user.data2\n                  );\n      break;\n    }\n\n    case SDL_VIDEORESIZE: this->onResize ( input->resize.w, input->resize.h ); break;\n    case SDL_VIDEOEXPOSE: this->onExpose (); break;\n    case SDL_SYSWMEVENT: \/* Ignore *\/ break;\n    case SDL_QUIT: this->onQuit(); break;\n\n    case SDL_KEYDOWN:\n      this->onKeyDown ( input->key.keysym.sym, input->key.keysym.mod );\n    break;\n\n    case SDL_KEYUP:\n      this->onKeyUp ( input->key.keysym.sym, input->key.keysym.mod );\n    break;\n\n    case SDL_MOUSEMOTION:\n      this->onMouseMotion ( input->motion.x, input->motion.y );\n    break;\n\n    case SDL_MOUSEBUTTONDOWN:\n      switch ( input->button.button )\n      {\n        case SDL_BUTTON_LEFT:\n          this->onMouseLeftButtonDown ( input->button.x, input->button.y );\n        break;\n\n        case SDL_BUTTON_MIDDLE:\n          this->onMouseMiddleButtonDown ( input->button.x, input->button.y );\n        break;\n\n        case SDL_BUTTON_RIGHT:\n          this->onMouseRightButtonDown ( input->button.x, input->button.y );\n        break;\n\n        case SDL_BUTTON_WHEELDOWN: this->onMouseWheel ( false, true ); break;\n\n        case SDL_BUTTON_WHEELUP: this->onMouseWheel ( true, false ); break;\n      }\n    break;\n\n    case SDL_MOUSEBUTTONUP:\n      switch ( input->button.button )\n      {\n        case SDL_BUTTON_LEFT:\n          this->onMouseLeftButtonUp ( input->button.x, input->button.y );\n        break;\n\n        case SDL_BUTTON_MIDDLE:\n          this->onMouseMiddleButtonUp ( input->button.x, input->button.y );\n        break;\n\n        case SDL_BUTTON_RIGHT:\n          this->onMouseRightButtonUp ( input->button.x, input->button.y );\n        break;\n      }\n    break;\n\n    case SDL_JOYBUTTONDOWN:\n      this->onJoyButtonDown ( input->jbutton.which, input->jbutton.button );\n    break;\n\n    case SDL_JOYBUTTONUP:\n      this->onJoyButtonUp ( input->jbutton.which, input->jbutton.button );\n    break;\n\n    case SDL_JOYAXISMOTION:\n      this->onJoyAxis ( input->jaxis.which, input->jaxis.axis, input->jaxis.value );\n    break;\n  } \/\/ end switch input->type\n}\n\nvoid nom::SDL_Input::onUserEvent ( uint8_t type, int32_t code, void* data1, void* data2 )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onQuit ( void )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onResize ( int32_t width, int32_t height )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onRestore ( void )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onMinimize ( void )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onInputFocus ( void )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onInputBlur ( void )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onMouseFocus ( void )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onMouseBlur ( void )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onExpose ( void )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onKeyDown ( int32_t key, int32_t mod )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onKeyUp ( int32_t key, int32_t mod )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onMouseMotion ( int32_t x, int32_t y )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onMouseWheel ( bool up, bool down )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onMouseLeftButtonDown ( int32_t x, int32_t y )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onMouseMiddleButtonDown ( int32_t x, int32_t y )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onMouseRightButtonDown ( int32_t x, int32_t y )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onMouseLeftButtonUp ( int32_t x, int32_t y )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onMouseMiddleButtonUp ( int32_t x, int32_t y )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onMouseRightButtonUp ( int32_t x, int32_t y )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onJoyButtonDown ( int32_t which, int32_t button )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onJoyButtonUp ( int32_t which, int32_t button )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onJoyAxis ( int32_t which, int32_t axis, short value )\n{\n  \/\/ virtual implementation\n}\n<commit_msg>Remove default case & add SDL_USEREVENT case; use c++ cast instead of C style<commit_after>\/******************************************************************************\n\n    SDL Input Events Handling\n\n  Copyright (c) 2013 Jeffrey Carpenter\n  All rights reserved.\n\n******************************************************************************\/\n#include \"SDL_Input.hpp\"\n\nnom::SDL_Input::SDL_Input ( void )\n{\nNOMLIB_LOG_INFO;\n\n  if ( SDL_InitSubSystem ( SDL_INIT_JOYSTICK ) == -1 )\n  {\nNOMLIB_LOG_ERR ( SDL_GetError() );\n    return;\n  }\n\n  this->joystick = nullptr;\n\n  \/\/ Only initialize this joystick if we have yet to\n  if ( SDL_JoystickOpened ( 0 ) == 0 )\n  {\n    SDL_JoystickEventState ( SDL_ENABLE );\n\n    this->joystick = SDL_JoystickOpen ( 0 );\n\n    std::cout << SDL_NumJoysticks() << \" joysticks were found \" << std::endl << std::endl;\n\n    if ( SDL_NumJoysticks() > 0 )\n    {\n      for( int idx = 0; idx < SDL_NumJoysticks(); idx++ )\n      {\n        std::cout << SDL_JoystickName ( idx ) << std::endl << std::endl;\n      }\n    }\n  }\n}\n\nnom::SDL_Input::~SDL_Input ( void )\n{\nNOMLIB_LOG_INFO;\n\n  \/\/ Only close joysticks we have opened\n  \/\/if ( SDL_JoystickOpened ( 0 ) == 1 )\n  \/\/{\n    \/\/SDL_JoystickClose ( this->joystick );\n\n    \/\/if ( this->joystick )\n      \/\/this->joystick = nullptr;\n  \/\/}\n\n  \/\/SDL_QuitSubSystem ( SDL_INIT_JOYSTICK );\n}\n\n\nvoid nom::SDL_Input::HandleInput ( void* event )\n{\n  SDL_Event* input = static_cast<SDL_Event*> ( event );\n\n  switch ( input->type )\n  {\n    case SDL_ACTIVEEVENT:\n    {\n      switch ( input->active.state )\n      {\n        case SDL_APPMOUSEFOCUS:\n        {\n          if ( input->active.gain )\n            this->onMouseFocus();\n          else\n            this->onMouseBlur();\n          break;\n        }\n\n        case SDL_APPINPUTFOCUS:\n        {\n          if ( input->active.gain )\n            this->onInputFocus();\n          else\n            this->onInputBlur();\n          break;\n        }\n        case SDL_APPACTIVE:\n        {\n          if ( input->active.gain )\n            this->onRestore();\n          else\n            this->onMinimize();\n          break;\n        }\n\n      }\n    break;\n    }\n\n    case SDL_USEREVENT:\n      this->onUserEvent ( input->user.type, input->user.code, input->user.data1,\n                          input->user.data2\n                        );\n    break;\n\n    case SDL_VIDEORESIZE: this->onResize ( input->resize.w, input->resize.h ); break;\n    case SDL_VIDEOEXPOSE: this->onExpose (); break;\n    case SDL_SYSWMEVENT: \/* Ignore *\/ break;\n    case SDL_QUIT: this->onQuit(); break;\n\n    case SDL_KEYDOWN:\n      this->onKeyDown ( input->key.keysym.sym, input->key.keysym.mod );\n    break;\n\n    case SDL_KEYUP:\n      this->onKeyUp ( input->key.keysym.sym, input->key.keysym.mod );\n    break;\n\n    case SDL_MOUSEMOTION:\n      this->onMouseMotion ( input->motion.x, input->motion.y );\n    break;\n\n    case SDL_MOUSEBUTTONDOWN:\n      switch ( input->button.button )\n      {\n        case SDL_BUTTON_LEFT:\n          this->onMouseLeftButtonDown ( input->button.x, input->button.y );\n        break;\n\n        case SDL_BUTTON_MIDDLE:\n          this->onMouseMiddleButtonDown ( input->button.x, input->button.y );\n        break;\n\n        case SDL_BUTTON_RIGHT:\n          this->onMouseRightButtonDown ( input->button.x, input->button.y );\n        break;\n\n        case SDL_BUTTON_WHEELDOWN: this->onMouseWheel ( false, true ); break;\n\n        case SDL_BUTTON_WHEELUP: this->onMouseWheel ( true, false ); break;\n      }\n    break;\n\n    case SDL_MOUSEBUTTONUP:\n      switch ( input->button.button )\n      {\n        case SDL_BUTTON_LEFT:\n          this->onMouseLeftButtonUp ( input->button.x, input->button.y );\n        break;\n\n        case SDL_BUTTON_MIDDLE:\n          this->onMouseMiddleButtonUp ( input->button.x, input->button.y );\n        break;\n\n        case SDL_BUTTON_RIGHT:\n          this->onMouseRightButtonUp ( input->button.x, input->button.y );\n        break;\n      }\n    break;\n\n    case SDL_JOYBUTTONDOWN:\n      this->onJoyButtonDown ( input->jbutton.which, input->jbutton.button );\n    break;\n\n    case SDL_JOYBUTTONUP:\n      this->onJoyButtonUp ( input->jbutton.which, input->jbutton.button );\n    break;\n\n    case SDL_JOYAXISMOTION:\n      this->onJoyAxis ( input->jaxis.which, input->jaxis.axis, input->jaxis.value );\n    break;\n  } \/\/ end switch input->type\n}\n\nvoid nom::SDL_Input::onUserEvent ( uint8_t type, int32_t code, void* data1, void* data2 )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onQuit ( void )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onResize ( int32_t width, int32_t height )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onRestore ( void )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onMinimize ( void )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onInputFocus ( void )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onInputBlur ( void )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onMouseFocus ( void )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onMouseBlur ( void )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onExpose ( void )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onKeyDown ( int32_t key, int32_t mod )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onKeyUp ( int32_t key, int32_t mod )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onMouseMotion ( int32_t x, int32_t y )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onMouseWheel ( bool up, bool down )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onMouseLeftButtonDown ( int32_t x, int32_t y )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onMouseMiddleButtonDown ( int32_t x, int32_t y )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onMouseRightButtonDown ( int32_t x, int32_t y )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onMouseLeftButtonUp ( int32_t x, int32_t y )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onMouseMiddleButtonUp ( int32_t x, int32_t y )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onMouseRightButtonUp ( int32_t x, int32_t y )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onJoyButtonDown ( int32_t which, int32_t button )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onJoyButtonUp ( int32_t which, int32_t button )\n{\n  \/\/ virtual implementation\n}\n\nvoid nom::SDL_Input::onJoyAxis ( int32_t which, int32_t axis, short value )\n{\n  \/\/ virtual implementation\n}\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\/portability\/GFlags.h>\n#include <folly\/portability\/GTest.h>\n#include <folly\/test\/TestUtils.h>\n\n#include <thrift\/lib\/cpp2\/transport\/core\/testutil\/MockCallback.h>\n#include <thrift\/lib\/cpp2\/transport\/core\/testutil\/TransportCompatibilityTest.h>\n#include <thrift\/lib\/cpp2\/transport\/rocket\/test\/util\/TestUtil.h>\n\nDECLARE_string(transport); \/\/ ConnectionManager depends on this flag.\n\nnamespace apache {\nnamespace thrift {\n\nusing namespace testutil::testservice;\nusing namespace apache::thrift::transport;\n\nclass TransportUpgradeCompatibilityTest : public testing::TestWithParam<bool> {\n public:\n  TransportUpgradeCompatibilityTest() {\n    FLAGS_transport = \"header\";\n\n    compatibilityTest_ = std::make_unique<TransportCompatibilityTest>();\n    compatibilityTest_->setTransportUpgrade(GetParam());\n    compatibilityTest_->startServer();\n  }\n\n protected:\n  std::unique_ptr<TransportCompatibilityTest> compatibilityTest_;\n};\n\nINSTANTIATE_TEST_CASE_P(\n    NoUpgrade, TransportUpgradeCompatibilityTest, testing::Values(false));\nINSTANTIATE_TEST_CASE_P(\n    Upgrade, TransportUpgradeCompatibilityTest, testing::Values(true));\n\nTEST_P(TransportUpgradeCompatibilityTest, RequestResponse_Simple) {\n  compatibilityTest_->TestRequestResponse_Simple();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, RequestResponse_Sync) {\n  compatibilityTest_->TestRequestResponse_Sync();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, RequestResponse_Destruction) {\n  compatibilityTest_->TestRequestResponse_Destruction();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, RequestResponse_MultipleClients) {\n  compatibilityTest_->TestRequestResponse_MultipleClients();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, RequestResponse_ExpectedException) {\n  compatibilityTest_->TestRequestResponse_ExpectedException();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, RequestResponse_UnexpectedException) {\n  compatibilityTest_->TestRequestResponse_UnexpectedException();\n}\n\n\/\/ Warning: This test may be flaky due to use of timeouts.\nTEST_P(TransportUpgradeCompatibilityTest, RequestResponse_Timeout) {\n  compatibilityTest_->TestRequestResponse_Timeout();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, DefaultTimeoutValueTest) {\n  compatibilityTest_->connectToServer([](auto client) {\n    \/\/ Opts with no timeout value\n    RpcOptions opts;\n\n    \/\/ Ok to sleep for 100msec\n    auto cb = std::make_unique<MockCallback>(false, false);\n    client->sleep(opts, std::move(cb), 100);\n\n    \/* Sleep to give time for all callbacks to be completed *\/\n    \/* sleep override *\/\n    std::this_thread::sleep_for(std::chrono::milliseconds(200));\n\n    auto* channel = dynamic_cast<ClientChannel*>(client->getChannel());\n    EXPECT_TRUE(channel);\n    channel->getEventBase()->runInEventBaseThreadAndWait([&]() {\n      channel->setTimeout(1); \/\/ 1ms\n    });\n\n    \/\/ Now it should timeout\n    cb = std::make_unique<MockCallback>(false, true);\n    client->sleep(opts, std::move(cb), 100);\n\n    \/* Sleep to give time for all callbacks to be completed *\/\n    \/* sleep override *\/\n    std::this_thread::sleep_for(std::chrono::milliseconds(200));\n  });\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, RequestResponse_Header) {\n  compatibilityTest_->TestRequestResponse_Header();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, RequestResponse_Header_Load) {\n  compatibilityTest_->TestRequestResponse_Header_Load();\n}\n\nTEST_P(\n    TransportUpgradeCompatibilityTest,\n    RequestResponse_Header_ExpectedException) {\n  compatibilityTest_->TestRequestResponse_Header_ExpectedException();\n}\n\nTEST_P(\n    TransportUpgradeCompatibilityTest,\n    RequestResponse_Header_UnexpectedException) {\n  compatibilityTest_->TestRequestResponse_Header_UnexpectedException();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, RequestResponse_IsOverloaded) {\n  compatibilityTest_->TestRequestResponse_IsOverloaded();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, RequestResponse_Connection_CloseNow) {\n  compatibilityTest_->connectToServer([](auto client) {\n    \/\/ It should not reach to server: no EXPECT_CALL for add_(3)\n\n    \/\/ Observe the behavior if the connection is closed already\n    auto channel = static_cast<ClientChannel*>(client->getChannel());\n    channel->getEventBase()->runInEventBaseThreadAndWait(\n        [&]() { channel->closeNow(); });\n\n    try {\n      client->future_add(3).get();\n      EXPECT_TRUE(false) << \"future_add should have thrown\";\n    } catch (TTransportException& ex) {\n      EXPECT_EQ(TTransportException::UNKNOWN, ex.getType());\n      EXPECT_PRED_FORMAT2(IsSubstring, \"Channel is !good()\", ex.what());\n    }\n  });\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, RequestResponse_ServerQueueTimeout) {\n  compatibilityTest_->TestRequestResponse_ServerQueueTimeout();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, RequestResponse_ResponseSizeTooBig) {\n  compatibilityTest_->TestRequestResponse_ResponseSizeTooBig();\n}\n\n\/\/ TODO(T90625074)\nTEST_P(\n    TransportUpgradeCompatibilityTest, DISABLED_RequestResponse_Checksumming) {\n  SKIP_IF(GetParam() == false)\n      << \"Checksum not implemented for header transport\";\n  compatibilityTest_->TestRequestResponse_Checksumming();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, Oneway_Simple) {\n  compatibilityTest_->TestOneway_Simple();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, Oneway_WithDelay) {\n  compatibilityTest_->TestOneway_WithDelay();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, Oneway_UnexpectedException) {\n  compatibilityTest_->TestOneway_UnexpectedException();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, Oneway_Connection_CloseNow) {\n  compatibilityTest_->TestOneway_Connection_CloseNow();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, Oneway_ServerQueueTimeout) {\n  compatibilityTest_->TestOneway_ServerQueueTimeout();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, Oneway_Checksumming) {\n  SKIP_IF(GetParam() == false)\n      << \"Checksum not implemented for header transport\";\n  compatibilityTest_->TestOneway_Checksumming();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, RequestContextIsPreserved) {\n  compatibilityTest_->TestRequestContextIsPreserved();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, BadPayload) {\n  compatibilityTest_->TestBadPayload();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, EvbSwitch) {\n  compatibilityTest_->TestEvbSwitch();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, EvbSwitch_Failure) {\n  compatibilityTest_->TestEvbSwitch_Failure();\n}\n\nclass CloseCallbackTest : public CloseCallback {\n public:\n  void channelClosed() override {\n    EXPECT_FALSE(closed_);\n    closed_ = true;\n  }\n  bool isClosed() { return closed_; }\n\n private:\n  bool closed_{false};\n};\n\nTEST_P(TransportUpgradeCompatibilityTest, CloseCallback) {\n  compatibilityTest_->connectToServer(\n      [this](std::unique_ptr<TestServiceAsyncClient> client) {\n        EXPECT_CALL(*compatibilityTest_->handler_.get(), sumTwoNumbers_(1, 2))\n            .Times(1);\n\n        auto closeCb = std::make_unique<CloseCallbackTest>();\n        auto channel = static_cast<ClientChannel*>(client->getChannel());\n        auto evb = channel->getEventBase();\n        evb->runInEventBaseThreadAndWait(\n            [&]() { channel->setCloseCallback(closeCb.get()); });\n        \/\/ send a request so that transport upgrade kicks in (if enabled)\n        EXPECT_EQ(3, client->future_sumTwoNumbers(1, 2).get());\n\n        EXPECT_FALSE(closeCb->isClosed());\n        evb->runInEventBaseThreadAndWait([&]() { channel->closeNow(); });\n        EXPECT_TRUE(closeCb->isClosed());\n      });\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, ConnectionStats) {\n  compatibilityTest_->TestConnectionStats();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, ObserverSendReceiveRequests) {\n  compatibilityTest_->TestObserverSendReceiveRequests();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, ConnectionContext) {\n  compatibilityTest_->TestConnectionContext();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, ClientIdentityHook) {\n  compatibilityTest_->TestClientIdentityHook();\n}\n\n} \/\/ namespace thrift\n} \/\/ namespace apache\n<commit_msg>Remove skips from tests<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\/portability\/GFlags.h>\n#include <folly\/portability\/GTest.h>\n#include <folly\/test\/TestUtils.h>\n\n#include <thrift\/lib\/cpp2\/transport\/core\/testutil\/MockCallback.h>\n#include <thrift\/lib\/cpp2\/transport\/core\/testutil\/TransportCompatibilityTest.h>\n#include <thrift\/lib\/cpp2\/transport\/rocket\/test\/util\/TestUtil.h>\n\nDECLARE_string(transport); \/\/ ConnectionManager depends on this flag.\n\nnamespace apache {\nnamespace thrift {\n\nusing namespace testutil::testservice;\nusing namespace apache::thrift::transport;\n\nclass TransportUpgradeCompatibilityTest : public testing::TestWithParam<bool> {\n public:\n  TransportUpgradeCompatibilityTest() {\n    FLAGS_transport = \"header\";\n\n    compatibilityTest_ = std::make_unique<TransportCompatibilityTest>();\n    compatibilityTest_->setTransportUpgrade(GetParam());\n    compatibilityTest_->startServer();\n  }\n\n protected:\n  std::unique_ptr<TransportCompatibilityTest> compatibilityTest_;\n};\n\nINSTANTIATE_TEST_CASE_P(\n    NoUpgrade, TransportUpgradeCompatibilityTest, testing::Values(false));\nINSTANTIATE_TEST_CASE_P(\n    Upgrade, TransportUpgradeCompatibilityTest, testing::Values(true));\n\nTEST_P(TransportUpgradeCompatibilityTest, RequestResponse_Simple) {\n  compatibilityTest_->TestRequestResponse_Simple();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, RequestResponse_Sync) {\n  compatibilityTest_->TestRequestResponse_Sync();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, RequestResponse_Destruction) {\n  compatibilityTest_->TestRequestResponse_Destruction();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, RequestResponse_MultipleClients) {\n  compatibilityTest_->TestRequestResponse_MultipleClients();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, RequestResponse_ExpectedException) {\n  compatibilityTest_->TestRequestResponse_ExpectedException();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, RequestResponse_UnexpectedException) {\n  compatibilityTest_->TestRequestResponse_UnexpectedException();\n}\n\n\/\/ Warning: This test may be flaky due to use of timeouts.\nTEST_P(TransportUpgradeCompatibilityTest, RequestResponse_Timeout) {\n  compatibilityTest_->TestRequestResponse_Timeout();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, DefaultTimeoutValueTest) {\n  compatibilityTest_->connectToServer([](auto client) {\n    \/\/ Opts with no timeout value\n    RpcOptions opts;\n\n    \/\/ Ok to sleep for 100msec\n    auto cb = std::make_unique<MockCallback>(false, false);\n    client->sleep(opts, std::move(cb), 100);\n\n    \/* Sleep to give time for all callbacks to be completed *\/\n    \/* sleep override *\/\n    std::this_thread::sleep_for(std::chrono::milliseconds(200));\n\n    auto* channel = dynamic_cast<ClientChannel*>(client->getChannel());\n    EXPECT_TRUE(channel);\n    channel->getEventBase()->runInEventBaseThreadAndWait([&]() {\n      channel->setTimeout(1); \/\/ 1ms\n    });\n\n    \/\/ Now it should timeout\n    cb = std::make_unique<MockCallback>(false, true);\n    client->sleep(opts, std::move(cb), 100);\n\n    \/* Sleep to give time for all callbacks to be completed *\/\n    \/* sleep override *\/\n    std::this_thread::sleep_for(std::chrono::milliseconds(200));\n  });\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, RequestResponse_Header) {\n  compatibilityTest_->TestRequestResponse_Header();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, RequestResponse_Header_Load) {\n  compatibilityTest_->TestRequestResponse_Header_Load();\n}\n\nTEST_P(\n    TransportUpgradeCompatibilityTest,\n    RequestResponse_Header_ExpectedException) {\n  compatibilityTest_->TestRequestResponse_Header_ExpectedException();\n}\n\nTEST_P(\n    TransportUpgradeCompatibilityTest,\n    RequestResponse_Header_UnexpectedException) {\n  compatibilityTest_->TestRequestResponse_Header_UnexpectedException();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, RequestResponse_IsOverloaded) {\n  compatibilityTest_->TestRequestResponse_IsOverloaded();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, RequestResponse_Connection_CloseNow) {\n  compatibilityTest_->connectToServer([](auto client) {\n    \/\/ It should not reach to server: no EXPECT_CALL for add_(3)\n\n    \/\/ Observe the behavior if the connection is closed already\n    auto channel = static_cast<ClientChannel*>(client->getChannel());\n    channel->getEventBase()->runInEventBaseThreadAndWait(\n        [&]() { channel->closeNow(); });\n\n    try {\n      client->future_add(3).get();\n      EXPECT_TRUE(false) << \"future_add should have thrown\";\n    } catch (TTransportException& ex) {\n      EXPECT_EQ(TTransportException::UNKNOWN, ex.getType());\n      EXPECT_PRED_FORMAT2(IsSubstring, \"Channel is !good()\", ex.what());\n    }\n  });\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, RequestResponse_ServerQueueTimeout) {\n  compatibilityTest_->TestRequestResponse_ServerQueueTimeout();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, RequestResponse_ResponseSizeTooBig) {\n  compatibilityTest_->TestRequestResponse_ResponseSizeTooBig();\n}\n\n\/\/ TODO(T90625074)\nTEST_P(\n    TransportUpgradeCompatibilityTest, DISABLED_RequestResponse_Checksumming) {\n  \/\/ Checksum not implemented for header transport\n  if (!GetParam()) {\n    return;\n  }\n  compatibilityTest_->TestRequestResponse_Checksumming();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, Oneway_Simple) {\n  compatibilityTest_->TestOneway_Simple();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, Oneway_WithDelay) {\n  compatibilityTest_->TestOneway_WithDelay();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, Oneway_UnexpectedException) {\n  compatibilityTest_->TestOneway_UnexpectedException();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, Oneway_Connection_CloseNow) {\n  compatibilityTest_->TestOneway_Connection_CloseNow();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, Oneway_ServerQueueTimeout) {\n  compatibilityTest_->TestOneway_ServerQueueTimeout();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, Oneway_Checksumming) {\n  \/\/ Checksum not implemented for header transport\n  if (!GetParam()) {\n    return;\n  }\n  compatibilityTest_->TestOneway_Checksumming();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, RequestContextIsPreserved) {\n  compatibilityTest_->TestRequestContextIsPreserved();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, BadPayload) {\n  compatibilityTest_->TestBadPayload();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, EvbSwitch) {\n  compatibilityTest_->TestEvbSwitch();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, EvbSwitch_Failure) {\n  compatibilityTest_->TestEvbSwitch_Failure();\n}\n\nclass CloseCallbackTest : public CloseCallback {\n public:\n  void channelClosed() override {\n    EXPECT_FALSE(closed_);\n    closed_ = true;\n  }\n  bool isClosed() { return closed_; }\n\n private:\n  bool closed_{false};\n};\n\nTEST_P(TransportUpgradeCompatibilityTest, CloseCallback) {\n  compatibilityTest_->connectToServer(\n      [this](std::unique_ptr<TestServiceAsyncClient> client) {\n        EXPECT_CALL(*compatibilityTest_->handler_.get(), sumTwoNumbers_(1, 2))\n            .Times(1);\n\n        auto closeCb = std::make_unique<CloseCallbackTest>();\n        auto channel = static_cast<ClientChannel*>(client->getChannel());\n        auto evb = channel->getEventBase();\n        evb->runInEventBaseThreadAndWait(\n            [&]() { channel->setCloseCallback(closeCb.get()); });\n        \/\/ send a request so that transport upgrade kicks in (if enabled)\n        EXPECT_EQ(3, client->future_sumTwoNumbers(1, 2).get());\n\n        EXPECT_FALSE(closeCb->isClosed());\n        evb->runInEventBaseThreadAndWait([&]() { channel->closeNow(); });\n        EXPECT_TRUE(closeCb->isClosed());\n      });\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, ConnectionStats) {\n  compatibilityTest_->TestConnectionStats();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, ObserverSendReceiveRequests) {\n  compatibilityTest_->TestObserverSendReceiveRequests();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, ConnectionContext) {\n  compatibilityTest_->TestConnectionContext();\n}\n\nTEST_P(TransportUpgradeCompatibilityTest, ClientIdentityHook) {\n  compatibilityTest_->TestClientIdentityHook();\n}\n\n} \/\/ namespace thrift\n} \/\/ namespace apache\n<|endoftext|>"}
{"text":"<commit_before>#include \"GpuNode.h\"\n#include \"NodeFactory.h\"\n\nstatic const int NMIXTURES = 5;\n\nclass GpuMixtureOfGaussiansNodeType : public GpuNodeType\n{\npublic:\n\tGpuMixtureOfGaussiansNodeType()\n\t\t: _nframe(0)\n\t\t, _history(200)\n\t\t, _varianceThreshold(6.25f)\n\t\t, _backgroundRatio(0.7f)\n\t\t, _initialWeight(0.05f)\n\t\t, _initialVariance(500) \/\/ (15*15*4)\n\t\t, _minVariance(0.4f) \/\/ (15*15)\n\t{\n\t}\n\n\tbool restart() override\n\t{\n\t\t_nframe = 0;\n\n\t\t\/\/ TUTAJ inicjalizuj bufory???\n\n\t\tif(!_mixtureDataBuffer.isNull())\n\t\t{\n\t\t\t\/\/ Wyzerowanie\n\t\t\tvoid* ptr = _gpuComputeModule->queue().mapBuffer(_mixtureDataBuffer, clw::MapAccess_Write);\n\t\t\tmemset(ptr, 0, _mixtureDataBuffer.size());\n\t\t\t_gpuComputeModule->queue().unmap(_mixtureDataBuffer, ptr);\n\t\t}\n\n\t\t\/*\n\t\t\tCreate mixture parameter buffer\n\t\t*\/\n\t\tif(_mixtureParamsBuffer.isNull())\n\t\t{\n\t\t\t\/\/ Parametry stale dla kernela\n\t\t\tstruct MogParams\n\t\t\t{\n\t\t\t\tfloat varThreshold;\n\t\t\t\tfloat backgroundRatio;\n\t\t\t\tfloat w0; \/\/ waga dla nowej mikstury\n\t\t\t\tfloat var0; \/\/ wariancja dla nowej mikstury\n\t\t\t\tfloat minVar; \/\/ dolny prog mozliwej wariancji\n\t\t\t};\n\n\t\t\tMogParams mogParams = {\n\t\t\t\t_varianceThreshold,\n\t\t\t\t_backgroundRatio,\n\t\t\t\t_initialWeight,\n\t\t\t\t_initialVariance,\n\t\t\t\t_minVariance\n\t\t\t};\n\n\t\t\t_mixtureParamsBuffer = _gpuComputeModule->context().createBuffer(\n\t\t\t\tclw::Access_ReadOnly, clw::Location_Device, \n\t\t\t\tsizeof(MogParams), &mogParams);\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tExecutionStatus execute(NodeSocketReader& reader, NodeSocketWriter& writer) override\n\t{\n\t\tconst clw::Image2D& deviceImage = reader.readSocket(0).getDeviceImage();\n\t\tclw::Image2D& deviceDest = writer.acquireSocket(0).getDeviceImage();\n\n\t\tint srcWidth = deviceImage.width();\n\t\tint srcHeight = deviceImage.height();\n\n\t\tif(srcWidth == 0 || srcHeight == 0)\n\t\t\treturn ExecutionStatus(EStatus::Ok);\n\n\t\tclw::Kernel kernelGaussMix = _gpuComputeModule->acquireKernel(\"mog.cl\", \"mog_image_unorm\");\n\t\tif(kernelGaussMix.isNull())\n\t\t\treturn ExecutionStatus(EStatus::Error);\n\n\t\t\/*\n\t\t\tCreate mixture data buffer\n\t\t*\/\n\t\tresetMixturesState(srcWidth * srcHeight);\n\n\t\tif(deviceDest.isNull()\n\t\t\t|| deviceDest.width() != srcWidth\n\t\t\t|| deviceDest.height() != srcHeight)\n\t\t{\n\t\t\t\/\/ Obraz (w zasadzie maska) pierwszego planu\n\t\t\tdeviceDest = _gpuComputeModule->context().createImage2D(\n\t\t\t\tclw::Access_WriteOnly, clw::Location_Device,\n\t\t\t\tclw::ImageFormat(clw::Order_R, clw::Type_Normalized_UInt8),\n\t\t\t\tsrcWidth, srcHeight);\n\t\t}\n\n\t\tfloat learningRate = -1.0;\n\n\t\t\/\/ Calculate dynamic learning rate (if necessary)\n\t\t++_nframe;\n\t\tfloat alpha = learningRate >= 0 && _nframe > 1 \n\t\t\t? learningRate\n\t\t\t: 1.0f\/std::min(_nframe, _history);\n\n\t\tkernelGaussMix.setLocalWorkSize(16, 16);\n\t\tkernelGaussMix.setRoundedGlobalWorkSize(srcWidth, srcHeight);\n\t\tkernelGaussMix.setArg(0, deviceImage);\n\t\tkernelGaussMix.setArg(1, deviceDest);\n\t\tkernelGaussMix.setArg(2, _mixtureDataBuffer);\n\t\tkernelGaussMix.setArg(3, _mixtureParamsBuffer);\n\t\tkernelGaussMix.setArg(4, alpha);\n\t\tclw::Event evt = _gpuComputeModule->queue().asyncRunKernel(kernelGaussMix);\n\t\t_gpuComputeModule->queue().finish();\n\n\t\tdouble elapsed = (evt.finishTime() - evt.startTime()) * 1e-6;\n\t\treturn ExecutionStatus(EStatus::Ok, elapsed);\n\t}\n\n\tvoid configuration(NodeConfig& nodeConfig) const override\n\t{\n\t\tstatic const InputSocketConfig in_config[] = {\n\t\t\t{ ENodeFlowDataType::DeviceImage, \"input\", \"Image\", \"\" },\n\t\t\t{ ENodeFlowDataType::Invalid, \"\", \"\", \"\" }\n\t\t};\n\t\tstatic const OutputSocketConfig out_config[] = {\n\t\t\t{ ENodeFlowDataType::DeviceImage, \"output\", \"Output\", \"\" },\n\t\t\t\/\/{ ENodeFlowDataType::DeviceImage, \"background\", \"Background\", \"\" },\n\t\t\t{ ENodeFlowDataType::Invalid, \"\", \"\", \"\" }\n\t\t};\n\n\t\tnodeConfig.description = \"\";\n\t\tnodeConfig.pInputSockets = in_config;\n\t\tnodeConfig.pOutputSockets = out_config;\n\t\tnodeConfig.flags = Node_HasState | Node_OverridesTimeComputation;\n\t\tnodeConfig.module = \"opencl\";\n\t}\n\nprivate:\n\tvoid resetMixturesState(int pixNumbers)\n\t{\n\t\t\/\/ Dane mikstur (stan wewnetrzny estymatora tla)\n\t\tconst int mixtureDataSize = NMIXTURES * pixNumbers * 3 * sizeof(float);\n\n\t\tif(_mixtureDataBuffer.isNull()\n\t\t\t|| _mixtureDataBuffer.size() != mixtureDataSize)\n\t\t{\n\t\t\t_mixtureDataBuffer = _gpuComputeModule->context().createBuffer(\n\t\t\t\tclw::Access_ReadWrite, clw::Location_Device, mixtureDataSize);\n\n\t\t\t\/\/ Wyzerowanie\n\t\t\tvoid* ptr = _gpuComputeModule->queue().mapBuffer(_mixtureDataBuffer, clw::MapAccess_Write);\n\t\t\tmemset(ptr, 0, mixtureDataSize);\n\t\t\t_gpuComputeModule->queue().unmap(_mixtureDataBuffer, ptr);\n\t\t}\n\t}\n\nprivate:\n\tclw::Buffer _mixtureDataBuffer;\n\tclw::Buffer _mixtureParamsBuffer;\n\n\tint _nframe;\n\tint _history;\n\tfloat _varianceThreshold;\n\tfloat _backgroundRatio;\n\tfloat _initialWeight;\n\tfloat _initialVariance;\n\tfloat _minVariance;\n};\n\nREGISTER_NODE(\"OpenCL\/Video\/Mixture of Gaussians\", GpuMixtureOfGaussiansNodeType)<commit_msg>added calculating background image from mixtures<commit_after>#include \"GpuNode.h\"\n#include \"NodeFactory.h\"\n\nstatic const int NMIXTURES = 5;\n\n\/\/\/ TODO: Add parameters:\n\/\/\/ - NMixtures\n\/\/\/ - Learning param\n\/\/\/ - Background ratio\n\/\/\/ - Calc background\n\nclass GpuMixtureOfGaussiansNodeType : public GpuNodeType\n{\npublic:\n\tGpuMixtureOfGaussiansNodeType()\n\t\t: _nframe(0)\n\t\t, _history(200)\n\t\t, _varianceThreshold(6.25f)\n\t\t, _backgroundRatio(0.7f)\n\t\t, _initialWeight(0.05f)\n\t\t, _initialVariance(500) \/\/ (15*15*4)\n\t\t, _minVariance(0.4f) \/\/ (15*15)\n\t{\n\t}\n\n\tbool restart() override\n\t{\n\t\t_nframe = 0;\n\n\t\t\/\/ TUTAJ inicjalizuj bufory???\n\n\t\tif(!_mixtureDataBuffer.isNull())\n\t\t{\n\t\t\t\/\/ Wyzerowanie\n\t\t\tvoid* ptr = _gpuComputeModule->queue().mapBuffer(_mixtureDataBuffer, clw::MapAccess_Write);\n\t\t\tmemset(ptr, 0, _mixtureDataBuffer.size());\n\t\t\t_gpuComputeModule->queue().unmap(_mixtureDataBuffer, ptr);\n\t\t}\n\n\t\t\/*\n\t\t\tCreate mixture parameter buffer\n\t\t*\/\n\t\tif(_mixtureParamsBuffer.isNull())\n\t\t{\n\t\t\t\/\/ Parametry stale dla kernela\n\t\t\tstruct MogParams\n\t\t\t{\n\t\t\t\tfloat varThreshold;\n\t\t\t\tfloat backgroundRatio;\n\t\t\t\tfloat w0; \/\/ waga dla nowej mikstury\n\t\t\t\tfloat var0; \/\/ wariancja dla nowej mikstury\n\t\t\t\tfloat minVar; \/\/ dolny prog mozliwej wariancji\n\t\t\t};\n\n\t\t\tMogParams mogParams = {\n\t\t\t\t_varianceThreshold,\n\t\t\t\t_backgroundRatio,\n\t\t\t\t_initialWeight,\n\t\t\t\t_initialVariance,\n\t\t\t\t_minVariance\n\t\t\t};\n\n\t\t\t_mixtureParamsBuffer = _gpuComputeModule->context().createBuffer(\n\t\t\t\tclw::Access_ReadOnly, clw::Location_Device, \n\t\t\t\tsizeof(MogParams), &mogParams);\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tExecutionStatus execute(NodeSocketReader& reader, NodeSocketWriter& writer) override\n\t{\n\t\tconst clw::Image2D& deviceImage = reader.readSocket(0).getDeviceImage();\n\t\tclw::Image2D& deviceDest = writer.acquireSocket(0).getDeviceImage();\n\n\t\tint srcWidth = deviceImage.width();\n\t\tint srcHeight = deviceImage.height();\n\n\t\tif(srcWidth == 0 || srcHeight == 0)\n\t\t\treturn ExecutionStatus(EStatus::Ok);\n\n\t\tclw::Kernel kernelGaussMix = _gpuComputeModule->acquireKernel(\"mog.cl\", \"mog_image_unorm\");\n\t\tif(kernelGaussMix.isNull())\n\t\t\treturn ExecutionStatus(EStatus::Error);\n\n\t\t\/*\n\t\t\tCreate mixture data buffer\n\t\t*\/\n\t\tresetMixturesState(srcWidth * srcHeight);\n\n\t\tif(deviceDest.isNull()\n\t\t\t|| deviceDest.width() != srcWidth\n\t\t\t|| deviceDest.height() != srcHeight)\n\t\t{\n\t\t\t\/\/ Obraz (w zasadzie maska) pierwszego planu\n\t\t\tdeviceDest = _gpuComputeModule->context().createImage2D(\n\t\t\t\tclw::Access_WriteOnly, clw::Location_Device,\n\t\t\t\tclw::ImageFormat(clw::Order_R, clw::Type_Normalized_UInt8),\n\t\t\t\tsrcWidth, srcHeight);\n\t\t}\n\n\t\tfloat learningRate = -1.0;\n\n\t\t\/\/ Calculate dynamic learning rate (if necessary)\n\t\t++_nframe;\n\t\tfloat alpha = learningRate >= 0 && _nframe > 1 \n\t\t\t? learningRate\n\t\t\t: 1.0f\/std::min(_nframe, _history);\n\n\t\tkernelGaussMix.setLocalWorkSize(16, 16);\n\t\tkernelGaussMix.setRoundedGlobalWorkSize(srcWidth, srcHeight);\n\t\tkernelGaussMix.setArg(0, deviceImage);\n\t\tkernelGaussMix.setArg(1, deviceDest);\n\t\tkernelGaussMix.setArg(2, _mixtureDataBuffer);\n\t\tkernelGaussMix.setArg(3, _mixtureParamsBuffer);\n\t\tkernelGaussMix.setArg(4, alpha);\n\t\tclw::Event evt = _gpuComputeModule->queue().asyncRunKernel(kernelGaussMix);\n\t\t_gpuComputeModule->queue().finish();\n\n\t\tif(1)\n\t\t{\n\t\t\tclw::Image2D& deviceDestBackground = writer.acquireSocket(1).getDeviceImage();\n\t\t\tif(deviceDestBackground.isNull()\n\t\t\t\t|| deviceDestBackground.width() != srcWidth\n\t\t\t\t|| deviceDestBackground.height() != srcHeight)\n\t\t\t{\n\t\t\t\t\/\/ Obraz (w zasadzie maska) pierwszego planu\n\t\t\t\tdeviceDestBackground = _gpuComputeModule->context().createImage2D(\n\t\t\t\t\tclw::Access_WriteOnly, clw::Location_Device,\n\t\t\t\t\tclw::ImageFormat(clw::Order_R, clw::Type_Normalized_UInt8),\n\t\t\t\t\tsrcWidth, srcHeight);\n\t\t\t}\n\n\t\t\tclw::Kernel kernelBackground = _gpuComputeModule->acquireKernel(\"mog.cl\", \"mog_background_image_unorm\");\n\t\t\tif(kernelBackground.isNull())\n\t\t\t\treturn ExecutionStatus(EStatus::Error);\n\n\t\t\tkernelBackground.setLocalWorkSize(16, 16);\n\t\t\tkernelBackground.setRoundedGlobalWorkSize(srcWidth, srcHeight);\n\t\t\tkernelBackground.setArg(0, deviceDestBackground);\n\t\t\tkernelBackground.setArg(1, _mixtureDataBuffer);\n\t\t\tkernelBackground.setArg(2, _mixtureParamsBuffer);\n\t\t\t\/\/evt = _gpuComputeModule->queue().asyncRunKernel(kernelBackground);\n\t\t\t\/\/_gpuComputeModule->queue().finish();\n\n\t\t\tbool res = _gpuComputeModule->queue().runKernel(kernelBackground);\n\t\t}\n\n\t\tdouble elapsed = (evt.finishTime() - evt.startTime()) * 1e-6;\n\t\treturn ExecutionStatus(EStatus::Ok, elapsed);\n\t}\n\n\tvoid configuration(NodeConfig& nodeConfig) const override\n\t{\n\t\tstatic const InputSocketConfig in_config[] = {\n\t\t\t{ ENodeFlowDataType::DeviceImage, \"input\", \"Image\", \"\" },\n\t\t\t{ ENodeFlowDataType::Invalid, \"\", \"\", \"\" }\n\t\t};\n\t\tstatic const OutputSocketConfig out_config[] = {\n\t\t\t{ ENodeFlowDataType::DeviceImage, \"output\", \"Output\", \"\" },\n\t\t\t{ ENodeFlowDataType::DeviceImage, \"background\", \"Background\", \"\" },\n\t\t\t{ ENodeFlowDataType::Invalid, \"\", \"\", \"\" }\n\t\t};\n\n\t\tnodeConfig.description = \"\";\n\t\tnodeConfig.pInputSockets = in_config;\n\t\tnodeConfig.pOutputSockets = out_config;\n\t\tnodeConfig.flags = Node_HasState | Node_OverridesTimeComputation;\n\t\tnodeConfig.module = \"opencl\";\n\t}\n\nprivate:\n\tvoid resetMixturesState(int pixNumbers)\n\t{\n\t\t\/\/ Dane mikstur (stan wewnetrzny estymatora tla)\n\t\tconst int mixtureDataSize = NMIXTURES * pixNumbers * 3 * sizeof(float);\n\n\t\tif(_mixtureDataBuffer.isNull()\n\t\t\t|| _mixtureDataBuffer.size() != mixtureDataSize)\n\t\t{\n\t\t\t_mixtureDataBuffer = _gpuComputeModule->context().createBuffer(\n\t\t\t\tclw::Access_ReadWrite, clw::Location_Device, mixtureDataSize);\n\n\t\t\t\/\/ Wyzerowanie\n\t\t\tvoid* ptr = _gpuComputeModule->queue().mapBuffer(_mixtureDataBuffer, clw::MapAccess_Write);\n\t\t\tmemset(ptr, 0, mixtureDataSize);\n\t\t\t_gpuComputeModule->queue().unmap(_mixtureDataBuffer, ptr);\n\t\t}\n\t}\n\nprivate:\n\tclw::Buffer _mixtureDataBuffer;\n\tclw::Buffer _mixtureParamsBuffer;\n\n\tint _nframe;\n\tint _history;\n\tfloat _varianceThreshold;\n\tfloat _backgroundRatio;\n\tfloat _initialWeight;\n\tfloat _initialVariance;\n\tfloat _minVariance;\n};\n\nREGISTER_NODE(\"OpenCL\/Video\/Mixture of Gaussians\", GpuMixtureOfGaussiansNodeType)<|endoftext|>"}
{"text":"<commit_before>#include \"cinder\/app\/AppNative.h\"\n#include \"cinder\/gl\/gl.h\"\n#include \"FCEffectRunner.h\"\n#include \"cinder\/Perlin.h\"\n#include \"cinder\/Rand.h\"\n#include \"cinder\/MayaCamUI.h\"\n#include \"cinder\/gl\/Texture.h\"\n\/\/ -------- SPOUT -------------\n#include \"spout.h\"\nusing namespace Spout;\n\/\/ ----------------------------\n\nusing namespace ci;\nusing namespace ci::app;\nusing namespace std;\n\nclass MyEffect;\ntypedef boost::shared_ptr< MyEffect > MyEffectRef;\n\nclass MyEffect : public FCEffect\n{\npublic:\n\tstatic MyEffectRef create(Surface pSurf)\n    {\n        return ( MyEffectRef )( new MyEffect(pSurf) );\n    }\n    MyEffect(Surface pSurf)\n       {\n\t\tmSurf = pSurf;\n\t}\n\tfloat time;\n\tSurface mSurf;\n\n    void beginFrame(const FrameInfo& f)\n    {\n        const float speed = 1.0;\n        time += f.timeDelta * speed;\n    }\n\n    void shader(ci::Vec3f& rgb, const PixelInfo& p)\n    {\n\t\tif(mSurf){\n\t\t\tVec2f pt = Vec2f((p.point.x),(p.point.y));\n\t\t\t\/\/pt.x = pt.x\/4.f;\n\t\t\t\/\/pt.x += mSection;\n\t\t\tauto colorval = mSurf.getPixel(Vec2i(pt.x*mSurf.getWidth(),pt.y*mSurf.getHeight()));\n\t\t\trgb = Vec3f(colorval.r\/255.f,colorval.g\/255.f,colorval.b\/255.f);\n\t\t}\n\t\telse \n\t\t\trgb = Vec3f(0,0,0);\n        \n\t}\n};\n\nclass FadeCandyClientApp : public AppNative {\npublic:\n\tvoid setup();\n\tvoid update();\n\tvoid draw();\n\tFCEffectRunnerRef effectRunner;\n\tMayaCamUI\tmMayaCam;\n\t\/\/ keep track of the mouse\n\tVec2i\t\tmMousePos;\n    \n    void prepareSettings( Settings *settings );\n\tvoid mouseMove( MouseEvent event );\n\tvoid mouseDown( MouseEvent event );\n\tvoid mouseDrag( MouseEvent event );\n\tvoid resize();\n\tbool bInitialized; \/\/ true if a sender initializes OK\n\tbool bDoneOnce; \/\/ only try to initialize once\n\tbool bTextureShare; \/\/ tells us if texture share compatible\n\tchar SenderName[256]; \/\/ sender name \n\tgl::Texture spoutTexture;  \/\/ Local Cinder texture used for sharing\n\tSurface spoutSurf;\n\tunsigned int g_Width, g_Height; \/\/ size of the texture being sent out\n\tMyEffectRef e;\n};\n\nvoid FadeCandyClientApp::setup()\n{\n\tbInitialized = false;\n\tg_Width = 124; \/\/ set global width and height to something\n\tg_Height = 8; \/\/ they need to be reset when the receiver connects to a sender\n\t\/\/point FC to host and port\n\teffectRunner = FCEffectRunner::create(\"127.0.0.1\",7890);\n\t\/\/create instance of our custom effect\n\te = MyEffect::create(spoutSurf);\n\teffectRunner->setEffect(boost::dynamic_pointer_cast<FCEffect>( e ));\n\teffectRunner->setMaxFrameRate(400);\n\teffectRunner->setVerbose(true);\n    effectRunner->setLayout(\"layouts\/grid16x8.json\",0);\n\t\/\/add visualizer to see effect on screen\n\tFCEffectVisualizerRef viz = FCEffectVisualizer::create();\n\teffectRunner->setVisualizer(viz);\n\t\n\t\/\/ set up the camera\n\tCameraPersp cam;\n\tcam.setEyePoint( Vec3f(300.0f, 250.f, -500.0f) );\n\tcam.setCenterOfInterestPoint( Vec3f(300.0f, 200.0f, 0.0f) );\n\tcam.setPerspective( 60.0f, getWindowAspectRatio(), 1.0f, 1000.0f );\n\tmMayaCam.setCurrentCam( cam );\n\tgl::disableVerticalSync();\n}\nvoid FadeCandyClientApp::prepareSettings( Settings *settings )\n{\n    \/\/settings->setFrameRate( 400.0f );\n\tsettings->disableFrameRate();\n}\nvoid FadeCandyClientApp::update()\n{\n\tunsigned int width, height;\n\tchar tempname[256];\n\n\t\/\/ -------- SPOUT -------------\n\tif(!bInitialized) {\n\n\t\t\/\/ This is a receiver, so the initialization is a little more complex than a sender\n\n\t\t\/\/ You can pass a sender name to try to find and connect to \n\t\tSenderName[0] = NULL; \/\/ the name will be filled when the receiver connects to a sender\n\t\tstrcpy_s(tempname, 256, \"Sender name\"); \n\t\twidth  = g_Width; \/\/ pass the initial width and height (they will be adjusted if necessary)\n\t\theight = g_Height;\n\t\tbInitialized = InitReceiver(tempname, width, height, bTextureShare);\n\t\t\/\/ Initialization will fail if there are no senders, so just keep trying unti a sender starts\n\n\t\tif(bInitialized) {\n\t\t\t\/\/ Check to see whether it has initialized texture share or memoryshare\n\t\t\tif(bTextureShare) { \n\t\t\t\t\/\/ Texture share is OK so we can look at sender names\n\t\t\t\t\/\/ Check if the name returned is different.\n\t\t\t\tif(strcmp(SenderName, tempname) != 0) {\n\t\t\t\t\t\/\/ If the sender name is different, the requested \n\t\t\t\t\t\/\/ sender was not found so the active sender was used.\n\t\t\t\t\t\/\/ Act on this if necessary.\n\t\t\t\t\tstrcpy_s(SenderName, 256, tempname);\n\t\t\t\t}\n\t\t\t}\n\t\t\t\/\/ else the receiver has initialized in memoryshare mode\n\n\t\t\t\/\/ Is the size of the detected sender different from the current texture size ?\n\t\t\t\/\/ This is detected for both texture share and memoryshare\n\t\t\tif(width != g_Width || height != g_Height) {\n\n\t\t\t\tg_Width = width;\n\t\t\t\tg_Height = height;\n\t\t\t\t\/\/ Reset the local receiving texture size\n\t\t\t\tspoutTexture =  gl::Texture(g_Width, g_Height);\n\t\t\t\t\n\t\t\t\t\/\/ reset render window\n\t\t\t\t\/\/setWindowSize(g_Width, g_Height);\n\t\t\t} \n\n\n\t\t}\n\t\telse {\n\t\t\t\/\/ Receiver initialization will fail if no senders are running\n\t\t\t\/\/ Keep trying until one starts\n\t\t}\n\t} \/\/ endif not initialized\n\n\teffectRunner->update();\n}\n\nvoid FadeCandyClientApp::draw()\n{\n\tunsigned int width, height;\n\tchar txt[256];\n\n\t\/\/ clear out the window with black\n\tgl::clear( Color( 0, 0, 0 ) );\n\tgl::setViewport( getWindowBounds() );\n\tgl::color( Color(1,1,1) );\n\tgl::setMatrices( mMayaCam.getCamera() );\n\teffectRunner->draw();\n\n\t\/\/draw debug info\n\tgl::setMatricesWindow( getWindowSize() );\n\t\n\tFont mDefault;\n\t#if defined( CINDER_COCOA )        \n\t\t\t\tmDefault = Font( \"Helvetica\", 16 );\n\t#elif defined( CINDER_MSW )    \n\t\t\t\tmDefault = Font( \"Arial\", 16 );\n\t#endif\n\tgl::enableAlphaBlending();\n\tgl::drawStringCentered(effectRunner->getDebugString(),Vec2f(getWindowCenter().x,5),Color(1,1,1),mDefault);\n\tgl::disableAlphaBlending();\n\n\t\/\/ Save current global width and height - they will be changed\n\t\/\/ by receivetexture if the sender changes dimensions\n\twidth  = g_Width;\n\theight = g_Height;\n\t\/\/\n\t\/\/ Try to receive the texture at the current size \n\t\/\/\n\t\/\/ NOTE :\n\t\/\/ if the host calls SendTexture with a framebuffer object actively bound\n\t\/\/ the host must provide the GL handle to its EXT_framebuffer_object\n\t\/\/ so that the dll can restore that binding because it makes use of its\n\t\/\/ own FBO for intermediate rendering - default is 0 for no bound host FBO - see Spout.h\n\t\/\/\n\tif(bInitialized && spoutTexture) {\n\n\t\tif(!ReceiveTexture(SenderName, spoutTexture.getId(), spoutTexture.getTarget(), width, height)) {\n\t\t\t\/\/\n\t\t\t\/\/ Receiver failure :\n\t\t\t\/\/\t1)\twidth and height are zero for read failure.\n\t\t\t\/\/\t2)\twidth and height are changed for sender change\n\t\t\t\/\/\t\tThe local texture then has to be resized.\n\t\t\t\/\/\n\t\t\tif(width == 0 || height == 0) {\n\t\t\t\t\/\/ width and height are returned zero if there has been \n\t\t\t\t\/\/ a texture read failure which might happen if the sender\n\t\t\t\t\/\/ is closed. Spout will keep trying and if the same sender opens again\n\t\t\t\t\/\/ will use it. Otherwise the user can select another sender.\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif(width != g_Width || height != g_Height ) {\n\t\t\t\t\/\/ The sender dimensions have changed\n\t\t\t\t\/\/ Update the global width and height\n\t\t\t\tg_Width  = width;\n\t\t\t\tg_Height = height;\n\t\t\t\t\/\/ Update the local texture to receive the new dimensions\n\t\t\t\tspoutTexture =  gl::Texture(g_Width, g_Height);\n\t\t\t\t\n\t\t\t\treturn; \/\/ quit for next round\n\t\t\t}\n\t\t}\n\t\telse {\n\n\t\t\tspoutSurf = Surface(spoutTexture);\n\t\t\te->mSurf = spoutSurf;\n\t\t\t\n\t\t}\n\t}\n}\n\/\/camera interaction\nvoid FadeCandyClientApp::mouseMove( MouseEvent event )\n{\n\t\/\/ keep track of the mouse\n\tmMousePos = event.getPos();\n}\n\nvoid FadeCandyClientApp::mouseDown( MouseEvent event )\n{\t\n\t\/\/ let the camera handle the interaction\n\tmMayaCam.mouseDown( event.getPos() );\n}\n\nvoid FadeCandyClientApp::mouseDrag( MouseEvent event )\n{\n\t\/\/ keep track of the mouse\n\tmMousePos = event.getPos();\n\n\t\/\/ let the camera handle the interaction\n\tmMayaCam.mouseDrag( event.getPos(), event.isLeftDown(), event.isMiddleDown(), event.isRightDown() );\n}\n\nvoid FadeCandyClientApp::resize()\n{\n\t\/\/ adjust aspect ratio\n\tCameraPersp cam = mMayaCam.getCamera();\n\tcam.setAspectRatio( getWindowAspectRatio() );\n\tmMayaCam.setCurrentCam( cam );\n}\n\nCINDER_APP_NATIVE( FadeCandyClientApp, RendererGl )\n<commit_msg>license<commit_after>\/*\n*\n* Copyright (c) 2014, James Hurlbut\n* All rights reserved.\n*\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*\n* Redistributions of source code must retain the above copyright\n* notice, this list of conditions and the following disclaimer.\n* Redistributions in binary form must reproduce the above copyright\n* notice, this list of conditions and the following disclaimer in\n* the documentation and\/or other materials provided with the\n* distribution.\n*\n* Neither the name of James Hurlbut nor the names of its\n* contributors may be used to endorse or promote products\n* derived from this software without specific prior written\n* permission.\n*\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n* \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\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,\n* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF\n* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*\n*\/\n\n#include \"cinder\/app\/AppNative.h\"\n#include \"cinder\/gl\/gl.h\"\n#include \"FCEffectRunner.h\"\n#include \"cinder\/Perlin.h\"\n#include \"cinder\/Rand.h\"\n#include \"cinder\/MayaCamUI.h\"\n#include \"cinder\/gl\/Texture.h\"\n\/\/ -------- SPOUT -------------\n#include \"spout.h\"\nusing namespace Spout;\n\/\/ ----------------------------\n\nusing namespace ci;\nusing namespace ci::app;\nusing namespace std;\n\nclass MyEffect;\ntypedef boost::shared_ptr< MyEffect > MyEffectRef;\n\nclass MyEffect : public FCEffect\n{\npublic:\n\tstatic MyEffectRef create(Surface pSurf)\n    {\n        return ( MyEffectRef )( new MyEffect(pSurf) );\n    }\n    MyEffect(Surface pSurf)\n       {\n\t\tmSurf = pSurf;\n\t}\n\tfloat time;\n\tSurface mSurf;\n\n    void beginFrame(const FrameInfo& f)\n    {\n        const float speed = 1.0;\n        time += f.timeDelta * speed;\n    }\n\n    void shader(ci::Vec3f& rgb, const PixelInfo& p)\n    {\n\t\tif(mSurf){\n\t\t\tVec2f pt = Vec2f((p.point.x),(p.point.y));\n\t\t\t\/\/pt.x = pt.x\/4.f;\n\t\t\t\/\/pt.x += mSection;\n\t\t\tauto colorval = mSurf.getPixel(Vec2i(pt.x*mSurf.getWidth(),pt.y*mSurf.getHeight()));\n\t\t\trgb = Vec3f(colorval.r\/255.f,colorval.g\/255.f,colorval.b\/255.f);\n\t\t}\n\t\telse \n\t\t\trgb = Vec3f(0,0,0);\n        \n\t}\n};\n\nclass FadeCandyClientApp : public AppNative {\npublic:\n\tvoid setup();\n\tvoid update();\n\tvoid draw();\n\tFCEffectRunnerRef effectRunner;\n\tMayaCamUI\tmMayaCam;\n\t\/\/ keep track of the mouse\n\tVec2i\t\tmMousePos;\n    \n    void prepareSettings( Settings *settings );\n\tvoid mouseMove( MouseEvent event );\n\tvoid mouseDown( MouseEvent event );\n\tvoid mouseDrag( MouseEvent event );\n\tvoid resize();\n\tbool bInitialized; \/\/ true if a sender initializes OK\n\tbool bDoneOnce; \/\/ only try to initialize once\n\tbool bTextureShare; \/\/ tells us if texture share compatible\n\tchar SenderName[256]; \/\/ sender name \n\tgl::Texture spoutTexture;  \/\/ Local Cinder texture used for sharing\n\tSurface spoutSurf;\n\tunsigned int g_Width, g_Height; \/\/ size of the texture being sent out\n\tMyEffectRef e;\n};\n\nvoid FadeCandyClientApp::setup()\n{\n\tbInitialized = false;\n\tg_Width = 124; \/\/ set global width and height to something\n\tg_Height = 8; \/\/ they need to be reset when the receiver connects to a sender\n\t\/\/point FC to host and port\n\teffectRunner = FCEffectRunner::create(\"127.0.0.1\",7890);\n\t\/\/create instance of our custom effect\n\te = MyEffect::create(spoutSurf);\n\teffectRunner->setEffect(boost::dynamic_pointer_cast<FCEffect>( e ));\n\teffectRunner->setMaxFrameRate(400);\n\teffectRunner->setVerbose(true);\n    effectRunner->setLayout(\"layouts\/grid16x8.json\",0);\n\t\/\/add visualizer to see effect on screen\n\tFCEffectVisualizerRef viz = FCEffectVisualizer::create();\n\teffectRunner->setVisualizer(viz);\n\t\n\t\/\/ set up the camera\n\tCameraPersp cam;\n\tcam.setEyePoint( Vec3f(300.0f, 250.f, -500.0f) );\n\tcam.setCenterOfInterestPoint( Vec3f(300.0f, 200.0f, 0.0f) );\n\tcam.setPerspective( 60.0f, getWindowAspectRatio(), 1.0f, 1000.0f );\n\tmMayaCam.setCurrentCam( cam );\n\tgl::disableVerticalSync();\n}\nvoid FadeCandyClientApp::prepareSettings( Settings *settings )\n{\n    \/\/settings->setFrameRate( 400.0f );\n\tsettings->disableFrameRate();\n}\nvoid FadeCandyClientApp::update()\n{\n\tunsigned int width, height;\n\tchar tempname[256];\n\n\t\/\/ -------- SPOUT -------------\n\tif(!bInitialized) {\n\n\t\t\/\/ This is a receiver, so the initialization is a little more complex than a sender\n\n\t\t\/\/ You can pass a sender name to try to find and connect to \n\t\tSenderName[0] = NULL; \/\/ the name will be filled when the receiver connects to a sender\n\t\tstrcpy_s(tempname, 256, \"Sender name\"); \n\t\twidth  = g_Width; \/\/ pass the initial width and height (they will be adjusted if necessary)\n\t\theight = g_Height;\n\t\tbInitialized = InitReceiver(tempname, width, height, bTextureShare);\n\t\t\/\/ Initialization will fail if there are no senders, so just keep trying unti a sender starts\n\n\t\tif(bInitialized) {\n\t\t\t\/\/ Check to see whether it has initialized texture share or memoryshare\n\t\t\tif(bTextureShare) { \n\t\t\t\t\/\/ Texture share is OK so we can look at sender names\n\t\t\t\t\/\/ Check if the name returned is different.\n\t\t\t\tif(strcmp(SenderName, tempname) != 0) {\n\t\t\t\t\t\/\/ If the sender name is different, the requested \n\t\t\t\t\t\/\/ sender was not found so the active sender was used.\n\t\t\t\t\t\/\/ Act on this if necessary.\n\t\t\t\t\tstrcpy_s(SenderName, 256, tempname);\n\t\t\t\t}\n\t\t\t}\n\t\t\t\/\/ else the receiver has initialized in memoryshare mode\n\n\t\t\t\/\/ Is the size of the detected sender different from the current texture size ?\n\t\t\t\/\/ This is detected for both texture share and memoryshare\n\t\t\tif(width != g_Width || height != g_Height) {\n\n\t\t\t\tg_Width = width;\n\t\t\t\tg_Height = height;\n\t\t\t\t\/\/ Reset the local receiving texture size\n\t\t\t\tspoutTexture =  gl::Texture(g_Width, g_Height);\n\t\t\t\t\n\t\t\t\t\/\/ reset render window\n\t\t\t\t\/\/setWindowSize(g_Width, g_Height);\n\t\t\t} \n\n\n\t\t}\n\t\telse {\n\t\t\t\/\/ Receiver initialization will fail if no senders are running\n\t\t\t\/\/ Keep trying until one starts\n\t\t}\n\t} \/\/ endif not initialized\n\n\teffectRunner->update();\n}\n\nvoid FadeCandyClientApp::draw()\n{\n\tunsigned int width, height;\n\tchar txt[256];\n\n\t\/\/ clear out the window with black\n\tgl::clear( Color( 0, 0, 0 ) );\n\tgl::setViewport( getWindowBounds() );\n\tgl::color( Color(1,1,1) );\n\tgl::setMatrices( mMayaCam.getCamera() );\n\teffectRunner->draw();\n\n\t\/\/draw debug info\n\tgl::setMatricesWindow( getWindowSize() );\n\t\n\tFont mDefault;\n\t#if defined( CINDER_COCOA )        \n\t\t\t\tmDefault = Font( \"Helvetica\", 16 );\n\t#elif defined( CINDER_MSW )    \n\t\t\t\tmDefault = Font( \"Arial\", 16 );\n\t#endif\n\tgl::enableAlphaBlending();\n\tgl::drawStringCentered(effectRunner->getDebugString(),Vec2f(getWindowCenter().x,5),Color(1,1,1),mDefault);\n\tgl::disableAlphaBlending();\n\n\t\/\/ Save current global width and height - they will be changed\n\t\/\/ by receivetexture if the sender changes dimensions\n\twidth  = g_Width;\n\theight = g_Height;\n\t\/\/\n\t\/\/ Try to receive the texture at the current size \n\t\/\/\n\t\/\/ NOTE :\n\t\/\/ if the host calls SendTexture with a framebuffer object actively bound\n\t\/\/ the host must provide the GL handle to its EXT_framebuffer_object\n\t\/\/ so that the dll can restore that binding because it makes use of its\n\t\/\/ own FBO for intermediate rendering - default is 0 for no bound host FBO - see Spout.h\n\t\/\/\n\tif(bInitialized && spoutTexture) {\n\n\t\tif(!ReceiveTexture(SenderName, spoutTexture.getId(), spoutTexture.getTarget(), width, height)) {\n\t\t\t\/\/\n\t\t\t\/\/ Receiver failure :\n\t\t\t\/\/\t1)\twidth and height are zero for read failure.\n\t\t\t\/\/\t2)\twidth and height are changed for sender change\n\t\t\t\/\/\t\tThe local texture then has to be resized.\n\t\t\t\/\/\n\t\t\tif(width == 0 || height == 0) {\n\t\t\t\t\/\/ width and height are returned zero if there has been \n\t\t\t\t\/\/ a texture read failure which might happen if the sender\n\t\t\t\t\/\/ is closed. Spout will keep trying and if the same sender opens again\n\t\t\t\t\/\/ will use it. Otherwise the user can select another sender.\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif(width != g_Width || height != g_Height ) {\n\t\t\t\t\/\/ The sender dimensions have changed\n\t\t\t\t\/\/ Update the global width and height\n\t\t\t\tg_Width  = width;\n\t\t\t\tg_Height = height;\n\t\t\t\t\/\/ Update the local texture to receive the new dimensions\n\t\t\t\tspoutTexture =  gl::Texture(g_Width, g_Height);\n\t\t\t\t\n\t\t\t\treturn; \/\/ quit for next round\n\t\t\t}\n\t\t}\n\t\telse {\n\n\t\t\tspoutSurf = Surface(spoutTexture);\n\t\t\te->mSurf = spoutSurf;\n\t\t\t\n\t\t}\n\t}\n}\n\/\/camera interaction\nvoid FadeCandyClientApp::mouseMove( MouseEvent event )\n{\n\t\/\/ keep track of the mouse\n\tmMousePos = event.getPos();\n}\n\nvoid FadeCandyClientApp::mouseDown( MouseEvent event )\n{\t\n\t\/\/ let the camera handle the interaction\n\tmMayaCam.mouseDown( event.getPos() );\n}\n\nvoid FadeCandyClientApp::mouseDrag( MouseEvent event )\n{\n\t\/\/ keep track of the mouse\n\tmMousePos = event.getPos();\n\n\t\/\/ let the camera handle the interaction\n\tmMayaCam.mouseDrag( event.getPos(), event.isLeftDown(), event.isMiddleDown(), event.isRightDown() );\n}\n\nvoid FadeCandyClientApp::resize()\n{\n\t\/\/ adjust aspect ratio\n\tCameraPersp cam = mMayaCam.getCamera();\n\tcam.setAspectRatio( getWindowAspectRatio() );\n\tmMayaCam.setCurrentCam( cam );\n}\n\nCINDER_APP_NATIVE( FadeCandyClientApp, RendererGl )\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 QtSCriptTools module of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the either Technology Preview License Agreement or the\n** Beta Release License Agreement.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain\n** additional rights. These rights are described in the Nokia Qt LGPL\n** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this\n** package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at http:\/\/qt.nokia.com\/contact.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"qscriptcompletiontask_p.h\"\n#include \"qscriptcompletiontaskinterface_p_p.h\"\n#include \"qscriptdebuggerconsole_p.h\"\n#include \"qscriptdebuggerconsolecommand_p.h\"\n#include \"qscriptdebuggerconsolecommandmanager_p.h\"\n#include \"qscriptdebuggercommandschedulerjob_p.h\"\n#include \"qscriptdebuggercommandschedulerfrontend_p.h\"\n#include \"qscriptdebuggerjobschedulerinterface_p.h\"\n#include \"qscriptdebuggerresponse_p.h\"\n\n#include \"private\/qobject_p.h\"\n\n#include <QtCore\/qset.h>\n#include <QtCore\/qdebug.h>\n\nQT_BEGIN_NAMESPACE\n\nclass QScriptCompletionTaskPrivate\n    : public QScriptCompletionTaskInterfacePrivate\n{\n    Q_DECLARE_PUBLIC(QScriptCompletionTask)\npublic:\n    QScriptCompletionTaskPrivate();\n    ~QScriptCompletionTaskPrivate();\n\n    void completeScriptExpression();\n    void emitFinished();\n\n    QString contents;\n    int cursorPosition;\n    int frameIndex;\n    QScriptDebuggerCommandSchedulerInterface *commandScheduler;\n    QScriptDebuggerJobSchedulerInterface *jobScheduler;\n    QScriptDebuggerConsole *console;\n};\n\nQScriptCompletionTaskPrivate::QScriptCompletionTaskPrivate()\n    : cursorPosition(0), frameIndex(0), frontend(0), console(0)\n{\n}\n\nQScriptCompletionTaskPrivate::~QScriptCompletionTaskPrivate()\n{\n}\n\nclass QScriptCompleteExpressionJob : public QScriptDebuggerCommandSchedulerJob\n{\npublic:\n    QScriptCompleteExpressionJob(int frameIndex, const QStringList &path,\n                                 QScriptCompletionTaskPrivate *task,\n                                 QScriptDebuggerCommandSchedulerInterface *scheduler)\n        : QScriptDebuggerCommandSchedulerJob(scheduler),\n          m_frameIndex(frameIndex), m_path(path), m_task(task)\n        {}\n\n    void start()\n    {\n        QScriptDebuggerCommandSchedulerFrontend frontend(commandScheduler(), this);\n        frontend.scheduleGetCompletions(m_frameIndex, m_path);\n    }\n    void handleResponse(const QScriptDebuggerResponse &response, int \/*commandId*\/)\n    {\n        m_task->results = response.result().toStringList();\n        m_task->emitFinished();\n        finish();\n    }\n\nprivate:\n    int m_frameIndex;\n    QStringList m_path;\n    QScriptCompletionTaskPrivate *m_task;\n};\n\nnamespace {\n\nstatic bool isIdentChar(const QChar &ch)\n{\n    static QChar underscore = QLatin1Char('_');\n    return ch.isLetter() || (ch == underscore);\n}\n\nstatic bool isPrefixOf(const QString &prefix, const QString &what)\n{\n    return ((what.length() > prefix.length())\n            && what.startsWith(prefix));\n}\n\n} \/\/ namespace\n\nclass QScriptCompleteScriptsJob : public QScriptDebuggerCommandSchedulerJob\n{\npublic:\n    QScriptCompleteScriptsJob(const QString &prefix, QScriptCompletionTaskPrivate *task,\n                              QScriptDebuggerCommandSchedulerInterface *scheduler)\n        : QScriptDebuggerCommandSchedulerJob(scheduler),\n          m_prefix(prefix), m_task(task)\n        {}\n\n    void start()\n    {\n        QScriptDebuggerCommandSchedulerFrontend frontend(commandScheduler(), this);\n        frontend.scheduleGetScripts();\n    }\n    void handleResponse(const QScriptDebuggerResponse &response, int \/*commandId*\/)\n    {\n        QScriptScriptMap scripts = response.resultAsScripts();\n        QScriptScriptMap::const_iterator it;\n        for (it = scripts.constBegin(); it != scripts.constEnd(); ++it) {\n            QString fileName = it.value().fileName();\n            if (isPrefixOf(m_prefix, fileName))\n                m_task->results.append(fileName);\n        }\n        m_task->emitFinished();\n        finish();\n    }\nprivate:\n    QString m_prefix;\n    QScriptCompletionTaskPrivate *m_task;\n};\n\nvoid QScriptCompletionTaskPrivate::completeScriptExpression()\n{\n    int pos = cursorPosition;\n    if ((pos > 0) && contents.at(pos-1).isNumber()) {\n        \/\/ completion of numbers is pointless\n        emitFinished();\n        return;\n    }\n\n    while ((pos > 0) && isIdentChar(contents.at(pos-1)))\n        --pos;\n    int pos2 = cursorPosition - 1;\n    while ((pos2 < contents.size()-1) && isIdentChar(contents.at(pos2+1)))\n        ++pos2;\n    QString ident = contents.mid(pos, pos2 - pos + 1);\n    position = pos;\n\n    QStringList path;\n    path.append(ident);\n    while ((pos > 0) && (contents.at(pos-1) == QLatin1Char('.'))) {\n        --pos;\n        pos2 = pos;\n        while ((pos > 0) && isIdentChar(contents.at(pos-1)))\n            --pos;\n        path.prepend(contents.mid(pos, pos2 - pos));\n    }\n\n    length = path.last().length();\n    type = QScriptCompletionTask::ScriptIdentifierCompletion;\n\n    QScriptDebuggerJob *job = new QScriptCompleteExpressionJob(frameIndex, path, this, commandScheduler);\n    jobScheduler->scheduleJob(job);\n}\n\nvoid QScriptCompletionTaskPrivate::emitFinished()\n{\n    emit q_func()->finished();\n}\n\nQScriptCompletionTask::QScriptCompletionTask(\n    const QString &contents, int cursorPosition, int frameIndex,\n    QScriptDebuggerCommandSchedulerInterface *commandScheduler,\n    QScriptDebuggerJobSchedulerInterface *jobScheduler,\n    QScriptDebuggerConsole *console,\n    QObject *parent)\n    : QScriptCompletionTaskInterface(\n        *new QScriptCompletionTaskPrivate, parent)\n{\n    Q_D(QScriptCompletionTask);\n    d->contents = contents;\n    d->cursorPosition = cursorPosition;\n    if ((frameIndex == -1) && console)\n        d->frameIndex = console->currentFrameIndex();\n    else\n        d->frameIndex = frameIndex;\n    d->commandScheduler = commandScheduler;\n    d->jobScheduler = jobScheduler;\n    d->console = console;\n}\n\nQScriptCompletionTask::~QScriptCompletionTask()\n{\n}\n\nvoid QScriptCompletionTask::start()\n{\n    Q_D(QScriptCompletionTask);\n    d->type = NoCompletion;\n    \/\/ see if we're typing a command\n    \/\/ ### don't hardcode the command prefix\n    QRegExp cmdRx(QString::fromLatin1(\"^\\\\s*\\\\.([a-zA-Z]*)\"));\n    int cmdIndex = cmdRx.indexIn(d->contents);\n    if ((cmdIndex != -1) && d->console) {\n        int len = cmdRx.matchedLength();\n        QString prefix = cmdRx.capturedTexts().at(1);\n        if ((d->cursorPosition >= cmdIndex) && (d->cursorPosition <= (cmdIndex+len))) {\n            \/\/ editing command --> get command completions\n            d->results = d->console->commandManager()->completions(prefix);\n            d->position = cmdRx.pos(1);\n            d->length = prefix.length();\n            d->type = CommandNameCompletion;\n            d->appendix = QString::fromLatin1(\" \");\n            emit finished();\n        } else {\n            QScriptDebuggerConsoleCommand *cmd = d->console->commandManager()->findCommand(prefix);\n            if (!cmd) {\n                emit finished();\n                return;\n            }\n            \/\/ editing an argument\n            int argNum = 0;\n            QString arg;\n            int pos = cmdIndex + len;\n            while (pos < d->contents.size()) {\n                while ((pos < d->contents.size()) && d->contents.at(pos).isSpace())\n                    ++pos;\n                if (pos < d->contents.size()) {\n                    int pos2 = pos + 1;\n                    while ((pos2 < d->contents.size()) && !d->contents.at(pos2).isSpace())\n                        ++pos2;\n                    if ((d->cursorPosition >= pos) && (d->cursorPosition <= pos2)) {\n                        arg = d->contents.mid(pos, pos2 - pos);\n                        break;\n                    }\n                    pos = pos2;\n                    ++argNum;\n                }\n            }\n            QString argType = cmd->argumentTypes().value(argNum);\n            if (!argType.isEmpty()) {\n                if (argType == QLatin1String(\"command-or-group-name\")) {\n                    d->results = d->console->commandManager()->completions(arg);\n                } else if (argType == QLatin1String(\"script-filename\")) {\n                    d->position = pos;\n                    d->length = arg.length();\n                    d->type = CommandArgumentCompletion;\n                    QScriptDebuggerJob *job = new QScriptCompleteScriptsJob(arg, d, d->commandScheduler);\n                    d->jobScheduler->scheduleJob(job);\n                } else if (argType == QLatin1String(\"subcommand-name\")) {\n                    for (int i = 0; i < cmd->subCommands().size(); ++i) {\n                        QString name = cmd->subCommands().at(i);\n                        if (isPrefixOf(arg, name))\n                            d->results.append(name);\n                    }\n                    qStableSort(d->results);\n                } else if (argType == QLatin1String(\"script\")) {\n                    d->completeScriptExpression();\n                } else {\n                    emit finished();\n                }\n                if ((d->type == NoCompletion) && !d->results.isEmpty()) {\n                    d->position = pos;\n                    d->length = arg.length();\n                    d->type = CommandArgumentCompletion;\n                    emit finished();\n                }\n            }\n        }\n    } else {\n        \/\/ assume it's an eval expression\n        d->completeScriptExpression();\n    }\n}\n\nQT_END_NAMESPACE\n<commit_msg>Compile fix after merge.<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the QtSCriptTools module of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the either Technology Preview License Agreement or the\n** Beta Release License Agreement.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain\n** additional rights. These rights are described in the Nokia Qt LGPL\n** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this\n** package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file.  Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at http:\/\/qt.nokia.com\/contact.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"qscriptcompletiontask_p.h\"\n#include \"qscriptcompletiontaskinterface_p_p.h\"\n#include \"qscriptdebuggerconsole_p.h\"\n#include \"qscriptdebuggerconsolecommand_p.h\"\n#include \"qscriptdebuggerconsolecommandmanager_p.h\"\n#include \"qscriptdebuggercommandschedulerjob_p.h\"\n#include \"qscriptdebuggercommandschedulerfrontend_p.h\"\n#include \"qscriptdebuggerjobschedulerinterface_p.h\"\n#include \"qscriptdebuggerresponse_p.h\"\n\n#include \"private\/qobject_p.h\"\n\n#include <QtCore\/qset.h>\n#include <QtCore\/qdebug.h>\n\nQT_BEGIN_NAMESPACE\n\nclass QScriptCompletionTaskPrivate\n    : public QScriptCompletionTaskInterfacePrivate\n{\n    Q_DECLARE_PUBLIC(QScriptCompletionTask)\npublic:\n    QScriptCompletionTaskPrivate();\n    ~QScriptCompletionTaskPrivate();\n\n    void completeScriptExpression();\n    void emitFinished();\n\n    QString contents;\n    int cursorPosition;\n    int frameIndex;\n    QScriptDebuggerCommandSchedulerInterface *commandScheduler;\n    QScriptDebuggerJobSchedulerInterface *jobScheduler;\n    QScriptDebuggerConsole *console;\n};\n\nQScriptCompletionTaskPrivate::QScriptCompletionTaskPrivate()\n    : cursorPosition(0), frameIndex(0), commandScheduler(0),\n      jobScheduler(0), console(0)\n{\n}\n\nQScriptCompletionTaskPrivate::~QScriptCompletionTaskPrivate()\n{\n}\n\nclass QScriptCompleteExpressionJob : public QScriptDebuggerCommandSchedulerJob\n{\npublic:\n    QScriptCompleteExpressionJob(int frameIndex, const QStringList &path,\n                                 QScriptCompletionTaskPrivate *task,\n                                 QScriptDebuggerCommandSchedulerInterface *scheduler)\n        : QScriptDebuggerCommandSchedulerJob(scheduler),\n          m_frameIndex(frameIndex), m_path(path), m_task(task)\n        {}\n\n    void start()\n    {\n        QScriptDebuggerCommandSchedulerFrontend frontend(commandScheduler(), this);\n        frontend.scheduleGetCompletions(m_frameIndex, m_path);\n    }\n    void handleResponse(const QScriptDebuggerResponse &response, int \/*commandId*\/)\n    {\n        m_task->results = response.result().toStringList();\n        m_task->emitFinished();\n        finish();\n    }\n\nprivate:\n    int m_frameIndex;\n    QStringList m_path;\n    QScriptCompletionTaskPrivate *m_task;\n};\n\nnamespace {\n\nstatic bool isIdentChar(const QChar &ch)\n{\n    static QChar underscore = QLatin1Char('_');\n    return ch.isLetter() || (ch == underscore);\n}\n\nstatic bool isPrefixOf(const QString &prefix, const QString &what)\n{\n    return ((what.length() > prefix.length())\n            && what.startsWith(prefix));\n}\n\n} \/\/ namespace\n\nclass QScriptCompleteScriptsJob : public QScriptDebuggerCommandSchedulerJob\n{\npublic:\n    QScriptCompleteScriptsJob(const QString &prefix, QScriptCompletionTaskPrivate *task,\n                              QScriptDebuggerCommandSchedulerInterface *scheduler)\n        : QScriptDebuggerCommandSchedulerJob(scheduler),\n          m_prefix(prefix), m_task(task)\n        {}\n\n    void start()\n    {\n        QScriptDebuggerCommandSchedulerFrontend frontend(commandScheduler(), this);\n        frontend.scheduleGetScripts();\n    }\n    void handleResponse(const QScriptDebuggerResponse &response, int \/*commandId*\/)\n    {\n        QScriptScriptMap scripts = response.resultAsScripts();\n        QScriptScriptMap::const_iterator it;\n        for (it = scripts.constBegin(); it != scripts.constEnd(); ++it) {\n            QString fileName = it.value().fileName();\n            if (isPrefixOf(m_prefix, fileName))\n                m_task->results.append(fileName);\n        }\n        m_task->emitFinished();\n        finish();\n    }\nprivate:\n    QString m_prefix;\n    QScriptCompletionTaskPrivate *m_task;\n};\n\nvoid QScriptCompletionTaskPrivate::completeScriptExpression()\n{\n    int pos = cursorPosition;\n    if ((pos > 0) && contents.at(pos-1).isNumber()) {\n        \/\/ completion of numbers is pointless\n        emitFinished();\n        return;\n    }\n\n    while ((pos > 0) && isIdentChar(contents.at(pos-1)))\n        --pos;\n    int pos2 = cursorPosition - 1;\n    while ((pos2 < contents.size()-1) && isIdentChar(contents.at(pos2+1)))\n        ++pos2;\n    QString ident = contents.mid(pos, pos2 - pos + 1);\n    position = pos;\n\n    QStringList path;\n    path.append(ident);\n    while ((pos > 0) && (contents.at(pos-1) == QLatin1Char('.'))) {\n        --pos;\n        pos2 = pos;\n        while ((pos > 0) && isIdentChar(contents.at(pos-1)))\n            --pos;\n        path.prepend(contents.mid(pos, pos2 - pos));\n    }\n\n    length = path.last().length();\n    type = QScriptCompletionTask::ScriptIdentifierCompletion;\n\n    QScriptDebuggerJob *job = new QScriptCompleteExpressionJob(frameIndex, path, this, commandScheduler);\n    jobScheduler->scheduleJob(job);\n}\n\nvoid QScriptCompletionTaskPrivate::emitFinished()\n{\n    emit q_func()->finished();\n}\n\nQScriptCompletionTask::QScriptCompletionTask(\n    const QString &contents, int cursorPosition, int frameIndex,\n    QScriptDebuggerCommandSchedulerInterface *commandScheduler,\n    QScriptDebuggerJobSchedulerInterface *jobScheduler,\n    QScriptDebuggerConsole *console,\n    QObject *parent)\n    : QScriptCompletionTaskInterface(\n        *new QScriptCompletionTaskPrivate, parent)\n{\n    Q_D(QScriptCompletionTask);\n    d->contents = contents;\n    d->cursorPosition = cursorPosition;\n    if ((frameIndex == -1) && console)\n        d->frameIndex = console->currentFrameIndex();\n    else\n        d->frameIndex = frameIndex;\n    d->commandScheduler = commandScheduler;\n    d->jobScheduler = jobScheduler;\n    d->console = console;\n}\n\nQScriptCompletionTask::~QScriptCompletionTask()\n{\n}\n\nvoid QScriptCompletionTask::start()\n{\n    Q_D(QScriptCompletionTask);\n    d->type = NoCompletion;\n    \/\/ see if we're typing a command\n    \/\/ ### don't hardcode the command prefix\n    QRegExp cmdRx(QString::fromLatin1(\"^\\\\s*\\\\.([a-zA-Z]*)\"));\n    int cmdIndex = cmdRx.indexIn(d->contents);\n    if ((cmdIndex != -1) && d->console) {\n        int len = cmdRx.matchedLength();\n        QString prefix = cmdRx.capturedTexts().at(1);\n        if ((d->cursorPosition >= cmdIndex) && (d->cursorPosition <= (cmdIndex+len))) {\n            \/\/ editing command --> get command completions\n            d->results = d->console->commandManager()->completions(prefix);\n            d->position = cmdRx.pos(1);\n            d->length = prefix.length();\n            d->type = CommandNameCompletion;\n            d->appendix = QString::fromLatin1(\" \");\n            emit finished();\n        } else {\n            QScriptDebuggerConsoleCommand *cmd = d->console->commandManager()->findCommand(prefix);\n            if (!cmd) {\n                emit finished();\n                return;\n            }\n            \/\/ editing an argument\n            int argNum = 0;\n            QString arg;\n            int pos = cmdIndex + len;\n            while (pos < d->contents.size()) {\n                while ((pos < d->contents.size()) && d->contents.at(pos).isSpace())\n                    ++pos;\n                if (pos < d->contents.size()) {\n                    int pos2 = pos + 1;\n                    while ((pos2 < d->contents.size()) && !d->contents.at(pos2).isSpace())\n                        ++pos2;\n                    if ((d->cursorPosition >= pos) && (d->cursorPosition <= pos2)) {\n                        arg = d->contents.mid(pos, pos2 - pos);\n                        break;\n                    }\n                    pos = pos2;\n                    ++argNum;\n                }\n            }\n            QString argType = cmd->argumentTypes().value(argNum);\n            if (!argType.isEmpty()) {\n                if (argType == QLatin1String(\"command-or-group-name\")) {\n                    d->results = d->console->commandManager()->completions(arg);\n                } else if (argType == QLatin1String(\"script-filename\")) {\n                    d->position = pos;\n                    d->length = arg.length();\n                    d->type = CommandArgumentCompletion;\n                    QScriptDebuggerJob *job = new QScriptCompleteScriptsJob(arg, d, d->commandScheduler);\n                    d->jobScheduler->scheduleJob(job);\n                } else if (argType == QLatin1String(\"subcommand-name\")) {\n                    for (int i = 0; i < cmd->subCommands().size(); ++i) {\n                        QString name = cmd->subCommands().at(i);\n                        if (isPrefixOf(arg, name))\n                            d->results.append(name);\n                    }\n                    qStableSort(d->results);\n                } else if (argType == QLatin1String(\"script\")) {\n                    d->completeScriptExpression();\n                } else {\n                    emit finished();\n                }\n                if ((d->type == NoCompletion) && !d->results.isEmpty()) {\n                    d->position = pos;\n                    d->length = arg.length();\n                    d->type = CommandArgumentCompletion;\n                    emit finished();\n                }\n            }\n        }\n    } else {\n        \/\/ assume it's an eval expression\n        d->completeScriptExpression();\n    }\n}\n\nQT_END_NAMESPACE\n<|endoftext|>"}
{"text":"<commit_before>#include <openMVG\/localization\/VoctreeLocalizer.hpp>\n#include <openMVG\/localization\/CCTagLocalizer.hpp>\n#include <openMVG\/rig\/Rig.hpp>\n#include <openMVG\/sfm\/pipelines\/localization\/SfM_Localizer.hpp>\n#include <openMVG\/image\/image_io.hpp>\n#include <openMVG\/dataio\/FeedProvider.hpp>\n\n#include <boost\/filesystem\/operations.hpp>\n#include <boost\/filesystem\/path.hpp>\n#include <boost\/progress.hpp>\n#include <boost\/program_options.hpp> \n#include <boost\/accumulators\/accumulators.hpp>\n#include <boost\/accumulators\/statistics\/stats.hpp>\n#include <boost\/accumulators\/statistics\/mean.hpp>\n#include <boost\/accumulators\/statistics\/min.hpp>\n#include <boost\/accumulators\/statistics\/max.hpp>\n#include <boost\/accumulators\/statistics\/sum.hpp>\n\n#include <iostream>\n#include <string>\n#include <chrono>\n\n#if HAVE_ALEMBIC\n#include <openMVG\/dataio\/AlembicExporter.hpp>\n#endif \/\/ HAVE_ALEMBIC\n\n#define POPART_COUT(x) std::cout << x << std::endl\n#define POPART_CERR(x) std::cerr << x << std::endl\n\n\nnamespace bfs = boost::filesystem;\nnamespace bacc = boost::accumulators;\nnamespace po = boost::program_options;\n\nusing namespace openMVG;\n\nstd::string myToString(std::size_t i, std::size_t zeroPadding)\n{\n  std::stringstream ss;\n  ss << std::setw(zeroPadding) << std::setfill('0') << i;\n  return ss.str();\n}\n\nint main(int argc, char** argv)\n{\n  std::string sfmFilePath; \/\/< the OpenMVG .json data file\n  std::string descriptorsFolder; \/\/< the OpenMVG .json data file\n  std::string mediaFilepath; \/\/< the media file to localize\n  localization::CCTagLocalizer::Parameters param = localization::CCTagLocalizer::Parameters();\n#if HAVE_ALEMBIC\n  std::string exportFile = \"trackedcameras.abc\"; \/\/!< the export file\n#endif\n  std::size_t nCam = 3;\n  po::options_description desc(\n          \"This program takes as input a media (image, image sequence, video) and a database (voctree, 3D structure data) \\n\"\n          \"and returns for each frame a pose estimation for the camera.\");\n  desc.add_options()\n          (\"help,h\", \"Print this message\")\n          (\"results,r\", po::value<size_t>(&param._nNearestKeyFrames)->default_value(param._nNearestKeyFrames), \"Number of images to retrieve in database\")\n          (\"sfmdata,d\", po::value<std::string>(&sfmFilePath)->required(), \"The sfm_data.json kind of file generated by OpenMVG [it could be also a bundle.out to use an older version of OpenMVG]\")\n          (\"siftPath,s\", po::value<std::string>(&descriptorsFolder), \"Folder containing the .desc. If not provided, it will be assumed to be parent(sfmdata)\/matches [for the older version of openMVG it is the list.txt]\")\n          (\"mediafile,m\", po::value<std::string>(&mediaFilepath)->required(), \"The folder path containing all the synchronised image subfolders assocated to each camera\")\n          (\"refineIntrinsics,\", po::bool_switch(&param._refineIntrinsics), \"Enable\/Disable camera intrinsics refinement for each localized image\")\n          (\"nCameras\", po::value<size_t>(&nCam)->default_value(nCam), \"Enable\/Disable camera intrinsics refinement for each localized image\")\n#if HAVE_ALEMBIC\n          (\"export,e\", po::value<std::string>(&exportFile)->default_value(exportFile), \"Filename for the SfM_Data export file (where camera poses will be stored). Default : trackedcameras.json If Alambic is enable it will also export an .abc file of the scene with the same name\")\n#endif\n          ;\n\n  po::variables_map vm;\n\n  try {\n    po::store(po::parse_command_line(argc, argv, desc), vm);\n\n    if (vm.count(\"help\") || (argc == 1)) {\n      POPART_COUT(desc);\n      return EXIT_SUCCESS;\n    }\n\n    po::notify(vm);\n  }  catch (boost::program_options::required_option& e) {\n    POPART_CERR(\"ERROR: \" << e.what() << std::endl);\n    POPART_COUT(\"Usage:\\n\\n\" << desc);\n    return EXIT_FAILURE;\n  }  catch (boost::program_options::error& e) {\n    POPART_CERR(\"ERROR: \" << e.what() << std::endl);\n    POPART_COUT(\"Usage:\\n\\n\" << desc);\n    return EXIT_FAILURE;\n  }\n  {\n    POPART_COUT(\"Program called with the following parameters:\");\n    POPART_COUT(\"\\tsfmdata: \" << sfmFilePath);\n    POPART_COUT(\"\\tmediafile: \" << mediaFilepath);\n    POPART_COUT(\"\\tsiftPath: \" << descriptorsFolder);\n    POPART_COUT(\"\\tresults: \" << param._nNearestKeyFrames);\n    POPART_COUT(\"\\trefineIntrinsics: \" << param._refineIntrinsics);\n  }\n\n  \/\/ init the localizer\n  localization::CCTagLocalizer localizer;\n  bool isInit = localizer.init(sfmFilePath, descriptorsFolder);\n\n  if (!isInit) {\n    POPART_CERR(\"ERROR while initializing the localizer!\");\n    return EXIT_FAILURE;\n  }\n\n#if HAVE_ALEMBIC\n  dataio::AlembicExporter exporter(exportFile);\n  exporter.addPoints(localizer.getSfMData().GetLandmarks());\n#endif\n  \n  \/\/ Create a camera rig\n  rig::Rig rig;\n\n  \/\/ Loop over all cameras of the rig\n  for (int i = 0; i < nCam; ++i)\n  {\n    std::string subMediaFilepath, calibFile;\n    subMediaFilepath = mediaFilepath + \"\/\" + std::to_string(i);\n    calibFile = subMediaFilepath + \"\/intrinsics.txt\";\n\n    \/\/ create the feedProvider\n    dataio::FeedProvider feed(subMediaFilepath, calibFile);\n    if (!feed.isInit())\n    {\n      POPART_CERR(\"ERROR while initializing the FeedProvider!\");\n      return EXIT_FAILURE;\n    }\n\n    \/\/std::string featureFile, cameraResultFile, pointsFile;\n    \/\/featureFile = subMediaFilepath + \"\/cctag\" + std::to_string(nRings) + \"CC.out\";\n    \/\/cameraResultFile = inputFolder + \"\/\" + std::to_string(i) + \"\/cameras.txt\";\n    \/\/std::ofstream result;\n    \/\/result.open(cameraResultFile);\n    \/\/pointsFile = inputFolder + \"\/points.txt\";\n\n    image::Image<unsigned char> imageGrey;\n    cameras::Pinhole_Intrinsic_Radial_K3 queryIntrinsics;\n    bool hasIntrinsics = false;\n    geometry::Pose3 cameraPose;\n\n    size_t frameCounter = 0;\n    std::string currentImgName;\n\n    \/\/ Define an accumulator set for computing the mean and the\n    \/\/ standard deviation of the time taken for localization\n    bacc::accumulator_set<double, bacc::stats<bacc::tag::mean, bacc::tag::min, bacc::tag::max, bacc::tag::sum > > stats;\n\n    \/\/ used to collect the match data result\n    std::vector<sfm::Image_Localizer_Match_Data> associations;\n    std::vector<geometry::Pose3> poses;\n    std::vector<std::vector<pair<IndexT, IndexT> > > associationIDs;\n    std::vector<bool> localized; \/\/ this is just to keep track of the unlocalized frames so that a fake camera\n    \/\/ can be inserted and we see the sequence correctly in maya\n    \n    std::vector<localization::LocalizationResult> vLocalizationResults;\n    while (feed.next(imageGrey, queryIntrinsics, currentImgName, hasIntrinsics))\n    {\n      POPART_COUT(\"******************************\");\n      POPART_COUT(\"FRAME \" << myToString(frameCounter, 4));\n      POPART_COUT(\"******************************\");\n      sfm::Image_Localizer_Match_Data matchData;\n      std::vector<pair<IndexT, IndexT> > ids;\n      auto detect_start = std::chrono::steady_clock::now();\n      localization::LocalizationResult localizationResult;\n      localizer.localize(imageGrey,\n              param,\n              hasIntrinsics\/*useInputIntrinsics*\/,\n              queryIntrinsics,\n              localizationResult);\n      vLocalizationResults.emplace_back(localizationResult);\n      auto detect_end = std::chrono::steady_clock::now();\n      auto detect_elapsed = std::chrono::duration_cast<std::chrono::milliseconds>(detect_end - detect_start);\n      POPART_COUT(\"\\nLocalization took  \" << detect_elapsed.count() << \" [ms]\");\n      stats(detect_elapsed.count());\n\n      \/\/ save data\n      if (localizationResult.isValid()) {\n        \/\/      if(globalBundle)\n        \/\/      {\n        \/\/        associations.push_back(matchData);\n        \/\/        poses.push_back(cameraPose);\n        \/\/        associationIDs.push_back(ids);\n        \/\/        localized.push_back(true);\n        \/\/      }\n        \/\/    }\n        \/\/    else\n        \/\/    {\n        \/\/#if HAVE_ALEMBIC\n        \/\/      \/\/ @fixme for now just add a fake camera so that it still can be see in MAYA\n        \/\/      exporter.appendCamera(\"camera.V.\"+myToString(frameCounter,4), geometry::Pose3(), &queryIntrinsics, mediaFilepath, frameCounter, frameCounter);\n        \/\/#endif\n        \/\/      if(globalBundle) \n        \/\/      {\n        \/\/       localized.push_back(false);\n        \/\/      }\n        \/\/      POPART_CERR(\"Unable to localize frame \" << frameCounter);\n      }\n      ++frameCounter;\n    }\n\n    \/\/ print out some time stats\n    POPART_COUT(\"\\n\\n******************************\");\n    POPART_COUT(\"Localized \" << frameCounter << \" images\");\n    POPART_COUT(\"Processing took \" << bacc::sum(stats) \/ 1000 << \" [s] overall\");\n    POPART_COUT(\"Mean time for localization:   \" << bacc::mean(stats) << \" [ms]\");\n    POPART_COUT(\"Max time for localization:   \" << bacc::max(stats) << \" [ms]\");\n    POPART_COUT(\"Min time for localization:   \" << bacc::min(stats) << \" [ms]\");\n  }\n}\n<commit_msg>[Software] Call initialize calibration in rig calibration.<commit_after>#include <openMVG\/localization\/VoctreeLocalizer.hpp>\n#include <openMVG\/localization\/CCTagLocalizer.hpp>\n#include <openMVG\/rig\/Rig.hpp>\n#include <openMVG\/sfm\/pipelines\/localization\/SfM_Localizer.hpp>\n#include <openMVG\/image\/image_io.hpp>\n#include <openMVG\/dataio\/FeedProvider.hpp>\n\n#include <boost\/filesystem\/operations.hpp>\n#include <boost\/filesystem\/path.hpp>\n#include <boost\/progress.hpp>\n#include <boost\/program_options.hpp> \n#include <boost\/accumulators\/accumulators.hpp>\n#include <boost\/accumulators\/statistics\/stats.hpp>\n#include <boost\/accumulators\/statistics\/mean.hpp>\n#include <boost\/accumulators\/statistics\/min.hpp>\n#include <boost\/accumulators\/statistics\/max.hpp>\n#include <boost\/accumulators\/statistics\/sum.hpp>\n\n#include <iostream>\n#include <string>\n#include <chrono>\n\n#if HAVE_ALEMBIC\n#include <openMVG\/dataio\/AlembicExporter.hpp>\n#endif \/\/ HAVE_ALEMBIC\n\n#define POPART_COUT(x) std::cout << x << std::endl\n#define POPART_CERR(x) std::cerr << x << std::endl\n\n\nnamespace bfs = boost::filesystem;\nnamespace bacc = boost::accumulators;\nnamespace po = boost::program_options;\n\nusing namespace openMVG;\n\nstd::string myToString(std::size_t i, std::size_t zeroPadding)\n{\n  std::stringstream ss;\n  ss << std::setw(zeroPadding) << std::setfill('0') << i;\n  return ss.str();\n}\n\nint main(int argc, char** argv)\n{\n  std::string sfmFilePath; \/\/< the OpenMVG .json data file\n  std::string descriptorsFolder; \/\/< the OpenMVG .json data file\n  std::string mediaFilepath; \/\/< the media file to localize\n  localization::CCTagLocalizer::Parameters param = localization::CCTagLocalizer::Parameters();\n#if HAVE_ALEMBIC\n  std::string exportFile = \"trackedcameras.abc\"; \/\/!< the export file\n#endif\n  std::size_t nCam = 3;\n  po::options_description desc(\n          \"This program takes as input a media (image, image sequence, video) and a database (voctree, 3D structure data) \\n\"\n          \"and returns for each frame a pose estimation for the camera.\");\n  desc.add_options()\n          (\"help,h\", \"Print this message\")\n          (\"results,r\", po::value<size_t>(&param._nNearestKeyFrames)->default_value(param._nNearestKeyFrames), \"Number of images to retrieve in database\")\n          (\"sfmdata,d\", po::value<std::string>(&sfmFilePath)->required(), \"The sfm_data.json kind of file generated by OpenMVG [it could be also a bundle.out to use an older version of OpenMVG]\")\n          (\"siftPath,s\", po::value<std::string>(&descriptorsFolder), \"Folder containing the .desc. If not provided, it will be assumed to be parent(sfmdata)\/matches [for the older version of openMVG it is the list.txt]\")\n          (\"mediafile,m\", po::value<std::string>(&mediaFilepath)->required(), \"The folder path containing all the synchronised image subfolders assocated to each camera\")\n          (\"refineIntrinsics,\", po::bool_switch(&param._refineIntrinsics), \"Enable\/Disable camera intrinsics refinement for each localized image\")\n          (\"nCameras\", po::value<size_t>(&nCam)->default_value(nCam), \"Enable\/Disable camera intrinsics refinement for each localized image\")\n#if HAVE_ALEMBIC\n          (\"export,e\", po::value<std::string>(&exportFile)->default_value(exportFile), \"Filename for the SfM_Data export file (where camera poses will be stored). Default : trackedcameras.json If Alambic is enable it will also export an .abc file of the scene with the same name\")\n#endif\n          ;\n\n  po::variables_map vm;\n\n  try {\n    po::store(po::parse_command_line(argc, argv, desc), vm);\n\n    if (vm.count(\"help\") || (argc == 1)) {\n      POPART_COUT(desc);\n      return EXIT_SUCCESS;\n    }\n\n    po::notify(vm);\n  }  catch (boost::program_options::required_option& e) {\n    POPART_CERR(\"ERROR: \" << e.what() << std::endl);\n    POPART_COUT(\"Usage:\\n\\n\" << desc);\n    return EXIT_FAILURE;\n  }  catch (boost::program_options::error& e) {\n    POPART_CERR(\"ERROR: \" << e.what() << std::endl);\n    POPART_COUT(\"Usage:\\n\\n\" << desc);\n    return EXIT_FAILURE;\n  }\n  {\n    POPART_COUT(\"Program called with the following parameters:\");\n    POPART_COUT(\"\\tsfmdata: \" << sfmFilePath);\n    POPART_COUT(\"\\tmediafile: \" << mediaFilepath);\n    POPART_COUT(\"\\tsiftPath: \" << descriptorsFolder);\n    POPART_COUT(\"\\tresults: \" << param._nNearestKeyFrames);\n    POPART_COUT(\"\\trefineIntrinsics: \" << param._refineIntrinsics);\n  }\n\n  \/\/ init the localizer\n  localization::CCTagLocalizer localizer;\n  bool isInit = localizer.init(sfmFilePath, descriptorsFolder);\n\n  if (!isInit) {\n    POPART_CERR(\"ERROR while initializing the localizer!\");\n    return EXIT_FAILURE;\n  }\n\n#if HAVE_ALEMBIC\n  dataio::AlembicExporter exporter(exportFile);\n  exporter.addPoints(localizer.getSfMData().GetLandmarks());\n#endif\n  \n  \/\/ Create a camera rig\n  rig::Rig rig;\n\n  \/\/ Loop over all cameras of the rig\n  for (int i = 0; i < nCam; ++i)\n  {\n    std::string subMediaFilepath, calibFile;\n    subMediaFilepath = mediaFilepath + \"\/\" + std::to_string(i);\n    calibFile = subMediaFilepath + \"\/intrinsics.txt\";\n\n    \/\/ create the feedProvider\n    dataio::FeedProvider feed(subMediaFilepath, calibFile);\n    if (!feed.isInit())\n    {\n      POPART_CERR(\"ERROR while initializing the FeedProvider!\");\n      return EXIT_FAILURE;\n    }\n\n    \/\/std::string featureFile, cameraResultFile, pointsFile;\n    \/\/featureFile = subMediaFilepath + \"\/cctag\" + std::to_string(nRings) + \"CC.out\";\n    \/\/cameraResultFile = inputFolder + \"\/\" + std::to_string(i) + \"\/cameras.txt\";\n    \/\/std::ofstream result;\n    \/\/result.open(cameraResultFile);\n    \/\/pointsFile = inputFolder + \"\/points.txt\";\n\n    image::Image<unsigned char> imageGrey;\n    cameras::Pinhole_Intrinsic_Radial_K3 queryIntrinsics;\n    bool hasIntrinsics = false;\n    geometry::Pose3 cameraPose;\n\n    size_t frameCounter = 0;\n    std::string currentImgName;\n\n    \/\/ Define an accumulator set for computing the mean and the\n    \/\/ standard deviation of the time taken for localization\n    bacc::accumulator_set<double, bacc::stats<bacc::tag::mean, bacc::tag::min, bacc::tag::max, bacc::tag::sum > > stats;\n\n    \/\/ used to collect the match data result\n    std::vector<sfm::Image_Localizer_Match_Data> associations;\n    std::vector<geometry::Pose3> poses;\n    std::vector<std::vector<pair<IndexT, IndexT> > > associationIDs;\n    std::vector<bool> localized; \/\/ this is just to keep track of the unlocalized frames so that a fake camera\n    \/\/ can be inserted and we see the sequence correctly in maya\n    \n    std::vector<localization::LocalizationResult> vLocalizationResults;\n    while (feed.next(imageGrey, queryIntrinsics, currentImgName, hasIntrinsics))\n    {\n      POPART_COUT(\"******************************\");\n      POPART_COUT(\"FRAME \" << myToString(frameCounter, 4));\n      POPART_COUT(\"******************************\");\n      sfm::Image_Localizer_Match_Data matchData;\n      std::vector<pair<IndexT, IndexT> > ids;\n      auto detect_start = std::chrono::steady_clock::now();\n      localization::LocalizationResult localizationResult;\n      localizer.localize(imageGrey,\n              param,\n              hasIntrinsics\/*useInputIntrinsics*\/,\n              queryIntrinsics,\n              localizationResult);\n      vLocalizationResults.emplace_back(localizationResult);\n      auto detect_end = std::chrono::steady_clock::now();\n      auto detect_elapsed = std::chrono::duration_cast<std::chrono::milliseconds>(detect_end - detect_start);\n      POPART_COUT(\"\\nLocalization took  \" << detect_elapsed.count() << \" [ms]\");\n      stats(detect_elapsed.count());\n\n      ++frameCounter;\n    }\n\n    rig.setTrackingResult(vLocalizationResults, i);\n    \n    \/\/ print out some time stats\n    POPART_COUT(\"\\n\\n******************************\");\n    POPART_COUT(\"Localized \" << frameCounter << \" images\");\n    POPART_COUT(\"Processing took \" << bacc::sum(stats) \/ 1000 << \" [s] overall\");\n    POPART_COUT(\"Mean time for localization:   \" << bacc::mean(stats) << \" [ms]\");\n    POPART_COUT(\"Max time for localization:   \" << bacc::max(stats) << \" [ms]\");\n    POPART_COUT(\"Min time for localization:   \" << bacc::min(stats) << \" [ms]\");\n  }\n  rig.initializeCalibration();\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 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 LPTOP_LEVEL_EXCEPTION_FILTER defaultTopLevelExceptionHandler = NULL;\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    redisLog(REDIS_WARNING, \"--- STACK TRACE\");\n    LogStackTrace();\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 this bug by following the instructions at:\\n\\n\"\n        \"     http:\/\/github.com\/MSOpenTech\/redis\/wiki\/Submitting-an-Issue\\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        }\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\n    if (defaultTopLevelExceptionHandler != NULL) {\n        defaultTopLevelExceptionHandler(info);\n    }\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    SymInitialize(process, NULL, TRUE);\n}\n\nvoid StackTraceInit(void) {\n    InitSymbols();\n    \/\/ Global handler for unhandled exceptions\n    defaultTopLevelExceptionHandler = SetUnhandledExceptionFilter(UnhandledExceptiontHandler);\n    \/\/ Handler for abort()\n    signal(SIGABRT, &AbortHandler);\n}\n<commit_msg>[Fix] UnhandledExceptiontHandler internal exception handling.<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 LPTOP_LEVEL_EXCEPTION_FILTER defaultTopLevelExceptionHandler = NULL;\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    redisLog(REDIS_WARNING, \"--- STACK TRACE\");\n    LogStackTrace();\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 this bug by following the instructions at:\\n\\n\"\n        \"     http:\/\/github.com\/MSOpenTech\/redis\/wiki\/Submitting-an-Issue\\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        try {\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            }\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        catch (...) {};\n    }\n\n    if (defaultTopLevelExceptionHandler != NULL) {\n        defaultTopLevelExceptionHandler(info);\n    }\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    SymInitialize(process, NULL, TRUE);\n}\n\nvoid StackTraceInit(void) {\n    InitSymbols();\n    \/\/ Global handler for unhandled exceptions\n    defaultTopLevelExceptionHandler = SetUnhandledExceptionFilter(UnhandledExceptiontHandler);\n    \/\/ Handler for abort()\n    signal(SIGABRT, &AbortHandler);\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 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 LPTOP_LEVEL_EXCEPTION_FILTER defaultTopLevelExceptionHandler = NULL;\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    redisLog(REDIS_WARNING, \"--- STACK TRACE\");\n    LogStackTrace();\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 this bug by following the instructions at:\\n\\n\"\n        \"     http:\/\/github.com\/MSOpenTech\/redis\/wiki\/Submitting-an-Issue\\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        try {\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            }\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        catch (...) {};\n    }\n\n    if (defaultTopLevelExceptionHandler != NULL) {\n        defaultTopLevelExceptionHandler(info);\n    }\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    SymInitialize(process, NULL, TRUE);\n}\n\nvoid StackTraceInit(void) {\n    InitSymbols();\n    \/\/ Global handler for unhandled exceptions\n    defaultTopLevelExceptionHandler = SetUnhandledExceptionFilter(UnhandledExceptiontHandler);\n    \/\/ Handler for abort()\n    signal(SIGABRT, &AbortHandler);\n}\n<commit_msg>[Fix] UnhandledExceptiontHandler internal exception handling.<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 LPTOP_LEVEL_EXCEPTION_FILTER defaultTopLevelExceptionHandler = NULL;\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    redisLog(REDIS_WARNING, \"--- STACK TRACE\");\n    LogStackTrace();\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 this bug by following the instructions at:\\n\\n\"\n        \"     http:\/\/github.com\/MSOpenTech\/redis\/wiki\/Submitting-an-Issue\\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        bool headerLogged = false;\n        try {\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            }\n\n            \/\/ Call antirez routine to log the start of the bug report\n            bugReportStart();\n            headerLogged = true;\n            redisLog(REDIS_WARNING, \"--- %s\", exDescription);\n            StackTraceInfo();\n            ServerInfo();\n        }\n        catch (...) {}\n        if (headerLogged) {\n            BugReportEnd();\n        }\n        processingException = false;\n    }\n\n    if (defaultTopLevelExceptionHandler != NULL) {\n        defaultTopLevelExceptionHandler(info);\n    }\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    SymInitialize(process, NULL, TRUE);\n}\n\nvoid StackTraceInit(void) {\n    InitSymbols();\n    \/\/ Global handler for unhandled exceptions\n    defaultTopLevelExceptionHandler = SetUnhandledExceptionFilter(UnhandledExceptiontHandler);\n    \/\/ Handler for abort()\n    signal(SIGABRT, &AbortHandler);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* ---------------------------------------------------------------------\n * Numenta Platform for Intelligent Computing (NuPIC)\n * Copyright (C) 2015, 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 Affero 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 Affero Public License for more details.\n *\n * You should have received a copy of the GNU Affero 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 * Implementation of performance tests for Connections\n *\/\n\n#include <fstream>\n#include <iostream>\n#include <time.h>\n#include <stdlib.h>\n\n#include <nupic\/algorithms\/TemporalMemory.hpp>\n#include <nupic\/algorithms\/Connections.hpp>\n\n#include \"ConnectionsPerformanceTest.hpp\"\n\nusing namespace std;\nusing namespace nupic;\nusing namespace nupic::algorithms::temporal_memory;\nusing namespace nupic::algorithms::connections;\n\n#define SEED 42\n\nnamespace nupic\n{\n\n  void ConnectionsPerformanceTest::RunTests()\n  {\n    srand(SEED);\n\n    testTemporalMemoryUsage();\n    testLargeTemporalMemoryUsage();\n    testSpatialPoolerUsage();\n    testTemporalPoolerUsage();\n  }\n\n  \/**\n   * Tests typical usage of Connections with Temporal Memory.\n   *\/\n  void ConnectionsPerformanceTest::testTemporalMemoryUsage()\n  {\n    runTemporalMemoryTest(2048, 40, 5, 100, \"temporal memory\");\n  }\n\n  \/**\n   * Tests typical usage of Connections with a large Temporal Memory.\n   *\/\n  void ConnectionsPerformanceTest::testLargeTemporalMemoryUsage()\n  {\n    runTemporalMemoryTest(16384, 328, 3, 40, \"temporal memory (large)\");\n  }\n\n  \/**\n   * Tests typical usage of Connections with Spatial Pooler.\n   *\/\n  void ConnectionsPerformanceTest::testSpatialPoolerUsage()\n  {\n    runSpatialPoolerTest(2048, 2048, 40, 40, \"spatial pooler\");\n  }\n\n  \/**\n   * Tests typical usage of Connections with Temporal Pooler.\n   *\/\n  void ConnectionsPerformanceTest::testTemporalPoolerUsage()\n  {\n    runSpatialPoolerTest(2048, 16384, 40, 400, \"temporal pooler\");\n  }\n\n  void ConnectionsPerformanceTest::runTemporalMemoryTest(UInt numColumns,\n                                                         UInt w,\n                                                         int numSequences,\n                                                         int numElements,\n                                                         string label)\n  {\n    clock_t timer = clock();\n\n    \/\/ Initialize\n\n    TemporalMemory tm;\n    vector<UInt> columnDim;\n    columnDim.push_back(numColumns);\n    tm.initialize(columnDim);\n\n    checkpoint(timer, label + \": initialize\");\n\n    \/\/ Learn\n\n    vector< vector< vector<Cell> > >sequences;\n    vector< vector<Cell> >sequence;\n    vector<Cell> sdr;\n\n    for (int i = 0; i < numSequences; i++)\n    {\n      for (int j = 0; j < numElements; j++)\n      {\n        sdr = randomSDR(numColumns, w);\n        sequence.push_back(sdr);\n      }\n\n      sequences.push_back(sequence);\n    }\n\n    for (int i = 0; i < 5; i++)\n    {\n      for (auto sequence : sequences)\n      {\n        for (auto sdr : sequence)\n        {\n          feedTM(tm, sdr);\n          tm.reset();\n        }\n      }\n    }\n\n    checkpoint(timer, label + \": initialize + learn\");\n\n    \/\/ Test\n\n    for (auto sequence : sequences)\n    {\n      for (auto sdr : sequence)\n      {\n        feedTM(tm, sdr, false);\n        tm.reset();\n      }\n    }\n\n    checkpoint(timer, label + \": initialize + learn + test\");\n  }\n\n  void ConnectionsPerformanceTest::runSpatialPoolerTest(UInt numCells,\n                                                        UInt numInputs,\n                                                        UInt w,\n                                                        UInt numWinners,\n                                                        string label)\n  {\n    clock_t timer = clock();\n\n    Connections connections(numCells, 1, numInputs);\n    Cell cell;\n    Segment segment;\n    vector<Cell> sdr;\n    Activity activity;\n\n    \/\/ Initialize\n\n    for (UInt c = 0; c < numCells; c++)\n    {\n      cell = Cell(c);\n      segment = connections.createSegment(c);\n\n      for (UInt i = 0; i < numInputs; i++)\n      {\n        connections.createSynapse(segment, i, (Permanence)rand()\/RAND_MAX);\n      }\n    }\n\n    checkpoint(timer, label + \": initialize\");\n\n    \/\/ Learn\n\n    vector<Cell> winnerCells;\n    SynapseData synapseData;\n    Permanence permanence;\n\n    for (int i = 0; i < 500; i++)\n    {\n      sdr = randomSDR(numInputs, w);\n      activity = connections.computeActivity(sdr, 0.5, 0, 0.25, 0);\n      winnerCells = computeSPWinnerCells(connections, numWinners, activity);\n\n      for (Cell winnerCell : winnerCells)\n      {\n        segment = Segment(0, winnerCell);\n\n        for (Synapse synapse : connections.synapsesForSegment(segment))\n        {\n          synapseData = connections.dataForSynapse(synapse);\n          permanence = synapseData.permanence;\n\n          if (find(sdr.begin(), sdr.end(), synapseData.presynapticCell) !=\n              sdr.end())\n          {\n            permanence += 0.2;\n          }\n          else\n          {\n            permanence -= 0.1;\n          }\n\n          permanence = max(permanence, (Permanence)0);\n          permanence = min(permanence, (Permanence)1);\n\n          \/\/ TODO (Question): Remove synapses with 0 permanence?\n\n          connections.updateSynapsePermanence(synapse, permanence);\n        }\n      }\n    }\n\n    checkpoint(timer, label + \": initialize + learn\");\n\n    \/\/ Test\n\n    for (int i = 0; i < 500; i++)\n    {\n      sdr = randomSDR(numInputs, w);\n      activity = connections.computeActivity(sdr, 0.5, 0, 0.25, 0);\n      winnerCells = computeSPWinnerCells(connections, numWinners, activity);\n    }\n\n    checkpoint(timer, label + \": initialize + learn + test\");\n  }\n\n  void ConnectionsPerformanceTest::checkpoint(clock_t timer, string text)\n  {\n    float duration = (float)(clock() - timer) \/ CLOCKS_PER_SEC;\n    cout << duration << \" in \" << text << endl;\n  }\n\n  vector<Cell> ConnectionsPerformanceTest::randomSDR(UInt n, UInt w)\n  {\n    set<UInt> sdrSet = set<UInt>();\n    vector<Cell> sdr = vector<Cell>();\n\n    for (UInt i = 0; i < w; i++)\n    {\n      sdrSet.insert(rand() % (UInt)n);\n    }\n\n    for (UInt c : sdrSet)\n    {\n      sdr.push_back(Cell(c));\n    }\n\n    return sdr;\n  }\n\n  void ConnectionsPerformanceTest::feedTM(TemporalMemory &tm,\n                                          vector<Cell> sdr,\n                                          bool learn)\n  {\n    vector<UInt> activeColumns;\n\n    for (auto c : sdr)\n    {\n      activeColumns.push_back(c.idx);\n    }\n\n    tm.compute(activeColumns.size(), activeColumns.data(), learn);\n  }\n\n  vector<Cell> ConnectionsPerformanceTest::computeSPWinnerCells(\n    Connections& connections, UInt numCells, Activity& activity)\n  {\n    vector<UInt32> numActiveSynapsesList = activity.numActiveSynapsesForSegment;\n    vector<Cell>winnerCells;\n\n    std::sort(numActiveSynapsesList.begin(), numActiveSynapsesList.end(),\n              std::greater<int>());\n\n    for (UInt j = 0; j < min(numCells, (UInt)numActiveSynapsesList.size()); j++)\n    {\n      winnerCells.push_back(connections.segmentForFlatIdx(j).cell);\n    }\n\n    return winnerCells;\n  }\n\n} \/\/ end namespace nupic\n\nint main(int argc, char *argv[])\n{\n  ConnectionsPerformanceTest test = ConnectionsPerformanceTest();\n  test.RunTests();\n}\n<commit_msg>Hitting new assert in an integration test<commit_after>\/* ---------------------------------------------------------------------\n * Numenta Platform for Intelligent Computing (NuPIC)\n * Copyright (C) 2015, 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 Affero 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 Affero Public License for more details.\n *\n * You should have received a copy of the GNU Affero 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 * Implementation of performance tests for Connections\n *\/\n\n#include <fstream>\n#include <iostream>\n#include <time.h>\n#include <stdlib.h>\n\n#include <nupic\/algorithms\/TemporalMemory.hpp>\n#include <nupic\/algorithms\/Connections.hpp>\n\n#include \"ConnectionsPerformanceTest.hpp\"\n\nusing namespace std;\nusing namespace nupic;\nusing namespace nupic::algorithms::temporal_memory;\nusing namespace nupic::algorithms::connections;\n\n#define SEED 42\n\nnamespace nupic\n{\n\n  void ConnectionsPerformanceTest::RunTests()\n  {\n    srand(SEED);\n\n    testTemporalMemoryUsage();\n    testLargeTemporalMemoryUsage();\n    testSpatialPoolerUsage();\n    testTemporalPoolerUsage();\n  }\n\n  \/**\n   * Tests typical usage of Connections with Temporal Memory.\n   *\/\n  void ConnectionsPerformanceTest::testTemporalMemoryUsage()\n  {\n    runTemporalMemoryTest(2048, 40, 5, 100, \"temporal memory\");\n  }\n\n  \/**\n   * Tests typical usage of Connections with a large Temporal Memory.\n   *\/\n  void ConnectionsPerformanceTest::testLargeTemporalMemoryUsage()\n  {\n    runTemporalMemoryTest(16384, 328, 3, 40, \"temporal memory (large)\");\n  }\n\n  \/**\n   * Tests typical usage of Connections with Spatial Pooler.\n   *\/\n  void ConnectionsPerformanceTest::testSpatialPoolerUsage()\n  {\n    runSpatialPoolerTest(2048, 2048, 40, 40, \"spatial pooler\");\n  }\n\n  \/**\n   * Tests typical usage of Connections with Temporal Pooler.\n   *\/\n  void ConnectionsPerformanceTest::testTemporalPoolerUsage()\n  {\n    runSpatialPoolerTest(2048, 16384, 40, 400, \"temporal pooler\");\n  }\n\n  void ConnectionsPerformanceTest::runTemporalMemoryTest(UInt numColumns,\n                                                         UInt w,\n                                                         int numSequences,\n                                                         int numElements,\n                                                         string label)\n  {\n    clock_t timer = clock();\n\n    \/\/ Initialize\n\n    TemporalMemory tm;\n    vector<UInt> columnDim;\n    columnDim.push_back(numColumns);\n    tm.initialize(columnDim);\n\n    checkpoint(timer, label + \": initialize\");\n\n    \/\/ Learn\n\n    vector< vector< vector<Cell> > >sequences;\n    vector< vector<Cell> >sequence;\n    vector<Cell> sdr;\n\n    for (int i = 0; i < numSequences; i++)\n    {\n      for (int j = 0; j < numElements; j++)\n      {\n        sdr = randomSDR(numColumns, w);\n        sequence.push_back(sdr);\n      }\n\n      sequences.push_back(sequence);\n    }\n\n    for (int i = 0; i < 5; i++)\n    {\n      for (auto sequence : sequences)\n      {\n        for (auto sdr : sequence)\n        {\n          feedTM(tm, sdr);\n          tm.reset();\n        }\n      }\n    }\n\n    checkpoint(timer, label + \": initialize + learn\");\n\n    \/\/ Test\n\n    for (auto sequence : sequences)\n    {\n      for (auto sdr : sequence)\n      {\n        feedTM(tm, sdr, false);\n        tm.reset();\n      }\n    }\n\n    checkpoint(timer, label + \": initialize + learn + test\");\n  }\n\n  void ConnectionsPerformanceTest::runSpatialPoolerTest(UInt numCells,\n                                                        UInt numInputs,\n                                                        UInt w,\n                                                        UInt numWinners,\n                                                        string label)\n  {\n    clock_t timer = clock();\n\n    Connections connections(numCells, 1, numInputs);\n    Cell cell;\n    Segment segment;\n    vector<Cell> sdr;\n    Activity activity;\n\n    \/\/ Initialize\n\n    for (UInt c = 0; c < numCells; c++)\n    {\n      cell = Cell(c);\n      segment = connections.createSegment(c);\n\n      for (UInt i = 0; i < numInputs; i++)\n      {\n        connections.createSynapse(segment, i, (Permanence)rand()\/RAND_MAX);\n      }\n    }\n\n    checkpoint(timer, label + \": initialize\");\n\n    \/\/ Learn\n\n    vector<Cell> winnerCells;\n    SynapseData synapseData;\n    Permanence permanence;\n\n    for (int i = 0; i < 500; i++)\n    {\n      sdr = randomSDR(numInputs, w);\n      activity = connections.computeActivity(sdr, 0.5, 0, 0.25, 0);\n      winnerCells = computeSPWinnerCells(connections, numWinners, activity);\n\n      for (Cell winnerCell : winnerCells)\n      {\n        segment = Segment(0, winnerCell);\n\n        for (Synapse synapse : connections.synapsesForSegment(segment))\n        {\n          synapseData = connections.dataForSynapse(synapse);\n          permanence = synapseData.permanence;\n\n          if (find(sdr.begin(), sdr.end(), synapseData.presynapticCell) !=\n              sdr.end())\n          {\n            permanence += 0.2;\n          }\n          else\n          {\n            permanence -= 0.1;\n          }\n\n          permanence = max(permanence, (Permanence)0);\n          permanence = min(permanence, (Permanence)1);\n\n          if (permanence == 0)\n          {\n            connections.destroySynapse(synapse);\n          }\n          else\n          {\n            connections.updateSynapsePermanence(synapse, permanence);\n          }\n        }\n      }\n    }\n\n    checkpoint(timer, label + \": initialize + learn\");\n\n    \/\/ Test\n\n    for (int i = 0; i < 500; i++)\n    {\n      sdr = randomSDR(numInputs, w);\n      activity = connections.computeActivity(sdr, 0.5, 0, 0.25, 0);\n      winnerCells = computeSPWinnerCells(connections, numWinners, activity);\n    }\n\n    checkpoint(timer, label + \": initialize + learn + test\");\n  }\n\n  void ConnectionsPerformanceTest::checkpoint(clock_t timer, string text)\n  {\n    float duration = (float)(clock() - timer) \/ CLOCKS_PER_SEC;\n    cout << duration << \" in \" << text << endl;\n  }\n\n  vector<Cell> ConnectionsPerformanceTest::randomSDR(UInt n, UInt w)\n  {\n    set<UInt> sdrSet = set<UInt>();\n    vector<Cell> sdr = vector<Cell>();\n\n    for (UInt i = 0; i < w; i++)\n    {\n      sdrSet.insert(rand() % (UInt)n);\n    }\n\n    for (UInt c : sdrSet)\n    {\n      sdr.push_back(Cell(c));\n    }\n\n    return sdr;\n  }\n\n  void ConnectionsPerformanceTest::feedTM(TemporalMemory &tm,\n                                          vector<Cell> sdr,\n                                          bool learn)\n  {\n    vector<UInt> activeColumns;\n\n    for (auto c : sdr)\n    {\n      activeColumns.push_back(c.idx);\n    }\n\n    tm.compute(activeColumns.size(), activeColumns.data(), learn);\n  }\n\n  vector<Cell> ConnectionsPerformanceTest::computeSPWinnerCells(\n    Connections& connections, UInt numCells, Activity& activity)\n  {\n    vector<UInt32> numActiveSynapsesList = activity.numActiveSynapsesForSegment;\n    vector<Cell>winnerCells;\n\n    std::sort(numActiveSynapsesList.begin(), numActiveSynapsesList.end(),\n              std::greater<int>());\n\n    for (UInt j = 0; j < min(numCells, (UInt)numActiveSynapsesList.size()); j++)\n    {\n      winnerCells.push_back(connections.segmentForFlatIdx(j).cell);\n    }\n\n    return winnerCells;\n  }\n\n} \/\/ end namespace nupic\n\nint main(int argc, char *argv[])\n{\n  ConnectionsPerformanceTest test = ConnectionsPerformanceTest();\n  test.RunTests();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: dbcharset.cxx,v $\n *\n *  $Revision: 1.11 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 02:02: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_connectivity.hxx\"\n\n#ifndef _DBHELPER_DBCHARSET_HXX_\n#include <connectivity\/dbcharset.hxx>\n#endif\n#ifndef CONNECTIVITY_DIAGNOSE_EX_H\n#include \"diagnose_ex.h\"\n#endif\n\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n\n#ifndef _RTL_TENCINFO_H\n#include <rtl\/tencinfo.h>\n#endif\n\n\/\/.........................................................................\nnamespace dbtools\n{\n\/\/.........................................................................\n\n    \/\/=========================================================================\n    \/\/= OCharsetMap\n    \/\/=========================================================================\n    \/\/-------------------------------------------------------------------------\n    OCharsetMap::OCharsetMap()\n    {\n    }\n\n    \/\/-------------------------------------------------------------------------\n    void OCharsetMap::lateConstruct()\n    {\n        const rtl_TextEncoding eFirstEncoding = RTL_TEXTENCODING_DONTKNOW;\n        const rtl_TextEncoding eLastEncoding = 100;     \/\/ TODO: a define in rtl\/textenc.h would be fine here ...\n        OSL_ENSURE( 0 == eFirstEncoding, \"OCharsetMap::OCharsetMap: somebody changed the numbers!\" );\n\n        rtl_TextEncodingInfo aInfo; aInfo.StructSize = sizeof( rtl_TextEncodingInfo );\n        for ( rtl_TextEncoding eEncoding = eFirstEncoding; eEncoding < eLastEncoding; ++eEncoding )\n        {\n            if  (   ( RTL_TEXTENCODING_DONTKNOW == eEncoding )  \/\/ this is always allowed - it has the special meaning \"system encoding\"\n                ||  (   rtl_getTextEncodingInfo( eEncoding, &aInfo )\n                    &&  approveEncoding( eEncoding, aInfo )\n                    )\n                )\n            {\n                m_aEncodings.insert( eEncoding );\n            }\n        }\n\n        OSL_ENSURE( find( RTL_TEXTENCODING_MS_1252 ) != end(), \"OCharsetMap::lateConstruct: missing compatibility encoding ANSI!\" );\n        OSL_ENSURE( find( RTL_TEXTENCODING_APPLE_ROMAN ) != end(), \"OCharsetMap::lateConstruct: missing compatibility encoding macintosh!\" );\n        OSL_ENSURE( find( RTL_TEXTENCODING_IBM_437 ) != end(), \"OCharsetMap::lateConstruct: missing compatibility encoding IBM437!\" );\n        OSL_ENSURE( find( RTL_TEXTENCODING_IBM_850) != end(), \"OCharsetMap::lateConstruct: missing compatibility encoding IBM850!\" );\n        OSL_ENSURE( find( RTL_TEXTENCODING_IBM_860 ) != end(), \"OCharsetMap::lateConstruct: missing compatibility encoding IBM860!\" );\n        OSL_ENSURE( find( RTL_TEXTENCODING_IBM_861 ) != end(), \"OCharsetMap::lateConstruct: missing compatibility encoding IBM861!\" );\n        OSL_ENSURE( find( RTL_TEXTENCODING_IBM_863 ) != end(), \"OCharsetMap::lateConstruct: missing compatibility encoding IBM863!\" );\n        OSL_ENSURE( find( RTL_TEXTENCODING_IBM_865 ) != end(), \"OCharsetMap::lateConstruct: missing compatibility encoding IBM865!\" );\n        OSL_ENSURE( find( RTL_TEXTENCODING_IBM_866 ) != end(), \"OCharsetMap::lateConstruct: missing compatibility encoding IBM866!\" );\n        OSL_ENSURE( find( RTL_TEXTENCODING_DONTKNOW ) != end(), \"OCharsetMap::lateConstruct: missing compatibility encoding SYSTEM!\" );\n        OSL_ENSURE( find( RTL_TEXTENCODING_UTF8 ) != end(), \"OCharsetMap::lateConstruct: missing compatibility encoding UTF-8!\" );\n        OSL_ENSURE( find( RTL_TEXTENCODING_BIG5_HKSCS ) != end(), \"OCharsetMap::lateConstruct: missing compatibility encoding Big5-HKSCS!\" );\n    }\n\n    \/\/-------------------------------------------------------------------------\n    sal_Bool OCharsetMap::approveEncoding( const rtl_TextEncoding _eEncoding, const rtl_TextEncodingInfo& _rInfo ) const\n    {\n        sal_Bool bIsMimeEncoding = 0 != ( _rInfo.Flags & RTL_TEXTENCODING_INFO_MIME );\n        OSL_ENSURE( !bIsMimeEncoding || rtl_getMimeCharsetFromTextEncoding( _eEncoding ),\n                \"OCharsetMap::OCharsetMap: inconsistence in rtl!\" );\n        OSL_UNUSED( _eEncoding );\n        return bIsMimeEncoding;\n    }\n\n    \/\/-------------------------------------------------------------------------\n    OCharsetMap::~OCharsetMap()\n    {\n    }\n\n    \/\/-------------------------------------------------------------------------\n    OCharsetMap::CharsetIterator OCharsetMap::begin() const\n    {\n        ensureConstructed( );\n        return CharsetIterator(this, m_aEncodings.begin() );\n    }\n\n    \/\/-------------------------------------------------------------------------\n    OCharsetMap::CharsetIterator    OCharsetMap::find(const rtl_TextEncoding _eEncoding) const\n    {\n        ensureConstructed( );\n        return CharsetIterator( this, m_aEncodings.find( _eEncoding ) );\n    }\n\n    \/\/-------------------------------------------------------------------------\n    OCharsetMap::CharsetIterator    OCharsetMap::find(const ::rtl::OUString& _rIanaName, const IANA&) const\n    {\n        ensureConstructed( );\n\n        rtl_TextEncoding eEncoding = RTL_TEXTENCODING_DONTKNOW;\n        if ( _rIanaName.getLength() )\n        {\n            \/\/ byte string conversion\n            ::rtl::OString sMimeByteString( _rIanaName.getStr(), _rIanaName.getLength(), RTL_TEXTENCODING_ASCII_US );\n            \/\/ look up\n            eEncoding = rtl_getTextEncodingFromMimeCharset( sMimeByteString.getStr() );\n\n            if ( RTL_TEXTENCODING_DONTKNOW == eEncoding )\n            {   \/\/ if we're here, the name is not empty, but unknown -> this is an invalid name\n                return end();\n            }\n        }\n\n        return find( eEncoding );\n    }\n\n    \/\/-------------------------------------------------------------------------\n    OCharsetMap::CharsetIterator OCharsetMap::end() const\n    {\n        ensureConstructed( );\n\n        return CharsetIterator( this, m_aEncodings.end() );\n    }\n\n    \/\/=========================================================================\n    \/\/= CharsetIteratorDerefHelper\n    \/\/=========================================================================\n    \/\/-------------------------------------------------------------------------\n    CharsetIteratorDerefHelper::CharsetIteratorDerefHelper( const CharsetIteratorDerefHelper& _rSource )\n        :m_eEncoding( _rSource.m_eEncoding )\n        ,m_aIanaName( _rSource.m_aIanaName )\n    {\n    }\n\n    \/\/-------------------------------------------------------------------------\n    CharsetIteratorDerefHelper:: CharsetIteratorDerefHelper(const rtl_TextEncoding _eEncoding, const ::rtl::OUString& _rIanaName )\n        :m_eEncoding( _eEncoding )\n        ,m_aIanaName( _rIanaName )\n    {\n    }\n\n    \/\/-------------------------------------------------------------------------\n    CharsetIteratorDerefHelper::CharsetIteratorDerefHelper()\n        :m_eEncoding(RTL_TEXTENCODING_DONTKNOW)\n    {\n    }\n\n    \/\/=========================================================================\n    \/\/= OCharsetMap::CharsetIterator\n    \/\/=========================================================================\n    \/\/-------------------------------------------------------------------------\n    OCharsetMap::CharsetIterator::CharsetIterator(const OCharsetMap* _pContainer, OCharsetMap::TextEncBag::const_iterator _aPos )\n        :m_pContainer( _pContainer )\n        ,m_aPos( _aPos )\n    {\n        OSL_ENSURE( m_pContainer, \"OCharsetMap::CharsetIterator::CharsetIterator : invalid container!\" );\n    }\n\n    \/\/-------------------------------------------------------------------------\n    OCharsetMap::CharsetIterator::CharsetIterator(const CharsetIterator& _rSource)\n        :m_pContainer( _rSource.m_pContainer )\n        ,m_aPos( _rSource.m_aPos )\n    {\n    }\n\n    \/\/-------------------------------------------------------------------------\n    OCharsetMap::CharsetIterator::~CharsetIterator()\n    {\n    }\n\n    \/\/-------------------------------------------------------------------------\n    CharsetIteratorDerefHelper OCharsetMap::CharsetIterator::operator*() const\n    {\n        OSL_ENSURE( m_aPos != m_pContainer->m_aEncodings.end(), \"OCharsetMap::CharsetIterator::operator*: invalid position!\");\n\n        rtl_TextEncoding eEncoding = *m_aPos;\n        ::rtl::OUString sIanaName;\n\n        if ( RTL_TEXTENCODING_DONTKNOW != eEncoding )\n        {   \/\/ it's not the virtual \"system charset\"\n            const char* pIanaName = rtl_getMimeCharsetFromTextEncoding( eEncoding );\n            OSL_ENSURE( pIanaName, \"OCharsetMap::CharsetIterator: invalid mime name!\" );\n            if ( pIanaName )\n                sIanaName = ::rtl::OUString::createFromAscii( pIanaName );\n        }\n        return CharsetIteratorDerefHelper( eEncoding, sIanaName );\n    }\n\n    \/\/-------------------------------------------------------------------------\n    const OCharsetMap::CharsetIterator& OCharsetMap::CharsetIterator::operator++()\n    {\n        OSL_ENSURE( m_aPos != m_pContainer->m_aEncodings.end(), \"OCharsetMap::CharsetIterator::operator++ : invalid position!\" );\n        if ( m_aPos != m_pContainer->m_aEncodings.end())\n            ++m_aPos;\n        return *this;\n    }\n\n    \/\/-------------------------------------------------------------------------\n    const OCharsetMap::CharsetIterator& OCharsetMap::CharsetIterator::operator--()\n    {\n        OSL_ENSURE( m_aPos != m_pContainer->m_aEncodings.begin(), \"OCharsetMap::CharsetIterator::operator-- : invalid position!\" );\n        if ( m_aPos != m_pContainer->m_aEncodings.begin() )\n            --m_aPos;\n        return *this;\n    }\n\n    \/\/-------------------------------------------------------------------------\n    bool operator==(const OCharsetMap::CharsetIterator& lhs, const OCharsetMap::CharsetIterator& rhs)\n    {\n        return ( lhs.m_pContainer == rhs.m_pContainer ) && ( lhs.m_aPos == rhs.m_aPos );\n    }\n\n\/\/.........................................................................\n}   \/\/ namespace dbtools\n\/\/.........................................................................\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.11.216); FILE MERGED 2008\/04\/01 15:08:31 thb 1.11.216.3: #i85898# Stripping all external header guards 2008\/04\/01 10:52:44 thb 1.11.216.2: #i85898# Stripping all external header guards 2008\/03\/28 15:23:21 rt 1.11.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: dbcharset.cxx,v $\n * $Revision: 1.12 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org.  If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_connectivity.hxx\"\n#include <connectivity\/dbcharset.hxx>\n#include \"diagnose_ex.h\"\n#include <osl\/diagnose.h>\n#include <rtl\/tencinfo.h>\n\n\/\/.........................................................................\nnamespace dbtools\n{\n\/\/.........................................................................\n\n    \/\/=========================================================================\n    \/\/= OCharsetMap\n    \/\/=========================================================================\n    \/\/-------------------------------------------------------------------------\n    OCharsetMap::OCharsetMap()\n    {\n    }\n\n    \/\/-------------------------------------------------------------------------\n    void OCharsetMap::lateConstruct()\n    {\n        const rtl_TextEncoding eFirstEncoding = RTL_TEXTENCODING_DONTKNOW;\n        const rtl_TextEncoding eLastEncoding = 100;     \/\/ TODO: a define in rtl\/textenc.h would be fine here ...\n        OSL_ENSURE( 0 == eFirstEncoding, \"OCharsetMap::OCharsetMap: somebody changed the numbers!\" );\n\n        rtl_TextEncodingInfo aInfo; aInfo.StructSize = sizeof( rtl_TextEncodingInfo );\n        for ( rtl_TextEncoding eEncoding = eFirstEncoding; eEncoding < eLastEncoding; ++eEncoding )\n        {\n            if  (   ( RTL_TEXTENCODING_DONTKNOW == eEncoding )  \/\/ this is always allowed - it has the special meaning \"system encoding\"\n                ||  (   rtl_getTextEncodingInfo( eEncoding, &aInfo )\n                    &&  approveEncoding( eEncoding, aInfo )\n                    )\n                )\n            {\n                m_aEncodings.insert( eEncoding );\n            }\n        }\n\n        OSL_ENSURE( find( RTL_TEXTENCODING_MS_1252 ) != end(), \"OCharsetMap::lateConstruct: missing compatibility encoding ANSI!\" );\n        OSL_ENSURE( find( RTL_TEXTENCODING_APPLE_ROMAN ) != end(), \"OCharsetMap::lateConstruct: missing compatibility encoding macintosh!\" );\n        OSL_ENSURE( find( RTL_TEXTENCODING_IBM_437 ) != end(), \"OCharsetMap::lateConstruct: missing compatibility encoding IBM437!\" );\n        OSL_ENSURE( find( RTL_TEXTENCODING_IBM_850) != end(), \"OCharsetMap::lateConstruct: missing compatibility encoding IBM850!\" );\n        OSL_ENSURE( find( RTL_TEXTENCODING_IBM_860 ) != end(), \"OCharsetMap::lateConstruct: missing compatibility encoding IBM860!\" );\n        OSL_ENSURE( find( RTL_TEXTENCODING_IBM_861 ) != end(), \"OCharsetMap::lateConstruct: missing compatibility encoding IBM861!\" );\n        OSL_ENSURE( find( RTL_TEXTENCODING_IBM_863 ) != end(), \"OCharsetMap::lateConstruct: missing compatibility encoding IBM863!\" );\n        OSL_ENSURE( find( RTL_TEXTENCODING_IBM_865 ) != end(), \"OCharsetMap::lateConstruct: missing compatibility encoding IBM865!\" );\n        OSL_ENSURE( find( RTL_TEXTENCODING_IBM_866 ) != end(), \"OCharsetMap::lateConstruct: missing compatibility encoding IBM866!\" );\n        OSL_ENSURE( find( RTL_TEXTENCODING_DONTKNOW ) != end(), \"OCharsetMap::lateConstruct: missing compatibility encoding SYSTEM!\" );\n        OSL_ENSURE( find( RTL_TEXTENCODING_UTF8 ) != end(), \"OCharsetMap::lateConstruct: missing compatibility encoding UTF-8!\" );\n        OSL_ENSURE( find( RTL_TEXTENCODING_BIG5_HKSCS ) != end(), \"OCharsetMap::lateConstruct: missing compatibility encoding Big5-HKSCS!\" );\n    }\n\n    \/\/-------------------------------------------------------------------------\n    sal_Bool OCharsetMap::approveEncoding( const rtl_TextEncoding _eEncoding, const rtl_TextEncodingInfo& _rInfo ) const\n    {\n        sal_Bool bIsMimeEncoding = 0 != ( _rInfo.Flags & RTL_TEXTENCODING_INFO_MIME );\n        OSL_ENSURE( !bIsMimeEncoding || rtl_getMimeCharsetFromTextEncoding( _eEncoding ),\n                \"OCharsetMap::OCharsetMap: inconsistence in rtl!\" );\n        OSL_UNUSED( _eEncoding );\n        return bIsMimeEncoding;\n    }\n\n    \/\/-------------------------------------------------------------------------\n    OCharsetMap::~OCharsetMap()\n    {\n    }\n\n    \/\/-------------------------------------------------------------------------\n    OCharsetMap::CharsetIterator OCharsetMap::begin() const\n    {\n        ensureConstructed( );\n        return CharsetIterator(this, m_aEncodings.begin() );\n    }\n\n    \/\/-------------------------------------------------------------------------\n    OCharsetMap::CharsetIterator    OCharsetMap::find(const rtl_TextEncoding _eEncoding) const\n    {\n        ensureConstructed( );\n        return CharsetIterator( this, m_aEncodings.find( _eEncoding ) );\n    }\n\n    \/\/-------------------------------------------------------------------------\n    OCharsetMap::CharsetIterator    OCharsetMap::find(const ::rtl::OUString& _rIanaName, const IANA&) const\n    {\n        ensureConstructed( );\n\n        rtl_TextEncoding eEncoding = RTL_TEXTENCODING_DONTKNOW;\n        if ( _rIanaName.getLength() )\n        {\n            \/\/ byte string conversion\n            ::rtl::OString sMimeByteString( _rIanaName.getStr(), _rIanaName.getLength(), RTL_TEXTENCODING_ASCII_US );\n            \/\/ look up\n            eEncoding = rtl_getTextEncodingFromMimeCharset( sMimeByteString.getStr() );\n\n            if ( RTL_TEXTENCODING_DONTKNOW == eEncoding )\n            {   \/\/ if we're here, the name is not empty, but unknown -> this is an invalid name\n                return end();\n            }\n        }\n\n        return find( eEncoding );\n    }\n\n    \/\/-------------------------------------------------------------------------\n    OCharsetMap::CharsetIterator OCharsetMap::end() const\n    {\n        ensureConstructed( );\n\n        return CharsetIterator( this, m_aEncodings.end() );\n    }\n\n    \/\/=========================================================================\n    \/\/= CharsetIteratorDerefHelper\n    \/\/=========================================================================\n    \/\/-------------------------------------------------------------------------\n    CharsetIteratorDerefHelper::CharsetIteratorDerefHelper( const CharsetIteratorDerefHelper& _rSource )\n        :m_eEncoding( _rSource.m_eEncoding )\n        ,m_aIanaName( _rSource.m_aIanaName )\n    {\n    }\n\n    \/\/-------------------------------------------------------------------------\n    CharsetIteratorDerefHelper:: CharsetIteratorDerefHelper(const rtl_TextEncoding _eEncoding, const ::rtl::OUString& _rIanaName )\n        :m_eEncoding( _eEncoding )\n        ,m_aIanaName( _rIanaName )\n    {\n    }\n\n    \/\/-------------------------------------------------------------------------\n    CharsetIteratorDerefHelper::CharsetIteratorDerefHelper()\n        :m_eEncoding(RTL_TEXTENCODING_DONTKNOW)\n    {\n    }\n\n    \/\/=========================================================================\n    \/\/= OCharsetMap::CharsetIterator\n    \/\/=========================================================================\n    \/\/-------------------------------------------------------------------------\n    OCharsetMap::CharsetIterator::CharsetIterator(const OCharsetMap* _pContainer, OCharsetMap::TextEncBag::const_iterator _aPos )\n        :m_pContainer( _pContainer )\n        ,m_aPos( _aPos )\n    {\n        OSL_ENSURE( m_pContainer, \"OCharsetMap::CharsetIterator::CharsetIterator : invalid container!\" );\n    }\n\n    \/\/-------------------------------------------------------------------------\n    OCharsetMap::CharsetIterator::CharsetIterator(const CharsetIterator& _rSource)\n        :m_pContainer( _rSource.m_pContainer )\n        ,m_aPos( _rSource.m_aPos )\n    {\n    }\n\n    \/\/-------------------------------------------------------------------------\n    OCharsetMap::CharsetIterator::~CharsetIterator()\n    {\n    }\n\n    \/\/-------------------------------------------------------------------------\n    CharsetIteratorDerefHelper OCharsetMap::CharsetIterator::operator*() const\n    {\n        OSL_ENSURE( m_aPos != m_pContainer->m_aEncodings.end(), \"OCharsetMap::CharsetIterator::operator*: invalid position!\");\n\n        rtl_TextEncoding eEncoding = *m_aPos;\n        ::rtl::OUString sIanaName;\n\n        if ( RTL_TEXTENCODING_DONTKNOW != eEncoding )\n        {   \/\/ it's not the virtual \"system charset\"\n            const char* pIanaName = rtl_getMimeCharsetFromTextEncoding( eEncoding );\n            OSL_ENSURE( pIanaName, \"OCharsetMap::CharsetIterator: invalid mime name!\" );\n            if ( pIanaName )\n                sIanaName = ::rtl::OUString::createFromAscii( pIanaName );\n        }\n        return CharsetIteratorDerefHelper( eEncoding, sIanaName );\n    }\n\n    \/\/-------------------------------------------------------------------------\n    const OCharsetMap::CharsetIterator& OCharsetMap::CharsetIterator::operator++()\n    {\n        OSL_ENSURE( m_aPos != m_pContainer->m_aEncodings.end(), \"OCharsetMap::CharsetIterator::operator++ : invalid position!\" );\n        if ( m_aPos != m_pContainer->m_aEncodings.end())\n            ++m_aPos;\n        return *this;\n    }\n\n    \/\/-------------------------------------------------------------------------\n    const OCharsetMap::CharsetIterator& OCharsetMap::CharsetIterator::operator--()\n    {\n        OSL_ENSURE( m_aPos != m_pContainer->m_aEncodings.begin(), \"OCharsetMap::CharsetIterator::operator-- : invalid position!\" );\n        if ( m_aPos != m_pContainer->m_aEncodings.begin() )\n            --m_aPos;\n        return *this;\n    }\n\n    \/\/-------------------------------------------------------------------------\n    bool operator==(const OCharsetMap::CharsetIterator& lhs, const OCharsetMap::CharsetIterator& rhs)\n    {\n        return ( lhs.m_pContainer == rhs.m_pContainer ) && ( lhs.m_aPos == rhs.m_aPos );\n    }\n\n\/\/.........................................................................\n}   \/\/ namespace dbtools\n\/\/.........................................................................\n\n<|endoftext|>"}
{"text":"<commit_before>\/**\n@file EndianUtils.hpp\n@brief Endian utilities.\n\n@author Tim Howard\n@copyright 2010-2013 Tim Howard under the MIT license;\nsee @ref index or the accompanying LICENSE file for full text.\n*\/\n\n#ifndef DUCT_ENDIANUTILS_HPP_\n#define DUCT_ENDIANUTILS_HPP_\n\n#include \".\/config.hpp\"\n\n#include <cstddef>\n#include <type_traits>\n#include <algorithm>\n\nnamespace duct {\n\n\/\/ Forward declarations\nenum class Endian : unsigned;\n\n\/**\n\t@addtogroup endian_utils\n\t@{\n*\/\n\n\/**\n\tEndian types.\n*\/\nenum class Endian : unsigned {\n\t\/** System's endian. *\/\n\tSYSTEM=DUCT_BYTEORDER,\n\t\/** Little endian. *\/\n\tLITTLE=DUCT_ENDIAN_LITTLE,\n\t\/** Big endian. *\/\n\tBIG=DUCT_ENDIAN_BIG\n};\n\n\/** @cond INTERNAL *\/\nnamespace {\n\t\/\/ Can't do partial template function specialization (grumble grumble);\n\t\/\/ using a struct instead for the sneaky magics\n\ttemplate<typename T, std::size_t size_=sizeof(T)>\n\tstruct bs_impl;\n\n\t\/\/ Convenience\n\ttemplate<typename T>\n\tstruct bs_impl<T, 1> {\n\t\tstatic constexpr T swap(T value) {\n\t\t\treturn value;\n\t\t}\n\t};\n\n\t\/\/ Specialize for floating-point types\n\ttemplate<>\n\tstruct bs_impl<float> {\n\t\tstatic float swap(float value) {\n\t\t\tchar& b=reinterpret_cast<char&>(value);\n\t\t\tstd::reverse(&b, &b+sizeof(float));\n\t\t\treturn value;\n\t\t}\n\t};\n\n\t\/\/ *long* double, you say? Never heard of such an arcane thing!\n\ttemplate<>\n\tstruct bs_impl<double> {\n\t\tstatic double swap(double value) {\n\t\t\tchar& b=reinterpret_cast<char&>(value);\n\t\t\tstd::reverse(&b, &b+sizeof(double));\n\t\t\treturn value;\n\t\t}\n\t};\n\n\t\/\/ NB: Cannot constexpr these; bswap macros can potentially use assembly code\n\ttemplate<typename T>\n\tstruct bs_impl<T, 2> {\n\t\tstatic T swap(T value) {\n\t\t\treturn static_cast<T>(bswap_16(reinterpret_cast<uint16_t&>(value)));\n\t\t}\n\t};\n\n\ttemplate<typename T>\n\tstruct bs_impl<T, 4> {\n\t\tstatic T swap(T value) {\n\t\t\treturn static_cast<T>(bswap_32(reinterpret_cast<uint32_t&>(value)));\n\t\t}\n\t};\n\n\ttemplate<typename T>\n\tstruct bs_impl<T, 8> {\n\t\tstatic T swap(T value) {\n\t\t\treturn static_cast<T>(bswap_64(reinterpret_cast<uint64_t&>(value)));\n\t\t}\n\t};\n} \/\/ anonymous namespace\n\/** @endcond *\/ \/\/ INTERNAL\n\n\/**\n\tReverse the bytes in an arithmetic value.\n\t@returns The byte-swapped value.\n\t@tparam T Arithmetic value type; inferred from @a value.\n\t@param value Value to swap.\n*\/\ntemplate<typename T>\ninline constexpr T byte_swap(T value) {\n\tstatic_assert(std::is_arithmetic<T>::value, \"T must be arithmetic\");\n\treturn bs_impl<T, sizeof(T)>::swap(value);\n}\n\n\/**\n\tReverse the bytes in an arithmetic value (by-ref).\n\t@tparam T Arithmetic value type; inferred from @a value.\n\t@param[in,out] value Value to swap; output value.\n*\/\ntemplate<typename T>\ninline void byte_swap_ref(T& value) {\n\tvalue=byte_swap<T>(value);\n}\n\n\/**\n\tReverse the bytes in an arithmetic value if the desired endian is different\n\tfrom the system endian.\n\t@returns The byte-swapped value.\n\t@tparam T Arithmetic value type; inferred from @a value.\n\t@param value Value to swap.\n\t@param endian Desired endian.\n*\/\ntemplate<typename T>\ninline constexpr T byte_swap_if(T value, duct::Endian const endian) {\n\treturn (Endian::SYSTEM!=endian) ? byte_swap<T>(value) : value;\n}\n\n\/**\n\tReverse the bytes in an arithmetic value (by-ref) if the desired endian is\n\tdifferent from the system endian.\n\t@tparam T Arithmetic value type; inferred from @a value.\n\t@param[in,out] value Value to swap; output value.\n\t@param endian Desired endian.\n*\/\ntemplate<typename T>\ninline void byte_swap_ref_if(T& value, duct::Endian const endian) {\n\tif (Endian::SYSTEM!=endian) {\n\t\tbyte_swap_ref<T>(value);\n\t}\n}\n\n\/** @} *\/ \/\/ end of doc-group endian_utils\n\n} \/\/ namespace duct\n\n#endif \/\/ DUCT_ENDIANUTILS_HPP_\n<commit_msg>EndianUtils: made base byte_swap funcs non-constexpr; general tidy.<commit_after>\/**\n@file EndianUtils.hpp\n@brief Endian utilities.\n\n@author Tim Howard\n@copyright 2010-2013 Tim Howard under the MIT license;\nsee @ref index or the accompanying LICENSE file for full text.\n*\/\n\n#ifndef DUCT_ENDIANUTILS_HPP_\n#define DUCT_ENDIANUTILS_HPP_\n\n#include \".\/config.hpp\"\n\n#include <cstddef>\n#include <type_traits>\n#include <algorithm>\n\nnamespace duct {\n\n\/\/ Forward declarations\nenum class Endian : unsigned;\n\n\/**\n\t@addtogroup endian_utils\n\t@{\n*\/\n\n\/**\n\tEndian types.\n*\/\nenum class Endian : unsigned {\n\t\/** System's endian. *\/\n\tSYSTEM=DUCT_BYTEORDER,\n\t\/** Little endian. *\/\n\tLITTLE=DUCT_ENDIAN_LITTLE,\n\t\/** Big endian. *\/\n\tBIG=DUCT_ENDIAN_BIG\n};\n\n\/** @cond INTERNAL *\/\nnamespace {\n\t\/\/ Can't do partial template function specialization (grumble grumble);\n\t\/\/ using a struct instead for the sneaky magics\n\ttemplate<typename T, std::size_t size_=sizeof(T)>\n\tstruct bs_impl;\n\n\t\/\/ Convenience\n\ttemplate<typename T>\n\tstruct bs_impl<T, 1> {\n\t\tstatic constexpr T swap(T value) {\n\t\t\treturn value;\n\t\t}\n\t};\n\n\t\/\/ Specialize for floating-point types\n\ttemplate<>\n\tstruct bs_impl<float> {\n\t\tstatic float swap(float value) {\n\t\t\tchar& b=reinterpret_cast<char&>(value);\n\t\t\tstd::reverse(&b, &b+sizeof(float));\n\t\t\treturn value;\n\t\t}\n\t};\n\n\t\/\/ *long* double, you say? Never heard of such an arcane thing!\n\ttemplate<>\n\tstruct bs_impl<double> {\n\t\tstatic double swap(double value) {\n\t\t\tchar& b=reinterpret_cast<char&>(value);\n\t\t\tstd::reverse(&b, &b+sizeof(double));\n\t\t\treturn value;\n\t\t}\n\t};\n\n\t\/\/ NB: These cannot be constexpr; the bswap macros can potentially\n\t\/\/ use asm instructions\n\ttemplate<typename T>\n\tstruct bs_impl<T, 2> {\n\t\tstatic T swap(T value) {\n\t\t\treturn static_cast<T>(\n\t\t\t\tbswap_16(reinterpret_cast<uint16_t&>(value)));\n\t\t}\n\t};\n\n\ttemplate<typename T>\n\tstruct bs_impl<T, 4> {\n\t\tstatic T swap(T value) {\n\t\t\treturn static_cast<T>(\n\t\t\t\tbswap_32(reinterpret_cast<uint32_t&>(value)));\n\t\t}\n\t};\n\n\ttemplate<typename T>\n\tstruct bs_impl<T, 8> {\n\t\tstatic T swap(T value) {\n\t\t\treturn static_cast<T>(\n\t\t\t\tbswap_64(reinterpret_cast<uint64_t&>(value)));\n\t\t}\n\t};\n} \/\/ anonymous namespace\n\/** @endcond *\/ \/\/ INTERNAL\n\n\/**\n\tReverse the bytes in an arithmetic value.\n\t@returns The byte-swapped value.\n\t@tparam T Arithmetic value type; inferred from @a value.\n\t@param value Value to swap.\n*\/\ntemplate<typename T>\ninline T byte_swap(T value) {\n\tstatic_assert(std::is_arithmetic<T>::value, \"T must be arithmetic\");\n\treturn bs_impl<T, sizeof(T)>::swap(value);\n}\n\n\/**\n\tReverse the bytes in an arithmetic value (by-ref).\n\t@tparam T Arithmetic value type; inferred from @a value.\n\t@param[in,out] value Value to swap; output value.\n*\/\ntemplate<typename T>\ninline void byte_swap_ref(T& value) {\n\tvalue=byte_swap<T>(value);\n}\n\n\/**\n\tReverse the bytes in an arithmetic value if the desired\n\tendian is different from the system endian.\n\t@returns The byte-swapped value.\n\t@tparam T Arithmetic value type; inferred from @a value.\n\t@param value Value to swap.\n\t@param endian Desired endian.\n*\/\ntemplate<typename T>\ninline T byte_swap_if(T value, duct::Endian const endian) {\n\treturn (Endian::SYSTEM!=endian)\n\t\t? byte_swap<T>(value)\n\t\t: value;\n}\n\n\/**\n\tReverse the bytes in an arithmetic value (by-ref) if the\n\tdesired endian is different from the system endian.\n\t@tparam T Arithmetic value type; inferred from @a value.\n\t@param[in,out] value Value to swap; output value.\n\t@param endian Desired endian.\n*\/\ntemplate<typename T>\ninline void byte_swap_ref_if(T& value, duct::Endian const endian) {\n\tif (Endian::SYSTEM!=endian) {\n\t\tbyte_swap_ref<T>(value);\n\t}\n}\n\n\/** @} *\/ \/\/ end of doc-group endian_utils\n\n} \/\/ namespace duct\n\n#endif \/\/ DUCT_ENDIANUTILS_HPP_\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"font.h\"\n\n#include \"glyph.h\"\n#include <draw\/extents.h>\n\n#include <ft2build.h>\n#include FT_FREETYPE_H\n#include FT_STROKER_H\n#include FT_LCD_FILTER_H\n#include FT_GLYPH_H\n\nnamespace {\n\n#undef __FTERRORS_H__\n#define FT_ERRORDEF( e, v, s )  { e, s },\n#define FT_ERROR_START_LIST     {\n#define FT_ERROR_END_LIST       { 0, 0 } };\nconst struct {\n    int          code;\n    const char*  message;\n} FT_Errors[] =\n#include FT_ERRORS_H\n\n}\n\nnamespace fc {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nfont::font( FT_Face face, std::string fam, std::string style, double pixsize )\n\t\t: draw::font( std::move( fam ), std::move( style ), pixsize ),\n\t\t  _face( face )\n{\n\tauto err = FT_Select_Charmap( _face, FT_ENCODING_UNICODE );\n\tif ( err )\n\t{\n\t\tstd::cerr << \"ERROR selecting UNICODE charmap: [\" << FT_Errors[err].code << \"] \" << FT_Errors[err].message << std::endl;\n\t\tif ( _face->charmaps )\n\t\t{\n\t\t\terr = FT_Set_Charmap( _face, _face->charmaps[0] );\n\t\t\tif ( err )\n\t\t\t\tthrow std::runtime_error( errorstr( err ) );\n\t\t}\n\t\telse\n\t\t\tthrow std::runtime_error( \"Unable to select any character map\" );\n\t}\n\n\tstd::cout << \"Need to add global DPI accessor somehow (multiple screens?)\" << std::endl;\n\tstatic const int theDPI = 95;\n\n\tif ( FT_IS_SCALABLE( _face ) )\n\t{\n\t\terr = FT_Set_Char_Size( _face, static_cast<int>( pixsize * 64.0 ), 0,\n\t\t\t\t\t\t\t\ttheDPI, theDPI );\n\t\tif ( err )\n\t\t\tthrow std::runtime_error( \"Unable to set character size\" );\n\t}\n\telse if ( _face->num_fixed_sizes > 1 )\n\t{\n\t\tint targsize = static_cast<int>( pixsize );\n\t\tint bestSize[2];\n\t\tbestSize[0] = bestSize[1] = targsize;\n\t\tint i;\n\t\tfor ( i = 0; i != _face->num_fixed_sizes; ++i )\n\t\t{\n\t\t\tif ( _face->available_sizes[i].width == targsize )\n\t\t\t{\n\t\t\t\tbestSize[1] = _face->available_sizes[i].height;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if ( _face->available_sizes[i].width > targsize &&\n\t\t\t\t\t  bestSize[0] > _face->available_sizes[i].width )\n\t\t\t{\n\t\t\t\tbestSize[0] = _face->available_sizes[i].width;\n\t\t\t\tbestSize[1] = _face->available_sizes[i].height;\n\t\t\t}\n\t\t}\n\n\t\tif ( i == _face->num_fixed_sizes )\n\t\t\t_size = bestSize[0];\n\n\t\t\/\/ otherwise we have to use FT_Set_Pixel_Sizes\n\t\terr = FT_Set_Pixel_Sizes( _face, bestSize[0], bestSize[1] );\n\t\tif ( err )\n\t\t\tthrow std::runtime_error( \"Unable to set fixed character size\" );\n\t}\n\n\t_extents.ascent = static_cast<double>( _face->size->metrics.ascender ) \/ 64.0;\n\t_extents.descent = static_cast<double>( _face->size->metrics.descender ) \/ 64.0;\n\n\tif ( FT_IS_SCALABLE( _face ) )\n\t{\n\t\tdouble scaleX = ( static_cast<double>( _face->size->metrics.x_ppem ) \/\n\t\t\t\t\t\t  static_cast<double>( _face->units_per_EM ) );\n\t\tdouble scaleY = ( static_cast<double>( _face->size->metrics.y_ppem ) \/\n\t\t\t\t\t\t  static_cast<double>( _face->units_per_EM ) );\n\t\t_extents.width = ( static_cast<double>( _face->bbox.xMax - _face->bbox.xMin ) * scaleX );\n\t\t_extents.height = ( static_cast<double>( _face->bbox.yMax - _face->bbox.yMin ) * scaleY );\n\n\t\t_extents.max_x_advance = static_cast<double>( _face->max_advance_width ) * scaleX;\n\t\t_extents.max_y_advance = static_cast<double>( _face->max_advance_height ) * scaleY;\n\t}\n\telse\n\t{\n\t\t_extents.width = static_cast<double>( _face->size->metrics.max_advance ) \/ 64.0;\n\t\t_extents.height = static_cast<double>( _face->size->metrics.height ) \/ 64.0;\n\n\t\t_extents.max_x_advance = static_cast<double>( _face->size->metrics.max_advance ) \/ 64.0;\n\t\t_extents.max_y_advance = 0.0;\n\t}\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nfont::~font( void )\n{\n\/\/\tFT_Done_Face( _face );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nconst char *\nfont::errorstr( FT_Error err )\n{\n\treturn FT_Errors[err].message;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nconst draw::glyph &\nfont::get_glyph( wchar_t char_code )\n{\n\tauto i = _glyph_cache.find( char_code );\n\tif ( i == _glyph_cache.end() )\n\t{\n\t\tstd::shared_ptr<fc::glyph> nglyph = std::make_shared<fc::glyph>( _face, char_code );\n\n\t\t\/\/ We are only loading a grayscale bitmap for now. Could\n\t\t\/\/ set the LCD filtering and load a color bitmap\n\t\t\/\/ also, we could switch to the signed distance field stuff\n\t\t\/\/ fairly easily if we added the computation here and used\n\t\t\/\/ the appropriate shader...\n\t\tFT_Int32 flags = FT_LOAD_TARGET_NORMAL | FT_LOAD_RENDER | FT_LOAD_FORCE_AUTOHINT;\n\n\t\tauto err = FT_Load_Glyph( _face, nglyph->index(), flags );\n\t\tif ( err )\n\t\t\tthrow std::runtime_error( \"Unable to load glyph\" );\n\n\t\tFT_GlyphSlot slot = _face->glyph;\n\n        int w = slot->bitmap.width;\n        int h = slot->bitmap.rows;\n\n\t\tif ( w > 0 && h > 0 )\n\t\t{\n\t\t\t\/\/ We want each glyph to be separated by at least one black pixel\n\t\t\t\/\/ (for example for shader used in demo-subpixel.c)\n\t\t\tcore::pack::area gA = _glyph_pack.insert( w + 1, h + 1 );\n\t\t\twhile ( gA.empty() )\n\t\t\t{\n\t\t\t\tbump_glyph_store_size();\n\t\t\t\tgA = _glyph_pack.insert( w + 1, h + 1 );\n\t\t\t}\n\n\t\t\tint bmW = _glyph_pack.width();\n\t\t\tint bmH = _glyph_pack.height();\n\t\t\tdouble texNormW = static_cast<double>( bmW );\n\t\t\tdouble texNormH = static_cast<double>( bmH );\n\n\t\t\t_glyph_index_offset[char_code] = _glyph_coords.size();\n\t\t\tint glPitch = slot->bitmap.pitch;\n\t\t\tif ( gA.flipped( w + 1, h + 1 ) )\n\t\t\t{\n\t\t\t\t\/\/ store things ... flipped so\n\t\t\t\t\/\/ upper left is at x, y + w,\n\t\t\t\t\/\/ upper right is at x, y\n\t\t\t\t\/\/ lower left is at x + h, y + w\n\t\t\t\t\/\/ lower right is at x + h, y\n\t\t\t\tuint8_t *bmData = _glyph_bitmap.data();\n\t\t\t\tconst uint8_t *glData = slot->bitmap.buffer;\n\t\t\t\tfor ( int y = 0; y <= w; ++y )\n\t\t\t\t{\n\t\t\t\t\tint destY = gA.y + y;\n\t\t\t\t\tif ( y == w )\n\t\t\t\t\t{\n\t\t\t\t\t\tfor ( int x = 0, destX = gA.x; x <= h; ++x, ++destX )\n\t\t\t\t\t\t\tbmData[destY*bmW + destX] = 0;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tint srcX = w - y - 1;\n\t\t\t\t\t\tint destX = gA.x;\n\t\t\t\t\t\tfor ( int x = 0; x < h; ++x, ++destX )\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tbmData[destY*bmW + destX] = glData[x*glPitch + srcX];\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbmData[destY*bmW + destX] = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tfloat leftX = static_cast<double>(gA.x) \/ texNormW;\n\t\t\t\tfloat topY = static_cast<double>(gA.y) \/ texNormH;\n\t\t\t\tfloat rightX = static_cast<double>(gA.x + h) \/ texNormW;\n\t\t\t\tfloat bottomY = static_cast<double>(gA.y + w) \/ texNormH;\n\n\t\t\t\t_glyph_coords.push_back( leftX );\n\t\t\t\t_glyph_coords.push_back( bottomY );\n\t\t\t\t_glyph_coords.push_back( leftX );\n\t\t\t\t_glyph_coords.push_back( topY );\n\t\t\t\t_glyph_coords.push_back( rightX );\n\t\t\t\t_glyph_coords.push_back( topY );\n\t\t\t\t_glyph_coords.push_back( rightX );\n\t\t\t\t_glyph_coords.push_back( bottomY );\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tfor ( int y = 0; y <= h; ++y )\n\t\t\t\t{\n\t\t\t\t\tuint8_t *bmLine = _glyph_bitmap.data() + bmW * ( gA.y + y );\n\t\t\t\t\tif ( y == h )\n\t\t\t\t\t{\n\t\t\t\t\t\tfor ( int x = 0; x <= w; ++x )\n\t\t\t\t\t\t\tbmLine[x] = 0;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tbmLine += gA.x;\n\t\t\t\t\t\tconst uint8_t *glLine = slot->bitmap.buffer + y * glPitch;\n\t\t\t\t\t\tfor ( int x = 0; x < w; ++x )\n\t\t\t\t\t\t\tbmLine[x] = glLine[x];\n\t\t\t\t\t\tbmLine[w] = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t\/\/ things go in naturally, upper left of bitmap is at x, y\n\t\t\t\tfloat leftX = static_cast<double>(gA.x) \/ texNormW;\n\t\t\t\tfloat topY = static_cast<double>(gA.y) \/ texNormH;\n\t\t\t\tfloat rightX = static_cast<double>(gA.x + w) \/ texNormW;\n\t\t\t\tfloat bottomY = static_cast<double>(gA.y + h) \/ texNormH;\n\n\t\t\t\t_glyph_coords.push_back( leftX );\n\t\t\t\t_glyph_coords.push_back( topY );\n\t\t\t\t_glyph_coords.push_back( rightX );\n\t\t\t\t_glyph_coords.push_back( topY );\n\t\t\t\t_glyph_coords.push_back( rightX );\n\t\t\t\t_glyph_coords.push_back( bottomY );\n\t\t\t\t_glyph_coords.push_back( leftX );\n\t\t\t\t_glyph_coords.push_back( bottomY );\n\t\t\t}\n\t\t}\n\n\t\tdraw::text_extents &gle = nglyph->extents();\n\n\/\/\t\terr = FT_Load_Glyph( _face, nglyph->index(), FT_LOAD_TARGET_NORMAL | FT_LOAD_NO_HINTING );\n\n\t\tgle.x_bearing = static_cast<double>( slot->metrics.horiBearingX ) \/ 64.0;\n\t\tgle.y_bearing = static_cast<double>( slot->metrics.horiBearingY ) \/ 64.0;\n\t\tgle.width = static_cast<double>( slot->metrics.width ) \/ 64.0;\n\t\tgle.height = static_cast<double>( slot->metrics.height ) \/ 64.0;\n\t\tgle.x_advance = static_cast<double>( slot->metrics.horiAdvance ) \/ 64.0;\n\t\tgle.y_advance = static_cast<double>( slot->metrics.vertAdvance ) \/ 64.0;\n\n\/\/\t\tstd::cout << \"glyph '\" << char(char_code) << \"' bearing: x \" << gle.x_bearing << \" y \" << gle.y_bearing << \" size: w \" << gle.width << \" h \" << gle.height << \" advance: x \" << gle.x_advance << \" y \" << gle.y_advance << \" bitmap \" << w << \"x\" << h << std::endl;\n\t\t_glyph_cache[char_code] = nglyph;\n\t\t++_glyph_version;\n\n\t\treturn *nglyph;\n\t}\n\n\treturn *(i->second);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n} \/\/ namespace\n\n<commit_msg>Fixed height of font extent.<commit_after>\n#include \"font.h\"\n\n#include \"glyph.h\"\n#include <draw\/extents.h>\n\n#include <ft2build.h>\n#include FT_FREETYPE_H\n#include FT_STROKER_H\n#include FT_LCD_FILTER_H\n#include FT_GLYPH_H\n\nnamespace {\n\n#undef __FTERRORS_H__\n#define FT_ERRORDEF( e, v, s )  { e, s },\n#define FT_ERROR_START_LIST     {\n#define FT_ERROR_END_LIST       { 0, 0 } };\nconst struct {\n    int          code;\n    const char*  message;\n} FT_Errors[] =\n#include FT_ERRORS_H\n\n}\n\nnamespace fc {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nfont::font( FT_Face face, std::string fam, std::string style, double pixsize )\n\t\t: draw::font( std::move( fam ), std::move( style ), pixsize ),\n\t\t  _face( face )\n{\n\tauto err = FT_Select_Charmap( _face, FT_ENCODING_UNICODE );\n\tif ( err )\n\t{\n\t\tstd::cerr << \"ERROR selecting UNICODE charmap: [\" << FT_Errors[err].code << \"] \" << FT_Errors[err].message << std::endl;\n\t\tif ( _face->charmaps )\n\t\t{\n\t\t\terr = FT_Set_Charmap( _face, _face->charmaps[0] );\n\t\t\tif ( err )\n\t\t\t\tthrow std::runtime_error( errorstr( err ) );\n\t\t}\n\t\telse\n\t\t\tthrow std::runtime_error( \"Unable to select any character map\" );\n\t}\n\n\tstd::cout << \"Need to add global DPI accessor somehow (multiple screens?)\" << std::endl;\n\tstatic const int theDPI = 95;\n\n\tif ( FT_IS_SCALABLE( _face ) )\n\t{\n\t\terr = FT_Set_Char_Size( _face, static_cast<int>( pixsize * 64.0 ), 0,\n\t\t\t\t\t\t\t\ttheDPI, theDPI );\n\t\tif ( err )\n\t\t\tthrow std::runtime_error( \"Unable to set character size\" );\n\t}\n\telse if ( _face->num_fixed_sizes > 1 )\n\t{\n\t\tint targsize = static_cast<int>( pixsize );\n\t\tint bestSize[2];\n\t\tbestSize[0] = bestSize[1] = targsize;\n\t\tint i;\n\t\tfor ( i = 0; i != _face->num_fixed_sizes; ++i )\n\t\t{\n\t\t\tif ( _face->available_sizes[i].width == targsize )\n\t\t\t{\n\t\t\t\tbestSize[1] = _face->available_sizes[i].height;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if ( _face->available_sizes[i].width > targsize &&\n\t\t\t\t\t  bestSize[0] > _face->available_sizes[i].width )\n\t\t\t{\n\t\t\t\tbestSize[0] = _face->available_sizes[i].width;\n\t\t\t\tbestSize[1] = _face->available_sizes[i].height;\n\t\t\t}\n\t\t}\n\n\t\tif ( i == _face->num_fixed_sizes )\n\t\t\t_size = bestSize[0];\n\n\t\t\/\/ otherwise we have to use FT_Set_Pixel_Sizes\n\t\terr = FT_Set_Pixel_Sizes( _face, bestSize[0], bestSize[1] );\n\t\tif ( err )\n\t\t\tthrow std::runtime_error( \"Unable to set fixed character size\" );\n\t}\n\n\t_extents.ascent = static_cast<double>( _face->size->metrics.ascender ) \/ 64.0;\n\t_extents.descent = static_cast<double>( _face->size->metrics.descender ) \/ 64.0;\n\n\tif ( FT_IS_SCALABLE( _face ) )\n\t{\n\t\tdouble scaleX = ( static_cast<double>( _face->size->metrics.x_ppem ) \/\n\t\t\t\t\t\t  static_cast<double>( _face->units_per_EM ) );\n\t\tdouble scaleY = ( static_cast<double>( _face->size->metrics.y_ppem ) \/\n\t\t\t\t\t\t  static_cast<double>( _face->units_per_EM ) );\n\t\t_extents.width = std::ceil( static_cast<double>( _face->bbox.xMax - _face->bbox.xMin ) * scaleX );\n\t\t_extents.height = static_cast<double>( _face->size->metrics.height ) \/ 64.0;\n\t\t\t\/\/ was: std::ceil( static_cast<double>( _face->bbox.yMax - _face->bbox.yMin ) * scaleY );\n\n\t\t_extents.max_x_advance = static_cast<double>( _face->max_advance_width ) * scaleX;\n\t\t_extents.max_y_advance = static_cast<double>( _face->max_advance_height ) * scaleY;\n\t}\n\telse\n\t{\n\t\t_extents.width = static_cast<double>( _face->size->metrics.max_advance ) \/ 64.0;\n\t\t_extents.height = static_cast<double>( _face->size->metrics.height ) \/ 64.0;\n\n\t\t_extents.max_x_advance = static_cast<double>( _face->size->metrics.max_advance ) \/ 64.0;\n\t\t_extents.max_y_advance = 0.0;\n\t}\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nfont::~font( void )\n{\n\/\/\tFT_Done_Face( _face );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nconst char *\nfont::errorstr( FT_Error err )\n{\n\treturn FT_Errors[err].message;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nconst draw::glyph &\nfont::get_glyph( wchar_t char_code )\n{\n\tauto i = _glyph_cache.find( char_code );\n\tif ( i == _glyph_cache.end() )\n\t{\n\t\tstd::shared_ptr<fc::glyph> nglyph = std::make_shared<fc::glyph>( _face, char_code );\n\n\t\t\/\/ We are only loading a grayscale bitmap for now. Could\n\t\t\/\/ set the LCD filtering and load a color bitmap\n\t\t\/\/ also, we could switch to the signed distance field stuff\n\t\t\/\/ fairly easily if we added the computation here and used\n\t\t\/\/ the appropriate shader...\n\t\tFT_Int32 flags = FT_LOAD_TARGET_NORMAL | FT_LOAD_RENDER | FT_LOAD_FORCE_AUTOHINT;\n\n\t\tauto err = FT_Load_Glyph( _face, nglyph->index(), flags );\n\t\tif ( err )\n\t\t\tthrow std::runtime_error( \"Unable to load glyph\" );\n\n\t\tFT_GlyphSlot slot = _face->glyph;\n\n        int w = slot->bitmap.width;\n        int h = slot->bitmap.rows;\n\n\t\tif ( w > 0 && h > 0 )\n\t\t{\n\t\t\t\/\/ We want each glyph to be separated by at least one black pixel\n\t\t\t\/\/ (for example for shader used in demo-subpixel.c)\n\t\t\tcore::pack::area gA = _glyph_pack.insert( w + 1, h + 1 );\n\t\t\twhile ( gA.empty() )\n\t\t\t{\n\t\t\t\tbump_glyph_store_size();\n\t\t\t\tgA = _glyph_pack.insert( w + 1, h + 1 );\n\t\t\t}\n\n\t\t\tint bmW = _glyph_pack.width();\n\t\t\tint bmH = _glyph_pack.height();\n\t\t\tdouble texNormW = static_cast<double>( bmW );\n\t\t\tdouble texNormH = static_cast<double>( bmH );\n\n\t\t\t_glyph_index_offset[char_code] = _glyph_coords.size();\n\t\t\tint glPitch = slot->bitmap.pitch;\n\t\t\tif ( gA.flipped( w + 1, h + 1 ) )\n\t\t\t{\n\t\t\t\t\/\/ store things ... flipped so\n\t\t\t\t\/\/ upper left is at x, y + w,\n\t\t\t\t\/\/ upper right is at x, y\n\t\t\t\t\/\/ lower left is at x + h, y + w\n\t\t\t\t\/\/ lower right is at x + h, y\n\t\t\t\tuint8_t *bmData = _glyph_bitmap.data();\n\t\t\t\tconst uint8_t *glData = slot->bitmap.buffer;\n\t\t\t\tfor ( int y = 0; y <= w; ++y )\n\t\t\t\t{\n\t\t\t\t\tint destY = gA.y + y;\n\t\t\t\t\tif ( y == w )\n\t\t\t\t\t{\n\t\t\t\t\t\tfor ( int x = 0, destX = gA.x; x <= h; ++x, ++destX )\n\t\t\t\t\t\t\tbmData[destY*bmW + destX] = 0;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tint srcX = w - y - 1;\n\t\t\t\t\t\tint destX = gA.x;\n\t\t\t\t\t\tfor ( int x = 0; x < h; ++x, ++destX )\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tbmData[destY*bmW + destX] = glData[x*glPitch + srcX];\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbmData[destY*bmW + destX] = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tfloat leftX = static_cast<double>(gA.x) \/ texNormW;\n\t\t\t\tfloat topY = static_cast<double>(gA.y) \/ texNormH;\n\t\t\t\tfloat rightX = static_cast<double>(gA.x + h) \/ texNormW;\n\t\t\t\tfloat bottomY = static_cast<double>(gA.y + w) \/ texNormH;\n\n\t\t\t\t_glyph_coords.push_back( leftX );\n\t\t\t\t_glyph_coords.push_back( bottomY );\n\t\t\t\t_glyph_coords.push_back( leftX );\n\t\t\t\t_glyph_coords.push_back( topY );\n\t\t\t\t_glyph_coords.push_back( rightX );\n\t\t\t\t_glyph_coords.push_back( topY );\n\t\t\t\t_glyph_coords.push_back( rightX );\n\t\t\t\t_glyph_coords.push_back( bottomY );\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tfor ( int y = 0; y <= h; ++y )\n\t\t\t\t{\n\t\t\t\t\tuint8_t *bmLine = _glyph_bitmap.data() + bmW * ( gA.y + y );\n\t\t\t\t\tif ( y == h )\n\t\t\t\t\t{\n\t\t\t\t\t\tfor ( int x = 0; x <= w; ++x )\n\t\t\t\t\t\t\tbmLine[x] = 0;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tbmLine += gA.x;\n\t\t\t\t\t\tconst uint8_t *glLine = slot->bitmap.buffer + y * glPitch;\n\t\t\t\t\t\tfor ( int x = 0; x < w; ++x )\n\t\t\t\t\t\t\tbmLine[x] = glLine[x];\n\t\t\t\t\t\tbmLine[w] = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t\/\/ things go in naturally, upper left of bitmap is at x, y\n\t\t\t\tfloat leftX = static_cast<double>(gA.x) \/ texNormW;\n\t\t\t\tfloat topY = static_cast<double>(gA.y) \/ texNormH;\n\t\t\t\tfloat rightX = static_cast<double>(gA.x + w) \/ texNormW;\n\t\t\t\tfloat bottomY = static_cast<double>(gA.y + h) \/ texNormH;\n\n\t\t\t\t_glyph_coords.push_back( leftX );\n\t\t\t\t_glyph_coords.push_back( topY );\n\t\t\t\t_glyph_coords.push_back( rightX );\n\t\t\t\t_glyph_coords.push_back( topY );\n\t\t\t\t_glyph_coords.push_back( rightX );\n\t\t\t\t_glyph_coords.push_back( bottomY );\n\t\t\t\t_glyph_coords.push_back( leftX );\n\t\t\t\t_glyph_coords.push_back( bottomY );\n\t\t\t}\n\t\t}\n\n\t\tdraw::text_extents &gle = nglyph->extents();\n\n\/\/\t\terr = FT_Load_Glyph( _face, nglyph->index(), FT_LOAD_TARGET_NORMAL | FT_LOAD_NO_HINTING );\n\n\t\tgle.x_bearing = static_cast<double>( slot->metrics.horiBearingX ) \/ 64.0;\n\t\tgle.y_bearing = static_cast<double>( slot->metrics.horiBearingY ) \/ 64.0;\n\t\tgle.width = static_cast<double>( slot->metrics.width ) \/ 64.0;\n\t\tgle.height = static_cast<double>( slot->metrics.height ) \/ 64.0;\n\t\tgle.x_advance = static_cast<double>( slot->metrics.horiAdvance ) \/ 64.0;\n\t\tgle.y_advance = static_cast<double>( slot->metrics.vertAdvance ) \/ 64.0;\n\n\/\/\t\tstd::cout << \"glyph '\" << char(char_code) << \"' bearing: x \" << gle.x_bearing << \" y \" << gle.y_bearing << \" size: w \" << gle.width << \" h \" << gle.height << \" advance: x \" << gle.x_advance << \" y \" << gle.y_advance << \" bitmap \" << w << \"x\" << h << std::endl;\n\t\t_glyph_cache[char_code] = nglyph;\n\t\t++_glyph_version;\n\n\t\treturn *nglyph;\n\t}\n\n\treturn *(i->second);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n} \/\/ namespace\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: progresshandlerwrap.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 09:51: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#ifndef _UTL_PROGRESSHANDLERWRAP_HXX_\n#include <unotools\/progresshandlerwrap.hxx>\n#endif\n\nnamespace utl\n{\n\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::task;\nusing namespace ::com::sun::star::ucb;\n\nProgressHandlerWrap::ProgressHandlerWrap( ::com::sun::star::uno::Reference< ::com::sun::star::task::XStatusIndicator > xSI )\n: m_xStatusIndicator( xSI )\n{\n}\n\nsal_Bool getStatusFromAny_Impl( const Any& aAny, ::rtl::OUString& aText, sal_Int32& nNum )\n{\n    sal_Bool bNumIsSet = sal_False;\n\n    Sequence< Any > aSetList;\n    if( ( aAny >>= aSetList ) && aSetList.getLength() )\n        for( int ind = 0; ind < aSetList.getLength(); ind++ )\n        {\n            if( !bNumIsSet && ( aSetList[ind] >>= nNum ) )\n                bNumIsSet = sal_True;\n            else\n                !aText.getLength() && ( aSetList[ind] >>= aText );\n        }\n\n    return bNumIsSet;\n}\n\nvoid SAL_CALL ProgressHandlerWrap::push( const Any& Status )\n    throw( RuntimeException )\n{\n    if( !m_xStatusIndicator.is() )\n        return;\n\n    ::rtl::OUString aText;\n    sal_Int32 nRange;\n\n    if( getStatusFromAny_Impl( Status, aText, nRange ) )\n        m_xStatusIndicator->start( aText, nRange );\n}\n\nvoid SAL_CALL ProgressHandlerWrap::update( const Any& Status )\n    throw( RuntimeException )\n{\n    if( !m_xStatusIndicator.is() )\n        return;\n\n    ::rtl::OUString aText;\n    sal_Int32 nValue;\n\n    if( getStatusFromAny_Impl( Status, aText, nValue ) )\n    {\n        if( aText.getLength() ) m_xStatusIndicator->setText( aText );\n        m_xStatusIndicator->setValue( nValue );\n    }\n}\n\nvoid SAL_CALL ProgressHandlerWrap::pop()\n        throw( RuntimeException )\n{\n    if( m_xStatusIndicator.is() )\n        m_xStatusIndicator->end();\n}\n\n} \/\/ namespace utl\n\n<commit_msg>INTEGRATION: CWS pchfix02 (1.3.58); FILE MERGED 2006\/09\/01 17:56:26 kaib 1.3.58.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: progresshandlerwrap.cxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 01:29: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_unotools.hxx\"\n\n#ifndef _UTL_PROGRESSHANDLERWRAP_HXX_\n#include <unotools\/progresshandlerwrap.hxx>\n#endif\n\nnamespace utl\n{\n\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::task;\nusing namespace ::com::sun::star::ucb;\n\nProgressHandlerWrap::ProgressHandlerWrap( ::com::sun::star::uno::Reference< ::com::sun::star::task::XStatusIndicator > xSI )\n: m_xStatusIndicator( xSI )\n{\n}\n\nsal_Bool getStatusFromAny_Impl( const Any& aAny, ::rtl::OUString& aText, sal_Int32& nNum )\n{\n    sal_Bool bNumIsSet = sal_False;\n\n    Sequence< Any > aSetList;\n    if( ( aAny >>= aSetList ) && aSetList.getLength() )\n        for( int ind = 0; ind < aSetList.getLength(); ind++ )\n        {\n            if( !bNumIsSet && ( aSetList[ind] >>= nNum ) )\n                bNumIsSet = sal_True;\n            else\n                !aText.getLength() && ( aSetList[ind] >>= aText );\n        }\n\n    return bNumIsSet;\n}\n\nvoid SAL_CALL ProgressHandlerWrap::push( const Any& Status )\n    throw( RuntimeException )\n{\n    if( !m_xStatusIndicator.is() )\n        return;\n\n    ::rtl::OUString aText;\n    sal_Int32 nRange;\n\n    if( getStatusFromAny_Impl( Status, aText, nRange ) )\n        m_xStatusIndicator->start( aText, nRange );\n}\n\nvoid SAL_CALL ProgressHandlerWrap::update( const Any& Status )\n    throw( RuntimeException )\n{\n    if( !m_xStatusIndicator.is() )\n        return;\n\n    ::rtl::OUString aText;\n    sal_Int32 nValue;\n\n    if( getStatusFromAny_Impl( Status, aText, nValue ) )\n    {\n        if( aText.getLength() ) m_xStatusIndicator->setText( aText );\n        m_xStatusIndicator->setValue( nValue );\n    }\n}\n\nvoid SAL_CALL ProgressHandlerWrap::pop()\n        throw( RuntimeException )\n{\n    if( m_xStatusIndicator.is() )\n        m_xStatusIndicator->end();\n}\n\n} \/\/ namespace utl\n\n<|endoftext|>"}
{"text":"<commit_before>#include <node.h>\n#include <nan.h>\n#include <memory>\n\n#define TYPECHK(expr, msg) if (! expr) { \\\n  Nan::ThrowTypeError(msg); \\\n  return; \\\n}\n\nextern \"C\" {\n  #include \"sss\/sss.h\"\n  #include \"sss\/serialize.h\"\n}\n\n\nclass CreateSharesWorker : public Nan::AsyncWorker {\n public:\n  CreateSharesWorker(char* data, uint8_t n, uint8_t k, char* random_bytes,\n                     Nan::Callback *callback)\n      : AsyncWorker(callback), n(n), k(k) {\n    Nan::HandleScope scope;\n\n    memcpy(this->data, data, sss_MLEN);\n    memcpy(this->random_bytes, random_bytes, 32);\n    size_t output_size = n * sss_SHARE_SERIALIZED_LEN;\n    if (output_size \/ sss_SHARE_SERIALIZED_LEN != n) {\n        \/\/ Overflow occurred! Is an unreachable state, because `n` is\n        \/\/ between 0 and 256, and `sss_SHARE_SERIALIZED_LEN` is a small value.\n        Nan::ThrowError(\"unreachable state\");\n    }\n    this->output = std::unique_ptr<char[]>{ new char[output_size]() };\n  }\n\n  void Execute() {\n    std::unique_ptr<sss_Share[]> shares(new sss_Share[n]());\n    sss_create_shares(&shares[0], (uint8_t*) data, n, k,\n                      (uint8_t*) random_bytes);\n    for (size_t idx = 0; idx < n; ++idx) {\n      \/\/ Multiplication was already checked during constructor\n      size_t offset = idx * sss_SHARE_SERIALIZED_LEN;\n      sss_serialize_share((uint8_t*) &output[offset], &shares[idx]);\n    }\n  }\n\n  void HandleOKCallback() {\n    Nan::HandleScope scope;\n    v8::Isolate* isolate = v8::Isolate::GetCurrent();\n\n    \/\/ Copy the output to a list of node.js buffers\n    v8::Local<v8::Array> array = v8::Array::New(isolate, n);\n    for (size_t idx = 0; idx < n; ++idx) {\n        size_t offset = idx * sss_SHARE_SERIALIZED_LEN;\n        array->Set(idx, Nan::CopyBuffer(&output[offset],\n            sss_SHARE_SERIALIZED_LEN).ToLocalChecked());\n    }\n    v8::Local<v8::Value> argv[] = { array };\n\n    \/\/ Call the provided callback\n    callback->Call(1, argv);\n  }\n\n private:\n  uint8_t n, k;\n  char data[sss_MLEN];\n  char random_bytes[32];\n  std::unique_ptr<char[]> output;\n};\n\n\nclass CombineSharesWorker : public Nan::AsyncWorker {\n public:\n  CombineSharesWorker(v8::Local<v8::Object>* shares, uint8_t k,\n                      Nan::Callback *callback)\n      : AsyncWorker(callback), k(k) {\n    Nan::HandleScope scope;\n\n    size_t input_size = k * sss_SHARE_SERIALIZED_LEN;\n    if (input_size \/ sss_SHARE_SERIALIZED_LEN != k) {\n        \/\/ Overflow occurred! Is an unreachable state, because `k` is\n        \/\/ between 0 and 256, and `sss_SHARE_SERIALIZED_LEN` is a small value.\n        Nan::ThrowError(\"unreachable state\");\n    }\n    this->input = std::unique_ptr<char[]>{ new char[input_size] };\n    for (auto idx = 0; idx < k; ++idx) {\n      memcpy(&this->input[idx * sss_SHARE_SERIALIZED_LEN],\n             node::Buffer::Data(shares[idx]),\n             sss_SHARE_SERIALIZED_LEN);\n    }\n  }\n\n  void Execute() {\n    std::unique_ptr<sss_Share[]> shares(new sss_Share[k]());\n    for (auto idx = 0; idx < k; ++idx) {\n      \/\/ Multiplication was already checked during constructor\n      size_t offset = idx * sss_SHARE_SERIALIZED_LEN;\n      sss_unserialize_share(&shares[idx], (uint8_t*) &input[offset]);\n    }\n    status = sss_combine_shares((uint8_t*) data, &shares[0], k);\n  }\n\n  void HandleOKCallback() {\n    Nan::HandleScope scope;\n\n    v8::Local<v8::Value> argv[1];\n    if (status == 0) {\n      \/\/ All went well, call the callback the restored buffer\n      argv[0] = Nan::CopyBuffer(data, sss_MLEN).ToLocalChecked();\n    } else {\n      \/\/ Some kind of error occurred, return null\n      argv[0] = Nan::Null();\n    }\n    callback->Call(1, argv);\n  }\n\n private:\n  uint8_t k;\n  std::unique_ptr<char[]> input;\n  int status;\n  char data[sss_MLEN];\n};\n\n\nNAN_METHOD(CreateShares) {\n  Nan::HandleScope scope;\n\n  v8::Local<v8::Value> data_val = info[0];\n  v8::Local<v8::Value> n_val = info[1];\n  v8::Local<v8::Value> k_val = info[2];\n  v8::Local<v8::Value> random_bytes_val = info[3];\n  v8::Local<v8::Value> callback_val = info[4];\n\n  \/\/ Type check the arguments\n  TYPECHK(!data_val->IsUndefined(), \"`data` is not defined\");\n  TYPECHK(!n_val->IsUndefined(), \"`n` is not defined\");\n  TYPECHK(!k_val->IsUndefined(), \"`k` is not defined\");\n  TYPECHK(!random_bytes_val->IsUndefined(), \"`random_bytes` is not defined\");\n  TYPECHK(!callback_val->IsUndefined(), \"`callback` is not defined\");\n\n  TYPECHK(data_val->IsObject(), \"`data` is not an Object\");\n  v8::Local<v8::Object> data = data_val->ToObject();\n  TYPECHK(node::Buffer::HasInstance(data), \"`data` must be a Buffer\")\n  TYPECHK(n_val->IsUint32(), \"`n` is not a valid integer\");\n  uint32_t n = n_val->Uint32Value();\n  TYPECHK(k_val->IsUint32(), \"`k` is not a valid integer\");\n  uint32_t k = k_val->Uint32Value();\n  TYPECHK(random_bytes_val->IsObject(), \"`random_bytes` is not an Object\");\n  v8::Local<v8::Object> random_bytes = random_bytes_val->ToObject();\n  TYPECHK(node::Buffer::HasInstance(random_bytes),\n          \"`random_bytes` must be a Buffer\")\n  TYPECHK(callback_val->IsFunction(), \"`callback` must be a function\");\n  Nan::Callback *callback = new Nan::Callback(callback_val.As<v8::Function>());\n\n  \/\/ Check if the buffers have the correct lengths\n  if (node::Buffer::Length(data) != sss_MLEN) {\n    Nan::ThrowRangeError(\"`data` buffer size must be exactly 64 bytes\");\n    return;\n  };\n  if (node::Buffer::Length(random_bytes) != 32) {\n    Nan::ThrowRangeError(\"`random_bytes` buffer size must be exactly 32 bytes\");\n    return;\n  };\n\n  \/\/ Check if n and k are correct\n  if (n < 1 || n > 255) {\n    Nan::ThrowRangeError(\"`n` must be between 1 and 255\");\n    return;\n  }\n  if (k < 1 || k > n) {\n    Nan::ThrowRangeError(\"`k` must be between 1 and n\");\n    return;\n  }\n\n  \/\/ Create worker\n  CreateSharesWorker* worker = new CreateSharesWorker(\n    node::Buffer::Data(data), n, k, node::Buffer::Data(random_bytes), callback);\n  AsyncQueueWorker(worker);\n}\n\n\nNAN_METHOD(CombineShares) {\n  Nan::HandleScope scope;\n\n  v8::Local<v8::Value> shares_val = info[0];\n  v8::Local<v8::Value> callback_val = info[1];\n\n  \/\/ Type check the argument `shares` and `callback`\n  TYPECHK(!shares_val->IsUndefined(), \"`shares` is not defined\");\n  TYPECHK(!callback_val->IsUndefined(), \"`callback` is not defined\");\n\n  TYPECHK(shares_val->IsObject(), \"`data` is not an initialized Object\")\n  v8::Local<v8::Object> shares_obj = shares_val->ToObject();\n  TYPECHK(shares_val->IsArray(), \"`data` must be an array of buffers\");\n  v8::Local<v8::Array> shares_arr = shares_obj.As<v8::Array>();\n  TYPECHK(callback_val->IsFunction(), \"`callback` must be a function\");\n  Nan::Callback *callback = new Nan::Callback(callback_val.As<v8::Function>());\n\n  \/\/ Extract all the share buffers\n  auto k = shares_arr->Length();\n  v8::Local<v8::Object> shares[k];\n  for (auto idx = 0; idx < k; ++idx) {\n    shares[idx] = shares_arr->Get(idx)->ToObject();\n  }\n\n  \/\/ Check if all the elements in the array are buffers\n  for (auto idx = 0; idx < k; ++idx) {\n    if (!node::Buffer::HasInstance(shares[idx])) {\n      Nan::ThrowTypeError(\"array element is not a buffer\");\n      return;\n    }\n  }\n\n  \/\/ Check if all the elements in the array are of the correct length\n  for (auto idx = 0; idx < k; ++idx) {\n    if (node::Buffer::Length(shares[idx]) != sss_SHARE_SERIALIZED_LEN) {\n      Nan::ThrowTypeError(\"array buffer element is not of the correct length\");\n      return;\n    }\n  }\n\n  \/\/ Create worker\n  CombineSharesWorker* worker = new CombineSharesWorker(shares, k, callback);\n  AsyncQueueWorker(worker);\n}\n\n\nvoid Initialize(v8::Local<v8::Object> exports, v8::Local<v8::Object> module) {\n  Nan::HandleScope scope;\n  Nan::SetMethod(exports, \"createShares\", CreateShares);\n  Nan::SetMethod(exports, \"combineShares\", CombineShares);\n}\n\n\nNODE_MODULE(shamirsecretsharing, Initialize)\n<commit_msg>Use C++-style array instead of C-style array<commit_after>#include <node.h>\n#include <nan.h>\n#include <memory>\n\n#define TYPECHK(expr, msg) if (! expr) { \\\n  Nan::ThrowTypeError(msg); \\\n  return; \\\n}\n\nextern \"C\" {\n  #include \"sss\/sss.h\"\n  #include \"sss\/serialize.h\"\n}\n\n\nclass CreateSharesWorker : public Nan::AsyncWorker {\n public:\n  CreateSharesWorker(char* data, uint8_t n, uint8_t k, char* random_bytes,\n                     Nan::Callback *callback)\n      : AsyncWorker(callback), n(n), k(k) {\n    Nan::HandleScope scope;\n\n    memcpy(this->data, data, sss_MLEN);\n    memcpy(this->random_bytes, random_bytes, 32);\n    size_t output_size = n * sss_SHARE_SERIALIZED_LEN;\n    if (output_size \/ sss_SHARE_SERIALIZED_LEN != n) {\n        \/\/ Overflow occurred! Is an unreachable state, because `n` is\n        \/\/ between 0 and 256, and `sss_SHARE_SERIALIZED_LEN` is a small value.\n        Nan::ThrowError(\"unreachable state\");\n    }\n    this->output = std::unique_ptr<char[]>{ new char[output_size]() };\n  }\n\n  void Execute() {\n    std::unique_ptr<sss_Share[]> shares(new sss_Share[n]());\n    sss_create_shares(&shares[0], (uint8_t*) data, n, k,\n                      (uint8_t*) random_bytes);\n    for (size_t idx = 0; idx < n; ++idx) {\n      \/\/ Multiplication was already checked during constructor\n      size_t offset = idx * sss_SHARE_SERIALIZED_LEN;\n      sss_serialize_share((uint8_t*) &output[offset], &shares[idx]);\n    }\n  }\n\n  void HandleOKCallback() {\n    Nan::HandleScope scope;\n    v8::Isolate* isolate = v8::Isolate::GetCurrent();\n\n    \/\/ Copy the output to a list of node.js buffers\n    v8::Local<v8::Array> array = v8::Array::New(isolate, n);\n    for (size_t idx = 0; idx < n; ++idx) {\n        size_t offset = idx * sss_SHARE_SERIALIZED_LEN;\n        array->Set(idx, Nan::CopyBuffer(&output[offset],\n            sss_SHARE_SERIALIZED_LEN).ToLocalChecked());\n    }\n    v8::Local<v8::Value> argv[] = { array };\n\n    \/\/ Call the provided callback\n    callback->Call(1, argv);\n  }\n\n private:\n  uint8_t n, k;\n  char data[sss_MLEN];\n  char random_bytes[32];\n  std::unique_ptr<char[]> output;\n};\n\n\nclass CombineSharesWorker : public Nan::AsyncWorker {\n public:\n  CombineSharesWorker(std::unique_ptr<v8::Local<v8::Object>[]> &shares,\n                      uint8_t k, Nan::Callback *callback)\n      : AsyncWorker(callback), k(k) {\n    Nan::HandleScope scope;\n\n    size_t input_size = k * sss_SHARE_SERIALIZED_LEN;\n    if (input_size \/ sss_SHARE_SERIALIZED_LEN != k) {\n        \/\/ Overflow occurred! Is an unreachable state, because `k` is\n        \/\/ between 0 and 256, and `sss_SHARE_SERIALIZED_LEN` is a small value.\n        Nan::ThrowError(\"unreachable state\");\n    }\n    this->input = std::unique_ptr<char[]>{ new char[input_size] };\n    for (auto idx = 0; idx < k; ++idx) {\n      memcpy(&this->input[idx * sss_SHARE_SERIALIZED_LEN],\n             node::Buffer::Data(shares[idx]),\n             sss_SHARE_SERIALIZED_LEN);\n    }\n  }\n\n  void Execute() {\n    std::unique_ptr<sss_Share[]> shares(new sss_Share[k]());\n    for (auto idx = 0; idx < k; ++idx) {\n      \/\/ Multiplication was already checked during constructor\n      size_t offset = idx * sss_SHARE_SERIALIZED_LEN;\n      sss_unserialize_share(&shares[idx], (uint8_t*) &input[offset]);\n    }\n    status = sss_combine_shares((uint8_t*) data, &shares[0], k);\n  }\n\n  void HandleOKCallback() {\n    Nan::HandleScope scope;\n\n    v8::Local<v8::Value> argv[1];\n    if (status == 0) {\n      \/\/ All went well, call the callback the restored buffer\n      argv[0] = Nan::CopyBuffer(data, sss_MLEN).ToLocalChecked();\n    } else {\n      \/\/ Some kind of error occurred, return null\n      argv[0] = Nan::Null();\n    }\n    callback->Call(1, argv);\n  }\n\n private:\n  uint8_t k;\n  std::unique_ptr<char[]> input;\n  int status;\n  char data[sss_MLEN];\n};\n\n\nNAN_METHOD(CreateShares) {\n  Nan::HandleScope scope;\n\n  v8::Local<v8::Value> data_val = info[0];\n  v8::Local<v8::Value> n_val = info[1];\n  v8::Local<v8::Value> k_val = info[2];\n  v8::Local<v8::Value> random_bytes_val = info[3];\n  v8::Local<v8::Value> callback_val = info[4];\n\n  \/\/ Type check the arguments\n  TYPECHK(!data_val->IsUndefined(), \"`data` is not defined\");\n  TYPECHK(!n_val->IsUndefined(), \"`n` is not defined\");\n  TYPECHK(!k_val->IsUndefined(), \"`k` is not defined\");\n  TYPECHK(!random_bytes_val->IsUndefined(), \"`random_bytes` is not defined\");\n  TYPECHK(!callback_val->IsUndefined(), \"`callback` is not defined\");\n\n  TYPECHK(data_val->IsObject(), \"`data` is not an Object\");\n  v8::Local<v8::Object> data = data_val->ToObject();\n  TYPECHK(node::Buffer::HasInstance(data), \"`data` must be a Buffer\")\n  TYPECHK(n_val->IsUint32(), \"`n` is not a valid integer\");\n  uint32_t n = n_val->Uint32Value();\n  TYPECHK(k_val->IsUint32(), \"`k` is not a valid integer\");\n  uint32_t k = k_val->Uint32Value();\n  TYPECHK(random_bytes_val->IsObject(), \"`random_bytes` is not an Object\");\n  v8::Local<v8::Object> random_bytes = random_bytes_val->ToObject();\n  TYPECHK(node::Buffer::HasInstance(random_bytes),\n          \"`random_bytes` must be a Buffer\")\n  TYPECHK(callback_val->IsFunction(), \"`callback` must be a function\");\n  Nan::Callback *callback = new Nan::Callback(callback_val.As<v8::Function>());\n\n  \/\/ Check if the buffers have the correct lengths\n  if (node::Buffer::Length(data) != sss_MLEN) {\n    Nan::ThrowRangeError(\"`data` buffer size must be exactly 64 bytes\");\n    return;\n  };\n  if (node::Buffer::Length(random_bytes) != 32) {\n    Nan::ThrowRangeError(\"`random_bytes` buffer size must be exactly 32 bytes\");\n    return;\n  };\n\n  \/\/ Check if n and k are correct\n  if (n < 1 || n > 255) {\n    Nan::ThrowRangeError(\"`n` must be between 1 and 255\");\n    return;\n  }\n  if (k < 1 || k > n) {\n    Nan::ThrowRangeError(\"`k` must be between 1 and n\");\n    return;\n  }\n\n  \/\/ Create worker\n  CreateSharesWorker* worker = new CreateSharesWorker(\n    node::Buffer::Data(data), n, k, node::Buffer::Data(random_bytes), callback);\n  AsyncQueueWorker(worker);\n}\n\n\nNAN_METHOD(CombineShares) {\n  Nan::HandleScope scope;\n\n  v8::Local<v8::Value> shares_val = info[0];\n  v8::Local<v8::Value> callback_val = info[1];\n\n  \/\/ Type check the argument `shares` and `callback`\n  TYPECHK(!shares_val->IsUndefined(), \"`shares` is not defined\");\n  TYPECHK(!callback_val->IsUndefined(), \"`callback` is not defined\");\n\n  TYPECHK(shares_val->IsObject(), \"`data` is not an initialized Object\")\n  v8::Local<v8::Object> shares_obj = shares_val->ToObject();\n  TYPECHK(shares_val->IsArray(), \"`data` must be an array of buffers\");\n  v8::Local<v8::Array> shares_arr = shares_obj.As<v8::Array>();\n  TYPECHK(callback_val->IsFunction(), \"`callback` must be a function\");\n  Nan::Callback *callback = new Nan::Callback(callback_val.As<v8::Function>());\n\n  \/\/ Extract all the share buffers\n  auto k = shares_arr->Length();\n  std::unique_ptr<v8::Local<v8::Object>[]> shares(new v8::Local<v8::Object>[k]);\n  for (auto idx = 0; idx < k; ++idx) {\n    shares[idx] = shares_arr->Get(idx)->ToObject();\n  }\n\n  \/\/ Check if all the elements in the array are buffers\n  for (auto idx = 0; idx < k; ++idx) {\n    if (!node::Buffer::HasInstance(shares[idx])) {\n      Nan::ThrowTypeError(\"array element is not a buffer\");\n      return;\n    }\n  }\n\n  \/\/ Check if all the elements in the array are of the correct length\n  for (auto idx = 0; idx < k; ++idx) {\n    if (node::Buffer::Length(shares[idx]) != sss_SHARE_SERIALIZED_LEN) {\n      Nan::ThrowTypeError(\"array buffer element is not of the correct length\");\n      return;\n    }\n  }\n\n  \/\/ Create worker\n  CombineSharesWorker* worker = new CombineSharesWorker(shares, k, callback);\n  AsyncQueueWorker(worker);\n}\n\n\nvoid Initialize(v8::Local<v8::Object> exports, v8::Local<v8::Object> module) {\n  Nan::HandleScope scope;\n  Nan::SetMethod(exports, \"createShares\", CreateShares);\n  Nan::SetMethod(exports, \"combineShares\", CombineShares);\n}\n\n\nNODE_MODULE(shamirsecretsharing, Initialize)\n<|endoftext|>"}
{"text":"<commit_before>\/\/ $Id$\n\/\/ $MpId: testSegmentation.C,v 1.1 2005\/09\/19 19:02:53 ivana Exp $\n\n\/\/ Obsolete ??\n\n#include \"AliRun.h\"\n#include \"AliMUON.h\"\n#include \"AliMUONChamber.h\"\n#include \"AliMUONGeometrySegmentation.h\"\n#include \"AliMUONVGeometryDESegmentation.h\"\n#include \"AliMpPlaneType.h\"\n#include \"AliMUONSt345SlatSegmentationV2.h\"\n\/\/#include \"AliMpSt345Reader.h\"\n#include \"AliMpSegmentationManager.h\"\n#include \"AliMpSlat.h\"\n#include \"AliMpPCB.h\"\n\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <sstream>\n\nstd::map<int,std::string> detElemIdToSlatTypeMap;\n\n\/\/_____________________________________________________________________________\nbool equal(double a, double b, double epsilon=1e-5)\n{\n  double d = fabs(a-b)\/b;\n  if ( d < epsilon ) return true;\n  return false;\n}\n\n\/\/_____________________________________________________________________________\nbool error(const char* msg)\n{\n  std::cout << msg << std::endl;\n  return false;\n}\n\n\/\/_____________________________________________________________________________\nbool readDetElemIdToSlatType(const char* file = \"\/Users\/aphecetc\/Workspace\/aliroot\/MUON\/mapping\/data\/station345\/DetElemIdToSlatType.dat\")\n{\n  std::ifstream in(file);\n  if (!in.good()) return false;\n\n  char line[80];\n\n  while ( in.getline(line,80) )\n    {\n      if ( !isdigit(line[0]) ) continue;\n      std::string sline(line);\n      \n      std::string::size_type pos = sline.find_first_of(' ');\n      int detelemid = std::atoi(sline.substr(0,pos).c_str());\n      detElemIdToSlatTypeMap[detelemid] = sline.substr(pos+1);\n    }\n\n  in.close();\n\n  return true;\n}\n\n\/\/_____________________________________________________________________________\nconst char* SlatType(int detelemid)\n{\n  if ( detElemIdToSlatTypeMap.empty() ) readDetElemIdToSlatType();\n\n  std::map<int,std::string>::const_iterator it = \n    detElemIdToSlatTypeMap.find(detelemid);\n\n  if ( it != detElemIdToSlatTypeMap.end() )\n    {\n      return it->second.c_str();\n    }\n  else\n    {\n      return 0;\n    }\n}\n\n\/\/_____________________________________________________________________________\nbool testAllDetelem()\n{\n  \/\/ test we can read the map file (detelemid <-> slat type)\n  bool ok = readDetElemIdToSlatType();\n  if (!ok)\n    {\n      return false;\n    }\n\n  \/\/ now loops over all detelemid and check that:\n  \/\/ 1. We can actually read the slat files, both bending and non-bending\n  \/\/ 2. Bending and non-bending slats do have the same x-size\n\n  std::map<int,std::string>::const_iterator it;\n  std::set<std::string> slattypes;\n  std::map<std::string,std::string> problems;\n\n  for ( it = detElemIdToSlatTypeMap.begin(); it != detElemIdToSlatTypeMap.end();\n\t++it )\n    {\n      slattypes.insert(it->second);\n      std::cout << it->first << \" : \" << it->second <<  \" \";\n      AliMpSlat* b = static_cast<AliMpSlat*>\n\t(AliMpSegmentationManager::Segmentation(it->first,AliMp::kBendingPlane));\n      AliMpSlat* nb = static_cast<AliMpSlat*>\n\t(AliMpSegmentationManager::Segmentation(it->first,AliMp::kNonBendingPlane));\n      std::cout << \" B : \" << b << \" NB : \" << nb;\n      Double_t bx = 0.0;\n      Double_t nbx = 0.0;\n      std::ostringstream pb;\n\n      if (b) \n\t{\n\t  bx = b->DX()*2;\n\t}\n      else\n\t{\n\t  std::cout << \" Missing BENDING. \";\n\t}\n     if (nb) \n\t{\n\t  nbx = nb->DX()*2;\n\t}\n     else\n       {\n\t std::cout << \" Missing NON-BENDING.\";\n       }\n     std::cout << std::endl;\n     if (!b || !nb) \n       {\n\t return false;\n       }\n     if ( bx != nbx )\n       {\n\t \/\/ Find which pcb(s) have a different size\n\t if ( b->GetSize() != nb->GetSize() )\n\t   {\n\t     std::cout << \"Not the same number of PCBs !\" << std::endl;\n\t     return false;\n\t   }\n\n\t pb << \" DIFFERENT SIZES ! Bending= \" << bx\n\t    << \" Non-Bending= \" << nbx\n\t    << \" delta = \" << bx - nbx;\n\n\t for ( size_t i = 0; i < b->GetSize(); ++ i )\n\t   {\n\t     Double_t delta = b->GetPCB(i)->DX() - nb->GetPCB(i)->DX();\n\t     if ( fabs(delta*2) > 1E-3 )\n\t       {\n\t\t pb << \" DELTA(\" << i << \")=\" << delta*2;\n\t       }\n\t   }\t \n\t pb << std::ends;\n\t problems[it->second] = pb.str();\n       }\n    }\n\n  \/\/\n  std::cout << \"Number of detelem (per plane): \" \n\t    << detElemIdToSlatTypeMap.size()\n\t    << std::endl;\n  std::cout << \"Number of slat types : \" << slattypes.size()\n\t    << std::endl;\n  std::cout << \"(Potential) Problems:\" << std::endl;\n\n  std::map<std::string,std::string>::const_iterator sit;\n\n  for ( sit = problems.begin(); sit != problems.end(); ++sit ) \n    {\n      std::cout << sit->first << \" : \" << sit->second << std::endl;\n    }\n\n  return ok;\n}\n\n\/\/_____________________________________________________________________________\nbool getSegmentation(int detElemId, \n\t\t     AliMpPlaneType bendingornot,\n\t\t     AliMUONVGeometryDESegmentation*& oldSegm,\n\t\t     AliMUONVGeometryDESegmentation*& newSegm)\n{\n  AliMUON* muon = static_cast<AliMUON*>(gAlice->GetModule(\"MUON\"));\n  if (!muon) \n    {\n      gAlice->Init(\"${ALICE_ROOT}\/MUON\/Config.C\");\n      muon = static_cast<AliMUON*>(gAlice->GetModule(\"MUON\"));\n      if (!muon) return error(\"Cannot get MUON !\");\n    }\n\n  int ichamber = detElemId\/100 - 1;\n  \/\/  std::cout << \"muon->Chamber(\" << ichamber << \")\" << std::endl;\n  AliMUONChamber& chamber = muon->Chamber(ichamber);\n\n  int icathode = 1;\n  if ( bendingornot == AliMp::kNonBendingPlane ) icathode = 2;\n\n  AliMUONGeometrySegmentation* gs = chamber.SegmentationModel2(icathode);\n  if (!gs) return error(Form(\"Cannot get cathode %d\",icathode));\n\n  oldSegm = const_cast<AliMUONVGeometryDESegmentation*>(gs->GetDESegmentation(detElemId));\n  if (!oldSegm) \n    {\n      return error(Form(\"Cannot get segmentation for detElemId\",detElemId));\n    }\n\n  newSegm =\n    new AliMUONSt345SlatSegmentationV2(detElemId,bendingornot);\n\n  return true;\n}\n\n\/\/_____________________________________________________________________________\nInt_t countPads(AliMUONVGeometryDESegmentation* seg)\n{\n  if (!seg) return 0;\n\n  Int_t npads = 0;\n\n  for ( Int_t ix = 1; ix <= seg->Npx(); ++ix )\n    {\n      for ( Int_t iy = 1; iy <= seg->Npy(); ++iy )\n\t{\n\t  if ( seg->HasPad(ix,iy) ) ++npads;\n\t}\n    }\n  return npads;\n}\n\n\/\/_____________________________________________________________________________\nbool testIC(Int_t d1, Int_t d2, AliMpPlaneType bendingornot)\n{\n  readDetElemIdToSlatType();\n  AliMUONVGeometryDESegmentation* o;\n  AliMUONVGeometryDESegmentation* n;\n\n  Int_t ntested = 0;\n\n  for ( Int_t d = d1; d <= d2; ++d )\n    {\n      if ( detElemIdToSlatTypeMap.find(d) == detElemIdToSlatTypeMap.end() ) continue;\n      std::cout << d << std::endl;\n      bool ok = getSegmentation(d,bendingornot,o,n);\n      if (!ok) return false;\n\n      Int_t nx = std::max(o->Npx(),n->Npx());\n      Int_t ny = std::max(o->Npy(),n->Npy());\n      \n      for ( Int_t ix = 1; ix <= nx; ++ix )\n\t{\n\t  for ( Int_t iy = 1; iy <= ny; ++iy )\n\t    {\n\t      float xn,yn,zn;\n\t      float xo,yo,zo;\n\t      if ( !o->HasPad(ix,iy) || !n->HasPad(ix,iy) ) continue;\n\t      o->GetPadC(ix,iy,xo,yo,zo);\n\t      n->GetPadC(ix,iy,xn,yn,zn);\n\t      ++ntested;\n\t      if ( !equal(xn,xo) || !equal(yn,yo) )\n\t\t{\n\t\t  printf(\"%4d (%4d,%4d) -> OLD (%e,%e) NEW (%e,%e) DELTA (%e,%e)\\n\",d,ix,iy,xo,yo,xn,yn,xn-xo,yn-yo);\n\t\t}\n\t      \/\/ Now tries to go back to ix,iy from positions\n\t      Int_t nix,niy;\n\t      Int_t oix,oiy;\n\t      o->GetPadI(xo,yo,zo,oix,oiy);\n\t      n->GetPadI(xn,yn,zn,nix,niy);\n\t      std::string msg;\n\t      if ( ix != oix || iy != oiy )\n\t\t{\n\t\t  msg += \"OLD\";\n\t\t}\n\t      if ( ix != nix || iy != niy )\n\t\t{\n\t\t  msg += \"NEW\";\n\t\t}\n\t      if ( !msg.empty() )\n\t\t{\n\t\t  printf(\"Circular test failed for %s : (%4d,%4d) -> OLD (%e,%e) NEW (%e,%e) -> OLD (%4d,%4d) NEW (%4d,%4d)\\n\",msg.c_str(),ix,iy,xo,yo,xn,yn,oix,oiy,nix,niy);\t\t  \n\t\t  return false;\n\t\t}\n\t    }\n\t}      \n      delete n;\n    }\n  std::cout << \"Number of tested pads  = \" << ntested << std::endl;\n\n  return true;\n}\n\n\/\/_____________________________________________________________________________\nvoid countPads(Int_t d1, Int_t d2)\n{\n  readDetElemIdToSlatType();\n\n  Int_t onpads = 0;\n  Int_t nnpads = 0;\n  AliMUONVGeometryDESegmentation* o;\n  AliMUONVGeometryDESegmentation* n;\n\n  AliMpPlaneType pt[] = { AliMp::kNonBendingPlane, AliMp::kBendingPlane };\n\n  for ( int ipt = 0; ipt < 2; ++ipt )\n    {\n      std::cout << ( (pt[ipt] == AliMp::kNonBendingPlane )?\"NonBending\"\n\t\t     : \"Bending\" )\n\t\t<< std::endl;\n      Int_t p_nnpads = 0;\n      Int_t p_onpads = 0;\n      for ( Int_t d = d1; d <= d2; ++d )\n\t{\n\t  if ( detElemIdToSlatTypeMap.find(d) == detElemIdToSlatTypeMap.end() )\n\t    continue; \/\/ skip non-existing detElemId\n\t  bool ok = getSegmentation(d,pt[ipt],o,n);\n\t  if (!ok) return;\n\t  Int_t nn = countPads(n);\n\t  Int_t oo = countPads(o);\n\t  p_nnpads += nn;\n\t  p_onpads += oo;\n\t  printf(\"%4d OLD %5d NEW %5d Delta %6d OLDIXMAX %3d NEWIXMAX %3d\\n\",d,oo,nn,nn-oo,(o?o->Npx():0),n->Npx());\n\t  delete n;\n\t}\n\n      std::cout << \"OLD:\" << p_onpads << std::endl\n\t\t<< \"NEW:\" << p_nnpads << std::endl;\n      nnpads += p_nnpads;\n      onpads += p_onpads;\n    }\n\n  std::cout << \"-----\" << std::endl\n\t    << \"OLD:\" << onpads << std::endl\n\t    << \"NEW:\" << nnpads << std::endl;\n}\n<commit_msg>Removing obsolete mapping macro<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ $Id$\n\n#if !defined(__CINT__) || defined(__MAKECINT__)\n#include <Riostream.h>\n#include <TFile.h>\n#include <TTree.h>\n#include <TMath.h>\n#include <TRandom3.h>\n#include <TChain.h>\n#include <TH2F.h>\n#include <TTimeStamp.h>\n#include \"TreeClasses.C\"\n#include \"EventPool.C\"\n#endif\n\nvoid anaCorr(Int_t nEvents=-1,\n               Int_t nmin=100,\n               Int_t nmax=500,\n               Double_t vzmin=-10,\n               Double_t vzmax=+10,\n               Double_t ptmin1=0.150,\n               Double_t ptmax1=10,\n               Double_t ptmin2=0.150,\n               Double_t ptmax2=10,\n               Double_t etamin1=-1.4,\n               Double_t etamax1=+1.4,\n               Double_t etamin2=-1.4,\n               Double_t etamax2=+1.4,\n               Double_t psize=100,\n               Double_t nmix=10,\n               const char *inFileNames = \"res\/mergedruns\/merged_run*.root\");\n\ninline Double_t DeltaPhi(const MyPart &t1, const MyPart &t2, \n                         Double_t rangeMin = -TMath::Pi()\/2, \n                         Double_t rangeMax = 3*TMath::Pi()\/2);\ninline Double_t DeltaEta(const MyPart &t1, const MyPart &t2);  \ninline Bool_t   InBounds(Double_t val, Double_t min, Double_t max);\ninline Double_t InvMass(const MyPart &p1, const MyPart &p2);\n\n\/\/-----------------------------------------------------------------------------------------------------\n\nvoid anaCorr(Int_t nEvents,\n             Int_t nmin,\n             Int_t nmax,\n             Double_t vzmin,\n             Double_t vzmax,\n             Double_t ptmin1,\n             Double_t ptmax1,\n             Double_t ptmin2,\n             Double_t ptmax2,\n             Double_t etamin1,\n             Double_t etamax1,\n             Double_t etamin2,\n             Double_t etamax2,\n             Double_t psize,\n             Double_t nmix,\n             const char *inFileNames)\n{\n  TChain *tree = new TChain(\"MyTree\");\n  tree->Add(inFileNames);\n  Int_t nents = tree->GetEntries();\n  cout << \"Found \" << nents << \" entries!\" << endl;\n  if (nents<=0)\n    return;\n  if (nEvents>0&&nEvents<nents) { \n    nents=nEvents;\n    cout << \"Using \" << nents << \" entries!\" << endl;\n  }\n\n  if (TClass::GetClass(\"MyPart\"))\n    TClass::GetClass(\"MyPart\")->IgnoreTObjectStreamer();\n  MyHeader   *header = 0;\n  TClonesArray *tracks = 0;\n  TBranch *hBranch = tree->GetBranch(\"header\");\n  hBranch->SetAddress(&header);\n  TBranch* tBranch = tree->GetBranch(\"parts\");\n  tBranch->SetAddress(&tracks);\n\n  EventPool *pool = new EventPool(psize);\n  TH2F *hSig = new TH2F(\"hSig\",\";#Delta#eta;#Delta#phi\",60,-3,3,64,-TMath::Pi()\/2,3*TMath::Pi()\/2);\n  TH2F *hBkg = new TH2F(\"hBgk\",\";#Delta#eta;#Delta#phi\",60,-3,3,64,-TMath::Pi()\/2,3*TMath::Pi()\/2);\n\n  Double_t dpmax = 0.03;\n  Double_t demax = 0.01;\n\n  for (Int_t i=0;i<nents;++i) {\n    hBranch->GetEntry(i);\n    if (header->fIsPileupSPD)\n      continue;\n    if ((header->fVz<vzmin) ||\n        (header->fVz>vzmax) )\n      continue;\n\/\/    if ((header->fVc<50) ||\n\/\/        (header->fVc>nmax) )\n\/\/      continue;\n    if ((header->fNSelTracks<nmin) ||\n        (header->fNSelTracks>nmax))\n      continue;\n    tBranch->GetEntry(i);\n\n    if (pool->Depth()==psize) {\n      cout << \"Working on event \" << i << endl;\n\n      Int_t ntracks = tracks->GetEntries();\n      for (Int_t t1=0;t1<ntracks;++t1) {\n        MyPart *part1 = (MyPart*)tracks->At(t1);\n        if (!InBounds(part1->Pt(),ptmin1,ptmax1))\n          continue;\n        if (!InBounds(part1->Eta(),etamin1,etamax1))\n          continue;\n        for (Int_t t2=t1+1;t2<ntracks;++t2) {\n          MyPart *part2 = (MyPart*)tracks->At(t2);\n          if (!InBounds(part2->Pt(),ptmin2,ptmax2))\n            continue;\n          if (!InBounds(part2->Eta(),etamin2,etamax2))\n            continue;\n          \/\/if (InvMass(*part1,*part2)<0.001)\n          \/\/  continue;\n          Double_t dphi = DeltaPhi(*part1,*part2);\n          Double_t deta = DeltaEta(*part1,*part2);\n          Double_t dr = dphi*dphi\/(dpmax*dpmax) + deta*deta\/(demax*demax);\n          if(dr>1)\n            hSig->Fill(deta,dphi);\n\n          Int_t mtracks = nmix;\n          for (Int_t t3=0;t3<mtracks;) {\n            MyPart *part2 = pool->GetRandomTrack();\n            if (!InBounds(part2->Pt(),ptmin2,ptmax2))\n              continue;\n            if (!InBounds(part2->Eta(),etamin2,etamax2))\n              continue;\n            \/\/if (InvMass(*part1,*part2)<0.001)\n            \/\/  continue;\n            Double_t dphi = DeltaPhi(*part1,*part2);\n            Double_t deta = DeltaEta(*part1,*part2);\n            Double_t dr = dphi*dphi\/(dpmax*dpmax) + deta*deta\/(demax*demax);\n            if(dr>1)\n              hBkg->Fill(deta,dphi);\n            ++t3;\n          }\n        }\n      }\n    } else {\n      pool->PrintInfo();\n      pool->UpdatePool(i,header,tracks);\n    }\n  }\n\n  TCanvas *c1 = new TCanvas(\"cSig\");\n  hSig->Draw(\"surf1\");\n  TCanvas *c2 = new TCanvas(\"cBkg\");\n  hBkg->Draw(\"surf1\");\n  TH2F *hMix1=(TH2F*)hSig->Clone(\"mix1\");\n  hMix1->Divide(hSig,hBkg,nmix,1);\n  TCanvas *c3 = new TCanvas(\"cMix1\");\n  hMix1->Draw(\"surf1\");\n  TH2F *hMix2=(TH2F*)hSig->Clone(\"mix2\");\n  hMix2->Divide(hSig,hBkg,hBkg->Integral(),hSig->Integral());\n  TCanvas *c4 = new TCanvas(\"cMix2\");\n  hMix2->Draw(\"surf1\");\n  TTimeStamp t;\n  TString fname(Form(\"histout-%d.root\",t.GetSec()));\n  TFile outfile(fname,\"recreate\");\n  hSig->Write();\n  hBkg->Write();\n  hMix1->Write();\n  hMix2->Write();\n}\n\n\/\/-----------------------------------------------------------------------------------------------------\n\nBool_t InBounds(Double_t val, Double_t min, Double_t max)\n{\n  if (val<min)\n    return 0;\n  if (val>max)\n    return 0;\n  return 1;\n}\n\nDouble_t DeltaPhi(const MyPart &t1, const MyPart &t2,\n                  Double_t rangeMin, Double_t rangeMax)\n{\n  Double_t dphi = -999;\n  Double_t pi = TMath::Pi();\n    Double_t phia = t1.Phi();  \n  Double_t phib = t2.Phi();  \n  \n  if (phia < 0)         phia += 2*pi;\n  else if (phia > 2*pi) phia -= 2*pi;\n  if (phib < 0)         phib += 2*pi;\n  else if (phib > 2*pi) phib -= 2*pi;\n  dphi = phib - phia;\n  if (dphi < rangeMin)      dphi += 2*pi;\n  else if (dphi > rangeMax) dphi -= 2*pi;\n  \n  return dphi;\n}\n\nDouble_t DeltaEta(const MyPart &t1, const MyPart &t2)\n{\n  return t1.Eta() - t2.Eta();\n}\n\nDouble_t InvMass(const MyPart &p1, const MyPart &p2)\n{\n  Double_t px1 = p1.Px();\n  Double_t py1 = p1.Py();\n  Double_t pz1 = p1.Pz();\n  Double_t px2 = p2.Px();\n  Double_t py2 = p2.Py();\n  Double_t pz2 = p2.Pz();\n\n  Double_t pm1 = TMath::Sqrt(px1*px1+py1*py1+pz1*pz1);\n  Double_t pm2 = TMath::Sqrt(px2*px2+py2*py2+pz1*pz2);\n  Double_t p12 = px1*px2+py1*py2+pz1*pz2;\n  \n  Double_t m = TMath::Sqrt(pm1*pm2-p12);\n  return m;\n}\n\n<commit_msg>compile fix<commit_after>\/\/ $Id$\n\n#if !defined(__CINT__) || defined(__MAKECINT__)\n#include <Riostream.h>\n#include <TFile.h>\n#include <TTree.h>\n#include <TMath.h>\n#include <TRandom3.h>\n#include <TChain.h>\n#include <TH2F.h>\n#include <TTimeStamp.h>\n#include \"TreeClasses.h\"\n#include \"EventPool.h\"\n#endif\n\nvoid anaCorr(Int_t nEvents=-1,\n               Int_t nmin=100,\n               Int_t nmax=500,\n               Double_t vzmin=-10,\n               Double_t vzmax=+10,\n               Double_t ptmin1=0.150,\n               Double_t ptmax1=10,\n               Double_t ptmin2=0.150,\n               Double_t ptmax2=10,\n               Double_t etamin1=-1.4,\n               Double_t etamax1=+1.4,\n               Double_t etamin2=-1.4,\n               Double_t etamax2=+1.4,\n               Double_t psize=100,\n               Double_t nmix=10,\n               const char *inFileNames = \"res\/mergedruns\/merged_run*.root\");\n\ninline Double_t DeltaPhi(const MyPart &t1, const MyPart &t2, \n                         Double_t rangeMin = -TMath::Pi()\/2, \n                         Double_t rangeMax = 3*TMath::Pi()\/2);\ninline Double_t DeltaEta(const MyPart &t1, const MyPart &t2);  \ninline Bool_t   InBounds(Double_t val, Double_t min, Double_t max);\ninline Double_t InvMass(const MyPart &p1, const MyPart &p2);\n\n\/\/-----------------------------------------------------------------------------------------------------\n\nvoid anaCorr(Int_t nEvents,\n             Int_t nmin,\n             Int_t nmax,\n             Double_t vzmin,\n             Double_t vzmax,\n             Double_t ptmin1,\n             Double_t ptmax1,\n             Double_t ptmin2,\n             Double_t ptmax2,\n             Double_t etamin1,\n             Double_t etamax1,\n             Double_t etamin2,\n             Double_t etamax2,\n             Double_t psize,\n             Double_t nmix,\n             const char *inFileNames)\n{\n  TChain *tree = new TChain(\"MyTree\");\n  tree->Add(inFileNames);\n  Int_t nents = tree->GetEntries();\n  cout << \"Found \" << nents << \" entries!\" << endl;\n  if (nents<=0)\n    return;\n  if (nEvents>0&&nEvents<nents) { \n    nents=nEvents;\n    cout << \"Using \" << nents << \" entries!\" << endl;\n  }\n\n  if (TClass::GetClass(\"MyPart\"))\n    TClass::GetClass(\"MyPart\")->IgnoreTObjectStreamer();\n  MyHeader   *header = 0;\n  TClonesArray *tracks = 0;\n  TBranch *hBranch = tree->GetBranch(\"header\");\n  hBranch->SetAddress(&header);\n  TBranch* tBranch = tree->GetBranch(\"parts\");\n  tBranch->SetAddress(&tracks);\n\n  EventPool *pool = new EventPool(psize);\n  TH2F *hSig = new TH2F(\"hSig\",\";#Delta#eta;#Delta#phi\",60,-3,3,64,-TMath::Pi()\/2,3*TMath::Pi()\/2);\n  TH2F *hBkg = new TH2F(\"hBgk\",\";#Delta#eta;#Delta#phi\",60,-3,3,64,-TMath::Pi()\/2,3*TMath::Pi()\/2);\n\n  Double_t dpmax = 0.03;\n  Double_t demax = 0.01;\n\n  for (Int_t i=0;i<nents;++i) {\n    hBranch->GetEntry(i);\n    if (header->fIsPileupSPD)\n      continue;\n    if ((header->fVz<vzmin) ||\n        (header->fVz>vzmax) )\n      continue;\n\/\/    if ((header->fVc<50) ||\n\/\/        (header->fVc>nmax) )\n\/\/      continue;\n    if ((header->fNSelTracks<nmin) ||\n        (header->fNSelTracks>nmax))\n      continue;\n    tBranch->GetEntry(i);\n\n    if (pool->Depth()==psize) {\n      cout << \"Working on event \" << i << endl;\n\n      Int_t ntracks = tracks->GetEntries();\n      for (Int_t t1=0;t1<ntracks;++t1) {\n        MyPart *part1 = (MyPart*)tracks->At(t1);\n        if (!InBounds(part1->Pt(),ptmin1,ptmax1))\n          continue;\n        if (!InBounds(part1->Eta(),etamin1,etamax1))\n          continue;\n        for (Int_t t2=t1+1;t2<ntracks;++t2) {\n          MyPart *part2 = (MyPart*)tracks->At(t2);\n          if (!InBounds(part2->Pt(),ptmin2,ptmax2))\n            continue;\n          if (!InBounds(part2->Eta(),etamin2,etamax2))\n            continue;\n          \/\/if (InvMass(*part1,*part2)<0.001)\n          \/\/  continue;\n          Double_t dphi = DeltaPhi(*part1,*part2);\n          Double_t deta = DeltaEta(*part1,*part2);\n          Double_t dr = dphi*dphi\/(dpmax*dpmax) + deta*deta\/(demax*demax);\n          if(dr>1)\n            hSig->Fill(deta,dphi);\n\n          Int_t mtracks = nmix;\n          for (Int_t t3=0;t3<mtracks;) {\n            MyPart *part2 = pool->GetRandomTrack();\n            if (!InBounds(part2->Pt(),ptmin2,ptmax2))\n              continue;\n            if (!InBounds(part2->Eta(),etamin2,etamax2))\n              continue;\n            \/\/if (InvMass(*part1,*part2)<0.001)\n            \/\/  continue;\n            Double_t dphi = DeltaPhi(*part1,*part2);\n            Double_t deta = DeltaEta(*part1,*part2);\n            Double_t dr = dphi*dphi\/(dpmax*dpmax) + deta*deta\/(demax*demax);\n            if(dr>1)\n              hBkg->Fill(deta,dphi);\n            ++t3;\n          }\n        }\n      }\n    } else {\n      pool->PrintInfo();\n      pool->UpdatePool(i,header,tracks);\n    }\n  }\n\n  TCanvas *c1 = new TCanvas(\"cSig\");\n  hSig->Draw(\"surf1\");\n  TCanvas *c2 = new TCanvas(\"cBkg\");\n  hBkg->Draw(\"surf1\");\n  TH2F *hMix1=(TH2F*)hSig->Clone(\"mix1\");\n  hMix1->Divide(hSig,hBkg,nmix,1);\n  TCanvas *c3 = new TCanvas(\"cMix1\");\n  hMix1->Draw(\"surf1\");\n  TH2F *hMix2=(TH2F*)hSig->Clone(\"mix2\");\n  hMix2->Divide(hSig,hBkg,hBkg->Integral(),hSig->Integral());\n  TCanvas *c4 = new TCanvas(\"cMix2\");\n  hMix2->Draw(\"surf1\");\n  TTimeStamp t;\n  TString fname(Form(\"histout-%d.root\",t.GetSec()));\n  TFile outfile(fname,\"recreate\");\n  hSig->Write();\n  hBkg->Write();\n  hMix1->Write();\n  hMix2->Write();\n}\n\n\/\/-----------------------------------------------------------------------------------------------------\n\nBool_t InBounds(Double_t val, Double_t min, Double_t max)\n{\n  if (val<min)\n    return 0;\n  if (val>max)\n    return 0;\n  return 1;\n}\n\nDouble_t DeltaPhi(const MyPart &t1, const MyPart &t2,\n                  Double_t rangeMin, Double_t rangeMax)\n{\n  Double_t dphi = -999;\n  Double_t pi = TMath::Pi();\n    Double_t phia = t1.Phi();  \n  Double_t phib = t2.Phi();  \n  \n  if (phia < 0)         phia += 2*pi;\n  else if (phia > 2*pi) phia -= 2*pi;\n  if (phib < 0)         phib += 2*pi;\n  else if (phib > 2*pi) phib -= 2*pi;\n  dphi = phib - phia;\n  if (dphi < rangeMin)      dphi += 2*pi;\n  else if (dphi > rangeMax) dphi -= 2*pi;\n  \n  return dphi;\n}\n\nDouble_t DeltaEta(const MyPart &t1, const MyPart &t2)\n{\n  return t1.Eta() - t2.Eta();\n}\n\nDouble_t InvMass(const MyPart &p1, const MyPart &p2)\n{\n  Double_t px1 = p1.Px();\n  Double_t py1 = p1.Py();\n  Double_t pz1 = p1.Pz();\n  Double_t px2 = p2.Px();\n  Double_t py2 = p2.Py();\n  Double_t pz2 = p2.Pz();\n\n  Double_t pm1 = TMath::Sqrt(px1*px1+py1*py1+pz1*pz1);\n  Double_t pm2 = TMath::Sqrt(px2*px2+py2*py2+pz1*pz2);\n  Double_t p12 = px1*px2+py1*py2+pz1*pz2;\n  \n  Double_t m = TMath::Sqrt(pm1*pm2-p12);\n  return m;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  ColecoVision.cpp\n\/\/  Clock Signal\n\/\/\n\/\/  Created by Thomas Harte on 23\/02\/2018.\n\/\/  Copyright © 2018 Thomas Harte. All rights reserved.\n\/\/\n\n#include \"ColecoVision.hpp\"\n\n#include \"..\/..\/Processors\/Z80\/Z80.hpp\"\n\n#include \"..\/..\/Components\/9918\/9918.hpp\"\n\n#include \"..\/CRTMachine.hpp\"\n\n#include \"..\/..\/ClockReceiver\/ForceInline.hpp\"\n\nnamespace Coleco {\nnamespace Vision {\n\nclass ConcreteMachine:\n\tpublic Machine,\n\tpublic CPU::Z80::BusHandler,\n\tpublic CRTMachine::Machine {\n\n\tpublic:\n\t\tConcreteMachine() : z80_(*this) {\n\t\t\tset_clock_rate(3579545);\n\t\t}\n\n\t\tvoid setup_output(float aspect_ratio) override {\n\t\t\tvdp_.reset(new TI::TMS9918(TI::TMS9918::TMS9918A));\n\t\t\tget_crt()->set_output_device(Outputs::CRT::OutputDevice::Television);\n\t\t}\n\n\t\tvoid close_output() override {\n\t\t\tvdp_.reset();\n\t\t}\n\n\t\tOutputs::CRT::CRT *get_crt() override {\n\t\t\treturn vdp_->get_crt();\n\t\t}\n\n\t\tOutputs::Speaker::Speaker *get_speaker() override {\n\t\t\treturn nullptr;\n\t\t}\n\n\t\tvoid run_for(const Cycles cycles) override {\n\t\t\tz80_.run_for(cycles);\n\t\t}\n\n\t\t\/\/ Obtains the system ROMs.\n\t\tbool set_rom_fetcher(const std::function<std::vector<std::unique_ptr<std::vector<uint8_t>>>(const std::string &machine, const std::vector<std::string> &names)> &roms_with_names) override {\n\t\t\tauto roms = roms_with_names(\n\t\t\t\t\"ColecoVision\",\n\t\t\t\t{\n\t\t\t\t\t\"coleco.rom\"\n\t\t\t\t});\n\n\t\t\tif(!roms[0]) return false;\n\n\t\t\tbios_ = *roms[0];\n\t\t\tbios_.resize(8192);\n\n\t\t\treturn true;\n\t\t}\n\n\t\t\/\/ MARK: Z80::BusHandler\n\t\tforceinline HalfCycles perform_machine_cycle(const CPU::Z80::PartialMachineCycle &cycle) {\n\t\t\tif(time_until_interrupt_ > 0) {\n\t\t\t\ttime_until_interrupt_ -= cycle.length;\n\t\t\t\tif(time_until_interrupt_ <= HalfCycles(0)) {\n\t\t\t\t\tz80_.set_non_maskable_interrupt_line(true, time_until_interrupt_);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tuint16_t address = cycle.address ? *cycle.address : 0x0000;\n\t\t\tswitch(cycle.operation) {\n\t\t\t\tcase CPU::Z80::PartialMachineCycle::ReadOpcode:\n\t\t\t\tcase CPU::Z80::PartialMachineCycle::Read:\n\t\t\t\t\tif(address < 0x2000) {\n\t\t\t\t\t\t*cycle.value = bios_[address];\n\t\t\t\t\t} else if(address >= 0x6000 && address < 0x8000) {\n\t\t\t\t\t\t*cycle.value = ram_[address & 1023];\n\t\t\t\t\t} else {\n\t\t\t\t\t\t*cycle.value = 0xff;\n\t\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\t\tcase CPU::Z80::PartialMachineCycle::Write:\n\t\t\t\t\tif(address >= 0x6000 && address < 0x8000) {\n\t\t\t\t\t\tram_[address & 1023] = *cycle.value;\n\t\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\t\tcase CPU::Z80::PartialMachineCycle::Input:\n\t\t\t\t\tswitch((address >> 5) & 7) {\n\t\t\t\t\t\tcase 5:\n\t\t\t\t\t\t\tvdp_->run_for(time_since_vdp_update_.flush());\n\t\t\t\t\t\t\t*cycle.value = vdp_->get_register(address);\n\t\t\t\t\t\t\tz80_.set_non_maskable_interrupt_line(vdp_->get_interrupt_line());\n\t\t\t\t\t\t\ttime_until_interrupt_ = vdp_->get_time_until_interrupt();\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t*cycle.value = 0xff;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\t\tcase CPU::Z80::PartialMachineCycle::Output:\n\t\t\t\t\tswitch((address >> 5) & 7) {\n\t\t\t\t\t\tcase 5:\n\t\t\t\t\t\t\tvdp_->run_for(time_since_vdp_update_.flush());\n\t\t\t\t\t\t\tvdp_->set_register(address, *cycle.value);\n\t\t\t\t\t\t\tz80_.set_non_maskable_interrupt_line(vdp_->get_interrupt_line());\n\t\t\t\t\t\t\ttime_until_interrupt_ = vdp_->get_time_until_interrupt();\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tdefault: break;\n\t\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\ttime_since_vdp_update_ += cycle.length;\n\t\t\treturn HalfCycles(0);\n\t\t}\n\n\t\tvoid flush() {\n\t\t\tvdp_->run_for(time_since_vdp_update_.flush());\n\t\t}\n\n\tprivate:\n\t\tCPU::Z80::Processor<ConcreteMachine, false, false> z80_;\n\t\tstd::unique_ptr<TI::TMS9918> vdp_;\n\n\t\tstd::vector<uint8_t> bios_;\n\t\tuint8_t ram_[1024];\n\n\t\tHalfCycles time_since_vdp_update_;\n\t\tHalfCycles time_until_interrupt_;\n};\n\n}\n}\n\nusing namespace Coleco::Vision;\n\nMachine *Machine::ColecoVision() {\n\treturn new ConcreteMachine;\n}\n\nMachine::~Machine() {}\n<commit_msg>The ColecoVision now accepts and loads cartridges.<commit_after>\/\/\n\/\/  ColecoVision.cpp\n\/\/  Clock Signal\n\/\/\n\/\/  Created by Thomas Harte on 23\/02\/2018.\n\/\/  Copyright © 2018 Thomas Harte. All rights reserved.\n\/\/\n\n#include \"ColecoVision.hpp\"\n\n#include \"..\/..\/Processors\/Z80\/Z80.hpp\"\n\n#include \"..\/..\/Components\/9918\/9918.hpp\"\n\n#include \"..\/CRTMachine.hpp\"\n#include \"..\/ConfigurationTarget.hpp\"\n\n#include \"..\/..\/ClockReceiver\/ForceInline.hpp\"\n\nnamespace Coleco {\nnamespace Vision {\n\nclass ConcreteMachine:\n\tpublic Machine,\n\tpublic CPU::Z80::BusHandler,\n\tpublic CRTMachine::Machine,\n\tpublic ConfigurationTarget::Machine {\n\n\tpublic:\n\t\tConcreteMachine() : z80_(*this) {\n\t\t\tset_clock_rate(3579545);\n\t\t}\n\n\t\tvoid setup_output(float aspect_ratio) override {\n\t\t\tvdp_.reset(new TI::TMS9918(TI::TMS9918::TMS9918A));\n\t\t\tget_crt()->set_output_device(Outputs::CRT::OutputDevice::Television);\n\t\t}\n\n\t\tvoid close_output() override {\n\t\t\tvdp_.reset();\n\t\t}\n\n\t\tOutputs::CRT::CRT *get_crt() override {\n\t\t\treturn vdp_->get_crt();\n\t\t}\n\n\t\tOutputs::Speaker::Speaker *get_speaker() override {\n\t\t\treturn nullptr;\n\t\t}\n\n\t\tvoid run_for(const Cycles cycles) override {\n\t\t\tz80_.run_for(cycles);\n\t\t}\n\n\t\tvoid configure_as_target(const Analyser::Static::Target &target) override {\n\t\t\t\/\/ Insert the media.\n\t\t\tinsert_media(target.media);\n\t\t}\n\n\t\tbool insert_media(const Analyser::Static::Media &media) override {\n\t\t\tif(!media.cartridges.empty()) {\n\t\t\t\tconst auto &segment = media.cartridges.front()->get_segments().front();\n\t\t\t\tcartridge_ = segment.data;\n\t\t\t}\n\n\t\t\treturn true;\n\t\t}\n\n\t\t\/\/ Obtains the system ROMs.\n\t\tbool set_rom_fetcher(const std::function<std::vector<std::unique_ptr<std::vector<uint8_t>>>(const std::string &machine, const std::vector<std::string> &names)> &roms_with_names) override {\n\t\t\tauto roms = roms_with_names(\n\t\t\t\t\"ColecoVision\",\n\t\t\t\t{\n\t\t\t\t\t\"coleco.rom\"\n\t\t\t\t});\n\n\t\t\tif(!roms[0]) return false;\n\n\t\t\tbios_ = *roms[0];\n\t\t\tbios_.resize(8192);\n\n\t\t\treturn true;\n\t\t}\n\n\t\t\/\/ MARK: Z80::BusHandler\n\t\tforceinline HalfCycles perform_machine_cycle(const CPU::Z80::PartialMachineCycle &cycle) {\n\t\t\tif(time_until_interrupt_ > 0) {\n\t\t\t\ttime_until_interrupt_ -= cycle.length;\n\t\t\t\tif(time_until_interrupt_ <= HalfCycles(0)) {\n\t\t\t\t\tz80_.set_non_maskable_interrupt_line(true, time_until_interrupt_);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tuint16_t address = cycle.address ? *cycle.address : 0x0000;\n\t\t\tswitch(cycle.operation) {\n\t\t\t\tcase CPU::Z80::PartialMachineCycle::ReadOpcode:\n\t\t\t\tcase CPU::Z80::PartialMachineCycle::Read:\n\t\t\t\t\tif(address < 0x2000) {\n\t\t\t\t\t\t*cycle.value = bios_[address];\n\t\t\t\t\t} else if(address >= 0x6000 && address < 0x8000) {\n\t\t\t\t\t\t*cycle.value = ram_[address & 1023];\n\t\t\t\t\t} else if(address >= 0x8000 && address < 0x8000 + cartridge_.size()) {\n\t\t\t\t\t\t*cycle.value = cartridge_[address - 0x8000];\n\t\t\t\t\t} else {\n\t\t\t\t\t\t*cycle.value = 0xff;\n\t\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\t\tcase CPU::Z80::PartialMachineCycle::Write:\n\t\t\t\t\tif(address >= 0x6000 && address < 0x8000) {\n\t\t\t\t\t\tram_[address & 1023] = *cycle.value;\n\t\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\t\tcase CPU::Z80::PartialMachineCycle::Input:\n\t\t\t\t\tswitch((address >> 5) & 7) {\n\t\t\t\t\t\tcase 5:\n\t\t\t\t\t\t\tvdp_->run_for(time_since_vdp_update_.flush());\n\t\t\t\t\t\t\t*cycle.value = vdp_->get_register(address);\n\t\t\t\t\t\t\tz80_.set_non_maskable_interrupt_line(vdp_->get_interrupt_line());\n\t\t\t\t\t\t\ttime_until_interrupt_ = vdp_->get_time_until_interrupt();\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t*cycle.value = 0xff;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\t\tcase CPU::Z80::PartialMachineCycle::Output:\n\t\t\t\t\tswitch((address >> 5) & 7) {\n\t\t\t\t\t\tcase 5:\n\t\t\t\t\t\t\tvdp_->run_for(time_since_vdp_update_.flush());\n\t\t\t\t\t\t\tvdp_->set_register(address, *cycle.value);\n\t\t\t\t\t\t\tz80_.set_non_maskable_interrupt_line(vdp_->get_interrupt_line());\n\t\t\t\t\t\t\ttime_until_interrupt_ = vdp_->get_time_until_interrupt();\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tdefault: break;\n\t\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\ttime_since_vdp_update_ += cycle.length;\n\t\t\treturn HalfCycles(0);\n\t\t}\n\n\t\tvoid flush() {\n\t\t\tvdp_->run_for(time_since_vdp_update_.flush());\n\t\t}\n\n\tprivate:\n\t\tCPU::Z80::Processor<ConcreteMachine, false, false> z80_;\n\t\tstd::unique_ptr<TI::TMS9918> vdp_;\n\n\t\tstd::vector<uint8_t> bios_;\n\t\tstd::vector<uint8_t> cartridge_;\n\t\tuint8_t ram_[1024];\n\n\t\tHalfCycles time_since_vdp_update_;\n\t\tHalfCycles time_until_interrupt_;\n};\n\n}\n}\n\nusing namespace Coleco::Vision;\n\nMachine *Machine::ColecoVision() {\n\treturn new ConcreteMachine;\n}\n\nMachine::~Machine() {}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * Este archivo tendra lo que el transmisor en el raspberry pi hara\n *\/\n#include <stdio.h>\n\n#include <iostream>\n#include <stdlib.h>\n#include <unistd.h>\n#include <getopt.h>\n#include <string.h>\n#include <string>\n#include <cstdlib>\n\n#include \"..\/RF24.h\"\n\nusing namespace std;\n\/\/ Radio pipe addresses for the 2 nodes to communicate.\n\/\/ First pipe is for writing, 2nd, 3rd, 4th, 5th & 6th is for reading...\n\/\/ Pipe0 in bytes is \"serv1\" for mirf compatibility\n\/*const uint64_t pipes[6] = { 0x7365727631LL, \n                            0xF0F0F0F0E1LL, \n                            0xF0F0F0F0E2LL, \n                            0xF0F0F0F0E3LL, \n                            0xF0F0F0F0E4, \n                            0xF0F0F0F0E5 };\n*\/\nconst uint64_t pipes[2] = { 0xF0F0F0F0E1LL, \/\/para escribir\n                            0x7365727631LL \/\/ Para leer\n};\n\/\/ CE and CSN pins On header using GPIO numbering (not pin numbers)\nRF24 radio(\"\/dev\/spidev0.0\",8000000,25);  \/\/ Setup for GPIO 25 CSN\n\nvoid setup(void){\n    printf(\"\\nSetup - Preparando interface\\n\");\n    radio.begin();\/\/\n    radio.enableDynamicPayloads();\/\/\n    radio.setAutoAck(1);\n    radio.setRetries(15,15);\/\/\n    \n    radio.setDataRate(RF24_1MBPS);\/\/\n    radio.setPALevel(RF24_PA_MAX);\/\/\n    radio.setChannel(76);\/\/\n    radio.setCRCLength(RF24_CRC_16);  \n\n    radio.openWritingPipe(pipes[0]);\n    radio.openReadingPipe(1,pipes[1]);\n    \n    printf(\"\\nSetup - A continuacion, detalles:\\n\");\n    radio.printDetails();\n    \n}\nbool enviarMensaje(char* mensaje){    \n    radio.stopListening();\n    printf(\"Mensaje recibido: %s\\n\",mensaje);\n    int i=0;\n    for(;mensaje[i]!='\\0';){\n       i++;       \n    }\n    bool ok = radio.write(&mensaje,\/*size:*\/i);\n    if(ok){\n        printf(\"Ok . . . \");        \n    }else{\n        printf(\"Fallo envio.\\n\\r\");        \n    }\n    \/\/En espera del ACK\n    radio.startListening();\n    \/\/Se toma el tiempo de espera\n    unsigned long se_empieza = __millis();\n    bool timeout = false;\n    while(! radio.available() && ! timeout ){\n        __msleep(10);\n    if (__millis() - se_empieza > 5000 )\n      timeout = true;\n    }\n    if( timeout ){\n        \/\/Si se espero mucho, la transmision fallo\n        printf(\"Error, El tiempo ya paso.\\n\\r\");\n        radio.printDetails();\n        return false;\n    }else{\n        \/\/Si se recibio un mensaje a tiempo, se lee\n        unsigned long got_time;\n        radio.read( &got_time, sizeof(unsigned long) );\n        printf(\"Se recibio respuesta %lu, retraso envio: %lu\\n\\r\",got_time,__millis()-got_time);\n        return true;        \n    }\n    \n}\nint main (int argc, char ** argv){\n    char opcion;\n    setup();\n    int contador=0;\n    \/\/definiendo opciones\n    while((opcion = getopt(argc,argv,\"f:\"))!=-1){\n        if(opcion=='f'){\n            printf(\"\\nEnviando comando!\\n\");\n            enviarMensaje(optarg);\n        }else{\n            \/\/imprimiendo ayuda\n            printf(\"\\n\\r====Ayuda=======\\n\");\n            printf(\"\\n\\rUsar la opcion -f  \");\n            printf(\"\\nCodigo hex para enviar.\");\n            printf(\"\\n\\rPor ejemplo: \");\n            printf(\"\\nsudo .\/rpi-transmiter -f 0x880001AA\\n\");\n        }\n        \/\/retornar 0 si todo salio bien, 2 si no fue asi\n        if ( contador < 5){\n         return 0;\n        }else{\n         return 2;\n        }\n    }\n    \n}<commit_msg>little changes, in order to test again, the first time didn't work, but compiled well :)<commit_after>\/**\n * Este archivo tendra lo que el transmisor en el raspberry pi hara\n *\/\n#include <stdio.h>\n\n#include <iostream>\n#include <stdlib.h>\n#include <unistd.h>\n#include <getopt.h>\n#include <string.h>\n#include <string>\n#include <cstdlib>\n\n#include \"..\/RF24.h\"\n#define RF_SETUP 0X17\n\nusing namespace std;\n\/\/ Radio pipe addresses for the 2 nodes to communicate.\n\/\/ First pipe is for writing, 2nd, 3rd, 4th, 5th & 6th is for reading...\n\/\/ Pipe0 in bytes is \"serv1\" for mirf compatibility\n\/*const uint64_t pipes[6] = { 0x7365727631LL, \n                            0xF0F0F0F0E1LL, \n                            0xF0F0F0F0E2LL, \n                            0xF0F0F0F0E3LL, \n                            0xF0F0F0F0E4, \n                            0xF0F0F0F0E5 };\n*\/\nconst uint64_t pipes[2] = { 0xF0F0F0F0E1LL, \/\/para escribir\n                            0x7365727631LL \/\/ Para leer\n};\n\/\/ CE and CSN pins On header using GPIO numbering (not pin numbers)\nRF24 radio(\"\/dev\/spidev0.0\",8000000,25);  \/\/ Setup for GPIO 25 CSN\n\nvoid setup(void){\n    printf(\"\\nSetup - Preparando interface\\n\");\n    radio.begin();\/\/\n    radio.enableDynamicPayloads();\/\/\n    radio.setAutoAck(1);\n    radio.setRetries(15,15);\/\/\n    \n    radio.setDataRate(RF24_1MBPS);\/\/\n    radio.setPALevel(RF24_PA_MAX);\/\/\n    radio.setChannel(76);\/\/\n    radio.setCRCLength(RF24_CRC_16);  \n\n    radio.openWritingPipe(pipes[0]);\n    radio.openReadingPipe(1,pipes[1]);\n    \n    printf(\"\\nSetup - A continuacion, detalles:\\n\");\n    radio.printDetails();\n    \n}\nbool enviarMensaje(char* mensaje){    \n    radio.stopListening();\n    printf(\"Mensaje recibido: %s\\n\",mensaje);\n    int i=0;\n    for(;mensaje[i]!='\\0';){\n       i++;       \n    }\n    bool ok = radio.write(\/*&*\/ mensaje,\/*size:*\/i);\n    if(ok){\n        printf(\"Ok . . . \\n\\r\");        \n    }else{\n        printf(\"Fallo envio.\\n\\r\");        \n    }\n    \/\/En espera del ACK\n    radio.startListening();\n    _msleep(20);\n    \/\/Se toma el tiempo de espera\n    unsigned long se_empieza = __millis();\n    bool timeout = false;\n    while( radio.available() && ! timeout ){\n\tuint8_t len = radio.getDynamicPayloadSize();\n\tradio.read(receivePayload,len);\n\tunsigned long got_time;\n\treceivePayload[len]=0;\n\tprintf(\"inBuffer: %s\\n\\r\",receivePayload);\n\t\/\/Comparacion de lo enviado con lo recivido\n\tif( !strcmp(mensaje,receivePayload) ){\n\t    radio.read(&got_time, sizeof(unsigned long) );\n\t    printf(\"Se recibio respuesta %lu, retraso envio: %lu\\n\\r\");\n\t    return true;\n\t}\n    \t    \n         __msleep(10);\n    \tif (__millis() - se_empieza > 5000 )\n      \ttimeout = true;\n\n    }\n    \/*if( timeout ){\n        \/\/Si se espero mucho, la transmision fallo\n        printf(\"Error, El tiempo ya paso.\\n\\r\");\n        radio.printDetails();\n        return false;\n    }else{\n        \/\/Si se recibio un mensaje a tiempo, se lee\n        unsigned long got_time;\n        radio.read( &got_time, sizeof(unsigned long) );\n        printf(\"Se recibio respuesta %lu, retraso envio: %lu\\n\\r\",got_time,__millis()-got_time);\n        return true;        \n    }\n    *\/\n\n    \n}\nint main (int argc, char ** argv){\n    char opcion;\n    setup();\n    int contador=0;\n    \/\/definiendo opciones\n    while((opcion = getopt(argc,argv,\"f:\"))!=-1){\n        if(opcion=='f'){\n            printf(\"\\nEnviando comando!\\n\");\n            enviarMensaje(optarg);\n        }else{\n            \/\/imprimiendo ayuda\n            printf(\"\\n\\r====Ayuda=======\\n\");\n            printf(\"\\n\\rUsar la opcion -f  \");\n            printf(\"\\nCodigo hex para enviar.\");\n            printf(\"\\n\\rPor ejemplo: \");\n            printf(\"\\nsudo .\/rpi-transmiter -f 0x880001AA\\n\");\n        }\n        \/\/retornar 0 si todo salio bien, 2 si no fue asi\n        if ( contador < 5){\n         return 0;\n        }else{\n         return 2;\n        }\n    }\n    \n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  SerialPort.cpp\n\/\/  Clock Signal\n\/\/\n\/\/  Created by Thomas Harte on 12\/10\/2019.\n\/\/  Copyright © 2019 Thomas Harte. All rights reserved.\n\/\/\n\n#include \"SerialPort.hpp\"\n\nusing namespace Serial;\n\nvoid Line::set_writer_clock_rate(int clock_rate) {\n\tclock_rate_ = clock_rate;\n}\n\nvoid Line::advance_writer(int cycles) {\n\tremaining_delays_ = std::max(remaining_delays_ - cycles, 0);\n\twhile(!events_.empty()) {\n\t\tif(events_.front().delay < cycles) {\n\t\t\tcycles -= events_.front().delay;\n\t\t\tauto iterator = events_.begin() + 1;\n\t\t\twhile(iterator != events_.end() && iterator->type != Event::Delay) {\n\t\t\t\tlevel_ = iterator->type == Event::SetHigh;\n\t\t\t\t++iterator;\n\t\t\t}\n\t\t\tevents_.erase(events_.begin(), iterator);\n\t\t} else {\n\t\t\tevents_.front().delay -= cycles;\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\nvoid Line::write(bool level) {\n\tif(!events_.empty()) {\n\t\tevents_.emplace_back();\n\t\tevents_.back().type = level ? Event::SetHigh : Event::SetLow;\n\t} else {\n\t\tlevel_ = level;\n\t}\n}\n\nvoid Line::write(int cycles, int count, int levels) {\n\tremaining_delays_ += count*cycles;\n\n\tauto event = events_.size();\n\tevents_.resize(events_.size() + size_t(count)*2);\n\twhile(count--) {\n\t\tevents_[event].type = Event::Delay;\n\t\tevents_[event].delay = cycles;\n\t\tevents_[event+1].type = (levels&1) ? Event::SetHigh : Event::SetLow;\n\t\tevent += 2;\n\t}\n}\n\nint Line::write_data_time_remaining() {\n\treturn remaining_delays_;\n}\n\nvoid Line::reset_writing() {\n\tevents_.clear();\n}\n\nvoid Line::flush_writing() {\n\tfor(const auto &event : events_) {\n\t\tswitch(event.type) {\n\t\t\tdefault: break;\n\t\t\tcase Event::SetHigh:\tlevel_ = true;\tbreak;\n\t\t\tcase Event::SetLow:\t\tlevel_ = false;\tbreak;\n\t\t}\n\t}\n\tevents_.clear();\n}\n\nbool Line::read() {\n\treturn level_;\n}\n<commit_msg>Ensures `remaining_delays_` is set properly after [reset\/flush]_writing.<commit_after>\/\/\n\/\/  SerialPort.cpp\n\/\/  Clock Signal\n\/\/\n\/\/  Created by Thomas Harte on 12\/10\/2019.\n\/\/  Copyright © 2019 Thomas Harte. All rights reserved.\n\/\/\n\n#include \"SerialPort.hpp\"\n\nusing namespace Serial;\n\nvoid Line::set_writer_clock_rate(int clock_rate) {\n\tclock_rate_ = clock_rate;\n}\n\nvoid Line::advance_writer(int cycles) {\n\tremaining_delays_ = std::max(remaining_delays_ - cycles, 0);\n\twhile(!events_.empty()) {\n\t\tif(events_.front().delay < cycles) {\n\t\t\tcycles -= events_.front().delay;\n\t\t\tauto iterator = events_.begin() + 1;\n\t\t\twhile(iterator != events_.end() && iterator->type != Event::Delay) {\n\t\t\t\tlevel_ = iterator->type == Event::SetHigh;\n\t\t\t\t++iterator;\n\t\t\t}\n\t\t\tevents_.erase(events_.begin(), iterator);\n\t\t} else {\n\t\t\tevents_.front().delay -= cycles;\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\nvoid Line::write(bool level) {\n\tif(!events_.empty()) {\n\t\tevents_.emplace_back();\n\t\tevents_.back().type = level ? Event::SetHigh : Event::SetLow;\n\t} else {\n\t\tlevel_ = level;\n\t}\n}\n\nvoid Line::write(int cycles, int count, int levels) {\n\tremaining_delays_ += count*cycles;\n\n\tauto event = events_.size();\n\tevents_.resize(events_.size() + size_t(count)*2);\n\twhile(count--) {\n\t\tevents_[event].type = Event::Delay;\n\t\tevents_[event].delay = cycles;\n\t\tevents_[event+1].type = (levels&1) ? Event::SetHigh : Event::SetLow;\n\t\tevent += 2;\n\t}\n}\n\nint Line::write_data_time_remaining() {\n\treturn remaining_delays_;\n}\n\nvoid Line::reset_writing() {\n\tremaining_delays_ = 0;\n\tevents_.clear();\n}\n\nvoid Line::flush_writing() {\n\tremaining_delays_ = 0;\n\tfor(const auto &event : events_) {\n\t\tswitch(event.type) {\n\t\t\tdefault: break;\n\t\t\tcase Event::SetHigh:\tlevel_ = true;\tbreak;\n\t\t\tcase Event::SetLow:\t\tlevel_ = false;\tbreak;\n\t\t}\n\t}\n\tevents_.clear();\n}\n\nbool Line::read() {\n\treturn level_;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"BasicCircular.h\"\n#include \"RandomNumberGenerator.h\"\n#include \"Utils.h\"\n#include <cmath>\n\nusing namespace DNest3;\n\nBasicCircular::BasicCircular(double x_min, double x_max,\n\t\t\t\t\tdouble y_min, double y_max,\n\t\t\t\t\tdouble mu_min, double mu_max)\n:x_min(x_min)\n,x_max(x_max)\n,y_min(y_min)\n,y_max(y_max)\n,size(sqrt((x_max - x_min)*(y_max - y_min)))\n,mu_min(mu_min)\n,mu_max(mu_max)\n{\n\n}\n\nvoid BasicCircular::fromPrior()\n{\n\txc = x_min + (x_max - x_min)*randomU();\n\tyc = y_min + (y_max - y_min)*randomU();\n\twidth = exp(log(1E-2*size) + log(1E3)*randomU());\n\n\tmu = exp(log(mu_min) + log(mu_max\/mu_min)*randomU());\n}\n\ndouble BasicCircular::perturb_parameters()\n{\n\tdouble logH = 0.;\n\tint which = randInt(2);\n\n\tif(which == 0)\n\t{\n\t\tdouble scale = size*pow(10., 1.5 - 6.*randomU());\n\t\txc += scale*randn();\n\t\tyc += scale*randn();\n\t\txc = mod(xc - x_min, x_max - x_min) + x_min;\n\t\tyc = mod(yc - y_min, y_max - y_min) + y_min;\n\t}\n\telse if(which == 1)\n\t{\n\t\tmu = log(mu);\n\t\tmu += log(mu_max\/mu_min)*pow(10., 1.5 - 6.*randomU())*randn();\n\t\tmu = mod(mu - log(mu_min), log(mu_max\/mu_min)) + log(mu_min);\n\t\tmu = exp(mu);\n\t}\n\n\treturn logH;\n}\n\ndouble BasicCircular::log_pdf(const std::vector<double>& vec) const\n{\n\tif(vec[2] < 0.)\n\t\treturn -1E300;\n\n\tdouble logp = 0.;\n\tdouble r = sqrt(pow(vec[0] - xc, 2) + pow(vec[1] - yc, 2));\n\n\tlogp += -log(r) - log(width) - r\/width;\n\tlogp += -log(mu) - vec[2]\/mu;\n\n\treturn logp;\n}\n\nvoid BasicCircular::from_uniform(std::vector<double>& vec) const\n{\n\tdouble r = -width*log(1. - vec[0]);\n\tdouble phi = 2.*M_PI*vec[1];\n\n\tvec[0] = xc + r*cos(phi);\n\tvec[1] = yc + r*sin(phi);\n\tvec[2] = -mu*log(1. - vec[2]);\n}\n\nvoid BasicCircular::to_uniform(std::vector<double>& vec) const\n{\n\tdouble r = sqrt(pow(vec[0] - xc, 2) + pow(vec[1] - yc, 2));\n\tdouble phi = atan2(vec[1] - yc, vec[0] - xc);\n\tif(phi < 0.)\n\t\tphi += 2.*M_PI;\n\n\tvec[0] = 1. - exp(-r\/width);\n\tvec[1] = phi\/(2.*M_PI);\n\tvec[2] = 1. - exp(-vec[2]\/mu);\n}\n\nvoid BasicCircular::print(std::ostream& out) const\n{\n\tout<<xc<<' '<<yc<<' '<<width<<' '<<mu<<' ';\n}\n\n<commit_msg>Proposal for width<commit_after>#include \"BasicCircular.h\"\n#include \"RandomNumberGenerator.h\"\n#include \"Utils.h\"\n#include <cmath>\n\nusing namespace DNest3;\n\nBasicCircular::BasicCircular(double x_min, double x_max,\n\t\t\t\t\tdouble y_min, double y_max,\n\t\t\t\t\tdouble mu_min, double mu_max)\n:x_min(x_min)\n,x_max(x_max)\n,y_min(y_min)\n,y_max(y_max)\n,size(sqrt((x_max - x_min)*(y_max - y_min)))\n,mu_min(mu_min)\n,mu_max(mu_max)\n{\n\n}\n\nvoid BasicCircular::fromPrior()\n{\n\txc = x_min + (x_max - x_min)*randomU();\n\tyc = y_min + (y_max - y_min)*randomU();\n\twidth = exp(log(1E-2*size) + log(1E3)*randomU());\n\n\tmu = exp(log(mu_min) + log(mu_max\/mu_min)*randomU());\n}\n\ndouble BasicCircular::perturb_parameters()\n{\n\tdouble logH = 0.;\n\tint which = randInt(3);\n\n\tif(which == 0)\n\t{\n\t\tdouble scale = size*pow(10., 1.5 - 6.*randomU());\n\t\txc += scale*randn();\n\t\tyc += scale*randn();\n\t\txc = mod(xc - x_min, x_max - x_min) + x_min;\n\t\tyc = mod(yc - y_min, y_max - y_min) + y_min;\n\t}\n\telse if(which == 1)\n\t{\n\t\twidth = log(width);\n\t\twidth += log(1E3)*pow(10., 1.5 - 6.*randomU())*randn();\n\t\twidth = mod(width - log(1E-2*size), log(1E3)) + log(1E-2*size);\n\t\twidth = exp(width);\n\t}\n\telse if(which == 2)\n\t{\n\t\tmu = log(mu);\n\t\tmu += log(mu_max\/mu_min)*pow(10., 1.5 - 6.*randomU())*randn();\n\t\tmu = mod(mu - log(mu_min), log(mu_max\/mu_min)) + log(mu_min);\n\t\tmu = exp(mu);\n\t}\n\n\treturn logH;\n}\n\ndouble BasicCircular::log_pdf(const std::vector<double>& vec) const\n{\n\tif(vec[2] < 0.)\n\t\treturn -1E300;\n\n\tdouble logp = 0.;\n\tdouble r = sqrt(pow(vec[0] - xc, 2) + pow(vec[1] - yc, 2));\n\n\tlogp += -log(r) - log(width) - r\/width;\n\tlogp += -log(mu) - vec[2]\/mu;\n\n\treturn logp;\n}\n\nvoid BasicCircular::from_uniform(std::vector<double>& vec) const\n{\n\tdouble r = -width*log(1. - vec[0]);\n\tdouble phi = 2.*M_PI*vec[1];\n\n\tvec[0] = xc + r*cos(phi);\n\tvec[1] = yc + r*sin(phi);\n\tvec[2] = -mu*log(1. - vec[2]);\n}\n\nvoid BasicCircular::to_uniform(std::vector<double>& vec) const\n{\n\tdouble r = sqrt(pow(vec[0] - xc, 2) + pow(vec[1] - yc, 2));\n\tdouble phi = atan2(vec[1] - yc, vec[0] - xc);\n\tif(phi < 0.)\n\t\tphi += 2.*M_PI;\n\n\tvec[0] = 1. - exp(-r\/width);\n\tvec[1] = phi\/(2.*M_PI);\n\tvec[2] = 1. - exp(-vec[2]\/mu);\n}\n\nvoid BasicCircular::print(std::ostream& out) const\n{\n\tout<<xc<<' '<<yc<<' '<<width<<' '<<mu<<' ';\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <omp.h>\r\n#include <stdio.h>\r\n#include <string.h>\r\n#include <time.h>\r\n\r\n#include \"RNN.h\"\r\n\r\nvoid Read_MNIST(char training_set_images[], char training_set_labels[], char test_set_images[], char test_set_labels[], int time_step, int number_training, int number_test, double ***input, double ***target_output){\r\n\tFILE *file;\r\n\r\n\tif(file = fopen(training_set_images, \"rb\")){\r\n\t\tfor(int h = 0, value;h < 4;h++){\r\n\t\t\tfread(&value, sizeof(int), 1, file);\r\n\t\t}\r\n\t\tfor(int h = 0;h < number_training;h++){\r\n\t\t\tunsigned char pixel;\r\n\r\n\t\t\tfor(int j = 0;j < time_step;j++){\r\n\t\t\t\tfor(int k = 0;k < 28 * 28 \/ time_step;k++){\r\n\t\t\t\t\tfread(&pixel, sizeof(unsigned char), 1, file);\r\n\t\t\t\t\tinput[h][j][k] = pixel \/ 255.0;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tfclose(file);\r\n\t}\r\n\telse{\r\n\t\tfprintf(stderr, \"[Read_MNIST], %s not found\\n\", training_set_images);\r\n\t}\r\n\r\n\tif(file = fopen(training_set_labels, \"rb\")){\r\n\t\tfor(int h = 0, value;h < 2;h++){\r\n\t\t\tfread(&value, sizeof(int), 1, file);\r\n\t\t}\r\n\t\tfor(int h = 0;h < number_training;h++){\r\n\t\t\tunsigned char label;\r\n\r\n\t\t\tfread(&label, sizeof(unsigned char), 1, file);\r\n\r\n\t\t\tfor(int j = 0;j < 10;j++){\r\n\t\t\t\ttarget_output[h][time_step - 1][j] = (j == label);\r\n\t\t\t}\r\n\t\t}\r\n\t\tfclose(file);\r\n\t}\r\n\telse{\r\n\t\tfprintf(stderr, \"[Read_MNIST], %s not found\\n\", training_set_labels);\r\n\t}\r\n\r\n\tif(file = fopen(test_set_images, \"rb\")){\r\n\t\tfor(int h = 0, value;h < 4;h++){\r\n\t\t\tfread(&value, sizeof(int), 1, file);\r\n\t\t}\r\n\t\tfor(int h = number_training;h < number_training + number_test;h++){\r\n\t\t\tunsigned char pixel;\r\n\r\n\t\t\tfor(int j = 0;j < time_step;j++){\r\n\t\t\t\tfor(int k = 0;k < 28 * 28 \/ time_step;k++){\r\n\t\t\t\t\tfread(&pixel, sizeof(unsigned char), 1, file);\r\n\t\t\t\t\tinput[h][j][k] = pixel \/ 255.0;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tfclose(file);\r\n\t}\r\n\telse{\r\n\t\tfprintf(stderr, \"[Read_MNIST], %s not found\\n\", test_set_images);\r\n\t}\r\n\r\n\tif(file = fopen(test_set_labels, \"rb\")){\r\n\t\tfor(int h = 0, value;h < 2;h++){\r\n\t\t\tfread(&value, sizeof(int), 1, file);\r\n\t\t}\r\n\t\tfor(int h = number_training;h < number_training + number_test;h++){\r\n\t\t\tunsigned char label;\r\n\r\n\t\t\tfread(&label, sizeof(unsigned char), 1, file);\r\n\r\n\t\t\tfor(int j = 0;j < 10;j++){\r\n\t\t\t\ttarget_output[h][time_step - 1][j] = (j == label);\r\n\t\t\t}\r\n\t\t}\r\n\t\tfclose(file);\r\n\t}\r\n\telse{\r\n\t\tfprintf(stderr, \"[Read_MNIST], %s not found\\n\", test_set_labels);\r\n\t}\r\n}\r\n\r\nint main(){\r\n\tchar *type_layer[] = {\"MNIST\", \"Clstm\", \"Lce,sm\"};\r\n\r\n\tint batch_size\t\t\t= 60;\r\n\tint time_step\t\t\t= 28;\r\n\tint time_stride\t\t\t= time_step;\r\n\t\/\/ int map_width[i]\t\t= {1, 1, 1};\r\n\t\/\/ int map_height[i]\t= {1, 1, 1};\r\n\tint number_maps[]\t\t= {784 \/ time_step, 100, 10};\r\n\tint number_iterations\t= 100;\r\n\tint number_layers\t\t= sizeof(type_layer) \/ sizeof(type_layer[0]);\r\n\tint number_threads\t\t= 6;\r\n\tint number_training\t\t= 6000;\r\n\tint number_test\t\t\t= 1000;\r\n\r\n\t\/* Training using the entire dataset takes about 1000 seconds per iteration on the i7-4790K with 6 threads.\r\n\tint number_training\t = 60000;\r\n\tint number_test\t\t = 10000;\r\n\t*\/\r\n\r\n\tint *length_data = new int[number_training + number_test];\r\n\tint *output_mask = new int[time_step];\r\n\r\n\tdouble epsilon\t\t\t\t= 0.001;\r\n\tdouble gradient_threshold\t= 10;\r\n\tdouble learning_rate\t\t= 0.005; \/\/ 0.001 for vanilla RNN\r\n\tdouble decay_rate\t\t\t= 0.977;\r\n\r\n\tdouble ***input\t\t\t= new double**[number_training + number_test];\r\n\tdouble ***target_output\t= new double**[number_training + number_test];\r\n\r\n\tRecurrent_Neural_Networks RNN = Recurrent_Neural_Networks(type_layer, number_layers, 0, 0, number_maps);\r\n\r\n\tfor(int h = 0;h < number_training + number_test;h++){\r\n\t\tlength_data[h] = time_step;\r\n\r\n\t\tinput[h]\t\t = new double*[length_data[h]];\r\n\t\ttarget_output[h] = new double*[length_data[h]];\r\n\r\n\t\tfor(int t = 0;t < length_data[h];t++){\r\n\t\t\tinput[h][t]\t\t\t= new double[number_maps[0]];\r\n\t\t\ttarget_output[h][t] = new double[number_maps[number_layers - 1]];\r\n\t\t}\r\n\t}\r\n\tfor(int t = 0;t < time_step;t++){\r\n\t\toutput_mask[t] = (t == time_step - 1);\r\n\t}\r\n\tRead_MNIST(\"train-images.idx3-ubyte\", \"train-labels.idx1-ubyte\", \"t10k-images.idx3-ubyte\", \"t10k-labels.idx1-ubyte\", time_step, number_training, number_test, input, target_output);\t\r\n\r\n\tRNN.Initialize_Parameter(0, 0.2, -0.1);\r\n\tomp_set_num_threads(number_threads);\r\n\r\n\tfor(int h = 0, time = clock();h < number_iterations;h++){\r\n\t\tint number_correct[2] = {0, };\r\n\r\n\t\tdouble loss = RNN.Train(batch_size, number_training, time_step, time_stride, length_data, output_mask, epsilon, gradient_threshold, learning_rate, input, target_output);\r\n\r\n\t\tdouble *output = new double[number_maps[number_layers - 1]];\r\n\r\n\t\tfor(int i = 0;i < number_training + number_test;i++){\r\n\t\t\tfor(int t = 0;t < time_step;t++){\r\n\t\t\t\tint argmax;\r\n\r\n\t\t\t\tdouble max = 0;\r\n\r\n\t\t\t\tRNN.Test(t == 0, input[i][t], output);\r\n\r\n\t\t\t\tif(output_mask == 0 || output_mask[t]){\r\n\t\t\t\t\tfor(int j = 0;j < number_maps[number_layers - 1];j++){\r\n\t\t\t\t\t\tif(max < output[j]){\r\n\t\t\t\t\t\t\targmax = j;\r\n\t\t\t\t\t\t\tmax = output[j];\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\tnumber_correct[(i < number_training) ? (0):(1)] += (int)target_output[i][t][argmax];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tprintf(\"score: %d \/ %d, %d \/ %d  loss: %lf  step %d  %.2lf sec\\n\", number_correct[0], number_training, number_correct[1], number_test, loss, h + 1, (double)(clock() - time) \/ CLOCKS_PER_SEC);\r\n\t\tlearning_rate *= decay_rate;\r\n\r\n\t\tdelete[] output;\r\n\t}\r\n\r\n\tfor(int h = 0;h < number_training + number_test;h++){\r\n\t\tfor(int t = 0;t < length_data[h];t++){\r\n\t\t\tdelete[] input[h][t];\r\n\t\t\tdelete[] target_output[h][t];\r\n\t\t}\t\t\r\n\t\tdelete[] input[h];\r\n\t\tdelete[] target_output[h];\r\n\t}\r\n\tdelete[] input;\r\n\tdelete[] target_output;\r\n\tdelete[] length_data;\r\n\tdelete[] output_mask;\r\n\r\n\treturn 0;\r\n}\r\n<commit_msg>Update main.cpp<commit_after>#include <omp.h>\r\n#include <stdio.h>\r\n#include <string.h>\r\n#include <time.h>\r\n\r\n#include \"RNN.h\"\r\n\r\nvoid Read_MNIST(char training_set_images[], char training_set_labels[], char test_set_images[], char test_set_labels[], int time_step, int number_training, int number_test, double ***input, double ***target_output){\r\n\tFILE *file;\r\n\r\n\tif(file = fopen(training_set_images, \"rb\")){\r\n\t\tfor(int h = 0, value;h < 4;h++){\r\n\t\t\tfread(&value, sizeof(int), 1, file);\r\n\t\t}\r\n\t\tfor(int h = 0;h < number_training;h++){\r\n\t\t\tunsigned char pixel;\r\n\r\n\t\t\tfor(int j = 0;j < time_step;j++){\r\n\t\t\t\tfor(int k = 0;k < 28 * 28 \/ time_step;k++){\r\n\t\t\t\t\tfread(&pixel, sizeof(unsigned char), 1, file);\r\n\t\t\t\t\tinput[h][j][k] = pixel \/ 255.0;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tfclose(file);\r\n\t}\r\n\telse{\r\n\t\tfprintf(stderr, \"[Read_MNIST], %s not found\\n\", training_set_images);\r\n\t}\r\n\r\n\tif(file = fopen(training_set_labels, \"rb\")){\r\n\t\tfor(int h = 0, value;h < 2;h++){\r\n\t\t\tfread(&value, sizeof(int), 1, file);\r\n\t\t}\r\n\t\tfor(int h = 0;h < number_training;h++){\r\n\t\t\tunsigned char label;\r\n\r\n\t\t\tfread(&label, sizeof(unsigned char), 1, file);\r\n\r\n\t\t\tfor(int j = 0;j < 10;j++){\r\n\t\t\t\ttarget_output[h][time_step - 1][j] = (j == label);\r\n\t\t\t}\r\n\t\t}\r\n\t\tfclose(file);\r\n\t}\r\n\telse{\r\n\t\tfprintf(stderr, \"[Read_MNIST], %s not found\\n\", training_set_labels);\r\n\t}\r\n\r\n\tif(file = fopen(test_set_images, \"rb\")){\r\n\t\tfor(int h = 0, value;h < 4;h++){\r\n\t\t\tfread(&value, sizeof(int), 1, file);\r\n\t\t}\r\n\t\tfor(int h = number_training;h < number_training + number_test;h++){\r\n\t\t\tunsigned char pixel;\r\n\r\n\t\t\tfor(int j = 0;j < time_step;j++){\r\n\t\t\t\tfor(int k = 0;k < 28 * 28 \/ time_step;k++){\r\n\t\t\t\t\tfread(&pixel, sizeof(unsigned char), 1, file);\r\n\t\t\t\t\tinput[h][j][k] = pixel \/ 255.0;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tfclose(file);\r\n\t}\r\n\telse{\r\n\t\tfprintf(stderr, \"[Read_MNIST], %s not found\\n\", test_set_images);\r\n\t}\r\n\r\n\tif(file = fopen(test_set_labels, \"rb\")){\r\n\t\tfor(int h = 0, value;h < 2;h++){\r\n\t\t\tfread(&value, sizeof(int), 1, file);\r\n\t\t}\r\n\t\tfor(int h = number_training;h < number_training + number_test;h++){\r\n\t\t\tunsigned char label;\r\n\r\n\t\t\tfread(&label, sizeof(unsigned char), 1, file);\r\n\r\n\t\t\tfor(int j = 0;j < 10;j++){\r\n\t\t\t\ttarget_output[h][time_step - 1][j] = (j == label);\r\n\t\t\t}\r\n\t\t}\r\n\t\tfclose(file);\r\n\t}\r\n\telse{\r\n\t\tfprintf(stderr, \"[Read_MNIST], %s not found\\n\", test_set_labels);\r\n\t}\r\n}\r\n\r\nint main(){\r\n\tchar *type_layer[] = {\"MNIST\", \"Clstm\", \"Lce,sm\"};\r\n\r\n\tint batch_size\t\t\t= 60;\r\n\tint time_step\t\t\t= 28;\r\n\t\/\/ int map_width[]\t\t= {1, 1, 1};\r\n\t\/\/ int map_height[]\t\t= {1, 1, 1};\r\n\tint number_maps[]\t\t= {784 \/ time_step, 100, 10};\r\n\tint number_iterations\t= 100;\r\n\tint number_layers\t\t= sizeof(type_layer) \/ sizeof(type_layer[0]);\r\n\tint number_threads\t\t= 6;\r\n\tint number_training\t\t= 6000;\r\n\tint number_test\t\t\t= 1000;\r\n\r\n\t\/* Training using the entire dataset takes about 800 seconds per iteration on the i7-4790K with 6 threads.\r\n\tint number_training\t = 60000;\r\n\tint number_test\t\t = 10000;\r\n\t*\/\r\n\r\n\tint *length_data = new int[number_training + number_test];\r\n\tint *output_mask = new int[time_step];\r\n\r\n\tdouble epsilon\t\t\t\t= 0.001;\r\n\tdouble gradient_threshold\t= 10;\r\n\tdouble learning_rate\t\t= 0.005; \/\/ 0.001 for vanilla RNN\r\n\tdouble decay_rate\t\t\t= 0.977;\r\n\r\n\tdouble ***input\t\t\t= new double**[number_training + number_test];\r\n\tdouble ***target_output\t= new double**[number_training + number_test];\r\n\r\n\tRecurrent_Neural_Networks RNN = Recurrent_Neural_Networks(type_layer, number_layers, 0, 0, number_maps);\r\n\r\n\tfor(int h = 0;h < number_training + number_test;h++){\r\n\t\tlength_data[h] = time_step;\r\n\r\n\t\tinput[h]\t\t = new double*[length_data[h]];\r\n\t\ttarget_output[h] = new double*[length_data[h]];\r\n\r\n\t\tfor(int t = 0;t < length_data[h];t++){\r\n\t\t\tinput[h][t]\t\t\t= new double[number_maps[0]];\r\n\t\t\ttarget_output[h][t] = new double[number_maps[number_layers - 1]];\r\n\t\t}\r\n\t}\r\n\tfor(int t = 0;t < time_step;t++){\r\n\t\toutput_mask[t] = (t == time_step - 1);\r\n\t}\r\n\tRead_MNIST(\"train-images.idx3-ubyte\", \"train-labels.idx1-ubyte\", \"t10k-images.idx3-ubyte\", \"t10k-labels.idx1-ubyte\", time_step, number_training, number_test, input, target_output);\t\r\n\r\n\tRNN.Initialize_Parameter(0, 0.2, -0.1);\r\n\tomp_set_num_threads(number_threads);\r\n\r\n\tfor(int h = 0, time = clock();h < number_iterations;h++){\r\n\t\tint number_correct[2] = {0, };\r\n\r\n\t\tdouble loss = RNN.Train(batch_size, number_training, time_step, length_data, output_mask, epsilon, gradient_threshold, learning_rate, input, target_output);\r\n\r\n\t\tdouble *output = new double[number_maps[number_layers - 1]];\r\n\r\n\t\tfor(int i = 0;i < number_training + number_test;i++){\r\n\t\t\tfor(int t = 0;t < time_step;t++){\r\n\t\t\t\tint argmax;\r\n\r\n\t\t\t\tdouble max = 0;\r\n\r\n\t\t\t\tRNN.Test(t == 0, input[i][t], output);\r\n\r\n\t\t\t\tif(output_mask == 0 || output_mask[t]){\r\n\t\t\t\t\tfor(int j = 0;j < number_maps[number_layers - 1];j++){\r\n\t\t\t\t\t\tif(max < output[j]){\r\n\t\t\t\t\t\t\targmax = j;\r\n\t\t\t\t\t\t\tmax = output[j];\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\tnumber_correct[(i < number_training) ? (0):(1)] += (int)target_output[i][t][argmax];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tprintf(\"score: %d \/ %d, %d \/ %d  loss: %lf  step %d  %.2lf sec\\n\", number_correct[0], number_training, number_correct[1], number_test, loss, h + 1, (double)(clock() - time) \/ CLOCKS_PER_SEC);\r\n\t\tlearning_rate *= decay_rate;\r\n\r\n\t\tdelete[] output;\r\n\t}\r\n\r\n\tfor(int h = 0;h < number_training + number_test;h++){\r\n\t\tfor(int t = 0;t < length_data[h];t++){\r\n\t\t\tdelete[] input[h][t];\r\n\t\t\tdelete[] target_output[h][t];\r\n\t\t}\t\t\r\n\t\tdelete[] input[h];\r\n\t\tdelete[] target_output[h];\r\n\t}\r\n\tdelete[] input;\r\n\tdelete[] target_output;\r\n\tdelete[] length_data;\r\n\tdelete[] output_mask;\r\n\r\n\treturn 0;\r\n}\r\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\/graphics.hpp>\n#include <mapnik\/agg_renderer.hpp>\n#include <mapnik\/agg_rasterizer.hpp>\n#include <mapnik\/expression_evaluator.hpp>\n#include <mapnik\/image_util.hpp>\n#include <mapnik\/marker.hpp>\n#include <mapnik\/marker_cache.hpp>\n#include <mapnik\/svg\/svg_renderer.hpp>\n#include <mapnik\/svg\/svg_path_adapter.hpp>\n#include <mapnik\/markers_placement.hpp>\n#include <mapnik\/arrow.hpp>\n#include <mapnik\/markers_symbolizer.hpp>\n\n#include \"agg_basics.h\"\n#include \"agg_rendering_buffer.h\"\n#include \"agg_pixfmt_rgba.h\"\n#include \"agg_rasterizer_scanline_aa.h\"\n#include \"agg_scanline_u.h\"\n#include \"agg_scanline_p.h\"\n#include \"agg_path_storage.h\"\n#include \"agg_ellipse.h\"\n#include \"agg_conv_stroke.h\"\n#include \"agg_conv_clip_polyline.h\"\n#include \"agg_conv_transform.h\"\n\nnamespace mapnik {\n\ntemplate <typename T>\nvoid agg_renderer<T>::process(markers_symbolizer const& sym,\n                              mapnik::feature_impl & feature,\n                              proj_transform const& prj_trans)\n{\n    typedef agg::conv_clip_polyline<geometry_type> clipped_geometry_type;\n    typedef coord_transform<CoordTransform,clipped_geometry_type> path_type;\n    typedef agg::conv_transform<path_type, agg::trans_affine> transformed_path_type;\n    typedef agg::rgba8 color_type;\n    typedef agg::order_rgba order_type;\n    typedef agg::pixel32_type pixel_type;\n    typedef agg::comp_op_adaptor_rgba_pre<color_type, order_type> blender_type; \/\/ comp blender\n    typedef agg::pixfmt_custom_blend_rgba<blender_type, agg::rendering_buffer> pixfmt_comp_type;\n    typedef agg::renderer_base<pixfmt_comp_type> renderer_base;\n    typedef agg::renderer_scanline_aa_solid<renderer_base> renderer_type;\n\n    ras_ptr->reset();\n    ras_ptr->gamma(agg::gamma_power());\n    agg::scanline_u8 sl;\n    agg::rendering_buffer buf(current_buffer_->raw_data(), width_, height_, width_ * 4);\n    pixfmt_comp_type pixf(buf);\n    pixf.comp_op(static_cast<agg::comp_op_e>(sym.comp_op()));\n    renderer_base renb(pixf);\n    renderer_type ren(renb);\n    agg::trans_affine tr;\n    evaluate_transform(tr, feature, sym.get_image_transform());\n    tr = agg::trans_affine_scaling(scale_factor_) * tr;\n\n    agg::trans_affine geom_tr;\n    evaluate_transform(geom_tr, feature, sym.get_transform());\n\n    std::string filename = path_processor_type::evaluate(*sym.get_filename(), feature);\n    marker_placement_e placement_method = sym.get_marker_placement();\n\n    if (!filename.empty())\n    {\n        boost::optional<marker_ptr> mark = mapnik::marker_cache::instance()->find(filename, true);\n        if (mark && *mark)\n        {\n            if (!(*mark)->is_vector())\n            {\n                MAPNIK_LOG_DEBUG(agg_renderer) << \"agg_renderer: markers_symbolizer does not yet support non-SVG markers\";\n\n                return;\n            }\n            boost::optional<path_ptr> marker = (*mark)->get_vector_data();\n            box2d<double> const& bbox = (*marker)->bounding_box();\n            coord2d const center = bbox.center();\n\n            agg::trans_affine_translation const recenter(-center.x, -center.y);\n            agg::trans_affine const marker_trans = recenter * tr;\n\n            using namespace mapnik::svg;\n            vertex_stl_adapter<svg_path_storage> stl_storage((*marker)->source());\n            svg_path_adapter svg_path(stl_storage);\n\n            svg_renderer<svg_path_adapter,\n                agg::pod_bvector<path_attributes>,\n                renderer_type,\n                agg::pixfmt_rgba32 > svg_renderer(svg_path,(*marker)->attributes());\n\n            for (unsigned i=0; i<feature.num_geometries(); ++i)\n            {\n                geometry_type & geom = feature.get_geometry(i);\n                \/\/ TODO - merge this code with point_symbolizer rendering\n                if (placement_method == MARKER_POINT_PLACEMENT || geom.num_points() <= 1)\n                {\n                    double x;\n                    double y;\n                    double z=0;\n                    geom.label_interior_position(&x, &y);\n                    prj_trans.backward(x,y,z);\n                    t_.forward(&x,&y);\n                    geom_tr.transform(&x,&y);\n                    agg::trans_affine matrix = marker_trans;\n                    matrix.translate(x,y);\n                    box2d<double> transformed_bbox = bbox * matrix;\n\n                    if (sym.get_allow_overlap() ||\n                        detector_->has_placement(transformed_bbox))\n                    {\n                        svg_renderer.render(*ras_ptr, sl, renb, matrix, sym.get_opacity(), bbox);\n                        if (\/* DEBUG *\/ 0)\n                        {\n                            debug_draw_box(buf, transformed_bbox, 0, 0, 0.0);\n                        }\n\n                        if (!sym.get_ignore_placement())\n                            detector_->insert(transformed_bbox);\n                    }\n                }\n                else\n                {\n                    clipped_geometry_type clipped(geom);\n                    clipped.clip_box(query_extent_.minx(),query_extent_.miny(),query_extent_.maxx(),query_extent_.maxy());\n                    path_type path(t_,clipped,prj_trans);\n                    transformed_path_type path_transformed(path,geom_tr);\n                    markers_placement<transformed_path_type, label_collision_detector4> placement(path_transformed, bbox, marker_trans, *detector_,\n                                                                                      sym.get_spacing() * scale_factor_,\n                                                                                      sym.get_max_error(),\n                                                                                      sym.get_allow_overlap());\n                    double x, y, angle;\n                    while (placement.get_point(x, y, angle))\n                    {\n                        agg::trans_affine matrix = marker_trans;\n                        matrix.rotate(angle);\n                        matrix.translate(x, y);\n                        svg_renderer.render(*ras_ptr, sl, renb, matrix, sym.get_opacity(), bbox);\n\n                        if (\/* DEBUG *\/ 0)\n                        {\n                            debug_draw_box(buf, bbox*matrix, 0, 0, 0.0);\n                        }\n                    }\n                }\n            }\n        }\n    }\n}\n\n\ntemplate void agg_renderer<image_32>::process(markers_symbolizer const&,\n                                              mapnik::feature_impl &,\n                                              proj_transform const&);\n}\n<commit_msg>+ inherit stroke, stroke-width and fill if provided in markers_symbolizer<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\/graphics.hpp>\n#include <mapnik\/agg_renderer.hpp>\n#include <mapnik\/agg_rasterizer.hpp>\n#include <mapnik\/expression_evaluator.hpp>\n#include <mapnik\/image_util.hpp>\n#include <mapnik\/marker.hpp>\n#include <mapnik\/marker_cache.hpp>\n#include <mapnik\/svg\/svg_renderer.hpp>\n#include <mapnik\/svg\/svg_path_adapter.hpp>\n#include <mapnik\/markers_placement.hpp>\n#include <mapnik\/arrow.hpp>\n#include <mapnik\/markers_symbolizer.hpp>\n\n#include \"agg_basics.h\"\n#include \"agg_rendering_buffer.h\"\n#include \"agg_pixfmt_rgba.h\"\n#include \"agg_rasterizer_scanline_aa.h\"\n#include \"agg_scanline_u.h\"\n#include \"agg_scanline_p.h\"\n#include \"agg_path_storage.h\"\n#include \"agg_ellipse.h\"\n#include \"agg_conv_stroke.h\"\n#include \"agg_conv_clip_polyline.h\"\n#include \"agg_conv_transform.h\"\n\nnamespace mapnik {\n\n\ntemplate <typename Attr>\nbool push_explicit_style(Attr const& src, Attr & dst,  markers_symbolizer const& sym)\n{\n    boost::optional<stroke> const& strk = sym.get_stroke();\n    boost::optional<color> const& fill = sym.get_fill();\n    if (strk || fill)\n    {\n        for(unsigned i = 0; i < src.size(); ++i)\n        {\n            mapnik::svg::path_attributes attr = src[i];\n\n            if (strk)\n            {\n                attr.stroke_width = (*strk).get_width();\n                color const& s_color = (*strk).get_color();\n                attr.stroke_color = agg::rgba(s_color.red()\/255.0,s_color.green()\/255.0,\n                                              s_color.blue()\/255.0,s_color.alpha()\/255.0);\n            }\n            if (fill)\n            {\n\n                color const& f_color = *fill;\n                attr.fill_color = agg::rgba(f_color.red()\/255.0,f_color.green()\/255.0,\n                                            f_color.blue()\/255.0,f_color.alpha()\/255.0);\n            }\n            dst.push_back(attr);\n        }\n        return true;\n    }\n    return false;\n}\n\ntemplate <typename T>\nvoid agg_renderer<T>::process(markers_symbolizer const& sym,\n                              mapnik::feature_impl & feature,\n                              proj_transform const& prj_trans)\n{\n    typedef agg::conv_clip_polyline<geometry_type> clipped_geometry_type;\n    typedef coord_transform<CoordTransform,clipped_geometry_type> path_type;\n    typedef agg::conv_transform<path_type, agg::trans_affine> transformed_path_type;\n    typedef agg::rgba8 color_type;\n    typedef agg::order_rgba order_type;\n    typedef agg::pixel32_type pixel_type;\n    typedef agg::comp_op_adaptor_rgba_pre<color_type, order_type> blender_type; \/\/ comp blender\n    typedef agg::pixfmt_custom_blend_rgba<blender_type, agg::rendering_buffer> pixfmt_comp_type;\n    typedef agg::renderer_base<pixfmt_comp_type> renderer_base;\n    typedef agg::renderer_scanline_aa_solid<renderer_base> renderer_type;\n\n    ras_ptr->reset();\n    ras_ptr->gamma(agg::gamma_power());\n    agg::scanline_u8 sl;\n    agg::rendering_buffer buf(current_buffer_->raw_data(), width_, height_, width_ * 4);\n    pixfmt_comp_type pixf(buf);\n    pixf.comp_op(static_cast<agg::comp_op_e>(sym.comp_op()));\n    renderer_base renb(pixf);\n    renderer_type ren(renb);\n    agg::trans_affine tr;\n    evaluate_transform(tr, feature, sym.get_image_transform());\n    tr = agg::trans_affine_scaling(scale_factor_) * tr;\n\n    agg::trans_affine geom_tr;\n    evaluate_transform(geom_tr, feature, sym.get_transform());\n\n    std::string filename = path_processor_type::evaluate(*sym.get_filename(), feature);\n    marker_placement_e placement_method = sym.get_marker_placement();\n\n    if (!filename.empty())\n    {\n        boost::optional<marker_ptr> mark = mapnik::marker_cache::instance()->find(filename, true);\n        if (mark && *mark)\n        {\n            if (!(*mark)->is_vector())\n            {\n                MAPNIK_LOG_DEBUG(agg_renderer) << \"agg_renderer: markers_symbolizer does not yet support non-SVG markers\";\n\n                return;\n            }\n            boost::optional<path_ptr> marker = (*mark)->get_vector_data();\n            box2d<double> const& bbox = (*marker)->bounding_box();\n            coord2d center = bbox.center();\n\n            agg::trans_affine_translation recenter(-center.x, -center.y);\n            agg::trans_affine marker_trans = recenter * tr;\n\n            using namespace mapnik::svg;\n            vertex_stl_adapter<svg_path_storage> stl_storage((*marker)->source());\n            svg_path_adapter svg_path(stl_storage);\n\n            agg::pod_bvector<path_attributes> attributes;\n            bool result = push_explicit_style( (*marker)->attributes(), attributes, sym);\n\n            svg_renderer<svg_path_adapter,\n                         agg::pod_bvector<path_attributes>,\n                         renderer_type,\n                         agg::pixfmt_rgba32 > svg_renderer(svg_path, result ? attributes : (*marker)->attributes());\n\n            BOOST_FOREACH( geometry_type & geom, feature.paths())\n            {\n                \/\/ TODO - merge this code with point_symbolizer rendering\n                if (placement_method == MARKER_POINT_PLACEMENT || geom.num_points() <= 1)\n                {\n                    double x;\n                    double y;\n                    double z=0;\n                    geom.label_interior_position(&x, &y);\n                    prj_trans.backward(x,y,z);\n                    t_.forward(&x,&y);\n                    geom_tr.transform(&x,&y);\n                    agg::trans_affine matrix = marker_trans;\n                    matrix.translate(x,y);\n                    box2d<double> transformed_bbox = bbox * matrix;\n\n                    if (sym.get_allow_overlap() ||\n                        detector_->has_placement(transformed_bbox))\n                    {\n                        svg_renderer.render(*ras_ptr, sl, renb, matrix, sym.get_opacity(), bbox);\n                        if (\/* DEBUG *\/ 0)\n                        {\n                            debug_draw_box(buf, transformed_bbox, 0, 0, 0.0);\n                        }\n\n                        if (!sym.get_ignore_placement())\n                            detector_->insert(transformed_bbox);\n                    }\n                }\n                else\n                {\n                    clipped_geometry_type clipped(geom);\n                    clipped.clip_box(query_extent_.minx(),query_extent_.miny(),query_extent_.maxx(),query_extent_.maxy());\n                    path_type path(t_,clipped,prj_trans);\n                    transformed_path_type path_transformed(path,geom_tr);\n                    markers_placement<transformed_path_type, label_collision_detector4> placement(path_transformed, bbox, marker_trans, *detector_,\n                                                                                                  sym.get_spacing() * scale_factor_,\n                                                                                                  sym.get_max_error(),\n                                                                                                  sym.get_allow_overlap());\n                    double x, y, angle;\n                    while (placement.get_point(x, y, angle))\n                    {\n                        agg::trans_affine matrix = marker_trans;\n                        matrix.rotate(angle);\n                        matrix.translate(x, y);\n                        svg_renderer.render(*ras_ptr, sl, renb, matrix, sym.get_opacity(), bbox);\n\n                        if (\/* DEBUG *\/ 0)\n                        {\n                            debug_draw_box(buf, bbox*matrix, 0, 0, 0.0);\n                        }\n                    }\n                }\n            }\n        }\n    }\n}\n\n\ntemplate void agg_renderer<image_32>::process(markers_symbolizer const&,\n                                              mapnik::feature_impl &,\n                                              proj_transform const&);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <fnv_solver.hpp>\n#include <fnv_solution.hpp>\n#include <stp\/c_interface.h>\n#include <iostream>\n#include <sstream>\n#include <cstdlib>\n#include <vector>\n#include <cassert>\n#include <string>\n\nFNVSolver::FNVSolver(const FNVParam& _param, const FNVAlgo& _algo, \n                     const Constraint& _constraint, const int _startLength) :\n  solved(false), startLength(_startLength), solutionLength(-1), param(_param), algo(_algo), constraint(_constraint)\n{\n}\n\nstd::string FNVSolver::getOctetName(const int index)\n{\n  std::ostringstream octetName;\n  octetName << \"input_\" << index;\n  return octetName.str();\n}\n\nvoid FNVSolver::solve()\n{\n  int length = startLength;\n\n  while(!solved)\n  {\n    const int width = param.getWidth();\n    VC checker = vc_createValidityChecker();\n\n    const Expr basis = vc_bvConstExprFromDecStr(checker, width, param.getBasisCStr());\n    const Expr prime = vc_bvConstExprFromDecStr(checker, width, param.getPrimeCStr());\n    const Expr zeroPrefix = vc_bvConstExprFromInt(checker, width-8, 0);\n\n    Expr hash = basis;\n    std::vector<Expr> inputOctets;\n    inputOctets.reserve(length);\n\n    for(int octet=0; octet<length; ++octet)\n    {\n      const std::string octetName = getOctetName(octet);\n      const Expr inputOctet = vc_varExpr1(checker, octetName.c_str(), 0, 8);\n      inputOctets.push_back(inputOctet);\n\n      constraint(checker, inputOctet);\n      const Expr extendedOctet = vc_bvConcatExpr(checker, zeroPrefix, inputOctet);\n      hash = algo(checker, hash, prime, extendedOctet);\n    }\n\n    const Expr zeroResult = vc_bvConstExprFromInt(checker, width, 0);\n    const Expr isZero = vc_eqExpr(checker, hash, zeroResult);\n    const Expr isNotZero = vc_notExpr(checker, isZero);\n    const int queryResult = vc_query(checker, isNotZero);\n\n    static const int INVALID=0, VALID=1, ERROR=2;\n    if (queryResult == INVALID)\n    {\n      solved = true;\n      solutionLength = length;\n      FNVSolution solution(param, algo, checker, inputOctets);\n      std::cout << solution << std::endl;\n    }\n    else if (queryResult == ERROR)\n    {\n      std::cerr << \"Error during query.\" << std::endl;\n      exit(EXIT_FAILURE);\n    }\n\n    vc_Destroy(checker);\n    ++length;\n  }\n}\n\nint FNVSolver::getSolutionLength() const\n{\n  assert(solved);\n  return solutionLength;\n}\n<commit_msg>Add slightly more progress output.<commit_after>#include <fnv_solver.hpp>\n#include <fnv_solution.hpp>\n#include <stp\/c_interface.h>\n#include <iostream>\n#include <sstream>\n#include <cstdlib>\n#include <vector>\n#include <cassert>\n#include <string>\n\nFNVSolver::FNVSolver(const FNVParam& _param, const FNVAlgo& _algo, \n                     const Constraint& _constraint, const int _startLength) :\n  solved(false), startLength(_startLength), solutionLength(-1), param(_param), algo(_algo), constraint(_constraint)\n{\n}\n\nstd::string FNVSolver::getOctetName(const int index)\n{\n  std::ostringstream octetName;\n  octetName << \"input_\" << index;\n  return octetName.str();\n}\n\nvoid FNVSolver::solve()\n{\n  int length = startLength;\n\n  while(!solved)\n  {\n    std::cout << \"Searching for solutions of length \" << length << \"...\" << std::endl;\n    const int width = param.getWidth();\n    VC checker = vc_createValidityChecker();\n\n    const Expr basis = vc_bvConstExprFromDecStr(checker, width, param.getBasisCStr());\n    const Expr prime = vc_bvConstExprFromDecStr(checker, width, param.getPrimeCStr());\n    const Expr zeroPrefix = vc_bvConstExprFromInt(checker, width-8, 0);\n\n    Expr hash = basis;\n    std::vector<Expr> inputOctets;\n    inputOctets.reserve(length);\n\n    for(int octet=0; octet<length; ++octet)\n    {\n      const std::string octetName = getOctetName(octet);\n      const Expr inputOctet = vc_varExpr1(checker, octetName.c_str(), 0, 8);\n      inputOctets.push_back(inputOctet);\n\n      constraint(checker, inputOctet);\n      const Expr extendedOctet = vc_bvConcatExpr(checker, zeroPrefix, inputOctet);\n      hash = algo(checker, hash, prime, extendedOctet);\n    }\n\n    const Expr zeroResult = vc_bvConstExprFromInt(checker, width, 0);\n    const Expr isZero = vc_eqExpr(checker, hash, zeroResult);\n    const Expr isNotZero = vc_notExpr(checker, isZero);\n    const int queryResult = vc_query(checker, isNotZero);\n\n    static const int INVALID=0, VALID=1, ERROR=2;\n    if (queryResult == INVALID)\n    {\n      solved = true;\n      solutionLength = length;\n      FNVSolution solution(param, algo, checker, inputOctets);\n      std::cout << solution << std::endl;\n    }\n    else if (queryResult == ERROR)\n    {\n      std::cerr << \"Error during query.\" << std::endl;\n      exit(EXIT_FAILURE);\n    }\n\n    vc_Destroy(checker);\n    ++length;\n  }\n}\n\nint FNVSolver::getSolutionLength() const\n{\n  assert(solved);\n  return solutionLength;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2015\n\/\/ Author: Chrono Law\n#ifndef _NGX_LIST_HPP\n#define _NGX_LIST_HPP\n\n#include <boost\/iterator\/iterator_facade.hpp>\n#include <boost\/core\/explicit_operator_bool.hpp>\n\n#include \"NgxPool.hpp\"\n\ntemplate<typename T>\nclass NgxListIterator final :\n        public boost::iterator_facade<\n                    NgxListIterator<T>, T,\n                    boost::single_pass_traversal_tag>\n{\npublic:\n    typedef boost::iterator_facade<\n                    NgxListIterator<T>, T,\n                    boost::single_pass_traversal_tag>\n            super_type;\n    typedef typename super_type::reference reference;\npublic:\n    NgxListIterator(ngx_list_t* l):\n        m_part(&l->part),\n        m_data(static_cast<T*>(m_part->elts))\n    {}\n\n    NgxListIterator() = default;\n    ~NgxListIterator() = default;\npublic:\n    NgxListIterator(NgxListIterator const&) = default;\n    NgxListIterator& operator=(const NgxListIterator&) = default;\npublic:\n    BOOST_EXPLICIT_OPERATOR_BOOL()\n\n    \/\/ check invalid\n    bool operator!() const\n    {\n        return !m_part || !m_data || !m_part->nelts;\n    }\n\nprivate:\n    friend class boost::iterator_core_access;\n\n    reference dereference() const\n    {\n        NgxException::require(m_data);\n        return m_data[m_count];\n    }\n\n    void increment()\n    {\n        if(!m_part || !m_data)\n        {\n            return;\n        }\n\n        ++m_count;\n\n        if(m_count >= m_part->nelts)\n        {\n            m_count = 0;\n            m_part = m_part->next;\n\n            m_data = m_part?\n                     static_cast<T*>(m_part->elts):\n                     nullptr;\n        }\n    }\n\n    bool equal(NgxListIterator const& o) const\n    {\n        return m_part == o.m_part &&\n               m_data == o.m_data &&\n               m_count == o.m_count;\n    }\nprivate:\n    ngx_list_part_t* m_part = nullptr;\n    T* m_data = nullptr;\n    ngx_uint_t m_count = 0;\n};\n\ntemplate<typename T>\nclass NgxList final : public NgxWrapper<ngx_list_t>\n{\npublic:\n    typedef NgxWrapper<ngx_list_t> super_type;\n    typedef NgxList this_type;\n\n    typedef T value_type;\npublic:\n    NgxList(const NgxPool& p, ngx_uint_t n = 10):\n        super_type(p.list<T>(n))\n    {}\n\n    NgxList(ngx_list_t* l):super_type(l)\n    {}\n\n    NgxList(ngx_list_t& l):super_type(&l)\n    {}\n\n    ~NgxList() = default;\npublic:\n    T& prepare() const\n    {\n        auto tmp = ngx_list_push(get());\n\n        NgxException::require(tmp);\n\n        assert(tmp);\n        return *reinterpret_cast<T*>(tmp);\n    }\n\n    void push(const T& x) const\n    {\n        prepare() = x;\n    }\npublic:\n    bool empty() const\n    {\n        return !get()->part->nelts;\n    }\n\npublic:\n    void clear() const\n    {\n        get()->part.nelts = 0;\n        get()->part.next = nullptr;\n        get()->last = &get()->part;\n    }\npublic:\n    template<typename U>\n    NgxList<U> reshape(ngx_uint_t n = 0, ngx_pool_t* pool = nullptr) const\n    {\n        auto rc = ngx_list_init(get(),\n                    pool ? pool: get()->pool,\n                    n ? n : get()->nalloc,\n                    sizeof(U)\n                    );\n\n        NgxException::require(rc);\n\n        return get();\n    }\n\n    void reinit(ngx_uint_t n = 0) const\n    {\n        reshape<T>(n);\n    }\npublic:\n    void merge(const this_type& l) const\n    {\n        auto f = [this](const value_type& v)\n        {\n            prepare() = v;\n        };\n\n        l.visit(f);\n    }\npublic:\n    typedef NgxListIterator<T> iterator;\n    typedef const iterator const_iterator;\n\n    iterator begin() const\n    {\n        return iterator(get());\n    }\n\n    iterator end() const\n    {\n        return iterator();\n        \/\/static iterator e;\n        \/\/return e;\n    }\npublic:\n    template<typename V>\n    void visit(V v) const\n    {\n        auto iter = begin();\n        for(; iter; ++iter)\n        {\n            v(*iter);\n        }\n    }\npublic:\n    \/\/ use predicate to find some value\n    template<typename Predicate>\n    iterator find(Predicate p) const\n    {\n        auto iter = begin();\n        for(; iter; ++iter)\n        {\n            if(p(*iter))\n            {\n                return iter;\n            }\n        }\n\n        return end();\n    }\n};\n\n#endif  \/\/_NGX_LIST_HPP\n<commit_msg>NgxList.hpp<commit_after>\/\/ Copyright (c) 2015-2017\n\/\/ Author: Chrono Law\n#ifndef _NGX_LIST_HPP\n#define _NGX_LIST_HPP\n\n\/\/#include <boost\/iterator\/iterator_facade.hpp>\n\/\/#include <boost\/core\/explicit_operator_bool.hpp>\n\n#include \"NgxPool.hpp\"\n\ntemplate<typename T>\nclass NgxListIterator final :\n        public boost::iterator_facade<\n                    NgxListIterator<T>, T,\n                    boost::single_pass_traversal_tag>\n{\npublic:\n    typedef boost::iterator_facade<\n                    NgxListIterator<T>, T,\n                    boost::single_pass_traversal_tag>\n            super_type;\n    typedef typename super_type::reference reference;\npublic:\n    NgxListIterator(ngx_list_t* l):\n        m_part(&l->part),\n        m_data(static_cast<T*>(m_part->elts))\n    {}\n\n    NgxListIterator() = default;\n    ~NgxListIterator() = default;\npublic:\n    NgxListIterator(NgxListIterator const&) = default;\n    NgxListIterator& operator=(const NgxListIterator&) = default;\npublic:\n    BOOST_EXPLICIT_OPERATOR_BOOL()\n\n    \/\/ check invalid\n    bool operator!() const\n    {\n        return !m_part || !m_data || !m_part->nelts;\n    }\n\nprivate:\n    friend class boost::iterator_core_access;\n\n    reference dereference() const\n    {\n        NgxException::require(m_data);\n        return m_data[m_count];\n    }\n\n    void increment()\n    {\n        if(!m_part || !m_data)\n        {\n            return;\n        }\n\n        ++m_count;\n\n        if(m_count >= m_part->nelts)\n        {\n            m_count = 0;\n            m_part = m_part->next;\n\n            m_data = m_part?\n                     static_cast<T*>(m_part->elts):\n                     nullptr;\n        }\n    }\n\n    bool equal(NgxListIterator const& o) const\n    {\n        return m_part == o.m_part &&\n               m_data == o.m_data &&\n               m_count == o.m_count;\n    }\nprivate:\n    ngx_list_part_t* m_part = nullptr;\n    T* m_data = nullptr;\n    ngx_uint_t m_count = 0;\n};\n\ntemplate<typename T>\nclass NgxList final : public NgxWrapper<ngx_list_t>\n{\npublic:\n    typedef NgxWrapper<ngx_list_t> super_type;\n    typedef NgxList this_type;\n\n    typedef T value_type;\npublic:\n    NgxList(const NgxPool& p, ngx_uint_t n = 10):\n        super_type(p.list<T>(n))\n    {}\n\n    NgxList(ngx_list_t* l):super_type(l)\n    {}\n\n    NgxList(ngx_list_t& l):super_type(&l)\n    {}\n\n    ~NgxList() = default;\npublic:\n    T& prepare() const\n    {\n        auto tmp = ngx_list_push(get());\n\n        NgxException::require(tmp);\n\n        assert(tmp);\n        return *reinterpret_cast<T*>(tmp);\n    }\n\n    void push(const T& x) const\n    {\n        prepare() = x;\n    }\npublic:\n    bool empty() const\n    {\n        return !get()->part->nelts;\n    }\n\npublic:\n    void clear() const\n    {\n        get()->part.nelts = 0;\n        get()->part.next = nullptr;\n        get()->last = &get()->part;\n    }\npublic:\n    template<typename U>\n    NgxList<U> reshape(ngx_uint_t n = 0, ngx_pool_t* pool = nullptr) const\n    {\n        auto rc = ngx_list_init(get(),\n                    pool ? pool: get()->pool,\n                    n ? n : get()->nalloc,\n                    sizeof(U)\n                    );\n\n        NgxException::require(rc);\n\n        return get();\n    }\n\n    void reinit(ngx_uint_t n = 0) const\n    {\n        reshape<T>(n);\n    }\npublic:\n    void merge(const this_type& l) const\n    {\n        auto f = [this](const value_type& v)\n        {\n            prepare() = v;\n        };\n\n        l.visit(f);\n    }\npublic:\n    typedef NgxListIterator<T> iterator;\n    typedef const iterator const_iterator;\n\n    iterator begin() const\n    {\n        return iterator(get());\n    }\n\n    iterator end() const\n    {\n        return iterator();\n    }\npublic:\n    template<typename V>\n    void visit(V v) const\n    {\n        auto iter = begin();\n        for(; iter; ++iter)\n        {\n            v(*iter);\n        }\n    }\npublic:\n    \/\/ use predicate to find some value\n    template<typename Predicate>\n    iterator find(Predicate p) const\n    {\n        auto iter = begin();\n        for(; iter; ++iter)\n        {\n            if(p(*iter))\n            {\n                return iter;\n            }\n        }\n\n        return end();\n    }\n};\n\n#endif  \/\/_NGX_LIST_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkGLSLShaderProgram.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 2003 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\n\n#include \"vtkGLSLShaderProgram.h\"\n\n#include \"vtkActor.h\"\n#include \"vtkCollectionIterator.h\"\n#include \"vtkGLSLShader.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkProperty.h\"\n#include \"vtkRenderer.h\"\n#include \"vtkTexture.h\"\n#include \"vtkXMLDataElement.h\"\n\n#include <vtkstd\/vector>\n\/\/ GL\/glu.h is needed for the error reporting, this should be removed\n\/\/ after the initial development phase.\n\/\/#include <GL\/glu.h>\n#include <vtkgl.h>\n\n#if 1\n#define printOpenGLError() printOglError(__FILE__, __LINE__)\nint printOglError(char *vtkNotUsed(file), int vtkNotUsed(line))\n  {\n  \/\/ Returns 1 if an OpenGL error occurred, 0 otherwise.\n  \/\/\n  GLenum glErr;\n  int    retCode = 0;\n\n  glErr = glGetError();\n  while (glErr != GL_NO_ERROR)\n    {\n    \/\/printf(\"glError in file %s @ line %d: %s\\n\", file, line, gluErrorString(glErr));\n    cout << \"Error in GLSLShaderProgram\" << endl;\n    retCode = 1;\n    glErr = glGetError();\n    }\n  return retCode;\n  }\n#endif\n\n\/\/-----------------------------------------------------------------------------\nvtkCxxRevisionMacro(vtkGLSLShaderProgram, \"1.8\");\nvtkStandardNewMacro(vtkGLSLShaderProgram);\n\n\/\/-----------------------------------------------------------------------------\nvtkGLSLShaderProgram::vtkGLSLShaderProgram()\n  : Program(0),\n    Info(NULL)\n{\n\n}\n\n\/\/-----------------------------------------------------------------------------\nvtkGLSLShaderProgram::~vtkGLSLShaderProgram()\n{\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvtkShader* vtkGLSLShaderProgram::NewShader()\n{\n  return vtkGLSLShader::New();\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkGLSLShaderProgram::ReleaseGraphicsResources(vtkWindow* w)\n{\n  if (this->IsProgram())\n    {\n    vtkgl::DeleteProgram(this->Program);\n    this->Program = 0;\n    }\n  this->Superclass::ReleaseGraphicsResources(w);\n}\n\n\/\/-----------------------------------------------------------------------------\nunsigned int vtkGLSLShaderProgram::GetProgram()\n{\n  return this->Program;\n}\n  \n\/\/-----------------------------------------------------------------------------\nvoid vtkGLSLShaderProgram::Link()\n{\n\n}\n\n\/\/-----------------------------------------------------------------------------\nint vtkGLSLShaderProgram::IsProgram()\n{\n  if( this->Program )\n    {\n    if( vtkgl::IsProgram( static_cast<GLuint>(this->Program) ) == GL_TRUE )\n      {\n      return true;\n      }\n    }\n  return false;\n}\n\n\/\/-----------------------------------------------------------------------------\nint vtkGLSLShaderProgram::IsLinked()\n{\n  if( this->IsProgram() == false )\n    {\n    return false;\n    }\n\n  GLint value = 0;\n  vtkgl::GetProgramiv( static_cast<GLuint>(this->Program),\n                  vtkgl::OBJECT_LINK_STATUS_ARB,\n                  &value );\n  if( value == 1 )\n    {\n    return true;\n    }\n  return false;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkGLSLShaderProgram::GetProgramInfo()\n{\n  if (!this->Program)\n    {\n    return;\n    }\n\n  vtkstd::string infoString;\n  \/\/ is this a GLSL Program?\n  GLint type = 0;\n  vtkgl::GetProgramiv( static_cast<GLuint>(this->Program), \n    vtkgl::OBJECT_TYPE_ARB, &type);\n  if( type == vtkgl::PROGRAM_OBJECT_ARB )\n    {\n    infoString += \"GLSL Program. \\n\";\n    }\n  else\n    {\n    infoString += \"Not a GLSL Program. \\n\";\n    }\n\n  \/\/ is this Program linked?\n  GLint linked = 0;\n  vtkgl::GetProgramiv( static_cast<GLuint>(this->Program), \n    vtkgl::OBJECT_LINK_STATUS_ARB, &linked );\n  infoString += \"Linked Status: \";\n  char linkedStr[256];\n  sprintf( linkedStr, \"%d\", static_cast<int>(linked) );\n  infoString += linkedStr;\n  infoString += \"\\n\";\n  \/\/<< linked << endl;\n\n  \/\/ how many objects are attached?\n  GLint numObjects = 0;\n  vtkgl::GetProgramiv( static_cast<GLuint>(this->Program), \n    vtkgl::OBJECT_ATTACHED_OBJECTS_ARB, &numObjects );\n  char numStr[256];\n  sprintf( numStr, \"%d\", static_cast<int>(numObjects) );\n  infoString += \"Number of attached objects: \";\n  infoString += numStr;\n  infoString += \"\\n\";\n\n\n  \/\/ Anything in the info log?\n  GLint maxLength = 0;\n  vtkgl::GetProgramiv( static_cast<GLuint>(this->Program), \n    vtkgl::OBJECT_INFO_LOG_LENGTH_ARB, &maxLength );\n  vtkgl::GLchar* info = new vtkgl::GLchar[maxLength];\n\n  GLsizei charsWritten;\n  vtkgl::GetProgramInfoLog( static_cast<GLuint>(this->Program), maxLength, \n    &charsWritten, info );\n\n  if( info )\n    {\n    infoString += static_cast<char*>(info);\n    infoString += \"\\n\";\n    }\n\n  if( infoString.empty() )\n    {\n    this->SetInfo( \"No Program Info.\" );\n    }\n  else\n    {\n    this->SetInfo( infoString.c_str() );\n    }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkGLSLShaderProgram::GetInfoLog()\n{\n  \/\/ Anything in the info log?\n  int infologLength = 0;\n  int charsWritten  = 0;\n  vtkgl::GLchar *infoLog = NULL;\n  vtkgl::GetProgramiv(static_cast<GLuint>(this->Program), vtkgl::INFO_LOG_LENGTH, \n    reinterpret_cast<GLint*>(&infologLength));\n  if(infologLength > 0)\n    {\n    infoLog = new vtkgl::GLchar[infologLength];\n    if(infoLog == NULL)\n      {\n      printf(\"ERROR: Could not allocate InfoLog buffer\\n\");\n      return;\n      }\n    vtkgl::GetProgramInfoLog(static_cast<GLuint>(this->Program), infologLength, \n      reinterpret_cast<GLsizei*>(&charsWritten), infoLog);\n    }\n  if( !infoLog )\n    {\n    this->SetInfo( infoLog );\n    }\n  else\n    {\n    this->SetInfo( \"No Log Info.\" );\n    }\n\n  if( infoLog )\n    {\n    delete [] infoLog;\n    }\n}\n\n\/\/-----------------------------------------------------------------------------\nint vtkGLSLShaderProgram::IsAttached(vtkGLSLShader* glslshader)\n{\n  unsigned int handle = glslshader->GetHandle();\n  int attached = 0;\n  \/\/ find out what's attached\n  GLint numObjects = 0;\n  GLint writtenObjects = 0;\n  vtkgl::GetProgramiv(static_cast<GLuint>(this->Program), \n    vtkgl::OBJECT_ATTACHED_OBJECTS_ARB, &numObjects);\n  vtkstd::vector<GLuint> attachedObjects(numObjects);\n  if( numObjects > 0 )\n    {\n    vtkgl::GetAttachedShaders(static_cast<GLuint>(this->Program), numObjects, \n      &writtenObjects, &attachedObjects[0]);\n    }\n\n  vtkstd::vector<GLuint>::iterator it = attachedObjects.begin();\n  vtkstd::vector<GLuint>::iterator itEnd = attachedObjects.end();\n  while( it != itEnd )\n    {\n    if( static_cast<GLuint>(handle) == *it )\n      {\n      attached = 1;\n      }\n    it++;\n    }\n  return attached;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkGLSLShaderProgram::Render(vtkActor *actor, vtkRenderer *renderer)\n{\n  this->LoadExtensions( renderer->GetRenderWindow() );\n\n  \/\/ Get a gl identifier for the shader program if we don't already have one.\n  if( vtkgl::IsProgram(static_cast<GLuint>(this->Program)) == GL_FALSE )\n    {\n    this->Program = static_cast<unsigned int>(vtkgl::CreateProgram());\n    }\n  \n  if( vtkgl::IsProgram(static_cast<GLuint>(this->Program)) == GL_FALSE )\n    {\n    vtkErrorMacro( \"Not able to create a GLSL Program!!!\" << endl );\n    return;\n    }\n  \n  vtkCollectionIterator* iter = this->ShaderCollectionIterator;\n  for (iter->InitTraversal(); !iter->IsDoneWithTraversal();\n    iter->GoToNextItem())\n    {\n    vtkGLSLShader* shader = vtkGLSLShader::SafeDownCast(\n      iter->GetCurrentObject());\n\n    if (!shader)\n      {\n      vtkErrorMacro(\"GLSL Shader program cannot contain a non-GLSL shader.\");\n      continue;\n      }\n    \n    if (shader->Compile())\n      {\n      if (!this->IsAttached(shader))\n        {\n        vtkgl::AttachShader(static_cast<GLuint>(this->Program), \n          shader->GetHandle());\n        }\n      }\n    }\n\n  if( !this->IsLinked() )\n    {\n    \/\/ if either a vertex or a fragment program is attached (or both)\n    \/\/ link the program.\n    GLint numObjects = 0;\n    vtkgl::GetProgramiv( static_cast<GLuint>(this->Program),\n      vtkgl::OBJECT_ATTACHED_OBJECTS_ARB, &numObjects );\n    if (numObjects>0)\n      {\n      vtkgl::LinkProgram(static_cast<GLuint>(this->Program));\n      }\n    }\n\n  if( this->IsLinked() )\n    {\n    \/\/ check to see if this is the active program\n    vtkgl::UseProgram(static_cast<GLuint>(this->Program));\n    }\n\n  \/\/ handle attributes and uniform variables\n  \/\/ uniform variables\n  for (iter->InitTraversal(); !iter->IsDoneWithTraversal();\n    iter->GoToNextItem())\n    {\n    vtkGLSLShader* shader = vtkGLSLShader::SafeDownCast(\n      iter->GetCurrentObject());\n    if (!shader)\n      {\n      \/\/ no need to flag error...already marked.\n      continue;\n      }\n    shader->SetProgram(this->Program);\n    shader->PassShaderVariables(actor, renderer);\n    }\n\n  \/\/ establish any textures the shader might use\n  vtkProperty *property = actor->GetProperty();\n  vtkIdType numTextures = property->GetNumberOfTextures();\n\n  GLint numSupportedTextures;\n  glGetIntegerv(vtkgl::MAX_TEXTURE_UNITS, &numSupportedTextures);\n  if (numTextures >= numSupportedTextures)\n    {\n    vtkErrorMacro(\"Hardware does not support the number of textures defined.\");\n    }\n\n  for (vtkIdType i = 0; i < numTextures; i++)\n    {\n    vtkgl::ActiveTexture(vtkgl::TEXTURE0 + i);\n    property->GetTexture(i)->Render(renderer);\n    }\n  vtkgl::ActiveTexture(vtkgl::TEXTURE0);\n}\n\/\/-----------------------------------------------------------------------------\nvoid vtkGLSLShaderProgram::PostRender(vtkActor* actor, vtkRenderer*)\n{\n  if (this->IsProgram())\n    {\n    \/\/ this unloads the shader program.\n    vtkgl::UseProgram(0);\n    }\n\n  \/\/ Disable any textures that may have been enabled.\n  vtkProperty *property = actor->GetProperty();\n  vtkIdType numTextures = property->GetNumberOfTextures();\n  for (vtkIdType i = 0; i < numTextures; i++)\n    {\n    vtkgl::ActiveTexture(vtkgl::TEXTURE0 + i);\n    \/\/ Disable any possible texture.  Wouldn't having a PostRender on\n    \/\/ vtkTexture be better?\n    glDisable(GL_TEXTURE_1D);\n    glDisable(GL_TEXTURE_2D);\n    glDisable(vtkgl::TEXTURE_3D);\n    glDisable(vtkgl::TEXTURE_RECTANGLE_ARB);\n    glDisable(vtkgl::TEXTURE_CUBE_MAP);\n    }\n  vtkgl::ActiveTexture(vtkgl::TEXTURE0);\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkGLSLShaderProgram::PrintSelf(ostream &os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os, indent);\n}\n\n<commit_msg>STYLE: Prefer OpenGL 2.0 constants over GL_ARB_shader_objects constants.<commit_after>\/*=========================================================================\n\n  Program:   Visualization Toolkit\n  Module:    vtkGLSLShaderProgram.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 2003 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\n\n#include \"vtkGLSLShaderProgram.h\"\n\n#include \"vtkActor.h\"\n#include \"vtkCollectionIterator.h\"\n#include \"vtkGLSLShader.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkProperty.h\"\n#include \"vtkRenderer.h\"\n#include \"vtkTexture.h\"\n#include \"vtkXMLDataElement.h\"\n\n#include <vtkstd\/vector>\n\/\/ GL\/glu.h is needed for the error reporting, this should be removed\n\/\/ after the initial development phase.\n\/\/#include <GL\/glu.h>\n#include <vtkgl.h>\n\n#if 1\n#define printOpenGLError() printOglError(__FILE__, __LINE__)\nint printOglError(char *vtkNotUsed(file), int vtkNotUsed(line))\n  {\n  \/\/ Returns 1 if an OpenGL error occurred, 0 otherwise.\n  \/\/\n  GLenum glErr;\n  int    retCode = 0;\n\n  glErr = glGetError();\n  while (glErr != GL_NO_ERROR)\n    {\n    \/\/printf(\"glError in file %s @ line %d: %s\\n\", file, line, gluErrorString(glErr));\n    cout << \"Error in GLSLShaderProgram\" << endl;\n    retCode = 1;\n    glErr = glGetError();\n    }\n  return retCode;\n  }\n#endif\n\n\/\/-----------------------------------------------------------------------------\nvtkCxxRevisionMacro(vtkGLSLShaderProgram, \"1.9\");\nvtkStandardNewMacro(vtkGLSLShaderProgram);\n\n\/\/-----------------------------------------------------------------------------\nvtkGLSLShaderProgram::vtkGLSLShaderProgram()\n  : Program(0),\n    Info(NULL)\n{\n\n}\n\n\/\/-----------------------------------------------------------------------------\nvtkGLSLShaderProgram::~vtkGLSLShaderProgram()\n{\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvtkShader* vtkGLSLShaderProgram::NewShader()\n{\n  return vtkGLSLShader::New();\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkGLSLShaderProgram::ReleaseGraphicsResources(vtkWindow* w)\n{\n  if (this->IsProgram())\n    {\n    vtkgl::DeleteProgram(this->Program);\n    this->Program = 0;\n    }\n  this->Superclass::ReleaseGraphicsResources(w);\n}\n\n\/\/-----------------------------------------------------------------------------\nunsigned int vtkGLSLShaderProgram::GetProgram()\n{\n  return this->Program;\n}\n  \n\/\/-----------------------------------------------------------------------------\nvoid vtkGLSLShaderProgram::Link()\n{\n\n}\n\n\/\/-----------------------------------------------------------------------------\nint vtkGLSLShaderProgram::IsProgram()\n{\n  if( this->Program )\n    {\n    if( vtkgl::IsProgram( static_cast<GLuint>(this->Program) ) == GL_TRUE )\n      {\n      return true;\n      }\n    }\n  return false;\n}\n\n\/\/-----------------------------------------------------------------------------\nint vtkGLSLShaderProgram::IsLinked()\n{\n  if( this->IsProgram() == false )\n    {\n    return false;\n    }\n\n  GLint value = 0;\n  vtkgl::GetProgramiv(static_cast<GLuint>(this->Program),\n                      vtkgl::LINK_STATUS, &value);\n  if( value == 1 )\n    {\n    return true;\n    }\n  return false;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkGLSLShaderProgram::GetProgramInfo()\n{\n  if (!this->Program)\n    {\n    return;\n    }\n\n  vtkstd::string infoString;\n  \/\/ is this a GLSL Program?\n  GLint type = 0;\n  vtkgl::GetProgramiv( static_cast<GLuint>(this->Program), \n    vtkgl::OBJECT_TYPE_ARB, &type);\n  if( type == vtkgl::PROGRAM_OBJECT_ARB )\n    {\n    infoString += \"GLSL Program. \\n\";\n    }\n  else\n    {\n    infoString += \"Not a GLSL Program. \\n\";\n    }\n\n  \/\/ is this Program linked?\n  GLint linked = 0;\n  vtkgl::GetProgramiv( static_cast<GLuint>(this->Program), \n                       vtkgl::LINK_STATUS, &linked );\n  infoString += \"Linked Status: \";\n  char linkedStr[256];\n  sprintf( linkedStr, \"%d\", static_cast<int>(linked) );\n  infoString += linkedStr;\n  infoString += \"\\n\";\n  \/\/<< linked << endl;\n\n  \/\/ how many objects are attached?\n  GLint numObjects = 0;\n  vtkgl::GetProgramiv( static_cast<GLuint>(this->Program), \n    vtkgl::OBJECT_ATTACHED_OBJECTS_ARB, &numObjects );\n  char numStr[256];\n  sprintf( numStr, \"%d\", static_cast<int>(numObjects) );\n  infoString += \"Number of attached objects: \";\n  infoString += numStr;\n  infoString += \"\\n\";\n\n\n  \/\/ Anything in the info log?\n  GLint maxLength = 0;\n  vtkgl::GetProgramiv( static_cast<GLuint>(this->Program), \n                       vtkgl::ATTACHED_SHADERS, &maxLength );\n  vtkgl::GLchar* info = new vtkgl::GLchar[maxLength];\n\n  GLsizei charsWritten;\n  vtkgl::GetProgramInfoLog( static_cast<GLuint>(this->Program), maxLength, \n    &charsWritten, info );\n\n  if( info )\n    {\n    infoString += static_cast<char*>(info);\n    infoString += \"\\n\";\n    }\n\n  if( infoString.empty() )\n    {\n    this->SetInfo( \"No Program Info.\" );\n    }\n  else\n    {\n    this->SetInfo( infoString.c_str() );\n    }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkGLSLShaderProgram::GetInfoLog()\n{\n  \/\/ Anything in the info log?\n  int infologLength = 0;\n  int charsWritten  = 0;\n  vtkgl::GLchar *infoLog = NULL;\n  vtkgl::GetProgramiv(static_cast<GLuint>(this->Program), vtkgl::INFO_LOG_LENGTH, \n    reinterpret_cast<GLint*>(&infologLength));\n  if(infologLength > 0)\n    {\n    infoLog = new vtkgl::GLchar[infologLength];\n    if(infoLog == NULL)\n      {\n      printf(\"ERROR: Could not allocate InfoLog buffer\\n\");\n      return;\n      }\n    vtkgl::GetProgramInfoLog(static_cast<GLuint>(this->Program), infologLength, \n      reinterpret_cast<GLsizei*>(&charsWritten), infoLog);\n\n    this->SetInfo( infoLog );\n    delete [] infoLog;\n    }\n  else\n    {\n    this->SetInfo( \"No Log Info.\" );\n    }\n}\n\n\/\/-----------------------------------------------------------------------------\nint vtkGLSLShaderProgram::IsAttached(vtkGLSLShader* glslshader)\n{\n  unsigned int handle = glslshader->GetHandle();\n  int attached = 0;\n  \/\/ find out what's attached\n  GLint numObjects = 0;\n  GLint writtenObjects = 0;\n  vtkgl::GetProgramiv(static_cast<GLuint>(this->Program), \n                      vtkgl::ATTACHED_SHADERS, &numObjects);\n  vtkstd::vector<GLuint> attachedObjects(numObjects);\n  if( numObjects > 0 )\n    {\n    vtkgl::GetAttachedShaders(static_cast<GLuint>(this->Program), numObjects, \n      &writtenObjects, &attachedObjects[0]);\n    }\n\n  vtkstd::vector<GLuint>::iterator it = attachedObjects.begin();\n  vtkstd::vector<GLuint>::iterator itEnd = attachedObjects.end();\n  while( it != itEnd )\n    {\n    if( static_cast<GLuint>(handle) == *it )\n      {\n      attached = 1;\n      }\n    it++;\n    }\n  return attached;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkGLSLShaderProgram::Render(vtkActor *actor, vtkRenderer *renderer)\n{\n  this->LoadExtensions( renderer->GetRenderWindow() );\n\n  \/\/ Get a gl identifier for the shader program if we don't already have one.\n  if( vtkgl::IsProgram(static_cast<GLuint>(this->Program)) == GL_FALSE )\n    {\n    this->Program = static_cast<unsigned int>(vtkgl::CreateProgram());\n    }\n  \n  if( vtkgl::IsProgram(static_cast<GLuint>(this->Program)) == GL_FALSE )\n    {\n    vtkErrorMacro( \"Not able to create a GLSL Program!!!\" << endl );\n    return;\n    }\n  \n  vtkCollectionIterator* iter = this->ShaderCollectionIterator;\n  for (iter->InitTraversal(); !iter->IsDoneWithTraversal();\n    iter->GoToNextItem())\n    {\n    vtkGLSLShader* shader = vtkGLSLShader::SafeDownCast(\n      iter->GetCurrentObject());\n\n    if (!shader)\n      {\n      vtkErrorMacro(\"GLSL Shader program cannot contain a non-GLSL shader.\");\n      continue;\n      }\n    \n    if (shader->Compile())\n      {\n      if (!this->IsAttached(shader))\n        {\n        vtkgl::AttachShader(static_cast<GLuint>(this->Program), \n          shader->GetHandle());\n        }\n      }\n    }\n\n  if( !this->IsLinked() )\n    {\n    \/\/ if either a vertex or a fragment program is attached (or both)\n    \/\/ link the program.\n    GLint numObjects = 0;\n    vtkgl::GetProgramiv( static_cast<GLuint>(this->Program),\n                         vtkgl::ATTACHED_SHADERS, &numObjects );\n    if (numObjects>0)\n      {\n      vtkgl::LinkProgram(static_cast<GLuint>(this->Program));\n      if (!this->IsLinked())\n        {\n        this->GetInfoLog();\n        vtkErrorMacro(<< \"Failed to link GLSL program:\\n\"\n                      << this->Info);\n        }\n      }\n    }\n\n  if( this->IsLinked() )\n    {\n    \/\/ check to see if this is the active program\n    vtkgl::UseProgram(static_cast<GLuint>(this->Program));\n    }\n\n  \/\/ handle attributes and uniform variables\n  \/\/ uniform variables\n  for (iter->InitTraversal(); !iter->IsDoneWithTraversal();\n    iter->GoToNextItem())\n    {\n    vtkGLSLShader* shader = vtkGLSLShader::SafeDownCast(\n      iter->GetCurrentObject());\n    if (!shader)\n      {\n      \/\/ no need to flag error...already marked.\n      continue;\n      }\n    shader->SetProgram(this->Program);\n    shader->PassShaderVariables(actor, renderer);\n    }\n\n  \/\/ establish any textures the shader might use\n  vtkProperty *property = actor->GetProperty();\n  vtkIdType numTextures = property->GetNumberOfTextures();\n\n  GLint numSupportedTextures;\n  glGetIntegerv(vtkgl::MAX_TEXTURE_UNITS, &numSupportedTextures);\n  if (numTextures >= numSupportedTextures)\n    {\n    vtkErrorMacro(\"Hardware does not support the number of textures defined.\");\n    }\n\n  for (vtkIdType i = 0; i < numTextures; i++)\n    {\n    vtkgl::ActiveTexture(vtkgl::TEXTURE0 + i);\n    property->GetTexture(i)->Render(renderer);\n    }\n  vtkgl::ActiveTexture(vtkgl::TEXTURE0);\n}\n\/\/-----------------------------------------------------------------------------\nvoid vtkGLSLShaderProgram::PostRender(vtkActor* actor, vtkRenderer*)\n{\n  if (this->IsProgram())\n    {\n    \/\/ this unloads the shader program.\n    vtkgl::UseProgram(0);\n    }\n\n  \/\/ Disable any textures that may have been enabled.\n  vtkProperty *property = actor->GetProperty();\n  vtkIdType numTextures = property->GetNumberOfTextures();\n  for (vtkIdType i = 0; i < numTextures; i++)\n    {\n    vtkgl::ActiveTexture(vtkgl::TEXTURE0 + i);\n    \/\/ Disable any possible texture.  Wouldn't having a PostRender on\n    \/\/ vtkTexture be better?\n    glDisable(GL_TEXTURE_1D);\n    glDisable(GL_TEXTURE_2D);\n    glDisable(vtkgl::TEXTURE_3D);\n    glDisable(vtkgl::TEXTURE_RECTANGLE_ARB);\n    glDisable(vtkgl::TEXTURE_CUBE_MAP);\n    }\n  vtkgl::ActiveTexture(vtkgl::TEXTURE0);\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid vtkGLSLShaderProgram::PrintSelf(ostream &os, vtkIndent indent)\n{\n  this->Superclass::PrintSelf(os, indent);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"util\/ThreadPool.h\"\n\nSusi::Util::ThreadPool::ThreadPool( size_t workers, size_t buffsize ) : _workChannel {buffsize} {\n    for( size_t i=0; ( i<workers ); ++i ) {\n        startThread();\n    }\n}\n\nvoid Susi::Util::ThreadPool::startThread() {\n    std::thread t {[this]() {\n        while( true ) {\n            Work work;\n            try {\n                work = this->_workChannel.get();\n            }\n            catch( const std::exception & e ) {\n                \/\/std::cout<<\"error in worker: \"<<e.what()<<std::endl;\n                return;\n            }\n            try {\n                work.work();\n            }\n            catch( const std::exception & e ) {\n                if( work.error ) {\n                    work.error( e.what() );\n                }\n            }\n        }\n    }};\n    _threads.push_back( std::move( t ) );\n}\n\nvoid Susi::Util::ThreadPool::add( std::function<void()> work,\n                                  std::function<void( std::string )> error ) {\n    _workChannel.put( Work {work,error} );\n}\n\nSusi::Util::ThreadPool::~ThreadPool() {\n    _workChannel.close();\n    for( auto & t : _threads ) {\n        t.join();\n    }\n}<commit_msg>[dummy];<commit_after>#include \"util\/ThreadPool.h\"\n\nSusi::Util::ThreadPool::ThreadPool( size_t workers, size_t buffsize ) : _workChannel {buffsize} {\n    for( size_t i=0; ( i<workers ); ++i ) {\n        startThread();\n    }\n}\n\nvoid Susi::Util::ThreadPool::startThread() {\n    std::thread t {[this]() {\n        while( true ) {\n            Work work;\n            try {\n                work = this->_workChannel.get();\n            }\n            catch( const std::exception & e ) {\n                \/\/std::cout<<\"error in worker: \"<<e.what()<<std::endl;\n                return;\n            }\n            try {\n                work.work();\n            }\n            catch( const std::exception & e ) {\n                if( work.error ) {\n                    work.error( e.what() );\n                }\n            }\n        }\n    }};\n    \n    _threads.push_back( std::move( t ) );\n}\n\nvoid Susi::Util::ThreadPool::add( std::function<void()> work,\n                                  std::function<void( std::string )> error ) {\n    _workChannel.put( Work {work,error} );\n}\n\nSusi::Util::ThreadPool::~ThreadPool() {\n    _workChannel.close();\n    for( auto & t : _threads ) {\n        t.join();\n    }\n}<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\r\n#include <stdlib.h>\r\nusing namespace std;\r\n\r\n\r\ntemplate <int R, int C>\r\nvoid setRowZero(int row, int col, int(&mat)[R][C])\r\n{\r\n    for (int i = 0; i < col; i++) {\r\n        mat[row][i] = 0;\r\n    }\r\n}\r\n\r\nint main() {\r\n    int m = 3;\r\n    int n = 3;\r\n    int matrix[3][3];\r\n\r\n    for (int i = 0; i < m; i++) {\r\n        for (int j = 0; j < n; j++) {\r\n            matrix[i][j] = rand() % 10;\r\n        }\r\n    }\r\n\r\n    for (int i = 0; i < m; i++) {\r\n        cout << endl;\r\n        for (int j = 0; j < n; j++) {\r\n            cout << matrix[i][j] << \" \";\r\n        }\r\n    }\r\n\r\n    cout << endl << endl;\r\n\r\n    for (int i = 0; i < m; i++) {\r\n        for (int j = 0; j < n; j++) {\r\n            if (matrix[i][j] == 0) {\r\n                setRowZero(i, n, matrix);\r\n            }\r\n        }\r\n    }\r\n\r\n    for (int i = 0; i < m; i++) {\r\n        cout << endl;\r\n        for (int j = 0; j < n; j++) {\r\n            cout << matrix[i][j] << \" \";\r\n        }\r\n    }\r\n\r\n\r\n}\r\n<commit_msg>CTCI questions<commit_after>#include <iostream>\r\n#include <stdlib.h>\r\n#include <ctime>\r\nusing namespace std;\r\n\r\n\r\ntemplate <int R, int C>\r\nvoid setRowZero(int row, int col, int(&mat)[R][C])\r\n{\r\n    for (int i = 0; i < col; i++) {\r\n        mat[row][i] = 0;\r\n    }\r\n}\r\n\r\nint main() {\r\n    int m = 5;\r\n    int n = 3;\r\n    int matrix[5][3];\r\n\r\n    srand(time(NULL));\r\n\r\n    for (int i = 0; i < m; i++) {\r\n        for (int j = 0; j < n; j++) {\r\n            matrix[i][j] = rand() % 10;\r\n        }\r\n    }\r\n\r\n    for (int i = 0; i < m; i++) {\r\n        cout << endl;\r\n        for (int j = 0; j < n; j++) {\r\n            cout << matrix[i][j] << \" \";\r\n        }\r\n    }\r\n\r\n        cout << endl << endl;\r\n\r\n    for (int i = 0; i < m; i++) {\r\n        for (int j = 0; j < n; j++) {\r\n            if (matrix[i][j] == 0) {\r\n                setRowZero(i, n, matrix);\r\n            }\r\n        }\r\n    }\r\n\r\n    for (int i = 0; i < m; i++) {\r\n        cout << endl;\r\n        for (int j = 0; j < n; j++) {\r\n            cout << matrix[i][j] << \" \";\r\n        }\r\n    }\r\n\r\n\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* this file is part of the oxygen gtk engine\n* Copyright (c) 2010 Hugo Pereira Da Costa <hugo@oxygen-icons.org>\n*\n* the tabwidget data code is largely inspired from the gtk redmond engine\n*\n* This  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 \"oxygentabwidgetdata.h\"\n#include \"..\/oxygengtkutils.h\"\n#include \"..\/config.h\"\n\n#include <gtk\/gtk.h>\n#include <cassert>\n#include <iostream>\n\nnamespace Oxygen\n{\n\n    \/\/________________________________________________________________________________\n    void TabWidgetData::connect( GtkWidget* widget )\n    {\n        _target = widget;\n        _motionId = g_signal_connect( G_OBJECT(widget), \"motion-notify-event\", (GCallback)motionNotifyEvent, this );\n        _leaveId = g_signal_connect( G_OBJECT(widget), \"leave-notify-event\", (GCallback)leaveNotifyEvent, this );\n        _pageAddedId = g_signal_connect( G_OBJECT(widget), \"page-added\", (GCallback)pageAddedEvent, this );\n\n        \/\/ cast to notebook and check against number of pages\n        if( GTK_IS_NOTEBOOK( widget ) )\n        {\n            GtkNotebook* notebook( GTK_NOTEBOOK( widget ) );\n            for( int i = 0; i <  gtk_notebook_get_n_pages( notebook ); ++i )\n            {\n\n                \/\/ retrieve page and tab label\n                GtkWidget* page( gtk_notebook_get_nth_page( notebook, i ) );\n                registerChild( gtk_notebook_get_tab_label( notebook, page ) );\n            }\n        }\n\n    }\n\n    \/\/________________________________________________________________________________\n    void TabWidgetData::disconnect( GtkWidget* widget )\n    {\n\n        _target = 0L;\n        g_signal_handler_disconnect(G_OBJECT(widget), _motionId );\n        g_signal_handler_disconnect(G_OBJECT(widget), _leaveId );\n        g_signal_handler_disconnect(G_OBJECT(widget), _pageAddedId );\n\n        \/\/ disconnect all children\n        for( ChildDataMap::iterator iter = _childrenData.begin(); iter != _childrenData.end(); ++iter )\n        { unregisterChild( iter->first ); }\n\n    }\n\n    \/\/________________________________________________________________________________\n    void TabWidgetData::updateHoveredTab(GtkWidget* widget )\n    {\n\n        if( !widget ) widget = _target;\n        if( !widget ) return;\n\n        \/\/ get pointer position\n        int xPointer,yPointer;\n        gdk_window_get_pointer(widget->window,&xPointer,&yPointer,NULL);\n\n        \/\/ loop over tabs and check matching\n        for( unsigned int i = 0; i < _tabRects.size(); i++ )\n        {\n            if( Gtk::gdk_rectangle_contains( &_tabRects[i], xPointer, yPointer ) )\n            { setHoveredTab( widget, i ); return; }\n        }\n\n        \/\/ reset hovered tab\n        setHoveredTab( widget, -1 );\n\n    }\n\n    \/\/________________________________________________________________________________\n    void TabWidgetData::updateTabRect( GtkWidget* widget, int index, const GdkRectangle& r )\n    {\n        \/\/ make sure the vector has the right size\n        if( !GTK_IS_NOTEBOOK( widget ) ) return;\n        GtkNotebook* notebook = GTK_NOTEBOOK( widget );\n        _tabRects.resize( gtk_notebook_get_n_pages( notebook ), defaultRect() );\n\n        \/\/ check index against number of tabs\n        if( index < 0 || index >= (int)_tabRects.size() )\n        { return; }\n\n        \/\/ store rectangle\n        _tabRects[index]=r;\n    }\n\n    \/\/________________________________________________________________________________\n    gboolean TabWidgetData::motionNotifyEvent(GtkWidget* widget, GdkEventMotion*, gpointer data )\n    {\n\n        static_cast<TabWidgetData*>( data )->updateHoveredTab( widget );\n        return FALSE;\n\n    }\n\n    \/\/________________________________________________________________________________\n    gboolean TabWidgetData::leaveNotifyEvent( GtkWidget* widget, GdkEventCrossing*, gpointer data )\n    {\n        \/\/ reset hovered tab\n        static_cast<TabWidgetData*>( data )->setHoveredTab( widget, -1 );\n        return FALSE;\n    }\n\n    \/\/________________________________________________________________________________\n    void TabWidgetData::pageAddedEvent( GtkNotebook*, GtkWidget* child, guint, gpointer data)\n    { static_cast<TabWidgetData*>( data )->registerChild( child ); }\n\n    \/\/________________________________________________________________________________\n    void TabWidgetData::registerChild( GtkWidget* widget )\n    {\n        \/\/ make sure widget is not already in map\n        if( _childrenData.find( widget ) != _childrenData.end() ) return;\n\n        #if OXYGEN_DEBUG\n        std::cout << \"Oxygen::TabWidgetData::registerChild - \" << widget << std::endl;\n        #endif\n\n        \/\/ prepare list of widgets to be connected\n        std::vector<GtkWidget*> widgets;\n\n        \/\/ insert primary widget\n        widgets.push_back( widget );\n\n        \/\/ also insert widget's children (that should take care of buttons in tabs)\n        if( GTK_IS_CONTAINER( widget ) )\n        {\n            GList *children( gtk_container_get_children( GTK_CONTAINER(widget) ) );\n            for( GList* child = g_list_first(children); child; child = g_list_next(child) )\n            { widgets.push_back( GTK_WIDGET( child->data ) ); }\n\n            if( children ) g_list_free( children );\n        }\n\n        \/\/ allocate data and connect callbacks for all stored widgets\n        for( std::vector<GtkWidget*>::const_iterator iter = widgets.begin(); iter != widgets.end(); iter++ )\n        {\n\n            \/\/ allocate new ChildData\n            ChildData data;\n            data._destroyId = g_signal_connect( G_OBJECT(*iter), \"destroy\", G_CALLBACK( childDestroyNotifyEvent ), this );\n            data._styleChangeId = g_signal_connect( G_OBJECT(*iter), \"style-set\", G_CALLBACK( childStyleChangeNotifyEvent ), this );\n            data._enterId = g_signal_connect( G_OBJECT(*iter), \"enter-notify-event\", (GCallback)childCrossingNotifyEvent, this );\n            data._leaveId = g_signal_connect( G_OBJECT(*iter), \"leave-notify-event\", (GCallback)childCrossingNotifyEvent, this );\n\n            \/\/ and insert in map\n            _childrenData.insert( std::make_pair( *iter, data ) );\n\n        }\n\n    }\n\n    \/\/________________________________________________________________________________\n    void TabWidgetData::unregisterChild( GtkWidget* widget )\n    {\n        ChildDataMap::iterator iter( _childrenData.find( widget ) );\n        if( iter == _childrenData.end() ) return;\n\n        #if OXYGEN_DEBUG\n        std::cout << \"Oxygen::TabWidgetData::unregisterChild - \" << widget << std::endl;\n        #endif\n\n        g_signal_handler_disconnect(G_OBJECT(widget), iter->second._destroyId );\n        g_signal_handler_disconnect(G_OBJECT(widget), iter->second._styleChangeId );\n        g_signal_handler_disconnect(G_OBJECT(widget), iter->second._enterId );\n        g_signal_handler_disconnect(G_OBJECT(widget), iter->second._leaveId );\n        _childrenData.erase( iter );\n    }\n\n    \/\/____________________________________________________________________________________________\n    gboolean TabWidgetData::childDestroyNotifyEvent( GtkWidget* widget, gpointer data )\n    {\n        static_cast<TabWidgetData*>(data)->unregisterChild( widget );\n        return FALSE;\n    }\n\n    \/\/____________________________________________________________________________________________\n    void TabWidgetData::childStyleChangeNotifyEvent( GtkWidget* widget, GtkStyle*, gpointer data )\n    { static_cast<TabWidgetData*>(data)->unregisterChild( widget ); }\n\n    \/\/____________________________________________________________________________________________\n    gboolean TabWidgetData::childCrossingNotifyEvent( GtkWidget* widget, GdkEventCrossing*, gpointer data )\n    {\n\n        \/\/ retrieve widget's parent and check type\n        static_cast<TabWidgetData*>(data)->updateHoveredTab();\n        return FALSE;\n\n    }\n\n}\n<commit_msg>Add tab children recursively to detect tab hover.<commit_after>\/*\n* this file is part of the oxygen gtk engine\n* Copyright (c) 2010 Hugo Pereira Da Costa <hugo@oxygen-icons.org>\n*\n* the tabwidget data code is largely inspired from the gtk redmond engine\n*\n* This  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 \"oxygentabwidgetdata.h\"\n#include \"..\/oxygengtkutils.h\"\n#include \"..\/config.h\"\n\n#include <gtk\/gtk.h>\n#include <cassert>\n#include <iostream>\n\nnamespace Oxygen\n{\n\n    \/\/________________________________________________________________________________\n    void TabWidgetData::connect( GtkWidget* widget )\n    {\n        _target = widget;\n        _motionId = g_signal_connect( G_OBJECT(widget), \"motion-notify-event\", (GCallback)motionNotifyEvent, this );\n        _leaveId = g_signal_connect( G_OBJECT(widget), \"leave-notify-event\", (GCallback)leaveNotifyEvent, this );\n        _pageAddedId = g_signal_connect( G_OBJECT(widget), \"page-added\", (GCallback)pageAddedEvent, this );\n\n        \/\/ cast to notebook and check against number of pages\n        if( GTK_IS_NOTEBOOK( widget ) )\n        {\n            GtkNotebook* notebook( GTK_NOTEBOOK( widget ) );\n            for( int i = 0; i <  gtk_notebook_get_n_pages( notebook ); ++i )\n            {\n\n                \/\/ retrieve page and tab label\n                GtkWidget* page( gtk_notebook_get_nth_page( notebook, i ) );\n                registerChild( gtk_notebook_get_tab_label( notebook, page ) );\n            }\n        }\n\n    }\n\n    \/\/________________________________________________________________________________\n    void TabWidgetData::disconnect( GtkWidget* widget )\n    {\n\n        _target = 0L;\n        g_signal_handler_disconnect(G_OBJECT(widget), _motionId );\n        g_signal_handler_disconnect(G_OBJECT(widget), _leaveId );\n        g_signal_handler_disconnect(G_OBJECT(widget), _pageAddedId );\n\n        \/\/ disconnect all children\n        for( ChildDataMap::iterator iter = _childrenData.begin(); iter != _childrenData.end(); ++iter )\n        { unregisterChild( iter->first ); }\n\n    }\n\n    \/\/________________________________________________________________________________\n    void TabWidgetData::updateHoveredTab(GtkWidget* widget )\n    {\n\n        if( !widget ) widget = _target;\n        if( !widget ) return;\n\n        \/\/ get pointer position\n        int xPointer,yPointer;\n        gdk_window_get_pointer(widget->window,&xPointer,&yPointer,NULL);\n\n        \/\/ loop over tabs and check matching\n        for( unsigned int i = 0; i < _tabRects.size(); i++ )\n        {\n            if( Gtk::gdk_rectangle_contains( &_tabRects[i], xPointer, yPointer ) )\n            { setHoveredTab( widget, i ); return; }\n        }\n\n        \/\/ reset hovered tab\n        setHoveredTab( widget, -1 );\n\n    }\n\n    \/\/________________________________________________________________________________\n    void TabWidgetData::updateTabRect( GtkWidget* widget, int index, const GdkRectangle& r )\n    {\n        \/\/ make sure the vector has the right size\n        if( !GTK_IS_NOTEBOOK( widget ) ) return;\n        GtkNotebook* notebook = GTK_NOTEBOOK( widget );\n        _tabRects.resize( gtk_notebook_get_n_pages( notebook ), defaultRect() );\n\n        \/\/ check index against number of tabs\n        if( index < 0 || index >= (int)_tabRects.size() )\n        { return; }\n\n        \/\/ store rectangle\n        _tabRects[index]=r;\n    }\n\n    \/\/________________________________________________________________________________\n    gboolean TabWidgetData::motionNotifyEvent(GtkWidget* widget, GdkEventMotion*, gpointer data )\n    {\n\n        static_cast<TabWidgetData*>( data )->updateHoveredTab( widget );\n        return FALSE;\n\n    }\n\n    \/\/________________________________________________________________________________\n    gboolean TabWidgetData::leaveNotifyEvent( GtkWidget* widget, GdkEventCrossing*, gpointer data )\n    {\n        \/\/ reset hovered tab\n        static_cast<TabWidgetData*>( data )->setHoveredTab( widget, -1 );\n        return FALSE;\n    }\n\n    \/\/________________________________________________________________________________\n    void TabWidgetData::pageAddedEvent( GtkNotebook*, GtkWidget* child, guint, gpointer data)\n    { static_cast<TabWidgetData*>( data )->registerChild( child ); }\n\n    \/\/________________________________________________________________________________\n    void TabWidgetData::registerChild( GtkWidget* widget )\n    {\n        \/\/ make sure widget is not already in map\n        if( _childrenData.find( widget ) != _childrenData.end() ) return;\n\n        #if OXYGEN_DEBUG\n        std::cout << \"Oxygen::TabWidgetData::registerChild - \" << widget << std::endl;\n        #endif\n\n        \/\/ allocate new ChildData\n        ChildData data;\n        data._destroyId = g_signal_connect( G_OBJECT(widget), \"destroy\", G_CALLBACK( childDestroyNotifyEvent ), this );\n        data._styleChangeId = g_signal_connect( G_OBJECT(widget), \"style-set\", G_CALLBACK( childStyleChangeNotifyEvent ), this );\n        data._enterId = g_signal_connect( G_OBJECT(widget), \"enter-notify-event\", (GCallback)childCrossingNotifyEvent, this );\n        data._leaveId = g_signal_connect( G_OBJECT(widget), \"leave-notify-event\", (GCallback)childCrossingNotifyEvent, this );\n\n        \/\/ and insert in map\n        _childrenData.insert( std::make_pair( widget, data ) );\n\n        \/\/ also insert widget's children (that should take care of buttons in tabs)\n        if( GTK_IS_CONTAINER( widget ) )\n        {\n            GList *children( gtk_container_get_children( GTK_CONTAINER(widget) ) );\n            for( GList* child = g_list_first(children); child; child = g_list_next(child) )\n            { registerChild( GTK_WIDGET( child->data ) ); }\n\n            if( children ) g_list_free( children );\n        }\n\n    }\n\n    \/\/________________________________________________________________________________\n    void TabWidgetData::unregisterChild( GtkWidget* widget )\n    {\n        ChildDataMap::iterator iter( _childrenData.find( widget ) );\n        if( iter == _childrenData.end() ) return;\n\n        #if OXYGEN_DEBUG\n        std::cout << \"Oxygen::TabWidgetData::unregisterChild - \" << widget << std::endl;\n        #endif\n\n        g_signal_handler_disconnect(G_OBJECT(widget), iter->second._destroyId );\n        g_signal_handler_disconnect(G_OBJECT(widget), iter->second._styleChangeId );\n        g_signal_handler_disconnect(G_OBJECT(widget), iter->second._enterId );\n        g_signal_handler_disconnect(G_OBJECT(widget), iter->second._leaveId );\n        _childrenData.erase( iter );\n    }\n\n    \/\/____________________________________________________________________________________________\n    gboolean TabWidgetData::childDestroyNotifyEvent( GtkWidget* widget, gpointer data )\n    {\n        static_cast<TabWidgetData*>(data)->unregisterChild( widget );\n        return FALSE;\n    }\n\n    \/\/____________________________________________________________________________________________\n    void TabWidgetData::childStyleChangeNotifyEvent( GtkWidget* widget, GtkStyle*, gpointer data )\n    { static_cast<TabWidgetData*>(data)->unregisterChild( widget ); }\n\n    \/\/____________________________________________________________________________________________\n    gboolean TabWidgetData::childCrossingNotifyEvent( GtkWidget* widget, GdkEventCrossing*, gpointer data )\n    {\n\n        \/\/ retrieve widget's parent and check type\n        static_cast<TabWidgetData*>(data)->updateHoveredTab();\n        return FALSE;\n\n    }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"AliTPCdEdxInfo.h\"\n\n\/\/##################################################################\n\/\/\n\/\/ Simple class to store TPC dE\/dx info for different pad regions.\n\/\/\n\/\/ Origin: Marian Ivanov, Alexander Kalweit \n\/\/\n\/\/##################################################################\n\n\n\nClassImp(AliTPCdEdxInfo)\n\nAliTPCdEdxInfo::AliTPCdEdxInfo():\n  TObject(),\n  fTPCsignalRegion(),\n  fTPCsignalNRegion(),\n  fTPCsignalNRowRegion()\n{\n  \/\/ Default constructor\n  for (Int_t i=0;i<3; i++){\n    fTPCsignalRegion[i]=0;\n    fTPCsignalNRegion[i]=0;\n    fTPCsignalNRowRegion[i]=0;\n  }\n  fTPCsignalRegion[3]=0;\n \n}\n\n\nvoid  AliTPCdEdxInfo::GetTPCSignalRegionInfo(Double32_t signal[4], Char_t ncl[3], Char_t nrows[3]) const {\n  \/\/\n  \/\/ Get the TPC dEdx variables per region\n  \/\/\n  \/\/ Double32_t  fTPCsignalRegion[4]; \/\/ TPC dEdx signal in 4 different regions - 0 - IROC, 1- OROC medium, 2 - OROC long, 3- OROC all, (default truncation used)  \n  \/\/ Char_t      fTPCsignalNRegion[3]; \/\/ number of clusters above threshold used in the dEdx calculation\n  \/\/ Char_t      fTPCsignalNRowRegion[3]; \/\/ number of crosed rows used in the dEdx calculation - signal below threshold included\n  \/\/\n  for (Int_t i=0; i<3; i++){\n    signal[i]=fTPCsignalRegion[i];\n    ncl[i]=fTPCsignalNRegion[i];\n    nrows[i]=fTPCsignalNRowRegion[i];\n  }\n  signal[3]=fTPCsignalRegion[3];\n  return; \n}\n\n\nvoid  AliTPCdEdxInfo::SetTPCSignalRegionInfo(Double32_t signal[4], Char_t ncl[3], Char_t nrows[3]){\n  \/\/\n  \/\/ Set the TPC dEdx variables per region\n  \/\/\n  \/\/ Double32_t  fTPCsignalRegion[4]; \/\/ TPC dEdx signal in 4 different regions - 0 - IROC, 1- OROC medium, 2 - OROC long, 3- OROC all, (default truncation used)  \n  \/\/ Char_t      fTPCsignalNRegion[3]; \/\/ number of clusters above threshold used in the dEdx calculation\n  \/\/ Char_t      fTPCsignalNRowRegion[3]; \/\/ number of crosed rows used in the dEdx calculation - signal below threshold included\n  \/\/\n  for (Int_t i=0;i<3; i++){\n    fTPCsignalRegion[i]=signal[i];\n    fTPCsignalNRegion[i]=ncl[i];\n    fTPCsignalNRowRegion[i]=nrows[i];\n  }\n  fTPCsignalRegion[3]=signal[3];\n  return;\n}\n<commit_msg>putting the copy-constructor back in just to restore compilation<commit_after>#include \"AliTPCdEdxInfo.h\"\n\n\/\/##################################################################\n\/\/\n\/\/ Simple class to store TPC dE\/dx info for different pad regions.\n\/\/\n\/\/ Origin: Marian Ivanov, Alexander Kalweit \n\/\/\n\/\/##################################################################\n\n\n\nClassImp(AliTPCdEdxInfo)\n\nAliTPCdEdxInfo::AliTPCdEdxInfo():\n  TObject(),\n  fTPCsignalRegion(),\n  fTPCsignalNRegion(),\n  fTPCsignalNRowRegion()\n{\n  \/\/ Default constructor\n  for (Int_t i=0;i<3; i++){\n    fTPCsignalRegion[i]=0;\n    fTPCsignalNRegion[i]=0;\n    fTPCsignalNRowRegion[i]=0;\n  }\n  fTPCsignalRegion[3]=0;\n \n}\n\nAliTPCdEdxInfo::AliTPCdEdxInfo(const AliTPCdEdxInfo& source): \t \n    TObject(), \t \n    fTPCsignalRegion(), \t \n    fTPCsignalNRegion(), \t \n    fTPCsignalNRowRegion() \t \n{ \t \n    \/\/ \t \n    \/\/ copy constructor \t \n    \/\/ \t \n    Double32_t signal[4]; Char_t ncl[3]; Char_t nrows[3]; \t \n    source.GetTPCSignalRegionInfo(signal, ncl, nrows); \t \n    for (Int_t i=0;i<3; i++){ \t \n\tfTPCsignalRegion[i]=signal[i]; \t \n\tfTPCsignalNRegion[i]=ncl[i]; \t \n\tfTPCsignalNRowRegion[i]=nrows[i]; \t \n    } \t \n    fTPCsignalRegion[3]=signal[3]; \t \n\n}\n\nvoid  AliTPCdEdxInfo::GetTPCSignalRegionInfo(Double32_t signal[4], Char_t ncl[3], Char_t nrows[3]) const {\n  \/\/\n  \/\/ Get the TPC dEdx variables per region\n  \/\/\n  \/\/ Double32_t  fTPCsignalRegion[4]; \/\/ TPC dEdx signal in 4 different regions - 0 - IROC, 1- OROC medium, 2 - OROC long, 3- OROC all, (default truncation used)  \n  \/\/ Char_t      fTPCsignalNRegion[3]; \/\/ number of clusters above threshold used in the dEdx calculation\n  \/\/ Char_t      fTPCsignalNRowRegion[3]; \/\/ number of crosed rows used in the dEdx calculation - signal below threshold included\n  \/\/\n  for (Int_t i=0; i<3; i++){\n    signal[i]=fTPCsignalRegion[i];\n    ncl[i]=fTPCsignalNRegion[i];\n    nrows[i]=fTPCsignalNRowRegion[i];\n  }\n  signal[3]=fTPCsignalRegion[3];\n  return; \n}\n\n\nvoid  AliTPCdEdxInfo::SetTPCSignalRegionInfo(Double32_t signal[4], Char_t ncl[3], Char_t nrows[3]){\n  \/\/\n  \/\/ Set the TPC dEdx variables per region\n  \/\/\n  \/\/ Double32_t  fTPCsignalRegion[4]; \/\/ TPC dEdx signal in 4 different regions - 0 - IROC, 1- OROC medium, 2 - OROC long, 3- OROC all, (default truncation used)  \n  \/\/ Char_t      fTPCsignalNRegion[3]; \/\/ number of clusters above threshold used in the dEdx calculation\n  \/\/ Char_t      fTPCsignalNRowRegion[3]; \/\/ number of crosed rows used in the dEdx calculation - signal below threshold included\n  \/\/\n  for (Int_t i=0;i<3; i++){\n    fTPCsignalRegion[i]=signal[i];\n    fTPCsignalNRegion[i]=ncl[i];\n    fTPCsignalNRowRegion[i]=nrows[i];\n  }\n  fTPCsignalRegion[3]=signal[3];\n  return;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Created by Zal on 11\/19\/16.\n\/\/\n\n#include <assert.h>\n#include <utility>\n#include \"BinaryMatrix.h\"\n\nvoid BinaryMatrix::BinaryMatrix(int w, int h) {\n    this->width = w;\n    this->height = h;\n    this->baseSize = sizeof(char) * 8;\n\n    int n = w*h;\n    this->dataLength = (n % baseSize == 0)? n\/baseSize : n\/baseSize +1;\n    this->data = new char[dataLength];\n}\n\nvoid BinaryMatrix::~BinaryMatrix() {\n    delete[] data;\n}\n\nvoid BinaryMatrix::T() {\n    this->transposed = !this->transposed;\n}\n\nBinaryMatrix BinaryMatrix::binMultiply(const BinaryMatrix& other) {\n    BinaryMatrix res(this->width, this->height);\n    for(int i = 0; i < this->dataLength; ++i) {\n        res.data[i] = !(this->data[i] ^ other.data[i]);\n    }\n    return res;\n}\n\nstd::pair<int, int> elem_accessor(int i, int rows, int cols, bool transposed) {\n    if (transposed) {\n        return std::make_pair(i % rows, i \/ rows);\n    } else {\n        return std::make_pair(i \/ cols, i % cols);\n    }\n}\n\nchar get_bit(char elem, int bit_id) {\n    return (elem >> (this->baseSize - bit_id)) & 1;\n}\n\nchar set_bit(char elem, int bit_id, char bit) {\n    \/\/ assumes originally the bit is set to 0\n    char mask = 1 << ( - bit_id);\n    char new_elem = (elem | (bit << mask));\n    return new_elem;\n}\n\n\nBinaryMatrix BinaryMatrix::tBinMultiply(const BinaryMatrix& other) {\n    int w = this->width;\n    int h = this->height;\n    if (this->transposed) {\n        w = other.width;\n        h = other.height;\n    }\n    int this_n = this->dataLength;\n    int other_n = other.dataLength;\n    int res_n = res.dataLength;\n    BinaryMatrix res(w, h);\n    for (int bit_id = 0; bit_id < (w * h); ++bit_id) {\n        std::pair<int, int> this_rc = elem_accessor(bit_id, this_n, this->baseSize, this->transposed);\n        std::pair<int, int> other_rc = elem_accessor(bit_id, other_n, this->baseSize, other.transposed);\n        std::pair<int, int> res_rc = elem_accessor(bit_Id, res_n, this->baseSize, res.transposed);\n        char this_c = this->data[this_rc.first];\n        char other_c = other.data[other_rc.first];\n        char res_c = res.data[res_rc.first];\n\n        char answer = !(get_bit(this_c, this_rc.second) ^ get_bit(other_c, other_rc.second)) & 1;\n        res.data[res_rc.first] = set_bit(res_c, res_rc.second, answer);\n    }\n    return res;\n}\n\ndouble BinaryMatrix::doubleMultiply(const double& other) {\n\n}\n\nBinaryMatrix BinaryMatrix::operator*(const BinaryMatrix& other ) {\n    if(this->transposed != other.transposed) {\n        assert(this->width == other.height);\n        assert(this->height == other.width);\n        return this->tBinMultiply(other);\n    }\n    else {\n        assert(this->width == other.width);\n        assert(this->height == other.height);\n        return this->binMultiply(other);\n    }\n}\n<commit_msg>Fixed comma typo in res_rc<commit_after>\/\/\n\/\/ Created by Zal on 11\/19\/16.\n\/\/\n\n#include <assert.h>\n#include <utility>\n#include \"BinaryMatrix.h\"\n\nvoid BinaryMatrix::BinaryMatrix(int w, int h) {\n    this->width = w;\n    this->height = h;\n    this->baseSize = sizeof(char) * 8;\n\n    int n = w*h;\n    this->dataLength = (n % baseSize == 0)? n\/baseSize : n\/baseSize +1;\n    this->data = new char[dataLength];\n}\n\nvoid BinaryMatrix::~BinaryMatrix() {\n    delete[] data;\n}\n\nvoid BinaryMatrix::T() {\n    this->transposed = !this->transposed;\n}\n\nBinaryMatrix BinaryMatrix::binMultiply(const BinaryMatrix& other) {\n    BinaryMatrix res(this->width, this->height);\n    for(int i = 0; i < this->dataLength; ++i) {\n        res.data[i] = !(this->data[i] ^ other.data[i]);\n    }\n    return res;\n}\n\nstd::pair<int, int> elem_accessor(int i, int rows, int cols, bool transposed) {\n    if (transposed) {\n        return std::make_pair(i % rows, i \/ rows);\n    } else {\n        return std::make_pair(i \/ cols, i % cols);\n    }\n}\n\nchar get_bit(char elem, int bit_id) {\n    return (elem >> (this->baseSize - bit_id)) & 1;\n}\n\nchar set_bit(char elem, int bit_id, char bit) {\n    \/\/ assumes originally the bit is set to 0\n    char mask = 1 << ( - bit_id);\n    char new_elem = (elem | (bit << mask));\n    return new_elem;\n}\n\nBinaryMatrix BinaryMatrix::tBinMultiply(const BinaryMatrix& other) {\n    int w = this->width;\n    int h = this->height;\n    if (this->transposed) {\n        w = other.width;\n        h = other.height;\n    }\n    int this_n = this->dataLength;\n    int other_n = other.dataLength;\n    int res_n = res.dataLength;\n    BinaryMatrix res(w, h);\n    for (int bit_id = 0; bit_id < (w * h); ++bit_id) {\n        std::pair<int, int> this_rc = elem_accessor(bit_id, this_n, this->baseSize, this->transposed);\n        std::pair<int, int> other_rc = elem_accessor(bit_id, other_n, this->baseSize, other.transposed);\n        std::pair<int, int> res_rc = elem_accessor(bit_id, res_n, this->baseSize, res.transposed);\n        char this_c = this->data[this_rc.first];\n        char other_c = other.data[other_rc.first];\n        char res_c = res.data[res_rc.first];\n\n        char answer = !(get_bit(this_c, this_rc.second) ^ get_bit(other_c, other_rc.second)) & 1;\n        res.data[res_rc.first] = set_bit(res_c, res_rc.second, answer);\n    }\n    return res;\n}\n\ndouble BinaryMatrix::doubleMultiply(const double& other) {\n\n}\n\nBinaryMatrix BinaryMatrix::operator*(const BinaryMatrix& other ) {\n    if(this->transposed != other.transposed) {\n        assert(this->width == other.height);\n        assert(this->height == other.width);\n        return this->tBinMultiply(other);\n    }\n    else {\n        assert(this->width == other.width);\n        assert(this->height == other.height);\n        return this->binMultiply(other);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\n    Copyright Eli Dupree and Isaac Dupree, 2011, 2012\n    \n    This file is part of Lasercake.\n\n    Lasercake is free software: you can redistribute it and\/or modify\n    it under the terms of the GNU General Public License as published by\n    the Free Software Foundation, either version 3 of the License, or\n    (at your option) any later version.\n\n    Lasercake is distributed in the hope that it will be useful,\n    but WITHOUT ANY WARRANTY; without even the implied warranty of\n    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n    GNU General Public License for more details.\n\n    You should have received a copy of the GNU General Public License\n    along with Lasercake.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n   \n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n\n#include \"SDL.h\"\n#include \"GL\/gl.h\"\n#include \"GL\/glu.h\"\n\n#include <iostream>\n#include <cmath>\n\n#define ZTREE_TESTING\n#include \"..\/data_structures\/geometry.hpp\"\n\nstatic SDL_Surface *gScreen;\n\nstatic void initAttributes ()\n{\n    \/\/ Setup attributes we want for the OpenGL context\n    \n    int value;\n    \n    \/\/ Don't set color bit sizes (SDL_GL_RED_SIZE, etc)\n    \/\/    Mac OS X will always use 8-8-8-8 ARGB for 32-bit screens and\n    \/\/    5-5-5 RGB for 16-bit screens\n    \n    \/\/ Request a 16-bit depth buffer (without this, there is no depth buffer)\n    value = 16;\n    SDL_GL_SetAttribute (SDL_GL_DEPTH_SIZE, value);\n    \n    \n    \/\/ Request double-buffered OpenGL\n    \/\/     The fact that windows are double-buffered on Mac OS X has no effect\n    \/\/     on OpenGL double buffering.\n    value = 1;\n    SDL_GL_SetAttribute (SDL_GL_DOUBLEBUFFER, value);\n}\n\nstatic void printAttributes ()\n{\n    \/\/ Print out attributes of the context we created\n    int nAttr;\n    int i;\n    \n    int  attr[] = { SDL_GL_RED_SIZE, SDL_GL_BLUE_SIZE, SDL_GL_GREEN_SIZE,\n                    SDL_GL_ALPHA_SIZE, SDL_GL_BUFFER_SIZE, SDL_GL_DEPTH_SIZE };\n                    \n    const char *desc[] = { \"Red size: %d bits\\n\", \"Blue size: %d bits\\n\", \"Green size: %d bits\\n\",\n                     \"Alpha size: %d bits\\n\", \"Color buffer size: %d bits\\n\", \n                     \"Depth bufer size: %d bits\\n\" };\n\n    nAttr = sizeof(attr) \/ sizeof(int);\n    \n    for (i = 0; i < nAttr; i++) {\n    \n        int value;\n        SDL_GL_GetAttribute ((SDL_GLattr)attr[i], &value);\n        printf (desc[i], value);\n    } \n}\n\nstatic void createSurface (int fullscreen)\n{\n    Uint32 flags = 0;\n    \n    flags = SDL_OPENGL;\n    if (fullscreen)\n        flags |= SDL_FULLSCREEN;\n    \n    \/\/ Create window\n    gScreen = SDL_SetVideoMode (640, 640, 0, flags);\n    if (gScreen == NULL) {\n\t\t\n        fprintf (stderr, \"Couldn't set 640x640 OpenGL video mode: %s\\n\",\n                 SDL_GetError());\n\t\tSDL_Quit();\n\t\texit(2);\n\t}\n}\n\nstruct floating_line {\n  std::array<vector3<int64_t>, 2> ends;\n  bool collided;\n};\n\nstruct floating_poly {\n  std::array<vector3<int64_t>, 2> ends;\n  std::vector<vector3<int64_t>> vertices;\n  bool collided;\n};\n\nstatic void mainLoop (std::string \/*scenario*\/)\n{\n  SDL_Event event;\n  int done = 0;\n  int p_mode = 0;\nlarge_fast_noncrypto_rng rng(time(NULL));\ntypedef boost::random::uniform_int_distribution<int64_t> uniform_random;\n  \n  double view_x = 5, view_y = 5, view_z = 5, view_dist = 20;\nint frame = 0;\nstd::vector<floating_line> lines;\nstd::vector<floating_poly> polys;\n\nfor (int i = 0; i < 50; ++i) {\n  floating_line foo;\n  vector3<int64_t> first(uniform_random(0, 1023)(rng), uniform_random(0, 1023)(rng), uniform_random(300, 399)(rng));\n  vector3<int64_t> diff(uniform_random(-99, 99)(rng), uniform_random(-99, 99)(rng), uniform_random(10, 109)(rng));\n  foo.ends[0] = first;\n  foo.ends[1] = first + diff;\n  lines.push_back(foo);\n}\nfor (int i = 0; i < 50; ++i) {\n  floating_poly foo;\n  vector3<int64_t> first(uniform_random(0, 1023)(rng), uniform_random(0, 1023)(rng), uniform_random(-300, -201)(rng));\n  vector3<int64_t> diff1(uniform_random(0, 199)(rng), uniform_random(0, 199)(rng), uniform_random(5, 24)(rng));\n  vector3<int64_t> diff2(uniform_random(-250, -51)(rng), uniform_random(-250, -51)(rng), uniform_random(5, 24)(rng));\n  foo.vertices.push_back(first);\n  foo.vertices.push_back(first+diff1);\n  foo.vertices.push_back(first+diff1+diff2);\n  polys.push_back(foo);\n}\n  {\n    \/*std::vector<vector3<int64_t>> laer;\n    laer.push_back(vector3<int64_t>(-20, 20, 20));\n    laer.push_back(vector3<int64_t>(20, 20, 0));\n    laer.push_back(vector3<int64_t>(0, -20, 0));\n    convex_polygon oafe(laer);\n    line_segment flwj(vector3<int64_t>(2, 4, 50));\n    line_segment flwj(vector3<int64_t>(-2, -3, -50));*\/\n    std::vector<vector3<int64_t>> laer;\n    laer.push_back(vector3<int64_t>(-20, 20, 0));\n    laer.push_back(vector3<int64_t>(20, 20, 0));\n    laer.push_back(vector3<int64_t>(0, -20, 0));\n    convex_polygon oafe(laer);\n    line_segment flwj(vector3<int64_t>(0, 0, 50), vector3<int64_t>(0, 0, -50));\n    assert(shape(flwj).intersects(oafe));\n }\n    \n  while ( !done ) {\n\n    \/* Check for events *\/\n    while ( SDL_PollEvent (&event) ) {\n      switch (event.type) {\n        case SDL_MOUSEMOTION:\n          break;\n          \n        case SDL_MOUSEBUTTONDOWN:\n          break;\n          \n        case SDL_KEYDOWN:\n          if(event.key.keysym.sym == SDLK_p) ++p_mode;\n          if(event.key.keysym.sym == SDLK_q) ++view_x;\n          if(event.key.keysym.sym == SDLK_a) --view_x;\n          if(event.key.keysym.sym == SDLK_w) ++view_y;\n          if(event.key.keysym.sym == SDLK_s) --view_y;\n          if(event.key.keysym.sym == SDLK_e) ++view_z;\n          if(event.key.keysym.sym == SDLK_d) --view_z;\n          if(event.key.keysym.sym == SDLK_r) ++view_dist;\n          if(event.key.keysym.sym == SDLK_f) --view_dist;\n          if(event.key.keysym.sym != SDLK_ESCAPE)break;\n          \n        case SDL_QUIT:\n          done = 1;\n          break;\n          \n        default:\n          break;\n      }\n    }\n    if(p_mode == 1)continue;\n    if(p_mode > 1)--p_mode;\n    int before_drawing = SDL_GetTicks();\n\n    \/\/drawing code here\n    glClear(GL_COLOR_BUFFER_BIT);\n    glLoadIdentity();\n    gluPerspective(80, 1, 1, 100);\n    gluLookAt(5+15*std::cos(double(frame) \/ 200),5+15*std::sin(double(frame) \/ 200),10,5,5,0,0,0,1);\n    for (floating_line& foo : lines) {\n      if (foo.collided) glColor3f(1.0,0.0,1.0);\n      else              glColor3f(0.0,0.0,1.0);\n      glBegin(GL_LINES);\n        glVertex3f(0.01*foo.ends[0].x, 0.01*foo.ends[0].y, 0.01*foo.ends[0].z);\n        glVertex3f(0.01*foo.ends[1].x, 0.01*foo.ends[1].y, 0.01*foo.ends[1].z);\n      glEnd();\n    }\n    for (floating_poly& foo : polys) {\n      if (foo.collided) glColor3f(1.0,1.0,0.0);\n      else              glColor3f(0.0,1.0,0.0);\n      glBegin(GL_POLYGON);\n        for (vector3<int64_t>& v : foo.vertices)\n          glVertex3f(0.01*v.x, 0.01*v.y, 0.01*v.z);\n      glEnd();\n    }\n    \n    int before_GL = SDL_GetTicks();\n    \n    glFinish();\t\n    SDL_GL_SwapBuffers();\n   \n    int before_processing = SDL_GetTicks();\n    \n    \/\/doing stuff code here\n\t++frame;\n    for (floating_line& foo : lines) {\n      for (vector3<int64_t>& v : foo.ends) --v.z;\n      foo.collided = false;\n    }\n    for (floating_poly& foo : polys) {\n      for (vector3<int64_t>& v : foo.vertices) ++v.z;\n      foo.collided = false;\n    }\n    for (floating_line& foo : lines) {\n      for (floating_poly& bar : polys) {\n        if (shape(line_segment(foo.ends)).intersects(convex_polygon(bar.vertices))) {\n          foo.collided = true;\n          bar.collided = true;\n      std::cerr << \"GRONK\\n\";\n        }\n      }\n    }\n    \n    int after = SDL_GetTicks();\n    std::cerr << (after - before_processing) << \", \" << (before_GL - before_drawing) << \", \" << (before_processing - before_GL) << \"\\n\";\n\n\/\/    SDL_Delay(50);\n  }\n}\n\nint main(int argc, char *argv[])\n{\n\t\/\/ Init SDL video subsystem\n\tif ( SDL_Init (SDL_INIT_VIDEO) < 0 ) {\n\t\t\n        fprintf(stderr, \"Couldn't initialize SDL: %s\\n\",\n\t\t\tSDL_GetError());\n\t\texit(1);\n\t}\n\n    \/\/ Set GL context attributes\n    initAttributes ();\n    \n    \/\/ Create GL context\n    createSurface (0);\n    \n    \/\/ Get GL context attributes\n    printAttributes ();\n    \n    \/\/ Init GL state\n\tgluPerspective(90, 1, 1, 100);\n\tgluLookAt(20,20,20,0,0,0,0,0,1);\n\tglEnable(GL_BLEND);\n\tglBlendFunc(GL_SRC_ALPHA,GL_ONE_MINUS_SRC_ALPHA);\n    \n    \/\/ Draw, get events...\n    if (argc < 2) {\n      std::cerr << \"You didn't give an argument saying which scenario to use! Using default value...\";\n      mainLoop (\"default\");\n    }\n    else mainLoop (argv[1]);\n    \n    \/\/ Cleanup\n\tSDL_Quit();\n\t\n    return 0;\n}\n<commit_msg>fix polygon_visualizer for units<commit_after>\/*\n\n    Copyright Eli Dupree and Isaac Dupree, 2011, 2012\n    \n    This file is part of Lasercake.\n\n    Lasercake is free software: you can redistribute it and\/or modify\n    it under the terms of the GNU General Public License as published by\n    the Free Software Foundation, either version 3 of the License, or\n    (at your option) any later version.\n\n    Lasercake is distributed in the hope that it will be useful,\n    but WITHOUT ANY WARRANTY; without even the implied warranty of\n    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n    GNU General Public License for more details.\n\n    You should have received a copy of the GNU General Public License\n    along with Lasercake.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n   \n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n\n#include \"SDL.h\"\n#include \"GL\/gl.h\"\n#include \"GL\/glu.h\"\n\n#include <iostream>\n#include <cmath>\n\n#define ZTREE_TESTING\n#include \"..\/data_structures\/geometry.hpp\"\n\nstatic SDL_Surface *gScreen;\n\nstatic void initAttributes ()\n{\n    \/\/ Setup attributes we want for the OpenGL context\n    \n    int value;\n    \n    \/\/ Don't set color bit sizes (SDL_GL_RED_SIZE, etc)\n    \/\/    Mac OS X will always use 8-8-8-8 ARGB for 32-bit screens and\n    \/\/    5-5-5 RGB for 16-bit screens\n    \n    \/\/ Request a 16-bit depth buffer (without this, there is no depth buffer)\n    value = 16;\n    SDL_GL_SetAttribute (SDL_GL_DEPTH_SIZE, value);\n    \n    \n    \/\/ Request double-buffered OpenGL\n    \/\/     The fact that windows are double-buffered on Mac OS X has no effect\n    \/\/     on OpenGL double buffering.\n    value = 1;\n    SDL_GL_SetAttribute (SDL_GL_DOUBLEBUFFER, value);\n}\n\nstatic void printAttributes ()\n{\n    \/\/ Print out attributes of the context we created\n    int nAttr;\n    int i;\n    \n    int  attr[] = { SDL_GL_RED_SIZE, SDL_GL_BLUE_SIZE, SDL_GL_GREEN_SIZE,\n                    SDL_GL_ALPHA_SIZE, SDL_GL_BUFFER_SIZE, SDL_GL_DEPTH_SIZE };\n                    \n    const char *desc[] = { \"Red size: %d bits\\n\", \"Blue size: %d bits\\n\", \"Green size: %d bits\\n\",\n                     \"Alpha size: %d bits\\n\", \"Color buffer size: %d bits\\n\", \n                     \"Depth bufer size: %d bits\\n\" };\n\n    nAttr = sizeof(attr) \/ sizeof(int);\n    \n    for (i = 0; i < nAttr; i++) {\n    \n        int value;\n        SDL_GL_GetAttribute ((SDL_GLattr)attr[i], &value);\n        printf (desc[i], value);\n    } \n}\n\nstatic void createSurface (int fullscreen)\n{\n    Uint32 flags = 0;\n    \n    flags = SDL_OPENGL;\n    if (fullscreen)\n        flags |= SDL_FULLSCREEN;\n    \n    \/\/ Create window\n    gScreen = SDL_SetVideoMode (640, 640, 0, flags);\n    if (gScreen == NULL) {\n\t\t\n        fprintf (stderr, \"Couldn't set 640x640 OpenGL video mode: %s\\n\",\n                 SDL_GetError());\n\t\tSDL_Quit();\n\t\texit(2);\n\t}\n}\n\ninline geom::vect vect_literal(geom::polygon_int_type x, geom::polygon_int_type y, geom::polygon_int_type z) {\n  return geom::vect(x*fine_units, y*fine_units, z*fine_units);\n}\n\nstruct floating_line {\n  std::array<geom::vect, 2> ends;\n  bool collided;\n};\n\nstruct floating_poly {\n  std::array<geom::vect, 2> ends;\n  std::vector<geom::vect> vertices;\n  bool collided;\n};\n\nstatic void mainLoop (std::string \/*scenario*\/)\n{\n  SDL_Event event;\n  int done = 0;\n  int p_mode = 0;\nlarge_fast_noncrypto_rng rng(time(NULL));\ntypedef boost::random::uniform_int_distribution<int64_t> uniform_random;\n  \n  double view_x = 5, view_y = 5, view_z = 5, view_dist = 20;\nint frame = 0;\nstd::vector<floating_line> lines;\nstd::vector<floating_poly> polys;\n\nfor (int i = 0; i < 50; ++i) {\n  floating_line foo;\n  const geom::vect first = vect_literal(uniform_random(0, 1023)(rng), uniform_random(0, 1023)(rng), uniform_random(300, 399)(rng));\n  const geom::vect diff = vect_literal(uniform_random(-99, 99)(rng), uniform_random(-99, 99)(rng), uniform_random(10, 109)(rng));\n  foo.ends[0] = first;\n  foo.ends[1] = first + diff;\n  lines.push_back(foo);\n}\nfor (int i = 0; i < 50; ++i) {\n  floating_poly foo;\n  const geom::vect first = vect_literal(uniform_random(0, 1023)(rng), uniform_random(0, 1023)(rng), uniform_random(-300, -201)(rng));\n  const geom::vect diff1 = vect_literal(uniform_random(0, 199)(rng), uniform_random(0, 199)(rng), uniform_random(5, 24)(rng));\n  const geom::vect diff2 = vect_literal(uniform_random(-250, -51)(rng), uniform_random(-250, -51)(rng), uniform_random(5, 24)(rng));\n  foo.vertices.push_back(first);\n  foo.vertices.push_back(first+diff1);\n  foo.vertices.push_back(first+diff1+diff2);\n  polys.push_back(foo);\n}\n  {\n    \/*std::vector<vector3<int64_t>> laer;\n    laer.push_back(vector3<int64_t>(-20, 20, 20));\n    laer.push_back(vector3<int64_t>(20, 20, 0));\n    laer.push_back(vector3<int64_t>(0, -20, 0));\n    geom::convex_polygon oafe(laer);\n    geom::line_segment flwj(vector3<int64_t>(2, 4, 50));\n    geom::line_segment flwj(vector3<int64_t>(-2, -3, -50));*\/\n    std::vector<geom::vect> laer;\n    laer.push_back(vect_literal(-20, 20, 0));\n    laer.push_back(vect_literal(20, 20, 0));\n    laer.push_back(vect_literal(0, -20, 0));\n    geom::convex_polygon oafe(laer);\n    geom::line_segment flwj(vect_literal(0, 0, 50), vect_literal(0, 0, -50));\n    assert(shape(flwj).intersects(oafe));\n }\n    \n  while ( !done ) {\n\n    \/* Check for events *\/\n    while ( SDL_PollEvent (&event) ) {\n      switch (event.type) {\n        case SDL_MOUSEMOTION:\n          break;\n          \n        case SDL_MOUSEBUTTONDOWN:\n          break;\n          \n        case SDL_KEYDOWN:\n          if(event.key.keysym.sym == SDLK_p) ++p_mode;\n          if(event.key.keysym.sym == SDLK_q) ++view_x;\n          if(event.key.keysym.sym == SDLK_a) --view_x;\n          if(event.key.keysym.sym == SDLK_w) ++view_y;\n          if(event.key.keysym.sym == SDLK_s) --view_y;\n          if(event.key.keysym.sym == SDLK_e) ++view_z;\n          if(event.key.keysym.sym == SDLK_d) --view_z;\n          if(event.key.keysym.sym == SDLK_r) ++view_dist;\n          if(event.key.keysym.sym == SDLK_f) --view_dist;\n          if(event.key.keysym.sym != SDLK_ESCAPE)break;\n          \n        case SDL_QUIT:\n          done = 1;\n          break;\n          \n        default:\n          break;\n      }\n    }\n    if(p_mode == 1)continue;\n    if(p_mode > 1)--p_mode;\n    int before_drawing = SDL_GetTicks();\n\n    \/\/drawing code here\n    glClear(GL_COLOR_BUFFER_BIT);\n    glLoadIdentity();\n    gluPerspective(80, 1, 1, 100);\n    gluLookAt(5+15*std::cos(double(frame) \/ 200),5+15*std::sin(double(frame) \/ 200),10,5,5,0,0,0,1);\n    for (floating_line& foo : lines) {\n      if (foo.collided) glColor3f(1.0,0.0,1.0);\n      else              glColor3f(0.0,0.0,1.0);\n      glBegin(GL_LINES);\n        glVertex3f(0.01*foo.ends[0].x\/fine_units, 0.01*foo.ends[0].y\/fine_units, 0.01*foo.ends[0].z\/fine_units);\n        glVertex3f(0.01*foo.ends[1].x\/fine_units, 0.01*foo.ends[1].y\/fine_units, 0.01*foo.ends[1].z\/fine_units);\n      glEnd();\n    }\n    for (floating_poly& foo : polys) {\n      if (foo.collided) glColor3f(1.0,1.0,0.0);\n      else              glColor3f(0.0,1.0,0.0);\n      glBegin(GL_POLYGON);\n        for (geom::vect& v : foo.vertices)\n          glVertex3f(0.01*v.x\/fine_units, 0.01*v.y\/fine_units, 0.01*v.z\/fine_units);\n      glEnd();\n    }\n    \n    int before_GL = SDL_GetTicks();\n    \n    glFinish();\t\n    SDL_GL_SwapBuffers();\n   \n    int before_processing = SDL_GetTicks();\n    \n    \/\/doing stuff code here\n\t++frame;\n    for (floating_line& foo : lines) {\n      for (geom::vect& v : foo.ends) { v.z -= 1*fine_units; }\n      foo.collided = false;\n    }\n    for (floating_poly& foo : polys) {\n      for (geom::vect& v : foo.vertices) { v.z += 1*fine_units; }\n      foo.collided = false;\n    }\n    for (floating_line& foo : lines) {\n      for (floating_poly& bar : polys) {\n        if (shape(geom::line_segment(foo.ends)).intersects(geom::convex_polygon(bar.vertices))) {\n          foo.collided = true;\n          bar.collided = true;\n      std::cerr << \"GRONK\\n\";\n        }\n      }\n    }\n    \n    int after = SDL_GetTicks();\n    std::cerr << (after - before_processing) << \", \" << (before_GL - before_drawing) << \", \" << (before_processing - before_GL) << \"\\n\";\n\n\/\/    SDL_Delay(50);\n  }\n}\n\nint main(int argc, char *argv[])\n{\n\t\/\/ Init SDL video subsystem\n\tif ( SDL_Init (SDL_INIT_VIDEO) < 0 ) {\n\t\t\n        fprintf(stderr, \"Couldn't initialize SDL: %s\\n\",\n\t\t\tSDL_GetError());\n\t\texit(1);\n\t}\n\n    \/\/ Set GL context attributes\n    initAttributes ();\n    \n    \/\/ Create GL context\n    createSurface (0);\n    \n    \/\/ Get GL context attributes\n    printAttributes ();\n    \n    \/\/ Init GL state\n\tgluPerspective(90, 1, 1, 100);\n\tgluLookAt(20,20,20,0,0,0,0,0,1);\n\tglEnable(GL_BLEND);\n\tglBlendFunc(GL_SRC_ALPHA,GL_ONE_MINUS_SRC_ALPHA);\n    \n    \/\/ Draw, get events...\n    if (argc < 2) {\n      std::cerr << \"You didn't give an argument saying which scenario to use! Using default value...\";\n      mainLoop (\"default\");\n    }\n    else mainLoop (argv[1]);\n    \n    \/\/ Cleanup\n\tSDL_Quit();\n\t\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Sh: A GPU metaprogramming language.\n\/\/\n\/\/ Copyright 2003-2005 Serious Hack 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; 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#include \"ShProgramNode.hpp\"\n#include <cassert>\n#include <algorithm>\n#include <sstream>\n#include <fstream>\n#include \"ShBackend.hpp\"\n#include \"ShContext.hpp\"\n#include \"ShDebug.hpp\"\n#include \"ShTextureNode.hpp\"\n#include \"ShPaletteNode.hpp\"\n#include \"ShCtrlGraph.hpp\"\n#include \"ShError.hpp\"\n\nnamespace SH {\n\nShProgramNode::ShProgramNode(const std::string& target)\n  : m_target(target), m_finished(false),\n    m_assigned_var(0)\n{\n}\n\nShProgramNode::~ShProgramNode()\n{\n  \/\/ TODO: maybe need some cleanup here, although refcounting ought to\n  \/\/ take care of it.\n}\n\nvoid ShProgramNode::compile(const ShPointer<ShBackend>& backend)\n{\n  if (m_target.empty()) shError( ShException( \"Invalid ShProgram target\" ) );\n  compile(m_target, backend);\n}\n\nvoid ShProgramNode::compile(const std::string& target, const ShPointer<ShBackend>& backend)\n{\n  if (!backend) return;\n\n  ShContext::current()->enter(this);\n  ShBackendCodePtr code = 0;\n  try {\n    collectDecls();\n    collectVariables();\n    code = backend->generate_code(target, this);\n  } catch (...) {\n    ShContext::current()->exit();\n    throw;\n  }\n  ShContext::current()->exit();\n  m_code[std::make_pair(target, backend)] = code;\n}\n\nbool ShProgramNode::is_compiled() const\n{\n  if (m_target.empty()) shError( ShException( \"Invalid ShProgram target\" ) );\n\n  return is_compiled(m_target, ShBackend::get_backend(m_target));\n}\n\nbool ShProgramNode::is_compiled(const std::string& target) const\n{\n  if (target.empty()) shError( ShException( \"Invalid compilation target\" ) );\n\n  return is_compiled(target, ShBackend::get_backend(target));\n}\n\nbool ShProgramNode::is_compiled(const std::string& target, const ShPointer<ShBackend>& backend) const\n{\n  \/\/ Try for a perfect match first\n  if (m_code.find(std::make_pair(target, backend)) != m_code.end()) return true;\n\n  \/\/ Look for a derived target\n  std::list<std::string> derived_targets = ShBackend::derived_targets(target);\n  for (std::list<std::string>::const_iterator i = derived_targets.begin(); \n       i != derived_targets.end(); i++) {\n    if (m_code.find(std::make_pair(*i, backend)) != m_code.end()) return true;\n  }\n\n  return false;\n}\n\nShPointer<ShBackendCode> ShProgramNode::code()\n{\n  return code(ShBackend::get_backend(m_target));\n}\n\nShPointer<ShBackendCode> ShProgramNode::code(const ShPointer<ShBackend>& backend)\n{\n  if (m_target.empty()) shError( ShException( \"Invalid ShProgram target\" ) );\n\n  return code(m_target, backend);\n}\n\nShPointer<ShBackendCode> ShProgramNode::code(const std::string& target, const ShPointer<ShBackend>& backend)\n{\n  if (!backend) return 0;\n\n  if (m_code.find(std::make_pair(target, backend)) == m_code.end()) compile(target, backend);\n\n  return m_code[std::make_pair(target, backend)];\n}\n\nstd::string ShProgramNode::describe_interface() const\n{\n  std::ostringstream os;\n  os << \"Interface for \";\n  if (has_name()) {\n    os << name();\n  } else {\n    os << \"<anonymous program>\";\n  }\n  os << std::endl;\n  os << std::endl;\n  os << \"Inputs:\" << std::endl;\n  os << describe(inputs) << std::endl;\n  os << \"Outputs:\" << std::endl;\n  os << describe(outputs) << std::endl;\n  os << \"Channels:\" << std::endl;\n  os << describe(channels) << std::endl;\n  os << \"Uniforms:\" << std::endl;\n  os << describe(uniforms) << std::endl;\n\n  return os.str();\n}\n\nstd::string ShProgramNode::describe_vars() const\n{\n  std::ostringstream os;\n  os << describe_interface(); \n  os << \"Temps:\" << std::endl;\n  os << describe(temps) << std::endl;\n  os << \"Constants:\" << std::endl;\n  os << describe(constants) << std::endl;\n  return os.str();\n}\n\nstd::string ShProgramNode::describe_decls() const\n{\n  std::ostringstream os;\n  os << \"Temp Declarations:\" << std::endl;\n  for(VarSet::const_iterator I = tempDecls.begin(); I != tempDecls.end(); ++I) {\n    os << (*I)->nameOfType() << \" \" << (*I)->name() << std::endl;\n  }\n  return os.str();\n}\n\nvoid ShProgramNode::dump(std::string filename) const\n{\n  SH_DEBUG_PRINT(\"Dumping \" << filename);\n  std::string varfile = filename + \".vars\";\n  std::ofstream varout(varfile.c_str());\n  varout << \"ShProgram \"; \n  varout << describe_vars(); \n  varout << describe_decls();\n\n  std::string dotfile = filename + \".dot\";\n  std::string psfile = filename + \".ps\";\n  std::ofstream dotout(dotfile.c_str());\n  ctrlGraph->graphvizDump(dotout);\n  std::string cmd = std::string(\"dot -Tps < \") + dotfile + \" > \" + psfile; \n  system(cmd.c_str());\n}\n\nvoid ShProgramNode::updateUniform(const ShVariableNodePtr& uniform)\n{\n  for (CodeMap::iterator I = m_code.begin(); I != m_code.end(); ++I) {\n    I->second->updateUniform(uniform);\n  }\n}\n\nvoid ShProgramNode::collectVariables()\n{\n  temps.clear();\n  uniforms.clear();\n  constants.clear();\n  textures.clear();\n  channels.clear();\n  palettes.clear();\n  if (ctrlGraph->entry()) {\n    ctrlGraph->entry()->clearMarked();\n    collectNodeVars(ctrlGraph->entry());\n    ctrlGraph->entry()->clearMarked();\n  }\n}\n\nvoid ShProgramNode::collectDecls()\n{\n  tempDecls.clear();\n  \/\/ @todo range - use collectVariables temps result\n  \/\/ to pare out unnecessary declarations (i.e. variables\n  \/\/ that may have disappeared already due to transformations)\n  \/\/ (may actually want to put this cleaning up step in collectVariables\n  \/\/ since some temps might be removed during optimizations)\n  if (ctrlGraph->entry()) {\n    ctrlGraph->entry()->clearMarked();\n    collectNodeDecls(ctrlGraph->entry());\n    ctrlGraph->entry()->clearMarked();\n  }\n}\n\nbool ShProgramNode::hasDecl(ShVariableNodePtr node) const {\n  return tempDecls.find(node) != tempDecls.end();\n}\n\nvoid ShProgramNode::addDecl(ShVariableNodePtr node, ShCtrlGraphNodePtr cfgNode) {\n  tempDecls.insert(node);\n  SH_DEBUG_ASSERT(ctrlGraph->entry());\n  cfgNode->addDecl(node);\n}\n\nvoid ShProgramNode::addDecl(ShVariableNodePtr node) {\n  addDecl(node, ctrlGraph->entry());\n}\n\nvoid ShProgramNode::collectNodeDecls(const ShCtrlGraphNodePtr& node)\n{\n  if(node->marked()) return;\n  node->mark();\n  tempDecls.insert(node->decl_begin(), node->decl_end());\n  \/* @todo range\n  for(ShCtrlGraphNode::DeclIt I = node->decl_begin(); I != node->decl_end(); ++I) {\n    SH_DEBUG_PRINT(\"  collectDecls - \" << (*I)->name());\n  }\n  *\/\n\n  for (std::vector<ShCtrlGraphBranch>::const_iterator J = node->successors.begin();\n       J != node->successors.end(); ++J) {\n    collectNodeDecls(J->node);\n  }\n  \n  if (node->follower) collectNodeDecls(node->follower);\n}\n\nvoid ShProgramNode::collectNodeVars(const ShCtrlGraphNodePtr& node)\n{\n  if (node->marked()) return;\n  node->mark();\n\n  if (node->block) {\n    for (ShBasicBlock::ShStmtList::const_iterator I = node->block->begin();\n         I != node->block->end(); ++I) {\n      \n      collectVar(I->dest.node());\n      collectVar(I->src[0].node());\n      collectVar(I->src[1].node());\n      collectVar(I->src[2].node());\n    }\n  }\n\n  for (std::vector<ShCtrlGraphBranch>::const_iterator J = node->successors.begin();\n       J != node->successors.end(); ++J) {\n    collectNodeVars(J->node);\n  }\n  \n  if (node->follower) collectNodeVars(node->follower);\n}\n\nvoid ShProgramNode::collectVar(const ShVariableNodePtr& var)\n{\n  if (!var) return;\n  if (var->uniform()) {\n    if (std::find(uniforms.begin(), uniforms.end(), var) == uniforms.end()) {\n      uniforms.push_back(var);\n    }\n  } else switch (var->kind()) {\n  case SH_INPUT:\n  case SH_OUTPUT:\n  case SH_INOUT:\n    \/\/ Taken care of by ShVariableNode constructor\n    break;\n  case SH_TEMP:\n    if (std::find(temps.begin(), temps.end(), var) == temps.end()) {\n      temps.push_back(var);\n    }\n    break;\n  case SH_CONST:\n    if (std::find(constants.begin(), constants.end(), var) == constants.end()) {\n      constants.push_back(var);\n    }\n    break;\n  case SH_TEXTURE:\n    if (std::find(textures.begin(), textures.end(),\n                  shref_dynamic_cast<ShTextureNode>(var)) == textures.end()) {\n      textures.push_back(shref_dynamic_cast<ShTextureNode>(var));\n    }    \n    break;\n  case SH_STREAM:\n    if (std::find(channels.begin(), channels.end(),\n                  shref_dynamic_cast<ShChannelNode>(var)) == channels.end()) {\n      channels.push_back(shref_dynamic_cast<ShChannelNode>(var));\n    }\n  case SH_PALETTE:\n    if (std::find(palettes.begin(), palettes.end(),\n                  shref_dynamic_cast<ShPaletteNode>(var)) == palettes.end()) {\n      palettes.push_back(shref_dynamic_cast<ShPaletteNode>(var));\n    }\n    break;\n  default:\n    SH_DEBUG_ASSERT(0);\n  }\n}\n\nstd::ostream& ShProgramNode::print(std::ostream& out,\n                                   const ShProgramNode::VarList& varList)\n{\n  out << \"(\";\n  for(VarList::const_iterator it = varList.begin(); it != varList.end(); ++it) {\n    if( it != varList.begin() ) out << \", \";\n    out << (*it)->nameOfType() << \" \" << (*it)->name(); \n  }\n  out << \")\";\n  return out;\n}\n\nShPointer<ShProgramNode> ShProgramNode::clone() const\n{\n  ShCtrlGraphNodePtr head, tail;\n  ctrlGraph->copy(head, tail);\n\n  ShProgramNodePtr result = new ShProgramNode(target());\n  result->ShInfoHolder::operator=(*this);\n  result->ctrlGraph = new ShCtrlGraph(head, tail);\n  result->inputs = inputs;\n  result->outputs = outputs;\n  result->collectDecls();\n  result->collectVariables();\n  return result;\n}\n\nShProgramNode::VarList::const_iterator ShProgramNode::inputs_begin() const\n{\n  return inputs.begin();\n}\n\nShProgramNode::VarList::const_iterator ShProgramNode::inputs_end() const\n{\n  return inputs.end();\n}\n\nShProgramNode::VarList::const_iterator ShProgramNode::outputs_begin() const\n{\n  return outputs.begin();\n}\n\nShProgramNode::VarList::const_iterator ShProgramNode::outputs_end() const\n{\n  return outputs.end();\n}\n\nShProgramNode::VarList::const_iterator ShProgramNode::temps_begin() const\n{\n  return temps.begin();\n}\n\nShProgramNode::VarList::const_iterator ShProgramNode::temps_end() const\n{\n  return temps.end();\n}\n\nShProgramNode::VarList::const_iterator ShProgramNode::constants_begin() const\n{\n  return constants.begin();\n}\n\nShProgramNode::VarList::const_iterator ShProgramNode::constants_end() const\n{\n  return constants.end();\n}\n\nShProgramNode::VarList::const_iterator ShProgramNode::uniforms_begin() const\n{\n  return uniforms.begin();\n}\n\nShProgramNode::VarList::const_iterator ShProgramNode::uniforms_end() const\n{\n  return uniforms.end();\n}\n\nShProgramNode::TexList::const_iterator ShProgramNode::textures_begin() const\n{\n  return textures.begin();\n}\n\nShProgramNode::TexList::const_iterator ShProgramNode::textures_end() const\n{\n  return textures.end();\n}\n\nShProgramNode::ChannelList::const_iterator ShProgramNode::channels_begin() const\n{\n  return channels.begin();\n}\n\nShProgramNode::ChannelList::const_iterator ShProgramNode::channels_end() const\n{\n  return channels.end();\n}\n\nShProgramNode::PaletteList::const_iterator ShProgramNode::palettes_begin() const\n{\n  return palettes.begin();\n}\n\nShProgramNode::PaletteList::const_iterator ShProgramNode::palettes_end() const\n{\n  return palettes.end();\n}\n\nbool ShProgramNode::finished() const\n{\n  return m_finished;\n}\n\nvoid ShProgramNode::finish()\n{\n  m_finished = true;\n  if (m_assigned_var) {\n    m_assigned_var->attach(this);\n    m_assigned_var = 0;\n  }\n}\n\nvoid ShProgramNode::assign(const ShVariableNodePtr& var) const\n{\n  m_assigned_var = var;\n}\n\nstd::string ShProgramNode::describe(const VarList &varlist) {\n  std::ostringstream os;\n  for(VarList::const_iterator I = varlist.begin(); I != varlist.end(); ++I) {\n    os << \"  \" << (*I)->nameOfType() << \" \" << (*I)->name() << std::endl;\n  }\n  return os.str();\n}\n\nstd::string ShProgramNode::describe(const ChannelList& chanlist) {\n  std::ostringstream os;\n  for(ChannelList::const_iterator I = chanlist.begin(); I != chanlist.end(); ++I) {\n    os << \"  \" << (*I)->nameOfType() << \" \" << (*I)->name() << std::endl;\n  }\n  return os.str();\n}\n\n}\n<commit_msg>ShProgram::clone() now copies metadata as well.<commit_after>\/\/ Sh: A GPU metaprogramming language.\n\/\/\n\/\/ Copyright 2003-2005 Serious Hack 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; 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#include \"ShProgramNode.hpp\"\n#include <cassert>\n#include <algorithm>\n#include <sstream>\n#include <fstream>\n#include \"ShBackend.hpp\"\n#include \"ShContext.hpp\"\n#include \"ShDebug.hpp\"\n#include \"ShTextureNode.hpp\"\n#include \"ShPaletteNode.hpp\"\n#include \"ShCtrlGraph.hpp\"\n#include \"ShError.hpp\"\n\nnamespace SH {\n\nShProgramNode::ShProgramNode(const std::string& target)\n  : m_target(target), m_finished(false),\n    m_assigned_var(0)\n{\n}\n\nShProgramNode::~ShProgramNode()\n{\n  \/\/ TODO: maybe need some cleanup here, although refcounting ought to\n  \/\/ take care of it.\n}\n\nvoid ShProgramNode::compile(const ShPointer<ShBackend>& backend)\n{\n  if (m_target.empty()) shError( ShException( \"Invalid ShProgram target\" ) );\n  compile(m_target, backend);\n}\n\nvoid ShProgramNode::compile(const std::string& target, const ShPointer<ShBackend>& backend)\n{\n  if (!backend) return;\n\n  ShContext::current()->enter(this);\n  ShBackendCodePtr code = 0;\n  try {\n    collectDecls();\n    collectVariables();\n    code = backend->generate_code(target, this);\n  } catch (...) {\n    ShContext::current()->exit();\n    throw;\n  }\n  ShContext::current()->exit();\n  m_code[std::make_pair(target, backend)] = code;\n}\n\nbool ShProgramNode::is_compiled() const\n{\n  if (m_target.empty()) shError( ShException( \"Invalid ShProgram target\" ) );\n\n  return is_compiled(m_target, ShBackend::get_backend(m_target));\n}\n\nbool ShProgramNode::is_compiled(const std::string& target) const\n{\n  if (target.empty()) shError( ShException( \"Invalid compilation target\" ) );\n\n  return is_compiled(target, ShBackend::get_backend(target));\n}\n\nbool ShProgramNode::is_compiled(const std::string& target, const ShPointer<ShBackend>& backend) const\n{\n  \/\/ Try for a perfect match first\n  if (m_code.find(std::make_pair(target, backend)) != m_code.end()) return true;\n\n  \/\/ Look for a derived target\n  std::list<std::string> derived_targets = ShBackend::derived_targets(target);\n  for (std::list<std::string>::const_iterator i = derived_targets.begin(); \n       i != derived_targets.end(); i++) {\n    if (m_code.find(std::make_pair(*i, backend)) != m_code.end()) return true;\n  }\n\n  return false;\n}\n\nShPointer<ShBackendCode> ShProgramNode::code()\n{\n  return code(ShBackend::get_backend(m_target));\n}\n\nShPointer<ShBackendCode> ShProgramNode::code(const ShPointer<ShBackend>& backend)\n{\n  if (m_target.empty()) shError( ShException( \"Invalid ShProgram target\" ) );\n\n  return code(m_target, backend);\n}\n\nShPointer<ShBackendCode> ShProgramNode::code(const std::string& target, const ShPointer<ShBackend>& backend)\n{\n  if (!backend) return 0;\n\n  if (m_code.find(std::make_pair(target, backend)) == m_code.end()) compile(target, backend);\n\n  return m_code[std::make_pair(target, backend)];\n}\n\nstd::string ShProgramNode::describe_interface() const\n{\n  std::ostringstream os;\n  os << \"Interface for \";\n  if (has_name()) {\n    os << name();\n  } else {\n    os << \"<anonymous program>\";\n  }\n  os << std::endl;\n  os << std::endl;\n  os << \"Inputs:\" << std::endl;\n  os << describe(inputs) << std::endl;\n  os << \"Outputs:\" << std::endl;\n  os << describe(outputs) << std::endl;\n  os << \"Channels:\" << std::endl;\n  os << describe(channels) << std::endl;\n  os << \"Uniforms:\" << std::endl;\n  os << describe(uniforms) << std::endl;\n\n  return os.str();\n}\n\nstd::string ShProgramNode::describe_vars() const\n{\n  std::ostringstream os;\n  os << describe_interface(); \n  os << \"Temps:\" << std::endl;\n  os << describe(temps) << std::endl;\n  os << \"Constants:\" << std::endl;\n  os << describe(constants) << std::endl;\n  return os.str();\n}\n\nstd::string ShProgramNode::describe_decls() const\n{\n  std::ostringstream os;\n  os << \"Temp Declarations:\" << std::endl;\n  for(VarSet::const_iterator I = tempDecls.begin(); I != tempDecls.end(); ++I) {\n    os << (*I)->nameOfType() << \" \" << (*I)->name() << std::endl;\n  }\n  return os.str();\n}\n\nvoid ShProgramNode::dump(std::string filename) const\n{\n  SH_DEBUG_PRINT(\"Dumping \" << filename);\n  std::string varfile = filename + \".vars\";\n  std::ofstream varout(varfile.c_str());\n  varout << \"ShProgram \"; \n  varout << describe_vars(); \n  varout << describe_decls();\n\n  std::string dotfile = filename + \".dot\";\n  std::string psfile = filename + \".ps\";\n  std::ofstream dotout(dotfile.c_str());\n  ctrlGraph->graphvizDump(dotout);\n  std::string cmd = std::string(\"dot -Tps < \") + dotfile + \" > \" + psfile; \n  system(cmd.c_str());\n}\n\nvoid ShProgramNode::updateUniform(const ShVariableNodePtr& uniform)\n{\n  for (CodeMap::iterator I = m_code.begin(); I != m_code.end(); ++I) {\n    I->second->updateUniform(uniform);\n  }\n}\n\nvoid ShProgramNode::collectVariables()\n{\n  temps.clear();\n  uniforms.clear();\n  constants.clear();\n  textures.clear();\n  channels.clear();\n  palettes.clear();\n  if (ctrlGraph->entry()) {\n    ctrlGraph->entry()->clearMarked();\n    collectNodeVars(ctrlGraph->entry());\n    ctrlGraph->entry()->clearMarked();\n  }\n}\n\nvoid ShProgramNode::collectDecls()\n{\n  tempDecls.clear();\n  \/\/ @todo range - use collectVariables temps result\n  \/\/ to pare out unnecessary declarations (i.e. variables\n  \/\/ that may have disappeared already due to transformations)\n  \/\/ (may actually want to put this cleaning up step in collectVariables\n  \/\/ since some temps might be removed during optimizations)\n  if (ctrlGraph->entry()) {\n    ctrlGraph->entry()->clearMarked();\n    collectNodeDecls(ctrlGraph->entry());\n    ctrlGraph->entry()->clearMarked();\n  }\n}\n\nbool ShProgramNode::hasDecl(ShVariableNodePtr node) const {\n  return tempDecls.find(node) != tempDecls.end();\n}\n\nvoid ShProgramNode::addDecl(ShVariableNodePtr node, ShCtrlGraphNodePtr cfgNode) {\n  tempDecls.insert(node);\n  SH_DEBUG_ASSERT(ctrlGraph->entry());\n  cfgNode->addDecl(node);\n}\n\nvoid ShProgramNode::addDecl(ShVariableNodePtr node) {\n  addDecl(node, ctrlGraph->entry());\n}\n\nvoid ShProgramNode::collectNodeDecls(const ShCtrlGraphNodePtr& node)\n{\n  if(node->marked()) return;\n  node->mark();\n  tempDecls.insert(node->decl_begin(), node->decl_end());\n  \/* @todo range\n  for(ShCtrlGraphNode::DeclIt I = node->decl_begin(); I != node->decl_end(); ++I) {\n    SH_DEBUG_PRINT(\"  collectDecls - \" << (*I)->name());\n  }\n  *\/\n\n  for (std::vector<ShCtrlGraphBranch>::const_iterator J = node->successors.begin();\n       J != node->successors.end(); ++J) {\n    collectNodeDecls(J->node);\n  }\n  \n  if (node->follower) collectNodeDecls(node->follower);\n}\n\nvoid ShProgramNode::collectNodeVars(const ShCtrlGraphNodePtr& node)\n{\n  if (node->marked()) return;\n  node->mark();\n\n  if (node->block) {\n    for (ShBasicBlock::ShStmtList::const_iterator I = node->block->begin();\n         I != node->block->end(); ++I) {\n      \n      collectVar(I->dest.node());\n      collectVar(I->src[0].node());\n      collectVar(I->src[1].node());\n      collectVar(I->src[2].node());\n    }\n  }\n\n  for (std::vector<ShCtrlGraphBranch>::const_iterator J = node->successors.begin();\n       J != node->successors.end(); ++J) {\n    collectNodeVars(J->node);\n  }\n  \n  if (node->follower) collectNodeVars(node->follower);\n}\n\nvoid ShProgramNode::collectVar(const ShVariableNodePtr& var)\n{\n  if (!var) return;\n  if (var->uniform()) {\n    if (std::find(uniforms.begin(), uniforms.end(), var) == uniforms.end()) {\n      uniforms.push_back(var);\n    }\n  } else switch (var->kind()) {\n  case SH_INPUT:\n  case SH_OUTPUT:\n  case SH_INOUT:\n    \/\/ Taken care of by ShVariableNode constructor\n    break;\n  case SH_TEMP:\n    if (std::find(temps.begin(), temps.end(), var) == temps.end()) {\n      temps.push_back(var);\n    }\n    break;\n  case SH_CONST:\n    if (std::find(constants.begin(), constants.end(), var) == constants.end()) {\n      constants.push_back(var);\n    }\n    break;\n  case SH_TEXTURE:\n    if (std::find(textures.begin(), textures.end(),\n                  shref_dynamic_cast<ShTextureNode>(var)) == textures.end()) {\n      textures.push_back(shref_dynamic_cast<ShTextureNode>(var));\n    }    \n    break;\n  case SH_STREAM:\n    if (std::find(channels.begin(), channels.end(),\n                  shref_dynamic_cast<ShChannelNode>(var)) == channels.end()) {\n      channels.push_back(shref_dynamic_cast<ShChannelNode>(var));\n    }\n  case SH_PALETTE:\n    if (std::find(palettes.begin(), palettes.end(),\n                  shref_dynamic_cast<ShPaletteNode>(var)) == palettes.end()) {\n      palettes.push_back(shref_dynamic_cast<ShPaletteNode>(var));\n    }\n    break;\n  default:\n    SH_DEBUG_ASSERT(0);\n  }\n}\n\nstd::ostream& ShProgramNode::print(std::ostream& out,\n                                   const ShProgramNode::VarList& varList)\n{\n  out << \"(\";\n  for(VarList::const_iterator it = varList.begin(); it != varList.end(); ++it) {\n    if( it != varList.begin() ) out << \", \";\n    out << (*it)->nameOfType() << \" \" << (*it)->name(); \n  }\n  out << \")\";\n  return out;\n}\n\nShPointer<ShProgramNode> ShProgramNode::clone() const\n{\n  ShCtrlGraphNodePtr head, tail;\n  ctrlGraph->copy(head, tail);\n\n  ShProgramNodePtr result = new ShProgramNode(target());\n  result->ShInfoHolder::operator=(*this);\n  result->ShMeta::operator=(*this);\n  result->ctrlGraph = new ShCtrlGraph(head, tail);\n  result->inputs = inputs;\n  result->outputs = outputs;\n  result->collectDecls();\n  result->collectVariables();\n  return result;\n}\n\nShProgramNode::VarList::const_iterator ShProgramNode::inputs_begin() const\n{\n  return inputs.begin();\n}\n\nShProgramNode::VarList::const_iterator ShProgramNode::inputs_end() const\n{\n  return inputs.end();\n}\n\nShProgramNode::VarList::const_iterator ShProgramNode::outputs_begin() const\n{\n  return outputs.begin();\n}\n\nShProgramNode::VarList::const_iterator ShProgramNode::outputs_end() const\n{\n  return outputs.end();\n}\n\nShProgramNode::VarList::const_iterator ShProgramNode::temps_begin() const\n{\n  return temps.begin();\n}\n\nShProgramNode::VarList::const_iterator ShProgramNode::temps_end() const\n{\n  return temps.end();\n}\n\nShProgramNode::VarList::const_iterator ShProgramNode::constants_begin() const\n{\n  return constants.begin();\n}\n\nShProgramNode::VarList::const_iterator ShProgramNode::constants_end() const\n{\n  return constants.end();\n}\n\nShProgramNode::VarList::const_iterator ShProgramNode::uniforms_begin() const\n{\n  return uniforms.begin();\n}\n\nShProgramNode::VarList::const_iterator ShProgramNode::uniforms_end() const\n{\n  return uniforms.end();\n}\n\nShProgramNode::TexList::const_iterator ShProgramNode::textures_begin() const\n{\n  return textures.begin();\n}\n\nShProgramNode::TexList::const_iterator ShProgramNode::textures_end() const\n{\n  return textures.end();\n}\n\nShProgramNode::ChannelList::const_iterator ShProgramNode::channels_begin() const\n{\n  return channels.begin();\n}\n\nShProgramNode::ChannelList::const_iterator ShProgramNode::channels_end() const\n{\n  return channels.end();\n}\n\nShProgramNode::PaletteList::const_iterator ShProgramNode::palettes_begin() const\n{\n  return palettes.begin();\n}\n\nShProgramNode::PaletteList::const_iterator ShProgramNode::palettes_end() const\n{\n  return palettes.end();\n}\n\nbool ShProgramNode::finished() const\n{\n  return m_finished;\n}\n\nvoid ShProgramNode::finish()\n{\n  m_finished = true;\n  if (m_assigned_var) {\n    m_assigned_var->attach(this);\n    m_assigned_var = 0;\n  }\n}\n\nvoid ShProgramNode::assign(const ShVariableNodePtr& var) const\n{\n  m_assigned_var = var;\n}\n\nstd::string ShProgramNode::describe(const VarList &varlist) {\n  std::ostringstream os;\n  for(VarList::const_iterator I = varlist.begin(); I != varlist.end(); ++I) {\n    os << \"  \" << (*I)->nameOfType() << \" \" << (*I)->name() << std::endl;\n  }\n  return os.str();\n}\n\nstd::string ShProgramNode::describe(const ChannelList& chanlist) {\n  std::ostringstream os;\n  for(ChannelList::const_iterator I = chanlist.begin(); I != chanlist.end(); ++I) {\n    os << \"  \" << (*I)->nameOfType() << \" \" << (*I)->name() << std::endl;\n  }\n  return os.str();\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"ros\/ros.h\"\n#include \"boost\/asio.hpp\"\n#include \"jaws_msgs\/Thrusters.h\"\n#include \"time.h\"\nclass Arbotix\n{\n  private:\n    ros::NodeHandle nh;\n    ros::Subscriber sub;\n    boost::asio::io_service i_o;\n    boost::asio::serial_port s_p;\n    std::string port_name;\n    int br;\n    char c;\n    std::string feedback;\n  public:\n    Arbotix() : nh(), i_o(), s_p(i_o)\n    {\n      nh.getParam(\"\/arbotix_node\/port_name\",port_name);\n      nh.getParam(\"\/arbotix_node\/baud_rate\",br);\n      s_p.open(port_name);\n      s_p.set_option(boost::asio::serial_port_base::baud_rate(br));\n\n      sub = nh.subscribe<jaws_msgs::Thrusters>(\"thrusters\", 1, &Arbotix::callback, this);\n    }\n    void restartPort()\n    {\n\tnh.getParam(\"\/arbotix_node\/port_name\",port_name);\n\tnh.getParam(\"\/arbotix_node\/baud_rate\",br);\n\ts_p.close();\n        s_p.open(port_name);\n\ts_p.set_option(boost::asio::serial_port_base::baud_rate(br));\n    }\n    void callback(const jaws_msgs::Thrusters::ConstPtr& thrusters)\n    {\n      const int SIZE = 11;\n      unsigned char packet[SIZE];\n\t\n      unsigned int start=clock();\n      packet[0] = '-';\n\n      packet[1] = (thrusters->port_angle >> 8) & 0xFF;\n      packet[2] = thrusters->port_angle & 0xFF;\n\n      packet[3] = (thrusters->stbd_angle >> 8) & 0xFF;\n      packet[4] = thrusters->stbd_angle & 0xFF;\n\n      packet[5] = (thrusters->aft_power >> 8) & 0xFF;\n      packet[6] = thrusters->aft_power & 0xFF;\n\n      packet[7] = (thrusters->port_power >> 8) & 0xFF;\n      packet[8] = thrusters->port_power & 0xFF;\n      packet[9] = (thrusters->stbd_power >> 8) & 0xFF;\n      packet[10] = thrusters->stbd_power & 0xFF;\n\n      s_p.write_some(boost::asio::buffer(&packet, SIZE));\n      c='a';\n      while(c!='\\n'){\n         c=s_p.read_some(boost::asio::buffer(&c,1));\n         if(c!='\\n'){\n \t   feedback+=c;\n\t }\n\telse{\n\t\tbreak;\n\t}\n\tif((clock()-start\/CLOCKS_PER_SEC)>5000){\n\t   restartPort();\n\t   break;\n\t}\n      }\n     ROS_INFO(\"%s\",feedback.c_str());\n\n    }\n    void loop()\n    {\n      ros::spin();\n    }\n};\n\nint main(int argc, char **argv)\n{\n  ros::init(argc, argv, \"arbotix_node\");\n  Arbotix arbotix;\n  arbotix.loop();\n}\n<commit_msg>Cleaned up code<commit_after>#include \"ros\/ros.h\"\n#include \"boost\/asio.hpp\"\n#include \"jaws_msgs\/Thrusters.h\"\n\nclass Arbotix\n{\n  private:\n    ros::NodeHandle nh;\n    ros::Subscriber sub;\n    boost::asio::io_service i_o;\n    boost::asio::serial_port s_p;\n    std::string port_name;\n    int br;\n    char c;\n    std::string feedback;\n  public:\n    Arbotix() : nh(), i_o(), s_p(i_o)\n    {\n      nh.getParam(\"\/arbotix_node\/port_name\",port_name);\n      nh.getParam(\"\/arbotix_node\/baud_rate\",br);\n      s_p.open(port_name);\n      s_p.set_option(boost::asio::serial_port_base::baud_rate(br));\n\n      sub = nh.subscribe<jaws_msgs::Thrusters>(\"thrusters\", 1, &Arbotix::callback, this);\n    }\n    void restartPort()\n    {\n\tnh.getParam(\"\/arbotix_node\/port_name\",port_name);\n\tnh.getParam(\"\/arbotix_node\/baud_rate\",br);\n\ts_p.close();\n        s_p.open(port_name);\n\ts_p.set_option(boost::asio::serial_port_base::baud_rate(br));\n    }\n    void callback(const jaws_msgs::Thrusters::ConstPtr& thrusters)\n    {\n      const int SIZE = 11;\n      unsigned char packet[SIZE];\n\t\n      unsigned int start=clock();\n      packet[0] = '-';\n\n      packet[1] = (thrusters->port_angle >> 8) & 0xFF;\n      packet[2] = thrusters->port_angle & 0xFF;\n\n      packet[3] = (thrusters->stbd_angle >> 8) & 0xFF;\n      packet[4] = thrusters->stbd_angle & 0xFF;\n\n      packet[5] = (thrusters->aft_power >> 8) & 0xFF;\n      packet[6] = thrusters->aft_power & 0xFF;\n\n      packet[7] = (thrusters->port_power >> 8) & 0xFF;\n      packet[8] = thrusters->port_power & 0xFF;\n      packet[9] = (thrusters->stbd_power >> 8) & 0xFF;\n      packet[10] = thrusters->stbd_power & 0xFF;\n\n      s_p.write_some(boost::asio::buffer(&packet, SIZE));\n      c='a';\n      while(c!='\\n'){\n         c=s_p.read_some(boost::asio::buffer(&c,1));\n         if(c!='\\n'){\n \t   feedback+=c;\n\t }\n\telse{\n\t\tbreak;\n\t}\n\tif((clock()-start\/CLOCKS_PER_SEC)>5000){\n\t   restartPort();\n\t   feedback=\"Port reset, resuming\";\n\t   break;\n\t}\n      }\n     ROS_INFO(\"%s\",feedback.c_str());\n\n    }\n    void loop()\n    {\n      ros::spin();\n    }\n}\n\nint main(int argc, char **argv)\n{\n  ros::init(argc, argv, \"arbotix_node\");\n  Arbotix arbotix;\n  arbotix.loop();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"SolidWall.h\"\n#include \"Simulation.h\"\n#include \"FEProblem.h\"\n#include \"Pipe.h\"\n#include \"Factory.h\"\n#include \"FlowModelSinglePhase.h\"\n#include \"FlowModelTwoPhase.h\"\n\nregisterMooseObject(\"RELAP7App\", SolidWall);\n\ntemplate <>\nInputParameters\nvalidParams<SolidWall>()\n{\n  InputParameters params = validParams<FlowBoundary>();\n  return params;\n}\n\nSolidWall::SolidWall(const InputParameters & params) : FlowBoundary(params) {}\n\nvoid\nSolidWall::check() const\n{\n  if ((_spatial_discretization == FlowModel::rDG) && (_flow_model_id == RELAP7::FM_TWO_PHASE))\n    logSpatialDiscretizationNotImplementedError(_spatial_discretization);\n}\n\nvoid\nSolidWall::addMooseObjects1Phase()\n{\n  if (_spatial_discretization == FlowModel::CG)\n  {\n    InputParameters params = _factory.getValidParams(\"DirichletBC\");\n    params.set<NonlinearVariableName>(\"variable\") = FlowModelSinglePhase::RHOUA;\n    params.set<std::vector<BoundaryName>>(\"boundary\") = getBoundaryNames();\n    params.set<Real>(\"value\") = 0.;\n    _sim.addBoundaryCondition(\"DirichletBC\", genName(name(), \"rhou\"), params);\n  }\n  else if (_spatial_discretization == FlowModel::rDG)\n  {\n    ExecFlagEnum userobject_execute_on(MooseUtils::getDefaultExecFlagEnum());\n    userobject_execute_on = {EXEC_LINEAR, EXEC_NONLINEAR};\n\n    \/\/ boundary flux user object\n    const std::string boundary_flux_name = genName(name(), \"boundary_flux\");\n    {\n      const std::string class_name = \"Euler1DVarAreaWallBoundaryFlux\";\n      InputParameters params = _factory.getValidParams(class_name);\n      params.set<UserObjectName>(\"rdg_flux\") = _rdg_flux_name;\n      params.set<ExecFlagEnum>(\"execute_on\") = userobject_execute_on;\n      _sim.addUserObject(class_name, boundary_flux_name, params);\n    }\n\n    \/\/ BCs\n    createRDGBoundaryConditions1Phase(boundary_flux_name);\n  }\n}\n\nvoid\nSolidWall::addMooseObjects2Phase()\n{\n  {\n    InputParameters params = _factory.getValidParams(\"DirichletBC\");\n    params.set<NonlinearVariableName>(\"variable\") = FlowModelTwoPhase::ALPHA_RHOU_A_LIQUID;\n    params.set<std::vector<BoundaryName>>(\"boundary\") = getBoundaryNames();\n    params.set<Real>(\"value\") = 0.;\n    _sim.addBoundaryCondition(\"DirichletBC\", genName(name(), \"arhouA_liquid\"), params);\n  }\n  {\n    InputParameters params = _factory.getValidParams(\"DirichletBC\");\n    params.set<NonlinearVariableName>(\"variable\") = FlowModelTwoPhase::ALPHA_RHOU_A_VAPOR;\n    params.set<std::vector<BoundaryName>>(\"boundary\") = getBoundaryNames();\n    params.set<Real>(\"value\") = 0.;\n    _sim.addBoundaryCondition(\"DirichletBC\", genName(name(), \"arhouA_vapor\"), params);\n  }\n}\n\nvoid\nSolidWall::addMooseObjects()\n{\n  if (_flow_model_id == RELAP7::FM_SINGLE_PHASE)\n    addMooseObjects1Phase();\n  else if (_flow_model_id == RELAP7::FM_TWO_PHASE)\n    addMooseObjects2Phase();\n}\n<commit_msg>Added some groundwork for 2-phase NCG flow model<commit_after>#include \"SolidWall.h\"\n#include \"Simulation.h\"\n#include \"FEProblem.h\"\n#include \"Pipe.h\"\n#include \"Factory.h\"\n#include \"FlowModelSinglePhase.h\"\n#include \"FlowModelTwoPhase.h\"\n\nregisterMooseObject(\"RELAP7App\", SolidWall);\n\ntemplate <>\nInputParameters\nvalidParams<SolidWall>()\n{\n  InputParameters params = validParams<FlowBoundary>();\n  return params;\n}\n\nSolidWall::SolidWall(const InputParameters & params) : FlowBoundary(params) {}\n\nvoid\nSolidWall::check() const\n{\n  if ((_spatial_discretization == FlowModel::rDG) && (_flow_model_id != RELAP7::FM_SINGLE_PHASE))\n    logSpatialDiscretizationNotImplementedError(_spatial_discretization);\n}\n\nvoid\nSolidWall::addMooseObjects1Phase()\n{\n  if (_spatial_discretization == FlowModel::CG)\n  {\n    InputParameters params = _factory.getValidParams(\"DirichletBC\");\n    params.set<NonlinearVariableName>(\"variable\") = FlowModelSinglePhase::RHOUA;\n    params.set<std::vector<BoundaryName>>(\"boundary\") = getBoundaryNames();\n    params.set<Real>(\"value\") = 0.;\n    _sim.addBoundaryCondition(\"DirichletBC\", genName(name(), \"rhou\"), params);\n  }\n  else if (_spatial_discretization == FlowModel::rDG)\n  {\n    ExecFlagEnum userobject_execute_on(MooseUtils::getDefaultExecFlagEnum());\n    userobject_execute_on = {EXEC_LINEAR, EXEC_NONLINEAR};\n\n    \/\/ boundary flux user object\n    const std::string boundary_flux_name = genName(name(), \"boundary_flux\");\n    {\n      const std::string class_name = \"Euler1DVarAreaWallBoundaryFlux\";\n      InputParameters params = _factory.getValidParams(class_name);\n      params.set<UserObjectName>(\"rdg_flux\") = _rdg_flux_name;\n      params.set<ExecFlagEnum>(\"execute_on\") = userobject_execute_on;\n      _sim.addUserObject(class_name, boundary_flux_name, params);\n    }\n\n    \/\/ BCs\n    createRDGBoundaryConditions1Phase(boundary_flux_name);\n  }\n}\n\nvoid\nSolidWall::addMooseObjects2Phase()\n{\n  {\n    InputParameters params = _factory.getValidParams(\"DirichletBC\");\n    params.set<NonlinearVariableName>(\"variable\") = FlowModelTwoPhase::ALPHA_RHOU_A_LIQUID;\n    params.set<std::vector<BoundaryName>>(\"boundary\") = getBoundaryNames();\n    params.set<Real>(\"value\") = 0.;\n    _sim.addBoundaryCondition(\"DirichletBC\", genName(name(), \"arhouA_liquid\"), params);\n  }\n  {\n    InputParameters params = _factory.getValidParams(\"DirichletBC\");\n    params.set<NonlinearVariableName>(\"variable\") = FlowModelTwoPhase::ALPHA_RHOU_A_VAPOR;\n    params.set<std::vector<BoundaryName>>(\"boundary\") = getBoundaryNames();\n    params.set<Real>(\"value\") = 0.;\n    _sim.addBoundaryCondition(\"DirichletBC\", genName(name(), \"arhouA_vapor\"), params);\n  }\n}\n\nvoid\nSolidWall::addMooseObjects()\n{\n  if (_flow_model_id == RELAP7::FM_SINGLE_PHASE)\n    addMooseObjects1Phase();\n  else if (_flow_model_id == RELAP7::FM_TWO_PHASE || _flow_model_id == RELAP7::FM_TWO_PHASE_NCG)\n    addMooseObjects2Phase();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"SocketHandler.hpp\"\n\nnamespace et {\nvoid SocketHandler::readAll(int fd, void* buf, size_t count) {\n  size_t pos = 0;\n  while (pos < count) {\n    ssize_t bytesRead = read(fd, ((char*)buf) + pos, count - pos);\n    if (bytesRead < 0) {\n      VLOG(1) << \"Failed a call to readAll: \" << strerror(errno);\n      throw std::runtime_error(\"Failed a call to readAll\");\n    }\n    pos += bytesRead;\n  }\n}\n\nvoid SocketHandler::writeAll(int fd, const void* buf, size_t count) {\n  size_t pos = 0;\n  while (pos < count) {\n    ssize_t bytesWritten = write(fd, ((const char*)buf) + pos, count - pos);\n    if (bytesWritten < 0) {\n      VLOG(1) << \"Failed a call to writeAll: \" << strerror(errno);\n      throw std::runtime_error(\"Failed a call to writeAll\");\n    }\n    pos += bytesWritten;\n  }\n}\n}\n<commit_msg>Fix bug with SocketHandler and nonblocking sockets.<commit_after>#include \"SocketHandler.hpp\"\n\nnamespace et {\nvoid SocketHandler::readAll(int fd, void* buf, size_t count) {\n  size_t pos = 0;\n  while (pos < count) {\n    ssize_t bytesRead = read(fd, ((char*)buf) + pos, count - pos);\n    if (bytesRead < 0) {\n      if (errno == EAGAIN ||\n          errno == EWOULDBLOCK) {\n        \/\/ This is fine, just keep retrying at 10hz\n        usleep(1000 * 100);\n      } else {\n        VLOG(1) << \"Failed a call to readAll: \" << strerror(errno);\n        throw std::runtime_error(\"Failed a call to readAll\");\n      }\n    }\n    pos += bytesRead;\n  }\n}\n\nvoid SocketHandler::writeAll(int fd, const void* buf, size_t count) {\n  size_t pos = 0;\n  while (pos < count) {\n    ssize_t bytesWritten = write(fd, ((const char*)buf) + pos, count - pos);\n    if (bytesWritten < 0) {\n      if (errno == EAGAIN ||\n          errno == EWOULDBLOCK) {\n        \/\/ This is fine, just keep retrying at 10hz\n        usleep(1000 * 100);\n      } else {\n        VLOG(1) << \"Failed a call to writeAll: \" << strerror(errno);\n        throw std::runtime_error(\"Failed a call to writeAll\");\n      }\n    }\n    pos += bytesWritten;\n  }\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"qutils\/SqliteManager.h\"\n#include \"qutils\/Macros.h\"\n\/\/ Qt\n#include <QSqlQuery>\n#include <QSqlRecord>\n\nnamespace zmc\n{\n\nSqliteManager::SqliteManager()\n    : m_LastError()\n{\n\n}\n\nQSqlDatabase SqliteManager::openDatabase(const QString &databasePath)\n{\n    QSqlDatabase db;\n    if (QSqlDatabase::contains(databasePath)) {\n        db = QSqlDatabase::database(databasePath);\n    }\n    else {\n        db = QSqlDatabase::addDatabase(\"QSQLITE\", databasePath);\n        db.setDatabaseName(databasePath);\n        if (db.open() == false) {\n            LOG_ERROR(\"Cannot open the database at \" << databasePath);\n        }\n    }\n\n    return db;\n}\n\nvoid SqliteManager::closeDatabase(QSqlDatabase &database)\n{\n    database.close();\n}\n\nbool SqliteManager::createTable(QSqlDatabase &database, const QList<ColumnDefinition> &columns, const QString &tableName)\n{\n    bool successful = false;\n    if (database.isOpen() == false) {\n        LOG_ERROR(\"Database is not open!\");\n        return successful;\n    }\n\n    if (isTableExist(database, tableName)) {\n        LOG_ERROR(\"A table with the name \" << tableName << \" already exists in the database!\");\n        return successful;\n    }\n\n    QString sqlQueryStr = \"CREATE TABLE \\\"main\\\".\\\"\" + tableName + \"\\\" (\";\n    int index = 0;\n    for (const ColumnDefinition &def : columns) {\n        sqlQueryStr += \"\\\"\" + def.name + \"\\\" \" + getColumnTypeName(def.type) + \" \" + def.getNullText();\n        index++;\n        if (index < columns.size()) {\n            sqlQueryStr += \",\";\n        }\n    }\n\n    \/\/ Add the ending parenthesis\n    sqlQueryStr += \")\";\n\n    QSqlQuery query(database);\n    bool isExecSuccessful = query.exec(sqlQueryStr);\n    if (isExecSuccessful == false) {\n        updateError(database, sqlQueryStr);\n        LOG_ERROR(\"Error occurred. Message: \" << database.lastError().text());\n        successful = false;\n    }\n    else {\n        LOG(\"Table \\\"\" << tableName << \"\\\" was succesffuly created!\");\n        successful = true;\n    }\n\n    return successful;\n}\n\nbool SqliteManager::isTableExist(QSqlDatabase &database, const QString &tableName)\n{\n    bool isExist = false;\n\n    if (database.isOpen() == false) {\n        LOG_ERROR(\"Given database is not open!\");\n        return isExist;\n    }\n\n    const QString sqlQueryStr = \"SELECT COUNT(name) FROM sqlite_master WHERE type='table' AND name='\" + tableName + \"'\";\n    QSqlQuery query(database);\n    bool successfull = query.exec(sqlQueryStr);\n    if (successfull == false) {\n        updateError(database, sqlQueryStr);\n        LOG_ERROR(\"Error occurred. Message: \" << database.lastError().text());\n    }\n    else {\n        while (query.next()) {\n            const QVariant countVar = query.value(0);\n            if (countVar.isValid()) {\n                bool ok = false;\n                const int count = countVar.toInt(&ok);\n                if (ok && count == 1) {\n                    isExist = true;\n                }\n            }\n        }\n    }\n\n    return isExist;\n}\n\nbool SqliteManager::dropTable(QSqlDatabase &database, const QString &tableName)\n{\n    bool successful = false;\n    if (database.isOpen() == false) {\n        LOG_ERROR(\"Given database is not open!\");\n        return successful;\n    }\n\n    if (isTableExist(database, tableName) == false) {\n        LOG_ERROR(\"Given table, \" << tableName << \", does not exist!\");\n        return successful;\n    }\n\n    const QString sqlQueryStr = \"DROP TABLE \" + tableName;\n    QSqlQuery query(database);\n    bool successfull = query.exec(sqlQueryStr);\n    if (successfull == false) {\n        updateError(database, sqlQueryStr);\n        LOG_ERROR(\"Error occurred. Message: \" << database.lastError().text());\n    }\n    else {\n        successful = true;\n    }\n\n    return successful;\n}\n\nQString SqliteManager::constructWhereQuery(const QList<SqliteManager::Constraint> &values)\n{\n    QString query = \"WHERE \";\n    int index = 0;\n    for (const auto &t : values) {\n        if (index != 0) {\n            query += \" \";\n        }\n\n        query += std::get<0>(t) + \"='\" + std::get<1>(t) + \"'\";\n        if (index < values.size() - 1) {\n            query += \" \" + std::get<2>(t);\n        }\n\n        index++;\n    }\n\n    return query;\n}\n\nQList<QMap<QString, QVariant> > SqliteManager::executeSelectQuery(QSqlDatabase &database, const QString &sqlQueryStr)\n{\n    QList<QMap<QString, QVariant>> resultList;\n    if (database.isOpen() == false) {\n        LOG_ERROR(\"Given database is not open!\");\n        return resultList;\n    }\n\n    QSqlQuery query(database);\n    if (query.exec(sqlQueryStr) == false) {\n        updateError(database, sqlQueryStr);\n        LOG_ERROR(\"Error occurred. Message: \" << database.lastError().text());\n    }\n    else {\n        while (query.next()) {\n            const QSqlRecord record = query.record();\n            const unsigned int count = record.count();\n            QVariantMap resultMap;\n            for (unsigned int columnIndex = 0; columnIndex < count; columnIndex++) {\n                resultMap[record.fieldName(columnIndex)] = record.value(columnIndex);\n            }\n\n            resultList.append(resultMap);\n        }\n    }\n\n    return resultList;\n}\n\nQList<QMap<QString, QVariant> > SqliteManager::getFromTable(QSqlDatabase &database, const QString &tableName, const unsigned int &limit,\n        const QList<Constraint> *constraints, const SelectOrder *selectOrder)\n{\n    if (database.isOpen() == false) {\n        LOG_ERROR(\"Given database is not open!\");\n        return QList<QMap<QString, QVariant>>();\n    }\n\n    if (isTableExist(database, tableName) == false) {\n        LOG_ERROR(\"Given table, \" << tableName << \", is does not exist!\");\n        return QList<QMap<QString, QVariant>>();\n    }\n\n    QString sqlQueryStr = \"SELECT * FROM \" + tableName;\n    if (constraints && constraints->size() > 0) {\n        sqlQueryStr += \" \" + constructWhereQuery(*constraints);\n    }\n\n    if (selectOrder && selectOrder->fieldName.length() > 0) {\n        const QString orderType = selectOrder->order == SelectOrder::OrderType::ASC ? \"ASC\" : \"DESC\";\n        sqlQueryStr += \" ORDER BY \" + selectOrder->fieldName + \" \" + orderType;\n    }\n\n    if (limit > 0) {\n        sqlQueryStr += \" LIMIT \" + QString::number(limit);\n    }\n\n    return executeSelectQuery(database, sqlQueryStr);\n}\n\nbool SqliteManager::insertIntoTable(QSqlDatabase &database, const QString &tableName, const QMap<QString, QVariant> &row)\n{\n    bool successful = false;\n    if (database.isOpen() == false) {\n        LOG_ERROR(\"Given database is not open!\");\n        return successful;\n    }\n\n    if (isTableExist(database, tableName) == false) {\n        LOG_ERROR(\"Given table, \" << tableName << \", is does not exist!\");\n        return successful;\n    }\n\n    QSqlQuery query(database);\n    QString sqlQueryStr = \"INSERT INTO \" + tableName + \" \";\n    QStringList columnNames, valuePlaceholders;\n    for (auto it = row.constBegin(); it != row.constEnd(); it++) {\n        columnNames.append(it.key());\n        valuePlaceholders.append(\":\" + it.key());\n    }\n\n    sqlQueryStr.append(\"(\" + columnNames.join(',') + \") \");\n    sqlQueryStr.append(\"VALUES(\" + valuePlaceholders.join(',') + \")\");\n    query.prepare(sqlQueryStr);\n\n    \/\/ Now bind the values\n    for (auto it = row.constBegin(); it != row.constEnd(); it++) {\n        query.bindValue(\":\" + it.key(), it.value());\n    }\n\n    if (query.exec() == false) {\n        updateError(database, sqlQueryStr);\n        LOG_ERROR(\"Error occurred. Message: \" << database.lastError().text() << \". Query: \" << query.executedQuery());\n    }\n    else {\n        successful = true;\n    }\n\n    return successful;\n}\n\nbool SqliteManager::updateInTable(QSqlDatabase &database, const QString &tableName, const QMap<QString, QVariant> &row, const QList<Constraint> &constraints)\n{\n    bool successful = false;\n    if (database.isOpen() == false) {\n        LOG_ERROR(\"Given database is not open!\");\n        return successful;\n    }\n\n    if (isTableExist(database, tableName) == false) {\n        LOG_ERROR(\"Given table, \" << tableName << \", is does not exist!\");\n        return successful;\n    }\n\n    QSqlQuery query(database);\n    QString sqlQueryStr = \"UPDATE \" + tableName + \" SET \";\n    QStringList newValues;\n    for (auto it = row.constBegin(); it != row.constEnd(); it++) {\n        newValues.append(it.key() + \"=\" + \":\" + it.key());\n    }\n\n    sqlQueryStr.append(newValues.join(','));\n    sqlQueryStr.append(\" \" + constructWhereQuery(constraints));\n\n    query.prepare(sqlQueryStr);\n    \/\/ Now bind the values\n    for (auto it = row.constBegin(); it != row.constEnd(); it++) {\n        query.bindValue(\":\" + it.key(), it.value());\n    }\n\n    if (query.exec() == false) {\n        updateError(database, sqlQueryStr);\n        LOG_ERROR(\"Error occurred. Message: \" << database.lastError().text());\n    }\n    else {\n        successful = true;\n    }\n\n    return successful;\n}\n\nbool SqliteManager::deleteInTable(QSqlDatabase &database, const QString &tableName, const QList<Constraint> &constraints)\n{\n    bool successful = false;\n    if (database.isOpen() == false) {\n        LOG_ERROR(\"Given database is not open!\");\n        return successful;\n    }\n\n    if (isTableExist(database, tableName) == false) {\n        LOG_ERROR(\"Given table, \" << tableName << \", is does not exist!\");\n        return successful;\n    }\n\n    QSqlQuery query(database);\n    QString sqlQueryStr = \"DELETE FROM \" + tableName + \" \";\n    sqlQueryStr.append(constructWhereQuery(constraints));\n\n    if (query.exec(sqlQueryStr) == false) {\n        updateError(database, sqlQueryStr);\n        LOG_ERROR(\"Error occurred. Message: \" << database.lastError().text());\n    }\n    else {\n        successful = true;\n    }\n\n    return successful;\n}\n\nbool SqliteManager::exists(QSqlDatabase &database, const QString &tableName, const QList<Constraint> &constraints)\n{\n    bool exists = false;\n    if (database.isOpen() == false) {\n        LOG_ERROR(\"Given database is not open!\");\n        return exists;\n    }\n\n    if (isTableExist(database, tableName) == false) {\n        LOG_ERROR(\"Given table, \" << tableName << \", is does not exist!\");\n        return exists;\n    }\n\n    if (constraints.size() == 0) {\n        LOG_ERROR(\"Constraints size cannot be 0!\");\n        return exists;\n    }\n\n    const QString sqlQueryStr = \"SELECT COUNT(id) FROM \" + tableName + \" \" + constructWhereQuery(constraints);\n    QSqlQuery query(database);\n    bool successfull = query.exec(sqlQueryStr);\n    if (successfull == false) {\n        updateError(database, sqlQueryStr);\n        LOG_ERROR(\"Error occurred. Message: \" << database.lastError().text());\n    }\n    else {\n        const int count = query.value(0).toInt();\n        exists = count > 0;\n    }\n\n    return exists;\n}\n\nconst SqliteManager::SqliteError &SqliteManager::getLastError() const\n{\n    return m_LastError;\n}\n\nQString SqliteManager::getColumnTypeName(const ColumnTypes &type) const\n{\n    QString name = \"\";\n    if (type == ColumnTypes::TEXT) {\n        name = \"TEXT\";\n    }\n    else if (type == ColumnTypes::PK_INTEGER) {\n        name = \"INTEGER PRIMARY KEY\";\n    }\n    else if (type == ColumnTypes::PK_AUTOINCREMENT) {\n        name = \"INTEGER PRIMARY KEY AUTOINCREMENT\";\n    }\n    else if (type == ColumnTypes::INTEGER) {\n        name = \"INTEGER\";\n    }\n    else if (type == ColumnTypes::REAL) {\n        name = \"REAL\";\n    }\n    else if (type == ColumnTypes::BLOB) {\n        name = \"BLOB\";\n    }\n    else if (type == ColumnTypes::NULL_TYPE) {\n        name = \"NULL\";\n    }\n\n    return name;\n}\n\nSqliteManager::ColumnTypes SqliteManager::getColumnType(const QString &typeName) const\n{\n    ColumnTypes type;\n    if (typeName == \"TEXT\") {\n        type = ColumnTypes::TEXT;\n    }\n    else if (typeName == \"INTEGER PRIMARY KEY\") {\n        type = ColumnTypes::PK_INTEGER;\n    }\n    else if (typeName == \"INTEGER PRIMARY KEY AUTOINCREMENT\") {\n        type = ColumnTypes::PK_AUTOINCREMENT;\n    }\n    else if (typeName == \"INTEGER\") {\n        type = ColumnTypes::INTEGER;\n    }\n    else if (typeName == \"REAL\") {\n        type = ColumnTypes::REAL;\n    }\n    else if (typeName == \"BLOB\") {\n        type = ColumnTypes::BLOB;\n    }\n    else if (typeName == \"NULL\") {\n        type = ColumnTypes::NULL_TYPE;\n    }\n\n    return type;\n}\n\nvoid SqliteManager::updateError(QSqlDatabase &db, const QString &query)\n{\n    m_LastError.error = db.lastError();\n    m_LastError.query = query;\n}\n\n}\n<commit_msg>Fix teh exists method<commit_after>#include \"qutils\/SqliteManager.h\"\n#include \"qutils\/Macros.h\"\n\/\/ Qt\n#include <QSqlQuery>\n#include <QSqlRecord>\n\nnamespace zmc\n{\n\nSqliteManager::SqliteManager()\n    : m_LastError()\n{\n\n}\n\nQSqlDatabase SqliteManager::openDatabase(const QString &databasePath)\n{\n    QSqlDatabase db;\n    if (QSqlDatabase::contains(databasePath)) {\n        db = QSqlDatabase::database(databasePath);\n    }\n    else {\n        db = QSqlDatabase::addDatabase(\"QSQLITE\", databasePath);\n        db.setDatabaseName(databasePath);\n        if (db.open() == false) {\n            LOG_ERROR(\"Cannot open the database at \" << databasePath);\n        }\n    }\n\n    return db;\n}\n\nvoid SqliteManager::closeDatabase(QSqlDatabase &database)\n{\n    database.close();\n}\n\nbool SqliteManager::createTable(QSqlDatabase &database, const QList<ColumnDefinition> &columns, const QString &tableName)\n{\n    bool successful = false;\n    if (database.isOpen() == false) {\n        LOG_ERROR(\"Database is not open!\");\n        return successful;\n    }\n\n    if (isTableExist(database, tableName)) {\n        LOG_ERROR(\"A table with the name \" << tableName << \" already exists in the database!\");\n        return successful;\n    }\n\n    QString sqlQueryStr = \"CREATE TABLE \\\"main\\\".\\\"\" + tableName + \"\\\" (\";\n    int index = 0;\n    for (const ColumnDefinition &def : columns) {\n        sqlQueryStr += \"\\\"\" + def.name + \"\\\" \" + getColumnTypeName(def.type) + \" \" + def.getNullText();\n        index++;\n        if (index < columns.size()) {\n            sqlQueryStr += \",\";\n        }\n    }\n\n    \/\/ Add the ending parenthesis\n    sqlQueryStr += \")\";\n\n    QSqlQuery query(database);\n    bool isExecSuccessful = query.exec(sqlQueryStr);\n    if (isExecSuccessful == false) {\n        updateError(database, sqlQueryStr);\n        LOG_ERROR(\"Error occurred. Message: \" << database.lastError().text());\n        successful = false;\n    }\n    else {\n        LOG(\"Table \\\"\" << tableName << \"\\\" was succesffuly created!\");\n        successful = true;\n    }\n\n    return successful;\n}\n\nbool SqliteManager::isTableExist(QSqlDatabase &database, const QString &tableName)\n{\n    bool isExist = false;\n\n    if (database.isOpen() == false) {\n        LOG_ERROR(\"Given database is not open!\");\n        return isExist;\n    }\n\n    const QString sqlQueryStr = \"SELECT COUNT(name) FROM sqlite_master WHERE type='table' AND name='\" + tableName + \"'\";\n    QSqlQuery query(database);\n    bool successfull = query.exec(sqlQueryStr);\n    if (successfull == false) {\n        updateError(database, sqlQueryStr);\n        LOG_ERROR(\"Error occurred. Message: \" << database.lastError().text());\n    }\n    else {\n        while (query.next()) {\n            const QVariant countVar = query.value(0);\n            if (countVar.isValid()) {\n                bool ok = false;\n                const int count = countVar.toInt(&ok);\n                if (ok && count == 1) {\n                    isExist = true;\n                }\n            }\n        }\n    }\n\n    return isExist;\n}\n\nbool SqliteManager::dropTable(QSqlDatabase &database, const QString &tableName)\n{\n    bool successful = false;\n    if (database.isOpen() == false) {\n        LOG_ERROR(\"Given database is not open!\");\n        return successful;\n    }\n\n    if (isTableExist(database, tableName) == false) {\n        LOG_ERROR(\"Given table, \" << tableName << \", does not exist!\");\n        return successful;\n    }\n\n    const QString sqlQueryStr = \"DROP TABLE \" + tableName;\n    QSqlQuery query(database);\n    bool successfull = query.exec(sqlQueryStr);\n    if (successfull == false) {\n        updateError(database, sqlQueryStr);\n        LOG_ERROR(\"Error occurred. Message: \" << database.lastError().text());\n    }\n    else {\n        successful = true;\n    }\n\n    return successful;\n}\n\nQString SqliteManager::constructWhereQuery(const QList<SqliteManager::Constraint> &values)\n{\n    QString query = \"WHERE \";\n    int index = 0;\n    for (const auto &t : values) {\n        if (index != 0) {\n            query += \" \";\n        }\n\n        query += std::get<0>(t) + \"='\" + std::get<1>(t) + \"'\";\n        if (index < values.size() - 1) {\n            query += \" \" + std::get<2>(t);\n        }\n\n        index++;\n    }\n\n    return query;\n}\n\nQList<QMap<QString, QVariant> > SqliteManager::executeSelectQuery(QSqlDatabase &database, const QString &sqlQueryStr)\n{\n    QList<QMap<QString, QVariant>> resultList;\n    if (database.isOpen() == false) {\n        LOG_ERROR(\"Given database is not open!\");\n        return resultList;\n    }\n\n    QSqlQuery query(database);\n    if (query.exec(sqlQueryStr) == false) {\n        updateError(database, sqlQueryStr);\n        LOG_ERROR(\"Error occurred. Message: \" << database.lastError().text());\n    }\n    else {\n        while (query.next()) {\n            const QSqlRecord record = query.record();\n            const unsigned int count = record.count();\n            QVariantMap resultMap;\n            for (unsigned int columnIndex = 0; columnIndex < count; columnIndex++) {\n                resultMap[record.fieldName(columnIndex)] = record.value(columnIndex);\n            }\n\n            resultList.append(resultMap);\n        }\n    }\n\n    return resultList;\n}\n\nQList<QMap<QString, QVariant> > SqliteManager::getFromTable(QSqlDatabase &database, const QString &tableName, const unsigned int &limit,\n        const QList<Constraint> *constraints, const SelectOrder *selectOrder)\n{\n    if (database.isOpen() == false) {\n        LOG_ERROR(\"Given database is not open!\");\n        return QList<QMap<QString, QVariant>>();\n    }\n\n    if (isTableExist(database, tableName) == false) {\n        LOG_ERROR(\"Given table, \" << tableName << \", is does not exist!\");\n        return QList<QMap<QString, QVariant>>();\n    }\n\n    QString sqlQueryStr = \"SELECT * FROM \" + tableName;\n    if (constraints && constraints->size() > 0) {\n        sqlQueryStr += \" \" + constructWhereQuery(*constraints);\n    }\n\n    if (selectOrder && selectOrder->fieldName.length() > 0) {\n        const QString orderType = selectOrder->order == SelectOrder::OrderType::ASC ? \"ASC\" : \"DESC\";\n        sqlQueryStr += \" ORDER BY \" + selectOrder->fieldName + \" \" + orderType;\n    }\n\n    if (limit > 0) {\n        sqlQueryStr += \" LIMIT \" + QString::number(limit);\n    }\n\n    return executeSelectQuery(database, sqlQueryStr);\n}\n\nbool SqliteManager::insertIntoTable(QSqlDatabase &database, const QString &tableName, const QMap<QString, QVariant> &row)\n{\n    bool successful = false;\n    if (database.isOpen() == false) {\n        LOG_ERROR(\"Given database is not open!\");\n        return successful;\n    }\n\n    if (isTableExist(database, tableName) == false) {\n        LOG_ERROR(\"Given table, \" << tableName << \", is does not exist!\");\n        return successful;\n    }\n\n    QSqlQuery query(database);\n    QString sqlQueryStr = \"INSERT INTO \" + tableName + \" \";\n    QStringList columnNames, valuePlaceholders;\n    for (auto it = row.constBegin(); it != row.constEnd(); it++) {\n        columnNames.append(it.key());\n        valuePlaceholders.append(\":\" + it.key());\n    }\n\n    sqlQueryStr.append(\"(\" + columnNames.join(',') + \") \");\n    sqlQueryStr.append(\"VALUES(\" + valuePlaceholders.join(',') + \")\");\n    query.prepare(sqlQueryStr);\n\n    \/\/ Now bind the values\n    for (auto it = row.constBegin(); it != row.constEnd(); it++) {\n        query.bindValue(\":\" + it.key(), it.value());\n    }\n\n    if (query.exec() == false) {\n        updateError(database, sqlQueryStr);\n        LOG_ERROR(\"Error occurred. Message: \" << database.lastError().text() << \". Query: \" << query.executedQuery());\n    }\n    else {\n        successful = true;\n    }\n\n    return successful;\n}\n\nbool SqliteManager::updateInTable(QSqlDatabase &database, const QString &tableName, const QMap<QString, QVariant> &row, const QList<Constraint> &constraints)\n{\n    bool successful = false;\n    if (database.isOpen() == false) {\n        LOG_ERROR(\"Given database is not open!\");\n        return successful;\n    }\n\n    if (isTableExist(database, tableName) == false) {\n        LOG_ERROR(\"Given table, \" << tableName << \", is does not exist!\");\n        return successful;\n    }\n\n    QSqlQuery query(database);\n    QString sqlQueryStr = \"UPDATE \" + tableName + \" SET \";\n    QStringList newValues;\n    for (auto it = row.constBegin(); it != row.constEnd(); it++) {\n        newValues.append(it.key() + \"=\" + \":\" + it.key());\n    }\n\n    sqlQueryStr.append(newValues.join(','));\n    sqlQueryStr.append(\" \" + constructWhereQuery(constraints));\n\n    query.prepare(sqlQueryStr);\n    \/\/ Now bind the values\n    for (auto it = row.constBegin(); it != row.constEnd(); it++) {\n        query.bindValue(\":\" + it.key(), it.value());\n    }\n\n    if (query.exec() == false) {\n        updateError(database, sqlQueryStr);\n        LOG_ERROR(\"Error occurred. Message: \" << database.lastError().text());\n    }\n    else {\n        successful = true;\n    }\n\n    return successful;\n}\n\nbool SqliteManager::deleteInTable(QSqlDatabase &database, const QString &tableName, const QList<Constraint> &constraints)\n{\n    bool successful = false;\n    if (database.isOpen() == false) {\n        LOG_ERROR(\"Given database is not open!\");\n        return successful;\n    }\n\n    if (isTableExist(database, tableName) == false) {\n        LOG_ERROR(\"Given table, \" << tableName << \", is does not exist!\");\n        return successful;\n    }\n\n    QSqlQuery query(database);\n    QString sqlQueryStr = \"DELETE FROM \" + tableName + \" \";\n    sqlQueryStr.append(constructWhereQuery(constraints));\n\n    if (query.exec(sqlQueryStr) == false) {\n        updateError(database, sqlQueryStr);\n        LOG_ERROR(\"Error occurred. Message: \" << database.lastError().text());\n    }\n    else {\n        successful = true;\n    }\n\n    return successful;\n}\n\nbool SqliteManager::exists(QSqlDatabase &database, const QString &tableName, const QList<Constraint> &constraints)\n{\n    bool exists = false;\n    if (database.isOpen() == false) {\n        LOG_ERROR(\"Given database is not open!\");\n        return exists;\n    }\n\n    if (isTableExist(database, tableName) == false) {\n        LOG_ERROR(\"Given table, \" << tableName << \", is does not exist!\");\n        return exists;\n    }\n\n    if (constraints.size() == 0) {\n        LOG_ERROR(\"Constraints size cannot be 0!\");\n        return exists;\n    }\n\n    const QString sqlQueryStr = \"SELECT COUNT(rowid) FROM \" + tableName + \" \" + constructWhereQuery(constraints);\n    QSqlQuery query(database);\n    bool successfull = query.exec(sqlQueryStr);\n    if (successfull == false) {\n        updateError(database, sqlQueryStr);\n        LOG_ERROR(\"Error occurred. Message: \" << database.lastError().text() << \". Query: \" << sqlQueryStr);\n    }\n    else {\n        query.first();\n        const int count = query.value(0).toInt();\n        exists = count > 0;\n    }\n\n    return exists;\n}\n\nconst SqliteManager::SqliteError &SqliteManager::getLastError() const\n{\n    return m_LastError;\n}\n\nQString SqliteManager::getColumnTypeName(const ColumnTypes &type) const\n{\n    QString name = \"\";\n    if (type == ColumnTypes::TEXT) {\n        name = \"TEXT\";\n    }\n    else if (type == ColumnTypes::PK_INTEGER) {\n        name = \"INTEGER PRIMARY KEY\";\n    }\n    else if (type == ColumnTypes::PK_AUTOINCREMENT) {\n        name = \"INTEGER PRIMARY KEY AUTOINCREMENT\";\n    }\n    else if (type == ColumnTypes::INTEGER) {\n        name = \"INTEGER\";\n    }\n    else if (type == ColumnTypes::REAL) {\n        name = \"REAL\";\n    }\n    else if (type == ColumnTypes::BLOB) {\n        name = \"BLOB\";\n    }\n    else if (type == ColumnTypes::NULL_TYPE) {\n        name = \"NULL\";\n    }\n\n    return name;\n}\n\nSqliteManager::ColumnTypes SqliteManager::getColumnType(const QString &typeName) const\n{\n    ColumnTypes type;\n    if (typeName == \"TEXT\") {\n        type = ColumnTypes::TEXT;\n    }\n    else if (typeName == \"INTEGER PRIMARY KEY\") {\n        type = ColumnTypes::PK_INTEGER;\n    }\n    else if (typeName == \"INTEGER PRIMARY KEY AUTOINCREMENT\") {\n        type = ColumnTypes::PK_AUTOINCREMENT;\n    }\n    else if (typeName == \"INTEGER\") {\n        type = ColumnTypes::INTEGER;\n    }\n    else if (typeName == \"REAL\") {\n        type = ColumnTypes::REAL;\n    }\n    else if (typeName == \"BLOB\") {\n        type = ColumnTypes::BLOB;\n    }\n    else if (typeName == \"NULL\") {\n        type = ColumnTypes::NULL_TYPE;\n    }\n\n    return type;\n}\n\nvoid SqliteManager::updateError(QSqlDatabase &db, const QString &query)\n{\n    m_LastError.error = db.lastError();\n    m_LastError.query = query;\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Fix for erosion sim in editor<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"Client.hxx\"\n#include \"event\/Duration.hxx\"\n#include \"net\/SocketAddress.hxx\"\n#include \"net\/Interface.hxx\"\n\n#include <daemon\/log.h>\n\n#include <avahi-common\/error.h>\n#include <avahi-common\/malloc.h>\n#include <avahi-common\/alternative.h>\n\nMyAvahiClient::MyAvahiClient(EventLoop &event_loop, const char *_name)\n    :name(_name),\n     reconnect_timer(event_loop, BIND_THIS_METHOD(OnReconnectTimer)),\n     poll(event_loop)\n{\n}\n\nMyAvahiClient::~MyAvahiClient()\n{\n    Close();\n}\n\nvoid\nMyAvahiClient::AddService(AvahiIfIndex interface, AvahiProtocol protocol,\n                          const char *type, uint16_t port)\n{\n    \/* cannot register any more services after initial connect *\/\n    assert(client == nullptr);\n\n    if (services.empty())\n        \/* initiate the connection *\/\n        reconnect_timer.Add(EventDuration<0, 10000>::value);\n\n    services.emplace_front(interface, protocol, type, port);\n}\n\nvoid\nMyAvahiClient::AddService(const char *type, SocketAddress address)\n{\n    unsigned port = address.GetPort();\n    if (port == 0)\n        return;\n\n    unsigned i = FindNetworkInterface(address);\n    AvahiIfIndex ii = i > 0\n        ? AvahiIfIndex(i)\n        : AVAHI_IF_UNSPEC;\n\n    AvahiProtocol protocol = AVAHI_PROTO_UNSPEC;\n    switch (address.GetFamily()) {\n    case AF_INET:\n        protocol = AVAHI_PROTO_INET;\n        break;\n\n    case AF_INET6:\n        protocol = AVAHI_PROTO_INET6;\n        break;\n    }\n\n    AddService(ii, protocol, type, port);\n}\n\nvoid\nMyAvahiClient::Close()\n{\n    if (group != nullptr) {\n        avahi_entry_group_free(group);\n        group = nullptr;\n    }\n\n    if (client != nullptr)\n        avahi_client_free(client);\n}\n\nvoid\nMyAvahiClient::GroupCallback(AvahiEntryGroup *g, AvahiEntryGroupState state)\n{\n    switch (state) {\n    case AVAHI_ENTRY_GROUP_ESTABLISHED:\n        break;\n\n    case AVAHI_ENTRY_GROUP_COLLISION:\n        \/* pick a new name *\/\n\n        {\n            char *new_name = avahi_alternative_service_name(name.c_str());\n            name = new_name;\n            avahi_free(new_name);\n        }\n\n        \/* And recreate the services *\/\n        RegisterServices(avahi_entry_group_get_client(g));\n        break;\n\n    case AVAHI_ENTRY_GROUP_FAILURE:\n        daemon_log(3, \"Avahi service group failure: %s\\n\",\n                   avahi_strerror(avahi_client_errno(avahi_entry_group_get_client(g))));\n        break;\n\n    case AVAHI_ENTRY_GROUP_UNCOMMITED:\n    case AVAHI_ENTRY_GROUP_REGISTERING:\n        break;\n    }\n}\n\nvoid\nMyAvahiClient::GroupCallback(AvahiEntryGroup *g,\n                             AvahiEntryGroupState state,\n                             void *userdata)\n{\n    auto &client = *(MyAvahiClient *)userdata;\n    client.GroupCallback(g, state);\n}\n\nvoid\nMyAvahiClient::RegisterServices(AvahiClient *c)\n{\n    if (group == nullptr) {\n        group = avahi_entry_group_new(c, GroupCallback, this);\n        if (group == nullptr) {\n            daemon_log(3, \"Failed to create Avahi service group: %s\\n\",\n                       avahi_strerror(avahi_client_errno(c)));\n            return;\n        }\n    }\n\n    for (const auto &i : services) {\n        int error = avahi_entry_group_add_service(group,\n                                                  AVAHI_IF_UNSPEC,\n                                                  AVAHI_PROTO_UNSPEC,\n                                                  AvahiPublishFlags(0),\n                                                  name.c_str(), i.type.c_str(),\n                                                  nullptr, nullptr,\n                                                  i.port, nullptr);\n        if (error < 0) {\n            daemon_log(3, \"Failed to add Avahi service %s: %s\\n\",\n                       i.type.c_str(), avahi_strerror(error));\n            return;\n        }\n    }\n\n    int result = avahi_entry_group_commit(group);\n    if (result < 0) {\n        daemon_log(3, \"Failed to commit Avahi service group: %s\\n\",\n                   avahi_strerror(result));\n        return;\n    }\n}\n\nvoid\nMyAvahiClient::ClientCallback(AvahiClient *c, AvahiClientState state)\n{\n    int error;\n\n    switch (state) {\n    case AVAHI_CLIENT_S_RUNNING:\n        if (group == nullptr)\n            RegisterServices(c);\n        break;\n\n    case AVAHI_CLIENT_FAILURE:\n        error = avahi_client_errno(c);\n        if (error == AVAHI_ERR_DISCONNECTED) {\n            Close();\n\n            reconnect_timer.Add(EventDuration<10, 0>::value);\n        } else {\n            daemon_log(3, \"Avahi client failed: %s\\n\", avahi_strerror(error));\n            reconnect_timer.Add(EventDuration<60, 0>::value);\n        }\n\n        break;\n\n    case AVAHI_CLIENT_S_COLLISION:\n    case AVAHI_CLIENT_S_REGISTERING:\n        if (group != nullptr)\n            avahi_entry_group_reset(group);\n\n        break;\n\n    case AVAHI_CLIENT_CONNECTING:\n        break;\n    }\n}\n\nvoid\nMyAvahiClient::ClientCallback(AvahiClient *c, AvahiClientState state,\n                              void *userdata)\n{\n    auto &client = *(MyAvahiClient *)userdata;\n    client.ClientCallback(c, state);\n}\n\nvoid\nMyAvahiClient::OnReconnectTimer()\n{\n    int error;\n    client = avahi_client_new(&poll, AVAHI_CLIENT_NO_FAIL,\n                              ClientCallback, this,\n                              &error);\n    if (client == nullptr) {\n        daemon_log(3, \"Failed to create avahi client: %s\\n\",\n                   avahi_strerror(error));\n        reconnect_timer.Add(EventDuration<60, 0>::value);\n        return;\n    }\n}\n<commit_msg>avahi\/Client: register group only if services have been added<commit_after>\/*\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"Client.hxx\"\n#include \"event\/Duration.hxx\"\n#include \"net\/SocketAddress.hxx\"\n#include \"net\/Interface.hxx\"\n\n#include <daemon\/log.h>\n\n#include <avahi-common\/error.h>\n#include <avahi-common\/malloc.h>\n#include <avahi-common\/alternative.h>\n\nMyAvahiClient::MyAvahiClient(EventLoop &event_loop, const char *_name)\n    :name(_name),\n     reconnect_timer(event_loop, BIND_THIS_METHOD(OnReconnectTimer)),\n     poll(event_loop)\n{\n}\n\nMyAvahiClient::~MyAvahiClient()\n{\n    Close();\n}\n\nvoid\nMyAvahiClient::AddService(AvahiIfIndex interface, AvahiProtocol protocol,\n                          const char *type, uint16_t port)\n{\n    \/* cannot register any more services after initial connect *\/\n    assert(client == nullptr);\n\n    if (services.empty())\n        \/* initiate the connection *\/\n        reconnect_timer.Add(EventDuration<0, 10000>::value);\n\n    services.emplace_front(interface, protocol, type, port);\n}\n\nvoid\nMyAvahiClient::AddService(const char *type, SocketAddress address)\n{\n    unsigned port = address.GetPort();\n    if (port == 0)\n        return;\n\n    unsigned i = FindNetworkInterface(address);\n    AvahiIfIndex ii = i > 0\n        ? AvahiIfIndex(i)\n        : AVAHI_IF_UNSPEC;\n\n    AvahiProtocol protocol = AVAHI_PROTO_UNSPEC;\n    switch (address.GetFamily()) {\n    case AF_INET:\n        protocol = AVAHI_PROTO_INET;\n        break;\n\n    case AF_INET6:\n        protocol = AVAHI_PROTO_INET6;\n        break;\n    }\n\n    AddService(ii, protocol, type, port);\n}\n\nvoid\nMyAvahiClient::Close()\n{\n    if (group != nullptr) {\n        avahi_entry_group_free(group);\n        group = nullptr;\n    }\n\n    if (client != nullptr)\n        avahi_client_free(client);\n}\n\nvoid\nMyAvahiClient::GroupCallback(AvahiEntryGroup *g, AvahiEntryGroupState state)\n{\n    switch (state) {\n    case AVAHI_ENTRY_GROUP_ESTABLISHED:\n        break;\n\n    case AVAHI_ENTRY_GROUP_COLLISION:\n        \/* pick a new name *\/\n\n        {\n            char *new_name = avahi_alternative_service_name(name.c_str());\n            name = new_name;\n            avahi_free(new_name);\n        }\n\n        \/* And recreate the services *\/\n        RegisterServices(avahi_entry_group_get_client(g));\n        break;\n\n    case AVAHI_ENTRY_GROUP_FAILURE:\n        daemon_log(3, \"Avahi service group failure: %s\\n\",\n                   avahi_strerror(avahi_client_errno(avahi_entry_group_get_client(g))));\n        break;\n\n    case AVAHI_ENTRY_GROUP_UNCOMMITED:\n    case AVAHI_ENTRY_GROUP_REGISTERING:\n        break;\n    }\n}\n\nvoid\nMyAvahiClient::GroupCallback(AvahiEntryGroup *g,\n                             AvahiEntryGroupState state,\n                             void *userdata)\n{\n    auto &client = *(MyAvahiClient *)userdata;\n    client.GroupCallback(g, state);\n}\n\nvoid\nMyAvahiClient::RegisterServices(AvahiClient *c)\n{\n    if (group == nullptr) {\n        group = avahi_entry_group_new(c, GroupCallback, this);\n        if (group == nullptr) {\n            daemon_log(3, \"Failed to create Avahi service group: %s\\n\",\n                       avahi_strerror(avahi_client_errno(c)));\n            return;\n        }\n    }\n\n    for (const auto &i : services) {\n        int error = avahi_entry_group_add_service(group,\n                                                  AVAHI_IF_UNSPEC,\n                                                  AVAHI_PROTO_UNSPEC,\n                                                  AvahiPublishFlags(0),\n                                                  name.c_str(), i.type.c_str(),\n                                                  nullptr, nullptr,\n                                                  i.port, nullptr);\n        if (error < 0) {\n            daemon_log(3, \"Failed to add Avahi service %s: %s\\n\",\n                       i.type.c_str(), avahi_strerror(error));\n            return;\n        }\n    }\n\n    int result = avahi_entry_group_commit(group);\n    if (result < 0) {\n        daemon_log(3, \"Failed to commit Avahi service group: %s\\n\",\n                   avahi_strerror(result));\n        return;\n    }\n}\n\nvoid\nMyAvahiClient::ClientCallback(AvahiClient *c, AvahiClientState state)\n{\n    int error;\n\n    switch (state) {\n    case AVAHI_CLIENT_S_RUNNING:\n        if (!services.empty() && group == nullptr)\n            RegisterServices(c);\n        break;\n\n    case AVAHI_CLIENT_FAILURE:\n        error = avahi_client_errno(c);\n        if (error == AVAHI_ERR_DISCONNECTED) {\n            Close();\n\n            reconnect_timer.Add(EventDuration<10, 0>::value);\n        } else {\n            daemon_log(3, \"Avahi client failed: %s\\n\", avahi_strerror(error));\n            reconnect_timer.Add(EventDuration<60, 0>::value);\n        }\n\n        break;\n\n    case AVAHI_CLIENT_S_COLLISION:\n    case AVAHI_CLIENT_S_REGISTERING:\n        if (group != nullptr)\n            avahi_entry_group_reset(group);\n\n        break;\n\n    case AVAHI_CLIENT_CONNECTING:\n        break;\n    }\n}\n\nvoid\nMyAvahiClient::ClientCallback(AvahiClient *c, AvahiClientState state,\n                              void *userdata)\n{\n    auto &client = *(MyAvahiClient *)userdata;\n    client.ClientCallback(c, state);\n}\n\nvoid\nMyAvahiClient::OnReconnectTimer()\n{\n    int error;\n    client = avahi_client_new(&poll, AVAHI_CLIENT_NO_FAIL,\n                              ClientCallback, this,\n                              &error);\n    if (client == nullptr) {\n        daemon_log(3, \"Failed to create avahi client: %s\\n\",\n                   avahi_strerror(error));\n        reconnect_timer.Add(EventDuration<60, 0>::value);\n        return;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2006 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: Ali Saidi\n *\/\n\n#ifndef __BASE_COMPILER_HH__\n#define __BASE_COMPILER_HH__\n\n\/\/http:\/\/msdn2.microsoft.com\/en-us\/library\/ms937669.aspx\n\/\/http:\/\/msdn2.microsoft.com\/en-us\/library\/aa448724.aspx\n\/\/http:\/\/docs.sun.com\/source\/819-3688\/sun.specific.html#marker-998278\n\/\/http:\/\/gcc.gnu.org\/onlinedocs\/gcc-3.3.1\/gcc\/Function-Attributes.html#Function%20Attributes\n\n#if defined(__GNUC__)\n#define M5_ATTR_NORETURN  __attribute__((noreturn))\n#define M5_PRAGMA_NORETURN(x)\n#define M5_DUMMY_RETURN\n#define M5_VAR_USED __attribute__((unused))\n#define M5_ATTR_PACKED __attribute__ ((__packed__))\n#elif defined(__SUNPRO_CC)\n\/\/ this doesn't do anything with sun cc, but why not\n#define M5_ATTR_NORETURN  __sun_attr__((__noreturn__))\n#define M5_DUMMY_RETURN return (0);\n#define DO_PRAGMA(x) _Pragma(#x)\n#define M5_VAR_USED\n#define M5_PRAGMA_NORETURN(x) DO_PRAGMA(does_not_return(x))\n#define M5_ATTR_PACKED __attribute__ ((__packed__))\n#else\n#error \"Need to define compiler options in base\/compiler.hh\"\n#endif\n\n#endif \/\/ __BASE_COMPILER_HH__\n<commit_msg>Compiler: Add an M5_NO_INLINE define.<commit_after>\/*\n * Copyright (c) 2006 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: Ali Saidi\n *\/\n\n#ifndef __BASE_COMPILER_HH__\n#define __BASE_COMPILER_HH__\n\n\/\/http:\/\/msdn2.microsoft.com\/en-us\/library\/ms937669.aspx\n\/\/http:\/\/msdn2.microsoft.com\/en-us\/library\/aa448724.aspx\n\/\/http:\/\/docs.sun.com\/source\/819-3688\/sun.specific.html#marker-998278\n\/\/http:\/\/gcc.gnu.org\/onlinedocs\/gcc-3.3.1\/gcc\/Function-Attributes.html#Function%20Attributes\n\n#if defined(__GNUC__)\n#define M5_ATTR_NORETURN  __attribute__((noreturn))\n#define M5_PRAGMA_NORETURN(x)\n#define M5_DUMMY_RETURN\n#define M5_VAR_USED __attribute__((unused))\n#define M5_ATTR_PACKED __attribute__ ((__packed__))\n#define M5_NO_INLINE __attribute__ ((__noinline__))\n#elif defined(__SUNPRO_CC)\n\/\/ this doesn't do anything with sun cc, but why not\n#define M5_ATTR_NORETURN  __sun_attr__((__noreturn__))\n#define M5_DUMMY_RETURN return (0);\n#define DO_PRAGMA(x) _Pragma(#x)\n#define M5_VAR_USED\n#define M5_PRAGMA_NORETURN(x) DO_PRAGMA(does_not_return(x))\n#define M5_ATTR_PACKED __attribute__ ((__packed__))\n#define M5_NO_INLINE __attribute__ ((__noinline__))\n#else\n#error \"Need to define compiler options in base\/compiler.hh\"\n#endif\n\n#endif \/\/ __BASE_COMPILER_HH__\n<|endoftext|>"}
{"text":"<commit_before>#include \"..\/common\/init.h\"\n#include \"..\/common\/timer.h\"\n\n#include \"util\/stretch-bitmap.h\"\n#include \"util\/input\/input.h\"\n#include \"util\/input\/input-manager.h\"\n\n#include \"util\/gui\/animation.h\"\n#include \"util\/gui\/box.h\"\n#include \"util\/gui\/container.h\"\n#include \"util\/gui\/context-box.h\"\n#include \"util\/gui\/coordinate.h\"\n#include \"util\/gui\/cutscene.h\"\n#include \"util\/gui\/fadetool.h\"\n#include \"util\/gui\/keys.h\"\n#include \"util\/gui\/keyinput.h\"\n#include \"util\/gui\/keyinput_manager.h\"\n#include \"util\/gui\/lineedit.h\"\n#include \"util\/gui\/rectarea.h\"\n#include \"util\/gui\/popup-box.h\"\n#include \"util\/gui\/scroll-list.h\"\n#include \"util\/gui\/select-list.h\"\n#include \"util\/gui\/tabbed-box.h\"\n#include \"util\/gui\/timer.h\"\n#include \"util\/gui\/widget.h\"\n\nusing namespace std;\n\nenum Keys{\n    Up=0,\n    Down,\n    Left,\n    Right,\n    Esc\n};\n\nclass Logic: public Util::Logic {\npublic:\n    Logic(InputMap<Keys> & input):\n    is_done(false),\n    input(input){\n    }\n\n    bool is_done;\n    InputMap<Keys> & input;\n    \n    bool done(){\n        return is_done;\n    }\n\n    void run(){\n        vector<InputMap<Keys>::InputEvent> out = InputManager::getEvents(input, InputSource());\n        for (vector<InputMap<Keys>::InputEvent>::iterator it = out.begin(); it != out.end(); it++){\n            const InputMap<Keys>::InputEvent & event = *it;\n            if (event.enabled){\n                if (event.out == Esc){\n                    is_done = true;\n                }\n                if (event.out == Up){\n                }\n                if (event.out == Down){\n                }\n                if (event.out == Left){\n                }\n                if (event.out == Right){\n                }\n            }\n        }\n    \n    }\n\n    double ticks(double system){\n        return system;\n    }\n};\n\nclass Draw: public Util::Draw {\npublic:\n    Draw(){\n    }\n\n    void draw(const Graphics::Bitmap & buffer){\n        buffer.putPixel(rand() % 640, rand() % 480, Graphics::makeColor(rand() % 255, rand() % 255, rand() % 255));\n        buffer.BlitToScreen();\n    }\n};\n\nint main(int argc, char ** argv){\n    Screen::realInit();\n    Common::startTimers();\n    \n    InputManager manager;\n    Graphics::Bitmap screen(Graphics::getScreenBuffer());\n    Util::Parameter<Graphics::Bitmap*> use(Graphics::screenParameter, &screen);\n    \n    InputMap<Keys> input;\n    input.set(Keyboard::Key_ESC, 0, true, Esc);\n    \n    Logic logic(input);\n    Draw draw;\n\n    Util::standardLoop(logic, draw);\n    \n    Screen::realFinish();\n    return 0;\n}\n#ifdef USE_ALLEGRO\nEND_OF_MAIN()\n#endif\n<commit_msg>Add first gui element test.<commit_after>#include \"..\/common\/init.h\"\n#include \"..\/common\/timer.h\"\n\n#include \"util\/font.h\"\n#include \"util\/pointer.h\"\n#include \"util\/stretch-bitmap.h\"\n#include \"util\/input\/input.h\"\n#include \"util\/input\/input-manager.h\"\n\n#include \"util\/gui\/animation.h\"\n#include \"util\/gui\/box.h\"\n#include \"util\/gui\/container.h\"\n#include \"util\/gui\/context-box.h\"\n#include \"util\/gui\/coordinate.h\"\n#include \"util\/gui\/cutscene.h\"\n#include \"util\/gui\/fadetool.h\"\n#include \"util\/gui\/keys.h\"\n#include \"util\/gui\/keyinput.h\"\n#include \"util\/gui\/keyinput_manager.h\"\n#include \"util\/gui\/lineedit.h\"\n#include \"util\/gui\/rectarea.h\"\n#include \"util\/gui\/popup-box.h\"\n#include \"util\/gui\/scroll-list.h\"\n#include \"util\/gui\/select-list.h\"\n#include \"util\/gui\/tabbed-box.h\"\n#include \"util\/gui\/timer.h\"\n#include \"util\/gui\/widget.h\"\n\n#include <string>\n#include <vector>\n\nusing namespace std;\nusing namespace Gui;\n\nenum Keys{\n    Up=0,\n    Down,\n    Left,\n    Right,\n    Esc,\n    Enter,\n};\n\n\/*! Gui Component *\/\nclass GuiComponent : public ScrollItem{\npublic:\n    GuiComponent(const std::string & name):\n    name(name),\n    active(false){\n    }\n    virtual ~GuiComponent(){\n    }\n    \/\/ pure virtual funcs\n    virtual void up() = 0;\n    virtual void down() = 0;\n    virtual void right() = 0;\n    virtual void left() = 0;\n    virtual void actComponent() = 0;\n    virtual void drawComponent(const Graphics::Bitmap & where, const Font & font) = 0;\n    \n    void draw(int x, int y, const Graphics::Bitmap & where, const Font & font, int distance) const{\n        if (active){\n            font.printf(x, y, Graphics::makeColor(255, 0, 255), where, name, 0);\n        } else {\n            font.printf(x, y, Graphics::makeColor(255, 255, 255), where, name, 0);\n        }\n    }\n    int size(const Font & font) const{\n        return font.textLength(name.c_str());\n    }\n    void toggle(){\n        active = !active;\n    }\nprotected:\n    std::string name;\n    bool active;\n};\n\n\/*! Box Gui Component *\/\nclass TestBox : public GuiComponent {\npublic:\n    TestBox():\n    GuiComponent(\"Gui::Box\"),\n    size(Gui::RelativePoint(-.5, -.5), Gui::RelativePoint(.5, .5)){\n        box.colors.body = Graphics::makeColor(255, 255, 255);\n        box.colors.border = Graphics::makeColor(0, 0, 255);\n    }\n    void up(){\n        size.growVertical(.01);\n    }\n    void down(){\n        size.growVertical(-.01);\n    }\n    void right(){\n        size.growHorizontal(.01);\n    }\n    void left(){\n        size.growHorizontal(-.01);\n    }\n    void actComponent(){\n        box.location.growTo(size);\n    }\n    void drawComponent(const Graphics::Bitmap & where, const Font & font){\n        box.render(where);\n    }\nprotected:\n    Gui::Box box;\n    Gui::Coordinate size;\n};\n\n\/*! Gui Handler *\/\nclass GuiHandler {\npublic:\n    GuiHandler():\n    selected(false){\n        \/\/ Initialize components and store\n        components.push_back(new TestBox());\n        \n        \/\/ Set first as active\n        components[0].convert<GuiComponent>()->toggle();\n        \n        \/\/ Finally add component list to scroll list\n        list.addItems(components);\n    }\n    ~GuiHandler(){\n    }\n    \n    void up(){\n        if (!selected){\n            list.previous();\n        } else {\n            components[list.getCurrentIndex()].convert<GuiComponent>()->up();\n        }\n    }\n    void down(){\n        if (!selected){\n            list.next();\n        } else {\n            components[list.getCurrentIndex()].convert<GuiComponent>()->down();\n        }\n    }\n    void left(){\n        if (!selected){\n            list.previous();\n        } else {\n            components[list.getCurrentIndex()].convert<GuiComponent>()->left();\n        }\n    }\n    void right(){\n        if (!selected){\n            list.next();\n        } else {\n            components[list.getCurrentIndex()].convert<GuiComponent>()->right();\n        }\n    }\n    \n    void act(){\n        if (!selected){\n            list.act();\n        } else {\n            components[list.getCurrentIndex()].convert<GuiComponent>()->actComponent();\n        }\n    }\n    void draw(const Graphics::Bitmap & work, const Font & font){\n        if (!selected){\n            list.render(work, font);\n        } else {\n            components[list.getCurrentIndex()].convert<GuiComponent>()->drawComponent(work, font);\n        }\n    }\n    \n    void enter(){\n        if (!selected) {\n            selected = true;\n            components[list.getCurrentIndex()].convert<GuiComponent>()->toggle();\n        }\n    }\n    void esc(){\n        if (selected){\n            selected = false;\n            components[list.getCurrentIndex()].convert<GuiComponent>()->toggle();\n        }\n    }\n    \n    bool inComponent(){\n        return selected;\n    }\n    \nprotected:\n    bool selected;\n    std::vector<Util::ReferenceCount<Gui::ScrollItem> > components;\n    Gui::NormalList list;\n};\n\nclass Logic: public Util::Logic {\npublic:\n    Logic(InputMap<Keys> & input, GuiHandler & handler):\n    is_done(false),\n    input(input),\n    handler(handler){\n    }\n\n    bool is_done;\n    InputMap<Keys> & input;\n    GuiHandler & handler;\n    \n    bool done(){\n        return is_done;\n    }\n\n    void run(){\n        vector<InputMap<Keys>::InputEvent> out = InputManager::getEvents(input, InputSource());\n        for (vector<InputMap<Keys>::InputEvent>::iterator it = out.begin(); it != out.end(); it++){\n            const InputMap<Keys>::InputEvent & event = *it;\n            if (event.enabled){\n                if (event.out == Esc){\n                    if (!handler.inComponent()){\n                        is_done = true;\n                    } else {\n                        handler.esc();\n                    }\n                }\n                if (event.out == Up){\n                    handler.up();\n                }\n                if (event.out == Down){\n                    handler.down();\n                }\n                if (event.out == Left){\n                    handler.left();\n                }\n                if (event.out == Right){\n                    handler.right();\n                }\n                if (event.out == Enter){\n                    handler.enter();\n                }\n            }\n        }\n        \n        handler.act();\n    \n    }\n\n    double ticks(double system){\n        return system;\n    }\n};\n\nclass Draw: public Util::Draw {\npublic:\n    Draw(GuiHandler & handler):\n    handler(handler){\n    }\n    \n    GuiHandler & handler;\n\n    void draw(const Graphics::Bitmap & buffer){\n        \/\/buffer.putPixel(rand() % 640, rand() % 480, Graphics::makeColor(rand() % 255, rand() % 255, rand() % 255));\n        buffer.clear();\n        handler.draw(buffer, Font::getDefaultFont());\n        buffer.BlitToScreen();\n    }\n};\n\nint main(int argc, char ** argv){\n    Screen::realInit();\n    Common::startTimers();\n    \n    InputManager manager;\n    Graphics::Bitmap screen(Graphics::getScreenBuffer());\n    Util::Parameter<Graphics::Bitmap*> use(Graphics::screenParameter, &screen);\n    \n    InputMap<Keys> input;\n    input.set(Keyboard::Key_ESC, 0, true, Esc);\n    input.set(Keyboard::Key_ENTER, 0, true, Enter);\n    input.set(Keyboard::Key_UP, 0, true, Up);\n    input.set(Keyboard::Key_DOWN, 0, true, Down);\n    input.set(Keyboard::Key_LEFT, 0, true, Left);\n    input.set(Keyboard::Key_RIGHT, 0, true, Right);\n    \n    GuiHandler handler;\n    \n    Logic logic(input, handler);\n    Draw draw(handler);\n\n    Util::standardLoop(logic, draw);\n    \n    Screen::realFinish();\n    return 0;\n}\n#ifdef USE_ALLEGRO\nEND_OF_MAIN()\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Copyright 2020 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 \"src\/tools\/argparser.h\"\n#include \"src\/tools\/text-errors.h\"\n#include \"wasp\/base\/buffer.h\"\n#include \"wasp\/base\/errors.h\"\n#include \"wasp\/base\/features.h\"\n#include \"wasp\/base\/file.h\"\n#include \"wasp\/base\/format.h\"\n#include \"wasp\/base\/formatters.h\"\n#include \"wasp\/base\/span.h\"\n#include \"wasp\/base\/string_view.h\"\n#include \"wasp\/binary\/encoding.h\"\n#include \"wasp\/binary\/formatters.h\"\n#include \"wasp\/binary\/types.h\"\n#include \"wasp\/binary\/write.h\"\n#include \"wasp\/convert\/to_binary.h\"\n#include \"wasp\/text\/desugar.h\"\n#include \"wasp\/text\/read.h\"\n#include \"wasp\/text\/read\/context.h\"\n#include \"wasp\/text\/read\/tokenizer.h\"\n#include \"wasp\/text\/resolve.h\"\n#include \"wasp\/text\/types.h\"\n\nnamespace wasp {\nnamespace tools {\nnamespace wat2wasm {\n\nstruct Options {\n  Features features;\n  string_view output_filename;\n};\n\nstruct Tool {\n  explicit Tool(string_view filename, SpanU8 data, Options);\n\n  enum class PrintChars { No, Yes };\n\n  int Run();\n  void PrintMemory(SpanU8 data,\n                   Index offset,\n                   PrintChars print_chars = PrintChars::Yes,\n                   string_view prefix = \"\",\n                   int octets_per_line = 16,\n                   int octets_per_group = 2);\n\n  std::string filename;\n  Options options;\n  SpanU8 data;\n};\n\nint Main(span<string_view> args) {\n  string_view filename;\n  Options options;\n\n  ArgParser parser{\"wasp wat2wasm\"};\n  parser\n      .Add(\"--help\", \"print help and exit\",\n           [&]() { parser.PrintHelpAndExit(0); })\n      .Add('o', \"--output\", \"<filename>\", \"write DOT file output to <filename>\",\n           [&](string_view arg) { options.output_filename = arg; })\n      .AddFeatureFlags(options.features)\n      .Add(\"<filename>\", \"input wasm file\", [&](string_view arg) {\n        if (filename.empty()) {\n          filename = arg;\n        } else {\n          print(stderr, \"Filename already given\\n\");\n        }\n      });\n  parser.Parse(args);\n\n  if (filename.empty()) {\n    print(stderr, \"No filenames given.\\n\");\n    parser.PrintHelpAndExit(1);\n  }\n\n  auto optbuf = ReadFile(filename);\n  if (!optbuf) {\n    print(stderr, \"Error reading file {}.\\n\", filename);\n    return 1;\n  }\n\n  SpanU8 data{*optbuf};\n  Tool tool{filename, data, options};\n  return tool.Run();\n}\n\nTool::Tool(string_view filename, SpanU8 data, Options options)\n    : filename{filename}, options{options}, data{data} {}\n\nint Tool::Run() {\n  text::Tokenizer tokenizer{data};\n  tools::TextErrors errors{filename, data};\n  text::Context read_context{options.features, errors};\n  auto text_module = ReadModule(tokenizer, read_context);\n  Resolve(read_context, text_module);\n  Desugar(text_module);\n\n  if (errors.has_error()) {\n    errors.Print();\n    return 1;\n  }\n\n  convert::Context convert_context;\n  auto binary_module = convert::ToBinary(convert_context, text_module);\n\n  Buffer buffer;\n  Write(binary_module, std::back_inserter(buffer));\n  PrintMemory(buffer, 0);\n  return 0;\n}\n\nvoid Tool::PrintMemory(SpanU8 start,\n                       Index offset,\n                       PrintChars print_chars,\n                       string_view prefix,\n                       int octets_per_line,\n                       int octets_per_group) {\n  SpanU8 data = start;\n  while (!data.empty()) {\n    auto line_size = std::min<size_t>(data.size(), octets_per_line);\n    const SpanU8 line = data.subspan(0, line_size);\n    print(\"{}\", prefix);\n    print(\"{:08x}: \", (line.begin() - start.begin()) + offset);\n    for (int i = 0; i < octets_per_line;) {\n      for (int j = 0; j < octets_per_group; ++j, ++i) {\n        if (i < line.size()) {\n          print(\"{:02x}\", line[i]);\n        } else {\n          print(\"  \");\n        }\n      }\n      print(\" \");\n    }\n\n    if (print_chars == PrintChars::Yes) {\n      print(\" \");\n      for (int c : line) {\n        print(\"{:c}\", isprint(c) ? static_cast<char>(c) : '.');\n      }\n    }\n    print(\"\\n\");\n    remove_prefix(&data, line_size);\n  }\n}\n\n}  \/\/ namespace wat2wasm\n}  \/\/ namespace tools\n}  \/\/ namespace wasp\n<commit_msg>Write wat2wasm output to file<commit_after>\/\/\n\/\/ Copyright 2020 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 <filesystem>\n#include <fstream>\n\n#include \"src\/tools\/argparser.h\"\n#include \"src\/tools\/text-errors.h\"\n#include \"wasp\/base\/buffer.h\"\n#include \"wasp\/base\/errors.h\"\n#include \"wasp\/base\/features.h\"\n#include \"wasp\/base\/file.h\"\n#include \"wasp\/base\/format.h\"\n#include \"wasp\/base\/formatters.h\"\n#include \"wasp\/base\/span.h\"\n#include \"wasp\/base\/string_view.h\"\n#include \"wasp\/binary\/encoding.h\"\n#include \"wasp\/binary\/formatters.h\"\n#include \"wasp\/binary\/types.h\"\n#include \"wasp\/binary\/write.h\"\n#include \"wasp\/convert\/to_binary.h\"\n#include \"wasp\/text\/desugar.h\"\n#include \"wasp\/text\/read.h\"\n#include \"wasp\/text\/read\/context.h\"\n#include \"wasp\/text\/read\/tokenizer.h\"\n#include \"wasp\/text\/resolve.h\"\n#include \"wasp\/text\/types.h\"\n\nnamespace fs = std::filesystem;\n\nnamespace wasp {\nnamespace tools {\nnamespace wat2wasm {\n\nstruct Options {\n  Features features;\n  std::string output_filename;\n};\n\nstruct Tool {\n  explicit Tool(string_view filename, SpanU8 data, Options);\n\n  enum class PrintChars { No, Yes };\n\n  int Run();\n\n  std::string filename;\n  Options options;\n  SpanU8 data;\n};\n\nint Main(span<string_view> args) {\n  string_view filename;\n  Options options;\n\n  ArgParser parser{\"wasp wat2wasm\"};\n  parser\n      .Add(\"--help\", \"print help and exit\",\n           [&]() { parser.PrintHelpAndExit(0); })\n      .Add('o', \"--output\", \"<filename>\", \"write DOT file output to <filename>\",\n           [&](string_view arg) { options.output_filename = arg; })\n      .AddFeatureFlags(options.features)\n      .Add(\"<filename>\", \"input wasm file\", [&](string_view arg) {\n        if (filename.empty()) {\n          filename = arg;\n        } else {\n          print(stderr, \"Filename already given\\n\");\n        }\n      });\n  parser.Parse(args);\n\n  if (filename.empty()) {\n    print(stderr, \"No filenames given.\\n\");\n    parser.PrintHelpAndExit(1);\n  }\n\n  auto optbuf = ReadFile(filename);\n  if (!optbuf) {\n    print(stderr, \"Error reading file {}.\\n\", filename);\n    return 1;\n  }\n\n  if (options.output_filename.empty()) {\n    \/\/ Create an output filename from the input filename.\n    options.output_filename =\n        fs::path(filename).replace_extension(\".wasm\").string();\n  }\n\n  SpanU8 data{*optbuf};\n  Tool tool{filename, data, options};\n  return tool.Run();\n}\n\nTool::Tool(string_view filename, SpanU8 data, Options options)\n    : filename{filename}, options{options}, data{data} {}\n\nint Tool::Run() {\n  text::Tokenizer tokenizer{data};\n  tools::TextErrors errors{filename, data};\n  text::Context read_context{options.features, errors};\n  auto text_module = ReadModule(tokenizer, read_context);\n  Resolve(read_context, text_module);\n  Desugar(text_module);\n\n  if (errors.has_error()) {\n    errors.Print();\n    return 1;\n  }\n\n  convert::Context convert_context;\n  auto binary_module = convert::ToBinary(convert_context, text_module);\n\n  Buffer buffer;\n  Write(binary_module, std::back_inserter(buffer));\n\n  std::ofstream fstream(options.output_filename,\n                        std::ios_base::out | std::ios_base::binary);\n  if (!fstream) {\n    print(stderr, \"Unable to open file {}.\\n\", options.output_filename);\n    return 1;\n  }\n\n  auto span = ToStringView(buffer);\n  fstream.write(span.data(), span.size());\n  return 0;\n}\n\n}  \/\/ namespace wat2wasm\n}  \/\/ namespace tools\n}  \/\/ namespace wasp\n<|endoftext|>"}
{"text":"<commit_before>#include <ros\/console.h>\n#include <string>\n\n#include <tr_hub_parser\/RangeArray.h>\n#include <tr_hub_parser\/tr_hub_parser.h>\n\nnamespace tr_hub_parser {\n\nTr_hub_parser::Tr_hub_parser() {\n  \/\/ Get paramters\n  ros::NodeHandle private_node_handle_(\"~\");\n  private_node_handle_.param(\"portname\", portname_,\n                             std::string(\"\/dev\/ttyACM0\"));\n  \/\/Initialize local parameters and measurement array\n  field_of_view = 0.0593;\n  max_range = 14.0;\n  min_range = 0.2;\n  number_of_sensor = 8;\n  frame_id = \"base_range_\";\n\n  for (size_t i=0; i < number_of_sensor; i++) {\n   sensor_msgs::Range range;\n   range.field_of_view = field_of_view;\n   range.max_range = max_range;\n   range.min_range = min_range;\n   range.radiation_type = sensor_msgs::Range::INFRARED;\n   range.range = 0.0;\n   range.header.frame_id =\n       ros::names::append(ns_, frame_id + boost::lexical_cast<std::string>(i));\n\n   measure.ranges.push_back(range);\n  }\n\n  \/\/ Publishers\n  range_publisher_ = nh_.advertise<tr_hub_parser::RangeArray>(\"tr_hub_parser\", 8);\n\n  \/\/ Create serial port\n  serial_port_ = new SerialPort();\n\n  \/\/ Set callback function for the serial ports\n  serial_data_callback_function_ =\n      boost::bind(&Tr_hub_parser::serialDataCallback, this, _1);\n  serial_port_->setSerialCallbackFunction(&serial_data_callback_function_);\n\n  \/\/ Connect serial port\n  if (!serial_port_->connect(portname_)) {\n    ros::shutdown();\n    return;\n  }\n  else {\n    ROS_ERROR(\"Could not open : %s \", portname_.c_str());\n  }\n\n  \/\/ Output loaded parameters to console for double checking\n  ROS_INFO(\"[%s] is up and running with the following parameters:\",\n           ros::this_node::getName().c_str());\n  ROS_INFO(\"[%s] portname: %s\", ros::this_node::getName().c_str(),\n           portname_.c_str());\n\n  ns_ = ros::this_node::getNamespace();\n  ns_ = ros::names::clean(ns_);\n  std::string str = ns_.c_str();\n  ROS_INFO(\"node namespace: [%s]\", ns_.c_str());\n\n  \/\/ Set operation Mode\n  setMode(BINARY_MODE);\n\n  \/\/ Force using 8 sensors\n  \/\/ setMode(FORCE_8_SENSORS);\n\n  \/\/ Dynamic reconfigure\n  dyn_param_server_callback_function_ =\n      boost::bind(&Tr_hub_parser::dynParamCallback, this, _1, _2);\n  dyn_param_server_.setCallback(dyn_param_server_callback_function_);\n}\n\nTr_hub_parser::~Tr_hub_parser() {}\n\nuint8_t crc8(uint8_t *p, uint8_t len) {\n  uint16_t i;\n  uint16_t crc = 0x0;\n\n  while (len--) {\n    i = (crc ^ *p++) & 0xFF;\n    crc = (crc_table[i] ^ (crc << 8)) & 0xFF;\n  }\n  return crc & 0xFF;\n}\n\nfloat two_chars_to_float(uint8_t c1, uint8_t c2){\n  int16_t current_range = c1 << 8;\n  current_range |= c2;\n\n  float res = (float)current_range * 0.001;\n  return res;\n}\n\nvoid Tr_hub_parser::serialDataCallback(uint8_t single_character) {\n  static uint8_t input_buffer[BUFFER_SIZE];\n  static int buffer_ctr = 0;\n  static int seq_ctr = 0;\n\n  if (single_character != 'T' && buffer_ctr < 19) {\n    \/\/ not the beginning of serial feed so add char to buffer\n    input_buffer[buffer_ctr++] = single_character;\n    return;\n  }\n  else if (single_character == 'T') {\n    \/\/ROS_INFO(\"%s\\n\", reinterpret_cast<const char*>(single_character));\n\n    if (buffer_ctr == 19) {\n      \/\/ end of feed, calculate\n      int16_t crc = crc8(input_buffer, 18);\n\n      if (crc == input_buffer[18]) {\n        ROS_DEBUG(\"Frame: %s \", input_buffer);\n\n        for (size_t i=0; i < measure.ranges.size(); i++) {\n          measure.ranges.at(i).header.stamp = ros::Time::now();\n          measure.ranges.at(i).header.seq = seq_ctr++;\n\n          \/\/ Doesn't go out of range because of fixed buffer size as long as the number of sensor is not above 8\n          float float_range = two_chars_to_float(input_buffer[2 * (i + 1)],input_buffer[2 * (i + 1) + 1]);\n\n          if (float_range < min_range) {\n            float_range = min_range;\n          } else if (float_range > max_range) {\n            float_range = max_range;\n          }\n          measure.ranges.at(i).range = float_range;\n        }\n        range_publisher_.publish(measure);\n\n      } else {\n        ROS_DEBUG(\"[%s] crc missmatch\", ros::this_node::getName().c_str());\n      }\n    } else {\n      ROS_DEBUG(\"[%s] received T but did not expect it, reset buffer without \"\n                \"evaluating data\",\n                ros::this_node::getName().c_str());\n    }\n  } else {\n    ROS_DEBUG(\"[%s] buffer_overflowed without receiving T, reset input_buffer\",\n              ros::this_node::getName().c_str());\n  }\n\n  \/\/ reset\n  buffer_ctr = 0;\n\n  \/\/ clear struct\n  bzero(&input_buffer, BUFFER_SIZE);\n\n  \/\/ store T\n  input_buffer[buffer_ctr++] = 'T';\n}\n\nvoid Tr_hub_parser::setMode(const char *c) { serial_port_->sendChar(c); }\n\nvoid Tr_hub_parser::dynParamCallback(\n    const tr_hub_parser::Tr_hub_parserConfig &config, uint32_t level) {\n  if (config.Mode == tr_hub_parser::Tr_hub_parser_Fast) {\n    setMode(FAST_MODE);\n  }\n\n  if (config.Mode == tr_hub_parser::Tr_hub_parser_Precise) {\n    setMode(PRECISE_MODE);\n  }\n\n  if (config.Mode == tr_hub_parser::Tr_hub_parser_Outdoor) {\n    setMode(OUTDOOR_MODE);\n  }\n}\n}\n\nint main(int argc, char **argv) {\n  ros::init(argc, argv, \"tr_hub_parser_node\");\n  tr_hub_parser::Tr_hub_parser tr_hub_parser_node;\n  ros::spin();\n\n  return 0;\n}\n<commit_msg>Assign -1.0f to  0xFF:FF value from sensor<commit_after>#include <ros\/console.h>\n#include <string>\n\n#include <tr_hub_parser\/RangeArray.h>\n#include <tr_hub_parser\/tr_hub_parser.h>\n\nnamespace tr_hub_parser {\n\nTr_hub_parser::Tr_hub_parser() {\n  \/\/ Get paramters\n  ros::NodeHandle private_node_handle_(\"~\");\n  private_node_handle_.param(\"portname\", portname_,\n                             std::string(\"\/dev\/ttyACM0\"));\n  \/\/Initialize local parameters and measurement array\n  field_of_view = 0.0593;\n  max_range = 14.0;\n  min_range = 0.2;\n  number_of_sensor = 8;\n  frame_id = \"base_range_\";\n\n  for (size_t i=0; i < number_of_sensor; i++) {\n   sensor_msgs::Range range;\n   range.field_of_view = field_of_view;\n   range.max_range = max_range;\n   range.min_range = min_range;\n   range.radiation_type = sensor_msgs::Range::INFRARED;\n   range.range = 0.0;\n   range.header.frame_id =\n       ros::names::append(ns_, frame_id + boost::lexical_cast<std::string>(i));\n\n   measure.ranges.push_back(range);\n  }\n\n  \/\/ Publishers\n  range_publisher_ = nh_.advertise<tr_hub_parser::RangeArray>(\"tr_hub_parser\", 8);\n\n  \/\/ Create serial port\n  serial_port_ = new SerialPort();\n\n  \/\/ Set callback function for the serial ports\n  serial_data_callback_function_ =\n      boost::bind(&Tr_hub_parser::serialDataCallback, this, _1);\n  serial_port_->setSerialCallbackFunction(&serial_data_callback_function_);\n\n  \/\/ Connect serial port\n  if (!serial_port_->connect(portname_)) {\n    ros::shutdown();\n    return;\n  }\n  else {\n    ROS_ERROR(\"Could not open : %s \", portname_.c_str());\n  }\n\n  \/\/ Output loaded parameters to console for double checking\n  ROS_INFO(\"[%s] is up and running with the following parameters:\",\n           ros::this_node::getName().c_str());\n  ROS_INFO(\"[%s] portname: %s\", ros::this_node::getName().c_str(),\n           portname_.c_str());\n\n  ns_ = ros::this_node::getNamespace();\n  ns_ = ros::names::clean(ns_);\n  std::string str = ns_.c_str();\n  ROS_INFO(\"node namespace: [%s]\", ns_.c_str());\n\n  \/\/ Set operation Mode\n  setMode(BINARY_MODE);\n\n  \/\/ Force using 8 sensors\n  \/\/ setMode(FORCE_8_SENSORS);\n\n  \/\/ Dynamic reconfigure\n  dyn_param_server_callback_function_ =\n      boost::bind(&Tr_hub_parser::dynParamCallback, this, _1, _2);\n  dyn_param_server_.setCallback(dyn_param_server_callback_function_);\n}\n\nTr_hub_parser::~Tr_hub_parser() {}\n\nuint8_t crc8(uint8_t *p, uint8_t len) {\n  uint16_t i;\n  uint16_t crc = 0x0;\n\n  while (len--) {\n    i = (crc ^ *p++) & 0xFF;\n    crc = (crc_table[i] ^ (crc << 8)) & 0xFF;\n  }\n  return crc & 0xFF;\n}\n\nfloat two_chars_to_float(uint8_t c1, uint8_t c2){\n  int16_t current_range = c1 << 8;\n  current_range |= c2;\n\n  float res = (float)current_range;\n  return res;\n}\n\nvoid Tr_hub_parser::serialDataCallback(uint8_t single_character) {\n  static uint8_t input_buffer[BUFFER_SIZE];\n  static int buffer_ctr = 0;\n  static int seq_ctr = 0;\n\n  if (single_character != 'T' && buffer_ctr < 19) {\n    \/\/ not the beginning of serial feed so add char to buffer\n    input_buffer[buffer_ctr++] = single_character;\n    return;\n  }\n  else if (single_character == 'T') {\n    \/\/ROS_INFO(\"%s\\n\", reinterpret_cast<const char*>(single_character));\n\n    if (buffer_ctr == 19) {\n      \/\/ end of feed, calculate\n      int16_t crc = crc8(input_buffer, 18);\n\n      if (crc == input_buffer[18]) {\n        ROS_DEBUG(\"Frame: %s \", input_buffer);\n\n        for (size_t i=0; i < measure.ranges.size(); i++) {\n          measure.ranges.at(i).header.stamp = ros::Time::now();\n          measure.ranges.at(i).header.seq = seq_ctr++;\n\n          \/\/ Doesn't go out of range because of fixed buffer size as long as the number of sensor is not above 8\n          float float_range = two_chars_to_float(input_buffer[2 * (i + 1)],input_buffer[2 * (i + 1) + 1]);\n\n          if ((float_range * 0.001 < min_range) && (float_range > 0)) { \/\/check for hardware cut-off\n            float_range = min_range;\n          } else if (float_range * 0.001 > max_range) { \/\/software cut-off should be adapted to sensor\n            float_range = -1.0;\n          } else {\n            float_range = float_range * 0.001\n          }\n          measure.ranges.at(i).range = float_range;\n        }\n        range_publisher_.publish(measure);\n\n      } else {\n        ROS_DEBUG(\"[%s] crc missmatch\", ros::this_node::getName().c_str());\n      }\n    } else {\n      ROS_DEBUG(\"[%s] received T but did not expect it, reset buffer without \"\n                \"evaluating data\",\n                ros::this_node::getName().c_str());\n    }\n  } else {\n    ROS_DEBUG(\"[%s] buffer_overflowed without receiving T, reset input_buffer\",\n              ros::this_node::getName().c_str());\n  }\n\n  \/\/ reset\n  buffer_ctr = 0;\n\n  \/\/ clear struct\n  bzero(&input_buffer, BUFFER_SIZE);\n\n  \/\/ store T\n  input_buffer[buffer_ctr++] = 'T';\n}\n\nvoid Tr_hub_parser::setMode(const char *c) { serial_port_->sendChar(c); }\n\nvoid Tr_hub_parser::dynParamCallback(\n    const tr_hub_parser::Tr_hub_parserConfig &config, uint32_t level) {\n  if (config.Mode == tr_hub_parser::Tr_hub_parser_Fast) {\n    setMode(FAST_MODE);\n  }\n\n  if (config.Mode == tr_hub_parser::Tr_hub_parser_Precise) {\n    setMode(PRECISE_MODE);\n  }\n\n  if (config.Mode == tr_hub_parser::Tr_hub_parser_Outdoor) {\n    setMode(OUTDOOR_MODE);\n  }\n}\n}\n\nint main(int argc, char **argv) {\n  ros::init(argc, argv, \"tr_hub_parser_node\");\n  tr_hub_parser::Tr_hub_parser tr_hub_parser_node;\n  ros::spin();\n\n  return 0;\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\/\/ implementation wrapers for all the bza_ API functions\n#include \"bzfsAPI.h\"\n\n#include \"common.h\"\n#include \"bzfs.h\"\n#include \"WorldWeapons.h\"\n#include \"bzfsEvents.h\"\n#include \"WorldEventManager.h\"\n#include \"GameKeeper.h\"\n#include \"FlagInfo.h\"\n\n#include \"commands.h\"\n#include \"SpawnPosition.h\"\n\n#define BZ_API_VERSION\t1\n\nextern void sendMessage(int playerIndex, PlayerId dstPlayer, const char *message);\nextern void removePlayer(int playerIndex, const char *reason, bool notify);\nextern CmdLineOptions *clOptions;\n\n\n\/\/ versioning\nBZF_API int bz_APIVersion ( void )\n{\n\treturn BZ_API_VERSION;\n}\n\nBZF_API bool bz_registerEvent ( bz_teEventType eventType, int team, bz_EventHandaler* eventHandaler )\n{\n\tif (!eventHandaler)\n\t\treturn false;\n\t\n\tworldEventManager.addEvent((teEventType)eventType,team,(BaseEventHandaler*)eventHandaler);\n\treturn true;\n}\n\nBZF_API bool bz_updatePlayerData ( bz_PlayerRecord *playerRecord )\n{\n\tif (!playerRecord)\n\t\treturn false;\n\n\tGameKeeper::Player *player = GameKeeper::Player::getPlayerByIndex(playerRecord->playerID);\n\tif (!player)\n\t\treturn false;\n\n\tmemcpy(playerRecord->pos,player->lastState->pos,sizeof(float)*3);\n\n\tplayerRecord->rot = player->lastState->azimuth;\n\n\tint flagid = player->player.getFlag();\n\tFlagInfo *flagInfo = FlagInfo::get(flagid);\n\n\tplayerRecord->currentFlag = flagInfo->flag.type->label();\n\n\tstd::vector<FlagType*>\tflagHistoryList = player->flagHistory.get();\n\n\tplayerRecord->flagHistory.clear();\n\tfor ( unsigned int i = 0; i < flagHistoryList.size(); i ++)\n\t\tplayerRecord->flagHistory.push_back(flagHistoryList[i]->label());\n\n\tplayerRecord->groups.clear();\n\tplayerRecord->groups = player->accessInfo.groups;\n\n\tplayerRecord->admin = player->accessInfo.isVerified();\n\treturn true;\n}\n\nBZF_API bool bz_getPlayerByIndex ( int index, bz_PlayerRecord *playerRecord )\n{\n\tGameKeeper::Player *player = GameKeeper::Player::getPlayerByIndex(index);\n\n\tif (!player || !playerRecord)\n\t\treturn false;\n\n\tplayerRecord->callsign = player->player.getCallSign();\n\tplayerRecord->playerID = index;\n\tplayerRecord->team = player->player.getTeam();\n\n\tplayerRecord->spawned = player->player.isAlive();\n\tplayerRecord->verified = player->accessInfo.isVerified();\n\tplayerRecord->globalUser = player->authentication.isGlobal();\n\n\tplayerRecord->ipAddress = player->netHandler->getTargetIP();\n\tplayerRecord->update();\n\treturn true;\n}\n\nBZF_API bool bz_sendTextMessage(int from, int to, const char* message)\n{\n\tif (!message)\n\t\treturn false;\n\n\tint playerIndex;\n\tPlayerId dstPlayer;\n\n\tif (to == BZ_ALL_USERS)\n\t\tdstPlayer = AllPlayers;\n\telse\n\t\tdstPlayer = (PlayerId)to;\n\n\tif (from == BZ_SERVER)\n\t\tplayerIndex = ServerPlayer;\n\telse\n\t\tplayerIndex = from;\n\n\tsendMessage(playerIndex, dstPlayer, message);\n\treturn true;\n}\n\nBZF_API bool bz_fireWorldWep ( std::string flagType, float lifetime, int fromPlayer, float *pos, float tilt, float direction, int shotID, float dt )\n{\n\tif (!pos || !flagType.size())\n\t\treturn false;\n\n\tFlagTypeMap &flagMap = FlagType::getFlagMap();\n\tif (flagMap.find(flagType) == flagMap.end())\n\t\treturn false;\n\n\tFlagType *flag = flagMap.find(flagType)->second;\n\n\tPlayerId player;\n\tif ( fromPlayer == BZ_SERVER )\n\t\tplayer = ServerPlayer;\n\telse\n\t\tplayer = fromPlayer;\n\n\treturn fireWorldWep(flag,lifetime,player,pos,tilt,direction,shotID,dt) == shotID;\n}\n\n\/\/ time API\nBZF_API double bz_getCurrentTime ( void )\n{\n\treturn TimeKeeper::getCurrent().getSeconds();\n}\n\n\/\/ info\nBZF_API double bz_getBZDBDouble ( const char* variable )\n{\n\tif (!variable)\n\t\treturn 0.0;\n\n\treturn BZDB.eval(std::string(variable));\n}\n\n\/\/ loging\nBZF_API void bz_debugMessage ( int _debugLevel, const char* message )\n{\n\tif (!message)\n\t\treturn;\n\n\tif (debugLevel >= _debugLevel)\n\t\tformatDebug(\"%s\\n\",message);\n}\n\n\/\/ admin\nBZF_API bool bz_kickUser ( int playerIndex, const char* reason, bool notify )\n{\n\tGameKeeper::Player *player = GameKeeper::Player::getPlayerByIndex(playerIndex);\n\tif (!player || !reason)\n\t\treturn false;\n\n\tremovePlayer(playerIndex,reason,notify);\n\treturn true;\n}\n\nBZF_API bool bz_IPBanUser ( int playerIndex, const char* ip, int time, const char* reason )\n{\n\tGameKeeper::Player *player = GameKeeper::Player::getPlayerByIndex(playerIndex);\n\tif (!player || !reason || !ip)\n\t\treturn false;\n\n\t\/\/ reload the banlist in case anyone else has added\n\tclOptions->acl.load();\n\n\tif (clOptions->acl.ban(ip, player->player.getCallSign(), time,reason))\n\t\tclOptions->acl.save();\n\telse\n\t\treturn false;\n\n\treturn true;\n}\n\nBZF_API bool bz_registerCustomSlashCommand ( const char* command, bz_CustomSlashCommandHandaler *handaler )\n{\n\tif (!command || !handaler)\n\t\treturn false;\n\n\tregisterCustomSlashCommand(std::string(command),(CustomSlashCommandHandaler*)handaler);\n\treturn true;\n}\n\nBZF_API bool bz_removeCustomSlashCommand ( const char* command )\n{\n\tif (!command)\n\t\treturn false;\n\n\tremoveCustomSlashCommand(std::string(command));\n\treturn true;\n}\n\nBZF_API bool bz_getStandardSpawn ( int playeID, float pos[3], float *rot )\n{\n\tGameKeeper::Player *player = GameKeeper::Player::getPlayerByIndex(playeID);\n\tif (!player)\n\t\treturn false;\n\n\t\/\/ get the spawn position\n\tSpawnPosition* spawnPosition = new SpawnPosition(playeID,\n\t\t(!clOptions->respawnOnBuildings) || (player->player.isBot()),\n\t\tclOptions->gameStyle & TeamFlagGameStyle);\n\n\tpos[0] = spawnPosition->getX();\n\tpos[1] = spawnPosition->getY();\n\tpos[2] = spawnPosition->getZ();\n\tif (rot)\n\t\t*rot = spawnPosition->getAzimuth();\n\n\treturn true;\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>remove reference to removed header<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\/\/ implementation wrapers for all the bza_ API functions\n#include \"bzfsAPI.h\"\n\n#include \"common.h\"\n#include \"bzfs.h\"\n#include \"WorldWeapons.h\"\n#include \"WorldEventManager.h\"\n#include \"GameKeeper.h\"\n#include \"FlagInfo.h\"\n\n#include \"commands.h\"\n#include \"SpawnPosition.h\"\n\n#define BZ_API_VERSION\t1\n\nextern void sendMessage(int playerIndex, PlayerId dstPlayer, const char *message);\nextern void removePlayer(int playerIndex, const char *reason, bool notify);\nextern CmdLineOptions *clOptions;\n\n\n\/\/ versioning\nBZF_API int bz_APIVersion ( void )\n{\n\treturn BZ_API_VERSION;\n}\n\nBZF_API bool bz_registerEvent ( bz_teEventType eventType, int team, bz_EventHandaler* eventHandaler )\n{\n\tif (!eventHandaler)\n\t\treturn false;\n\t\n\tworldEventManager.addEvent((teEventType)eventType,team,(BaseEventHandaler*)eventHandaler);\n\treturn true;\n}\n\nBZF_API bool bz_updatePlayerData ( bz_PlayerRecord *playerRecord )\n{\n\tif (!playerRecord)\n\t\treturn false;\n\n\tGameKeeper::Player *player = GameKeeper::Player::getPlayerByIndex(playerRecord->playerID);\n\tif (!player)\n\t\treturn false;\n\n\tmemcpy(playerRecord->pos,player->lastState->pos,sizeof(float)*3);\n\n\tplayerRecord->rot = player->lastState->azimuth;\n\n\tint flagid = player->player.getFlag();\n\tFlagInfo *flagInfo = FlagInfo::get(flagid);\n\n\tplayerRecord->currentFlag = flagInfo->flag.type->label();\n\n\tstd::vector<FlagType*>\tflagHistoryList = player->flagHistory.get();\n\n\tplayerRecord->flagHistory.clear();\n\tfor ( unsigned int i = 0; i < flagHistoryList.size(); i ++)\n\t\tplayerRecord->flagHistory.push_back(flagHistoryList[i]->label());\n\n\tplayerRecord->groups.clear();\n\tplayerRecord->groups = player->accessInfo.groups;\n\n\tplayerRecord->admin = player->accessInfo.isVerified();\n\treturn true;\n}\n\nBZF_API bool bz_getPlayerByIndex ( int index, bz_PlayerRecord *playerRecord )\n{\n\tGameKeeper::Player *player = GameKeeper::Player::getPlayerByIndex(index);\n\n\tif (!player || !playerRecord)\n\t\treturn false;\n\n\tplayerRecord->callsign = player->player.getCallSign();\n\tplayerRecord->playerID = index;\n\tplayerRecord->team = player->player.getTeam();\n\n\tplayerRecord->spawned = player->player.isAlive();\n\tplayerRecord->verified = player->accessInfo.isVerified();\n\tplayerRecord->globalUser = player->authentication.isGlobal();\n\n\tplayerRecord->ipAddress = player->netHandler->getTargetIP();\n\tplayerRecord->update();\n\treturn true;\n}\n\nBZF_API bool bz_sendTextMessage(int from, int to, const char* message)\n{\n\tif (!message)\n\t\treturn false;\n\n\tint playerIndex;\n\tPlayerId dstPlayer;\n\n\tif (to == BZ_ALL_USERS)\n\t\tdstPlayer = AllPlayers;\n\telse\n\t\tdstPlayer = (PlayerId)to;\n\n\tif (from == BZ_SERVER)\n\t\tplayerIndex = ServerPlayer;\n\telse\n\t\tplayerIndex = from;\n\n\tsendMessage(playerIndex, dstPlayer, message);\n\treturn true;\n}\n\nBZF_API bool bz_fireWorldWep ( std::string flagType, float lifetime, int fromPlayer, float *pos, float tilt, float direction, int shotID, float dt )\n{\n\tif (!pos || !flagType.size())\n\t\treturn false;\n\n\tFlagTypeMap &flagMap = FlagType::getFlagMap();\n\tif (flagMap.find(flagType) == flagMap.end())\n\t\treturn false;\n\n\tFlagType *flag = flagMap.find(flagType)->second;\n\n\tPlayerId player;\n\tif ( fromPlayer == BZ_SERVER )\n\t\tplayer = ServerPlayer;\n\telse\n\t\tplayer = fromPlayer;\n\n\treturn fireWorldWep(flag,lifetime,player,pos,tilt,direction,shotID,dt) == shotID;\n}\n\n\/\/ time API\nBZF_API double bz_getCurrentTime ( void )\n{\n\treturn TimeKeeper::getCurrent().getSeconds();\n}\n\n\/\/ info\nBZF_API double bz_getBZDBDouble ( const char* variable )\n{\n\tif (!variable)\n\t\treturn 0.0;\n\n\treturn BZDB.eval(std::string(variable));\n}\n\n\/\/ loging\nBZF_API void bz_debugMessage ( int _debugLevel, const char* message )\n{\n\tif (!message)\n\t\treturn;\n\n\tif (debugLevel >= _debugLevel)\n\t\tformatDebug(\"%s\\n\",message);\n}\n\n\/\/ admin\nBZF_API bool bz_kickUser ( int playerIndex, const char* reason, bool notify )\n{\n\tGameKeeper::Player *player = GameKeeper::Player::getPlayerByIndex(playerIndex);\n\tif (!player || !reason)\n\t\treturn false;\n\n\tremovePlayer(playerIndex,reason,notify);\n\treturn true;\n}\n\nBZF_API bool bz_IPBanUser ( int playerIndex, const char* ip, int time, const char* reason )\n{\n\tGameKeeper::Player *player = GameKeeper::Player::getPlayerByIndex(playerIndex);\n\tif (!player || !reason || !ip)\n\t\treturn false;\n\n\t\/\/ reload the banlist in case anyone else has added\n\tclOptions->acl.load();\n\n\tif (clOptions->acl.ban(ip, player->player.getCallSign(), time,reason))\n\t\tclOptions->acl.save();\n\telse\n\t\treturn false;\n\n\treturn true;\n}\n\nBZF_API bool bz_registerCustomSlashCommand ( const char* command, bz_CustomSlashCommandHandaler *handaler )\n{\n\tif (!command || !handaler)\n\t\treturn false;\n\n\tregisterCustomSlashCommand(std::string(command),(CustomSlashCommandHandaler*)handaler);\n\treturn true;\n}\n\nBZF_API bool bz_removeCustomSlashCommand ( const char* command )\n{\n\tif (!command)\n\t\treturn false;\n\n\tremoveCustomSlashCommand(std::string(command));\n\treturn true;\n}\n\nBZF_API bool bz_getStandardSpawn ( int playeID, float pos[3], float *rot )\n{\n\tGameKeeper::Player *player = GameKeeper::Player::getPlayerByIndex(playeID);\n\tif (!player)\n\t\treturn false;\n\n\t\/\/ get the spawn position\n\tSpawnPosition* spawnPosition = new SpawnPosition(playeID,\n\t\t(!clOptions->respawnOnBuildings) || (player->player.isBot()),\n\t\tclOptions->gameStyle & TeamFlagGameStyle);\n\n\tpos[0] = spawnPosition->getX();\n\tpos[1] = spawnPosition->getY();\n\tpos[2] = spawnPosition->getZ();\n\tif (rot)\n\t\t*rot = spawnPosition->getAzimuth();\n\n\treturn true;\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>\/\/ Copyright 2013 Yangqing Jia\n\n#include <cstdio>\n#include <ctime>\n\n#include \"caffe\/common.hpp\"\n\nnamespace caffe {\n\nshared_ptr<Caffe> Caffe::singleton_;\n\ninline bool StillFresh() {\n  struct tm fresh_time;\n  fresh_time.tm_year = 200;\n  fresh_time.tm_mon = 1;\n  fresh_time.tm_mday = 1;\n  fresh_time.tm_hour = 0;\n  fresh_time.tm_min = 0;\n  fresh_time.tm_sec = 0;\n  return (difftime(time(NULL), mktime(&fresh_time)) < 0);\n}\n\nCaffe::Caffe()\n    : mode_(Caffe::CPU), phase_(Caffe::TRAIN), cublas_handle_(NULL),\n      curand_generator_(NULL), vsl_stream_(NULL) {\n  \/\/ A simple way to set an expire time - not for coding geeks, but meh.\n  \/\/ It simply works by skipping creating the streams.\n  if (!StillFresh()) {\n    return;\n  }\n  \/\/ Try to create a cublas handler, and report an error if failed (but we will\n  \/\/ keep the program running as one might just want to run CPU code).\n  if (cublasCreate(&cublas_handle_) != CUBLAS_STATUS_SUCCESS) {\n    LOG(ERROR) << \"Cannot create Cublas handle. Cublas won't be available.\";\n  }\n  \/\/ Try to create a curand handler.\n  if (curandCreateGenerator(&curand_generator_, CURAND_RNG_PSEUDO_DEFAULT)\n      != CURAND_STATUS_SUCCESS ||\n      curandSetPseudoRandomGeneratorSeed(curand_generator_, 1701ULL)\n      != CURAND_STATUS_SUCCESS) {\n    LOG(ERROR) << \"Cannot create Curand generator. Curand won't be available.\";\n  }\n  \/\/ Try to create a vsl stream. This should almost always work, but we will\n  \/\/ check it anyway.\n  if (vslNewStream(&vsl_stream_, VSL_BRNG_MT19937, 1701) != VSL_STATUS_OK) {\n    LOG(ERROR) << \"Cannot create vsl stream. VSL random number generator \"\n        << \"won't be available.\";\n  }\n}\n\nCaffe::~Caffe() {\n  if (!cublas_handle_) CUBLAS_CHECK(cublasDestroy(cublas_handle_));\n  if (!curand_generator_) {\n    CURAND_CHECK(curandDestroyGenerator(curand_generator_));\n  }\n  if (!vsl_stream_) VSL_CHECK(vslDeleteStream(&vsl_stream_));\n};\n\nvoid Caffe::set_random_seed(const unsigned int seed) {\n  \/\/ Curand seed\n  \/\/ Yangqing's note: simply setting the generator seed does not seem to\n  \/\/ work on the tesla K20s, so I wrote the ugly reset thing below.\n  if (Get().curand_generator_) {\n    CURAND_CHECK(curandDestroyGenerator(curand_generator()));\n    CURAND_CHECK(curandCreateGenerator(&Get().curand_generator_,\n        CURAND_RNG_PSEUDO_DEFAULT));\n    CURAND_CHECK(curandSetPseudoRandomGeneratorSeed(curand_generator(),\n        seed));\n  } else {\n    LOG(ERROR) << \"Curand not available. Skipping setting the curand seed.\";\n  }\n  \/\/ VSL seed\n  VSL_CHECK(vslDeleteStream(&(Get().vsl_stream_)));\n  VSL_CHECK(vslNewStream(&(Get().vsl_stream_), VSL_BRNG_MT19937, seed));\n}\n\nvoid Caffe::DeviceQuery() {\n  cudaDeviceProp prop;\n  int device;\n  CUDA_CHECK(cudaGetDevice(&device));\n  CUDA_CHECK(cudaGetDeviceProperties(&prop, device));\n  printf(\"Major revision number:         %d\\n\", prop.major);\n  printf(\"Minor revision number:         %d\\n\", prop.minor);\n  printf(\"Name:                          %s\\n\", prop.name);\n  printf(\"Total global memory:           %lu\\n\", prop.totalGlobalMem);\n  printf(\"Total shared memory per block: %lu\\n\", prop.sharedMemPerBlock);\n  printf(\"Total registers per block:     %d\\n\", prop.regsPerBlock);\n  printf(\"Warp size:                     %d\\n\", prop.warpSize);\n  printf(\"Maximum memory pitch:          %lu\\n\", prop.memPitch);\n  printf(\"Maximum threads per block:     %d\\n\", prop.maxThreadsPerBlock);\n  printf(\"Maximum dimension of block:    %d, %d, %d\\n\",\n      prop.maxThreadsDim[0], prop.maxThreadsDim[1], prop.maxThreadsDim[2]);\n  printf(\"Maximum dimension of grid:     %d, %d, %d\\n\",\n      prop.maxGridSize[0], prop.maxGridSize[1], prop.maxGridSize[2]);\n  printf(\"Clock rate:                    %d\\n\", prop.clockRate);\n  printf(\"Total constant memory:         %lu\\n\", prop.totalConstMem);\n  printf(\"Texture alignment:             %lu\\n\", prop.textureAlignment);\n  printf(\"Concurrent copy and execution: %s\\n\",\n      (prop.deviceOverlap ? \"Yes\" : \"No\"));\n  printf(\"Number of multiprocessors:     %d\\n\", prop.multiProcessorCount);\n  printf(\"Kernel execution timeout:      %s\\n\",\n      (prop.kernelExecTimeoutEnabled ? \"Yes\" : \"No\"));\n  return;\n}\n\n}  \/\/ namespace caffe\n<commit_msg>common.cpp rand seed:  do time(NULL) so we can have different initializations<commit_after>\/\/ Copyright 2013 Yangqing Jia\n\n#include <cstdio>\n#include <ctime>\n\n#include \"caffe\/common.hpp\"\n\nnamespace caffe {\n\nshared_ptr<Caffe> Caffe::singleton_;\n\ninline bool StillFresh() {\n  struct tm fresh_time;\n  fresh_time.tm_year = 200;\n  fresh_time.tm_mon = 1;\n  fresh_time.tm_mday = 1;\n  fresh_time.tm_hour = 0;\n  fresh_time.tm_min = 0;\n  fresh_time.tm_sec = 0;\n  return (difftime(time(NULL), mktime(&fresh_time)) < 0);\n}\n\nCaffe::Caffe()\n    : mode_(Caffe::CPU), phase_(Caffe::TRAIN), cublas_handle_(NULL),\n      curand_generator_(NULL), vsl_stream_(NULL) {\n  \/\/ A simple way to set an expire time - not for coding geeks, but meh.\n  \/\/ It simply works by skipping creating the streams.\n  if (!StillFresh()) {\n    return;\n  }\n  \/\/ Try to create a cublas handler, and report an error if failed (but we will\n  \/\/ keep the program running as one might just want to run CPU code).\n  if (cublasCreate(&cublas_handle_) != CUBLAS_STATUS_SUCCESS) {\n    LOG(ERROR) << \"Cannot create Cublas handle. Cublas won't be available.\";\n  }\n  \/\/ Try to create a curand handler.\n  if (curandCreateGenerator(&curand_generator_, CURAND_RNG_PSEUDO_DEFAULT)\n      != CURAND_STATUS_SUCCESS ||\n      curandSetPseudoRandomGeneratorSeed(curand_generator_, time(NULL))\n      != CURAND_STATUS_SUCCESS) {\n    LOG(ERROR) << \"Cannot create Curand generator. Curand won't be available.\";\n  }\n  \/\/ Try to create a vsl stream. This should almost always work, but we will\n  \/\/ check it anyway.\n  if (vslNewStream(&vsl_stream_, VSL_BRNG_MT19937, time(NULL)) != VSL_STATUS_OK) {\n    LOG(ERROR) << \"Cannot create vsl stream. VSL random number generator \"\n        << \"won't be available.\";\n  }\n}\n\nCaffe::~Caffe() {\n  if (!cublas_handle_) CUBLAS_CHECK(cublasDestroy(cublas_handle_));\n  if (!curand_generator_) {\n    CURAND_CHECK(curandDestroyGenerator(curand_generator_));\n  }\n  if (!vsl_stream_) VSL_CHECK(vslDeleteStream(&vsl_stream_));\n};\n\nvoid Caffe::set_random_seed(const unsigned int seed) {\n  \/\/ Curand seed\n  \/\/ Yangqing's note: simply setting the generator seed does not seem to\n  \/\/ work on the tesla K20s, so I wrote the ugly reset thing below.\n  if (Get().curand_generator_) {\n    CURAND_CHECK(curandDestroyGenerator(curand_generator()));\n    CURAND_CHECK(curandCreateGenerator(&Get().curand_generator_,\n        CURAND_RNG_PSEUDO_DEFAULT));\n    CURAND_CHECK(curandSetPseudoRandomGeneratorSeed(curand_generator(),\n        seed));\n  } else {\n    LOG(ERROR) << \"Curand not available. Skipping setting the curand seed.\";\n  }\n  \/\/ VSL seed\n  VSL_CHECK(vslDeleteStream(&(Get().vsl_stream_)));\n  VSL_CHECK(vslNewStream(&(Get().vsl_stream_), VSL_BRNG_MT19937, seed));\n}\n\nvoid Caffe::DeviceQuery() {\n  cudaDeviceProp prop;\n  int device;\n  CUDA_CHECK(cudaGetDevice(&device));\n  CUDA_CHECK(cudaGetDeviceProperties(&prop, device));\n  printf(\"Major revision number:         %d\\n\", prop.major);\n  printf(\"Minor revision number:         %d\\n\", prop.minor);\n  printf(\"Name:                          %s\\n\", prop.name);\n  printf(\"Total global memory:           %lu\\n\", prop.totalGlobalMem);\n  printf(\"Total shared memory per block: %lu\\n\", prop.sharedMemPerBlock);\n  printf(\"Total registers per block:     %d\\n\", prop.regsPerBlock);\n  printf(\"Warp size:                     %d\\n\", prop.warpSize);\n  printf(\"Maximum memory pitch:          %lu\\n\", prop.memPitch);\n  printf(\"Maximum threads per block:     %d\\n\", prop.maxThreadsPerBlock);\n  printf(\"Maximum dimension of block:    %d, %d, %d\\n\",\n      prop.maxThreadsDim[0], prop.maxThreadsDim[1], prop.maxThreadsDim[2]);\n  printf(\"Maximum dimension of grid:     %d, %d, %d\\n\",\n      prop.maxGridSize[0], prop.maxGridSize[1], prop.maxGridSize[2]);\n  printf(\"Clock rate:                    %d\\n\", prop.clockRate);\n  printf(\"Total constant memory:         %lu\\n\", prop.totalConstMem);\n  printf(\"Texture alignment:             %lu\\n\", prop.textureAlignment);\n  printf(\"Concurrent copy and execution: %s\\n\",\n      (prop.deviceOverlap ? \"Yes\" : \"No\"));\n  printf(\"Number of multiprocessors:     %d\\n\", prop.multiProcessorCount);\n  printf(\"Kernel execution timeout:      %s\\n\",\n      (prop.kernelExecTimeoutEnabled ? \"Yes\" : \"No\"));\n  return;\n}\n\n}  \/\/ namespace caffe\n<|endoftext|>"}
{"text":"<commit_before>#include <glog\/logging.h>\n#include <cstdio>\n#include <ctime>\n\n#include \"caffe\/common.hpp\"\n#include \"caffe\/util\/rng.hpp\"\n\nnamespace caffe {\n\nshared_ptr<Caffe> Caffe::singleton_;\n\n\/\/ random seeding\nint64_t cluster_seedgen(void) {\n  int64_t s, seed, pid;\n  FILE* f = fopen(\"\/dev\/urandom\", \"rb\");\n  if (f && fread(&seed, 1, sizeof(seed), f) == sizeof(seed)) {\n    fclose(f);\n    return seed;\n  }\n\n  LOG(INFO) << \"System entropy source not available, \"\n              \"using fallback algorithm to generate seed instead.\";\n  if (f)\n    fclose(f);\n\n  pid = getpid();\n  s = time(NULL);\n  seed = abs(((s * 181) * ((pid - 83) * 359)) % 104729);\n  return seed;\n}\n\n\nvoid GlobalInit(int* pargc, char*** pargv) {\n  \/\/ Google flags.\n  ::gflags::ParseCommandLineFlags(pargc, pargv, true);\n  \/\/ Google logging.\n  ::google::InitGoogleLogging(*(pargv)[0]);\n}\n\n#ifdef CPU_ONLY  \/\/ CPU-only Caffe.\n\nCaffe::Caffe()\n    : random_generator_(), mode_(Caffe::CPU), phase_(Caffe::TRAIN) { }\n\nCaffe::~Caffe() { }\n\nvoid Caffe::set_random_seed(const unsigned int seed) {\n  \/\/ RNG seed\n  Get().random_generator_.reset(new RNG(seed));\n}\n\nvoid Caffe::SetDevice(const int device_id) {\n  NO_GPU;\n}\n\nvoid Caffe::DeviceQuery() {\n  NO_GPU;\n}\n\n\nclass Caffe::RNG::Generator {\n public:\n  Generator() : rng_(new caffe::rng_t(cluster_seedgen())) {}\n  explicit Generator(unsigned int seed) : rng_(new caffe::rng_t(seed)) {}\n  caffe::rng_t* rng() { return rng_.get(); }\n private:\n  shared_ptr<caffe::rng_t> rng_;\n};\n\nCaffe::RNG::RNG() : generator_(new Generator()) { }\n\nCaffe::RNG::RNG(unsigned int seed) : generator_(new Generator(seed)) { }\n\nCaffe::RNG& Caffe::RNG::operator=(const RNG& other) {\n  generator_ = other.generator_;\n  return *this;\n}\n\nvoid* Caffe::RNG::generator() {\n  return static_cast<void*>(generator_->rng());\n}\n\n#else  \/\/ Normal GPU + CPU Caffe.\n\nCaffe::Caffe()\n    : cublas_handle_(NULL), curand_generator_(NULL), random_generator_(),\n    mode_(Caffe::CPU), phase_(Caffe::TRAIN) {\n  \/\/ Try to create a cublas handler, and report an error if failed (but we will\n  \/\/ keep the program running as one might just want to run CPU code).\n  if (cublasCreate(&cublas_handle_) != CUBLAS_STATUS_SUCCESS) {\n    LOG(ERROR) << \"Cannot create Cublas handle. Cublas won't be available.\";\n  }\n  \/\/ Try to create a curand handler.\n  if (curandCreateGenerator(&curand_generator_, CURAND_RNG_PSEUDO_DEFAULT)\n      != CURAND_STATUS_SUCCESS ||\n      curandSetPseudoRandomGeneratorSeed(curand_generator_, cluster_seedgen())\n      != CURAND_STATUS_SUCCESS) {\n    LOG(ERROR) << \"Cannot create Curand generator. Curand won't be available.\";\n  }\n}\n\nCaffe::~Caffe() {\n  if (cublas_handle_) CUBLAS_CHECK(cublasDestroy(cublas_handle_));\n  if (curand_generator_) {\n    CURAND_CHECK(curandDestroyGenerator(curand_generator_));\n  }\n}\n\nvoid Caffe::set_random_seed(const unsigned int seed) {\n  \/\/ Curand seed\n  static bool g_curand_availability_logged = false;\n  if (Get().curand_generator_) {\n    CURAND_CHECK(curandSetPseudoRandomGeneratorSeed(curand_generator(),\n        seed));\n    CURAND_CHECK(curandSetGeneratorOffset(curand_generator(), 0));\n  } else {\n    if (!g_curand_availability_logged) {\n        LOG(ERROR) <<\n            \"Curand not available. Skipping setting the curand seed.\";\n        g_curand_availability_logged = true;\n    }\n  }\n  \/\/ RNG seed\n  Get().random_generator_.reset(new RNG(seed));\n}\n\nvoid Caffe::SetDevice(const int device_id) {\n  int current_device;\n  CUDA_CHECK(cudaGetDevice(&current_device));\n  if (current_device == device_id) {\n    return;\n  }\n  \/\/ The call to cudaSetDevice must come before any calls to Get, which\n  \/\/ may perform initialization using the GPU.\n  CUDA_CHECK(cudaSetDevice(device_id));\n  if (Get().cublas_handle_) CUBLAS_CHECK(cublasDestroy(Get().cublas_handle_));\n  if (Get().curand_generator_) {\n    CURAND_CHECK(curandDestroyGenerator(Get().curand_generator_));\n  }\n  CUBLAS_CHECK(cublasCreate(&Get().cublas_handle_));\n  CURAND_CHECK(curandCreateGenerator(&Get().curand_generator_,\n      CURAND_RNG_PSEUDO_DEFAULT));\n  CURAND_CHECK(curandSetPseudoRandomGeneratorSeed(Get().curand_generator_,\n      cluster_seedgen()));\n}\n\nvoid Caffe::DeviceQuery() {\n  cudaDeviceProp prop;\n  int device;\n  if (cudaSuccess != cudaGetDevice(&device)) {\n    printf(\"No cuda device present.\\n\");\n    return;\n  }\n  CUDA_CHECK(cudaGetDeviceProperties(&prop, device));\n  LOG(INFO) << \"Device id:                     \" << device;\n  LOG(INFO) << \"Major revision number:         \" << prop.major;\n  LOG(INFO) << \"Minor revision number:         \" << prop.minor;\n  LOG(INFO) << \"Name:                          \" << prop.name;\n  LOG(INFO) << \"Total global memory:           \" << prop.totalGlobalMem;\n  LOG(INFO) << \"Total shared memory per block: \" << prop.sharedMemPerBlock;\n  LOG(INFO) << \"Total registers per block:     \" << prop.regsPerBlock;\n  LOG(INFO) << \"Warp size:                     \" << prop.warpSize;\n  LOG(INFO) << \"Maximum memory pitch:          \" << prop.memPitch;\n  LOG(INFO) << \"Maximum threads per block:     \" << prop.maxThreadsPerBlock;\n  LOG(INFO) << \"Maximum dimension of block:    \"\n      << prop.maxThreadsDim[0] << \", \" << prop.maxThreadsDim[1] << \", \"\n      << prop.maxThreadsDim[2];\n  LOG(INFO) << \"Maximum dimension of grid:     \"\n      << prop.maxGridSize[0] << \", \" << prop.maxGridSize[1] << \", \"\n      << prop.maxGridSize[2];\n  LOG(INFO) << \"Clock rate:                    \" << prop.clockRate;\n  LOG(INFO) << \"Total constant memory:         \" << prop.totalConstMem;\n  LOG(INFO) << \"Texture alignment:             \" << prop.textureAlignment;\n  LOG(INFO) << \"Concurrent copy and execution: \"\n      << (prop.deviceOverlap ? \"Yes\" : \"No\");\n  LOG(INFO) << \"Number of multiprocessors:     \" << prop.multiProcessorCount;\n  LOG(INFO) << \"Kernel execution timeout:      \"\n      << (prop.kernelExecTimeoutEnabled ? \"Yes\" : \"No\");\n  return;\n}\n\n\nclass Caffe::RNG::Generator {\n public:\n  Generator() : rng_(new caffe::rng_t(cluster_seedgen())) {}\n  explicit Generator(unsigned int seed) : rng_(new caffe::rng_t(seed)) {}\n  caffe::rng_t* rng() { return rng_.get(); }\n private:\n  shared_ptr<caffe::rng_t> rng_;\n};\n\nCaffe::RNG::RNG() : generator_(new Generator()) { }\n\nCaffe::RNG::RNG(unsigned int seed) : generator_(new Generator(seed)) { }\n\nCaffe::RNG& Caffe::RNG::operator=(const RNG& other) {\n  generator_.reset(other.generator_.get());\n  return *this;\n}\n\nvoid* Caffe::RNG::generator() {\n  return static_cast<void*>(generator_->rng());\n}\n\nconst char* cublasGetErrorString(cublasStatus_t error) {\n  switch (error) {\n  case CUBLAS_STATUS_SUCCESS:\n    return \"CUBLAS_STATUS_SUCCESS\";\n  case CUBLAS_STATUS_NOT_INITIALIZED:\n    return \"CUBLAS_STATUS_NOT_INITIALIZED\";\n  case CUBLAS_STATUS_ALLOC_FAILED:\n    return \"CUBLAS_STATUS_ALLOC_FAILED\";\n  case CUBLAS_STATUS_INVALID_VALUE:\n    return \"CUBLAS_STATUS_INVALID_VALUE\";\n  case CUBLAS_STATUS_ARCH_MISMATCH:\n    return \"CUBLAS_STATUS_ARCH_MISMATCH\";\n  case CUBLAS_STATUS_MAPPING_ERROR:\n    return \"CUBLAS_STATUS_MAPPING_ERROR\";\n  case CUBLAS_STATUS_EXECUTION_FAILED:\n    return \"CUBLAS_STATUS_EXECUTION_FAILED\";\n  case CUBLAS_STATUS_INTERNAL_ERROR:\n    return \"CUBLAS_STATUS_INTERNAL_ERROR\";\n#if CUDA_VERSION >= 6000\n  case CUBLAS_STATUS_NOT_SUPPORTED:\n    return \"CUBLAS_STATUS_NOT_SUPPORTED\";\n#endif\n  }\n  return \"Unknown cublas status\";\n}\n\nconst char* curandGetErrorString(curandStatus_t error) {\n  switch (error) {\n  case CURAND_STATUS_SUCCESS:\n    return \"CURAND_STATUS_SUCCESS\";\n  case CURAND_STATUS_VERSION_MISMATCH:\n    return \"CURAND_STATUS_VERSION_MISMATCH\";\n  case CURAND_STATUS_NOT_INITIALIZED:\n    return \"CURAND_STATUS_NOT_INITIALIZED\";\n  case CURAND_STATUS_ALLOCATION_FAILED:\n    return \"CURAND_STATUS_ALLOCATION_FAILED\";\n  case CURAND_STATUS_TYPE_ERROR:\n    return \"CURAND_STATUS_TYPE_ERROR\";\n  case CURAND_STATUS_OUT_OF_RANGE:\n    return \"CURAND_STATUS_OUT_OF_RANGE\";\n  case CURAND_STATUS_LENGTH_NOT_MULTIPLE:\n    return \"CURAND_STATUS_LENGTH_NOT_MULTIPLE\";\n  case CURAND_STATUS_DOUBLE_PRECISION_REQUIRED:\n    return \"CURAND_STATUS_DOUBLE_PRECISION_REQUIRED\";\n  case CURAND_STATUS_LAUNCH_FAILURE:\n    return \"CURAND_STATUS_LAUNCH_FAILURE\";\n  case CURAND_STATUS_PREEXISTING_FAILURE:\n    return \"CURAND_STATUS_PREEXISTING_FAILURE\";\n  case CURAND_STATUS_INITIALIZATION_FAILED:\n    return \"CURAND_STATUS_INITIALIZATION_FAILED\";\n  case CURAND_STATUS_ARCH_MISMATCH:\n    return \"CURAND_STATUS_ARCH_MISMATCH\";\n  case CURAND_STATUS_INTERNAL_ERROR:\n    return \"CURAND_STATUS_INTERNAL_ERROR\";\n  }\n  return \"Unknown curand status\";\n}\n\n#endif  \/\/ CPU_ONLY\n\n}  \/\/ namespace caffe\n<commit_msg>add CUDA 6.5 error CUBLAS_STATUS_LICENSE_ERROR to cublasGetErrorString enum<commit_after>#include <glog\/logging.h>\n#include <cstdio>\n#include <ctime>\n\n#include \"caffe\/common.hpp\"\n#include \"caffe\/util\/rng.hpp\"\n\nnamespace caffe {\n\nshared_ptr<Caffe> Caffe::singleton_;\n\n\/\/ random seeding\nint64_t cluster_seedgen(void) {\n  int64_t s, seed, pid;\n  FILE* f = fopen(\"\/dev\/urandom\", \"rb\");\n  if (f && fread(&seed, 1, sizeof(seed), f) == sizeof(seed)) {\n    fclose(f);\n    return seed;\n  }\n\n  LOG(INFO) << \"System entropy source not available, \"\n              \"using fallback algorithm to generate seed instead.\";\n  if (f)\n    fclose(f);\n\n  pid = getpid();\n  s = time(NULL);\n  seed = abs(((s * 181) * ((pid - 83) * 359)) % 104729);\n  return seed;\n}\n\n\nvoid GlobalInit(int* pargc, char*** pargv) {\n  \/\/ Google flags.\n  ::gflags::ParseCommandLineFlags(pargc, pargv, true);\n  \/\/ Google logging.\n  ::google::InitGoogleLogging(*(pargv)[0]);\n}\n\n#ifdef CPU_ONLY  \/\/ CPU-only Caffe.\n\nCaffe::Caffe()\n    : random_generator_(), mode_(Caffe::CPU), phase_(Caffe::TRAIN) { }\n\nCaffe::~Caffe() { }\n\nvoid Caffe::set_random_seed(const unsigned int seed) {\n  \/\/ RNG seed\n  Get().random_generator_.reset(new RNG(seed));\n}\n\nvoid Caffe::SetDevice(const int device_id) {\n  NO_GPU;\n}\n\nvoid Caffe::DeviceQuery() {\n  NO_GPU;\n}\n\n\nclass Caffe::RNG::Generator {\n public:\n  Generator() : rng_(new caffe::rng_t(cluster_seedgen())) {}\n  explicit Generator(unsigned int seed) : rng_(new caffe::rng_t(seed)) {}\n  caffe::rng_t* rng() { return rng_.get(); }\n private:\n  shared_ptr<caffe::rng_t> rng_;\n};\n\nCaffe::RNG::RNG() : generator_(new Generator()) { }\n\nCaffe::RNG::RNG(unsigned int seed) : generator_(new Generator(seed)) { }\n\nCaffe::RNG& Caffe::RNG::operator=(const RNG& other) {\n  generator_ = other.generator_;\n  return *this;\n}\n\nvoid* Caffe::RNG::generator() {\n  return static_cast<void*>(generator_->rng());\n}\n\n#else  \/\/ Normal GPU + CPU Caffe.\n\nCaffe::Caffe()\n    : cublas_handle_(NULL), curand_generator_(NULL), random_generator_(),\n    mode_(Caffe::CPU), phase_(Caffe::TRAIN) {\n  \/\/ Try to create a cublas handler, and report an error if failed (but we will\n  \/\/ keep the program running as one might just want to run CPU code).\n  if (cublasCreate(&cublas_handle_) != CUBLAS_STATUS_SUCCESS) {\n    LOG(ERROR) << \"Cannot create Cublas handle. Cublas won't be available.\";\n  }\n  \/\/ Try to create a curand handler.\n  if (curandCreateGenerator(&curand_generator_, CURAND_RNG_PSEUDO_DEFAULT)\n      != CURAND_STATUS_SUCCESS ||\n      curandSetPseudoRandomGeneratorSeed(curand_generator_, cluster_seedgen())\n      != CURAND_STATUS_SUCCESS) {\n    LOG(ERROR) << \"Cannot create Curand generator. Curand won't be available.\";\n  }\n}\n\nCaffe::~Caffe() {\n  if (cublas_handle_) CUBLAS_CHECK(cublasDestroy(cublas_handle_));\n  if (curand_generator_) {\n    CURAND_CHECK(curandDestroyGenerator(curand_generator_));\n  }\n}\n\nvoid Caffe::set_random_seed(const unsigned int seed) {\n  \/\/ Curand seed\n  static bool g_curand_availability_logged = false;\n  if (Get().curand_generator_) {\n    CURAND_CHECK(curandSetPseudoRandomGeneratorSeed(curand_generator(),\n        seed));\n    CURAND_CHECK(curandSetGeneratorOffset(curand_generator(), 0));\n  } else {\n    if (!g_curand_availability_logged) {\n        LOG(ERROR) <<\n            \"Curand not available. Skipping setting the curand seed.\";\n        g_curand_availability_logged = true;\n    }\n  }\n  \/\/ RNG seed\n  Get().random_generator_.reset(new RNG(seed));\n}\n\nvoid Caffe::SetDevice(const int device_id) {\n  int current_device;\n  CUDA_CHECK(cudaGetDevice(&current_device));\n  if (current_device == device_id) {\n    return;\n  }\n  \/\/ The call to cudaSetDevice must come before any calls to Get, which\n  \/\/ may perform initialization using the GPU.\n  CUDA_CHECK(cudaSetDevice(device_id));\n  if (Get().cublas_handle_) CUBLAS_CHECK(cublasDestroy(Get().cublas_handle_));\n  if (Get().curand_generator_) {\n    CURAND_CHECK(curandDestroyGenerator(Get().curand_generator_));\n  }\n  CUBLAS_CHECK(cublasCreate(&Get().cublas_handle_));\n  CURAND_CHECK(curandCreateGenerator(&Get().curand_generator_,\n      CURAND_RNG_PSEUDO_DEFAULT));\n  CURAND_CHECK(curandSetPseudoRandomGeneratorSeed(Get().curand_generator_,\n      cluster_seedgen()));\n}\n\nvoid Caffe::DeviceQuery() {\n  cudaDeviceProp prop;\n  int device;\n  if (cudaSuccess != cudaGetDevice(&device)) {\n    printf(\"No cuda device present.\\n\");\n    return;\n  }\n  CUDA_CHECK(cudaGetDeviceProperties(&prop, device));\n  LOG(INFO) << \"Device id:                     \" << device;\n  LOG(INFO) << \"Major revision number:         \" << prop.major;\n  LOG(INFO) << \"Minor revision number:         \" << prop.minor;\n  LOG(INFO) << \"Name:                          \" << prop.name;\n  LOG(INFO) << \"Total global memory:           \" << prop.totalGlobalMem;\n  LOG(INFO) << \"Total shared memory per block: \" << prop.sharedMemPerBlock;\n  LOG(INFO) << \"Total registers per block:     \" << prop.regsPerBlock;\n  LOG(INFO) << \"Warp size:                     \" << prop.warpSize;\n  LOG(INFO) << \"Maximum memory pitch:          \" << prop.memPitch;\n  LOG(INFO) << \"Maximum threads per block:     \" << prop.maxThreadsPerBlock;\n  LOG(INFO) << \"Maximum dimension of block:    \"\n      << prop.maxThreadsDim[0] << \", \" << prop.maxThreadsDim[1] << \", \"\n      << prop.maxThreadsDim[2];\n  LOG(INFO) << \"Maximum dimension of grid:     \"\n      << prop.maxGridSize[0] << \", \" << prop.maxGridSize[1] << \", \"\n      << prop.maxGridSize[2];\n  LOG(INFO) << \"Clock rate:                    \" << prop.clockRate;\n  LOG(INFO) << \"Total constant memory:         \" << prop.totalConstMem;\n  LOG(INFO) << \"Texture alignment:             \" << prop.textureAlignment;\n  LOG(INFO) << \"Concurrent copy and execution: \"\n      << (prop.deviceOverlap ? \"Yes\" : \"No\");\n  LOG(INFO) << \"Number of multiprocessors:     \" << prop.multiProcessorCount;\n  LOG(INFO) << \"Kernel execution timeout:      \"\n      << (prop.kernelExecTimeoutEnabled ? \"Yes\" : \"No\");\n  return;\n}\n\n\nclass Caffe::RNG::Generator {\n public:\n  Generator() : rng_(new caffe::rng_t(cluster_seedgen())) {}\n  explicit Generator(unsigned int seed) : rng_(new caffe::rng_t(seed)) {}\n  caffe::rng_t* rng() { return rng_.get(); }\n private:\n  shared_ptr<caffe::rng_t> rng_;\n};\n\nCaffe::RNG::RNG() : generator_(new Generator()) { }\n\nCaffe::RNG::RNG(unsigned int seed) : generator_(new Generator(seed)) { }\n\nCaffe::RNG& Caffe::RNG::operator=(const RNG& other) {\n  generator_.reset(other.generator_.get());\n  return *this;\n}\n\nvoid* Caffe::RNG::generator() {\n  return static_cast<void*>(generator_->rng());\n}\n\nconst char* cublasGetErrorString(cublasStatus_t error) {\n  switch (error) {\n  case CUBLAS_STATUS_SUCCESS:\n    return \"CUBLAS_STATUS_SUCCESS\";\n  case CUBLAS_STATUS_NOT_INITIALIZED:\n    return \"CUBLAS_STATUS_NOT_INITIALIZED\";\n  case CUBLAS_STATUS_ALLOC_FAILED:\n    return \"CUBLAS_STATUS_ALLOC_FAILED\";\n  case CUBLAS_STATUS_INVALID_VALUE:\n    return \"CUBLAS_STATUS_INVALID_VALUE\";\n  case CUBLAS_STATUS_ARCH_MISMATCH:\n    return \"CUBLAS_STATUS_ARCH_MISMATCH\";\n  case CUBLAS_STATUS_MAPPING_ERROR:\n    return \"CUBLAS_STATUS_MAPPING_ERROR\";\n  case CUBLAS_STATUS_EXECUTION_FAILED:\n    return \"CUBLAS_STATUS_EXECUTION_FAILED\";\n  case CUBLAS_STATUS_INTERNAL_ERROR:\n    return \"CUBLAS_STATUS_INTERNAL_ERROR\";\n#if CUDA_VERSION >= 6000\n  case CUBLAS_STATUS_NOT_SUPPORTED:\n    return \"CUBLAS_STATUS_NOT_SUPPORTED\";\n#endif\n#if CUDA_VERSION >= 6050\n  case CUBLAS_STATUS_LICENSE_ERROR:\n    return \"CUBLAS_STATUS_LICENSE_ERROR\";\n#endif\n  }\n  return \"Unknown cublas status\";\n}\n\nconst char* curandGetErrorString(curandStatus_t error) {\n  switch (error) {\n  case CURAND_STATUS_SUCCESS:\n    return \"CURAND_STATUS_SUCCESS\";\n  case CURAND_STATUS_VERSION_MISMATCH:\n    return \"CURAND_STATUS_VERSION_MISMATCH\";\n  case CURAND_STATUS_NOT_INITIALIZED:\n    return \"CURAND_STATUS_NOT_INITIALIZED\";\n  case CURAND_STATUS_ALLOCATION_FAILED:\n    return \"CURAND_STATUS_ALLOCATION_FAILED\";\n  case CURAND_STATUS_TYPE_ERROR:\n    return \"CURAND_STATUS_TYPE_ERROR\";\n  case CURAND_STATUS_OUT_OF_RANGE:\n    return \"CURAND_STATUS_OUT_OF_RANGE\";\n  case CURAND_STATUS_LENGTH_NOT_MULTIPLE:\n    return \"CURAND_STATUS_LENGTH_NOT_MULTIPLE\";\n  case CURAND_STATUS_DOUBLE_PRECISION_REQUIRED:\n    return \"CURAND_STATUS_DOUBLE_PRECISION_REQUIRED\";\n  case CURAND_STATUS_LAUNCH_FAILURE:\n    return \"CURAND_STATUS_LAUNCH_FAILURE\";\n  case CURAND_STATUS_PREEXISTING_FAILURE:\n    return \"CURAND_STATUS_PREEXISTING_FAILURE\";\n  case CURAND_STATUS_INITIALIZATION_FAILED:\n    return \"CURAND_STATUS_INITIALIZATION_FAILED\";\n  case CURAND_STATUS_ARCH_MISMATCH:\n    return \"CURAND_STATUS_ARCH_MISMATCH\";\n  case CURAND_STATUS_INTERNAL_ERROR:\n    return \"CURAND_STATUS_INTERNAL_ERROR\";\n  }\n  return \"Unknown curand status\";\n}\n\n#endif  \/\/ CPU_ONLY\n\n}  \/\/ namespace caffe\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n* Copyright 2014-2015 Trefilov Dmitrij                                      *\n*                                                                           *\n* Licensed under the Apache License, Version 2.0 (the \"License\");           *\n* you may not use this file except in compliance with the License.          *\n* You may obtain a copy of the License at                                   *\n*                                                                           *\n*    http:\/\/www.apache.org\/licenses\/LICENSE-2.0                             *\n*                                                                           *\n* Unless required by applicable law or agreed to in writing, software       *\n* distributed under the License is distributed on an \"AS IS\" BASIS,         *\n* WITHOUT WARRANTIES OR CONDITIONS OF 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 \"Variant.h\"\n\nnamespace metacpp\n{\nnamespace detail\n{\n\n    VariantData::VariantData()\n        : m_type(eFieldVoid)\n    {\n    }\n\n    VariantData::~VariantData()\n    {\n    }\n\n    VariantData::VariantData(bool v)\n        : m_type(eFieldBool)\n    {\n        m_storage.m_bool = v;\n    }\n\n    VariantData::VariantData(int32_t v)\n        : m_type(eFieldInt)\n    {\n        m_storage.m_int = v;\n    }\n\n    VariantData::VariantData(uint32_t v)\n        : m_type(eFieldUint)\n    {\n        m_storage.m_uint = v;\n    }\n\n    VariantData::VariantData(const int64_t &v)\n        : m_type(eFieldInt64)\n    {\n        m_storage.m_int64 = v;\n    }\n\n    VariantData::VariantData(const uint64_t &v)\n        : m_type(eFieldUint64)\n    {\n        m_storage.m_uint64 = v;\n    }\n\n    VariantData::VariantData(const float &v)\n        : m_type(eFieldFloat)\n    {\n        m_storage.m_float = v;\n    }\n\n    VariantData::VariantData(const double &v)\n        : m_type(eFieldDouble)\n    {\n        m_storage.m_double = v;\n    }\n\n    VariantData::VariantData(const String &v)\n        : m_type(eFieldString), m_string(v)\n    {\n    }\n\n    VariantData::VariantData(const DateTime &v)\n        : m_type(eFieldDateTime), m_datetime(v)\n    {\n    }\n\n    VariantData::VariantData(const Object *o)\n        : m_type(eFieldObject)\n    {\n        m_storage.m_object = o;\n    }\n\n    VariantData::VariantData(const Array<Variant> &a)\n        : m_type(eFieldArray)\n    {\n        m_array = a;\n    }\n\n    EFieldType VariantData::type() const\n    {\n        return m_type;\n    }\n\n    SharedDataBase *VariantData::clone() const\n    {\n        VariantData *copy = new VariantData();\n        copy->m_datetime = m_datetime;\n        copy->m_string = m_string;\n        switch (m_type)\n        {\n        case eFieldBool:\n            copy->m_storage.m_bool = m_storage.m_bool;\n            break;\n        case eFieldInt:\n            copy->m_storage.m_int = m_storage.m_int;\n            break;\n        case eFieldUint:\n            copy->m_storage.m_uint = m_storage.m_uint;\n            break;\n        case eFieldInt64:\n            copy->m_storage.m_int64 = m_storage.m_int64;\n            break;\n        case eFieldUint64:\n            copy->m_storage.m_uint64 = m_storage.m_uint64;\n            break;\n        case eFieldFloat:\n            copy->m_storage.m_float = m_storage.m_float;\n            break;\n        case eFieldDouble:\n            copy->m_storage.m_double = m_storage.m_double;\n            break;\n        case eFieldObject:\n            copy->m_storage.m_object = m_storage.m_object;\n            break;\n        default:\n            break;\n        }\n        return copy;\n    }\n\n    template<>\n    bool VariantData::value<bool>() const\n    {\n        switch (m_type)\n        {\n        case eFieldBool:\n            return m_storage.m_bool;\n        case eFieldInt:\n            return m_storage.m_int != 0;\n        case eFieldUint:\n            return m_storage.m_uint != 0;\n        case eFieldInt64:\n            return m_storage.m_int64 != 0;\n        case eFieldUint64:\n            return m_storage.m_uint64 != 0;\n        case eFieldFloat:\n            return m_storage.m_float != 0;\n        case eFieldDouble:\n            return m_storage.m_double != 0;\n        default:\n            throw std::invalid_argument(\"Variant is not convertible to bool\");\n        }\n    }\n\n    template<typename T>\n    T VariantData::arithmetic_convert() const\n    {\n        switch (m_type)\n        {\n        case eFieldBool:\n            return static_cast<T>(m_storage.m_bool);\n        case eFieldInt:\n            return static_cast<T>(m_storage.m_int);\n        case eFieldUint:\n            return static_cast<T>(m_storage.m_uint);\n        case eFieldInt64:\n            return static_cast<T>(m_storage.m_int64);\n        case eFieldUint64:\n            return static_cast<T>(m_storage.m_uint64);\n        case eFieldFloat:\n            return static_cast<T>(m_storage.m_float);\n        case eFieldDouble:\n            return static_cast<T>(m_storage.m_double);\n        default:\n            throw std::invalid_argument(\"Variant does not contain arithmetic type\");\n        }\n    }\n\n    template<> int8_t VariantData::value<int8_t>() const { return arithmetic_convert<int8_t>(); }\n    template<> uint8_t VariantData::value<uint8_t>() const { return arithmetic_convert<uint8_t>(); }\n    template<> int16_t VariantData::value<int16_t>() const { return arithmetic_convert<int16_t>(); }\n    template<> uint16_t VariantData::value<uint16_t>() const { return arithmetic_convert<uint16_t>(); }\n    template<> int32_t VariantData::value<int32_t>() const { return arithmetic_convert<int32_t>(); }\n    template<> uint32_t VariantData::value<uint32_t>() const { return arithmetic_convert<uint32_t>(); }\n    template<> int64_t VariantData::value<int64_t>() const { return arithmetic_convert<int64_t>(); }\n    template<> uint64_t VariantData::value<uint64_t>() const { return arithmetic_convert<uint64_t>(); }\n    template<> float VariantData::value<float>() const { return arithmetic_convert<float>(); }\n    template<> double VariantData::value<double>() const { return arithmetic_convert<double>(); }\n    template<> long double VariantData::value<long double>() const { return arithmetic_convert<long double>(); }\n\n    template<>\n    String VariantData::value<String>() const\n    {\n        switch (m_type)\n        {\n        case eFieldBool:\n            return String::fromValue(m_storage.m_bool);\n        case eFieldInt:\n            return String::fromValue(m_storage.m_int);\n        case eFieldUint:\n            return String::fromValue(m_storage.m_uint);\n        case eFieldInt64:\n            return String::fromValue(m_storage.m_int64);\n        case eFieldUint64:\n            return String::fromValue(m_storage.m_uint64);\n        case eFieldFloat:\n            return String::fromValue(m_storage.m_float);\n        case eFieldDouble:\n            return String::fromValue(m_storage.m_double);\n        case eFieldString:\n            return m_string;\n        case eFieldDateTime:\n            return String::fromValue(m_datetime);\n        default:\n            throw std::invalid_argument(\"Variant is not convertible to String\");\n        }\n    }\n\n    template<>\n    DateTime VariantData::value<DateTime>() const\n    {\n        switch (m_type)\n        {\n        case eFieldDateTime:\n            return m_datetime;\n        default:\n            throw std::invalid_argument(\"Variant is not convertible to DateTime\");\n        }\n    }\n\n    template<>\n    Object *VariantData::value<Object *>() const\n    {\n        switch (m_type)\n        {\n        case eFieldObject:\n            return const_cast<Object *>(m_storage.m_object);\n        default:\n            throw std::invalid_argument(\"Variant is not of Object type\");\n        }\n    }\n\n    template<>\n    VariantArray VariantData::value<VariantArray>() const\n    {\n        switch (m_type)\n        {\n        case eFieldArray:\n            return m_array;\n        default:\n            throw std::invalid_argument(\"Variant is not of Array type\");\n        }\n    }\n\n    template<>\n    void VariantData::value<void>() const\n    {\n        switch (m_type)\n        {\n        case eFieldVoid:\n            return;\n        default:\n            throw std::invalid_argument(\"Variant is not void typed\");\n        }\n    }\n} \/\/ namespace detail\n\nbool Variant::valid() const\n{\n    detail::VariantData *data = this->data();\n    return data && eFieldVoid != data->type();\n}\n\nbool Variant::isIntegral() const\n{\n    detail::VariantData *data = this->data();\n    if (!data) return false;\n    switch (data->type())\n    {\n    case eFieldBool:\n    case eFieldInt:\n    case eFieldUint:\n    case eFieldInt64:\n    case eFieldUint64:\n        return true;\n    default:\n        return false;\n    }\n}\n\nbool Variant::isFloatingPoint() const\n{\n    detail::VariantData *data = this->data();\n    if (!data) return false;\n    switch (data->type())\n    {\n    case eFieldFloat:\n    case eFieldDouble:\n        return true;\n    default:\n        return false;\n    }\n}\n\nbool Variant::isArithmetic() const\n{\n    return isIntegral() || isFloatingPoint();\n}\n\nbool Variant::isString() const\n{\n    detail::VariantData *data = this->data();\n    if (!data) return false;\n    return data->type() == eFieldString;\n}\n\nbool Variant::isDateTime() const\n{\n    detail::VariantData *data = this->data();\n    if (!data) return false;\n    return data->type() == eFieldString;\n}\n\nbool Variant::isObject() const\n{\n    detail::VariantData *data = this->data();\n    if (!data) return false;\n    return data->type() == eFieldObject;\n}\n\nbool Variant::isArray() const\n{\n    detail::VariantData *data = this->data();\n    if (!data) return false;\n    return data->type() == eFieldArray;\n}\n\ndetail::VariantData *Variant::getData() const\n{\n    detail::VariantData *data = this->data();\n    if (!data)\n        throw std::runtime_error(\"Variant is invalid\");\n    return data;\n}\n\nVariant::Variant(void)\n{\n}\n\nVariant::~Variant()\n{\n}\n\nVariant::Variant(bool v)\n    : SharedDataPointer(new detail::VariantData(v))\n{\n\n}\n\nVariant::Variant(int32_t v)\n    : SharedDataPointer(new detail::VariantData(v))\n{\n\n}\n\nVariant::Variant(uint32_t v)\n    : SharedDataPointer(new detail::VariantData(v))\n{\n\n}\n\nVariant::Variant(const int64_t &v)\n    : SharedDataPointer(new detail::VariantData(v))\n{\n\n}\n\nVariant::Variant(const uint64_t &v)\n    : SharedDataPointer(new detail::VariantData(v))\n{\n\n}\n\nVariant::Variant(const float &v)\n    : SharedDataPointer(new detail::VariantData(v))\n{\n\n}\n\nVariant::Variant(const double &v)\n    : SharedDataPointer(new detail::VariantData(v))\n{\n\n}\n\nVariant::Variant(const char *v)\n    : SharedDataPointer(new detail::VariantData(String(v)))\n{\n\n}\n\nVariant::Variant(const String& v)\n    : SharedDataPointer(new detail::VariantData(v))\n{\n\n}\nVariant::Variant(const DateTime &v)\n    : SharedDataPointer(new detail::VariantData(v))\n{\n\n}\n\nVariant::Variant(Object *o)\n    : SharedDataPointer(new detail::VariantData(o))\n{\n\n}\n\nVariant::Variant(const Array<Variant> &a)\n    : SharedDataPointer(new detail::VariantData(a))\n{\n\n}\n\nstd::basic_ostream<char> &operator<<(std::basic_ostream<char> &stream, const Variant &v)\n{\n    return stream << variant_cast<String>(v);\n}\n\nstd::basic_ostream<char16_t> &operator<<(std::basic_ostream<char16_t> &stream, const Variant &v)\n{\n    return stream << variant_cast<String>(v);\n}\n\n} \/\/ namespace metacpp\n<commit_msg>Update Variant.cpp<commit_after>\/****************************************************************************\n* Copyright 2014-2015 Trefilov Dmitrij                                      *\n*                                                                           *\n* Licensed under the Apache License, Version 2.0 (the \"License\");           *\n* you may not use this file except in compliance with the License.          *\n* You may obtain a copy of the License at                                   *\n*                                                                           *\n*    http:\/\/www.apache.org\/licenses\/LICENSE-2.0                             *\n*                                                                           *\n* Unless required by applicable law or agreed to in writing, software       *\n* distributed under the License is distributed on an \"AS IS\" BASIS,         *\n* WITHOUT WARRANTIES OR CONDITIONS OF 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 \"Variant.h\"\n#include <stdexcept>\n\nnamespace metacpp\n{\nnamespace detail\n{\n\n    VariantData::VariantData()\n        : m_type(eFieldVoid)\n    {\n    }\n\n    VariantData::~VariantData()\n    {\n    }\n\n    VariantData::VariantData(bool v)\n        : m_type(eFieldBool)\n    {\n        m_storage.m_bool = v;\n    }\n\n    VariantData::VariantData(int32_t v)\n        : m_type(eFieldInt)\n    {\n        m_storage.m_int = v;\n    }\n\n    VariantData::VariantData(uint32_t v)\n        : m_type(eFieldUint)\n    {\n        m_storage.m_uint = v;\n    }\n\n    VariantData::VariantData(const int64_t &v)\n        : m_type(eFieldInt64)\n    {\n        m_storage.m_int64 = v;\n    }\n\n    VariantData::VariantData(const uint64_t &v)\n        : m_type(eFieldUint64)\n    {\n        m_storage.m_uint64 = v;\n    }\n\n    VariantData::VariantData(const float &v)\n        : m_type(eFieldFloat)\n    {\n        m_storage.m_float = v;\n    }\n\n    VariantData::VariantData(const double &v)\n        : m_type(eFieldDouble)\n    {\n        m_storage.m_double = v;\n    }\n\n    VariantData::VariantData(const String &v)\n        : m_type(eFieldString), m_string(v)\n    {\n    }\n\n    VariantData::VariantData(const DateTime &v)\n        : m_type(eFieldDateTime), m_datetime(v)\n    {\n    }\n\n    VariantData::VariantData(const Object *o)\n        : m_type(eFieldObject)\n    {\n        m_storage.m_object = o;\n    }\n\n    VariantData::VariantData(const Array<Variant> &a)\n        : m_type(eFieldArray)\n    {\n        m_array = a;\n    }\n\n    EFieldType VariantData::type() const\n    {\n        return m_type;\n    }\n\n    SharedDataBase *VariantData::clone() const\n    {\n        VariantData *copy = new VariantData();\n        copy->m_datetime = m_datetime;\n        copy->m_string = m_string;\n        switch (m_type)\n        {\n        case eFieldBool:\n            copy->m_storage.m_bool = m_storage.m_bool;\n            break;\n        case eFieldInt:\n            copy->m_storage.m_int = m_storage.m_int;\n            break;\n        case eFieldUint:\n            copy->m_storage.m_uint = m_storage.m_uint;\n            break;\n        case eFieldInt64:\n            copy->m_storage.m_int64 = m_storage.m_int64;\n            break;\n        case eFieldUint64:\n            copy->m_storage.m_uint64 = m_storage.m_uint64;\n            break;\n        case eFieldFloat:\n            copy->m_storage.m_float = m_storage.m_float;\n            break;\n        case eFieldDouble:\n            copy->m_storage.m_double = m_storage.m_double;\n            break;\n        case eFieldObject:\n            copy->m_storage.m_object = m_storage.m_object;\n            break;\n        default:\n            break;\n        }\n        return copy;\n    }\n\n    template<>\n    bool VariantData::value<bool>() const\n    {\n        switch (m_type)\n        {\n        case eFieldBool:\n            return m_storage.m_bool;\n        case eFieldInt:\n            return m_storage.m_int != 0;\n        case eFieldUint:\n            return m_storage.m_uint != 0;\n        case eFieldInt64:\n            return m_storage.m_int64 != 0;\n        case eFieldUint64:\n            return m_storage.m_uint64 != 0;\n        case eFieldFloat:\n            return m_storage.m_float != 0;\n        case eFieldDouble:\n            return m_storage.m_double != 0;\n        default:\n            throw std::invalid_argument(\"Variant is not convertible to bool\");\n        }\n    }\n\n    template<typename T>\n    T VariantData::arithmetic_convert() const\n    {\n        switch (m_type)\n        {\n        case eFieldBool:\n            return static_cast<T>(m_storage.m_bool);\n        case eFieldInt:\n            return static_cast<T>(m_storage.m_int);\n        case eFieldUint:\n            return static_cast<T>(m_storage.m_uint);\n        case eFieldInt64:\n            return static_cast<T>(m_storage.m_int64);\n        case eFieldUint64:\n            return static_cast<T>(m_storage.m_uint64);\n        case eFieldFloat:\n            return static_cast<T>(m_storage.m_float);\n        case eFieldDouble:\n            return static_cast<T>(m_storage.m_double);\n        default:\n            throw std::invalid_argument(\"Variant does not contain arithmetic type\");\n        }\n    }\n\n    template<> int8_t VariantData::value<int8_t>() const { return arithmetic_convert<int8_t>(); }\n    template<> uint8_t VariantData::value<uint8_t>() const { return arithmetic_convert<uint8_t>(); }\n    template<> int16_t VariantData::value<int16_t>() const { return arithmetic_convert<int16_t>(); }\n    template<> uint16_t VariantData::value<uint16_t>() const { return arithmetic_convert<uint16_t>(); }\n    template<> int32_t VariantData::value<int32_t>() const { return arithmetic_convert<int32_t>(); }\n    template<> uint32_t VariantData::value<uint32_t>() const { return arithmetic_convert<uint32_t>(); }\n    template<> int64_t VariantData::value<int64_t>() const { return arithmetic_convert<int64_t>(); }\n    template<> uint64_t VariantData::value<uint64_t>() const { return arithmetic_convert<uint64_t>(); }\n    template<> float VariantData::value<float>() const { return arithmetic_convert<float>(); }\n    template<> double VariantData::value<double>() const { return arithmetic_convert<double>(); }\n    template<> long double VariantData::value<long double>() const { return arithmetic_convert<long double>(); }\n\n    template<>\n    String VariantData::value<String>() const\n    {\n        switch (m_type)\n        {\n        case eFieldBool:\n            return String::fromValue(m_storage.m_bool);\n        case eFieldInt:\n            return String::fromValue(m_storage.m_int);\n        case eFieldUint:\n            return String::fromValue(m_storage.m_uint);\n        case eFieldInt64:\n            return String::fromValue(m_storage.m_int64);\n        case eFieldUint64:\n            return String::fromValue(m_storage.m_uint64);\n        case eFieldFloat:\n            return String::fromValue(m_storage.m_float);\n        case eFieldDouble:\n            return String::fromValue(m_storage.m_double);\n        case eFieldString:\n            return m_string;\n        case eFieldDateTime:\n            return String::fromValue(m_datetime);\n        default:\n            throw std::invalid_argument(\"Variant is not convertible to String\");\n        }\n    }\n\n    template<>\n    DateTime VariantData::value<DateTime>() const\n    {\n        switch (m_type)\n        {\n        case eFieldDateTime:\n            return m_datetime;\n        default:\n            throw std::invalid_argument(\"Variant is not convertible to DateTime\");\n        }\n    }\n\n    template<>\n    Object *VariantData::value<Object *>() const\n    {\n        switch (m_type)\n        {\n        case eFieldObject:\n            return const_cast<Object *>(m_storage.m_object);\n        default:\n            throw std::invalid_argument(\"Variant is not of Object type\");\n        }\n    }\n\n    template<>\n    VariantArray VariantData::value<VariantArray>() const\n    {\n        switch (m_type)\n        {\n        case eFieldArray:\n            return m_array;\n        default:\n            throw std::invalid_argument(\"Variant is not of Array type\");\n        }\n    }\n\n    template<>\n    void VariantData::value<void>() const\n    {\n        switch (m_type)\n        {\n        case eFieldVoid:\n            return;\n        default:\n            throw std::invalid_argument(\"Variant is not void typed\");\n        }\n    }\n} \/\/ namespace detail\n\nbool Variant::valid() const\n{\n    detail::VariantData *data = this->data();\n    return data && eFieldVoid != data->type();\n}\n\nbool Variant::isIntegral() const\n{\n    detail::VariantData *data = this->data();\n    if (!data) return false;\n    switch (data->type())\n    {\n    case eFieldBool:\n    case eFieldInt:\n    case eFieldUint:\n    case eFieldInt64:\n    case eFieldUint64:\n        return true;\n    default:\n        return false;\n    }\n}\n\nbool Variant::isFloatingPoint() const\n{\n    detail::VariantData *data = this->data();\n    if (!data) return false;\n    switch (data->type())\n    {\n    case eFieldFloat:\n    case eFieldDouble:\n        return true;\n    default:\n        return false;\n    }\n}\n\nbool Variant::isArithmetic() const\n{\n    return isIntegral() || isFloatingPoint();\n}\n\nbool Variant::isString() const\n{\n    detail::VariantData *data = this->data();\n    if (!data) return false;\n    return data->type() == eFieldString;\n}\n\nbool Variant::isDateTime() const\n{\n    detail::VariantData *data = this->data();\n    if (!data) return false;\n    return data->type() == eFieldString;\n}\n\nbool Variant::isObject() const\n{\n    detail::VariantData *data = this->data();\n    if (!data) return false;\n    return data->type() == eFieldObject;\n}\n\nbool Variant::isArray() const\n{\n    detail::VariantData *data = this->data();\n    if (!data) return false;\n    return data->type() == eFieldArray;\n}\n\ndetail::VariantData *Variant::getData() const\n{\n    detail::VariantData *data = this->data();\n    if (!data)\n        throw std::runtime_error(\"Variant is invalid\");\n    return data;\n}\n\nVariant::Variant(void)\n{\n}\n\nVariant::~Variant()\n{\n}\n\nVariant::Variant(bool v)\n    : SharedDataPointer(new detail::VariantData(v))\n{\n\n}\n\nVariant::Variant(int32_t v)\n    : SharedDataPointer(new detail::VariantData(v))\n{\n\n}\n\nVariant::Variant(uint32_t v)\n    : SharedDataPointer(new detail::VariantData(v))\n{\n\n}\n\nVariant::Variant(const int64_t &v)\n    : SharedDataPointer(new detail::VariantData(v))\n{\n\n}\n\nVariant::Variant(const uint64_t &v)\n    : SharedDataPointer(new detail::VariantData(v))\n{\n\n}\n\nVariant::Variant(const float &v)\n    : SharedDataPointer(new detail::VariantData(v))\n{\n\n}\n\nVariant::Variant(const double &v)\n    : SharedDataPointer(new detail::VariantData(v))\n{\n\n}\n\nVariant::Variant(const char *v)\n    : SharedDataPointer(new detail::VariantData(String(v)))\n{\n\n}\n\nVariant::Variant(const String& v)\n    : SharedDataPointer(new detail::VariantData(v))\n{\n\n}\nVariant::Variant(const DateTime &v)\n    : SharedDataPointer(new detail::VariantData(v))\n{\n\n}\n\nVariant::Variant(Object *o)\n    : SharedDataPointer(new detail::VariantData(o))\n{\n\n}\n\nVariant::Variant(const Array<Variant> &a)\n    : SharedDataPointer(new detail::VariantData(a))\n{\n\n}\n\nstd::basic_ostream<char> &operator<<(std::basic_ostream<char> &stream, const Variant &v)\n{\n    return stream << variant_cast<String>(v);\n}\n\nstd::basic_ostream<char16_t> &operator<<(std::basic_ostream<char16_t> &stream, const Variant &v)\n{\n    return stream << variant_cast<String>(v);\n}\n\n} \/\/ namespace metacpp\n<|endoftext|>"}
{"text":"<commit_before>#include \"getpath.h\"\n\n#include <iostream>\n\n#ifdef _WIN32\n#include <windows.h> \/\/ GetFullPathNameA\n#else\n#include <libgen.h> \/\/ dirname\n#include <cstring> \/\/ std::strcpy\n#endif\n\nnamespace cura\n{\nstd::string getPathName(const std::string& filePath) {\n#ifdef _WIN32\n    char buffer[MAX_PATH];\n    char* name_start;\n    DWORD path_size = GetFullPathNameA(filePath.c_str(), static_cast<DWORD>(MAX_PATH), buffer, &name_start);\n    if (path_size == 0)\n    {\n        std::cerr << \"Failed to get full path for [\" << filePath.c_str() << \"]\" << std::endl;\n        exit(1);\n    }\n    std::string folder_name{name_start, path_size};\n#else\n    char buffer[filePath.size()];\n    std::strcpy(buffer, filePath.c_str()); \/\/ copy the string because dirname(.) changes the input string!!!\n    std::string folder_name{dirname(buffer)};\n#endif\n    return folder_name;\n}\n}<commit_msg>Fix getPathName() for WIN32<commit_after>#include \"getpath.h\"\n\n#include <iostream>\n\n#ifdef _WIN32\n#include <windows.h> \/\/ GetFullPathNameA\n#else\n#include <libgen.h> \/\/ dirname\n#include <cstring> \/\/ std::strcpy\n#endif\n\nnamespace cura\n{\nstd::string getPathName(const std::string& filePath) {\n#ifdef _WIN32\n    char buffer[MAX_PATH];  \/\/ This buffer will hold the complete path.\n    char* file_name_start;  \/\/ This is the pointer to the start of the file name.\n    DWORD path_size = GetFullPathNameA(filePath.c_str(), static_cast<DWORD>(MAX_PATH), buffer, &file_name_start);\n    if (path_size == 0)\n    {\n        std::cerr << \"Failed to get full path for [\" << filePath.c_str() << \"]\" << std::endl;\n        exit(1);\n    }\n    \/\/ Only take the directory part of\n    DWORD dir_path_size = path_size - (path_size - (file_name_start - buffer));\n    std::string folder_name{buffer, dir_path_size};\n#else\n    char buffer[filePath.size()];\n    std::strcpy(buffer, filePath.c_str()); \/\/ copy the string because dirname(.) changes the input string!!!\n    std::string folder_name{dirname(buffer)};\n#endif\n    return folder_name;\n}\n}<|endoftext|>"}
{"text":"<commit_before>\/\/ Module:  LOG4CPLUS\n\/\/ File:    configurator.cxx\n\/\/ Created: 3\/2003\n\/\/ Author:  Tad E. Smith\n\/\/\n\/\/ Copyright (C) Tad E. Smith  All rights reserved.\n\/\/\n\/\/ This software is published under the terms of the Apache Software\n\/\/ License version 1.1, a copy of which has been included with this\n\/\/ distribution in the LICENSE.APL file.\n\/\/\n\/\/ $Log: not supported by cvs2svn $\n\/\/ Revision 1.9  2003\/05\/04 01:07:42  tcsmith\n\/\/ Modified PropertyConfigurator so that it can be used to configure a\n\/\/ Hierarchy other than the default one.\n\/\/\n\/\/ Revision 1.8  2003\/05\/02 16:36:49  tcsmith\n\/\/ Added \"#include <log4cplus\/spi\/loggerimpl.h>\" for VC++ .NET\n\/\/\n\/\/ Revision 1.7  2003\/05\/01 19:43:33  tcsmith\n\/\/ Fixed: \"warning: comparison between signed and unsigned\".\n\/\/\n\/\/ Revision 1.6  2003\/04\/19 23:04:30  tcsmith\n\/\/ Fixed UNICODE support.\n\/\/\n\/\/ Revision 1.5  2003\/04\/19 21:35:14  tcsmith\n\/\/ Replaced use of back_insert_iterator with string_append_iterator.\n\/\/\n\/\/ Revision 1.4  2003\/04\/18 21:00:38  tcsmith\n\/\/ Converted from std::string to log4cplus::tstring.\n\/\/\n\/\/ Revision 1.3  2003\/04\/05 20:14:38  tcsmith\n\/\/ Added replaceEnvironVariables() implementation.\n\/\/\n\/\/ Revision 1.2  2003\/04\/04 00:31:14  tcsmith\n\/\/ Changed to support the rename of propertyconfig.h to configurator.h\n\/\/\n\/\/ Revision 1.1  2003\/04\/03 23:46:14  tcsmith\n\/\/ Renamed from propertyconfig.cxx\n\/\/\n\/\/ Revision 1.3  2003\/04\/03 01:21:36  tcsmith\n\/\/ Changed to support the rename of Category to Logger and Priority to\n\/\/ LogLevel.\n\/\/\n\n#include <log4cplus\/configurator.h>\n#include <log4cplus\/helpers\/loglog.h>\n#include <log4cplus\/helpers\/stringhelper.h>\n#include <log4cplus\/spi\/factory.h>\n#include <log4cplus\/spi\/loggerimpl.h>\n\n#include <algorithm>\n\nusing namespace std;\nusing namespace log4cplus;\nusing namespace log4cplus::helpers;\nusing namespace log4cplus::spi;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ File LOCAL methods\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#define DELIM_START LOG4CPLUS_TEXT(\"${\")\n#define DELIM_STOP LOG4CPLUS_TEXT(\"}\")\n#define DELIM_START_LEN 2\n#define DELIM_STOP_LEN 1\n\nnamespace {\n    \/**\n     * Perform variable substitution in string <code>val<\/code> from\n     * environment variables.\n     *\n     * <p>The variable substitution delimeters are <b>${<\/b> and <b>}<\/b>.\n     *\n     * <p>For example, if the System properties contains \"key=value\", then\n     * the call\n     * <pre>\n     * string s = substEnvironVars(\"Value of key is ${key}.\");\n     * <\/pre>\n     *\n     * will set the variable <code>s<\/code> to \"Value of key is value.\".\n     *\n     * <p>If no value could be found for the specified key, then\n     * substitution defaults to the empty string.\n     *\n     * <p>For example, if there is no environment variable \"inexistentKey\", \n     * then the call\n     *\n     * <pre>\n     * string s = substEnvironVars(\"Value of inexistentKey is [${inexistentKey}]\");\n     * <\/pre>\n     * will set <code>s<\/code> to \"Value of inexistentKey is []\"\n     *\n     * @param val The string on which variable substitution is performed.\n     *\/\n    log4cplus::tstring substEnvironVars(const log4cplus::tstring& val) {\n       log4cplus::tstring sbuf;\n\n       tstring::size_type i = 0;\n       tstring::size_type j, k;\n\n        while(true) {\n            j=val.find(DELIM_START, i);\n            if(j == log4cplus::tstring::npos) {\n                if(i==0)\n                    return val;\n                else {\n                    sbuf += val.substr(i);\n                    return sbuf;\n                }\n            }\n            else {\n                sbuf += val.substr(i, j - i);\n                k = val.find(DELIM_STOP, j);\n                if(k == log4cplus::tstring::npos) {\n                    getLogLog().error(  LOG4CPLUS_TEXT('\"') + val\n                                      + LOG4CPLUS_TEXT(\"\\\" has no closing brace. \") \n                                      + LOG4CPLUS_TEXT(\"Opening brace at position TODO.\"));\n                    return val;\n                }\n                else {\n                    j += DELIM_START_LEN;\n                    log4cplus::tstring key = val.substr(j, k - j);\n                    char* replacement = \n                            getenv(LOG4CPLUS_TSTRING_TO_STRING(key).c_str());\n\n                    if(replacement != 0)\n                        sbuf += LOG4CPLUS_STRING_TO_TSTRING(replacement);\n                    i = k + DELIM_STOP_LEN;\n                }\n            }\n        } \/\/ end while loop\n    \n    } \/\/ end substEnvironVars()\n  \n}\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ log4cplus::PropertyConfigurator ctor and dtor\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nlog4cplus::PropertyConfigurator::PropertyConfigurator(const log4cplus::tstring& propertyFile)\n: propertyFilename(propertyFile),\n  properties(propertyFile)\n{\n    replaceEnvironVariables();\n    properties = properties.getPropertySubset( LOG4CPLUS_TEXT(\"log4cplus.\") );\n}\n\n\n\nlog4cplus::PropertyConfigurator::~PropertyConfigurator()\n{\n}\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ log4cplus::PropertyConfigurator static methods\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid\nlog4cplus::PropertyConfigurator::doConfigure(const log4cplus::tstring& file)\n{\n    PropertyConfigurator tmp(file);\n    tmp.configure();\n}\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ log4cplus::PropertyConfigurator public methods\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid\nlog4cplus::PropertyConfigurator::configure(Hierarchy& h)\n{\n    configureAppenders();\n    configureLoggers(h);\n    configureAdditivity(h);\n}\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ log4cplus::PropertyConfigurator protected methods\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid\nlog4cplus::PropertyConfigurator::replaceEnvironVariables()\n{\n\n    std::vector<log4cplus::tstring> keys = properties.propertyNames();\n    std::vector<log4cplus::tstring>::iterator it = keys.begin();\n    for(; it!=keys.end(); ++it) {\n        log4cplus::tstring key = *it;\n        log4cplus::tstring val = properties.getProperty(key);\n        log4cplus::tstring subKey = substEnvironVars(key);\n        if(subKey != key) {\n            properties.removeProperty(key);\n            properties.setProperty(subKey, val);\n        }\n\n        log4cplus::tstring subVal = substEnvironVars(val);\n        if(subVal != val) {\n            properties.setProperty(subKey, subVal);\n        }\n    }\n\n}\n\n\n\nvoid\nlog4cplus::PropertyConfigurator::configureLoggers(Hierarchy& h)\n{\n    if(properties.exists( LOG4CPLUS_TEXT(\"rootLogger\") )) {\n        Logger root = h.getRoot();\n        configureLogger(root, \n                        properties.getProperty(LOG4CPLUS_TEXT(\"rootLogger\")));\n    }\n\n    Properties loggerProperties = \n            properties.getPropertySubset(LOG4CPLUS_TEXT(\"logger.\"));\n    vector<tstring> loggers = loggerProperties.propertyNames();\n    for(vector<tstring>::iterator it=loggers.begin(); it!=loggers.end(); ++it) {\n        Logger log = h.getInstance(*it);\n        configureLogger(log, loggerProperties.getProperty(*it));\n    }\n}\n\n\n\nvoid\nlog4cplus::PropertyConfigurator::configureLogger(log4cplus::Logger logger, \n                                                 const log4cplus::tstring& config)\n{\n    \/\/ Remove all spaces from config\n    tstring configString;\n    remove_copy_if(config.begin(), config.end(),\n                   string_append_iterator<tstring>(configString),\n                   bind1st(equal_to<tchar>(), ' '));\n\n    \/\/ \"Tokenize\" configString\n    vector<tstring> tokens;\n    tokenize(configString, ',',\n             back_insert_iterator<vector<tstring> >(tokens));\n\n    if(tokens.size() == 0) {\n        getLogLog().error(  LOG4CPLUS_TEXT(\"PropertyConfigurator::configureLogger()- Invalid config string(Logger = \")\n                          + logger.getName() \n                          + LOG4CPLUS_TEXT(\"): \\\"\") \n                          + config \n                          + LOG4CPLUS_TEXT(\"\\\"\"));\n        return;\n    }\n\n    \/\/ Set the loglevel\n    tstring loglevel = tokens[0];\n    if(loglevel != LOG4CPLUS_TEXT(\"INHERITED\")) {\n        logger.setLogLevel( getLogLevelManager().fromString(loglevel) );\n    }\n\n    \/\/ Set the Appenders\n    for(vector<tstring>::size_type j=1; j<tokens.size(); ++j) {\n        AppenderMap::iterator appenderIt = appenders.find(tokens[j]);\n        if(appenderIt == appenders.end()) {\n            getLogLog().error(LOG4CPLUS_TEXT(\"PropertyConfigurator::configureLogger()- Invalid appender: \")\n                              + tokens[j]);\n            continue;\n        }\n        logger.addAppender( (*appenderIt).second );\n    }\n}\n\n\n\nvoid\nlog4cplus::PropertyConfigurator::configureAppenders()\n{\n    Properties appenderProperties = \n         properties.getPropertySubset(LOG4CPLUS_TEXT(\"appender.\"));\n    vector<tstring> appendersProps = appenderProperties.propertyNames();\n    for(vector<tstring>::iterator it=appendersProps.begin(); \n        it!=appendersProps.end(); \n        ++it) \n    {\n        if( (*it).find( LOG4CPLUS_TEXT('.') ) == tstring::npos ) {\n            tstring factoryName = appenderProperties.getProperty(*it);\n            AppenderFactory* factory = getAppenderFactoryRegistry().get(factoryName);\n            if(factory == 0) {\n                tstring err = \n                    LOG4CPLUS_TEXT(\"PropertyConfigurator::configureAppenders()- Cannot find AppenderFactory: \");\n                getLogLog().error(err + factoryName);\n                continue;\n            }\n\n            Properties properties = \n                    appenderProperties.getPropertySubset((*it) + LOG4CPLUS_TEXT(\".\"));\n            try {\n                SharedAppenderPtr appender = factory->createObject(properties);\n                if(appender.get() == 0) {\n                    tstring err = \n                        LOG4CPLUS_TEXT(\"PropertyConfigurator::configureAppenders()- Failed to create appender: \");\n                    getLogLog().error(err + *it);\n                }\n                else {\n                    appender->setName(*it);\n                    appenders[*it] = appender;\n                }\n            }\n            catch(std::exception& e) {\n                tstring err = \n                    LOG4CPLUS_TEXT(\"PropertyConfigurator::configureAppenders()- Error while creating Appender: \");\n                getLogLog().error(err + LOG4CPLUS_C_STR_TO_TSTRING(e.what()));\n            }\n        }\n    } \/\/ end for loop\n}\n\n\nvoid\nlog4cplus::PropertyConfigurator::configureAdditivity(Hierarchy& h)\n{\n    Properties additivityProperties = \n            properties.getPropertySubset(LOG4CPLUS_TEXT(\"additivity.\"));\n    vector<tstring> additivitysProps = additivityProperties.propertyNames();\n\n    for(vector<tstring>::iterator it=additivitysProps.begin(); \n        it!=additivitysProps.end(); \n        ++it) \n    {\n        Logger logger = h.getInstance(*it);\n        tstring actualValue = additivityProperties.getProperty(*it);\n        tstring value = tolower(actualValue);\n\n        if(value == LOG4CPLUS_TEXT(\"true\")) {\n            logger.setAdditivity(true);\n        }\n        else if(value == LOG4CPLUS_TEXT(\"false\")) {\n            logger.setAdditivity(false);\n        }\n        else {\n            getLogLog().warn(  LOG4CPLUS_TEXT(\"Invalid Additivity value: \\\"\") \n                             + actualValue \n                             + LOG4CPLUS_TEXT(\"\\\"\"));\n        }\n    }\n\n}\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ log4cplus::BasicConfigurator ctor and dtor\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nlog4cplus::BasicConfigurator::BasicConfigurator()\n: log4cplus::PropertyConfigurator( LOG4CPLUS_TEXT(\"\") )\n{\n    properties.setProperty(LOG4CPLUS_TEXT(\"rootLogger\"), \n                           LOG4CPLUS_TEXT(\"DEBUG, STDOUT\"));\n    properties.setProperty(LOG4CPLUS_TEXT(\"appender.STDOUT\"), \n                           LOG4CPLUS_TEXT(\"log4cplus::ConsoleAppender\"));\n}\n\n\n\n\nlog4cplus::BasicConfigurator::~BasicConfigurator()\n{\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ log4cplus::BasicConfigurator static methods\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid\nlog4cplus::BasicConfigurator::doConfigure()\n{\n    BasicConfigurator tmp;\n    tmp.configure();\n}\n\n\n<commit_msg>Modified configure() so that it calls initializeLog4cplus().<commit_after>\/\/ Module:  LOG4CPLUS\n\/\/ File:    configurator.cxx\n\/\/ Created: 3\/2003\n\/\/ Author:  Tad E. Smith\n\/\/\n\/\/ Copyright (C) Tad E. Smith  All rights reserved.\n\/\/\n\/\/ This software is published under the terms of the Apache Software\n\/\/ License version 1.1, a copy of which has been included with this\n\/\/ distribution in the LICENSE.APL file.\n\/\/\n\/\/ $Log: not supported by cvs2svn $\n\/\/ Revision 1.10  2003\/05\/19 14:36:31  tcsmith\n\/\/ Added doConfigure() static methods.\n\/\/\n\/\/ Revision 1.9  2003\/05\/04 01:07:42  tcsmith\n\/\/ Modified PropertyConfigurator so that it can be used to configure a\n\/\/ Hierarchy other than the default one.\n\/\/\n\/\/ Revision 1.8  2003\/05\/02 16:36:49  tcsmith\n\/\/ Added \"#include <log4cplus\/spi\/loggerimpl.h>\" for VC++ .NET\n\/\/\n\/\/ Revision 1.7  2003\/05\/01 19:43:33  tcsmith\n\/\/ Fixed: \"warning: comparison between signed and unsigned\".\n\/\/\n\/\/ Revision 1.6  2003\/04\/19 23:04:30  tcsmith\n\/\/ Fixed UNICODE support.\n\/\/\n\/\/ Revision 1.5  2003\/04\/19 21:35:14  tcsmith\n\/\/ Replaced use of back_insert_iterator with string_append_iterator.\n\/\/\n\/\/ Revision 1.4  2003\/04\/18 21:00:38  tcsmith\n\/\/ Converted from std::string to log4cplus::tstring.\n\/\/\n\/\/ Revision 1.3  2003\/04\/05 20:14:38  tcsmith\n\/\/ Added replaceEnvironVariables() implementation.\n\/\/\n\/\/ Revision 1.2  2003\/04\/04 00:31:14  tcsmith\n\/\/ Changed to support the rename of propertyconfig.h to configurator.h\n\/\/\n\/\/ Revision 1.1  2003\/04\/03 23:46:14  tcsmith\n\/\/ Renamed from propertyconfig.cxx\n\/\/\n\/\/ Revision 1.3  2003\/04\/03 01:21:36  tcsmith\n\/\/ Changed to support the rename of Category to Logger and Priority to\n\/\/ LogLevel.\n\/\/\n\n#include <log4cplus\/configurator.h>\n#include <log4cplus\/helpers\/loglog.h>\n#include <log4cplus\/helpers\/stringhelper.h>\n#include <log4cplus\/spi\/factory.h>\n#include <log4cplus\/spi\/loggerimpl.h>\n\n#include <algorithm>\n\nusing namespace std;\nusing namespace log4cplus;\nusing namespace log4cplus::helpers;\nusing namespace log4cplus::spi;\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Forward declarations\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nnamespace log4cplus {\n    void initializeLog4cplus();\n}\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ File LOCAL methods\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#define DELIM_START LOG4CPLUS_TEXT(\"${\")\n#define DELIM_STOP LOG4CPLUS_TEXT(\"}\")\n#define DELIM_START_LEN 2\n#define DELIM_STOP_LEN 1\n\nnamespace {\n    \/**\n     * Perform variable substitution in string <code>val<\/code> from\n     * environment variables.\n     *\n     * <p>The variable substitution delimeters are <b>${<\/b> and <b>}<\/b>.\n     *\n     * <p>For example, if the System properties contains \"key=value\", then\n     * the call\n     * <pre>\n     * string s = substEnvironVars(\"Value of key is ${key}.\");\n     * <\/pre>\n     *\n     * will set the variable <code>s<\/code> to \"Value of key is value.\".\n     *\n     * <p>If no value could be found for the specified key, then\n     * substitution defaults to the empty string.\n     *\n     * <p>For example, if there is no environment variable \"inexistentKey\", \n     * then the call\n     *\n     * <pre>\n     * string s = substEnvironVars(\"Value of inexistentKey is [${inexistentKey}]\");\n     * <\/pre>\n     * will set <code>s<\/code> to \"Value of inexistentKey is []\"\n     *\n     * @param val The string on which variable substitution is performed.\n     *\/\n    log4cplus::tstring substEnvironVars(const log4cplus::tstring& val) {\n       log4cplus::tstring sbuf;\n\n       tstring::size_type i = 0;\n       tstring::size_type j, k;\n\n        while(true) {\n            j=val.find(DELIM_START, i);\n            if(j == log4cplus::tstring::npos) {\n                if(i==0)\n                    return val;\n                else {\n                    sbuf += val.substr(i);\n                    return sbuf;\n                }\n            }\n            else {\n                sbuf += val.substr(i, j - i);\n                k = val.find(DELIM_STOP, j);\n                if(k == log4cplus::tstring::npos) {\n                    getLogLog().error(  LOG4CPLUS_TEXT('\"') + val\n                                      + LOG4CPLUS_TEXT(\"\\\" has no closing brace. \") \n                                      + LOG4CPLUS_TEXT(\"Opening brace at position TODO.\"));\n                    return val;\n                }\n                else {\n                    j += DELIM_START_LEN;\n                    log4cplus::tstring key = val.substr(j, k - j);\n                    char* replacement = \n                            getenv(LOG4CPLUS_TSTRING_TO_STRING(key).c_str());\n\n                    if(replacement != 0)\n                        sbuf += LOG4CPLUS_STRING_TO_TSTRING(replacement);\n                    i = k + DELIM_STOP_LEN;\n                }\n            }\n        } \/\/ end while loop\n    \n    } \/\/ end substEnvironVars()\n  \n}\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ log4cplus::PropertyConfigurator ctor and dtor\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nlog4cplus::PropertyConfigurator::PropertyConfigurator(const log4cplus::tstring& propertyFile)\n: propertyFilename(propertyFile),\n  properties(propertyFile)\n{\n    replaceEnvironVariables();\n    properties = properties.getPropertySubset( LOG4CPLUS_TEXT(\"log4cplus.\") );\n}\n\n\n\nlog4cplus::PropertyConfigurator::~PropertyConfigurator()\n{\n}\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ log4cplus::PropertyConfigurator static methods\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid\nlog4cplus::PropertyConfigurator::doConfigure(const log4cplus::tstring& file)\n{\n    PropertyConfigurator tmp(file);\n    tmp.configure();\n}\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ log4cplus::PropertyConfigurator public methods\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid\nlog4cplus::PropertyConfigurator::configure(Hierarchy& h)\n{\n    initializeLog4cplus();\n    configureAppenders();\n    configureLoggers(h);\n    configureAdditivity(h);\n}\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ log4cplus::PropertyConfigurator protected methods\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid\nlog4cplus::PropertyConfigurator::replaceEnvironVariables()\n{\n\n    std::vector<log4cplus::tstring> keys = properties.propertyNames();\n    std::vector<log4cplus::tstring>::iterator it = keys.begin();\n    for(; it!=keys.end(); ++it) {\n        log4cplus::tstring key = *it;\n        log4cplus::tstring val = properties.getProperty(key);\n        log4cplus::tstring subKey = substEnvironVars(key);\n        if(subKey != key) {\n            properties.removeProperty(key);\n            properties.setProperty(subKey, val);\n        }\n\n        log4cplus::tstring subVal = substEnvironVars(val);\n        if(subVal != val) {\n            properties.setProperty(subKey, subVal);\n        }\n    }\n\n}\n\n\n\nvoid\nlog4cplus::PropertyConfigurator::configureLoggers(Hierarchy& h)\n{\n    if(properties.exists( LOG4CPLUS_TEXT(\"rootLogger\") )) {\n        Logger root = h.getRoot();\n        configureLogger(root, \n                        properties.getProperty(LOG4CPLUS_TEXT(\"rootLogger\")));\n    }\n\n    Properties loggerProperties = \n            properties.getPropertySubset(LOG4CPLUS_TEXT(\"logger.\"));\n    vector<tstring> loggers = loggerProperties.propertyNames();\n    for(vector<tstring>::iterator it=loggers.begin(); it!=loggers.end(); ++it) {\n        Logger log = h.getInstance(*it);\n        configureLogger(log, loggerProperties.getProperty(*it));\n    }\n}\n\n\n\nvoid\nlog4cplus::PropertyConfigurator::configureLogger(log4cplus::Logger logger, \n                                                 const log4cplus::tstring& config)\n{\n    \/\/ Remove all spaces from config\n    tstring configString;\n    remove_copy_if(config.begin(), config.end(),\n                   string_append_iterator<tstring>(configString),\n                   bind1st(equal_to<tchar>(), ' '));\n\n    \/\/ \"Tokenize\" configString\n    vector<tstring> tokens;\n    tokenize(configString, ',',\n             back_insert_iterator<vector<tstring> >(tokens));\n\n    if(tokens.size() == 0) {\n        getLogLog().error(  LOG4CPLUS_TEXT(\"PropertyConfigurator::configureLogger()- Invalid config string(Logger = \")\n                          + logger.getName() \n                          + LOG4CPLUS_TEXT(\"): \\\"\") \n                          + config \n                          + LOG4CPLUS_TEXT(\"\\\"\"));\n        return;\n    }\n\n    \/\/ Set the loglevel\n    tstring loglevel = tokens[0];\n    if(loglevel != LOG4CPLUS_TEXT(\"INHERITED\")) {\n        logger.setLogLevel( getLogLevelManager().fromString(loglevel) );\n    }\n\n    \/\/ Set the Appenders\n    for(vector<tstring>::size_type j=1; j<tokens.size(); ++j) {\n        AppenderMap::iterator appenderIt = appenders.find(tokens[j]);\n        if(appenderIt == appenders.end()) {\n            getLogLog().error(LOG4CPLUS_TEXT(\"PropertyConfigurator::configureLogger()- Invalid appender: \")\n                              + tokens[j]);\n            continue;\n        }\n        logger.addAppender( (*appenderIt).second );\n    }\n}\n\n\n\nvoid\nlog4cplus::PropertyConfigurator::configureAppenders()\n{\n    Properties appenderProperties = \n         properties.getPropertySubset(LOG4CPLUS_TEXT(\"appender.\"));\n    vector<tstring> appendersProps = appenderProperties.propertyNames();\n    for(vector<tstring>::iterator it=appendersProps.begin(); \n        it!=appendersProps.end(); \n        ++it) \n    {\n        if( (*it).find( LOG4CPLUS_TEXT('.') ) == tstring::npos ) {\n            tstring factoryName = appenderProperties.getProperty(*it);\n            AppenderFactory* factory = getAppenderFactoryRegistry().get(factoryName);\n            if(factory == 0) {\n                tstring err = \n                    LOG4CPLUS_TEXT(\"PropertyConfigurator::configureAppenders()- Cannot find AppenderFactory: \");\n                getLogLog().error(err + factoryName);\n                continue;\n            }\n\n            Properties properties = \n                    appenderProperties.getPropertySubset((*it) + LOG4CPLUS_TEXT(\".\"));\n            try {\n                SharedAppenderPtr appender = factory->createObject(properties);\n                if(appender.get() == 0) {\n                    tstring err = \n                        LOG4CPLUS_TEXT(\"PropertyConfigurator::configureAppenders()- Failed to create appender: \");\n                    getLogLog().error(err + *it);\n                }\n                else {\n                    appender->setName(*it);\n                    appenders[*it] = appender;\n                }\n            }\n            catch(std::exception& e) {\n                tstring err = \n                    LOG4CPLUS_TEXT(\"PropertyConfigurator::configureAppenders()- Error while creating Appender: \");\n                getLogLog().error(err + LOG4CPLUS_C_STR_TO_TSTRING(e.what()));\n            }\n        }\n    } \/\/ end for loop\n}\n\n\nvoid\nlog4cplus::PropertyConfigurator::configureAdditivity(Hierarchy& h)\n{\n    Properties additivityProperties = \n            properties.getPropertySubset(LOG4CPLUS_TEXT(\"additivity.\"));\n    vector<tstring> additivitysProps = additivityProperties.propertyNames();\n\n    for(vector<tstring>::iterator it=additivitysProps.begin(); \n        it!=additivitysProps.end(); \n        ++it) \n    {\n        Logger logger = h.getInstance(*it);\n        tstring actualValue = additivityProperties.getProperty(*it);\n        tstring value = tolower(actualValue);\n\n        if(value == LOG4CPLUS_TEXT(\"true\")) {\n            logger.setAdditivity(true);\n        }\n        else if(value == LOG4CPLUS_TEXT(\"false\")) {\n            logger.setAdditivity(false);\n        }\n        else {\n            getLogLog().warn(  LOG4CPLUS_TEXT(\"Invalid Additivity value: \\\"\") \n                             + actualValue \n                             + LOG4CPLUS_TEXT(\"\\\"\"));\n        }\n    }\n\n}\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ log4cplus::BasicConfigurator ctor and dtor\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nlog4cplus::BasicConfigurator::BasicConfigurator()\n: log4cplus::PropertyConfigurator( LOG4CPLUS_TEXT(\"\") )\n{\n    properties.setProperty(LOG4CPLUS_TEXT(\"rootLogger\"), \n                           LOG4CPLUS_TEXT(\"DEBUG, STDOUT\"));\n    properties.setProperty(LOG4CPLUS_TEXT(\"appender.STDOUT\"), \n                           LOG4CPLUS_TEXT(\"log4cplus::ConsoleAppender\"));\n}\n\n\n\n\nlog4cplus::BasicConfigurator::~BasicConfigurator()\n{\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ log4cplus::BasicConfigurator static methods\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid\nlog4cplus::BasicConfigurator::doConfigure()\n{\n    BasicConfigurator tmp;\n    tmp.configure();\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Web Application Socket protocol, input data channel library.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"was_input.hxx\"\n#include \"was_quark.h\"\n#include \"event\/Event.hxx\"\n#include \"event\/Callback.hxx\"\n#include \"direct.hxx\"\n#include \"istream\/istream_oo.hxx\"\n#include \"buffered_io.hxx\"\n#include \"pool.hxx\"\n#include \"fb_pool.hxx\"\n#include \"SliceFifoBuffer.hxx\"\n#include \"util\/Cast.hxx\"\n\n#include <daemon\/log.h>\n#include <was\/protocol.h>\n\n#include <errno.h>\n#include <string.h>\n\nstatic constexpr struct timeval was_input_timeout = {\n    .tv_sec = 120,\n    .tv_usec = 0,\n};\n\nclass WasInput final : public Istream {\npublic:\n    const int fd;\n    Event event;\n\n    const WasInputHandler &handler;\n    void *const handler_ctx;\n\n    SliceFifoBuffer buffer;\n\n    uint64_t received = 0, guaranteed = 0, length;\n\n    bool closed = false, timeout = false, known_length = false;\n\n    \/**\n     * Was this stream aborted prematurely?  In this case, the stream\n     * is discarding the rest, and then calls the handler method\n     * premature().  Only defined if known_length is true.\n     *\/\n    bool premature;\n\n    WasInput(struct pool &p, int _fd,\n             const WasInputHandler &_handler, void *_handler_ctx)\n        :Istream(p), fd(_fd),\n         handler(_handler), handler_ctx(_handler_ctx) {\n        event.Set(fd, EV_READ|EV_TIMEOUT,\n                  MakeEventCallback(WasInput, EventCallback), this);\n    }\n\n    using Istream::HasHandler;\n    using Istream::Destroy;\n    using Istream::DestroyError;\n\n    void ScheduleRead() {\n        assert(fd >= 0);\n        assert(!buffer.IsDefined() || !buffer.IsFull());\n\n        event.Add(timeout ? &was_input_timeout : nullptr);\n    }\n\n    void AbortError(GError *error) {\n        buffer.FreeIfDefined(fb_pool_get());\n        event.Delete();\n\n        \/* protect against recursive was_input_free() call within the\n           istream handler *\/\n        closed = true;\n\n        handler.abort(handler_ctx);\n        DestroyError(error);\n    }\n\n    void Eof() {\n        assert(known_length);\n        assert(received == length);\n        assert(!buffer.IsDefined());\n\n        event.Delete();\n\n        if (premature) {\n            handler.premature(handler_ctx);\n\n            GError *error =\n                g_error_new_literal(was_quark(), 0,\n                                    \"premature end of WAS response\");\n            DestroyError(error);\n        } else {\n            handler.eof(handler_ctx);\n            DestroyEof();\n        }\n    }\n\n    bool CheckEof() {\n        if (known_length && received >= length &&\n            buffer.IsEmpty()) {\n            Eof();\n            return true;\n        } else\n            return false;\n    }\n\n    \/**\n     * Consume data from the input buffer.  Returns true if data has been\n     * consumed.\n     *\/\n    bool SubmitBuffer() {\n        auto r = buffer.Read();\n        if (r.IsEmpty())\n            return true;\n\n        size_t nbytes = InvokeData(r.data, r.size);\n        if (nbytes == 0)\n            return false;\n\n        buffer.Consume(nbytes);\n        buffer.FreeIfEmpty(fb_pool_get());\n\n        if (CheckEof())\n            return false;\n\n        return true;\n    }\n\n    \/*\n     * socket i\/o\n     *\n     *\/\n\n    bool ReadToBuffer();\n    bool TryBuffered();\n    bool TryDirect();\n\n    void TryRead() {\n        if (CheckDirect(FdType::FD_PIPE)) {\n            if (SubmitBuffer())\n                TryDirect();\n        } else {\n            TryBuffered();\n        }\n    }\n\n    void EventCallback(evutil_socket_t fd, short events);\n\n    \/* virtual methods from class Istream *\/\n\n    off_t _GetAvailable(bool partial) override {\n        if (known_length)\n            return length - received;\n        else if (partial && guaranteed > received)\n            return guaranteed - received;\n        else\n            return -1;\n    }\n\n    void _Read() override {\n        event.Delete();\n\n        if (SubmitBuffer())\n            TryRead();\n    }\n\n    void _Close() override {\n        buffer.FreeIfDefined(fb_pool_get());\n        event.Delete();\n\n        \/* protect against recursive was_input_free() call within the\n           istream handler *\/\n        closed = true;\n\n        handler.close(handler_ctx);\n\n        Destroy();\n    }\n};\n\ninline bool\nWasInput::ReadToBuffer()\n{\n    buffer.AllocateIfNull(fb_pool_get());\n\n    size_t max_length = 4096;\n    if (known_length) {\n        uint64_t rest = length - received;\n        if (rest < (uint64_t)max_length)\n            max_length = rest;\n\n        if (max_length == 0)\n            \/* all the data we need is already in the buffer *\/\n            return true;\n    }\n\n    ssize_t nbytes = read_to_buffer(fd, buffer, max_length);\n    assert(nbytes != -2);\n\n    if (nbytes == 0) {\n        GError *error =\n            g_error_new_literal(was_quark(), 0,\n                                \"server closed the data connection\");\n        AbortError(error);\n        return false;\n    }\n\n    if (nbytes < 0) {\n        if (errno == EAGAIN) {\n            buffer.FreeIfEmpty(fb_pool_get());\n            ScheduleRead();\n            return true;\n        }\n\n        GError *error =\n            g_error_new(was_quark(), 0,\n                        \"read error on data connection: %s\",\n                        strerror(errno));\n        AbortError(error);\n        return false;\n    }\n\n    received += nbytes;\n    return true;\n}\n\ninline bool\nWasInput::TryBuffered()\n{\n    if (!ReadToBuffer())\n        return false;\n\n    if (SubmitBuffer()) {\n        assert(!buffer.IsDefinedAndFull());\n        ScheduleRead();\n    }\n\n    return true;\n}\n\ninline bool\nWasInput::TryDirect()\n{\n    assert(buffer.IsEmpty());\n    assert(!buffer.IsDefined());\n\n    size_t max_length = 0x1000000;\n    if (known_length) {\n        uint64_t rest = length - received;\n        if (rest < (uint64_t)max_length)\n            max_length = rest;\n    }\n\n    ssize_t nbytes = InvokeDirect(FdType::FD_PIPE, fd, max_length);\n    if (nbytes == ISTREAM_RESULT_EOF || nbytes == ISTREAM_RESULT_BLOCKING ||\n        nbytes == ISTREAM_RESULT_CLOSED)\n        return false;\n\n    if (nbytes < 0) {\n        if (errno == EAGAIN) {\n            ScheduleRead();\n            return false;\n        }\n\n        GError *error =\n            g_error_new(was_quark(), 0,\n                        \"read error on data connection: %s\",\n                        strerror(errno));\n        AbortError(error);\n        return false;\n    }\n\n    received += nbytes;\n\n    if (CheckEof())\n        return false;\n\n    ScheduleRead();\n    return true;\n}\n\n\/*\n * libevent callback\n *\n *\/\n\ninline void\nWasInput::EventCallback(gcc_unused evutil_socket_t _fd, short events)\n{\n    assert(_fd == fd);\n    assert(fd >= 0);\n\n    if (unlikely(events & EV_TIMEOUT)) {\n        GError *error =\n            g_error_new_literal(was_quark(), 0,\n                                \"data receive timeout\");\n        AbortError(error);\n        return;\n    }\n\n    TryRead();\n\n    pool_commit();\n}\n\n\/*\n * constructor\n *\n *\/\n\nWasInput *\nwas_input_new(struct pool *pool, int fd,\n              const WasInputHandler *handler, void *handler_ctx)\n{\n    assert(fd >= 0);\n    assert(handler != nullptr);\n    assert(handler->eof != nullptr);\n    assert(handler->premature != nullptr);\n    assert(handler->abort != nullptr);\n\n    return NewFromPool<WasInput>(*pool, *pool, fd,\n                                 *handler, handler_ctx);\n}\n\nvoid\nwas_input_free(WasInput *input, GError *error)\n{\n    assert(error != nullptr || input->closed);\n\n    input->buffer.FreeIfDefined(fb_pool_get());\n\n    input->event.Delete();\n\n    if (!input->closed)\n        input->DestroyError(error);\n    else if (error != nullptr)\n        g_error_free(error);\n}\n\nvoid\nwas_input_free_unused(WasInput *input)\n{\n    assert(!input->HasHandler());\n    assert(!input->closed);\n    assert(!input->buffer.IsDefined());\n\n    input->Destroy();\n}\n\nIstream &\nwas_input_enable(WasInput &input)\n{\n    input.ScheduleRead();\n    return input;\n}\n\nbool\nwas_input_set_length(WasInput *input, uint64_t length)\n{\n    if (input->known_length) {\n        if (length == input->length)\n            return true;\n\n        GError *error =\n            g_error_new_literal(was_quark(), 0,\n                                \"wrong input length announced\");\n        input->AbortError(error);\n        return false;\n    }\n\n    input->length = length;\n    input->known_length = true;\n    input->premature = false;\n\n    if (input->CheckEof())\n        return false;\n\n    return true;\n}\n\nbool\nwas_input_premature(WasInput *input, uint64_t length)\n{\n    if (input->known_length && length > input->length) {\n        GError *error =\n            g_error_new_literal(was_quark(), 0,\n                                \"announced premature length is too large\");\n        input->AbortError(error);\n        return false;\n    }\n\n    if (input->guaranteed > length || input->received > length) {\n        GError *error =\n            g_error_new_literal(was_quark(), 0,\n                                \"announced premature length is too small\");\n        input->AbortError(error);\n        return false;\n    }\n\n    input->guaranteed = input->length = length;\n    input->known_length = true;\n    input->premature = true;\n\n    if (input->CheckEof())\n        return false;\n\n    return true;\n}\n<commit_msg>was\/input: add \"enabled\" flag to fix assertion failures<commit_after>\/*\n * Web Application Socket protocol, input data channel library.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"was_input.hxx\"\n#include \"was_quark.h\"\n#include \"event\/Event.hxx\"\n#include \"event\/Callback.hxx\"\n#include \"direct.hxx\"\n#include \"istream\/istream_oo.hxx\"\n#include \"buffered_io.hxx\"\n#include \"pool.hxx\"\n#include \"fb_pool.hxx\"\n#include \"SliceFifoBuffer.hxx\"\n#include \"util\/Cast.hxx\"\n\n#include <daemon\/log.h>\n#include <was\/protocol.h>\n\n#include <errno.h>\n#include <string.h>\n\nstatic constexpr struct timeval was_input_timeout = {\n    .tv_sec = 120,\n    .tv_usec = 0,\n};\n\nclass WasInput final : public Istream {\npublic:\n    const int fd;\n    Event event;\n\n    const WasInputHandler &handler;\n    void *const handler_ctx;\n\n    SliceFifoBuffer buffer;\n\n    uint64_t received = 0, guaranteed = 0, length;\n\n    bool enabled = false;\n\n    bool closed = false, timeout = false, known_length = false;\n\n    \/**\n     * Was this stream aborted prematurely?  In this case, the stream\n     * is discarding the rest, and then calls the handler method\n     * premature().  Only defined if known_length is true.\n     *\/\n    bool premature;\n\n    WasInput(struct pool &p, int _fd,\n             const WasInputHandler &_handler, void *_handler_ctx)\n        :Istream(p), fd(_fd),\n         handler(_handler), handler_ctx(_handler_ctx) {\n        event.Set(fd, EV_READ|EV_TIMEOUT,\n                  MakeEventCallback(WasInput, EventCallback), this);\n    }\n\n    using Istream::HasHandler;\n    using Istream::Destroy;\n    using Istream::DestroyError;\n\n    void ScheduleRead() {\n        assert(fd >= 0);\n        assert(!buffer.IsDefined() || !buffer.IsFull());\n\n        event.Add(timeout ? &was_input_timeout : nullptr);\n    }\n\n    void AbortError(GError *error) {\n        buffer.FreeIfDefined(fb_pool_get());\n        event.Delete();\n\n        \/* protect against recursive was_input_free() call within the\n           istream handler *\/\n        closed = true;\n\n        handler.abort(handler_ctx);\n        DestroyError(error);\n    }\n\n    void Eof() {\n        assert(known_length);\n        assert(received == length);\n        assert(!buffer.IsDefined());\n\n        event.Delete();\n\n        if (premature) {\n            handler.premature(handler_ctx);\n\n            GError *error =\n                g_error_new_literal(was_quark(), 0,\n                                    \"premature end of WAS response\");\n            DestroyError(error);\n        } else {\n            handler.eof(handler_ctx);\n            DestroyEof();\n        }\n    }\n\n    bool CheckEof() {\n        if (known_length && received >= length &&\n            buffer.IsEmpty()) {\n            Eof();\n            return true;\n        } else\n            return false;\n    }\n\n    \/**\n     * Consume data from the input buffer.  Returns true if data has been\n     * consumed.\n     *\/\n    bool SubmitBuffer() {\n        auto r = buffer.Read();\n        if (r.IsEmpty())\n            return true;\n\n        size_t nbytes = InvokeData(r.data, r.size);\n        if (nbytes == 0)\n            return false;\n\n        buffer.Consume(nbytes);\n        buffer.FreeIfEmpty(fb_pool_get());\n\n        if (CheckEof())\n            return false;\n\n        return true;\n    }\n\n    \/*\n     * socket i\/o\n     *\n     *\/\n\n    bool ReadToBuffer();\n    bool TryBuffered();\n    bool TryDirect();\n\n    void TryRead() {\n        if (CheckDirect(FdType::FD_PIPE)) {\n            if (SubmitBuffer())\n                TryDirect();\n        } else {\n            TryBuffered();\n        }\n    }\n\n    void EventCallback(evutil_socket_t fd, short events);\n\n    \/* virtual methods from class Istream *\/\n\n    off_t _GetAvailable(bool partial) override {\n        if (known_length)\n            return length - received;\n        else if (partial && guaranteed > received)\n            return guaranteed - received;\n        else\n            return -1;\n    }\n\n    void _Read() override {\n        event.Delete();\n\n        if (SubmitBuffer())\n            TryRead();\n    }\n\n    void _Close() override {\n        buffer.FreeIfDefined(fb_pool_get());\n        event.Delete();\n\n        \/* protect against recursive was_input_free() call within the\n           istream handler *\/\n        closed = true;\n\n        handler.close(handler_ctx);\n\n        Destroy();\n    }\n};\n\ninline bool\nWasInput::ReadToBuffer()\n{\n    buffer.AllocateIfNull(fb_pool_get());\n\n    size_t max_length = 4096;\n    if (known_length) {\n        uint64_t rest = length - received;\n        if (rest < (uint64_t)max_length)\n            max_length = rest;\n\n        if (max_length == 0)\n            \/* all the data we need is already in the buffer *\/\n            return true;\n    }\n\n    ssize_t nbytes = read_to_buffer(fd, buffer, max_length);\n    assert(nbytes != -2);\n\n    if (nbytes == 0) {\n        GError *error =\n            g_error_new_literal(was_quark(), 0,\n                                \"server closed the data connection\");\n        AbortError(error);\n        return false;\n    }\n\n    if (nbytes < 0) {\n        if (errno == EAGAIN) {\n            buffer.FreeIfEmpty(fb_pool_get());\n            ScheduleRead();\n            return true;\n        }\n\n        GError *error =\n            g_error_new(was_quark(), 0,\n                        \"read error on data connection: %s\",\n                        strerror(errno));\n        AbortError(error);\n        return false;\n    }\n\n    received += nbytes;\n    return true;\n}\n\ninline bool\nWasInput::TryBuffered()\n{\n    if (!ReadToBuffer())\n        return false;\n\n    if (SubmitBuffer()) {\n        assert(!buffer.IsDefinedAndFull());\n        ScheduleRead();\n    }\n\n    return true;\n}\n\ninline bool\nWasInput::TryDirect()\n{\n    assert(buffer.IsEmpty());\n    assert(!buffer.IsDefined());\n\n    size_t max_length = 0x1000000;\n    if (known_length) {\n        uint64_t rest = length - received;\n        if (rest < (uint64_t)max_length)\n            max_length = rest;\n    }\n\n    ssize_t nbytes = InvokeDirect(FdType::FD_PIPE, fd, max_length);\n    if (nbytes == ISTREAM_RESULT_EOF || nbytes == ISTREAM_RESULT_BLOCKING ||\n        nbytes == ISTREAM_RESULT_CLOSED)\n        return false;\n\n    if (nbytes < 0) {\n        if (errno == EAGAIN) {\n            ScheduleRead();\n            return false;\n        }\n\n        GError *error =\n            g_error_new(was_quark(), 0,\n                        \"read error on data connection: %s\",\n                        strerror(errno));\n        AbortError(error);\n        return false;\n    }\n\n    received += nbytes;\n\n    if (CheckEof())\n        return false;\n\n    ScheduleRead();\n    return true;\n}\n\n\/*\n * libevent callback\n *\n *\/\n\ninline void\nWasInput::EventCallback(gcc_unused evutil_socket_t _fd, short events)\n{\n    assert(_fd == fd);\n    assert(fd >= 0);\n\n    if (unlikely(events & EV_TIMEOUT)) {\n        GError *error =\n            g_error_new_literal(was_quark(), 0,\n                                \"data receive timeout\");\n        AbortError(error);\n        return;\n    }\n\n    TryRead();\n\n    pool_commit();\n}\n\n\/*\n * constructor\n *\n *\/\n\nWasInput *\nwas_input_new(struct pool *pool, int fd,\n              const WasInputHandler *handler, void *handler_ctx)\n{\n    assert(fd >= 0);\n    assert(handler != nullptr);\n    assert(handler->eof != nullptr);\n    assert(handler->premature != nullptr);\n    assert(handler->abort != nullptr);\n\n    return NewFromPool<WasInput>(*pool, *pool, fd,\n                                 *handler, handler_ctx);\n}\n\nvoid\nwas_input_free(WasInput *input, GError *error)\n{\n    assert(error != nullptr || input->closed || !input->enabled);\n\n    input->buffer.FreeIfDefined(fb_pool_get());\n\n    input->event.Delete();\n\n    if (!input->closed && input->enabled)\n        input->DestroyError(error);\n    else if (error != nullptr)\n        g_error_free(error);\n}\n\nvoid\nwas_input_free_unused(WasInput *input)\n{\n    assert(!input->HasHandler());\n    assert(!input->closed);\n    assert(!input->buffer.IsDefined());\n\n    input->Destroy();\n}\n\nIstream &\nwas_input_enable(WasInput &input)\n{\n    assert(!input.enabled);\n    input.enabled = true;\n    input.ScheduleRead();\n    return input;\n}\n\nbool\nwas_input_set_length(WasInput *input, uint64_t length)\n{\n    if (input->known_length) {\n        if (length == input->length)\n            return true;\n\n        GError *error =\n            g_error_new_literal(was_quark(), 0,\n                                \"wrong input length announced\");\n        input->AbortError(error);\n        return false;\n    }\n\n    input->length = length;\n    input->known_length = true;\n    input->premature = false;\n\n    if (input->CheckEof())\n        return false;\n\n    return true;\n}\n\nbool\nwas_input_premature(WasInput *input, uint64_t length)\n{\n    if (input->known_length && length > input->length) {\n        GError *error =\n            g_error_new_literal(was_quark(), 0,\n                                \"announced premature length is too large\");\n        input->AbortError(error);\n        return false;\n    }\n\n    if (input->guaranteed > length || input->received > length) {\n        GError *error =\n            g_error_new_literal(was_quark(), 0,\n                                \"announced premature length is too small\");\n        input->AbortError(error);\n        return false;\n    }\n\n    input->guaranteed = input->length = length;\n    input->known_length = true;\n    input->premature = true;\n\n    if (input->CheckEof())\n        return false;\n\n    return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2012, British Broadcasting Corporation\n * All Rights Reserved.\n *\n * Author: Philip de Nier\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n *     * Redistributions of source code must retain the above copyright notice,\n *       this list of conditions and the following disclaimer.\n *     * Redistributions in binary form must reproduce the above copyright\n *       notice, this list of conditions and the following disclaimer in the\n *       documentation and\/or other materials provided with the distribution.\n *     * Neither the name of the British Broadcasting Corporation nor the names\n *       of its contributors may be used to endorse or promote products derived\n *       from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#ifdef HAVE_CONFIG_H\n#include \"config.h\"\n#endif\n\n#include <cstring>\n#include <cstdio>\n\n#include <bmx\/wave\/WaveBEXT.h>\n#include <bmx\/Utils.h>\n#include <bmx\/BMXException.h>\n#include <bmx\/Logging.h>\n\nusing namespace std;\nusing namespace bmx;\n\n\n\/\/ string size equals var size - extra null terminator\n#define STRING_SIZE(var)   (sizeof(var) - 1)\n\n\nextern bool BMX_REGRESSION_TEST;\n\n\n\nWaveBEXT::WaveBEXT()\n{\n    SetDescription(\"\");\n    SetOriginator(\"\");\n    SetOriginatorReference(\"\");\n    if (BMX_REGRESSION_TEST)\n        memset(&mOriginatorTimestamp, 0, sizeof(mOriginatorTimestamp));\n    else\n        SetOriginatorTimestamp(generate_timestamp_now());\n    mTimeReference = 0;\n    mVersion = 0;\n    if (BMX_REGRESSION_TEST)\n        memset(mUMID64, 0, sizeof(mUMID64));\n    else\n        SetUMID(generate_umid());\n    mLoudnessValue = 0;\n    mLoudnessRange = 0;\n    mMaxTruePeakLevel = 0;\n    mMaxMomentaryLoudness = 0;\n    mMaxShortTermLoudness = 0;\n}\n\nWaveBEXT::~WaveBEXT()\n{\n}\n\nvoid WaveBEXT::SetDescription(string description)\n{\n    string ascii = ConvertToASCII(description);\n\n    strncpy(mDescription, ascii.c_str(), STRING_SIZE(mDescription));\n    if (ascii.size() < STRING_SIZE(mDescription))\n        memset(mDescription + ascii.size(), 0, STRING_SIZE(mDescription) - ascii.size());\n}\n\nvoid WaveBEXT::SetOriginator(string originator)\n{\n    string ascii = ConvertToASCII(originator);\n\n    strncpy(mOriginator, ascii.c_str(), STRING_SIZE(mOriginator));\n    if (ascii.size() < STRING_SIZE(mOriginator))\n        memset(mOriginator + ascii.size(), 0, STRING_SIZE(mOriginator) - ascii.size());\n}\n\nvoid WaveBEXT::SetOriginatorReference(string reference)\n{\n    string ascii = ConvertToASCII(reference);\n\n    strncpy(mOriginatorReference, ascii.c_str(), STRING_SIZE(mOriginatorReference));\n    if (ascii.size() < STRING_SIZE(mOriginatorReference))\n        memset(mOriginatorReference + ascii.size(), 0, STRING_SIZE(mOriginatorReference) - ascii.size());\n}\n\nvoid WaveBEXT::SetOriginatorTimestamp(Timestamp timestamp)\n{\n    if ((timestamp.year  < 0  || timestamp.year  > 9999) ||\n        (timestamp.month < 1  || timestamp.month > 12) ||\n        (timestamp.day   < 1  || timestamp.day   > 31) ||\n        timestamp.hour   > 23 ||\n        timestamp.min    > 59 ||\n        timestamp.sec    > 59)\n    {\n        log_warn(\"Ignoring invalid originator timestamp\\n\");\n        return;\n    }\n\n    mOriginatorTimestamp = timestamp;\n}\n\nvoid WaveBEXT::SetTimeReference(uint64_t reference)\n{\n    mTimeReference = reference;\n}\n\nvoid WaveBEXT::SetUMID(UMID umid)\n{\n    memcpy(mUMID64, &umid.octet0, 32);\n    memset(&mUMID64[32], 0, 32);\n\n    if (mVersion < 1)\n        mVersion = 1;\n}\n\nvoid WaveBEXT::SetLoudnessValue(int16_t value)\n{\n    mLoudnessValue = value;\n\n    if (mVersion < 2)\n        mVersion = 2;\n}\n\nvoid WaveBEXT::SetLoudnessRange(int16_t range)\n{\n    mLoudnessRange = range;\n\n    if (mVersion < 2)\n        mVersion = 2;\n}\n\nvoid WaveBEXT::SetMaxTruePeakLevel(int16_t level)\n{\n    mMaxTruePeakLevel = level;\n\n    if (mVersion < 2)\n        mVersion = 2;\n}\n\nvoid WaveBEXT::SetMaxMomentaryLoudness(int16_t loudness)\n{\n    mMaxMomentaryLoudness = loudness;\n\n    if (mVersion < 2)\n        mVersion = 2;\n}\n\nvoid WaveBEXT::SetMaxShortTermLoudness(int16_t loudness)\n{\n    mMaxShortTermLoudness = loudness;\n\n    if (mVersion < 2)\n        mVersion = 2;\n}\n\nvoid WaveBEXT::AppendCodingHistory(string line)\n{\n    mCodingHistory.append(ConvertToASCII(line)).append(1, 0x0d).append(1, 0x0a);\n}\n\nvoid WaveBEXT::AppendCodingHistory(vector<pair<string, string> > line)\n{\n    \/\/ append line: <name>=<value>,...\n    string line_str;\n    size_t i;\n    for (i = 0; i < line.size(); i++) {\n        if (i != 0)\n            line_str.append(\",\");\n        line_str.append(line[i].first).append(\"=\").append(line[i].second);\n    }\n\n    AppendCodingHistory(line_str);\n}\n\nvoid WaveBEXT::Write(WaveIO *output)\n{\n    output->WriteTag(\"bext\");\n    output->WriteSize(602 + (mCodingHistory.empty() ? 0 : mCodingHistory.size() + 1));\n\n    output->Write((const unsigned char*)mDescription, STRING_SIZE(mDescription));\n    output->Write((const unsigned char*)mOriginator, STRING_SIZE(mOriginator));\n    output->Write((const unsigned char*)mOriginatorReference, STRING_SIZE(mOriginatorReference));\n\n    char buffer[32];\n    sprintf(buffer, \"%04u-%02u-%02u\", mOriginatorTimestamp.year, mOriginatorTimestamp.month, mOriginatorTimestamp.day);\n    output->Write((const unsigned char*)buffer, 10);\n\n    sprintf(buffer, \"%02u:%02u:%02u\", mOriginatorTimestamp.hour, mOriginatorTimestamp.min, mOriginatorTimestamp.sec);\n    output->Write((const unsigned char*)buffer, 8);\n\n    output->WriteUInt64(mTimeReference);\n\n    output->WriteUInt16(mVersion);\n    int reserved_count = 254;\n    if (mVersion > 0) {\n        output->Write(mUMID64, sizeof(mUMID64));\n        reserved_count -= 64;\n        if (mVersion > 1) {\n            output->WriteInt16(mLoudnessValue);\n            output->WriteInt16(mLoudnessRange);\n            output->WriteInt16(mMaxTruePeakLevel);\n            output->WriteInt16(mMaxMomentaryLoudness);\n            output->WriteInt16(mMaxShortTermLoudness);\n            reserved_count -= 10;\n        }\n    }\n    output->WriteZeros(reserved_count);\n\n    if (!mCodingHistory.empty())\n        output->Write((const unsigned char*)mCodingHistory.c_str(), mCodingHistory.size() + 1);\n}\n\nvoid WaveBEXT::Read(WaveIO *input, uint32_t size)\n{\n    int64_t start_pos = input->Tell();\n\n    input->ReadString(mDescription, STRING_SIZE(mDescription));\n    input->ReadString(mOriginator, STRING_SIZE(mOriginator));\n    input->ReadString(mOriginatorReference, STRING_SIZE(mOriginatorReference));\n\n    char buffer[20];\n    unsigned int year, month, day, hour, min, sec;\n    input->ReadString(buffer, 10);\n    buffer[10] = ' ';\n    input->ReadString(&buffer[11], 8);\n    buffer[19] = '\\0';\n    if (sscanf(buffer, \"%u%*c%u%*c%u%*c%u%*c%u%*c%u\", &year, &month, &day, &hour, &min, &sec) != 6) {\n        log_warn(\"Failed to parse bext timestamp %s\\n\", buffer);\n    } else {\n        mOriginatorTimestamp.year  = year;\n        mOriginatorTimestamp.month = month;\n        mOriginatorTimestamp.day   = day;\n        mOriginatorTimestamp.hour  = hour;\n        mOriginatorTimestamp.min   = min;\n        mOriginatorTimestamp.sec   = sec;\n    }\n\n    mTimeReference = input->ReadUInt64();\n\n    mVersion = input->ReadUInt16();\n    int reserved_count = 254;\n    if (mVersion > 0) {\n        BMX_CHECK(input->Read(mUMID64, sizeof(mUMID64)) == sizeof(mUMID64));\n        reserved_count -= 64;\n        if (mVersion > 1) {\n            mLoudnessValue        = input->ReadInt16();\n            mLoudnessRange        = input->ReadInt16();\n            mMaxTruePeakLevel     = input->ReadInt16();\n            mMaxMomentaryLoudness = input->ReadInt16();\n            mMaxShortTermLoudness = input->ReadInt16();\n            reserved_count -= 10;\n        }\n    }\n    input->Seek(reserved_count, SEEK_CUR);\n\n    int64_t bext_remainder = size - (input->Tell() - start_pos);\n    BMX_CHECK(bext_remainder >= 0);\n    if (bext_remainder > 0) {\n        char *coding_history_buffer = 0;\n        try\n        {\n            coding_history_buffer = new char[bext_remainder + 1];\n            input->ReadString(coding_history_buffer, bext_remainder);\n            coding_history_buffer[bext_remainder] = '\\0';\n            mCodingHistory = coding_history_buffer;\n\n            delete [] coding_history_buffer;\n        }\n        catch (...)\n        {\n            delete [] coding_history_buffer;\n            throw;\n        }\n    }\n}\n\nstring WaveBEXT::ConvertToASCII(string input)\n{\n    string output = input;\n\n    size_t i;\n    for (i = 0; i < output.size(); i++) {\n        if ((unsigned char)output[i] > 0x7f)\n            output[i] = ' ';\n    }\n\n    return output;\n}\n\n<commit_msg>wave bext: check coding history size limits and explicit casts for vs8<commit_after>\/*\n * Copyright (C) 2012, British Broadcasting Corporation\n * All Rights Reserved.\n *\n * Author: Philip de Nier\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n *     * Redistributions of source code must retain the above copyright notice,\n *       this list of conditions and the following disclaimer.\n *     * Redistributions in binary form must reproduce the above copyright\n *       notice, this list of conditions and the following disclaimer in the\n *       documentation and\/or other materials provided with the distribution.\n *     * Neither the name of the British Broadcasting Corporation nor the names\n *       of its contributors may be used to endorse or promote products derived\n *       from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#ifdef HAVE_CONFIG_H\n#include \"config.h\"\n#endif\n\n#define __STDC_LIMIT_MACROS\n\n#include <cstring>\n#include <cstdio>\n\n#include <bmx\/wave\/WaveBEXT.h>\n#include <bmx\/Utils.h>\n#include <bmx\/BMXException.h>\n#include <bmx\/Logging.h>\n\nusing namespace std;\nusing namespace bmx;\n\n\n\/\/ string size equals var size - extra null terminator\n#define STRING_SIZE(var)   (sizeof(var) - 1)\n\n\nextern bool BMX_REGRESSION_TEST;\n\n\n\nWaveBEXT::WaveBEXT()\n{\n    SetDescription(\"\");\n    SetOriginator(\"\");\n    SetOriginatorReference(\"\");\n    if (BMX_REGRESSION_TEST)\n        memset(&mOriginatorTimestamp, 0, sizeof(mOriginatorTimestamp));\n    else\n        SetOriginatorTimestamp(generate_timestamp_now());\n    mTimeReference = 0;\n    mVersion = 0;\n    if (BMX_REGRESSION_TEST)\n        memset(mUMID64, 0, sizeof(mUMID64));\n    else\n        SetUMID(generate_umid());\n    mLoudnessValue = 0;\n    mLoudnessRange = 0;\n    mMaxTruePeakLevel = 0;\n    mMaxMomentaryLoudness = 0;\n    mMaxShortTermLoudness = 0;\n}\n\nWaveBEXT::~WaveBEXT()\n{\n}\n\nvoid WaveBEXT::SetDescription(string description)\n{\n    string ascii = ConvertToASCII(description);\n\n    strncpy(mDescription, ascii.c_str(), STRING_SIZE(mDescription));\n    if (ascii.size() < STRING_SIZE(mDescription))\n        memset(mDescription + ascii.size(), 0, STRING_SIZE(mDescription) - ascii.size());\n}\n\nvoid WaveBEXT::SetOriginator(string originator)\n{\n    string ascii = ConvertToASCII(originator);\n\n    strncpy(mOriginator, ascii.c_str(), STRING_SIZE(mOriginator));\n    if (ascii.size() < STRING_SIZE(mOriginator))\n        memset(mOriginator + ascii.size(), 0, STRING_SIZE(mOriginator) - ascii.size());\n}\n\nvoid WaveBEXT::SetOriginatorReference(string reference)\n{\n    string ascii = ConvertToASCII(reference);\n\n    strncpy(mOriginatorReference, ascii.c_str(), STRING_SIZE(mOriginatorReference));\n    if (ascii.size() < STRING_SIZE(mOriginatorReference))\n        memset(mOriginatorReference + ascii.size(), 0, STRING_SIZE(mOriginatorReference) - ascii.size());\n}\n\nvoid WaveBEXT::SetOriginatorTimestamp(Timestamp timestamp)\n{\n    if ((timestamp.year  < 0  || timestamp.year  > 9999) ||\n        (timestamp.month < 1  || timestamp.month > 12) ||\n        (timestamp.day   < 1  || timestamp.day   > 31) ||\n        timestamp.hour   > 23 ||\n        timestamp.min    > 59 ||\n        timestamp.sec    > 59)\n    {\n        log_warn(\"Ignoring invalid originator timestamp\\n\");\n        return;\n    }\n\n    mOriginatorTimestamp = timestamp;\n}\n\nvoid WaveBEXT::SetTimeReference(uint64_t reference)\n{\n    mTimeReference = reference;\n}\n\nvoid WaveBEXT::SetUMID(UMID umid)\n{\n    memcpy(mUMID64, &umid.octet0, 32);\n    memset(&mUMID64[32], 0, 32);\n\n    if (mVersion < 1)\n        mVersion = 1;\n}\n\nvoid WaveBEXT::SetLoudnessValue(int16_t value)\n{\n    mLoudnessValue = value;\n\n    if (mVersion < 2)\n        mVersion = 2;\n}\n\nvoid WaveBEXT::SetLoudnessRange(int16_t range)\n{\n    mLoudnessRange = range;\n\n    if (mVersion < 2)\n        mVersion = 2;\n}\n\nvoid WaveBEXT::SetMaxTruePeakLevel(int16_t level)\n{\n    mMaxTruePeakLevel = level;\n\n    if (mVersion < 2)\n        mVersion = 2;\n}\n\nvoid WaveBEXT::SetMaxMomentaryLoudness(int16_t loudness)\n{\n    mMaxMomentaryLoudness = loudness;\n\n    if (mVersion < 2)\n        mVersion = 2;\n}\n\nvoid WaveBEXT::SetMaxShortTermLoudness(int16_t loudness)\n{\n    mMaxShortTermLoudness = loudness;\n\n    if (mVersion < 2)\n        mVersion = 2;\n}\n\nvoid WaveBEXT::AppendCodingHistory(string line)\n{\n    mCodingHistory.append(ConvertToASCII(line)).append(1, 0x0d).append(1, 0x0a);\n}\n\nvoid WaveBEXT::AppendCodingHistory(vector<pair<string, string> > line)\n{\n    \/\/ append line: <name>=<value>,...\n    string line_str;\n    size_t i;\n    for (i = 0; i < line.size(); i++) {\n        if (i != 0)\n            line_str.append(\",\");\n        line_str.append(line[i].first).append(\"=\").append(line[i].second);\n    }\n\n    AppendCodingHistory(line_str);\n}\n\nvoid WaveBEXT::Write(WaveIO *output)\n{\n    size_t coding_history_size = mCodingHistory.size();\n    if (coding_history_size > 0) {\n        if (602 + (uint64_t)coding_history_size > UINT32_MAX - 2) {\n            log_warn(\"Truncating coding history to keep within the 32-bit chunk size limit\\n\");\n            coding_history_size = UINT32_MAX - 2 - 602;\n        }\n        coding_history_size += 1; \/\/ null terminator\n    }\n\n    output->WriteTag(\"bext\");\n    output->WriteSize((uint32_t)(602 + coding_history_size));\n\n    output->Write((const unsigned char*)mDescription, STRING_SIZE(mDescription));\n    output->Write((const unsigned char*)mOriginator, STRING_SIZE(mOriginator));\n    output->Write((const unsigned char*)mOriginatorReference, STRING_SIZE(mOriginatorReference));\n\n    char buffer[32];\n    sprintf(buffer, \"%04u-%02u-%02u\", mOriginatorTimestamp.year, mOriginatorTimestamp.month, mOriginatorTimestamp.day);\n    output->Write((const unsigned char*)buffer, 10);\n\n    sprintf(buffer, \"%02u:%02u:%02u\", mOriginatorTimestamp.hour, mOriginatorTimestamp.min, mOriginatorTimestamp.sec);\n    output->Write((const unsigned char*)buffer, 8);\n\n    output->WriteUInt64(mTimeReference);\n\n    output->WriteUInt16(mVersion);\n    int reserved_count = 254;\n    if (mVersion > 0) {\n        output->Write(mUMID64, sizeof(mUMID64));\n        reserved_count -= 64;\n        if (mVersion > 1) {\n            output->WriteInt16(mLoudnessValue);\n            output->WriteInt16(mLoudnessRange);\n            output->WriteInt16(mMaxTruePeakLevel);\n            output->WriteInt16(mMaxMomentaryLoudness);\n            output->WriteInt16(mMaxShortTermLoudness);\n            reserved_count -= 10;\n        }\n    }\n    output->WriteZeros(reserved_count);\n\n    if (!mCodingHistory.empty())\n        output->Write((const unsigned char*)mCodingHistory.c_str(), (uint32_t)(coding_history_size));\n}\n\nvoid WaveBEXT::Read(WaveIO *input, uint32_t size)\n{\n    int64_t start_pos = input->Tell();\n\n    input->ReadString(mDescription, STRING_SIZE(mDescription));\n    input->ReadString(mOriginator, STRING_SIZE(mOriginator));\n    input->ReadString(mOriginatorReference, STRING_SIZE(mOriginatorReference));\n\n    char buffer[20];\n    unsigned int year, month, day, hour, min, sec;\n    input->ReadString(buffer, 10);\n    buffer[10] = ' ';\n    input->ReadString(&buffer[11], 8);\n    buffer[19] = '\\0';\n    if (sscanf(buffer, \"%u%*c%u%*c%u%*c%u%*c%u%*c%u\", &year, &month, &day, &hour, &min, &sec) != 6) {\n        log_warn(\"Failed to parse bext timestamp %s\\n\", buffer);\n    } else {\n        mOriginatorTimestamp.year  = year;\n        mOriginatorTimestamp.month = month;\n        mOriginatorTimestamp.day   = day;\n        mOriginatorTimestamp.hour  = hour;\n        mOriginatorTimestamp.min   = min;\n        mOriginatorTimestamp.sec   = sec;\n    }\n\n    mTimeReference = input->ReadUInt64();\n\n    mVersion = input->ReadUInt16();\n    int reserved_count = 254;\n    if (mVersion > 0) {\n        BMX_CHECK(input->Read(mUMID64, sizeof(mUMID64)) == sizeof(mUMID64));\n        reserved_count -= 64;\n        if (mVersion > 1) {\n            mLoudnessValue        = input->ReadInt16();\n            mLoudnessRange        = input->ReadInt16();\n            mMaxTruePeakLevel     = input->ReadInt16();\n            mMaxMomentaryLoudness = input->ReadInt16();\n            mMaxShortTermLoudness = input->ReadInt16();\n            reserved_count -= 10;\n        }\n    }\n    input->Seek(reserved_count, SEEK_CUR);\n\n    int64_t bext_remainder = size - (input->Tell() - start_pos);\n    BMX_CHECK(bext_remainder >= 0);\n    if (bext_remainder > 0) {\n        char *coding_history_buffer = 0;\n        uint32_t coding_history_size = (uint32_t)bext_remainder;\n        try\n        {\n            coding_history_buffer = new char[coding_history_size + 1];\n            input->ReadString(coding_history_buffer, coding_history_size);\n            coding_history_buffer[coding_history_size] = '\\0';\n            mCodingHistory = coding_history_buffer;\n\n            delete [] coding_history_buffer;\n        }\n        catch (...)\n        {\n            delete [] coding_history_buffer;\n            throw;\n        }\n    }\n}\n\nstring WaveBEXT::ConvertToASCII(string input)\n{\n    string output = input;\n\n    size_t i;\n    for (i = 0; i < output.size(); i++) {\n        if ((unsigned char)output[i] > 0x7f)\n            output[i] = ' ';\n    }\n\n    return output;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"stdafx.h\"\n#include <windows.h>\n#include <gl\\gl.h>\n#include <gl\\glu.h>\n\/\/*********seems to not work anymore and not needed too************\n\/\/#include <gl\\glaux.h>\t\t\/\/ Header File For The Glaux Library\n#include \"3DEngine.h\"\n\nHDC hDC = NULL;\nHGLRC hRC = NULL;\nHWND hWnd = NULL;\nHINSTANCE hInstance;\n\nbool keys[256];\nbool active = TRUE;\nbool fullscreen = TRUE;\n\nLRESULT CALLBACK WndProc(HWND, UINT, WPARAM, LPARAM);\n\nGLvoid ReSizeGLScene(GLsizei width, GLsizei height)\n{\n    if (height == 0)\n    {\n        height = 1;\n    }\n\n    glViewport(0, 0, width, height);\n\n    glMatrixMode(GL_PROJECTION);\n    glLoadIdentity();\n\n    float fieldOfView = 45.0f;\n    float aspectRatio = (GLfloat)width \/ (GLfloat)height;\n    float zNear = 0.01f;\n    float zFar = 100.0f;\n    gluPerspective(fieldOfView, aspectRatio, zNear, zFar);\n\n    glMatrixMode(GL_MODELVIEW);\n    glLoadIdentity();\n}\n\nint InitGL(GLvoid)\n{\n    glShadeModel(GL_SMOOTH);\n    glClearColor(255.0f, 255.0f, 255.0f, 0.5f);\n    glClearDepth(1.0f);\n    glEnable(GL_DEPTH_TEST);\n    glDepthFunc(GL_LEQUAL);\n    glHint(GL_PERSPECTIVE_CORRECTION_HINT, GL_NICEST);\n    return TRUE;\n}\n\nint DrawGLScene(GLvoid)\n{\n    glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n    glLoadIdentity();\n    return TRUE;\n}\n\nGLvoid KillGLWindow(GLvoid)\n{\n    if (fullscreen)\n    {\n        ChangeDisplaySettings(NULL, 0);\n        ShowCursor(TRUE);\n    }\n\n    if (hRC)\n    {\n        if (!wglMakeCurrent(NULL, NULL))\n        {\n            MessageBox(NULL, _T(\"Release Of DC And RC Failed.\"), _T(\"SHUTDOWN ERROR\"), MB_OK | MB_ICONINFORMATION);\n        }\n\n        if (!wglDeleteContext(hRC))\n        {\n            MessageBox(NULL, _T(\"Release Rendering Context Failed.\"), _T(\"SHUTDOWN ERROR\"), MB_OK | MB_ICONINFORMATION);\n        }\n        hRC = NULL;\n    }\n\n    if (hDC && !ReleaseDC(hWnd, hDC))\n    {\n        MessageBox(NULL, _T(\"Release Device Context Failed.\"), _T(\"SHUTDOWN ERROR\"), MB_OK | MB_ICONINFORMATION);\n        hDC = NULL;\n    }\n\n    if (hWnd && !DestroyWindow(hWnd))\n    {\n        MessageBox(NULL, _T(\"Could Not Release hWnd.\"), _T(\"SHUTDOWN ERROR\"), MB_OK | MB_ICONINFORMATION);\n        hWnd = NULL;\n    }\n\n    if (!UnregisterClass(_T(\"OpenGL\"), hInstance))\n    {\n        MessageBox(NULL, _T(\"Could Not Unregister Class.\"), _T(\"SHUTDOWN ERROR\"), MB_OK | MB_ICONINFORMATION);\n        hInstance = NULL;\n    }\n}\n\nBOOL CreateGLWindow(char* title, int width, int height, int bits, bool fullscreenflag)\n{\n    GLuint PixelFormat;\n    WNDCLASS wc;\n    DWORD dwExStyle;\n    DWORD dwStyle;\n    RECT WindowRect;\n    WindowRect.left = (long)0;\n    WindowRect.right = (long)width;\n    WindowRect.top = (long)0;\n    WindowRect.bottom = (long)height;\n\n    fullscreen = fullscreenflag;\n\n    hInstance = GetModuleHandle(NULL);\n    wc.style = CS_HREDRAW | CS_VREDRAW | CS_OWNDC;\n    wc.lpfnWndProc = (WNDPROC)WndProc;\n    wc.cbClsExtra = 0;\n    wc.cbWndExtra = 0;\n    wc.hInstance = hInstance;\n    wc.hIcon = LoadIcon(NULL, IDI_WINLOGO);\n    wc.hCursor = LoadCursor(NULL, IDC_ARROW);\n    wc.hbrBackground = NULL;\n    wc.lpszMenuName = NULL;\n    wc.lpszClassName = _T(\"OpenGL\");\n\n    if (!RegisterClass(&wc))\n    {\n        MessageBox(NULL, _T(\"Failed To Register The Window Class.\"), _T(\"ERROR\"), MB_OK | MB_ICONEXCLAMATION);\n        return FALSE;\n    }\n\n    if (fullscreen)\n    {\n        DEVMODE dmScreenSettings;\n        memset(&dmScreenSettings, 0, sizeof(dmScreenSettings));\n        dmScreenSettings.dmSize = sizeof(dmScreenSettings);\n        dmScreenSettings.dmPelsWidth = width;\n        dmScreenSettings.dmPelsHeight = height;\n        dmScreenSettings.dmBitsPerPel = bits;\n        dmScreenSettings.dmFields = DM_BITSPERPEL | DM_PELSWIDTH | DM_PELSHEIGHT;\n\n        if (ChangeDisplaySettings(&dmScreenSettings, CDS_FULLSCREEN) != DISP_CHANGE_SUCCESSFUL)\n        {\n            if (MessageBox(NULL, _T(\"The Requested Fullscreen Mode Is Not Supported By\\nYour Video Card. Use Windowed Mode Instead?\"), _T(\"NeHe GL\"), MB_YESNO | MB_ICONEXCLAMATION) == IDYES)\n            {\n                fullscreen = FALSE;\n            }\n            else\n            {\n                MessageBox(NULL, _T(\"Program Will Now Close.\"), _T(\"ERROR\"), MB_OK | MB_ICONSTOP);\n                return FALSE;\n            }\n        }\n    }\n\n    if (fullscreen)\n    {\n        dwExStyle = WS_EX_APPWINDOW;\n        dwStyle = WS_POPUP;\n        ShowCursor(FALSE);\n    }\n    else\n    {\n        dwExStyle = WS_EX_APPWINDOW | WS_EX_WINDOWEDGE;\n        dwStyle = WS_OVERLAPPEDWINDOW;\n    }\n\n    AdjustWindowRectEx(&WindowRect, dwStyle, FALSE, dwExStyle);\n\n    if (!(hWnd = CreateWindowEx(dwExStyle,\n        _T(\"OpenGL\"),\n        _T(\"Title\"),\n        dwStyle |\n        WS_CLIPSIBLINGS |\n        WS_CLIPCHILDREN,\n        0, 0,\n        WindowRect.right - WindowRect.left,\n        WindowRect.bottom - WindowRect.top,\n        NULL,\n        NULL,\n        hInstance,\n        NULL)))\n    {\n        KillGLWindow();\n        MessageBox(NULL, _T(\"Window Creation Error.\"), _T(\"ERROR\"), MB_OK | MB_ICONEXCLAMATION);\n        return FALSE;\n    }\n\n    static\tPIXELFORMATDESCRIPTOR pfd =\n    {\n        sizeof(PIXELFORMATDESCRIPTOR),\n        1,\n        PFD_DRAW_TO_WINDOW |\n        PFD_SUPPORT_OPENGL |\n        PFD_DOUBLEBUFFER,\n        PFD_TYPE_RGBA,\n        bits,\n        0, 0, 0, 0, 0, 0,\n        0,\n        0,\n        0,\n        0, 0, 0, 0,\n        16,\n        0,\n        0,\n        PFD_MAIN_PLANE,\n        0,\n        0, 0, 0\n    };\n\n    if (!(hDC = GetDC(hWnd)))\n    {\n        KillGLWindow();\n        MessageBox(NULL, _T(\"Can't Create A GL Device Context.\"), _T(\"ERROR\"), MB_OK | MB_ICONEXCLAMATION);\n        return FALSE;\n    }\n\n    if (!(PixelFormat = ChoosePixelFormat(hDC, &pfd)))\n    {\n        KillGLWindow();\n        MessageBox(NULL, _T(\"Can't Find A Suitable PixelFormat.\"), _T(\"ERROR\"), MB_OK | MB_ICONEXCLAMATION);\n        return FALSE;\n    }\n\n    if (!SetPixelFormat(hDC, PixelFormat, &pfd))\n    {\n        KillGLWindow();\n        MessageBox(NULL, _T(\"Can't Set The PixelFormat.\"), _T(\"ERROR\"), MB_OK | MB_ICONEXCLAMATION);\n        return FALSE;\n    }\n\n    if (!(hRC = wglCreateContext(hDC)))\n    {\n        KillGLWindow();\n        MessageBox(NULL, _T(\"Can't Create A GL Rendering Context.\"), _T(\"ERROR\"), MB_OK | MB_ICONEXCLAMATION);\n        return FALSE;\n    }\n\n    if (!wglMakeCurrent(hDC, hRC))\n    {\n        KillGLWindow();\n        MessageBox(NULL, _T(\"Can't Activate The GL Rendering Context.\"), _T(\"ERROR\"), MB_OK | MB_ICONEXCLAMATION);\n        return FALSE;\n    }\n\n    ShowWindow(hWnd, SW_SHOW);\n    SetForegroundWindow(hWnd);\n    SetFocus(hWnd);\n    ReSizeGLScene(width, height);\n\n    if (!InitGL())\n    {\n        KillGLWindow();\n        MessageBox(NULL, _T(\"Initialization Failed.\"), _T(\"ERROR\"), MB_OK | MB_ICONEXCLAMATION);\n        return FALSE;\n    }\n\n    return TRUE;\n}\n\nLRESULT CALLBACK WndProc(HWND hWnd, UINT uMsg, WPARAM wParam, LPARAM lParam)\n{\n    switch (uMsg)\n    {\n    case WM_ACTIVATE:\n    {\n        if (!HIWORD(wParam))\n        {\n            active = TRUE;\n        }\n        else\n        {\n            active = FALSE;\n        }\n\n        return 0;\n    }\n\n    case WM_SYSCOMMAND:\n    {\n        switch (wParam)\n        {\n        case SC_SCREENSAVE:\n        case SC_MONITORPOWER:\n            return 0;\n        }\n        break;\n    }\n\n    case WM_CLOSE:\n    {\n        PostQuitMessage(0);\n        return 0;\n    }\n\n    case WM_KEYDOWN:\n    {\n        keys[wParam] = TRUE;\n        return 0;\n    }\n\n    case WM_KEYUP:\n    {\n        keys[wParam] = FALSE;\n        return 0;\n    }\n\n    case WM_SIZE:\n    {\n        ReSizeGLScene(LOWORD(lParam), HIWORD(lParam));\n        return 0;\n    }\n    }\n\n    return DefWindowProc(hWnd, uMsg, wParam, lParam);\n}\n\nint WINAPI WinMain(HINSTANCE hInstance, HINSTANCE hPrevInstance, LPSTR lpCmdLine, int nCmdShow)\n{\n    MSG msg;\n    BOOL done = FALSE;\n\n    if (MessageBox(NULL, _T(\"Would You Like To Run In Fullscreen Mode?\"), _T(\"Start FullScreen?\"), MB_YESNO | MB_ICONQUESTION) == IDNO)\n    {\n        fullscreen = FALSE;\n    }\n\n    if (!CreateGLWindow(\"NeHe's OpenGL Framework\", 640, 480, 16, fullscreen))\n    {\n        return 0;\n    }\n\n    while (!done)\n    {\n        if (PeekMessage(&msg, NULL, 0, 0, PM_REMOVE))\n        {\n            if (msg.message == WM_QUIT)\n            {\n                done = TRUE;\n            }\n            else\n            {\n                TranslateMessage(&msg);\n                DispatchMessage(&msg);\n            }\n        }\n        else\n        {\n            if (active)\n            {\n                if (keys[VK_ESCAPE])\n                {\n                    done = TRUE;\n                }\n                else\n                {\n                    DrawGLScene();\n                    SwapBuffers(hDC);\n                }\n            }\n\n            if (keys[VK_F1])\n            {\n                keys[VK_F1] = FALSE;\n                KillGLWindow();\n                fullscreen = !fullscreen;\n\n                if (!CreateGLWindow(\"NeHe's OpenGL Framework\", 640, 480, 16, fullscreen))\n                {\n                    return 0;\n                }\n            }\n        }\n    }\n    \n    KillGLWindow();\n    return (msg.wParam);\n}<commit_msg>better code organization<commit_after>#include \"stdafx.h\"\n#include <windows.h>\n#include <gl\\gl.h>\n#include <gl\\glu.h>\n#include \"3DEngine.h\"\n\nHDC deviceContext = NULL;\nHGLRC renderingContext = NULL;\nHWND windowHandle = NULL;\nHINSTANCE applicationInstance;\nLRESULT CALLBACK WndProc(HWND, UINT, WPARAM, LPARAM);\nbool keys[256];\nbool hasFocus = TRUE;\n\nconst LPCWSTR ERROR_MESSAGE = _T(\"ERROR\");\nconst LPCWSTR SHUTDOWN_ERROR_MESSAGE = _T(\"SHUTDOWN ERROR\");\n\nGLvoid ReSizeGLScene(GLsizei width, GLsizei height)\n{\n    if (height == 0)\n    {\n        height = 1;\n    }\n\n    float zNear = 0.01f;\n    float zFar = 100.0f;\n    float fieldOfView = 45.0f;\n    GLfloat aspectRatio = (GLfloat)width \/ (GLfloat)height;\n\n    RECT desktop;\n    const HWND hDesktop = GetDesktopWindow();\n    GetWindowRect(hDesktop, &desktop);\n    float screenCenterX = desktop.right \/ 2;\n    float screenCenterY = desktop.bottom \/ 2;\n\n    glViewport(0, 0, width, height);\n    glMatrixMode(GL_PROJECTION);\n    glLoadIdentity();\n    gluPerspective(fieldOfView, aspectRatio, zNear, zFar);\n    glMatrixMode(GL_MODELVIEW);\n    glLoadIdentity();\n}\n\nint InitGL(GLvoid)\n{\n    glShadeModel(GL_SMOOTH);\n    glClearColor(255.0f, 255.0f, 255.0f, 0.5f);\n    glClearDepth(1.0f);\n    glEnable(GL_DEPTH_TEST);\n    glDepthFunc(GL_LEQUAL);\n    glHint(GL_PERSPECTIVE_CORRECTION_HINT, GL_NICEST);\n    return TRUE;\n}\n\nint DrawGLScene(GLvoid)\n{\n    glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n    glLoadIdentity();\n    return TRUE;\n}\n\nGLvoid KillGLWindow(GLvoid)\n{\n    if (renderingContext)\n    {\n        if (!wglMakeCurrent(NULL, NULL))\n        {\n            MessageBox(NULL, _T(\"Release Of DC And RC Failed.\"), SHUTDOWN_ERROR_MESSAGE, MB_OK | MB_ICONINFORMATION);\n        }\n\n        if (!wglDeleteContext(renderingContext))\n        {\n            MessageBox(NULL, _T(\"Release Rendering Context Failed.\"), SHUTDOWN_ERROR_MESSAGE, MB_OK | MB_ICONINFORMATION);\n        }\n        renderingContext = NULL;\n    }\n\n    if (deviceContext && !ReleaseDC(windowHandle, deviceContext))\n    {\n        MessageBox(NULL, _T(\"Release Device Context Failed.\"), SHUTDOWN_ERROR_MESSAGE, MB_OK | MB_ICONINFORMATION);\n        deviceContext = NULL;\n    }\n\n    if (windowHandle && !DestroyWindow(windowHandle))\n    {\n        MessageBox(NULL, _T(\"Could Not Release windowHandle.\"), SHUTDOWN_ERROR_MESSAGE, MB_OK | MB_ICONINFORMATION);\n        windowHandle = NULL;\n    }\n\n    if (!UnregisterClass(_T(\"OpenGL\"), applicationInstance))\n    {\n        MessageBox(NULL, _T(\"Could Not Unregister Class.\"), SHUTDOWN_ERROR_MESSAGE, MB_OK | MB_ICONINFORMATION);\n        applicationInstance = NULL;\n    }\n}\n\nBOOL CreateGLWindow(LPCWSTR title, int width, int height, int bits)\n{\n    GLuint PixelFormat;\n    WNDCLASS wc;\n    DWORD dwExStyle;\n    DWORD dwStyle;\n    RECT WindowRect;\n    WindowRect.left = (long)0;\n    WindowRect.right = (long)width;\n    WindowRect.top = (long)0;\n    WindowRect.bottom = (long)height;\n\n    applicationInstance = GetModuleHandle(NULL);\n    wc.style = CS_HREDRAW | CS_VREDRAW | CS_OWNDC;\n    wc.lpfnWndProc = (WNDPROC)WndProc;\n    wc.cbClsExtra = 0;\n    wc.cbWndExtra = 0;\n    wc.hInstance = applicationInstance;\n    wc.hIcon = LoadIcon(NULL, IDI_WINLOGO);\n    wc.hCursor = LoadCursor(NULL, IDC_ARROW);\n    wc.hbrBackground = NULL;\n    wc.lpszMenuName = NULL;\n    wc.lpszClassName = _T(\"OpenGL\");\n\n    if (!RegisterClass(&wc))\n    {\n        MessageBox(NULL, _T(\"Failed To Register The Window Class.\"), ERROR_MESSAGE, MB_OK | MB_ICONEXCLAMATION);\n        return FALSE;\n    }\n\n    dwExStyle = WS_EX_APPWINDOW | WS_EX_WINDOWEDGE;\n    dwStyle = WS_OVERLAPPEDWINDOW;\n\n    AdjustWindowRectEx(&WindowRect, dwStyle, FALSE, dwExStyle);\n\n    if (!(windowHandle = CreateWindowEx(dwExStyle,\n        _T(\"OpenGL\"),\n        title,\n        dwStyle |\n        WS_CLIPSIBLINGS |\n        WS_CLIPCHILDREN,\n        0, 0,\n        WindowRect.right - WindowRect.left,\n        WindowRect.bottom - WindowRect.top,\n        NULL,\n        NULL,\n        applicationInstance,\n        NULL)))\n    {\n        KillGLWindow();\n        MessageBox(NULL, _T(\"Window Creation Error.\"), ERROR_MESSAGE, MB_OK | MB_ICONEXCLAMATION);\n        return FALSE;\n    }\n\n    static PIXELFORMATDESCRIPTOR pfd =\n    {\n        sizeof(PIXELFORMATDESCRIPTOR),\n        1,\n        PFD_DRAW_TO_WINDOW |\n        PFD_SUPPORT_OPENGL |\n        PFD_DOUBLEBUFFER,\n        PFD_TYPE_RGBA,\n        bits,\n        0, 0, 0, 0, 0, 0,\n        0,\n        0,\n        0,\n        0, 0, 0, 0,\n        16,\n        0,\n        0,\n        PFD_MAIN_PLANE,\n        0,\n        0, 0, 0\n    };\n\n    if (!(deviceContext = GetDC(windowHandle)))\n    {\n        KillGLWindow();\n        MessageBox(NULL, _T(\"Can't Create A GL Device Context.\"), ERROR_MESSAGE, MB_OK | MB_ICONEXCLAMATION);\n        return FALSE;\n    }\n\n    if (!(PixelFormat = ChoosePixelFormat(deviceContext, &pfd)))\n    {\n        KillGLWindow();\n        MessageBox(NULL, _T(\"Can't Find A Suitable PixelFormat.\"), ERROR_MESSAGE, MB_OK | MB_ICONEXCLAMATION);\n        return FALSE;\n    }\n\n    if (!SetPixelFormat(deviceContext, PixelFormat, &pfd))\n    {\n        KillGLWindow();\n        MessageBox(NULL, _T(\"Can't Set The PixelFormat.\"), ERROR_MESSAGE, MB_OK | MB_ICONEXCLAMATION);\n        return FALSE;\n    }\n\n    if (!(renderingContext = wglCreateContext(deviceContext)))\n    {\n        KillGLWindow();\n        MessageBox(NULL, _T(\"Can't Create A GL Rendering Context.\"), ERROR_MESSAGE, MB_OK | MB_ICONEXCLAMATION);\n        return FALSE;\n    }\n\n    if (!wglMakeCurrent(deviceContext, renderingContext))\n    {\n        KillGLWindow();\n        MessageBox(NULL, _T(\"Can't Activate The GL Rendering Context.\"), ERROR_MESSAGE, MB_OK | MB_ICONEXCLAMATION);\n        return FALSE;\n    }\n\n    ShowWindow(windowHandle, SW_SHOW);\n    SetForegroundWindow(windowHandle);\n    SetFocus(windowHandle);\n    ReSizeGLScene(width, height);\n\n    if (!InitGL())\n    {\n        KillGLWindow();\n        MessageBox(NULL, _T(\"Initialization Failed.\"), ERROR_MESSAGE, MB_OK | MB_ICONEXCLAMATION);\n        return FALSE;\n    }\n\n    return TRUE;\n}\n\nLRESULT CALLBACK WndProc(HWND windowHandle, UINT uMsg, WPARAM wParam, LPARAM lParam)\n{\n    switch (uMsg)\n    {\n    case WM_ACTIVATE:\n    {\n        if (!HIWORD(wParam))\n        {\n            hasFocus = TRUE;\n        }\n        else\n        {\n            hasFocus = FALSE;\n        }\n\n        return 0;\n    }\n\n    case WM_SYSCOMMAND:\n    {\n        switch (wParam)\n        {\n        case SC_SCREENSAVE:\n        case SC_MONITORPOWER:\n            return 0;\n        }\n        break;\n    }\n\n    case WM_CLOSE:\n    {\n        PostQuitMessage(0);\n        return 0;\n    }\n\n    case WM_KEYDOWN:\n    {\n        keys[wParam] = TRUE;\n        return 0;\n    }\n\n    case WM_KEYUP:\n    {\n        keys[wParam] = FALSE;\n        return 0;\n    }\n\n    case WM_SIZE:\n    {\n        ReSizeGLScene(LOWORD(lParam), HIWORD(lParam));\n        return 0;\n    }\n    }\n\n    return DefWindowProc(windowHandle, uMsg, wParam, lParam);\n}\n\nint WINAPI WinMain(HINSTANCE applicationInstance, HINSTANCE hPrevInstance, LPSTR lpCmdLine, int nCmdShow)\n{\n    MSG msg;\n    BOOL done = FALSE;\n\n    int width = 1024;\n    int height = 768;\n    LPCWSTR title = _T(\"Polygonum\");\n\n    if (!CreateGLWindow(title, width, height, 16))\n    {\n        return 0;\n    }\n\n    while (!done)\n    {\n        if (PeekMessage(&msg, NULL, 0, 0, PM_REMOVE))\n        {\n            if (msg.message == WM_QUIT)\n            {\n                done = TRUE;\n            }\n            else\n            {\n                TranslateMessage(&msg);\n                DispatchMessage(&msg);\n            }\n        }\n        else\n        {\n            if (hasFocus)\n            {\n                if (keys[VK_ESCAPE])\n                {\n                    done = TRUE;\n                }\n                else\n                {\n                    DrawGLScene();\n                    SwapBuffers(deviceContext);\n                }\n            }\n        }\n    }\n\n    KillGLWindow();\n    return (msg.wParam);\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#if defined(ENABLE_GPU)\n\n#include \"content\/common\/gpu\/image_transport_surface.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/bind_helpers.h\"\n#include \"base\/command_line.h\"\n#include \"base\/debug\/trace_event.h\"\n#include \"content\/common\/gpu\/gpu_channel.h\"\n#include \"content\/common\/gpu\/gpu_channel_manager.h\"\n#include \"content\/common\/gpu\/gpu_command_buffer_stub.h\"\n#include \"content\/common\/gpu\/gpu_messages.h\"\n#include \"gpu\/command_buffer\/service\/gpu_scheduler.h\"\n#include \"ui\/gl\/gl_switches.h\"\n#include \"ui\/gl\/gl_implementation.h\"\n\nImageTransportSurface::ImageTransportSurface() {}\n\nImageTransportSurface::~ImageTransportSurface() {}\n\nvoid ImageTransportSurface::OnSetFrontSurfaceIsProtected(\n    bool is_protected, uint32 protection_state_id) {\n}\n\nvoid ImageTransportSurface::GetRegionsToCopy(\n    const gfx::Rect& previous_damage_rect,\n    const gfx::Rect& new_damage_rect,\n    std::vector<gfx::Rect>* regions) {\n  gfx::Rect intersection = previous_damage_rect.Intersect(new_damage_rect);\n\n  if (intersection.IsEmpty()) {\n    regions->push_back(previous_damage_rect);\n    return;\n  }\n\n  \/\/ Top (above the intersection).\n  regions->push_back(gfx::Rect(previous_damage_rect.x(),\n      previous_damage_rect.y(),\n      previous_damage_rect.width(),\n      intersection.y() - previous_damage_rect.y()));\n\n  \/\/ Left (of the intersection).\n  regions->push_back(gfx::Rect(previous_damage_rect.x(),\n      intersection.y(),\n      intersection.x() - previous_damage_rect.x(),\n      intersection.height()));\n\n  \/\/ Right (of the intersection).\n  regions->push_back(gfx::Rect(intersection.right(),\n      intersection.y(),\n      previous_damage_rect.right() - intersection.right(),\n      intersection.height()));\n\n  \/\/ Bottom (below the intersection).\n  regions->push_back(gfx::Rect(previous_damage_rect.x(),\n      intersection.bottom(),\n      previous_damage_rect.width(),\n      previous_damage_rect.bottom() - intersection.bottom()));\n}\n\nImageTransportHelper::ImageTransportHelper(ImageTransportSurface* surface,\n                                           GpuChannelManager* manager,\n                                           GpuCommandBufferStub* stub,\n                                           gfx::PluginWindowHandle handle)\n    : surface_(surface),\n      manager_(manager),\n      stub_(stub->AsWeakPtr()),\n      handle_(handle) {\n  route_id_ = manager_->GenerateRouteID();\n  manager_->AddRoute(route_id_, this);\n}\n\nImageTransportHelper::~ImageTransportHelper() {\n  manager_->RemoveRoute(route_id_);\n}\n\nbool ImageTransportHelper::Initialize() {\n  gpu::gles2::GLES2Decoder* decoder = Decoder();\n\n  if (!decoder)\n    return false;\n\n  decoder->SetResizeCallback(\n       base::Bind(&ImageTransportHelper::Resize, base::Unretained(this)));\n\n  return true;\n}\n\nvoid ImageTransportHelper::Destroy() {}\n\nbool ImageTransportHelper::OnMessageReceived(const IPC::Message& message) {\n  bool handled = true;\n  IPC_BEGIN_MESSAGE_MAP(ImageTransportHelper, message)\n    IPC_MESSAGE_HANDLER(AcceleratedSurfaceMsg_BufferPresented,\n                        OnBufferPresented)\n    IPC_MESSAGE_HANDLER(AcceleratedSurfaceMsg_SetFrontSurfaceIsProtected,\n                        OnSetFrontSurfaceIsProtected)\n    IPC_MESSAGE_HANDLER(AcceleratedSurfaceMsg_ResizeViewACK, OnResizeViewACK);\n    IPC_MESSAGE_UNHANDLED(handled = false)\n  IPC_END_MESSAGE_MAP()\n  return handled;\n}\n\nvoid ImageTransportHelper::SendAcceleratedSurfaceNew(\n    GpuHostMsg_AcceleratedSurfaceNew_Params params) {\n  params.surface_id = stub_->surface_id();\n  params.route_id = route_id_;\n#if defined(OS_MACOSX)\n  params.window = handle_;\n#endif\n  manager_->Send(new GpuHostMsg_AcceleratedSurfaceNew(params));\n}\n\nvoid ImageTransportHelper::SendAcceleratedSurfaceBuffersSwapped(\n    GpuHostMsg_AcceleratedSurfaceBuffersSwapped_Params params) {\n  \/\/ TRACE_EVENT for gpu tests:\n  TRACE_EVENT_INSTANT2(\"test_gpu\", \"SwapBuffers\",\n                       \"GLImpl\", static_cast<int>(gfx::GetGLImplementation()),\n                       \"width\", surface_->GetSize().width());\n  params.surface_id = stub_->surface_id();\n  params.route_id = route_id_;\n  params.size = surface_->GetSize();\n#if defined(OS_MACOSX)\n  params.window = handle_;\n#endif\n  manager_->Send(new GpuHostMsg_AcceleratedSurfaceBuffersSwapped(params));\n}\n\nvoid ImageTransportHelper::SendAcceleratedSurfacePostSubBuffer(\n    GpuHostMsg_AcceleratedSurfacePostSubBuffer_Params params) {\n  params.surface_id = stub_->surface_id();\n  params.route_id = route_id_;\n#if defined(OS_MACOSX)\n  params.window = handle_;\n#endif\n  manager_->Send(new GpuHostMsg_AcceleratedSurfacePostSubBuffer(params));\n}\n\nvoid ImageTransportHelper::SendAcceleratedSurfaceRelease(\n    GpuHostMsg_AcceleratedSurfaceRelease_Params params) {\n  params.surface_id = stub_->surface_id();\n  params.route_id = route_id_;\n  manager_->Send(new GpuHostMsg_AcceleratedSurfaceRelease(params));\n}\n\nvoid ImageTransportHelper::SendResizeView(const gfx::Size& size) {\n  manager_->Send(new GpuHostMsg_ResizeView(stub_->surface_id(),\n                                           route_id_,\n                                           size));\n}\n\nvoid ImageTransportHelper::SetScheduled(bool is_scheduled) {\n  gpu::GpuScheduler* scheduler = Scheduler();\n  if (!scheduler)\n    return;\n\n  scheduler->SetScheduled(is_scheduled);\n}\n\nvoid ImageTransportHelper::DeferToFence(base::Closure task) {\n  gpu::GpuScheduler* scheduler = Scheduler();\n  DCHECK(scheduler);\n\n  scheduler->DeferToFence(task);\n}\n\nvoid ImageTransportHelper::SetPreemptByCounter(\n    scoped_refptr<gpu::RefCountedCounter> preempt_by_counter) {\n  stub_->channel()->SetPreemptByCounter(preempt_by_counter);\n}\n\nbool ImageTransportHelper::MakeCurrent() {\n  gpu::gles2::GLES2Decoder* decoder = Decoder();\n  if (!decoder)\n    return false;\n  return decoder->MakeCurrent();\n}\n\nvoid ImageTransportHelper::SetSwapInterval(gfx::GLContext* context) {\n  if (CommandLine::ForCurrentProcess()->HasSwitch(switches::kDisableGpuVsync))\n    context->SetSwapInterval(0);\n  else\n    context->SetSwapInterval(1);\n}\n\nvoid ImageTransportHelper::Suspend() {\n  manager_->Send(new GpuHostMsg_AcceleratedSurfaceSuspend(stub_->surface_id()));\n}\n\ngpu::GpuScheduler* ImageTransportHelper::Scheduler() {\n  if (!stub_.get())\n    return NULL;\n  return stub_->scheduler();\n}\n\ngpu::gles2::GLES2Decoder* ImageTransportHelper::Decoder() {\n  if (!stub_.get())\n    return NULL;\n  return stub_->decoder();\n}\n\nvoid ImageTransportHelper::OnSetFrontSurfaceIsProtected(\n    bool is_protected, uint32 protection_state_id) {\n  surface_->OnSetFrontSurfaceIsProtected(is_protected, protection_state_id);\n}\n\nvoid ImageTransportHelper::OnBufferPresented(uint32 sync_point) {\n  surface_->OnBufferPresented(sync_point);\n}\n\nvoid ImageTransportHelper::OnResizeViewACK() {\n  surface_->OnResizeViewACK();\n}\n\nvoid ImageTransportHelper::Resize(gfx::Size size) {\n  \/\/ On windows, the surface is recreated and, in case the newly allocated\n  \/\/ surface happens to have the same address, it should be invalidated on the\n  \/\/ decoder so that future calls to MakeCurrent do not early out on the\n  \/\/ assumption that neither the context or surface have actually changed.\n#if defined(OS_WIN)\n  Decoder()->ReleaseCurrent();\n#endif\n\n  surface_->OnResize(size);\n\n#if defined(OS_ANDROID)\n  manager_->gpu_memory_manager()->ScheduleManage(true);\n#endif\n\n#if defined(OS_WIN)\n  Decoder()->MakeCurrent();\n  SetSwapInterval(Decoder()->GetGLContext());\n#endif\n}\n\nPassThroughImageTransportSurface::PassThroughImageTransportSurface(\n    GpuChannelManager* manager,\n    GpuCommandBufferStub* stub,\n    gfx::GLSurface* surface,\n    bool transport)\n    : GLSurfaceAdapter(surface),\n      transport_(transport),\n      did_set_swap_interval_(false) {\n  helper_.reset(new ImageTransportHelper(this,\n                                         manager,\n                                         stub,\n                                         gfx::kNullPluginWindow));\n}\n\nbool PassThroughImageTransportSurface::Initialize() {\n  \/\/ The surface is assumed to have already been initialized.\n  return helper_->Initialize();\n}\n\nvoid PassThroughImageTransportSurface::Destroy() {\n  helper_->Destroy();\n  GLSurfaceAdapter::Destroy();\n}\n\nbool PassThroughImageTransportSurface::SwapBuffers() {\n  bool result = gfx::GLSurfaceAdapter::SwapBuffers();\n\n  if (transport_) {\n    \/\/ Round trip to the browser UI thread, for throttling, by sending a dummy\n    \/\/ SwapBuffers message.\n    GpuHostMsg_AcceleratedSurfaceBuffersSwapped_Params params;\n    params.surface_handle = 0;\n    helper_->SendAcceleratedSurfaceBuffersSwapped(params);\n\n    helper_->SetScheduled(false);\n  }\n  return result;\n}\n\nbool PassThroughImageTransportSurface::PostSubBuffer(\n    int x, int y, int width, int height) {\n  bool result = gfx::GLSurfaceAdapter::PostSubBuffer(x, y, width, height);\n\n  if (transport_) {\n    \/\/ Round trip to the browser UI thread, for throttling, by sending a dummy\n    \/\/ PostSubBuffer message.\n    GpuHostMsg_AcceleratedSurfacePostSubBuffer_Params params;\n    params.surface_handle = 0;\n    params.x = x;\n    params.y = y;\n    params.width = width;\n    params.height = height;\n    helper_->SendAcceleratedSurfacePostSubBuffer(params);\n\n    helper_->SetScheduled(false);\n  }\n  return result;\n}\n\nbool PassThroughImageTransportSurface::OnMakeCurrent(gfx::GLContext* context) {\n  if (!did_set_swap_interval_) {\n    ImageTransportHelper::SetSwapInterval(context);\n    did_set_swap_interval_ = true;\n  }\n  return true;\n}\n\nvoid PassThroughImageTransportSurface::OnBufferPresented(uint32 sync_point) {\n  DCHECK(transport_);\n  helper_->SetScheduled(true);\n}\n\nvoid PassThroughImageTransportSurface::OnResizeViewACK() {\n  DCHECK(transport_);\n  Resize(new_size_);\n\n  helper_->SetScheduled(true);\n}\n\nvoid PassThroughImageTransportSurface::OnResize(gfx::Size size) {\n  new_size_ = size;\n\n  if (transport_) {\n    helper_->SendResizeView(size);\n    helper_->SetScheduled(false);\n  } else {\n    Resize(new_size_);\n  }\n}\n\ngfx::Size PassThroughImageTransportSurface::GetSize() {\n  return GLSurfaceAdapter::GetSize();\n}\n\nPassThroughImageTransportSurface::~PassThroughImageTransportSurface() {}\n\n#endif  \/\/ defined(ENABLE_GPU)\n<commit_msg>Don't release\/make-current the non-top level texture<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#if defined(ENABLE_GPU)\n\n#include \"content\/common\/gpu\/image_transport_surface.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/bind_helpers.h\"\n#include \"base\/command_line.h\"\n#include \"base\/debug\/trace_event.h\"\n#include \"content\/common\/gpu\/gpu_channel.h\"\n#include \"content\/common\/gpu\/gpu_channel_manager.h\"\n#include \"content\/common\/gpu\/gpu_command_buffer_stub.h\"\n#include \"content\/common\/gpu\/gpu_messages.h\"\n#include \"gpu\/command_buffer\/service\/gpu_scheduler.h\"\n#include \"ui\/gl\/gl_switches.h\"\n#include \"ui\/gl\/gl_implementation.h\"\n\nImageTransportSurface::ImageTransportSurface() {}\n\nImageTransportSurface::~ImageTransportSurface() {}\n\nvoid ImageTransportSurface::OnSetFrontSurfaceIsProtected(\n    bool is_protected, uint32 protection_state_id) {\n}\n\nvoid ImageTransportSurface::GetRegionsToCopy(\n    const gfx::Rect& previous_damage_rect,\n    const gfx::Rect& new_damage_rect,\n    std::vector<gfx::Rect>* regions) {\n  gfx::Rect intersection = previous_damage_rect.Intersect(new_damage_rect);\n\n  if (intersection.IsEmpty()) {\n    regions->push_back(previous_damage_rect);\n    return;\n  }\n\n  \/\/ Top (above the intersection).\n  regions->push_back(gfx::Rect(previous_damage_rect.x(),\n      previous_damage_rect.y(),\n      previous_damage_rect.width(),\n      intersection.y() - previous_damage_rect.y()));\n\n  \/\/ Left (of the intersection).\n  regions->push_back(gfx::Rect(previous_damage_rect.x(),\n      intersection.y(),\n      intersection.x() - previous_damage_rect.x(),\n      intersection.height()));\n\n  \/\/ Right (of the intersection).\n  regions->push_back(gfx::Rect(intersection.right(),\n      intersection.y(),\n      previous_damage_rect.right() - intersection.right(),\n      intersection.height()));\n\n  \/\/ Bottom (below the intersection).\n  regions->push_back(gfx::Rect(previous_damage_rect.x(),\n      intersection.bottom(),\n      previous_damage_rect.width(),\n      previous_damage_rect.bottom() - intersection.bottom()));\n}\n\nImageTransportHelper::ImageTransportHelper(ImageTransportSurface* surface,\n                                           GpuChannelManager* manager,\n                                           GpuCommandBufferStub* stub,\n                                           gfx::PluginWindowHandle handle)\n    : surface_(surface),\n      manager_(manager),\n      stub_(stub->AsWeakPtr()),\n      handle_(handle) {\n  route_id_ = manager_->GenerateRouteID();\n  manager_->AddRoute(route_id_, this);\n}\n\nImageTransportHelper::~ImageTransportHelper() {\n  manager_->RemoveRoute(route_id_);\n}\n\nbool ImageTransportHelper::Initialize() {\n  gpu::gles2::GLES2Decoder* decoder = Decoder();\n\n  if (!decoder)\n    return false;\n\n  decoder->SetResizeCallback(\n       base::Bind(&ImageTransportHelper::Resize, base::Unretained(this)));\n\n  return true;\n}\n\nvoid ImageTransportHelper::Destroy() {}\n\nbool ImageTransportHelper::OnMessageReceived(const IPC::Message& message) {\n  bool handled = true;\n  IPC_BEGIN_MESSAGE_MAP(ImageTransportHelper, message)\n    IPC_MESSAGE_HANDLER(AcceleratedSurfaceMsg_BufferPresented,\n                        OnBufferPresented)\n    IPC_MESSAGE_HANDLER(AcceleratedSurfaceMsg_SetFrontSurfaceIsProtected,\n                        OnSetFrontSurfaceIsProtected)\n    IPC_MESSAGE_HANDLER(AcceleratedSurfaceMsg_ResizeViewACK, OnResizeViewACK);\n    IPC_MESSAGE_UNHANDLED(handled = false)\n  IPC_END_MESSAGE_MAP()\n  return handled;\n}\n\nvoid ImageTransportHelper::SendAcceleratedSurfaceNew(\n    GpuHostMsg_AcceleratedSurfaceNew_Params params) {\n  params.surface_id = stub_->surface_id();\n  params.route_id = route_id_;\n#if defined(OS_MACOSX)\n  params.window = handle_;\n#endif\n  manager_->Send(new GpuHostMsg_AcceleratedSurfaceNew(params));\n}\n\nvoid ImageTransportHelper::SendAcceleratedSurfaceBuffersSwapped(\n    GpuHostMsg_AcceleratedSurfaceBuffersSwapped_Params params) {\n  \/\/ TRACE_EVENT for gpu tests:\n  TRACE_EVENT_INSTANT2(\"test_gpu\", \"SwapBuffers\",\n                       \"GLImpl\", static_cast<int>(gfx::GetGLImplementation()),\n                       \"width\", surface_->GetSize().width());\n  params.surface_id = stub_->surface_id();\n  params.route_id = route_id_;\n  params.size = surface_->GetSize();\n#if defined(OS_MACOSX)\n  params.window = handle_;\n#endif\n  manager_->Send(new GpuHostMsg_AcceleratedSurfaceBuffersSwapped(params));\n}\n\nvoid ImageTransportHelper::SendAcceleratedSurfacePostSubBuffer(\n    GpuHostMsg_AcceleratedSurfacePostSubBuffer_Params params) {\n  params.surface_id = stub_->surface_id();\n  params.route_id = route_id_;\n#if defined(OS_MACOSX)\n  params.window = handle_;\n#endif\n  manager_->Send(new GpuHostMsg_AcceleratedSurfacePostSubBuffer(params));\n}\n\nvoid ImageTransportHelper::SendAcceleratedSurfaceRelease(\n    GpuHostMsg_AcceleratedSurfaceRelease_Params params) {\n  params.surface_id = stub_->surface_id();\n  params.route_id = route_id_;\n  manager_->Send(new GpuHostMsg_AcceleratedSurfaceRelease(params));\n}\n\nvoid ImageTransportHelper::SendResizeView(const gfx::Size& size) {\n  manager_->Send(new GpuHostMsg_ResizeView(stub_->surface_id(),\n                                           route_id_,\n                                           size));\n}\n\nvoid ImageTransportHelper::SetScheduled(bool is_scheduled) {\n  gpu::GpuScheduler* scheduler = Scheduler();\n  if (!scheduler)\n    return;\n\n  scheduler->SetScheduled(is_scheduled);\n}\n\nvoid ImageTransportHelper::DeferToFence(base::Closure task) {\n  gpu::GpuScheduler* scheduler = Scheduler();\n  DCHECK(scheduler);\n\n  scheduler->DeferToFence(task);\n}\n\nvoid ImageTransportHelper::SetPreemptByCounter(\n    scoped_refptr<gpu::RefCountedCounter> preempt_by_counter) {\n  stub_->channel()->SetPreemptByCounter(preempt_by_counter);\n}\n\nbool ImageTransportHelper::MakeCurrent() {\n  gpu::gles2::GLES2Decoder* decoder = Decoder();\n  if (!decoder)\n    return false;\n  return decoder->MakeCurrent();\n}\n\nvoid ImageTransportHelper::SetSwapInterval(gfx::GLContext* context) {\n  if (CommandLine::ForCurrentProcess()->HasSwitch(switches::kDisableGpuVsync))\n    context->SetSwapInterval(0);\n  else\n    context->SetSwapInterval(1);\n}\n\nvoid ImageTransportHelper::Suspend() {\n  manager_->Send(new GpuHostMsg_AcceleratedSurfaceSuspend(stub_->surface_id()));\n}\n\ngpu::GpuScheduler* ImageTransportHelper::Scheduler() {\n  if (!stub_.get())\n    return NULL;\n  return stub_->scheduler();\n}\n\ngpu::gles2::GLES2Decoder* ImageTransportHelper::Decoder() {\n  if (!stub_.get())\n    return NULL;\n  return stub_->decoder();\n}\n\nvoid ImageTransportHelper::OnSetFrontSurfaceIsProtected(\n    bool is_protected, uint32 protection_state_id) {\n  surface_->OnSetFrontSurfaceIsProtected(is_protected, protection_state_id);\n}\n\nvoid ImageTransportHelper::OnBufferPresented(uint32 sync_point) {\n  surface_->OnBufferPresented(sync_point);\n}\n\nvoid ImageTransportHelper::OnResizeViewACK() {\n  surface_->OnResizeViewACK();\n}\n\nvoid ImageTransportHelper::Resize(gfx::Size size) {\n  \/\/ On windows, the surface is recreated and, in case the newly allocated\n  \/\/ surface happens to have the same address, it should be invalidated on the\n  \/\/ decoder so that future calls to MakeCurrent do not early out on the\n  \/\/ assumption that neither the context or surface have actually changed.\n#if defined(OS_WIN)\n  if (handle_ != NULL)\n    Decoder()->ReleaseCurrent();\n#endif\n\n  surface_->OnResize(size);\n\n#if defined(OS_ANDROID)\n  manager_->gpu_memory_manager()->ScheduleManage(true);\n#endif\n\n#if defined(OS_WIN)\n  if (handle_ != NULL) {\n    Decoder()->MakeCurrent();\n    SetSwapInterval(Decoder()->GetGLContext());\n  }\n#endif\n}\n\nPassThroughImageTransportSurface::PassThroughImageTransportSurface(\n    GpuChannelManager* manager,\n    GpuCommandBufferStub* stub,\n    gfx::GLSurface* surface,\n    bool transport)\n    : GLSurfaceAdapter(surface),\n      transport_(transport),\n      did_set_swap_interval_(false) {\n  helper_.reset(new ImageTransportHelper(this,\n                                         manager,\n                                         stub,\n                                         gfx::kNullPluginWindow));\n}\n\nbool PassThroughImageTransportSurface::Initialize() {\n  \/\/ The surface is assumed to have already been initialized.\n  return helper_->Initialize();\n}\n\nvoid PassThroughImageTransportSurface::Destroy() {\n  helper_->Destroy();\n  GLSurfaceAdapter::Destroy();\n}\n\nbool PassThroughImageTransportSurface::SwapBuffers() {\n  bool result = gfx::GLSurfaceAdapter::SwapBuffers();\n\n  if (transport_) {\n    \/\/ Round trip to the browser UI thread, for throttling, by sending a dummy\n    \/\/ SwapBuffers message.\n    GpuHostMsg_AcceleratedSurfaceBuffersSwapped_Params params;\n    params.surface_handle = 0;\n    helper_->SendAcceleratedSurfaceBuffersSwapped(params);\n\n    helper_->SetScheduled(false);\n  }\n  return result;\n}\n\nbool PassThroughImageTransportSurface::PostSubBuffer(\n    int x, int y, int width, int height) {\n  bool result = gfx::GLSurfaceAdapter::PostSubBuffer(x, y, width, height);\n\n  if (transport_) {\n    \/\/ Round trip to the browser UI thread, for throttling, by sending a dummy\n    \/\/ PostSubBuffer message.\n    GpuHostMsg_AcceleratedSurfacePostSubBuffer_Params params;\n    params.surface_handle = 0;\n    params.x = x;\n    params.y = y;\n    params.width = width;\n    params.height = height;\n    helper_->SendAcceleratedSurfacePostSubBuffer(params);\n\n    helper_->SetScheduled(false);\n  }\n  return result;\n}\n\nbool PassThroughImageTransportSurface::OnMakeCurrent(gfx::GLContext* context) {\n  if (!did_set_swap_interval_) {\n    ImageTransportHelper::SetSwapInterval(context);\n    did_set_swap_interval_ = true;\n  }\n  return true;\n}\n\nvoid PassThroughImageTransportSurface::OnBufferPresented(uint32 sync_point) {\n  DCHECK(transport_);\n  helper_->SetScheduled(true);\n}\n\nvoid PassThroughImageTransportSurface::OnResizeViewACK() {\n  DCHECK(transport_);\n  Resize(new_size_);\n\n  helper_->SetScheduled(true);\n}\n\nvoid PassThroughImageTransportSurface::OnResize(gfx::Size size) {\n  new_size_ = size;\n\n  if (transport_) {\n    helper_->SendResizeView(size);\n    helper_->SetScheduled(false);\n  } else {\n    Resize(new_size_);\n  }\n}\n\ngfx::Size PassThroughImageTransportSurface::GetSize() {\n  return GLSurfaceAdapter::GetSize();\n}\n\nPassThroughImageTransportSurface::~PassThroughImageTransportSurface() {}\n\n#endif  \/\/ defined(ENABLE_GPU)\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"ui\/views\/ime\/input_method_bridge.h\"\n\n#include \"ui\/base\/events\/event.h\"\n#include \"ui\/base\/ime\/input_method.h\"\n#include \"ui\/gfx\/rect.h\"\n#include \"ui\/views\/view.h\"\n#include \"ui\/views\/widget\/widget.h\"\n\nnamespace views {\n\nInputMethodBridge::InputMethodBridge(internal::InputMethodDelegate* delegate,\n                                     ui::InputMethod* host,\n                                     bool shared_input_method)\n    : host_(host),\n      shared_input_method_(shared_input_method),\n      context_focused_(false) {\n  DCHECK(host_);\n  SetDelegate(delegate);\n}\n\nInputMethodBridge::~InputMethodBridge() {\n  if (host_->GetTextInputClient() == this)\n    host_->SetFocusedTextInputClient(NULL);\n}\n\nvoid InputMethodBridge::Init(Widget* widget) {\n  InputMethodBase::Init(widget);\n}\n\nvoid InputMethodBridge::OnFocus() {\n  \/\/ Direct the shared IME to send TextInputClient messages to |this| object.\n  if (shared_input_method_ || !host_->GetTextInputClient())\n    host_->SetFocusedTextInputClient(this);\n\n  \/\/ TODO(yusukes): We don't need to call OnTextInputTypeChanged() once we move\n  \/\/ text input type tracker code to ui::InputMethodBase.\n  if (GetFocusedView())\n    OnTextInputTypeChanged(GetFocusedView());\n}\n\nvoid InputMethodBridge::OnBlur() {\n  ConfirmCompositionText();\n\n  if (host_->GetTextInputClient() == this)\n    host_->SetFocusedTextInputClient(NULL);\n}\n\nbool InputMethodBridge::OnUntranslatedIMEMessage(const base::NativeEvent& event,\n                                                 NativeEventResult* result) {\n  return host_->OnUntranslatedIMEMessage(event, result);\n}\n\nvoid InputMethodBridge::DispatchKeyEvent(const ui::KeyEvent& key) {\n  DCHECK(key.type() == ui::ET_KEY_PRESSED || key.type() == ui::ET_KEY_RELEASED);\n\n  \/\/ We can just dispatch the event here since the |key| is already processed by\n  \/\/ the system-wide IME.\n  DispatchKeyEventPostIME(key);\n}\n\nvoid InputMethodBridge::OnTextInputTypeChanged(View* view) {\n  if (IsViewFocused(view))\n    host_->OnTextInputTypeChanged(this);\n  InputMethodBase::OnTextInputTypeChanged(view);\n}\n\nvoid InputMethodBridge::OnCaretBoundsChanged(View* view) {\n  if (IsViewFocused(view) && !IsTextInputTypeNone())\n    host_->OnCaretBoundsChanged(this);\n}\n\nvoid InputMethodBridge::CancelComposition(View* view) {\n  if (IsViewFocused(view))\n    host_->CancelComposition(this);\n}\n\nvoid InputMethodBridge::OnInputLocaleChanged() {\n  return host_->OnInputLocaleChanged();\n}\n\nstd::string InputMethodBridge::GetInputLocale() {\n  return host_->GetInputLocale();\n}\n\nbase::i18n::TextDirection InputMethodBridge::GetInputTextDirection() {\n  return host_->GetInputTextDirection();\n}\n\nbool InputMethodBridge::IsActive() {\n  return host_->IsActive();\n}\n\n\/\/ Overridden from TextInputClient. Forward an event from the system-wide IME\n\/\/ to the text input |client|, which is e.g. views::NativeTextfieldViews.\nvoid InputMethodBridge::SetCompositionText(\n    const ui::CompositionText& composition) {\n  TextInputClient* client = GetTextInputClient();\n  if (client)\n    client->SetCompositionText(composition);\n}\n\nvoid InputMethodBridge::ConfirmCompositionText() {\n  TextInputClient* client = GetTextInputClient();\n  if (client)\n    client->ConfirmCompositionText();\n}\n\nvoid InputMethodBridge::ClearCompositionText() {\n  TextInputClient* client = GetTextInputClient();\n  if (client)\n    client->ClearCompositionText();\n}\n\nvoid InputMethodBridge::InsertText(const string16& text) {\n  TextInputClient* client = GetTextInputClient();\n  if (client)\n    client->InsertText(text);\n}\n\nvoid InputMethodBridge::InsertChar(char16 ch, int flags) {\n  TextInputClient* client = GetTextInputClient();\n  if (client)\n    client->InsertChar(ch, flags);\n}\n\ngfx::NativeWindow InputMethodBridge::GetAttachedWindow() const {\n  TextInputClient* client = GetTextInputClient();\n  return client ?\n      client->GetAttachedWindow() : static_cast<gfx::NativeWindow>(NULL);\n}\n\nui::TextInputType InputMethodBridge::GetTextInputType() const {\n  TextInputClient* client = GetTextInputClient();\n  return client ? client->GetTextInputType() : ui::TEXT_INPUT_TYPE_NONE;\n}\n\nbool InputMethodBridge::CanComposeInline() const {\n  TextInputClient* client = GetTextInputClient();\n  return client ? client->CanComposeInline() : true;\n}\n\ngfx::Rect InputMethodBridge::GetCaretBounds() {\n  TextInputClient* client = GetTextInputClient();\n  if (!client)\n    return gfx::Rect();\n\n  return client->GetCaretBounds();\n}\n\nbool InputMethodBridge::GetCompositionCharacterBounds(uint32 index,\n                                                      gfx::Rect* rect) {\n  DCHECK(rect);\n  TextInputClient* client = GetTextInputClient();\n  if (!client)\n    return false;\n\n  return client->GetCompositionCharacterBounds(index, rect);\n}\n\nbool InputMethodBridge::HasCompositionText() {\n  TextInputClient* client = GetTextInputClient();\n  return client ? client->HasCompositionText() : false;\n}\n\nbool InputMethodBridge::GetTextRange(ui::Range* range) {\n  TextInputClient* client = GetTextInputClient();\n  return client ?  client->GetTextRange(range) : false;\n}\n\nbool InputMethodBridge::GetCompositionTextRange(ui::Range* range) {\n  TextInputClient* client = GetTextInputClient();\n  return client ? client->GetCompositionTextRange(range) : false;\n}\n\nbool InputMethodBridge::GetSelectionRange(ui::Range* range) {\n  TextInputClient* client = GetTextInputClient();\n  return client ? client->GetSelectionRange(range) : false;\n}\n\nbool InputMethodBridge::SetSelectionRange(const ui::Range& range) {\n  TextInputClient* client = GetTextInputClient();\n  return client ? client->SetSelectionRange(range) : false;\n}\n\nbool InputMethodBridge::DeleteRange(const ui::Range& range) {\n  TextInputClient* client = GetTextInputClient();\n  return client ? client->DeleteRange(range) : false;\n}\n\nbool InputMethodBridge::GetTextFromRange(\n    const ui::Range& range, string16* text) {\n  TextInputClient* client = GetTextInputClient();\n  return client ? client->GetTextFromRange(range, text) : false;\n}\n\nvoid InputMethodBridge::OnInputMethodChanged() {\n  TextInputClient* client = GetTextInputClient();\n  if (client)\n    client->OnInputMethodChanged();\n}\n\nbool InputMethodBridge::ChangeTextDirectionAndLayoutAlignment(\n    base::i18n::TextDirection direction) {\n  TextInputClient* client = GetTextInputClient();\n  return client ?\n      client->ChangeTextDirectionAndLayoutAlignment(direction) : false;\n}\n\nvoid InputMethodBridge::ExtendSelectionAndDelete(size_t before, size_t after) {\n  TextInputClient* client = GetTextInputClient();\n  if (client)\n    client->ExtendSelectionAndDelete(before, after);\n}\n\nvoid InputMethodBridge::EnsureCaretInRect(const gfx::Rect& rect) {\n  TextInputClient* client = GetTextInputClient();\n  if (client)\n    client->EnsureCaretInRect(rect);\n}\n\n\/\/ Overridden from FocusChangeListener.\nvoid InputMethodBridge::OnWillChangeFocus(View* focused_before, View* focused) {\n  ConfirmCompositionText();\n}\n\nvoid InputMethodBridge::OnDidChangeFocus(View* focused_before, View* focused) {\n  OnTextInputTypeChanged(GetFocusedView());\n  OnCaretBoundsChanged(GetFocusedView());\n}\n\nui::InputMethod* InputMethodBridge::GetHostInputMethod() const {\n  return host_;\n}\n\n\n}  \/\/ namespace views\n<commit_msg>Clear composition state in the hosted input method when focus is out.<commit_after>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"ui\/views\/ime\/input_method_bridge.h\"\n\n#include \"ui\/base\/events\/event.h\"\n#include \"ui\/base\/ime\/input_method.h\"\n#include \"ui\/gfx\/rect.h\"\n#include \"ui\/views\/view.h\"\n#include \"ui\/views\/widget\/widget.h\"\n\nnamespace views {\n\nInputMethodBridge::InputMethodBridge(internal::InputMethodDelegate* delegate,\n                                     ui::InputMethod* host,\n                                     bool shared_input_method)\n    : host_(host),\n      shared_input_method_(shared_input_method),\n      context_focused_(false) {\n  DCHECK(host_);\n  SetDelegate(delegate);\n}\n\nInputMethodBridge::~InputMethodBridge() {\n  if (host_->GetTextInputClient() == this)\n    host_->SetFocusedTextInputClient(NULL);\n}\n\nvoid InputMethodBridge::Init(Widget* widget) {\n  InputMethodBase::Init(widget);\n}\n\nvoid InputMethodBridge::OnFocus() {\n  \/\/ Direct the shared IME to send TextInputClient messages to |this| object.\n  if (shared_input_method_ || !host_->GetTextInputClient())\n    host_->SetFocusedTextInputClient(this);\n\n  \/\/ TODO(yusukes): We don't need to call OnTextInputTypeChanged() once we move\n  \/\/ text input type tracker code to ui::InputMethodBase.\n  if (GetFocusedView())\n    OnTextInputTypeChanged(GetFocusedView());\n}\n\nvoid InputMethodBridge::OnBlur() {\n  ConfirmCompositionText();\n\n  if (host_->GetTextInputClient() == this)\n    host_->SetFocusedTextInputClient(NULL);\n}\n\nbool InputMethodBridge::OnUntranslatedIMEMessage(const base::NativeEvent& event,\n                                                 NativeEventResult* result) {\n  return host_->OnUntranslatedIMEMessage(event, result);\n}\n\nvoid InputMethodBridge::DispatchKeyEvent(const ui::KeyEvent& key) {\n  DCHECK(key.type() == ui::ET_KEY_PRESSED || key.type() == ui::ET_KEY_RELEASED);\n\n  \/\/ We can just dispatch the event here since the |key| is already processed by\n  \/\/ the system-wide IME.\n  DispatchKeyEventPostIME(key);\n}\n\nvoid InputMethodBridge::OnTextInputTypeChanged(View* view) {\n  if (IsViewFocused(view))\n    host_->OnTextInputTypeChanged(this);\n  InputMethodBase::OnTextInputTypeChanged(view);\n}\n\nvoid InputMethodBridge::OnCaretBoundsChanged(View* view) {\n  if (IsViewFocused(view) && !IsTextInputTypeNone())\n    host_->OnCaretBoundsChanged(this);\n}\n\nvoid InputMethodBridge::CancelComposition(View* view) {\n  if (IsViewFocused(view))\n    host_->CancelComposition(this);\n}\n\nvoid InputMethodBridge::OnInputLocaleChanged() {\n  return host_->OnInputLocaleChanged();\n}\n\nstd::string InputMethodBridge::GetInputLocale() {\n  return host_->GetInputLocale();\n}\n\nbase::i18n::TextDirection InputMethodBridge::GetInputTextDirection() {\n  return host_->GetInputTextDirection();\n}\n\nbool InputMethodBridge::IsActive() {\n  return host_->IsActive();\n}\n\n\/\/ Overridden from TextInputClient. Forward an event from the system-wide IME\n\/\/ to the text input |client|, which is e.g. views::NativeTextfieldViews.\nvoid InputMethodBridge::SetCompositionText(\n    const ui::CompositionText& composition) {\n  TextInputClient* client = GetTextInputClient();\n  if (client)\n    client->SetCompositionText(composition);\n}\n\nvoid InputMethodBridge::ConfirmCompositionText() {\n  TextInputClient* client = GetTextInputClient();\n  if (client)\n    client->ConfirmCompositionText();\n}\n\nvoid InputMethodBridge::ClearCompositionText() {\n  TextInputClient* client = GetTextInputClient();\n  if (client)\n    client->ClearCompositionText();\n}\n\nvoid InputMethodBridge::InsertText(const string16& text) {\n  TextInputClient* client = GetTextInputClient();\n  if (client)\n    client->InsertText(text);\n}\n\nvoid InputMethodBridge::InsertChar(char16 ch, int flags) {\n  TextInputClient* client = GetTextInputClient();\n  if (client)\n    client->InsertChar(ch, flags);\n}\n\ngfx::NativeWindow InputMethodBridge::GetAttachedWindow() const {\n  TextInputClient* client = GetTextInputClient();\n  return client ?\n      client->GetAttachedWindow() : static_cast<gfx::NativeWindow>(NULL);\n}\n\nui::TextInputType InputMethodBridge::GetTextInputType() const {\n  TextInputClient* client = GetTextInputClient();\n  return client ? client->GetTextInputType() : ui::TEXT_INPUT_TYPE_NONE;\n}\n\nbool InputMethodBridge::CanComposeInline() const {\n  TextInputClient* client = GetTextInputClient();\n  return client ? client->CanComposeInline() : true;\n}\n\ngfx::Rect InputMethodBridge::GetCaretBounds() {\n  TextInputClient* client = GetTextInputClient();\n  if (!client)\n    return gfx::Rect();\n\n  return client->GetCaretBounds();\n}\n\nbool InputMethodBridge::GetCompositionCharacterBounds(uint32 index,\n                                                      gfx::Rect* rect) {\n  DCHECK(rect);\n  TextInputClient* client = GetTextInputClient();\n  if (!client)\n    return false;\n\n  return client->GetCompositionCharacterBounds(index, rect);\n}\n\nbool InputMethodBridge::HasCompositionText() {\n  TextInputClient* client = GetTextInputClient();\n  return client ? client->HasCompositionText() : false;\n}\n\nbool InputMethodBridge::GetTextRange(ui::Range* range) {\n  TextInputClient* client = GetTextInputClient();\n  return client ?  client->GetTextRange(range) : false;\n}\n\nbool InputMethodBridge::GetCompositionTextRange(ui::Range* range) {\n  TextInputClient* client = GetTextInputClient();\n  return client ? client->GetCompositionTextRange(range) : false;\n}\n\nbool InputMethodBridge::GetSelectionRange(ui::Range* range) {\n  TextInputClient* client = GetTextInputClient();\n  return client ? client->GetSelectionRange(range) : false;\n}\n\nbool InputMethodBridge::SetSelectionRange(const ui::Range& range) {\n  TextInputClient* client = GetTextInputClient();\n  return client ? client->SetSelectionRange(range) : false;\n}\n\nbool InputMethodBridge::DeleteRange(const ui::Range& range) {\n  TextInputClient* client = GetTextInputClient();\n  return client ? client->DeleteRange(range) : false;\n}\n\nbool InputMethodBridge::GetTextFromRange(\n    const ui::Range& range, string16* text) {\n  TextInputClient* client = GetTextInputClient();\n  return client ? client->GetTextFromRange(range, text) : false;\n}\n\nvoid InputMethodBridge::OnInputMethodChanged() {\n  TextInputClient* client = GetTextInputClient();\n  if (client)\n    client->OnInputMethodChanged();\n}\n\nbool InputMethodBridge::ChangeTextDirectionAndLayoutAlignment(\n    base::i18n::TextDirection direction) {\n  TextInputClient* client = GetTextInputClient();\n  return client ?\n      client->ChangeTextDirectionAndLayoutAlignment(direction) : false;\n}\n\nvoid InputMethodBridge::ExtendSelectionAndDelete(size_t before, size_t after) {\n  TextInputClient* client = GetTextInputClient();\n  if (client)\n    client->ExtendSelectionAndDelete(before, after);\n}\n\nvoid InputMethodBridge::EnsureCaretInRect(const gfx::Rect& rect) {\n  TextInputClient* client = GetTextInputClient();\n  if (client)\n    client->EnsureCaretInRect(rect);\n}\n\n\/\/ Overridden from FocusChangeListener.\nvoid InputMethodBridge::OnWillChangeFocus(View* focused_before, View* focused) {\n  if (HasCompositionText()) {\n    ConfirmCompositionText();\n    CancelComposition(focused_before);\n  }\n}\n\nvoid InputMethodBridge::OnDidChangeFocus(View* focused_before, View* focused) {\n  DCHECK_EQ(GetFocusedView(), focused);\n  OnTextInputTypeChanged(focused);\n  OnCaretBoundsChanged(focused);\n}\n\nui::InputMethod* InputMethodBridge::GetHostInputMethod() const {\n  return host_;\n}\n\n\n}  \/\/ namespace views\n<|endoftext|>"}
{"text":"<commit_before>#include \"p2Defs.h\"\n#include \"p2Log.h\"\n#include \"j1App.h\"\n#include \"j1Render.h\"\n#include \"j1Textures.h\"\n#include \"j1Map.h\"\n#include <math.h>\n\nj1Map::j1Map() : j1Module(), map_loaded(false)\n{\n\tname.create(\"map\");\n}\n\n\/\/ Destructor\nj1Map::~j1Map()\n{}\n\n\/\/ Called before render is available\nbool j1Map::Awake(pugi::xml_node& config)\n{\n\tLOG(\"Loading Map Parser\");\n\tbool ret = true;\n\n\tfolder.create(config.child(\"folder\").child_value());\n\n\treturn ret;\n}\n\nvoid j1Map::Draw()\n{\n\tif (map_loaded == false)\n\t\treturn;\n\tMapLayer* layer = data.layers.start->data;\n\n\tfor (int y = 0; y < data.height; ++y)\n\t{\n\t\tfor (int x = 0; x < data.width; ++x)\n\t\t{\n\t\t\tint tile_id = layer->Get(x, y);\n\t\t\tif (tile_id > 0)\n\t\t\t{\n\t\t\t\t\/\/ TODO 10(old): Complete the draw function\n\t\t\t\tTileSet* tileset = data.tilesets.start->data;\n\n\t\t\t\tSDL_Rect r = tileset->GetTileRect(tile_id);\n\t\t\t\tiPoint pos = MapToWorld(x, y);\n\n\t\t\t\tApp->render->Blit(tileset->texture, pos.x, pos.y, &r);\n\t\t\t}\n\t\t}\n\t}\n\n\n}\n\niPoint j1Map::MapToWorld(int x, int y) const\n{\n\tiPoint ret;\n\n\tret.x = x * data.tile_width;\n\tret.y = y * data.tile_height;\n\n\treturn ret;\n}\n\niPoint j1Map::WorldToMap(int x, int y) const\n{\n\tiPoint ret(0, 0);\n\n\tif (data.type == MAPTYPE_ORTHOGONAL)\n\t{\n\t\tif (x < 0)\n\t\t\tret.x = (x \/ data.tile_width) - 1;\n\t\telse\n\t\t\tret.x = x \/ data.tile_width;\n\n\t\tif (y < 0)\n\t\t\tret.y = (y \/ data.tile_height) - 1;\n\t\telse\n\t\t\tret.y = y \/ data.tile_height;\n\t}\n\telse\n\t{\n\t\tLOG(\"Unknown map type\");\n\t\tret.x = x; ret.y = y;\n\t}\n\n\treturn ret;\n}\n\nbool j1Map::LoadMap()\n{\n\tbool ret = true;\n\tpugi::xml_node map = map_file.child(\"map\");\n\n\tif (map == NULL)\n\t{\n\t\tLOG(\"Error parsing map xmlfile: Can't find 'map' tag.\");\n\t\tret = false;\n\t}\n\telse\n\t{\n\t\tdata.width = map.attribute(\"width\").as_int();\n\t\tdata.height = map.attribute(\"height\").as_int();\n\t\tdata.tile_width = map.attribute(\"tilewidth\").as_int();\n\t\tdata.tile_height = map.attribute(\"tileheight\").as_int();\n\t\tp2SString bg_color(map.attribute(\"backgroundcolor\").as_string());\n\n\t\tdata.background_color.r = 0;\n\t\tdata.background_color.g = 0;\n\t\tdata.background_color.b = 0;\n\t\tdata.background_color.a = 0;\n\n\t\tif (bg_color.Length() > 0)\n\t\t{\n\t\t\tp2SString red, green, blue;\n\t\t\tbg_color.SubString(1, 2, red);\n\t\t\tbg_color.SubString(3, 4, green);\n\t\t\tbg_color.SubString(5, 6, blue);\n\n\t\t\tint v = 0;\n\n\t\t\tsscanf_s(red.GetString(), \"%x\", &v);\n\t\t\tif (v >= 0 && v <= 255) data.background_color.r = v;\n\n\t\t\tsscanf_s(green.GetString(), \"%x\", &v);\n\t\t\tif (v >= 0 && v <= 255) data.background_color.g = v;\n\n\t\t\tsscanf_s(blue.GetString(), \"%x\", &v);\n\t\t\tif (v >= 0 && v <= 255) data.background_color.b = v;\n\t\t}\n\n\t\tp2SString orientation(map.attribute(\"orientation\").as_string());\n\n\t\tif (orientation == \"orthogonal\")\n\t\t{\n\t\t\tdata.type = MAPTYPE_ORTHOGONAL;\n\t\t}\n\t\telse if (orientation == \"isometric\")\n\t\t{\n\t\t\tdata.type = MAPTYPE_ISOMETRIC;\n\t\t}\n\t\telse if (orientation == \"staggered\")\n\t\t{\n\t\t\tdata.type = MAPTYPE_STAGGERED;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tdata.type = MAPTYPE_UNKNOWN;\n\t\t}\n\t}\n\n\treturn ret;\n}\n\nbool j1Map::LoadTilesetDetails(pugi::xml_node& tileset_node, TileSet* set)\n{\n\tbool ret = true;\n\tset->name.create(tileset_node.attribute(\"name\").as_string());\n\tset->firstgid = tileset_node.attribute(\"firstgid\").as_int();\n\tset->tile_width = tileset_node.attribute(\"tilewidth\").as_int();\n\tset->tile_height = tileset_node.attribute(\"tileheight\").as_int();\n\tset->margin = tileset_node.attribute(\"margin\").as_int();\n\tset->spacing = tileset_node.attribute(\"spacing\").as_int();\n\tpugi::xml_node offset = tileset_node.child(\"tileoffset\");\n\n\tif (offset != NULL)\n\t{\n\t\tset->offset_x = offset.attribute(\"x\").as_int();\n\t\tset->offset_y = offset.attribute(\"y\").as_int();\n\t}\n\telse\n\t{\n\t\tset->offset_x = 0;\n\t\tset->offset_y = 0;\n\t}\n\n\treturn ret;\n}\n\nbool j1Map::LoadTilesetImage(pugi::xml_node& tileset_node, TileSet* set)\n{\n\tbool ret = true;\n\tpugi::xml_node image = tileset_node.child(\"image\");\n\n\tif (image == NULL)\n\t{\n\t\tLOG(\"Error parsing tileset xml file: Cannot find 'image' tag.\");\n\t\tret = false;\n\t}\n\telse\n\t{\n\t\tset->texture = App->tex->Load(PATH(folder.GetString(), image.attribute(\"source\").as_string()));\n\t\tint w, h;\n\t\tSDL_QueryTexture(set->texture, NULL, NULL, &w, &h);\n\t\tset->tex_width = image.attribute(\"width\").as_int();\n\n\t\tif (set->tex_width <= 0)\n\t\t{\n\t\t\tset->tex_width = w;\n\t\t}\n\n\t\tset->tex_height = image.attribute(\"height\").as_int();\n\n\t\tif (set->tex_height <= 0)\n\t\t{\n\t\t\tset->tex_height = h;\n\t\t}\n\n\t\tset->num_tiles_width = set->tex_width \/ set->tile_width;\n\t\tset->num_tiles_height = set->tex_height \/ set->tile_height;\n\t}\n\n\treturn ret;\n}\nbool j1Map::LoadLayer(pugi::xml_node & node, MapLayer * layer)\n{\n\tbool ret = true;\n\n\tlayer->name = node.attribute(\"name\").as_string();\n\tlayer->width = node.attribute(\"width\").as_int();\n\tlayer->height = node.attribute(\"height\").as_int();\n\tpugi::xml_node layer_data = node.child(\"data\");\n\n\tif (layer_data == NULL)\n\t{\n\t\tLOG(\"Error parsing map xml file: Cannot find 'layer\/data' tag.\");\n\t\tret = false;\n\t\tRELEASE(layer);\n\t}\n\telse\n\t{\n\t\tlayer->data = new uint[layer->width*layer->height];\n\t\tmemset(layer->data, 0, layer->width*layer->height);\n\n\t\tint i = 0;\n\t\tfor (pugi::xml_node tile = layer_data.child(\"tile\"); tile; tile = tile.next_sibling(\"tile\"))\n\t\t{\n\t\t\tlayer->data[i++] = tile.attribute(\"gid\").as_int(0);\n\t\t}\n\t}\n\n\treturn ret;\n}\n\/\/ Called before quitting\nbool j1Map::CleanUp()\n{\n\tLOG(\"Unloading map\");\n\n\t\/\/ Remove all tilesets\n\tp2List_item<TileSet*>* item;\n\titem = data.tilesets.start;\n\n\twhile (item != NULL)\n\t{\n\t\tRELEASE(item->data);\n\t\titem = item->next;\n\t}\n\tdata.tilesets.clear();\n\n\t\/\/ Remove all layers\n\tp2List_item<MapLayer*>* item2;\n\titem2 = data.layers.start;\n\n\twhile (item2 != NULL)\n\t{\n\t\tRELEASE(item2->data);\n\t\titem2 = item2->next;\n\t}\n\tdata.layers.clear();\n\n\tmap_file.reset();\n\n\treturn true;\n}\n\n\/\/ Load new map\nbool j1Map::Load(const char* file_name)\n{\n\tbool ret = true;\n\tp2SString tmp(\"%s%s\", folder.GetString(), file_name);\n\n\tpugi::xml_parse_result result = map_file.load_file(tmp.GetString());\n\n\tif (result == NULL)\n\t{\n\t\tLOG(\"Could not load map xml file %s. pugi error: %s\", file_name, result.description());\n\t\tret = false;\n\t}\n\n\tif (ret == true)\n\t{\n\t\tret = LoadMap();\n\t}\n\n\t\/\/ TODO 4: Create and call a private function to load a tileset\n\t\/\/ remember to support more any number of tilesets!\n\tpugi::xml_node tileset;\n\tfor (tileset = map_file.child(\"map\").child(\"tileset\"); tileset && ret; tileset = tileset.next_sibling(\"tileset\"))\n\t{\n\t\tTileSet* set = new TileSet();\n\n\t\tif (ret == true)\n\t\t{\n\t\t\tret = LoadTilesetDetails(tileset, set);\n\t\t}\n\n\t\tif (ret == true)\n\t\t{\n\t\t\tret = LoadTilesetImage(tileset, set);\n\t\t}\n\n\t\tdata.tilesets.add(set);\n\t}\n\n\tpugi::xml_node layer;\n\tfor (layer = map_file.child(\"map\").child(\"layer\"); layer && ret; layer = layer.next_sibling(\"layer\"))\n\t{\n\t\tMapLayer* lay = new MapLayer();\n\n\t\tret = LoadLayer(layer, lay);\n\n\t\tif (ret == true)\n\t\t\tdata.layers.add(lay);\n\t}\n\n\tif (ret == true)\n\t{\n\t\tLOG(\"Successfully parsed map XML file: %s\", file_name);\n\t\tLOG(\"width: %d height: %d\", data.width, data.height);\n\t\tLOG(\"tile_width: %d tile_height: %d\", data.tile_width, data.tile_height);\n\n\t\tp2List_item<TileSet*>* item = data.tilesets.start;\n\t\twhile (item != NULL)\n\t\t{\n\t\t\tTileSet* s = item->data;\n\t\t\tLOG(\"Tileset ----\");\n\t\t\tLOG(\"name: %s firstgid: %d\", s->name.GetString(), s->firstgid);\n\t\t\tLOG(\"tile width: %d tile height: %d\", s->tile_width, s->tile_height);\n\t\t\tLOG(\"spacing: %d margin: %d\", s->spacing, s->margin);\n\t\t\titem = item->next;\n\t\t}\n\n\t\tp2List_item<MapLayer*>* item_layer = data.layers.start;\n\t\twhile (item_layer != NULL)\n\t\t{\n\t\t\tMapLayer* l = item_layer->data;\n\t\t\tLOG(\"Layer ----\");\n\t\t\tLOG(\"name: %s\", l->name.GetString());\n\t\t\tLOG(\"tile width: %d tile height: %d\", l->width, l->height);\n\t\t\titem_layer = item_layer->next;\n\t\t}\n\n\t}\n\n\tmap_loaded = ret;\n\n\treturn ret;\n}\n\nSDL_Rect TileSet::GetTileRect(int id) const\n{\n\tint relative_id = id - firstgid;\n\tSDL_Rect rect;\n\trect.w = tile_width;\n\trect.h = tile_height;\n\trect.x = margin + ((rect.w + spacing) * (relative_id % num_tiles_width));\n\trect.y = margin + ((rect.h + spacing) * (relative_id \/ num_tiles_width));\n\treturn rect;\n}\n<commit_msg>map fix<commit_after>#include \"p2Defs.h\"\n#include \"p2Log.h\"\n#include \"j1App.h\"\n#include \"j1Render.h\"\n#include \"j1Textures.h\"\n#include \"j1Map.h\"\n#include <math.h>\n\nj1Map::j1Map() : j1Module(), map_loaded(false)\n{\n\tname.create(\"map\");\n}\n\n\/\/ Destructor\nj1Map::~j1Map()\n{}\n\n\/\/ Called before render is available\nbool j1Map::Awake(pugi::xml_node& config)\n{\n\tLOG(\"Loading Map Parser\");\n\tbool ret = true;\n\n\tfolder.create(config.child(\"folder\").child_value());\n\n\treturn ret;\n}\n\nvoid j1Map::Draw()\n{\n\tif (map_loaded == false)\n\t\treturn;\n\tMapLayer* layer = data.layers.start->data;\n\n\tfor (int y = 0; y < data.height; ++y)\n\t{\n\t\tfor (int x = 0; x < data.width; ++x)\n\t\t{\n\t\t\tint tile_id = layer->Get(x, y);\n\t\t\tif (tile_id > 0)\n\t\t\t{\n\t\t\t\t\/\/ TODO 10(old): Complete the draw function\n\t\t\t\tTileSet* tileset = data.tilesets.start->data;\n\n\t\t\t\tSDL_Rect r = tileset->GetTileRect(tile_id);\n\t\t\t\tiPoint pos = MapToWorld(x, y);\n\n\t\t\t\tApp->render->Blit(tileset->texture, pos.x, pos.y, &r);\n\t\t\t}\n\t\t}\n\t}\n\n\n}\n\niPoint j1Map::MapToWorld(int x, int y) const\n{\n\tiPoint ret;\n\n\tif (data.type == MAPTYPE_ORTHOGONAL)\n\t{\n\t\tret.x = x * data.tile_width;\n\t\tret.y = y * data.tile_height;\n\t}\n\telse\n\t{\n\t\tLOG(\"Unknown map type\");\n\t\tret.x = x; ret.y = y;\n\t}\n\n\treturn ret;\n}\n\niPoint j1Map::WorldToMap(int x, int y) const\n{\n\tiPoint ret(0, 0);\n\n\tif (data.type == MAPTYPE_ORTHOGONAL)\n\t{\n\t\tif (x < 0)\n\t\t\tret.x = (x \/ data.tile_width) - 1;\n\t\telse\n\t\t\tret.x = x \/ data.tile_width;\n\n\t\tif (y < 0)\n\t\t\tret.y = (y \/ data.tile_height) - 1;\n\t\telse\n\t\t\tret.y = y \/ data.tile_height;\n\t}\n\telse\n\t{\n\t\tLOG(\"Unknown map type\");\n\t\tret.x = x; ret.y = y;\n\t}\n\n\treturn ret;\n}\n\nbool j1Map::LoadMap()\n{\n\tbool ret = true;\n\tpugi::xml_node map = map_file.child(\"map\");\n\n\tif (map == NULL)\n\t{\n\t\tLOG(\"Error parsing map xmlfile: Can't find 'map' tag.\");\n\t\tret = false;\n\t}\n\telse\n\t{\n\t\tdata.width = map.attribute(\"width\").as_int();\n\t\tdata.height = map.attribute(\"height\").as_int();\n\t\tdata.tile_width = map.attribute(\"tilewidth\").as_int();\n\t\tdata.tile_height = map.attribute(\"tileheight\").as_int();\n\t\tp2SString bg_color(map.attribute(\"backgroundcolor\").as_string());\n\n\t\tdata.background_color.r = 0;\n\t\tdata.background_color.g = 0;\n\t\tdata.background_color.b = 0;\n\t\tdata.background_color.a = 0;\n\n\t\tif (bg_color.Length() > 0)\n\t\t{\n\t\t\tp2SString red, green, blue;\n\t\t\tbg_color.SubString(1, 2, red);\n\t\t\tbg_color.SubString(3, 4, green);\n\t\t\tbg_color.SubString(5, 6, blue);\n\n\t\t\tint v = 0;\n\n\t\t\tsscanf_s(red.GetString(), \"%x\", &v);\n\t\t\tif (v >= 0 && v <= 255) data.background_color.r = v;\n\n\t\t\tsscanf_s(green.GetString(), \"%x\", &v);\n\t\t\tif (v >= 0 && v <= 255) data.background_color.g = v;\n\n\t\t\tsscanf_s(blue.GetString(), \"%x\", &v);\n\t\t\tif (v >= 0 && v <= 255) data.background_color.b = v;\n\t\t}\n\n\t\tp2SString orientation(map.attribute(\"orientation\").as_string());\n\n\t\tif (orientation == \"orthogonal\")\n\t\t{\n\t\t\tdata.type = MAPTYPE_ORTHOGONAL;\n\t\t}\n\t\telse if (orientation == \"isometric\")\n\t\t{\n\t\t\tdata.type = MAPTYPE_ISOMETRIC;\n\t\t}\n\t\telse if (orientation == \"staggered\")\n\t\t{\n\t\t\tdata.type = MAPTYPE_STAGGERED;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tdata.type = MAPTYPE_UNKNOWN;\n\t\t}\n\t}\n\n\treturn ret;\n}\n\nbool j1Map::LoadTilesetDetails(pugi::xml_node& tileset_node, TileSet* set)\n{\n\tbool ret = true;\n\tset->name.create(tileset_node.attribute(\"name\").as_string());\n\tset->firstgid = tileset_node.attribute(\"firstgid\").as_int();\n\tset->tile_width = tileset_node.attribute(\"tilewidth\").as_int();\n\tset->tile_height = tileset_node.attribute(\"tileheight\").as_int();\n\tset->margin = tileset_node.attribute(\"margin\").as_int();\n\tset->spacing = tileset_node.attribute(\"spacing\").as_int();\n\tpugi::xml_node offset = tileset_node.child(\"tileoffset\");\n\n\tif (offset != NULL)\n\t{\n\t\tset->offset_x = offset.attribute(\"x\").as_int();\n\t\tset->offset_y = offset.attribute(\"y\").as_int();\n\t}\n\telse\n\t{\n\t\tset->offset_x = 0;\n\t\tset->offset_y = 0;\n\t}\n\n\treturn ret;\n}\n\nbool j1Map::LoadTilesetImage(pugi::xml_node& tileset_node, TileSet* set)\n{\n\tbool ret = true;\n\tpugi::xml_node image = tileset_node.child(\"image\");\n\n\tif (image == NULL)\n\t{\n\t\tLOG(\"Error parsing tileset xml file: Cannot find 'image' tag.\");\n\t\tret = false;\n\t}\n\telse\n\t{\n\t\tset->texture = App->tex->Load(PATH(folder.GetString(), image.attribute(\"source\").as_string()));\n\t\tint w, h;\n\t\tSDL_QueryTexture(set->texture, NULL, NULL, &w, &h);\n\t\tset->tex_width = image.attribute(\"width\").as_int();\n\n\t\tif (set->tex_width <= 0)\n\t\t{\n\t\t\tset->tex_width = w;\n\t\t}\n\n\t\tset->tex_height = image.attribute(\"height\").as_int();\n\n\t\tif (set->tex_height <= 0)\n\t\t{\n\t\t\tset->tex_height = h;\n\t\t}\n\n\t\tset->num_tiles_width = set->tex_width \/ set->tile_width;\n\t\tset->num_tiles_height = set->tex_height \/ set->tile_height;\n\t}\n\n\treturn ret;\n}\nbool j1Map::LoadLayer(pugi::xml_node & node, MapLayer * layer)\n{\n\tbool ret = true;\n\n\tlayer->name = node.attribute(\"name\").as_string();\n\tlayer->width = node.attribute(\"width\").as_int();\n\tlayer->height = node.attribute(\"height\").as_int();\n\tpugi::xml_node layer_data = node.child(\"data\");\n\n\tif (layer_data == NULL)\n\t{\n\t\tLOG(\"Error parsing map xml file: Cannot find 'layer\/data' tag.\");\n\t\tret = false;\n\t\tRELEASE(layer);\n\t}\n\telse\n\t{\n\t\tlayer->data = new uint[layer->width*layer->height];\n\t\tmemset(layer->data, 0, layer->width*layer->height);\n\n\t\tint i = 0;\n\t\tfor (pugi::xml_node tile = layer_data.child(\"tile\"); tile; tile = tile.next_sibling(\"tile\"))\n\t\t{\n\t\t\tlayer->data[i++] = tile.attribute(\"gid\").as_int(0);\n\t\t}\n\t}\n\n\treturn ret;\n}\n\/\/ Called before quitting\nbool j1Map::CleanUp()\n{\n\tLOG(\"Unloading map\");\n\n\t\/\/ Remove all tilesets\n\tp2List_item<TileSet*>* item;\n\titem = data.tilesets.start;\n\n\twhile (item != NULL)\n\t{\n\t\tRELEASE(item->data);\n\t\titem = item->next;\n\t}\n\tdata.tilesets.clear();\n\n\t\/\/ Remove all layers\n\tp2List_item<MapLayer*>* item2;\n\titem2 = data.layers.start;\n\n\twhile (item2 != NULL)\n\t{\n\t\tRELEASE(item2->data);\n\t\titem2 = item2->next;\n\t}\n\tdata.layers.clear();\n\n\tmap_file.reset();\n\n\treturn true;\n}\n\n\/\/ Load new map\nbool j1Map::Load(const char* file_name)\n{\n\tbool ret = true;\n\tp2SString tmp(\"%s%s\", folder.GetString(), file_name);\n\n\tpugi::xml_parse_result result = map_file.load_file(tmp.GetString());\n\n\tif (result == NULL)\n\t{\n\t\tLOG(\"Could not load map xml file %s. pugi error: %s\", file_name, result.description());\n\t\tret = false;\n\t}\n\n\tif (ret == true)\n\t{\n\t\tret = LoadMap();\n\t}\n\n\t\/\/ TODO 4: Create and call a private function to load a tileset\n\t\/\/ remember to support more any number of tilesets!\n\tpugi::xml_node tileset;\n\tfor (tileset = map_file.child(\"map\").child(\"tileset\"); tileset && ret; tileset = tileset.next_sibling(\"tileset\"))\n\t{\n\t\tTileSet* set = new TileSet();\n\n\t\tif (ret == true)\n\t\t{\n\t\t\tret = LoadTilesetDetails(tileset, set);\n\t\t}\n\n\t\tif (ret == true)\n\t\t{\n\t\t\tret = LoadTilesetImage(tileset, set);\n\t\t}\n\n\t\tdata.tilesets.add(set);\n\t}\n\n\tpugi::xml_node layer;\n\tfor (layer = map_file.child(\"map\").child(\"layer\"); layer && ret; layer = layer.next_sibling(\"layer\"))\n\t{\n\t\tMapLayer* lay = new MapLayer();\n\n\t\tret = LoadLayer(layer, lay);\n\n\t\tif (ret == true)\n\t\t\tdata.layers.add(lay);\n\t}\n\n\tif (ret == true)\n\t{\n\t\tLOG(\"Successfully parsed map XML file: %s\", file_name);\n\t\tLOG(\"width: %d height: %d\", data.width, data.height);\n\t\tLOG(\"tile_width: %d tile_height: %d\", data.tile_width, data.tile_height);\n\n\t\tp2List_item<TileSet*>* item = data.tilesets.start;\n\t\twhile (item != NULL)\n\t\t{\n\t\t\tTileSet* s = item->data;\n\t\t\tLOG(\"Tileset ----\");\n\t\t\tLOG(\"name: %s firstgid: %d\", s->name.GetString(), s->firstgid);\n\t\t\tLOG(\"tile width: %d tile height: %d\", s->tile_width, s->tile_height);\n\t\t\tLOG(\"spacing: %d margin: %d\", s->spacing, s->margin);\n\t\t\titem = item->next;\n\t\t}\n\n\t\tp2List_item<MapLayer*>* item_layer = data.layers.start;\n\t\twhile (item_layer != NULL)\n\t\t{\n\t\t\tMapLayer* l = item_layer->data;\n\t\t\tLOG(\"Layer ----\");\n\t\t\tLOG(\"name: %s\", l->name.GetString());\n\t\t\tLOG(\"tile width: %d tile height: %d\", l->width, l->height);\n\t\t\titem_layer = item_layer->next;\n\t\t}\n\n\t}\n\n\tmap_loaded = ret;\n\n\treturn ret;\n}\n\nSDL_Rect TileSet::GetTileRect(int id) const\n{\n\tint relative_id = id - firstgid;\n\tSDL_Rect rect;\n\trect.w = tile_width;\n\trect.h = tile_height;\n\trect.x = margin + ((rect.w + spacing) * (relative_id % num_tiles_width));\n\trect.y = margin + ((rect.h + spacing) * (relative_id \/ num_tiles_width));\n\treturn rect;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/ FILE:       Skeleton.cpp\n\/\/\/\/ PROJECT:    MicroManage\n\/\/\/\/ SUBSYSTEM:  DeviceAdapters\n\/\/\/\/-----------------------------------------------------------------------------\n\/\/\/\/ DESCRIPTION:\n\/\/\/\/ The basic ingredients for a device adapter\n\/\/\/\/                \n\/\/\/\/ AUTHOR: Nico Stuurman, 1\/16\/2006\n\/\/\/\/\n\/\/\n\n#ifdef WIN32\n   #include <windows.h>\n   #define snprintf _snprintf \n#endif\n\n#include \"Skeleton.h\"\n#include <string>\n#include <math.h>\n#include \"..\/..\/MMDevice\/ModuleInterface.h\"\n#include <sstream>\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Devices in this adapter.  \n\/\/ The device name needs to be a class name in this file\n\n\/\/ Skeleton device\nconst char* g_SkeletonDevicename = \"SkeletonDevice\";\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nusing namespace std;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Exported MMDevice API\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nMODULE_API MM::Device* CreateDevice(const char* deviceName)                  \n{                                                                            \n   if (deviceName == 0)                                                      \n       return 0;\n\n   if (strcmp(deviceName, g_SkeletonDevicename) == 0)\n   {\n        SkeletonDevice* pSkeletonDevice = new SkeletonDevice();\n        return pSkeletonDevice;\n   }\n\n   return 0;\n}\n\nMODULE_API void DeleteDevice(MM::Device* pDevice)                            \n{                                                                            \n   delete pDevice;                                                           \n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ SkeletonDevice\n\/\/\nSkeletonDevice::SkeletonDevice() :\n   initialized_(false),\n   port_(\"Undefined\"),                                                       \n   answerTimeoutMs_(1000)\n{\n   InitializeDefaultErrorMessages();\n\n   \/\/ create pre-initialization properties\n   \/\/ ------------------------------------\n\n   \/\/ Name\n   CreateProperty(MM::g_Keyword_Name, g_SkeletonDevicename, MM::String, true);\n   \n   \/\/ Description                                                            \n   CreateProperty(MM::g_Keyword_Description, \"Tell what your device is\", MM::String, true);\n \n   \/\/ Port                                                                   \n   CPropertyAction* pAct = new CPropertyAction (this, &SkeletonDevice::OnPort);\n   CreateProperty(MM::g_Keyword_Port, \"Undefined\", MM::String, false, pAct, true);\n}\n\nSkeletonDevice::~SkeletonDevice() \n{\n   Shutdown();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Action handlers\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint SkeletonDevice::OnPort(MM::PropertyBase* pProp, MM::ActionType eAct)\n{\n   if (eAct == MM::BeforeGet) {\n      pProp->Set(port_.c_str());\n   } else if (eAct == MM::AfterSet) {\n      if (initialized_) {\n         \/\/ revert\n         pProp->Set(port_.c_str());\n         return ERR_PORT_CHANGE_FORBIDDEN;\n      }\n\n      pProp->Get(port_);\n   }\n\n   return DEVICE_OK;\n}\n\nint SkeletonDevice::Initialize() \n{\n   return 0;\n}\n\nint SkeletonDevice::Shutdown() \n{\n   return 0;\n}\n\nvoid SkeletonDevice::GetName (char* Name) const\n{\n   CDeviceUtils::CopyLimitedString(Name, g_SkeletonDevicename);\n}\n\nbool SkeletonDevice::Busy() \n{\n   return true;\n}\n<commit_msg>Update to the Skeleton device adapter<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/ FILE:       Skeleton.cpp\n\/\/\/\/ PROJECT:    MicroManage\n\/\/\/\/ SUBSYSTEM:  DeviceAdapters\n\/\/\/\/-----------------------------------------------------------------------------\n\/\/\/\/ DESCRIPTION:\n\/\/\/\/ The basic ingredients for a device adapter\n\/\/\/\/                \n\/\/\/\/ AUTHOR: Nico Stuurman, 1\/16\/2006\n\/\/\/\/\n\/\/\n\n#ifdef WIN32\n   #include <windows.h>\n   #define snprintf _snprintf \n#endif\n\n#include \"Skeleton.h\"\n#include <string>\n#include <math.h>\n#include \"..\/..\/MMDevice\/ModuleInterface.h\"\n#include <sstream>\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Devices in this adapter.  \n\/\/ The device name needs to be a class name in this file\n\n\/\/ Skeleton device\nconst char* g_SkeletonDevicename = \"SkeletonDevice\";\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nusing namespace std;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Exported MMDevice API\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nMODULE_API void InitializeModuleData()\n{\n   RegisterDevice(g_SkeletonDeviceName, MM::GenericDevice, \"Skeleton\");            \n}\n\nMODULE_API MM::Device* CreateDevice(const char* deviceName)                  \n{                                                                            \n   if (deviceName == 0)                                                      \n       return 0;\n\n   if (strcmp(deviceName, g_SkeletonDevicename) == 0)\n   {\n        SkeletonDevice* pSkeletonDevice = new SkeletonDevice();\n        return pSkeletonDevice;\n   }\n\n   return 0;\n}\n\nMODULE_API void DeleteDevice(MM::Device* pDevice)                            \n{                                                                            \n   delete pDevice;                                                           \n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ SkeletonDevice\n\/\/\nSkeletonDevice::SkeletonDevice() :\n   initialized_(false),\n   port_(\"Undefined\"),                                                       \n   answerTimeoutMs_(1000)\n{\n   InitializeDefaultErrorMessages();\n\n   \/\/ create pre-initialization properties\n   \/\/ ------------------------------------\n\n   \/\/ Name\n   CreateProperty(MM::g_Keyword_Name, g_SkeletonDevicename, MM::String, true);\n   \n   \/\/ Description                                                            \n   CreateProperty(MM::g_Keyword_Description, \"Tell what your device is\", MM::String, true);\n \n   \/\/ Port                                                                   \n   CPropertyAction* pAct = new CPropertyAction (this, &SkeletonDevice::OnPort);\n   CreateProperty(MM::g_Keyword_Port, \"Undefined\", MM::String, false, pAct, true);\n}\n\nSkeletonDevice::~SkeletonDevice() \n{\n   Shutdown();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Action handlers\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint SkeletonDevice::OnPort(MM::PropertyBase* pProp, MM::ActionType eAct)\n{\n   if (eAct == MM::BeforeGet) {\n      pProp->Set(port_.c_str());\n   } else if (eAct == MM::AfterSet) {\n      if (initialized_) {\n         \/\/ revert\n         pProp->Set(port_.c_str());\n         return ERR_PORT_CHANGE_FORBIDDEN;\n      }\n\n      pProp->Get(port_);\n   }\n\n   return DEVICE_OK;\n}\n\nint SkeletonDevice::Initialize() \n{\n   return 0;\n}\n\nint SkeletonDevice::Shutdown() \n{\n   return 0;\n}\n\nvoid SkeletonDevice::GetName (char* Name) const\n{\n   CDeviceUtils::CopyLimitedString(Name, g_SkeletonDevicename);\n}\n\nbool SkeletonDevice::Busy() \n{\n   return false;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ $Id: esd_tracks.C 35148 2009-10-01 11:21:06Z mtadel $\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#if !defined(__CINT__) || defined(__MAKECINT__)\n\n#include \"TString.h\"\n#include \"TMath.h\"\n#include \"TGListTree.h\"\n#include \"TEveVSDStructs.h\"\n#include \"TEveManager.h\"\n#include \"TEveTrackPropagator.h\"\n\n#include \"AliESDEvent.h\"\n#include \"AliESDtrackCuts.h\"\n#include \"AliESDtrack.h\"\n#include \"AliExternalTrackParam.h\"\n\n#include \"EVE\/EveBase\/AliEveTrack.h\"\n#include \"EVE\/EveBase\/AliEveMagField.h\"\n#include \"EVE\/EveBase\/AliEveEventManager.h\"\n\n#include \"AliHLTTPCCATrackParam.h\"\n#include \"AliHLTTPCCATrackConvertor.h\"\n\n#endif\n\nAliEveTrack* hlt_esd_make_track(AliESDtrack *at, TEveTrackList* cont)\n{\n  \/\/ Make a standard track representation and put it into given container.\n\n  \/\/ Choose which parameters to use a track's starting point.\n  \/\/ If gkFixFailedITSExtr is TRUE (FALSE by default) and\n  \/\/ if ITS refit failed, take track parameters at inner TPC radius.\n\n  const double kCLight = 0.000299792458;\n  double bz = - kCLight*10.*( cont->GetPropagator()->GetMagField(0,0,0).fZ);\n\n  Bool_t innerTaken = kFALSE;\n  if ( ! at->IsOn(AliESDtrack::kITSrefit) && g_esd_tracks_use_ip_on_failed_its_refit)\n  {\n    \/\/tp = at->GetInnerParam();\n    innerTaken = kTRUE;\n  }\n\n  \/\/ Add inner\/outer track parameters as path-marks.\n\n  Double_t     pbuf[3], vbuf[3];\n\n  AliExternalTrackParam trackParam = *at;\n\n  \/\/ take parameters constrained to vertex (if they are)\n\n  if( at->GetConstrainedParam() ){\n    trackParam = *at->GetConstrainedParam();\n  }\n  else if( at->GetInnerParam() ){\n    trackParam = *(at->GetInnerParam());\n  }\n\n  TEveRecTrack rt;\n  {\n    rt.fLabel  = at->GetLabel();\n    rt.fIndex  = (Int_t) at->GetID();\n    rt.fStatus = (Int_t) at->GetStatus();\n    rt.fSign   = (Int_t) trackParam.GetSign();  \n    trackParam.GetXYZ(vbuf);\n    trackParam.GetPxPyPz(pbuf);    \n    rt.fV.Set(vbuf);\n    rt.fP.Set(pbuf);\n    Double_t ep = at->GetP(), mc = at->GetMass();\n    rt.fBeta = ep\/TMath::Sqrt(ep*ep + mc*mc);\n  }\n\n  AliEveTrack* track = new AliEveTrack(&rt, cont->GetPropagator());\n  track->SetAttLineAttMarker(cont);\n  track->SetName(Form(\"AliEveTrack %d\", at->GetID()));\n  track->SetElementTitle(esd_track_title(at));\n  track->SetSourceObject(at);\n\n\n  \/\/ Set reference points along the trajectory\n  \/\/ and the last point\n\n  { \n    TEvePathMark startPoint(TEvePathMark::kReference);\n    trackParam.GetXYZ(vbuf);\n    trackParam.GetPxPyPz(pbuf);    \n    startPoint.fV.Set(vbuf);\n    startPoint.fP.Set(pbuf);\n    rt.fV.Set(vbuf);\n    rt.fP.Set(pbuf);\n    Double_t ep = at->GetP(), mc = at->GetMass();\n    rt.fBeta = ep\/TMath::Sqrt(ep*ep + mc*mc);\n\n    track->AddPathMark( startPoint );    \n  }\n\n\n  if( at->GetTPCPoints(2)>80 ){\n  \n    \/\/\n    \/\/ use AliHLTTPCCATrackParam propagator \n    \/\/ since AliExternalTrackParam:PropagateTo()\n    \/\/ has an offset at big distances\n    \/\/\n    \n    AliHLTTPCCATrackParam t;\n    AliHLTTPCCATrackConvertor::SetExtParam( t, trackParam );\n    \n    Double_t x0 = trackParam.GetX();\n    Double_t dx = at->GetTPCPoints(2) - x0;\n    \n    \/\/\n    \/\/ set a reference at the half of trajectory for better drawing\n    \/\/\n    \n    for( double dxx=dx\/2; TMath::Abs(dxx)>=1.; dxx*=.9 ){\n      if( !t.TransportToX(x0+dxx, bz, .99 ) ) continue;\n      AliHLTTPCCATrackConvertor::GetExtParam( t, trackParam, trackParam.GetAlpha() ); \n      trackParam.GetXYZ(vbuf);\n      trackParam.GetPxPyPz(pbuf);\n      TEvePathMark midPoint(TEvePathMark::kReference);\n      midPoint.fV.Set(vbuf);\n      midPoint.fP.Set(pbuf);    \n      track->AddPathMark( midPoint );\n      break;\n    }\n    \n    \/\/\n    \/\/ Set a reference at the end of the trajectory\n    \/\/ and a \"decay point\", to let the event display know where the track ends\n    \/\/\n    \n    for( ; TMath::Abs(dx)>=1.; dx*=.9 ){\n      if( !t.TransportToX(x0+dx, bz, .99 ) ) continue;\n      AliHLTTPCCATrackConvertor::GetExtParam( t, trackParam, trackParam.GetAlpha() ); \n      trackParam.GetXYZ(vbuf);\n      trackParam.GetPxPyPz(pbuf);\n      TEvePathMark endPoint(TEvePathMark::kReference);\n      TEvePathMark decPoint(TEvePathMark::kDecay);\n      endPoint.fV.Set(vbuf);\n      endPoint.fP.Set(pbuf);\n      decPoint.fV.Set(vbuf);\n      decPoint.fP.Set(pbuf);\n      track->AddPathMark( endPoint );\n      track->AddPathMark( decPoint );\n      break;\n    }  \n  }\n\n  if (at->IsOn(AliESDtrack::kTPCrefit))\n  {\n    if ( ! innerTaken)\n    {\n      esd_track_add_param(track, at->GetInnerParam());\n    }\n    esd_track_add_param(track, at->GetOuterParam());\n  }\n\n\n  return track;\n}\n\n<commit_msg>updated for TRD tracks<commit_after>\/\/ $Id: esd_tracks.C 35148 2009-10-01 11:21:06Z mtadel $\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#if !defined(__CINT__) || defined(__MAKECINT__)\n\n#include \"TString.h\"\n#include \"TMath.h\"\n#include \"TGListTree.h\"\n#include \"TEveVSDStructs.h\"\n#include \"TEveManager.h\"\n#include \"TEveTrackPropagator.h\"\n\n#include \"AliESDEvent.h\"\n#include \"AliESDtrackCuts.h\"\n#include \"AliESDtrack.h\"\n#include \"AliExternalTrackParam.h\"\n\n#include \"EVE\/EveBase\/AliEveTrack.h\"\n#include \"EVE\/EveBase\/AliEveMagField.h\"\n#include \"EVE\/EveBase\/AliEveEventManager.h\"\n\n#include \"AliHLTTPCCATrackParam.h\"\n#include \"AliHLTTPCCATrackConvertor.h\"\n\n#endif\n\nAliEveTrack* hlt_esd_make_track(AliESDtrack *at, TEveTrackList* cont)\n{\n  \/\/ Make a standard track representation and put it into given container.\n\n  \/\/ Choose which parameters to use a track's starting point.\n  \/\/ If gkFixFailedITSExtr is TRUE (FALSE by default) and\n  \/\/ if ITS refit failed, take track parameters at inner TPC radius.\n\n  const double kCLight = 0.000299792458;\n  double bz = - kCLight*10.*( cont->GetPropagator()->GetMagField(0,0,0).fZ);\n\n  Bool_t innerTaken = kFALSE;\n  if ( ! at->IsOn(AliESDtrack::kITSrefit) && g_esd_tracks_use_ip_on_failed_its_refit)\n  {\n    \/\/tp = at->GetInnerParam();\n    innerTaken = kTRUE;\n  }\n\n  \/\/ Add inner\/outer track parameters as path-marks.\n\n  Double_t     pbuf[3], vbuf[3];\n\n  AliExternalTrackParam trackParam = *at;\n\n  \/\/ take parameters constrained to vertex (if they are)\n\n  if( at->GetConstrainedParam() ){\n    trackParam = *at->GetConstrainedParam();\n  }\n  else if( at->GetInnerParam() ){\n    trackParam = *(at->GetInnerParam());\n  }\n  if( at->GetStatus()&AliESDtrack::kTRDin ){\n    \/\/ transport to TRD in\n    trackParam = *at;\n    trackParam.PropagateTo( 290.45, -10.*( cont->GetPropagator()->GetMagField(0,0,0).fZ) );\n  }\n\n  TEveRecTrack rt;\n  {\n    rt.fLabel  = at->GetLabel();\n    rt.fIndex  = (Int_t) at->GetID();\n    rt.fStatus = (Int_t) at->GetStatus();\n    rt.fSign   = (Int_t) trackParam.GetSign();  \n    trackParam.GetXYZ(vbuf);\n    trackParam.GetPxPyPz(pbuf);    \n    rt.fV.Set(vbuf);\n    rt.fP.Set(pbuf);\n    Double_t ep = at->GetP(), mc = at->GetMass();\n    rt.fBeta = ep\/TMath::Sqrt(ep*ep + mc*mc);\n  }\n\n  AliEveTrack* track = new AliEveTrack(&rt, cont->GetPropagator());\n  track->SetAttLineAttMarker(cont);\n  track->SetName(Form(\"AliEveTrack %d\", at->GetID()));\n  track->SetElementTitle(esd_track_title(at));\n  track->SetSourceObject(at);\n\n\n  \/\/ Set reference points along the trajectory\n  \/\/ and the last point\n\n  { \n    TEvePathMark startPoint(TEvePathMark::kReference);\n    trackParam.GetXYZ(vbuf);\n    trackParam.GetPxPyPz(pbuf);    \n    startPoint.fV.Set(vbuf);\n    startPoint.fP.Set(pbuf);\n    rt.fV.Set(vbuf);\n    rt.fP.Set(pbuf);\n    Double_t ep = at->GetP(), mc = at->GetMass();\n    rt.fBeta = ep\/TMath::Sqrt(ep*ep + mc*mc);\n\n    track->AddPathMark( startPoint );    \n  }\n\n\n  if( at->GetTPCPoints(2)>80 ){\n  \n    \/\/\n    \/\/ use AliHLTTPCCATrackParam propagator \n    \/\/ since AliExternalTrackParam:PropagateTo()\n    \/\/ has an offset at big distances\n    \/\/\n    \n    AliHLTTPCCATrackParam t;\n    AliHLTTPCCATrackConvertor::SetExtParam( t, trackParam );\n    \n    Double_t x0 = trackParam.GetX();\n    Double_t dx = at->GetTPCPoints(2) - x0;\n    \n    \/\/\n    \/\/ set a reference at the half of trajectory for better drawing\n    \/\/\n    \n    for( double dxx=dx\/2; TMath::Abs(dxx)>=1.; dxx*=.9 ){\n      if( !t.TransportToX(x0+dxx, bz, .99 ) ) continue;\n      AliHLTTPCCATrackConvertor::GetExtParam( t, trackParam, trackParam.GetAlpha() ); \n      trackParam.GetXYZ(vbuf);\n      trackParam.GetPxPyPz(pbuf);\n      TEvePathMark midPoint(TEvePathMark::kReference);\n      midPoint.fV.Set(vbuf);\n      midPoint.fP.Set(pbuf);    \n      track->AddPathMark( midPoint );\n      break;\n    }\n    \n    \/\/\n    \/\/ Set a reference at the end of the trajectory\n    \/\/ and a \"decay point\", to let the event display know where the track ends\n    \/\/\n    \n    for( ; TMath::Abs(dx)>=1.; dx*=.9 ){\n      if( !t.TransportToX(x0+dx, bz, .99 ) ) continue;\n      AliHLTTPCCATrackConvertor::GetExtParam( t, trackParam, trackParam.GetAlpha() ); \n      trackParam.GetXYZ(vbuf);\n      trackParam.GetPxPyPz(pbuf);\n      TEvePathMark endPoint(TEvePathMark::kReference);\n      TEvePathMark decPoint(TEvePathMark::kDecay);\n      endPoint.fV.Set(vbuf);\n      endPoint.fP.Set(pbuf);\n      decPoint.fV.Set(vbuf);\n      decPoint.fP.Set(pbuf);\n      track->AddPathMark( endPoint );\n      track->AddPathMark( decPoint );\n      break;\n    }  \n  }\n\n  if (at->IsOn(AliESDtrack::kTPCrefit))\n  {\n    if ( ! innerTaken)\n    {\n      esd_track_add_param(track, at->GetInnerParam());\n    }\n    esd_track_add_param(track, at->GetOuterParam());\n  }\n\n\n  return track;\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\/\/This class produces PHOS trigger digits of one event.\n\/\/Authors: Henrik Qvigstad, Boris Polishchuk.\n\n#include \"AliPHOSTriggerRawDigiProducer.h\"\n#include \"AliPHOSTriggerRawReader.h\"\n#include \"AliPHOSTRURawReader.h\"\n#include \"AliPHOSTriggerParameters.h\"\n#include \"AliPHOSTriggerRawDigit.h\"\n#include \"AliPHOSGeometry.h\"\n#include \"AliRawReader.h\"\n#include \"AliCaloRawStreamV3.h\"\n\n#include \"TH1I.h\"\n#include \"TH2I.h\"\n\n#include <iostream>\nusing namespace std;\n\nClassImp(AliPHOSTriggerRawDigiProducer)\n\nAliPHOSTriggerRawDigiProducer::AliPHOSTriggerRawDigiProducer()\n  :fModules(kNMods, false),\n   fSaturationThreshold(950),\n   fParameters(0),\n   fRawReader(0),\n   fRawStream(0),\n   fTriggerReader(0)\n{}\n\nAliPHOSTriggerRawDigiProducer::AliPHOSTriggerRawDigiProducer(AliRawReader *rawReader)\n  :fModules(kNMods, false),\n   fSaturationThreshold(950),\n   fParameters(0),\n   fRawReader(rawReader),\n   fRawStream(0),\n   fTriggerReader(new AliPHOSTriggerRawReader)\n{\n  SetAnalyseModule(2);\n  SetAnalyseModule(3);\n  SetAnalyseModule(4);\n\n  fRawStream = new AliCaloRawStreamV3(rawReader,\"PHOS\");\n}\n\nAliPHOSTriggerRawDigiProducer::~AliPHOSTriggerRawDigiProducer()\n{\n  delete fRawStream;\n  delete fTriggerReader;\n}\n\nvoid AliPHOSTriggerRawDigiProducer::ProcessEvent(TClonesArray* tdigits)\n{\n  \n  fTriggerReader->Reset();\n\n  tdigits->Clear();\n  Int_t iDigit=0 ;\n\n  while (fRawStream->NextDDL()) {\n    while (fRawStream->NextChannel()) {\n\n      if (fRawStream->IsTRUData()) {\n\tfTriggerReader->ReadFromStream(fRawStream);\n      }\/\/ IsTRUData\n    }\/\/ NextChannel\n  }\/\/NextDDL\n\t\n  \/\/ Loop over modules\n  for(unsigned int mod = 0; mod < fModules.size(); ++mod) {\n    if( fModules[mod] ) {\n      \n      \/\/ Loop over 4x4 cells\n      for(int TRURow = 0; TRURow < kNTRURows; ++TRURow) {\n\tfor(int branch = 0; branch < kNBranches; ++branch) {\n\t  \n\t  AliPHOSTRURawReader* truReader = fTriggerReader->GetTRU(mod, TRURow, branch);\n\t  if( truReader->IsActive() ) {\n\t    \n\t    for(int xIdx = 0; xIdx < kN4x4XPrTRURow; ++xIdx) {\n\t      for(int zIdx = 0; zIdx < kN4x4ZPrBranch; ++zIdx) {\n\t      \n\t\t\/\/ Determin if Trigger is flagged for any timeBin\n\t\tbool triggered = false;\n\n\t\tfor(int timeBin = 0; timeBin < kNTRUTimeBins; ++timeBin){\n\t\t  if(truReader->IsActive(timeBin)) {\n\t\t    if( fTriggerReader->GetTRU(mod, TRURow, branch)->GetTriggerFlag(xIdx, zIdx, timeBin) ){\n\t\t      triggered = true;\n\t\t    } \/\/ end \"if TriggerBit\"\n\t\t  }\n\t\t}\/\/ end TimeBin loop\n\t\t\n\t\tif( triggered ){\n\t\t  \/\/ Get peak values\n\t\t  const int TSmax = Get4x4Max(fTriggerReader, fParameters, mod, TRURow, branch, xIdx, zIdx);\n\t\t  new((*tdigits)[iDigit]) AliPHOSTriggerRawDigit(mod,xIdx,zIdx,TRURow,branch,TSmax); \n\t\t  iDigit++;\n\t\t}\/\/ end  \"if triggered\"\n\t      \n\t      } \/\/ end zIdx loop\n\t    } \/\/ end xIdx loop\n\t  } \/\/ truReader->IsActive\n\t} \/\/ end branch loop\n      } \/\/ end tru loop\n    } \/\/ end \"if module\"\n  } \/\/ end mod loop\n  \n}\n\nint AliPHOSTriggerRawDigiProducer::Get2x2Max(AliPHOSTriggerRawReader* reader, AliPHOSTriggerParameters* params, int mod, int xIdx, int zIdx)\n{\n  int max = 0;\n  for(int timeBin = 0; timeBin < kNTRUTimeBins; ++timeBin) {\n    const int signal = Get2x2Signal(reader, params, mod, xIdx, zIdx, timeBin);\n    if( max < signal ){\n      max = signal;\n    }\n  }\n  return max;\n}\n\n\nint AliPHOSTriggerRawDigiProducer::Get2x2Signal(AliPHOSTriggerRawReader* reader, AliPHOSTriggerParameters* parameters, int mod, int xIdx, int zIdx, int timeBin)\n{\n  const int TRURow = xIdx \/ kN2x2XPrTRURow;\n  const int branch = zIdx \/ kN2x2ZPrBranch;\n  const int TRUX = xIdx % kN2x2XPrTRURow; \/\/ 2x2 coordinates\n  const int TRUZ = zIdx % kN2x2ZPrBranch; \/\/ 2x2 coordinates\n\n  if( reader->GetTRU(mod, TRURow, branch)->IsActive() ){\n    const int signal = reader->GetTRU(mod, TRURow, branch)->GetTriggerSignal( TRUX, TRUZ, timeBin);\n    if( parameters )\n      return signal - parameters->GetTRUPedestal(mod, TRURow, branch, TRUX, TRUZ);\n    else\n      return signal - AliPHOSTRURawReader::kDefaultSignalValue;\n  }\n  else\n    return 0;\n}\n\nint AliPHOSTriggerRawDigiProducer::Get4x4Max(AliPHOSTriggerRawReader* reader, AliPHOSTriggerParameters* params, int mod, int TRURow, int branch, int xIdx, int zIdx)\n{\n  int max = 0;\n  for(int timeBin = 0; timeBin < kNTRUTimeBins; ++timeBin) {\n    const int signal = Get4x4Signal(reader, params, mod, TRURow, branch, xIdx, zIdx, timeBin);\n    if( max < signal ){\n      max = signal;\n    }\n  }\n  return max;\n}\n\n\nint AliPHOSTriggerRawDigiProducer::Get4x4Signal(AliPHOSTriggerRawReader* reader, AliPHOSTriggerParameters* params, int mod, int TRURow, int branch, int xIdx, int zIdx, int timeBin)\n{\n  const int modX = xIdx + TRURow * kN2x2XPrTRURow;\n  const int modZ = zIdx + branch * kN2x2ZPrBranch;\n\n  const int signal\n    = Get2x2Signal(reader, params, mod, modX  , modZ  , timeBin)\n      + Get2x2Signal(reader, params, mod, modX+1, modZ  , timeBin)\n      + Get2x2Signal(reader, params, mod, modX  , modZ+1, timeBin)\n      + Get2x2Signal(reader, params, mod, modX+1, modZ+1, timeBin);\n  return signal;\n}\n\nbool AliPHOSTriggerRawDigiProducer::Is2x2Active(AliPHOSTriggerRawReader* reader, int mod, int xIdx, int zIdx)\n{\n  const int TRURow = xIdx \/ kN2x2XPrTRURow;\n  const int branch = zIdx \/ kN2x2ZPrBranch;\n\n  return reader->GetTRU(mod, TRURow, branch)->IsActive();\n}\n\nbool AliPHOSTriggerRawDigiProducer::Is2x2Active(AliPHOSTriggerRawReader* reader, int mod, int xIdx, int zIdx, int timeBin)\n{\n  const int TRURow = xIdx \/ kN2x2XPrTRURow;\n  const int branch = zIdx \/ kN2x2ZPrBranch;\n\n  return reader->GetTRU(mod, TRURow, branch)->IsActive(timeBin);\n}\n\n\n<commit_msg>Added functionality in AliPHOSTRURawReader to test if data 'Has Signal' (FakeALTRO).<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\/\/This class produces PHOS trigger digits of one event.\n\/\/Authors: Henrik Qvigstad, Boris Polishchuk.\n\n#include \"AliPHOSTriggerRawDigiProducer.h\"\n#include \"AliPHOSTriggerRawReader.h\"\n#include \"AliPHOSTRURawReader.h\"\n#include \"AliPHOSTriggerParameters.h\"\n#include \"AliPHOSTriggerRawDigit.h\"\n#include \"AliPHOSGeometry.h\"\n#include \"AliRawReader.h\"\n#include \"AliCaloRawStreamV3.h\"\n\n#include \"TH1I.h\"\n#include \"TH2I.h\"\n\n#include <iostream>\nusing namespace std;\n\nClassImp(AliPHOSTriggerRawDigiProducer)\n\nAliPHOSTriggerRawDigiProducer::AliPHOSTriggerRawDigiProducer()\n  :fModules(kNMods, false),\n   fSaturationThreshold(950),\n   fParameters(0),\n   fRawReader(0),\n   fRawStream(0),\n   fTriggerReader(0)\n{}\n\nAliPHOSTriggerRawDigiProducer::AliPHOSTriggerRawDigiProducer(AliRawReader *rawReader)\n  :fModules(kNMods, false),\n   fSaturationThreshold(950),\n   fParameters(0),\n   fRawReader(rawReader),\n   fRawStream(0),\n   fTriggerReader(new AliPHOSTriggerRawReader)\n{\n  SetAnalyseModule(2);\n  SetAnalyseModule(3);\n  SetAnalyseModule(4);\n\n  fRawStream = new AliCaloRawStreamV3(rawReader,\"PHOS\");\n}\n\nAliPHOSTriggerRawDigiProducer::~AliPHOSTriggerRawDigiProducer()\n{\n  delete fRawStream;\n  delete fTriggerReader;\n}\n\nvoid AliPHOSTriggerRawDigiProducer::ProcessEvent(TClonesArray* tdigits)\n{\n  \n  fTriggerReader->Reset();\n\n  tdigits->Clear();\n  Int_t iDigit=0 ;\n\n  while (fRawStream->NextDDL()) {\n    while (fRawStream->NextChannel()) {\n\n      if (fRawStream->IsTRUData()) {\n\tfTriggerReader->ReadFromStream(fRawStream);\n      }\/\/ IsTRUData\n    }\/\/ NextChannel\n  }\/\/NextDDL\n\t\n  \/\/ Loop over modules\n  for(unsigned int mod = 0; mod < fModules.size(); ++mod) {\n    if( fModules[mod] ) {\n      \n      \/\/ Loop over 4x4 cells\n      for(int TRURow = 0; TRURow < kNTRURows; ++TRURow) {\n\tfor(int branch = 0; branch < kNBranches; ++branch) {\n\t  \n\t  AliPHOSTRURawReader* truReader = fTriggerReader->GetTRU(mod, TRURow, branch);\n\t  if( truReader->IsActive() ) {\n\t    \n\t    for(int xIdx = 0; xIdx < kN4x4XPrTRURow; ++xIdx) {\n\t      for(int zIdx = 0; zIdx < kN4x4ZPrBranch; ++zIdx) {\n\t      \n\t\t\/\/ Determin if Trigger is flagged for any timeBin\n\t\tbool triggered = false;\n\n\t\tfor(int timeBin = 0; timeBin < kNTRUTimeBins; ++timeBin){\n\t\t  if(truReader->IsActive(timeBin)) {\n\t\t    if( fTriggerReader->GetTRU(mod, TRURow, branch)->GetTriggerFlag(xIdx, zIdx, timeBin) ){\n\t\t      triggered = true;\n\t\t    } \/\/ end \"if TriggerBit\"\n\t\t  }\n\t\t}\/\/ end TimeBin loop\n\t\t\n\t\tif( triggered && truReader->HasSignal() ){\n\t\t  \/\/ Get peak values\n\t\t  const int TSmax = Get4x4Max(fTriggerReader, fParameters, mod, TRURow, branch, xIdx, zIdx);\n\t\t  new((*tdigits)[iDigit]) AliPHOSTriggerRawDigit(mod,xIdx,zIdx,TRURow,branch,TSmax); \n\t\t  iDigit++;\n\t\t}\/\/ end  \"if triggered\"\n\t      \n\t      } \/\/ end zIdx loop\n\t    } \/\/ end xIdx loop\n\t  } \/\/ truReader->IsActive\n\t} \/\/ end branch loop\n      } \/\/ end tru loop\n    } \/\/ end \"if module\"\n  } \/\/ end mod loop\n  \n}\n\nint AliPHOSTriggerRawDigiProducer::Get2x2Max(AliPHOSTriggerRawReader* reader, AliPHOSTriggerParameters* params, int mod, int xIdx, int zIdx)\n{\n  int max = 0;\n  for(int timeBin = 0; timeBin < kNTRUTimeBins; ++timeBin) {\n    const int signal = Get2x2Signal(reader, params, mod, xIdx, zIdx, timeBin);\n    if( max < signal ){\n      max = signal;\n    }\n  }\n  return max;\n}\n\n\nint AliPHOSTriggerRawDigiProducer::Get2x2Signal(AliPHOSTriggerRawReader* reader, AliPHOSTriggerParameters* parameters, int mod, int xIdx, int zIdx, int timeBin)\n{\n  const int TRURow = xIdx \/ kN2x2XPrTRURow;\n  const int branch = zIdx \/ kN2x2ZPrBranch;\n  const int TRUX = xIdx % kN2x2XPrTRURow; \/\/ 2x2 coordinates\n  const int TRUZ = zIdx % kN2x2ZPrBranch; \/\/ 2x2 coordinates\n\n  AliPHOSTRURawReader* truReader = reader->GetTRU(mod, TRURow, branch);\n  if( truReader->IsActive(timeBin) && truReader->HasSignal(timeBin)  ){\n    const int signal = reader->GetTRU(mod, TRURow, branch)->GetTriggerSignal( TRUX, TRUZ, timeBin);\n    if( parameters )\n      return signal - parameters->GetTRUPedestal(mod, TRURow, branch, TRUX, TRUZ);\n    else\n      return signal - AliPHOSTRURawReader::kDefaultSignalValue;\n  }\n  else\n    return 0;\n}\n\nint AliPHOSTriggerRawDigiProducer::Get4x4Max(AliPHOSTriggerRawReader* reader, AliPHOSTriggerParameters* params, int mod, int TRURow, int branch, int xIdx, int zIdx)\n{\n  int max = 0;\n  for(int timeBin = 0; timeBin < kNTRUTimeBins; ++timeBin) {\n    const int signal = Get4x4Signal(reader, params, mod, TRURow, branch, xIdx, zIdx, timeBin);\n    if( max < signal ){\n      max = signal;\n    }\n  }\n  return max;\n}\n\n\nint AliPHOSTriggerRawDigiProducer::Get4x4Signal(AliPHOSTriggerRawReader* reader, AliPHOSTriggerParameters* params, int mod, int TRURow, int branch, int xIdx, int zIdx, int timeBin)\n{\n  const int modX = xIdx + TRURow * kN2x2XPrTRURow;\n  const int modZ = zIdx + branch * kN2x2ZPrBranch;\n\n  const int signal\n    = Get2x2Signal(reader, params, mod, modX  , modZ  , timeBin)\n      + Get2x2Signal(reader, params, mod, modX+1, modZ  , timeBin)\n      + Get2x2Signal(reader, params, mod, modX  , modZ+1, timeBin)\n      + Get2x2Signal(reader, params, mod, modX+1, modZ+1, timeBin);\n  return signal;\n}\n\nbool AliPHOSTriggerRawDigiProducer::Is2x2Active(AliPHOSTriggerRawReader* reader, int mod, int xIdx, int zIdx)\n{\n  const int TRURow = xIdx \/ kN2x2XPrTRURow;\n  const int branch = zIdx \/ kN2x2ZPrBranch;\n\n  return reader->GetTRU(mod, TRURow, branch)->IsActive();\n}\n\nbool AliPHOSTriggerRawDigiProducer::Is2x2Active(AliPHOSTriggerRawReader* reader, int mod, int xIdx, int zIdx, int timeBin)\n{\n  const int TRURow = xIdx \/ kN2x2XPrTRURow;\n  const int branch = zIdx \/ kN2x2ZPrBranch;\n\n  return reader->GetTRU(mod, TRURow, branch)->IsActive(timeBin);\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: AccessibleGraphicShape.cxx,v $\n *\n *  $Revision: 1.11 $\n *\n *  last change: $Author: vg $ $Date: 2003-04-24 16:53: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 _SVX_ACCESSIBILITY_ACCESSIBLE_GRAPHIC_SHAPE_HXX\n#include \"AccessibleGraphicShape.hxx\"\n#endif\n\n#include \"ShapeTypeHandler.hxx\"\n#include \"SvxShapeTypes.hxx\"\n\nusing namespace ::accessibility;\nusing namespace ::rtl;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::accessibility;\n\n\/\/=====  internal  ============================================================\n\nAccessibleGraphicShape::AccessibleGraphicShape (\n    const AccessibleShapeInfo& rShapeInfo,\n    const AccessibleShapeTreeInfo& rShapeTreeInfo)\n    : AccessibleShape (rShapeInfo, rShapeTreeInfo)\n{\n}\n\n\n\n\nAccessibleGraphicShape::~AccessibleGraphicShape (void)\n{\n}\n\n\n\n\n\/\/=====  XAccessibleImage  ====================================================\n\n::rtl::OUString SAL_CALL AccessibleGraphicShape::getAccessibleImageDescription (void)\n    throw (::com::sun::star::uno::RuntimeException)\n{\n    return AccessibleShape::getAccessibleDescription ();\n}\n\n\n\n\nsal_Int32 SAL_CALL AccessibleGraphicShape::getAccessibleImageHeight (void)\n    throw (::com::sun::star::uno::RuntimeException)\n{\n    return AccessibleShape::getSize().Height;\n}\n\n\n\n\nsal_Int32 SAL_CALL AccessibleGraphicShape::getAccessibleImageWidth (void)\n    throw (::com::sun::star::uno::RuntimeException)\n{\n    return AccessibleShape::getSize().Width;\n}\n\n\n\n\n\/\/=====  XInterface  ==========================================================\n\ncom::sun::star::uno::Any SAL_CALL\n    AccessibleGraphicShape::queryInterface (const com::sun::star::uno::Type & rType)\n    throw (::com::sun::star::uno::RuntimeException)\n{\n    ::com::sun::star::uno::Any aReturn = AccessibleShape::queryInterface (rType);\n    if ( ! aReturn.hasValue())\n        aReturn = ::cppu::queryInterface (rType,\n            static_cast<XAccessibleImage*>(this));\n    return aReturn;\n}\n\n\n\nvoid SAL_CALL\n    AccessibleGraphicShape::acquire (void)\n    throw ()\n{\n    AccessibleShape::acquire ();\n}\n\n\n\nvoid SAL_CALL\n    AccessibleGraphicShape::release (void)\n    throw ()\n{\n    AccessibleShape::release ();\n}\n\n\n\n\n\/\/=====  XServiceInfo  ========================================================\n\n::rtl::OUString SAL_CALL\n    AccessibleGraphicShape::getImplementationName (void)\n    throw (::com::sun::star::uno::RuntimeException)\n{\n    return ::rtl::OUString(\n        RTL_CONSTASCII_USTRINGPARAM(\"AccessibleGraphicShape\"));\n}\n\n\n\n\n::com::sun::star::uno::Sequence< ::rtl::OUString> SAL_CALL\n    AccessibleGraphicShape::getSupportedServiceNames (void)\n    throw (::com::sun::star::uno::RuntimeException)\n{\n    ThrowIfDisposed ();\n    \/\/ Get list of supported service names from base class...\n    uno::Sequence<OUString> aServiceNames =\n        AccessibleShape::getSupportedServiceNames();\n    sal_Int32 nCount (aServiceNames.getLength());\n\n    \/\/ ...and add additional names.\n    aServiceNames.realloc (nCount + 1);\n    static const OUString sAdditionalServiceName (RTL_CONSTASCII_USTRINGPARAM(\n        \"com.sun.star.drawing.AccessibleGraphicShape\"));\n    aServiceNames[nCount] = sAdditionalServiceName;\n\n    return aServiceNames;\n}\n\n\n\n\n\/\/=====  XTypeProvider  ===================================================\n\nuno::Sequence<uno::Type> SAL_CALL\n    AccessibleGraphicShape::getTypes (void)\n    throw (uno::RuntimeException)\n{\n    \/\/ Get list of types from the context base implementation...\n    uno::Sequence<uno::Type> aTypeList (AccessibleShape::getTypes());\n    \/\/ ...and add the additional type for the component.\n    long nTypeCount = aTypeList.getLength();\n    aTypeList.realloc (nTypeCount + 1);\n    const uno::Type aImageType =\n        ::getCppuType((const uno::Reference<XAccessibleImage>*)0);\n    aTypeList[nTypeCount] = aImageType;\n\n    return aTypeList;\n}\n\n\n\n\n\/\/\/ Create the base name of this object, i.e. the name without appended number.\n::rtl::OUString\n    AccessibleGraphicShape::CreateAccessibleBaseName (void)\n    throw (::com::sun::star::uno::RuntimeException)\n{\n    ::rtl::OUString sName;\n\n    ShapeTypeId nShapeType = ShapeTypeHandler::Instance().GetTypeId (mxShape);\n    switch (nShapeType)\n    {\n        case DRAWING_GRAPHIC_OBJECT:\n            sName = ::rtl::OUString (RTL_CONSTASCII_USTRINGPARAM(\"GraphicObjectShape\"));\n            break;\n\n        default:\n            sName = ::rtl::OUString (RTL_CONSTASCII_USTRINGPARAM(\"UnknownAccessibleGraphicShape\"));\n            uno::Reference<drawing::XShapeDescriptor> xDescriptor (mxShape, uno::UNO_QUERY);\n            if (xDescriptor.is())\n                sName += ::rtl::OUString (RTL_CONSTASCII_USTRINGPARAM(\": \"))\n                    + xDescriptor->getShapeType();\n    }\n\n    return sName;\n}\n\n\n\n::rtl::OUString\n    AccessibleGraphicShape::CreateAccessibleDescription (void)\n    throw (::com::sun::star::uno::RuntimeException)\n{\n    return CreateAccessibleName ();\n}\n<commit_msg>INTEGRATION: CWS ooo19126 (1.11.1444); FILE MERGED 2005\/09\/05 14:18:43 rt 1.11.1444.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: AccessibleGraphicShape.cxx,v $\n *\n *  $Revision: 1.12 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 20:15: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\n#ifndef _SVX_ACCESSIBILITY_ACCESSIBLE_GRAPHIC_SHAPE_HXX\n#include \"AccessibleGraphicShape.hxx\"\n#endif\n\n#include \"ShapeTypeHandler.hxx\"\n#include \"SvxShapeTypes.hxx\"\n\nusing namespace ::accessibility;\nusing namespace ::rtl;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::accessibility;\n\n\/\/=====  internal  ============================================================\n\nAccessibleGraphicShape::AccessibleGraphicShape (\n    const AccessibleShapeInfo& rShapeInfo,\n    const AccessibleShapeTreeInfo& rShapeTreeInfo)\n    : AccessibleShape (rShapeInfo, rShapeTreeInfo)\n{\n}\n\n\n\n\nAccessibleGraphicShape::~AccessibleGraphicShape (void)\n{\n}\n\n\n\n\n\/\/=====  XAccessibleImage  ====================================================\n\n::rtl::OUString SAL_CALL AccessibleGraphicShape::getAccessibleImageDescription (void)\n    throw (::com::sun::star::uno::RuntimeException)\n{\n    return AccessibleShape::getAccessibleDescription ();\n}\n\n\n\n\nsal_Int32 SAL_CALL AccessibleGraphicShape::getAccessibleImageHeight (void)\n    throw (::com::sun::star::uno::RuntimeException)\n{\n    return AccessibleShape::getSize().Height;\n}\n\n\n\n\nsal_Int32 SAL_CALL AccessibleGraphicShape::getAccessibleImageWidth (void)\n    throw (::com::sun::star::uno::RuntimeException)\n{\n    return AccessibleShape::getSize().Width;\n}\n\n\n\n\n\/\/=====  XInterface  ==========================================================\n\ncom::sun::star::uno::Any SAL_CALL\n    AccessibleGraphicShape::queryInterface (const com::sun::star::uno::Type & rType)\n    throw (::com::sun::star::uno::RuntimeException)\n{\n    ::com::sun::star::uno::Any aReturn = AccessibleShape::queryInterface (rType);\n    if ( ! aReturn.hasValue())\n        aReturn = ::cppu::queryInterface (rType,\n            static_cast<XAccessibleImage*>(this));\n    return aReturn;\n}\n\n\n\nvoid SAL_CALL\n    AccessibleGraphicShape::acquire (void)\n    throw ()\n{\n    AccessibleShape::acquire ();\n}\n\n\n\nvoid SAL_CALL\n    AccessibleGraphicShape::release (void)\n    throw ()\n{\n    AccessibleShape::release ();\n}\n\n\n\n\n\/\/=====  XServiceInfo  ========================================================\n\n::rtl::OUString SAL_CALL\n    AccessibleGraphicShape::getImplementationName (void)\n    throw (::com::sun::star::uno::RuntimeException)\n{\n    return ::rtl::OUString(\n        RTL_CONSTASCII_USTRINGPARAM(\"AccessibleGraphicShape\"));\n}\n\n\n\n\n::com::sun::star::uno::Sequence< ::rtl::OUString> SAL_CALL\n    AccessibleGraphicShape::getSupportedServiceNames (void)\n    throw (::com::sun::star::uno::RuntimeException)\n{\n    ThrowIfDisposed ();\n    \/\/ Get list of supported service names from base class...\n    uno::Sequence<OUString> aServiceNames =\n        AccessibleShape::getSupportedServiceNames();\n    sal_Int32 nCount (aServiceNames.getLength());\n\n    \/\/ ...and add additional names.\n    aServiceNames.realloc (nCount + 1);\n    static const OUString sAdditionalServiceName (RTL_CONSTASCII_USTRINGPARAM(\n        \"com.sun.star.drawing.AccessibleGraphicShape\"));\n    aServiceNames[nCount] = sAdditionalServiceName;\n\n    return aServiceNames;\n}\n\n\n\n\n\/\/=====  XTypeProvider  ===================================================\n\nuno::Sequence<uno::Type> SAL_CALL\n    AccessibleGraphicShape::getTypes (void)\n    throw (uno::RuntimeException)\n{\n    \/\/ Get list of types from the context base implementation...\n    uno::Sequence<uno::Type> aTypeList (AccessibleShape::getTypes());\n    \/\/ ...and add the additional type for the component.\n    long nTypeCount = aTypeList.getLength();\n    aTypeList.realloc (nTypeCount + 1);\n    const uno::Type aImageType =\n        ::getCppuType((const uno::Reference<XAccessibleImage>*)0);\n    aTypeList[nTypeCount] = aImageType;\n\n    return aTypeList;\n}\n\n\n\n\n\/\/\/ Create the base name of this object, i.e. the name without appended number.\n::rtl::OUString\n    AccessibleGraphicShape::CreateAccessibleBaseName (void)\n    throw (::com::sun::star::uno::RuntimeException)\n{\n    ::rtl::OUString sName;\n\n    ShapeTypeId nShapeType = ShapeTypeHandler::Instance().GetTypeId (mxShape);\n    switch (nShapeType)\n    {\n        case DRAWING_GRAPHIC_OBJECT:\n            sName = ::rtl::OUString (RTL_CONSTASCII_USTRINGPARAM(\"GraphicObjectShape\"));\n            break;\n\n        default:\n            sName = ::rtl::OUString (RTL_CONSTASCII_USTRINGPARAM(\"UnknownAccessibleGraphicShape\"));\n            uno::Reference<drawing::XShapeDescriptor> xDescriptor (mxShape, uno::UNO_QUERY);\n            if (xDescriptor.is())\n                sName += ::rtl::OUString (RTL_CONSTASCII_USTRINGPARAM(\": \"))\n                    + xDescriptor->getShapeType();\n    }\n\n    return sName;\n}\n\n\n\n::rtl::OUString\n    AccessibleGraphicShape::CreateAccessibleDescription (void)\n    throw (::com::sun::star::uno::RuntimeException)\n{\n    return CreateAccessibleName ();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ $Id$\n\/\/\n\/\/ Hadronic correction task.\n\/\/\n\/\/\n\n#include <TChain.h>\n#include <TClonesArray.h>\n#include <TH1F.h>\n#include <TH2F.h>\n#include <TList.h>\n#include <TLorentzVector.h>\n#include <TParticle.h>\n#include \"AliAODCaloCluster.h\"\n#include \"AliAODEvent.h\"\n#include \"AliAnalysisManager.h\"\n#include \"AliCentrality.h\"\n#include \"AliESDCaloCluster.h\"\n#include \"AliESDtrack.h\"\n#include \"AliFJWrapper.h\"\n#include \"AliPicoTrack.h\"\n#include \"AliVEventHandler.h\"\n#include \"AliHadCorrTask.h\"\n\nClassImp(AliHadCorrTask)\n\n\/\/________________________________________________________________________\nAliHadCorrTask::AliHadCorrTask() : \n  AliAnalysisTaskSE(\"AliHadCorrTask\"),\n  fTracksName(),\n  fCaloName(),\n  fOutCaloName(),\n  fHadCorr(0),\n  fMinPt(0.15),\n  fOutClusters(0),\n  fOutputList(0),\n  fHistNclusvsCent(0),\n  fHistNclusMatchvsCent(0),\n  fHistEbefore(0),\n  fHistEafter(0),\n  fHistEoPCent(0),\n  fHistNMatchCent(0)\n{\n  \/\/ Default constructor.\n\n  for(Int_t i=0; i<4; ++i) {\n    fHistMatchEvsP[i]   = 0;\n    fHistMatchdRvsEP[i] = 0;\n    for(Int_t j=0; j<5; ++j) \n      fHistMatchEtaPhi[i][j] = 0;\n  }\n}\n\n\/\/________________________________________________________________________\nAliHadCorrTask::AliHadCorrTask(const char *name) : \n  AliAnalysisTaskSE(name),\n  fTracksName(\"Tracks\"),\n  fCaloName(\"CaloClusters\"),\n  fOutCaloName(\"CaloClustersCorr\"),\n  fHadCorr(0),\n  fMinPt(0.15),\n  fOutClusters(0),\n  fOutputList(0),\n  fHistNclusvsCent(0),\n  fHistNclusMatchvsCent(0),\n  fHistEbefore(0),\n  fHistEafter(0),\n  fHistEoPCent(0),\n  fHistNMatchCent(0)\n{\n  \/\/ Standard constructor.\n\n  for(Int_t i=0; i<4; ++i) {\n    fHistMatchEvsP[i]   = 0;\n    fHistMatchdRvsEP[i] = 0;\n    for(Int_t j=0; j<5; ++j) \n      fHistMatchEtaPhi[i][j] = 0;\n  }\n\n  fBranchNames=\"ESD:AliESDRun.,AliESDHeader.,PrimaryVertex.\";\n\n  DefineInput(0,TChain::Class());\n  DefineOutput(1,TList::Class());\n}\n\n\/\/________________________________________________________________________\nAliHadCorrTask::~AliHadCorrTask()\n{\n  \/\/ Destructor\n}\n\n\/\/________________________________________________________________________\nInt_t AliHadCorrTask::GetCentBin(Double_t cent) const\n{\n  \/\/ Get centrality bin.\n\n  Int_t centbin = -1;\n  if (cent>=0 && cent<10) \n    centbin=0;\n  else if (cent>=10 && cent<30) \n    centbin=1;\n  else if (cent>=30 && cent<50) \n    centbin=2;\n  else if (cent>=50 && cent<=100) \n    centbin=3;\n\n  return centbin;\n}\n\n\/\/________________________________________________________________________\nInt_t AliHadCorrTask::GetMomBin(Double_t p) const\n{\n  \/\/ Get momenum bin.\n\n  Int_t pbin=-1;\n  if (p>=0 && p<0.5) \n    pbin=0;\n  else if (p>=0.5 && p<2.) \n    pbin=1;\n  else if (p>=2. && p<3.) \n    pbin=2;\n  else if (p>=3. && p<5.) \n    pbin=3;\n  else if (p>=5.) \n    pbin=4;\n\n  return pbin;\n}\n\n\/\/________________________________________________________________________\nvoid AliHadCorrTask::UserCreateOutputObjects()\n{\n  \/\/ Create my user objects.\n\n  AliVEventHandler* handler = AliAnalysisManager::GetAnalysisManager()->GetInputEventHandler();\n  if (!handler) {\n    AliError(\"Input handler not available!\");\n    return;\n  }\n \n  if (handler->InheritsFrom(\"AliESDInputHandler\")) {\n    fOutClusters = new TClonesArray(\"AliESDCaloCluster\");\n  } else if (handler->InheritsFrom(\"AliAODInputHandler\")) {\n    fOutClusters = new TClonesArray(\"AliAODCaloCluster\");\n  } else {\n    AliError(\"Input handler not recognized!\");\n    return;\n  }\n  fOutClusters->SetName(fOutCaloName);\n \n  OpenFile(1);\n  fOutputList = new TList();\n  fOutputList->SetOwner();\n\n  for(Int_t icent=0; icent<4; ++icent) {\n    for(Int_t ipt=0; ipt<5; ++ipt){\n      TString name(Form(\"fHistMatchEtaPhi_%i_%i\",icent,ipt));\n      fHistMatchEtaPhi[icent][ipt] = new TH2F(name, name, 400, -0.2, 0.2, 1600, -0.8, 0.8);\n      fOutputList->Add(fHistMatchEtaPhi[icent][ipt]);\n    }\n\n    TString name(Form(\"fHistMatchEvsP_%i\",icent));\n    fHistMatchEvsP[icent] = new TH2F(name, name, 400, 0., 200., 1000, 0., 10.);\n    fOutputList->Add(fHistMatchEvsP[icent]);\n\n    name = Form(\"fHistMatchdRvsEP_%i\",icent);\n    fHistMatchdRvsEP[icent] = new TH2F(name, name, 1000, 0., 1., 1000, 0., 10.);\n    fOutputList->Add(fHistMatchdRvsEP[icent]);\n  }\n\n  fHistNclusvsCent      = new TH1F(\"Nclusvscent\",      \"NclusVsCent\",      100, 0, 100);\n  fHistNclusMatchvsCent = new TH1F(\"NclusMatchvscent\", \"NclusMatchVsCent\", 100, 0, 100);\n  fHistEbefore          = new TH1F(\"Ebefore\",          \"Ebefore\",          100, 0, 100);\n  fHistEafter           = new TH1F(\"Eafter\",           \"Eafter\",           100, 0, 100);\n  fHistEoPCent          = new TH2F(\"EoPCent\",          \"EoPCent\",          100, 0, 100, 1000, 0,   10);\n  fHistNMatchCent       = new TH2F(\"NMatchesCent\",     \"NMatchesCent\",     100, 0, 100, 101, -0.5, 100.5);\n  fOutputList->Add(fHistNclusMatchvsCent);\n  fOutputList->Add(fHistNclusvsCent);\n  fOutputList->Add(fHistEbefore);\n  fOutputList->Add(fHistEafter);\n  fOutputList->Add(fHistEoPCent);\n  fOutputList->Add(fHistNMatchCent);\n\n  PostData(1, fOutputList);\n}\n\n\/\/________________________________________________________________________\nvoid AliHadCorrTask::UserExec(Option_t *) \n{\n  \/\/ Execute per event.\n\n  \/\/ post output in event if not yet present\n  if (!(InputEvent()->FindListObject(fOutCaloName)))\n    InputEvent()->AddObject(fOutClusters);\n  \n  \/\/ delete output\n  fOutClusters->Delete();\n\n  \/\/ esd or aod mode\n  Bool_t esdMode = kTRUE;\n  if (dynamic_cast<AliAODEvent*>(InputEvent()))\n      esdMode = kFALSE;\n\n  \/\/ optimization in case autobranch loading is off\n  AliAnalysisManager *am = AliAnalysisManager::GetAnalysisManager();\n  if (fCaloName == \"CaloClusters\")\n    am->LoadBranch(\"CaloClusters\");\n  if (fTracksName == \"Tracks\")\n    am->LoadBranch(\"Tracks\");\n\n  \/\/ get centrality \n  Float_t cent = -1; \n  AliCentrality *centrality = InputEvent()->GetCentrality() ;\n  if (centrality)\n    cent = centrality->GetCentralityPercentile(\"V0M\");\n  else\n    cent=99; \/\/ probably pp data\n  if (cent<0) {\n    AliError(Form(\"Centrality negative: %f\", cent));\n    return;\n  }\n  Int_t centbin = GetCentBin(cent);\n\n  \/\/ get input collections\n  TClonesArray *tracks = 0;\n  TClonesArray *clus   = 0;\n  TList *l = InputEvent()->GetList();\n  tracks = dynamic_cast<TClonesArray*>(l->FindObject(fTracksName));\n  if (!tracks) {\n    AliError(Form(\"Pointer to tracks %s == 0\", fTracksName.Data() ));\n    return;\n  }\n  clus = dynamic_cast<TClonesArray*>(l->FindObject(fCaloName));\n  if (!clus) {\n    AliError(Form(\"Pointer to clus %s == 0\", fCaloName.Data() ));\n    return;\n  }\n\n  \/\/ get primary vertex\n  Double_t vertex[3] = {0, 0, 0};\n  InputEvent()->GetPrimaryVertex()->GetXYZ(vertex);\n\n  \/\/ loop over clusters and tracks\n  const Int_t Nclus = clus->GetEntries();\n  const Int_t Ntrks = tracks->GetEntries();\n  for (Int_t iClus = 0, clusCount=0; iClus < Nclus; ++iClus) {\n    AliVCluster *c = dynamic_cast<AliVCluster*>(clus->At(iClus));\n    if (!c)\n      continue;\n    if (!c->IsEMCAL())\n      continue;\n\n    \/\/ make primary particle out of cluster\n    TLorentzVector nPart;\n    c->GetMomentum(nPart, vertex);\n\n    Double_t etclus = nPart.Pt();\n    if (etclus<fMinPt) \n      continue;\n\n    Double_t energyclus = nPart.P();\n\n    \/\/ reset cluster\/track matching\n    c->SetEmcCpvDistance(-1);\n    c->SetTrackDistance(999,999);\n\n    \/\/ run cluster-track matching\n    Int_t    imin       = -1;\n    Double_t dEtaMin    = 1e9;\n    Double_t dPhiMin    = 1e9;\n    Double_t dRmin      = TMath::Sqrt(dEtaMin*dEtaMin+dPhiMin*dPhiMin);\n    Double_t totalTrkP  = 0.0; \/\/ count total track momentum\n    Int_t    Nmatches   = 0;   \/\/ count total number of matches\n    for (Int_t t = 0; t<Ntrks; ++t) {\n      AliVTrack *track = dynamic_cast<AliVTrack*>(tracks->At(t));\n      if (!track)\n        continue;\n      if (!track->IsEMCAL())\n        continue;\n      if (track->Pt()<fMinPt)\n        continue;\n\n      Double_t etadiff=999;\n      Double_t phidiff=999;\n      AliPicoTrack::GetEtaPhiDiff(track,c,phidiff,etadiff);\n      Double_t dR = TMath::Sqrt(etadiff*etadiff+phidiff*phidiff);\n      if(dR<dRmin){\n        dEtaMin = etadiff;\n        dPhiMin = phidiff;\n        dRmin = dR;\n        imin = t;\n      }\n      if (fHadCorr>1) {\n        Double_t mom = track->P();\n        Int_t mombin = GetMomBin(mom);\n        if (mombin>-1) {\n          fHistMatchEtaPhi[centbin][mombin]->Fill(etadiff,phidiff);\n          fHistMatchdRvsEP[centbin]->Fill(dR,energyclus\/mom);\n        }\n      }\n      if (TMath::Abs(phidiff)<0.05 && TMath::Abs(etadiff)<0.025) { \/\/ pp cuts!!!\n        ++Nmatches;\n        totalTrkP += track->P();\n      }\n    }\n\n    \/\/ store closest track\n    c->SetEmcCpvDistance(imin);\n    c->SetTrackDistance(dPhiMin, dEtaMin);\n\n    fHistNclusvsCent->Fill(cent);\n    fHistEbefore->Fill(cent,energyclus);\n    fHistNMatchCent->Fill(cent,Nmatches);\n    if(Nmatches>0) \n      fHistNclusMatchvsCent->Fill(cent);\n\n    \/\/ apply correction \/ subtraction\n    if (fHadCorr>0) {\n      \/\/ to subtract only the closest track set fHadCor to a %\n      \/\/ to subtract all tracks within the cut set fHadCor to %+1\n      if (fHadCorr>1) {\n        if (totalTrkP>0) {\n          Double_t EoP = energyclus\/totalTrkP;\n          fHistEoPCent->Fill(cent,EoP);\n          fHistMatchEvsP[centbin]->Fill(energyclus,EoP);\n        }\n        energyclus -= (fHadCorr-1)*totalTrkP;\n      } else if (imin>=0) {\n        AliVTrack *t = dynamic_cast<AliVTrack*>(tracks->At(imin));\n        if (t) {\n          Double_t mom = t->P();\n          Int_t mombin = GetMomBin(mom);\n          fHistMatchEtaPhi[centbin][mombin]->Fill(dEtaMin,dPhiMin);\n          if (mom>0){\n            fHistMatchEvsP[centbin]->Fill(energyclus,energyclus\/mom);\n            fHistEoPCent->Fill(cent,energyclus\/mom);\n            fHistMatchdRvsEP[centbin]->Fill(dRmin,energyclus\/mom);\n          }\n          if (TMath::Abs(dPhiMin)<0.05 && TMath::Abs(dEtaMin)<0.025) { \/\/ pp cuts!!!\n            energyclus -= fHadCorr*t->P();\n          }\n        }\n      }\n    }\n    if (energyclus<0) \n      energyclus = 0;\n    fHistEafter->Fill(cent,energyclus);\n\n    if (energyclus>0) { \/\/ create corrected cluster\n      AliVCluster *oc;\n      if (esdMode) {\n        oc = new ((*fOutClusters)[clusCount]) AliESDCaloCluster(*(dynamic_cast<AliESDCaloCluster*>(c)));\n      } else {\n        oc = new ((*fOutClusters)[clusCount]) AliAODCaloCluster(*(dynamic_cast<AliAODCaloCluster*>(c)));\n      }\n      oc->SetE(energyclus);\n      ++clusCount;\n    }\n  }\n}\n\n\/\/________________________________________________________________________\nvoid AliHadCorrTask::Terminate(Option_t *) \n{\n  \/\/ Nothing to be done.\n}\n\n<commit_msg>cosmetic<commit_after>\/\/ $Id$\n\/\/\n\/\/ Hadronic correction task.\n\/\/\n\/\/\n\n#include <TChain.h>\n#include <TClonesArray.h>\n#include <TH1F.h>\n#include <TH2F.h>\n#include <TList.h>\n#include <TLorentzVector.h>\n#include <TParticle.h>\n#include \"AliAODCaloCluster.h\"\n#include \"AliAODEvent.h\"\n#include \"AliAnalysisManager.h\"\n#include \"AliCentrality.h\"\n#include \"AliESDCaloCluster.h\"\n#include \"AliESDtrack.h\"\n#include \"AliFJWrapper.h\"\n#include \"AliPicoTrack.h\"\n#include \"AliVEventHandler.h\"\n#include \"AliHadCorrTask.h\"\n\nClassImp(AliHadCorrTask)\n\n\/\/________________________________________________________________________\nAliHadCorrTask::AliHadCorrTask() : \n  AliAnalysisTaskSE(\"AliHadCorrTask\"),\n  fTracksName(),\n  fCaloName(),\n  fOutCaloName(),\n  fHadCorr(0),\n  fMinPt(0.15),\n  fOutClusters(0),\n  fOutputList(0),\n  fHistNclusvsCent(0),\n  fHistNclusMatchvsCent(0),\n  fHistEbefore(0),\n  fHistEafter(0),\n  fHistEoPCent(0),\n  fHistNMatchCent(0)\n{\n  \/\/ Default constructor.\n\n  for(Int_t i=0; i<4; ++i) {\n    fHistMatchEvsP[i]   = 0;\n    fHistMatchdRvsEP[i] = 0;\n    for(Int_t j=0; j<5; ++j) \n      fHistMatchEtaPhi[i][j] = 0;\n  }\n}\n\n\/\/________________________________________________________________________\nAliHadCorrTask::AliHadCorrTask(const char *name) : \n  AliAnalysisTaskSE(name),\n  fTracksName(\"Tracks\"),\n  fCaloName(\"CaloClusters\"),\n  fOutCaloName(\"CaloClustersCorr\"),\n  fHadCorr(0),\n  fMinPt(0.15),\n  fOutClusters(0),\n  fOutputList(0),\n  fHistNclusvsCent(0),\n  fHistNclusMatchvsCent(0),\n  fHistEbefore(0),\n  fHistEafter(0),\n  fHistEoPCent(0),\n  fHistNMatchCent(0)\n{\n  \/\/ Standard constructor.\n\n  for(Int_t i=0; i<4; ++i) {\n    fHistMatchEvsP[i]   = 0;\n    fHistMatchdRvsEP[i] = 0;\n    for(Int_t j=0; j<5; ++j) \n      fHistMatchEtaPhi[i][j] = 0;\n  }\n\n  fBranchNames=\"ESD:AliESDRun.,AliESDHeader.,PrimaryVertex.\";\n\n  DefineInput(0,TChain::Class());\n  DefineOutput(1,TList::Class());\n}\n\n\/\/________________________________________________________________________\nAliHadCorrTask::~AliHadCorrTask()\n{\n  \/\/ Destructor\n}\n\n\/\/________________________________________________________________________\nInt_t AliHadCorrTask::GetCentBin(Double_t cent) const\n{\n  \/\/ Get centrality bin.\n\n  Int_t centbin = -1;\n  if (cent>=0 && cent<10) \n    centbin=0;\n  else if (cent>=10 && cent<30) \n    centbin=1;\n  else if (cent>=30 && cent<50) \n    centbin=2;\n  else if (cent>=50 && cent<=100) \n    centbin=3;\n\n  return centbin;\n}\n\n\/\/________________________________________________________________________\nInt_t AliHadCorrTask::GetMomBin(Double_t p) const\n{\n  \/\/ Get momenum bin.\n\n  Int_t pbin=-1;\n  if (p>=0 && p<0.5) \n    pbin=0;\n  else if (p>=0.5 && p<2.) \n    pbin=1;\n  else if (p>=2. && p<3.) \n    pbin=2;\n  else if (p>=3. && p<5.) \n    pbin=3;\n  else if (p>=5.) \n    pbin=4;\n\n  return pbin;\n}\n\n\/\/________________________________________________________________________\nvoid AliHadCorrTask::UserCreateOutputObjects()\n{\n  \/\/ Create my user objects.\n\n  AliVEventHandler* handler = AliAnalysisManager::GetAnalysisManager()->GetInputEventHandler();\n  if (!handler) {\n    AliError(\"Input handler not available!\");\n    return;\n  }\n \n  if (handler->InheritsFrom(\"AliESDInputHandler\")) {\n    fOutClusters = new TClonesArray(\"AliESDCaloCluster\");\n  } else if (handler->InheritsFrom(\"AliAODInputHandler\")) {\n    fOutClusters = new TClonesArray(\"AliAODCaloCluster\");\n  } else {\n    AliError(\"Input handler not recognized!\");\n    return;\n  }\n  fOutClusters->SetName(fOutCaloName);\n \n  OpenFile(1);\n  fOutputList = new TList();\n  fOutputList->SetOwner();\n\n  for(Int_t icent=0; icent<4; ++icent) {\n    for(Int_t ipt=0; ipt<5; ++ipt){\n      TString name(Form(\"fHistMatchEtaPhi_%i_%i\",icent,ipt));\n      fHistMatchEtaPhi[icent][ipt] = new TH2F(name, name, 400, -0.2, 0.2, 1600, -0.8, 0.8);\n      fOutputList->Add(fHistMatchEtaPhi[icent][ipt]);\n    }\n\n    TString name(Form(\"fHistMatchEvsP_%i\",icent));\n    fHistMatchEvsP[icent] = new TH2F(name, name, 400, 0., 200., 1000, 0., 10.);\n    fOutputList->Add(fHistMatchEvsP[icent]);\n\n    name = Form(\"fHistMatchdRvsEP_%i\",icent);\n    fHistMatchdRvsEP[icent] = new TH2F(name, name, 1000, 0., 1., 1000, 0., 10.);\n    fOutputList->Add(fHistMatchdRvsEP[icent]);\n  }\n\n  fHistNclusvsCent      = new TH1F(\"Nclusvscent\",      \"NclusVsCent\",      100, 0, 100);\n  fHistNclusMatchvsCent = new TH1F(\"NclusMatchvscent\", \"NclusMatchVsCent\", 100, 0, 100);\n  fHistEbefore          = new TH1F(\"Ebefore\",          \"Ebefore\",          100, 0, 100);\n  fHistEafter           = new TH1F(\"Eafter\",           \"Eafter\",           100, 0, 100);\n  fHistEoPCent          = new TH2F(\"EoPCent\",          \"EoPCent\",          100, 0, 100, 1000, 0,   10);\n  fHistNMatchCent       = new TH2F(\"NMatchesCent\",     \"NMatchesCent\",     100, 0, 100, 101, -0.5, 100.5);\n  fOutputList->Add(fHistNclusMatchvsCent);\n  fOutputList->Add(fHistNclusvsCent);\n  fOutputList->Add(fHistEbefore);\n  fOutputList->Add(fHistEafter);\n  fOutputList->Add(fHistEoPCent);\n  fOutputList->Add(fHistNMatchCent);\n\n  PostData(1, fOutputList);\n}\n\n\/\/________________________________________________________________________\nvoid AliHadCorrTask::UserExec(Option_t *) \n{\n  \/\/ Execute per event.\n\n  \/\/ post output in event if not yet present\n  if (!(InputEvent()->FindListObject(fOutCaloName)))\n    InputEvent()->AddObject(fOutClusters);\n  \n  \/\/ delete output\n  fOutClusters->Delete();\n\n  \/\/ esd or aod mode\n  Bool_t esdMode = kTRUE;\n  if (dynamic_cast<AliAODEvent*>(InputEvent()))\n      esdMode = kFALSE;\n\n  \/\/ optimization in case autobranch loading is off\n  AliAnalysisManager *am = AliAnalysisManager::GetAnalysisManager();\n  if (fCaloName == \"CaloClusters\")\n    am->LoadBranch(\"CaloClusters\");\n  if (fTracksName == \"Tracks\")\n    am->LoadBranch(\"Tracks\");\n\n  \/\/ get centrality \n  Float_t cent = -1; \n  AliCentrality *centrality = InputEvent()->GetCentrality() ;\n  if (centrality)\n    cent = centrality->GetCentralityPercentile(\"V0M\");\n  else\n    cent=99; \/\/ probably pp data\n  if (cent<0) {\n    AliError(Form(\"Centrality negative: %f\", cent));\n    return;\n  }\n  Int_t centbin = GetCentBin(cent);\n\n  \/\/ get input collections\n  TClonesArray *tracks = 0;\n  TClonesArray *clus   = 0;\n  TList *l = InputEvent()->GetList();\n  tracks = dynamic_cast<TClonesArray*>(l->FindObject(fTracksName));\n  if (!tracks) {\n    AliError(Form(\"Pointer to tracks %s == 0\", fTracksName.Data() ));\n    return;\n  }\n  clus = dynamic_cast<TClonesArray*>(l->FindObject(fCaloName));\n  if (!clus) {\n    AliError(Form(\"Pointer to clus %s == 0\", fCaloName.Data() ));\n    return;\n  }\n\n  \/\/ get primary vertex\n  Double_t vertex[3] = {0, 0, 0};\n  InputEvent()->GetPrimaryVertex()->GetXYZ(vertex);\n\n  \/\/ loop over clusters and tracks\n  const Int_t Nclus = clus->GetEntries();\n  const Int_t Ntrks = tracks->GetEntries();\n  for (Int_t iClus = 0, clusCount=0; iClus < Nclus; ++iClus) {\n    AliVCluster *c = dynamic_cast<AliVCluster*>(clus->At(iClus));\n    if (!c)\n      continue;\n    if (!c->IsEMCAL())\n      continue;\n\n    \/\/ make primary particle out of cluster\n    TLorentzVector nPart;\n    c->GetMomentum(nPart, vertex);\n\n    Double_t etclus = nPart.Pt();\n    if (etclus<fMinPt) \n      continue;\n\n    Double_t energyclus = nPart.P();\n\n    \/\/ reset cluster\/track matching\n    c->SetEmcCpvDistance(-1);\n    c->SetTrackDistance(999,999);\n\n    \/\/ run cluster-track matching\n    Int_t    imin       = -1;\n    Double_t dEtaMin    = 1e9;\n    Double_t dPhiMin    = 1e9;\n    Double_t dRmin      = 1e9;\n    Double_t totalTrkP  = 0.0; \/\/ count total track momentum\n    Int_t    Nmatches   = 0;   \/\/ count total number of matches\n    for (Int_t t = 0; t<Ntrks; ++t) {\n      AliVTrack *track = dynamic_cast<AliVTrack*>(tracks->At(t));\n      if (!track)\n        continue;\n      if (!track->IsEMCAL())\n        continue;\n      if (track->Pt()<fMinPt)\n        continue;\n\n      Double_t etadiff=999;\n      Double_t phidiff=999;\n      AliPicoTrack::GetEtaPhiDiff(track,c,phidiff,etadiff);\n      Double_t dR = TMath::Sqrt(etadiff*etadiff+phidiff*phidiff);\n      if(dR<dRmin){\n        dEtaMin = etadiff;\n        dPhiMin = phidiff;\n        dRmin = dR;\n        imin = t;\n      }\n      if (fHadCorr>1) {\n        Double_t mom = track->P();\n        Int_t mombin = GetMomBin(mom);\n        if (mombin>-1) {\n          fHistMatchEtaPhi[centbin][mombin]->Fill(etadiff,phidiff);\n          fHistMatchdRvsEP[centbin]->Fill(dR,energyclus\/mom);\n        }\n      }\n      if (TMath::Abs(phidiff)<0.05 && TMath::Abs(etadiff)<0.025) { \/\/ pp cuts!!!\n        ++Nmatches;\n        totalTrkP += track->P();\n      }\n    }\n\n    \/\/ store closest track\n    c->SetEmcCpvDistance(imin);\n    c->SetTrackDistance(dPhiMin, dEtaMin);\n\n    fHistNclusvsCent->Fill(cent);\n    fHistEbefore->Fill(cent,energyclus);\n    fHistNMatchCent->Fill(cent,Nmatches);\n    if(Nmatches>0) \n      fHistNclusMatchvsCent->Fill(cent);\n\n    \/\/ apply correction \/ subtraction\n    if (fHadCorr>0) {\n      \/\/ to subtract only the closest track set fHadCor to a %\n      \/\/ to subtract all tracks within the cut set fHadCor to %+1\n      if (fHadCorr>1) {\n        if (totalTrkP>0) {\n          Double_t EoP = energyclus\/totalTrkP;\n          fHistEoPCent->Fill(cent,EoP);\n          fHistMatchEvsP[centbin]->Fill(energyclus,EoP);\n        }\n        energyclus -= (fHadCorr-1)*totalTrkP;\n      } else if (imin>=0) {\n        AliVTrack *t = dynamic_cast<AliVTrack*>(tracks->At(imin));\n        if (t) {\n          Double_t mom = t->P();\n          Int_t mombin = GetMomBin(mom);\n          fHistMatchEtaPhi[centbin][mombin]->Fill(dEtaMin,dPhiMin);\n          if (mom>0){\n            fHistMatchEvsP[centbin]->Fill(energyclus,energyclus\/mom);\n            fHistEoPCent->Fill(cent,energyclus\/mom);\n            fHistMatchdRvsEP[centbin]->Fill(dRmin,energyclus\/mom);\n          }\n          if (TMath::Abs(dPhiMin)<0.05 && TMath::Abs(dEtaMin)<0.025) { \/\/ pp cuts!!!\n            energyclus -= fHadCorr*t->P();\n          }\n        }\n      }\n    }\n    if (energyclus<0) \n      energyclus = 0;\n    fHistEafter->Fill(cent,energyclus);\n\n    if (energyclus>0) { \/\/ create corrected cluster\n      AliVCluster *oc;\n      if (esdMode) {\n        oc = new ((*fOutClusters)[clusCount]) AliESDCaloCluster(*(dynamic_cast<AliESDCaloCluster*>(c)));\n      } else {\n        oc = new ((*fOutClusters)[clusCount]) AliAODCaloCluster(*(dynamic_cast<AliAODCaloCluster*>(c)));\n      }\n      oc->SetE(energyclus);\n      ++clusCount;\n    }\n  }\n}\n\n\/\/________________________________________________________________________\nvoid AliHadCorrTask::Terminate(Option_t *) \n{\n  \/\/ Nothing to be done.\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: bootstrap.hxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: hr $ $Date: 2003-11-07 14:42: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 _UTL_BOOTSTRAP_HXX\n#define _UTL_BOOTSTRAP_HXX\n\nnamespace rtl\n{\n    class OUString;\n}\n\nnamespace utl\n{\n\/\/-----------------------------------------------------------------------------\n    \/** provides configuration information needed for application startup.\n        <p>This class handles the startup information for the office application.\n           It encapsulates knowledge of how to retriev such information and how\n           to diagnose failures to retriev required data.\n        <\/p>\n    *\/\n    class Bootstrap\n    {\n    \/\/ the static interface\n    public: \/\/ some common information items\n\n        \/\/\/ retrieve the product key; defaults to executable name (without extension)\n        static rtl::OUString getProductKey();\n        \/\/\/ retrieve the product key; uses the given default, if not found\n        static rtl::OUString getProductKey(rtl::OUString const& _sDefault);\n\n        \/\/\/ retrieve the LOGO information item; uses the given default, if not found\n        static rtl::OUString getLogoData(rtl::OUString const& _sDefault);     \/\/\n\n        \/\/\/ retrieve the BUILDID information item; uses the given default, if not found\n        static rtl::OUString getBuildIdData(rtl::OUString const& _sDefault);\n\n        \/\/\/ retrieve the installation mode information item; uses the given default, if not found\n        static rtl::OUString getInstallMode(rtl::OUString const& _sDefault);\n\n        \/\/\/ retrieve the product patch level; uses the given default, if not found\n        static rtl::OUString getProductPatchLevel(rtl::OUString const& _sDefault);\n\n        \/\/\/ reload cached data\n        static void reloadData();\n\n    public: \/\/ retrieve path information about the installaton location\n        enum PathStatus\n        {\n            PATH_EXISTS,  \/\/ Success: Found a path to an existing file or directory\n            PATH_VALID,   \/\/ Found a valid path, but the file or directory does not exist\n            DATA_INVALID, \/\/ Retrieved a string for this path, that is not a valid file url or system path\n            DATA_MISSING, \/\/ Could not retrieve any data for this path\n            DATA_UNKNOWN  \/\/ No attempt to retrieve data for this path was made\n        };\n\n        \/\/\/ get a file URL to the common base installation [${insturl}]\n        static PathStatus locateBaseInstallation(rtl::OUString& _rURL);\n\n        \/\/\/ get a file URL to the user installation [${userurl}]\n        static PathStatus locateUserInstallation(rtl::OUString& _rURL);\n\n        \/\/\/ get a file URL to the shared data directory [default is ${insturl}\/share]\n        static PathStatus locateSharedData(rtl::OUString& _rURL);\n\n        \/\/\/ get a file URL to the user data directory [default is ${userurl}\/user]\n        static PathStatus locateUserData(rtl::OUString& _rURL);\n\n    \/\/ the next two items are mainly supported for diagnostic purposes. both items may be unused\n        \/\/\/ get a file URL to the bootstrap INI file used [e.g. ${insturl}\/program\/bootraprc]\n        static PathStatus locateBootstrapFile(rtl::OUString& _rURL);\n        \/\/\/ get a file URL to the version locator INI file used [e.g. ${SYSUSERCONFIG}\/sversion.ini]\n        static PathStatus locateVersionFile(rtl::OUString& _rURL);\n\n    public: \/\/ evaluate the validity of the installation\n        \/\/\/ high-level status of bootstrap success\n        enum Status\n        {\n            DATA_OK,              \/\/\/ user-dir and share-dir do exist, product key found or can be defaulted to exe-name\n            MISSING_USER_INSTALL, \/\/\/ ${userurl} does not exist; or version-file cannot be found or is invalid\n            INVALID_USER_INSTALL, \/\/\/ can locate ${userurl}, but user-dir is missing\n            INVALID_BASE_INSTALL  \/\/\/ other failure: e.g. cannot locate share-dir; bootstraprc missing or invalid; no product key\n        };\n\n        \/\/\/ error code for detailed diagnostics of bootstrap failures\n        enum FailureCode\n        {\n            NO_FAILURE,                   \/\/\/ bootstrap was successful\n            MISSING_INSTALL_DIRECTORY,    \/\/\/ the shared installation directory could not be located\n            MISSING_BOOTSTRAP_FILE,       \/\/\/ the bootstrap INI file could not be found or read\n            MISSING_BOOTSTRAP_FILE_ENTRY, \/\/\/ the bootstrap INI is missing a required entry\n            INVALID_BOOTSTRAP_FILE_ENTRY, \/\/\/ the bootstrap INI contains invalid data\n            MISSING_VERSION_FILE,         \/\/\/ the version locator INI file could not be found or read\n            MISSING_VERSION_FILE_ENTRY,   \/\/\/ the version locator INI has no entry for this version\n            INVALID_VERSION_FILE_ENTRY,   \/\/\/ the version locator INI entry is not a valid directory URL\n            MISSING_USER_DIRECTORY,       \/\/\/ the user installation directory does not exist\n            INVALID_BOOTSTRAP_DATA        \/\/\/ some bootstrap data was invalid in unexpected ways\n        };\n\n        \/\/\/ Evaluates the status of the installation and returns a diagnostic message corresponding to this status\n        static Status checkBootstrapStatus(rtl::OUString& _rDiagnosticMessage);\n\n        \/** Evaluates the status of the installation and returns a diagnostic\n            message and error code corresponding to this status\n        *\/\n        static Status checkBootstrapStatus(rtl::OUString& _rDiagnosticMessage, FailureCode& _rErrCode);\n\n    public:\n        \/\/ singleton impl-class\n        class Impl;\n        static Impl const& data();\n    };\n\/\/-----------------------------------------------------------------------------\n} \/\/ namespace utl\n\n#endif \/\/ _UTL_BOOTSTRAP_HXX\n<commit_msg>INTEGRATION: CWS visibility03 (1.8.78); FILE MERGED 2005\/02\/28 04:33:52 mnicel 1.8.78.1: Issue number:  40092 Part of visibility work<commit_after>\/*************************************************************************\n *\n *  $RCSfile: bootstrap.hxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: obo $ $Date: 2005-04-13 12:22:57 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef INCLUDED_UNOTOOLSDLLAPI_H\n#include \"unotools\/unotoolsdllapi.h\"\n#endif\n\n#ifndef _UTL_BOOTSTRAP_HXX\n#define _UTL_BOOTSTRAP_HXX\n\nnamespace rtl\n{\n    class OUString;\n}\n\nnamespace utl\n{\n\/\/-----------------------------------------------------------------------------\n    \/** provides configuration information needed for application startup.\n        <p>This class handles the startup information for the office application.\n           It encapsulates knowledge of how to retriev such information and how\n           to diagnose failures to retriev required data.\n        <\/p>\n    *\/\n    class UNOTOOLS_DLLPUBLIC Bootstrap\n    {\n    \/\/ the static interface\n    public: \/\/ some common information items\n\n        \/\/\/ retrieve the product key; defaults to executable name (without extension)\n        static rtl::OUString getProductKey();\n        \/\/\/ retrieve the product key; uses the given default, if not found\n        static rtl::OUString getProductKey(rtl::OUString const& _sDefault);\n\n        \/\/\/ retrieve the LOGO information item; uses the given default, if not found\n        static rtl::OUString getLogoData(rtl::OUString const& _sDefault);     \/\/\n\n        \/\/\/ retrieve the BUILDID information item; uses the given default, if not found\n        static rtl::OUString getBuildIdData(rtl::OUString const& _sDefault);\n\n        \/\/\/ retrieve the installation mode information item; uses the given default, if not found\n        static rtl::OUString getInstallMode(rtl::OUString const& _sDefault);\n\n        \/\/\/ retrieve the product patch level; uses the given default, if not found\n        static rtl::OUString getProductPatchLevel(rtl::OUString const& _sDefault);\n\n        \/\/\/ reload cached data\n        static void reloadData();\n\n    public: \/\/ retrieve path information about the installaton location\n        enum PathStatus\n        {\n            PATH_EXISTS,  \/\/ Success: Found a path to an existing file or directory\n            PATH_VALID,   \/\/ Found a valid path, but the file or directory does not exist\n            DATA_INVALID, \/\/ Retrieved a string for this path, that is not a valid file url or system path\n            DATA_MISSING, \/\/ Could not retrieve any data for this path\n            DATA_UNKNOWN  \/\/ No attempt to retrieve data for this path was made\n        };\n\n        \/\/\/ get a file URL to the common base installation [${insturl}]\n        static PathStatus locateBaseInstallation(rtl::OUString& _rURL);\n\n        \/\/\/ get a file URL to the user installation [${userurl}]\n        static PathStatus locateUserInstallation(rtl::OUString& _rURL);\n\n        \/\/\/ get a file URL to the shared data directory [default is ${insturl}\/share]\n        static PathStatus locateSharedData(rtl::OUString& _rURL);\n\n        \/\/\/ get a file URL to the user data directory [default is ${userurl}\/user]\n        static PathStatus locateUserData(rtl::OUString& _rURL);\n\n    \/\/ the next two items are mainly supported for diagnostic purposes. both items may be unused\n        \/\/\/ get a file URL to the bootstrap INI file used [e.g. ${insturl}\/program\/bootraprc]\n        static PathStatus locateBootstrapFile(rtl::OUString& _rURL);\n        \/\/\/ get a file URL to the version locator INI file used [e.g. ${SYSUSERCONFIG}\/sversion.ini]\n        static PathStatus locateVersionFile(rtl::OUString& _rURL);\n\n    public: \/\/ evaluate the validity of the installation\n        \/\/\/ high-level status of bootstrap success\n        enum Status\n        {\n            DATA_OK,              \/\/\/ user-dir and share-dir do exist, product key found or can be defaulted to exe-name\n            MISSING_USER_INSTALL, \/\/\/ ${userurl} does not exist; or version-file cannot be found or is invalid\n            INVALID_USER_INSTALL, \/\/\/ can locate ${userurl}, but user-dir is missing\n            INVALID_BASE_INSTALL  \/\/\/ other failure: e.g. cannot locate share-dir; bootstraprc missing or invalid; no product key\n        };\n\n        \/\/\/ error code for detailed diagnostics of bootstrap failures\n        enum FailureCode\n        {\n            NO_FAILURE,                   \/\/\/ bootstrap was successful\n            MISSING_INSTALL_DIRECTORY,    \/\/\/ the shared installation directory could not be located\n            MISSING_BOOTSTRAP_FILE,       \/\/\/ the bootstrap INI file could not be found or read\n            MISSING_BOOTSTRAP_FILE_ENTRY, \/\/\/ the bootstrap INI is missing a required entry\n            INVALID_BOOTSTRAP_FILE_ENTRY, \/\/\/ the bootstrap INI contains invalid data\n            MISSING_VERSION_FILE,         \/\/\/ the version locator INI file could not be found or read\n            MISSING_VERSION_FILE_ENTRY,   \/\/\/ the version locator INI has no entry for this version\n            INVALID_VERSION_FILE_ENTRY,   \/\/\/ the version locator INI entry is not a valid directory URL\n            MISSING_USER_DIRECTORY,       \/\/\/ the user installation directory does not exist\n            INVALID_BOOTSTRAP_DATA        \/\/\/ some bootstrap data was invalid in unexpected ways\n        };\n\n        \/\/\/ Evaluates the status of the installation and returns a diagnostic message corresponding to this status\n        static Status checkBootstrapStatus(rtl::OUString& _rDiagnosticMessage);\n\n        \/** Evaluates the status of the installation and returns a diagnostic\n            message and error code corresponding to this status\n        *\/\n        static Status checkBootstrapStatus(rtl::OUString& _rDiagnosticMessage, FailureCode& _rErrCode);\n\n    public:\n        \/\/ singleton impl-class\n        class Impl;\n        static Impl const& data();\n    };\n\/\/-----------------------------------------------------------------------------\n} \/\/ namespace utl\n\n#endif \/\/ _UTL_BOOTSTRAP_HXX\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Fix unit tests<commit_after><|endoftext|>"}
{"text":"<commit_before>\/* Copyright 2018 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n#include <memory>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include \"absl\/strings\/str_split.h\"\n#include \"absl\/strings\/string_view.h\"\n#include \"tensorflow\/core\/framework\/step_stats.pb.h\"\n#include \"tensorflow\/core\/platform\/errors.h\"\n#include \"tensorflow\/core\/platform\/status.h\"\n#include \"tensorflow\/core\/platform\/types.h\"\n#include \"tensorflow\/core\/profiler\/lib\/profiler_factory.h\"\n#include \"tensorflow\/core\/profiler\/lib\/profiler_interface.h\"\n#include \"tensorflow\/core\/profiler\/profiler_options.pb.h\"\n#include \"tensorflow\/core\/profiler\/protobuf\/xplane.pb.h\"\n#include \"tensorflow\/core\/profiler\/utils\/xplane_schema.h\"\n#include \"tensorflow\/core\/tpu\/tpu_api.h\"\n#include \"tensorflow\/core\/tpu\/tpu_ops_c_api.h\"\n#include \"tensorflow\/stream_executor\/tpu\/status_helper.h\"\n\nnamespace tensorflow {\nnamespace profiler {\nnamespace {\n\n\/\/ Tpu implementation of ProfilerInterface.\n\/\/\n\/\/ Thread-safety: This class is go\/thread-compatible.\nclass TpuTracer : public ProfilerInterface {\n public:\n  explicit TpuTracer();\n  ~TpuTracer() override;\n\n  Status Start() override;\n\n  Status Stop() override;\n\n  \/\/ Unsupported.\n  Status CollectData(RunMetadata* run_metadata) override;\n\n  Status CollectData(XSpace* space) override;\n\n private:\n  TpuProfiler* tpu_profiler_;\n};\n\nTpuTracer::TpuTracer() {\n  tpu_profiler_ = tpu::OpsApiFn()->TpuProfiler_CreateFn();\n}\n\nTpuTracer::~TpuTracer() { tpu::OpsApiFn()->TpuProfiler_FreeFn(tpu_profiler_); }\n\nStatus TpuTracer::Start() {\n  StatusHelper status;\n  tpu::OpsApiFn()->TpuProfiler_StartFn(tpu_profiler_, status.c_status);\n  if (!status.ok()) {\n    VLOG(1) << \"Run Start failed.\";\n    return status.status();\n  }\n  return Status::OK();\n}\n\nStatus TpuTracer::Stop() {\n  StatusHelper status;\n  tpu::OpsApiFn()->TpuProfiler_StopFn(tpu_profiler_, status.c_status);\n  if (!status.ok()) {\n    VLOG(1) << \"Run Stop failed.\";\n    return status.status();\n  }\n  return Status::OK();\n}\n\nStatus TpuTracer::CollectData(RunMetadata* run_metadata) {\n  \/\/ Unsupported\n  return Status::OK();\n}\n\nStatus TpuTracer::CollectData(XSpace* space) {\n  StatusHelper status;\n  tpu::OpsApiFn()->TpuProfiler_CollectDataFn(tpu_profiler_, status.c_status,\n                                             space);\n  if (!status.ok()) {\n    VLOG(1) << \"Run CollectData failed.\";\n    return status.status();\n  }\n  return Status::OK();\n}\n\n}  \/\/ namespace\n\n\/\/ Not in anonymous namespace for testing purposes.\nstd::unique_ptr<ProfilerInterface> CreateTpuTracer(\n    const ProfileOptions& options) {\n  if (options.device_type() != ProfileOptions::TPU &&\n      options.device_type() != ProfileOptions::UNSPECIFIED) {\n    return nullptr;\n  }\n  return absl::make_unique<TpuTracer>();\n}\n\nauto register_host_tracer_factory = [] {\n  RegisterProfilerFactory(&CreateTpuTracer);\n  return 0;\n}();\n\n}  \/\/ namespace profiler\n}  \/\/ namespace tensorflow\n<commit_msg>Correct name for tpu_tracer static initialization.<commit_after>\/* Copyright 2018 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n#include <memory>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include \"absl\/strings\/str_split.h\"\n#include \"absl\/strings\/string_view.h\"\n#include \"tensorflow\/core\/framework\/step_stats.pb.h\"\n#include \"tensorflow\/core\/platform\/errors.h\"\n#include \"tensorflow\/core\/platform\/status.h\"\n#include \"tensorflow\/core\/platform\/types.h\"\n#include \"tensorflow\/core\/profiler\/lib\/profiler_factory.h\"\n#include \"tensorflow\/core\/profiler\/lib\/profiler_interface.h\"\n#include \"tensorflow\/core\/profiler\/profiler_options.pb.h\"\n#include \"tensorflow\/core\/profiler\/protobuf\/xplane.pb.h\"\n#include \"tensorflow\/core\/profiler\/utils\/xplane_schema.h\"\n#include \"tensorflow\/core\/tpu\/tpu_api.h\"\n#include \"tensorflow\/core\/tpu\/tpu_ops_c_api.h\"\n#include \"tensorflow\/stream_executor\/tpu\/status_helper.h\"\n\nnamespace tensorflow {\nnamespace profiler {\nnamespace {\n\n\/\/ Tpu implementation of ProfilerInterface.\n\/\/\n\/\/ Thread-safety: This class is go\/thread-compatible.\nclass TpuTracer : public ProfilerInterface {\n public:\n  explicit TpuTracer();\n  ~TpuTracer() override;\n\n  Status Start() override;\n\n  Status Stop() override;\n\n  \/\/ Unsupported.\n  Status CollectData(RunMetadata* run_metadata) override;\n\n  Status CollectData(XSpace* space) override;\n\n private:\n  TpuProfiler* tpu_profiler_;\n};\n\nTpuTracer::TpuTracer() {\n  tpu_profiler_ = tpu::OpsApiFn()->TpuProfiler_CreateFn();\n}\n\nTpuTracer::~TpuTracer() { tpu::OpsApiFn()->TpuProfiler_FreeFn(tpu_profiler_); }\n\nStatus TpuTracer::Start() {\n  StatusHelper status;\n  tpu::OpsApiFn()->TpuProfiler_StartFn(tpu_profiler_, status.c_status);\n  if (!status.ok()) {\n    VLOG(1) << \"Run Start failed.\";\n    return status.status();\n  }\n  return Status::OK();\n}\n\nStatus TpuTracer::Stop() {\n  StatusHelper status;\n  tpu::OpsApiFn()->TpuProfiler_StopFn(tpu_profiler_, status.c_status);\n  if (!status.ok()) {\n    VLOG(1) << \"Run Stop failed.\";\n    return status.status();\n  }\n  return Status::OK();\n}\n\nStatus TpuTracer::CollectData(RunMetadata* run_metadata) {\n  \/\/ Unsupported\n  return Status::OK();\n}\n\nStatus TpuTracer::CollectData(XSpace* space) {\n  StatusHelper status;\n  tpu::OpsApiFn()->TpuProfiler_CollectDataFn(tpu_profiler_, status.c_status,\n                                             space);\n  if (!status.ok()) {\n    VLOG(1) << \"Run CollectData failed.\";\n    return status.status();\n  }\n  return Status::OK();\n}\n\n}  \/\/ namespace\n\n\/\/ Not in anonymous namespace for testing purposes.\nstd::unique_ptr<ProfilerInterface> CreateTpuTracer(\n    const ProfileOptions& options) {\n  if (options.device_type() != ProfileOptions::TPU &&\n      options.device_type() != ProfileOptions::UNSPECIFIED) {\n    return nullptr;\n  }\n  return absl::make_unique<TpuTracer>();\n}\n\nauto register_tpu_tracer_factory = [] {\n  RegisterProfilerFactory(&CreateTpuTracer);\n  return 0;\n}();\n\n}  \/\/ namespace profiler\n}  \/\/ namespace tensorflow\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Ensure that if -serialize-replacements is not provided, no serialized\n\/\/ replacement files should be generated and the changes are made directly.\n\/\/\n\/\/ RUN: mkdir -p %T\/Inputs\n\/\/ RUN: grep -Ev \"\/\/ *[A-Z-]+:\" %s > %t.cpp\n\/\/ RUN: grep -Ev \"\/\/ *[A-Z-]+:\" %S\/Inputs\/no_yaml.h > %T\/Inputs\/no_yaml.h\n\/\/ RUN: clang-modernize -loop-convert %t.cpp -include=%T\/Inputs -- -I %T\/Inputs\/no_yaml.h\n\/\/ RUN: FileCheck --input-file=%t.cpp %s\n\/\/ RUN: FileCheck --input-file=%T\/Inputs\/no_yaml.h %S\/Inputs\/no_yaml.h\n\/\/ RUN: ls -1 %T | FileCheck %s --check-prefix=NO_YAML\n\/\/\n\/\/ NO_YAML-NOT: {{no_yaml.cpp_.*.yaml}}\n#include \"Inputs\/no_yaml.h\"\n\nvoid func() {\n  int arr[10];\n  for (unsigned i = 0; i < sizeof(arr)\/sizeof(int); ++i) {\n    arr[i] = 0;\n    \/\/ CHECK: for (auto & elem : arr) {\n    \/\/ CHECK-NEXT: elem = 0;\n  }\n\n  update(arr);\n}\n<commit_msg>Attempt to stabilize the Windows builder<commit_after>\/\/ Ensure that if -serialize-replacements is not provided, no serialized\n\/\/ replacement files should be generated and the changes are made directly.\n\/\/\n\/\/ RUN: rm -rf %T\/Inputs\n\/\/ RUN: mkdir -p %T\/Inputs\n\/\/ RUN: grep -Ev \"\/\/ *[A-Z-]+:\" %s > %t.cpp\n\/\/ RUN: grep -Ev \"\/\/ *[A-Z-]+:\" %S\/Inputs\/no_yaml.h > %T\/Inputs\/no_yaml.h\n\/\/ RUN: clang-modernize -loop-convert %t.cpp -include=%T\/Inputs -- -I %T\/Inputs\/no_yaml.h\n\/\/ RUN: FileCheck --input-file=%t.cpp %s\n\/\/ RUN: FileCheck --input-file=%T\/Inputs\/no_yaml.h %S\/Inputs\/no_yaml.h\n\/\/ RUN: ls %T | FileCheck %s --check-prefix=NO_YAML\n\/\/\n\/\/ NO_YAML-NOT: {{no_yaml.cpp_.*.yaml}}\n#include \"Inputs\/no_yaml.h\"\n\nvoid func() {\n  int arr[10];\n  for (unsigned i = 0; i < sizeof(arr)\/sizeof(int); ++i) {\n    arr[i] = 0;\n    \/\/ CHECK: for (auto & elem : arr) {\n    \/\/ CHECK-NEXT: elem = 0;\n  }\n\n  update(arr);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Copyright (C) 2014  P.L. Lucas <selairi@gmail.com>\n    Copyright (C) 2014  Hong Jen Yee (PCMan) <pcman.tw@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\n#include \"xrandr.h\"\n#include <QProcess>\n#include <QDebug>\n#include <QRegExp>\n#include <QObject>\n#include <QDir>\n#include <QVector>\n\nstatic QByteArray indentString(QByteArray line) {\n  QByteArray s;\n  int length = line.size();\n  char ch;\n  for(int indent=0; indent < length; indent++ ) {\n    ch = line[indent];\n    if( ch == ' ' || ch == '\\t' )\n      s.append(ch);\n    else\n      break;\n  }\n  return s;\n}\n\nstatic int indentLevel(QByteArray line) {\n  int indent = 0;\n  while(indent < line.size() && ( line[indent] == ' ' || line[indent] == '\\t' ) )\n    ++indent;\n  return indent;\n}\n\n\/\/ new parsing code using xrandr --verbose\nQList<MonitorInfo*> XRandRBackend::getMonitorsInfo() {\n  QList<MonitorInfo*> monitors;\n  \/\/ execute xrandr command and read its output\n  QProcess process;\n  \/\/ set locale to \"C\" guarantee English output of xrandr\n  process.processEnvironment().insert(\"LC_ALL\", \"c\");\n  process.start(\"xrandr --verbose\");\n  process.waitForFinished(-1);\n  if(process.exitCode() != 0)\n    return monitors;\n  QList<QByteArray> lines = process.readAllStandardOutput().split('\\n');\n  \/\/ start parsing the output\n  QRegExp regMonitorLine(\"([\\\\w-]+) +connected +(primary)? *(\\\\d+x\\\\d+\\\\+(\\\\d+)\\\\+(\\\\d+))?.*\");\n  QRegExp regModeLine(\"\\\\s+(\\\\d+x\\\\d+).*\");\n  QRegExp regRateLine(\"\\\\s+([vh]):.* clock\\\\s+([\\\\d.]+).?Hz.*\");\n  QRegExp regKeyValue(\"\\\\s*(\\\\w[\\\\w ]*)\\\\s*:\\\\s*(\\\\S.*)?\");\n\n  bool hasError = false;\n  MonitorInfo* monitor = NULL;\n  QList<QByteArray>::iterator it = lines.begin();\n  bool readingModes = false;\n  \/\/ currently, we only support one X screen, that is screen 0\n  while(it != lines.end() && !hasError) {\n    QByteArray& line = *it;\n    if(!monitor) {\n      if(regMonitorLine.exactMatch(line)) {\n        \/\/ format: VGA-0 connected 1280x1024+1024+0 (0x55) normal...\n        monitor = new MonitorInfo();\n        monitor->name = regMonitorLine.cap(1);\n        if(regMonitorLine.cap(2) == \"primary\") { \/\/ is primary monitor\n          monitor->primaryOk = true;\n        }\n        if(!regMonitorLine.cap(3).isEmpty()) \/\/ mode+xpos+ypos\n          monitor->enabledOk = true;\n        monitor->xPos = regMonitorLine.cap(4).toInt();\n        monitor->yPos = regMonitorLine.cap(5).toInt();\n      }\n    }\n    else { \/\/ reading properties of this monitor\n      if(regModeLine.exactMatch(line)) { \/\/ this is a mode line\n        \/\/ sample: 1280x1024 (0x55) 108.000MHz +HSync +VSync *current +preferred\n        readingModes = true;\n        QString mode = regModeLine.cap(1);\n        QString rate;\n        bool isCurrent = line.contains(\"current\");\n        bool isPreferred = line.contains(\"preferred\");\n        ++it;\n        while(it != lines.end()) {\n          line = *it;\n          if(regRateLine.exactMatch(line)) {\n            \/\/ sample:\n            \/\/        h: width  1280 start 1328 end 1440 total 1688 skew    0 clock  63.98KHz\n            \/\/        v: height 1024 start 1025 end 1028 total 1066           clock  60.02Hz\n            if(regRateLine.cap(1) == QLatin1String(\"v\"))\n              rate = regRateLine.cap(2);\n            ++it;\n          }\n          else {\n            --it;\n            break; \/\/ rate lines ended for this mode\n          }\n        }\n        if(!mode.isEmpty() && !rate.isEmpty()) {\n          if(!monitor->modes.contains(mode))\n            monitor->modes.append(mode);\n          if(!monitor->modeLines.contains(mode))\n            monitor->modeLines[mode] = QStringList();\n          monitor->modeLines[mode].append(rate);\n          if(isPreferred) {\n            monitor->preferredMode = mode;\n            monitor->preferredRate = rate;\n          }\n          if(isCurrent) {\n            monitor->currentMode = mode;\n            monitor->currentRate = rate;\n          }\n        }\n      }\n      else { \/\/ this is not a mode line, read other properties\n        if(readingModes) {\n          \/\/ mode lines ended, so the whole monitor info is read\n          monitors.append(monitor);\n          monitor = NULL;\n          readingModes = false;\n          continue;\n        }\n\n        if(regKeyValue.exactMatch(line)) { \/\/ format: <key>: <value>\n          QString key = regKeyValue.cap(1);\n          QString value = regKeyValue.cap(2);\n          QByteArray lineStringStart = indentString(line);\n          int propertyIndentLevel = indentLevel(line);\n          ++it;\n          while( it != lines.end() ) {\n            QByteArray& line = *it;\n            int actualIndentLevel = indentLevel(line);\n            if( actualIndentLevel>propertyIndentLevel && line.startsWith(lineStringStart) ) {\n              value += \"\\n\" + line.trimmed();\n              ++it;\n            } else\n              break;\n          }\n          qDebug() << key << \"=\" << value;\n          if(key == \"Gamma\") {\n            monitor->gamma = value;\n          }\n          else if(key == \"Brightness\") {\n            monitor->brightness = value;\n          }\n          else if(key == \"EDID\") {\n            monitor->edid = value ;\n            \/\/ Get vendor\n            QString hex = value.replace(\"\\n\",\"\").replace(\" \",\"\").toLower();\n            int vendorPosStart = hex.indexOf(\"fc00\");\n            if(vendorPosStart>0) {\n            int vendorPosEnd = hex.indexOf(\"00\", vendorPosStart+4);\n              QString vendorHex = hex.mid(vendorPosStart+4, vendorPosEnd-vendorPosStart-4);\n              QByteArray vendor = QByteArray::fromHex(vendorHex.toLocal8Bit()).trimmed();\n              \/\/ qDebug() << \"Vendor:\" << vendorHex << \"VendorHex\" << vendor ;\n              monitor->vendor = vendor;\n            }\n          }\n          continue;\n        } \/\/ End format: <key>: <value>\n        else { \/\/ this line is not key:value\n        }\n      }\n    }\n    if( it != lines.end() ) ++it;\n  }\n\n  if(monitor) \/\/ this should not happen unless a parsing error happens\n    delete monitor;\n\n  resolvePositions(monitors);\n\n  \n  return monitors;\n}\n\n\n\nbool XRandRBackend::setMonitorsSettings(const QList<MonitorSettings*> monitors) {\n  QString cmd = getCommand(monitors);\n  QProcess process;\n  process.start(cmd);\n  process.waitForFinished();\n  return process.exitCode() == 0;\n}\n\n\n\n\nQString XRandRBackend::getCommand(const QList<MonitorSettings*> monitors)  {\n  QMap<MonitorSettings::Position, QString> positions;\n\n  positions[MonitorSettings::Left] = \"--left-of\";\n  positions[MonitorSettings::Right] = \"--right-of\";\n  positions[MonitorSettings::Above] = \"--above\";\n  positions[MonitorSettings::Bellow] = \"--below\";\n\n\n  QByteArray cmd = \"xrandr\";\n\n  foreach(MonitorSettings * monitor, monitors) {\n    cmd += \" --output \";\n    cmd.append(monitor->name);\n    cmd.append(' ');\n\n    \/\/ if the monitor is turned on\n    if(monitor->enabledOk) {\n      QString sel_res = monitor->currentMode;\n      QString sel_rate = monitor->currentRate;\n\n      if(sel_res == QObject::tr(\"Auto\"))   \/\/ auto resolution\n        cmd.append(\"--auto\");\n      else {\n        cmd.append(\"--mode \");\n        cmd.append(sel_res);\n        if(sel_rate != QObject::tr(\"Auto\")) {  \/\/ not auto refresh rate\n          cmd.append(\" --rate \");\n          cmd.append(sel_rate);\n        }\n      }\n      if(monitor->position != MonitorSettings::None) {\n        cmd.append(\" \");\n        cmd.append(positions[monitor->position]);\n        cmd.append(\" \");\n        cmd.append(monitor->positionRelativeToOutput);\n      } else\n          cmd.append(\" --pos 0x0\");\n      if(monitor->primaryOk)\n        cmd.append(\" --primary\");\n      cmd.append(\" --brightness \");\n      cmd.append(monitor->brightness);\n      cmd.append(\" --gamma \");\n      cmd.append(monitor->gamma);\n    }\n    else    \/\/ turn off\n      cmd.append(\"--off\");\n  }\n\n\n  qDebug() << \"cmd:\" << cmd;\n  return cmd;\n}\n\n\/\/ resolve the position relationship among the montors\nvoid XRandRBackend::resolvePositions(QList< MonitorInfo* >& monitors) {\n  Q_FOREACH(MonitorInfo * monitor, monitors) {\n    MonitorSettings::Position pos;\n    MonitorInfo* neighbor = findAdjacentMonitor(monitors, monitor, pos);\n    if(neighbor) {\n      monitor->position = pos;\n      monitor->positionRelativeToOutput = neighbor->name;\n    }\n  }\n}\n\nMonitorInfo* XRandRBackend::findAdjacentMonitor(QList< MonitorInfo* >& monitors, MonitorInfo* monitor, MonitorSettings::Position& pos) {\n  MonitorInfo* neighbor = NULL;\n  QRect monitorRect = monitor->geometry();\n  pos = MonitorSettings::None;\n  Q_FOREACH(MonitorInfo * mon, monitors) {\n    if(mon == monitor || mon->positionRelativeToOutput == monitor->name)\n      continue;\n    QRect neighborRect = mon->geometry();\n    if(monitorRect.top() == neighborRect.top()) {\n      if((monitorRect.right() + 1) == neighborRect.left()) { \/\/ monitor is at left of neighbor\n        pos = MonitorSettings::Left;\n        neighbor = mon;\n        break;\n      }\n      else if(monitorRect.left() == (neighborRect.right() + 1)) { \/\/ monitor is at right of neighbor\n        pos = MonitorSettings::Right;\n        neighbor = mon;\n        break;\n      }\n    }\n    if(monitorRect.left() == neighborRect.left()) {\n      if((monitorRect.bottom() + 1) == neighborRect.top()) { \/\/ monitor is above neighbor\n        pos = MonitorSettings::Above;\n        neighbor = mon;\n        break;\n      }\n      else if(monitorRect.top() == (neighborRect.bottom() + 1)) { \/\/ monitor is below neighbor\n        pos = MonitorSettings::Bellow;\n        neighbor = mon;\n        break;\n      }\n    }\n  }\n  return neighbor;\n}\n<commit_msg>Fixed: Error reading monitor name.<commit_after>\/*\n    Copyright (C) 2014  P.L. Lucas <selairi@gmail.com>\n    Copyright (C) 2014  Hong Jen Yee (PCMan) <pcman.tw@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\n#include \"xrandr.h\"\n#include <QProcess>\n#include <QDebug>\n#include <QRegExp>\n#include <QObject>\n#include <QDir>\n#include <QVector>\n\nstatic QByteArray indentString(QByteArray line) {\n  QByteArray s;\n  int length = line.size();\n  char ch;\n  for(int indent=0; indent < length; indent++ ) {\n    ch = line[indent];\n    if( ch == ' ' || ch == '\\t' )\n      s.append(ch);\n    else\n      break;\n  }\n  return s;\n}\n\nstatic int indentLevel(QByteArray line) {\n  int indent = 0;\n  while(indent < line.size() && ( line[indent] == ' ' || line[indent] == '\\t' ) )\n    ++indent;\n  return indent;\n}\n\n\/\/ new parsing code using xrandr --verbose\nQList<MonitorInfo*> XRandRBackend::getMonitorsInfo() {\n  QList<MonitorInfo*> monitors;\n  \/\/ execute xrandr command and read its output\n  QProcess process;\n  \/\/ set locale to \"C\" guarantee English output of xrandr\n  process.processEnvironment().insert(\"LC_ALL\", \"c\");\n  process.start(\"xrandr --verbose\");\n  process.waitForFinished(-1);\n  if(process.exitCode() != 0)\n    return monitors;\n  QList<QByteArray> lines = process.readAllStandardOutput().split('\\n');\n  \/\/ start parsing the output\n  QRegExp regMonitorLine(\"([\\\\w-]+) +connected +(primary)? *(\\\\d+x\\\\d+\\\\+(\\\\d+)\\\\+(\\\\d+))?.*\");\n  QRegExp regModeLine(\"\\\\s+(\\\\d+x\\\\d+).*\");\n  QRegExp regRateLine(\"\\\\s+([vh]):.* clock\\\\s+([\\\\d.]+).?Hz.*\");\n  QRegExp regKeyValue(\"\\\\s*(\\\\w[\\\\w ]*)\\\\s*:\\\\s*(\\\\S.*)?\");\n\n  bool hasError = false;\n  MonitorInfo* monitor = NULL;\n  QList<QByteArray>::iterator it = lines.begin();\n  bool readingModes = false;\n  \/\/ currently, we only support one X screen, that is screen 0\n  while(it != lines.end() && !hasError) {\n    QByteArray& line = *it;\n    if(!monitor) {\n      if(regMonitorLine.exactMatch(line)) {\n        \/\/ format: VGA-0 connected 1280x1024+1024+0 (0x55) normal...\n        monitor = new MonitorInfo();\n        monitor->name = regMonitorLine.cap(1);\n        if(regMonitorLine.cap(2) == \"primary\") { \/\/ is primary monitor\n          monitor->primaryOk = true;\n        }\n        if(!regMonitorLine.cap(3).isEmpty()) \/\/ mode+xpos+ypos\n          monitor->enabledOk = true;\n        monitor->xPos = regMonitorLine.cap(4).toInt();\n        monitor->yPos = regMonitorLine.cap(5).toInt();\n      }\n    }\n    else { \/\/ reading properties of this monitor\n      if(regModeLine.exactMatch(line)) { \/\/ this is a mode line\n        \/\/ sample: 1280x1024 (0x55) 108.000MHz +HSync +VSync *current +preferred\n        readingModes = true;\n        QString mode = regModeLine.cap(1);\n        QString rate;\n        bool isCurrent = line.contains(\"current\");\n        bool isPreferred = line.contains(\"preferred\");\n        ++it;\n        while(it != lines.end()) {\n          line = *it;\n          if(regRateLine.exactMatch(line)) {\n            \/\/ sample:\n            \/\/        h: width  1280 start 1328 end 1440 total 1688 skew    0 clock  63.98KHz\n            \/\/        v: height 1024 start 1025 end 1028 total 1066           clock  60.02Hz\n            if(regRateLine.cap(1) == QLatin1String(\"v\"))\n              rate = regRateLine.cap(2);\n            ++it;\n          }\n          else {\n            --it;\n            break; \/\/ rate lines ended for this mode\n          }\n        }\n        if(!mode.isEmpty() && !rate.isEmpty()) {\n          if(!monitor->modes.contains(mode))\n            monitor->modes.append(mode);\n          if(!monitor->modeLines.contains(mode))\n            monitor->modeLines[mode] = QStringList();\n          monitor->modeLines[mode].append(rate);\n          if(isPreferred) {\n            monitor->preferredMode = mode;\n            monitor->preferredRate = rate;\n          }\n          if(isCurrent) {\n            monitor->currentMode = mode;\n            monitor->currentRate = rate;\n          }\n        }\n      }\n      else { \/\/ this is not a mode line, read other properties\n        if(readingModes) {\n          \/\/ mode lines ended, so the whole monitor info is read\n          monitors.append(monitor);\n          monitor = NULL;\n          readingModes = false;\n          continue;\n        }\n\n        if(regKeyValue.exactMatch(line)) { \/\/ format: <key>: <value>\n          QString key = regKeyValue.cap(1);\n          QString value = regKeyValue.cap(2);\n          QByteArray lineStringStart = indentString(line);\n          int propertyIndentLevel = indentLevel(line);\n          ++it;\n          while( it != lines.end() ) {\n            QByteArray& line = *it;\n            int actualIndentLevel = indentLevel(line);\n            if( actualIndentLevel>propertyIndentLevel && line.startsWith(lineStringStart) ) {\n              value += \"\\n\" + line.trimmed();\n              ++it;\n            } else\n              break;\n          }\n          qDebug() << key << \"=\" << value;\n          if(key == \"Gamma\") {\n            monitor->gamma = value;\n          }\n          else if(key == \"Brightness\") {\n            monitor->brightness = value;\n          }\n          else if(key == \"EDID\") {\n            monitor->edid = value ;\n            \/\/ Get vendor\n            QString hex = value.replace(\"\\n\",\"\").replace(\" \",\"\").toLower();\n            int vendorPosStart = hex.indexOf(\"fc00\");\n            if(vendorPosStart>0) {\n            int vendorPosEnd = hex.indexOf(\"00\", vendorPosStart+4);\n              QString vendorHex = hex.mid(vendorPosStart+4, vendorPosEnd-vendorPosStart-4);\n              QByteArray vendor;\n              \/\/vendor  = QByteArray::fromHex(vendorHex.toLocal8Bit()).trimmed();\n              \/\/qDebug() << \"VendorHex:\" << vendorHex << \"Vendor\" << vendor ;\n              \/\/ QByteArray::fromHex sometimes fails. This a trick\n              vendor=\"\";\n              for(int i=1; i<vendorHex.length();i+=2) {\n                vendor+=QByteArray::fromHex(QString(\"%1%2\").arg(vendorHex.at(i-1)).arg(vendorHex.at(i)).toLocal8Bit());\n              }\n              qDebug() << \"VendorHex:\" << vendorHex << \"Vendor\" << vendor ;\n              monitor->vendor = vendor;\n            }\n          }\n          continue;\n        } \/\/ End format: <key>: <value>\n        else { \/\/ this line is not key:value\n        }\n      }\n    }\n    if( it != lines.end() ) ++it;\n  }\n\n  if(monitor) \/\/ this should not happen unless a parsing error happens\n    delete monitor;\n\n  resolvePositions(monitors);\n\n  \n  return monitors;\n}\n\n\n\nbool XRandRBackend::setMonitorsSettings(const QList<MonitorSettings*> monitors) {\n  QString cmd = getCommand(monitors);\n  QProcess process;\n  process.start(cmd);\n  process.waitForFinished();\n  return process.exitCode() == 0;\n}\n\n\n\n\nQString XRandRBackend::getCommand(const QList<MonitorSettings*> monitors)  {\n  QMap<MonitorSettings::Position, QString> positions;\n\n  positions[MonitorSettings::Left] = \"--left-of\";\n  positions[MonitorSettings::Right] = \"--right-of\";\n  positions[MonitorSettings::Above] = \"--above\";\n  positions[MonitorSettings::Bellow] = \"--below\";\n\n\n  QByteArray cmd = \"xrandr\";\n\n  foreach(MonitorSettings * monitor, monitors) {\n    cmd += \" --output \";\n    cmd.append(monitor->name);\n    cmd.append(' ');\n\n    \/\/ if the monitor is turned on\n    if(monitor->enabledOk) {\n      QString sel_res = monitor->currentMode;\n      QString sel_rate = monitor->currentRate;\n\n      if(sel_res == QObject::tr(\"Auto\"))   \/\/ auto resolution\n        cmd.append(\"--auto\");\n      else {\n        cmd.append(\"--mode \");\n        cmd.append(sel_res);\n        if(sel_rate != QObject::tr(\"Auto\")) {  \/\/ not auto refresh rate\n          cmd.append(\" --rate \");\n          cmd.append(sel_rate);\n        }\n      }\n      if(monitor->position != MonitorSettings::None) {\n        cmd.append(\" \");\n        cmd.append(positions[monitor->position]);\n        cmd.append(\" \");\n        cmd.append(monitor->positionRelativeToOutput);\n      } else\n          cmd.append(\" --pos 0x0\");\n      if(monitor->primaryOk)\n        cmd.append(\" --primary\");\n      cmd.append(\" --brightness \");\n      cmd.append(monitor->brightness);\n      cmd.append(\" --gamma \");\n      cmd.append(monitor->gamma);\n    }\n    else    \/\/ turn off\n      cmd.append(\"--off\");\n  }\n\n\n  qDebug() << \"cmd:\" << cmd;\n  return cmd;\n}\n\n\/\/ resolve the position relationship among the montors\nvoid XRandRBackend::resolvePositions(QList< MonitorInfo* >& monitors) {\n  Q_FOREACH(MonitorInfo * monitor, monitors) {\n    MonitorSettings::Position pos;\n    MonitorInfo* neighbor = findAdjacentMonitor(monitors, monitor, pos);\n    if(neighbor) {\n      monitor->position = pos;\n      monitor->positionRelativeToOutput = neighbor->name;\n    }\n  }\n}\n\nMonitorInfo* XRandRBackend::findAdjacentMonitor(QList< MonitorInfo* >& monitors, MonitorInfo* monitor, MonitorSettings::Position& pos) {\n  MonitorInfo* neighbor = NULL;\n  QRect monitorRect = monitor->geometry();\n  pos = MonitorSettings::None;\n  Q_FOREACH(MonitorInfo * mon, monitors) {\n    if(mon == monitor || mon->positionRelativeToOutput == monitor->name)\n      continue;\n    QRect neighborRect = mon->geometry();\n    if(monitorRect.top() == neighborRect.top()) {\n      if((monitorRect.right() + 1) == neighborRect.left()) { \/\/ monitor is at left of neighbor\n        pos = MonitorSettings::Left;\n        neighbor = mon;\n        break;\n      }\n      else if(monitorRect.left() == (neighborRect.right() + 1)) { \/\/ monitor is at right of neighbor\n        pos = MonitorSettings::Right;\n        neighbor = mon;\n        break;\n      }\n    }\n    if(monitorRect.left() == neighborRect.left()) {\n      if((monitorRect.bottom() + 1) == neighborRect.top()) { \/\/ monitor is above neighbor\n        pos = MonitorSettings::Above;\n        neighbor = mon;\n        break;\n      }\n      else if(monitorRect.top() == (neighborRect.bottom() + 1)) { \/\/ monitor is below neighbor\n        pos = MonitorSettings::Bellow;\n        neighbor = mon;\n        break;\n      }\n    }\n  }\n  return neighbor;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright (c) Robert Adams\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 *     * The name of the copyright holder 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 DEVELOPERS ``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 THE 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 THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n#include \"StdAfx.h\"\n#include \"OLMeshTracker.h\"\n#include <stdlib.h>\n#include <stdio.h>\n#include <errno.h>\n#include <sys\/stat.h>\n#include \"RendererOgre.h\"\n#include \"LGLocking.h\"\n\n\/*\nNOTE TO THE NEXT PERSON: CODE NOT COMPLETE OR HOOKED INTO MAIN CODE\nThis code is started but not complete. The idea is to create a routine that\ntracks meshes and their state (loaded, unloaded, ...) with the goal of allowing\nthe actual file access part of a mesh load (the call to mesh->prepare()) be\ndone outside the frame rendering thread.\n*\/\n\n#define MESH_STATE_UNKNOWN\t0\t\t\t\/\/ no one knows\n#define MESH_STATE_REQUESTING 1\t\t\t\/\/ request to managed code to define the mesh\n#define MESH_STATE_BEING_SERIALIZED 3\t\/\/ request to serialize mesh is scheduled\n#define MESH_STATE_SERIALIZE_THEN_UNLOAD 4\t\/\/ mesh is being serialized but then it should be unloaded\n#define MESH_STATE_BEING_PREPARED 5\t\t\/\/ request in queue to do file IO for loading\n#define MESH_STATE_PREPARED 6\t\t\t\/\/ all information in memory\n#define MESH_STATE_LOADED 7\t\t\t\t\/\/ mesh is loaded and being rendered\n#define MESH_STATE_UNLOADED 8\t\t\t\/\/ mesh is unloaded and unrenderable\n\nnamespace LG {\n\nOLMeshTracker* OLMeshTracker::m_instance = NULL;\n\ntypedef struct s_meshInfo {\n\tint state;\n\tOgre::String name;\n\tOgre::String groupName;\n\tOgre::String contextEntityName;\n\tOgre::String fingerprint;\n\tOgre::BackgroundProcessTicket ticket;\n\tvoid* callback;\n\tvoid* callbackParam;\n\n} MeshInfo;\n\ntypedef stdext::hash_map<Ogre::String, MeshInfo> MeshMap;\ntypedef std::pair<Ogre::String, MeshInfo> MeshMapPair;\ntypedef stdext::hash_map<Ogre::String, MeshInfo>::iterator MeshMapIterator;\nMeshMap* m_meshMap;\nLGLOCK_MUTEX m_mapLock;\n\nOLMeshTracker::OLMeshTracker() {\n\tm_mapLock = LGLOCK_ALLOCATE_MUTEX(\"OLMeshTracker\");\n\tm_meshSerializer = NULL;\n\tm_cacheDir = LG::GetParameter(\"Renderer.Ogre.CacheDir\");\n}\nOLMeshTracker::~OLMeshTracker() {\n\tLGLOCK_RELEASE_MUTEX(m_mapLock);\n}\n\n\/\/ SingletonInstance.Shutdown()\nvoid OLMeshTracker::Shutdown() {\n\treturn;\n}\n\n\/\/ we have complete information about the mesh. Add or update the table info\nvoid OLMeshTracker::TrackMesh(Ogre::String meshNameP, Ogre::String meshGroupP, Ogre::String contextEntNameP, Ogre::String fingerprintP) {\n\tMeshInfo* meshToTrack;\n\tLGLOCK_LOCK(m_mapLock);\n\t\/\/ Look in tracking list to see if are already tracking mesh. \n\tMeshMapIterator meshI = m_meshMap->find(meshNameP);\n\tif (meshI == m_meshMap->end()) {\n\t\t\/\/ not tracking. Add a new entry\n\t\tmeshToTrack = (MeshInfo*)malloc(sizeof(MeshInfo));\n\t\tmeshToTrack->name = meshNameP;\n\t\tm_meshMap->insert(MeshMapPair(meshNameP, *meshToTrack));\n\t\tmeshToTrack->state = MESH_STATE_UNKNOWN;\n\t}\n\telse {\n\t\t\/\/ already tracking\n\t\tmeshToTrack = &(meshI->second);\n\t}\n\t\/\/ update the tracking information\n\tmeshToTrack->groupName = meshGroupP;\n\tmeshToTrack->contextEntityName = contextEntNameP;\n\tmeshToTrack->fingerprint = fingerprintP;\n\tLGLOCK_UNLOCK(m_mapLock);\n\n\t\/\/ TODO:\n\tOgre::MeshPtr meshEnt = (Ogre::MeshPtr)Ogre::MeshManager::getSingleton().getByName(meshNameP);\n\tif (meshEnt.isNull()) {\n\t\t\/\/ huh?\n\t}\n\n}\nvoid OLMeshTracker::UnTrackMesh(Ogre::String meshName) {\n}\n\n\/\/ Make the mesh loaded. We find the mesh entry and check if it's loaded. If not\n\/\/ we do the prepare operation (file IO) on our own thread. Once the IO is complete,\n\/\/ we schedule a refresh resource to add the mesh to the scene.\n\/\/ Callback called when mesh loaded. Called on between frame thread and passed the Param\n\/\/ as the only parameter. If 'callback' NULL, nothing is done;\nvoid OLMeshTracker::MakeLoaded(Ogre::String meshName, void(*callback)(void*), void* callbackParam) {\n\tMeshInfo* meshInfo;\n\tbool shouldCallback = false;\n\tLGLOCK_LOCK(m_mapLock);\n\tMeshMapIterator meshI = m_meshMap->find(meshName);\n\tif (meshI == m_meshMap->end()) {\n\t\t\/\/ mesh not found, request the mesh and track what we know\n\t\t\/\/ LG::RequestResource(meshName.c_str(), contextEntName.c_str(), LookingGlassOgr::ResourceTypeMesh);\n\t\t\/\/ add mesh to tracking map\n\t\t\/\/ TODO:\n\t\treturn;\n\t}\n\tmeshInfo = &(meshI->second);\n\tswitch (meshInfo->state) {\n\t\tcase MESH_STATE_UNKNOWN:\n\t\tcase MESH_STATE_UNLOADED:\n\t\t\t\/\/ load the mesh\n\t\t\tmeshInfo->state = MESH_STATE_REQUESTING;\n\t\t\tmeshInfo->ticket = Ogre::ResourceBackgroundQueue::getSingleton().load(\"mesh\", \n\t\t\t\t\tmeshInfo->name, meshInfo->groupName, false, NULL, NULL, this);\n\t\t\tmeshInfo->callback = callback;\n\t\t\tmeshInfo->callbackParam = callbackParam;\n\t\tcase MESH_STATE_REQUESTING:\n\t\t\t\/\/ mesh is being requested and will be loaded later\n\t\t\tbreak;\n\t\tcase MESH_STATE_BEING_SERIALIZED:\n\t\tcase MESH_STATE_BEING_PREPARED:\n\t\tcase MESH_STATE_PREPARED:\n\t\tcase MESH_STATE_LOADED:\n\t\t\t\/\/ mesh is already loaded\n\t\t\tshouldCallback = true;\n\t\t\tbreak;\n\t\tcase MESH_STATE_SERIALIZE_THEN_UNLOAD:\n\t\t\t\/\/ asked for load after we'd been asked to unload. For get  the unload\n\t\t\tmeshInfo->state = MESH_STATE_BEING_SERIALIZED;\n\t\t\tshouldCallback = true;\n\t\t\tbreak;\n\t}\n\tLGLOCK_UNLOCK(m_mapLock);\n\n\tif (shouldCallback && callback != NULL) {\n\t\tcallback(callbackParam);\n\t}\n}\n\nvoid OLMeshTracker::operationCompleted(Ogre::BackgroundProcessTicket ticket, const Ogre::BackgroundProcessResult& result) {\n\t\/\/ search the list for the mesh info block\n\n\treturn;\n}\n\n\/\/ Make the mesh unloaded. Schedule the unload operation on our own thread\n\/\/ TODO: replace this inline code with something that happens on a different thread\n\/\/ Callback called when mesh unloaded. Called on between frame thread and passed the Param\n\/\/ as the only parameter. If 'callback' NULL, nothing is done;\nvoid OLMeshTracker::MakeUnLoaded(Ogre::String meshName, void(*callback)(void*), void* callbackParam) {\n\tOgre::MeshManager::getSingleton().unload(meshName);\n\tif (callback != NULL) {\n\t\tcallback(callbackParam);\n\t}\n}\n\n\/\/ Serialize the mesh to it's file on our own thread.\nvoid OLMeshTracker::MakePersistant(Ogre::String meshName, Ogre::String entName) {\n\tMakePersistant((Ogre::MeshPtr)Ogre::MeshManager::getSingleton().getByName(meshName), entName);\n}\n\n\/\/ TODO: make this inline code happen on it's own thread\nvoid OLMeshTracker::MakePersistant(Ogre::MeshPtr mesh, Ogre::String entName) {\n\tOgre::String targetFilename = LG::RendererOgre::Instance()->EntityNameToFilename(entName, \"\");\n\n\t\/\/ Make sure the directory exists -- I wish the serializer did this for me\n\tLG::RendererOgre::Instance()->CreateParentDirectory(targetFilename);\n\t\n\tif (m_meshSerializer == NULL) {\n\t\tm_meshSerializer = new Ogre::MeshSerializer();\n\t}\n\tm_meshSerializer->exportMesh(mesh.getPointer(), targetFilename);\n}\n\n\nOgre::String OLMeshTracker::GetMeshContext(Ogre::String meshName) {\n\treturn Ogre::String();\n}\nOgre::String OLMeshTracker::GetSimilarMesh(Ogre::String fingerprint) {\n\treturn Ogre::String();\n}\n\n\n}<commit_msg>more code for mesh state management and just before ripping it out and putting something simpiler in<commit_after>\/* Copyright (c) Robert Adams\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 *     * The name of the copyright holder 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 DEVELOPERS ``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 THE 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 THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n#include \"StdAfx.h\"\n#include \"OLMeshTracker.h\"\n#include <stdlib.h>\n#include <stdio.h>\n#include <errno.h>\n#include <sys\/stat.h>\n#include \"RendererOgre.h\"\n#include \"LGLocking.h\"\n\n\/*\nNOTE TO THE NEXT PERSON: CODE NOT COMPLETE OR HOOKED INTO MAIN CODE\nThis code is started but not complete. The idea is to create a routine that\ntracks meshes and their state (loaded, unloaded, ...) with the goal of allowing\nthe actual file access part of a mesh load (the call to mesh->prepare()) be\ndone outside the frame rendering thread.\n*\/\n\n#define MESH_STATE_UNKNOWN\t0\t\t\t\/\/ no one knows\n#define MESH_STATE_REQUESTING 1\t\t\t\/\/ request to managed code to define the mesh\n#define MESH_STATE_BEING_SERIALIZED 3\t\/\/ request to serialize mesh is scheduled\n#define MESH_STATE_SERIALIZE_THEN_UNLOAD 4\t\/\/ mesh is being serialized but then it should be unloaded\n#define MESH_STATE_BEING_PREPARED 5\t\t\/\/ request in queue to do file IO for loading\n#define MESH_STATE_PREPARED 6\t\t\t\/\/ all information in memory\n#define MESH_STATE_LOADED 7\t\t\t\t\/\/ mesh is loaded and being rendered\n#define MESH_STATE_UNLOADED 8\t\t\t\/\/ mesh is unloaded and unrenderable\n\nnamespace LG {\n\nOLMeshTracker* OLMeshTracker::m_instance = NULL;\n\ntypedef struct s_meshInfo {\n\tint state;\n\tOgre::String name;\n\tOgre::String groupName;\n\tOgre::String contextEntityName;\n\tOgre::String fingerprint;\n\tOgre::BackgroundProcessTicket ticket;\n\tvoid* callback;\n\tvoid* callbackParam;\n\n} MeshInfo;\n\ntypedef stdext::hash_map<Ogre::String, MeshInfo> MeshMap;\ntypedef std::pair<Ogre::String, MeshInfo> MeshMapPair;\ntypedef stdext::hash_map<Ogre::String, MeshInfo>::iterator MeshMapIterator;\nMeshMap* m_meshMap;\nLGLOCK_MUTEX m_mapLock;\n\nOLMeshTracker::OLMeshTracker() {\n\tm_mapLock = LGLOCK_ALLOCATE_MUTEX(\"OLMeshTracker\");\n\tm_meshSerializer = NULL;\n\tm_cacheDir = LG::GetParameter(\"Renderer.Ogre.CacheDir\");\n}\nOLMeshTracker::~OLMeshTracker() {\n\tLGLOCK_RELEASE_MUTEX(m_mapLock);\n}\n\n\/\/ SingletonInstance.Shutdown()\nvoid OLMeshTracker::Shutdown() {\n\treturn;\n}\n\n\/\/ we have complete information about the mesh. Add or update the table info\nvoid OLMeshTracker::TrackMesh(Ogre::String meshNameP, Ogre::String meshGroupP, Ogre::String contextEntNameP, Ogre::String fingerprintP) {\n\tMeshInfo* meshToTrack;\n\tLGLOCK_LOCK(m_mapLock);\n\t\/\/ Look in tracking list to see if are already tracking mesh. \n\tMeshMapIterator meshI = m_meshMap->find(meshNameP);\n\tif (meshI == m_meshMap->end()) {\n\t\t\/\/ not tracking. Add a new entry\n\t\tmeshToTrack = (MeshInfo*)malloc(sizeof(MeshInfo));\n\t\tmeshToTrack->name = meshNameP;\n\t\tm_meshMap->insert(MeshMapPair(meshNameP, *meshToTrack));\n\t\tmeshToTrack->state = MESH_STATE_UNKNOWN;\n\t\t\/\/ if you change the above lines, visit their duplicate in MakeLoaded and MakeUnloaded\n\t}\n\telse {\n\t\t\/\/ already tracking\n\t\tmeshToTrack = &(meshI->second);\n\t}\n\t\/\/ update the tracking information\n\tmeshToTrack->groupName = meshGroupP;\n\tmeshToTrack->contextEntityName = contextEntNameP;\n\tmeshToTrack->fingerprint = fingerprintP;\n\tLGLOCK_UNLOCK(m_mapLock);\n\n\t\/\/ TODO:\n\tOgre::MeshPtr meshEnt = (Ogre::MeshPtr)Ogre::MeshManager::getSingleton().getByName(meshNameP);\n\tif (meshEnt.isNull()) {\n\t\t\/\/ huh?\n\t}\n\n}\nvoid OLMeshTracker::UnTrackMesh(Ogre::String meshName) {\n}\n\n\/\/ Make the mesh loaded. We find the mesh entry and check if it's loaded. If not\n\/\/ we do the prepare operation (file IO) on our own thread. Once the IO is complete,\n\/\/ we schedule a refresh resource to add the mesh to the scene.\n\/\/ Callback called when mesh loaded. Called on between frame thread and passed the Param\n\/\/ as the only parameter. If 'callback' NULL, nothing is done;\nvoid OLMeshTracker::MakeLoaded(Ogre::String meshName, void(*callback)(void*), void* callbackParam) {\n\tMeshInfo* meshInfo;\n\tbool shouldCallback = false;\n\tLGLOCK_LOCK(m_mapLock);\n\tMeshMapIterator meshI = m_meshMap->find(meshName);\n\tif (meshI == m_meshMap->end()) {\n\t\t\/\/ mesh not found.\n\t\t\/\/ When meshes are loaded off the disk, this is the first we hear about them.\n\t\t\/\/ Create a tracking entry\n\t\tmeshInfo = (MeshInfo*)malloc(sizeof(MeshInfo));\n\t\tmeshInfo->name = meshName;\n\t\tm_meshMap->insert(MeshMapPair(meshName, *meshInfo));\n\t\tmeshInfo->state = MESH_STATE_UNKNOWN;\n\t}\n\telse {\n\t\tmeshInfo = &(meshI->second);\n\t}\n\tswitch (meshInfo->state) {\n\t\tcase MESH_STATE_UNKNOWN:\n\t\tcase MESH_STATE_UNLOADED:\n\t\t\t\/\/ load the mesh\n\t\t\tmeshInfo->state = MESH_STATE_BEING_PREPARED;\n\t\t\tmeshInfo->ticket = Ogre::ResourceBackgroundQueue::getSingleton().load(\"mesh\", \n\t\t\t\t\tmeshInfo->name, meshInfo->groupName, false, NULL, NULL, this);\n\t\t\tmeshInfo->callback = callback;\n\t\t\tmeshInfo->callbackParam = callbackParam;\n\t\tcase MESH_STATE_REQUESTING:\n\t\t\t\/\/ mesh is being requested and will be loaded later\n\t\t\tbreak;\n\t\tcase MESH_STATE_BEING_SERIALIZED:\n\t\tcase MESH_STATE_BEING_PREPARED:\n\t\tcase MESH_STATE_PREPARED:\n\t\tcase MESH_STATE_LOADED:\n\t\t\t\/\/ mesh is already loaded\n\t\t\tshouldCallback = true;\n\t\t\tbreak;\n\t\tcase MESH_STATE_SERIALIZE_THEN_UNLOAD:\n\t\t\t\/\/ asked for load after we'd been asked to unload. For get  the unload\n\t\t\tmeshInfo->state = MESH_STATE_BEING_SERIALIZED;\n\t\t\tshouldCallback = true;\n\t\t\tbreak;\n\t}\n\tLGLOCK_UNLOCK(m_mapLock);\n\n\tif (shouldCallback && callback != NULL) {\n\t\tcallback(callbackParam);\n\t}\n}\n\nvoid OLMeshTracker::operationCompleted(Ogre::BackgroundProcessTicket ticket, const Ogre::BackgroundProcessResult& result) {\n\t\/\/ search the list for the mesh info block\n\n\treturn;\n}\n\n\/\/ Make the mesh unloaded. Schedule the unload operation on our own thread\n\/\/ TODO: replace this inline code with something that happens on a different thread\n\/\/ Callback called when mesh unloaded. Called on between frame thread and passed the Param\n\/\/ as the only parameter. If 'callback' NULL, nothing is done;\nvoid OLMeshTracker::MakeUnLoaded(Ogre::String meshName, void(*callback)(void*), void* callbackParam) {\n\tMeshInfo* meshInfo;\n\tbool shouldCallback = false;\n\tLGLOCK_LOCK(m_mapLock);\n\tMeshMapIterator meshI = m_meshMap->find(meshName);\n\tif (meshI == m_meshMap->end()) {\n\t\t\/\/ mesh not found.\n\t\t\/\/ When meshes are loaded off the disk, this is the first we hear about them.\n\t\t\/\/ Create a tracking entry\n\t\tmeshInfo = (MeshInfo*)malloc(sizeof(MeshInfo));\n\t\tmeshInfo->name = meshName;\n\t\tm_meshMap->insert(MeshMapPair(meshName, *meshInfo));\n\t\tmeshInfo->state = MESH_STATE_LOADED;\n\t}\n\telse {\n\t\tmeshInfo = &(meshI->second);\n\t}\n\tswitch (meshInfo->state) {\n\t\tcase MESH_STATE_UNKNOWN:\n\t\tcase MESH_STATE_UNLOADED:\n\t\t\t\/\/ already unloaded. nothing to do\n\t\t\tshouldCallback = true;\n\t\t\tbreak;\n\t\tcase MESH_STATE_REQUESTING:\n\t\t\t\/\/ being requested. the material is not here to unload\n\t\t\tbreak;\n\t\tcase MESH_STATE_BEING_SERIALIZED:\n\t\t\tmeshInfo->state = MESH_STATE_SERIALIZE_THEN_UNLOAD;\n\t\t\tbreak;\n\t\tcase MESH_STATE_BEING_PREPARED:\n\t\tcase MESH_STATE_PREPARED:\n\t\t\t\/\/ The mesh is in the prepare queue.\n\t\t\t\/\/ Remove from prepare queue and it will stay unloaded\n\t\t\tshouldCallback = true;\n\t\t\tbreak;\n\t\tcase MESH_STATE_LOADED:\n\t\t\t\/\/ TODO: background unload\n\t\t\tOgre::MeshManager::getSingleton().unload(meshName);\n\t\t\tshouldCallback = true;\n\t\t\tbreak;\n\t\tcase MESH_STATE_SERIALIZE_THEN_UNLOAD:\n\t\t\t\/\/ TODO\n\t\t\tbreak;\n\t}\n\tLGLOCK_UNLOCK(m_mapLock);\n\tif (shouldCallback && callback != NULL) {\n\t\tcallback(callbackParam);\n\t}\n}\n\n\/\/ Serialize the mesh to it's file on our own thread.\nvoid OLMeshTracker::MakePersistant(Ogre::String meshName, Ogre::String entName) {\n\tMakePersistant((Ogre::MeshPtr)Ogre::MeshManager::getSingleton().getByName(meshName), entName);\n}\n\n\/\/ TODO: make this inline code happen on it's own thread\nvoid OLMeshTracker::MakePersistant(Ogre::MeshPtr mesh, Ogre::String entName) {\n\tOgre::String targetFilename = LG::RendererOgre::Instance()->EntityNameToFilename(entName, \"\");\n\n\t\/\/ Make sure the directory exists -- I wish the serializer did this for me\n\tLG::RendererOgre::Instance()->CreateParentDirectory(targetFilename);\n\t\n\tif (m_meshSerializer == NULL) {\n\t\tm_meshSerializer = new Ogre::MeshSerializer();\n\t}\n\tm_meshSerializer->exportMesh(mesh.getPointer(), targetFilename);\n}\n\n\nOgre::String OLMeshTracker::GetMeshContext(Ogre::String meshName) {\n\treturn Ogre::String();\n}\nOgre::String OLMeshTracker::GetSimilarMesh(Ogre::String fingerprint) {\n\treturn Ogre::String();\n}\n\n\n}<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n\n#include \"test_hook.h\"\n#include <vespa\/vespalib\/util\/stringfmt.h>\n#include <regex>\n#include <vespa\/fastos\/thread.h>\n\nnamespace vespalib {\n\nnamespace {\n\nstruct FastOSTestThreadRunner : FastOS_Runnable {\n    TestThreadEntry &entry;\n    FastOSTestThreadRunner(TestThreadEntry &entry_in) : entry(entry_in) {}\n    bool DeleteOnCompletion() const override { return true; }\n    void Run(FastOS_ThreadInterface *, void *) override { entry.threadEntry(); }\n};\n\nstruct FastOSTestThreadFactory : TestThreadFactory {\n    FastOS_ThreadPool threadPool;\n    FastOSTestThreadFactory() : threadPool(256 * 1024) {}\n    void createThread(TestThreadEntry &entry) override {\n        threadPool.NewThread(new FastOSTestThreadRunner(entry), 0);\n    }\n};\n\n} \/\/ namespace vespalib::<unnamed>\n\n__thread TestThreadFactory *TestThreadFactory::factory = 0;\n\nvoid\nTestThreadWrapper::threadEntry()\n{\n    TestMaster &master = TestMaster::master;\n    std::string oldThreadName = master.getThreadName();\n    std::vector<TestMaster::TraceItem> oldTraceStack = master.getThreadTraceStack();\n    master.setThreadName(make_string(\"%zu(%zu)\", _fixture.thread_id, _fixture.num_threads).c_str());\n    master.setThreadTraceStack(_traceStack);\n    size_t preThreadFailCnt = master.getThreadFailCnt();\n    master.setThreadIgnore(_ignore);\n    master.setThreadUnwind(true);\n    master.setThreadBarrier(&_barrier);\n    _barrier.await();\n    try {\n        _fixture.test_entry_point();\n    } catch (TestMaster::Unwind &) {\n    } catch (std::exception &e) {\n        master.check(false, __FILE__, __LINE__, e.what(), false);\n    } catch (...) {\n        master.check(false, __FILE__, __LINE__, \"test threw stuff\", false);\n    }\n    _barrier.destroy();\n    master.setThreadBarrier(0);\n    bool fail = (master.getThreadFailCnt() > preThreadFailCnt);\n    master.setThreadUnwind(false);\n    master.setThreadIgnore(false);\n    _result = !fail;\n    _latch.countDown();\n    master.setThreadTraceStack(oldTraceStack);\n    master.setThreadName(oldThreadName.c_str());\n}\n\nTestHook *TestHook::_head = 0;\nTestHook *TestHook::_tail = 0;\n\nTestHook::TestHook(const std::string &file, const std::string &name, bool ignore)\n    : _next(0),\n      _name(name),\n      _tag(make_string(\"%s:%s\", file.c_str(), name.c_str())),\n      _ignore(ignore)\n{\n    if (_head == 0) {\n        assert(_tail == 0);\n        _head = this;\n        _tail = this;\n    } else {\n        assert(_tail != 0);\n        assert(_tail->_next == 0);\n        _tail->_next = this;\n        _tail = this;\n    }\n}\n\nconst char *lookup_subset_pattern(const std::string &name) {\n    const char *pattern = getenv(\"TEST_SUBSET\");\n    if (pattern != 0) {\n        fprintf(stderr, \"%s: info:  only running tests matching '%s'\\n\",\n                name.c_str(), pattern);\n    } else {\n        pattern = \"\";\n    }\n    return pattern;\n}\n\nvoid\nTestHook::runAll()\n{\n    FastOSTestThreadFactory threadFactory;\n    TestThreadFactory::factory = &threadFactory;\n    std::string name = TestMaster::master.getName();\n    std::regex pattern(lookup_subset_pattern(name), std::regex::extended);\n    size_t testsPassed = 0;\n    size_t testsFailed = 0;\n    size_t testsIgnored = 0;\n    size_t testsSkipped = 0;\n    for (TestHook *test = _head; test != 0; test = test->_next) {\n        if (std::regex_search(test->_tag, pattern)) {\n            bool ignored = test->_ignore;\n            bool failed = !test->run();\n            if (ignored) {\n                ++testsIgnored;\n            } else if (failed) {\n                ++testsFailed;\n            } else {\n                ++testsPassed;\n            }\n            const char *level = ignored ? \"Warn: \" : failed ? \"ERROR:\" : \"info: \";\n            fprintf(stderr, \"%s: %s status_for_test '%s': %s%s\\n\",\n                    name.c_str(), level, test->_name.c_str(),\n                    failed ? \"FAIL\" : \"PASS\",\n                    ignored ? \" (ignored)\" : \"\");\n        } else {\n            ++testsSkipped;\n        }\n    }\n    fprintf(stderr, \"%s: info:  test summary --- %zu test(s) passed --- %zu test(s) failed\\n\",\n            name.c_str(), testsPassed, testsFailed);\n    if (testsSkipped > 0) {\n        fprintf(stderr, \"%s: info:  test summary --- %zu test(s) skipped\\n\",\n                name.c_str(), testsSkipped);\n    }\n    if (testsIgnored > 0) {\n        fprintf(stderr, \"%s: Warn:  test summary --- %zu test(s) ignored\\n\",\n                name.c_str(), testsIgnored);\n    }\n    TestThreadFactory::factory = 0;\n}\n\n} \/\/ namespace vespalib\n<commit_msg>Use modified ECMAScript regular expression grammar for filtering tests to run using vespalib testkit.<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 \"test_hook.h\"\n#include <vespa\/vespalib\/util\/stringfmt.h>\n#include <regex>\n#include <vespa\/fastos\/thread.h>\n\nnamespace vespalib {\n\nnamespace {\n\nstruct FastOSTestThreadRunner : FastOS_Runnable {\n    TestThreadEntry &entry;\n    FastOSTestThreadRunner(TestThreadEntry &entry_in) : entry(entry_in) {}\n    bool DeleteOnCompletion() const override { return true; }\n    void Run(FastOS_ThreadInterface *, void *) override { entry.threadEntry(); }\n};\n\nstruct FastOSTestThreadFactory : TestThreadFactory {\n    FastOS_ThreadPool threadPool;\n    FastOSTestThreadFactory() : threadPool(256 * 1024) {}\n    void createThread(TestThreadEntry &entry) override {\n        threadPool.NewThread(new FastOSTestThreadRunner(entry), 0);\n    }\n};\n\n} \/\/ namespace vespalib::<unnamed>\n\n__thread TestThreadFactory *TestThreadFactory::factory = 0;\n\nvoid\nTestThreadWrapper::threadEntry()\n{\n    TestMaster &master = TestMaster::master;\n    std::string oldThreadName = master.getThreadName();\n    std::vector<TestMaster::TraceItem> oldTraceStack = master.getThreadTraceStack();\n    master.setThreadName(make_string(\"%zu(%zu)\", _fixture.thread_id, _fixture.num_threads).c_str());\n    master.setThreadTraceStack(_traceStack);\n    size_t preThreadFailCnt = master.getThreadFailCnt();\n    master.setThreadIgnore(_ignore);\n    master.setThreadUnwind(true);\n    master.setThreadBarrier(&_barrier);\n    _barrier.await();\n    try {\n        _fixture.test_entry_point();\n    } catch (TestMaster::Unwind &) {\n    } catch (std::exception &e) {\n        master.check(false, __FILE__, __LINE__, e.what(), false);\n    } catch (...) {\n        master.check(false, __FILE__, __LINE__, \"test threw stuff\", false);\n    }\n    _barrier.destroy();\n    master.setThreadBarrier(0);\n    bool fail = (master.getThreadFailCnt() > preThreadFailCnt);\n    master.setThreadUnwind(false);\n    master.setThreadIgnore(false);\n    _result = !fail;\n    _latch.countDown();\n    master.setThreadTraceStack(oldTraceStack);\n    master.setThreadName(oldThreadName.c_str());\n}\n\nTestHook *TestHook::_head = 0;\nTestHook *TestHook::_tail = 0;\n\nTestHook::TestHook(const std::string &file, const std::string &name, bool ignore)\n    : _next(0),\n      _name(name),\n      _tag(make_string(\"%s:%s\", file.c_str(), name.c_str())),\n      _ignore(ignore)\n{\n    if (_head == 0) {\n        assert(_tail == 0);\n        _head = this;\n        _tail = this;\n    } else {\n        assert(_tail != 0);\n        assert(_tail->_next == 0);\n        _tail->_next = this;\n        _tail = this;\n    }\n}\n\nconst char *lookup_subset_pattern(const std::string &name) {\n    const char *pattern = getenv(\"TEST_SUBSET\");\n    if (pattern != 0) {\n        fprintf(stderr, \"%s: info:  only running tests matching '%s'\\n\",\n                name.c_str(), pattern);\n    } else {\n        pattern = \"\";\n    }\n    return pattern;\n}\n\nvoid\nTestHook::runAll()\n{\n    FastOSTestThreadFactory threadFactory;\n    TestThreadFactory::factory = &threadFactory;\n    std::string name = TestMaster::master.getName();\n    std::regex pattern(lookup_subset_pattern(name));\n    size_t testsPassed = 0;\n    size_t testsFailed = 0;\n    size_t testsIgnored = 0;\n    size_t testsSkipped = 0;\n    for (TestHook *test = _head; test != 0; test = test->_next) {\n        if (std::regex_search(test->_tag, pattern)) {\n            bool ignored = test->_ignore;\n            bool failed = !test->run();\n            if (ignored) {\n                ++testsIgnored;\n            } else if (failed) {\n                ++testsFailed;\n            } else {\n                ++testsPassed;\n            }\n            const char *level = ignored ? \"Warn: \" : failed ? \"ERROR:\" : \"info: \";\n            fprintf(stderr, \"%s: %s status_for_test '%s': %s%s\\n\",\n                    name.c_str(), level, test->_name.c_str(),\n                    failed ? \"FAIL\" : \"PASS\",\n                    ignored ? \" (ignored)\" : \"\");\n        } else {\n            ++testsSkipped;\n        }\n    }\n    fprintf(stderr, \"%s: info:  test summary --- %zu test(s) passed --- %zu test(s) failed\\n\",\n            name.c_str(), testsPassed, testsFailed);\n    if (testsSkipped > 0) {\n        fprintf(stderr, \"%s: info:  test summary --- %zu test(s) skipped\\n\",\n                name.c_str(), testsSkipped);\n    }\n    if (testsIgnored > 0) {\n        fprintf(stderr, \"%s: Warn:  test summary --- %zu test(s) ignored\\n\",\n                name.c_str(), testsIgnored);\n    }\n    TestThreadFactory::factory = 0;\n}\n\n} \/\/ namespace vespalib\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>XFS file system<commit_after><|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 \"webrtc\/voice_engine\/test\/auto_test\/fixtures\/after_streaming_fixture.h\"\n#include \"webrtc\/voice_engine\/voice_engine_defines.h\"\n\nclass DtmfTest : public AfterStreamingFixture {\n protected:\n  void RunSixteenDtmfEvents(bool out_of_band) {\n    TEST_LOG(\"Sending telephone events:\\n\");\n    EXPECT_EQ(0, voe_dtmf_->SetDtmfFeedbackStatus(false));\n\n    for (int i = 0; i < 16; i++) {\n      TEST_LOG(\"%d \", i);\n      TEST_LOG_FLUSH;\n      EXPECT_EQ(0, voe_dtmf_->SendTelephoneEvent(\n          channel_, i, out_of_band, 160, 10));\n      Sleep(500);\n    }\n    TEST_LOG(\"\\n\");\n  }\n};\n\nTEST_F(DtmfTest, DtmfFeedbackIsEnabledByDefaultButNotDirectFeedback) {\n  bool dtmf_feedback = false;\n  bool dtmf_direct_feedback = false;\n\n  EXPECT_EQ(0, voe_dtmf_->GetDtmfFeedbackStatus(dtmf_feedback,\n                                                dtmf_direct_feedback));\n\n  EXPECT_TRUE(dtmf_feedback);\n  EXPECT_FALSE(dtmf_direct_feedback);\n}\n\nTEST_F(DtmfTest, DISABLED_ManualSuccessfullySendsInBandTelephoneEvents) {\n  RunSixteenDtmfEvents(false);\n}\n\nTEST_F(DtmfTest, DISABLED_ManualSuccessfullySendsOutOfBandTelephoneEvents) {\n  RunSixteenDtmfEvents(true);\n}\n\nTEST_F(DtmfTest, TestTwoNonDtmfEvents) {\n  EXPECT_EQ(0, voe_dtmf_->SendTelephoneEvent(channel_, 32, true));\n  EXPECT_EQ(0, voe_dtmf_->SendTelephoneEvent(channel_, 110, true));\n}\n\n#ifndef WEBRTC_IOS\nTEST_F(DtmfTest, ManualCanDisableDtmfPlayoutExceptOnIphone) {\n  TEST_LOG(\"Disabling DTMF playout (no tone should be heard) \\n\");\n  EXPECT_EQ(0, voe_dtmf_->SetDtmfPlayoutStatus(channel_, false));\n  EXPECT_EQ(0, voe_dtmf_->SendTelephoneEvent(channel_, 0, true));\n  Sleep(500);\n\n  TEST_LOG(\"Enabling DTMF playout (tone should be heard) \\n\");\n  EXPECT_EQ(0, voe_dtmf_->SetDtmfPlayoutStatus(channel_, true));\n  EXPECT_EQ(0, voe_dtmf_->SendTelephoneEvent(channel_, 0, true));\n  Sleep(500);\n}\n#endif\n\n\/\/ This test modifies the DTMF payload type from the default 106 to 88\n\/\/ and then runs through 16 DTMF out.of-band events.\nTEST_F(DtmfTest, ManualCanChangeDtmfPayloadType) {\n  webrtc::CodecInst codec_instance;\n\n  TEST_LOG(\"Changing DTMF payload type.\\n\");\n\n  \/\/ Start by modifying the receiving side.\n  for (int i = 0; i < voe_codec_->NumOfCodecs(); i++) {\n    EXPECT_EQ(0, voe_codec_->GetCodec(i, codec_instance));\n    if (!_stricmp(\"telephone-event\", codec_instance.plname)) {\n      codec_instance.pltype = 88;  \/\/ Use 88 instead of default 106.\n      EXPECT_EQ(0, voe_base_->StopSend(channel_));\n      EXPECT_EQ(0, voe_base_->StopPlayout(channel_));\n      EXPECT_EQ(0, voe_base_->StopReceive(channel_));\n      EXPECT_EQ(0, voe_codec_->SetRecPayloadType(channel_, codec_instance));\n      EXPECT_EQ(0, voe_base_->StartReceive(channel_));\n      EXPECT_EQ(0, voe_base_->StartPlayout(channel_));\n      EXPECT_EQ(0, voe_base_->StartSend(channel_));\n      break;\n    }\n  }\n\n  Sleep(500);\n\n  \/\/ Next, we must modify the sending side as well.\n  EXPECT_EQ(0, voe_dtmf_->SetSendTelephoneEventPayloadType(\n      channel_, codec_instance.pltype));\n\n  RunSixteenDtmfEvents(true);\n\n  EXPECT_EQ(0, voe_dtmf_->SetDtmfFeedbackStatus(true, false));\n}\n<commit_msg>Revert \"Disable the test: DtmfTest.ManualSuccessfullySendsIn\/OutOfBandTelephoneEvents\"<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 \"webrtc\/voice_engine\/test\/auto_test\/fixtures\/after_streaming_fixture.h\"\n#include \"webrtc\/voice_engine\/voice_engine_defines.h\"\n\nclass DtmfTest : public AfterStreamingFixture {\n protected:\n  void RunSixteenDtmfEvents(bool out_of_band) {\n    TEST_LOG(\"Sending telephone events:\\n\");\n    EXPECT_EQ(0, voe_dtmf_->SetDtmfFeedbackStatus(false));\n\n    for (int i = 0; i < 16; i++) {\n      TEST_LOG(\"%d \", i);\n      TEST_LOG_FLUSH;\n      EXPECT_EQ(0, voe_dtmf_->SendTelephoneEvent(\n          channel_, i, out_of_band, 160, 10));\n      Sleep(500);\n    }\n    TEST_LOG(\"\\n\");\n  }\n};\n\nTEST_F(DtmfTest, DtmfFeedbackIsEnabledByDefaultButNotDirectFeedback) {\n  bool dtmf_feedback = false;\n  bool dtmf_direct_feedback = false;\n\n  EXPECT_EQ(0, voe_dtmf_->GetDtmfFeedbackStatus(dtmf_feedback,\n                                                dtmf_direct_feedback));\n\n  EXPECT_TRUE(dtmf_feedback);\n  EXPECT_FALSE(dtmf_direct_feedback);\n}\n\nTEST_F(DtmfTest, ManualSuccessfullySendsInBandTelephoneEvents) {\n  RunSixteenDtmfEvents(false);\n}\n\nTEST_F(DtmfTest, ManualSuccessfullySendsOutOfBandTelephoneEvents) {\n  RunSixteenDtmfEvents(true);\n}\n\nTEST_F(DtmfTest, TestTwoNonDtmfEvents) {\n  EXPECT_EQ(0, voe_dtmf_->SendTelephoneEvent(channel_, 32, true));\n  EXPECT_EQ(0, voe_dtmf_->SendTelephoneEvent(channel_, 110, true));\n}\n\n#ifndef WEBRTC_IOS\nTEST_F(DtmfTest, ManualCanDisableDtmfPlayoutExceptOnIphone) {\n  TEST_LOG(\"Disabling DTMF playout (no tone should be heard) \\n\");\n  EXPECT_EQ(0, voe_dtmf_->SetDtmfPlayoutStatus(channel_, false));\n  EXPECT_EQ(0, voe_dtmf_->SendTelephoneEvent(channel_, 0, true));\n  Sleep(500);\n\n  TEST_LOG(\"Enabling DTMF playout (tone should be heard) \\n\");\n  EXPECT_EQ(0, voe_dtmf_->SetDtmfPlayoutStatus(channel_, true));\n  EXPECT_EQ(0, voe_dtmf_->SendTelephoneEvent(channel_, 0, true));\n  Sleep(500);\n}\n#endif\n\n\/\/ This test modifies the DTMF payload type from the default 106 to 88\n\/\/ and then runs through 16 DTMF out.of-band events.\nTEST_F(DtmfTest, ManualCanChangeDtmfPayloadType) {\n  webrtc::CodecInst codec_instance;\n\n  TEST_LOG(\"Changing DTMF payload type.\\n\");\n\n  \/\/ Start by modifying the receiving side.\n  for (int i = 0; i < voe_codec_->NumOfCodecs(); i++) {\n    EXPECT_EQ(0, voe_codec_->GetCodec(i, codec_instance));\n    if (!_stricmp(\"telephone-event\", codec_instance.plname)) {\n      codec_instance.pltype = 88;  \/\/ Use 88 instead of default 106.\n      EXPECT_EQ(0, voe_base_->StopSend(channel_));\n      EXPECT_EQ(0, voe_base_->StopPlayout(channel_));\n      EXPECT_EQ(0, voe_base_->StopReceive(channel_));\n      EXPECT_EQ(0, voe_codec_->SetRecPayloadType(channel_, codec_instance));\n      EXPECT_EQ(0, voe_base_->StartReceive(channel_));\n      EXPECT_EQ(0, voe_base_->StartPlayout(channel_));\n      EXPECT_EQ(0, voe_base_->StartSend(channel_));\n      break;\n    }\n  }\n\n  Sleep(500);\n\n  \/\/ Next, we must modify the sending side as well.\n  EXPECT_EQ(0, voe_dtmf_->SetSendTelephoneEventPayloadType(\n      channel_, codec_instance.pltype));\n\n  RunSixteenDtmfEvents(true);\n\n  EXPECT_EQ(0, voe_dtmf_->SetDtmfFeedbackStatus(true, false));\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2017 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 <iostream>\n#include <sstream>\n#include <string>\n\n#include <oslogin_utils.h>\n\nusing std::cout;\nusing std::endl;\nusing std::string;\n\nusing oslogin_utils::HttpGet;\nusing oslogin_utils::ParseJsonToSuccess;\nusing oslogin_utils::ParseJsonToKey;\nusing oslogin_utils::ParseJsonToEmail;\nusing oslogin_utils::ParseJsonToSshKeys;\nusing oslogin_utils::UrlEncode;\nusing oslogin_utils::kMetadataServerUrl;\n\nint main(int argc, char* argv[]) {\n  if (argc != 2) {\n    cout << \"usage: authorized_keys [username]\" << endl;\n    return 1;\n  }\n  std::stringstream url;\n  url << kMetadataServerUrl << \"users?username=\" << UrlEncode(argv[1]);\n  string user_response;\n  long http_code = 0;\n  if (!HttpGet(url.str(), &user_response, &http_code) ||\n      user_response.empty() || http_code != 200) {\n    if (http_code == 404) {\n      \/\/ Return 0 if the user is not an oslogin user. If we returned a failure\n      \/\/ code, we would populate auth.log with useless error messages.\n      return 0;\n    }\n    return 1;\n  }\n  string email;\n  if (!ParseJsonToEmail(user_response, &email) || email.empty()) {\n    return 1;\n  }\n  \/\/ Redundantly verify that this user has permission to log in to this VM.\n  \/\/ Normally the PAM module determines this, but in the off chance a transient\n  \/\/ error causes the PAM module to permit a user without login permissions,\n  \/\/ perform the same check here. If this fails, we can guarantee that we won't\n  \/\/ accidentally allow a user to log in without permissions.\n  url.str(\"\");\n  url << kMetadataServerUrl << \"authorize?email=\" << UrlEncode(email)\n      << \"&policy=login\";\n  string auth_response;\n  if (!HttpGet(url.str(), &auth_response, &http_code) || http_code != 200 ||\n      auth_response.empty()) {\n    return 1;\n  }\n  if (!ParseJsonToSuccess(auth_response)) {\n    return 1;\n  }\n  \/\/ At this point, we've verified the user can log in. Grab the ssh keys from\n  \/\/ the user response.\n  std::vector<string> ssh_keys = ParseJsonToSshKeys(user_response);\n  for (size_t i = 0; i < ssh_keys.size(); i++) {\n    cout << ssh_keys[i] << endl;\n  }\n  return 0;\n}\n<commit_msg>catch SIGPIPE in authorized_keys (#73)<commit_after>\/\/ Copyright 2017 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 <iostream>\n#include <sstream>\n#include <string>\n\n#include <signal.h>\n\n#include <oslogin_utils.h>\n\nusing std::cout;\nusing std::endl;\nusing std::string;\n\nusing oslogin_utils::HttpGet;\nusing oslogin_utils::ParseJsonToSuccess;\nusing oslogin_utils::ParseJsonToEmail;\nusing oslogin_utils::ParseJsonToSshKeys;\nusing oslogin_utils::UrlEncode;\nusing oslogin_utils::kMetadataServerUrl;\n\nvoid sigpipe_handler(int signo) {\n  \/\/ exit 0 so SSHD can use what we've already written out.\n  exit(0);\n}\n\nint main(int argc, char* argv[]) {\n  if (argc != 2) {\n    cout << \"usage: authorized_keys [username]\" << endl;\n    return 1;\n  }\n  if (signal(SIGPIPE, sigpipe_handler) == SIG_ERR) {\n    cout << \"Unable to add SIGPIPE handler, exiting\" << endl;\n    return 1;\n  }\n  std::stringstream url;\n  url << kMetadataServerUrl << \"users?username=\" << UrlEncode(argv[1]);\n  string user_response;\n  long http_code = 0;\n  if (!HttpGet(url.str(), &user_response, &http_code) ||\n      user_response.empty() || http_code != 200) {\n    if (http_code == 404) {\n      \/\/ Return 0 if the user is not an oslogin user. If we returned a failure\n      \/\/ code, we would populate auth.log with useless error messages.\n      \/\/ This exits successfully but prints no keys.\n      return 0;\n    }\n    return 1;\n  }\n  string email;\n  if (!ParseJsonToEmail(user_response, &email) || email.empty()) {\n    return 1;\n  }\n  \/\/ Redundantly verify that this user has permission to log in to this VM.\n  \/\/ Normally the PAM module determines this, but in the off chance a transient\n  \/\/ error causes the PAM module to permit a user without login permissions,\n  \/\/ perform the same check here. If this fails, we can guarantee that we won't\n  \/\/ accidentally allow a user to log in without permissions.\n  url.str(\"\");\n  url << kMetadataServerUrl << \"authorize?email=\" << UrlEncode(email)\n      << \"&policy=login\";\n  string auth_response;\n  if (!HttpGet(url.str(), &auth_response, &http_code) || http_code != 200 ||\n      auth_response.empty()) {\n    return 1;\n  }\n  if (!ParseJsonToSuccess(auth_response)) {\n    return 1;\n  }\n  \/\/ At this point, we've verified the user can log in. Grab the ssh keys from\n  \/\/ the user response.\n  std::vector<string> ssh_keys = ParseJsonToSshKeys(user_response);\n  for (size_t i = 0; i < ssh_keys.size(); i++) {\n    cout << ssh_keys[i] << endl;\n  }\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*! \\file ExecutableKernel.h\r\n\t\\author Gregory Diamos <gregory.diamos@gatech.edu>\r\n\t\\date December 22, 2009\r\n\t\\brief implements a kernel that is executable on some device\r\n*\/\r\n\r\n#ifndef IR_EXECUTABLE_KERNEL_CPP_INCLUDED\r\n#define IR_EXECUTABLE_KERNEL_CPP_INCLUDED\r\n\n\/\/ C includes\n#include <memory.h>\n\n\/\/ Ocelot includes\r\n#include <ocelot\/ir\/interface\/ExecutableKernel.h>\n#include <ocelot\/trace\/interface\/TraceGenerator.h>\n\n\/\/ Hydrazine includes\n#include <hydrazine\/implementation\/debug.h>\n#include <hydrazine\/implementation\/Exception.h>\n#include <hydrazine\/implementation\/macros.h>\n\n\/\/ Debugging messages\n#ifdef REPORT_BASE\n#undef REPORT_BASE\n#endif\n\n#define REPORT_BASE 0\n\r\nnamespace ir \n{\r\nExecutableKernel::ExecutableKernel( const Kernel& k, \n\tconst executive::Executive* c ) : Kernel( k ), context( c ), \n\t_constMemorySize( 0 ), _localMemorySize( 0 ), _maxThreadsPerBlock( 0 ), \n\t_registerCount( 0 ), _sharedMemorySize( 0 ), \n\t_externSharedMemorySize( 0 ), _parameterMemorySize( 0 )\n{\n\tmapParameterOffsets();\n}\r\n\nExecutableKernel::ExecutableKernel( const executive::Executive* c ) :\n\tcontext( c ), _constMemorySize( 0 ), _localMemorySize( 0 ), _maxThreadsPerBlock( 0 ), \n\t_registerCount( 0 ), _sharedMemorySize( 0 ), \t_externSharedMemorySize( 0 ), \n\t_parameterMemorySize( 0 )\n{\n\tmapParameterOffsets();\n}\r\n\nExecutableKernel::~ExecutableKernel() \n{\n\n}\r\n\nbool ExecutableKernel::executable() \n{\r\n\treturn true;\r\n}\r\n\nvoid ExecutableKernel::traceEvent( const trace::TraceEvent & event) const\n{\n\tfor( TraceGeneratorVector::const_iterator \n\t\tgenerator = _generators.begin(); \n\t\tgenerator != _generators.end(); ++generator ) \n\t{\n\t\t(*generator)->event(event);\n\t}\n}\n\nunsigned int ExecutableKernel::constMemorySize() const\n{\n\treturn _constMemorySize; \n}\n\nunsigned int ExecutableKernel::localMemorySize() const\n{ \n\treturn _localMemorySize; \n}\n\nunsigned int ExecutableKernel::maxThreadsPerBlock() const\n{\n\treturn _maxThreadsPerBlock; \n}\n\nunsigned int ExecutableKernel::registerCount() const\n{ \n\treturn _registerCount; \n}\n\nunsigned int ExecutableKernel::sharedMemorySize() const \n{ \n\treturn _sharedMemorySize; \n}\n\nunsigned int ExecutableKernel::externSharedMemorySize() const \n{ \n\treturn _externSharedMemorySize; \n}\n\nunsigned int ExecutableKernel::totalSharedMemorySize() const\n{\n\treturn externSharedMemorySize() + sharedMemorySize();\n}\n\nunsigned int ExecutableKernel::parameterMemorySize() const \n{ \n\treturn _parameterMemorySize; \n}\n\nconst ir::Dim3& ExecutableKernel::blockDim() const\n{\n\treturn _blockDim;\n}\r\n\nconst ir::Dim3& ExecutableKernel::gridDim() const\n{\n\treturn _gridDim;\n}\n\n\/*!\n\t\\brief compute parameter offsets for parameter data\n*\/\nsize_t ExecutableKernel::mapParameterOffsets() {\n\tstd::vector< ir::Parameter >::iterator it = parameters.begin();\r\n\tunsigned int paramSize = 0;\n\r\n\tfor (; it != parameters.end(); ++it) {\n\t\tif (it->getElementSize() == 8 && (paramSize % 8)) {\n\t\t\tparamSize += 8 - (paramSize % 8);\n\t\t}\n\t\telse if (it->getElementSize() == 4 && (paramSize % 4)) {\n\t\t\tparamSize += 4 - (paramSize % 4);\n\t\t}\r\n\t\tit->offset = paramSize;\r\n\t\tparamSize += it->getSize();\r\n\t}\n\n\treturn paramSize;\n}\n\n\/*!\n\t\\brief given a block of parameter memory, sets the values of each parameter\n\t\\param parameter pointer to parameter memory\n\t\\param paramSize number of bytes to write to parameter memory\n*\/\nvoid ExecutableKernel::setParameterBlock(const unsigned char *parameter, size_t paramSize) {\n\tmapParameterOffsets();\n\n\treport(\"ExecutableKernel::setParameterBlock() - paramSize = \" << paramSize);\n\n\tstd::vector< ir::Parameter >::iterator it = parameters.begin();\n\tfor (it = parameters.begin(); it != parameters.end(); ++it) {\n\n\t\tswitch (it->type) {\n\t\t\tcase ir::PTXOperand::b8:\t\/\/ fall through\n\t\t\tcase ir::PTXOperand::s8:\t\/\/ fall through\n\t\t\tcase ir::PTXOperand::s16:\t\/\/ fall through\n\t\t\tcase ir::PTXOperand::u8:\t\/\/ fall through\n\t\t\tcase ir::PTXOperand::u16: \/\/ fall through\n\t\t\tcase ir::PTXOperand::f32: \/\/ fall through\n\t\t\tcase ir::PTXOperand::s32:\t\/\/ fall through\n\t\t\tcase ir::PTXOperand::u32:\t\/\/ fall through\n\t\t\tcase ir::PTXOperand::s64:\t\/\/ fall through\n\t\t\tcase ir::PTXOperand::u64:\n\t\t\t{\n\t\t\t\tconst unsigned char *ptr = parameter + it->offset;\n\t\t\t\tfor (ir::Parameter::ValueVector::iterator val_it = it->arrayValues.begin();\n\t\t\t\t\tval_it != it->arrayValues.end(); ++val_it, ptr += it->getElementSize()) {\n\n\t\t\t\t\tmemcpy(&val_it->val_u64, ptr, it->getElementSize());\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tdefault:\n\t\t\t{\n\t\t\t\tthrow hydrazine::Exception(std::string(\"Parameter type \") + \n\t\t\t\t\tir::PTXOperand::toString(it->type) + \" not supported for kernel \" + name);\n\t\t\t}\n\t\t}\n\n\t\treport(\"Configuring parameter \" << it->name \n\t\t\t<< \" - offset: \"  << it->offset\n\t\t\t<< \" - type: \" << it->arrayValues.size() << \" x \" \n\t\t\t<< ir::PTXOperand::toString(it->type)\n\t\t\t<< \" - value: \" << ir::Parameter::value(*it));\n\t}\n}\n\n\/*!\n\t\\brief gets the values of each parameter as a block of binary data\n\t\\param parameter pointer to parameter memory\n\t\\param maxSize maximum number of bytes to write to parameter memory\n\t\\return actual number of bytes required by parameter memory\n*\/\nsize_t ExecutableKernel::getParameterBlock(unsigned char *parameter, size_t maxSize) const {\n\tsize_t offset = 0;\n\tstd::vector< ir::Parameter >::const_iterator it = parameters.begin();\n\tfor (it = parameters.begin(); it != parameters.end(); ++it) {\n\t\treport(\"Getting parameter \" << it->name \n\t\t\t<< \" \" \n\t\t\t<< \" - type: \" << it->arrayValues.size() << \" x \" \n\t\t\t<< ir::PTXOperand::toString(it->type)\n\t\t\t<< \" - value: \" << ir::Parameter::value(*it));\n\n\t\tswitch (it->type) {\n\t\t\tcase ir::PTXOperand::b8:\t\/\/ fall through\n\t\t\tcase ir::PTXOperand::s8:\t\/\/ fall through\n\t\t\tcase ir::PTXOperand::s16:\t\/\/ fall through\n\t\t\tcase ir::PTXOperand::u8:\t\/\/ fall through\n\t\t\tcase ir::PTXOperand::u16: \/\/ fall through\n\t\t\tcase ir::PTXOperand::f32: \/\/ fall through\n\t\t\tcase ir::PTXOperand::s32:\t\/\/ fall through\n\t\t\tcase ir::PTXOperand::u32:\t\/\/ fall through\n\t\t\tcase ir::PTXOperand::s64:\t\/\/ fall through\n\t\t\tcase ir::PTXOperand::u64:\n\t\t\t{\n\t\t\t\tunsigned char *ptr = parameter + it->offset;\n\t\t\t\tfor (ir::Parameter::ValueVector::const_iterator val_it = it->arrayValues.begin();\n\t\t\t\t\tval_it != it->arrayValues.end(); ++val_it, ptr += it->getElementSize()) {\n\t\t\t\t\t\n\t\t\t\t\tmemcpy(ptr, &val_it->val_u64, it->getElementSize());\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tdefault:\n\t\t\t{\n\t\t\t\tthrow hydrazine::Exception(std::string(\"Parameter type \") + \n\t\t\t\t\tir::PTXOperand::toString(it->type) + \" not supported for kernel \" + name);\n\t\t\t}\n\t\t}\n\t\toffset = it->offset + it->getElementSize();\n\t}\n\treturn offset;\n}\n\r\n}\r\n\r\n#endif\r\n<commit_msg>fixed padding for all powers of two sizes<commit_after>\/*! \\file ExecutableKernel.h\r\n\t\\author Gregory Diamos <gregory.diamos@gatech.edu>\r\n\t\\date December 22, 2009\r\n\t\\brief implements a kernel that is executable on some device\r\n*\/\r\n\r\n#ifndef IR_EXECUTABLE_KERNEL_CPP_INCLUDED\r\n#define IR_EXECUTABLE_KERNEL_CPP_INCLUDED\r\n\n\/\/ C includes\n#include <memory.h>\n\n\/\/ Ocelot includes\r\n#include <ocelot\/ir\/interface\/ExecutableKernel.h>\n#include <ocelot\/trace\/interface\/TraceGenerator.h>\n\n\/\/ Hydrazine includes\n#include <hydrazine\/implementation\/debug.h>\n#include <hydrazine\/implementation\/Exception.h>\n#include <hydrazine\/implementation\/macros.h>\n\n\/\/ Debugging messages\n#ifdef REPORT_BASE\n#undef REPORT_BASE\n#endif\n\n#define REPORT_BASE 0\n\r\nnamespace ir \n{\r\nExecutableKernel::ExecutableKernel( const Kernel& k, \n\tconst executive::Executive* c ) : Kernel( k ), context( c ), \n\t_constMemorySize( 0 ), _localMemorySize( 0 ), _maxThreadsPerBlock( 0 ), \n\t_registerCount( 0 ), _sharedMemorySize( 0 ), \n\t_externSharedMemorySize( 0 ), _parameterMemorySize( 0 )\n{\n\tmapParameterOffsets();\n}\r\n\nExecutableKernel::ExecutableKernel( const executive::Executive* c ) :\n\tcontext( c ), _constMemorySize( 0 ), _localMemorySize( 0 ), _maxThreadsPerBlock( 0 ), \n\t_registerCount( 0 ), _sharedMemorySize( 0 ), \t_externSharedMemorySize( 0 ), \n\t_parameterMemorySize( 0 )\n{\n\tmapParameterOffsets();\n}\r\n\nExecutableKernel::~ExecutableKernel() \n{\n\n}\r\n\nbool ExecutableKernel::executable() \n{\r\n\treturn true;\r\n}\r\n\nvoid ExecutableKernel::traceEvent( const trace::TraceEvent & event) const\n{\n\tfor( TraceGeneratorVector::const_iterator \n\t\tgenerator = _generators.begin(); \n\t\tgenerator != _generators.end(); ++generator ) \n\t{\n\t\t(*generator)->event(event);\n\t}\n}\n\nunsigned int ExecutableKernel::constMemorySize() const\n{\n\treturn _constMemorySize; \n}\n\nunsigned int ExecutableKernel::localMemorySize() const\n{ \n\treturn _localMemorySize; \n}\n\nunsigned int ExecutableKernel::maxThreadsPerBlock() const\n{\n\treturn _maxThreadsPerBlock; \n}\n\nunsigned int ExecutableKernel::registerCount() const\n{ \n\treturn _registerCount; \n}\n\nunsigned int ExecutableKernel::sharedMemorySize() const \n{ \n\treturn _sharedMemorySize; \n}\n\nunsigned int ExecutableKernel::externSharedMemorySize() const \n{ \n\treturn _externSharedMemorySize; \n}\n\nunsigned int ExecutableKernel::totalSharedMemorySize() const\n{\n\treturn externSharedMemorySize() + sharedMemorySize();\n}\n\nunsigned int ExecutableKernel::parameterMemorySize() const \n{ \n\treturn _parameterMemorySize; \n}\n\nconst ir::Dim3& ExecutableKernel::blockDim() const\n{\n\treturn _blockDim;\n}\r\n\nconst ir::Dim3& ExecutableKernel::gridDim() const\n{\n\treturn _gridDim;\n}\n\n\/*!\n\t\\brief compute parameter offsets for parameter data\n*\/\nsize_t ExecutableKernel::mapParameterOffsets() {\n\tstd::vector< ir::Parameter >::iterator it = parameters.begin();\r\n\tunsigned int paramSize = 0;\n\r\n\tfor (; it != parameters.end(); ++it) {\n\t\tif (it->getElementSize() == 8 && (paramSize % 8)) {\n\t\t\tparamSize += 8 - (paramSize % 8);\n\t\t}\n\t\telse if (it->getElementSize() == 4 && (paramSize % 4)) {\n\t\t\tparamSize += 4 - (paramSize % 4);\n\t\t}\n\t\telse if (it->getElementSize() == 2 && (paramSize % 2)) {\n\t\t\tparamSize += 2 - (paramSize % 2);\n\t\t}\n\r\n\t\tit->offset = paramSize;\r\n\t\tparamSize += it->getSize();\r\n\t}\n\n\treturn paramSize;\n}\n\n\/*!\n\t\\brief given a block of parameter memory, sets the values of each parameter\n\t\\param parameter pointer to parameter memory\n\t\\param paramSize number of bytes to write to parameter memory\n*\/\nvoid ExecutableKernel::setParameterBlock(const unsigned char *parameter, size_t paramSize) {\n\tmapParameterOffsets();\n\n\treport(\"ExecutableKernel::setParameterBlock() - paramSize = \" << paramSize);\n\n\tstd::vector< ir::Parameter >::iterator it = parameters.begin();\n\tfor (it = parameters.begin(); it != parameters.end(); ++it) {\n\n\t\tswitch (it->type) {\n\t\t\tcase ir::PTXOperand::b8:\t\/\/ fall through\n\t\t\tcase ir::PTXOperand::s8:\t\/\/ fall through\n\t\t\tcase ir::PTXOperand::s16:\t\/\/ fall through\n\t\t\tcase ir::PTXOperand::u8:\t\/\/ fall through\n\t\t\tcase ir::PTXOperand::u16: \/\/ fall through\n\t\t\tcase ir::PTXOperand::f32: \/\/ fall through\n\t\t\tcase ir::PTXOperand::s32:\t\/\/ fall through\n\t\t\tcase ir::PTXOperand::u32:\t\/\/ fall through\n\t\t\tcase ir::PTXOperand::s64:\t\/\/ fall through\n\t\t\tcase ir::PTXOperand::u64:\n\t\t\t{\n\t\t\t\tconst unsigned char *ptr = parameter + it->offset;\n\t\t\t\tfor (ir::Parameter::ValueVector::iterator val_it = it->arrayValues.begin();\n\t\t\t\t\tval_it != it->arrayValues.end(); ++val_it, ptr += it->getElementSize()) {\n\n\t\t\t\t\tmemcpy(&val_it->val_u64, ptr, it->getElementSize());\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tdefault:\n\t\t\t{\n\t\t\t\tthrow hydrazine::Exception(std::string(\"Parameter type \") + \n\t\t\t\t\tir::PTXOperand::toString(it->type) + \" not supported for kernel \" + name);\n\t\t\t}\n\t\t}\n\n\t\treport(\"Configuring parameter \" << it->name \n\t\t\t<< \" - offset: \"  << it->offset\n\t\t\t<< \" - type: \" << it->arrayValues.size() << \" x \" \n\t\t\t<< ir::PTXOperand::toString(it->type)\n\t\t\t<< \" - value: \" << ir::Parameter::value(*it));\n\t}\n}\n\n\/*!\n\t\\brief gets the values of each parameter as a block of binary data\n\t\\param parameter pointer to parameter memory\n\t\\param maxSize maximum number of bytes to write to parameter memory\n\t\\return actual number of bytes required by parameter memory\n*\/\nsize_t ExecutableKernel::getParameterBlock(unsigned char *parameter, size_t maxSize) const {\n\tsize_t offset = 0;\n\tstd::vector< ir::Parameter >::const_iterator it = parameters.begin();\n\tfor (it = parameters.begin(); it != parameters.end(); ++it) {\n\t\treport(\"Getting parameter \" << it->name \n\t\t\t<< \" \" \n\t\t\t<< \" - type: \" << it->arrayValues.size() << \" x \" \n\t\t\t<< ir::PTXOperand::toString(it->type)\n\t\t\t<< \" - value: \" << ir::Parameter::value(*it));\n\n\t\tswitch (it->type) {\n\t\t\tcase ir::PTXOperand::b8:\t\/\/ fall through\n\t\t\tcase ir::PTXOperand::s8:\t\/\/ fall through\n\t\t\tcase ir::PTXOperand::s16:\t\/\/ fall through\n\t\t\tcase ir::PTXOperand::u8:\t\/\/ fall through\n\t\t\tcase ir::PTXOperand::u16: \/\/ fall through\n\t\t\tcase ir::PTXOperand::f32: \/\/ fall through\n\t\t\tcase ir::PTXOperand::s32:\t\/\/ fall through\n\t\t\tcase ir::PTXOperand::u32:\t\/\/ fall through\n\t\t\tcase ir::PTXOperand::s64:\t\/\/ fall through\n\t\t\tcase ir::PTXOperand::u64:\n\t\t\t{\n\t\t\t\tunsigned char *ptr = parameter + it->offset;\n\t\t\t\tfor (ir::Parameter::ValueVector::const_iterator val_it = it->arrayValues.begin();\n\t\t\t\t\tval_it != it->arrayValues.end(); ++val_it, ptr += it->getElementSize()) {\n\t\t\t\t\t\n\t\t\t\t\tmemcpy(ptr, &val_it->val_u64, it->getElementSize());\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tdefault:\n\t\t\t{\n\t\t\t\tthrow hydrazine::Exception(std::string(\"Parameter type \") + \n\t\t\t\t\tir::PTXOperand::toString(it->type) + \" not supported for kernel \" + name);\n\t\t\t}\n\t\t}\n\t\toffset = it->offset + it->getElementSize();\n\t}\n\treturn offset;\n}\n\r\n}\r\n\r\n#endif\r\n<|endoftext|>"}
{"text":"<commit_before>#define BOOST_TEST_MODULE \"test_global_external_interactionMU\"\n\n#ifdef UNITTEST_FRAMEWORK_LIBRARY_EXIST\n#include <boost\/test\/unit_test.hpp>\n#else\n#define BOOST_TEST_NO_LIB\n#include <boost\/test\/included\/unit_test.hpp>\n#endif\n\n#include <mjolnir\/core\/GlobalExternalInteractionMU.hpp>\n#include <mjolnir\/core\/BoundaryCondition.hpp>\n#include <mjolnir\/core\/SimulatorTraits.hpp>\n#include <mjolnir\/potential\/ImplicitMembranePotential.hpp>\n#include <mjolnir\/util\/make_unique.hpp>\n\nBOOST_AUTO_TEST_CASE(GlobalExternal_calc_force)\n{\n    typedef mjolnir::SimulatorTraitsBase<double, mjolnir::Unlimited> traits;\n    constexpr static traits::real_type tolerance = 1e-8;\n\n    typedef traits::real_type real_type;\n    typedef traits::coordinate_type coord_type;\n    typedef traits::boundary_type boudary_type;\n    typedef mjolnir::Particle<coord_type> particle_type;\n    typedef mjolnir::System<traits> system_type;\n    typedef mjolnir::ImplicitMembranePotential<traits> implicit_membrane_type;\n    typedef mjolnir::GlobalExternalInteraction<traits, implicit_membrane_type>\n\tglobal_external_type;\n  \n    const real_type thickness(10.);\n    const real_type interaction_magnitude(1.);\n    const real_type bend(1.5);\n\n    implicit_membrane_type potential{thickness, interaction_magnitude, bend};\n    global_external_type interaction{potential, boundary_type{}};\n  \n    std::vector<particle_type> ps{\n\t{1., coord_type(0,0,0), coord_type(0,0,0), coord_type(0,0,0)}\n    };\n    system_type sys(std::move(ps), boundary_type{});\n  \n    const real_type dr = 1e-2;\n    real_type dist = -5.;\n    for(int i = 0; i < 2000; ++i)\n    {\n      \n    }\n}\n\n  \n<commit_msg>compleated(maybe) test for global external interaction.<commit_after>#define BOOST_TEST_MODULE \"test_global_external_interactionMU\"\n\n#ifdef UNITTEST_FRAMEWORK_LIBRARY_EXIST\n#include <boost\/test\/unit_test.hpp>\n#else\n#define BOOST_TEST_NO_LIB\n#include <boost\/test\/included\/unit_test.hpp>\n#endif\n\n#include <mjolnir\/core\/GlobalExternalInteractionMU.hpp>\n#include <mjolnir\/core\/BoundaryCondition.hpp>\n#include <mjolnir\/core\/SimulatorTraits.hpp>\n#include <mjolnir\/potential\/ImplicitMembranePotential.hpp>\n#include <mjolnir\/util\/make_unique.hpp>\n\nBOOST_AUTO_TEST_CASE(GlobalExternal_calc_force)\n{\n    typedef mjolnir::SimulatorTraitsBase<double, mjolnir::Unlimited> traits;\n    constexpr static traits::real_type tolerance = 1e-8;\n\n    typedef traits::real_type real_type;\n    typedef traits::coordinate_type coord_type;\n    typedef traits::boundary_type boudary_type;\n    typedef mjolnir::Particle<coord_type> particle_type;\n    typedef mjolnir::System<traits> system_type;\n    typedef mjolnir::ImplicitMembranePotential<traits> implicit_membrane_type;\n    typedef mjolnir::GlobalExternalInteraction<traits, implicit_membrane_type>\n\tglobal_external_type;\n  \n    const real_type thickness(10.);\n    const real_type interaction_magnitude(1.);\n    const real_type bend(1.5);\n\n    implicit_membrane_type potential{thickness, interaction_magnitude, bend};\n    global_external_type interaction{potential, boundary_type{}};\n  \n    std::vector<particle_type> ps{\n\t{1., coord_type(0,0,0), coord_type(0,0,0), coord_type(0,0,0)}\t\n    };\n    system_type sys(std::move(ps), boundary_type{});\n  \n    const real_type dr = 1e-2;\n    real_type dist = -10.;\n    for(int i = 0; i < 2000; ++i)\n    {\n\tsys[0].position[0] = dist;\n\tsys[0].position[1] = dist;\n\tsys[0].position[2] = dist;\n\n\tconst real_type deriv = potential.derivative(dist);\n        const real_type coef  = std::abs(deriv);\n\t\n\tinteraction.calcu_force(sys);\n\n\tconst real_type force_strength = mjolnir::length(sys[0].force);\n\n\tBOOST_CHECK_CLOSE_FRACTION(coef, force_strength, tolerance);\n\n\tBOOST_CHECK_EQUAL(sys[0].force[0],0);\n\tBOOST_CHECK_EQUAL(sys[0].force[1],0);\n\n\tdist += dr\n    }\n}\n\n  \n<|endoftext|>"}
{"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- *\/\n\/*\n *     Copyright 2010 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 <stdint.h>\n#include <string.h>\n#include <assert.h>\n\n#include \"configuration.h\"\n\n\nfdb_config get_default_config(void) {\n    fdb_config fconfig;\n\n    fconfig.chunksize = sizeof(uint64_t);\n    \/\/ 4KB by default.\n    fconfig.blocksize = FDB_BLOCKSIZE;\n    \/\/ 128MB by default.\n    fconfig.buffercache_size = 134217728;\n    \/\/ 4096 WAL entries by default.\n    fconfig.wal_threshold = 4096;\n    fconfig.wal_flush_before_commit = false;\n    \/\/ 0 second by default.\n    fconfig.purging_interval = 0;\n    \/\/ Use a seq btree by default.\n    fconfig.seqtree_opt = FDB_SEQTREE_USE;\n    \/\/ Use a synchronous commit by default.\n    fconfig.durability_opt = FDB_DRB_NONE;\n    fconfig.flags = FDB_OPEN_FLAG_CREATE;\n    \/\/ 4MB by default.\n    fconfig.compaction_buf_maxsize = FDB_COMP_BUF_MAXSIZE;\n    \/\/ Clean up cache entries when a file is closed.\n    fconfig.cleanup_cache_onclose = true;\n    \/\/ Compress the body of documents using snappy.\n    fconfig.compress_document_body = false;\n    fconfig.cmp_fixed = NULL;\n    fconfig.cmp_variable = NULL;\n    \/\/ Auto compaction is disabled by default\n    fconfig.compaction_mode = FDB_COMPACTION_MANUAL;\n    \/\/ Compaction threshold, 30% by default\n    fconfig.compaction_threshold = FDB_DEFAULT_COMPACTION_THRESHOLD;\n    fconfig.compaction_minimum_filesize = 1048576; \/\/ 1MB by default\n    \/\/ 15 seconds by default\n    fconfig.compactor_sleep_duration = FDB_COMPACTOR_SLEEP_DURATION;\n\n    return fconfig;\n}\n\nbool validate_fdb_config(fdb_config *fconfig) {\n    assert(fconfig);\n\n    if (fconfig->chunksize < 4 || fconfig->chunksize > 64) {\n        \/\/ Chunk size should be set between 4 and 64 bytes.\n        return false;\n    }\n    if (fconfig->blocksize < 1024 || fconfig->blocksize > 131072) {\n        \/\/ Block size should be set between 1KB and 128KB\n        return false;\n    }\n    if (fconfig->seqtree_opt != FDB_SEQTREE_NOT_USE &&\n        fconfig->seqtree_opt != FDB_SEQTREE_USE) {\n        return false;\n    }\n    if (fconfig->durability_opt != FDB_DRB_NONE &&\n        fconfig->durability_opt != FDB_DRB_ODIRECT &&\n        fconfig->durability_opt != FDB_DRB_ASYNC &&\n        fconfig->durability_opt != FDB_DRB_ODIRECT_ASYNC) {\n        return false;\n    }\n    if ((fconfig->flags & FDB_OPEN_FLAG_CREATE) &&\n        (fconfig->flags & FDB_OPEN_FLAG_RDONLY)) {\n        return false;\n    }\n    if (fconfig->compaction_threshold > 100) {\n        \/\/ Compaction threshold should be equal or less then 100 (%).\n        return false;\n    }\n    if (fconfig->compactor_sleep_duration == 0) {\n        \/\/ Sleep duration should be larger than zero\n        return false;\n    }\n\n    return true;\n}\n<commit_msg>Enable wal_flush_before_commit by default.<commit_after>\/* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- *\/\n\/*\n *     Copyright 2010 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 <stdint.h>\n#include <string.h>\n#include <assert.h>\n\n#include \"configuration.h\"\n\n\nfdb_config get_default_config(void) {\n    fdb_config fconfig;\n\n    fconfig.chunksize = sizeof(uint64_t);\n    \/\/ 4KB by default.\n    fconfig.blocksize = FDB_BLOCKSIZE;\n    \/\/ 128MB by default.\n    fconfig.buffercache_size = 134217728;\n    \/\/ 4096 WAL entries by default.\n    fconfig.wal_threshold = 4096;\n    fconfig.wal_flush_before_commit = true;\n    \/\/ 0 second by default.\n    fconfig.purging_interval = 0;\n    \/\/ Use a seq btree by default.\n    fconfig.seqtree_opt = FDB_SEQTREE_USE;\n    \/\/ Use a synchronous commit by default.\n    fconfig.durability_opt = FDB_DRB_NONE;\n    fconfig.flags = FDB_OPEN_FLAG_CREATE;\n    \/\/ 4MB by default.\n    fconfig.compaction_buf_maxsize = FDB_COMP_BUF_MAXSIZE;\n    \/\/ Clean up cache entries when a file is closed.\n    fconfig.cleanup_cache_onclose = true;\n    \/\/ Compress the body of documents using snappy.\n    fconfig.compress_document_body = false;\n    fconfig.cmp_fixed = NULL;\n    fconfig.cmp_variable = NULL;\n    \/\/ Auto compaction is disabled by default\n    fconfig.compaction_mode = FDB_COMPACTION_MANUAL;\n    \/\/ Compaction threshold, 30% by default\n    fconfig.compaction_threshold = FDB_DEFAULT_COMPACTION_THRESHOLD;\n    fconfig.compaction_minimum_filesize = 1048576; \/\/ 1MB by default\n    \/\/ 15 seconds by default\n    fconfig.compactor_sleep_duration = FDB_COMPACTOR_SLEEP_DURATION;\n\n    return fconfig;\n}\n\nbool validate_fdb_config(fdb_config *fconfig) {\n    assert(fconfig);\n\n    if (fconfig->chunksize < 4 || fconfig->chunksize > 64) {\n        \/\/ Chunk size should be set between 4 and 64 bytes.\n        return false;\n    }\n    if (fconfig->blocksize < 1024 || fconfig->blocksize > 131072) {\n        \/\/ Block size should be set between 1KB and 128KB\n        return false;\n    }\n    if (fconfig->seqtree_opt != FDB_SEQTREE_NOT_USE &&\n        fconfig->seqtree_opt != FDB_SEQTREE_USE) {\n        return false;\n    }\n    if (fconfig->durability_opt != FDB_DRB_NONE &&\n        fconfig->durability_opt != FDB_DRB_ODIRECT &&\n        fconfig->durability_opt != FDB_DRB_ASYNC &&\n        fconfig->durability_opt != FDB_DRB_ODIRECT_ASYNC) {\n        return false;\n    }\n    if ((fconfig->flags & FDB_OPEN_FLAG_CREATE) &&\n        (fconfig->flags & FDB_OPEN_FLAG_RDONLY)) {\n        return false;\n    }\n    if (fconfig->compaction_threshold > 100) {\n        \/\/ Compaction threshold should be equal or less then 100 (%).\n        return false;\n    }\n    if (fconfig->compactor_sleep_duration == 0) {\n        \/\/ Sleep duration should be larger than zero\n        return false;\n    }\n\n    return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <stdio.h>\n#include <stdlib.h>\n#include \"Eigen\/Dense\"\n#include \"gtest\/gtest.h\"\n#include \"include\/cpu_operations.h\"\n#include \"include\/matrix.h\"\n\nTEST(Mutilply, ScalarMatrixMult){  \n\n  int scalar;\n  scalar = 3; \n  \n  Eigen::MatrixXi a(3,3);\n  a << 0, 1, 2,\n       3, 2, 1,\n       1, 3, 0;\n\n  Eigen::MatrixXi correct_ans(3,3);\n  correct_ans << 0, 3, 6,\n                 9, 6, 3,\n                 3, 9, 0;\n\n  Nice::Matrix<int> calculated_ans = Nice::CpuOperations<int>::Multiply(a, scalar);\n    for (int i = 0; i < 3; ++i) \n      for (int j = 0; j < 3; ++j)\n        EXPECT_EQ(correct_ans(i,j), calculated_ans(i,j));\n\n}\n\nTEST(Mutilply, MatrixMatrixMult){\n\n  Eigen::MatrixXi a(3,3);\n  a << 0, 1, 2,\n       3, 2, 1,\n       1, 3, 0;\n\n  Eigen::MatrixXi b(3,3);\n  b << 1, 0, 2,\n       2, 1, 0,\n       0, 2, 1;\n\n  Eigen::MatrixXi correct_ans(3,3);\n  correct_ans << 2, 5, 2,\n                 7, 4, 7,\n                 7, 3, 2;\n\n  Nice::Matrix<int> calculated_ans = Nice::CpuOperations<int>::Multiply(a, b);\n    for (int i = 0; i < 3; ++i)\n      for (int j = 0; j < 3; ++j)\n        EXPECT_EQ(correct_ans(i,j), calculated_ans(i,j));\n\n}\n<commit_msg>Multiply updated to Google coding style<commit_after>\/\/ Copyright 2016 <Morgan Rockett>\n#include <stdio.h>\n#include <stdlib.h>\n#include <iostream>\n#include \"Eigen\/Dense\"\n#include \"gtest\/gtest.h\"\n#include \"include\/cpu_operations.h\"\n#include \"include\/matrix.h\"\nTEST(Mutilply, ScalarMatrixMult) {\n  int scalar;\n  scalar = 3;\n  Eigen::MatrixXi a(3, 3);\n  a << 0, 1, 2,\n       3, 2, 1,\n       1, 3, 0;\n  Eigen::MatrixXi correct_ans(3, 3);\n  correct_ans << 0, 3, 6,\n                 9, 6, 3,\n                 3, 9, 0;\n  Nice::Matrix<int> calc_ans = Nice::CpuOperations<int>::Multiply(a, scalar);\n    for (int i = 0; i < 3; ++i)\n      for (int j = 0; j < 3; ++j)\n        EXPECT_EQ(correct_ans(i, j), calc_ans(i, j));\n}\nTEST(Mutilply, MatrixMatrixMult) {\n  Eigen::MatrixXi a(3, 3);\n  a << 0, 1, 2,\n       3, 2, 1,\n       1, 3, 0;\n  Eigen::MatrixXi b(3, 3);\n  b << 1, 0, 2,\n       2, 1, 0,\n       0, 2, 1;\n  Eigen::MatrixXi correct_ans(3, 3);\n  correct_ans << 2, 5, 2,\n                 7, 4, 7,\n                 7, 3, 2;\n  Nice::Matrix<int> calc_ans = Nice::CpuOperations<int>::Multiply(a, b);\n    for (int i = 0; i < 3; ++i)\n      for (int j = 0; j < 3; ++j)\n        EXPECT_EQ(correct_ans(i, j), calc_ans(i, j));\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <mirrage\/engine.hpp>\n\n#include <mirrage\/asset\/asset_manager.hpp>\n#include <mirrage\/graphic\/context.hpp>\n#include <mirrage\/graphic\/window.hpp>\n#include <mirrage\/gui\/gui.hpp>\n#include <mirrage\/input\/input_manager.hpp>\n#include <mirrage\/net\/net_manager.hpp>\n#include <mirrage\/translations.hpp>\n#include <mirrage\/utils\/log.hpp>\n#include <mirrage\/utils\/time.hpp>\n#include <mirrage\/utils\/units.hpp>\n\n#include <chrono>\n#include <stdexcept>\n\n#ifdef _WIN32\n\/\/ TODO\n#else\n#include <signal.h>\n#endif\n\nextern void ref_embedded_assets_mirrage();\n\nnamespace mirrage {\n\tnamespace {\n\t\tvoid init_sub_system(Uint32 f, const std::string& name, bool required = true)\n\t\t{\n\t\t\tif(SDL_InitSubSystem(f) != 0) {\n\t\t\t\tauto m = \"Could not initialize \" + name + \": \" + get_sdl_error();\n\n\t\t\t\tif(required)\n\t\t\t\t\tMIRRAGE_FAIL(m);\n\t\t\t\telse\n\t\t\t\t\tLOG(plog::warning) << m;\n\t\t\t}\n\t\t}\n\n\t\tauto interruptRequested = false;\n\t\tvoid sigIntHandler(int s) { interruptRequested = true; }\n\n\t} \/\/ namespace\n\n\tusing namespace util::unit_literals;\n\n\tstruct Engine_event_filter : public input::Sdl_event_filter {\n\t\tEngine& _engine;\n\n\t\tEngine_event_filter(Engine& engine) : Sdl_event_filter(engine.input()), _engine(engine) {}\n\n\t\tbool propagate(SDL_Event& event) override\n\t\t{\n\t\t\tif(event.type == SDL_QUIT) {\n\t\t\t\t_engine.exit();\n\t\t\t\treturn false;\n\t\t\t} else if(event.type == SDL_KEYDOWN && event.key.keysym.sym == SDLK_F12) {\n\t\t\t\t_engine.assets().reload();\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\treturn true;\n\t\t}\n\t};\n\n\tauto get_sdl_error() -> std::string\n\t{\n\t\tstd::string sdl_error(SDL_GetError());\n\t\tSDL_ClearError();\n\t\treturn sdl_error;\n\t}\n\n\tEngine::Sdl_wrapper::Sdl_wrapper(bool headless)\n\t{\n\t\tMIRRAGE_INVARIANT(SDL_Init(0) == 0, \"Could not initialize SDL: \" << get_sdl_error());\n\n\t\tif(!headless) {\n\t\t\tinit_sub_system(SDL_INIT_VIDEO, \"SDL_Video\");\n\t\t\tinit_sub_system(SDL_INIT_JOYSTICK, \"SDL_Joystick\");\n\t\t\tinit_sub_system(SDL_INIT_HAPTIC, \"SDL_Haptic\", false);\n\t\t\tinit_sub_system(SDL_INIT_GAMECONTROLLER, \"SDL_Gamecontroller\");\n\t\t}\n\t\tinit_sub_system(SDL_INIT_EVENTS, \"SDL_Events\");\n\t}\n\tEngine::Sdl_wrapper::~Sdl_wrapper() { SDL_Quit(); }\n\n\n\tEngine::Engine(const std::string& org,\n\t               const std::string& title,\n\t               std::uint32_t      version_major,\n\t               std::uint32_t      version_minor,\n\t               bool               debug,\n\t               bool               headless,\n\t               int                argc,\n\t               char**             argv,\n\t               char**)\n\t  : _screens(*this)\n\t  , _asset_manager(std::make_unique<asset::Asset_manager>(argc > 0 ? argv[0] : \"\", org, title))\n\t  , _translator(std::make_unique<Translator>(*_asset_manager))\n\t  , _sdl(headless)\n\t  , _graphics_context(headless ? std::unique_ptr<graphic::Context>()\n\t                               : std::make_unique<graphic::Context>(\n\t                                         title,\n\t                                         graphic::make_version_number(version_major, version_minor, 0),\n\t                                         \"No Engine\",\n\t                                         graphic::make_version_number(0, 0, 0),\n\t                                         debug,\n\t                                         *_asset_manager))\n\t  , _graphics_main_window(headless ? util::nothing : _graphics_context->find_window(\"Main\"))\n\t  , _input_manager(headless ? std::unique_ptr<input::Input_manager>()\n\t                            : std::make_unique<input::Input_manager>(_bus, *_asset_manager))\n\t  , _event_filter(headless ? std::unique_ptr<Engine_event_filter>()\n\t                           : std::make_unique<Engine_event_filter>(*this))\n\t  , _net_manager(std::make_unique<net::Net_manager>())\n\t  , _current_time(SDL_GetTicks() \/ 1000.0)\n\t  , _headless(headless)\n\t{\n\t\tref_embedded_assets_mirrage();\n\n\t\t_graphics_main_window.process([&](auto& window) {\n\t\t\t_input_manager->viewport({0, 0, window.width(), window.height()});\n\t\t\t_input_manager->window(window.window_handle());\n\n\t\t\t_gui = std::make_unique<gui::Gui>(window.viewport(), *_asset_manager, *_input_manager);\n\t\t});\n\n\t\tif(headless) {\n#ifdef _WIN32\n\t\t\t\/\/ TODO\n\t\t\t(void) sigIntHandler;\n#else\n\t\t\tstruct sigaction action;\n\t\t\taction.sa_handler = sigIntHandler;\n\t\t\tsigemptyset(&action.sa_mask);\n\t\t\taction.sa_flags = 0;\n\n\t\t\tsigaction(SIGINT, &action, nullptr);\n\t\t\tsigaction(SIGTERM, &action, nullptr);\n#endif\n\t\t}\n\t}\n\n\tEngine::~Engine() noexcept\n\t{\n\t\t_screens.clear();\n\n\t\tassets().shrink_to_fit();\n\t}\n\n\tnamespace {\n\t\tfloat smooth(float curr)\n\t\t{\n\t\t\tstatic float history[11]{};\n\t\t\tstatic auto  i     = 0;\n\t\t\tstatic auto  first = true;\n\t\t\tif(first) {\n\t\t\t\tfirst = false;\n\t\t\t\tstd::fill(std::begin(history), std::end(history), 1.f \/ 60);\n\t\t\t}\n\n\t\t\tauto sum = 0.f;\n\t\t\tauto min = 999.f, max = 0.f;\n\t\t\tfor(auto v : history) {\n\t\t\t\tif(v < min) {\n\t\t\t\t\tif(min < 999.f) {\n\t\t\t\t\t\tsum += min;\n\t\t\t\t\t}\n\t\t\t\t\tmin = v;\n\t\t\t\t} else if(v > max) {\n\t\t\t\t\tsum += max;\n\t\t\t\t\tmax = v;\n\t\t\t\t} else {\n\t\t\t\t\tsum += v;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcurr = glm::mix(sum \/ 9.f, curr, 0.2f);\n\n\t\t\ti          = (i + 1) % 11;\n\t\t\thistory[i] = curr;\n\t\t\treturn curr;\n\t\t}\n\t} \/\/ namespace\n\n\tvoid Engine::on_frame()\n\t{\n\t\t_last_time               = _current_time;\n\t\t_current_time            = util::current_time_sec();\n\t\tauto delta_time          = std::max(0.f, static_cast<float>(_current_time - _last_time));\n\t\tauto delta_time_smoothed = smooth(std::min(delta_time, 1.f \/ 1));\n\n\t\tif(_graphics_main_window.is_some() && _input_manager) {\n\t\t\t_input_manager->viewport(_graphics_main_window.get_or_throw().viewport());\n\t\t}\n\n\t\t_bus.update();\n\n\t\tif(interruptRequested) {\n\t\t\tinterruptRequested = false;\n\t\t\texit();\n\t\t}\n\n\t\tif(_input_manager) {\n\t\t\t_input_manager->update(delta_time * second);\n\t\t}\n\n\t\t_on_pre_frame(delta_time_smoothed * second);\n\n\t\tif(_gui)\n\t\t\t_gui->start_frame();\n\n\t\t_screens.on_frame(delta_time_smoothed * second);\n\n\t\t_on_post_frame(delta_time_smoothed * second);\n\n\t\t_screens.do_queued_actions();\n\t}\n} \/\/ namespace mirrage\n<commit_msg>Fixed warning.<commit_after>#include <mirrage\/engine.hpp>\n\n#include <mirrage\/asset\/asset_manager.hpp>\n#include <mirrage\/graphic\/context.hpp>\n#include <mirrage\/graphic\/window.hpp>\n#include <mirrage\/gui\/gui.hpp>\n#include <mirrage\/input\/input_manager.hpp>\n#include <mirrage\/net\/net_manager.hpp>\n#include <mirrage\/translations.hpp>\n#include <mirrage\/utils\/log.hpp>\n#include <mirrage\/utils\/time.hpp>\n#include <mirrage\/utils\/units.hpp>\n\n#include <chrono>\n#include <stdexcept>\n\n#ifdef _WIN32\n\/\/ TODO\n#else\n#include <signal.h>\n#endif\n\nextern void ref_embedded_assets_mirrage();\n\nnamespace mirrage {\n\tnamespace {\n\t\tvoid init_sub_system(Uint32 f, const std::string& name, bool required = true)\n\t\t{\n\t\t\tif(SDL_InitSubSystem(f) != 0) {\n\t\t\t\tauto m = \"Could not initialize \" + name + \": \" + get_sdl_error();\n\n\t\t\t\tif(required)\n\t\t\t\t\tMIRRAGE_FAIL(m);\n\t\t\t\telse\n\t\t\t\t\tLOG(plog::warning) << m;\n\t\t\t}\n\t\t}\n\n\t\tauto interruptRequested = false;\n\t\tvoid sigIntHandler(int s) { interruptRequested = true; }\n\n\t} \/\/ namespace\n\n\tusing namespace util::unit_literals;\n\n\tstruct Engine_event_filter : public input::Sdl_event_filter {\n\t\tEngine& _engine;\n\n\t\tEngine_event_filter(Engine& engine) : Sdl_event_filter(engine.input()), _engine(engine) {}\n\n\t\tbool propagate(SDL_Event& event) override\n\t\t{\n\t\t\tif(event.type == SDL_QUIT) {\n\t\t\t\t_engine.exit();\n\t\t\t\treturn false;\n\t\t\t} else if(event.type == SDL_KEYDOWN && event.key.keysym.sym == SDLK_F12) {\n\t\t\t\t_engine.assets().reload();\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\treturn true;\n\t\t}\n\t};\n\n\tauto get_sdl_error() -> std::string\n\t{\n\t\tstd::string sdl_error(SDL_GetError());\n\t\tSDL_ClearError();\n\t\treturn sdl_error;\n\t}\n\n\tEngine::Sdl_wrapper::Sdl_wrapper(bool headless)\n\t{\n\t\tMIRRAGE_INVARIANT(SDL_Init(0) == 0, \"Could not initialize SDL: \" << get_sdl_error());\n\n\t\tif(!headless) {\n\t\t\tinit_sub_system(SDL_INIT_VIDEO, \"SDL_Video\");\n\t\t\tinit_sub_system(SDL_INIT_JOYSTICK, \"SDL_Joystick\");\n\t\t\tinit_sub_system(SDL_INIT_HAPTIC, \"SDL_Haptic\", false);\n\t\t\tinit_sub_system(SDL_INIT_GAMECONTROLLER, \"SDL_Gamecontroller\");\n\t\t}\n\t\tinit_sub_system(SDL_INIT_EVENTS, \"SDL_Events\");\n\t}\n\tEngine::Sdl_wrapper::~Sdl_wrapper() { SDL_Quit(); }\n\n\n\tEngine::Engine(const std::string& org,\n\t               const std::string& title,\n\t               std::uint32_t      version_major,\n\t               std::uint32_t      version_minor,\n\t               bool               debug,\n\t               bool               headless,\n\t               int                argc,\n\t               char**             argv,\n\t               char**)\n\t  : _screens(*this)\n\t  , _asset_manager(std::make_unique<asset::Asset_manager>(argc > 0 ? argv[0] : \"\", org, title))\n\t  , _translator(std::make_unique<Translator>(*_asset_manager))\n\t  , _sdl(headless)\n\t  , _graphics_context(headless ? std::unique_ptr<graphic::Context>()\n\t                               : std::make_unique<graphic::Context>(\n\t                                         title,\n\t                                         graphic::make_version_number(version_major, version_minor, 0),\n\t                                         \"No Engine\",\n\t                                         graphic::make_version_number(0, 0, 0),\n\t                                         debug,\n\t                                         *_asset_manager))\n\t  , _graphics_main_window(headless ? util::nothing : _graphics_context->find_window(\"Main\"))\n\t  , _input_manager(headless ? std::unique_ptr<input::Input_manager>()\n\t                            : std::make_unique<input::Input_manager>(_bus, *_asset_manager))\n\t  , _event_filter(headless ? std::unique_ptr<Engine_event_filter>()\n\t                           : std::make_unique<Engine_event_filter>(*this))\n\t  , _net_manager(std::make_unique<net::Net_manager>())\n\t  , _current_time(SDL_GetTicks() \/ 1000.0)\n\t  , _headless(headless)\n\t{\n\t\tref_embedded_assets_mirrage();\n\n\t\t_graphics_main_window.process([&](auto& window) {\n\t\t\t_input_manager->viewport({0, 0, window.width(), window.height()});\n\t\t\t_input_manager->window(window.window_handle());\n\n\t\t\t_gui = std::make_unique<gui::Gui>(window.viewport(), *_asset_manager, *_input_manager);\n\t\t});\n\n\t\tif(headless) {\n#ifdef _WIN32\n\t\t\t\/\/ TODO\n\t\t\t(void) (&sigIntHandler);\n#else\n\t\t\tstruct sigaction action;\n\t\t\taction.sa_handler = sigIntHandler;\n\t\t\tsigemptyset(&action.sa_mask);\n\t\t\taction.sa_flags = 0;\n\n\t\t\tsigaction(SIGINT, &action, nullptr);\n\t\t\tsigaction(SIGTERM, &action, nullptr);\n#endif\n\t\t}\n\t}\n\n\tEngine::~Engine() noexcept\n\t{\n\t\t_screens.clear();\n\n\t\tassets().shrink_to_fit();\n\t}\n\n\tnamespace {\n\t\tfloat smooth(float curr)\n\t\t{\n\t\t\tstatic float history[11]{};\n\t\t\tstatic auto  i     = 0;\n\t\t\tstatic auto  first = true;\n\t\t\tif(first) {\n\t\t\t\tfirst = false;\n\t\t\t\tstd::fill(std::begin(history), std::end(history), 1.f \/ 60);\n\t\t\t}\n\n\t\t\tauto sum = 0.f;\n\t\t\tauto min = 999.f, max = 0.f;\n\t\t\tfor(auto v : history) {\n\t\t\t\tif(v < min) {\n\t\t\t\t\tif(min < 999.f) {\n\t\t\t\t\t\tsum += min;\n\t\t\t\t\t}\n\t\t\t\t\tmin = v;\n\t\t\t\t} else if(v > max) {\n\t\t\t\t\tsum += max;\n\t\t\t\t\tmax = v;\n\t\t\t\t} else {\n\t\t\t\t\tsum += v;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcurr = glm::mix(sum \/ 9.f, curr, 0.2f);\n\n\t\t\ti          = (i + 1) % 11;\n\t\t\thistory[i] = curr;\n\t\t\treturn curr;\n\t\t}\n\t} \/\/ namespace\n\n\tvoid Engine::on_frame()\n\t{\n\t\t_last_time               = _current_time;\n\t\t_current_time            = util::current_time_sec();\n\t\tauto delta_time          = std::max(0.f, static_cast<float>(_current_time - _last_time));\n\t\tauto delta_time_smoothed = smooth(std::min(delta_time, 1.f \/ 1));\n\n\t\tif(_graphics_main_window.is_some() && _input_manager) {\n\t\t\t_input_manager->viewport(_graphics_main_window.get_or_throw().viewport());\n\t\t}\n\n\t\t_bus.update();\n\n\t\tif(interruptRequested) {\n\t\t\tinterruptRequested = false;\n\t\t\texit();\n\t\t}\n\n\t\tif(_input_manager) {\n\t\t\t_input_manager->update(delta_time * second);\n\t\t}\n\n\t\t_on_pre_frame(delta_time_smoothed * second);\n\n\t\tif(_gui)\n\t\t\t_gui->start_frame();\n\n\t\t_screens.on_frame(delta_time_smoothed * second);\n\n\t\t_on_post_frame(delta_time_smoothed * second);\n\n\t\t_screens.do_queued_actions();\n\t}\n} \/\/ namespace mirrage\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2007-2019 Content Management AG\n * All rights reserved.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * - Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * - Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the\n * distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE\n * FOUNDATION OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n * OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"Inline.hxx\"\n#include \"Request.hxx\"\n#include \"Error.hxx\"\n#include \"Widget.hxx\"\n#include \"Class.hxx\"\n#include \"Resolver.hxx\"\n#include \"Approval.hxx\"\n#include \"penv.hxx\"\n#include \"bp\/Global.hxx\"\n#include \"http\/HeaderUtil.hxx\"\n#include \"HttpResponseHandler.hxx\"\n#include \"strmap.hxx\"\n#include \"istream_html_escape.hxx\"\n#include \"istream\/istream.hxx\"\n#include \"istream\/ConcatIstream.hxx\"\n#include \"istream\/DelayedIstream.hxx\"\n#include \"istream\/istream_iconv.hxx\"\n#include \"istream\/istream_null.hxx\"\n#include \"istream\/istream_pause.hxx\"\n#include \"istream\/istream_string.hxx\"\n#include \"istream\/TimeoutIstream.hxx\"\n#include \"bp\/session\/Session.hxx\"\n#include \"pool\/pool.hxx\"\n#include \"event\/TimerEvent.hxx\"\n#include \"util\/Cancellable.hxx\"\n#include \"util\/StringCompare.hxx\"\n#include \"util\/StringFormat.hxx\"\n#include \"util\/Exception.hxx\"\n#include \"stopwatch.hxx\"\n\n#include <assert.h>\n\nstatic constexpr Event::Duration inline_widget_header_timeout = std::chrono::seconds(5);\nconst Event::Duration inline_widget_body_timeout = std::chrono::seconds(10);\n\nclass InlineWidget final : HttpResponseHandler, Cancellable {\n    struct pool &pool;\n    struct processor_env &env;\n    const StopwatchPtr parent_stopwatch;\n    const bool plain_text;\n    Widget &widget;\n\n    TimerEvent header_timeout_event;\n\n    DelayedIstreamControl &delayed;\n\n    CancellablePointer cancel_ptr;\n\npublic:\n    InlineWidget(struct pool &_pool, struct processor_env &_env,\n                 const StopwatchPtr &_parent_stopwatch,\n                 bool _plain_text,\n                 Widget &_widget,\n                 DelayedIstreamControl &_delayed) noexcept\n        :pool(_pool), env(_env), parent_stopwatch(_parent_stopwatch),\n         plain_text(_plain_text),\n         widget(_widget),\n         header_timeout_event(*env.event_loop,\n                              BIND_THIS_METHOD(OnHeaderTimeout)),\n         delayed(_delayed) {\n        delayed.cancel_ptr = *this;\n    }\n\n    UnusedIstreamPtr MakeResponse(UnusedIstreamPtr input) noexcept {\n        return NewTimeoutIstream(pool, std::move(input),\n                                 *env.event_loop,\n                                 inline_widget_body_timeout);\n    }\n\n    void Start() noexcept;\n\nprivate:\n    void Fail(std::exception_ptr ep) noexcept {\n        delayed.SetError(ep);\n    }\n\n    void SendRequest() noexcept;\n    void ResolverCallback() noexcept;\n\n    void OnHeaderTimeout() noexcept {\n        Cancel();\n        Fail(std::make_exception_ptr(std::runtime_error(\"Header timeout\")));\n    }\n\n    \/* virtual methods from class HttpResponseHandler *\/\n    void OnHttpResponse(http_status_t status, StringMap &&headers,\n                        UnusedIstreamPtr body) noexcept override;\n    void OnHttpError(std::exception_ptr ep) noexcept override;\n\n    \/* virtual methods from class Cancellable *\/\n    void Cancel() noexcept override;\n};\n\n\/**\n * Ensure that a widget has the correct type for embedding it into a\n * HTML\/XML document.  Returns nullptr (and closes body) if that is\n * impossible.\n *\n * Throws exception on error.\n *\/\nstatic UnusedIstreamPtr\nwidget_response_format(struct pool &pool, const Widget &widget,\n                       const StringMap &headers, UnusedIstreamPtr body,\n                       bool plain_text)\n{\n    assert(body);\n\n    const char *p = headers.Get(\"content-encoding\");\n    if (p != nullptr && strcmp(p, \"identity\") != 0)\n        throw WidgetError(widget, WidgetErrorCode::UNSUPPORTED_ENCODING,\n                          \"widget sent non-identity response, cannot embed\");\n\n    const char *content_type = headers.Get(\"content-type\");\n\n    if (plain_text) {\n        if (content_type == nullptr ||\n            !StringStartsWith(content_type, \"text\/plain\"))\n            throw WidgetError(widget, WidgetErrorCode::UNSUPPORTED_ENCODING,\n                              \"widget sent non-text\/plain response\");\n\n        return body;\n    }\n\n    if (content_type == nullptr ||\n        (!StringStartsWith(content_type, \"text\/\") &&\n         !StringStartsWith(content_type, \"application\/xml\") &&\n         !StringStartsWith(content_type, \"application\/xhtml+xml\")))\n        throw WidgetError(widget, WidgetErrorCode::UNSUPPORTED_ENCODING,\n                          \"widget sent non-text response\");\n\n    const auto charset = http_header_param(content_type, \"charset\");\n    if (!charset.IsNull() && !charset.EqualsIgnoreCase(\"utf-8\") &&\n        !charset.EqualsIgnoreCase(\"utf8\")) {\n        \/* beng-proxy expects all widgets to send their HTML code in\n           utf-8; this widget however used a different charset.\n           Automatically convert it with istream_iconv *\/\n        const char *charset2 = p_strdup(pool, charset);\n        auto ic = istream_iconv_new(pool, std::move(body), \"utf-8\", charset2);\n        if (!ic)\n            throw WidgetError(widget, WidgetErrorCode::UNSUPPORTED_ENCODING,\n                              StringFormat<64>(\"widget sent unknown charset '%s'\",\n                                               charset2));\n\n        widget.logger(6, \"charset conversion '\", charset2, \"' -> utf-8\");\n        body = std::move(ic);\n    }\n\n    if (StringStartsWith(content_type, \"text\/\") &&\n        !StringStartsWith(content_type + 5, \"html\") &&\n        !StringStartsWith(content_type + 5, \"xml\")) {\n        \/* convert text to HTML *\/\n\n        widget.logger(6, \"converting text to HTML\");\n\n        auto i = istream_html_escape_new(pool, std::move(body));\n        body = istream_cat_new(pool,\n                               istream_string_new(pool,\n                                                  \"<pre class=\\\"beng_text_widget\\\">\"),\n                               std::move(i),\n                               istream_string_new(pool, \"<\/pre>\"));\n    }\n\n    return body;\n}\n\n\/*\n * HTTP response handler\n *\n *\/\n\nvoid\nInlineWidget::OnHttpResponse(http_status_t status, StringMap &&headers,\n                             UnusedIstreamPtr body) noexcept\n{\n    header_timeout_event.Cancel();\n\n    if (!http_status_is_success(status)) {\n        \/* the HTTP status code returned by the widget server is\n           non-successful - don't embed this widget into the\n           template *\/\n        body.Clear();\n\n        WidgetError error(widget, WidgetErrorCode::UNSPECIFIED,\n                          StringFormat<64>(\"response status %d\", status));\n        Fail(std::make_exception_ptr(error));\n        return;\n    }\n\n    if (body) {\n        \/* check if the content-type is correct for embedding into\n           a template, and convert if possible *\/\n        try {\n            body = widget_response_format(pool, widget,\n                                          headers, std::move(body),\n                                          plain_text);\n        } catch (...) {\n            Fail(std::current_exception());\n            return;\n        }\n    } else\n        body = istream_null_new(pool);\n\n    delayed.Set(std::move(body));\n}\n\nvoid\nInlineWidget::OnHttpError(std::exception_ptr ep) noexcept\n{\n    header_timeout_event.Cancel();\n\n    Fail(ep);\n}\n\nvoid\nInlineWidget::Cancel() noexcept\n{\n    header_timeout_event.Cancel();\n\n    \/* make sure that all widget resources are freed when the request\n       is cancelled *\/\n    widget.Cancel();\n\n    cancel_ptr.Cancel();\n}\n\n\/*\n * internal\n *\n *\/\n\nvoid\nInlineWidget::SendRequest() noexcept\n{\n    if (!widget_check_approval(&widget)) {\n        WidgetError error(*widget.parent, WidgetErrorCode::FORBIDDEN,\n                          StringFormat<256>(\"not allowed to embed widget class '%s'\",\n                                            widget.class_name));\n        widget.Cancel();\n        Fail(std::make_exception_ptr(error));\n        return;\n    }\n\n    try {\n        widget.CheckHost(env.untrusted_host, env.site_name);\n    } catch (const std::runtime_error &e) {\n        WidgetError error(widget, WidgetErrorCode::FORBIDDEN, \"Untrusted host\");\n        widget.Cancel();\n        Fail(NestException(std::current_exception(), error));\n        return;\n    }\n\n    if (!widget.HasDefaultView()) {\n        WidgetError error(widget, WidgetErrorCode::NO_SUCH_VIEW,\n                          StringFormat<256>(\"No such view: %s\",\n                                            widget.from_template.view_name));\n        widget.Cancel();\n        Fail(std::make_exception_ptr(error));\n        return;\n    }\n\n    if (widget.session_sync_pending) {\n        auto session = env.GetRealmSession();\n        if (session)\n            widget.LoadFromSession(*session);\n        else\n            widget.session_sync_pending = false;\n    }\n\n    header_timeout_event.Schedule(inline_widget_header_timeout);\n    widget_http_request(pool, widget, env,\n                        parent_stopwatch,\n                        *this, cancel_ptr);\n}\n\n\n\/*\n * Widget resolver callback\n *\n *\/\n\nvoid\nInlineWidget::ResolverCallback() noexcept\n{\n    if (widget.cls != nullptr) {\n        SendRequest();\n    } else {\n        WidgetError error(widget, WidgetErrorCode::UNSPECIFIED,\n                          \"Failed to look up widget class\");\n        widget.Cancel();\n        Fail(std::make_exception_ptr(error));\n    }\n}\n\nvoid\nInlineWidget::Start() noexcept\n{\n    if (widget.cls == nullptr)\n        ResolveWidget(pool, widget,\n                      *global_translation_service,\n                      BIND_THIS_METHOD(ResolverCallback), cancel_ptr);\n    else\n        SendRequest();\n}\n\n\n\/*\n * Constructor\n *\n *\/\n\nUnusedIstreamPtr\nembed_inline_widget(struct pool &pool, struct processor_env &env,\n                    const StopwatchPtr &parent_stopwatch,\n                    bool plain_text,\n                    Widget &widget) noexcept\n{\n    SharedPoolPtr<PauseIstreamControl> pause;\n    if (widget.from_request.body) {\n        \/* use a \"paused\" stream, to avoid a recursion bug: when\n           somebody within this stack frame attempts to read from it,\n           and the HTTP server trips on an I\/O error, the HTTP request\n           gets cancelled, but the event cannot reach this stack\n           frame; by preventing reads on the request body, this\n           situation is avoided *\/\n        auto _pause = istream_pause_new(pool, *env.event_loop,\n                                        std::move(widget.from_request.body));\n        pause = std::move(_pause.second);\n\n        widget.from_request.body = UnusedHoldIstreamPtr(pool, std::move(_pause.first));\n    }\n\n    auto delayed = istream_delayed_new(pool, *env.event_loop);\n\n    auto iw = NewFromPool<InlineWidget>(pool, pool, env, parent_stopwatch,\n                                        plain_text, widget,\n                                        delayed.second);\n\n    UnusedHoldIstreamPtr hold(pool, iw->MakeResponse(std::move(delayed.first)));\n\n    iw->Start();\n\n    if (pause)\n        pause->Resume();\n\n    return std::move(hold);\n}\n<commit_msg>widget\/Inline: call ~InlineWidget()<commit_after>\/*\n * Copyright 2007-2019 Content Management AG\n * All rights reserved.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * - Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * - Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the\n * distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE\n * FOUNDATION OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n * OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"Inline.hxx\"\n#include \"Request.hxx\"\n#include \"Error.hxx\"\n#include \"Widget.hxx\"\n#include \"Class.hxx\"\n#include \"Resolver.hxx\"\n#include \"Approval.hxx\"\n#include \"penv.hxx\"\n#include \"bp\/Global.hxx\"\n#include \"http\/HeaderUtil.hxx\"\n#include \"HttpResponseHandler.hxx\"\n#include \"strmap.hxx\"\n#include \"istream_html_escape.hxx\"\n#include \"istream\/istream.hxx\"\n#include \"istream\/ConcatIstream.hxx\"\n#include \"istream\/DelayedIstream.hxx\"\n#include \"istream\/istream_iconv.hxx\"\n#include \"istream\/istream_null.hxx\"\n#include \"istream\/istream_pause.hxx\"\n#include \"istream\/istream_string.hxx\"\n#include \"istream\/TimeoutIstream.hxx\"\n#include \"bp\/session\/Session.hxx\"\n#include \"pool\/pool.hxx\"\n#include \"pool\/LeakDetector.hxx\"\n#include \"event\/TimerEvent.hxx\"\n#include \"util\/Cancellable.hxx\"\n#include \"util\/StringCompare.hxx\"\n#include \"util\/StringFormat.hxx\"\n#include \"util\/Exception.hxx\"\n#include \"stopwatch.hxx\"\n\n#include <assert.h>\n\nstatic constexpr Event::Duration inline_widget_header_timeout = std::chrono::seconds(5);\nconst Event::Duration inline_widget_body_timeout = std::chrono::seconds(10);\n\nclass InlineWidget final : PoolLeakDetector, HttpResponseHandler, Cancellable {\n    struct pool &pool;\n    struct processor_env &env;\n    const StopwatchPtr parent_stopwatch;\n    const bool plain_text;\n    Widget &widget;\n\n    TimerEvent header_timeout_event;\n\n    DelayedIstreamControl &delayed;\n\n    CancellablePointer cancel_ptr;\n\npublic:\n    InlineWidget(struct pool &_pool, struct processor_env &_env,\n                 const StopwatchPtr &_parent_stopwatch,\n                 bool _plain_text,\n                 Widget &_widget,\n                 DelayedIstreamControl &_delayed) noexcept\n        :PoolLeakDetector(_pool),\n         pool(_pool), env(_env), parent_stopwatch(_parent_stopwatch),\n         plain_text(_plain_text),\n         widget(_widget),\n         header_timeout_event(*env.event_loop,\n                              BIND_THIS_METHOD(OnHeaderTimeout)),\n         delayed(_delayed) {\n        delayed.cancel_ptr = *this;\n    }\n\n    UnusedIstreamPtr MakeResponse(UnusedIstreamPtr input) noexcept {\n        return NewTimeoutIstream(pool, std::move(input),\n                                 *env.event_loop,\n                                 inline_widget_body_timeout);\n    }\n\n    void Start() noexcept;\n\nprivate:\n    void Destroy() noexcept {\n        this->~InlineWidget();\n    }\n\n    void Fail(std::exception_ptr ep) noexcept {\n        auto &_delayed = delayed;\n        Destroy();\n        _delayed.SetError(ep);\n    }\n\n    void SendRequest() noexcept;\n    void ResolverCallback() noexcept;\n\n    void OnHeaderTimeout() noexcept {\n        widget.Cancel();\n        cancel_ptr.Cancel();\n        Fail(std::make_exception_ptr(std::runtime_error(\"Header timeout\")));\n    }\n\n    \/* virtual methods from class HttpResponseHandler *\/\n    void OnHttpResponse(http_status_t status, StringMap &&headers,\n                        UnusedIstreamPtr body) noexcept override;\n    void OnHttpError(std::exception_ptr ep) noexcept override;\n\n    \/* virtual methods from class Cancellable *\/\n    void Cancel() noexcept override;\n};\n\n\/**\n * Ensure that a widget has the correct type for embedding it into a\n * HTML\/XML document.  Returns nullptr (and closes body) if that is\n * impossible.\n *\n * Throws exception on error.\n *\/\nstatic UnusedIstreamPtr\nwidget_response_format(struct pool &pool, const Widget &widget,\n                       const StringMap &headers, UnusedIstreamPtr body,\n                       bool plain_text)\n{\n    assert(body);\n\n    const char *p = headers.Get(\"content-encoding\");\n    if (p != nullptr && strcmp(p, \"identity\") != 0)\n        throw WidgetError(widget, WidgetErrorCode::UNSUPPORTED_ENCODING,\n                          \"widget sent non-identity response, cannot embed\");\n\n    const char *content_type = headers.Get(\"content-type\");\n\n    if (plain_text) {\n        if (content_type == nullptr ||\n            !StringStartsWith(content_type, \"text\/plain\"))\n            throw WidgetError(widget, WidgetErrorCode::UNSUPPORTED_ENCODING,\n                              \"widget sent non-text\/plain response\");\n\n        return body;\n    }\n\n    if (content_type == nullptr ||\n        (!StringStartsWith(content_type, \"text\/\") &&\n         !StringStartsWith(content_type, \"application\/xml\") &&\n         !StringStartsWith(content_type, \"application\/xhtml+xml\")))\n        throw WidgetError(widget, WidgetErrorCode::UNSUPPORTED_ENCODING,\n                          \"widget sent non-text response\");\n\n    const auto charset = http_header_param(content_type, \"charset\");\n    if (!charset.IsNull() && !charset.EqualsIgnoreCase(\"utf-8\") &&\n        !charset.EqualsIgnoreCase(\"utf8\")) {\n        \/* beng-proxy expects all widgets to send their HTML code in\n           utf-8; this widget however used a different charset.\n           Automatically convert it with istream_iconv *\/\n        const char *charset2 = p_strdup(pool, charset);\n        auto ic = istream_iconv_new(pool, std::move(body), \"utf-8\", charset2);\n        if (!ic)\n            throw WidgetError(widget, WidgetErrorCode::UNSUPPORTED_ENCODING,\n                              StringFormat<64>(\"widget sent unknown charset '%s'\",\n                                               charset2));\n\n        widget.logger(6, \"charset conversion '\", charset2, \"' -> utf-8\");\n        body = std::move(ic);\n    }\n\n    if (StringStartsWith(content_type, \"text\/\") &&\n        !StringStartsWith(content_type + 5, \"html\") &&\n        !StringStartsWith(content_type + 5, \"xml\")) {\n        \/* convert text to HTML *\/\n\n        widget.logger(6, \"converting text to HTML\");\n\n        auto i = istream_html_escape_new(pool, std::move(body));\n        body = istream_cat_new(pool,\n                               istream_string_new(pool,\n                                                  \"<pre class=\\\"beng_text_widget\\\">\"),\n                               std::move(i),\n                               istream_string_new(pool, \"<\/pre>\"));\n    }\n\n    return body;\n}\n\n\/*\n * HTTP response handler\n *\n *\/\n\nvoid\nInlineWidget::OnHttpResponse(http_status_t status, StringMap &&headers,\n                             UnusedIstreamPtr body) noexcept\n{\n    header_timeout_event.Cancel();\n\n    if (!http_status_is_success(status)) {\n        \/* the HTTP status code returned by the widget server is\n           non-successful - don't embed this widget into the\n           template *\/\n        body.Clear();\n\n        WidgetError error(widget, WidgetErrorCode::UNSPECIFIED,\n                          StringFormat<64>(\"response status %d\", status));\n        Fail(std::make_exception_ptr(error));\n        return;\n    }\n\n    if (body) {\n        \/* check if the content-type is correct for embedding into\n           a template, and convert if possible *\/\n        try {\n            body = widget_response_format(pool, widget,\n                                          headers, std::move(body),\n                                          plain_text);\n        } catch (...) {\n            Fail(std::current_exception());\n            return;\n        }\n    } else\n        body = istream_null_new(pool);\n\n    auto &_delayed = delayed;\n    Destroy();\n    _delayed.Set(std::move(body));\n}\n\nvoid\nInlineWidget::OnHttpError(std::exception_ptr ep) noexcept\n{\n    header_timeout_event.Cancel();\n\n    Fail(ep);\n}\n\nvoid\nInlineWidget::Cancel() noexcept\n{\n    header_timeout_event.Cancel();\n\n    \/* make sure that all widget resources are freed when the request\n       is cancelled *\/\n    widget.Cancel();\n\n    cancel_ptr.Cancel();\n\n    Destroy();\n}\n\n\/*\n * internal\n *\n *\/\n\nvoid\nInlineWidget::SendRequest() noexcept\n{\n    if (!widget_check_approval(&widget)) {\n        WidgetError error(*widget.parent, WidgetErrorCode::FORBIDDEN,\n                          StringFormat<256>(\"not allowed to embed widget class '%s'\",\n                                            widget.class_name));\n        widget.Cancel();\n        Fail(std::make_exception_ptr(error));\n        return;\n    }\n\n    try {\n        widget.CheckHost(env.untrusted_host, env.site_name);\n    } catch (const std::runtime_error &e) {\n        WidgetError error(widget, WidgetErrorCode::FORBIDDEN, \"Untrusted host\");\n        widget.Cancel();\n        Fail(NestException(std::current_exception(), error));\n        return;\n    }\n\n    if (!widget.HasDefaultView()) {\n        WidgetError error(widget, WidgetErrorCode::NO_SUCH_VIEW,\n                          StringFormat<256>(\"No such view: %s\",\n                                            widget.from_template.view_name));\n        widget.Cancel();\n        Fail(std::make_exception_ptr(error));\n        return;\n    }\n\n    if (widget.session_sync_pending) {\n        auto session = env.GetRealmSession();\n        if (session)\n            widget.LoadFromSession(*session);\n        else\n            widget.session_sync_pending = false;\n    }\n\n    header_timeout_event.Schedule(inline_widget_header_timeout);\n    widget_http_request(pool, widget, env,\n                        parent_stopwatch,\n                        *this, cancel_ptr);\n}\n\n\n\/*\n * Widget resolver callback\n *\n *\/\n\nvoid\nInlineWidget::ResolverCallback() noexcept\n{\n    if (widget.cls != nullptr) {\n        SendRequest();\n    } else {\n        WidgetError error(widget, WidgetErrorCode::UNSPECIFIED,\n                          \"Failed to look up widget class\");\n        widget.Cancel();\n        Fail(std::make_exception_ptr(error));\n    }\n}\n\nvoid\nInlineWidget::Start() noexcept\n{\n    if (widget.cls == nullptr)\n        ResolveWidget(pool, widget,\n                      *global_translation_service,\n                      BIND_THIS_METHOD(ResolverCallback), cancel_ptr);\n    else\n        SendRequest();\n}\n\n\n\/*\n * Constructor\n *\n *\/\n\nUnusedIstreamPtr\nembed_inline_widget(struct pool &pool, struct processor_env &env,\n                    const StopwatchPtr &parent_stopwatch,\n                    bool plain_text,\n                    Widget &widget) noexcept\n{\n    SharedPoolPtr<PauseIstreamControl> pause;\n    if (widget.from_request.body) {\n        \/* use a \"paused\" stream, to avoid a recursion bug: when\n           somebody within this stack frame attempts to read from it,\n           and the HTTP server trips on an I\/O error, the HTTP request\n           gets cancelled, but the event cannot reach this stack\n           frame; by preventing reads on the request body, this\n           situation is avoided *\/\n        auto _pause = istream_pause_new(pool, *env.event_loop,\n                                        std::move(widget.from_request.body));\n        pause = std::move(_pause.second);\n\n        widget.from_request.body = UnusedHoldIstreamPtr(pool, std::move(_pause.first));\n    }\n\n    auto delayed = istream_delayed_new(pool, *env.event_loop);\n\n    auto iw = NewFromPool<InlineWidget>(pool, pool, env, parent_stopwatch,\n                                        plain_text, widget,\n                                        delayed.second);\n\n    UnusedHoldIstreamPtr hold(pool, iw->MakeResponse(std::move(delayed.first)));\n\n    iw->Start();\n\n    if (pause)\n        pause->Resume();\n\n    return std::move(hold);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: EnvStack.tester.cxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: obo $ $Date: 2007-07-18 12:23: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 <iostream>\n\n#include \"sal\/main.h\"\n\n#include \"uno\/lbnames.h\"\n#include \"uno\/environment.hxx\"\n#include \"cppu\/EnvDcp.hxx\"\n\n#ifndef _COM_SUN_STAR_UNO_EXCEPTION_HPP_\n#include <com\/sun\/star\/uno\/Exception.hpp>\n#endif\n\n\n#define CPPU_test_EnvStack_tester_IMPL\n#include \"EnvStack.tester.hxx\"\n\n\nusing namespace com::sun::star;\n\n\nstatic rtl::OUString s_getCurrentEnvDcp(void)\n{\n    uno::Environment env(uno::Environment::getCurrent());\n    rtl::OUString env_dcp(env.getTypeName());\n\n    return env_dcp;\n}\n\nextern \"C\" { static void s_getCurrentEnvDcp_v(va_list * pParam)\n{\n    rtl_uString ** ppEnvDcp  = va_arg(*pParam, rtl_uString **);\n\n    rtl::OUString env_dcp(s_getCurrentEnvDcp());\n\n    rtl_uString_assign(ppEnvDcp, env_dcp.pData);\n}}\n\nstatic rtl::OUString s_test__uno_Environment_invoke(rtl::OUString const & src_purpose,\n                                                    rtl::OUString const & dst_purpose,\n                                                    rtl::OUString const & ref)\n{\n    rtl::OUString result;\n    rtl::OUString target_envDcp;\n\n    rtl::OUString src_envDcp(RTL_CONSTASCII_USTRINGPARAM(UNO_LB_UNO));\n    src_envDcp += src_purpose;\n\n    rtl::OUString dst_envDcp(RTL_CONSTASCII_USTRINGPARAM(UNO_LB_UNO));\n    dst_envDcp += dst_purpose;\n\n    uno::Environment cur_Env(src_envDcp.pData, NULL);\n    uno_Environment_enter(cur_Env.get());\n    cur_Env.clear();\n\n    uno::Environment dst_Env(dst_envDcp.pData, NULL);\n    uno_Environment_invoke(dst_Env.get(), s_getCurrentEnvDcp_v, &target_envDcp.pData);\n    dst_Env.clear();\n\n    uno_Environment_enter(NULL);\n\n\n    if (cppu::EnvDcp::getPurpose(target_envDcp).equals(dst_purpose)\n        && g_commentStack.equals(ref))\n        result += rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\" PASSED\\n\"));\n\n    else\n    {\n        result += rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\" FAILED -> \"));\n        result += target_envDcp;\n        result += rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"\\n\"));\n        result += rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"\\t\\texpected: \\\"\"));\n        result += ref;\n        result += rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"\\\"\\n\"));\n        result += rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"\\t\\tgot:      \\\"\"));\n        result += g_commentStack;\n        result += rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"\\\"\\n\"));\n    }\n\n\n\n    return result;\n}\n\nstatic rtl::OUString s_test__uno_Environment_invoke_v(va_list param)\n{\n    rtl::OUString const * pSrc_purpose = va_arg(param, rtl::OUString const *);\n    rtl::OUString const * pDst_purpose = va_arg(param, rtl::OUString const *);\n    rtl::OUString const * pRef         = va_arg(param, rtl::OUString  const *);\n\n\n    rtl::OUString result;\n\n    result += rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"s_test__uno_Environment_invoke_v\"));\n    result += rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\" - \\\"\"));\n    result += *pSrc_purpose;\n    result += rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"\\\" -> \\\"\"));\n    result += *pDst_purpose;\n    result += rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"\\\"\"));\n\n    result += s_test__uno_Environment_invoke(*pSrc_purpose, *pDst_purpose, *pRef);\n\n    return result;\n}\n\nstatic rtl::OUString s_do_a_test(rtl::OUString (* pTest)(va_list), ...)\n{\n    rtl::OUString result;\n\n    va_list param;\n\n    va_start(param, pTest);\n    try {\n        result += pTest(param);\n    }\n    catch (uno::Exception & exception)\n    {\n        result += rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\" FAILED with exception: \"));\n        result += exception.Message;\n        result += rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"\\n\"));\n    }\n    va_end(param);\n\n    return result;\n}\n\nSAL_IMPLEMENT_MAIN_WITH_ARGS(argc, argv)\n{\n    int result = 0;\n    rtl::OString message;\n\n    if (argc >= 4 && argc <= 5)\n    {\n        rtl::OUString src_purpose(argv[1], rtl_str_getLength(argv[1]), RTL_TEXTENCODING_ASCII_US);\n        rtl::OUString dst_purpose(argv[2], rtl_str_getLength(argv[2]), RTL_TEXTENCODING_ASCII_US);\n        rtl::OUString ref        (argv[3], rtl_str_getLength(argv[3]), RTL_TEXTENCODING_ASCII_US);\n\n        if (argc == 5)\n        {\n            rtl::OUString test_env(RTL_CONSTASCII_USTRINGPARAM(UNO_LB_UNO));\n            test_env += rtl::OUString(argv[4], rtl_str_getLength(argv[4]), RTL_TEXTENCODING_ASCII_US);\n            g_env = uno::Environment(test_env);\n        }\n\n\n        message += rtl::OUStringToOString(\n            s_do_a_test(s_test__uno_Environment_invoke_v, &src_purpose, &dst_purpose, &ref),\n            RTL_TEXTENCODING_ASCII_US);\n\n\n        if (g_env.is())\n            g_env.clear();\n\n\n        if (message.indexOf(rtl::OString(\"FAILED\")) == -1)\n            message += rtl::OString(\"TESTS PASSED\\n\");\n\n        else\n        {\n            message += rtl::OString(\"TESTS _NOT_ PASSED\\n\");\n            result = -1;\n        }\n    }\n    else\n    {\n        message = \"usage: EnvStack.tester <source purpose>\"\n            \" <destination purpose>\"\n            \" <reference string>\"\n            \" [<reference environment>]\\n\\n\";\n    }\n\n    std::cout << message.getStr();\n\n\n    return result;\n}\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.3.34); FILE MERGED 2008\/04\/01 12:28:03 thb 1.3.34.2: #i85898# Stripping all external header guards 2008\/03\/31 07:23:25 rt 1.3.34.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: EnvStack.tester.cxx,v $\n * $Revision: 1.4 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org.  If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#include <iostream>\n\n#include \"sal\/main.h\"\n\n#include \"uno\/lbnames.h\"\n#include \"uno\/environment.hxx\"\n#include \"cppu\/EnvDcp.hxx\"\n#include <com\/sun\/star\/uno\/Exception.hpp>\n\n\n#define CPPU_test_EnvStack_tester_IMPL\n#include \"EnvStack.tester.hxx\"\n\n\nusing namespace com::sun::star;\n\n\nstatic rtl::OUString s_getCurrentEnvDcp(void)\n{\n    uno::Environment env(uno::Environment::getCurrent());\n    rtl::OUString env_dcp(env.getTypeName());\n\n    return env_dcp;\n}\n\nextern \"C\" { static void s_getCurrentEnvDcp_v(va_list * pParam)\n{\n    rtl_uString ** ppEnvDcp  = va_arg(*pParam, rtl_uString **);\n\n    rtl::OUString env_dcp(s_getCurrentEnvDcp());\n\n    rtl_uString_assign(ppEnvDcp, env_dcp.pData);\n}}\n\nstatic rtl::OUString s_test__uno_Environment_invoke(rtl::OUString const & src_purpose,\n                                                    rtl::OUString const & dst_purpose,\n                                                    rtl::OUString const & ref)\n{\n    rtl::OUString result;\n    rtl::OUString target_envDcp;\n\n    rtl::OUString src_envDcp(RTL_CONSTASCII_USTRINGPARAM(UNO_LB_UNO));\n    src_envDcp += src_purpose;\n\n    rtl::OUString dst_envDcp(RTL_CONSTASCII_USTRINGPARAM(UNO_LB_UNO));\n    dst_envDcp += dst_purpose;\n\n    uno::Environment cur_Env(src_envDcp.pData, NULL);\n    uno_Environment_enter(cur_Env.get());\n    cur_Env.clear();\n\n    uno::Environment dst_Env(dst_envDcp.pData, NULL);\n    uno_Environment_invoke(dst_Env.get(), s_getCurrentEnvDcp_v, &target_envDcp.pData);\n    dst_Env.clear();\n\n    uno_Environment_enter(NULL);\n\n\n    if (cppu::EnvDcp::getPurpose(target_envDcp).equals(dst_purpose)\n        && g_commentStack.equals(ref))\n        result += rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\" PASSED\\n\"));\n\n    else\n    {\n        result += rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\" FAILED -> \"));\n        result += target_envDcp;\n        result += rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"\\n\"));\n        result += rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"\\t\\texpected: \\\"\"));\n        result += ref;\n        result += rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"\\\"\\n\"));\n        result += rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"\\t\\tgot:      \\\"\"));\n        result += g_commentStack;\n        result += rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"\\\"\\n\"));\n    }\n\n\n\n    return result;\n}\n\nstatic rtl::OUString s_test__uno_Environment_invoke_v(va_list param)\n{\n    rtl::OUString const * pSrc_purpose = va_arg(param, rtl::OUString const *);\n    rtl::OUString const * pDst_purpose = va_arg(param, rtl::OUString const *);\n    rtl::OUString const * pRef         = va_arg(param, rtl::OUString  const *);\n\n\n    rtl::OUString result;\n\n    result += rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"s_test__uno_Environment_invoke_v\"));\n    result += rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\" - \\\"\"));\n    result += *pSrc_purpose;\n    result += rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"\\\" -> \\\"\"));\n    result += *pDst_purpose;\n    result += rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"\\\"\"));\n\n    result += s_test__uno_Environment_invoke(*pSrc_purpose, *pDst_purpose, *pRef);\n\n    return result;\n}\n\nstatic rtl::OUString s_do_a_test(rtl::OUString (* pTest)(va_list), ...)\n{\n    rtl::OUString result;\n\n    va_list param;\n\n    va_start(param, pTest);\n    try {\n        result += pTest(param);\n    }\n    catch (uno::Exception & exception)\n    {\n        result += rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\" FAILED with exception: \"));\n        result += exception.Message;\n        result += rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"\\n\"));\n    }\n    va_end(param);\n\n    return result;\n}\n\nSAL_IMPLEMENT_MAIN_WITH_ARGS(argc, argv)\n{\n    int result = 0;\n    rtl::OString message;\n\n    if (argc >= 4 && argc <= 5)\n    {\n        rtl::OUString src_purpose(argv[1], rtl_str_getLength(argv[1]), RTL_TEXTENCODING_ASCII_US);\n        rtl::OUString dst_purpose(argv[2], rtl_str_getLength(argv[2]), RTL_TEXTENCODING_ASCII_US);\n        rtl::OUString ref        (argv[3], rtl_str_getLength(argv[3]), RTL_TEXTENCODING_ASCII_US);\n\n        if (argc == 5)\n        {\n            rtl::OUString test_env(RTL_CONSTASCII_USTRINGPARAM(UNO_LB_UNO));\n            test_env += rtl::OUString(argv[4], rtl_str_getLength(argv[4]), RTL_TEXTENCODING_ASCII_US);\n            g_env = uno::Environment(test_env);\n        }\n\n\n        message += rtl::OUStringToOString(\n            s_do_a_test(s_test__uno_Environment_invoke_v, &src_purpose, &dst_purpose, &ref),\n            RTL_TEXTENCODING_ASCII_US);\n\n\n        if (g_env.is())\n            g_env.clear();\n\n\n        if (message.indexOf(rtl::OString(\"FAILED\")) == -1)\n            message += rtl::OString(\"TESTS PASSED\\n\");\n\n        else\n        {\n            message += rtl::OString(\"TESTS _NOT_ PASSED\\n\");\n            result = -1;\n        }\n    }\n    else\n    {\n        message = \"usage: EnvStack.tester <source purpose>\"\n            \" <destination purpose>\"\n            \" <reference string>\"\n            \" [<reference environment>]\\n\\n\";\n    }\n\n    std::cout << message.getStr();\n\n\n    return result;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"mjolnir\/graphtilebuilder.h\"\n\nusing namespace valhalla::baldr;\n\nnamespace valhalla {\nnamespace mjolnir {\n\nGraphTileBuilder::GraphTileBuilder() {\n\n}\n\n\/\/ Output the tile to file. Stores as binary data.\n\nbool GraphTileBuilder::StoreTileData(const std::string& basedirectory,\n                                     const GraphId& graphid) {\n  \/\/ Open to the end of the file so we can immediately get size;\n  std::ofstream file(Filename(basedirectory, graphid),\n                     std::ios::out | std::ios::binary | std::ios::ate);\n  if (file.is_open()) {\n    \/\/ Write the header\n    file.write(reinterpret_cast<const char*>(&header_), sizeof header_);\n\n    \/\/ Write the nodes\n    file.write(reinterpret_cast<const char*>(&nodes_builder_[0]),\n               nodes_builder_.size() * sizeof(NodeInfoBuilder));\n\n    \/\/ Write the directed edges\n    file.write(reinterpret_cast<const char*>(&directededges_builder_[0]),\n               directededges_builder_.size() * sizeof(DirectedEdgeBuilder));\n\n    \/\/ Write the edge data\n\n    \/\/ Write the names\n\n    std::cout << \"Write: \" << Filename(basedirectory, graphid) << \" nodes = \"\n              << nodes_builder_.size() << \" directededges = \"\n              << directededges_builder_.size() << std::endl;\n\n    file.close();\n    return true;\n  } else {\n    std::cout << \"Failed to open file \" << Filename(basedirectory, graphid)\n              << std::endl;\n  }\n  return false;\n}\n\nbool GraphTileBuilder::AddNodeAndEdges(\n    const NodeInfoBuilder& node,\n    const std::vector<DirectedEdgeBuilder>& directededges,\n    const std::vector<EdgeInfoBuilder>& edges) {\n\/\/           const std::vector<std::string>& names) {\n  \/\/ Add the node to the list\n  nodes_builder_.push_back(node);\n\n  \/\/ For each directed edge need to set its common edge offset\n  for (auto directededge : directededges) {\n    \/\/ Add the directed edge to the list\n    directededges_builder_.push_back(directededge);\n  }\n\n  \/\/ TODO - change to move?\n  if (!edges.empty()) {\n    edgeinfo_builder_.insert(edgeinfo_builder_.end(), edges.begin(),\n                             edges.end());\n  }\n\n  return true;\n}\n\/*\n unsigned int GraphTileBuilder::StoreEdgeInfo(const EdgeInfoBuilder& edge) {\n \/\/ TODO\n return 0;\n\n }\n **\/\n\n}\n}\n\n<commit_msg>Write the node and directed edge counts and make sure the builder and correct size of hte header are built<commit_after>#include \"mjolnir\/graphtilebuilder.h\"\n\nusing namespace valhalla::baldr;\n\nnamespace valhalla {\nnamespace mjolnir {\n\nGraphTileBuilder::GraphTileBuilder() {\n\n}\n\n\/\/ Output the tile to file. Stores as binary data.\n\nbool GraphTileBuilder::StoreTileData(const std::string& basedirectory,\n                                     const GraphId& graphid) {\n  \/\/ Open to the end of the file so we can immediately get size;\n  std::ofstream file(Filename(basedirectory, graphid),\n                     std::ios::out | std::ios::binary | std::ios::ate);\n  if (file.is_open()) {\n    \/\/ Write the header. TODO - add edge info offset and name list offset\n    header_builder_.set_nodecount(nodes_builder_.size());\n    header_builder_.set_directededgecount(directededges_builder_.size());\n    file.write(reinterpret_cast<const char*>(&header_builder_),\n               sizeof header_builder_);\n\n    \/\/ Write the nodes\n    file.write(reinterpret_cast<const char*>(&nodes_builder_[0]),\n               nodes_builder_.size() * sizeof(NodeInfoBuilder));\n\n    \/\/ Write the directed edges\n    file.write(reinterpret_cast<const char*>(&directededges_builder_[0]),\n               directededges_builder_.size() * sizeof(DirectedEdgeBuilder));\n\n    \/\/ Write the edge data\n\n    \/\/ Write the names\n    std::cout << \"Write: \" << Filename(basedirectory, graphid) << \" nodes = \"\n              << nodes_builder_.size() << \" directededges = \"\n              << directededges_builder_.size() << std::endl;\n\n    file.close();\n    return true;\n  } else {\n    std::cout << \"Failed to open file \" << Filename(basedirectory, graphid)\n              << std::endl;\n  }\n  return false;\n}\n\nbool GraphTileBuilder::AddNodeAndEdges(\n    const NodeInfoBuilder& node,\n    const std::vector<DirectedEdgeBuilder>& directededges,\n    const std::vector<EdgeInfoBuilder>& edges) {\n\/\/           const std::vector<std::string>& names) {\n  \/\/ Add the node to the list\n  nodes_builder_.push_back(node);\n\n  \/\/ For each directed edge need to set its common edge offset\n  for (auto directededge : directededges) {\n    \/\/ Add the directed edge to the list\n    directededges_builder_.push_back(directededge);\n  }\n\n  \/\/ TODO - change to move?\n  if (!edges.empty()) {\n    edgeinfo_builder_.insert(edgeinfo_builder_.end(), edges.begin(),\n                             edges.end());\n  }\n\n  return true;\n}\n\/*\n unsigned int GraphTileBuilder::StoreEdgeInfo(const EdgeInfoBuilder& edge) {\n \/\/ TODO\n return 0;\n\n }\n **\/\n\n}\n}\n\n<|endoftext|>"}
{"text":"<commit_before>{\n  TProof::Open(\"pod:\/\/\");\n  if (!gProof) return;\n\n  TDSet *manual_dset = new TDSet(\"TTree\", \"deuterons\");\n  TString user[3] = {\"m\/mpuccio\",\"m\/masera\",\"s\/sbufalin\"};\n  for (int i = 0; i < 3; ++i)\n  {\n    TString ddset = Form(\"Find;BasePath=\/alice\/cern.ch\/user\/%s\/NucleiPbPb2011test\/output;FileName=*\/root_archive.zip;Anchor=mpuccio_Flowdnt.root;Tree=\/deuterons;Mode=local\",user[i].Data());\n\n    TFileCollection *fc = gProof->GetDataSet(ddset.Data());\n\n  \/\/ Create TDSet manually (terrible hack): apparently PROOF is stupid\n  \/\/ and cannot create it correctly\n    TFileInfo *fi;\n    TIter next( fc->GetList() );\n    while (( fi = (TFileInfo *)next() )) {\n      const char *fn = fi->GetCurrentUrl()->GetUrl();\n      Printf(\"adding: %s\", fn);\n      manual_dset->Add( fn );\n    }\n  }\n\n  const double kCent[5] = {0.,10.,20.,40.,60.};\n  const double kBins[29] = {\n    0.4f,0.5f,0.6f,0.7f,0.8f,0.9f,1.0f,1.1f,1.2f,1.4f,\n    1.6f,1.8f,2.0f,2.2f,2.4f,2.6f,2.8f,3.0f,3.2f,3.4f,\n    3.6f,3.8f,4.0f,4.2f,4.4f,5.0f,6.0f,8.0f,10.f\n  };\n  TH2F *hBins = new TH2F(\"hBins\",\"hBins\",4,kCent,28,kBins);\n  TH1D *hCuts = new TH1D(\"hCuts\",\"hCuts\",9,0,9);\n  enum cutsName {kEtaMin=1,kEtaMax,kYMin,kYMax,kTPCsig,kTPCchi2,kSPDrec,kDCAxy,kDCAz};\n  double cutsA[9] = {-0.8,0.8,-0.5,0.5,70,4.,1,0.5,1};\n  for (int i = 1; i < 10; ++i) {\n    hCuts->SetBinContent(i,cutsA[i - 1]);\n  }\n  gProof->AddInput(hBins);\n  gProof->AddInput(hCuts);\n  \n  \/\/ Process the TDset\n  gProof->Process(manual_dset, \"AODSelector.cxx+g\");\n\n}\n<commit_msg>Ready to test with more cuts<commit_after>{\n  TProof::Open(\"pod:\/\/\");\n  if (!gProof) return;\n\n  TDSet *manual_dset = new TDSet(\"TTree\", \"deuterons\");\n  TString user[3] = {\"m\/mpuccio\",\"m\/masera\",\"s\/sbufalin\"};\n  for (int i = 0; i < 3; ++i)\n  {\n    TString ddset = Form(\"Find;BasePath=\/alice\/cern.ch\/user\/%s\/NucleiPbPb2011test\/output;FileName=*\/root_archive.zip;Anchor=mpuccio_Flowdnt.root;Tree=\/deuterons;Mode=local\",user[i].Data());\n\n    TFileCollection *fc = gProof->GetDataSet(ddset.Data());\n\n  \/\/ Create TDSet manually (terrible hack): apparently PROOF is stupid\n  \/\/ and cannot create it correctly\n    TFileInfo *fi;\n    TIter next( fc->GetList() );\n    while (( fi = (TFileInfo *)next() )) {\n      const char *fn = fi->GetCurrentUrl()->GetUrl();\n      Printf(\"adding: %s\", fn);\n      manual_dset->Add( fn );\n    }\n  }\n\n  const double kCent[4] = {0.,10.,30.,50.};\n  const double kBins[29] = {\n    0.4f,0.5f,0.6f,0.7f,0.8f,0.9f,1.0f,1.1f,1.2f,1.4f,\n    1.6f,1.8f,2.0f,2.2f,2.4f,2.6f,2.8f,3.0f,3.2f,3.4f,\n    3.6f,3.8f,4.0f,4.2f,4.4f,5.0f,6.0f,8.0f,10.f\n  };\n  TH2F *hBins = new TH2F(\"hBins\",\"hBins\",4,kCent,28,kBins);\n  TH1D *hCuts = new TH1D(\"hCuts\",\"hCuts\",10,0,10);\n  TNamed *taskTitle = new TNamed(\"taskName\",\"deuteron3cent\");\n  enum cutsName {kEtaMin=1,kEtaMax,kYMin,kYMax,kTPCsig,kTPCchi2,kSPDrec,kDCAxy,kDCAz,kRecreate};\n  double cutsA[10] = {-0.8,0.8,-0.5,0.5,70,4.,1,0.5,1,1};\n  for (int i = 1; i < 11; ++i) {\n    hCuts->SetBinContent(i,cutsA[i - 1]);\n  }\n  gProof->AddInput(hBins);\n  gProof->AddInput(hCuts);\n  gProof->AddInput(taskTitle);\n  \n  \/\/ Process the TDset\n  gProof->Process(manual_dset, \"AODSelector.cxx+g\");\n  \n  \/\/ Other cuts\n  hCuts->SetBinContent(10,0.);\n  hCuts->SetBinContent(5,60);\n  taskTitle.SetTitle(\"deuteron3cent_chi0\");\n  gProof->Process(manual_dset, \"AODSelector.cxx+g\");\n\n\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>removed the .hpp test file<commit_after><|endoftext|>"}
{"text":"<commit_before>\/**\n * @file lrsdp_test.cpp\n * @author Ryan Curtin\n *\n * Tests for LR-SDP (core\/optimizers\/lrsdp\/).\n *\/\n#include <mlpack\/core.hpp>\n#include <mlpack\/core\/optimizers\/lrsdp\/lrsdp.hpp>\n\n#include <boost\/test\/unit_test.hpp>\n\nusing namespace mlpack;\nusing namespace mlpack::optimization;\n\nBOOST_AUTO_TEST_SUITE(LRSDPTest);\n\n\/**\n * Extremely simple test case for the Lovasz-Theta semidefinite program.\n *\nBOOST_AUTO_TEST_CASE(ExtremelySimpleLovaszThetaSDP)\n{\n  \/\/ Manually create the LRSDP object and set its constraints.\n  LRSDP lovasz;\n\n  \/\/ C = -(e e^T) = -ones().\n  lovasz.C().ones(2, 2);\n  lovasz.C() *= -1;\n\n  \/\/ b_0 = 1; b_1 = 0.\n  lovasz.B().zeros(2);\n  lovasz.B()[0] = 1;\n\n  \/\/ A_0 = I_n.\n  lovasz.A().push_back(arma::eye<arma::mat>(2, 2));\n\n  \/\/ A_1 = 1 - I_n.\n  lovasz.A().push_back(1 - arma::eye<arma::mat>(2, 2));\n\n  \/\/ Now generate the initial point.\n  arma::mat coordinates(2, 2);\n\n  double r = 0.5 + sqrt(4.25); \/\/ 2 constraints.\n\n  coordinates(0, 0) = sqrt(1.0 \/ r) + sqrt(0.25);\n  coordinates(0, 1) = sqrt(0.25);\n  coordinates(1, 0) = sqrt(0.25);\n  coordinates(1, 1) = sqrt(1.0 \/ r) + sqrt(0.25);\n\n  \/\/ Now that we have an initial point, run the optimization.\n  double finalValue = lovasz.Optimize(coordinates);\n\n  arma::mat x = coordinates * trans(coordinates);\n\n  BOOST_REQUIRE_CLOSE(finalValue, -1.0, 1e-5);\n\n  BOOST_REQUIRE_CLOSE(x(0, 0) + x(1, 1), 1.0, 1e-5);\n  BOOST_REQUIRE_SMALL(x(0, 1), 1e-8);\n  BOOST_REQUIRE_SMALL(x(1, 0), 1e-8);\n}*\/\n\n\/**\n * johnson8-4-4.co test case for Lovasz-Theta LRSDP.\n * See Monteiro and Burer 2004.\n *\/\nBOOST_AUTO_TEST_CASE(Johnson844LovaszThetaSDP)\n{\n  \/\/ Load the edges.\n  arma::mat edges;\n  data::Load(\"johnson8-4-4.csv\", edges, true);\n\n  const size_t vertices = max(max(edges)) + 1;\n\n  const size_t m = edges.n_cols + 1;\n  float r = 0.5 + sqrt(0.25 + 2 * m);\n  if (ceil(r) > vertices)\n    r = vertices; \/\/ An upper bound on the dimension.\n\n  arma::mat coordinates(vertices, ceil(r));\n\n  \/\/ Now we set the entries of the initial matrix according to the formula given\n  \/\/ in Section 4 of Monteiro and Burer.\n  for (size_t i = 0; i < vertices; ++i)\n  {\n    for (size_t j = 0; j < ceil(r); ++j)\n    {\n      if (i == j)\n        coordinates(i, j) = sqrt(1.0 \/ r) + sqrt(1.0 \/ (vertices * m));\n      else\n        coordinates(i, j) = sqrt(1.0 \/ (vertices * m));\n    }\n  }\n\n  LRSDP lovasz;\n\n  \/\/ C = -(e e^T) = -ones().\n  lovasz.C().ones(vertices, vertices);\n  lovasz.C() *= -1;\n\n  \/\/ b_0 = 1; else = 0.\n  lovasz.B().zeros(edges.n_cols);\n  lovasz.B()[0] = 1;\n\n  \/\/ A_0 = I_n.\n  lovasz.A().push_back(arma::eye<arma::mat>(vertices, vertices));\n\n  \/\/ A_ij only has ones at (i, j) and (j, i) and 1 elsewhere.\n  for (size_t i = 0; i < edges.n_cols; ++i)\n  {\n    arma::mat a;\n    a.zeros(vertices, vertices);\n\n    a(edges(0, i), edges(1, i)) = 1;\n    a(edges(1, i), edges(0, i)) = 1;\n\n    lovasz.A().push_back(a);\n  }\n\n  double finalValue = lovasz.Optimize(coordinates);\n\n  BOOST_REQUIRE_CLOSE(finalValue, -14.0, 1e-5);\n}\n\nBOOST_AUTO_TEST_SUITE_END();\n<commit_msg>Add tests for two other Lovasz-Theta problems.  hamming6-4 isn't converging right, and keller4 is working, but takes 5 minutes.  Perhaps johnson8-4-4 will be the only test case we use in the long run.<commit_after>\/**\n * @file lrsdp_test.cpp\n * @author Ryan Curtin\n *\n * Tests for LR-SDP (core\/optimizers\/lrsdp\/).\n *\/\n#include <mlpack\/core.hpp>\n#include <mlpack\/core\/optimizers\/lrsdp\/lrsdp.hpp>\n\n#include <boost\/test\/unit_test.hpp>\n\nusing namespace mlpack;\nusing namespace mlpack::optimization;\n\nBOOST_AUTO_TEST_SUITE(LRSDPTest);\n\n\/**\n * Extremely simple test case for the Lovasz-Theta semidefinite program.\n *\nBOOST_AUTO_TEST_CASE(ExtremelySimpleLovaszThetaSDP)\n{\n  \/\/ Manually create the LRSDP object and set its constraints.\n  LRSDP lovasz;\n\n  \/\/ C = -(e e^T) = -ones().\n  lovasz.C().ones(2, 2);\n  lovasz.C() *= -1;\n\n  \/\/ b_0 = 1; b_1 = 0.\n  lovasz.B().zeros(2);\n  lovasz.B()[0] = 1;\n\n  \/\/ A_0 = I_n.\n  lovasz.A().push_back(arma::eye<arma::mat>(2, 2));\n\n  \/\/ A_1 = 1 - I_n.\n  lovasz.A().push_back(1 - arma::eye<arma::mat>(2, 2));\n\n  \/\/ Now generate the initial point.\n  arma::mat coordinates(2, 2);\n\n  double r = 0.5 + sqrt(4.25); \/\/ 2 constraints.\n\n  coordinates(0, 0) = sqrt(1.0 \/ r) + sqrt(0.25);\n  coordinates(0, 1) = sqrt(0.25);\n  coordinates(1, 0) = sqrt(0.25);\n  coordinates(1, 1) = sqrt(1.0 \/ r) + sqrt(0.25);\n\n  \/\/ Now that we have an initial point, run the optimization.\n  double finalValue = lovasz.Optimize(coordinates);\n\n  arma::mat x = coordinates * trans(coordinates);\n\n  BOOST_REQUIRE_CLOSE(finalValue, -1.0, 1e-5);\n\n  BOOST_REQUIRE_CLOSE(x(0, 0) + x(1, 1), 1.0, 1e-5);\n  BOOST_REQUIRE_SMALL(x(0, 1), 1e-8);\n  BOOST_REQUIRE_SMALL(x(1, 0), 1e-8);\n}*\/\n\n\/**\n * Prepare an LRSDP object to solve the Lovasz-Theta SDP in the manner detailed\n * in Monteiro + Burer 2004.  The list of edges in the graph must be given; that\n * is all that is necessary to set up the problem.  A matrix which will contain\n * initial point coordinates should be given also.\n *\/\nvoid setupLovaszTheta(const arma::mat& edges,\n                      LRSDP& lovasz,\n                      arma::mat& coordinates)\n{\n  \/\/ Get the number of vertices in the problem.\n  const size_t vertices = max(max(edges)) + 1;\n\n  const size_t m = edges.n_cols + 1;\n  float r = 0.5 + sqrt(0.25 + 2 * m);\n  if (ceil(r) > vertices)\n    r = vertices; \/\/ An upper bound on the dimension.\n\n  coordinates.set_size(vertices, ceil(r));\n\n  \/\/ Now we set the entries of the initial matrix according to the formula given\n  \/\/ in Section 4 of Monteiro and Burer.\n  for (size_t i = 0; i < vertices; ++i)\n  {\n    for (size_t j = 0; j < ceil(r); ++j)\n    {\n      if (i == j)\n        coordinates(i, j) = sqrt(1.0 \/ r) + sqrt(1.0 \/ (vertices * m));\n      else\n        coordinates(i, j) = sqrt(1.0 \/ (vertices * m));\n    }\n  }\n\n  lovasz = LRSDP(coordinates);\n\n  \/\/ C = -(e e^T) = -ones().\n  lovasz.C().ones(vertices, vertices);\n  lovasz.C() *= -1;\n\n  \/\/ b_0 = 1; else = 0.\n  lovasz.B().zeros(edges.n_cols);\n  lovasz.B()[0] = 1;\n\n  \/\/ All of the matrices will just contain coordinates because they are\n  \/\/ super-sparse (two entries each).  Except for A_0, which is I_n.\n  lovasz.AModes().ones(edges.n_cols);\n  lovasz.AModes()[0] = 0;\n\n  \/\/ A_0 = I_n.\n  lovasz.A().push_back(arma::eye<arma::mat>(vertices, vertices));\n\n  \/\/ A_ij only has ones at (i, j) and (j, i) and 1 elsewhere.\n  for (size_t i = 0; i < edges.n_cols; ++i)\n  {\n    arma::mat a(2, 2);\n\n    a(0, 0) = edges(0, i);\n    a(1, 0) = edges(1, i);\n    a(0, 1) = edges(1, i);\n    a(1, 1) = edges(0, i);\n\n    lovasz.A().push_back(a);\n  }\n}\n\n\/**\n * johnson8-4-4.co test case for Lovasz-Theta LRSDP.\n * See Monteiro and Burer 2004.\n *\/\nBOOST_AUTO_TEST_CASE(Johnson844LovaszThetaSDP)\n{\n  \/\/ Load the edges.\n  arma::mat edges;\n  data::Load(\"johnson8-4-4.csv\", edges, true);\n\n  \/\/ The LRSDP itself and the initial point.\n  arma::mat coordinates;\n  LRSDP lovasz;\n\n  setupLovaszTheta(edges, lovasz, coordinates);\n\n  double finalValue = lovasz.Optimize(coordinates);\n\n  \/\/ Final value taken from Monteiro + Burer 2004.\n  BOOST_REQUIRE_CLOSE(finalValue, -14.0, 1e-5);\n\n  \/\/ Now ensure that all the constraints are satisfied.\n  arma::mat rrt = coordinates * trans(coordinates);\n  BOOST_REQUIRE_CLOSE(trace(rrt), 1.0, 1e-5);\n\n  \/\/ All those edge constraints...\n  for (size_t i = 0; i < edges.n_cols; ++i)\n  {\n    BOOST_REQUIRE_SMALL(rrt(edges(0, i), edges(1, i)), 1e-5);\n    BOOST_REQUIRE_SMALL(rrt(edges(1, i), edges(0, i)), 1e-5);\n  }\n}\n\n\/**\n * hamming6-4.co test case for Lovasz-Theta LRSDP.\n * See Monteiro and Burer 2004.\n *\nBOOST_AUTO_TEST_CASE(Hamming64LovaszThetaSDP)\n{\n  \/\/ Load the edges.\n  arma::mat edges;\n  data::Load(\"hamming6-4.csv\", edges, true);\n\n  \/\/ The LRSDP itself and the initial point.\n  arma::mat coordinates;\n  LRSDP lovasz;\n\n  setupLovaszTheta(edges, lovasz, coordinates);\n\n  double finalValue = lovasz.Optimize(coordinates);\n\n  \/\/ Final value taken from Monteiro + Burer 2004.\n  BOOST_REQUIRE_CLOSE(finalValue, -5.333333, 1e-5);\n\n  \/\/ Now ensure that all the constraints are satisfied.\n  arma::mat rrt = coordinates * trans(coordinates);\n  BOOST_REQUIRE_CLOSE(trace(rrt), 1.0, 1e-5);\n\n  \/\/ All those edge constraints...\n  for (size_t i = 0; i < edges.n_cols; ++i)\n  {\n    BOOST_REQUIRE_SMALL(rrt(edges(0, i), edges(1, i)), 1e-5);\n    BOOST_REQUIRE_SMALL(rrt(edges(1, i), edges(0, i)), 1e-5);\n  }\n}*\/\n\n\/**\n * keller4.co test case for Lovasz-Theta LRSDP.\n * See Monteiro and Burer 2004.\n *\nBOOST_AUTO_TEST_CASE(Keller4LovaszThetaSDP)\n{\n  \/\/ Load the edges.\n  arma::mat edges;\n  data::Load(\"keller4.csv\", edges, true);\n\n  \/\/ The LRSDP itself and the initial point.\n  arma::mat coordinates;\n  LRSDP lovasz;\n\n  setupLovaszTheta(edges, lovasz, coordinates);\n\n  double finalValue = lovasz.Optimize(coordinates);\n\n  \/\/ Final value taken from Monteiro + Burer 2004.\n  BOOST_REQUIRE_CLOSE(finalValue, -14.013, 1e-2); \/\/ Not as much precision...\n  \/\/ The SB method came to -14.013, but M&B's method only came to -14.005.\n\n  \/\/ Now ensure that all the constraints are satisfied.\n  arma::mat rrt = coordinates * trans(coordinates);\n  BOOST_REQUIRE_CLOSE(trace(rrt), 1.0, 1e-5);\n\n  \/\/ All those edge constraints...\n  for (size_t i = 0; i < edges.n_cols; ++i)\n  {\n    BOOST_REQUIRE_SMALL(rrt(edges(0, i), edges(1, i)), 1e-3);\n    BOOST_REQUIRE_SMALL(rrt(edges(1, i), edges(0, i)), 1e-3);\n  }\n}*\/\n\nBOOST_AUTO_TEST_SUITE_END();\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>PartDesign: [skip ci] make the hole feature more forgiving in case of inconsistent configuration<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 \"webkit\/tools\/test_shell\/mock_webclipboard_impl.h\"\n\n#include <algorithm>\n\n#include \"base\/logging.h\"\n#include \"base\/stl_util.h\"\n#include \"base\/string_util.h\"\n#include \"net\/base\/escape.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/platform\/WebCommon.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/platform\/WebDragData.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/platform\/WebImage.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/platform\/WebURL.h\"\n#include \"webkit\/glue\/webclipboard_impl.h\"\n#include \"webkit\/glue\/webkit_glue.h\"\n#include \"webkit\/support\/webkit_support_gfx.h\"\n\n#if WEBKIT_USING_CG\n#include <ApplicationServices\/ApplicationServices.h>\n#include <CoreFoundation\/CoreFoundation.h>\n#endif\n\nusing WebKit::WebDragData;\nusing WebKit::WebString;\nusing WebKit::WebURL;\nusing WebKit::WebVector;\n\nMockWebClipboardImpl::MockWebClipboardImpl() {\n}\n\nMockWebClipboardImpl::~MockWebClipboardImpl() {\n}\n\nbool MockWebClipboardImpl::isFormatAvailable(Format format, Buffer buffer) {\n  switch (format) {\n    case FormatPlainText:\n      return !m_plainText.isEmpty();\n\n    case FormatHTML:\n      return !m_htmlText.isEmpty();\n\n    case FormatSmartPaste:\n      return m_writeSmartPaste;\n\n    default:\n      NOTREACHED();\n      return false;\n  }\n\n  switch (buffer) {\n    case BufferStandard:\n      break;\n    case BufferSelection:\n#if defined(OS_POSIX) && !defined(OS_MACOSX)\n      break;\n#endif\n    default:\n      NOTREACHED();\n      return false;\n  }\n\n  return true;\n}\n\nWebVector<WebString> MockWebClipboardImpl::readAvailableTypes(\n    Buffer buffer, bool* containsFilenames) {\n  *containsFilenames = false;\n  std::vector<WebString> results;\n  if (!m_plainText.isEmpty()) {\n    results.push_back(WebString(\"text\/plain\"));\n  }\n  if (!m_htmlText.isEmpty()) {\n    results.push_back(WebString(\"text\/html\"));\n  }\n  if (!m_image.isNull()) {\n    results.push_back(WebString(\"image\/png\"));\n  }\n  for (size_t i = 0; i < m_customData.size(); ++i) {\n    CHECK(std::find(results.begin(), results.end(), m_customData[i].type) ==\n          results.end());\n    results.push_back(m_customData[i].type);\n  }\n  return results;\n}\n\nWebKit::WebString MockWebClipboardImpl::readPlainText(\n    WebKit::WebClipboard::Buffer buffer) {\n  return m_plainText;\n}\n\n\/\/ TODO(wtc): set output argument *url.\nWebKit::WebString MockWebClipboardImpl::readHTML(\n    WebKit::WebClipboard::Buffer buffer, WebKit::WebURL* url,\n    unsigned* fragmentStart, unsigned* fragmentEnd) {\n  *fragmentStart = 0;\n  *fragmentEnd = static_cast<unsigned>(m_htmlText.length());\n  return m_htmlText;\n}\n\nWebKit::WebData MockWebClipboardImpl::readImage(\n    WebKit::WebClipboard::Buffer buffer) {\n  std::string data;\n  std::vector<unsigned char> encoded_image;\n  \/\/ TODO(dcheng): Verify that we can assume the image is ARGB8888. Note that\n  \/\/ for endianess reasons, it will be BGRA8888 on Windows.\n#if WEBKIT_USING_SKIA\n  const SkBitmap& bitmap = m_image.getSkBitmap();\n  SkAutoLockPixels lock(bitmap);\n  webkit_support::EncodeBGRAPNG(static_cast<unsigned char*>(bitmap.getPixels()),\n                                bitmap.width(),\n                                bitmap.height(),\n                                bitmap.rowBytes(),\n                                false,\n                                &encoded_image);\n#elif WEBKIT_USING_CG\n  CGImageRef image = m_image.getCGImageRef();\n  CFDataRef image_data_ref =\n      CGDataProviderCopyData(CGImageGetDataProvider(image));\n  webkit_support::EncodeBGRAPNG(CFDataGetBytePtr(image_data_ref),\n                                CGImageGetWidth(image),\n                                CGImageGetHeight(image),\n                                CGImageGetBytesPerRow(image),\n                                false,\n                                &encoded_image);\n  CFRelease(image_data_ref);\n#endif\n  data.assign(reinterpret_cast<char*>(vector_as_array(&encoded_image)),\n              encoded_image.size());\n  return data;\n}\n\nWebKit::WebString MockWebClipboardImpl::readCustomData(\n    WebKit::WebClipboard::Buffer buffer,\n    const WebKit::WebString& type) {\n  for (size_t i = 0; i < m_customData.size(); ++i) {\n    if (m_customData[i].type == type) {\n      return m_customData[i].data;\n    }\n  }\n  return WebKit::WebString();\n}\n\nvoid MockWebClipboardImpl::writeHTML(\n    const WebKit::WebString& htmlText, const WebKit::WebURL& url,\n    const WebKit::WebString& plainText, bool writeSmartPaste) {\n  m_htmlText = htmlText;\n  m_plainText = plainText;\n  m_image.reset();\n  m_customData = WebVector<WebDragData::CustomData>();\n  m_writeSmartPaste = writeSmartPaste;\n}\n\nvoid MockWebClipboardImpl::writePlainText(const WebKit::WebString& plain_text) {\n  m_htmlText = WebKit::WebString();\n  m_plainText = plain_text;\n  m_image.reset();\n  m_customData = WebVector<WebDragData::CustomData>();\n  m_writeSmartPaste = false;\n}\n\nvoid MockWebClipboardImpl::writeURL(\n    const WebKit::WebURL& url, const WebKit::WebString& title) {\n  m_htmlText = WebString::fromUTF8(\n      webkit_glue::WebClipboardImpl::URLToMarkup(url, title));\n  m_plainText = url.spec().utf16();\n  m_image.reset();\n  m_customData = WebVector<WebDragData::CustomData>();\n  m_writeSmartPaste = false;\n}\n\nvoid MockWebClipboardImpl::writeImage(const WebKit::WebImage& image,\n    const WebKit::WebURL& url, const WebKit::WebString& title) {\n  if (!image.isNull()) {\n    m_htmlText = WebString::fromUTF8(\n        webkit_glue::WebClipboardImpl::URLToImageMarkup(url, title));\n    m_plainText = m_htmlText;\n    m_image = image;\n    m_customData = WebVector<WebDragData::CustomData>();\n    m_writeSmartPaste = false;\n  }\n}\n\nvoid MockWebClipboardImpl::writeDataObject(const WebKit::WebDragData& data) {\n  m_htmlText = data.htmlText();\n  m_plainText = data.plainText();\n  m_image.reset();\n  m_customData = data.customData();\n  m_writeSmartPaste = false;\n}\n<commit_msg>Allow setting empty data for a MIME type in MockWebClipboardImpl.<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 \"webkit\/tools\/test_shell\/mock_webclipboard_impl.h\"\n\n#include <algorithm>\n\n#include \"base\/logging.h\"\n#include \"base\/stl_util.h\"\n#include \"base\/string_util.h\"\n#include \"net\/base\/escape.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/platform\/WebCommon.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/platform\/WebDragData.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/platform\/WebImage.h\"\n#include \"third_party\/WebKit\/Source\/WebKit\/chromium\/public\/platform\/WebURL.h\"\n#include \"webkit\/glue\/webclipboard_impl.h\"\n#include \"webkit\/glue\/webkit_glue.h\"\n#include \"webkit\/support\/webkit_support_gfx.h\"\n\n#if WEBKIT_USING_CG\n#include <ApplicationServices\/ApplicationServices.h>\n#include <CoreFoundation\/CoreFoundation.h>\n#endif\n\nusing WebKit::WebDragData;\nusing WebKit::WebString;\nusing WebKit::WebURL;\nusing WebKit::WebVector;\n\nMockWebClipboardImpl::MockWebClipboardImpl() {\n}\n\nMockWebClipboardImpl::~MockWebClipboardImpl() {\n}\n\nbool MockWebClipboardImpl::isFormatAvailable(Format format, Buffer buffer) {\n  switch (format) {\n    case FormatPlainText:\n      return !m_plainText.isNull();\n\n    case FormatHTML:\n      return !m_htmlText.isNull();\n\n    case FormatSmartPaste:\n      return m_writeSmartPaste;\n\n    default:\n      NOTREACHED();\n      return false;\n  }\n\n  switch (buffer) {\n    case BufferStandard:\n      break;\n    case BufferSelection:\n#if defined(OS_POSIX) && !defined(OS_MACOSX)\n      break;\n#endif\n    default:\n      NOTREACHED();\n      return false;\n  }\n\n  return true;\n}\n\nWebVector<WebString> MockWebClipboardImpl::readAvailableTypes(\n    Buffer buffer, bool* containsFilenames) {\n  *containsFilenames = false;\n  std::vector<WebString> results;\n  if (!m_plainText.isEmpty()) {\n    results.push_back(WebString(\"text\/plain\"));\n  }\n  if (!m_htmlText.isEmpty()) {\n    results.push_back(WebString(\"text\/html\"));\n  }\n  if (!m_image.isNull()) {\n    results.push_back(WebString(\"image\/png\"));\n  }\n  for (size_t i = 0; i < m_customData.size(); ++i) {\n    CHECK(std::find(results.begin(), results.end(), m_customData[i].type) ==\n          results.end());\n    results.push_back(m_customData[i].type);\n  }\n  return results;\n}\n\nWebKit::WebString MockWebClipboardImpl::readPlainText(\n    WebKit::WebClipboard::Buffer buffer) {\n  return m_plainText;\n}\n\n\/\/ TODO(wtc): set output argument *url.\nWebKit::WebString MockWebClipboardImpl::readHTML(\n    WebKit::WebClipboard::Buffer buffer, WebKit::WebURL* url,\n    unsigned* fragmentStart, unsigned* fragmentEnd) {\n  *fragmentStart = 0;\n  *fragmentEnd = static_cast<unsigned>(m_htmlText.length());\n  return m_htmlText;\n}\n\nWebKit::WebData MockWebClipboardImpl::readImage(\n    WebKit::WebClipboard::Buffer buffer) {\n  std::string data;\n  std::vector<unsigned char> encoded_image;\n  \/\/ TODO(dcheng): Verify that we can assume the image is ARGB8888. Note that\n  \/\/ for endianess reasons, it will be BGRA8888 on Windows.\n#if WEBKIT_USING_SKIA\n  const SkBitmap& bitmap = m_image.getSkBitmap();\n  SkAutoLockPixels lock(bitmap);\n  webkit_support::EncodeBGRAPNG(static_cast<unsigned char*>(bitmap.getPixels()),\n                                bitmap.width(),\n                                bitmap.height(),\n                                bitmap.rowBytes(),\n                                false,\n                                &encoded_image);\n#elif WEBKIT_USING_CG\n  CGImageRef image = m_image.getCGImageRef();\n  CFDataRef image_data_ref =\n      CGDataProviderCopyData(CGImageGetDataProvider(image));\n  webkit_support::EncodeBGRAPNG(CFDataGetBytePtr(image_data_ref),\n                                CGImageGetWidth(image),\n                                CGImageGetHeight(image),\n                                CGImageGetBytesPerRow(image),\n                                false,\n                                &encoded_image);\n  CFRelease(image_data_ref);\n#endif\n  data.assign(reinterpret_cast<char*>(vector_as_array(&encoded_image)),\n              encoded_image.size());\n  return data;\n}\n\nWebKit::WebString MockWebClipboardImpl::readCustomData(\n    WebKit::WebClipboard::Buffer buffer,\n    const WebKit::WebString& type) {\n  for (size_t i = 0; i < m_customData.size(); ++i) {\n    if (m_customData[i].type == type) {\n      return m_customData[i].data;\n    }\n  }\n  return WebKit::WebString();\n}\n\nvoid MockWebClipboardImpl::writeHTML(\n    const WebKit::WebString& htmlText, const WebKit::WebURL& url,\n    const WebKit::WebString& plainText, bool writeSmartPaste) {\n  m_htmlText = htmlText;\n  m_plainText = plainText;\n  m_image.reset();\n  m_customData = WebVector<WebDragData::CustomData>();\n  m_writeSmartPaste = writeSmartPaste;\n}\n\nvoid MockWebClipboardImpl::writePlainText(const WebKit::WebString& plain_text) {\n  m_htmlText = WebKit::WebString();\n  m_plainText = plain_text;\n  m_image.reset();\n  m_customData = WebVector<WebDragData::CustomData>();\n  m_writeSmartPaste = false;\n}\n\nvoid MockWebClipboardImpl::writeURL(\n    const WebKit::WebURL& url, const WebKit::WebString& title) {\n  m_htmlText = WebString::fromUTF8(\n      webkit_glue::WebClipboardImpl::URLToMarkup(url, title));\n  m_plainText = url.spec().utf16();\n  m_image.reset();\n  m_customData = WebVector<WebDragData::CustomData>();\n  m_writeSmartPaste = false;\n}\n\nvoid MockWebClipboardImpl::writeImage(const WebKit::WebImage& image,\n    const WebKit::WebURL& url, const WebKit::WebString& title) {\n  if (!image.isNull()) {\n    m_htmlText = WebString::fromUTF8(\n        webkit_glue::WebClipboardImpl::URLToImageMarkup(url, title));\n    m_plainText = m_htmlText;\n    m_image = image;\n    m_customData = WebVector<WebDragData::CustomData>();\n    m_writeSmartPaste = false;\n  }\n}\n\nvoid MockWebClipboardImpl::writeDataObject(const WebKit::WebDragData& data) {\n  m_htmlText = data.htmlText();\n  m_plainText = data.plainText();\n  m_image.reset();\n  m_customData = data.customData();\n  m_writeSmartPaste = false;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"common.h\"\n\n#include <cassert>\n#include <dlfcn.h>\n#include <sstream>\n\n#include \"llvm\/DebugInfo.h\"\n\n#include \"Context.h\"\n#include \"Device.h\"\n#include \"Kernel.h\"\n#include \"Memory.h\"\n#include \"WorkGroup.h\"\n#include \"WorkItem.h\"\n\n#include \"plugins\/InstructionCounter.h\"\n#include \"plugins\/RaceDetector.h\"\n\nusing namespace oclgrind;\nusing namespace std;\n\nContext::Context()\n{\n  m_device = new Device(this);\n  m_globalMemory = new Memory(AddrSpaceGlobal, this);\n\n  loadPlugins();\n}\n\nContext::~Context()\n{\n  delete m_globalMemory;\n  delete m_device;\n}\n\nDevice* Context::getDevice() const\n{\n  return m_device;\n}\n\nMemory* Context::getGlobalMemory() const\n{\n  return m_globalMemory;\n}\n\nvoid Context::loadPlugins()\n{\n  \/\/ TODO: When can we destroy plugins?\n\n  \/\/ Register core plugins\n\n  const char *instCounts = getenv(\"OCLGRIND_INST_COUNTS\");\n  if (instCounts && strcmp(instCounts, \"1\") == 0)\n    m_plugins.push_back(new InstructionCounter(this));\n\n  const char *dataRaces = getenv(\"OCLGRIND_DATA_RACES\");\n  if (dataRaces && strcmp(dataRaces, \"1\") == 0)\n    m_plugins.push_back(new RaceDetector(this));\n\n  \/\/ Register dynamic plugins\n  const char *dynamicPlugins = getenv(\"OCLGRIND_PLUGINS\");\n  if (dynamicPlugins)\n  {\n    std::istringstream ss(dynamicPlugins);\n    std::string libpath;\n    while(std::getline(ss, libpath, ':'))\n    {\n      void *library = dlopen(libpath.c_str(), RTLD_NOW);\n      if (!library)\n      {\n        cerr << \"Loading Oclgrind plugin failed: \" << dlerror() << endl;\n        continue;\n      }\n\n      void *initialize = dlsym(library, \"initializePlugin\");\n      if (!initialize)\n      {\n        cerr << \"Loading Oclgrind plugin failed: \" << dlerror() << endl;\n        continue;\n      }\n\n      ((void(*)(Context*))initialize)(this);\n    }\n  }\n}\n\nvoid Context::logDataRace(DataRaceType type, unsigned int addrSpace,\n                          size_t address,\n                          size_t lastWorkItem,\n                          size_t lastWorkGroup,\n                          const llvm::Instruction *lastInstruction) const\n{\n  string memType;\n  switch (addrSpace)\n  {\n  case AddrSpacePrivate:\n    memType = \"private\";\n    break;\n  case AddrSpaceGlobal:\n    memType = \"global\";\n    break;\n  case AddrSpaceConstant:\n    memType = \"constant\";\n    break;\n  case AddrSpaceLocal:\n    memType = \"local\";\n    break;\n  default:\n    assert(false && \"Data race in unsupported address space.\");\n    break;\n  }\n\n  \/\/ Error info\n  cerr << endl;\n  switch (type)\n  {\n    case ReadWriteRace:\n      cerr << \"Read-write\";\n      break;\n    case WriteWriteRace:\n      cerr << \"Write-write\";\n      break;\n    default:\n      cerr << \"Unrecognized\";\n      break;\n  }\n  cerr << \" data race\"\n       << \" at \" << memType\n       << \" memory address \" << hex << address << endl;\n\n  printErrorContext();\n  cerr << endl;\n\n  const KernelInvocation *ki = m_device->getCurrentKernelInvocation();\n\n  \/\/ Show details of other entity involved in race\n  if (lastWorkItem != -1)\n  {\n    size_t gx, gy, gz;\n    gx = lastWorkItem % ki->globalSize[0];\n    gy = (lastWorkItem - gx) \/ ki->globalSize[1];\n    gz = (lastWorkItem - gy - gx) \/ ki->globalSize[2];\n    cerr << \"\\tRace occurred with work-item (\" << dec\n         << gx << \",\"\n         << gy << \",\"\n         << gz << \")\" << endl;\n  }\n  else if (lastWorkGroup != -1)\n  {\n    size_t gx, gy, gz;\n    gx = lastWorkGroup % ki->numGroups[0];\n    gy = (lastWorkGroup - gx) \/ ki->numGroups[1];\n    gz = (lastWorkGroup - gy - gx) \/ ki->numGroups[2];\n    cerr << \"\\tRace occurred with work-group (\" << dec\n         << gx << \",\"\n         << gy << \",\"\n         << gz << \")\" << endl;\n  }\n  else\n  {\n    cerr << \"\\tRace occurred with unknown entity\" << endl;\n  }\n\n  \/\/ Show conflicting instruction\n  if (lastInstruction)\n  {\n    cerr << \"\\t\";\n    printInstruction(lastInstruction);\n  }\n\n  cerr << endl;\n\n  m_device->forceBreak();\n}\n\nvoid Context::logDivergence(const llvm::Instruction *instruction,\n                            string divergence,\n                            string currentInfo, string previousInfo) const\n{\n  \/\/ Error info\n  cerr << endl\n       << \"Work-group divergence detected (\"\n       << divergence\n       << \"):\" << endl;\n  printErrorContext();\n  if (!currentInfo.empty())\n  {\n    cerr << \"\\t\" << currentInfo << endl;\n  }\n  cerr << endl;\n\n  \/\/ Show divergent instruction\/info\n  cerr << \"Previous work-items executed this instruction:\" << endl;\n  cerr << \"\\t\";\n  printInstruction(instruction);\n  if (!previousInfo.empty())\n  {\n    cerr << \"\\t\" << previousInfo << endl;\n  }\n\n  cerr << endl;\n\n  m_device->forceBreak();\n}\n\nvoid Context::logError(const char* error, const char* info) const\n{\n  \/\/ Error info\n  cerr << endl << error << endl;\n  printErrorContext();\n  if (info)\n  {\n    cerr << \"\\t\" << info << endl;\n  }\n  cerr << endl;\n\n  m_device->forceBreak();\n}\n\nvoid Context::logMemoryError(bool read, unsigned int addrSpace,\n                             size_t address, size_t size) const\n{\n  string memType;\n  switch (addrSpace)\n  {\n  case AddrSpacePrivate:\n    memType = \"private\";\n    break;\n  case AddrSpaceGlobal:\n    memType = \"global\";\n    break;\n  case AddrSpaceConstant:\n    memType = \"constant\";\n    break;\n  case AddrSpaceLocal:\n    memType = \"local\";\n    break;\n  default:\n    assert(false && \"Memory error in unsupported address space.\");\n    break;\n  }\n\n  \/\/ Error info\n  cerr << endl << \"Invalid \" << (read ? \"read\" : \"write\")\n       << \" of size \" << size\n       << \" at \" << memType\n       << \" memory address \" << hex << address << endl;\n\n  printErrorContext();\n  cerr << endl;\n\n  m_device->forceBreak();\n}\n\nvoid Context::printErrorContext() const\n{\n  \/\/ Work item\n  const WorkItem *workItem = m_device->getCurrentWorkItem();\n  if (workItem)\n  {\n    const size_t *gid = workItem->getGlobalID();\n    const size_t *lid = workItem->getLocalID();\n    cerr << \"\\tWork-item:  Global(\" << dec\n         << gid[0] << \",\"\n         << gid[1] << \",\"\n         << gid[2] << \")\"\n         << \" Local(\" << dec\n         << lid[0] << \",\"\n         << lid[1] << \",\"\n         << lid[2] << \")\"\n         << endl;\n  }\n\n  \/\/ Work group\n  const WorkGroup *workGroup = m_device->getCurrentWorkGroup();\n  if (workGroup)\n  {\n    const size_t *group = workGroup->getGroupID();\n    cerr << \"\\tWork-group: (\" << dec\n         << group[0] << \",\"\n         << group[1] << \",\"\n         << group[2] << \")\"\n         << endl;\n  }\n\n  \/\/ Kernel\n  const KernelInvocation *ki = m_device->getCurrentKernelInvocation();\n  if (ki && ki->kernel)\n  {\n    cerr << \"\\tKernel:     \" << ki->kernel->getName() << endl;\n  }\n\n  \/\/ Instruction\n  if (workItem)\n  {\n    cerr << \"\\t\";\n    printInstruction(workItem->getCurrentInstruction());\n  }\n}\n\nvoid Context::printInstruction(const llvm::Instruction *instruction) const\n{\n  dumpInstruction(cerr, *instruction);\n  cerr << endl;\n\n  \/\/ Output debug information\n  cerr << \"\\t\";\n  llvm::MDNode *md = instruction->getMetadata(\"dbg\");\n  if (!md)\n  {\n    cerr << \"Debugging information not available.\" << endl;\n  }\n  else\n  {\n    llvm::DILocation loc(md);\n    cerr << \"At line \" << dec << loc.getLineNumber()\n         << \" of \" << loc.getFilename().str() << endl;\n  }\n}\n\n#define NOTIFY(function, ...)                     \\\n  PluginList::const_iterator pluginItr;           \\\n  for (pluginItr = m_plugins.begin();             \\\n       pluginItr != m_plugins.end(); pluginItr++) \\\n  {                                               \\\n    (*pluginItr)->function(__VA_ARGS__);          \\\n  }\n\nvoid Context::notifyInstructionExecuted(const llvm::Instruction *instruction,\n                                        const TypedValue& result) const\n{\n  NOTIFY(instructionExecuted, instruction, result);\n}\n\nvoid Context::notifyKernelBegin(const Kernel *kernel) const\n{\n  NOTIFY(kernelBegin, kernel);\n}\n\nvoid Context::notifyKernelEnd(const Kernel *kernel) const\n{\n  NOTIFY(kernelEnd, kernel);\n}\n\nvoid Context::notifyMemoryAllocated(const Memory *memory, size_t address,\n                                    size_t size) const\n{\n  NOTIFY(memoryAllocated, memory, address, size);\n}\n\nvoid Context::notifyMemoryAtomic(const Memory *memory, size_t address,\n                                 size_t size) const\n{\n  NOTIFY(memoryAtomic, memory, address, size);\n}\n\nvoid Context::notifyMemoryDeallocated(const Memory *memory,\n                                      size_t address) const\n{\n  NOTIFY(memoryDeallocated, memory, address);\n}\n\nvoid Context::notifyMemoryLoad(const Memory *memory, size_t address,\n                               size_t size) const\n{\n  NOTIFY(memoryLoad, memory, address, size);\n}\n\nvoid Context::notifyMemoryStore(const Memory *memory, size_t address,\n                                size_t size, const uint8_t *storeData) const\n{\n  NOTIFY(memoryStore, memory, address, size, storeData);\n}\n\nvoid Context::notifyWorkGroupBarrier(const WorkGroup *workGroup,\n                                     uint32_t flags) const\n{\n  NOTIFY(workGroupBarrier, workGroup, flags);\n}\n\n#undef NOTIFY\n\nvoid Context::registerPlugin(Plugin *plugin)\n{\n  m_plugins.push_back(plugin);\n}\n\nvoid Context::unregisterPlugin(Plugin *plugin)\n{\n  m_plugins.remove(plugin);\n}\n<commit_msg>Implemented dynamic plugin loading for Windows.<commit_after>#include \"common.h\"\n\n#include <cassert>\n#include <sstream>\n\n#if defined(_WIN32) && !defined(__MINGW32__)\n#include <windows.h>\n#else\n#include <dlfcn.h>\n#endif\n\n#include \"llvm\/DebugInfo.h\"\n\n#include \"Context.h\"\n#include \"Device.h\"\n#include \"Kernel.h\"\n#include \"Memory.h\"\n#include \"WorkGroup.h\"\n#include \"WorkItem.h\"\n\n#include \"plugins\/InstructionCounter.h\"\n#include \"plugins\/RaceDetector.h\"\n\nusing namespace oclgrind;\nusing namespace std;\n\nContext::Context()\n{\n  m_device = new Device(this);\n  m_globalMemory = new Memory(AddrSpaceGlobal, this);\n\n  loadPlugins();\n}\n\nContext::~Context()\n{\n  delete m_globalMemory;\n  delete m_device;\n}\n\nDevice* Context::getDevice() const\n{\n  return m_device;\n}\n\nMemory* Context::getGlobalMemory() const\n{\n  return m_globalMemory;\n}\n\nvoid Context::loadPlugins()\n{\n  \/\/ TODO: When can we destroy plugins?\n\n  \/\/ Register core plugins\n\n  const char *instCounts = getenv(\"OCLGRIND_INST_COUNTS\");\n  if (instCounts && strcmp(instCounts, \"1\") == 0)\n    m_plugins.push_back(new InstructionCounter(this));\n\n  const char *dataRaces = getenv(\"OCLGRIND_DATA_RACES\");\n  if (dataRaces && strcmp(dataRaces, \"1\") == 0)\n    m_plugins.push_back(new RaceDetector(this));\n\n  \/\/ Register dynamic plugins\n  const char *dynamicPlugins = getenv(\"OCLGRIND_PLUGINS\");\n  if (dynamicPlugins)\n  {\n    std::istringstream ss(dynamicPlugins);\n    std::string libpath;\n    while(std::getline(ss, libpath, ':'))\n    {\n#if defined(_WIN32) && !defined(__MINGW32__)\n      HMODULE library = LoadLibrary(libpath.c_str());\n      if (!library)\n      {\n        cerr << \"Loading Oclgrind plugin failed (LoadLibrary): \"\n             << GetLastError() << endl;\n        continue;\n      }\n\n      void *initialize = GetProcAddress(library, \"initializePlugin\");\n      if (!initialize)\n      {\n        cerr << \"Loading Oclgrind plugin failed (GetProcAddress): \"\n             << GetLastError() << endl;\n        continue;\n      }\n#else\n      void *library = dlopen(libpath.c_str(), RTLD_NOW);\n      if (!library)\n      {\n        cerr << \"Loading Oclgrind plugin failed: \" << dlerror() << endl;\n        continue;\n      }\n\n      void *initialize = dlsym(library, \"initializePlugin\");\n      if (!initialize)\n      {\n        cerr << \"Loading Oclgrind plugin failed: \" << dlerror() << endl;\n        continue;\n      }\n#endif\n\n      ((void(*)(Context*))initialize)(this);\n    }\n  }\n}\n\nvoid Context::logDataRace(DataRaceType type, unsigned int addrSpace,\n                          size_t address,\n                          size_t lastWorkItem,\n                          size_t lastWorkGroup,\n                          const llvm::Instruction *lastInstruction) const\n{\n  string memType;\n  switch (addrSpace)\n  {\n  case AddrSpacePrivate:\n    memType = \"private\";\n    break;\n  case AddrSpaceGlobal:\n    memType = \"global\";\n    break;\n  case AddrSpaceConstant:\n    memType = \"constant\";\n    break;\n  case AddrSpaceLocal:\n    memType = \"local\";\n    break;\n  default:\n    assert(false && \"Data race in unsupported address space.\");\n    break;\n  }\n\n  \/\/ Error info\n  cerr << endl;\n  switch (type)\n  {\n    case ReadWriteRace:\n      cerr << \"Read-write\";\n      break;\n    case WriteWriteRace:\n      cerr << \"Write-write\";\n      break;\n    default:\n      cerr << \"Unrecognized\";\n      break;\n  }\n  cerr << \" data race\"\n       << \" at \" << memType\n       << \" memory address \" << hex << address << endl;\n\n  printErrorContext();\n  cerr << endl;\n\n  const KernelInvocation *ki = m_device->getCurrentKernelInvocation();\n\n  \/\/ Show details of other entity involved in race\n  if (lastWorkItem != -1)\n  {\n    size_t gx, gy, gz;\n    gx = lastWorkItem % ki->globalSize[0];\n    gy = (lastWorkItem - gx) \/ ki->globalSize[1];\n    gz = (lastWorkItem - gy - gx) \/ ki->globalSize[2];\n    cerr << \"\\tRace occurred with work-item (\" << dec\n         << gx << \",\"\n         << gy << \",\"\n         << gz << \")\" << endl;\n  }\n  else if (lastWorkGroup != -1)\n  {\n    size_t gx, gy, gz;\n    gx = lastWorkGroup % ki->numGroups[0];\n    gy = (lastWorkGroup - gx) \/ ki->numGroups[1];\n    gz = (lastWorkGroup - gy - gx) \/ ki->numGroups[2];\n    cerr << \"\\tRace occurred with work-group (\" << dec\n         << gx << \",\"\n         << gy << \",\"\n         << gz << \")\" << endl;\n  }\n  else\n  {\n    cerr << \"\\tRace occurred with unknown entity\" << endl;\n  }\n\n  \/\/ Show conflicting instruction\n  if (lastInstruction)\n  {\n    cerr << \"\\t\";\n    printInstruction(lastInstruction);\n  }\n\n  cerr << endl;\n\n  m_device->forceBreak();\n}\n\nvoid Context::logDivergence(const llvm::Instruction *instruction,\n                            string divergence,\n                            string currentInfo, string previousInfo) const\n{\n  \/\/ Error info\n  cerr << endl\n       << \"Work-group divergence detected (\"\n       << divergence\n       << \"):\" << endl;\n  printErrorContext();\n  if (!currentInfo.empty())\n  {\n    cerr << \"\\t\" << currentInfo << endl;\n  }\n  cerr << endl;\n\n  \/\/ Show divergent instruction\/info\n  cerr << \"Previous work-items executed this instruction:\" << endl;\n  cerr << \"\\t\";\n  printInstruction(instruction);\n  if (!previousInfo.empty())\n  {\n    cerr << \"\\t\" << previousInfo << endl;\n  }\n\n  cerr << endl;\n\n  m_device->forceBreak();\n}\n\nvoid Context::logError(const char* error, const char* info) const\n{\n  \/\/ Error info\n  cerr << endl << error << endl;\n  printErrorContext();\n  if (info)\n  {\n    cerr << \"\\t\" << info << endl;\n  }\n  cerr << endl;\n\n  m_device->forceBreak();\n}\n\nvoid Context::logMemoryError(bool read, unsigned int addrSpace,\n                             size_t address, size_t size) const\n{\n  string memType;\n  switch (addrSpace)\n  {\n  case AddrSpacePrivate:\n    memType = \"private\";\n    break;\n  case AddrSpaceGlobal:\n    memType = \"global\";\n    break;\n  case AddrSpaceConstant:\n    memType = \"constant\";\n    break;\n  case AddrSpaceLocal:\n    memType = \"local\";\n    break;\n  default:\n    assert(false && \"Memory error in unsupported address space.\");\n    break;\n  }\n\n  \/\/ Error info\n  cerr << endl << \"Invalid \" << (read ? \"read\" : \"write\")\n       << \" of size \" << size\n       << \" at \" << memType\n       << \" memory address \" << hex << address << endl;\n\n  printErrorContext();\n  cerr << endl;\n\n  m_device->forceBreak();\n}\n\nvoid Context::printErrorContext() const\n{\n  \/\/ Work item\n  const WorkItem *workItem = m_device->getCurrentWorkItem();\n  if (workItem)\n  {\n    const size_t *gid = workItem->getGlobalID();\n    const size_t *lid = workItem->getLocalID();\n    cerr << \"\\tWork-item:  Global(\" << dec\n         << gid[0] << \",\"\n         << gid[1] << \",\"\n         << gid[2] << \")\"\n         << \" Local(\" << dec\n         << lid[0] << \",\"\n         << lid[1] << \",\"\n         << lid[2] << \")\"\n         << endl;\n  }\n\n  \/\/ Work group\n  const WorkGroup *workGroup = m_device->getCurrentWorkGroup();\n  if (workGroup)\n  {\n    const size_t *group = workGroup->getGroupID();\n    cerr << \"\\tWork-group: (\" << dec\n         << group[0] << \",\"\n         << group[1] << \",\"\n         << group[2] << \")\"\n         << endl;\n  }\n\n  \/\/ Kernel\n  const KernelInvocation *ki = m_device->getCurrentKernelInvocation();\n  if (ki && ki->kernel)\n  {\n    cerr << \"\\tKernel:     \" << ki->kernel->getName() << endl;\n  }\n\n  \/\/ Instruction\n  if (workItem)\n  {\n    cerr << \"\\t\";\n    printInstruction(workItem->getCurrentInstruction());\n  }\n}\n\nvoid Context::printInstruction(const llvm::Instruction *instruction) const\n{\n  dumpInstruction(cerr, *instruction);\n  cerr << endl;\n\n  \/\/ Output debug information\n  cerr << \"\\t\";\n  llvm::MDNode *md = instruction->getMetadata(\"dbg\");\n  if (!md)\n  {\n    cerr << \"Debugging information not available.\" << endl;\n  }\n  else\n  {\n    llvm::DILocation loc(md);\n    cerr << \"At line \" << dec << loc.getLineNumber()\n         << \" of \" << loc.getFilename().str() << endl;\n  }\n}\n\n#define NOTIFY(function, ...)                     \\\n  PluginList::const_iterator pluginItr;           \\\n  for (pluginItr = m_plugins.begin();             \\\n       pluginItr != m_plugins.end(); pluginItr++) \\\n  {                                               \\\n    (*pluginItr)->function(__VA_ARGS__);          \\\n  }\n\nvoid Context::notifyInstructionExecuted(const llvm::Instruction *instruction,\n                                        const TypedValue& result) const\n{\n  NOTIFY(instructionExecuted, instruction, result);\n}\n\nvoid Context::notifyKernelBegin(const Kernel *kernel) const\n{\n  NOTIFY(kernelBegin, kernel);\n}\n\nvoid Context::notifyKernelEnd(const Kernel *kernel) const\n{\n  NOTIFY(kernelEnd, kernel);\n}\n\nvoid Context::notifyMemoryAllocated(const Memory *memory, size_t address,\n                                    size_t size) const\n{\n  NOTIFY(memoryAllocated, memory, address, size);\n}\n\nvoid Context::notifyMemoryAtomic(const Memory *memory, size_t address,\n                                 size_t size) const\n{\n  NOTIFY(memoryAtomic, memory, address, size);\n}\n\nvoid Context::notifyMemoryDeallocated(const Memory *memory,\n                                      size_t address) const\n{\n  NOTIFY(memoryDeallocated, memory, address);\n}\n\nvoid Context::notifyMemoryLoad(const Memory *memory, size_t address,\n                               size_t size) const\n{\n  NOTIFY(memoryLoad, memory, address, size);\n}\n\nvoid Context::notifyMemoryStore(const Memory *memory, size_t address,\n                                size_t size, const uint8_t *storeData) const\n{\n  NOTIFY(memoryStore, memory, address, size, storeData);\n}\n\nvoid Context::notifyWorkGroupBarrier(const WorkGroup *workGroup,\n                                     uint32_t flags) const\n{\n  NOTIFY(workGroupBarrier, workGroup, flags);\n}\n\n#undef NOTIFY\n\nvoid Context::registerPlugin(Plugin *plugin)\n{\n  m_plugins.push_back(plugin);\n}\n\nvoid Context::unregisterPlugin(Plugin *plugin)\n{\n  m_plugins.remove(plugin);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\/\/  $ g++ -O3 -o calcDensityForDiffThresh calcDensityForDiffThresh.cpp\n\/\/  $ .\/calcDensityForDiffThresh network.pairs network.jaccs threshDensity.csv\n*\/\n#include <math.h> \n#include <ctime>\n#include <cstdlib>\n#include <fstream>\n#include <iostream>\n#include <set>\n#include <map>\n#include <utility>   \/\/ for pairs\n#include <algorithm> \/\/ for swap\nusing namespace std;\n\nint main (int argc, char const *argv[]){\n    \/\/************* make sure args are present:\n    if (argc != 6){\n        cout << \"ERROR: something wrong with the inputs\" << endl;\n        cout << \"usage:\\n    \" << argv[0] << \" network.pairs network.jaccs threshDensity.csv\" << endl;\n        exit(1);\n    }\n    float threshold = 0;\n    float D = 0.0;\n    float highestD=0.0;\n    float highestDThr = 0.0;\n    \/\/************* got the args\n    clock_t begin = clock(); \n    \n    \/\/************* start load edgelist\n    ifstream inFile;\n    inFile.open( argv[1] );\n    if (!inFile) {\n        cout << \"ERROR: unable to open input file\" << endl;\n        exit(1); \/\/ terminate with error\n    }\n    \/\/ index should be iterator not integer????\n    set<float> thresholdSet;\n    set<float> ::reverse_iterator thIt;\n    map< int,          set<int> > index2cluster; \/\/ O(log n) access too slow?\n    map< int, map<int, set<int> >::iterator > edge2iter;\n    int ni, nj, edgeId, index = 0;\n    while (inFile >> ni >> nj >> edgeId){ \/\/ scan edgelist to populate  \n        index2cluster[ index ].insert( edgeId );         \/\/ build cluster index to set of edge-pairs map\n        edge2iter[ edgeId ] = index2cluster.find(index); \/\/ build edge pair to cluster iter map ******????\n        index++;\n    }\n    inFile.close(); inFile.clear();\n    \/\/************* end load edgelist\n    \n    \/\/************* loop over jaccards file and do the clustering\n    ifstream jaccFile;  \n    jaccFile.open( argv[2] );\n    if (!jaccFile) {\n        cout << \"ERROR: unable to open jaccards file\" << endl;\n        exit(1); \/\/ terminate with error\n    }\n    int edgeId1,edgeId2; double jacc; \n    while ( jaccFile >> edgeId1 >> edgeId2 >> jacc ) {\n        thresholdSet.insert(jacc);\n    }\n    jaccFile.close();\n    map< int, set<int > >::iterator iter_i,iter_j;\n    set<int>::iterator iterS;\n    FILE * threshDensityFile = fopen( argv[3], \"w\" ); \n    fprintf( threshDensityFile, \"%.6f %.6f \" );\n    for(thIt = thresholdSet.rbegin(); thIt!=thresholdSet.rend(); thIt++){\n        threshold = *thIt;\n        if (threshold < 0.0 || threshold > 1.0){\n            cout << \"ERROR: specified threshold not in [0,1]\" << endl;\n            exit(1);\n        }\n        jaccFile.open( argv[2] );\n        while ( jaccFile >> edgeId1 >> edgeId2 >> jacc ) {\n            if ( jacc >= threshold ) {\n                iter_i = edge2iter[ edgeId1 ];\n                iter_j = edge2iter[ edgeId2 ];\n                if ( iter_i != iter_j ) {\n                    \/\/ always merge smaller cluster into bigger:\n                    if ( (*iter_j).second.size() > (*iter_i).second.size() ){ \/\/ !!!!!!\n                        swap(iter_i, iter_j);\n                    }\n                    \/\/ merge cluster j into i and update index for all elements in j:\n                    for (iterS = iter_j->second.begin(); iterS != iter_j->second.end(); iterS++){\n                        iter_i->second.insert( *iterS );\n                        edge2iter[ *iterS ] = iter_i;\n                    }\n                    \/\/ delete cluster j:\n                    index2cluster.erase(iter_j);\n                } \n            } \/\/ done merging clusters i and j\n        }\n        \/\/************* write the clusters to file:\n        jaccFile.close();\n        cout << \"There were \" << index2cluster.size() << \" clusters at threshold \" << threshold << \".\" << endl;\n        \n        \/\/ all done clustering, write to file (and calculated partition density):\n        set<int> clusterNodes;\n        int mc, nc;\n        int M = 0, Mns = 0;\n        double wSum = 0.0;\n        set< int >::iterator S;\n        map< int, set< int > >::iterator it;\n        for ( it = index2cluster.begin(); it != index2cluster.end(); it++ ) {\n            clusterNodes.clear();\n            for (S = it->second.begin(); S != it->second.end(); S++ ){\n                \/\/fprintf( clustersFile, \"%i \", *S ); \/\/ this leaves a trailing space...!\n                clusterNodes.insert(*S); \n            }\n            mc = it->second.size();\n            nc = clusterNodes.size();\n            M += mc;\n            if (nc > 2) {\n                Mns  += mc;\n                wSum += mc * (mc - (nc-1.0)) \/ ((nc-2.0)*(nc-1.0));\n            }\n        }  \n        D = 2.0 * wSum \/ M;\n        if (isinf(D)){\n            fprintf( threshDensityFile, \"\\nERROR: D == -inf \\n\\n\"); \n            fclose(threshDensityFile);\n            exit(1);\n        }\n        \/\/*************\n        fprintf( threshDensityFile, \"%.6f %.6f \", threshold, D);\n        if(D > highestD){\n            highestD = D;\n            highestDThr = threshold;\n        } \n    }\n    fprintf( threshDensityFile, \"\\n highest D=%.6f at thresh:%.6f.\\n\", highestD, highestDThr);\n    fclose(threshDensityFile);\n    cout << \"Time taken = \" << double(clock() - begin)\/ CLOCKS_PER_SEC << \" seconds. \"<< endl;\n    return 0;\n}\n\n<commit_msg>Update calcDensityForDiffThresh.cpp<commit_after>\/*\n\/\/  $ g++ -O3 -o calcDensityForDiffThresh calcDensityForDiffThresh.cpp\n\/\/  $ .\/calcDensityForDiffThresh network.pairs network.jaccs threshDensity.csv\n*\/\n#include <math.h> \n#include <ctime>\n#include <cstdlib>\n#include <fstream>\n#include <iostream>\n#include <set>\n#include <map>\n#include <utility>   \/\/ for pairs\n#include <algorithm> \/\/ for swap\nusing namespace std;\n\nint main (int argc, char const *argv[]){\n    \/\/************* make sure args are present:\n    if (argc != 4){\n        cout << \"ERROR: something wrong with the inputs\" << endl;\n        cout << \"usage:\\n    \" << argv[0] << \" network.pairs network.jaccs threshDensity.csv\" << endl;\n        exit(1);\n    }\n    float threshold = 0;\n    float D = 0.0;\n    float highestD=0.0;\n    float highestDThr = 0.0;\n    \/\/************* got the args\n    clock_t begin = clock(); \n    \n    \/\/************* start load edgelist\n    ifstream inFile;\n    inFile.open( argv[1] );\n    if (!inFile) {\n        cout << \"ERROR: unable to open input file\" << endl;\n        exit(1); \/\/ terminate with error\n    }\n    \/\/ index should be iterator not integer????\n    set<float> thresholdSet;\n    set<float> ::reverse_iterator thIt;\n    map< int,          set<int> > index2cluster; \/\/ O(log n) access too slow?\n    map< int, map<int, set<int> >::iterator > edge2iter;\n    int ni, nj, edgeId, index = 0;\n    while (inFile >> ni >> nj >> edgeId){ \/\/ scan edgelist to populate  \n        index2cluster[ index ].insert( edgeId );         \/\/ build cluster index to set of edge-pairs map\n        edge2iter[ edgeId ] = index2cluster.find(index); \/\/ build edge pair to cluster iter map ******????\n        index++;\n    }\n    inFile.close(); inFile.clear();\n    \/\/************* end load edgelist\n    \n    \/\/************* loop over jaccards file and do the clustering\n    ifstream jaccFile;  \n    jaccFile.open( argv[2] );\n    if (!jaccFile) {\n        cout << \"ERROR: unable to open jaccards file\" << endl;\n        exit(1); \/\/ terminate with error\n    }\n    int edgeId1,edgeId2; double jacc; \n    while ( jaccFile >> edgeId1 >> edgeId2 >> jacc ) {\n        thresholdSet.insert(jacc);\n    }\n    jaccFile.close();\n    map< int, set<int > >::iterator iter_i,iter_j;\n    set<int>::iterator iterS;\n    FILE * threshDensityFile = fopen( argv[3], \"w\" ); \n    fprintf( threshDensityFile, \"%.6f %.6f \" );\n    for(thIt = thresholdSet.rbegin(); thIt!=thresholdSet.rend(); thIt++){\n        threshold = *thIt;\n        if (threshold < 0.0 || threshold > 1.0){\n            cout << \"ERROR: specified threshold not in [0,1]\" << endl;\n            exit(1);\n        }\n        jaccFile.open( argv[2] );\n        while ( jaccFile >> edgeId1 >> edgeId2 >> jacc ) {\n            if ( jacc >= threshold ) {\n                iter_i = edge2iter[ edgeId1 ];\n                iter_j = edge2iter[ edgeId2 ];\n                if ( iter_i != iter_j ) {\n                    \/\/ always merge smaller cluster into bigger:\n                    if ( (*iter_j).second.size() > (*iter_i).second.size() ){ \/\/ !!!!!!\n                        swap(iter_i, iter_j);\n                    }\n                    \/\/ merge cluster j into i and update index for all elements in j:\n                    for (iterS = iter_j->second.begin(); iterS != iter_j->second.end(); iterS++){\n                        iter_i->second.insert( *iterS );\n                        edge2iter[ *iterS ] = iter_i;\n                    }\n                    \/\/ delete cluster j:\n                    index2cluster.erase(iter_j);\n                } \n            } \/\/ done merging clusters i and j\n        }\n        \/\/************* write the clusters to file:\n        jaccFile.close();\n        cout << \"There were \" << index2cluster.size() << \" clusters at threshold \" << threshold << \".\" << endl;\n        \n        \/\/ all done clustering, write to file (and calculated partition density):\n        set<int> clusterNodes;\n        int mc, nc;\n        int M = 0, Mns = 0;\n        double wSum = 0.0;\n        set< int >::iterator S;\n        map< int, set< int > >::iterator it;\n        for ( it = index2cluster.begin(); it != index2cluster.end(); it++ ) {\n            clusterNodes.clear();\n            for (S = it->second.begin(); S != it->second.end(); S++ ){\n                \/\/fprintf( clustersFile, \"%i \", *S ); \/\/ this leaves a trailing space...!\n                clusterNodes.insert(*S); \n            }\n            mc = it->second.size();\n            nc = clusterNodes.size();\n            M += mc;\n            if (nc > 2) {\n                Mns  += mc;\n                wSum += mc * (mc - (nc-1.0)) \/ ((nc-2.0)*(nc-1.0));\n            }\n        }  \n        D = 2.0 * wSum \/ M;\n        if (isinf(D)){\n            fprintf( threshDensityFile, \"\\nERROR: D == -inf \\n\\n\"); \n            fclose(threshDensityFile);\n            exit(1);\n        }\n        \/\/*************\n        fprintf( threshDensityFile, \"%.6f %.6f \", threshold, D);\n        if(D > highestD){\n            highestD = D;\n            highestDThr = threshold;\n        } \n    }\n    fprintf( threshDensityFile, \"\\n highest D=%.6f at thresh:%.6f.\\n\", highestD, highestDThr);\n    fclose(threshDensityFile);\n    cout << \"Time taken = \" << double(clock() - begin)\/ CLOCKS_PER_SEC << \" seconds. \"<< endl;\n    return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>HINSTANCE vs. HMODULE clean up<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"content\/nw\/src\/api\/nw_app_api.h\"\n\n#include \"chrome\/browser\/lifetime\/browser_close_manager.h\"\n#include \"chrome\/browser\/lifetime\/application_lifetime.h\"\n#include \"content\/public\/common\/content_features.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/memory\/ptr_util.h\"\n#include \"base\/message_loop\/message_loop_current.h\"\n#include \"base\/task\/post_task.h\"\n#include \"content\/public\/browser\/browser_task_traits.h\"\n#include \"chrome\/browser\/browsing_data\/browsing_data_appcache_helper.h\"\n#include \"chrome\/browser\/browsing_data\/browsing_data_helper.h\"\n#include \"chrome\/browser\/devtools\/devtools_window.h\"\n#include \"chrome\/browser\/extensions\/devtools_util.h\"\n#include \"chrome\/browser\/extensions\/extension_service.h\"\n#include \"chrome\/browser\/net\/profile_network_context_service.h\"\n#include \"chrome\/browser\/net\/profile_network_context_service_factory.h\"\n#include \"content\/nw\/src\/api\/nw_app.h\"\n#include \"content\/nw\/src\/nw_base.h\"\n#include \"content\/public\/browser\/render_frame_host.h\"\n#include \"content\/public\/browser\/render_process_host.h\"\n#include \"content\/public\/browser\/render_view_host.h\"\n#include \"content\/public\/browser\/storage_partition.h\"\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"extensions\/browser\/app_window\/app_window.h\"\n#include \"extensions\/browser\/app_window\/app_window_registry.h\"\n#include \"extensions\/browser\/app_window\/native_app_window.h\"\n#include \"extensions\/browser\/extension_system.h\"\n#include \"extensions\/common\/error_utils.h\"\n#include \"net\/proxy_resolution\/proxy_config.h\"\n#include \"net\/proxy_resolution\/proxy_config_service_fixed.h\"\n#include \"net\/proxy_resolution\/proxy_resolution_service.h\"\n#include \"net\/url_request\/url_request_context.h\"\n#include \"net\/url_request\/url_request_context_getter.h\"\n#include \"net\/traffic_annotation\/network_traffic_annotation_test_helper.h\"\n\nusing namespace extensions::nwapi::nw__app;\n\nnamespace extensions {\nNwAppQuitFunction::NwAppQuitFunction() {\n\n}\n\nNwAppQuitFunction::~NwAppQuitFunction() {\n}\n\nvoid NwAppQuitFunction::DoJob(ExtensionService* service, std::string extension_id) {\n  if (base::FeatureList::IsEnabled(::features::kNWNewWin)) {\n    chrome::CloseAllBrowsersAndQuit(true);\n    return;\n  }\n  base::ThreadTaskRunnerHandle::Get().get()->PostTask(\n                                                      FROM_HERE,\n                                                      base::Bind(&ExtensionService::TerminateExtension,\n                                                                   service->AsWeakPtr(),\n                                                                   extension_id));\n}\n\nExtensionFunction::ResponseAction\nNwAppQuitFunction::Run() {\n  ExtensionService* service =\n    ExtensionSystem::Get(browser_context())->extension_service();\n  base::ThreadTaskRunnerHandle::Get().get()->PostTask(\n        FROM_HERE,\n        base::Bind(&NwAppQuitFunction::DoJob,\n                   service,\n                   extension_id()));\n  return RespondNow(NoArguments());\n}\n\nvoid NwAppCloseAllWindowsFunction::DoJob(AppWindowRegistry* registry, std::string id) {\n  if (base::FeatureList::IsEnabled(::features::kNWNewWin)) {\n    chrome::CloseAllBrowsers();\n  }\n  AppWindowRegistry::AppWindowList windows =\n    registry->GetAppWindowsForApp(id);\n\n  for (AppWindow* window : windows) {\n    if (window->NWCanClose())\n      window->GetBaseWindow()->Close();\n  }\n}\n\nExtensionFunction::ResponseAction\nNwAppCloseAllWindowsFunction::Run() {\n  AppWindowRegistry* registry = AppWindowRegistry::Get(browser_context());\n  if (!registry)\n    return RespondNow(Error(\"\"));\n  base::ThreadTaskRunnerHandle::Get().get()->PostTask(\n        FROM_HERE,\n        base::Bind(&NwAppCloseAllWindowsFunction::DoJob, registry, extension()->id()));\n\n  return RespondNow(NoArguments());\n}\n\nNwAppGetArgvSyncFunction::NwAppGetArgvSyncFunction() {\n}\n\nNwAppGetArgvSyncFunction::~NwAppGetArgvSyncFunction() {\n}\n\nbool NwAppGetArgvSyncFunction::RunNWSync(base::ListValue* response, std::string* error) {\n\n  nw::Package* package = nw::package();\n  base::CommandLine* command_line = base::CommandLine::ForCurrentProcess();\n  base::CommandLine::StringVector args = command_line->GetArgs();\n  base::CommandLine::StringVector argv = command_line->original_argv();\n\n  \/\/ Ignore first non-switch arg if it's not a standalone package.\n  bool ignore_arg = !package->self_extract();\n  for (unsigned i = 1; i < argv.size(); ++i) {\n    if (ignore_arg && args.size() && argv[i] == args[0]) {\n      ignore_arg = false;\n      continue;\n    }\n\n    response->AppendString(argv[i]);\n  }\n  return true;\n}\n\nNwAppClearAppCacheFunction::NwAppClearAppCacheFunction() {\n}\n\nNwAppClearAppCacheFunction::~NwAppClearAppCacheFunction() {\n}\n\nbool NwAppClearAppCacheFunction::RunNWSync(base::ListValue* response, std::string* error) {\n  std::string manifest;\n  EXTENSION_FUNCTION_VALIDATE(args_->GetString(0, &manifest));\n\n  GURL manifest_url(manifest);\n  scoped_refptr<CannedBrowsingDataAppCacheHelper> helper(\n                                                         new CannedBrowsingDataAppCacheHelper(content::BrowserContext::GetDefaultStoragePartition(context_)\n                                                                                              ->GetAppCacheService()));\n\n  helper->DeleteAppCaches(url::Origin::Create(manifest_url));\n  return true;\n}\n\nNwAppClearCacheFunction::NwAppClearCacheFunction() {\n}\n\nNwAppClearCacheFunction::~NwAppClearCacheFunction() {\n}\n\nbool NwAppClearCacheFunction::RunNWSync(base::ListValue* response, std::string* error) {\n  content::BrowsingDataRemover* remover = content::BrowserContext::GetBrowsingDataRemover(\n      Profile::FromBrowserContext(context_));\n\n  remover->AddObserver(this);\n  remover->RemoveAndReply(base::Time(), base::Time::Max(),\n                          content::BrowsingDataRemover::DATA_TYPE_CACHE,\n                          content::BrowsingDataRemover::ORIGIN_TYPE_UNPROTECTED_WEB,\n                          this);\n  \/\/ BrowsingDataRemover deletes itself.\n  base::MessageLoopCurrent::ScopedNestableTaskAllower allow;\n\n  run_loop_.Run();\n  remover->RemoveObserver(this);\n  return true;\n}\n\nvoid NwAppClearCacheFunction::OnBrowsingDataRemoverDone() {\n  DCHECK_CURRENTLY_ON(content::BrowserThread::UI);\n  run_loop_.Quit();\n}\n\nNwAppSetProxyConfigFunction::NwAppSetProxyConfigFunction() {\n}\n\nNwAppSetProxyConfigFunction::~NwAppSetProxyConfigFunction() {\n}\n\nbool NwAppSetProxyConfigFunction::RunNWSync(base::ListValue* response, std::string* error) {\n  net::ProxyConfigWithAnnotation config;\n  std::unique_ptr<nwapi::nw__app::SetProxyConfig::Params> params(\n      nwapi::nw__app::SetProxyConfig::Params::Create(*args_));\n  EXTENSION_FUNCTION_VALIDATE(params.get());\n\n  std::string pac_url = params->pac_url.get() ? *params->pac_url : \"\";\n  if (!pac_url.empty()) {\n    if (pac_url == \"<direct>\")\n      config = net::ProxyConfigWithAnnotation::CreateDirect();\n    else if (pac_url == \"<auto>\")\n      config = net::ProxyConfigWithAnnotation(net::ProxyConfig::CreateAutoDetect(), TRAFFIC_ANNOTATION_FOR_TESTS);\n    else\n      config = net::ProxyConfigWithAnnotation(net::ProxyConfig::CreateFromCustomPacURL(GURL(pac_url)), TRAFFIC_ANNOTATION_FOR_TESTS);\n  } else {\n    std::string proxy_config;\n    net::ProxyConfig pc;\n    EXTENSION_FUNCTION_VALIDATE(args_->GetString(0, &proxy_config));\n    pc.proxy_rules().ParseFromString(proxy_config);\n    config = net::ProxyConfigWithAnnotation(pc, TRAFFIC_ANNOTATION_FOR_TESTS);\n  }\n\n  Profile* profile = Profile::FromBrowserContext(context_);\n  auto* profile_network_context =\n    ProfileNetworkContextServiceFactory::GetForContext(profile);\n  profile_network_context->UpdateProxyConfig(config);\n  return true;\n}\n\nbool NwAppGetDataPathFunction::RunNWSync(base::ListValue* response, std::string* error) {\n  response->AppendString(browser_context()->GetPath().value());\n  return true;\n}\n\nExtensionFunction::ResponseAction\nNwAppCrashBrowserFunction::Run() {\n  int* ptr = nullptr;\n  *ptr = 1;\n  return RespondNow(NoArguments());\n}\n\n\n} \/\/ namespace extensions\n<commit_msg>Fix: NW doesn't quit without open window #7298<commit_after>#include \"content\/nw\/src\/api\/nw_app_api.h\"\n\n#include \"chrome\/browser\/lifetime\/browser_close_manager.h\"\n#include \"chrome\/browser\/lifetime\/application_lifetime.h\"\n#include \"content\/public\/common\/content_features.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/memory\/ptr_util.h\"\n#include \"base\/message_loop\/message_loop_current.h\"\n#include \"base\/task\/post_task.h\"\n#include \"content\/public\/browser\/browser_task_traits.h\"\n#include \"chrome\/browser\/browsing_data\/browsing_data_appcache_helper.h\"\n#include \"chrome\/browser\/browsing_data\/browsing_data_helper.h\"\n#include \"chrome\/browser\/devtools\/devtools_window.h\"\n#include \"chrome\/browser\/extensions\/devtools_util.h\"\n#include \"chrome\/browser\/extensions\/extension_service.h\"\n#include \"chrome\/browser\/net\/profile_network_context_service.h\"\n#include \"chrome\/browser\/net\/profile_network_context_service_factory.h\"\n#include \"components\/keep_alive_registry\/keep_alive_registry.h\"\n#include \"components\/keep_alive_registry\/keep_alive_types.h\"\n#include \"content\/nw\/src\/api\/nw_app.h\"\n#include \"content\/nw\/src\/nw_base.h\"\n#include \"content\/public\/browser\/render_frame_host.h\"\n#include \"content\/public\/browser\/render_process_host.h\"\n#include \"content\/public\/browser\/render_view_host.h\"\n#include \"content\/public\/browser\/storage_partition.h\"\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"extensions\/browser\/app_window\/app_window.h\"\n#include \"extensions\/browser\/app_window\/app_window_registry.h\"\n#include \"extensions\/browser\/app_window\/native_app_window.h\"\n#include \"extensions\/browser\/extension_system.h\"\n#include \"extensions\/common\/error_utils.h\"\n#include \"net\/proxy_resolution\/proxy_config.h\"\n#include \"net\/proxy_resolution\/proxy_config_service_fixed.h\"\n#include \"net\/proxy_resolution\/proxy_resolution_service.h\"\n#include \"net\/url_request\/url_request_context.h\"\n#include \"net\/url_request\/url_request_context_getter.h\"\n#include \"net\/traffic_annotation\/network_traffic_annotation_test_helper.h\"\n\nusing namespace extensions::nwapi::nw__app;\n\nnamespace extensions {\nNwAppQuitFunction::NwAppQuitFunction() {\n\n}\n\nNwAppQuitFunction::~NwAppQuitFunction() {\n}\n\nvoid NwAppQuitFunction::DoJob(ExtensionService* service, std::string extension_id) {\n  if (base::FeatureList::IsEnabled(::features::kNWNewWin)) {\n    chrome::CloseAllBrowsersAndQuit(true);\n    \/\/ trigger BrowserProcessImpl::Unpin()\n    KeepAliveRegistry::GetInstance()->Register(KeepAliveOrigin::APP_CONTROLLER, KeepAliveRestartOption::ENABLED);\n    KeepAliveRegistry::GetInstance()->Unregister(KeepAliveOrigin::APP_CONTROLLER, KeepAliveRestartOption::ENABLED);\n    return;\n  }\n  base::ThreadTaskRunnerHandle::Get().get()->PostTask(\n                                                      FROM_HERE,\n                                                      base::Bind(&ExtensionService::TerminateExtension,\n                                                                   service->AsWeakPtr(),\n                                                                   extension_id));\n}\n\nExtensionFunction::ResponseAction\nNwAppQuitFunction::Run() {\n  ExtensionService* service =\n    ExtensionSystem::Get(browser_context())->extension_service();\n  base::ThreadTaskRunnerHandle::Get().get()->PostTask(\n        FROM_HERE,\n        base::Bind(&NwAppQuitFunction::DoJob,\n                   service,\n                   extension_id()));\n  return RespondNow(NoArguments());\n}\n\nvoid NwAppCloseAllWindowsFunction::DoJob(AppWindowRegistry* registry, std::string id) {\n  if (base::FeatureList::IsEnabled(::features::kNWNewWin)) {\n    chrome::CloseAllBrowsers();\n  }\n  AppWindowRegistry::AppWindowList windows =\n    registry->GetAppWindowsForApp(id);\n\n  for (AppWindow* window : windows) {\n    if (window->NWCanClose())\n      window->GetBaseWindow()->Close();\n  }\n}\n\nExtensionFunction::ResponseAction\nNwAppCloseAllWindowsFunction::Run() {\n  AppWindowRegistry* registry = AppWindowRegistry::Get(browser_context());\n  if (!registry)\n    return RespondNow(Error(\"\"));\n  base::ThreadTaskRunnerHandle::Get().get()->PostTask(\n        FROM_HERE,\n        base::Bind(&NwAppCloseAllWindowsFunction::DoJob, registry, extension()->id()));\n\n  return RespondNow(NoArguments());\n}\n\nNwAppGetArgvSyncFunction::NwAppGetArgvSyncFunction() {\n}\n\nNwAppGetArgvSyncFunction::~NwAppGetArgvSyncFunction() {\n}\n\nbool NwAppGetArgvSyncFunction::RunNWSync(base::ListValue* response, std::string* error) {\n\n  nw::Package* package = nw::package();\n  base::CommandLine* command_line = base::CommandLine::ForCurrentProcess();\n  base::CommandLine::StringVector args = command_line->GetArgs();\n  base::CommandLine::StringVector argv = command_line->original_argv();\n\n  \/\/ Ignore first non-switch arg if it's not a standalone package.\n  bool ignore_arg = !package->self_extract();\n  for (unsigned i = 1; i < argv.size(); ++i) {\n    if (ignore_arg && args.size() && argv[i] == args[0]) {\n      ignore_arg = false;\n      continue;\n    }\n\n    response->AppendString(argv[i]);\n  }\n  return true;\n}\n\nNwAppClearAppCacheFunction::NwAppClearAppCacheFunction() {\n}\n\nNwAppClearAppCacheFunction::~NwAppClearAppCacheFunction() {\n}\n\nbool NwAppClearAppCacheFunction::RunNWSync(base::ListValue* response, std::string* error) {\n  std::string manifest;\n  EXTENSION_FUNCTION_VALIDATE(args_->GetString(0, &manifest));\n\n  GURL manifest_url(manifest);\n  scoped_refptr<CannedBrowsingDataAppCacheHelper> helper(\n                                                         new CannedBrowsingDataAppCacheHelper(content::BrowserContext::GetDefaultStoragePartition(context_)\n                                                                                              ->GetAppCacheService()));\n\n  helper->DeleteAppCaches(url::Origin::Create(manifest_url));\n  return true;\n}\n\nNwAppClearCacheFunction::NwAppClearCacheFunction() {\n}\n\nNwAppClearCacheFunction::~NwAppClearCacheFunction() {\n}\n\nbool NwAppClearCacheFunction::RunNWSync(base::ListValue* response, std::string* error) {\n  content::BrowsingDataRemover* remover = content::BrowserContext::GetBrowsingDataRemover(\n      Profile::FromBrowserContext(context_));\n\n  remover->AddObserver(this);\n  remover->RemoveAndReply(base::Time(), base::Time::Max(),\n                          content::BrowsingDataRemover::DATA_TYPE_CACHE,\n                          content::BrowsingDataRemover::ORIGIN_TYPE_UNPROTECTED_WEB,\n                          this);\n  \/\/ BrowsingDataRemover deletes itself.\n  base::MessageLoopCurrent::ScopedNestableTaskAllower allow;\n\n  run_loop_.Run();\n  remover->RemoveObserver(this);\n  return true;\n}\n\nvoid NwAppClearCacheFunction::OnBrowsingDataRemoverDone() {\n  DCHECK_CURRENTLY_ON(content::BrowserThread::UI);\n  run_loop_.Quit();\n}\n\nNwAppSetProxyConfigFunction::NwAppSetProxyConfigFunction() {\n}\n\nNwAppSetProxyConfigFunction::~NwAppSetProxyConfigFunction() {\n}\n\nbool NwAppSetProxyConfigFunction::RunNWSync(base::ListValue* response, std::string* error) {\n  net::ProxyConfigWithAnnotation config;\n  std::unique_ptr<nwapi::nw__app::SetProxyConfig::Params> params(\n      nwapi::nw__app::SetProxyConfig::Params::Create(*args_));\n  EXTENSION_FUNCTION_VALIDATE(params.get());\n\n  std::string pac_url = params->pac_url.get() ? *params->pac_url : \"\";\n  if (!pac_url.empty()) {\n    if (pac_url == \"<direct>\")\n      config = net::ProxyConfigWithAnnotation::CreateDirect();\n    else if (pac_url == \"<auto>\")\n      config = net::ProxyConfigWithAnnotation(net::ProxyConfig::CreateAutoDetect(), TRAFFIC_ANNOTATION_FOR_TESTS);\n    else\n      config = net::ProxyConfigWithAnnotation(net::ProxyConfig::CreateFromCustomPacURL(GURL(pac_url)), TRAFFIC_ANNOTATION_FOR_TESTS);\n  } else {\n    std::string proxy_config;\n    net::ProxyConfig pc;\n    EXTENSION_FUNCTION_VALIDATE(args_->GetString(0, &proxy_config));\n    pc.proxy_rules().ParseFromString(proxy_config);\n    config = net::ProxyConfigWithAnnotation(pc, TRAFFIC_ANNOTATION_FOR_TESTS);\n  }\n\n  Profile* profile = Profile::FromBrowserContext(context_);\n  auto* profile_network_context =\n    ProfileNetworkContextServiceFactory::GetForContext(profile);\n  profile_network_context->UpdateProxyConfig(config);\n  return true;\n}\n\nbool NwAppGetDataPathFunction::RunNWSync(base::ListValue* response, std::string* error) {\n  response->AppendString(browser_context()->GetPath().value());\n  return true;\n}\n\nExtensionFunction::ResponseAction\nNwAppCrashBrowserFunction::Run() {\n  int* ptr = nullptr;\n  *ptr = 1;\n  return RespondNow(NoArguments());\n}\n\n\n} \/\/ namespace extensions\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 <Log.h>\n#include <vfs\/VFS.h>\n#include <vfs\/Directory.h>\n#include <machine\/Device.h>\n#include <machine\/Disk.h>\n#include <Module.h>\n#include <processor\/Processor.h>\n#include <linker\/Elf.h>\n#include <process\/Thread.h>\n#include <process\/Process.h>\n#include <process\/Scheduler.h>\n#include <processor\/PhysicalMemoryManager.h>\n#include <processor\/VirtualAddressSpace.h>\n#include <machine\/Machine.h>\n#include <linker\/DynamicLinker.h>\n#include <panic.h>\n#include <utilities\/assert.h>\n\n#include <kernel\/core\/BootIO.h>\n\n#include <network\/NetworkStack.h>\n#include <network\/RoutingTable.h>\n\n#include <users\/UserManager.h>\n\n#include <utilities\/TimeoutGuard.h>\n\n#include <config\/ConfigurationManager.h>\n#include <config\/MemoryBackend.h>\n\n#include <machine\/DeviceHashTree.h>\n\nextern void pedigree_init_sigret();\nextern void pedigree_init_pthreads();\n\nextern BootIO bootIO;\n\nvoid init_stage2();\n\nstatic bool probeDisk(Disk *pDisk)\n{\n    String alias; \/\/ Null - gets assigned by the filesystem.\n    static bool bRootMounted = false;\n    if (VFS::instance().mount(pDisk, alias))\n    {\n        \/\/ For mount message\n        bool didMountAsRoot = false;\n\n        \/\/ Search for the root specifier, if we haven't already mounted root\n        if (!bRootMounted)\n        {\n            NormalStaticString s;\n            s += alias;\n            s += \"»\/.pedigree-root\";\n\n            File* f = VFS::instance().find(String(static_cast<const char*>(s)));\n            if (f && !bRootMounted)\n            {\n                NOTICE(\"Mounted \" << alias << \" successfully as root.\");\n                VFS::instance().addAlias(alias, String(\"root\"));\n                bRootMounted = didMountAsRoot = true;\n            }\n        }\n\n        if(!didMountAsRoot)\n        {\n            NOTICE(\"Mounted \" << alias << \".\");\n        }\n        return false;\n    }\n    return false;\n}\n\nstatic bool findDisks(Device *pDev)\n{\n    for (unsigned int i = 0; i < pDev->getNumChildren(); i++)\n    {\n        Device *pChild = pDev->getChild(i);\n        if (pChild->getNumChildren() == 0 && \/* Only check leaf nodes. *\/\n                pChild->getType() == Device::Disk)\n        {\n            if ( probeDisk(static_cast<Disk*> (pChild)) ) return true;\n        }\n        else\n        {\n            \/\/ Recurse.\n            if (findDisks(pChild)) return true;\n        }\n    }\n    return false;\n}\n\nvoid hashesoneoneone(Device *pDev)\n{\n}\n\nvoid init()\n{\n    static HugeStaticString str;\n\n    \/\/ Mount all available filesystems.\n    if (!findDisks(&Device::root()))\n    {\n\/\/     FATAL(\"No disks found!\");\n    }\n\n    if (VFS::instance().find(String(\"raw»\/\")) == 0)\n    {\n        FATAL(\"No raw partition!\");\n    }\n\n    \/\/ Is there a root disk mounted?\n    if(VFS::instance().find(String(\"root»\/.pedigree-root\")) == 0)\n    {\n        FATAL(\"No root disk (missing .pedigree-root?)\");\n    }\n\n    \/\/ Fill out the device hash table\n    DeviceHashTree::instance().fill(&Device::root());\n\n#if 0\n    \/\/ Testing froggey's Bochs patch for magic watchpoints... -Matt\n    volatile uint32_t abc = 0;\n    NOTICE(\"Address of abc = \" << reinterpret_cast<uintptr_t>(&abc) << \"...\");\n    asm volatile(\"xchg %%cx,%%cx\" :: \"a\" (&abc));\n    abc = 0xdeadbeef;\n    abc = 0xdeadbe;\n    abc = 0xdead;\n    abc = 0xde;\n    abc = 0xd;\n    abc = 0;\n    FATAL(\"Test complete: \" << abc << \".\");\n#endif\n\n    \/\/ Initialise user\/group configuration.\n    UserManager::instance().initialise();\n\n    \/\/ Build routing tables\n    File* routeConfig = VFS::instance().find(String(\"root»\/config\/routes\"));\n    if (routeConfig)\n    {\n        NOTICE(\"Loading route table from file\");\n        \/\/\/ \\todo Write this...\n    }\n    else\n    {\n        \/\/ try to find a default configuration that can connect to the outside world\n        bool bRouteFound = false;\n        for (size_t i = 0; i < NetworkStack::instance().getNumDevices(); i++)\n        {\n            \/\/\/ \\todo Perhaps try and ping a remote host?\n            Network* card = NetworkStack::instance().getDevice(i);\n            StationInfo info = card->getStationInfo();\n\n            \/\/ If the device has a gateway, set it as the default and continue\n            if (!(info.gateway == 0) && !bRouteFound) \/\/\/ \\todo write operator !=\n            {\n                RoutingTable::instance().AddNamed(String(\"default\"), card);\n                bRouteFound = true;\n\/\/                break;\n            }\n        }\n\n        \/\/ otherwise, just assume the default is interface zero\n        if (!bRouteFound)\n            RoutingTable::instance().AddNamed(String(\"default\"), NetworkStack::instance().getDevice(0));\n    }\n\n    str += \"Loading init program (root»\/applications\/login)\\n\";\n    bootIO.write(str, BootIO::White, BootIO::Black);\n    str.clear();\n\n    \/\/ At this point we're uninterruptible, as we're forking.\n    Spinlock lock;\n    lock.acquire();\n\n    \/\/ Create a new process for the init process.\n    Process *pProcess = new Process(Processor::information().getCurrentThread()->getParent());\n    pProcess->setUser(UserManager::instance().getUser(0));\n    pProcess->setGroup(UserManager::instance().getUser(0)->getDefaultGroup());\n\n    pProcess->description().clear();\n    pProcess->description().append(\"init\");\n\n    pProcess->setCwd(VFS::instance().find(String(\"root»\/\")));\n    pProcess->setCtty(0);\n\n    new Thread(pProcess, reinterpret_cast<Thread::ThreadStartFunc>(&init_stage2), 0x0 \/* parameter *\/);\n\n    lock.release();\n}\nvoid destroy()\n{\n}\nextern void shutdown();\nvoid init_stage2()\n{\n    \/\/ Load initial program.\n    File* initProg = VFS::instance().find(String(\"root»\/applications\/TUI\"));\n    if (!initProg)\n    {\n        NOTICE(\"INIT: FileNotFound!!\");\n        initProg = VFS::instance().find(String(\"root»\/applications\/tui\"));\n        if (!initProg)\n        {\n            FATAL(\"Unable to load init program!\");\n            return;\n        }\n    }\n    NOTICE(\"INIT: File found: \" << reinterpret_cast<uintptr_t>(initProg));\n    String fname = initProg->getName();\n    NOTICE(\"INIT: name: \" << fname);\n    \/\/ That will have forked - we don't want to fork, so clear out all the chaff in the new address space that's not\n    \/\/ in the kernel address space so we have a clean slate.\n    Process *pProcess = Processor::information().getCurrentThread()->getParent();\n    pProcess->getAddressSpace()->revertToKernelAddressSpace();\n\n    DynamicLinker *pLinker = new DynamicLinker();\n    pProcess->setLinker(pLinker);\n\n    if (!pLinker->loadProgram(initProg))\n    {\n        FATAL(\"Init program failed to load!\");\n    }\n\n    for (int j = 0; j < 0x20000; j += 0x1000)\n    {\n        physical_uintptr_t phys = PhysicalMemoryManager::instance().allocatePage();\n        bool b = Processor::information().getVirtualAddressSpace().map(phys, reinterpret_cast<void*> (j+0x20000000), VirtualAddressSpace::Write);\n        if (!b)\n            WARNING(\"map() failed in init\");\n    }\n\n    \/\/ Initialise the sigret and pthreads shizzle.\n    pedigree_init_sigret();\n    pedigree_init_pthreads();\n    shutdown();\n    \/\/ Alrighty - lets create a new thread for this program - -8 as PPC assumes the previous stack frame is available...\n    \/\/new Thread(pProcess, reinterpret_cast<Thread::ThreadStartFunc>(pLinker->getProgramElf()->getEntryPoint()), 0x0 \/* parameter *\/,  reinterpret_cast<void*>(0x20020000-8) \/* Stack *\/);\n}\n\nMODULE_NAME(\"init\");\nMODULE_ENTRY(&init);\nMODULE_EXIT(&destroy);\n#ifdef X86_COMMON\nMODULE_DEPENDS(\"VFS\", \"ext2\", \"posix\", \"partition\", \"TUI\", \"linker\", \"vbe\", \"NetworkStack\", \"users\", \"rawfs\");\n#elif PPC_COMMON\nMODULE_DEPENDS(\"VFS\", \"ext2\", \"posix\", \"partition\", \"TUI\", \"linker\", \"NetworkStack\", \"users\");\n#endif\n\n<commit_msg>init module has the shutdown test code #if 0'd out<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 <Log.h>\n#include <vfs\/VFS.h>\n#include <vfs\/Directory.h>\n#include <machine\/Device.h>\n#include <machine\/Disk.h>\n#include <Module.h>\n#include <processor\/Processor.h>\n#include <linker\/Elf.h>\n#include <process\/Thread.h>\n#include <process\/Process.h>\n#include <process\/Scheduler.h>\n#include <processor\/PhysicalMemoryManager.h>\n#include <processor\/VirtualAddressSpace.h>\n#include <machine\/Machine.h>\n#include <linker\/DynamicLinker.h>\n#include <panic.h>\n#include <utilities\/assert.h>\n\n#include <kernel\/core\/BootIO.h>\n\n#include <network\/NetworkStack.h>\n#include <network\/RoutingTable.h>\n\n#include <users\/UserManager.h>\n\n#include <utilities\/TimeoutGuard.h>\n\n#include <config\/ConfigurationManager.h>\n#include <config\/MemoryBackend.h>\n\n#include <machine\/DeviceHashTree.h>\n\nextern void pedigree_init_sigret();\nextern void pedigree_init_pthreads();\n\nextern BootIO bootIO;\n\nvoid init_stage2();\n\nstatic bool probeDisk(Disk *pDisk)\n{\n    String alias; \/\/ Null - gets assigned by the filesystem.\n    static bool bRootMounted = false;\n    if (VFS::instance().mount(pDisk, alias))\n    {\n        \/\/ For mount message\n        bool didMountAsRoot = false;\n\n        \/\/ Search for the root specifier, if we haven't already mounted root\n        if (!bRootMounted)\n        {\n            NormalStaticString s;\n            s += alias;\n            s += \"»\/.pedigree-root\";\n\n            File* f = VFS::instance().find(String(static_cast<const char*>(s)));\n            if (f && !bRootMounted)\n            {\n                NOTICE(\"Mounted \" << alias << \" successfully as root.\");\n                VFS::instance().addAlias(alias, String(\"root\"));\n                bRootMounted = didMountAsRoot = true;\n            }\n        }\n\n        if(!didMountAsRoot)\n        {\n            NOTICE(\"Mounted \" << alias << \".\");\n        }\n        return false;\n    }\n    return false;\n}\n\nstatic bool findDisks(Device *pDev)\n{\n    for (unsigned int i = 0; i < pDev->getNumChildren(); i++)\n    {\n        Device *pChild = pDev->getChild(i);\n        if (pChild->getNumChildren() == 0 && \/* Only check leaf nodes. *\/\n                pChild->getType() == Device::Disk)\n        {\n            if ( probeDisk(static_cast<Disk*> (pChild)) ) return true;\n        }\n        else\n        {\n            \/\/ Recurse.\n            if (findDisks(pChild)) return true;\n        }\n    }\n    return false;\n}\n\nvoid hashesoneoneone(Device *pDev)\n{\n}\n\nvoid init()\n{\n    static HugeStaticString str;\n\n    \/\/ Mount all available filesystems.\n    if (!findDisks(&Device::root()))\n    {\n\/\/     FATAL(\"No disks found!\");\n    }\n\n    if (VFS::instance().find(String(\"raw»\/\")) == 0)\n    {\n        FATAL(\"No raw partition!\");\n    }\n\n    \/\/ Is there a root disk mounted?\n    if(VFS::instance().find(String(\"root»\/.pedigree-root\")) == 0)\n    {\n        FATAL(\"No root disk (missing .pedigree-root?)\");\n    }\n\n    \/\/ Fill out the device hash table\n    DeviceHashTree::instance().fill(&Device::root());\n\n#if 0\n    \/\/ Testing froggey's Bochs patch for magic watchpoints... -Matt\n    volatile uint32_t abc = 0;\n    NOTICE(\"Address of abc = \" << reinterpret_cast<uintptr_t>(&abc) << \"...\");\n    asm volatile(\"xchg %%cx,%%cx\" :: \"a\" (&abc));\n    abc = 0xdeadbeef;\n    abc = 0xdeadbe;\n    abc = 0xdead;\n    abc = 0xde;\n    abc = 0xd;\n    abc = 0;\n    FATAL(\"Test complete: \" << abc << \".\");\n#endif\n\n    \/\/ Initialise user\/group configuration.\n    UserManager::instance().initialise();\n\n    \/\/ Build routing tables\n    File* routeConfig = VFS::instance().find(String(\"root»\/config\/routes\"));\n    if (routeConfig)\n    {\n        NOTICE(\"Loading route table from file\");\n        \/\/\/ \\todo Write this...\n    }\n    else\n    {\n        \/\/ try to find a default configuration that can connect to the outside world\n        bool bRouteFound = false;\n        for (size_t i = 0; i < NetworkStack::instance().getNumDevices(); i++)\n        {\n            \/\/\/ \\todo Perhaps try and ping a remote host?\n            Network* card = NetworkStack::instance().getDevice(i);\n            StationInfo info = card->getStationInfo();\n\n            \/\/ If the device has a gateway, set it as the default and continue\n            if (!(info.gateway == 0) && !bRouteFound) \/\/\/ \\todo write operator !=\n            {\n                RoutingTable::instance().AddNamed(String(\"default\"), card);\n                bRouteFound = true;\n\/\/                break;\n            }\n        }\n\n        \/\/ otherwise, just assume the default is interface zero\n        if (!bRouteFound)\n            RoutingTable::instance().AddNamed(String(\"default\"), NetworkStack::instance().getDevice(0));\n    }\n\n    str += \"Loading init program (root»\/applications\/login)\\n\";\n    bootIO.write(str, BootIO::White, BootIO::Black);\n    str.clear();\n\n    \/\/ At this point we're uninterruptible, as we're forking.\n    Spinlock lock;\n    lock.acquire();\n\n    \/\/ Create a new process for the init process.\n    Process *pProcess = new Process(Processor::information().getCurrentThread()->getParent());\n    pProcess->setUser(UserManager::instance().getUser(0));\n    pProcess->setGroup(UserManager::instance().getUser(0)->getDefaultGroup());\n\n    pProcess->description().clear();\n    pProcess->description().append(\"init\");\n\n    pProcess->setCwd(VFS::instance().find(String(\"root»\/\")));\n    pProcess->setCtty(0);\n\n    new Thread(pProcess, reinterpret_cast<Thread::ThreadStartFunc>(&init_stage2), 0x0 \/* parameter *\/);\n\n    lock.release();\n}\nvoid destroy()\n{\n}\n\n#if 0\nextern void shutdown();\n#endif\n\nvoid init_stage2()\n{\n    \/\/ Load initial program.\n    File* initProg = VFS::instance().find(String(\"root»\/applications\/TUI\"));\n    if (!initProg)\n    {\n        NOTICE(\"INIT: FileNotFound!!\");\n        initProg = VFS::instance().find(String(\"root»\/applications\/tui\"));\n        if (!initProg)\n        {\n            FATAL(\"Unable to load init program!\");\n            return;\n        }\n    }\n    NOTICE(\"INIT: File found: \" << reinterpret_cast<uintptr_t>(initProg));\n    String fname = initProg->getName();\n    NOTICE(\"INIT: name: \" << fname);\n    \/\/ That will have forked - we don't want to fork, so clear out all the chaff in the new address space that's not\n    \/\/ in the kernel address space so we have a clean slate.\n    Process *pProcess = Processor::information().getCurrentThread()->getParent();\n    pProcess->getAddressSpace()->revertToKernelAddressSpace();\n\n    DynamicLinker *pLinker = new DynamicLinker();\n    pProcess->setLinker(pLinker);\n\n    if (!pLinker->loadProgram(initProg))\n    {\n        FATAL(\"Init program failed to load!\");\n    }\n\n    for (int j = 0; j < 0x20000; j += 0x1000)\n    {\n        physical_uintptr_t phys = PhysicalMemoryManager::instance().allocatePage();\n        bool b = Processor::information().getVirtualAddressSpace().map(phys, reinterpret_cast<void*> (j+0x20000000), VirtualAddressSpace::Write);\n        if (!b)\n            WARNING(\"map() failed in init\");\n    }\n\n    \/\/ Initialise the sigret and pthreads shizzle.\n    pedigree_init_sigret();\n    pedigree_init_pthreads();\n\n#if 0\n    shutdown();\n#endif\n\n    \/\/ Alrighty - lets create a new thread for this program - -8 as PPC assumes the previous stack frame is available...\n    new Thread(pProcess, reinterpret_cast<Thread::ThreadStartFunc>(pLinker->getProgramElf()->getEntryPoint()), 0x0 \/* parameter *\/,  reinterpret_cast<void*>(0x20020000-8) \/* Stack *\/);\n}\n\nMODULE_NAME(\"init\");\nMODULE_ENTRY(&init);\nMODULE_EXIT(&destroy);\n#ifdef X86_COMMON\nMODULE_DEPENDS(\"VFS\", \"ext2\", \"posix\", \"partition\", \"TUI\", \"linker\", \"vbe\", \"NetworkStack\", \"users\", \"rawfs\");\n#elif PPC_COMMON\nMODULE_DEPENDS(\"VFS\", \"ext2\", \"posix\", \"partition\", \"TUI\", \"linker\", \"NetworkStack\", \"users\");\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/*===========================================================================*\\\n *                                                                           *\n *                               OpenMesh                                    *\n *      Copyright (C) 2001-2009 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\/** \\file NumLimitsT.hh\n    Temporary solution until std::numeric_limits is standard.\n *\/\n\n\/\/=============================================================================\n\/\/\n\/\/  CLASS NumLimitsT\n\/\/\n\/\/=============================================================================\n\n#ifndef OPENMESH_UTILS_NUMLIMITS_HH\n#define OPENMESH_UTILS_NUMLIMITS_HH\n\n\n\/\/== INCLUDES =================================================================\n\n#include \"Config.hh\"\n#include <limits.h>\n#include <float.h>\n\n\n\/\/== NAMESPEACES ==============================================================\n\nnamespace OpenMesh { \/\/ BEGIN_NS_OPENMESH\nnamespace Utils { \/\/ BEGIN_NS_UTILS\n\n\n\/\/== CLASS DEFINITION =========================================================\n\n\n\/** \\class NumLimitsT NumLimitsT.hh <OpenMesh\/Utils\/NumLimitsT.hh\n\n    This class provides the maximum and minimum values a certain\n    scalar type (\\cint, \\c float, or \\double) can store. You can\n    use it like this:\n    \\code\n    #include <OpenMesh\/Utils\/NumLimitsT.hh>\n\n    int   float_min   = OpenMesh::NumLimitsT<float>::min();\n    float double_max  = OpenMesh::NumLimitsT<double>::max();\n    \\endcode\n    \n    \\note This functionality should be provided by\n    std::numeric_limits.  This template does not exist on gcc <=\n    2.95.3. The class template NumLimitsT is just a workaround.\n**\/\ntemplate <typename Scalar>\nclass NumLimitsT\n{\npublic:\n  \/\/\/ Return the smallest \\em absolte value a scalar type can store.\n  static inline Scalar min() { return 0; }\n  \/\/\/ Return the maximum \\em absolte value a scalar type can store.\n  static inline Scalar max() { return 0; }\n\n  static inline bool   is_float()   { return false; }\n  static inline bool   is_integer() { return !NumLimitsT<Scalar>::is_float(); }\n  static inline bool   is_signed()  { return true; }\n};\n\n  \/\/ is_float\n\ntemplate<> \ninline bool NumLimitsT<float>::is_float() { return true; }\n\ntemplate<> \ninline bool NumLimitsT<double>::is_float() { return true; }\n\ntemplate<> \ninline bool NumLimitsT<long double>::is_float() { return true; }\n\n  \/\/ is_signed\n\ntemplate<> \ninline bool NumLimitsT<unsigned char>::is_signed() { return false; }\n\ntemplate<> \ninline bool NumLimitsT<unsigned short>::is_signed() { return false; }\n\ntemplate<> \ninline bool NumLimitsT<unsigned int>::is_signed() { return false; }\n\ntemplate<> \ninline bool NumLimitsT<unsigned long>::is_signed() { return false; }\n\ntemplate<> \ninline bool NumLimitsT<unsigned long long>::is_signed() { return false; }\n\n  \/\/ min\/max\ntemplate<> inline int  NumLimitsT<int>::min() { return INT_MIN; }\ntemplate<> inline int  NumLimitsT<int>::max() { return INT_MAX; }\n\ntemplate<> inline float NumLimitsT<float>::min() { return FLT_MIN; }\ntemplate<> inline float NumLimitsT<float>::max() { return FLT_MAX; }\n\ntemplate<> inline double NumLimitsT<double>::min() { return DBL_MIN; }\ntemplate<> inline double NumLimitsT<double>::max() { return DBL_MAX; }\n\n\n\/\/=============================================================================\n} \/\/ END_NS_UTILS\n} \/\/ END_NS_OPENMESH\n\/\/=============================================================================\n#endif \/\/ OPENMESH_NUMLIMITS_HH defined\n\/\/=============================================================================\n\n<commit_msg>Corrected doc that caused doxygen warning<commit_after>\/*===========================================================================*\\\n *                                                                           *\n *                               OpenMesh                                    *\n *      Copyright (C) 2001-2009 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\/** \\file NumLimitsT.hh\n    Temporary solution until std::numeric_limits is standard.\n *\/\n\n\/\/=============================================================================\n\/\/\n\/\/  CLASS NumLimitsT\n\/\/\n\/\/=============================================================================\n\n#ifndef OPENMESH_UTILS_NUMLIMITS_HH\n#define OPENMESH_UTILS_NUMLIMITS_HH\n\n\n\/\/== INCLUDES =================================================================\n\n#include \"Config.hh\"\n#include <limits.h>\n#include <float.h>\n\n\n\/\/== NAMESPEACES ==============================================================\n\nnamespace OpenMesh { \/\/ BEGIN_NS_OPENMESH\nnamespace Utils { \/\/ BEGIN_NS_UTILS\n\n\n\/\/== CLASS DEFINITION =========================================================\n\n\n\/** \\class NumLimitsT NumLimitsT.hh <OpenMesh\/Utils\/NumLimitsT.hh\n\n    This class provides the maximum and minimum values a certain\n    scalar type (\\c int, \\c float, or \\c double) can store. You can\n    use it like this:\n    \\code\n    #include <OpenMesh\/Utils\/NumLimitsT.hh>\n\n    int   float_min   = OpenMesh::NumLimitsT<float>::min();\n    float double_max  = OpenMesh::NumLimitsT<double>::max();\n    \\endcode\n    \n    \\note This functionality should be provided by\n    std::numeric_limits.  This template does not exist on gcc <=\n    2.95.3. The class template NumLimitsT is just a workaround.\n**\/\ntemplate <typename Scalar>\nclass NumLimitsT\n{\npublic:\n  \/\/\/ Return the smallest \\em absolte value a scalar type can store.\n  static inline Scalar min() { return 0; }\n  \/\/\/ Return the maximum \\em absolte value a scalar type can store.\n  static inline Scalar max() { return 0; }\n\n  static inline bool   is_float()   { return false; }\n  static inline bool   is_integer() { return !NumLimitsT<Scalar>::is_float(); }\n  static inline bool   is_signed()  { return true; }\n};\n\n  \/\/ is_float\n\ntemplate<> \ninline bool NumLimitsT<float>::is_float() { return true; }\n\ntemplate<> \ninline bool NumLimitsT<double>::is_float() { return true; }\n\ntemplate<> \ninline bool NumLimitsT<long double>::is_float() { return true; }\n\n  \/\/ is_signed\n\ntemplate<> \ninline bool NumLimitsT<unsigned char>::is_signed() { return false; }\n\ntemplate<> \ninline bool NumLimitsT<unsigned short>::is_signed() { return false; }\n\ntemplate<> \ninline bool NumLimitsT<unsigned int>::is_signed() { return false; }\n\ntemplate<> \ninline bool NumLimitsT<unsigned long>::is_signed() { return false; }\n\ntemplate<> \ninline bool NumLimitsT<unsigned long long>::is_signed() { return false; }\n\n  \/\/ min\/max\ntemplate<> inline int  NumLimitsT<int>::min() { return INT_MIN; }\ntemplate<> inline int  NumLimitsT<int>::max() { return INT_MAX; }\n\ntemplate<> inline float NumLimitsT<float>::min() { return FLT_MIN; }\ntemplate<> inline float NumLimitsT<float>::max() { return FLT_MAX; }\n\ntemplate<> inline double NumLimitsT<double>::min() { return DBL_MIN; }\ntemplate<> inline double NumLimitsT<double>::max() { return DBL_MAX; }\n\n\n\/\/=============================================================================\n} \/\/ END_NS_UTILS\n} \/\/ END_NS_OPENMESH\n\/\/=============================================================================\n#endif \/\/ OPENMESH_NUMLIMITS_HH defined\n\/\/=============================================================================\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#include <typeinfo>\n#include <iostream>\n\n#include \"types\/root_typemanager.h\"\n#include \"types\/typeops.h\"\n#include \"system\/globalenv.h\"\n\n#include \"context\/static_context.h\"\n\n#include \"compiler\/api\/compilercb.h\"\n#include \"compiler\/normalizer\/normalizer.h\"\n#include \"compiler\/expression\/expr.h\"\n#include \"compiler\/expression\/fo_expr.h\"\n#include \"compiler\/expression\/var_expr.h\"\n#include \"compiler\/expression\/flwor_expr.h\"\n#include \"compiler\/expression\/path_expr.h\"\n#include \"compiler\/expression\/expr_visitor.h\"\n\n#include \"functions\/signature.h\"\n#include \"functions\/function.h\"\n#include \"functions\/library.h\"\n\n\nnamespace zorba \n{\n\n\nstatic inline expr::expr_t wrap_in_atomization(\n    short context,\n    expr::expr_t e)\n{\n  fo_expr_t fo = new fo_expr(context, e->get_loc(), GET_BUILTIN_FUNCTION(FN_DATA_1), e);\n  return fo.getp();\n}\n\n\nstatic inline expr::expr_t wrap_in_type_conversion(\n    short context,\n    expr::expr_t e,\n    xqtref_t type)\n{\n  expr::expr_t ph = new promote_expr(context, e->get_loc(), e, type);\n  \/\/ TODO : Need to add convert_simple_operand\n  return ph;\n}\n\n\nstatic inline expr::expr_t wrap_in_typematch(\n    short context, \n    expr::expr_t e,\n    xqtref_t type)\n{\n  \/\/ treat_expr should be avoided for updating expressions too,\n  \/\/ but in that case \"type\" will be item()* anyway\n  return TypeOps::is_subtype(*GENV_TYPESYSTEM.ITEM_TYPE_STAR, *type)\n    ? e\n    : new treat_expr(context, e->get_loc(), e, type, XPTY0004);\n}\n\n\n#if 0\n\nstatic inline void checkNonUpdating(const expr* lExpr)\n{\n  if (lExpr != 0 && lExpr->is_updating())\n    ZORBA_ERROR_LOC(XUST0001, lExpr->get_loc());\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\nclass normalizer : public expr_visitor \n{\n  CompilerCB   * m_cb;\n\npublic:\n  normalizer(CompilerCB* aCompilerCB) : m_cb(aCompilerCB) {}\n\n  ~normalizer() { }\n\n#define DEF_VISIT_METHODS( e )                  \\\n  bool begin_visit(e& node) { return true; }    \\\n  void end_visit(e& node) {}\n\nDEF_VISIT_METHODS (expr)\n\nDEF_VISIT_METHODS (debugger_expr)\n\nDEF_VISIT_METHODS (wrapper_expr)\n\nDEF_VISIT_METHODS (sequential_expr)\n\nDEF_VISIT_METHODS (var_expr)\n\nDEF_VISIT_METHODS (order_modifier)\n\nDEF_VISIT_METHODS (eval_expr)\n\n\n\nbool begin_visit(flwor_expr& node) \n{\n  return true;\n}\n\n\nvoid end_visit(flwor_expr& node)\n{\n}\n\n\nvoid end_visit (promote_expr&) \n{\n}\n\nbool begin_visit (promote_expr& node)\n{\n  checkNonUpdating(&*node.get_input());\n  return true;\n}\n\n\nvoid end_visit (trycatch_expr&) \n{\n}\n\nbool begin_visit (trycatch_expr& node)\n{\n  checkNonUpdating(&*node.get_try_expr());\n  return true;\n}\n\n\nvoid end_visit (if_expr&)\n{\n}\n\nbool begin_visit(if_expr& node)\n{\n  return true;\n}\n\n\nvoid end_visit (fo_expr&) \n{\n}\n\nbool begin_visit (fo_expr& node)\n{\n  return true;\n}\n\n\nvoid end_visit (instanceof_expr&) \n{\n}\n\nbool begin_visit (instanceof_expr& node)\n{\n  checkNonUpdating(&*node.get_input());\n  return true;\n}\n\n\nDEF_VISIT_METHODS (treat_expr)\n\n\nvoid end_visit (castable_expr&) \n{\n}\n\nbool begin_visit (castable_expr& node)\n{\n  checkNonUpdating(&*node.get_input());\n  return true;\n}\n\n\nvoid end_visit (cast_expr&) \n{\n}\n\nbool begin_visit (cast_expr& node)\n{\n  checkNonUpdating(&*node.get_input());\n  return true;\n}\n\n\nvoid end_visit (name_cast_expr&) \n{\n}\n\nbool begin_visit (name_cast_expr& node)\n{\n  checkNonUpdating(&*node.get_input());\n  return true;\n}\n\n\nvoid end_visit (validate_expr&) \n{\n}\n\nbool begin_visit (validate_expr& node)\n{\n  checkNonUpdating(&*node.get_expr());\n  return true;\n}\n\n\nvoid end_visit (extension_expr&) \n{\n}\n\nbool begin_visit (extension_expr& node)\n{\n  checkNonUpdating(&*node.get_expr());\n  return true;\n}\n\n\nDEF_VISIT_METHODS (relpath_expr)\nDEF_VISIT_METHODS (axis_step_expr)\nDEF_VISIT_METHODS (match_expr)\nDEF_VISIT_METHODS (const_expr)\nDEF_VISIT_METHODS (order_expr)\n\n\nvoid end_visit (elem_expr&) \n{\n}\n\nbool begin_visit (elem_expr& node)\n{\n  \/\/node.setQNameExpr(wrap_in_atomization(m_sctx, node.getQNameExpr()));\n  checkNonUpdating(&*node.getQNameExpr());\n  checkNonUpdating(&*node.getAttrs());\n  checkNonUpdating(&*node.getContent());\n  return true;\n}\n\n\nvoid end_visit (doc_expr&) \n{\n}\n\nbool begin_visit (doc_expr& node)\n{\n  checkNonUpdating(node.getContent());\n  return true;\n}\n\n\nvoid end_visit (attr_expr&) \n{\n}\n\nbool begin_visit (attr_expr& node)\n{\n  assert (node.getQNameExpr() != NULL);\n\n  checkNonUpdating(&*node.getQNameExpr());\n  checkNonUpdating(&*node.getValueExpr());\n\n  return true;\n}\n\n\nvoid end_visit (text_expr&) \n{\n}\n\nbool begin_visit (text_expr& node)\n{\n  checkNonUpdating(&*node.get_text());\n  return true;\n}\n\n\nvoid end_visit (pi_expr&) \n{\n}\n\nbool begin_visit (pi_expr& node)\n{\n  checkNonUpdating(&*node.get_target_expr());\n  return true;\n}\n\n\nDEF_VISIT_METHODS (insert_expr)\nDEF_VISIT_METHODS (delete_expr)\nDEF_VISIT_METHODS (rename_expr)\nDEF_VISIT_METHODS (replace_expr)\nDEF_VISIT_METHODS (transform_expr)\n\nDEF_VISIT_METHODS (exit_expr)\nDEF_VISIT_METHODS (while_expr)\nDEF_VISIT_METHODS (flowctl_expr)\n\nDEF_VISIT_METHODS (function_def_expr)\n\n\/\/DEF_VISIT_METHODS (ftcontains_expr)\n\n};\n\n#endif\n\n\nvoid normalize_expr_tree(\n    const char* norm_descr,\n    CompilerCB* aCompilerCB,\n    expr_t& root,\n    const XQType* rType) \n{\n  \/\/normalizer n(aCompilerCB);\n\n  \/\/root->accept(n);\n\n  if (rType != NULL)\n  {\n    if (TypeOps::is_builtin_simple(*rType)) \n    {\n      root = wrap_in_atomization(root->get_sctx_id(), root);\n      root = wrap_in_type_conversion(root->get_sctx_id(), root, rType);\n    }\n    else \n    {\n      root = wrap_in_typematch(root->get_sctx_id(), root, rType);\n    }\n  }\n\n  if (aCompilerCB->theConfig.normalize_cb)\n    aCompilerCB->theConfig.normalize_cb (&*root, norm_descr);\n}\n\n}\n\n\/* vim:set ts=2 sw=2: *\/\n<commit_msg>Removed commented-out code.<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#include <typeinfo>\n#include <iostream>\n\n#include \"types\/root_typemanager.h\"\n#include \"types\/typeops.h\"\n#include \"system\/globalenv.h\"\n\n#include \"context\/static_context.h\"\n\n#include \"compiler\/api\/compilercb.h\"\n#include \"compiler\/normalizer\/normalizer.h\"\n#include \"compiler\/expression\/expr.h\"\n#include \"compiler\/expression\/fo_expr.h\"\n#include \"compiler\/expression\/var_expr.h\"\n#include \"compiler\/expression\/flwor_expr.h\"\n#include \"compiler\/expression\/path_expr.h\"\n#include \"compiler\/expression\/expr_visitor.h\"\n\n#include \"functions\/signature.h\"\n#include \"functions\/function.h\"\n#include \"functions\/library.h\"\n\n\nnamespace zorba \n{\n\n\nstatic inline expr::expr_t wrap_in_atomization(\n    short context,\n    expr::expr_t e)\n{\n  fo_expr_t fo = new fo_expr(context, e->get_loc(), GET_BUILTIN_FUNCTION(FN_DATA_1), e);\n  return fo.getp();\n}\n\n\nstatic inline expr::expr_t wrap_in_type_conversion(\n    short context,\n    expr::expr_t e,\n    xqtref_t type)\n{\n  expr::expr_t ph = new promote_expr(context, e->get_loc(), e, type);\n  \/\/ TODO : Need to add convert_simple_operand\n  return ph;\n}\n\n\nstatic inline expr::expr_t wrap_in_typematch(\n    short context, \n    expr::expr_t e,\n    xqtref_t type)\n{\n  \/\/ treat_expr should be avoided for updating expressions too,\n  \/\/ but in that case \"type\" will be item()* anyway\n  return TypeOps::is_subtype(*GENV_TYPESYSTEM.ITEM_TYPE_STAR, *type)\n    ? e\n    : new treat_expr(context, e->get_loc(), e, type, XPTY0004);\n}\n\n\n#if 0\n\nstatic inline void checkNonUpdating(const expr* lExpr)\n{\n  if (lExpr != 0 && lExpr->is_updating())\n    ZORBA_ERROR_LOC(XUST0001, lExpr->get_loc());\n}\n\n\n\/*******************************************************************************\n\n********************************************************************************\/\nclass normalizer : public expr_visitor \n{\n  CompilerCB   * m_cb;\n\npublic:\n  normalizer(CompilerCB* aCompilerCB) : m_cb(aCompilerCB) {}\n\n  ~normalizer() { }\n\n#define DEF_VISIT_METHODS( e )                  \\\n  bool begin_visit(e& node) { return true; }    \\\n  void end_visit(e& node) {}\n\nDEF_VISIT_METHODS (expr)\n\nDEF_VISIT_METHODS (debugger_expr)\n\nDEF_VISIT_METHODS (wrapper_expr)\n\nDEF_VISIT_METHODS (sequential_expr)\n\nDEF_VISIT_METHODS (var_expr)\n\nDEF_VISIT_METHODS (order_modifier)\n\nDEF_VISIT_METHODS (eval_expr)\n\n\n\nbool begin_visit(flwor_expr& node) \n{\n  return true;\n}\n\n\nvoid end_visit(flwor_expr& node)\n{\n}\n\n\nvoid end_visit (promote_expr&) \n{\n}\n\nbool begin_visit (promote_expr& node)\n{\n  checkNonUpdating(&*node.get_input());\n  return true;\n}\n\n\nvoid end_visit (trycatch_expr&) \n{\n}\n\nbool begin_visit (trycatch_expr& node)\n{\n  checkNonUpdating(&*node.get_try_expr());\n  return true;\n}\n\n\nvoid end_visit (if_expr&)\n{\n}\n\nbool begin_visit(if_expr& node)\n{\n  return true;\n}\n\n\nvoid end_visit (fo_expr&) \n{\n}\n\nbool begin_visit (fo_expr& node)\n{\n  return true;\n}\n\n\nvoid end_visit (instanceof_expr&) \n{\n}\n\nbool begin_visit (instanceof_expr& node)\n{\n  checkNonUpdating(&*node.get_input());\n  return true;\n}\n\n\nDEF_VISIT_METHODS (treat_expr)\n\n\nvoid end_visit (castable_expr&) \n{\n}\n\nbool begin_visit (castable_expr& node)\n{\n  checkNonUpdating(&*node.get_input());\n  return true;\n}\n\n\nvoid end_visit (cast_expr&) \n{\n}\n\nbool begin_visit (cast_expr& node)\n{\n  checkNonUpdating(&*node.get_input());\n  return true;\n}\n\n\nvoid end_visit (name_cast_expr&) \n{\n}\n\nbool begin_visit (name_cast_expr& node)\n{\n  checkNonUpdating(&*node.get_input());\n  return true;\n}\n\n\nvoid end_visit (validate_expr&) \n{\n}\n\nbool begin_visit (validate_expr& node)\n{\n  checkNonUpdating(&*node.get_expr());\n  return true;\n}\n\n\nvoid end_visit (extension_expr&) \n{\n}\n\nbool begin_visit (extension_expr& node)\n{\n  checkNonUpdating(&*node.get_expr());\n  return true;\n}\n\n\nDEF_VISIT_METHODS (relpath_expr)\nDEF_VISIT_METHODS (axis_step_expr)\nDEF_VISIT_METHODS (match_expr)\nDEF_VISIT_METHODS (const_expr)\nDEF_VISIT_METHODS (order_expr)\n\n\nvoid end_visit (elem_expr&) \n{\n}\n\nbool begin_visit (elem_expr& node)\n{\n  \/\/node.setQNameExpr(wrap_in_atomization(m_sctx, node.getQNameExpr()));\n  checkNonUpdating(&*node.getQNameExpr());\n  checkNonUpdating(&*node.getAttrs());\n  checkNonUpdating(&*node.getContent());\n  return true;\n}\n\n\nvoid end_visit (doc_expr&) \n{\n}\n\nbool begin_visit (doc_expr& node)\n{\n  checkNonUpdating(node.getContent());\n  return true;\n}\n\n\nvoid end_visit (attr_expr&) \n{\n}\n\nbool begin_visit (attr_expr& node)\n{\n  assert (node.getQNameExpr() != NULL);\n\n  checkNonUpdating(&*node.getQNameExpr());\n  checkNonUpdating(&*node.getValueExpr());\n\n  return true;\n}\n\n\nvoid end_visit (text_expr&) \n{\n}\n\nbool begin_visit (text_expr& node)\n{\n  checkNonUpdating(&*node.get_text());\n  return true;\n}\n\n\nvoid end_visit (pi_expr&) \n{\n}\n\nbool begin_visit (pi_expr& node)\n{\n  checkNonUpdating(&*node.get_target_expr());\n  return true;\n}\n\n\nDEF_VISIT_METHODS (insert_expr)\nDEF_VISIT_METHODS (delete_expr)\nDEF_VISIT_METHODS (rename_expr)\nDEF_VISIT_METHODS (replace_expr)\nDEF_VISIT_METHODS (transform_expr)\n\nDEF_VISIT_METHODS (exit_expr)\nDEF_VISIT_METHODS (while_expr)\nDEF_VISIT_METHODS (flowctl_expr)\n\nDEF_VISIT_METHODS (function_def_expr)\n\n};\n\n#endif\n\n\nvoid normalize_expr_tree(\n    const char* norm_descr,\n    CompilerCB* aCompilerCB,\n    expr_t& root,\n    const XQType* rType) \n{\n  \/\/normalizer n(aCompilerCB);\n\n  \/\/root->accept(n);\n\n  if (rType != NULL)\n  {\n    if (TypeOps::is_builtin_simple(*rType)) \n    {\n      root = wrap_in_atomization(root->get_sctx_id(), root);\n      root = wrap_in_type_conversion(root->get_sctx_id(), root, rType);\n    }\n    else \n    {\n      root = wrap_in_typematch(root->get_sctx_id(), root, rType);\n    }\n  }\n\n  if (aCompilerCB->theConfig.normalize_cb)\n    aCompilerCB->theConfig.normalize_cb (&*root, norm_descr);\n}\n\n}\n\n\/* vim:set ts=2 sw=2: *\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"stdafx.h\"\n#include \"SettingsRegistryStorage.h\"\n\nvoid CSettingsRegistryStorage::ReadUiSettings(CSettings& settings) noexcept\n{\n    settings = CSettings();\n\n    if (OpenRegistryForReading() != TRUE)\n    {\n        return;\n    }\n\n    POINTS topLeftPoint;\n    if (TryReadTopLeftPosition(topLeftPoint))\n    {\n        settings.SetTopLeftWindowPositionCoordinates(topLeftPoint);\n    }\n\n    TimerType timerType;\n    if (TryReadTimerType(timerType))\n    {\n        settings.SetTimerType(timerType);\n    }\n\n    unsigned short shortValue;\n    if (TryReadTimerTypeInHours(shortValue))\n    {\n        settings.SetTimerTypeInHours(shortValue);\n    }\n\n    if (TryReadTimerTypeInMinutes(shortValue))\n    {\n        settings.SetTimerTypeInMinutes(shortValue);\n    }\n\n    if (TryReadTimerTypeAtHours(shortValue))\n    {\n        settings.SetTimerTypeAtHours(shortValue);\n    }\n\n    if (TryReadTimerTypeAtMinutes(shortValue))\n    {\n        settings.SetTimerTypeAtMinutes(shortValue);\n    }\n\n    PowerOffType powerOffType;\n    if (TryReadPowerOffType(powerOffType))\n    {\n        settings.SetPowerOffType(powerOffType);\n    }\n}\n\nvoid CSettingsRegistryStorage::WriteUiSettings(const CSettings& settings) noexcept\n{\n    auto result = OpenRegistryForWriting();\n    ATLASSERT(result == TRUE);\n    if (result != TRUE)\n    {\n        return;\n    }\n\n    result = TryWriteTopLeftPosition(settings.GetTopLeftWindowPosition());\n    ATLASSERT(result == TRUE);\n\n    result = TryWriteTimerType(settings.GetTimerType());\n    ATLASSERT(result == TRUE);\n\n    result = TryWriteTimerTypeInHours(settings.GetTimerTypeInHours());\n    ATLASSERT(result == TRUE);\n\n    result = TryWriteTimerTypeInMinutes(settings.GetTimerTypeInMinutes());\n    ATLASSERT(result == TRUE);\n\n    result = TryWriteTimerTypeAtHours(settings.GetTimerTypeAtHours());\n    ATLASSERT(result == TRUE);\n\n    result = TryWriteTimerTypeAtMinutes(settings.GetTimerTypeAtMinutes());\n    ATLASSERT(result == TRUE);\n\n    result = TryWritePowerOffType(settings.GetPowerOffType());\n    ATLASSERT(result == TRUE);\n}\n\nBOOL CSettingsRegistryStorage::OpenRegistryForReading()\n{\n    const auto status = m_regKey.OpenCurrentUserKeyForReading(SLEEP_TIMER_REG_KEY);\n\n    auto const retVal = StatusToBool(status);\n\n    return retVal;\n}\n\nBOOL CSettingsRegistryStorage::OpenRegistryForWriting()\n{\n    const auto status = m_regKey.OpenCurrentUserKeyForWriting(\n        SLEEP_TIMER_REG_KEY,\n        TRUE\n    );\n\n    auto const retVal = StatusToBool(status);\n\n    ATLASSERT(retVal == TRUE);\n\n    return retVal;\n}\n\nBOOL CSettingsRegistryStorage::StatusToBool(const LSTATUS status) noexcept\n{\n    return (\n        status == ERROR_SUCCESS\n        ? TRUE\n        : FALSE\n        );\n}\n\nBOOL CSettingsRegistryStorage::TryReadDwordValue(\n    const LPCWSTR lpValueName,\n    DWORD& refDwValue\n) const noexcept\n{\n    auto const status = m_regKey.ReadDwordValue(lpValueName, refDwValue);\n    auto const retVal = StatusToBool(status);\n\n    ATLASSERT(retVal == TRUE);\n\n    return retVal;\n}\n\nBOOL CSettingsRegistryStorage::WriteDwordValue(\n    const LPCWSTR lpValueName,\n    const DWORD dwValue\n) const noexcept\n{\n    auto const status = m_regKey.WriteDwordValue(lpValueName, dwValue);\n    auto const retVal = StatusToBool(status);\n\n    ATLASSERT(retVal == TRUE);\n\n    return retVal;\n}\n\nBOOL CSettingsRegistryStorage::TryReadTopLeftPosition(\n    POINTS& topLeftPoint\n) const noexcept\n{\n    DWORD dwX;\n\n    auto result = TryReadDwordValue(\n        SLEEP_TIMER_REG_PARAM_WND_X_POS,\n        dwX\n    );\n\n    if (result != TRUE)\n    {\n        return FALSE;\n    }\n\n    DWORD dwY;\n\n    result = TryReadDwordValue(\n        SLEEP_TIMER_REG_PARAM_WND_Y_POS,\n        dwY\n    );\n\n    if (result != TRUE)\n    {\n        return FALSE;\n    }\n\n    topLeftPoint.x = static_cast<SHORT>(dwX);\n    topLeftPoint.y = static_cast<SHORT>(dwY);\n\n    return TRUE;\n}\n\nBOOL CSettingsRegistryStorage::TryReadTimerType(\n    TimerType& timerType\n) const noexcept\n{\n    DWORD registryValue;\n\n    if (\n        TryReadDwordValue(\n            SLEEP_TIMER_REG_PARAM_TIMER_TYPE,\n            registryValue\n        ) != TRUE\n        )\n    {\n        return FALSE;\n    }\n\n    timerType = static_cast<TimerType>(registryValue);\n\n    return TRUE;\n}\n\nBOOL CSettingsRegistryStorage::TryReadTimerTypeInHours(\n    unsigned short& hours\n) const noexcept\n{\n    DWORD registryValue;\n\n    if (\n        TryReadDwordValue(\n            SLEEP_TIMER_REG_PARAM_TIMER_TYPE_IN_HOURS,\n            registryValue\n        ) != TRUE\n        )\n    {\n        return FALSE;\n    }\n\n    hours = static_cast<unsigned short>(registryValue);\n\n    return TRUE;\n}\n\nBOOL CSettingsRegistryStorage::TryReadTimerTypeInMinutes(\n    unsigned short& minutes\n) const noexcept\n{\n    DWORD registryValue;\n\n    if (\n        TryReadDwordValue(\n            SLEEP_TIMER_REG_PARAM_TIMER_TYPE_IN_MINUTES,\n            registryValue\n        ) != TRUE\n        )\n    {\n        return FALSE;\n    }\n\n    minutes = static_cast<unsigned short>(registryValue);\n\n    return TRUE;\n}\n\nBOOL CSettingsRegistryStorage::TryReadTimerTypeAtHours(\n    unsigned short& hours\n) const noexcept\n{\n    DWORD registryValue;\n\n    if (\n        TryReadDwordValue(\n            SLEEP_TIMER_REG_PARAM_TIMER_TYPE_AT_HOURS,\n            registryValue\n        ) != TRUE\n        )\n    {\n        return FALSE;\n    }\n\n    hours = static_cast<unsigned short>(registryValue);\n\n    return TRUE;\n}\n\nBOOL CSettingsRegistryStorage::TryReadTimerTypeAtMinutes(\n    unsigned short& minutes\n) const noexcept\n{\n    DWORD registryValue;\n\n    if (\n        TryReadDwordValue(\n            SLEEP_TIMER_REG_PARAM_TIMER_TYPE_AT_MINUTES,\n            registryValue\n        ) != TRUE\n        )\n    {\n        return FALSE;\n    }\n\n    minutes = static_cast<unsigned short>(registryValue);\n\n    return TRUE;\n}\n\nBOOL CSettingsRegistryStorage::TryReadPowerOffType(\n    PowerOffType& powerOffType\n) const noexcept\n{\n    DWORD registryValue;\n\n    if (\n        TryReadDwordValue(\n            SLEEP_TIMER_REG_PARAM_POWEROFF_TYPE,\n            registryValue\n        ) != TRUE\n        )\n    {\n        return FALSE;\n    }\n\n    powerOffType = static_cast<PowerOffType>(registryValue);\n\n    return TRUE;\n}\n\nBOOL CSettingsRegistryStorage::TryWriteTopLeftPosition(const POINTS topLeftPoint) const noexcept\n{\n    const auto windowCaptionAreaHeight = static_cast<DWORD>(GetSystemMetrics(SM_CYCAPTION));\n    const auto verticalBorderWidth = static_cast<DWORD>(GetSystemMetrics(SM_CYFIXEDFRAME));\n    const auto horizontalBorderHeight = static_cast<DWORD>(GetSystemMetrics(SM_CXFIXEDFRAME));\n\n    const auto dwPosX = (\n        static_cast<DWORD>(topLeftPoint.x)\n        - verticalBorderWidth\n        );\n\n    const auto dwPosY = (\n        static_cast<DWORD>(topLeftPoint.y)\n        - windowCaptionAreaHeight\n        - horizontalBorderHeight\n        );\n\n    auto const result = WriteDwordValue(\n        SLEEP_TIMER_REG_PARAM_WND_X_POS,\n        dwPosX\n    );\n\n    if (result != TRUE)\n    {\n        return result;\n    }\n\n    return WriteDwordValue(\n        SLEEP_TIMER_REG_PARAM_WND_Y_POS,\n        dwPosY\n    );\n}\n\nBOOL CSettingsRegistryStorage::TryWriteTimerType(const TimerType timerType) const noexcept\n{\n    return WriteDwordValue(\n        SLEEP_TIMER_REG_PARAM_TIMER_TYPE,\n        static_cast<DWORD>(timerType)\n    );\n}\n\nBOOL CSettingsRegistryStorage::TryWriteTimerTypeInHours(\n    const unsigned short hours\n) const noexcept\n{\n    return WriteDwordValue(\n        SLEEP_TIMER_REG_PARAM_TIMER_TYPE_IN_HOURS,\n        hours\n    );\n}\n\nBOOL CSettingsRegistryStorage::TryWriteTimerTypeInMinutes(\n    const unsigned short minutes\n) const noexcept\n{\n    return WriteDwordValue(\n        SLEEP_TIMER_REG_PARAM_TIMER_TYPE_IN_MINUTES,\n        minutes\n    );\n}\n\nBOOL CSettingsRegistryStorage::TryWriteTimerTypeAtHours(\n    const unsigned short hours\n) const noexcept\n{\n    return WriteDwordValue(\n        SLEEP_TIMER_REG_PARAM_TIMER_TYPE_AT_HOURS,\n        hours\n    );\n}\n\nBOOL CSettingsRegistryStorage::TryWriteTimerTypeAtMinutes(\n    const unsigned short minutes\n) const noexcept\n{\n    return WriteDwordValue(\n        SLEEP_TIMER_REG_PARAM_TIMER_TYPE_AT_MINUTES,\n        minutes\n    );\n}\n\nBOOL CSettingsRegistryStorage::TryWritePowerOffType(const PowerOffType powerOffType) const noexcept\n{\n    return WriteDwordValue(\n        SLEEP_TIMER_REG_PARAM_POWEROFF_TYPE,\n        static_cast<DWORD>(powerOffType)\n    );\n}\n<commit_msg>Window position calculations had been updated.<commit_after>#include \"stdafx.h\"\n#include \"SettingsRegistryStorage.h\"\n\nvoid CSettingsRegistryStorage::ReadUiSettings(CSettings& settings) noexcept\n{\n    settings = CSettings();\n\n    if (OpenRegistryForReading() != TRUE)\n    {\n        return;\n    }\n\n    POINTS topLeftPoint;\n    if (TryReadTopLeftPosition(topLeftPoint))\n    {\n        settings.SetTopLeftWindowPositionCoordinates(topLeftPoint);\n    }\n\n    TimerType timerType;\n    if (TryReadTimerType(timerType))\n    {\n        settings.SetTimerType(timerType);\n    }\n\n    unsigned short shortValue;\n    if (TryReadTimerTypeInHours(shortValue))\n    {\n        settings.SetTimerTypeInHours(shortValue);\n    }\n\n    if (TryReadTimerTypeInMinutes(shortValue))\n    {\n        settings.SetTimerTypeInMinutes(shortValue);\n    }\n\n    if (TryReadTimerTypeAtHours(shortValue))\n    {\n        settings.SetTimerTypeAtHours(shortValue);\n    }\n\n    if (TryReadTimerTypeAtMinutes(shortValue))\n    {\n        settings.SetTimerTypeAtMinutes(shortValue);\n    }\n\n    PowerOffType powerOffType;\n    if (TryReadPowerOffType(powerOffType))\n    {\n        settings.SetPowerOffType(powerOffType);\n    }\n}\n\nvoid CSettingsRegistryStorage::WriteUiSettings(const CSettings& settings) noexcept\n{\n    auto result = OpenRegistryForWriting();\n    ATLASSERT(result == TRUE);\n    if (result != TRUE)\n    {\n        return;\n    }\n\n    result = TryWriteTopLeftPosition(settings.GetTopLeftWindowPosition());\n    ATLASSERT(result == TRUE);\n\n    result = TryWriteTimerType(settings.GetTimerType());\n    ATLASSERT(result == TRUE);\n\n    result = TryWriteTimerTypeInHours(settings.GetTimerTypeInHours());\n    ATLASSERT(result == TRUE);\n\n    result = TryWriteTimerTypeInMinutes(settings.GetTimerTypeInMinutes());\n    ATLASSERT(result == TRUE);\n\n    result = TryWriteTimerTypeAtHours(settings.GetTimerTypeAtHours());\n    ATLASSERT(result == TRUE);\n\n    result = TryWriteTimerTypeAtMinutes(settings.GetTimerTypeAtMinutes());\n    ATLASSERT(result == TRUE);\n\n    result = TryWritePowerOffType(settings.GetPowerOffType());\n    ATLASSERT(result == TRUE);\n}\n\nBOOL CSettingsRegistryStorage::OpenRegistryForReading()\n{\n    const auto status = m_regKey.OpenCurrentUserKeyForReading(SLEEP_TIMER_REG_KEY);\n\n    auto const retVal = StatusToBool(status);\n\n    return retVal;\n}\n\nBOOL CSettingsRegistryStorage::OpenRegistryForWriting()\n{\n    const auto status = m_regKey.OpenCurrentUserKeyForWriting(\n        SLEEP_TIMER_REG_KEY,\n        TRUE\n    );\n\n    auto const retVal = StatusToBool(status);\n\n    ATLASSERT(retVal == TRUE);\n\n    return retVal;\n}\n\nBOOL CSettingsRegistryStorage::StatusToBool(const LSTATUS status) noexcept\n{\n    return (\n        status == ERROR_SUCCESS\n        ? TRUE\n        : FALSE\n        );\n}\n\nBOOL CSettingsRegistryStorage::TryReadDwordValue(\n    const LPCWSTR lpValueName,\n    DWORD& refDwValue\n) const noexcept\n{\n    auto const status = m_regKey.ReadDwordValue(lpValueName, refDwValue);\n    auto const retVal = StatusToBool(status);\n\n    ATLASSERT(retVal == TRUE);\n\n    return retVal;\n}\n\nBOOL CSettingsRegistryStorage::WriteDwordValue(\n    const LPCWSTR lpValueName,\n    const DWORD dwValue\n) const noexcept\n{\n    auto const status = m_regKey.WriteDwordValue(lpValueName, dwValue);\n    auto const retVal = StatusToBool(status);\n\n    ATLASSERT(retVal == TRUE);\n\n    return retVal;\n}\n\nBOOL CSettingsRegistryStorage::TryReadTopLeftPosition(\n    POINTS& topLeftPoint\n) const noexcept\n{\n    DWORD dwX;\n\n    auto result = TryReadDwordValue(\n        SLEEP_TIMER_REG_PARAM_WND_X_POS,\n        dwX\n    );\n\n    if (result != TRUE)\n    {\n        return FALSE;\n    }\n\n    DWORD dwY;\n\n    result = TryReadDwordValue(\n        SLEEP_TIMER_REG_PARAM_WND_Y_POS,\n        dwY\n    );\n\n    if (result != TRUE)\n    {\n        return FALSE;\n    }\n\n    topLeftPoint.x = static_cast<SHORT>(dwX);\n    topLeftPoint.y = static_cast<SHORT>(dwY);\n\n    return TRUE;\n}\n\nBOOL CSettingsRegistryStorage::TryReadTimerType(\n    TimerType& timerType\n) const noexcept\n{\n    DWORD registryValue;\n\n    if (\n        TryReadDwordValue(\n            SLEEP_TIMER_REG_PARAM_TIMER_TYPE,\n            registryValue\n        ) != TRUE\n        )\n    {\n        return FALSE;\n    }\n\n    timerType = static_cast<TimerType>(registryValue);\n\n    return TRUE;\n}\n\nBOOL CSettingsRegistryStorage::TryReadTimerTypeInHours(\n    unsigned short& hours\n) const noexcept\n{\n    DWORD registryValue;\n\n    if (\n        TryReadDwordValue(\n            SLEEP_TIMER_REG_PARAM_TIMER_TYPE_IN_HOURS,\n            registryValue\n        ) != TRUE\n        )\n    {\n        return FALSE;\n    }\n\n    hours = static_cast<unsigned short>(registryValue);\n\n    return TRUE;\n}\n\nBOOL CSettingsRegistryStorage::TryReadTimerTypeInMinutes(\n    unsigned short& minutes\n) const noexcept\n{\n    DWORD registryValue;\n\n    if (\n        TryReadDwordValue(\n            SLEEP_TIMER_REG_PARAM_TIMER_TYPE_IN_MINUTES,\n            registryValue\n        ) != TRUE\n        )\n    {\n        return FALSE;\n    }\n\n    minutes = static_cast<unsigned short>(registryValue);\n\n    return TRUE;\n}\n\nBOOL CSettingsRegistryStorage::TryReadTimerTypeAtHours(\n    unsigned short& hours\n) const noexcept\n{\n    DWORD registryValue;\n\n    if (\n        TryReadDwordValue(\n            SLEEP_TIMER_REG_PARAM_TIMER_TYPE_AT_HOURS,\n            registryValue\n        ) != TRUE\n        )\n    {\n        return FALSE;\n    }\n\n    hours = static_cast<unsigned short>(registryValue);\n\n    return TRUE;\n}\n\nBOOL CSettingsRegistryStorage::TryReadTimerTypeAtMinutes(\n    unsigned short& minutes\n) const noexcept\n{\n    DWORD registryValue;\n\n    if (\n        TryReadDwordValue(\n            SLEEP_TIMER_REG_PARAM_TIMER_TYPE_AT_MINUTES,\n            registryValue\n        ) != TRUE\n        )\n    {\n        return FALSE;\n    }\n\n    minutes = static_cast<unsigned short>(registryValue);\n\n    return TRUE;\n}\n\nBOOL CSettingsRegistryStorage::TryReadPowerOffType(\n    PowerOffType& powerOffType\n) const noexcept\n{\n    DWORD registryValue;\n\n    if (\n        TryReadDwordValue(\n            SLEEP_TIMER_REG_PARAM_POWEROFF_TYPE,\n            registryValue\n        ) != TRUE\n        )\n    {\n        return FALSE;\n    }\n\n    powerOffType = static_cast<PowerOffType>(registryValue);\n\n    return TRUE;\n}\n\nBOOL CSettingsRegistryStorage::TryWriteTopLeftPosition(const POINTS topLeftPoint) const noexcept\n{\n    const auto verticalBorderWidth = GetSystemMetrics(SM_CYFIXEDFRAME);\n    const auto posX = topLeftPoint.x - verticalBorderWidth;\n\n    auto result = FALSE;\n\n    if (posX >= 0)\n    {\n        result = WriteDwordValue(\n            SLEEP_TIMER_REG_PARAM_WND_X_POS,\n            static_cast<DWORD>(posX)\n        );\n\n        if (result != TRUE)\n        {\n            return result;\n        }\n    }\n\n    if (topLeftPoint.y >= 0)\n    {\n        result = WriteDwordValue(\n            SLEEP_TIMER_REG_PARAM_WND_Y_POS,\n            static_cast<DWORD>(topLeftPoint.y)\n        );\n    }\n\n    return result;\n}\n\nBOOL CSettingsRegistryStorage::TryWriteTimerType(const TimerType timerType) const noexcept\n{\n    return WriteDwordValue(\n        SLEEP_TIMER_REG_PARAM_TIMER_TYPE,\n        static_cast<DWORD>(timerType)\n    );\n}\n\nBOOL CSettingsRegistryStorage::TryWriteTimerTypeInHours(\n    const unsigned short hours\n) const noexcept\n{\n    return WriteDwordValue(\n        SLEEP_TIMER_REG_PARAM_TIMER_TYPE_IN_HOURS,\n        hours\n    );\n}\n\nBOOL CSettingsRegistryStorage::TryWriteTimerTypeInMinutes(\n    const unsigned short minutes\n) const noexcept\n{\n    return WriteDwordValue(\n        SLEEP_TIMER_REG_PARAM_TIMER_TYPE_IN_MINUTES,\n        minutes\n    );\n}\n\nBOOL CSettingsRegistryStorage::TryWriteTimerTypeAtHours(\n    const unsigned short hours\n) const noexcept\n{\n    return WriteDwordValue(\n        SLEEP_TIMER_REG_PARAM_TIMER_TYPE_AT_HOURS,\n        hours\n    );\n}\n\nBOOL CSettingsRegistryStorage::TryWriteTimerTypeAtMinutes(\n    const unsigned short minutes\n) const noexcept\n{\n    return WriteDwordValue(\n        SLEEP_TIMER_REG_PARAM_TIMER_TYPE_AT_MINUTES,\n        minutes\n    );\n}\n\nBOOL CSettingsRegistryStorage::TryWritePowerOffType(const PowerOffType powerOffType) const noexcept\n{\n    return WriteDwordValue(\n        SLEEP_TIMER_REG_PARAM_POWEROFF_TYPE,\n        static_cast<DWORD>(powerOffType)\n    );\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2016 RISC-V Foundation\n * Copyright (c) 2016 The University of Virginia\n * Copyright (c) 2020 Barkhausen Institut\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met: redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer;\n * redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution;\n * neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"arch\/riscv\/isa.hh\"\n\n#include <ctime>\n#include <set>\n#include <sstream>\n\n#include \"arch\/riscv\/interrupts.hh\"\n#include \"arch\/riscv\/pagetable.hh\"\n#include \"arch\/riscv\/registers.hh\"\n#include \"base\/bitfield.hh\"\n#include \"cpu\/base.hh\"\n#include \"debug\/RiscvMisc.hh\"\n#include \"params\/RiscvISA.hh\"\n#include \"sim\/core.hh\"\n#include \"sim\/pseudo_inst.hh\"\n\nnamespace RiscvISA\n{\n\nISA::ISA(Params *p) : BaseISA(p)\n{\n    miscRegFile.resize(NumMiscRegs);\n    clear();\n}\n\nconst RiscvISAParams *\nISA::params() const\n{\n    return dynamic_cast<const Params *>(_params);\n}\n\nvoid ISA::clear()\n{\n    std::fill(miscRegFile.begin(), miscRegFile.end(), 0);\n\n    miscRegFile[MISCREG_PRV] = PRV_M;\n    miscRegFile[MISCREG_ISA] = (2ULL << MXL_OFFSET) | 0x14112D;\n    miscRegFile[MISCREG_VENDORID] = 0;\n    miscRegFile[MISCREG_ARCHID] = 0;\n    miscRegFile[MISCREG_IMPID] = 0;\n    miscRegFile[MISCREG_STATUS] = (2ULL << UXL_OFFSET) | (2ULL << SXL_OFFSET) |\n                                  (1ULL << FS_OFFSET);\n    miscRegFile[MISCREG_MCOUNTEREN] = 0x7;\n    miscRegFile[MISCREG_SCOUNTEREN] = 0x7;\n}\n\nbool\nISA::hpmCounterEnabled(int misc_reg) const\n{\n    int hpmcounter = misc_reg - MISCREG_CYCLE;\n    if (hpmcounter < 0 || hpmcounter > 31)\n        panic(\"Illegal HPM counter %d\\n\", hpmcounter);\n    int counteren;\n    switch (readMiscRegNoEffect(MISCREG_PRV)) {\n      case PRV_M:\n        return true;\n      case PRV_S:\n        counteren = MISCREG_MCOUNTEREN;\n        break;\n      case PRV_U:\n        counteren = MISCREG_SCOUNTEREN;\n        break;\n      default:\n        panic(\"Unknown privilege level %d\\n\", miscRegFile[MISCREG_PRV]);\n        return false;\n    }\n    return (miscRegFile[counteren] & (1ULL << (hpmcounter))) > 0;\n}\n\nRegVal\nISA::readMiscRegNoEffect(int misc_reg) const\n{\n    if (misc_reg > NumMiscRegs || misc_reg < 0) {\n        \/\/ Illegal CSR\n        panic(\"Illegal CSR index %#x\\n\", misc_reg);\n        return -1;\n    }\n    DPRINTF(RiscvMisc, \"Reading MiscReg %d: %#llx.\\n\", misc_reg,\n            miscRegFile[misc_reg]);\n    return miscRegFile[misc_reg];\n}\n\nRegVal\nISA::readMiscReg(int misc_reg, ThreadContext *tc)\n{\n    switch (misc_reg) {\n      case MISCREG_HARTID:\n        return tc->contextId();\n      case MISCREG_CYCLE:\n        if (hpmCounterEnabled(MISCREG_CYCLE)) {\n            DPRINTF(RiscvMisc, \"Cycle counter at: %llu.\\n\",\n                    tc->getCpuPtr()->curCycle());\n            return tc->getCpuPtr()->curCycle();\n        } else {\n            warn(\"Cycle counter disabled.\\n\");\n            return 0;\n        }\n      case MISCREG_TIME:\n        if (hpmCounterEnabled(MISCREG_TIME)) {\n            DPRINTF(RiscvMisc, \"Wall-clock counter at: %llu.\\n\",\n                    std::time(nullptr));\n            return std::time(nullptr);\n        } else {\n            warn(\"Wall clock disabled.\\n\");\n            return 0;\n        }\n      case MISCREG_INSTRET:\n        if (hpmCounterEnabled(MISCREG_INSTRET)) {\n            DPRINTF(RiscvMisc, \"Instruction counter at: %llu.\\n\",\n                    tc->getCpuPtr()->totalInsts());\n            return tc->getCpuPtr()->totalInsts();\n        } else {\n            warn(\"Instruction counter disabled.\\n\");\n            return 0;\n        }\n      case MISCREG_IP:\n        {\n            auto ic = dynamic_cast<RiscvISA::Interrupts *>(\n                    tc->getCpuPtr()->getInterruptController(tc->threadId()));\n            return ic->readIP();\n        }\n      case MISCREG_IE:\n        {\n            auto ic = dynamic_cast<RiscvISA::Interrupts *>(\n                    tc->getCpuPtr()->getInterruptController(tc->threadId()));\n            return ic->readIE();\n        }\n      default:\n        \/\/ Try reading HPM counters\n        \/\/ As a placeholder, all HPM counters are just cycle counters\n        if (misc_reg >= MISCREG_HPMCOUNTER03 &&\n                misc_reg <= MISCREG_HPMCOUNTER31) {\n            if (hpmCounterEnabled(misc_reg)) {\n                DPRINTF(RiscvMisc, \"HPM counter %d: %llu.\\n\",\n                        misc_reg - MISCREG_CYCLE, tc->getCpuPtr()->curCycle());\n                return tc->getCpuPtr()->curCycle();\n            } else {\n                warn(\"HPM counter %d disabled.\\n\", misc_reg - MISCREG_CYCLE);\n                return 0;\n            }\n        }\n        return readMiscRegNoEffect(misc_reg);\n    }\n}\n\nvoid\nISA::setMiscRegNoEffect(int misc_reg, RegVal val)\n{\n    if (misc_reg > NumMiscRegs || misc_reg < 0) {\n        \/\/ Illegal CSR\n        panic(\"Illegal CSR index %#x\\n\", misc_reg);\n    }\n    DPRINTF(RiscvMisc, \"Setting MiscReg %d to %#x.\\n\", misc_reg, val);\n    miscRegFile[misc_reg] = val;\n}\n\nvoid\nISA::setMiscReg(int misc_reg, RegVal val, ThreadContext *tc)\n{\n    if (misc_reg >= MISCREG_CYCLE && misc_reg <= MISCREG_HPMCOUNTER31) {\n        \/\/ Ignore writes to HPM counters for now\n        warn(\"Ignoring write to %s.\\n\", CSRData.at(misc_reg).name);\n    } else {\n        switch (misc_reg) {\n          case MISCREG_IP:\n            {\n                auto ic = dynamic_cast<RiscvISA::Interrupts *>(\n                    tc->getCpuPtr()->getInterruptController(tc->threadId()));\n                ic->setIP(val);\n            }\n            break;\n          case MISCREG_IE:\n            {\n                auto ic = dynamic_cast<RiscvISA::Interrupts *>(\n                    tc->getCpuPtr()->getInterruptController(tc->threadId()));\n                ic->setIE(val);\n            }\n            break;\n          case MISCREG_SATP:\n            {\n                \/\/ we only support bare and Sv39 mode; setting a different mode\n                \/\/ shall have no effect (see 4.1.12 in priv ISA manual)\n                SATP cur_val = readMiscRegNoEffect(misc_reg);\n                SATP new_val = val;\n                if (new_val.mode != AddrXlateMode::BARE &&\n                    new_val.mode != AddrXlateMode::SV39)\n                    new_val.mode = cur_val.mode;\n                setMiscRegNoEffect(misc_reg, new_val);\n            }\n            break;\n          default:\n            setMiscRegNoEffect(misc_reg, val);\n        }\n    }\n}\n\n}\n\nRiscvISA::ISA *\nRiscvISAParams::create()\n{\n    return new RiscvISA::ISA(this);\n}\n<commit_msg>arch-riscv: show names of MiscRegs on accesses.<commit_after>\/*\n * Copyright (c) 2016 RISC-V Foundation\n * Copyright (c) 2016 The University of Virginia\n * Copyright (c) 2020 Barkhausen Institut\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met: redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer;\n * redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution;\n * neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"arch\/riscv\/isa.hh\"\n\n#include <ctime>\n#include <set>\n#include <sstream>\n\n#include \"arch\/riscv\/interrupts.hh\"\n#include \"arch\/riscv\/pagetable.hh\"\n#include \"arch\/riscv\/registers.hh\"\n#include \"base\/bitfield.hh\"\n#include \"cpu\/base.hh\"\n#include \"debug\/RiscvMisc.hh\"\n#include \"params\/RiscvISA.hh\"\n#include \"sim\/core.hh\"\n#include \"sim\/pseudo_inst.hh\"\n\nnamespace RiscvISA\n{\n\nconst std::array<const char *, NumMiscRegs> MiscRegNames = {{\n    [MISCREG_PRV]           = \"PRV\",\n    [MISCREG_ISA]           = \"ISA\",\n    [MISCREG_VENDORID]      = \"VENDORID\",\n    [MISCREG_ARCHID]        = \"ARCHID\",\n    [MISCREG_IMPID]         = \"IMPID\",\n    [MISCREG_HARTID]        = \"HARTID\",\n    [MISCREG_STATUS]        = \"STATUS\",\n    [MISCREG_IP]            = \"IP\",\n    [MISCREG_IE]            = \"IE\",\n    [MISCREG_CYCLE]         = \"CYCLE\",\n    [MISCREG_TIME]          = \"TIME\",\n    [MISCREG_INSTRET]       = \"INSTRET\",\n    [MISCREG_HPMCOUNTER03]  = \"HPMCOUNTER03\",\n    [MISCREG_HPMCOUNTER04]  = \"HPMCOUNTER04\",\n    [MISCREG_HPMCOUNTER05]  = \"HPMCOUNTER05\",\n    [MISCREG_HPMCOUNTER06]  = \"HPMCOUNTER06\",\n    [MISCREG_HPMCOUNTER07]  = \"HPMCOUNTER07\",\n    [MISCREG_HPMCOUNTER08]  = \"HPMCOUNTER08\",\n    [MISCREG_HPMCOUNTER09]  = \"HPMCOUNTER09\",\n    [MISCREG_HPMCOUNTER10]  = \"HPMCOUNTER10\",\n    [MISCREG_HPMCOUNTER11]  = \"HPMCOUNTER11\",\n    [MISCREG_HPMCOUNTER12]  = \"HPMCOUNTER12\",\n    [MISCREG_HPMCOUNTER13]  = \"HPMCOUNTER13\",\n    [MISCREG_HPMCOUNTER14]  = \"HPMCOUNTER14\",\n    [MISCREG_HPMCOUNTER15]  = \"HPMCOUNTER15\",\n    [MISCREG_HPMCOUNTER16]  = \"HPMCOUNTER16\",\n    [MISCREG_HPMCOUNTER17]  = \"HPMCOUNTER17\",\n    [MISCREG_HPMCOUNTER18]  = \"HPMCOUNTER18\",\n    [MISCREG_HPMCOUNTER19]  = \"HPMCOUNTER19\",\n    [MISCREG_HPMCOUNTER20]  = \"HPMCOUNTER20\",\n    [MISCREG_HPMCOUNTER21]  = \"HPMCOUNTER21\",\n    [MISCREG_HPMCOUNTER22]  = \"HPMCOUNTER22\",\n    [MISCREG_HPMCOUNTER23]  = \"HPMCOUNTER23\",\n    [MISCREG_HPMCOUNTER24]  = \"HPMCOUNTER24\",\n    [MISCREG_HPMCOUNTER25]  = \"HPMCOUNTER25\",\n    [MISCREG_HPMCOUNTER26]  = \"HPMCOUNTER26\",\n    [MISCREG_HPMCOUNTER27]  = \"HPMCOUNTER27\",\n    [MISCREG_HPMCOUNTER28]  = \"HPMCOUNTER28\",\n    [MISCREG_HPMCOUNTER29]  = \"HPMCOUNTER29\",\n    [MISCREG_HPMCOUNTER30]  = \"HPMCOUNTER30\",\n    [MISCREG_HPMCOUNTER31]  = \"HPMCOUNTER31\",\n    [MISCREG_HPMEVENT03]    = \"HPMEVENT03\",\n    [MISCREG_HPMEVENT04]    = \"HPMEVENT04\",\n    [MISCREG_HPMEVENT05]    = \"HPMEVENT05\",\n    [MISCREG_HPMEVENT06]    = \"HPMEVENT06\",\n    [MISCREG_HPMEVENT07]    = \"HPMEVENT07\",\n    [MISCREG_HPMEVENT08]    = \"HPMEVENT08\",\n    [MISCREG_HPMEVENT09]    = \"HPMEVENT09\",\n    [MISCREG_HPMEVENT10]    = \"HPMEVENT10\",\n    [MISCREG_HPMEVENT11]    = \"HPMEVENT11\",\n    [MISCREG_HPMEVENT12]    = \"HPMEVENT12\",\n    [MISCREG_HPMEVENT13]    = \"HPMEVENT13\",\n    [MISCREG_HPMEVENT14]    = \"HPMEVENT14\",\n    [MISCREG_HPMEVENT15]    = \"HPMEVENT15\",\n    [MISCREG_HPMEVENT16]    = \"HPMEVENT16\",\n    [MISCREG_HPMEVENT17]    = \"HPMEVENT17\",\n    [MISCREG_HPMEVENT18]    = \"HPMEVENT18\",\n    [MISCREG_HPMEVENT19]    = \"HPMEVENT19\",\n    [MISCREG_HPMEVENT20]    = \"HPMEVENT20\",\n    [MISCREG_HPMEVENT21]    = \"HPMEVENT21\",\n    [MISCREG_HPMEVENT22]    = \"HPMEVENT22\",\n    [MISCREG_HPMEVENT23]    = \"HPMEVENT23\",\n    [MISCREG_HPMEVENT24]    = \"HPMEVENT24\",\n    [MISCREG_HPMEVENT25]    = \"HPMEVENT25\",\n    [MISCREG_HPMEVENT26]    = \"HPMEVENT26\",\n    [MISCREG_HPMEVENT27]    = \"HPMEVENT27\",\n    [MISCREG_HPMEVENT28]    = \"HPMEVENT28\",\n    [MISCREG_HPMEVENT29]    = \"HPMEVENT29\",\n    [MISCREG_HPMEVENT30]    = \"HPMEVENT30\",\n    [MISCREG_HPMEVENT31]    = \"HPMEVENT31\",\n    [MISCREG_TSELECT]       = \"TSELECT\",\n    [MISCREG_TDATA1]        = \"TDATA1\",\n    [MISCREG_TDATA2]        = \"TDATA2\",\n    [MISCREG_TDATA3]        = \"TDATA3\",\n    [MISCREG_DCSR]          = \"DCSR\",\n    [MISCREG_DPC]           = \"DPC\",\n    [MISCREG_DSCRATCH]      = \"DSCRATCH\",\n\n    [MISCREG_MEDELEG]       = \"MEDELEG\",\n    [MISCREG_MIDELEG]       = \"MIDELEG\",\n    [MISCREG_MTVEC]         = \"MTVEC\",\n    [MISCREG_MCOUNTEREN]    = \"MCOUNTEREN\",\n    [MISCREG_MSCRATCH]      = \"MSCRATCH\",\n    [MISCREG_MEPC]          = \"MEPC\",\n    [MISCREG_MCAUSE]        = \"MCAUSE\",\n    [MISCREG_MTVAL]         = \"MTVAL\",\n    [MISCREG_PMPCFG0]       = \"PMPCFG0\",\n    \/\/ pmpcfg1 rv32 only\n    [MISCREG_PMPCFG2]       = \"PMPCFG2\",\n    \/\/ pmpcfg3 rv32 only\n    [MISCREG_PMPADDR00]     = \"PMPADDR00\",\n    [MISCREG_PMPADDR01]     = \"PMPADDR01\",\n    [MISCREG_PMPADDR02]     = \"PMPADDR02\",\n    [MISCREG_PMPADDR03]     = \"PMPADDR03\",\n    [MISCREG_PMPADDR04]     = \"PMPADDR04\",\n    [MISCREG_PMPADDR05]     = \"PMPADDR05\",\n    [MISCREG_PMPADDR06]     = \"PMPADDR06\",\n    [MISCREG_PMPADDR07]     = \"PMPADDR07\",\n    [MISCREG_PMPADDR08]     = \"PMPADDR08\",\n    [MISCREG_PMPADDR09]     = \"PMPADDR09\",\n    [MISCREG_PMPADDR10]     = \"PMPADDR10\",\n    [MISCREG_PMPADDR11]     = \"PMPADDR11\",\n    [MISCREG_PMPADDR12]     = \"PMPADDR12\",\n    [MISCREG_PMPADDR13]     = \"PMPADDR13\",\n    [MISCREG_PMPADDR14]     = \"PMPADDR14\",\n    [MISCREG_PMPADDR15]     = \"PMPADDR15\",\n\n    [MISCREG_SEDELEG]       = \"SEDELEG\",\n    [MISCREG_SIDELEG]       = \"SIDELEG\",\n    [MISCREG_STVEC]         = \"STVEC\",\n    [MISCREG_SCOUNTEREN]    = \"SCOUNTEREN\",\n    [MISCREG_SSCRATCH]      = \"SSCRATCH\",\n    [MISCREG_SEPC]          = \"SEPC\",\n    [MISCREG_SCAUSE]        = \"SCAUSE\",\n    [MISCREG_STVAL]         = \"STVAL\",\n    [MISCREG_SATP]          = \"SATP\",\n\n    [MISCREG_UTVEC]         = \"UTVEC\",\n    [MISCREG_USCRATCH]      = \"USCRATCH\",\n    [MISCREG_UEPC]          = \"UEPC\",\n    [MISCREG_UCAUSE]        = \"UCAUSE\",\n    [MISCREG_UTVAL]         = \"UTVAL\",\n    [MISCREG_FFLAGS]        = \"FFLAGS\",\n    [MISCREG_FRM]           = \"FRM\",\n}};\n\nISA::ISA(Params *p) : BaseISA(p)\n{\n    miscRegFile.resize(NumMiscRegs);\n    clear();\n}\n\nconst RiscvISAParams *\nISA::params() const\n{\n    return dynamic_cast<const Params *>(_params);\n}\n\nvoid ISA::clear()\n{\n    std::fill(miscRegFile.begin(), miscRegFile.end(), 0);\n\n    miscRegFile[MISCREG_PRV] = PRV_M;\n    miscRegFile[MISCREG_ISA] = (2ULL << MXL_OFFSET) | 0x14112D;\n    miscRegFile[MISCREG_VENDORID] = 0;\n    miscRegFile[MISCREG_ARCHID] = 0;\n    miscRegFile[MISCREG_IMPID] = 0;\n    miscRegFile[MISCREG_STATUS] = (2ULL << UXL_OFFSET) | (2ULL << SXL_OFFSET) |\n                                  (1ULL << FS_OFFSET);\n    miscRegFile[MISCREG_MCOUNTEREN] = 0x7;\n    miscRegFile[MISCREG_SCOUNTEREN] = 0x7;\n}\n\nbool\nISA::hpmCounterEnabled(int misc_reg) const\n{\n    int hpmcounter = misc_reg - MISCREG_CYCLE;\n    if (hpmcounter < 0 || hpmcounter > 31)\n        panic(\"Illegal HPM counter %d\\n\", hpmcounter);\n    int counteren;\n    switch (readMiscRegNoEffect(MISCREG_PRV)) {\n      case PRV_M:\n        return true;\n      case PRV_S:\n        counteren = MISCREG_MCOUNTEREN;\n        break;\n      case PRV_U:\n        counteren = MISCREG_SCOUNTEREN;\n        break;\n      default:\n        panic(\"Unknown privilege level %d\\n\", miscRegFile[MISCREG_PRV]);\n        return false;\n    }\n    return (miscRegFile[counteren] & (1ULL << (hpmcounter))) > 0;\n}\n\nRegVal\nISA::readMiscRegNoEffect(int misc_reg) const\n{\n    if (misc_reg > NumMiscRegs || misc_reg < 0) {\n        \/\/ Illegal CSR\n        panic(\"Illegal CSR index %#x\\n\", misc_reg);\n        return -1;\n    }\n    DPRINTF(RiscvMisc, \"Reading MiscReg %s (%d): %#x.\\n\",\n            MiscRegNames[misc_reg], misc_reg, miscRegFile[misc_reg]);\n    return miscRegFile[misc_reg];\n}\n\nRegVal\nISA::readMiscReg(int misc_reg, ThreadContext *tc)\n{\n    switch (misc_reg) {\n      case MISCREG_HARTID:\n        return tc->contextId();\n      case MISCREG_CYCLE:\n        if (hpmCounterEnabled(MISCREG_CYCLE)) {\n            DPRINTF(RiscvMisc, \"Cycle counter at: %llu.\\n\",\n                    tc->getCpuPtr()->curCycle());\n            return tc->getCpuPtr()->curCycle();\n        } else {\n            warn(\"Cycle counter disabled.\\n\");\n            return 0;\n        }\n      case MISCREG_TIME:\n        if (hpmCounterEnabled(MISCREG_TIME)) {\n            DPRINTF(RiscvMisc, \"Wall-clock counter at: %llu.\\n\",\n                    std::time(nullptr));\n            return std::time(nullptr);\n        } else {\n            warn(\"Wall clock disabled.\\n\");\n            return 0;\n        }\n      case MISCREG_INSTRET:\n        if (hpmCounterEnabled(MISCREG_INSTRET)) {\n            DPRINTF(RiscvMisc, \"Instruction counter at: %llu.\\n\",\n                    tc->getCpuPtr()->totalInsts());\n            return tc->getCpuPtr()->totalInsts();\n        } else {\n            warn(\"Instruction counter disabled.\\n\");\n            return 0;\n        }\n      case MISCREG_IP:\n        {\n            auto ic = dynamic_cast<RiscvISA::Interrupts *>(\n                    tc->getCpuPtr()->getInterruptController(tc->threadId()));\n            return ic->readIP();\n        }\n      case MISCREG_IE:\n        {\n            auto ic = dynamic_cast<RiscvISA::Interrupts *>(\n                    tc->getCpuPtr()->getInterruptController(tc->threadId()));\n            return ic->readIE();\n        }\n      default:\n        \/\/ Try reading HPM counters\n        \/\/ As a placeholder, all HPM counters are just cycle counters\n        if (misc_reg >= MISCREG_HPMCOUNTER03 &&\n                misc_reg <= MISCREG_HPMCOUNTER31) {\n            if (hpmCounterEnabled(misc_reg)) {\n                DPRINTF(RiscvMisc, \"HPM counter %d: %llu.\\n\",\n                        misc_reg - MISCREG_CYCLE, tc->getCpuPtr()->curCycle());\n                return tc->getCpuPtr()->curCycle();\n            } else {\n                warn(\"HPM counter %d disabled.\\n\", misc_reg - MISCREG_CYCLE);\n                return 0;\n            }\n        }\n        return readMiscRegNoEffect(misc_reg);\n    }\n}\n\nvoid\nISA::setMiscRegNoEffect(int misc_reg, RegVal val)\n{\n    if (misc_reg > NumMiscRegs || misc_reg < 0) {\n        \/\/ Illegal CSR\n        panic(\"Illegal CSR index %#x\\n\", misc_reg);\n    }\n    DPRINTF(RiscvMisc, \"Setting MiscReg %s (%d) to %#x.\\n\",\n            MiscRegNames[misc_reg], misc_reg, val);\n    miscRegFile[misc_reg] = val;\n}\n\nvoid\nISA::setMiscReg(int misc_reg, RegVal val, ThreadContext *tc)\n{\n    if (misc_reg >= MISCREG_CYCLE && misc_reg <= MISCREG_HPMCOUNTER31) {\n        \/\/ Ignore writes to HPM counters for now\n        warn(\"Ignoring write to %s.\\n\", CSRData.at(misc_reg).name);\n    } else {\n        switch (misc_reg) {\n          case MISCREG_IP:\n            {\n                auto ic = dynamic_cast<RiscvISA::Interrupts *>(\n                    tc->getCpuPtr()->getInterruptController(tc->threadId()));\n                ic->setIP(val);\n            }\n            break;\n          case MISCREG_IE:\n            {\n                auto ic = dynamic_cast<RiscvISA::Interrupts *>(\n                    tc->getCpuPtr()->getInterruptController(tc->threadId()));\n                ic->setIE(val);\n            }\n            break;\n          case MISCREG_SATP:\n            {\n                \/\/ we only support bare and Sv39 mode; setting a different mode\n                \/\/ shall have no effect (see 4.1.12 in priv ISA manual)\n                SATP cur_val = readMiscRegNoEffect(misc_reg);\n                SATP new_val = val;\n                if (new_val.mode != AddrXlateMode::BARE &&\n                    new_val.mode != AddrXlateMode::SV39)\n                    new_val.mode = cur_val.mode;\n                setMiscRegNoEffect(misc_reg, new_val);\n            }\n            break;\n          default:\n            setMiscRegNoEffect(misc_reg, val);\n        }\n    }\n}\n\n}\n\nRiscvISA::ISA *\nRiscvISAParams::create()\n{\n    return new RiscvISA::ISA(this);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <functional>\n#include <memory>\n#include <nan.h>\n#include <v8.h>\n\n#include \"functional_callback.h\"\n\nusing std::unique_ptr;\nusing std::function;\nusing Nan::Callback;\nusing Nan::FunctionCallback;\nusing Nan::FunctionCallbackInfo;\nusing v8::Local;\nusing v8::String;\nusing v8::Value;\nusing v8::ArrayBuffer;\nusing v8::Array;\nusing v8::Function;\nusing v8::Isolate;\nusing Contents = v8::ArrayBuffer::Contents;\n\nvoid _fn_callback_helper(const FunctionCallbackInfo<Value> &info)\n{\n  Local<ArrayBuffer> cb_array = info.Data().As<ArrayBuffer>();\n  Contents cb_contents = cb_array->GetContents();\n\n  void *fn_addr = cb_contents.Data();\n  assert(cb_contents.ByteLength() == sizeof(FnCallback*));\n\n  FnCallback *fn = static_cast<FnCallback*>(fn_addr);\n  (*fn)(info);\n}\n\nunique_ptr<Callback> fn_callback(FnCallback &fn)\n{\n  Nan::HandleScope scope;\n\n  Local<ArrayBuffer> fn_addr = ArrayBuffer::New(Isolate::GetCurrent(), static_cast<void*>(&fn), sizeof(void*));\n  Local<Function> wrapper = Nan::New<Function>(_fn_callback_helper, fn_addr);\n  return unique_ptr<Callback>(new Callback(wrapper));\n}\n<commit_msg>If you aren't storing pointers in integers it doesn't count as C++<commit_after>#include <functional>\n#include <memory>\n#include <nan.h>\n#include <v8.h>\n\n#include \"functional_callback.h\"\n\nusing std::unique_ptr;\nusing std::function;\nusing Nan::Callback;\nusing Nan::FunctionCallback;\nusing Nan::FunctionCallbackInfo;\nusing v8::Local;\nusing v8::String;\nusing v8::Value;\nusing v8::ArrayBuffer;\nusing v8::Array;\nusing v8::Function;\nusing v8::Isolate;\nusing Contents = v8::ArrayBuffer::Contents;\n\nvoid _fn_callback_helper(const FunctionCallbackInfo<Value> &info)\n{\n  Local<ArrayBuffer> cb_array = info.Data().As<ArrayBuffer>();\n  Contents cb_contents = cb_array->GetContents();\n\n  intptr_t *payload = static_cast<intptr_t*>(cb_contents.Data());\n  assert(cb_contents.ByteLength() == sizeof(FnCallback*));\n\n  FnCallback *fn = reinterpret_cast<FnCallback*>(*payload);\n\n  delete payload;\n  (*fn)(info);\n}\n\nunique_ptr<Callback> fn_callback(FnCallback &fn)\n{\n  Nan::HandleScope scope;\n\n  intptr_t *payload = new intptr_t(reinterpret_cast<intptr_t>(&fn));\n\n  Local<ArrayBuffer> fn_addr = ArrayBuffer::New(\n    Isolate::GetCurrent(),\n    static_cast<void*>(payload),\n    sizeof(FnCallback*)\n  );\n  Local<Function> wrapper = Nan::New<Function>(_fn_callback_helper, fn_addr);\n  return unique_ptr<Callback>(new Callback(wrapper));\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\r\n\/\/ Copyright (c) 2008-2014 the Urho3D project.\r\n\/\/\r\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\r\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\r\n\/\/ in the Software without restriction, including without limitation the rights\r\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\r\n\/\/ copies of the Software, and to permit persons to whom the Software is\r\n\/\/ furnished to do so, subject to the following conditions:\r\n\/\/\r\n\/\/ The above copyright notice and this permission notice shall be included in\r\n\/\/ all copies or substantial portions of the Software.\r\n\/\/\r\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\n\/\/ THE SOFTWARE.\r\n\/\/\r\n\r\n#include \"Precompiled.h\"\r\n#include \"Animatable.h\"\r\n#include \"Context.h\"\r\n#include \"Deserializer.h\"\r\n#include \"Log.h\"\r\n#include \"ObjectAnimation.h\"\r\n#include \"Serializer.h\"\r\n#include \"ValueAnimation.h\"\r\n#include \"XMLFile.h\"\r\n\r\n#include \"DebugNew.h\"\r\n\r\nnamespace Urho3D\r\n{\r\n\r\nconst char* interpMethodNames[] = \r\n{\r\n    \"Linear\",\r\n    \"Spline\",\r\n    0\r\n};\r\n\r\nValueAnimation::ValueAnimation(Context* context) :\r\n    Resource(context),\r\n    owner_(0),\r\n    interpolationMethod_(IM_LINEAR),\r\n    splineTension_(0.5f),\r\n    valueType_(VAR_NONE),\r\n    interpolatable_(false),\r\n    beginTime_(M_INFINITY),\r\n    endTime_(-M_INFINITY),\r\n    splineTangentsDirty_(false)\r\n{\r\n}\r\n\r\nValueAnimation::~ValueAnimation()\r\n{\r\n}\r\n\r\nvoid ValueAnimation::RegisterObject(Context* context)\r\n{\r\n    context->RegisterFactory<ValueAnimation>();\r\n}\r\n\r\nbool ValueAnimation::Load(Deserializer& source)\r\n{\r\n    XMLFile xmlFile(context_);\r\n    if (!xmlFile.Load(source))\r\n        return false;\r\n\r\n    return LoadXML(xmlFile.GetRoot());\r\n}\r\n\r\nbool ValueAnimation::Save(Serializer& dest) const\r\n{\r\n    XMLFile xmlFile(context_);\r\n\r\n    XMLElement rootElem = xmlFile.CreateRoot(\"valueanimation\");\r\n    if (!SaveXML(rootElem))\r\n        return false;\r\n\r\n    return xmlFile.Save(dest);\r\n}\r\n\r\nbool ValueAnimation::LoadXML(const XMLElement& source)\r\n{\r\n    valueType_ = VAR_NONE;\r\n    eventFrames_.Clear();\r\n\r\n    String interpMethodString = source.GetAttribute(\"interpolationmethod\");\r\n    InterpMethod method = IM_LINEAR;\r\n    for (int i = 0; i <= IM_SPLINE; ++i)\r\n    {\r\n        if (interpMethodString == interpMethodNames[i])\r\n        {\r\n            method = (InterpMethod)i;\r\n            break;\r\n        }\r\n    }\r\n\r\n    SetInterpolationMethod(method);\r\n    if (interpolationMethod_ == IM_SPLINE)\r\n        splineTension_ = source.GetFloat(\"splinetension\");\r\n\r\n    XMLElement keyFrameElem = source.GetChild(\"keyframe\");\r\n    while (keyFrameElem)\r\n    {\r\n        float time = keyFrameElem.GetFloat(\"time\");\r\n        Variant value = keyFrameElem.GetVariant();\r\n        SetKeyFrame(time, value);\r\n\r\n        keyFrameElem = keyFrameElem.GetNext(\"keyframe\");\r\n    }\r\n\r\n    XMLElement eventFrameElem = source.GetChild(\"eventframe\");\r\n    while (eventFrameElem)\r\n    {\r\n        float time = eventFrameElem.GetFloat(\"time\");\r\n        unsigned eventType = eventFrameElem.GetUInt(\"eventtype\");\r\n        VariantMap eventData = eventFrameElem.GetChild(\"eventdata\").GetVariantMap();\r\n\r\n        SetEventFrame(time, StringHash(eventType), eventData);\r\n        eventFrameElem = eventFrameElem.GetNext(\"eventframe\");\r\n    }\r\n\r\n    return true;\r\n}\r\n\r\nbool ValueAnimation::SaveXML(XMLElement& dest) const\r\n{\r\n    dest.SetAttribute(\"interpolationmethod\", interpMethodNames[interpolationMethod_]);\r\n    if (interpolationMethod_ == IM_SPLINE)\r\n        dest.SetFloat(\"splinetension\", splineTension_);\r\n\r\n    for (unsigned i = 0; i < keyFrames_.Size(); ++i)\r\n    {\r\n        const VAnimKeyFrame& keyFrame = keyFrames_[i];\r\n        XMLElement keyFrameEleme = dest.CreateChild(\"keyframe\");\r\n        keyFrameEleme.SetFloat(\"time\", keyFrame.time_);\r\n        keyFrameEleme.SetVariant(keyFrame.value_);\r\n    }\r\n\r\n    for (unsigned i = 0; i < eventFrames_.Size(); ++i)\r\n    {\r\n        const VAnimEventFrame& eventFrame = eventFrames_[i];\r\n        XMLElement eventFrameElem = dest.CreateChild(\"eventframe\");\r\n        eventFrameElem.SetFloat(\"time\", eventFrame.time_);\r\n        eventFrameElem.SetUInt(\"eventtype\", eventFrame.eventType_.Value());\r\n        eventFrameElem.CreateChild(\"eventdata\").SetVariantMap(eventFrame.eventData_);\r\n    }\r\n\r\n    return true;\r\n}\r\n\r\nvoid ValueAnimation::SetValueType(VariantType valueType)\r\n{\r\n    if (valueType == valueType_)\r\n        return;\r\n\r\n    valueType_ = valueType;\r\n    interpolatable_ = (valueType_ == VAR_FLOAT) || (valueType_ == VAR_VECTOR2) || (valueType_ == VAR_VECTOR3) || (valueType_ == VAR_VECTOR4) ||\r\n        (valueType_ == VAR_QUATERNION) || (valueType_ == VAR_COLOR);\r\n\r\n    if ((valueType_ == VAR_INTRECT) || (valueType_ == VAR_INTVECTOR2))\r\n    {\r\n        interpolatable_ = true;\r\n        \/\/ Force linear interpolation for IntRect and IntVector2\r\n        interpolationMethod_ = IM_LINEAR;\r\n    }\r\n\r\n    keyFrames_.Clear();\r\n    eventFrames_.Clear();\r\n    beginTime_ = M_INFINITY;\r\n    endTime_ = -M_INFINITY;\r\n}\r\n\r\nvoid ValueAnimation::SetOwner(void* owner)\r\n{\r\n    owner_ = owner;\r\n}\r\n\r\nvoid ValueAnimation::SetInterpolationMethod(InterpMethod method)\r\n{\r\n    if (method == interpolationMethod_)\r\n        return;\r\n\r\n    \/\/ Force linear interpolation for IntRect and IntVector2\r\n    if ((valueType_ == VAR_INTRECT) || (valueType_ == VAR_INTVECTOR2))\r\n        method = IM_LINEAR;\r\n\r\n    interpolationMethod_ = method;\r\n    splineTangentsDirty_ = true;\r\n}\r\n\r\nvoid ValueAnimation::SetSplineTension(float tension)\r\n{\r\n    splineTension_ = tension;\r\n    splineTangentsDirty_ = true;\r\n}\r\n\r\nbool ValueAnimation::SetKeyFrame(float time, const Variant& value)\r\n{\r\n    if (valueType_ == VAR_NONE)\r\n        SetValueType(value.GetType());\r\n    else if (value.GetType() != valueType_)\r\n        return false;\r\n\r\n    VAnimKeyFrame keyFrame;\r\n    keyFrame.time_ = time;\r\n    keyFrame.value_ = value;\r\n\r\n    if (keyFrames_.Empty() || time > keyFrames_.Back().time_)\r\n        keyFrames_.Push(keyFrame);\r\n    else\r\n    {\r\n        for (unsigned i = 0; i < keyFrames_.Size(); ++i)\r\n        {\r\n            \/\/ Guard against interpolation error caused by division by error due to 0 delta time between two key frames\r\n            if (time == keyFrames_[i].time_)\r\n                return false;\r\n            if (time < keyFrames_[i].time_)\r\n            {\r\n                keyFrames_.Insert(i, keyFrame);\r\n                break;\r\n            }\r\n        }\r\n    }\r\n\r\n    beginTime_ = Min(time, beginTime_);\r\n    endTime_ = Max(time, endTime_);\r\n    splineTangentsDirty_ = true;\r\n\r\n    return true;\r\n}\r\n\r\nvoid ValueAnimation::SetEventFrame(float time, const StringHash& eventType, const VariantMap& eventData)\r\n{\r\n    VAnimEventFrame eventFrame;\r\n    eventFrame.time_ = time;\r\n    eventFrame.eventType_ = eventType;\r\n    eventFrame.eventData_ = eventData;\r\n\r\n    if (eventFrames_.Empty() || time >= eventFrames_.Back().time_)\r\n        eventFrames_.Push(eventFrame);\r\n    else\r\n    {\r\n        for (unsigned i = 0; i < eventFrames_.Size(); ++i)\r\n        {\r\n            if (time < eventFrames_[i].time_)\r\n            {\r\n                eventFrames_.Insert(i, eventFrame);\r\n                break;\r\n            }\r\n        }\r\n    }\r\n}\r\n\r\nbool ValueAnimation::IsValid() const\r\n{\r\n    return (interpolationMethod_ == IM_LINEAR && keyFrames_.Size() > 1) || (interpolationMethod_ == IM_SPLINE && keyFrames_.Size() > 2);\r\n}\r\n\r\nVariant ValueAnimation::GetAnimationValue(float scaledTime)\r\n{\r\n    unsigned index = 1;\r\n    for (; index < keyFrames_.Size(); ++index)\r\n    {\r\n        if (scaledTime < keyFrames_[index].time_)\r\n            break;\r\n    }\r\n\r\n    if (index >= keyFrames_.Size() || !interpolatable_)\r\n        return keyFrames_[index - 1].value_;\r\n    else\r\n    {\r\n        if (interpolationMethod_ == IM_LINEAR)\r\n            return LinearInterpolation(index - 1, index, scaledTime);\r\n        else\r\n            return SplineInterpolation(index - 1, index, scaledTime);\r\n    }\r\n}\r\n\r\nvoid ValueAnimation::GetEventFrames(float beginTime, float endTime, PODVector<const VAnimEventFrame*>& eventFrames) const\r\n{\r\n    for (unsigned i = 0; i < eventFrames_.Size(); ++i)\r\n    {\r\n        const VAnimEventFrame& eventFrame = eventFrames_[i];\r\n        if (eventFrame.time_ >= endTime)\r\n            break;\r\n\r\n        if (eventFrame.time_ >= beginTime)\r\n            eventFrames.Push(&eventFrame);\r\n    }\r\n}\r\n\r\nVariant ValueAnimation::LinearInterpolation(unsigned index1, unsigned index2, float scaledTime) const\r\n{\r\n    const VAnimKeyFrame& keyFrame1 = keyFrames_[index1];\r\n    const VAnimKeyFrame& keyFrame2 = keyFrames_[index2];\r\n\r\n    float t = (scaledTime - keyFrame1.time_) \/ (keyFrame2.time_ - keyFrame1.time_);\r\n    const Variant& value1 = keyFrame1.value_;\r\n    const Variant& value2 = keyFrame2.value_;\r\n\r\n    switch (valueType_)\r\n    {\r\n    case VAR_FLOAT:\r\n        return Lerp(value1.GetFloat(), value2.GetFloat(), t);\r\n\r\n    case VAR_VECTOR2:\r\n        return value1.GetVector2().Lerp(value2.GetVector2(), t);\r\n\r\n    case VAR_VECTOR3:\r\n        return value1.GetVector3().Lerp(value2.GetVector3(), t);\r\n\r\n    case VAR_VECTOR4:\r\n        return value1.GetVector4().Lerp(value2.GetVector4(), t);\r\n\r\n    case VAR_QUATERNION:\r\n        return value1.GetQuaternion().Slerp(value2.GetQuaternion(), t);\r\n\r\n    case VAR_COLOR:\r\n        return value1.GetColor().Lerp(value2.GetColor(), t);\r\n\r\n    case VAR_INTRECT:\r\n        {\r\n            float s = 1.0f - t;\r\n            const IntRect& r1 = value1.GetIntRect();\r\n            const IntRect& r2 = value2.GetIntRect();\r\n            return IntRect((int)(r1.left_ * s + r2.left_ * t), (int)(r1.top_ * s + r2.top_ * t), (int)(r1.right_ * s + r2.right_ * t), (int)(r1.bottom_ * s + r2.bottom_ * t));\r\n        }\r\n\r\n    case VAR_INTVECTOR2:\r\n        {\r\n            float s = 1.0f - t;\r\n            const IntVector2& v1 = value1.GetIntVector2();\r\n            const IntVector2& v2 = value2.GetIntVector2();\r\n            return IntVector2((int)(v1.x_ * s + v2.x_ * t), (int)(v1.y_ * s + v2.y_ * t));\r\n        }\r\n\r\n    default:\r\n        LOGERROR(\"Invalid value type for linear interpolation\");\r\n        return Variant::EMPTY;\r\n    }\r\n}\r\n\r\nVariant ValueAnimation::SplineInterpolation(unsigned index1, unsigned index2, float scaledTime)\r\n{\r\n    if (splineTangentsDirty_)\r\n        UpdateSplineTangents();\r\n\r\n    const VAnimKeyFrame& keyFrame1 = keyFrames_[index1];\r\n    const VAnimKeyFrame& keyFrame2 = keyFrames_[index2];\r\n\r\n    float t = (scaledTime - keyFrame1.time_) \/ (keyFrame2.time_ - keyFrame1.time_);\r\n\r\n    float tt = t * t;\r\n    float ttt = t * tt;\r\n\r\n    float h1 = 2.0f * ttt - 3.0f * tt + 1.0f;\r\n    float h2 = -2.0f * ttt + 3.0f * tt;\r\n    float h3 = ttt - 2.0f * tt + t;\r\n    float h4 = ttt - tt;\r\n\r\n    const Variant& v1 = keyFrame1.value_;\r\n    const Variant& v2 = keyFrame2.value_;\r\n    const Variant& t1 = splineTangents_[index1];\r\n    const Variant& t2 = splineTangents_[index2];\r\n\r\n    switch (valueType_)\r\n    {\r\n    case VAR_FLOAT:\r\n        return v1.GetFloat() * h1 + v2.GetFloat() * h2 + t1.GetFloat() * h3 + t2.GetFloat() * h4;\r\n\r\n    case VAR_VECTOR2:\r\n        return v1.GetVector2() * h1 + v2.GetVector2() * h2 + t1.GetVector2() * h3 + t2.GetVector2() * h4;\r\n\r\n    case VAR_VECTOR3:\r\n        return v1.GetVector3() * h1 + v2.GetVector3() * h2 + t1.GetVector3() * h3 + t2.GetVector3() * h4;\r\n\r\n    case VAR_VECTOR4:\r\n        return v1.GetVector4() * h1 + v2.GetVector4() * h2 + t1.GetVector4() * h3 + t2.GetVector4() * h4;\r\n\r\n    case VAR_QUATERNION:\r\n        return v1.GetQuaternion() * h1 + v2.GetQuaternion() * h2 + t1.GetQuaternion() * h3 + t2.GetQuaternion() * h4;\r\n\r\n    case VAR_COLOR:\r\n        return v1.GetColor() * h1 + v2.GetColor() * h2 + t1.GetColor() * h3 + t2.GetColor() * h4;\r\n\r\n    default:\r\n        LOGERROR(\"Invalid value type for spline interpolation\");\r\n        return Variant::EMPTY;\r\n    }\r\n}\r\n\r\nvoid ValueAnimation::UpdateSplineTangents()\r\n{\r\n    splineTangents_.Clear();\r\n\r\n    if (!IsValid())\r\n        return;\r\n\r\n    unsigned size = keyFrames_.Size();\r\n    splineTangents_.Resize(size);\r\n\r\n    for (unsigned i = 1; i < size - 1; ++i)\r\n        splineTangents_[i] = SubstractAndMultiply(keyFrames_[i + 1].value_, keyFrames_[i - 1].value_, splineTension_);\r\n\r\n    \/\/ If spline is not closed, make end point's tangent zero\r\n    if (keyFrames_[0].value_ != keyFrames_[size - 1].value_)\r\n        splineTangents_[0] = splineTangents_[size - 1] = SubstractAndMultiply(keyFrames_[0].value_, keyFrames_[0].value_, splineTension_);\r\n    else \r\n        splineTangents_[0] = splineTangents_[size - 1] = SubstractAndMultiply(keyFrames_[1].value_, keyFrames_[size - 2].value_, splineTension_);\r\n\r\n    splineTangentsDirty_ = false;\r\n}\r\n\r\nVariant ValueAnimation::SubstractAndMultiply(const Variant& value1, const Variant& value2, float t) const\r\n{\r\n    switch (valueType_)\r\n    {\r\n    case VAR_FLOAT:\r\n        return (value1.GetFloat() - value2.GetFloat()) * t;\r\n\r\n    case VAR_VECTOR2:\r\n        return (value1.GetVector2() - value2.GetVector2()) * t;\r\n\r\n    case VAR_VECTOR3:\r\n        return (value1.GetVector3() - value2.GetVector3()) * t;\r\n\r\n    case VAR_VECTOR4:\r\n        return (value1.GetVector4() - value2.GetVector4()) * t;\r\n\r\n    case VAR_QUATERNION:\r\n        return (value1.GetQuaternion() - value2.GetQuaternion()) * t;\r\n\r\n    case VAR_COLOR:\r\n        return (value1.GetColor() - value2.GetColor()) * t;\r\n\r\n    default:\r\n        LOGERROR(\"Invalid value type for spline interpolation's substract and multiply operation\");\r\n        return Variant::EMPTY;\r\n    }\r\n}\r\n\r\n}\r\n<commit_msg>Fix for ValueAnimation EventFrame never being called if it shares the same time as the last KeyFrame.<commit_after>\/\/\r\n\/\/ Copyright (c) 2008-2014 the Urho3D project.\r\n\/\/\r\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\r\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\r\n\/\/ in the Software without restriction, including without limitation the rights\r\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\r\n\/\/ copies of the Software, and to permit persons to whom the Software is\r\n\/\/ furnished to do so, subject to the following conditions:\r\n\/\/\r\n\/\/ The above copyright notice and this permission notice shall be included in\r\n\/\/ all copies or substantial portions of the Software.\r\n\/\/\r\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\n\/\/ THE SOFTWARE.\r\n\/\/\r\n\r\n#include \"Precompiled.h\"\r\n#include \"Animatable.h\"\r\n#include \"Context.h\"\r\n#include \"Deserializer.h\"\r\n#include \"Log.h\"\r\n#include \"ObjectAnimation.h\"\r\n#include \"Serializer.h\"\r\n#include \"ValueAnimation.h\"\r\n#include \"XMLFile.h\"\r\n\r\n#include \"DebugNew.h\"\r\n\r\nnamespace Urho3D\r\n{\r\n\r\nconst char* interpMethodNames[] = \r\n{\r\n    \"Linear\",\r\n    \"Spline\",\r\n    0\r\n};\r\n\r\nValueAnimation::ValueAnimation(Context* context) :\r\n    Resource(context),\r\n    owner_(0),\r\n    interpolationMethod_(IM_LINEAR),\r\n    splineTension_(0.5f),\r\n    valueType_(VAR_NONE),\r\n    interpolatable_(false),\r\n    beginTime_(M_INFINITY),\r\n    endTime_(-M_INFINITY),\r\n    splineTangentsDirty_(false)\r\n{\r\n}\r\n\r\nValueAnimation::~ValueAnimation()\r\n{\r\n}\r\n\r\nvoid ValueAnimation::RegisterObject(Context* context)\r\n{\r\n    context->RegisterFactory<ValueAnimation>();\r\n}\r\n\r\nbool ValueAnimation::Load(Deserializer& source)\r\n{\r\n    XMLFile xmlFile(context_);\r\n    if (!xmlFile.Load(source))\r\n        return false;\r\n\r\n    return LoadXML(xmlFile.GetRoot());\r\n}\r\n\r\nbool ValueAnimation::Save(Serializer& dest) const\r\n{\r\n    XMLFile xmlFile(context_);\r\n\r\n    XMLElement rootElem = xmlFile.CreateRoot(\"valueanimation\");\r\n    if (!SaveXML(rootElem))\r\n        return false;\r\n\r\n    return xmlFile.Save(dest);\r\n}\r\n\r\nbool ValueAnimation::LoadXML(const XMLElement& source)\r\n{\r\n    valueType_ = VAR_NONE;\r\n    eventFrames_.Clear();\r\n\r\n    String interpMethodString = source.GetAttribute(\"interpolationmethod\");\r\n    InterpMethod method = IM_LINEAR;\r\n    for (int i = 0; i <= IM_SPLINE; ++i)\r\n    {\r\n        if (interpMethodString == interpMethodNames[i])\r\n        {\r\n            method = (InterpMethod)i;\r\n            break;\r\n        }\r\n    }\r\n\r\n    SetInterpolationMethod(method);\r\n    if (interpolationMethod_ == IM_SPLINE)\r\n        splineTension_ = source.GetFloat(\"splinetension\");\r\n\r\n    XMLElement keyFrameElem = source.GetChild(\"keyframe\");\r\n    while (keyFrameElem)\r\n    {\r\n        float time = keyFrameElem.GetFloat(\"time\");\r\n        Variant value = keyFrameElem.GetVariant();\r\n        SetKeyFrame(time, value);\r\n\r\n        keyFrameElem = keyFrameElem.GetNext(\"keyframe\");\r\n    }\r\n\r\n    XMLElement eventFrameElem = source.GetChild(\"eventframe\");\r\n    while (eventFrameElem)\r\n    {\r\n        float time = eventFrameElem.GetFloat(\"time\");\r\n        unsigned eventType = eventFrameElem.GetUInt(\"eventtype\");\r\n        VariantMap eventData = eventFrameElem.GetChild(\"eventdata\").GetVariantMap();\r\n\r\n        SetEventFrame(time, StringHash(eventType), eventData);\r\n        eventFrameElem = eventFrameElem.GetNext(\"eventframe\");\r\n    }\r\n\r\n    return true;\r\n}\r\n\r\nbool ValueAnimation::SaveXML(XMLElement& dest) const\r\n{\r\n    dest.SetAttribute(\"interpolationmethod\", interpMethodNames[interpolationMethod_]);\r\n    if (interpolationMethod_ == IM_SPLINE)\r\n        dest.SetFloat(\"splinetension\", splineTension_);\r\n\r\n    for (unsigned i = 0; i < keyFrames_.Size(); ++i)\r\n    {\r\n        const VAnimKeyFrame& keyFrame = keyFrames_[i];\r\n        XMLElement keyFrameEleme = dest.CreateChild(\"keyframe\");\r\n        keyFrameEleme.SetFloat(\"time\", keyFrame.time_);\r\n        keyFrameEleme.SetVariant(keyFrame.value_);\r\n    }\r\n\r\n    for (unsigned i = 0; i < eventFrames_.Size(); ++i)\r\n    {\r\n        const VAnimEventFrame& eventFrame = eventFrames_[i];\r\n        XMLElement eventFrameElem = dest.CreateChild(\"eventframe\");\r\n        eventFrameElem.SetFloat(\"time\", eventFrame.time_);\r\n        eventFrameElem.SetUInt(\"eventtype\", eventFrame.eventType_.Value());\r\n        eventFrameElem.CreateChild(\"eventdata\").SetVariantMap(eventFrame.eventData_);\r\n    }\r\n\r\n    return true;\r\n}\r\n\r\nvoid ValueAnimation::SetValueType(VariantType valueType)\r\n{\r\n    if (valueType == valueType_)\r\n        return;\r\n\r\n    valueType_ = valueType;\r\n    interpolatable_ = (valueType_ == VAR_FLOAT) || (valueType_ == VAR_VECTOR2) || (valueType_ == VAR_VECTOR3) || (valueType_ == VAR_VECTOR4) ||\r\n        (valueType_ == VAR_QUATERNION) || (valueType_ == VAR_COLOR);\r\n\r\n    if ((valueType_ == VAR_INTRECT) || (valueType_ == VAR_INTVECTOR2))\r\n    {\r\n        interpolatable_ = true;\r\n        \/\/ Force linear interpolation for IntRect and IntVector2\r\n        interpolationMethod_ = IM_LINEAR;\r\n    }\r\n\r\n    keyFrames_.Clear();\r\n    eventFrames_.Clear();\r\n    beginTime_ = M_INFINITY;\r\n    endTime_ = -M_INFINITY;\r\n}\r\n\r\nvoid ValueAnimation::SetOwner(void* owner)\r\n{\r\n    owner_ = owner;\r\n}\r\n\r\nvoid ValueAnimation::SetInterpolationMethod(InterpMethod method)\r\n{\r\n    if (method == interpolationMethod_)\r\n        return;\r\n\r\n    \/\/ Force linear interpolation for IntRect and IntVector2\r\n    if ((valueType_ == VAR_INTRECT) || (valueType_ == VAR_INTVECTOR2))\r\n        method = IM_LINEAR;\r\n\r\n    interpolationMethod_ = method;\r\n    splineTangentsDirty_ = true;\r\n}\r\n\r\nvoid ValueAnimation::SetSplineTension(float tension)\r\n{\r\n    splineTension_ = tension;\r\n    splineTangentsDirty_ = true;\r\n}\r\n\r\nbool ValueAnimation::SetKeyFrame(float time, const Variant& value)\r\n{\r\n    if (valueType_ == VAR_NONE)\r\n        SetValueType(value.GetType());\r\n    else if (value.GetType() != valueType_)\r\n        return false;\r\n\r\n    VAnimKeyFrame keyFrame;\r\n    keyFrame.time_ = time;\r\n    keyFrame.value_ = value;\r\n\r\n    if (keyFrames_.Empty() || time > keyFrames_.Back().time_)\r\n        keyFrames_.Push(keyFrame);\r\n    else\r\n    {\r\n        for (unsigned i = 0; i < keyFrames_.Size(); ++i)\r\n        {\r\n            \/\/ Guard against interpolation error caused by division by error due to 0 delta time between two key frames\r\n            if (time == keyFrames_[i].time_)\r\n                return false;\r\n            if (time < keyFrames_[i].time_)\r\n            {\r\n                keyFrames_.Insert(i, keyFrame);\r\n                break;\r\n            }\r\n        }\r\n    }\r\n\r\n    beginTime_ = Min(time, beginTime_);\r\n    endTime_ = Max(time, endTime_);\r\n    splineTangentsDirty_ = true;\r\n\r\n    return true;\r\n}\r\n\r\nvoid ValueAnimation::SetEventFrame(float time, const StringHash& eventType, const VariantMap& eventData)\r\n{\r\n    VAnimEventFrame eventFrame;\r\n    eventFrame.time_ = time;\r\n    eventFrame.eventType_ = eventType;\r\n    eventFrame.eventData_ = eventData;\r\n\r\n    if (eventFrames_.Empty() || time >= eventFrames_.Back().time_)\r\n        eventFrames_.Push(eventFrame);\r\n    else\r\n    {\r\n        for (unsigned i = 0; i < eventFrames_.Size(); ++i)\r\n        {\r\n            if (time < eventFrames_[i].time_)\r\n            {\r\n                eventFrames_.Insert(i, eventFrame);\r\n                break;\r\n            }\r\n        }\r\n    }\r\n}\r\n\r\nbool ValueAnimation::IsValid() const\r\n{\r\n    return (interpolationMethod_ == IM_LINEAR && keyFrames_.Size() > 1) || (interpolationMethod_ == IM_SPLINE && keyFrames_.Size() > 2);\r\n}\r\n\r\nVariant ValueAnimation::GetAnimationValue(float scaledTime)\r\n{\r\n    unsigned index = 1;\r\n    for (; index < keyFrames_.Size(); ++index)\r\n    {\r\n        if (scaledTime < keyFrames_[index].time_)\r\n            break;\r\n    }\r\n\r\n    if (index >= keyFrames_.Size() || !interpolatable_)\r\n        return keyFrames_[index - 1].value_;\r\n    else\r\n    {\r\n        if (interpolationMethod_ == IM_LINEAR)\r\n            return LinearInterpolation(index - 1, index, scaledTime);\r\n        else\r\n            return SplineInterpolation(index - 1, index, scaledTime);\r\n    }\r\n}\r\n\r\nvoid ValueAnimation::GetEventFrames(float beginTime, float endTime, PODVector<const VAnimEventFrame*>& eventFrames) const\r\n{\r\n    for (unsigned i = 0; i < eventFrames_.Size(); ++i)\r\n    {\r\n        const VAnimEventFrame& eventFrame = eventFrames_[i];\r\n        if (eventFrame.time_ > endTime)\r\n            break;\r\n\r\n        if (eventFrame.time_ >= beginTime)\r\n            eventFrames.Push(&eventFrame);\r\n    }\r\n}\r\n\r\nVariant ValueAnimation::LinearInterpolation(unsigned index1, unsigned index2, float scaledTime) const\r\n{\r\n    const VAnimKeyFrame& keyFrame1 = keyFrames_[index1];\r\n    const VAnimKeyFrame& keyFrame2 = keyFrames_[index2];\r\n\r\n    float t = (scaledTime - keyFrame1.time_) \/ (keyFrame2.time_ - keyFrame1.time_);\r\n    const Variant& value1 = keyFrame1.value_;\r\n    const Variant& value2 = keyFrame2.value_;\r\n\r\n    switch (valueType_)\r\n    {\r\n    case VAR_FLOAT:\r\n        return Lerp(value1.GetFloat(), value2.GetFloat(), t);\r\n\r\n    case VAR_VECTOR2:\r\n        return value1.GetVector2().Lerp(value2.GetVector2(), t);\r\n\r\n    case VAR_VECTOR3:\r\n        return value1.GetVector3().Lerp(value2.GetVector3(), t);\r\n\r\n    case VAR_VECTOR4:\r\n        return value1.GetVector4().Lerp(value2.GetVector4(), t);\r\n\r\n    case VAR_QUATERNION:\r\n        return value1.GetQuaternion().Slerp(value2.GetQuaternion(), t);\r\n\r\n    case VAR_COLOR:\r\n        return value1.GetColor().Lerp(value2.GetColor(), t);\r\n\r\n    case VAR_INTRECT:\r\n        {\r\n            float s = 1.0f - t;\r\n            const IntRect& r1 = value1.GetIntRect();\r\n            const IntRect& r2 = value2.GetIntRect();\r\n            return IntRect((int)(r1.left_ * s + r2.left_ * t), (int)(r1.top_ * s + r2.top_ * t), (int)(r1.right_ * s + r2.right_ * t), (int)(r1.bottom_ * s + r2.bottom_ * t));\r\n        }\r\n\r\n    case VAR_INTVECTOR2:\r\n        {\r\n            float s = 1.0f - t;\r\n            const IntVector2& v1 = value1.GetIntVector2();\r\n            const IntVector2& v2 = value2.GetIntVector2();\r\n            return IntVector2((int)(v1.x_ * s + v2.x_ * t), (int)(v1.y_ * s + v2.y_ * t));\r\n        }\r\n\r\n    default:\r\n        LOGERROR(\"Invalid value type for linear interpolation\");\r\n        return Variant::EMPTY;\r\n    }\r\n}\r\n\r\nVariant ValueAnimation::SplineInterpolation(unsigned index1, unsigned index2, float scaledTime)\r\n{\r\n    if (splineTangentsDirty_)\r\n        UpdateSplineTangents();\r\n\r\n    const VAnimKeyFrame& keyFrame1 = keyFrames_[index1];\r\n    const VAnimKeyFrame& keyFrame2 = keyFrames_[index2];\r\n\r\n    float t = (scaledTime - keyFrame1.time_) \/ (keyFrame2.time_ - keyFrame1.time_);\r\n\r\n    float tt = t * t;\r\n    float ttt = t * tt;\r\n\r\n    float h1 = 2.0f * ttt - 3.0f * tt + 1.0f;\r\n    float h2 = -2.0f * ttt + 3.0f * tt;\r\n    float h3 = ttt - 2.0f * tt + t;\r\n    float h4 = ttt - tt;\r\n\r\n    const Variant& v1 = keyFrame1.value_;\r\n    const Variant& v2 = keyFrame2.value_;\r\n    const Variant& t1 = splineTangents_[index1];\r\n    const Variant& t2 = splineTangents_[index2];\r\n\r\n    switch (valueType_)\r\n    {\r\n    case VAR_FLOAT:\r\n        return v1.GetFloat() * h1 + v2.GetFloat() * h2 + t1.GetFloat() * h3 + t2.GetFloat() * h4;\r\n\r\n    case VAR_VECTOR2:\r\n        return v1.GetVector2() * h1 + v2.GetVector2() * h2 + t1.GetVector2() * h3 + t2.GetVector2() * h4;\r\n\r\n    case VAR_VECTOR3:\r\n        return v1.GetVector3() * h1 + v2.GetVector3() * h2 + t1.GetVector3() * h3 + t2.GetVector3() * h4;\r\n\r\n    case VAR_VECTOR4:\r\n        return v1.GetVector4() * h1 + v2.GetVector4() * h2 + t1.GetVector4() * h3 + t2.GetVector4() * h4;\r\n\r\n    case VAR_QUATERNION:\r\n        return v1.GetQuaternion() * h1 + v2.GetQuaternion() * h2 + t1.GetQuaternion() * h3 + t2.GetQuaternion() * h4;\r\n\r\n    case VAR_COLOR:\r\n        return v1.GetColor() * h1 + v2.GetColor() * h2 + t1.GetColor() * h3 + t2.GetColor() * h4;\r\n\r\n    default:\r\n        LOGERROR(\"Invalid value type for spline interpolation\");\r\n        return Variant::EMPTY;\r\n    }\r\n}\r\n\r\nvoid ValueAnimation::UpdateSplineTangents()\r\n{\r\n    splineTangents_.Clear();\r\n\r\n    if (!IsValid())\r\n        return;\r\n\r\n    unsigned size = keyFrames_.Size();\r\n    splineTangents_.Resize(size);\r\n\r\n    for (unsigned i = 1; i < size - 1; ++i)\r\n        splineTangents_[i] = SubstractAndMultiply(keyFrames_[i + 1].value_, keyFrames_[i - 1].value_, splineTension_);\r\n\r\n    \/\/ If spline is not closed, make end point's tangent zero\r\n    if (keyFrames_[0].value_ != keyFrames_[size - 1].value_)\r\n        splineTangents_[0] = splineTangents_[size - 1] = SubstractAndMultiply(keyFrames_[0].value_, keyFrames_[0].value_, splineTension_);\r\n    else \r\n        splineTangents_[0] = splineTangents_[size - 1] = SubstractAndMultiply(keyFrames_[1].value_, keyFrames_[size - 2].value_, splineTension_);\r\n\r\n    splineTangentsDirty_ = false;\r\n}\r\n\r\nVariant ValueAnimation::SubstractAndMultiply(const Variant& value1, const Variant& value2, float t) const\r\n{\r\n    switch (valueType_)\r\n    {\r\n    case VAR_FLOAT:\r\n        return (value1.GetFloat() - value2.GetFloat()) * t;\r\n\r\n    case VAR_VECTOR2:\r\n        return (value1.GetVector2() - value2.GetVector2()) * t;\r\n\r\n    case VAR_VECTOR3:\r\n        return (value1.GetVector3() - value2.GetVector3()) * t;\r\n\r\n    case VAR_VECTOR4:\r\n        return (value1.GetVector4() - value2.GetVector4()) * t;\r\n\r\n    case VAR_QUATERNION:\r\n        return (value1.GetQuaternion() - value2.GetQuaternion()) * t;\r\n\r\n    case VAR_COLOR:\r\n        return (value1.GetColor() - value2.GetColor()) * t;\r\n\r\n    default:\r\n        LOGERROR(\"Invalid value type for spline interpolation's substract and multiply operation\");\r\n        return Variant::EMPTY;\r\n    }\r\n}\r\n\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * fMBT, free Model Based Testing tool\n * Copyright (c) 2011, Intel Corporation.\n *\n * This program is free software; you can redistribute it and\/or modify it\n * under the terms and conditions of the GNU Lesser General Public License,\n * version 2.1, as published by the Free Software Foundation.\n *\n * This program is distributed in the hope 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 for\n * more 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.,\n * 51 Franklin St - Fifth Floor, Boston, MA 02110-1301 USA.\n *\n *\/\n\n\/* Coverage_Tree implements a permutation coverage. Coverage reaches\n * 1.0 when all permutations of any n subsequent actions have been\n * executed. n is given as a parameter.\n *\/\n\n#ifndef __coverage_tree_hh__\n#define __coverage_tree_hh__\n\n#include \"coverage.hh\"\n\n#include <map>\n\nclass Coverage_Tree: public Coverage {\n\npublic:\n  Coverage_Tree(Log& l, std::string params);\n  virtual void push(){};\n  virtual void pop(){};\n\n  virtual bool execute(int action);\n  virtual float getCoverage();\n\n  virtual int fitness(int* actions,int n, float* fitness);\n\n  void set_max_depth(std::string&s);\n\n  virtual void set_model(Model* _model);\n\nprotected:\n  void precalc();\n  int max_depth;\n\n  struct node;\n\n  struct node {\n    int action;\n    std::map<int,struct node*> nodes;\n  };\n\n  struct node root_node;\n  long node_count;\n  long max_count;\n\n  std::map<int,struct node*> exec;\n\n  void print_tree(struct node* node,int depth);\n\n};\n\n#endif\n\n<commit_msg>documented data structure in coverage_tree.hh<commit_after>\/*\n * fMBT, free Model Based Testing tool\n * Copyright (c) 2011, Intel Corporation.\n *\n * This program is free software; you can redistribute it and\/or modify it\n * under the terms and conditions of the GNU Lesser General Public License,\n * version 2.1, as published by the Free Software Foundation.\n *\n * This program is distributed in the hope 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 for\n * more 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.,\n * 51 Franklin St - Fifth Floor, Boston, MA 02110-1301 USA.\n *\n *\/\n\n\/* Coverage_Tree implements a permutation coverage. Coverage reaches\n * 1.0 when all permutations of any n subsequent actions have been\n * executed. n is given as a parameter.\n *\/\n\n#ifndef __coverage_tree_hh__\n#define __coverage_tree_hh__\n\n#include \"coverage.hh\"\n\n#include <map>\n\nclass Coverage_Tree: public Coverage {\n\npublic:\n  Coverage_Tree(Log& l, std::string params);\n  virtual void push(){};\n  virtual void pop(){};\n\n  virtual bool execute(int action);\n  virtual float getCoverage();\n\n  virtual int fitness(int* actions,int n, float* fitness);\n\n  void set_max_depth(std::string&s);\n\n  virtual void set_model(Model* _model);\n\nprotected:\n  void precalc();\n  int max_depth;\n\n  \/* \n     The data structure\n\n     root_node is the root of the tree where each node represents an\n     executed action, and contains a map of actions executed after it.\n\n     exec points to nodes that need to be updated on next execute().\n     \n     Example how data structure evolves when two actions are executed\n     with depth == 3:\n     \n     0. Initial state:\n     \n        exec = {0 -> root_node}\n     \n        root_node\n          .action = 0\n          .nodes = {}\n     \n     1. Add action 42:\n     \n        exec = {0 -> root_node,\n                1 -> node_1}\n\n        root_node\n          .action = 0\n          .nodes = {42 -> node_1}\n\n        node_1\n          .action = 42\n          .nodes = {}\n\n    2. Add action 53:\n\n       exec = {0 -> root_node,\n               1 -> node_2,\n               2 -> node_1}\n\n       root_node\n         .action = 0\n         .nodes = {42 -> node_1,\n                   53 -> node_2}\n\n       node_1\n         .action = 42\n         .nodes = {53 -> node_3}\n\n       node_2\n         .action = 53\n         .nodes = {}\n\n       node_3\n         .action = 53\n         .nodes = {}\n   *\/\n\n\n  struct node;\n\n  struct node {\n    int action;\n    std::map<int,struct node*> nodes;\n  };\n\n  struct node root_node;\n  long node_count;\n  long max_count;\n\n  std::map<int,struct node*> exec;\n\n  void print_tree(struct node* node,int depth);\n\n};\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/* *** This file is part of bbox ***\n *\n * Copyright (C) 2010 Andrea Marchesini <baku@ippolita.net>.\n *\n * This program is free software. It is released under the terms of\n * the BSD License. See license.txt for more details.\n *\/\n\n#include \"bbapplication.h\"\n\n#include \"bbpreferences.h\"\n#include \"bbabout.h\"\n#include \"bbsettings.h\"\n#include \"bbstartup.h\"\n#include \"bbobserver.h\"\n#include \"bbactionmanager.h\"\n#include \"bboperations.h\"\n#include \"bbsendreceive.h\"\n#include \"bblogs.h\"\n#include \"bbsvn.h\"\n#include \"bbsvnstatus.h\"\n#include \"bbdebug.h\"\n#include \"bbconst.h\"\n\n#include <QTime>\n#include <QMenu>\n#include <QAction>\n#include <QFileDialog>\n#include <QMessageBox>\n#include <QTimer>\n#include <QSplashScreen>\n#include <QDesktopServices>\n#include <QUrl>\n\n#ifdef Q_OS_WIN32\n    #include <windows.h>\n    #include <winbase.h>\n#endif\n\nQPointer<BBApplication> BBApplication::m_instance;\n\nBBApplication::BBApplication(int &argc, char **argv) :\n    QApplication(argc, argv, true),\n    m_timer(0),\n    m_iconBlink(false)\n{\n    BBDEBUG;\n\n    m_instance = this;\n\n    qsrand(QTime::currentTime().msec());\n}\n\nBBApplication::~BBApplication()\n{\n    BBDEBUG;\n    delete m_systemTray;\n}\n\nBBApplication* BBApplication::instance()\n{\n    return m_instance;\n}\n\nvoid BBApplication::splash()\n{\n    BBDEBUG;\n    QPixmap pixmap(BB_LOGO_IMAGE);\n    QSplashScreen splash(pixmap);\n    splash.show();\n\n    for(int i=0; i<20; ++i) {\n        processEvents();\n#ifdef Q_OS_WIN32\n        Sleep(100);\n#else\n        usleep(100000);\n#endif\n    }\n}\n\nvoid BBApplication::init()\n{\n    BBDEBUG;\n\n    systemTray();\n\n    if (!BBSettings::instance()->isValid() &&\n        !preferences()) {\n        quit();\n        return;\n    }\n\n    \/\/ Instance of startup created:\n    BBStartup::instance();\n\n    m_observer = new BBObserver(this);\n\n    scheduleRemoteAction();\n}\n\nvoid BBApplication::systemTray()\n{\n    BBDEBUG;\n\n    QMenu *menu = new QMenu();\n\n    QFont font;\n    font.setBold(true);\n\n    m_actionCommit = new QAction(tr(\"&Sync\"), this);\n    m_actionCommit->setFont(font);\n    menu->addAction(m_actionCommit);\n    connect (m_actionCommit,\n             SIGNAL(triggered()),\n             SLOT(onCommitTriggered()));\n\n    QAction *actionChanges = new QAction(tr(\"&Changes\"), this);\n    menu->addAction(actionChanges);\n    m_menuChanges = new QMenu();\n    actionChanges->setMenu(m_menuChanges);\n    changes(QList<BBSvnStatus*>());\n\n    menu->addSeparator();\n\n    m_actionCommit = new QAction(tr(\"See &logs\"), this);\n    menu->addAction(m_actionCommit);\n    connect (m_actionCommit,\n             SIGNAL(triggered()),\n             SLOT(onLogsTriggered()));\n\n    menu->addSeparator();\n\n    QAction *actionOpen = new QAction(tr(\"&Open folder\"), this);\n    menu->addAction(actionOpen);\n    connect (actionOpen,\n             SIGNAL(triggered()),\n             SLOT(onOpenTriggered()));\n\n    menu->addSeparator();\n\n    QAction *preferences = new QAction(tr(\"&Preferences\"), this);\n    menu->addAction(preferences);\n    connect (preferences,\n             SIGNAL(triggered()),\n             SLOT(preferences()));\n\n    QAction *about = new QAction(tr(\"&About\"), this);\n    menu->addAction(about);\n    connect (about,\n             SIGNAL(triggered()),\n             SLOT(about()));\n\n    menu->addSeparator();\n\n    QAction *actionQuit = new QAction(tr(\"&Quit\"), this);\n    menu->addAction(actionQuit);\n    connect (actionQuit,\n             SIGNAL(triggered()),\n             SLOT(quit()));\n\n    m_systemTray = new QSystemTrayIcon();\n    m_systemTray->setContextMenu(menu);\n\n    m_systemTray->setIcon(QIcon(BB_ICON_IMAGE));\n    m_systemTray->show();\n\n    connect(m_systemTray,\n            SIGNAL(activated(QSystemTrayIcon::ActivationReason)),\n            SLOT(onActivated(QSystemTrayIcon::ActivationReason)));\n}\n\nbool BBApplication::preferences()\n{\n    BBDEBUG;\n\n    BBPreferences preferences;\n    preferences.exec();\n\n    if (!BBSettings::instance()->isValid()) {\n        QMessageBox::critical(0,\n                              BBPACKAGE,\n                              tr(\"No configuration, no party.\"));\n        return false;\n    }\n\n    return true;\n}\n\nvoid BBApplication::about()\n{\n    BBDEBUG;\n\n    BBAbout about;\n    about.exec();\n}\n\nvoid BBApplication::scheduleRemoteAction()\n{\n    BBDEBUG;\n\n    m_observer->scheduleRemoteChanges();\n\n    uint time = BBSettings::instance()->timerRemoteAction() * 10;\n    int when(qrand() % ((time \/ 2) * 6) + time); \/\/ Random between time\/2 and time\n    BBDEBUG << \"Next: \" << when << \" seconds.\";\n\n    QTimer::singleShot(when * 1000,\n                       this,\n                       SLOT(scheduleRemoteAction()));\n}\n\nvoid BBApplication::addError(const QString& error)\n{\n    BBDEBUG;\n\n    showMessage(tr(\"Error!\"), error, true);\n}\n\nvoid BBApplication::commit()\n{\n    BBDEBUG;\n    blink(true);\n\n    if (BBSettings::instance()->autoCommit()) {\n        if (m_sendReceive.isNull()) {\n            m_sendReceive = new BBSendReceive(this);\n            connect(m_sendReceive,\n                    SIGNAL(done(bool)),\n                    SLOT(onSendReceiveDone(bool)));\n        }\n\n        if (m_sendReceive->isRunning() == false) {\n            m_sendReceive->start();\n        }\n\n        resetLastMessage();\n\n    } else {\n        showMessage(tr(\"Something new!\"), tr(\"Click to share your changes to other users\"));\n    }\n}\n\nvoid BBApplication::update()\n{\n    BBDEBUG;\n    blink(true);\n\n    showMessage(tr(\"Something new!\"), tr(\"Click to have changes from other users\"));\n}\n\nvoid BBApplication::blink(bool enabled)\n{\n    BBDEBUG << enabled;\n\n    if (enabled == true && !m_timer) {\n        m_timer = startTimer(BB_BLINK_TIMEOUT);\n    } else if(enabled == false && m_timer) {\n        m_systemTray->setIcon(QIcon(BB_ICON_IMAGE));\n        killTimer(m_timer);\n        m_timer = 0;\n    }\n}\n\nvoid BBApplication::timerEvent(QTimerEvent *event)\n{\n    Q_UNUSED(event);\n    if (m_timer == 0)\n        return;\n\n    if (!m_iconBlink)\n        m_systemTray->setIcon(QIcon(BB_BLINK_IMAGE));\n    else\n        m_systemTray->setIcon(QIcon(BB_ICON_IMAGE));\n\n    m_iconBlink = !m_iconBlink;\n}\n\nvoid BBApplication::onCommitTriggered()\n{\n    BBDEBUG;\n\n    if (m_operations.isNull()) {\n        blink(true);\n\n        resetLastMessage();\n        m_operations = new BBOperations();\n        connect(m_operations.data(),\n                SIGNAL(destroyed()),\n                SLOT(onOperationsDestroyed()));\n\n    } else {\n        m_operations->activateWindow();\n    }\n\n    m_operations->show();\n}\n\nvoid BBApplication::onOperationsDestroyed()\n{\n    BBDEBUG;\n\n    blink(false);\n    m_operations = 0;\n}\n\nBBObserver* BBApplication::observer()\n{\n    return m_observer;\n}\n\nvoid BBApplication::onSendReceiveDone(bool status)\n{\n    BBDEBUG;\n    Q_UNUSED(status);\n\n    blink(false);\n}\n\nvoid BBApplication::onOpenTriggered()\n{\n    BBDEBUG;\n    QDesktopServices::openUrl(QUrl::fromLocalFile(BBSettings::instance()->directory()).toString());\n}\n\nvoid BBApplication::onLogsTriggered()\n{\n    BBDEBUG;\n    new BBLogs(this);\n}\n\nvoid BBApplication::onActivated(QSystemTrayIcon::ActivationReason reason)\n{\n    BBDEBUG << reason;\n\n    if (reason == QSystemTrayIcon::DoubleClick)\n        onCommitTriggered();\n}\n\nvoid BBApplication::changes(const QList<BBSvnStatus*>& changes)\n{\n    BBDEBUG << changes;\n\n    m_menuChanges->clear();\n\n    if (changes.isEmpty()) {\n        QFont font;\n        font.setStyle(QFont::StyleItalic);\n\n        QAction* emptyAction = new QAction(tr(\"No changes\"), this);\n        emptyAction->setFont(font);\n        m_menuChanges->addAction(emptyAction);\n        return;\n    }\n\n    foreach(BBSvnStatus* status, changes) {\n        QString message;\n\n        switch(status->status()) {\n            case BBSvnStatus::StatusUnknown:\n               message = tr(\"%1 (unknown operation)\").arg(status->file().remove(BBSettings::instance()->directory()));\n               break;\n\n            case BBSvnStatus::StatusAdded:\n               message = tr(\"%1 added\").arg(status->file().remove(BBSettings::instance()->directory()));\n               break;\n\n            case BBSvnStatus::StatusConflicted:\n               message = tr(\"%1 conflicted\").arg(status->file().remove(BBSettings::instance()->directory()));\n               break;\n\n            case BBSvnStatus::StatusDeleted:\n               message = tr(\"%1 deleted\").arg(status->file().remove(BBSettings::instance()->directory()));\n               break;\n\n            case BBSvnStatus::StatusModified:\n               message = tr(\"%1 modified\").arg(status->file().remove(BBSettings::instance()->directory()));\n               break;\n\n            case BBSvnStatus::StatusReplaced:\n               message = tr(\"%1 replaced\").arg(status->file().remove(BBSettings::instance()->directory()));\n               break;\n\n            case BBSvnStatus::StatusNew:\n               message = tr(\"%1 is new\").arg(status->file().remove(BBSettings::instance()->directory()));\n               break;\n\n            case BBSvnStatus::StatusMissing:\n               message = tr(\"%1 missing\").arg(status->file().remove(BBSettings::instance()->directory()));\n               break;\n\n            case BBSvnStatus::StatusUpdated:\n               message = tr(\"%1 updated\").arg(status->file().remove(BBSettings::instance()->directory()));\n               break;\n\n            case BBSvnStatus::StatusMerged:\n               message = tr(\"%1 merged\").arg(status->file().remove(BBSettings::instance()->directory()));\n               break;\n\n            case BBSvnStatus::StatusExisted:\n               message = tr(\"%1 existed\").arg(status->file().remove(BBSettings::instance()->directory()));\n               break;\n\n            case BBSvnStatus::StatusObstructed:\n               message = tr(\"%1 obstructed\").arg(status->file().remove(BBSettings::instance()->directory()));\n               break;\n        }\n\n        QAction* action = new QAction(message, this);\n        m_menuChanges->addAction(action);\n    }\n}\n\nvoid BBApplication::showMessage(const QString &title, const QString &message, bool isWarning)\n{\n    BBDEBUG << title << message << isWarning;\n\n    if (!m_systemTray->supportsMessages())\n        return;\n\n    \/\/ The fastest way to have something 'unique':\n    QString hash(QString(\"%1|%2|%3\").arg(title).arg(message).arg(isWarning));\n    if (hash == m_lastMessage)\n        return;\n\n    m_lastMessage = hash;\n\n    m_systemTray->showMessage(title, message, isWarning ? QSystemTrayIcon::Warning :\n                                                          QSystemTrayIcon::Information);\n}\n\nvoid BBApplication::resetLastMessage()\n{\n    m_lastMessage.clear();\n}\n<commit_msg>see logs -> see history<commit_after>\/* *** This file is part of bbox ***\n *\n * Copyright (C) 2010 Andrea Marchesini <baku@ippolita.net>.\n *\n * This program is free software. It is released under the terms of\n * the BSD License. See license.txt for more details.\n *\/\n\n#include \"bbapplication.h\"\n\n#include \"bbpreferences.h\"\n#include \"bbabout.h\"\n#include \"bbsettings.h\"\n#include \"bbstartup.h\"\n#include \"bbobserver.h\"\n#include \"bbactionmanager.h\"\n#include \"bboperations.h\"\n#include \"bbsendreceive.h\"\n#include \"bblogs.h\"\n#include \"bbsvn.h\"\n#include \"bbsvnstatus.h\"\n#include \"bbdebug.h\"\n#include \"bbconst.h\"\n\n#include <QTime>\n#include <QMenu>\n#include <QAction>\n#include <QFileDialog>\n#include <QMessageBox>\n#include <QTimer>\n#include <QSplashScreen>\n#include <QDesktopServices>\n#include <QUrl>\n\n#ifdef Q_OS_WIN32\n    #include <windows.h>\n    #include <winbase.h>\n#endif\n\nQPointer<BBApplication> BBApplication::m_instance;\n\nBBApplication::BBApplication(int &argc, char **argv) :\n    QApplication(argc, argv, true),\n    m_timer(0),\n    m_iconBlink(false)\n{\n    BBDEBUG;\n\n    m_instance = this;\n\n    qsrand(QTime::currentTime().msec());\n}\n\nBBApplication::~BBApplication()\n{\n    BBDEBUG;\n    delete m_systemTray;\n}\n\nBBApplication* BBApplication::instance()\n{\n    return m_instance;\n}\n\nvoid BBApplication::splash()\n{\n    BBDEBUG;\n    QPixmap pixmap(BB_LOGO_IMAGE);\n    QSplashScreen splash(pixmap);\n    splash.show();\n\n    for(int i=0; i<20; ++i) {\n        processEvents();\n#ifdef Q_OS_WIN32\n        Sleep(100);\n#else\n        usleep(100000);\n#endif\n    }\n}\n\nvoid BBApplication::init()\n{\n    BBDEBUG;\n\n    systemTray();\n\n    if (!BBSettings::instance()->isValid() &&\n        !preferences()) {\n        quit();\n        return;\n    }\n\n    \/\/ Instance of startup created:\n    BBStartup::instance();\n\n    m_observer = new BBObserver(this);\n\n    scheduleRemoteAction();\n}\n\nvoid BBApplication::systemTray()\n{\n    BBDEBUG;\n\n    QMenu *menu = new QMenu();\n\n    QFont font;\n    font.setBold(true);\n\n    m_actionCommit = new QAction(tr(\"&Sync\"), this);\n    m_actionCommit->setFont(font);\n    menu->addAction(m_actionCommit);\n    connect (m_actionCommit,\n             SIGNAL(triggered()),\n             SLOT(onCommitTriggered()));\n\n    QAction *actionChanges = new QAction(tr(\"&Changes\"), this);\n    menu->addAction(actionChanges);\n    m_menuChanges = new QMenu();\n    actionChanges->setMenu(m_menuChanges);\n    changes(QList<BBSvnStatus*>());\n\n    menu->addSeparator();\n\n    m_actionCommit = new QAction(tr(\"See &history\"), this);\n    menu->addAction(m_actionCommit);\n    connect (m_actionCommit,\n             SIGNAL(triggered()),\n             SLOT(onLogsTriggered()));\n\n    menu->addSeparator();\n\n    QAction *actionOpen = new QAction(tr(\"&Open folder\"), this);\n    menu->addAction(actionOpen);\n    connect (actionOpen,\n             SIGNAL(triggered()),\n             SLOT(onOpenTriggered()));\n\n    menu->addSeparator();\n\n    QAction *preferences = new QAction(tr(\"&Preferences\"), this);\n    menu->addAction(preferences);\n    connect (preferences,\n             SIGNAL(triggered()),\n             SLOT(preferences()));\n\n    QAction *about = new QAction(tr(\"&About\"), this);\n    menu->addAction(about);\n    connect (about,\n             SIGNAL(triggered()),\n             SLOT(about()));\n\n    menu->addSeparator();\n\n    QAction *actionQuit = new QAction(tr(\"&Quit\"), this);\n    menu->addAction(actionQuit);\n    connect (actionQuit,\n             SIGNAL(triggered()),\n             SLOT(quit()));\n\n    m_systemTray = new QSystemTrayIcon();\n    m_systemTray->setContextMenu(menu);\n\n    m_systemTray->setIcon(QIcon(BB_ICON_IMAGE));\n    m_systemTray->show();\n\n    connect(m_systemTray,\n            SIGNAL(activated(QSystemTrayIcon::ActivationReason)),\n            SLOT(onActivated(QSystemTrayIcon::ActivationReason)));\n}\n\nbool BBApplication::preferences()\n{\n    BBDEBUG;\n\n    BBPreferences preferences;\n    preferences.exec();\n\n    if (!BBSettings::instance()->isValid()) {\n        QMessageBox::critical(0,\n                              BBPACKAGE,\n                              tr(\"No configuration, no party.\"));\n        return false;\n    }\n\n    return true;\n}\n\nvoid BBApplication::about()\n{\n    BBDEBUG;\n\n    BBAbout about;\n    about.exec();\n}\n\nvoid BBApplication::scheduleRemoteAction()\n{\n    BBDEBUG;\n\n    m_observer->scheduleRemoteChanges();\n\n    uint time = BBSettings::instance()->timerRemoteAction() * 10;\n    int when(qrand() % ((time \/ 2) * 6) + time); \/\/ Random between time\/2 and time\n    BBDEBUG << \"Next: \" << when << \" seconds.\";\n\n    QTimer::singleShot(when * 1000,\n                       this,\n                       SLOT(scheduleRemoteAction()));\n}\n\nvoid BBApplication::addError(const QString& error)\n{\n    BBDEBUG;\n\n    showMessage(tr(\"Error!\"), error, true);\n}\n\nvoid BBApplication::commit()\n{\n    BBDEBUG;\n    blink(true);\n\n    if (BBSettings::instance()->autoCommit()) {\n        if (m_sendReceive.isNull()) {\n            m_sendReceive = new BBSendReceive(this);\n            connect(m_sendReceive,\n                    SIGNAL(done(bool)),\n                    SLOT(onSendReceiveDone(bool)));\n        }\n\n        if (m_sendReceive->isRunning() == false) {\n            m_sendReceive->start();\n        }\n\n        resetLastMessage();\n\n    } else {\n        showMessage(tr(\"Something new!\"), tr(\"Click to share your changes to other users\"));\n    }\n}\n\nvoid BBApplication::update()\n{\n    BBDEBUG;\n    blink(true);\n\n    showMessage(tr(\"Something new!\"), tr(\"Click to have changes from other users\"));\n}\n\nvoid BBApplication::blink(bool enabled)\n{\n    BBDEBUG << enabled;\n\n    if (enabled == true && !m_timer) {\n        m_timer = startTimer(BB_BLINK_TIMEOUT);\n    } else if(enabled == false && m_timer) {\n        m_systemTray->setIcon(QIcon(BB_ICON_IMAGE));\n        killTimer(m_timer);\n        m_timer = 0;\n    }\n}\n\nvoid BBApplication::timerEvent(QTimerEvent *event)\n{\n    Q_UNUSED(event);\n    if (m_timer == 0)\n        return;\n\n    if (!m_iconBlink)\n        m_systemTray->setIcon(QIcon(BB_BLINK_IMAGE));\n    else\n        m_systemTray->setIcon(QIcon(BB_ICON_IMAGE));\n\n    m_iconBlink = !m_iconBlink;\n}\n\nvoid BBApplication::onCommitTriggered()\n{\n    BBDEBUG;\n\n    if (m_operations.isNull()) {\n        blink(true);\n\n        resetLastMessage();\n        m_operations = new BBOperations();\n        connect(m_operations.data(),\n                SIGNAL(destroyed()),\n                SLOT(onOperationsDestroyed()));\n\n    } else {\n        m_operations->activateWindow();\n    }\n\n    m_operations->show();\n}\n\nvoid BBApplication::onOperationsDestroyed()\n{\n    BBDEBUG;\n\n    blink(false);\n    m_operations = 0;\n}\n\nBBObserver* BBApplication::observer()\n{\n    return m_observer;\n}\n\nvoid BBApplication::onSendReceiveDone(bool status)\n{\n    BBDEBUG;\n    Q_UNUSED(status);\n\n    blink(false);\n}\n\nvoid BBApplication::onOpenTriggered()\n{\n    BBDEBUG;\n    QDesktopServices::openUrl(QUrl::fromLocalFile(BBSettings::instance()->directory()).toString());\n}\n\nvoid BBApplication::onLogsTriggered()\n{\n    BBDEBUG;\n    new BBLogs(this);\n}\n\nvoid BBApplication::onActivated(QSystemTrayIcon::ActivationReason reason)\n{\n    BBDEBUG << reason;\n\n    if (reason == QSystemTrayIcon::DoubleClick)\n        onCommitTriggered();\n}\n\nvoid BBApplication::changes(const QList<BBSvnStatus*>& changes)\n{\n    BBDEBUG << changes;\n\n    m_menuChanges->clear();\n\n    if (changes.isEmpty()) {\n        QFont font;\n        font.setStyle(QFont::StyleItalic);\n\n        QAction* emptyAction = new QAction(tr(\"No changes\"), this);\n        emptyAction->setFont(font);\n        m_menuChanges->addAction(emptyAction);\n        return;\n    }\n\n    foreach(BBSvnStatus* status, changes) {\n        QString message;\n\n        switch(status->status()) {\n            case BBSvnStatus::StatusUnknown:\n               message = tr(\"%1 (unknown operation)\").arg(status->file().remove(BBSettings::instance()->directory()));\n               break;\n\n            case BBSvnStatus::StatusAdded:\n               message = tr(\"%1 added\").arg(status->file().remove(BBSettings::instance()->directory()));\n               break;\n\n            case BBSvnStatus::StatusConflicted:\n               message = tr(\"%1 conflicted\").arg(status->file().remove(BBSettings::instance()->directory()));\n               break;\n\n            case BBSvnStatus::StatusDeleted:\n               message = tr(\"%1 deleted\").arg(status->file().remove(BBSettings::instance()->directory()));\n               break;\n\n            case BBSvnStatus::StatusModified:\n               message = tr(\"%1 modified\").arg(status->file().remove(BBSettings::instance()->directory()));\n               break;\n\n            case BBSvnStatus::StatusReplaced:\n               message = tr(\"%1 replaced\").arg(status->file().remove(BBSettings::instance()->directory()));\n               break;\n\n            case BBSvnStatus::StatusNew:\n               message = tr(\"%1 is new\").arg(status->file().remove(BBSettings::instance()->directory()));\n               break;\n\n            case BBSvnStatus::StatusMissing:\n               message = tr(\"%1 missing\").arg(status->file().remove(BBSettings::instance()->directory()));\n               break;\n\n            case BBSvnStatus::StatusUpdated:\n               message = tr(\"%1 updated\").arg(status->file().remove(BBSettings::instance()->directory()));\n               break;\n\n            case BBSvnStatus::StatusMerged:\n               message = tr(\"%1 merged\").arg(status->file().remove(BBSettings::instance()->directory()));\n               break;\n\n            case BBSvnStatus::StatusExisted:\n               message = tr(\"%1 existed\").arg(status->file().remove(BBSettings::instance()->directory()));\n               break;\n\n            case BBSvnStatus::StatusObstructed:\n               message = tr(\"%1 obstructed\").arg(status->file().remove(BBSettings::instance()->directory()));\n               break;\n        }\n\n        QAction* action = new QAction(message, this);\n        m_menuChanges->addAction(action);\n    }\n}\n\nvoid BBApplication::showMessage(const QString &title, const QString &message, bool isWarning)\n{\n    BBDEBUG << title << message << isWarning;\n\n    if (!m_systemTray->supportsMessages())\n        return;\n\n    \/\/ The fastest way to have something 'unique':\n    QString hash(QString(\"%1|%2|%3\").arg(title).arg(message).arg(isWarning));\n    if (hash == m_lastMessage)\n        return;\n\n    m_lastMessage = hash;\n\n    m_systemTray->showMessage(title, message, isWarning ? QSystemTrayIcon::Warning :\n                                                          QSystemTrayIcon::Information);\n}\n\nvoid BBApplication::resetLastMessage()\n{\n    m_lastMessage.clear();\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\/Client\/DBusProxy>\n\n#include \"TelepathyQt4\/Client\/_gen\/dbus-proxy.moc.hpp\"\n\n#include \"TelepathyQt4\/debug-internal.h\"\n\nnamespace Telepathy\n{\nnamespace Client\n{\n\nstruct DBusProxy::Private\n{\n    \/\/ Public object\n    DBusProxy& parent;\n\n    QDBusConnection dbusConnection;\n    QString busName;\n    QString objectPath;\n\n    Private(const QDBusConnection& dbusConnection, const QString& busName,\n            const QString& objectPath, DBusProxy& p)\n        : parent(p),\n          dbusConnection(dbusConnection),\n          busName(busName),\n          objectPath(objectPath)\n    {\n        debug() << \"Creating new DBusProxy\";\n    }\n};\n\nDBusProxy::DBusProxy(const QDBusConnection& dbusConnection,\n        const QString& busName, const QString& path, QObject* parent)\n : QObject(parent),\n   mPriv(new Private(dbusConnection, busName, path, *this))\n{\n}\n\nDBusProxy::~DBusProxy()\n{\n    delete mPriv;\n}\n\nQDBusConnection DBusProxy::dbusConnection() const\n{\n    return mPriv->dbusConnection;\n}\n\nQString DBusProxy::objectPath() const\n{\n    return mPriv->objectPath;\n}\n\nQString DBusProxy::busName() const\n{\n    return mPriv->busName;\n}\n\nStatelessDBusProxy::StatelessDBusProxy(const QDBusConnection& dbusConnection,\n        const QString& busName, const QString& objectPath, QObject* parent)\n    : DBusProxy(dbusConnection, busName, objectPath, parent)\n{\n}\n\nStatefulDBusProxy::StatefulDBusProxy(const QDBusConnection& dbusConnection,\n        const QString& busName, const QString& objectPath, QObject* parent)\n    : DBusProxy(dbusConnection, busName, objectPath, parent)\n{\n}\n\n}\n}\n<commit_msg>Implement getters for validity information in StatefulDBusProxy.<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\/DBusProxy>\n\n#include \"TelepathyQt4\/Client\/_gen\/dbus-proxy.moc.hpp\"\n\n#include \"TelepathyQt4\/debug-internal.h\"\n\nnamespace Telepathy\n{\nnamespace Client\n{\n\nstruct DBusProxy::Private\n{\n    \/\/ Public object\n    DBusProxy& parent;\n\n    QDBusConnection dbusConnection;\n    QString busName;\n    QString objectPath;\n\n    Private(const QDBusConnection& dbusConnection, const QString& busName,\n            const QString& objectPath, DBusProxy& p)\n        : parent(p),\n          dbusConnection(dbusConnection),\n          busName(busName),\n          objectPath(objectPath)\n    {\n        debug() << \"Creating new DBusProxy\";\n    }\n};\n\nDBusProxy::DBusProxy(const QDBusConnection& dbusConnection,\n        const QString& busName, const QString& path, QObject* parent)\n : QObject(parent),\n   mPriv(new Private(dbusConnection, busName, path, *this))\n{\n}\n\nDBusProxy::~DBusProxy()\n{\n    delete mPriv;\n}\n\nQDBusConnection DBusProxy::dbusConnection() const\n{\n    return mPriv->dbusConnection;\n}\n\nQString DBusProxy::objectPath() const\n{\n    return mPriv->objectPath;\n}\n\nQString DBusProxy::busName() const\n{\n    return mPriv->busName;\n}\n\nStatelessDBusProxy::StatelessDBusProxy(const QDBusConnection& dbusConnection,\n        const QString& busName, const QString& objectPath, QObject* parent)\n    : DBusProxy(dbusConnection, busName, objectPath, parent)\n{\n}\n\nstruct StatefulDBusProxy::Private\n{\n    \/\/ Public object\n    StatefulDBusProxy& parent;\n\n    QString invalidationReason;\n    QString invalidationMessage;\n\n    Private(StatefulDBusProxy& p)\n        : parent(p),\n          invalidationReason(QString()),\n          invalidationMessage(QString())\n    {\n        debug() << \"Creating new StatefulDBusProxy\";\n    }\n};\n\nStatefulDBusProxy::StatefulDBusProxy(const QDBusConnection& dbusConnection,\n        const QString& busName, const QString& objectPath, QObject* parent)\n    : DBusProxy(dbusConnection, busName, objectPath, parent)\n{\n}\n\nbool StatefulDBusProxy::isValid() const\n{\n    return mPriv->invalidationReason.isEmpty();\n}\n\nQString StatefulDBusProxy::invalidationReason() const\n{\n    return mPriv->invalidationReason;\n}\n\nQString StatefulDBusProxy::invalidationMessage() const\n{\n    return mPriv->invalidationMessage;\n}\n\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/** @file\n    @brief Implementation\n\n    @date 2014\n\n    @author\n    Ryan Pavlik\n    <ryan@sensics.com>\n    <http:\/\/sensics.com>\n*\/\n\n\/\/ Copyright 2014 Sensics, Inc.\n\/\/\n\/\/ All rights reserved.\n\/\/\n\/\/ (Final version intended to be licensed under\n\/\/ the Apache License, Version 2.0)\n\n\/\/ Internal Includes\n#include \"VRPNContext.h\"\n#include \"display_json.h\"\n#include \"RouterPredicates.h\"\n#include \"RouterTransforms.h\"\n#include \"VRPNAnalogRouter.h\"\n#include \"VRPNButtonRouter.h\"\n#include \"VRPNTrackerRouter.h\"\n#include <osvr\/Util\/ClientCallbackTypesC.h>\n#include <osvr\/Client\/ClientContext.h>\n#include <osvr\/Client\/ClientInterface.h>\n#include <osvr\/Util\/Verbosity.h>\n#include <osvr\/Transform\/JSONTransformVisitor.h>\n#include <osvr\/Transform\/ChangeOfBasis.h>\n#include <osvr\/Util\/MessageKeys.h>\n\n\/\/ Library\/third-party includes\n#include <json\/value.h>\n#include <json\/reader.h>\n\n\/\/ Standard includes\n#include <cstring>\n\nnamespace osvr {\nnamespace client {\n    RouterEntry::~RouterEntry() {}\n\n    static inline transform::Transform getTransform(const char *data,\n                                                    size_t len) {\n        std::string json(data, len);\n        Json::Value root;\n        Json::Reader reader;\n        if (!reader.parse(json, root)) {\n            throw std::runtime_error(\"JSON parse error: \" +\n                                     reader.getFormattedErrorMessages());\n        }\n        transform::JSONTransformVisitor xform(root);\n        return xform.getTransform();\n    }\n\n    VRPNContext::VRPNContext(const char appId[], const char host[])\n        : ::OSVR_ClientContextObject(appId), m_host(host) {\n\n        std::string contextDevice =\n            std::string(util::messagekeys::systemSender()) + \"@\" + m_host;\n        \/\/\/ Get connection, forcing a re-open for improved thread-safety.\n        m_conn =\n            vrpn_get_connection_by_name(contextDevice.c_str(), nullptr, nullptr,\n                                        nullptr, nullptr, nullptr, true);\n\n        setParameter(\"\/display\",\n                     std::string(reinterpret_cast<char *>(display_json),\n                                 display_json_len));\n        m_conn->register_handler(\n            m_conn->register_message_type(util::messagekeys::routingData()),\n            &VRPNContext::m_handleRoutingMessage, static_cast<void *>(this));\n    }\n\n    VRPNContext::~VRPNContext() {}\n\n    int VRPNContext::m_handleRoutingMessage(void *userdata,\n                                            vrpn_HANDLERPARAM p) {\n        VRPNContext *self = static_cast<VRPNContext *>(userdata);\n        self->m_replaceRoutes(std::string(p.buffer, p.payload_len));\n        return 0;\n    }\n    static const char SOURCE_KEY[] = \"source\";\n    static const char DESTINATION_KEY[] = \"destination\";\n    static const char SENSOR_KEY[] = \"sensor\";\n    static const char TRACKER_KEY[] = \"tracker\";\n    void VRPNContext::m_replaceRoutes(std::string const &routes) {\n\n        Json::Value root;\n        Json::Reader reader;\n        if (!reader.parse(routes, root)) {\n            throw std::runtime_error(\"JSON parse error: \" +\n                                     reader.getFormattedErrorMessages());\n        }\n        OSVR_DEV_VERBOSE(\"Replacing routes: had \"\n                         << m_routers.size() << \", received \" << root.size());\n        m_routers.clear();\n        for (Json::ArrayIndex i = 0, e = root.size(); i < e; ++i) {\n            Json::Value route = root[i];\n\n            std::string dest = route[DESTINATION_KEY].asString();\n            boost::optional<int> sensor;\n\n            transform::JSONTransformVisitor xformParse(route[SOURCE_KEY]);\n            Json::Value srcLeaf = xformParse.getLeaf();\n            std::string srcDevice = srcLeaf[TRACKER_KEY].asString();\n            \/\/ OSVR_DEV_VERBOSE(\"Source device: \" << srcDevice);\n            srcDevice.erase(begin(srcDevice)); \/\/ remove leading slash\n            if (srcLeaf.isMember(SENSOR_KEY)) {\n                sensor = srcLeaf[SENSOR_KEY].asInt();\n            }\n\n            m_addTrackerRouter(srcDevice.c_str(), dest.c_str(), sensor,\n                               xformParse.getTransform());\n        }\n\n#define OSVR_HYDRA_BUTTON(SENSOR, NAME)                                        \\\n    m_addButtonRouter(\"org_opengoggles_bundled_Multiserver\/RazerHydra0\",       \\\n                      \"\/controller\/left\/\" NAME, SensorPredicate(SENSOR));      \\\n    m_addButtonRouter(\"org_opengoggles_bundled_Multiserver\/RazerHydra0\",       \\\n                      \"\/controller\/right\/\" NAME, SensorPredicate(SENSOR + 8))\n\n        OSVR_HYDRA_BUTTON(0, \"middle\");\n        OSVR_HYDRA_BUTTON(1, \"1\");\n        OSVR_HYDRA_BUTTON(2, \"2\");\n        OSVR_HYDRA_BUTTON(3, \"3\");\n        OSVR_HYDRA_BUTTON(4, \"4\");\n        OSVR_HYDRA_BUTTON(5, \"bumper\");\n        OSVR_HYDRA_BUTTON(6, \"joystick\/button\");\n\n#undef OSVR_HYDRA_BUTTON\n\n#define OSVR_HYDRA_ANALOG(SENSOR, NAME)                                        \\\n    m_addAnalogRouter(\"org_opengoggles_bundled_Multiserver\/RazerHydra0\",       \\\n                      \"\/controller\/left\/\" NAME, SENSOR);                       \\\n    m_addAnalogRouter(\"org_opengoggles_bundled_Multiserver\/RazerHydra0\",       \\\n                      \"\/controller\/right\/\" NAME, SENSOR + 3)\n\n        OSVR_HYDRA_ANALOG(0, \"joystick\/x\");\n        OSVR_HYDRA_ANALOG(1, \"joystick\/y\");\n        OSVR_HYDRA_ANALOG(2, \"trigger\");\n\n#undef OSVR_HYDRA_ANALOG\n\n        OSVR_DEV_VERBOSE(\"Now have \" << m_routers.size() << \" routes.\");\n    }\n\n    void VRPNContext::m_update() {\n        \/\/ mainloop the VRPN connection.\n        m_conn->mainloop();\n        \/\/ Process each of the routers.\n        for (auto const &p : m_routers) {\n            (*p)();\n        }\n    }\n\n    void VRPNContext::m_addAnalogRouter(const char *src, const char *dest,\n                                        int channel) {\n        OSVR_DEV_VERBOSE(\"Adding analog route for \" << dest);\n\n        m_routers.emplace_back(\n            new VRPNAnalogRouter<SensorPredicate, NullTransform>(\n                this, m_conn.get(), (src + (\"@\" + m_host)).c_str(), dest, SensorPredicate(channel),\n                NullTransform(), channel));\n    }\n\n    template <typename Predicate>\n    void VRPNContext::m_addButtonRouter(const char *src, const char *dest,\n                                        Predicate pred) {\n        OSVR_DEV_VERBOSE(\"Adding button route for \" << dest);\n        m_routers.emplace_back(new VRPNButtonRouter<Predicate>(\n            this, m_conn.get(), (src + (\"@\" + m_host)).c_str(), dest, pred));\n    }\n\n    void VRPNContext::m_addTrackerRouter(const char *src, const char *dest,\n                                         boost::optional<int> sensor,\n                                         transform::Transform const &xform) {\n        OSVR_DEV_VERBOSE(\"Adding tracker route for \" << dest);\n        std::string source(src);\n        if (std::string::npos != source.find('@')) {\n            \/\/ We found an @ - so this is a device we need a new connection for.\n            m_routers.emplace_back(\n                new VRPNTrackerRouter(this, nullptr, src, sensor, dest, xform));\n        } else {\n            \/\/ No @: assume to be at the same location as the context.\n            m_routers.emplace_back(new VRPNTrackerRouter(\n                this, m_conn.get(), (src + (\"@\" + m_host)).c_str(), sensor, dest, xform));\n        }\n    }\n\n} \/\/ namespace client\n} \/\/ namespace osvr<commit_msg>Remove extra reference.<commit_after>\/** @file\n    @brief Implementation\n\n    @date 2014\n\n    @author\n    Ryan Pavlik\n    <ryan@sensics.com>\n    <http:\/\/sensics.com>\n*\/\n\n\/\/ Copyright 2014 Sensics, Inc.\n\/\/\n\/\/ All rights reserved.\n\/\/\n\/\/ (Final version intended to be licensed under\n\/\/ the Apache License, Version 2.0)\n\n\/\/ Internal Includes\n#include \"VRPNContext.h\"\n#include \"display_json.h\"\n#include \"RouterPredicates.h\"\n#include \"RouterTransforms.h\"\n#include \"VRPNAnalogRouter.h\"\n#include \"VRPNButtonRouter.h\"\n#include \"VRPNTrackerRouter.h\"\n#include <osvr\/Util\/ClientCallbackTypesC.h>\n#include <osvr\/Client\/ClientContext.h>\n#include <osvr\/Client\/ClientInterface.h>\n#include <osvr\/Util\/Verbosity.h>\n#include <osvr\/Transform\/JSONTransformVisitor.h>\n#include <osvr\/Transform\/ChangeOfBasis.h>\n#include <osvr\/Util\/MessageKeys.h>\n\n\/\/ Library\/third-party includes\n#include <json\/value.h>\n#include <json\/reader.h>\n\n\/\/ Standard includes\n#include <cstring>\n\nnamespace osvr {\nnamespace client {\n    RouterEntry::~RouterEntry() {}\n\n    static inline transform::Transform getTransform(const char *data,\n                                                    size_t len) {\n        std::string json(data, len);\n        Json::Value root;\n        Json::Reader reader;\n        if (!reader.parse(json, root)) {\n            throw std::runtime_error(\"JSON parse error: \" +\n                                     reader.getFormattedErrorMessages());\n        }\n        transform::JSONTransformVisitor xform(root);\n        return xform.getTransform();\n    }\n\n    VRPNContext::VRPNContext(const char appId[], const char host[])\n        : ::OSVR_ClientContextObject(appId), m_host(host) {\n\n        std::string contextDevice =\n            std::string(util::messagekeys::systemSender()) + \"@\" + m_host;\n        \/\/\/ Get connection, forcing a re-open for improved thread-safety.\n        m_conn =\n            vrpn_get_connection_by_name(contextDevice.c_str(), nullptr, nullptr,\n                                        nullptr, nullptr, nullptr, true);\n        m_conn->removeReference(); \/\/ Remove extra reference.\n        setParameter(\"\/display\",\n                     std::string(reinterpret_cast<char *>(display_json),\n                                 display_json_len));\n        m_conn->register_handler(\n            m_conn->register_message_type(util::messagekeys::routingData()),\n            &VRPNContext::m_handleRoutingMessage, static_cast<void *>(this));\n    }\n\n    VRPNContext::~VRPNContext() {}\n\n    int VRPNContext::m_handleRoutingMessage(void *userdata,\n                                            vrpn_HANDLERPARAM p) {\n        VRPNContext *self = static_cast<VRPNContext *>(userdata);\n        self->m_replaceRoutes(std::string(p.buffer, p.payload_len));\n        return 0;\n    }\n    static const char SOURCE_KEY[] = \"source\";\n    static const char DESTINATION_KEY[] = \"destination\";\n    static const char SENSOR_KEY[] = \"sensor\";\n    static const char TRACKER_KEY[] = \"tracker\";\n    void VRPNContext::m_replaceRoutes(std::string const &routes) {\n\n        Json::Value root;\n        Json::Reader reader;\n        if (!reader.parse(routes, root)) {\n            throw std::runtime_error(\"JSON parse error: \" +\n                                     reader.getFormattedErrorMessages());\n        }\n        OSVR_DEV_VERBOSE(\"Replacing routes: had \"\n                         << m_routers.size() << \", received \" << root.size());\n        m_routers.clear();\n        for (Json::ArrayIndex i = 0, e = root.size(); i < e; ++i) {\n            Json::Value route = root[i];\n\n            std::string dest = route[DESTINATION_KEY].asString();\n            boost::optional<int> sensor;\n\n            transform::JSONTransformVisitor xformParse(route[SOURCE_KEY]);\n            Json::Value srcLeaf = xformParse.getLeaf();\n            std::string srcDevice = srcLeaf[TRACKER_KEY].asString();\n            \/\/ OSVR_DEV_VERBOSE(\"Source device: \" << srcDevice);\n            srcDevice.erase(begin(srcDevice)); \/\/ remove leading slash\n            if (srcLeaf.isMember(SENSOR_KEY)) {\n                sensor = srcLeaf[SENSOR_KEY].asInt();\n            }\n\n            m_addTrackerRouter(srcDevice.c_str(), dest.c_str(), sensor,\n                               xformParse.getTransform());\n        }\n\n#define OSVR_HYDRA_BUTTON(SENSOR, NAME)                                        \\\n    m_addButtonRouter(\"org_opengoggles_bundled_Multiserver\/RazerHydra0\",       \\\n                      \"\/controller\/left\/\" NAME, SensorPredicate(SENSOR));      \\\n    m_addButtonRouter(\"org_opengoggles_bundled_Multiserver\/RazerHydra0\",       \\\n                      \"\/controller\/right\/\" NAME, SensorPredicate(SENSOR + 8))\n\n        OSVR_HYDRA_BUTTON(0, \"middle\");\n        OSVR_HYDRA_BUTTON(1, \"1\");\n        OSVR_HYDRA_BUTTON(2, \"2\");\n        OSVR_HYDRA_BUTTON(3, \"3\");\n        OSVR_HYDRA_BUTTON(4, \"4\");\n        OSVR_HYDRA_BUTTON(5, \"bumper\");\n        OSVR_HYDRA_BUTTON(6, \"joystick\/button\");\n\n#undef OSVR_HYDRA_BUTTON\n\n#define OSVR_HYDRA_ANALOG(SENSOR, NAME)                                        \\\n    m_addAnalogRouter(\"org_opengoggles_bundled_Multiserver\/RazerHydra0\",       \\\n                      \"\/controller\/left\/\" NAME, SENSOR);                       \\\n    m_addAnalogRouter(\"org_opengoggles_bundled_Multiserver\/RazerHydra0\",       \\\n                      \"\/controller\/right\/\" NAME, SENSOR + 3)\n\n        OSVR_HYDRA_ANALOG(0, \"joystick\/x\");\n        OSVR_HYDRA_ANALOG(1, \"joystick\/y\");\n        OSVR_HYDRA_ANALOG(2, \"trigger\");\n\n#undef OSVR_HYDRA_ANALOG\n\n        OSVR_DEV_VERBOSE(\"Now have \" << m_routers.size() << \" routes.\");\n    }\n\n    void VRPNContext::m_update() {\n        \/\/ mainloop the VRPN connection.\n        m_conn->mainloop();\n        \/\/ Process each of the routers.\n        for (auto const &p : m_routers) {\n            (*p)();\n        }\n    }\n\n    void VRPNContext::m_addAnalogRouter(const char *src, const char *dest,\n                                        int channel) {\n        OSVR_DEV_VERBOSE(\"Adding analog route for \" << dest);\n\n        m_routers.emplace_back(\n            new VRPNAnalogRouter<SensorPredicate, NullTransform>(\n                this, m_conn.get(), (src + (\"@\" + m_host)).c_str(), dest, SensorPredicate(channel),\n                NullTransform(), channel));\n    }\n\n    template <typename Predicate>\n    void VRPNContext::m_addButtonRouter(const char *src, const char *dest,\n                                        Predicate pred) {\n        OSVR_DEV_VERBOSE(\"Adding button route for \" << dest);\n        m_routers.emplace_back(new VRPNButtonRouter<Predicate>(\n            this, m_conn.get(), (src + (\"@\" + m_host)).c_str(), dest, pred));\n    }\n\n    void VRPNContext::m_addTrackerRouter(const char *src, const char *dest,\n                                         boost::optional<int> sensor,\n                                         transform::Transform const &xform) {\n        OSVR_DEV_VERBOSE(\"Adding tracker route for \" << dest);\n        std::string source(src);\n        if (std::string::npos != source.find('@')) {\n            \/\/ We found an @ - so this is a device we need a new connection for.\n            m_routers.emplace_back(\n                new VRPNTrackerRouter(this, nullptr, src, sensor, dest, xform));\n        } else {\n            \/\/ No @: assume to be at the same location as the context.\n            m_routers.emplace_back(new VRPNTrackerRouter(\n                this, m_conn.get(), (src + (\"@\" + m_host)).c_str(), sensor, dest, xform));\n        }\n    }\n\n} \/\/ namespace client\n} \/\/ namespace osvr<|endoftext|>"}
{"text":"<commit_before>#include \"fileoperations\/coperationperformer.h\"\r\n#include \"cfolderenumeratorrecursive.h\"\r\n#include \"ctestfoldergenerator.h\"\r\n#include \"container\/set_operations.hpp\"\r\n#include \"system\/processfilepath.hpp\"\r\n#include \"system\/ctimeelapsed.h\"\r\n#include \"filecomparator\/cfilecomparator.h\"\r\n\r\n\/\/ test_utils\r\n#include \"foldercomparator.h\"\r\n#include \"qt_helpers.hpp\"\r\n#include \"catch2_utils.hpp\"\r\n\r\nDISABLE_COMPILER_WARNINGS\r\n#include <QDateTime>\r\n#include <QDir>\r\n#include <QStringBuilder>\r\n#include <QTemporaryDir>\r\nRESTORE_COMPILER_WARNINGS\r\n\r\n#include <algorithm>\r\n#include <iostream>\r\n#include <string>\r\n\r\n#define CATCH_CONFIG_RUNNER\r\n#include \"..\/catch2\/catch.hpp\"\r\n\r\nstatic uint32_t g_randomSeed = 0;\r\n\r\nstatic bool timesAlmostMatch(const QDateTime& t1, const QDateTime& t2)\r\n{\r\n\treturn ::abs(t1.toMSecsSinceEpoch() - t2.toMSecsSinceEpoch()) <= 5;\r\n}\r\n\r\n\r\nstruct ProgressObserver final : public CFileOperationObserver {\r\n\tinline void onProgressChanged(float totalPercentage, size_t \/*numFilesProcessed*\/, size_t \/*totalNumFiles*\/, float filePercentage, uint64_t \/*speed*\/ \/* B\/s*\/, uint32_t \/*secondsRemaining*\/) override {\r\n\t\tCHECK(totalPercentage <= 100.0f);\r\n\t\tCHECK(filePercentage <= 100.0f);\r\n\t}\r\n\tinline void onProcessHalted(HaltReason \/*reason*\/, CFileSystemObject \/*source*\/, CFileSystemObject \/*dest*\/, QString \/*errorMessage*\/) override { \/\/ User decision required (file exists, file is read-only etc.)\r\n\t\tFAIL(\"onProcessHalted called\");\r\n\t}\r\n\tinline void onProcessFinished(QString \/*message*\/ = QString()) override {} \/\/ Done or canceled\r\n\tinline void onCurrentFileChanged(QString \/*file*\/) override {} \/\/ Starting to process a new file\r\n};\r\n\r\nTEST_CASE((std::string(\"Copy test #\") + std::to_string((srand(time(nullptr)), rand()))).c_str(), \"[operationperformer-copy]\")\r\n{\r\n\tQTemporaryDir sourceDirectory(QDir::tempPath() + \"\/\" + CURRENT_TEST_NAME.c_str() + \"_SOURCE_XXXXXX\");\r\n\tQTemporaryDir targetDirectory(QDir::tempPath() + \"\/\" + CURRENT_TEST_NAME.c_str() + \"_TARGET_XXXXXX\");\r\n\tREQUIRE(sourceDirectory.isValid());\r\n\tREQUIRE(targetDirectory.isValid());\r\n\r\n\tTRACE_LOG << \"Source: \" << sourceDirectory.path();\r\n\tTRACE_LOG << \"Target: \" << targetDirectory.path();\r\n\r\n\tREQUIRE(QFileInfo::exists(sourceDirectory.path()));\r\n\tREQUIRE(CFileSystemObject(sourceDirectory.path()).isEmptyDir());\r\n\r\n\tREQUIRE(QFileInfo::exists(targetDirectory.path()));\r\n\tREQUIRE(CFileSystemObject(targetDirectory.path()).isEmptyDir());\r\n\r\n\tCTestFolderGenerator generator;\r\n\tgenerator.setSeed(g_randomSeed);\r\n\tTRACE_LOG << \"std::random seed: \" << g_randomSeed;\r\n\tREQUIRE(generator.generateRandomTree(sourceDirectory.path(), 1000, 200));\r\n\r\n\tCOperationPerformer p(operationCopy, CFileSystemObject(sourceDirectory.path()), targetDirectory.path());\r\n\tCTimeElapsed timer(true);\r\n\r\n\tProgressObserver progressObserver;\r\n\tp.setObserver(&progressObserver);\r\n\tp.start();\r\n\twhile (!p.done())\r\n\t{\r\n\t\tprogressObserver.processEvents();\r\n#ifndef _DEBUG\r\n\t\t\/\/ Reasonable timeout\r\n\t\tif (timer.elapsed<std::chrono::seconds>() > 2 * 60)\r\n\t\t{\r\n\t\t\tFAIL(\"File operation timeout reached.\");\r\n\t\t\treturn;\r\n\t\t}\r\n#endif\r\n\t}\r\n\r\n\tstd::vector<CFileSystemObject> sourceTree, destTree;\r\n\tCFolderEnumeratorRecursive::enumerateFolder(sourceDirectory.path(), sourceTree);\r\n\tCFolderEnumeratorRecursive::enumerateFolder(targetDirectory.path() % '\/' % QFileInfo(sourceDirectory.path()).completeBaseName(), destTree);\r\n\r\n\tCFileComparator comparator;\r\n\tREQUIRE(sourceTree.size() == destTree.size());\r\n\r\n\tfor (size_t i = 0, n = sourceTree.size(); i < n; ++i)\r\n\t{\r\n\t\tconst auto& sourceItem = sourceTree[i];\r\n\t\tconst auto& destItem = destTree[i];\r\n\t\tif (!sourceItem.isFile())\r\n\t\t\tcontinue;\r\n\r\n\t\tQFile fileA(sourceItem.fullAbsolutePath());\r\n\t\tREQUIRE(fileA.open(QFile::ReadOnly));\r\n\r\n\t\tQFile fileB(destItem.fullAbsolutePath());\r\n\t\tREQUIRE(fileB.open(QFile::ReadOnly));\r\n\r\n\t\tcomparator.compareFiles(fileA, fileB, [](int) {}, [](const CFileComparator::ComparisonResult result) {\r\n\t\t\tCHECK(result == CFileComparator::Equal);\r\n\t\t});\r\n\r\n\t\tCHECK(timesAlmostMatch(fileA.fileTime(QFileDevice::FileAccessTime), fileB.fileTime(QFileDevice::FileAccessTime)));\r\n\t\tCHECK(timesAlmostMatch(fileA.fileTime(QFileDevice::FileBirthTime), fileB.fileTime(QFileDevice::FileBirthTime)));\r\n\t\tCHECK(timesAlmostMatch(fileA.fileTime(QFileDevice::FileMetadataChangeTime), fileB.fileTime(QFileDevice::FileMetadataChangeTime)));\r\n\t\tCHECK(timesAlmostMatch(fileA.fileTime(QFileDevice::FileModificationTime), fileB.fileTime(QFileDevice::FileModificationTime)));\r\n\t}\r\n\r\n\tREQUIRE(compareFolderContents(sourceTree, destTree));\r\n}\r\n\r\nTEST_CASE((std::string(\"Move test #\") + std::to_string((srand(time(nullptr)), rand()))).c_str(), \"[operationperformer-move]\")\r\n{\r\n\tQTemporaryDir sourceDirectory(QDir::tempPath() + \"\/\" + CURRENT_TEST_NAME.c_str() + \"_SOURCE_XXXXXX\");\r\n\tQTemporaryDir targetDirectory(QDir::tempPath() + \"\/\" + CURRENT_TEST_NAME.c_str() + \"_TARGET_XXXXXX\");\r\n\tREQUIRE(sourceDirectory.isValid());\r\n\tREQUIRE(targetDirectory.isValid());\r\n\r\n\tTRACE_LOG << \"Source: \" << sourceDirectory.path();\r\n\tTRACE_LOG << \"Target: \" << targetDirectory.path();\r\n\r\n\tREQUIRE(QFileInfo::exists(sourceDirectory.path()));\r\n\tREQUIRE(CFileSystemObject(sourceDirectory.path()).isEmptyDir());\r\n\r\n\tREQUIRE(QFileInfo::exists(targetDirectory.path()));\r\n\tREQUIRE(CFileSystemObject(targetDirectory.path()).isEmptyDir());\r\n\r\n\tCTestFolderGenerator generator;\r\n\tgenerator.setSeed(g_randomSeed);\r\n\tTRACE_LOG << \"std::random seed: \" << g_randomSeed;\r\n\tREQUIRE(generator.generateRandomTree(sourceDirectory.path(), 1000, 200));\r\n\r\n\tstd::vector<CFileSystemObject> sourceTree;\r\n\tCFolderEnumeratorRecursive::enumerateFolder(sourceDirectory.path(), sourceTree);\r\n\r\n\tCOperationPerformer p(operationMove, CFileSystemObject(sourceDirectory.path()), targetDirectory.path());\r\n\tProgressObserver progressObserver;\r\n\tp.setObserver(&progressObserver);\r\n\r\n\tCTimeElapsed timer(true);\r\n\tp.start();\r\n\twhile (!p.done())\r\n\t{\r\n\t\tprogressObserver.processEvents();\r\n#ifndef _DEBUG\r\n\t\t\/\/ Reasonable timeout\r\n\t\tif (timer.elapsed<std::chrono::seconds>() > 2 * 60)\r\n\t\t{\r\n\t\t\tFAIL(\"File operation timeout reached.\");\r\n\t\t\treturn;\r\n\t\t}\r\n#endif\r\n\t}\r\n\r\n\tREQUIRE(!CFileSystemObject(sourceDirectory.path()).exists());\r\n\r\n\tstd::vector<CFileSystemObject> destTree;\r\n\tCFolderEnumeratorRecursive::enumerateFolder(targetDirectory.path() % '\/' % QFileInfo(sourceDirectory.path()).completeBaseName(), destTree);\r\n\r\n\tREQUIRE(compareFolderContents(sourceTree, destTree));\r\n}\r\n\r\nTEST_CASE((std::string(\"Delete test #\") + std::to_string((srand(time(nullptr)), rand()))).c_str(), \"[operationperformer-delete]\")\r\n{\r\n\tQTemporaryDir sourceDirectory(QDir::tempPath() + \"\/\" + CURRENT_TEST_NAME.c_str() + \"_SOURCE_XXXXXX\");\r\n\tREQUIRE(sourceDirectory.isValid());\r\n\r\n\tTRACE_LOG << \"Source: \" << sourceDirectory.path();\r\n\r\n\tREQUIRE(QFileInfo::exists(sourceDirectory.path()));\r\n\tREQUIRE(CFileSystemObject(sourceDirectory.path()).isEmptyDir());\r\n\r\n\tCTestFolderGenerator generator;\r\n\tgenerator.setSeed(g_randomSeed);\r\n\tTRACE_LOG << \"std::random seed: \" << g_randomSeed;\r\n\tREQUIRE(generator.generateRandomTree(sourceDirectory.path(), 1000, 200));\r\n\tREQUIRE(!QDir(sourceDirectory.path()).entryList(QDir::NoDotAndDotDot | QDir::AllEntries).empty());\r\n\r\n\tCOperationPerformer p(operationDelete, CFileSystemObject(sourceDirectory.path()));\r\n\tProgressObserver progressObserver;\r\n\tp.setObserver(&progressObserver);\r\n\r\n\tCTimeElapsed timer(true);\r\n\tp.start();\r\n\twhile (!p.done())\r\n\t{\r\n\t\tprogressObserver.processEvents();\r\n#ifndef _DEBUG\r\n\t\t\/\/ Reasonable timeout\r\n\t\tif (timer.elapsed<std::chrono::seconds>() > 2 * 60)\r\n\t\t{\r\n\t\t\tFAIL(\"File operation timeout reached.\");\r\n\t\t\treturn;\r\n\t\t}\r\n#endif\r\n\t}\r\n\r\n\tREQUIRE(!CFileSystemObject(sourceDirectory.path()).exists());\r\n}\r\n\r\nint main(int argc, char* argv[])\r\n{\r\n\tCatch::Session session; \/\/ There must be exactly one instance\r\n\r\n\t\/\/ Build a new parser on top of Catch's\r\n\tusing namespace Catch::clara;\r\n\tauto cli\r\n\t\t= session.cli() \/\/ Get Catch's composite command line parser\r\n\t\t| Opt(g_randomSeed, \"std::random seed\") \/\/ bind variable to a new option, with a hint string\r\n\t\t[\"--std-seed\"]        \/\/ the option names it will respond to\r\n\t\t(\"std::random seed\"); \/\/ description string for the help output\r\n\r\n\t\/\/ Now pass the new composite back to Catch so it uses that\r\n\tsession.cli(cli);\r\n\r\n\t\/\/ Let Catch (using Clara) parse the command line\r\n\tconst int returnCode = session.applyCommandLine(argc, argv);\r\n\tif (returnCode != 0) \/\/ Indicates a command line error\r\n\t\treturn returnCode;\r\n\r\n\treturn session.run();\r\n}\r\n<commit_msg>Failing file time tests fixed<commit_after>#include \"fileoperations\/coperationperformer.h\"\r\n#include \"cfolderenumeratorrecursive.h\"\r\n#include \"ctestfoldergenerator.h\"\r\n#include \"container\/set_operations.hpp\"\r\n#include \"system\/processfilepath.hpp\"\r\n#include \"system\/ctimeelapsed.h\"\r\n#include \"filecomparator\/cfilecomparator.h\"\r\n\r\n\/\/ test_utils\r\n#include \"foldercomparator.h\"\r\n#include \"qt_helpers.hpp\"\r\n#include \"catch2_utils.hpp\"\r\n\r\nDISABLE_COMPILER_WARNINGS\r\n#include <QDateTime>\r\n#include <QDir>\r\n#include <QStringBuilder>\r\n#include <QTemporaryDir>\r\nRESTORE_COMPILER_WARNINGS\r\n\r\n#include <algorithm>\r\n#include <iostream>\r\n#include <string>\r\n\r\n#define CATCH_CONFIG_RUNNER\r\n#include \"..\/catch2\/catch.hpp\"\r\n\r\nstatic uint32_t g_randomSeed = 0;\r\n\r\nstatic constexpr QFileDevice::FileTime supportedFileTimeTypes[] {\r\n\tQFileDevice::FileAccessTime,\r\n#ifndef __linux__\r\n\tQFileDevice::FileBirthTime,\r\n#endif\r\n#if !defined __linux__ && !defined _WIN32\r\n\tQFileDevice::FileMetadataChangeTime,\r\n#endif\r\n\tQFileDevice::FileModificationTime,\r\n};\r\n\r\nstatic bool timesAlmostMatch(const QDateTime& t1, const QDateTime& t2, const QFileDevice::FileTime type)\r\n{\r\n\tconst auto diff = ::abs(t1.toMSecsSinceEpoch() - t2.toMSecsSinceEpoch());\r\n\r\n\tint allowedTimeDiffMs = 0;\r\n\tswitch (type)\r\n\t{\r\n\tcase QFileDevice::FileAccessTime:\r\n\t\tallowedTimeDiffMs = 2000;\r\n\t\tbreak;\r\n\tcase QFileDevice::FileBirthTime:\r\n\t\tallowedTimeDiffMs = 10;\r\n\t\tbreak;\r\n\tcase QFileDevice::FileMetadataChangeTime:\r\n\t\tallowedTimeDiffMs = 1500;\r\n\t\tbreak;\r\n\tcase QFileDevice::FileModificationTime:\r\n\t\tallowedTimeDiffMs = 10;\r\n\t\tbreak;\r\n\t}\r\n\r\n\tif (diff <= allowedTimeDiffMs)\r\n\t\treturn true;\r\n\telse\r\n\t\treturn false;\r\n}\r\n\r\n\r\nstruct ProgressObserver final : public CFileOperationObserver {\r\n\tinline void onProgressChanged(float totalPercentage, size_t \/*numFilesProcessed*\/, size_t \/*totalNumFiles*\/, float filePercentage, uint64_t \/*speed*\/ \/* B\/s*\/, uint32_t \/*secondsRemaining*\/) override {\r\n\t\tCHECK(totalPercentage <= 100.0f);\r\n\t\tCHECK(filePercentage <= 100.0f);\r\n\t}\r\n\tinline void onProcessHalted(HaltReason \/*reason*\/, CFileSystemObject \/*source*\/, CFileSystemObject \/*dest*\/, QString \/*errorMessage*\/) override { \/\/ User decision required (file exists, file is read-only etc.)\r\n\t\tFAIL(\"onProcessHalted called\");\r\n\t}\r\n\tinline void onProcessFinished(QString \/*message*\/ = QString()) override {} \/\/ Done or canceled\r\n\tinline void onCurrentFileChanged(QString \/*file*\/) override {} \/\/ Starting to process a new file\r\n};\r\n\r\nTEST_CASE((std::string(\"Copy test #\") + std::to_string((srand(time(nullptr)), rand()))).c_str(), \"[operationperformer-copy]\")\r\n{\r\n\tQTemporaryDir sourceDirectory(QDir::tempPath() + \"\/\" + CURRENT_TEST_NAME.c_str() + \"_SOURCE_XXXXXX\");\r\n\tQTemporaryDir targetDirectory(QDir::tempPath() + \"\/\" + CURRENT_TEST_NAME.c_str() + \"_TARGET_XXXXXX\");\r\n\tREQUIRE(sourceDirectory.isValid());\r\n\tREQUIRE(targetDirectory.isValid());\r\n\r\n\tTRACE_LOG << \"Source: \" << sourceDirectory.path();\r\n\tTRACE_LOG << \"Target: \" << targetDirectory.path();\r\n\r\n\tREQUIRE(QFileInfo::exists(sourceDirectory.path()));\r\n\tREQUIRE(CFileSystemObject(sourceDirectory.path()).isEmptyDir());\r\n\r\n\tREQUIRE(QFileInfo::exists(targetDirectory.path()));\r\n\tREQUIRE(CFileSystemObject(targetDirectory.path()).isEmptyDir());\r\n\r\n\tCTestFolderGenerator generator;\r\n\tgenerator.setSeed(g_randomSeed);\r\n\tTRACE_LOG << \"std::random seed: \" << g_randomSeed;\r\n\tREQUIRE(generator.generateRandomTree(sourceDirectory.path(), 1000, 200));\r\n\r\n\tCOperationPerformer p(operationCopy, CFileSystemObject(sourceDirectory.path()), targetDirectory.path());\r\n\tCTimeElapsed timer(true);\r\n\r\n\tProgressObserver progressObserver;\r\n\tp.setObserver(&progressObserver);\r\n\tp.start();\r\n\twhile (!p.done())\r\n\t{\r\n\t\tprogressObserver.processEvents();\r\n#ifndef _DEBUG\r\n\t\t\/\/ Reasonable timeout\r\n\t\tif (timer.elapsed<std::chrono::seconds>() > 2 * 60)\r\n\t\t{\r\n\t\t\tFAIL(\"File operation timeout reached.\");\r\n\t\t\treturn;\r\n\t\t}\r\n#endif\r\n\t}\r\n\r\n\tstd::vector<CFileSystemObject> sourceTree, destTree;\r\n\tCFolderEnumeratorRecursive::enumerateFolder(sourceDirectory.path(), sourceTree);\r\n\tCFolderEnumeratorRecursive::enumerateFolder(targetDirectory.path() % '\/' % QFileInfo(sourceDirectory.path()).completeBaseName(), destTree);\r\n\r\n\tCFileComparator comparator;\r\n\tREQUIRE(sourceTree.size() == destTree.size());\r\n\r\n\tfor (size_t i = 0, n = sourceTree.size(); i < n; ++i)\r\n\t{\r\n\t\tconst auto& sourceItem = sourceTree[i];\r\n\t\tconst auto& destItem = destTree[i];\r\n\t\tif (!sourceItem.isFile())\r\n\t\t\tcontinue;\r\n\r\n\t\tQFile fileA(sourceItem.fullAbsolutePath());\r\n\t\tREQUIRE(fileA.open(QFile::ReadOnly));\r\n\r\n\t\tQFile fileB(destItem.fullAbsolutePath());\r\n\t\tREQUIRE(fileB.open(QFile::ReadOnly));\r\n\r\n\t\tcomparator.compareFiles(fileA, fileB, [](int) {}, [](const CFileComparator::ComparisonResult result) {\r\n\t\t\tCHECK(result == CFileComparator::Equal);\r\n\t\t});\r\n\r\n\t\tfor (const auto fileTimeType: supportedFileTimeTypes)\r\n\t\t\tCHECK(timesAlmostMatch(fileA.fileTime(fileTimeType), fileB.fileTime(fileTimeType), fileTimeType));\r\n\t}\r\n\r\n\tREQUIRE(compareFolderContents(sourceTree, destTree));\r\n}\r\n\r\nTEST_CASE((std::string(\"Move test #\") + std::to_string((srand(time(nullptr)), rand()))).c_str(), \"[operationperformer-move]\")\r\n{\r\n\tQTemporaryDir sourceDirectory(QDir::tempPath() + \"\/\" + CURRENT_TEST_NAME.c_str() + \"_SOURCE_XXXXXX\");\r\n\tQTemporaryDir targetDirectory(QDir::tempPath() + \"\/\" + CURRENT_TEST_NAME.c_str() + \"_TARGET_XXXXXX\");\r\n\tREQUIRE(sourceDirectory.isValid());\r\n\tREQUIRE(targetDirectory.isValid());\r\n\r\n\tTRACE_LOG << \"Source: \" << sourceDirectory.path();\r\n\tTRACE_LOG << \"Target: \" << targetDirectory.path();\r\n\r\n\tREQUIRE(QFileInfo::exists(sourceDirectory.path()));\r\n\tREQUIRE(CFileSystemObject(sourceDirectory.path()).isEmptyDir());\r\n\r\n\tREQUIRE(QFileInfo::exists(targetDirectory.path()));\r\n\tREQUIRE(CFileSystemObject(targetDirectory.path()).isEmptyDir());\r\n\r\n\tCTestFolderGenerator generator;\r\n\tgenerator.setSeed(g_randomSeed);\r\n\tTRACE_LOG << \"std::random seed: \" << g_randomSeed;\r\n\tREQUIRE(generator.generateRandomTree(sourceDirectory.path(), 1000, 200));\r\n\r\n\tstd::vector<CFileSystemObject> sourceTree;\r\n\tCFolderEnumeratorRecursive::enumerateFolder(sourceDirectory.path(), sourceTree);\r\n\r\n\tCOperationPerformer p(operationMove, CFileSystemObject(sourceDirectory.path()), targetDirectory.path());\r\n\tProgressObserver progressObserver;\r\n\tp.setObserver(&progressObserver);\r\n\r\n\tCTimeElapsed timer(true);\r\n\tp.start();\r\n\twhile (!p.done())\r\n\t{\r\n\t\tprogressObserver.processEvents();\r\n#ifndef _DEBUG\r\n\t\t\/\/ Reasonable timeout\r\n\t\tif (timer.elapsed<std::chrono::seconds>() > 2 * 60)\r\n\t\t{\r\n\t\t\tFAIL(\"File operation timeout reached.\");\r\n\t\t\treturn;\r\n\t\t}\r\n#endif\r\n\t}\r\n\r\n\tREQUIRE(!CFileSystemObject(sourceDirectory.path()).exists());\r\n\r\n\tstd::vector<CFileSystemObject> destTree;\r\n\tCFolderEnumeratorRecursive::enumerateFolder(targetDirectory.path() % '\/' % QFileInfo(sourceDirectory.path()).completeBaseName(), destTree);\r\n\r\n\tREQUIRE(compareFolderContents(sourceTree, destTree));\r\n}\r\n\r\nTEST_CASE((std::string(\"Delete test #\") + std::to_string((srand(time(nullptr)), rand()))).c_str(), \"[operationperformer-delete]\")\r\n{\r\n\tQTemporaryDir sourceDirectory(QDir::tempPath() + \"\/\" + CURRENT_TEST_NAME.c_str() + \"_SOURCE_XXXXXX\");\r\n\tREQUIRE(sourceDirectory.isValid());\r\n\r\n\tTRACE_LOG << \"Source: \" << sourceDirectory.path();\r\n\r\n\tREQUIRE(QFileInfo::exists(sourceDirectory.path()));\r\n\tREQUIRE(CFileSystemObject(sourceDirectory.path()).isEmptyDir());\r\n\r\n\tCTestFolderGenerator generator;\r\n\tgenerator.setSeed(g_randomSeed);\r\n\tTRACE_LOG << \"std::random seed: \" << g_randomSeed;\r\n\tREQUIRE(generator.generateRandomTree(sourceDirectory.path(), 1000, 200));\r\n\tREQUIRE(!QDir(sourceDirectory.path()).entryList(QDir::NoDotAndDotDot | QDir::AllEntries).empty());\r\n\r\n\tCOperationPerformer p(operationDelete, CFileSystemObject(sourceDirectory.path()));\r\n\tProgressObserver progressObserver;\r\n\tp.setObserver(&progressObserver);\r\n\r\n\tCTimeElapsed timer(true);\r\n\tp.start();\r\n\twhile (!p.done())\r\n\t{\r\n\t\tprogressObserver.processEvents();\r\n#ifndef _DEBUG\r\n\t\t\/\/ Reasonable timeout\r\n\t\tif (timer.elapsed<std::chrono::seconds>() > 2 * 60)\r\n\t\t{\r\n\t\t\tFAIL(\"File operation timeout reached.\");\r\n\t\t\treturn;\r\n\t\t}\r\n#endif\r\n\t}\r\n\r\n\tREQUIRE(!CFileSystemObject(sourceDirectory.path()).exists());\r\n}\r\n\r\nint main(int argc, char* argv[])\r\n{\r\n\tCatch::Session session; \/\/ There must be exactly one instance\r\n\r\n\t\/\/ Build a new parser on top of Catch's\r\n\tusing namespace Catch::clara;\r\n\tauto cli\r\n\t\t= session.cli() \/\/ Get Catch's composite command line parser\r\n\t\t| Opt(g_randomSeed, \"std::random seed\") \/\/ bind variable to a new option, with a hint string\r\n\t\t[\"--std-seed\"]        \/\/ the option names it will respond to\r\n\t\t(\"std::random seed\"); \/\/ description string for the help output\r\n\r\n\t\/\/ Now pass the new composite back to Catch so it uses that\r\n\tsession.cli(cli);\r\n\r\n\t\/\/ Let Catch (using Clara) parse the command line\r\n\tconst int returnCode = session.applyCommandLine(argc, argv);\r\n\tif (returnCode != 0) \/\/ Indicates a command line error\r\n\t\treturn returnCode;\r\n\r\n\treturn session.run();\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2007-2009 Google Inc. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n *     * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *     * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following disclaimer\n * in the documentation and\/or other materials provided with the\n * distribution.\n *     * Neither the name of Google Inc. nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"config.h\"\n#include \"bindings\/v8\/ScheduledAction.h\"\n\n#include \"bindings\/v8\/ScriptController.h\"\n#include \"bindings\/v8\/ScriptSourceCode.h\"\n#include \"bindings\/v8\/V8Binding.h\"\n#include \"bindings\/v8\/V8GCController.h\"\n#include \"bindings\/v8\/V8RecursionScope.h\"\n#include \"core\/dom\/Document.h\"\n#include \"core\/dom\/ScriptExecutionContext.h\"\n#include \"core\/page\/Frame.h\"\n#include \"core\/platform\/chromium\/TraceEvent.h\"\n#include \"core\/workers\/WorkerContext.h\"\n#include \"core\/workers\/WorkerThread.h\"\n\nnamespace WebCore {\n\nScheduledAction::ScheduledAction(v8::Handle<v8::Context> context, v8::Handle<v8::Function> function, int argc, v8::Handle<v8::Value> argv[], v8::Isolate* isolate)\n    : m_context(context)\n    , m_function(function)\n    , m_code(String(), KURL(), TextPosition::belowRangePosition())\n    , m_isolate(isolate)\n{\n    m_args.reserveCapacity(argc);\n    for (int i = 0; i < argc; ++i)\n        m_args.append(UnsafePersistent<v8::Value>(m_isolate, argv[i]));\n}\n\nScheduledAction::ScheduledAction(v8::Handle<v8::Context> context, const String& code, const KURL& url, v8::Isolate* isolate)\n    : m_context(context)\n    , m_code(code, url)\n    , m_isolate(isolate)\n{\n}\n\nScheduledAction::~ScheduledAction()\n{\n    for (size_t i = 0; i < m_args.size(); ++i)\n        m_args[i].dispose();\n}\n\nvoid ScheduledAction::execute(ScriptExecutionContext* context)\n{\n    if (context->isDocument()) {\n        Frame* frame = toDocument(context)->frame();\n        if (!frame)\n            return;\n        if (!frame->script()->canExecuteScripts(AboutToExecuteScript))\n            return;\n        execute(frame);\n    } else {\n        ASSERT(context->isWorkerContext());\n        execute(static_cast<WorkerContext*>(context));\n    }\n}\n\nvoid ScheduledAction::execute(Frame* frame)\n{\n    v8::HandleScope handleScope(m_isolate);\n\n    v8::Handle<v8::Context> context = v8::Local<v8::Context>::New(m_context.get());\n    if (context.IsEmpty())\n        return;\n    v8::Context::Scope scope(context);\n\n    TRACE_EVENT0(\"v8\", \"ScheduledAction::execute\");\n\n    if (!m_function.isEmpty()) {\n        Vector<v8::Handle<v8::Value> > args;\n        createLocalHandlesForArgs(&args);\n        frame->script()->callFunction(m_function.get(), context->Global(), args.size(), args.data());\n    } else\n        frame->script()->compileAndRunScript(m_code);\n\n    \/\/ The frame might be invalid at this point because JavaScript could have released it.\n}\n\nvoid ScheduledAction::execute(WorkerContext* worker)\n{\n    ASSERT(worker->thread()->isCurrentThread());\n\n    V8RecursionScope recursionScope(worker);\n\n    if (!m_function.isEmpty()) {\n        V8GCController::checkMemoryUsage();\n\n        v8::HandleScope handleScope(m_isolate);\n\n        v8::Handle<v8::Context> context = v8::Local<v8::Context>::New(m_context.get());\n        ASSERT(!context.IsEmpty());\n        v8::Context::Scope scope(context);\n\n        Vector<v8::Handle<v8::Value> > args;\n        createLocalHandlesForArgs(&args);\n        m_function.newLocal(m_isolate)->Call(context->Global(), args.size(), args.data());\n    } else\n        worker->script()->evaluate(m_code);\n}\n\nvoid ScheduledAction::createLocalHandlesForArgs(Vector<v8::Handle<v8::Value> >* handles)\n{\n    handles->reserveCapacity(m_args.size());\n    for (size_t i = 0; i < m_args.size(); ++i)\n        handles->append(m_args[i].newLocal(m_isolate));\n}\n\n} \/\/ namespace WebCore\n<commit_msg>Use V8ScriptRunner::callFunction in ScheduledAction<commit_after>\/*\n * Copyright (C) 2007-2009 Google Inc. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n *     * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *     * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following disclaimer\n * in the documentation and\/or other materials provided with the\n * distribution.\n *     * Neither the name of Google Inc. nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"config.h\"\n#include \"bindings\/v8\/ScheduledAction.h\"\n\n#include \"bindings\/v8\/ScriptController.h\"\n#include \"bindings\/v8\/ScriptSourceCode.h\"\n#include \"bindings\/v8\/V8Binding.h\"\n#include \"bindings\/v8\/V8GCController.h\"\n#include \"bindings\/v8\/V8RecursionScope.h\"\n#include \"bindings\/v8\/V8ScriptRunner.h\"\n#include \"core\/dom\/Document.h\"\n#include \"core\/dom\/ScriptExecutionContext.h\"\n#include \"core\/page\/Frame.h\"\n#include \"core\/platform\/chromium\/TraceEvent.h\"\n#include \"core\/workers\/WorkerContext.h\"\n#include \"core\/workers\/WorkerThread.h\"\n\nnamespace WebCore {\n\nScheduledAction::ScheduledAction(v8::Handle<v8::Context> context, v8::Handle<v8::Function> function, int argc, v8::Handle<v8::Value> argv[], v8::Isolate* isolate)\n    : m_context(context)\n    , m_function(function)\n    , m_code(String(), KURL(), TextPosition::belowRangePosition())\n    , m_isolate(isolate)\n{\n    m_args.reserveCapacity(argc);\n    for (int i = 0; i < argc; ++i)\n        m_args.append(UnsafePersistent<v8::Value>(m_isolate, argv[i]));\n}\n\nScheduledAction::ScheduledAction(v8::Handle<v8::Context> context, const String& code, const KURL& url, v8::Isolate* isolate)\n    : m_context(context)\n    , m_code(code, url)\n    , m_isolate(isolate)\n{\n}\n\nScheduledAction::~ScheduledAction()\n{\n    for (size_t i = 0; i < m_args.size(); ++i)\n        m_args[i].dispose();\n}\n\nvoid ScheduledAction::execute(ScriptExecutionContext* context)\n{\n    if (context->isDocument()) {\n        Frame* frame = toDocument(context)->frame();\n        if (!frame)\n            return;\n        if (!frame->script()->canExecuteScripts(AboutToExecuteScript))\n            return;\n        execute(frame);\n    } else {\n        ASSERT(context->isWorkerContext());\n        execute(static_cast<WorkerContext*>(context));\n    }\n}\n\nvoid ScheduledAction::execute(Frame* frame)\n{\n    v8::HandleScope handleScope(m_isolate);\n\n    v8::Handle<v8::Context> context = v8::Local<v8::Context>::New(m_context.get());\n    if (context.IsEmpty())\n        return;\n    v8::Context::Scope scope(context);\n\n    TRACE_EVENT0(\"v8\", \"ScheduledAction::execute\");\n\n    if (!m_function.isEmpty()) {\n        Vector<v8::Handle<v8::Value> > args;\n        createLocalHandlesForArgs(&args);\n        frame->script()->callFunction(m_function.get(), context->Global(), args.size(), args.data());\n    } else\n        frame->script()->compileAndRunScript(m_code);\n\n    \/\/ The frame might be invalid at this point because JavaScript could have released it.\n}\n\nvoid ScheduledAction::execute(WorkerContext* worker)\n{\n    ASSERT(worker->thread()->isCurrentThread());\n    v8::HandleScope handleScope(m_isolate);\n    v8::Handle<v8::Context> context = v8::Local<v8::Context>::New(m_context.get());\n    ASSERT(!context.IsEmpty());\n    v8::Context::Scope scope(context);\n    if (!m_function.isEmpty()) {\n        Vector<v8::Handle<v8::Value> > args;\n        createLocalHandlesForArgs(&args);\n        V8ScriptRunner::callFunction(m_function.newLocal(m_isolate), worker, context->Global(), args.size(), args.data());\n    } else\n        worker->script()->evaluate(m_code);\n}\n\nvoid ScheduledAction::createLocalHandlesForArgs(Vector<v8::Handle<v8::Value> >* handles)\n{\n    handles->reserveCapacity(m_args.size());\n    for (size_t i = 0; i < m_args.size(); ++i)\n        handles->append(m_args[i].newLocal(m_isolate));\n}\n\n} \/\/ namespace WebCore\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\nThis program was created at:  Wed Aug 12 13:13:52 2015\nThis program was created by:  Zev Kronenberg\n\nContact: zev.kronenberg@gmail.com\n\nOrganization: Unviersity of Utah\n    School of Medicine\n    Salt Lake City, Utah\n\n\nThe MIT License (MIT)\n\nCopyright (c) <2015> <Zev Kronenberg>\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\n#include <map>\n#include <string>\n#include <vector>\n#include <iostream>\n#include <fstream>\n#include <cstdlib>\n#include <cmath>\n#include \"split.h\"\n\nusing namespace std;\n\nstruct options{\n       int maxDist     ;\n       string filename ;\n}globalOpts;\n\nstruct svDat{\n  string seqid;\n  int    five ;\n  int    three;\n  string id   ;\n  string type ; \n\n  vector<string> lineDat  ;\n \n  int ls;\n  int rs;\n\n  vector<string> lid;\n  vector<string> rid;\n  \n  map<string, string> info;\n\n};\n\nint roundHalfwayDown(double d)\n{\n  return ceil(d - 0.5);\n}\n\nstatic const char *optString = \"s:f:h\";\n\n\/\/-------------------------------   OPTIONS   --------------------------------\nint parseOpts(int argc, char** argv)\n{\n  int opt = 0;\n  opt = getopt(argc, argv, optString);\n  while(opt != -1){\n    switch(opt){\n    case 's':\n      {\n\tglobalOpts.maxDist  = atoi( ((string)optarg).c_str());\n\tbreak;\n      }\n    case 'f':\n      {\n\tglobalOpts.filename = optarg;\n\tbreak;\n      }\n    case 'h':\n      {\n\tbreak;\n      }\n    case '?':\n      {\n\tbreak;\n      }\n    }\n    opt = getopt( argc, argv, optString ); \n  }\n  return 1;\n}\n\/\/------------------------------- SUBROUTINE --------------------------------\n\/*\n Function input  : vector of strings and separator\n\n Function does   : joins vector with separator\n\n Function returns: string\n\n*\/\n\nstring join(vector<string> & strings, string sep){\n\n  string joined = *(strings.begin());\n\n  for(vector<string>::iterator sit = strings.begin()+1; sit != strings.end();\n      sit++){\n\n    joined = joined + sep + (*sit) ;\n  }\n  return joined;\n}\n\n\n\n\n\/\/------------------------------- SUBROUTINE --------------------------------\n\/*\n Function input  : vector svDat pointers\n\n Function does   : merges calls\n\n Function returns: void\n\n*\/\n\nvoid mergeAndDump(vector<svDat *> & svs){\n\n  int fiveSum  = 0;\n  int threeSum = 0;\n\n  int lSupport = 0;\n  int rSupport = 0;\n\n  vector<string> ids;\n  vector<string> merged;\n  vector<string> refined;\n  \n  int COLLAPSED = 0;\n\n    for(vector<svDat *>::iterator iz = svs.begin(); iz != svs.end(); iz++){\n      fiveSum   += (*iz)->five;\n      threeSum  += (*iz)->three;\n      \n      lSupport += (*iz)->ls;\n      rSupport += (*iz)->rs;\n\n      ids.push_back((*iz)->id);\n\n      merged.push_back((*iz)->info[\"MERGED\"]);\n      refined.push_back((*iz)->info[\"REFINED\"]);\n\n\n    \n    }\n    \n    if(svs.size() > 1){\n      COLLAPSED = svs.size();\n    }\n\n  int  fiveAvg = roundHalfwayDown(double(fiveSum) \/ double(svs.size()));\n  int  threeAvg = roundHalfwayDown(double(threeSum) \/ double(svs.size()));\n\n\n  int svlen = threeAvg - fiveAvg;\n  if(svs.front()->type.compare(\"DEL\")==0){\n    svlen = -svlen;\n  }\n  \n  map<string, int> ridU;\n  map<string, int> lidU;\n  \n  vector<string> ridV;\n  vector<string> lidV;\n\n  for(vector<svDat *>::iterator iz = svs.begin(); iz != svs.end(); iz++){\n    for(vector<string>::iterator iy = (*iz)->lid.begin(); iy != (*iz)->lid.end(); iy++ ){\n      if(lidU.find(*iy) != lidU.end()){\n\tlidU[*iy] += 1;\n      }\n      else{\n\tlidU[*iy]  = 0;\n      }\n    }\n    for(vector<string>::iterator iy = (*iz)->rid.begin(); iy != (*iz)->rid.end(); iy++ ){\n      if(ridU.find(*iy) != ridU.end()){\n\tridU[*iy] += 1;\n      }\n      else{\n\tridU[*iy] = 0;\n      }\n    }\n  }\n\n  for(map<string, int>::iterator iz = lidU.begin(); iz != lidU.end(); iz++){\n    lidV.push_back(iz->first);\n  }\n  for(map<string, int>::iterator iz = lidU.begin(); iz != lidU.end(); iz++){\n    ridV.push_back(iz->first);\n  }\n  \n  stringstream bedpe;\n  \n  bedpe << svs.front()->seqid << \"\\t\"\n\t<< (fiveAvg - 5) << \"\\t\"\n\t<< (fiveAvg + 5) << \"\\t\"\n\t<< svs.front()->seqid << \"\\t\"\n\t<< (threeAvg - 5) << \"\\t\"\n\t<< (threeAvg + 5) << \"\\t\"\n\t<< svs.front()->type << \":\" << join(ids, \"-\") << \"\\t\"\n\t<< \".\\t.\\t.\\t\" \n\t<< \"SVTYPE=\" << svs.front()->type \n\t<< \";SVLEN=\" << svlen << \";ID=\" \n\t<< join(ids, \"-\") << \";SUPPORT=\" \n\t<< lSupport << \",\" << rSupport \n\t<< \";MERGED=\" << join(merged, \",\") << \";REFINED=\" << join(refined, \",\") \n\t<< \";POS=\" << fiveAvg << \",\" << threeAvg << \";LID=\" << join(lidV, \",\") \n\t<< \";RID=\" << join(ridV, \",\") << \";\" << \"COLLAPSED=\" << COLLAPSED <<  endl;\n\n  cout << bedpe.str();\n\n  for(vector<svDat *>::iterator iz = svs.begin(); iz != svs.end(); iz++){\n    delete *iz;\n  }\n\n}\n\n\/\/------------------------------- SUBROUTINE --------------------------------\n\/*\n Function input  : vector svDat pointers\n\n Function does   : merges calls\n\n Function returns: void\n\n*\/\n\nvoid mergeAndDump(vector<svDat *> & svs, bool){\n  map<string, vector< svDat *> > typeGroup;\n  for(vector<svDat *>::iterator iz = svs.begin(); iz != svs.end(); iz++){\n    typeGroup[(*iz)->type].push_back(*iz);\n  }\n\n  for(map<string, vector< svDat *> >::iterator iz = typeGroup.begin(); iz != typeGroup.end(); iz++){\n    mergeAndDump(iz->second);\n  }\n}\n\n\n\/\/------------------------------- SUBROUTINE --------------------------------\n\/*\n Function input  : pointer to svDat and a stirng\n \n Function does   : parses WHAM-GRPAHING info into a svDat struct\n\n Function returns: void \n\n*\/\nvoid parseSV(svDat * sv, string & line){\n\n  sv->lineDat =  split(line, \"\\t\");\n  vector<string> info = split(sv->lineDat[10], \";\");\n  for(vector<string>::iterator iz = info.begin(); iz != info.end(); iz++){\n    vector<string> key_value = split(*iz, \"=\");\n    sv->info[ key_value[0] ] = key_value[1];\n  }\n      \n  vector<string> pos = split(sv->info[\"POS\"], ',');\n\n  vector<string> support = split(sv->info[\"SUPPORT\"], ',');\n\n\n  sv->type = sv->info[\"SVTYPE\"];\n  sv->id   = sv->info[\"ID\"];\n    \n  sv->ls = atoi(support.front().c_str());\n  sv->rs = atoi(support.back().c_str());\n\n  sv->lid = split(sv->info[\"LID\"], ',');\n  sv->rid = split(sv->info[\"RID\"], ',');\n  \n  sv->five = atoi(pos[0].c_str());\n  sv->three = atoi(pos[1].c_str());\n  sv->seqid = sv->lineDat[0];\n  \n}\n\n\/\/-------------------------------    MAIN     --------------------------------\n\/*\n Comments:\n*\/\n\nint main( int argc, char** argv)\n{\nglobalOpts.maxDist = 5;\nint parse = parseOpts(argc, argv);\n\n vector<svDat *> SVbuffer;\n\n ifstream myfile (globalOpts.filename.c_str());\n \n string line;\n\n if(myfile.is_open()){\n   while( getline (myfile, line) ){\n     \n     svDat * sv ;\n     sv = new svDat;\n     parseSV(sv, line);\n\n     \/\/ nothing to compare against\n\n     if(SVbuffer.size() == 0){\n       SVbuffer.push_back(sv);\n       continue;\n     }\n\n     \/\/ swithed seqids\n\n     if(sv->seqid.compare(SVbuffer.back()->seqid) != 0){\n       mergeAndDump(SVbuffer, true);\n       SVbuffer.clear();\n       SVbuffer.push_back(sv);\n       continue;\n     }\n     \n     \/\/ unsorted\n\n     if(sv->five < SVbuffer.back()->five){\n       cerr << endl;\n       cerr << \"FATAL: SVs are NOT sorted.\" << endl;\n       cerr << \"      \" << SVbuffer.back()->seqid << \" \" << SVbuffer.back()->five;\n       cerr << \"      \" << sv->seqid << \" \" << sv->five << endl;\n       \n       cerr << endl;\n       exit(1);\n     }\n\n     if( (sv->five - SVbuffer.back()->five) < globalOpts.maxDist \n\t && (sv->three - SVbuffer.back()->three < globalOpts.maxDist )){\n       SVbuffer.push_back(sv);\n     }\n     else{\n       mergeAndDump(SVbuffer, true);\n       SVbuffer.clear();\n       SVbuffer.push_back(sv);\n     }\n   } \n   myfile.close();  \n }\n else{\n   cerr << endl;\n   cerr << \"FATAL: Unable to open file.\" << endl;\n   cerr << endl;\n   exit(1);\n }\n\n\nreturn 0;\n\n\n}\n<commit_msg>overflow on pos sum<commit_after>\/*\n\nThis program was created at:  Wed Aug 12 13:13:52 2015\nThis program was created by:  Zev Kronenberg\n\nContact: zev.kronenberg@gmail.com\n\nOrganization: Unviersity of Utah\n    School of Medicine\n    Salt Lake City, Utah\n\n\nThe MIT License (MIT)\n\nCopyright (c) <2015> <Zev Kronenberg>\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\n#include <map>\n#include <string>\n#include <vector>\n#include <iostream>\n#include <fstream>\n#include <cstdlib>\n#include <cmath>\n#include \"split.h\"\n\nusing namespace std;\n\nstruct options{\n       int maxDist     ;\n       string filename ;\n}globalOpts;\n\nstruct svDat{\n  string seqid;\n  int    five ;\n  int    three;\n  string id   ;\n  string type ; \n\n  vector<string> lineDat  ;\n \n  int ls;\n  int rs;\n\n  vector<string> lid;\n  vector<string> rid;\n  \n  map<string, string> info;\n\n};\n\nint roundHalfwayDown(double d)\n{\n  return ceil(d - 0.5);\n}\n\nstatic const char *optString = \"s:f:h\";\n\n\/\/-------------------------------   OPTIONS   --------------------------------\nint parseOpts(int argc, char** argv)\n{\n  int opt = 0;\n  opt = getopt(argc, argv, optString);\n  while(opt != -1){\n    switch(opt){\n    case 's':\n      {\n\tglobalOpts.maxDist  = atoi( ((string)optarg).c_str());\n\tbreak;\n      }\n    case 'f':\n      {\n\tglobalOpts.filename = optarg;\n\tbreak;\n      }\n    case 'h':\n      {\n\tbreak;\n      }\n    case '?':\n      {\n\tbreak;\n      }\n    }\n    opt = getopt( argc, argv, optString ); \n  }\n  return 1;\n}\n\/\/------------------------------- SUBROUTINE --------------------------------\n\/*\n Function input  : vector of strings and separator\n\n Function does   : joins vector with separator\n\n Function returns: string\n\n*\/\n\nstring join(vector<string> & strings, string sep){\n\n  string joined = *(strings.begin());\n\n  for(vector<string>::iterator sit = strings.begin()+1; sit != strings.end();\n      sit++){\n\n    joined = joined + sep + (*sit) ;\n  }\n  return joined;\n}\n\n\n\n\n\/\/------------------------------- SUBROUTINE --------------------------------\n\/*\n Function input  : vector svDat pointers\n\n Function does   : merges calls\n\n Function returns: void\n\n*\/\n\nvoid mergeAndDump(vector<svDat *> & svs){\n\n  long int fiveSum  = 0;\n  long int threeSum = 0;\n\n  int lSupport = 0;\n  int rSupport = 0;\n\n  vector<string> ids;\n  vector<string> merged;\n  vector<string> refined;\n  \n  int COLLAPSED = 0;\n\n    for(vector<svDat *>::iterator iz = svs.begin(); iz != svs.end(); iz++){\n      \n      fiveSum   += (*iz)->five;\n      threeSum  += (*iz)->three;\n      \n      lSupport += (*iz)->ls;\n      rSupport += (*iz)->rs;\n\n      ids.push_back((*iz)->id);\n\n      merged.push_back((*iz)->info[\"MERGED\"]);\n      refined.push_back((*iz)->info[\"REFINED\"]);\n\n\n    \n    }\n    \n    if(svs.size() > 1){\n      COLLAPSED = svs.size();\n    }\n\n  int  fiveAvg = roundHalfwayDown(double(fiveSum) \/ double(svs.size()));\n  int  threeAvg = roundHalfwayDown(double(threeSum) \/ double(svs.size()));\n\n\n  int svlen = threeAvg - fiveAvg;\n  if(svs.front()->type.compare(\"DEL\")==0){\n    svlen = -svlen;\n  }\n  \n  map<string, int> ridU;\n  map<string, int> lidU;\n  \n  vector<string> ridV;\n  vector<string> lidV;\n\n  for(vector<svDat *>::iterator iz = svs.begin(); iz != svs.end(); iz++){\n    for(vector<string>::iterator iy = (*iz)->lid.begin(); iy != (*iz)->lid.end(); iy++ ){\n      if(lidU.find(*iy) != lidU.end()){\n\tlidU[*iy] += 1;\n      }\n      else{\n\tlidU[*iy]  = 0;\n      }\n    }\n    for(vector<string>::iterator iy = (*iz)->rid.begin(); iy != (*iz)->rid.end(); iy++ ){\n      if(ridU.find(*iy) != ridU.end()){\n\tridU[*iy] += 1;\n      }\n      else{\n\tridU[*iy] = 0;\n      }\n    }\n  }\n\n  for(map<string, int>::iterator iz = lidU.begin(); iz != lidU.end(); iz++){\n    lidV.push_back(iz->first);\n  }\n  for(map<string, int>::iterator iz = lidU.begin(); iz != lidU.end(); iz++){\n    ridV.push_back(iz->first);\n  }\n  \n  stringstream bedpe;\n  \n  bedpe << svs.front()->seqid << \"\\t\"\n\t<< (fiveAvg - 5) << \"\\t\"\n\t<< (fiveAvg + 5) << \"\\t\"\n\t<< svs.front()->seqid << \"\\t\"\n\t<< (threeAvg - 5) << \"\\t\"\n\t<< (threeAvg + 5) << \"\\t\"\n\t<< svs.front()->type << \":\" << join(ids, \"-\") << \"\\t\"\n\t<< \".\\t.\\t.\\t\" \n\t<< \"SVTYPE=\" << svs.front()->type \n\t<< \";SVLEN=\" << svlen << \";ID=\" \n\t<< join(ids, \"-\") << \";SUPPORT=\" \n\t<< lSupport << \",\" << rSupport \n\t<< \";MERGED=\" << join(merged, \",\") << \";REFINED=\" << join(refined, \",\") \n\t<< \";POS=\" << fiveAvg << \",\" << threeAvg << \";LID=\" << join(lidV, \",\") \n\t<< \";RID=\" << join(ridV, \",\") << \";\" << \"COLLAPSED=\" << COLLAPSED <<  endl;\n\n  cout << bedpe.str();\n\n  for(vector<svDat *>::iterator iz = svs.begin(); iz != svs.end(); iz++){\n    delete *iz;\n  }\n\n}\n\n\/\/------------------------------- SUBROUTINE --------------------------------\n\/*\n Function input  : vector svDat pointers\n\n Function does   : merges calls\n\n Function returns: void\n\n*\/\n\nvoid mergeAndDump(vector<svDat *> & svs, bool){\n  map<string, vector< svDat *> > typeGroup;\n  for(vector<svDat *>::iterator iz = svs.begin(); iz != svs.end(); iz++){\n    typeGroup[(*iz)->type].push_back(*iz);\n  }\n\n  for(map<string, vector< svDat *> >::iterator iz = typeGroup.begin(); iz != typeGroup.end(); iz++){\n    mergeAndDump(iz->second);\n  }\n}\n\n\n\/\/------------------------------- SUBROUTINE --------------------------------\n\/*\n Function input  : pointer to svDat and a stirng\n \n Function does   : parses WHAM-GRPAHING info into a svDat struct\n\n Function returns: void \n\n*\/\nvoid parseSV(svDat * sv, string & line){\n\n  sv->lineDat =  split(line, \"\\t\");\n  vector<string> info = split(sv->lineDat[10], \";\");\n  for(vector<string>::iterator iz = info.begin(); iz != info.end(); iz++){\n    vector<string> key_value = split(*iz, \"=\");\n    sv->info[ key_value[0] ] = key_value[1];\n  }\n      \n  vector<string> pos = split(sv->info[\"POS\"], ',');\n\n  vector<string> support = split(sv->info[\"SUPPORT\"], ',');\n\n\n  sv->type = sv->info[\"SVTYPE\"];\n  sv->id   = sv->info[\"ID\"];\n    \n  sv->ls = atoi(support.front().c_str());\n  sv->rs = atoi(support.back().c_str());\n\n  sv->lid = split(sv->info[\"LID\"], ',');\n  sv->rid = split(sv->info[\"RID\"], ',');\n  \n  sv->five = atoi(pos[0].c_str());\n  sv->three = atoi(pos[1].c_str());\n  sv->seqid = sv->lineDat[0];\n  \n}\n\n\/\/-------------------------------    MAIN     --------------------------------\n\/*\n Comments:\n*\/\n\nint main( int argc, char** argv)\n{\nglobalOpts.maxDist = 5;\nint parse = parseOpts(argc, argv);\n\n vector<svDat *> SVbuffer;\n\n ifstream myfile (globalOpts.filename.c_str());\n \n string line;\n\n if(myfile.is_open()){\n   while( getline (myfile, line) ){\n     \n     svDat * sv ;\n     sv = new svDat;\n     parseSV(sv, line);\n\n     \/\/ nothing to compare against\n\n     if(SVbuffer.size() == 0){\n       SVbuffer.push_back(sv);\n       continue;\n     }\n\n     \/\/ swithed seqids\n\n     if(sv->seqid.compare(SVbuffer.back()->seqid) != 0){\n       mergeAndDump(SVbuffer, true);\n       SVbuffer.clear();\n       SVbuffer.push_back(sv);\n       continue;\n     }\n     \n     \/\/ unsorted\n\n     if(sv->five < SVbuffer.back()->five){\n       cerr << endl;\n       cerr << \"FATAL: SVs are NOT sorted.\" << endl;\n       cerr << \"      \" << SVbuffer.back()->seqid << \" \" << SVbuffer.back()->five;\n       cerr << \"      \" << sv->seqid << \" \" << sv->five << endl;\n       \n       cerr << endl;\n       exit(1);\n     }\n\n     if( (sv->five - SVbuffer.back()->five) < globalOpts.maxDist \n\t && (sv->three - SVbuffer.back()->three < globalOpts.maxDist )){\n       SVbuffer.push_back(sv);\n     }\n     else{\n       mergeAndDump(SVbuffer, true);\n       SVbuffer.clear();\n       SVbuffer.push_back(sv);\n     }\n   } \n   myfile.close();  \n }\n else{\n   cerr << endl;\n   cerr << \"FATAL: Unable to open file.\" << endl;\n   cerr << endl;\n   exit(1);\n }\n\n\nreturn 0;\n\n\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>gtktiledviewer: map shift key<commit_after><|endoftext|>"}
{"text":"<commit_before>\/* RTcmix  - Copyright (C) 2004  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#include <stdlib.h>\n#include <assert.h>\n#include \"minc_internal.h\"\n#include <rtcmix_types.h>\n#include <parse_dispatch.h>\n\n\nint\ncall_external_function(const char *funcname, const MincListElem arglist[],\n   const int nargs, MincListElem *return_value)\n{\n   int i, result, rtcmixargs_array_allocated = 0;\n   Arg retval, *rtcmixargs;\n\n   rtcmixargs = (Arg *) emalloc(nargs * sizeof(Arg));\n   \/* NB: emalloc dies if no more memory *\/\n\n   \/* Convert arglist for passing to RTcmix function. *\/\n   for (i = 0; i < nargs; i++) {\n      switch (arglist[i].type) {\n         case MincFloatType:\n            rtcmixargs[i].type = DoubleType;\n            rtcmixargs[i].val.number = arglist[i].val.number;\n            break;\n         case MincStringType:\n            rtcmixargs[i].type = StringType;\n            rtcmixargs[i].val.string = arglist[i].val.string;\n            break;\n         case MincHandleType:\n            rtcmixargs[i].type = HandleType;\n            rtcmixargs[i].val.handle = (Handle) arglist[i].val.handle;\n            break;\n         case MincListType:\n            \/* If list contains only floats, convert and pass it along.\n               Otherwise, it's an error.\n            *\/\n            rtcmixargs[i].val.array = (Array *) emalloc(sizeof(Array));\n            rtcmixargs[i].val.array->data\n                        = (double *) float_list_to_array(&arglist[i].val.list);\n            if (rtcmixargs[i].val.array->data != NULL) {\n               rtcmixargs[i].type = ArrayType;\n               rtcmixargs[i].val.array->len = arglist[i].val.list.len;\n               rtcmixargs_array_allocated = 1;\n            }\n            else {\n               minc_die(\"can't pass a mixed-type list to an RTcmix function\");\n               return -1;\n            }\n            break;\n         default:\n            minc_die(\"call_external_function: invalid argument type\");\n            break;\n      }\n   }\n\n   result = parse_dispatch(funcname, rtcmixargs, nargs, &retval);\n\n   \/* Convert return value from RTcmix function. *\/\n   switch (retval.type) {\n      case DoubleType:\n         return_value->type = MincFloatType;\n         return_value->val.number = (MincFloat) retval.val.number;\n         break;\n      case StringType:\n         return_value->type = MincStringType;\n         return_value->val.string = retval.val.string;\n         break;\n      case HandleType:\n         return_value->type = MincHandleType;\n         return_value->val.handle = (MincHandle) retval.val.handle;\n         break;\n      case ArrayType:\n#ifdef NOMORE\n\/\/ don't think functions will return non-opaque arrays to Minc, but if they do,\n\/\/ these should be converted to MincListType\n         return_value->type = MincArrayType;\n         return_value->val.array.len = retval.val.array->len;\n         return_value->val.array.data = retval.val.array->data;\n         free(retval.val.array);\n#endif\n         break;\n      default:\n         break;\n   }\n\n   \/* Free memory allocated in this function that will no longer be used. *\/\n   if (rtcmixargs_array_allocated) {\n      for (i = 0; i < nargs; i++) {\n         if (rtcmixargs[i].type == ArrayType)\n            free(rtcmixargs[i].val.array);\n      }\n   }\n   free(rtcmixargs);\n\n   return 0;\n}\n\n\nMincHandle\nminc_offsethandle(const MincHandle handle, const MincFloat val)\n{\n   Handle return_handle;\n\n   DPRINT2(\"minc_offsethandle (handle=%p, val=%f\\n\", handle, val);\n\n   \/* extract PField from MincHandle\n      create ConstPField for MincFloat\n      create AddPField\n      create Handle for new AddPField, return it cast to MincHandle\n   *\/\n\n   return_handle = (Handle) malloc(sizeof(struct _handle));\n   return_handle->type = PFieldType;\n\/\/ return_handle->ptr = (void *) new AddPField(pfield1, pfield2);\n\n   return (MincHandle) return_handle;\n}\n\n\nMincHandle\nminc_scalehandle(const MincHandle handle, const MincFloat val)\n{\n   Handle return_handle;\n\n   DPRINT2(\"minc_scalehandle (handle=%p, val=%f\\n\", handle, val);\n\n   \/* extract PField from MincHandle\n      create ConstPField for MincFloat\n      create MultPField\n      create Handle for new MultPField, return it cast to MincHandle\n   *\/\n\n   return_handle = (Handle) malloc(sizeof(struct _handle));\n   return_handle->type = PFieldType;\n\/\/ return_handle->ptr = (void *) new MultPField(pfield1, pfield2);\n\n   return (MincHandle) return_handle;\n}\n\n\nMincHandle\nminc_addhandles(const MincHandle handle1, const MincHandle handle2)\n{\n   Handle return_handle;\n\n   DPRINT2(\"minc_addhandles (handle1=%p, handle2=%p\\n\", handle1, handle2);\n\n   \/* extract PFields from MincHandles\n      create AddPField\n      create Handle for new AddPField, return it cast to MincHandle\n   *\/\n\n   return_handle = (Handle) malloc(sizeof(struct _handle));\n   return_handle->type = PFieldType;\n\/\/ return_handle->ptr = (void *) new AddPField(pfield1, pfield2);\n\n   return (MincHandle) return_handle;\n}\n\n\nMincHandle\nminc_multhandles(const MincHandle handle1, const MincHandle handle2)\n{\n   Handle return_handle;\n\n   DPRINT2(\"minc_multhandles (handle1=%p, handle2=%p\\n\", handle1, handle2);\n\n   \/* extract PFields from MincHandles\n      create MultPField\n      create Handle for new MultPField, return it cast to MincHandle\n   *\/\n\n   return_handle = (Handle) malloc(sizeof(struct _handle));\n   return_handle->type = PFieldType;\n\/\/ return_handle->ptr = (void *) new MultPField(pfield1, pfield2);\n\n   return (MincHandle) return_handle;\n}\n\n\n<commit_msg>Fix automatic exit-on-error behavior.<commit_after>\/* RTcmix  - Copyright (C) 2004  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#include <stdlib.h>\n#include <assert.h>\n#include \"minc_internal.h\"\n#include <rtcmix_types.h>\n#include <parse_dispatch.h>\n\n\nint\ncall_external_function(const char *funcname, const MincListElem arglist[],\n   const int nargs, MincListElem *return_value)\n{\n   int i, result, rtcmixargs_array_allocated = 0;\n   Arg retval, *rtcmixargs;\n\n   rtcmixargs = (Arg *) emalloc(nargs * sizeof(Arg));\n   if (rtcmixargs == NULL)\n      return -1;\n\n   \/* Convert arglist for passing to RTcmix function. *\/\n   for (i = 0; i < nargs; i++) {\n      switch (arglist[i].type) {\n         case MincFloatType:\n            rtcmixargs[i].type = DoubleType;\n            rtcmixargs[i].val.number = arglist[i].val.number;\n            break;\n         case MincStringType:\n            rtcmixargs[i].type = StringType;\n            rtcmixargs[i].val.string = arglist[i].val.string;\n            break;\n         case MincHandleType:\n            rtcmixargs[i].type = HandleType;\n            rtcmixargs[i].val.handle = (Handle) arglist[i].val.handle;\n            break;\n         case MincListType:\n            \/* If list contains only floats, convert and pass it along.\n               Otherwise, it's an error.\n            *\/\n            rtcmixargs[i].val.array = (Array *) emalloc(sizeof(Array));\n            if (rtcmixargs[i].val.array == NULL)\n               return -1;\n            rtcmixargs[i].val.array->data\n                        = (double *) float_list_to_array(&arglist[i].val.list);\n            if (rtcmixargs[i].val.array->data != NULL) {\n               rtcmixargs[i].type = ArrayType;\n               rtcmixargs[i].val.array->len = arglist[i].val.list.len;\n               rtcmixargs_array_allocated = 1;\n            }\n            else {\n               minc_die(\"can't pass a mixed-type list to an RTcmix function\");\n               return -1;\n            }\n            break;\n         default:\n            minc_die(\"call_external_function: invalid argument type\");\n            break;\n      }\n   }\n\n   result = parse_dispatch(funcname, rtcmixargs, nargs, &retval);\n\n   \/* Convert return value from RTcmix function. *\/\n   switch (retval.type) {\n      case DoubleType:\n         return_value->type = MincFloatType;\n         return_value->val.number = (MincFloat) retval.val.number;\n         break;\n      case StringType:\n         return_value->type = MincStringType;\n         return_value->val.string = retval.val.string;\n         break;\n      case HandleType:\n         return_value->type = MincHandleType;\n         return_value->val.handle = (MincHandle) retval.val.handle;\n         break;\n      case ArrayType:\n#ifdef NOMORE\n\/\/ don't think functions will return non-opaque arrays to Minc, but if they do,\n\/\/ these should be converted to MincListType\n         return_value->type = MincArrayType;\n         return_value->val.array.len = retval.val.array->len;\n         return_value->val.array.data = retval.val.array->data;\n         free(retval.val.array);\n#endif\n         break;\n      default:\n         break;\n   }\n\n   \/* Free memory allocated in this function that will no longer be used. *\/\n   if (rtcmixargs_array_allocated) {\n      for (i = 0; i < nargs; i++) {\n         if (rtcmixargs[i].type == ArrayType)\n            free(rtcmixargs[i].val.array);\n      }\n   }\n   free(rtcmixargs);\n\n   return 0;\n}\n\n\nMincHandle\nminc_offsethandle(const MincHandle handle, const MincFloat val)\n{\n   Handle return_handle;\n\n   DPRINT2(\"minc_offsethandle (handle=%p, val=%f\\n\", handle, val);\n\n   \/* extract PField from MincHandle\n      create ConstPField for MincFloat\n      create AddPField\n      create Handle for new AddPField, return it cast to MincHandle\n   *\/\n\n   return_handle = (Handle) malloc(sizeof(struct _handle));\n   return_handle->type = PFieldType;\n\/\/ return_handle->ptr = (void *) new AddPField(pfield1, pfield2);\n\n   return (MincHandle) return_handle;\n}\n\n\nMincHandle\nminc_scalehandle(const MincHandle handle, const MincFloat val)\n{\n   Handle return_handle;\n\n   DPRINT2(\"minc_scalehandle (handle=%p, val=%f\\n\", handle, val);\n\n   \/* extract PField from MincHandle\n      create ConstPField for MincFloat\n      create MultPField\n      create Handle for new MultPField, return it cast to MincHandle\n   *\/\n\n   return_handle = (Handle) malloc(sizeof(struct _handle));\n   return_handle->type = PFieldType;\n\/\/ return_handle->ptr = (void *) new MultPField(pfield1, pfield2);\n\n   return (MincHandle) return_handle;\n}\n\n\nMincHandle\nminc_addhandles(const MincHandle handle1, const MincHandle handle2)\n{\n   Handle return_handle;\n\n   DPRINT2(\"minc_addhandles (handle1=%p, handle2=%p\\n\", handle1, handle2);\n\n   \/* extract PFields from MincHandles\n      create AddPField\n      create Handle for new AddPField, return it cast to MincHandle\n   *\/\n\n   return_handle = (Handle) malloc(sizeof(struct _handle));\n   return_handle->type = PFieldType;\n\/\/ return_handle->ptr = (void *) new AddPField(pfield1, pfield2);\n\n   return (MincHandle) return_handle;\n}\n\n\nMincHandle\nminc_multhandles(const MincHandle handle1, const MincHandle handle2)\n{\n   Handle return_handle;\n\n   DPRINT2(\"minc_multhandles (handle1=%p, handle2=%p\\n\", handle1, handle2);\n\n   \/* extract PFields from MincHandles\n      create MultPField\n      create Handle for new MultPField, return it cast to MincHandle\n   *\/\n\n   return_handle = (Handle) malloc(sizeof(struct _handle));\n   return_handle->type = PFieldType;\n\/\/ return_handle->ptr = (void *) new MultPField(pfield1, pfield2);\n\n   return (MincHandle) return_handle;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ win-window.cpp\n#include \"..\/window.h\"\n\n#include \"core\/slang-smart-pointer.h\"\n\n#include <stdio.h>\n\n#ifdef _MSC_VER\n#include <stddef.h>\n#if (_MSC_VER < 1900)\n#define snprintf sprintf_s\n#endif\n#endif\n\n#include <stdint.h>\n\n#if _WIN32\n#include <Windows.h>\n#include <Windowsx.h>\n#else\n#error \"The slang-graphics library currently only supports Windows platforms\"\n#endif\n\nnamespace gfx {\n\n#if _WIN32\n\nstruct OSString\n{\n    OSString(char const* begin, char const* end)\n    {\n        _initialize(begin, end - begin);\n    }\n\n    OSString(char const* begin)\n    {\n        _initialize(begin, strlen(begin));\n    }\n\n    ~OSString()\n    {\n        free(mBegin);\n    }\n\n    operator WCHAR const*()\n    {\n        return mBegin;\n    }\n\nprivate:\n    WCHAR* mBegin;\n    WCHAR* mEnd;\n\n    void _initialize(char const* input, size_t inputSize)\n    {\n        const DWORD dwFlags = 0;\n        int outputCodeUnitCount = ::MultiByteToWideChar(CP_UTF8, dwFlags, input, int(inputSize), nullptr, 0);\n\n        WCHAR* buffer = (WCHAR*)malloc(sizeof(WCHAR) * (outputCodeUnitCount + 1));\n\n        ::MultiByteToWideChar(CP_UTF8, dwFlags, input, int(inputSize), buffer, outputCodeUnitCount);\n        buffer[outputCodeUnitCount] = 0;\n\n        mBegin = buffer;\n        mEnd = buffer + outputCodeUnitCount;\n    }\n};\n\nstruct ApplicationContext : public Slang::RefObject\n{\n    HINSTANCE instance;\n    int showCommand = SW_SHOWDEFAULT;\n    int resultCode = 0;\n};\n\nstatic uint64_t gTimerFrequency;\n\n\nstatic void initApplication(ApplicationContext* context)\n{\n    LARGE_INTEGER timerFrequency;\n    QueryPerformanceFrequency(&timerFrequency);\n    gTimerFrequency = timerFrequency.QuadPart;\n}\n\n\/\/\/ Run an application given the specified callback and command-line arguments.\nint runApplication(\n    ApplicationFunc     func,\n    int                 argc,\n    char const* const*  argv)\n{\n    ApplicationContext context;\n    context.instance = (HINSTANCE) GetModuleHandle(0);\n    initApplication(&context);\n    func(&context);\n    return context.resultCode;\n}\n\nint runWindowsApplication(\n    ApplicationFunc     func,\n    void*               instance,\n    int                 showCommand)\n{\n    ApplicationContext context;\n    context.instance = (HINSTANCE) instance;\n    context.showCommand = showCommand;\n    initApplication(&context);\n    func(&context);\n    return context.resultCode;\n}\n\nstruct Window\n{\n    HWND            handle;\n    WNDPROC         nativeHook;\n    EventHandler    eventHandler;\n    void*           userData;\n};\n\nvoid setNativeWindowHook(Window* window, WNDPROC proc)\n{\n    window->nativeHook = proc;\n}\n\nstatic KeyCode translateKeyCode(int vkey)\n{\n    switch( vkey )\n    {\n    default:\n        return KeyCode::Unknown;\n\n#define CASE(FROM, TO) case FROM: return KeyCode::TO;\n    CASE('A', A); CASE('B', B); CASE('C', C); CASE('D', D); CASE('E', E);\n    CASE('F', F); CASE('G', G); CASE('H', H); CASE('I', I); CASE('J', J);\n    CASE('K', K); CASE('L', M); CASE('M', M); CASE('N', N); CASE('O', O);\n    CASE('P', P); CASE('Q', Q); CASE('R', R); CASE('S', S); CASE('T', T);\n    CASE('U', U); CASE('V', V); CASE('W', W); CASE('X', X); CASE('Y', Y);\n    CASE('Z', Z);\n#undef CASE\n\n#define CASE(FROM, TO) case VK_##FROM: return KeyCode::TO;\n    CASE(SPACE, Space);\n#undef CASE\n    }\n}\n\nstatic LRESULT CALLBACK windowProc(\n    HWND    windowHandle,\n    UINT    message,\n    WPARAM  wParam,\n    LPARAM  lParam)\n{\n    Window* window = (Window*) GetWindowLongPtrW(windowHandle, GWLP_USERDATA);\n\n    \/\/ Give the installed filter a chance to intercept messages.\n    \/\/ (This is used for ImGui)\n    if( window )\n    {\n        if(auto nativeHook = window->nativeHook)\n        {\n            auto result = nativeHook(windowHandle, message, wParam, lParam);\n            if(result)\n                return result;\n        }\n    }\n\n    auto eventHandler = window ? window->eventHandler : nullptr;\n\n    switch (message)\n    {\n    case WM_CREATE:\n        {\n            auto createInfo = (CREATESTRUCTW*) lParam;\n            window = (Window*) createInfo->lpCreateParams;\n            window->handle = windowHandle;\n\n            SetWindowLongPtrW(windowHandle, GWLP_USERDATA, (LONG_PTR) window);\n        }\n        break;\n\n    case WM_KEYDOWN:\n    case WM_KEYUP:\n        {\n            int virtualKey = (int) wParam;\n            auto keyCode = translateKeyCode(virtualKey);\n            if(eventHandler)\n            {\n                Event event;\n                event.window = window;\n                event.code = message == WM_KEYDOWN ? EventCode::KeyDown : EventCode::KeyUp;\n                event.u.key = keyCode;\n                eventHandler(event);\n            }\n        }\n        break;\n\n    case WM_LBUTTONDOWN:\n    case WM_LBUTTONUP:\n        {\n            if(eventHandler)\n            {\n                Event event;\n                event.window = window;\n                event.code = message == WM_LBUTTONDOWN ? EventCode::MouseDown : EventCode::MouseUp;\n                event.u.mouse.x = (float) GET_X_LPARAM(lParam);\n                event.u.mouse.y = (float) GET_Y_LPARAM(lParam);\n                eventHandler(event);\n            }\n        }\n        break;\n\n    case WM_MOUSEMOVE:\n        {\n            if(eventHandler)\n            {\n                Event event;\n                event.window = window;\n                event.code = EventCode::MouseMoved;\n                event.u.mouse.x = (float) GET_X_LPARAM(lParam);\n                event.u.mouse.y = (float) GET_Y_LPARAM(lParam);\n                eventHandler(event);\n            }\n        }\n        break;\n\n    case WM_CLOSE:\n        PostQuitMessage(0);\n        return 0;\n    }\n\n\n    return DefWindowProcW(windowHandle, message, wParam, lParam);\n}\n\n\nstatic ATOM createWindowClassAtom()\n{\n    WNDCLASSEXW windowClassDesc;\n    windowClassDesc.cbSize = sizeof(windowClassDesc);\n    windowClassDesc.style = CS_OWNDC | CS_HREDRAW | CS_VREDRAW;\n    windowClassDesc.lpfnWndProc = &windowProc;\n    windowClassDesc.cbClsExtra = 0;\n    windowClassDesc.cbWndExtra = 0;\n    windowClassDesc.hInstance = (HINSTANCE) GetModuleHandle(0);\n    windowClassDesc.hIcon = 0;\n    windowClassDesc.hCursor = LoadCursorW(NULL, IDC_ARROW);\n    windowClassDesc.hbrBackground = 0;\n    windowClassDesc.lpszMenuName = 0;\n    windowClassDesc.lpszClassName = L\"SlangGraphicsWindow\";\n    windowClassDesc.hIconSm = 0;\n    ATOM windowClassAtom = RegisterClassExW(&windowClassDesc);\n    return windowClassAtom;\n}\n\nstatic ATOM getWindowClassAtom()\n{\n    static ATOM windowClassAtom = createWindowClassAtom();\n    return windowClassAtom;\n}\n\nWindow* createWindow(WindowDesc const& desc)\n{\n    Window* window = new Window();\n    window->handle = nullptr;\n    window->nativeHook = nullptr;\n    window->eventHandler = desc.eventHandler;\n    window->userData = desc.userData;\n\n    OSString windowTitle(desc.title);\n\n    DWORD windowExtendedStyle = 0;\n    DWORD windowStyle = WS_OVERLAPPED | WS_CAPTION | WS_SYSMENU;\n\n    HINSTANCE instance = (HINSTANCE) GetModuleHandle(0);\n\n    RECT windowRect;\n    windowRect.left = 0;\n    windowRect.top = 0;\n    windowRect.bottom = desc.height;\n    windowRect.right = desc.width;\n    AdjustWindowRect(&windowRect, windowStyle, FALSE);\n\n    HWND windowHandle = CreateWindowExW(\n        windowExtendedStyle,\n        (LPWSTR) getWindowClassAtom(),\n        windowTitle,\n        windowStyle,\n        CW_USEDEFAULT,\n        0, \/\/ x, y\n        windowRect.right,\n        windowRect.bottom,\n        NULL, \/\/ parent\n        NULL, \/\/ menu\n        instance,\n        window);\n\n\n    if(!windowHandle)\n    {\n        delete window;\n        return nullptr;\n    }\n\n    window->handle = windowHandle;\n    return window;\n}\n\nvoid destroyWindow(Window* window)\n{\n    DestroyWindow(window->handle);\n    delete window;\n}\n\nvoid showWindow(Window* window)\n{\n    ShowWindow(window->handle, SW_SHOW);\n}\n\nvoid* getPlatformWindowHandle(Window* window)\n{\n    return window->handle;\n}\n\nvoid* getUserData(Window* window)\n{\n    return window->userData;\n}\n\nbool dispatchEvents(ApplicationContext* context)\n{\n    for(;;)\n    {\n        MSG message;\n\n        int result = PeekMessageW(&message, NULL, 0, 0, PM_REMOVE);\n        if (result != 0)\n        {\n            if (message.message == WM_QUIT)\n            {\n                context->resultCode = (int)message.wParam;\n                return false;\n            }\n\n            TranslateMessage(&message);\n            DispatchMessageW(&message);\n        }\n        else\n        {\n            return true;\n        }\n    }\n\n}\n\nvoid exitApplication(ApplicationContext* context, int resultCode)\n{\n    ExitProcess(resultCode);\n}\n\nvoid log(char const* message, ...)\n{\n    va_list args;\n    va_start(args, message);\n\n    static const int kBufferSize = 1024;\n    char messageBuffer[kBufferSize];\n    vsnprintf(messageBuffer, kBufferSize - 1, message, args);\n    messageBuffer[kBufferSize - 1] = 0;\n\n    va_end(args);\n\n    fputs(messageBuffer, stderr);\n\n    OSString wideMessageBuffer(messageBuffer);\n    OutputDebugStringW(wideMessageBuffer);\n}\n\nint reportError(char const* message, ...)\n{\n    va_list args;\n    va_start(args, message);\n\n    static const int kBufferSize = 1024;\n    char messageBuffer[kBufferSize];\n    vsnprintf(messageBuffer, kBufferSize - 1, message, args);\n    messageBuffer[kBufferSize - 1] = 0;\n\n    va_end(args);\n\n    fputs(messageBuffer, stderr);\n\n    OSString wideMessageBuffer(messageBuffer);\n    OutputDebugStringW(wideMessageBuffer);\n\n    return 1;\n}\n\nuint64_t getCurrentTime()\n{\n    LARGE_INTEGER counter;\n    QueryPerformanceCounter(&counter);\n    return counter.QuadPart;\n}\n\nuint64_t getTimerFrequency()\n{\n    return gTimerFrequency;\n}\n\n#else\n\n\/\/ TODO: put an SDL version here\n\n#endif\n\n} \/\/ gfx\n<commit_msg>Bug fix in window creation. (#1738)<commit_after>\/\/ win-window.cpp\n#include \"..\/window.h\"\n\n#include \"core\/slang-smart-pointer.h\"\n\n#include <stdio.h>\n\n#ifdef _MSC_VER\n#include <stddef.h>\n#if (_MSC_VER < 1900)\n#define snprintf sprintf_s\n#endif\n#endif\n\n#include <stdint.h>\n\n#if _WIN32\n#include <Windows.h>\n#include <Windowsx.h>\n#else\n#error \"The slang-graphics library currently only supports Windows platforms\"\n#endif\n\nnamespace gfx {\n\n#if _WIN32\n\nstruct OSString\n{\n    OSString(char const* begin, char const* end)\n    {\n        _initialize(begin, end - begin);\n    }\n\n    OSString(char const* begin)\n    {\n        _initialize(begin, strlen(begin));\n    }\n\n    ~OSString()\n    {\n        free(mBegin);\n    }\n\n    operator WCHAR const*()\n    {\n        return mBegin;\n    }\n\nprivate:\n    WCHAR* mBegin;\n    WCHAR* mEnd;\n\n    void _initialize(char const* input, size_t inputSize)\n    {\n        const DWORD dwFlags = 0;\n        int outputCodeUnitCount = ::MultiByteToWideChar(CP_UTF8, dwFlags, input, int(inputSize), nullptr, 0);\n\n        WCHAR* buffer = (WCHAR*)malloc(sizeof(WCHAR) * (outputCodeUnitCount + 1));\n\n        ::MultiByteToWideChar(CP_UTF8, dwFlags, input, int(inputSize), buffer, outputCodeUnitCount);\n        buffer[outputCodeUnitCount] = 0;\n\n        mBegin = buffer;\n        mEnd = buffer + outputCodeUnitCount;\n    }\n};\n\nstruct ApplicationContext : public Slang::RefObject\n{\n    HINSTANCE instance;\n    int showCommand = SW_SHOWDEFAULT;\n    int resultCode = 0;\n};\n\nstatic uint64_t gTimerFrequency;\n\n\nstatic void initApplication(ApplicationContext* context)\n{\n    LARGE_INTEGER timerFrequency;\n    QueryPerformanceFrequency(&timerFrequency);\n    gTimerFrequency = timerFrequency.QuadPart;\n}\n\n\/\/\/ Run an application given the specified callback and command-line arguments.\nint runApplication(\n    ApplicationFunc     func,\n    int                 argc,\n    char const* const*  argv)\n{\n    ApplicationContext context;\n    context.instance = (HINSTANCE) GetModuleHandle(0);\n    initApplication(&context);\n    func(&context);\n    return context.resultCode;\n}\n\nint runWindowsApplication(\n    ApplicationFunc     func,\n    void*               instance,\n    int                 showCommand)\n{\n    ApplicationContext context;\n    context.instance = (HINSTANCE) instance;\n    context.showCommand = showCommand;\n    initApplication(&context);\n    func(&context);\n    return context.resultCode;\n}\n\nstruct Window\n{\n    HWND            handle;\n    WNDPROC         nativeHook;\n    EventHandler    eventHandler;\n    void*           userData;\n};\n\nvoid setNativeWindowHook(Window* window, WNDPROC proc)\n{\n    window->nativeHook = proc;\n}\n\nstatic KeyCode translateKeyCode(int vkey)\n{\n    switch( vkey )\n    {\n    default:\n        return KeyCode::Unknown;\n\n#define CASE(FROM, TO) case FROM: return KeyCode::TO;\n    CASE('A', A); CASE('B', B); CASE('C', C); CASE('D', D); CASE('E', E);\n    CASE('F', F); CASE('G', G); CASE('H', H); CASE('I', I); CASE('J', J);\n    CASE('K', K); CASE('L', M); CASE('M', M); CASE('N', N); CASE('O', O);\n    CASE('P', P); CASE('Q', Q); CASE('R', R); CASE('S', S); CASE('T', T);\n    CASE('U', U); CASE('V', V); CASE('W', W); CASE('X', X); CASE('Y', Y);\n    CASE('Z', Z);\n#undef CASE\n\n#define CASE(FROM, TO) case VK_##FROM: return KeyCode::TO;\n    CASE(SPACE, Space);\n#undef CASE\n    }\n}\n\nstatic LRESULT CALLBACK windowProc(\n    HWND    windowHandle,\n    UINT    message,\n    WPARAM  wParam,\n    LPARAM  lParam)\n{\n    Window* window = (Window*) GetWindowLongPtrW(windowHandle, GWLP_USERDATA);\n\n    \/\/ Give the installed filter a chance to intercept messages.\n    \/\/ (This is used for ImGui)\n    if( window )\n    {\n        if(auto nativeHook = window->nativeHook)\n        {\n            auto result = nativeHook(windowHandle, message, wParam, lParam);\n            if(result)\n                return result;\n        }\n    }\n\n    auto eventHandler = window ? window->eventHandler : nullptr;\n\n    switch (message)\n    {\n    case WM_CREATE:\n        {\n            auto createInfo = (CREATESTRUCTW*) lParam;\n            window = (Window*) createInfo->lpCreateParams;\n            window->handle = windowHandle;\n\n            SetWindowLongPtrW(windowHandle, GWLP_USERDATA, (LONG_PTR) window);\n        }\n        break;\n\n    case WM_KEYDOWN:\n    case WM_KEYUP:\n        {\n            int virtualKey = (int) wParam;\n            auto keyCode = translateKeyCode(virtualKey);\n            if(eventHandler)\n            {\n                Event event;\n                event.window = window;\n                event.code = message == WM_KEYDOWN ? EventCode::KeyDown : EventCode::KeyUp;\n                event.u.key = keyCode;\n                eventHandler(event);\n            }\n        }\n        break;\n\n    case WM_LBUTTONDOWN:\n    case WM_LBUTTONUP:\n        {\n            if(eventHandler)\n            {\n                Event event;\n                event.window = window;\n                event.code = message == WM_LBUTTONDOWN ? EventCode::MouseDown : EventCode::MouseUp;\n                event.u.mouse.x = (float) GET_X_LPARAM(lParam);\n                event.u.mouse.y = (float) GET_Y_LPARAM(lParam);\n                eventHandler(event);\n            }\n        }\n        break;\n\n    case WM_MOUSEMOVE:\n        {\n            if(eventHandler)\n            {\n                Event event;\n                event.window = window;\n                event.code = EventCode::MouseMoved;\n                event.u.mouse.x = (float) GET_X_LPARAM(lParam);\n                event.u.mouse.y = (float) GET_Y_LPARAM(lParam);\n                eventHandler(event);\n            }\n        }\n        break;\n\n    case WM_CLOSE:\n        PostQuitMessage(0);\n        return 0;\n    }\n\n\n    return DefWindowProcW(windowHandle, message, wParam, lParam);\n}\n\n\nstatic ATOM createWindowClassAtom()\n{\n    WNDCLASSEXW windowClassDesc;\n    windowClassDesc.cbSize = sizeof(windowClassDesc);\n    windowClassDesc.style = CS_OWNDC | CS_HREDRAW | CS_VREDRAW;\n    windowClassDesc.lpfnWndProc = &windowProc;\n    windowClassDesc.cbClsExtra = 0;\n    windowClassDesc.cbWndExtra = 0;\n    windowClassDesc.hInstance = (HINSTANCE) GetModuleHandle(0);\n    windowClassDesc.hIcon = 0;\n    windowClassDesc.hCursor = LoadCursorW(NULL, IDC_ARROW);\n    windowClassDesc.hbrBackground = 0;\n    windowClassDesc.lpszMenuName = 0;\n    windowClassDesc.lpszClassName = L\"SlangGraphicsWindow\";\n    windowClassDesc.hIconSm = 0;\n    ATOM windowClassAtom = RegisterClassExW(&windowClassDesc);\n    return windowClassAtom;\n}\n\nstatic ATOM getWindowClassAtom()\n{\n    static ATOM windowClassAtom = createWindowClassAtom();\n    return windowClassAtom;\n}\n\nWindow* createWindow(WindowDesc const& desc)\n{\n    Window* window = new Window();\n    window->handle = nullptr;\n    window->nativeHook = nullptr;\n    window->eventHandler = desc.eventHandler;\n    window->userData = desc.userData;\n\n    OSString windowTitle(desc.title);\n\n    DWORD windowExtendedStyle = 0;\n    DWORD windowStyle = WS_OVERLAPPED | WS_CAPTION | WS_SYSMENU;\n\n    HINSTANCE instance = (HINSTANCE) GetModuleHandle(0);\n\n    RECT windowRect;\n    windowRect.left = 0;\n    windowRect.top = 0;\n    windowRect.bottom = desc.height;\n    windowRect.right = desc.width;\n    AdjustWindowRect(&windowRect, windowStyle, FALSE);\n\n    HWND windowHandle = CreateWindowExW(\n        windowExtendedStyle,\n        (LPWSTR) getWindowClassAtom(),\n        windowTitle,\n        windowStyle,\n        CW_USEDEFAULT,\n        0, \/\/ x, y\n        windowRect.right - windowRect.left,\n        windowRect.bottom - windowRect.top,\n        NULL, \/\/ parent\n        NULL, \/\/ menu\n        instance,\n        window);\n\n\n    if(!windowHandle)\n    {\n        delete window;\n        return nullptr;\n    }\n\n    window->handle = windowHandle;\n    return window;\n}\n\nvoid destroyWindow(Window* window)\n{\n    DestroyWindow(window->handle);\n    delete window;\n}\n\nvoid showWindow(Window* window)\n{\n    ShowWindow(window->handle, SW_SHOW);\n}\n\nvoid* getPlatformWindowHandle(Window* window)\n{\n    return window->handle;\n}\n\nvoid* getUserData(Window* window)\n{\n    return window->userData;\n}\n\nbool dispatchEvents(ApplicationContext* context)\n{\n    for(;;)\n    {\n        MSG message;\n\n        int result = PeekMessageW(&message, NULL, 0, 0, PM_REMOVE);\n        if (result != 0)\n        {\n            if (message.message == WM_QUIT)\n            {\n                context->resultCode = (int)message.wParam;\n                return false;\n            }\n\n            TranslateMessage(&message);\n            DispatchMessageW(&message);\n        }\n        else\n        {\n            return true;\n        }\n    }\n\n}\n\nvoid exitApplication(ApplicationContext* context, int resultCode)\n{\n    ExitProcess(resultCode);\n}\n\nvoid log(char const* message, ...)\n{\n    va_list args;\n    va_start(args, message);\n\n    static const int kBufferSize = 1024;\n    char messageBuffer[kBufferSize];\n    vsnprintf(messageBuffer, kBufferSize - 1, message, args);\n    messageBuffer[kBufferSize - 1] = 0;\n\n    va_end(args);\n\n    fputs(messageBuffer, stderr);\n\n    OSString wideMessageBuffer(messageBuffer);\n    OutputDebugStringW(wideMessageBuffer);\n}\n\nint reportError(char const* message, ...)\n{\n    va_list args;\n    va_start(args, message);\n\n    static const int kBufferSize = 1024;\n    char messageBuffer[kBufferSize];\n    vsnprintf(messageBuffer, kBufferSize - 1, message, args);\n    messageBuffer[kBufferSize - 1] = 0;\n\n    va_end(args);\n\n    fputs(messageBuffer, stderr);\n\n    OSString wideMessageBuffer(messageBuffer);\n    OutputDebugStringW(wideMessageBuffer);\n\n    return 1;\n}\n\nuint64_t getCurrentTime()\n{\n    LARGE_INTEGER counter;\n    QueryPerformanceCounter(&counter);\n    return counter.QuadPart;\n}\n\nuint64_t getTimerFrequency()\n{\n    return gTimerFrequency;\n}\n\n#else\n\n\/\/ TODO: put an SDL version here\n\n#endif\n\n} \/\/ gfx\n<|endoftext|>"}
{"text":"<commit_before>\/\/# \/Users\/arnold\/Documents\/prg\/clang\/bin\/clang++ -U__STRICT_ANSI__ -std=c++14 -I\/Users\/arnold\/Documents\/prg\/libraries\/boost_1_56_0\/ -I\/Developer\/SDKs\/MacOSX10.6.sdk\/usr\/include -I\/Users\/arnold\/Documents\/prg\/libraries\/cryptopp563\/include -Wall -O2 -L\/Users\/arnold\/Documents\/prg\/libraries\/boost_1_56_0\/stage\/lib -L\/Users\/arnold\/Documents\/prg\/libraries\/cryptopp563\/lib -o apfel2 apfel2.cpp -lboost_system -lboost_filesystem -lboost_iostreams -lcryptopp\n\n#include <iostream>\n#include <boost\/filesystem.hpp>\n#include <vector>\n#include <string>\n#include <array>\n#include <algorithm>\n#include <complex>\n#include <boost\/format.hpp>\n#include <utility>\n\nusing namespace std;\n\ntemplate<typename T>\nstruct window {\n\twindow(const T& xmin, const T& ymin, const T& xmax, const T& ymax) \n\t\t: xmin_{xmin}, ymin_{ymin}, xmax_{xmax}, ymax_{ymax}\n\t{\n\t\tif (xmin_ > xmax_) \n\t\t\tswap(xmin_, xmax_);\n\t\tif (ymin_ > ymax_) \n\t\t\tswap(ymin_, ymax_);\n\t}\n\twindow() = default;\n\tT width() const { return xmax_ - xmin_; }\n\tT height() const { return ymax_ - ymin_; }\n\tvoid zoom(const double& fx, const double& fy) {\n\t\t\/\/double ffx = 1.0\/fx;\n\t\t\/\/double ffy = 1.0\/fy;\n\t\tdouble dx = width() * fx\/2.0;\n\t\tdouble dy = height() * fy\/2.0;\n\t\txmin_ += dx;\n\t\txmax_ -= dx;\n\t\tymin_ += dy;\n\t\tymax_ -= dy;\n\t}\n\tvoid zoom(const double& f) {\n\t\tzoom(f, f);\n\/*\n\t\tdouble ff = 1.0\/f;\n\t\tdouble dx = width() * ff\/2.0;\n\t\tdouble dy = height() * ff\/2.0;\n\t\txmin_ += dx;\n\t\txmax_ -= dx;\n\t\tymin_ += dy;\n\t\tymax_ -= dy;*\/\n\t}\n\tvoid move(const double& h, const double& v) {\n\t\tdouble dx = width() * h;\n\t\tdouble dy = height() * v;\n\t\txmin_ += dx;\n\t\txmax_ += dx;\n\t\tymin_ += dy;\n\t\tymax_ += dy;\n\t}\n\tT xmin_ {-2};\n\tT ymin_ {-1.5};\n\tT xmax_ {1};\n\tT ymax_ {1.5};\n};\n\nstruct fract {\n\tusing it_t = unsigned;\n\twindow<double>     imgrange_;\n\twindow<unsigned>   dim_;\n\t\n};\n\ntemplate<typename T>\nostream& operator<<(ostream& o, const window<T>& w) {\n\to << boost::format{\"(%1.15f, %1.15f)-(%1.15f, %1.15f)\"} % w.xmin_ % w.ymin_ % w.xmax_ % w.ymax_;\n\treturn o;\n}\n\nconstexpr const array<char, 13> ch = {{ ' ', '.', ',', ':', ';', '+', 'i', 'I', '%', 'H', '8', 'M', '#'}};\n\nint main (int argc, char const *argv[])\n{\n\tusing cpt = complex<double>;\n\tdouble escval = 4.0;\n\tvector<string> params(argv, argv + argc);\n\/\/\tcin >> noskipws;\n\ttry {\n\/\/\t\twindow<unsigned> p(0, 100, 0, 20);\n\t\tcpt ca(1,0.5);\n\/*\t\tcout << ca << endl;\n\t\tcout << ca * ca * ca << endl;\n\t\tcout << pow(ca,3) << endl;*\/\n\t\twindow<double> w;\/\/(-1.5,0,0.5,1);\n\t\tunsigned maxit = 100;\n\t\tunsigned rows = 120;\n\t\tunsigned lines = rows * 1.0\/1.8;\n\t\tfor(unsigned it = 0; true; ++it) {\n\t\t\tif (it > 0) {\n\t\t\t\tcout << w << \" \" << maxit << \" \" << escval << \" zoom In, zoom Out, Left, Right, Up, Down, +iterate, -iterate, +Esc, -esc, +Wide, -wide, Quit: \";\n\t\t\t\tstring cc;\n\t\t\t\tgetline(cin, cc);\n\t\t\t\tchar c;\n\t\t\t\tc = cc.at(0);\n\t\t\t\tcout << endl;\n\t\t\t\tswitch(c) {\n\t\t\t\t\tcase 'q' :\n\t\t\t\t\t\texit(0);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'l':\n\t\t\t\t\t\tw.move(-0.25, 0);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'r':\n\t\t\t\t\t\tw.move(0.25, 0);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'u':\n\t\t\t\t\t\tw.move(0,0.25);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'd':\n\t\t\t\t\t\tw.move(0,-0.25);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'i':\n\t\t\t\t\t\tw.zoom(0.5);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'o':\n\t\t\t\t\t\tw.zoom(-1);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase '+':\n\t\t\t\t\t\tmaxit *= 2.0;\n\t\t\t\t\t\tmaxit = min(1u<<16,maxit);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase '-':\n\t\t\t\t\t\tmaxit \/= 2.0;\n\t\t\t\t\t\tmaxit = max(1u,maxit);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'e':\n\t\t\t\t\t\tescval \/= 2.0;\n\t\t\t\t\t\tescval = max(1.0, escval);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'E':\n\t\t\t\t\t\tescval *= 2.0;\n\t\t\t\t\t\tescval = min(256.0, escval);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'W':\n\t\t\t\t\t\trows += rows * 0.25;\n\t\t\t\t\t\tw.zoom(-0.25, 0);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'w':\n\t\t\t\t\t\trows -= rows\/4.0;\n\t\t\t\t\t\tw.zoom(0.25, 0);\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tdouble stepx = w.width() \/ static_cast<double>(rows);\n\t\t\tdouble stepy = w.height() \/ static_cast<double>(lines);\n\t\t\tcout << stepx << \", \" << stepy << endl;\n\t\t\t\/\/cout << endl;\n\t\t\tfor(double y = w.ymax_; y > w.ymin_; y -= stepy) {\n\t\t\t\tfor(double x = w.xmin_; x < w.xmax_; x += stepx) {\n\t\t\t\t\tunsigned i = 0;\n\t\t\t\t\tbool isin = true;\n\t\t\t\t\tcpt c(x,y);\n\t\t\t\t\tcpt cc = c;\n\t\t\t\t\tfor(; i < maxit; ++i) {\n\t\t\t\t\t\tc = c * c *c + cc;\n\t\t\t\t\t\tif (c.real() * c.real() + c.imag() * c.imag() > escval) {\n\t\t\t\t\t\t\tisin = false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t} \n\t\t\t\t\t}\n\t\t\t\t\tif (isin) {\n\t\t\t\t\t\tcout << '*';\n\t\t\t\t\t} else {\n\t\t\t\t\t\tsize_t idx = static_cast<double>(i)\/maxit * ch.size();\n\t\t\t\t\t\tcout << ch[idx] ;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tcout << endl;\n\t\t\t}\n\t\t}\n\t} catch(...) {\n\t\tcerr << \"Unknown exception\" << endl;\n\t}\n\treturn 0;\n}<commit_msg>20160311<commit_after>\/\/# \/Users\/arnold\/Documents\/prg\/clang\/bin\/clang++ -U__STRICT_ANSI__ -std=c++14 -I\/Users\/arnold\/Documents\/prg\/libraries\/boost_1_56_0\/ -I\/Developer\/SDKs\/MacOSX10.6.sdk\/usr\/include -I\/Users\/arnold\/Documents\/prg\/libraries\/cryptopp563\/include -Wall -O2 -L\/Users\/arnold\/Documents\/prg\/libraries\/boost_1_56_0\/stage\/lib -L\/Users\/arnold\/Documents\/prg\/libraries\/cryptopp563\/lib -o apfel2 apfel2.cpp -lboost_system -lboost_filesystem -lboost_iostreams -lcryptopp\n\n#include <iostream>\n#include <boost\/filesystem.hpp>\n#include <vector>\n#include <string>\n#include <array>\n#include <algorithm>\n#include <complex>\n#include <boost\/format.hpp>\n#include <utility>\n\nusing namespace std;\n\ntemplate<typename T>\nstruct window {\n\twindow(const T& xmin, const T& ymin, const T& xmax, const T& ymax) \n\t\t: xmin_{xmin}, ymin_{ymin}, xmax_{xmax}, ymax_{ymax}\n\t{\n\t\tif (xmin_ > xmax_) \n\t\t\tswap(xmin_, xmax_);\n\t\tif (ymin_ > ymax_) \n\t\t\tswap(ymin_, ymax_);\n\t}\n\twindow() = default;\n\tT width() const { return xmax_ - xmin_; }\n\tT height() const { return ymax_ - ymin_; }\n\tvoid zoom(const double& fx, const double& fy) {\n\t\t\/\/double ffx = 1.0\/fx;\n\t\t\/\/double ffy = 1.0\/fy;\n\t\tdouble dx = width() * fx\/2.0;\n\t\tdouble dy = height() * fy\/2.0;\n\t\txmin_ += dx;\n\t\txmax_ -= dx;\n\t\tymin_ += dy;\n\t\tymax_ -= dy;\n\t}\n\tvoid zoom(const double& f) {\n\t\tzoom(f, f);\n\/*\n\t\tdouble ff = 1.0\/f;\n\t\tdouble dx = width() * ff\/2.0;\n\t\tdouble dy = height() * ff\/2.0;\n\t\txmin_ += dx;\n\t\txmax_ -= dx;\n\t\tymin_ += dy;\n\t\tymax_ -= dy;*\/\n\t}\n\tvoid move(const double& h, const double& v) {\n\t\tdouble dx = width() * h;\n\t\tdouble dy = height() * v;\n\t\txmin_ += dx;\n\t\txmax_ += dx;\n\t\tymin_ += dy;\n\t\tymax_ += dy;\n\t}\n\tT xmin_ {-2};\n\tT ymin_ {-1.5};\n\tT xmax_ {1};\n\tT ymax_ {1.5};\n};\n\nstruct fract {\n\tusing it_t = unsigned;\n\twindow<double>     imgrange_;\n\twindow<unsigned>   dim_;\n\t\n};\n\ntemplate<typename T>\nostream& operator<<(ostream& o, const window<T>& w) {\n\to << boost::format{\"(%1.15f, %1.15f)-(%1.15f, %1.15f)\"} % w.xmin_ % w.ymin_ % w.xmax_ % w.ymax_;\n\treturn o;\n}\n\nstruct pxmap {\n\tpxmap(unsigned maxit, unsigned width, unsigned height)\n\t\t: maxit_{maxit+1}, width_{width}, height_{height}, px_(width_ * height_)\n\t{}\n\tunsigned maxit_;\n\tunsigned width_;\n\tunsigned height_;\n\tvector<unsigned> px_;\n\tstatic const array<char, 14> ch_; \/\/ = {{ ' ', '.', ',', ':', ';', '+', 'i', 'I', '%', 'H', '8', 'M', '#'}};\n\tvoid print() {\n\t\tunsigned pn = 0;\n\t\tfor(const auto& p : px_) {\n\t\t\tcout << ch_[static_cast<double>(p)\/maxit_ * pxmap::ch_.size()];\t\n\t\t\tif (++pn % width_ == 0) {\n\t\t\t\tcout << endl;\n\t\t\t}\n\t\t}\n\t\tcout << endl;\n\t}\n};\n\nconstexpr const array<char, 14> pxmap::ch_ = {{ ' ', '.', ',', ':', ';', '+', 'i', 'I', '%', 'H', '8', 'M', '#', '*'}};\n\nint main (int argc, char const *argv[])\n{\n\tusing cpt = complex<double>;\n\tdouble escval = 4.0;\n\tvector<string> params(argv, argv + argc);\n\/\/\tcin >> noskipws;\n\ttry {\n\/\/\t\twindow<unsigned> p(0, 100, 0, 20);\n\t\tcpt ca(1,0.5);\n\/*\t\tcout << ca << endl;\n\t\tcout << ca * ca * ca << endl;\n\t\tcout << pow(ca,3) << endl;*\/\n\t\twindow<double> w;\/\/(-1.5,0,0.5,1);\n\t\tunsigned maxit = 100;\n\t\tunsigned rows = 100;\n\t\tunsigned lines = rows * 1.0\/2.0;\n\t\tdouble exp = 2.0;\n\t\tfor(unsigned it = 0; true; ++it) {\n\t\t\tif (it > 0) {\n\t\t\t\tcout << w << \" \" << maxit << \" esc:\" << escval << \" exp:\" << exp << \" zoom In, zoom Out, Left, Right, Up, Down, +iterate, -iterate, +Esc, -esc, +Wide, -wide, +Pow, -pow, Quit: \";\n\t\t\t\tstring cc;\n\t\t\t\tgetline(cin, cc);\n\t\t\t\tchar c;\n\t\t\t\tc = cc.at(0);\n\t\t\t\tcout << endl;\n\t\t\t\tswitch(c) {\n\t\t\t\t\tcase 'q' :\n\t\t\t\t\t\texit(0);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'l':\n\t\t\t\t\t\tw.move(-0.25, 0);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'r':\n\t\t\t\t\t\tw.move(0.25, 0);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'u':\n\t\t\t\t\t\tw.move(0,0.25);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'd':\n\t\t\t\t\t\tw.move(0,-0.25);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'i':\n\t\t\t\t\t\tw.zoom(0.5);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'o':\n\t\t\t\t\t\tw.zoom(-1);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase '+':\n\t\t\t\t\t\tmaxit *= 2.0;\n\t\t\t\t\t\tmaxit = min(1u<<16,maxit);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase '-':\n\t\t\t\t\t\tmaxit \/= 2.0;\n\t\t\t\t\t\tmaxit = max(1u,maxit);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'e':\n\t\t\t\t\t\tescval \/= 2.0;\n\t\t\t\t\t\tescval = max(1.0, escval);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'E':\n\t\t\t\t\t\tescval *= 2.0;\n\t\t\t\t\t\tescval = min(256.0, escval);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'W':\n\t\t\t\t\t\trows += rows * 0.25;\n\t\t\t\t\t\tw.zoom(-0.25, 0);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'w':\n\t\t\t\t\t\trows -= rows\/4.0;\n\t\t\t\t\t\tw.zoom(0.25, 0);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'P':\n\t\t\t\t\t\texp += 0.1;\n\t\t\t\t\t\texp = min(10.0, exp);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'p':\n\t\t\t\t\t\texp -= 0.1;\n\t\t\t\t\t\texp = max(0.1, exp);\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tdouble stepx = w.width() \/ static_cast<double>(rows);\n\t\t\tdouble stepy = w.height() \/ static_cast<double>(lines);\n\t\t\tcout << stepx << \", \" << stepy << endl;\n\t\t\t\/\/cout << endl;\n\t\t\tpxmap pm(maxit, rows, lines);\n\t\t\tauto pmit = pm.px_.begin();\n\t\t\tfor(unsigned iy = 0; iy < lines; ++iy) {\n\t\t\t\tdouble y = w.ymax_ - stepy * iy;\n\t\t\t\/\/for(double y = w.ymax_; y > w.ymin_; y -= stepy) {\n\t\t\t\tfor(unsigned ix = 0; ix < rows; ++ix) {\n\t\t\t\t\tdouble x = w.xmin_ + stepx * ix;\n\t\t\t\t\/\/for(double x = w.xmin_; x < w.xmax_; x += stepx) {\n\t\t\t\t\tunsigned i = 0;\n\t\t\t\t\t\/\/bool isin = true;\n\t\t\t\t\tcpt c(0,0);\n\t\t\t\t\tcpt cc(x,y);\n\t\t\t\t\tfor(; i < maxit; ++i) {\n\t\t\t\t\t\t\/\/c = c * c + cc;\n\t\t\t\t\t\tc = pow(c, exp) + cc;\n\t\t\t\t\t\tif (c.real() * c.real() + c.imag() * c.imag() > escval) {\n\t\t\t\t\t\t\t\/\/isin = false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t} \n\t\t\t\t\t}\n\t\t\t\t\t*pmit = i;\n\t\t\t\t\t++pmit;\n\t\t\t\t}\n\t\t\t\tcout << endl;\n\t\t\t}\n\/\/\t\t\tcout << \"********************\" << endl;\n\t\t\tpm.print();\n\t\t}\n\t} catch(...) {\n\t\tcerr << \"Unknown exception\" << endl;\n\t}\n\treturn 0;\n}<|endoftext|>"}
{"text":"<commit_before>\/\/==============================================================================\r\n\/\/ CellML annotation view CellML element details widget\r\n\/\/==============================================================================\r\n\r\n#include \"cellmlannotationviewcellmlelementdetailswidget.h\"\r\n#include \"cellmlannotationviewlistswidget.h\"\r\n#include \"cellmlannotationviewwidget.h\"\r\n#include \"treeview.h\"\r\n\r\n\/\/==============================================================================\r\n\r\n#include \"ui_cellmlannotationviewcellmlelementdetailswidget.h\"\r\n\r\n\/\/==============================================================================\r\n\r\n#include <QFormLayout>\r\n#include <QLabel>\r\n#include <QComboBox>\r\n#include <QStandardItemModel>\r\n#include <QScrollBar>\r\n\r\n\/\/==============================================================================\r\n\r\nnamespace OpenCOR {\r\nnamespace CellMLAnnotationView {\r\n\r\n\/\/==============================================================================\r\n\r\nCellmlAnnotationViewCellmlElementDetailsWidget::CellmlAnnotationViewCellmlElementDetailsWidget(CellmlAnnotationViewWidget *pParent) :\r\n    QScrollArea(pParent),\r\n    CommonWidget(pParent),\r\n    mParent(pParent),\r\n    mGui(new Ui::CellmlAnnotationViewCellmlElementDetailsWidget),\r\n    mItems(Items()),\r\n    mWidget(0),\r\n    mLayout(0),\r\n    mCmetaIdValue(0)\r\n{\r\n    \/\/ Set up the GUI\r\n\r\n    mGui->setupUi(this);\r\n\r\n    mWidget = new QWidget(this);\r\n    mLayout = new QFormLayout(mWidget);\r\n\r\n    mWidget->setLayout(mLayout);\r\n\r\n    setWidget(mWidget);\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nCellmlAnnotationViewCellmlElementDetailsWidget::~CellmlAnnotationViewCellmlElementDetailsWidget()\r\n{\r\n    \/\/ Delete the GUI\r\n\r\n    delete mGui;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nvoid CellmlAnnotationViewCellmlElementDetailsWidget::retranslateUi()\r\n{\r\n    \/\/ Retranslate our GUI\r\n\r\n    mGui->retranslateUi(this);\r\n\r\n    updateGui(mItems);\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nCellmlAnnotationViewCellmlElementDetailsWidget::Item CellmlAnnotationViewCellmlElementDetailsWidget::item(const Type &pType,\r\n                                                                                                          CellMLSupport::CellmlFileElement *pElement,\r\n                                                                                                          const int &pNumber)\r\n{\r\n    \/\/ Return a formatted Item 'object'\r\n\r\n    Item res;\r\n\r\n    res.type    = pType;\r\n    res.element = pElement;\r\n    res.number  = pNumber;\r\n\r\n    return res;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nvoid CellmlAnnotationViewCellmlElementDetailsWidget::updateGui(const Items &pItems)\r\n{\r\n    \/\/ Hide ourselves (to avoid any flickering during the updaate)\r\n\r\n    setVisible(false);\r\n\r\n    \/\/ Keep track of the items\r\n\r\n    mItems = pItems;\r\n\r\n    \/\/ Remove everything from our form layout\r\n\r\n    for (int i = 0, iMax = mLayout->count(); i < iMax; ++i) {\r\n        QLayoutItem *item = mLayout->takeAt(0);\r\n\r\n        delete item->widget();\r\n        delete item;\r\n    }\r\n\r\n    mCmetaIdValue = 0;\r\n\r\n    \/\/ Go through the different items which properties we want to add to the GUI\r\n\r\n    for (int i = 0, iLast = pItems.count()-1; i <= iLast; ++i) {\r\n        Item item = pItems.at(i);\r\n\r\n        \/\/ Determine which widget should be shown\/hidden\r\n\r\n        bool showName = false;\r\n        bool showXlinkHref = false;\r\n        bool showUnitReference = false;\r\n        bool showComponentReference = false;\r\n        bool showUnit = false;\r\n        bool showInitialValue = false;\r\n        bool showPublicInterface = false;\r\n        bool showPrivateInterface = false;\r\n        bool showRelationship = false;\r\n        bool showRelationshipNamespace = false;\r\n        bool showComponent = false;\r\n        bool showFirstComponent = false;\r\n        bool showSecondComponent = false;\r\n        bool showFirstVariable = false;\r\n        bool showSecondVariable = false;\r\n\r\n        switch (item.type) {\r\n        case Model:\r\n        case Unit:\r\n        case UnitElement:\r\n        case Component:\r\n        case Group:\r\n        case Connection:\r\n            showName = true;\r\n\r\n            break;\r\n        case Import:\r\n            showXlinkHref = true;\r\n\r\n            break;\r\n        case ImportUnit:\r\n            showName = true;\r\n            showUnitReference = true;\r\n\r\n            break;\r\n        case ImportComponent:\r\n            showName = true;\r\n            showComponentReference = true;\r\n\r\n            break;\r\n        case Variable:\r\n            showName = true;\r\n            showUnit = true;\r\n            showInitialValue = true;\r\n            showPublicInterface = true;\r\n            showPrivateInterface = true;\r\n\r\n            break;\r\n        case RelationshipReference:\r\n            showRelationship = true;\r\n            showRelationshipNamespace = true;\r\n\r\n            break;\r\n        case ComponentReference:\r\n            showComponent = true;\r\n\r\n            break;\r\n        case ComponentMapping:\r\n            showFirstComponent = true;\r\n            showSecondComponent = true;\r\n\r\n            break;\r\n        case VariableMapping:\r\n            showFirstVariable = true;\r\n            showSecondVariable = true;\r\n\r\n            break;\r\n        };\r\n\r\n        \/\/ Add whatever we need\r\n        \/\/ Note: as long as all of the widgets' parent is our widget, then they\r\n        \/\/       will get automatically deleted, so no need to delete them in\r\n        \/\/       ~CellmlAnnotationViewCellmlElementDetailsWidget()...\r\n\r\n        \/\/ Add a bold centered label as a header to let the user know what type\r\n        \/\/ of item we are talking about\r\n\r\n        QLabel *header = new QLabel(typeAsString(item.type), mWidget);\r\n\r\n        QFont headerFont = header->font();\r\n\r\n        headerFont.setBold(true);\r\n\r\n        header->setAlignment(Qt::AlignCenter);\r\n        header->setFont(headerFont);\r\n\r\n        mLayout->addRow(header);\r\n\r\n        \/\/ Show the item's cmeta:id, keeping in mind that we only want to allow\r\n        \/\/ the editing of the cmeta:id of the very first item\r\n\r\n        QString cmetaId = item.element->cmetaId();\r\n\r\n        if (i == iLast) {\r\n            \/\/ This is our 'main' current item, so we want to allow the user to\r\n            \/\/ edit its cmeta:id\r\n\r\n            mCmetaIdValue = new QComboBox(mWidget);\r\n\r\n            mCmetaIdValue->addItems(mParent->listsWidget()->metadataIds());\r\n\r\n            mCmetaIdValue->setEditable(true);\r\n            mCmetaIdValue->setEditText(cmetaId);\r\n\r\n            mLayout->addRow(new QLabel(tr(\"cmeta:id:\"), mWidget),\r\n                            mCmetaIdValue);\r\n\r\n            \/\/ Make our cmeta:id value the widget to tab to after our CellML\r\n            \/\/ tree view\r\n\r\n            setTabOrder(qobject_cast<QWidget *>(mParent->listsWidget()->cellmlTreeView()),\r\n                        mCmetaIdValue);\r\n        } else {\r\n            \/\/ Not our 'main' current item, so just display its cmeta:id\r\n\r\n            addRowToCellmlFormLayout(tr(\"cmeta:id:\"),\r\n                                     cmetaId.isEmpty()?\"\/\":cmetaId);\r\n        }\r\n\r\n        \/\/ Show the item's remaining properties\r\n\r\n        if (showName) {\r\n            \/\/ Retrieve the name of the CellML element\r\n            \/\/ Note: in the case of a group or a connection, there won't be a\r\n            \/\/       name, so we use the item's name, hoping one was provided...\r\n\r\n            QString name = ((item.type == Group) || (item.type == Connection))?\r\n                               (item.number == -1)?\r\n                                   \"\/\":\r\n                                   (item.type == Group)?\r\n                                       tr(\"Group #%1\").arg(item.number):\r\n                                       tr(\"Connection #%1\").arg(item.number):\r\n                               static_cast<CellMLSupport::CellmlFileNamedElement *>(item.element)->name();\r\n\r\n            addRowToCellmlFormLayout(tr(\"Name:\"), name);\r\n        }\r\n\r\n        if (showXlinkHref)\r\n            addRowToCellmlFormLayout(tr(\"xlink:href:\"),\r\n                                     static_cast<CellMLSupport::CellmlFileImport *>(item.element)->xlinkHref());\r\n\r\n        if (showUnitReference)\r\n            addRowToCellmlFormLayout(tr(\"Unit reference:\"),\r\n                                     static_cast<CellMLSupport::CellmlFileImportUnit *>(item.element)->unitReference());\r\n\r\n        if (showComponentReference)\r\n            addRowToCellmlFormLayout(tr(\"Component reference:\"),\r\n                                     static_cast<CellMLSupport::CellmlFileImportComponent *>(item.element)->componentReference());\r\n\r\n        if (showUnit)\r\n            addRowToCellmlFormLayout(tr(\"Unit:\"),\r\n                                     static_cast<CellMLSupport::CellmlFileVariable *>(item.element)->unit());\r\n\r\n        if (showInitialValue) {\r\n            QString initialValue = static_cast<CellMLSupport::CellmlFileVariable *>(item.element)->initialValue();\r\n\r\n            addRowToCellmlFormLayout(tr(\"Initial value:\"),\r\n                                     initialValue.isEmpty()?\"\/\":initialValue);\r\n        }\r\n\r\n        if (showPublicInterface)\r\n            addRowToCellmlFormLayout(tr(\"Public interface:\"),\r\n                                     static_cast<CellMLSupport::CellmlFileVariable *>(item.element)->publicInterfaceAsString());\r\n\r\n        if (showPrivateInterface)\r\n            addRowToCellmlFormLayout(tr(\"Private interface:\"),\r\n                                     static_cast<CellMLSupport::CellmlFileVariable *>(item.element)->privateInterfaceAsString());\r\n\r\n        if (showRelationship)\r\n            addRowToCellmlFormLayout(tr(\"Relationship:\"),\r\n                                     static_cast<CellMLSupport::CellmlFileRelationshipReference *>(item.element)->relationship());\r\n\r\n        if (showRelationshipNamespace) {\r\n            QString relationshipNamespace = static_cast<CellMLSupport::CellmlFileRelationshipReference *>(item.element)->relationshipNamespace();\r\n\r\n            addRowToCellmlFormLayout(tr(\"Relationship namespace:\"),\r\n                                     relationshipNamespace.isEmpty()?\"\/\":relationshipNamespace);\r\n        }\r\n\r\n        if (showComponent)\r\n            addRowToCellmlFormLayout(tr(\"Component:\"),\r\n                                     static_cast<CellMLSupport::CellmlFileComponentReference *>(item.element)->component());\r\n\r\n        if (showFirstComponent)\r\n            addRowToCellmlFormLayout(tr(\"First component:\"),\r\n                                     static_cast<CellMLSupport::CellmlFileMapComponents *>(item.element)->firstComponent());\r\n\r\n        if (showSecondComponent)\r\n            addRowToCellmlFormLayout(tr(\"Second component:\"),\r\n                                     static_cast<CellMLSupport::CellmlFileMapComponents *>(item.element)->secondComponent());\r\n\r\n        if (showFirstVariable)\r\n            addRowToCellmlFormLayout(tr(\"First variable:\"),\r\n                                     static_cast<CellMLSupport::CellmlFileMapVariablesItem *>(item.element)->firstVariable());\r\n\r\n        if (showSecondVariable)\r\n            addRowToCellmlFormLayout(tr(\"Second variable:\"),\r\n                                     static_cast<CellMLSupport::CellmlFileMapVariablesItem *>(item.element)->secondVariable());\r\n    }\r\n\r\n    \/\/ Re-show ourselves\r\n\r\n    setVisible(true);\r\n\r\n    \/\/ Scroll down to the bottom of ourselves, just in case things don't fit\r\n    \/\/ within the viewport\r\n    \/\/ Note: for this, we need to be up-to-date, hence we make a call to\r\n    \/\/       qApp->processEvents() and this can only be done when we are once\r\n    \/\/       again visible...\r\n\r\n    qApp->processEvents();\r\n\r\n    verticalScrollBar()->setValue(verticalScrollBar()->maximum());\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nvoid CellmlAnnotationViewCellmlElementDetailsWidget::addRowToCellmlFormLayout(const QString &pLabel,\r\n                                                                              const QString &pValue)\r\n{\r\n    \/\/ Add a row to our form layout\r\n\r\n    mLayout->addRow(new QLabel(pLabel, mWidget), new QLabel(pValue, mWidget));\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nQString CellmlAnnotationViewCellmlElementDetailsWidget::typeAsString(const Type &pType) const\r\n{\r\n    switch (pType) {\r\n    case Import:\r\n        return tr(\"Import\");\r\n    case ImportUnit:\r\n        return tr(\"Imported unit\");\r\n    case ImportComponent:\r\n        return tr(\"Imported component\");\r\n    case Unit:\r\n        return tr(\"Unit\");\r\n    case UnitElement:\r\n        return tr(\"Unit element\");\r\n    case Component:\r\n        return tr(\"Component\");\r\n    case Variable:\r\n        return tr(\"Variable\");\r\n    case Group:\r\n        return tr(\"Group\");\r\n    case RelationshipReference:\r\n        return tr(\"Relationshop reference\");\r\n    case ComponentReference:\r\n        return tr(\"Component reference\");\r\n    case Connection:\r\n        return tr(\"Connection\");\r\n    case ComponentMapping:\r\n        return tr(\"Component mapping\");\r\n    case VariableMapping:\r\n        return tr(\"Variable mapping\");\r\n    default:\r\n        \/\/ Model\r\n\r\n        return tr(\"Model\");\r\n    }\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nQComboBox * CellmlAnnotationViewCellmlElementDetailsWidget::cmetaIdValue() const\r\n{\r\n    \/\/ Return our cmeta:id value widget\r\n\r\n    return mCmetaIdValue;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\n}   \/\/ namespace CellMLAnnotationView\r\n}   \/\/ namespace OpenCOR\r\n\r\n\/\/==============================================================================\r\n\/\/ End of file\r\n\/\/==============================================================================\r\n<commit_msg>Minor improvement to our tab order strategy (#78).<commit_after>\/\/==============================================================================\r\n\/\/ CellML annotation view CellML element details widget\r\n\/\/==============================================================================\r\n\r\n#include \"cellmlannotationviewcellmlelementdetailswidget.h\"\r\n#include \"cellmlannotationviewlistswidget.h\"\r\n#include \"cellmlannotationviewwidget.h\"\r\n#include \"treeview.h\"\r\n\r\n\/\/==============================================================================\r\n\r\n#include \"ui_cellmlannotationviewcellmlelementdetailswidget.h\"\r\n\r\n\/\/==============================================================================\r\n\r\n#include <QFormLayout>\r\n#include <QLabel>\r\n#include <QComboBox>\r\n#include <QStandardItemModel>\r\n#include <QScrollBar>\r\n\r\n\/\/==============================================================================\r\n\r\nnamespace OpenCOR {\r\nnamespace CellMLAnnotationView {\r\n\r\n\/\/==============================================================================\r\n\r\nCellmlAnnotationViewCellmlElementDetailsWidget::CellmlAnnotationViewCellmlElementDetailsWidget(CellmlAnnotationViewWidget *pParent) :\r\n    QScrollArea(pParent),\r\n    CommonWidget(pParent),\r\n    mParent(pParent),\r\n    mGui(new Ui::CellmlAnnotationViewCellmlElementDetailsWidget),\r\n    mItems(Items()),\r\n    mWidget(0),\r\n    mLayout(0),\r\n    mCmetaIdValue(0)\r\n{\r\n    \/\/ Set up the GUI\r\n\r\n    mGui->setupUi(this);\r\n\r\n    mWidget = new QWidget(this);\r\n    mLayout = new QFormLayout(mWidget);\r\n\r\n    mWidget->setLayout(mLayout);\r\n\r\n    setWidget(mWidget);\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nCellmlAnnotationViewCellmlElementDetailsWidget::~CellmlAnnotationViewCellmlElementDetailsWidget()\r\n{\r\n    \/\/ Delete the GUI\r\n\r\n    delete mGui;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nvoid CellmlAnnotationViewCellmlElementDetailsWidget::retranslateUi()\r\n{\r\n    \/\/ Retranslate our GUI\r\n\r\n    mGui->retranslateUi(this);\r\n\r\n    updateGui(mItems);\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nCellmlAnnotationViewCellmlElementDetailsWidget::Item CellmlAnnotationViewCellmlElementDetailsWidget::item(const Type &pType,\r\n                                                                                                          CellMLSupport::CellmlFileElement *pElement,\r\n                                                                                                          const int &pNumber)\r\n{\r\n    \/\/ Return a formatted Item 'object'\r\n\r\n    Item res;\r\n\r\n    res.type    = pType;\r\n    res.element = pElement;\r\n    res.number  = pNumber;\r\n\r\n    return res;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nvoid CellmlAnnotationViewCellmlElementDetailsWidget::updateGui(const Items &pItems)\r\n{\r\n    \/\/ Hide ourselves (to avoid any flickering during the updaate)\r\n\r\n    setVisible(false);\r\n\r\n    \/\/ Keep track of the items\r\n\r\n    mItems = pItems;\r\n\r\n    \/\/ Remove everything from our form layout\r\n\r\n    for (int i = 0, iMax = mLayout->count(); i < iMax; ++i) {\r\n        QLayoutItem *item = mLayout->takeAt(0);\r\n\r\n        delete item->widget();\r\n        delete item;\r\n    }\r\n\r\n    mCmetaIdValue = 0;\r\n\r\n    \/\/ Go through the different items which properties we want to add to the GUI\r\n\r\n    for (int i = 0, iLast = pItems.count()-1; i <= iLast; ++i) {\r\n        Item item = pItems.at(i);\r\n\r\n        \/\/ Determine which widget should be shown\/hidden\r\n\r\n        bool showName = false;\r\n        bool showXlinkHref = false;\r\n        bool showUnitReference = false;\r\n        bool showComponentReference = false;\r\n        bool showUnit = false;\r\n        bool showInitialValue = false;\r\n        bool showPublicInterface = false;\r\n        bool showPrivateInterface = false;\r\n        bool showRelationship = false;\r\n        bool showRelationshipNamespace = false;\r\n        bool showComponent = false;\r\n        bool showFirstComponent = false;\r\n        bool showSecondComponent = false;\r\n        bool showFirstVariable = false;\r\n        bool showSecondVariable = false;\r\n\r\n        switch (item.type) {\r\n        case Model:\r\n        case Unit:\r\n        case UnitElement:\r\n        case Component:\r\n        case Group:\r\n        case Connection:\r\n            showName = true;\r\n\r\n            break;\r\n        case Import:\r\n            showXlinkHref = true;\r\n\r\n            break;\r\n        case ImportUnit:\r\n            showName = true;\r\n            showUnitReference = true;\r\n\r\n            break;\r\n        case ImportComponent:\r\n            showName = true;\r\n            showComponentReference = true;\r\n\r\n            break;\r\n        case Variable:\r\n            showName = true;\r\n            showUnit = true;\r\n            showInitialValue = true;\r\n            showPublicInterface = true;\r\n            showPrivateInterface = true;\r\n\r\n            break;\r\n        case RelationshipReference:\r\n            showRelationship = true;\r\n            showRelationshipNamespace = true;\r\n\r\n            break;\r\n        case ComponentReference:\r\n            showComponent = true;\r\n\r\n            break;\r\n        case ComponentMapping:\r\n            showFirstComponent = true;\r\n            showSecondComponent = true;\r\n\r\n            break;\r\n        case VariableMapping:\r\n            showFirstVariable = true;\r\n            showSecondVariable = true;\r\n\r\n            break;\r\n        };\r\n\r\n        \/\/ Add whatever we need\r\n        \/\/ Note: as long as all of the widgets' parent is our widget, then they\r\n        \/\/       will get automatically deleted, so no need to delete them in\r\n        \/\/       ~CellmlAnnotationViewCellmlElementDetailsWidget()...\r\n\r\n        \/\/ Add a bold centered label as a header to let the user know what type\r\n        \/\/ of item we are talking about\r\n\r\n        QLabel *header = new QLabel(typeAsString(item.type), mWidget);\r\n\r\n        QFont headerFont = header->font();\r\n\r\n        headerFont.setBold(true);\r\n\r\n        header->setAlignment(Qt::AlignCenter);\r\n        header->setFont(headerFont);\r\n\r\n        mLayout->addRow(header);\r\n\r\n        \/\/ Show the item's cmeta:id, keeping in mind that we only want to allow\r\n        \/\/ the editing of the cmeta:id of the very first item\r\n\r\n        QString cmetaId = item.element->cmetaId();\r\n\r\n        if (i == iLast) {\r\n            \/\/ This is our 'main' current item, so we want to allow the user to\r\n            \/\/ edit its cmeta:id\r\n\r\n            mCmetaIdValue = new QComboBox(mWidget);\r\n\r\n            mCmetaIdValue->addItems(mParent->listsWidget()->metadataIds());\r\n\r\n            mCmetaIdValue->setEditable(true);\r\n            mCmetaIdValue->setEditText(cmetaId);\r\n\r\n            mLayout->addRow(new QLabel(tr(\"cmeta:id:\"), mWidget),\r\n                            mCmetaIdValue);\r\n\r\n            \/\/ Make our cmeta:id value the widget to tab to after our CellML\r\n            \/\/ tree view\r\n\r\n            setTabOrder(qobject_cast<QWidget *>(mParent->listsWidget()->cellmlTreeView()),\r\n                        mCmetaIdValue);\r\n            setTabOrder(mCmetaIdValue,\r\n                        qobject_cast<QWidget *>(mParent->listsWidget()->metadataTreeView()));\r\n        } else {\r\n            \/\/ Not our 'main' current item, so just display its cmeta:id\r\n\r\n            addRowToCellmlFormLayout(tr(\"cmeta:id:\"),\r\n                                     cmetaId.isEmpty()?\"\/\":cmetaId);\r\n        }\r\n\r\n        \/\/ Show the item's remaining properties\r\n\r\n        if (showName) {\r\n            \/\/ Retrieve the name of the CellML element\r\n            \/\/ Note: in the case of a group or a connection, there won't be a\r\n            \/\/       name, so we use the item's name, hoping one was provided...\r\n\r\n            QString name = ((item.type == Group) || (item.type == Connection))?\r\n                               (item.number == -1)?\r\n                                   \"\/\":\r\n                                   (item.type == Group)?\r\n                                       tr(\"Group #%1\").arg(item.number):\r\n                                       tr(\"Connection #%1\").arg(item.number):\r\n                               static_cast<CellMLSupport::CellmlFileNamedElement *>(item.element)->name();\r\n\r\n            addRowToCellmlFormLayout(tr(\"Name:\"), name);\r\n        }\r\n\r\n        if (showXlinkHref)\r\n            addRowToCellmlFormLayout(tr(\"xlink:href:\"),\r\n                                     static_cast<CellMLSupport::CellmlFileImport *>(item.element)->xlinkHref());\r\n\r\n        if (showUnitReference)\r\n            addRowToCellmlFormLayout(tr(\"Unit reference:\"),\r\n                                     static_cast<CellMLSupport::CellmlFileImportUnit *>(item.element)->unitReference());\r\n\r\n        if (showComponentReference)\r\n            addRowToCellmlFormLayout(tr(\"Component reference:\"),\r\n                                     static_cast<CellMLSupport::CellmlFileImportComponent *>(item.element)->componentReference());\r\n\r\n        if (showUnit)\r\n            addRowToCellmlFormLayout(tr(\"Unit:\"),\r\n                                     static_cast<CellMLSupport::CellmlFileVariable *>(item.element)->unit());\r\n\r\n        if (showInitialValue) {\r\n            QString initialValue = static_cast<CellMLSupport::CellmlFileVariable *>(item.element)->initialValue();\r\n\r\n            addRowToCellmlFormLayout(tr(\"Initial value:\"),\r\n                                     initialValue.isEmpty()?\"\/\":initialValue);\r\n        }\r\n\r\n        if (showPublicInterface)\r\n            addRowToCellmlFormLayout(tr(\"Public interface:\"),\r\n                                     static_cast<CellMLSupport::CellmlFileVariable *>(item.element)->publicInterfaceAsString());\r\n\r\n        if (showPrivateInterface)\r\n            addRowToCellmlFormLayout(tr(\"Private interface:\"),\r\n                                     static_cast<CellMLSupport::CellmlFileVariable *>(item.element)->privateInterfaceAsString());\r\n\r\n        if (showRelationship)\r\n            addRowToCellmlFormLayout(tr(\"Relationship:\"),\r\n                                     static_cast<CellMLSupport::CellmlFileRelationshipReference *>(item.element)->relationship());\r\n\r\n        if (showRelationshipNamespace) {\r\n            QString relationshipNamespace = static_cast<CellMLSupport::CellmlFileRelationshipReference *>(item.element)->relationshipNamespace();\r\n\r\n            addRowToCellmlFormLayout(tr(\"Relationship namespace:\"),\r\n                                     relationshipNamespace.isEmpty()?\"\/\":relationshipNamespace);\r\n        }\r\n\r\n        if (showComponent)\r\n            addRowToCellmlFormLayout(tr(\"Component:\"),\r\n                                     static_cast<CellMLSupport::CellmlFileComponentReference *>(item.element)->component());\r\n\r\n        if (showFirstComponent)\r\n            addRowToCellmlFormLayout(tr(\"First component:\"),\r\n                                     static_cast<CellMLSupport::CellmlFileMapComponents *>(item.element)->firstComponent());\r\n\r\n        if (showSecondComponent)\r\n            addRowToCellmlFormLayout(tr(\"Second component:\"),\r\n                                     static_cast<CellMLSupport::CellmlFileMapComponents *>(item.element)->secondComponent());\r\n\r\n        if (showFirstVariable)\r\n            addRowToCellmlFormLayout(tr(\"First variable:\"),\r\n                                     static_cast<CellMLSupport::CellmlFileMapVariablesItem *>(item.element)->firstVariable());\r\n\r\n        if (showSecondVariable)\r\n            addRowToCellmlFormLayout(tr(\"Second variable:\"),\r\n                                     static_cast<CellMLSupport::CellmlFileMapVariablesItem *>(item.element)->secondVariable());\r\n    }\r\n\r\n    \/\/ Re-show ourselves\r\n\r\n    setVisible(true);\r\n\r\n    \/\/ Scroll down to the bottom of ourselves, just in case things don't fit\r\n    \/\/ within the viewport\r\n    \/\/ Note: for this, we need to be up-to-date, hence we make a call to\r\n    \/\/       qApp->processEvents() and this can only be done when we are once\r\n    \/\/       again visible...\r\n\r\n    qApp->processEvents();\r\n\r\n    verticalScrollBar()->setValue(verticalScrollBar()->maximum());\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nvoid CellmlAnnotationViewCellmlElementDetailsWidget::addRowToCellmlFormLayout(const QString &pLabel,\r\n                                                                              const QString &pValue)\r\n{\r\n    \/\/ Add a row to our form layout\r\n\r\n    mLayout->addRow(new QLabel(pLabel, mWidget), new QLabel(pValue, mWidget));\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nQString CellmlAnnotationViewCellmlElementDetailsWidget::typeAsString(const Type &pType) const\r\n{\r\n    switch (pType) {\r\n    case Import:\r\n        return tr(\"Import\");\r\n    case ImportUnit:\r\n        return tr(\"Imported unit\");\r\n    case ImportComponent:\r\n        return tr(\"Imported component\");\r\n    case Unit:\r\n        return tr(\"Unit\");\r\n    case UnitElement:\r\n        return tr(\"Unit element\");\r\n    case Component:\r\n        return tr(\"Component\");\r\n    case Variable:\r\n        return tr(\"Variable\");\r\n    case Group:\r\n        return tr(\"Group\");\r\n    case RelationshipReference:\r\n        return tr(\"Relationshop reference\");\r\n    case ComponentReference:\r\n        return tr(\"Component reference\");\r\n    case Connection:\r\n        return tr(\"Connection\");\r\n    case ComponentMapping:\r\n        return tr(\"Component mapping\");\r\n    case VariableMapping:\r\n        return tr(\"Variable mapping\");\r\n    default:\r\n        \/\/ Model\r\n\r\n        return tr(\"Model\");\r\n    }\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\nQComboBox * CellmlAnnotationViewCellmlElementDetailsWidget::cmetaIdValue() const\r\n{\r\n    \/\/ Return our cmeta:id value widget\r\n\r\n    return mCmetaIdValue;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\n}   \/\/ namespace CellMLAnnotationView\r\n}   \/\/ namespace OpenCOR\r\n\r\n\/\/==============================================================================\r\n\/\/ End of file\r\n\/\/==============================================================================\r\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\r\n#include <algorithm>\r\n#include <chrono>\r\n#include <random>\r\n#include <string>\r\n#include <type_traits>\r\n\r\ntemplate<typename T>\r\ninline T gcd(T a, T b) {\r\n\twhile (b != 0) {\r\n\t\ta %= b;\r\n\t\tstd::swap(a, b);\r\n\t}\r\n\treturn a;\r\n}\r\n\r\ntemplate<typename T>\r\ninline T lcm(const T& a, const T& b) {\r\n\treturn a \/ gcd(a, b) * b;\r\n}\r\n\r\ntemplate<typename T>\r\nconstexpr inline T sqr(const T& x) {\r\n\treturn x * x;\r\n}\r\n\r\ntemplate<class T> inline bool isPrime(const T& n)\r\n\/\/ Straightforward checking in O(sqrt(N))\r\n{\r\n\tif (n < 2) {\r\n\t\treturn false;\r\n\t}\r\n\tT kk = (T)sqrt(n + 0.);\r\n\tfor (T i = 2; i <= kk; ++i) {\r\n\t\tif (!(n % i)) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t}\r\n\treturn true;\r\n}\r\n\r\ninline void eratosthenes_sieve(std::vector<bool>& prime) {\r\n\tif (prime.size() < 2) {\r\n\t\tprime.assign(prime.size(), false);\r\n\t\treturn;\r\n\t}\r\n\tprime.assign(prime.size(), true);\r\n\tprime[0] = prime[1] = false;\r\n\tfor (size_t i = 4; i < prime.size(); i += 2) {\r\n\t\tprime[i] = false;\r\n\t}\r\n\tfor (size_t i = 3; i * i < prime.size(); i += 2) {\r\n\t\tif (prime[i]) {\r\n\t\t\tconst size_t delta = i << 1;\r\n\t\t\tfor (size_t j = i * i; j < prime.size(); j += delta) {\r\n\t\t\t\tprime[j] = false;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\n\r\ninline void primesVector(bool prime[], const int n, int primes[], int& primesCnt) {\r\n\tif (n < 2) {\r\n\t\tprimesCnt = 0;\r\n\t\treturn;\r\n\t}\r\n\tprimesCnt = 1;\r\n\tprimes[0] = 2;\r\n\tfor (int i = 3; i < n; i += 2) {\r\n\t\tif (prime[i]) {\r\n\t\t\tprimes[primesCnt++] = i;\r\n\t\t}\r\n\t}\r\n}\r\n\r\ntemplate<class T>\r\nT factorial(T n, const T& mod = 1000000007) {\r\n\tlong long ret = 1;\r\n\tfor (int i = 2; i <= n; ++i) {\r\n\t\tret = (ret * i) % mod;\r\n\t}\r\n\treturn ret % mod;\r\n}\r\n\r\ntemplate<typename T, typename U>\r\ninline T binpow(T a, U b) {\r\n\tstatic_assert(std::is_integral<U>::value, \"Degree must be integral. For real degree use pow.\");\r\n\tT ret = 1;\r\n\twhile (b != 0) {\r\n\t\tif ((b & 1) != 0) {\r\n\t\t\tret *= a;\r\n\t\t}\r\n\t\ta *= a;\r\n\t\tb >>= 1;\r\n\t}\r\n\treturn ret;\r\n}\r\n\r\ntemplate<typename T, typename U, typename Q>\r\ninline T binpow(T a, U b, Q mod) {\r\n\tstatic_assert(std::is_integral<U>::value, \"Degree must be integral. For real degree use pow.\");\r\n\tlong long ret = 1;\r\n\ta %= mod;\r\n\twhile (b != 0) {\r\n\t\tif ((b & 1) != 0) {\r\n\t\t\tret = ret * a % mod;\r\n\t\t}\r\n\t\ta = a * a % mod;\r\n\t\tb >>= 1;\r\n\t}\r\n\treturn ret % mod;\r\n}\r\n\r\ntemplate<class T>\r\nint digitSum(T n) {\r\n\tint res = 0;\r\n\tn = abs(n);\r\n\twhile (n) {\r\n\t\tres += n % 10;\r\n\t\tn \/= 10;\r\n\t}\r\n\treturn res;\r\n}\r\n\r\ntemplate<class T>\r\nint digitCount(T n) {\r\n\tint res = 0;\r\n\tn = abs(n);\r\n\twhile (n) {\r\n\t\t++res;\r\n\t\tn \/= 10;\r\n\t}\r\n\treturn res;\r\n}\r\n\r\ntemplate<class T> T eulerFunction(T n) {\r\n\tT res = n;\r\n\tfor (T i = 2; i * i <= n; ++i) {\r\n\t\tif (!(n % i)) {\r\n\t\t\twhile (!(n % i)) {\r\n\t\t\t\tn \/= i;\r\n\t\t\t}\r\n\t\t\tres -= res \/ i;\r\n\t\t}\r\n\t}\r\n\tif (n > 1) {\r\n\t\tres -= res \/ n;\r\n\t}\r\n\treturn res;\r\n}\r\n\r\ntemplate<typename T, typename U>\r\nT inverseElement(const T n, const U mod)\r\n\/\/ inverse element for prime mod\r\n{\r\n\treturn binpow(static_cast<long long>(n), mod - 2, mod);\r\n}\r\n\r\ninline void inverseElementForSegment(int r[], const int mod)\r\n\/\/ inverse element for prime mod for numbers [1; mod - 1]\r\n{\r\n\tr[1] = 1;\r\n\tfor (int i = 2; i < mod; ++i) {\r\n\t\tr[i] = (mod - mod \/ i * r[mod % i] % mod) % mod;\r\n\t}\r\n}\r\n\r\ntemplate<class T> T inverseElementCompMod(const T n, const T mod)\r\n\/\/ inverse element for composite mod using formula inv(n) = n^(phi(mod) - 1)\r\n{\r\n\treturn binpow(n, eulerFunction(mod) - 1, mod);\r\n}\r\n\r\ntemplate<class T, size_t N> void binomialCoefficients(T (&c)[N][N]) {\r\n\tfor (int i = 0; i < N; ++i) {\r\n\t\tc[i][0] = c[i][i] = 1;\r\n\t\tfor (int j = 1; j < i; ++j) {\r\n\t\t\tc[i][j] = c[i - 1][j - 1] + c[i - 1][j];\r\n\t\t}\r\n\t}\r\n}\r\n\r\ntemplate<class T, size_t N> void binomialCoefficients(T (&c)[N][N], const T mod) {\r\n\tfor (int i = 0; i < N; ++i) {\r\n\t\tc[i][0] = c[i][i] = 1;\r\n\t\tfor (int j = 1; j < i; ++j) {\r\n\t\t\tc[i][j] = c[i - 1][j - 1];\r\n\t\t\tadd_mod(c[i][j], c[i - 1][j], mod);\r\n\t\t}\r\n\t\tfor (int j = i + 1; j < N; ++j) {\r\n\t\t\tc[i][j] = 0;\r\n\t\t}\r\n\t}\r\n}\r\n\r\ntemplate<class T> std::string toRoman(T n) {\r\n\tconst int ValsCount = 13;\r\n\tconst int Vals[] = { 1, 4, 5, 9, 10, 40, 50, 90, 100, 400, 500, 900, 1000 };\r\n\tconst char * Digits[] = { \"I\", \"IV\", \"V\", \"IX\", \"X\", \"XL\", \"L\", \"XC\", \"C\", \"CD\", \"D\", \"CM\", \"M\" };\r\n\tstd::string res = \"\";\r\n\tint x = ValsCount - 1;\r\n\twhile (n) {\r\n\t\twhile (Vals[x] > n) {\r\n\t\t\t--x;\r\n\t\t}\r\n\t\tn -= Vals[x];\r\n\t\tres += Digits[x];\r\n\t}\r\n\treturn res;\r\n}\r\n\r\nvoid calcPowers(long long deg[], long long base, int n) {\r\n\tdeg[0] = 1;\r\n\tfor (int i = 1; i <= n; ++i) {\r\n\t\tdeg[i] = deg[i - 1] * base;\r\n\t}\r\n}\r\n\r\ntemplate<class T> void calcPowers(T deg[], T base, int n, T MOD) {\r\n\tdeg[0] = 1 % MOD;\r\n\tfor (int i = 1; i <= n; ++i) {\r\n\t\tdeg[i] = (long long)deg[i - 1] * base % MOD;\r\n\t}\r\n}\r\n\r\ninline uint32_t abs(const uint32_t x) {\r\n\treturn x;\r\n}\r\n\r\ninline uint64_t abs(const uint64_t x) {\r\n\treturn x;\r\n}\r\n\r\ntemplate<typename T>\r\ninline bool is_leap_year(const T year) {\r\n\treturn year % 400 == 0 || (year % 100 != 0 && (year & 3) == 0);\r\n}\r\n\r\nnamespace Random {\r\n\r\n\tstatic std::chrono::system_clock::rep GetRandSeed() {\r\n\t\treturn std::chrono::system_clock::now().time_since_epoch().count();\r\n\t}\r\n\r\n\tstatic std::mt19937_64 gen(GetRandSeed());\r\n\tstatic std::uniform_int_distribution<long long> distrib(0, std::numeric_limits<long long>::max());\r\n\r\n\ttemplate<typename T>\r\n\tstatic T get(T r) {\r\n\t\treturn distrib(gen) % r;\r\n\t}\r\n\r\n\ttemplate<typename T>\r\n\tstatic T get(T l, T r) {\r\n\t\treturn get(r - l + 1) + l;\r\n\t}\r\n\r\n};\r\n<commit_msg>Refactored inverseElementForSegment method.<commit_after>#pragma once\r\n#include <algorithm>\r\n#include <chrono>\r\n#include <random>\r\n#include <string>\r\n#include <type_traits>\r\n\r\ntemplate<typename T>\r\ninline T gcd(T a, T b) {\r\n\twhile (b != 0) {\r\n\t\ta %= b;\r\n\t\tstd::swap(a, b);\r\n\t}\r\n\treturn a;\r\n}\r\n\r\ntemplate<typename T>\r\ninline T lcm(const T& a, const T& b) {\r\n\treturn a \/ gcd(a, b) * b;\r\n}\r\n\r\ntemplate<typename T>\r\nconstexpr inline T sqr(const T& x) {\r\n\treturn x * x;\r\n}\r\n\r\ntemplate<class T> inline bool isPrime(const T& n)\r\n\/\/ Straightforward checking in O(sqrt(N))\r\n{\r\n\tif (n < 2) {\r\n\t\treturn false;\r\n\t}\r\n\tT kk = (T)sqrt(n + 0.);\r\n\tfor (T i = 2; i <= kk; ++i) {\r\n\t\tif (!(n % i)) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t}\r\n\treturn true;\r\n}\r\n\r\ninline void eratosthenes_sieve(std::vector<bool>& prime) {\r\n\tif (prime.size() < 2) {\r\n\t\tprime.assign(prime.size(), false);\r\n\t\treturn;\r\n\t}\r\n\tprime.assign(prime.size(), true);\r\n\tprime[0] = prime[1] = false;\r\n\tfor (size_t i = 4; i < prime.size(); i += 2) {\r\n\t\tprime[i] = false;\r\n\t}\r\n\tfor (size_t i = 3; i * i < prime.size(); i += 2) {\r\n\t\tif (prime[i]) {\r\n\t\t\tconst size_t delta = i << 1;\r\n\t\t\tfor (size_t j = i * i; j < prime.size(); j += delta) {\r\n\t\t\t\tprime[j] = false;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\n\r\ninline void primesVector(bool prime[], const int n, int primes[], int& primesCnt) {\r\n\tif (n < 2) {\r\n\t\tprimesCnt = 0;\r\n\t\treturn;\r\n\t}\r\n\tprimesCnt = 1;\r\n\tprimes[0] = 2;\r\n\tfor (int i = 3; i < n; i += 2) {\r\n\t\tif (prime[i]) {\r\n\t\t\tprimes[primesCnt++] = i;\r\n\t\t}\r\n\t}\r\n}\r\n\r\ntemplate<class T>\r\nT factorial(T n, const T& mod = 1000000007) {\r\n\tlong long ret = 1;\r\n\tfor (int i = 2; i <= n; ++i) {\r\n\t\tret = (ret * i) % mod;\r\n\t}\r\n\treturn ret % mod;\r\n}\r\n\r\ntemplate<typename T, typename U>\r\ninline T binpow(T a, U b) {\r\n\tstatic_assert(std::is_integral<U>::value, \"Degree must be integral. For real degree use pow.\");\r\n\tT ret = 1;\r\n\twhile (b != 0) {\r\n\t\tif ((b & 1) != 0) {\r\n\t\t\tret *= a;\r\n\t\t}\r\n\t\ta *= a;\r\n\t\tb >>= 1;\r\n\t}\r\n\treturn ret;\r\n}\r\n\r\ntemplate<typename T, typename U, typename Q>\r\ninline T binpow(T a, U b, Q mod) {\r\n\tstatic_assert(std::is_integral<U>::value, \"Degree must be integral. For real degree use pow.\");\r\n\tlong long ret = 1;\r\n\ta %= mod;\r\n\twhile (b != 0) {\r\n\t\tif ((b & 1) != 0) {\r\n\t\t\tret = ret * a % mod;\r\n\t\t}\r\n\t\ta = a * a % mod;\r\n\t\tb >>= 1;\r\n\t}\r\n\treturn ret % mod;\r\n}\r\n\r\ntemplate<class T>\r\nint digitSum(T n) {\r\n\tint res = 0;\r\n\tn = abs(n);\r\n\twhile (n) {\r\n\t\tres += n % 10;\r\n\t\tn \/= 10;\r\n\t}\r\n\treturn res;\r\n}\r\n\r\ntemplate<class T>\r\nint digitCount(T n) {\r\n\tint res = 0;\r\n\tn = abs(n);\r\n\twhile (n) {\r\n\t\t++res;\r\n\t\tn \/= 10;\r\n\t}\r\n\treturn res;\r\n}\r\n\r\ntemplate<class T> T eulerFunction(T n) {\r\n\tT res = n;\r\n\tfor (T i = 2; i * i <= n; ++i) {\r\n\t\tif (!(n % i)) {\r\n\t\t\twhile (!(n % i)) {\r\n\t\t\t\tn \/= i;\r\n\t\t\t}\r\n\t\t\tres -= res \/ i;\r\n\t\t}\r\n\t}\r\n\tif (n > 1) {\r\n\t\tres -= res \/ n;\r\n\t}\r\n\treturn res;\r\n}\r\n\r\ntemplate<typename T, typename U>\r\nT inverseElement(const T n, const U mod)\r\n\/\/ inverse element for prime mod\r\n{\r\n\treturn binpow(static_cast<long long>(n), mod - 2, mod);\r\n}\r\n\r\ninline void inverseElementForSegment(int r[], const int n, const int mod)\r\n\/\/ inverse element for prime mod for numbers [1; mod - 1]\r\n{\r\n\tr[1] = 1;\r\n\tfor (int i = 2; i < n; ++i) {\r\n\t\tr[i] = (mod - static_cast<long long>(mod) \/ i * r[mod % i] % mod) % mod;\r\n\t}\r\n}\r\n\r\ntemplate<class T> T inverseElementCompMod(const T n, const T mod)\r\n\/\/ inverse element for composite mod using formula inv(n) = n^(phi(mod) - 1)\r\n{\r\n\treturn binpow(n, eulerFunction(mod) - 1, mod);\r\n}\r\n\r\ntemplate<class T, size_t N> void binomialCoefficients(T (&c)[N][N]) {\r\n\tfor (int i = 0; i < N; ++i) {\r\n\t\tc[i][0] = c[i][i] = 1;\r\n\t\tfor (int j = 1; j < i; ++j) {\r\n\t\t\tc[i][j] = c[i - 1][j - 1] + c[i - 1][j];\r\n\t\t}\r\n\t}\r\n}\r\n\r\ntemplate<class T, size_t N> void binomialCoefficients(T (&c)[N][N], const T mod) {\r\n\tfor (int i = 0; i < N; ++i) {\r\n\t\tc[i][0] = c[i][i] = 1;\r\n\t\tfor (int j = 1; j < i; ++j) {\r\n\t\t\tc[i][j] = c[i - 1][j - 1];\r\n\t\t\tadd_mod(c[i][j], c[i - 1][j], mod);\r\n\t\t}\r\n\t\tfor (int j = i + 1; j < N; ++j) {\r\n\t\t\tc[i][j] = 0;\r\n\t\t}\r\n\t}\r\n}\r\n\r\ntemplate<class T> std::string toRoman(T n) {\r\n\tconst int ValsCount = 13;\r\n\tconst int Vals[] = { 1, 4, 5, 9, 10, 40, 50, 90, 100, 400, 500, 900, 1000 };\r\n\tconst char * Digits[] = { \"I\", \"IV\", \"V\", \"IX\", \"X\", \"XL\", \"L\", \"XC\", \"C\", \"CD\", \"D\", \"CM\", \"M\" };\r\n\tstd::string res = \"\";\r\n\tint x = ValsCount - 1;\r\n\twhile (n) {\r\n\t\twhile (Vals[x] > n) {\r\n\t\t\t--x;\r\n\t\t}\r\n\t\tn -= Vals[x];\r\n\t\tres += Digits[x];\r\n\t}\r\n\treturn res;\r\n}\r\n\r\nvoid calcPowers(long long deg[], long long base, int n) {\r\n\tdeg[0] = 1;\r\n\tfor (int i = 1; i <= n; ++i) {\r\n\t\tdeg[i] = deg[i - 1] * base;\r\n\t}\r\n}\r\n\r\ntemplate<class T> void calcPowers(T deg[], T base, int n, T MOD) {\r\n\tdeg[0] = 1 % MOD;\r\n\tfor (int i = 1; i <= n; ++i) {\r\n\t\tdeg[i] = (long long)deg[i - 1] * base % MOD;\r\n\t}\r\n}\r\n\r\ninline uint32_t abs(const uint32_t x) {\r\n\treturn x;\r\n}\r\n\r\ninline uint64_t abs(const uint64_t x) {\r\n\treturn x;\r\n}\r\n\r\ntemplate<typename T>\r\ninline bool is_leap_year(const T year) {\r\n\treturn year % 400 == 0 || (year % 100 != 0 && (year & 3) == 0);\r\n}\r\n\r\nnamespace Random {\r\n\r\n\tstatic std::chrono::system_clock::rep GetRandSeed() {\r\n\t\treturn std::chrono::system_clock::now().time_since_epoch().count();\r\n\t}\r\n\r\n\tstatic std::mt19937_64 gen(GetRandSeed());\r\n\tstatic std::uniform_int_distribution<long long> distrib(0, std::numeric_limits<long long>::max());\r\n\r\n\ttemplate<typename T>\r\n\tstatic T get(T r) {\r\n\t\treturn distrib(gen) % r;\r\n\t}\r\n\r\n\ttemplate<typename T>\r\n\tstatic T get(T l, T r) {\r\n\t\treturn get(r - l + 1) + l;\r\n\t}\r\n\r\n};\r\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\n#define NEED_CPU_REG_SHORTCUTS 1\n#include \"bochs.h\"\n#define LOG_THIS BX_CPU_THIS_PTR\n\n\nvoid BX_CPU_C::SAHF(bxInstruction_c *i)\n{\n  set_SF((AH & 0x80) >> 7);\n  set_ZF((AH & 0x40) >> 6);\n  set_AF((AH & 0x10) >> 4);\n  set_CF(AH & 0x01);\n  set_PF((AH & 0x04) >> 2);\n}\n\nvoid BX_CPU_C::LAHF(bxInstruction_c *i)\n{\n  AH = (get_SF() ? 0x80 : 0) |\n       (get_ZF() ? 0x40 : 0) |\n       (get_AF() ? 0x10 : 0) |\n       (get_PF() ? 0x04 : 0) |\n       (0x02) |\n       (get_CF() ? 0x01 : 0);\n}\n\nvoid BX_CPU_C::CLC(bxInstruction_c *i)\n{\n  set_CF(0);\n}\n\nvoid BX_CPU_C::STC(bxInstruction_c *i)\n{\n  set_CF(1);\n}\n\nvoid BX_CPU_C::CLI(bxInstruction_c *i)\n{\n  Bit32u IOPL = BX_CPU_THIS_PTR get_IOPL();\n  Bit32u  cpl = CPL;\n\n#if BX_CPU_LEVEL >= 2\n  if (protected_mode())\n  {\n    if (BX_CPU_THIS_PTR cr4.get_PVI() && (cpl == 3))\n    {\n      if (IOPL < 3) {\n        BX_CPU_THIS_PTR clear_VIF();\n        return;\n      }\n    }\n    else {\n      if (IOPL < cpl) {\n        exception(BX_GP_EXCEPTION, 0, 0);\n        return;\n      }\n    }\n  }\n#if BX_CPU_LEVEL >= 3\n  else if (v8086_mode())\n  {\n    if (IOPL != 3) {\n      if (BX_CPU_THIS_PTR cr4.get_VME())\n      {\n        BX_CPU_THIS_PTR clear_VIF();\n        return;\n      }\n\n      exception(BX_GP_EXCEPTION, 0, 0);\n      return;\n    }\n  }\n#endif\n#endif\n\n  BX_CPU_THIS_PTR clear_IF ();\n}\n\nvoid BX_CPU_C::STI(bxInstruction_c *i)\n{\n  Bit32u IOPL = BX_CPU_THIS_PTR get_IOPL();\n  Bit32u  cpl = CPL;\n\n#if BX_CPU_LEVEL >= 2\n  if (protected_mode())\n  {\n    if (BX_CPU_THIS_PTR cr4.get_PVI())\n    {\n      if (cpl == 3) {\n        if (IOPL < 3) \n        {\n          if (! BX_CPU_THIS_PTR get_VIP ())\n          {\n            BX_CPU_THIS_PTR assert_VIF();\n            return;\n          }\n\n          exception(BX_GP_EXCEPTION, 0, 0);\n          return;\n        }\n      }\n    }\n\n    if (cpl > IOPL) {\n      exception(BX_GP_EXCEPTION, 0, 0);\n      return;\n    }\n  }\n#if BX_CPU_LEVEL >= 3\n  else if (v8086_mode())\n  {\n    if (IOPL != 3) {\n      if (! BX_CPU_THIS_PTR get_VIP () && BX_CPU_THIS_PTR cr4.get_VME())\n      {\n        BX_CPU_THIS_PTR assert_VIF();\n        return;\n      }\n\n      exception(BX_GP_EXCEPTION, 0, 0);\n      return;\n    }\n  }\n#endif\n#endif\n\n  if (!BX_CPU_THIS_PTR get_IF ()) {\n    BX_CPU_THIS_PTR assert_IF ();\n    BX_CPU_THIS_PTR inhibit_mask |= BX_INHIBIT_INTERRUPTS;\n    BX_CPU_THIS_PTR async_event = 1;\n  }\n}\n\nvoid BX_CPU_C::CLD(bxInstruction_c *i)\n{\n  BX_CPU_THIS_PTR clear_DF ();\n}\n\nvoid BX_CPU_C::STD(bxInstruction_c *i)\n{\n  BX_CPU_THIS_PTR assert_DF ();\n}\n\nvoid BX_CPU_C::CMC(bxInstruction_c *i)\n{\n  set_CF( !get_CF() );\n}\n\nvoid BX_CPU_C::PUSHF_Fv(bxInstruction_c *i)\n{\n  if (v8086_mode() && (BX_CPU_THIS_PTR get_IOPL ()<3)) {\n    exception(BX_GP_EXCEPTION, 0, 0);\n    return;\n  }\n\n#if BX_CPU_LEVEL >= 3\n#if BX_SUPPORT_X86_64\n  if (BX_CPU_THIS_PTR cpu_mode == BX_MODE_LONG_64) {\n    if (i->os32L()) {\n      push_64(read_eflags() & 0x00fcffff);\n    }\n    else\n    {\n      Bit16u flags16 = read_flags();\n      write_virtual_word(BX_SEG_REG_SS, RSP-2, &flags16);\n      RSP -= 2;\n    }\n  }\n  else\n#endif\n  if (i->os32L()) {\n    push_32(read_eflags() & 0x00fcffff);\n  }\n  else\n#endif\n  {\n    push_16(read_flags());\n  }\n}\n\nvoid BX_CPU_C::POPF_Fv(bxInstruction_c *i)\n{\n  Bit32u changeMask = 0x004dd5;\n  Bit32u flags32;\n\n#if BX_CPU_LEVEL >= 3\n  if (protected_mode()) {\n#if BX_SUPPORT_X86_64\n    if (BX_CPU_THIS_PTR cpu_mode == BX_MODE_LONG_64) {\n      Bit64u flags64;\n\n      if (i->os32L()) {\n        pop_64(&flags64);\n        flags32 = flags64;\n        changeMask |= 0x240000; \/\/ ID,AC\n        if (CPL==0)\n          changeMask |= (3<<12); \/\/ IOPL\n        if (CPL <= BX_CPU_THIS_PTR get_IOPL())\n          changeMask |= (1<<9); \/\/ IF\n      }\n      else\n      {\n        Bit16u flags16;\n\n        read_virtual_word(BX_SEG_REG_SS, RSP, &flags16);\n\n        RSP += 2;\n        flags32 = flags16;\n        if (CPL==0)\n          changeMask |= (3<<12); \/\/ IOPL\n        if (CPL <= BX_CPU_THIS_PTR get_IOPL())\n          changeMask |= (1<<9); \/\/ IF\n      }\n    }\n    else\n#endif  \/\/ #if BX_SUPPORT_X86_64\n    if (i->os32L()) {\n      pop_32(&flags32);\n      changeMask |= 0x240000; \/\/ ID,AC\n      if (CPL==0)\n        changeMask |= (3<<12); \/\/ IOPL\n      if (CPL <= BX_CPU_THIS_PTR get_IOPL())\n        changeMask |= (1<<9); \/\/ IF\n    }\n    else\n#endif  \/\/ BX_CPU_LEVEL >= 3\n    {\n      Bit16u flags16;\n      pop_16(&flags16);\n      flags32 = flags16;\n      if (CPL==0)\n        changeMask |= (3<<12); \/\/ IOPL\n      if (CPL <= BX_CPU_THIS_PTR get_IOPL())\n        changeMask |= (1<<9); \/\/ IF\n    }\n\n    \/\/ Protected-mode: VIP\/VIF cleared, VM unaffected.\n    \/\/ Does this happen for 16 bit case?  fixme!\n    flags32 &= ~( (1<<20) | (1<<19) ); \/\/ Clear VIP\/VIF\n  }\n  else if (v8086_mode()) {\n    if (BX_CPU_THIS_PTR get_IOPL() < 3) {\n      exception(BX_GP_EXCEPTION, 0, 0);\n      return;\n    }\n    if (i->os32L()) {\n      pop_32(&flags32);\n      changeMask |= 0x240000; \/\/ ID,AC\n    }\n    else {\n      Bit16u flags16;\n      pop_16(&flags16);\n      flags32 = flags16;\n    }\n    \/\/ v8086-mode: VM,RF,IOPL,VIP,VIF are unaffected.\n    changeMask |= (1<<9); \/\/ IF\n  }\n  else { \/\/ Real-mode\n    if (i->os32L()) {\n      pop_32(&flags32);\n      changeMask |= 0x243200; \/\/ ID,AC,IOPL,IF\n    }\n    else { \/* 16 bit opsize *\/\n      Bit16u flags16;\n      pop_16(&flags16);\n      flags32 = flags16;\n      changeMask |= 0x3200; \/\/ IOPL,IF\n    }\n    \/\/ Real-mode: VIP\/VIF cleared, VM unaffected.\n    flags32 &= ~( (1<<20) | (1<<19) ); \/\/ Clear VIP\/VIF\n  }\n\n  writeEFlags(flags32, changeMask);\n}\n\nvoid BX_CPU_C::SALC(bxInstruction_c *i)\n{\n  if ( get_CF() ) {\n    AL = 0xff;\n  }\n  else {\n    AL = 0x00;\n  }\n}\n<commit_msg>Fixed compilation errors when CPU-LEVEL=3<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\n#define NEED_CPU_REG_SHORTCUTS 1\n#include \"bochs.h\"\n#define LOG_THIS BX_CPU_THIS_PTR\n\n\nvoid BX_CPU_C::SAHF(bxInstruction_c *i)\n{\n  set_SF((AH & 0x80) >> 7);\n  set_ZF((AH & 0x40) >> 6);\n  set_AF((AH & 0x10) >> 4);\n  set_CF(AH & 0x01);\n  set_PF((AH & 0x04) >> 2);\n}\n\nvoid BX_CPU_C::LAHF(bxInstruction_c *i)\n{\n  AH = (get_SF() ? 0x80 : 0) |\n       (get_ZF() ? 0x40 : 0) |\n       (get_AF() ? 0x10 : 0) |\n       (get_PF() ? 0x04 : 0) |\n       (0x02) |\n       (get_CF() ? 0x01 : 0);\n}\n\nvoid BX_CPU_C::CLC(bxInstruction_c *i)\n{\n  set_CF(0);\n}\n\nvoid BX_CPU_C::STC(bxInstruction_c *i)\n{\n  set_CF(1);\n}\n\nvoid BX_CPU_C::CLI(bxInstruction_c *i)\n{\n  Bit32u IOPL = BX_CPU_THIS_PTR get_IOPL();\n  Bit32u  cpl = CPL;\n\n#if BX_CPU_LEVEL >= 2\n  if (protected_mode())\n  {\n#if BX_CPU_LEVEL >= 4\n    if (BX_CPU_THIS_PTR cr4.get_PVI() && (cpl == 3))\n    {\n      if (IOPL < 3) {\n        BX_CPU_THIS_PTR clear_VIF();\n        return;\n      }\n    }\n    else \n#endif\n    {\n      if (IOPL < cpl) {\n        exception(BX_GP_EXCEPTION, 0, 0);\n        return;\n      }\n    }\n  }\n#if BX_CPU_LEVEL >= 3\n  else if (v8086_mode())\n  {\n    if (IOPL != 3) {\n#if BX_CPU_LEVEL >= 4\n      if (BX_CPU_THIS_PTR cr4.get_VME())\n      {\n        BX_CPU_THIS_PTR clear_VIF();\n        return;\n      }\n#endif\n      exception(BX_GP_EXCEPTION, 0, 0);\n      return;\n    }\n  }\n#endif\n#endif\n\n  BX_CPU_THIS_PTR clear_IF ();\n}\n\nvoid BX_CPU_C::STI(bxInstruction_c *i)\n{\n  Bit32u IOPL = BX_CPU_THIS_PTR get_IOPL();\n  Bit32u  cpl = CPL;\n\n#if BX_CPU_LEVEL >= 2\n  if (protected_mode())\n  {\n#if BX_CPU_LEVEL >= 4\n    if (BX_CPU_THIS_PTR cr4.get_PVI())\n    {\n      if (cpl == 3) {\n        if (IOPL < 3) \n        {\n          if (! BX_CPU_THIS_PTR get_VIP ())\n          {\n            BX_CPU_THIS_PTR assert_VIF();\n            return;\n          }\n\n          exception(BX_GP_EXCEPTION, 0, 0);\n          return;\n        }\n      }\n    }\n#endif\n    if (cpl > IOPL) {\n      exception(BX_GP_EXCEPTION, 0, 0);\n      return;\n    }\n  }\n#if BX_CPU_LEVEL >= 3\n  else if (v8086_mode())\n  {\n    if (IOPL != 3) {\n#if BX_CPU_LEVEL >= 4\n      if (! BX_CPU_THIS_PTR get_VIP () && BX_CPU_THIS_PTR cr4.get_VME())\n      {\n        BX_CPU_THIS_PTR assert_VIF();\n        return;\n      }\n#endif\n      exception(BX_GP_EXCEPTION, 0, 0);\n      return;\n    }\n  }\n#endif\n#endif\n\n  if (!BX_CPU_THIS_PTR get_IF ()) {\n    BX_CPU_THIS_PTR assert_IF ();\n    BX_CPU_THIS_PTR inhibit_mask |= BX_INHIBIT_INTERRUPTS;\n    BX_CPU_THIS_PTR async_event = 1;\n  }\n}\n\nvoid BX_CPU_C::CLD(bxInstruction_c *i)\n{\n  BX_CPU_THIS_PTR clear_DF ();\n}\n\nvoid BX_CPU_C::STD(bxInstruction_c *i)\n{\n  BX_CPU_THIS_PTR assert_DF ();\n}\n\nvoid BX_CPU_C::CMC(bxInstruction_c *i)\n{\n  set_CF( !get_CF() );\n}\n\nvoid BX_CPU_C::PUSHF_Fv(bxInstruction_c *i)\n{\n  if (v8086_mode() && (BX_CPU_THIS_PTR get_IOPL ()<3)) {\n    exception(BX_GP_EXCEPTION, 0, 0);\n    return;\n  }\n\n#if BX_CPU_LEVEL >= 3\n#if BX_SUPPORT_X86_64\n  if (BX_CPU_THIS_PTR cpu_mode == BX_MODE_LONG_64) {\n    if (i->os32L()) {\n      push_64(read_eflags() & 0x00fcffff);\n    }\n    else\n    {\n      Bit16u flags16 = read_flags();\n      write_virtual_word(BX_SEG_REG_SS, RSP-2, &flags16);\n      RSP -= 2;\n    }\n  }\n  else\n#endif\n  if (i->os32L()) {\n    push_32(read_eflags() & 0x00fcffff);\n  }\n  else\n#endif\n  {\n    push_16(read_flags());\n  }\n}\n\nvoid BX_CPU_C::POPF_Fv(bxInstruction_c *i)\n{\n  Bit32u changeMask = 0x004dd5;\n  Bit32u flags32;\n\n#if BX_CPU_LEVEL >= 3\n  if (protected_mode()) {\n#if BX_SUPPORT_X86_64\n    if (BX_CPU_THIS_PTR cpu_mode == BX_MODE_LONG_64) {\n      Bit64u flags64;\n\n      if (i->os32L()) {\n        pop_64(&flags64);\n        flags32 = flags64;\n        changeMask |= 0x240000; \/\/ ID,AC\n        if (CPL==0)\n          changeMask |= (3<<12); \/\/ IOPL\n        if (CPL <= BX_CPU_THIS_PTR get_IOPL())\n          changeMask |= (1<<9); \/\/ IF\n      }\n      else\n      {\n        Bit16u flags16;\n\n        read_virtual_word(BX_SEG_REG_SS, RSP, &flags16);\n\n        RSP += 2;\n        flags32 = flags16;\n        if (CPL==0)\n          changeMask |= (3<<12); \/\/ IOPL\n        if (CPL <= BX_CPU_THIS_PTR get_IOPL())\n          changeMask |= (1<<9); \/\/ IF\n      }\n    }\n    else\n#endif  \/\/ #if BX_SUPPORT_X86_64\n    if (i->os32L()) {\n      pop_32(&flags32);\n      changeMask |= 0x240000; \/\/ ID,AC\n      if (CPL==0)\n        changeMask |= (3<<12); \/\/ IOPL\n      if (CPL <= BX_CPU_THIS_PTR get_IOPL())\n        changeMask |= (1<<9); \/\/ IF\n    }\n    else\n#endif  \/\/ BX_CPU_LEVEL >= 3\n    {\n      Bit16u flags16;\n      pop_16(&flags16);\n      flags32 = flags16;\n      if (CPL==0)\n        changeMask |= (3<<12); \/\/ IOPL\n      if (CPL <= BX_CPU_THIS_PTR get_IOPL())\n        changeMask |= (1<<9); \/\/ IF\n    }\n\n    \/\/ Protected-mode: VIP\/VIF cleared, VM unaffected.\n    \/\/ Does this happen for 16 bit case?  fixme!\n    flags32 &= ~( (1<<20) | (1<<19) ); \/\/ Clear VIP\/VIF\n  }\n  else if (v8086_mode()) {\n    if (BX_CPU_THIS_PTR get_IOPL() < 3) {\n      exception(BX_GP_EXCEPTION, 0, 0);\n      return;\n    }\n    if (i->os32L()) {\n      pop_32(&flags32);\n      changeMask |= 0x240000; \/\/ ID,AC\n    }\n    else {\n      Bit16u flags16;\n      pop_16(&flags16);\n      flags32 = flags16;\n    }\n    \/\/ v8086-mode: VM,RF,IOPL,VIP,VIF are unaffected.\n    changeMask |= (1<<9); \/\/ IF\n  }\n  else { \/\/ Real-mode\n    if (i->os32L()) {\n      pop_32(&flags32);\n      changeMask |= 0x243200; \/\/ ID,AC,IOPL,IF\n    }\n    else { \/* 16 bit opsize *\/\n      Bit16u flags16;\n      pop_16(&flags16);\n      flags32 = flags16;\n      changeMask |= 0x3200; \/\/ IOPL,IF\n    }\n    \/\/ Real-mode: VIP\/VIF cleared, VM unaffected.\n    flags32 &= ~( (1<<20) | (1<<19) ); \/\/ Clear VIP\/VIF\n  }\n\n  writeEFlags(flags32, changeMask);\n}\n\nvoid BX_CPU_C::SALC(bxInstruction_c *i)\n{\n  if ( get_CF() ) {\n    AL = 0xff;\n  }\n  else {\n    AL = 0x00;\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <cstring>\n\n#include <Bull\/Render\/HardwareBuffer.hpp>\n#include <Bull\/Render\/OpenGL.hpp>\n\nnamespace Bull\n{\n    \/*! \\brief Bind a buffer\n     *\n     * \\param buffer The buffer to bind\n     *\n     *\/\n    void HardwareBuffer::bind(const HardwareBuffer& buffer)\n    {\n        ensureContext();\n        gl::bindBuffer(buffer.m_type, buffer.m_id);\n    }\n\n    \/*! \\brief Unbind any buffer\n     *\n     * \\param type The type of buffer to unbind\n     *\n     *\/\n    void HardwareBuffer::unbind(Type type)\n    {\n        ensureContext();\n        gl::bindBuffer(type, 0);\n    }\n\n    \/*! \\brief Constructor\n     *\n     * \\param type The type the of OpenGL buffer to create\n     *\n     *\/\n    HardwareBuffer::HardwareBuffer(Type type) :\n        m_id(0),\n        m_type(type)\n    {\n        \/\/\/ Nothing\n    }\n\n    \/*! \\brief Destructor\n     *\n     *\/\n    HardwareBuffer::~HardwareBuffer()\n    {\n        destroy();\n    }\n\n    \/*! \\brief Create the buffer in the VRAM\n     *\n     * \\param size  The size of the buffer\n     * \\param usage The usage of the buffer\n     *\n     * \\return Return true if the buffer was created successfully, false otherwise\n     *\n     *\/\n    bool HardwareBuffer::create(std::size_t size, Usage usage)\n    {\n        ensureContext();\n\n        if(m_id)\n        {\n            destroy();\n        }\n\n        gl::genBuffers(1, &m_id);\n        gl::bindBuffer(m_type, m_id);\n        gl::bufferData(m_type, size, nullptr, usage);\n\n        return true;\n    }\n\n    \/*! \\brief Fill the buffer\n     *\n     * \\param data   Data to use to fill the buffer\n     * \\param size   The size of data\n     * \\param offset The offset of the data in the buffer\n     * \\param discard True to flush the buffer before fill it, false to keep the original content\n     *\n     * \\return Return true if the buffer was filled successfully, false otherwise\n     *\n     *\/\n    bool HardwareBuffer::fill(const void* data, std::size_t size, std::size_t offset, bool discard)\n    {\n        ensureContext();\n\n        if(m_id)\n        {\n            gl::bindBuffer(m_type, m_id);\n\n            \/\/\/ It seems that glBufferSubData is more efficient than glMapBuffer with small buffers\n            \/\/\/ http:\/\/www.stevestreeting.com\/2007\/03\/17\/glmapbuffer-vs-glbuffersubdata-the-return\/\n            if(size < 32 * 1024)\n            {\n                gl::bufferSubData(m_type, offset, size, data);\n            }\n            else\n            {\n                unsigned char* ptr = reinterpret_cast<unsigned char*>(gl::mapBuffer(m_type, GL_WRITE_ONLY));\n\n                if(!ptr)\n                {\n                    return false;\n                }\n\n                std::memcpy(ptr + offset, data, size);\n\n                gl::unmapBuffer(m_type);\n            }\n\n            return true;\n        }\n\n        return false;\n\n    }\n\n    \/*! \\brief Flush the buffer\n     *\n     * \\param keepMemory True to keep the allocated memory, false otherwise\n     *\n     *\/\n    void HardwareBuffer::flush(bool keepMemory)\n    {\n        if(m_id)\n        {\n            ensureContext();\n\n            gl::bindBuffer(m_type, m_id);\n            if(!keepMemory)\n            {\n                m_size = 0;\n            }\n\n            int usage;\n            gl::getBufferParameteriv(m_id, GL_BUFFER_USAGE, &usage);\n            gl::bufferData(m_type, m_size, nullptr, usage);\n        }\n    }\n\n    \/*! \\brief Destroy the buffer\n     *\n     *\/\n    void HardwareBuffer::destroy()\n    {\n        if(m_id)\n        {\n            ensureContext();\n\n            gl::deleteBuffers(1, &m_id);\n        }\n    }\n\n    \/*! \\brief Get the buffer system handler\n     *\n     * \\return Return the native buffer system handler\n     *\n     *\/\n    unsigned int HardwareBuffer::getSystemHandler() const\n    {\n        return m_id;\n    }\n}\n<commit_msg>Cleanup<commit_after>#include <cstring>\n\n#include <Bull\/Render\/HardwareBuffer.hpp>\n#include <Bull\/Render\/OpenGL.hpp>\n\nnamespace Bull\n{\n    void HardwareBuffer::bind(const HardwareBuffer& buffer)\n    {\n        ensureContext();\n        gl::bindBuffer(buffer.m_type, buffer.m_id);\n    }\n\n    void HardwareBuffer::unbind(Type type)\n    {\n        ensureContext();\n        gl::bindBuffer(type, 0);\n    }\n\n    HardwareBuffer::HardwareBuffer(Type type) :\n        m_id(0),\n        m_type(type)\n    {\n        \/\/\/ Nothing\n    }\n\n    HardwareBuffer::~HardwareBuffer()\n    {\n        destroy();\n    }\n\n    bool HardwareBuffer::create(std::size_t size, Usage usage)\n    {\n        ensureContext();\n\n        if(m_id)\n        {\n            destroy();\n        }\n\n        gl::genBuffers(1, &m_id);\n        gl::bindBuffer(m_type, m_id);\n        gl::bufferData(m_type, size, nullptr, usage);\n\n        return true;\n    }\n\n    bool HardwareBuffer::fill(const void* data, std::size_t size, std::size_t offset, bool discard)\n    {\n        ensureContext();\n\n        if(m_id)\n        {\n            gl::bindBuffer(m_type, m_id);\n\n            \/\/\/ It seems that glBufferSubData is more efficient than glMapBuffer with small buffers\n            \/\/\/ http:\/\/www.stevestreeting.com\/2007\/03\/17\/glmapbuffer-vs-glbuffersubdata-the-return\/\n            if(size < 32 * 1024)\n            {\n                gl::bufferSubData(m_type, offset, size, data);\n            }\n            else\n            {\n                unsigned char* ptr = reinterpret_cast<unsigned char*>(gl::mapBuffer(m_type, GL_WRITE_ONLY));\n\n                if(!ptr)\n                {\n                    return false;\n                }\n\n                std::memcpy(ptr + offset, data, size);\n\n                gl::unmapBuffer(m_type);\n            }\n\n            return true;\n        }\n\n        return false;\n    }\n\n    void HardwareBuffer::flush(bool keepMemory)\n    {\n        if(m_id)\n        {\n            ensureContext();\n\n            gl::bindBuffer(m_type, m_id);\n            if(!keepMemory)\n            {\n                m_size = 0;\n            }\n\n            int usage;\n            gl::getBufferParameteriv(m_id, GL_BUFFER_USAGE, &usage);\n            gl::bufferData(m_type, m_size, nullptr, usage);\n        }\n    }\n\n    void HardwareBuffer::destroy()\n    {\n        if(m_id)\n        {\n            ensureContext();\n\n            gl::deleteBuffers(1, &m_id);\n        }\n    }\n\n    unsigned int HardwareBuffer::getSystemHandler() const\n    {\n        return m_id;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <stdio.h>\n#include <ctype.h>\n#include <iostream>\n#include <fstream>\n#include <string>\n\n#include <metaUtils.h>\n#include <metaObject.h>\n#include <metaTubeGraph.h>\n\n\/** MetaTubeGraph Constructors *\/\nMetaTubeGraph::\nMetaTubeGraph()\n:MetaObject()\n{\n  if(META_DEBUG) std::cout << \"MetaTubeGraph()\" << std::endl;\n  Clear();\n}\n\n\nMetaTubeGraph::\nMetaTubeGraph(const char *_headerName)\n:MetaObject()\n{\n  if(META_DEBUG)  std::cout << \"MetaTubeGraph()\" << std::endl;\n  Clear();\n  Read(_headerName);\n}\n\n\nMetaTubeGraph::\nMetaTubeGraph(const MetaTubeGraph *_tube)\n:MetaObject()\n{\n  if(META_DEBUG)  std::cout << \"MetaTubeGraph()\" << std::endl;\n  Clear();\n  CopyInfo(_tube);\n}\n\n\nMetaTubeGraph::\nMetaTubeGraph(unsigned int dim)\n:MetaObject(dim)\n{\n  if(META_DEBUG) std::cout << \"MetaTubeGraph()\" << std::endl;\n  Clear();\n}\n\n\/** Destructor *\/\nMetaTubeGraph::\n~MetaTubeGraph()\n{\n  \/\/ Delete the list of pointers to tubes.\n  PointListType::iterator it = m_PointList.begin();\n  while(it != m_PointList.end())\n  {\n    TubeGraphPnt* pnt = *it;\n    it++;\n    delete pnt;\n  }  \n  m_PointList.clear();\n  M_Destroy();\n}\n\n\/\/\nvoid MetaTubeGraph::\nPrintInfo() const\n{\n  MetaObject::PrintInfo();\n  std::cout << \"Root = \" << m_Root << std::endl;\n  std::cout << \"PointDim = \" << m_PointDim << std::endl;\n  std::cout << \"NPoints = \" << m_NPoints << std::endl;\n  char str[255];\n  MET_TypeToString(m_ElementType, str);\n  std::cout << \"ElementType = \" << str << std::endl;\n}\n\nvoid MetaTubeGraph::\nCopyInfo(const MetaTubeGraph * _tube)\n{\n  MetaObject::CopyInfo(_tube);\n}\n\n    \n\nvoid MetaTubeGraph::\nPointDim(const char* pointDim)\n{\n  strcpy(m_PointDim,pointDim);\n}\n    \nconst char* MetaTubeGraph::\nPointDim(void) const\n{\n  return m_PointDim;\n}\n\nvoid MetaTubeGraph::\nNPoints(int npnt)\n{\n  m_NPoints = npnt;\n}\n\nint MetaTubeGraph::\nNPoints(void) const\n{\n  return m_NPoints;\n}\n\nvoid MetaTubeGraph::\nRoot(int root)\n{\n  m_Root = root;\n}\n    \nint MetaTubeGraph:: \nRoot(void) const\n{\n  return m_Root;\n}\n\n\n\/** Clear tube information *\/\nvoid MetaTubeGraph::\nClear(void)\n{\n  if(META_DEBUG) std::cout << \"MetaTubeGraph: Clear\" << std::endl;\n  MetaObject::Clear();\n  \/\/ Delete the list of pointers to tubes.\n  PointListType::iterator it = m_PointList.begin();\n  while(it != m_PointList.end())\n  {\n    TubeGraphPnt* pnt = *it;\n    it++;\n    delete pnt;\n  }  \n  m_PointList.clear();\n\n  m_Root = 0;\n  m_NPoints = 0;\n  strcpy(m_PointDim, \"Node r txx txy txz tyx tyy tyz tzx tzy tzz\");\n  m_ElementType = MET_FLOAT;\n}\n        \n\/** Destroy tube information *\/\nvoid MetaTubeGraph::\nM_Destroy(void)\n{\n  MetaObject::M_Destroy();\n}\n\n\/** Set Read fields *\/\nvoid MetaTubeGraph::\nM_SetupReadFields(void)\n{\n  if(META_DEBUG) std::cout << \"MetaTubeGraph: M_SetupReadFields\" << std::endl;\n\n  MetaObject::M_SetupReadFields();\n\n  MET_FieldRecordType * mF;\n\n  mF = new MET_FieldRecordType;\n  MET_InitReadField(mF, \"Root\", MET_INT, false);\n  m_Fields.push_back(mF);\n\n  mF = new MET_FieldRecordType;\n  MET_InitReadField(mF, \"PointDim\", MET_STRING, true);\n  m_Fields.push_back(mF);\n\n  mF = new MET_FieldRecordType;\n  MET_InitReadField(mF, \"NPoints\", MET_INT, true);\n  m_Fields.push_back(mF);\n\n  mF = new MET_FieldRecordType;\n  MET_InitReadField(mF, \"Points\", MET_NONE, true);\n  mF->terminateRead = true;\n  m_Fields.push_back(mF);\n\n}\n\nvoid MetaTubeGraph::\nM_SetupWriteFields(void)\n{\n  strcpy(m_ObjectTypeName,\"TubeGraph\");\n  MetaObject::M_SetupWriteFields();\n\n  MET_FieldRecordType * mF;\n  FieldsContainerType::iterator it;\n\n  mF = MET_GetFieldRecord(\"TransformMatrix\",&m_Fields);\n  it = m_Fields.begin();\n  while(it != m_Fields.end())\n    {\n    if(*it == mF)\n      {\n      m_Fields.erase(it);\n      break;\n      }\n    it++;\n    }\n\n  mF = MET_GetFieldRecord(\"Offset\",&m_Fields);\n  it = m_Fields.begin();\n  while(it != m_Fields.end())\n    {\n    if(*it == mF)\n      {\n      m_Fields.erase(it);\n      break;\n      }\n    it++;\n    }\n\n  mF = MET_GetFieldRecord(\"ElementSpacing\",&m_Fields);\n  it = m_Fields.begin();\n  while(it != m_Fields.end())\n    {\n    if(*it == mF)\n      {\n      m_Fields.erase(it);\n      break;\n      }\n    it++;\n    }\n\n  mF = MET_GetFieldRecord(\"CenterOfRotation\",&m_Fields);\n  it = m_Fields.begin();\n  while(it != m_Fields.end())\n    {\n    if(*it == mF)\n      {\n      m_Fields.erase(it);\n      break;\n      }\n    it++;\n    }\n\n  if(m_Root>0)\n    {\n    mF = new MET_FieldRecordType;\n    MET_InitWriteField(mF, \"Root\", MET_INT,m_Root);\n    m_Fields.push_back(mF);\n    }\n\n  if(strlen(m_PointDim)>0)\n    {\n    mF = new MET_FieldRecordType;\n    MET_InitWriteField(mF, \"PointDim\", MET_STRING,\n                           strlen(m_PointDim),m_PointDim);\n    m_Fields.push_back(mF);\n    }\n\n  m_NPoints = m_PointList.size();\n  mF = new MET_FieldRecordType;\n  MET_InitWriteField(mF, \"NPoints\", MET_INT,m_NPoints);\n  m_Fields.push_back(mF);\n\n  mF = new MET_FieldRecordType;\n  MET_InitWriteField(mF, \"Points\", MET_NONE);\n  m_Fields.push_back(mF);\n\n}\n\n\n\nbool MetaTubeGraph::\nM_Read(void)\n{\n  if(META_DEBUG) std::cout << \"MetaTubeGraph: M_Read: Loading Header\" << std::endl;\n\n  if(!MetaObject::M_Read())\n  {\n    std::cout << \"MetaTubeGraph: M_Read: Error parsing file\" << std::endl;\n    return false;\n  }\n\n  if(META_DEBUG) std::cout << \"MetaTubeGraph: M_Read: Parsing Header\" << std::endl;\n \n  MET_FieldRecordType * mF;\n \n  mF = MET_GetFieldRecord(\"Root\", &m_Fields);\n  if(mF->defined)\n  {\n    m_Root= (int)mF->value[0];\n  }\n\n  mF = MET_GetFieldRecord(\"NPoints\", &m_Fields);\n  if(mF->defined)\n  {\n    m_NPoints= (int)mF->value[0];\n  }\n\n  mF = MET_GetFieldRecord(\"PointDim\", &m_Fields);\n  if(mF->defined)\n  {\n    strcpy(m_PointDim,(char *)(mF->value));\n  }\n\n\n  int i;\n  int posR = -1;\n  int posTx = -1;\n  int posGraphNode = -1;\n\n  int pntDim;\n  char** pntVal = NULL;\n  MET_StringToWordArray(m_PointDim, &pntDim, &pntVal); \n \n  if(META_DEBUG)\n    { std::cout << \"MetaTubeGraph: Parsing point dim\" << std::endl; }\n\n  int j;\n  for(j = 0; j < pntDim; j++) \n  {\n    if(!strcmp(pntVal[j], \"node\") || !strcmp(pntVal[j], \"Node\"))\n    {\n      posGraphNode = j;\n    }\n    if(!strcmp(pntVal[j], \"s\") || !strcmp(pntVal[j], \"S\") ||\n      !strcmp(pntVal[j], \"r\") || !strcmp(pntVal[j], \"R\") ||\n      !strcmp(pntVal[j], \"rad\") || !strcmp(pntVal[j], \"Rad\") ||\n      !strcmp(pntVal[j], \"radius\") || !strcmp(pntVal[j], \"Radius\"))\n    {\n      posR = j;\n    }\n    if(!strcmp(pntVal[j], \"txx\"))\n    {\n      posTx = j;\n    }\n  }\n\n  for(i=0;i<pntDim;i++)\n    {\n      delete [] pntVal[i];\n    }\n  delete [] pntVal;\n\n  float v[30];\n  \n  if(m_Event)\n    {\n     m_Event->StartReading(m_NPoints);\n    }\n\n  if(m_BinaryData)\n  {\n    int elementSize;\n    MET_SizeOfType(m_ElementType, &elementSize);\n    int readSize = m_NPoints*pntDim*elementSize;\n\n    char* _data = new char[readSize];\n    m_ReadStream->read((char *)_data, readSize);\n\n    int gc = m_ReadStream->gcount();\n    if(gc != readSize)\n    {\n      std::cout << \"MetaLine: m_Read: data not read completely\" \n                << std::endl;\n      std::cout << \"   ideal = \" << readSize << \" : actual = \" << gc\n                << std::endl;\n      return false;\n    }\n\n    int i=0;\n    double td;\n    for(int j=0; j<m_NPoints; j++) \n    {\n      TubeGraphPnt* pnt = new TubeGraphPnt(m_NDims);\n      \n      MET_ValueToDouble(m_ElementType,_data,posGraphNode,&td);\n      pnt->m_GraphNode=(int)td;\n\n      if(posR != -1)\n        {\n        MET_ValueToDouble(m_ElementType, _data, posR, &td);\n        pnt->m_R = (float)td;\n        }\n\n      if(posTx != -1)\n        {\n        for(int r=0; r<m_NDims*m_NDims; r++)\n          {\n          MET_ValueToDouble(m_ElementType, _data, posTx+r, &td);\n          pnt->m_T[r] = (float)td;\n          }\n        }\n      m_PointList.push_back(pnt);\n    }\n    delete [] _data;\n  }\n  else\n  {\n    for(j=0; j<m_NPoints; j++) \n    {\n      if(m_Event)\n        {\n        m_Event->SetCurrentIteration(j+1);\n        }\n\n     TubeGraphPnt* pnt = new TubeGraphPnt(m_NDims);\n\n     pnt->m_GraphNode = (int)v[posGraphNode];\n\n     if(posR != -1)\n       {\n       pnt->m_R = v[posR];\n       }\n\n      if(posTx >= 0 && posTx<pntDim) \n        {\n        for(int r=0; r<m_NDims*m_NDims; r++)\n          {\n          pnt->m_T[r] = v[posTx+r];\n          }\n        }\n\n      m_PointList.push_back(pnt);\n    }\n\n      \n    char c = ' ';\n    while( (c!='\\n') && (!m_ReadStream->eof()))\n    {\n      c = m_ReadStream->get();\/\/ to avoid unrecognize charactere\n    }\n  }\n  \n  if(m_Event)\n    {\n    m_Event->StopReading();\n    }\n\n  return true;\n}\n\nMET_ValueEnumType MetaTubeGraph::\nElementType(void) const\n{\n  return m_ElementType;\n}\n\nvoid MetaTubeGraph::\nElementType(MET_ValueEnumType _elementType)\n{\n  m_ElementType = _elementType;\n}\n\nbool MetaTubeGraph::\nM_Write(void)\n{\n\n  if(!MetaObject::M_Write())\n  {\n    std::cout << \"MetaTubeGraph: M_Read: Error parsing file\" << std::endl;\n    return false;\n  }\n\n  \/** Then copy all tubes points *\/\n  if(m_BinaryData)\n  {\n    PointListType::const_iterator it = m_PointList.begin();\n    int elementSize;\n    MET_SizeOfType(m_ElementType, &elementSize);\n\n    char* data = new char[(m_NDims*m_NDims+2)*m_NPoints*elementSize];\n    int i=0;\n    int d;\n    while(it != m_PointList.end())\n    {\n      MET_DoubleToValue((double)(*it)->m_GraphNode,m_ElementType,data,i++);\n\n      MET_DoubleToValue((double)(*it)->m_R,m_ElementType,data,i++);  \n      \n      for(d = 0; d < m_NDims*m_NDims; d++)\n      {\n        MET_DoubleToValue((double)(*it)->m_T[d],m_ElementType,data,i++);  \n      }\n\n      it++;\n    }\n\n    m_WriteStream->write((char *)data,(m_NDims*m_NDims+2)*m_NPoints*elementSize);\n    m_WriteStream->write(\"\\n\",1);\n    delete data;\n  }\n  else\n  {\n    PointListType::const_iterator it = m_PointList.begin();\n  \n    int d;\n    while(it != m_PointList.end())\n    {\n      *m_WriteStream << (*it)->m_GraphNode << \" \";\n\n      *m_WriteStream << (*it)->m_R << \" \";\n\n      for(d = 0; d < m_NDims*m_NDims; d++)\n      {\n         *m_WriteStream << (*it)->m_T[d] << \" \";\n      }\n\n      *m_WriteStream << std::endl;\n\n      it++;\n    }\n  }\n  return true;\n\n}\n\n<commit_msg>COMP: removed unused variable<commit_after>#include <stdio.h>\n#include <ctype.h>\n#include <iostream>\n#include <fstream>\n#include <string>\n\n#include <metaUtils.h>\n#include <metaObject.h>\n#include <metaTubeGraph.h>\n\n\/** MetaTubeGraph Constructors *\/\nMetaTubeGraph::\nMetaTubeGraph()\n:MetaObject()\n{\n  if(META_DEBUG) std::cout << \"MetaTubeGraph()\" << std::endl;\n  Clear();\n}\n\n\nMetaTubeGraph::\nMetaTubeGraph(const char *_headerName)\n:MetaObject()\n{\n  if(META_DEBUG)  std::cout << \"MetaTubeGraph()\" << std::endl;\n  Clear();\n  Read(_headerName);\n}\n\n\nMetaTubeGraph::\nMetaTubeGraph(const MetaTubeGraph *_tube)\n:MetaObject()\n{\n  if(META_DEBUG)  std::cout << \"MetaTubeGraph()\" << std::endl;\n  Clear();\n  CopyInfo(_tube);\n}\n\n\nMetaTubeGraph::\nMetaTubeGraph(unsigned int dim)\n:MetaObject(dim)\n{\n  if(META_DEBUG) std::cout << \"MetaTubeGraph()\" << std::endl;\n  Clear();\n}\n\n\/** Destructor *\/\nMetaTubeGraph::\n~MetaTubeGraph()\n{\n  \/\/ Delete the list of pointers to tubes.\n  PointListType::iterator it = m_PointList.begin();\n  while(it != m_PointList.end())\n  {\n    TubeGraphPnt* pnt = *it;\n    it++;\n    delete pnt;\n  }  \n  m_PointList.clear();\n  M_Destroy();\n}\n\n\/\/\nvoid MetaTubeGraph::\nPrintInfo() const\n{\n  MetaObject::PrintInfo();\n  std::cout << \"Root = \" << m_Root << std::endl;\n  std::cout << \"PointDim = \" << m_PointDim << std::endl;\n  std::cout << \"NPoints = \" << m_NPoints << std::endl;\n  char str[255];\n  MET_TypeToString(m_ElementType, str);\n  std::cout << \"ElementType = \" << str << std::endl;\n}\n\nvoid MetaTubeGraph::\nCopyInfo(const MetaTubeGraph * _tube)\n{\n  MetaObject::CopyInfo(_tube);\n}\n\n    \n\nvoid MetaTubeGraph::\nPointDim(const char* pointDim)\n{\n  strcpy(m_PointDim,pointDim);\n}\n    \nconst char* MetaTubeGraph::\nPointDim(void) const\n{\n  return m_PointDim;\n}\n\nvoid MetaTubeGraph::\nNPoints(int npnt)\n{\n  m_NPoints = npnt;\n}\n\nint MetaTubeGraph::\nNPoints(void) const\n{\n  return m_NPoints;\n}\n\nvoid MetaTubeGraph::\nRoot(int root)\n{\n  m_Root = root;\n}\n    \nint MetaTubeGraph:: \nRoot(void) const\n{\n  return m_Root;\n}\n\n\n\/** Clear tube information *\/\nvoid MetaTubeGraph::\nClear(void)\n{\n  if(META_DEBUG) std::cout << \"MetaTubeGraph: Clear\" << std::endl;\n  MetaObject::Clear();\n  \/\/ Delete the list of pointers to tubes.\n  PointListType::iterator it = m_PointList.begin();\n  while(it != m_PointList.end())\n  {\n    TubeGraphPnt* pnt = *it;\n    it++;\n    delete pnt;\n  }  \n  m_PointList.clear();\n\n  m_Root = 0;\n  m_NPoints = 0;\n  strcpy(m_PointDim, \"Node r txx txy txz tyx tyy tyz tzx tzy tzz\");\n  m_ElementType = MET_FLOAT;\n}\n        \n\/** Destroy tube information *\/\nvoid MetaTubeGraph::\nM_Destroy(void)\n{\n  MetaObject::M_Destroy();\n}\n\n\/** Set Read fields *\/\nvoid MetaTubeGraph::\nM_SetupReadFields(void)\n{\n  if(META_DEBUG) std::cout << \"MetaTubeGraph: M_SetupReadFields\" << std::endl;\n\n  MetaObject::M_SetupReadFields();\n\n  MET_FieldRecordType * mF;\n\n  mF = new MET_FieldRecordType;\n  MET_InitReadField(mF, \"Root\", MET_INT, false);\n  m_Fields.push_back(mF);\n\n  mF = new MET_FieldRecordType;\n  MET_InitReadField(mF, \"PointDim\", MET_STRING, true);\n  m_Fields.push_back(mF);\n\n  mF = new MET_FieldRecordType;\n  MET_InitReadField(mF, \"NPoints\", MET_INT, true);\n  m_Fields.push_back(mF);\n\n  mF = new MET_FieldRecordType;\n  MET_InitReadField(mF, \"Points\", MET_NONE, true);\n  mF->terminateRead = true;\n  m_Fields.push_back(mF);\n\n}\n\nvoid MetaTubeGraph::\nM_SetupWriteFields(void)\n{\n  strcpy(m_ObjectTypeName,\"TubeGraph\");\n  MetaObject::M_SetupWriteFields();\n\n  MET_FieldRecordType * mF;\n  FieldsContainerType::iterator it;\n\n  mF = MET_GetFieldRecord(\"TransformMatrix\",&m_Fields);\n  it = m_Fields.begin();\n  while(it != m_Fields.end())\n    {\n    if(*it == mF)\n      {\n      m_Fields.erase(it);\n      break;\n      }\n    it++;\n    }\n\n  mF = MET_GetFieldRecord(\"Offset\",&m_Fields);\n  it = m_Fields.begin();\n  while(it != m_Fields.end())\n    {\n    if(*it == mF)\n      {\n      m_Fields.erase(it);\n      break;\n      }\n    it++;\n    }\n\n  mF = MET_GetFieldRecord(\"ElementSpacing\",&m_Fields);\n  it = m_Fields.begin();\n  while(it != m_Fields.end())\n    {\n    if(*it == mF)\n      {\n      m_Fields.erase(it);\n      break;\n      }\n    it++;\n    }\n\n  mF = MET_GetFieldRecord(\"CenterOfRotation\",&m_Fields);\n  it = m_Fields.begin();\n  while(it != m_Fields.end())\n    {\n    if(*it == mF)\n      {\n      m_Fields.erase(it);\n      break;\n      }\n    it++;\n    }\n\n  if(m_Root>0)\n    {\n    mF = new MET_FieldRecordType;\n    MET_InitWriteField(mF, \"Root\", MET_INT,m_Root);\n    m_Fields.push_back(mF);\n    }\n\n  if(strlen(m_PointDim)>0)\n    {\n    mF = new MET_FieldRecordType;\n    MET_InitWriteField(mF, \"PointDim\", MET_STRING,\n                           strlen(m_PointDim),m_PointDim);\n    m_Fields.push_back(mF);\n    }\n\n  m_NPoints = m_PointList.size();\n  mF = new MET_FieldRecordType;\n  MET_InitWriteField(mF, \"NPoints\", MET_INT,m_NPoints);\n  m_Fields.push_back(mF);\n\n  mF = new MET_FieldRecordType;\n  MET_InitWriteField(mF, \"Points\", MET_NONE);\n  m_Fields.push_back(mF);\n\n}\n\n\n\nbool MetaTubeGraph::\nM_Read(void)\n{\n  if(META_DEBUG) std::cout << \"MetaTubeGraph: M_Read: Loading Header\" << std::endl;\n\n  if(!MetaObject::M_Read())\n  {\n    std::cout << \"MetaTubeGraph: M_Read: Error parsing file\" << std::endl;\n    return false;\n  }\n\n  if(META_DEBUG) std::cout << \"MetaTubeGraph: M_Read: Parsing Header\" << std::endl;\n \n  MET_FieldRecordType * mF;\n \n  mF = MET_GetFieldRecord(\"Root\", &m_Fields);\n  if(mF->defined)\n  {\n    m_Root= (int)mF->value[0];\n  }\n\n  mF = MET_GetFieldRecord(\"NPoints\", &m_Fields);\n  if(mF->defined)\n  {\n    m_NPoints= (int)mF->value[0];\n  }\n\n  mF = MET_GetFieldRecord(\"PointDim\", &m_Fields);\n  if(mF->defined)\n  {\n    strcpy(m_PointDim,(char *)(mF->value));\n  }\n\n\n  int i;\n  int posR = -1;\n  int posTx = -1;\n  int posGraphNode = -1;\n\n  int pntDim;\n  char** pntVal = NULL;\n  MET_StringToWordArray(m_PointDim, &pntDim, &pntVal); \n \n  if(META_DEBUG)\n    { std::cout << \"MetaTubeGraph: Parsing point dim\" << std::endl; }\n\n  int j;\n  for(j = 0; j < pntDim; j++) \n  {\n    if(!strcmp(pntVal[j], \"node\") || !strcmp(pntVal[j], \"Node\"))\n    {\n      posGraphNode = j;\n    }\n    if(!strcmp(pntVal[j], \"s\") || !strcmp(pntVal[j], \"S\") ||\n      !strcmp(pntVal[j], \"r\") || !strcmp(pntVal[j], \"R\") ||\n      !strcmp(pntVal[j], \"rad\") || !strcmp(pntVal[j], \"Rad\") ||\n      !strcmp(pntVal[j], \"radius\") || !strcmp(pntVal[j], \"Radius\"))\n    {\n      posR = j;\n    }\n    if(!strcmp(pntVal[j], \"txx\"))\n    {\n      posTx = j;\n    }\n  }\n\n  for(i=0;i<pntDim;i++)\n    {\n      delete [] pntVal[i];\n    }\n  delete [] pntVal;\n\n  float v[30];\n  \n  if(m_Event)\n    {\n     m_Event->StartReading(m_NPoints);\n    }\n\n  if(m_BinaryData)\n  {\n    int elementSize;\n    MET_SizeOfType(m_ElementType, &elementSize);\n    int readSize = m_NPoints*pntDim*elementSize;\n\n    char* _data = new char[readSize];\n    m_ReadStream->read((char *)_data, readSize);\n\n    int gc = m_ReadStream->gcount();\n    if(gc != readSize)\n    {\n      std::cout << \"MetaLine: m_Read: data not read completely\" \n                << std::endl;\n      std::cout << \"   ideal = \" << readSize << \" : actual = \" << gc\n                << std::endl;\n      return false;\n    }\n\n    double td;\n    for(int j=0; j<m_NPoints; j++) \n    {\n      TubeGraphPnt* pnt = new TubeGraphPnt(m_NDims);\n      \n      MET_ValueToDouble(m_ElementType,_data,posGraphNode,&td);\n      pnt->m_GraphNode=(int)td;\n\n      if(posR != -1)\n        {\n        MET_ValueToDouble(m_ElementType, _data, posR, &td);\n        pnt->m_R = (float)td;\n        }\n\n      if(posTx != -1)\n        {\n        for(int r=0; r<m_NDims*m_NDims; r++)\n          {\n          MET_ValueToDouble(m_ElementType, _data, posTx+r, &td);\n          pnt->m_T[r] = (float)td;\n          }\n        }\n      m_PointList.push_back(pnt);\n    }\n    delete [] _data;\n  }\n  else\n  {\n    for(j=0; j<m_NPoints; j++) \n    {\n      if(m_Event)\n        {\n        m_Event->SetCurrentIteration(j+1);\n        }\n\n     TubeGraphPnt* pnt = new TubeGraphPnt(m_NDims);\n\n     pnt->m_GraphNode = (int)v[posGraphNode];\n\n     if(posR != -1)\n       {\n       pnt->m_R = v[posR];\n       }\n\n      if(posTx >= 0 && posTx<pntDim) \n        {\n        for(int r=0; r<m_NDims*m_NDims; r++)\n          {\n          pnt->m_T[r] = v[posTx+r];\n          }\n        }\n\n      m_PointList.push_back(pnt);\n    }\n\n      \n    char c = ' ';\n    while( (c!='\\n') && (!m_ReadStream->eof()))\n    {\n      c = m_ReadStream->get();\/\/ to avoid unrecognize charactere\n    }\n  }\n  \n  if(m_Event)\n    {\n    m_Event->StopReading();\n    }\n\n  return true;\n}\n\nMET_ValueEnumType MetaTubeGraph::\nElementType(void) const\n{\n  return m_ElementType;\n}\n\nvoid MetaTubeGraph::\nElementType(MET_ValueEnumType _elementType)\n{\n  m_ElementType = _elementType;\n}\n\nbool MetaTubeGraph::\nM_Write(void)\n{\n\n  if(!MetaObject::M_Write())\n  {\n    std::cout << \"MetaTubeGraph: M_Read: Error parsing file\" << std::endl;\n    return false;\n  }\n\n  \/** Then copy all tubes points *\/\n  if(m_BinaryData)\n  {\n    PointListType::const_iterator it = m_PointList.begin();\n    int elementSize;\n    MET_SizeOfType(m_ElementType, &elementSize);\n\n    char* data = new char[(m_NDims*m_NDims+2)*m_NPoints*elementSize];\n    int i=0;\n    int d;\n    while(it != m_PointList.end())\n    {\n      MET_DoubleToValue((double)(*it)->m_GraphNode,m_ElementType,data,i++);\n\n      MET_DoubleToValue((double)(*it)->m_R,m_ElementType,data,i++);  \n      \n      for(d = 0; d < m_NDims*m_NDims; d++)\n      {\n        MET_DoubleToValue((double)(*it)->m_T[d],m_ElementType,data,i++);  \n      }\n\n      it++;\n    }\n\n    m_WriteStream->write((char *)data,(m_NDims*m_NDims+2)*m_NPoints*elementSize);\n    m_WriteStream->write(\"\\n\",1);\n    delete data;\n  }\n  else\n  {\n    PointListType::const_iterator it = m_PointList.begin();\n  \n    int d;\n    while(it != m_PointList.end())\n    {\n      *m_WriteStream << (*it)->m_GraphNode << \" \";\n\n      *m_WriteStream << (*it)->m_R << \" \";\n\n      for(d = 0; d < m_NDims*m_NDims; d++)\n      {\n         *m_WriteStream << (*it)->m_T[d] << \" \";\n      }\n\n      *m_WriteStream << std::endl;\n\n      it++;\n    }\n  }\n  return true;\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ SPDX-License-Identifier: Apache-2.0\n\/\/ ----------------------------------------------------------------------------\n\/\/ Copyright 2021 Arm Limited\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\n\/\/ of the License at:\n\/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\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\n\/\/ under the License.\n\/\/ ----------------------------------------------------------------------------\n\n\/\/ This is a minimal example of using the astcenc library.\n\/\/\n\/\/ This sample shows how to include the astcenc library in your CMake project\n\/\/ as an external dependency, and how to compress and decompress images using\n\/\/ the C library API.\n\/\/\n\/\/ For sake of clarity the command line exposed by the sample is minimalistic,\n\/\/ and the compression uses a fixed set of options, but the code is commented\n\/\/ to indicate where extension would be possible. Errors handling points are\n\/\/ detected and logged, but resources are not cleaned up on error paths to keep\n\/\/ the sample control path simple, so resources will leak on error.\n\n#include <stdio.h>\n\n#include \"astcenc.h\"\n\n#define STB_IMAGE_IMPLEMENTATION\n#include \"stb_image.h\"\n\n#define STB_IMAGE_WRITE_IMPLEMENTATION\n#include \"stb_image_write.h\"\n\nint main(int argc, char **argv)\n{\n\t\/\/ Parse command line\n\tif (argc != 3)\n\t{\n\t\tprintf(\"Usage:\\n\"\n\t\t       \"   %s <source> <dest>\\n\\n\"\n\t\t       \"   <source> : Uncompressed LDR source image.\\n\"\n\t\t       \"   <dest>   : Uncompressed LDR destination image (png).\\n\"\n\t\t       , argv[0]);\n\t\treturn 1;\n\t}\n\n\t\/\/ ------------------------------------------------------------------------\n\t\/\/ For the purposes of this sample we hard-code the compressor settings\n\tstatic const unsigned int thread_count = 1;\n\tstatic const unsigned int block_x = 6;\n\tstatic const unsigned int block_y = 6;\n\tstatic const unsigned int block_z = 1;\n\tstatic const astcenc_profile profile = ASTCENC_PRF_LDR;\n\tstatic const float quality = ASTCENC_PRE_MEDIUM;\n\tstatic const astcenc_swizzle swizzle {\n\t\tASTCENC_SWZ_R, ASTCENC_SWZ_G, ASTCENC_SWZ_B, ASTCENC_SWZ_A\n\t};\n\n\t\/\/ ------------------------------------------------------------------------\n\t\/\/ Load input image, forcing 4 components\n\tint image_x, image_y, image_c;\n\tuint8_t *image_data = (uint8_t*)stbi_load(argv[1], &image_x, &image_y, &image_c, 4);\n\tif (!image_data)\n\t{\n\t\tprintf(\"Failed to load image \\\"%s\\\"\\n\", image_data);\n\t\treturn 1;\n\t}\n\n\t\/\/ Compute the number of ASTC blocks in each dimension\n\tunsigned int block_count_x = (image_x + block_x - 1) \/ block_x;\n\tunsigned int block_count_y = (image_y + block_y - 1) \/ block_y;\n\n\t\/\/ ------------------------------------------------------------------------\n\t\/\/ Initialize the default configuration for the block size and quality\n\tastcenc_config config;\n\tconfig.block_x = block_x;\n\tconfig.block_y = block_y;\n\tconfig.profile = profile;\n\n\tastcenc_error status;\n\tstatus = astcenc_config_init(profile, block_x, block_y, block_z, quality, 0, &config);\n\tif (status != ASTCENC_SUCCESS)\n\t{\n\t\tprintf(\"ERROR: Codec config init failed: %s\\n\", astcenc_get_error_string(status));\n\t\treturn 1;\n\t}\n\n\t\/\/ ... power users can customize any config settings after calling\n\t\/\/ config_init() and before calling context alloc().\n\n\t\/\/ ------------------------------------------------------------------------\n\t\/\/ Create a context based on the configuration\n\tastcenc_context* context;\n\tstatus = astcenc_context_alloc(&config, thread_count, &context);\n\tif (status != ASTCENC_SUCCESS)\n\t{\n\t\tprintf(\"ERROR: Codec context alloc failed: %s\\n\", astcenc_get_error_string(status));\n\t\treturn 1;\n\t}\n\n\t\/\/ ------------------------------------------------------------------------\n\t\/\/ Compress the image\n\tastcenc_image image;\n\timage.dim_x = image_x;\n\timage.dim_y = image_y;\n\timage.dim_z = 1;\n\timage.data_type = ASTCENC_TYPE_U8;\n\tuint8_t* slices = image_data;\n\timage.data = reinterpret_cast<void**>(&slices);\n\n\t\/\/ Space needed for 16 bytes of output per compressed block\n\tsize_t comp_len = block_count_x * block_count_y * 16;\n\tuint8_t* comp_data = new uint8_t[comp_len];\n\n\tstatus = astcenc_compress_image(context, &image, &swizzle, comp_data, comp_len, 0);\n\tif (status != ASTCENC_SUCCESS)\n\t{\n\t\tprintf(\"ERROR: Codec compress failed: %s\\n\", astcenc_get_error_string(status));\n\t\treturn 1;\n\t}\n\n\t\/\/ ... the comp_data array contains the raw compressed data you would pass\n\t\/\/ to the graphics API, or pack into a wrapper format such as a KTX file.\n\n\t\/\/ If using multithreaded compression to sequentially compress multiple\n\t\/\/ images you should reuse the same context, calling the function\n\t\/\/ astcenc_compress_reset() between each image in the series.\n\n\t\/\/ ------------------------------------------------------------------------\n\t\/\/ Decompress the image\n\t\/\/ Note we just reuse the image structure to store the output here ...\n\tstatus = astcenc_decompress_image(context, comp_data, comp_len, &image, &swizzle, 0);\n\tif (status != ASTCENC_SUCCESS)\n\t{\n\t\tprintf(\"ERROR: Codec decompress failed: %s\\n\", astcenc_get_error_string(status));\n\t\treturn 1;\n\t}\n\n\t\/\/ If using multithreaded decompression to sequentially decompress multiple\n\t\/\/ images you should reuse the same context, calling the function\n\t\/\/ astcenc_decompress_reset() between each image in the series.\n\n\t\/\/ ------------------------------------------------------------------------\n\t\/\/ Store the result back to disk\n\tstbi_write_png(argv[2], image_x, image_y, 4, image_data, 4 * image_x);\n\n\t\/\/ ------------------------------------------------------------------------\n\t\/\/ Cleanup library resources\n\tstbi_image_free(image_data);\n\tastcenc_context_free(context);\n\tdelete[] comp_data;\n\n\treturn 0;\n}\n<commit_msg>Fix example error message<commit_after>\/\/ SPDX-License-Identifier: Apache-2.0\n\/\/ ----------------------------------------------------------------------------\n\/\/ Copyright 2021 Arm Limited\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\n\/\/ of the License at:\n\/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\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\n\/\/ under the License.\n\/\/ ----------------------------------------------------------------------------\n\n\/\/ This is a minimal example of using the astcenc library.\n\/\/\n\/\/ This sample shows how to include the astcenc library in your CMake project\n\/\/ as an external dependency, and how to compress and decompress images using\n\/\/ the C library API.\n\/\/\n\/\/ For sake of clarity the command line exposed by the sample is minimalistic,\n\/\/ and the compression uses a fixed set of options, but the code is commented\n\/\/ to indicate where extension would be possible. Errors handling points are\n\/\/ detected and logged, but resources are not cleaned up on error paths to keep\n\/\/ the sample control path simple, so resources will leak on error.\n\n#include <stdio.h>\n\n#include \"astcenc.h\"\n\n#define STB_IMAGE_IMPLEMENTATION\n#include \"stb_image.h\"\n\n#define STB_IMAGE_WRITE_IMPLEMENTATION\n#include \"stb_image_write.h\"\n\nint main(int argc, char **argv)\n{\n\t\/\/ Parse command line\n\tif (argc != 3)\n\t{\n\t\tprintf(\"Usage:\\n\"\n\t\t       \"   %s <source> <dest>\\n\\n\"\n\t\t       \"   <source> : Uncompressed LDR source image.\\n\"\n\t\t       \"   <dest>   : Uncompressed LDR destination image (png).\\n\"\n\t\t       , argv[0]);\n\t\treturn 1;\n\t}\n\n\t\/\/ ------------------------------------------------------------------------\n\t\/\/ For the purposes of this sample we hard-code the compressor settings\n\tstatic const unsigned int thread_count = 1;\n\tstatic const unsigned int block_x = 6;\n\tstatic const unsigned int block_y = 6;\n\tstatic const unsigned int block_z = 1;\n\tstatic const astcenc_profile profile = ASTCENC_PRF_LDR;\n\tstatic const float quality = ASTCENC_PRE_MEDIUM;\n\tstatic const astcenc_swizzle swizzle {\n\t\tASTCENC_SWZ_R, ASTCENC_SWZ_G, ASTCENC_SWZ_B, ASTCENC_SWZ_A\n\t};\n\n\t\/\/ ------------------------------------------------------------------------\n\t\/\/ Load input image, forcing 4 components\n\tint image_x, image_y, image_c;\n\tuint8_t *image_data = (uint8_t*)stbi_load(argv[1], &image_x, &image_y, &image_c, 4);\n\tif (!image_data)\n\t{\n\t\tprintf(\"Failed to load image \\\"%s\\\"\\n\", argv[1]);\n\t\treturn 1;\n\t}\n\n\t\/\/ Compute the number of ASTC blocks in each dimension\n\tunsigned int block_count_x = (image_x + block_x - 1) \/ block_x;\n\tunsigned int block_count_y = (image_y + block_y - 1) \/ block_y;\n\n\t\/\/ ------------------------------------------------------------------------\n\t\/\/ Initialize the default configuration for the block size and quality\n\tastcenc_config config;\n\tconfig.block_x = block_x;\n\tconfig.block_y = block_y;\n\tconfig.profile = profile;\n\n\tastcenc_error status;\n\tstatus = astcenc_config_init(profile, block_x, block_y, block_z, quality, 0, &config);\n\tif (status != ASTCENC_SUCCESS)\n\t{\n\t\tprintf(\"ERROR: Codec config init failed: %s\\n\", astcenc_get_error_string(status));\n\t\treturn 1;\n\t}\n\n\t\/\/ ... power users can customize any config settings after calling\n\t\/\/ config_init() and before calling context alloc().\n\n\t\/\/ ------------------------------------------------------------------------\n\t\/\/ Create a context based on the configuration\n\tastcenc_context* context;\n\tstatus = astcenc_context_alloc(&config, thread_count, &context);\n\tif (status != ASTCENC_SUCCESS)\n\t{\n\t\tprintf(\"ERROR: Codec context alloc failed: %s\\n\", astcenc_get_error_string(status));\n\t\treturn 1;\n\t}\n\n\t\/\/ ------------------------------------------------------------------------\n\t\/\/ Compress the image\n\tastcenc_image image;\n\timage.dim_x = image_x;\n\timage.dim_y = image_y;\n\timage.dim_z = 1;\n\timage.data_type = ASTCENC_TYPE_U8;\n\tuint8_t* slices = image_data;\n\timage.data = reinterpret_cast<void**>(&slices);\n\n\t\/\/ Space needed for 16 bytes of output per compressed block\n\tsize_t comp_len = block_count_x * block_count_y * 16;\n\tuint8_t* comp_data = new uint8_t[comp_len];\n\n\tstatus = astcenc_compress_image(context, &image, &swizzle, comp_data, comp_len, 0);\n\tif (status != ASTCENC_SUCCESS)\n\t{\n\t\tprintf(\"ERROR: Codec compress failed: %s\\n\", astcenc_get_error_string(status));\n\t\treturn 1;\n\t}\n\n\t\/\/ ... the comp_data array contains the raw compressed data you would pass\n\t\/\/ to the graphics API, or pack into a wrapper format such as a KTX file.\n\n\t\/\/ If using multithreaded compression to sequentially compress multiple\n\t\/\/ images you should reuse the same context, calling the function\n\t\/\/ astcenc_compress_reset() between each image in the series.\n\n\t\/\/ ------------------------------------------------------------------------\n\t\/\/ Decompress the image\n\t\/\/ Note we just reuse the image structure to store the output here ...\n\tstatus = astcenc_decompress_image(context, comp_data, comp_len, &image, &swizzle, 0);\n\tif (status != ASTCENC_SUCCESS)\n\t{\n\t\tprintf(\"ERROR: Codec decompress failed: %s\\n\", astcenc_get_error_string(status));\n\t\treturn 1;\n\t}\n\n\t\/\/ If using multithreaded decompression to sequentially decompress multiple\n\t\/\/ images you should reuse the same context, calling the function\n\t\/\/ astcenc_decompress_reset() between each image in the series.\n\n\t\/\/ ------------------------------------------------------------------------\n\t\/\/ Store the result back to disk\n\tstbi_write_png(argv[2], image_x, image_y, 4, image_data, 4 * image_x);\n\n\t\/\/ ------------------------------------------------------------------------\n\t\/\/ Cleanup library resources\n\tstbi_image_free(image_data);\n\tastcenc_context_free(context);\n\tdelete[] comp_data;\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#ifndef __BTREE_SET_FSM_TCC__\n#define __BTREE_SET_FSM_TCC__\n\n#include \"cpu_context.hpp\"\n\n\/\/ TODO: holy shit this state machine is a fucking mess. We should\n\/\/ make it NOT write only (i.e. human beings should be able to easily\n\/\/ understand what is happening here). Needs to be redesigned (with\n\/\/ UML and all).\n\n\/\/ TODO: we should combine multiple writes into a single call to OS\n\/\/ whenever possible. Perhaps the cache should do it itself (let's\n\/\/ wait 'till we add transactions, perhaps it will be easier then).\n\n\/\/ TODO: consider B#\/B* trees to improve space efficiency\n\n\/\/ TODO: perhaps allow memory reclamation due to oversplitting? We can\n\/\/ be smart and only use a limited amount of ram for incomplete nodes\n\/\/ (doing this efficiently very tricky for high insert\n\/\/ workloads). Also, if the serializer is log-structured, we can write\n\/\/ only a small part of each node.\n\n\/\/ TODO: change rwi_write to rwi_intent followed by rwi_upgrade where\n\/\/ relevant.\n\ntemplate <class config_t>\nvoid btree_set_fsm<config_t>::init_update(btree_key *_key, byte *data, unsigned int length) {\n    keycpy(key, _key);\n    value->size = length;\n    memcpy(&value->contents, data, length);\n    state = start_transaction;\n}\n\ntemplate <class config_t>\ntypename btree_set_fsm<config_t>::transition_result_t btree_set_fsm<config_t>::do_start_transaction(event_t *event) {\n    assert(state == start_transaction);\n\n    \/* Either start a new transaction or retrieve the one we started. *\/\n    assert(transaction == NULL);\n    if (event == NULL) {\n        transaction = cache->begin_transaction(rwi_write, this);\n    } else {\n        assert(event->buf); \/\/ We shouldn't get a callback unless this is valid\n        transaction = (typename config_t::transaction_t *)event->buf;\n    }\n\n    \/* Determine our forward progress based on our new state. *\/\n    if (transaction) {\n        state = acquire_superblock;\n        return btree_fsm_t::transition_ok;\n    } else {\n        return btree_fsm_t::transition_incomplete; \/\/ Flush lock is held.\n    }\n}\n\ntemplate <class config_t>\ntypename btree_set_fsm<config_t>::transition_result_t btree_set_fsm<config_t>::do_acquire_superblock(event_t *event)\n{\n    assert(state == acquire_superblock);\n\n    if(event == NULL) {\n        \/\/ First entry into the FSM; try to grab the superblock.\n        block_id_t superblock_id = btree_fsm_t::get_cache()->get_superblock_id();\n        sb_buf = transaction->acquire(superblock_id, rwi_write, this);\n    } else {\n        \/\/ We already tried to grab the superblock, and we're getting\n        \/\/ a cache notification about it.\n        assert(event->buf);\n        sb_buf = (buf_t *)event->buf;\n    }\n\n    if(sb_buf) {\n        \/\/ Got the superblock buffer (either right away or through\n        \/\/ cache notification). Grab the root id, and move on to\n        \/\/ acquiring the root.\n        node_id = btree_fsm_t::get_root_id(sb_buf->ptr());\n        if(cache_t::is_block_id_null(node_id))\n            state = insert_root;\n        else\n            state = acquire_root;\n        return btree_fsm_t::transition_ok;\n    } else {\n        \/\/ Can't get the superblock buffer right away. Let's wait for\n        \/\/ the cache notification.\n        return btree_fsm_t::transition_incomplete;\n    }\n}\n\ntemplate <class config_t>\ntypename btree_set_fsm<config_t>::transition_result_t btree_set_fsm<config_t>::do_acquire_root(event_t *event)\n{\n    \/\/ If root didn't exist, we should have ended up in\n    \/\/ do_insert_root()\n    assert(!cache_t::is_block_id_null(node_id));\n\n    if(event == NULL) {\n        \/\/ Acquire the actual root node\n        buf = transaction->acquire(node_id, rwi_write, this);\n    } else {\n        \/\/ We already tried to acquire the root node, and here it is\n        \/\/ via the cache notification.\n        assert(event->buf);\n        buf = (buf_t *)event->buf;\n    }\n    \n    if(buf == NULL) {\n        return btree_fsm_t::transition_incomplete;\n    } else {\n        node_handler::validate((node_t *)buf->ptr());\n        state = acquire_node;\n        return btree_fsm_t::transition_ok;\n    }\n}\n\ntemplate <class config_t>\ntypename btree_set_fsm<config_t>::transition_result_t btree_set_fsm<config_t>::do_insert_root(event_t *event)\n{\n    \/\/ If this is the first time we're entering this function,\n    \/\/ allocate the root (otherwise, the root has already been\n    \/\/ allocated here, and we just need to set its id in the metadata)\n    if(cache_t::is_block_id_null(node_id)) {\n        buf = transaction->allocate(&node_id);\n        leaf_node_handler::init((leaf_node_t *)buf->ptr());\n        buf->set_dirty();\n    }\n    if(set_root_id(node_id, event)) {\n        state = acquire_node;\n        sb_buf->release();\n        sb_buf = NULL;\n        return btree_fsm_t::transition_ok;\n    } else {\n        return btree_fsm_t::transition_incomplete;\n    }\n}\n\ntemplate <class config_t>\ntypename btree_set_fsm<config_t>::transition_result_t btree_set_fsm<config_t>::do_insert_root_on_split(event_t *event)\n{\n    if(set_root_id(last_node_id, event)) {\n        state = acquire_node;\n        sb_buf->release();\n        sb_buf = NULL;\n        return btree_fsm_t::transition_ok;\n    } else {\n        return btree_fsm_t::transition_incomplete;\n    }\n}\n\ntemplate <class config_t>\ntypename btree_set_fsm<config_t>::transition_result_t btree_set_fsm<config_t>::do_acquire_node(event_t *event)\n{\n    if(event == NULL) {\n        buf = transaction->acquire(node_id, rwi_write, this);\n    } else {\n        assert(event->buf);\n        buf = (buf_t*)event->buf;\n    }\n\n    if(buf) {\n        node_handler::validate((node_t *)buf->ptr());\n        return btree_fsm_t::transition_ok;\n    }\n    else\n        return btree_fsm_t::transition_incomplete;\n}\n\ntemplate <class config_t>\ntypename btree_set_fsm<config_t>::transition_result_t btree_set_fsm<config_t>::do_transition(event_t *event)\n{\n    transition_result_t res = btree_fsm_t::transition_ok;\n\n    \/\/ Make sure we've got either an empty or a cache event\n    check(\"btree_fsm::do_transition - invalid event\", event != NULL &&\n          event->event_type != et_cache && event->event_type != et_commit);\n\n    \/\/ Update the cache with the event\n    if(event && event->event_type == et_cache) {\n        check(\"Could not complete AIO operation\",\n              event->result == 0 ||\n              event->result == -1);\n\n        check(\"btree_set_fsm::do_transition - invalid event type\", event->op != eo_read);\n    }\n\n    \/\/ First, begin a transaction.\n    if(res == btree_fsm_t::transition_ok && state == start_transaction) {\n        res = do_start_transaction(event);\n        event = NULL;\n    }\n\n    \/\/ Next, acquire the superblock (to get root node ID)\n    if(res == btree_fsm_t::transition_ok && state == acquire_superblock) {\n        assert(transaction); \/\/ We must have started our transaction by now.\n        res = do_acquire_superblock(event);\n        event = NULL;\n    }\n\n    \/\/ Then, acquire the root block (or create it if it's missing)\n    if(res == btree_fsm_t::transition_ok && (state == acquire_root || state == insert_root)) {\n        if(state == acquire_root)\n            res = do_acquire_root(event);\n        else if(state == insert_root)\n            res = do_insert_root(event);\n        event = NULL;\n    }\n\n    \/\/ If we were inserting root on split, do that\n    if(res == btree_fsm_t::transition_ok && state == insert_root_on_split) {\n        res = do_insert_root_on_split(event);\n        event = NULL;\n    }\n\n    \/\/ If we were acquiring a node, do that\n    \/\/ Go up the tree...\n    while(res == btree_fsm_t::transition_ok && state == acquire_node) {\n        if(!buf) {\n            state = acquire_node;\n            res = do_acquire_node(event);\n            event = NULL;\n            if(res != btree_fsm_t::transition_ok || state != acquire_node) {\n                break;\n            }\n        }\n\n        \/\/ Proactively split the node\n        node_t *node = (node_t *)buf->ptr();\n        bool full;\n        if (node_handler::is_leaf(node)) {\n            full = leaf_node_handler::is_full((leaf_node_t *)node, key, value);\n        } else {\n            full = internal_node_handler::is_full((internal_node_t *)node);\n        }\n        if(full) {\n            char memory[sizeof(btree_key) + MAX_KEY_SIZE];\n            btree_key *median = (btree_key *)memory;\n            buf_t *rbuf;\n            internal_node_t *last_node;\n            block_id_t rnode_id;\n            bool new_root = false;\n            split_node(buf, &rbuf, &rnode_id, median);\n            \/\/ Create a new root if we're splitting a root\n            if(last_buf == NULL) {\n                new_root = true;\n                last_buf = transaction->allocate(&last_node_id);\n                last_node = (internal_node_t *)last_buf->ptr();\n                internal_node_handler::init(last_node);\n                last_buf->set_dirty();\n            } else {\n                last_node = (internal_node_t *)last_buf->ptr();\n            }\n            bool success = internal_node_handler::insert(last_node, median, node_id, rnode_id);\n            check(\"could not insert internal btree node\", !success);\n            last_buf->set_dirty();\n                \n            \/\/ Figure out where the key goes\n            if(sized_strcmp(key->contents, key->size, median->contents, median->size) <= 0) {\n                \/\/ Left node and node are the same thing\n                rbuf->release();\n            } else {\n                buf->release();\n                buf = rbuf;\n                rbuf = NULL;\n                node = (node_t *)buf->ptr();\n                node_id = rnode_id;\n            }\n\n            if(new_root) {\n                state = insert_root_on_split;\n                res = do_insert_root_on_split(NULL);\n                if(res != btree_fsm_t::transition_ok || state != acquire_node) {\n                    break;\n                }\n            }\n        }\n\n        \/\/ Release the superblock, if we haven't already\n        if(sb_buf) {\n            sb_buf->release();\n            sb_buf = NULL;\n        }\n        \n        \/\/ Insert the value, or move up the tree\n        if(node_handler::is_leaf(node)) {\n            bool success = leaf_node_handler::insert(((leaf_node_t*)node), key, value);\n            check(\"could not insert leaf btree node\", !success);\n            buf->set_dirty();\n            buf->release();\n            state = update_complete;\n            res = btree_fsm_t::transition_ok;\n            break;\n        } else {\n            \/\/ Release and update the last node\n            if(!cache_t::is_block_id_null(last_node_id)) {\n                last_buf->release();\n            }\n            last_buf = buf;\n            last_node_id = node_id;\n                \n            \/\/ Look up the next node\n            node_id = internal_node_handler::lookup((internal_node_t*)node, key);\n            assert(!cache_t::is_block_id_null(node_id));\n            assert(node_id != cache->get_superblock_id());\n            buf = NULL;\n        }\n    }\n\n    \/\/ Finalize the operation\n    if(res == btree_fsm_t::transition_ok && state == update_complete) {\n        \/\/ Release the final node\n        if(!cache_t::is_block_id_null(last_node_id)) {\n            last_buf->release();\n            last_node_id = cache_t::null_block_id;\n        }\n\n        \/\/ End the transaction\n        bool committed = transaction->commit(this);\n        state = committing;\n        if (committed) {\n            transaction = NULL;\n            res = btree_fsm_t::transition_complete;\n        }\n        event = NULL;\n    }\n\n    \/\/ Finalize the transaction commit\n    if(res == btree_fsm_t::transition_ok && state == committing) {\n        if (event != NULL) {\n            assert(event->event_type == et_commit);\n            assert(event->buf == transaction);\n            transaction = NULL;\n            res = btree_fsm_t::transition_complete;\n        }\n    }\n\n    assert(res != btree_fsm_t::transition_complete || is_finished());\n    return res;\n}\n\ntemplate <class config_t>\nint btree_set_fsm<config_t>::set_root_id(block_id_t root_id, event_t *event) {\n    memcpy(sb_buf->ptr(), (void*)&root_id, sizeof(root_id));\n    sb_buf->set_dirty();\n    return 1;\n}\n\ntemplate <class config_t>\nvoid btree_set_fsm<config_t>::split_node(buf_t *buf, buf_t **rbuf,\n                                         block_id_t *rnode_id, btree_key *median) {\n    buf_t *res = transaction->allocate(rnode_id);\n    if(node_handler::is_leaf((node_t *)buf->ptr())) {\n    \tleaf_node_t *node = (leaf_node_t *)buf->ptr();\n        leaf_node_t *rnode = (leaf_node_t *)res->ptr();\n        leaf_node_handler::split(node, rnode, median);\n        buf->set_dirty();\n        res->set_dirty();\n    } else {\n    \tinternal_node_t *node = (internal_node_t *)buf->ptr();\n        internal_node_t *rnode = (internal_node_t *)res->ptr();\n        internal_node_handler::split(node, rnode, median);\n        buf->set_dirty();\n        res->set_dirty();\n    }\n    *rbuf = res;\n}\n\n#ifndef NDEBUG\ntemplate <class config_t>\nvoid btree_set_fsm<config_t>::deadlock_debug(void) {\n    printf(\"set-fsm %p {\\n\", this);\n    printf(\"    buf = %p\\n\", buf);\n    printf(\"    last_buf = %p\\n\", last_buf);\n    printf(\"    sb_buf = %p\\n\", sb_buf);\n    printf(\"    node_id = %d\\n\", (int)node_id);\n    printf(\"    last_node_id = %d\\n\", (int)last_node_id);\n    const char *st_name;\n    switch(state) {\n        case uninitialized: st_name = \"uninitialized\"; break;\n        case start_transaction: st_name = \"start_transaction\"; break;\n        case acquire_superblock: st_name = \"acquire_superblock\"; break;\n        case acquire_root: st_name = \"acquire_root\"; break;\n        case insert_root: st_name = \"insert_root\"; break;\n        case insert_root_on_split: st_name = \"insert_root_on_split\"; break;\n        case acquire_node: st_name = \"acquire_node\"; break;\n        case update_complete: st_name = \"update_complete\"; break;\n        case committing: st_name = \"committing\"; break;\n        default: st_name = \"WTF\"; break;\n    }\n    printf(\"    state = %s\\n\", st_name);\n    printf(\"}\\n\");\n}\n#endif\n\n#endif \/\/ __BTREE_SET_FSM_TCC__\n\n<commit_msg>Trivial changes to set_fsm; set more things to NULL after we are done with them, to make sure no bugs are hiding there.<commit_after>\n#ifndef __BTREE_SET_FSM_TCC__\n#define __BTREE_SET_FSM_TCC__\n\n#include \"cpu_context.hpp\"\n\n\/\/ TODO: holy shit this state machine is a fucking mess. We should\n\/\/ make it NOT write only (i.e. human beings should be able to easily\n\/\/ understand what is happening here). Needs to be redesigned (with\n\/\/ UML and all).\n\n\/\/ TODO: we should combine multiple writes into a single call to OS\n\/\/ whenever possible. Perhaps the cache should do it itself (let's\n\/\/ wait 'till we add transactions, perhaps it will be easier then).\n\n\/\/ TODO: consider B#\/B* trees to improve space efficiency\n\n\/\/ TODO: perhaps allow memory reclamation due to oversplitting? We can\n\/\/ be smart and only use a limited amount of ram for incomplete nodes\n\/\/ (doing this efficiently very tricky for high insert\n\/\/ workloads). Also, if the serializer is log-structured, we can write\n\/\/ only a small part of each node.\n\n\/\/ TODO: change rwi_write to rwi_intent followed by rwi_upgrade where\n\/\/ relevant.\n\ntemplate <class config_t>\nvoid btree_set_fsm<config_t>::init_update(btree_key *_key, byte *data, unsigned int length) {\n    keycpy(key, _key);\n    value->size = length;\n    memcpy(&value->contents, data, length);\n    state = start_transaction;\n}\n\ntemplate <class config_t>\ntypename btree_set_fsm<config_t>::transition_result_t btree_set_fsm<config_t>::do_start_transaction(event_t *event) {\n    assert(state == start_transaction);\n\n    \/* Either start a new transaction or retrieve the one we started. *\/\n    assert(transaction == NULL);\n    if (event == NULL) {\n        transaction = cache->begin_transaction(rwi_write, this);\n    } else {\n        assert(event->buf); \/\/ We shouldn't get a callback unless this is valid\n        transaction = (typename config_t::transaction_t *)event->buf;\n    }\n\n    \/* Determine our forward progress based on our new state. *\/\n    if (transaction) {\n        state = acquire_superblock;\n        return btree_fsm_t::transition_ok;\n    } else {\n        return btree_fsm_t::transition_incomplete; \/\/ Flush lock is held.\n    }\n}\n\ntemplate <class config_t>\ntypename btree_set_fsm<config_t>::transition_result_t btree_set_fsm<config_t>::do_acquire_superblock(event_t *event)\n{\n    assert(state == acquire_superblock);\n\n    if(event == NULL) {\n        \/\/ First entry into the FSM; try to grab the superblock.\n        block_id_t superblock_id = btree_fsm_t::get_cache()->get_superblock_id();\n        sb_buf = transaction->acquire(superblock_id, rwi_write, this);\n    } else {\n        \/\/ We already tried to grab the superblock, and we're getting\n        \/\/ a cache notification about it.\n        assert(event->buf);\n        sb_buf = (buf_t *)event->buf;\n    }\n\n    if(sb_buf) {\n        \/\/ Got the superblock buffer (either right away or through\n        \/\/ cache notification). Grab the root id, and move on to\n        \/\/ acquiring the root.\n        node_id = btree_fsm_t::get_root_id(sb_buf->ptr());\n        if(cache_t::is_block_id_null(node_id))\n            state = insert_root;\n        else\n            state = acquire_root;\n        return btree_fsm_t::transition_ok;\n    } else {\n        \/\/ Can't get the superblock buffer right away. Let's wait for\n        \/\/ the cache notification.\n        return btree_fsm_t::transition_incomplete;\n    }\n}\n\ntemplate <class config_t>\ntypename btree_set_fsm<config_t>::transition_result_t btree_set_fsm<config_t>::do_acquire_root(event_t *event)\n{\n    \/\/ If root didn't exist, we should have ended up in\n    \/\/ do_insert_root()\n    assert(!cache_t::is_block_id_null(node_id));\n\n    if(event == NULL) {\n        \/\/ Acquire the actual root node\n        buf = transaction->acquire(node_id, rwi_write, this);\n    } else {\n        \/\/ We already tried to acquire the root node, and here it is\n        \/\/ via the cache notification.\n        assert(event->buf);\n        buf = (buf_t *)event->buf;\n    }\n    \n    if(buf == NULL) {\n        return btree_fsm_t::transition_incomplete;\n    } else {\n        node_handler::validate((node_t *)buf->ptr());\n        state = acquire_node;\n        return btree_fsm_t::transition_ok;\n    }\n}\n\ntemplate <class config_t>\ntypename btree_set_fsm<config_t>::transition_result_t btree_set_fsm<config_t>::do_insert_root(event_t *event)\n{\n    \/\/ If this is the first time we're entering this function,\n    \/\/ allocate the root (otherwise, the root has already been\n    \/\/ allocated here, and we just need to set its id in the metadata)\n    if(cache_t::is_block_id_null(node_id)) {\n        buf = transaction->allocate(&node_id);\n        leaf_node_handler::init((leaf_node_t *)buf->ptr());\n        buf->set_dirty();\n    }\n    if(set_root_id(node_id, event)) {\n        state = acquire_node;\n        sb_buf->release();\n        sb_buf = NULL;\n        return btree_fsm_t::transition_ok;\n    } else {\n        return btree_fsm_t::transition_incomplete;\n    }\n}\n\ntemplate <class config_t>\ntypename btree_set_fsm<config_t>::transition_result_t btree_set_fsm<config_t>::do_insert_root_on_split(event_t *event)\n{\n    if(set_root_id(last_node_id, event)) {\n        state = acquire_node;\n        sb_buf->release();\n        sb_buf = NULL;\n        return btree_fsm_t::transition_ok;\n    } else {\n        return btree_fsm_t::transition_incomplete;\n    }\n}\n\ntemplate <class config_t>\ntypename btree_set_fsm<config_t>::transition_result_t btree_set_fsm<config_t>::do_acquire_node(event_t *event)\n{\n    if(event == NULL) {\n        buf = transaction->acquire(node_id, rwi_write, this);\n    } else {\n        assert(event->buf);\n        buf = (buf_t*)event->buf;\n    }\n\n    if(buf) {\n        node_handler::validate((node_t *)buf->ptr());\n        return btree_fsm_t::transition_ok;\n    }\n    else\n        return btree_fsm_t::transition_incomplete;\n}\n\ntemplate <class config_t>\ntypename btree_set_fsm<config_t>::transition_result_t btree_set_fsm<config_t>::do_transition(event_t *event)\n{\n    transition_result_t res = btree_fsm_t::transition_ok;\n\n    \/\/ Make sure we've got either an empty or a cache event\n    check(\"btree_fsm::do_transition - invalid event\", event != NULL &&\n          event->event_type != et_cache && event->event_type != et_commit);\n\n    \/\/ Update the cache with the event\n    if(event && event->event_type == et_cache) {\n        check(\"Could not complete AIO operation\",\n              event->result == 0 ||\n              event->result == -1);\n\n        check(\"btree_set_fsm::do_transition - invalid event type\", event->op != eo_read);\n    }\n\n    \/\/ First, begin a transaction.\n    if(res == btree_fsm_t::transition_ok && state == start_transaction) {\n        res = do_start_transaction(event);\n        event = NULL;\n    }\n\n    \/\/ Next, acquire the superblock (to get root node ID)\n    if(res == btree_fsm_t::transition_ok && state == acquire_superblock) {\n        assert(transaction); \/\/ We must have started our transaction by now.\n        res = do_acquire_superblock(event);\n        event = NULL;\n    }\n\n    \/\/ Then, acquire the root block (or create it if it's missing)\n    if(res == btree_fsm_t::transition_ok && (state == acquire_root || state == insert_root)) {\n        if(state == acquire_root)\n            res = do_acquire_root(event);\n        else if(state == insert_root)\n            res = do_insert_root(event);\n        event = NULL;\n    }\n\n    \/\/ If we were inserting root on split, do that\n    if(res == btree_fsm_t::transition_ok && state == insert_root_on_split) {\n        res = do_insert_root_on_split(event);\n        event = NULL;\n    }\n\n    \/\/ If we were acquiring a node, do that\n    \/\/ Go up the tree...\n    while(res == btree_fsm_t::transition_ok && state == acquire_node) {\n        if(!buf) {\n            state = acquire_node;\n            res = do_acquire_node(event);\n            event = NULL;\n            if(res != btree_fsm_t::transition_ok || state != acquire_node) {\n                break;\n            }\n        }\n\n        \/\/ Proactively split the node\n        node_t *node = (node_t *)buf->ptr();\n        bool full;\n        if (node_handler::is_leaf(node)) {\n            full = leaf_node_handler::is_full((leaf_node_t *)node, key, value);\n        } else {\n            full = internal_node_handler::is_full((internal_node_t *)node);\n        }\n        if(full) {\n            char memory[sizeof(btree_key) + MAX_KEY_SIZE];\n            btree_key *median = (btree_key *)memory;\n            buf_t *rbuf;\n            internal_node_t *last_node;\n            block_id_t rnode_id;\n            bool new_root = false;\n            split_node(buf, &rbuf, &rnode_id, median);\n            \/\/ Create a new root if we're splitting a root\n            if(last_buf == NULL) {\n                new_root = true;\n                last_buf = transaction->allocate(&last_node_id);\n                last_node = (internal_node_t *)last_buf->ptr();\n                internal_node_handler::init(last_node);\n                last_buf->set_dirty();\n            } else {\n                last_node = (internal_node_t *)last_buf->ptr();\n            }\n            bool success = internal_node_handler::insert(last_node, median, node_id, rnode_id);\n            check(\"could not insert internal btree node\", !success);\n            last_buf->set_dirty();\n                \n            \/\/ Figure out where the key goes\n            if(sized_strcmp(key->contents, key->size, median->contents, median->size) <= 0) {\n                \/\/ Left node and node are the same thing\n                rbuf->release();\n                rbuf = NULL;\n            } else {\n                buf->release();\n                buf = rbuf;\n                rbuf = NULL;\n                node = (node_t *)buf->ptr();\n                node_id = rnode_id;\n            }\n\n            if(new_root) {\n                state = insert_root_on_split;\n                res = do_insert_root_on_split(NULL);\n                if(res != btree_fsm_t::transition_ok || state != acquire_node) {\n                    break;\n                }\n            }\n        }\n\n        \/\/ Release the superblock, if we haven't already\n        if(sb_buf) {\n            sb_buf->release();\n            sb_buf = NULL;\n        }\n        \n        \/\/ Insert the value, or move up the tree\n        if(node_handler::is_leaf(node)) {\n            bool success = leaf_node_handler::insert(((leaf_node_t*)node), key, value);\n            check(\"could not insert leaf btree node\", !success);\n            buf->set_dirty();\n            buf->release();\n            buf = NULL;\n            state = update_complete;\n            res = btree_fsm_t::transition_ok;\n            break;\n        } else {\n            \/\/ Release and update the last node\n            if(!cache_t::is_block_id_null(last_node_id)) {\n                last_buf->release();\n                last_buf = NULL;\n            }\n            last_buf = buf;\n            buf = NULL;\n            last_node_id = node_id;\n            node_id = cache_t::null_block_id;\n                \n            \/\/ Look up the next node\n            node_id = internal_node_handler::lookup((internal_node_t*)node, key);\n            assert(!cache_t::is_block_id_null(node_id));\n            assert(node_id != cache->get_superblock_id());\n        }\n    }\n\n    \/\/ Finalize the operation\n    if(res == btree_fsm_t::transition_ok && state == update_complete) {\n        \/\/ Release the final node\n        if(!cache_t::is_block_id_null(last_node_id)) {\n            last_buf->release();\n            last_buf = NULL;\n            last_node_id = cache_t::null_block_id;\n        }\n\n        \/\/ End the transaction\n        bool committed = transaction->commit(this);\n        state = committing;\n        if (committed) {\n            transaction = NULL;\n            res = btree_fsm_t::transition_complete;\n        }\n        event = NULL;\n    }\n\n    \/\/ Finalize the transaction commit\n    if(res == btree_fsm_t::transition_ok && state == committing) {\n        if (event != NULL) {\n            assert(event->event_type == et_commit);\n            assert(event->buf == transaction);\n            transaction = NULL;\n            res = btree_fsm_t::transition_complete;\n        }\n    }\n\n    assert(res != btree_fsm_t::transition_complete || is_finished());\n    return res;\n}\n\ntemplate <class config_t>\nint btree_set_fsm<config_t>::set_root_id(block_id_t root_id, event_t *event) {\n    memcpy(sb_buf->ptr(), (void*)&root_id, sizeof(root_id));\n    sb_buf->set_dirty();\n    return 1;\n}\n\ntemplate <class config_t>\nvoid btree_set_fsm<config_t>::split_node(buf_t *buf, buf_t **rbuf,\n                                         block_id_t *rnode_id, btree_key *median) {\n    buf_t *res = transaction->allocate(rnode_id);\n    if(node_handler::is_leaf((node_t *)buf->ptr())) {\n    \tleaf_node_t *node = (leaf_node_t *)buf->ptr();\n        leaf_node_t *rnode = (leaf_node_t *)res->ptr();\n        leaf_node_handler::split(node, rnode, median);\n        buf->set_dirty();\n        res->set_dirty();\n    } else {\n    \tinternal_node_t *node = (internal_node_t *)buf->ptr();\n        internal_node_t *rnode = (internal_node_t *)res->ptr();\n        internal_node_handler::split(node, rnode, median);\n        buf->set_dirty();\n        res->set_dirty();\n    }\n    *rbuf = res;\n}\n\n#ifndef NDEBUG\ntemplate <class config_t>\nvoid btree_set_fsm<config_t>::deadlock_debug(void) {\n    printf(\"set-fsm %p {\\n\", this);\n    printf(\"    buf = %p\\n\", buf);\n    printf(\"    last_buf = %p\\n\", last_buf);\n    printf(\"    sb_buf = %p\\n\", sb_buf);\n    printf(\"    node_id = %d\\n\", (int)node_id);\n    printf(\"    last_node_id = %d\\n\", (int)last_node_id);\n    const char *st_name;\n    switch(state) {\n        case uninitialized: st_name = \"uninitialized\"; break;\n        case start_transaction: st_name = \"start_transaction\"; break;\n        case acquire_superblock: st_name = \"acquire_superblock\"; break;\n        case acquire_root: st_name = \"acquire_root\"; break;\n        case insert_root: st_name = \"insert_root\"; break;\n        case insert_root_on_split: st_name = \"insert_root_on_split\"; break;\n        case acquire_node: st_name = \"acquire_node\"; break;\n        case update_complete: st_name = \"update_complete\"; break;\n        case committing: st_name = \"committing\"; break;\n        default: st_name = \"WTF\"; break;\n    }\n    printf(\"    state = %s\\n\", st_name);\n    printf(\"}\\n\");\n}\n#endif\n\n#endif \/\/ __BTREE_SET_FSM_TCC__\n\n<|endoftext|>"}
{"text":"<commit_before>\/***\nDEVSIM\nCopyright 2013 Devsim LLC\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 \"GlobalData.hh\"\n#include \"DefaultDerivatives.hh\"\n#include \"FPECheck.hh\"\n#include \"ObjectHolder.hh\"\n\nvoid devsim_initialization()\n{\n    FPECheck::InitializeFPE();\n\n    GlobalData &gdata = GlobalData::GetInstance();\n\n    dsHelper::CreateDefaultDerivatives();\n\n    ObjectHolderMap_t features;\n    features[\"version\"] = ObjectHolder(DEVSIM_VERSION_STRING);\n    features[\"copyright\"] = ObjectHolder(u8\"Copyright © \" DEVSIM_COPYRIGHT_YEAR u8\" DEVSIM LLC\");\n#ifdef DEVSIM_EXTENDED_PRECISION\n    features[\"extended_precision\"] = ObjectHolder(true);\n#else\n    features[\"extended_precision\"] = ObjectHolder(false);\n#endif\n#ifdef USE_MKL_PARDISO\n    features[\"direct_solver\"] = ObjectHolder(\"mkl_pardiso\");\n#else\n    features[\"direct_solver\"] = ObjectHolder(\"superlu\");\n#endif\n    features[\"license\"] = ObjectHolder(\"Apache License, Version 2.0\");\n    features[\"website\"] = ObjectHolder(\"https:\/\/devsim.org\");\n    gdata.AddDBEntryOnGlobal(\"info\", ObjectHolder(features));\n}\n\n<commit_msg>fix copyright symbol<commit_after>\/***\nDEVSIM\nCopyright 2013 Devsim LLC\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 \"GlobalData.hh\"\n#include \"DefaultDerivatives.hh\"\n#include \"FPECheck.hh\"\n#include \"ObjectHolder.hh\"\n\nvoid devsim_initialization()\n{\n    FPECheck::InitializeFPE();\n\n    GlobalData &gdata = GlobalData::GetInstance();\n\n    dsHelper::CreateDefaultDerivatives();\n\n    ObjectHolderMap_t features;\n    features[\"version\"] = ObjectHolder(DEVSIM_VERSION_STRING);\n    features[\"copyright\"] = ObjectHolder(u8\"Copyright \\u00a9 \" DEVSIM_COPYRIGHT_YEAR \" DEVSIM LLC\");\n#ifdef DEVSIM_EXTENDED_PRECISION\n    features[\"extended_precision\"] = ObjectHolder(true);\n#else\n    features[\"extended_precision\"] = ObjectHolder(false);\n#endif\n#ifdef USE_MKL_PARDISO\n    features[\"direct_solver\"] = ObjectHolder(\"mkl_pardiso\");\n#else\n    features[\"direct_solver\"] = ObjectHolder(\"superlu\");\n#endif\n    features[\"license\"] = ObjectHolder(\"Apache License, Version 2.0\");\n    features[\"website\"] = ObjectHolder(\"https:\/\/devsim.org\");\n    gdata.AddDBEntryOnGlobal(\"info\", ObjectHolder(features));\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* Copyright 2012 NTNU\n*\n*   Licensed under the Apache License, Version 2.0 (the \"License\");\n*   you may not use this file except in compliance with the License.\n*   You may obtain a copy of the License at\n*\n*       http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n*\n*   Unless required by applicable law or agreed to in writing, software\n*   distributed under the License is distributed on an \"AS IS\" BASIS,\n*   WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 <Arduino.h>\n\n#include \"ComputerSerial.h\"\n\nvoid* ComputerSerial::placeHolder(uint8_t flag, uint8_t content[], uint8_t contentSize) {\n\treturn NULL;\n}\n\nComputerSerial::ComputerSerial(int baud)\n{\n    \/\/Initialize with baudrate if requested\n    if(baud != 0) begin(baud);\n}\n\nvoid ComputerSerial::begin(int baud){\n\tSerial.begin(baud);\n\n\tfor (int i = 0; i < NUM_OPCODES; ++i){\n\t\tattachFunction(i, &ComputerSerial::placeHolder);\n\t}\n}\n\nvoid ComputerSerial::commandHandler(uint8_t size, uint8_t opcode, uint8_t flag, uint8_t content[]) {\n\tswitch (opcode) {\n\t\tcase OPCODE_PING:\n\t\t\tping();\n\t\t\tbreak;\n\t\tcase OPCODE_TEXT:\n\t\t\ttext(size, flag, content);\n\t\t\tbreak;\n\t\tcase OPCODE_SENSOR:\n\t\t\tsensor(flag);\n\t\t\tbreak;\n\t\tcase OPCODE_DATA:\n\t\t\tdata(size, flag, content);\n\t\t\tbreak;\n\t\tcase OPCODE_PIN_R:\n\t\t\tpinRead(flag);\n\t\t\tbreak;\n\t\tcase OPCODE_PIN_W:\n\t\t\tpinWrite(flag, content[0]);\n\t\t\tbreak;\n        case OPCODE_DEVICE_INFO:\n            getDeviceInfo();\n            break;\n\t\tcase OPCODE_RESET:\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tbreak;\n\t}\n}\n\nvoid ComputerSerial::setDeviceName(const String &name)\n{\n    deviceName = name;\n}\n\nvoid ComputerSerial::setDeviceVersion(const String &version)\n{\n    deviceVersion = version;\n}\n\nvoid ComputerSerial::addDeviceService(const String &service, const String &pin)\n{\n    \/\/Is the first element in the JSon array? If not we need to add a comma seperator\n    if(deviceServices.length() > 0) deviceServices += \", \";\n\n    \/\/Append element to array\n    \/\/deviceServices += \"\\\"\" + service + \"\\\"\";\n\tdeviceServices += \"{\" + service + \":\\\"\" + pin + \"\\\"}\";\n\n\t\/\/ sample: {\"service\":\"pin\"}\n\n}\n\nvoid ComputerSerial::addDeviceDownloadLink(const String &link, const String &platform)\n{\n    \/\/Is the first element in the JSon array? If not we need to add a comma seperator\n    if(deviceDownloadLinks.length() > 0) deviceDownloadLinks += \", \";\n\n    \/\/Append element to array\n    \/\/deviceDownloadLinks += \"{\" + platform + \": \\\"\" + link + \"\\\"}\";\n\n\tdeviceDownloadLinks += \"{\\\"\" + platform + \"\\\": \\\"\" + link + \"\\\"}\";\n\n\t\/\/ sample: {\"platform\":\"link\"}\n}\n\nvoid ComputerSerial::getDeviceInfo(){\n    \/\/Build the device info JSON object\n    String deviceInfo;\n\n    \/\/Device name\n    \/\/deviceInfo += \"{NAME:\\\"\" + deviceName + \"\\\", \";\n\tdeviceInfo += \"{\\\"name\\\":\\\"\" + deviceName + \"\\\",\";\n\n    \/\/Device version\n    \/\/deviceInfo += \"VERSION:\\\"\" + deviceVersion + \"\\\", \";\n\tdeviceInfo += \"\\\"version\\\":\\\"\" + deviceVersion + \"\\\",\";\n\n    \/\/Device services\n    \/\/deviceInfo += \"SERVICES:[\" + deviceServices + \"], \";\n\tdeviceInfo += \"\\\"services\\\": [\" + deviceServices + \"],\";\n\n    \/\/Device links\n    \/\/deviceInfo += \"LINKS:[\" + deviceDownloadLinks + \"]}\";\n\tdeviceInfo += \"\\\"links\\\": [\" + deviceName + \"]}\";\n\n    \/\/send string representation of device info\n\tchar response[deviceInfo.length()];\n\tdeviceInfo.toCharArray(response, deviceInfo.length());\n\n    \/\/send response back\n\tack(OPCODE_DEVICE_INFO, (uint8_t*)response, deviceInfo.length());\n}\n\nvoid ComputerSerial::ack(uint8_t opcode){\n\tSerial.write(START_BYTE);\n\tSerial.write(4);\n\tSerial.write(OPCODE_RESPONSE);\n\tSerial.write(opcode);\n\tSerial.write(NULL_BYTE);\n}\n\nvoid ComputerSerial::ack(uint8_t opcode, uint8_t content[], uint8_t contentSize){\n\tSerial.write(START_BYTE);\n\tSerial.write(contentSize + 3);\n\tSerial.write(OPCODE_RESPONSE);\n\tSerial.write(opcode);\n\tfor (int i = 0; i < contentSize; ++i){\n\t\tSerial.write(content[i]);\n\t}\n}\n\nvoid ComputerSerial::ping() {\n\t\/\/ Send ping response\n\t\/\/Serial.write((byte)0x00);\n\t\/\/Serial.write((byte)0xFF);\n\tack(OPCODE_PING);\n}\n\nvoid ComputerSerial::text(uint8_t size, uint8_t flag, uint8_t content[]) {\n\t\/\/ Print content on display(flag)\n\tfunctions[OPCODE_TEXT](flag, content, size-3);\n\tack(OPCODE_TEXT);\n}\n\nvoid ComputerSerial::sensor(uint8_t number) {\n\t\/\/ Send value of sensor(number)\n\tuint8_t content[] = {};\n\tint *status = (int*)functions[OPCODE_SENSOR](number, content, 0);\n\n\tuint16_t value = *status;\n\tuint8_t replyContent[] = {value >> 8, value};\n\n\tack(OPCODE_SENSOR, replyContent, 2);\n\n\tfree(status);\n}\n\nvoid ComputerSerial::data(uint8_t size, uint8_t flag, uint8_t content[]) {\n\tfunctions[OPCODE_DATA](flag, content, size-3);\n\tack(OPCODE_DATA);\n}\n\nvoid ComputerSerial::pinRead(uint8_t pin) {\n\t\/\/ Send pin(pin) value\n\tpinMode(pin, INPUT);\n\tint value = digitalRead(pin);\n\tuint8_t content[] = {value > 0 ? 1 : 0};\n\tack(OPCODE_PIN_R, content, 1);\n}\n\nvoid ComputerSerial::pinWrite(uint8_t pin, uint8_t value) {\n\t\/\/ Set value of pin(pin)\n\tpinMode(pin, OUTPUT);\n\tdigitalWrite(pin, value ? HIGH : LOW);\n\tack(OPCODE_PIN_W);\n}\n\nvoid ComputerSerial::reset() {\n\t\/\/ Reset arduino\n}\n\nvoid ComputerSerial::attachFunction(uint8_t opcode,\n\tvoid* (*handler)(uint8_t flag, uint8_t content[], uint8_t contentSize)){\n\t\tfunctions[opcode] = handler;\n}\n\nvoid ComputerSerial::serialEvent(){\n\tstatic long time = millis();\n\tstatic int state = STATE_START;\n\n\tstatic uint8_t size = 0;\n\tstatic uint8_t opcode = 0;\n\tstatic uint8_t flag = 0;\n\tstatic uint8_t content[CONTENT_SIZE];\n\tstatic uint8_t content_counter = 0;\n\n\tif (millis() - time > TIMEOUT && state != STATE_START){\n\t\tstate = STATE_START;\n\t}\n\ttime = millis();\n\n\twhile(Serial.available()){\n\n\t\tswitch (state){\n\t\t\tcase STATE_START:\n\t\t\t\tif (Serial.read() == START_BYTE){\n\t\t\t\t\tstate = STATE_SIZE;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase STATE_SIZE:\n\t\t\t\tsize = Serial.read();\n\t\t\t\tif (size > CONTENT_SIZE + 3){\n\t\t\t\t\tstate = STATE_START;\n\t\t\t\t}\n\t\t\t\tstate = STATE_OPCODE;\n\t\t\t\tbreak;\n\t\t\tcase STATE_OPCODE:\n\t\t\t\topcode = Serial.read();\n\t\t\t\tstate = STATE_FLAG;\n\t\t\t\tbreak;\n\t\t\tcase STATE_FLAG:\n\t\t\t\tflag = Serial.read();\n\t\t\t\tstate = STATE_CONTENT;\n\t\t\t\tbreak;\n\t\t\tcase STATE_CONTENT:\n\t\t\t\tcontent[content_counter] = Serial.read();\n\t\t\t\tcontent_counter++;\n\t\t\t\tif (content_counter+3 == size) {\n\t\t\t\t\tcommandHandler(size, opcode, flag, content);\n\t\t\t\t\tcontent_counter = 0;\n\t\t\t\t\tstate = STATE_START;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t}\n\t\tbytesReceived++;\n\t}\n}\n\nunsigned int ComputerSerial::getBytesReceived(){\n\treturn bytesReceived;\n}\n<commit_msg>fixed an error when not calling setDeviceDownloadLinks<commit_after>\/*\n* Copyright 2012 NTNU\n*\n*   Licensed under the Apache License, Version 2.0 (the \"License\");\n*   you may not use this file except in compliance with the License.\n*   You may obtain a copy of the License at\n*\n*       http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n*\n*   Unless required by applicable law or agreed to in writing, software\n*   distributed under the License is distributed on an \"AS IS\" BASIS,\n*   WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 <Arduino.h>\n\n#include \"ComputerSerial.h\"\n\nvoid* ComputerSerial::placeHolder(uint8_t flag, uint8_t content[], uint8_t contentSize) {\n\treturn NULL;\n}\n\nComputerSerial::ComputerSerial(int baud)\n{\n    \/\/Initialize with baudrate if requested\n    if(baud != 0) begin(baud);\n}\n\nvoid ComputerSerial::begin(int baud){\n\tSerial.begin(baud);\n\n\tfor (int i = 0; i < NUM_OPCODES; ++i){\n\t\tattachFunction(i, &ComputerSerial::placeHolder);\n\t}\n}\n\nvoid ComputerSerial::commandHandler(uint8_t size, uint8_t opcode, uint8_t flag, uint8_t content[]) {\n\tswitch (opcode) {\n\t\tcase OPCODE_PING:\n\t\t\tping();\n\t\t\tbreak;\n\t\tcase OPCODE_TEXT:\n\t\t\ttext(size, flag, content);\n\t\t\tbreak;\n\t\tcase OPCODE_SENSOR:\n\t\t\tsensor(flag);\n\t\t\tbreak;\n\t\tcase OPCODE_DATA:\n\t\t\tdata(size, flag, content);\n\t\t\tbreak;\n\t\tcase OPCODE_PIN_R:\n\t\t\tpinRead(flag);\n\t\t\tbreak;\n\t\tcase OPCODE_PIN_W:\n\t\t\tpinWrite(flag, content[0]);\n\t\t\tbreak;\n        case OPCODE_DEVICE_INFO:\n            getDeviceInfo();\n            break;\n\t\tcase OPCODE_RESET:\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tbreak;\n\t}\n}\n\nvoid ComputerSerial::setDeviceName(const String &name)\n{\n    deviceName = name;\n}\n\nvoid ComputerSerial::setDeviceVersion(const String &version)\n{\n    deviceVersion = version;\n}\n\nvoid ComputerSerial::addDeviceService(const String &service, const String &pin)\n{\n    \/\/Is the first element in the JSon array? If not we need to add a comma seperator\n    if(deviceServices.length() > 0) deviceServices += \", \";\n\n    \/\/Append element to array\n    \/\/deviceServices += \"\\\"\" + service + \"\\\"\";\n\tdeviceServices += \"{\" + service + \":\\\"\" + pin + \"\\\"}\";\n\n\t\/\/ sample: {\"service\":\"pin\"}\n\n}\n\nvoid ComputerSerial::addDeviceDownloadLink(const String &link, const String &platform)\n{\n    \/\/Is the first element in the JSon array? If not we need to add a comma seperator\n    if(deviceDownloadLinks.length() > 0) deviceDownloadLinks += \", \";\n\n    \/\/Append element to array\n    \/\/deviceDownloadLinks += \"{\" + platform + \": \\\"\" + link + \"\\\"}\";\n\n\tdeviceDownloadLinks += \"{\\\"\" + platform + \"\\\": \\\"\" + link + \"\\\"}\";\n\n\t\/\/ sample: {\"platform\":\"link\"}\n}\n\nvoid ComputerSerial::getDeviceInfo(){\n    \/\/Build the device info JSON object\n    String deviceInfo;\n\n    \/\/Device name\n    \/\/deviceInfo += \"{NAME:\\\"\" + deviceName + \"\\\", \";\n\tdeviceInfo += \"{\\\"name\\\":\\\"\" + deviceName + \"\\\",\";\n\n    \/\/Device version\n    \/\/deviceInfo += \"VERSION:\\\"\" + deviceVersion + \"\\\", \";\n\tdeviceInfo += \"\\\"version\\\":\\\"\" + deviceVersion + \"\\\",\";\n\n    \/\/Device services\n    \/\/deviceInfo += \"SERVICES:[\" + deviceServices + \"], \";\n\tdeviceInfo += \"\\\"services\\\": [\" + deviceServices + \"],\";\n\n    \/\/Device links\n    \/\/deviceInfo += \"LINKS:[\" + deviceDownloadLinks + \"]}\";\n\tdeviceInfo += \"\\\"links\\\": [\" + deviceName + \"]\";\n\n\tdeviceInfo += \"}\";\n\n    \/\/send string representation of device info\n\tchar response[deviceInfo.length()];\n\tdeviceInfo.toCharArray(response, deviceInfo.length());\n\n    \/\/send response back\n\tack(OPCODE_DEVICE_INFO, (uint8_t*)response, deviceInfo.length());\n}\n\nvoid ComputerSerial::ack(uint8_t opcode){\n\tSerial.write(START_BYTE);\n\tSerial.write(4);\n\tSerial.write(OPCODE_RESPONSE);\n\tSerial.write(opcode);\n\tSerial.write(NULL_BYTE);\n}\n\nvoid ComputerSerial::ack(uint8_t opcode, uint8_t content[], uint8_t contentSize){\n\tSerial.write(START_BYTE);\n\tSerial.write(contentSize + 3);\n\tSerial.write(OPCODE_RESPONSE);\n\tSerial.write(opcode);\n\tfor (int i = 0; i < contentSize; ++i){\n\t\tSerial.write(content[i]);\n\t}\n}\n\nvoid ComputerSerial::ping() {\n\t\/\/ Send ping response\n\t\/\/Serial.write((byte)0x00);\n\t\/\/Serial.write((byte)0xFF);\n\tack(OPCODE_PING);\n}\n\nvoid ComputerSerial::text(uint8_t size, uint8_t flag, uint8_t content[]) {\n\t\/\/ Print content on display(flag)\n\tfunctions[OPCODE_TEXT](flag, content, size-3);\n\tack(OPCODE_TEXT);\n}\n\nvoid ComputerSerial::sensor(uint8_t number) {\n\t\/\/ Send value of sensor(number)\n\tuint8_t content[] = {};\n\tint *status = (int*)functions[OPCODE_SENSOR](number, content, 0);\n\n\tuint16_t value = *status;\n\tuint8_t replyContent[] = {value >> 8, value};\n\n\tack(OPCODE_SENSOR, replyContent, 2);\n\n\tfree(status);\n}\n\nvoid ComputerSerial::data(uint8_t size, uint8_t flag, uint8_t content[]) {\n\tfunctions[OPCODE_DATA](flag, content, size-3);\n\tack(OPCODE_DATA);\n}\n\nvoid ComputerSerial::pinRead(uint8_t pin) {\n\t\/\/ Send pin(pin) value\n\tpinMode(pin, INPUT);\n\tint value = digitalRead(pin);\n\tuint8_t content[] = {value > 0 ? 1 : 0};\n\tack(OPCODE_PIN_R, content, 1);\n}\n\nvoid ComputerSerial::pinWrite(uint8_t pin, uint8_t value) {\n\t\/\/ Set value of pin(pin)\n\tpinMode(pin, OUTPUT);\n\tdigitalWrite(pin, value ? HIGH : LOW);\n\tack(OPCODE_PIN_W);\n}\n\nvoid ComputerSerial::reset() {\n\t\/\/ Reset arduino\n}\n\nvoid ComputerSerial::attachFunction(uint8_t opcode,\n\tvoid* (*handler)(uint8_t flag, uint8_t content[], uint8_t contentSize)){\n\t\tfunctions[opcode] = handler;\n}\n\nvoid ComputerSerial::serialEvent(){\n\tstatic long time = millis();\n\tstatic int state = STATE_START;\n\n\tstatic uint8_t size = 0;\n\tstatic uint8_t opcode = 0;\n\tstatic uint8_t flag = 0;\n\tstatic uint8_t content[CONTENT_SIZE];\n\tstatic uint8_t content_counter = 0;\n\n\tif (millis() - time > TIMEOUT && state != STATE_START){\n\t\tstate = STATE_START;\n\t}\n\ttime = millis();\n\n\twhile(Serial.available()){\n\n\t\tswitch (state){\n\t\t\tcase STATE_START:\n\t\t\t\tif (Serial.read() == START_BYTE){\n\t\t\t\t\tstate = STATE_SIZE;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase STATE_SIZE:\n\t\t\t\tsize = Serial.read();\n\t\t\t\tif (size > CONTENT_SIZE + 3){\n\t\t\t\t\tstate = STATE_START;\n\t\t\t\t}\n\t\t\t\tstate = STATE_OPCODE;\n\t\t\t\tbreak;\n\t\t\tcase STATE_OPCODE:\n\t\t\t\topcode = Serial.read();\n\t\t\t\tstate = STATE_FLAG;\n\t\t\t\tbreak;\n\t\t\tcase STATE_FLAG:\n\t\t\t\tflag = Serial.read();\n\t\t\t\tstate = STATE_CONTENT;\n\t\t\t\tbreak;\n\t\t\tcase STATE_CONTENT:\n\t\t\t\tcontent[content_counter] = Serial.read();\n\t\t\t\tcontent_counter++;\n\t\t\t\tif (content_counter+3 == size) {\n\t\t\t\t\tcommandHandler(size, opcode, flag, content);\n\t\t\t\t\tcontent_counter = 0;\n\t\t\t\t\tstate = STATE_START;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t}\n\t\tbytesReceived++;\n\t}\n}\n\nunsigned int ComputerSerial::getBytesReceived(){\n\treturn bytesReceived;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"RedBlackTree.h\"\n#include <algorithm>\n#include <cassert>\n#include <iostream>\n#include <string>\n#include <utility>\n\n#define RED 'R'\n#define BLACK 'B'\n\nRbNode RBNIL = {BLACK, -1, &RBNIL, &RBNIL, &RBNIL};\n\nstatic RbNode *Next(RbNode *e) {\n  if (is_nil(e->right)) {\n    return &RBNIL;\n  }\n  RbNode *next = e->right;\n  while (not_nil(next->left)) {\n    next = next->left;\n  }\n  return next;\n}\n\nstatic RbNode *Uncle(RbNode *e) {\n  if (is_nil(e->father->father))\n    return &RBNIL;\n  if (e->father->father->left == e->father)\n    return e->father->father->right;\n  if (e->father->father->right == e->father)\n    return e->father->father->left;\n  return &RBNIL;\n}\n\nstatic bool IsLeft(RbNode *e) {\n  if (is_nil(e->father))\n    return false;\n  return e->father->left == e;\n}\n\nstatic bool IsRight(RbNode *e) {\n  if (is_nil(e->father))\n    return false;\n  return e->father->right == e;\n}\n\nstatic RbNode *Brother(RbNode *e) {\n  if (is_nil(e))\n    return &RBNIL;\n  if (IsLeft(e)) {\n    return e->father->right;\n  }\n  if (IsRight(e)) {\n    return e->father->left;\n  }\n  return &RBNIL;\n}\n\nstatic std::string DumpColor(const RbNode *e) {\n  return (is_nil(e) ? \"B\" : (e->color == BLACK ? \"B\" : \"R\"));\n}\n\nstatic void DumpNode(RbNode *e) {\n  if (is_nil(e)) {\n    std::cout << \" [nil B] RBNIL[\" << DumpColor(&RBNIL) << \"]\" << std::endl;\n  } else {\n    std::cout << \" [\" << e->value << \" \" << DumpColor(e) << \" left:\"\n              << (is_nil(e->left) ? \"nil\" : std::to_string(e->left->value))\n              << \" right:\"\n              << (is_nil(e->right) ? \"nil\" : std::to_string(e->right->value))\n              << \" father:\"\n              << (is_nil(e->father) ? \"nil\" : std::to_string(e->father->value))\n              << \"] RBNIL[\" << DumpColor(&RBNIL) << \"]\" << std::endl;\n    if (not_nil(e->left)) {\n      DumpNode(e->left);\n    }\n    if (not_nil(e->right)) {\n      DumpNode(e->right);\n    }\n  }\n}\n\nstatic void DumpTree(RbNode *root, const std::string &msg) {\n  assert(root);\n  std::cout << std::endl << std::endl << msg << std::endl;\n  DumpNode(root);\n}\n\nstatic void DumpTree(RedBlackTree *t, const std::string &msg) {\n  assert(t);\n  DumpTree(t->root, msg);\n}\n\nstatic void Free(RbNode *e) {\n  if (e == NULL || is_nil(e))\n    return;\n  Free(e->left);\n  Free(e->right);\n  delete e;\n}\n\nstatic void LeftRotate(RbNode *&root, RbNode *e) {\n  DumpTree(root, \"before left rotate e:\" + std::to_string(e->value));\n  RbNode *p = e->right;\n\n  e->right = p->left;\n  if (not_nil(p->left)) {\n    p->left->father = e;\n  }\n\n  if (not_nil(p)) {\n    p->father = e->father;\n  }\n  if (not_nil(e->father)) {\n    if (e == e->father->left) {\n      e->father->left = p;\n    } else {\n      e->father->right = p;\n    }\n  } else {\n    root = p;\n  }\n\n  p->left = e;\n  if (not_nil(e)) {\n    e->father = p;\n  }\n  DumpTree(root, \"after left rotate e:\" + std::to_string(e->value));\n}\n\nstatic void RightRotate(RbNode *&root, RbNode *e) {\n  DumpTree(root, \"before right rotate e:\" + std::to_string(e->value));\n  RbNode *p = e->left;\n\n  e->left = p->right;\n  if (not_nil(p->right)) {\n    p->right->father = e;\n  }\n\n  if (not_nil(p)) {\n    p->father = e->father;\n  }\n  if (not_nil(e->father)) {\n    if (e == e->father->right) {\n      e->father->right = p;\n    } else {\n      e->father->left = p;\n    }\n  } else {\n    root = p;\n  }\n\n  p->right = e;\n  if (not_nil(e)) {\n    e->father = p;\n  }\n  DumpTree(root, \"after right rotate e:\" + std::to_string(e->value));\n}\n\nvoid FixInsert(RbNode *&root, RbNode *e) {\n  assert(RBNIL.color == BLACK);\n  while ((e != root) && (e->father->color == RED)) {\n    \/\/ case A: e.father is e.grand_father's left child\n    if (IsLeft(e->father)) {\n      RbNode *e_uncle = Uncle(e);\n\n      \/\/ case 1: Red Uncle, e.uncle is red\n      if (e_uncle->color == RED) {\n        e->father->color = BLACK;\n        e_uncle->color = BLACK;\n        e->father->father->color = RED;\n        e = e->father->father; \/\/ next loop from e.grand_father\n\n      } else {\n        \/\/ case 2: Black Uncle, left-right-case\n        if (IsRight(e)) {\n          e = e->father;\n          LeftRotate(root, e);\n        }\n\n        \/\/ case 3: Black Uncle, left-left-case\n        e->father->color = BLACK;\n        e->father->father->color = RED;\n        RightRotate(root, e->father->father);\n      }\n    }\n\n    \/\/ case B: e.father is e.grand_father's right child\n    else {\n      RbNode *e_uncle = Uncle(e);\n\n      \/\/ case 1: Red Uncle\n      if (e_uncle->color == RED) {\n        e->father->color = BLACK;\n        e_uncle->color = BLACK;\n        e->father->father->color = RED;\n        e = e->father->father; \/\/ next loop from e.grand_father\n      } else {\n\n        \/\/ case 4: Black Uncle, left-right-case\n        if (IsLeft(e)) {\n          e = e->father;\n          RightRotate(root, e);\n        }\n\n        \/\/ case 5: Black Uncle, right-right-case\n        e->father->color = BLACK;\n        e->father->father->color = RED;\n        LeftRotate(root, e->father->father);\n      }\n    }\n  } \/\/ while\n\n  root->color = BLACK;\n}\n\nstatic void FixErase(RbNode *&root, RbNode *e) {\n  assert(RBNIL.color == BLACK);\n  while ((e != root) && (e->color == BLACK)) {\n    DumpTree(root, \"fix erase\");\n    \/\/ case A: e is left child\n    if (IsLeft(e)) {\n      RbNode *e_brother = Brother(e);\n\n      if (e_brother->color == RED) {\n        e_brother->color = BLACK;\n        e->father->color = RED;\n        LeftRotate(root, e->father);\n        e_brother = e->father->right;\n      }\n\n      if (e_brother->left->color == BLACK && e_brother->right->color == BLACK) {\n        e_brother->color = RED;\n        e = e->father;\n      } else {\n        if (e_brother->right->color == BLACK) {\n          e_brother->left->color = BLACK;\n          e_brother->color = RED;\n          RightRotate(root, e_brother);\n          e_brother = e->father->right;\n        }\n        e_brother->color = e->father->color;\n        e->father->color = BLACK;\n        e_brother->right->color = BLACK;\n        LeftRotate(root, e->father);\n        e = root; \/\/ break loop\n      }\n    }\n\n    \/\/ case B: e is right child\n    else {\n      RbNode *e_brother = Brother(e);\n\n      if (e_brother->color == RED) {\n        e_brother->color = BLACK;\n        e->father->color = RED;\n        LeftRotate(root, e->father);\n        e_brother = e->father->left;\n      }\n\n      if (e_brother->right->color == BLACK && e_brother->left->color == BLACK) {\n        e_brother->color = RED;\n        e = e->father;\n      } else {\n        if (e_brother->left->color == BLACK) {\n          e_brother->right->color = BLACK;\n          e_brother->color = RED;\n          LeftRotate(root, e_brother);\n          e_brother = e->father->left;\n        }\n        e_brother->color = e->father->color;\n        e->father->color = BLACK;\n        e_brother->left->color = BLACK;\n        RightRotate(root, e->father);\n        e = root; \/\/ break loop\n      }\n    }\n  }\n\n  e->color = BLACK;\n}\n\nstatic void Erase(RbNode *&root, RbNode *e) {\n  assert(RBNIL.color == BLACK);\n  RbNode *p, *q;\n\n  if (is_nil(e)) {\n    return;\n  }\n  if (is_nil(e->left) || is_nil(e->right)) {\n    p = e;\n  } else {\n    p = Next(e);\n  }\n\n  q = not_nil(p->left) ? p->left : p->right;\n  if (not_nil(q)) {\n    q->father = p->father;\n  }\n\n  if (not_nil(p->father)) {\n    if (IsLeft(p)) {\n      p->father->left = q;\n    } else {\n      p->father->right = q;\n    }\n  } else {\n    root = q;\n  }\n\n  if (p != e) {\n    e->value = p->value;\n  }\n  if (p->color == BLACK) {\n    FixErase(root, q);\n  }\n\n  delete p;\n}\n\nstatic RbNode *Find(RbNode *e, int value) {\n  assert(RBNIL.color == BLACK);\n  if (is_nil(e)) {\n    return &RBNIL;\n  }\n  \/\/二分查找\n  if (e->value == value) {\n    return e;\n  } else if (e->value > value) {\n    return Find(e->left, value);\n  } else {\n    return Find(e->right, value);\n  }\n}\n\nstatic RbNode *Insert(RbNode *father, RbNode *e) {\n  assert(RBNIL.color == BLACK);\n  assert(e);\n\n  if (is_nil(father)) {\n    return e;\n  }\n\n  \/\/利用二分查找找到适合value插入的位置e\n\n  if (father->value > e->value) {\n    father->left = Insert(father->left, e);\n    father->left->father = father;\n  } else if (father->value < e->value) {\n    father->right = Insert(father->right, e);\n    father->right->father = father;\n  } else {\n    assert(father->value != e->value);\n  }\n  return father;\n}\n\nRedBlackTree *RedBlackTreeNew() {\n  RedBlackTree *t = new RedBlackTree();\n  if (!t)\n    return NULL;\n  set_nil(t->root);\n  return t;\n}\n\nvoid RedBlackTreeFree(RedBlackTree *t) {\n  assert(t);\n  Free(t->root);\n  delete t;\n}\n\nvoid RedBlackTreeInsert(RedBlackTree *t, int value) {\n  assert(t);\n  assert(value >= 0);\n\n  RbNode *e = new RbNode();\n  set_nil(e->left);\n  set_nil(e->right);\n  set_nil(e->father);\n  e->color = RED; \/\/ new node is red\n  e->value = value;\n\n  t->root = Insert(t->root, e);\n  FixInsert(t->root, e);\n  assert(RBNIL.color == BLACK);\n}\n\nRbNode *RedBlackTreeFind(RedBlackTree *t, int value) {\n  return Find(t->root, value);\n}\n\nvoid RedBlackTreeErase(RedBlackTree *t, int value) {\n  RbNode *e = Find(t->root, value);\n  Erase(t->root, e);\n  DumpTree(t, \"erase\");\n  assert(RBNIL.color == BLACK);\n}\n\n<commit_msg>make code clear<commit_after>#include \"RedBlackTree.h\"\n#include <algorithm>\n#include <cassert>\n#include <iostream>\n#include <string>\n#include <utility>\n\n#define RED 'R'\n#define BLACK 'B'\n\nRbNode RBNIL = {BLACK, -1, &RBNIL, &RBNIL, &RBNIL};\n\nstatic RbNode *Next(RbNode *e) {\n  RbNode *p = e->right;\n  while (not_nil(p->left)) {\n    p = p->left;\n  }\n  return p;\n}\n\nstatic RbNode *Uncle(RbNode *e) {\n  if (e->father->father->left == e->father)\n    return e->father->father->right;\n  if (e->father->father->right == e->father)\n    return e->father->father->left;\n  assert(false);\n}\n\nstatic bool IsLeft(RbNode *e) { return e->father->left == e; }\n\nstatic bool IsRight(RbNode *e) { return e->father->right == e; }\n\nstatic RbNode *Brother(RbNode *e) {\n  if (IsLeft(e)) {\n    return e->father->right;\n  }\n  if (IsRight(e)) {\n    return e->father->left;\n  }\n  assert(false);\n}\n\nstatic std::string DumpColor(const RbNode *e) {\n  return (is_nil(e) ? \"B\" : (e->color == BLACK ? \"B\" : \"R\"));\n}\n\nstatic void DumpNode(RbNode *e) {\n  if (is_nil(e)) {\n    std::cout << \" [nil B] RBNIL[\" << DumpColor(&RBNIL) << \"]\" << std::endl;\n  } else {\n    std::cout << \" [\" << e->value << \" \" << DumpColor(e) << \" left:\"\n              << (is_nil(e->left) ? \"nil\" : std::to_string(e->left->value))\n              << \" right:\"\n              << (is_nil(e->right) ? \"nil\" : std::to_string(e->right->value))\n              << \" father:\"\n              << (is_nil(e->father) ? \"nil\" : std::to_string(e->father->value))\n              << \"] RBNIL[\" << DumpColor(&RBNIL) << \"]\" << std::endl;\n    if (not_nil(e->left)) {\n      DumpNode(e->left);\n    }\n    if (not_nil(e->right)) {\n      DumpNode(e->right);\n    }\n  }\n}\n\nstatic void DumpTree(RbNode *root, const std::string &msg) {\n  assert(root);\n  std::cout << std::endl << std::endl << msg << std::endl;\n  DumpNode(root);\n}\n\nstatic void DumpTree(RedBlackTree *t, const std::string &msg) {\n  assert(t);\n  DumpTree(t->root, msg);\n}\n\nstatic void Free(RbNode *e) {\n  if (e == NULL || is_nil(e))\n    return;\n  Free(e->left);\n  Free(e->right);\n  delete e;\n}\n\nstatic void LeftRotate(RbNode *&root, RbNode *e) {\n  DumpTree(root, \"before left rotate e:\" + std::to_string(e->value));\n  RbNode *p = e->right;\n\n  e->right = p->left;\n  if (not_nil(p->left)) {\n    p->left->father = e;\n  }\n\n  if (not_nil(p)) {\n    p->father = e->father;\n  }\n  if (not_nil(e->father)) {\n    if (e == e->father->left) {\n      e->father->left = p;\n    } else {\n      e->father->right = p;\n    }\n  } else {\n    root = p;\n  }\n\n  p->left = e;\n  if (not_nil(e)) {\n    e->father = p;\n  }\n  DumpTree(root, \"after left rotate e:\" + std::to_string(e->value));\n}\n\nstatic void RightRotate(RbNode *&root, RbNode *e) {\n  DumpTree(root, \"before right rotate e:\" + std::to_string(e->value));\n  RbNode *p = e->left;\n\n  e->left = p->right;\n  if (not_nil(p->right)) {\n    p->right->father = e;\n  }\n\n  if (not_nil(p)) {\n    p->father = e->father;\n  }\n  if (not_nil(e->father)) {\n    if (e == e->father->right) {\n      e->father->right = p;\n    } else {\n      e->father->left = p;\n    }\n  } else {\n    root = p;\n  }\n\n  p->right = e;\n  if (not_nil(e)) {\n    e->father = p;\n  }\n  DumpTree(root, \"after right rotate e:\" + std::to_string(e->value));\n}\n\nvoid FixInsert(RbNode *&root, RbNode *e) {\n  assert(RBNIL.color == BLACK);\n  while ((e != root) && (e->father->color == RED)) {\n    \/\/ case A: e.father is e.grand_father's left child\n    if (IsLeft(e->father)) {\n      RbNode *e_uncle = Uncle(e);\n\n      \/\/ case 1: Red Uncle, e.uncle is red\n      if (e_uncle->color == RED) {\n        e->father->color = BLACK;\n        e_uncle->color = BLACK;\n        e->father->father->color = RED;\n        e = e->father->father; \/\/ next loop from e.grand_father\n\n      } else {\n        \/\/ case 2: Black Uncle, left-right-case\n        if (IsRight(e)) {\n          e = e->father;\n          LeftRotate(root, e);\n        }\n\n        \/\/ case 3: Black Uncle, left-left-case\n        e->father->color = BLACK;\n        e->father->father->color = RED;\n        RightRotate(root, e->father->father);\n      }\n    }\n\n    \/\/ case B: e.father is e.grand_father's right child\n    else {\n      RbNode *e_uncle = Uncle(e);\n\n      \/\/ case 1: Red Uncle\n      if (e_uncle->color == RED) {\n        e->father->color = BLACK;\n        e_uncle->color = BLACK;\n        e->father->father->color = RED;\n        e = e->father->father; \/\/ next loop from e.grand_father\n      } else {\n\n        \/\/ case 4: Black Uncle, left-right-case\n        if (IsLeft(e)) {\n          e = e->father;\n          RightRotate(root, e);\n        }\n\n        \/\/ case 5: Black Uncle, right-right-case\n        e->father->color = BLACK;\n        e->father->father->color = RED;\n        LeftRotate(root, e->father->father);\n      }\n    }\n  } \/\/ while\n\n  root->color = BLACK;\n}\n\nstatic void FixErase(RbNode *&root, RbNode *e) {\n  assert(RBNIL.color == BLACK);\n  while ((e != root) && (e->color == BLACK)) {\n    DumpTree(root, \"fix erase\");\n    \/\/ case A: e is left child\n    if (IsLeft(e)) {\n      RbNode *e_brother = Brother(e);\n\n      if (e_brother->color == RED) {\n        e_brother->color = BLACK;\n        e->father->color = RED;\n        LeftRotate(root, e->father);\n        e_brother = e->father->right;\n      }\n\n      if (e_brother->left->color == BLACK && e_brother->right->color == BLACK) {\n        e_brother->color = RED;\n        e = e->father;\n      } else {\n        if (e_brother->right->color == BLACK) {\n          e_brother->left->color = BLACK;\n          e_brother->color = RED;\n          RightRotate(root, e_brother);\n          e_brother = e->father->right;\n        }\n        e_brother->color = e->father->color;\n        e->father->color = BLACK;\n        e_brother->right->color = BLACK;\n        LeftRotate(root, e->father);\n        e = root; \/\/ break loop\n      }\n    }\n\n    \/\/ case B: e is right child\n    else {\n      RbNode *e_brother = Brother(e);\n\n      if (e_brother->color == RED) {\n        e_brother->color = BLACK;\n        e->father->color = RED;\n        LeftRotate(root, e->father);\n        e_brother = e->father->left;\n      }\n\n      if (e_brother->right->color == BLACK && e_brother->left->color == BLACK) {\n        e_brother->color = RED;\n        e = e->father;\n      } else {\n        if (e_brother->left->color == BLACK) {\n          e_brother->right->color = BLACK;\n          e_brother->color = RED;\n          LeftRotate(root, e_brother);\n          e_brother = e->father->left;\n        }\n        e_brother->color = e->father->color;\n        e->father->color = BLACK;\n        e_brother->left->color = BLACK;\n        RightRotate(root, e->father);\n        e = root; \/\/ break loop\n      }\n    }\n  }\n\n  e->color = BLACK;\n}\n\nstatic void Erase(RbNode *&root, RbNode *e) {\n  assert(RBNIL.color == BLACK);\n  RbNode *p, *q;\n\n  if (is_nil(e)) {\n    return;\n  }\n\n  if (is_nil(e->left) || is_nil(e->right)) {\n    p = e;\n  } else {\n    p = Next(e);\n  }\n\n  if (not_nil(p->left)) {\n    q = p->left;\n  } else {\n    q = p->right;\n  }\n\n  if (not_nil(q)) {\n    q->father = p->father;\n  }\n  if (p->father) {\n    if (IsLeft(p)) {\n      p->father->left = q;\n    } else {\n      p->father->right = q;\n    }\n  } else {\n    root = q;\n  }\n\n  if (p != e) {\n    e->value = p->value;\n  }\n\n  if (p->color == BLACK) {\n    FixErase(root, q);\n  }\n\n  delete p;\n}\n\nstatic RbNode *Find(RbNode *e, int value) {\n  assert(RBNIL.color == BLACK);\n  if (is_nil(e)) {\n    return &RBNIL;\n  }\n  \/\/二分查找\n  if (e->value == value) {\n    return e;\n  } else if (e->value > value) {\n    return Find(e->left, value);\n  } else {\n    return Find(e->right, value);\n  }\n}\n\nstatic RbNode *Insert(RbNode *father, RbNode *e) {\n  assert(RBNIL.color == BLACK);\n  assert(e);\n\n  if (is_nil(father)) {\n    return e;\n  }\n\n  \/\/利用二分查找找到适合value插入的位置e\n\n  if (father->value > e->value) {\n    father->left = Insert(father->left, e);\n    father->left->father = father;\n  } else if (father->value < e->value) {\n    father->right = Insert(father->right, e);\n    father->right->father = father;\n  } else {\n    assert(father->value != e->value);\n  }\n  return father;\n}\n\nRedBlackTree *RedBlackTreeNew() {\n  RedBlackTree *t = new RedBlackTree();\n  if (!t)\n    return NULL;\n  set_nil(t->root);\n  return t;\n}\n\nvoid RedBlackTreeFree(RedBlackTree *t) {\n  assert(t);\n  Free(t->root);\n  delete t;\n}\n\nvoid RedBlackTreeInsert(RedBlackTree *t, int value) {\n  assert(t);\n  assert(value >= 0);\n\n  RbNode *e = new RbNode();\n  set_nil(e->left);\n  set_nil(e->right);\n  set_nil(e->father);\n  e->color = RED; \/\/ new node is red\n  e->value = value;\n\n  t->root = Insert(t->root, e);\n  FixInsert(t->root, e);\n  assert(RBNIL.color == BLACK);\n}\n\nRbNode *RedBlackTreeFind(RedBlackTree *t, int value) {\n  return Find(t->root, value);\n}\n\nvoid RedBlackTreeErase(RedBlackTree *t, int value) {\n  RbNode *e = Find(t->root, value);\n  Erase(t->root, e);\n  DumpTree(t, \"erase\");\n  assert(RBNIL.color == BLACK);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ ======================================================================== \/\/\n\/\/ Copyright 2009-2018 Intel Corporation                                    \/\/\n\/\/                                                                          \/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");          \/\/\n\/\/ you may not use this file except in compliance with the License.         \/\/\n\/\/ You may obtain a copy of the License at                                  \/\/\n\/\/                                                                          \/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0                           \/\/\n\/\/                                                                          \/\/\n\/\/ Unless required by applicable law or agreed to in writing, software      \/\/\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,        \/\/\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. \/\/\n\/\/ See the License for the specific language governing permissions and      \/\/\n\/\/ limitations under the License.                                           \/\/\n\/\/ ======================================================================== \/\/\n\n#include \"SceneGraph.h\"\n\n#include \"visitor\/VerifyNodes.h\"\n\nnamespace ospray {\n  namespace sg {\n\n    Frame::Frame()\n    {\n      createChild(\"frameBuffer\", \"FrameBuffer\");\n      createChild(\"camera\", \"PerspectiveCamera\");\n      createChild(\"renderer\", \"Renderer\");\n\n      createChild(\"frameAccumulationLimit\", \"int\", -1);\n    }\n\n    std::string Frame::toString() const\n    {\n      return \"ospray::sg::Frame\";\n    }\n\n    void Frame::preCommit(RenderContext &)\n    {\n      if (child(\"camera\").hasChild(\"aspect\") &&\n          child(\"frameBuffer\")[\"size\"].lastModified() >\n          child(\"camera\")[\"aspect\"].lastCommitted()) {\n        auto fbSize = child(\"frameBuffer\")[\"size\"].valueAs<vec2i>();\n        child(\"camera\")[\"aspect\"] = fbSize.x \/ float(fbSize.y);\n      }\n\n      auto rendererNode = child(\"renderer\").nodeAs<Renderer>();\n      rendererNode->updateRenderer();\n\n      auto rHandle = rendererNode->valueAs<OSPRenderer>();\n      auto cHandle = child(\"camera\").valueAs<OSPCamera>();\n      auto fHandle = child(\"frameBuffer\").valueAs<OSPFrameBuffer>();\n\n      bool newRenderer = currentRenderer != rHandle;\n      bool newCamera = currentCamera != cHandle;\n      bool newFB = currentFB != fHandle;\n\n      if (newRenderer)\n        currentRenderer = rHandle;\n\n      if (newCamera)\n        currentCamera = cHandle;\n\n      if (newFB)\n        currentFB = fHandle;\n\n      if (newRenderer || newCamera)\n        ospSetObject(rHandle, \"camera\", cHandle);\n\n      bool rChanged = rendererNode->subtreeModifiedButNotCommitted();\n      bool cChanged = child(\"camera\").subtreeModifiedButNotCommitted();\n\n      clearFB = newFB || newCamera || newRenderer || rChanged || cChanged;\n\n      frameAccumulationLimit = child(\"frameAccumulationLimit\").valueAs<int>();\n    }\n\n    void Frame::postCommit(RenderContext &)\n    {\n      if (clearFB) {\n        ospFrameBufferClear(\n          child(\"frameBuffer\").valueAs<OSPFrameBuffer>(),\n          OSP_FB_COLOR | OSP_FB_ACCUM\n        );\n\n        clearFB = false;\n        numAccumulatedFrames = 0;\n      }\n    }\n\n    void Frame::renderFrame(bool verifyCommit)\n    {\n      auto rendererNode = child(\"renderer\").nodeAs<Renderer>();\n      auto fbNode = child(\"frameBuffer\").nodeAs<FrameBuffer>();\n\n      if (verifyCommit) {\n        Node::traverse(VerifyNodes{});\n        commit();\n      }\n\n      traverse(\"render\");\n\n      const bool limitAccumulation  = frameAccumulationLimit >= 0;\n      const bool accumBudgetReached =\n          frameAccumulationLimit <= numAccumulatedFrames;\n\n      if (!limitAccumulation || !accumBudgetReached) {\n        rendererNode->renderFrame(fbNode);\n        numAccumulatedFrames++;\n      }\n    }\n\n    OSPPickResult Frame::pick(const vec2f &pickPos)\n    {\n      auto rendererNode = child(\"renderer\").nodeAs<Renderer>();\n      return rendererNode->pick(pickPos);\n    }\n\n    float Frame::getLastVariance() const\n    {\n      auto rendererNode = child(\"renderer\").nodeAs<Renderer>();\n      return rendererNode->getLastVariance();\n    }\n\n    OSP_REGISTER_SG_NODE(Frame);\n\n  } \/\/ ::ospray::sg\n} \/\/ ::ospray\n<commit_msg>Use sg::Framebuffer for clearing<commit_after>\/\/ ======================================================================== \/\/\n\/\/ Copyright 2009-2018 Intel Corporation                                    \/\/\n\/\/                                                                          \/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");          \/\/\n\/\/ you may not use this file except in compliance with the License.         \/\/\n\/\/ You may obtain a copy of the License at                                  \/\/\n\/\/                                                                          \/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0                           \/\/\n\/\/                                                                          \/\/\n\/\/ Unless required by applicable law or agreed to in writing, software      \/\/\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,        \/\/\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. \/\/\n\/\/ See the License for the specific language governing permissions and      \/\/\n\/\/ limitations under the License.                                           \/\/\n\/\/ ======================================================================== \/\/\n\n#include \"SceneGraph.h\"\n\n#include \"visitor\/VerifyNodes.h\"\n\nnamespace ospray {\n  namespace sg {\n\n    Frame::Frame()\n    {\n      createChild(\"frameBuffer\", \"FrameBuffer\");\n      createChild(\"camera\", \"PerspectiveCamera\");\n      createChild(\"renderer\", \"Renderer\");\n\n      createChild(\"frameAccumulationLimit\", \"int\", -1);\n    }\n\n    std::string Frame::toString() const\n    {\n      return \"ospray::sg::Frame\";\n    }\n\n    void Frame::preCommit(RenderContext &)\n    {\n      if (child(\"camera\").hasChild(\"aspect\") &&\n          child(\"frameBuffer\")[\"size\"].lastModified() >\n          child(\"camera\")[\"aspect\"].lastCommitted()) {\n        auto fbSize = child(\"frameBuffer\")[\"size\"].valueAs<vec2i>();\n        child(\"camera\")[\"aspect\"] = fbSize.x \/ float(fbSize.y);\n      }\n\n      auto rendererNode = child(\"renderer\").nodeAs<Renderer>();\n      rendererNode->updateRenderer();\n\n      auto rHandle = rendererNode->valueAs<OSPRenderer>();\n      auto cHandle = child(\"camera\").valueAs<OSPCamera>();\n      auto fHandle = child(\"frameBuffer\").valueAs<OSPFrameBuffer>();\n\n      bool newRenderer = currentRenderer != rHandle;\n      bool newCamera = currentCamera != cHandle;\n      bool newFB = currentFB != fHandle;\n\n      if (newRenderer)\n        currentRenderer = rHandle;\n\n      if (newCamera)\n        currentCamera = cHandle;\n\n      if (newFB)\n        currentFB = fHandle;\n\n      if (newRenderer || newCamera)\n        ospSetObject(rHandle, \"camera\", cHandle);\n\n      bool rChanged = rendererNode->subtreeModifiedButNotCommitted();\n      bool cChanged = child(\"camera\").subtreeModifiedButNotCommitted();\n\n      clearFB = newFB || newCamera || newRenderer || rChanged || cChanged;\n\n      frameAccumulationLimit = child(\"frameAccumulationLimit\").valueAs<int>();\n    }\n\n    void Frame::postCommit(RenderContext &)\n    {\n      if (clearFB) {\n        child(\"frameBuffer\").nodeAs<FrameBuffer>()->clear();\n\n        clearFB = false;\n        numAccumulatedFrames = 0;\n      }\n    }\n\n    void Frame::renderFrame(bool verifyCommit)\n    {\n      auto rendererNode = child(\"renderer\").nodeAs<Renderer>();\n      auto fbNode = child(\"frameBuffer\").nodeAs<FrameBuffer>();\n\n      if (verifyCommit) {\n        Node::traverse(VerifyNodes{});\n        commit();\n      }\n\n      traverse(\"render\");\n\n      const bool limitAccumulation  = frameAccumulationLimit >= 0;\n      const bool accumBudgetReached =\n          frameAccumulationLimit <= numAccumulatedFrames;\n\n      if (!limitAccumulation || !accumBudgetReached) {\n        rendererNode->renderFrame(fbNode);\n        numAccumulatedFrames++;\n      }\n    }\n\n    OSPPickResult Frame::pick(const vec2f &pickPos)\n    {\n      auto rendererNode = child(\"renderer\").nodeAs<Renderer>();\n      return rendererNode->pick(pickPos);\n    }\n\n    float Frame::getLastVariance() const\n    {\n      auto rendererNode = child(\"renderer\").nodeAs<Renderer>();\n      return rendererNode->getLastVariance();\n    }\n\n    OSP_REGISTER_SG_NODE(Frame);\n\n  } \/\/ ::ospray::sg\n} \/\/ ::ospray\n<|endoftext|>"}
{"text":"<commit_before>#include \"SceneLoader.hpp\"\n#include <assert.h>\n#include <cstring>\nWARN_GUARD_ON\n#include <rapidjson\/document.h>\nWARN_GUARD_OFF\n\nSceneFile SceneLoader::Load(const Buffer& data)\n{\n    \/\/ Less verbose usage\n    using namespace rapidjson;\n\n    \/\/ Convert it to std::string containter\n    std::string json(std::begin(data), std::end(data));\n\n    \/\/ The scene file object to be filled\n    SceneFile sc = {};\n\n    \/\/ Parse the json file\n    Document doc;\n    doc.Parse(json.c_str());\n\n    \/\/ Root\n    assert(doc.IsObject());\n\n    \/\/ Id parse helper\n    auto parseId = [](Value& v) -> SceneFile::Id { return SceneFile::Id { v.GetUint(), true }; };\n\n    \/\/ Parse metadata\n    if(doc.HasMember(\"metadata\"))\n    {\n        Value& metadata = doc[\"metadata\"];\n        assert(metadata.IsObject());\n\n        \/\/ Version\n        if(metadata.HasMember(\"version\"))\n        {\n            Value& version = metadata[\"version\"];\n            sc.metadata.version = std::to_string(version.GetDouble());\n        }\n\n        \/\/ Type\n        if(metadata.HasMember(\"type\"))\n        {\n            Value& type = metadata[\"type\"];\n            sc.metadata.type = type.GetString();\n        }\n\n        \/\/ Generator\n        if(metadata.HasMember(\"generator\"))\n        {\n            Value& generator = metadata[\"generator\"];\n            sc.metadata.generator = generator.GetString();\n        }\n    }\n\n    \/\/ Parse geometries\n    if(doc.HasMember(\"geometries\"))\n    {\n        Value& geometries = doc[\"geometries\"];\n        assert(geometries.IsArray());\n\n        for(SizeType i = 0; i < geometries.Size(); ++i)\n        {\n            \/\/ Parse geometry\n            Value& g = geometries[i];\n            SceneFile::Geometry gd = {};\n\n            \/\/ Id\n            gd.id = parseId(g[\"id\"]);\n\n            \/\/ Type\n            gd.type = g[\"type\"].GetString();\n\n            \/\/ Url\n            gd.url = g[\"url\"].GetString();\n\n            \/\/ Add parsed geometry to the list\n            sc.geometries.push_back(gd);\n        }\n    }\n\n    \/\/ Parse images\n    if(doc.HasMember(\"images\"))\n    {\n        Value& images = doc[\"images\"];\n        assert(images.IsArray());\n\n        for(SizeType i = 0; i < images.Size(); ++i)\n        {\n            \/\/ Parse image\n            Value& im = images[i];\n            SceneFile::Image img = {};\n\n            \/\/ Id\n            img.id = parseId(im[\"id\"]);\n\n            \/\/ Url\n            img.url = im[\"url\"].GetString();\n\n            \/\/ Add parsed image to the list\n            sc.images.push_back(img);\n        }\n    }\n\n    \/\/ Helper\n    auto parseColor = [](std::uint32_t v) -> SceneFile::Color\n    {\n        SceneFile::Color col = {};\n        col.r = (v >> 0) & 0xFF;\n        col.g = (v >> 8) & 0xFF;\n        col.b = (v >> 16) & 0xFF;\n        col.a = (v >> 24) & 0xFF;\n        return col;\n    };\n\n    \/\/ Parse textures\n    if(doc.HasMember(\"textures\"))\n    {\n        Value& textures = doc[\"textures\"];\n        assert(textures.IsArray());\n\n        for(SizeType i = 0; i < textures.Size(); ++i)\n        {\n            \/\/ Parse texture\n            Value& t = textures[i];\n            SceneFile::Texture tex = {};\n\n            \/\/ Id\n            tex.id = parseId(t[\"id\"]);\n\n            \/\/ Image\n            tex.image = parseId(t[\"image\"]);\n\n            \/\/ WrapMode\n            if(t.HasMember(\"wrap\"))\n            {\n                Value& wrap = t[\"wrap\"];\n                assert(wrap.IsArray());\n                for(SizeType j = 0; j < wrap.Size(); ++j)\n                {\n                    std::string curWrap = wrap[j].GetString();\n                    SceneFile::Texture::WrapMode wm;\n                    if (curWrap == \"clampToEdge\")\n                        wm = SceneFile::Texture::WrapMode::ClampToEdge;\n                    else if (curWrap == \"clampToBorder\")\n                        wm = SceneFile::Texture::WrapMode::ClampToBorder;\n                    else if (curWrap == \"mirroredRepeat\")\n                        wm = SceneFile::Texture::WrapMode::MirroredRepeat;\n                    else if (curWrap == \"repeat\")\n                        wm = SceneFile::Texture::WrapMode::Repeat;\n                    tex.wrap.push_back(wm);\n                }\n            }\n\n            \/\/ BorderColor\n            if(t.HasMember(\"borderColor\"))\n                tex.borderColor = parseColor(t[\"borderColor\"].GetInt());\n\n            \/\/ Add parsed texture to the list\n            sc.textures.push_back(tex);\n        }\n    }\n\n    \/\/ Parse materials\n    if(doc.HasMember(\"materials\"))\n    {\n        Value& materials = doc[\"materials\"];\n        assert(materials.IsArray());\n\n        for (SizeType i = 0; i < materials.Size(); ++i)\n        {\n            \/\/ Parse material\n            Value& m = materials[i];\n            SceneFile::Material mt = {};\n\n            \/\/ Id\n            mt.id = parseId(m[\"id\"]);\n\n            \/\/ Name\n            if(m.HasMember(\"name\"))\n                mt.name = m[\"name\"].GetString();\n\n            \/\/ Type\n            mt.type = m[\"type\"].GetString();\n\n            \/\/ Colors\n            if(m.HasMember(\"color\"))\n                mt.color = parseColor(m[\"color\"].GetInt());\n            if (m.HasMember(\"ambient\"))\n                mt.ambient = parseColor(m[\"ambient\"].GetInt());\n            if (m.HasMember(\"emissive\"))\n                mt.emissive = parseColor(m[\"emissive\"].GetInt());\n            if (m.HasMember(\"specular\"))\n                mt.specular = parseColor(m[\"specular\"].GetInt());\n            if (m.HasMember(\"shininess\"))\n                mt.shininess = static_cast<float>(m[\"shininess\"].GetDouble());\n\n            \/\/ Opacity\n            if (m.HasMember(\"opacity\"))\n                mt.opacity = static_cast<float>(m[\"opacity\"].GetDouble());\n\n            \/\/ Transparent\n            if (m.HasMember(\"transparent\"))\n                mt.transparent = m[\"transparent\"].GetBool();\n\n            \/\/ Wireframe\n            if (m.HasMember(\"wireframe\"))\n                mt.wireframe = m[\"wireframe\"].GetBool();\n\n            \/\/ Map\n            mt.map.valid = false;\n            if (m.HasMember(\"map\"))\n                mt.map = parseId(m[\"map\"]);\n\n            \/\/ SpecMap\n            mt.specMap.valid = false;\n            if (m.HasMember(\"specMap\"))\n                mt.specMap = parseId(m[\"specMap\"]);\n\n            \/\/ Nmap\n            mt.nmap.valid = false;\n            if(m.HasMember(\"nmap\"))\n                mt.nmap = parseId(m[\"nmap\"]);\n\n            \/\/ Add parsed material to the list\n            sc.materials.push_back(mt);\n        }\n    }\n\n    \/\/ Parse root object\n    if(doc.HasMember(\"object\"))\n    {\n        Value& object = doc[\"object\"];\n\n        \/\/ Id\n        sc.object.id = parseId(object[\"id\"]);\n\n        \/\/ Type\n        sc.object.type = object[\"type\"].GetString();\n\n        \/\/ Helpers\n        auto parseTransform = [](Value& t) -> SceneFile::Object::Transform\n        {\n            SceneFile::Object::Transform transform = {};\n            transform.scale = glm::vec3(1.0f);\n\n            \/\/ Position\n            if (t.HasMember(\"position\"))\n            {\n                Value& pos = t[\"position\"];\n                assert(pos.IsArray());\n                transform.position.x = static_cast<float>(pos[0].GetDouble());\n                transform.position.y = static_cast<float>(pos[1].GetDouble());\n                transform.position.z = static_cast<float>(pos[2].GetDouble());\n            }\n\n            \/\/ Scale\n            if (t.HasMember(\"scale\"))\n            {\n                Value& sc = t[\"scale\"];\n                assert(sc.IsArray());\n                transform.scale.x = static_cast<float>(sc[0].GetDouble());\n                transform.scale.y = static_cast<float>(sc[1].GetDouble());\n                transform.scale.z = static_cast<float>(sc[2].GetDouble());\n            }\n\n            \/\/ Rotation\n            if (t.HasMember(\"rotation\"))\n            {\n                Value& rot = t[\"rotation\"];\n                transform.rotation.x = static_cast<float>(rot[0].GetDouble());\n                transform.rotation.y = static_cast<float>(rot[1].GetDouble());\n                transform.rotation.z = static_cast<float>(rot[2].GetDouble());\n            }\n            return transform;\n        };\n\n        \/\/ Transform\n        sc.object.transform = parseTransform(object[\"transform\"]);\n\n        \/\/ Children\n        Value& children = object[\"children\"];\n        assert(children.IsArray());\n\n        for (SizeType i = 0; i < children.Size(); ++i)\n        {\n            Value& child = children[i];\n            SceneFile::Object::Child ch;\n\n            \/\/ Id\n            ch.id = parseId(child[\"id\"]);\n\n            \/\/ Type\n            ch.type = child[\"type\"].GetString();\n\n            \/\/ Name\n            ch.name = child[\"name\"].GetString();\n\n            \/\/ Matrix\n            ch.transform = parseTransform(child[\"transform\"]);\n\n            \/\/ Geometry\n            if (child.HasMember(\"geometry\"))\n                ch.geometry = parseId(child[\"geometry\"]);\n\n            \/\/ Material\n            if (child.HasMember(\"materials\"))\n            {\n                Value& mats = child[\"materials\"];\n                assert(mats.IsArray());\n\n                ch.materials.resize(mats.Size());\n                for (SizeType j = 0; j < mats.Size(); ++j)\n                {\n                    Value& mat = mats[j];\n                    ch.materials[j] = parseId(mat);\n                }\n            }\n\n            \/\/ Add to list\n            sc.object.children.push_back(ch);\n        }\n    }\n\n    return sc;\n}\n<commit_msg>Fixed SceneLoader parsing color etries as signed instead of unsigned values<commit_after>#include \"SceneLoader.hpp\"\n#include <assert.h>\n#include <cstring>\nWARN_GUARD_ON\n#include <rapidjson\/document.h>\nWARN_GUARD_OFF\n\nSceneFile SceneLoader::Load(const Buffer& data)\n{\n    \/\/ Less verbose usage\n    using namespace rapidjson;\n\n    \/\/ Convert it to std::string containter\n    std::string json(std::begin(data), std::end(data));\n\n    \/\/ The scene file object to be filled\n    SceneFile sc = {};\n\n    \/\/ Parse the json file\n    Document doc;\n    doc.Parse(json.c_str());\n\n    \/\/ Root\n    assert(doc.IsObject());\n\n    \/\/ Id parse helper\n    auto parseId = [](Value& v) -> SceneFile::Id { return SceneFile::Id { v.GetUint(), true }; };\n\n    \/\/ Parse metadata\n    if(doc.HasMember(\"metadata\"))\n    {\n        Value& metadata = doc[\"metadata\"];\n        assert(metadata.IsObject());\n\n        \/\/ Version\n        if(metadata.HasMember(\"version\"))\n        {\n            Value& version = metadata[\"version\"];\n            sc.metadata.version = std::to_string(version.GetDouble());\n        }\n\n        \/\/ Type\n        if(metadata.HasMember(\"type\"))\n        {\n            Value& type = metadata[\"type\"];\n            sc.metadata.type = type.GetString();\n        }\n\n        \/\/ Generator\n        if(metadata.HasMember(\"generator\"))\n        {\n            Value& generator = metadata[\"generator\"];\n            sc.metadata.generator = generator.GetString();\n        }\n    }\n\n    \/\/ Parse geometries\n    if(doc.HasMember(\"geometries\"))\n    {\n        Value& geometries = doc[\"geometries\"];\n        assert(geometries.IsArray());\n\n        for(SizeType i = 0; i < geometries.Size(); ++i)\n        {\n            \/\/ Parse geometry\n            Value& g = geometries[i];\n            SceneFile::Geometry gd = {};\n\n            \/\/ Id\n            gd.id = parseId(g[\"id\"]);\n\n            \/\/ Type\n            gd.type = g[\"type\"].GetString();\n\n            \/\/ Url\n            gd.url = g[\"url\"].GetString();\n\n            \/\/ Add parsed geometry to the list\n            sc.geometries.push_back(gd);\n        }\n    }\n\n    \/\/ Parse images\n    if(doc.HasMember(\"images\"))\n    {\n        Value& images = doc[\"images\"];\n        assert(images.IsArray());\n\n        for(SizeType i = 0; i < images.Size(); ++i)\n        {\n            \/\/ Parse image\n            Value& im = images[i];\n            SceneFile::Image img = {};\n\n            \/\/ Id\n            img.id = parseId(im[\"id\"]);\n\n            \/\/ Url\n            img.url = im[\"url\"].GetString();\n\n            \/\/ Add parsed image to the list\n            sc.images.push_back(img);\n        }\n    }\n\n    \/\/ Helper\n    auto parseColor = [](std::uint32_t v) -> SceneFile::Color\n    {\n        SceneFile::Color col = {};\n        col.r = (v >> 0) & 0xFF;\n        col.g = (v >> 8) & 0xFF;\n        col.b = (v >> 16) & 0xFF;\n        col.a = (v >> 24) & 0xFF;\n        return col;\n    };\n\n    \/\/ Parse textures\n    if(doc.HasMember(\"textures\"))\n    {\n        Value& textures = doc[\"textures\"];\n        assert(textures.IsArray());\n\n        for(SizeType i = 0; i < textures.Size(); ++i)\n        {\n            \/\/ Parse texture\n            Value& t = textures[i];\n            SceneFile::Texture tex = {};\n\n            \/\/ Id\n            tex.id = parseId(t[\"id\"]);\n\n            \/\/ Image\n            tex.image = parseId(t[\"image\"]);\n\n            \/\/ WrapMode\n            if(t.HasMember(\"wrap\"))\n            {\n                Value& wrap = t[\"wrap\"];\n                assert(wrap.IsArray());\n                for(SizeType j = 0; j < wrap.Size(); ++j)\n                {\n                    std::string curWrap = wrap[j].GetString();\n                    SceneFile::Texture::WrapMode wm;\n                    if (curWrap == \"clampToEdge\")\n                        wm = SceneFile::Texture::WrapMode::ClampToEdge;\n                    else if (curWrap == \"clampToBorder\")\n                        wm = SceneFile::Texture::WrapMode::ClampToBorder;\n                    else if (curWrap == \"mirroredRepeat\")\n                        wm = SceneFile::Texture::WrapMode::MirroredRepeat;\n                    else if (curWrap == \"repeat\")\n                        wm = SceneFile::Texture::WrapMode::Repeat;\n                    tex.wrap.push_back(wm);\n                }\n            }\n\n            \/\/ BorderColor\n            if(t.HasMember(\"borderColor\"))\n                tex.borderColor = parseColor(t[\"borderColor\"].GetUint());\n\n            \/\/ Add parsed texture to the list\n            sc.textures.push_back(tex);\n        }\n    }\n\n    \/\/ Parse materials\n    if(doc.HasMember(\"materials\"))\n    {\n        Value& materials = doc[\"materials\"];\n        assert(materials.IsArray());\n\n        for (SizeType i = 0; i < materials.Size(); ++i)\n        {\n            \/\/ Parse material\n            Value& m = materials[i];\n            SceneFile::Material mt = {};\n\n            \/\/ Id\n            mt.id = parseId(m[\"id\"]);\n\n            \/\/ Name\n            if(m.HasMember(\"name\"))\n                mt.name = m[\"name\"].GetString();\n\n            \/\/ Type\n            mt.type = m[\"type\"].GetString();\n\n            \/\/ Colors\n            if(m.HasMember(\"color\"))\n                mt.color = parseColor(m[\"color\"].GetUint());\n            if (m.HasMember(\"ambient\"))\n                mt.ambient = parseColor(m[\"ambient\"].GetUint());\n            if (m.HasMember(\"emissive\"))\n                mt.emissive = parseColor(m[\"emissive\"].GetUint());\n            if (m.HasMember(\"specular\"))\n                mt.specular = parseColor(m[\"specular\"].GetUint());\n            if (m.HasMember(\"shininess\"))\n                mt.shininess = static_cast<float>(m[\"shininess\"].GetDouble());\n\n            \/\/ Opacity\n            if (m.HasMember(\"opacity\"))\n                mt.opacity = static_cast<float>(m[\"opacity\"].GetDouble());\n\n            \/\/ Transparent\n            if (m.HasMember(\"transparent\"))\n                mt.transparent = m[\"transparent\"].GetBool();\n\n            \/\/ Wireframe\n            if (m.HasMember(\"wireframe\"))\n                mt.wireframe = m[\"wireframe\"].GetBool();\n\n            \/\/ Map\n            mt.map.valid = false;\n            if (m.HasMember(\"map\"))\n                mt.map = parseId(m[\"map\"]);\n\n            \/\/ SpecMap\n            mt.specMap.valid = false;\n            if (m.HasMember(\"specMap\"))\n                mt.specMap = parseId(m[\"specMap\"]);\n\n            \/\/ Nmap\n            mt.nmap.valid = false;\n            if(m.HasMember(\"nmap\"))\n                mt.nmap = parseId(m[\"nmap\"]);\n\n            \/\/ Add parsed material to the list\n            sc.materials.push_back(mt);\n        }\n    }\n\n    \/\/ Parse root object\n    if(doc.HasMember(\"object\"))\n    {\n        Value& object = doc[\"object\"];\n\n        \/\/ Id\n        sc.object.id = parseId(object[\"id\"]);\n\n        \/\/ Type\n        sc.object.type = object[\"type\"].GetString();\n\n        \/\/ Helpers\n        auto parseTransform = [](Value& t) -> SceneFile::Object::Transform\n        {\n            SceneFile::Object::Transform transform = {};\n            transform.scale = glm::vec3(1.0f);\n\n            \/\/ Position\n            if (t.HasMember(\"position\"))\n            {\n                Value& pos = t[\"position\"];\n                assert(pos.IsArray());\n                transform.position.x = static_cast<float>(pos[0].GetDouble());\n                transform.position.y = static_cast<float>(pos[1].GetDouble());\n                transform.position.z = static_cast<float>(pos[2].GetDouble());\n            }\n\n            \/\/ Scale\n            if (t.HasMember(\"scale\"))\n            {\n                Value& sc = t[\"scale\"];\n                assert(sc.IsArray());\n                transform.scale.x = static_cast<float>(sc[0].GetDouble());\n                transform.scale.y = static_cast<float>(sc[1].GetDouble());\n                transform.scale.z = static_cast<float>(sc[2].GetDouble());\n            }\n\n            \/\/ Rotation\n            if (t.HasMember(\"rotation\"))\n            {\n                Value& rot = t[\"rotation\"];\n                transform.rotation.x = static_cast<float>(rot[0].GetDouble());\n                transform.rotation.y = static_cast<float>(rot[1].GetDouble());\n                transform.rotation.z = static_cast<float>(rot[2].GetDouble());\n            }\n            return transform;\n        };\n\n        \/\/ Transform\n        sc.object.transform = parseTransform(object[\"transform\"]);\n\n        \/\/ Children\n        Value& children = object[\"children\"];\n        assert(children.IsArray());\n\n        for (SizeType i = 0; i < children.Size(); ++i)\n        {\n            Value& child = children[i];\n            SceneFile::Object::Child ch;\n\n            \/\/ Id\n            ch.id = parseId(child[\"id\"]);\n\n            \/\/ Type\n            ch.type = child[\"type\"].GetString();\n\n            \/\/ Name\n            ch.name = child[\"name\"].GetString();\n\n            \/\/ Matrix\n            ch.transform = parseTransform(child[\"transform\"]);\n\n            \/\/ Geometry\n            if (child.HasMember(\"geometry\"))\n                ch.geometry = parseId(child[\"geometry\"]);\n\n            \/\/ Material\n            if (child.HasMember(\"materials\"))\n            {\n                Value& mats = child[\"materials\"];\n                assert(mats.IsArray());\n\n                ch.materials.resize(mats.Size());\n                for (SizeType j = 0; j < mats.Size(); ++j)\n                {\n                    Value& mat = mats[j];\n                    ch.materials[j] = parseId(mat);\n                }\n            }\n\n            \/\/ Add to list\n            sc.object.children.push_back(ch);\n        }\n    }\n\n    return sc;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2016 Tom Barthel-Steer\n\/\/ http:\/\/www.tomsteer.net\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 \"multiuniverse.h\"\n#include \"ui_multiuniverse.h\"\n\n#include <QCheckBox>\n#include <QSpinBox>\n#include <QComboBox>\n#include <QLabel>\n#include \"sacneffectengine.h\"\n#include \"preferences.h\"\n#include \"consts.h\"\n\nMultiUniverse::MultiUniverse(QWidget *parent) :\n    QWidget(parent),\n    ui(new Ui::MultiUniverse)\n{\n    ui->setupUi(this);\n}\n\nMultiUniverse::~MultiUniverse()\n{\n    delete ui;\n\n    while (m_fxEngines.size())\n    {\n       m_fxEngines.front()->deleteLater();\n       m_fxEngines.removeFirst();\n    }\n\n    while (m_senders.size())\n    {\n       m_senders.front()->stopSending();\n       m_senders.front()->deleteLater();\n       m_senders.removeFirst();\n    }\n}\n\n\nvoid MultiUniverse::on_btnAddRow_pressed()\n{\n    int row = ui->tableWidget->rowCount();\n    ui->tableWidget->setRowCount(row+1);\n\n    int nextUniverse = 1;\n    if(m_senders.count()>0)\n        nextUniverse = m_senders.last()->universe() + 1;\n\n    m_senders.append(new sACNSentUniverse(nextUniverse));\n    m_fxEngines.append(new sACNEffectEngine());\n    m_fxEngines.last()->setSender(m_senders.last());\n    m_fxEngines.last()->setStartAddress(MIN_DMX_ADDRESS-1);\n    m_fxEngines.last()->setEndAddress(MAX_DMX_ADDRESS-1);\n    m_fxEngines.last()->setMode(sACNEffectEngine::FxManual);\n    m_fxEngines.last()->start();\n    {\n        QString name = Preferences::getInstance()->GetDefaultTransmitName();\n        QString postfix = tr(\"_%1\").arg(nextUniverse);\n        name.truncate(MAX_SOURCE_NAME_LEN - postfix.length());\n        m_senders.last()->setName(name.trimmed() + postfix);\n    }\n\n    QCheckBox *enableBox = new QCheckBox(this);\n    enableBox->setStyleSheet(\"margin-left:50%; margin-right:50%;\");\n    enableBox->setChecked(m_senders.last()->isSending());\n    ui->tableWidget->setCellWidget(row, COL_ENABLED, enableBox);\n    m_widgetToFxEngine[enableBox] = m_fxEngines.last();\n    m_widgetToSender[enableBox] = m_senders.last();\n    connect(enableBox, SIGNAL(toggled(bool)), this, SLOT(enableChanged(bool)));\n    connect(enableBox, SIGNAL(destroyed(QObject*)), this, SLOT(removeWidgetFromIndex(QObject*)));\n\n\n    QSpinBox *sb = new QSpinBox(this);\n    sb->setMinimum(MIN_SACN_UNIVERSE);\n    sb->setMaximum(MAX_SACN_UNIVERSE);\n    sb->setValue(m_senders.last()->universe());\n    ui->tableWidget->setCellWidget(row, COL_UNIVERSE, sb);\n    m_widgetToFxEngine[sb] = m_fxEngines.last();\n    m_widgetToSender[sb] = m_senders.last();\n    connect(sb, SIGNAL(valueChanged(int)), this, SLOT(universeChanged(int)));\n    connect(sb, SIGNAL(destroyed(QObject*)), this, SLOT(removeWidgetFromIndex(QObject*)));\n\n    sb = new QSpinBox(this);\n    sb->setMinimum(MIN_DMX_ADDRESS);\n    sb->setMaximum(MAX_DMX_ADDRESS);\n    sb->setValue(MIN_DMX_ADDRESS);\n    ui->tableWidget->setCellWidget(row, COL_STARTADDR, sb);\n    m_widgetToFxEngine[sb] = m_fxEngines.last();\n    m_widgetToSender[sb] = m_senders.last();\n    connect(sb, SIGNAL(valueChanged(int)), this, SLOT(startChanged(int)));\n    connect(sb, SIGNAL(destroyed(QObject*)), this, SLOT(removeWidgetFromIndex(QObject*)));\n\n    sb = new QSpinBox(this);\n    sb->setMinimum(MIN_DMX_ADDRESS);\n    sb->setMaximum(MAX_DMX_ADDRESS);\n    sb->setValue(MAX_DMX_ADDRESS);\n    ui->tableWidget->setCellWidget(row, COL_ENDADDR, sb);\n    m_widgetToFxEngine[sb] = m_fxEngines.last();\n    m_widgetToSender[sb] = m_senders.last();\n    connect(sb, SIGNAL(valueChanged(int)), this, SLOT(endChanged(int)));\n    connect(sb, SIGNAL(destroyed(QObject*)), this, SLOT(removeWidgetFromIndex(QObject*)));\n\n\n    sb = new QSpinBox(this);\n    sb->setMinimum(MIN_SACN_PRIORITY);\n    sb->setMaximum(MAX_SACN_PRIORITY);\n    sb->setValue(m_senders.last()->perSourcePriority());\n    ui->tableWidget->setCellWidget(row, COL_PRIORITY, sb);\n    connect(sb, SIGNAL(valueChanged(int)), this, SLOT(priorityChanged(int)));\n    m_widgetToFxEngine[sb] = m_fxEngines.last();\n    m_widgetToSender[sb] = m_senders.last();\n\n    QComboBox *cb = new QComboBox(this);\n    cb->addItems(FX_MODE_DESCRIPTIONS);\n    \/\/cb->setCurrentIndex(m_sourceInfo.last().effect);\n    ui->tableWidget->setCellWidget(row, COL_EFFECT, cb);\n    m_widgetToFxEngine[cb] = m_fxEngines.last();\n    m_widgetToSender[cb] = m_senders.last();\n\n    connect(cb, SIGNAL(currentIndexChanged(int)), this, SLOT(fxChanged(int)));\n    connect(cb, SIGNAL(destroyed(QObject*)), this, SLOT(removeWidgetFromIndex(QObject*)));\n\n    setupControl(row, sACNEffectEngine::FxManual);\n\n    QTableWidgetItem *item = new QTableWidgetItem(m_senders.last()->name());\n    ui->tableWidget->setItem(row, COL_NAME, item);\n\n}\n\nvoid MultiUniverse::removeWidgetFromIndex(QObject *o)\n{\n    QWidget *w = dynamic_cast<QWidget *>(o);\n    m_widgetToFxEngine.remove(w);\n    m_widgetToSender.remove(w);\n}\n\nvoid MultiUniverse::on_btnRemoveRow_pressed()\n{\n    int row = ui->tableWidget->currentRow();\n    if (row == -1) return;\n    ui->tableWidget->removeRow(row);\n    m_fxEngines[row]->deleteLater();\n    m_senders[row]->deleteLater();\n    m_fxEngines.removeAt(row);\n    m_senders.removeAt(row);\n}\n\n\nvoid MultiUniverse::universeChanged(int value)\n{\n    QWidget *w = dynamic_cast<QWidget *>(sender());\n    if(m_widgetToSender.contains(w))\n    {\n        sACNSentUniverse *u = m_widgetToSender.value(w);\n        u->setUniverse(value);\n    }\n}\n\nvoid MultiUniverse::priorityChanged(int value)\n{\n    QWidget *w = dynamic_cast<QWidget *>(sender());\n    if(m_widgetToSender.contains(w))\n    {\n        sACNSentUniverse *u = m_widgetToSender.value(w);\n        u->setPerSourcePriority(value);\n    }\n}\n\nvoid MultiUniverse::startChanged(int value)\n{\n    QWidget *w = dynamic_cast<QWidget *>(sender());\n    if(m_widgetToFxEngine.contains(w))\n    {\n        sACNEffectEngine *e = m_widgetToFxEngine.value(w);\n        e->setStartAddress(value-1);\n    }\n}\n\nvoid MultiUniverse::endChanged(int value)\n{\n    QWidget *w = dynamic_cast<QWidget *>(sender());\n    if(m_widgetToFxEngine.contains(w))\n    {\n        sACNEffectEngine *e = m_widgetToFxEngine.value(w);\n        e->setEndAddress(value-1);\n    }\n}\n\nvoid MultiUniverse::fxChanged(int value)\n{\n    QWidget *w = dynamic_cast<QWidget *>(sender());\n    if(m_widgetToFxEngine.contains(w))\n    {\n        sACNEffectEngine *e = m_widgetToFxEngine.value(w);\n        e->setMode((sACNEffectEngine::FxMode)value);\n\n        int index = m_fxEngines.indexOf(e);\n\n        setupControl(index, (sACNEffectEngine::FxMode)value);\n    }\n}\n\nvoid MultiUniverse::enableChanged(bool enable)\n{\n    QWidget *w = dynamic_cast<QWidget *>(sender());\n    if(m_widgetToSender.contains(w))\n    {\n        sACNSentUniverse *u = m_widgetToSender.value(w);\n\n        if(enable)\n            u->startSending();\n        else\n            u->stopSending();\n    }\n}\n\nvoid MultiUniverse::setupControl(int row, sACNEffectEngine::FxMode mode)\n{\n    switch(mode)\n    {\n    case sACNEffectEngine::FxManual:\n        {\n        QWidget *controlWidget = new QWidget(this);\n        QLabel *controlLabel = new QLabel(\"0\", controlWidget);\n        QSlider *slider = new QSlider(Qt::Horizontal, controlWidget);\n        slider->setMinimum(MIN_SACN_LEVEL);\n        slider->setMaximum(MAX_SACN_LEVEL);\n        m_widgetToLevelLabel[slider] = controlLabel;\n        QHBoxLayout *controlLayout = new QHBoxLayout();\n        controlLayout->setMargin(0);\n        controlLayout->addWidget(controlLabel);\n        controlLayout->addWidget(slider);\n        controlWidget->setLayout(controlLayout);\n        ui->tableWidget->setCellWidget(row, COL_CONTROL, controlWidget);\n        m_widgetToFxEngine[slider] = m_fxEngines[row];\n        m_widgetToSender[slider] = m_senders[row];\n        connect(slider, SIGNAL(destroyed(QObject*)), this, SLOT(removeWidgetFromIndex(QObject*)));\n        connect(slider, SIGNAL(valueChanged(int)), this, SLOT(controlSliderMoved(int)));\n        }\n        break;\n\n    case sACNEffectEngine::FxChase:\n    case sACNEffectEngine::FxRamp:\n    case sACNEffectEngine::FxSinewave:\n        {\n        QWidget *controlWidget = new QWidget(this);\n        QLabel *slowerLabel = new QLabel(tr(\"Slower\"), controlWidget);\n        QLabel *fasterLabel = new QLabel(tr(\"Faster\"), controlWidget);\n        QSlider *slider = new QSlider(Qt::Horizontal, controlWidget);\n        slider->setMinimum(1);\n        slider->setMaximum(500);\n        slider->setValue(m_fxEngines[row]->rate());\n        QHBoxLayout *controlLayout = new QHBoxLayout();\n        controlLayout->setMargin(0);\n        controlLayout->addWidget(slowerLabel);\n        controlLayout->addWidget(slider);\n        controlLayout->addWidget(fasterLabel);\n        controlWidget->setLayout(controlLayout);\n        ui->tableWidget->setCellWidget(row, COL_CONTROL, controlWidget);\n        m_widgetToFxEngine[slider] = m_fxEngines[row];\n        m_widgetToSender[slider] = m_senders[row];\n        connect(controlWidget, SIGNAL(destroyed(QObject*)), this, SLOT(removeWidgetFromIndex(QObject*)));\n        connect(slider, SIGNAL(valueChanged(int)), this, SLOT(controlSliderMoved(int)));\n        }\n        break;\n    case sACNEffectEngine::FxDate:\n        {\n        QComboBox *cb = new QComboBox(this);\n        cb->addItem(tr(\"EU Date Style\"));\n        cb->addItem(tr(\"US Date Style\"));\n        ui->tableWidget->setCellWidget(row, COL_CONTROL, cb);\n        m_widgetToFxEngine[cb] = m_fxEngines[row];\n        m_widgetToSender[cb] = m_senders[row];\n        connect(cb, SIGNAL(destroyed(QObject*)), this, SLOT(removeWidgetFromIndex(QObject*)));\n        connect(cb, SIGNAL(currentIndexChanged(int)), this, SLOT(controlComboChanged(int)));\n        }\n        break;\n    case sACNEffectEngine::FxText:\n        {\n        ui->tableWidget->setCellWidget(row, COL_CONTROL, nullptr);\n        QTableWidgetItem *item = new QTableWidgetItem(m_fxEngines[row]->text());\n        ui->tableWidget->setItem(row, COL_CONTROL, item);\n        m_fxEngines[row]->setRate(1);\n        }\n        break;\n    default:\n        break;\n    }\n\n}\n\nvoid MultiUniverse::controlSliderMoved(int value)\n{\n    QWidget *w = dynamic_cast<QWidget *>(sender());\n    if(m_widgetToFxEngine.contains(w))\n    {\n        sACNEffectEngine *e = m_widgetToFxEngine[w];\n        if(e->mode() == sACNEffectEngine::FxManual)\n        {\n            e->setManualLevel(value);\n            m_widgetToLevelLabel[w]->setText(Preferences::getInstance()->GetFormattedValue(value));\n        }\n        else\n            e->setRate(value);\n    }\n}\n\nvoid MultiUniverse::controlComboChanged(int value)\n{\n\n    QWidget *w = dynamic_cast<QWidget *>(sender());\n    if(m_widgetToFxEngine.contains(w))\n    {\n        sACNEffectEngine *e = m_widgetToFxEngine[w];\n\n        if(value==0)\n            e->setDateStyle(sACNEffectEngine::dsEU);\n        else\n            e->setDateStyle(sACNEffectEngine::dsUSA);\n    }\n}\n\nvoid MultiUniverse::on_tableWidget_cellChanged(int row, int column)\n{\n    if(column==COL_NAME)\n    {\n        if(ui->tableWidget->item(row, column))\n            m_senders[row]->setName(ui->tableWidget->item(row, column)->text());\n    }\n    if(column==COL_CONTROL)\n    {\n        if(ui->tableWidget->item(row, column))\n            m_fxEngines[row]->setText(ui->tableWidget->item(row, column)->text());\n    }\n}\n\n<commit_msg>Closeing multiuniverse could affect other TX windows<commit_after>\/\/ Copyright 2016 Tom Barthel-Steer\n\/\/ http:\/\/www.tomsteer.net\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF 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 \"multiuniverse.h\"\n#include \"ui_multiuniverse.h\"\n\n#include <QCheckBox>\n#include <QSpinBox>\n#include <QComboBox>\n#include <QLabel>\n#include \"sacneffectengine.h\"\n#include \"preferences.h\"\n#include \"consts.h\"\n\nMultiUniverse::MultiUniverse(QWidget *parent) :\n    QWidget(parent),\n    ui(new Ui::MultiUniverse)\n{\n    ui->setupUi(this);\n}\n\nMultiUniverse::~MultiUniverse()\n{\n    delete ui;\n\n    while (m_fxEngines.size())\n    {\n       m_fxEngines.front()->deleteLater();\n       m_fxEngines.removeFirst();\n    }\n\n    while (m_senders.size())\n    {\n       m_senders.front()->deleteLater();\n       m_senders.removeFirst();\n    }\n}\n\n\nvoid MultiUniverse::on_btnAddRow_pressed()\n{\n    int row = ui->tableWidget->rowCount();\n    ui->tableWidget->setRowCount(row+1);\n\n    int nextUniverse = 1;\n    if(m_senders.count()>0)\n        nextUniverse = m_senders.last()->universe() + 1;\n\n    m_senders.append(new sACNSentUniverse(nextUniverse));\n    m_fxEngines.append(new sACNEffectEngine());\n    m_fxEngines.last()->setSender(m_senders.last());\n    m_fxEngines.last()->setStartAddress(MIN_DMX_ADDRESS-1);\n    m_fxEngines.last()->setEndAddress(MAX_DMX_ADDRESS-1);\n    m_fxEngines.last()->setMode(sACNEffectEngine::FxManual);\n    m_fxEngines.last()->start();\n    {\n        QString name = Preferences::getInstance()->GetDefaultTransmitName();\n        QString postfix = tr(\"_%1\").arg(nextUniverse);\n        name.truncate(MAX_SOURCE_NAME_LEN - postfix.length());\n        m_senders.last()->setName(name.trimmed() + postfix);\n    }\n\n    QCheckBox *enableBox = new QCheckBox(this);\n    enableBox->setStyleSheet(\"margin-left:50%; margin-right:50%;\");\n    enableBox->setChecked(m_senders.last()->isSending());\n    ui->tableWidget->setCellWidget(row, COL_ENABLED, enableBox);\n    m_widgetToFxEngine[enableBox] = m_fxEngines.last();\n    m_widgetToSender[enableBox] = m_senders.last();\n    connect(enableBox, SIGNAL(toggled(bool)), this, SLOT(enableChanged(bool)));\n    connect(enableBox, SIGNAL(destroyed(QObject*)), this, SLOT(removeWidgetFromIndex(QObject*)));\n\n\n    QSpinBox *sb = new QSpinBox(this);\n    sb->setMinimum(MIN_SACN_UNIVERSE);\n    sb->setMaximum(MAX_SACN_UNIVERSE);\n    sb->setValue(m_senders.last()->universe());\n    ui->tableWidget->setCellWidget(row, COL_UNIVERSE, sb);\n    m_widgetToFxEngine[sb] = m_fxEngines.last();\n    m_widgetToSender[sb] = m_senders.last();\n    connect(sb, SIGNAL(valueChanged(int)), this, SLOT(universeChanged(int)));\n    connect(sb, SIGNAL(destroyed(QObject*)), this, SLOT(removeWidgetFromIndex(QObject*)));\n\n    sb = new QSpinBox(this);\n    sb->setMinimum(MIN_DMX_ADDRESS);\n    sb->setMaximum(MAX_DMX_ADDRESS);\n    sb->setValue(MIN_DMX_ADDRESS);\n    ui->tableWidget->setCellWidget(row, COL_STARTADDR, sb);\n    m_widgetToFxEngine[sb] = m_fxEngines.last();\n    m_widgetToSender[sb] = m_senders.last();\n    connect(sb, SIGNAL(valueChanged(int)), this, SLOT(startChanged(int)));\n    connect(sb, SIGNAL(destroyed(QObject*)), this, SLOT(removeWidgetFromIndex(QObject*)));\n\n    sb = new QSpinBox(this);\n    sb->setMinimum(MIN_DMX_ADDRESS);\n    sb->setMaximum(MAX_DMX_ADDRESS);\n    sb->setValue(MAX_DMX_ADDRESS);\n    ui->tableWidget->setCellWidget(row, COL_ENDADDR, sb);\n    m_widgetToFxEngine[sb] = m_fxEngines.last();\n    m_widgetToSender[sb] = m_senders.last();\n    connect(sb, SIGNAL(valueChanged(int)), this, SLOT(endChanged(int)));\n    connect(sb, SIGNAL(destroyed(QObject*)), this, SLOT(removeWidgetFromIndex(QObject*)));\n\n\n    sb = new QSpinBox(this);\n    sb->setMinimum(MIN_SACN_PRIORITY);\n    sb->setMaximum(MAX_SACN_PRIORITY);\n    sb->setValue(m_senders.last()->perSourcePriority());\n    ui->tableWidget->setCellWidget(row, COL_PRIORITY, sb);\n    connect(sb, SIGNAL(valueChanged(int)), this, SLOT(priorityChanged(int)));\n    m_widgetToFxEngine[sb] = m_fxEngines.last();\n    m_widgetToSender[sb] = m_senders.last();\n\n    QComboBox *cb = new QComboBox(this);\n    cb->addItems(FX_MODE_DESCRIPTIONS);\n    \/\/cb->setCurrentIndex(m_sourceInfo.last().effect);\n    ui->tableWidget->setCellWidget(row, COL_EFFECT, cb);\n    m_widgetToFxEngine[cb] = m_fxEngines.last();\n    m_widgetToSender[cb] = m_senders.last();\n\n    connect(cb, SIGNAL(currentIndexChanged(int)), this, SLOT(fxChanged(int)));\n    connect(cb, SIGNAL(destroyed(QObject*)), this, SLOT(removeWidgetFromIndex(QObject*)));\n\n    setupControl(row, sACNEffectEngine::FxManual);\n\n    QTableWidgetItem *item = new QTableWidgetItem(m_senders.last()->name());\n    ui->tableWidget->setItem(row, COL_NAME, item);\n\n}\n\nvoid MultiUniverse::removeWidgetFromIndex(QObject *o)\n{\n    QWidget *w = dynamic_cast<QWidget *>(o);\n    m_widgetToFxEngine.remove(w);\n    m_widgetToSender.remove(w);\n}\n\nvoid MultiUniverse::on_btnRemoveRow_pressed()\n{\n    int row = ui->tableWidget->currentRow();\n    if (row == -1) return;\n    ui->tableWidget->removeRow(row);\n    m_fxEngines[row]->deleteLater();\n    m_senders[row]->deleteLater();\n    m_fxEngines.removeAt(row);\n    m_senders.removeAt(row);\n}\n\n\nvoid MultiUniverse::universeChanged(int value)\n{\n    QWidget *w = dynamic_cast<QWidget *>(sender());\n    if(m_widgetToSender.contains(w))\n    {\n        sACNSentUniverse *u = m_widgetToSender.value(w);\n        u->setUniverse(value);\n    }\n}\n\nvoid MultiUniverse::priorityChanged(int value)\n{\n    QWidget *w = dynamic_cast<QWidget *>(sender());\n    if(m_widgetToSender.contains(w))\n    {\n        sACNSentUniverse *u = m_widgetToSender.value(w);\n        u->setPerSourcePriority(value);\n    }\n}\n\nvoid MultiUniverse::startChanged(int value)\n{\n    QWidget *w = dynamic_cast<QWidget *>(sender());\n    if(m_widgetToFxEngine.contains(w))\n    {\n        sACNEffectEngine *e = m_widgetToFxEngine.value(w);\n        e->setStartAddress(value-1);\n    }\n}\n\nvoid MultiUniverse::endChanged(int value)\n{\n    QWidget *w = dynamic_cast<QWidget *>(sender());\n    if(m_widgetToFxEngine.contains(w))\n    {\n        sACNEffectEngine *e = m_widgetToFxEngine.value(w);\n        e->setEndAddress(value-1);\n    }\n}\n\nvoid MultiUniverse::fxChanged(int value)\n{\n    QWidget *w = dynamic_cast<QWidget *>(sender());\n    if(m_widgetToFxEngine.contains(w))\n    {\n        sACNEffectEngine *e = m_widgetToFxEngine.value(w);\n        e->setMode((sACNEffectEngine::FxMode)value);\n\n        int index = m_fxEngines.indexOf(e);\n\n        setupControl(index, (sACNEffectEngine::FxMode)value);\n    }\n}\n\nvoid MultiUniverse::enableChanged(bool enable)\n{\n    QWidget *w = dynamic_cast<QWidget *>(sender());\n    if(m_widgetToSender.contains(w))\n    {\n        sACNSentUniverse *u = m_widgetToSender.value(w);\n\n        if(enable)\n            u->startSending();\n        else\n            u->stopSending();\n    }\n}\n\nvoid MultiUniverse::setupControl(int row, sACNEffectEngine::FxMode mode)\n{\n    switch(mode)\n    {\n    case sACNEffectEngine::FxManual:\n        {\n        QWidget *controlWidget = new QWidget(this);\n        QLabel *controlLabel = new QLabel(\"0\", controlWidget);\n        QSlider *slider = new QSlider(Qt::Horizontal, controlWidget);\n        slider->setMinimum(MIN_SACN_LEVEL);\n        slider->setMaximum(MAX_SACN_LEVEL);\n        m_widgetToLevelLabel[slider] = controlLabel;\n        QHBoxLayout *controlLayout = new QHBoxLayout();\n        controlLayout->setMargin(0);\n        controlLayout->addWidget(controlLabel);\n        controlLayout->addWidget(slider);\n        controlWidget->setLayout(controlLayout);\n        ui->tableWidget->setCellWidget(row, COL_CONTROL, controlWidget);\n        m_widgetToFxEngine[slider] = m_fxEngines[row];\n        m_widgetToSender[slider] = m_senders[row];\n        connect(slider, SIGNAL(destroyed(QObject*)), this, SLOT(removeWidgetFromIndex(QObject*)));\n        connect(slider, SIGNAL(valueChanged(int)), this, SLOT(controlSliderMoved(int)));\n        }\n        break;\n\n    case sACNEffectEngine::FxChase:\n    case sACNEffectEngine::FxRamp:\n    case sACNEffectEngine::FxSinewave:\n        {\n        QWidget *controlWidget = new QWidget(this);\n        QLabel *slowerLabel = new QLabel(tr(\"Slower\"), controlWidget);\n        QLabel *fasterLabel = new QLabel(tr(\"Faster\"), controlWidget);\n        QSlider *slider = new QSlider(Qt::Horizontal, controlWidget);\n        slider->setMinimum(1);\n        slider->setMaximum(500);\n        slider->setValue(m_fxEngines[row]->rate());\n        QHBoxLayout *controlLayout = new QHBoxLayout();\n        controlLayout->setMargin(0);\n        controlLayout->addWidget(slowerLabel);\n        controlLayout->addWidget(slider);\n        controlLayout->addWidget(fasterLabel);\n        controlWidget->setLayout(controlLayout);\n        ui->tableWidget->setCellWidget(row, COL_CONTROL, controlWidget);\n        m_widgetToFxEngine[slider] = m_fxEngines[row];\n        m_widgetToSender[slider] = m_senders[row];\n        connect(controlWidget, SIGNAL(destroyed(QObject*)), this, SLOT(removeWidgetFromIndex(QObject*)));\n        connect(slider, SIGNAL(valueChanged(int)), this, SLOT(controlSliderMoved(int)));\n        }\n        break;\n    case sACNEffectEngine::FxDate:\n        {\n        QComboBox *cb = new QComboBox(this);\n        cb->addItem(tr(\"EU Date Style\"));\n        cb->addItem(tr(\"US Date Style\"));\n        ui->tableWidget->setCellWidget(row, COL_CONTROL, cb);\n        m_widgetToFxEngine[cb] = m_fxEngines[row];\n        m_widgetToSender[cb] = m_senders[row];\n        connect(cb, SIGNAL(destroyed(QObject*)), this, SLOT(removeWidgetFromIndex(QObject*)));\n        connect(cb, SIGNAL(currentIndexChanged(int)), this, SLOT(controlComboChanged(int)));\n        }\n        break;\n    case sACNEffectEngine::FxText:\n        {\n        ui->tableWidget->setCellWidget(row, COL_CONTROL, nullptr);\n        QTableWidgetItem *item = new QTableWidgetItem(m_fxEngines[row]->text());\n        ui->tableWidget->setItem(row, COL_CONTROL, item);\n        m_fxEngines[row]->setRate(1);\n        }\n        break;\n    default:\n        break;\n    }\n\n}\n\nvoid MultiUniverse::controlSliderMoved(int value)\n{\n    QWidget *w = dynamic_cast<QWidget *>(sender());\n    if(m_widgetToFxEngine.contains(w))\n    {\n        sACNEffectEngine *e = m_widgetToFxEngine[w];\n        if(e->mode() == sACNEffectEngine::FxManual)\n        {\n            e->setManualLevel(value);\n            m_widgetToLevelLabel[w]->setText(Preferences::getInstance()->GetFormattedValue(value));\n        }\n        else\n            e->setRate(value);\n    }\n}\n\nvoid MultiUniverse::controlComboChanged(int value)\n{\n\n    QWidget *w = dynamic_cast<QWidget *>(sender());\n    if(m_widgetToFxEngine.contains(w))\n    {\n        sACNEffectEngine *e = m_widgetToFxEngine[w];\n\n        if(value==0)\n            e->setDateStyle(sACNEffectEngine::dsEU);\n        else\n            e->setDateStyle(sACNEffectEngine::dsUSA);\n    }\n}\n\nvoid MultiUniverse::on_tableWidget_cellChanged(int row, int column)\n{\n    if(column==COL_NAME)\n    {\n        if(ui->tableWidget->item(row, column))\n            m_senders[row]->setName(ui->tableWidget->item(row, column)->text());\n    }\n    if(column==COL_CONTROL)\n    {\n        if(ui->tableWidget->item(row, column))\n            m_fxEngines[row]->setText(ui->tableWidget->item(row, column)->text());\n    }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Part of Arac Neural Network Composition Library.\n\/\/ (c) 2008 by Justin S Bayer, <bayer.justin@googlemail.com>\n\n\n#include <iostream>\n\nextern \"C\"\n{\n    #include \"cblas.h\"\n}\n\n#include \"full.h\"\n\n\nusing arac::structure::connections::FullConnection;\nusing arac::structure::connections::Connection;\nusing arac::structure::Parametrized;\nusing arac::structure::modules::Module;\n\n\nFullConnection::FullConnection(Module* incoming_p, Module* outgoing_p) :\n    Connection(incoming_p, outgoing_p),\n    Parametrized(incoming_p->outsize() * outgoing_p->insize())\n{\n    \n}\n\n\nFullConnection::FullConnection(Module* incoming_p, Module* outgoing_p,\n                               int incomingstart, int incomingstop, \n                               int outgoingstart, int outgoingstop) :\n    Connection(incoming_p, outgoing_p, \n               incomingstart, incomingstop, \n               outgoingstart, outgoingstop),\n    Parametrized(incoming_p->outsize() * outgoing_p->insize())\n{\n    \n}\n\n\nFullConnection::FullConnection(Module* incoming_p, Module* outgoing_p,\n               double* parameters_p, double* derivatives_p,\n               int incomingstart, int incomingstop, \n               int outgoingstart, int outgoingstop) :\n    Connection(incoming_p, outgoing_p, \n               incomingstart, incomingstop,\n               outgoingstart, outgoingstop),\n    Parametrized((incomingstop - incomingstart) * (outgoingstop - outgoingstart),\n                 parameters_p, derivatives_p)           \n{\n}   \n\n            \nFullConnection::~FullConnection()\n{\n    if (parameters_owner())\n    {\n        delete _parameters_p;\n        _parameters_p = 0;\n    }\n    if (derivatives_owner())\n    {\n        delete _derivatives_p;\n        _derivatives_p = 0;\n    }\n}\n\n\nvoid FullConnection::_forward()\n{\n    if (timestep() - get_recurrent() < 0)\n    {\n        return;\n    }\n\n    int indim = _incomingstop - _incomingstart;\n    int outdim = _outgoingstop - _outgoingstart;\n\n    double* sink_p = _outgoing_p->input()[timestep()] + _outgoingstart;\n    double* source_p = _incoming_p->output()[timestep() - get_recurrent()];\n    source_p += _incomingstart;\n\n    cblas_dgemv(CblasRowMajor, \n                \/\/ Transpose the matrix since we want to multiply from the right\n                CblasNoTrans,\n                \/\/ Dimensions of the matrix\n                outdim,        \n                indim,\n                \/\/ Scalar for the matrix\n                1.0,                    \n                \/\/ Pointer to the matrix\n                get_parameters(),    \n                \/\/ Dimension of the vector\n                indim,\n                \/\/ Pointer to the vector\n                source_p,\n                \/\/ Some incrementer.\n                1,                      \n                \/\/ Scalar of the target vector\n                1.0,                    \n                \/\/ Pointer to the target vector\n                sink_p,\n                \/\/ Incrementer.\n                1);   \n}\n\n\nvoid FullConnection::_backward()\n{\n    int this_timestep = timestep() - 1;\n    if (this_timestep + get_recurrent() > sequencelength())\n    {\n        return;\n    }\n    \n    int indim = _incomingstop - _incomingstart;\n    int outdim = _outgoingstop - _outgoingstart;\n    \n    double* inerror_p = _incoming_p->outerror()[this_timestep] \\\n                        + _incomingstart;\n    \n    double* outerror_p = _outgoing_p->inerror()[this_timestep + get_recurrent()] \\\n                          + _outgoingstart;\n                          \n    double* input_p = _incoming_p->output()[this_timestep] \\\n                      + _incomingstart;\n\n    \/\/ TODO: use BLAS for this.\n    double* weights_p = get_parameters();\n    for (int i = 0; i < outdim; i++)\n    {\n        for (int j = 0; j < indim; j++)\n        {\n            inerror_p[j] += *weights_p * outerror_p[i];\n            weights_p++;\n        }\n    }\n\n    double* derivs_p = get_derivatives();\n    for (int i = 0; i < outdim; i++)\n    {\n        for (int j = 0; j < indim; j++)\n        {\n            *derivs_p += outerror_p[i] * input_p[j];\n            derivs_p++;\n        }\n    }\n}\n<commit_msg>BLAS used in FullConnection backward.<commit_after>\/\/ Part of Arac Neural Network Composition Library.\n\/\/ (c) 2008 by Justin S Bayer, <bayer.justin@googlemail.com>\n\n\n#include <iostream>\n\nextern \"C\"\n{\n    #include \"cblas.h\"\n}\n\n#include \"full.h\"\n\n\nusing arac::structure::connections::FullConnection;\nusing arac::structure::connections::Connection;\nusing arac::structure::Parametrized;\nusing arac::structure::modules::Module;\n\n\nFullConnection::FullConnection(Module* incoming_p, Module* outgoing_p) :\n    Connection(incoming_p, outgoing_p),\n    Parametrized(incoming_p->outsize() * outgoing_p->insize())\n{\n    \n}\n\n\nFullConnection::FullConnection(Module* incoming_p, Module* outgoing_p,\n                               int incomingstart, int incomingstop, \n                               int outgoingstart, int outgoingstop) :\n    Connection(incoming_p, outgoing_p, \n               incomingstart, incomingstop, \n               outgoingstart, outgoingstop),\n    Parametrized(incoming_p->outsize() * outgoing_p->insize())\n{\n    \n}\n\n\nFullConnection::FullConnection(Module* incoming_p, Module* outgoing_p,\n               double* parameters_p, double* derivatives_p,\n               int incomingstart, int incomingstop, \n               int outgoingstart, int outgoingstop) :\n    Connection(incoming_p, outgoing_p, \n               incomingstart, incomingstop,\n               outgoingstart, outgoingstop),\n    Parametrized((incomingstop - incomingstart) * (outgoingstop - outgoingstart),\n                 parameters_p, derivatives_p)           \n{\n}   \n\n            \nFullConnection::~FullConnection()\n{\n    if (parameters_owner())\n    {\n        delete _parameters_p;\n        _parameters_p = 0;\n    }\n    if (derivatives_owner())\n    {\n        delete _derivatives_p;\n        _derivatives_p = 0;\n    }\n}\n\n\nvoid FullConnection::_forward()\n{\n    if (timestep() - get_recurrent() < 0)\n    {\n        return;\n    }\n\n    int indim = _incomingstop - _incomingstart;\n    int outdim = _outgoingstop - _outgoingstart;\n\n    double* sink_p = _outgoing_p->input()[timestep()] + _outgoingstart;\n    double* source_p = _incoming_p->output()[timestep() - get_recurrent()];\n    source_p += _incomingstart;\n\n    cblas_dgemv(CblasRowMajor, \n                \/\/ Do not transpose the matrix since we want to multiply from \n                \/\/ the right\n                CblasNoTrans,\n                \/\/ Dimensions of the matrix\n                outdim,        \n                indim,\n                \/\/ Scalar for the matrix\n                1.0,                    \n                \/\/ Pointer to the matrix\n                get_parameters(),    \n                \/\/ Dimension of the vector\n                indim,\n                \/\/ Pointer to the vector\n                source_p,\n                \/\/ Some incrementer.\n                1,                      \n                \/\/ Scalar of the target vector\n                1.0,                    \n                \/\/ Pointer to the target vector\n                sink_p,\n                \/\/ Incrementer.\n                1);   \n}\n\n\nvoid FullConnection::_backward()\n{\n    int this_timestep = timestep() - 1;\n    if (this_timestep + get_recurrent() > sequencelength())\n    {\n        return;\n    }\n    \n    int indim = _incomingstop - _incomingstart;\n    int outdim = _outgoingstop - _outgoingstart;\n    \n    double* inerror_p = _incoming_p->outerror()[this_timestep] \\\n                        + _incomingstart;\n    \n    double* outerror_p = _outgoing_p->inerror()[this_timestep + get_recurrent()] \\\n                          + _outgoingstart;\n                          \n    double* input_p = _incoming_p->output()[this_timestep] \\\n                      + _incomingstart;\n\n    cblas_dgemv(CblasColMajor, \n                \/\/ Do not transpose the matrix since we want to multiply from \n                \/\/ the right\n                CblasNoTrans,\n                \/\/ Dimensions of the matrix\n                indim,        \n                outdim,\n                \/\/ Scalar for the matrix\n                1.0,                    \n                \/\/ Pointer to the matrix\n                get_parameters(),    \n                \/\/ Dimension of the vector\n                indim,\n                \/\/ Pointer to the vector\n                outerror_p,\n                \/\/ Some incrementer.\n                1,                      \n                \/\/ Scalar of the target vector\n                1.0,                    \n                \/\/ Pointer to the target vector\n                inerror_p,\n                \/\/ Incrementer.\n                1);   \n\n\n    double* derivs_p = get_derivatives();\n    for (int i = 0; i < outdim; i++)\n    {\n        for (int j = 0; j < indim; j++)\n        {\n            *derivs_p += outerror_p[i] * input_p[j];\n            derivs_p++;\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Need to add all tst_*.h files here for them to run.\n#include \"tst_src.h\"\n\/\/#include \"tst_jsonrequestparser.h\"\n#include \"tst_w3cserver.h\"\n\n\/\/\n#include <gtest\/gtest.h>\n\nint main(int argc, char *argv[])\n{\n    ::testing::InitGoogleTest(&argc, argv);\n    return RUN_ALL_TESTS();\n}\n<commit_msg>Removed comment from tests to make sure all tests now run again.<commit_after>\/\/ Need to add all tst_*.h files here for them to run.\n#include \"tst_src.h\"\n#include \"tst_jsonrequestparser.h\"\n#include \"tst_w3cserver.h\"\n\n\/\/\n#include <gtest\/gtest.h>\n\nint main(int argc, char *argv[])\n{\n    ::testing::InitGoogleTest(&argc, argv);\n    return RUN_ALL_TESTS();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\n  Copyright (c) 2014, Michael Tesch\n  All 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 Michael Tesch nor the names of other\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  https:\/\/github.com\/tesch1\/qt-google-analytics-collector\n\n*\/\n#include <unistd.h>\n#include <map>\n#include <QCoreApplication>\n#include <QSettings>\n#ifdef QT_GUI_LIB\n#include <QApplication>\n#include <QDesktopWidget>\n#endif\n#include <QUuid>\n#include <QNetworkAccessManager>\n#include <QNetworkRequest>\n#include <QNetworkReply>\n#include <QUrl>\n#include <QDebug>\n\n\/*!\n * send google tracking data according to\n * https:\/\/developers.google.com\/analytics\/devguides\/collection\/protocol\/v1\/reference\n *\/\n\nclass GAnalytics : public QObject {\n  Q_OBJECT\nprivate:\npublic:\n  GAnalytics(QCoreApplication * parent,\n             QString trackingID,\n             QString clientID = \"\",\n             bool useGET = false)\n    : QObject(parent), _qnam(this), _trackingID(trackingID), _clientID(clientID), _useGET(useGET), _isFail(false)\n  {\n    if (parent) {\n      setAppName(parent->applicationName());\n      setAppVersion(parent->applicationVersion());\n#ifdef QT_GUI_LIB\n      parent->dumpObjectTree();\n#endif\n    }\n    if (!_clientID.size()) {\n      \/\/ load client id from settings\n      QSettings settings;\n      if (!settings.contains(\"GAnalytics-cid\")) {\n        settings.setValue(\"GAnalytics-cid\", QUuid::createUuid().toString());\n      }\n      _clientID = settings.value(\"GAnalytics-cid\").toString();\n    }\n    connect(&_qnam, SIGNAL(finished(QNetworkReply *)), this, SLOT(postFinished(QNetworkReply *)));\n    if (!_qnam.networkAccessible())\n      qDebug() << \"error: network inaccessible\\n\";\n  }\n  ~GAnalytics() {\n    \/\/ this generally happens after the event-loop is done, so no more network processing\n#if 1 \/\/ not sure if this is necessary? does ~_qnam() delete all its replies? i guess it should\n    QList<QNetworkReply *> replies = _qnam.findChildren<QNetworkReply *>();\n    for (QList<QNetworkReply *>::iterator it = replies.begin(); it != replies.end(); it++) {\n      if ((*it)->isRunning())\n        qDebug() << \"~GAnalytics, request still running: \" << (*it)->url().toString() << \", aborting.\";\n      \/\/reply->deleteLater();\n    }\n#endif\n  }\n  \/\/ manual ip and user agent\n  void setClientID(QString clientID) { _clientID = clientID; }\n  void setUserIPAddr(QString userIPAddr) { _userIPAddr = userIPAddr; }\n  void setUserAgent(QString userAgent) { _userAgent = userAgent; }\n  void setAppName(QString appName) { _appName = appName; }\n  void setAppVersion(QString appVersion) { _appVersion = appVersion; }\n  void setScreenResolution(QString screenResolution) { _screenResolution = screenResolution; }\n  void setViewportSize(QString viewportSize) { _viewportSize = viewportSize; }\n  void setUserLanguage(QString userLanguage) { _userLanguage = userLanguage; }\n  QString getClientID() const { return _clientID; }\n  \/\/\n  \/\/ hit types\n  \/\/\n  \/\/ - https:\/\/developers.google.com\/analytics\/devguides\/collection\/protocol\/v1\/devguide\n  \/\/\n\npublic Q_SLOTS:\n\n  \/\/ pageview\n  void sendPageview(QString docHostname, QString page, QString title) const {\n    QUrl params = build_metric(\"pageview\");\n    params.addQueryItem(\"dh\", docHostname);    \/\/ document hostname\n    params.addQueryItem(\"dp\", page);            \/\/ page\n    params.addQueryItem(\"dt\", title);           \/\/ title\n    send_metric(params);\n  }\n\n  \/\/ event\n  void sendEvent(QString eventCategory = \"\", QString eventAction = \"\", \n                 QString eventLabel = \"\", int eventValue = 0) const {\n    QUrl params = build_metric(\"event\");\n    if (_appName.size()) params.addQueryItem(\"an\", _appName); \/\/ mobile event app tracking\n    if (_appVersion.size()) params.addQueryItem(\"av\", _appVersion); \/\/ mobile event app tracking\n    if (eventCategory.size()) params.addQueryItem(\"ec\", eventCategory);\n    if (eventAction.size()) params.addQueryItem(\"ea\", eventAction);\n    if (eventLabel.size()) params.addQueryItem(\"el\", eventLabel);\n    if (eventValue) params.addQueryItem(\"ev\", QString::number(eventValue));\n    send_metric(params);\n  }\n\n  \/\/ transaction\n  void sendTransaction(QString transactionID, QString transactionAffiliation = \"\" \/*...todo...*\/) const {\n    QUrl params = build_metric(\"transaction\");\n    params.addQueryItem(\"ti\", transactionID);\n    if (transactionAffiliation.size()) params.addQueryItem(\"ta\", transactionAffiliation);\n    send_metric(params);\n  }\n\n  \/\/ item\n  void sendItem(QString itemName) const {\n    QUrl params = build_metric(\"item\");\n    params.addQueryItem(\"in\", itemName);\n    \/\/if (appName.size()) params.addQueryItem(\"an\", appName);\n    send_metric(params);\n  }\n\n  \/\/ social\n  void sendSocial(QString socialNetwork, QString socialAction, QString socialActionTarget) const {\n    QUrl params = build_metric(\"social\");\n    params.addQueryItem(\"sn\", socialNetwork);\n    params.addQueryItem(\"sa\", socialAction);\n    params.addQueryItem(\"st\", socialActionTarget);\n    send_metric(params);\n  }\n\n  \/\/ exception\n  void sendException(QString exceptionDescription, bool exceptionFatal = true) const {\n    QUrl params = build_metric(\"exception\");\n    if (exceptionDescription.size()) params.addQueryItem(\"exd\", exceptionDescription);\n    if (!exceptionFatal) params.addQueryItem(\"exf\", \"0\");\n    send_metric(params);\n  }\n\n  \/\/ timing\n  void sendTiming(\/* todo *\/) const {\n    QUrl params = build_metric(\"timing\");\n    \/\/if (appName.size()) params.addQueryItem(\"an\", appName);\n    send_metric(params);\n  }\n\n  \/\/ appview\n  void sendAppview(QString appName, QString appVersion = \"\", QString screenName = \"\") const {\n    QUrl params = build_metric(\"appview\");\n    if (_appName.size()) params.addQueryItem(\"an\", _appName);\n    else if (appName.size()) params.addQueryItem(\"an\", appName);\n    if (_appVersion.size()) params.addQueryItem(\"av\", _appVersion);\n    else if (appVersion.size()) params.addQueryItem(\"av\", appVersion);\n    if (screenName.size()) params.addQueryItem(\"cd\", screenName);\n    send_metric(params);\n  }\n\n  \/\/ custom dimensions \/ metrics\n  \/\/ todo\n\n  \/\/ experiment id \/ variant\n  \/\/ todo\n\n  \/\/void startSession();\n  void endSession() const {\n    QUrl params = build_metric(\"event\");\n    params.addQueryItem(\"sc\", \"end\");\n    send_metric(params);\n  }\n\npublic:\n\n  void generateUserAgentEtc() {\n    QString locale = QLocale::system().name().toLower().replace(\"_\", \"-\");\n#ifdef __APPLE__\n    QString machine = \"Macintosh; Intel Mac OS X 10.9; \";\n#endif\n#ifdef __linux__\n    QString machine = \"X11; Linux \";\n#ifdef __amd64__ || __x86_64__ || __ppc64__\n    machine += \"x86_64; \";\n#else\n    machine += \"i686; \";\n#endif\n#endif\n#ifdef Q_WS_WIN\n    QString machine = \"Windows; \";\n#endif\n    _userAgent = \"Mozilla\/5.0 (\" + machine + locale + \") GAnalytics\/1.0 (Qt\/\" QT_VERSION_STR \" )\";\n    _userLanguage = locale;\n#ifdef QT_GUI_LIB\n    QString geom = QString::number(QApplication::desktop()->screenGeometry().width()) \n      + \"x\" + QString::number(QApplication::desktop()->screenGeometry().height());\n    _screenResolution = geom;\n#endif\n#if 0\n    qDebug() << \"User-Agent:\" << _userAgent;\n    qDebug() << \"Language:\" << _userLanguage;\n    qDebug() << \"Screen Resolution:\" << _screenResolution;\n#endif\n  }\n\nprivate Q_SLOTS:\n  void postFinished(QNetworkReply * reply) {\n    \/\/qDebug() << \"reply:\" << reply->readAll().toHex();\n    if (QNetworkReply::NoError != reply->error()) {\n      qDebug() << \"postFinished error: \" << reply->errorString() << \"\\n\";\n    }\n    else {\n      int httpStatus = reply->attribute(QNetworkRequest::HttpStatusCodeAttribute).toInt();\n      \/\/qDebug() << \"http response code: \" << httpStatus;\n      if (httpStatus < 200 || httpStatus > 299) {\n        _isFail = true;\n      }\n    }\n    reply->deleteLater();\n  }\n  void postError(QNetworkReply::NetworkError code) {\n    qDebug() << \"network error signal: \" << code << \"\\n\";\n  }\n\nprivate:\n  GAnalytics(const GAnalytics &); \/\/ disable copy const constructor\n  QUrl build_metric(QString hitType) const {\n    QUrl params;\n    \/\/ required in v1\n    params.addQueryItem(\"v\", \"1\" ); \/\/ version\n    params.addQueryItem(\"tid\", _trackingID);\n    params.addQueryItem(\"cid\", _clientID);\n    params.addQueryItem(\"t\", hitType);\n    if (_userIPAddr.size())\n      params.addQueryItem(\"uip\", _userIPAddr);\n    if (_screenResolution.size())\n      params.addQueryItem(\"sr\", _screenResolution);\n    if (_viewportSize.size())\n      params.addQueryItem(\"vp\", _viewportSize);\n    if (_userLanguage.size())\n      params.addQueryItem(\"ul\", _userLanguage);\n    \/\/if (_userAgent.size())\n    \/\/  params.addQueryItem(\"ua\", _userAgent);\n    return params;\n  }\n  void send_metric(QUrl & params) const {\n    \/\/ when google has err'd us, then stop sending events!\n    if (_isFail)\n      return;\n    QUrl collect_url(\"http:\/\/www.google-analytics.com\/collect\");\n    QNetworkRequest request;\n    if (_userAgent.size())\n      request.setRawHeader(\"User-Agent\", _userAgent.toUtf8());\n    QNetworkReply * reply;\n    if (_useGET) {\n      \/\/ add cache-buster \"z\" to params\n      \/\/params.addQueryItem(\"z\", QString::number(qrand()) );\n      collect_url.setQueryItems(params.queryItems());\n      request.setUrl(collect_url);\n      reply = _qnam.get(request);\n    }\n    else {\n      request.setUrl(collect_url);\n      request.setHeader(QNetworkRequest::ContentTypeHeader, \"application\/x-www-form-urlencoded\");\n      reply = _qnam.post(request, params.encodedQuery());\n    }\n    connect(reply, SIGNAL(error(QNetworkReply::NetworkError)), \n            this, SLOT(postError(QNetworkReply::NetworkError)));\n    reply->setParent(&_qnam);\n  }\n  mutable QNetworkAccessManager _qnam;\n  QString _trackingID;\n  QString _clientID;\n  bool _useGET; \/\/ true=GET, false=POST\n  QString _userID;\n\n  \/\/ various parameters:\n  bool _anonymizeIP;\n  bool _cacheBust;\n  \/\/\n  QString _userIPAddr;\n  QString _userAgent;\n  QString _appName;\n  QString _appVersion;\n#if 0 \/\/ todo\n  \/\/ traffic sources\n  QString _documentReferrer;\n  QString _campaignName;\n  QString _campaignSource;\n  QString _campaignMedium;\n  QString _campaignKeyword;\n  QString _campaignContent;\n  QString _campaignID;\n  QString _adwordsID;\n  QString _displayAdsID;\n#endif\n  \/\/ system info\n  QString _screenResolution;\n  QString _viewportSize;\n  QString _userLanguage;\n  \/\/ etc...\n\n  \/\/ internal\n  bool _isFail;\n};\n\n<commit_msg>compiler and userid support<commit_after>\/*\n\n  Copyright (c) 2014, Michael Tesch\n  All 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 Michael Tesch nor the names of other\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  https:\/\/github.com\/tesch1\/qt-google-analytics-collector\n\n*\/\n#include <unistd.h>\n#include <map>\n#include <QCoreApplication>\n#include <QSettings>\n#ifdef QT_GUI_LIB\n#include <QApplication>\n#include <QDesktopWidget>\n#endif\n#include <QUuid>\n#include <QNetworkAccessManager>\n#include <QNetworkRequest>\n#include <QNetworkReply>\n#include <QUrl>\n#include <QDebug>\n\n\/*!\n * send google tracking data according to\n * https:\/\/developers.google.com\/analytics\/devguides\/collection\/protocol\/v1\/reference\n *\/\n\nclass GAnalytics : public QObject {\n  Q_OBJECT\nprivate:\npublic:\n  GAnalytics(QCoreApplication * parent,\n             QString trackingID,\n             QString clientID = \"\",\n             bool useGET = false)\n    : QObject(parent), _qnam(this), _trackingID(trackingID), _clientID(clientID), _useGET(useGET), _isFail(false)\n  {\n    if (parent) {\n      setAppName(parent->applicationName());\n      setAppVersion(parent->applicationVersion());\n#ifdef QT_GUI_LIB\n      parent->dumpObjectTree();\n#endif\n    }\n    if (!_clientID.size()) {\n      \/\/ load client id from settings\n      QSettings settings;\n      if (!settings.contains(\"GAnalytics-cid\")) {\n        settings.setValue(\"GAnalytics-cid\", QUuid::createUuid().toString());\n      }\n      _clientID = settings.value(\"GAnalytics-cid\").toString();\n    }\n    connect(&_qnam, SIGNAL(finished(QNetworkReply *)), this, SLOT(postFinished(QNetworkReply *)));\n#if QT_VERSION >= 0x040800\n    if (!_qnam.networkAccessible())\n      qDebug() << \"error: network inaccessible\\n\";\n#endif\n  }\n\n  ~GAnalytics() {\n    \/\/ this generally happens after the event-loop is done, so no more network processing\n#if 1\n    QList<QNetworkReply *> replies = _qnam.findChildren<QNetworkReply *>();\n    for (QList<QNetworkReply *>::iterator it = replies.begin(); it != replies.end(); it++) {\n      if ((*it)->isRunning())\n        qDebug() << \"~GAnalytics, request still running: \" << (*it)->url().toString() << \", aborting.\";\n      \/\/reply->deleteLater();\n    }\n#endif\n  }\n\n  \/\/ manual config of static fields\n  void setClientID(QString clientID) { _clientID = clientID; }\n  void setUserID(QString userID) { _userID = userID; }\n  void setUserIPAddr(QString userIPAddr) { _userIPAddr = userIPAddr; }\n  void setUserAgent(QString userAgent) { _userAgent = userAgent; }\n  void setAppName(QString appName) { _appName = appName; }\n  void setAppVersion(QString appVersion) { _appVersion = appVersion; }\n  void setScreenResolution(QString screenResolution) { _screenResolution = screenResolution; }\n  void setViewportSize(QString viewportSize) { _viewportSize = viewportSize; }\n  void setUserLanguage(QString userLanguage) { _userLanguage = userLanguage; }\n  QString getClientID() const { return _clientID; }\n\n  \/\/\n  \/\/ hit types\n  \/\/\n  \/\/ - https:\/\/developers.google.com\/analytics\/devguides\/collection\/protocol\/v1\/devguide\n  \/\/\n\npublic Q_SLOTS:\n\n  \/\/ pageview\n  void sendPageview(QString docHostname, QString page, QString title) const {\n    QUrl params = build_metric(\"pageview\");\n    params.addQueryItem(\"dh\", docHostname);    \/\/ document hostname\n    params.addQueryItem(\"dp\", page);            \/\/ page\n    params.addQueryItem(\"dt\", title);           \/\/ title\n    send_metric(params);\n  }\n\n  \/\/ event\n  void sendEvent(QString eventCategory = \"\", QString eventAction = \"\", \n                 QString eventLabel = \"\", int eventValue = 0) const {\n    QUrl params = build_metric(\"event\");\n    if (_appName.size()) params.addQueryItem(\"an\", _appName); \/\/ mobile event app tracking\n    if (_appVersion.size()) params.addQueryItem(\"av\", _appVersion); \/\/ mobile event app tracking\n    if (eventCategory.size()) params.addQueryItem(\"ec\", eventCategory);\n    if (eventAction.size()) params.addQueryItem(\"ea\", eventAction);\n    if (eventLabel.size()) params.addQueryItem(\"el\", eventLabel);\n    if (eventValue) params.addQueryItem(\"ev\", QString::number(eventValue));\n    send_metric(params);\n  }\n\n  \/\/ transaction\n  void sendTransaction(QString transactionID, QString transactionAffiliation = \"\" \/*...todo...*\/) const {\n    QUrl params = build_metric(\"transaction\");\n    params.addQueryItem(\"ti\", transactionID);\n    if (transactionAffiliation.size()) params.addQueryItem(\"ta\", transactionAffiliation);\n    send_metric(params);\n  }\n\n  \/\/ item\n  void sendItem(QString itemName) const {\n    QUrl params = build_metric(\"item\");\n    params.addQueryItem(\"in\", itemName);\n    \/\/if (appName.size()) params.addQueryItem(\"an\", appName);\n    send_metric(params);\n  }\n\n  \/\/ social\n  void sendSocial(QString socialNetwork, QString socialAction, QString socialActionTarget) const {\n    QUrl params = build_metric(\"social\");\n    params.addQueryItem(\"sn\", socialNetwork);\n    params.addQueryItem(\"sa\", socialAction);\n    params.addQueryItem(\"st\", socialActionTarget);\n    send_metric(params);\n  }\n\n  \/\/ exception\n  void sendException(QString exceptionDescription, bool exceptionFatal = true) const {\n    QUrl params = build_metric(\"exception\");\n    if (exceptionDescription.size()) params.addQueryItem(\"exd\", exceptionDescription);\n    if (!exceptionFatal) params.addQueryItem(\"exf\", \"0\");\n    send_metric(params);\n  }\n\n  \/\/ timing\n  void sendTiming(\/* todo *\/) const {\n    QUrl params = build_metric(\"timing\");\n    \/\/if (appName.size()) params.addQueryItem(\"an\", appName);\n    send_metric(params);\n  }\n\n  \/\/ appview\n  void sendAppview(QString appName, QString appVersion = \"\", QString screenName = \"\") const {\n    QUrl params = build_metric(\"appview\");\n    if (_appName.size()) params.addQueryItem(\"an\", _appName);\n    else if (appName.size()) params.addQueryItem(\"an\", appName);\n    if (_appVersion.size()) params.addQueryItem(\"av\", _appVersion);\n    else if (appVersion.size()) params.addQueryItem(\"av\", appVersion);\n    if (screenName.size()) params.addQueryItem(\"cd\", screenName);\n    send_metric(params);\n  }\n\n  \/\/ custom dimensions \/ metrics\n  \/\/ todo\n\n  \/\/ experiment id \/ variant\n  \/\/ todo\n\n  \/\/void startSession();\n  void endSession() const {\n    QUrl params = build_metric(\"event\");\n    params.addQueryItem(\"sc\", \"end\");\n    send_metric(params);\n  }\n\npublic:\n\n  void generateUserAgentEtc() {\n    QString locale = QLocale::system().name().toLower().replace(\"_\", \"-\");\n#ifdef __APPLE__\n    QString machine = \"Macintosh; Intel Mac OS X 10.9; \";\n#endif\n#ifdef __linux__\n    QString machine = \"X11; Linux \";\n#if defined(__amd64__) || defined(__x86_64__) || defined(__ppc64__)\n    machine += \"x86_64; \";\n#else\n    machine += \"i686; \";\n#endif\n#endif\n#ifdef Q_WS_WIN\n    QString machine = \"Windows; \";\n#endif\n    _userAgent = \"Mozilla\/5.0 (\" + machine + locale + \") GAnalytics\/1.0 (Qt\/\" QT_VERSION_STR \" )\";\n    _userLanguage = locale;\n#ifdef QT_GUI_LIB\n    QString geom = QString::number(QApplication::desktop()->screenGeometry().width()) \n      + \"x\" + QString::number(QApplication::desktop()->screenGeometry().height());\n    _screenResolution = geom;\n#endif\n#if 0\n    qDebug() << \"User-Agent:\" << _userAgent;\n    qDebug() << \"Language:\" << _userLanguage;\n    qDebug() << \"Screen Resolution:\" << _screenResolution;\n#endif\n  }\n\nprivate Q_SLOTS:\n  void postFinished(QNetworkReply * reply) {\n    \/\/qDebug() << \"reply:\" << reply->readAll().toHex();\n    if (QNetworkReply::NoError != reply->error()) {\n      qDebug() << \"postFinished error: \" << reply->errorString() << \"\\n\";\n    }\n    else {\n      int httpStatus = reply->attribute(QNetworkRequest::HttpStatusCodeAttribute).toInt();\n      \/\/qDebug() << \"http response code: \" << httpStatus;\n      if (httpStatus < 200 || httpStatus > 299) {\n        _isFail = true;\n      }\n    }\n    reply->deleteLater();\n  }\n  void postError(QNetworkReply::NetworkError code) {\n    qDebug() << \"network error signal: \" << code << \"\\n\";\n  }\n\nprivate:\n  GAnalytics(const GAnalytics &); \/\/ disable copy const constructor\n  QUrl build_metric(QString hitType) const {\n    QUrl params;\n    \/\/ required in v1\n    params.addQueryItem(\"v\", \"1\" ); \/\/ version\n    params.addQueryItem(\"tid\", _trackingID);\n    params.addQueryItem(\"cid\", _clientID);\n    params.addQueryItem(\"t\", hitType);\n    \/\/ optional\n    if (_userID.size())\n      params.addQueryItem(\"uid\", _userID);\n    if (_userIPAddr.size())\n      params.addQueryItem(\"uip\", _userIPAddr);\n    if (_screenResolution.size())\n      params.addQueryItem(\"sr\", _screenResolution);\n    if (_viewportSize.size())\n      params.addQueryItem(\"vp\", _viewportSize);\n    if (_userLanguage.size())\n      params.addQueryItem(\"ul\", _userLanguage);\n    \/\/if (_userAgent.size())\n    \/\/  params.addQueryItem(\"ua\", _userAgent);\n    return params;\n  }\n  void send_metric(QUrl & params) const {\n    \/\/ when google has err'd us, then stop sending events!\n    if (_isFail)\n      return;\n    QUrl collect_url(\"http:\/\/www.google-analytics.com\/collect\");\n    QNetworkRequest request;\n    if (_userAgent.size())\n      request.setRawHeader(\"User-Agent\", _userAgent.toUtf8());\n    QNetworkReply * reply;\n    if (_useGET) {\n      \/\/ add cache-buster \"z\" to params\n      \/\/params.addQueryItem(\"z\", QString::number(qrand()) );\n      collect_url.setQueryItems(params.queryItems());\n      request.setUrl(collect_url);\n      reply = _qnam.get(request);\n    }\n    else {\n      request.setUrl(collect_url);\n      request.setHeader(QNetworkRequest::ContentTypeHeader, \"application\/x-www-form-urlencoded\");\n      reply = _qnam.post(request, params.encodedQuery());\n    }\n    connect(reply, SIGNAL(error(QNetworkReply::NetworkError)), \n            this, SLOT(postError(QNetworkReply::NetworkError)));\n    reply->setParent(&_qnam);\n  }\n  mutable QNetworkAccessManager _qnam;\n  QString _trackingID;\n  QString _clientID;\n  bool _useGET; \/\/ true=GET, false=POST\n  QString _userID;\n\n  \/\/ various parameters:\n  bool _anonymizeIP;\n  bool _cacheBust;\n  \/\/\n  QString _userIPAddr;\n  QString _userAgent;\n  QString _appName;\n  QString _appVersion;\n#if 0 \/\/ todo\n  \/\/ traffic sources\n  QString _documentReferrer;\n  QString _campaignName;\n  QString _campaignSource;\n  QString _campaignMedium;\n  QString _campaignKeyword;\n  QString _campaignContent;\n  QString _campaignID;\n  QString _adwordsID;\n  QString _displayAdsID;\n#endif\n  \/\/ system info\n  QString _screenResolution;\n  QString _viewportSize;\n  QString _userLanguage;\n  \/\/ etc...\n\n  \/\/ internal\n  bool _isFail;\n};\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2012, The University of Oxford\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * 1. Redistributions of source code must retain the above copyright notice,\n *    this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n *    this list of conditions and the following disclaimer in the documentation\n *    and\/or other materials provided with the distribution.\n * 3. Neither the name of the University of Oxford nor the names of its\n *    contributors may be used to endorse or promote products derived from this\n *    software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"apps\/lib\/oskar_imager.h\"\n#include \"apps\/lib\/oskar_settings_load.h\"\n#include \"imaging\/oskar_Image.h\"\n#include \"imaging\/oskar_make_image.h\"\n#include \"imaging\/oskar_image_write.h\"\n#include \"interferometry\/oskar_Visibilities.h\"\n#include \"interferometry\/oskar_visibilities_read.h\"\n#include \"utility\/oskar_get_error_string.h\"\n#include \"utility\/oskar_log_error.h\"\n#include \"utility\/oskar_log_message.h\"\n#include \"utility\/oskar_log_section.h\"\n#include \"utility\/oskar_log_settings.h\"\n#include \"utility\/oskar_Log.h\"\n#include \"utility\/oskar_Settings.h\"\n#include \"utility\/oskar_settings_free.h\"\n\n#ifndef OSKAR_NO_FITS\n#include \"fits\/oskar_fits_image_write.h\"\n#endif\n\n#include <QtCore\/QTime>\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\nint oskar_imager(const char* settings_file, oskar_Log* log)\n{\n    int error = 0;\n    oskar_Settings settings;\n    oskar_Visibilities vis;\n    oskar_Image image;\n\n    oskar_log_section(log, \"Loading settings file '%s'\", settings_file);\n    error = oskar_settings_load(&settings, log, settings_file);\n    if (error)\n    {\n        oskar_log_error(log, \"Failure in oskar_settings_load() (%s).\",\n                oskar_get_error_string(error));\n        return error;\n    }\n\n    \/\/ Log the relevant settings.\n    log->keep_file = settings.sim.keep_log_file;\n    oskar_log_settings_simulator(log, &settings);\n    oskar_log_settings_image(log, &settings);\n\n    if (!(settings.image.oskar_image || settings.image.fits_image))\n    {\n        oskar_log_error(log, \"No output image file specified.\");\n        return OSKAR_ERR_SETTINGS;\n    }\n\n    if (!settings.image.input_vis_data)\n    {\n        oskar_log_error(log, \"No input visibility data file specified.\");\n        return OSKAR_ERR_SETTINGS;\n    }\n\n    oskar_visibilities_read(&vis, settings.image.input_vis_data, &error);\n    if (error)\n    {\n        oskar_log_error(log, \"Failure in oskar_visibilities_read() (%s).\",\n                oskar_get_error_string(error));\n        return error;\n    }\n\n    oskar_log_section(log, \"Starting OSKAR imager...\");\n\n    QTime timer;\n    timer.start();\n    error = oskar_make_image(&image, log, &vis, &settings.image);\n    if (error)\n    {\n        oskar_log_error(log, \"Failure in oskar_make_image() (%s).\",\n                oskar_get_error_string(error));\n        return error;\n    }\n    oskar_log_section(log, \"Imaging completed in %.3f sec.\", timer.elapsed()\/1.0e3);\n\n    if (settings.image.oskar_image)\n    {\n        oskar_image_write(&image, log, settings.image.oskar_image, 0, &error);\n        if (error)\n        {\n            oskar_log_error(log, \"Failure in oskar_image_write() (%s).\",\n                    oskar_get_error_string(error));\n            return error;\n        }\n    }\n#ifndef OSKAR_NO_FITS\n    if (settings.image.fits_image)\n    {\n        error = oskar_fits_image_write(&image, log, settings.image.fits_image);\n        if (error)\n        {\n            oskar_log_error(log, \"Failure in oskar_fits_image_write() (%s).\",\n                    oskar_get_error_string(error));\n            return error;\n        }\n    }\n#endif\n\n    oskar_log_section(log, \"Run complete.\");\n    return OSKAR_SUCCESS;\n}\n\n#ifdef __cplusplus\n}\n#endif\n<commit_msg>updated error code message<commit_after>\/*\n * Copyright (c) 2012, The University of Oxford\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * 1. Redistributions of source code must retain the above copyright notice,\n *    this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n *    this list of conditions and the following disclaimer in the documentation\n *    and\/or other materials provided with the distribution.\n * 3. Neither the name of the University of Oxford nor the names of its\n *    contributors may be used to endorse or promote products derived from this\n *    software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"apps\/lib\/oskar_imager.h\"\n#include \"apps\/lib\/oskar_settings_load.h\"\n#include \"imaging\/oskar_Image.h\"\n#include \"imaging\/oskar_make_image.h\"\n#include \"imaging\/oskar_image_write.h\"\n#include \"interferometry\/oskar_Visibilities.h\"\n#include \"interferometry\/oskar_visibilities_read.h\"\n#include \"utility\/oskar_get_error_string.h\"\n#include \"utility\/oskar_log_error.h\"\n#include \"utility\/oskar_log_message.h\"\n#include \"utility\/oskar_log_section.h\"\n#include \"utility\/oskar_log_settings.h\"\n#include \"utility\/oskar_Log.h\"\n#include \"utility\/oskar_Settings.h\"\n#include \"utility\/oskar_settings_free.h\"\n\n#ifndef OSKAR_NO_FITS\n#include \"fits\/oskar_fits_image_write.h\"\n#endif\n\n#include <QtCore\/QTime>\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\nint oskar_imager(const char* settings_file, oskar_Log* log)\n{\n    int error = 0;\n    oskar_Settings settings;\n    oskar_Visibilities vis;\n    oskar_Image image;\n\n    oskar_log_section(log, \"Loading settings file '%s'\", settings_file);\n    error = oskar_settings_load(&settings, log, settings_file);\n    if (error)\n    {\n        oskar_log_error(log, \"Failure in oskar_settings_load() (%s).\",\n                oskar_get_error_string(error));\n        return error;\n    }\n\n    \/\/ Log the relevant settings.\n    log->keep_file = settings.sim.keep_log_file;\n    oskar_log_settings_simulator(log, &settings);\n    oskar_log_settings_image(log, &settings);\n\n    if (!(settings.image.oskar_image || settings.image.fits_image))\n    {\n        oskar_log_error(log, \"No output image file specified.\");\n        return OSKAR_ERR_SETTINGS;\n    }\n\n    if (!settings.image.input_vis_data)\n    {\n        oskar_log_error(log, \"No input visibility data file specified.\");\n        return OSKAR_ERR_SETTINGS;\n    }\n\n    oskar_visibilities_read(&vis, settings.image.input_vis_data, &error);\n    if (error)\n    {\n        oskar_log_error(log, \"Failure in oskar_visibilities_read() (%s).\",\n                oskar_get_error_string(error));\n        return error;\n    }\n\n    oskar_log_section(log, \"Starting OSKAR imager...\");\n\n    QTime timer;\n    timer.start();\n    error = oskar_make_image(&image, log, &vis, &settings.image);\n    if (error)\n    {\n        oskar_log_error(log, \"Failure in oskar_make_image() [code: %i] (%s).\",\n                error, oskar_get_error_string(error));\n        return error;\n    }\n    oskar_log_section(log, \"Imaging completed in %.3f sec.\", timer.elapsed()\/1.0e3);\n\n    if (settings.image.oskar_image)\n    {\n        oskar_image_write(&image, log, settings.image.oskar_image, 0, &error);\n        if (error)\n        {\n            oskar_log_error(log, \"Failure in oskar_image_write() (%s).\",\n                    oskar_get_error_string(error));\n            return error;\n        }\n    }\n#ifndef OSKAR_NO_FITS\n    if (settings.image.fits_image)\n    {\n        error = oskar_fits_image_write(&image, log, settings.image.fits_image);\n        if (error)\n        {\n            oskar_log_error(log, \"Failure in oskar_fits_image_write() (%s).\",\n                    oskar_get_error_string(error));\n            return error;\n        }\n    }\n#endif\n\n    oskar_log_section(log, \"Run complete.\");\n    return OSKAR_SUCCESS;\n}\n\n#ifdef __cplusplus\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"..\/SocketCanPump.hpp\"\n#include \"..\/HuboDescription.hpp\"\n#include \"HuboState\/State.hpp\"\n#include \"HuboCmd\/Aggregator.hpp\"\n#include \"HuboCmd\/AuxReceiver.hpp\"\n\nusing namespace HuboCan;\n\nint main(int argc, char* argv[])\n{\n    bool virtual_can = false;\n    for(int i=1; i<argc; ++i)\n    {\n        if(strcmp(argv[i],\"virtual\")==0)\n        {\n            virtual_can = true;\n        }\n    }\n    \n    SocketCanPump can(200, 1e6, 2, 1000, virtual_can);\n\n    HuboDescription desc;\n    if(!desc.parseFile(\"..\/HuboCan\/devices\/DrcHubo.dd\"))\n    {\n        std::cout << \"Description could not be correctly parsed! Quitting!\" << std::endl;\n        return 1;\n    }\n    desc.broadcastInfo();\n\n    can.load_description(desc);\n\n    HuboState::State state(desc);\n    HuboCmd::Aggregator agg(desc);\n    HuboCmd::AuxReceiver aux(&desc);\n\n    std::cout << state.joints << \"\\n\\n\" << std::endl;\n\n    for(size_t i=0; i<desc.jmcs.size(); ++i)\n    {\n        desc.jmcs[i]->assign_pointers(&agg, &state);\n    }\n\n    if(!state.initialized())\n    {\n        std::cout << \"State was not initialized correctly, so we are quitting.\\n\"\n                  << \" -- Either your ach channels are not open\"\n                  << \" or your HuboDescription was not valid!\\n\" << std::endl;\n        return 2;\n    }\n\n    agg.run();\n\n    size_t iter=0, count=1;\n    while(can.pump())\n    {\n        state.publish();\n        aux.update();\n        agg.update();\n        if(iter > 2000)\n        {\n            bool missed_one = false;\n            std::cout << \" ----------------------------------- \" << std::endl;\n            for(size_t i=0; i<desc.joints.size(); ++i)\n            {\n                if(desc.joints[i]->dropped_count > 0 && !virtual_can)\n                {\n                    std::cout << desc.joints[i]->info.name << \":\"\n                              << desc.joints[i]->dropped_count\n                              << \"(\" << (double)(desc.joints[i]->dropped_count)\/(double)(count)*200;\n                              << \")\" << \"\\t\";\n                    missed_one = true;\n                }\n            }\n            if(missed_one)\n                std::cout << std::endl;\n            iter = 0;\n        }\n\n        ++iter;\n        ++count;\n    }\n\n    return 0;\n}\n<commit_msg>semicolon<commit_after>\n#include \"..\/SocketCanPump.hpp\"\n#include \"..\/HuboDescription.hpp\"\n#include \"HuboState\/State.hpp\"\n#include \"HuboCmd\/Aggregator.hpp\"\n#include \"HuboCmd\/AuxReceiver.hpp\"\n\nusing namespace HuboCan;\n\nint main(int argc, char* argv[])\n{\n    bool virtual_can = false;\n    for(int i=1; i<argc; ++i)\n    {\n        if(strcmp(argv[i],\"virtual\")==0)\n        {\n            virtual_can = true;\n        }\n    }\n    \n    SocketCanPump can(200, 1e6, 2, 1000, virtual_can);\n\n    HuboDescription desc;\n    if(!desc.parseFile(\"..\/HuboCan\/devices\/DrcHubo.dd\"))\n    {\n        std::cout << \"Description could not be correctly parsed! Quitting!\" << std::endl;\n        return 1;\n    }\n    desc.broadcastInfo();\n\n    can.load_description(desc);\n\n    HuboState::State state(desc);\n    HuboCmd::Aggregator agg(desc);\n    HuboCmd::AuxReceiver aux(&desc);\n\n    std::cout << state.joints << \"\\n\\n\" << std::endl;\n\n    for(size_t i=0; i<desc.jmcs.size(); ++i)\n    {\n        desc.jmcs[i]->assign_pointers(&agg, &state);\n    }\n\n    if(!state.initialized())\n    {\n        std::cout << \"State was not initialized correctly, so we are quitting.\\n\"\n                  << \" -- Either your ach channels are not open\"\n                  << \" or your HuboDescription was not valid!\\n\" << std::endl;\n        return 2;\n    }\n\n    agg.run();\n\n    size_t iter=0, count=1;\n    while(can.pump())\n    {\n        state.publish();\n        aux.update();\n        agg.update();\n        if(iter > 2000)\n        {\n            bool missed_one = false;\n            std::cout << \" ----------------------------------- \" << std::endl;\n            for(size_t i=0; i<desc.joints.size(); ++i)\n            {\n                if(desc.joints[i]->dropped_count > 0 && !virtual_can)\n                {\n                    std::cout << desc.joints[i]->info.name << \":\"\n                              << desc.joints[i]->dropped_count\n                              << \"(\" << (double)(desc.joints[i]->dropped_count)\/(double)(count)*200\n                              << \")\" << \"\\t\";\n                    missed_one = true;\n                }\n            }\n            if(missed_one)\n                std::cout << std::endl;\n            iter = 0;\n        }\n\n        ++iter;\n        ++count;\n    }\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ The MIT License (MIT)\n\n\/\/ Copyright (c) 2016, Microsoft\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 <algorithm>\n#include <cmath>\n#include <iomanip>\n#include <iostream>\n\n#include \"BitFunnel\/Utilities\/Factories.h\"\n#include \"BitFunnel\/Utilities\/ITaskDistributor.h\"\n#include \"BitFunnel\/Utilities\/ITaskProcessor.h\"\n#include \"TreatmentOptimal.h\"\n\n\nnamespace BitFunnel\n{\n    class Analyzer\n    {\n    public:\n        static size_t FindOptimalConfiguration(double density,\n                                               double signal,\n                                               double snr);\n\n    private:\n        Analyzer(double density, double signal, double snr);\n\n        size_t Go();\n\n        void Recursion(size_t rank,\n                       bool firstRow,\n                       size_t config,\n                       double uncorrelatedNoise,\n                       double previousCorrelatedNoise,\n                       double expectedQuadwordsReads,\n                       double pQuadwordRead,\n                       double bitsPerDocument);\n\n        double m_density;\n        double m_signal;\n        double m_snr;\n\n        double m_bestDQ;\n        size_t m_bestConfiguration;\n\n        const size_t m_maxRowsPerRank = 9;\n    };\n\n\n    Analyzer::Analyzer(double density, double signal, double snr)\n      : m_density(density),\n        m_signal(signal),\n        m_snr(snr)\n    {\n    }\n\n\n    size_t Analyzer::FindOptimalConfiguration(double density, double signal, double snr)\n    {\n        Analyzer analyzer(density, signal, snr);\n        return analyzer.Go();\n    }\n\n\n    size_t Analyzer::Go()\n    {\n        m_bestDQ = -1;\n        m_bestConfiguration = 0ull;\n\n        size_t maxRank = 5;\n        bool firstRow = true;\n        size_t config = 0;\n        double uncorrelatedNoise = 0.0;\n        double previousCorrelatedNoise = 1.0;\n        double expectedQuadwordReads = 0.0;\n        double pQuadwordRead = 1.0;\n        double bitsPerDocument = 0.0;\n\n        for (size_t rank = 0; rank <= maxRank; ++rank)\n        {\n            Recursion(rank,\n                      firstRow,\n                      config,\n                      uncorrelatedNoise,\n                      previousCorrelatedNoise,\n                      expectedQuadwordReads,\n                      pQuadwordRead,\n                      bitsPerDocument);\n        }\n\n        std::cout << \"Best configuration is \" << m_bestConfiguration << std::endl;\n        return m_bestConfiguration;\n    }\n\n\n    void Analyzer::Recursion(size_t rank,\n                             bool firstRow,\n                             size_t configuration,\n                             double uncorrelatedNoise,\n                             double previousCorrelatedNoise,\n                             double expectedQuadwordReads,\n                             double pQuadwordRead,\n                             double bitsPerDocument)\n    {\n        size_t fanout = 1ull << rank;\n        double signalAtRank = Term::FrequencyAtRank(m_signal, rank);\n        double correlatedNoise = signalAtRank - m_signal;\n        uncorrelatedNoise += (previousCorrelatedNoise - correlatedNoise);\n\n        double noise = m_density - signalAtRank;\n        if (noise < 0.0)\n        {\n            \/\/ This must be a private row.\n            noise = 0.0;\n        }\n\n        for (size_t rowCount = 0;;)\n        {\n            \/\/std::cout << \"Rank: \" << rank\n            \/\/    << \" Config: \" << configuration\n            \/\/    << \" PreviousCorrelatedNoise: \" << previousCorrelatedNoise\n            \/\/    << \" snr = \" << m_signal \/ (uncorrelatedNoise + correlatedNoise)\n            \/\/    << \" dq = \" << 1.0 \/ (expectedQuadwordReads * bitsPerDocument)\n            \/\/    << std::endl;\n\n            if (!firstRow)\n            {\n                if (rank > 0)\n                {\n                    Recursion(rank - 1,\n                              firstRow,\n                              configuration * 10,\n                              uncorrelatedNoise,\n                              correlatedNoise,\n                              expectedQuadwordReads,\n                              pQuadwordRead,\n                              bitsPerDocument);\n                }\n            }\n\n            if (rowCount >= m_maxRowsPerRank)\n            {\n                break;\n            }\n\n            \/\/ Add another row.\n            ++rowCount;\n            ++configuration;\n\n            expectedQuadwordReads += pQuadwordRead \/ fanout;\n\n            if (firstRow)\n            {\n                uncorrelatedNoise = noise;\n                firstRow = false;\n            }\n            else\n            {\n                uncorrelatedNoise *= noise;\n            }\n\n            double totalNoise = uncorrelatedNoise + correlatedNoise;\n            double bitIsZero = 1.0 - m_signal - totalNoise;\n            pQuadwordRead = 1.0 - pow(bitIsZero, 64);\n\n            if (signalAtRank >= m_density)\n            {\n                bitsPerDocument += 1.0 \/ fanout;\n            }\n            else\n            {\n                bitsPerDocument += signalAtRank \/ m_density;\n            }\n\n            if (rank == 0)\n            {\n                \/\/ Base case.\n                double snr = m_signal \/ totalNoise;\n                if (snr >= m_snr)\n                {\n                    double dq = 1.0 \/ (expectedQuadwordReads * bitsPerDocument);\n                    if (dq > m_bestDQ)\n                    {\n                        m_bestDQ = dq;\n                        m_bestConfiguration = configuration;\n                        \/\/ Not sure whether one can prune the search here.\n                        \/\/ Need to prove that it is ok.\n                        \/\/ Not sure if it is any faster.\n                        \/\/ return;\n                    }\n                }\n            }\n        }\n    }\n\n\n\n    class TreatmentProcessor : public ITaskProcessor\n    {\n    public:\n        TreatmentProcessor(double density,\n                           double snr,\n                           std::vector<RowConfiguration>& configurations);\n\n        \/\/\n        \/\/ ITaskProcessor methods\n        \/\/\n\n        virtual void ProcessTask(size_t taskId) override;\n        virtual void Finished() override;\n\n    private:\n        double m_density;\n        double m_snr;\n        std::vector<RowConfiguration>& m_configurations;\n    };\n\n\n    TreatmentProcessor::TreatmentProcessor(double density,\n                                           double snr,\n                                           std::vector<RowConfiguration>& configurations)\n      : m_density(density),\n        m_snr(snr),\n        m_configurations(configurations)\n    {\n    }\n\n\n    void TreatmentProcessor::ProcessTask(size_t taskId)\n    {\n        Term::IdfX10 idf = static_cast<Term::IdfX10>(taskId);\n        double signal = Term::IdfX10ToFrequency(idf);\n\n        \/\/ Default value to be used when signal > m_density.\n        \/\/ Want a private row. Use a single, rank 0 row.\n        size_t configuration = 1ull;\n\n        \/\/ The following condition may not be necessary. It seems that\n        \/\/ FindOptimalConfiguration returns a single, rank 0 in the case\n        \/\/ where signal > m_density.\n        if (signal < m_density)\n        {\n            configuration = Analyzer::FindOptimalConfiguration(m_density,\n                                                               signal,\n                                                               m_snr);\n        }\n\n        m_configurations[taskId] = RowConfiguration(configuration);\n    }\n\n\n    void TreatmentProcessor::Finished()\n    {\n    }\n\n\n    \/\/*************************************************************************\n    \/\/\n    \/\/ TreatmentOptimal\n    \/\/\n    \/\/*************************************************************************\n    TreatmentOptimal::TreatmentOptimal(double density,\n                                       double snr)\n        : m_configurations(Term::c_maxIdfX10Value + 1, 0)\n    {\n        const size_t threadCount = 8;\n        std::vector<std::unique_ptr<ITaskProcessor>> processors;\n        for (size_t i = 0; i < threadCount; ++i) {\n            processors.push_back(\n                std::unique_ptr<ITaskProcessor>(\n                    new TreatmentProcessor(density, snr, m_configurations)));\n        }\n\n        auto distributor =\n            Factories::CreateTaskDistributor(processors,\n                                             Term::c_maxIdfX10Value + 1);\n\n        distributor->WaitForCompletion();\n    }\n\n\n    RowConfiguration TreatmentOptimal::GetTreatment(Term term) const\n    {\n        \/\/ DESIGN NOTE: we can't c_maxIdfX10Value directly to min because min\n        \/\/ takes a reference and the compiler has already turned it into a\n        \/\/ constant, which we can't take a reference to.\n        auto local = Term::c_maxIdfX10Value;\n        Term::IdfX10 idf = std::min(term.GetIdfSum(), local);\n        return m_configurations[idf];\n    }\n}\n<commit_msg>Output complete, labeled, de-threaded \"optimal\" treatment plan<commit_after>\/\/ The MIT License (MIT)\n\n\/\/ Copyright (c) 2016, Microsoft\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 <algorithm>\n#include <cmath>\n#include <iomanip>\n#include <iostream>\n\n#include \"BitFunnel\/Utilities\/Factories.h\"\n#include \"BitFunnel\/Utilities\/ITaskDistributor.h\"\n#include \"BitFunnel\/Utilities\/ITaskProcessor.h\"\n#include \"TreatmentOptimal.h\"\n\n\nnamespace BitFunnel\n{\n    class Analyzer\n    {\n    public:\n        static size_t FindOptimalConfiguration(double density,\n                                               double signal,\n                                               double snr);\n\n    private:\n        Analyzer(double density, double signal, double snr);\n\n        size_t Go();\n\n        void Recursion(size_t rank,\n                       bool firstRow,\n                       size_t config,\n                       double uncorrelatedNoise,\n                       double previousCorrelatedNoise,\n                       double expectedQuadwordsReads,\n                       double pQuadwordRead,\n                       double bitsPerDocument);\n\n        double m_density;\n        double m_signal;\n        double m_snr;\n\n        double m_bestDQ;\n        size_t m_bestConfiguration;\n\n        const size_t m_maxRowsPerRank = 9;\n    };\n\n\n    Analyzer::Analyzer(double density, double signal, double snr)\n      : m_density(density),\n        m_signal(signal),\n        m_snr(snr)\n    {\n    }\n\n\n    size_t Analyzer::FindOptimalConfiguration(double density, double signal, double snr)\n    {\n        Analyzer analyzer(density, signal, snr);\n        return analyzer.Go();\n    }\n\n\n    size_t Analyzer::Go()\n    {\n        m_bestDQ = -1;\n        m_bestConfiguration = 0ull;\n\n        size_t maxRank = 5;\n        bool firstRow = true;\n        size_t config = 0;\n        double uncorrelatedNoise = 0.0;\n        double previousCorrelatedNoise = 1.0;\n        double expectedQuadwordReads = 0.0;\n        double pQuadwordRead = 1.0;\n        double bitsPerDocument = 0.0;\n\n        for (size_t rank = 0; rank <= maxRank; ++rank)\n        {\n            Recursion(rank,\n                      firstRow,\n                      config,\n                      uncorrelatedNoise,\n                      previousCorrelatedNoise,\n                      expectedQuadwordReads,\n                      pQuadwordRead,\n                      bitsPerDocument);\n        }\n\n        return m_bestConfiguration;\n    }\n\n\n    void Analyzer::Recursion(size_t rank,\n                             bool firstRow,\n                             size_t configuration,\n                             double uncorrelatedNoise,\n                             double previousCorrelatedNoise,\n                             double expectedQuadwordReads,\n                             double pQuadwordRead,\n                             double bitsPerDocument)\n    {\n        size_t fanout = 1ull << rank;\n        double signalAtRank = Term::FrequencyAtRank(m_signal, rank);\n        double correlatedNoise = signalAtRank - m_signal;\n        uncorrelatedNoise += (previousCorrelatedNoise - correlatedNoise);\n\n        double noise = m_density - signalAtRank;\n        if (noise < 0.0)\n        {\n            \/\/ This must be a private row.\n            noise = 0.0;\n        }\n\n        for (size_t rowCount = 0;;)\n        {\n            \/\/std::cout << \"Rank: \" << rank\n            \/\/    << \" Config: \" << configuration\n            \/\/    << \" PreviousCorrelatedNoise: \" << previousCorrelatedNoise\n            \/\/    << \" snr = \" << m_signal \/ (uncorrelatedNoise + correlatedNoise)\n            \/\/    << \" dq = \" << 1.0 \/ (expectedQuadwordReads * bitsPerDocument)\n            \/\/    << std::endl;\n\n            if (!firstRow)\n            {\n                if (rank > 0)\n                {\n                    Recursion(rank - 1,\n                              firstRow,\n                              configuration * 10,\n                              uncorrelatedNoise,\n                              correlatedNoise,\n                              expectedQuadwordReads,\n                              pQuadwordRead,\n                              bitsPerDocument);\n                }\n            }\n\n            if (rowCount >= m_maxRowsPerRank)\n            {\n                break;\n            }\n\n            \/\/ Add another row.\n            ++rowCount;\n            ++configuration;\n\n            expectedQuadwordReads += pQuadwordRead \/ fanout;\n\n            if (firstRow)\n            {\n                uncorrelatedNoise = noise;\n                firstRow = false;\n            }\n            else\n            {\n                uncorrelatedNoise *= noise;\n            }\n\n            double totalNoise = uncorrelatedNoise + correlatedNoise;\n            double bitIsZero = 1.0 - m_signal - totalNoise;\n            pQuadwordRead = 1.0 - pow(bitIsZero, 64);\n\n            if (signalAtRank >= m_density)\n            {\n                bitsPerDocument += 1.0 \/ fanout;\n            }\n            else\n            {\n                bitsPerDocument += signalAtRank \/ m_density;\n            }\n\n            if (rank == 0)\n            {\n                \/\/ Base case.\n                double snr = m_signal \/ totalNoise;\n                if (snr >= m_snr)\n                {\n                    double dq = 1.0 \/ (expectedQuadwordReads * bitsPerDocument);\n                    if (dq > m_bestDQ)\n                    {\n                        m_bestDQ = dq;\n                        m_bestConfiguration = configuration;\n                        \/\/ Not sure whether one can prune the search here.\n                        \/\/ Need to prove that it is ok.\n                        \/\/ Not sure if it is any faster.\n                        \/\/ return;\n                    }\n                }\n            }\n        }\n    }\n\n\n\n    class TreatmentProcessor : public ITaskProcessor\n    {\n    public:\n        TreatmentProcessor(double density,\n                           double snr,\n                           std::vector<RowConfiguration>& configurations);\n\n        \/\/\n        \/\/ ITaskProcessor methods\n        \/\/\n\n        virtual void ProcessTask(size_t taskId) override;\n        virtual void Finished() override;\n\n    private:\n        double m_density;\n        double m_snr;\n        std::vector<RowConfiguration>& m_configurations;\n    };\n\n\n    TreatmentProcessor::TreatmentProcessor(double density,\n                                           double snr,\n                                           std::vector<RowConfiguration>& configurations)\n      : m_density(density),\n        m_snr(snr),\n        m_configurations(configurations)\n    {\n    }\n\n\n    void TreatmentProcessor::ProcessTask(size_t taskId)\n    {\n        Term::IdfX10 idf = static_cast<Term::IdfX10>(taskId);\n        double signal = Term::IdfX10ToFrequency(idf);\n\n        \/\/ Default value to be used when signal > m_density.\n        \/\/ Want a private row. Use a single, rank 0 row.\n        size_t configuration = 1ull;\n\n        \/\/ The following condition may not be necessary. It seems that\n        \/\/ FindOptimalConfiguration returns a single, rank 0 in the case\n        \/\/ where signal > m_density.\n        if (signal < m_density)\n        {\n            configuration = Analyzer::FindOptimalConfiguration(m_density,\n                                                               signal,\n                                                               m_snr);\n        }\n\n        m_configurations[taskId] = RowConfiguration(configuration);\n    }\n\n\n    void TreatmentProcessor::Finished()\n    {\n    }\n\n\n    \/\/*************************************************************************\n    \/\/\n    \/\/ TreatmentOptimal\n    \/\/\n    \/\/*************************************************************************\n    TreatmentOptimal::TreatmentOptimal(double density,\n                                       double snr)\n        : m_configurations(Term::c_maxIdfX10Value + 1, 0)\n    {\n        const size_t threadCount = 8;\n        std::vector<std::unique_ptr<ITaskProcessor>> processors;\n        for (size_t i = 0; i < threadCount; ++i) {\n            processors.push_back(\n                std::unique_ptr<ITaskProcessor>(\n                    new TreatmentProcessor(density, snr, m_configurations)));\n        }\n\n        auto distributor =\n            Factories::CreateTaskDistributor(processors,\n                                             Term::c_maxIdfX10Value + 1);\n\n        distributor->WaitForCompletion();\n\n        for (Term::IdfX10 idf = 0; idf <= Term::c_maxIdfX10Value; ++idf)\n        {\n            std::cout\n                << static_cast<uint32_t>(idf)\n                << \": best configuration is \"\n                << m_configurations[idf].ConfigurationAsDecimalDigits()\n                << std::endl;\n        }\n    }\n\n\n    RowConfiguration TreatmentOptimal::GetTreatment(Term term) const\n    {\n        \/\/ DESIGN NOTE: we can't c_maxIdfX10Value directly to min because min\n        \/\/ takes a reference and the compiler has already turned it into a\n        \/\/ constant, which we can't take a reference to.\n        auto local = Term::c_maxIdfX10Value;\n        Term::IdfX10 idf = std::min(term.GetIdfSum(), local);\n        return m_configurations[idf];\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * spc.cxx\n *\n * Copyright 2015 constroy <constroy.li@gmail.com>\n *\n *\n *\/\n\n#include <cstdio>\n#include \"lexer.hxx\"\n#include <set>\n\nint main(int argc,char *argv[])\n{\n\tif (argc!=3)\n\t{\n\t\tputs(\"usage: spc [src_name] [obj_name]\");\n\t\treturn 0;\n\t}\n\tToken token;\n\tLexer lexer(argv[1]);\n\t\/\/unit test [Lexer]------------------------------------------------\n\tconst std::string type[]=\n\t{\n\t\t\"ident\",\n\t\t\"number\",\"character\",\"string\",\n\t\t\"word_read\",\"word_write\",\n\t\t\"word_int\",\"word_char\",\"word_array\",\"word_of\",\n\t\t\"word_const\",\"word_var\",\"word_func\",\"word_proc\",\n\t\t\"word_do\",\"word_while\",\"word_for\",\"word_to\",\"word_downto\",\n\t\t\"word_if\",\"word_then\",\"word_else\",\"word_begin\",\"word_end\",\n\t\t\"assign\",\"plus\",\"minus\",\"times\",\"slash\",\"eql\",\"neq\",\"lss\",\"leq\",\"gtr\",\"geq\",\n\t\t\"lbracket\",\"rbracket\",\"lparen\",\"rparen\",\"colon\",\"comma\",\"semicolon\",\"period\",\n\n\t};\n\tfreopen(argv[2],\"w\",stdout);\n\tdo\n\t{\n\t\ttoken=lexer.nextToken();\n\t\tprintf(\"%-12s\",type[token.type].c_str());\n\t\tif (token.type==number) printf(\"%d\\n\",token.v);\n\t\telse if (token.type==character)\tprintf(\"%c\\n\",token.v);\n\t\telse printf(\"%s\\n\",token.s.c_str());\n\t}\n\twhile (token.type!=period);\n\t\/\/-----------------------------------------------------------------\n\treturn 0;\n}\n<commit_msg>remove useless code<commit_after>\/*\n * spc.cxx\n *\n * Copyright 2015 constroy <constroy.li@gmail.com>\n *\n *\n *\/\n\n#include <cstdio>\n#include \"lexer.hxx\"\n\nint main(int argc,char *argv[])\n{\n\tif (argc!=3)\n\t{\n\t\tputs(\"usage: spc [src_name] [obj_name]\");\n\t\treturn 0;\n\t}\n\tToken token;\n\tLexer lexer(argv[1]);\n\t\/\/unit test [Lexer]------------------------------------------------\n\tconst std::string type[]=\n\t{\n\t\t\"ident\",\n\t\t\"number\",\"character\",\"string\",\n\t\t\"word_read\",\"word_write\",\n\t\t\"word_int\",\"word_char\",\"word_array\",\"word_of\",\n\t\t\"word_const\",\"word_var\",\"word_func\",\"word_proc\",\n\t\t\"word_do\",\"word_while\",\"word_for\",\"word_to\",\"word_downto\",\n\t\t\"word_if\",\"word_then\",\"word_else\",\"word_begin\",\"word_end\",\n\t\t\"assign\",\"plus\",\"minus\",\"times\",\"slash\",\"eql\",\"neq\",\"lss\",\"leq\",\"gtr\",\"geq\",\n\t\t\"lbracket\",\"rbracket\",\"lparen\",\"rparen\",\"colon\",\"comma\",\"semicolon\",\"period\",\n\n\t};\n\tfreopen(argv[2],\"w\",stdout);\n\tdo\n\t{\n\t\ttoken=lexer.nextToken();\n\t\tprintf(\"%-12s\",type[token.type].c_str());\n\t\tif (token.type==number) printf(\"%d\\n\",token.v);\n\t\telse if (token.type==character)\tprintf(\"%c\\n\",token.v);\n\t\telse printf(\"%s\\n\",token.s.c_str());\n\t}\n\twhile (token.type!=period);\n\t\/\/-----------------------------------------------------------------\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n *  Copyright (C) 2012  Stefan Radomski (stefan.radomski@cs.tu-darmstadt.de)\n *\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 *\/\n\n#include \"umundo\/config.h\"\n#include \"umundo\/core.h\"\n#include <iostream>\n#include <string.h>\n\nusing namespace umundo;\n\nclass TestReceiver : public Receiver {\npublic:\n\tTestReceiver() {};\n\tvoid receive(Message* msg) {\n\t\tchar data[msg->size()+1];\n\t\tmemcpy(data, msg->data(), msg->size());\n\t\tdata[msg->size()]='\\0';\n\t\tif(msg->getMeta(\"type\")==\"RTP\")\n\t\t\tstd::cout << \"RTP(\" << msg->size() << \") --> '\" << data << \"'\" << std::endl << std::flush;\n\t\t\/*else\n\t\t{\n\t\t\tstd::cout << \"RTCP -->\";\n\t\t\tstd::cout << \" fraction='\" << msg->getMeta(\"fraction\") << \"'\";\n\t\t\tstd::cout << std::endl << std::flush;\n\t\t}*\/\n\t}\n};\n\nint main(int argc, char** argv) {\n\tprintf(\"umundo-rtp-sub version \" UMUNDO_VERSION \" (\" CMAKE_BUILD_TYPE \" build)\\n\");\n\n\tTestReceiver testRecv;\n\tRTPSubscriberConfig subConfig;\n\tSubscriber subFoo(Subscriber::RTP, \"pingpong\", &testRecv, &subConfig);\n\n\tDiscovery disc(Discovery::MDNS);\n\tNode node;\n\tdisc.add(node);\n\tnode.addSubscriber(subFoo);\n\n\twhile(1)\n\t\tThread::sleepMs(4000);\n\n\treturn 0;\n}\n<commit_msg>Fixed some code for msvc.<commit_after>\/**\n *  Copyright (C) 2012  Stefan Radomski (stefan.radomski@cs.tu-darmstadt.de)\n *\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 *\/\n\n#include \"umundo\/config.h\"\n#include \"umundo\/core.h\"\n#include <iostream>\n#include <string.h>\n\nusing namespace umundo;\n\nclass TestReceiver : public Receiver {\npublic:\n\tTestReceiver() {};\n\tvoid receive(Message* msg) {\n\t\tif(msg->getMeta(\"type\")==\"RTP\")\n\t\t{\n\t\t\tchar *data=(char*)malloc(msg->size()+1);\n\t\t\tif(data==NULL)\n\t\t\t{\n\t\t\t\tstd::cout << \"RTP packet received but error in malloc\" << std::endl << std::flush;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tmemcpy(data, msg->data(), msg->size());\n\t\t\tdata[msg->size()]='\\0';\n\t\t\tstd::cout << \"RTP(\" << msg->size() << \") --> '\" << data << \"'\" << std::endl << std::flush;\n\t\t\tfree(data);\n\t\t}\n\t\t\/*else\n\t\t{\n\t\t\tstd::cout << \"RTCP -->\";\n\t\t\tstd::cout << \" fraction='\" << msg->getMeta(\"fraction\") << \"'\";\n\t\t\tstd::cout << std::endl << std::flush;\n\t\t}*\/\n\t}\n};\n\nint main(int argc, char** argv) {\n\tprintf(\"umundo-rtp-sub version \" UMUNDO_VERSION \" (\" CMAKE_BUILD_TYPE \" build)\\n\");\n\n\tTestReceiver testRecv;\n\tRTPSubscriberConfig subConfig;\n\tSubscriber subFoo(Subscriber::RTP, \"pingpong\", &testRecv, &subConfig);\n\n\tDiscovery disc(Discovery::MDNS);\n\tNode node;\n\tdisc.add(node);\n\tnode.addSubscriber(subFoo);\n\n\twhile(1)\n\t\tThread::sleepMs(4000);\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright (C) 2015 INRA\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\n#ifndef INRA_EFYj_DETAILS_CONTEXT_IMPLEMENTATION_HPP\n#define INRA_EFYj_DETAILS_CONTEXT_IMPLEMENTATION_HPP\n\n#include <chrono>\n#include <iostream>\n#include <fstream>\n#include <memory>\n\nnamespace efyj {\n\nnamespace context_details {\n\ninline void cout_no_deleter(std::ostream *os)\n{\n    (void)os;\n}\n\ninline std::shared_ptr<std::ostream> make_log_stream(const std::string &filepath)\n{\n    {\n        std::shared_ptr <std::ofstream> tmp(new std::ofstream(filepath));\n\n        if (tmp->is_open())\n            return tmp;\n    }\n    {\n        std::shared_ptr <std::ofstream> tmp(new std::ofstream(\"efyj.log\"));\n\n        if (tmp->is_open())\n            return tmp;\n    }\n\n    return std::shared_ptr <std::ostream>(&std::cout, cout_no_deleter);\n}\n\ninline void writer_run(std::shared_ptr <std::ostream> &os, std::deque <message> &queue,\n                       std::mutex &queue_locker, std::mutex &os_locker, bool &close)\n{\n    std::deque <message> copy;\n\n    while (not close) {\n        std::this_thread::sleep_for(std::chrono::milliseconds(500));\n        {\n            std::lock_guard <std::mutex> lock(queue_locker);\n            copy = queue;\n            queue.clear();\n        }\n        {\n            std::lock_guard <std::mutex> lock(os_locker);\n\n            for (const auto &msg : copy)\n                (*os) << msg << '\\n';\n        }\n    }\n\n    if (not queue.empty()) {\n        {\n            std::lock_guard <std::mutex> lock(queue_locker);\n            copy = std::move(queue);\n            queue.clear();\n        }\n        {\n            std::lock_guard <std::mutex> lock(os_locker);\n\n            for (const auto &msg : copy) {\n                (*os) << msg << '\\n';\n            }\n        }\n    }\n}\n\n} \/\/ namespace context_details\n\ninline ContextImpl::ContextImpl(const std::string &filepath, LogOption option)\n    : m_os(context_details::make_log_stream(filepath))\n    , m_priority(option)\n    , m_close(false)\n{\n    m_writer = std::thread(context_details::writer_run,\n                           std::ref(m_os), std::ref(m_queue), std::ref(m_queue_locker),\n                           std::ref(m_os_locker), std::ref(m_close));\n}\n\ninline ContextImpl::~ContextImpl()\n{\n    m_close = true;\n\n    if (m_writer.joinable())\n        m_writer.join();\n}\n\ninline void ContextImpl::set_log_stream(const std::string &filepath)\n{\n    std::lock_guard <std::mutex> lock(m_os_locker);\n    m_os = context_details::make_log_stream(filepath);\n}\n\ntemplate <typename... _Args>\nvoid ContextImpl::log(_Args &&... args)\n{\n    std::lock_guard <std::mutex> lock(m_queue_locker);\n    m_queue.emplace_back(std::forward <_Args>(args)...);\n}\n\ninline LogOption ContextImpl::log_priority() const\n{\n    return m_priority;\n}\n\ninline void ContextImpl::set_log_priority(LogOption priority)\n{\n    priority = m_priority;\n}\n\n}\n\n#endif\n<commit_msg>context: fix set_log_priority bug<commit_after>\/* Copyright (C) 2015 INRA\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\n#ifndef INRA_EFYj_DETAILS_CONTEXT_IMPLEMENTATION_HPP\n#define INRA_EFYj_DETAILS_CONTEXT_IMPLEMENTATION_HPP\n\n#include <chrono>\n#include <iostream>\n#include <fstream>\n#include <memory>\n\nnamespace efyj {\n\nnamespace context_details {\n\ninline void cout_no_deleter(std::ostream *os)\n{\n    (void)os;\n}\n\ninline std::shared_ptr<std::ostream> make_log_stream(const std::string &filepath)\n{\n    {\n        std::shared_ptr <std::ofstream> tmp(new std::ofstream(filepath));\n\n        if (tmp->is_open())\n            return tmp;\n    }\n    {\n        std::shared_ptr <std::ofstream> tmp(new std::ofstream(\"efyj.log\"));\n\n        if (tmp->is_open())\n            return tmp;\n    }\n\n    return std::shared_ptr <std::ostream>(&std::cout, cout_no_deleter);\n}\n\ninline void writer_run(std::shared_ptr <std::ostream> &os, std::deque <message> &queue,\n                       std::mutex &queue_locker, std::mutex &os_locker, bool &close)\n{\n    std::deque <message> copy;\n\n    while (not close) {\n        std::this_thread::sleep_for(std::chrono::milliseconds(500));\n        {\n            std::lock_guard <std::mutex> lock(queue_locker);\n            copy = queue;\n            queue.clear();\n        }\n        {\n            std::lock_guard <std::mutex> lock(os_locker);\n\n            for (const auto &msg : copy)\n                (*os) << msg << '\\n';\n        }\n    }\n\n    if (not queue.empty()) {\n        {\n            std::lock_guard <std::mutex> lock(queue_locker);\n            copy = std::move(queue);\n            queue.clear();\n        }\n        {\n            std::lock_guard <std::mutex> lock(os_locker);\n\n            for (const auto &msg : copy) {\n                (*os) << msg << '\\n';\n            }\n        }\n    }\n}\n\n} \/\/ namespace context_details\n\ninline ContextImpl::ContextImpl(const std::string &filepath, LogOption option)\n    : m_os(context_details::make_log_stream(filepath))\n    , m_priority(option)\n    , m_close(false)\n{\n    m_writer = std::thread(context_details::writer_run,\n                           std::ref(m_os), std::ref(m_queue), std::ref(m_queue_locker),\n                           std::ref(m_os_locker), std::ref(m_close));\n}\n\ninline ContextImpl::~ContextImpl()\n{\n    m_close = true;\n\n    if (m_writer.joinable())\n        m_writer.join();\n}\n\ninline void ContextImpl::set_log_stream(const std::string &filepath)\n{\n    std::lock_guard <std::mutex> lock(m_os_locker);\n    m_os = context_details::make_log_stream(filepath);\n}\n\ntemplate <typename... _Args>\nvoid ContextImpl::log(_Args &&... args)\n{\n    std::lock_guard <std::mutex> lock(m_queue_locker);\n    m_queue.emplace_back(std::forward <_Args>(args)...);\n}\n\ninline LogOption ContextImpl::log_priority() const\n{\n    return m_priority;\n}\n\ninline void ContextImpl::set_log_priority(LogOption priority)\n{\n    m_priority = priority;\n}\n\n}\n\n#endif\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#include \"..\/general\/okina.hpp\"\n\n#include <cassert>\n\nnamespace mfem\n{\n\n\/\/ *****************************************************************************\n\/\/ * Tests if ptr is a known address\n\/\/ *****************************************************************************\nstatic bool Known(const mm::ledger &maps, const void *ptr)\n{\n   const mm::memory_map::const_iterator found = maps.memories.find(ptr);\n   const bool known = found != maps.memories.end();\n   if (known) { return true; }\n   return false;\n}\n\n\/\/ *****************************************************************************\n\/\/ * Looks if ptr is an alias of one memory\n\/\/ *****************************************************************************\nstatic const void* IsAlias(const mm::ledger &maps, const void *ptr)\n{\n   MFEM_ASSERT(!Known(maps, ptr), \"Ptr is an already known address!\");\n   for (mm::memory_map::const_iterator mem = maps.memories.begin();\n        mem != maps.memories.end(); mem++)\n   {\n      const void *b_ptr = mem->first;\n      if (b_ptr > ptr) { continue; }\n      const void *end = (char*)b_ptr + mem->second.bytes;\n      if (ptr < end) { return b_ptr; }\n   }\n   return NULL;\n}\n\n\/\/ *****************************************************************************\nstatic const void* InsertAlias(mm::ledger &maps,\n                               const void *base,\n                               const void *ptr)\n{\n   mm::memory &mem = maps.memories.at(base);\n   const size_t offset = (char *)ptr - (char *)base;\n   const mm::alias *alias = new mm::alias{&mem, offset};\n   maps.aliases[ptr] = alias;\n   mem.aliases.push_back(alias);\n   return ptr;\n}\n\n\/\/ *****************************************************************************\n\/\/ * Tests if ptr is an alias address\n\/\/ *****************************************************************************\nstatic bool Alias(mm::ledger &maps, const void *ptr)\n{\n   const mm::alias_map::const_iterator found = maps.aliases.find(ptr);\n   const bool alias = found != maps.aliases.end();\n   if (alias) { return true; }\n   const void *base = IsAlias(maps, ptr);\n   if (!base) { return false; }\n   InsertAlias(maps, base, ptr);\n   return true;\n}\n\n\/\/ *****************************************************************************\n\/*static void debugMode(void)\n{\n   dbg(\"\\033[1K\\r%sMM %sHasBeenEnabled %sEnabled %sDisabled \\\n%sCPU %sGPU %sPA %sCUDA %sOCCA\",\n       config::usingMM()?\"\\033[32m\":\"\\033[31m\",\n       config::gpuHasBeenEnabled()?\"\\033[32m\":\"\\033[31m\",\n       config::gpuEnabled()?\"\\033[32m\":\"\\033[31m\",\n       config::gpuDisabled()?\"\\033[32m\":\"\\033[31m\",\n       config::usingCpu()?\"\\033[32m\":\"\\033[31m\",\n       config::usingGpu()?\"\\033[32m\":\"\\033[31m\",\n       config::usingPA()?\"\\033[32m\":\"\\033[31m\",\n       config::usingCuda()?\"\\033[32m\":\"\\033[31m\",\n       config::usingOcca()?\"\\033[32m\":\"\\033[31m\");\n}*\/\n\n\/\/ *****************************************************************************\n\/\/ * Adds an address\n\/\/ *****************************************************************************\nvoid* mm::Insert(void *ptr, const size_t bytes)\n{\n   if (!config::usingMM()) { return ptr; }\n   if (config::gpuDisabled()) { return ptr; }\n   const bool known = Known(maps, ptr);\n   MFEM_ASSERT(!known, \"Trying to add already present address!\");\n   dbg(\"\\033[33m%p \\033[35m(%ldb)\", ptr, bytes);\n   maps.memories.emplace(ptr, memory(ptr, bytes));\n   return ptr;\n}\n\n\/\/ *****************************************************************************\n\/\/ * Remove the address from the map, as well as all the address' aliases\n\/\/ *****************************************************************************\nvoid *mm::Erase(void *ptr)\n{\n   if (!config::usingMM()) { return ptr; }\n   if (config::gpuDisabled()) { return ptr; }\n   const bool known = Known(maps, ptr);\n   \/\/ if (!known) { BUILTIN_TRAP; }\n   if (!known) { mfem_error(\"mm::Erase\"); }\n   MFEM_ASSERT(known, \"Trying to remove an unknown address!\");\n   const memory &mem = maps.memories.at(ptr);\n   dbg(\"\\033[33m %p \\033[35m(%ldb)\", ptr, mem.bytes);\n   for (const alias* const alias : mem.aliases)\n   {\n      maps.aliases.erase(alias);\n      delete alias;\n   }\n   maps.memories.erase(ptr);\n   return ptr;\n}\n\n\/\/ *****************************************************************************\nstatic void* PtrKnown(mm::ledger &maps, void *ptr)\n{\n   mm::memory &base = maps.memories.at(ptr);\n   const bool host = base.host;\n   const bool device = !host;\n   const size_t bytes = base.bytes;\n   const bool gpu = config::usingGpu();\n   if (host && !gpu) { return ptr; }\n   if (!base.d_ptr) { cuMemAlloc(&base.d_ptr, bytes); }\n   if (device &&  gpu) { return base.d_ptr; }\n   if (device && !gpu) \/\/ Pull\n   {\n      cuMemcpyDtoH(ptr, base.d_ptr, bytes);\n      base.host = true;\n      return ptr;\n   }\n   \/\/ Push\n   assert(host && gpu);\n   cuMemcpyHtoD(base.d_ptr, ptr, bytes);\n   base.host = false;\n   return base.d_ptr;\n}\n\n\/\/ *****************************************************************************\nstatic void* PtrAlias(mm::ledger &maps, void *ptr)\n{\n   const bool gpu = config::usingGpu();\n   const mm::alias *alias = maps.aliases.at(ptr);\n   const mm::memory *base = alias->mem;\n   const bool host = base->host;\n   const bool device = !base->host;\n   const size_t bytes = base->bytes;\n   if (host && !gpu) { return ptr; }\n   if (!base->d_ptr) { cuMemAlloc(&alias->mem->d_ptr, bytes); }\n   void *a_ptr = (char*)base->d_ptr + alias->offset;\n   if (device && gpu) { return a_ptr; }\n   if (device && !gpu) \/\/ Pull\n   {\n      assert(base->d_ptr);\n      cuMemcpyDtoH(base->h_ptr, base->d_ptr, bytes);\n      alias->mem->host = true;\n      return ptr;\n   }\n   \/\/ Push\n   assert(host && gpu);\n   cuMemcpyHtoD(base->d_ptr, base->h_ptr, bytes);\n   alias->mem->host = false;\n   return a_ptr;\n}\n\n\/\/ *****************************************************************************\n\/\/ * Turn an address to the right host or device one\n\/\/ *****************************************************************************\nvoid* mm::Ptr(void *ptr)\n{\n   if (!config::usingMM()) { return ptr; }\n   if (config::gpuDisabled()) { return ptr; }\n   if (!config::gpuHasBeenEnabled()) { return ptr; }\n   if (Known(maps, ptr)) { return PtrKnown(maps, ptr); }\n   const bool alias = Alias(maps, ptr);\n   \/\/ if (!alias) { BUILTIN_TRAP; }\n   if (!alias) { mfem_error(\"mm::Ptr\"); }\n   MFEM_ASSERT(alias, \"Unknown address!\");\n   return PtrAlias(maps, ptr);\n}\n\n\/\/ *****************************************************************************\nconst void* mm::Ptr(const void *ptr)\n{\n   return (const void *) Ptr((void *)ptr);\n}\n\n\/\/ *****************************************************************************\nstatic OccaMemory occaMemory(mm::ledger &maps, const void *ptr)\n{\n   OccaDevice occaDevice = config::GetOccaDevice();\n   if (!config::usingMM())\n   {\n      OccaMemory o_ptr = occaWrapMemory(occaDevice, (void *)ptr, 0);\n      return o_ptr;\n   }\n   const bool known = Known(maps, ptr);\n   \/\/ if (!known) { BUILTIN_TRAP; }\n   if (!known) { mfem_error(\"occaMemory\"); }\n   MFEM_ASSERT(known, \"Unknown address!\");\n   mm::memory &base = maps.memories.at(ptr);\n   const size_t bytes = base.bytes;\n   const bool gpu = config::usingGpu();\n   const bool occa = config::usingOcca();\n   MFEM_ASSERT(occa, \"Using OCCA memory without OCCA mode!\");\n   if (!base.d_ptr)\n   {\n      base.host = false; \/\/ This address is no more on the host\n      if (gpu)\n      {\n         cuMemAlloc(&base.d_ptr, bytes);\n         void *stream = config::Stream();\n         cuMemcpyHtoDAsync(base.d_ptr, base.h_ptr, bytes, stream);\n      }\n      else\n      {\n         base.o_ptr = occaDeviceMalloc(occaDevice, bytes);\n         base.d_ptr = occaMemoryPtr(base.o_ptr);\n         occaCopyFrom(base.o_ptr, base.h_ptr);\n      }\n   }\n   if (gpu)\n   {\n      return occaWrapMemory(occaDevice, base.d_ptr, bytes);\n   }\n   return base.o_ptr;\n}\n\n\/\/ *****************************************************************************\nOccaMemory mm::Memory(const void *ptr)\n{\n   return occaMemory(maps, ptr);\n}\n\n\/\/ *****************************************************************************\nstatic void PushKnown(mm::ledger &maps, const void *ptr, const size_t bytes)\n{\n   mm::memory &base = maps.memories.at(ptr);\n   if (!base.d_ptr) { cuMemAlloc(&base.d_ptr, base.bytes); }\n   cuMemcpyHtoD(base.d_ptr, ptr, bytes == 0 ? base.bytes : bytes);\n}\n\n\/\/ *****************************************************************************\nstatic void PushAlias(const mm::ledger &maps, const void *ptr,\n                      const size_t bytes)\n{\n   const mm::alias *alias = maps.aliases.at(ptr);\n   cuMemcpyHtoD((char*)alias->mem->d_ptr + alias->offset, ptr, bytes);\n}\n\n\/\/ *****************************************************************************\nvoid mm::Push(const void *ptr, const size_t bytes)\n{\n   if (config::gpuDisabled()) { return; }\n   if (!config::usingMM()) { return; }\n   if (!config::gpuHasBeenEnabled()) { return; }\n   if (Known(maps, ptr)) { return PushKnown(maps, ptr, bytes); }\n   assert(!config::usingOcca());\n   const bool alias = Alias(maps, ptr);\n   \/\/ if (!alias) { BUILTIN_TRAP; }\n   if (!alias) { mfem_error(\"mm::Push\"); }\n   MFEM_ASSERT(alias, \"Unknown address!\");\n   return PushAlias(maps, ptr, bytes);\n}\n\n\/\/ *****************************************************************************\nstatic void PullKnown(const mm::ledger &maps, const void *ptr,\n                      const size_t bytes)\n{\n   const mm::memory &base = maps.memories.at(ptr);\n   cuMemcpyDtoH(base.h_ptr, base.d_ptr, bytes == 0 ? base.bytes : bytes);\n}\n\n\/\/ *****************************************************************************\nstatic void PullAlias(const mm::ledger &maps, const void *ptr,\n                      const size_t bytes)\n{\n   const mm::alias *alias = maps.aliases.at(ptr);\n   cuMemcpyDtoH((void *)ptr, (char*)alias->mem->d_ptr + alias->offset, bytes);\n}\n\n\/\/ *****************************************************************************\nvoid mm::Pull(const void *ptr, const size_t bytes)\n{\n   if (config::gpuDisabled()) { return; }\n   if (!config::usingMM()) { return; }\n   if (!config::gpuHasBeenEnabled()) { return; }\n   if (Known(maps, ptr)) { return PullKnown(maps, ptr, bytes); }\n   assert(!config::usingOcca());\n   const bool alias = Alias(maps, ptr);\n   \/\/ if (!alias) { BUILTIN_TRAP; }\n   if (!alias) { mfem_error(\"mm::Pull\"); }\n   MFEM_ASSERT(alias, \"Unknown address!\");\n   return PullAlias(maps, ptr, bytes);\n}\n\n\/\/ *****************************************************************************\n\/\/ __attribute__((unused)) \/\/ VS doesn't like this in Appveyor\nstatic void Dump(const mm::ledger &maps)\n{\n   if (!getenv(\"DBG\")) { return; }\n   const mm::memory_map &mem = maps.memories;\n   const mm::alias_map  &als = maps.aliases;\n   size_t k = 0;\n   for (mm::memory_map::const_iterator m = mem.begin(); m != mem.end(); m++)\n   {\n      const void *h_ptr = m->first;\n      assert(h_ptr == m->second.h_ptr);\n      const size_t bytes = m->second.bytes;\n      const void *d_ptr = m->second.d_ptr;\n      if (!d_ptr)\n      {\n         printf(\"\\n[%ld] \\033[33m%p \\033[35m(%ld)\", k, h_ptr, bytes);\n      }\n      else\n      {\n         printf(\"\\n[%ld] \\033[33m%p \\033[35m (%ld) \\033[32 -> %p\",\n                k, h_ptr, bytes, d_ptr);\n      }\n      fflush(0);\n      k++;\n   }\n   k = 0;\n   for (mm::alias_map::const_iterator a = als.begin(); a != als.end(); a++)\n   {\n      const void *ptr = a->first;\n      const size_t offset = a->second->offset;\n      const void *base = a->second->mem->h_ptr;\n      printf(\"\\n[%ld] \\033[33m%p < (\\033[37m%ld) < \\033[33m%p\",\n             k, base, offset, ptr);\n      fflush(0);\n      k++;\n   }\n}\n\n\/\/ *****************************************************************************\n\/\/ * Data will be pushed\/pulled before the copy happens on the H or the D\n\/\/ *****************************************************************************\nstatic void* d2d(void *dst, const void *src, const size_t bytes,\n                 const bool async)\n{\n   GET_PTR(src);\n   GET_PTR(dst);\n   const bool cpu = config::usingCpu();\n   if (cpu) { return std::memcpy(d_dst, d_src, bytes); }\n   if (!async) { return cuMemcpyDtoD(d_dst, (void *)d_src, bytes); }\n   return cuMemcpyDtoDAsync(d_dst, (void *)d_src, bytes, config::Stream());\n}\n\n\/\/ *****************************************************************************\nvoid* mm::memcpy(void *dst, const void *src, const size_t bytes,\n                 const bool async)\n{\n   if (bytes == 0)\n   {\n      return dst;\n   }\n   else\n   {\n      return d2d(dst, src, bytes, async);\n   }\n}\n\n} \/\/ namespace mfem\n<commit_msg>added comment regarding gpu being disabled<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#include \"..\/general\/okina.hpp\"\n\n#include <cassert>\n\nnamespace mfem\n{\n\n\/\/ *****************************************************************************\n\/\/ * Tests if ptr is a known address\n\/\/ *****************************************************************************\nstatic bool Known(const mm::ledger &maps, const void *ptr)\n{\n   const mm::memory_map::const_iterator found = maps.memories.find(ptr);\n   const bool known = found != maps.memories.end();\n   if (known) { return true; }\n   return false;\n}\n\n\/\/ *****************************************************************************\n\/\/ * Looks if ptr is an alias of one memory\n\/\/ *****************************************************************************\nstatic const void* IsAlias(const mm::ledger &maps, const void *ptr)\n{\n   MFEM_ASSERT(!Known(maps, ptr), \"Ptr is an already known address!\");\n   for (mm::memory_map::const_iterator mem = maps.memories.begin();\n        mem != maps.memories.end(); mem++)\n   {\n      const void *b_ptr = mem->first;\n      if (b_ptr > ptr) { continue; }\n      const void *end = (char*)b_ptr + mem->second.bytes;\n      if (ptr < end) { return b_ptr; }\n   }\n   return NULL;\n}\n\n\/\/ *****************************************************************************\nstatic const void* InsertAlias(mm::ledger &maps,\n                               const void *base,\n                               const void *ptr)\n{\n   mm::memory &mem = maps.memories.at(base);\n   const size_t offset = (char *)ptr - (char *)base;\n   const mm::alias *alias = new mm::alias{&mem, offset};\n   maps.aliases[ptr] = alias;\n   mem.aliases.push_back(alias);\n   return ptr;\n}\n\n\/\/ *****************************************************************************\n\/\/ * Tests if ptr is an alias address\n\/\/ *****************************************************************************\nstatic bool Alias(mm::ledger &maps, const void *ptr)\n{\n   const mm::alias_map::const_iterator found = maps.aliases.find(ptr);\n   const bool alias = found != maps.aliases.end();\n   if (alias) { return true; }\n   const void *base = IsAlias(maps, ptr);\n   if (!base) { return false; }\n   InsertAlias(maps, base, ptr);\n   return true;\n}\n\n\/\/ *****************************************************************************\n\/*static void debugMode(void)\n{\n   dbg(\"\\033[1K\\r%sMM %sHasBeenEnabled %sEnabled %sDisabled \\\n%sCPU %sGPU %sPA %sCUDA %sOCCA\",\n       config::usingMM()?\"\\033[32m\":\"\\033[31m\",\n       config::gpuHasBeenEnabled()?\"\\033[32m\":\"\\033[31m\",\n       config::gpuEnabled()?\"\\033[32m\":\"\\033[31m\",\n       config::gpuDisabled()?\"\\033[32m\":\"\\033[31m\",\n       config::usingCpu()?\"\\033[32m\":\"\\033[31m\",\n       config::usingGpu()?\"\\033[32m\":\"\\033[31m\",\n       config::usingPA()?\"\\033[32m\":\"\\033[31m\",\n       config::usingCuda()?\"\\033[32m\":\"\\033[31m\",\n       config::usingOcca()?\"\\033[32m\":\"\\033[31m\");\n}*\/\n\n\/\/ *****************************************************************************\n\/\/ * Adds an address\n\/\/ *****************************************************************************\nvoid* mm::Insert(void *ptr, const size_t bytes)\n{\n   if (!config::usingMM()) { return ptr; }\n   if (config::gpuDisabled()) { return ptr; }\n   const bool known = Known(maps, ptr);\n   MFEM_ASSERT(!known, \"Trying to add already present address!\");\n   dbg(\"\\033[33m%p \\033[35m(%ldb)\", ptr, bytes);\n   maps.memories.emplace(ptr, memory(ptr, bytes));\n   return ptr;\n}\n\n\/\/ *****************************************************************************\n\/\/ * Remove the address from the map, as well as all the address' aliases\n\/\/ *****************************************************************************\nvoid *mm::Erase(void *ptr)\n{\n   if (!config::usingMM()) { return ptr; }\n   if (config::gpuDisabled()) { return ptr; } \/\/I think by default the condition should be true.\n   const bool known = Known(maps, ptr);\n   \/\/ if (!known) { BUILTIN_TRAP; }\n   if (!known) { mfem_error(\"mm::Erase\"); }\n   MFEM_ASSERT(known, \"Trying to remove an unknown address!\");\n   const memory &mem = maps.memories.at(ptr);\n   dbg(\"\\033[33m %p \\033[35m(%ldb)\", ptr, mem.bytes);\n   for (const alias* const alias : mem.aliases)\n   {\n      maps.aliases.erase(alias);\n      delete alias;\n   }\n   maps.memories.erase(ptr);\n   return ptr;\n}\n\n\/\/ *****************************************************************************\nstatic void* PtrKnown(mm::ledger &maps, void *ptr)\n{\n   mm::memory &base = maps.memories.at(ptr);\n   const bool host = base.host;\n   const bool device = !host;\n   const size_t bytes = base.bytes;\n   const bool gpu = config::usingGpu();\n   if (host && !gpu) { return ptr; }\n   if (!base.d_ptr) { cuMemAlloc(&base.d_ptr, bytes); }\n   if (device &&  gpu) { return base.d_ptr; }\n   if (device && !gpu) \/\/ Pull\n   {\n      cuMemcpyDtoH(ptr, base.d_ptr, bytes);\n      base.host = true;\n      return ptr;\n   }\n   \/\/ Push\n   assert(host && gpu);\n   cuMemcpyHtoD(base.d_ptr, ptr, bytes);\n   base.host = false;\n   return base.d_ptr;\n}\n\n\/\/ *****************************************************************************\nstatic void* PtrAlias(mm::ledger &maps, void *ptr)\n{\n   const bool gpu = config::usingGpu();\n   const mm::alias *alias = maps.aliases.at(ptr);\n   const mm::memory *base = alias->mem;\n   const bool host = base->host;\n   const bool device = !base->host;\n   const size_t bytes = base->bytes;\n   if (host && !gpu) { return ptr; }\n   if (!base->d_ptr) { cuMemAlloc(&alias->mem->d_ptr, bytes); }\n   void *a_ptr = (char*)base->d_ptr + alias->offset;\n   if (device && gpu) { return a_ptr; }\n   if (device && !gpu) \/\/ Pull\n   {\n      assert(base->d_ptr);\n      cuMemcpyDtoH(base->h_ptr, base->d_ptr, bytes);\n      alias->mem->host = true;\n      return ptr;\n   }\n   \/\/ Push\n   assert(host && gpu);\n   cuMemcpyHtoD(base->d_ptr, base->h_ptr, bytes);\n   alias->mem->host = false;\n   return a_ptr;\n}\n\n\/\/ *****************************************************************************\n\/\/ * Turn an address to the right host or device one\n\/\/ *****************************************************************************\nvoid* mm::Ptr(void *ptr)\n{\n   if (!config::usingMM()) { return ptr; }\n   if (config::gpuDisabled()) { return ptr; }\n   if (!config::gpuHasBeenEnabled()) { return ptr; }\n   if (Known(maps, ptr)) { return PtrKnown(maps, ptr); }\n   const bool alias = Alias(maps, ptr);\n   \/\/ if (!alias) { BUILTIN_TRAP; }\n   if (!alias) { mfem_error(\"mm::Ptr\"); }\n   MFEM_ASSERT(alias, \"Unknown address!\");\n   return PtrAlias(maps, ptr);\n}\n\n\/\/ *****************************************************************************\nconst void* mm::Ptr(const void *ptr)\n{\n   return (const void *) Ptr((void *)ptr);\n}\n\n\/\/ *****************************************************************************\nstatic OccaMemory occaMemory(mm::ledger &maps, const void *ptr)\n{\n   OccaDevice occaDevice = config::GetOccaDevice();\n   if (!config::usingMM())\n   {\n      OccaMemory o_ptr = occaWrapMemory(occaDevice, (void *)ptr, 0);\n      return o_ptr;\n   }\n   const bool known = Known(maps, ptr);\n   \/\/ if (!known) { BUILTIN_TRAP; }\n   if (!known) { mfem_error(\"occaMemory\"); }\n   MFEM_ASSERT(known, \"Unknown address!\");\n   mm::memory &base = maps.memories.at(ptr);\n   const size_t bytes = base.bytes;\n   const bool gpu = config::usingGpu();\n   const bool occa = config::usingOcca();\n   MFEM_ASSERT(occa, \"Using OCCA memory without OCCA mode!\");\n   if (!base.d_ptr)\n   {\n      base.host = false; \/\/ This address is no more on the host\n      if (gpu)\n      {\n         cuMemAlloc(&base.d_ptr, bytes);\n         void *stream = config::Stream();\n         cuMemcpyHtoDAsync(base.d_ptr, base.h_ptr, bytes, stream);\n      }\n      else\n      {\n         base.o_ptr = occaDeviceMalloc(occaDevice, bytes);\n         base.d_ptr = occaMemoryPtr(base.o_ptr);\n         occaCopyFrom(base.o_ptr, base.h_ptr);\n      }\n   }\n   if (gpu)\n   {\n      return occaWrapMemory(occaDevice, base.d_ptr, bytes);\n   }\n   return base.o_ptr;\n}\n\n\/\/ *****************************************************************************\nOccaMemory mm::Memory(const void *ptr)\n{\n   return occaMemory(maps, ptr);\n}\n\n\/\/ *****************************************************************************\nstatic void PushKnown(mm::ledger &maps, const void *ptr, const size_t bytes)\n{\n   mm::memory &base = maps.memories.at(ptr);\n   if (!base.d_ptr) { cuMemAlloc(&base.d_ptr, base.bytes); }\n   cuMemcpyHtoD(base.d_ptr, ptr, bytes == 0 ? base.bytes : bytes);\n}\n\n\/\/ *****************************************************************************\nstatic void PushAlias(const mm::ledger &maps, const void *ptr,\n                      const size_t bytes)\n{\n   const mm::alias *alias = maps.aliases.at(ptr);\n   cuMemcpyHtoD((char*)alias->mem->d_ptr + alias->offset, ptr, bytes);\n}\n\n\/\/ *****************************************************************************\nvoid mm::Push(const void *ptr, const size_t bytes)\n{\n   if (config::gpuDisabled()) { return; }\n   if (!config::usingMM()) { return; }\n   if (!config::gpuHasBeenEnabled()) { return; }\n   if (Known(maps, ptr)) { return PushKnown(maps, ptr, bytes); }\n   assert(!config::usingOcca());\n   const bool alias = Alias(maps, ptr);\n   \/\/ if (!alias) { BUILTIN_TRAP; }\n   if (!alias) { mfem_error(\"mm::Push\"); }\n   MFEM_ASSERT(alias, \"Unknown address!\");\n   return PushAlias(maps, ptr, bytes);\n}\n\n\/\/ *****************************************************************************\nstatic void PullKnown(const mm::ledger &maps, const void *ptr,\n                      const size_t bytes)\n{\n   const mm::memory &base = maps.memories.at(ptr);\n   cuMemcpyDtoH(base.h_ptr, base.d_ptr, bytes == 0 ? base.bytes : bytes);\n}\n\n\/\/ *****************************************************************************\nstatic void PullAlias(const mm::ledger &maps, const void *ptr,\n                      const size_t bytes)\n{\n   const mm::alias *alias = maps.aliases.at(ptr);\n   cuMemcpyDtoH((void *)ptr, (char*)alias->mem->d_ptr + alias->offset, bytes);\n}\n\n\/\/ *****************************************************************************\nvoid mm::Pull(const void *ptr, const size_t bytes)\n{\n   if (config::gpuDisabled()) { return; }\n   if (!config::usingMM()) { return; }\n   if (!config::gpuHasBeenEnabled()) { return; }\n   if (Known(maps, ptr)) { return PullKnown(maps, ptr, bytes); }\n   assert(!config::usingOcca());\n   const bool alias = Alias(maps, ptr);\n   \/\/ if (!alias) { BUILTIN_TRAP; }\n   if (!alias) { mfem_error(\"mm::Pull\"); }\n   MFEM_ASSERT(alias, \"Unknown address!\");\n   return PullAlias(maps, ptr, bytes);\n}\n\n\/\/ *****************************************************************************\n\/\/ __attribute__((unused)) \/\/ VS doesn't like this in Appveyor\nstatic void Dump(const mm::ledger &maps)\n{\n   if (!getenv(\"DBG\")) { return; }\n   const mm::memory_map &mem = maps.memories;\n   const mm::alias_map  &als = maps.aliases;\n   size_t k = 0;\n   for (mm::memory_map::const_iterator m = mem.begin(); m != mem.end(); m++)\n   {\n      const void *h_ptr = m->first;\n      assert(h_ptr == m->second.h_ptr);\n      const size_t bytes = m->second.bytes;\n      const void *d_ptr = m->second.d_ptr;\n      if (!d_ptr)\n      {\n         printf(\"\\n[%ld] \\033[33m%p \\033[35m(%ld)\", k, h_ptr, bytes);\n      }\n      else\n      {\n         printf(\"\\n[%ld] \\033[33m%p \\033[35m (%ld) \\033[32 -> %p\",\n                k, h_ptr, bytes, d_ptr);\n      }\n      fflush(0);\n      k++;\n   }\n   k = 0;\n   for (mm::alias_map::const_iterator a = als.begin(); a != als.end(); a++)\n   {\n      const void *ptr = a->first;\n      const size_t offset = a->second->offset;\n      const void *base = a->second->mem->h_ptr;\n      printf(\"\\n[%ld] \\033[33m%p < (\\033[37m%ld) < \\033[33m%p\",\n             k, base, offset, ptr);\n      fflush(0);\n      k++;\n   }\n}\n\n\/\/ *****************************************************************************\n\/\/ * Data will be pushed\/pulled before the copy happens on the H or the D\n\/\/ *****************************************************************************\nstatic void* d2d(void *dst, const void *src, const size_t bytes,\n                 const bool async)\n{\n   GET_PTR(src);\n   GET_PTR(dst);\n   const bool cpu = config::usingCpu();\n   if (cpu) { return std::memcpy(d_dst, d_src, bytes); }\n   if (!async) { return cuMemcpyDtoD(d_dst, (void *)d_src, bytes); }\n   return cuMemcpyDtoDAsync(d_dst, (void *)d_src, bytes, config::Stream());\n}\n\n\/\/ *****************************************************************************\nvoid* mm::memcpy(void *dst, const void *src, const size_t bytes,\n                 const bool async)\n{\n   if (bytes == 0)\n   {\n      return dst;\n   }\n   else\n   {\n      return d2d(dst, src, bytes, async);\n   }\n}\n\n} \/\/ namespace mfem\n<|endoftext|>"}
{"text":"<commit_before>#include \"CmdLineParameters.hpp\"\n\n#include <stdexcept>\n#include <sstream>\n#include <cstring>\n#include <string>\n#include <algorithm>\n#include <thread>\n\nusing namespace std;\n\nnamespace duke {\n\nnamespace {\n\ntemplate<typename T>\nvoid getArgs(const int argc, char**argv, int i, T& value) {\n    if (i >= argc)\n        throw logic_error(\"missing command line value\");\n    istringstream iss(argv[i]);\n    iss >> value;\n    if (iss.fail())\n        throw logic_error(\"bad command line argument type\");\n}\n\nbool matches(const string option, const string shortOption, const string longOption) {\n    return option == shortOption || option == longOption;\n}\n\n}  \/\/ namespace\n\nunsigned CmdLineParameters::getDefaultConcurrency() {\n    return max(1u, min(4u, thread::hardware_concurrency() - 2));\n}\n\nsize_t CmdLineParameters::getDefaultCacheSize() {\n    return 500 * 1024 * 1024; \/\/ 500MiB\n}\n\nCmdLineParameters::CmdLineParameters(int argc, char**argv) {\n    for (int i = 1; i < argc; ++i) {\n        const char* pOption = argv[i];\n        if (matches(pOption, \"\", \"--swapinterval\"))\n            getArgs(argc, argv, ++i, swapBufferInterval);\n        else if (matches(pOption, \"-f\", \"--fullscreen\"))\n            fullscreen = true;\n        else if (matches(pOption, \"\", \"--unlimited\"))\n            unlimitedFPS = true;\n        else if (matches(pOption, \"-t\", \"--threads\"))\n            getArgs(argc, argv, ++i, workerThreadDefault);\n        else if (matches(pOption, \"\", \"--film\"))\n            defaultFrameRate = FrameDuration::FILM;\n        else if (matches(pOption, \"\", \"--ntsc\"))\n            defaultFrameRate = FrameDuration::NTSC;\n        else if (matches(pOption, \"\", \"--pal\"))\n            defaultFrameRate = FrameDuration::PAL;\n        else if (matches(pOption, \"-s\", \"--cache-size\")) {\n            getArgs(argc, argv, ++i, imageCacheSizeDefault);\n            imageCacheSizeDefault *= 1024 * 1024;\n        } else if (matches(pOption, \"\", \"--benchmark\"))\n            mode = ApplicationMode::BENCHMARK;\n        else if (matches(pOption, \"-h\", \"--help\"))\n            mode = ApplicationMode::HELP;\n        else if (matches(pOption, \"-v\", \"--version\"))\n            mode = ApplicationMode::VERSION;\n        else if (matches(pOption, \"-l\", \"--list\"))\n            mode = ApplicationMode::LIST_SUPPORTED_FORMAT;\n        else if (*pOption != '-')\n            additionnalOptions.push_back(pOption);\n        else\n            throw logic_error(string(\"unknown command line argument '\") + pOption + \"'\");\n    }\n}\n\nvoid CmdLineParameters::printHelpMessage() const {\n    printf(R\"(Usage: duke [OPTION]... [FILE\/FOLDER]...\n  -h, --help                 display this help and exit\n  -v, --version              output version information and exit\n      --benchmark            tests current machine's performance.\n      --swapinterval SIZE    specifies SIZE mandatory count of wait for\n                             vblank before displaying a frame, default is 1.\n\n      --pal                  sets framerate to 25 fps (default)\n      --film                 sets framerate to 24 fps\n      --ntsc                 sets framerate to 29.97 fps\n      --unlimited            unlimited framerate, benchmarking purpose\n\n  -f, --fullscreen           switch to fullscreen mode.\n  -l, --list-formats         output supported formats and exit\n  -s, --cache-size SIZE      size of the in-memory cache system in MiB,\n                             default is %lu.\n  -t, --threads SIZE         specify the number of decoding threads,\n                             defaults to %u for this machine.\n)\", getDefaultCacheSize() \/ (1024 * 1024), getDefaultConcurrency());\n}\n\n}  \/\/ namespace duke\n<commit_msg>fixes #34 --max-cache-size flag<commit_after>#include \"CmdLineParameters.hpp\"\n\n#include <duke\/memory\/AvailableMemory.hpp>\n\n#include <stdexcept>\n#include <sstream>\n#include <cstring>\n#include <string>\n#include <algorithm>\n#include <thread>\n\nusing namespace std;\n\nnamespace duke {\n\nnamespace {\n\ntemplate<typename T>\nvoid getArgs(const int argc, char**argv, int i, T& value) {\n    if (i >= argc)\n        throw logic_error(\"missing command line value\");\n    istringstream iss(argv[i]);\n    iss >> value;\n    if (iss.fail())\n        throw logic_error(\"bad command line argument type\");\n}\n\nbool matches(const string option, const string shortOption, const string longOption) {\n    return option == shortOption || option == longOption;\n}\n\n}  \/\/ namespace\n\nunsigned CmdLineParameters::getDefaultConcurrency() {\n    return max(1u, min(4u, thread::hardware_concurrency() - 2));\n}\n\nsize_t CmdLineParameters::getDefaultCacheSize() {\n    return 500 * 1024 * 1024; \/\/ 500MiB\n}\n\nCmdLineParameters::CmdLineParameters(int argc, char**argv) {\n    for (int i = 1; i < argc; ++i) {\n        const char* pOption = argv[i];\n        if (matches(pOption, \"\", \"--swapinterval\"))\n            getArgs(argc, argv, ++i, swapBufferInterval);\n        else if (matches(pOption, \"-f\", \"--fullscreen\"))\n            fullscreen = true;\n        else if (matches(pOption, \"\", \"--unlimited\"))\n            unlimitedFPS = true;\n        else if (matches(pOption, \"-t\", \"--threads\"))\n            getArgs(argc, argv, ++i, workerThreadDefault);\n        else if (matches(pOption, \"\", \"--film\"))\n            defaultFrameRate = FrameDuration::FILM;\n        else if (matches(pOption, \"\", \"--ntsc\"))\n            defaultFrameRate = FrameDuration::NTSC;\n        else if (matches(pOption, \"\", \"--pal\"))\n            defaultFrameRate = FrameDuration::PAL;\n        else if (matches(pOption, \"\", \"--max-cache-size\")) {\n            imageCacheSizeDefault = getTotalSystemMemory() * 80 \/ 100;\n        } else if (matches(pOption, \"-s\", \"--cache-size\")) {\n            getArgs(argc, argv, ++i, imageCacheSizeDefault);\n            imageCacheSizeDefault *= 1024 * 1024;\n        } else if (matches(pOption, \"\", \"--benchmark\"))\n            mode = ApplicationMode::BENCHMARK;\n        else if (matches(pOption, \"-h\", \"--help\"))\n            mode = ApplicationMode::HELP;\n        else if (matches(pOption, \"-v\", \"--version\"))\n            mode = ApplicationMode::VERSION;\n        else if (matches(pOption, \"-l\", \"--list\"))\n            mode = ApplicationMode::LIST_SUPPORTED_FORMAT;\n        else if (*pOption != '-')\n            additionnalOptions.push_back(pOption);\n        else\n            throw logic_error(string(\"unknown command line argument '\") + pOption + \"'\");\n    }\n}\n\nvoid CmdLineParameters::printHelpMessage() const {\n    printf(R\"(Usage: duke [OPTION]... [FILE\/FOLDER]...\n  -h, --help                 display this help and exit\n  -v, --version              output version information and exit\n      --benchmark            tests current machine's performance.\n      --swapinterval SIZE    specifies SIZE mandatory count of wait for\n                             vblank before displaying a frame, default is 1.\n\n      --pal                  sets framerate to 25 fps (default)\n      --film                 sets framerate to 24 fps\n      --ntsc                 sets framerate to 29.97 fps\n      --unlimited            unlimited framerate, benchmarking purpose\n\n  -f, --fullscreen           switch to fullscreen mode.\n  -l, --list-formats         output supported formats and exit\n  -s, --cache-size SIZE      size of the in-memory cache system in MiB,\n                             default is %lu.\n      --max-cache-size       size of the in-memory cache system set to 80%%\n                             of machine memory.\n  -t, --threads SIZE         specify the number of decoding threads,\n                             defaults to %u for this machine.\n)\", getDefaultCacheSize() \/ (1024 * 1024), getDefaultConcurrency());\n}\n\n}  \/\/ namespace duke\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Planning: adjusted park_and_go end pose speed.<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 \"ui\/views\/widget\/desktop_aura\/x11_desktop_handler.h\"\n\n#include <X11\/Xatom.h>\n#include <X11\/Xlib.h>\n\n#include \"base\/message_loop\/message_loop.h\"\n#include \"ui\/aura\/env.h\"\n#include \"ui\/aura\/root_window.h\"\n#include \"ui\/base\/x\/x11_util.h\"\n\n#if !defined(OS_CHROMEOS)\n#include \"ui\/views\/ime\/input_method.h\"\n#include \"ui\/views\/widget\/desktop_aura\/desktop_root_window_host_x11.h\"\n#endif\n\nnamespace {\n\nconst char* kAtomsToCache[] = {\n  \"_NET_ACTIVE_WINDOW\",\n  \"_NET_SUPPORTED\",\n  NULL\n};\n\n\/\/ Our global instance. Deleted when our Env() is deleted.\nviews::X11DesktopHandler* g_handler = NULL;\n\n}  \/\/ namespace\n\nnamespace views {\n\n\/\/ static\nX11DesktopHandler* X11DesktopHandler::get() {\n  if (!g_handler)\n    g_handler = new X11DesktopHandler;\n\n  return g_handler;\n}\n\nX11DesktopHandler::X11DesktopHandler()\n    : xdisplay_(gfx::GetXDisplay()),\n      x_root_window_(DefaultRootWindow(xdisplay_)),\n      current_window_(None),\n      atom_cache_(xdisplay_, kAtomsToCache),\n      wm_supports_active_window_(false) {\n  base::MessagePumpX11::Current()->AddDispatcherForRootWindow(this);\n  aura::Env::GetInstance()->AddObserver(this);\n\n  XWindowAttributes attr;\n  XGetWindowAttributes(xdisplay_, x_root_window_, &attr);\n  XSelectInput(xdisplay_, x_root_window_,\n               attr.your_event_mask | PropertyChangeMask |\n               StructureNotifyMask | SubstructureNotifyMask);\n\n  ::Window active_window;\n  wm_supports_active_window_ =\n    ui::GetXIDProperty(x_root_window_, \"_NET_ACTIVE_WINDOW\", &active_window) &&\n    active_window;\n}\n\nX11DesktopHandler::~X11DesktopHandler() {\n  aura::Env::GetInstance()->RemoveObserver(this);\n  base::MessagePumpX11::Current()->RemoveDispatcherForRootWindow(this);\n}\n\nvoid X11DesktopHandler::ActivateWindow(::Window window) {\n  if (wm_supports_active_window_) {\n    DCHECK_EQ(gfx::GetXDisplay(), xdisplay_);\n\n    XEvent xclient;\n    memset(&xclient, 0, sizeof(xclient));\n    xclient.type = ClientMessage;\n    xclient.xclient.window = window;\n    xclient.xclient.message_type = atom_cache_.GetAtom(\"_NET_ACTIVE_WINDOW\");\n    xclient.xclient.format = 32;\n    xclient.xclient.data.l[0] = 1;  \/\/ Specified we are an app.\n    xclient.xclient.data.l[1] = CurrentTime;\n    xclient.xclient.data.l[2] = None;\n    xclient.xclient.data.l[3] = 0;\n    xclient.xclient.data.l[4] = 0;\n\n    XSendEvent(xdisplay_, x_root_window_, False,\n               SubstructureRedirectMask | SubstructureNotifyMask,\n               &xclient);\n  } else {\n    XRaiseWindow(xdisplay_, window);\n\n    \/\/ XRaiseWindow will not give input focus to the window. We now need to ask\n    \/\/ the X server to do that. Note that the call will raise an X error if the\n    \/\/ window is not mapped.\n    XSetInputFocus(xdisplay_, window, RevertToParent, CurrentTime);\n\n    OnActiveWindowChanged(window);\n  }\n}\n\nvoid X11DesktopHandler::DeactivateWindow(::Window window) {\n  DCHECK(IsActiveWindow(window));\n\n  \/\/ See http:\/\/crbug.com\/321342\n  NOTIMPLEMENTED();\n}\n\nbool X11DesktopHandler::IsActiveWindow(::Window window) const {\n  return window == current_window_;\n}\n\nvoid X11DesktopHandler::ProcessXEvent(const base::NativeEvent& event) {\n  switch (event->type) {\n    case EnterNotify:\n      if (event->xcrossing.focus == True &&\n          current_window_ != event->xcrossing.window)\n        OnActiveWindowChanged(event->xcrossing.window);\n      break;\n    case LeaveNotify:\n      if (event->xcrossing.focus == False &&\n          current_window_ == event->xcrossing.window)\n        OnActiveWindowChanged(None);\n      break;\n    default:\n      NOTREACHED();\n  }\n}\n\nbool X11DesktopHandler::Dispatch(const base::NativeEvent& event) {\n  \/\/ Check for a change to the active window.\n  switch (event->type) {\n    case PropertyNotify: {\n      ::Atom active_window_atom = atom_cache_.GetAtom(\"_NET_ACTIVE_WINDOW\");\n\n      if (event->xproperty.window == x_root_window_ &&\n          event->xproperty.atom == active_window_atom) {\n        ::Window window;\n        if (ui::GetXIDProperty(x_root_window_, \"_NET_ACTIVE_WINDOW\", &window) &&\n            window) {\n          OnActiveWindowChanged(window);\n        }\n      }\n      break;\n    }\n  }\n\n  return true;\n}\n\nvoid X11DesktopHandler::OnWindowInitialized(aura::Window* window) {\n}\n\nvoid X11DesktopHandler::OnWillDestroyEnv() {\n  g_handler = NULL;\n  delete this;\n}\n\nvoid X11DesktopHandler::OnActiveWindowChanged(::Window xid) {\n  if (current_window_ == xid)\n    return;\n  DesktopWindowTreeHostX11* old_host =\n      views::DesktopWindowTreeHostX11::GetHostForXID(current_window_);\n  if (old_host)\n    old_host->HandleNativeWidgetActivationChanged(false);\n\n  DesktopWindowTreeHostX11* new_host =\n      views::DesktopWindowTreeHostX11::GetHostForXID(xid);\n  if (new_host)\n    new_host->HandleNativeWidgetActivationChanged(true);\n\n  current_window_ = xid;\n}\n\n}  \/\/ namespace views\n<commit_msg>Revert of Fixes _NET_ACTIVE_WINDOW support check in order to not always return no. (https:\/\/codereview.chromium.org\/138903007\/)<commit_after>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"ui\/views\/widget\/desktop_aura\/x11_desktop_handler.h\"\n\n#include <X11\/Xatom.h>\n#include <X11\/Xlib.h>\n\n#include \"base\/message_loop\/message_loop.h\"\n#include \"ui\/aura\/env.h\"\n#include \"ui\/aura\/root_window.h\"\n#include \"ui\/base\/x\/x11_util.h\"\n\n#if !defined(OS_CHROMEOS)\n#include \"ui\/views\/ime\/input_method.h\"\n#include \"ui\/views\/widget\/desktop_aura\/desktop_root_window_host_x11.h\"\n#endif\n\nnamespace {\n\nconst char* kAtomsToCache[] = {\n  \"_NET_ACTIVE_WINDOW\",\n  \"_NET_SUPPORTED\",\n  NULL\n};\n\n\/\/ Our global instance. Deleted when our Env() is deleted.\nviews::X11DesktopHandler* g_handler = NULL;\n\n}  \/\/ namespace\n\nnamespace views {\n\n\/\/ static\nX11DesktopHandler* X11DesktopHandler::get() {\n  if (!g_handler)\n    g_handler = new X11DesktopHandler;\n\n  return g_handler;\n}\n\nX11DesktopHandler::X11DesktopHandler()\n    : xdisplay_(gfx::GetXDisplay()),\n      x_root_window_(DefaultRootWindow(xdisplay_)),\n      current_window_(None),\n      atom_cache_(xdisplay_, kAtomsToCache),\n      wm_supports_active_window_(false) {\n  base::MessagePumpX11::Current()->AddDispatcherForRootWindow(this);\n  aura::Env::GetInstance()->AddObserver(this);\n\n  XWindowAttributes attr;\n  XGetWindowAttributes(xdisplay_, x_root_window_, &attr);\n  XSelectInput(xdisplay_, x_root_window_,\n               attr.your_event_mask | PropertyChangeMask |\n               StructureNotifyMask | SubstructureNotifyMask);\n\n  std::vector<Atom> atoms;\n  if (ui::GetAtomArrayProperty(x_root_window_, \"_NET_ACTIVE_WINDOW\", &atoms)) {\n    Atom active_window = atom_cache_.GetAtom(\"_NET_ACTIVE_WINDOW\");\n    for (std::vector<Atom>::iterator iter = atoms.begin(); iter != atoms.end();\n         ++iter) {\n      if (*(iter) == active_window) {\n        wm_supports_active_window_ = true;\n        break;\n      }\n    }\n  }\n}\n\nX11DesktopHandler::~X11DesktopHandler() {\n  aura::Env::GetInstance()->RemoveObserver(this);\n  base::MessagePumpX11::Current()->RemoveDispatcherForRootWindow(this);\n}\n\nvoid X11DesktopHandler::ActivateWindow(::Window window) {\n  if (wm_supports_active_window_) {\n    DCHECK_EQ(gfx::GetXDisplay(), xdisplay_);\n\n    XEvent xclient;\n    memset(&xclient, 0, sizeof(xclient));\n    xclient.type = ClientMessage;\n    xclient.xclient.window = window;\n    xclient.xclient.message_type = atom_cache_.GetAtom(\"_NET_ACTIVE_WINDOW\");\n    xclient.xclient.format = 32;\n    xclient.xclient.data.l[0] = 1;  \/\/ Specified we are an app.\n    xclient.xclient.data.l[1] = CurrentTime;\n    xclient.xclient.data.l[2] = None;\n    xclient.xclient.data.l[3] = 0;\n    xclient.xclient.data.l[4] = 0;\n\n    XSendEvent(xdisplay_, x_root_window_, False,\n               SubstructureRedirectMask | SubstructureNotifyMask,\n               &xclient);\n  } else {\n    XRaiseWindow(xdisplay_, window);\n\n    \/\/ XRaiseWindow will not give input focus to the window. We now need to ask\n    \/\/ the X server to do that. Note that the call will raise an X error if the\n    \/\/ window is not mapped.\n    XSetInputFocus(xdisplay_, window, RevertToParent, CurrentTime);\n\n    OnActiveWindowChanged(window);\n  }\n}\n\nvoid X11DesktopHandler::DeactivateWindow(::Window window) {\n  DCHECK(IsActiveWindow(window));\n\n  \/\/ See http:\/\/crbug.com\/321342\n  NOTIMPLEMENTED();\n}\n\nbool X11DesktopHandler::IsActiveWindow(::Window window) const {\n  return window == current_window_;\n}\n\nvoid X11DesktopHandler::ProcessXEvent(const base::NativeEvent& event) {\n  switch (event->type) {\n    case EnterNotify:\n      if (event->xcrossing.focus == True &&\n          current_window_ != event->xcrossing.window)\n        OnActiveWindowChanged(event->xcrossing.window);\n      break;\n    case LeaveNotify:\n      if (event->xcrossing.focus == False &&\n          current_window_ == event->xcrossing.window)\n        OnActiveWindowChanged(None);\n      break;\n    default:\n      NOTREACHED();\n  }\n}\n\nbool X11DesktopHandler::Dispatch(const base::NativeEvent& event) {\n  \/\/ Check for a change to the active window.\n  switch (event->type) {\n    case PropertyNotify: {\n      ::Atom active_window = atom_cache_.GetAtom(\"_NET_ACTIVE_WINDOW\");\n\n      if (event->xproperty.window == x_root_window_ &&\n          event->xproperty.atom == active_window) {\n        int window;\n        if (ui::GetIntProperty(x_root_window_, \"_NET_ACTIVE_WINDOW\", &window) &&\n            window) {\n          OnActiveWindowChanged(static_cast< ::Window>(window));\n        }\n      }\n      break;\n    }\n  }\n\n  return true;\n}\n\nvoid X11DesktopHandler::OnWindowInitialized(aura::Window* window) {\n}\n\nvoid X11DesktopHandler::OnWillDestroyEnv() {\n  g_handler = NULL;\n  delete this;\n}\n\nvoid X11DesktopHandler::OnActiveWindowChanged(::Window xid) {\n  if (current_window_ == xid)\n    return;\n  DesktopWindowTreeHostX11* old_host =\n      views::DesktopWindowTreeHostX11::GetHostForXID(current_window_);\n  if (old_host)\n    old_host->HandleNativeWidgetActivationChanged(false);\n\n  DesktopWindowTreeHostX11* new_host =\n      views::DesktopWindowTreeHostX11::GetHostForXID(xid);\n  if (new_host)\n    new_host->HandleNativeWidgetActivationChanged(true);\n\n  current_window_ = xid;\n}\n\n}  \/\/ namespace views\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 <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)\n{\n\tLogPrintf(\"CheckPaymentInBTC %s\\n\", \"https:\/\/blockchain.info\/tx\/\" + strBTCTxId.toStdString().c_str() + \"?format=json\");\n\n\tLogPrintf(\"QNetworkAccessManager\\n\");\n\tQNetworkAccessManager *nam = new QNetworkAccessManager(this);\n\tQUrl url(\"https:\/\/blockchain.info\/tx\/\" + strBTCTxId + \"?format=json\");\n\tQNetworkRequest request(QUrl(url));\n\trequest.setHeader(QNetworkRequest::ContentTypeHeader, \"application\/json\");\n\tQNetworkReply* reply = nam->get(request);\n\treply->ignoreSslErrors();\n\tint totalTime = 0;\n\twhile(!reply->isFinished())\n\t{\n\t\ttotalTime += 100;\n\t\tMilliSleep(100);\n\t\tif(totalTime > 3000)\n\t\t\tthrow runtime_error(\"Timeout connecting to blockchain.info!\");\n\t}\n\tif(reply->error() == QNetworkReply::NoError) {\n\n\t\tLogPrintf(\"response: %s\\n\", reply->readAll().toStdString().c_str());\n\t\tUniValue outerValue(UniValue::VSTR);\n\t\tbool read = outerValue.read(reply->readAll().toStdString());\n\t\tif (read)\n\t\t{\n\t\t\tLogPrintf(\"gotjson!\\n\");\n\t\t\tUniValue outerObj = outerValue.get_obj();\n\t\t\tUniValue ratesValue = find_value(outerObj, \"rates\");\n\t\t\tif (ratesValue.isArray())\n\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\tif(!CheckPaymentInBTC(ui->btctxidEdit->text().trimmed(), address, price))\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>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 <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)\n{\n\tstring msg = \"https:\/\/blockchain.info\/tx\/\" + strBTCTxId.toStdString() + \"?format=json\";\n\tLogPrintf(\"CheckPaymentInBTC %s\\n\", msg);\n\n\tLogPrintf(\"QNetworkAccessManager\\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\tint totalTime = 0;\n\twhile(!reply->isFinished())\n\t{\n\t\ttotalTime += 100;\n\t\tMilliSleep(100);\n\t\tif(totalTime > 3000)\n\t\t\tthrow runtime_error(\"Timeout connecting to blockchain.info!\");\n\t}\n\tif(reply->error() == QNetworkReply::NoError) {\n\n\t\tLogPrintf(\"response: %s\\n\", reply->readAll().toStdString().c_str());\n\t\tUniValue outerValue(UniValue::VSTR);\n\t\tbool read = outerValue.read(reply->readAll().toStdString());\n\t\tif (read)\n\t\t{\n\t\t\tLogPrintf(\"gotjson!\\n\");\n\t\t\tUniValue outerObj = outerValue.get_obj();\n\t\t\tUniValue ratesValue = find_value(outerObj, \"rates\");\n\t\t\tif (ratesValue.isArray())\n\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\tif(!CheckPaymentInBTC(ui->btctxidEdit->text().trimmed(), address, price))\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_CHANGEFEED_HPP_\n#define RDB_PROTOCOL_CHANGEFEED_HPP_\n\n#include <deque>\n#include <exception>\n#include <map>\n\n#include \"errors.hpp\"\n\n#include <boost\/variant.hpp>\n\n#include \"concurrency\/rwlock.hpp\"\n#include \"containers\/counted.hpp\"\n#include \"containers\/scoped.hpp\"\n#include \"protocol_api.hpp\"\n#include \"repli_timestamp.hpp\"\n#include \"rpc\/connectivity\/connectivity.hpp\"\n#include \"rpc\/mailbox\/typed.hpp\"\n#include \"rpc\/serialize_macros.hpp\"\n\nclass auto_drainer_t;\nclass base_namespace_repo_t;\nclass mailbox_manager_t;\nstruct rdb_modification_report_t;\n\nnamespace ql {\n\nclass base_exc_t;\nclass batcher_t;\nclass changefeed_t;\nclass datum_stream_t;\nclass datum_t;\nclass env_t;\nclass table_t;\n\nnamespace changefeed {\n\nstruct msg_t {\n    struct change_t {\n        change_t();\n        explicit change_t(counted_t<const datum_t> _old_val,\n                          counted_t<const datum_t> _new_val);\n        ~change_t();\n        counted_t<const datum_t> old_val, new_val;\n        RDB_DECLARE_ME_SERIALIZABLE;\n    };\n    struct stop_t { RDB_DECLARE_ME_SERIALIZABLE; };\n\n    msg_t() { }\n    msg_t(msg_t &&msg);\n    explicit msg_t(stop_t &&op);\n    explicit msg_t(change_t &&op);\n\n    \/\/ We need to define the copy constructor.  GCC 4.4 doesn't let use use `=\n    \/\/ default`, and SRH is uncomfortable violating the rule of 3, so we define\n    \/\/ the destructor and assignment operator as well.\n    msg_t(const msg_t &msg) : op(msg.op) { }\n    ~msg_t() { }\n    const msg_t &operator=(const msg_t &msg) {\n        op = msg.op;\n        return *this;\n    }\n\n    \/\/ Starts with STOP to avoid doing work for default initialization.\n    boost::variant<stop_t, change_t> op;\n\n    RDB_DECLARE_ME_SERIALIZABLE;\n};\n\nclass feed_t;\nstruct stamped_msg_t;\n\n\/\/ The `client_t` exists on the machine handling the changefeed query, in the\n\/\/ `rdb_context_t`.  When a query subscribes to the changes on a table, it\n\/\/ should call `new_feed`.  The `client_t` will give it back a stream of rows.\n\/\/ The `client_t` does this by maintaining an internal map from table UUIDs to\n\/\/ `feed_t`s.  (It does this so that there is at most one `feed_t` per <table,\n\/\/ client> pair, to prevent redundant cluster messages.)  The actual logic for\n\/\/ subscribing to a changefeed server and distributing writes to streams can be\n\/\/ found in the `feed_t` class.\nclass client_t : public home_thread_mixin_t {\npublic:\n    typedef mailbox_addr_t<void(stamped_msg_t)> addr_t;\n    client_t(mailbox_manager_t *_manager);\n    ~client_t();\n    \/\/ Throws QL exceptions.\n    counted_t<datum_stream_t> new_feed(const counted_t<table_t> &tbl, env_t *env);\n    void maybe_remove_feed(const uuid_u &uuid);\n    scoped_ptr_t<feed_t> detach_feed(const uuid_u &uuid);\nprivate:\n    friend class sub_t;\n    mailbox_manager_t *const manager;\n    std::map<uuid_u, scoped_ptr_t<feed_t> > feeds;\n    \/\/ This lock manages access to the `feeds` map.  The `feeds` map needs to be\n    \/\/ read whenever `new_feed` is called, and needs to be written to whenever\n    \/\/ `new_feed` is called with a table not already in the `feeds` map, or\n    \/\/ whenever `maybe_remove_feed` or `detach_feed` is called.\n    rwlock_t feeds_lock;\n    auto_drainer_t drainer;\n};\n\n\/\/ There is one `server_t` per `store_t`, and it is used to send changes that\n\/\/ occur on that `store_t` to any subscribed `feed_t`s contained in a\n\/\/ `client_t`.\nclass server_t {\npublic:\n    typedef mailbox_addr_t<void(client_t::addr_t)> addr_t;\n    server_t(mailbox_manager_t *_manager);\n    void add_client(const client_t::addr_t &addr);\n    void send_all(msg_t msg);\n    addr_t get_stop_addr();\n    uint64_t get_stamp(const client_t::addr_t &addr);\n    uuid_u get_uuid();\nprivate:\n    void stop_mailbox_cb(client_t::addr_t addr);\n    void add_client_cb(signal_t *stopped, client_t::addr_t addr);\n\n    \/\/ The UUID of the server, used so that `feed_t`s can order changefeed\n    \/\/ messages on a per-server basis (and drop changefeed messages from before\n    \/\/ their own creation timestamp on a per-server basis).\n    const uuid_u uuid;\n    mailbox_manager_t *const manager;\n\n    struct client_info_t {\n        scoped_ptr_t<cond_t> cond;\n        uint64_t stamp;\n    };\n    std::map<client_t::addr_t, client_info_t> clients;\n    \/\/ Controls access to `clients`.  A `server_t` needs to read `clients` when:\n    \/\/ * `send_all` is called\n    \/\/ * `get_tamp` is called\n    \/\/ And needs to write to clients when:\n    \/\/ * `add_client` is called\n    \/\/ * A message is received at `stop_mailbox` unsubscribing a client\n    \/\/ A lock is needed because e.g. `send_all` calls `send`, which can block,\n    \/\/ while looping over `clients`, and we need to make sure the map doesn't\n    \/\/ change under it.\n    rwlock_t clients_lock;\n\n    \/\/ Clients send a message to this mailbox with their address when they want\n    \/\/ to unsubscribe.\n    mailbox_t<void(client_t::addr_t)> stop_mailbox;\n    auto_drainer_t drainer;\n};\n\n} \/\/ namespace changefeed\n} \/\/ namespace ql\n\n#endif \/\/ RDB_PROTOCOL_CHANGEFEED_HPP_\n<commit_msg>Added comments.<commit_after>#ifndef RDB_PROTOCOL_CHANGEFEED_HPP_\n#define RDB_PROTOCOL_CHANGEFEED_HPP_\n\n#include <deque>\n#include <exception>\n#include <map>\n\n#include \"errors.hpp\"\n\n#include <boost\/variant.hpp>\n\n#include \"concurrency\/rwlock.hpp\"\n#include \"containers\/counted.hpp\"\n#include \"containers\/scoped.hpp\"\n#include \"protocol_api.hpp\"\n#include \"repli_timestamp.hpp\"\n#include \"rpc\/connectivity\/connectivity.hpp\"\n#include \"rpc\/mailbox\/typed.hpp\"\n#include \"rpc\/serialize_macros.hpp\"\n\nclass auto_drainer_t;\nclass base_namespace_repo_t;\nclass mailbox_manager_t;\nstruct rdb_modification_report_t;\n\nnamespace ql {\n\nclass base_exc_t;\nclass batcher_t;\nclass changefeed_t;\nclass datum_stream_t;\nclass datum_t;\nclass env_t;\nclass table_t;\n\nnamespace changefeed {\n\nstruct msg_t {\n    struct change_t {\n        change_t();\n        explicit change_t(counted_t<const datum_t> _old_val,\n                          counted_t<const datum_t> _new_val);\n        ~change_t();\n        counted_t<const datum_t> old_val, new_val;\n        RDB_DECLARE_ME_SERIALIZABLE;\n    };\n    struct stop_t { RDB_DECLARE_ME_SERIALIZABLE; };\n\n    msg_t() { }\n    msg_t(msg_t &&msg);\n    explicit msg_t(stop_t &&op);\n    explicit msg_t(change_t &&op);\n\n    \/\/ We need to define the copy constructor.  GCC 4.4 doesn't let use use `=\n    \/\/ default`, and SRH is uncomfortable violating the rule of 3, so we define\n    \/\/ the destructor and assignment operator as well.\n    msg_t(const msg_t &msg) : op(msg.op) { }\n    ~msg_t() { }\n    const msg_t &operator=(const msg_t &msg) {\n        op = msg.op;\n        return *this;\n    }\n\n    \/\/ Starts with STOP to avoid doing work for default initialization.\n    boost::variant<stop_t, change_t> op;\n\n    RDB_DECLARE_ME_SERIALIZABLE;\n};\n\nclass feed_t;\nstruct stamped_msg_t;\n\n\/\/ The `client_t` exists on the machine handling the changefeed query, in the\n\/\/ `rdb_context_t`.  When a query subscribes to the changes on a table, it\n\/\/ should call `new_feed`.  The `client_t` will give it back a stream of rows.\n\/\/ The `client_t` does this by maintaining an internal map from table UUIDs to\n\/\/ `feed_t`s.  (It does this so that there is at most one `feed_t` per <table,\n\/\/ client> pair, to prevent redundant cluster messages.)  The actual logic for\n\/\/ subscribing to a changefeed server and distributing writes to streams can be\n\/\/ found in the `feed_t` class.\nclass client_t : public home_thread_mixin_t {\npublic:\n    typedef mailbox_addr_t<void(stamped_msg_t)> addr_t;\n    client_t(mailbox_manager_t *_manager);\n    ~client_t();\n    \/\/ Throws QL exceptions.\n    counted_t<datum_stream_t> new_feed(const counted_t<table_t> &tbl, env_t *env);\n    void maybe_remove_feed(const uuid_u &uuid);\n    scoped_ptr_t<feed_t> detach_feed(const uuid_u &uuid);\nprivate:\n    friend class sub_t;\n    mailbox_manager_t *const manager;\n    std::map<uuid_u, scoped_ptr_t<feed_t> > feeds;\n    \/\/ This lock manages access to the `feeds` map.  The `feeds` map needs to be\n    \/\/ read whenever `new_feed` is called, and needs to be written to whenever\n    \/\/ `new_feed` is called with a table not already in the `feeds` map, or\n    \/\/ whenever `maybe_remove_feed` or `detach_feed` is called.\n    \/\/\n    \/\/ This lock is held for a long time when `new_feed` is called with a table\n    \/\/ not already in the `feeds` map (in fact, it's held long enough to do a\n    \/\/ cluster read).  This should only be a problem if the number of tables\n    \/\/ (*not* the number of feeds) is large relative to read throughput, because\n    \/\/ otherwise most of the calls to `new_feed` that block will see the table\n    \/\/ as soon as they're woken up and won't have to do a second read.\n    rwlock_t feeds_lock;\n    auto_drainer_t drainer;\n};\n\n\/\/ There is one `server_t` per `store_t`, and it is used to send changes that\n\/\/ occur on that `store_t` to any subscribed `feed_t`s contained in a\n\/\/ `client_t`.\nclass server_t {\npublic:\n    typedef mailbox_addr_t<void(client_t::addr_t)> addr_t;\n    server_t(mailbox_manager_t *_manager);\n    void add_client(const client_t::addr_t &addr);\n    void send_all(msg_t msg);\n    addr_t get_stop_addr();\n    uint64_t get_stamp(const client_t::addr_t &addr);\n    uuid_u get_uuid();\nprivate:\n    void stop_mailbox_cb(client_t::addr_t addr);\n    void add_client_cb(signal_t *stopped, client_t::addr_t addr);\n\n    \/\/ The UUID of the server, used so that `feed_t`s can order changefeed\n    \/\/ messages on a per-server basis (and drop changefeed messages from before\n    \/\/ their own creation timestamp on a per-server basis).\n    const uuid_u uuid;\n    mailbox_manager_t *const manager;\n\n    struct client_info_t {\n        scoped_ptr_t<cond_t> cond;\n        uint64_t stamp;\n    };\n    std::map<client_t::addr_t, client_info_t> clients;\n    \/\/ Controls access to `clients`.  A `server_t` needs to read `clients` when:\n    \/\/ * `send_all` is called\n    \/\/ * `get_tamp` is called\n    \/\/ And needs to write to clients when:\n    \/\/ * `add_client` is called\n    \/\/ * A message is received at `stop_mailbox` unsubscribing a client\n    \/\/ A lock is needed because e.g. `send_all` calls `send`, which can block,\n    \/\/ while looping over `clients`, and we need to make sure the map doesn't\n    \/\/ change under it.\n    rwlock_t clients_lock;\n\n    \/\/ Clients send a message to this mailbox with their address when they want\n    \/\/ to unsubscribe.\n    mailbox_t<void(client_t::addr_t)> stop_mailbox;\n    auto_drainer_t drainer;\n};\n\n} \/\/ namespace changefeed\n} \/\/ namespace ql\n\n#endif \/\/ RDB_PROTOCOL_CHANGEFEED_HPP_\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: XMLIndexTableSourceContext.cxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-09 15:11: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\n#ifndef _XMLOFF_XMLINDEXTABLESOURCECONTEXT_HXX_\n#include \"XMLIndexTableSourceContext.hxx\"\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_XPROPERTYSET_HPP_\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_CONTAINER_XINDEXREPLACE_HPP_\n#include <com\/sun\/star\/container\/XIndexReplace.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_TEXT_REFERENCEFIELD_PART_HPP\n#include <com\/sun\/star\/text\/ReferenceFieldPart.hpp>\n#endif\n\n#ifndef _XMLOFF_XMLINDEXTEMPLATECONTEXT_HXX_\n#include \"XMLIndexTemplateContext.hxx\"\n#endif\n\n#ifndef _XMLOFF_XMLINDEXTITLETEMPLATECONTEXT_HXX_\n#include \"XMLIndexTitleTemplateContext.hxx\"\n#endif\n\n#ifndef _XMLOFF_XMLINDEXTOCSTYLESCONTEXT_HXX_\n#include \"XMLIndexTOCStylesContext.hxx\"\n#endif\n\n#ifndef _XMLOFF_XMLICTXT_HXX\n#include \"xmlictxt.hxx\"\n#endif\n\n#ifndef _XMLOFF_XMLIMP_HXX\n#include \"xmlimp.hxx\"\n#endif\n\n#ifndef _XMLOFF_TEXTIMP_HXX_\n#include \"txtimp.hxx\"\n#endif\n\n#ifndef _XMLOFF_XMLNMSPE_HXX\n#include \"xmlnmspe.hxx\"\n#endif\n\n#ifndef _XMLOFF_NMSPMAP_HXX\n#include \"nmspmap.hxx\"\n#endif\n\n#ifndef _XMLOFF_XMLTOKEN_HXX\n#include \"xmltoken.hxx\"\n#endif\n\n#ifndef _XMLOFF_XMLUCONV_HXX\n#include \"xmluconv.hxx\"\n#endif\n\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n\n#ifndef _RTL_USTRING_HXX_\n#include <rtl\/ustring.hxx>\n#endif\n\n\nusing namespace ::com::sun::star::text;\nusing namespace ::xmloff::token;\n\nusing ::rtl::OUString;\nusing ::com::sun::star::beans::XPropertySet;\nusing ::com::sun::star::uno::Reference;\nusing ::com::sun::star::uno::Any;\nusing ::com::sun::star::xml::sax::XAttributeList;\n\nconst sal_Char sAPI_CreateFromLabels[] = \"CreateFromLabels\";\nconst sal_Char sAPI_LabelCategory[] = \"LabelCategory\";\nconst sal_Char sAPI_LabelDisplayType[] = \"LabelDisplayType\";\n\n\nTYPEINIT1(XMLIndexTableSourceContext, XMLIndexSourceBaseContext);\n\n\nXMLIndexTableSourceContext::XMLIndexTableSourceContext(\n    SvXMLImport& rImport,\n    sal_uInt16 nPrfx,\n    const OUString& rLocalName,\n    Reference<XPropertySet> & rPropSet) :\n        XMLIndexSourceBaseContext(rImport, nPrfx, rLocalName,\n                                  rPropSet, sal_False),\n        sCreateFromLabels(RTL_CONSTASCII_USTRINGPARAM(sAPI_CreateFromLabels)),\n        sLabelCategory(RTL_CONSTASCII_USTRINGPARAM(sAPI_LabelCategory)),\n        sLabelDisplayType(RTL_CONSTASCII_USTRINGPARAM(sAPI_LabelDisplayType)),\n        bSequenceOK(sal_False),\n        bDisplayFormatOK(sal_False),\n        bUseCaption(sal_True)\n{\n}\n\nXMLIndexTableSourceContext::~XMLIndexTableSourceContext()\n{\n}\n\nstatic SvXMLEnumMapEntry __READONLY_DATA lcl_aReferenceTypeTokenMap[] =\n{\n\n    { XML_TEXT,                 ReferenceFieldPart::TEXT },\n    { XML_CATEGORY_AND_VALUE,   ReferenceFieldPart::CATEGORY_AND_NUMBER },\n    { XML_CAPTION,              ReferenceFieldPart::ONLY_CAPTION },\n\n    \/\/ wrong values that previous versions wrote:\n    { XML_CHAPTER,              ReferenceFieldPart::CATEGORY_AND_NUMBER },\n    { XML_PAGE,                 ReferenceFieldPart::ONLY_CAPTION },\n\n    { XML_TOKEN_INVALID,        0 }\n};\n\nvoid XMLIndexTableSourceContext::ProcessAttribute(\n    enum IndexSourceParamEnum eParam,\n    const OUString& rValue)\n{\n    sal_Bool bTmp;\n\n    switch (eParam)\n    {\n        case XML_TOK_INDEXSOURCE_USE_CAPTION:\n            if (SvXMLUnitConverter::convertBool(bTmp, rValue))\n            {\n                bUseCaption = bTmp;\n            }\n            break;\n\n        case XML_TOK_INDEXSOURCE_SEQUENCE_NAME:\n            sSequence = rValue;\n            bSequenceOK = sal_True;\n            break;\n\n        case XML_TOK_INDEXSOURCE_SEQUENCE_FORMAT:\n        {\n             sal_uInt16 nTmp;\n             if (SvXMLUnitConverter::convertEnum(nTmp, rValue,\n                                                 lcl_aReferenceTypeTokenMap))\n            {\n                 nDisplayFormat = nTmp;\n                 bDisplayFormatOK = sal_True;\n             }\n            break;\n        }\n\n        default:\n            XMLIndexSourceBaseContext::ProcessAttribute(eParam, rValue);\n            break;\n    }\n}\n\n\nvoid XMLIndexTableSourceContext::EndElement()\n{\n    Any aAny;\n\n    aAny.setValue(&bUseCaption, ::getBooleanCppuType());\n    rIndexPropertySet->setPropertyValue(sCreateFromLabels, aAny);\n\n    if (bSequenceOK)\n    {\n        aAny <<= sSequence;\n        rIndexPropertySet->setPropertyValue(sLabelCategory, aAny);\n    }\n\n    if (bDisplayFormatOK)\n    {\n        aAny <<= nDisplayFormat;\n        rIndexPropertySet->setPropertyValue(sLabelDisplayType, aAny);\n    }\n\n    XMLIndexSourceBaseContext::EndElement();\n}\n\n\nSvXMLImportContext* XMLIndexTableSourceContext::CreateChildContext(\n    sal_uInt16 nPrefix,\n    const OUString& rLocalName,\n    const Reference<XAttributeList> & xAttrList )\n{\n    if ( ( XML_NAMESPACE_TEXT == nPrefix ) &&\n         ( IsXMLToken( rLocalName, XML_TABLE_INDEX_ENTRY_TEMPLATE ) ) )\n    {\n        return new XMLIndexTemplateContext(GetImport(), rIndexPropertySet,\n                                           nPrefix, rLocalName,\n                                           aLevelNameTableMap,\n                                           XML_TOKEN_INVALID, \/\/ no outline-level attr\n                                           aLevelStylePropNameTableMap,\n                                           aAllowedTokenTypesTable);\n    }\n    else\n    {\n        return XMLIndexSourceBaseContext::CreateChildContext(nPrefix,\n                                                             rLocalName,\n                                                             xAttrList);\n    }\n\n}\n<commit_msg>INTEGRATION: CWS pchfix02 (1.7.158); FILE MERGED 2006\/09\/01 18:00:04 kaib 1.7.158.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: XMLIndexTableSourceContext.cxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 11:08:31 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_xmloff.hxx\"\n\n\n#ifndef _XMLOFF_XMLINDEXTABLESOURCECONTEXT_HXX_\n#include \"XMLIndexTableSourceContext.hxx\"\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_XPROPERTYSET_HPP_\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_CONTAINER_XINDEXREPLACE_HPP_\n#include <com\/sun\/star\/container\/XIndexReplace.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_TEXT_REFERENCEFIELD_PART_HPP\n#include <com\/sun\/star\/text\/ReferenceFieldPart.hpp>\n#endif\n\n#ifndef _XMLOFF_XMLINDEXTEMPLATECONTEXT_HXX_\n#include \"XMLIndexTemplateContext.hxx\"\n#endif\n\n#ifndef _XMLOFF_XMLINDEXTITLETEMPLATECONTEXT_HXX_\n#include \"XMLIndexTitleTemplateContext.hxx\"\n#endif\n\n#ifndef _XMLOFF_XMLINDEXTOCSTYLESCONTEXT_HXX_\n#include \"XMLIndexTOCStylesContext.hxx\"\n#endif\n\n#ifndef _XMLOFF_XMLICTXT_HXX\n#include \"xmlictxt.hxx\"\n#endif\n\n#ifndef _XMLOFF_XMLIMP_HXX\n#include \"xmlimp.hxx\"\n#endif\n\n#ifndef _XMLOFF_TEXTIMP_HXX_\n#include \"txtimp.hxx\"\n#endif\n\n#ifndef _XMLOFF_XMLNMSPE_HXX\n#include \"xmlnmspe.hxx\"\n#endif\n\n#ifndef _XMLOFF_NMSPMAP_HXX\n#include \"nmspmap.hxx\"\n#endif\n\n#ifndef _XMLOFF_XMLTOKEN_HXX\n#include \"xmltoken.hxx\"\n#endif\n\n#ifndef _XMLOFF_XMLUCONV_HXX\n#include \"xmluconv.hxx\"\n#endif\n\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n\n#ifndef _RTL_USTRING_HXX_\n#include <rtl\/ustring.hxx>\n#endif\n\n\nusing namespace ::com::sun::star::text;\nusing namespace ::xmloff::token;\n\nusing ::rtl::OUString;\nusing ::com::sun::star::beans::XPropertySet;\nusing ::com::sun::star::uno::Reference;\nusing ::com::sun::star::uno::Any;\nusing ::com::sun::star::xml::sax::XAttributeList;\n\nconst sal_Char sAPI_CreateFromLabels[] = \"CreateFromLabels\";\nconst sal_Char sAPI_LabelCategory[] = \"LabelCategory\";\nconst sal_Char sAPI_LabelDisplayType[] = \"LabelDisplayType\";\n\n\nTYPEINIT1(XMLIndexTableSourceContext, XMLIndexSourceBaseContext);\n\n\nXMLIndexTableSourceContext::XMLIndexTableSourceContext(\n    SvXMLImport& rImport,\n    sal_uInt16 nPrfx,\n    const OUString& rLocalName,\n    Reference<XPropertySet> & rPropSet) :\n        XMLIndexSourceBaseContext(rImport, nPrfx, rLocalName,\n                                  rPropSet, sal_False),\n        sCreateFromLabels(RTL_CONSTASCII_USTRINGPARAM(sAPI_CreateFromLabels)),\n        sLabelCategory(RTL_CONSTASCII_USTRINGPARAM(sAPI_LabelCategory)),\n        sLabelDisplayType(RTL_CONSTASCII_USTRINGPARAM(sAPI_LabelDisplayType)),\n        bSequenceOK(sal_False),\n        bDisplayFormatOK(sal_False),\n        bUseCaption(sal_True)\n{\n}\n\nXMLIndexTableSourceContext::~XMLIndexTableSourceContext()\n{\n}\n\nstatic SvXMLEnumMapEntry __READONLY_DATA lcl_aReferenceTypeTokenMap[] =\n{\n\n    { XML_TEXT,                 ReferenceFieldPart::TEXT },\n    { XML_CATEGORY_AND_VALUE,   ReferenceFieldPart::CATEGORY_AND_NUMBER },\n    { XML_CAPTION,              ReferenceFieldPart::ONLY_CAPTION },\n\n    \/\/ wrong values that previous versions wrote:\n    { XML_CHAPTER,              ReferenceFieldPart::CATEGORY_AND_NUMBER },\n    { XML_PAGE,                 ReferenceFieldPart::ONLY_CAPTION },\n\n    { XML_TOKEN_INVALID,        0 }\n};\n\nvoid XMLIndexTableSourceContext::ProcessAttribute(\n    enum IndexSourceParamEnum eParam,\n    const OUString& rValue)\n{\n    sal_Bool bTmp;\n\n    switch (eParam)\n    {\n        case XML_TOK_INDEXSOURCE_USE_CAPTION:\n            if (SvXMLUnitConverter::convertBool(bTmp, rValue))\n            {\n                bUseCaption = bTmp;\n            }\n            break;\n\n        case XML_TOK_INDEXSOURCE_SEQUENCE_NAME:\n            sSequence = rValue;\n            bSequenceOK = sal_True;\n            break;\n\n        case XML_TOK_INDEXSOURCE_SEQUENCE_FORMAT:\n        {\n             sal_uInt16 nTmp;\n             if (SvXMLUnitConverter::convertEnum(nTmp, rValue,\n                                                 lcl_aReferenceTypeTokenMap))\n            {\n                 nDisplayFormat = nTmp;\n                 bDisplayFormatOK = sal_True;\n             }\n            break;\n        }\n\n        default:\n            XMLIndexSourceBaseContext::ProcessAttribute(eParam, rValue);\n            break;\n    }\n}\n\n\nvoid XMLIndexTableSourceContext::EndElement()\n{\n    Any aAny;\n\n    aAny.setValue(&bUseCaption, ::getBooleanCppuType());\n    rIndexPropertySet->setPropertyValue(sCreateFromLabels, aAny);\n\n    if (bSequenceOK)\n    {\n        aAny <<= sSequence;\n        rIndexPropertySet->setPropertyValue(sLabelCategory, aAny);\n    }\n\n    if (bDisplayFormatOK)\n    {\n        aAny <<= nDisplayFormat;\n        rIndexPropertySet->setPropertyValue(sLabelDisplayType, aAny);\n    }\n\n    XMLIndexSourceBaseContext::EndElement();\n}\n\n\nSvXMLImportContext* XMLIndexTableSourceContext::CreateChildContext(\n    sal_uInt16 nPrefix,\n    const OUString& rLocalName,\n    const Reference<XAttributeList> & xAttrList )\n{\n    if ( ( XML_NAMESPACE_TEXT == nPrefix ) &&\n         ( IsXMLToken( rLocalName, XML_TABLE_INDEX_ENTRY_TEMPLATE ) ) )\n    {\n        return new XMLIndexTemplateContext(GetImport(), rIndexPropertySet,\n                                           nPrefix, rLocalName,\n                                           aLevelNameTableMap,\n                                           XML_TOKEN_INVALID, \/\/ no outline-level attr\n                                           aLevelStylePropNameTableMap,\n                                           aAllowedTokenTypesTable);\n    }\n    else\n    {\n        return XMLIndexSourceBaseContext::CreateChildContext(nPrefix,\n                                                             rLocalName,\n                                                             xAttrList);\n    }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright 2016 Kristofer Björnson\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/** @file Diagonalizer.cpp\n *\n *  @author Kristofer Björnson\n *\/\n\n#include \"TBTK\/Solver\/Diagonalizer.h\"\n#include \"TBTK\/Streams.h\"\n#include \"TBTK\/TBTKMacros.h\"\n\nusing namespace std;\n\nnamespace TBTK{\nnamespace Solver{\n\nDiagonalizer::Diagonalizer() : Communicator(true){\n\thamiltonian = NULL;\n\teigenValues = NULL;\n\teigenVectors = NULL;\n\n\tmaxIterations = 50;\n\tselfConsistencyCallback = NULL;\n}\n\nDiagonalizer::~Diagonalizer(){\n\tif(hamiltonian != NULL)\n\t\tdelete [] hamiltonian;\n\tif(eigenValues != NULL)\n\t\tdelete [] eigenValues;\n\tif(eigenVectors != NULL)\n\t\tdelete [] eigenVectors;\n}\n\nvoid Diagonalizer::run(){\n\/*\tTBTKAssert(\n\t\tgetModel() != NULL,\n\t\t\"Diagonalizer::run()\",\n\t\t\"Model not set.\",\n\t\t\"Use Diagonalizer::setModel() to set model.\"\n\t);*\/\n\n\tint iterationCounter = 0;\n\tinit();\n\n\tif(getGlobalVerbose() && getVerbose())\n\t\tStreams::out << \"Running Diagonalizer\\n\";\n\twhile(iterationCounter++ < maxIterations){\n\t\tif(getGlobalVerbose() && getVerbose()){\n\t\t\tif(iterationCounter%10 == 1)\n\t\t\t\tStreams::out << \" \";\n\t\t\tif(iterationCounter%50 == 1)\n\t\t\t\tStreams::out << \"\\n\";\n\t\t\tStreams::out << \".\" << flush;\n\t\t}\n\n\t\tsolve();\n\n\t\tif(selfConsistencyCallback){\n\t\t\tif(selfConsistencyCallback(*this))\n\t\t\t\tbreak;\n\t\t\telse\n\t\t\t\tupdate();\n\t\t}\n\t\telse{\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(getGlobalVerbose() && getVerbose())\n\t\tStreams::out << \"\\n\";\n}\n\nvoid Diagonalizer::init(){\n\tif(getGlobalVerbose() && getVerbose())\n\t\tStreams::out << \"Initializing Diagonalizer\\n\";\n\n\/\/\tmodel->amplitudeSet.construct();\n\n\tint basisSize = getModel().getBasisSize();\n\tif(getGlobalVerbose() && getVerbose())\n\t\tStreams::out << \"\\tBasis size: \" << basisSize << \"\\n\";\n\n\tif(hamiltonian != nullptr)\n\t\tdelete [] hamiltonian;\n\tif(eigenValues != nullptr)\n\t\tdelete [] eigenValues;\n\tif(eigenVectors != nullptr)\n\t\tdelete [] eigenVectors;\n\n\thamiltonian = new complex<double>[(basisSize*(basisSize+1))\/2];\n\teigenValues = new double[basisSize];\n\teigenVectors = new complex<double>[basisSize*basisSize];\n\n\tupdate();\n}\n\nvoid Diagonalizer::update(){\n\tconst Model &model = getModel();\n\tint basisSize = model.getBasisSize();\n\n\tfor(int n = 0; n < (basisSize*(basisSize+1))\/2; n++)\n\t\thamiltonian[n] = 0.;\n\n\tfor(\n\t\tHoppingAmplitudeSet::ConstIterator iterator\n\t\t\t= model.getHoppingAmplitudeSet().cbegin();\n\t\titerator != model.getHoppingAmplitudeSet().cend();\n\t\t++iterator\n\t){\n\t\tint from = model.getHoppingAmplitudeSet().getBasisIndex(\n\t\t\t(*iterator).getFromIndex()\n\t\t);\n\t\tint to = model.getHoppingAmplitudeSet().getBasisIndex(\n\t\t\t(*iterator).getToIndex()\n\t\t);\n\t\tif(from >= to)\n\t\t\thamiltonian[to + (from*(from+1))\/2] += (*iterator).getAmplitude();\n\t}\n}\n\n\/\/Lapack function for matrix diagonalization of triangular matrix.\nextern \"C\" void zhpev_(char *jobz,\t\t\/\/'E' = Eigenvalues only, 'V' = Eigenvalues and eigenvectors.\n\t\t\tchar *uplo,\t\t\/\/'U' = Stored as upper triangular, 'L' = Stored as lower triangular.\n\t\t\tint *n,\t\t\t\/\/n*n = Matrix size\n\t\t\tcomplex<double> *ap,\t\/\/Input matrix\n\t\t\tdouble *w,\t\t\/\/Eigenvalues, is in accending order if info = 0\n\t\t\tcomplex<double> *z,\t\/\/Eigenvectors\n\t\t\tint *ldz,\t\t\/\/\n\t\t\tcomplex<double> *work,\t\/\/Workspace, dimension = max(1, 2*N-1)\n\t\t\tdouble *rwork,\t\t\/\/Workspace, dimension = max(1, 3*N-2)\n\t\t\tint *info);\t\t\/\/0 = successful, <0 = -info value was illegal, >0 = info number of off-diagonal elements failed to converge.\n\n\/\/Lapack function for matrix diagonalization of banded triangular matrix\nextern \"C\" void zhbeb_(\n\tchar *jobz,\t\t\/\/'E' = Eigenvalues only, 'V' = Eigenvalues and eigenvectors.\n\tchar *uplo,\t\t\/\/'U' = Stored as upper triangular, 'L' = Stored as lower triangular.\n\tint *n,\t\t\t\/\/n*n = Matrix size\n\tint *kd,\t\t\/\/Number of (sub\/super)diagonal elements\n\tcomplex<double> *ab,\t\/\/Input matrix\n\tint *ldab,\t\t\/\/Leading dimension of array ab. ldab >= kd + 1\n\tdouble *w,\t\t\/\/Eigenvalues, is in accending order if info = 0\n\tcomplex<double> *z,\t\/\/Eigenvectors\n\tint *ldz,\t\t\/\/\n\tcomplex<double> *work,\t\/\/Workspace, dimension = max(1, 2*N-1)\n\tdouble *rwork,\t\t\/\/Workspace, dimension = max(1, 3*N-2)\n\tint *info);\t\t\/\/0 = successful, <0 = -info value was illegal, >0 = info number of off-diagonal elements failed to converge.\n\nvoid Diagonalizer::solve(){\n\tif(true){\/\/Currently no support for banded matrices.\n\t\t\/\/Setup zhpev to calculate...\n\t\tchar jobz = 'V';\t\t\/\/...eigenvalues and eigenvectors...\n\t\tchar uplo = 'U';\t\t\/\/...for an upper triangular...\n\t\tint n = getModel().getBasisSize();\t\/\/...nxn-matrix.\n\t\t\/\/Initialize workspaces\n\t\tcomplex<double> *work = new complex<double>[(2*n-1)];\n\t\tdouble *rwork = new double[3*n-2];\n\t\tint info;\n\t\t\/\/Solve brop\n\t\tzhpev_(&jobz, &uplo, &n, hamiltonian, eigenValues, eigenVectors, &n, work, rwork, &info);\n\n\t\tTBTKAssert(\n\t\t\tinfo == 0,\n\t\t\t\"Diagonalizer:solve()\",\n\t\t\t\"Diagonalization routine zhpev exited with INFO=\" + to_string(info) + \".\",\n\t\t\t\"See LAPACK documentation for zhpev for further information.\"\n\t\t);\n\n\t\t\/\/Delete workspaces\n\t\tdelete [] work;\n\t\tdelete [] rwork;\n\t}\n\/*\telse{\n\t\tint kd;\n\t\tif(size_z != 1)\n\t\t\tkd = orbitals*size_x*size_y*size_z;\n\t\telse if(size_y != 1)\n\t\t\tkd = orbitals*size_x*size_y;\n\t\telse\n\t\t\tkd = orbitals*size_x;\n\t\t\/\/Setup zhbev to calculate...\n\t\tchar jobz = 'V';\t\t\t\/\/...eigenvalues and eigenvectors...\n\t\tchar uplo = 'U';\t\t\t\/\/...for and upper triangluar...\n\t\tint n = orbitals*size_x*size_y*size_z;\t\/\/...nxn-matrix.\n\t\tint ldab = kd + 1;\n\t\t\/\/Initialize workspaces\n\t\tcomplex<double> *work = new complex<double>[n];\n\t\tdouble *rwork = new double[3*n-2];\n\t\tint info;\n\t\t\/\/Solve brop\n\t\tzhbev_(&jobz, &uplo, &n, &kd, hamiltonian, &ldab, eigenValues, eigenVectors, &n, work, rwork, &info);\n\n\t\t\/\/delete workspaces\n\t\tdelete [] work;\n\t\tdelete [] rwork;\n\t}*\/\n}\n\n};\t\/\/End of namespace Solver\n};\t\/\/End of namespace TBTK\n<commit_msg>Removed commented out legacy code.<commit_after>\/* Copyright 2016 Kristofer Björnson\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/** @file Diagonalizer.cpp\n *\n *  @author Kristofer Björnson\n *\/\n\n#include \"TBTK\/Solver\/Diagonalizer.h\"\n#include \"TBTK\/Streams.h\"\n#include \"TBTK\/TBTKMacros.h\"\n\nusing namespace std;\n\nnamespace TBTK{\nnamespace Solver{\n\nDiagonalizer::Diagonalizer() : Communicator(true){\n\thamiltonian = NULL;\n\teigenValues = NULL;\n\teigenVectors = NULL;\n\n\tmaxIterations = 50;\n\tselfConsistencyCallback = NULL;\n}\n\nDiagonalizer::~Diagonalizer(){\n\tif(hamiltonian != NULL)\n\t\tdelete [] hamiltonian;\n\tif(eigenValues != NULL)\n\t\tdelete [] eigenValues;\n\tif(eigenVectors != NULL)\n\t\tdelete [] eigenVectors;\n}\n\nvoid Diagonalizer::run(){\n\tint iterationCounter = 0;\n\tinit();\n\n\tif(getGlobalVerbose() && getVerbose())\n\t\tStreams::out << \"Running Diagonalizer\\n\";\n\twhile(iterationCounter++ < maxIterations){\n\t\tif(getGlobalVerbose() && getVerbose()){\n\t\t\tif(iterationCounter%10 == 1)\n\t\t\t\tStreams::out << \" \";\n\t\t\tif(iterationCounter%50 == 1)\n\t\t\t\tStreams::out << \"\\n\";\n\t\t\tStreams::out << \".\" << flush;\n\t\t}\n\n\t\tsolve();\n\n\t\tif(selfConsistencyCallback){\n\t\t\tif(selfConsistencyCallback(*this))\n\t\t\t\tbreak;\n\t\t\telse\n\t\t\t\tupdate();\n\t\t}\n\t\telse{\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(getGlobalVerbose() && getVerbose())\n\t\tStreams::out << \"\\n\";\n}\n\nvoid Diagonalizer::init(){\n\tif(getGlobalVerbose() && getVerbose())\n\t\tStreams::out << \"Initializing Diagonalizer\\n\";\n\n\tint basisSize = getModel().getBasisSize();\n\tif(getGlobalVerbose() && getVerbose())\n\t\tStreams::out << \"\\tBasis size: \" << basisSize << \"\\n\";\n\n\tif(hamiltonian != nullptr)\n\t\tdelete [] hamiltonian;\n\tif(eigenValues != nullptr)\n\t\tdelete [] eigenValues;\n\tif(eigenVectors != nullptr)\n\t\tdelete [] eigenVectors;\n\n\thamiltonian = new complex<double>[(basisSize*(basisSize+1))\/2];\n\teigenValues = new double[basisSize];\n\teigenVectors = new complex<double>[basisSize*basisSize];\n\n\tupdate();\n}\n\nvoid Diagonalizer::update(){\n\tconst Model &model = getModel();\n\tint basisSize = model.getBasisSize();\n\n\tfor(int n = 0; n < (basisSize*(basisSize+1))\/2; n++)\n\t\thamiltonian[n] = 0.;\n\n\tfor(\n\t\tHoppingAmplitudeSet::ConstIterator iterator\n\t\t\t= model.getHoppingAmplitudeSet().cbegin();\n\t\titerator != model.getHoppingAmplitudeSet().cend();\n\t\t++iterator\n\t){\n\t\tint from = model.getHoppingAmplitudeSet().getBasisIndex(\n\t\t\t(*iterator).getFromIndex()\n\t\t);\n\t\tint to = model.getHoppingAmplitudeSet().getBasisIndex(\n\t\t\t(*iterator).getToIndex()\n\t\t);\n\t\tif(from >= to)\n\t\t\thamiltonian[to + (from*(from+1))\/2] += (*iterator).getAmplitude();\n\t}\n}\n\n\/\/Lapack function for matrix diagonalization of triangular matrix.\nextern \"C\" void zhpev_(char *jobz,\t\t\/\/'E' = Eigenvalues only, 'V' = Eigenvalues and eigenvectors.\n\t\t\tchar *uplo,\t\t\/\/'U' = Stored as upper triangular, 'L' = Stored as lower triangular.\n\t\t\tint *n,\t\t\t\/\/n*n = Matrix size\n\t\t\tcomplex<double> *ap,\t\/\/Input matrix\n\t\t\tdouble *w,\t\t\/\/Eigenvalues, is in accending order if info = 0\n\t\t\tcomplex<double> *z,\t\/\/Eigenvectors\n\t\t\tint *ldz,\t\t\/\/\n\t\t\tcomplex<double> *work,\t\/\/Workspace, dimension = max(1, 2*N-1)\n\t\t\tdouble *rwork,\t\t\/\/Workspace, dimension = max(1, 3*N-2)\n\t\t\tint *info);\t\t\/\/0 = successful, <0 = -info value was illegal, >0 = info number of off-diagonal elements failed to converge.\n\n\/\/Lapack function for matrix diagonalization of banded triangular matrix\nextern \"C\" void zhbeb_(\n\tchar *jobz,\t\t\/\/'E' = Eigenvalues only, 'V' = Eigenvalues and eigenvectors.\n\tchar *uplo,\t\t\/\/'U' = Stored as upper triangular, 'L' = Stored as lower triangular.\n\tint *n,\t\t\t\/\/n*n = Matrix size\n\tint *kd,\t\t\/\/Number of (sub\/super)diagonal elements\n\tcomplex<double> *ab,\t\/\/Input matrix\n\tint *ldab,\t\t\/\/Leading dimension of array ab. ldab >= kd + 1\n\tdouble *w,\t\t\/\/Eigenvalues, is in accending order if info = 0\n\tcomplex<double> *z,\t\/\/Eigenvectors\n\tint *ldz,\t\t\/\/\n\tcomplex<double> *work,\t\/\/Workspace, dimension = max(1, 2*N-1)\n\tdouble *rwork,\t\t\/\/Workspace, dimension = max(1, 3*N-2)\n\tint *info);\t\t\/\/0 = successful, <0 = -info value was illegal, >0 = info number of off-diagonal elements failed to converge.\n\nvoid Diagonalizer::solve(){\n\tif(true){\/\/Currently no support for banded matrices.\n\t\t\/\/Setup zhpev to calculate...\n\t\tchar jobz = 'V';\t\t\/\/...eigenvalues and eigenvectors...\n\t\tchar uplo = 'U';\t\t\/\/...for an upper triangular...\n\t\tint n = getModel().getBasisSize();\t\/\/...nxn-matrix.\n\t\t\/\/Initialize workspaces\n\t\tcomplex<double> *work = new complex<double>[(2*n-1)];\n\t\tdouble *rwork = new double[3*n-2];\n\t\tint info;\n\t\t\/\/Solve brop\n\t\tzhpev_(&jobz, &uplo, &n, hamiltonian, eigenValues, eigenVectors, &n, work, rwork, &info);\n\n\t\tTBTKAssert(\n\t\t\tinfo == 0,\n\t\t\t\"Diagonalizer:solve()\",\n\t\t\t\"Diagonalization routine zhpev exited with INFO=\" + to_string(info) + \".\",\n\t\t\t\"See LAPACK documentation for zhpev for further information.\"\n\t\t);\n\n\t\t\/\/Delete workspaces\n\t\tdelete [] work;\n\t\tdelete [] rwork;\n\t}\n\/*\telse{\n\t\tint kd;\n\t\tif(size_z != 1)\n\t\t\tkd = orbitals*size_x*size_y*size_z;\n\t\telse if(size_y != 1)\n\t\t\tkd = orbitals*size_x*size_y;\n\t\telse\n\t\t\tkd = orbitals*size_x;\n\t\t\/\/Setup zhbev to calculate...\n\t\tchar jobz = 'V';\t\t\t\/\/...eigenvalues and eigenvectors...\n\t\tchar uplo = 'U';\t\t\t\/\/...for and upper triangluar...\n\t\tint n = orbitals*size_x*size_y*size_z;\t\/\/...nxn-matrix.\n\t\tint ldab = kd + 1;\n\t\t\/\/Initialize workspaces\n\t\tcomplex<double> *work = new complex<double>[n];\n\t\tdouble *rwork = new double[3*n-2];\n\t\tint info;\n\t\t\/\/Solve brop\n\t\tzhbev_(&jobz, &uplo, &n, &kd, hamiltonian, &ldab, eigenValues, eigenVectors, &n, work, rwork, &info);\n\n\t\t\/\/delete workspaces\n\t\tdelete [] work;\n\t\tdelete [] rwork;\n\t}*\/\n}\n\n};\t\/\/End of namespace Solver\n};\t\/\/End of namespace TBTK\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Name:\t\tVegFieldsDlg.cpp\n\/\/\n\/\/ Copyright (c) 2002-2004 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n#ifdef __GNUG__\n\t#pragma implementation \"VegFieldsDlg.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 \"VegFieldsDlg.h\"\n#include \"Frame.h\"\t\t\/\/ for Plants List\n\n\/\/ WDR: class implementations\n\n\/\/----------------------------------------------------------------------------\n\/\/ VegFieldsDlg\n\/\/----------------------------------------------------------------------------\n\n\/\/ WDR: event table for VegFieldsDlg\n\nBEGIN_EVENT_TABLE(VegFieldsDlg, AutoDialog)\n\tEVT_INIT_DIALOG (VegFieldsDlg::OnInitDialog)\n\tEVT_CHOICE( ID_SPECIES_FIELD, VegFieldsDlg::OnChoice1 )\n\tEVT_CHOICE( ID_HEIGHT_FIELD, VegFieldsDlg::OnChoice2 )\n\tEVT_BUTTON( wxID_OK, VegFieldsDlg::OnOK )\n\tEVT_RADIOBUTTON( ID_USE_SPECIES, VegFieldsDlg::OnRadio )\n\tEVT_RADIOBUTTON( ID_SPECIES_USE_FIELD, VegFieldsDlg::OnRadio )\n\tEVT_RADIOBUTTON( ID_HEIGHT_RANDOM, VegFieldsDlg::OnRadio )\n\tEVT_RADIOBUTTON( ID_HEIGHT_USE_FIELD, VegFieldsDlg::OnRadio )\nEND_EVENT_TABLE()\n\nVegFieldsDlg::VegFieldsDlg( wxWindow *parent, wxWindowID id, const wxString &title,\n\tconst wxPoint &position, const wxSize& size, long style ) :\n\tAutoDialog( parent, id, title, position, size, style )\n{\n\tVegFieldsDialogFunc( this, TRUE ); \n\n\tm_bUseSpecies = true;\n\tm_bSpeciesUseField = false;\n\n\tAddValidator(ID_USE_SPECIES, &m_bUseSpecies);\n\tAddValidator(ID_SPECIES_USE_FIELD, &m_bSpeciesUseField);\n\n\tm_bHeightRandomize = true;\n\tm_bHeightUseField = false;\n\n\tAddValidator(ID_HEIGHT_RANDOM, &m_bHeightRandomize);\n\tAddValidator(ID_HEIGHT_USE_FIELD, &m_bHeightUseField);\n}\n\nvoid VegFieldsDlg::SetShapefileName(const wxString &filename)\n{\n\tm_filename = filename;\n}\n\n\/\/ WDR: handler implementations for VegFieldsDlg\n\nvoid VegFieldsDlg::OnRadio( wxCommandEvent &event )\n{\n\t\/\/ When a radio button is pressed, we should adjust which controls are\n\t\/\/ enabled and disabled.\n\tTransferDataFromWindow();\n\n\tRefreshEnabled();\n}\n\nvoid VegFieldsDlg::RefreshEnabled()\n{\n\tGetSpeciesChoice()->Enable(m_bUseSpecies);\n\n\tGetSpeciesField()->Enable(m_bSpeciesUseField);\n\tGetSpeciesId()->Enable(m_bSpeciesUseField);\n\tGetSpeciesName()->Enable(m_bSpeciesUseField);\n\tGetCommonName()->Enable(m_bSpeciesUseField);\n\tGetBiotypeInt()->Enable(m_bSpeciesUseField);\n\tGetBiotypeString()->Enable(m_bSpeciesUseField);\n\n\tGetHeightField()->Enable(m_bHeightUseField);\n}\n\nvoid VegFieldsDlg::OnInitDialog(wxInitDialogEvent& event)\n{\n\tunsigned int i;\n\n\t\/\/ Open the SHP File\n\tm_hSHP = SHPOpen(m_filename.mb_str(), \"rb\");\n\tif (m_hSHP == NULL)\n\t{\n\t\twxMessageBox(_(\"Couldn't open shapefile.\"));\n\t\treturn;\n\t}\n\n\t\/\/ Get number of polys and type of data\n\tSHPGetInfo(m_hSHP, &m_nElem, &m_nShapeType, NULL, NULL);\n\n\t\/\/ Open DBF File\n\tDBFHandle m_db = DBFOpen(m_filename.mb_str(), \"rb\");\n\tif (m_db == NULL)\n\t{\n\t\twxMessageBox(_(\"Couldn't open DBF file.\"));\n\t\treturn;\n\t}\n\n\t\/\/ Fill species names into the SpeciesChoice control\n\twxString2 str;\n\tGetUseSpecies()->Clear();\n\tvtSpeciesList* pl = GetMainFrame()->GetPlantList();\n\tfor (i = 0; i < pl->NumSpecies(); i++)\n\t{\n\t\tvtPlantSpecies *spe = pl->GetSpecies(i);\n\t\tstr = spe->GetSciName();\n\t\tGetSpeciesChoice()->Append(str);\n\t}\n\n\t\/\/ Fill the DBF field names into the \"Use Field\" controls\n\tint *pnWidth = 0, *pnDecimals = 0;\n\tDBFFieldType fieldtype;\n\tchar pszFieldName[20];\n\tm_iFields = DBFGetFieldCount(m_db);\n\tfor (i = 0; i < m_iFields; i++)\n\t{\n\t\tvoid *clientdata = (void *) (10+i);\n\t\tfieldtype = DBFGetFieldInfo(m_db, i,\n\t\t\tpszFieldName, pnWidth, pnDecimals );\n\t\tstr = pszFieldName;\n\n\t\tif (fieldtype == FTString || fieldtype == FTInteger)\n\t\t\tGetSpeciesField()->Append(str, clientdata);\n\n\t\tif (fieldtype == FTInteger || fieldtype == FTDouble)\n\t\t\tGetHeightField()->Append(str, clientdata);\n\t}\n\twxDialog::OnInitDialog(event);  \/\/ calls TransferDataToWindow()\n\tRefreshEnabled();\n}\n\nvoid VegFieldsDlg::OnChoice1( wxCommandEvent &event )\n{\n}\n\nvoid VegFieldsDlg::OnChoice2( wxCommandEvent &event )\n{\n}\n\nvoid VegFieldsDlg::OnOK( wxCommandEvent &event )\n{\n\t\/\/ Species\n\tm_options.bFixedSpecies = m_bUseSpecies;\n\tm_options.strFixedSpeciesName = GetSpeciesChoice()->GetStringSelection();\n\tint sel = GetSpeciesField()->GetSelection();\n\tm_options.iSpeciesFieldIndex = ((int) GetSpeciesField()->GetClientData(sel)) - 10;\n\n\tif (GetSpeciesId()->GetValue())\n\t\tm_options.iInterpretSpeciesField = 0;\n\tif (GetSpeciesName()->GetValue())\n\t\tm_options.iInterpretSpeciesField = 1;\n\tif (GetCommonName()->GetValue())\n\t\tm_options.iInterpretSpeciesField = 2;\n\tif (GetBiotypeInt()->GetValue())\n\t\tm_options.iInterpretSpeciesField = 3;\n\tif (GetBiotypeString()->GetValue())\n\t\tm_options.iInterpretSpeciesField = 4;\n\n\t\/\/ Height\n\tm_options.bHeightRandom = m_bHeightRandomize;\n\tsel = GetHeightField()->GetSelection();\n\tm_options.iHeightFieldIndex = ((int) GetHeightField()->GetClientData(sel)) - 10;\n\n\twxDialog::OnOK(event);\n}\n\n<commit_msg>tweak for __APPLE__<commit_after>\/\/\n\/\/ Name:\t\tVegFieldsDlg.cpp\n\/\/\n\/\/ Copyright (c) 2002-2004 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n#ifdef __GNUG__ && !defined(__APPLE__)\n\t#pragma implementation \"VegFieldsDlg.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 \"VegFieldsDlg.h\"\n#include \"Frame.h\"\t\t\/\/ for Plants List\n\n\/\/ WDR: class implementations\n\n\/\/----------------------------------------------------------------------------\n\/\/ VegFieldsDlg\n\/\/----------------------------------------------------------------------------\n\n\/\/ WDR: event table for VegFieldsDlg\n\nBEGIN_EVENT_TABLE(VegFieldsDlg, AutoDialog)\n\tEVT_INIT_DIALOG (VegFieldsDlg::OnInitDialog)\n\tEVT_CHOICE( ID_SPECIES_FIELD, VegFieldsDlg::OnChoice1 )\n\tEVT_CHOICE( ID_HEIGHT_FIELD, VegFieldsDlg::OnChoice2 )\n\tEVT_BUTTON( wxID_OK, VegFieldsDlg::OnOK )\n\tEVT_RADIOBUTTON( ID_USE_SPECIES, VegFieldsDlg::OnRadio )\n\tEVT_RADIOBUTTON( ID_SPECIES_USE_FIELD, VegFieldsDlg::OnRadio )\n\tEVT_RADIOBUTTON( ID_HEIGHT_RANDOM, VegFieldsDlg::OnRadio )\n\tEVT_RADIOBUTTON( ID_HEIGHT_USE_FIELD, VegFieldsDlg::OnRadio )\nEND_EVENT_TABLE()\n\nVegFieldsDlg::VegFieldsDlg( wxWindow *parent, wxWindowID id, const wxString &title,\n\tconst wxPoint &position, const wxSize& size, long style ) :\n\tAutoDialog( parent, id, title, position, size, style )\n{\n\tVegFieldsDialogFunc( this, TRUE ); \n\n\tm_bUseSpecies = true;\n\tm_bSpeciesUseField = false;\n\n\tAddValidator(ID_USE_SPECIES, &m_bUseSpecies);\n\tAddValidator(ID_SPECIES_USE_FIELD, &m_bSpeciesUseField);\n\n\tm_bHeightRandomize = true;\n\tm_bHeightUseField = false;\n\n\tAddValidator(ID_HEIGHT_RANDOM, &m_bHeightRandomize);\n\tAddValidator(ID_HEIGHT_USE_FIELD, &m_bHeightUseField);\n}\n\nvoid VegFieldsDlg::SetShapefileName(const wxString &filename)\n{\n\tm_filename = filename;\n}\n\n\/\/ WDR: handler implementations for VegFieldsDlg\n\nvoid VegFieldsDlg::OnRadio( wxCommandEvent &event )\n{\n\t\/\/ When a radio button is pressed, we should adjust which controls are\n\t\/\/ enabled and disabled.\n\tTransferDataFromWindow();\n\n\tRefreshEnabled();\n}\n\nvoid VegFieldsDlg::RefreshEnabled()\n{\n\tGetSpeciesChoice()->Enable(m_bUseSpecies);\n\n\tGetSpeciesField()->Enable(m_bSpeciesUseField);\n\tGetSpeciesId()->Enable(m_bSpeciesUseField);\n\tGetSpeciesName()->Enable(m_bSpeciesUseField);\n\tGetCommonName()->Enable(m_bSpeciesUseField);\n\tGetBiotypeInt()->Enable(m_bSpeciesUseField);\n\tGetBiotypeString()->Enable(m_bSpeciesUseField);\n\n\tGetHeightField()->Enable(m_bHeightUseField);\n}\n\nvoid VegFieldsDlg::OnInitDialog(wxInitDialogEvent& event)\n{\n\tunsigned int i;\n\n\t\/\/ Open the SHP File\n\tm_hSHP = SHPOpen(m_filename.mb_str(), \"rb\");\n\tif (m_hSHP == NULL)\n\t{\n\t\twxMessageBox(_(\"Couldn't open shapefile.\"));\n\t\treturn;\n\t}\n\n\t\/\/ Get number of polys and type of data\n\tSHPGetInfo(m_hSHP, &m_nElem, &m_nShapeType, NULL, NULL);\n\n\t\/\/ Open DBF File\n\tDBFHandle m_db = DBFOpen(m_filename.mb_str(), \"rb\");\n\tif (m_db == NULL)\n\t{\n\t\twxMessageBox(_(\"Couldn't open DBF file.\"));\n\t\treturn;\n\t}\n\n\t\/\/ Fill species names into the SpeciesChoice control\n\twxString2 str;\n\tGetUseSpecies()->Clear();\n\tvtSpeciesList* pl = GetMainFrame()->GetPlantList();\n\tfor (i = 0; i < pl->NumSpecies(); i++)\n\t{\n\t\tvtPlantSpecies *spe = pl->GetSpecies(i);\n\t\tstr = spe->GetSciName();\n\t\tGetSpeciesChoice()->Append(str);\n\t}\n\n\t\/\/ Fill the DBF field names into the \"Use Field\" controls\n\tint *pnWidth = 0, *pnDecimals = 0;\n\tDBFFieldType fieldtype;\n\tchar pszFieldName[20];\n\tm_iFields = DBFGetFieldCount(m_db);\n\tfor (i = 0; i < m_iFields; i++)\n\t{\n\t\tvoid *clientdata = (void *) (10+i);\n\t\tfieldtype = DBFGetFieldInfo(m_db, i,\n\t\t\tpszFieldName, pnWidth, pnDecimals );\n\t\tstr = pszFieldName;\n\n\t\tif (fieldtype == FTString || fieldtype == FTInteger)\n\t\t\tGetSpeciesField()->Append(str, clientdata);\n\n\t\tif (fieldtype == FTInteger || fieldtype == FTDouble)\n\t\t\tGetHeightField()->Append(str, clientdata);\n\t}\n\twxDialog::OnInitDialog(event);  \/\/ calls TransferDataToWindow()\n\tRefreshEnabled();\n}\n\nvoid VegFieldsDlg::OnChoice1( wxCommandEvent &event )\n{\n}\n\nvoid VegFieldsDlg::OnChoice2( wxCommandEvent &event )\n{\n}\n\nvoid VegFieldsDlg::OnOK( wxCommandEvent &event )\n{\n\t\/\/ Species\n\tm_options.bFixedSpecies = m_bUseSpecies;\n\tm_options.strFixedSpeciesName = GetSpeciesChoice()->GetStringSelection();\n\tint sel = GetSpeciesField()->GetSelection();\n\tm_options.iSpeciesFieldIndex = ((int) GetSpeciesField()->GetClientData(sel)) - 10;\n\n\tif (GetSpeciesId()->GetValue())\n\t\tm_options.iInterpretSpeciesField = 0;\n\tif (GetSpeciesName()->GetValue())\n\t\tm_options.iInterpretSpeciesField = 1;\n\tif (GetCommonName()->GetValue())\n\t\tm_options.iInterpretSpeciesField = 2;\n\tif (GetBiotypeInt()->GetValue())\n\t\tm_options.iInterpretSpeciesField = 3;\n\tif (GetBiotypeString()->GetValue())\n\t\tm_options.iInterpretSpeciesField = 4;\n\n\t\/\/ Height\n\tm_options.bHeightRandom = m_bHeightRandomize;\n\tsel = GetHeightField()->GetSelection();\n\tm_options.iHeightFieldIndex = ((int) GetHeightField()->GetClientData(sel)) - 10;\n\n\twxDialog::OnOK(event);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\n * Copyright (c) 2008 Stefan Cosma <stefan.cosma@gmail.com>\r\n * \r\n * Permission is hereby granted, free of charge, to any person obtaining a copy\r\n * of this software and associated documentation files (the \"Software\"), to deal\r\n * in the Software without restriction, including without limitation the rights\r\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\r\n * copies of the Software, and to permit persons to whom the Software is\r\n * furnished to do so, subject to the following conditions:\r\n * \r\n * The above copyright notice and this permission notice shall be included in\r\n * all copies or substantial portions of the Software.\r\n * \r\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\n * THE SOFTWARE.\r\n *\/\r\n\r\n#include \"PluginSettings.h\" \r\n\r\n#define WIN32_LEAN_AND_MEAN\r\n\r\n#include <windows.h>\r\n#include <shlobj.h>\r\n\r\n#include <tinyxml\\tinyxml.h>\r\n\r\nPluginSettings* PluginSettings::ms_instance = 0;\r\n\r\nPluginSettings* PluginSettings::Instance()\r\n{\r\n\tif (ms_instance == 0)\r\n\t\tms_instance = new PluginSettings();\r\n\treturn ms_instance;\r\n}\r\n\r\nvoid PluginSettings::Destroy()\r\n{\r\n\tif (ms_instance != 0) {\r\n\t\tdelete ms_instance;\r\n\t\tms_instance = 0;\r\n\t}\r\n}\r\n\r\nPluginSettings::PluginSettings() : \r\n\tm_configFile(std::string(\"GlobalHotkeysConfig.xml\")), \r\n\tm_pluginFolder(std::string(\"iTunes Global Hotkeys Plugin\")),\r\n\tm_keyId(-1)\r\n{\r\n\tm_hotkeys = new std::map<const unsigned int, Hotkey*>();\r\n\r\n\t::InitActionsMap();\r\n\t::InitHotkeysMap();\r\n\r\n\tAddDefaultHotkeys();\r\n}\r\n\r\nPluginSettings::~PluginSettings()\r\n{\r\n\tdelete m_hotkeys;\r\n}\r\n\r\nstd::map<const unsigned int, Hotkey*>* PluginSettings::GetHotkeys()\r\n{\r\n\treturn m_hotkeys;\r\n}\r\n\r\nbool PluginSettings::ReadConfigFile()\r\n{\r\n\tstd::string configFilePath = std::string(\"\");\r\n\tif (!GetConfigFile(&configFilePath))\r\n\t\treturn false;\r\n\r\n\tTiXmlDocument configFile(configFilePath.c_str());\r\n\tif (!configFile.LoadFile())\r\n\t\treturn false;\r\n\r\n\tconst TiXmlElement* root = configFile.RootElement();\r\n\r\n\tconst TiXmlElement* element = root->FirstChildElement();\r\n\twhile (element) {\r\n\t\tstd::string action_name = std::string(element->Attribute(\"action\") != 0 ? element->Attribute(\"action\") : \"NotDefined\");\r\n\t\tstd::string key_name = std::string(element->Attribute(\"key\") != 0 ? element->Attribute(\"key\") : \"NotDefined\");\r\n\t\tstd::string alt_str = std::string(element->Attribute(\"alt\") != 0 ? element->Attribute(\"alt\") : \"NotDefined\");\r\n\t\tstd::string control_str = std::string(element->Attribute(\"control\") != 0 ? element->Attribute(\"control\") : \"NotDefined\");\r\n\t\tstd::string shift_str = std::string(element->Attribute(\"shift\") != 0 ? element->Attribute(\"shift\") : \"NotDefined\");\r\n\t\tstd::string win_str = std::string(element->Attribute(\"win\") != 0 ? element->Attribute(\"win\") : \"NotDefined\");\r\n\r\n\t\tstd::map<const unsigned int, Hotkey*>& hotkeys = *this->GetHotkeys();\r\n\t\thotkeys[++m_keyId] = new Hotkey(action_name, key_name, alt_str, control_str, shift_str, win_str);\r\n\r\n\t\telement = element->NextSiblingElement();\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\nvoid PluginSettings::AddDefaultHotkeys()\r\n{\r\n\tstd::map<const unsigned int, Hotkey*>& hotkeys = *this->GetHotkeys();\r\n\r\n\t\/\/ Settings Dialog \r\n\thotkeys[++m_keyId] = new Hotkey(\"OpenSettingsDialog\", \"P\", \"false\", \"true\", \"true\", \"false\");\r\n}\r\n\r\nbool PluginSettings::WriteConfigFile()\r\n{\r\n\tstd::string configFilePath = std::string(\"\");\r\n\tif (!GetConfigFile(&configFilePath))\r\n\t\treturn false;\r\n\r\n\t\/\/ TODO: Implement this\r\n\r\n\treturn false;\t\r\n}\r\n\r\nbool PluginSettings::GetAppSettingsFolder(std::string* str)\r\n{\r\n\tchar path[MAX_PATH];\r\n\tZeroMemory(path, sizeof(char) * MAX_PATH);\r\n\t\r\n\tif(SUCCEEDED(SHGetFolderPathA(NULL, CSIDL_APPDATA, NULL, 0, path))) {\r\n\t\tstr->append(path);\r\n\t\treturn true;\r\n\t} else {\r\n\t\treturn false;\r\n\t}\r\n}\r\n\r\nbool PluginSettings::GetPluginFolder(std::string* str)\r\n{\r\n\tif (!GetAppSettingsFolder(str))\r\n\t\treturn false;\r\n\r\n\tstr->append(\"\\\\\");\r\n\tstr->append(m_pluginFolder);\r\n\r\n\treturn true;\r\n}\r\n\r\nbool PluginSettings::GetConfigFile(std::string* str)\r\n{\r\n#ifdef DEBUG\r\n\tstr->append(\"C:\\\\Program Files\\\\iTunes\\\\Plug-Ins\\\\GlobalHotkeysConfig.xml\");\r\n#else\r\n\tif (!GetPluginFolder(str))\r\n\t\treturn false;\r\n\r\n\tstr->append(\"\\\\\");\r\n\tstr->append(m_configFile);\r\n#endif\r\n\r\n\treturn true;\r\n}<commit_msg>Temporary remove preferences dialog<commit_after>\/*\r\n * Copyright (c) 2008 Stefan Cosma <stefan.cosma@gmail.com>\r\n * \r\n * Permission is hereby granted, free of charge, to any person obtaining a copy\r\n * of this software and associated documentation files (the \"Software\"), to deal\r\n * in the Software without restriction, including without limitation the rights\r\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\r\n * copies of the Software, and to permit persons to whom the Software is\r\n * furnished to do so, subject to the following conditions:\r\n * \r\n * The above copyright notice and this permission notice shall be included in\r\n * all copies or substantial portions of the Software.\r\n * \r\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\n * THE SOFTWARE.\r\n *\/\r\n\r\n#include \"PluginSettings.h\" \r\n\r\n#define WIN32_LEAN_AND_MEAN\r\n\r\n#include <windows.h>\r\n#include <shlobj.h>\r\n\r\n#include <tinyxml\\tinyxml.h>\r\n\r\nPluginSettings* PluginSettings::ms_instance = 0;\r\n\r\nPluginSettings* PluginSettings::Instance()\r\n{\r\n\tif (ms_instance == 0)\r\n\t\tms_instance = new PluginSettings();\r\n\treturn ms_instance;\r\n}\r\n\r\nvoid PluginSettings::Destroy()\r\n{\r\n\tif (ms_instance != 0) {\r\n\t\tdelete ms_instance;\r\n\t\tms_instance = 0;\r\n\t}\r\n}\r\n\r\nPluginSettings::PluginSettings() : \r\n\tm_configFile(std::string(\"GlobalHotkeysConfig.xml\")), \r\n\tm_pluginFolder(std::string(\"iTunes Global Hotkeys Plugin\")),\r\n\tm_keyId(-1)\r\n{\r\n\tm_hotkeys = new std::map<const unsigned int, Hotkey*>();\r\n\r\n\t::InitActionsMap();\r\n\t::InitHotkeysMap();\r\n\r\n\tAddDefaultHotkeys();\r\n}\r\n\r\nPluginSettings::~PluginSettings()\r\n{\r\n\tdelete m_hotkeys;\r\n}\r\n\r\nstd::map<const unsigned int, Hotkey*>* PluginSettings::GetHotkeys()\r\n{\r\n\treturn m_hotkeys;\r\n}\r\n\r\nbool PluginSettings::ReadConfigFile()\r\n{\r\n\tstd::string configFilePath = std::string(\"\");\r\n\tif (!GetConfigFile(&configFilePath))\r\n\t\treturn false;\r\n\r\n\tTiXmlDocument configFile(configFilePath.c_str());\r\n\tif (!configFile.LoadFile())\r\n\t\treturn false;\r\n\r\n\tconst TiXmlElement* root = configFile.RootElement();\r\n\r\n\tconst TiXmlElement* element = root->FirstChildElement();\r\n\twhile (element) {\r\n\t\tstd::string action_name = std::string(element->Attribute(\"action\") != 0 ? element->Attribute(\"action\") : \"NotDefined\");\r\n\t\tstd::string key_name = std::string(element->Attribute(\"key\") != 0 ? element->Attribute(\"key\") : \"NotDefined\");\r\n\t\tstd::string alt_str = std::string(element->Attribute(\"alt\") != 0 ? element->Attribute(\"alt\") : \"NotDefined\");\r\n\t\tstd::string control_str = std::string(element->Attribute(\"control\") != 0 ? element->Attribute(\"control\") : \"NotDefined\");\r\n\t\tstd::string shift_str = std::string(element->Attribute(\"shift\") != 0 ? element->Attribute(\"shift\") : \"NotDefined\");\r\n\t\tstd::string win_str = std::string(element->Attribute(\"win\") != 0 ? element->Attribute(\"win\") : \"NotDefined\");\r\n\r\n\t\tstd::map<const unsigned int, Hotkey*>& hotkeys = *this->GetHotkeys();\r\n\t\thotkeys[++m_keyId] = new Hotkey(action_name, key_name, alt_str, control_str, shift_str, win_str);\r\n\r\n\t\telement = element->NextSiblingElement();\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\nvoid PluginSettings::AddDefaultHotkeys()\r\n{\r\n\tstd::map<const unsigned int, Hotkey*>& hotkeys = *this->GetHotkeys();\r\n\r\n\t\/\/ Settings Dialog \r\n\t\/\/ hotkeys[++m_keyId] = new Hotkey(\"OpenSettingsDialog\", \"P\", \"false\", \"true\", \"true\", \"false\");\r\n}\r\n\r\nbool PluginSettings::WriteConfigFile()\r\n{\r\n\tstd::string configFilePath = std::string(\"\");\r\n\tif (!GetConfigFile(&configFilePath))\r\n\t\treturn false;\r\n\r\n\t\/\/ TODO: Implement this\r\n\r\n\treturn false;\t\r\n}\r\n\r\nbool PluginSettings::GetAppSettingsFolder(std::string* str)\r\n{\r\n\tchar path[MAX_PATH];\r\n\tZeroMemory(path, sizeof(char) * MAX_PATH);\r\n\t\r\n\tif(SUCCEEDED(SHGetFolderPathA(NULL, CSIDL_APPDATA, NULL, 0, path))) {\r\n\t\tstr->append(path);\r\n\t\treturn true;\r\n\t} else {\r\n\t\treturn false;\r\n\t}\r\n}\r\n\r\nbool PluginSettings::GetPluginFolder(std::string* str)\r\n{\r\n\tif (!GetAppSettingsFolder(str))\r\n\t\treturn false;\r\n\r\n\tstr->append(\"\\\\\");\r\n\tstr->append(m_pluginFolder);\r\n\r\n\treturn true;\r\n}\r\n\r\nbool PluginSettings::GetConfigFile(std::string* str)\r\n{\r\n#ifdef DEBUG\r\n\tstr->append(\"C:\\\\Program Files\\\\iTunes\\\\Plug-Ins\\\\GlobalHotkeysConfig.xml\");\r\n#else\r\n\tif (!GetPluginFolder(str))\r\n\t\treturn false;\r\n\r\n\tstr->append(\"\\\\\");\r\n\tstr->append(m_configFile);\r\n#endif\r\n\r\n\treturn true;\r\n}<|endoftext|>"}
{"text":"<commit_before>\/\/ This file is part of the GLERI project\n\/\/\n\/\/ Copyright (c) 2012 by Mike Sharov <msharov@users.sourceforge.net>\n\/\/ This file is free software, distributed under the MIT License.\n\n#include \"rglrp.h\"\n\n#define N(n,s)\t#n \"\\0\" #s \"\\0\"\n\/*static*\/ const char PRGLR::_cmdNames[] =\n     \"\\0\"\t\/\/ Dirty trick: object name is 4 bytes, but must be zero terminated\n     N(GLError,s)\n     N(Restate,(nnqqyyyy))\n     N(Expose,)\n     N(Event,(unnuu))\n;\n#undef N\n\n\/*static*\/ inline const char* PRGLR::LookupCmdName (ECmd cmd, size_type& sz) noexcept\n{\n    return (CCmdBuf::LookupCmdName((unsigned)cmd,sz,_cmdNames+1,sizeof(_cmdNames)-2));\n}\n\n\/*static*\/ PRGLR::ECmd PRGLR::LookupCmd (const char* name, size_type bleft) noexcept\n{\n    return (ECmd(CCmdBuf::LookupCmd(name+1,bleft,_cmdNames+1,sizeof(_cmdNames)-2)));\n}\n\nbstro PRGLR::CreateCmd (ECmd cmd, size_type sz) noexcept\n{\n    size_type msz;\n    const char* m = LookupCmdName(cmd, msz);\n    return (CCmdBuf::CreateCmd (RGLRObject, m-1, msz+1, sz));\n}\n<commit_msg>Revert \"Rename Error call to GLError\"<commit_after>\/\/ This file is part of the GLERI project\n\/\/\n\/\/ Copyright (c) 2012 by Mike Sharov <msharov@users.sourceforge.net>\n\/\/ This file is free software, distributed under the MIT License.\n\n#include \"rglrp.h\"\n\n#define N(n,s)\t#n \"\\0\" #s \"\\0\"\n\/*static*\/ const char PRGLR::_cmdNames[] =\n     N(Error,s)\n     N(Restate,(nnqqyyyy))\n     N(Expose,)\n     N(Event,(unnuu))\n;\n#undef N\n\n\/*static*\/ inline const char* PRGLR::LookupCmdName (ECmd cmd, size_type& sz) noexcept\n{\n    return (CCmdBuf::LookupCmdName((unsigned)cmd,sz,_cmdNames+1,sizeof(_cmdNames)-2));\n}\n\n\/*static*\/ PRGLR::ECmd PRGLR::LookupCmd (const char* name, size_type bleft) noexcept\n{\n    return (ECmd(CCmdBuf::LookupCmd(name+1,bleft,_cmdNames+1,sizeof(_cmdNames)-2)));\n}\n\nbstro PRGLR::CreateCmd (ECmd cmd, size_type sz) noexcept\n{\n    size_type msz;\n    const char* m = LookupCmdName(cmd, msz);\n    return (CCmdBuf::CreateCmd (RGLRObject, m-1, msz+1, sz));\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <algorithm>\r\n#include <string>\r\n#include <tuple>\r\n#include <vector>\r\n#include \"xUnit++\/IOutput.h\"\r\n#include \"xUnit++\/xUnitTestRunner.h\"\r\n#include \"xUnit++\/xUnitTime.h\"\r\n#include \"xUnit++\/xUnit++.h\"\r\n\r\nusing xUnitpp::Assert;\r\n\r\nSUITE(Theory)\r\n{\r\n\r\nvoid TheoryUnderTest(int x)\r\n{\r\n    Assert.True(x == 0 || x == 1);\r\n}\r\n\r\nstruct TheoryFixture\r\n{\r\nprivate:\r\n    struct : xUnitpp::IOutput\r\n    {\r\n        virtual void ReportStart(const xUnitpp::TestDetails &) override\r\n        {\r\n        }\r\n\r\n        virtual void ReportFailure(const xUnitpp::TestDetails &, const std::string &, const xUnitpp::LineInfo &) override\r\n        {\r\n        }\r\n\r\n        virtual void ReportSkip(const xUnitpp::TestDetails &, const std::string &) override\r\n        {\r\n        }\r\n\r\n        virtual void ReportFinish(const xUnitpp::TestDetails &, xUnitpp::Time::Duration) override\r\n        {\r\n        }\r\n\r\n        virtual void ReportAllTestsComplete(size_t, size_t, size_t, xUnitpp::Time::Duration) override \r\n        {\r\n        }\r\n    } emptyReporter;\r\n\r\npublic:\r\n    TheoryFixture()\r\n        : localRunner(emptyReporter)\r\n    {\r\n    }\r\n\r\n    template<typename TTheoryData>\r\n    void Register(const std::string &name, TTheoryData &&theoryData)\r\n    {\r\n        xUnitpp::TestCollection::Register reg(collection, &TheoryUnderTest, theoryData, name, \"Theory\", attributes, -1, __FILE__, __LINE__);\r\n    }\r\n\r\n    void Run()\r\n    {\r\n        localRunner.RunTests([](const xUnitpp::TestDetails &) { return true; },\r\n            collection.Tests(), xUnitpp::Time::Duration::zero(), 0);\r\n    }\r\n\r\n    template<typename TTheoryData>\r\n    void RegisterAndRun(const std::string &name, TTheoryData &&theoryData)\r\n    {\r\n        Register(name, theoryData);\r\n\r\n        Run();\r\n    }\r\n\r\n    xUnitpp::AttributeCollection attributes;\r\n    xUnitpp::TestCollection collection;\r\n    xUnitpp::TestRunner localRunner;\r\n};\r\n\r\nstd::vector<std::tuple<int>> RawFunctionProvider()\r\n{\r\n    std::tuple<int> tuples[] =\r\n    {\r\n        std::make_tuple(0),\r\n        std::make_tuple(1),\r\n        std::make_tuple(2),\r\n        std::make_tuple(3),\r\n        std::make_tuple(0)\r\n    };\r\n\r\n    return std::vector<std::tuple<int>>(std::begin(tuples), std::end(tuples));\r\n}\r\n\r\nFACT_FIXTURE(TheoriesAcceptRawFunctions, TheoryFixture)\r\n{\r\n    RegisterAndRun(\"TheoriesAcceptRawFunctions\", RawFunctionProvider);\r\n}\r\n\r\nFACT_FIXTURE(TheoriesAcceptStdFunction, TheoryFixture)\r\n{\r\n    std::function<std::vector<std::tuple<int>>()> provider = RawFunctionProvider;\r\n\r\n    RegisterAndRun(\"TheoriesAcceptStdFunction\", provider);\r\n}\r\n\r\nFACT_FIXTURE(TheoriesAcceptFunctors, TheoryFixture)\r\n{\r\n    struct\r\n    {\r\n        std::vector<std::tuple<int>> operator()() const\r\n        {\r\n            return RawFunctionProvider();\r\n        }\r\n    } functor;\r\n\r\n    RegisterAndRun(\"TheoriesAcceptFunctors\", functor);\r\n}\r\n\r\nFACT_FIXTURE(TheoriesGetAllDataPassedToThem, TheoryFixture)\r\n{\r\n    std::vector<int> dataProvided;\r\n\r\n    \/\/ !!! this line appears to fix a somewhat random buffer overrun bug\r\n    \/\/ I am not sure why. Investigate later.\r\n    dataProvided.reserve(5);\r\n\r\n    auto doTheory = [&](int x) { dataProvided.push_back(x); };\r\n    xUnitpp::TestCollection::Register reg(collection, doTheory, RawFunctionProvider, \"TheoriesGetAllDataPassedToThem\", \"Theory\", attributes, -1, __FILE__, __LINE__);\r\n\r\n    Run();\r\n\r\n    Assert.Equal(2, std::count(dataProvided.begin(), dataProvided.end(), 0));\r\n    Assert.Equal(1, std::count(dataProvided.begin(), dataProvided.end(), 1));\r\n    Assert.Equal(1, std::count(dataProvided.begin(), dataProvided.end(), 2));\r\n    Assert.Equal(1, std::count(dataProvided.begin(), dataProvided.end(), 3));\r\n}\r\n\r\nFACT_FIXTURE(TheoriesCanBeSkipped, TheoryFixture)\r\n{\r\n    attributes.insert(std::make_pair(\"Skip\", \"Testing skip.\"));\r\n\r\n    auto doTheory = [](int) { Assert.Fail(\"Should not be run.\"); };\r\n\r\n    xUnitpp::TestCollection::Register reg(collection, doTheory, RawFunctionProvider, \"TheoriesGetAllDataPassedToThem\", \"Theory\", attributes, -1, __FILE__, __LINE__);\r\n\r\n    Run();\r\n}\r\n\r\nATTRIBUTES(TheoriesCanHaveAttributes, (\"Cats\", \"Meow\"))\r\nDATA_THEORY(TheoriesCanHaveAttributes, (int), RawFunctionProvider)\r\n{\r\n    for (const auto &test : xUnitpp::TestCollection::Instance().Tests())\r\n    {\r\n        if (test.TestDetails().ShortName == \"TheoriesCanHaveAttributes\")\r\n        {\r\n            auto it = test.TestDetails().Attributes.find(\"Cats\");\r\n            Assert.True(it != test.TestDetails().Attributes.end());\r\n            Assert.True(it->second == \"Meow\");\r\n            return;\r\n        }\r\n    }\r\n\r\n    Assert.Fail(\"Could not find self in test list.\");\r\n}\r\n\r\nstd::vector<std::tuple<std::string, std::vector<std::tuple<int, std::string>>>> ComplexProvider()\r\n{\r\n    std::vector<std::tuple<std::string, std::vector<std::tuple<int, std::string>>>> result;\r\n\r\n    std::vector<std::tuple<int, std::string>> internal_vector;\r\n    internal_vector.push_back(std::make_tuple(0, std::string(\"xyz\")));\r\n\r\n    result.push_back(std::make_tuple(std::string(\"abcd\"), internal_vector));\r\n\r\n    return result;\r\n}\r\n\r\nDATA_THEORY(TheoriesCanAcceptComplexObjects, (const std::string &, const std::vector<std::tuple<int, std::string>> &), ComplexProvider)\r\n{\r\n    \/\/ just existing is good enough\r\n}\r\n\r\nDATA_THEORY(TheoriesCanAcceptLambdas, (int, int),\r\n    ([]() -> std::vector<std::tuple<int, int>>\r\n    {\r\n        std::vector<std::tuple<int, int>> data;\r\n        data.push_back(std::make_tuple(0, 0));\r\n        return data;\r\n    })\r\n)\r\n{\r\n    \/\/ just existing is good enough\r\n}\r\n\r\nTHEORY(TestingSuccessfulInlineTheory, (int x, const std::string &str),\r\n    std::make_tuple(0, \"\"),\r\n    std::make_tuple(0, \"\"),\r\n    std::make_tuple(0, \"\"),\r\n    std::make_tuple(0, \"\"))\r\n{\r\n    Assert.Equal(0, x);\r\n    Assert.Empty(str);\r\n}\r\n\r\nTHEORY(TestingFailingInlineTheory, (int, const std::string &str),\r\n    std::make_tuple(1, \"a\"),\r\n    std::make_tuple(1, \"b\"),\r\n    std::make_tuple(1, \"c\"),\r\n    std::make_tuple(1, \"d\"))\r\n{\r\n    Assert.Throws<xUnitpp::xUnitAssert>([&]() { Assert.Empty(str); });\r\n}\r\n\r\n}\r\n<commit_msg>proved that a lambda can be used as THEORY data<commit_after>#include <algorithm>\r\n#include <string>\r\n#include <tuple>\r\n#include <vector>\r\n#include \"xUnit++\/IOutput.h\"\r\n#include \"xUnit++\/xUnitTestRunner.h\"\r\n#include \"xUnit++\/xUnitTime.h\"\r\n#include \"xUnit++\/xUnit++.h\"\r\n\r\nusing xUnitpp::Assert;\r\n\r\nSUITE(Theory)\r\n{\r\n\r\nvoid TheoryUnderTest(int x)\r\n{\r\n    Assert.True(x == 0 || x == 1);\r\n}\r\n\r\nstruct TheoryFixture\r\n{\r\nprivate:\r\n    struct : xUnitpp::IOutput\r\n    {\r\n        virtual void ReportStart(const xUnitpp::TestDetails &) override\r\n        {\r\n        }\r\n\r\n        virtual void ReportFailure(const xUnitpp::TestDetails &, const std::string &, const xUnitpp::LineInfo &) override\r\n        {\r\n        }\r\n\r\n        virtual void ReportSkip(const xUnitpp::TestDetails &, const std::string &) override\r\n        {\r\n        }\r\n\r\n        virtual void ReportFinish(const xUnitpp::TestDetails &, xUnitpp::Time::Duration) override\r\n        {\r\n        }\r\n\r\n        virtual void ReportAllTestsComplete(size_t, size_t, size_t, xUnitpp::Time::Duration) override \r\n        {\r\n        }\r\n    } emptyReporter;\r\n\r\npublic:\r\n    TheoryFixture()\r\n        : localRunner(emptyReporter)\r\n    {\r\n    }\r\n\r\n    template<typename TTheoryData>\r\n    void Register(const std::string &name, TTheoryData &&theoryData)\r\n    {\r\n        xUnitpp::TestCollection::Register reg(collection, &TheoryUnderTest, theoryData, name, \"Theory\", attributes, -1, __FILE__, __LINE__);\r\n    }\r\n\r\n    void Run()\r\n    {\r\n        localRunner.RunTests([](const xUnitpp::TestDetails &) { return true; },\r\n            collection.Tests(), xUnitpp::Time::Duration::zero(), 0);\r\n    }\r\n\r\n    template<typename TTheoryData>\r\n    void RegisterAndRun(const std::string &name, TTheoryData &&theoryData)\r\n    {\r\n        Register(name, theoryData);\r\n\r\n        Run();\r\n    }\r\n\r\n    xUnitpp::AttributeCollection attributes;\r\n    xUnitpp::TestCollection collection;\r\n    xUnitpp::TestRunner localRunner;\r\n};\r\n\r\nstd::vector<std::tuple<int>> RawFunctionProvider()\r\n{\r\n    std::tuple<int> tuples[] =\r\n    {\r\n        std::make_tuple(0),\r\n        std::make_tuple(1),\r\n        std::make_tuple(2),\r\n        std::make_tuple(3),\r\n        std::make_tuple(0)\r\n    };\r\n\r\n    return std::vector<std::tuple<int>>(std::begin(tuples), std::end(tuples));\r\n}\r\n\r\nFACT_FIXTURE(TheoriesAcceptRawFunctions, TheoryFixture)\r\n{\r\n    RegisterAndRun(\"TheoriesAcceptRawFunctions\", RawFunctionProvider);\r\n}\r\n\r\nFACT_FIXTURE(TheoriesAcceptStdFunction, TheoryFixture)\r\n{\r\n    std::function<std::vector<std::tuple<int>>()> provider = RawFunctionProvider;\r\n\r\n    RegisterAndRun(\"TheoriesAcceptStdFunction\", provider);\r\n}\r\n\r\nFACT_FIXTURE(TheoriesAcceptFunctors, TheoryFixture)\r\n{\r\n    struct\r\n    {\r\n        std::vector<std::tuple<int>> operator()() const\r\n        {\r\n            return RawFunctionProvider();\r\n        }\r\n    } functor;\r\n\r\n    RegisterAndRun(\"TheoriesAcceptFunctors\", functor);\r\n}\r\n\r\nFACT_FIXTURE(TheoriesGetAllDataPassedToThem, TheoryFixture)\r\n{\r\n    std::vector<int> dataProvided;\r\n\r\n    \/\/ !!! this line appears to fix a somewhat random buffer overrun bug\r\n    \/\/ I am not sure why. Investigate later.\r\n    dataProvided.reserve(5);\r\n\r\n    auto doTheory = [&](int x) { dataProvided.push_back(x); };\r\n    xUnitpp::TestCollection::Register reg(collection, doTheory, RawFunctionProvider, \"TheoriesGetAllDataPassedToThem\", \"Theory\", attributes, -1, __FILE__, __LINE__);\r\n\r\n    Run();\r\n\r\n    Assert.Equal(2, std::count(dataProvided.begin(), dataProvided.end(), 0));\r\n    Assert.Equal(1, std::count(dataProvided.begin(), dataProvided.end(), 1));\r\n    Assert.Equal(1, std::count(dataProvided.begin(), dataProvided.end(), 2));\r\n    Assert.Equal(1, std::count(dataProvided.begin(), dataProvided.end(), 3));\r\n}\r\n\r\nFACT_FIXTURE(TheoriesCanBeSkipped, TheoryFixture)\r\n{\r\n    attributes.insert(std::make_pair(\"Skip\", \"Testing skip.\"));\r\n\r\n    auto doTheory = [](int) { Assert.Fail(\"Should not be run.\"); };\r\n\r\n    xUnitpp::TestCollection::Register reg(collection, doTheory, RawFunctionProvider, \"TheoriesGetAllDataPassedToThem\", \"Theory\", attributes, -1, __FILE__, __LINE__);\r\n\r\n    Run();\r\n}\r\n\r\nATTRIBUTES(TheoriesCanHaveAttributes, (\"Cats\", \"Meow\"))\r\nDATA_THEORY(TheoriesCanHaveAttributes, (int), RawFunctionProvider)\r\n{\r\n    for (const auto &test : xUnitpp::TestCollection::Instance().Tests())\r\n    {\r\n        if (test.TestDetails().ShortName == \"TheoriesCanHaveAttributes\")\r\n        {\r\n            auto it = test.TestDetails().Attributes.find(\"Cats\");\r\n            Assert.True(it != test.TestDetails().Attributes.end());\r\n            Assert.True(it->second == \"Meow\");\r\n            return;\r\n        }\r\n    }\r\n\r\n    Assert.Fail(\"Could not find self in test list.\");\r\n}\r\n\r\nstd::vector<std::tuple<std::string, std::vector<std::tuple<int, std::string>>>> ComplexProvider()\r\n{\r\n    std::vector<std::tuple<std::string, std::vector<std::tuple<int, std::string>>>> result;\r\n\r\n    std::vector<std::tuple<int, std::string>> internal_vector;\r\n    internal_vector.push_back(std::make_tuple(0, std::string(\"xyz\")));\r\n\r\n    result.push_back(std::make_tuple(std::string(\"abcd\"), internal_vector));\r\n\r\n    return result;\r\n}\r\n\r\nDATA_THEORY(TheoriesCanAcceptComplexObjects, (const std::string &, const std::vector<std::tuple<int, std::string>> &), ComplexProvider)\r\n{\r\n    \/\/ just existing is good enough\r\n}\r\n\r\nDATA_THEORY(TheoriesCanAcceptLambdas, (int, int),\r\n    ([]() -> std::vector<std::tuple<int, int>>\r\n    {\r\n        std::vector<std::tuple<int, int>> data;\r\n        data.push_back(std::make_tuple(0, 0));\r\n        return data;\r\n    })\r\n)\r\n{\r\n    \/\/ just existing is good enough\r\n}\r\n\r\nTHEORY(TestingSuccessfulInlineTheory, (int x, const std::string &str),\r\n    std::make_tuple(0, \"\"),\r\n    std::make_tuple(0, \"\"),\r\n    std::make_tuple(0, \"\"),\r\n    std::make_tuple(0, \"\"))\r\n{\r\n    Assert.Equal(0, x);\r\n    Assert.Empty(str);\r\n}\r\n\r\nTHEORY(TestingFailingInlineTheory, (int, const std::string &str),\r\n    std::make_tuple(1, \"a\"),\r\n    std::make_tuple(1, \"b\"),\r\n    std::make_tuple(1, \"c\"),\r\n    std::make_tuple(1, \"d\"))\r\n{\r\n    Assert.Throws<xUnitpp::xUnitAssert>([&]() { Assert.Empty(str); });\r\n}\r\n\r\nDATA_THEORY(TestingLambdasAsData, (std::function<void()> fn),\r\n([]()\r\n{\r\n    std::vector<std::tuple<std::function<void()>>> data;\r\n    data.emplace_back(std::make_tuple([]() { }));\r\n    return data;\r\n})\r\n)\r\n{\r\n    Assert.DoesNotThrow(fn);\r\n}\r\n\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/*    Copyright (c) 2010-2014, Delft University of Technology\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 *      - Redistributions of source code must retain the above copyright notice, this list of\n *        conditions and the following disclaimer.\n *      - Redistributions in binary form must reproduce the above copyright notice, this list of\n *        conditions and the following disclaimer in the documentation and\/or other materials\n *        provided with the distribution.\n *      - Neither the name of the Delft University of Technology nor the names of its contributors\n *        may be 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 EXPRESS\n *    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 THE\n *    COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n *    EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE\n *    GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n *    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\n *    OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *    Changelog\n *      YYMMDD    Author            Comment\n *      120323    K. Kumar          Created based off of unit test for RKF78 integrator; test data\n *                                  taken from (The Mathworks, 2012).\n *      120404    K. Kumar          Updated MATLAB unit test by adding discrete-event data file.\n *      130204    K. Kumar          Updated tolerance for discrete-event case to prevent failure\n *                                  of test under Windows.\n *      130916    K. Kumar          Updated error tolerances for MuPAD-based tests.\n *\n *    References\n *      Montenbruck, O., Gill, E. Satellite Orbits: Models, Methods, Applications, Springer, 2005.\n *      The Mathworks, Inc. DOPRI78, Symbolic Math Toolbox, 2012.\n *\n *    Notes\n *      All the test for this integrator are based on the data generated using the Symbolic Math\n *      Toolbox (MathWorks, 2012). Ideally, another source of data should be used to complete the\n *      testing.\n *\n *      The single step and full integration error tolerances were picked to be as small as\n *      possible, without causing the tests to fail. These values are not deemed to indicate any\n *      bugs in the code; however, it is important to take these discrepancies into account when\n *      using this numerical integrator.\n *\n *\/\n\n#define BOOST_TEST_MAIN\n\n#include <limits>\n#include <string>\n\n#include <boost\/make_shared.hpp>\n#include <boost\/test\/unit_test.hpp>\n\n#include <Eigen\/Core>\n\n#include <TudatCore\/InputOutput\/matrixTextFileReader.h>\n#include <TudatCore\/Mathematics\/NumericalIntegrators\/numericalIntegrator.h>\n#include <TudatCore\/Mathematics\/NumericalIntegrators\/reinitializableNumericalIntegrator.h>\n#include <TudatCore\/Mathematics\/NumericalIntegrators\/UnitTests\/numericalIntegratorTests.h>\n#include <TudatCore\/Mathematics\/NumericalIntegrators\/UnitTests\/numericalIntegratorTestFunctions.h>\n\n#include \"Tudat\/InputOutput\/basicInputOutput.h\"\n#include \"Tudat\/Mathematics\/BasicMathematics\/linearAlgebra.h\"\n#include \"Tudat\/Mathematics\/NumericalIntegrators\/rungeKuttaVariableStepSizeIntegrator.h\"\n#include \"Tudat\/Mathematics\/NumericalIntegrators\/rungeKuttaCoefficients.h\"\n\nnamespace tudat\n{\nnamespace unit_tests\n{\n\nBOOST_AUTO_TEST_SUITE( test_runge_kutta_87_dormand_and_prince_integrator )\n\nusing basic_mathematics::linear_algebra::flipMatrixRows;\n\nusing numerical_integrators::NumericalIntegratorXdPointer;\nusing numerical_integrators::ReinitializableNumericalIntegratorXdPointer;\nusing numerical_integrators::RungeKuttaVariableStepSizeIntegratorXd;\nusing numerical_integrators::RungeKuttaCoefficients;\n\nusing numerical_integrator_test_functions::computeNonAutonomousModelStateDerivative;\n\n\/\/! Test Runge-Kutta 87 Dormand-Prince integrator using benchmark data from (The MathWorks, 2012).\nBOOST_AUTO_TEST_CASE( testRungeKutta87DormandAndPrinceIntegratorUsingMatlabData )\n{\n    using namespace numerical_integrator_tests;\n\n    \/\/ Read in benchmark data (generated using Symbolic Math Toolbox in Matlab\n    \/\/ (The MathWorks, 2012)). This data is generated using the DOPRI78 numerical integrator.\n    const std::string pathToForwardIntegrationOutputFile = input_output::getTudatRootPath( )\n            + \"\/Mathematics\/NumericalIntegrators\/UnitTests\"\n            + \"\/matlabOutputRungeKutta87DormandPrinceForward.txt\";\n    const std::string pathToDiscreteEventIntegrationOutputFile = input_output::getTudatRootPath( )\n            + \"\/Mathematics\/NumericalIntegrators\/UnitTests\"\n            + \"\/matlabOutputRungeKutta87DormandPrinceDiscreteEvent.txt\";\n\n    \/\/ Store benchmark data in matrix.\n    const Eigen::MatrixXd matlabForwardIntegrationData =\n            input_output::readMatrixFromFile( pathToForwardIntegrationOutputFile, \",\" );\n    Eigen::MatrixXd matlabBackwardIntegrationData = matlabForwardIntegrationData;\n    flipMatrixRows( matlabBackwardIntegrationData );\n    const Eigen::MatrixXd matlabDiscreteEventIntegrationData =\n            input_output::readMatrixFromFile( pathToDiscreteEventIntegrationOutputFile, \",\" );\n\n    \/\/ Set integrator parameters.\n\n    \/\/ All of the following parameters are set such that the input data is fully accepted by the\n    \/\/ integrator, to determine the steps to be taken.\n    const double zeroMinimumStepSize = std::numeric_limits< double >::epsilon( );\n    const double infiniteMaximumStepSize = std::numeric_limits< double >::infinity( );\n    const double infiniteRelativeErrorTolerance = std::numeric_limits< double >::infinity( );\n    const double infiniteAbsoluteErrorTolerance = std::numeric_limits< double >::infinity( );\n\n    \/\/ The following parameters set how the error control mechanism should work.\n    const double relativeErrorTolerance = 1.0e-15;\n    const double absoluteErrorTolerance = 1.0e-15;\n\n    \/\/ Case 1: Execute integrateTo() to integrate one step forward in time.\n    {\n        \/\/ Declare integrator with all necessary settings.\n        NumericalIntegratorXdPointer integrator\n                = boost::make_shared< RungeKuttaVariableStepSizeIntegratorXd >(\n                    RungeKuttaCoefficients::get( RungeKuttaCoefficients::rungeKutta87DormandPrince ),\n                    &computeNonAutonomousModelStateDerivative,\n                    matlabForwardIntegrationData( FIRST_ROW, TIME_COLUMN_INDEX ),\n                    ( Eigen::VectorXd( 1 )\n                      << matlabForwardIntegrationData( FIRST_ROW,\n                                                       STATE_COLUMN_INDEX ) ).finished( ),\n                    zeroMinimumStepSize,\n                    infiniteMaximumStepSize,\n                    infiniteRelativeErrorTolerance,\n                    infiniteAbsoluteErrorTolerance );\n\n        executeOneIntegrateToStep( matlabForwardIntegrationData, 1.0e-15, integrator );\n    }\n\n    \/\/ Case 2: Execute performIntegrationStep() to perform multiple integration steps until final\n    \/\/         time.\n    {\n        \/\/ Declare integrator with all necessary settings.\n        NumericalIntegratorXdPointer integrator\n                = boost::make_shared< RungeKuttaVariableStepSizeIntegratorXd >(\n                    RungeKuttaCoefficients::get( RungeKuttaCoefficients::rungeKutta87DormandPrince ),\n                    &computeNonAutonomousModelStateDerivative,\n                    matlabForwardIntegrationData( FIRST_ROW, TIME_COLUMN_INDEX ),\n                    ( Eigen::VectorXd( 1 )\n                      << matlabForwardIntegrationData( FIRST_ROW,\n                                                       STATE_COLUMN_INDEX ) ).finished( ),\n                    zeroMinimumStepSize,\n                    infiniteMaximumStepSize,\n                    infiniteRelativeErrorTolerance,\n                    infiniteAbsoluteErrorTolerance );\n\n        performIntegrationStepToSpecifiedTime( matlabForwardIntegrationData,\n                                               1.0e-15, 1.0e-15, integrator );\n    }\n\n    \/\/ Case 3: Execute performIntegrationStep() to perform multiple integration steps until initial\n    \/\/         time (backwards).\n    {\n        \/\/ Declare integrator with all necessary settings.\n        NumericalIntegratorXdPointer integrator\n                = boost::make_shared< RungeKuttaVariableStepSizeIntegratorXd >(\n                    RungeKuttaCoefficients::get( RungeKuttaCoefficients::rungeKutta87DormandPrince ),\n                    &computeNonAutonomousModelStateDerivative,\n                    matlabBackwardIntegrationData( FIRST_ROW, TIME_COLUMN_INDEX ),\n                    ( Eigen::VectorXd( 1 )\n                      << matlabBackwardIntegrationData( FIRST_ROW,\n                                                        STATE_COLUMN_INDEX ) ).finished( ),\n                    zeroMinimumStepSize,\n                    infiniteMaximumStepSize,\n                    infiniteRelativeErrorTolerance,\n                    infiniteAbsoluteErrorTolerance );\n\n        performIntegrationStepToSpecifiedTime( matlabBackwardIntegrationData,\n                                               1.0e-15, 1.0e-15, integrator );\n    }\n\n    \/\/ Case 4: Execute integrateTo() to integrate to specified time in one step.\n    {\n        \/\/ Note that this test has a strange issue that the if the absolute error tolerance is set\n        \/\/ to 1.0e-15, the last step that the integrateTo() function takes does not result in the\n        \/\/ expected final time of 1.0. As a temporary solution, the absolute error tolerance has\n        \/\/ been multiplied by 10.0, which seems to solve the problem. This error indicated a\n        \/\/ possible problem with the implementation of the integrateTo() function, which needs to\n        \/\/ be investigated in future.\n\n        \/\/ Declare integrator with all necessary settings.\n        NumericalIntegratorXdPointer integrator\n                = boost::make_shared< RungeKuttaVariableStepSizeIntegratorXd >(\n                    RungeKuttaCoefficients::get( RungeKuttaCoefficients::rungeKutta87DormandPrince ),\n                    &computeNonAutonomousModelStateDerivative,\n                    matlabForwardIntegrationData( FIRST_ROW, TIME_COLUMN_INDEX ),\n                    ( Eigen::VectorXd( 1 )\n                      << matlabForwardIntegrationData( FIRST_ROW,\n                                                       STATE_COLUMN_INDEX ) ).finished( ),\n                    zeroMinimumStepSize,\n                    infiniteMaximumStepSize,\n                    relativeErrorTolerance,\n                    absoluteErrorTolerance * 10.0 );\n\n        executeIntegrateToToSpecifiedTime( matlabForwardIntegrationData, 1.0e-15, integrator,\n                                           matlabForwardIntegrationData(\n                                               matlabForwardIntegrationData.rows( ) - 1,\n                                               TIME_COLUMN_INDEX ) );\n    }\n\n    \/\/ Case 5: Execute performIntegrationstep() to integrate to specified time in multiple steps,\n    \/\/         including discrete events.\n    {\n        \/\/ Declare integrator with all necessary settings.\n        ReinitializableNumericalIntegratorXdPointer integrator\n                = boost::make_shared< RungeKuttaVariableStepSizeIntegratorXd >(\n                    RungeKuttaCoefficients::get( RungeKuttaCoefficients::rungeKutta87DormandPrince ),\n                    &computeNonAutonomousModelStateDerivative,\n                    matlabForwardIntegrationData( FIRST_ROW, TIME_COLUMN_INDEX ),\n                    ( Eigen::VectorXd( 1 )\n                      << matlabForwardIntegrationData( FIRST_ROW,\n                                                       STATE_COLUMN_INDEX ) ).finished( ),\n                    zeroMinimumStepSize,\n                    infiniteMaximumStepSize,\n                    infiniteRelativeErrorTolerance,\n                    infiniteAbsoluteErrorTolerance );\n\n        performIntegrationStepToSpecifiedTimeWithEvents( matlabDiscreteEventIntegrationData,\n                                                         1.0e-15, 1.0e-13, integrator );\n    }\n}\n\nBOOST_AUTO_TEST_SUITE_END( )\n\n} \/\/ namespace unit_tests\n} \/\/ namespace tudat\n<commit_msg>Relax test tolerances for RKF87 integrator to prevent failure using GCC 4.4.1 on older systems (issue #760).<commit_after>\/*    Copyright (c) 2010-2014, Delft University of Technology\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 *      - Redistributions of source code must retain the above copyright notice, this list of\n *        conditions and the following disclaimer.\n *      - Redistributions in binary form must reproduce the above copyright notice, this list of\n *        conditions and the following disclaimer in the documentation and\/or other materials\n *        provided with the distribution.\n *      - Neither the name of the Delft University of Technology nor the names of its contributors\n *        may be 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 EXPRESS\n *    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 THE\n *    COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n *    EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE\n *    GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n *    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\n *    OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *    Changelog\n *      YYMMDD    Author            Comment\n *      120323    K. Kumar          Created based off of unit test for RKF78 integrator; test data\n *                                  taken from (The Mathworks, 2012).\n *      120404    K. Kumar          Updated MATLAB unit test by adding discrete-event data file.\n *      130204    K. Kumar          Updated tolerance for discrete-event case to prevent failure\n *                                  of test under Windows.\n *      130916    K. Kumar          Updated error tolerances for MuPAD-based tests.\n *\n *    References\n *      Montenbruck, O., Gill, E. Satellite Orbits: Models, Methods, Applications, Springer, 2005.\n *      The Mathworks, Inc. DOPRI78, Symbolic Math Toolbox, 2012.\n *\n *    Notes\n *      All the test for this integrator are based on the data generated using the Symbolic Math\n *      Toolbox (MathWorks, 2012). Ideally, another source of data should be used to complete the\n *      testing.\n *\n *      The single step and full integration error tolerances were picked to be as small as\n *      possible, without causing the tests to fail. These values are not deemed to indicate any\n *      bugs in the code; however, it is important to take these discrepancies into account when\n *      using this numerical integrator.\n *\n *\/\n\n#define BOOST_TEST_MAIN\n\n#include <limits>\n#include <string>\n\n#include <boost\/make_shared.hpp>\n#include <boost\/test\/unit_test.hpp>\n\n#include <Eigen\/Core>\n\n#include <TudatCore\/InputOutput\/matrixTextFileReader.h>\n#include <TudatCore\/Mathematics\/NumericalIntegrators\/numericalIntegrator.h>\n#include <TudatCore\/Mathematics\/NumericalIntegrators\/reinitializableNumericalIntegrator.h>\n#include <TudatCore\/Mathematics\/NumericalIntegrators\/UnitTests\/numericalIntegratorTests.h>\n#include <TudatCore\/Mathematics\/NumericalIntegrators\/UnitTests\/numericalIntegratorTestFunctions.h>\n\n#include \"Tudat\/InputOutput\/basicInputOutput.h\"\n#include \"Tudat\/Mathematics\/BasicMathematics\/linearAlgebra.h\"\n#include \"Tudat\/Mathematics\/NumericalIntegrators\/rungeKuttaVariableStepSizeIntegrator.h\"\n#include \"Tudat\/Mathematics\/NumericalIntegrators\/rungeKuttaCoefficients.h\"\n\nnamespace tudat\n{\nnamespace unit_tests\n{\n\nBOOST_AUTO_TEST_SUITE( test_runge_kutta_87_dormand_and_prince_integrator )\n\nusing basic_mathematics::linear_algebra::flipMatrixRows;\n\nusing numerical_integrators::NumericalIntegratorXdPointer;\nusing numerical_integrators::ReinitializableNumericalIntegratorXdPointer;\nusing numerical_integrators::RungeKuttaVariableStepSizeIntegratorXd;\nusing numerical_integrators::RungeKuttaCoefficients;\n\nusing numerical_integrator_test_functions::computeNonAutonomousModelStateDerivative;\n\n\/\/! Test Runge-Kutta 87 Dormand-Prince integrator using benchmark data from (The MathWorks, 2012).\nBOOST_AUTO_TEST_CASE( testRungeKutta87DormandAndPrinceIntegratorUsingMatlabData )\n{\n    using namespace numerical_integrator_tests;\n\n    \/\/ Read in benchmark data (generated using Symbolic Math Toolbox in Matlab\n    \/\/ (The MathWorks, 2012)). This data is generated using the DOPRI78 numerical integrator.\n    const std::string pathToForwardIntegrationOutputFile = input_output::getTudatRootPath( )\n            + \"\/Mathematics\/NumericalIntegrators\/UnitTests\"\n            + \"\/matlabOutputRungeKutta87DormandPrinceForward.txt\";\n    const std::string pathToDiscreteEventIntegrationOutputFile = input_output::getTudatRootPath( )\n            + \"\/Mathematics\/NumericalIntegrators\/UnitTests\"\n            + \"\/matlabOutputRungeKutta87DormandPrinceDiscreteEvent.txt\";\n\n    \/\/ Store benchmark data in matrix.\n    const Eigen::MatrixXd matlabForwardIntegrationData =\n            input_output::readMatrixFromFile( pathToForwardIntegrationOutputFile, \",\" );\n    Eigen::MatrixXd matlabBackwardIntegrationData = matlabForwardIntegrationData;\n    flipMatrixRows( matlabBackwardIntegrationData );\n    const Eigen::MatrixXd matlabDiscreteEventIntegrationData =\n            input_output::readMatrixFromFile( pathToDiscreteEventIntegrationOutputFile, \",\" );\n\n    \/\/ Set integrator parameters.\n\n    \/\/ All of the following parameters are set such that the input data is fully accepted by the\n    \/\/ integrator, to determine the steps to be taken.\n    const double zeroMinimumStepSize = std::numeric_limits< double >::epsilon( );\n    const double infiniteMaximumStepSize = std::numeric_limits< double >::infinity( );\n    const double infiniteRelativeErrorTolerance = std::numeric_limits< double >::infinity( );\n    const double infiniteAbsoluteErrorTolerance = std::numeric_limits< double >::infinity( );\n\n    \/\/ The following parameters set how the error control mechanism should work.\n    const double relativeErrorTolerance = 1.0e-15;\n    const double absoluteErrorTolerance = 1.0e-15;\n\n    \/\/ Case 1: Execute integrateTo() to integrate one step forward in time.\n    {\n        \/\/ Declare integrator with all necessary settings.\n        NumericalIntegratorXdPointer integrator\n                = boost::make_shared< RungeKuttaVariableStepSizeIntegratorXd >(\n                    RungeKuttaCoefficients::get( RungeKuttaCoefficients::rungeKutta87DormandPrince ),\n                    &computeNonAutonomousModelStateDerivative,\n                    matlabForwardIntegrationData( FIRST_ROW, TIME_COLUMN_INDEX ),\n                    ( Eigen::VectorXd( 1 )\n                      << matlabForwardIntegrationData( FIRST_ROW,\n                                                       STATE_COLUMN_INDEX ) ).finished( ),\n                    zeroMinimumStepSize,\n                    infiniteMaximumStepSize,\n                    infiniteRelativeErrorTolerance,\n                    infiniteAbsoluteErrorTolerance );\n\n        executeOneIntegrateToStep( matlabForwardIntegrationData, 1.0e-15, integrator );\n    }\n\n    \/\/ Case 2: Execute performIntegrationStep() to perform multiple integration steps until final\n    \/\/         time.\n    {\n        \/\/ Declare integrator with all necessary settings.\n        NumericalIntegratorXdPointer integrator\n                = boost::make_shared< RungeKuttaVariableStepSizeIntegratorXd >(\n                    RungeKuttaCoefficients::get( RungeKuttaCoefficients::rungeKutta87DormandPrince ),\n                    &computeNonAutonomousModelStateDerivative,\n                    matlabForwardIntegrationData( FIRST_ROW, TIME_COLUMN_INDEX ),\n                    ( Eigen::VectorXd( 1 )\n                      << matlabForwardIntegrationData( FIRST_ROW,\n                                                       STATE_COLUMN_INDEX ) ).finished( ),\n                    zeroMinimumStepSize,\n                    infiniteMaximumStepSize,\n                    infiniteRelativeErrorTolerance,\n                    infiniteAbsoluteErrorTolerance );\n\n        performIntegrationStepToSpecifiedTime( matlabForwardIntegrationData,\n                                               1.0e-15, 1.0e-15, integrator );\n    }\n\n    \/\/ Case 3: Execute performIntegrationStep() to perform multiple integration steps until initial\n    \/\/         time (backwards).\n    {\n        \/\/ Declare integrator with all necessary settings.\n        NumericalIntegratorXdPointer integrator\n                = boost::make_shared< RungeKuttaVariableStepSizeIntegratorXd >(\n                    RungeKuttaCoefficients::get( RungeKuttaCoefficients::rungeKutta87DormandPrince ),\n                    &computeNonAutonomousModelStateDerivative,\n                    matlabBackwardIntegrationData( FIRST_ROW, TIME_COLUMN_INDEX ),\n                    ( Eigen::VectorXd( 1 )\n                      << matlabBackwardIntegrationData( FIRST_ROW,\n                                                        STATE_COLUMN_INDEX ) ).finished( ),\n                    zeroMinimumStepSize,\n                    infiniteMaximumStepSize,\n                    infiniteRelativeErrorTolerance,\n                    infiniteAbsoluteErrorTolerance );\n\n        performIntegrationStepToSpecifiedTime( matlabBackwardIntegrationData,\n                                               1.0e-15, 1.0e-14, integrator );\n    }\n\n    \/\/ Case 4: Execute integrateTo() to integrate to specified time in one step.\n    {\n        \/\/ Note that this test has a strange issue that the if the absolute error tolerance is set\n        \/\/ to 1.0e-15, the last step that the integrateTo() function takes does not result in the\n        \/\/ expected final time of 1.0. As a temporary solution, the absolute error tolerance has\n        \/\/ been multiplied by 10.0, which seems to solve the problem. This error indicated a\n        \/\/ possible problem with the implementation of the integrateTo() function, which needs to\n        \/\/ be investigated in future.\n\n        \/\/ Declare integrator with all necessary settings.\n        NumericalIntegratorXdPointer integrator\n                = boost::make_shared< RungeKuttaVariableStepSizeIntegratorXd >(\n                    RungeKuttaCoefficients::get( RungeKuttaCoefficients::rungeKutta87DormandPrince ),\n                    &computeNonAutonomousModelStateDerivative,\n                    matlabForwardIntegrationData( FIRST_ROW, TIME_COLUMN_INDEX ),\n                    ( Eigen::VectorXd( 1 )\n                      << matlabForwardIntegrationData( FIRST_ROW,\n                                                       STATE_COLUMN_INDEX ) ).finished( ),\n                    zeroMinimumStepSize,\n                    infiniteMaximumStepSize,\n                    relativeErrorTolerance,\n                    absoluteErrorTolerance * 10.0 );\n\n        executeIntegrateToToSpecifiedTime( matlabForwardIntegrationData, 1.0e-15, integrator,\n                                           matlabForwardIntegrationData(\n                                               matlabForwardIntegrationData.rows( ) - 1,\n                                               TIME_COLUMN_INDEX ) );\n    }\n\n    \/\/ Case 5: Execute performIntegrationstep() to integrate to specified time in multiple steps,\n    \/\/         including discrete events.\n    {\n        \/\/ Declare integrator with all necessary settings.\n        ReinitializableNumericalIntegratorXdPointer integrator\n                = boost::make_shared< RungeKuttaVariableStepSizeIntegratorXd >(\n                    RungeKuttaCoefficients::get( RungeKuttaCoefficients::rungeKutta87DormandPrince ),\n                    &computeNonAutonomousModelStateDerivative,\n                    matlabForwardIntegrationData( FIRST_ROW, TIME_COLUMN_INDEX ),\n                    ( Eigen::VectorXd( 1 )\n                      << matlabForwardIntegrationData( FIRST_ROW,\n                                                       STATE_COLUMN_INDEX ) ).finished( ),\n                    zeroMinimumStepSize,\n                    infiniteMaximumStepSize,\n                    infiniteRelativeErrorTolerance,\n                    infiniteAbsoluteErrorTolerance );\n\n        performIntegrationStepToSpecifiedTimeWithEvents( matlabDiscreteEventIntegrationData,\n                                                         1.0e-15, 1.0e-12, integrator );\n    }\n}\n\nBOOST_AUTO_TEST_SUITE_END( )\n\n} \/\/ namespace unit_tests\n} \/\/ namespace tudat\n<|endoftext|>"}
{"text":"<commit_before>#ifndef __Data_general__\n#define __Data_general__\n\n#include <iostream>\n#include <sstream>\n#include <fstream>\n#include <vector>\n#include <algorithm>    \/\/ has the for_each\n\nusing namespace std;\n\nenum GenEd {\n\t\/\/ Foundation Studies\n\tFYW,   \/\/ First-Year Writing \n\tWRI,   \/\/ Writing in Context\n\tFOL,   \/\/ Foreign Language\n\tORC,   \/\/ Oral Communication\n\tAQR,   \/\/ Abstract and Quantitative Reasoning\n\tSPM,   \/\/ Studies in Physical Movement\n\n\t\/\/ Core Studies\n\tHWC,   \/\/ Historical Studies in Western Culture\n\tMCD,   \/\/ Multicultural Studies: Domestic\n\tMCG,   \/\/ Multicultural Studies: Global\n\tALSA,  \/\/ Artistic and Literary Studies: Artistic Studies\n\tALSL,  \/\/ Artistic and Literary Studies: Literary Studies\n\tBTSB,  \/\/ Biblical and Theological Studies: Bible\n\tBTST,  \/\/ Biblical and Theological Studies: Theology\n\tSED,   \/\/ Studies in Natural Science: Scientific Exploration and Discovery\n\tIST,   \/\/ Studies in Natural Science: Integrated Scientific Topics\n\tHBS,   \/\/ Studies in Human Behavior and Society\n\n\t\/\/ Integrative Studies\n\tEIN    \/\/ Ethical Issues and Normative Perspectives\n};\n\nenum dept_t {\n\tAFAM,  \/\/0 Africa and the Americas\n\tALSO,  \/\/1 Alternate Language Study Option\n\tAMCON, \/\/2 American Conversation\n\tAMST,  \/\/3 American Studies\n\tARMS,  \/\/4 American Racial and Multicultural Studies\n\tART,   \/\/5 Art and Art History\n\tASIAN, \/\/6 Asian Studies (AS)\n\tBIO,   \/\/7 Biology (BI)\n\tBMOLS, \/\/8 Biomolecular Science\n\tCHEM,  \/\/9 Chemistry (CH)\n\tCHIN,  \/\/10 Chinese\n\tCLASS, \/\/11 Classics\n\tCSCI,  \/\/12 Computer Science\n\tDANCE, \/\/13 Dance\n\tECON,  \/\/14 Economics\n\tEDUC,  \/\/15 Education\n\tENGL,  \/\/16 English\n\tENVST, \/\/17 Environmental Studies (ES)\n\tESAC,  \/\/18 Exercise Science Activity\n\tESTH,  \/\/19 Exercise Science Theory\n\tFAMST, \/\/20 Family Studies\n\tFILM,  \/\/21 Film Studies\n\tFREN,  \/\/22 French\n\tGCON,  \/\/23 Great Conversation\n\tGERM,  \/\/24 German\n\tGREEK, \/\/25 Greek\n\tHIST,  \/\/26 History (HI)\n\tHSPST, \/\/27 Hispanic Studies\n\t\/\/ Note: INTER used to be ID, but there was a system conflict.\n\tIDFA,  \/\/28  \n\tINTD,  \/\/29 Interdepartmental\n\tINTER, \/\/30 Interdisciplinary\n\tIS,    \/\/31 Integrative Studies\n\tJAPAN, \/\/32 Japanese\n\tLATIN, \/\/33 Latin\n\tMATH,  \/\/34 Mathematics\n\tMEDIA, \/\/35 Media Studies\n\tMEDVL, \/\/36 Medieval Studies\n\tMGMT,  \/\/37 Management Studies\n\tMUSIC, \/\/38 Music\n\tMUSPF, \/\/39 Music Performance\n\tNEURO, \/\/40 Neuroscience\n\tNORW,  \/\/41 Norwegian\n\tNURS,  \/\/42 Nursing\n\tPHIL,  \/\/43 Philosphy\n\tPHYS,  \/\/44 Physics\n\tPSCI,  \/\/45 Political Science\n\tPSYCH, \/\/46 Psychology\n\tREL,   \/\/47 Religion (RE)\n\tRUSSN, \/\/48 Russian\n\tSCICN, \/\/49 Science Conversation\n\tSOAN,  \/\/50 Sociology and Anthropology\n\tSPAN,  \/\/51 Spanish\n\tSTAT,  \/\/52 Statistics\n\tSWRK,  \/\/53 Social Work\n\tTHEAT, \/\/54 Theater\n\tWMGST, \/\/55 Women's & Gender Studies\n\tWRIT,  \/\/56 Writing\n\tNONE,\n};\n\nstring tostring(int i);\nint stringToInt(string const& str);\nfloat stringToFloat(string const& str);\n\nvector<string> &split(const string &s, char delim, vector<string> &elems);\nvector<string> split(const string &s, char delim);\n\nstring removeAllQuotes(string s);\nstring removeTrailingSlashes(string s);\nstring removeTrailingText(string s, string toRemove);\nstring removeStartingText(string s, string toRemove);\n\nstring deDoubleString(string s);\nvoid printEntireRecord(vector<string> record);\n\n#endif\n<commit_msg>Remove #include <algorithm> as we didn't use it<commit_after>#ifndef __Data_general__\n#define __Data_general__\n\n#include <iostream>\n#include <sstream>\n#include <fstream>\n#include <vector>\n\nusing namespace std;\n\nenum GenEd {\n\t\/\/ Foundation Studies\n\tFYW,   \/\/ First-Year Writing \n\tWRI,   \/\/ Writing in Context\n\tFOL,   \/\/ Foreign Language\n\tORC,   \/\/ Oral Communication\n\tAQR,   \/\/ Abstract and Quantitative Reasoning\n\tSPM,   \/\/ Studies in Physical Movement\n\n\t\/\/ Core Studies\n\tHWC,   \/\/ Historical Studies in Western Culture\n\tMCD,   \/\/ Multicultural Studies: Domestic\n\tMCG,   \/\/ Multicultural Studies: Global\n\tALSA,  \/\/ Artistic and Literary Studies: Artistic Studies\n\tALSL,  \/\/ Artistic and Literary Studies: Literary Studies\n\tBTSB,  \/\/ Biblical and Theological Studies: Bible\n\tBTST,  \/\/ Biblical and Theological Studies: Theology\n\tSED,   \/\/ Studies in Natural Science: Scientific Exploration and Discovery\n\tIST,   \/\/ Studies in Natural Science: Integrated Scientific Topics\n\tHBS,   \/\/ Studies in Human Behavior and Society\n\n\t\/\/ Integrative Studies\n\tEIN    \/\/ Ethical Issues and Normative Perspectives\n};\n\nenum dept_t {\n\tAFAM,  \/\/0 Africa and the Americas\n\tALSO,  \/\/1 Alternate Language Study Option\n\tAMCON, \/\/2 American Conversation\n\tAMST,  \/\/3 American Studies\n\tARMS,  \/\/4 American Racial and Multicultural Studies\n\tART,   \/\/5 Art and Art History\n\tASIAN, \/\/6 Asian Studies (AS)\n\tBIO,   \/\/7 Biology (BI)\n\tBMOLS, \/\/8 Biomolecular Science\n\tCHEM,  \/\/9 Chemistry (CH)\n\tCHIN,  \/\/10 Chinese\n\tCLASS, \/\/11 Classics\n\tCSCI,  \/\/12 Computer Science\n\tDANCE, \/\/13 Dance\n\tECON,  \/\/14 Economics\n\tEDUC,  \/\/15 Education\n\tENGL,  \/\/16 English\n\tENVST, \/\/17 Environmental Studies (ES)\n\tESAC,  \/\/18 Exercise Science Activity\n\tESTH,  \/\/19 Exercise Science Theory\n\tFAMST, \/\/20 Family Studies\n\tFILM,  \/\/21 Film Studies\n\tFREN,  \/\/22 French\n\tGCON,  \/\/23 Great Conversation\n\tGERM,  \/\/24 German\n\tGREEK, \/\/25 Greek\n\tHIST,  \/\/26 History (HI)\n\tHSPST, \/\/27 Hispanic Studies\n\t\/\/ Note: INTER used to be ID, but there was a system conflict.\n\tIDFA,  \/\/28  \n\tINTD,  \/\/29 Interdepartmental\n\tINTER, \/\/30 Interdisciplinary\n\tIS,    \/\/31 Integrative Studies\n\tJAPAN, \/\/32 Japanese\n\tLATIN, \/\/33 Latin\n\tMATH,  \/\/34 Mathematics\n\tMEDIA, \/\/35 Media Studies\n\tMEDVL, \/\/36 Medieval Studies\n\tMGMT,  \/\/37 Management Studies\n\tMUSIC, \/\/38 Music\n\tMUSPF, \/\/39 Music Performance\n\tNEURO, \/\/40 Neuroscience\n\tNORW,  \/\/41 Norwegian\n\tNURS,  \/\/42 Nursing\n\tPHIL,  \/\/43 Philosphy\n\tPHYS,  \/\/44 Physics\n\tPSCI,  \/\/45 Political Science\n\tPSYCH, \/\/46 Psychology\n\tREL,   \/\/47 Religion (RE)\n\tRUSSN, \/\/48 Russian\n\tSCICN, \/\/49 Science Conversation\n\tSOAN,  \/\/50 Sociology and Anthropology\n\tSPAN,  \/\/51 Spanish\n\tSTAT,  \/\/52 Statistics\n\tSWRK,  \/\/53 Social Work\n\tTHEAT, \/\/54 Theater\n\tWMGST, \/\/55 Women's & Gender Studies\n\tWRIT,  \/\/56 Writing\n\tNONE,\n};\n\nstring tostring(int i);\nint stringToInt(string const& str);\nfloat stringToFloat(string const& str);\n\nvector<string> &split(const string &s, char delim, vector<string> &elems);\nvector<string> split(const string &s, char delim);\n\nstring removeAllQuotes(string s);\nstring removeTrailingSlashes(string s);\nstring removeTrailingText(string s, string toRemove);\nstring removeStartingText(string s, string toRemove);\n\nstring deDoubleString(string s);\nvoid printEntireRecord(vector<string> record);\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"replication\/delete_queue.hpp\"\n#include \"buffer_cache\/buf_lock.hpp\"\n#include \"buffer_cache\/co_functions.hpp\"\n#include \"buffer_cache\/large_buf_lock.hpp\"\n#include \"scoped_malloc.hpp\"\n#include \"store.hpp\"\n\nnamespace replication {\n\nnamespace delete_queue {\n\nconst int TIMESTAMPS_AND_OFFSETS_OFFSET = sizeof(off64_t);\nconst int TIMESTAMPS_AND_OFFSETS_SIZE = sizeof(large_buf_ref) + 3 * sizeof(block_id_t);\n\noff64_t primal_offset(void *root_buffer) {\n    return *reinterpret_cast<off64_t *>(root_buffer);\n}\n\nlarge_buf_ref *timestamps_and_offsets_largebuf(void *root_buffer) {\n    char *p = reinterpret_cast<char *>(root_buffer);\n    return reinterpret_cast<large_buf_ref *>(p + TIMESTAMPS_AND_OFFSETS_OFFSET);\n}\n\nlarge_buf_ref *keys_largebuf(void *root_buffer) {\n    char *p = reinterpret_cast<char *>(root_buffer);\n    return reinterpret_cast<large_buf_ref *>(p + (TIMESTAMPS_AND_OFFSETS_OFFSET + TIMESTAMPS_AND_OFFSETS_SIZE));\n}\n\nint keys_largebuf_ref_size(block_size_t block_size) {\n    return block_size.value() - (TIMESTAMPS_AND_OFFSETS_OFFSET + TIMESTAMPS_AND_OFFSETS_SIZE);\n}\n\n\/\/ TODO: Add test doublechecking that sizeof(t_and_o) == 12.\nstruct t_and_o {\n    repli_timestamp timestamp;\n    off64_t offset;\n} __attribute__((__packed__));\n\n}  \/\/ namespace delete_queue\n\nvoid add_key_to_delete_queue(transaction_t *txn, block_id_t queue_root_id, repli_timestamp timestamp, const store_key_t *key) {\n    \/\/ Beware: Right now, some aspects of correctness depend on the\n    \/\/ fact that we hold the queue_root lock for the entire operation.\n    buf_lock_t queue_root(txn, queue_root_id, rwi_write);\n\n    \/\/ TODO this could be a non-major write?\n    void *queue_root_buf = queue_root.buf()->get_data_major_write();\n\n    off64_t primal_offset = delete_queue::primal_offset(queue_root_buf);\n    large_buf_ref *t_o_ref = delete_queue::timestamps_and_offsets_largebuf(queue_root_buf);\n    large_buf_ref *keys_ref = delete_queue::keys_largebuf(queue_root_buf);\n\n    rassert(t_o_ref->size % sizeof(delete_queue::t_and_o) == 0);\n\n    \/\/ 1. Possibly update the (timestamp, offset) queue.  (This happens at most once per second.)\n    {\n        \/\/ TODO: Why must we allocate large_buf_t's with new?\n        large_buf_lock_t t_o_largebuf(new large_buf_t(txn));\n\n        \/\/ TODO: Allow upgrade of large buf intent.\n        co_acquire_large_value(t_o_largebuf.lv(), t_o_ref, lbref_limit_t(delete_queue::TIMESTAMPS_AND_OFFSETS_SIZE), rwi_write);\n\n        if (t_o_ref->size == 0) {\n            delete_queue::t_and_o tao;\n            tao.timestamp = timestamp;\n            tao.offset = primal_offset + keys_ref->size;\n            int refsize_adjustment_dontcare;\n            t_o_largebuf->append(sizeof(tao), &refsize_adjustment_dontcare);\n            t_o_largebuf->fill_at(0, &tao, sizeof(tao));\n        } else {\n            delete_queue::t_and_o last_tao;\n            t_o_largebuf->read_at(t_o_ref->size - sizeof(last_tao), &last_tao, sizeof(last_tao));\n\n            if (last_tao.timestamp.time > timestamp.time) {\n                logWRN(\"The delete queue is receiving updates out of order (t1 = %d, t2 = %d), or the system clock has been set back!  Bringing up a replica may be excessively inefficient.\\n\", last_tao.timestamp.time, timestamp.time);\n\n                \/\/ Timestamps must be monotonically increasing, so sorry.\n                timestamp = last_tao.timestamp;\n            }\n\n            if (last_tao.timestamp.time != timestamp.time) {\n                delete_queue::t_and_o tao;\n                tao.timestamp = timestamp;\n                tao.offset = primal_offset + keys_ref->size;\n                int refsize_adjustment_dontcare;\n                t_o_largebuf->append(sizeof(tao), &refsize_adjustment_dontcare);\n                t_o_largebuf->fill_at(t_o_ref->size - sizeof(tao), &tao, sizeof(tao));\n            }\n        }\n\n        \/\/ TODO: Remove old items from the front of t_o_largebuf.\n    }\n\n    \/\/ 2. Update the keys list.\n\n    {\n        large_buf_lock_t keys_largebuf(new large_buf_t(txn));\n\n        \/\/ TODO: acquire rhs, or lhs+rhs, something appropriate.\n        co_acquire_large_value(keys_largebuf.lv(), keys_ref, lbref_limit_t(delete_queue::keys_largebuf_ref_size(txn->cache->get_block_size())), rwi_write);\n\n        int refsize_adjustment_dontcare;\n        keys_largebuf->append(1 + key->size, &refsize_adjustment_dontcare);\n        keys_largebuf->fill_at(keys_ref->size - (1 + key->size), key, 1 + key->size);\n    }\n}\n\nvoid dump_keys_from_delete_queue(transaction_t *txn, block_id_t queue_root_id, repli_timestamp begin_timestamp, repli_timestamp end_timestamp, deletion_key_stream_receiver_t *recipient) {\n    \/\/ Beware: Right now, some aspects of correctness depend on the\n    \/\/ fact that we hold the queue_root lock for the entire operation.\n    buf_lock_t queue_root(txn, queue_root_id, rwi_read);\n\n    void *queue_root_buf = const_cast<void *>(queue_root.buf()->get_data_read());\n\n    off64_t primal_offset = delete_queue::primal_offset(queue_root_buf);\n    large_buf_ref *t_o_ref = delete_queue::timestamps_and_offsets_largebuf(queue_root_buf);\n    large_buf_ref *keys_ref = delete_queue::keys_largebuf(queue_root_buf);\n\n    rassert(t_o_ref->size % sizeof(delete_queue::t_and_o) == 0);\n\n    \/\/ TODO: DON'T hold the queue_root lock for the entire operation.  Sheesh.\n\n    int64_t begin_offset = 0, end_offset = 0;\n\n    {\n        large_buf_lock_t t_o_largebuf(new large_buf_t(txn));\n        co_acquire_large_value(t_o_largebuf.lv(), t_o_ref, lbref_limit_t(delete_queue::TIMESTAMPS_AND_OFFSETS_SIZE), rwi_read);\n\n        delete_queue::t_and_o tao;\n        int64_t i = 0, ie = t_o_ref->size;\n        bool begin_found = false, end_found = false;\n        while (i < ie) {\n            t_o_largebuf->read_at(i, &tao, sizeof(tao));\n            if (!begin_found && begin_timestamp.time <= tao.timestamp.time) {\n                begin_offset = tao.offset - primal_offset;\n                begin_found = true;\n            }\n            if (end_timestamp.time <= tao.timestamp.time) {\n                rassert(begin_found);\n                end_offset = tao.offset - primal_offset;\n                end_found = true;\n                break;\n            }\n            i += sizeof(tao);\n        }\n\n        if (!begin_found) {\n            return;\n            \/\/ Nothing to do!\n        }\n\n        if (!end_found) {\n            end_offset = t_o_ref->size;\n        }\n\n        \/\/ So we have a begin_offset and an end_offset;\n    }\n\n    rassert(begin_offset <= end_offset);\n\n    if (begin_offset < end_offset) {\n        large_buf_lock_t keys_largebuf(new large_buf_t(txn));\n\n        \/\/ TODO: acquire subinterval.\n        co_acquire_large_value(keys_largebuf.lv(), keys_ref, lbref_limit_t(delete_queue::keys_largebuf_ref_size(txn->cache->get_block_size())), rwi_read);\n\n        int64_t n = end_offset - begin_offset;\n\n        \/\/ TODO: don't copy needlessly... sheesh.  This is a fake\n        \/\/ implementation, make something that actually streams later.\n        scoped_malloc<byte> buf(n);\n\n        keys_largebuf->fill_at(begin_offset, buf.get(), n);\n\n        \/\/ To force deletion_key_stream_receiver_t to be designed to\n        \/\/ accept multiple calls, we send two calls.\n        int64_t half_n = n \/ 2;\n        recipient->receive_keys(buf.get(), half_n);\n        recipient->receive_keys(buf.get() + half_n, n - half_n);\n    }\n}\n\n\n\n}  \/\/ namespace replication\n<commit_msg>Included logger.hpp for delete_queue.<commit_after>#include \"replication\/delete_queue.hpp\"\n\n#include \"buffer_cache\/buf_lock.hpp\"\n#include \"buffer_cache\/co_functions.hpp\"\n#include \"buffer_cache\/large_buf_lock.hpp\"\n#include \"logger.hpp\"\n#include \"scoped_malloc.hpp\"\n#include \"store.hpp\"\n\nnamespace replication {\n\nnamespace delete_queue {\n\nconst int TIMESTAMPS_AND_OFFSETS_OFFSET = sizeof(off64_t);\nconst int TIMESTAMPS_AND_OFFSETS_SIZE = sizeof(large_buf_ref) + 3 * sizeof(block_id_t);\n\noff64_t primal_offset(void *root_buffer) {\n    return *reinterpret_cast<off64_t *>(root_buffer);\n}\n\nlarge_buf_ref *timestamps_and_offsets_largebuf(void *root_buffer) {\n    char *p = reinterpret_cast<char *>(root_buffer);\n    return reinterpret_cast<large_buf_ref *>(p + TIMESTAMPS_AND_OFFSETS_OFFSET);\n}\n\nlarge_buf_ref *keys_largebuf(void *root_buffer) {\n    char *p = reinterpret_cast<char *>(root_buffer);\n    return reinterpret_cast<large_buf_ref *>(p + (TIMESTAMPS_AND_OFFSETS_OFFSET + TIMESTAMPS_AND_OFFSETS_SIZE));\n}\n\nint keys_largebuf_ref_size(block_size_t block_size) {\n    return block_size.value() - (TIMESTAMPS_AND_OFFSETS_OFFSET + TIMESTAMPS_AND_OFFSETS_SIZE);\n}\n\n\/\/ TODO: Add test doublechecking that sizeof(t_and_o) == 12.\nstruct t_and_o {\n    repli_timestamp timestamp;\n    off64_t offset;\n} __attribute__((__packed__));\n\n}  \/\/ namespace delete_queue\n\nvoid add_key_to_delete_queue(transaction_t *txn, block_id_t queue_root_id, repli_timestamp timestamp, const store_key_t *key) {\n    \/\/ Beware: Right now, some aspects of correctness depend on the\n    \/\/ fact that we hold the queue_root lock for the entire operation.\n    buf_lock_t queue_root(txn, queue_root_id, rwi_write);\n\n    \/\/ TODO this could be a non-major write?\n    void *queue_root_buf = queue_root.buf()->get_data_major_write();\n\n    off64_t primal_offset = delete_queue::primal_offset(queue_root_buf);\n    large_buf_ref *t_o_ref = delete_queue::timestamps_and_offsets_largebuf(queue_root_buf);\n    large_buf_ref *keys_ref = delete_queue::keys_largebuf(queue_root_buf);\n\n    rassert(t_o_ref->size % sizeof(delete_queue::t_and_o) == 0);\n\n    \/\/ 1. Possibly update the (timestamp, offset) queue.  (This happens at most once per second.)\n    {\n        \/\/ TODO: Why must we allocate large_buf_t's with new?\n        large_buf_lock_t t_o_largebuf(new large_buf_t(txn));\n\n        \/\/ TODO: Allow upgrade of large buf intent.\n        co_acquire_large_value(t_o_largebuf.lv(), t_o_ref, lbref_limit_t(delete_queue::TIMESTAMPS_AND_OFFSETS_SIZE), rwi_write);\n\n        if (t_o_ref->size == 0) {\n            delete_queue::t_and_o tao;\n            tao.timestamp = timestamp;\n            tao.offset = primal_offset + keys_ref->size;\n            int refsize_adjustment_dontcare;\n            t_o_largebuf->append(sizeof(tao), &refsize_adjustment_dontcare);\n            t_o_largebuf->fill_at(0, &tao, sizeof(tao));\n        } else {\n            delete_queue::t_and_o last_tao;\n            t_o_largebuf->read_at(t_o_ref->size - sizeof(last_tao), &last_tao, sizeof(last_tao));\n\n            if (last_tao.timestamp.time > timestamp.time) {\n                logWRN(\"The delete queue is receiving updates out of order (t1 = %d, t2 = %d), or the system clock has been set back!  Bringing up a replica may be excessively inefficient.\\n\", last_tao.timestamp.time, timestamp.time);\n\n                \/\/ Timestamps must be monotonically increasing, so sorry.\n                timestamp = last_tao.timestamp;\n            }\n\n            if (last_tao.timestamp.time != timestamp.time) {\n                delete_queue::t_and_o tao;\n                tao.timestamp = timestamp;\n                tao.offset = primal_offset + keys_ref->size;\n                int refsize_adjustment_dontcare;\n                t_o_largebuf->append(sizeof(tao), &refsize_adjustment_dontcare);\n                t_o_largebuf->fill_at(t_o_ref->size - sizeof(tao), &tao, sizeof(tao));\n            }\n        }\n\n        \/\/ TODO: Remove old items from the front of t_o_largebuf.\n    }\n\n    \/\/ 2. Update the keys list.\n\n    {\n        large_buf_lock_t keys_largebuf(new large_buf_t(txn));\n\n        \/\/ TODO: acquire rhs, or lhs+rhs, something appropriate.\n        co_acquire_large_value(keys_largebuf.lv(), keys_ref, lbref_limit_t(delete_queue::keys_largebuf_ref_size(txn->cache->get_block_size())), rwi_write);\n\n        int refsize_adjustment_dontcare;\n        keys_largebuf->append(1 + key->size, &refsize_adjustment_dontcare);\n        keys_largebuf->fill_at(keys_ref->size - (1 + key->size), key, 1 + key->size);\n    }\n}\n\nvoid dump_keys_from_delete_queue(transaction_t *txn, block_id_t queue_root_id, repli_timestamp begin_timestamp, repli_timestamp end_timestamp, deletion_key_stream_receiver_t *recipient) {\n    \/\/ Beware: Right now, some aspects of correctness depend on the\n    \/\/ fact that we hold the queue_root lock for the entire operation.\n    buf_lock_t queue_root(txn, queue_root_id, rwi_read);\n\n    void *queue_root_buf = const_cast<void *>(queue_root.buf()->get_data_read());\n\n    off64_t primal_offset = delete_queue::primal_offset(queue_root_buf);\n    large_buf_ref *t_o_ref = delete_queue::timestamps_and_offsets_largebuf(queue_root_buf);\n    large_buf_ref *keys_ref = delete_queue::keys_largebuf(queue_root_buf);\n\n    rassert(t_o_ref->size % sizeof(delete_queue::t_and_o) == 0);\n\n    \/\/ TODO: DON'T hold the queue_root lock for the entire operation.  Sheesh.\n\n    int64_t begin_offset = 0, end_offset = 0;\n\n    {\n        large_buf_lock_t t_o_largebuf(new large_buf_t(txn));\n        co_acquire_large_value(t_o_largebuf.lv(), t_o_ref, lbref_limit_t(delete_queue::TIMESTAMPS_AND_OFFSETS_SIZE), rwi_read);\n\n        delete_queue::t_and_o tao;\n        int64_t i = 0, ie = t_o_ref->size;\n        bool begin_found = false, end_found = false;\n        while (i < ie) {\n            t_o_largebuf->read_at(i, &tao, sizeof(tao));\n            if (!begin_found && begin_timestamp.time <= tao.timestamp.time) {\n                begin_offset = tao.offset - primal_offset;\n                begin_found = true;\n            }\n            if (end_timestamp.time <= tao.timestamp.time) {\n                rassert(begin_found);\n                end_offset = tao.offset - primal_offset;\n                end_found = true;\n                break;\n            }\n            i += sizeof(tao);\n        }\n\n        if (!begin_found) {\n            return;\n            \/\/ Nothing to do!\n        }\n\n        if (!end_found) {\n            end_offset = t_o_ref->size;\n        }\n\n        \/\/ So we have a begin_offset and an end_offset;\n    }\n\n    rassert(begin_offset <= end_offset);\n\n    if (begin_offset < end_offset) {\n        large_buf_lock_t keys_largebuf(new large_buf_t(txn));\n\n        \/\/ TODO: acquire subinterval.\n        co_acquire_large_value(keys_largebuf.lv(), keys_ref, lbref_limit_t(delete_queue::keys_largebuf_ref_size(txn->cache->get_block_size())), rwi_read);\n\n        int64_t n = end_offset - begin_offset;\n\n        \/\/ TODO: don't copy needlessly... sheesh.  This is a fake\n        \/\/ implementation, make something that actually streams later.\n        scoped_malloc<byte> buf(n);\n\n        keys_largebuf->fill_at(begin_offset, buf.get(), n);\n\n        \/\/ To force deletion_key_stream_receiver_t to be designed to\n        \/\/ accept multiple calls, we send two calls.\n        int64_t half_n = n \/ 2;\n        recipient->receive_keys(buf.get(), half_n);\n        recipient->receive_keys(buf.get() + half_n, n - half_n);\n    }\n}\n\n\n\n}  \/\/ namespace replication\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 \"remoting\/client\/mouse_input_filter.h\"\n#include \"remoting\/proto\/event.pb.h\"\n#include \"testing\/gmock\/include\/gmock\/gmock.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n#include \"third_party\/skia\/include\/core\/SkPoint.h\"\n\nusing ::testing::_;\nusing ::testing::InSequence;\n\nnamespace remoting {\n\nMATCHER_P2(EqualsMouseMoveEvent, x, y, \"\") {\n  return arg.x() == x && arg.y() == y;\n}\n\nclass MockInputStub : public protocol::InputStub {\n public:\n  MockInputStub() {}\n\n  MOCK_METHOD1(InjectKeyEvent, void(const protocol::KeyEvent&));\n  MOCK_METHOD1(InjectMouseEvent, void(const protocol::MouseEvent&));\n private:\n  DISALLOW_COPY_AND_ASSIGN(MockInputStub);\n};\n\nstatic protocol::MouseEvent mouseMoveEvent(int x, int y) {\n  protocol::MouseEvent event;\n  event.set_x(x);\n  event.set_y(y);\n  return event;\n}\n\nstatic void injectTestSequence(protocol::InputStub* input_stub) {\n  static const SkIPoint input_sequence[] = {\n    {-5, 10}, {0, 10}, {-1, 10}, {15, 40}, {15, 45}, {15, 39}, {15, 25}\n  };\n  for (unsigned int i=0; i<arraysize(input_sequence); ++i) {\n    const SkIPoint& point = input_sequence[i];\n    input_stub->InjectMouseEvent(mouseMoveEvent(point.x(), point.y()));\n  }\n  for (unsigned int i=0; i<arraysize(input_sequence); ++i) {\n    const SkIPoint& point = input_sequence[i];\n    input_stub->InjectMouseEvent(mouseMoveEvent(point.y(), point.x()));\n  }\n}\n\n\/\/ Verify that no events get through if we don't set either dimensions.\nTEST(MouseInputFilterTest, BothDimensionsZero) {\n  MockInputStub mock_stub;\n  MouseInputFilter mouse_filter(&mock_stub);\n\n  EXPECT_CALL(mock_stub, InjectMouseEvent(_))\n        .Times(0);\n\n  injectTestSequence(&mouse_filter);\n}\n\n\/\/ Verify that no events get through if there's no input size.\nTEST(MouseInputFilterTest, InputDimensionsZero) {\n  MockInputStub mock_stub;\n  MouseInputFilter mouse_filter(&mock_stub);\n  mouse_filter.set_output_size(SkISize::Make(50,50));\n\n  EXPECT_CALL(mock_stub, InjectMouseEvent(_))\n      .Times(0);\n\n  injectTestSequence(&mouse_filter);\n}\n\n\/\/ Verify that no events get through if there's no output size.\nTEST(MouseInputFilterTest, OutputDimensionsZero) {\n  MockInputStub mock_stub;\n  MouseInputFilter mouse_filter(&mock_stub);\n  mouse_filter.set_input_size(SkISize::Make(50,50));\n\n  EXPECT_CALL(mock_stub, InjectMouseEvent(_))\n      .Times(0);\n\n  injectTestSequence(&mouse_filter);\n}\n\n\/\/ Verify that all events get through, clamped to the output.\nTEST(MouseInputFilterTest, NoScalingOrClipping) {\n  MockInputStub mock_stub;\n  MouseInputFilter mouse_filter(&mock_stub);\n  mouse_filter.set_output_size(SkISize::Make(40,40));\n  mouse_filter.set_input_size(SkISize::Make(40,40));\n\n  {\n    InSequence s;\n\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(0, 10))).\n        Times(3);\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(15, 39))).\n        Times(3);\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(15, 25))).\n        Times(1);\n\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(10, 0))).\n        Times(3);\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(39, 15))).\n        Times(3);\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(25, 15))).\n        Times(1);\n  }\n\n  injectTestSequence(&mouse_filter);\n}\n\n\/\/ Verify that we can up-scale with clamping.\nTEST(MouseInputFilterTest, UpScalingAndClamping) {\n  MockInputStub mock_stub;\n  MouseInputFilter mouse_filter(&mock_stub);\n  mouse_filter.set_output_size(SkISize::Make(80,80));\n  mouse_filter.set_input_size(SkISize::Make(40,40));\n\n  {\n    InSequence s;\n\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(0, 20))).\n        Times(3);\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(30, 79))).\n        Times(3);\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(30, 51))).\n        Times(1);\n\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(20, 0))).\n        Times(3);\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(79, 30))).\n        Times(3);\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(51, 30))).\n        Times(1);\n  }\n\n  injectTestSequence(&mouse_filter);\n}\n\n\/\/ Verify that we can down-scale with clamping.\nTEST(MouseInputFilterTest, DownScalingAndClamping) {\n  MockInputStub mock_stub;\n  MouseInputFilter mouse_filter(&mock_stub);\n  mouse_filter.set_output_size(SkISize::Make(30,30));\n  mouse_filter.set_input_size(SkISize::Make(40,40));\n\n  {\n    InSequence s;\n\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(0, 7))).\n        Times(3);\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(11, 29))).\n        Times(3);\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(11, 19))).\n        Times(1);\n\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(7, 0))).\n        Times(3);\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(29, 11))).\n        Times(3);\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(19, 11))).\n        Times(1);\n\n  }\n\n  injectTestSequence(&mouse_filter);\n}\n\n}  \/\/ namespace remoting\n<commit_msg>Fix some style nits in the MouseInputFilter unit-tests.<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 \"remoting\/client\/mouse_input_filter.h\"\n\n#include \"remoting\/proto\/event.pb.h\"\n#include \"testing\/gmock\/include\/gmock\/gmock.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n#include \"third_party\/skia\/include\/core\/SkPoint.h\"\n\nusing ::testing::_;\nusing ::testing::InSequence;\n\nnamespace remoting {\n\nMATCHER_P2(EqualsMouseMoveEvent, x, y, \"\") {\n  return arg.x() == x && arg.y() == y;\n}\n\nclass MockInputStub : public protocol::InputStub {\n public:\n  MockInputStub() {}\n\n  MOCK_METHOD1(InjectKeyEvent, void(const protocol::KeyEvent&));\n  MOCK_METHOD1(InjectMouseEvent, void(const protocol::MouseEvent&));\n private:\n  DISALLOW_COPY_AND_ASSIGN(MockInputStub);\n};\n\nstatic protocol::MouseEvent MouseMoveEvent(int x, int y) {\n  protocol::MouseEvent event;\n  event.set_x(x);\n  event.set_y(y);\n  return event;\n}\n\nstatic void InjectTestSequence(protocol::InputStub* input_stub) {\n  static const SkIPoint input_sequence[] = {\n    {-5, 10}, {0, 10}, {-1, 10}, {15, 40}, {15, 45}, {15, 39}, {15, 25}\n  };\n  for (unsigned int i=0; i<arraysize(input_sequence); ++i) {\n    const SkIPoint& point = input_sequence[i];\n    input_stub->InjectMouseEvent(MouseMoveEvent(point.x(), point.y()));\n  }\n  for (unsigned int i=0; i<arraysize(input_sequence); ++i) {\n    const SkIPoint& point = input_sequence[i];\n    input_stub->InjectMouseEvent(MouseMoveEvent(point.y(), point.x()));\n  }\n}\n\n\/\/ Verify that no events get through if we don't set either dimensions.\nTEST(MouseInputFilterTest, BothDimensionsZero) {\n  MockInputStub mock_stub;\n  MouseInputFilter mouse_filter(&mock_stub);\n\n  EXPECT_CALL(mock_stub, InjectMouseEvent(_))\n        .Times(0);\n\n  InjectTestSequence(&mouse_filter);\n}\n\n\/\/ Verify that no events get through if there's no input size.\nTEST(MouseInputFilterTest, InputDimensionsZero) {\n  MockInputStub mock_stub;\n  MouseInputFilter mouse_filter(&mock_stub);\n  mouse_filter.set_output_size(SkISize::Make(50,50));\n\n  EXPECT_CALL(mock_stub, InjectMouseEvent(_))\n      .Times(0);\n\n  InjectTestSequence(&mouse_filter);\n}\n\n\/\/ Verify that no events get through if there's no output size.\nTEST(MouseInputFilterTest, OutputDimensionsZero) {\n  MockInputStub mock_stub;\n  MouseInputFilter mouse_filter(&mock_stub);\n  mouse_filter.set_input_size(SkISize::Make(50,50));\n\n  EXPECT_CALL(mock_stub, InjectMouseEvent(_))\n      .Times(0);\n\n  InjectTestSequence(&mouse_filter);\n}\n\n\/\/ Verify that all events get through, clamped to the output.\nTEST(MouseInputFilterTest, NoScalingOrClipping) {\n  MockInputStub mock_stub;\n  MouseInputFilter mouse_filter(&mock_stub);\n  mouse_filter.set_output_size(SkISize::Make(40,40));\n  mouse_filter.set_input_size(SkISize::Make(40,40));\n\n  {\n    InSequence s;\n\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(0, 10))).\n        Times(3);\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(15, 39))).\n        Times(3);\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(15, 25))).\n        Times(1);\n\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(10, 0))).\n        Times(3);\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(39, 15))).\n        Times(3);\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(25, 15))).\n        Times(1);\n  }\n\n  InjectTestSequence(&mouse_filter);\n}\n\n\/\/ Verify that we can up-scale with clamping.\nTEST(MouseInputFilterTest, UpScalingAndClamping) {\n  MockInputStub mock_stub;\n  MouseInputFilter mouse_filter(&mock_stub);\n  mouse_filter.set_output_size(SkISize::Make(80,80));\n  mouse_filter.set_input_size(SkISize::Make(40,40));\n\n  {\n    InSequence s;\n\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(0, 20))).\n        Times(3);\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(30, 79))).\n        Times(3);\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(30, 51))).\n        Times(1);\n\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(20, 0))).\n        Times(3);\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(79, 30))).\n        Times(3);\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(51, 30))).\n        Times(1);\n  }\n\n  InjectTestSequence(&mouse_filter);\n}\n\n\/\/ Verify that we can down-scale with clamping.\nTEST(MouseInputFilterTest, DownScalingAndClamping) {\n  MockInputStub mock_stub;\n  MouseInputFilter mouse_filter(&mock_stub);\n  mouse_filter.set_output_size(SkISize::Make(30,30));\n  mouse_filter.set_input_size(SkISize::Make(40,40));\n\n  {\n    InSequence s;\n\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(0, 7))).\n        Times(3);\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(11, 29))).\n        Times(3);\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(11, 19))).\n        Times(1);\n\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(7, 0))).\n        Times(3);\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(29, 11))).\n        Times(3);\n    EXPECT_CALL(mock_stub, InjectMouseEvent(EqualsMouseMoveEvent(19, 11))).\n        Times(1);\n\n  }\n\n  InjectTestSequence(&mouse_filter);\n}\n\n}  \/\/ namespace remoting\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 \"qpulsehelpers.h\"\n\nQT_BEGIN_NAMESPACE\n\nnamespace QPulseAudioInternal\n{\npa_sample_spec audioFormatToSampleSpec(const QAudioFormat &format)\n{\n    pa_sample_spec  spec;\n\n    spec.rate = format.frequency();\n    spec.channels = format.channels();\n\n    if (format.sampleSize() == 8) {\n        spec.format = PA_SAMPLE_U8;\n    } else if (format.sampleSize() == 16) {\n        switch (format.byteOrder()) {\n        case QAudioFormat::BigEndian: spec.format = PA_SAMPLE_S16BE; break;\n        case QAudioFormat::LittleEndian: spec.format = PA_SAMPLE_S16LE; break;\n        }\n    } else if (format.sampleSize() == 24) {\n        switch (format.byteOrder()) {\n        case QAudioFormat::BigEndian: spec.format = PA_SAMPLE_S24BE; break;\n        case QAudioFormat::LittleEndian: spec.format = PA_SAMPLE_S24LE; break;\n        }\n    } else if (format.sampleSize() == 32) {\n        switch (format.byteOrder()) {\n        case QAudioFormat::BigEndian: spec.format = PA_SAMPLE_S32BE; break;\n        case QAudioFormat::LittleEndian: spec.format = PA_SAMPLE_S32LE; break;\n        }\n    }\n\n    return spec;\n}\n\nQString stateToQString(pa_stream_state_t state)\n{\n    switch (state)\n    {\n    case PA_STREAM_UNCONNECTED: return \"Unconnected\";\n    case PA_STREAM_CREATING:    return \"Creating\";\n    case PA_STREAM_READY:       return \"Ready\";\n    case PA_STREAM_FAILED:      return \"Failed\";\n    case PA_STREAM_TERMINATED:  return \"Terminated\";\n    }\n\n    return QString(\"Unknown state: %0\").arg(state);\n}\n\nQString sampleFormatToQString(pa_sample_format format)\n{\n    switch (format)\n    {\n    case PA_SAMPLE_U8:          return \"Unsigned 8 Bit PCM.\";\n    case PA_SAMPLE_ALAW:        return \"8 Bit a-Law \";\n    case PA_SAMPLE_ULAW:        return \"8 Bit mu-Law\";\n    case PA_SAMPLE_S16LE:       return \"Signed 16 Bit PCM, little endian (PC).\";\n    case PA_SAMPLE_S16BE:       return \"Signed 16 Bit PCM, big endian.\";\n    case PA_SAMPLE_FLOAT32LE:   return \"32 Bit IEEE floating point, little endian (PC), range -1.0 to 1.0\";\n    case PA_SAMPLE_FLOAT32BE:   return \"32 Bit IEEE floating point, big endian, range -1.0 to 1.0\";\n    case PA_SAMPLE_S32LE:       return \"Signed 32 Bit PCM, little endian (PC).\";\n    case PA_SAMPLE_S32BE:       return \"Signed 32 Bit PCM, big endian.\";\n    case PA_SAMPLE_S24LE:       return \"Signed 24 Bit PCM packed, little endian (PC).\";\n    case PA_SAMPLE_S24BE:       return \"Signed 24 Bit PCM packed, big endian.\";\n    case PA_SAMPLE_S24_32LE:    return \"Signed 24 Bit PCM in LSB of 32 Bit words, little endian (PC).\";\n    case PA_SAMPLE_S24_32BE:    return \"Signed 24 Bit PCM in LSB of 32 Bit words, big endian.\";\n    case PA_SAMPLE_MAX:         return \"Upper limit of valid sample types.\";\n    case PA_SAMPLE_INVALID:     return \"Invalid sample format\";\n    }\n\n    return QString(\"Invalid value: %0\").arg(format);\n}\n\nQString stateToQString(pa_context_state_t state)\n{\n    switch (state)\n    {\n    case PA_CONTEXT_UNCONNECTED:  return \"Unconnected\";\n    case PA_CONTEXT_CONNECTING:   return \"Connecting\";\n    case PA_CONTEXT_AUTHORIZING:  return \"Authorizing\";\n    case PA_CONTEXT_SETTING_NAME: return \"Setting Name\";\n    case PA_CONTEXT_READY:        return \"Ready\";\n    case PA_CONTEXT_FAILED:       return \"Failed\";\n    case PA_CONTEXT_TERMINATED:   return \"Terminated\";\n    }\n\n    return QString(\"Unknown state: %0\").arg(state);\n}\n\n}\n\nQT_END_NAMESPACE\n<commit_msg>QPulseAudioInterna; Only enabled conversion functions in debug mode.<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 \"qpulsehelpers.h\"\n\nQT_BEGIN_NAMESPACE\n\nnamespace QPulseAudioInternal\n{\npa_sample_spec audioFormatToSampleSpec(const QAudioFormat &format)\n{\n    pa_sample_spec  spec;\n\n    spec.rate = format.frequency();\n    spec.channels = format.channels();\n\n    if (format.sampleSize() == 8) {\n        spec.format = PA_SAMPLE_U8;\n    } else if (format.sampleSize() == 16) {\n        switch (format.byteOrder()) {\n        case QAudioFormat::BigEndian: spec.format = PA_SAMPLE_S16BE; break;\n        case QAudioFormat::LittleEndian: spec.format = PA_SAMPLE_S16LE; break;\n        }\n    } else if (format.sampleSize() == 24) {\n        switch (format.byteOrder()) {\n        case QAudioFormat::BigEndian: spec.format = PA_SAMPLE_S24BE; break;\n        case QAudioFormat::LittleEndian: spec.format = PA_SAMPLE_S24LE; break;\n        }\n    } else if (format.sampleSize() == 32) {\n        switch (format.byteOrder()) {\n        case QAudioFormat::BigEndian: spec.format = PA_SAMPLE_S32BE; break;\n        case QAudioFormat::LittleEndian: spec.format = PA_SAMPLE_S32LE; break;\n        }\n    }\n\n    return spec;\n}\n\n#ifdef DEBUG_PULSE\nQString stateToQString(pa_stream_state_t state)\n{\n    switch (state)\n    {\n    case PA_STREAM_UNCONNECTED: return \"Unconnected\";\n    case PA_STREAM_CREATING:    return \"Creating\";\n    case PA_STREAM_READY:       return \"Ready\";\n    case PA_STREAM_FAILED:      return \"Failed\";\n    case PA_STREAM_TERMINATED:  return \"Terminated\";\n    }\n\n    return QString(\"Unknown state: %0\").arg(state);\n}\n\nQString sampleFormatToQString(pa_sample_format format)\n{\n    switch (format)\n    {\n    case PA_SAMPLE_U8:          return \"Unsigned 8 Bit PCM.\";\n    case PA_SAMPLE_ALAW:        return \"8 Bit a-Law \";\n    case PA_SAMPLE_ULAW:        return \"8 Bit mu-Law\";\n    case PA_SAMPLE_S16LE:       return \"Signed 16 Bit PCM, little endian (PC).\";\n    case PA_SAMPLE_S16BE:       return \"Signed 16 Bit PCM, big endian.\";\n    case PA_SAMPLE_FLOAT32LE:   return \"32 Bit IEEE floating point, little endian (PC), range -1.0 to 1.0\";\n    case PA_SAMPLE_FLOAT32BE:   return \"32 Bit IEEE floating point, big endian, range -1.0 to 1.0\";\n    case PA_SAMPLE_S32LE:       return \"Signed 32 Bit PCM, little endian (PC).\";\n    case PA_SAMPLE_S32BE:       return \"Signed 32 Bit PCM, big endian.\";\n    case PA_SAMPLE_S24LE:       return \"Signed 24 Bit PCM packed, little endian (PC).\";\n    case PA_SAMPLE_S24BE:       return \"Signed 24 Bit PCM packed, big endian.\";\n    case PA_SAMPLE_S24_32LE:    return \"Signed 24 Bit PCM in LSB of 32 Bit words, little endian (PC).\";\n    case PA_SAMPLE_S24_32BE:    return \"Signed 24 Bit PCM in LSB of 32 Bit words, big endian.\";\n    case PA_SAMPLE_MAX:         return \"Upper limit of valid sample types.\";\n    case PA_SAMPLE_INVALID:     return \"Invalid sample format\";\n    }\n\n    return QString(\"Invalid value: %0\").arg(format);\n}\n\nQString stateToQString(pa_context_state_t state)\n{\n    switch (state)\n    {\n    case PA_CONTEXT_UNCONNECTED:  return \"Unconnected\";\n    case PA_CONTEXT_CONNECTING:   return \"Connecting\";\n    case PA_CONTEXT_AUTHORIZING:  return \"Authorizing\";\n    case PA_CONTEXT_SETTING_NAME: return \"Setting Name\";\n    case PA_CONTEXT_READY:        return \"Ready\";\n    case PA_CONTEXT_FAILED:       return \"Failed\";\n    case PA_CONTEXT_TERMINATED:   return \"Terminated\";\n    }\n\n    return QString(\"Unknown state: %0\").arg(state);\n}\n#endif\n\n}\n\nQT_END_NAMESPACE\n<|endoftext|>"}
{"text":"<commit_before>\/** @file\n    @brief Implementation\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 \"VideoIMUFusionDevice.h\"\n#include <osvr\/AnalysisPluginKit\/AnalysisPluginKitC.h>\n#include <osvr\/ClientKit\/InterfaceCallbackC.h>\n#include <osvr\/ClientKit\/InterfaceStateC.h>\n#include <osvr\/Util\/EigenInterop.h>\n#include <osvr\/Util\/Verbosity.h>\n\n\/\/ Generated JSON header file\n#include \"org_osvr_filter_videoimufusion_json.h\"\n\n\/\/ Library\/third-party includes\n\/\/ - none\n\n\/\/ Standard includes\n#include <iostream>\n#include <cmath>\n\nstatic const OSVR_ChannelCount FUSED_SENSOR_ID = 0;\nstatic const OSVR_ChannelCount TRANSFORMED_VIDEO_SENSOR_ID = 1;\n\nVideoIMUFusionDevice::VideoIMUFusionDevice(OSVR_PluginRegContext ctx,\n                                           std::string const &name,\n                                           std::string const &imuPath,\n                                           std::string const &videoPath,\n                                           VideoIMUFusionParams const &params)\n    : m_fusion(params) {\n    \/\/\/ Create the initialization options\n    OSVR_DeviceInitOptions opts = osvrDeviceCreateInitOptions(ctx);\n\n    osvrDeviceTrackerConfigure(opts, &m_trackerOut);\n\n    \/\/\/ Create the device token with the options\n    OSVR_DeviceToken dev;\n    if (OSVR_RETURN_FAILURE ==\n        osvrAnalysisSyncInit(ctx, name.c_str(), opts, &dev, &m_clientCtx)) {\n        throw std::runtime_error(\"Could not initialize analysis plugin!\");\n    }\n    m_dev = osvr::pluginkit::DeviceToken(dev);\n\n    \/\/\/ Send JSON descriptor\n    m_dev.sendJsonDescriptor(org_osvr_filter_videoimufusion_json);\n\n    \/\/\/ Register update callback\n    m_dev.registerUpdateCallback(this);\n\n    \/\/\/ Set up to receive our input.\n    osvrClientGetInterface(m_clientCtx, imuPath.c_str(), &m_imu);\n    osvrRegisterOrientationCallback(\n        m_imu, &VideoIMUFusionDevice::s_handleIMUData, this);\n    osvrRegisterAngularVelocityCallback(\n        m_imu, &VideoIMUFusionDevice::s_handleIMUVelocity, this);\n\n    osvrClientGetInterface(m_clientCtx, videoPath.c_str(), &m_videoTracker);\n\n    osvrRegisterPoseCallback(\n        m_videoTracker, &VideoIMUFusionDevice::s_handleVideoTrackerData, this);\n}\n\nVideoIMUFusionDevice::~VideoIMUFusionDevice() {\n    \/\/\/ free the interfaces before the pointed-to function objects\n    \/\/\/ disappear.\n    if (m_imu) {\n        osvrClientFreeInterface(m_clientCtx, m_imu);\n        m_imu = nullptr;\n    }\n    if (m_videoTracker) {\n        osvrClientFreeInterface(m_clientCtx, m_videoTracker);\n        m_imu = nullptr;\n    }\n}\n\nvoid VideoIMUFusionDevice::s_handleIMUData(\n    void *userdata, const OSVR_TimeValue *timestamp,\n    const OSVR_OrientationReport *report) {\n    static_cast<VideoIMUFusionDevice *>(userdata)\n        ->handleIMUData(*timestamp, *report);\n}\nvoid VideoIMUFusionDevice::s_handleIMUVelocity(\n    void *userdata, const OSVR_TimeValue *timestamp,\n    const OSVR_AngularVelocityReport *report) {\n    static_cast<VideoIMUFusionDevice *>(userdata)\n        ->handleIMUVelocity(*timestamp, *report);\n}\nvoid VideoIMUFusionDevice::s_handleVideoTrackerData(\n    void *userdata, const OSVR_TimeValue *timestamp,\n    const OSVR_PoseReport *report) {\n    static_cast<VideoIMUFusionDevice *>(userdata)\n        ->handleVideoTrackerData(*timestamp, *report);\n}\n\nvoid VideoIMUFusionDevice::handleIMUData(const OSVR_TimeValue &timestamp,\n                                         const OSVR_OrientationReport &report) {\n    m_fusion.handleIMUData(timestamp, report);\n    if (m_fusion.running()) {\n        sendMainPoseReport();\n    }\n}\nvoid VideoIMUFusionDevice::handleIMUVelocity(\n    const OSVR_TimeValue &timestamp, const OSVR_AngularVelocityReport &report) {\n\n    using namespace osvr::util::eigen_interop;\n    Eigen::Quaterniond q = map(report.state.incrementalRotation);\n    Eigen::Vector3d rot;\n    if (q.w() >= 1.) {\n        rot = Eigen::Vector3d::Zero();\n    } else {\n        auto magnitude = q.vec().blueNorm();\n        rot = (q.vec() \/ magnitude * (2. * std::atan2(magnitude, q.w()))) \/\n              report.state.dt;\n        \/\/\/ @todo without transformations being applied to vel quats, this\n        \/\/\/ is needed.\n        \/\/ std::swap(rot[0], rot[1]);\n        rot[1] *= -1.;\n        rot[2] *= -1.;\n    }\n\n    m_fusion.handleIMUVelocity(timestamp, rot);\n#if 0\n    if (m_fusion.running()) {\n        sendMainPoseReport();\n    }\n#endif\n}\nvoid VideoIMUFusionDevice::handleVideoTrackerData(\n    const OSVR_TimeValue &timestamp, const OSVR_PoseReport &report) {\n    if (!m_fusion.running()) {\n        auto ts = OSVR_TimeValue{};\n        auto oriState = OSVR_OrientationState{};\n        auto ret = osvrGetOrientationState(m_imu, &ts, &oriState);\n        if (ret != OSVR_RETURN_SUCCESS) {\n            std::cout << \"Got a video report before an IMU report, ignoring it\"\n                      << std::endl;\n            return;\n        }\n        m_fusion.handleVideoTrackerDataDuringStartup(timestamp, report,\n                                                     oriState);\n        return;\n    }\n    m_fusion.handleVideoTrackerDataWhileRunning(timestamp, report);\n    sendMainPoseReport();\n    osvrDeviceTrackerSendPoseTimestamped(\n        m_dev, m_trackerOut, &m_fusion.getLatestReorientedVideoPose(),\n        TRANSFORMED_VIDEO_SENSOR_ID, &timestamp);\n}\n\nvoid VideoIMUFusionDevice::sendMainPoseReport() {\n    osvrDeviceTrackerSendPoseTimestamped(\n        m_dev, m_trackerOut, &m_fusion.getLatestFusedPose(), FUSED_SENSOR_ID,\n        &m_fusion.getLatestFusedTime());\n}\n<commit_msg>report after velocity update.<commit_after>\/** @file\n    @brief Implementation\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 \"VideoIMUFusionDevice.h\"\n#include <osvr\/AnalysisPluginKit\/AnalysisPluginKitC.h>\n#include <osvr\/ClientKit\/InterfaceCallbackC.h>\n#include <osvr\/ClientKit\/InterfaceStateC.h>\n#include <osvr\/Util\/EigenInterop.h>\n#include <osvr\/Util\/Verbosity.h>\n\n\/\/ Generated JSON header file\n#include \"org_osvr_filter_videoimufusion_json.h\"\n\n\/\/ Library\/third-party includes\n\/\/ - none\n\n\/\/ Standard includes\n#include <iostream>\n#include <cmath>\n\nstatic const OSVR_ChannelCount FUSED_SENSOR_ID = 0;\nstatic const OSVR_ChannelCount TRANSFORMED_VIDEO_SENSOR_ID = 1;\n\nVideoIMUFusionDevice::VideoIMUFusionDevice(OSVR_PluginRegContext ctx,\n                                           std::string const &name,\n                                           std::string const &imuPath,\n                                           std::string const &videoPath,\n                                           VideoIMUFusionParams const &params)\n    : m_fusion(params) {\n    \/\/\/ Create the initialization options\n    OSVR_DeviceInitOptions opts = osvrDeviceCreateInitOptions(ctx);\n\n    osvrDeviceTrackerConfigure(opts, &m_trackerOut);\n\n    \/\/\/ Create the device token with the options\n    OSVR_DeviceToken dev;\n    if (OSVR_RETURN_FAILURE ==\n        osvrAnalysisSyncInit(ctx, name.c_str(), opts, &dev, &m_clientCtx)) {\n        throw std::runtime_error(\"Could not initialize analysis plugin!\");\n    }\n    m_dev = osvr::pluginkit::DeviceToken(dev);\n\n    \/\/\/ Send JSON descriptor\n    m_dev.sendJsonDescriptor(org_osvr_filter_videoimufusion_json);\n\n    \/\/\/ Register update callback\n    m_dev.registerUpdateCallback(this);\n\n    \/\/\/ Set up to receive our input.\n    osvrClientGetInterface(m_clientCtx, imuPath.c_str(), &m_imu);\n    osvrRegisterOrientationCallback(\n        m_imu, &VideoIMUFusionDevice::s_handleIMUData, this);\n    osvrRegisterAngularVelocityCallback(\n        m_imu, &VideoIMUFusionDevice::s_handleIMUVelocity, this);\n\n    osvrClientGetInterface(m_clientCtx, videoPath.c_str(), &m_videoTracker);\n\n    osvrRegisterPoseCallback(\n        m_videoTracker, &VideoIMUFusionDevice::s_handleVideoTrackerData, this);\n}\n\nVideoIMUFusionDevice::~VideoIMUFusionDevice() {\n    \/\/\/ free the interfaces before the pointed-to function objects\n    \/\/\/ disappear.\n    if (m_imu) {\n        osvrClientFreeInterface(m_clientCtx, m_imu);\n        m_imu = nullptr;\n    }\n    if (m_videoTracker) {\n        osvrClientFreeInterface(m_clientCtx, m_videoTracker);\n        m_imu = nullptr;\n    }\n}\n\nvoid VideoIMUFusionDevice::s_handleIMUData(\n    void *userdata, const OSVR_TimeValue *timestamp,\n    const OSVR_OrientationReport *report) {\n    static_cast<VideoIMUFusionDevice *>(userdata)\n        ->handleIMUData(*timestamp, *report);\n}\nvoid VideoIMUFusionDevice::s_handleIMUVelocity(\n    void *userdata, const OSVR_TimeValue *timestamp,\n    const OSVR_AngularVelocityReport *report) {\n    static_cast<VideoIMUFusionDevice *>(userdata)\n        ->handleIMUVelocity(*timestamp, *report);\n}\nvoid VideoIMUFusionDevice::s_handleVideoTrackerData(\n    void *userdata, const OSVR_TimeValue *timestamp,\n    const OSVR_PoseReport *report) {\n    static_cast<VideoIMUFusionDevice *>(userdata)\n        ->handleVideoTrackerData(*timestamp, *report);\n}\n\nvoid VideoIMUFusionDevice::handleIMUData(const OSVR_TimeValue &timestamp,\n                                         const OSVR_OrientationReport &report) {\n    m_fusion.handleIMUData(timestamp, report);\n    if (m_fusion.running()) {\n        sendMainPoseReport();\n    }\n}\nvoid VideoIMUFusionDevice::handleIMUVelocity(\n    const OSVR_TimeValue &timestamp, const OSVR_AngularVelocityReport &report) {\n\n    using namespace osvr::util::eigen_interop;\n    Eigen::Quaterniond q = map(report.state.incrementalRotation);\n    Eigen::Vector3d rot;\n    if (q.w() >= 1.) {\n        rot = Eigen::Vector3d::Zero();\n    } else {\n        auto magnitude = q.vec().blueNorm();\n        rot = (q.vec() \/ magnitude * (2. * std::atan2(magnitude, q.w()))) \/\n              report.state.dt;\n        \/\/\/ @todo without transformations being applied to vel quats, this\n        \/\/\/ is needed.\n        \/\/ std::swap(rot[0], rot[1]);\n        rot[1] *= -1.;\n        rot[2] *= -1.;\n    }\n\n    m_fusion.handleIMUVelocity(timestamp, rot);\n    if (m_fusion.running()) {\n        sendMainPoseReport();\n    }\n}\nvoid VideoIMUFusionDevice::handleVideoTrackerData(\n    const OSVR_TimeValue &timestamp, const OSVR_PoseReport &report) {\n    if (!m_fusion.running()) {\n        auto ts = OSVR_TimeValue{};\n        auto oriState = OSVR_OrientationState{};\n        auto ret = osvrGetOrientationState(m_imu, &ts, &oriState);\n        if (ret != OSVR_RETURN_SUCCESS) {\n            std::cout << \"Got a video report before an IMU report, ignoring it\"\n                      << std::endl;\n            return;\n        }\n        m_fusion.handleVideoTrackerDataDuringStartup(timestamp, report,\n                                                     oriState);\n        return;\n    }\n    m_fusion.handleVideoTrackerDataWhileRunning(timestamp, report);\n    sendMainPoseReport();\n    osvrDeviceTrackerSendPoseTimestamped(\n        m_dev, m_trackerOut, &m_fusion.getLatestReorientedVideoPose(),\n        TRANSFORMED_VIDEO_SENSOR_ID, &timestamp);\n}\n\nvoid VideoIMUFusionDevice::sendMainPoseReport() {\n    osvrDeviceTrackerSendPoseTimestamped(\n        m_dev, m_trackerOut, &m_fusion.getLatestFusedPose(), FUSED_SENSOR_ID,\n        &m_fusion.getLatestFusedTime());\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"cliargsparser.h\"\n\n#include <getopt.h>\n\n#include \"globals.h\"\n#include \"strprintf.h\"\n\nnamespace newsboat {\n\nCliArgsParser::CliArgsParser(int argc, char* argv[])\n{\n\tint c;\n\n\tprogram_name = argv[0];\n\n\tstatic const char getopt_str[] = \"i:erhqu:c:C:d:l:vVx:XI:E:\";\n\tstatic const struct option longopts[] = {\n\t\t{\"cache-file\", required_argument, 0, 'c'},\n\t\t{\"config-file\", required_argument, 0, 'C'},\n\t\t{\"execute\", required_argument, 0, 'x'},\n\t\t{\"export-to-file\", required_argument, 0, 'E'},\n\t\t{\"export-to-opml\", no_argument, 0, 'e'},\n\t\t{\"help\", no_argument, 0, 'h'},\n\t\t{\"import-from-file\", required_argument, 0, 'I'},\n\t\t{\"import-from-opml\", required_argument, 0, 'i'},\n\t\t{\"log-file\", required_argument, 0, 'd'},\n\t\t{\"log-level\", required_argument, 0, 'l'},\n\t\t{\"quiet\", no_argument, 0, 'q'},\n\t\t{\"refresh-on-start\", no_argument, 0, 'r'},\n\t\t{\"url-file\", required_argument, 0, 'u'},\n\t\t{\"vacuum\", no_argument, 0, 'X'},\n\t\t{\"version\", no_argument, 0, 'v'},\n\t\t{0, 0, 0, 0}};\n\n\t\/\/ Ask getopt to re-initialize itself.\n\t\/\/\n\t\/\/ This isn't necessary for real-world use, because we parse arguments\n\t\/\/ only once; but this is *very* important in tests, where CliArgsParser\n\t\/\/ is ran dozens of times.\n\t\/\/\n\t\/\/ Note we use 0, not 1. getopt(3) says that the value of 0 forces\n\t\/\/ getopt() to re-initialize some more internal stuff. This shouldn't\n\t\/\/ make a difference in our case, but somehow it does - if we use 1,\n\t\/\/ tests start to fail.\n\toptind = 0;\n\n\twhile ((c = ::getopt_long(argc, argv, getopt_str, longopts, nullptr)) !=\n\t\t-1) {\n\t\tswitch (c) {\n\t\tcase ':': \/* fall-through *\/\n\t\tcase '?': \/* missing option *\/\n\t\t\tshould_print_usage = true;\n\n\t\t\tshould_return = true;\n\t\t\treturn_code = EXIT_FAILURE;\n\n\t\t\tbreak;\n\t\tcase 'i':\n\t\t\tif (do_export) {\n\t\t\t\tshould_print_usage = true;\n\n\t\t\t\tshould_return = true;\n\t\t\t\treturn_code = EXIT_FAILURE;\n\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tdo_import = true;\n\t\t\timportfile = optarg;\n\t\t\tbreak;\n\t\tcase 'r':\n\t\t\trefresh_on_start = true;\n\t\t\tbreak;\n\t\tcase 'e':\n\t\t\t\/\/ disable logging of newsboat's startup progress to\n\t\t\t\/\/ stdout, because the OPML export will be printed to\n\t\t\t\/\/ stdout.\n\t\t\tsilent = true;\n\t\t\tif (do_import) {\n\t\t\t\tshould_print_usage = true;\n\n\t\t\t\tshould_return = true;\n\t\t\t\treturn_code = EXIT_FAILURE;\n\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tdo_export = true;\n\t\t\tbreak;\n\t\tcase 'h':\n\t\t\tshould_print_usage = true;\n\t\t\tshould_return = true;\n\t\t\treturn_code = EXIT_SUCCESS;\n\t\t\tbreak;\n\t\tcase 'u':\n\t\t\tset_url_file = true;\n\t\t\turl_file = optarg;\n\t\t\tusing_nonstandard_configs = true;\n\t\t\tbreak;\n\t\tcase 'c':\n\t\t\tset_cache_file = true;\n\t\t\tcache_file = optarg;\n\t\t\tset_lock_file = true;\n\t\t\tlock_file = std::string(cache_file) + LOCK_SUFFIX;\n\t\t\tusing_nonstandard_configs = true;\n\t\t\tbreak;\n\t\tcase 'C':\n\t\t\tset_config_file = true;\n\t\t\tconfig_file = optarg;\n\t\t\tusing_nonstandard_configs = true;\n\t\t\tbreak;\n\t\tcase 'X':\n\t\t\tdo_vacuum = true;\n\t\t\tbreak;\n\t\tcase 'v':\n\t\tcase 'V':\n\t\t\tshow_version++;\n\t\t\tbreak;\n\t\tcase 'x':\n\t\t\t\/\/ disable logging of newsboat's startup progress to\n\t\t\t\/\/ stdout, because the command execution result will be\n\t\t\t\/\/ printed to stdout\n\t\t\tsilent = true;\n\n\t\t\texecute_cmds = true;\n\t\t\tcmds_to_execute.push_back(optarg);\n\t\t\twhile (optind < argc && *argv[optind] != '-') {\n\t\t\t\tcmds_to_execute.push_back(argv[optind]);\n\t\t\t\toptind++;\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 'q':\n\t\t\tsilent = true;\n\t\t\tbreak;\n\t\tcase 'd':\n\t\t\tset_log_file = true;\n\t\t\tlog_file = optarg;\n\t\t\tbreak;\n\t\tcase 'l': {\n\t\t\tLevel l = static_cast<Level>(atoi(optarg));\n\t\t\tif (l > Level::NONE && l <= Level::DEBUG) {\n\t\t\t\tset_log_level = true;\n\t\t\t\tlog_level = l;\n\t\t\t} else {\n\t\t\t\tdisplay_msg =\n\t\t\t\t\tstrprintf::fmt(_(\"%s: %d: invalid \"\n\t\t\t\t\t\t\t \"loglevel value\"),\n\t\t\t\t\t\targv[0],\n\t\t\t\t\t\tstatic_cast<int>(l));\n\n\t\t\t\tshould_return = true;\n\t\t\t\treturn_code = EXIT_FAILURE;\n\n\t\t\t\tbreak;\n\t\t\t}\n\t\t} break;\n\t\tcase 'I':\n\t\t\tif (do_read_export) {\n\t\t\t\tshould_print_usage = true;\n\n\t\t\t\tshould_return = true;\n\t\t\t\treturn_code = EXIT_FAILURE;\n\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tdo_read_import = true;\n\t\t\treadinfofile = optarg;\n\t\t\tbreak;\n\t\tcase 'E':\n\t\t\tif (do_read_import) {\n\t\t\t\tshould_print_usage = true;\n\n\t\t\t\tshould_return = true;\n\t\t\t\treturn_code = EXIT_FAILURE;\n\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tdo_read_export = true;\n\t\t\treadinfofile = optarg;\n\t\t\tbreak;\n\t\t}\n\t};\n}\n\n} \/\/ namespace newsboat\n<commit_msg>Update cliargsparser.cpp<commit_after>#include \"cliargsparser.h\"\n\n#include <getopt.h>\n#include <cstdlib>\n\n#include \"globals.h\"\n#include \"strprintf.h\"\n\nnamespace newsboat {\n\nCliArgsParser::CliArgsParser(int argc, char* argv[])\n{\n\tint c;\n\n\tprogram_name = argv[0];\n\n\tstatic const char getopt_str[] = \"i:erhqu:c:C:d:l:vVx:XI:E:\";\n\tstatic const struct option longopts[] = {\n\t\t{\"cache-file\", required_argument, 0, 'c'},\n\t\t{\"config-file\", required_argument, 0, 'C'},\n\t\t{\"execute\", required_argument, 0, 'x'},\n\t\t{\"export-to-file\", required_argument, 0, 'E'},\n\t\t{\"export-to-opml\", no_argument, 0, 'e'},\n\t\t{\"help\", no_argument, 0, 'h'},\n\t\t{\"import-from-file\", required_argument, 0, 'I'},\n\t\t{\"import-from-opml\", required_argument, 0, 'i'},\n\t\t{\"log-file\", required_argument, 0, 'd'},\n\t\t{\"log-level\", required_argument, 0, 'l'},\n\t\t{\"quiet\", no_argument, 0, 'q'},\n\t\t{\"refresh-on-start\", no_argument, 0, 'r'},\n\t\t{\"url-file\", required_argument, 0, 'u'},\n\t\t{\"vacuum\", no_argument, 0, 'X'},\n\t\t{\"version\", no_argument, 0, 'v'},\n\t\t{0, 0, 0, 0}};\n\n\t\/\/ Ask getopt to re-initialize itself.\n\t\/\/\n\t\/\/ This isn't necessary for real-world use, because we parse arguments\n\t\/\/ only once; but this is *very* important in tests, where CliArgsParser\n\t\/\/ is ran dozens of times.\n\t\/\/\n\t\/\/ Note we use 0, not 1. getopt(3) says that the value of 0 forces\n\t\/\/ getopt() to re-initialize some more internal stuff. This shouldn't\n\t\/\/ make a difference in our case, but somehow it does - if we use 1,\n\t\/\/ tests start to fail.\n\toptind = 0;\n\n\twhile ((c = ::getopt_long(argc, argv, getopt_str, longopts, nullptr)) !=\n\t\t-1) {\n\t\tswitch (c) {\n\t\tcase ':': \/* fall-through *\/\n\t\tcase '?': \/* missing option *\/\n\t\t\tshould_print_usage = true;\n\n\t\t\tshould_return = true;\n\t\t\treturn_code = EXIT_FAILURE;\n\n\t\t\tbreak;\n\t\tcase 'i':\n\t\t\tif (do_export) {\n\t\t\t\tshould_print_usage = true;\n\n\t\t\t\tshould_return = true;\n\t\t\t\treturn_code = EXIT_FAILURE;\n\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tdo_import = true;\n\t\t\timportfile = optarg;\n\t\t\tbreak;\n\t\tcase 'r':\n\t\t\trefresh_on_start = true;\n\t\t\tbreak;\n\t\tcase 'e':\n\t\t\t\/\/ disable logging of newsboat's startup progress to\n\t\t\t\/\/ stdout, because the OPML export will be printed to\n\t\t\t\/\/ stdout.\n\t\t\tsilent = true;\n\t\t\tif (do_import) {\n\t\t\t\tshould_print_usage = true;\n\n\t\t\t\tshould_return = true;\n\t\t\t\treturn_code = EXIT_FAILURE;\n\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tdo_export = true;\n\t\t\tbreak;\n\t\tcase 'h':\n\t\t\tshould_print_usage = true;\n\t\t\tshould_return = true;\n\t\t\treturn_code = EXIT_SUCCESS;\n\t\t\tbreak;\n\t\tcase 'u':\n\t\t\tset_url_file = true;\n\t\t\turl_file = optarg;\n\t\t\tusing_nonstandard_configs = true;\n\t\t\tbreak;\n\t\tcase 'c':\n\t\t\tset_cache_file = true;\n\t\t\tcache_file = optarg;\n\t\t\tset_lock_file = true;\n\t\t\tlock_file = std::string(cache_file) + LOCK_SUFFIX;\n\t\t\tusing_nonstandard_configs = true;\n\t\t\tbreak;\n\t\tcase 'C':\n\t\t\tset_config_file = true;\n\t\t\tconfig_file = optarg;\n\t\t\tusing_nonstandard_configs = true;\n\t\t\tbreak;\n\t\tcase 'X':\n\t\t\tdo_vacuum = true;\n\t\t\tbreak;\n\t\tcase 'v':\n\t\tcase 'V':\n\t\t\tshow_version++;\n\t\t\tbreak;\n\t\tcase 'x':\n\t\t\t\/\/ disable logging of newsboat's startup progress to\n\t\t\t\/\/ stdout, because the command execution result will be\n\t\t\t\/\/ printed to stdout\n\t\t\tsilent = true;\n\n\t\t\texecute_cmds = true;\n\t\t\tcmds_to_execute.push_back(optarg);\n\t\t\twhile (optind < argc && *argv[optind] != '-') {\n\t\t\t\tcmds_to_execute.push_back(argv[optind]);\n\t\t\t\toptind++;\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 'q':\n\t\t\tsilent = true;\n\t\t\tbreak;\n\t\tcase 'd':\n\t\t\tset_log_file = true;\n\t\t\tlog_file = optarg;\n\t\t\tbreak;\n\t\tcase 'l': {\n\t\t\tLevel l = static_cast<Level>(atoi(optarg));\n\t\t\tif (l > Level::NONE && l <= Level::DEBUG) {\n\t\t\t\tset_log_level = true;\n\t\t\t\tlog_level = l;\n\t\t\t} else {\n\t\t\t\tdisplay_msg =\n\t\t\t\t\tstrprintf::fmt(_(\"%s: %d: invalid \"\n\t\t\t\t\t\t\t \"loglevel value\"),\n\t\t\t\t\t\targv[0],\n\t\t\t\t\t\tstatic_cast<int>(l));\n\n\t\t\t\tshould_return = true;\n\t\t\t\treturn_code = EXIT_FAILURE;\n\n\t\t\t\tbreak;\n\t\t\t}\n\t\t} break;\n\t\tcase 'I':\n\t\t\tif (do_read_export) {\n\t\t\t\tshould_print_usage = true;\n\n\t\t\t\tshould_return = true;\n\t\t\t\treturn_code = EXIT_FAILURE;\n\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tdo_read_import = true;\n\t\t\treadinfofile = optarg;\n\t\t\tbreak;\n\t\tcase 'E':\n\t\t\tif (do_read_import) {\n\t\t\t\tshould_print_usage = true;\n\n\t\t\t\tshould_return = true;\n\t\t\t\treturn_code = EXIT_FAILURE;\n\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tdo_read_export = true;\n\t\t\treadinfofile = optarg;\n\t\t\tbreak;\n\t\t}\n\t};\n}\n\n} \/\/ namespace newsboat\n<|endoftext|>"}
{"text":"<commit_before>\/*\n  cl_main.hh -- Copyright (c) 2013 Noel Cower. All rights reserved.\n  See COPYING under the project root for the source code license. If this file\n  is not present, refer to <https:\/\/raw.github.com\/nilium\/snow\/master\/COPYING>.\n*\/\n#ifndef __SNOW_CL_MAIN_HH__\n#define __SNOW_CL_MAIN_HH__\n\n#include \"..\/config.hh\"\n#include <snow\/types\/object_pool.hh>\n#include \"..\/dispatch.hh\"\n#include \"..\/net\/netevent.hh\"\n#include \"..\/event_queue.hh\"\n#include \"..\/console.hh\"\n#include \"..\/game\/resources.hh\"\n#if USE_SERVER\n#include <enet\/enet.h>\n#endif\n#include <atomic>\n#include <list>\n#include \"..\/ext\/zmqxx.hh\"\n\n\nstruct GLFWwindow;\n\n\nnamespace snow {\n\n\nstruct system_t;\n\n\nstruct S_EXPORT client_t\n{\n  static const int DEFAULT_CLIENT_NUM = 0;\n\n  static client_t &get_client(int client_num = DEFAULT_CLIENT_NUM);\n\n  client_t();\n  ~client_t();\n\n  \/\/ Launches the client's frameloop thread. Should not be called more than once\n  \/\/ per process (and only one client should exist per process).\n  void initialize(int argc, const char *argv[]);\n  \/\/ Kills the client frame loop and in turn the client itself. This will end\n  \/\/ the process.\n  void quit();\n\n#if USE_SERVER\n  \/\/ Attempts to connect to a server at the given address\n  bool connect(ENetAddress address);\n  \/\/ Whether connected to the server\n  bool is_connected() const;\n  \/\/ Disconnects from the server (if connected)\n  void disconnect();\n#endif\n\n  \/* Adds a system to the list of systems to update\/send events to. Does not\n  check to see if the system is already in the list. *\/\n  void add_system(system_t *system, int logic_priority = 0, int draw_priority = 0);\n  \/* Removes a system regardless of what its priority is *\/\n  void remove_system(system_t *system);\n  void remove_all_systems();\n\nprotected:\n  void terminate();\n  void run_frameloop();\n  void frameloop();\n  virtual void read_events(double timeslice);\n  virtual void do_frame(double step, double timeslice);\n  virtual void dispose();\n#if USE_SERVER\n  void pump_netevents(double timeslice);\n#endif\n\nprivate:\n  using netevent_pool_t = object_pool_t<netevent_t, unsigned, false>;\n  using system_pair_t = std::pair<int, system_t *>;\n\n  std::atomic<bool>         running_ { false };\n  std::atomic<bool>         poll_events_ { true };\n  double                    sim_time_ = 0;\n  double                    base_time_ = 0;\n\n#if USE_SERVER\n  ENetHost *                host_ = NULL;\n  ENetPeer *                peer_ = NULL;\n  netevent_pool_t           netevent_pool_;\n#endif\n\n  GLFWwindow *              window_ = NULL;\n  event_queue_t             event_queue_;\n  std::list<system_pair_t>  logic_systems_ { };\n  std::list<system_pair_t>  draw_systems_  { };\n  cvar_set_t                cvars_;\n\n  resources_t *             res_;\n\n  zmq::socket_t             read_socket_;\n  zmq::socket_t             write_socket_;\n\n  \/\/ CCMDS\n  ccmd_t cmd_quit_;\n\n  \/\/ CVARS\n  cvar_t *cl_willQuit;\n  cvar_t *wnd_focused;\n  cvar_t *wnd_mouseMode;\n  cvar_t *r_drawFrame;\n  cvar_t *r_clearFrame;\n};\n\n\n} \/\/ namespace snow\n\n#endif \/* end __SNOW_CL_MAIN_HH__ include guard *\/\n<commit_msg>Remove virtual specifier from client_t functions<commit_after>\/*\n  cl_main.hh -- Copyright (c) 2013 Noel Cower. All rights reserved.\n  See COPYING under the project root for the source code license. If this file\n  is not present, refer to <https:\/\/raw.github.com\/nilium\/snow\/master\/COPYING>.\n*\/\n#ifndef __SNOW_CL_MAIN_HH__\n#define __SNOW_CL_MAIN_HH__\n\n#include \"..\/config.hh\"\n#include <snow\/types\/object_pool.hh>\n#include \"..\/dispatch.hh\"\n#include \"..\/net\/netevent.hh\"\n#include \"..\/event_queue.hh\"\n#include \"..\/console.hh\"\n#include \"..\/game\/resources.hh\"\n#if USE_SERVER\n#include <enet\/enet.h>\n#endif\n#include <atomic>\n#include <list>\n#include \"..\/ext\/zmqxx.hh\"\n\n\nstruct GLFWwindow;\n\n\nnamespace snow {\n\n\nstruct system_t;\n\n\nstruct S_EXPORT client_t\n{\n  static const int DEFAULT_CLIENT_NUM = 0;\n\n  static client_t &get_client(int client_num = DEFAULT_CLIENT_NUM);\n\n  client_t();\n  ~client_t();\n\n  \/\/ Launches the client's frameloop thread. Should not be called more than once\n  \/\/ per process (and only one client should exist per process).\n  void initialize(int argc, const char *argv[]);\n  \/\/ Kills the client frame loop and in turn the client itself. This will end\n  \/\/ the process.\n  void quit();\n\n#if USE_SERVER\n  \/\/ Attempts to connect to a server at the given address\n  bool connect(ENetAddress address);\n  \/\/ Whether connected to the server\n  bool is_connected() const;\n  \/\/ Disconnects from the server (if connected)\n  void disconnect();\n#endif\n\n  \/* Adds a system to the list of systems to update\/send events to. Does not\n  check to see if the system is already in the list. *\/\n  void add_system(system_t *system, int logic_priority = 0, int draw_priority = 0);\n  \/* Removes a system regardless of what its priority is *\/\n  void remove_system(system_t *system);\n  void remove_all_systems();\n\nprotected:\n  void terminate();\n  void run_frameloop();\n  void frameloop();\n  void read_events(double timeslice);\n  void do_frame(double step, double timeslice);\n  void dispose();\n#if USE_SERVER\n  void pump_netevents(double timeslice);\n#endif\n\nprivate:\n  using netevent_pool_t = object_pool_t<netevent_t, unsigned, false>;\n  using system_pair_t = std::pair<int, system_t *>;\n\n  std::atomic<bool>         running_ { false };\n  std::atomic<bool>         poll_events_ { true };\n  double                    sim_time_ = 0;\n  double                    base_time_ = 0;\n\n#if USE_SERVER\n  ENetHost *                host_ = NULL;\n  ENetPeer *                peer_ = NULL;\n  netevent_pool_t           netevent_pool_;\n#endif\n\n  GLFWwindow *              window_ = NULL;\n  event_queue_t             event_queue_;\n  std::list<system_pair_t>  logic_systems_ { };\n  std::list<system_pair_t>  draw_systems_  { };\n  cvar_set_t                cvars_;\n\n  resources_t *             res_;\n\n  zmq::socket_t             read_socket_;\n  zmq::socket_t             write_socket_;\n\n  \/\/ CCMDS\n  ccmd_t cmd_quit_;\n\n  \/\/ CVARS\n  cvar_t *cl_willQuit;\n  cvar_t *wnd_focused;\n  cvar_t *wnd_mouseMode;\n  cvar_t *r_drawFrame;\n  cvar_t *r_clearFrame;\n};\n\n\n} \/\/ namespace snow\n\n#endif \/* end __SNOW_CL_MAIN_HH__ include guard *\/\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\tCopyright (c) 2014, Madd Games.\n\tAll rights reserved.\n\t\n\tRedistribution and use in source and binary forms, with or without\n\tmodification, are permitted provided that the following conditions are met:\n\t\n\t* Redistributions of source code must retain the above copyright notice, this\n\t  list of conditions and the following disclaimer.\n\t\n\t* Redistributions in binary form must reproduce the above copyright notice,\n\t  this list of conditions and the following disclaimer in the documentation\n\t  and\/or other materials provided with the distribution.\n\t\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 ARE\n\tDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\tFOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\tDAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\tSERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\tCAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\tOR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\tOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*\/\n\n#include <Apoc\/Math\/Matrix.h>\n\nMatrix::Matrix()\n{\n};\n\nMatrix::Matrix(const Matrix &mat)\n{\n\tint i;\n\tfor (i=0; i<4; i++)\n\t{\n\t\tcolumns[i] = mat.columns[i];\n\t};\n};\n\nMatrix& Matrix::operator=(Matrix mat)\n{\n\tint i;\n\tfor (i=0; i<4; i++)\n\t{\n\t\tcolumns[i] = mat[i];\n\t};\n\t\n\treturn *this;\n};\n\nVector& Matrix::operator[](int i)\n{\n\treturn columns[i];\n};\n\nMatrix Matrix::transpose()\n{\n\tMatrix out;\n\tint i, j;\n\tfor (i=0; i<4; i++)\n\t{\n\t\tfor (j=0; j<4; j++)\n\t\t{\n\t\t\tout[i][j] = columns[j][i];\n\t\t};\n\t};\n\t\n\treturn out;\n};\n\nMatrix Matrix::operator*(Matrix b)\n{\n\tMatrix a = transpose();\n\tMatrix out;\n\t\n\tint i, j;\n\tfor (i=0; i<4; i++)\n\t{\n\t\tfor (j=0; j<4; j++)\n\t\t{\n\t\t\tout[i][j] = a[j].dot(b[i]);\n\t\t};\n\t};\n\t\n\treturn out;\n};\n\nVector Matrix::operator*(Vector vec)\n{\n\tVector out;\n\tint i;\n\tfor (i=0; i<4; i++)\n\t{\n\t\tout[i] = columns[i].dot(vec);\n\t};\n\treturn out;\n};\n\nMatrix Matrix::Identity()\n{\n\tMatrix out;\n\tint i, j;\n\tfor (i=0; i<4; i++)\n\t{\n\t\tfor (j=0; j<4; j++)\n\t\t{\n\t\t\tif (i == j)\n\t\t\t{\n\t\t\t\tout[i][j] = 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tout[i][j] = 0;\n\t\t\t};\n\t\t};\n\t};\n\t\n\treturn out;\n};\n\nMatrix Matrix::Scale(float x, float y, float z)\n{\n\tMatrix mat;\n\tmat[0] = Vector(x, 0.0, 0.0, 0.0);\n\tmat[1] = Vector(0.0, y, 0.0, 0.0);\n\tmat[2] = Vector(0.0, 0.0, z, 0.0);\n\tmat[3] = Vector(0.0, 0.0, 0.0, 1.0);\n\treturn mat;\n};\n\nMatrix Matrix::Translate(float x, float y, float z)\n{\n\tMatrix mat = Identity();\n\tmat[3] = Vector(x, y, z, 1.0);\n\treturn mat;\n};\n\nMatrix Matrix::LookAt(Vector eye, Vector up, Vector ref)\n{\n\tVector forward = (ref - eye).normalize();\n\tVector side = forward.cross(up).normalize();\n\tup = up.normalize();\t\t\t\t\/\/ because some people are stupid :)\n\t\n\tMatrix mat;\n\tmat[0] = side;\n\tmat[1] = up;\n\tmat[2] = forward;\n\tmat[3] = eye;\n\treturn mat;\n};\n\nostream& operator<<(ostream &os, Matrix mat)\n{\n\tint i, j;\n\tfor (j=0; j<4; j++)\n\t{\n\t\tos << \"[\";\n\t\t\n\t\tfor (i=0; i<4; i++)\n\t\t{\n\t\t\tos << mat[i][j] << \"\\t\";\n\t\t};\n\t\t\n\t\tos << \"]\" << endl;\n\t};\n\t\n\treturn os;\n};\n<commit_msg>Update Matrix.cpp<commit_after>\/*\n\tCopyright (c) 2014, Madd Games.\n\tAll rights reserved.\n\t\n\tRedistribution and use in source and binary forms, with or without\n\tmodification, are permitted provided that the following conditions are met:\n\t\n\t* Redistributions of source code must retain the above copyright notice, this\n\t  list of conditions and the following disclaimer.\n\t\n\t* Redistributions in binary form must reproduce the above copyright notice,\n\t  this list of conditions and the following disclaimer in the documentation\n\t  and\/or other materials provided with the distribution.\n\t\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 ARE\n\tDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\tFOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\tDAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\tSERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\tCAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\tOR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\tOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*\/\n\n#include <Apoc\/Math\/Matrix.h>\n#include <math.h>\n\nMatrix::Matrix()\n{\n};\n\nMatrix::Matrix(const Matrix &mat)\n{\n\tint i;\n\tfor (i=0; i<4; i++)\n\t{\n\t\tcolumns[i] = mat.columns[i];\n\t};\n};\n\nMatrix& Matrix::operator=(Matrix mat)\n{\n\tint i;\n\tfor (i=0; i<4; i++)\n\t{\n\t\tcolumns[i] = mat[i];\n\t};\n\t\n\treturn *this;\n};\n\nVector& Matrix::operator[](int i)\n{\n\treturn columns[i];\n};\n\nMatrix Matrix::transpose()\n{\n\tMatrix out;\n\tint i, j;\n\tfor (i=0; i<4; i++)\n\t{\n\t\tfor (j=0; j<4; j++)\n\t\t{\n\t\t\tout[i][j] = columns[j][i];\n\t\t};\n\t};\n\t\n\treturn out;\n};\n\nMatrix Matrix::operator*(Matrix b)\n{\n\tMatrix a = transpose();\n\tMatrix out;\n\t\n\tint i, j;\n\tfor (i=0; i<4; i++)\n\t{\n\t\tfor (j=0; j<4; j++)\n\t\t{\n\t\t\tout[i][j] = a[j].dot(b[i]);\n\t\t};\n\t};\n\t\n\treturn out;\n};\n\nVector Matrix::operator*(Vector vec)\n{\n\tVector out;\n\tint i;\n\tfor (i=0; i<4; i++)\n\t{\n\t\tout[i] = columns[i].dot(vec);\n\t};\n\treturn out;\n};\n\nMatrix Matrix::Identity()\n{\n\tMatrix out;\n\tint i, j;\n\tfor (i=0; i<4; i++)\n\t{\n\t\tfor (j=0; j<4; j++)\n\t\t{\n\t\t\tif (i == j)\n\t\t\t{\n\t\t\t\tout[i][j] = 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tout[i][j] = 0;\n\t\t\t};\n\t\t};\n\t};\n\t\n\treturn out;\n};\n\nMatrix Matrix::Scale(float x, float y, float z)\n{\n\tMatrix mat;\n\tmat[0] = Vector(x, 0.0, 0.0, 0.0);\n\tmat[1] = Vector(0.0, y, 0.0, 0.0);\n\tmat[2] = Vector(0.0, 0.0, z, 0.0);\n\tmat[3] = Vector(0.0, 0.0, 0.0, 1.0);\n\treturn mat;\n};\n\nMatrix Matrix::Translate(float x, float y, float z)\n{\n\tMatrix mat = Identity();\n\tmat[3] = Vector(x, y, z, 1.0);\n\treturn mat;\n};\n\nMatrix Matrix::LookAt(Vector eye, Vector up, Vector ref)\n{\n\tVector forward = (ref - eye).normalize();\n\tVector side = forward.cross(up).normalize();\n\tup = up.normalize();\t\t\t\t\/\/ because some people are stupid :)\n\t\n\tMatrix mat;\n\tmat[0] = side;\n\tmat[1] = up;\n\tmat[2] = forward;\n\tmat[3] = eye;\n\treturn mat;\n};\n\nMatrix Matrix::Perspective(float width, float height, float zNear, float zFar, float fov)\n{\n\tfloat ar = width \/ height;\n\tfloat fac = 1.0\/(ar*tanf(fov\/2.0));\n\t\n\tMatrix out;\n\tout[0] = Vector(factor, 0.0, 0.0, 0.0);\n\tout[1] = Vector(0.0, factor, 0.0, 0.0);\n\tout[2] = Vector(0.0, 0.0, (-zNear-zFar)\/(zNear-zFar), 1.0);\n\tout[3] = Vector(0.0, 0.0, (2*zFar*zNear)\/(zNear-zFar), 0.0);\n\t\n\treturn out;\n};\n\nostream& operator<<(ostream &os, Matrix mat)\n{\n\tint i, j;\n\tfor (j=0; j<4; j++)\n\t{\n\t\tos << \"[\";\n\t\t\n\t\tfor (i=0; i<4; i++)\n\t\t{\n\t\t\tos << mat[i][j] << \"\\t\";\n\t\t};\n\t\t\n\t\tos << \"]\" << endl;\n\t};\n\t\n\treturn os;\n};\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * ctapdev.cc\n *\n *  Created on: 24.06.2013\n *      Author: andreas\n *\/\n\n#include <sys\/socket.h>\n#include <linux\/if.h>\n\n#include \"ctapdev.hpp\"\n#include \"roflibs\/netlink\/tap_manager.hpp\"\n#include \"roflibs\/netlink\/cpacketpool.hpp\"\n\nextern int errno;\n\nnamespace rofcore {\n\nctapdev::ctapdev(tap_callback &cb, std::string const &devname, pthread_t tid)\n    : fd(-1), devname(devname), thread(this), cb(cb) {\n  try {\n    tap_open(); \/\/\/ XXX FIXME exceptions are wrong handled here\n  } catch (std::exception &e) {\n    thread.add_timer(CTAPDEV_TIMER_OPEN_PORT, rofl::ctimespec().expire_in(1));\n  }\n}\n\nctapdev::~ctapdev() {\n  tap_close();\n  thread.stop();\n}\n\nvoid ctapdev::tap_open() {\n  try {\n    struct ifreq ifr;\n    int rc;\n\n    if (fd > -1) {\n      tap_close();\n    }\n\n    if ((fd = open(\"\/dev\/net\/tun\", O_RDWR | O_NONBLOCK)) < 0) {\n      throw eTapDevOpenFailed(\n          \"ctapdev::tap_open() opening \/dev\/net\/tun failed\");\n    }\n\n    memset(&ifr, 0, sizeof(ifr));\n\n    \/* Flags: IFF_TUN   - TUN device (no Ethernet headers)\n     *        IFF_TAP   - TAP device\n     *\n     *        IFF_NO_PI - Do not provide packet information\n     *\/\n    ifr.ifr_flags = IFF_TAP | IFF_NO_PI;\n    strncpy(ifr.ifr_name, devname.c_str(), IFNAMSIZ);\n\n    if ((rc = ioctl(fd, TUNSETIFF, (void *)&ifr)) < 0) {\n      close(fd);\n      throw eTapDevIoctlFailed(\"ctapdev::tap_open() setting flags IFF_TAP | \"\n                               \"IFF_NO_PI on \/dev\/net\/tun failed\");\n    }\n\n    thread.start();\n    thread.add_read_fd(fd);\n    thread.add_write_fd(fd);\n\n  } catch (eTapDevOpenFailed &e) {\n    rofcore::logging::error\n        << \"ctapdev::tap_open() open() failed, dev:\" << devname << std::endl\n        << rofl::eSysCall(\"open\");\n  } catch (eTapDevIoctlFailed &e) {\n    rofcore::logging::error\n        << \"ctapdev::tap_open() open() failed, dev:\" << devname << std::endl\n        << rofl::eSysCall(\"ctapdev ioctl\");\n  }\n}\n\nvoid ctapdev::tap_close() {\n  if (fd == -1) {\n    return;\n  }\n\n  thread.drop_read_fd(fd, false);\n  thread.drop_write_fd(fd, false);\n\n  close(fd);\n\n  fd = -1;\n}\n\nvoid ctapdev::enqueue(rofl::cpacket *pkt) {\n  if (fd == -1) {\n    cpacketpool::get_instance().release_pkt(pkt);\n    return;\n  }\n\n  \/\/ store pkt in outgoing queue\n  {\n    rofl::AcquireReadWriteLock rwlock(pout_queue_rwlock);\n    pout_queue.push_back(pkt);\n  }\n\n  thread.wakeup();\n}\n\nvoid ctapdev::enqueue(std::vector<rofl::cpacket *> pkts) {\n  if (fd == -1) {\n    for (std::vector<rofl::cpacket *>::iterator it = pkts.begin();\n         it != pkts.end(); ++it) {\n      cpacketpool::get_instance().release_pkt((*it));\n    }\n    return;\n  }\n\n  \/\/ store pkts in outgoing queue\n  {\n    rofl::AcquireReadWriteLock rwlock(pout_queue_rwlock);\n    for (std::vector<rofl::cpacket *>::iterator it = pkts.begin();\n         it != pkts.end(); ++it) {\n      pout_queue.push_back(*it);\n    }\n  }\n\n  thread.wakeup();\n}\n\nvoid ctapdev::handle_read_event(rofl::cthread &thread, int fd) {\n  rofl::cpacket *pkt = NULL;\n  try {\n\n    rofl::cmemory mem(1518);\n\n    int rc = read(fd, mem.somem(), mem.memlen());\n\n    \/\/ error occured (or non-blocking)\n    if (rc < 0) {\n      switch (errno) {\n      case EAGAIN:\n        rofcore::logging::error\n            << \"ctapdev::handle_revent() EAGAIN, retrying later\" << std::endl;\n      default:\n        rofcore::logging::error << \"ctapdev::handle_revent() error occured\"\n                                << std::endl;\n      }\n    } else {\n      pkt = cpacketpool::get_instance().acquire_pkt();\n\n      pkt->unpack(mem.somem(), rc);\n\n      cb.enqueue(this, pkt);\n    }\n\n  } catch (ePacketPoolExhausted &e) {\n    rofcore::logging::error << \"ctapdev::handle_revent() packet pool \"\n                               \"exhausted, no idle slots available\"\n                            << std::endl;\n  }\n}\n\nvoid ctapdev::handle_write_event(rofl::cthread &thread, int fd) { tx(); }\n\nstatic inline void release_packets(std::deque<rofl::cpacket *> &q) {\n  for (auto i : q) {\n    cpacketpool::get_instance().release_pkt(i);\n  }\n}\n\nvoid ctapdev::tx() {\n  rofl::cpacket *pkt = NULL;\n  std::deque<rofl::cpacket *> out_queue;\n\n  {\n    rofl::AcquireReadWriteLock rwlock(pout_queue_rwlock);\n    out_queue = std::move(pout_queue);\n  }\n\n  while (not out_queue.empty()) {\n\n    pkt = out_queue.front();\n    int rc = 0;\n    if ((rc = write(fd, pkt->soframe(), pkt->length())) < 0) {\n      switch (errno) {\n      case EAGAIN:\n        rofcore::logging::debug << \"ctapdev::tx() EAGAIN\" << std::endl;\n        {\n          rofl::AcquireReadWriteLock rwlock(pout_queue_rwlock);\n          std::move(out_queue.rbegin(), out_queue.rend(),\n                    std::front_inserter(pout_queue));\n        }\n        return;\n      case EIO:\n        \/\/ tap not enabled drop packet\n        release_packets(out_queue);\n        return;\n      default:\n        \/\/ will drop packets\n        release_packets(out_queue);\n        rofcore::logging::error\n            << \"ctapdev::tx() unknown error occured rc=\" << rc\n            << \" errno=\" << errno << \" '\" << strerror(errno) << std::endl;\n        return;\n      }\n    }\n    cpacketpool::get_instance().release_pkt(pkt);\n    out_queue.pop_front();\n  }\n}\n\nvoid ctapdev::handle_timeout(rofl::cthread &thread, uint32_t timer_id,\n                             const std::list<unsigned int> &ttypes) {\n  switch (timer_id) {\n  case CTAPDEV_TIMER_OPEN_PORT: {\n    try {\n      tap_open();\n    } catch (...) {\n      thread.add_timer(CTAPDEV_TIMER_OPEN_PORT, rofl::ctimespec().expire_in(1));\n    }\n  } break;\n  }\n}\n\n} \/\/ namespace rofcore\n<commit_msg>ctapdev: readd rethrow until actual problem is solved<commit_after>\/*\n * ctapdev.cc\n *\n *  Created on: 24.06.2013\n *      Author: andreas\n *\/\n\n#include <sys\/socket.h>\n#include <linux\/if.h>\n\n#include \"ctapdev.hpp\"\n#include \"roflibs\/netlink\/tap_manager.hpp\"\n#include \"roflibs\/netlink\/cpacketpool.hpp\"\n\nextern int errno;\n\nnamespace rofcore {\n\nctapdev::ctapdev(tap_callback &cb, std::string const &devname, pthread_t tid)\n    : fd(-1), devname(devname), thread(this), cb(cb) {\n  try {\n    tap_open(); \/\/\/ XXX FIXME exceptions are wrong handled here\n  } catch (std::exception &e) {\n    thread.add_timer(CTAPDEV_TIMER_OPEN_PORT, rofl::ctimespec().expire_in(1));\n  }\n}\n\nctapdev::~ctapdev() {\n  tap_close();\n  thread.stop();\n}\n\nvoid ctapdev::tap_open() {\n  try {\n    struct ifreq ifr;\n    int rc;\n\n    if (fd > -1) {\n      tap_close();\n    }\n\n    if ((fd = open(\"\/dev\/net\/tun\", O_RDWR | O_NONBLOCK)) < 0) {\n      throw eTapDevOpenFailed(\n          \"ctapdev::tap_open() opening \/dev\/net\/tun failed\");\n    }\n\n    memset(&ifr, 0, sizeof(ifr));\n\n    \/* Flags: IFF_TUN   - TUN device (no Ethernet headers)\n     *        IFF_TAP   - TAP device\n     *\n     *        IFF_NO_PI - Do not provide packet information\n     *\/\n    ifr.ifr_flags = IFF_TAP | IFF_NO_PI;\n    strncpy(ifr.ifr_name, devname.c_str(), IFNAMSIZ);\n\n    if ((rc = ioctl(fd, TUNSETIFF, (void *)&ifr)) < 0) {\n      close(fd);\n      throw eTapDevIoctlFailed(\"ctapdev::tap_open() setting flags IFF_TAP | \"\n                               \"IFF_NO_PI on \/dev\/net\/tun failed\");\n    }\n\n    thread.start();\n    thread.add_read_fd(fd);\n    thread.add_write_fd(fd);\n\n  } catch (eTapDevOpenFailed &e) {\n    rofcore::logging::error\n        << \"ctapdev::tap_open() open() failed, dev:\" << devname << std::endl\n        << rofl::eSysCall(\"open\");\n    throw;\n  } catch (eTapDevIoctlFailed &e) {\n    rofcore::logging::error\n        << \"ctapdev::tap_open() open() failed, dev:\" << devname << std::endl\n        << rofl::eSysCall(\"ctapdev ioctl\");\n    throw;\n  }\n}\n\nvoid ctapdev::tap_close() {\n  if (fd == -1) {\n    return;\n  }\n\n  thread.drop_read_fd(fd, false);\n  thread.drop_write_fd(fd, false);\n\n  close(fd);\n\n  fd = -1;\n}\n\nvoid ctapdev::enqueue(rofl::cpacket *pkt) {\n  if (fd == -1) {\n    cpacketpool::get_instance().release_pkt(pkt);\n    return;\n  }\n\n  \/\/ store pkt in outgoing queue\n  {\n    rofl::AcquireReadWriteLock rwlock(pout_queue_rwlock);\n    pout_queue.push_back(pkt);\n  }\n\n  thread.wakeup();\n}\n\nvoid ctapdev::enqueue(std::vector<rofl::cpacket *> pkts) {\n  if (fd == -1) {\n    for (std::vector<rofl::cpacket *>::iterator it = pkts.begin();\n         it != pkts.end(); ++it) {\n      cpacketpool::get_instance().release_pkt((*it));\n    }\n    return;\n  }\n\n  \/\/ store pkts in outgoing queue\n  {\n    rofl::AcquireReadWriteLock rwlock(pout_queue_rwlock);\n    for (std::vector<rofl::cpacket *>::iterator it = pkts.begin();\n         it != pkts.end(); ++it) {\n      pout_queue.push_back(*it);\n    }\n  }\n\n  thread.wakeup();\n}\n\nvoid ctapdev::handle_read_event(rofl::cthread &thread, int fd) {\n  rofl::cpacket *pkt = NULL;\n  try {\n\n    rofl::cmemory mem(1518);\n\n    int rc = read(fd, mem.somem(), mem.memlen());\n\n    \/\/ error occured (or non-blocking)\n    if (rc < 0) {\n      switch (errno) {\n      case EAGAIN:\n        rofcore::logging::error\n            << \"ctapdev::handle_revent() EAGAIN, retrying later\" << std::endl;\n      default:\n        rofcore::logging::error << \"ctapdev::handle_revent() error occured\"\n                                << std::endl;\n      }\n    } else {\n      pkt = cpacketpool::get_instance().acquire_pkt();\n\n      pkt->unpack(mem.somem(), rc);\n\n      cb.enqueue(this, pkt);\n    }\n\n  } catch (ePacketPoolExhausted &e) {\n    rofcore::logging::error << \"ctapdev::handle_revent() packet pool \"\n                               \"exhausted, no idle slots available\"\n                            << std::endl;\n  }\n}\n\nvoid ctapdev::handle_write_event(rofl::cthread &thread, int fd) { tx(); }\n\nstatic inline void release_packets(std::deque<rofl::cpacket *> &q) {\n  for (auto i : q) {\n    cpacketpool::get_instance().release_pkt(i);\n  }\n}\n\nvoid ctapdev::tx() {\n  rofl::cpacket *pkt = NULL;\n  std::deque<rofl::cpacket *> out_queue;\n\n  {\n    rofl::AcquireReadWriteLock rwlock(pout_queue_rwlock);\n    out_queue = std::move(pout_queue);\n  }\n\n  while (not out_queue.empty()) {\n\n    pkt = out_queue.front();\n    int rc = 0;\n    if ((rc = write(fd, pkt->soframe(), pkt->length())) < 0) {\n      switch (errno) {\n      case EAGAIN:\n        rofcore::logging::debug << \"ctapdev::tx() EAGAIN\" << std::endl;\n        {\n          rofl::AcquireReadWriteLock rwlock(pout_queue_rwlock);\n          std::move(out_queue.rbegin(), out_queue.rend(),\n                    std::front_inserter(pout_queue));\n        }\n        return;\n      case EIO:\n        \/\/ tap not enabled drop packet\n        release_packets(out_queue);\n        return;\n      default:\n        \/\/ will drop packets\n        release_packets(out_queue);\n        rofcore::logging::error\n            << \"ctapdev::tx() unknown error occured rc=\" << rc\n            << \" errno=\" << errno << \" '\" << strerror(errno) << std::endl;\n        return;\n      }\n    }\n    cpacketpool::get_instance().release_pkt(pkt);\n    out_queue.pop_front();\n  }\n}\n\nvoid ctapdev::handle_timeout(rofl::cthread &thread, uint32_t timer_id,\n                             const std::list<unsigned int> &ttypes) {\n  switch (timer_id) {\n  case CTAPDEV_TIMER_OPEN_PORT: {\n    try {\n      tap_open();\n    } catch (...) {\n      thread.add_timer(CTAPDEV_TIMER_OPEN_PORT, rofl::ctimespec().expire_in(1));\n    }\n  } break;\n  }\n}\n\n} \/\/ namespace rofcore\n<|endoftext|>"}
{"text":"<commit_before>#include \"binary.h\"\n#include \"options.h\"\n#include <llvm\/ADT\/Triple.h>\n#include <llvm\/Support\/Host.h>\n#include <llvm\/Support\/FileSystem.h>\n#include <llvm\/Support\/TargetRegistry.h>\n#include \"llvm\/Support\/ToolOutputFile.h\"\n#include \"llvm\/Support\/FormattedStream.h\"\n#include \"llvm\/Target\/TargetLibraryInfo.h\"\n#include \"llvm\/Target\/TargetMachine.h\"\n#include \"llvm\/Support\/TargetSelect.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/PassManager.h\"\n#include <iostream>\n\nstatic llvm::tool_output_file *GetOutputStream(const std::string& filename) \n{\n    \/\/ Open the file.\n    std::string error;\n    llvm::sys::fs::OpenFlags OpenFlags = llvm::sys::fs::F_None;\n    llvm::tool_output_file *FDOut = new llvm::tool_output_file(filename.c_str(), error,\n\t\t\t\t\t\t\t       OpenFlags);\n    if (!error.empty()) \n    {\n\tstd::cerr << error << '\\n';\n\tdelete FDOut;\n\treturn 0;\n    }\n    \n    return FDOut;\n}\n\nstatic void CreateObject(llvm::Module *module, const std::string& objname)\n{\n    llvm::InitializeAllTargets();\n    llvm::InitializeAllTargetMCs();\n    llvm::InitializeAllAsmPrinters();\n    llvm::InitializeAllAsmParsers();\n\n    llvm::Triple triple(llvm::sys::getDefaultTargetTriple());\n\n    module->setTargetTriple(triple.getTriple());\n\n    std::string error;\n    const llvm::Target *target = llvm::TargetRegistry::lookupTarget(\"\", triple, error);\n    \n    if (!target)\n    {\n\tstd::cerr << \"Error, could not find target: \" << error << std::endl;\n\treturn;\n    }\n\n    llvm::TargetOptions options;\n    llvm::TargetMachine* tm = target->createTargetMachine(triple.getTriple(), \"\", \"\", options);\n\n    if (!tm)\n    {\n\tstd::cerr << \"Error: Could not create targetmachine.\" << std::endl;\n\treturn;\n    }\n\n    llvm::PassManager PM;\n    llvm::TargetLibraryInfo *TLI = new llvm::TargetLibraryInfo(triple);\n    PM.add(TLI);\n    tm->setAsmVerbosityDefault(true);\n\n    std::unique_ptr<llvm::tool_output_file> Out(GetOutputStream(objname));\n    if (!Out) \n    {\n\tstd::cerr << \"Could not open file ... \" << std::endl;\n\treturn;\n    }\n\n    llvm::formatted_raw_ostream FOS(Out->os());\n\n    llvm::AnalysisID StartAfterID = 0;\n    llvm::AnalysisID StopAfterID = 0;\n    if (tm->addPassesToEmitFile(PM, FOS, llvm::LLVMTargetMachine::CGFT_ObjectFile, false,\n                                   StartAfterID, StopAfterID)) \n    {\n\tstd::cerr << objname << \": target does not support generation of this\"\n\t       << \" file type!\\n\";\n\treturn;\n    }\n    PM.run(*module);\n    Out->keep();\n}\n\n\nstd::string replace_ext(const std::string &origName, \n\t\t\tconst std::string& expectedExt, \n\t\t\tconst std::string& newExt)\n{\n    if (origName.substr(origName.size() - expectedExt.size()) != expectedExt)\n    {\n\tstd::cerr << \"Could not find extension...\" << std::endl;\n\texit(1);\n    }\n    return origName.substr(0, origName.size() - expectedExt.size()) + newExt;\n}\n\n\nvoid CreateBinary(llvm::Module *module, const std::string& filename, EmitType emit)\n{\n    if (emit == Exe)\n    {\n\tstd::string objname = replace_ext(filename, \".pas\", \".o\");\n\tstd::string exename = replace_ext(filename, \".pas\", \"\");\n\tCreateObject(module, objname);\n\tstd::string cmd = std::string(\"clang \") + objname + \" runtime.o -lm -o \" + exename; \n\tif (verbosity)\n\t{\n\t    std::cerr << \"Executing final link command: \" << cmd << std::endl;\n\t}\n\tsystem(cmd.c_str());\n\treturn;\n    }\n    if (emit == LlvmIr)\n    {\n\tstd::string irName = replace_ext(filename, \".pas\", \".ll\");\n\tstd::unique_ptr<llvm::tool_output_file> Out(GetOutputStream(irName));\n\tllvm::formatted_raw_ostream FOS(Out->os());\n\tmodule->print(FOS, 0);\n\tOut->keep();\n\treturn;\n    }\n\n    assert(0 && \"Unknown emit type\");\n}\n<commit_msg>Fixes for llvm 3.6<commit_after>#include \"binary.h\"\n#include \"options.h\"\n#include <llvm\/ADT\/Triple.h>\n#include <llvm\/Support\/Host.h>\n#include <llvm\/Support\/FileSystem.h>\n#include <llvm\/Support\/TargetRegistry.h>\n#include \"llvm\/Support\/ToolOutputFile.h\"\n#include \"llvm\/Support\/FormattedStream.h\"\n#include \"llvm\/Target\/TargetLibraryInfo.h\"\n#include \"llvm\/Target\/TargetMachine.h\"\n#include \"llvm\/Support\/TargetSelect.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/PassManager.h\"\n#include <iostream>\n#include <system_error>\n\nstatic llvm::tool_output_file *GetOutputStream(const std::string& filename) \n{\n    \/\/ Open the file.\n    std::error_code error;\n    llvm::sys::fs::OpenFlags OpenFlags = llvm::sys::fs::F_None;\n    llvm::tool_output_file *FDOut = new llvm::tool_output_file(filename, error,\n\t\t\t\t\t\t\t       OpenFlags);\n    if (error) \n    {\n\tstd::cerr << error << '\\n';\n\tdelete FDOut;\n\treturn 0;\n    }\n    \n    return FDOut;\n}\n\nstatic void CreateObject(llvm::Module *module, const std::string& objname)\n{\n    llvm::InitializeAllTargets();\n    llvm::InitializeAllTargetMCs();\n    llvm::InitializeAllAsmPrinters();\n    llvm::InitializeAllAsmParsers();\n\n    llvm::Triple triple(llvm::sys::getDefaultTargetTriple());\n\n    module->setTargetTriple(triple.getTriple());\n\n    std::string error;\n    const llvm::Target *target = llvm::TargetRegistry::lookupTarget(\"\", triple, error);\n    \n    if (!target)\n    {\n\tstd::cerr << \"Error, could not find target: \" << error << std::endl;\n\treturn;\n    }\n\n    llvm::TargetOptions options;\n    llvm::TargetMachine* tm = target->createTargetMachine(triple.getTriple(), \"\", \"\", options);\n\n    if (!tm)\n    {\n\tstd::cerr << \"Error: Could not create targetmachine.\" << std::endl;\n\treturn;\n    }\n\n    llvm::PassManager PM;\n    llvm::TargetLibraryInfo *TLI = new llvm::TargetLibraryInfo(triple);\n    PM.add(TLI);\n    tm->setAsmVerbosityDefault(true);\n\n    std::unique_ptr<llvm::tool_output_file> Out(GetOutputStream(objname));\n    if (!Out) \n    {\n\tstd::cerr << \"Could not open file ... \" << std::endl;\n\treturn;\n    }\n\n    llvm::formatted_raw_ostream FOS(Out->os());\n\n    llvm::AnalysisID StartAfterID = 0;\n    llvm::AnalysisID StopAfterID = 0;\n    if (tm->addPassesToEmitFile(PM, FOS, llvm::LLVMTargetMachine::CGFT_ObjectFile, false,\n                                   StartAfterID, StopAfterID)) \n    {\n\tstd::cerr << objname << \": target does not support generation of this\"\n\t       << \" file type!\\n\";\n\treturn;\n    }\n    PM.run(*module);\n    Out->keep();\n}\n\n\nstd::string replace_ext(const std::string &origName, \n\t\t\tconst std::string& expectedExt, \n\t\t\tconst std::string& newExt)\n{\n    if (origName.substr(origName.size() - expectedExt.size()) != expectedExt)\n    {\n\tstd::cerr << \"Could not find extension...\" << std::endl;\n\texit(1);\n    }\n    return origName.substr(0, origName.size() - expectedExt.size()) + newExt;\n}\n\n\nvoid CreateBinary(llvm::Module *module, const std::string& filename, EmitType emit)\n{\n    if (emit == Exe)\n    {\n\tstd::string objname = replace_ext(filename, \".pas\", \".o\");\n\tstd::string exename = replace_ext(filename, \".pas\", \"\");\n\tCreateObject(module, objname);\n\tstd::string cmd = std::string(\"clang \") + objname + \" runtime.o -lm -o \" + exename; \n\tif (verbosity)\n\t{\n\t    std::cerr << \"Executing final link command: \" << cmd << std::endl;\n\t}\n\tsystem(cmd.c_str());\n\treturn;\n    }\n    if (emit == LlvmIr)\n    {\n\tstd::string irName = replace_ext(filename, \".pas\", \".ll\");\n\tstd::unique_ptr<llvm::tool_output_file> Out(GetOutputStream(irName));\n\tllvm::formatted_raw_ostream FOS(Out->os());\n\tmodule->print(FOS, 0);\n\tOut->keep();\n\treturn;\n    }\n\n    assert(0 && \"Unknown emit type\");\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * Copyright (c) 2015 - The CM Authors <legal@clickmatcher.com>\n *   All Rights Reserved.\n *\n * This file is CONFIDENTIAL -- Distribution or duplication of this material or\n * the information contained herein is strictly forbidden unless prior written\n * permission is obtained.\n *\/\n#include <stdlib.h>\n#include <unistd.h>\n#include <signal.h>\n#include \"fnord-base\/io\/filerepository.h\"\n#include \"fnord-base\/io\/fileutil.h\"\n#include \"fnord-base\/application.h\"\n#include \"fnord-base\/logging.h\"\n#include \"fnord-base\/random.h\"\n#include \"fnord-base\/thread\/eventloop.h\"\n#include \"fnord-base\/thread\/threadpool.h\"\n#include \"fnord-base\/thread\/FixedSizeThreadPool.h\"\n#include \"fnord-base\/wallclock.h\"\n#include \"fnord-base\/VFS.h\"\n#include \"fnord-rpc\/ServerGroup.h\"\n#include \"fnord-rpc\/RPC.h\"\n#include \"fnord-rpc\/RPCClient.h\"\n#include \"fnord-base\/cli\/flagparser.h\"\n#include \"fnord-json\/json.h\"\n#include \"fnord-json\/jsonrpc.h\"\n#include \"fnord-http\/httprouter.h\"\n#include \"fnord-http\/httpserver.h\"\n#include \"fnord-http\/VFSFileServlet.h\"\n#include \"fnord-feeds\/FeedService.h\"\n#include \"fnord-feeds\/RemoteFeedFactory.h\"\n#include \"fnord-feeds\/RemoteFeedReader.h\"\n#include \"fnord-base\/stats\/statsdagent.h\"\n#include \"fnord-sstable\/SSTableServlet.h\"\n#include \"fnord-logtable\/LogTableServlet.h\"\n#include \"fnord-logtable\/TableRepository.h\"\n#include \"fnord-logtable\/TableJanitor.h\"\n#include \"fnord-logtable\/TableReplication.h\"\n#include \"fnord-logtable\/ArtifactReplication.h\"\n#include \"fnord-logtable\/ArtifactIndexReplication.h\"\n#include \"fnord-logtable\/NumericBoundsSummary.h\"\n#include \"fnord-mdb\/MDB.h\"\n#include \"fnord-mdb\/MDBUtil.h\"\n#include \"fnord-tsdb\/TSDBNode.h\"\n#include \"fnord-tsdb\/TSDBServlet.h\"\n#include \"common.h\"\n#include \"schemas.h\"\n#include \"ModelReplication.h\"\n\nusing namespace fnord;\n\nstd::atomic<bool> shutdown_sig;\nfnord::thread::EventLoop ev;\n\nvoid quit(int n) {\n  shutdown_sig = true;\n  fnord::logInfo(\"cm.chunkserver\", \"Shutting down...\");\n  \/\/ FIXPAUL: wait for http server stop...\n  ev.shutdown();\n}\n\nint main(int argc, const char** argv) {\n  fnord::Application::init();\n  fnord::Application::logToStderr();\n\n  \/* shutdown hook *\/\n  shutdown_sig = false;\n  struct sigaction sa;\n  memset(&sa, 0, sizeof(struct sigaction));\n  sa.sa_handler = quit;\n  sigaction(SIGTERM, &sa, NULL);\n  sigaction(SIGQUIT, &sa, NULL);\n  sigaction(SIGINT, &sa, NULL);\n\n  fnord::cli::FlagParser flags;\n\n  flags.defineFlag(\n      \"http_port\",\n      fnord::cli::FlagParser::T_INTEGER,\n      false,\n      NULL,\n      \"8000\",\n      \"Start the public http server on this port\",\n      \"<port>\");\n\n  flags.defineFlag(\n      \"readonly\",\n      cli::FlagParser::T_SWITCH,\n      false,\n      NULL,\n      NULL,\n      \"readonly\",\n      \"readonly\");\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      true,\n      NULL,\n      NULL,\n      \"datadir path\",\n      \"<path>\");\n\n  flags.defineFlag(\n      \"replicate_from\",\n      cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"url\",\n      \"<url>\");\n\n  flags.defineFlag(\n      \"fsck\",\n      cli::FlagParser::T_SWITCH,\n      false,\n      NULL,\n      NULL,\n      \"fsck\",\n      \"fsck\");\n\n  flags.defineFlag(\n      \"repair\",\n      cli::FlagParser::T_SWITCH,\n      false,\n      NULL,\n      NULL,\n      \"repair\",\n      \"repair\");\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  \/* args *\/\n  auto dir = flags.getString(\"datadir\");\n  auto readonly = flags.isSet(\"readonly\");\n  auto replica = flags.getString(\"replica\");\n  auto repl_sources = flags.getStrings(\"replicate_from\");\n\n  Vector<URI> artifact_sources;\n  for (const auto& rep : repl_sources) {\n    artifact_sources.emplace_back(\n        URI(StringUtil::format(\"http:\/\/$0:7005\/\", rep)));\n  }\n\n  \/* start http server and worker pools *\/\n  fnord::thread::ThreadPool tpool;\n  fnord::thread::FixedSizeThreadPool wpool(8);\n  fnord::thread::FixedSizeThreadPool repl_wpool(8);\n  http::HTTPConnectionPool http(&ev);\n  fnord::http::HTTPRouter http_router;\n  fnord::http::HTTPServer http_server(&http_router, &ev);\n  http_server.listen(flags.getInt(\"http_port\"));\n  wpool.start();\n  repl_wpool.start();\n\n  \/* artifact replication *\/\n  logtable::ArtifactReplication artifact_replication(\n      &http,\n      &repl_wpool,\n      8);\n\n  \/* model replication *\/\n  ModelReplication model_replication;\n\n  if (!readonly) {\n    model_replication.addArtifactIndexReplication(\n        \"termstats\",\n        dir,\n        artifact_sources,\n        &artifact_replication,\n        &http);\n  }\n\n  \/* logtable *\/\n  logtable::TableRepository table_repo(\n      dir,\n      replica,\n      readonly,\n      &wpool);\n\n  auto joined_sessions_schema = joinedSessionsSchema();\n  table_repo.addTable(\"joined_sessions-dawanda\", joined_sessions_schema);\n  table_repo.addTable(\"index_feed-dawanda\", indexChangeRequestSchema());\n  Set<String> tbls  = { \"joined_sessions-dawanda\", \"index_feed-dawanda\" };\n\n  logtable::TableReplication table_replication(&http);\n  if (!readonly) {\n    for (const auto& tbl : tbls) {\n      auto table = table_repo.findTableWriter(tbl);\n\n      if (StringUtil::beginsWith(tbl, \"joined_sessions\")) {\n        table->addSummary([joined_sessions_schema] () {\n          return new logtable::NumericBoundsSummaryBuilder(\n              \"search_queries.time-bounds\",\n              joined_sessions_schema.id(\"search_queries.time\"));\n        });\n      }\n\n      table->runConsistencyCheck(\n          flags.isSet(\"fsck\"),\n          flags.isSet(\"repair\"));\n\n      for (const auto& rep : repl_sources) {\n        table_replication.replicateTableFrom(\n            table,\n            URI(StringUtil::format(\"http:\/\/$0:7003\/logtable\", rep)));\n      }\n\n      if (artifact_sources.size() > 0) {\n        artifact_replication.replicateArtifactsFrom(\n            table->artifactIndex(),\n            artifact_sources);\n      }\n    }\n  }\n\n  logtable::TableJanitor table_janitor(&table_repo);\n  \/\/if (!readonly) {\n  \/\/  table_janitor.start();\n  \/\/  table_replication.start();\n  \/\/  artifact_replication.start();\n  \/\/  model_replication.start();\n  \/\/}\n\n  logtable::LogTableServlet logtable_servlet(&table_repo);\n  http_router.addRouteByPrefixMatch(\"\/logtable\", &logtable_servlet, &tpool);\n\n  tsdb::TSDBNode tsdb_node(\"xxx\", \"\/tmp\/tsdb\");\n  tsdb::TSDBServlet tsdb_servlet(&tsdb_node);\n  http_router.addRouteByPrefixMatch(\"\/tsdb\", &tsdb_servlet, &tpool);\n\n  ev.run();\n\n  \/\/if (!readonly) {\n  \/\/  table_janitor.stop();\n  \/\/  table_janitor.check();\n  \/\/  table_replication.stop();\n  \/\/  artifact_replication.stop();\n  \/\/  model_replication.stop();\n  \/\/}\n\n  fnord::logInfo(\"cm.chunkserver\", \"Exiting...\");\n\n  exit(0);\n}\n\n<commit_msg>TSDBNode::configurePrefix<commit_after>\/**\n * Copyright (c) 2015 - The CM Authors <legal@clickmatcher.com>\n *   All Rights Reserved.\n *\n * This file is CONFIDENTIAL -- Distribution or duplication of this material or\n * the information contained herein is strictly forbidden unless prior written\n * permission is obtained.\n *\/\n#include <stdlib.h>\n#include <unistd.h>\n#include <signal.h>\n#include \"fnord-base\/io\/filerepository.h\"\n#include \"fnord-base\/io\/fileutil.h\"\n#include \"fnord-base\/application.h\"\n#include \"fnord-base\/logging.h\"\n#include \"fnord-base\/random.h\"\n#include \"fnord-base\/thread\/eventloop.h\"\n#include \"fnord-base\/thread\/threadpool.h\"\n#include \"fnord-base\/thread\/FixedSizeThreadPool.h\"\n#include \"fnord-base\/wallclock.h\"\n#include \"fnord-base\/VFS.h\"\n#include \"fnord-rpc\/ServerGroup.h\"\n#include \"fnord-rpc\/RPC.h\"\n#include \"fnord-rpc\/RPCClient.h\"\n#include \"fnord-base\/cli\/flagparser.h\"\n#include \"fnord-json\/json.h\"\n#include \"fnord-json\/jsonrpc.h\"\n#include \"fnord-http\/httprouter.h\"\n#include \"fnord-http\/httpserver.h\"\n#include \"fnord-http\/VFSFileServlet.h\"\n#include \"fnord-feeds\/FeedService.h\"\n#include \"fnord-feeds\/RemoteFeedFactory.h\"\n#include \"fnord-feeds\/RemoteFeedReader.h\"\n#include \"fnord-base\/stats\/statsdagent.h\"\n#include \"fnord-sstable\/SSTableServlet.h\"\n#include \"fnord-logtable\/LogTableServlet.h\"\n#include \"fnord-logtable\/TableRepository.h\"\n#include \"fnord-logtable\/TableJanitor.h\"\n#include \"fnord-logtable\/TableReplication.h\"\n#include \"fnord-logtable\/ArtifactReplication.h\"\n#include \"fnord-logtable\/ArtifactIndexReplication.h\"\n#include \"fnord-logtable\/NumericBoundsSummary.h\"\n#include \"fnord-mdb\/MDB.h\"\n#include \"fnord-mdb\/MDBUtil.h\"\n#include \"fnord-tsdb\/TSDBNode.h\"\n#include \"fnord-tsdb\/TSDBServlet.h\"\n#include \"common.h\"\n#include \"schemas.h\"\n#include \"ModelReplication.h\"\n\nusing namespace fnord;\n\nstd::atomic<bool> shutdown_sig;\nfnord::thread::EventLoop ev;\n\nvoid quit(int n) {\n  shutdown_sig = true;\n  fnord::logInfo(\"cm.chunkserver\", \"Shutting down...\");\n  \/\/ FIXPAUL: wait for http server stop...\n  ev.shutdown();\n}\n\nint main(int argc, const char** argv) {\n  fnord::Application::init();\n  fnord::Application::logToStderr();\n\n  \/* shutdown hook *\/\n  shutdown_sig = false;\n  struct sigaction sa;\n  memset(&sa, 0, sizeof(struct sigaction));\n  sa.sa_handler = quit;\n  sigaction(SIGTERM, &sa, NULL);\n  sigaction(SIGQUIT, &sa, NULL);\n  sigaction(SIGINT, &sa, NULL);\n\n  fnord::cli::FlagParser flags;\n\n  flags.defineFlag(\n      \"http_port\",\n      fnord::cli::FlagParser::T_INTEGER,\n      false,\n      NULL,\n      \"8000\",\n      \"Start the public http server on this port\",\n      \"<port>\");\n\n  flags.defineFlag(\n      \"readonly\",\n      cli::FlagParser::T_SWITCH,\n      false,\n      NULL,\n      NULL,\n      \"readonly\",\n      \"readonly\");\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      true,\n      NULL,\n      NULL,\n      \"datadir path\",\n      \"<path>\");\n\n  flags.defineFlag(\n      \"replicate_from\",\n      cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"url\",\n      \"<url>\");\n\n  flags.defineFlag(\n      \"fsck\",\n      cli::FlagParser::T_SWITCH,\n      false,\n      NULL,\n      NULL,\n      \"fsck\",\n      \"fsck\");\n\n  flags.defineFlag(\n      \"repair\",\n      cli::FlagParser::T_SWITCH,\n      false,\n      NULL,\n      NULL,\n      \"repair\",\n      \"repair\");\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  \/* args *\/\n  auto dir = flags.getString(\"datadir\");\n  auto readonly = flags.isSet(\"readonly\");\n  auto replica = flags.getString(\"replica\");\n  auto repl_sources = flags.getStrings(\"replicate_from\");\n\n  Vector<URI> artifact_sources;\n  for (const auto& rep : repl_sources) {\n    artifact_sources.emplace_back(\n        URI(StringUtil::format(\"http:\/\/$0:7005\/\", rep)));\n  }\n\n  \/* start http server and worker pools *\/\n  fnord::thread::ThreadPool tpool;\n  fnord::thread::FixedSizeThreadPool wpool(8);\n  fnord::thread::FixedSizeThreadPool repl_wpool(8);\n  http::HTTPConnectionPool http(&ev);\n  fnord::http::HTTPRouter http_router;\n  fnord::http::HTTPServer http_server(&http_router, &ev);\n  http_server.listen(flags.getInt(\"http_port\"));\n  wpool.start();\n  repl_wpool.start();\n\n  \/* artifact replication *\/\n  logtable::ArtifactReplication artifact_replication(\n      &http,\n      &repl_wpool,\n      8);\n\n  \/* model replication *\/\n  ModelReplication model_replication;\n\n  if (!readonly) {\n    model_replication.addArtifactIndexReplication(\n        \"termstats\",\n        dir,\n        artifact_sources,\n        &artifact_replication,\n        &http);\n  }\n\n  \/* logtable *\/\n  logtable::TableRepository table_repo(\n      dir,\n      replica,\n      readonly,\n      &wpool);\n\n  auto joined_sessions_schema = joinedSessionsSchema();\n  table_repo.addTable(\"joined_sessions-dawanda\", joined_sessions_schema);\n  table_repo.addTable(\"index_feed-dawanda\", indexChangeRequestSchema());\n  Set<String> tbls  = { \"joined_sessions-dawanda\", \"index_feed-dawanda\" };\n\n  logtable::TableReplication table_replication(&http);\n  if (!readonly) {\n    for (const auto& tbl : tbls) {\n      auto table = table_repo.findTableWriter(tbl);\n\n      if (StringUtil::beginsWith(tbl, \"joined_sessions\")) {\n        table->addSummary([joined_sessions_schema] () {\n          return new logtable::NumericBoundsSummaryBuilder(\n              \"search_queries.time-bounds\",\n              joined_sessions_schema.id(\"search_queries.time\"));\n        });\n      }\n\n      table->runConsistencyCheck(\n          flags.isSet(\"fsck\"),\n          flags.isSet(\"repair\"));\n\n      for (const auto& rep : repl_sources) {\n        table_replication.replicateTableFrom(\n            table,\n            URI(StringUtil::format(\"http:\/\/$0:7003\/logtable\", rep)));\n      }\n\n      if (artifact_sources.size() > 0) {\n        artifact_replication.replicateArtifactsFrom(\n            table->artifactIndex(),\n            artifact_sources);\n      }\n    }\n  }\n\n  logtable::TableJanitor table_janitor(&table_repo);\n  \/\/if (!readonly) {\n  \/\/  table_janitor.start();\n  \/\/  table_replication.start();\n  \/\/  artifact_replication.start();\n  \/\/  model_replication.start();\n  \/\/}\n\n  logtable::LogTableServlet logtable_servlet(&table_repo);\n  http_router.addRouteByPrefixMatch(\"\/logtable\", &logtable_servlet, &tpool);\n\n  tsdb::TSDBNode tsdb_node(\"xxx\", \"\/tmp\/tsdb\");\n  tsdb_node.configurePrefix(\n      \"b\",\n      tsdb::StreamProperties(new msg::MessageSchema(joinedSessionsSchema())));\n\n  tsdb::TSDBServlet tsdb_servlet(&tsdb_node);\n  http_router.addRouteByPrefixMatch(\"\/tsdb\", &tsdb_servlet, &tpool);\n\n  ev.run();\n\n  \/\/if (!readonly) {\n  \/\/  table_janitor.stop();\n  \/\/  table_janitor.check();\n  \/\/  table_replication.stop();\n  \/\/  artifact_replication.stop();\n  \/\/  model_replication.stop();\n  \/\/}\n\n  fnord::logInfo(\"cm.chunkserver\", \"Exiting...\");\n\n  exit(0);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * Copyright (c) 2015 - The CM Authors <legal@clickmatcher.com>\n *   All Rights Reserved.\n *\n * This file is CONFIDENTIAL -- Distribution or duplication of this material or\n * the information contained herein is strictly forbidden unless prior written\n * permission is obtained.\n *\/\n#include <stdlib.h>\n#include <unistd.h>\n#include <signal.h>\n#include \"fnord-base\/io\/filerepository.h\"\n#include \"fnord-base\/io\/fileutil.h\"\n#include \"fnord-base\/application.h\"\n#include \"fnord-base\/logging.h\"\n#include \"fnord-base\/random.h\"\n#include \"fnord-base\/thread\/eventloop.h\"\n#include \"fnord-base\/thread\/threadpool.h\"\n#include \"fnord-base\/thread\/FixedSizeThreadPool.h\"\n#include \"fnord-base\/wallclock.h\"\n#include \"fnord-base\/VFS.h\"\n#include \"fnord-rpc\/ServerGroup.h\"\n#include \"fnord-rpc\/RPC.h\"\n#include \"fnord-rpc\/RPCClient.h\"\n#include \"fnord-base\/cli\/flagparser.h\"\n#include \"fnord-json\/json.h\"\n#include \"fnord-json\/jsonrpc.h\"\n#include \"fnord-http\/httprouter.h\"\n#include \"fnord-http\/httpserver.h\"\n#include \"fnord-http\/VFSFileServlet.h\"\n#include \"fnord-feeds\/FeedService.h\"\n#include \"fnord-feeds\/RemoteFeedFactory.h\"\n#include \"fnord-feeds\/RemoteFeedReader.h\"\n#include \"fnord-base\/stats\/statsdagent.h\"\n#include \"fnord-sstable\/SSTableServlet.h\"\n#include \"fnord-logtable\/LogTableServlet.h\"\n#include \"fnord-logtable\/TableRepository.h\"\n#include \"fnord-logtable\/TableJanitor.h\"\n#include \"fnord-logtable\/TableReplication.h\"\n#include \"fnord-logtable\/ArtifactReplication.h\"\n#include \"fnord-logtable\/ArtifactIndexReplication.h\"\n#include \"fnord-logtable\/NumericBoundsSummary.h\"\n#include \"fnord-mdb\/MDB.h\"\n#include \"fnord-mdb\/MDBUtil.h\"\n#include \"fnord-tsdb\/TSDBNode.h\"\n#include \"fnord-tsdb\/TSDBServlet.h\"\n#include \"common.h\"\n#include \"schemas.h\"\n#include \"ModelReplication.h\"\n\nusing namespace fnord;\n\nstd::atomic<bool> shutdown_sig;\nfnord::thread::EventLoop ev;\n\nvoid quit(int n) {\n  shutdown_sig = true;\n  fnord::logInfo(\"cm.chunkserver\", \"Shutting down...\");\n  \/\/ FIXPAUL: wait for http server stop...\n  ev.shutdown();\n}\n\nint main(int argc, const char** argv) {\n  fnord::Application::init();\n  fnord::Application::logToStderr();\n\n  \/* shutdown hook *\/\n  shutdown_sig = false;\n  struct sigaction sa;\n  memset(&sa, 0, sizeof(struct sigaction));\n  sa.sa_handler = quit;\n  sigaction(SIGTERM, &sa, NULL);\n  sigaction(SIGQUIT, &sa, NULL);\n  sigaction(SIGINT, &sa, NULL);\n\n  fnord::cli::FlagParser flags;\n\n  flags.defineFlag(\n      \"http_port\",\n      fnord::cli::FlagParser::T_INTEGER,\n      false,\n      NULL,\n      \"8000\",\n      \"Start the public http server on this port\",\n      \"<port>\");\n\n  flags.defineFlag(\n      \"datadir\",\n      cli::FlagParser::T_STRING,\n      true,\n      NULL,\n      NULL,\n      \"datadir path\",\n      \"<path>\");\n\n  flags.defineFlag(\n      \"replicate_to\",\n      cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"url\",\n      \"<url>\");\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  \/* args *\/\n  auto dir = flags.getString(\"datadir\");\n  auto repl_targets = flags.getStrings(\"replicate_to\");\n\n  \/* start http server and worker pools *\/\n  fnord::thread::ThreadPool tpool;\n  http::HTTPConnectionPool http(&ev);\n  fnord::http::HTTPRouter http_router;\n  fnord::http::HTTPServer http_server(&http_router, &ev);\n  http_server.listen(flags.getInt(\"http_port\"));\n\n  auto repl_scheme = mkRef(new dht::FixedReplicationScheme());\n  for (const auto& r : repl_targets) {\n    repl_scheme->addHost(r);\n  }\n\n  tsdb::TSDBNode tsdb_node(dir + \"\/tsdb\", repl_scheme.get(), &http);\n\n  tsdb::StreamProperties config(new msg::MessageSchema(joinedSessionsSchema()));\n  config.max_datafile_size = 1024 * 1024 * 512;\n  config.chunk_size = Duration(3600 * 4 * kMicrosPerSecond);\n  config.compaction_interval = Duration(3 * kMicrosPerSecond);\n  tsdb_node.configurePrefix(\"joined_sessions.\", config);\n\n  tsdb::TSDBServlet tsdb_servlet(&tsdb_node);\n  http_router.addRouteByPrefixMatch(\"\/tsdb\", &tsdb_servlet, &tpool);\n\n  tsdb_node.start();\n  ev.run();\n\n  tsdb_node.stop();\n  fnord::logInfo(\"cm.chunkserver\", \"Exiting...\");\n\n  exit(0);\n}\n\n<commit_msg>30s commit interval<commit_after>\/**\n * Copyright (c) 2015 - The CM Authors <legal@clickmatcher.com>\n *   All Rights Reserved.\n *\n * This file is CONFIDENTIAL -- Distribution or duplication of this material or\n * the information contained herein is strictly forbidden unless prior written\n * permission is obtained.\n *\/\n#include <stdlib.h>\n#include <unistd.h>\n#include <signal.h>\n#include \"fnord-base\/io\/filerepository.h\"\n#include \"fnord-base\/io\/fileutil.h\"\n#include \"fnord-base\/application.h\"\n#include \"fnord-base\/logging.h\"\n#include \"fnord-base\/random.h\"\n#include \"fnord-base\/thread\/eventloop.h\"\n#include \"fnord-base\/thread\/threadpool.h\"\n#include \"fnord-base\/thread\/FixedSizeThreadPool.h\"\n#include \"fnord-base\/wallclock.h\"\n#include \"fnord-base\/VFS.h\"\n#include \"fnord-rpc\/ServerGroup.h\"\n#include \"fnord-rpc\/RPC.h\"\n#include \"fnord-rpc\/RPCClient.h\"\n#include \"fnord-base\/cli\/flagparser.h\"\n#include \"fnord-json\/json.h\"\n#include \"fnord-json\/jsonrpc.h\"\n#include \"fnord-http\/httprouter.h\"\n#include \"fnord-http\/httpserver.h\"\n#include \"fnord-http\/VFSFileServlet.h\"\n#include \"fnord-feeds\/FeedService.h\"\n#include \"fnord-feeds\/RemoteFeedFactory.h\"\n#include \"fnord-feeds\/RemoteFeedReader.h\"\n#include \"fnord-base\/stats\/statsdagent.h\"\n#include \"fnord-sstable\/SSTableServlet.h\"\n#include \"fnord-logtable\/LogTableServlet.h\"\n#include \"fnord-logtable\/TableRepository.h\"\n#include \"fnord-logtable\/TableJanitor.h\"\n#include \"fnord-logtable\/TableReplication.h\"\n#include \"fnord-logtable\/ArtifactReplication.h\"\n#include \"fnord-logtable\/ArtifactIndexReplication.h\"\n#include \"fnord-logtable\/NumericBoundsSummary.h\"\n#include \"fnord-mdb\/MDB.h\"\n#include \"fnord-mdb\/MDBUtil.h\"\n#include \"fnord-tsdb\/TSDBNode.h\"\n#include \"fnord-tsdb\/TSDBServlet.h\"\n#include \"common.h\"\n#include \"schemas.h\"\n#include \"ModelReplication.h\"\n\nusing namespace fnord;\n\nstd::atomic<bool> shutdown_sig;\nfnord::thread::EventLoop ev;\n\nvoid quit(int n) {\n  shutdown_sig = true;\n  fnord::logInfo(\"cm.chunkserver\", \"Shutting down...\");\n  \/\/ FIXPAUL: wait for http server stop...\n  ev.shutdown();\n}\n\nint main(int argc, const char** argv) {\n  fnord::Application::init();\n  fnord::Application::logToStderr();\n\n  \/* shutdown hook *\/\n  shutdown_sig = false;\n  struct sigaction sa;\n  memset(&sa, 0, sizeof(struct sigaction));\n  sa.sa_handler = quit;\n  sigaction(SIGTERM, &sa, NULL);\n  sigaction(SIGQUIT, &sa, NULL);\n  sigaction(SIGINT, &sa, NULL);\n\n  fnord::cli::FlagParser flags;\n\n  flags.defineFlag(\n      \"http_port\",\n      fnord::cli::FlagParser::T_INTEGER,\n      false,\n      NULL,\n      \"8000\",\n      \"Start the public http server on this port\",\n      \"<port>\");\n\n  flags.defineFlag(\n      \"datadir\",\n      cli::FlagParser::T_STRING,\n      true,\n      NULL,\n      NULL,\n      \"datadir path\",\n      \"<path>\");\n\n  flags.defineFlag(\n      \"replicate_to\",\n      cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      NULL,\n      \"url\",\n      \"<url>\");\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  \/* args *\/\n  auto dir = flags.getString(\"datadir\");\n  auto repl_targets = flags.getStrings(\"replicate_to\");\n\n  \/* start http server and worker pools *\/\n  fnord::thread::ThreadPool tpool;\n  http::HTTPConnectionPool http(&ev);\n  fnord::http::HTTPRouter http_router;\n  fnord::http::HTTPServer http_server(&http_router, &ev);\n  http_server.listen(flags.getInt(\"http_port\"));\n\n  auto repl_scheme = mkRef(new dht::FixedReplicationScheme());\n  for (const auto& r : repl_targets) {\n    repl_scheme->addHost(r);\n  }\n\n  tsdb::TSDBNode tsdb_node(dir + \"\/tsdb\", repl_scheme.get(), &http);\n\n  tsdb::StreamProperties config(new msg::MessageSchema(joinedSessionsSchema()));\n  config.max_datafile_size = 1024 * 1024 * 512;\n  config.chunk_size = Duration(3600 * 4 * kMicrosPerSecond);\n  config.compaction_interval = Duration(30 * kMicrosPerSecond);\n  tsdb_node.configurePrefix(\"joined_sessions.\", config);\n\n  tsdb::TSDBServlet tsdb_servlet(&tsdb_node);\n  http_router.addRouteByPrefixMatch(\"\/tsdb\", &tsdb_servlet, &tpool);\n\n  tsdb_node.start();\n  ev.run();\n\n  tsdb_node.stop();\n  fnord::logInfo(\"cm.chunkserver\", \"Exiting...\");\n\n  exit(0);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"utils\/logoutput.h\"\n#include \"commandSocket.h\"\n#include \"fffProcessor.h\"\n#include \"Progress.h\"\n\n#include <thread>\n#include <cinttypes>\n\n#include <Arcus\/Socket.h>\n\n#ifdef _WIN32\n#include <windows.h>\n#endif\n\nnamespace cura {\n\n#define BYTES_PER_FLOAT 4\n#define FLOATS_PER_VECTOR 3\n#define VECTORS_PER_FACE 3\n    \nclass CommandSocket::Private\n{\npublic:\n    Private()\n        : processor(nullptr)\n        , socket(nullptr)\n        , object_count(0)\n        , current_sliced_object(nullptr)\n        , sliced_objects(0)\n    { }\n\n    fffProcessor* processor;\n\n    Arcus::Socket* socket;\n    \n    \/\/ Number of objects that need to be sliced\n    int object_count;\n    \n    \/\/ Message that holds a list of sliced objects\n    std::shared_ptr<cura::proto::SlicedObjectList> sliced_object_list;\n    \n    \/\/ Message that holds the currently sliced object (to be added to sliced_object_list)\n    cura::proto::SlicedObject* current_sliced_object;\n    \n    \/\/ Number of sliced objects for this sliced object list\n    int sliced_objects;\n    \n    \/\/ Ids of the sliced objects\n    std::vector<int64_t> object_ids;\n\n    std::string temp_gcode_file;\n    std::ostringstream gcode_output_stream;\n    \n    \/\/ Print object that olds one or more meshes that need to be sliced. \n    std::vector< std::shared_ptr<PrintObject> > objects_to_slice;\n};\n\nCommandSocket::CommandSocket(fffProcessor* processor)\n    : d(new Private)\n{\n    d->processor = processor;\n    d->processor->setCommandSocket(this);\n}\n\nvoid CommandSocket::connect(const std::string& ip, int port)\n{\n    d->socket = new Arcus::Socket();\n    \/\/d->socket->registerMessageType(1, &Cura::ObjectList::default_instance());\n    d->socket->registerMessageType(1, &cura::proto::Slice::default_instance());\n    d->socket->registerMessageType(2, &cura::proto::SlicedObjectList::default_instance());\n    d->socket->registerMessageType(3, &cura::proto::Progress::default_instance());\n    d->socket->registerMessageType(4, &cura::proto::GCodeLayer::default_instance());\n    d->socket->registerMessageType(5, &cura::proto::ObjectPrintTime::default_instance());\n    d->socket->registerMessageType(6, &cura::proto::SettingList::default_instance());\n    d->socket->registerMessageType(7, &cura::proto::GCodePrefix::default_instance());\n\n    d->socket->connect(ip, port);\n    \n    \/\/ Start & continue listening as long as socket is not closed and there is no error.\n    while(d->socket->state() != Arcus::SocketState::Closed && d->socket->state() != Arcus::SocketState::Error)\n    {\n        \/\/If there is an object to slice, do so.\n        if(d->objects_to_slice.size())\n        {\n            for(auto object : d->objects_to_slice)\n            {\n                d->processor->processModel(object.get());\n            }\n            d->objects_to_slice.clear();\n            sendPrintTime();\n            \/\/TODO: Support all-at-once\/one-at-a-time printing\n            \/\/d->processor->processModel(d->object_to_slice.get());\n            \/\/d->object_to_slice.reset();\n            \/\/d->processor->resetFileNumber();\n\n            \/\/sendPrintTime();\n        }\n        \n        \/\/ Actually start handling messages.\n        Arcus::MessagePtr message = d->socket->takeNextMessage();\n        cura::proto::SettingList* setting_list = dynamic_cast<cura::proto::SettingList*>(message.get());\n        if(setting_list)\n        {\n            handleSettingList(setting_list);\n        }\n\n        \/*cura::proto::ObjectList* object_list = dynamic_cast<cura::proto::ObjectList*>(message.get());\n        if(object_list)\n        {\n            handleObjectList(object_list);\n        }*\/\n        \n        cura::proto::Slice* slice = dynamic_cast<cura::proto::Slice*>(message.get());\n        if(slice)\n        {\n            \/\/ Reset object counts\n            d->object_count = 0;\n            d->object_ids.clear();\n            for(auto object : slice->object_lists())\n            {\n                handleObjectList(&object);\n            }\n        }\n\n        std::this_thread::sleep_for(std::chrono::milliseconds(250));\n\n        if(!d->socket->errorString().empty()) \n        {\n            logError(\"%s\\n\", d->socket->errorString().data());\n            d->socket->clearError();\n        }\n    }\n}\n\nvoid CommandSocket::handleObjectList(cura::proto::ObjectList* list)\n{\n    FMatrix3x3 matrix;\n    \/\/d->object_count = 0;\n    \/\/d->object_ids.clear();\n    std::cout << \"HandleObjectList called\" << std::endl;\n    d->objects_to_slice.push_back(std::make_shared<PrintObject>(d->processor));\n    for(auto object : list->objects())\n    {\n        d->objects_to_slice.back()->meshes.push_back(d->objects_to_slice.back().get()); \/\/Construct a new mesh and put it into PrintObject's mesh list.\n        std::cout << \"adding mesh: \" << d->objects_to_slice.back()->meshes.size() << std::endl;\n        Mesh& mesh = d->objects_to_slice.back()->meshes.back();\n\n        int bytes_per_face = BYTES_PER_FLOAT * FLOATS_PER_VECTOR * VECTORS_PER_FACE;\n        int face_count = object.vertices().size() \/ bytes_per_face;\n        for(int i = 0; i < face_count; ++i)\n        {\n            \/\/TODO: Apply matrix\n            std::string data = object.vertices().substr(i * bytes_per_face, bytes_per_face);\n            const FPoint3* float_vertices = reinterpret_cast<const FPoint3*>(data.data());\n\n            Point3 verts[3];\n            verts[0] = matrix.apply(float_vertices[0]);\n            verts[1] = matrix.apply(float_vertices[1]);\n            verts[2] = matrix.apply(float_vertices[2]);\n            mesh.addFace(verts[0], verts[1], verts[2]);\n        }\n\n        for(auto setting : object.settings())\n        {\n            mesh.setSetting(setting.name(), setting.value());\n        }\n\n        d->object_ids.push_back(object.id());\n        mesh.finish();\n    }\n    d->object_count++;\n    d->objects_to_slice.back()->finalize();\n}\n\nvoid CommandSocket::handleSettingList(cura::proto::SettingList* list)\n{\n    for(auto setting : list->settings())\n    {\n        d->processor->setSetting(setting.name(), setting.value());\n    }\n}\n\nvoid CommandSocket::sendLayerInfo(int layer_nr, int32_t z, int32_t height)\n{\n\/\/     socket.sendInt32(CMD_LAYER_INFO);\n\/\/     socket.sendInt32(4 * 4);\n\/\/     socket.sendInt32(current_object_number);\n\/\/     socket.sendInt32(layer_nr);\n\/\/     socket.sendInt32(z);\n\/\/     socket.sendInt32(height);\n}\n\nvoid CommandSocket::sendPolygons(PolygonType type, int layer_nr, Polygons& polygons)\n{\n    if(!d->current_sliced_object)\n        return;\n\n    cura::proto::Layer* layer = d->current_sliced_object->add_layers();\n    layer->set_id(layer_nr);\n\n    for(unsigned int i = 0; i < polygons.size(); ++i)\n    {\n        cura::proto::Polygon* p = layer->add_polygons();\n        p->set_type(static_cast<cura::proto::Polygon_Type>(type));\n        std::string polydata;\n        polydata.append(reinterpret_cast<const char*>(polygons[i].data()), polygons[i].size() * sizeof(Point));\n        p->set_points(polydata);\n    }\n}\n\nvoid CommandSocket::sendProgress(float amount)\n{\n    auto message = std::make_shared<cura::proto::Progress>();\n    message->set_amount(amount);\n    d->socket->sendMessage(message);\n}\n\nvoid CommandSocket::sendProgressStage(Progress::Stage stage)\n{\n    \/\/ TODO\n}\n\nvoid CommandSocket::sendPrintTime()\n{\n    auto message = std::make_shared<cura::proto::ObjectPrintTime>();\n    message->set_time(d->processor->getTotalPrintTime());\n    message->set_material_amount(d->processor->getTotalFilamentUsed(0));\n    d->socket->sendMessage(message);\n}\n\nvoid CommandSocket::sendPrintMaterialForObject(int index, int extruder_nr, float print_time)\n{\n\/\/     socket.sendInt32(CMD_OBJECT_PRINT_MATERIAL);\n\/\/     socket.sendInt32(12);\n\/\/     socket.sendInt32(index);\n\/\/     socket.sendInt32(extruder_nr);\n\/\/     socket.sendFloat32(print_time);\n}\n\nvoid CommandSocket::beginSendSlicedObject()\n{\n    if(!d->sliced_object_list)\n    {\n        d->sliced_object_list = std::make_shared<cura::proto::SlicedObjectList>();\n    }\n\n    d->current_sliced_object = d->sliced_object_list->add_objects();\n    d->current_sliced_object->set_id(d->object_ids[d->sliced_objects]);\n}\n\nvoid CommandSocket::endSendSlicedObject()\n{\n    d->sliced_objects++;\n    std::cout << \"End sliced object called. sliced objects \" << d->sliced_objects << \" object count: \" << d->object_count << std::endl;\n    if(d->sliced_objects >= d->object_count)\n    {\n        d->socket->sendMessage(d->sliced_object_list);\n        d->sliced_objects = 0;\n        d->sliced_object_list.reset();\n        d->current_sliced_object = nullptr;\n    }\n}\n\nvoid CommandSocket::beginGCode()\n{\n    d->processor->setTargetStream(&d->gcode_output_stream);\n}\n\nvoid CommandSocket::sendGCodeLayer()\n{\n    auto message = std::make_shared<cura::proto::GCodeLayer>();\n    message->set_id(d->object_ids[0]);\n    message->set_data(d->gcode_output_stream.str());\n    d->socket->sendMessage(message);\n    \n    d->gcode_output_stream.str(\"\");\n}\n\nvoid CommandSocket::sendGCodePrefix(std::string prefix)\n{\n    auto message = std::make_shared<cura::proto::GCodePrefix>();\n    message->set_data(prefix);\n    d->socket->sendMessage(message);\n}\n\n}\/\/namespace cura\n<commit_msg>progress now takes multiple objects for once at a time into account<commit_after>#include \"utils\/logoutput.h\"\n#include \"commandSocket.h\"\n#include \"fffProcessor.h\"\n#include \"Progress.h\"\n\n#include <thread>\n#include <cinttypes>\n\n#include <Arcus\/Socket.h>\n\n#ifdef _WIN32\n#include <windows.h>\n#endif\n\nnamespace cura {\n\n#define BYTES_PER_FLOAT 4\n#define FLOATS_PER_VECTOR 3\n#define VECTORS_PER_FACE 3\n    \nclass CommandSocket::Private\n{\npublic:\n    Private()\n        : processor(nullptr)\n        , socket(nullptr)\n        , object_count(0)\n        , current_sliced_object(nullptr)\n        , sliced_objects(0)\n    { }\n\n    fffProcessor* processor;\n\n    Arcus::Socket* socket;\n    \n    \/\/ Number of objects that need to be sliced\n    int object_count;\n    \n    \/\/ Message that holds a list of sliced objects\n    std::shared_ptr<cura::proto::SlicedObjectList> sliced_object_list;\n    \n    \/\/ Message that holds the currently sliced object (to be added to sliced_object_list)\n    cura::proto::SlicedObject* current_sliced_object;\n    \n    \/\/ Number of sliced objects for this sliced object list\n    int sliced_objects;\n    \n    \/\/ Ids of the sliced objects\n    std::vector<int64_t> object_ids;\n\n    std::string temp_gcode_file;\n    std::ostringstream gcode_output_stream;\n    \n    \/\/ Print object that olds one or more meshes that need to be sliced. \n    std::vector< std::shared_ptr<PrintObject> > objects_to_slice;\n};\n\nCommandSocket::CommandSocket(fffProcessor* processor)\n    : d(new Private)\n{\n    d->processor = processor;\n    d->processor->setCommandSocket(this);\n}\n\nvoid CommandSocket::connect(const std::string& ip, int port)\n{\n    d->socket = new Arcus::Socket();\n    \/\/d->socket->registerMessageType(1, &Cura::ObjectList::default_instance());\n    d->socket->registerMessageType(1, &cura::proto::Slice::default_instance());\n    d->socket->registerMessageType(2, &cura::proto::SlicedObjectList::default_instance());\n    d->socket->registerMessageType(3, &cura::proto::Progress::default_instance());\n    d->socket->registerMessageType(4, &cura::proto::GCodeLayer::default_instance());\n    d->socket->registerMessageType(5, &cura::proto::ObjectPrintTime::default_instance());\n    d->socket->registerMessageType(6, &cura::proto::SettingList::default_instance());\n    d->socket->registerMessageType(7, &cura::proto::GCodePrefix::default_instance());\n\n    d->socket->connect(ip, port);\n    \n    \/\/ Start & continue listening as long as socket is not closed and there is no error.\n    while(d->socket->state() != Arcus::SocketState::Closed && d->socket->state() != Arcus::SocketState::Error)\n    {\n        \/\/If there is an object to slice, do so.\n        if(d->objects_to_slice.size())\n        {\n            for(auto object : d->objects_to_slice)\n            {\n                d->processor->processModel(object.get());\n            }\n            d->objects_to_slice.clear();\n            sendPrintTime();\n            \/\/TODO: Support all-at-once\/one-at-a-time printing\n            \/\/d->processor->processModel(d->object_to_slice.get());\n            \/\/d->object_to_slice.reset();\n            \/\/d->processor->resetFileNumber();\n\n            \/\/sendPrintTime();\n        }\n        \n        \/\/ Actually start handling messages.\n        Arcus::MessagePtr message = d->socket->takeNextMessage();\n        cura::proto::SettingList* setting_list = dynamic_cast<cura::proto::SettingList*>(message.get());\n        if(setting_list)\n        {\n            handleSettingList(setting_list);\n        }\n\n        \/*cura::proto::ObjectList* object_list = dynamic_cast<cura::proto::ObjectList*>(message.get());\n        if(object_list)\n        {\n            handleObjectList(object_list);\n        }*\/\n        \n        cura::proto::Slice* slice = dynamic_cast<cura::proto::Slice*>(message.get());\n        if(slice)\n        {\n            \/\/ Reset object counts\n            d->object_count = 0;\n            d->object_ids.clear();\n            for(auto object : slice->object_lists())\n            {\n                handleObjectList(&object);\n            }\n        }\n\n        std::this_thread::sleep_for(std::chrono::milliseconds(250));\n\n        if(!d->socket->errorString().empty()) \n        {\n            logError(\"%s\\n\", d->socket->errorString().data());\n            d->socket->clearError();\n        }\n    }\n}\n\nvoid CommandSocket::handleObjectList(cura::proto::ObjectList* list)\n{\n    FMatrix3x3 matrix;\n    \/\/d->object_count = 0;\n    \/\/d->object_ids.clear();\n    std::cout << \"HandleObjectList called\" << std::endl;\n    d->objects_to_slice.push_back(std::make_shared<PrintObject>(d->processor));\n    for(auto object : list->objects())\n    {\n        d->objects_to_slice.back()->meshes.push_back(d->objects_to_slice.back().get()); \/\/Construct a new mesh and put it into PrintObject's mesh list.\n        std::cout << \"adding mesh: \" << d->objects_to_slice.back()->meshes.size() << std::endl;\n        Mesh& mesh = d->objects_to_slice.back()->meshes.back();\n\n        int bytes_per_face = BYTES_PER_FLOAT * FLOATS_PER_VECTOR * VECTORS_PER_FACE;\n        int face_count = object.vertices().size() \/ bytes_per_face;\n        for(int i = 0; i < face_count; ++i)\n        {\n            \/\/TODO: Apply matrix\n            std::string data = object.vertices().substr(i * bytes_per_face, bytes_per_face);\n            const FPoint3* float_vertices = reinterpret_cast<const FPoint3*>(data.data());\n\n            Point3 verts[3];\n            verts[0] = matrix.apply(float_vertices[0]);\n            verts[1] = matrix.apply(float_vertices[1]);\n            verts[2] = matrix.apply(float_vertices[2]);\n            mesh.addFace(verts[0], verts[1], verts[2]);\n        }\n\n        for(auto setting : object.settings())\n        {\n            mesh.setSetting(setting.name(), setting.value());\n        }\n\n        d->object_ids.push_back(object.id());\n        mesh.finish();\n    }\n    d->object_count++;\n    d->objects_to_slice.back()->finalize();\n}\n\nvoid CommandSocket::handleSettingList(cura::proto::SettingList* list)\n{\n    for(auto setting : list->settings())\n    {\n        d->processor->setSetting(setting.name(), setting.value());\n    }\n}\n\nvoid CommandSocket::sendLayerInfo(int layer_nr, int32_t z, int32_t height)\n{\n\/\/     socket.sendInt32(CMD_LAYER_INFO);\n\/\/     socket.sendInt32(4 * 4);\n\/\/     socket.sendInt32(current_object_number);\n\/\/     socket.sendInt32(layer_nr);\n\/\/     socket.sendInt32(z);\n\/\/     socket.sendInt32(height);\n}\n\nvoid CommandSocket::sendPolygons(PolygonType type, int layer_nr, Polygons& polygons)\n{\n    if(!d->current_sliced_object)\n        return;\n\n    cura::proto::Layer* layer = d->current_sliced_object->add_layers();\n    layer->set_id(layer_nr);\n\n    for(unsigned int i = 0; i < polygons.size(); ++i)\n    {\n        cura::proto::Polygon* p = layer->add_polygons();\n        p->set_type(static_cast<cura::proto::Polygon_Type>(type));\n        std::string polydata;\n        polydata.append(reinterpret_cast<const char*>(polygons[i].data()), polygons[i].size() * sizeof(Point));\n        p->set_points(polydata);\n    }\n}\n\nvoid CommandSocket::sendProgress(float amount)\n{\n    auto message = std::make_shared<cura::proto::Progress>();\n    amount \/= d->object_count;\n    amount += d->sliced_objects * (1. \/ d->object_count);\n    message->set_amount(amount);\n    d->socket->sendMessage(message);\n}\n\nvoid CommandSocket::sendProgressStage(Progress::Stage stage)\n{\n    \/\/ TODO\n}\n\nvoid CommandSocket::sendPrintTime()\n{\n    auto message = std::make_shared<cura::proto::ObjectPrintTime>();\n    message->set_time(d->processor->getTotalPrintTime());\n    message->set_material_amount(d->processor->getTotalFilamentUsed(0));\n    d->socket->sendMessage(message);\n}\n\nvoid CommandSocket::sendPrintMaterialForObject(int index, int extruder_nr, float print_time)\n{\n\/\/     socket.sendInt32(CMD_OBJECT_PRINT_MATERIAL);\n\/\/     socket.sendInt32(12);\n\/\/     socket.sendInt32(index);\n\/\/     socket.sendInt32(extruder_nr);\n\/\/     socket.sendFloat32(print_time);\n}\n\nvoid CommandSocket::beginSendSlicedObject()\n{\n    if(!d->sliced_object_list)\n    {\n        d->sliced_object_list = std::make_shared<cura::proto::SlicedObjectList>();\n    }\n\n    d->current_sliced_object = d->sliced_object_list->add_objects();\n    d->current_sliced_object->set_id(d->object_ids[d->sliced_objects]);\n}\n\nvoid CommandSocket::endSendSlicedObject()\n{\n    d->sliced_objects++;\n    std::cout << \"End sliced object called. sliced objects \" << d->sliced_objects << \" object count: \" << d->object_count << std::endl;\n    if(d->sliced_objects >= d->object_count)\n    {\n        d->socket->sendMessage(d->sliced_object_list);\n        d->sliced_objects = 0;\n        d->sliced_object_list.reset();\n        d->current_sliced_object = nullptr;\n    }\n}\n\nvoid CommandSocket::beginGCode()\n{\n    d->processor->setTargetStream(&d->gcode_output_stream);\n}\n\nvoid CommandSocket::sendGCodeLayer()\n{\n    auto message = std::make_shared<cura::proto::GCodeLayer>();\n    message->set_id(d->object_ids[0]);\n    message->set_data(d->gcode_output_stream.str());\n    d->socket->sendMessage(message);\n    \n    d->gcode_output_stream.str(\"\");\n}\n\nvoid CommandSocket::sendGCodePrefix(std::string prefix)\n{\n    auto message = std::make_shared<cura::proto::GCodePrefix>();\n    message->set_data(prefix);\n    d->socket->sendMessage(message);\n}\n\n}\/\/namespace cura\n<|endoftext|>"}
{"text":"<commit_before>#ifdef WIN32\n#pragma warning(4:4786)\n#endif\n\n#include <string>\n#include <fstream>\n#include <stdio.h>\n#include \"Bundle.h\"\n\nBundle::Bundle(const Bundle *pBundle)\n{\n\tif (pBundle == NULL)\n\t\treturn;\n\n\tmappings = pBundle->mappings;\n}\n\nvoid Bundle::load(const std::string &path)\n{\n\tstd::string untranslated;\n\tstd::string translated;\n\tchar buffer[1024];\n\n\tstd::ifstream poStrm(path.c_str());\n\tif (!poStrm.good())\n\t\treturn;\n\n\tpoStrm.getline(buffer,1024);\n\twhile (poStrm.good()) {\n\t\tstd::string line = buffer;\n\t\tstd::string data;\n\t\tTLineType type = parseLine(line, data);\n\t\tif (type == tMSGID) {\n\t\t\tif (untranslated.length() > 0) {\n\t\t\t\tmappings.erase(untranslated);\n\t\t\t\tensureNormalText(translated);\n\t\t\t\tmappings.insert(std::pair<std::string,std::string>(untranslated, translated));\n\t\t\t}\n\t\t\tuntranslated = data;\n\t\t\ttranslated.resize(0);\n\t\t}\n\t\telse if (type == tMSGSTR) {\n\t\t\tif (untranslated.length() > 0)\n\t\t\t\ttranslated = data;\n\t\t}\n\t\telse if (type == tAPPEND) {\n\t\t\tif (untranslated.length() > 0)\n\t\t\t\ttranslated += data;\n\t\t}\n\t\telse if (type == tERROR) {\n\n\t\t}\n\t\t\n\t\t\n\t\tpoStrm.getline(buffer,1024);\n\t}\n\n\tif ((untranslated.length() > 0) && (translated.length() > 0)) {\n\t\tmappings.erase(untranslated);\n\t\tensureNormalText(translated);\n\t\tmappings.insert(std::pair<std::string,std::string>(untranslated, translated));\n\t}\n}\n\nBundle::TLineType Bundle::parseLine(const std::string &line, std::string &data)\n{\n\tint startPos, endPos;\n\tTLineType type;\n\n\tdata.resize(0);\n\tstartPos = line.find_first_not_of(\"\\t \\r\\n\");\n\n\tif ((startPos < 0) || (line.at(startPos) == '#'))\n\t\treturn tCOMMENT;\n\n\telse if (line.at(startPos) == '\"') {\n\t\tendPos = line.find_first_of('\"', startPos+1);\n\t\tif (endPos < 0)\n\t\t\tendPos = line.length();\n\t\tdata = line.substr(startPos+1, endPos-startPos-1);\n\t\treturn tAPPEND;\n\t}\n\t\n\tendPos = line.find_first_of(\"\\t \\r\\n\\\"\");\n\tif (endPos < 0)\n\t\tendPos = line.length();\n\tstd::string key = line.substr(startPos, endPos-startPos);\n\tif (key == \"msgid\")\n\t\ttype = tMSGID;\n\telse if (key == \"msgstr\")\n\t\ttype = tMSGSTR;\n\telse\n\t\treturn tERROR;\n\n\tstartPos = line.find_first_of('\"', endPos + 1);\n\tif (startPos >= 0) {\n\t\tstartPos++;\n\t\tendPos = line.find_first_of('\"', startPos);\n\t\tif (endPos < 0)\n\t\t\tendPos = line.length();\n\t\tdata = line.substr( startPos, endPos-startPos);\n\t}\n\treturn type;\n}\n\n\nstd::string Bundle::getLocalString(const std::string &key)\n{\n\tBundleStringMap::iterator it = mappings.find(key);\n\tif (it != mappings.end())\n\t\treturn it->second;\n\telse\n\t\treturn key;\n}\n\nvoid Bundle::ensureNormalText(std::string &msg)\n{\n\/\/ This is an ugly hack. If you don't like it fix it.\n\/\/ BZFlag's font bitmaps don't contain letters with accents, so strip them here\n\/\/ Would be nice if some kind sole added them.\n\n  int length = msg.length();\n  for (int i = 0; i < length; i++) {\n    char c = msg.at(i);\n    switch (c) {\n      case '':\n      case '':\n      case '':\n      case '':\n\tmsg[i] = 'a';\n      break;\n      case '':\n      case '':\n      case '':\n      case '':\n\tmsg[i] = 'e';\n      break;\n      case '':\n      case '':\n\tmsg[i] = 'i';\n      break;\n      case '':\n      case '':\n\tmsg[i] = 'o';\n      break;\n      case '':\n\tmsg[i] = 'O';\n      break;\n      case '':\n      case '':\n      case '':\n      case '':\n\tmsg[i] = 'u';\n      break;\n      case '':\n\tmsg[i] = 'n';\n      break;\n      case '':\n      case '':\n\tmsg[i] = ' ';\n      break;\n\n    }\n  }\n  \n}\n\n\nstd::string Bundle::formatMessage(const std::string &key, int parmCnt, const std::string *parms)\n{\n\tstd::string messageIn = getLocalString(key);\n\tstd::string messageOut;\n\n\tint startPos = 0;\n\tint lCurlyPos = messageIn.find_first_of(\"{\");\n\n\twhile (lCurlyPos >= 0) {\n\t\tmessageOut += messageIn.substr( startPos, lCurlyPos - startPos);\n\t\tint rCurlyPos = messageIn.find_first_of(\"}\", lCurlyPos++);\n\t\tif (rCurlyPos < 0) {\n\t\t\tmessageOut += messageIn.substr(lCurlyPos);\n\t\t\treturn messageOut;\n\t\t}\n\t\tstd::string numStr = messageIn.substr(lCurlyPos, rCurlyPos-lCurlyPos);\n\t\tint num;\n\t\tif (sscanf(numStr.c_str(), \"%d\", &num) != 1)\n\t\t\tmessageOut += messageIn.substr(lCurlyPos, rCurlyPos-lCurlyPos);\n\t\telse {\n\t\t\tnum--;\n\t\t\tif ((num >= 0) && (num < parmCnt))\n\t\t\t\tmessageOut += parms[num];\n\t\t}\n\t\tstartPos = rCurlyPos+1;\n\t\tlCurlyPos = messageIn.find_first_of(\"{\", startPos);\n\t}\n\tmessageOut += messageIn.substr(startPos);\n\treturn messageOut;\n}\n\n\n<commit_msg>Map danish chars to english<commit_after>#ifdef WIN32\n#pragma warning(4:4786)\n#endif\n\n#include <string>\n#include <fstream>\n#include <stdio.h>\n#include \"Bundle.h\"\n\nBundle::Bundle(const Bundle *pBundle)\n{\n\tif (pBundle == NULL)\n\t\treturn;\n\n\tmappings = pBundle->mappings;\n}\n\nvoid Bundle::load(const std::string &path)\n{\n\tstd::string untranslated;\n\tstd::string translated;\n\tchar buffer[1024];\n\n\tstd::ifstream poStrm(path.c_str());\n\tif (!poStrm.good())\n\t\treturn;\n\n\tpoStrm.getline(buffer,1024);\n\twhile (poStrm.good()) {\n\t\tstd::string line = buffer;\n\t\tstd::string data;\n\t\tTLineType type = parseLine(line, data);\n\t\tif (type == tMSGID) {\n\t\t\tif (untranslated.length() > 0) {\n\t\t\t\tmappings.erase(untranslated);\n\t\t\t\tensureNormalText(translated);\n\t\t\t\tmappings.insert(std::pair<std::string,std::string>(untranslated, translated));\n\t\t\t}\n\t\t\tuntranslated = data;\n\t\t\ttranslated.resize(0);\n\t\t}\n\t\telse if (type == tMSGSTR) {\n\t\t\tif (untranslated.length() > 0)\n\t\t\t\ttranslated = data;\n\t\t}\n\t\telse if (type == tAPPEND) {\n\t\t\tif (untranslated.length() > 0)\n\t\t\t\ttranslated += data;\n\t\t}\n\t\telse if (type == tERROR) {\n\n\t\t}\n\t\t\n\t\t\n\t\tpoStrm.getline(buffer,1024);\n\t}\n\n\tif ((untranslated.length() > 0) && (translated.length() > 0)) {\n\t\tmappings.erase(untranslated);\n\t\tensureNormalText(translated);\n\t\tmappings.insert(std::pair<std::string,std::string>(untranslated, translated));\n\t}\n}\n\nBundle::TLineType Bundle::parseLine(const std::string &line, std::string &data)\n{\n\tint startPos, endPos;\n\tTLineType type;\n\n\tdata.resize(0);\n\tstartPos = line.find_first_not_of(\"\\t \\r\\n\");\n\n\tif ((startPos < 0) || (line.at(startPos) == '#'))\n\t\treturn tCOMMENT;\n\n\telse if (line.at(startPos) == '\"') {\n\t\tendPos = line.find_first_of('\"', startPos+1);\n\t\tif (endPos < 0)\n\t\t\tendPos = line.length();\n\t\tdata = line.substr(startPos+1, endPos-startPos-1);\n\t\treturn tAPPEND;\n\t}\n\t\n\tendPos = line.find_first_of(\"\\t \\r\\n\\\"\");\n\tif (endPos < 0)\n\t\tendPos = line.length();\n\tstd::string key = line.substr(startPos, endPos-startPos);\n\tif (key == \"msgid\")\n\t\ttype = tMSGID;\n\telse if (key == \"msgstr\")\n\t\ttype = tMSGSTR;\n\telse\n\t\treturn tERROR;\n\n\tstartPos = line.find_first_of('\"', endPos + 1);\n\tif (startPos >= 0) {\n\t\tstartPos++;\n\t\tendPos = line.find_first_of('\"', startPos);\n\t\tif (endPos < 0)\n\t\t\tendPos = line.length();\n\t\tdata = line.substr( startPos, endPos-startPos);\n\t}\n\treturn type;\n}\n\n\nstd::string Bundle::getLocalString(const std::string &key)\n{\n\tBundleStringMap::iterator it = mappings.find(key);\n\tif (it != mappings.end())\n\t\treturn it->second;\n\telse\n\t\treturn key;\n}\n\nvoid Bundle::ensureNormalText(std::string &msg)\n{\n\/\/ This is an ugly hack. If you don't like it fix it.\n\/\/ BZFlag's font bitmaps don't contain letters with accents, so strip them here\n\/\/ Would be nice if some kind sole added them.\n\n  for (int i = 0; i < msg.length(); i++) {\n    char c = msg.at(i);\n    switch (c) {\n      case '':\n      case '':\n      case '':\n      case '':\n\tmsg[i] = 'a';\n      break;\n      case '':\n\tmsg[i] = 'a';\n\ti++;\n\tmsg.insert(i, 1, 'a');\n      break;\n      case '':\n\tmsg[i] = 'a';\n\ti++;\n\tmsg.insert(i, 1, 'e');\n      break;\n      case '':\n\tmsg[i] = 'A';\n\ti++;\n\tmsg.insert(i, 1, 'e');\n      break;\n      case '':\n\tmsg[i] = 'A';\n\ti++;\n\tmsg.insert(i, 1, 'a');\n      break;\n      case '':\n      case '':\n      case '':\n      case '':\n\tmsg[i] = 'e';\n      break;\n      case '':\n      case '':\n\tmsg[i] = 'i';\n      break;\n      case '':\n      case '':\n\tmsg[i] = 'o';\n      break;\n      case '':\n\tmsg[i] = 'o';\n\ti++;\n\tmsg.insert(i, 1, 'e');\n      break;\n      case '':\n\tmsg[i] = 'O';\n      break;\n      case '':\n\tmsg[i] = 'O';\n\ti++;\n\tmsg.insert(i, 1, 'e');\n      break;\n      case '':\n      case '':\n      case '':\n      case '':\n\tmsg[i] = 'u';\n      break;\n      case '':\n\tmsg[i] = 'n';\n      break;\n      case '':\n      case '':\n\tmsg[i] = ' ';\n      break;\n\n    }\n  }\n  \n}\n\n\nstd::string Bundle::formatMessage(const std::string &key, int parmCnt, const std::string *parms)\n{\n\tstd::string messageIn = getLocalString(key);\n\tstd::string messageOut;\n\n\tint startPos = 0;\n\tint lCurlyPos = messageIn.find_first_of(\"{\");\n\n\twhile (lCurlyPos >= 0) {\n\t\tmessageOut += messageIn.substr( startPos, lCurlyPos - startPos);\n\t\tint rCurlyPos = messageIn.find_first_of(\"}\", lCurlyPos++);\n\t\tif (rCurlyPos < 0) {\n\t\t\tmessageOut += messageIn.substr(lCurlyPos);\n\t\t\treturn messageOut;\n\t\t}\n\t\tstd::string numStr = messageIn.substr(lCurlyPos, rCurlyPos-lCurlyPos);\n\t\tint num;\n\t\tif (sscanf(numStr.c_str(), \"%d\", &num) != 1)\n\t\t\tmessageOut += messageIn.substr(lCurlyPos, rCurlyPos-lCurlyPos);\n\t\telse {\n\t\t\tnum--;\n\t\t\tif ((num >= 0) && (num < parmCnt))\n\t\t\t\tmessageOut += parms[num];\n\t\t}\n\t\tstartPos = rCurlyPos+1;\n\t\tlCurlyPos = messageIn.find_first_of(\"{\", startPos);\n\t}\n\tmessageOut += messageIn.substr(startPos);\n\treturn messageOut;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"Platform.h\"\n#include \"Hashes.h\"\n#include \"KeysetTest.h\"\n#include \"SpeedTest.h\"\n#include \"AvalancheTest.h\"\n#include \"DifferentialTest.h\"\n#include \"PMurHash.h\"\n\n#include <stdio.h>\n#include <time.h>\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Configuration. TODO - move these to command-line flags\n\nbool g_testAll = false;\n\nbool g_testSanity      = false;\nbool g_testSpeed       = false;\nbool g_testDiff        = false;\nbool g_testDiffDist    = false;\nbool g_testAvalanche   = false;\nbool g_testBIC         = false;\nbool g_testCyclic      = false;\nbool g_testTwoBytes    = false;\nbool g_testSparse      = false;\nbool g_testPermutation = false;\nbool g_testWindow      = false;\nbool g_testText        = false;\nbool g_testZeroes      = false;\nbool g_testSeed        = false;\n\n\/\/-----------------------------------------------------------------------------\n\/\/ This is the list of all hashes that SMHasher can test.\n\nstruct HashInfo\n{\n  pfHash hash;\n  int hashbits;\n  uint32_t verification;\n  const char * name;\n  const char * desc;\n};\n\nHashInfo g_hashes[] =\n{\n  { DoNothingHash,        32, 0x00000000, \"donothing32\", \"Do-Nothing function (only valid for measuring call overhead)\" },\n  { DoNothingHash,        64, 0x00000000, \"donothing64\", \"Do-Nothing function (only valid for measuring call overhead)\" },\n  { DoNothingHash,       128, 0x00000000, \"donothing128\", \"Do-Nothing function (only valid for measuring call overhead)\" },\n\n  { crc32,                32, 0x3719DB20, \"crc32\",       \"CRC-32\" },\n\n  { md5_32,               32, 0xC10C356B, \"md5_32a\",     \"MD5, first 32 bits of result\" },\n  { sha1_32a,             32, 0xF9376EA7, \"sha1_32a\",    \"SHA1, first 32 bits of result\" },\n\n  { FNV,                  32, 0xE3CBBE91, \"FNV\",         \"Fowler-Noll-Vo hash, 32-bit\" },\n  { Bernstein,            32, 0xBDB4B640, \"bernstein\",   \"Bernstein, 32-bit\" },\n  { lookup3_test,         32, 0x3D83917A, \"lookup3\",     \"Bob Jenkins' lookup3\" },\n  { SuperFastHash,        32, 0x980ACD1D, \"superfast\",   \"Paul Hsieh's SuperFastHash\" },\n  { MurmurOAAT_test,      32, 0x5363BD98, \"MurmurOAAT\",  \"Murmur one-at-a-time\" },\n  { Crap8_test,           32, 0x743E97A1, \"Crap8\",       \"Crap8\" },\n\n  { CityHash64_test,      64, 0x25A20825, \"City64\",      \"Google CityHash64WithSeed\" },\n  { CityHash128_test,    128, 0x6531F54E, \"City128\",     \"Google CityHash128WithSeed\" },\n\n  { SpookyHash32_test,    32, 0x3F798BBB, \"Spooky32\",    \"Bob Jenkins' SpookyHash, 32-bit result\" },\n  { SpookyHash64_test,    64, 0xA7F955F1, \"Spooky64\",    \"Bob Jenkins' SpookyHash, 64-bit result\" },\n  { SpookyHash128_test,  128, 0x8D263080, \"Spooky128\",   \"Bob Jenkins' SpookyHash, 128-bit result\" },\n\n  \/\/ MurmurHash2\n\n  { MurmurHash2_test,     32, 0x27864C1E, \"Murmur2\",     \"MurmurHash2 for x86, 32-bit\" },\n  { MurmurHash2A_test,    32, 0x7FBD4396, \"Murmur2A\",    \"MurmurHash2A for x86, 32-bit\" },\n  { MurmurHash64A_test,   64, 0x1F0D3804, \"Murmur2B\",    \"MurmurHash2 for x64, 64-bit\" },\n  { MurmurHash64B_test,   64, 0xDD537C05, \"Murmur2C\",    \"MurmurHash2 for x86, 64-bit\" },\n\n  \/\/ MurmurHash3\n\n  { MurmurHash3_x86_32,   32, 0xB0F57EE3, \"Murmur3A\",    \"MurmurHash3 for x86, 32-bit\" },\n  { MurmurHash3_x86_128, 128, 0xB3ECE62A, \"Murmur3C\",    \"MurmurHash3 for x86, 128-bit\" },\n  { MurmurHash3_x64_128, 128, 0x6384BA69, \"Murmur3F\",    \"MurmurHash3 for x64, 128-bit\" },\n\n  { PMurHash32_test,      32, 0xB0F57EE3, \"PMurHash32\",  \"Shane Day's portable-ized MurmurHash3 for x86, 32-bit.\" },\n};\n\nHashInfo * findHash ( const char * name )\n{\n  for(size_t i = 0; i < sizeof(g_hashes) \/ sizeof(HashInfo); i++)\n  {\n    if(_stricmp(name,g_hashes[i].name) == 0) return &g_hashes[i];\n  }\n\n  return NULL;\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Self-test on startup - verify that all installed hashes work correctly.\n\nvoid SelfTest ( void )\n{\n  bool pass = true;\n\n  for(size_t i = 0; i < sizeof(g_hashes) \/ sizeof(HashInfo); i++)\n  {\n    HashInfo * info = & g_hashes[i];\n\n    pass &= VerificationTest(info->hash,info->hashbits,info->verification,false);\n  }\n\n  if(!pass)\n  {\n    printf(\"Self-test FAILED!\\n\");\n\n    for(size_t i = 0; i < sizeof(g_hashes) \/ sizeof(HashInfo); i++)\n    {\n      HashInfo * info = & g_hashes[i];\n\n      printf(\"%16s - \",info->name);\n      pass &= VerificationTest(info->hash,info->hashbits,info->verification,true);\n    }\n\n    exit(1);\n  }\n}\n\n\/\/----------------------------------------------------------------------------\n\ntemplate < typename hashtype >\nvoid test ( hashfunc<hashtype> hash, HashInfo * info )\n{\n  const int hashbits = sizeof(hashtype) * 8;\n\n  printf(\"-------------------------------------------------------------------------------\\n\");\n  printf(\"--- Testing %s (%s)\\n\\n\",info->name,info->desc);\n\n  \/\/-----------------------------------------------------------------------------\n  \/\/ Sanity tests\n\n  if(g_testSanity || g_testAll)\n  {\n    printf(\"[[[ Sanity Tests ]]]\\n\\n\");\n\n    VerificationTest(hash,hashbits,info->verification,true);\n    SanityTest(hash,hashbits);\n    AppendedZeroesTest(hash,hashbits);\n    printf(\"\\n\");\n  }\n\n  \/\/-----------------------------------------------------------------------------\n  \/\/ Speed tests\n\n  if(g_testSpeed || g_testAll)\n  {\n    printf(\"[[[ Speed Tests ]]]\\n\\n\");\n\n    BulkSpeedTest(info->hash,info->verification);\n    printf(\"\\n\");\n\n    for(int i = 1; i < 32; i++)\n    {\n      double cycles;\n\n      TinySpeedTest(hashfunc<hashtype>(info->hash),sizeof(hashtype),i,info->verification,true,cycles);\n    }\n\n    printf(\"\\n\");\n  }\n\n  \/\/-----------------------------------------------------------------------------\n  \/\/ Differential tests\n\n  if(g_testDiff || g_testAll)\n  {\n    printf(\"[[[ Differential Tests ]]]\\n\\n\");\n\n    bool result = true;\n    bool dumpCollisions = false;\n\n    result &= DiffTest< Blob<64>,  hashtype >(hash,5,1000,dumpCollisions);\n    result &= DiffTest< Blob<128>, hashtype >(hash,4,1000,dumpCollisions);\n    result &= DiffTest< Blob<256>, hashtype >(hash,3,1000,dumpCollisions);\n\n    if(!result) printf(\"*********FAIL*********\\n\");\n    printf(\"\\n\");\n  }\n\n  \/\/-----------------------------------------------------------------------------\n  \/\/ Differential-distribution tests\n\n  if(g_testDiffDist \/*|| g_testAll*\/)\n  {\n    printf(\"[[[ Differential Distribution Tests ]]]\\n\\n\");\n\n    bool result = true;\n\n    result &= DiffDistTest2<uint64_t,hashtype>(hash);\n\n    printf(\"\\n\");\n  }\n\n  \/\/-----------------------------------------------------------------------------\n  \/\/ Avalanche tests\n\n  if(g_testAvalanche || g_testAll)\n  {\n    printf(\"[[[ Avalanche Tests ]]]\\n\\n\");\n\n    bool result = true;\n\n    result &= AvalancheTest< Blob< 32>, hashtype > (hash,300000);\n    result &= AvalancheTest< Blob< 40>, hashtype > (hash,300000);\n    result &= AvalancheTest< Blob< 48>, hashtype > (hash,300000);\n    result &= AvalancheTest< Blob< 56>, hashtype > (hash,300000);\n\n    result &= AvalancheTest< Blob< 64>, hashtype > (hash,300000);\n    result &= AvalancheTest< Blob< 72>, hashtype > (hash,300000);\n    result &= AvalancheTest< Blob< 80>, hashtype > (hash,300000);\n    result &= AvalancheTest< Blob< 88>, hashtype > (hash,300000);\n\n    result &= AvalancheTest< Blob< 96>, hashtype > (hash,300000);\n    result &= AvalancheTest< Blob<104>, hashtype > (hash,300000);\n    result &= AvalancheTest< Blob<112>, hashtype > (hash,300000);\n    result &= AvalancheTest< Blob<120>, hashtype > (hash,300000);\n\n    result &= AvalancheTest< Blob<128>, hashtype > (hash,300000);\n    result &= AvalancheTest< Blob<136>, hashtype > (hash,300000);\n    result &= AvalancheTest< Blob<144>, hashtype > (hash,300000);\n    result &= AvalancheTest< Blob<152>, hashtype > (hash,300000);\n\n    if(!result) printf(\"*********FAIL*********\\n\");\n    printf(\"\\n\");\n  }\n\n  \/\/-----------------------------------------------------------------------------\n  \/\/ Bit Independence Criteria. Interesting, but doesn't tell us much about\n  \/\/ collision or distribution.\n\n  if(g_testBIC)\n  {\n    printf(\"[[[ Bit Independence Criteria ]]]\\n\\n\");\n\n    bool result = true;\n\n    \/\/result &= BicTest<uint64_t,hashtype>(hash,2000000);\n    BicTest3<Blob<88>,hashtype>(hash,2000000);\n\n    if(!result) printf(\"*********FAIL*********\\n\");\n    printf(\"\\n\");\n  }\n\n  \/\/-----------------------------------------------------------------------------\n  \/\/ Keyset 'Cyclic' - keys of the form \"abcdabcdabcd...\"\n\n  if(g_testCyclic || g_testAll)\n  {\n    printf(\"[[[ Keyset 'Cyclic' Tests ]]]\\n\\n\");\n\n    bool result = true;\n    bool drawDiagram = false;\n\n    result &= CyclicKeyTest<hashtype>(hash,sizeof(hashtype)+0,8,10000000,drawDiagram);\n    result &= CyclicKeyTest<hashtype>(hash,sizeof(hashtype)+1,8,10000000,drawDiagram);\n    result &= CyclicKeyTest<hashtype>(hash,sizeof(hashtype)+2,8,10000000,drawDiagram);\n    result &= CyclicKeyTest<hashtype>(hash,sizeof(hashtype)+3,8,10000000,drawDiagram);\n    result &= CyclicKeyTest<hashtype>(hash,sizeof(hashtype)+4,8,10000000,drawDiagram);\n\n    if(!result) printf(\"*********FAIL*********\\n\");\n    printf(\"\\n\");\n  }\n\n  \/\/-----------------------------------------------------------------------------\n  \/\/ Keyset 'TwoBytes' - all keys up to N bytes containing two non-zero bytes\n\n  \/\/ This generates some huge keysets, 128-bit tests will take ~1.3 gigs of RAM.\n\n  if(g_testTwoBytes || g_testAll)\n  {\n    printf(\"[[[ Keyset 'TwoBytes' Tests ]]]\\n\\n\");\n\n    bool result = true;\n    bool drawDiagram = false;\n\n    for(int i = 4; i <= 20; i += 4)\n    {\n      result &= TwoBytesTest2<hashtype>(hash,i,drawDiagram);\n    }\n\n    if(!result) printf(\"*********FAIL*********\\n\");\n    printf(\"\\n\");\n  }\n\n  \/\/-----------------------------------------------------------------------------\n  \/\/ Keyset 'Sparse' - keys with all bits 0 except a few\n\n  if(g_testSparse || g_testAll)\n  {\n    printf(\"[[[ Keyset 'Sparse' Tests ]]]\\n\\n\");\n\n    bool result = true;\n    bool drawDiagram = false;\n\n    result &= SparseKeyTest<  32,hashtype>(hash,6,true,true,true,drawDiagram);\n    result &= SparseKeyTest<  40,hashtype>(hash,6,true,true,true,drawDiagram);\n    result &= SparseKeyTest<  48,hashtype>(hash,5,true,true,true,drawDiagram);\n    result &= SparseKeyTest<  56,hashtype>(hash,5,true,true,true,drawDiagram);\n    result &= SparseKeyTest<  64,hashtype>(hash,5,true,true,true,drawDiagram);\n    result &= SparseKeyTest<  96,hashtype>(hash,4,true,true,true,drawDiagram);\n    result &= SparseKeyTest< 256,hashtype>(hash,3,true,true,true,drawDiagram);\n    result &= SparseKeyTest<2048,hashtype>(hash,2,true,true,true,drawDiagram);\n\n    if(!result) printf(\"*********FAIL*********\\n\");\n    printf(\"\\n\");\n  }\n\n  \/\/-----------------------------------------------------------------------------\n  \/\/ Keyset 'Permutation' - all possible combinations of a set of blocks\n\n  if(g_testPermutation || g_testAll)\n  {\n    {\n      \/\/ This one breaks lookup3, surprisingly\n\n      printf(\"[[[ Keyset 'Combination Lowbits' Tests ]]]\\n\\n\");\n\n      bool result = true;\n      bool drawDiagram = false;\n\n      uint32_t blocks[] =\n      {\n        0x00000000,\n\n        0x00000001, 0x00000002, 0x00000003, 0x00000004, 0x00000005, 0x00000006, 0x00000007,\n      };\n\n      result &= CombinationKeyTest<hashtype>(hash,8,blocks,sizeof(blocks) \/ sizeof(uint32_t),true,true,drawDiagram);\n\n      if(!result) printf(\"*********FAIL*********\\n\");\n      printf(\"\\n\");\n    }\n\n    {\n      printf(\"[[[ Keyset 'Combination Highbits' Tests ]]]\\n\\n\");\n\n      bool result = true;\n      bool drawDiagram = false;\n\n      uint32_t blocks[] =\n      {\n        0x00000000,\n\n        0x20000000, 0x40000000, 0x60000000, 0x80000000, 0xA0000000, 0xC0000000, 0xE0000000\n      };\n\n      result &= CombinationKeyTest<hashtype>(hash,8,blocks,sizeof(blocks) \/ sizeof(uint32_t),true,true,drawDiagram);\n\n      if(!result) printf(\"*********FAIL*********\\n\");\n      printf(\"\\n\");\n    }\n\n    {\n      printf(\"[[[ Keyset 'Combination 0x8000000' Tests ]]]\\n\\n\");\n\n      bool result = true;\n      bool drawDiagram = false;\n\n      uint32_t blocks[] =\n      {\n        0x00000000,\n\n        0x80000000,\n      };\n\n      result &= CombinationKeyTest<hashtype>(hash,20,blocks,sizeof(blocks) \/ sizeof(uint32_t),true,true,drawDiagram);\n\n      if(!result) printf(\"*********FAIL*********\\n\");\n      printf(\"\\n\");\n    }\n\n    {\n      printf(\"[[[ Keyset 'Combination 0x0000001' Tests ]]]\\n\\n\");\n\n      bool result = true;\n      bool drawDiagram = false;\n\n      uint32_t blocks[] =\n      {\n        0x00000000,\n\n        0x00000001,\n      };\n\n      result &= CombinationKeyTest<hashtype>(hash,20,blocks,sizeof(blocks) \/ sizeof(uint32_t),true,true,drawDiagram);\n\n      if(!result) printf(\"*********FAIL*********\\n\");\n      printf(\"\\n\");\n    }\n\n    {\n      printf(\"[[[ Keyset 'Combination Hi-Lo' Tests ]]]\\n\\n\");\n\n      bool result = true;\n      bool drawDiagram = false;\n\n      uint32_t blocks[] =\n      {\n        0x00000000,\n\n        0x00000001, 0x00000002, 0x00000003, 0x00000004, 0x00000005, 0x00000006, 0x00000007,\n\n        0x80000000, 0x40000000, 0xC0000000, 0x20000000, 0xA0000000, 0x60000000, 0xE0000000\n      };\n\n      result &= CombinationKeyTest<hashtype>(hash,6,blocks,sizeof(blocks) \/ sizeof(uint32_t),true,true,drawDiagram);\n\n      if(!result) printf(\"*********FAIL*********\\n\");\n      printf(\"\\n\");\n    }\n  }\n\n  \/\/-----------------------------------------------------------------------------\n  \/\/ Keyset 'Window'\n\n  \/\/ Skip distribution test for these - they're too easy to distribute well,\n  \/\/ and it generates a _lot_ of testing\n\n  if(g_testWindow || g_testAll)\n  {\n    printf(\"[[[ Keyset 'Window' Tests ]]]\\n\\n\");\n\n    bool result = true;\n    bool testCollision = true;\n    bool testDistribution = false;\n    bool drawDiagram = false;\n\n    result &= WindowedKeyTest< Blob<hashbits*2>, hashtype > ( hash, 20, testCollision, testDistribution, drawDiagram );\n\n    if(!result) printf(\"*********FAIL*********\\n\");\n    printf(\"\\n\");\n  }\n\n  \/\/-----------------------------------------------------------------------------\n  \/\/ Keyset 'Text'\n\n  if(g_testText || g_testAll)\n  {\n    printf(\"[[[ Keyset 'Text' Tests ]]]\\n\\n\");\n\n    bool result = true;\n    bool drawDiagram = false;\n\n    const char * alnum = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\";\n\n    result &= TextKeyTest( hash, \"Foo\",    alnum,4, \"Bar\",    drawDiagram );\n    result &= TextKeyTest( hash, \"FooBar\", alnum,4, \"\",       drawDiagram );\n    result &= TextKeyTest( hash, \"\",       alnum,4, \"FooBar\", drawDiagram );\n\n    if(!result) printf(\"*********FAIL*********\\n\");\n    printf(\"\\n\");\n  }\n\n  \/\/-----------------------------------------------------------------------------\n  \/\/ Keyset 'Zeroes'\n\n  if(g_testZeroes || g_testAll)\n  {\n    printf(\"[[[ Keyset 'Zeroes' Tests ]]]\\n\\n\");\n\n    bool result = true;\n    bool drawDiagram = false;\n\n    result &= ZeroKeyTest<hashtype>( hash, drawDiagram );\n\n    if(!result) printf(\"*********FAIL*********\\n\");\n    printf(\"\\n\");\n  }\n\n  \/\/-----------------------------------------------------------------------------\n  \/\/ Keyset 'Seed'\n\n  if(g_testSeed || g_testAll)\n  {\n    printf(\"[[[ Keyset 'Seed' Tests ]]]\\n\\n\");\n\n    bool result = true;\n    bool drawDiagram = false;\n\n    result &= SeedTest<hashtype>( hash, 1000000, drawDiagram );\n\n    if(!result) printf(\"*********FAIL*********\\n\");\n    printf(\"\\n\");\n  }\n}\n\n\/\/-----------------------------------------------------------------------------\n\nuint32_t g_inputVCode = 1;\nuint32_t g_outputVCode = 1;\nuint32_t g_resultVCode = 1;\n\nHashInfo * g_hashUnderTest = NULL;\n\nvoid VerifyHash ( const void * key, int len, uint32_t seed, void * out )\n{\n  g_inputVCode = MurmurOAAT(key,len,g_inputVCode);\n  g_inputVCode = MurmurOAAT(&seed,sizeof(uint32_t),g_inputVCode);\n\n  g_hashUnderTest->hash(key,len,seed,out);\n\n  g_outputVCode = MurmurOAAT(out,g_hashUnderTest->hashbits\/8,g_outputVCode);\n}\n\n\/\/-----------------------------------------------------------------------------\n\nvoid testHash ( const char * name )\n{\n  HashInfo * pInfo = findHash(name);\n\n  if(pInfo == NULL)\n  {\n    printf(\"Invalid hash '%s' specified\\n\",name);\n    return;\n  }\n  else\n  {\n    g_hashUnderTest = pInfo;\n\n    if(pInfo->hashbits == 32)\n    {\n      test<uint32_t>( VerifyHash, pInfo );\n    }\n    else if(pInfo->hashbits == 64)\n    {\n      test<uint64_t>( pInfo->hash, pInfo );\n    }\n    else if(pInfo->hashbits == 128)\n    {\n      test<uint128_t>( pInfo->hash, pInfo );\n    }\n    else if(pInfo->hashbits == 256)\n    {\n      test<uint256_t>( pInfo->hash, pInfo );\n    }\n    else\n    {\n      printf(\"Invalid hash bit width %d for hash '%s'\",pInfo->hashbits,pInfo->name);\n    }\n  }\n}\n\/\/-----------------------------------------------------------------------------\n\nint main ( int argc, char ** argv )\n{\n  const char * hashToTest = \"murmur3a\";\n\n  if(argc < 2)\n  {\n    printf(\"(No test hash given on command line, testing Murmur3_x86_32.)\\n\");\n  }\n  else\n  {\n    hashToTest = argv[1];\n  }\n\n  \/\/ Code runs on the 3rd CPU by default\n\n  SetAffinity((1 << 2));\n\n  SelfTest();\n\n  int timeBegin = clock();\n\n  g_testAll = true;\n\n  \/\/g_testSanity = true;\n  \/\/g_testSpeed = true;\n  \/\/g_testAvalanche = true;\n  \/\/g_testBIC = true;\n  \/\/g_testCyclic = true;\n  \/\/g_testTwoBytes = true;\n  \/\/g_testDiff = true;\n  \/\/g_testDiffDist = true;\n  \/\/g_testSparse = true;\n  \/\/g_testPermutation = true;\n  \/\/g_testWindow = true;\n  \/\/g_testZeroes = true;\n\n  testHash(hashToTest);\n\n  \/\/----------\n\n  int timeEnd = clock();\n\n  printf(\"\\n\");\n  printf(\"Input vcode 0x%08x, Output vcode 0x%08x, Result vcode 0x%08x\\n\",g_inputVCode,g_outputVCode,g_resultVCode);\n  printf(\"Verification value is 0x%08x - Testing took %f seconds\\n\",g_verify,double(timeEnd-timeBegin)\/double(CLOCKS_PER_SEC));\n  printf(\"-------------------------------------------------------------------------------\\n\");\n  return 0;\n}\n<commit_msg>remove main.cpp<commit_after><|endoftext|>"}
{"text":"<commit_before>\/* bzflag\n * Copyright (c) 1993 - 2004 Tim Riker\n *\n * This package is free software;  you can redistribute it and\/or\n * modify it under the terms of the license found in the file\n * named LICENSE that should have accompanied this file.\n *\n * THIS PACKAGE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED\n * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.\n *\/\n#if defined(_MSC_VER)\n\/\/ turn off bogus `this used in base member initialization list'\n#  pragma warning(disable: 4786)\n#endif\n\n#include \"global.h\"\n\n\nconst struct GlobalDBItem globalDBItems[] = {\n  { \"_agilityAdVel\",\t\t\"2.25\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_agilityTimeWindow\",\t\"1.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_agilityVelDelta\",\t        \"0.3\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_angleTolerance\",\t\t\"0.05\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_angularAd\",\t\t\"1.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_avenueSize\",\t\t\"2.0*_boxBase\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_baseSize\",\t\t\"60.0\",                         false, StateDatabase::Locked},\n  { \"_boxBase\",\t\t\t\"30.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_boxHeight\",\t\t\"6.0*_muzzleHeight\",\t\tfalse, StateDatabase::Locked},\n  { \"_burrowAngularAd\",\t\t\"0.55\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_burrowDepth\",\t\t\"-1.32\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_burrowSpeedAd\",\t\t\"0.80\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_coldetDepth\",\t\t\"6\",\t\t\t        false, StateDatabase::Locked},\n  { \"_coldetElements\",\t\t\"4\",\t\t\t        false, StateDatabase::Locked},\n  { \"_cullDepth\",\t\t\"0\",\t\t\t        false, StateDatabase::Locked},\n  { \"_cullElements\",\t\t\"16\",\t\t\t        false, StateDatabase::Locked},\n  { \"_cullOccluders\",\t\t\"0\",\t\t\t        false, StateDatabase::Locked},\n  { \"_explodeTime\",\t\t\"5.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_fakeLag\",\t\t\t\"0.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_flagAltitude\",\t\t\"11.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_flagHeight\",\t\t\"10.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_flagPoleWidth\",\t\t\"0.025\",                        false, StateDatabase::Locked},\n  { \"_flagPoleSize\",\t\t\"0.8\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_flagRadius\",\t\t\"2.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_friction\",\t\t\"0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_gMissileAng\",\t\t\"0.628319\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_gMissileAdLife\",\t\t\"0.95\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_gravity\",\t\t\t\"-9.8\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_identifyRange\",\t\t\"50.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_jumpVelocity\",\t\t\"19.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_laserAdLife\",\t\t\"0.1\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_laserAdRate\",\t\t\"0.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_laserAdVel\",\t\t\"1000.0\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_lockOnAngle\",\t\t\"0.15\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_lRAdRate\",\t\t\"0.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_maxBumpHeight\",\t\t\"0.33\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_maxFlagGrabs\",\t\t\"4.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_maxLOD\",\t\t\t\"32767.0\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_momentumAngAcc\",\t\t\"1.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_momentumLinAcc\",\t\t\"1.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_momentumFriction\",\t\"0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_mGunAdLife\",\t\t\"1.0 \/ _mGunAdRate\",\t\tfalse, StateDatabase::Locked},\n  { \"_mGunAdRate\",\t\t\"10.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_mGunAdVel\",\t\t\"1.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_muzzleFront\",\t\t\"_tankRadius + 0.1\",\t\tfalse, StateDatabase::Locked},\n  { \"_muzzleHeight\",\t\t\"1.57\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_noShadows\",\t\t\"0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_noSmallPackets\",\t\t\"0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_notRespondingTime\",\t\"5.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_obeseFactor\",\t\t\"2.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_pauseDropTime\",\t\t\"15.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_positionTolerance\",\t\"0.09\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_pyrBase\",\t\t\t\"4.0*_tankHeight\",\t\tfalse, StateDatabase::Locked},\n  { \"_pyrHeight\",\t\t\"5.0*_tankHeight\",\t\tfalse, StateDatabase::Locked},\n  { \"_rejoinTime\",\t\t\"_explodeTime\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_reloadTime\",\t\t\"_shotRange \/ _shotSpeed\",\tfalse, StateDatabase::Locked},\n  { \"_rFireAdLife\",\t\t\"1.0 \/ _rFireAdRate\",\t\tfalse, StateDatabase::Locked},\n  { \"_rFireAdRate\",\t\t\"2.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rFireAdVel\",\t\t\"1.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_shieldFlight\",\t\t\"2.7\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_shockAdLife\",\t\t\"0.2\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_shockInRadius\",\t\t\"_tankLength\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_shockOutRadius\",\t\t\"60.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_shotTailLength\",\t\t\"4.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_shotRadius\",\t\t\"0.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_shotRange\",\t\t\"350.0\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_shotSpeed\",\t\t\"100.0\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_shotsKeepVerticalVelocity\",\t\"0\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_srRadiusMult\",\t\t\"2.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_syncTime\",\t\t\"0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_tankExplosionSize\",\t\"3.5 * _tankLength\",\t\tfalse, StateDatabase::Locked},\n  { \"_tankAngVel\",\t\t\"0.785398\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_tankHeight\",\t\t\"2.05\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_tankLength\",\t\t\"6.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_tankRadius\",\t\t\"0.72 * _tankLength\",\t\tfalse, StateDatabase::Locked},\n  { \"_tankSpeed\",\t\t\"25.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_tankWidth\",\t\t\"2.8\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_targetingAngle\",\t\t\"0.3\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_teleportBreadth\",\t\t\"4.48\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_teleportHeight\",\t\t\"10.08\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_teleportTime\",\t\t\"1.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_teleportWidth\",\t\t\"1.12\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_thiefAdLife\",\t\t\"0.05\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_thiefAdRate\",\t\t\"12.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_thiefAdShotVel\",\t\t\"8.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_thiefTinyFactor\",\t\t\"0.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_thiefVelAd\",\t\t\"1.67\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_thiefDropTime\",\t\t\"_reloadTime * 0.5\",\t\tfalse, StateDatabase::Locked},\n  { \"_tinyFactor\",\t\t\"0.4\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_updateThrottleRate\",\t\"30.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_velocityAd\",\t\t\"1.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_wallHeight\",\t\t\"3.0*_tankHeight\",\t\tfalse, StateDatabase::Locked},\n  { \"_wideAngleAng\",\t\t\"1.745329\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_wingsGravity\",\t\t\"_gravity\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_wingsJumpCount\",\t\t\"1\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_wingsJumpVelocity\",\t\"_jumpVelocity\",\t\tfalse, StateDatabase::Locked},\n  { \"_worldSize\",\t\t\"800.0\",\t\t\tfalse, StateDatabase::Locked}\n};\nconst unsigned int\tnumGlobalDBItems = countof(globalDBItems);\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>turn on visual culling by default (with a reasonable value)<commit_after>\/* bzflag\n * Copyright (c) 1993 - 2004 Tim Riker\n *\n * This package is free software;  you can redistribute it and\/or\n * modify it under the terms of the license found in the file\n * named LICENSE that should have accompanied this file.\n *\n * THIS PACKAGE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED\n * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.\n *\/\n#if defined(_MSC_VER)\n\/\/ turn off bogus `this used in base member initialization list'\n#  pragma warning(disable: 4786)\n#endif\n\n#include \"global.h\"\n\n\nconst struct GlobalDBItem globalDBItems[] = {\n  { \"_agilityAdVel\",\t\t\"2.25\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_agilityTimeWindow\",\t\"1.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_agilityVelDelta\",\t        \"0.3\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_angleTolerance\",\t\t\"0.05\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_angularAd\",\t\t\"1.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_avenueSize\",\t\t\"2.0*_boxBase\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_baseSize\",\t\t\"60.0\",                         false, StateDatabase::Locked},\n  { \"_boxBase\",\t\t\t\"30.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_boxHeight\",\t\t\"6.0*_muzzleHeight\",\t\tfalse, StateDatabase::Locked},\n  { \"_burrowAngularAd\",\t\t\"0.55\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_burrowDepth\",\t\t\"-1.32\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_burrowSpeedAd\",\t\t\"0.80\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_coldetDepth\",\t\t\"6\",\t\t\t        false, StateDatabase::Locked},\n  { \"_coldetElements\",\t\t\"4\",\t\t\t        false, StateDatabase::Locked},\n  { \"_cullDepth\",\t\t\"6\",\t\t\t        false, StateDatabase::Locked},\n  { \"_cullElements\",\t\t\"16\",\t\t\t        false, StateDatabase::Locked},\n  { \"_cullOccluders\",\t\t\"0\",\t\t\t        false, StateDatabase::Locked},\n  { \"_explodeTime\",\t\t\"5.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_fakeLag\",\t\t\t\"0.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_flagAltitude\",\t\t\"11.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_flagHeight\",\t\t\"10.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_flagPoleWidth\",\t\t\"0.025\",                        false, StateDatabase::Locked},\n  { \"_flagPoleSize\",\t\t\"0.8\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_flagRadius\",\t\t\"2.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_friction\",\t\t\"0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_gMissileAng\",\t\t\"0.628319\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_gMissileAdLife\",\t\t\"0.95\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_gravity\",\t\t\t\"-9.8\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_identifyRange\",\t\t\"50.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_jumpVelocity\",\t\t\"19.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_laserAdLife\",\t\t\"0.1\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_laserAdRate\",\t\t\"0.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_laserAdVel\",\t\t\"1000.0\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_lockOnAngle\",\t\t\"0.15\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_lRAdRate\",\t\t\"0.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_maxBumpHeight\",\t\t\"0.33\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_maxFlagGrabs\",\t\t\"4.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_maxLOD\",\t\t\t\"32767.0\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_momentumAngAcc\",\t\t\"1.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_momentumLinAcc\",\t\t\"1.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_momentumFriction\",\t\"0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_mGunAdLife\",\t\t\"1.0 \/ _mGunAdRate\",\t\tfalse, StateDatabase::Locked},\n  { \"_mGunAdRate\",\t\t\"10.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_mGunAdVel\",\t\t\"1.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_muzzleFront\",\t\t\"_tankRadius + 0.1\",\t\tfalse, StateDatabase::Locked},\n  { \"_muzzleHeight\",\t\t\"1.57\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_noShadows\",\t\t\"0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_noSmallPackets\",\t\t\"0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_notRespondingTime\",\t\"5.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_obeseFactor\",\t\t\"2.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_pauseDropTime\",\t\t\"15.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_positionTolerance\",\t\"0.09\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_pyrBase\",\t\t\t\"4.0*_tankHeight\",\t\tfalse, StateDatabase::Locked},\n  { \"_pyrHeight\",\t\t\"5.0*_tankHeight\",\t\tfalse, StateDatabase::Locked},\n  { \"_rejoinTime\",\t\t\"_explodeTime\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_reloadTime\",\t\t\"_shotRange \/ _shotSpeed\",\tfalse, StateDatabase::Locked},\n  { \"_rFireAdLife\",\t\t\"1.0 \/ _rFireAdRate\",\t\tfalse, StateDatabase::Locked},\n  { \"_rFireAdRate\",\t\t\"2.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rFireAdVel\",\t\t\"1.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_shieldFlight\",\t\t\"2.7\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_shockAdLife\",\t\t\"0.2\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_shockInRadius\",\t\t\"_tankLength\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_shockOutRadius\",\t\t\"60.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_shotTailLength\",\t\t\"4.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_shotRadius\",\t\t\"0.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_shotRange\",\t\t\"350.0\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_shotSpeed\",\t\t\"100.0\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_shotsKeepVerticalVelocity\",\t\"0\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_srRadiusMult\",\t\t\"2.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_syncTime\",\t\t\"0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_tankExplosionSize\",\t\"3.5 * _tankLength\",\t\tfalse, StateDatabase::Locked},\n  { \"_tankAngVel\",\t\t\"0.785398\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_tankHeight\",\t\t\"2.05\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_tankLength\",\t\t\"6.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_tankRadius\",\t\t\"0.72 * _tankLength\",\t\tfalse, StateDatabase::Locked},\n  { \"_tankSpeed\",\t\t\"25.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_tankWidth\",\t\t\"2.8\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_targetingAngle\",\t\t\"0.3\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_teleportBreadth\",\t\t\"4.48\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_teleportHeight\",\t\t\"10.08\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_teleportTime\",\t\t\"1.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_teleportWidth\",\t\t\"1.12\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_thiefAdLife\",\t\t\"0.05\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_thiefAdRate\",\t\t\"12.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_thiefAdShotVel\",\t\t\"8.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_thiefTinyFactor\",\t\t\"0.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_thiefVelAd\",\t\t\"1.67\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_thiefDropTime\",\t\t\"_reloadTime * 0.5\",\t\tfalse, StateDatabase::Locked},\n  { \"_tinyFactor\",\t\t\"0.4\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_updateThrottleRate\",\t\"30.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_velocityAd\",\t\t\"1.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_wallHeight\",\t\t\"3.0*_tankHeight\",\t\tfalse, StateDatabase::Locked},\n  { \"_wideAngleAng\",\t\t\"1.745329\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_wingsGravity\",\t\t\"_gravity\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_wingsJumpCount\",\t\t\"1\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_wingsJumpVelocity\",\t\"_jumpVelocity\",\t\tfalse, StateDatabase::Locked},\n  { \"_worldSize\",\t\t\"800.0\",\t\t\tfalse, StateDatabase::Locked}\n};\nconst unsigned int\tnumGlobalDBItems = countof(globalDBItems);\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>\/\/ Copyright 2014-2015 the project authors as listed in the AUTHORS file.\n\/\/ All rights reserved. Use of this source code is governed by the\n\/\/ license that can be found in the LICENSE file.\n\n#include \"ArduinoTHSensor2.h\"\n\n#include <stdio.h>\n#include <string.h>\n#include <time.h>\n\n#define DEVICE_ID 11\n#define DEVICE_NAME \"ArduinoTHSensor2\"\n\n#define MIN_PULSE_LENGTH 100\n#define SYNC_DURATION_MIN 700\n#define SYNC_DURATION_MAX 1200\n#define ONE_PULSE_MIN_LENGTH 450\n\nArduinoTHSensor2::ArduinoTHSensor2() : Device() {\n   syncCount = 0;\n   syncFound = false;\n   bitCount = 0;\n   code = 0;\n   memset(durations,0,sizeof(int)*BITS_IN_TH_MESSAGE);\n   pulseCount = 0;\n}\n\nint ArduinoTHSensor2::deviceType(void) {\n   return DEVICE_ID;\n};\n\nchar* ArduinoTHSensor2::deviceName(void) {\n   return (char*) DEVICE_NAME;\n};\n\nvoid ArduinoTHSensor2::processPulse(long duration) {\n   \/\/ any pulse less than MIN_PULSE_LENGTH means we have noise so we are not in the middle\n   \/\/ of a transmision\n   if (duration < MIN_PULSE_LENGTH) {\n      syncFound = false;\n      syncCount = 0;\n      return;\n   }\n\n   \/\/ capture the next bit and decode if we are at the end of the transmission\n   if (syncFound) {\n      pulseCount++;\n      if (0 != (pulseCount%2)) { \n\t \/\/ we only look at every other pulse which is the one at the high level \n         return;\n      }\n\n      \/\/ we are processing a message record the duration of the pulse which \n      \/\/ we will use to build the overall message \n      durations[bitCount] = duration;\n      bitCount++;\n \n      \/\/ ok we have all 40 bits that we expect \n      if (BITS_IN_TH_MESSAGE == bitCount) {\n         for (int i=0; i < BITS_IN_TH_MESSAGE; i++) {\n             code = code << 1;\n             if (ONE_PULSE_MIN_LENGTH > durations[i]) {\n                code = code | 0x1;\n             }\n         }\n\n         if (validateChecksum(code)) { \n            Message* newMessage = queue->getFreeMessage();\n            if (NULL != newMessage) {\n\t\tmemset(newMessage, 0, sizeof(Message));\n                newMessage->device = (void*) this;\n                newMessage->timestamp = time(NULL); \n                newMessage->longCode = code;\n                queue->enqueueMessage(newMessage);\n            } else {\n               \/\/ no messages available so just drop this value\n            }\n         } \n\n        \/\/ ok wait for the next message\n        syncFound = false;\n      } \n   } else {\n      if ((duration > SYNC_DURATION_MIN) && (duration < SYNC_DURATION_MAX)) {\n         syncCount++;\n         if (syncCount == 10 ) {\n            code = 0;\n            syncFound = true;\n            syncCount = 0;\n            bitCount = 0;\n            pulseCount = 0;\n         }\n      } else {\n         syncCount = 0;\n      }\n   }\n};\n\nfloat ArduinoTHSensor2::getTemperature(char* bytes) {\n  return (float) (bytes[1] + bytes[2] * 256)\/10 - 128;\n}\n\nint ArduinoTHSensor2::getHumidity(char* bytes) {\n  return (int) bytes[3];\n}\n\nint ArduinoTHSensor2::getDeviceId(char* bytes) {\n  return (int) bytes[4];\n}\n\nvoid ArduinoTHSensor2::decodeMessage(Message* message) {\n   char* bytes = (char*) &message->longCode;\n   message->type = 1;\n   sprintf(message->text, \"%ld, %x - temp: %f,humidity: %d\",\n           message->timestamp,\n           message->longCode,\n           getTemperature(bytes),\n           getHumidity(bytes));\n};\n\nvoid ArduinoTHSensor2::publishTopic(Message* message, char* buffer, int maxLength) {\n   \/\/ will not be called but still has to be implemented\n   \/\/ until we remove and update the rest of the devices\n}\n\nint ArduinoTHSensor2::numMessages(void) {\n  return 2;\n}\n\nvoid ArduinoTHSensor2::publishTopic(int messageNum, Message* message, char* buffer, int maxLength) {\n   char* bytes = (char*) &message->longCode;\n   if (messageNum == 0) {\n      snprintf(buffer, maxLength, \"house\/arduinoTHSensor\/%x\/temp\", getDeviceId(bytes));\n   } else {\n      snprintf(buffer, maxLength, \"house\/arduinoTHSensor\/%x\/humidity\", getDeviceId(bytes));\n   }\n}\n\nvoid ArduinoTHSensor2::getMessageText(int messageNum, Message* message, char* buffer, int maxLength) {\n   char* bytes = (char*) &message->longCode;\n   if (messageNum == 0) {\n      sprintf(buffer, \"%ld, %x - temp: %f\",\n              message->timestamp,\n              message->longCode,\n              getTemperature(bytes));\n   } else {\n      sprintf(buffer, \"%ld, %x - humidity: %d\",\n              message->timestamp,\n              message->longCode,\n              getHumidity(bytes));\n   }\n}\n\n\/\/ to calculate the checksum first reverse the nibbles in each byte\n\/\/ including the checksum \n\/\/ then add the 3 message bytes together and add 0x77 to get the \n\/\/ expected checksum which is in byte 0 \nbool ArduinoTHSensor2::validateChecksum(uint64_t code) {\n   char* bytes = (char*) & code;\n   char calcChecksum = 0x77;\n   char checksum = ((bytes[0] >> 4) & 0x0F) + ((bytes[0] & 0x0F) << 4);\n\n   for (int i = 1; i < (BITS_IN_TH_MESSAGE\/8); i++) {\n      calcChecksum += ((bytes[i] >> 4) & 0x0F) + ((bytes[i] & 0x0F) << 4);\n   }\n\n   if (calcChecksum == checksum) {\n      return true;\n   }\n\n   return false;\n}\n\n<commit_msg>Fix up converstion of longer code<commit_after>\/\/ Copyright 2014-2015 the project authors as listed in the AUTHORS file.\n\/\/ All rights reserved. Use of this source code is governed by the\n\/\/ license that can be found in the LICENSE file.\n\n#include \"ArduinoTHSensor2.h\"\n\n#include <stdio.h>\n#include <string.h>\n#include <time.h>\n\n#define DEVICE_ID 11\n#define DEVICE_NAME \"ArduinoTHSensor2\"\n\n#define MIN_PULSE_LENGTH 100\n#define SYNC_DURATION_MIN 700\n#define SYNC_DURATION_MAX 1200\n#define ONE_PULSE_MIN_LENGTH 450\n\nArduinoTHSensor2::ArduinoTHSensor2() : Device() {\n   syncCount = 0;\n   syncFound = false;\n   bitCount = 0;\n   code = 0;\n   memset(durations,0,sizeof(int)*BITS_IN_TH_MESSAGE);\n   pulseCount = 0;\n}\n\nint ArduinoTHSensor2::deviceType(void) {\n   return DEVICE_ID;\n};\n\nchar* ArduinoTHSensor2::deviceName(void) {\n   return (char*) DEVICE_NAME;\n};\n\nvoid ArduinoTHSensor2::processPulse(long duration) {\n   \/\/ any pulse less than MIN_PULSE_LENGTH means we have noise so we are not in the middle\n   \/\/ of a transmision\n   if (duration < MIN_PULSE_LENGTH) {\n      syncFound = false;\n      syncCount = 0;\n      return;\n   }\n\n   \/\/ capture the next bit and decode if we are at the end of the transmission\n   if (syncFound) {\n      pulseCount++;\n      if (0 != (pulseCount%2)) { \n\t \/\/ we only look at every other pulse which is the one at the high level \n         return;\n      }\n\n      \/\/ we are processing a message record the duration of the pulse which \n      \/\/ we will use to build the overall message \n      durations[bitCount] = duration;\n      bitCount++;\n \n      \/\/ ok we have all 40 bits that we expect \n      if (BITS_IN_TH_MESSAGE == bitCount) {\n         for (int i=0; i < BITS_IN_TH_MESSAGE; i++) {\n             code = code << 1;\n             if (ONE_PULSE_MIN_LENGTH > durations[i]) {\n                code = code | 0x1;\n             }\n         }\n\n         if (validateChecksum(code)) { \n            Message* newMessage = queue->getFreeMessage();\n            if (NULL != newMessage) {\n\t\tmemset(newMessage, 0, sizeof(Message));\n                newMessage->device = (void*) this;\n                newMessage->timestamp = time(NULL); \n                newMessage->longCode = code;\n                queue->enqueueMessage(newMessage);\n            } else {\n               \/\/ no messages available so just drop this value\n            }\n         } \n\n        \/\/ ok wait for the next message\n        syncFound = false;\n      } \n   } else {\n      if ((duration > SYNC_DURATION_MIN) && (duration < SYNC_DURATION_MAX)) {\n         syncCount++;\n         if (syncCount == 10 ) {\n            code = 0;\n            syncFound = true;\n            syncCount = 0;\n            bitCount = 0;\n            pulseCount = 0;\n         }\n      } else {\n         syncCount = 0;\n      }\n   }\n};\n\nfloat ArduinoTHSensor2::getTemperature(char* bytes) {\n  return (float) (bytes[1] + bytes[2] * 256)\/10 - 128;\n}\n\nint ArduinoTHSensor2::getHumidity(char* bytes) {\n  return (int) bytes[3];\n}\n\nint ArduinoTHSensor2::getDeviceId(char* bytes) {\n  return (int) bytes[4];\n}\n\nvoid ArduinoTHSensor2::decodeMessage(Message* message) {\n   char* bytes = (char*) &message->longCode;\n   message->type = 1;\n   sprintf(message->text, \"%ld, %llx - temp: %f,humidity: %d\",\n           message->timestamp,\n           message->longCode,\n           getTemperature(bytes),\n           getHumidity(bytes));\n};\n\nvoid ArduinoTHSensor2::publishTopic(Message* message, char* buffer, int maxLength) {\n   \/\/ will not be called but still has to be implemented\n   \/\/ until we remove and update the rest of the devices\n}\n\nint ArduinoTHSensor2::numMessages(void) {\n  return 2;\n}\n\nvoid ArduinoTHSensor2::publishTopic(int messageNum, Message* message, char* buffer, int maxLength) {\n   char* bytes = (char*) &message->longCode;\n   if (messageNum == 0) {\n      snprintf(buffer, maxLength, \"house\/arduinoTHSensor\/%x\/temp\", getDeviceId(bytes));\n   } else {\n      snprintf(buffer, maxLength, \"house\/arduinoTHSensor\/%x\/humidity\", getDeviceId(bytes));\n   }\n}\n\nvoid ArduinoTHSensor2::getMessageText(int messageNum, Message* message, char* buffer, int maxLength) {\n   char* bytes = (char*) &message->longCode;\n   if (messageNum == 0) {\n      sprintf(buffer, \"%ld, %llx - temp: %f\",\n              message->timestamp,\n              message->longCode,\n              getTemperature(bytes));\n   } else {\n      sprintf(buffer, \"%ld, %llx - humidity: %d\",\n              message->timestamp,\n              message->longCode,\n              getHumidity(bytes));\n   }\n}\n\n\/\/ to calculate the checksum first reverse the nibbles in each byte\n\/\/ including the checksum \n\/\/ then add the 3 message bytes together and add 0x77 to get the \n\/\/ expected checksum which is in byte 0 \nbool ArduinoTHSensor2::validateChecksum(uint64_t code) {\n   char* bytes = (char*) & code;\n   char calcChecksum = 0x77;\n   char checksum = ((bytes[0] >> 4) & 0x0F) + ((bytes[0] & 0x0F) << 4);\n\n   for (int i = 1; i < (BITS_IN_TH_MESSAGE\/8); i++) {\n      calcChecksum += ((bytes[i] >> 4) & 0x0F) + ((bytes[i] & 0x0F) << 4);\n   }\n\n   if (calcChecksum == checksum) {\n      return true;\n   }\n\n   return false;\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 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#if defined(_MSC_VER)\n\/\/ turn off bogus `this used in base member initialization list'\n#  pragma warning(disable: 4786)\n#endif\n\n#include \"global.h\"\n\n\nconst struct GlobalDBItem globalDBItems[] = {\n  { \"_agilityAdVel\",\t\t\"2.25\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_agilityTimeWindow\",\t\"1.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_agilityVelDelta\",\t\t\"0.3\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_angleTolerance\",\t\t\"0.05\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_angularAd\",\t\t\"1.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_avenueSize\",\t\t\"2.0*_boxBase\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_baseSize\",\t\t\"60.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_boxBase\",\t\t\t\"30.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_boxHeight\",\t\t\"6.0*_muzzleHeight\",\t\tfalse, StateDatabase::Locked},\n  { \"_burrowAngularAd\",\t\t\"0.55\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_burrowDepth\",\t\t\"-1.32\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_burrowSpeedAd\",\t\t\"0.80\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_coldetDepth\",\t\t\"6\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_coldetElements\",\t\t\"4\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_cullDepth\",\t\t\"6\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_cullElements\",\t\t\"16\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_cullOccluders\",\t\t\"0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_disableBots\",\t\t\"0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_drawCelestial\",\t\t\"1\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_drawClouds\",\t\t\"1\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_drawGround\",\t\t\"1\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_drawMountains\",\t\t\"1\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_drawSky\",\t\t\t\"1\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_endShotDetection\",\t\"5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_explodeTime\",\t\t\"5.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_flagAltitude\",\t\t\"11.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_flagEffectTime\",\t\t\"0.64\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_flagHeight\",\t\t\"10.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_flagPoleWidth\",\t\t\"0.025\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_flagPoleSize\",\t\t\"0.8\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_flagRadius\",\t\t\"2.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_friction\",\t\t\"0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_gmActivationTime\",\t\"0.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_gmAdLife\",\t\t\"0.95\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_gmTurnAngle\",\t\t\"0.628319\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_gravity\",\t\t\t\"-9.8\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_handicapScoreDiff\",\t\"50.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_handicapVelAd\",\t\t\"2.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_handicapAngAd\",\t\t\"1.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_handicapShotAd\",\t\t\"1.75\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_identifyRange\",\t\t\"50.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_jumpVelocity\",\t\t\"19.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_laserAdLife\",\t\t\"0.1\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_laserAdRate\",\t\t\"0.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_laserAdVel\",\t\t\"1000.0\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_latitude\",\t\t\"37.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_lockOnAngle\",\t\t\"0.15\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_longitude\",\t\t\"122\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_lRAdRate\",\t\t\"0.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_maxBumpHeight\",\t\t\"0.33\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_maxFlagGrabs\",\t\t\"4.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_maxLOD\",\t\t\t\"32767.0\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_mirror\",\t\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_momentumAngAcc\",\t\t\"1.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_momentumLinAcc\",\t\t\"1.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_momentumFriction\",\t\"0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_mGunAdLife\",\t\t\"1.0 \/ _mGunAdRate\",\t\tfalse, StateDatabase::Locked},\n  { \"_mGunAdRate\",\t\t\"10.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_mGunAdVel\",\t\t\"1.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_muzzleFront\",\t\t\"_tankRadius + 0.1\",\t\tfalse, StateDatabase::Locked},\n  { \"_muzzleHeight\",\t\t\"1.57\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_noClimb\",\t\t\t\"1\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_noShadows\",\t\t\"0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_noSmallPackets\",\t\t\"0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_notRespondingTime\",\t\"5.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_obeseFactor\",\t\t\"2.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_pauseDropTime\",\t\t\"15.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_positionTolerance\",\t\"0.09\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_pyrBase\",\t\t\t\"4.0*_tankHeight\",\t\tfalse, StateDatabase::Locked},\n  { \"_pyrHeight\",\t\t\"5.0*_tankHeight\",\t\tfalse, StateDatabase::Locked},\n  { \"_rainBaseColor\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_radarLimit\",\t\t\"_worldSize\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainRoofs\",\t\t\"1\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainDensity\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainEndZ\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainMaxPuddleTime\",\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainPuddleSpeed\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainPuddleColor\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainPuddleTexture\",\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainSpread\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainSpeed\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainSpeedMod\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainSpins\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainStartZ\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainTexture\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainTopColor\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainType\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rejoinTime\",\t\t\"_explodeTime\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_reloadTime\",\t\t\"_shotRange \/ _shotSpeed\",\tfalse, StateDatabase::Locked},\n  { \"_rFireAdLife\",\t\t\"1.0 \/ _rFireAdRate\",\t\tfalse, StateDatabase::Locked},\n  { \"_rFireAdRate\",\t\t\"2.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rFireAdVel\",\t\t\"1.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_shieldFlight\",\t\t\"2.7\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_shockAdLife\",\t\t\"0.2\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_shockInRadius\",\t\t\"_tankLength\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_shockOutRadius\",\t\t\"60.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_shotTailLength\",\t\t\"4.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_shotRadius\",\t\t\"0.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_shotRange\",\t\t\"350.0\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_shotSpeed\",\t\t\"100.0\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_shotsKeepVerticalVelocity\",\t\"0\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_skyColor\",\t\t\"white\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_srRadiusMult\",\t\t\"2.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_squishFactor\",\t\t\"1.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_squishTime\",\t\t\"1.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_syncTime\",\t\t\"-1.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_syncLocation\",\t\t\"0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_tankExplosionSize\",\t\"3.5 * _tankLength\",\t\tfalse, StateDatabase::Locked},\n  { \"_tankAngVel\",\t\t\"0.785398\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_tankHeight\",\t\t\"2.05\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_tankLength\",\t\t\"6.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_tankRadius\",\t\t\"0.72 * _tankLength\",\t\tfalse, StateDatabase::Locked},\n  { \"_tankSpeed\",\t\t\"25.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_tankWidth\",\t\t\"2.8\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_targetingAngle\",\t\t\"0.3\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_teleportBreadth\",\t\t\"4.48\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_teleportHeight\",\t\t\"10.08\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_teleportTime\",\t\t\"1.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_teleportWidth\",\t\t\"1.12\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_thiefAdLife\",\t\t\"0.05\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_thiefAdRate\",\t\t\"12.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_thiefAdShotVel\",\t\t\"8.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_thiefTinyFactor\",\t\t\"0.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_thiefVelAd\",\t\t\"1.67\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_thiefDropTime\",\t\t\"_reloadTime * 0.5\",\t\tfalse, StateDatabase::Locked},\n  { \"_tinyFactor\",\t\t\"0.4\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_trackFade\",\t\t\"3.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_updateThrottleRate\",\t\"30.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_useLineRain\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_useRainPuddles\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_useRainBillboards\",\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_velocityAd\",\t\t\"1.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_wallHeight\",\t\t\"3.0*_tankHeight\",\t\tfalse, StateDatabase::Locked},\n  { \"_weapons\",\t\t\t\"1\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_wideAngleAng\",\t\t\"1.745329\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_wingsGravity\",\t\t\"0.5*_gravity\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_wingsJumpCount\",\t\t\"1\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_wingsJumpVelocity\",\t\"0.5*_jumpVelocity\",\t\tfalse, StateDatabase::Locked},\n  { \"_wingsSlideTime\",\t\t\"1.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_worldSize\",\t\t\"800.0\",\t\t\tfalse, StateDatabase::Locked}\n\n};\nconst unsigned int\tnumGlobalDBItems = countof(globalDBItems);\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>revert _wings var changes<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#if defined(_MSC_VER)\n\/\/ turn off bogus `this used in base member initialization list'\n#  pragma warning(disable: 4786)\n#endif\n\n#include \"global.h\"\n\n\nconst struct GlobalDBItem globalDBItems[] = {\n  { \"_agilityAdVel\",\t\t\"2.25\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_agilityTimeWindow\",\t\"1.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_agilityVelDelta\",\t\t\"0.3\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_angleTolerance\",\t\t\"0.05\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_angularAd\",\t\t\"1.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_avenueSize\",\t\t\"2.0*_boxBase\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_baseSize\",\t\t\"60.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_boxBase\",\t\t\t\"30.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_boxHeight\",\t\t\"6.0*_muzzleHeight\",\t\tfalse, StateDatabase::Locked},\n  { \"_burrowAngularAd\",\t\t\"0.55\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_burrowDepth\",\t\t\"-1.32\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_burrowSpeedAd\",\t\t\"0.80\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_coldetDepth\",\t\t\"6\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_coldetElements\",\t\t\"4\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_cullDepth\",\t\t\"6\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_cullElements\",\t\t\"16\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_cullOccluders\",\t\t\"0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_disableBots\",\t\t\"0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_drawCelestial\",\t\t\"1\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_drawClouds\",\t\t\"1\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_drawGround\",\t\t\"1\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_drawMountains\",\t\t\"1\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_drawSky\",\t\t\t\"1\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_endShotDetection\",\t\"5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_explodeTime\",\t\t\"5.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_flagAltitude\",\t\t\"11.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_flagEffectTime\",\t\t\"0.64\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_flagHeight\",\t\t\"10.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_flagPoleWidth\",\t\t\"0.025\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_flagPoleSize\",\t\t\"0.8\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_flagRadius\",\t\t\"2.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_friction\",\t\t\"0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_gmActivationTime\",\t\"0.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_gmAdLife\",\t\t\"0.95\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_gmTurnAngle\",\t\t\"0.628319\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_gravity\",\t\t\t\"-9.8\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_handicapScoreDiff\",\t\"50.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_handicapVelAd\",\t\t\"2.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_handicapAngAd\",\t\t\"1.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_handicapShotAd\",\t\t\"1.75\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_identifyRange\",\t\t\"50.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_jumpVelocity\",\t\t\"19.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_laserAdLife\",\t\t\"0.1\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_laserAdRate\",\t\t\"0.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_laserAdVel\",\t\t\"1000.0\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_latitude\",\t\t\"37.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_lockOnAngle\",\t\t\"0.15\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_longitude\",\t\t\"122\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_lRAdRate\",\t\t\"0.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_maxBumpHeight\",\t\t\"0.33\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_maxFlagGrabs\",\t\t\"4.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_maxLOD\",\t\t\t\"32767.0\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_mirror\",\t\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_momentumAngAcc\",\t\t\"1.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_momentumLinAcc\",\t\t\"1.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_momentumFriction\",\t\"0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_mGunAdLife\",\t\t\"1.0 \/ _mGunAdRate\",\t\tfalse, StateDatabase::Locked},\n  { \"_mGunAdRate\",\t\t\"10.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_mGunAdVel\",\t\t\"1.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_muzzleFront\",\t\t\"_tankRadius + 0.1\",\t\tfalse, StateDatabase::Locked},\n  { \"_muzzleHeight\",\t\t\"1.57\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_noClimb\",\t\t\t\"1\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_noShadows\",\t\t\"0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_noSmallPackets\",\t\t\"0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_notRespondingTime\",\t\"5.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_obeseFactor\",\t\t\"2.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_pauseDropTime\",\t\t\"15.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_positionTolerance\",\t\"0.09\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_pyrBase\",\t\t\t\"4.0*_tankHeight\",\t\tfalse, StateDatabase::Locked},\n  { \"_pyrHeight\",\t\t\"5.0*_tankHeight\",\t\tfalse, StateDatabase::Locked},\n  { \"_rainBaseColor\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_radarLimit\",\t\t\"_worldSize\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainRoofs\",\t\t\"1\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainDensity\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainEndZ\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainMaxPuddleTime\",\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainPuddleSpeed\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainPuddleColor\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainPuddleTexture\",\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainSpread\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainSpeed\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainSpeedMod\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainSpins\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainStartZ\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainTexture\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainTopColor\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rainType\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rejoinTime\",\t\t\"_explodeTime\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_reloadTime\",\t\t\"_shotRange \/ _shotSpeed\",\tfalse, StateDatabase::Locked},\n  { \"_rFireAdLife\",\t\t\"1.0 \/ _rFireAdRate\",\t\tfalse, StateDatabase::Locked},\n  { \"_rFireAdRate\",\t\t\"2.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_rFireAdVel\",\t\t\"1.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_shieldFlight\",\t\t\"2.7\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_shockAdLife\",\t\t\"0.2\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_shockInRadius\",\t\t\"_tankLength\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_shockOutRadius\",\t\t\"60.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_shotTailLength\",\t\t\"4.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_shotRadius\",\t\t\"0.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_shotRange\",\t\t\"350.0\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_shotSpeed\",\t\t\"100.0\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_shotsKeepVerticalVelocity\",\t\"0\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_skyColor\",\t\t\"white\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_srRadiusMult\",\t\t\"2.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_squishFactor\",\t\t\"1.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_squishTime\",\t\t\"1.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_syncTime\",\t\t\"-1.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_syncLocation\",\t\t\"0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_tankExplosionSize\",\t\"3.5 * _tankLength\",\t\tfalse, StateDatabase::Locked},\n  { \"_tankAngVel\",\t\t\"0.785398\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_tankHeight\",\t\t\"2.05\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_tankLength\",\t\t\"6.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_tankRadius\",\t\t\"0.72 * _tankLength\",\t\tfalse, StateDatabase::Locked},\n  { \"_tankSpeed\",\t\t\"25.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_tankWidth\",\t\t\"2.8\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_targetingAngle\",\t\t\"0.3\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_teleportBreadth\",\t\t\"4.48\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_teleportHeight\",\t\t\"10.08\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_teleportTime\",\t\t\"1.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_teleportWidth\",\t\t\"1.12\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_thiefAdLife\",\t\t\"0.05\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_thiefAdRate\",\t\t\"12.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_thiefAdShotVel\",\t\t\"8.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_thiefTinyFactor\",\t\t\"0.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_thiefVelAd\",\t\t\"1.67\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_thiefDropTime\",\t\t\"_reloadTime * 0.5\",\t\tfalse, StateDatabase::Locked},\n  { \"_tinyFactor\",\t\t\"0.4\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_trackFade\",\t\t\"3.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_updateThrottleRate\",\t\"30.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_useLineRain\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_useRainPuddles\",\t\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_useRainBillboards\",\t\"none\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_velocityAd\",\t\t\"1.5\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_wallHeight\",\t\t\"3.0*_tankHeight\",\t\tfalse, StateDatabase::Locked},\n  { \"_weapons\",\t\t\t\"1\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_wideAngleAng\",\t\t\"1.745329\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_wingsGravity\",\t\t\"_gravity\",\t\t\tfalse, StateDatabase::Locked},\n  { \"_wingsJumpCount\",\t\t\"1\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_wingsJumpVelocity\",\t\"_jumpVelocity\",\t\tfalse, StateDatabase::Locked},\n  { \"_wingsSlideTime\",\t\t\"1.0\",\t\t\t\tfalse, StateDatabase::Locked},\n  { \"_worldSize\",\t\t\"800.0\",\t\t\tfalse, StateDatabase::Locked}\n\n};\nconst unsigned int\tnumGlobalDBItems = countof(globalDBItems);\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>\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2018 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\/\/ Local include files\n#include \"libmesh\/libmesh_common.h\"\n#include \"libmesh\/error_estimator.h\"\n#include \"libmesh\/error_vector.h\"\n#include \"libmesh\/equation_systems.h\"\n#include \"libmesh\/parallel.h\"\n#include \"libmesh\/enum_error_estimator_type.h\"\n\n\n\nnamespace libMesh\n{\n\n\/\/ ErrorEstimator functions\nvoid ErrorEstimator::reduce_error (std::vector<ErrorVectorReal> & error_per_cell,\n                                   const Parallel::Communicator & comm) const\n{\n  \/\/ This function must be run on all processors at once\n  \/\/ parallel_object_only();\n\n  \/\/ Each processor has now computed the error contributions\n  \/\/ for its local elements.  We may need to sum the vector to\n  \/\/ recover the error for each element.\n\n  comm.sum(error_per_cell);\n}\n\n\n\nvoid ErrorEstimator::estimate_errors(const EquationSystems & equation_systems,\n                                     ErrorVector & error_per_cell,\n                                     const std::map<const System *, SystemNorm> & error_norms,\n                                     const std::map<const System *, const NumericVector<Number> *> * solution_vectors,\n                                     bool estimate_parent_error)\n{\n  SystemNorm old_error_norm = this->error_norm;\n\n  \/\/ Sum the error values from each system\n  for (unsigned int s = 0; s != equation_systems.n_systems(); ++s)\n    {\n      ErrorVector system_error_per_cell;\n      const System & sys = equation_systems.get_system(s);\n      if (error_norms.find(&sys) == error_norms.end())\n        this->error_norm = old_error_norm;\n      else\n        this->error_norm = error_norms.find(&sys)->second;\n\n      const NumericVector<Number> * solution_vector = nullptr;\n      if (solution_vectors &&\n          solution_vectors->find(&sys) != solution_vectors->end())\n        solution_vector = solution_vectors->find(&sys)->second;\n\n      this->estimate_error(sys, system_error_per_cell,\n                           solution_vector, estimate_parent_error);\n\n      if (s)\n        {\n          libmesh_assert_equal_to (error_per_cell.size(), system_error_per_cell.size());\n          for (std::size_t i=0; i != error_per_cell.size(); ++i)\n            error_per_cell[i] += system_error_per_cell[i];\n        }\n      else\n        error_per_cell = system_error_per_cell;\n    }\n\n  \/\/ Restore our old state before returning\n  this->error_norm = old_error_norm;\n}\n\n\n\n\/**\n * FIXME: This is a default implementation - derived classes should\n * reimplement it for efficiency.\n *\/\nvoid ErrorEstimator::estimate_errors(const EquationSystems & equation_systems,\n                                     ErrorMap & errors_per_cell,\n                                     const std::map<const System *, const NumericVector<Number> *> * solution_vectors,\n                                     bool estimate_parent_error)\n{\n  SystemNorm old_error_norm = this->error_norm;\n\n  \/\/ Find the requested error values from each system\n  for (unsigned int s = 0; s != equation_systems.n_systems(); ++s)\n    {\n      const System & sys = equation_systems.get_system(s);\n\n      unsigned int n_vars = sys.n_vars();\n\n      for (unsigned int v = 0; v != n_vars; ++v)\n        {\n          \/\/ Only fill in ErrorVectors the user asks for\n          if (errors_per_cell.find(std::make_pair(&sys, v)) ==\n              errors_per_cell.end())\n            continue;\n\n          \/\/ Calculate error in only one variable\n          std::vector<Real> weights(n_vars, 0.0);\n          weights[v] = 1.0;\n          this->error_norm =\n            SystemNorm(std::vector<FEMNormType>(n_vars, old_error_norm.type(v)),\n                       weights);\n\n          const NumericVector<Number> * solution_vector = nullptr;\n          if (solution_vectors &&\n              solution_vectors->find(&sys) != solution_vectors->end())\n            solution_vector = solution_vectors->find(&sys)->second;\n\n          this->estimate_error\n            (sys, *errors_per_cell[std::make_pair(&sys, v)],\n             solution_vector, estimate_parent_error);\n        }\n    }\n\n  \/\/ Restore our old state before returning\n  this->error_norm = old_error_norm;\n}\n\n} \/\/ namespace libMesh\n<commit_msg>Range-based for loops in error_estimator.C<commit_after>\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2018 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\/\/ Local include files\n#include \"libmesh\/libmesh_common.h\"\n#include \"libmesh\/error_estimator.h\"\n#include \"libmesh\/error_vector.h\"\n#include \"libmesh\/equation_systems.h\"\n#include \"libmesh\/parallel.h\"\n#include \"libmesh\/enum_error_estimator_type.h\"\n#include \"libmesh\/int_range.h\"\n\nnamespace libMesh\n{\n\n\/\/ ErrorEstimator functions\nvoid ErrorEstimator::reduce_error (std::vector<ErrorVectorReal> & error_per_cell,\n                                   const Parallel::Communicator & comm) const\n{\n  \/\/ This function must be run on all processors at once\n  \/\/ parallel_object_only();\n\n  \/\/ Each processor has now computed the error contributions\n  \/\/ for its local elements.  We may need to sum the vector to\n  \/\/ recover the error for each element.\n\n  comm.sum(error_per_cell);\n}\n\n\n\nvoid ErrorEstimator::estimate_errors(const EquationSystems & equation_systems,\n                                     ErrorVector & error_per_cell,\n                                     const std::map<const System *, SystemNorm> & error_norms,\n                                     const std::map<const System *, const NumericVector<Number> *> * solution_vectors,\n                                     bool estimate_parent_error)\n{\n  SystemNorm old_error_norm = this->error_norm;\n\n  \/\/ Sum the error values from each system\n  for (unsigned int s = 0; s != equation_systems.n_systems(); ++s)\n    {\n      ErrorVector system_error_per_cell;\n      const System & sys = equation_systems.get_system(s);\n      if (error_norms.find(&sys) == error_norms.end())\n        this->error_norm = old_error_norm;\n      else\n        this->error_norm = error_norms.find(&sys)->second;\n\n      const NumericVector<Number> * solution_vector = nullptr;\n      if (solution_vectors &&\n          solution_vectors->find(&sys) != solution_vectors->end())\n        solution_vector = solution_vectors->find(&sys)->second;\n\n      this->estimate_error(sys, system_error_per_cell,\n                           solution_vector, estimate_parent_error);\n\n      if (s)\n        {\n          libmesh_assert_equal_to (error_per_cell.size(), system_error_per_cell.size());\n          for (auto i : index_range(error_per_cell))\n            error_per_cell[i] += system_error_per_cell[i];\n        }\n      else\n        error_per_cell = system_error_per_cell;\n    }\n\n  \/\/ Restore our old state before returning\n  this->error_norm = old_error_norm;\n}\n\n\n\n\/**\n * FIXME: This is a default implementation - derived classes should\n * reimplement it for efficiency.\n *\/\nvoid ErrorEstimator::estimate_errors(const EquationSystems & equation_systems,\n                                     ErrorMap & errors_per_cell,\n                                     const std::map<const System *, const NumericVector<Number> *> * solution_vectors,\n                                     bool estimate_parent_error)\n{\n  SystemNorm old_error_norm = this->error_norm;\n\n  \/\/ Find the requested error values from each system\n  for (unsigned int s = 0; s != equation_systems.n_systems(); ++s)\n    {\n      const System & sys = equation_systems.get_system(s);\n\n      unsigned int n_vars = sys.n_vars();\n\n      for (unsigned int v = 0; v != n_vars; ++v)\n        {\n          \/\/ Only fill in ErrorVectors the user asks for\n          if (errors_per_cell.find(std::make_pair(&sys, v)) ==\n              errors_per_cell.end())\n            continue;\n\n          \/\/ Calculate error in only one variable\n          std::vector<Real> weights(n_vars, 0.0);\n          weights[v] = 1.0;\n          this->error_norm =\n            SystemNorm(std::vector<FEMNormType>(n_vars, old_error_norm.type(v)),\n                       weights);\n\n          const NumericVector<Number> * solution_vector = nullptr;\n          if (solution_vectors &&\n              solution_vectors->find(&sys) != solution_vectors->end())\n            solution_vector = solution_vectors->find(&sys)->second;\n\n          this->estimate_error\n            (sys, *errors_per_cell[std::make_pair(&sys, v)],\n             solution_vector, estimate_parent_error);\n        }\n    }\n\n  \/\/ Restore our old state before returning\n  this->error_norm = old_error_norm;\n}\n\n} \/\/ namespace libMesh\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 \"mainwindow.h\"\n#include <QMenuBar>\n#include <QDockWidget>\n#include <KFileDialog>\n#include <KStandardAction>\n#include <KActionCollection>\n#include <KAction>\n\n#include <gluon\/gdlhandler.h>\n#include <gluon\/gluonobject.h>\n#include <gluon\/gameobject.h>\n#include <QTextEdit>\n#include <QVBoxLayout>\n#include <QTreeView>\n#include <QDebug>\n\n#include \"gameobjecttreemodel.h\"\n#include \"qobjecttreemodel.h\"\n#include <klocalizedstring.h>\n#include <qlistview.h>\n\n\nMainWindow::MainWindow() : KXmlGuiWindow()\n{\n    \/\/m_qObjectTree = new QTreeView();\n    \/\/m_gameObjectTree = new QTreeView();\n    \n    QTabWidget* main = new QTabWidget(this);\n    main->addTab(new QWidget(main), i18n(\"Preview\"));\n    main->addTab(new QWidget(main), i18n(\"Edit\"));\n    \/\/QVBoxLayout* layout = new QVBoxLayout;\n\n    \/\/layout->addWidget(m_qObjectTree);\n    \/\/layout->addWidget(m_gameObjectTree);\n\n    \/\/main->setLayout(layout);\n\n    setCentralWidget(main);\n\n    setupActions();\n    setupDocks();\n\n    setupGUI();\n}\n\nMainWindow::~MainWindow()\n{\n    \n}\n\nvoid MainWindow::newProject()\n{\n    \n}\n\nvoid MainWindow::openProject()\n{   \n    QString filename = KFileDialog::getOpenFileName();\n    if(filename != \"\")\n    {\n        QFile file(filename);\n        file.open(QIODevice::ReadOnly);\n        \n        QString data = file.readAll();\n\n        QList<Gluon::GluonObject*> objects = Gluon::GDLHandler::instance()->parseGDL(data, this);\n\n        Gluon::GluonObject* object = objects.at(0);\n        \n        QObjectTreeModel *qtree = new QObjectTreeModel(object, m_qObjectTree);\n        m_qObjectTree->setModel(qtree);\n\n        GameObjectTreeModel *gtree = new GameObjectTreeModel(qobject_cast<Gluon::GameObject*>(object), m_gameObjectTree);\n        m_gameObjectTree->setModel(gtree);\n    }\n}\n\nvoid MainWindow::saveProject()\n{\n\n}\n\nvoid MainWindow::saveProjectAs()\n{\n\n}\n\nvoid MainWindow::setupActions()\n{\n    KStandardAction::openNew(this, SLOT(newProject()), actionCollection());\n    KStandardAction::open(this, SLOT(openProject()), actionCollection());\n    KStandardAction::save(this, SLOT(saveProject()), actionCollection());\n    KStandardAction::saveAs(this, SLOT(saveProjectAs()), actionCollection());\n    KStandardAction::quit(this, SLOT(close()), actionCollection());\n    \n    \n}\n\nvoid MainWindow::setupDocks()\n{\n    \/\/Create Scene Dock\n    QDockWidget* sceneDock = new QDockWidget(this);\n    addDockWidget(Qt::LeftDockWidgetArea, sceneDock);\n    sceneDock->setWindowTitle(i18n(\"Scene\"));\n    sceneDock->setObjectName(\"sceneDock\");\n    m_gameObjectTree = new QTreeView(sceneDock);\n    sceneDock->setWidget(m_gameObjectTree);\n\n    \/\/Create scene dock actions\n    KAction* showSceneDockAction = new KAction(i18n(\"Show Scene Dock\"), this);\n    actionCollection()->addAction(\"showSceneDockAction\", showSceneDockAction);\n    showSceneDockAction->setCheckable(true);\n    connect(showSceneDockAction, SIGNAL(toggled(bool)), sceneDock, SLOT(setVisible(bool)));\n    \/\/showSceneDockActions\n\n    QDockWidget* projectDock = new QDockWidget(this);\n    addDockWidget(Qt::LeftDockWidgetArea, projectDock);\n    projectDock->setWindowTitle(i18n(\"Project\"));\n    projectDock->setObjectName(\"projectDock\");\n    m_qObjectTree = new QTreeView(projectDock);\n    projectDock->setWidget(m_qObjectTree);\n    \n    QDockWidget* propertiesDock = new QDockWidget(this);\n    addDockWidget(Qt::RightDockWidgetArea, propertiesDock);\n    propertiesDock->setWindowTitle(i18n(\"Properties\"));\n    propertiesDock->setObjectName(\"propertiesDock\");\n    propertiesDock->setWidget(new QListView(propertiesDock));\n    \n    QDockWidget* messageDock = new QDockWidget(this);\n    addDockWidget(Qt::BottomDockWidgetArea, messageDock);\n    messageDock->setWindowTitle(i18n(\"Messages\"));\n    messageDock->setObjectName(\"messageDock\");\n    messageDock->setWidget(new QTextEdit(messageDock));\n    \n}\n<commit_msg>More Gluon Creator work<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 \"mainwindow.h\"\n#include <QMenuBar>\n#include <QDockWidget>\n#include <KFileDialog>\n#include <KStandardAction>\n#include <KActionCollection>\n#include <KAction>\n\n#include <gluon\/gdlhandler.h>\n#include <gluon\/gluonobject.h>\n#include <gluon\/gameobject.h>\n#include <QTextEdit>\n#include <QVBoxLayout>\n#include <QTreeView>\n#include <QDebug>\n\n#include \"gameobjecttreemodel.h\"\n#include \"qobjecttreemodel.h\"\n#include <klocalizedstring.h>\n#include <qlistview.h>\n#include <gluon\/kgl\/kglview.h>\n\n\nMainWindow::MainWindow() : KXmlGuiWindow()\n{\n    \/\/m_qObjectTree = new QTreeView();\n    \/\/m_gameObjectTree = new QTreeView();\n    \n    QWidget* main = new QWidget(this);\n    main->setSizePolicy(QSizePolicy(QSizePolicy::Fixed, QSizePolicy::Fixed));\n    main->setFixedSize(QSize(1,1));\n    \/\/main->addTab(new QWidget(main), i18n(\"Preview\"));\n    \/\/main->addTab(new QWidget(main), i18n(\"Edit\"));\n    \/\/QVBoxLayout* layout = new QVBoxLayout;\n\n    \/\/layout->addWidget(m_qObjectTree);\n    \/\/layout->addWidget(m_gameObjectTree);\n\n    \/\/main->setLayout(layout);\n\n    setCentralWidget(main);\n\n    setDockNestingEnabled(true);\n    setCorner(Qt::BottomLeftCorner, Qt::LeftDockWidgetArea);\n    setCorner(Qt::TopLeftCorner, Qt::LeftDockWidgetArea);\n    setCorner(Qt::BottomRightCorner, Qt::RightDockWidgetArea);\n    setCorner(Qt::TopRightCorner, Qt::RightDockWidgetArea);\n\n    setupActions();\n    setupDocks();\n\n    setupGUI();\n}\n\nMainWindow::~MainWindow()\n{\n    \n}\n\nvoid MainWindow::newProject()\n{\n    \n}\n\nvoid MainWindow::openProject()\n{   \n    QString filename = KFileDialog::getOpenFileName();\n    if(filename != \"\")\n    {\n        QFile file(filename);\n        file.open(QIODevice::ReadOnly);\n        \n        QString data = file.readAll();\n\n        QList<Gluon::GluonObject*> objects = Gluon::GDLHandler::instance()->parseGDL(data, this);\n\n        Gluon::GluonObject* object = objects.at(0);\n        \n        QObjectTreeModel *qtree = new QObjectTreeModel(object, m_qObjectTree);\n        m_qObjectTree->setModel(qtree);\n\n        GameObjectTreeModel *gtree = new GameObjectTreeModel(qobject_cast<Gluon::GameObject*>(object), m_gameObjectTree);\n        m_gameObjectTree->setModel(gtree);\n    }\n}\n\nvoid MainWindow::saveProject()\n{\n\n}\n\nvoid MainWindow::saveProjectAs()\n{\n\n}\n\nvoid MainWindow::setupActions()\n{\n    KStandardAction::openNew(this, SLOT(newProject()), actionCollection());\n    KStandardAction::open(this, SLOT(openProject()), actionCollection());\n    KStandardAction::save(this, SLOT(saveProject()), actionCollection());\n    KStandardAction::saveAs(this, SLOT(saveProjectAs()), actionCollection());\n    KStandardAction::quit(this, SLOT(close()), actionCollection());\n    \n    \n}\n\nvoid MainWindow::setupDocks()\n{\n    \/\/Create Scene Dock\n    QDockWidget* sceneDock = new QDockWidget(this);\n    addDockWidget(Qt::LeftDockWidgetArea, sceneDock, Qt::Vertical);\n    sceneDock->setWindowTitle(i18n(\"Scene\"));\n    sceneDock->setObjectName(\"sceneDock\");\n    \/\/sceneDock->setAllowedAreas(Qt::TopDockWidgetArea);\n    m_gameObjectTree = new QTreeView(sceneDock);\n    sceneDock->setWidget(m_gameObjectTree);\n    layout()->setAlignment(sceneDock, Qt::AlignLeft);\n\n    \/\/Create scene dock actions\n    KAction* showSceneDockAction = new KAction(i18n(\"Show Scene Dock\"), this);\n    actionCollection()->addAction(\"showSceneDockAction\", showSceneDockAction);\n    showSceneDockAction->setCheckable(true);\n    connect(showSceneDockAction, SIGNAL(toggled(bool)), sceneDock, SLOT(setVisible(bool)));\n    \/\/showSceneDockActions\n\n    QDockWidget* projectDock = new QDockWidget(this);\n    addDockWidget(Qt::LeftDockWidgetArea, projectDock, Qt::Vertical);\n    projectDock->setWindowTitle(i18n(\"Project\"));\n    projectDock->setObjectName(\"projectDock\");\n    \/\/projectDock->setAllowedAreas(Qt::TopDockWidgetArea);\n    m_qObjectTree = new QTreeView(projectDock);\n    projectDock->setWidget(m_qObjectTree);\n    layout()->setAlignment(projectDock, Qt::AlignLeft);\n    \/\/tabifyDockWidget(sceneDock, projectDock);\n\n    QDockWidget* gameDock = new QDockWidget(i18n(\"Preview\"), this);\n    gameDock->setObjectName(\"gameDock\");\n    addDockWidget(Qt::TopDockWidgetArea, gameDock, Qt::Horizontal);\n    gameDock->setWidget(new KGLView(gameDock));\n    gameDock->setSizePolicy(QSizePolicy::Expanding, QSizePolicy::Expanding);\n    layout()->setAlignment(gameDock, Qt::AlignTop);\n    \n    QDockWidget* editDock = new QDockWidget(i18n(\"Edit\"), this);\n    editDock->setObjectName(\"editDock\");\n    addDockWidget(Qt::TopDockWidgetArea, editDock, Qt::Horizontal);\n    editDock->setWidget(new KGLView(editDock));\n    editDock->setSizePolicy(QSizePolicy::Expanding, QSizePolicy::Expanding);\n    layout()->setAlignment(editDock, Qt::AlignTop);\n\n    tabifyDockWidget(gameDock, editDock);\n\n    QDockWidget* messageDock = new QDockWidget(this);\n    addDockWidget(Qt::TopDockWidgetArea, messageDock, Qt::Vertical);\n    messageDock->setWindowTitle(i18n(\"Messages\"));\n    messageDock->setObjectName(\"messageDock\");\n    messageDock->setAllowedAreas(Qt::TopDockWidgetArea);\n    messageDock->setWidget(new QTextEdit(messageDock));\n    layout()->setAlignment(messageDock, Qt::AlignBottom);\n\n    QDockWidget* propertiesDock = new QDockWidget(this);\n    addDockWidget(Qt::RightDockWidgetArea, propertiesDock); \/\/, Qt::Horizontal);\n    propertiesDock->setWindowTitle(i18n(\"Properties\"));\n    propertiesDock->setObjectName(\"propertiesDock\");\n    propertiesDock->setAllowedAreas(Qt::TopDockWidgetArea);\n    propertiesDock->setWidget(new QListView(propertiesDock));\n    layout()->setAlignment(propertiesDock, Qt::AlignRight);\n    \n    QDockWidget* componentDock = new QDockWidget(this);\n    addDockWidget(Qt::RightDockWidgetArea, componentDock); \/\/, Qt::Vertical);\n    componentDock->setWindowTitle(i18n(\"Components\"));\n    componentDock->setObjectName(\"compoentDock\");\n    componentDock->setAllowedAreas(Qt::TopDockWidgetArea);\n    \/\/messageDock->setWidget(new QTextEdit(comDock));*\/\n    \/\/this->\n    \/\/this->layout()->\n\n    setTabPosition(Qt::TopDockWidgetArea, QTabWidget::North);\n    \n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/=============================================================================================================\n\/**\n * @file     main.cpp\n * @author   Christoph Dinh <chdinh@nmr.mgh.harvard.edu>;\n *           Lorenz Esch <lesch@mgh.harvard.edu>\n * @since    0.1.0\n * @date     February, 2013\n *\n * @section  LICENSE\n *\n * Copyright (C) 2013, Christoph Dinh, Lorenz Esch. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without modification, are permitted provided that\n * the following conditions are met:\n *     * Redistributions of source code must retain the above copyright notice, this list of conditions and the\n *       following disclaimer.\n *     * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and\n *       the following disclaimer in the documentation and\/or other materials provided with the distribution.\n *     * Neither the name of MNE-CPP authors nor the names of its contributors may be used\n *       to endorse or promote products derived from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A\n * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,\n * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n *\n * @brief    Implements the main() application function.\n *\n *\/\n\n\/\/=============================================================================================================\n\/\/ INCLUDES\n\/\/=============================================================================================================\n\n#include \"mainsplashscreen.h\"\n#include \"mainwindow.h\"\n\n#include <scMeas\/measurementtypes.h>\n#include <scMeas\/realtimemultisamplearray.h>\n#include <scMeas\/numeric.h>\n\n#include <scShared\/Management\/pluginconnectorconnection.h>\n#include <scShared\/Management\/pluginoutputdata.h>\n#include <scShared\/Management\/plugininputdata.h>\n#include <scShared\/Plugins\/abstractplugin.h>\n\n#include <utils\/generics\/applicationlogger.h>\n\n\/\/=============================================================================================================\n\/\/ EIGEN INCLUDES\n\/\/=============================================================================================================\n\n#include <Eigen\/Core>\n\n\/\/=============================================================================================================\n\/\/ QT INCLUDES\n\/\/=============================================================================================================\n\n#include <QtGui>\n#include <QApplication>\n#include <QSharedPointer>\n\n\/\/=============================================================================================================\n\/\/ USED NAMESPACES\n\/\/=============================================================================================================\n\nusing namespace SCMEASLIB;\nusing namespace MNESCAN;\n\/\/using namespace Eigen;\n\n\/\/=============================================================================================================\n\/\/ GLOBAL DEFINTIONS\n\/\/=============================================================================================================\n\n\/\/=============================================================================================================\n\/\/ MAIN\n\/\/=============================================================================================================\n\n#ifdef STATICBUILD\nQ_IMPORT_PLUGIN(BabyMEG)\nQ_IMPORT_PLUGIN(FiffSimulator)\nQ_IMPORT_PLUGIN(Natus)\nQ_IMPORT_PLUGIN(Covariance)\nQ_IMPORT_PLUGIN(NoiseReduction)\nQ_IMPORT_PLUGIN(RtcMne)\nQ_IMPORT_PLUGIN(Averaging)\nQ_IMPORT_PLUGIN(NeuronalConnectivity)\nQ_IMPORT_PLUGIN(FtBuffer)\nQ_IMPORT_PLUGIN(WriteToFile)\nQ_IMPORT_PLUGIN(Hpi)\n\/\/Q_IMPORT_PLUGIN(DummyToolbox)\n#ifdef WITHGUSBAMP\nQ_IMPORT_PLUGIN(GUSBAmp)\n#endif\n#ifdef WITHBRAINAMP\nQ_IMPORT_PLUGIN(BrainAMP)\n#endif\n#ifdef WITHEEGOSPORTS\nQ_IMPORT_PLUGIN(EEGoSports)\n#endif\n#ifdef WITHLSL\nQ_IMPORT_PLUGIN(LSLAdapter)\n#endif\n#ifdef WITHTMSI\nQ_IMPORT_PLUGIN(TMSI)\n#endif\n#ifdef WITHBRAINFLOW\nQ_IMPORT_PLUGIN(BrainFlowBoard)\n#endif\n#endif\n\n\/\/=============================================================================================================\n\/**\n * The function main marks the entry point of the program.\n * By default, main has the storage class extern.\n *\n * @param[in] argc (argument count) is an integer that indicates how many arguments were entered on the command line when the program was started.\n * @param[in] argv (argument vector) is an array of pointers to arrays of character objects. The array objects are null-terminated strings, representing the arguments that were entered on the command line when the program was started.\n * @return the value that was set to exit() (which is 0 if exit() is called via quit()).\n *\/\nint main(int argc, char *argv[])\n{\n    \/\/ When building a static version of MNE Scan we have to init all resource (.qrc) files here manually\n    #ifdef STATICBUILD\n    Q_INIT_RESOURCE(babymeg);\n    Q_INIT_RESOURCE(fiffsimulator);\n    Q_INIT_RESOURCE(covariance);\n    Q_INIT_RESOURCE(noisereduction);\n    Q_INIT_RESOURCE(rtcmne);\n    Q_INIT_RESOURCE(averaging);\n    Q_INIT_RESOURCE(writetofile);\n    Q_INIT_RESOURCE(hpi);\n    Q_INIT_RESOURCE(disp3d);\n    Q_INIT_RESOURCE(scDisp);\n    #ifdef WITHBRAINAMP\n    Q_INIT_RESOURCE(brainamp);\n    #endif\n    #ifdef WITHEEGOSPORTS\n    Q_INIT_RESOURCE(eegosports);\n    #endif\n    #ifdef WITHGUSBAMP\n    Q_INIT_RESOURCE(gusbamp);\n    #endif\n    #ifdef WITHTMSI\n    Q_INIT_RESOURCE(tmsi);\n    #endif\n    #endif\n\n    qInstallMessageHandler(UTILSLIB::ApplicationLogger::customLogWriter);\n    QApplication app(argc, argv);\n    \/\/app.setAttribute(Qt::AA_DontCreateNativeWidgetSiblings, true);\n\n    \/\/ Set default font\n    int id = QFontDatabase::addApplicationFont(\":\/fonts\/Roboto-Light.ttf\");\n    app.setFont(QFont(QFontDatabase::applicationFontFamilies(id).at(0)));\n\n    \/\/Store application info to use QSettings\n    QCoreApplication::setOrganizationName(CInfo::OrganizationName());\n    QCoreApplication::setApplicationName(CInfo::AppNameShort());\n    QCoreApplication::setOrganizationDomain(\"www.mne-cpp.org\");\n\n    SCMEASLIB::MeasurementTypes::registerTypes();\n\n    MainWindow mainWin;\n    mainWin.show();\n\n    QSurfaceFormat fmt;\n    fmt.setSamples(10);\n    QSurfaceFormat::setDefaultFormat(fmt);\n\n    mainWin.hideSplashScreen();\n\n    int returnValue(app.exec());\n\n    return returnValue;\n}\n<commit_msg>enable tracer<commit_after>\/\/=============================================================================================================\n\/**\n * @file     main.cpp\n * @author   Christoph Dinh <chdinh@nmr.mgh.harvard.edu>;\n *           Lorenz Esch <lesch@mgh.harvard.edu>\n * @since    0.1.0\n * @date     February, 2013\n *\n * @section  LICENSE\n *\n * Copyright (C) 2013, Christoph Dinh, Lorenz Esch. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without modification, are permitted provided that\n * the following conditions are met:\n *     * Redistributions of source code must retain the above copyright notice, this list of conditions and the\n *       following disclaimer.\n *     * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and\n *       the following disclaimer in the documentation and\/or other materials provided with the distribution.\n *     * Neither the name of MNE-CPP authors nor the names of its contributors may be used\n *       to endorse or promote products derived from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A\n * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,\n * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n *\n * @brief    Implements the main() application function.\n *\n *\/\n\n\/\/=============================================================================================================\n\/\/ INCLUDES\n\/\/=============================================================================================================\n\n#include \"mainsplashscreen.h\"\n#include \"mainwindow.h\"\n\n#include <scMeas\/measurementtypes.h>\n#include <scMeas\/realtimemultisamplearray.h>\n#include <scMeas\/numeric.h>\n\n#include <scShared\/Management\/pluginconnectorconnection.h>\n#include <scShared\/Management\/pluginoutputdata.h>\n#include <scShared\/Management\/plugininputdata.h>\n#include <scShared\/Plugins\/abstractplugin.h>\n\n#include <utils\/generics\/applicationlogger.h>\n\n\/\/=============================================================================================================\n\/\/ EIGEN INCLUDES\n\/\/=============================================================================================================\n\n#include <Eigen\/Core>\n\n\/\/=============================================================================================================\n\/\/ QT INCLUDES\n\/\/=============================================================================================================\n\n#include <QtGui>\n#include <QApplication>\n#include <QSharedPointer>\n\n\/\/=============================================================================================================\n\/\/ USED NAMESPACES\n\/\/=============================================================================================================\n\nusing namespace SCMEASLIB;\nusing namespace MNESCAN;\n\/\/using namespace Eigen;\n\n\/\/=============================================================================================================\n\/\/ GLOBAL DEFINTIONS\n\/\/=============================================================================================================\n\n\/\/=============================================================================================================\n\/\/ MAIN\n\/\/=============================================================================================================\n\n#ifdef STATICBUILD\nQ_IMPORT_PLUGIN(BabyMEG)\nQ_IMPORT_PLUGIN(FiffSimulator)\nQ_IMPORT_PLUGIN(Natus)\nQ_IMPORT_PLUGIN(Covariance)\nQ_IMPORT_PLUGIN(NoiseReduction)\nQ_IMPORT_PLUGIN(RtcMne)\nQ_IMPORT_PLUGIN(Averaging)\nQ_IMPORT_PLUGIN(NeuronalConnectivity)\nQ_IMPORT_PLUGIN(FtBuffer)\nQ_IMPORT_PLUGIN(WriteToFile)\nQ_IMPORT_PLUGIN(Hpi)\n\/\/Q_IMPORT_PLUGIN(DummyToolbox)\n#ifdef WITHGUSBAMP\nQ_IMPORT_PLUGIN(GUSBAmp)\n#endif\n#ifdef WITHBRAINAMP\nQ_IMPORT_PLUGIN(BrainAMP)\n#endif\n#ifdef WITHEEGOSPORTS\nQ_IMPORT_PLUGIN(EEGoSports)\n#endif\n#ifdef WITHLSL\nQ_IMPORT_PLUGIN(LSLAdapter)\n#endif\n#ifdef WITHTMSI\nQ_IMPORT_PLUGIN(TMSI)\n#endif\n#ifdef WITHBRAINFLOW\nQ_IMPORT_PLUGIN(BrainFlowBoard)\n#endif\n#endif\n\n\/\/=============================================================================================================\n\/**\n * The function main marks the entry point of the program.\n * By default, main has the storage class extern.\n *\n * @param[in] argc (argument count) is an integer that indicates how many arguments were entered on the command line when the program was started.\n * @param[in] argv (argument vector) is an array of pointers to arrays of character objects. The array objects are null-terminated strings, representing the arguments that were entered on the command line when the program was started.\n * @return the value that was set to exit() (which is 0 if exit() is called via quit()).\n *\/\nint main(int argc, char *argv[])\n{\n    MNE_TRACER_ENABLE\n    \/\/ When building a static version of MNE Scan we have to init all resource (.qrc) files here manually\n    #ifdef STATICBUILD\n    Q_INIT_RESOURCE(babymeg);\n    Q_INIT_RESOURCE(fiffsimulator);\n    Q_INIT_RESOURCE(covariance);\n    Q_INIT_RESOURCE(noisereduction);\n    Q_INIT_RESOURCE(rtcmne);\n    Q_INIT_RESOURCE(averaging);\n    Q_INIT_RESOURCE(writetofile);\n    Q_INIT_RESOURCE(hpi);\n    Q_INIT_RESOURCE(disp3d);\n    Q_INIT_RESOURCE(scDisp);\n    #ifdef WITHBRAINAMP\n    Q_INIT_RESOURCE(brainamp);\n    #endif\n    #ifdef WITHEEGOSPORTS\n    Q_INIT_RESOURCE(eegosports);\n    #endif\n    #ifdef WITHGUSBAMP\n    Q_INIT_RESOURCE(gusbamp);\n    #endif\n    #ifdef WITHTMSI\n    Q_INIT_RESOURCE(tmsi);\n    #endif\n    #endif\n\n    qInstallMessageHandler(UTILSLIB::ApplicationLogger::customLogWriter);\n    QApplication app(argc, argv);\n    \/\/app.setAttribute(Qt::AA_DontCreateNativeWidgetSiblings, true);\n\n    \/\/ Set default font\n    int id = QFontDatabase::addApplicationFont(\":\/fonts\/Roboto-Light.ttf\");\n    app.setFont(QFont(QFontDatabase::applicationFontFamilies(id).at(0)));\n\n    \/\/Store application info to use QSettings\n    QCoreApplication::setOrganizationName(CInfo::OrganizationName());\n    QCoreApplication::setApplicationName(CInfo::AppNameShort());\n    QCoreApplication::setOrganizationDomain(\"www.mne-cpp.org\");\n\n    SCMEASLIB::MeasurementTypes::registerTypes();\n\n    MainWindow mainWin;\n    mainWin.show();\n\n    QSurfaceFormat fmt;\n    fmt.setSamples(10);\n    QSurfaceFormat::setDefaultFormat(fmt);\n\n    mainWin.hideSplashScreen();\n\n    int returnValue(app.exec());\n    MNE_TRACER_DISABLE\n\n    return returnValue;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifdef _WIN32\n\n#include \"win_fsnotifier.h\"\n\nusing namespace std;\n\n\/\/\n\/\/ WatchPoint\n\/\/\n\nWatchPoint::WatchPoint(Server* server, size_t bufferSize, 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(bufferSize);\n    ZeroMemory(&this->overlapped, sizeof(OVERLAPPED));\n    this->overlapped.hEvent = this;\n    switch (listen()) {\n        case SUCCESS:\n            break;\n        case DELETED:\n            throw FileWatcherException(\"Couldn't start watching because path is not a directory\", path);\n    }\n}\n\nbool WatchPoint::cancel() {\n    if (status == LISTENING) {\n        logToJava(FINE, \"Cancelling %s\", utf16ToUtf8String(path).c_str());\n        status = CANCELLED;\n        bool cancelled = (bool) CancelIoEx(directoryHandle, &overlapped);\n        if (!cancelled) {\n            DWORD cancelError = GetLastError();\n            close();\n            if (cancelError == ERROR_NOT_FOUND) {\n                \/\/ Do nothing, looks like this is a typical scenario\n                logToJava(FINE, \"Watch point already finished %s\", utf16ToUtf8String(path).c_str());\n            } else {\n                throw FileWatcherException(\"Couldn't cancel watch point\", path, cancelError);\n            }\n        }\n        return cancelled;\n    }\n    return false;\n}\n\nWatchPoint::~WatchPoint() {\n    try {\n        if (cancel()) {\n            SleepEx(0, true);\n        }\n    } catch (const exception& ex) {\n        logToJava(WARNING, \"Couldn't cancel watch point %s: %s\", utf16ToUtf8String(path).c_str(), ex.what());\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\nbool WatchPoint::isValidDirectory() {\n    wstring pathW(path.begin(), path.end());\n    DWORD attrib = GetFileAttributesW(pathW.c_str());\n\n    return (attrib != INVALID_FILE_ATTRIBUTES)\n        && ((attrib & FILE_ATTRIBUTE_DIRECTORY) != 0);\n}\n\nListenResult WatchPoint::listen() {\n    BOOL success = ReadDirectoryChangesW(\n        directoryHandle,              \/\/ handle to directory\n        &buffer[0],                   \/\/ read results buffer\n        (DWORD) buffer.capacity(),    \/\/ 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        return SUCCESS;\n    } else {\n        DWORD listenError = GetLastError();\n        close();\n        if (listenError == ERROR_ACCESS_DENIED && !isValidDirectory()) {\n            return DELETED;\n        } else {\n            throw FileWatcherException(\"Couldn't start watching\", path, listenError);\n        }\n    }\n}\n\nvoid WatchPoint::close() {\n    if (status != FINISHED) {\n        BOOL ret = CloseHandle(directoryHandle);\n        if (!ret) {\n            logToJava(SEVERE, \"Couldn't close handle %p for '%ls': %d\", directoryHandle, utf16ToUtf8String(path).c_str(), GetLastError());\n        }\n        status = FINISHED;\n    }\n}\n\nvoid WatchPoint::handleEventsInBuffer(DWORD errorCode, DWORD bytesTransferred) {\n    if (errorCode == ERROR_OPERATION_ABORTED) {\n        logToJava(FINE, \"Finished watching '%s', status = %d\", utf16ToUtf8String(path).c_str(), status);\n        close();\n        return;\n    }\n\n    if (status != LISTENING) {\n        logToJava(FINE, \"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    unique_lock<mutex> lock(mutationMutex);\n    JNIEnv* env = getThreadEnv();\n    const u16string& path = watchPoint->path;\n\n    try {\n        if (errorCode != ERROR_SUCCESS) {\n            if (errorCode == ERROR_ACCESS_DENIED && !watchPoint->isValidDirectory()) {\n                reportChange(env, REMOVED, path);\n                watchPoint->close();\n                return;\n            } else {\n                throw FileWatcherException(\"Error received when handling events\", path, errorCode);\n            }\n        }\n\n        if (terminated) {\n            logToJava(FINE, \"Ignoring incoming events for %s because server is terminating (%d bytes, status = %d)\",\n                utf16ToUtf8String(path).c_str(), bytesTransferred, watchPoint->status);\n            return;\n        }\n\n        if (bytesTransferred == 0) {\n            \/\/ This is what the documentation has to say about a zero-length dataset:\n            \/\/\n            \/\/     If the number of bytes transferred is zero, the buffer was either too large\n            \/\/     for the system to allocate or too small to provide detailed information on\n            \/\/     all the changes that occurred in the directory or subtree. In this case,\n            \/\/     you should compute the changes by enumerating the directory or subtree.\n            \/\/\n            \/\/ (See https:\/\/docs.microsoft.com\/en-us\/windows\/win32\/api\/winbase\/nf-winbase-readdirectorychangesw)\n            \/\/\n            \/\/ We'll handle this as a simple overflow and report it as such.\n            logToJava(INFO, \"Detected overflow for %s\", utf16ToUtf8String(path).c_str());\n            reportChange(env, OVERFLOWED, 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        switch (watchPoint->listen()) {\n            case SUCCESS:\n                break;\n            case DELETED:\n                logToJava(FINE, \"Watched directory removed for %s\", utf16ToUtf8String(path).c_str());\n                reportChange(env, REMOVED, path);\n                break;\n        }\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    logToJava(FINE, \"Change detected: 0x%x '%s'\", info->Action, utf16ToUtf8String(changedPath).c_str());\n\n    FileWatchEventType type;\n    if (info->Action == FILE_ACTION_ADDED || info->Action == FILE_ACTION_RENAMED_NEW_NAME) {\n        type = CREATED;\n    } else if (info->Action == FILE_ACTION_REMOVED || info->Action == FILE_ACTION_RENAMED_OLD_NAME) {\n        type = REMOVED;\n    } else if (info->Action == FILE_ACTION_MODIFIED) {\n        type = MODIFIED;\n    } else {\n        logToJava(WARNING, \"Unknown event 0x%x for %s\", info->Action, utf16ToUtf8String(changedPath).c_str());\n        type = UNKNOWN;\n    }\n\n    reportChange(env, type, changedPath);\n}\n\n\/\/\n\/\/ Server\n\/\/\n\nServer::Server(JNIEnv* env, size_t bufferSize, jobject watcherCallback)\n    : AbstractServer(env, watcherCallback)\n    , bufferSize(bufferSize) {\n}\n\nvoid Server::initializeRunLoop() {\n    \/\/ TODO For some reason GetCurrentThread() returns a thread that doesn't accept APCs\n    threadHandle = OpenThread(\n        THREAD_ALL_ACCESS,      \/\/ dwDesiredAccess\n        false,                  \/\/ bInheritHandle\n        GetCurrentThreadId()    \/\/ dwThreadId\n    );\n    if (threadHandle == NULL) {\n        throw FileWatcherException(\"Couldn't open current thread\", GetLastError());\n    }\n}\n\nvoid Server::terminateRunLoop() {\n    executeOnRunLoop([this]() {\n        terminated = true;\n        return true;\n    });\n}\n\nvoid Server::runLoop() {\n    while (!terminated) {\n        SleepEx(INFINITE, true);\n    }\n\n    \/\/ We have received termination, cancel all watchers\n    unique_lock<mutex> lock(mutationMutex);\n    logToJava(FINE, \"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                try {\n                    if (watchPoint.cancel()) {\n                        pendingWatchPoints++;\n                    }\n                } catch (const exception& ex) {\n                    logToJava(SEVERE, \"%s\", ex.what());\n                }\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        logToJava(FINE, \"Waiting for %d pending watch points to finish\", pendingWatchPoints);\n        SleepEx(0, 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 NOT_LISTENING:\n            case FINISHED:\n                break;\n            default:\n                logToJava(WARNING, \"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    CloseHandle(threadHandle);\n}\n\nstruct Command {\n    Server* server;\n    function<bool()> function;\n    condition_variable executed;\n    bool result;\n    exception_ptr failure;\n};\n\nstatic void CALLBACK executeOnRunLoopCallback(_In_ ULONG_PTR info) {\n    Command* command = (Command*) info;\n    try {\n        command->result = command->function();\n    } catch (const exception&) {\n        command->failure = current_exception();\n    }\n    unique_lock<mutex> lock(command->server->executionMutex);\n    command->executed.notify_all();\n}\n\nbool Server::executeOnRunLoop(function<bool()> function) {\n    Command command;\n    command.function = function;\n    command.server = this;\n    unique_lock<mutex> lock(executionMutex);\n    DWORD ret = QueueUserAPC(executeOnRunLoopCallback, threadHandle, (ULONG_PTR) &command);\n    if (ret == 0) {\n        throw FileWatcherException(\"Received error while queuing APC\", GetLastError());\n    }\n    auto status = command.executed.wait_for(lock, THREAD_TIMEOUT);\n    if (status == cv_status::timeout) {\n        throw FileWatcherException(\"Execution timed out\");\n    } else if (command.failure) {\n        rethrow_exception(command.failure);\n    } else {\n        return command.result;\n    }\n}\n\nvoid Server::registerPaths(const vector<u16string>& paths) {\n    executeOnRunLoop([this, paths]() {\n        AbstractServer::registerPaths(paths);\n        return true;\n    });\n}\n\nbool Server::unregisterPaths(const vector<u16string>& paths) {\n    return executeOnRunLoop([this, paths]() {\n        return AbstractServer::unregisterPaths(paths);\n    });\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, bufferSize, longPath));\n}\n\nbool Server::unregisterPath(const u16string& path) {\n    u16string longPath = path;\n    convertToLongPathIfNeeded(longPath);\n    if (watchPoints.erase(longPath) == 0) {\n        logToJava(INFO, \"Path is not watched: %s\", utf16ToUtf8String(path).c_str());\n        return false;\n    }\n    return true;\n}\n\n\/\/\n\/\/ JNI calls\n\/\/\n\nJNIEXPORT jobject JNICALL\nJava_net_rubygrapefruit_platform_internal_jni_WindowsFileEventFunctions_startWatcher0(JNIEnv* env, jclass target, jint bufferSize, jobject javaCallback) {\n    return wrapServer(env, new Server(env, bufferSize, javaCallback));\n}\n\n#endif\n<commit_msg>Close watch point in destructor<commit_after>#ifdef _WIN32\n\n#include \"win_fsnotifier.h\"\n\nusing namespace std;\n\n\/\/\n\/\/ WatchPoint\n\/\/\n\nWatchPoint::WatchPoint(Server* server, size_t bufferSize, 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(bufferSize);\n    ZeroMemory(&this->overlapped, sizeof(OVERLAPPED));\n    this->overlapped.hEvent = this;\n    switch (listen()) {\n        case SUCCESS:\n            break;\n        case DELETED:\n            throw FileWatcherException(\"Couldn't start watching because path is not a directory\", path);\n    }\n}\n\nbool WatchPoint::cancel() {\n    if (status == LISTENING) {\n        logToJava(FINE, \"Cancelling %s\", utf16ToUtf8String(path).c_str());\n        status = CANCELLED;\n        bool cancelled = (bool) CancelIoEx(directoryHandle, &overlapped);\n        if (!cancelled) {\n            DWORD cancelError = GetLastError();\n            close();\n            if (cancelError == ERROR_NOT_FOUND) {\n                \/\/ Do nothing, looks like this is a typical scenario\n                logToJava(FINE, \"Watch point already finished %s\", utf16ToUtf8String(path).c_str());\n            } else {\n                throw FileWatcherException(\"Couldn't cancel watch point\", path, cancelError);\n            }\n        }\n        return cancelled;\n    }\n    return false;\n}\n\nWatchPoint::~WatchPoint() {\n    try {\n        if (cancel()) {\n            SleepEx(0, true);\n        }\n        close();\n    } catch (const exception& ex) {\n        logToJava(WARNING, \"Couldn't cancel watch point %s: %s\", utf16ToUtf8String(path).c_str(), ex.what());\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\nbool WatchPoint::isValidDirectory() {\n    wstring pathW(path.begin(), path.end());\n    DWORD attrib = GetFileAttributesW(pathW.c_str());\n\n    return (attrib != INVALID_FILE_ATTRIBUTES)\n        && ((attrib & FILE_ATTRIBUTE_DIRECTORY) != 0);\n}\n\nListenResult WatchPoint::listen() {\n    BOOL success = ReadDirectoryChangesW(\n        directoryHandle,              \/\/ handle to directory\n        &buffer[0],                   \/\/ read results buffer\n        (DWORD) buffer.capacity(),    \/\/ 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        return SUCCESS;\n    } else {\n        DWORD listenError = GetLastError();\n        close();\n        if (listenError == ERROR_ACCESS_DENIED && !isValidDirectory()) {\n            return DELETED;\n        } else {\n            throw FileWatcherException(\"Couldn't start watching\", path, listenError);\n        }\n    }\n}\n\nvoid WatchPoint::close() {\n    if (status != FINISHED) {\n        BOOL ret = CloseHandle(directoryHandle);\n        if (!ret) {\n            logToJava(SEVERE, \"Couldn't close handle %p for '%ls': %d\", directoryHandle, utf16ToUtf8String(path).c_str(), GetLastError());\n        }\n        status = FINISHED;\n    }\n}\n\nvoid WatchPoint::handleEventsInBuffer(DWORD errorCode, DWORD bytesTransferred) {\n    if (errorCode == ERROR_OPERATION_ABORTED) {\n        logToJava(FINE, \"Finished watching '%s', status = %d\", utf16ToUtf8String(path).c_str(), status);\n        close();\n        return;\n    }\n\n    if (status != LISTENING) {\n        logToJava(FINE, \"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    unique_lock<mutex> lock(mutationMutex);\n    JNIEnv* env = getThreadEnv();\n    const u16string& path = watchPoint->path;\n\n    try {\n        if (errorCode != ERROR_SUCCESS) {\n            if (errorCode == ERROR_ACCESS_DENIED && !watchPoint->isValidDirectory()) {\n                reportChange(env, REMOVED, path);\n                watchPoint->close();\n                return;\n            } else {\n                throw FileWatcherException(\"Error received when handling events\", path, errorCode);\n            }\n        }\n\n        if (terminated) {\n            logToJava(FINE, \"Ignoring incoming events for %s because server is terminating (%d bytes, status = %d)\",\n                utf16ToUtf8String(path).c_str(), bytesTransferred, watchPoint->status);\n            return;\n        }\n\n        if (bytesTransferred == 0) {\n            \/\/ This is what the documentation has to say about a zero-length dataset:\n            \/\/\n            \/\/     If the number of bytes transferred is zero, the buffer was either too large\n            \/\/     for the system to allocate or too small to provide detailed information on\n            \/\/     all the changes that occurred in the directory or subtree. In this case,\n            \/\/     you should compute the changes by enumerating the directory or subtree.\n            \/\/\n            \/\/ (See https:\/\/docs.microsoft.com\/en-us\/windows\/win32\/api\/winbase\/nf-winbase-readdirectorychangesw)\n            \/\/\n            \/\/ We'll handle this as a simple overflow and report it as such.\n            logToJava(INFO, \"Detected overflow for %s\", utf16ToUtf8String(path).c_str());\n            reportChange(env, OVERFLOWED, 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        switch (watchPoint->listen()) {\n            case SUCCESS:\n                break;\n            case DELETED:\n                logToJava(FINE, \"Watched directory removed for %s\", utf16ToUtf8String(path).c_str());\n                reportChange(env, REMOVED, path);\n                break;\n        }\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    logToJava(FINE, \"Change detected: 0x%x '%s'\", info->Action, utf16ToUtf8String(changedPath).c_str());\n\n    FileWatchEventType type;\n    if (info->Action == FILE_ACTION_ADDED || info->Action == FILE_ACTION_RENAMED_NEW_NAME) {\n        type = CREATED;\n    } else if (info->Action == FILE_ACTION_REMOVED || info->Action == FILE_ACTION_RENAMED_OLD_NAME) {\n        type = REMOVED;\n    } else if (info->Action == FILE_ACTION_MODIFIED) {\n        type = MODIFIED;\n    } else {\n        logToJava(WARNING, \"Unknown event 0x%x for %s\", info->Action, utf16ToUtf8String(changedPath).c_str());\n        type = UNKNOWN;\n    }\n\n    reportChange(env, type, changedPath);\n}\n\n\/\/\n\/\/ Server\n\/\/\n\nServer::Server(JNIEnv* env, size_t bufferSize, jobject watcherCallback)\n    : AbstractServer(env, watcherCallback)\n    , bufferSize(bufferSize) {\n}\n\nvoid Server::initializeRunLoop() {\n    \/\/ TODO For some reason GetCurrentThread() returns a thread that doesn't accept APCs\n    threadHandle = OpenThread(\n        THREAD_ALL_ACCESS,      \/\/ dwDesiredAccess\n        false,                  \/\/ bInheritHandle\n        GetCurrentThreadId()    \/\/ dwThreadId\n    );\n    if (threadHandle == NULL) {\n        throw FileWatcherException(\"Couldn't open current thread\", GetLastError());\n    }\n}\n\nvoid Server::terminateRunLoop() {\n    executeOnRunLoop([this]() {\n        terminated = true;\n        return true;\n    });\n}\n\nvoid Server::runLoop() {\n    while (!terminated) {\n        SleepEx(INFINITE, true);\n    }\n\n    \/\/ We have received termination, cancel all watchers\n    unique_lock<mutex> lock(mutationMutex);\n    logToJava(FINE, \"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                try {\n                    if (watchPoint.cancel()) {\n                        pendingWatchPoints++;\n                    }\n                } catch (const exception& ex) {\n                    logToJava(SEVERE, \"%s\", ex.what());\n                }\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        logToJava(FINE, \"Waiting for %d pending watch points to finish\", pendingWatchPoints);\n        SleepEx(0, 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 NOT_LISTENING:\n            case FINISHED:\n                break;\n            default:\n                logToJava(WARNING, \"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    CloseHandle(threadHandle);\n}\n\nstruct Command {\n    Server* server;\n    function<bool()> function;\n    condition_variable executed;\n    bool result;\n    exception_ptr failure;\n};\n\nstatic void CALLBACK executeOnRunLoopCallback(_In_ ULONG_PTR info) {\n    Command* command = (Command*) info;\n    try {\n        command->result = command->function();\n    } catch (const exception&) {\n        command->failure = current_exception();\n    }\n    unique_lock<mutex> lock(command->server->executionMutex);\n    command->executed.notify_all();\n}\n\nbool Server::executeOnRunLoop(function<bool()> function) {\n    Command command;\n    command.function = function;\n    command.server = this;\n    unique_lock<mutex> lock(executionMutex);\n    DWORD ret = QueueUserAPC(executeOnRunLoopCallback, threadHandle, (ULONG_PTR) &command);\n    if (ret == 0) {\n        throw FileWatcherException(\"Received error while queuing APC\", GetLastError());\n    }\n    auto status = command.executed.wait_for(lock, THREAD_TIMEOUT);\n    if (status == cv_status::timeout) {\n        throw FileWatcherException(\"Execution timed out\");\n    } else if (command.failure) {\n        rethrow_exception(command.failure);\n    } else {\n        return command.result;\n    }\n}\n\nvoid Server::registerPaths(const vector<u16string>& paths) {\n    executeOnRunLoop([this, paths]() {\n        AbstractServer::registerPaths(paths);\n        return true;\n    });\n}\n\nbool Server::unregisterPaths(const vector<u16string>& paths) {\n    return executeOnRunLoop([this, paths]() {\n        return AbstractServer::unregisterPaths(paths);\n    });\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, bufferSize, longPath));\n}\n\nbool Server::unregisterPath(const u16string& path) {\n    u16string longPath = path;\n    convertToLongPathIfNeeded(longPath);\n    if (watchPoints.erase(longPath) == 0) {\n        logToJava(INFO, \"Path is not watched: %s\", utf16ToUtf8String(path).c_str());\n        return false;\n    }\n    return true;\n}\n\n\/\/\n\/\/ JNI calls\n\/\/\n\nJNIEXPORT jobject JNICALL\nJava_net_rubygrapefruit_platform_internal_jni_WindowsFileEventFunctions_startWatcher0(JNIEnv* env, jclass target, jint bufferSize, jobject javaCallback) {\n    return wrapServer(env, new Server(env, bufferSize, javaCallback));\n}\n\n#endif\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 <stdio.h>\n\n#include <string>\n\n#include \"webrtc\/test\/testsupport\/fileutils.h\"\n#include \"webrtc\/voice_engine\/test\/auto_test\/fixtures\/after_initialization_fixture.h\"\n\nnamespace webrtc {\nnamespace {\n\nconst int16_t kLimiterHeadroom = 29204;  \/\/ == -1 dbFS\nconst int16_t kInt16Max = 0x7fff;\nconst int kSampleRateHz = 16000;\nconst int kTestDurationMs = 3000;\nconst int kSkipOutputMs = 500;\n\n}  \/\/ namespace\n\nclass MixingTest : public AfterInitializationFixture {\n protected:\n  MixingTest()\n    : input_filename_(test::OutputPath() + \"mixing_test_input.pcm\"),\n      output_filename_(test::OutputPath() + \"mixing_test_output.pcm\") {\n  }\n  void SetUp() {\n    transport_ = new LoopBackTransport(voe_network_);\n  }\n  void TearDown() {\n    delete transport_;\n  }\n\n  \/\/ Creates and mixes |num_remote_streams| which play a file \"as microphone\"\n  \/\/ with |num_local_streams| which play a file \"locally\", using a constant\n  \/\/ amplitude of |input_value|. The local streams manifest as \"anonymous\"\n  \/\/ mixing participants, meaning they will be mixed regardless of the number\n  \/\/ of participants. (A stream is a VoiceEngine \"channel\").\n  \/\/\n  \/\/ The mixed output is verified to always fall between |max_output_value| and\n  \/\/ |min_output_value|, after a startup phase.\n  \/\/\n  \/\/ |num_remote_streams_using_mono| of the remote streams use mono, with the\n  \/\/ remainder using stereo.\n  void RunMixingTest(int num_remote_streams,\n                     int num_local_streams,\n                     int num_remote_streams_using_mono,\n                     int16_t input_value,\n                     int16_t max_output_value,\n                     int16_t min_output_value) {\n    ASSERT_LE(num_remote_streams_using_mono, num_remote_streams);\n\n    GenerateInputFile(input_value);\n\n    std::vector<int> local_streams(num_local_streams);\n    for (size_t i = 0; i < local_streams.size(); ++i) {\n      local_streams[i] = voe_base_->CreateChannel();\n      EXPECT_NE(-1, local_streams[i]);\n    }\n    StartLocalStreams(local_streams);\n    TEST_LOG(\"Playing %d local streams.\\n\", num_local_streams);\n\n    std::vector<int> remote_streams(num_remote_streams);\n    for (size_t i = 0; i < remote_streams.size(); ++i) {\n      remote_streams[i] = voe_base_->CreateChannel();\n      EXPECT_NE(-1, remote_streams[i]);\n    }\n    StartRemoteStreams(remote_streams, num_remote_streams_using_mono);\n    TEST_LOG(\"Playing %d remote streams.\\n\", num_remote_streams);\n\n    \/\/ Start recording the mixed output and wait.\n    EXPECT_EQ(0, voe_file_->StartRecordingPlayout(-1 \/* record meeting *\/,\n        output_filename_.c_str()));\n    Sleep(kTestDurationMs);\n    EXPECT_EQ(0, voe_file_->StopRecordingPlayout(-1));\n\n    StopLocalStreams(local_streams);\n    StopRemoteStreams(remote_streams);\n\n    VerifyMixedOutput(max_output_value, min_output_value);\n  }\n\n private:\n  \/\/ Generate input file with constant values equal to |input_value|. The file\n  \/\/ will be one second longer than the duration of the test.\n  void GenerateInputFile(int16_t input_value) {\n    FILE* input_file = fopen(input_filename_.c_str(), \"wb\");\n    ASSERT_TRUE(input_file != NULL);\n    for (int i = 0; i < kSampleRateHz \/ 1000 * (kTestDurationMs + 1000); i++) {\n      ASSERT_EQ(1u, fwrite(&input_value, sizeof(input_value), 1, input_file));\n    }\n    ASSERT_EQ(0, fclose(input_file));\n  }\n\n  void VerifyMixedOutput(int16_t max_output_value, int16_t min_output_value) {\n    \/\/ Verify the mixed output.\n    FILE* output_file = fopen(output_filename_.c_str(), \"rb\");\n    ASSERT_TRUE(output_file != NULL);\n    int16_t output_value = 0;\n    \/\/ Skip the first segment to avoid initialization and ramping-in effects.\n    EXPECT_EQ(0, fseek(output_file, sizeof(output_value) *\n                       kSampleRateHz \/ 1000 * kSkipOutputMs, SEEK_SET));\n    int samples_read = 0;\n    while (fread(&output_value, sizeof(output_value), 1, output_file) == 1) {\n      samples_read++;\n      std::ostringstream trace_stream;\n      trace_stream << samples_read << \" samples read\";\n      SCOPED_TRACE(trace_stream.str());\n      EXPECT_LE(output_value, max_output_value);\n      EXPECT_GE(output_value, min_output_value);\n    }\n    \/\/ Ensure the recording length is close to the duration of the test.\n    \/\/ We have to use a relaxed tolerance here due to filesystem flakiness on\n    \/\/ the bots.\n    ASSERT_GE((samples_read * 1000.0) \/ kSampleRateHz,\n              0.7 * (kTestDurationMs - kSkipOutputMs));\n    \/\/ Ensure we read the entire file.\n    ASSERT_NE(0, feof(output_file));\n    ASSERT_EQ(0, fclose(output_file));\n  }\n\n  \/\/ Start up local streams (\"anonymous\" participants).\n  void StartLocalStreams(const std::vector<int>& streams) {\n    for (size_t i = 0; i < streams.size(); ++i) {\n      EXPECT_EQ(0, voe_base_->StartPlayout(streams[i]));\n      EXPECT_EQ(0, voe_file_->StartPlayingFileLocally(streams[i],\n          input_filename_.c_str(), true));\n    }\n  }\n\n  void StopLocalStreams(const std::vector<int>& streams) {\n    for (size_t i = 0; i < streams.size(); ++i) {\n      EXPECT_EQ(0, voe_base_->StopPlayout(streams[i]));\n      EXPECT_EQ(0, voe_base_->DeleteChannel(streams[i]));\n    }\n  }\n\n  \/\/ Start up remote streams (\"normal\" participants).\n  void StartRemoteStreams(const std::vector<int>& streams,\n                          int num_remote_streams_using_mono) {\n    \/\/ Use L16 at 16kHz to minimize distortion (file recording is 16kHz and\n    \/\/ resampling will cause distortion).\n    CodecInst codec_inst;\n    strcpy(codec_inst.plname, \"L16\");\n    codec_inst.channels = 1;\n    codec_inst.plfreq = kSampleRateHz;\n    codec_inst.pltype = 105;\n    codec_inst.pacsize = codec_inst.plfreq \/ 100;\n    codec_inst.rate = codec_inst.plfreq * sizeof(int16_t) * 8;  \/\/ 8 bits\/byte.\n\n    for (int i = 0; i < num_remote_streams_using_mono; ++i) {\n      StartRemoteStream(streams[i], codec_inst, 1234 + 2 * i);\n    }\n\n    \/\/ The remainder of the streams will use stereo.\n    codec_inst.channels = 2;\n    codec_inst.pltype++;\n    for (size_t i = num_remote_streams_using_mono; i < streams.size(); ++i) {\n      StartRemoteStream(streams[i], codec_inst, 1234 + 2 * i);\n    }\n  }\n\n  \/\/ Start up a single remote stream.\n  void StartRemoteStream(int stream, const CodecInst& codec_inst, int port) {\n    EXPECT_EQ(0, voe_codec_->SetRecPayloadType(stream, codec_inst));\n    EXPECT_EQ(0, voe_network_->RegisterExternalTransport(stream, *transport_));\n    EXPECT_EQ(0, voe_base_->StartReceive(stream));\n    EXPECT_EQ(0, voe_base_->StartPlayout(stream));\n    EXPECT_EQ(0, voe_codec_->SetSendCodec(stream, codec_inst));\n    EXPECT_EQ(0, voe_base_->StartSend(stream));\n    EXPECT_EQ(0, voe_file_->StartPlayingFileAsMicrophone(stream,\n        input_filename_.c_str(), true));\n  }\n\n  void StopRemoteStreams(const std::vector<int>& streams) {\n    for (size_t i = 0; i < streams.size(); ++i) {\n      EXPECT_EQ(0, voe_base_->StopSend(streams[i]));\n      EXPECT_EQ(0, voe_base_->StopPlayout(streams[i]));\n      EXPECT_EQ(0, voe_base_->StopReceive(streams[i]));\n      EXPECT_EQ(0, voe_network_->DeRegisterExternalTransport(streams[i]));\n      EXPECT_EQ(0, voe_base_->DeleteChannel(streams[i]));\n    }\n  }\n\n  const std::string input_filename_;\n  const std::string output_filename_;\n  LoopBackTransport* transport_;\n};\n\n\/\/ These tests assume a maximum of three mixed participants. We typically allow\n\/\/ a +\/- 10% range around the expected output level to account for distortion\n\/\/ from coding and processing in the loopback chain.\nTEST_F(MixingTest, DISABLED_FourChannelsWithOnlyThreeMixed) {\n  const int16_t kInputValue = 1000;\n  const int16_t kExpectedOutput = kInputValue * 3;\n  RunMixingTest(4, 0, 4, kInputValue, 1.1 * kExpectedOutput,\n                0.9 * kExpectedOutput);\n}\n\n\/\/ Ensure the mixing saturation protection is working. We can do this because\n\/\/ the mixing limiter is given some headroom, so the expected output is less\n\/\/ than full scale.\nTEST_F(MixingTest, DISABLED_VerifySaturationProtection) {\n  const int16_t kInputValue = 20000;\n  const int16_t kExpectedOutput = kLimiterHeadroom;\n  \/\/ If this isn't satisfied, we're not testing anything.\n  ASSERT_GT(kInputValue * 3, kInt16Max);\n  ASSERT_LT(1.1 * kExpectedOutput, kInt16Max);\n  RunMixingTest(3, 0, 3, kInputValue, 1.1 * kExpectedOutput,\n               0.9 * kExpectedOutput);\n}\n\nTEST_F(MixingTest, DISABLED_SaturationProtectionHasNoEffectOnOneChannel) {\n  const int16_t kInputValue = kInt16Max;\n  const int16_t kExpectedOutput = kInt16Max;\n  \/\/ If this isn't satisfied, we're not testing anything.\n  ASSERT_GT(0.95 * kExpectedOutput, kLimiterHeadroom);\n  \/\/ Tighter constraints are required here to properly test this.\n  RunMixingTest(1, 0, 1, kInputValue, kExpectedOutput,\n                0.95 * kExpectedOutput);\n}\n\nTEST_F(MixingTest, DISABLED_VerifyAnonymousAndNormalParticipantMixing) {\n  const int16_t kInputValue = 1000;\n  const int16_t kExpectedOutput = kInputValue * 2;\n  RunMixingTest(1, 1, 1, kInputValue, 1.1 * kExpectedOutput,\n                0.9 * kExpectedOutput);\n}\n\nTEST_F(MixingTest, DISABLED_AnonymousParticipantsAreAlwaysMixed) {\n  const int16_t kInputValue = 1000;\n  const int16_t kExpectedOutput = kInputValue * 4;\n  RunMixingTest(3, 1, 3, kInputValue, 1.1 * kExpectedOutput,\n                0.9 * kExpectedOutput);\n}\n\nTEST_F(MixingTest, DISABLED_VerifyStereoAndMonoMixing) {\n  const int16_t kInputValue = 1000;\n  const int16_t kExpectedOutput = kInputValue * 2;\n  RunMixingTest(2, 0, 1, kInputValue, 1.1 * kExpectedOutput,\n                0.9 * kExpectedOutput);\n}\n\n}  \/\/ namespace webrtc\n<commit_msg>Restore mixing integration tests.<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 <stdio.h>\n#include <string>\n\n#include \"webrtc\/system_wrappers\/interface\/sleep.h\"\n#include \"webrtc\/test\/testsupport\/fileutils.h\"\n#include \"webrtc\/voice_engine\/test\/auto_test\/fixtures\/after_initialization_fixture.h\"\n\nnamespace webrtc {\nnamespace {\n\nconst int16_t kLimiterHeadroom = 29204;  \/\/ == -1 dbFS\nconst int16_t kInt16Max = 0x7fff;\nconst int kSampleRateHz = 16000;\nconst int kTestDurationMs = 3000;\n\n}  \/\/ namespace\n\nclass MixingTest : public AfterInitializationFixture {\n protected:\n  MixingTest()\n      : output_filename_(test::OutputPath() + \"mixing_test_output.pcm\") {\n  }\n  void SetUp() {\n    transport_ = new LoopBackTransport(voe_network_);\n  }\n  void TearDown() {\n    delete transport_;\n  }\n\n  \/\/ Creates and mixes |num_remote_streams| which play a file \"as microphone\"\n  \/\/ with |num_local_streams| which play a file \"locally\", using a constant\n  \/\/ amplitude of |input_value|. The local streams manifest as \"anonymous\"\n  \/\/ mixing participants, meaning they will be mixed regardless of the number\n  \/\/ of participants. (A stream is a VoiceEngine \"channel\").\n  \/\/\n  \/\/ The mixed output is verified to always fall between |max_output_value| and\n  \/\/ |min_output_value|, after a startup phase.\n  \/\/\n  \/\/ |num_remote_streams_using_mono| of the remote streams use mono, with the\n  \/\/ remainder using stereo.\n  void RunMixingTest(int num_remote_streams,\n                     int num_local_streams,\n                     int num_remote_streams_using_mono,\n                     bool real_audio,\n                     int16_t input_value,\n                     int16_t max_output_value,\n                     int16_t min_output_value) {\n    ASSERT_LE(num_remote_streams_using_mono, num_remote_streams);\n\n    if (real_audio) {\n      input_filename_ = test::ResourcePath(\"voice_engine\/audio_long16\", \"pcm\");\n    } else {\n      input_filename_ = test::OutputPath() + \"mixing_test_input.pcm\";\n      GenerateInputFile(input_value);\n    }\n\n    std::vector<int> local_streams(num_local_streams);\n    for (size_t i = 0; i < local_streams.size(); ++i) {\n      local_streams[i] = voe_base_->CreateChannel();\n      EXPECT_NE(-1, local_streams[i]);\n    }\n    StartLocalStreams(local_streams);\n    TEST_LOG(\"Playing %d local streams.\\n\", num_local_streams);\n\n    std::vector<int> remote_streams(num_remote_streams);\n    for (size_t i = 0; i < remote_streams.size(); ++i) {\n      remote_streams[i] = voe_base_->CreateChannel();\n      EXPECT_NE(-1, remote_streams[i]);\n    }\n    StartRemoteStreams(remote_streams, num_remote_streams_using_mono);\n    TEST_LOG(\"Playing %d remote streams.\\n\", num_remote_streams);\n\n    \/\/ Give it plenty of time to get started.\n    SleepMs(1000);\n\n    \/\/ Start recording the mixed output and wait.\n    EXPECT_EQ(0, voe_file_->StartRecordingPlayout(-1 \/* record meeting *\/,\n        output_filename_.c_str()));\n    SleepMs(kTestDurationMs);\n    EXPECT_EQ(0, voe_file_->StopRecordingPlayout(-1));\n\n    StopLocalStreams(local_streams);\n    StopRemoteStreams(remote_streams);\n\n    if (!real_audio) {\n      VerifyMixedOutput(max_output_value, min_output_value);\n    }\n  }\n\n private:\n  \/\/ Generate input file with constant values equal to |input_value|. The file\n  \/\/ will be twice the duration of the test.\n  void GenerateInputFile(int16_t input_value) {\n    FILE* input_file = fopen(input_filename_.c_str(), \"wb\");\n    ASSERT_TRUE(input_file != NULL);\n    for (int i = 0; i < kSampleRateHz \/ 1000 * (kTestDurationMs * 2); i++) {\n      ASSERT_EQ(1u, fwrite(&input_value, sizeof(input_value), 1, input_file));\n    }\n    ASSERT_EQ(0, fclose(input_file));\n  }\n\n  void VerifyMixedOutput(int16_t max_output_value, int16_t min_output_value) {\n    \/\/ Verify the mixed output.\n    FILE* output_file = fopen(output_filename_.c_str(), \"rb\");\n    ASSERT_TRUE(output_file != NULL);\n    int16_t output_value = 0;\n    int samples_read = 0;\n    while (fread(&output_value, sizeof(output_value), 1, output_file) == 1) {\n      samples_read++;\n      std::ostringstream trace_stream;\n      trace_stream << samples_read << \" samples read\";\n      SCOPED_TRACE(trace_stream.str());\n      EXPECT_LE(output_value, max_output_value);\n      EXPECT_GE(output_value, min_output_value);\n    }\n    \/\/ Ensure we've at least recorded half as much file as the duration of the\n    \/\/ test. We have to use a relaxed tolerance here due to filesystem flakiness\n    \/\/ on the bots.\n    ASSERT_GE((samples_read * 1000.0) \/ kSampleRateHz, 0.5 * kTestDurationMs);\n    \/\/ Ensure we read the entire file.\n    ASSERT_NE(0, feof(output_file));\n    ASSERT_EQ(0, fclose(output_file));\n  }\n\n  \/\/ Start up local streams (\"anonymous\" participants).\n  void StartLocalStreams(const std::vector<int>& streams) {\n    for (size_t i = 0; i < streams.size(); ++i) {\n      EXPECT_EQ(0, voe_base_->StartPlayout(streams[i]));\n      EXPECT_EQ(0, voe_file_->StartPlayingFileLocally(streams[i],\n          input_filename_.c_str(), true));\n    }\n  }\n\n  void StopLocalStreams(const std::vector<int>& streams) {\n    for (size_t i = 0; i < streams.size(); ++i) {\n      EXPECT_EQ(0, voe_base_->StopPlayout(streams[i]));\n      EXPECT_EQ(0, voe_base_->DeleteChannel(streams[i]));\n    }\n  }\n\n  \/\/ Start up remote streams (\"normal\" participants).\n  void StartRemoteStreams(const std::vector<int>& streams,\n                          int num_remote_streams_using_mono) {\n    \/\/ Use L16 at 16kHz to minimize distortion (file recording is 16kHz and\n    \/\/ resampling will cause distortion).\n    CodecInst codec_inst;\n    strcpy(codec_inst.plname, \"L16\");\n    codec_inst.channels = 1;\n    codec_inst.plfreq = kSampleRateHz;\n    codec_inst.pltype = 105;\n    codec_inst.pacsize = codec_inst.plfreq \/ 100;\n    codec_inst.rate = codec_inst.plfreq * sizeof(int16_t) * 8;  \/\/ 8 bits\/byte.\n\n    for (int i = 0; i < num_remote_streams_using_mono; ++i) {\n      \/\/ Add some delay between starting up the channels in order to give them\n      \/\/ different energies in the \"real audio\" test and hopefully exercise\n      \/\/ more code paths.\n      SleepMs(50);\n      StartRemoteStream(streams[i], codec_inst, 1234 + 2 * i);\n    }\n\n    \/\/ The remainder of the streams will use stereo.\n    codec_inst.channels = 2;\n    codec_inst.pltype++;\n    for (size_t i = num_remote_streams_using_mono; i < streams.size(); ++i) {\n      StartRemoteStream(streams[i], codec_inst, 1234 + 2 * i);\n    }\n  }\n\n  \/\/ Start up a single remote stream.\n  void StartRemoteStream(int stream, const CodecInst& codec_inst, int port) {\n    EXPECT_EQ(0, voe_codec_->SetRecPayloadType(stream, codec_inst));\n    EXPECT_EQ(0, voe_network_->RegisterExternalTransport(stream, *transport_));\n    EXPECT_EQ(0, voe_base_->StartReceive(stream));\n    EXPECT_EQ(0, voe_base_->StartPlayout(stream));\n    EXPECT_EQ(0, voe_codec_->SetSendCodec(stream, codec_inst));\n    EXPECT_EQ(0, voe_base_->StartSend(stream));\n    EXPECT_EQ(0, voe_file_->StartPlayingFileAsMicrophone(stream,\n        input_filename_.c_str(), true));\n  }\n\n  void StopRemoteStreams(const std::vector<int>& streams) {\n    for (size_t i = 0; i < streams.size(); ++i) {\n      EXPECT_EQ(0, voe_base_->StopSend(streams[i]));\n      EXPECT_EQ(0, voe_base_->StopPlayout(streams[i]));\n      EXPECT_EQ(0, voe_base_->StopReceive(streams[i]));\n      EXPECT_EQ(0, voe_network_->DeRegisterExternalTransport(streams[i]));\n      EXPECT_EQ(0, voe_base_->DeleteChannel(streams[i]));\n    }\n  }\n\n  std::string input_filename_;\n  const std::string output_filename_;\n  LoopBackTransport* transport_;\n};\n\n\/\/ This test has no verification, but exercises additional code paths in a\n\/\/ somewhat more realistic scenario using real audio. It can at least hunt for\n\/\/ asserts and crashes.\nTEST_F(MixingTest, MixManyChannelsForStress) {\n  RunMixingTest(10, 0, 10, true, 0, 0, 0);\n}\n\n\/\/ These tests assume a maximum of three mixed participants. We typically allow\n\/\/ a +\/- 10% range around the expected output level to account for distortion\n\/\/ from coding and processing in the loopback chain.\nTEST_F(MixingTest, FourChannelsWithOnlyThreeMixed) {\n  const int16_t kInputValue = 1000;\n  const int16_t kExpectedOutput = kInputValue * 3;\n  RunMixingTest(4, 0, 4, false, kInputValue, 1.1 * kExpectedOutput,\n                0.9 * kExpectedOutput);\n}\n\n\/\/ Ensure the mixing saturation protection is working. We can do this because\n\/\/ the mixing limiter is given some headroom, so the expected output is less\n\/\/ than full scale.\nTEST_F(MixingTest, VerifySaturationProtection) {\n  const int16_t kInputValue = 20000;\n  const int16_t kExpectedOutput = kLimiterHeadroom;\n  \/\/ If this isn't satisfied, we're not testing anything.\n  ASSERT_GT(kInputValue * 3, kInt16Max);\n  ASSERT_LT(1.1 * kExpectedOutput, kInt16Max);\n  RunMixingTest(3, 0, 3, false, kInputValue, 1.1 * kExpectedOutput,\n               0.9 * kExpectedOutput);\n}\n\nTEST_F(MixingTest, SaturationProtectionHasNoEffectOnOneChannel) {\n  const int16_t kInputValue = kInt16Max;\n  const int16_t kExpectedOutput = kInt16Max;\n  \/\/ If this isn't satisfied, we're not testing anything.\n  ASSERT_GT(0.95 * kExpectedOutput, kLimiterHeadroom);\n  \/\/ Tighter constraints are required here to properly test this.\n  RunMixingTest(1, 0, 1, false, kInputValue, kExpectedOutput,\n                0.95 * kExpectedOutput);\n}\n\nTEST_F(MixingTest, VerifyAnonymousAndNormalParticipantMixing) {\n  const int16_t kInputValue = 1000;\n  const int16_t kExpectedOutput = kInputValue * 2;\n  RunMixingTest(1, 1, 1, false, kInputValue, 1.1 * kExpectedOutput,\n                0.9 * kExpectedOutput);\n}\n\nTEST_F(MixingTest, AnonymousParticipantsAreAlwaysMixed) {\n  const int16_t kInputValue = 1000;\n  const int16_t kExpectedOutput = kInputValue * 4;\n  RunMixingTest(3, 1, 3, false, kInputValue, 1.1 * kExpectedOutput,\n                0.9 * kExpectedOutput);\n}\n\nTEST_F(MixingTest, VerifyStereoAndMonoMixing) {\n  const int16_t kInputValue = 1000;\n  const int16_t kExpectedOutput = kInputValue * 2;\n  RunMixingTest(2, 0, 1, false, kInputValue, 1.1 * kExpectedOutput,\n                0.9 * kExpectedOutput);\n}\n\n}  \/\/ namespace webrtc\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * DISTRHO Plugin Framework (DPF)\n * Copyright (C) 2012-2021 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 DGL_OPENGL_INCLUDE_HPP_INCLUDED\n#define DGL_OPENGL_INCLUDE_HPP_INCLUDED\n\n#include \"..\/distrho\/src\/DistrhoDefines.h\"\n\n\/\/ --------------------------------------------------------------------------------------------------------------------\n\/\/ Fix OpenGL includes for Windows, based on glfw code (part 1)\n\n#undef DGL_CALLBACK_DEFINED\n#undef DGL_WINGDIAPI_DEFINED\n\n#ifdef DISTRHO_OS_WINDOWS\n\n#ifndef APIENTRY\n# define APIENTRY __stdcall\n#endif \/\/ APIENTRY\n\n\/* We need WINGDIAPI defined *\/\n#ifndef WINGDIAPI\n# if defined(_MSC_VER) || defined(__BORLANDC__) || defined(__POCC__)\n#  define WINGDIAPI __declspec(dllimport)\n# elif defined(__LCC__)\n#  define WINGDIAPI __stdcall\n# else\n#  define WINGDIAPI extern\n# endif\n# define DGL_WINGDIAPI_DEFINED\n#endif \/\/ WINGDIAPI\n\n\/* Some <GL\/glu.h> files also need CALLBACK defined *\/\n#ifndef CALLBACK\n# if defined(_MSC_VER)\n#  if (defined(_M_MRX000) || defined(_M_IX86) || defined(_M_ALPHA) || defined(_M_PPC)) && !defined(MIDL_PASS)\n#   define CALLBACK __stdcall\n#  else\n#   define CALLBACK\n#  endif\n# else\n#  define CALLBACK __stdcall\n# endif\n# define DGL_CALLBACK_DEFINED\n#endif \/\/ CALLBACK\n\n#endif \/\/ DISTRHO_OS_WINDOWS\n\n\/\/ --------------------------------------------------------------------------------------------------------------------\n\/\/ OpenGL includes\n\n#ifdef DISTRHO_OS_MAC\n# ifdef DGL_USE_OPENGL3\n#  include <OpenGL\/gl3.h>\n#  include <OpenGL\/gl3ext.h>\n# else\n#  include <OpenGL\/gl.h>\n# endif\n#else\n# ifndef DISTRHO_OS_WINDOWS\n#  define GL_GLEXT_PROTOTYPES\n# endif\n# ifndef __GLEW_H__\n#  include <GL\/gl.h>\n#  include <GL\/glext.h>\n# endif\n#endif\n\n\/\/ --------------------------------------------------------------------------------------------------------------------\n\/\/ Missing OpenGL defines\n\n#if defined(GL_BGR_EXT) && !defined(GL_BGR)\n# define GL_BGR GL_BGR_EXT\n#endif\n\n#if defined(GL_BGRA_EXT) && !defined(GL_BGRA)\n# define GL_BGRA GL_BGRA_EXT\n#endif\n\n#ifndef GL_CLAMP_TO_BORDER\n# define GL_CLAMP_TO_BORDER 0x812D\n#endif\n\n\/\/ --------------------------------------------------------------------------------------------------------------------\n\/\/ Fix OpenGL includes for Windows, based on glfw code (part 2)\n\n#ifdef DGL_CALLBACK_DEFINED\n# undef CALLBACK\n# undef DGL_CALLBACK_DEFINED\n#endif\n\n#ifdef DGL_WINGDIAPI_DEFINED\n# undef WINGDIAPI\n# undef DGL_WINGDIAPI_DEFINED\n#endif\n\n\/\/ --------------------------------------------------------------------------------------------------------------------\n\n#endif\n<commit_msg>Cleanup<commit_after>\/*\n * DISTRHO Plugin Framework (DPF)\n * Copyright (C) 2012-2021 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 DGL_OPENGL_INCLUDE_HPP_INCLUDED\n#define DGL_OPENGL_INCLUDE_HPP_INCLUDED\n\n#include \"..\/distrho\/src\/DistrhoDefines.h\"\n\n\/\/ --------------------------------------------------------------------------------------------------------------------\n\/\/ Fix OpenGL includes for Windows, based on glfw code (part 1)\n\n#undef DGL_WINGDIAPI_DEFINED\n\n#ifdef DISTRHO_OS_WINDOWS\n\n#ifndef WINAPI\n# define WINAPI __stdcall\n#endif\n\n#ifndef APIENTRY\n# define APIENTRY WINAPI\n#endif \/\/ APIENTRY\n\n\/* We need WINGDIAPI defined *\/\n#ifndef WINGDIAPI\n# if defined(_MSC_VER) || defined(__BORLANDC__) || defined(__POCC__)\n#  define WINGDIAPI __declspec(dllimport)\n# elif defined(__LCC__)\n#  define WINGDIAPI __stdcall\n# else\n#  define WINGDIAPI extern\n# endif\n# define DGL_WINGDIAPI_DEFINED\n#endif \/\/ WINGDIAPI\n\n#endif \/\/ DISTRHO_OS_WINDOWS\n\n\/\/ --------------------------------------------------------------------------------------------------------------------\n\/\/ OpenGL includes\n\n#ifdef DISTRHO_OS_MAC\n# ifdef DGL_USE_OPENGL3\n#  include <OpenGL\/gl3.h>\n#  include <OpenGL\/gl3ext.h>\n# else\n#  include <OpenGL\/gl.h>\n# endif\n#else\n# ifndef DISTRHO_OS_WINDOWS\n#  define GL_GLEXT_PROTOTYPES\n# endif\n# ifndef __GLEW_H__\n#  include <GL\/gl.h>\n#  include <GL\/glext.h>\n# endif\n#endif\n\n\/\/ --------------------------------------------------------------------------------------------------------------------\n\/\/ Missing OpenGL defines\n\n#if defined(GL_BGR_EXT) && !defined(GL_BGR)\n# define GL_BGR GL_BGR_EXT\n#endif\n\n#if defined(GL_BGRA_EXT) && !defined(GL_BGRA)\n# define GL_BGRA GL_BGRA_EXT\n#endif\n\n#ifndef GL_CLAMP_TO_BORDER\n# define GL_CLAMP_TO_BORDER 0x812D\n#endif\n\n\/\/ --------------------------------------------------------------------------------------------------------------------\n\/\/ Fix OpenGL includes for Windows, based on glfw code (part 2)\n\n#ifdef DGL_WINGDIAPI_DEFINED\n# undef WINGDIAPI\n# undef DGL_WINGDIAPI_DEFINED\n#endif\n\n\/\/ --------------------------------------------------------------------------------------------------------------------\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n** Copyright 2011-2012 Merethis\n**\n** This file is part of Centreon Broker.\n**\n** Centreon Broker is free software: you can redistribute it and\/or\n** modify it under the terms of the GNU General Public License version 2\n** as published by the Free Software Foundation.\n**\n** Centreon Broker is distributed in the hope that it will be useful,\n** but WITHOUT ANY WARRANTY; without even the implied warranty of\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n** General Public License for more details.\n**\n** You should have received a copy of the GNU General Public License\n** along with Centreon Broker. If not, see\n** <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <cctype>\n#include <cmath>\n#include <cstdlib>\n#include <cstring>\n#include <QByteArray>\n#include \"com\/centreon\/broker\/logging\/logging.hh\"\n#include \"com\/centreon\/broker\/storage\/exceptions\/perfdata.hh\"\n#include \"com\/centreon\/broker\/storage\/parser.hh\"\n#include \"com\/centreon\/broker\/storage\/perfdata.hh\"\n\nusing namespace com::centreon::broker::storage;\n\n\/**************************************\n*                                     *\n*            Local Objects            *\n*                                     *\n**************************************\/\n\n\/**\n *  Extract a real value from a perfdata string.\n *\n *  @param[in,out] str  Pointer to a perfdata string.\n *  @param[in]     skip true to skip semicolon.\n *\n *  @return Extracted real value if successful, NaN otherwise.\n *\/\nstatic inline double extract_double(\n                       char const** str,\n                       bool skip = true) {\n  double retval;\n  char* tmp;\n  retval = strtod(*str, &tmp);\n  *str = tmp;\n  if (skip && (**str == ';'))\n    ++*str;\n  return (retval);\n}\n\n\/**************************************\n*                                     *\n*           Public Methods            *\n*                                     *\n**************************************\/\n\n\/**\n *  Default constructor.\n *\/\nparser::parser() {}\n\n\/**\n *  @brief Copy constructor.\n *\n *  No data is stored within the parser class.\n *\n *  @param[in] pp Unused.\n *\/\nparser::parser(parser const& pp) {\n  (void)pp;\n}\n\n\/**\n *  Destructor.\n *\/\nparser::~parser() {}\n\n\/**\n *  @brief Assignment operator.\n *\n *  No data is stored within the parser class.\n *\n *  @param[in] pp Unused.\n *\n *  @return This object.\n *\/\nparser& parser::operator=(parser const& pp) {\n  (void)pp;\n  return (*this);\n}\n\n\/**\n *  Parse perfdata string as given by plugin.\n *\n *  @param[in]  str Raw perfdata string.\n *  @param[out] pd  List of parsed metrics.\n *\/\nvoid parser::parse_perfdata(\n               QString const& str,\n               QList<perfdata>& pd) {\n  \/\/ Extract metrics strings.\n  QByteArray buf(qPrintable(str));\n  buf.replace(',', '.');\n  char const* ptr(buf.constData());\n\n  \/\/ Skip initial whitespaces.\n  while (isblank(*ptr))\n    ++ptr;\n  while (*ptr) {\n    \/\/ Debug message.\n    logging::debug(logging::medium)\n      << \"storage: parsing perfdata string '\" << ptr << \"'\";\n\n    \/\/ Perfdata object.\n    perfdata p;\n\n    \/\/ Get metric name.\n    bool in_quote(false);\n    unsigned int i(0);\n    while (ptr[i] && (in_quote || (ptr[i] != '='))) {\n      if ('\\'' == ptr[i])\n        in_quote = !in_quote;\n      ++i;\n    }\n    std::string s(ptr, i);\n    ptr += i;\n\n    \/\/ Unquote metric name.\n    size_t t;\n    t = s.find_first_of('\\'');\n    while (t != std::string::npos) {\n      s.erase(t, 1);\n      t = s.find_first_of('\\'', t + 1); \/\/ Skip one char, so '' becomes '.\n    }\n    if ((s.size() > 0) && (*s.rbegin() == ']')) {\n      if (!s.compare(0, 2, \"a[\")) {\n        s = s.substr(2, s.size() - 3);\n        p.value_type(perfdata::absolute);\n      }\n      else if (!s.compare(0, 2, \"c[\")) {\n        s = s.substr(2, s.size() - 3);\n        p.value_type(perfdata::counter);\n      }\n      else if (!s.compare(0, 2, \"d[\")) {\n        s = s.substr(2, s.size() - 3);\n        p.value_type(perfdata::derive);\n      }\n      else if (!s.compare(0, 2, \"g[\")) {\n        s = s.substr(2, s.size() - 3);\n        p.value_type(perfdata::gauge);\n      }\n    }\n    p.name(QString(s.c_str()).trimmed());\n\n    \/\/ Check format.\n    if (*ptr != '=')\n      throw (exceptions::perfdata() << \"storage: invalid perfdata \" \\\n               \"format: equal sign not present or misplaced\");\n    ++ptr;\n\n    \/\/ Extract value.\n    p.value(extract_double(&ptr, false));\n    if (isnan(p.value()))\n      p.value(0.0);\n\n    \/\/ Extract unit.\n    t = strcspn(ptr, \" ;\");\n    p.unit(std::string(ptr, t).c_str());\n    ptr += t;\n    if (*ptr == ';')\n      ++ptr;\n\n    \/\/ Extract warning.\n    p.warning(extract_double(&ptr));\n\n    \/\/ Extract critical.\n    p.critical(extract_double(&ptr));\n\n    \/\/ Extract minimum.\n    p.min(extract_double(&ptr));\n\n    \/\/ Extract maximum.\n    p.max(extract_double(&ptr));\n\n    \/\/ Log new perfdata.\n    logging::debug(logging::low) << \"storage: got new perfdata (name=\"\n      << p.name() << \", value=\" << p.value() << \", unit=\" << p.unit()\n      << \", warning=\" << p.warning() << \", critical=\" << p.critical()\n      << \", min=\" << p.min() << \", max=\" << p.max() << \")\";\n\n    \/\/ Append to list.\n    pd.push_back(p);\n\n    \/\/ Skip whitespaces.\n    while (isblank(*ptr))\n      ++ptr;\n  }\n\n  return ;\n}\n<commit_msg>storage: use properly encoded metric name.<commit_after>\/*\n** Copyright 2011-2012 Merethis\n**\n** This file is part of Centreon Broker.\n**\n** Centreon Broker is free software: you can redistribute it and\/or\n** modify it under the terms of the GNU General Public License version 2\n** as published by the Free Software Foundation.\n**\n** Centreon Broker is distributed in the hope that it will be useful,\n** but WITHOUT ANY WARRANTY; without even the implied warranty of\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n** General Public License for more details.\n**\n** You should have received a copy of the GNU General Public License\n** along with Centreon Broker. If not, see\n** <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <algorithm>\n#include <cctype>\n#include <cmath>\n#include <cstdlib>\n#include <cstring>\n#include \"com\/centreon\/broker\/logging\/logging.hh\"\n#include \"com\/centreon\/broker\/storage\/exceptions\/perfdata.hh\"\n#include \"com\/centreon\/broker\/storage\/parser.hh\"\n#include \"com\/centreon\/broker\/storage\/perfdata.hh\"\n\nusing namespace com::centreon::broker::storage;\n\n\/**************************************\n*                                     *\n*            Local Objects            *\n*                                     *\n**************************************\/\n\n\/**\n *  Extract a real value from a perfdata string.\n *\n *  @param[in,out] str  Pointer to a perfdata string.\n *  @param[in]     skip true to skip semicolon.\n *\n *  @return Extracted real value if successful, NaN otherwise.\n *\/\nstatic inline double extract_double(\n                       char const** str,\n                       bool skip = true) {\n  double retval;\n  char* tmp;\n  retval = strtod(*str, &tmp);\n  *str = tmp;\n  if (skip && (**str == ';'))\n    ++*str;\n  return (retval);\n}\n\n\/**************************************\n*                                     *\n*           Public Methods            *\n*                                     *\n**************************************\/\n\n\/**\n *  Default constructor.\n *\/\nparser::parser() {}\n\n\/**\n *  @brief Copy constructor.\n *\n *  No data is stored within the parser class.\n *\n *  @param[in] pp Unused.\n *\/\nparser::parser(parser const& pp) {\n  (void)pp;\n}\n\n\/**\n *  Destructor.\n *\/\nparser::~parser() {}\n\n\/**\n *  @brief Assignment operator.\n *\n *  No data is stored within the parser class.\n *\n *  @param[in] pp Unused.\n *\n *  @return This object.\n *\/\nparser& parser::operator=(parser const& pp) {\n  (void)pp;\n  return (*this);\n}\n\n\/**\n *  Parse perfdata string as given by plugin.\n *\n *  @param[in]  str Raw perfdata string.\n *  @param[out] pd  List of parsed metrics.\n *\/\nvoid parser::parse_perfdata(\n               QString const& str,\n               QList<perfdata>& pd) {\n  \/\/ Extract metrics strings.\n  std::string buf(str.toStdString());\n  std::replace(buf.begin(), buf.end(), ',', '.');\n  char const* ptr(buf.c_str());\n\n  \/\/ Skip initial whitespaces.\n  while (isblank(*ptr))\n    ++ptr;\n  while (*ptr) {\n    \/\/ Debug message.\n    logging::debug(logging::medium)\n      << \"storage: parsing perfdata string '\" << ptr << \"'\";\n\n    \/\/ Perfdata object.\n    perfdata p;\n\n    \/\/ Get metric name.\n    bool in_quote(false);\n    unsigned int i(0);\n    while (ptr[i] && (in_quote || (ptr[i] != '='))) {\n      if ('\\'' == ptr[i])\n        in_quote = !in_quote;\n      ++i;\n    }\n    std::string s(ptr, i);\n    ptr += i;\n\n    \/\/ Unquote metric name.\n    size_t t;\n    t = s.find_first_of('\\'');\n    while (t != std::string::npos) {\n      s.erase(t, 1);\n      t = s.find_first_of('\\'', t + 1); \/\/ Skip one char, so '' becomes '.\n    }\n    if ((s.size() > 0) && (*s.rbegin() == ']')) {\n      if (!s.compare(0, 2, \"a[\")) {\n        s = s.substr(2, s.size() - 3);\n        p.value_type(perfdata::absolute);\n      }\n      else if (!s.compare(0, 2, \"c[\")) {\n        s = s.substr(2, s.size() - 3);\n        p.value_type(perfdata::counter);\n      }\n      else if (!s.compare(0, 2, \"d[\")) {\n        s = s.substr(2, s.size() - 3);\n        p.value_type(perfdata::derive);\n      }\n      else if (!s.compare(0, 2, \"g[\")) {\n        s = s.substr(2, s.size() - 3);\n        p.value_type(perfdata::gauge);\n      }\n    }\n    p.name(QString(s.c_str()).trimmed());\n\n    \/\/ Check format.\n    if (*ptr != '=')\n      throw (exceptions::perfdata() << \"storage: invalid perfdata \" \\\n               \"format: equal sign not present or misplaced\");\n    ++ptr;\n\n    \/\/ Extract value.\n    p.value(extract_double(&ptr, false));\n    if (isnan(p.value()))\n      p.value(0.0);\n\n    \/\/ Extract unit.\n    t = strcspn(ptr, \" ;\");\n    p.unit(std::string(ptr, t).c_str());\n    ptr += t;\n    if (*ptr == ';')\n      ++ptr;\n\n    \/\/ Extract warning.\n    p.warning(extract_double(&ptr));\n\n    \/\/ Extract critical.\n    p.critical(extract_double(&ptr));\n\n    \/\/ Extract minimum.\n    p.min(extract_double(&ptr));\n\n    \/\/ Extract maximum.\n    p.max(extract_double(&ptr));\n\n    \/\/ Log new perfdata.\n    logging::debug(logging::low) << \"storage: got new perfdata (name=\"\n      << p.name() << \", value=\" << p.value() << \", unit=\" << p.unit()\n      << \", warning=\" << p.warning() << \", critical=\" << p.critical()\n      << \", min=\" << p.min() << \", max=\" << p.max() << \")\";\n\n    \/\/ Append to list.\n    pd.push_back(p);\n\n    \/\/ Skip whitespaces.\n    while (isblank(*ptr))\n      ++ptr;\n  }\n\n  return ;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  yas_processing_generator_modules.cpp\n\/\/\n\n#include \"yas_processing_generator_modules.h\"\n#include \"yas_processing_module.h\"\n#include \"yas_processing_send_signal_processor.h\"\n#include \"yas_processing_signal_event.h\"\n#include \"yas_fast_each.h\"\n\nusing namespace yas;\n\ntemplate <typename T>\nprocessing::module processing::make_signal_module(generator::kind const kind, frame_index_t const offset) {\n    using namespace yas::processing::generator;\n\n    auto prepare_processor = [](time::range const &, connector_map_t const &, connector_map_t const &,\n                                stream &) mutable {};\n\n    auto send_processor = processing::make_send_signal_processor<T>(\n        [kind, offset](processing::time::range const &time_range, sync_source const &sync_src, channel_index_t const,\n                       connector_index_t const con_idx, T *const signal_ptr) {\n            if (con_idx == to_connector_index(output::value)) {\n                auto out_each = make_fast_each(signal_ptr, time_range.length);\n                auto const top_idx = offset + time_range.frame;\n                T const sr = sync_src.sample_rate;\n\n                while (yas_fast_each_next(out_each)) {\n                    auto const &idx = yas_fast_each_index(out_each);\n                    switch (kind) {\n                        case kind::second:\n                            yas_fast_each_value(out_each) = (T)(top_idx + idx) \/ sr;\n                            break;\n                    }\n                }\n            }\n        });\n\n    return processing::module{{std::move(prepare_processor), std::move(send_processor)}};\n}\n\ntemplate processing::module processing::make_signal_module<double>(generator::kind const, frame_index_t const);\ntemplate processing::module processing::make_signal_module<float>(generator::kind const, frame_index_t const);\n\n;\n<commit_msg>fix generator_modules<commit_after>\/\/\n\/\/  yas_processing_generator_modules.cpp\n\/\/\n\n#include \"yas_processing_generator_modules.h\"\n#include \"yas_processing_module.h\"\n#include \"yas_processing_send_signal_processor.h\"\n#include \"yas_processing_signal_event.h\"\n#include \"yas_processing_sync_source.h\"\n#include \"yas_fast_each.h\"\n\nusing namespace yas;\n\ntemplate <typename T>\nprocessing::module processing::make_signal_module(generator::kind const kind, frame_index_t const offset) {\n    using namespace yas::processing::generator;\n\n    auto prepare_processor = [](time::range const &, connector_map_t const &, connector_map_t const &,\n                                stream &) mutable {};\n\n    auto send_processor = processing::make_send_signal_processor<T>(\n        [kind, offset](processing::time::range const &time_range, sync_source const &sync_src, channel_index_t const,\n                       connector_index_t const con_idx, T *const signal_ptr) {\n            if (con_idx == to_connector_index(output::value)) {\n                auto out_each = make_fast_each(signal_ptr, time_range.length);\n                auto const top_idx = offset + time_range.frame;\n                T const sr = sync_src.sample_rate;\n\n                while (yas_fast_each_next(out_each)) {\n                    auto const &idx = yas_fast_each_index(out_each);\n                    switch (kind) {\n                        case kind::second:\n                            yas_fast_each_value(out_each) = (T)(top_idx + idx) \/ sr;\n                            break;\n                    }\n                }\n            }\n        });\n\n    return processing::module{{std::move(prepare_processor), std::move(send_processor)}};\n}\n\ntemplate processing::module processing::make_signal_module<double>(generator::kind const, frame_index_t const);\ntemplate processing::module processing::make_signal_module<float>(generator::kind const, frame_index_t const);\n\n;\n<|endoftext|>"}
{"text":"<commit_before>\/\/ CONFIGURATION SOURCE\n\n#include \"include\/configuration.h\"\n\nnamespace sqlcheck {\n\nvoid Usage() {\n  std::cout <<\n      \"\\n\"\n      \"Command line options : sqlcheck <options>\\n\"\n      \"   -f --file_name          :  file name\\n\"\n      \"   -l --log_level          :  log level\\n\";\n  exit(EXIT_FAILURE);\n}\n\nstatic struct option opts[] = {\n    {\"file_name\", optional_argument, NULL, 'f'},\n    {\"log_level\", optional_argument, NULL, 'l'},\n    {NULL, 0, NULL, 0}\n};\n\nstd::string LogLevelToString(const LogLevel& log_level){\n\n  switch (log_level) {\n    case LOG_LEVEL_ERROR:\n      return \"ERROR\";\n    case LOG_LEVEL_WARN:\n      return \"WARN\";\n    case LOG_LEVEL_INFO:\n      return \"INFO\";\n    case LOG_LEVEL_DEBUG:\n      return \"DEBUG\";\n    case LOG_LEVEL_TRACE:\n      return \"TRACE\";\n    case LOG_LEVEL_ALL:\n      return \"ALL\";\n\n    case LOG_LEVEL_INVALID:\n    default:\n      return \"INVALID\";\n  }\n\n}\n\nstatic void ValidateLogLevel(const Configuration &state) {\n  if (state.log_level < LOG_LEVEL_ALL || state.log_level > LOG_LEVEL_INVALID) {\n    printf(\"Invalid log_level :: %d\\n\", state.log_level);\n    exit(EXIT_FAILURE);\n  }\n  else {\n    printf(\"--> %10s : %s\\n\", \"LOG LEVEL\",\n           LogLevelToString(state.log_level).c_str());\n  }\n}\n\nstatic void ValidateFileName(const Configuration &state) {\n  if (state.file_name.empty() == false) {\n    printf(\"--> %10s : %s\\n\", \"INPUT FILE NAME\",\n           state.file_name.c_str());\n  }\n}\n\nvoid ParseArguments(int argc, char *argv[], Configuration &state) {\n\n  \/\/ Default Values\n  state.log_level = LOG_LEVEL_ALL;\n  state.file_name = \"\"; \/\/ standard input\n  state.testing_mode = false;\n\n  \/\/ Parse args\n  while (1) {\n    int idx = 0;\n    int c = getopt_long(argc, argv, \"l:f:h\",\n                        opts, &idx);\n\n    if (c == -1) break;\n\n    switch (c) {\n      case 'l':\n        state.log_level = (LogLevel)atoi(optarg);\n        break;\n      case 'f':\n        state.file_name = optarg;\n        break;\n\n      case 'h':\n        Usage();\n        break;\n\n      default:\n        printf(\"Unknown option: -%c-\\n\", c);\n        Usage();\n    }\n  }\n\n  \/\/ Run validators\n  printf(\"--> %10s \\n\", \"SQLCHECK 0.1\");\n\n  ValidateLogLevel(state);\n  ValidateFileName(state);\n\n}\n\n}  \/\/ namespace sqlcheck\n<commit_msg>Updated return code<commit_after>\/\/ CONFIGURATION SOURCE\n\n#include \"include\/configuration.h\"\n\nnamespace sqlcheck {\n\nvoid Usage() {\n  std::cout <<\n      \"\\n\"\n      \"Command line options : sqlcheck <options>\\n\"\n      \"   -f --file_name          :  file name\\n\"\n      \"   -l --log_level          :  log level\\n\";\n  exit(EXIT_SUCCESS);\n}\n\nstatic struct option opts[] = {\n    {\"file_name\", optional_argument, NULL, 'f'},\n    {\"log_level\", optional_argument, NULL, 'l'},\n    {NULL, 0, NULL, 0}\n};\n\nstd::string LogLevelToString(const LogLevel& log_level){\n\n  switch (log_level) {\n    case LOG_LEVEL_ERROR:\n      return \"ERROR\";\n    case LOG_LEVEL_WARN:\n      return \"WARN\";\n    case LOG_LEVEL_INFO:\n      return \"INFO\";\n    case LOG_LEVEL_DEBUG:\n      return \"DEBUG\";\n    case LOG_LEVEL_TRACE:\n      return \"TRACE\";\n    case LOG_LEVEL_ALL:\n      return \"ALL\";\n\n    case LOG_LEVEL_INVALID:\n    default:\n      return \"INVALID\";\n  }\n\n}\n\nstatic void ValidateLogLevel(const Configuration &state) {\n  if (state.log_level < LOG_LEVEL_ALL || state.log_level > LOG_LEVEL_INVALID) {\n    printf(\"Invalid log_level :: %d\\n\", state.log_level);\n    exit(EXIT_FAILURE);\n  }\n  else {\n    printf(\"--> %10s : %s\\n\", \"LOG LEVEL\",\n           LogLevelToString(state.log_level).c_str());\n  }\n}\n\nstatic void ValidateFileName(const Configuration &state) {\n  if (state.file_name.empty() == false) {\n    printf(\"--> %10s : %s\\n\", \"INPUT FILE NAME\",\n           state.file_name.c_str());\n  }\n}\n\nvoid ParseArguments(int argc, char *argv[], Configuration &state) {\n\n  \/\/ Default Values\n  state.log_level = LOG_LEVEL_ALL;\n  state.file_name = \"\"; \/\/ standard input\n  state.testing_mode = false;\n\n  \/\/ Parse args\n  while (1) {\n    int idx = 0;\n    int c = getopt_long(argc, argv, \"l:f:h\",\n                        opts, &idx);\n\n    if (c == -1) break;\n\n    switch (c) {\n      case 'l':\n        state.log_level = (LogLevel)atoi(optarg);\n        break;\n      case 'f':\n        state.file_name = optarg;\n        break;\n\n      case 'h':\n        Usage();\n        break;\n\n      default:\n        printf(\"Unknown option: -%c-\\n\", c);\n        Usage();\n    }\n  }\n\n  \/\/ Run validators\n  printf(\"--> %10s \\n\", \"SQLCHECK 0.1\");\n\n  ValidateLogLevel(state);\n  ValidateFileName(state);\n\n}\n\n}  \/\/ namespace sqlcheck\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *  Copyright 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 <gtk\/gtk.h>\n\n#include \"webrtc\/examples\/peerconnection\/client\/conductor.h\"\n#include \"webrtc\/examples\/peerconnection\/client\/flagdefs.h\"\n#include \"webrtc\/examples\/peerconnection\/client\/linux\/main_wnd.h\"\n#include \"webrtc\/examples\/peerconnection\/client\/peer_connection_client.h\"\n\n#include \"webrtc\/base\/ssladapter.h\"\n#include \"webrtc\/base\/thread.h\"\n\nclass CustomSocketServer : public rtc::PhysicalSocketServer {\n public:\n  CustomSocketServer(rtc::Thread* thread, GtkMainWnd* wnd)\n      : thread_(thread), wnd_(wnd), conductor_(NULL), client_(NULL) {}\n  virtual ~CustomSocketServer() {}\n\n  void set_client(PeerConnectionClient* client) { client_ = client; }\n  void set_conductor(Conductor* conductor) { conductor_ = conductor; }\n\n  \/\/ Override so that we can also pump the GTK message loop.\n  virtual bool Wait(int cms, bool process_io) {\n    \/\/ Pump GTK events.\n    \/\/ TODO(henrike): We really should move either the socket server or UI to a\n    \/\/ different thread.  Alternatively we could look at merging the two loops\n    \/\/ by implementing a dispatcher for the socket server and\/or use\n    \/\/ g_main_context_set_poll_func.\n      while (gtk_events_pending())\n        gtk_main_iteration();\n\n    if (!wnd_->IsWindow() && !conductor_->connection_active() &&\n        client_ != NULL && !client_->is_connected()) {\n      thread_->Quit();\n    }\n    return rtc::PhysicalSocketServer::Wait(0\/*cms == -1 ? 1 : cms*\/,\n                                                 process_io);\n  }\n\n protected:\n  rtc::Thread* thread_;\n  GtkMainWnd* wnd_;\n  Conductor* conductor_;\n  PeerConnectionClient* client_;\n};\n\nint main(int argc, char* argv[]) {\n  gtk_init(&argc, &argv);\n  g_type_init();\n  \/\/ g_thread_init API is deprecated since glib 2.31.0, see release note:\n  \/\/ http:\/\/mail.gnome.org\/archives\/gnome-announce-list\/2011-October\/msg00041.html\n#if !GLIB_CHECK_VERSION(2, 31, 0)\n    g_thread_init(NULL);\n#endif\n\n  rtc::FlagList::SetFlagsFromCommandLine(&argc, argv, true);\n  if (FLAG_help) {\n    rtc::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  GtkMainWnd wnd(FLAG_server, FLAG_port, FLAG_autoconnect, FLAG_autocall);\n  wnd.Create();\n\n  rtc::AutoThread auto_thread;\n  rtc::Thread* thread = rtc::Thread::Current();\n  CustomSocketServer socket_server(thread, &wnd);\n  thread->set_socketserver(&socket_server);\n\n  rtc::InitializeSSL();\n  \/\/ Must be constructed after we set the socketserver.\n  PeerConnectionClient client;\n  rtc::scoped_refptr<Conductor> conductor(\n      new rtc::RefCountedObject<Conductor>(&client, &wnd));\n  socket_server.set_client(&client);\n  socket_server.set_conductor(conductor);\n\n  thread->Run();\n\n  \/\/ gtk_main();\n  wnd.Destroy();\n\n  thread->set_socketserver(NULL);\n  \/\/ TODO(henrike): Run the Gtk main loop to tear down the connection.\n  \/*\n  while (gtk_events_pending()) {\n    gtk_main_iteration();\n  }\n  *\/\n  rtc::CleanupSSL();\n  return 0;\n}\n<commit_msg>Reland of move usage of deprecated g_type_init API (patchset #1 id:1 of https:\/\/codereview.webrtc.org\/2666103002\/ )<commit_after>\/*\n *  Copyright 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 <gtk\/gtk.h>\n\n#include \"webrtc\/examples\/peerconnection\/client\/conductor.h\"\n#include \"webrtc\/examples\/peerconnection\/client\/flagdefs.h\"\n#include \"webrtc\/examples\/peerconnection\/client\/linux\/main_wnd.h\"\n#include \"webrtc\/examples\/peerconnection\/client\/peer_connection_client.h\"\n\n#include \"webrtc\/base\/ssladapter.h\"\n#include \"webrtc\/base\/thread.h\"\n\nclass CustomSocketServer : public rtc::PhysicalSocketServer {\n public:\n  CustomSocketServer(rtc::Thread* thread, GtkMainWnd* wnd)\n      : thread_(thread), wnd_(wnd), conductor_(NULL), client_(NULL) {}\n  virtual ~CustomSocketServer() {}\n\n  void set_client(PeerConnectionClient* client) { client_ = client; }\n  void set_conductor(Conductor* conductor) { conductor_ = conductor; }\n\n  \/\/ Override so that we can also pump the GTK message loop.\n  virtual bool Wait(int cms, bool process_io) {\n    \/\/ Pump GTK events.\n    \/\/ TODO(henrike): We really should move either the socket server or UI to a\n    \/\/ different thread.  Alternatively we could look at merging the two loops\n    \/\/ by implementing a dispatcher for the socket server and\/or use\n    \/\/ g_main_context_set_poll_func.\n      while (gtk_events_pending())\n        gtk_main_iteration();\n\n    if (!wnd_->IsWindow() && !conductor_->connection_active() &&\n        client_ != NULL && !client_->is_connected()) {\n      thread_->Quit();\n    }\n    return rtc::PhysicalSocketServer::Wait(0\/*cms == -1 ? 1 : cms*\/,\n                                                 process_io);\n  }\n\n protected:\n  rtc::Thread* thread_;\n  GtkMainWnd* wnd_;\n  Conductor* conductor_;\n  PeerConnectionClient* client_;\n};\n\nint main(int argc, char* argv[]) {\n  gtk_init(&argc, &argv);\n  \/\/ g_type_init API is deprecated (and does nothing) since glib 2.35.0, see:\n  \/\/ https:\/\/mail.gnome.org\/archives\/commits-list\/2012-November\/msg07809.html\n#if !GLIB_CHECK_VERSION(2, 35, 0)\n    g_type_init();\n#endif\n  \/\/ g_thread_init API is deprecated since glib 2.31.0, see release note:\n  \/\/ http:\/\/mail.gnome.org\/archives\/gnome-announce-list\/2011-October\/msg00041.html\n#if !GLIB_CHECK_VERSION(2, 31, 0)\n    g_thread_init(NULL);\n#endif\n\n  rtc::FlagList::SetFlagsFromCommandLine(&argc, argv, true);\n  if (FLAG_help) {\n    rtc::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  GtkMainWnd wnd(FLAG_server, FLAG_port, FLAG_autoconnect, FLAG_autocall);\n  wnd.Create();\n\n  rtc::AutoThread auto_thread;\n  rtc::Thread* thread = rtc::Thread::Current();\n  CustomSocketServer socket_server(thread, &wnd);\n  thread->set_socketserver(&socket_server);\n\n  rtc::InitializeSSL();\n  \/\/ Must be constructed after we set the socketserver.\n  PeerConnectionClient client;\n  rtc::scoped_refptr<Conductor> conductor(\n      new rtc::RefCountedObject<Conductor>(&client, &wnd));\n  socket_server.set_client(&client);\n  socket_server.set_conductor(conductor);\n\n  thread->Run();\n\n  \/\/ gtk_main();\n  wnd.Destroy();\n\n  thread->set_socketserver(NULL);\n  \/\/ TODO(henrike): Run the Gtk main loop to tear down the connection.\n  \/*\n  while (gtk_events_pending()) {\n    gtk_main_iteration();\n  }\n  *\/\n  rtc::CleanupSSL();\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <cassert>\r\n#include \"luacoroutine.h\"\r\n#include \"luatable.h\"\r\n#include \"luatypetemplates.h\"\r\n#include \"luafunction.h\"\r\n\r\nLuaFunctionBase::LuaFunctionBase(std::shared_ptr<lua_State> state, int index) : LuaReference(state, index)\r\n{\r\n\tauto type = GetType();\r\n\tif (type != LuaType::function)\r\n\t{\r\n\t\tLuaTable metatable = GetMetaTable();\r\n\t\tif (metatable.GetTypeOfValueAt(\"__call\") != LuaType::function)\r\n\t\t{\r\n\t\t\tconst char *msg = lua_pushfstring(state.get(), \"function or callable object expected, got %s\", luaL_typename(state.get(), index));\r\n\t\t\tluaL_argerror(state.get(), index, msg);\r\n\t\t}\r\n\t}\r\n\telse\r\n\t{\r\n\t\tif (type != LuaType::function)\r\n\t\t{\r\n\t\t\tconst char *msg = lua_pushfstring(state.get(), \"function or callable object expected, got %s\", luaL_typename(state.get(), index));\r\n\t\t\tluaL_argerror(state.get(), index, msg);\r\n\t\t}\r\n\t}\r\n}\r\n<commit_msg>remove useless condition<commit_after>#include <cassert>\r\n#include \"luacoroutine.h\"\r\n#include \"luatable.h\"\r\n#include \"luatypetemplates.h\"\r\n#include \"luafunction.h\"\r\n\r\nLuaFunctionBase::LuaFunctionBase(std::shared_ptr<lua_State> state, int index) : LuaReference(state, index)\r\n{\r\n\tauto type = GetType();\r\n\tif (type != LuaType::function)\r\n\t{\r\n\t\tLuaTable metatable = GetMetaTable();\r\n\t\tif (metatable.GetTypeOfValueAt(\"__call\") != LuaType::function)\r\n\t\t{\r\n\t\t\tconst char *msg = lua_pushfstring(state.get(), \"function or callable object expected, got %s\", luaL_typename(state.get(), index));\r\n\t\t\tluaL_argerror(state.get(), index, msg);\r\n\t\t}\r\n\t}\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Time:  addRange:    O(n)\n\/\/        removeRange: O(n)\n\/\/        queryRange:  O(logn)\n\/\/ Space: O(n)\n\nclass RangeModule {\npublic:\n    RangeModule() {\n        \n    }\n    \n    \/\/ Time:  O(n)\n    void addRange(int left, int right) {\n        vector<pair<int, int>> tmp;\n        int i = 0;\n        for (const auto& range: ranges_) {\n            if (range.first > right) {\n                tmp.emplace_back(left, right);\n                break;\n            } else if (range.second < left) {\n                tmp.emplace_back(range);\n            } else {\n                left = min(left, range.first);\n                right = max(right, range.second);\n            }\n            ++i;\n        }\n        if (i == ranges_.size()) {\n            tmp.emplace_back(left, right);\n        }\n        while (i < ranges_.size()) {\n            tmp.emplace_back(ranges_[i++]);\n        }\n        swap(ranges_, tmp);\n    }\n    \n    \/\/ Time:  O(logn)\n    bool queryRange(int left, int right) {\n        const auto it = lower_bound(ranges_.begin(), ranges_.end(), make_pair(left, right),\n                                    [](const pair<int, int>& lhs,\n                                       const pair<int, int>& rhs) {\n                                           return less<int>{}(lhs.second, rhs.first);\n                                    });\n        return it != ranges_.end() && it->first <= left && it->second >= right;\n    }\n    \n    \/\/ Time:  O(n)\n    void removeRange(int left, int right) {\n        int n = ranges_.size();\n        vector<pair<int, int>> tmp;\n        for (const auto& range : ranges_) {\n            if (range.second <= left || range.first >= right) {\n                tmp.emplace_back(range);\n            } else {\n                if (range.first < left) {\n                    tmp.emplace_back(range.first, left);\n                }\n                if (range.second > right) {\n                    tmp.emplace_back(right, range.second);\n                }\n            }\n        }\n        swap(ranges_, tmp);\n    }\n    \nprivate:\n    vector<pair<int, int>> ranges_;\n};\n\n\/**\n * Your RangeModule object will be instantiated and called as such:\n * RangeModule obj = new RangeModule();\n * obj.addRange(left,right);\n * bool param_2 = obj.queryRange(left,right);\n * obj.removeRange(left,right);\n *\/\n<commit_msg>Update range-module.cpp<commit_after>\/\/ Time:  addRange:    O(n)\n\/\/        removeRange: O(n)\n\/\/        queryRange:  O(logn)\n\/\/ Space: O(n)\n\nclass RangeModule {\npublic:\n    RangeModule() {\n        \n    }\n    \n    \/\/ Time:  O(n)\n    void addRange(int left, int right) {\n        vector<pair<int, int>> tmp;\n        int i = 0;\n        for (const auto& range: ranges_) {\n            if (range.first > right) {\n                tmp.emplace_back(left, right);\n                break;\n            } else if (range.second < left) {\n                tmp.emplace_back(range);\n            } else {\n                left = min(left, range.first);\n                right = max(right, range.second);\n            }\n            ++i;\n        }\n        if (i == ranges_.size()) {\n            tmp.emplace_back(left, right);\n        }\n        while (i < ranges_.size()) {\n            tmp.emplace_back(ranges_[i++]);\n        }\n        swap(ranges_, tmp);\n    }\n    \n    \/\/ Time:  O(logn)\n    bool queryRange(int left, int right) {\n        const auto it = lower_bound(ranges_.begin(), ranges_.end(), make_pair(left, right),\n                                    [](const pair<int, int>& lhs,\n                                       const pair<int, int>& rhs) {\n                                           return less<int>{}(lhs.second, rhs.first);\n                                    });\n        return it != ranges_.end() && it->first <= left && it->second >= right;\n    }\n    \n    \/\/ Time:  O(n)\n    void removeRange(int left, int right) {\n        int n = ranges_.size();\n        vector<pair<int, int>> tmp;\n        for (const auto& range : ranges_) {\n            if (range.second <= left || range.first >= right) {\n                tmp.emplace_back(range);\n            } else {\n                if (range.first < left) {\n                    tmp.emplace_back(range.first, left);\n                }\n                if (right < range.second) {\n                    tmp.emplace_back(right, range.second);\n                }\n            }\n        }\n        swap(ranges_, tmp);\n    }\n    \nprivate:\n    vector<pair<int, int>> ranges_;\n};\n\n\/**\n * Your RangeModule object will be instantiated and called as such:\n * RangeModule obj = new RangeModule();\n * obj.addRange(left,right);\n * bool param_2 = obj.queryRange(left,right);\n * obj.removeRange(left,right);\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\/net\/atom_network_delegate.h\"\n\n#include <utility>\n\n#include \"atom\/browser\/api\/atom_api_web_contents.h\"\n#include \"atom\/common\/native_mate_converters\/net_converter.h\"\n#include \"base\/stl_util.h\"\n#include \"base\/strings\/string_util.h\"\n#include \"brightray\/browser\/net\/devtools_network_transaction.h\"\n#include \"content\/public\/browser\/browser_thread.h\"\n#include \"content\/public\/browser\/render_frame_host.h\"\n#include \"net\/url_request\/url_request.h\"\n\nusing brightray::DevToolsNetworkTransaction;\nusing content::BrowserThread;\n\nnamespace atom {\n\nconst char* ResourceTypeToString(content::ResourceType type) {\n  switch (type) {\n    case content::RESOURCE_TYPE_MAIN_FRAME:\n      return \"mainFrame\";\n    case content::RESOURCE_TYPE_SUB_FRAME:\n      return \"subFrame\";\n    case content::RESOURCE_TYPE_STYLESHEET:\n      return \"stylesheet\";\n    case content::RESOURCE_TYPE_SCRIPT:\n      return \"script\";\n    case content::RESOURCE_TYPE_IMAGE:\n      return \"image\";\n    case content::RESOURCE_TYPE_OBJECT:\n      return \"object\";\n    case content::RESOURCE_TYPE_XHR:\n      return \"xhr\";\n    default:\n      return \"other\";\n  }\n}\n\nnamespace {\n\nusing ResponseHeadersContainer =\n    std::pair<scoped_refptr<net::HttpResponseHeaders>*, const std::string&>;\n\nvoid RunSimpleListener(const AtomNetworkDelegate::SimpleListener& listener,\n                       std::unique_ptr<base::DictionaryValue> details) {\n  return listener.Run(*(details.get()));\n}\n\nvoid RunResponseListener(\n    const AtomNetworkDelegate::ResponseListener& listener,\n    std::unique_ptr<base::DictionaryValue> details,\n    const AtomNetworkDelegate::ResponseCallback& callback) {\n  return listener.Run(*(details.get()), callback);\n}\n\n\/\/ Test whether the URL of |request| matches |patterns|.\nbool MatchesFilterCondition(net::URLRequest* request,\n                            const URLPatterns& patterns) {\n  if (patterns.empty())\n    return true;\n\n  for (const auto& pattern : patterns) {\n    if (pattern.MatchesURL(request->url()))\n      return true;\n  }\n  return false;\n}\n\n\/\/ Overloaded by multiple types to fill the |details| object.\nvoid ToDictionary(base::DictionaryValue* details, net::URLRequest* request) {\n  FillRequestDetails(details, request);\n  details->SetInteger(\"id\", request->identifier());\n  details->SetDouble(\"timestamp\", base::Time::Now().ToDoubleT() * 1000);\n  const content::ResourceRequestInfo* info = content::ResourceRequestInfo::ForRequest(request);\n  if (info) {\n    int process_id = info->GetChildID();\n    int frame_id = info->GetRenderFrameID();\n    content::WebContents* webContents\n      = content::WebContents::FromRenderFrameHost(content::RenderFrameHost::FromID(process_id, frame_id));\n    details->SetInteger(\"webContentsId\", atom::api::WebContents::GetIDFromWrappedClass(webContents));\n  } else {\n    details->SetString(\"resourceType\", \"other\");\n  }\n}\n\nvoid ToDictionary(base::DictionaryValue* details,\n                  const net::HttpRequestHeaders& headers) {\n  std::unique_ptr<base::DictionaryValue> dict(new base::DictionaryValue);\n  net::HttpRequestHeaders::Iterator it(headers);\n  while (it.GetNext())\n    dict->SetStringWithoutPathExpansion(it.name(), it.value());\n  details->Set(\"requestHeaders\", std::move(dict));\n}\n\nvoid ToDictionary(base::DictionaryValue* details,\n                  const net::HttpResponseHeaders* headers) {\n  if (!headers)\n    return;\n\n  std::unique_ptr<base::DictionaryValue> dict(new base::DictionaryValue);\n  size_t iter = 0;\n  std::string key;\n  std::string value;\n  while (headers->EnumerateHeaderLines(&iter, &key, &value)) {\n    if (dict->HasKey(key)) {\n      base::ListValue* values = nullptr;\n      if (dict->GetList(key, &values))\n        values->AppendString(value);\n    } else {\n      std::unique_ptr<base::ListValue> values(new base::ListValue);\n      values->AppendString(value);\n      dict->Set(key, std::move(values));\n    }\n  }\n  details->Set(\"responseHeaders\", std::move(dict));\n  details->SetString(\"statusLine\", headers->GetStatusLine());\n  details->SetInteger(\"statusCode\", headers->response_code());\n}\n\nvoid ToDictionary(base::DictionaryValue* details, const GURL& location) {\n  details->SetString(\"redirectURL\", location.spec());\n}\n\nvoid ToDictionary(base::DictionaryValue* details,\n                  const net::HostPortPair& host_port) {\n  if (host_port.host().empty())\n    details->SetString(\"ip\", host_port.host());\n}\n\nvoid ToDictionary(base::DictionaryValue* details, bool from_cache) {\n  details->SetBoolean(\"fromCache\", from_cache);\n}\n\nvoid ToDictionary(base::DictionaryValue* details,\n                  const net::URLRequestStatus& status) {\n  details->SetString(\"error\", net::ErrorToString(status.error()));\n}\n\n\/\/ Helper function to fill |details| with arbitrary |args|.\ntemplate<typename Arg>\nvoid FillDetailsObject(base::DictionaryValue* details, Arg arg) {\n  ToDictionary(details, arg);\n}\n\ntemplate<typename Arg, typename... Args>\nvoid FillDetailsObject(base::DictionaryValue* details, Arg arg, Args... args) {\n  ToDictionary(details, arg);\n  FillDetailsObject(details, args...);\n}\n\n\/\/ Fill the native types with the result from the response object.\nvoid ReadFromResponseObject(const base::DictionaryValue& response,\n                            GURL* new_location) {\n  std::string url;\n  if (response.GetString(\"redirectURL\", &url))\n    *new_location = GURL(url);\n}\n\nvoid ReadFromResponseObject(const base::DictionaryValue& response,\n                            net::HttpRequestHeaders* headers) {\n  const base::DictionaryValue* dict;\n  if (response.GetDictionary(\"requestHeaders\", &dict)) {\n    headers->Clear();\n    for (base::DictionaryValue::Iterator it(*dict);\n         !it.IsAtEnd();\n         it.Advance()) {\n      std::string value;\n      if (it.value().GetAsString(&value))\n        headers->SetHeader(it.key(), value);\n    }\n  }\n}\n\nvoid ReadFromResponseObject(const base::DictionaryValue& response,\n                            const ResponseHeadersContainer& container) {\n  const base::DictionaryValue* dict;\n  std::string status_line;\n  if (!response.GetString(\"statusLine\", &status_line))\n    status_line = container.second;\n  if (response.GetDictionary(\"responseHeaders\", &dict)) {\n    auto headers = container.first;\n    *headers = new net::HttpResponseHeaders(\"\");\n    (*headers)->ReplaceStatusLine(status_line);\n    for (base::DictionaryValue::Iterator it(*dict);\n         !it.IsAtEnd();\n         it.Advance()) {\n      const base::ListValue* list;\n      if (it.value().GetAsList(&list)) {\n        (*headers)->RemoveHeader(it.key());\n        for (size_t i = 0; i < list->GetSize(); ++i) {\n          std::string value;\n          if (list->GetString(i, &value))\n            (*headers)->AddHeader(it.key() + \" : \" + value);\n        }\n      }\n    }\n  }\n}\n\n}  \/\/ namespace\n\nAtomNetworkDelegate::AtomNetworkDelegate() {\n}\n\nAtomNetworkDelegate::~AtomNetworkDelegate() {\n}\n\nvoid AtomNetworkDelegate::SetSimpleListenerInIO(\n    SimpleEvent type,\n    const URLPatterns& patterns,\n    const SimpleListener& callback) {\n  if (callback.is_null())\n    simple_listeners_.erase(type);\n  else\n    simple_listeners_[type] = { patterns, callback };\n}\n\nvoid AtomNetworkDelegate::SetResponseListenerInIO(\n    ResponseEvent type,\n    const URLPatterns& patterns,\n    const ResponseListener& callback) {\n  if (callback.is_null())\n    response_listeners_.erase(type);\n  else\n    response_listeners_[type] = { patterns, callback };\n}\n\nvoid AtomNetworkDelegate::SetDevToolsNetworkEmulationClientId(\n    const std::string& client_id) {\n  base::AutoLock auto_lock(lock_);\n  client_id_ = client_id;\n}\n\nint AtomNetworkDelegate::OnBeforeURLRequest(\n    net::URLRequest* request,\n    const net::CompletionCallback& callback,\n    GURL* new_url) {\n  if (!base::ContainsKey(response_listeners_, kOnBeforeRequest))\n    return brightray::NetworkDelegate::OnBeforeURLRequest(\n        request, callback, new_url);\n\n  return HandleResponseEvent(kOnBeforeRequest, request, callback, new_url);\n}\n\nint AtomNetworkDelegate::OnBeforeStartTransaction(\n    net::URLRequest* request,\n    const net::CompletionCallback& callback,\n    net::HttpRequestHeaders* headers) {\n  std::string client_id;\n  {\n    base::AutoLock auto_lock(lock_);\n    client_id = client_id_;\n  }\n\n  if (!client_id.empty())\n    headers->SetHeader(\n        DevToolsNetworkTransaction::kDevToolsEmulateNetworkConditionsClientId,\n        client_id);\n  if (!base::ContainsKey(response_listeners_, kOnBeforeSendHeaders))\n    return brightray::NetworkDelegate::OnBeforeStartTransaction(\n        request, callback, headers);\n\n  return HandleResponseEvent(\n      kOnBeforeSendHeaders, request, callback, headers, *headers);\n}\n\nvoid AtomNetworkDelegate::OnStartTransaction(\n    net::URLRequest* request,\n    const net::HttpRequestHeaders& headers) {\n  if (!base::ContainsKey(simple_listeners_, kOnSendHeaders)) {\n    brightray::NetworkDelegate::OnStartTransaction(request, headers);\n    return;\n  }\n\n  HandleSimpleEvent(kOnSendHeaders, request, headers);\n}\n\nint AtomNetworkDelegate::OnHeadersReceived(\n    net::URLRequest* request,\n    const net::CompletionCallback& callback,\n    const net::HttpResponseHeaders* original,\n    scoped_refptr<net::HttpResponseHeaders>* override,\n    GURL* allowed) {\n  if (!base::ContainsKey(response_listeners_, kOnHeadersReceived))\n    return brightray::NetworkDelegate::OnHeadersReceived(\n        request, callback, original, override, allowed);\n\n  return HandleResponseEvent(\n      kOnHeadersReceived, request, callback,\n      std::make_pair(override, original->GetStatusLine()), original);\n}\n\nvoid AtomNetworkDelegate::OnBeforeRedirect(net::URLRequest* request,\n                                           const GURL& new_location) {\n  if (!base::ContainsKey(simple_listeners_, kOnBeforeRedirect)) {\n    brightray::NetworkDelegate::OnBeforeRedirect(request, new_location);\n    return;\n  }\n\n  HandleSimpleEvent(kOnBeforeRedirect, request, new_location,\n                    request->response_headers(), request->GetSocketAddress(),\n                    request->was_cached());\n}\n\nvoid AtomNetworkDelegate::OnResponseStarted(net::URLRequest* request) {\n  if (!base::ContainsKey(simple_listeners_, kOnResponseStarted)) {\n    brightray::NetworkDelegate::OnResponseStarted(request);\n    return;\n  }\n\n  if (request->status().status() != net::URLRequestStatus::SUCCESS)\n    return;\n\n  HandleSimpleEvent(kOnResponseStarted, request, request->response_headers(),\n                    request->was_cached());\n}\n\nvoid AtomNetworkDelegate::OnCompleted(net::URLRequest* request, bool started) {\n  \/\/ OnCompleted may happen before other events.\n  callbacks_.erase(request->identifier());\n\n  if (request->status().status() == net::URLRequestStatus::FAILED ||\n      request->status().status() == net::URLRequestStatus::CANCELED) {\n    \/\/ Error event.\n    OnErrorOccurred(request, started);\n    return;\n  } else if (request->response_headers() &&\n             net::HttpResponseHeaders::IsRedirectResponseCode(\n                 request->response_headers()->response_code())) {\n    \/\/ Redirect event.\n    brightray::NetworkDelegate::OnCompleted(request, started);\n    return;\n  }\n\n  if (!base::ContainsKey(simple_listeners_, kOnCompleted)) {\n    brightray::NetworkDelegate::OnCompleted(request, started);\n    return;\n  }\n\n  HandleSimpleEvent(kOnCompleted, request, request->response_headers(),\n                    request->was_cached());\n}\n\nvoid AtomNetworkDelegate::OnURLRequestDestroyed(net::URLRequest* request) {\n  callbacks_.erase(request->identifier());\n}\n\nvoid AtomNetworkDelegate::OnErrorOccurred(\n    net::URLRequest* request, bool started) {\n  if (!base::ContainsKey(simple_listeners_, kOnErrorOccurred)) {\n    brightray::NetworkDelegate::OnCompleted(request, started);\n    return;\n  }\n\n  HandleSimpleEvent(kOnErrorOccurred, request, request->was_cached(),\n                    request->status());\n}\n\ntemplate<typename Out, typename... Args>\nint AtomNetworkDelegate::HandleResponseEvent(\n    ResponseEvent type,\n    net::URLRequest* request,\n    const net::CompletionCallback& callback,\n    Out out,\n    Args... args) {\n  const auto& info = response_listeners_[type];\n  if (!MatchesFilterCondition(request, info.url_patterns))\n    return net::OK;\n\n  std::unique_ptr<base::DictionaryValue> details(new base::DictionaryValue);\n  FillDetailsObject(details.get(), request, args...);\n\n  \/\/ The |request| could be destroyed before the |callback| is called.\n  callbacks_[request->identifier()] = callback;\n\n  ResponseCallback response =\n      base::Bind(&AtomNetworkDelegate::OnListenerResultInUI<Out>,\n                 base::Unretained(this), request->identifier(), out);\n  BrowserThread::PostTask(\n      BrowserThread::UI, FROM_HERE,\n      base::Bind(RunResponseListener, info.listener, base::Passed(&details),\n                 response));\n  return net::ERR_IO_PENDING;\n}\n\ntemplate<typename...Args>\nvoid AtomNetworkDelegate::HandleSimpleEvent(\n    SimpleEvent type, net::URLRequest* request, Args... args) {\n  const auto& info = simple_listeners_[type];\n  if (!MatchesFilterCondition(request, info.url_patterns))\n    return;\n\n  std::unique_ptr<base::DictionaryValue> details(new base::DictionaryValue);\n  FillDetailsObject(details.get(), request, args...);\n\n  BrowserThread::PostTask(\n      BrowserThread::UI, FROM_HERE,\n      base::Bind(RunSimpleListener, info.listener, base::Passed(&details)));\n}\n\ntemplate<typename T>\nvoid AtomNetworkDelegate::OnListenerResultInIO(\n    uint64_t id, T out, std::unique_ptr<base::DictionaryValue> response) {\n  \/\/ The request has been destroyed.\n  if (!base::ContainsKey(callbacks_, id))\n    return;\n\n  ReadFromResponseObject(*response, out);\n\n  bool cancel = false;\n  response->GetBoolean(\"cancel\", &cancel);\n  callbacks_[id].Run(cancel ? net::ERR_BLOCKED_BY_CLIENT : net::OK);\n}\n\ntemplate<typename T>\nvoid AtomNetworkDelegate::OnListenerResultInUI(\n    uint64_t id, T out, const base::DictionaryValue& response) {\n  std::unique_ptr<base::DictionaryValue> copy = response.CreateDeepCopy();\n  BrowserThread::PostTask(\n      BrowserThread::IO, FROM_HERE,\n      base::Bind(&AtomNetworkDelegate::OnListenerResultInIO<T>,\n                 base::Unretained(this),  id, out, base::Passed(&copy)));\n}\n\n}  \/\/ namespace atom\n<commit_msg>fix lint-cpp<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\/net\/atom_network_delegate.h\"\n\n#include <utility>\n\n#include \"atom\/browser\/api\/atom_api_web_contents.h\"\n#include \"atom\/common\/native_mate_converters\/net_converter.h\"\n#include \"base\/stl_util.h\"\n#include \"base\/strings\/string_util.h\"\n#include \"brightray\/browser\/net\/devtools_network_transaction.h\"\n#include \"content\/public\/browser\/browser_thread.h\"\n#include \"content\/public\/browser\/render_frame_host.h\"\n#include \"net\/url_request\/url_request.h\"\n\nusing brightray::DevToolsNetworkTransaction;\nusing content::BrowserThread;\n\nnamespace atom {\n\nconst char* ResourceTypeToString(content::ResourceType type) {\n  switch (type) {\n    case content::RESOURCE_TYPE_MAIN_FRAME:\n      return \"mainFrame\";\n    case content::RESOURCE_TYPE_SUB_FRAME:\n      return \"subFrame\";\n    case content::RESOURCE_TYPE_STYLESHEET:\n      return \"stylesheet\";\n    case content::RESOURCE_TYPE_SCRIPT:\n      return \"script\";\n    case content::RESOURCE_TYPE_IMAGE:\n      return \"image\";\n    case content::RESOURCE_TYPE_OBJECT:\n      return \"object\";\n    case content::RESOURCE_TYPE_XHR:\n      return \"xhr\";\n    default:\n      return \"other\";\n  }\n}\n\nnamespace {\n\nusing ResponseHeadersContainer =\n    std::pair<scoped_refptr<net::HttpResponseHeaders>*, const std::string&>;\n\nvoid RunSimpleListener(const AtomNetworkDelegate::SimpleListener& listener,\n                       std::unique_ptr<base::DictionaryValue> details) {\n  return listener.Run(*(details.get()));\n}\n\nvoid RunResponseListener(\n    const AtomNetworkDelegate::ResponseListener& listener,\n    std::unique_ptr<base::DictionaryValue> details,\n    const AtomNetworkDelegate::ResponseCallback& callback) {\n  return listener.Run(*(details.get()), callback);\n}\n\n\/\/ Test whether the URL of |request| matches |patterns|.\nbool MatchesFilterCondition(net::URLRequest* request,\n                            const URLPatterns& patterns) {\n  if (patterns.empty())\n    return true;\n\n  for (const auto& pattern : patterns) {\n    if (pattern.MatchesURL(request->url()))\n      return true;\n  }\n  return false;\n}\n\n\/\/ Overloaded by multiple types to fill the |details| object.\nvoid ToDictionary(base::DictionaryValue* details, net::URLRequest* request) {\n  FillRequestDetails(details, request);\n  details->SetInteger(\"id\", request->identifier());\n  details->SetDouble(\"timestamp\", base::Time::Now().ToDoubleT() * 1000);\n  const content::ResourceRequestInfo* info\n    = content::ResourceRequestInfo::ForRequest(request);\n  if (info) {\n    int process_id = info->GetChildID();\n    int frame_id = info->GetRenderFrameID();\n    content::WebContents* webContents\n      = content::WebContents::FromRenderFrameHost(\n        content::RenderFrameHost::FromID(process_id, frame_id));\n    details->SetInteger(\"webContentsId\",\n      atom::api::WebContents::GetIDFromWrappedClass(webContents));\n  } else {\n    details->SetString(\"resourceType\", \"other\");\n  }\n}\n\nvoid ToDictionary(base::DictionaryValue* details,\n                  const net::HttpRequestHeaders& headers) {\n  std::unique_ptr<base::DictionaryValue> dict(new base::DictionaryValue);\n  net::HttpRequestHeaders::Iterator it(headers);\n  while (it.GetNext())\n    dict->SetStringWithoutPathExpansion(it.name(), it.value());\n  details->Set(\"requestHeaders\", std::move(dict));\n}\n\nvoid ToDictionary(base::DictionaryValue* details,\n                  const net::HttpResponseHeaders* headers) {\n  if (!headers)\n    return;\n\n  std::unique_ptr<base::DictionaryValue> dict(new base::DictionaryValue);\n  size_t iter = 0;\n  std::string key;\n  std::string value;\n  while (headers->EnumerateHeaderLines(&iter, &key, &value)) {\n    if (dict->HasKey(key)) {\n      base::ListValue* values = nullptr;\n      if (dict->GetList(key, &values))\n        values->AppendString(value);\n    } else {\n      std::unique_ptr<base::ListValue> values(new base::ListValue);\n      values->AppendString(value);\n      dict->Set(key, std::move(values));\n    }\n  }\n  details->Set(\"responseHeaders\", std::move(dict));\n  details->SetString(\"statusLine\", headers->GetStatusLine());\n  details->SetInteger(\"statusCode\", headers->response_code());\n}\n\nvoid ToDictionary(base::DictionaryValue* details, const GURL& location) {\n  details->SetString(\"redirectURL\", location.spec());\n}\n\nvoid ToDictionary(base::DictionaryValue* details,\n                  const net::HostPortPair& host_port) {\n  if (host_port.host().empty())\n    details->SetString(\"ip\", host_port.host());\n}\n\nvoid ToDictionary(base::DictionaryValue* details, bool from_cache) {\n  details->SetBoolean(\"fromCache\", from_cache);\n}\n\nvoid ToDictionary(base::DictionaryValue* details,\n                  const net::URLRequestStatus& status) {\n  details->SetString(\"error\", net::ErrorToString(status.error()));\n}\n\n\/\/ Helper function to fill |details| with arbitrary |args|.\ntemplate<typename Arg>\nvoid FillDetailsObject(base::DictionaryValue* details, Arg arg) {\n  ToDictionary(details, arg);\n}\n\ntemplate<typename Arg, typename... Args>\nvoid FillDetailsObject(base::DictionaryValue* details, Arg arg, Args... args) {\n  ToDictionary(details, arg);\n  FillDetailsObject(details, args...);\n}\n\n\/\/ Fill the native types with the result from the response object.\nvoid ReadFromResponseObject(const base::DictionaryValue& response,\n                            GURL* new_location) {\n  std::string url;\n  if (response.GetString(\"redirectURL\", &url))\n    *new_location = GURL(url);\n}\n\nvoid ReadFromResponseObject(const base::DictionaryValue& response,\n                            net::HttpRequestHeaders* headers) {\n  const base::DictionaryValue* dict;\n  if (response.GetDictionary(\"requestHeaders\", &dict)) {\n    headers->Clear();\n    for (base::DictionaryValue::Iterator it(*dict);\n         !it.IsAtEnd();\n         it.Advance()) {\n      std::string value;\n      if (it.value().GetAsString(&value))\n        headers->SetHeader(it.key(), value);\n    }\n  }\n}\n\nvoid ReadFromResponseObject(const base::DictionaryValue& response,\n                            const ResponseHeadersContainer& container) {\n  const base::DictionaryValue* dict;\n  std::string status_line;\n  if (!response.GetString(\"statusLine\", &status_line))\n    status_line = container.second;\n  if (response.GetDictionary(\"responseHeaders\", &dict)) {\n    auto headers = container.first;\n    *headers = new net::HttpResponseHeaders(\"\");\n    (*headers)->ReplaceStatusLine(status_line);\n    for (base::DictionaryValue::Iterator it(*dict);\n         !it.IsAtEnd();\n         it.Advance()) {\n      const base::ListValue* list;\n      if (it.value().GetAsList(&list)) {\n        (*headers)->RemoveHeader(it.key());\n        for (size_t i = 0; i < list->GetSize(); ++i) {\n          std::string value;\n          if (list->GetString(i, &value))\n            (*headers)->AddHeader(it.key() + \" : \" + value);\n        }\n      }\n    }\n  }\n}\n\n}  \/\/ namespace\n\nAtomNetworkDelegate::AtomNetworkDelegate() {\n}\n\nAtomNetworkDelegate::~AtomNetworkDelegate() {\n}\n\nvoid AtomNetworkDelegate::SetSimpleListenerInIO(\n    SimpleEvent type,\n    const URLPatterns& patterns,\n    const SimpleListener& callback) {\n  if (callback.is_null())\n    simple_listeners_.erase(type);\n  else\n    simple_listeners_[type] = { patterns, callback };\n}\n\nvoid AtomNetworkDelegate::SetResponseListenerInIO(\n    ResponseEvent type,\n    const URLPatterns& patterns,\n    const ResponseListener& callback) {\n  if (callback.is_null())\n    response_listeners_.erase(type);\n  else\n    response_listeners_[type] = { patterns, callback };\n}\n\nvoid AtomNetworkDelegate::SetDevToolsNetworkEmulationClientId(\n    const std::string& client_id) {\n  base::AutoLock auto_lock(lock_);\n  client_id_ = client_id;\n}\n\nint AtomNetworkDelegate::OnBeforeURLRequest(\n    net::URLRequest* request,\n    const net::CompletionCallback& callback,\n    GURL* new_url) {\n  if (!base::ContainsKey(response_listeners_, kOnBeforeRequest))\n    return brightray::NetworkDelegate::OnBeforeURLRequest(\n        request, callback, new_url);\n\n  return HandleResponseEvent(kOnBeforeRequest, request, callback, new_url);\n}\n\nint AtomNetworkDelegate::OnBeforeStartTransaction(\n    net::URLRequest* request,\n    const net::CompletionCallback& callback,\n    net::HttpRequestHeaders* headers) {\n  std::string client_id;\n  {\n    base::AutoLock auto_lock(lock_);\n    client_id = client_id_;\n  }\n\n  if (!client_id.empty())\n    headers->SetHeader(\n        DevToolsNetworkTransaction::kDevToolsEmulateNetworkConditionsClientId,\n        client_id);\n  if (!base::ContainsKey(response_listeners_, kOnBeforeSendHeaders))\n    return brightray::NetworkDelegate::OnBeforeStartTransaction(\n        request, callback, headers);\n\n  return HandleResponseEvent(\n      kOnBeforeSendHeaders, request, callback, headers, *headers);\n}\n\nvoid AtomNetworkDelegate::OnStartTransaction(\n    net::URLRequest* request,\n    const net::HttpRequestHeaders& headers) {\n  if (!base::ContainsKey(simple_listeners_, kOnSendHeaders)) {\n    brightray::NetworkDelegate::OnStartTransaction(request, headers);\n    return;\n  }\n\n  HandleSimpleEvent(kOnSendHeaders, request, headers);\n}\n\nint AtomNetworkDelegate::OnHeadersReceived(\n    net::URLRequest* request,\n    const net::CompletionCallback& callback,\n    const net::HttpResponseHeaders* original,\n    scoped_refptr<net::HttpResponseHeaders>* override,\n    GURL* allowed) {\n  if (!base::ContainsKey(response_listeners_, kOnHeadersReceived))\n    return brightray::NetworkDelegate::OnHeadersReceived(\n        request, callback, original, override, allowed);\n\n  return HandleResponseEvent(\n      kOnHeadersReceived, request, callback,\n      std::make_pair(override, original->GetStatusLine()), original);\n}\n\nvoid AtomNetworkDelegate::OnBeforeRedirect(net::URLRequest* request,\n                                           const GURL& new_location) {\n  if (!base::ContainsKey(simple_listeners_, kOnBeforeRedirect)) {\n    brightray::NetworkDelegate::OnBeforeRedirect(request, new_location);\n    return;\n  }\n\n  HandleSimpleEvent(kOnBeforeRedirect, request, new_location,\n                    request->response_headers(), request->GetSocketAddress(),\n                    request->was_cached());\n}\n\nvoid AtomNetworkDelegate::OnResponseStarted(net::URLRequest* request) {\n  if (!base::ContainsKey(simple_listeners_, kOnResponseStarted)) {\n    brightray::NetworkDelegate::OnResponseStarted(request);\n    return;\n  }\n\n  if (request->status().status() != net::URLRequestStatus::SUCCESS)\n    return;\n\n  HandleSimpleEvent(kOnResponseStarted, request, request->response_headers(),\n                    request->was_cached());\n}\n\nvoid AtomNetworkDelegate::OnCompleted(net::URLRequest* request, bool started) {\n  \/\/ OnCompleted may happen before other events.\n  callbacks_.erase(request->identifier());\n\n  if (request->status().status() == net::URLRequestStatus::FAILED ||\n      request->status().status() == net::URLRequestStatus::CANCELED) {\n    \/\/ Error event.\n    OnErrorOccurred(request, started);\n    return;\n  } else if (request->response_headers() &&\n             net::HttpResponseHeaders::IsRedirectResponseCode(\n                 request->response_headers()->response_code())) {\n    \/\/ Redirect event.\n    brightray::NetworkDelegate::OnCompleted(request, started);\n    return;\n  }\n\n  if (!base::ContainsKey(simple_listeners_, kOnCompleted)) {\n    brightray::NetworkDelegate::OnCompleted(request, started);\n    return;\n  }\n\n  HandleSimpleEvent(kOnCompleted, request, request->response_headers(),\n                    request->was_cached());\n}\n\nvoid AtomNetworkDelegate::OnURLRequestDestroyed(net::URLRequest* request) {\n  callbacks_.erase(request->identifier());\n}\n\nvoid AtomNetworkDelegate::OnErrorOccurred(\n    net::URLRequest* request, bool started) {\n  if (!base::ContainsKey(simple_listeners_, kOnErrorOccurred)) {\n    brightray::NetworkDelegate::OnCompleted(request, started);\n    return;\n  }\n\n  HandleSimpleEvent(kOnErrorOccurred, request, request->was_cached(),\n                    request->status());\n}\n\ntemplate<typename Out, typename... Args>\nint AtomNetworkDelegate::HandleResponseEvent(\n    ResponseEvent type,\n    net::URLRequest* request,\n    const net::CompletionCallback& callback,\n    Out out,\n    Args... args) {\n  const auto& info = response_listeners_[type];\n  if (!MatchesFilterCondition(request, info.url_patterns))\n    return net::OK;\n\n  std::unique_ptr<base::DictionaryValue> details(new base::DictionaryValue);\n  FillDetailsObject(details.get(), request, args...);\n\n  \/\/ The |request| could be destroyed before the |callback| is called.\n  callbacks_[request->identifier()] = callback;\n\n  ResponseCallback response =\n      base::Bind(&AtomNetworkDelegate::OnListenerResultInUI<Out>,\n                 base::Unretained(this), request->identifier(), out);\n  BrowserThread::PostTask(\n      BrowserThread::UI, FROM_HERE,\n      base::Bind(RunResponseListener, info.listener, base::Passed(&details),\n                 response));\n  return net::ERR_IO_PENDING;\n}\n\ntemplate<typename...Args>\nvoid AtomNetworkDelegate::HandleSimpleEvent(\n    SimpleEvent type, net::URLRequest* request, Args... args) {\n  const auto& info = simple_listeners_[type];\n  if (!MatchesFilterCondition(request, info.url_patterns))\n    return;\n\n  std::unique_ptr<base::DictionaryValue> details(new base::DictionaryValue);\n  FillDetailsObject(details.get(), request, args...);\n\n  BrowserThread::PostTask(\n      BrowserThread::UI, FROM_HERE,\n      base::Bind(RunSimpleListener, info.listener, base::Passed(&details)));\n}\n\ntemplate<typename T>\nvoid AtomNetworkDelegate::OnListenerResultInIO(\n    uint64_t id, T out, std::unique_ptr<base::DictionaryValue> response) {\n  \/\/ The request has been destroyed.\n  if (!base::ContainsKey(callbacks_, id))\n    return;\n\n  ReadFromResponseObject(*response, out);\n\n  bool cancel = false;\n  response->GetBoolean(\"cancel\", &cancel);\n  callbacks_[id].Run(cancel ? net::ERR_BLOCKED_BY_CLIENT : net::OK);\n}\n\ntemplate<typename T>\nvoid AtomNetworkDelegate::OnListenerResultInUI(\n    uint64_t id, T out, const base::DictionaryValue& response) {\n  std::unique_ptr<base::DictionaryValue> copy = response.CreateDeepCopy();\n  BrowserThread::PostTask(\n      BrowserThread::IO, FROM_HERE,\n      base::Bind(&AtomNetworkDelegate::OnListenerResultInIO<T>,\n                 base::Unretained(this),  id, out, base::Passed(&copy)));\n}\n\n}  \/\/ namespace atom\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n\n  This source file is part of the Avogadro project.\n\n  Copyright 2018 Kitware, Inc.\n\n  This source code is released under the New BSD License, (the \"License\").\n\n  Unless required by applicable law or agreed to in writing, software\n  distributed under the License is distributed on an \"AS IS\" BASIS,\n  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n  See the License for the specific language governing permissions and\n  limitations under the License.\n\n******************************************************************************\/\n\n#include <vtkAxis.h>\n#include <vtkChartXY.h>\n#include <vtkContextScene.h>\n#include <vtkContextView.h>\n#include <vtkFloatArray.h>\n#include <vtkPlot.h>\n#include <vtkRenderWindow.h>\n#include <vtkRenderWindowInteractor.h>\n#include <vtkRenderer.h>\n#include <vtkNew.h>\n#include <vtkTable.h>\n#include <vtkTextProperty.h>\n\n#include \"xrdvtkplot.h\"\n\nnamespace Avogadro {\nnamespace QtPlugins {\n\nvoid XrdVtkPlot::generatePlot(\n  const std::vector<std::pair<double, double>>& data)\n{\n  \/\/ Save the axes titles\n  const char* xTitle = \"2 Theta\";\n  const char* yTitle = \"Intensity\";\n\n  \/\/ Create a table and add two columns\n  vtkNew<vtkTable> table;\n\n  vtkNew<vtkFloatArray> arrX;\n  arrX->SetName(xTitle);\n  table->AddColumn(arrX);\n\n  vtkNew<vtkFloatArray> arrY;\n  arrY->SetName(yTitle);\n  table->AddColumn(arrY);\n\n  \/\/ Put the data in the table\n  table->SetNumberOfRows(data.size());\n  for (size_t i = 0; i < data.size(); ++i) {\n    table->SetValue(i, 0, data[i].first);\n    table->SetValue(i, 1, data[i].second);\n  }\n\n  \/\/ Set up the view\n  vtkNew<vtkContextView> view;\n  view->GetRenderer()->SetBackground(1.0, 1.0, 1.0);\n  view->GetRenderWindow()->SetSize(600, 600);\n  view->GetRenderWindow()->SetWindowName(\"Theoretical XRD Pattern\");\n\n  \/\/ Add the chart\n  vtkNew<vtkChartXY> chart;\n  view->GetScene()->AddItem(chart);\n\n  vtkAxis* bottomAxis = chart->GetAxis(vtkAxis::BOTTOM);\n  vtkAxis* leftAxis = chart->GetAxis(vtkAxis::LEFT);\n\n  \/\/ Set the axis titles\n  bottomAxis->SetTitle(xTitle);\n  leftAxis->SetTitle(yTitle);\n\n  \/\/ Increase their title font sizes\n  bottomAxis->GetTitleProperties()->SetFontSize(20);\n  leftAxis->GetTitleProperties()->SetFontSize(20);\n\n  \/\/ Increase the tick font sizes\n  bottomAxis->GetLabelProperties()->SetFontSize(20);\n  leftAxis->GetLabelProperties()->SetFontSize(20);\n\n  \/\/ Adjust the range on the x axis\n  bottomAxis->SetBehavior(vtkAxis::FIXED);\n  bottomAxis->SetRange(data.front().first, data.back().first);\n\n  \/\/ Add the data to the chart\n  vtkPlot* line = chart->AddPlot(vtkChart::LINE);\n  line->SetInputData(table, 0, 1);\n  line->SetColor(255, 0, 0, 255);\n  line->SetWidth(2.0);\n\n  \/\/ Start interactor\n  view->GetInteractor()->Initialize();\n  view->GetInteractor()->Start();\n}\n\n} \/\/ namespace QtPlugins\n} \/\/ namespace Avogadro\n<commit_msg>Use the Qt support classes for the chart<commit_after>\/******************************************************************************\n\n  This source file is part of the Avogadro project.\n\n  Copyright 2018 Kitware, Inc.\n\n  This source code is released under the New BSD License, (the \"License\").\n\n  Unless required by applicable law or agreed to in writing, software\n  distributed under the License is distributed on an \"AS IS\" BASIS,\n  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n  See the License for the specific language governing permissions and\n  limitations under the License.\n\n******************************************************************************\/\n\n#include <vtkAxis.h>\n#include <vtkChartXY.h>\n#include <vtkContextScene.h>\n#include <vtkContextView.h>\n#include <vtkFloatArray.h>\n#include <vtkGenericOpenGLRenderWindow.h>\n#include <vtkNew.h>\n#include <vtkPlot.h>\n#include <vtkRenderWindowInteractor.h>\n#include <vtkRenderer.h>\n#include <vtkTable.h>\n#include <vtkTextProperty.h>\n\n#include <QVTKOpenGLWidget.h>\n\n#include \"xrdvtkplot.h\"\n\nnamespace Avogadro {\nnamespace QtPlugins {\n\nvoid XrdVtkPlot::generatePlot(\n  const std::vector<std::pair<double, double>>& data)\n{\n  \/\/ Save the axes titles\n  const char* xTitle = \"2 Theta\";\n  const char* yTitle = \"Intensity\";\n\n  \/\/ Create a table and add two columns\n  vtkNew<vtkTable> table;\n\n  vtkNew<vtkFloatArray> arrX;\n  arrX->SetName(xTitle);\n  table->AddColumn(arrX);\n\n  vtkNew<vtkFloatArray> arrY;\n  arrY->SetName(yTitle);\n  table->AddColumn(arrY);\n\n  \/\/ Put the data in the table\n  table->SetNumberOfRows(data.size());\n  for (size_t i = 0; i < data.size(); ++i) {\n    table->SetValue(i, 0, data[i].first);\n    table->SetValue(i, 1, data[i].second);\n  }\n\n  \/\/ Set up the view\n  vtkNew<vtkGenericOpenGLRenderWindow> renderWindow;\n  QVTKOpenGLWidget* widget = new QVTKOpenGLWidget();\n  widget->SetRenderWindow(renderWindow);\n  \/\/ Hackish, but at least it won't leak\n  widget->setAttribute(Qt::WA_DeleteOnClose);\n  vtkNew<vtkContextView> view;\n  view->SetRenderWindow(renderWindow);\n  view->GetRenderer()->SetBackground(1.0, 1.0, 1.0);\n  view->GetRenderWindow()->SetSize(600, 600);\n  view->GetRenderWindow()->SetWindowName(\"Theoretical XRD Pattern\");\n\n  \/\/ Add the chart\n  vtkNew<vtkChartXY> chart;\n  view->GetScene()->AddItem(chart);\n\n  vtkAxis* bottomAxis = chart->GetAxis(vtkAxis::BOTTOM);\n  vtkAxis* leftAxis = chart->GetAxis(vtkAxis::LEFT);\n\n  \/\/ Set the axis titles\n  bottomAxis->SetTitle(xTitle);\n  leftAxis->SetTitle(yTitle);\n\n  \/\/ Increase their title font sizes\n  bottomAxis->GetTitleProperties()->SetFontSize(20);\n  leftAxis->GetTitleProperties()->SetFontSize(20);\n\n  \/\/ Increase the tick font sizes\n  bottomAxis->GetLabelProperties()->SetFontSize(20);\n  leftAxis->GetLabelProperties()->SetFontSize(20);\n\n  \/\/ Adjust the range on the x axis\n  bottomAxis->SetBehavior(vtkAxis::FIXED);\n  bottomAxis->SetRange(data.front().first, data.back().first);\n\n  \/\/ Add the data to the chart\n  vtkPlot* line = chart->AddPlot(vtkChart::LINE);\n  line->SetInputData(table, 0, 1);\n  line->SetColor(255, 0, 0, 255);\n  line->SetWidth(2.0);\n\n  \/\/ Start the widget, we probably want to improve this in future.\n  widget->show();\n}\n\n} \/\/ namespace QtPlugins\n} \/\/ namespace Avogadro\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * @file  cache-layer-registry.h\n * @brief contains definition of cache centralized registry\n *\n * @date   Sep 29, 2014\n * @author elenav\n *\/\n\n#ifndef CACHE_LAYER_REGISTRY_H_\n#define CACHE_LAYER_REGISTRY_H_\n\n#include <cstring>\n#include <list>\n#include <unordered_map>\n#include <memory>\n#include <boost\/function.hpp>\n#include <boost\/bind.hpp>\n\n#include <boost\/shared_ptr.hpp>\n\n#include \"dfs_cache\/cache-definitions.hpp\"\n#include \"dfs_cache\/common-include.hpp\"\n#include \"dfs_cache\/filesystem-descriptor-bound.hpp\"\n#include \"dfs_cache\/utilities.hpp\"\n\n\/** pointer hash utility *\/\ntemplate<typename Tval>\nstruct _PointerHash {\n    size_t operator()(const Tval* val) const {\n        static const size_t shift = (size_t)log2(1 + sizeof(Tval));\n        return (size_t)(val) >> shift;\n    }\n    size_t operator()(const Tval* val, size_t size) const {\n           static const size_t shift = (size_t)log2(1 + size);\n           return (size_t)(val) >> shift;\n       }\n};\n\n\/** Hash for dfsFile *\/\nnamespace std {\n    template <>\n        class hash<dfsFile> {\n        public :\n            size_t operator()(const dfsFile &file ) const\n            {\n                return _PointerHash<void>()(file->file, file->size);\n            }\n    };\n};\n\n\/**\n * @namespace impala\n *\/\nnamespace impala {\n\n\/** defines the map of maps of remote FileSystem descriptors.\n *  Key   - supported filesystem type\n *  Value - map of known filesystems of this type\n *\n *  For map of known filesystems of same type:\n *  Key   - FileSystem address\n *  Value - adaptor to FileSystem described by @address\n * *\/\ntypedef std::map<DFS_TYPE, std::map<std::string, boost::shared_ptr<FileSystemDescriptorBound> > > DFSConnections;\n\n\/**\n * Set of file handles that are stored for \"CREATE FROM SELECT\" scenario:\n * key   - local file handle (cache)\n * value - remote file handle (bound FileSystem)\n *\/\ntypedef std::unordered_map<dfsFile, dfsFile> CreateFromSelectFiles;\ntypedef std::unordered_map<dfsFile, dfsFile>::iterator itCreateFromSelect;\n\n\/**\n * Represent cache data registry.\n *\/\nclass CacheLayerRegistry{\nprivate:\n\t\/** Singleton instance. Instantiated in init(). *\/\n\tstatic boost::scoped_ptr<CacheLayerRegistry> instance_;\n\n\tstatic std::string fileSeparator;  \/**< platform-specific file separator *\/\n\n\tFileRegistry*       m_cache;       \/**< Registry of cache-managed files *\/\n\tDFSConnections      m_filesystems; \/**< Registry of file systems adaptors registered as a target for impala as a client *\/\n\n\tCreateFromSelectFiles m_createFromSelect;     \/**< local and remote file handles pairs, created in \"CREATE FROM SELECT\" scenario*\/\n    boost::mutex          m_createfromselect_mux; \/**< mutex to protect \"CREATE FROM SELECT\" file write scenario *\/\n\n\tstd::string m_localstorageRoot;   \/**< path to local file system storage root *\/\n\n\tboost::mutex m_cachemux;           \/**< mutex for file cache collection *\/\n\tboost::mutex m_connmux;            \/**< mutex for connections collection *\/\n\tboost::mutex m_adaptorsmux;        \/**< mutex for adapters collection *\/\n\n\tvolatile bool m_valid;             \/**< flag, indicates that registry is in the valid state *\/\n\n\tconst double m_available_capacity_ratio = 0.85; \/**< ratio for setting \"cache capacity\", percent from available\n\t \t \t \t \t \t \t \t \t \t \t \t     * root storage space *\/\n\n    dfsFileInfo* getFileInfo(const char* path, FileSystemDescriptor descriptor){\n    \tboost::shared_ptr<FileSystemDescriptorBound> fsAdaptor = (*CacheLayerRegistry::instance()->getFileSystemDescriptor(descriptor));\n\n    \tLOG (INFO) << \"Get file path for \\\"\" << path << \"\\\"\\n\";\n    \tif (fsAdaptor == nullptr) {\n    \t\tLOG (ERROR) << \"Unable to create new file from path \\\"\" << path <<\n    \t\t\t\t\"\\\". No filesystem adaptor configured for FileSystem \\\"\" << descriptor.dfs_type << \":\" <<\n    \t\t\t\tdescriptor.host << \"\\\"\" << \"\\n\";\n    \t\t\/\/ no namenode adaptor configured\n    \t\treturn NULL;\n    \t}\n\n    \traiiDfsConnection connection(fsAdaptor->getFreeConnection());\n    \tif (!connection.valid()) {\n    \t\tLOG (ERROR)<< \"Unable to create new file from path \\\"\" << path <<\n    \t\t\t\t\"\\\". No connection to dfs available \\\" on FileSystem \\\"\" <<\n    \t\t\t\tdescriptor.dfs_type << \":\" << descriptor.host << \"\\\"\" << \"\\n\";\n    \t\treturn NULL;\n    \t}\n\n    \t\/\/ ask remote part about file info:\n    \tdfsFileInfo* info = fsAdaptor->fileInfo(connection, path);\n    \treturn info;\n    }\n\n    void freeFileInfo(dfsFileInfo* info, int num){\n  \t   \/\/ free file info:\n  \t   FileSystemDescriptorBound::freeFileInfo(info, num);\n     }\n\n\tCacheLayerRegistry(int mem_limit_percent = 0, const std::string& root = \"\") {\n\t\tm_valid = false;\n        std::string _root = root;\n\n\t\tif(_root.empty())\n\t\t\t_root = constants::DEFAULT_CACHE_ROOT;\n\t\tif(!localstorage(_root)){\n\t\t\tLOG (ERROR) << \"Cache Layer is not initialized due to invalid cache location \\\"\" << root << \"\\\"\";\n\t\t}\n\n\t\tdouble percent = ( (mem_limit_percent > 0 ) && ( mem_limit_percent <= 85) ) ? mem_limit_percent \/ 100.0 : m_available_capacity_ratio;\n\n\t\t\/\/ Get the max 85% of available space on the path specified + space covered already by cache root content:\n\t\tuintmax_t covered = utilities::get_dir_busy_space(m_localstorageRoot);\n\t\tLOG (INFO) << \"Cache load : busy space : \\\"\" << std::to_string(covered) << \"\\\"\\n\";\n\t\tuintmax_t available = utilities::get_free_space_on_disk(m_localstorageRoot) * percent;\n\t\tLOG (INFO) << \"Cache load : available space : \\\"\" << std::to_string(available) << \"\\\"\\n\";\n\n\t\tavailable = covered + available;\n        if(available == 0)\n        \treturn;\n\n    \tLOG (INFO) << \"LRU percent from available space  = \" << std::to_string(percent) << \" on path \\\"\"\n    \t\t\t<< m_localstorageRoot << \"\\\".\" << \" Space limit, bytes = \" << std::to_string(available) << \".\\n\";\n\n\t\t\/\/ create the autoload LRU cache\n    \tmanaged_file::File::GetFileInfo getfileinfo = boost::bind(boost::mem_fn(&CacheLayerRegistry::getFileInfo), this, _1, _2);\n    \tmanaged_file::File::FreeFileInfo freefileinfo = boost::bind(boost::mem_fn(&CacheLayerRegistry::freeFileInfo), this, _1, _2);\n\t\tm_cache = new FileSystemLRUCache(available, m_localstorageRoot, getfileinfo, freefileinfo, true);\n\t\tm_valid = true;\n\t}\n\n\tCacheLayerRegistry(CacheLayerRegistry const& l);            \/\/ disable copy constructor\n\tCacheLayerRegistry& operator=(CacheLayerRegistry const& l); \/\/ disable assignment operator\n\n    \/** Setter for Local storage root file system path *\/\n    inline bool localstorage(std::string& localpath) {\n    \tconst std::string backup = localpath;\n\t\t\/\/ reworked to check for possible symlink as an input. We ned to resolve symlink here to get the real physical\n\t\t\/\/ location. We cannot rely on symlinks internally\n\t\tboost::filesystem::file_status status = boost::filesystem::symlink_status(localpath);\n        bool symlink = boost::filesystem::is_symlink(status);\n        if(symlink){\n        \tLOG (INFO) << \"The path specified \\\"\" << backup << \"\\\" is a symlink, going to resolve it to a physical path.\\n\";\n        \t\/\/ resolve symlink:\n        \tlocalpath = boost::filesystem::canonical(localpath).string();\n        \tif(localpath.empty()){\n        \t\tLOG (ERROR) << \"Symlink \\\"\" << backup << \"\\\" was not resolved to the physical path.\\n\";\n        \t\tlocalpath = backup;\n        \t\treturn false;\n        \t}\n        \tLOG (INFO) << \"Symlink \\\"\" << backup << \"\\\" is resolved to a physical path \\\"\" << localpath << \"\\\".\\n\";\n        }\n    \tm_localstorageRoot = localpath;\n\n        \/\/ add file separator if no specified:\n    \tbool trailing = impala::utilities::endsWith(m_localstorageRoot, fileSeparator);\n    \tif(!trailing){\n    \t\tm_localstorageRoot += fileSeparator;\n    \t}\n    \treturn true;\n    }\n\n    \/** reload the cache *\/\n    inline bool reload(){\n    \tif(!m_valid)\n    \t\treturn false;\n\n    \t\/\/ reload the cache:\n    \tif(m_cache->reload(m_localstorageRoot))\n    \t\treturn m_valid = true;\n    \treturn m_valid = false;\n    }\n\npublic:\n\n\t~CacheLayerRegistry() {\n\t\tdelete m_cache;\n\t\tLOG (INFO) << \"cache layer registry destructor\" << \"\\n\";\n\t}\n    static CacheLayerRegistry* instance() { return CacheLayerRegistry::instance_.get(); }\n\n\t\/** *************************** External configuration  ************************************************************\/\n\n    \/** Initialize registry. Call this before any Registry usage\n     *\n     * @param mem_limit_percent - limit of available memory on @a root, in percents, that can be\n     * potentially consumed by cache\n     *\n     * @param root              - local cache root - file system absolute path\n     *\n     * @return cache init status, false if cache init failed. True on success\n     *\/\n    static bool init(int mem_limit_percent = 0, const std::string& root = \"\");\n\n    \/**\n     * Return cache validity status.\n     *\n     * @return true if the cache is valid, false otherwise\n     *\/\n    inline bool valid() { return m_valid; }\n\n    \/** Getter for Local storage root file system path *\/\n    inline std::string localstorage() {return m_localstorageRoot;}\n\n    \/**\n\t * Setup namenode\n\t *\n\t * @param[In\/Out] fsDescriptor - file system connection details\n\t *\n\t * @return Operation status\n\t *\/\n\tstatus::StatusInternal setupFileSystem(FileSystemDescriptor & fsDescriptor);\n\n\n\t\/** ***************************  DFS related registry API  ***********************************************************\/\n\n\t\/**\n\t * Get connected FileSystem descriptor by its connection descriptor\n\t *\n\t * @param fsDescriptor - configured file system connection details\n\t *\n\t * @return filesystem adaptor\n\t *\/\n\tconst boost::shared_ptr<FileSystemDescriptorBound>* getFileSystemDescriptor(const FileSystemDescriptor & fsDescriptor);\n\n\t\/** *************************** Local file system registry API *****************************************************\/\n\n\t\/**\n\t * Get the File object by its relative path within the @a descriptor of related file system.\n\t * To be called when file path should be resolved from @a path and @a descriptor (when query arrives)\n\t *\n\t * @param [in]  path       - file fqp\n\t * @param [in]  descriptor - file system descriptor\n\t * @param [out] file       - managed file instance (if any)\n\t *\/\n\tbool findFile(const char* path, const FileSystemDescriptor& descriptor, managed_file::File*& file);\n\n\t\/**\n\t * Get the file object by its fully qualified path. Should be called for internal cache usage on\n\t * existing local files\n\t *\n\t * @param [in]  path       - file fqp\n\t * @param [out] file       - managed file instance (if any)\n\t *\n\t *\/\n\tbool findFile(const char* path, managed_file::File*& file);\n\n\t\/**\n\t * Insert the managed file into the set.\n\t * The key is file fully qualified local path\n\t *\n\t * @param [in]     path         - file fqp\n\t * @param [in]     descriptor   - file system descriptor\n\t * @param [in\/out] file         - managed file\n\t * @param [in]     creationFlag - file creation option\n\t *\n\t * @return true is the file was inserted to the cache, false otherwise\n\t *\/\n\tbool addFile(const char* path, const FileSystemDescriptor& descriptor, managed_file::File*& file,\n\t\t\tmanaged_file::NatureFlag creationFlag);\n\n\t\/**\n\t * Delete file from cache and from file system\n\t * @param descriptor  - file system descriptor\n\t * @param path \t\t  - relative path to a file to remove\n\t * @param physically  - flag, indicates whether physical file removal is required\n\t *\n\t * @return status of operation, true means that file was removed according scenario.\n\t * false - operation was not success due to reasons\n\t *\/\n\tbool deleteFile(const FileSystemDescriptor &descriptor, const char* path, bool physically = true);\n\n\t\/**\n\t * Delete path from cache and from file system\n\t * @param descriptor  - file system descriptor\n\t * @param path \t\t  - relative path to remove along with a possible content\n\t *\n\t * @return status of operation, true means that path was removed according scenario.\n\t * false - operation was not success due to reasons\n\t *\/\n\tbool deletePath(const FileSystemDescriptor &descriptor, const char* path);\n\n\t\/**\n\t * start new \"CREATE FROM SELECT\" scenario.\n\t *\n\t * @param local  - handle to local file\n\t * @param remote - handle to remote file\n\t *\n\t * @return operation status, true on success (scenario is registered), false otehrwise\n\t * (do not use the scenario)\n\t *\/\n\tbool registerCreateFromSelectScenario(const dfsFile& local, const dfsFile& remote);\n\n\t\/**\n\t * Completes \"CREATE FROM SELECT\" scenario.\n\t *\n\t * @param local - handle to local file\n\t *\n\t * @return operation status, true on success (scenario is unregistered)\n\t *\/\n\tbool unregisterCreateFromSelectScenario(const dfsFile& local);\n\n\t\/**\n\t * Retrieve \"CREATE FROM SELECT\" scenario\n\t *\n\t * @param [in] local   - handle to local file\n\t * @param [out] exists - flag, indicates that the requested scenario exists\n\t *\n\t * @return handle to remote file participating in scenario, NULL is scenario is not exist\n\t *\/\n\tdfsFile getCreateFromSelectScenario(const dfsFile& local, bool& exists);\n\n\tstruct StrExpComp\n\t{\n\t   bool operator()(const std::string & str, const managed_file::File& file) const\n\t   {\n\t\t   return str.compare(file.fqp()) == 0;\n\t   }\n\n\t   bool operator()(const managed_file::File& file, const std::string & str) const\n\t   {\n\t\t   return file.fqp().compare(str) == 0;\n\t   }\n\t};\n};\n\n}\n\n#endif \/* CACHE_LAYER_REGISTRY_H_ *\/\n<commit_msg>utilize boost filesystem path canonization to support the resolution of symlink if one is specified for impalatogo cache location path.<commit_after>\/*\n * @file  cache-layer-registry.h\n * @brief contains definition of cache centralized registry\n *\n * @date   Sep 29, 2014\n * @author elenav\n *\/\n\n#ifndef CACHE_LAYER_REGISTRY_H_\n#define CACHE_LAYER_REGISTRY_H_\n\n#include <cstring>\n#include <list>\n#include <unordered_map>\n#include <memory>\n#include <boost\/function.hpp>\n#include <boost\/bind.hpp>\n\n#include <boost\/shared_ptr.hpp>\n\n#include \"dfs_cache\/cache-definitions.hpp\"\n#include \"dfs_cache\/common-include.hpp\"\n#include \"dfs_cache\/filesystem-descriptor-bound.hpp\"\n#include \"dfs_cache\/utilities.hpp\"\n\n\/** pointer hash utility *\/\ntemplate<typename Tval>\nstruct _PointerHash {\n    size_t operator()(const Tval* val) const {\n        static const size_t shift = (size_t)log2(1 + sizeof(Tval));\n        return (size_t)(val) >> shift;\n    }\n    size_t operator()(const Tval* val, size_t size) const {\n           static const size_t shift = (size_t)log2(1 + size);\n           return (size_t)(val) >> shift;\n       }\n};\n\n\/** Hash for dfsFile *\/\nnamespace std {\n    template <>\n        class hash<dfsFile> {\n        public :\n            size_t operator()(const dfsFile &file ) const\n            {\n                return _PointerHash<void>()(file->file, file->size);\n            }\n    };\n};\n\n\/**\n * @namespace impala\n *\/\nnamespace impala {\n\n\/** defines the map of maps of remote FileSystem descriptors.\n *  Key   - supported filesystem type\n *  Value - map of known filesystems of this type\n *\n *  For map of known filesystems of same type:\n *  Key   - FileSystem address\n *  Value - adaptor to FileSystem described by @address\n * *\/\ntypedef std::map<DFS_TYPE, std::map<std::string, boost::shared_ptr<FileSystemDescriptorBound> > > DFSConnections;\n\n\/**\n * Set of file handles that are stored for \"CREATE FROM SELECT\" scenario:\n * key   - local file handle (cache)\n * value - remote file handle (bound FileSystem)\n *\/\ntypedef std::unordered_map<dfsFile, dfsFile> CreateFromSelectFiles;\ntypedef std::unordered_map<dfsFile, dfsFile>::iterator itCreateFromSelect;\n\n\/**\n * Represent cache data registry.\n *\/\nclass CacheLayerRegistry{\nprivate:\n\t\/** Singleton instance. Instantiated in init(). *\/\n\tstatic boost::scoped_ptr<CacheLayerRegistry> instance_;\n\n\tstatic std::string fileSeparator;  \/**< platform-specific file separator *\/\n\n\tFileRegistry*       m_cache;       \/**< Registry of cache-managed files *\/\n\tDFSConnections      m_filesystems; \/**< Registry of file systems adaptors registered as a target for impala as a client *\/\n\n\tCreateFromSelectFiles m_createFromSelect;     \/**< local and remote file handles pairs, created in \"CREATE FROM SELECT\" scenario*\/\n    boost::mutex          m_createfromselect_mux; \/**< mutex to protect \"CREATE FROM SELECT\" file write scenario *\/\n\n\tstd::string m_localstorageRoot;   \/**< path to local file system storage root *\/\n\n\tboost::mutex m_cachemux;           \/**< mutex for file cache collection *\/\n\tboost::mutex m_connmux;            \/**< mutex for connections collection *\/\n\tboost::mutex m_adaptorsmux;        \/**< mutex for adapters collection *\/\n\n\tvolatile bool m_valid;             \/**< flag, indicates that registry is in the valid state *\/\n\n\tconst double m_available_capacity_ratio = 0.85; \/**< ratio for setting \"cache capacity\", percent from available\n\t \t \t \t \t \t \t \t \t \t \t \t     * root storage space *\/\n\n    dfsFileInfo* getFileInfo(const char* path, FileSystemDescriptor descriptor){\n    \tboost::shared_ptr<FileSystemDescriptorBound> fsAdaptor = (*CacheLayerRegistry::instance()->getFileSystemDescriptor(descriptor));\n\n    \tLOG (INFO) << \"Get file path for \\\"\" << path << \"\\\"\\n\";\n    \tif (fsAdaptor == nullptr) {\n    \t\tLOG (ERROR) << \"Unable to create new file from path \\\"\" << path <<\n    \t\t\t\t\"\\\". No filesystem adaptor configured for FileSystem \\\"\" << descriptor.dfs_type << \":\" <<\n    \t\t\t\tdescriptor.host << \"\\\"\" << \"\\n\";\n    \t\t\/\/ no namenode adaptor configured\n    \t\treturn NULL;\n    \t}\n\n    \traiiDfsConnection connection(fsAdaptor->getFreeConnection());\n    \tif (!connection.valid()) {\n    \t\tLOG (ERROR)<< \"Unable to create new file from path \\\"\" << path <<\n    \t\t\t\t\"\\\". No connection to dfs available \\\" on FileSystem \\\"\" <<\n    \t\t\t\tdescriptor.dfs_type << \":\" << descriptor.host << \"\\\"\" << \"\\n\";\n    \t\treturn NULL;\n    \t}\n\n    \t\/\/ ask remote part about file info:\n    \tdfsFileInfo* info = fsAdaptor->fileInfo(connection, path);\n    \treturn info;\n    }\n\n    void freeFileInfo(dfsFileInfo* info, int num){\n  \t   \/\/ free file info:\n  \t   FileSystemDescriptorBound::freeFileInfo(info, num);\n     }\n\n\tCacheLayerRegistry(int mem_limit_percent = 0, const std::string& root = \"\") {\n\t\tm_valid = false;\n        std::string _root = root;\n\n\t\tif(_root.empty())\n\t\t\t_root = constants::DEFAULT_CACHE_ROOT;\n\t\tif(!localstorage(_root)){\n\t\t\tLOG (ERROR) << \"Cache Layer is not initialized due to invalid cache location \\\"\" << root << \"\\\"\";\n\t\t}\n\n\t\tdouble percent = ( (mem_limit_percent > 0 ) && ( mem_limit_percent <= 85) ) ? mem_limit_percent \/ 100.0 : m_available_capacity_ratio;\n\n\t\t\/\/ Get the max 85% of available space on the path specified + space covered already by cache root content:\n\t\tuintmax_t covered = utilities::get_dir_busy_space(m_localstorageRoot);\n\t\tLOG (INFO) << \"Cache load : busy space : \\\"\" << std::to_string(covered) << \"\\\"\\n\";\n\t\tuintmax_t available = utilities::get_free_space_on_disk(m_localstorageRoot) * percent;\n\t\tLOG (INFO) << \"Cache load : available space : \\\"\" << std::to_string(available) << \"\\\"\\n\";\n\n\t\tavailable = covered + available;\n        if(available == 0)\n        \treturn;\n\n    \tLOG (INFO) << \"LRU percent from available space  = \" << std::to_string(percent) << \" on path \\\"\"\n    \t\t\t<< m_localstorageRoot << \"\\\".\" << \" Space limit, bytes = \" << std::to_string(available) << \".\\n\";\n\n\t\t\/\/ create the autoload LRU cache\n    \tmanaged_file::File::GetFileInfo getfileinfo = boost::bind(boost::mem_fn(&CacheLayerRegistry::getFileInfo), this, _1, _2);\n    \tmanaged_file::File::FreeFileInfo freefileinfo = boost::bind(boost::mem_fn(&CacheLayerRegistry::freeFileInfo), this, _1, _2);\n\t\tm_cache = new FileSystemLRUCache(available, m_localstorageRoot, getfileinfo, freefileinfo, true);\n\t\tm_valid = true;\n\t}\n\n\tCacheLayerRegistry(CacheLayerRegistry const& l);            \/\/ disable copy constructor\n\tCacheLayerRegistry& operator=(CacheLayerRegistry const& l); \/\/ disable assignment operator\n\n    \/** Setter for Local storage root file system path *\/\n    inline bool localstorage(std::string& localpath) {\n    \tconst std::string alias = localpath;\n\t\t\/\/ reworked to check for possible symlink as an input. We ned to resolve symlink here to get the real physical\n    \t\/\/ location. We cannot rely on symlinks internally\n    \tLOG (INFO) << \"Original path specified : \\\"\" << alias << \"\\\", run link resolve to a physical path.\\n\";\n    \t\/\/ resolve symlink:\n    \tlocalpath = boost::filesystem::canonical(alias).string();\n    \tif(localpath.empty()){\n    \t\tLOG (ERROR) << \"Alias \\\"\" << alias << \"\\\" was not resolved to any physical path. \\n\";\n    \t\tlocalpath = alias;\n    \t\treturn false;\n    \t}\n    \t\/\/ whether input path is specified with a trailing slash or not,\n    \t\/\/ the trailing slash would be removed as a side effect of canonize operation. This will be handled below.\n    \tLOG (INFO) << \"Alias \\\"\" << alias << \"\\\" is resolved to a physical path \\\"\" << localpath << \"\\\".\\n\";\n\n    \tm_localstorageRoot = localpath;\n\n        \/\/ add file separator if no specified:\n    \tbool trailing = impala::utilities::endsWith(m_localstorageRoot, fileSeparator);\n    \tif(!trailing){\n    \t\tm_localstorageRoot += fileSeparator;\n    \t}\n    \treturn true;\n    }\n\n    \/** reload the cache *\/\n    inline bool reload(){\n    \tif(!m_valid)\n    \t\treturn false;\n\n    \t\/\/ reload the cache:\n    \tif(m_cache->reload(m_localstorageRoot))\n    \t\treturn m_valid = true;\n    \treturn m_valid = false;\n    }\n\npublic:\n\n\t~CacheLayerRegistry() {\n\t\tdelete m_cache;\n\t\tLOG (INFO) << \"cache layer registry destructor\" << \"\\n\";\n\t}\n    static CacheLayerRegistry* instance() { return CacheLayerRegistry::instance_.get(); }\n\n\t\/** *************************** External configuration  ************************************************************\/\n\n    \/** Initialize registry. Call this before any Registry usage\n     *\n     * @param mem_limit_percent - limit of available memory on @a root, in percents, that can be\n     * potentially consumed by cache\n     *\n     * @param root              - local cache root - file system absolute path\n     *\n     * @return cache init status, false if cache init failed. True on success\n     *\/\n    static bool init(int mem_limit_percent = 0, const std::string& root = \"\");\n\n    \/**\n     * Return cache validity status.\n     *\n     * @return true if the cache is valid, false otherwise\n     *\/\n    inline bool valid() { return m_valid; }\n\n    \/** Getter for Local storage root file system path *\/\n    inline std::string localstorage() {return m_localstorageRoot;}\n\n    \/**\n\t * Setup namenode\n\t *\n\t * @param[In\/Out] fsDescriptor - file system connection details\n\t *\n\t * @return Operation status\n\t *\/\n\tstatus::StatusInternal setupFileSystem(FileSystemDescriptor & fsDescriptor);\n\n\n\t\/** ***************************  DFS related registry API  ***********************************************************\/\n\n\t\/**\n\t * Get connected FileSystem descriptor by its connection descriptor\n\t *\n\t * @param fsDescriptor - configured file system connection details\n\t *\n\t * @return filesystem adaptor\n\t *\/\n\tconst boost::shared_ptr<FileSystemDescriptorBound>* getFileSystemDescriptor(const FileSystemDescriptor & fsDescriptor);\n\n\t\/** *************************** Local file system registry API *****************************************************\/\n\n\t\/**\n\t * Get the File object by its relative path within the @a descriptor of related file system.\n\t * To be called when file path should be resolved from @a path and @a descriptor (when query arrives)\n\t *\n\t * @param [in]  path       - file fqp\n\t * @param [in]  descriptor - file system descriptor\n\t * @param [out] file       - managed file instance (if any)\n\t *\/\n\tbool findFile(const char* path, const FileSystemDescriptor& descriptor, managed_file::File*& file);\n\n\t\/**\n\t * Get the file object by its fully qualified path. Should be called for internal cache usage on\n\t * existing local files\n\t *\n\t * @param [in]  path       - file fqp\n\t * @param [out] file       - managed file instance (if any)\n\t *\n\t *\/\n\tbool findFile(const char* path, managed_file::File*& file);\n\n\t\/**\n\t * Insert the managed file into the set.\n\t * The key is file fully qualified local path\n\t *\n\t * @param [in]     path         - file fqp\n\t * @param [in]     descriptor   - file system descriptor\n\t * @param [in\/out] file         - managed file\n\t * @param [in]     creationFlag - file creation option\n\t *\n\t * @return true is the file was inserted to the cache, false otherwise\n\t *\/\n\tbool addFile(const char* path, const FileSystemDescriptor& descriptor, managed_file::File*& file,\n\t\t\tmanaged_file::NatureFlag creationFlag);\n\n\t\/**\n\t * Delete file from cache and from file system\n\t * @param descriptor  - file system descriptor\n\t * @param path \t\t  - relative path to a file to remove\n\t * @param physically  - flag, indicates whether physical file removal is required\n\t *\n\t * @return status of operation, true means that file was removed according scenario.\n\t * false - operation was not success due to reasons\n\t *\/\n\tbool deleteFile(const FileSystemDescriptor &descriptor, const char* path, bool physically = true);\n\n\t\/**\n\t * Delete path from cache and from file system\n\t * @param descriptor  - file system descriptor\n\t * @param path \t\t  - relative path to remove along with a possible content\n\t *\n\t * @return status of operation, true means that path was removed according scenario.\n\t * false - operation was not success due to reasons\n\t *\/\n\tbool deletePath(const FileSystemDescriptor &descriptor, const char* path);\n\n\t\/**\n\t * start new \"CREATE FROM SELECT\" scenario.\n\t *\n\t * @param local  - handle to local file\n\t * @param remote - handle to remote file\n\t *\n\t * @return operation status, true on success (scenario is registered), false otehrwise\n\t * (do not use the scenario)\n\t *\/\n\tbool registerCreateFromSelectScenario(const dfsFile& local, const dfsFile& remote);\n\n\t\/**\n\t * Completes \"CREATE FROM SELECT\" scenario.\n\t *\n\t * @param local - handle to local file\n\t *\n\t * @return operation status, true on success (scenario is unregistered)\n\t *\/\n\tbool unregisterCreateFromSelectScenario(const dfsFile& local);\n\n\t\/**\n\t * Retrieve \"CREATE FROM SELECT\" scenario\n\t *\n\t * @param [in] local   - handle to local file\n\t * @param [out] exists - flag, indicates that the requested scenario exists\n\t *\n\t * @return handle to remote file participating in scenario, NULL is scenario is not exist\n\t *\/\n\tdfsFile getCreateFromSelectScenario(const dfsFile& local, bool& exists);\n\n\tstruct StrExpComp\n\t{\n\t   bool operator()(const std::string & str, const managed_file::File& file) const\n\t   {\n\t\t   return str.compare(file.fqp()) == 0;\n\t   }\n\n\t   bool operator()(const managed_file::File& file, const std::string & str) const\n\t   {\n\t\t   return file.fqp().compare(str) == 0;\n\t   }\n\t};\n};\n\n}\n\n#endif \/* CACHE_LAYER_REGISTRY_H_ *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/ @file\n\/\/\/ @author  Boris Mikic\n\/\/\/ @version 3.03\n\/\/\/ \n\/\/\/ @section LICENSE\n\/\/\/ \n\/\/\/ This program is free software; you can redistribute it and\/or modify it under\n\/\/\/ the terms of the BSD license: http:\/\/www.opensource.org\/licenses\/bsd-license.php\n\n#ifdef _XAUDIO2\n#include <hltypes\/hlog.h>\n#include <hltypes\/hltypesUtil.h>\n#include <hltypes\/hplatform.h>\n#include <hltypes\/hstring.h>\n\n#include \"Buffer.h\"\n#include \"XAudio2_Player.h\"\n#include \"XAudio2_AudioManager.h\"\n#include \"Sound.h\"\n#include \"xal.h\"\n\n#define AUDIO_DEVICE ((XAudio2_AudioManager*)xal::mgr)->xa2Device\n\nusing namespace Microsoft::WRL;\n\nnamespace xal\n{\n\tXAudio2_Player::XAudio2_Player(Sound* sound) : Player(sound), playing(false), active(false),\n\t\tstillPlaying(false), sourceVoice(NULL), buffersSubmitted(0)\n\t{\n\t\tthis->callbackHandler = new XAudio2_Player::CallbackHandler(&this->active);\n\t\tmemset(&this->xa2Buffer, 0, sizeof(XAUDIO2_BUFFER));\n\t\tfor_iter (i, 0, STREAM_BUFFER_COUNT)\n\t\t{\n\t\t\tthis->streamBuffers[i] = NULL;\n\t\t}\n\t\tif (this->sound->isStreamed())\n\t\t{\n\t\t\tfor_iter (i, 0, STREAM_BUFFER_COUNT)\n\t\t\t{\n\t\t\t\tthis->streamBuffers[i] = new unsigned char[STREAM_BUFFER_SIZE];\n\t\t\t}\n\t\t}\n\t}\n\n\tXAudio2_Player::~XAudio2_Player()\n\t{\n\t\tif (this->sourceVoice != NULL)\n\t\t{\n\t\t\tthis->sourceVoice->DestroyVoice();\n\t\t\tthis->sourceVoice = NULL;\n\t\t}\n\t\t_HL_TRY_DELETE(this->callbackHandler);\n\t\tfor_iter (i, 0, STREAM_BUFFER_COUNT)\n\t\t{\n\t\t\t_HL_TRY_DELETE_ARRAY(this->streamBuffers[i]);\n\t\t}\n\t}\n\n\tvoid XAudio2_Player::_update(float k)\n\t{\n\t\tPlayer::_update(k);\n\t\tif (!this->stillPlaying && this->playing)\n\t\t{\n\t\t\tthis->_stop();\n\t\t}\n\t}\n\n\tbool XAudio2_Player::_systemIsPlaying()\n\t{\n\t\treturn this->playing;\n\t}\n\n\tunsigned int XAudio2_Player::_systemGetBufferPosition()\n\t{\n\t\tthis->sourceVoice->GetState(&this->xa2State, 0);\n\t\treturn (unsigned int)(this->xa2State.SamplesPlayed * this->buffer->getChannels() * this->buffer->getBitsPerSample() * 0.125f);\n\t}\n\n\tbool XAudio2_Player::_systemPreparePlay()\n\t{\n\t\tif (this->sourceVoice != NULL)\n\t\t{\n\t\t\treturn true;\n\t\t}\n\t\tWAVEFORMATEX wavefmt;\n\t\twavefmt.cbSize = 0;\n\t\twavefmt.nChannels = this->buffer->getChannels();\n\t\twavefmt.nSamplesPerSec = this->buffer->getSamplingRate();\n\t\twavefmt.wBitsPerSample = this->buffer->getBitsPerSample();\n\t\twavefmt.wFormatTag = WAVE_FORMAT_PCM;\n\t\twavefmt.nBlockAlign = wavefmt.nChannels * wavefmt.wBitsPerSample \/ 8; \/\/ standard calculation of WAV PCM data\n\t\twavefmt.nAvgBytesPerSec = wavefmt.nSamplesPerSec * wavefmt.nBlockAlign; \/\/ standard calculation of WAV PCM data\n\t\tHRESULT result = AUDIO_DEVICE->CreateSourceVoice(&this->sourceVoice, &wavefmt, 0, XAUDIO2_DEFAULT_FREQ_RATIO,\n\t\t\tthis->callbackHandler, NULL, NULL);\n\t\tif (FAILED(result))\n\t\t{\n\t\t\tthis->sourceVoice = NULL;\n\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\n\tvoid XAudio2_Player::_systemPrepareBuffer()\n\t{\n\t\tif (!this->sound->isStreamed())\n\t\t{\n\t\t\tif (!this->paused)\n\t\t\t{\n\t\t\t\tthis->_submitBuffer(this->buffer->getStream(), this->buffer->getSize());\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\tint count = STREAM_BUFFER_COUNT;\n\t\tif (this->paused)\n\t\t{\n\t\t\tthis->sourceVoice->GetState(&this->xa2State, XAUDIO2_VOICE_NOSAMPLESPLAYED);\n\t\t\tthis->buffersSubmitted = this->xa2State.BuffersQueued;\n\t\t\tcount -= this->buffersSubmitted;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthis->buffersSubmitted = 0;\n\t\t}\n\t\tif (count > 0)\n\t\t{\n\t\t\tcount = this->_fillStreamBuffers(count);\n\t\t\tif (count > 0)\n\t\t\t{\n\t\t\t\tthis->_submitStreamBuffers(count);\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid XAudio2_Player::_systemUpdateGain()\n\t{\n\t\tif (this->sourceVoice != NULL)\n\t\t{\n\t\t\tthis->sourceVoice->SetVolume(this->_calcGain());\n\t\t}\n\t}\n\n\tvoid XAudio2_Player::_systemUpdatePitch()\n\t{\n\t\tif (this->sourceVoice != NULL)\n\t\t{\n\t\t\tthis->sourceVoice->SetFrequencyRatio(this->pitch);\n\t\t}\n\t}\n\n\tvoid XAudio2_Player::_systemPlay()\n\t{\n\t\tHRESULT result = this->sourceVoice->Start();\n\t\tif (!FAILED(result))\n\t\t{\n\t\t\tthis->playing = true;\n\t\t\tthis->stillPlaying = true;\n\t\t}\n\t\telse\n\t\t{\n\t\t\thlog::warn(xal::logTag, \"Could not start: \" + this->sound->getFilename());\n\t\t}\n\t}\n\n\tint XAudio2_Player::_systemStop()\n\t{\n\t\tif (this->playing)\n\t\t{\n\t\t\tHRESULT result = this->sourceVoice->Stop();\n\t\t\tif (!FAILED(result))\n\t\t\t{\n\t\t\t\tif (this->paused)\r\n\t\t\t\t{\r\n\t\t\t\t\tif (this->sound->isStreamed())\n\t\t\t\t\t{\n\t\t\t\t\t\tthis->sourceVoice->GetState(&this->xa2State, XAUDIO2_VOICE_NOSAMPLESPLAYED);\n\t\t\t\t\t\tint processed = this->buffersSubmitted - this->xa2State.BuffersQueued;\n\t\t\t\t\t\tthis->buffersSubmitted -= processed;\n\t\t\t\t\t\tresult = processed * STREAM_BUFFER_SIZE;\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\tthis->sourceVoice->FlushSourceBuffers();\n\t\t\t\t\tif (this->sound->isStreamed())\n\t\t\t\t\t{\n\t\t\t\t\t\tthis->buffersSubmitted = 0;\r\n\t\t\t\t\t\tthis->buffer->rewind();\n\t\t\t\t\t}\n\t\t\t\t}\r\n\t\t\t\tthis->playing = false;\n\t\t\t\tthis->stillPlaying = false;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\thlog::warn(xal::logTag, \"Could not stop: \" + this->sound->getFilename());\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\t}\n\n\tint XAudio2_Player::_systemUpdateStream()\n\t{\n\t\tthis->stillPlaying = this->active;\n\t\tthis->sourceVoice->GetState(&this->xa2State, XAUDIO2_VOICE_NOSAMPLESPLAYED);\n\t\tint processed = this->buffersSubmitted - this->xa2State.BuffersQueued;\n\t\tif (processed == 0)\n\t\t{\n\t\t\tthis->stillPlaying = true;\n\t\t\treturn 0;\n\t\t}\n\t\tthis->buffersSubmitted -= processed;\n\t\tint count = this->_fillStreamBuffers(processed);\n\t\tif (count > 0)\n\t\t{\n\t\t\tthis->_submitStreamBuffers(count);\n\t\t\tthis->stillPlaying = true; \/\/ in case underrun happened, sound is regarded as stopped by XAudio2 so let's just bitch-slap it and get this over with\n\t\t}\n\t\tthis->sourceVoice->GetState(&this->xa2State, XAUDIO2_VOICE_NOSAMPLESPLAYED);\n\t\tif (this->xa2State.BuffersQueued == 0)\n\t\t{\n\t\t\tthis->_stop();\n\t\t}\n\t\treturn (processed * STREAM_BUFFER_SIZE);\n\t}\n\n\tvoid XAudio2_Player::_submitBuffer(unsigned char* stream, int size)\n\t{\n\t\tthis->xa2Buffer.AudioBytes = size;\n\t\tthis->xa2Buffer.pAudioData = stream;\n\t\tthis->xa2Buffer.LoopCount = (this->looping ? XAUDIO2_LOOP_INFINITE : 0);\n\t\tHRESULT result = this->sourceVoice->SubmitSourceBuffer(&this->xa2Buffer);\n\t\tif (FAILED(result))\n\t\t{\n\t\t\thlog::warn(xal::logTag, \"Could not submit source buffer!\");\n\t\t}\n\t}\n\n\tint XAudio2_Player::_fillStreamBuffers(int count)\n\t{\n\t\tint size = this->buffer->load(this->looping, count * STREAM_BUFFER_SIZE);\n\t\tint filled = (size + STREAM_BUFFER_SIZE - 1) \/ STREAM_BUFFER_SIZE;\n\t\tunsigned char* stream = this->buffer->getStream();\n\t\tint currentSize;\n\t\tfor_iter (i, 0, filled)\n\t\t{\n\t\t\tcurrentSize = hmin(size, STREAM_BUFFER_SIZE);\n\t\t\tmemcpy(this->streamBuffers[this->bufferIndex], &stream[i * STREAM_BUFFER_SIZE], currentSize);\n\t\t\tif (currentSize < STREAM_BUFFER_SIZE)\n\t\t\t{\n\t\t\t\tmemset(&this->streamBuffers[this->bufferIndex][currentSize], 0, STREAM_BUFFER_SIZE - currentSize);\n\t\t\t}\n\t\t\tthis->bufferIndex = (this->bufferIndex + 1) % STREAM_BUFFER_COUNT;\n\t\t\tsize -= STREAM_BUFFER_SIZE;\n\t\t}\n\t\treturn filled;\n\t}\n\n\tvoid XAudio2_Player::_submitStreamBuffers(int count)\n\t{\n\t\tHRESULT result;\n\t\tthis->xa2Buffer.AudioBytes = STREAM_BUFFER_SIZE;\n\t\tthis->xa2Buffer.LoopCount = 0;\n\t\tint index = (this->bufferIndex + STREAM_BUFFER_COUNT - count) % STREAM_BUFFER_COUNT;\n\t\tfor_iter (i, 0, count)\n\t\t{\n\t\t\tthis->xa2Buffer.pAudioData = this->streamBuffers[index];\n\t\t\tresult = this->sourceVoice->SubmitSourceBuffer(&this->xa2Buffer);\n\t\t\tif (FAILED(result))\n\t\t\t{\n\t\t\t\thlog::warn(xal::logTag, \"Could not submit streamed source buffer!\");\n\t\t\t}\n\t\t\tindex = (index + 1) % STREAM_BUFFER_COUNT;\n\t\t}\n\t\tthis->buffersSubmitted += count;\n\t}\n\n}\n#endif\n<commit_msg>- small update<commit_after>\/\/\/ @file\n\/\/\/ @author  Boris Mikic\n\/\/\/ @version 3.03\n\/\/\/ \n\/\/\/ @section LICENSE\n\/\/\/ \n\/\/\/ This program is free software; you can redistribute it and\/or modify it under\n\/\/\/ the terms of the BSD license: http:\/\/www.opensource.org\/licenses\/bsd-license.php\n\n#ifdef _XAUDIO2\n#include <hltypes\/hlog.h>\n#include <hltypes\/hltypesUtil.h>\n#include <hltypes\/hplatform.h>\n#include <hltypes\/hstring.h>\n\n#include \"Buffer.h\"\n#include \"XAudio2_Player.h\"\n#include \"XAudio2_AudioManager.h\"\n#include \"Sound.h\"\n#include \"xal.h\"\n\n#define AUDIO_DEVICE ((XAudio2_AudioManager*)xal::mgr)->xa2Device\n\nusing namespace Microsoft::WRL;\n\nnamespace xal\n{\n\tXAudio2_Player::XAudio2_Player(Sound* sound) : Player(sound), playing(false), active(false),\n\t\tstillPlaying(false), sourceVoice(NULL), buffersSubmitted(0)\n\t{\n\t\tthis->callbackHandler = new XAudio2_Player::CallbackHandler(&this->active);\n\t\tmemset(&this->xa2Buffer, 0, sizeof(XAUDIO2_BUFFER));\n\t\tfor_iter (i, 0, STREAM_BUFFER_COUNT)\n\t\t{\n\t\t\tthis->streamBuffers[i] = NULL;\n\t\t}\n\t\tif (this->sound->isStreamed())\n\t\t{\n\t\t\tfor_iter (i, 0, STREAM_BUFFER_COUNT)\n\t\t\t{\n\t\t\t\tthis->streamBuffers[i] = new unsigned char[STREAM_BUFFER_SIZE];\n\t\t\t}\n\t\t}\n\t}\n\n\tXAudio2_Player::~XAudio2_Player()\n\t{\n\t\tif (this->sourceVoice != NULL)\n\t\t{\n\t\t\tthis->sourceVoice->DestroyVoice();\n\t\t\tthis->sourceVoice = NULL;\n\t\t}\n\t\t_HL_TRY_DELETE(this->callbackHandler);\n\t\tfor_iter (i, 0, STREAM_BUFFER_COUNT)\n\t\t{\n\t\t\t_HL_TRY_DELETE_ARRAY(this->streamBuffers[i]);\n\t\t}\n\t}\n\n\tvoid XAudio2_Player::_update(float k)\n\t{\n\t\tPlayer::_update(k);\n\t\tif (!this->stillPlaying && this->playing)\n\t\t{\n\t\t\tthis->_stop();\n\t\t}\n\t}\n\n\tbool XAudio2_Player::_systemIsPlaying()\n\t{\n\t\treturn this->playing;\n\t}\n\n\tunsigned int XAudio2_Player::_systemGetBufferPosition()\n\t{\n\t\tthis->sourceVoice->GetState(&this->xa2State, 0);\n\t\treturn (unsigned int)(this->xa2State.SamplesPlayed * this->buffer->getChannels() * this->buffer->getBitsPerSample() * 0.125f);\n\t}\n\n\tbool XAudio2_Player::_systemPreparePlay()\n\t{\n\t\tif (this->sourceVoice != NULL)\n\t\t{\n\t\t\treturn true;\n\t\t}\n\t\tWAVEFORMATEX wavefmt;\n\t\twavefmt.cbSize = 0;\n\t\twavefmt.nChannels = this->buffer->getChannels();\n\t\twavefmt.nSamplesPerSec = this->buffer->getSamplingRate();\n\t\twavefmt.wBitsPerSample = this->buffer->getBitsPerSample();\n\t\twavefmt.wFormatTag = WAVE_FORMAT_PCM;\n\t\twavefmt.nBlockAlign = wavefmt.nChannels * wavefmt.wBitsPerSample \/ 8; \/\/ standard calculation of WAV PCM data\n\t\twavefmt.nAvgBytesPerSec = wavefmt.nSamplesPerSec * wavefmt.nBlockAlign; \/\/ standard calculation of WAV PCM data\n\t\tHRESULT result = AUDIO_DEVICE->CreateSourceVoice(&this->sourceVoice, &wavefmt, 0, XAUDIO2_DEFAULT_FREQ_RATIO,\n\t\t\tthis->callbackHandler, NULL, NULL);\n\t\tif (FAILED(result))\n\t\t{\n\t\t\tthis->sourceVoice = NULL;\n\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\n\tvoid XAudio2_Player::_systemPrepareBuffer()\n\t{\n\t\tif (!this->sound->isStreamed())\n\t\t{\n\t\t\tif (!this->paused)\n\t\t\t{\n\t\t\t\tthis->_submitBuffer(this->buffer->getStream(), this->buffer->getSize());\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\tint count = STREAM_BUFFER_COUNT;\n\t\tif (this->paused)\n\t\t{\n\t\t\tthis->sourceVoice->GetState(&this->xa2State, XAUDIO2_VOICE_NOSAMPLESPLAYED);\n\t\t\tthis->buffersSubmitted = this->xa2State.BuffersQueued;\n\t\t\tcount -= this->buffersSubmitted;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthis->buffersSubmitted = 0;\n\t\t}\n\t\tif (count > 0)\n\t\t{\n\t\t\tcount = this->_fillStreamBuffers(count);\n\t\t\tif (count > 0)\n\t\t\t{\n\t\t\t\tthis->_submitStreamBuffers(count);\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid XAudio2_Player::_systemUpdateGain()\n\t{\n\t\tif (this->sourceVoice != NULL)\n\t\t{\n\t\t\tthis->sourceVoice->SetVolume(this->_calcGain());\n\t\t}\n\t}\n\n\tvoid XAudio2_Player::_systemUpdatePitch()\n\t{\n\t\tif (this->sourceVoice != NULL)\n\t\t{\n\t\t\tthis->sourceVoice->SetFrequencyRatio(this->pitch);\n\t\t}\n\t}\n\n\tvoid XAudio2_Player::_systemPlay()\n\t{\n\t\tHRESULT result = this->sourceVoice->Start();\n\t\tif (!FAILED(result))\n\t\t{\n\t\t\tthis->playing = true;\n\t\t\tthis->stillPlaying = true;\n\t\t}\n\t\telse\n\t\t{\n\t\t\thlog::warn(xal::logTag, \"Could not start: \" + this->sound->getFilename());\n\t\t}\n\t}\n\n\tint XAudio2_Player::_systemStop()\n\t{\n\t\tif (this->playing)\n\t\t{\n\t\t\tHRESULT result = this->sourceVoice->Stop();\n\t\t\tif (!FAILED(result))\n\t\t\t{\n\t\t\t\tif (this->paused)\n\t\t\t\t{\n\t\t\t\t\tif (this->sound->isStreamed())\n\t\t\t\t\t{\n\t\t\t\t\t\tthis->sourceVoice->GetState(&this->xa2State, XAUDIO2_VOICE_NOSAMPLESPLAYED);\n\t\t\t\t\t\tint processed = this->buffersSubmitted - this->xa2State.BuffersQueued;\n\t\t\t\t\t\tthis->buffersSubmitted -= processed;\n\t\t\t\t\t\tresult = processed * STREAM_BUFFER_SIZE;\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\tthis->sourceVoice->FlushSourceBuffers();\n\t\t\t\t\tif (this->sound->isStreamed())\n\t\t\t\t\t{\n\t\t\t\t\t\tthis->buffersSubmitted = 0;\n\t\t\t\t\t\tthis->buffer->rewind();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tthis->playing = false;\n\t\t\t\tthis->stillPlaying = false;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\thlog::warn(xal::logTag, \"Could not stop: \" + this->sound->getFilename());\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\t}\n\n\tint XAudio2_Player::_systemUpdateStream()\n\t{\n\t\tthis->stillPlaying = this->active;\n\t\tthis->sourceVoice->GetState(&this->xa2State, XAUDIO2_VOICE_NOSAMPLESPLAYED);\n\t\tint processed = this->buffersSubmitted - this->xa2State.BuffersQueued;\n\t\tif (processed == 0)\n\t\t{\n\t\t\tthis->stillPlaying = true;\n\t\t\treturn 0;\n\t\t}\n\t\tthis->buffersSubmitted -= processed;\n\t\tint count = this->_fillStreamBuffers(processed);\n\t\tif (count > 0)\n\t\t{\n\t\t\tthis->_submitStreamBuffers(count);\n\t\t\tthis->stillPlaying = true; \/\/ in case underrun happened, sound is regarded as stopped by XAudio2 so let's just bitch-slap it and get this over with\n\t\t}\n\t\tthis->sourceVoice->GetState(&this->xa2State, XAUDIO2_VOICE_NOSAMPLESPLAYED);\n\t\tif (this->xa2State.BuffersQueued == 0)\n\t\t{\n\t\t\tthis->_stop();\n\t\t}\n\t\treturn (processed * STREAM_BUFFER_SIZE);\n\t}\n\n\tvoid XAudio2_Player::_submitBuffer(unsigned char* stream, int size)\n\t{\n\t\tthis->xa2Buffer.AudioBytes = size;\n\t\tthis->xa2Buffer.pAudioData = stream;\n\t\tthis->xa2Buffer.LoopCount = (this->looping ? XAUDIO2_LOOP_INFINITE : 0);\n\t\tHRESULT result = this->sourceVoice->SubmitSourceBuffer(&this->xa2Buffer);\n\t\tif (FAILED(result))\n\t\t{\n\t\t\thlog::warn(xal::logTag, \"Could not submit source buffer!\");\n\t\t}\n\t}\n\n\tint XAudio2_Player::_fillStreamBuffers(int count)\n\t{\n\t\tint size = this->buffer->load(this->looping, count * STREAM_BUFFER_SIZE);\n\t\tint filled = (size + STREAM_BUFFER_SIZE - 1) \/ STREAM_BUFFER_SIZE;\n\t\tunsigned char* stream = this->buffer->getStream();\n\t\tint currentSize;\n\t\tfor_iter (i, 0, filled)\n\t\t{\n\t\t\tcurrentSize = hmin(size, STREAM_BUFFER_SIZE);\n\t\t\tmemcpy(this->streamBuffers[this->bufferIndex], &stream[i * STREAM_BUFFER_SIZE], currentSize);\n\t\t\tif (currentSize < STREAM_BUFFER_SIZE)\n\t\t\t{\n\t\t\t\tmemset(&this->streamBuffers[this->bufferIndex][currentSize], 0, STREAM_BUFFER_SIZE - currentSize);\n\t\t\t}\n\t\t\tthis->bufferIndex = (this->bufferIndex + 1) % STREAM_BUFFER_COUNT;\n\t\t\tsize -= STREAM_BUFFER_SIZE;\n\t\t}\n\t\treturn filled;\n\t}\n\n\tvoid XAudio2_Player::_submitStreamBuffers(int count)\n\t{\n\t\tHRESULT result;\n\t\tthis->xa2Buffer.AudioBytes = STREAM_BUFFER_SIZE;\n\t\tthis->xa2Buffer.LoopCount = 0;\n\t\tint index = (this->bufferIndex + STREAM_BUFFER_COUNT - count) % STREAM_BUFFER_COUNT;\n\t\tfor_iter (i, 0, count)\n\t\t{\n\t\t\tthis->xa2Buffer.pAudioData = this->streamBuffers[index];\n\t\t\tresult = this->sourceVoice->SubmitSourceBuffer(&this->xa2Buffer);\n\t\t\tif (FAILED(result))\n\t\t\t{\n\t\t\t\thlog::warn(xal::logTag, \"Could not submit streamed source buffer!\");\n\t\t\t}\n\t\t\tindex = (index + 1) % STREAM_BUFFER_COUNT;\n\t\t}\n\t\tthis->buffersSubmitted += count;\n\t}\n\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- *\/\n\/*\n *     Copyright 2012 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#include <cstdlib>\n#include <cstring>\n#include <sstream>\n\n#include \"couchbase_impl.h\"\n#include \"cas.h\"\n#include \"exception.h\"\n#include <libcouchbase\/libuv_io_opts.h>\n\nusing namespace std;\nusing namespace Couchnode;\n\n#ifdef UV_VERSION_MAJOR\n#ifndef UV_VERSION_PATCH\n#define UV_VERSION_PATCH 0\n#endif\n#define NAUV_UVVERSION  ((UV_VERSION_MAJOR << 16) | \\\n                     (UV_VERSION_MINOR <<  8) | \\\n                     (UV_VERSION_PATCH))\n#else\n#define NAUV_UVVERSION 0x000b00\n#endif\n\n#if NAUV_UVVERSION < 0x000b00\n#define NAUV_PREPARE_CB(func) \\\n    void func(uv_prepare_t *handle, int)\n#else\n#define NAUV_PREPARE_CB(func) \\\n    void func(uv_prepare_t *handle)\n#endif\n\nNAUV_PREPARE_CB(lcbuv_flush) {\n    CouchbaseImpl *me = reinterpret_cast<CouchbaseImpl*>(handle->data);\n    lcb_sched_flush(me->getLcbHandle());\n}\n\nCouchbaseImpl::CouchbaseImpl(lcb_t inst) :\n    ObjectWrap(), instance(inst), connectCallback(NULL),\n    transEncodeFunc(NULL), transDecodeFunc(NULL)\n{\n    lcb_set_cookie(instance, reinterpret_cast<void *>(this));\n    setupLibcouchbaseCallbacks();\n}\n\nCouchbaseImpl::~CouchbaseImpl()\n{\n    delete connectCallback;\n    delete transEncodeFunc;\n    delete transDecodeFunc;\n    if (instance) {\n        lcb_destroy(instance);\n    }\n}\n\nextern \"C\" { static void bootstrap_callback_empty(lcb_t, lcb_error_t) {} }\nvoid CouchbaseImpl::onConnect(lcb_error_t err)\n{\n    if (err != 0) {\n        lcb_set_bootstrap_callback(instance, bootstrap_callback_empty);\n        lcb_destroy_async(instance, NULL);\n    } else {\n        uv_prepare_init(uv_default_loop(), &flushWatch);\n        flushWatch.data = this;\n        uv_prepare_start(&flushWatch, &lcbuv_flush);\n\n        int flushMode = 0;\n        lcb_cntl(instance, LCB_CNTL_SET, LCB_CNTL_SCHED_IMPLICIT_FLUSH, &flushMode);\n    }\n\n    NanScope();\n    if (connectCallback) {\n        Handle<Value> args[] = { NanNew<Integer>(err) };\n        connectCallback->Call(1, args);\n    }\n}\n\nvoid CouchbaseImpl::onShutdown()\n{\n    uv_prepare_stop(&flushWatch);\n}\n\nHandle<Value> CouchbaseImpl::decodeDoc(\n        const void *bytes, size_t nbytes, lcb_U32 flags)\n{\n    if (transDecodeFunc) {\n        Handle<Object> decObj = NanNew<Object>();\n        decObj->Set(NanNew(valueKey), NanNewBufferHandle((char*)bytes, nbytes));\n        decObj->Set(NanNew(flagsKey), NanNew<Integer>(flags));\n        Handle<Value> args[] = { decObj };\n        return transDecodeFunc->Call(1, args);\n    }\n\n    return DefaultTranscoder::decode(bytes, nbytes, flags);\n}\n\nvoid CouchbaseImpl::encodeDoc(DefaultTranscoder& transcoder, const void **bytes,\n        lcb_SIZE *nbytes, lcb_U32 *flags, Handle<Value> value) {\n    \/\/ There must never be a NanScope here, the system relies on the fact\n    \/\/   that the scope will exist until the lcb_cmd_XXX_t object has been\n    \/\/   passed to LCB already.\n    if (transEncodeFunc) {\n        Handle<Value> args[] = { value };\n        Handle<Value> res = transEncodeFunc->Call(1, args);\n        if (!res.IsEmpty() && res->IsObject()) {\n            Handle<Object> encObj = res.As<Object>();\n            Handle<Value> flagsObj = encObj->Get(NanNew(flagsKey));\n            Handle<Value> valueObj = encObj->Get(NanNew(valueKey));\n            if (!flagsObj.IsEmpty() && !valueObj.IsEmpty()) {\n                if (node::Buffer::HasInstance(valueObj)) {\n                    *nbytes = node::Buffer::Length(valueObj);\n                    *bytes = node::Buffer::Data(valueObj);\n                    *flags = flagsObj->Uint32Value();\n                    return;\n                }\n            }\n        }\n    }\n    transcoder.encode(bytes, nbytes, flags, value);\n}\n\ntemplate<typename T>\nvoid _DispatchValueCallback(lcb_t instance, const void *cookie, lcb_error_t error, const T *resp) {\n    CouchbaseImpl *me = (CouchbaseImpl *)lcb_get_cookie(instance);\n    NanCallback *callback = (NanCallback*)cookie;\n    NanScope();\n\n    Handle<Value> errObj = Error::create(error);\n    Handle<Value> resVal;\n    if (!error) {\n        Handle<Object> resObj = NanNew<Object>();\n        resObj->Set(NanNew(me->casKey), Cas::CreateCas(resp->v.v0.cas));\n        resObj->Set(NanNew(me->valueKey), me->decodeDoc(resp->v.v0.bytes, resp->v.v0.nbytes, resp->v.v0.flags));\n        resVal = resObj;\n    } else {\n        resVal = NanNull();\n    }\n\n    Handle<Value> args[] = { errObj, resVal };\n    callback->Call(2, args);\n\n    delete callback;\n}\n\ntemplate<typename T>\nvoid _DispatchArithCallback(lcb_t instance, const void *cookie, lcb_error_t error, const T *resp) {\n    CouchbaseImpl *me = (CouchbaseImpl *)lcb_get_cookie(instance);\n    NanCallback *callback = (NanCallback*)cookie;\n    NanScope();\n\n    Handle<Value> errObj = Error::create(error);\n    Handle<Value> resVal;\n    if (!error) {\n        Handle<Object> resObj = NanNew<Object>();\n        resObj->Set(NanNew(me->casKey), Cas::CreateCas(resp->v.v0.cas));\n        resObj->Set(NanNew(me->valueKey), NanNew<Number>(resp->v.v0.value));\n        resVal = resObj;\n    } else {\n        resVal = NanNull();\n    }\n\n    Handle<Value> args[] = { errObj, resVal };\n    callback->Call(2, args);\n\n    delete callback;\n}\n\ntemplate<typename T>\nvoid _DispatchBasicCallback(lcb_t instance, const void *cookie, lcb_error_t error, const T *resp) {\n    CouchbaseImpl *me = (CouchbaseImpl *)lcb_get_cookie(instance);\n    NanCallback *callback = (NanCallback*)cookie;\n    NanScope();\n\n    Handle<Value> errObj = Error::create(error);\n    Handle<Value> resVal;\n    if (!error) {\n        Handle<Object> resObj = NanNew<Object>();\n        resObj->Set(NanNew(me->casKey), Cas::CreateCas(resp->v.v0.cas));\n        resVal = resObj;\n    } else {\n        resVal = NanNull();\n    }\n\n    Handle<Value> args[] = { errObj, resVal };\n    callback->Call(2, args);\n\n    delete callback;\n}\n\nvoid _DispatchErrorCallback(lcb_t instance, const void *cookie, lcb_error_t error) {\n    NanCallback *callback = (NanCallback*)cookie;\n    NanScope();\n\n    Handle<Value> errObj = Error::create(error);\n    Handle<Value> resVal = NanNull();\n\n    Handle<Value> args[] = { errObj, resVal };\n    callback->Call(2, args);\n\n    delete callback;\n}\n\nextern \"C\" {\nstatic void bootstrap_callback(lcb_t instance, lcb_error_t err)\n{\n    CouchbaseImpl *me = (CouchbaseImpl *)lcb_get_cookie(instance);\n    me->onConnect(err);\n}\n\n\nstatic void get_callback(lcb_t instance, const void *cookie,\n        lcb_error_t error, const lcb_get_resp_t *resp)\n{\n    _DispatchValueCallback(instance, cookie, error, resp);\n}\n\nstatic void store_callback(lcb_t instance, const void *cookie, lcb_storage_t,\n        lcb_error_t error, const lcb_store_resp_t *resp)\n{\n    _DispatchBasicCallback(instance, cookie, error, resp);\n}\n\nstatic void arithmetic_callback(lcb_t instance, const void *cookie,\n        lcb_error_t error, const lcb_arithmetic_resp_t *resp)\n{\n    _DispatchArithCallback(instance, cookie, error, resp);\n}\n\nstatic void remove_callback(lcb_t instance, const void *cookie,\n        lcb_error_t error, const lcb_remove_resp_t *resp)\n{\n    _DispatchBasicCallback(instance, cookie, error, resp);\n\n}\n\nstatic void touch_callback(lcb_t instance, const void *cookie,\n        lcb_error_t error, const lcb_touch_resp_t *resp)\n{\n    _DispatchBasicCallback(instance, cookie, error, resp);\n}\n\nstatic void unlock_callback(lcb_t instance, const void *cookie,\n        lcb_error_t error, const lcb_unlock_resp_t *resp)\n{\n    _DispatchErrorCallback(instance, cookie, error);\n}\n\nstatic void durability_callback(lcb_t instance, const void *cookie,\n        lcb_error_t error, const lcb_durability_resp_t *resp)\n{\n    _DispatchErrorCallback(instance, cookie, error);\n}\n\nvoid viewrow_callback(lcb_t instance, int ignoreme,\n        const lcb_RESPVIEWQUERY *resp)\n{\n    CouchbaseImpl *me = (CouchbaseImpl *)lcb_get_cookie(instance);\n    NanCallback *callback = (NanCallback*)resp->cookie;\n    NanScope();\n\n    Local<Function> jsonParseLcl = NanNew(CouchbaseImpl::jsonParse);\n\n    if (resp->rflags & LCB_RESP_F_FINAL) {\n        Handle<Value> dataRes;\n        if (resp->rc != LCB_SUCCESS) {\n            if (resp->htresp && resp->htresp->body) {\n                dataRes = NanNew<String>((const char*)resp->htresp->body, (int)resp->htresp->nbody);\n            } else {\n                dataRes = NanNull();\n            }\n        } else {\n            Handle<Value> metaStr =\n                    NanNew<String>((const char*)resp->value, (int)resp->nvalue);\n            dataRes = jsonParseLcl->Call(NanGetCurrentContext()->Global(), 1, &metaStr);\n            Local<Object> metaObj = dataRes->ToObject();\n            if (!metaObj.IsEmpty()) {\n                metaObj->Delete(NanNew(CouchbaseImpl::rowsKey));\n            }\n        }\n\n        Handle<Value> args[] = {\n                NanNew<Number>(resp->rc),\n                dataRes\n        };\n        callback->Call(2, args);\n\n        delete callback;\n        return;\n    }\n\n    Handle<Object> rowObj = NanNew<Object>();\n\n    Handle<Value> keyStr =\n            NanNew<String>((const char*)resp->key, (int)resp->nkey);\n    rowObj->Set(NanNew(CouchbaseImpl::keyKey),\n            jsonParseLcl->Call(NanGetCurrentContext()->Global(), 1, &keyStr));\n\n    if (resp->value) {\n        Handle<Value> valueStr =\n                NanNew<String>((const char*)resp->value, (int)resp->nvalue);\n        rowObj->Set(NanNew(CouchbaseImpl::valueKey),\n                jsonParseLcl->Call(NanGetCurrentContext()->Global(), 1, &valueStr));\n    } else {\n        rowObj->Set(NanNew(CouchbaseImpl::valueKey), NanNull());\n    }\n\n    if (resp->geometry) {\n        Handle<Value> geometryStr =\n                NanNew<String>((const char*)resp->geometry, (int)resp->ngeometry);\n        rowObj->Set(NanNew(CouchbaseImpl::geometryKey),\n                jsonParseLcl->Call(NanGetCurrentContext()->Global(), 1, &geometryStr));\n    }\n\n    if (resp->docid) {\n        rowObj->Set(NanNew(CouchbaseImpl::idKey),\n                NanNew<String>((const char*)resp->docid, (int)resp->ndocid));\n\n        if (resp->docresp) {\n            const lcb_RESPGET *rg = resp->docresp;\n            if (rg->rc == LCB_SUCCESS) {\n                rowObj->Set(NanNew(CouchbaseImpl::docKey),\n                        me->decodeDoc(rg->value, rg->nvalue, rg->itmflags));\n            } else {\n                rowObj->Set(NanNew(CouchbaseImpl::docKey), NanNull());\n            }\n        }\n    } else {\n        rowObj->Set(NanNew(CouchbaseImpl::idKey), NanNull());\n    }\n\n    Handle<Value> args[] = {\n            NanNew<Number>(-1),\n            rowObj\n    };\n    callback->Call(2, args);\n}\n\nvoid n1qlrow_callback(lcb_t instance, int ignoreme,\n        const lcb_RESPN1QL *resp)\n{\n    CouchbaseImpl *me = (CouchbaseImpl *)lcb_get_cookie(instance);\n    NanCallback *callback = (NanCallback*)resp->cookie;\n    NanScope();\n\n    Local<Function> jsonParseLcl = NanNew(CouchbaseImpl::jsonParse);\n\n    if (resp->rflags & LCB_RESP_F_FINAL) {\n        Handle<Value> dataRes;\n        if (resp->rc != LCB_SUCCESS) {\n            if (resp->row) {\n                dataRes = NanNew<String>((const char*)resp->row, (int)resp->nrow);\n            } else {\n                dataRes = NanNull();\n            }\n        } else {\n            Handle<Value> metaStr =\n                    NanNew<String>((const char*)resp->row, (int)resp->nrow);\n            dataRes = jsonParseLcl->Call(NanGetCurrentContext()->Global(), 1, &metaStr);\n            Local<Object> metaObj = dataRes->ToObject();\n            if (!metaObj.IsEmpty()) {\n                metaObj->Delete(NanNew(CouchbaseImpl::resultsKey));\n            }\n        }\n\n        Handle<Value> args[] = {\n                NanNew<Number>(resp->rc),\n                dataRes\n        };\n        callback->Call(2, args);\n\n        delete callback;\n        return;\n    }\n\n    Handle<Value> rowStr =\n            NanNew<String>((const char*)resp->row, (int)resp->nrow);\n    Handle<Value> rowObj =\n            jsonParseLcl->Call(NanGetCurrentContext()->Global(), 1, &rowStr);\n    Handle<Value> args[] = {\n            NanNew<Number>(-1),\n            rowObj\n    };\n    callback->Call(2, args);\n}\n\n}\n\nvoid CouchbaseImpl::setupLibcouchbaseCallbacks(void)\n{\n    lcb_set_bootstrap_callback(instance, bootstrap_callback);\n\n    lcb_set_get_callback(instance, get_callback);\n    lcb_set_store_callback(instance, store_callback);\n    lcb_set_arithmetic_callback(instance, arithmetic_callback);\n    lcb_set_remove_callback(instance, remove_callback);\n    lcb_set_touch_callback(instance, touch_callback);\n    lcb_set_unlock_callback(instance, unlock_callback);\n    lcb_set_durability_callback(instance, durability_callback);\n}\n<commit_msg>Orphan: Remove unused variable reference.<commit_after>\/* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- *\/\n\/*\n *     Copyright 2012 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#include <cstdlib>\n#include <cstring>\n#include <sstream>\n\n#include \"couchbase_impl.h\"\n#include \"cas.h\"\n#include \"exception.h\"\n#include <libcouchbase\/libuv_io_opts.h>\n\nusing namespace std;\nusing namespace Couchnode;\n\n#ifdef UV_VERSION_MAJOR\n#ifndef UV_VERSION_PATCH\n#define UV_VERSION_PATCH 0\n#endif\n#define NAUV_UVVERSION  ((UV_VERSION_MAJOR << 16) | \\\n                     (UV_VERSION_MINOR <<  8) | \\\n                     (UV_VERSION_PATCH))\n#else\n#define NAUV_UVVERSION 0x000b00\n#endif\n\n#if NAUV_UVVERSION < 0x000b00\n#define NAUV_PREPARE_CB(func) \\\n    void func(uv_prepare_t *handle, int)\n#else\n#define NAUV_PREPARE_CB(func) \\\n    void func(uv_prepare_t *handle)\n#endif\n\nNAUV_PREPARE_CB(lcbuv_flush) {\n    CouchbaseImpl *me = reinterpret_cast<CouchbaseImpl*>(handle->data);\n    lcb_sched_flush(me->getLcbHandle());\n}\n\nCouchbaseImpl::CouchbaseImpl(lcb_t inst) :\n    ObjectWrap(), instance(inst), connectCallback(NULL),\n    transEncodeFunc(NULL), transDecodeFunc(NULL)\n{\n    lcb_set_cookie(instance, reinterpret_cast<void *>(this));\n    setupLibcouchbaseCallbacks();\n}\n\nCouchbaseImpl::~CouchbaseImpl()\n{\n    delete connectCallback;\n    delete transEncodeFunc;\n    delete transDecodeFunc;\n    if (instance) {\n        lcb_destroy(instance);\n    }\n}\n\nextern \"C\" { static void bootstrap_callback_empty(lcb_t, lcb_error_t) {} }\nvoid CouchbaseImpl::onConnect(lcb_error_t err)\n{\n    if (err != 0) {\n        lcb_set_bootstrap_callback(instance, bootstrap_callback_empty);\n        lcb_destroy_async(instance, NULL);\n    } else {\n        uv_prepare_init(uv_default_loop(), &flushWatch);\n        flushWatch.data = this;\n        uv_prepare_start(&flushWatch, &lcbuv_flush);\n\n        int flushMode = 0;\n        lcb_cntl(instance, LCB_CNTL_SET, LCB_CNTL_SCHED_IMPLICIT_FLUSH, &flushMode);\n    }\n\n    NanScope();\n    if (connectCallback) {\n        Handle<Value> args[] = { NanNew<Integer>(err) };\n        connectCallback->Call(1, args);\n    }\n}\n\nvoid CouchbaseImpl::onShutdown()\n{\n    uv_prepare_stop(&flushWatch);\n}\n\nHandle<Value> CouchbaseImpl::decodeDoc(\n        const void *bytes, size_t nbytes, lcb_U32 flags)\n{\n    if (transDecodeFunc) {\n        Handle<Object> decObj = NanNew<Object>();\n        decObj->Set(NanNew(valueKey), NanNewBufferHandle((char*)bytes, nbytes));\n        decObj->Set(NanNew(flagsKey), NanNew<Integer>(flags));\n        Handle<Value> args[] = { decObj };\n        return transDecodeFunc->Call(1, args);\n    }\n\n    return DefaultTranscoder::decode(bytes, nbytes, flags);\n}\n\nvoid CouchbaseImpl::encodeDoc(DefaultTranscoder& transcoder, const void **bytes,\n        lcb_SIZE *nbytes, lcb_U32 *flags, Handle<Value> value) {\n    \/\/ There must never be a NanScope here, the system relies on the fact\n    \/\/   that the scope will exist until the lcb_cmd_XXX_t object has been\n    \/\/   passed to LCB already.\n    if (transEncodeFunc) {\n        Handle<Value> args[] = { value };\n        Handle<Value> res = transEncodeFunc->Call(1, args);\n        if (!res.IsEmpty() && res->IsObject()) {\n            Handle<Object> encObj = res.As<Object>();\n            Handle<Value> flagsObj = encObj->Get(NanNew(flagsKey));\n            Handle<Value> valueObj = encObj->Get(NanNew(valueKey));\n            if (!flagsObj.IsEmpty() && !valueObj.IsEmpty()) {\n                if (node::Buffer::HasInstance(valueObj)) {\n                    *nbytes = node::Buffer::Length(valueObj);\n                    *bytes = node::Buffer::Data(valueObj);\n                    *flags = flagsObj->Uint32Value();\n                    return;\n                }\n            }\n        }\n    }\n    transcoder.encode(bytes, nbytes, flags, value);\n}\n\ntemplate<typename T>\nvoid _DispatchValueCallback(lcb_t instance, const void *cookie, lcb_error_t error, const T *resp) {\n    CouchbaseImpl *me = (CouchbaseImpl *)lcb_get_cookie(instance);\n    NanCallback *callback = (NanCallback*)cookie;\n    NanScope();\n\n    Handle<Value> errObj = Error::create(error);\n    Handle<Value> resVal;\n    if (!error) {\n        Handle<Object> resObj = NanNew<Object>();\n        resObj->Set(NanNew(me->casKey), Cas::CreateCas(resp->v.v0.cas));\n        resObj->Set(NanNew(me->valueKey), me->decodeDoc(resp->v.v0.bytes, resp->v.v0.nbytes, resp->v.v0.flags));\n        resVal = resObj;\n    } else {\n        resVal = NanNull();\n    }\n\n    Handle<Value> args[] = { errObj, resVal };\n    callback->Call(2, args);\n\n    delete callback;\n}\n\ntemplate<typename T>\nvoid _DispatchArithCallback(lcb_t instance, const void *cookie, lcb_error_t error, const T *resp) {\n    CouchbaseImpl *me = (CouchbaseImpl *)lcb_get_cookie(instance);\n    NanCallback *callback = (NanCallback*)cookie;\n    NanScope();\n\n    Handle<Value> errObj = Error::create(error);\n    Handle<Value> resVal;\n    if (!error) {\n        Handle<Object> resObj = NanNew<Object>();\n        resObj->Set(NanNew(me->casKey), Cas::CreateCas(resp->v.v0.cas));\n        resObj->Set(NanNew(me->valueKey), NanNew<Number>(resp->v.v0.value));\n        resVal = resObj;\n    } else {\n        resVal = NanNull();\n    }\n\n    Handle<Value> args[] = { errObj, resVal };\n    callback->Call(2, args);\n\n    delete callback;\n}\n\ntemplate<typename T>\nvoid _DispatchBasicCallback(lcb_t instance, const void *cookie, lcb_error_t error, const T *resp) {\n    CouchbaseImpl *me = (CouchbaseImpl *)lcb_get_cookie(instance);\n    NanCallback *callback = (NanCallback*)cookie;\n    NanScope();\n\n    Handle<Value> errObj = Error::create(error);\n    Handle<Value> resVal;\n    if (!error) {\n        Handle<Object> resObj = NanNew<Object>();\n        resObj->Set(NanNew(me->casKey), Cas::CreateCas(resp->v.v0.cas));\n        resVal = resObj;\n    } else {\n        resVal = NanNull();\n    }\n\n    Handle<Value> args[] = { errObj, resVal };\n    callback->Call(2, args);\n\n    delete callback;\n}\n\nvoid _DispatchErrorCallback(lcb_t instance, const void *cookie, lcb_error_t error) {\n    NanCallback *callback = (NanCallback*)cookie;\n    NanScope();\n\n    Handle<Value> errObj = Error::create(error);\n    Handle<Value> resVal = NanNull();\n\n    Handle<Value> args[] = { errObj, resVal };\n    callback->Call(2, args);\n\n    delete callback;\n}\n\nextern \"C\" {\nstatic void bootstrap_callback(lcb_t instance, lcb_error_t err)\n{\n    CouchbaseImpl *me = (CouchbaseImpl *)lcb_get_cookie(instance);\n    me->onConnect(err);\n}\n\n\nstatic void get_callback(lcb_t instance, const void *cookie,\n        lcb_error_t error, const lcb_get_resp_t *resp)\n{\n    _DispatchValueCallback(instance, cookie, error, resp);\n}\n\nstatic void store_callback(lcb_t instance, const void *cookie, lcb_storage_t,\n        lcb_error_t error, const lcb_store_resp_t *resp)\n{\n    _DispatchBasicCallback(instance, cookie, error, resp);\n}\n\nstatic void arithmetic_callback(lcb_t instance, const void *cookie,\n        lcb_error_t error, const lcb_arithmetic_resp_t *resp)\n{\n    _DispatchArithCallback(instance, cookie, error, resp);\n}\n\nstatic void remove_callback(lcb_t instance, const void *cookie,\n        lcb_error_t error, const lcb_remove_resp_t *resp)\n{\n    _DispatchBasicCallback(instance, cookie, error, resp);\n\n}\n\nstatic void touch_callback(lcb_t instance, const void *cookie,\n        lcb_error_t error, const lcb_touch_resp_t *resp)\n{\n    _DispatchBasicCallback(instance, cookie, error, resp);\n}\n\nstatic void unlock_callback(lcb_t instance, const void *cookie,\n        lcb_error_t error, const lcb_unlock_resp_t *resp)\n{\n    _DispatchErrorCallback(instance, cookie, error);\n}\n\nstatic void durability_callback(lcb_t instance, const void *cookie,\n        lcb_error_t error, const lcb_durability_resp_t *resp)\n{\n    _DispatchErrorCallback(instance, cookie, error);\n}\n\nvoid viewrow_callback(lcb_t instance, int ignoreme,\n        const lcb_RESPVIEWQUERY *resp)\n{\n    CouchbaseImpl *me = (CouchbaseImpl *)lcb_get_cookie(instance);\n    NanCallback *callback = (NanCallback*)resp->cookie;\n    NanScope();\n\n    Local<Function> jsonParseLcl = NanNew(CouchbaseImpl::jsonParse);\n\n    if (resp->rflags & LCB_RESP_F_FINAL) {\n        Handle<Value> dataRes;\n        if (resp->rc != LCB_SUCCESS) {\n            if (resp->htresp && resp->htresp->body) {\n                dataRes = NanNew<String>((const char*)resp->htresp->body, (int)resp->htresp->nbody);\n            } else {\n                dataRes = NanNull();\n            }\n        } else {\n            Handle<Value> metaStr =\n                    NanNew<String>((const char*)resp->value, (int)resp->nvalue);\n            dataRes = jsonParseLcl->Call(NanGetCurrentContext()->Global(), 1, &metaStr);\n            Local<Object> metaObj = dataRes->ToObject();\n            if (!metaObj.IsEmpty()) {\n                metaObj->Delete(NanNew(CouchbaseImpl::rowsKey));\n            }\n        }\n\n        Handle<Value> args[] = {\n                NanNew<Number>(resp->rc),\n                dataRes\n        };\n        callback->Call(2, args);\n\n        delete callback;\n        return;\n    }\n\n    Handle<Object> rowObj = NanNew<Object>();\n\n    Handle<Value> keyStr =\n            NanNew<String>((const char*)resp->key, (int)resp->nkey);\n    rowObj->Set(NanNew(CouchbaseImpl::keyKey),\n            jsonParseLcl->Call(NanGetCurrentContext()->Global(), 1, &keyStr));\n\n    if (resp->value) {\n        Handle<Value> valueStr =\n                NanNew<String>((const char*)resp->value, (int)resp->nvalue);\n        rowObj->Set(NanNew(CouchbaseImpl::valueKey),\n                jsonParseLcl->Call(NanGetCurrentContext()->Global(), 1, &valueStr));\n    } else {\n        rowObj->Set(NanNew(CouchbaseImpl::valueKey), NanNull());\n    }\n\n    if (resp->geometry) {\n        Handle<Value> geometryStr =\n                NanNew<String>((const char*)resp->geometry, (int)resp->ngeometry);\n        rowObj->Set(NanNew(CouchbaseImpl::geometryKey),\n                jsonParseLcl->Call(NanGetCurrentContext()->Global(), 1, &geometryStr));\n    }\n\n    if (resp->docid) {\n        rowObj->Set(NanNew(CouchbaseImpl::idKey),\n                NanNew<String>((const char*)resp->docid, (int)resp->ndocid));\n\n        if (resp->docresp) {\n            const lcb_RESPGET *rg = resp->docresp;\n            if (rg->rc == LCB_SUCCESS) {\n                rowObj->Set(NanNew(CouchbaseImpl::docKey),\n                        me->decodeDoc(rg->value, rg->nvalue, rg->itmflags));\n            } else {\n                rowObj->Set(NanNew(CouchbaseImpl::docKey), NanNull());\n            }\n        }\n    } else {\n        rowObj->Set(NanNew(CouchbaseImpl::idKey), NanNull());\n    }\n\n    Handle<Value> args[] = {\n            NanNew<Number>(-1),\n            rowObj\n    };\n    callback->Call(2, args);\n}\n\nvoid n1qlrow_callback(lcb_t instance, int ignoreme,\n        const lcb_RESPN1QL *resp)\n{\n    NanCallback *callback = (NanCallback*)resp->cookie;\n    NanScope();\n\n    Local<Function> jsonParseLcl = NanNew(CouchbaseImpl::jsonParse);\n\n    if (resp->rflags & LCB_RESP_F_FINAL) {\n        Handle<Value> dataRes;\n        if (resp->rc != LCB_SUCCESS) {\n            if (resp->row) {\n                dataRes = NanNew<String>((const char*)resp->row, (int)resp->nrow);\n            } else {\n                dataRes = NanNull();\n            }\n        } else {\n            Handle<Value> metaStr =\n                    NanNew<String>((const char*)resp->row, (int)resp->nrow);\n            dataRes = jsonParseLcl->Call(NanGetCurrentContext()->Global(), 1, &metaStr);\n            Local<Object> metaObj = dataRes->ToObject();\n            if (!metaObj.IsEmpty()) {\n                metaObj->Delete(NanNew(CouchbaseImpl::resultsKey));\n            }\n        }\n\n        Handle<Value> args[] = {\n                NanNew<Number>(resp->rc),\n                dataRes\n        };\n        callback->Call(2, args);\n\n        delete callback;\n        return;\n    }\n\n    Handle<Value> rowStr =\n            NanNew<String>((const char*)resp->row, (int)resp->nrow);\n    Handle<Value> rowObj =\n            jsonParseLcl->Call(NanGetCurrentContext()->Global(), 1, &rowStr);\n    Handle<Value> args[] = {\n            NanNew<Number>(-1),\n            rowObj\n    };\n    callback->Call(2, args);\n}\n\n}\n\nvoid CouchbaseImpl::setupLibcouchbaseCallbacks(void)\n{\n    lcb_set_bootstrap_callback(instance, bootstrap_callback);\n\n    lcb_set_get_callback(instance, get_callback);\n    lcb_set_store_callback(instance, store_callback);\n    lcb_set_arithmetic_callback(instance, arithmetic_callback);\n    lcb_set_remove_callback(instance, remove_callback);\n    lcb_set_touch_callback(instance, touch_callback);\n    lcb_set_unlock_callback(instance, unlock_callback);\n    lcb_set_durability_callback(instance, durability_callback);\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef XML11_DECLARATIVE_HPP\n#define XML11_DECLARATIVE_HPP\n\n#include \"xml11.hpp\"\n\nnamespace xml11 {\n\nenum TagType {\n    NONE,\n    MANDATORY\n};\n\nstruct TagBase {\n    template <class T>\n    TagBase(T&& name, const TagType& type)\n        : name {std::forward<T>(name)}, type {type} {}\n\n    operator bool() const { return valid; }\n\n    std::string name;\n    TagType type {NONE};\n    bool valid {false};\n};\n\nstruct Tag : public TagBase {\n    template <class U, class T>\n    Tag(U* refs, T&& name, const TagType& type = NONE)\n        : TagBase {std::forward<T>(name), type}\n    {\n        refs->add(this);\n    }\n\n    std::string value;\n};\n\nstruct Tags : public TagBase {\n    template <class U, class T>\n    Tags(U* refs, T&& name, const TagType& type = NONE)\n        : TagBase {std::forward<T>(name), type}\n    {\n        refs->add(this);\n    }\n\n    std::vector<std::string> values;\n};\n\nclass TagsRefs {\npublic:\n    void add(Tag* tag) {\n        tagList.emplace_back(tag);\n    }\n\n    void add(Tags* tag)\n    {\n        tagsList.emplace_back(tag);\n    }\n\n    void parse(const Node& root, Tag& head)\n    {\n        if (root) {\n            if (const auto node = root(head.name)) {\n                head.value = node.text();\n                head.valid = true;\n            }\n        }\n\n        if (not head and head.type == TagType::MANDATORY) {\n            throw std::runtime_error(\n                \"Mandatory member '\" + head.name + \"' is missing.\");\n        }\n    }\n\n    void parse(const Node& root, Tags& head)\n    {\n        if (root) {\n            for (const auto node : root[head.name]) {\n                head.values.emplace_back(node.text());\n            }\n            if (not head.values.empty()) {\n                head.valid = true;\n            }\n        }\n\n        if (not head and head.type == TagType::MANDATORY) {\n            throw std::runtime_error(\n                \"Mandatory member '\" + head.name + \"' is missing.\");\n        }\n    }\n\n    void parse(const Node& root)\n    {\n        if (not root) {\n            for (auto& tagRef : tagList) {\n                if (tagRef->type == TagType::MANDATORY) {\n                    throw std::runtime_error(\n                        \"No Node received when mandatory members exists.\");\n                }\n            }\n\n            for (auto& tagsRef : tagsList) {\n                if (tagsRef->type == TagType::MANDATORY) {\n                    throw std::runtime_error(\n                        \"No Node received when mandatory members exists.\");\n                }\n            }\n            return;\n        }\n\n        for (auto& tagRef : tagList) {\n            parse(root, *tagRef);\n        }\n\n        for (auto& tagsRef : tagsList) {\n            parse(root, *tagsRef);\n        }\n    }\n\nprivate:\n    std::vector<Tag*> tagList;\n    std::vector<Tags*> tagsList;\n};\n\n} \/* namespace xml11 *\/\n\n#endif \/\/ XML11_DECLARATIVE_HPP\n<commit_msg>Declarative: NONE -> OPTIONAL<commit_after>#ifndef XML11_DECLARATIVE_HPP\n#define XML11_DECLARATIVE_HPP\n\n#include \"xml11.hpp\"\n\nnamespace xml11 {\n\nenum TagType {\n    OPTIONAL,\n    MANDATORY\n};\n\nstruct TagBase {\n    template <class T>\n    TagBase(T&& name, const TagType& type)\n        : name {std::forward<T>(name)}, type {type} {}\n\n    operator bool() const { return valid; }\n\n    std::string name;\n    TagType type {OPTIONAL};\n    bool valid {false};\n};\n\nstruct Tag : public TagBase {\n    template <class U, class T>\n    Tag(U* refs, T&& name, const TagType& type = OPTIONAL)\n        : TagBase {std::forward<T>(name), type}\n    {\n        refs->add(this);\n    }\n\n    std::string value;\n};\n\nstruct Tags : public TagBase {\n    template <class U, class T>\n    Tags(U* refs, T&& name, const TagType& type = OPTIONAL)\n        : TagBase {std::forward<T>(name), type}\n    {\n        refs->add(this);\n    }\n\n    std::vector<std::string> values;\n};\n\nclass TagsRefs {\npublic:\n    void add(Tag* tag) {\n        tagList.emplace_back(tag);\n    }\n\n    void add(Tags* tag)\n    {\n        tagsList.emplace_back(tag);\n    }\n\n    void parse(const Node& root, Tag& head)\n    {\n        if (root) {\n            if (const auto node = root(head.name)) {\n                head.value = node.text();\n                head.valid = true;\n            }\n        }\n\n        if (not head and head.type == TagType::MANDATORY) {\n            throw std::runtime_error(\n                \"Mandatory member '\" + head.name + \"' is missing.\");\n        }\n    }\n\n    void parse(const Node& root, Tags& head)\n    {\n        if (root) {\n            for (const auto node : root[head.name]) {\n                head.values.emplace_back(node.text());\n            }\n            if (not head.values.empty()) {\n                head.valid = true;\n            }\n        }\n\n        if (not head and head.type == TagType::MANDATORY) {\n            throw std::runtime_error(\n                \"Mandatory member '\" + head.name + \"' is missing.\");\n        }\n    }\n\n    void parse(const Node& root)\n    {\n        if (not root) {\n            for (auto& tagRef : tagList) {\n                if (tagRef->type == TagType::MANDATORY) {\n                    throw std::runtime_error(\n                        \"No Node received when mandatory members exists.\");\n                }\n            }\n\n            for (auto& tagsRef : tagsList) {\n                if (tagsRef->type == TagType::MANDATORY) {\n                    throw std::runtime_error(\n                        \"No Node received when mandatory members exists.\");\n                }\n            }\n            return;\n        }\n\n        for (auto& tagRef : tagList) {\n            parse(root, *tagRef);\n        }\n\n        for (auto& tagsRef : tagsList) {\n            parse(root, *tagsRef);\n        }\n    }\n\nprivate:\n    std::vector<Tag*> tagList;\n    std::vector<Tags*> tagsList;\n};\n\n} \/* namespace xml11 *\/\n\n#endif \/\/ XML11_DECLARATIVE_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: cmdbasestream.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: obo $ $Date: 2004-07-06 12:03:03 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2002\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2002 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; 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: 2002 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n\/*************************************************************************\n *\n *    ATTENTION\n *    This file is intended to work inside and outside the StarOffice environment.\n *    Only adaption of file commtypes.hxx should be necessary. Else it is a bug!\n *\n ************************************************************************\/\n\n#ifndef _CMDBASESTREAM_HXX_\n#define _CMDBASESTREAM_HXX_\n\n#include \"commtypes.hxx\"\n#include \"icommstream.hxx\"\n\nclass CmdBaseStream\n{\nprotected:\n    ICommStream* pCommStream;\n    CmdBaseStream();\n    virtual ~CmdBaseStream();\n\npublic:\n\n    void GenError( SmartId *pUId, comm_String *pString );\n\n    void GenReturn( comm_USHORT nRet, comm_ULONG nNr );\n    void GenReturn( comm_USHORT nRet, SmartId *pUId, comm_ULONG nNr );\n    void GenReturn( comm_USHORT nRet, SmartId *pUId, comm_String *pString );\n    void GenReturn( comm_USHORT nRet, SmartId *pUId, comm_BOOL bBool );\n    void GenReturn( comm_USHORT nRet, SmartId *pUId, comm_ULONG nNr, comm_String *pString, comm_BOOL bBool );\n\n\/\/ MacroRecorder\n    void GenReturn( comm_USHORT nRet, SmartId *pUId, comm_USHORT nMethod );\n    void GenReturn( comm_USHORT nRet, SmartId *pUId, comm_USHORT nMethod, comm_String *pString );\n    void GenReturn( comm_USHORT nRet, SmartId *pUId, comm_USHORT nMethod, comm_String *pString, comm_BOOL bBool );\n    void GenReturn( comm_USHORT nRet, SmartId *pUId, comm_USHORT nMethod, comm_BOOL bBool );\n    void GenReturn( comm_USHORT nRet, SmartId *pUId, comm_USHORT nMethod, comm_ULONG nNr );\n\n    void Read ( comm_USHORT &nNr );\n    void Read ( comm_ULONG &nNr );\n    void Read (comm_UniChar* &aString, comm_USHORT &nLenInChars );\n    void Read ( comm_BOOL &bBool );\n    comm_USHORT GetNextType();\n\n    void Write( comm_USHORT nNr );\n    void Write( comm_ULONG nNr );\n    void Write( const comm_UniChar* aString, comm_USHORT nLenInChars );\n    void Write( comm_BOOL bBool );\n\n\/\/ Complex Datatypes to be handled system dependent\n    virtual void Read ( comm_String *&pString );\n    virtual void Read ( SmartId* &pId );\n\n    virtual void Write( comm_String *pString );\n    virtual void Write( SmartId* pId );\n};\n\n#endif\n<commit_msg>INTEGRATION: CWS ooo19126 (1.3.72); FILE MERGED 2005\/09\/05 17:17:13 rt 1.3.72.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: cmdbasestream.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-07 19:17:09 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n\/*************************************************************************\n *\n *    ATTENTION\n *    This file is intended to work inside and outside the StarOffice environment.\n *    Only adaption of file commtypes.hxx should be necessary. Else it is a bug!\n *\n ************************************************************************\/\n\n#ifndef _CMDBASESTREAM_HXX_\n#define _CMDBASESTREAM_HXX_\n\n#include \"commtypes.hxx\"\n#include \"icommstream.hxx\"\n\nclass CmdBaseStream\n{\nprotected:\n    ICommStream* pCommStream;\n    CmdBaseStream();\n    virtual ~CmdBaseStream();\n\npublic:\n\n    void GenError( SmartId *pUId, comm_String *pString );\n\n    void GenReturn( comm_USHORT nRet, comm_ULONG nNr );\n    void GenReturn( comm_USHORT nRet, SmartId *pUId, comm_ULONG nNr );\n    void GenReturn( comm_USHORT nRet, SmartId *pUId, comm_String *pString );\n    void GenReturn( comm_USHORT nRet, SmartId *pUId, comm_BOOL bBool );\n    void GenReturn( comm_USHORT nRet, SmartId *pUId, comm_ULONG nNr, comm_String *pString, comm_BOOL bBool );\n\n\/\/ MacroRecorder\n    void GenReturn( comm_USHORT nRet, SmartId *pUId, comm_USHORT nMethod );\n    void GenReturn( comm_USHORT nRet, SmartId *pUId, comm_USHORT nMethod, comm_String *pString );\n    void GenReturn( comm_USHORT nRet, SmartId *pUId, comm_USHORT nMethod, comm_String *pString, comm_BOOL bBool );\n    void GenReturn( comm_USHORT nRet, SmartId *pUId, comm_USHORT nMethod, comm_BOOL bBool );\n    void GenReturn( comm_USHORT nRet, SmartId *pUId, comm_USHORT nMethod, comm_ULONG nNr );\n\n    void Read ( comm_USHORT &nNr );\n    void Read ( comm_ULONG &nNr );\n    void Read (comm_UniChar* &aString, comm_USHORT &nLenInChars );\n    void Read ( comm_BOOL &bBool );\n    comm_USHORT GetNextType();\n\n    void Write( comm_USHORT nNr );\n    void Write( comm_ULONG nNr );\n    void Write( const comm_UniChar* aString, comm_USHORT nLenInChars );\n    void Write( comm_BOOL bBool );\n\n\/\/ Complex Datatypes to be handled system dependent\n    virtual void Read ( comm_String *&pString );\n    virtual void Read ( SmartId* &pId );\n\n    virtual void Write( comm_String *pString );\n    virtual void Write( SmartId* pId );\n};\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include <QSqlError>\n#include <QFile>\n#include <QDataStream>\n#include <QDir>\n#include <QDataStream>\n#include <QUrl>\n#include <fstream>\n#include <iomanip>\n#include \"kernel.h\"\n#include \"ilwisdata.h\"\n#include \"ilwiscontext.h\"\n#include \"errorobject.h\"\n#include \"issuelogger.h\"\n\nusing namespace Ilwis;\n\nstd::map<std::thread::id, bool> IssueLogger::_silentThreads;\n\nIssueObject::IssueObject(QObject* parent) : QObject(parent)\n{\n}\n\nIlwis::IssueObject::IssueObject(const QString &message, int it, quint64 id, QObject *parent) : QObject(parent)\n{\n    _message = message;\n    _itype = it;\n    _itime = QDateTime::currentDateTime();\n    _id = id;\n}\n\nIlwis::IssueObject::IssueObject(const IssueObject& issueobj) {\n    _itime = issueobj._itime;\n    _message = issueobj._message;\n    _id = issueobj._id;\n    _line = issueobj._line;\n    _func = issueobj._func;\n    _file = issueobj._file;\n\n    _itype = issueobj._itype;\n}\n\nIssueObject& IssueObject::operator=(const IssueObject& issueobj) {\n    _itime = issueobj._itime;\n    _message = issueobj._message;\n    _id = issueobj._id;\n    _line = issueobj._line;\n    _func = issueobj._func;\n    _file = issueobj._file;\n\n    _itype = issueobj._itype;\n}\n\nQString Ilwis::IssueObject::message() const\n{\n    return _message;\n}\n\nQDateTime Ilwis::IssueObject::time() const\n{\n    return _itime;\n}\n\nint Ilwis::IssueObject::type() const\n{\n    return _itype;\n}\n\nQString Ilwis::IssueObject::logMessage(Ilwis::IssueObject::LogMessageFormat) const{\n    return QString(\"%1: (%2) %3\").arg(type2String(), _itime.toString(), _message);\n}\n\nint IssueObject::codeLine() const {\n    return _line;\n}\n\nQString IssueObject::codeFunc() const {\n    return _func;\n}\n\nQString IssueObject::codeFile() const {\n    return _file;\n}\n\nvoid IssueObject::addCodeInfo(int line, const QString &func, const QString &file)\n{\n    _line = line;\n    _func = func;\n    _file = file;\n}\n\nvoid IssueObject::stream(std::ofstream& stream, LogMessageFormat frmt) {\n    stream << std::setw(4) << _id << \" ; \" << std::setw(9) << type2String().toStdString() << \" ; \" << std::setw(27)<<_itime.toString().toStdString() << \" ; \" << _message.toStdString() << std::endl;\n    if ( frmt == lmCODE) {\n        stream << std::setw(4) << _id << \" ; \" << _line << \" : \" << _func.toStdString() << \" ; \" << _file.toStdString() << std::endl;\n    }\n}\n\n\n\nquint64 IssueObject::id() const\n{\n    return _id;\n}\n\nQString IssueObject::type2String() const{\n    switch(_itype) {\n    case itCritical:\n        return \"Critical\";\n    case itError:\n        return \"Error\";\n    case itWarning:\n        return \"Warning\";\n    case itMessage:\n        return \"Message\";\n    case itDebug:\n        return \"Debug\";\n    }\n    return \"Text\";\n}\n\n\/\/---------------------------------------------------------------------------\nIssueLogger::IssueLogger(QObject *parent) : QObject(parent), _repeatCount(0)\n{\n    QString apploc= context()->ilwisFolder().absoluteFilePath();\n    apploc += \"\/log\";\n    QDir dir(apploc);\n    if ( !dir.exists())\n        dir.mkdir(apploc);\n    QString rlogFilePath = apploc + \"\/logfile.txt\";\n    QString clogFilePath = apploc + \"\/logfile_ext.txt\";\n    _logFileRegular.open(rlogFilePath.toLatin1());\n    _logFileCode.open(clogFilePath.toLatin1());\n}\n\nIssueLogger::~IssueLogger()\n{\n    if (_logFileCode.is_open())\n        _logFileCode.close();\n    if ( _logFileRegular.is_open())\n        _logFileRegular.close();\n}\n\nquint64 IssueLogger::log(const QString &message, int it)\n{\n    ++_repeatCount;\n    std::thread::id id = std::this_thread::get_id();\n    if ( _silentThreads.find(id)!= _silentThreads.end() && it != IssueObject::itCritical){\n        _repeatCount = 0;\n        return i64UNDEF;\n    }\n\n\n    if ( _lastmessage == message && _repeatCount == 10) {\n        return _issueId;\n    } else {\n        \/\/ Mechanism to prevent(some) 'stuck in a loop' kind of errors.\n        \/\/ this should basically be solved at the place the loop is happening but oversights happen.\n        \/\/ This is a last fallback to break the loop without the need to stop the process\n        if ( _repeatCount > 10 && _lastmessage != message ){\n            _issues.enqueue(IssueObject(QString(\"Message repeated %1 times\").arg(_repeatCount), it, _issueId));\n            _repeatCount = 0;\n            throw ErrorObject(QString(\"Error message cascade : %1\").arg(message));\n        }\n        _repeatCount = 0;\n    }\n\n    _issues.enqueue(IssueObject(message, it, _issueId));\n    if ( _lastmessage == message)\n        return _issueId;\n    IssueObject& obj = _issues.back();\n    if ( _logFileRegular.is_open()) {\n        obj.stream(_logFileRegular, IssueObject::lmREGULAR);\n    }\n    emit updateIssues(obj);\n\n    _lastmessage = message;\n    return _issueId++;\n}\n\nquint64 IssueLogger::log(const QString& objectName, const QString &message, int it)\n{\n    QString newmessage = objectName + \":\" + message;\n    return log(newmessage, it);\n}\n\nvoid IssueLogger::addCodeInfo(quint64 issueid, int line, const QString &func, const QString &file)\n{\n    for(auto iter=_issues.begin(); iter != _issues.end(); ++iter) {\n        IssueObject& issue = *iter;\n        if ( issue.id() == issueid) {\n            issue.addCodeInfo(line, func, file);\n            if ( _logFileCode.is_open()) {\n                issue.stream(_logFileCode, IssueObject::lmCODE);\n            }\n            break;\n        }\n    }\n}\n\nbool IssueLogger::silent() const\n{\n    std::thread::id id = std::this_thread::get_id();\n    auto iter = _silentThreads.find(id);\n    if ( iter != _silentThreads.end())\n        return iter->second;\n    return false;\n}\n\nvoid IssueLogger::silent(bool yesno)\n{\n    std::thread::id id = std::this_thread::get_id();\n    if ( yesno == false){\n        auto iter = _silentThreads.find(id) ;\n        if (iter != _silentThreads.end())\n            _silentThreads.erase(iter);\n    }else\n        _silentThreads[id] = true;\n}\n\nquint64 IssueLogger::logSql(const QSqlError &err)\n{\n   return log(err.text(), IssueObject::itError);\n}\n\nIssueObject::IssueType IssueLogger::maxIssueLevel() const\n{\n    int type = IssueObject::itNone;\n    foreach(IssueObject issue, _issues) {\n        type |= issue.type();\n    }\n    if ( type & IssueObject::itCritical)\n        return IssueObject::itCritical;\n    if ( type & IssueObject::itError)\n        return IssueObject::itError;\n    if ( type & IssueObject::itWarning)\n        return IssueObject::itWarning;\n    if ( type & IssueObject::itMessage)\n        return IssueObject::itMessage;\n    return IssueObject::itNone;\n}\n\nvoid IssueLogger::copy(QList<IssueObject> &other)\n{\n  foreach(IssueObject issue, _issues) {\n      other.append(issue);\n  }\n}\n\nQString IssueLogger::popfirst(int tp) {\n    if ( tp != IssueObject::itAll){\n        for(auto iter= --_issues.end(); iter != _issues.begin(); --iter ){\n            if (hasType((*iter).type(), tp)){\n                QString mes = (*iter).message();\n                _issues.erase(iter);\n                return mes;\n            }\n        }\n    }\n    if ( _issues.size() > 0)\n        return _issues.dequeue().message();\n    return \"?\";\n}\n\nQString IssueLogger::poplast(int tp) {\n    if ( tp != IssueObject::itAll){\n        for(auto iter= _issues.begin(); iter != _issues.end(); ++iter ){\n            if (hasType((*iter).type(), tp)){\n                QString mes = (*iter).message();\n                _issues.erase(iter);\n                return mes;\n            }\n        }\n    }\n    if ( _issues.size() >0 )\n        return _issues.takeLast().message();\n    return \"?\";\n}\n\nvoid IssueLogger::clear() {\n    _issues.clear();\n}\n\n\n\n<commit_msg>added call of empty qobject constructor in copy constructor<commit_after>#include <QSqlError>\n#include <QFile>\n#include <QDataStream>\n#include <QDir>\n#include <QDataStream>\n#include <QUrl>\n#include <fstream>\n#include <iomanip>\n#include \"kernel.h\"\n#include \"ilwisdata.h\"\n#include \"ilwiscontext.h\"\n#include \"errorobject.h\"\n#include \"issuelogger.h\"\n\nusing namespace Ilwis;\n\nstd::map<std::thread::id, bool> IssueLogger::_silentThreads;\n\nIssueObject::IssueObject(QObject* parent) : QObject(parent)\n{\n}\n\nIlwis::IssueObject::IssueObject(const QString &message, int it, quint64 id, QObject *parent) : QObject(parent)\n{\n    _message = message;\n    _itype = it;\n    _itime = QDateTime::currentDateTime();\n    _id = id;\n}\n\nIlwis::IssueObject::IssueObject(const IssueObject& issueobj) : QObject() {\n    _itime = issueobj._itime;\n    _message = issueobj._message;\n    _id = issueobj._id;\n    _line = issueobj._line;\n    _func = issueobj._func;\n    _file = issueobj._file;\n\n    _itype = issueobj._itype;\n}\n\nIssueObject& IssueObject::operator=(const IssueObject& issueobj) {\n    _itime = issueobj._itime;\n    _message = issueobj._message;\n    _id = issueobj._id;\n    _line = issueobj._line;\n    _func = issueobj._func;\n    _file = issueobj._file;\n\n    _itype = issueobj._itype;\n\n    return *this;\n}\n\nQString Ilwis::IssueObject::message() const\n{\n    return _message;\n}\n\nQDateTime Ilwis::IssueObject::time() const\n{\n    return _itime;\n}\n\nint Ilwis::IssueObject::type() const\n{\n    return _itype;\n}\n\nQString Ilwis::IssueObject::logMessage(Ilwis::IssueObject::LogMessageFormat) const{\n    return QString(\"%1: (%2) %3\").arg(type2String(), _itime.toString(), _message);\n}\n\nint IssueObject::codeLine() const {\n    return _line;\n}\n\nQString IssueObject::codeFunc() const {\n    return _func;\n}\n\nQString IssueObject::codeFile() const {\n    return _file;\n}\n\nvoid IssueObject::addCodeInfo(int line, const QString &func, const QString &file)\n{\n    _line = line;\n    _func = func;\n    _file = file;\n}\n\nvoid IssueObject::stream(std::ofstream& stream, LogMessageFormat frmt) {\n    stream << std::setw(4) << _id << \" ; \" << std::setw(9) << type2String().toStdString() << \" ; \" << std::setw(27)<<_itime.toString().toStdString() << \" ; \" << _message.toStdString() << std::endl;\n    if ( frmt == lmCODE) {\n        stream << std::setw(4) << _id << \" ; \" << _line << \" : \" << _func.toStdString() << \" ; \" << _file.toStdString() << std::endl;\n    }\n}\n\n\n\nquint64 IssueObject::id() const\n{\n    return _id;\n}\n\nQString IssueObject::type2String() const{\n    switch(_itype) {\n    case itCritical:\n        return \"Critical\";\n    case itError:\n        return \"Error\";\n    case itWarning:\n        return \"Warning\";\n    case itMessage:\n        return \"Message\";\n    case itDebug:\n        return \"Debug\";\n    }\n    return \"Text\";\n}\n\n\/\/---------------------------------------------------------------------------\nIssueLogger::IssueLogger(QObject *parent) : QObject(parent), _repeatCount(0)\n{\n    QString apploc= context()->ilwisFolder().absoluteFilePath();\n    apploc += \"\/log\";\n    QDir dir(apploc);\n    if ( !dir.exists())\n        dir.mkdir(apploc);\n    QString rlogFilePath = apploc + \"\/logfile.txt\";\n    QString clogFilePath = apploc + \"\/logfile_ext.txt\";\n    _logFileRegular.open(rlogFilePath.toLatin1());\n    _logFileCode.open(clogFilePath.toLatin1());\n}\n\nIssueLogger::~IssueLogger()\n{\n    if (_logFileCode.is_open())\n        _logFileCode.close();\n    if ( _logFileRegular.is_open())\n        _logFileRegular.close();\n}\n\nquint64 IssueLogger::log(const QString &message, int it)\n{\n    ++_repeatCount;\n    std::thread::id id = std::this_thread::get_id();\n    if ( _silentThreads.find(id)!= _silentThreads.end() && it != IssueObject::itCritical){\n        _repeatCount = 0;\n        return i64UNDEF;\n    }\n\n\n    if ( _lastmessage == message && _repeatCount == 10) {\n        return _issueId;\n    } else {\n        \/\/ Mechanism to prevent(some) 'stuck in a loop' kind of errors.\n        \/\/ this should basically be solved at the place the loop is happening but oversights happen.\n        \/\/ This is a last fallback to break the loop without the need to stop the process\n        if ( _repeatCount > 10 && _lastmessage != message ){\n            _issues.enqueue(IssueObject(QString(\"Message repeated %1 times\").arg(_repeatCount), it, _issueId));\n            _repeatCount = 0;\n            throw ErrorObject(QString(\"Error message cascade : %1\").arg(message));\n        }\n        _repeatCount = 0;\n    }\n\n    _issues.enqueue(IssueObject(message, it, _issueId));\n    if ( _lastmessage == message)\n        return _issueId;\n    IssueObject& obj = _issues.back();\n    if ( _logFileRegular.is_open()) {\n        obj.stream(_logFileRegular, IssueObject::lmREGULAR);\n    }\n    emit updateIssues(obj);\n\n    _lastmessage = message;\n    return _issueId++;\n}\n\nquint64 IssueLogger::log(const QString& objectName, const QString &message, int it)\n{\n    QString newmessage = objectName + \":\" + message;\n    return log(newmessage, it);\n}\n\nvoid IssueLogger::addCodeInfo(quint64 issueid, int line, const QString &func, const QString &file)\n{\n    for(auto iter=_issues.begin(); iter != _issues.end(); ++iter) {\n        IssueObject& issue = *iter;\n        if ( issue.id() == issueid) {\n            issue.addCodeInfo(line, func, file);\n            if ( _logFileCode.is_open()) {\n                issue.stream(_logFileCode, IssueObject::lmCODE);\n            }\n            break;\n        }\n    }\n}\n\nbool IssueLogger::silent() const\n{\n    std::thread::id id = std::this_thread::get_id();\n    auto iter = _silentThreads.find(id);\n    if ( iter != _silentThreads.end())\n        return iter->second;\n    return false;\n}\n\nvoid IssueLogger::silent(bool yesno)\n{\n    std::thread::id id = std::this_thread::get_id();\n    if ( yesno == false){\n        auto iter = _silentThreads.find(id) ;\n        if (iter != _silentThreads.end())\n            _silentThreads.erase(iter);\n    }else\n        _silentThreads[id] = true;\n}\n\nquint64 IssueLogger::logSql(const QSqlError &err)\n{\n   return log(err.text(), IssueObject::itError);\n}\n\nIssueObject::IssueType IssueLogger::maxIssueLevel() const\n{\n    int type = IssueObject::itNone;\n    foreach(IssueObject issue, _issues) {\n        type |= issue.type();\n    }\n    if ( type & IssueObject::itCritical)\n        return IssueObject::itCritical;\n    if ( type & IssueObject::itError)\n        return IssueObject::itError;\n    if ( type & IssueObject::itWarning)\n        return IssueObject::itWarning;\n    if ( type & IssueObject::itMessage)\n        return IssueObject::itMessage;\n    return IssueObject::itNone;\n}\n\nvoid IssueLogger::copy(QList<IssueObject> &other)\n{\n  foreach(IssueObject issue, _issues) {\n      other.append(issue);\n  }\n}\n\nQString IssueLogger::popfirst(int tp) {\n    if ( tp != IssueObject::itAll){\n        for(auto iter= --_issues.end(); iter != _issues.begin(); --iter ){\n            if (hasType((*iter).type(), tp)){\n                QString mes = (*iter).message();\n                _issues.erase(iter);\n                return mes;\n            }\n        }\n    }\n    if ( _issues.size() > 0)\n        return _issues.dequeue().message();\n    return \"?\";\n}\n\nQString IssueLogger::poplast(int tp) {\n    if ( tp != IssueObject::itAll){\n        for(auto iter= _issues.begin(); iter != _issues.end(); ++iter ){\n            if (hasType((*iter).type(), tp)){\n                QString mes = (*iter).message();\n                _issues.erase(iter);\n                return mes;\n            }\n        }\n    }\n    if ( _issues.size() >0 )\n        return _issues.takeLast().message();\n    return \"?\";\n}\n\nvoid IssueLogger::clear() {\n    _issues.clear();\n}\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2014 The Caroline authors. All rights reserved.\n\/\/ Use of this source file is governed by a MIT license that can be found in the\n\/\/ LICENSE file.\n\/\/\/ @author Glazachev Vladimir <glazachev.vladimir@gmail.com>\n\n#include \"core\/metric_impls.h\"\n\n#include \"base\/logging.h\"\n#include \"opencv2\/core\/core.hpp\"\n\nnamespace core {\n\nnamespace stat {\n\nlong double Mean::compute(const std::vector<cv::Mat> &src) {\n  if (src.size() != 1) {\n    LOG(INFO) << \"Compute metric error. Need one matrices to compute.\";\n  }\n\n  cv::Scalar sd;\n  cv::Scalar mean;\n  cv::meanStdDev(src.at(0), mean, sd);\n\n  long double temp = mean[0];\n\n  LOG(INFO) << \"Compute metric = \" << temp;\n  return temp;\n}\n\nlong double SimpleDist::compute(const std::vector<cv::Mat> &src) {\n  if (src.size() != 2) {\n    LOG(INFO) << \"Compute metric error. Need two matrices to compute.\";\n  }\n  cv::Mat m1 = src.at(0);\n  cv::Mat m2 = src.at(1);\n\n  cv::Mat temp1;\n  cv::Mat temp2;\n  m1.convertTo(temp1, CV_32F);\n  m2.convertTo(temp2, CV_32F);\n  cv::multiply(temp1, temp1, temp1);\n  cv::multiply(temp2, temp2, temp2);\n\n  cv::Mat dst;\n  cv::absdiff(temp1, temp2, dst);\n  cv::sqrt(dst, dst);\n  long double temp = cv::sum(dst)[0];\n\n  LOG(INFO) << \"computed metric = \" << temp;\n  return temp;\n}\n\nlong double RSquare::compute(const std::vector<cv::Mat> &src) {\n  if (src.size() != 2) {\n    LOG(INFO) << \"Compute metric error. Need two matrices to compute.\";\n  }\n  cv::Mat m1 = src.at(0);\n  cv::Mat m2 = src.at(1);\n\n  cv::Mat temp1;\n  cv::Mat temp2;\n  m1.convertTo(temp1, CV_32F);\n  m2.convertTo(temp2, CV_32F);\n\n  cv::Scalar sd;\n  cv::Scalar mean;\n  cv::Scalar sdDiff;\n  cv::Scalar meanDiff;\n  cv::meanStdDev(m1, mean, sd);\n  cv::meanStdDev(m1 - m2, meanDiff, sdDiff);\n  long double temp = (1 - sdDiff[0] \/ sd[0]);\n\n  LOG(INFO) << \"Compute metric = \" << temp;\n  return temp;\n}\n\n}  \/\/ namespace stat\n\n}  \/\/ namespace core\n<commit_msg>CAROLINE-1: log type fix<commit_after>\/\/ Copyright (c) 2014 The Caroline authors. All rights reserved.\n\/\/ Use of this source file is governed by a MIT license that can be found in the\n\/\/ LICENSE file.\n\/\/\/ @author Glazachev Vladimir <glazachev.vladimir@gmail.com>\n\n#include \"core\/metric_impls.h\"\n\n#include \"base\/logging.h\"\n#include \"opencv2\/core\/core.hpp\"\n\nnamespace core {\n\nnamespace stat {\n\nlong double Mean::compute(const std::vector<cv::Mat> &src) {\n  if (src.size() != 1) {\n    LOG(WARNING) << \"Compute metric error. Need one matrices to compute.\";\n  }\n\n  cv::Scalar sd;\n  cv::Scalar mean;\n  cv::meanStdDev(src.at(0), mean, sd);\n\n  long double temp = mean[0];\n\n  LOG(INFO) << \"Compute metric = \" << temp;\n  return temp;\n}\n\nlong double SimpleDist::compute(const std::vector<cv::Mat> &src) {\n  if (src.size() != 2) {\n    LOG(WARNING) << \"Compute metric error. Need two matrices to compute.\";\n  }\n  cv::Mat m1 = src.at(0);\n  cv::Mat m2 = src.at(1);\n\n  cv::Mat temp1;\n  cv::Mat temp2;\n  m1.convertTo(temp1, CV_32F);\n  m2.convertTo(temp2, CV_32F);\n  cv::multiply(temp1, temp1, temp1);\n  cv::multiply(temp2, temp2, temp2);\n\n  cv::Mat dst;\n  cv::absdiff(temp1, temp2, dst);\n  cv::sqrt(dst, dst);\n  long double temp = cv::sum(dst)[0];\n\n  LOG(INFO) << \"computed metric = \" << temp;\n  return temp;\n}\n\nlong double RSquare::compute(const std::vector<cv::Mat> &src) {\n  if (src.size() != 2) {\n    LOG(WARNING) << \"Compute metric error. Need two matrices to compute.\";\n  }\n  cv::Mat m1 = src.at(0);\n  cv::Mat m2 = src.at(1);\n\n  cv::Mat temp1;\n  cv::Mat temp2;\n  m1.convertTo(temp1, CV_32F);\n  m2.convertTo(temp2, CV_32F);\n\n  cv::Scalar sd;\n  cv::Scalar mean;\n  cv::Scalar sdDiff;\n  cv::Scalar meanDiff;\n  cv::meanStdDev(m1, mean, sd);\n  cv::meanStdDev(m1 - m2, meanDiff, sdDiff);\n  long double temp = (1 - sdDiff[0] \/ sd[0]);\n\n  LOG(INFO) << \"Compute metric = \" << temp;\n  return temp;\n}\n\n}  \/\/ namespace stat\n\n}  \/\/ namespace core\n<|endoftext|>"}
{"text":"<commit_before>#include \"cvm.h\"\n\nvoid DabValue::dump(FILE *file) const\n{\n    if (!file)\n    {\n        file = $VM->options.console;\n    }\n\n    static const char *types[] = {\"INVA\", \"FIXN\", \"BOOL\", \"NIL \", \"CLAS\", \"OBJE\", \"ARRY\",\n                                  \"UIN8\", \"UI16\", \"UI32\", \"UI64\", \"INT8\", \"IN16\", \"IN32\",\n                                  \"IN64\", \"METH\", \"PTR*\", \"BYT*\", \"CSTR\", \"DSTR\"};\n    assert((int)data.type >= 0 && (int)data.type < (int)countof(types));\n    fprintf(file, \"%s \", types[data.type]);\n    print(file, true);\n}\n\ndab_class_t DabValue::class_index() const\n{\n    switch (data.type)\n    {\n    case TYPE_FIXNUM:\n        return CLASS_FIXNUM;\n        break;\n    case TYPE_BOOLEAN:\n        return CLASS_BOOLEAN;\n        break;\n    case TYPE_NIL:\n        return CLASS_NILCLASS;\n        break;\n    case TYPE_ARRAY:\n        return CLASS_ARRAY;\n        break;\n    case TYPE_CLASS:\n        return (dab_class_t)data.fixnum;\n        break;\n    case TYPE_OBJECT:\n        return (dab_class_t)this->data.object->object->klass;\n        break;\n    case TYPE_UINT8:\n        return CLASS_UINT8;\n        break;\n    case TYPE_UINT16:\n        return CLASS_UINT16;\n        break;\n    case TYPE_UINT32:\n        return CLASS_UINT32;\n        break;\n    case TYPE_UINT64:\n        return CLASS_UINT64;\n        break;\n    case TYPE_INT8:\n        return CLASS_INT8;\n        break;\n    case TYPE_INT16:\n        return CLASS_INT16;\n        break;\n    case TYPE_INT32:\n        return CLASS_INT32;\n        break;\n    case TYPE_INT64:\n        return CLASS_INT64;\n        break;\n    case TYPE_METHOD:\n        return CLASS_METHOD;\n        break;\n    case TYPE_INTPTR:\n        return CLASS_INTPTR;\n        break;\n    case TYPE_BYTEBUFFER:\n        return CLASS_BYTEBUFFER;\n        break;\n    case TYPE_LITERALSTRING:\n        return CLASS_LITERALSTRING;\n        break;\n    case TYPE_DYNAMICSTRING:\n        return CLASS_DYNAMICSTRING;\n        break;\n    default:\n        char description[256];\n        snprintf(description, sizeof(description), \"Unknown data.type %d.\\n\", (int)data.type);\n        throw DabRuntimeError(description);\n    }\n}\n\nstd::string DabValue::class_name() const\n{\n    return get_class().name;\n}\n\nDabClass &DabValue::get_class() const\n{\n    return $VM->get_class(class_index());\n}\n\nbool DabValue::is_a(const DabClass &klass) const\n{\n    return get_class().is_subclass_of(klass);\n}\n\nvoid DabValue::print(FILE *out, bool debug) const\n{\n    fprintf(out, \"%s\", print_value(debug).c_str());\n}\n\nstd::string DabValue::print_value(bool debug) const\n{\n    char        buffer[32] = {0};\n    std::string ret;\n    bool        use_ret = false;\n    switch (data.type)\n    {\n    case TYPE_FIXNUM:\n        snprintf(buffer, sizeof(buffer), \"%\" PRId64, data.fixnum);\n        break;\n    case TYPE_UINT8:\n        snprintf(buffer, sizeof(buffer), \"%\" PRIu8, data.num_uint8);\n        break;\n    case TYPE_UINT16:\n        snprintf(buffer, sizeof(buffer), \"%\" PRIu16, data.num_uint16);\n        break;\n    case TYPE_UINT32:\n        snprintf(buffer, sizeof(buffer), \"%\" PRIu32, data.num_uint32);\n        break;\n    case TYPE_UINT64:\n        snprintf(buffer, sizeof(buffer), \"%\" PRIu64, data.num_uint64);\n        break;\n    case TYPE_INT8:\n        snprintf(buffer, sizeof(buffer), \"%\" PRId8, data.num_int8);\n        break;\n    case TYPE_INT16:\n        snprintf(buffer, sizeof(buffer), \"%\" PRId16, data.num_int16);\n        break;\n    case TYPE_INT32:\n        snprintf(buffer, sizeof(buffer), \"%\" PRId32, data.num_int32);\n        break;\n    case TYPE_INT64:\n        snprintf(buffer, sizeof(buffer), \"%\" PRId64, data.num_int64);\n        break;\n    case TYPE_BOOLEAN:\n        snprintf(buffer, sizeof(buffer), \"%s\", data.boolean ? \"true\" : \"false\");\n        break;\n    case TYPE_NIL:\n        snprintf(buffer, sizeof(buffer), \"nil\");\n        break;\n    case TYPE_CLASS:\n        snprintf(buffer, sizeof(buffer), \"%s\", class_name().c_str());\n        break;\n    case TYPE_OBJECT:\n        snprintf(buffer, sizeof(buffer), \"#%s\", class_name().c_str());\n        break;\n    case TYPE_INTPTR:\n        snprintf(buffer, sizeof(buffer), \"%p\", data.intptr);\n        break;\n    case TYPE_ARRAY:\n    {\n        use_ret  = true;\n        ret      = \"[\";\n        size_t i = 0;\n        for (auto &item : array())\n        {\n            if (i)\n                ret += \", \";\n            ret += item.print_value(debug);\n            i++;\n        }\n        ret += \"]\";\n    }\n    break;\n    case TYPE_LITERALSTRING:\n    case TYPE_DYNAMICSTRING:\n    {\n        use_ret = true;\n        ret     = string();\n        if (debug)\n        {\n            ret = \"\\\"\" + ret + \"\\\"\";\n        }\n    }\n    break;\n    default:\n        snprintf(buffer, sizeof(buffer), \"?\");\n        break;\n    }\n    if (!use_ret)\n    {\n        ret = buffer;\n    }\n    if (debug && is_object())\n    {\n        char extra[64] = {0};\n        snprintf(extra, sizeof(extra), \" [%d strong]\", (int)data.object->count_strong);\n        ret += extra;\n    }\n    return ret;\n}\n\nstd::vector<DabValue> &DabValue::array() const\n{\n    assert(data.type == TYPE_ARRAY);\n    auto *obj = (DabArray *)data.object->object;\n    return obj->array;\n}\n\nstd::vector<uint8_t> &DabValue::bytebuffer() const\n{\n    assert(data.type == TYPE_BYTEBUFFER);\n    auto *obj = (DabByteBuffer *)data.object->object;\n    return obj->bytebuffer;\n}\n\nstd::string DabValue::literal_string() const\n{\n    assert(data.type == TYPE_LITERALSTRING);\n    auto *obj = (DabLiteralString *)data.object->object;\n    return std::string(obj->pointer, (size_t)obj->length);\n}\n\nstd::string DabValue::dynamic_string() const\n{\n    assert(data.type == TYPE_DYNAMICSTRING);\n    auto *obj = (DabDynamicString *)data.object->object;\n    return obj->value;\n}\n\nstd::string DabValue::string() const\n{\n    bool dynamic = data.type == TYPE_DYNAMICSTRING;\n    bool literal = data.type == TYPE_LITERALSTRING;\n    bool method  = data.type == TYPE_METHOD;\n    assert(literal || method || dynamic);\n    if (method)\n    {\n        return $VM->get_symbol(data.fixnum);\n    }\n    else if (dynamic)\n    {\n        return dynamic_string();\n    }\n    else\n    {\n        return literal_string();\n    }\n}\n\nbool DabValue::truthy() const\n{\n    switch (data.type)\n    {\n    case TYPE_FIXNUM:\n        return data.fixnum;\n    case TYPE_UINT8:\n        return data.num_uint8;\n    case TYPE_UINT32:\n        return data.num_uint32;\n    case TYPE_UINT64:\n        return data.num_uint64;\n    case TYPE_INT32:\n        return data.num_int32;\n    case TYPE_BOOLEAN:\n        return data.boolean;\n    case TYPE_INTPTR:\n        return data.intptr;\n    case TYPE_NIL:\n        return false;\n    case TYPE_ARRAY:\n        return array().size() > 0;\n    case TYPE_LITERALSTRING:\n        return literal_string().length();\n    case TYPE_DYNAMICSTRING:\n        return dynamic_string().length();\n    default:\n        return true;\n    }\n}\n\nDabValue DabValue::create_instance() const\n{\n    assert(data.type == TYPE_CLASS);\n\n    DabBaseObject *object = nullptr;\n    auto           type   = TYPE_OBJECT;\n    if (data.fixnum == CLASS_ARRAY)\n    {\n        object = new DabArray;\n        type   = TYPE_ARRAY;\n    }\n    else if (data.fixnum == CLASS_BYTEBUFFER)\n    {\n        object = new DabByteBuffer;\n        type   = TYPE_BYTEBUFFER;\n    }\n    else if (data.fixnum == CLASS_LITERALSTRING)\n    {\n        object = new DabLiteralString;\n        type   = TYPE_LITERALSTRING;\n    }\n    else if (data.fixnum == CLASS_DYNAMICSTRING)\n    {\n        object = new DabDynamicString;\n        type   = TYPE_DYNAMICSTRING;\n    }\n    else\n    {\n        object = new DabObject;\n    }\n\n    DabObjectProxy *proxy = new DabObjectProxy;\n    proxy->object         = object;\n    proxy->count_strong   = 1;\n    proxy->object->klass  = this->data.fixnum;\n\n    DabValue ret;\n    ret.data.type   = type;\n    ret.data.object = proxy;\n\n    if ($VM->options.verbose)\n    {\n        fprintf(stderr, \"vm: proxy %p A (strong %3d): ! created : \", proxy,\n                (int)proxy->count_strong);\n        ret.dump(stderr);\n        fprintf(stderr, \"\\n\");\n    }\n\n    return ret;\n}\n\nDabValue DabValue::allocate_dynstr(const char *str)\n{\n    DabValue klass = $VM->get_class(CLASS_DYNAMICSTRING);\n\n    auto ret = klass.create_instance();\n\n    auto *obj = (DabDynamicString *)ret.data.object->object;\n\n    obj->value = str;\n    return ret;\n}\n\nDabValue DabValue::_get_instvar(dab_symbol_t symbol)\n{\n    assert(this->data.type == TYPE_OBJECT);\n    assert(this->data.object);\n\n    if (!this->data.object->object)\n    {\n        return DabValue(nullptr);\n    }\n\n    auto  object   = (DabObject *)this->data.object->object;\n    auto &instvars = object->instvars;\n\n    if (!instvars.count(symbol))\n    {\n        return DabValue(nullptr);\n    }\n    return instvars[symbol];\n}\n\nDabValue DabValue::get_instvar(dab_symbol_t symbol)\n{\n    auto ret = _get_instvar(symbol);\n    if ($VM->options.verbose)\n    {\n        auto name = $VM->get_symbol(symbol);\n\n        fprintf(stderr, \"vm: proxy %p (strong %d): Get instvar <%s> -> \", this->data.object,\n                (int)this->data.object->count_strong, name.c_str());\n        ret.print(stderr);\n        fprintf(stderr, \"\\n\");\n    }\n    return ret;\n}\n\nvoid DabValue::set_instvar(dab_symbol_t symbol, const DabValue &value)\n{\n    assert(this->data.type == TYPE_OBJECT);\n    assert(this->data.object);\n\n    if ($VM->options.verbose)\n    {\n        auto name = $VM->get_symbol(symbol);\n\n        fprintf(stderr, \"vm: proxy %p (strong %d): Set instvar <%s> to \", this->data.object,\n                (int)this->data.object->count_strong, name.c_str());\n        value.print(stderr);\n        fprintf(stderr, \"\\n\");\n    }\n\n    if (!this->data.object->object)\n    {\n        return;\n    }\n\n    auto  object     = (DabObject *)this->data.object->object;\n    auto &instvars   = object->instvars;\n    instvars[symbol] = value;\n}\n\nvoid DabValue::set_data(const DabValueData &other_data)\n{\n    data = other_data;\n    if ($VM->options.autorelease)\n    {\n        retain();\n    }\n}\n\nDabValue::DabValue(const DabValue &other)\n{\n    set_data(other.data);\n}\n\nDabValue &DabValue::operator=(const DabValue &other)\n{\n    set_data(other.data);\n    return *this;\n}\n\nDabValue::~DabValue()\n{\n    if ($VM->options.autorelease)\n    {\n        release();\n    }\n}\n\nvoid DabValue::release()\n{\n    if (is_object())\n    {\n        this->data.object->release(this);\n        this->data.object = nullptr;\n    }\n    this->data.type        = TYPE_NIL;\n    this->data._initialize = 0;\n}\n\nvoid DabValue::retain()\n{\n    if (is_object())\n    {\n        data.object->retain(this);\n    }\n}\n\n\/\/\n\nvoid DabObjectProxy::retain(DabValue *value)\n{\n    (void)value;\n    if (this->destroying)\n        return;\n    count_strong += 1;\n    if ($VM->options.verbose)\n    {\n        fprintf(stderr, \"vm: proxy %p B (strong %3d): + retained: \", this, (int)this->count_strong);\n        value->dump(stderr);\n        fprintf(stderr, \"\\n\");\n    }\n}\n\nvoid DabObjectProxy::release(DabValue *value)\n{\n    if (this->destroying)\n        return;\n    count_strong -= 1;\n    if ($VM->options.verbose)\n    {\n        fprintf(stderr, \"vm: proxy %p B (strong %3d): - released: \", this, (int)this->count_strong);\n        value->dump(stderr);\n        fprintf(stderr, \"\\n\");\n    }\n    if (count_strong == 0)\n    {\n        destroy(value);\n    }\n}\n\nvoid DabObjectProxy::destroy(DabValue *value)\n{\n    (void)value;\n    this->destroying = true;\n    if ($VM->options.verbose)\n    {\n        fprintf(stderr, \"vm: proxy %p C (strong %3d): X destroy\\n\", this, (int)this->count_strong);\n    }\n    delete object;\n    delete this;\n}\n\nsize_t DabValue::use_count() const\n{\n    if (is_object())\n    {\n        return data.object->count_strong;\n    }\n    else\n    {\n        return 65535;\n    }\n}\n<commit_msg>vm: fix dab_symbol_t cast in DabValue::string<commit_after>#include \"cvm.h\"\n\nvoid DabValue::dump(FILE *file) const\n{\n    if (!file)\n    {\n        file = $VM->options.console;\n    }\n\n    static const char *types[] = {\"INVA\", \"FIXN\", \"BOOL\", \"NIL \", \"CLAS\", \"OBJE\", \"ARRY\",\n                                  \"UIN8\", \"UI16\", \"UI32\", \"UI64\", \"INT8\", \"IN16\", \"IN32\",\n                                  \"IN64\", \"METH\", \"PTR*\", \"BYT*\", \"CSTR\", \"DSTR\"};\n    assert((int)data.type >= 0 && (int)data.type < (int)countof(types));\n    fprintf(file, \"%s \", types[data.type]);\n    print(file, true);\n}\n\ndab_class_t DabValue::class_index() const\n{\n    switch (data.type)\n    {\n    case TYPE_FIXNUM:\n        return CLASS_FIXNUM;\n        break;\n    case TYPE_BOOLEAN:\n        return CLASS_BOOLEAN;\n        break;\n    case TYPE_NIL:\n        return CLASS_NILCLASS;\n        break;\n    case TYPE_ARRAY:\n        return CLASS_ARRAY;\n        break;\n    case TYPE_CLASS:\n        return (dab_class_t)data.fixnum;\n        break;\n    case TYPE_OBJECT:\n        return (dab_class_t)this->data.object->object->klass;\n        break;\n    case TYPE_UINT8:\n        return CLASS_UINT8;\n        break;\n    case TYPE_UINT16:\n        return CLASS_UINT16;\n        break;\n    case TYPE_UINT32:\n        return CLASS_UINT32;\n        break;\n    case TYPE_UINT64:\n        return CLASS_UINT64;\n        break;\n    case TYPE_INT8:\n        return CLASS_INT8;\n        break;\n    case TYPE_INT16:\n        return CLASS_INT16;\n        break;\n    case TYPE_INT32:\n        return CLASS_INT32;\n        break;\n    case TYPE_INT64:\n        return CLASS_INT64;\n        break;\n    case TYPE_METHOD:\n        return CLASS_METHOD;\n        break;\n    case TYPE_INTPTR:\n        return CLASS_INTPTR;\n        break;\n    case TYPE_BYTEBUFFER:\n        return CLASS_BYTEBUFFER;\n        break;\n    case TYPE_LITERALSTRING:\n        return CLASS_LITERALSTRING;\n        break;\n    case TYPE_DYNAMICSTRING:\n        return CLASS_DYNAMICSTRING;\n        break;\n    default:\n        char description[256];\n        snprintf(description, sizeof(description), \"Unknown data.type %d.\\n\", (int)data.type);\n        throw DabRuntimeError(description);\n    }\n}\n\nstd::string DabValue::class_name() const\n{\n    return get_class().name;\n}\n\nDabClass &DabValue::get_class() const\n{\n    return $VM->get_class(class_index());\n}\n\nbool DabValue::is_a(const DabClass &klass) const\n{\n    return get_class().is_subclass_of(klass);\n}\n\nvoid DabValue::print(FILE *out, bool debug) const\n{\n    fprintf(out, \"%s\", print_value(debug).c_str());\n}\n\nstd::string DabValue::print_value(bool debug) const\n{\n    char        buffer[32] = {0};\n    std::string ret;\n    bool        use_ret = false;\n    switch (data.type)\n    {\n    case TYPE_FIXNUM:\n        snprintf(buffer, sizeof(buffer), \"%\" PRId64, data.fixnum);\n        break;\n    case TYPE_UINT8:\n        snprintf(buffer, sizeof(buffer), \"%\" PRIu8, data.num_uint8);\n        break;\n    case TYPE_UINT16:\n        snprintf(buffer, sizeof(buffer), \"%\" PRIu16, data.num_uint16);\n        break;\n    case TYPE_UINT32:\n        snprintf(buffer, sizeof(buffer), \"%\" PRIu32, data.num_uint32);\n        break;\n    case TYPE_UINT64:\n        snprintf(buffer, sizeof(buffer), \"%\" PRIu64, data.num_uint64);\n        break;\n    case TYPE_INT8:\n        snprintf(buffer, sizeof(buffer), \"%\" PRId8, data.num_int8);\n        break;\n    case TYPE_INT16:\n        snprintf(buffer, sizeof(buffer), \"%\" PRId16, data.num_int16);\n        break;\n    case TYPE_INT32:\n        snprintf(buffer, sizeof(buffer), \"%\" PRId32, data.num_int32);\n        break;\n    case TYPE_INT64:\n        snprintf(buffer, sizeof(buffer), \"%\" PRId64, data.num_int64);\n        break;\n    case TYPE_BOOLEAN:\n        snprintf(buffer, sizeof(buffer), \"%s\", data.boolean ? \"true\" : \"false\");\n        break;\n    case TYPE_NIL:\n        snprintf(buffer, sizeof(buffer), \"nil\");\n        break;\n    case TYPE_CLASS:\n        snprintf(buffer, sizeof(buffer), \"%s\", class_name().c_str());\n        break;\n    case TYPE_OBJECT:\n        snprintf(buffer, sizeof(buffer), \"#%s\", class_name().c_str());\n        break;\n    case TYPE_INTPTR:\n        snprintf(buffer, sizeof(buffer), \"%p\", data.intptr);\n        break;\n    case TYPE_ARRAY:\n    {\n        use_ret  = true;\n        ret      = \"[\";\n        size_t i = 0;\n        for (auto &item : array())\n        {\n            if (i)\n                ret += \", \";\n            ret += item.print_value(debug);\n            i++;\n        }\n        ret += \"]\";\n    }\n    break;\n    case TYPE_LITERALSTRING:\n    case TYPE_DYNAMICSTRING:\n    {\n        use_ret = true;\n        ret     = string();\n        if (debug)\n        {\n            ret = \"\\\"\" + ret + \"\\\"\";\n        }\n    }\n    break;\n    default:\n        snprintf(buffer, sizeof(buffer), \"?\");\n        break;\n    }\n    if (!use_ret)\n    {\n        ret = buffer;\n    }\n    if (debug && is_object())\n    {\n        char extra[64] = {0};\n        snprintf(extra, sizeof(extra), \" [%d strong]\", (int)data.object->count_strong);\n        ret += extra;\n    }\n    return ret;\n}\n\nstd::vector<DabValue> &DabValue::array() const\n{\n    assert(data.type == TYPE_ARRAY);\n    auto *obj = (DabArray *)data.object->object;\n    return obj->array;\n}\n\nstd::vector<uint8_t> &DabValue::bytebuffer() const\n{\n    assert(data.type == TYPE_BYTEBUFFER);\n    auto *obj = (DabByteBuffer *)data.object->object;\n    return obj->bytebuffer;\n}\n\nstd::string DabValue::literal_string() const\n{\n    assert(data.type == TYPE_LITERALSTRING);\n    auto *obj = (DabLiteralString *)data.object->object;\n    return std::string(obj->pointer, (size_t)obj->length);\n}\n\nstd::string DabValue::dynamic_string() const\n{\n    assert(data.type == TYPE_DYNAMICSTRING);\n    auto *obj = (DabDynamicString *)data.object->object;\n    return obj->value;\n}\n\nstd::string DabValue::string() const\n{\n    bool dynamic = data.type == TYPE_DYNAMICSTRING;\n    bool literal = data.type == TYPE_LITERALSTRING;\n    bool method  = data.type == TYPE_METHOD;\n    assert(literal || method || dynamic);\n    if (method)\n    {\n        return $VM->get_symbol((dab_symbol_t)data.fixnum);\n    }\n    else if (dynamic)\n    {\n        return dynamic_string();\n    }\n    else\n    {\n        return literal_string();\n    }\n}\n\nbool DabValue::truthy() const\n{\n    switch (data.type)\n    {\n    case TYPE_FIXNUM:\n        return data.fixnum;\n    case TYPE_UINT8:\n        return data.num_uint8;\n    case TYPE_UINT32:\n        return data.num_uint32;\n    case TYPE_UINT64:\n        return data.num_uint64;\n    case TYPE_INT32:\n        return data.num_int32;\n    case TYPE_BOOLEAN:\n        return data.boolean;\n    case TYPE_INTPTR:\n        return data.intptr;\n    case TYPE_NIL:\n        return false;\n    case TYPE_ARRAY:\n        return array().size() > 0;\n    case TYPE_LITERALSTRING:\n        return literal_string().length();\n    case TYPE_DYNAMICSTRING:\n        return dynamic_string().length();\n    default:\n        return true;\n    }\n}\n\nDabValue DabValue::create_instance() const\n{\n    assert(data.type == TYPE_CLASS);\n\n    DabBaseObject *object = nullptr;\n    auto           type   = TYPE_OBJECT;\n    if (data.fixnum == CLASS_ARRAY)\n    {\n        object = new DabArray;\n        type   = TYPE_ARRAY;\n    }\n    else if (data.fixnum == CLASS_BYTEBUFFER)\n    {\n        object = new DabByteBuffer;\n        type   = TYPE_BYTEBUFFER;\n    }\n    else if (data.fixnum == CLASS_LITERALSTRING)\n    {\n        object = new DabLiteralString;\n        type   = TYPE_LITERALSTRING;\n    }\n    else if (data.fixnum == CLASS_DYNAMICSTRING)\n    {\n        object = new DabDynamicString;\n        type   = TYPE_DYNAMICSTRING;\n    }\n    else\n    {\n        object = new DabObject;\n    }\n\n    DabObjectProxy *proxy = new DabObjectProxy;\n    proxy->object         = object;\n    proxy->count_strong   = 1;\n    proxy->object->klass  = this->data.fixnum;\n\n    DabValue ret;\n    ret.data.type   = type;\n    ret.data.object = proxy;\n\n    if ($VM->options.verbose)\n    {\n        fprintf(stderr, \"vm: proxy %p A (strong %3d): ! created : \", proxy,\n                (int)proxy->count_strong);\n        ret.dump(stderr);\n        fprintf(stderr, \"\\n\");\n    }\n\n    return ret;\n}\n\nDabValue DabValue::allocate_dynstr(const char *str)\n{\n    DabValue klass = $VM->get_class(CLASS_DYNAMICSTRING);\n\n    auto ret = klass.create_instance();\n\n    auto *obj = (DabDynamicString *)ret.data.object->object;\n\n    obj->value = str;\n    return ret;\n}\n\nDabValue DabValue::_get_instvar(dab_symbol_t symbol)\n{\n    assert(this->data.type == TYPE_OBJECT);\n    assert(this->data.object);\n\n    if (!this->data.object->object)\n    {\n        return DabValue(nullptr);\n    }\n\n    auto  object   = (DabObject *)this->data.object->object;\n    auto &instvars = object->instvars;\n\n    if (!instvars.count(symbol))\n    {\n        return DabValue(nullptr);\n    }\n    return instvars[symbol];\n}\n\nDabValue DabValue::get_instvar(dab_symbol_t symbol)\n{\n    auto ret = _get_instvar(symbol);\n    if ($VM->options.verbose)\n    {\n        auto name = $VM->get_symbol(symbol);\n\n        fprintf(stderr, \"vm: proxy %p (strong %d): Get instvar <%s> -> \", this->data.object,\n                (int)this->data.object->count_strong, name.c_str());\n        ret.print(stderr);\n        fprintf(stderr, \"\\n\");\n    }\n    return ret;\n}\n\nvoid DabValue::set_instvar(dab_symbol_t symbol, const DabValue &value)\n{\n    assert(this->data.type == TYPE_OBJECT);\n    assert(this->data.object);\n\n    if ($VM->options.verbose)\n    {\n        auto name = $VM->get_symbol(symbol);\n\n        fprintf(stderr, \"vm: proxy %p (strong %d): Set instvar <%s> to \", this->data.object,\n                (int)this->data.object->count_strong, name.c_str());\n        value.print(stderr);\n        fprintf(stderr, \"\\n\");\n    }\n\n    if (!this->data.object->object)\n    {\n        return;\n    }\n\n    auto  object     = (DabObject *)this->data.object->object;\n    auto &instvars   = object->instvars;\n    instvars[symbol] = value;\n}\n\nvoid DabValue::set_data(const DabValueData &other_data)\n{\n    data = other_data;\n    if ($VM->options.autorelease)\n    {\n        retain();\n    }\n}\n\nDabValue::DabValue(const DabValue &other)\n{\n    set_data(other.data);\n}\n\nDabValue &DabValue::operator=(const DabValue &other)\n{\n    set_data(other.data);\n    return *this;\n}\n\nDabValue::~DabValue()\n{\n    if ($VM->options.autorelease)\n    {\n        release();\n    }\n}\n\nvoid DabValue::release()\n{\n    if (is_object())\n    {\n        this->data.object->release(this);\n        this->data.object = nullptr;\n    }\n    this->data.type        = TYPE_NIL;\n    this->data._initialize = 0;\n}\n\nvoid DabValue::retain()\n{\n    if (is_object())\n    {\n        data.object->retain(this);\n    }\n}\n\n\/\/\n\nvoid DabObjectProxy::retain(DabValue *value)\n{\n    (void)value;\n    if (this->destroying)\n        return;\n    count_strong += 1;\n    if ($VM->options.verbose)\n    {\n        fprintf(stderr, \"vm: proxy %p B (strong %3d): + retained: \", this, (int)this->count_strong);\n        value->dump(stderr);\n        fprintf(stderr, \"\\n\");\n    }\n}\n\nvoid DabObjectProxy::release(DabValue *value)\n{\n    if (this->destroying)\n        return;\n    count_strong -= 1;\n    if ($VM->options.verbose)\n    {\n        fprintf(stderr, \"vm: proxy %p B (strong %3d): - released: \", this, (int)this->count_strong);\n        value->dump(stderr);\n        fprintf(stderr, \"\\n\");\n    }\n    if (count_strong == 0)\n    {\n        destroy(value);\n    }\n}\n\nvoid DabObjectProxy::destroy(DabValue *value)\n{\n    (void)value;\n    this->destroying = true;\n    if ($VM->options.verbose)\n    {\n        fprintf(stderr, \"vm: proxy %p C (strong %3d): X destroy\\n\", this, (int)this->count_strong);\n    }\n    delete object;\n    delete this;\n}\n\nsize_t DabValue::use_count() const\n{\n    if (is_object())\n    {\n        return data.object->count_strong;\n    }\n    else\n    {\n        return 65535;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <daemon_common.h>\n\n#include <sys\/socket.h>\n#include <sys\/un.h>\n#include <stdio.h>\n#include <unistd.h>\n#include <errno.h>\n#include <stdlib.h>\n#include <thread>\n\nusing namespace daemons::common;\n\n\/\/ TODO: Make this a configuration option\n\/* static *\/ std::string DaemonComms::commChannelAddressPath = \"\/run\/daemon.comm\";\n\nstatic void controller_handler(DaemonComms& _comm, int _connection_socket)\n\t{\n\t_comm.connection_handler(_connection_socket);\n\t}\nstatic void controller_server(DaemonComms& _comm)\n\t{\n\t_comm.receive_clients();\n\t}\n\nDaemonComms::DaemonComms(bool _controller)\n\t{\n\tis_controller = _controller;\n\tcommChannel = -1;\n\tcontinue_hosting = false;\n\t}\nDaemonComms::~DaemonComms()\n\t{\n\tclose();\n\t}\n\nbool DaemonComms::open()\n\t{\n\tif (is_controller)\n\t\t{\n\t\treturn open_channel();\n\t\t}\n\telse\n\t\t{\n\t\treturn open_server();\n\t\t}\n\t}\nvoid DaemonComms::close()\n\t{\n\tif (commChannel != -1)\n\t\t{\n\t\t::close(commChannel);\n\t\t}\n\t}\n\nbool DaemonComms::open_channel()\n\t{\n\tbool returnValue = false;\n\tcommChannel = socket(PF_UNIX, SOCK_STREAM|SOCK_NONBLOCK, 0);\n\n\tif (commChannel != -1)\n\t\t{\n\t\tstruct sockaddr_un address;\n\t\tmemset(&address, 0, sizeof(struct sockaddr_un));\n\t\taddress.sun_family = AF_UNIX;\n\t\tsnprintf(address.sun_path, sizeof(address.sun_path),\n\t\t\t\t \"%s\", commChannelAddressPath.c_str());\n\n\t\tint result = connect(commChannel,\n\t\t\t\t\t\t\t (const struct sockaddr*) &address,\n\t\t\t\t\t\t\t sizeof(struct sockaddr_un));\n\t\tif (result == 0)\n\t\t\t{\n\t\t\treturnValue = true;\n\t\t\t}\n\t\telse\n\t\t\t{\n\t\t\tfprintf(stderr, \"Failed to connect socket. Error Code: %d\", errno);\n\t\t\t}\n\t\t}\n\telse\n\t\t{\n\t\tfprintf(stderr, \"Failed to open local socket. Error Code: %d\", errno);\n\t\t}\n\n\treturn returnValue;\n\t}\nbool DaemonComms::open_server()\n\t{\n\tcommChannel = socket(PF_UNIX, SOCK_STREAM|SOCK_NONBLOCK, 0);\n\n\tif (commChannel != -1)\n\t\t{\n\t\tunlink(commChannelAddressPath.c_str());\n\n\t\tstruct sockaddr_un address;\n\t\tmemset(&address, 0, sizeof(struct sockaddr_un));\n\n\t\taddress.sun_family = AF_UNIX;\n\t\tsnprintf(address.sun_path, sizeof(address.sun_path),\n\t\t         \"%s\", commChannelAddressPath.c_str());\n\t\tint result = bind(commChannel,\n\t\t                  (const struct sockaddr*) &address,\n\t\t\t\t\t\t  sizeof(struct sockaddr_un));\n\t\tif (result == 0)\n\t\t\t{\n\t\t\tresult = listen(commChannel, 5);\n\n\t\t\tif (result == 0)\n\t\t\t\t{\n\t\t\t\tserver_thread = std::thread(controller_server, std::ref(*this));\n\t\t\t\t}\n\t\t\telse\n\t\t\t\t{\n\t\t\t\tfprintf(stderr, \"Failed to listen on socket. Error Code: %d\", errno);\n\t\t\t\t}\n\t\t\t}\n\t\telse\n\t\t\t{\n\t\t\tfprintf(stderr, \"Failed to bind socket. Error Code: %d\", errno);\n\t\t\t}\n\t\t}\n\telse\n\t\t{\n\t\tfprintf(stderr, \"Failed to open local socket. Error Code: %d\", errno);\n\t\t}\n\treturn false;\n\t}\n\nbool DaemonComms::send_message(const std::string& _message)\n\t{\n\tbool returnValue = false;\n\tif (is_controller == false)\n\t\t{\n\t\treturnValue = send_message(commChannel, _message);\n\t\t}\n\treturn returnValue;\n\t}\nbool DaemonComms::send_message(size_t _length, const unsigned char* _bytes)\n\t{\n\tbool returnValue = false;\n\tif (is_controller == false)\n\t\t{\n\t\treturnValue = send_message(commChannel, _length, _bytes);\n\t\t}\n\treturn returnValue;\n\t}\nbool DaemonComms::receive_message(std::string& _message)\n\t{\n\tbool returnValue = false;\n\tif (is_controller == false)\n\t\t{\n\t\treturnValue = receive_message(commChannel, _message);\n\t\t}\n\treturn returnValue;\n\t}\nbool DaemonComms::receive_message(size_t& _length, unsigned char*& _bytes)\n\t{\n\tbool returnValue = false;\n\tif (is_controller == false)\n\t\t{\n\t\treturnValue = receive_message(commChannel, _length, _bytes);\n\t\t}\n\treturn returnValue;\n\t}\n\nbool DaemonComms::send_message(int _fd, const std::string& _message)\n\t{\n\treturn send_message(_message.length(), _message.data());\n\t}\nbool DaemonComms::send_message(int _fd, size_t _length, const unsigned char* _bytes)\n\t{\n\tbool returnValue = false;\n\tif (_length > 0 && _bytes != NULL)\n\t\t{\n\t\tDaemonComms::msg_header header;\n\t\tmemset(&header, 0, sizeof(DaemonComms::msg_header));\n\t\theader.length = calculate_message_length(_length);\n\t\theader.version = 1;\n\t\theader.message_type = 1;\n\t\theader.data_length = _length;\n\n\t\tsize_t header_size = calculate_message_length(0);\n\t\tssize_t sent_data = send(_fd, &header, header_size, 0);\n\t\tif (sent_data > 0)\n\t\t\t{\n\t\t\tsent_data = send(_fd, _bytes, _length, 0);\n\t\t\tif (sent_data > 0)\n\t\t\t\t{\n\t\t\t\treturnValue = (size_t(sent_data) == _length);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\treturn returnValue;\n\t}\nuint8_t DaemonComms::receive_message(int _fd, std::string& _message)\n\t{\n\tsize_t length = 0;\n\tunsigned char* bytes = NULL;\n\tuint8_t returnValue = receive_message(length, bytes);\n\tif (returnValue == 0)\n\t\t{\n\t\t_message = std::string((const char*)bytes, length);\n\t\t}\n\treturn returnValue;\n\t}\nuint8_t DaemonComms::receive_message(int _fd, size_t& _length, unsigned char*& _bytes)\n\t{\n\tuint8_t returnValue = -1;\n\tif (_length == 0 && _bytes == NULL)\n\t\t{\n\t\tsize_t header_size = calculate_message_length(0);\n\t\tDaemonComms::msg_header header;\n\t\twhile(true)\n\t\t\t{\n\t\t\tmemset(&header, 0, sizeof(DaemonComms::msg_header));\n\t\t\t\n\t\t\tsize_t incoming_data = recv(_fd, &header, header_size, MSG_PEEK);\n\n\t\t\tif (incoming_data == header_size)\n\t\t\t\t{\n\t\t\t\tunsigned char recvd_data[header.length+1];\n\t\t\t\tsize_t msg_length = header.length + 1;\n\n\t\t\t\twhile (true)\n\t\t\t\t\t{\n\t\t\t\t\tmemset(recvd_data, 0, msg_length);\n\t\t\t\t\t\n\t\t\t\t\tincoming_data = recv(_fd, recvd_data, header.length, MSG_WAITALL);\n\t\t\t\t\tif (incoming_data == header.length)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ send the data back up\n\t\t\t\t\t\tunsigned char* return_buffer = (unsigned char*) calloc(sizeof(unsigned char), msg_length);\n\t\t\t\t\t\tif (return_buffer != NULL)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\/\/ copy it all, including the extra termination byte we added on the end\n\t\t\t\t\t\t\tmemcpy(return_buffer, recvd_data, msg_length);\n\n\t\t\t\t\t\t\t\/\/ give it to the caller, and only report the actual message size\n\t\t\t\t\t\t\t_bytes = recvd_data;\n\t\t\t\t\t\t\t_length = header.length;\n\n\t\t\t\t\t\t\t\/\/ the sole success case\n\t\t\t\t\t\t\treturnValue = 0;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\/\/ error allocating buffer\n\t\t\t\t\t\t\treturnValue = -8;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\telse if (incoming_data == 0)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ orderly shutdown by other side - exit the loop\n\t\t\t\t\t\treturnValue = -7;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\telse if (incoming_data == -1)\n\t\t\t\t\t\t{\n\t\t\t\t\t\tswitch(errno)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\tcase EAGAIN: \/\/ aka EWOULDBLOCK\n\t\t\t\t\t\t\t\t\/\/ repeat\n\t\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t\t\/\/ error\n\t\t\t\t\t\t\t\treturnValue = -6;\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\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ we didn't receive all the data\n\t\t\t\t\t\treturnValue = -5;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\telse if (incoming_data == 0)\n\t\t\t\t{\n\t\t\t\t\/\/ orderly shutdown by other side or no data to recv - exit the loop\n\t\t\t\treturnValue = -4;\n\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\telse if (incoming_data == -1)\n\t\t\t\t{\n\t\t\t\tswitch(errno)\n\t\t\t\t\t{\n\t\t\t\t\tcase EAGAIN: \/\/ aka EWOULDBLOCK \n\t\t\t\t\t\t\/\/ repeat\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tdefault:\n\t\t\t\t\t\treturnValue = -3;\n\t\t\t\t\t\t\/\/ error\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t};\n\t\t\t\t}\n\t\t\telse\n\t\t\t\t{\n\t\t\t\t\/\/ we didn't receive all the data\n\t\t\t\treturnValue = -2;\n\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\treturn returnValue;\n\t}\n\nbool DaemonComms::put_message(const std::string& _message)\n\t{\n\tbool returnValue = false;\n\tstd::lock_guard<std::mutex> lock(message_mutex);\n\tfor(connection_message_queue::iterator iter = output_queue.begin();\n\t\titer != output_queue.end();\n\t\t++iter)\n\t\t{\n\t\titer->second.push_back(_message);\n\t\treturnValue = true;\n\t\t}\n\treturn returnValue;\n\t}\nbool DaemonComms::put_message(size_t _length, const unsigned char* _bytes)\n\t{\n\tstd::string message((const char*)_bytes, _length);\n\treturn put_message(message);\n\t}\nbool DaemonComms::get_message(std::string& _message)\n\t{\n\tbool returnValue = false;\n\tif (input_queue.empty() == false)\n\t\t{\n\t\t_message = input_queue.front();\n\t\tinput_queue.pop_front();\n\t\treturnValue = true;\n\t\t}\n\treturn returnValue;\n\t}\nbool DaemonComms::get_message(size_t& _length, unsigned char*& _bytes)\n\t{\n\tbool returnValue = false;\n\tif (_length == 0 && _bytes == NULL)\n\t\t{\n\t\tstd::string message;\n\t\treturnValue = get_message(message);\n\t\tif (returnValue == true)\n\t\t\t{\n\t\t\t_bytes = (unsigned char*) calloc(sizeof(unsigned char), (message.length()+1));\n\t\t\tif (_bytes != NULL)\n\t\t\t\t{\n\t\t\t\tmemcpy(_bytes, message.data(), message.length());\n\t\t\t\treturnValue = true;\n\t\t\t\t}\n\t\t\telse\n\t\t\t\t{\n\t\t\t\treturnValue = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\treturn returnValue;\n\t}\n\/* static *\/ void DaemonComms::release_message(unsigned char*& _bytes)\n\t{\n\tif (_bytes != NULL)\n\t\t{\n\t\tfree(_bytes);\n\t\t_bytes = NULL;\n\t\t}\n\t}\n\nvoid DaemonComms::connection_handler(int _connection_socket)\n\t{\n\t\/\/ create a queue\n\toutput_queue[_connection_socket] = message_list();\n\n\tstd::string input_message;\n\n\tif (_connection_socket != -1)\n\t\t{\n\t\twhile (true)\n\t\t\t{\n\t\t\tstd::lock_guard<std::mutex> lock(message_mutex);\n\t\t\t\/\/ pop messages from the queue and write them to the socket\n\t\t\t\n\t\t\tfor (message_list::iterator iter = output_queue[_connection_socket].begin();\n\t\t\t\t iter != output_queue[_connection_socket].end();\n\t\t\t\t ++iter)\n\t\t\t\t {\n\t\t\t\t send_message(_connection_socket, *iter);\n\t\t\t\t }\n\n\t\t\t\/\/ read message from the socket and stick them in the queue\n\t\t\tint recv_result = receive_message(_connection_socket, input_message);\n\t\t\tif (recv_result == 0)\n\t\t\t\t{\n\t\t\t\tinput_queue.push_back(input_message);\n\t\t\t\t}\n\n\t\t\t\/\/ make sure the socket is still good\n\t\t\tif (check_socket(_connection_socket) == true)\n\t\t\t\t{\n\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\/\/ so we don't eat the processor, only check for messages once every 100ms\n\t\t\tusleep(100);\n\t\t\t}\n\n\t\toutput_queue.erase(output_queue.find(_connection_socket));\n\t\t::close(_connection_socket);\n\t\t}\n\t}\nbool DaemonComms::check_socket(int _fd)\n\t{\n\tbool returnSocketInvalid = false;\n\n\t\/\/ Determine that the socket has gone away and exit the loop\n\t\/\/ try a peek\n\tsize_t header_size = calculate_message_length(0);\n\tDaemonComms::msg_header header;\n\tmemset(&header, 0, sizeof(DaemonComms::msg_header));\n\n\tint peek_result = recv(_fd, &header, header_size, MSG_PEEK);\n\tif (peek_result == -1)\n\t\t{\n\t\tswitch(errno)\n\t\t\t{\n\t\t\tcase EBADF:\n\t\t\tcase ECONNREFUSED:\n\t\t\tcase ENOTCONN:\n\t\t\t\treturnSocketInvalid = true;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t\t};\n\t\t}\n\treturn returnSocketInvalid;\n\t}\n\nvoid DaemonComms::receive_clients()\n\t{\n\tint incoming = -1;\n\twhile (continue_hosting == true)\n\t\t{\n\t\t\/\/ we don't need many client as we are simply an internal comms channel\n\t\tincoming = accept(commChannel, NULL, NULL);\n\t\tif (incoming != -1)\n\t\t\t{\n\t\t\tclients.push_back(std::thread(controller_handler, std::ref(*this), incoming));\n\t\t\t}\n\t\t}\n\t::close(commChannel);\n\t}\n<commit_msg>Bug Fix: Don't return the header data, just the message<commit_after>#include <daemon_common.h>\n\n#include <sys\/socket.h>\n#include <sys\/un.h>\n#include <stdio.h>\n#include <unistd.h>\n#include <errno.h>\n#include <stdlib.h>\n#include <thread>\n\nusing namespace daemons::common;\n\n\/\/ TODO: Make this a configuration option\n\/* static *\/ std::string DaemonComms::commChannelAddressPath = \"\/run\/daemon.comm\";\n\nstatic void controller_handler(DaemonComms& _comm, int _connection_socket)\n\t{\n\t_comm.connection_handler(_connection_socket);\n\t}\nstatic void controller_server(DaemonComms& _comm)\n\t{\n\t_comm.receive_clients();\n\t}\n\nDaemonComms::DaemonComms(bool _controller)\n\t{\n\tis_controller = _controller;\n\tcommChannel = -1;\n\tcontinue_hosting = false;\n\t}\nDaemonComms::~DaemonComms()\n\t{\n\tclose();\n\t}\n\nbool DaemonComms::open()\n\t{\n\tif (is_controller)\n\t\t{\n\t\treturn open_channel();\n\t\t}\n\telse\n\t\t{\n\t\treturn open_server();\n\t\t}\n\t}\nvoid DaemonComms::close()\n\t{\n\tif (commChannel != -1)\n\t\t{\n\t\t::close(commChannel);\n\t\t}\n\t}\n\nbool DaemonComms::open_channel()\n\t{\n\tbool returnValue = false;\n\tcommChannel = socket(PF_UNIX, SOCK_STREAM|SOCK_NONBLOCK, 0);\n\n\tif (commChannel != -1)\n\t\t{\n\t\tstruct sockaddr_un address;\n\t\tmemset(&address, 0, sizeof(struct sockaddr_un));\n\t\taddress.sun_family = AF_UNIX;\n\t\tsnprintf(address.sun_path, sizeof(address.sun_path),\n\t\t\t\t \"%s\", commChannelAddressPath.c_str());\n\n\t\tint result = connect(commChannel,\n\t\t\t\t\t\t\t (const struct sockaddr*) &address,\n\t\t\t\t\t\t\t sizeof(struct sockaddr_un));\n\t\tif (result == 0)\n\t\t\t{\n\t\t\treturnValue = true;\n\t\t\t}\n\t\telse\n\t\t\t{\n\t\t\tfprintf(stderr, \"Failed to connect socket. Error Code: %d\", errno);\n\t\t\t}\n\t\t}\n\telse\n\t\t{\n\t\tfprintf(stderr, \"Failed to open local socket. Error Code: %d\", errno);\n\t\t}\n\n\treturn returnValue;\n\t}\nbool DaemonComms::open_server()\n\t{\n\tcommChannel = socket(PF_UNIX, SOCK_STREAM|SOCK_NONBLOCK, 0);\n\n\tif (commChannel != -1)\n\t\t{\n\t\tunlink(commChannelAddressPath.c_str());\n\n\t\tstruct sockaddr_un address;\n\t\tmemset(&address, 0, sizeof(struct sockaddr_un));\n\n\t\taddress.sun_family = AF_UNIX;\n\t\tsnprintf(address.sun_path, sizeof(address.sun_path),\n\t\t         \"%s\", commChannelAddressPath.c_str());\n\t\tint result = bind(commChannel,\n\t\t                  (const struct sockaddr*) &address,\n\t\t\t\t\t\t  sizeof(struct sockaddr_un));\n\t\tif (result == 0)\n\t\t\t{\n\t\t\tresult = listen(commChannel, 5);\n\n\t\t\tif (result == 0)\n\t\t\t\t{\n\t\t\t\tserver_thread = std::thread(controller_server, std::ref(*this));\n\t\t\t\t}\n\t\t\telse\n\t\t\t\t{\n\t\t\t\tfprintf(stderr, \"Failed to listen on socket. Error Code: %d\", errno);\n\t\t\t\t}\n\t\t\t}\n\t\telse\n\t\t\t{\n\t\t\tfprintf(stderr, \"Failed to bind socket. Error Code: %d\", errno);\n\t\t\t}\n\t\t}\n\telse\n\t\t{\n\t\tfprintf(stderr, \"Failed to open local socket. Error Code: %d\", errno);\n\t\t}\n\treturn false;\n\t}\n\nbool DaemonComms::send_message(const std::string& _message)\n\t{\n\tbool returnValue = false;\n\tif (is_controller == false)\n\t\t{\n\t\treturnValue = send_message(commChannel, _message);\n\t\t}\n\treturn returnValue;\n\t}\nbool DaemonComms::send_message(size_t _length, const unsigned char* _bytes)\n\t{\n\tbool returnValue = false;\n\tif (is_controller == false)\n\t\t{\n\t\treturnValue = send_message(commChannel, _length, _bytes);\n\t\t}\n\treturn returnValue;\n\t}\nbool DaemonComms::receive_message(std::string& _message)\n\t{\n\tbool returnValue = false;\n\tif (is_controller == false)\n\t\t{\n\t\treturnValue = receive_message(commChannel, _message);\n\t\t}\n\treturn returnValue;\n\t}\nbool DaemonComms::receive_message(size_t& _length, unsigned char*& _bytes)\n\t{\n\tbool returnValue = false;\n\tif (is_controller == false)\n\t\t{\n\t\treturnValue = receive_message(commChannel, _length, _bytes);\n\t\t}\n\treturn returnValue;\n\t}\n\nbool DaemonComms::send_message(int _fd, const std::string& _message)\n\t{\n\treturn send_message(_message.length(), _message.data());\n\t}\nbool DaemonComms::send_message(int _fd, size_t _length, const unsigned char* _bytes)\n\t{\n\tbool returnValue = false;\n\tif (_length > 0 && _bytes != NULL)\n\t\t{\n\t\tDaemonComms::msg_header header;\n\t\tmemset(&header, 0, sizeof(DaemonComms::msg_header));\n\t\theader.length = calculate_message_length(_length);\n\t\theader.version = 1;\n\t\theader.message_type = 1;\n\t\theader.data_length = _length;\n\n\t\tsize_t header_size = calculate_message_length(0);\n\t\tssize_t sent_data = send(_fd, &header, header_size, 0);\n\t\tif (sent_data > 0)\n\t\t\t{\n\t\t\tsent_data = send(_fd, _bytes, _length, 0);\n\t\t\tif (sent_data > 0)\n\t\t\t\t{\n\t\t\t\treturnValue = (size_t(sent_data) == _length);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\treturn returnValue;\n\t}\nuint8_t DaemonComms::receive_message(int _fd, std::string& _message)\n\t{\n\tsize_t length = 0;\n\tunsigned char* bytes = NULL;\n\tuint8_t returnValue = receive_message(length, bytes);\n\tif (returnValue == 0)\n\t\t{\n\t\t_message = std::string((const char*)bytes, length);\n\t\t}\n\treturn returnValue;\n\t}\nuint8_t DaemonComms::receive_message(int _fd, size_t& _length, unsigned char*& _bytes)\n\t{\n\tuint8_t returnValue = -1;\n\tif (_length == 0 && _bytes == NULL)\n\t\t{\n\t\tsize_t header_size = calculate_message_length(0);\n\t\tDaemonComms::msg_header header;\n\t\twhile(true)\n\t\t\t{\n\t\t\tmemset(&header, 0, sizeof(DaemonComms::msg_header));\n\t\t\t\n\t\t\tsize_t incoming_data = recv(_fd, &header, header_size, MSG_PEEK);\n\n\t\t\tif (incoming_data == header_size)\n\t\t\t\t{\n\t\t\t\tunsigned char recvd_data[header.length+1];\n\t\t\t\tsize_t msg_length = header.length + 1;\n\n\t\t\t\twhile (true)\n\t\t\t\t\t{\n\t\t\t\t\tmemset(recvd_data, 0, msg_length);\n\t\t\t\t\t\n\t\t\t\t\tincoming_data = recv(_fd, recvd_data, header.length, MSG_WAITALL);\n\t\t\t\t\tif (incoming_data == header.length)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ send the data back up\n\t\t\t\t\t\tsize_t data_msg_length = header.data_length + 1;\n\t\t\t\t\t\tunsigned char* return_buffer = (unsigned char*) calloc(sizeof(unsigned char), data_msg_length);\n\t\t\t\t\t\tif (return_buffer != NULL)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\/\/ calculate the start of the message section\n\t\t\t\t\t\t\tunsigned char* data_ptr = recvd_data + (header_size + 1);\n\n\t\t\t\t\t\t\t\/\/ copy it all, including the extra termination byte we added on the end\n\t\t\t\t\t\t\tmemcpy(return_buffer, data_ptr, data_msg_length);\n\n\t\t\t\t\t\t\t\/\/ give it to the caller, and only report the actual message size\n\t\t\t\t\t\t\t_bytes = recvd_data;\n\t\t\t\t\t\t\t_length = header.length;\n\n\t\t\t\t\t\t\t\/\/ the sole success case\n\t\t\t\t\t\t\treturnValue = 0;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\/\/ error allocating buffer\n\t\t\t\t\t\t\treturnValue = -8;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\telse if (incoming_data == 0)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ orderly shutdown by other side - exit the loop\n\t\t\t\t\t\treturnValue = -7;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\telse if (incoming_data == -1)\n\t\t\t\t\t\t{\n\t\t\t\t\t\tswitch(errno)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\tcase EAGAIN: \/\/ aka EWOULDBLOCK\n\t\t\t\t\t\t\t\t\/\/ repeat\n\t\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t\t\/\/ error\n\t\t\t\t\t\t\t\treturnValue = -6;\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\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ we didn't receive all the data\n\t\t\t\t\t\treturnValue = -5;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\telse if (incoming_data == 0)\n\t\t\t\t{\n\t\t\t\t\/\/ orderly shutdown by other side or no data to recv - exit the loop\n\t\t\t\treturnValue = -4;\n\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\telse if (incoming_data == -1)\n\t\t\t\t{\n\t\t\t\tswitch(errno)\n\t\t\t\t\t{\n\t\t\t\t\tcase EAGAIN: \/\/ aka EWOULDBLOCK \n\t\t\t\t\t\t\/\/ repeat\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tdefault:\n\t\t\t\t\t\treturnValue = -3;\n\t\t\t\t\t\t\/\/ error\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t};\n\t\t\t\t}\n\t\t\telse\n\t\t\t\t{\n\t\t\t\t\/\/ we didn't receive all the data\n\t\t\t\treturnValue = -2;\n\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\treturn returnValue;\n\t}\n\nbool DaemonComms::put_message(const std::string& _message)\n\t{\n\tbool returnValue = false;\n\tstd::lock_guard<std::mutex> lock(message_mutex);\n\tfor(connection_message_queue::iterator iter = output_queue.begin();\n\t\titer != output_queue.end();\n\t\t++iter)\n\t\t{\n\t\titer->second.push_back(_message);\n\t\treturnValue = true;\n\t\t}\n\treturn returnValue;\n\t}\nbool DaemonComms::put_message(size_t _length, const unsigned char* _bytes)\n\t{\n\tstd::string message((const char*)_bytes, _length);\n\treturn put_message(message);\n\t}\nbool DaemonComms::get_message(std::string& _message)\n\t{\n\tbool returnValue = false;\n\tif (input_queue.empty() == false)\n\t\t{\n\t\t_message = input_queue.front();\n\t\tinput_queue.pop_front();\n\t\treturnValue = true;\n\t\t}\n\treturn returnValue;\n\t}\nbool DaemonComms::get_message(size_t& _length, unsigned char*& _bytes)\n\t{\n\tbool returnValue = false;\n\tif (_length == 0 && _bytes == NULL)\n\t\t{\n\t\tstd::string message;\n\t\treturnValue = get_message(message);\n\t\tif (returnValue == true)\n\t\t\t{\n\t\t\t_bytes = (unsigned char*) calloc(sizeof(unsigned char), (message.length()+1));\n\t\t\tif (_bytes != NULL)\n\t\t\t\t{\n\t\t\t\tmemcpy(_bytes, message.data(), message.length());\n\t\t\t\treturnValue = true;\n\t\t\t\t}\n\t\t\telse\n\t\t\t\t{\n\t\t\t\treturnValue = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\treturn returnValue;\n\t}\n\/* static *\/ void DaemonComms::release_message(unsigned char*& _bytes)\n\t{\n\tif (_bytes != NULL)\n\t\t{\n\t\tfree(_bytes);\n\t\t_bytes = NULL;\n\t\t}\n\t}\n\nvoid DaemonComms::connection_handler(int _connection_socket)\n\t{\n\t\/\/ create a queue\n\toutput_queue[_connection_socket] = message_list();\n\n\tstd::string input_message;\n\n\tif (_connection_socket != -1)\n\t\t{\n\t\twhile (true)\n\t\t\t{\n\t\t\tstd::lock_guard<std::mutex> lock(message_mutex);\n\t\t\t\/\/ pop messages from the queue and write them to the socket\n\t\t\t\n\t\t\tfor (message_list::iterator iter = output_queue[_connection_socket].begin();\n\t\t\t\t iter != output_queue[_connection_socket].end();\n\t\t\t\t ++iter)\n\t\t\t\t {\n\t\t\t\t send_message(_connection_socket, *iter);\n\t\t\t\t }\n\n\t\t\t\/\/ read message from the socket and stick them in the queue\n\t\t\tint recv_result = receive_message(_connection_socket, input_message);\n\t\t\tif (recv_result == 0)\n\t\t\t\t{\n\t\t\t\tinput_queue.push_back(input_message);\n\t\t\t\t}\n\n\t\t\t\/\/ make sure the socket is still good\n\t\t\tif (check_socket(_connection_socket) == true)\n\t\t\t\t{\n\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\/\/ so we don't eat the processor, only check for messages once every 100ms\n\t\t\tusleep(100);\n\t\t\t}\n\n\t\toutput_queue.erase(output_queue.find(_connection_socket));\n\t\t::close(_connection_socket);\n\t\t}\n\t}\nbool DaemonComms::check_socket(int _fd)\n\t{\n\tbool returnSocketInvalid = false;\n\n\t\/\/ Determine that the socket has gone away and exit the loop\n\t\/\/ try a peek\n\tsize_t header_size = calculate_message_length(0);\n\tDaemonComms::msg_header header;\n\tmemset(&header, 0, sizeof(DaemonComms::msg_header));\n\n\tint peek_result = recv(_fd, &header, header_size, MSG_PEEK);\n\tif (peek_result == -1)\n\t\t{\n\t\tswitch(errno)\n\t\t\t{\n\t\t\tcase EBADF:\n\t\t\tcase ECONNREFUSED:\n\t\t\tcase ENOTCONN:\n\t\t\t\treturnSocketInvalid = true;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t\t};\n\t\t}\n\treturn returnSocketInvalid;\n\t}\n\nvoid DaemonComms::receive_clients()\n\t{\n\tint incoming = -1;\n\twhile (continue_hosting == true)\n\t\t{\n\t\t\/\/ we don't need many client as we are simply an internal comms channel\n\t\tincoming = accept(commChannel, NULL, NULL);\n\t\tif (incoming != -1)\n\t\t\t{\n\t\t\tclients.push_back(std::thread(controller_handler, std::ref(*this), incoming));\n\t\t\t}\n\t\t}\n\t::close(commChannel);\n\t}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2008, Google Inc. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/\n\/\/  1. Redistributions of source code must retain the above copyright notice,\n\/\/     this list of conditions and the following disclaimer.\n\/\/  2. Redistributions in binary form must reproduce the above copyright notice,\n\/\/     this list of conditions and the following disclaimer in the documentation\n\/\/     and\/or other materials provided with the distribution.\n\/\/  3. Neither the name of Google Inc. nor the names of its contributors may be\n\/\/     used to endorse or promote products derived from this software without\n\/\/     specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED\n\/\/ WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\n\/\/ MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO\n\/\/ EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/ PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;\n\/\/ OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n\/\/ WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR\n\/\/ OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF\n\/\/ ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n\/\/ This file contains the unit tests for the CreateBalloonText function.\n\n#include \"kml\/engine\/feature_balloon.h\"\n#include \"boost\/scoped_ptr.hpp\"\n#include \"kml\/base\/file.h\"\n#include \"kml\/base\/unit_test.h\"\n#include \"kml\/engine\/kml_file.h\"\n\n#ifndef DATADIR\n#error *** DATADIR must be defined! ***\n#endif\n\nusing kmlbase::File;\nusing kmldom::DocumentPtr;\nusing kmldom::FeaturePtr;\nusing kmldom::PlacemarkPtr;\n\nnamespace kmlengine {\n\nclass FeatureBalloonTest : public CPPUNIT_NS::TestFixture {\n  CPPUNIT_TEST_SUITE(FeatureBalloonTest);\n  CPPUNIT_TEST(TestBasicCreateBalloonText);\n  CPPUNIT_TEST(TestComplexCreateBalloonText);\n  CPPUNIT_TEST(TestAllBalloonsFile);\n  CPPUNIT_TEST_SUITE_END();\n\n protected:\n  void TestBasicCreateBalloonText();\n  void TestComplexCreateBalloonText();\n  void TestAllBalloonsFile();\n\n private:\n  KmlFilePtr kml_file_;\n};\n\nCPPUNIT_TEST_SUITE_REGISTRATION(FeatureBalloonTest);\n\n\/\/ A struct of the KML content and the expected balloon text.\nconst static struct {\n  const char* kml;\n  const char* balloontext;\n} kKml[] = {\n  {\n    \/\/ A Feature with neither name nor description has no balloon text.\n    \/\/ TODO: geDirections is there by default?\n    \"<Placemark\/>\",\n    NULL\n  },\n  {\n    \"<Placemark><name>foo<\/name><\/Placemark>\",\n    \"<h3>foo<\/h3><br\/><br\/>\"\n  },\n  {\n    \"<Placemark><name>bar<\/name><description>goo<\/description><\/Placemark>\",\n    \"<h3>bar<\/h3><br\/><br\/>goo\"\n  },\n};\nvoid FeatureBalloonTest::TestBasicCreateBalloonText() {\n  for (size_t i = 0; i < sizeof(kKml)\/sizeof(kKml[0]); ++i) {\n    \/\/ Parse the file into a KmlFile object.\n    kml_file_ = KmlFile::CreateFromParse(kKml[i].kml, NULL);\n    \/\/ Extract the Placemark.\n    const PlacemarkPtr placemark = kmldom::AsPlacemark(kml_file_->root());\n    \/\/ Verify that that balloon text has been composited as expected.\n    const std::string kResult(CreateBalloonText(kml_file_, placemark));\n    if (kKml[i].balloontext == NULL) {\n      CPPUNIT_ASSERT(kResult.empty());\n    } else {\n      CPPUNIT_ASSERT_EQUAL(kResult,\n                           static_cast<std::string>(kKml[i].balloontext));\n    }\n  }\n}\n\nvoid FeatureBalloonTest::TestComplexCreateBalloonText() {\n  \/\/ A hunk of KML that requires the ballon to be composited from a\n  \/\/ BalloonStyle templated on Data and Schema\/SchemaData.\n  const std::string kKitchenSinkKml(\n      \"<Document>\"\n      \"<Schema name=\\\"TrailHeadType\\\" id=\\\"TrailHeadTypeId\\\">\"\n      \"<SimpleField type=\\\"string\\\" name=\\\"TrailHeadName\\\">\"\n      \"<displayName><![CDATA[<b>Trail Head Name<\/b>]]><\/displayName>\"\n      \"<\/SimpleField>\"\n      \"<SimpleField type=\\\"double\\\" name=\\\"TrailLength\\\">\"\n      \"<displayName><![CDATA[<i>The length in miles<\/i>]]><\/displayName>\"\n      \"<\/SimpleField>\"\n      \"<SimpleField type=\\\"int\\\" name=\\\"ElevationGain\\\">\"\n      \"<displayName><![CDATA[<i>change in altitude<\/i>]]><\/displayName>\"\n      \"<\/SimpleField>\"\n      \"<\/Schema>\"\n      \"<Placemark id=\\\"foo\\\" targetId=\\\"bar\\\">\"\n      \"<name>__NAME__<\/name>\"\n      \"<address>__ADDRESS__<\/address>\"\n      \"<Snippet>__SNIPPET__<\/Snippet>\"\n      \"<description>__DESCRIPTION__<\/description>\"\n      \"<Style>\"\n      \"<BalloonStyle>\"\n      \"<text><![CDATA[\"\n      \"<b>$[name]<\/b><br\/><br\/>\"\n      \"<i>$[description]<i><br\/><br\/>\"\n      \"The $[TrailHeadType\/TrailHeadName\/displayName] is\"\n      \"<i>$[TrailHeadType\/TrailHeadName]<\/i><br\/>\"\n      \"The trail is $[TrailHeadType\/TrailLength] miles<br\/>\"\n      \"The climb is $[TrailHeadType\/ElevationGain] meters<br\/><br\/>\"\n      \"$[geDirections]\"  \/\/ TODO.\n      \"]]><\/text>\"\n      \"<\/BalloonStyle>\"\n      \"<\/Style>\"\n      \"<ExtendedData>\"\n      \"<Data name=\\\"holeNumber\\\">\"\n      \"<value>1<\/value>\"\n      \"<\/Data>\"\n      \"<Data name=\\\"holeYardage\\\">\"\n      \"<value>234<\/value>\"\n      \"<\/Data>\"\n      \"<SchemaData schemaUrl=\\\"#TrailHeadTypeId\\\">\"\n      \"<SimpleData name=\\\"TrailHeadName\\\">Mount Everest<\/SimpleData>\"\n      \"<SimpleData name=\\\"TrailLength\\\">347.45<\/SimpleData>\"\n      \"<SimpleData name=\\\"ElevationGain\\\">10000<\/SimpleData>\"\n      \"<\/SchemaData>\"\n      \"<\/ExtendedData>\"\n      \"<Point>\"\n      \"<coordinates>-123.115786, 49.283323<\/coordinates>\"\n      \"<\/Point>\"\n      \"<\/Placemark>\"\n      \"<\/Document>\");\n\n  \/\/ The resultant balloon text from the above KML.\n  const std::string kKitchenSinkBalloonText(\n      \"<b>__NAME__<\/b><br\/><br\/>\"\n      \"<i>__DESCRIPTION__<i><br\/><br\/>\"\n      \"The <b>Trail Head Name<\/b> is\"\n      \"<i>Mount Everest<\/i><br\/>\"\n      \"The trail is 347.45 miles<br\/>\"\n      \"The climb is 10000 meters<br\/><br\/>\"\n      \"$[geDirections]\");  \/\/ TODO: geDirections.\n\n  \/\/ Parse the file into a KmlFile object.\n  kml_file_ = KmlFile::CreateFromParse(kKitchenSinkKml, NULL);\n\n  \/\/ Extract the Placemark.\n  const DocumentPtr doc = kmldom::AsDocument(kml_file_->root());\n  const PlacemarkPtr placemark =\n      kmldom::AsPlacemark(doc->get_feature_array_at(0));\n\n  \/\/ Verify that that balloon text has been composited as expected.\n  CPPUNIT_ASSERT_EQUAL(kKitchenSinkBalloonText,\n                       CreateBalloonText(kml_file_, placemark));\n}\n\n\/\/ A struct of the Feature ID from which we'll pull the KML content, and the\n\/\/ expected balloon text.\nconst static struct {\n  const char* featureid;\n  const char* balloontext;\n} kFeatures[] = {\n  {\n  \"empty-placemark\",\n  NULL\n  },\n  {\n  \"empty-name\",\n  \"<h3><\/h3><br\/><br\/>\"\n  },\n  {\n  \"empty-description\",\n  NULL\n  },\n  {\n  \"empty-name-description\",\n  \"<h3><\/h3><br\/><br\/>\"\n  },\n  {\n  \"name\",\n  \"<h3>named<\/h3><br\/><br\/>\"\n  },\n  {\n  \"name-description\",\n  \"<h3>named<\/h3><br\/><br\/>described\"\n  },\n  {\n  \"name-description-entity\",\n  \"<h3>named<\/h3><br\/><br\/>name is named<br\/>id is name-description-entity\"\n  },\n  {\n  \"simple-balloon-style\",\n  \"name is named<br\/>id is simple-balloon-style\"\n  },\n  {\n  \"extendeddata-data\",\n  \"to be or not to be that is the question\"\n  },\n  {\n  \"extendeddata-schemadata\",\n  \"She was called Balloon Girl and she had just turned 23\"\n  }\n};\n\nvoid FeatureBalloonTest::TestAllBalloonsFile() {\n  const std::string kBalloonKml = std::string(DATADIR) +\n                                  \"\/balloon\/all-balloons.kml\";\n  std::string data;\n  std::string errors;\n  CPPUNIT_ASSERT(kmlbase::File::ReadFileToString(kBalloonKml, &data));\n  kml_file_ = KmlFile::CreateFromParse(data, &errors);\n  CPPUNIT_ASSERT(!data.empty());\n  CPPUNIT_ASSERT(errors.empty());\n  CPPUNIT_ASSERT(kml_file_);\n  for (size_t i = 0; i < sizeof(kFeatures)\/sizeof(kFeatures[0]); ++i) {\n    \/\/ Extract the Placemark.\n    const FeaturePtr feature=\n        kmldom::AsFeature(kml_file_->GetObjectById(kFeatures[i].featureid));\n    \/\/ Verify that that balloon text has been composited as expected.\n    const std::string kActual(CreateBalloonText(kml_file_, feature));\n    if (kFeatures[i].balloontext == NULL) {\n      CPPUNIT_ASSERT(kActual.empty());\n      CPPUNIT_ASSERT_EQUAL(std::string(\"\"), kActual);\n    } else {\n      CPPUNIT_ASSERT_EQUAL(static_cast<std::string>(kFeatures[i].balloontext),\n                           kActual);\n    }\n  }\n}\n\n}  \/\/ end namespace kmlengine\n\nTEST_MAIN\n<commit_msg>use xhtml-valid markup<commit_after>\/\/ Copyright 2008, Google Inc. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/\n\/\/  1. Redistributions of source code must retain the above copyright notice,\n\/\/     this list of conditions and the following disclaimer.\n\/\/  2. Redistributions in binary form must reproduce the above copyright notice,\n\/\/     this list of conditions and the following disclaimer in the documentation\n\/\/     and\/or other materials provided with the distribution.\n\/\/  3. Neither the name of Google Inc. nor the names of its contributors may be\n\/\/     used to endorse or promote products derived from this software without\n\/\/     specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED\n\/\/ WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\n\/\/ MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO\n\/\/ EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/ PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;\n\/\/ OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n\/\/ WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR\n\/\/ OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF\n\/\/ ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n\/\/ This file contains the unit tests for the CreateBalloonText function.\n\n#include \"kml\/engine\/feature_balloon.h\"\n#include \"boost\/scoped_ptr.hpp\"\n#include \"kml\/base\/file.h\"\n#include \"kml\/base\/unit_test.h\"\n#include \"kml\/engine\/kml_file.h\"\n\n#ifndef DATADIR\n#error *** DATADIR must be defined! ***\n#endif\n\nusing kmlbase::File;\nusing kmldom::DocumentPtr;\nusing kmldom::FeaturePtr;\nusing kmldom::PlacemarkPtr;\n\nnamespace kmlengine {\n\nclass FeatureBalloonTest : public CPPUNIT_NS::TestFixture {\n  CPPUNIT_TEST_SUITE(FeatureBalloonTest);\n  CPPUNIT_TEST(TestBasicCreateBalloonText);\n  CPPUNIT_TEST(TestComplexCreateBalloonText);\n  CPPUNIT_TEST(TestAllBalloonsFile);\n  CPPUNIT_TEST_SUITE_END();\n\n protected:\n  void TestBasicCreateBalloonText();\n  void TestComplexCreateBalloonText();\n  void TestAllBalloonsFile();\n\n private:\n  KmlFilePtr kml_file_;\n};\n\nCPPUNIT_TEST_SUITE_REGISTRATION(FeatureBalloonTest);\n\n\/\/ A struct of the KML content and the expected balloon text.\nconst static struct {\n  const char* kml;\n  const char* balloontext;\n} kKml[] = {\n  {\n    \/\/ A Feature with neither name nor description has no balloon text.\n    \/\/ TODO: geDirections is there by default?\n    \"<Placemark\/>\",\n    NULL\n  },\n  {\n    \"<Placemark><name>foo<\/name><\/Placemark>\",\n    \"<h3>foo<\/h3><br\/><br\/>\"\n  },\n  {\n    \"<Placemark><name>bar<\/name><description>goo<\/description><\/Placemark>\",\n    \"<h3>bar<\/h3><br\/><br\/>goo\"\n  },\n};\nvoid FeatureBalloonTest::TestBasicCreateBalloonText() {\n  for (size_t i = 0; i < sizeof(kKml)\/sizeof(kKml[0]); ++i) {\n    \/\/ Parse the file into a KmlFile object.\n    kml_file_ = KmlFile::CreateFromParse(kKml[i].kml, NULL);\n    \/\/ Extract the Placemark.\n    const PlacemarkPtr placemark = kmldom::AsPlacemark(kml_file_->root());\n    \/\/ Verify that that balloon text has been composited as expected.\n    const std::string kResult(CreateBalloonText(kml_file_, placemark));\n    if (kKml[i].balloontext == NULL) {\n      CPPUNIT_ASSERT(kResult.empty());\n    } else {\n      CPPUNIT_ASSERT_EQUAL(kResult,\n                           static_cast<std::string>(kKml[i].balloontext));\n    }\n  }\n}\n\nvoid FeatureBalloonTest::TestComplexCreateBalloonText() {\n  \/\/ A hunk of KML that requires the ballon to be composited from a\n  \/\/ BalloonStyle templated on Data and Schema\/SchemaData.\n  const std::string kKitchenSinkKml(\n      \"<Document>\"\n      \"<Schema name=\\\"TrailHeadType\\\" id=\\\"TrailHeadTypeId\\\">\"\n      \"<SimpleField type=\\\"string\\\" name=\\\"TrailHeadName\\\">\"\n      \"<displayName><![CDATA[<b>Trail Head Name<\/b>]]><\/displayName>\"\n      \"<\/SimpleField>\"\n      \"<SimpleField type=\\\"double\\\" name=\\\"TrailLength\\\">\"\n      \"<displayName><![CDATA[<i>The length in miles<\/i>]]><\/displayName>\"\n      \"<\/SimpleField>\"\n      \"<SimpleField type=\\\"int\\\" name=\\\"ElevationGain\\\">\"\n      \"<displayName><![CDATA[<i>change in altitude<\/i>]]><\/displayName>\"\n      \"<\/SimpleField>\"\n      \"<\/Schema>\"\n      \"<Placemark id=\\\"foo\\\" targetId=\\\"bar\\\">\"\n      \"<name>__NAME__<\/name>\"\n      \"<address>__ADDRESS__<\/address>\"\n      \"<Snippet>__SNIPPET__<\/Snippet>\"\n      \"<description>__DESCRIPTION__<\/description>\"\n      \"<Style>\"\n      \"<BalloonStyle>\"\n      \"<text><![CDATA[\"\n      \"<b>$[name]<\/b><br\/><br\/>\"\n      \"<i>$[description]<i><br\/><br\/>\"\n      \"The $[TrailHeadType\/TrailHeadName\/displayName] is\"\n      \"<i>$[TrailHeadType\/TrailHeadName]<\/i><br\/>\"\n      \"The trail is $[TrailHeadType\/TrailLength] miles<br\/>\"\n      \"The climb is $[TrailHeadType\/ElevationGain] meters<br\/><br\/>\"\n      \"$[geDirections]\"  \/\/ TODO.\n      \"]]><\/text>\"\n      \"<\/BalloonStyle>\"\n      \"<\/Style>\"\n      \"<ExtendedData>\"\n      \"<Data name=\\\"holeNumber\\\">\"\n      \"<value>1<\/value>\"\n      \"<\/Data>\"\n      \"<Data name=\\\"holeYardage\\\">\"\n      \"<value>234<\/value>\"\n      \"<\/Data>\"\n      \"<SchemaData schemaUrl=\\\"#TrailHeadTypeId\\\">\"\n      \"<SimpleData name=\\\"TrailHeadName\\\">Mount Everest<\/SimpleData>\"\n      \"<SimpleData name=\\\"TrailLength\\\">347.45<\/SimpleData>\"\n      \"<SimpleData name=\\\"ElevationGain\\\">10000<\/SimpleData>\"\n      \"<\/SchemaData>\"\n      \"<\/ExtendedData>\"\n      \"<Point>\"\n      \"<coordinates>-123.115786, 49.283323<\/coordinates>\"\n      \"<\/Point>\"\n      \"<\/Placemark>\"\n      \"<\/Document>\");\n\n  \/\/ The resultant balloon text from the above KML.\n  const std::string kKitchenSinkBalloonText(\n      \"<b>__NAME__<\/b><br\/><br\/>\"\n      \"<i>__DESCRIPTION__<i><br\/><br\/>\"\n      \"The <b>Trail Head Name<\/b> is\"\n      \"<i>Mount Everest<\/i><br\/>\"\n      \"The trail is 347.45 miles<br\/>\"\n      \"The climb is 10000 meters<br\/><br\/>\"\n      \"$[geDirections]\");  \/\/ TODO: geDirections.\n\n  \/\/ Parse the file into a KmlFile object.\n  kml_file_ = KmlFile::CreateFromParse(kKitchenSinkKml, NULL);\n\n  \/\/ Extract the Placemark.\n  const DocumentPtr doc = kmldom::AsDocument(kml_file_->root());\n  const PlacemarkPtr placemark =\n      kmldom::AsPlacemark(doc->get_feature_array_at(0));\n\n  \/\/ Verify that that balloon text has been composited as expected.\n  CPPUNIT_ASSERT_EQUAL(kKitchenSinkBalloonText,\n                       CreateBalloonText(kml_file_, placemark));\n}\n\n\/\/ A struct of the Feature ID from which we'll pull the KML content, and the\n\/\/ expected balloon text.\nconst static struct {\n  const char* featureid;\n  const char* balloontext;\n} kFeatures[] = {\n  {\n  \"empty-placemark\",\n  NULL\n  },\n  {\n  \"empty-name\",\n  \"<h3><\/h3><br\/><br\/>\"\n  },\n  {\n  \"empty-description\",\n  NULL\n  },\n  {\n  \"empty-name-description\",\n  \"<h3><\/h3><br\/><br\/>\"\n  },\n  {\n  \"name\",\n  \"<h3>named<\/h3><br\/><br\/>\"\n  },\n  {\n  \"name-description\",\n  \"<h3>named<\/h3><br\/><br\/>described\"\n  },\n  {\n  \"name-description-entity\",\n  \/\/ TODO: the one br is kind of odd...\n  \"<h3>named<\/h3><br\/><br\/>name is named<br \/>id is name-description-entity\"\n  },\n  {\n  \"simple-balloon-style\",\n  \/\/ TODO: same case as above\n  \"name is named<br \/>id is simple-balloon-style\"\n  },\n  {\n  \"extendeddata-data\",\n  \"to be or not to be that is the question\"\n  },\n  {\n  \"extendeddata-schemadata\",\n  \"She was called Balloon Girl and she had just turned 23\"\n  }\n};\n\nvoid FeatureBalloonTest::TestAllBalloonsFile() {\n  const std::string kBalloonKml = std::string(DATADIR) +\n                                  \"\/balloon\/all-balloons.kml\";\n  std::string data;\n  std::string errors;\n  CPPUNIT_ASSERT(kmlbase::File::ReadFileToString(kBalloonKml, &data));\n  kml_file_ = KmlFile::CreateFromParse(data, &errors);\n  CPPUNIT_ASSERT(!data.empty());\n  CPPUNIT_ASSERT(errors.empty());\n  CPPUNIT_ASSERT(kml_file_);\n  for (size_t i = 0; i < sizeof(kFeatures)\/sizeof(kFeatures[0]); ++i) {\n    \/\/ Extract the Placemark.\n    const FeaturePtr feature=\n        kmldom::AsFeature(kml_file_->GetObjectById(kFeatures[i].featureid));\n    \/\/ Verify that that balloon text has been composited as expected.\n    const std::string kActual(CreateBalloonText(kml_file_, feature));\n    if (kFeatures[i].balloontext == NULL) {\n      CPPUNIT_ASSERT(kActual.empty());\n      CPPUNIT_ASSERT_EQUAL(std::string(\"\"), kActual);\n    } else {\n      CPPUNIT_ASSERT_EQUAL(static_cast<std::string>(kFeatures[i].balloontext),\n                           kActual);\n    }\n  }\n}\n\n}  \/\/ end namespace kmlengine\n\nTEST_MAIN\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\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 \"OgreConfigFile.h\"\n#include \"OgreResourceGroupManager.h\"\n\n#include \"OgreException.h\"\n\n#include <iostream>\n\nnamespace Ogre {\n\n    \/\/-----------------------------------------------------------------------\n    ConfigFile::ConfigFile()\n    {\n    }\n    \/\/-----------------------------------------------------------------------\n    ConfigFile::~ConfigFile()\n    {\n        SettingsBySection::iterator seci, secend;\n        secend = mSettings.end();\n        for (seci = mSettings.begin(); seci != secend; ++seci)\n        {\n            OGRE_DELETE_T(seci->second, SettingsMultiMap, MEMCATEGORY_GENERAL);\n        }\n    }\n    \/\/-----------------------------------------------------------------------\n    void ConfigFile::clear(void)\n    {\n        for (SettingsBySection::iterator seci = mSettings.begin(); \n            seci != mSettings.end(); ++seci)\n        {\n             OGRE_DELETE_T(seci->second, SettingsMultiMap, MEMCATEGORY_GENERAL);\n        }\n        mSettings.clear();\n    }\n    \/\/-----------------------------------------------------------------------\n    void ConfigFile::load(const String& filename, const String& separators, bool trimWhitespace)\n    {\n        loadDirect(filename, separators, trimWhitespace);\n    }\n    \/\/-----------------------------------------------------------------------\n    void ConfigFile::load(const String& filename, const String& resourceGroup, \n        const String& separators, bool trimWhitespace)\n    {\n\t\tloadFromResourceSystem(filename, resourceGroup, separators, trimWhitespace);\n    }\n\t\/\/-----------------------------------------------------------------------\n\tvoid ConfigFile::loadDirect(const String& filename, const String& separators, \n\t\tbool trimWhitespace)\n\t{\n\t\t\/* Open the configuration file *\/\n\t\tstd::ifstream fp;\n        \/\/ Always open in binary mode\n\t\tfp.open(filename.c_str(), std::ios::in | std::ios::binary);\n\t\tif(!fp)\n\t\t\tOGRE_EXCEPT(\n\t\t\tException::ERR_FILE_NOT_FOUND, \"'\" + filename + \"' file not found!\", \"ConfigFile::load\" );\n\n\t\t\/\/ Wrap as a stream\n\t\tDataStreamPtr stream(OGRE_NEW FileStreamDataStream(filename, &fp, false));\n\t\tload(stream, separators, trimWhitespace);\n\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid ConfigFile::loadFromResourceSystem(const String& filename, \n\t\tconst String& resourceGroup, const String& separators, bool trimWhitespace)\n\t{\n\t\tDataStreamPtr stream = \n\t\t\tResourceGroupManager::getSingleton().openResource(filename, resourceGroup);\n\t\tload(stream, separators, trimWhitespace);\n\t}\n    \/\/-----------------------------------------------------------------------\n    void ConfigFile::load(const DataStreamPtr& stream, const String& separators, \n        bool trimWhitespace)\n    {\n        \/* Clear current settings map *\/\n        clear();\n\n        String currentSection = StringUtil::BLANK;\n        SettingsMultiMap* currentSettings = OGRE_NEW_T(SettingsMultiMap, MEMCATEGORY_GENERAL)();\n        mSettings[currentSection] = currentSettings;\n\n\n        \/* Process the file line for line *\/\n        String line, optName, optVal;\n        while (!stream->eof())\n        {\n            line = stream->getLine();\n            \/* Ignore comments & blanks *\/\n            if (line.length() > 0 && line.at(0) != '#' && line.at(0) != '@')\n            {\n                if (line.at(0) == '[' && line.at(line.length()-1) == ']')\n                {\n                    \/\/ Section\n                    currentSection = line.substr(1, line.length() - 2);\n\t\t\t\t\tSettingsBySection::const_iterator seci = mSettings.find(currentSection);\n\t\t\t\t\tif (seci == mSettings.end())\n\t\t\t\t\t{\n\t\t\t\t\t\tcurrentSettings = OGRE_NEW_T(SettingsMultiMap, MEMCATEGORY_GENERAL)();\n\t\t\t\t\t\tmSettings[currentSection] = currentSettings;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tcurrentSettings = seci->second;\n\t\t\t\t\t} \n                }\n                else\n                {\n                    \/* Find the first seperator character and split the string there *\/\n                    std::string::size_type separator_pos = line.find_first_of(separators, 0);\n                    if (separator_pos != std::string::npos)\n                    {\n                        optName = line.substr(0, separator_pos);\n                        \/* Find the first non-seperator character following the name *\/\n                        std::string::size_type nonseparator_pos = line.find_first_not_of(separators, separator_pos);\n                        \/* ... and extract the value *\/\n                        \/* Make sure we don't crash on an empty setting (it might be a valid value) *\/\n                        optVal = (nonseparator_pos == std::string::npos) ? \"\" : line.substr(nonseparator_pos);\n                        if (trimWhitespace)\n                        {\n                            StringUtil::trim(optVal);\n                            StringUtil::trim(optName);\n                        }\n                        currentSettings->insert(std::multimap<String, String>::value_type(optName, optVal));\n                    }\n                }\n            }\n        }\n    }\n    \/\/-----------------------------------------------------------------------\n    String ConfigFile::getSetting(const String& key, const String& section, const String& defaultValue) const\n    {\n        \n        SettingsBySection::const_iterator seci = mSettings.find(section);\n        if (seci == mSettings.end())\n        {\n            return defaultValue;\n        }\n        else\n        {\n            SettingsMultiMap::const_iterator i = seci->second->find(key);\n            if (i == seci->second->end())\n            {\n                return StringUtil::BLANK;\n            }\n            else\n            {\n                return i->second;\n            }\n        }\n    }\n    \/\/-----------------------------------------------------------------------\n    StringVector ConfigFile::getMultiSetting(const String& key, const String& section) const\n    {\n        StringVector ret;\n\n\n        SettingsBySection::const_iterator seci = mSettings.find(section);\n        if (seci != mSettings.end())\n        {\n            SettingsMultiMap::const_iterator i;\n\n            i = seci->second->find(key);\n            \/\/ Iterate over matches\n            while (i != seci->second->end() && i->first == key)\n            {\n                ret.push_back(i->second);\n                ++i;\n            }\n        }\n        return ret;\n\n\n    }\n    \/\/-----------------------------------------------------------------------\n    ConfigFile::SettingsIterator ConfigFile::getSettingsIterator(const String& section)\n    {\n        SettingsBySection::const_iterator seci = mSettings.find(section);\n        if (seci == mSettings.end())\n        {\n            OGRE_EXCEPT(Exception::ERR_ITEM_NOT_FOUND, \n                \"Cannot find section \" + section, \n                \"ConfigFile::getSettingsIterator\");\n        }\n        else\n        {\n            return SettingsIterator(seci->second->begin(), seci->second->end());\n        }\n    }\n    \/\/-----------------------------------------------------------------------\n    ConfigFile::SectionIterator ConfigFile::getSectionIterator(void)\n    {\n        return SectionIterator(mSettings.begin(), mSettings.end());\n    }\n\n}\n<commit_msg>Patch 2482278: return default value properly from ConfigFile::getSetting<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\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 \"OgreConfigFile.h\"\n#include \"OgreResourceGroupManager.h\"\n\n#include \"OgreException.h\"\n\n#include <iostream>\n\nnamespace Ogre {\n\n    \/\/-----------------------------------------------------------------------\n    ConfigFile::ConfigFile()\n    {\n    }\n    \/\/-----------------------------------------------------------------------\n    ConfigFile::~ConfigFile()\n    {\n        SettingsBySection::iterator seci, secend;\n        secend = mSettings.end();\n        for (seci = mSettings.begin(); seci != secend; ++seci)\n        {\n            OGRE_DELETE_T(seci->second, SettingsMultiMap, MEMCATEGORY_GENERAL);\n        }\n    }\n    \/\/-----------------------------------------------------------------------\n    void ConfigFile::clear(void)\n    {\n        for (SettingsBySection::iterator seci = mSettings.begin(); \n            seci != mSettings.end(); ++seci)\n        {\n             OGRE_DELETE_T(seci->second, SettingsMultiMap, MEMCATEGORY_GENERAL);\n        }\n        mSettings.clear();\n    }\n    \/\/-----------------------------------------------------------------------\n    void ConfigFile::load(const String& filename, const String& separators, bool trimWhitespace)\n    {\n        loadDirect(filename, separators, trimWhitespace);\n    }\n    \/\/-----------------------------------------------------------------------\n    void ConfigFile::load(const String& filename, const String& resourceGroup, \n        const String& separators, bool trimWhitespace)\n    {\n\t\tloadFromResourceSystem(filename, resourceGroup, separators, trimWhitespace);\n    }\n\t\/\/-----------------------------------------------------------------------\n\tvoid ConfigFile::loadDirect(const String& filename, const String& separators, \n\t\tbool trimWhitespace)\n\t{\n\t\t\/* Open the configuration file *\/\n\t\tstd::ifstream fp;\n        \/\/ Always open in binary mode\n\t\tfp.open(filename.c_str(), std::ios::in | std::ios::binary);\n\t\tif(!fp)\n\t\t\tOGRE_EXCEPT(\n\t\t\tException::ERR_FILE_NOT_FOUND, \"'\" + filename + \"' file not found!\", \"ConfigFile::load\" );\n\n\t\t\/\/ Wrap as a stream\n\t\tDataStreamPtr stream(OGRE_NEW FileStreamDataStream(filename, &fp, false));\n\t\tload(stream, separators, trimWhitespace);\n\n\t}\n\t\/\/-----------------------------------------------------------------------\n\tvoid ConfigFile::loadFromResourceSystem(const String& filename, \n\t\tconst String& resourceGroup, const String& separators, bool trimWhitespace)\n\t{\n\t\tDataStreamPtr stream = \n\t\t\tResourceGroupManager::getSingleton().openResource(filename, resourceGroup);\n\t\tload(stream, separators, trimWhitespace);\n\t}\n    \/\/-----------------------------------------------------------------------\n    void ConfigFile::load(const DataStreamPtr& stream, const String& separators, \n        bool trimWhitespace)\n    {\n        \/* Clear current settings map *\/\n        clear();\n\n        String currentSection = StringUtil::BLANK;\n        SettingsMultiMap* currentSettings = OGRE_NEW_T(SettingsMultiMap, MEMCATEGORY_GENERAL)();\n        mSettings[currentSection] = currentSettings;\n\n\n        \/* Process the file line for line *\/\n        String line, optName, optVal;\n        while (!stream->eof())\n        {\n            line = stream->getLine();\n            \/* Ignore comments & blanks *\/\n            if (line.length() > 0 && line.at(0) != '#' && line.at(0) != '@')\n            {\n                if (line.at(0) == '[' && line.at(line.length()-1) == ']')\n                {\n                    \/\/ Section\n                    currentSection = line.substr(1, line.length() - 2);\n\t\t\t\t\tSettingsBySection::const_iterator seci = mSettings.find(currentSection);\n\t\t\t\t\tif (seci == mSettings.end())\n\t\t\t\t\t{\n\t\t\t\t\t\tcurrentSettings = OGRE_NEW_T(SettingsMultiMap, MEMCATEGORY_GENERAL)();\n\t\t\t\t\t\tmSettings[currentSection] = currentSettings;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tcurrentSettings = seci->second;\n\t\t\t\t\t} \n                }\n                else\n                {\n                    \/* Find the first seperator character and split the string there *\/\n                    std::string::size_type separator_pos = line.find_first_of(separators, 0);\n                    if (separator_pos != std::string::npos)\n                    {\n                        optName = line.substr(0, separator_pos);\n                        \/* Find the first non-seperator character following the name *\/\n                        std::string::size_type nonseparator_pos = line.find_first_not_of(separators, separator_pos);\n                        \/* ... and extract the value *\/\n                        \/* Make sure we don't crash on an empty setting (it might be a valid value) *\/\n                        optVal = (nonseparator_pos == std::string::npos) ? \"\" : line.substr(nonseparator_pos);\n                        if (trimWhitespace)\n                        {\n                            StringUtil::trim(optVal);\n                            StringUtil::trim(optName);\n                        }\n                        currentSettings->insert(std::multimap<String, String>::value_type(optName, optVal));\n                    }\n                }\n            }\n        }\n    }\n    \/\/-----------------------------------------------------------------------\n    String ConfigFile::getSetting(const String& key, const String& section, const String& defaultValue) const\n    {\n        \n        SettingsBySection::const_iterator seci = mSettings.find(section);\n        if (seci == mSettings.end())\n        {\n            return defaultValue;\n        }\n        else\n        {\n            SettingsMultiMap::const_iterator i = seci->second->find(key);\n            if (i == seci->second->end())\n            {\n                return defaultValue;\n            }\n            else\n            {\n                return i->second;\n            }\n        }\n    }\n    \/\/-----------------------------------------------------------------------\n    StringVector ConfigFile::getMultiSetting(const String& key, const String& section) const\n    {\n        StringVector ret;\n\n\n        SettingsBySection::const_iterator seci = mSettings.find(section);\n        if (seci != mSettings.end())\n        {\n            SettingsMultiMap::const_iterator i;\n\n            i = seci->second->find(key);\n            \/\/ Iterate over matches\n            while (i != seci->second->end() && i->first == key)\n            {\n                ret.push_back(i->second);\n                ++i;\n            }\n        }\n        return ret;\n\n\n    }\n    \/\/-----------------------------------------------------------------------\n    ConfigFile::SettingsIterator ConfigFile::getSettingsIterator(const String& section)\n    {\n        SettingsBySection::const_iterator seci = mSettings.find(section);\n        if (seci == mSettings.end())\n        {\n            OGRE_EXCEPT(Exception::ERR_ITEM_NOT_FOUND, \n                \"Cannot find section \" + section, \n                \"ConfigFile::getSettingsIterator\");\n        }\n        else\n        {\n            return SettingsIterator(seci->second->begin(), seci->second->end());\n        }\n    }\n    \/\/-----------------------------------------------------------------------\n    ConfigFile::SectionIterator ConfigFile::getSectionIterator(void)\n    {\n        return SectionIterator(mSettings.begin(), mSettings.end());\n    }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ cagey-engine - Toy 3D Engine \n\/\/ Copyright (c) 2014 Kyle Girard <theycallmecoach@gmail.com>\n\/\/\n\/\/ The MIT License (MIT)\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\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#ifndef CAGEY_MATH_RADIAN_HH_\n#define CAGEY_MATH_RADIAN_HH_\n\n#include <cagey\/math\/BaseAngle.hh>\n\nnamespace cagey { \nnamespace math { \n\n\/**\n * Represents an Angle using Radians\n *\n * @tparam T Underlying type\n *\/\ntemplate<typename T> class Radian : public BaseAngle<Radian, T> {\npublic:\n  \/**\n   * Default constructor.  Initializes values to 0\n   *\/\n  constexpr Radian() = default;\n  \n  \/**\n   * Value Constructor.  Initializes the angle to the given value\n   *\n   * @param val the value for this Radian\n   *\/\n  constexpr explicit Radian(T const val) : BaseAngle<math::Radian, T>{val} {}\n  \n  \/**\n   * Conversion Constructor.  Initializes this Radian using the value from the\n   * given Radian\n   *\n   * @tparam U an arithmatic type\n   * @param val the Radian to copy\n   *\/\n  template<typename U>\n  constexpr explicit Radian(BaseAngle<math::Radian, U> val) : BaseAngle<math::Radian, T>{val} {}\n  \n  \/*constexpr Radian(Angle<Degree, T> val);*\/\n};\n\n\/**\n * Literal Operator. Converts a double to a Radian\n *\/\nconstexpr Radian<double> operator \"\" _rad(long double value) { return Radian<double>(value); }\n\n\/**\n * Literal Operator. Converts a float to a Radian\n *\/\nconstexpr Radian<float> operator \"\" _radf(long double value) { return Radian<float>(value); }\n\n\n\n} \/\/ namespace math\n} \/\/ namespace cagey\n\n\n#endif \/* CAGEY_MATH_RADIAN_HH_ *\/\n<commit_msg>Added Radian implementation<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ cagey-engine - Toy 3D Engine \n\/\/ Copyright (c) 2014 Kyle Girard <theycallmecoach@gmail.com>\n\/\/\n\/\/ The MIT License (MIT)\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\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#ifndef CAGEY_MATH_RADIAN_HH_\n#define CAGEY_MATH_RADIAN_HH_\n\n#include <cagey\/math\/MathFwd.hh>\n#include <cagey\/math\/BaseAngle.hh>\n#include <cagey\/math\/Constants.hh>\n\nnamespace cagey { \nnamespace math { \n\n\/**\n * Represents an Angle using Radians\n *\n * @tparam T Underlying type\n *\/\ntemplate<typename T> class Radian : public BaseAngle<Radian, T> {\npublic:\n  \/**\n   * Default constructor.  Initializes values to 0\n   *\/\n  constexpr Radian() = default;\n  \n  \/**\n   * Value Constructor.  Initializes the angle to the given value\n   *\n   * @param val the value for this Radian\n   *\/\n  constexpr explicit Radian(T const val) : BaseAngle<math::Radian, T>{val} {}\n  \n  \/**\n   * Conversion Constructor.  Initializes this Radian using the value from the\n   * given Radian\n   *\n   * @tparam U an arithmatic type\n   * @param val the Radian to copy\n   *\/\n  template<typename U>\n  constexpr explicit Radian(BaseAngle<math::Radian, U> val) : BaseAngle<math::Radian, T>{val} {}\n\n  \/**\n   * Convert Degree to Radian\n   * \n   * @param val Degree to convert to a Radian\n   *\/\n  constexpr explicit Radian(BaseAngle<Degree, T> val) : BaseAngle<math::Degree, T>{T{val}*constants::degToRad<T>}{}\n\n};\n\n\/**\n * Literal Operator. Converts a double to a Radian\n *\/\nconstexpr Radian<double> operator \"\" _rad(long double value) { return Radian<double>(value); }\n\n\/**\n * Literal Operator. Converts a float to a Radian\n *\/\nconstexpr Radian<float> operator \"\" _radf(long double value) { return Radian<float>(value); }\n\n\n\n} \/\/ namespace math\n} \/\/ namespace cagey\n\n\n#endif \/* CAGEY_MATH_RADIAN_HH_ *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/ #include <iostream>\n\/\/ #include \"AliAnalysisManager.h\"\n\/\/ #include \"AliESDInputHandler.h\"\n\/\/ #include \"AliMCEventHandler.h\"\n\/\/ #include \"AliAnalysisGrid.h\"\n\/\/ #include \"AliCentralitySelectionTask.h\"\n\/\/ #include \"AliAnalysisCentralitySelector.h\"\n\/\/ #include \"AliAnalysisTaskPerformanceStrange.h\"\n\/\/ #include \"TString.h\"\n\/\/ #include \"TChain.h\"\n\/\/ #include \"TAlienCollection.h\"\n\/\/ #include <fstream>\n\/\/ #include \"TObjString.h\"\n\/\/ #include \"TIterator.h\"\n\/\/ #include \"TGrid.h\"\n\/\/ #include \"TROOT.h\"\n\n\/\/ #include \"CreateAlienHandler.C\"\n\/\/ #include \n\nusing namespace std;\n\nenum { kMyRunModeLocal = 0, kMyRunModeCAF, kMyRunModeGRID};\n\nTList * listToLoad = new TList(); \/\/ Additional classes to be loaded, see InitAndLoadLibs\n\nTChain * GetAnalysisChain(const char * incollection);\nvoid InitAndLoadLibs(Int_t runMode=kMyRunModeLocal, Int_t workers=0,Bool_t debug=0) ;\n\nvoid run(const char * data, const char * passOrPath, Long64_t nev = -1, Long64_t offset = 0, Bool_t debug = kFALSE, Int_t runMode = 0, Bool_t isMC = 0, Bool_t usePID = kTRUE, const char* option = \"\",TString customSuffix = \"\", Int_t workers = -1, const char * gridMode=\"full\")\n{\n  \/\/ runMode:\n  \/\/\n  \/\/ 0 local \n  \/\/ 1 proof\n  \/\/ 2 grid\n\n  if (nev < 0)\n    nev = 1234567890;\n  InitAndLoadLibs(runMode,workers,debug);\n\n  \/\/ Create the analysis manager\n  AliAnalysisManager * mgr = new AliAnalysisManager;\n\n  \/\/ Add ESD handler\n  AliESDInputHandler* esdH = new AliESDInputHandler;\n  \/\/ Do I need any of this? \n  \/\/ esdH->SetInactiveBranches(\"AliESDACORDE FMD ALIESDTZERO ALIESDZDC AliRawDataErrorLogs CaloClusters Cascades EMCALCells EMCALTrigger ESDfriend Kinks AliESDTZERO ALIESDACORDE MuonTracks TrdTracks\");\n  mgr->SetInputEventHandler(esdH);\n\n  if(isMC) {\n    AliMCEventHandler* handler = new AliMCEventHandler;\n    handler->SetPreReadMode(AliMCEventHandler::kLmPreRead);\n    mgr->SetMCtruthEventHandler(handler);\n  }\n\n\n  \/\/ If we are running on grid, we need the alien handler\n  if (runMode == kMyRunModeGRID) {\n    \/\/ Create and configure the alien handler plugin\n    TGrid::Connect(\"alien:\/\/\");\/\/ Why do I need this? Without a get a bus error...\n    \/\/    gROOT->LoadMacro(\"CreateAlienHandler.C\");\n    AliAnalysisGrid *alienHandler = CreateAlienHandler(data, listToLoad, gridMode, isMC);  \n    if (!alienHandler) {\n      cout << \"Cannot create alien handler\" << endl;    \n      exit(1);\n    }\n    mgr->SetGridHandler(alienHandler);  \n  }\n  \n\n  \/\/ Physics selection\n  gROOT->ProcessLine(\".L $ALICE_ROOT\/ANALYSIS\/macros\/AddTaskPhysicsSelection.C\");\n  AliPhysicsSelectionTask * physicsSelectionTask = AddTaskPhysicsSelection(isMC);\n\n  \/\/ Centrality\n  gROOT->LoadMacro(\"$ALICE_ROOT\/ANALYSIS\/macros\/AddTaskCentrality.C\");\n  AliCentralitySelectionTask *taskCentrality = AddTaskCentrality();\n\n  AliAnalysisCentralitySelector * centrSelector = new AliAnalysisCentralitySelector();\n  centrSelector->SetIsMC(isMC);\n  centrSelector->SetCentralityEstimator(\"V0M\"); \/\/ Todo: add parameter to macro?\n\n  \/\/ Parse option strings\n  TString optionStr(option);\n  \n  \/\/ remove SAVE option if set\n  Bool_t doSave = kFALSE;\n\n  if (optionStr.Contains(\"SAVE\"))\n    {\n      optionStr = optionStr(0,optionStr.Index(\"SAVE\")) + optionStr(optionStr.Index(\"SAVE\")+4, optionStr.Length());\n      doSave = kTRUE;\n    }\n  TString pathsuffix = \"\";\n  \/\/ Not used, but may be useful\n  Bool_t useMCKinematics = isMC;\n  if (optionStr.Contains(\"NOMCKIN\")) {\n    cout << \">>>> Ignoring MC kinematics\" << endl;\n    useMCKinematics=kFALSE;\n    pathsuffix+=\"_NOMCKIN\";\n  }\n  \n  gROOT->ProcessLine(\".L AddTaskLambdaK0PbPb.C\");\n  Int_t nbin = 0; \/\/ will contain the number of centrality bins\n  AliAnalysisTaskPerformanceStrange ** task = AddTaskLambdaK0PbPb(\"lambdak0.root\", centrSelector, nbin); \/\/ FIXME also pass cuts, centrality bin type selection(5,10% percentiles, ranges...)\n  \/\/ configure task\n  \/\/  else if (iAODanalysis) task->SetAnalysisType(\"AOD\");\n  \/\/ FIXME: add options to macro\n  \/\/ FIXME: put physics selection inside the task\n  cout << nbin << endl;\n  \n  for(Int_t ibin = 0; ibin < nbin; ibin++){\n    cout << \"ibin \" << ibin << \"  \"<< endl;\/\/task[ibin] << endl;\n    \n    task[ibin]->SetAnalysisType(\"ESD\");\n    cout << \"1\" << endl;\n    task[ibin]->SetAnalysisMC(isMC); \/\/ 0 or 1\n    cout << \"2\" << endl;\n    task[ibin]->SetCollidingSystems(1); \/\/ 0 =pp, 1=AA\n    cout << \"3\" << endl;\n    task[ibin]->SetAnalysisCut(\"no\");\n    cout << \"4\" << endl;\n    if(usePID) \n      task[ibin]->SetUsePID(\"withPID\"); \/\/ withPID or withoutPID\n    else\n      task[ibin]->SetUsePID(\"withoutPID\"); \/\/ withPID or withoutPID\n    cout << \"5\" << endl;\n  }\n\n  \/\/ Init and run the analy\n  if (!mgr->InitAnalysis()) return;\n\n  mgr->PrintStatus();\n  \n  if (runMode == kMyRunModeLocal ) {\n    \/\/ If running in local mode, create chain of ESD files\n    cout << \"RUNNING LOCAL, CHAIN\" << endl;    \n    TChain * chain = GetAnalysisChain(data);\n    \/\/    chain->Print();\n    mgr->StartAnalysis(\"local\",chain,nev);\n  } else if (runMode == kMyRunModeCAF) {\n    mgr->StartAnalysis(\"proof\",TString(passOrPath)+TString(data)+\"#esdTree\",nev);\n  } else if (runMode == kMyRunModeGRID) {\n    mgr->StartAnalysis(\"grid\");\n  } else {\n    cout << \"ERROR: unknown run mode\" << endl;        \n  }\n\n  pathsuffix += customSuffix;\n\n  if (doSave) MoveOutput(data, pathsuffix.Data());\n\n  \n}\n\nvoid MoveOutput(const char * data, const char * suffix = \"\"){\n\n  TString path(\"output\/\");\n  path = path + TString(data).Tokenize(\"\/\")->Last()->GetName() + suffix;\n  \n  TString fileName = \"lambdak0.root\";\n  gSystem->mkdir(path, kTRUE);\n  gSystem->Rename(fileName, path + \"\/\" + fileName);\n  for(Int_t ibin = 0; ibin < 20; ibin++){\n    TString fileBin = fileName;\n    fileBin.ReplaceAll(\".root\",Form(\"_%2.2d.root\",ibin));\n    gSystem->Rename(fileBin, path + \"\/\" + fileBin);    \n  }\n  \n  gSystem->Rename(\"event_stat.root\", path + \"\/event_stat.root\");      \n  gSystem->Rename(\"EventStat_temp.root\", path + \"\/EventStat_temp.root\");      \n  Printf(\">>>>> Moved files to %s\", path.Data());\n}  \n\n\n\nTChain * GetAnalysisChain(const char * incollection){\n  \/\/ Builds a chain of esd files\n  \/\/ incollection can be\n  \/\/ - a single root file\n  \/\/ - an xml collection of files on alien\n  \/\/ - a ASCII containing a list of local root files\n\n  TChain* analysisChain = 0;\n  \/\/ chain\n  analysisChain = new TChain(\"esdTree\");\n  if (TString(incollection).Contains(\".root\")){\n    analysisChain->Add(incollection);\n  }\n  else if (TString(incollection).Contains(\"xml\")){\n    TGrid::Connect(\"alien:\/\/\");\n    TGridCollection * coll = TAlienCollection::Open (incollection);\n    while(coll->Next()){\n      analysisChain->Add(TString(\"alien:\/\/\")+coll->GetLFN());\n    }\n  } else {\n    ifstream file_collect(incollection);\n    TString line;\n    while (line.ReadLine(file_collect) ) {\n      analysisChain->Add(line.Data());\n    }\n  }\n  analysisChain->GetListOfFiles()->Print();\n\n  return analysisChain;\n}\n\n\nvoid InitAndLoadLibs(Int_t runMode, Int_t workers,Bool_t debug) {\n  \/\/ Loads libs and par files + custom task and classes (the order is important)\n  listToLoad->Add(new TObjString(\"$ALICE_ROOT\/STEER\/AliCentrality.cxx\")); \/\/ FIXME: why do I have to load it?!?\n  listToLoad->Add(new TObjString(\"AliAnalysisCentralitySelector.cxx\"));\n  listToLoad->Add(new TObjString(\"AliAnalysisTaskPerformanceStrange.cxx\"));\n\n  if (runMode == kMyRunModeCAF)\n    {\n      cout << \"Init in CAF mode\" << endl;\n    \n      gEnv->SetValue(\"XSec.GSI.DelegProxy\", \"2\");\n      TProof * p = TProof::Open(\"alice-caf.cern.ch\", workers>0 ? Form(\"workers=%d\",workers) : \"\");\n      \/\/TProof * p = TProof::Open(\"skaf.saske.sk\", workers>0 ? Form(\"workers=%d\",workers) : \"\");    \n      p->Exec(\"TObject *o = gEnv->GetTable()->FindObject(\\\"Proof.UseMergers\\\"); gEnv->GetTable()->Remove(o);\", kTRUE); \/\/ avoid submerging\n      \/\/gProof->EnablePackage(\"VO_ALICE@AliRoot::v4-21-11-AN\");\n \n\n      \/\/ Enable the needed package\n      \/\/ FIXME: what if I don't want to use par files?\n      gSystem->AddIncludePath(\"-I${ALICE_ROOT}\/include\/\");\n      gSystem->AddIncludePath(\"-I${ALICE_ROOT}\/STEER\/\");\n      gProof->UploadPackage(\"$ALICE_ROOT\/obj\/STEERBase\");\n      gProof->EnablePackage(\"$ALICE_ROOT\/obj\/STEERBase\");\n      gProof->UploadPackage(\"$ALICE_ROOT\/obj\/ESD\");\n      gProof->EnablePackage(\"$ALICE_ROOT\/obj\/ESD\");\n      gProof->UploadPackage(\"$ALICE_ROOT\/obj\/AOD\");\n      gProof->EnablePackage(\"$ALICE_ROOT\/obj\/AOD\");\n      gProof->UploadPackage(\"$ALICE_ROOT\/obj\/ANALYSIS\");\n      gProof->EnablePackage(\"$ALICE_ROOT\/obj\/ANALYSIS\");\n      gProof->UploadPackage(\"$ALICE_ROOT\/obj\/ANALYSISalice\");\n      gProof->EnablePackage(\"$ALICE_ROOT\/obj\/ANALYSISalice\");\n      gProof->UploadPackage(\"$ALICE_ROOT\/obj\/CORRFW\");\n      gProof->EnablePackage(\"$ALICE_ROOT\/obj\/CORRFW\");\n      gProof->UploadPackage(\"~\/Desktop\/OADB\");\/\/FIXME\n      gProof->EnablePackage(\"~\/Desktop\/OADB\");\/\/FIXME\n      \n    }\n  else\n    {\n      cout << \"Init in Local or Grid mode\" << endl;\n      gSystem->Load(\"libCore.so\");  \n      gSystem->Load(\"libTree.so\");\n      gSystem->Load(\"libGeom.so\");\n      gSystem->Load(\"libVMC.so\");\n      gSystem->Load(\"libPhysics.so\");\n      gSystem->Load(\"libSTEERBase\");\n      gSystem->Load(\"libESD\");\n      gSystem->Load(\"libAOD\");\n      gSystem->Load(\"libANALYSIS\");\n      gSystem->Load(\"libANALYSISalice\");   \n\n      \/\/ gSystem->Load(\"libVMC\");\n      gROOT->ProcessLine(\".include $ALICE_ROOT\/include\");\n      gROOT->ProcessLine(\".include $ALICE_ROOT\/STEER\");\n    }\n  \/\/ Load helper classes\n  TIterator * iter = listToLoad->MakeIterator();\n  TObjString * name = 0;\n  while ((name = (TObjString *)iter->Next())) {\n    gSystem->ExpandPathName(name->String());\n    cout << name->String().Data() << endl;\n    if (runMode == kMyRunModeCAF) {\n      gProof->Load(name->String()+(debug?\"++g\":\"+\"));   \n    } else {\n      gROOT->LoadMacro(name->String()+(debug?\"++g\":\"+\"));   \n    }\n  }\n\n}\n<commit_msg>using v4-21-13-AN<commit_after>\/\/ #include <iostream>\n\/\/ #include \"AliAnalysisManager.h\"\n\/\/ #include \"AliESDInputHandler.h\"\n\/\/ #include \"AliMCEventHandler.h\"\n\/\/ #include \"AliAnalysisGrid.h\"\n\/\/ #include \"AliCentralitySelectionTask.h\"\n\/\/ #include \"AliAnalysisCentralitySelector.h\"\n\/\/ #include \"AliAnalysisTaskPerformanceStrange.h\"\n\/\/ #include \"TString.h\"\n\/\/ #include \"TChain.h\"\n\/\/ #include \"TAlienCollection.h\"\n\/\/ #include <fstream>\n\/\/ #include \"TObjString.h\"\n\/\/ #include \"TIterator.h\"\n\/\/ #include \"TGrid.h\"\n\/\/ #include \"TROOT.h\"\n\n\/\/ #include \"CreateAlienHandler.C\"\n\/\/ #include \n\nusing namespace std;\n\nenum { kMyRunModeLocal = 0, kMyRunModeCAF, kMyRunModeGRID};\n\nTList * listToLoad = new TList(); \/\/ Additional classes to be loaded, see InitAndLoadLibs\n\nTChain * GetAnalysisChain(const char * incollection);\nvoid InitAndLoadLibs(Int_t runMode=kMyRunModeLocal, Int_t workers=0,Bool_t debug=0) ;\n\nvoid run(const char * data, const char * passOrPath, Long64_t nev = -1, Long64_t offset = 0, Bool_t debug = kFALSE, Int_t runMode = 0, Bool_t isMC = 0, Bool_t usePID = kTRUE, const char* option = \"\",TString customSuffix = \"\", Int_t workers = -1, const char * gridMode=\"full\")\n{\n  \/\/ runMode:\n  \/\/\n  \/\/ 0 local \n  \/\/ 1 proof\n  \/\/ 2 grid\n\n  if (nev < 0)\n    nev = 1234567890;\n  InitAndLoadLibs(runMode,workers,debug);\n\n  \/\/ Create the analysis manager\n  AliAnalysisManager * mgr = new AliAnalysisManager;\n\n  \/\/ Add ESD handler\n  AliESDInputHandler* esdH = new AliESDInputHandler;\n  \/\/ Do I need any of this? \n  \/\/ esdH->SetInactiveBranches(\"AliESDACORDE FMD ALIESDTZERO ALIESDZDC AliRawDataErrorLogs CaloClusters Cascades EMCALCells EMCALTrigger ESDfriend Kinks AliESDTZERO ALIESDACORDE MuonTracks TrdTracks\");\n  mgr->SetInputEventHandler(esdH);\n\n  if(isMC) {\n    AliMCEventHandler* handler = new AliMCEventHandler;\n    handler->SetPreReadMode(AliMCEventHandler::kLmPreRead);\n    mgr->SetMCtruthEventHandler(handler);\n  }\n\n\n  \/\/ If we are running on grid, we need the alien handler\n  if (runMode == kMyRunModeGRID) {\n    \/\/ Create and configure the alien handler plugin\n    TGrid::Connect(\"alien:\/\/\");\/\/ Why do I need this? Without a get a bus error...\n    \/\/    gROOT->LoadMacro(\"CreateAlienHandler.C\");\n    AliAnalysisGrid *alienHandler = CreateAlienHandler(data, listToLoad, gridMode, isMC);  \n    if (!alienHandler) {\n      cout << \"Cannot create alien handler\" << endl;    \n      exit(1);\n    }\n    mgr->SetGridHandler(alienHandler);  \n  }\n  \n\n  \/\/ Physics selection\n  gROOT->ProcessLine(\".L $ALICE_ROOT\/ANALYSIS\/macros\/AddTaskPhysicsSelection.C\");\n  AliPhysicsSelectionTask * physicsSelectionTask = AddTaskPhysicsSelection(isMC);\n\n  \/\/ Centrality\n  gROOT->LoadMacro(\"$ALICE_ROOT\/ANALYSIS\/macros\/AddTaskCentrality.C\");\n  AliCentralitySelectionTask *taskCentrality = AddTaskCentrality();\n\n  AliAnalysisCentralitySelector * centrSelector = new AliAnalysisCentralitySelector();\n  centrSelector->SetIsMC(isMC);\n  centrSelector->SetCentralityEstimator(\"V0M\"); \/\/ Todo: add parameter to macro?\n\n  \/\/ Parse option strings\n  TString optionStr(option);\n  \n  \/\/ remove SAVE option if set\n  Bool_t doSave = kFALSE;\n\n  if (optionStr.Contains(\"SAVE\"))\n    {\n      optionStr = optionStr(0,optionStr.Index(\"SAVE\")) + optionStr(optionStr.Index(\"SAVE\")+4, optionStr.Length());\n      doSave = kTRUE;\n    }\n  TString pathsuffix = \"\";\n  \/\/ Not used, but may be useful\n  Bool_t useMCKinematics = isMC;\n  if (optionStr.Contains(\"NOMCKIN\")) {\n    cout << \">>>> Ignoring MC kinematics\" << endl;\n    useMCKinematics=kFALSE;\n    pathsuffix+=\"_NOMCKIN\";\n  }\n  \n  gROOT->ProcessLine(\".L AddTaskLambdaK0PbPb.C\");\n  Int_t nbin = 0; \/\/ will contain the number of centrality bins\n  AliAnalysisTaskPerformanceStrange ** task = AddTaskLambdaK0PbPb(\"lambdak0.root\", centrSelector, nbin); \/\/ FIXME also pass cuts, centrality bin type selection(5,10% percentiles, ranges...)\n  \/\/ configure task\n  \/\/  else if (iAODanalysis) task->SetAnalysisType(\"AOD\");\n  \/\/ FIXME: add options to macro\n  \/\/ FIXME: put physics selection inside the task\n  cout << nbin << endl;\n  \n  for(Int_t ibin = 0; ibin < nbin; ibin++){\n    cout << \"ibin \" << ibin << \"  \"<< endl;\/\/task[ibin] << endl;\n    \n    task[ibin]->SetAnalysisType(\"ESD\");\n    cout << \"1\" << endl;\n    task[ibin]->SetAnalysisMC(isMC); \/\/ 0 or 1\n    cout << \"2\" << endl;\n    task[ibin]->SetCollidingSystems(1); \/\/ 0 =pp, 1=AA\n    cout << \"3\" << endl;\n    task[ibin]->SetAnalysisCut(\"no\");\n    cout << \"4\" << endl;\n    if(usePID) \n      task[ibin]->SetUsePID(\"withPID\"); \/\/ withPID or withoutPID\n    else\n      task[ibin]->SetUsePID(\"withoutPID\"); \/\/ withPID or withoutPID\n    cout << \"5\" << endl;\n  }\n\n  \/\/ Init and run the analy\n  if (!mgr->InitAnalysis()) return;\n\n  mgr->PrintStatus();\n  \n  if (runMode == kMyRunModeLocal ) {\n    \/\/ If running in local mode, create chain of ESD files\n    cout << \"RUNNING LOCAL, CHAIN\" << endl;    \n    TChain * chain = GetAnalysisChain(data);\n    \/\/    chain->Print();\n    mgr->StartAnalysis(\"local\",chain,nev);\n  } else if (runMode == kMyRunModeCAF) {\n    mgr->StartAnalysis(\"proof\",TString(passOrPath)+TString(data)+\"#esdTree\",nev);\n  } else if (runMode == kMyRunModeGRID) {\n    mgr->StartAnalysis(\"grid\");\n  } else {\n    cout << \"ERROR: unknown run mode\" << endl;        \n  }\n\n  pathsuffix += customSuffix;\n\n  if (doSave) MoveOutput(data, pathsuffix.Data());\n\n  \n}\n\nvoid MoveOutput(const char * data, const char * suffix = \"\"){\n\n  TString path(\"output\/\");\n  path = path + TString(data).Tokenize(\"\/\")->Last()->GetName() + suffix;\n  \n  TString fileName = \"lambdak0.root\";\n  gSystem->mkdir(path, kTRUE);\n  gSystem->Rename(fileName, path + \"\/\" + fileName);\n  for(Int_t ibin = 0; ibin < 20; ibin++){\n    TString fileBin = fileName;\n    fileBin.ReplaceAll(\".root\",Form(\"_%2.2d.root\",ibin));\n    gSystem->Rename(fileBin, path + \"\/\" + fileBin);    \n  }\n  \n  gSystem->Rename(\"event_stat.root\", path + \"\/event_stat.root\");      \n  gSystem->Rename(\"EventStat_temp.root\", path + \"\/EventStat_temp.root\");      \n  Printf(\">>>>> Moved files to %s\", path.Data());\n}  \n\n\n\nTChain * GetAnalysisChain(const char * incollection){\n  \/\/ Builds a chain of esd files\n  \/\/ incollection can be\n  \/\/ - a single root file\n  \/\/ - an xml collection of files on alien\n  \/\/ - a ASCII containing a list of local root files\n\n  TChain* analysisChain = 0;\n  \/\/ chain\n  analysisChain = new TChain(\"esdTree\");\n  if (TString(incollection).Contains(\".root\")){\n    analysisChain->Add(incollection);\n  }\n  else if (TString(incollection).Contains(\"xml\")){\n    TGrid::Connect(\"alien:\/\/\");\n    TGridCollection * coll = TAlienCollection::Open (incollection);\n    while(coll->Next()){\n      analysisChain->Add(TString(\"alien:\/\/\")+coll->GetLFN());\n    }\n  } else {\n    ifstream file_collect(incollection);\n    TString line;\n    while (line.ReadLine(file_collect) ) {\n      analysisChain->Add(line.Data());\n    }\n  }\n  analysisChain->GetListOfFiles()->Print();\n\n  return analysisChain;\n}\n\n\nvoid InitAndLoadLibs(Int_t runMode, Int_t workers,Bool_t debug) {\n  \/\/ Loads libs and par files + custom task and classes (the order is important)\n  listToLoad->Add(new TObjString(\"$ALICE_ROOT\/STEER\/AliCentrality.cxx\")); \/\/ FIXME: why do I have to load it?!?\n  listToLoad->Add(new TObjString(\"AliAnalysisCentralitySelector.cxx\"));\n  listToLoad->Add(new TObjString(\"AliAnalysisTaskPerformanceStrange.cxx\"));\n\n  if (runMode == kMyRunModeCAF)\n    {\n      cout << \"Init in CAF mode\" << endl;\n    \n      gEnv->SetValue(\"XSec.GSI.DelegProxy\", \"2\");\n      TProof * p = TProof::Open(\"alice-caf.cern.ch\", workers>0 ? Form(\"workers=%d\",workers) : \"\");\n      \/\/TProof * p = TProof::Open(\"skaf.saske.sk\", workers>0 ? Form(\"workers=%d\",workers) : \"\");    \n      p->Exec(\"TObject *o = gEnv->GetTable()->FindObject(\\\"Proof.UseMergers\\\"); gEnv->GetTable()->Remove(o);\", kTRUE); \/\/ avoid submerging\n      gProof->EnablePackage(\"VO_ALICE@AliRoot::v4-21-13-AN\");\n \n\n      \/\/ Enable the needed package\n      \/\/ FIXME: what if I don't want to use par files?\n      gSystem->AddIncludePath(\"-I${ALICE_ROOT}\/include\/\");\n      gSystem->AddIncludePath(\"-I${ALICE_ROOT}\/STEER\/\");\n      \/\/ gProof->UploadPackage(\"$ALICE_ROOT\/obj\/STEERBase\");\n      \/\/ gProof->EnablePackage(\"$ALICE_ROOT\/obj\/STEERBase\");\n      \/\/ gProof->UploadPackage(\"$ALICE_ROOT\/obj\/ESD\");\n      \/\/ gProof->EnablePackage(\"$ALICE_ROOT\/obj\/ESD\");\n      \/\/ gProof->UploadPackage(\"$ALICE_ROOT\/obj\/AOD\");\n      \/\/ gProof->EnablePackage(\"$ALICE_ROOT\/obj\/AOD\");\n      \/\/ gProof->UploadPackage(\"$ALICE_ROOT\/obj\/ANALYSIS\");\n      \/\/ gProof->EnablePackage(\"$ALICE_ROOT\/obj\/ANALYSIS\");\n      \/\/ gProof->UploadPackage(\"$ALICE_ROOT\/obj\/ANALYSISalice\");\n      \/\/ gProof->EnablePackage(\"$ALICE_ROOT\/obj\/ANALYSISalice\");\n      \/\/ gProof->UploadPackage(\"$ALICE_ROOT\/obj\/CORRFW\");\n      \/\/ gProof->EnablePackage(\"$ALICE_ROOT\/obj\/CORRFW\");\n      \/\/ gProof->UploadPackage(\"~\/Desktop\/OADB\");\/\/FIXME\n      \/\/ gProof->EnablePackage(\"~\/Desktop\/OADB\");\/\/FIXME\n      \n    }\n  else\n    {\n      cout << \"Init in Local or Grid mode\" << endl;\n      gSystem->Load(\"libCore.so\");  \n      gSystem->Load(\"libTree.so\");\n      gSystem->Load(\"libGeom.so\");\n      gSystem->Load(\"libVMC.so\");\n      gSystem->Load(\"libPhysics.so\");\n      gSystem->Load(\"libSTEERBase\");\n      gSystem->Load(\"libESD\");\n      gSystem->Load(\"libAOD\");\n      gSystem->Load(\"libANALYSIS\");\n      gSystem->Load(\"libANALYSISalice\");   \n\n      \/\/ gSystem->Load(\"libVMC\");\n      gROOT->ProcessLine(\".include $ALICE_ROOT\/include\");\n      gROOT->ProcessLine(\".include $ALICE_ROOT\/STEER\");\n    }\n  \/\/ Load helper classes\n  TIterator * iter = listToLoad->MakeIterator();\n  TObjString * name = 0;\n  while ((name = (TObjString *)iter->Next())) {\n    gSystem->ExpandPathName(name->String());\n    cout << name->String().Data() << endl;\n    if (runMode == kMyRunModeCAF) {\n      gProof->Load(name->String()+(debug?\"++g\":\"+\"));   \n    } else {\n      gROOT->LoadMacro(name->String()+(debug?\"++g\":\"+\"));   \n    }\n  }\n\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>update mulmod<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2010-2013, Vrije Universiteit Brussel.\n * All rights reserved.\n *\/\n\n#include <cmath>\n#include <iostream>\n#include <sstream>\n#include <getopt.h>\n#include <shark.hpp>\n\nusing namespace std;\nusing namespace shark;\nusing namespace shark::types3d;\n\nvoid init_pyramid(GlobalArrayD& ga)\n{\n\tconst coords_range outer = { ga.domain().total().lower - ga.ghost_width(), ga.domain().total().upper + ga.ghost_width() };\n\tconst vecD one = {{1.0, 1.0, 1.0}};\n\tconst vecD mid = {{0.5, 0.5, 0.5}};\n\n\tga = 1.0 - max_element(abs(coord_vec(ga.domain(), outer, one) - mid)) \/ 0.5;\n}\n\nvoid heat(const GlobalArrayD& ga, GlobalArrayD& gb, double nu)\n{\n\t\/\/ Sync and make sure ga is complete\n\tga.update();\n\n        coords left =  { -1,  0,  0};\n        coords right = {  1,  0,  0};\n        coords above = {  0, -1,  0};\n        coords below = {  0,  1,  0};\n        coords  back = {  0,  0, -1};\n        coords front = {  0,  0,  1};\n\n        gb = ga + nu * (\n                        shift(ga, left) + \n                        shift(ga,right) + \n                        shift(ga,above) +\n                        shift(ga,below) +\n                        shift(ga, back) +\n                        shift(ga,front)\n                        - 7 * ga);\n\n}\n\nint heat_loop(int n, GlobalArrayD& ga, GlobalArrayD& gb, int nr, double dt) {\n\tdouble nu = dt * n * n * n;\n        int k;\n\n        double start = Wtime();\n        double end = start;\n\n\tfor(k = 0; (end-start) < nr; k++)\n\t{\n\t\tif (k % 2 == 0)\n\t\t\theat(ga, gb, nu);\n\t\telse\n\t\t\theat(gb, ga, nu);\n\n                end = Wtime();\n\t}\n\n        return k;\n}\n\nint main(int argc, char **argv)\n{\n\tInit(&argc, &argv);\n\n\t\/\/Default values that might be overridden by options\n\tint nr = 2; \/\/ run for 2seconds\n\tint n = 511;\t\/\/incremented by one internally\n\tbool block = false;\n\n\t\/\/Process arguments\n\tint ch;\n\n\twhile((ch = getopt(argc, argv, \"n:i:t:bh\")) != -1)\n\t{\n\t\tswitch(ch)\n\t\t{\n\t\t\tcase 'n':\n\t\t\t\t{\n\t\t\t\t\tistringstream iss(optarg);\n\t\t\t\t\tiss >> n;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 'i':\n\t\t\t\t{\n\t\t\t\t\tistringstream iss(optarg);\n\t\t\t\t\tiss >> nr; \n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 't':\n\t\t\t\t{\n\t\t\t\t\tistringstream iss(optarg);\n\t\t\t\t\tiss >> nthrds;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 'b':\n\t\t\t\tblock = true;\n\t\t\t\tbreak;\n\t\t\tcase 'h':\n\t\t\tcase '?':\n\t\t\tdefault:\n\t\t\t\tcerr << \"Usage: \" << argv[0] << \" [-n <grid-cells>] [-i <iterations>] [-t <threads>]\\n\" << endl;\n\t\t\t\tAbort(1);\n\t\t}\n\t}\n\n\tif(world().procid == 0)\n\t{\n\t\tcerr << \"sched: \" << sched << endl;\n\t\tcerr << \"n: \" << n  << \" (\" << n*n*n*sizeof(double)\/1e9 << \"GB)\" << endl;\n\t\tcerr << \"nr: \" << nr << \" sec\" << endl;\n\t\tcerr << \"block: \" << boolalpha << block << noboolalpha << endl;\n\t\tcerr << \"nprocs: \" << world().nprocs << endl;\n\t\tcerr << \"nthrds: \" << nthrds << endl;\n\t}\n\n\t\/\/Declare auxiliary variables and run\t\n\tdouble dt = 0.25 \/ n \/ n;\n\tSetupThreads();\n\n\t{\n\t\tconst coords size  = {{n,n,n}};\n\t\tconst coords ghost = {{1,1,1}};\n\n\t\tconst array<int,3> pcoords = {{ 0, 0, block ? 0 : 1 }};\n\t\tDomain d(world(), size, pcoords);\n\n\t\tif(world().procid == 0)\n\t\t\td.outputDistribution(cerr);\n\n\t\ttypename GlobalArrayD::bounds bd = {{ BoundaryD::constant(0.0), BoundaryD::constant(0.0) }};\n\n\t\tGlobalArrayD ga(d, ghost, false, bd);\n\t\tGlobalArrayD gb(d, ghost, false, bd);\n\t\tworld().sync();\n\n\t\tinit_pyramid(ga);\n\n\t\tdouble e0 = norm1(ga) \/ n \/ n;\n\t\tdouble f0 = norm2(ga) \/ n \/ n;\n\n\t\tif(world().procid == 0)\n\t\t{\n\t\t\tcerr << \"e0: \" << e0 << endl;\n\t\t\tcerr << \"f0: \" << f0 << endl;\n\t\t}\n\n\t\tdouble starttime = Wtime();\n\t\tint iter = heat_loop(n, ga, gb, nr, dt);\n\t\tdouble endtime = Wtime();\n\t\tdouble e1 = norm1(ga) \/ n \/ n;\n\t\tdouble f1 = norm2(ga) \/ n \/ n;\n\n\t\tif(world().procid == 0)\n\t\t{\n\t\t\tcerr << \"e1: \" << e1 << endl;\n\t\t\tcerr << \"f1: \" << f1 << endl;\n\t\t\tcerr << \"t: \" << dt * nr << endl;\n                        cerr << \"iter: \" << iter << endl;\n\t\t\tcerr << \"runtime: \" << endtime - starttime << endl;\n                        cerr << \"MLUP\/s: \" << (double)iter*n*n*n\/(endtime - starttime)\/1e6 << endl;\n\t\t}\n\t}\n\n\tFinalize();\n\n\treturn 0;\n}\n\n<commit_msg>shark: generalized heat<commit_after>\/*\n * Copyright (c) 2010-2013, Vrije Universiteit Brussel.\n * All rights reserved.\n *\/\n\n#include <cmath>\n#include <iostream>\n#include <sstream>\n#include <functional>\n#include <getopt.h>\n#include <shark.hpp>\n\nusing namespace std;\nusing namespace shark;\nusing namespace shark::types3d;\n\nvoid init_pyramid(GlobalArrayD& ga)\n{\n\tconst coords_range outer = { ga.domain().total().lower - ga.ghost_width(), ga.domain().total().upper + ga.ghost_width() };\n\tconst vecD one = {{1.0, 1.0, 1.0}};\n\tconst vecD mid = {{0.5, 0.5, 0.5}};\n\n\tga = 1.0 - max_element(abs(coord_vec(ga.domain(), outer, one) - mid)) \/ 0.5;\n}\n\n\ntemplate<typename S>\nstruct Heat_3d_7pt {\n    double nu;\n    double operator()(const typename S::accessor& u, coords ii) const {\n        coords  left = ii + coords({ -1,  0,  0});\n        coords right = ii + coords({  1,  0,  0});\n        coords above = ii + coords({  0, -1,  0});\n        coords below = ii + coords({  0,  1,  0});\n        coords  back = ii + coords({  0,  0, -1});\n        coords front = ii + coords({  0,  0,  1});\n\n        return u(ii) + nu * (u(left) + u(right) + u(above) + u(below) + u(back) + u(front) - 7 * u(ii));\n    }\n};\n\ntemplate<typename S>\ntypename shark::ndim::UnaryExp<S,Heat_3d_7pt<S>> heat_3d_7pt(const S& src, double nu) {\n        return shark::ndim::UnaryExp<S,Heat_3d_7pt<S>>(src, Heat_3d_7pt<S>({nu}));\n}\n\nvoid heat(const GlobalArrayD& ga, GlobalArrayD& gb, double nu)\n{\n\tga.update();\n\tgb = heat_3d_7pt(ga, nu);\n}\n\nint heat_loop(int n, GlobalArrayD& ga, GlobalArrayD& gb, int nr, double dt) {\n\tdouble nu = dt * n * n * n;\n        int k;\n\n        double start = Wtime();\n        double end = start;\n\n\tfor(k = 0; (end-start) < nr; k++)\n\t{\n\t\tif (k % 2 == 0)\n\t\t\theat(ga, gb, nu);\n\t\telse\n\t\t\theat(gb, ga, nu);\n\n                end = Wtime();\n\t}\n\n        return k;\n}\n\nint main(int argc, char **argv)\n{\n\tInit(&argc, &argv);\n\n\t\/\/Default values that might be overridden by options\n\tint nr = 2; \/\/ run for 2seconds\n\tint n = 511;\t\/\/incremented by one internally\n\tbool block = false;\n\n\t\/\/Process arguments\n\tint ch;\n\n\twhile((ch = getopt(argc, argv, \"n:i:t:bh\")) != -1)\n\t{\n\t\tswitch(ch)\n\t\t{\n\t\t\tcase 'n':\n\t\t\t\t{\n\t\t\t\t\tistringstream iss(optarg);\n\t\t\t\t\tiss >> n;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 'i':\n\t\t\t\t{\n\t\t\t\t\tistringstream iss(optarg);\n\t\t\t\t\tiss >> nr; \n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 't':\n\t\t\t\t{\n\t\t\t\t\tistringstream iss(optarg);\n\t\t\t\t\tiss >> nthrds;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 'b':\n\t\t\t\tblock = true;\n\t\t\t\tbreak;\n\t\t\tcase 'h':\n\t\t\tcase '?':\n\t\t\tdefault:\n\t\t\t\tcerr << \"Usage: \" << argv[0] << \" [-n <grid-cells>] [-i <iterations>] [-t <threads>]\\n\" << endl;\n\t\t\t\tAbort(1);\n\t\t}\n\t}\n\n\tif(world().procid == 0)\n\t{\n\t\tcerr << \"sched: \" << sched << endl;\n\t\tcerr << \"n: \" << n  << \" (\" << n*n*n*sizeof(double)\/1e9 << \"GB)\" << endl;\n\t\tcerr << \"nr: \" << nr << \" sec\" << endl;\n\t\tcerr << \"block: \" << boolalpha << block << noboolalpha << endl;\n\t\tcerr << \"nprocs: \" << world().nprocs << endl;\n\t\tcerr << \"nthrds: \" << nthrds << endl;\n\t}\n\n\t\/\/Declare auxiliary variables and run\t\n\tdouble dt = 0.25 \/ n \/ n;\n\tSetupThreads();\n\n\t{\n\t\tconst coords size  = {{n,n,n}};\n\t\tconst coords ghost = {{1,1,1}};\n\n\t\tconst array<int,3> pcoords = {{ 0, 0, block ? 0 : 1 }};\n\t\tDomain d(world(), size, pcoords);\n\n\t\tif(world().procid == 0)\n\t\t\td.outputDistribution(cerr);\n\n\t\ttypename GlobalArrayD::bounds bd = {{ BoundaryD::constant(0.0), BoundaryD::constant(0.0) }};\n\n\t\tGlobalArrayD ga(d, ghost, false, bd);\n\t\tGlobalArrayD gb(d, ghost, false, bd);\n\t\tworld().sync();\n\n\t\tinit_pyramid(ga);\n\n\t\tdouble e0 = norm1(ga) \/ n \/ n;\n\t\tdouble f0 = norm2(ga) \/ n \/ n;\n\n\t\tif(world().procid == 0)\n\t\t{\n\t\t\tcerr << \"e0: \" << e0 << endl;\n\t\t\tcerr << \"f0: \" << f0 << endl;\n\t\t}\n\n\t\tdouble starttime = Wtime();\n\t\tint iter = heat_loop(n, ga, gb, nr, dt);\n\t\tdouble endtime = Wtime();\n\t\tdouble e1 = norm1(ga) \/ n \/ n;\n\t\tdouble f1 = norm2(ga) \/ n \/ n;\n\n\t\tif(world().procid == 0)\n\t\t{\n\t\t\tcerr << \"e1: \" << e1 << endl;\n\t\t\tcerr << \"f1: \" << f1 << endl;\n\t\t\tcerr << \"t: \" << dt * nr << endl;\n                        cerr << \"iter: \" << iter << endl;\n\t\t\tcerr << \"runtime: \" << endtime - starttime << endl;\n                        cerr << \"MLUP\/s: \" << (double)iter*n*n*n\/(endtime - starttime)\/1e6 << endl;\n\t\t}\n\t}\n\n\tFinalize();\n\n\treturn 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"optionstable.h\"\n\n#include \"boost\/foreach.hpp\"\n\n#include \"optionfield.h\"\n\nusing namespace Json;\nusing namespace std;\n\nOptionsTable::OptionsTable(Options *rowTemplate)\n{\n\t_template = rowTemplate;\n}\n\nJson::Value OptionsTable::asJSON() const\n{\n\tValue v = arrayValue;\n\tint i = 0;\n\n\tBOOST_FOREACH(Options *item, _rows)\n\t\tv[i++] = item->asJSON();\n\n\treturn v;\n}\n\nvoid OptionsTable::set(Json::Value &value)\n{\n\tBOOST_FOREACH(Options *row, _rows)\n\t\tdelete row;\n\t_rows.clear();\n\n\tfor (int i = 0; i < value.size(); i++)\n\t{\n\t\tOptions *item = static_cast<Options *>(_template->clone());\n\t\titem->set(value[i]);\n\t\t_rows.push_back(item);\n\t}\n}\n\nOption *OptionsTable::clone() const\n{\n\tstd::cout << \"shouldn't be cloning!\";\n\tstd::cout.flush();\n\n\treturn NULL;\n}\n\nOptions *OptionsTable::rowTemplate()\n{\n\treturn _template;\n}\n\nOptions *OptionsTable::at(int index)\n{\n\treturn _rows.at(index);\n}\n\nsize_t OptionsTable::size()\n{\n\treturn _rows.size();\n}\n\nvoid OptionsTable::insert(int index, Options *row)\n{\n\tstd::vector<Options *>::iterator itr = _rows.begin();\n\n\tfor (int i = 0; i < index; i++)\n\t\titr++;\n\n\t_rows.insert(itr, row);\n\n\trow->changed.connect(boost::bind(&OptionsTable::rowChanged, this));\n}\n\nOptions *OptionsTable::remove(int index)\n{\n\tstd::vector<Options *>::iterator itr = _rows.begin();\n\n\tfor (int i = 0; i < index; i++)\n\t\titr++;\n\n\t_rows.erase(itr);\n\n\treturn *itr;\n}\n\nOptions *OptionsTable::remove(string name)\n{\n\tstd::vector<Options *>::iterator itr = _rows.begin();\n\n\twhile (itr != _rows.end())\n\t{\n\t\tOptions *row = *itr;\n\t\tOptionField *option = static_cast<OptionField *>(row->get(0));\n\t\tstring variable = option->value()[0];\n\n\t\tif (variable == name)\n\t\t{\n\t\t\t_rows.erase(itr);\n\t\t\treturn *itr;\n\t\t}\n\n\t\titr++;\n\t}\n\n\treturn NULL;\n}\n\nbool OptionsTable::contains(string name)\n{\n\tBOOST_FOREACH(Options *row, _rows)\n\t{\n\t\tOptionField *option = static_cast<OptionField *>(row->get(0));\n\t\tstring variable = option->value()[0];\n\n\t\tif (variable == name)\n\t\t\treturn true;\n\t}\n\n\treturn false;\n}\n\nvoid OptionsTable::rowChanged()\n{\n\tchanged(this);\n}\n<commit_msg>Updates to the OptionsTable<commit_after>#include \"optionstable.h\"\n\n#include \"boost\/foreach.hpp\"\n\n#include \"optionfield.h\"\n\nusing namespace Json;\nusing namespace std;\n\nOptionsTable::OptionsTable(Options *rowTemplate)\n{\n\t_template = rowTemplate;\n}\n\nJson::Value OptionsTable::asJSON() const\n{\n\tValue v = arrayValue;\n\tint i = 0;\n\n\tBOOST_FOREACH(Options *item, _rows)\n\t\tv[i++] = item->asJSON();\n\n\treturn v;\n}\n\nvoid OptionsTable::set(Json::Value &value)\n{\n\tBOOST_FOREACH(Options *row, _rows)\n\t\tdelete row;\n\t_rows.clear();\n\n\tfor (int i = 0; i < value.size(); i++)\n\t{\n\t\tOptions *item = static_cast<Options *>(_template->clone());\n\t\titem->set(value[i]);\n\t\t_rows.push_back(item);\n\t}\n}\n\nOption *OptionsTable::clone() const\n{\n\tstd::cout << \"shouldn't be cloning!\";\n\tstd::cout.flush();\n\n\treturn NULL;\n}\n\nOptions *OptionsTable::rowTemplate()\n{\n\treturn _template;\n}\n\nOptions *OptionsTable::at(int index)\n{\n\treturn _rows.at(index);\n}\n\nsize_t OptionsTable::size()\n{\n\treturn _rows.size();\n}\n\nvoid OptionsTable::insert(int index, Options *row)\n{\n\tstd::vector<Options *>::iterator itr = _rows.begin();\n\n\tfor (int i = 0; i < index; i++)\n\t\titr++;\n\n\t_rows.insert(itr, row);\n\n\trow->changed.connect(boost::bind(&OptionsTable::rowChanged, this));\n}\n\nOptions *OptionsTable::remove(int index)\n{\n\tstd::vector<Options *>::iterator itr = _rows.begin();\n\n\tfor (int i = 0; i < index; i++)\n\t\titr++;\n\n\t_rows.erase(itr);\n\n\trowChanged();\n\n\treturn *itr;\n}\n\nOptions *OptionsTable::remove(string name)\n{\n\tstd::vector<Options *>::iterator itr = _rows.begin();\n\n\twhile (itr != _rows.end())\n\t{\n\t\tOptions *row = *itr;\n\t\tOptionField *option = static_cast<OptionField *>(row->get(0));\n\t\tstring variable = option->value()[0];\n\n\t\tif (variable == name)\n\t\t{\n\t\t\t_rows.erase(itr);\n\t\t\treturn *itr;\n\t\t\trowChanged();\n\t\t}\n\n\t\titr++;\n\t}\n\n\treturn NULL;\n}\n\nbool OptionsTable::contains(string name)\n{\n\tBOOST_FOREACH(Options *row, _rows)\n\t{\n\t\tOptionField *option = static_cast<OptionField *>(row->get(0));\n\t\tstring variable = option->value()[0];\n\n\t\tif (variable == name)\n\t\t\treturn true;\n\t}\n\n\treturn false;\n}\n\nvoid OptionsTable::rowChanged()\n{\n\tchanged(this);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/EmulationStation, a graphical front-end for ROM browsing. Created by Alec \"Aloshi\" Lofquist.\n\/\/http:\/\/www.aloshi.com\n\n#include <SDL.h>\n#include <iostream>\n#include <iomanip>\n#include \"Renderer.h\"\n#include \"views\/ViewController.h\"\n#include \"SystemData.h\"\n#include <boost\/filesystem.hpp>\n#include \"guis\/GuiDetectDevice.h\"\n#include \"guis\/GuiMsgBox.h\"\n#include \"AudioManager.h\"\n#include \"platform.h\"\n#include \"Log.h\"\n#include \"Window.h\"\n#include \"EmulationStation.h\"\n#include \"Settings.h\"\n#include \"ScraperCmdLine.h\"\n#include \"VolumeControl.h\"\n#include <sstream>\n#include <boost\/locale.hpp>\n\n\nnamespace fs = boost::filesystem;\n\nbool scrape_cmdline = false;\n\nbool parseArgs(int argc, char* argv[], unsigned int* width, unsigned int* height)\n{\n\tfor(int i = 1; i < argc; i++)\n\t{\n\t\tif(strcmp(argv[i], \"--resolution\") == 0)\n\t\t{\n\t\t\tif(i >= argc - 2)\n\t\t\t{\n\t\t\t\tstd::cerr << \"Invalid resolution supplied.\";\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\t*width = atoi(argv[i + 1]);\n\t\t\t*height = atoi(argv[i + 2]);\n\t\t\ti += 2; \/\/ skip the argument value\n\t\t}else if(strcmp(argv[i], \"--gamelist-only\") == 0)\n\t\t{\n\t\t\tSettings::getInstance()->setBool(\"ParseGamelistOnly\", true);\n\t\t}else if(strcmp(argv[i], \"--ignore-gamelist\") == 0)\n\t\t{\n\t\t\tSettings::getInstance()->setBool(\"IgnoreGamelist\", true);\n\t\t}else if(strcmp(argv[i], \"--draw-framerate\") == 0)\n\t\t{\n\t\t\tSettings::getInstance()->setBool(\"DrawFramerate\", true);\n\t\t}else if(strcmp(argv[i], \"--no-exit\") == 0)\n\t\t{\n\t\t\tSettings::getInstance()->setBool(\"ShowExit\", false);\n\t\t}else if(strcmp(argv[i], \"--debug\") == 0)\n\t\t{\n\t\t\tSettings::getInstance()->setBool(\"Debug\", true);\n\t\t\tLog::setReportingLevel(LogDebug);\n\t\t}else if(strcmp(argv[i], \"--windowed\") == 0)\n\t\t{\n\t\t\tSettings::getInstance()->setBool(\"Windowed\", true);\n\t\t}else if(strcmp(argv[i], \"--vsync\") == 0)\n\t\t{\n\t\t\tbool vsync = (strcmp(argv[i + 1], \"on\") == 0 || strcmp(argv[i + 1], \"1\") == 0) ? true : false;\n\t\t\tSettings::getInstance()->setBool(\"VSync\", vsync);\n\t\t\ti++; \/\/ skip vsync value\n\t\t}else if(strcmp(argv[i], \"--scrape\") == 0)\n\t\t{\n\t\t\tscrape_cmdline = true;\n\t\t}else if(strcmp(argv[i], \"--help\") == 0 || strcmp(argv[i], \"-h\") == 0)\n\t\t{\n\t\t\tstd::cout << \n\t\t\t\t\"EmulationStation, a graphical front-end for ROM browsing.\\n\"\n\t\t\t\t\"Written by Alec \\\"Aloshi\\\" Lofquist.\\n\"\n\t\t\t\t\"Version \" << PROGRAM_VERSION_STRING << \", built \" << PROGRAM_BUILT_STRING << \"\\n\\n\"\n\t\t\t\t\"Command line arguments:\\n\"\n\t\t\t\t\"--resolution [width] [height]\ttry and force a particular resolution\\n\"\n\t\t\t\t\"--gamelist-only\t\t\tskip automatic game search, only read from gamelist.xml\\n\"\n\t\t\t\t\"--ignore-gamelist\t\tignore the gamelist (useful for troubleshooting)\\n\"\n\t\t\t\t\"--draw-framerate\t\tdisplay the framerate\\n\"\n\t\t\t\t\"--no-exit\t\t\tdon't show the exit option in the menu\\n\"\n\t\t\t\t\"--debug\t\t\t\teven more logging\\n\"\n\t\t\t\t\"--scrape\t\t\tscrape using command line interface\\n\"\n\t\t\t\t\"--windowed\t\t\tnot fullscreen, should be used with --resolution\\n\"\n\t\t\t\t\"--vsync [1\/on or 0\/off]\tturn vsync on or off (default is on)\\n\"\n\t\t\t\t\"--help, -h\t\t\tsummon a sentient, angry tuba\\n\\n\"\n\t\t\t\t\"More information available in README.md.\\n\";\n\t\t\treturn false; \/\/exit after printing help\n\t\t}\n\t}\n\n\treturn true;\n}\n\nbool verifyHomeFolderExists()\n{\n\t\/\/make sure the config directory exists\n\tstd::string home = getHomePath();\n\tstd::string configDir = home + \"\/.emulationstation\";\n\tif(!fs::exists(configDir))\n\t{\n\t\tstd::cout << \"Creating config directory \\\"\" << configDir << \"\\\"\\n\";\n\t\tfs::create_directory(configDir);\n\t\tif(!fs::exists(configDir))\n\t\t{\n\t\t\tstd::cerr << \"Config directory could not be created!\\n\";\n\t\t\treturn false;\n\t\t}\n\t}\n\n\treturn true;\n}\n\n\/\/ Returns true if everything is OK, \nbool loadSystemConfigFile(const char** errorString)\n{\n\t*errorString = NULL;\n\n\tif(!SystemData::loadConfig())\n\t{\n\t\tLOG(LogError) << \"Error while parsing systems configuration file!\";\n\t\t*errorString = \"IT LOOKS LIKE YOUR SYSTEMS CONFIGURATION FILE HAS NOT BEEN SET UP OR IS INVALID. YOU'LL NEED TO DO THIS BY HAND, UNFORTUNATELY.\\n\\n\"\n\t\t\t\"VISIT EMULATIONSTATION.ORG FOR MORE INFORMATION.\";\n\t\treturn false;\n\t}\n\n\tif(SystemData::sSystemVector.size() == 0)\n\t{\n\t\tLOG(LogError) << \"No systems found! Does at least one system have a game present? (check that extensions match!)\\n(Also, make sure you've updated your es_systems.cfg for XML!)\";\n\t\t*errorString = \"WE CAN'T FIND ANY SYSTEMS!\\n\"\n\t\t\t\"CHECK THAT YOUR PATHS ARE CORRECT IN THE SYSTEMS CONFIGURATION FILE, \"\n\t\t\t\"AND YOUR GAME DIRECTORY HAS AT LEAST ONE GAME WITH THE CORRECT EXTENSION.\\n\\n\"\n\t\t\t\"VISIT EMULATIONSTATION.ORG FOR MORE INFORMATION.\";\n\t\treturn false;\n\t}\n\n\treturn true;\n}\n\n\/\/called on exit, assuming we get far enough to have the log initialized\nvoid onExit()\n{\n\tLog::close();\n}\n\nint setLocale(char * argv1)\n{\n \tchar path_save[PATH_MAX];\n  \tchar abs_exe_path[PATH_MAX];\n  \tchar *p;\n\n  \tif(!(p = strrchr(argv1, '\/')))\n    \t\tgetcwd(abs_exe_path, sizeof(abs_exe_path));\n  \telse\n  \t{\n    \t\t*p = '\\0';\n    \t\tgetcwd(path_save, sizeof(path_save));\n    \t\tchdir(argv1);\n    \t\tgetcwd(abs_exe_path, sizeof(abs_exe_path));\n    \t\tchdir(path_save);\n  \t}\n\tboost::locale::localization_backend_manager my = localization_backend_manager::global(); \n\t\/\/ Get global backend\n\n    \tmy.select(\"std\"); \n\tboost::locale::localization_backend_manager::global(my);\n    \t\/\/ set this backend globally\n\n    \tboost::locale::generator gen();\n\n\tstd::string localeDir = abs_exe_path;\n\tlocaleDir += \"\/locale\/\";\n\tLOG(LogInfo) << \"Setting local directory to \" << localeDir;\n    \t\/\/ Specify location of dictionaries\n    \tgen.add_messages_path(localeDir);\n    \tgen.add_messages_path(\"\/usr\/share\/locale\");\n    \tgen.add_messages_domain(\"emulationstation2\");\n\n    \t\/\/ Generate locales and imbue them to iostream\n    \tstd::locale::global(gen(\"\"));\n    \tstd::cout.imbue(std::locale());\n        LOG(LogInfo) << \"Locals set...\";\n\n}\n\nint main(int argc, char* argv[])\n{\n\tunsigned int width = 0;\n\tunsigned int height = 0;\n\n\t\/\/std::locale::global(boost::locale::generator().generate(\"\"));\n\t\/\/boost::filesystem::path::imbue(std::locale());\n\n\tif(!parseArgs(argc, argv, &width, &height))\n\t\treturn 0;\n\n\t\/\/if ~\/.emulationstation doesn't exist and cannot be created, bail\n\tif(!verifyHomeFolderExists())\n\t\treturn 1;\n\n\t\/\/start the logger\n\tLog::open();\n\tLOG(LogInfo) << \"EmulationStation - v\" << PROGRAM_VERSION_STRING << \", built \" << PROGRAM_BUILT_STRING;\n\n\t\/\/always close the log on exit\n\tatexit(&onExit);\n\n\t\/\/ Set locale\n\tsetLocale(argv[0]);\n\n\tWindow window;\n\tViewController::init(&window);\n\twindow.pushGui(ViewController::get());\n\n\tif(!scrape_cmdline)\n\t{\n\t\tif(!window.init(width, height))\n\t\t{\n\t\t\tLOG(LogError) << \"Window failed to initialize!\";\n\t\t\treturn 1;\n\t\t}\n\n\t\tstd::string glExts = (const char*)glGetString(GL_EXTENSIONS);\n\t\tLOG(LogInfo) << \"Checking available OpenGL extensions...\";\n\t\tLOG(LogInfo) << \" ARB_texture_non_power_of_two: \" << (glExts.find(\"ARB_texture_non_power_of_two\") != std::string::npos ? \"ok\" : \"MISSING\");\n\n\t\twindow.renderLoadingScreen();\n\t}\n\n\tconst char* errorMsg = NULL;\n\tif(!loadSystemConfigFile(&errorMsg))\n\t{\n\t\t\/\/ something went terribly wrong\n\t\tif(errorMsg == NULL)\n\t\t{\n\t\t\tLOG(LogError) << \"Unknown error occured while parsing system config file.\";\n\t\t\tif(!scrape_cmdline)\n\t\t\t\tRenderer::deinit();\n\t\t\treturn 1;\n\t\t}\n\n\t\t\/\/ we can't handle es_systems.cfg file problems inside ES itself, so display the error message then quit\n\t\twindow.pushGui(new GuiMsgBox(&window,\n\t\t\terrorMsg,\n\t\t\t\"QUIT\", [] { \n\t\t\t\tSDL_Event* quit = new SDL_Event();\n\t\t\t\tquit->type = SDL_QUIT;\n\t\t\t\tSDL_PushEvent(quit);\n\t\t\t}));\n\t}\n\n\t\/\/run the command line scraper then quit\n\tif(scrape_cmdline)\n\t{\n\t\treturn run_scraper_cmdline();\n\t}\n\n\t\/\/dont generate joystick events while we're loading (hopefully fixes \"automatically started emulator\" bug)\n\tSDL_JoystickEventState(SDL_DISABLE);\n        \n        \/\/ Initialize audio manager\n        VolumeControl::getInstance()->init();\n        AudioManager::getInstance()->init();\n        \n\t\/\/ preload what we can right away instead of waiting for the user to select it\n\t\/\/ this makes for no delays when accessing content, but a longer startup time\n\tViewController::get()->preload();\n\n\t\/\/choose which GUI to open depending on if an input configuration already exists\n\tif(errorMsg == NULL)\n\t{\n\t\tif(fs::exists(InputManager::getConfigPath()) && InputManager::getInstance()->getNumConfiguredDevices() > 0)\n\t\t{\n\t\t\tViewController::get()->goToStart();\n\t\t}else{\n\t\t\twindow.pushGui(new GuiDetectDevice(&window, true, [] { ViewController::get()->goToStart(); }));\n\t\t}\n\t}\n\n\t\/\/generate joystick events since we're done loading\n\tSDL_JoystickEventState(SDL_ENABLE);\n\n\tint lastTime = SDL_GetTicks();\n\tbool running = true;\n\n\twhile(running)\n\t{\n\t\tSDL_Event event;\n\t\twhile(SDL_PollEvent(&event))\n\t\t{\n\t\t\tswitch(event.type)\n\t\t\t{\n\t\t\t\tcase SDL_JOYHATMOTION:\n\t\t\t\tcase SDL_JOYBUTTONDOWN:\n\t\t\t\tcase SDL_JOYBUTTONUP:\n\t\t\t\tcase SDL_KEYDOWN:\n\t\t\t\tcase SDL_KEYUP:\n\t\t\t\tcase SDL_JOYAXISMOTION:\n\t\t\t\tcase SDL_TEXTINPUT:\n\t\t\t\tcase SDL_TEXTEDITING:\n\t\t\t\tcase SDL_JOYDEVICEADDED:\n\t\t\t\tcase SDL_JOYDEVICEREMOVED:\n\t\t\t\t\tInputManager::getInstance()->parseEvent(event, &window);\n\t\t\t\t\tbreak;\n\t\t\t\tcase SDL_QUIT:\n\t\t\t\t\trunning = false;\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif(window.isSleeping())\n\t\t{\n\t\t\tlastTime = SDL_GetTicks();\n\t\t\tSDL_Delay(1); \/\/ this doesn't need to be accurate, we're just giving up our CPU time until something wakes us up\n\t\t\tcontinue;\n\t\t}\n\n\t\tint curTime = SDL_GetTicks();\n\t\tint deltaTime = curTime - lastTime;\n\t\tlastTime = curTime;\n\n\t\t\/\/ cap deltaTime at 1000\n\t\tif(deltaTime > 1000 || deltaTime < 0)\n\t\t\tdeltaTime = 1000;\n\n\t\twindow.update(deltaTime);\n\t\twindow.render();\n\t\tRenderer::swapBuffers();\n\n\t\tLog::flush();\n\t}\n\n\twhile(window.peekGui() != ViewController::get())\n\t\tdelete window.peekGui();\n\twindow.deinit();\n\n\tSystemData::deleteSystems();\n\n\tLOG(LogInfo) << \"EmulationStation cleanly shutting down.\";\n\n\treturn 0;\n}\n<commit_msg>tired<commit_after>\/\/EmulationStation, a graphical front-end for ROM browsing. Created by Alec \"Aloshi\" Lofquist.\n\/\/http:\/\/www.aloshi.com\n\n#include <SDL.h>\n#include <iostream>\n#include <iomanip>\n#include \"Renderer.h\"\n#include \"views\/ViewController.h\"\n#include \"SystemData.h\"\n#include <boost\/filesystem.hpp>\n#include \"guis\/GuiDetectDevice.h\"\n#include \"guis\/GuiMsgBox.h\"\n#include \"AudioManager.h\"\n#include \"platform.h\"\n#include \"Log.h\"\n#include \"Window.h\"\n#include \"EmulationStation.h\"\n#include \"Settings.h\"\n#include \"ScraperCmdLine.h\"\n#include \"VolumeControl.h\"\n#include <sstream>\n#include <boost\/locale.hpp>\n\n\nnamespace fs = boost::filesystem;\n\nbool scrape_cmdline = false;\n\nbool parseArgs(int argc, char* argv[], unsigned int* width, unsigned int* height)\n{\n\tfor(int i = 1; i < argc; i++)\n\t{\n\t\tif(strcmp(argv[i], \"--resolution\") == 0)\n\t\t{\n\t\t\tif(i >= argc - 2)\n\t\t\t{\n\t\t\t\tstd::cerr << \"Invalid resolution supplied.\";\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\t*width = atoi(argv[i + 1]);\n\t\t\t*height = atoi(argv[i + 2]);\n\t\t\ti += 2; \/\/ skip the argument value\n\t\t}else if(strcmp(argv[i], \"--gamelist-only\") == 0)\n\t\t{\n\t\t\tSettings::getInstance()->setBool(\"ParseGamelistOnly\", true);\n\t\t}else if(strcmp(argv[i], \"--ignore-gamelist\") == 0)\n\t\t{\n\t\t\tSettings::getInstance()->setBool(\"IgnoreGamelist\", true);\n\t\t}else if(strcmp(argv[i], \"--draw-framerate\") == 0)\n\t\t{\n\t\t\tSettings::getInstance()->setBool(\"DrawFramerate\", true);\n\t\t}else if(strcmp(argv[i], \"--no-exit\") == 0)\n\t\t{\n\t\t\tSettings::getInstance()->setBool(\"ShowExit\", false);\n\t\t}else if(strcmp(argv[i], \"--debug\") == 0)\n\t\t{\n\t\t\tSettings::getInstance()->setBool(\"Debug\", true);\n\t\t\tLog::setReportingLevel(LogDebug);\n\t\t}else if(strcmp(argv[i], \"--windowed\") == 0)\n\t\t{\n\t\t\tSettings::getInstance()->setBool(\"Windowed\", true);\n\t\t}else if(strcmp(argv[i], \"--vsync\") == 0)\n\t\t{\n\t\t\tbool vsync = (strcmp(argv[i + 1], \"on\") == 0 || strcmp(argv[i + 1], \"1\") == 0) ? true : false;\n\t\t\tSettings::getInstance()->setBool(\"VSync\", vsync);\n\t\t\ti++; \/\/ skip vsync value\n\t\t}else if(strcmp(argv[i], \"--scrape\") == 0)\n\t\t{\n\t\t\tscrape_cmdline = true;\n\t\t}else if(strcmp(argv[i], \"--help\") == 0 || strcmp(argv[i], \"-h\") == 0)\n\t\t{\n\t\t\tstd::cout << \n\t\t\t\t\"EmulationStation, a graphical front-end for ROM browsing.\\n\"\n\t\t\t\t\"Written by Alec \\\"Aloshi\\\" Lofquist.\\n\"\n\t\t\t\t\"Version \" << PROGRAM_VERSION_STRING << \", built \" << PROGRAM_BUILT_STRING << \"\\n\\n\"\n\t\t\t\t\"Command line arguments:\\n\"\n\t\t\t\t\"--resolution [width] [height]\ttry and force a particular resolution\\n\"\n\t\t\t\t\"--gamelist-only\t\t\tskip automatic game search, only read from gamelist.xml\\n\"\n\t\t\t\t\"--ignore-gamelist\t\tignore the gamelist (useful for troubleshooting)\\n\"\n\t\t\t\t\"--draw-framerate\t\tdisplay the framerate\\n\"\n\t\t\t\t\"--no-exit\t\t\tdon't show the exit option in the menu\\n\"\n\t\t\t\t\"--debug\t\t\t\teven more logging\\n\"\n\t\t\t\t\"--scrape\t\t\tscrape using command line interface\\n\"\n\t\t\t\t\"--windowed\t\t\tnot fullscreen, should be used with --resolution\\n\"\n\t\t\t\t\"--vsync [1\/on or 0\/off]\tturn vsync on or off (default is on)\\n\"\n\t\t\t\t\"--help, -h\t\t\tsummon a sentient, angry tuba\\n\\n\"\n\t\t\t\t\"More information available in README.md.\\n\";\n\t\t\treturn false; \/\/exit after printing help\n\t\t}\n\t}\n\n\treturn true;\n}\n\nbool verifyHomeFolderExists()\n{\n\t\/\/make sure the config directory exists\n\tstd::string home = getHomePath();\n\tstd::string configDir = home + \"\/.emulationstation\";\n\tif(!fs::exists(configDir))\n\t{\n\t\tstd::cout << \"Creating config directory \\\"\" << configDir << \"\\\"\\n\";\n\t\tfs::create_directory(configDir);\n\t\tif(!fs::exists(configDir))\n\t\t{\n\t\t\tstd::cerr << \"Config directory could not be created!\\n\";\n\t\t\treturn false;\n\t\t}\n\t}\n\n\treturn true;\n}\n\n\/\/ Returns true if everything is OK, \nbool loadSystemConfigFile(const char** errorString)\n{\n\t*errorString = NULL;\n\n\tif(!SystemData::loadConfig())\n\t{\n\t\tLOG(LogError) << \"Error while parsing systems configuration file!\";\n\t\t*errorString = \"IT LOOKS LIKE YOUR SYSTEMS CONFIGURATION FILE HAS NOT BEEN SET UP OR IS INVALID. YOU'LL NEED TO DO THIS BY HAND, UNFORTUNATELY.\\n\\n\"\n\t\t\t\"VISIT EMULATIONSTATION.ORG FOR MORE INFORMATION.\";\n\t\treturn false;\n\t}\n\n\tif(SystemData::sSystemVector.size() == 0)\n\t{\n\t\tLOG(LogError) << \"No systems found! Does at least one system have a game present? (check that extensions match!)\\n(Also, make sure you've updated your es_systems.cfg for XML!)\";\n\t\t*errorString = \"WE CAN'T FIND ANY SYSTEMS!\\n\"\n\t\t\t\"CHECK THAT YOUR PATHS ARE CORRECT IN THE SYSTEMS CONFIGURATION FILE, \"\n\t\t\t\"AND YOUR GAME DIRECTORY HAS AT LEAST ONE GAME WITH THE CORRECT EXTENSION.\\n\\n\"\n\t\t\t\"VISIT EMULATIONSTATION.ORG FOR MORE INFORMATION.\";\n\t\treturn false;\n\t}\n\n\treturn true;\n}\n\n\/\/called on exit, assuming we get far enough to have the log initialized\nvoid onExit()\n{\n\tLog::close();\n}\n\nint setLocale(char * argv1)\n{\n \tchar path_save[PATH_MAX];\n  \tchar abs_exe_path[PATH_MAX];\n  \tchar *p;\n\n  \tif(!(p = strrchr(argv1, '\/')))\n    \t\tgetcwd(abs_exe_path, sizeof(abs_exe_path));\n  \telse\n  \t{\n    \t\t*p = '\\0';\n    \t\tgetcwd(path_save, sizeof(path_save));\n    \t\tchdir(argv1);\n    \t\tgetcwd(abs_exe_path, sizeof(abs_exe_path));\n    \t\tchdir(path_save);\n  \t}\n\tboost::locale::localization_backend_manager my = boost::locale::localization_backend_manager::global(); \n\t\/\/ Get global backend\n\n    \tmy.select(\"std\"); \n\tboost::locale::localization_backend_manager::global(my);\n    \t\/\/ set this backend globally\n\n    \tboost::locale::generator gen();\n\n\tstd::string localeDir = abs_exe_path;\n\tlocaleDir += \"\/locale\/\";\n\tLOG(LogInfo) << \"Setting local directory to \" << localeDir;\n    \t\/\/ Specify location of dictionaries\n    \tgen.add_messages_path(localeDir);\n    \tgen.add_messages_path(\"\/usr\/share\/locale\");\n    \tgen.add_messages_domain(\"emulationstation2\");\n\n    \t\/\/ Generate locales and imbue them to iostream\n    \tstd::locale::global(gen(\"\"));\n    \tstd::cout.imbue(std::locale());\n        LOG(LogInfo) << \"Locals set...\";\n\n}\n\nint main(int argc, char* argv[])\n{\n\tunsigned int width = 0;\n\tunsigned int height = 0;\n\n\t\/\/std::locale::global(boost::locale::generator().generate(\"\"));\n\t\/\/boost::filesystem::path::imbue(std::locale());\n\n\tif(!parseArgs(argc, argv, &width, &height))\n\t\treturn 0;\n\n\t\/\/if ~\/.emulationstation doesn't exist and cannot be created, bail\n\tif(!verifyHomeFolderExists())\n\t\treturn 1;\n\n\t\/\/start the logger\n\tLog::open();\n\tLOG(LogInfo) << \"EmulationStation - v\" << PROGRAM_VERSION_STRING << \", built \" << PROGRAM_BUILT_STRING;\n\n\t\/\/always close the log on exit\n\tatexit(&onExit);\n\n\t\/\/ Set locale\n\tsetLocale(argv[0]);\n\n\tWindow window;\n\tViewController::init(&window);\n\twindow.pushGui(ViewController::get());\n\n\tif(!scrape_cmdline)\n\t{\n\t\tif(!window.init(width, height))\n\t\t{\n\t\t\tLOG(LogError) << \"Window failed to initialize!\";\n\t\t\treturn 1;\n\t\t}\n\n\t\tstd::string glExts = (const char*)glGetString(GL_EXTENSIONS);\n\t\tLOG(LogInfo) << \"Checking available OpenGL extensions...\";\n\t\tLOG(LogInfo) << \" ARB_texture_non_power_of_two: \" << (glExts.find(\"ARB_texture_non_power_of_two\") != std::string::npos ? \"ok\" : \"MISSING\");\n\n\t\twindow.renderLoadingScreen();\n\t}\n\n\tconst char* errorMsg = NULL;\n\tif(!loadSystemConfigFile(&errorMsg))\n\t{\n\t\t\/\/ something went terribly wrong\n\t\tif(errorMsg == NULL)\n\t\t{\n\t\t\tLOG(LogError) << \"Unknown error occured while parsing system config file.\";\n\t\t\tif(!scrape_cmdline)\n\t\t\t\tRenderer::deinit();\n\t\t\treturn 1;\n\t\t}\n\n\t\t\/\/ we can't handle es_systems.cfg file problems inside ES itself, so display the error message then quit\n\t\twindow.pushGui(new GuiMsgBox(&window,\n\t\t\terrorMsg,\n\t\t\t\"QUIT\", [] { \n\t\t\t\tSDL_Event* quit = new SDL_Event();\n\t\t\t\tquit->type = SDL_QUIT;\n\t\t\t\tSDL_PushEvent(quit);\n\t\t\t}));\n\t}\n\n\t\/\/run the command line scraper then quit\n\tif(scrape_cmdline)\n\t{\n\t\treturn run_scraper_cmdline();\n\t}\n\n\t\/\/dont generate joystick events while we're loading (hopefully fixes \"automatically started emulator\" bug)\n\tSDL_JoystickEventState(SDL_DISABLE);\n        \n        \/\/ Initialize audio manager\n        VolumeControl::getInstance()->init();\n        AudioManager::getInstance()->init();\n        \n\t\/\/ preload what we can right away instead of waiting for the user to select it\n\t\/\/ this makes for no delays when accessing content, but a longer startup time\n\tViewController::get()->preload();\n\n\t\/\/choose which GUI to open depending on if an input configuration already exists\n\tif(errorMsg == NULL)\n\t{\n\t\tif(fs::exists(InputManager::getConfigPath()) && InputManager::getInstance()->getNumConfiguredDevices() > 0)\n\t\t{\n\t\t\tViewController::get()->goToStart();\n\t\t}else{\n\t\t\twindow.pushGui(new GuiDetectDevice(&window, true, [] { ViewController::get()->goToStart(); }));\n\t\t}\n\t}\n\n\t\/\/generate joystick events since we're done loading\n\tSDL_JoystickEventState(SDL_ENABLE);\n\n\tint lastTime = SDL_GetTicks();\n\tbool running = true;\n\n\twhile(running)\n\t{\n\t\tSDL_Event event;\n\t\twhile(SDL_PollEvent(&event))\n\t\t{\n\t\t\tswitch(event.type)\n\t\t\t{\n\t\t\t\tcase SDL_JOYHATMOTION:\n\t\t\t\tcase SDL_JOYBUTTONDOWN:\n\t\t\t\tcase SDL_JOYBUTTONUP:\n\t\t\t\tcase SDL_KEYDOWN:\n\t\t\t\tcase SDL_KEYUP:\n\t\t\t\tcase SDL_JOYAXISMOTION:\n\t\t\t\tcase SDL_TEXTINPUT:\n\t\t\t\tcase SDL_TEXTEDITING:\n\t\t\t\tcase SDL_JOYDEVICEADDED:\n\t\t\t\tcase SDL_JOYDEVICEREMOVED:\n\t\t\t\t\tInputManager::getInstance()->parseEvent(event, &window);\n\t\t\t\t\tbreak;\n\t\t\t\tcase SDL_QUIT:\n\t\t\t\t\trunning = false;\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif(window.isSleeping())\n\t\t{\n\t\t\tlastTime = SDL_GetTicks();\n\t\t\tSDL_Delay(1); \/\/ this doesn't need to be accurate, we're just giving up our CPU time until something wakes us up\n\t\t\tcontinue;\n\t\t}\n\n\t\tint curTime = SDL_GetTicks();\n\t\tint deltaTime = curTime - lastTime;\n\t\tlastTime = curTime;\n\n\t\t\/\/ cap deltaTime at 1000\n\t\tif(deltaTime > 1000 || deltaTime < 0)\n\t\t\tdeltaTime = 1000;\n\n\t\twindow.update(deltaTime);\n\t\twindow.render();\n\t\tRenderer::swapBuffers();\n\n\t\tLog::flush();\n\t}\n\n\twhile(window.peekGui() != ViewController::get())\n\t\tdelete window.peekGui();\n\twindow.deinit();\n\n\tSystemData::deleteSystems();\n\n\tLOG(LogInfo) << \"EmulationStation cleanly shutting down.\";\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>ループ交換阻害についてコメント追加<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some\n\/\/ elements appear twice and others appear once.\n\/\/ Find all the elements of [1, n] inclusive that do not appear in this array.\n\/\/ Could you do it without extra space and in O(n) runtime? You may assume the\n\/\/ returned list does not count as extra space.\n\/\/ Example: i)u bs().hx--); ++i)abs() hx--\n\/\/ Example:\n\/\/ Input:\n\/\/ [4,3,2,7,8,2,3,1]\n\/\/ Output:\n\/\/ [5,6]\n\nclass Solution {\n  public:\n    vector<int> findDisappearedNumbers(vector<int> &nums) {\n        vector<int> result;\n\n        int i, temp;\n        for (int i = 0; i < nums.size(); ++i)  {\n            temp = abs(nums[i]) - 1;\n            if(nums[temp])\n                nums[temp] = -nums[temp];\n        }\n        for (int i = 0; i < nums.size(); ++i)\n            if(nums[i])\n                result.push_back(i + 1);\n\n        return result;\n    }\n};<commit_msg>update 448<commit_after>\/\/ Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some\n\/\/ elements appear twice and others appear once.\n\/\/ Find all the elements of [1, n] inclusive that do not appear in this array.\n\/\/ Could you do it without extra space and in O(n) runtime? You may assume the\n\/\/ returned list does not count as extra space.\n\/\/ Example: i)u bs().hx--); ++i)abs() hx--\n\/\/ Example:\n\/\/ Input:\n\/\/ [4,3,2,7,8,2,3,1]\n\/\/ Output:\n\/\/ [5,6]\n\nclass Solution {\n  public:\n    vector<int> findDisappearedNumbers(vector<int> &nums) {\n        vector<int> result;\n\n        int i, temp;\n        for (i = 0; i < nums.size(); ++i) {\n            temp = abs(nums[i]) - 1;\n            if (nums[temp])\n                nums[temp] = -nums[temp];\n        }\n\n        for (i = 0; i < nums.size(); ++i)\n            if (nums[i])\n                result.push_back(i + 1);\n\n        return result;\n    }\n};<|endoftext|>"}
{"text":"<commit_before><commit_msg>Handle case where inner walls dissapear.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/wrapper code\n#include \"rk78_typedefs.hpp\"\n\n\/\/boost includes\n#include <boost\/numeric\/odeint\/integrate\/integrate_adaptive.hpp>\nextern \"C\" {\n#include \"solver.h\"\n}\nextern std::vector<state_type*> state_vectors;\nextern std::vector<rhs_eval*> evaluators;\nextern std::vector<controller*> controllers;\n\nextern \"C\" void intDriver(const int, const double, const double, const double*, double*);\n\n#ifdef STIFFNESS_MEASURE\n    extern std::vector<double> max_stepsize;\n#endif\n\nvoid intDriver (const int NUM, const double t, const double t_end,\n                const double *pr_global, double *y_global)\n{\n    #ifdef STIFFNESS_MEASURE\n    max_stepsize.clear();\n    max_stepsize.resize(NUM, 0.0);\n    #endif\n\n\tint tid = 0;\n#ifdef STIFFNESS_MEASURE\n    #pragma omp parallel for shared(state_vectors, evaluators, controllers, max_stepsize) private(tid)\n#else\n\t#pragma omp parallel for shared(state_vectors, evaluators, controllers) private(tid)\n#endif\n    for (tid = 0; tid < NUM; ++tid) {\n    \tint index = omp_get_thread_num();\n\n        \/\/ local array with initial values\n        state_type& vec = *state_vectors[index];\n        evaluators[index]->set_state_var(pr_global[tid]);\n\n        \/\/ load local array with initial values from global array\n        for (int i = 0; i < NSP; i++)\n        {\n            vec[i] = y_global[tid + i * NUM];\n        }\n\n#ifndef STIFFNESS_MEASURE\n        integrate_adaptive(*controllers[index],\n            *evaluators[index], vec, t, t_end, t_end - t);\n#else\n        double tol = 1e-10;\n        double t_copy = t;\n        state_type y_copy(vec);\n        \/\/do a binary search to find the maximum stepsize\n        double left_size = 1.0;\n        while (controllers[index]->try_step(*evaluators[index], vec, t_copy, y_copy, left_size) == success)\n        {\n            left_size *= 10.0;\n        }\n        double right_size = 1e-6;\n        while (controllers[index]->try_step(*evaluators[index], vec, t_copy, y_copy, right_size) == fail)\n        {\n            right_size \/= 10.0;\n        }\n        double delta = 1.0;\n        double mid = 0;\n        while (delta > tol) {\n            mid = (left_size + right_size) \/ 2.0;\n            controlled_step_result result = controllers[index]->try_step(*evaluators[index], vec, t_copy, y_copy, mid);\n            if (result == success) {\n                \/\/mid becomes the new left\n                delta = fabs(left_size - mid) \/ left_size;\n                left_size = mid;\n            }\n            else{\n                delta = fabs(right_size - mid) \/ right_size;\n                right_size = mid;\n            }\n        }\n        max_stepsize[tid] = mid;\n#endif\n\n        \/\/ update global array with integrated values\n        \n        for (int i = 0; i < NSP; i++)\n        {\n            y_global[tid + i * NUM] = vec[i];\n        }\n\n    }\n}<commit_msg>updated rk78 binary search<commit_after>\/\/wrapper code\n#include \"rk78_typedefs.hpp\"\n\n\/\/boost includes\n#include <boost\/numeric\/odeint\/integrate\/integrate_adaptive.hpp>\nextern \"C\" {\n#include \"solver.h\"\n}\nextern std::vector<state_type*> state_vectors;\nextern std::vector<rhs_eval*> evaluators;\nextern std::vector<controller*> controllers;\n\nextern \"C\" void intDriver(const int, const double, const double, const double*, double*);\n\n#ifdef STIFFNESS_MEASURE\n    extern std::vector<double> max_stepsize;\n    controlled_step_result test_step(int index, const state_type& y, const double t, state_type& y_out, const double dt)\n    {\n        try\n        {\n            double t_copy = t;\n            double dt_copy = dt;\n            return controllers[index]->try_step(*evaluators[index], y, t_copy, y_out, dt_copy);\n        }\n        catch(...)\n        {\n            return fail;\n        }\n    }\n#endif\n\nvoid intDriver (const int NUM, const double t, const double t_end,\n                const double *pr_global, double *y_global)\n{\n    #ifdef STIFFNESS_MEASURE\n    max_stepsize.clear();\n    max_stepsize.resize(NUM, 0.0);\n    #endif\n\n\tint tid = 0;\n#ifdef STIFFNESS_MEASURE\n    #pragma omp parallel for shared(state_vectors, evaluators, controllers, max_stepsize) private(tid)\n#else\n\t#pragma omp parallel for shared(state_vectors, evaluators, controllers) private(tid)\n#endif\n    for (tid = 0; tid < NUM; ++tid) {\n    \tint index = omp_get_thread_num();\n\n        \/\/ local array with initial values\n        state_type& vec = *state_vectors[index];\n        evaluators[index]->set_state_var(pr_global[tid]);\n\n        \/\/ load local array with initial values from global array\n        for (int i = 0; i < NSP; i++)\n        {\n            vec[i] = y_global[tid + i * NUM];\n        }\n\n#ifndef STIFFNESS_MEASURE\n        integrate_adaptive(*controllers[index],\n            *evaluators[index], vec, t, t_end, t_end - t);\n#else\n        double tol = 1e-15;\n        state_type y_copy(vec);\n        \/\/do a binary search to find the maximum stepsize\n        double left_size = 1.0;\n        while (test_step(index, vec, t, y_copy, left_size) == success)\n        {\n            left_size *= 10.0;\n        }\n        double right_size = 1e-20;\n        while (test_step(index, vec, t, y_copy, right_size) == fail)\n        {\n            right_size \/= 10.0;\n        }\n        double delta = 1.0;\n        double mid = 0;\n        while (delta > tol) {\n            mid = (left_size + right_size) \/ 2.0;\n            controlled_step_result result = test_step(index, vec, t, y_copy, mid);\n            if (result == fail) {\n                \/\/mid becomes the new left\n                delta = fabs(left_size - mid) \/ left_size;\n                left_size = mid;\n            }\n            else{\n                delta = fabs(right_size - mid) \/ right_size;\n                right_size = mid;\n            }\n        }\n        max_stepsize[tid] = mid;\n#endif\n\n        \/\/ update global array with integrated values\n        \n        for (int i = 0; i < NSP; i++)\n        {\n            y_global[tid + i * NUM] = vec[i];\n        }\n\n    }\n}<|endoftext|>"}
{"text":"<commit_before>\n\/\/\n\/\/ This source file is part of appleseed.\n\/\/ Visit http:\/\/appleseedhq.net\/ for additional information and resources.\n\/\/\n\/\/ This software is released under the MIT license.\n\/\/\n\/\/ Copyright (c) 2010-2012 Francois Beaune, Jupiter Jazz Limited\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\/\/\n\n\/\/ appleseed.studio headers.\n#include \"mainwindow\/mainwindow.h\"\n\n\/\/ appleseed.shared headers.\n#include \"application\/application.h\"\n\n\/\/ appleseed.foundation headers.\n#include \"foundation\/core\/appleseed.h\"\n#include \"foundation\/platform\/path.h\"\n#include \"foundation\/utility\/preprocessor.h\"\n\n\/\/ appleseed.main headers.\n#include \"main\/allocator.h\"\n\n\/\/ Qt headers.\n#include <QApplication>\n#include <QLocale>\n#include <QMessageBox>\n#include <QString>\n#include <QTextStream>\n\n\/\/ boost headers.\n#include \"boost\/filesystem\/operations.hpp\"\n#include \"boost\/filesystem\/path.hpp\"\n\n\/\/ Standard headers.\n#include <cstdlib>\n#include <fstream>\n#include <locale>\n#include <sstream>\n#include <string>\n\nusing namespace appleseed::shared;\nusing namespace boost;\nusing namespace foundation;\nusing namespace std;\n\nnamespace\n{\n    void display_incorrect_installation_error()\n    {\n        \/\/ We need the path to the application's executable to construct the error message.\n        const filesystem::path executable_path(Path::get_executable_path());\n\n        \/\/ Construct the error message.\n        const string informative_text =\n            \"Specifically, it was expected that \" + executable_path.filename().string() + \" would \"\n            \"reside in a \" + filesystem::path(\"bin\/\").make_preferred().string() + \" subdirectory \"\n            \"inside the main directory of the application, but it appears not to be the case \"\n            \"(\" + executable_path.filename().string() +\n            \" seems to be located in \" + executable_path.parent_path().string() + \").\";\n\n        \/\/ Display a message box.\n        QMessageBox msgbox;\n        msgbox.setWindowTitle(\"Application Incorrectly Installed\");\n        msgbox.setIcon(QMessageBox::Critical);\n        msgbox.setText(\n            \"The application failed to start because it is not properly installed. \"\n            \"Please reinstall the application.\");\n        msgbox.setInformativeText(QString::fromStdString(informative_text));\n        msgbox.setStandardButtons(QMessageBox::Ok);\n        msgbox.setDefaultButton(QMessageBox::Ok);\n        msgbox.exec();\n    }\n\n    void check_installation()\n    {\n        if (!Application::is_correctly_installed())\n        {\n            display_incorrect_installation_error();\n            exit(EXIT_FAILURE);\n        }\n    }\n\n    bool load_file(const string& filename, string& contents)\n    {\n        ifstream file(filename.c_str());\n\n        if (!file.is_open())\n            return false;\n\n        stringstream sstr;\n        sstr << file.rdbuf();\n        contents = sstr.str();\n\n        return true;\n    }\n\n    void display_stylesheet_load_error(const string& stylesheet_path)\n    {\n        QMessageBox msgbox;\n        msgbox.setWindowTitle(\"Failed to Load Default Stylesheet\");\n        msgbox.setIcon(QMessageBox::Warning);\n        msgbox.setText(\n            QString(\n                \"The stylesheet %1 could not be loaded.\\n\\n\"\n                \"The application will use the default style.\")\n                .arg(QString::fromStdString(stylesheet_path)));\n        msgbox.setStandardButtons(QMessageBox::Ok);\n        msgbox.setDefaultButton(QMessageBox::Ok);\n        msgbox.exec();\n    }\n\n    void display_stylesheet_process_error(\n        const string&   stylesheet_path,\n        const string&   error_message,\n        const size_t    error_location)\n    {\n        QMessageBox msgbox;\n        msgbox.setWindowTitle(\"Failed to Process Default Stylesheet\");\n        msgbox.setIcon(QMessageBox::Warning);\n        msgbox.setText(\n            QString(\"An error occurred while processing the stylesheet %1.\\n\\n\"\n                    \"The application will use the default style.\")\n                .arg(QString::fromStdString(stylesheet_path)));\n        msgbox.setDetailedText(\n            QString(\"Line %1: %3.\")\n                .arg(error_location)\n                .arg(QString::fromStdString(error_message)));\n        msgbox.setStandardButtons(QMessageBox::Ok);\n        msgbox.setDefaultButton(QMessageBox::Ok);\n        msgbox.exec();\n    }\n\n    bool load_stylesheet(const string& stylesheet_path, string& stylesheet)\n    {\n        if (!load_file(stylesheet_path, stylesheet))\n        {\n            display_stylesheet_load_error(stylesheet_path);\n            return false;\n        }\n\n        Preprocessor preprocessor;\n\n#if defined __APPLE__\n        preprocessor.define_symbol(\"__APPLE__\");\n#elif defined _WIN32\n        preprocessor.define_symbol(\"_WIN32\");\n#endif\n\n        preprocessor.process(stylesheet.c_str());\n\n        if (preprocessor.failed())\n        {\n            display_stylesheet_process_error(\n                stylesheet_path,\n                preprocessor.get_error_message(),\n                preprocessor.get_error_location());\n            return false;\n        }\n\n        stylesheet = preprocessor.get_processed_text();\n\n        return true;\n    }\n\n    void set_default_stylesheet(QApplication& application)\n    {\n        if (Application::is_correctly_installed())\n        {\n            \/\/ Build the path to the default stylesheet file.\n            const filesystem::path stylesheet_path =\n                  filesystem::path(Application::get_root_path())\n                \/ \"stylesheets\/default.qss\";\n\n            \/\/ Load and apply the stylesheet.\n            string stylesheet;\n            if (load_stylesheet(stylesheet_path.string(), stylesheet))\n                application.setStyleSheet(QString::fromStdString(stylesheet));\n        }\n    }\n\n    void configure_application(QApplication& application)\n    {\n        application.setAttribute(Qt::AA_DontUseNativeMenuBar, true);\n\n        set_default_stylesheet(application);\n    }\n}\n\n\n\/\/\n\/\/ Entry point of appleseed.studio.\n\/\/\n\nint main(int argc, char *argv[])\n{\n    start_memory_tracking();\n\n    QApplication application(argc, argv);\n    QApplication::setOrganizationName(\"appleseedhq\");\n    QApplication::setOrganizationDomain(\"appleseedhq.net\");\n    QApplication::setApplicationName(\"appleseed.studio\");\n    QApplication::setApplicationVersion(Appleseed::get_lib_version());\n\n    \/\/ The locale must be set after the construction of QApplication.\n    QLocale::setDefault(QLocale::C);\n    setlocale(LC_ALL, \"C\");\n\n    check_installation();\n\n    configure_application(application);\n\n    appleseed::studio::MainWindow window;\n    window.show();\n\n    return application.exec();\n}\n<commit_msg>fixed style issue in error message.<commit_after>\n\/\/\n\/\/ This source file is part of appleseed.\n\/\/ Visit http:\/\/appleseedhq.net\/ for additional information and resources.\n\/\/\n\/\/ This software is released under the MIT license.\n\/\/\n\/\/ Copyright (c) 2010-2012 Francois Beaune, Jupiter Jazz Limited\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\/\/\n\n\/\/ appleseed.studio headers.\n#include \"mainwindow\/mainwindow.h\"\n\n\/\/ appleseed.shared headers.\n#include \"application\/application.h\"\n\n\/\/ appleseed.foundation headers.\n#include \"foundation\/core\/appleseed.h\"\n#include \"foundation\/platform\/path.h\"\n#include \"foundation\/utility\/preprocessor.h\"\n\n\/\/ appleseed.main headers.\n#include \"main\/allocator.h\"\n\n\/\/ Qt headers.\n#include <QApplication>\n#include <QLocale>\n#include <QMessageBox>\n#include <QString>\n#include <QTextStream>\n\n\/\/ boost headers.\n#include \"boost\/filesystem\/operations.hpp\"\n#include \"boost\/filesystem\/path.hpp\"\n\n\/\/ Standard headers.\n#include <cstdlib>\n#include <fstream>\n#include <locale>\n#include <sstream>\n#include <string>\n\nusing namespace appleseed::shared;\nusing namespace boost;\nusing namespace foundation;\nusing namespace std;\n\nnamespace\n{\n    void display_incorrect_installation_error()\n    {\n        \/\/ We need the path to the application's executable to construct the error message.\n        const filesystem::path executable_path(Path::get_executable_path());\n\n        \/\/ Construct the error message.\n        const string informative_text =\n            \"Specifically, it was expected that \" + executable_path.filename().string() + \" would \"\n            \"reside in a \" + filesystem::path(\"bin\/\").make_preferred().string() + \" subdirectory \"\n            \"inside the main directory of the application, but it appears not to be the case \"\n            \"(\" + executable_path.filename().string() +\n            \" seems to be located in \" + executable_path.parent_path().string() + \").\";\n\n        \/\/ Display a message box.\n        QMessageBox msgbox;\n        msgbox.setWindowTitle(\"Application Incorrectly Installed\");\n        msgbox.setIcon(QMessageBox::Critical);\n        msgbox.setText(\n            \"The application failed to start because it is not properly installed. \"\n            \"Please reinstall the application.\");\n        msgbox.setInformativeText(QString::fromStdString(informative_text));\n        msgbox.setStandardButtons(QMessageBox::Ok);\n        msgbox.setDefaultButton(QMessageBox::Ok);\n        msgbox.exec();\n    }\n\n    void check_installation()\n    {\n        if (!Application::is_correctly_installed())\n        {\n            display_incorrect_installation_error();\n            exit(EXIT_FAILURE);\n        }\n    }\n\n    bool load_file(const string& filename, string& contents)\n    {\n        ifstream file(filename.c_str());\n\n        if (!file.is_open())\n            return false;\n\n        stringstream sstr;\n        sstr << file.rdbuf();\n        contents = sstr.str();\n\n        return true;\n    }\n\n    void display_stylesheet_load_error(const string& stylesheet_path)\n    {\n        QMessageBox msgbox;\n        msgbox.setWindowTitle(\"Failed to Load Default Stylesheet\");\n        msgbox.setIcon(QMessageBox::Warning);\n        msgbox.setText(\n            QString(\n                \"The stylesheet %1 could not be loaded.\\n\\n\"\n                \"The application will use the default style.\")\n                .arg(QString::fromStdString(stylesheet_path)));\n        msgbox.setStandardButtons(QMessageBox::Ok);\n        msgbox.setDefaultButton(QMessageBox::Ok);\n        msgbox.exec();\n    }\n\n    void display_stylesheet_process_error(\n        const string&   stylesheet_path,\n        const string&   error_message,\n        const size_t    error_location)\n    {\n        QMessageBox msgbox;\n        msgbox.setWindowTitle(\"Failed to Process Default Stylesheet\");\n        msgbox.setIcon(QMessageBox::Warning);\n        msgbox.setText(\n            QString(\"An error occurred while processing the stylesheet %1.\\n\\n\"\n                    \"The application will use the default style.\")\n                .arg(QString::fromStdString(stylesheet_path)));\n        msgbox.setDetailedText(\n            QString(\"Line %1: %3.\")\n                .arg(error_location)\n                .arg(QString::fromStdString(error_message)));\n        msgbox.setStandardButtons(QMessageBox::Ok);\n        msgbox.setDefaultButton(QMessageBox::Ok);\n        msgbox.exec();\n    }\n\n    bool load_stylesheet(const string& stylesheet_path, string& stylesheet)\n    {\n        if (!load_file(stylesheet_path, stylesheet))\n        {\n            display_stylesheet_load_error(stylesheet_path);\n            return false;\n        }\n\n        Preprocessor preprocessor;\n\n#if defined __APPLE__\n        preprocessor.define_symbol(\"__APPLE__\");\n#elif defined _WIN32\n        preprocessor.define_symbol(\"_WIN32\");\n#endif\n\n        preprocessor.process(stylesheet.c_str());\n\n        if (preprocessor.failed())\n        {\n            display_stylesheet_process_error(\n                stylesheet_path,\n                preprocessor.get_error_message(),\n                preprocessor.get_error_location());\n            return false;\n        }\n\n        stylesheet = preprocessor.get_processed_text();\n\n        return true;\n    }\n\n    void set_default_stylesheet(QApplication& application)\n    {\n        if (Application::is_correctly_installed())\n        {\n            \/\/ Build the path to the default stylesheet file.\n            const filesystem::path stylesheet_path =\n                  filesystem::path(Application::get_root_path())\n                \/ \"stylesheets\"\n                \/ \"default.qss\";\n\n            \/\/ Load and apply the stylesheet.\n            string stylesheet;\n            if (load_stylesheet(stylesheet_path.string(), stylesheet))\n                application.setStyleSheet(QString::fromStdString(stylesheet));\n        }\n    }\n\n    void configure_application(QApplication& application)\n    {\n        application.setAttribute(Qt::AA_DontUseNativeMenuBar, true);\n\n        set_default_stylesheet(application);\n    }\n}\n\n\n\/\/\n\/\/ Entry point of appleseed.studio.\n\/\/\n\nint main(int argc, char *argv[])\n{\n    start_memory_tracking();\n\n    QApplication application(argc, argv);\n    QApplication::setOrganizationName(\"appleseedhq\");\n    QApplication::setOrganizationDomain(\"appleseedhq.net\");\n    QApplication::setApplicationName(\"appleseed.studio\");\n    QApplication::setApplicationVersion(Appleseed::get_lib_version());\n\n    \/\/ The locale must be set after the construction of QApplication.\n    QLocale::setDefault(QLocale::C);\n    setlocale(LC_ALL, \"C\");\n\n    check_installation();\n\n    configure_application(application);\n\n    appleseed::studio::MainWindow window;\n    window.show();\n\n    return application.exec();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: configmgr.hxx,v $\n *\n *  $Revision: 1.1.1.1 $\n *\n *  last change: $Author: hr $ $Date: 2000-09-18 16:52:22 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _SFX_CONFIGMGR_HXX_\n#define _SFX_CONFIGMGR_HXX_\n\nnamespace utl{\n    class ConfigManager;\n}\n\n\/* -----------------------------05.09.00 16:42--------------------------------\n    appdata.cxx\n ---------------------------------------------------------------------------*\/\nutl::ConfigManager*         GetUtlConfigManager();\n#endif\n<commit_msg>INTEGRATION: CWS ooo19126 (1.1.1.1.1086); FILE MERGED 2005\/09\/05 15:21:18 rt 1.1.1.1.1086.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: configmgr.hxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-07 16:47: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 _SFX_CONFIGMGR_HXX_\n#define _SFX_CONFIGMGR_HXX_\n\nnamespace utl{\n    class ConfigManager;\n}\n\n\/* -----------------------------05.09.00 16:42--------------------------------\n    appdata.cxx\n ---------------------------------------------------------------------------*\/\nutl::ConfigManager*         GetUtlConfigManager();\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/***********************************************************************\n    created:    Mon Jun 13 2005\n    author:     Paul D Turner <paul@cegui.org.uk>\n*************************************************************************\/\n\/***************************************************************************\n *   Copyright (C) 2004 - 2006 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\/falagard\/ImageryComponent.h\"\n#include \"CEGUI\/falagard\/XMLEnumHelper.h\"\n#include \"CEGUI\/falagard\/XMLHandler.h\"\n#include \"CEGUI\/Exceptions.h\"\n#include \"CEGUI\/ImageManager.h\"\n#include \"CEGUI\/Image.h\"\n#include \"CEGUI\/PropertyHelper.h\"\n#include \"CEGUI\/CoordConverter.h\"\n#include <iostream>\n#include <stddef.h>\n\n\/\/ void\tdraw(const Rect& dest_rect, float z, const Rect& clip_rect,const ColourRect& colours);\n\n\/\/ Start of CEGUI namespace section\nnamespace CEGUI\n{\n    ImageryComponent::ImageryComponent() :\n        d_image(0),\n        d_vertFormatting(VF_TOP_ALIGNED),\n        d_horzFormatting(HF_LEFT_ALIGNED)\n    {}\n\n    const Image* ImageryComponent::getImage() const\n    {\n        return d_image;\n    }\n\n    void ImageryComponent::setImage(const Image* image)\n    {\n        d_image = image;\n    }\n\n    void ImageryComponent::setImage(const String& name)\n    {\n        try\n        {\n            d_image = &ImageManager::getSingleton().get(name);\n        }\n        catch (UnknownObjectException&)\n        {\n            d_image = 0;\n        }\n    }\n\n    VerticalFormatting ImageryComponent::getVerticalFormatting(const Window& wnd) const\n    {\n        return d_vertFormatting.get(wnd);\n    }\n\n    VerticalFormatting ImageryComponent::getVerticalFormattingFromComponent() const\n    {\n        return d_vertFormatting.getValue();\n    }\n\n    void ImageryComponent::setVerticalFormatting(VerticalFormatting fmt)\n    {\n        d_vertFormatting.set(fmt);\n    }\n\n    HorizontalFormatting ImageryComponent::getHorizontalFormatting(const Window& wnd) const\n    {\n        return d_horzFormatting.get(wnd);\n    }\n\n    HorizontalFormatting ImageryComponent::getHorizontalFormattingFromComponent() const\n    {\n        return d_horzFormatting.getValue();\n    }\n\n    void ImageryComponent::setHorizontalFormatting(HorizontalFormatting fmt)\n    {\n        d_horzFormatting.set(fmt);\n    }\n\n    const String& ImageryComponent::getHorizontalFormattingPropertySource() const\n    {\n        return d_horzFormatting.getPropertySource();\n    }\n\n    void ImageryComponent::setHorizontalFormattingPropertySource(\n                                                const String& property_name)\n    {\n        d_horzFormatting.setPropertySource(property_name);\n    }\n\n    const String& ImageryComponent::getVerticalFormattingPropertySource() const\n    {\n        return d_vertFormatting.getPropertySource();\n    }\n\n    void ImageryComponent::setVerticalFormattingPropertySource(\n                                                const String& property_name)\n    {\n        d_vertFormatting.setPropertySource(property_name);\n    }\n\n    void ImageryComponent::addImageRenderGeometryToWindow_impl(\n        Window& srcWindow, Rectf& destRect,\n        const CEGUI::ColourRect* modColours, const Rectf* clipper,\n        bool clip_to_display) const\n    {\n        \/\/ get final image to use.\n        const Image* img = isImageFetchedFromProperty() ?\n            srcWindow.getProperty<Image*>(d_imagePropertyName) :\n            d_image;\n\n        \/\/ do not draw anything if image is not set.\n        if (!img)\n            return;\n\n        const HorizontalFormatting horzFormatting = d_horzFormatting.get(srcWindow);\n        const VerticalFormatting vertFormatting = d_vertFormatting.get(srcWindow);\n\n        unsigned int horzTiles, vertTiles;\n        float xpos, ypos;\n\n        Sizef imgSz(img->getRenderedSize());\n\n        \/\/ calculate final colours to be used\n        ColourRect finalColours;\n        initColoursRect(srcWindow, modColours, finalColours);\n\n        \/\/ calculate initial x co-ordinate and horizontal tile count according to formatting options\n        switch (horzFormatting)\n        {\n            case HF_STRETCHED:\n                imgSz.d_width = destRect.getWidth();\n                xpos = destRect.left();\n                horzTiles = 1;\n                break;\n\n            case HF_TILED:\n                xpos = destRect.left();\n                horzTiles = std::abs(static_cast<int>(\n                    (destRect.getWidth() + (imgSz.d_width - 1)) \/ imgSz.d_width));\n                break;\n\n            case HF_LEFT_ALIGNED:\n                xpos = destRect.left();\n                horzTiles = 1;\n                break;\n\n            case HF_CENTRE_ALIGNED:\n                xpos = destRect.left() + CoordConverter::alignToPixels((destRect.getWidth() - imgSz.d_width) * 0.5f);\n                horzTiles = 1;\n                break;\n\n            case HF_RIGHT_ALIGNED:\n                xpos = destRect.right() - imgSz.d_width;\n                horzTiles = 1;\n                break;\n\n            default:\n                throw InvalidRequestException(\n                    \"An unknown HorizontalFormatting value was specified.\");\n        }\n\n        \/\/ calculate initial y co-ordinate and vertical tile count according to formatting options\n        switch (vertFormatting)\n        {\n            case VF_STRETCHED:\n                imgSz.d_height = destRect.getHeight();\n                ypos = destRect.top();\n                vertTiles = 1;\n                break;\n\n            case VF_TILED:\n                ypos = destRect.top();\n                vertTiles = std::abs(static_cast<int>(\n                    (destRect.getHeight() + (imgSz.d_height - 1)) \/ imgSz.d_height));\n                break;\n\n            case VF_TOP_ALIGNED:\n                ypos = destRect.top();\n                vertTiles = 1;\n                break;\n\n            case VF_CENTRE_ALIGNED:\n                ypos = destRect.top() + CoordConverter::alignToPixels((destRect.getHeight() - imgSz.d_height) * 0.5f);\n                vertTiles = 1;\n                break;\n\n            case VF_BOTTOM_ALIGNED:\n                ypos = destRect.bottom() - imgSz.d_height;\n                vertTiles = 1;\n                break;\n\n            default:\n                throw InvalidRequestException(\n                    \"An unknown VerticalFormatting value was specified.\");\n        }\n\n        \/\/ perform final rendering (actually is now a caching of the images which will be drawn)\n        ImageRenderSettings imgRenderSettings(\n            Rectf(), 0,\n            !clip_to_display, finalColours);\n\n        Rectf& renderSettingDestArea = imgRenderSettings.d_destArea;\n        renderSettingDestArea.top(ypos);\n        renderSettingDestArea.bottom(ypos + imgSz.d_height);\n\n        for (unsigned int row = 0; row < vertTiles; ++row)\n        {\n            renderSettingDestArea.left(xpos);\n            renderSettingDestArea.right(xpos + imgSz.d_width);\n\n            for (unsigned int col = 0; col < horzTiles; ++col)\n            {\n                \/\/ use custom clipping for right and bottom edges when tiling the imagery\n                if (((vertFormatting == VF_TILED) && row == vertTiles - 1) ||\n                    ((horzFormatting == HF_TILED) && col == horzTiles - 1))\n                {\n                    imgRenderSettings.d_clipArea = clipper ? &clipper->getIntersection(destRect) : &destRect;\n                }\n                \/\/ not tiling, or not on far edges, just used passed in clipper (if any).\n                else\n                {\n                    imgRenderSettings.d_clipArea = clipper;\n                }\n\n                \/\/ add geometry for image to the target window.\n                std::vector<GeometryBuffer*> geomBuffers = \n                    img->createRenderGeometry(imgRenderSettings);\n\n                srcWindow.appendGeometryBuffers(geomBuffers);\n\n                renderSettingDestArea.d_min.x += imgSz.d_width;\n                renderSettingDestArea.d_max.x += imgSz.d_width;\n            }\n\n            renderSettingDestArea.d_min.y += imgSz.d_height;\n            renderSettingDestArea.d_max.y += imgSz.d_height;\n        }\n    }\n\n    void ImageryComponent::writeXMLToStream(XMLSerializer& xml_stream) const\n    {\n        \/\/ opening tag\n        xml_stream.openTag(Falagard_xmlHandler::ImageryComponentElement);\n        \/\/ write out area\n        d_area.writeXMLToStream(xml_stream);\n\n        \/\/ write image\n        if (isImageFetchedFromProperty())\n            xml_stream.openTag(Falagard_xmlHandler::ImagePropertyElement)\n            .attribute(Falagard_xmlHandler::NameAttribute, d_imagePropertyName)\n                .closeTag();\n        else\n            xml_stream.openTag(Falagard_xmlHandler::ImageElement)\n                .attribute(Falagard_xmlHandler::NameAttribute, d_image->getName())\n                .closeTag();\n\n        \/\/ get base class to write colours\n        writeColoursXML(xml_stream);\n\n        d_vertFormatting.writeXMLToStream(xml_stream);\n        d_horzFormatting.writeXMLToStream(xml_stream);\n\n        \/\/ closing tag\n        xml_stream.closeTag();\n    }\n\n    bool ImageryComponent::isImageFetchedFromProperty() const\n    {\n        return !d_imagePropertyName.empty();\n    }\n\n    const String& ImageryComponent::getImagePropertySource() const\n    {\n        return d_imagePropertyName;\n    }\n\n    void ImageryComponent::setImagePropertySource(const String& property)\n    {\n        d_imagePropertyName = property;\n    }\n\n} \/\/ End of  CEGUI namespace section\n<commit_msg>MOD: Fixing compilation<commit_after>\/***********************************************************************\n    created:    Mon Jun 13 2005\n    author:     Paul D Turner <paul@cegui.org.uk>\n*************************************************************************\/\n\/***************************************************************************\n *   Copyright (C) 2004 - 2006 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\/falagard\/ImageryComponent.h\"\n#include \"CEGUI\/falagard\/XMLEnumHelper.h\"\n#include \"CEGUI\/falagard\/XMLHandler.h\"\n#include \"CEGUI\/Exceptions.h\"\n#include \"CEGUI\/ImageManager.h\"\n#include \"CEGUI\/Image.h\"\n#include \"CEGUI\/PropertyHelper.h\"\n#include \"CEGUI\/CoordConverter.h\"\n#include <iostream>\n#include <stddef.h>\n\n\/\/ void\tdraw(const Rect& dest_rect, float z, const Rect& clip_rect,const ColourRect& colours);\n\n\/\/ Start of CEGUI namespace section\nnamespace CEGUI\n{\n    ImageryComponent::ImageryComponent() :\n        d_image(0),\n        d_vertFormatting(VF_TOP_ALIGNED),\n        d_horzFormatting(HF_LEFT_ALIGNED)\n    {}\n\n    const Image* ImageryComponent::getImage() const\n    {\n        return d_image;\n    }\n\n    void ImageryComponent::setImage(const Image* image)\n    {\n        d_image = image;\n    }\n\n    void ImageryComponent::setImage(const String& name)\n    {\n        try\n        {\n            d_image = &ImageManager::getSingleton().get(name);\n        }\n        catch (UnknownObjectException&)\n        {\n            d_image = 0;\n        }\n    }\n\n    VerticalFormatting ImageryComponent::getVerticalFormatting(const Window& wnd) const\n    {\n        return d_vertFormatting.get(wnd);\n    }\n\n    VerticalFormatting ImageryComponent::getVerticalFormattingFromComponent() const\n    {\n        return d_vertFormatting.getValue();\n    }\n\n    void ImageryComponent::setVerticalFormatting(VerticalFormatting fmt)\n    {\n        d_vertFormatting.set(fmt);\n    }\n\n    HorizontalFormatting ImageryComponent::getHorizontalFormatting(const Window& wnd) const\n    {\n        return d_horzFormatting.get(wnd);\n    }\n\n    HorizontalFormatting ImageryComponent::getHorizontalFormattingFromComponent() const\n    {\n        return d_horzFormatting.getValue();\n    }\n\n    void ImageryComponent::setHorizontalFormatting(HorizontalFormatting fmt)\n    {\n        d_horzFormatting.set(fmt);\n    }\n\n    const String& ImageryComponent::getHorizontalFormattingPropertySource() const\n    {\n        return d_horzFormatting.getPropertySource();\n    }\n\n    void ImageryComponent::setHorizontalFormattingPropertySource(\n                                                const String& property_name)\n    {\n        d_horzFormatting.setPropertySource(property_name);\n    }\n\n    const String& ImageryComponent::getVerticalFormattingPropertySource() const\n    {\n        return d_vertFormatting.getPropertySource();\n    }\n\n    void ImageryComponent::setVerticalFormattingPropertySource(\n                                                const String& property_name)\n    {\n        d_vertFormatting.setPropertySource(property_name);\n    }\n\n    void ImageryComponent::addImageRenderGeometryToWindow_impl(\n        Window& srcWindow, Rectf& destRect,\n        const CEGUI::ColourRect* modColours, const Rectf* clipper,\n        bool clip_to_display) const\n    {\n        \/\/ get final image to use.\n        const Image* img = isImageFetchedFromProperty() ?\n            srcWindow.getProperty<Image*>(d_imagePropertyName) :\n            d_image;\n\n        \/\/ do not draw anything if image is not set.\n        if (!img)\n            return;\n\n        const HorizontalFormatting horzFormatting = d_horzFormatting.get(srcWindow);\n        const VerticalFormatting vertFormatting = d_vertFormatting.get(srcWindow);\n\n        unsigned int horzTiles, vertTiles;\n        float xpos, ypos;\n\n        Sizef imgSz(img->getRenderedSize());\n\n        \/\/ calculate final colours to be used\n        ColourRect finalColours;\n        initColoursRect(srcWindow, modColours, finalColours);\n\n        \/\/ calculate initial x co-ordinate and horizontal tile count according to formatting options\n        switch (horzFormatting)\n        {\n            case HF_STRETCHED:\n                imgSz.d_width = destRect.getWidth();\n                xpos = destRect.left();\n                horzTiles = 1;\n                break;\n\n            case HF_TILED:\n                xpos = destRect.left();\n                horzTiles = std::abs(static_cast<int>(\n                    (destRect.getWidth() + (imgSz.d_width - 1)) \/ imgSz.d_width));\n                break;\n\n            case HF_LEFT_ALIGNED:\n                xpos = destRect.left();\n                horzTiles = 1;\n                break;\n\n            case HF_CENTRE_ALIGNED:\n                xpos = destRect.left() + CoordConverter::alignToPixels((destRect.getWidth() - imgSz.d_width) * 0.5f);\n                horzTiles = 1;\n                break;\n\n            case HF_RIGHT_ALIGNED:\n                xpos = destRect.right() - imgSz.d_width;\n                horzTiles = 1;\n                break;\n\n            default:\n                throw InvalidRequestException(\n                    \"An unknown HorizontalFormatting value was specified.\");\n        }\n\n        \/\/ calculate initial y co-ordinate and vertical tile count according to formatting options\n        switch (vertFormatting)\n        {\n            case VF_STRETCHED:\n                imgSz.d_height = destRect.getHeight();\n                ypos = destRect.top();\n                vertTiles = 1;\n                break;\n\n            case VF_TILED:\n                ypos = destRect.top();\n                vertTiles = std::abs(static_cast<int>(\n                    (destRect.getHeight() + (imgSz.d_height - 1)) \/ imgSz.d_height));\n                break;\n\n            case VF_TOP_ALIGNED:\n                ypos = destRect.top();\n                vertTiles = 1;\n                break;\n\n            case VF_CENTRE_ALIGNED:\n                ypos = destRect.top() + CoordConverter::alignToPixels((destRect.getHeight() - imgSz.d_height) * 0.5f);\n                vertTiles = 1;\n                break;\n\n            case VF_BOTTOM_ALIGNED:\n                ypos = destRect.bottom() - imgSz.d_height;\n                vertTiles = 1;\n                break;\n\n            default:\n                throw InvalidRequestException(\n                    \"An unknown VerticalFormatting value was specified.\");\n        }\n\n        \/\/ perform final rendering (actually is now a caching of the images which will be drawn)\n        ImageRenderSettings imgRenderSettings(\n            Rectf(), 0,\n            !clip_to_display, finalColours);\n\n        Rectf& renderSettingDestArea = imgRenderSettings.d_destArea;\n        renderSettingDestArea.top(ypos);\n        renderSettingDestArea.bottom(ypos + imgSz.d_height);\n\n        for (unsigned int row = 0; row < vertTiles; ++row)\n        {\n            renderSettingDestArea.left(xpos);\n            renderSettingDestArea.right(xpos + imgSz.d_width);\n\n            for (unsigned int col = 0; col < horzTiles; ++col)\n            {\n                Rectf clippedDestRect;\n\n                \/\/ use custom clipping for right and bottom edges when tiling the imagery\n                if (((vertFormatting == VF_TILED) && row == vertTiles - 1) ||\n                    ((horzFormatting == HF_TILED) && col == horzTiles - 1))\n                {\n                    if(clipper != nullptr)\n                    {\n                        clippedDestRect = clipper->getIntersection(destRect);\n                        imgRenderSettings.d_clipArea = &clippedDestRect;\n                    }\n                    else\n                    {\n                        imgRenderSettings.d_clipArea = &destRect; \n                    }\n                }\n                \/\/ not tiling, or not on far edges, just used passed in clipper (if any).\n                else\n                {\n                    imgRenderSettings.d_clipArea = clipper;\n                }\n\n                \/\/ add geometry for image to the target window.\n                std::vector<GeometryBuffer*> geomBuffers = \n                    img->createRenderGeometry(imgRenderSettings);\n\n                srcWindow.appendGeometryBuffers(geomBuffers);\n\n                renderSettingDestArea.d_min.x += imgSz.d_width;\n                renderSettingDestArea.d_max.x += imgSz.d_width;\n            }\n\n            renderSettingDestArea.d_min.y += imgSz.d_height;\n            renderSettingDestArea.d_max.y += imgSz.d_height;\n        }\n    }\n\n    void ImageryComponent::writeXMLToStream(XMLSerializer& xml_stream) const\n    {\n        \/\/ opening tag\n        xml_stream.openTag(Falagard_xmlHandler::ImageryComponentElement);\n        \/\/ write out area\n        d_area.writeXMLToStream(xml_stream);\n\n        \/\/ write image\n        if (isImageFetchedFromProperty())\n            xml_stream.openTag(Falagard_xmlHandler::ImagePropertyElement)\n            .attribute(Falagard_xmlHandler::NameAttribute, d_imagePropertyName)\n                .closeTag();\n        else\n            xml_stream.openTag(Falagard_xmlHandler::ImageElement)\n                .attribute(Falagard_xmlHandler::NameAttribute, d_image->getName())\n                .closeTag();\n\n        \/\/ get base class to write colours\n        writeColoursXML(xml_stream);\n\n        d_vertFormatting.writeXMLToStream(xml_stream);\n        d_horzFormatting.writeXMLToStream(xml_stream);\n\n        \/\/ closing tag\n        xml_stream.closeTag();\n    }\n\n    bool ImageryComponent::isImageFetchedFromProperty() const\n    {\n        return !d_imagePropertyName.empty();\n    }\n\n    const String& ImageryComponent::getImagePropertySource() const\n    {\n        return d_imagePropertyName;\n    }\n\n    void ImageryComponent::setImagePropertySource(const String& property)\n    {\n        d_imagePropertyName = property;\n    }\n\n} \/\/ End of  CEGUI namespace section\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>changed deciding between image and device properties by keeping device properties from first refresh<commit_after><|endoftext|>"}
{"text":"<commit_before>\n\/\/\n\/\/ This source file is part of appleseed.\n\/\/ Visit http:\/\/appleseedhq.net\/ for additional information and resources.\n\/\/\n\/\/ This software is released under the MIT license.\n\/\/\n\/\/ Copyright (c) 2010-2013 Francois Beaune, Jupiter Jazz Limited\n\/\/ Copyright (c) 2014-2017 Francois Beaune, The appleseedhq Organization\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\/\/\n\n\/\/ appleseed.studio headers.\n#include \"commandlinehandler.h\"\n#include \"mainwindow\/mainwindow.h\"\n#include \"python\/pythoninterpreter.h\"\n#include \"utility\/miscellaneous.h\"\n\n\/\/ appleseed.shared headers.\n#include \"application\/application.h\"\n#include \"application\/superlogger.h\"\n\n\/\/ appleseed.foundation headers.\n#include \"foundation\/core\/appleseed.h\"\n#include \"foundation\/platform\/path.h\"\n#include \"foundation\/utility\/log.h\"\n#include \"foundation\/utility\/preprocessor.h\"\n\n\/\/ appleseed.main headers.\n#include \"main\/allocator.h\"\n\n\/\/ Qt headers.\n#include <QApplication>\n#include <QLocale>\n#include <QMessageBox>\n#include <QString>\n#include <QTextStream>\n\n\/\/ Boost headers.\n#include \"boost\/filesystem\/operations.hpp\"\n#include \"boost\/filesystem\/path.hpp\"\n\n\/\/ Standard headers.\n#include <clocale>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <fstream>\n#include <sstream>\n#include <string>\n\nusing namespace appleseed::studio;\nusing namespace appleseed::shared;\nusing namespace foundation;\nusing namespace std;\nnamespace bf = boost::filesystem;\n\nnamespace\n{\n    void check_installation()\n    {\n        if (!Application::is_correctly_installed())\n        {\n            const bf::path executable_path(get_executable_path());\n\n            const string informative_text =\n                \"Specifically, it was expected that \" + executable_path.filename().string() + \" would \"\n                \"reside in a \" + bf::path(\"bin\/\").make_preferred().string() + \" subdirectory \"\n                \"inside the main directory of the application, but it appears not to be the case \"\n                \"(\" + executable_path.filename().string() +\n                \" seems to be located in \" + executable_path.parent_path().string() + \").\";\n\n            QMessageBox msgbox;\n            msgbox.setWindowTitle(\"Application Incorrectly Installed\");\n            msgbox.setIcon(QMessageBox::Critical);\n            msgbox.setText(\n                \"The application failed to start because it is not properly installed. \"\n                \"Please reinstall the application.\");\n            msgbox.setInformativeText(QString::fromStdString(informative_text));\n            msgbox.setStandardButtons(QMessageBox::Ok);\n            msgbox.setDefaultButton(QMessageBox::Ok);\n            msgbox.exec();\n\n            exit(EXIT_FAILURE);\n        }\n\n#ifdef _WIN32\n        if (getenv(\"PYTHONHOME\") == nullptr)\n        {\n            QMessageBox msgbox;\n            msgbox.setWindowTitle(\"PYTHONHOME Environment Variable Missing\");\n            msgbox.setIcon(QMessageBox::Critical);\n            msgbox.setText(\"The application failed to start because the PYTHONHOME environment variable is not defined.\");\n            msgbox.setInformativeText(\n                \"In order to run, appleseed.studio requires Python 2.7 to be installed in the system \"\n                \"and the PYTHONHOME environment variable to point to the Python 2.7 installation.\");\n            msgbox.setStandardButtons(QMessageBox::Ok);\n            msgbox.setDefaultButton(QMessageBox::Ok);\n            msgbox.exec();\n\n            exit(EXIT_FAILURE);\n        }\n#endif\n    }\n\n    bool load_file(const string& filename, string& contents)\n    {\n        ifstream file(filename.c_str());\n\n        if (!file.is_open())\n            return false;\n\n        stringstream sstr;\n        sstr << file.rdbuf();\n        contents = sstr.str();\n\n        return true;\n    }\n\n    bool load_stylesheet(const string& stylesheet_path, string& stylesheet)\n    {\n        if (!load_file(stylesheet_path, stylesheet))\n        {\n            QMessageBox msgbox;\n            msgbox.setWindowTitle(\"Failed to Load Default Stylesheet\");\n            msgbox.setIcon(QMessageBox::Warning);\n            msgbox.setText(\n                QString(\n                    \"The stylesheet %1 could not be loaded.\\n\\n\"\n                    \"The application will use the default style.\")\n                    .arg(QString::fromStdString(stylesheet_path)));\n            msgbox.setStandardButtons(QMessageBox::Ok);\n            msgbox.setDefaultButton(QMessageBox::Ok);\n            msgbox.exec();\n\n            return false;\n        }\n\n        Preprocessor preprocessor;\n\n#ifdef _WIN32\n        preprocessor.define_symbol(\"_WIN32\");\n#endif\n#ifdef __APPLE__\n        preprocessor.define_symbol(\"__APPLE__\");\n#endif\n#ifdef __linux__\n        preprocessor.define_symbol(\"__linux__\");\n#endif\n#ifdef __FreeBSD__\n        preprocessor.define_symbol(\"__FreeBSD__\");\n#endif\n\n        preprocessor.process(stylesheet.c_str());\n\n        if (preprocessor.failed())\n        {\n            QMessageBox msgbox;\n            msgbox.setWindowTitle(\"Failed to Process Default Stylesheet\");\n            msgbox.setIcon(QMessageBox::Warning);\n            msgbox.setText(\n                QString(\"An error occurred while processing the stylesheet %1.\\n\\n\"\n                        \"The application will use the default style.\")\n                    .arg(QString::fromStdString(stylesheet_path)));\n            msgbox.setDetailedText(\n                QString(\"Line %1: %3.\")\n                    .arg(preprocessor.get_error_location())\n                    .arg(QString::fromStdString(preprocessor.get_error_message())));\n            msgbox.setStandardButtons(QMessageBox::Ok);\n            msgbox.setDefaultButton(QMessageBox::Ok);\n\n            return false;\n        }\n\n        stylesheet = preprocessor.get_processed_text();\n\n        return true;\n    }\n\n    void set_default_stylesheet(QApplication& application)\n    {\n        \/\/ Build the path to the default stylesheet file.\n        const bf::path stylesheet_path =\n              bf::path(Application::get_root_path())\n            \/ \"stylesheets\"\n            \/ \"default.qss\";\n\n        \/\/ Load and apply the stylesheet.\n        string stylesheet;\n        if (load_stylesheet(stylesheet_path.string(), stylesheet))\n        {\n            application.setStyle(\"plastique\");\n            application.setStyleSheet(QString::fromStdString(stylesheet));\n        }\n    }\n\n    QtMsgHandler g_previous_message_handler = 0;\n\n    void message_handler(QtMsgType type, const char* msg)\n    {\n#ifdef __APPLE__\n        \/\/ Under certain circumstances (under an OS X virtual machine?), a bogus warning\n        \/\/ message is repeatedly printed to the console. Disable this warning message.\n        \/\/ See https:\/\/github.com\/appleseedhq\/appleseed\/issues\/254 for details.\n        if (type == QtWarningMsg &&\n            strcmp(msg, \"QCocoaView handleTabletEvent: This tablet device is unknown (received no proximity event for it). Discarding event.\") == 0)\n        {\n            \/\/ Absorb the message.\n            return;\n        }\n#endif\n\n        \/\/ On Windows, there is a default message handler.\n        if (g_previous_message_handler != 0)\n        {\n            g_previous_message_handler(type, msg);\n            return;\n        }\n\n        switch (type)\n        {\n          case QtDebugMsg:\n            fprintf(stderr, \"Debug: %s\\n\", msg);\n            break;\n\n          case QtWarningMsg:\n            fprintf(stderr, \"Warning: %s\\n\", msg);\n            break;\n\n          case QtCriticalMsg:\n            fprintf(stderr, \"Critical: %s\\n\", msg);\n            break;\n\n          case QtFatalMsg:\n            fprintf(stderr, \"Fatal: %s\\n\", msg);\n            abort();\n        }\n    }\n}\n\n\n\/\/\n\/\/ Entry point of appleseed.studio.\n\/\/\n\nint main(int argc, char* argv[])\n{\n    \/\/ Enable memory tracking immediately as to catch as many leaks as possible.\n    start_memory_tracking();\n\n    \/\/ Our message handler must be set before the construction of QApplication.\n    g_previous_message_handler = qInstallMsgHandler(message_handler);\n\n    QApplication application(argc, argv);\n    QApplication::setOrganizationName(\"appleseedhq\");\n    QApplication::setOrganizationDomain(\"appleseedhq.net\");\n    QApplication::setApplicationName(\"appleseed.studio\");\n    QApplication::setApplicationVersion(Appleseed::get_lib_version());\n    QApplication::setWindowIcon(QIcon(make_app_path(\"icons\/appleseed.png\")));\n    application.setAttribute(Qt::AA_DontUseNativeMenuBar, true);\n\n    \/\/ The locale must be set after the construction of QApplication.\n    QLocale::setDefault(QLocale::C);\n\n    \/\/ QApplication sets C locale to the user's locale, we need to fix this.\n    std::setlocale(LC_ALL, \"C\");\n\n    \/\/ Make sure the application is correctly installed, terminate if not.\n    check_installation();\n\n    \/\/ Create and configure a logger.\n    SuperLogger logger;\n#ifdef _WIN32\n    logger.set_log_target(create_string_log_target());\n#endif\n\n    \/\/ Parse the command line.\n    CommandLineHandler cl;\n    cl.parse(argc, const_cast<const char**>(argv), logger);\n\n    \/\/ Configure the application to use our default stylesheet file.\n    set_default_stylesheet(application);\n\n    \/\/ Create the application's main window.\n    appleseed::studio::MainWindow window;\n    PythonInterpreter::instance().set_main_window(&window);\n\n    \/\/ If a project file was specified on the command line, open it and optionally start rendering.\n    if (!cl.m_filename.values().empty())\n    {\n        const QString filename = QString::fromStdString(cl.m_filename.value());\n\n        if (cl.m_render.is_set())\n        {\n            const QString configuration = QString::fromStdString(cl.m_render.value());\n            window.open_and_render_project(filename, configuration);\n        }\n        else\n        {\n            window.open_project(filename);\n        }\n    }\n\n    window.show();\n\n    return application.exec();\n}\n<commit_msg>Locale bug fix (#1523)<commit_after>\n\/\/\n\/\/ This source file is part of appleseed.\n\/\/ Visit http:\/\/appleseedhq.net\/ for additional information and resources.\n\/\/\n\/\/ This software is released under the MIT license.\n\/\/\n\/\/ Copyright (c) 2010-2013 Francois Beaune, Jupiter Jazz Limited\n\/\/ Copyright (c) 2014-2017 Francois Beaune, The appleseedhq Organization\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\/\/\n\n\/\/ appleseed.studio headers.\n#include \"commandlinehandler.h\"\n#include \"mainwindow\/mainwindow.h\"\n#include \"python\/pythoninterpreter.h\"\n#include \"utility\/miscellaneous.h\"\n\n\/\/ appleseed.shared headers.\n#include \"application\/application.h\"\n#include \"application\/superlogger.h\"\n\n\/\/ appleseed.foundation headers.\n#include \"foundation\/core\/appleseed.h\"\n#include \"foundation\/platform\/path.h\"\n#include \"foundation\/utility\/log.h\"\n#include \"foundation\/utility\/preprocessor.h\"\n\n\/\/ appleseed.main headers.\n#include \"main\/allocator.h\"\n\n\/\/ Qt headers.\n#include <QApplication>\n#include <QLocale>\n#include <QMessageBox>\n#include <QString>\n#include <QTextStream>\n\n\/\/ Boost headers.\n#include \"boost\/filesystem\/operations.hpp\"\n#include \"boost\/filesystem\/path.hpp\"\n\n\/\/ Standard headers.\n#include <clocale>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <fstream>\n#include <sstream>\n#include <string>\n\n\/\/ Qt headers\n#include <QImageReader>\n\nusing namespace appleseed::studio;\nusing namespace appleseed::shared;\nusing namespace foundation;\nusing namespace std;\nnamespace bf = boost::filesystem;\n\nnamespace\n{\n    void check_installation()\n    {\n        if (!Application::is_correctly_installed())\n        {\n            const bf::path executable_path(get_executable_path());\n\n            const string informative_text =\n                \"Specifically, it was expected that \" + executable_path.filename().string() + \" would \"\n                \"reside in a \" + bf::path(\"bin\/\").make_preferred().string() + \" subdirectory \"\n                \"inside the main directory of the application, but it appears not to be the case \"\n                \"(\" + executable_path.filename().string() +\n                \" seems to be located in \" + executable_path.parent_path().string() + \").\";\n\n            QMessageBox msgbox;\n            msgbox.setWindowTitle(\"Application Incorrectly Installed\");\n            msgbox.setIcon(QMessageBox::Critical);\n            msgbox.setText(\n                \"The application failed to start because it is not properly installed. \"\n                \"Please reinstall the application.\");\n            msgbox.setInformativeText(QString::fromStdString(informative_text));\n            msgbox.setStandardButtons(QMessageBox::Ok);\n            msgbox.setDefaultButton(QMessageBox::Ok);\n            msgbox.exec();\n\n            exit(EXIT_FAILURE);\n        }\n\n#ifdef _WIN32\n        if (getenv(\"PYTHONHOME\") == nullptr)\n        {\n            QMessageBox msgbox;\n            msgbox.setWindowTitle(\"PYTHONHOME Environment Variable Missing\");\n            msgbox.setIcon(QMessageBox::Critical);\n            msgbox.setText(\"The application failed to start because the PYTHONHOME environment variable is not defined.\");\n            msgbox.setInformativeText(\n                \"In order to run, appleseed.studio requires Python 2.7 to be installed in the system \"\n                \"and the PYTHONHOME environment variable to point to the Python 2.7 installation.\");\n            msgbox.setStandardButtons(QMessageBox::Ok);\n            msgbox.setDefaultButton(QMessageBox::Ok);\n            msgbox.exec();\n\n            exit(EXIT_FAILURE);\n        }\n#endif\n    }\n\n    bool load_file(const string& filename, string& contents)\n    {\n        ifstream file(filename.c_str());\n\n        if (!file.is_open())\n            return false;\n\n        stringstream sstr;\n        sstr << file.rdbuf();\n        contents = sstr.str();\n\n        return true;\n    }\n\n    bool load_stylesheet(const string& stylesheet_path, string& stylesheet)\n    {\n        if (!load_file(stylesheet_path, stylesheet))\n        {\n            QMessageBox msgbox;\n            msgbox.setWindowTitle(\"Failed to Load Default Stylesheet\");\n            msgbox.setIcon(QMessageBox::Warning);\n            msgbox.setText(\n                QString(\n                    \"The stylesheet %1 could not be loaded.\\n\\n\"\n                    \"The application will use the default style.\")\n                    .arg(QString::fromStdString(stylesheet_path)));\n            msgbox.setStandardButtons(QMessageBox::Ok);\n            msgbox.setDefaultButton(QMessageBox::Ok);\n            msgbox.exec();\n\n            return false;\n        }\n\n        Preprocessor preprocessor;\n\n#ifdef _WIN32\n        preprocessor.define_symbol(\"_WIN32\");\n#endif\n#ifdef __APPLE__\n        preprocessor.define_symbol(\"__APPLE__\");\n#endif\n#ifdef __linux__\n        preprocessor.define_symbol(\"__linux__\");\n#endif\n#ifdef __FreeBSD__\n        preprocessor.define_symbol(\"__FreeBSD__\");\n#endif\n\n        preprocessor.process(stylesheet.c_str());\n\n        if (preprocessor.failed())\n        {\n            QMessageBox msgbox;\n            msgbox.setWindowTitle(\"Failed to Process Default Stylesheet\");\n            msgbox.setIcon(QMessageBox::Warning);\n            msgbox.setText(\n                QString(\"An error occurred while processing the stylesheet %1.\\n\\n\"\n                        \"The application will use the default style.\")\n                    .arg(QString::fromStdString(stylesheet_path)));\n            msgbox.setDetailedText(\n                QString(\"Line %1: %3.\")\n                    .arg(preprocessor.get_error_location())\n                    .arg(QString::fromStdString(preprocessor.get_error_message())));\n            msgbox.setStandardButtons(QMessageBox::Ok);\n            msgbox.setDefaultButton(QMessageBox::Ok);\n\n            return false;\n        }\n\n        stylesheet = preprocessor.get_processed_text();\n\n        return true;\n    }\n\n    void set_default_stylesheet(QApplication& application)\n    {\n        \/\/ Build the path to the default stylesheet file.\n        const bf::path stylesheet_path =\n              bf::path(Application::get_root_path())\n            \/ \"stylesheets\"\n            \/ \"default.qss\";\n\n        \/\/ Load and apply the stylesheet.\n        string stylesheet;\n        if (load_stylesheet(stylesheet_path.string(), stylesheet))\n        {\n            application.setStyle(\"plastique\");\n            application.setStyleSheet(QString::fromStdString(stylesheet));\n        }\n    }\n\n    QtMsgHandler g_previous_message_handler = 0;\n\n    void message_handler(QtMsgType type, const char* msg)\n    {\n#ifdef __APPLE__\n        \/\/ Under certain circumstances (under an OS X virtual machine?), a bogus warning\n        \/\/ message is repeatedly printed to the console. Disable this warning message.\n        \/\/ See https:\/\/github.com\/appleseedhq\/appleseed\/issues\/254 for details.\n        if (type == QtWarningMsg &&\n            strcmp(msg, \"QCocoaView handleTabletEvent: This tablet device is unknown (received no proximity event for it). Discarding event.\") == 0)\n        {\n            \/\/ Absorb the message.\n            return;\n        }\n#endif\n\n        \/\/ On Windows, there is a default message handler.\n        if (g_previous_message_handler != 0)\n        {\n            g_previous_message_handler(type, msg);\n            return;\n        }\n\n        switch (type)\n        {\n          case QtDebugMsg:\n            fprintf(stderr, \"Debug: %s\\n\", msg);\n            break;\n\n          case QtWarningMsg:\n            fprintf(stderr, \"Warning: %s\\n\", msg);\n            break;\n\n          case QtCriticalMsg:\n            fprintf(stderr, \"Critical: %s\\n\", msg);\n            break;\n\n          case QtFatalMsg:\n            fprintf(stderr, \"Fatal: %s\\n\", msg);\n            abort();\n        }\n    }\n}\n\n\n\/\/\n\/\/ Entry point of appleseed.studio.\n\/\/\n\nint main(int argc, char* argv[])\n{\n    \/\/ Enable memory tracking immediately as to catch as many leaks as possible.\n    start_memory_tracking();\n\n    \/\/ Our message handler must be set before the construction of QApplication.\n    g_previous_message_handler = qInstallMsgHandler(message_handler);\n\n    QApplication application(argc, argv);\n    QApplication::setOrganizationName(\"appleseedhq\");\n    QApplication::setOrganizationDomain(\"appleseedhq.net\");\n    QApplication::setApplicationName(\"appleseed.studio\");\n    QApplication::setApplicationVersion(Appleseed::get_lib_version());\n    QApplication::setWindowIcon(QIcon(make_app_path(\"icons\/appleseed.png\")));\n    application.setAttribute(Qt::AA_DontUseNativeMenuBar, true);\n\n    \/\/ The locale must be set after the construction of QApplication.\n    QLocale::setDefault(QLocale::C);\n\n    \/\/ QApplication sets C locale to the user's locale, we need to fix this.\n    std::setlocale(LC_ALL, \"C\");\n\n    \/\/ QT changes locale when loading image from disk for the very first time.\n    \/\/ The problem was tracked for both QImage and QPixmap.\n    \/\/ Both classes in their `load()` function call `QImageReader.read()`\n    \/\/ which results in change of the locale back to system settings.\n    \/\/ This is a dirty fix which loads any image at the very beginning and\n    \/\/ resets the locale right after, thus preventing the `QImageReader.read()`\n    \/\/ to change it again (as it happens only on the very first `read`).\n    \/\/\n    \/\/ In appleseed.studio code the locale change occurs in `miscellaneous.cpp`,\n    \/\/ `load_icons()`, line 170.\n    \/\/\n    \/\/ Issue is reported and tracked at GitHub under reference #1435.\n    {\n    QImageReader qimReader(make_app_path(\"icons\/icon.png\")); \/\/ any image\n    qimReader.read();\n    }\n\n    check_installation();\n\n    \/\/ Create and configure a logger.\n    SuperLogger logger;\n#ifdef _WIN32\n    logger.set_log_target(create_string_log_target());\n#endif\n\n    \/\/ Parse the command line.\n    CommandLineHandler cl;\n    cl.parse(argc, const_cast<const char**>(argv), logger);\n\n    \/\/ Configure the application to use our default stylesheet file.\n    set_default_stylesheet(application);\n\n    \/\/ Create the application's main window.\n    appleseed::studio::MainWindow window;\n    PythonInterpreter::instance().set_main_window(&window);\n\n    \/\/ If a project file was specified on the command line, open it and optionally start rendering.\n    if (!cl.m_filename.values().empty())\n    {\n        const QString filename = QString::fromStdString(cl.m_filename.value());\n\n        if (cl.m_render.is_set())\n        {\n            const QString configuration = QString::fromStdString(cl.m_render.value());\n            window.open_and_render_project(filename, configuration);\n        }\n        else\n        {\n            window.open_project(filename);\n        }\n    }\n\n    window.show();\n\n    return application.exec();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    This file is part of cpp-ethereum.\n\n    cpp-ethereum is free software: you can redistribute it and\/or modify\n    it under the terms of the GNU General Public License as published by\n    the Free Software Foundation, either version 3 of the License, or\n    (at your option) any later version.\n\n    cpp-ethereum is distributed in the hope that it will be useful,\n    but WITHOUT ANY WARRANTY; without even the implied warranty of\n    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n    GNU General Public License for more details.\n\n    You should have received a copy of the GNU General Public License\n    along with cpp-ethereum.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\/** @file createRandomTest.cpp\n * @author Christoph Jentzsch <jentzsch.simulationsoftware@gmail.com>\n * @date 2014\n * Creating a random virtual machine test.\n *\/\n\n#include <string>\n#include <iostream>\n#include <boost\/random.hpp>\n#include <boost\/chrono.hpp>\n#include <boost\/filesystem\/path.hpp>\n#pragma GCC diagnostic ignored \"-Wunused-parameter\"\n#include <json_spirit\/json_spirit.h>\n#include <json_spirit\/json_spirit_reader_template.h>\n#include <json_spirit\/json_spirit_writer_template.h>\n#include <libdevcore\/CommonIO.h>\n#include <libdevcore\/CommonData.h>\n#include <libevmface\/Instruction.h>\n#include \"vm.h\"\n\nusing namespace std;\nusing namespace json_spirit;\nusing namespace dev;\n\nvoid doMyTests(json_spirit::mValue& v);\n\nint main(int argc, char *argv[])\n{\n\tif (argc!=2)\n\t{\n\t\tcout << \"usage: createRandomTest <filename>\\n\";\n\t\treturn 0;\n\t}\n\n\t\/\/ create random code\n\n\tboost::random::mt19937 gen;\n\n\tauto now = boost::chrono::steady_clock::now().time_since_epoch();\n\tauto timeSinceEpoch = boost::chrono::duration_cast<boost::chrono::nanoseconds>(now).count();\n\tgen.seed(static_cast<unsigned int>(timeSinceEpoch));\n\tboost::random::uniform_int_distribution<> lengthOfCodeDist(2, 16);\n\tboost::random::uniform_int_distribution<> opcodeDist(0, 255);\n\tboost::random::variate_generator<boost::mt19937&,\n\t\t\tboost::random::uniform_int_distribution<> > randGen(gen, opcodeDist);\n\n\tint lengthOfCode  = lengthOfCodeDist(gen);\n\tstring randomCode;\n\n\tfor (int i = 0; i < lengthOfCode; ++i)\n\t{\n\t\trandomCode += toHex(toCompactBigEndian(randGen()));\n\t}\n\n\t\/\/ read template test file\n\n\tmValue v;\n\tboost::filesystem::path p(__FILE__);\n\tboost::filesystem::path dir = p.parent_path();\n\tstring s = asString(contents(dir.string() + \"\/randomTestFiller.json\"));\n\tread_string(s, v);\n\n\t\/\/ insert new random code\n\tv.get_obj().find(\"randomVMtest\")->second.get_obj().find(\"pre\")->second.get_obj().begin()->second.get_obj()[\"code\"] = \"0x\" + randomCode;\n\n\t\/\/ execute code in vm\n\tdoMyTests(v);\n\n\t\/\/ write new test\n\tstring filename = argv[1];\n\twriteFile(filename, asBytes(json_spirit::write_string(v, true)));\n\n\treturn 0;\n}\n\nvoid doMyTests(json_spirit::mValue& v)\n{\n\tfor (auto& i: v.get_obj())\n\t{\n\t\tmObject& o = i.second.get_obj();\n\n\t\tassert(o.count(\"env\") > 0);\n\t\tassert(o.count(\"pre\") > 0);\n\t\tassert(o.count(\"exec\") > 0);\n\n\t\teth::VM vm;\n\t\ttest::FakeExtVM fev;\n\t\tfev.importEnv(o[\"env\"].get_obj());\n\t\tfev.importState(o[\"pre\"].get_obj());\n\n\t\to[\"pre\"] = mValue(fev.exportState());\n\n\t\tfev.importExec(o[\"exec\"].get_obj());\n\t\tif (!fev.code)\n\t\t{\n\t\t\tfev.thisTxCode = get<3>(fev.addresses.at(fev.myAddress));\n\t\t\tfev.code = &fev.thisTxCode;\n\t\t}\n\n\t\tvm.reset(fev.gas);\n\t\tbytes output;\n\t\ttry\n\t\t{\n\t\t\toutput = vm.go(fev).toBytes();\n\t\t}\n\t\tcatch (Exception const& _e)\n\t\t{\n\t\t\tcnote << \"VM did throw an exception: \" << diagnostic_information(_e);\n\t\t}\n\t\tcatch (std::exception const& _e)\n\t\t{\n\t\t\tcnote << \"VM did throw an exception: \" << _e.what();\n\t\t}\n\n\t\t\/\/ delete null entries in storage for the sake of comparison\n\n\t\tfor (auto  &a: fev.addresses)\n\t\t{\n\t\t\tvector<u256> keystoDelete;\n\t\t\tfor (auto &s: get<2>(a.second))\n\t\t\t{\n\t\t\t\tif (s.second == 0)\n\t\t\t\t\tkeystoDelete.push_back(s.first);\n\t\t\t}\n\t\t\tfor (auto const key: keystoDelete )\n\t\t\t{\n\t\t\t\tget<2>(a.second).erase(key);\n\t\t\t}\n\t\t}\n\n\t\to[\"env\"] = mValue(fev.exportEnv());\n\t\to[\"exec\"] = mValue(fev.exportExec());\n\t\to[\"post\"] = mValue(fev.exportState());\n\t\to[\"callcreates\"] = fev.exportCallCreates();\n\t\to[\"out\"] = \"0x\" + toHex(output);\n\t\tfev.push(o, \"gas\", vm.gas());\n\t}\n}\n<commit_msg>style fix<commit_after>\/*\n    This file is part of cpp-ethereum.\n\n    cpp-ethereum is free software: you can redistribute it and\/or modify\n    it under the terms of the GNU General Public License as published by\n    the Free Software Foundation, either version 3 of the License, or\n    (at your option) any later version.\n\n    cpp-ethereum is distributed in the hope that it will be useful,\n    but WITHOUT ANY WARRANTY; without even the implied warranty of\n    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n    GNU General Public License for more details.\n\n    You should have received a copy of the GNU General Public License\n    along with cpp-ethereum.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\/** @file createRandomTest.cpp\n * @author Christoph Jentzsch <jentzsch.simulationsoftware@gmail.com>\n * @date 2014\n * Creating a random virtual machine test.\n *\/\n\n#include <string>\n#include <iostream>\n#include <boost\/random.hpp>\n#include <boost\/chrono.hpp>\n#include <boost\/filesystem\/path.hpp>\n#pragma GCC diagnostic ignored \"-Wunused-parameter\"\n#include <json_spirit\/json_spirit.h>\n#include <json_spirit\/json_spirit_reader_template.h>\n#include <json_spirit\/json_spirit_writer_template.h>\n#include <libdevcore\/CommonIO.h>\n#include <libdevcore\/CommonData.h>\n#include <libevmface\/Instruction.h>\n#include \"vm.h\"\n\nusing namespace std;\nusing namespace json_spirit;\nusing namespace dev;\n\nvoid doMyTests(json_spirit::mValue& v);\n\nint main(int argc, char *argv[])\n{\n\tif (argc != 2)\n\t{\n\t\tcout << \"usage: createRandomTest <filename>\\n\";\n\t\treturn 0;\n\t}\n\n\t\/\/ create random code\n\n\tboost::random::mt19937 gen;\n\n\tauto now = boost::chrono::steady_clock::now().time_since_epoch();\n\tauto timeSinceEpoch = boost::chrono::duration_cast<boost::chrono::nanoseconds>(now).count();\n\tgen.seed(static_cast<unsigned int>(timeSinceEpoch));\n\tboost::random::uniform_int_distribution<> lengthOfCodeDist(2, 16);\n\tboost::random::uniform_int_distribution<> opcodeDist(0, 255);\n\tboost::random::variate_generator<boost::mt19937&,\n\t\t\tboost::random::uniform_int_distribution<> > randGen(gen, opcodeDist);\n\n\tint lengthOfCode  = lengthOfCodeDist(gen);\n\tstring randomCode;\n\n\tfor (int i = 0; i < lengthOfCode; ++i)\n\t{\n\t\trandomCode += toHex(toCompactBigEndian(randGen()));\n\t}\n\n\t\/\/ read template test file\n\n\tmValue v;\n\tboost::filesystem::path p(__FILE__);\n\tboost::filesystem::path dir = p.parent_path();\n\tstring s = asString(contents(dir.string() + \"\/randomTestFiller.json\"));\n\tread_string(s, v);\n\n\t\/\/ insert new random code\n\tv.get_obj().find(\"randomVMtest\")->second.get_obj().find(\"pre\")->second.get_obj().begin()->second.get_obj()[\"code\"] = \"0x\" + randomCode;\n\n\t\/\/ execute code in vm\n\tdoMyTests(v);\n\n\t\/\/ write new test\n\tstring filename = argv[1];\n\twriteFile(filename, asBytes(json_spirit::write_string(v, true)));\n\n\treturn 0;\n}\n\nvoid doMyTests(json_spirit::mValue& v)\n{\n\tfor (auto& i: v.get_obj())\n\t{\n\t\tmObject& o = i.second.get_obj();\n\n\t\tassert(o.count(\"env\") > 0);\n\t\tassert(o.count(\"pre\") > 0);\n\t\tassert(o.count(\"exec\") > 0);\n\n\t\teth::VM vm;\n\t\ttest::FakeExtVM fev;\n\t\tfev.importEnv(o[\"env\"].get_obj());\n\t\tfev.importState(o[\"pre\"].get_obj());\n\n\t\to[\"pre\"] = mValue(fev.exportState());\n\n\t\tfev.importExec(o[\"exec\"].get_obj());\n\t\tif (!fev.code)\n\t\t{\n\t\t\tfev.thisTxCode = get<3>(fev.addresses.at(fev.myAddress));\n\t\t\tfev.code = &fev.thisTxCode;\n\t\t}\n\n\t\tvm.reset(fev.gas);\n\t\tbytes output;\n\t\ttry\n\t\t{\n\t\t\toutput = vm.go(fev).toBytes();\n\t\t}\n\t\tcatch (Exception const& _e)\n\t\t{\n\t\t\tcnote << \"VM did throw an exception: \" << diagnostic_information(_e);\n\t\t}\n\t\tcatch (std::exception const& _e)\n\t\t{\n\t\t\tcnote << \"VM did throw an exception: \" << _e.what();\n\t\t}\n\n\t\t\/\/ delete null entries in storage for the sake of comparison\n\n\t\tfor (auto  &a: fev.addresses)\n\t\t{\n\t\t\tvector<u256> keystoDelete;\n\t\t\tfor (auto &s: get<2>(a.second))\n\t\t\t{\n\t\t\t\tif (s.second == 0)\n\t\t\t\t\tkeystoDelete.push_back(s.first);\n\t\t\t}\n\t\t\tfor (auto const key: keystoDelete )\n\t\t\t{\n\t\t\t\tget<2>(a.second).erase(key);\n\t\t\t}\n\t\t}\n\n\t\to[\"env\"] = mValue(fev.exportEnv());\n\t\to[\"exec\"] = mValue(fev.exportExec());\n\t\to[\"post\"] = mValue(fev.exportState());\n\t\to[\"callcreates\"] = fev.exportCallCreates();\n\t\to[\"out\"] = \"0x\" + toHex(output);\n\t\tfev.push(o, \"gas\", vm.gas());\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Ascent MMORPG Server\n * Copyright (C) 2005-2008 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 Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\n *\/\n\n#include \"StdAfx.h\"\n\nDynamicObject::DynamicObject(uint32 high, uint32 low)\n{\n\tm_objectTypeId = TYPEID_DYNAMICOBJECT;\n\tm_valuesCount = DYNAMICOBJECT_END;\n\tm_uint32Values = _fields;\n\tmemset(m_uint32Values, 0,(DYNAMICOBJECT_END)*sizeof(uint32));\n\tm_updateMask.SetCount(DYNAMICOBJECT_END);\n\tm_uint32Values[OBJECT_FIELD_TYPE] = TYPE_DYNAMICOBJECT|TYPE_OBJECT;\n\tm_uint32Values[OBJECT_FIELD_GUID] = low;\n\tm_uint32Values[OBJECT_FIELD_GUID+1] = high;\n\tm_wowGuid.Init(GetGUID());\n\tm_floatValues[OBJECT_FIELD_SCALE_X] = 1;\n\n\n\tm_parentSpell=NULL;\n\tm_aliveDuration = 0;\n\tu_caster = 0;\n\tm_spellProto = 0;\n\tp_caster = 0;\n}\n\nDynamicObject::~DynamicObject()\n{\n\t\/\/ remove aura from all targets\n\tDynamicObjectList::iterator jtr  = targets.begin();\n\tDynamicObjectList::iterator jend = targets.end();\n\tUnit * target;\n\n\twhile(jtr != jend)\n\t{\n\t\ttarget = *jtr;\n\t\t++jtr;\n\t\ttarget->RemoveAura(m_spellProto->Id);\n\t}\n\n\tif(u_caster->dynObj == this)\n\t\tu_caster->dynObj = 0;\n}\n\nvoid DynamicObject::Create(Unit * caster, Spell * pSpell, float x, float y, float z, uint32 duration, float radius)\n{\n\tObject::_Create(caster->GetMapId(),x, y, z, 0);\n\tif(pSpell->g_caster)\n\t{\n\t\tm_parentSpell = pSpell;\n\t}\n\tp_caster = pSpell->p_caster;\n\n\tm_spellProto = pSpell->m_spellInfo;\n\tSetUInt64Value(DYNAMICOBJECT_CASTER, caster->GetGUID());\n\n\tm_uint32Values[OBJECT_FIELD_ENTRY] = m_spellProto->Id;\n\tm_uint32Values[DYNAMICOBJECT_BYTES] = 0x01eeeeee;\n\tm_uint32Values[DYNAMICOBJECT_SPELLID] = m_spellProto->Id;\n\n\tm_floatValues[DYNAMICOBJECT_RADIUS] = radius;\n\tm_floatValues[DYNAMICOBJECT_POS_X]  = x;\n\tm_floatValues[DYNAMICOBJECT_POS_Y]  = y;\n\tm_floatValues[DYNAMICOBJECT_POS_Z]  = z;\n\n\tm_aliveDuration = duration;\n\tu_caster = caster;\n\tm_faction = caster->m_faction;\n\tm_factionDBC = caster->m_factionDBC;\n\tif(caster->dynObj != 0)\n\t{\n\t\t\/\/ expire next update\n\t\tcaster->dynObj->m_aliveDuration = 1;\n\t\tcaster->dynObj->UpdateTargets();\n\t}\n\tcaster->dynObj = this;\n\tif(pSpell->g_caster)\n\t{\n\t   PushToWorld(pSpell->g_caster->GetMapMgr());\n\t}else \n\t\tPushToWorld(caster->GetMapMgr());\n\t\n  \n\tsEventMgr.AddEvent(this, &DynamicObject::UpdateTargets, EVENT_DYNAMICOBJECT_UPDATE, 100, 0,EVENT_FLAG_DO_NOT_EXECUTE_IN_WORLD_CONTEXT);\n}\n\nvoid DynamicObject::AddInRangeObject( Object* pObj )\n{\n\tif( pObj->IsUnit() )\n\t{\n\t\tbool attackable;\n\t\tif( p_caster != NULL)\n\t\t\tattackable = isAttackable( p_caster, pObj );\n\t\telse\n\t\t\tattackable = isAttackable( this, pObj );\n\t\t\n\t\tif( attackable )\n\t\t\tm_inRangeOppFactions.insert( static_cast< Unit* >( pObj ) );\n\t}\n\tObject::AddInRangeObject( pObj );\n}\n\nvoid DynamicObject::OnRemoveInRangeObject( Object* pObj )\n{\n\tif( pObj->IsUnit() )\n\t{\n\t\tm_inRangeOppFactions.erase( static_cast< Unit* >( pObj ) );\n\t\ttargets.erase( static_cast< Unit* >( pObj ) );\n\t}\n\tObject::OnRemoveInRangeObject( pObj );\n}\n\nvoid DynamicObject::UpdateTargets()\n{\n\tif(m_aliveDuration == 0)\n\t\treturn;\n\n\tif(m_aliveDuration >= 100)\n\t{\n\/\/\t\tFactionRangeList::iterator itr  = m_inRangeOppFactions.begin();\n\/\/\t\tFactionRangeList::iterator iend = m_inRangeOppFactions.end();\n\t\tstd::set<Object*>::iterator itr = GetInRangeSetBegin(),itr2;\n\t\tstd::set<Object*>::iterator iend = GetInRangeSetEnd();\n\t\tUnit * target;\n\t\tAura * pAura;\n\t\tfloat radius = m_floatValues[DYNAMICOBJECT_RADIUS]*m_floatValues[DYNAMICOBJECT_RADIUS];\n\n\t\twhile(itr != iend)\n\t\t{\n\/\/\t\t\ttarget = *itr;\n\/\/\t\t\t++itr;\n\n\t\t\titr2 = itr;\n\t\t\t++itr;\n\n\t\t\tif( !( (*itr2)->IsUnit() ) || ! static_cast< Unit* >( *itr2 )->isAlive() )\n\t\t\t\tcontinue;\n\n\t\t\ttarget = static_cast< Unit* >( *itr2 );\n\n\t\t\tif( !isAttackable( p_caster, target, !(m_spellProto->c_is_flags & SPELL_FLAG_IS_TARGETINGSTEALTHED) ) )\n\t\t\t\tcontinue;\n\n\t\t\t\/\/ skip units already hit, their range will be tested later\n\t\t\tif(targets.find(target) != targets.end())\n\t\t\t\tcontinue;\n\n\t\t\tif(GetDistanceSq(target) <= radius)\n\t\t\t{\n\t\t\t\tpAura = new Aura(m_spellProto, m_aliveDuration, u_caster, target);\n\t\t\t\tfor(uint32 i = 0; i < 3; ++i)\n\t\t\t\t{\n\t\t\t\t\tif(m_spellProto->Effect[i] == 27)\n\t\t\t\t\t{\n\t\t\t\t\t\tpAura->AddMod(m_spellProto->EffectApplyAuraName[i],\n\t\t\t\t\t\t\tm_spellProto->EffectBasePoints[i]+1, m_spellProto->EffectMiscValue[i], i);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\ttarget->AddAura(pAura);\n\t\t\t\tif(p_caster)\n\t\t\t\t{\n\t\t\t\t\tp_caster->HandleProc(PROC_ON_CAST_SPECIFIC_SPELL | PROC_ON_CAST_SPELL,target, m_spellProto);\n\t\t\t\t\tp_caster->m_procCounter = 0;\n\t\t\t\t}\n\n\t\t\t\t\/\/ add to target list\n\t\t\t\ttargets.insert(target);\n\t\t\t}\n\t\t}\n\n\t\t\/\/ loop the targets, check the range of all of them\n\t\tDynamicObjectList::iterator jtr  = targets.begin();\n\t\tDynamicObjectList::iterator jtr2;\n\t\tDynamicObjectList::iterator jend = targets.end();\n\t\t\n\t\twhile(jtr != jend)\n\t\t{\n\t\t\ttarget = *jtr;\n\t\t\tjtr2 = jtr;\n\t\t\t++jtr;\n\n\t\t\tif(GetDistanceSq(target) > radius)\n\t\t\t{\n\t\t\t\ttargets.erase(jtr2);\n\t\t\t\ttarget->RemoveAura(m_spellProto->Id);\n\t\t\t}\n\t\t}\n\n\t\tm_aliveDuration -= 100;\n\t}\n\telse\n\t{\n\t\tm_aliveDuration = 0;\n\t}\n\n\tif(m_aliveDuration == 0)\n\t{\n\t\tDynamicObjectList::iterator jtr  = targets.begin();\n\t\tDynamicObjectList::iterator jend = targets.end();\n\t\tUnit * target;\n\n\t\twhile(jtr != jend)\n\t\t{\n\t\t\ttarget = *jtr;\n\t\t\t++jtr;\n\t\t\ttarget->RemoveAura(m_spellProto->Id);\n\t\t}\n\n\t\tRemove();\n\t}\n}\n\nvoid DynamicObject::Remove()\n{\n\tif(IsInWorld())\n\t\tRemoveFromWorld(true);\n\tdelete this;\n}\n\n<commit_msg>*) totems will be not destroyed by PersistentAA (hate testing totems on localhost xD)<commit_after>\/*\n * Ascent MMORPG Server\n * Copyright (C) 2005-2008 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 Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\n *\/\n\n#include \"StdAfx.h\"\n\nDynamicObject::DynamicObject(uint32 high, uint32 low)\n{\n\tm_objectTypeId = TYPEID_DYNAMICOBJECT;\n\tm_valuesCount = DYNAMICOBJECT_END;\n\tm_uint32Values = _fields;\n\tmemset(m_uint32Values, 0,(DYNAMICOBJECT_END)*sizeof(uint32));\n\tm_updateMask.SetCount(DYNAMICOBJECT_END);\n\tm_uint32Values[OBJECT_FIELD_TYPE] = TYPE_DYNAMICOBJECT|TYPE_OBJECT;\n\tm_uint32Values[OBJECT_FIELD_GUID] = low;\n\tm_uint32Values[OBJECT_FIELD_GUID+1] = high;\n\tm_wowGuid.Init(GetGUID());\n\tm_floatValues[OBJECT_FIELD_SCALE_X] = 1;\n\n\n\tm_parentSpell=NULL;\n\tm_aliveDuration = 0;\n\tu_caster = 0;\n\tm_spellProto = 0;\n\tp_caster = 0;\n}\n\nDynamicObject::~DynamicObject()\n{\n\t\/\/ remove aura from all targets\n\tDynamicObjectList::iterator jtr  = targets.begin();\n\tDynamicObjectList::iterator jend = targets.end();\n\tUnit * target;\n\n\twhile(jtr != jend)\n\t{\n\t\ttarget = *jtr;\n\t\t++jtr;\n\t\ttarget->RemoveAura(m_spellProto->Id);\n\t}\n\n\tif(u_caster->dynObj == this)\n\t\tu_caster->dynObj = 0;\n}\n\nvoid DynamicObject::Create(Unit * caster, Spell * pSpell, float x, float y, float z, uint32 duration, float radius)\n{\n\tObject::_Create(caster->GetMapId(),x, y, z, 0);\n\tif(pSpell->g_caster)\n\t{\n\t\tm_parentSpell = pSpell;\n\t}\n\tp_caster = pSpell->p_caster;\n\n\tm_spellProto = pSpell->m_spellInfo;\n\tSetUInt64Value(DYNAMICOBJECT_CASTER, caster->GetGUID());\n\n\tm_uint32Values[OBJECT_FIELD_ENTRY] = m_spellProto->Id;\n\tm_uint32Values[DYNAMICOBJECT_BYTES] = 0x01eeeeee;\n\tm_uint32Values[DYNAMICOBJECT_SPELLID] = m_spellProto->Id;\n\n\tm_floatValues[DYNAMICOBJECT_RADIUS] = radius;\n\tm_floatValues[DYNAMICOBJECT_POS_X]  = x;\n\tm_floatValues[DYNAMICOBJECT_POS_Y]  = y;\n\tm_floatValues[DYNAMICOBJECT_POS_Z]  = z;\n\n\tm_aliveDuration = duration;\n\tu_caster = caster;\n\tm_faction = caster->m_faction;\n\tm_factionDBC = caster->m_factionDBC;\n\tif(caster->dynObj != 0)\n\t{\n\t\t\/\/ expire next update\n\t\tcaster->dynObj->m_aliveDuration = 1;\n\t\tcaster->dynObj->UpdateTargets();\n\t}\n\tcaster->dynObj = this;\n\tif(pSpell->g_caster)\n\t{\n\t   PushToWorld(pSpell->g_caster->GetMapMgr());\n\t}else \n\t\tPushToWorld(caster->GetMapMgr());\n\t\n  \n\tsEventMgr.AddEvent(this, &DynamicObject::UpdateTargets, EVENT_DYNAMICOBJECT_UPDATE, 100, 0,EVENT_FLAG_DO_NOT_EXECUTE_IN_WORLD_CONTEXT);\n}\n\nvoid DynamicObject::AddInRangeObject( Object* pObj )\n{\n\tif( pObj->IsUnit() )\n\t{\n\t\tbool attackable;\n\t\tif( p_caster != NULL)\n\t\t\tattackable = isAttackable( p_caster, pObj );\n\t\telse\n\t\t\tattackable = isAttackable( this, pObj );\n\t\t\n\t\tif( attackable )\n\t\t\tm_inRangeOppFactions.insert( static_cast< Unit* >( pObj ) );\n\t}\n\tObject::AddInRangeObject( pObj );\n}\n\nvoid DynamicObject::OnRemoveInRangeObject( Object* pObj )\n{\n\tif( pObj->IsUnit() )\n\t{\n\t\tm_inRangeOppFactions.erase( static_cast< Unit* >( pObj ) );\n\t\ttargets.erase( static_cast< Unit* >( pObj ) );\n\t}\n\tObject::OnRemoveInRangeObject( pObj );\n}\n\nvoid DynamicObject::UpdateTargets()\n{\n\tif(m_aliveDuration == 0)\n\t\treturn;\n\n\tif(m_aliveDuration >= 100)\n\t{\n\/\/\t\tFactionRangeList::iterator itr  = m_inRangeOppFactions.begin();\n\/\/\t\tFactionRangeList::iterator iend = m_inRangeOppFactions.end();\n\t\tstd::set<Object*>::iterator itr = GetInRangeSetBegin(),itr2;\n\t\tstd::set<Object*>::iterator iend = GetInRangeSetEnd();\n\t\tUnit * target;\n\t\tAura * pAura;\n\t\tfloat radius = m_floatValues[DYNAMICOBJECT_RADIUS]*m_floatValues[DYNAMICOBJECT_RADIUS];\n\n\t\twhile(itr != iend)\n\t\t{\n\/\/\t\t\ttarget = *itr;\n\/\/\t\t\t++itr;\n\n\t\t\titr2 = itr;\n\t\t\t++itr;\n\n\t\t\tif( !( (*itr2)->IsUnit() ) || ! static_cast< Unit* >( *itr2 )->isAlive() || ( static_cast< Creature* >( *itr2 )->IsTotem() && !static_cast< Unit* >( *itr2 )->IsPlayer() ) )\n\t\t\t\tcontinue;\n\n\t\t\ttarget = static_cast< Unit* >( *itr2 );\n\n\t\t\tif( !isAttackable( p_caster, target, !(m_spellProto->c_is_flags & SPELL_FLAG_IS_TARGETINGSTEALTHED) ) )\n\t\t\t\tcontinue;\n\n\t\t\t\/\/ skip units already hit, their range will be tested later\n\t\t\tif(targets.find(target) != targets.end())\n\t\t\t\tcontinue;\n\n\t\t\tif(GetDistanceSq(target) <= radius)\n\t\t\t{\n\t\t\t\tpAura = new Aura(m_spellProto, m_aliveDuration, u_caster, target);\n\t\t\t\tfor(uint32 i = 0; i < 3; ++i)\n\t\t\t\t{\n\t\t\t\t\tif(m_spellProto->Effect[i] == 27)\n\t\t\t\t\t{\n\t\t\t\t\t\tpAura->AddMod(m_spellProto->EffectApplyAuraName[i],\n\t\t\t\t\t\t\tm_spellProto->EffectBasePoints[i]+1, m_spellProto->EffectMiscValue[i], i);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\ttarget->AddAura(pAura);\n\t\t\t\tif(p_caster)\n\t\t\t\t{\n\t\t\t\t\tp_caster->HandleProc(PROC_ON_CAST_SPECIFIC_SPELL | PROC_ON_CAST_SPELL,target, m_spellProto);\n\t\t\t\t\tp_caster->m_procCounter = 0;\n\t\t\t\t}\n\n\t\t\t\t\/\/ add to target list\n\t\t\t\ttargets.insert(target);\n\t\t\t}\n\t\t}\n\n\t\t\/\/ loop the targets, check the range of all of them\n\t\tDynamicObjectList::iterator jtr  = targets.begin();\n\t\tDynamicObjectList::iterator jtr2;\n\t\tDynamicObjectList::iterator jend = targets.end();\n\t\t\n\t\twhile(jtr != jend)\n\t\t{\n\t\t\ttarget = *jtr;\n\t\t\tjtr2 = jtr;\n\t\t\t++jtr;\n\n\t\t\tif(GetDistanceSq(target) > radius)\n\t\t\t{\n\t\t\t\ttargets.erase(jtr2);\n\t\t\t\ttarget->RemoveAura(m_spellProto->Id);\n\t\t\t}\n\t\t}\n\n\t\tm_aliveDuration -= 100;\n\t}\n\telse\n\t{\n\t\tm_aliveDuration = 0;\n\t}\n\n\tif(m_aliveDuration == 0)\n\t{\n\t\tDynamicObjectList::iterator jtr  = targets.begin();\n\t\tDynamicObjectList::iterator jend = targets.end();\n\t\tUnit * target;\n\n\t\twhile(jtr != jend)\n\t\t{\n\t\t\ttarget = *jtr;\n\t\t\t++jtr;\n\t\t\ttarget->RemoveAura(m_spellProto->Id);\n\t\t}\n\n\t\tRemove();\n\t}\n}\n\nvoid DynamicObject::Remove()\n{\n\tif(IsInWorld())\n\t\tRemoveFromWorld(true);\n\tdelete this;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <utki\/destructable.hpp>\n\n#include <pulse\/simple.h>\n#include <pulse\/error.h>\n\n#include \"write_based.cxx\"\n\n\nnamespace{\n\nclass audio_backend : public write_based, public utki::destructable{\n\tpa_simple *handle;\n\t\n\tvoid write(const utki::span<std::int16_t> buf)override{\n\/\/\t\tASSERT(buf.Size() == this->BufferSizeInBytes())\n\n\t\tint error;\n\t\t\n\t\tif(pa_simple_write(\n\t\t\t\tthis->handle,\n\t\t\t\t&*buf.begin(),\n\t\t\t\tsize_t(buf.sizeInBytes()),\n\t\t\t\t&error\n\t\t\t) < 0)\n\t\t{\n\t\t\tTRACE(<< \"pa_simple_write(): error (\" << pa_strerror(error) << \")\" << std::endl)\n\t\t}\n\t}\n\t\npublic:\n\taudio_backend(\n\t\t\taudout::format outputFormat,\n\t\t\tuint32_t bufferSizeFrames,\n\t\t\taudout::listener* listener\n\t\t) :\n\t\t\twrite_based(listener, bufferSizeFrames * outputFormat.num_channels())\n\t{\n\t\tTRACE(<< \"opening device\" << std::endl)\n\n\t\tpa_sample_spec ss;\n\t\tss.format = PA_SAMPLE_S16NE;\/\/Native endian\n\t\tss.channels = outputFormat.num_channels();\n\t\tss.rate = outputFormat.frequency();\n\n\t\tunsigned bufferSizeInBytes = bufferSizeFrames * outputFormat.frame_size();\n\t\tpa_buffer_attr ba;\n\t\tba.fragsize = bufferSizeInBytes;\n\t\tba.tlength = bufferSizeInBytes;\n\t\tba.minreq = std::uint32_t(-1);\n\t\tba.maxlength = std::uint32_t(-1);\n\t\tba.prebuf = std::uint32_t(-1);\n\t\t\n\t\tpa_channel_map cm;\n\t\tpa_channel_map_init_auto(&cm, ss.channels, PA_CHANNEL_MAP_WAVEEX);\n\n\t\tint error;\n\n\t\tthis->handle = pa_simple_new(\n\t\t\t\tnullptr, \/\/ Use the default server.\n\t\t\t\t\"audout\", \/\/ Our application's name.\n\t\t\t\tPA_STREAM_PLAYBACK,\n\t\t\t\tnullptr, \/\/ Use the default device.\n\t\t\t\t\"sound stream\", \/\/ Description of our stream.\n\t\t\t\t&ss, \/\/ our sample format.\n\t\t\t\t&cm, \/\/ channel map\n\t\t\t\t&ba, \/\/ buffering attributes.\n\t\t\t\t&error\n\t\t\t);\n\n\t\tif(!this->handle){\n\t\t\tTRACE(<< \"error opening PulseAudio connection (\" << pa_strerror(error) << \")\" << std::endl)\n\t\t\tstd::stringstream ss;\n\t\t\tss << \"error opening PulseAudio connection: \" << pa_strerror(error);\n\t\t\tthrow std::runtime_error(ss.str());\n\t\t}\n\t\t\n\t\tthis->startThread();\n\t}\n\t\n\tvirtual ~audio_backend()noexcept{\n\t\tthis->stopThread();\n\t\t\n\t\tASSERT(this->handle)\n\t\tpa_simple_free(this->handle);\n\t}\n};\n\n}\n<commit_msg>build fix<commit_after>#pragma once\n\n#include <utki\/destructable.hpp>\n\n#include <pulse\/simple.h>\n#include <pulse\/error.h>\n\n#include \"write_based.cxx\"\n\n\nnamespace{\n\nclass audio_backend : public write_based, public utki::destructable{\n\tpa_simple *handle;\n\t\n\tvoid write(const utki::span<std::int16_t> buf)override{\n\/\/\t\tASSERT(buf.Size() == this->BufferSizeInBytes())\n\n\t\tint error;\n\t\t\n\t\tif(pa_simple_write(\n\t\t\t\tthis->handle,\n\t\t\t\t&*buf.begin(),\n\t\t\t\tsize_t(buf.size_bytes()),\n\t\t\t\t&error\n\t\t\t) < 0)\n\t\t{\n\t\t\tTRACE(<< \"pa_simple_write(): error (\" << pa_strerror(error) << \")\" << std::endl)\n\t\t}\n\t}\n\t\npublic:\n\taudio_backend(\n\t\t\taudout::format outputFormat,\n\t\t\tuint32_t bufferSizeFrames,\n\t\t\taudout::listener* listener\n\t\t) :\n\t\t\twrite_based(listener, bufferSizeFrames * outputFormat.num_channels())\n\t{\n\t\tTRACE(<< \"opening device\" << std::endl)\n\n\t\tpa_sample_spec ss;\n\t\tss.format = PA_SAMPLE_S16NE;\/\/Native endian\n\t\tss.channels = outputFormat.num_channels();\n\t\tss.rate = outputFormat.frequency();\n\n\t\tunsigned bufferSizeInBytes = bufferSizeFrames * outputFormat.frame_size();\n\t\tpa_buffer_attr ba;\n\t\tba.fragsize = bufferSizeInBytes;\n\t\tba.tlength = bufferSizeInBytes;\n\t\tba.minreq = std::uint32_t(-1);\n\t\tba.maxlength = std::uint32_t(-1);\n\t\tba.prebuf = std::uint32_t(-1);\n\t\t\n\t\tpa_channel_map cm;\n\t\tpa_channel_map_init_auto(&cm, ss.channels, PA_CHANNEL_MAP_WAVEEX);\n\n\t\tint error;\n\n\t\tthis->handle = pa_simple_new(\n\t\t\t\tnullptr, \/\/ Use the default server.\n\t\t\t\t\"audout\", \/\/ Our application's name.\n\t\t\t\tPA_STREAM_PLAYBACK,\n\t\t\t\tnullptr, \/\/ Use the default device.\n\t\t\t\t\"sound stream\", \/\/ Description of our stream.\n\t\t\t\t&ss, \/\/ our sample format.\n\t\t\t\t&cm, \/\/ channel map\n\t\t\t\t&ba, \/\/ buffering attributes.\n\t\t\t\t&error\n\t\t\t);\n\n\t\tif(!this->handle){\n\t\t\tTRACE(<< \"error opening PulseAudio connection (\" << pa_strerror(error) << \")\" << std::endl)\n\t\t\tstd::stringstream ss;\n\t\t\tss << \"error opening PulseAudio connection: \" << pa_strerror(error);\n\t\t\tthrow std::runtime_error(ss.str());\n\t\t}\n\t\t\n\t\tthis->startThread();\n\t}\n\t\n\tvirtual ~audio_backend()noexcept{\n\t\tthis->stopThread();\n\t\t\n\t\tASSERT(this->handle)\n\t\tpa_simple_free(this->handle);\n\t}\n};\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright (C) 2003 Scott Wheeler <wheeler@kde.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 * 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 ``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\n#include <cppunit\/extensions\/HelperMacros.h>\n#include <tstring.h>\n#include <string.h>\n\nusing namespace std;\nusing namespace TagLib;\n\nclass TestString : public CppUnit::TestFixture\n{\n  CPPUNIT_TEST_SUITE(TestString);\n  CPPUNIT_TEST(testString);\n  CPPUNIT_TEST(testRfind);\n  CPPUNIT_TEST(testUTF16Encode);\n  CPPUNIT_TEST(testUTF16Decode);\n  CPPUNIT_TEST(testUTF16DecodeInvalidBOM);\n  CPPUNIT_TEST(testUTF16DecodeEmptyWithBOM);\n  CPPUNIT_TEST(testAppendCharDetach);\n  CPPUNIT_TEST(testAppendStringDetach);\n  CPPUNIT_TEST(testToInt);\n  CPPUNIT_TEST_SUITE_END();\n\npublic:\n\n  void testString()\n  {\n    String s = \"taglib string\";\n    ByteVector v = \"taglib string\";\n    CPPUNIT_ASSERT(v == s.data(String::Latin1));\n\n    char str[] = \"taglib string\";\n    CPPUNIT_ASSERT(strcmp(s.toCString(), str) == 0);\n\n    String unicode(\"José Carlos\", String::UTF8);\n    CPPUNIT_ASSERT(strcmp(unicode.toCString(), \"Jos\\xe9 Carlos\") == 0);\n\n    String latin = \"Jos\\xe9 Carlos\";\n    CPPUNIT_ASSERT(strcmp(latin.toCString(true), \"José Carlos\") == 0);\n\n    String unicode2(unicode.to8Bit(true), String::UTF8);\n    CPPUNIT_ASSERT(unicode == unicode2);\n\n    CPPUNIT_ASSERT(strcmp(String::number(0).toCString(), \"0\") == 0);\n    CPPUNIT_ASSERT(strcmp(String::number(12345678).toCString(), \"12345678\") == 0);\n    CPPUNIT_ASSERT(strcmp(String::number(-12345678).toCString(), \"-12345678\") == 0);\n\n    String n = \"123\";\n    CPPUNIT_ASSERT(n.toInt() == 123);\n\n    n = \"-123\";\n    CPPUNIT_ASSERT(n.toInt() == -123);\n\n    CPPUNIT_ASSERT(String(\"0\").toInt() == 0);\n    CPPUNIT_ASSERT(String(\"1\").toInt() == 1);\n\n    CPPUNIT_ASSERT(String(\"  foo  \").stripWhiteSpace() == String(\"foo\"));\n    CPPUNIT_ASSERT(String(\"foo    \").stripWhiteSpace() == String(\"foo\"));\n    CPPUNIT_ASSERT(String(\"    foo\").stripWhiteSpace() == String(\"foo\"));\n\n    CPPUNIT_ASSERT(memcmp(String(\"foo\").data(String::Latin1).data(), \"foo\", 3) == 0);\n    CPPUNIT_ASSERT(memcmp(String(\"f\").data(String::Latin1).data(), \"f\", 1) == 0);\n\n    ByteVector utf16 = unicode.data(String::UTF16);\n\n  \/\/ Check to make sure that the BOM is there and that the data size is correct\n\n    CPPUNIT_ASSERT(utf16.size() == 2 + (unicode.size() * 2));\n\n    CPPUNIT_ASSERT(unicode == String(utf16, String::UTF16));\n  }\n\n  void testUTF16Encode()\n  {\n    String a(\"foo\");\n    ByteVector b(\"\\0f\\0o\\0o\", 6);\n    ByteVector c(\"f\\0o\\0o\\0\", 6);\n    ByteVector d(\"\\377\\376f\\0o\\0o\\0\", 8);\n    CPPUNIT_ASSERT(a.data(String::UTF16BE) != a.data(String::UTF16LE));\n    CPPUNIT_ASSERT(b == a.data(String::UTF16BE));\n    CPPUNIT_ASSERT(c == a.data(String::UTF16LE));\n    CPPUNIT_ASSERT_EQUAL(d, a.data(String::UTF16));\n  }\n\n  void testUTF16Decode()\n  {\n    String a(\"foo\");\n    ByteVector b(\"\\0f\\0o\\0o\", 6);\n    ByteVector c(\"f\\0o\\0o\\0\", 6);\n    ByteVector d(\"\\377\\376f\\0o\\0o\\0\", 8);\n    CPPUNIT_ASSERT_EQUAL(a, String(b, String::UTF16BE));\n    CPPUNIT_ASSERT_EQUAL(a, String(c, String::UTF16LE));\n    CPPUNIT_ASSERT_EQUAL(a, String(d, String::UTF16));\n  }\n\n  \/\/ this test is expected to print \"TagLib: String::prepare() -\n  \/\/ Invalid UTF16 string.\" on the console 3 times\n  void testUTF16DecodeInvalidBOM()\n  {\n    ByteVector b(\" \", 1);\n    ByteVector c(\"  \", 2);\n    ByteVector d(\"  \\0f\\0o\\0o\", 8);\n    CPPUNIT_ASSERT_EQUAL(String(), String(b, String::UTF16));\n    CPPUNIT_ASSERT_EQUAL(String(), String(c, String::UTF16));\n    CPPUNIT_ASSERT_EQUAL(String(), String(d, String::UTF16));\n  }\n\n  void testUTF16DecodeEmptyWithBOM()\n  {\n    ByteVector a(\"\\377\\376\", 2);\n    ByteVector b(\"\\376\\377\", 2);\n    CPPUNIT_ASSERT_EQUAL(String(), String(a, String::UTF16));\n    CPPUNIT_ASSERT_EQUAL(String(), String(b, String::UTF16));\n  }\n\n  void testAppendStringDetach()\n  {\n    String a(\"a\");\n    String b = a;\n    a += \"b\";\n    CPPUNIT_ASSERT_EQUAL(String(\"ab\"), a);\n    CPPUNIT_ASSERT_EQUAL(String(\"a\"), b);\n  }\n\n  void testAppendCharDetach()\n  {\n    String a(\"a\");\n    String b = a;\n    a += 'b';\n    CPPUNIT_ASSERT_EQUAL(String(\"ab\"), a);\n    CPPUNIT_ASSERT_EQUAL(String(\"a\"), b);\n  }\n\n  void testRfind()\n  {\n    CPPUNIT_ASSERT_EQUAL(-1, String(\"foo.bar\").rfind(\".\", 0));\n    CPPUNIT_ASSERT_EQUAL(-1, String(\"foo.bar\").rfind(\".\", 1));\n    CPPUNIT_ASSERT_EQUAL(-1, String(\"foo.bar\").rfind(\".\", 2));\n    CPPUNIT_ASSERT_EQUAL(3, String(\"foo.bar\").rfind(\".\", 3));\n    CPPUNIT_ASSERT_EQUAL(3, String(\"foo.bar\").rfind(\".\", 4));\n    CPPUNIT_ASSERT_EQUAL(3, String(\"foo.bar\").rfind(\".\", 5));\n    CPPUNIT_ASSERT_EQUAL(3, String(\"foo.bar\").rfind(\".\", 6));\n    CPPUNIT_ASSERT_EQUAL(3, String(\"foo.bar\").rfind(\".\", 7));\n    CPPUNIT_ASSERT_EQUAL(3, String(\"foo.bar\").rfind(\".\"));\n  }\n\n  void testToInt()\n  {\n    bool ok;\n    CPPUNIT_ASSERT_EQUAL(String(\"123\").toInt(&ok), 123);\n    CPPUNIT_ASSERT_EQUAL(ok, true);\n\n    CPPUNIT_ASSERT_EQUAL(String(\"-123\").toInt(&ok), -123);\n    CPPUNIT_ASSERT_EQUAL(ok, true);\n\n    CPPUNIT_ASSERT_EQUAL(String(\"abc\").toInt(&ok), 0);\n    CPPUNIT_ASSERT_EQUAL(ok, false);\n\n    CPPUNIT_ASSERT_EQUAL(String(\"1x\").toInt(&ok), 1);\n    CPPUNIT_ASSERT_EQUAL(ok, false);\n\n    CPPUNIT_ASSERT_EQUAL(String(\"\").toInt(&ok), 0);\n    CPPUNIT_ASSERT_EQUAL(ok, false);\n\n    CPPUNIT_ASSERT_EQUAL(String(\"-\").toInt(&ok), 0);\n    CPPUNIT_ASSERT_EQUAL(ok, false);\n\n    CPPUNIT_ASSERT_EQUAL(String(\"123\").toInt(), 123);\n    CPPUNIT_ASSERT_EQUAL(String(\"-123\").toInt(), -123);\n    CPPUNIT_ASSERT_EQUAL(String(\"123aa\").toInt(), 123);\n    CPPUNIT_ASSERT_EQUAL(String(\"-123aa\").toInt(), -123);\n  }\n\n};\n\nCPPUNIT_TEST_SUITE_REGISTRATION(TestString);\n<commit_msg>Add tests for String::substr<commit_after>\/* Copyright (C) 2003 Scott Wheeler <wheeler@kde.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 * 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 ``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\n#include <cppunit\/extensions\/HelperMacros.h>\n#include <tstring.h>\n#include <string.h>\n\nusing namespace std;\nusing namespace TagLib;\n\nclass TestString : public CppUnit::TestFixture\n{\n  CPPUNIT_TEST_SUITE(TestString);\n  CPPUNIT_TEST(testString);\n  CPPUNIT_TEST(testRfind);\n  CPPUNIT_TEST(testUTF16Encode);\n  CPPUNIT_TEST(testUTF16Decode);\n  CPPUNIT_TEST(testUTF16DecodeInvalidBOM);\n  CPPUNIT_TEST(testUTF16DecodeEmptyWithBOM);\n  CPPUNIT_TEST(testAppendCharDetach);\n  CPPUNIT_TEST(testAppendStringDetach);\n  CPPUNIT_TEST(testToInt);\n  CPPUNIT_TEST(testSubstr);\n  CPPUNIT_TEST_SUITE_END();\n\npublic:\n\n  void testString()\n  {\n    String s = \"taglib string\";\n    ByteVector v = \"taglib string\";\n    CPPUNIT_ASSERT(v == s.data(String::Latin1));\n\n    char str[] = \"taglib string\";\n    CPPUNIT_ASSERT(strcmp(s.toCString(), str) == 0);\n\n    String unicode(\"José Carlos\", String::UTF8);\n    CPPUNIT_ASSERT(strcmp(unicode.toCString(), \"Jos\\xe9 Carlos\") == 0);\n\n    String latin = \"Jos\\xe9 Carlos\";\n    CPPUNIT_ASSERT(strcmp(latin.toCString(true), \"José Carlos\") == 0);\n\n    String unicode2(unicode.to8Bit(true), String::UTF8);\n    CPPUNIT_ASSERT(unicode == unicode2);\n\n    CPPUNIT_ASSERT(strcmp(String::number(0).toCString(), \"0\") == 0);\n    CPPUNIT_ASSERT(strcmp(String::number(12345678).toCString(), \"12345678\") == 0);\n    CPPUNIT_ASSERT(strcmp(String::number(-12345678).toCString(), \"-12345678\") == 0);\n\n    String n = \"123\";\n    CPPUNIT_ASSERT(n.toInt() == 123);\n\n    n = \"-123\";\n    CPPUNIT_ASSERT(n.toInt() == -123);\n\n    CPPUNIT_ASSERT(String(\"0\").toInt() == 0);\n    CPPUNIT_ASSERT(String(\"1\").toInt() == 1);\n\n    CPPUNIT_ASSERT(String(\"  foo  \").stripWhiteSpace() == String(\"foo\"));\n    CPPUNIT_ASSERT(String(\"foo    \").stripWhiteSpace() == String(\"foo\"));\n    CPPUNIT_ASSERT(String(\"    foo\").stripWhiteSpace() == String(\"foo\"));\n\n    CPPUNIT_ASSERT(memcmp(String(\"foo\").data(String::Latin1).data(), \"foo\", 3) == 0);\n    CPPUNIT_ASSERT(memcmp(String(\"f\").data(String::Latin1).data(), \"f\", 1) == 0);\n\n    ByteVector utf16 = unicode.data(String::UTF16);\n\n  \/\/ Check to make sure that the BOM is there and that the data size is correct\n\n    CPPUNIT_ASSERT(utf16.size() == 2 + (unicode.size() * 2));\n\n    CPPUNIT_ASSERT(unicode == String(utf16, String::UTF16));\n  }\n\n  void testUTF16Encode()\n  {\n    String a(\"foo\");\n    ByteVector b(\"\\0f\\0o\\0o\", 6);\n    ByteVector c(\"f\\0o\\0o\\0\", 6);\n    ByteVector d(\"\\377\\376f\\0o\\0o\\0\", 8);\n    CPPUNIT_ASSERT(a.data(String::UTF16BE) != a.data(String::UTF16LE));\n    CPPUNIT_ASSERT(b == a.data(String::UTF16BE));\n    CPPUNIT_ASSERT(c == a.data(String::UTF16LE));\n    CPPUNIT_ASSERT_EQUAL(d, a.data(String::UTF16));\n  }\n\n  void testUTF16Decode()\n  {\n    String a(\"foo\");\n    ByteVector b(\"\\0f\\0o\\0o\", 6);\n    ByteVector c(\"f\\0o\\0o\\0\", 6);\n    ByteVector d(\"\\377\\376f\\0o\\0o\\0\", 8);\n    CPPUNIT_ASSERT_EQUAL(a, String(b, String::UTF16BE));\n    CPPUNIT_ASSERT_EQUAL(a, String(c, String::UTF16LE));\n    CPPUNIT_ASSERT_EQUAL(a, String(d, String::UTF16));\n  }\n\n  \/\/ this test is expected to print \"TagLib: String::prepare() -\n  \/\/ Invalid UTF16 string.\" on the console 3 times\n  void testUTF16DecodeInvalidBOM()\n  {\n    ByteVector b(\" \", 1);\n    ByteVector c(\"  \", 2);\n    ByteVector d(\"  \\0f\\0o\\0o\", 8);\n    CPPUNIT_ASSERT_EQUAL(String(), String(b, String::UTF16));\n    CPPUNIT_ASSERT_EQUAL(String(), String(c, String::UTF16));\n    CPPUNIT_ASSERT_EQUAL(String(), String(d, String::UTF16));\n  }\n\n  void testUTF16DecodeEmptyWithBOM()\n  {\n    ByteVector a(\"\\377\\376\", 2);\n    ByteVector b(\"\\376\\377\", 2);\n    CPPUNIT_ASSERT_EQUAL(String(), String(a, String::UTF16));\n    CPPUNIT_ASSERT_EQUAL(String(), String(b, String::UTF16));\n  }\n\n  void testAppendStringDetach()\n  {\n    String a(\"a\");\n    String b = a;\n    a += \"b\";\n    CPPUNIT_ASSERT_EQUAL(String(\"ab\"), a);\n    CPPUNIT_ASSERT_EQUAL(String(\"a\"), b);\n  }\n\n  void testAppendCharDetach()\n  {\n    String a(\"a\");\n    String b = a;\n    a += 'b';\n    CPPUNIT_ASSERT_EQUAL(String(\"ab\"), a);\n    CPPUNIT_ASSERT_EQUAL(String(\"a\"), b);\n  }\n\n  void testRfind()\n  {\n    CPPUNIT_ASSERT_EQUAL(-1, String(\"foo.bar\").rfind(\".\", 0));\n    CPPUNIT_ASSERT_EQUAL(-1, String(\"foo.bar\").rfind(\".\", 1));\n    CPPUNIT_ASSERT_EQUAL(-1, String(\"foo.bar\").rfind(\".\", 2));\n    CPPUNIT_ASSERT_EQUAL(3, String(\"foo.bar\").rfind(\".\", 3));\n    CPPUNIT_ASSERT_EQUAL(3, String(\"foo.bar\").rfind(\".\", 4));\n    CPPUNIT_ASSERT_EQUAL(3, String(\"foo.bar\").rfind(\".\", 5));\n    CPPUNIT_ASSERT_EQUAL(3, String(\"foo.bar\").rfind(\".\", 6));\n    CPPUNIT_ASSERT_EQUAL(3, String(\"foo.bar\").rfind(\".\", 7));\n    CPPUNIT_ASSERT_EQUAL(3, String(\"foo.bar\").rfind(\".\"));\n  }\n\n  void testToInt()\n  {\n    bool ok;\n    CPPUNIT_ASSERT_EQUAL(String(\"123\").toInt(&ok), 123);\n    CPPUNIT_ASSERT_EQUAL(ok, true);\n\n    CPPUNIT_ASSERT_EQUAL(String(\"-123\").toInt(&ok), -123);\n    CPPUNIT_ASSERT_EQUAL(ok, true);\n\n    CPPUNIT_ASSERT_EQUAL(String(\"abc\").toInt(&ok), 0);\n    CPPUNIT_ASSERT_EQUAL(ok, false);\n\n    CPPUNIT_ASSERT_EQUAL(String(\"1x\").toInt(&ok), 1);\n    CPPUNIT_ASSERT_EQUAL(ok, false);\n\n    CPPUNIT_ASSERT_EQUAL(String(\"\").toInt(&ok), 0);\n    CPPUNIT_ASSERT_EQUAL(ok, false);\n\n    CPPUNIT_ASSERT_EQUAL(String(\"-\").toInt(&ok), 0);\n    CPPUNIT_ASSERT_EQUAL(ok, false);\n\n    CPPUNIT_ASSERT_EQUAL(String(\"123\").toInt(), 123);\n    CPPUNIT_ASSERT_EQUAL(String(\"-123\").toInt(), -123);\n    CPPUNIT_ASSERT_EQUAL(String(\"123aa\").toInt(), 123);\n    CPPUNIT_ASSERT_EQUAL(String(\"-123aa\").toInt(), -123);\n  }\n\n  void testSubstr()\n  {\n    CPPUNIT_ASSERT_EQUAL(String(\"01\"), String(\"0123456\").substr(0, 2));\n    CPPUNIT_ASSERT_EQUAL(String(\"12\"), String(\"0123456\").substr(1, 2));\n    CPPUNIT_ASSERT_EQUAL(String(\"123456\"), String(\"0123456\").substr(1, 200));\n  }\n\n};\n\nCPPUNIT_TEST_SUITE_REGISTRATION(TestString);\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2012 Kim Walisch, <kim.walisch@gmail.com>.\n\/\/ All rights reserved.\n\/\/\n\/\/ This file is part of primesieve.\n\/\/ Homepage: http:\/\/primesieve.googlecode.com\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions\n\/\/ are met:\n\/\/\n\/\/   * Redistributions of source code must retain the above copyright\n\/\/     notice, this list of conditions and the following disclaimer.\n\/\/   * Redistributions in binary form must reproduce the above\n\/\/     copyright notice, this list of conditions and the following\n\/\/     disclaimer in the documentation and\/or other materials provided\n\/\/     with the distribution.\n\/\/   * Neither the name of the author nor the names of its\n\/\/     contributors may be used to endorse or promote products derived\n\/\/     from this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n\/\/ FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n\/\/ COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n\/\/ INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n\/\/ (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\/\/ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n\/\/ HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n\/\/ STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n\/\/ OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include \"SieveOfEratosthenes.h\"\n#include \"PreSieve.h\"\n#include \"EratSmall.h\"\n#include \"EratMedium.h\"\n#include \"EratBig.h\"\n#include \"config.h\"\n#include \"imath.h\"\n\n#include <stdint.h>\n#include <stdexcept>\n#include <cstdlib>\n\nnamespace soe {\n\nconst uint32_t SieveOfEratosthenes::bitValues_[8] = { 7, 11, 13, 17, 19, 23, 29, 31 };\n\n\/** De Bruijn sequence for first set bitValues_ *\/\nconst uint32_t SieveOfEratosthenes::deBruijnFsbValues_[32] =\n{\n    7,  11, 109, 13, 113, 59, 97, 17,\n  119,  89,  79, 61, 101, 71, 19, 37,\n  121, 107,  53, 91,  83, 77, 67, 31,\n  103,  49,  73, 29,  47, 23, 43, 41\n};\n\n\/**\n * @param start          Sieve the primes within the interval [start, stop].\n * @param stop           Sieve the primes within the interval [start, stop].\n * @param preSieveLimit  Multiples of small primes <= preSieveLimit are\n *                       pre-sieved to speed up the sieve of Eratosthenes,\n *                       preSieveLimit >= 13 && <= 23.\n * @param sieveSize      A sieve size in kilobytes, sieveSize >= 1 && <= 4096.\n *\/\nSieveOfEratosthenes::SieveOfEratosthenes(uint64_t start,\n                                         uint64_t stop,\n                                         uint32_t preSieveLimit,\n                                         uint32_t sieveSize) :\n  start_(start),\n  stop_(stop),\n  sqrtStop_(static_cast<uint32_t>(isqrt(stop))),\n  preSieve_(preSieveLimit),\n  isFirstSegment_(true),\n  sieve_(NULL),\n  sieveSize_(sieveSize * 1024),\n  eratSmall_(NULL),\n  eratMedium_(NULL),\n  eratBig_(NULL)\n{\n  if (start_ < 7 || start_ > stop_)\n    throw std::logic_error(\"SieveOfEratosthenes: start must be >= 7 && <= stop.\");\n  \/\/ it makes no sense to use very small sieve sizes\n  if (sieveSize_ < 1024)\n    throw std::invalid_argument(\"SieveOfEratosthenes: sieveSize must be >= 1 kilobyte.\");\n  segmentLow_ = start_ - getByteRemainder(start_);\n  \/\/ '+ 1' is a correction for primes of type i*30 + 31\n  segmentHigh_ = segmentLow_ + sieveSize_ * NUMBERS_PER_BYTE + 1;\n  initEratAlgorithms();\n  \/\/ allocate the sieve of Eratosthenes array\n  sieve_ = new uint8_t[sieveSize_];\n}\n\nSieveOfEratosthenes::~SieveOfEratosthenes() {\n  delete eratSmall_;\n  delete eratMedium_;\n  delete eratBig_;\n  delete[] sieve_;\n}\n\n\/** returns bitValues_[ bitScanForward(v) ] *\/\nuint32_t SieveOfEratosthenes::getFirstSetBitValue(uint32_t v) {\n  return deBruijnFsbValues_[((v & -static_cast<int32_t>(v)) * 0x077CB531U) >> 27];\n}\n\nuint32_t SieveOfEratosthenes::getPreSieveLimit() const {\n  return preSieve_.getLimit();\n}\n\nuint32_t SieveOfEratosthenes::getByteRemainder(uint64_t n) const {\n  uint32_t remainder = static_cast<uint32_t>(n % NUMBERS_PER_BYTE);\n  \/\/ correction for primes of type i*30 + 31\n  if (remainder <= 1)\n    remainder += NUMBERS_PER_BYTE;\n  return remainder;\n}\n\nvoid SieveOfEratosthenes::initEratAlgorithms() {\n  try {\n    if (sqrtStop_ > preSieve_.getLimit()) {\n      eratSmall_ = new EratSmall(*this);\n      if (sqrtStop_ > eratSmall_->getLimit()) {\n        eratMedium_ = new EratMedium(*this);\n        if (sqrtStop_ > eratMedium_->getLimit())\n          eratBig_ = new EratBig(*this);\n      }\n    }\n  } catch (...) {\n    delete eratSmall_;\n    delete eratMedium_;\n    delete eratBig_;\n    throw;\n  }\n}\n\n\/**\n * Pre-sieve multiples of small primes <= preSieve_.getLimit()\n * to speed up the sieve of Eratosthenes.\n *\/\nvoid SieveOfEratosthenes::preSieve() {\n  preSieve_.doIt(sieve_, sieveSize_, segmentLow_);\n  if (isFirstSegment_) {\n    isFirstSegment_ = false;\n    \/\/ correct preSieve_.doIt() for numbers <= 23\n    if (start_ <= preSieve_.getLimit())\n      sieve_[0] = 0xff;\n    uint32_t startRemainder = getByteRemainder(start_);\n    \/\/ unset bits corresponding to numbers < start_\n    for (int i = 0; i < 8; i++)\n      if (bitValues_[i] < startRemainder)\n        sieve_[0] &= ~(1 << i);\n  }\n}\n\n\/**\n * Cross-off the multiples within the current segment i.e.\n * [segmentLow_+7, segmentHigh_].\n *\/\nvoid SieveOfEratosthenes::crossOffMultiples() {\n  if (eratSmall_ != NULL) {\n    \/\/ process the sieving primes with many multiples per segment\n    eratSmall_->sieve(sieve_, sieveSize_);\n    if (eratMedium_ != NULL) {\n      \/\/ process the sieving primes with a few multiples per segment\n      eratMedium_->sieve(sieve_, sieveSize_);\n      if (eratBig_ != NULL)\n        \/\/ process the sieving primes with very few multiples per segment\n        eratBig_->sieve(sieve_);\n    }\n  }\n}\n\n\/**\n * Implementation of the segmented sieve of Eratosthenes.\n * sieve(uint32_t) must be called consecutively for all primes up to\n * sqrt(stop) in order to sieve the primes within the interval\n * [start_, stop_].\n *\/\nvoid SieveOfEratosthenes::sieve(uint32_t prime) {\n  const uint64_t primeSquared = isquare<uint64_t>(prime);\n\n  \/\/ The following while loop segments the sieve of Eratosthenes, it\n  \/\/ is executed when all sieving primes <= sqrt(segmentHigh_)\n  \/\/ required to sieve the next segment have been stored in the erat*\n  \/\/ objects (see below). Each loop iteration sieves the primes within\n  \/\/ the interval [segmentLow_+7, segmentHigh_].\n  while (segmentHigh_ < primeSquared) {\n    preSieve();\n    crossOffMultiples();\n    analyseSieve(sieve_, sieveSize_);\n    segmentLow_ += sieveSize_ * NUMBERS_PER_BYTE;\n    segmentHigh_ += sieveSize_ * NUMBERS_PER_BYTE;\n  }\n\n  \/\/ prime is added to eratSmall_ if it has many multiples per\n  \/\/ segment, to eratMedium_ if it has a few multiples per segment\n  \/\/ and to eratBig_ if it has very few multiples per segment.\n  if (prime > eratSmall_->getLimit())\n    if (prime > eratMedium_->getLimit())\n            eratBig_->addSievingPrime(prime);\n    else eratMedium_->addSievingPrime(prime);\n  else    eratSmall_->addSievingPrime(prime);\n}\n\n\/**\n * Sieve the last segments remaining after that sieve(uint32_t)\n * has been called for all primes up to sqrt(stop_).\n *\/\nvoid SieveOfEratosthenes::finish() {\n  \/\/ sieve all segments left except the last one\n  while (segmentHigh_ < stop_) {\n    preSieve();\n    crossOffMultiples();\n    analyseSieve(sieve_, sieveSize_);\n    segmentLow_ += sieveSize_ * NUMBERS_PER_BYTE;\n    segmentHigh_ += sieveSize_ * NUMBERS_PER_BYTE;\n  }\n  uint32_t stopRemainder = getByteRemainder(stop_);\n  \/\/ calculate the sieve size of the last segment\n  sieveSize_ = static_cast<uint32_t>((stop_ - stopRemainder) - segmentLow_) \/ NUMBERS_PER_BYTE + 1;\n  \/\/ sieve the last segment\n  preSieve();\n  crossOffMultiples();\n  \/\/ unset bits corresponding to numbers > stop_\n  for (int i = 0; i < 8; i++) {\n    if (bitValues_[i] > stopRemainder)\n      sieve_[sieveSize_ - 1] &= ~(1 << i);\n  }\n  analyseSieve(sieve_, sieveSize_);\n}\n\n} \/\/ namespace soe\n<commit_msg>minor modifications<commit_after>\/\/\n\/\/ Copyright (c) 2012 Kim Walisch, <kim.walisch@gmail.com>.\n\/\/ All rights reserved.\n\/\/\n\/\/ This file is part of primesieve.\n\/\/ Homepage: http:\/\/primesieve.googlecode.com\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions\n\/\/ are met:\n\/\/\n\/\/   * Redistributions of source code must retain the above copyright\n\/\/     notice, this list of conditions and the following disclaimer.\n\/\/   * Redistributions in binary form must reproduce the above\n\/\/     copyright notice, this list of conditions and the following\n\/\/     disclaimer in the documentation and\/or other materials provided\n\/\/     with the distribution.\n\/\/   * Neither the name of the author nor the names of its\n\/\/     contributors may be used to endorse or promote products derived\n\/\/     from this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n\/\/ FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n\/\/ COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n\/\/ INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n\/\/ (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\/\/ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n\/\/ HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n\/\/ STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n\/\/ OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include \"SieveOfEratosthenes.h\"\n#include \"PreSieve.h\"\n#include \"EratSmall.h\"\n#include \"EratMedium.h\"\n#include \"EratBig.h\"\n#include \"config.h\"\n#include \"imath.h\"\n\n#include <stdint.h>\n#include <stdexcept>\n#include <cstdlib>\n\nnamespace soe {\n\nconst uint32_t SieveOfEratosthenes::bitValues_[8] = { 7, 11, 13, 17, 19, 23, 29, 31 };\n\n\/** De Bruijn sequence for first set bitValues_ *\/\nconst uint32_t SieveOfEratosthenes::deBruijnFsbValues_[32] =\n{\n    7,  11, 109, 13, 113, 59, 97, 17,\n  119,  89,  79, 61, 101, 71, 19, 37,\n  121, 107,  53, 91,  83, 77, 67, 31,\n  103,  49,  73, 29,  47, 23, 43, 41\n};\n\n\/**\n * @param start          Sieve the primes within the interval [start, stop].\n * @param stop           Sieve the primes within the interval [start, stop].\n * @param preSieveLimit  Multiples of small primes <= preSieveLimit are\n *                       pre-sieved to speed up the sieve of Eratosthenes,\n *                       preSieveLimit >= 13 && <= 23.\n * @param sieveSize      A sieve size in kilobytes, sieveSize >= 1 && <= 4096.\n *\/\nSieveOfEratosthenes::SieveOfEratosthenes(uint64_t start,\n                                         uint64_t stop,\n                                         uint32_t preSieveLimit,\n                                         uint32_t sieveSize) :\n  start_(start),\n  stop_(stop),\n  sqrtStop_(static_cast<uint32_t>(isqrt(stop))),\n  preSieve_(preSieveLimit),\n  isFirstSegment_(true),\n  sieve_(NULL),\n  sieveSize_(sieveSize * 1024),\n  eratSmall_(NULL),\n  eratMedium_(NULL),\n  eratBig_(NULL)\n{\n  if (start_ < 7 || start_ > stop_)\n    throw std::logic_error(\"SieveOfEratosthenes: start must be >= 7 && <= stop.\");\n  \/\/ it makes no sense to use very small sieve sizes\n  if (sieveSize_ < 1024)\n    throw std::invalid_argument(\"SieveOfEratosthenes: sieveSize must be >= 1 kilobyte.\");\n  segmentLow_ = start_ - getByteRemainder(start_);\n  \/\/ '+ 1' is a correction for primes of type i*30 + 31\n  segmentHigh_ = segmentLow_ + sieveSize_ * NUMBERS_PER_BYTE + 1;\n  initEratAlgorithms();\n  \/\/ allocate the sieve of Eratosthenes array\n  sieve_ = new uint8_t[sieveSize_];\n}\n\nSieveOfEratosthenes::~SieveOfEratosthenes() {\n  delete eratSmall_;\n  delete eratMedium_;\n  delete eratBig_;\n  delete[] sieve_;\n}\n\n\/** returns bitValues_[ bitScanForward(v) ] *\/\nuint32_t SieveOfEratosthenes::getFirstSetBitValue(uint32_t v) {\n  return deBruijnFsbValues_[((v & -static_cast<int32_t>(v)) * 0x077CB531U) >> 27];\n}\n\nuint32_t SieveOfEratosthenes::getPreSieveLimit() const {\n  return preSieve_.getLimit();\n}\n\nuint32_t SieveOfEratosthenes::getByteRemainder(uint64_t n) const {\n  uint32_t remainder = static_cast<uint32_t>(n % NUMBERS_PER_BYTE);\n  \/\/ correction for primes of type i*30 + 31\n  if (remainder <= 1)\n    remainder += NUMBERS_PER_BYTE;\n  return remainder;\n}\n\nvoid SieveOfEratosthenes::initEratAlgorithms() {\n  try {\n    if (sqrtStop_ > preSieve_.getLimit()) {\n      eratSmall_ = new EratSmall(*this);\n      if (sqrtStop_ > eratSmall_->getLimit()) {\n        eratMedium_ = new EratMedium(*this);\n        if (sqrtStop_ > eratMedium_->getLimit())\n          eratBig_ = new EratBig(*this);\n      }\n    }\n  } catch (...) {\n    delete eratSmall_;\n    delete eratMedium_;\n    delete eratBig_;\n    throw;\n  }\n}\n\n\/**\n * Pre-sieve multiples of small primes <= preSieve_.getLimit()\n * to speed up the sieve of Eratosthenes.\n *\/\nvoid SieveOfEratosthenes::preSieve() {\n  preSieve_.doIt(sieve_, sieveSize_, segmentLow_);\n  if (isFirstSegment_) {\n    isFirstSegment_ = false;\n    \/\/ correct preSieve_.doIt() for numbers <= 23\n    if (start_ <= preSieve_.getLimit())\n      sieve_[0] = 0xff;\n    uint32_t startRemainder = getByteRemainder(start_);\n    \/\/ unset bits corresponding to numbers < start_\n    for (int i = 0; i < 8; i++) {\n      if (bitValues_[i] < startRemainder)\n        sieve_[0] &= ~(1 << i);\n    }\n  }\n}\n\n\/**\n * Cross-off the multiples within the current segment i.e.\n * [segmentLow_+7, segmentHigh_].\n *\/\nvoid SieveOfEratosthenes::crossOffMultiples() {\n  if (eratSmall_ != NULL) {\n    \/\/ process the sieving primes with many multiples per segment\n    eratSmall_->sieve(sieve_, sieveSize_);\n    if (eratMedium_ != NULL) {\n      \/\/ process the sieving primes with a few multiples per segment\n      eratMedium_->sieve(sieve_, sieveSize_);\n      if (eratBig_ != NULL)\n        \/\/ process the sieving primes with very few multiples per segment\n        eratBig_->sieve(sieve_);\n    }\n  }\n}\n\n\/**\n * Implementation of the segmented sieve of Eratosthenes.\n * sieve(uint32_t) must be called consecutively for all primes up to\n * sqrt(stop) in order to sieve the primes within the interval\n * [start_, stop_].\n *\/\nvoid SieveOfEratosthenes::sieve(uint32_t prime) {\n  const uint64_t primeSquared = isquare<uint64_t>(prime);\n\n  \/\/ The following while loop segments the sieve of Eratosthenes, it\n  \/\/ is executed when all sieving primes <= sqrt(segmentHigh_)\n  \/\/ required to sieve the next segment have been stored in the erat*\n  \/\/ objects (see below). Each loop iteration sieves the primes within\n  \/\/ the interval [segmentLow_+7, segmentHigh_].\n  while (segmentHigh_ < primeSquared) {\n    preSieve();\n    crossOffMultiples();\n    analyseSieve(sieve_, sieveSize_);\n    segmentLow_ += sieveSize_ * NUMBERS_PER_BYTE;\n    segmentHigh_ += sieveSize_ * NUMBERS_PER_BYTE;\n  }\n\n  \/\/ prime is added to eratSmall_ if it has many multiples per\n  \/\/ segment, to eratMedium_ if it has a few multiples per segment\n  \/\/ and to eratBig_ if it has very few multiples per segment.\n  if (prime > eratSmall_->getLimit())\n    if (prime > eratMedium_->getLimit())\n            eratBig_->addSievingPrime(prime);\n    else eratMedium_->addSievingPrime(prime);\n  else    eratSmall_->addSievingPrime(prime);\n}\n\n\/**\n * Sieve the last segments remaining after that sieve(uint32_t)\n * has been called for all primes up to sqrt(stop_).\n *\/\nvoid SieveOfEratosthenes::finish() {\n  \/\/ sieve all segments left except the last one\n  while (segmentHigh_ < stop_) {\n    preSieve();\n    crossOffMultiples();\n    analyseSieve(sieve_, sieveSize_);\n    segmentLow_ += sieveSize_ * NUMBERS_PER_BYTE;\n    segmentHigh_ += sieveSize_ * NUMBERS_PER_BYTE;\n  }\n  uint32_t stopRemainder = getByteRemainder(stop_);\n  \/\/ calculate the sieve size of the last segment\n  sieveSize_ = static_cast<uint32_t>((stop_ - stopRemainder) - segmentLow_) \/ NUMBERS_PER_BYTE + 1;\n  \/\/ sieve the last segment\n  preSieve();\n  crossOffMultiples();\n  \/\/ unset bits corresponding to numbers > stop_\n  for (int i = 0; i < 8; i++) {\n    if (bitValues_[i] > stopRemainder)\n      sieve_[sieveSize_ - 1] &= ~(1 << i);\n  }\n  analyseSieve(sieve_, sieveSize_);\n}\n\n} \/\/ namespace soe\n<|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>\/\/ This file is part of the AliceVision project.\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 <aliceVision\/mesh\/meshVisibility.hpp>\n#include <aliceVision\/delaunaycut\/mv_delaunay_GC.hpp>\n#include <aliceVision\/delaunaycut\/mv_delaunay_meshSmooth.hpp>\n#include <aliceVision\/largeScale\/reconstructionPlan.hpp>\n#include <aliceVision\/planeSweeping\/ps_refine_rc.hpp>\n#include <aliceVision\/CUDAInterfaces\/refine.hpp>\n#include <aliceVision\/common\/fileIO.hpp>\n#include <aliceVision\/structures\/image.hpp>\n\n#include <boost\/program_options.hpp>\n#include <boost\/filesystem.hpp>\n\n\nnamespace bfs = boost::filesystem;\nnamespace po = boost::program_options;\n\n\nbfs::path absolutePathNoExt(const bfs::path& p)\n{\n    return p.parent_path() \/ p.stem();\n}\n\n#define ALICEVISION_COUT(x) std::cout << x << std::endl\n#define ALICEVISION_CERR(x) std::cerr << x << std::endl\n\nint main(int argc, char* argv[])\n{\n    long startTime = clock();\n\n    std::string iniFilepath;\n    std::string inputDenseReconstruction;\n    std::string inputMeshFilepath;\n    std::string outputFolder;\n    std::string outTextureFileTypeName = EImageFileType_enumToString(EImageFileType::PNG);\n    bool flipNormals = false;\n    TexturingParams texParams;\n\n    po::options_description allParams(\"AliceVision texturing\");\n\n    po::options_description requiredParams(\"Required parameters\");\n    requiredParams.add_options()\n        (\"ini\", po::value<std::string>(&iniFilepath)->required(),\n            \"Configuration file: mvs.ini (the undistorted images and camera poses should be in the same folder)).\")\n        (\"inputDenseReconstruction\", po::value<std::string>(&inputDenseReconstruction)->required(),\n            \"Path to the dense reconstruction (mesh with per vertex visibility).\")\n        (\"output,o\", po::value<std::string>(&outputFolder)->required(),\n            \"Folder for output mesh: OBJ, material and texture files.\");\n\n    po::options_description optionalParams(\"Optional parameters\");\n    optionalParams.add_options()\n        (\"outputTextureFileType\", po::value<std::string>(&outTextureFileTypeName)->default_value(outTextureFileTypeName),\n          EImageFileType_informations().c_str())\n        (\"textureSide\", po::value<unsigned int>(&texParams.textureSide)->default_value(texParams.textureSide),\n            \"Output texture size\")\n        (\"padding\", po::value<unsigned int>(&texParams.padding)->default_value(texParams.padding),\n            \"Texture edge padding size in pixel\")\n        (\"downscale\", po::value<unsigned int>(&texParams.downscale)->default_value(texParams.downscale),\n            \"Texture downscale factor\")\n        (\"inputMesh\", po::value<std::string>(&inputMeshFilepath),\n            \"Optional input mesh to texture. By default, it will texture the inputReconstructionMesh.\")\n        (\"flipNormals\", po::value<bool>(&flipNormals)->default_value(flipNormals),\n            \"Option to flip face normals. It can be needed as it depends on the vertices order in triangles and the convention change from one software to another.\");\n\n    allParams.add(requiredParams).add(optionalParams);\n\n    po::variables_map vm;\n\n    try\n    {\n      po::store(po::parse_command_line(argc, argv, allParams), vm);\n\n      if(vm.count(\"help\") || (argc == 1))\n      {\n        ALICEVISION_COUT(allParams);\n        return EXIT_SUCCESS;\n      }\n\n      po::notify(vm);\n    }\n    catch(boost::program_options::required_option& e)\n    {\n      ALICEVISION_CERR(\"ERROR: \" << e.what() << std::endl);\n      ALICEVISION_COUT(\"Usage:\\n\\n\" << allParams);\n      return EXIT_FAILURE;\n    }\n    catch(boost::program_options::error& e)\n    {\n      ALICEVISION_CERR(\"ERROR: \" << e.what() << std::endl);\n      ALICEVISION_COUT(\"Usage:\\n\\n\" << allParams);\n      return EXIT_FAILURE;\n    }\n\n    ALICEVISION_COUT(\"ini file: \" << iniFilepath);\n    ALICEVISION_COUT(\"inputMesh: \" << inputMeshFilepath);\n\n    \/\/ set output texture file type\n    const EImageFileType outputTextureFileType = EImageFileType_stringToEnum(outTextureFileTypeName);\n\n    \/\/ .ini parsing\n    multiviewInputParams mip(iniFilepath, \"\", \"\");\n    const double simThr = mip._ini.get<double>(\"global.simThr\", 0.0);\n    multiviewParams mp(mip.getNbCameras(), &mip, (float) simThr);\n    mv_prematch_cams pc(&mp);\n\n    meshRetex mesh;\n    mesh.texParams = texParams;\n    mesh.me = new mv_mesh();\n\n    if(!mesh.me->loadFromBin(inputDenseReconstruction))\n    {\n        std::cerr << \"Unable to load: \" << inputDenseReconstruction << std::endl;\n        return EXIT_FAILURE;\n    }\n\n    bfs::path reconstructionMeshFolder = bfs::path(inputDenseReconstruction).parent_path();\n\n    mesh::PointsVisibility* ptsCams = loadArrayOfArraysFromFile<int>((reconstructionMeshFolder\/\"meshPtsCamsFromDGC.bin\").string());\n    if(ptsCams->size() != mesh.me->pts->size())\n        throw std::runtime_error(\"Error: Reference mesh and associated visibilities don't have the same size.\");\n    \/\/ filterPtsCamsByMinimalPixelSize(refMesh, refPtsCams, &mp);\n    bfs::create_directory(outputFolder);\n\n    \/\/std::cout << \"Points with no visibilities \" << std::count(ptsCams->begin(), ptsCams->end(), nullptr) << std::endl;\n\n    \/\/ texturing from input mesh\n    if(!inputMeshFilepath.empty())\n    {\n        ALICEVISION_COUT(\"An external input mesh is provided, so we remap the visibility from the reconstruction on it.\");\n        \/\/ remap visibilities from reconstruction onto input mesh\n        meshRetex otherMesh;\n        mesh::PointsVisibility otherPtsVisibilities;\n        otherMesh.me = new mv_mesh();\n        otherMesh.loadFromOBJ(inputMeshFilepath, flipNormals);\n        mesh::remapMeshVisibilities(*mesh.me, *ptsCams, *otherMesh.me, otherPtsVisibilities);\n\n        std::swap(mesh.me, otherMesh.me);\n        ptsCams->swap(otherPtsVisibilities);\n    }\n    if(!mesh.hasUVs())\n    {\n        ALICEVISION_COUT(\"The input mesh has no UV, so we generate them.\");\n        \/\/ generate UV coordinates based on automatic uv atlas\n        auto* updatedPtsCams = mesh.generateUVs(mp, ptsCams);\n        std::swap(ptsCams, updatedPtsCams);\n        deleteArrayOfArrays<int>(&updatedPtsCams);\n        mesh.saveAsOBJ(outputFolder, \"texturedMesh\", outputTextureFileType);\n    }\n\n    \/\/ generate textures\n    ALICEVISION_COUT(\"Generate textures.\");\n    mesh.generateTextures(mp, ptsCams, outputFolder, outputTextureFileType);\n\n    printfElapsedTime(startTime, \"#\");\n    return EXIT_SUCCESS;\n}\n<commit_msg>[texturing] fix retexturing on input mesh with UVs<commit_after>\/\/ This file is part of the AliceVision project.\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 <aliceVision\/mesh\/meshVisibility.hpp>\n#include <aliceVision\/delaunaycut\/mv_delaunay_GC.hpp>\n#include <aliceVision\/delaunaycut\/mv_delaunay_meshSmooth.hpp>\n#include <aliceVision\/largeScale\/reconstructionPlan.hpp>\n#include <aliceVision\/planeSweeping\/ps_refine_rc.hpp>\n#include <aliceVision\/CUDAInterfaces\/refine.hpp>\n#include <aliceVision\/common\/fileIO.hpp>\n#include <aliceVision\/structures\/image.hpp>\n\n#include <boost\/program_options.hpp>\n#include <boost\/filesystem.hpp>\n\n\nnamespace bfs = boost::filesystem;\nnamespace po = boost::program_options;\n\n\nbfs::path absolutePathNoExt(const bfs::path& p)\n{\n    return p.parent_path() \/ p.stem();\n}\n\n#define ALICEVISION_COUT(x) std::cout << x << std::endl\n#define ALICEVISION_CERR(x) std::cerr << x << std::endl\n\nint main(int argc, char* argv[])\n{\n    long startTime = clock();\n\n    std::string iniFilepath;\n    std::string inputDenseReconstruction;\n    std::string inputMeshFilepath;\n    std::string outputFolder;\n    std::string outTextureFileTypeName = EImageFileType_enumToString(EImageFileType::PNG);\n    bool flipNormals = false;\n    TexturingParams texParams;\n\n    po::options_description allParams(\"AliceVision texturing\");\n\n    po::options_description requiredParams(\"Required parameters\");\n    requiredParams.add_options()\n        (\"ini\", po::value<std::string>(&iniFilepath)->required(),\n            \"Configuration file: mvs.ini (the undistorted images and camera poses should be in the same folder)).\")\n        (\"inputDenseReconstruction\", po::value<std::string>(&inputDenseReconstruction)->required(),\n            \"Path to the dense reconstruction (mesh with per vertex visibility).\")\n        (\"output,o\", po::value<std::string>(&outputFolder)->required(),\n            \"Folder for output mesh: OBJ, material and texture files.\");\n\n    po::options_description optionalParams(\"Optional parameters\");\n    optionalParams.add_options()\n        (\"outputTextureFileType\", po::value<std::string>(&outTextureFileTypeName)->default_value(outTextureFileTypeName),\n          EImageFileType_informations().c_str())\n        (\"textureSide\", po::value<unsigned int>(&texParams.textureSide)->default_value(texParams.textureSide),\n            \"Output texture size\")\n        (\"padding\", po::value<unsigned int>(&texParams.padding)->default_value(texParams.padding),\n            \"Texture edge padding size in pixel\")\n        (\"downscale\", po::value<unsigned int>(&texParams.downscale)->default_value(texParams.downscale),\n            \"Texture downscale factor\")\n        (\"inputMesh\", po::value<std::string>(&inputMeshFilepath),\n            \"Optional input mesh to texture. By default, it will texture the inputReconstructionMesh.\")\n        (\"flipNormals\", po::value<bool>(&flipNormals)->default_value(flipNormals),\n            \"Option to flip face normals. It can be needed as it depends on the vertices order in triangles and the convention change from one software to another.\");\n\n    allParams.add(requiredParams).add(optionalParams);\n\n    po::variables_map vm;\n\n    try\n    {\n      po::store(po::parse_command_line(argc, argv, allParams), vm);\n\n      if(vm.count(\"help\") || (argc == 1))\n      {\n        ALICEVISION_COUT(allParams);\n        return EXIT_SUCCESS;\n      }\n\n      po::notify(vm);\n    }\n    catch(boost::program_options::required_option& e)\n    {\n      ALICEVISION_CERR(\"ERROR: \" << e.what() << std::endl);\n      ALICEVISION_COUT(\"Usage:\\n\\n\" << allParams);\n      return EXIT_FAILURE;\n    }\n    catch(boost::program_options::error& e)\n    {\n      ALICEVISION_CERR(\"ERROR: \" << e.what() << std::endl);\n      ALICEVISION_COUT(\"Usage:\\n\\n\" << allParams);\n      return EXIT_FAILURE;\n    }\n\n    ALICEVISION_COUT(\"ini file: \" << iniFilepath);\n    ALICEVISION_COUT(\"inputMesh: \" << inputMeshFilepath);\n\n    \/\/ set output texture file type\n    const EImageFileType outputTextureFileType = EImageFileType_stringToEnum(outTextureFileTypeName);\n\n    \/\/ .ini parsing\n    multiviewInputParams mip(iniFilepath, \"\", \"\");\n    const double simThr = mip._ini.get<double>(\"global.simThr\", 0.0);\n    multiviewParams mp(mip.getNbCameras(), &mip, (float) simThr);\n    mv_prematch_cams pc(&mp);\n\n    meshRetex mesh;\n    mesh.texParams = texParams;\n    mesh.me = new mv_mesh();\n\n    if(!mesh.me->loadFromBin(inputDenseReconstruction))\n    {\n        std::cerr << \"Unable to load: \" << inputDenseReconstruction << std::endl;\n        return EXIT_FAILURE;\n    }\n\n    bfs::path reconstructionMeshFolder = bfs::path(inputDenseReconstruction).parent_path();\n\n    mesh::PointsVisibility* ptsCams = loadArrayOfArraysFromFile<int>((reconstructionMeshFolder\/\"meshPtsCamsFromDGC.bin\").string());\n    if(ptsCams->size() != mesh.me->pts->size())\n        throw std::runtime_error(\"Error: Reference mesh and associated visibilities don't have the same size.\");\n    \/\/ filterPtsCamsByMinimalPixelSize(refMesh, refPtsCams, &mp);\n    bfs::create_directory(outputFolder);\n\n    \/\/std::cout << \"Points with no visibilities \" << std::count(ptsCams->begin(), ptsCams->end(), nullptr) << std::endl;\n\n    \/\/ texturing from input mesh\n    if(!inputMeshFilepath.empty())\n    {\n        ALICEVISION_COUT(\"An external input mesh is provided, so we remap the visibility from the reconstruction on it.\");\n        \/\/ keep previous mesh as reference\n        mv_mesh* refMesh = mesh.me;\n        \/\/ load input obj file\n        mesh.me = new mv_mesh();\n        mesh.loadFromOBJ(inputMeshFilepath, flipNormals);\n        \/\/ remap visibilities from reconstruction onto input mesh\n        mesh::PointsVisibility otherPtsVisibilities;\n        mesh::remapMeshVisibilities(*refMesh, *ptsCams, *mesh.me, otherPtsVisibilities);\n\n        delete refMesh;\n        ptsCams->swap(otherPtsVisibilities);\n    }\n    if(!mesh.hasUVs())\n    {\n        ALICEVISION_COUT(\"The input mesh has no UV, so we generate them.\");\n        \/\/ generate UV coordinates based on automatic uv atlas\n        auto* updatedPtsCams = mesh.generateUVs(mp, ptsCams);\n        std::swap(ptsCams, updatedPtsCams);\n        deleteArrayOfArrays<int>(&updatedPtsCams);\n        mesh.saveAsOBJ(outputFolder, \"texturedMesh\", outputTextureFileType);\n    }\n\n    \/\/ generate textures\n    ALICEVISION_COUT(\"Generate textures.\");\n    mesh.generateTextures(mp, ptsCams, outputFolder, outputTextureFileType);\n\n    printfElapsedTime(startTime, \"#\");\n    return EXIT_SUCCESS;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"chainerx\/routines\/linalg.h\"\n\n#include <algorithm>\n#include <cassert>\n#include <cstdint>\n#include <tuple>\n#include <utility>\n#include <vector>\n\n#include <absl\/types\/optional.h>\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\/arithmetic.h\"\n#include \"chainerx\/routines\/creation.h\"\n#include \"chainerx\/routines\/indexing.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, absl::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 linear algebra routines only support 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                auto updim = [&](const Array& x) {\n                    if (x.ndim() == a.ndim()) {\n                        return x;\n                    }\n                    return ExpandDims(x, 1);\n                };\n                bctx.input_grad() = -Dot(updim(Solve(a.Transpose(), gout)), updim(out).Transpose(), 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\nstd::tuple<Array, Array, Array> Svd(const Array& a, bool full_matrices, bool compute_uv) {\n    CheckRankTwoArray(a);\n\n    Array u{};\n    Array s{};\n    Array vt{};\n\n    Shape u_shape;\n    Shape vt_shape;\n    int64_t m = a.shape()[0];\n    int64_t n = a.shape()[1];\n    int64_t mn = std::min(m, n);\n\n    if (compute_uv) {\n        if (full_matrices) {\n            u_shape = Shape{m, m};\n            vt_shape = Shape{n, n};\n        } else {\n            u_shape = Shape{m, mn};\n            vt_shape = Shape{mn, n};\n        }\n    } else {\n        u_shape = Shape{0};\n        vt_shape = Shape{0};\n    }\n\n    u = Empty(u_shape, a.dtype(), a.device());\n    vt = Empty(vt_shape, a.dtype(), a.device());\n    s = Empty(Shape{mn}, a.dtype(), a.device());\n\n    {\n        NoBackpropModeScope scope{};\n        a.device().backend().CallKernel<SvdKernel>(a, u, s, vt, full_matrices);\n    }\n\n    \/\/ Reference:\n    \/\/ https:\/\/j-towns.github.io\/papers\/svd-derivative.pdf\n    {\n        BackwardBuilder bb{\"svd\", a, {u, s, vt}};\n        if (BackwardBuilder::Target bt = bb.CreateTarget(0)) {\n            bt.Define([a_tok = bb.RetainInput(0),\n                       u_tok = bb.RetainOutput(0),\n                       s_tok = bb.RetainOutput(1),\n                       vt_tok = bb.RetainOutput(2),\n                       full_matrices,\n                       compute_uv](BackwardContext& bctx) {\n                if (full_matrices) {\n                    throw ChainerxError{\"ChainerX SVD differentiation is not implemented for full_matrices mode.\"};\n                }\n                if (!compute_uv) {\n                    throw ChainerxError{\"ChainerX SVD differentiation cannot be computed without u, vt matrices.\"};\n                }\n\n                const Array& a = bctx.GetRetainedInput(a_tok);\n                const Array& u = bctx.GetRetainedOutput(u_tok);\n                const Array& s = bctx.GetRetainedOutput(s_tok);\n                const Array& vt = bctx.GetRetainedOutput(vt_tok);\n\n                auto m = a.shape()[0];\n                auto n = a.shape()[1];\n                auto k = s.shape()[0];\n\n                const Array& gu = bctx.output_grad(0).has_value() ? *bctx.output_grad(0) : Zeros(u.shape(), a.dtype(), a.device());\n                const Array& gsigma = bctx.output_grad(1).has_value() ? *bctx.output_grad(1) : Zeros(s.shape(), a.dtype(), a.device());\n                const Array& gvt = bctx.output_grad(2).has_value() ? *bctx.output_grad(2) : Zeros(vt.shape(), a.dtype(), a.device());\n\n                Array v = vt.Transpose();\n                Array gv = gvt.Transpose();\n\n                Array sigma_term = Dot(Dot(u, Diag(gsigma)), vt);\n\n                Array ut = u.Transpose();\n                Array im = Eye(m, m, 0, a.dtype(), a.device());\n                Array in = Eye(n, n, 0, a.dtype(), a.device());\n                Array sigma_mat = Diag(s);\n                Array sigma_mat_inv = Diag(Reciprocal(s));\n                Array sigma_sq = Power(s, 2);\n                Array F = ExpandDims(sigma_sq, 0) - ExpandDims(sigma_sq, 1);\n                \/\/ Invert values of F, and fill the diagonal with 0s.\n                \/\/ F has 0s on the diagonal, therefore fill it first with infinity.\n                Array mask = Eye(F.shape()[0], F.shape()[1], 0, Dtype::kBool, a.device());\n                F = Where(mask, INFINITY, F);\n                F = Reciprocal(F);\n\n                Array u_term{};\n                Array utgu = Dot(u.Transpose(), gu);\n                u_term = Dot(Dot(u, F * (utgu - utgu.Transpose())), sigma_mat);\n                if (m > k) {\n                    u_term = u_term + Dot(Dot(im - Dot(u, ut), gu), sigma_mat_inv);\n                }\n                u_term = Dot(u_term, vt);\n\n                Array v_term{};\n                Array vtgv = Dot(vt, gv);\n                v_term = Dot(Dot(sigma_mat, F * (vtgv - vtgv.Transpose())), vt);\n                if (n > k) {\n                    v_term = v_term + Dot(sigma_mat_inv, Dot(gvt, in - Dot(v, vt)));\n                }\n                v_term = Dot(u, v_term);\n\n                bctx.input_grad() = u_term + sigma_term + v_term;\n            });\n        }\n        bb.Finalize();\n    }\n\n    return std::make_tuple(std::move(u), std::move(s), std::move(vt));\n}\n\nArray PseudoInverse(const Array& a, float rcond) {\n    CheckRankTwoArray(a);\n    Dtype dtype = internal::GetMathResultDtype(a.dtype());\n    Array out = Empty(Shape({a.shape()[1], a.shape()[0]}), dtype, a.device());\n\n    {\n        NoBackpropModeScope scope{};\n\n        Array u{};\n        Array s{};\n        Array vt{};\n\n        std::tie(u, s, vt) = Svd(a, \/*full_matrices=*\/false, \/*compute_uv=*\/true);\n\n        Array cutoff = rcond * s.Max();\n        Array cutoff_indices = s <= cutoff;\n\n        Array sinv = Reciprocal(s);\n        sinv = Where(cutoff_indices, 0, sinv);\n\n        std::vector<ArrayIndex> indices{Slice{}, NewAxis{}};\n\n        a.device().backend().CallKernel<DotKernel>(vt.Transpose(), sinv.At(indices) * u.Transpose(), out);\n    }\n\n    \/\/ Reference:\n    \/\/ https:\/\/mathoverflow.net\/questions\/25778\/analytical-formula-for-numerical-derivative-of-the-matrix-pseudo-inverse\n    {\n        BackwardBuilder bb{\"pinv\", a, out};\n        if (BackwardBuilder::Target bt = bb.CreateTarget(0)) {\n            bt.Define([a_tok = bb.RetainInput(0), out_tok = bb.RetainOutput(0), a_dtype = a.dtype(), &a_device = a.device()](\n                              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                Array I_a = Identity(a.shape()[0], a_dtype, a_device);\n                Array I_out = Identity(out.shape()[0], a_dtype, a_device);\n                bctx.input_grad() = (-Dot(Dot(out, gout.Transpose()), out) + Dot(Dot(Dot(out, out.Transpose()), gout), I_a - Dot(a, out)) +\n                                     Dot(Dot(Dot(I_out - Dot(out, a), gout), out.Transpose()), out))\n                                            .Transpose();\n            });\n        }\n        bb.Finalize();\n    }\n\n    return out;\n}\n\n}  \/\/ namespace chainerx\n<commit_msg>Renamed F -> f<commit_after>#include \"chainerx\/routines\/linalg.h\"\n\n#include <algorithm>\n#include <cassert>\n#include <cstdint>\n#include <tuple>\n#include <utility>\n#include <vector>\n\n#include <absl\/types\/optional.h>\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\/arithmetic.h\"\n#include \"chainerx\/routines\/creation.h\"\n#include \"chainerx\/routines\/indexing.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, absl::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 linear algebra routines only support 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                auto updim = [&](const Array& x) {\n                    if (x.ndim() == a.ndim()) {\n                        return x;\n                    }\n                    return ExpandDims(x, 1);\n                };\n                bctx.input_grad() = -Dot(updim(Solve(a.Transpose(), gout)), updim(out).Transpose(), 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\nstd::tuple<Array, Array, Array> Svd(const Array& a, bool full_matrices, bool compute_uv) {\n    CheckRankTwoArray(a);\n\n    Array u{};\n    Array s{};\n    Array vt{};\n\n    Shape u_shape;\n    Shape vt_shape;\n    int64_t m = a.shape()[0];\n    int64_t n = a.shape()[1];\n    int64_t mn = std::min(m, n);\n\n    if (compute_uv) {\n        if (full_matrices) {\n            u_shape = Shape{m, m};\n            vt_shape = Shape{n, n};\n        } else {\n            u_shape = Shape{m, mn};\n            vt_shape = Shape{mn, n};\n        }\n    } else {\n        u_shape = Shape{0};\n        vt_shape = Shape{0};\n    }\n\n    u = Empty(u_shape, a.dtype(), a.device());\n    vt = Empty(vt_shape, a.dtype(), a.device());\n    s = Empty(Shape{mn}, a.dtype(), a.device());\n\n    {\n        NoBackpropModeScope scope{};\n        a.device().backend().CallKernel<SvdKernel>(a, u, s, vt, full_matrices);\n    }\n\n    \/\/ Reference:\n    \/\/ https:\/\/j-towns.github.io\/papers\/svd-derivative.pdf\n    {\n        BackwardBuilder bb{\"svd\", a, {u, s, vt}};\n        if (BackwardBuilder::Target bt = bb.CreateTarget(0)) {\n            bt.Define([a_tok = bb.RetainInput(0),\n                       u_tok = bb.RetainOutput(0),\n                       s_tok = bb.RetainOutput(1),\n                       vt_tok = bb.RetainOutput(2),\n                       full_matrices,\n                       compute_uv](BackwardContext& bctx) {\n                if (full_matrices) {\n                    throw ChainerxError{\"ChainerX SVD differentiation is not implemented for full_matrices mode.\"};\n                }\n                if (!compute_uv) {\n                    throw ChainerxError{\"ChainerX SVD differentiation cannot be computed without u, vt matrices.\"};\n                }\n\n                const Array& a = bctx.GetRetainedInput(a_tok);\n                const Array& u = bctx.GetRetainedOutput(u_tok);\n                const Array& s = bctx.GetRetainedOutput(s_tok);\n                const Array& vt = bctx.GetRetainedOutput(vt_tok);\n\n                auto m = a.shape()[0];\n                auto n = a.shape()[1];\n                auto k = s.shape()[0];\n\n                const Array& gu = bctx.output_grad(0).has_value() ? *bctx.output_grad(0) : Zeros(u.shape(), a.dtype(), a.device());\n                const Array& gsigma = bctx.output_grad(1).has_value() ? *bctx.output_grad(1) : Zeros(s.shape(), a.dtype(), a.device());\n                const Array& gvt = bctx.output_grad(2).has_value() ? *bctx.output_grad(2) : Zeros(vt.shape(), a.dtype(), a.device());\n\n                Array v = vt.Transpose();\n                Array gv = gvt.Transpose();\n\n                Array sigma_term = Dot(Dot(u, Diag(gsigma)), vt);\n\n                Array ut = u.Transpose();\n                Array im = Eye(m, m, 0, a.dtype(), a.device());\n                Array in = Eye(n, n, 0, a.dtype(), a.device());\n                Array sigma_mat = Diag(s);\n                Array sigma_mat_inv = Diag(Reciprocal(s));\n                Array sigma_sq = Power(s, 2);\n                Array f = ExpandDims(sigma_sq, 0) - ExpandDims(sigma_sq, 1);\n                \/\/ Invert values of f, and fill the diagonal with 0s.\n                \/\/ f has 0s on the diagonal, therefore fill it first with infinity.\n                Array mask = Eye(f.shape()[0], f.shape()[1], 0, Dtype::kBool, a.device());\n                f = Where(mask, INFINITY, f);\n                f = Reciprocal(f);\n\n                Array u_term{};\n                Array utgu = Dot(u.Transpose(), gu);\n                u_term = Dot(Dot(u, f * (utgu - utgu.Transpose())), sigma_mat);\n                if (m > k) {\n                    u_term = u_term + Dot(Dot(im - Dot(u, ut), gu), sigma_mat_inv);\n                }\n                u_term = Dot(u_term, vt);\n\n                Array v_term{};\n                Array vtgv = Dot(vt, gv);\n                v_term = Dot(Dot(sigma_mat, f * (vtgv - vtgv.Transpose())), vt);\n                if (n > k) {\n                    v_term = v_term + Dot(sigma_mat_inv, Dot(gvt, in - Dot(v, vt)));\n                }\n                v_term = Dot(u, v_term);\n\n                bctx.input_grad() = u_term + sigma_term + v_term;\n            });\n        }\n        bb.Finalize();\n    }\n\n    return std::make_tuple(std::move(u), std::move(s), std::move(vt));\n}\n\nArray PseudoInverse(const Array& a, float rcond) {\n    CheckRankTwoArray(a);\n    Dtype dtype = internal::GetMathResultDtype(a.dtype());\n    Array out = Empty(Shape({a.shape()[1], a.shape()[0]}), dtype, a.device());\n\n    {\n        NoBackpropModeScope scope{};\n\n        Array u{};\n        Array s{};\n        Array vt{};\n\n        std::tie(u, s, vt) = Svd(a, \/*full_matrices=*\/false, \/*compute_uv=*\/true);\n\n        Array cutoff = rcond * s.Max();\n        Array cutoff_indices = s <= cutoff;\n\n        Array sinv = Reciprocal(s);\n        sinv = Where(cutoff_indices, 0, sinv);\n\n        std::vector<ArrayIndex> indices{Slice{}, NewAxis{}};\n\n        a.device().backend().CallKernel<DotKernel>(vt.Transpose(), sinv.At(indices) * u.Transpose(), out);\n    }\n\n    \/\/ Reference:\n    \/\/ https:\/\/mathoverflow.net\/questions\/25778\/analytical-formula-for-numerical-derivative-of-the-matrix-pseudo-inverse\n    {\n        BackwardBuilder bb{\"pinv\", a, out};\n        if (BackwardBuilder::Target bt = bb.CreateTarget(0)) {\n            bt.Define([a_tok = bb.RetainInput(0), out_tok = bb.RetainOutput(0), a_dtype = a.dtype(), &a_device = a.device()](\n                              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                Array I_a = Identity(a.shape()[0], a_dtype, a_device);\n                Array I_out = Identity(out.shape()[0], a_dtype, a_device);\n                bctx.input_grad() = (-Dot(Dot(out, gout.Transpose()), out) + Dot(Dot(Dot(out, out.Transpose()), gout), I_a - Dot(a, out)) +\n                                     Dot(Dot(Dot(I_out - Dot(out, a), gout), out.Transpose()), out))\n                                            .Transpose();\n            });\n        }\n        bb.Finalize();\n    }\n\n    return out;\n}\n\n}  \/\/ namespace chainerx\n<|endoftext|>"}
{"text":"<commit_before>#include <cassert>\n\n#include \"WorldData.h\"\n\n#include \"..\/Assets\/INFFile.h\"\n#include \"..\/Assets\/MIFFile.h\"\n#include \"..\/Media\/TextureManager.h\"\n#include \"..\/Rendering\/Renderer.h\"\n#include \"..\/Utilities\/Bytes.h\"\n\nWorldData::TextTrigger::TextTrigger(const std::string &text, bool displayedOnce)\n\t: text(text)\n{\n\tthis->displayedOnce = displayedOnce;\n\tthis->previouslyDisplayed = false;\n}\n\nWorldData::TextTrigger::~TextTrigger()\n{\n\n}\n\nconst std::string &WorldData::TextTrigger::getText() const\n{\n\treturn this->text;\n}\n\nbool WorldData::TextTrigger::isSingleDisplay() const\n{\n\treturn this->displayedOnce;\n}\n\nbool WorldData::TextTrigger::hasBeenDisplayed() const\n{\n\treturn this->previouslyDisplayed;\n}\n\nvoid WorldData::TextTrigger::setPreviouslyDisplayed(bool previouslyDisplayed)\n{\n\tthis->previouslyDisplayed = previouslyDisplayed;\n}\n\nWorldData::WorldData(const MIFFile &mif, const INFFile &inf, int levelIndex)\n\t: voxelGrid(mif.getWidth(), mif.getHeight(levelIndex), mif.getDepth())\n{\n\t\/\/ Arena's level origins start at the top-right corner of the map, so X increases \n\t\/\/ going to the left, and Z increases going down. The wilderness uses this same \n\t\/\/ pattern. Each chunk looks like this:\n\t\/\/ +++++++ <- Origin (0, 0)\n\t\/\/ +++++++\n\t\/\/ +++++++\n\t\/\/ +++++++\n\t\/\/ ^\n\t\/\/ |\n\t\/\/ Max (mapWidth - 1, mapDepth - 1)\n\n\t\/\/ Empty voxel data (for air).\n\tconst int emptyID = voxelGrid.addVoxelData(VoxelData(0));\n\n\t\/\/ Lambda for setting a voxel at some coordinate to some ID.\n\tauto setVoxel = [this](int x, int y, int z, int id)\n\t{\n\t\tchar *voxels = this->voxelGrid.getVoxels();\n\t\tvoxels[x + (y * this->voxelGrid.getWidth()) +\n\t\t\t(z * this->voxelGrid.getWidth() * this->voxelGrid.getHeight())] = id;\n\t};\n\n\t\/\/ Load requested level from .MIF file.\n\tconst MIFFile::Level &level = mif.getLevels().at(levelIndex);\n\tconst uint8_t *florData = level.flor.data();\n\tconst uint8_t *map1Data = level.map1.data();\n\n\t\/\/ Indices for voxel data, stepping two bytes at a time.\n\tint floorIndex = 0;\n\tint map1Index = 0;\n\n\tauto getNextFloorVoxel = [florData, &floorIndex]()\n\t{\n\t\tconst uint16_t voxel = Bytes::getLE16(florData + floorIndex);\n\t\tfloorIndex += 2;\n\t\treturn voxel;\n\t};\n\n\tauto getNextMap1Voxel = [map1Data, &map1Index]()\n\t{\n\t\tconst uint16_t voxel = Bytes::getLE16(map1Data + map1Index);\n\t\tmap1Index += 2;\n\t\treturn voxel;\n\t};\n\n\t\/\/ Mappings of floor and wall IDs to voxel data indices.\n\tstd::unordered_map<uint16_t, int> floorDataMappings, wallDataMappings;\n\n\t\/\/ Write the .MIF file's voxel IDs into the voxel grid.\n\tfor (int x = (mif.getWidth() - 1); x >= 0; x--)\n\t{\n\t\tfor (int z = (mif.getDepth() - 1); z >= 0; z--)\n\t\t{\n\t\t\tconst int index = x + (z * mif.getWidth());\n\t\t\tconst uint16_t florVoxel = getNextFloorVoxel();\n\t\t\tconst uint16_t map1Voxel = getNextMap1Voxel();\n\n\t\t\t\/\/ The floor voxel has a texture if it's not a chasm.\n\t\t\tconst int floorTextureID = (florVoxel & 0xFF00) >> 8;\n\t\t\tif ((floorTextureID != MIFFile::DRY_CHASM) &&\n\t\t\t\t(floorTextureID != MIFFile::WET_CHASM) &&\n\t\t\t\t(floorTextureID != MIFFile::LAVA_CHASM))\n\t\t\t{\n\t\t\t\t\/\/ Get the voxel data index associated with the floor value, or add it\n\t\t\t\t\/\/ if it doesn't exist yet.\n\t\t\t\tconst int dataIndex = [this, &floorDataMappings, florVoxel, floorTextureID]()\n\t\t\t\t{\n\t\t\t\t\tconst auto floorIter = floorDataMappings.find(florVoxel);\n\t\t\t\t\tif (floorIter != floorDataMappings.end())\n\t\t\t\t\t{\n\t\t\t\t\t\treturn floorIter->second;\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\/\/ To do: Also assign some \"seawall\" texture for interiors and exteriors.\n\t\t\t\t\t\t\/\/ Retrieve it beforehand from the *...CHASM members and assign here?\n\t\t\t\t\t\t\/\/ Not sure how that works.\n\t\t\t\t\t\tconst int index = this->voxelGrid.addVoxelData(VoxelData(floorTextureID + 1));\n\t\t\t\t\t\treturn floorDataMappings.insert(\n\t\t\t\t\t\t\tstd::make_pair(florVoxel, index)).first->second;\n\t\t\t\t\t}\n\t\t\t\t}();\n\n\t\t\t\tsetVoxel(x, 0, z, dataIndex);\n\t\t\t}\n\n\t\t\tif ((map1Voxel & 0x8000) == 0)\n\t\t\t{\n\t\t\t\t\/\/ A voxel of some kind.\n\t\t\t\tconst bool voxelIsEmpty = map1Voxel == 0;\n\n\t\t\t\tif (!voxelIsEmpty)\n\t\t\t\t{\n\t\t\t\t\tconst uint8_t mostSigByte = (map1Voxel & 0x7F00) >> 8;\n\t\t\t\t\tconst uint8_t leastSigByte = map1Voxel & 0x007F;\n\t\t\t\t\tconst bool voxelIsSolid = mostSigByte == leastSigByte;\n\n\t\t\t\t\tif (voxelIsSolid)\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ Regular 1x1x1 wall.\n\t\t\t\t\t\tconst int wallTextureID = mostSigByte;\n\n\t\t\t\t\t\t\/\/ Get the voxel data index associated with the wall value, or add it\n\t\t\t\t\t\t\/\/ if it doesn't exist yet.\n\t\t\t\t\t\tconst int dataIndex = [this, &inf, &wallDataMappings,\n\t\t\t\t\t\t\tmap1Voxel, wallTextureID]()\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tconst auto wallIter = wallDataMappings.find(map1Voxel);\n\t\t\t\t\t\t\tif (wallIter != wallDataMappings.end())\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\treturn wallIter->second;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tconst double ceilingHeight = \n\t\t\t\t\t\t\t\t\tstatic_cast<double>(inf.getCeiling().height) \/ \n\t\t\t\t\t\t\t\t\tMIFFile::ARENA_UNITS;\n\n\t\t\t\t\t\t\t\tconst int index = this->voxelGrid.addVoxelData(VoxelData(\n\t\t\t\t\t\t\t\t\twallTextureID, \n\t\t\t\t\t\t\t\t\twallTextureID,\n\t\t\t\t\t\t\t\t\twallTextureID,\n\t\t\t\t\t\t\t\t\t0.0, ceilingHeight, 0.0, 1.0));\n\t\t\t\t\t\t\t\treturn wallDataMappings.insert(\n\t\t\t\t\t\t\t\t\tstd::make_pair(map1Voxel, index)).first->second;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}();\n\n\t\t\t\t\t\tsetVoxel(x, 1, z, dataIndex);\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\/\/ Raised platform. The height appears to be some fraction of 64,\n\t\t\t\t\t\t\/\/ and when it's greater than 64, then that determines the offset?\n\t\t\t\t\t\tconst uint8_t capTextureID = (map1Voxel & 0x00F0) >> 4; \/\/ To do: get BOXCAP Y texture.\n\t\t\t\t\t\tconst uint8_t wallTextureID = map1Voxel & 0x000F; \/\/ To do: get BOXSIDE Z texture.\n\t\t\t\t\t\tconst double platformHeight = static_cast<double>(mostSigByte) \/ \n\t\t\t\t\t\t\tstatic_cast<double>(MIFFile::ARENA_UNITS);\n\n\t\t\t\t\t\t\/\/ Get the voxel data index associated with the wall value, or add it\n\t\t\t\t\t\t\/\/ if it doesn't exist yet.\n\t\t\t\t\t\tconst int dataIndex = [this, &inf, &wallDataMappings, map1Voxel,\n\t\t\t\t\t\t\tcapTextureID, wallTextureID, platformHeight]()\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tconst auto wallIter = wallDataMappings.find(map1Voxel);\n\t\t\t\t\t\t\tif (wallIter != wallDataMappings.end())\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\treturn wallIter->second;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\/\/ To do: Clamp top V coordinate positive until the correct platform \n\t\t\t\t\t\t\t\t\/\/ height calculation is figured out. Maybe the platform height\n\t\t\t\t\t\t\t\t\/\/ needs to be multiplied by the ratio between the current ceiling\n\t\t\t\t\t\t\t\t\/\/ height and the default ceiling height (128)? I.e., multiply by\n\t\t\t\t\t\t\t\t\/\/ the \"ceilingHeight\" local variable used a couple dozen lines up?\n\t\t\t\t\t\t\t\tconst double topV = std::max(0.0, 1.0 - platformHeight);\n\t\t\t\t\t\t\t\tconst double bottomV = 1.0; \/\/ To do: should also be a function.\n\n\t\t\t\t\t\t\t\tconst int index = this->voxelGrid.addVoxelData(VoxelData(\n\t\t\t\t\t\t\t\t\t(*inf.getBoxSide(wallTextureID)) + 1, \n\t\t\t\t\t\t\t\t\tinf.getCeiling().textureIndex + 1,\n\t\t\t\t\t\t\t\t\t(*inf.getBoxCap(capTextureID)) + 1,\n\t\t\t\t\t\t\t\t\t0.0, platformHeight, topV, bottomV));\n\t\t\t\t\t\t\t\treturn wallDataMappings.insert(\n\t\t\t\t\t\t\t\t\tstd::make_pair(map1Voxel, index)).first->second;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}();\n\n\t\t\t\t\t\tsetVoxel(x, 1, z, dataIndex);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t\/\/ An object of some kind.\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ Fill the second floor with the ceiling tiles if it's an interior, or MAP2 if it exists.\n\tconst INFFile::CeilingData &ceiling = inf.getCeiling();\n\n\t\/\/ To do: Replace this. Figure out how to determine if some place is an interior.\n\tconst bool isInterior = !ceiling.outdoorDungeon;\n\n\tif (isInterior)\n\t{\n\t\t\/\/ Get the index of the ceiling texture name in the textures array.\n\t\tconst int ceilingIndex = [&inf, &ceiling]()\n\t\t{\n\t\t\tif (ceiling.textureIndex != INFFile::NO_INDEX)\n\t\t\t{\n\t\t\t\treturn ceiling.textureIndex;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t\/\/ To do: get ceiling from .INFs without *CEILING (like START.INF). Maybe\n\t\t\t\t\/\/ hardcoding index 1 is enough?\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t}();\n\n\t\t\/\/ Define the ceiling voxel data as being right above the top of the main floor.\n\t\tconst int index = this->voxelGrid.addVoxelData(VoxelData(\n\t\t\t0,\n\t\t\tceilingIndex + 1,\n\t\t\t0,\n\t\t\t(static_cast<double>(ceiling.height) \/ MIFFile::ARENA_UNITS) - 1.0,\n\t\t\t1.0,\n\t\t\t0.0,\n\t\t\t1.0));\n\n\t\t\/\/ Set all the ceiling voxels.\n\t\tfor (int x = 0; x < mif.getWidth(); x++)\n\t\t{\n\t\t\tfor (int z = 0; z < mif.getDepth(); z++)\n\t\t\t{\n\t\t\t\tsetVoxel(x, 2, z, index);\n\t\t\t}\n\t\t}\n\t}\n\telse if (level.map2.size() > 0)\n\t{\n\t\t\/\/ To do: Write second story voxels, and extend them higher if necessary.\n\t}\n\n\t\/\/ Assign text and sound triggers.\n\tfor (const auto &trigger : level.trig)\n\t{\n\t\t\/\/ Transform the voxel coordinates from the Arena layout to the new layout.\n\t\t\/\/ - For some reason, the grid dimensions have a minus one here, whereas\n\t\t\/\/   the dimensions for player starting points do not.\n\t\tconst Int2 voxel = VoxelGrid::arenaVoxelToNewVoxel(\n\t\t\tInt2(trigger.x, trigger.y), mif.getWidth() - 1, mif.getDepth() - 1);\n\n\t\t\/\/ There can be a text trigger and sound trigger in the same voxel.\n\t\tconst bool isTextTrigger = trigger.textIndex != -1;\n\t\tconst bool isSoundTrigger = trigger.soundIndex != -1;\n\n\t\t\/\/ Make sure the text index points to a text value (i.e., not a key or riddle).\n\t\tif (isTextTrigger && inf.hasTextIndex(trigger.textIndex))\n\t\t{\n\t\t\tconst INFFile::TextData &textData = inf.getText(trigger.textIndex);\n\t\t\tthis->textTriggers.insert(std::make_pair(\n\t\t\t\tvoxel, TextTrigger(textData.text, textData.displayedOnce)));\n\t\t}\n\n\t\tif (isSoundTrigger)\n\t\t{\n\t\t\tthis->soundTriggers.insert(std::make_pair(voxel, inf.getSound(trigger.soundIndex)));\n\t\t}\n\t}\n}\n\nWorldData::WorldData(VoxelGrid &&voxelGrid, EntityManager &&entityManager)\n\t: voxelGrid(std::move(voxelGrid)), entityManager(std::move(entityManager)) { }\n\nWorldData::~WorldData()\n{\n\n}\n\nVoxelGrid &WorldData::getVoxelGrid()\n{\n\treturn this->voxelGrid;\n}\n\nconst VoxelGrid &WorldData::getVoxelGrid() const\n{\n\treturn this->voxelGrid;\n}\n\nEntityManager &WorldData::getEntityManager()\n{\n\treturn this->entityManager;\n}\n\nconst EntityManager &WorldData::getEntityManager() const\n{\n\treturn this->entityManager;\n}\n\nWorldData::TextTrigger *WorldData::getTextTrigger(const Int2 &voxel)\n{\n\tconst auto textIter = this->textTriggers.find(voxel);\n\treturn (textIter != this->textTriggers.end()) ? (&textIter->second) : nullptr;\n}\n\nconst std::string *WorldData::getSoundTrigger(const Int2 &voxel) const\n{\n\tconst auto soundIter = this->soundTriggers.find(voxel);\n\treturn (soundIter != this->soundTriggers.end()) ? (&soundIter->second) : nullptr;\n}\n<commit_msg>Added diagonal walls from .MIF files.<commit_after>#include <cassert>\n\n#include \"WorldData.h\"\n\n#include \"..\/Assets\/INFFile.h\"\n#include \"..\/Assets\/MIFFile.h\"\n#include \"..\/Media\/TextureManager.h\"\n#include \"..\/Rendering\/Renderer.h\"\n#include \"..\/Utilities\/Bytes.h\"\n\nWorldData::TextTrigger::TextTrigger(const std::string &text, bool displayedOnce)\n\t: text(text)\n{\n\tthis->displayedOnce = displayedOnce;\n\tthis->previouslyDisplayed = false;\n}\n\nWorldData::TextTrigger::~TextTrigger()\n{\n\n}\n\nconst std::string &WorldData::TextTrigger::getText() const\n{\n\treturn this->text;\n}\n\nbool WorldData::TextTrigger::isSingleDisplay() const\n{\n\treturn this->displayedOnce;\n}\n\nbool WorldData::TextTrigger::hasBeenDisplayed() const\n{\n\treturn this->previouslyDisplayed;\n}\n\nvoid WorldData::TextTrigger::setPreviouslyDisplayed(bool previouslyDisplayed)\n{\n\tthis->previouslyDisplayed = previouslyDisplayed;\n}\n\nWorldData::WorldData(const MIFFile &mif, const INFFile &inf, int levelIndex)\n\t: voxelGrid(mif.getWidth(), mif.getHeight(levelIndex), mif.getDepth())\n{\n\t\/\/ Arena's level origins start at the top-right corner of the map, so X increases \n\t\/\/ going to the left, and Z increases going down. The wilderness uses this same \n\t\/\/ pattern. Each chunk looks like this:\n\t\/\/ +++++++ <- Origin (0, 0)\n\t\/\/ +++++++\n\t\/\/ +++++++\n\t\/\/ +++++++\n\t\/\/ ^\n\t\/\/ |\n\t\/\/ Max (mapWidth - 1, mapDepth - 1)\n\n\t\/\/ Empty voxel data (for air).\n\tconst int emptyID = voxelGrid.addVoxelData(VoxelData(0));\n\n\t\/\/ Lambda for setting a voxel at some coordinate to some ID.\n\tauto setVoxel = [this](int x, int y, int z, int id)\n\t{\n\t\tchar *voxels = this->voxelGrid.getVoxels();\n\t\tvoxels[x + (y * this->voxelGrid.getWidth()) +\n\t\t\t(z * this->voxelGrid.getWidth() * this->voxelGrid.getHeight())] = id;\n\t};\n\n\t\/\/ Load requested level from .MIF file.\n\tconst MIFFile::Level &level = mif.getLevels().at(levelIndex);\n\tconst uint8_t *florData = level.flor.data();\n\tconst uint8_t *map1Data = level.map1.data();\n\n\t\/\/ Indices for voxel data, stepping two bytes at a time.\n\tint floorIndex = 0;\n\tint map1Index = 0;\n\n\tauto getNextFloorVoxel = [florData, &floorIndex]()\n\t{\n\t\tconst uint16_t voxel = Bytes::getLE16(florData + floorIndex);\n\t\tfloorIndex += 2;\n\t\treturn voxel;\n\t};\n\n\tauto getNextMap1Voxel = [map1Data, &map1Index]()\n\t{\n\t\tconst uint16_t voxel = Bytes::getLE16(map1Data + map1Index);\n\t\tmap1Index += 2;\n\t\treturn voxel;\n\t};\n\n\t\/\/ Mappings of floor and wall IDs to voxel data indices.\n\tstd::unordered_map<uint16_t, int> floorDataMappings, wallDataMappings;\n\n\t\/\/ Write the .MIF file's voxel IDs into the voxel grid.\n\tfor (int x = (mif.getWidth() - 1); x >= 0; x--)\n\t{\n\t\tfor (int z = (mif.getDepth() - 1); z >= 0; z--)\n\t\t{\n\t\t\tconst int index = x + (z * mif.getWidth());\n\t\t\tconst uint16_t florVoxel = getNextFloorVoxel();\n\t\t\tconst uint16_t map1Voxel = getNextMap1Voxel();\n\n\t\t\t\/\/ The floor voxel has a texture if it's not a chasm.\n\t\t\tconst int floorTextureID = (florVoxel & 0xFF00) >> 8;\n\t\t\tif ((floorTextureID != MIFFile::DRY_CHASM) &&\n\t\t\t\t(floorTextureID != MIFFile::WET_CHASM) &&\n\t\t\t\t(floorTextureID != MIFFile::LAVA_CHASM))\n\t\t\t{\n\t\t\t\t\/\/ Get the voxel data index associated with the floor value, or add it\n\t\t\t\t\/\/ if it doesn't exist yet.\n\t\t\t\tconst int dataIndex = [this, &floorDataMappings, florVoxel, floorTextureID]()\n\t\t\t\t{\n\t\t\t\t\tconst auto floorIter = floorDataMappings.find(florVoxel);\n\t\t\t\t\tif (floorIter != floorDataMappings.end())\n\t\t\t\t\t{\n\t\t\t\t\t\treturn floorIter->second;\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\/\/ To do: Also assign some \"seawall\" texture for interiors and exteriors.\n\t\t\t\t\t\t\/\/ Retrieve it beforehand from the *...CHASM members and assign here?\n\t\t\t\t\t\t\/\/ Not sure how that works.\n\t\t\t\t\t\tconst int index = this->voxelGrid.addVoxelData(VoxelData(floorTextureID + 1));\n\t\t\t\t\t\treturn floorDataMappings.insert(\n\t\t\t\t\t\t\tstd::make_pair(florVoxel, index)).first->second;\n\t\t\t\t\t}\n\t\t\t\t}();\n\n\t\t\t\tsetVoxel(x, 0, z, dataIndex);\n\t\t\t}\n\n\t\t\tif ((map1Voxel & 0x8000) == 0)\n\t\t\t{\n\t\t\t\t\/\/ A voxel of some kind.\n\t\t\t\tconst bool voxelIsEmpty = map1Voxel == 0;\n\n\t\t\t\tif (!voxelIsEmpty)\n\t\t\t\t{\n\t\t\t\t\tconst uint8_t mostSigByte = (map1Voxel & 0x7F00) >> 8;\n\t\t\t\t\tconst uint8_t leastSigByte = map1Voxel & 0x007F;\n\t\t\t\t\tconst bool voxelIsSolid = mostSigByte == leastSigByte;\n\n\t\t\t\t\tif (voxelIsSolid)\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ Regular 1x1x1 wall.\n\t\t\t\t\t\tconst int wallTextureID = mostSigByte;\n\n\t\t\t\t\t\t\/\/ Get the voxel data index associated with the wall value, or add it\n\t\t\t\t\t\t\/\/ if it doesn't exist yet.\n\t\t\t\t\t\tconst int dataIndex = [this, &inf, &wallDataMappings,\n\t\t\t\t\t\t\tmap1Voxel, wallTextureID]()\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tconst auto wallIter = wallDataMappings.find(map1Voxel);\n\t\t\t\t\t\t\tif (wallIter != wallDataMappings.end())\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\treturn wallIter->second;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tconst double ceilingHeight =\n\t\t\t\t\t\t\t\t\tstatic_cast<double>(inf.getCeiling().height) \/\n\t\t\t\t\t\t\t\t\tMIFFile::ARENA_UNITS;\n\n\t\t\t\t\t\t\t\tconst int index = this->voxelGrid.addVoxelData(VoxelData(\n\t\t\t\t\t\t\t\t\twallTextureID,\n\t\t\t\t\t\t\t\t\twallTextureID,\n\t\t\t\t\t\t\t\t\twallTextureID,\n\t\t\t\t\t\t\t\t\t0.0, ceilingHeight, 0.0, 1.0));\n\t\t\t\t\t\t\t\treturn wallDataMappings.insert(\n\t\t\t\t\t\t\t\t\tstd::make_pair(map1Voxel, index)).first->second;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}();\n\n\t\t\t\t\t\tsetVoxel(x, 1, z, dataIndex);\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\/\/ Raised platform. The height appears to be some fraction of 64,\n\t\t\t\t\t\t\/\/ and when it's greater than 64, then that determines the offset?\n\t\t\t\t\t\tconst uint8_t capTextureID = (map1Voxel & 0x00F0) >> 4; \/\/ To do: get BOXCAP Y texture.\n\t\t\t\t\t\tconst uint8_t wallTextureID = map1Voxel & 0x000F; \/\/ To do: get BOXSIDE Z texture.\n\t\t\t\t\t\tconst double platformHeight = static_cast<double>(mostSigByte) \/\n\t\t\t\t\t\t\tstatic_cast<double>(MIFFile::ARENA_UNITS);\n\n\t\t\t\t\t\t\/\/ Get the voxel data index associated with the wall value, or add it\n\t\t\t\t\t\t\/\/ if it doesn't exist yet.\n\t\t\t\t\t\tconst int dataIndex = [this, &inf, &wallDataMappings, map1Voxel,\n\t\t\t\t\t\t\tcapTextureID, wallTextureID, platformHeight]()\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tconst auto wallIter = wallDataMappings.find(map1Voxel);\n\t\t\t\t\t\t\tif (wallIter != wallDataMappings.end())\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\treturn wallIter->second;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\/\/ To do: Clamp top V coordinate positive until the correct platform \n\t\t\t\t\t\t\t\t\/\/ height calculation is figured out. Maybe the platform height\n\t\t\t\t\t\t\t\t\/\/ needs to be multiplied by the ratio between the current ceiling\n\t\t\t\t\t\t\t\t\/\/ height and the default ceiling height (128)? I.e., multiply by\n\t\t\t\t\t\t\t\t\/\/ the \"ceilingHeight\" local variable used a couple dozen lines up?\n\t\t\t\t\t\t\t\tconst double topV = std::max(0.0, 1.0 - platformHeight);\n\t\t\t\t\t\t\t\tconst double bottomV = 1.0; \/\/ To do: should also be a function.\n\n\t\t\t\t\t\t\t\tconst int index = this->voxelGrid.addVoxelData(VoxelData(\n\t\t\t\t\t\t\t\t\t(*inf.getBoxSide(wallTextureID)) + 1,\n\t\t\t\t\t\t\t\t\tinf.getCeiling().textureIndex + 1,\n\t\t\t\t\t\t\t\t\t(*inf.getBoxCap(capTextureID)) + 1,\n\t\t\t\t\t\t\t\t\t0.0, platformHeight, topV, bottomV));\n\t\t\t\t\t\t\t\treturn wallDataMappings.insert(\n\t\t\t\t\t\t\t\t\tstd::make_pair(map1Voxel, index)).first->second;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}();\n\n\t\t\t\t\t\tsetVoxel(x, 1, z, dataIndex);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t\/\/ A special voxel, or an object of some kind.\n\t\t\t\tconst uint8_t mostSigNibble = (map1Voxel & 0xF000) >> 12;\n\n\t\t\t\tif (mostSigNibble == 0x8)\n\t\t\t\t{\n\t\t\t\t\t\/\/ The lower byte determines the index of a FLAT for an object.\n\t\t\t\t\tconst uint8_t flatIndex = map1Voxel & 0x00FF;\n\t\t\t\t\t\/\/ To do.\n\t\t\t\t}\n\t\t\t\telse if (mostSigNibble == 0x9)\n\t\t\t\t{\n\t\t\t\t\t\/\/ Transparent block with 1-sided texture on all sides.\n\t\t\t\t\t\/\/ To do.\n\t\t\t\t}\n\t\t\t\telse if (mostSigNibble == 0xA)\n\t\t\t\t{\n\t\t\t\t\t\/\/ Transparent block with 2-sided texture on one side.\n\t\t\t\t\t\/\/ To do.\n\t\t\t\t}\n\t\t\t\telse if (mostSigNibble == 0xB)\n\t\t\t\t{\n\t\t\t\t\t\/\/ Door with texture == (6 lowest bits) - 1.\n\t\t\t\t\tconst int doorTextureIndex = (map1Voxel & 0x003F) - 1;\n\t\t\t\t\t\/\/ To do.\n\t\t\t\t}\n\t\t\t\telse if (mostSigNibble == 0xC)\n\t\t\t\t{\n\t\t\t\t\t\/\/ Unknown (perhaps \"curtains\" for beds?).\n\t\t\t\t\t\/\/ To do.\n\t\t\t\t}\n\t\t\t\telse if (mostSigNibble == 0xD)\n\t\t\t\t{\n\t\t\t\t\t\/\/ Diagonal wall -- direction depends on the nineth bit.\n\t\t\t\t\tconst int dataIndex = [this, &inf, &wallDataMappings, map1Voxel]()\n\t\t\t\t\t{\n\t\t\t\t\t\tconst auto wallIter = wallDataMappings.find(map1Voxel);\n\t\t\t\t\t\tif (wallIter != wallDataMappings.end())\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\treturn wallIter->second;\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\tconst bool isRightDiag = (map1Voxel & 0x0100) == 0;\n\t\t\t\t\t\t\tconst int diagTextureIndex = map1Voxel & 0x00FF;\n\t\t\t\t\t\t\tconst double ceilingHeight =\n\t\t\t\t\t\t\t\tstatic_cast<double>(inf.getCeiling().height) \/ \n\t\t\t\t\t\t\t\tMIFFile::ARENA_UNITS;\n\n\t\t\t\t\t\t\tconst int index = this->voxelGrid.addVoxelData(VoxelData(\n\t\t\t\t\t\t\t\tisRightDiag ? diagTextureIndex : 0,\n\t\t\t\t\t\t\t\t!isRightDiag ? diagTextureIndex : 0,\n\t\t\t\t\t\t\t\t0.0, ceilingHeight, 0.0, 1.0));\n\t\t\t\t\t\t\treturn wallDataMappings.insert(\n\t\t\t\t\t\t\t\tstd::make_pair(map1Voxel, index)).first->second;\n\t\t\t\t\t\t}\n\t\t\t\t\t}();\n\n\t\t\t\t\tsetVoxel(x, 1, z, dataIndex);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ Fill the second floor with the ceiling tiles if it's an interior, or MAP2 if it exists.\n\tconst INFFile::CeilingData &ceiling = inf.getCeiling();\n\n\t\/\/ To do: Replace this. Figure out how to determine if some place is an interior.\n\tconst bool isInterior = !ceiling.outdoorDungeon;\n\n\tif (isInterior)\n\t{\n\t\t\/\/ Get the index of the ceiling texture name in the textures array.\n\t\tconst int ceilingIndex = [&inf, &ceiling]()\n\t\t{\n\t\t\tif (ceiling.textureIndex != INFFile::NO_INDEX)\n\t\t\t{\n\t\t\t\treturn ceiling.textureIndex;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t\/\/ To do: get ceiling from .INFs without *CEILING (like START.INF). Maybe\n\t\t\t\t\/\/ hardcoding index 1 is enough?\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t}();\n\n\t\t\/\/ Define the ceiling voxel data as being right above the top of the main floor.\n\t\tconst int index = this->voxelGrid.addVoxelData(VoxelData(\n\t\t\t0,\n\t\t\tceilingIndex + 1,\n\t\t\t0,\n\t\t\t(static_cast<double>(ceiling.height) \/ MIFFile::ARENA_UNITS) - 1.0,\n\t\t\t1.0,\n\t\t\t0.0,\n\t\t\t1.0));\n\n\t\t\/\/ Set all the ceiling voxels.\n\t\tfor (int x = 0; x < mif.getWidth(); x++)\n\t\t{\n\t\t\tfor (int z = 0; z < mif.getDepth(); z++)\n\t\t\t{\n\t\t\t\tsetVoxel(x, 2, z, index);\n\t\t\t}\n\t\t}\n\t}\n\telse if (level.map2.size() > 0)\n\t{\n\t\t\/\/ To do: Write second story voxels, and extend them higher if necessary.\n\t}\n\n\t\/\/ Assign text and sound triggers.\n\tfor (const auto &trigger : level.trig)\n\t{\n\t\t\/\/ Transform the voxel coordinates from the Arena layout to the new layout.\n\t\t\/\/ - For some reason, the grid dimensions have a minus one here, whereas\n\t\t\/\/   the dimensions for player starting points do not.\n\t\tconst Int2 voxel = VoxelGrid::arenaVoxelToNewVoxel(\n\t\t\tInt2(trigger.x, trigger.y), mif.getWidth() - 1, mif.getDepth() - 1);\n\n\t\t\/\/ There can be a text trigger and sound trigger in the same voxel.\n\t\tconst bool isTextTrigger = trigger.textIndex != -1;\n\t\tconst bool isSoundTrigger = trigger.soundIndex != -1;\n\n\t\t\/\/ Make sure the text index points to a text value (i.e., not a key or riddle).\n\t\tif (isTextTrigger && inf.hasTextIndex(trigger.textIndex))\n\t\t{\n\t\t\tconst INFFile::TextData &textData = inf.getText(trigger.textIndex);\n\t\t\tthis->textTriggers.insert(std::make_pair(\n\t\t\t\tvoxel, TextTrigger(textData.text, textData.displayedOnce)));\n\t\t}\n\n\t\tif (isSoundTrigger)\n\t\t{\n\t\t\tthis->soundTriggers.insert(std::make_pair(voxel, inf.getSound(trigger.soundIndex)));\n\t\t}\n\t}\n}\n\nWorldData::WorldData(VoxelGrid &&voxelGrid, EntityManager &&entityManager)\n\t: voxelGrid(std::move(voxelGrid)), entityManager(std::move(entityManager)) { }\n\nWorldData::~WorldData()\n{\n\n}\n\nVoxelGrid &WorldData::getVoxelGrid()\n{\n\treturn this->voxelGrid;\n}\n\nconst VoxelGrid &WorldData::getVoxelGrid() const\n{\n\treturn this->voxelGrid;\n}\n\nEntityManager &WorldData::getEntityManager()\n{\n\treturn this->entityManager;\n}\n\nconst EntityManager &WorldData::getEntityManager() const\n{\n\treturn this->entityManager;\n}\n\nWorldData::TextTrigger *WorldData::getTextTrigger(const Int2 &voxel)\n{\n\tconst auto textIter = this->textTriggers.find(voxel);\n\treturn (textIter != this->textTriggers.end()) ? (&textIter->second) : nullptr;\n}\n\nconst std::string *WorldData::getSoundTrigger(const Int2 &voxel) const\n{\n\tconst auto soundIter = this->soundTriggers.find(voxel);\n\treturn (soundIter != this->soundTriggers.end()) ? (&soundIter->second) : nullptr;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef _CHART2__HXX\n#define _CHART2__HXX\n\n#ifndef _COM_SUN_STAR_DRAWING_POLYPOLYGONSHAPE3D_HPP_\n#include <com\/sun\/star\/drawing\/PolyPolygonShape3D.hpp>\n#endif\n\n\/\/.............................................................................\nnamespace chart\n{\n\/\/.............................................................................\n\n\/\/-----------------------------------------------------------------------------\n\/**\n*\/\n\nclass SplineCalculater\n{\npublic:\n    static void CalculateCubicSplines(\n            const ::com::sun::star::drawing::PolyPolygonShape3D& rPoints\n            , ::com::sun::star::drawing::PolyPolygonShape3D& rResult\n            , sal_Int32 nGranularity );\n\n    static void CalculateBSplines(\n            const ::com::sun::star::drawing::PolyPolygonShape3D& rPoints\n            , ::com::sun::star::drawing::PolyPolygonShape3D& rResult\n            , sal_Int32 nGranularity\n            , sal_Int32 nSplineDepth );\n};\n\n\n\/\/.............................................................................\n} \/\/namespace chart\n\/\/.............................................................................\n#endif\n<commit_msg>corrected include saver<commit_after>#ifndef _CHART2_SPLINECALCULATOR_HXX\n#define _CHART2_SPLINECALCULATOR_HXX\n\n#ifndef _COM_SUN_STAR_DRAWING_POLYPOLYGONSHAPE3D_HPP_\n#include <com\/sun\/star\/drawing\/PolyPolygonShape3D.hpp>\n#endif\n\n\/\/.............................................................................\nnamespace chart\n{\n\/\/.............................................................................\n\n\/\/-----------------------------------------------------------------------------\n\/**\n*\/\n\nclass SplineCalculater\n{\npublic:\n    static void CalculateCubicSplines(\n            const ::com::sun::star::drawing::PolyPolygonShape3D& rPoints\n            , ::com::sun::star::drawing::PolyPolygonShape3D& rResult\n            , sal_Int32 nGranularity );\n\n    static void CalculateBSplines(\n            const ::com::sun::star::drawing::PolyPolygonShape3D& rPoints\n            , ::com::sun::star::drawing::PolyPolygonShape3D& rResult\n            , sal_Int32 nGranularity\n            , sal_Int32 nSplineDepth );\n};\n\n\n\/\/.............................................................................\n} \/\/namespace chart\n\/\/.............................................................................\n#endif\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>no need to make it a multiple of 3<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: PlotterBase.cxx,v $\n *\n *  $Revision: 1.13 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 01:49:23 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; 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 \"PlotterBase.hxx\"\n#include \"PlottingPositionHelper.hxx\"\n#include \"ShapeFactory.hxx\"\n\n#ifndef INCLUDED_RTL_MATH_HXX\n#include <rtl\/math.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_CHART2_DATAPOINTLABEL_HPP_\n#include <com\/sun\/star\/chart2\/DataPointLabel.hpp>\n#endif\n\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n\n\/\/.............................................................................\nnamespace chart\n{\n\/\/.............................................................................\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::chart2;\n\n\/\/-----------------------------------------------------------------------------\n\/\/-----------------------------------------------------------------------------\n\/\/-----------------------------------------------------------------------------\n\nPlotterBase::PlotterBase( sal_Int32 nDimensionCount )\n        : m_xLogicTarget(NULL)\n        , m_xFinalTarget(NULL)\n        , m_xShapeFactory(NULL)\n        , m_pShapeFactory(NULL)\n        , m_nDimension(nDimensionCount)\n        , m_pPosHelper(NULL)\n{\n}\n\n    void SAL_CALL PlotterBase\n::init(  const uno::Reference< drawing::XShapes >& xLogicTarget\n       , const uno::Reference< drawing::XShapes >& xFinalTarget\n       , const uno::Reference< lang::XMultiServiceFactory >& xShapeFactory )\n            throw (uno::RuntimeException)\n{\n    DBG_ASSERT(xLogicTarget.is()&&xFinalTarget.is()&&xShapeFactory.is(),\"no proper initialization parameters\");\n    \/\/is only allowed to be called once\n    m_xLogicTarget  = xLogicTarget;\n    m_xFinalTarget  = xFinalTarget;\n    m_xShapeFactory = xShapeFactory;\n    m_pShapeFactory = new ShapeFactory(xShapeFactory);\n}\n\nPlotterBase::~PlotterBase()\n{\n    delete m_pShapeFactory;\n}\n\nvoid SAL_CALL PlotterBase::setScales( const uno::Sequence< ExplicitScaleData >& rScales )\n                            throw (uno::RuntimeException)\n{\n    DBG_ASSERT(m_nDimension<=rScales.getLength(),\"Dimension of Plotter does not fit two dimension of given scale sequence\");\n    m_pPosHelper->setScales( rScales );\n}\n\n\nvoid PlotterBase::setTransformationSceneToScreen( const drawing::HomogenMatrix& rMatrix)\n{\n    DBG_ASSERT(m_nDimension==2,\"Set this transformation only in case of 2D\");\n    if(m_nDimension!=2)\n        return;\n    m_pPosHelper->setTransformationSceneToScreen( rMatrix );\n}\n\nuno::Reference< drawing::XShapes > PlotterBase::createGroupShape(\n            const uno::Reference< drawing::XShapes >& xTarget\n            , ::rtl::OUString rName )\n{\n    if(!m_xShapeFactory.is())\n        return NULL;\n\n    if(m_nDimension==2)\n    {\n        \/\/create and add to target\n        return m_pShapeFactory->createGroup2D( xTarget, rName );\n    }\n    else\n    {\n        \/\/create and added to target\n        return m_pShapeFactory->createGroup3D( xTarget, rName );\n    }\n}\n\n\/*\n\/\/-----------------------------------------------------------------\n\/\/ chart2::XPlotter\n\/\/-----------------------------------------------------------------\n\n    ::rtl::OUString SAL_CALL PlotterBase\n::getCoordinateSystemTypeID()\n    throw (uno::RuntimeException)\n{\n    return CHART2_COOSYSTEM_CARTESIAN_SERVICE_NAME;\n}\n\n    void SAL_CALL PlotterBase\n::setScales( const uno::Sequence< ExplicitScaleData >& rScales ) throw (uno::RuntimeException)\n{\n}\n    void SAL_CALL PlotterBase\n::setTransformation( const uno::Reference< XTransformation >& xTransformationToLogicTarget, const uno::Reference< XTransformation >& xTransformationToFinalPage ) throw (uno::RuntimeException)\n{\n}\n*\/\n\n\/\/e.g. for Rectangle\n\/*\nuno::Reference< drawing::XShape > PlotterBase::createPartialPointShape(\n                                    CooPoint + series dependent properties ...(create a special struct for each chart type)\n                                    , uno::Reference< XThinCoordinateSystem > xCoo\n                                    , sal_Bool bIsInBreak\n                                    , PointStyle* pStyle )\n{\n    \/\/create one here; use scaling and transformation to logic target\n\n    \/\/maybe do not show anything in the break \/\/maybe read the behavior out of the configuration\n    \/\/if(bIsInBreak)\n    \/\/  return NULL;\n\n    uno::Reference< drawing::XShape > xNewPartialPointShape(\n        m_xShapeFactory->createInstance(\n        rtl::OUString::createFromAscii( \"com.sun.star.drawing.RectangleShape\" ) )\n        , uno::UNO_QUERY );\n    \/\/set size and position\n    {\n        \/\/\n    }\n    if(pStyle||bIsInBreak)\n    {\n        \/\/set style properties if any for a single point\n        uno::Reference< beans::XPropertySet > xProp( xNewPartialPointShape, uno::UNO_QUERY );\n        xProp->setPropertyValue( ... );\n\n        \/\/set special properties if point in break (e.g. additional transparency ...)\n    }\n}\n\n\/\/e.g. for PlotterBase in 2 dim cartesian coordinates:\nsal_Bool ShapeFactory::isShown( const Sequence< ExplicitScaleData >& rScales, const CooPoint& rP, double dLogicalWidthBeforeScaling )\n{\n    ASSERT(rScales.getLength()==2)\n    double dMin_x = rScales[0].Minimum;\n    double dMax_x = rScales[0].Maximum;\n    double dMin_y = rScales[1].Minimum;\n    double dMax_y = rScales[1].Maximum;\n\n    \/\/we know that we have cartesian geometry\n    Rectangle aSysRect( rScales[0].Minimum, rScales[1].Maximum, rScales[0].Maximum, rScales[1].Minimum );\n    Rectangle aPointRect( dLogicalWidthBeforeScaling )\n    if(rP)\n}\n\n\/\/-----------------------------------------------------------------------------\n\nclass FatCoordinateSystem\n{\npublic:\n    \/\/XCoordinateSystemType getType();\n    Sequence<XThinCoordinateSystem> getCoordinateSystems();\n}\n\nclass ThinCoordinateSystem\n{\nprivate:\n\npublic:\n    sal_Bool        isBreak();\n    Sequence< ExplicitScaleData > getScales();\/\/SubScales without beak\n\n\n}\n*\/\n\/\/.............................................................................\n} \/\/namespace chart\n\/\/.............................................................................\n<commit_msg>INTEGRATION: CWS pchfix02 (1.13.80); FILE MERGED 2006\/09\/01 17:19:01 kaib 1.13.80.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: PlotterBase.cxx,v $\n *\n *  $Revision: 1.14 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 13:37:10 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_chart2.hxx\"\n#include \"PlotterBase.hxx\"\n#include \"PlottingPositionHelper.hxx\"\n#include \"ShapeFactory.hxx\"\n\n#ifndef INCLUDED_RTL_MATH_HXX\n#include <rtl\/math.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_CHART2_DATAPOINTLABEL_HPP_\n#include <com\/sun\/star\/chart2\/DataPointLabel.hpp>\n#endif\n\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n\n\/\/.............................................................................\nnamespace chart\n{\n\/\/.............................................................................\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::chart2;\n\n\/\/-----------------------------------------------------------------------------\n\/\/-----------------------------------------------------------------------------\n\/\/-----------------------------------------------------------------------------\n\nPlotterBase::PlotterBase( sal_Int32 nDimensionCount )\n        : m_xLogicTarget(NULL)\n        , m_xFinalTarget(NULL)\n        , m_xShapeFactory(NULL)\n        , m_pShapeFactory(NULL)\n        , m_nDimension(nDimensionCount)\n        , m_pPosHelper(NULL)\n{\n}\n\n    void SAL_CALL PlotterBase\n::init(  const uno::Reference< drawing::XShapes >& xLogicTarget\n       , const uno::Reference< drawing::XShapes >& xFinalTarget\n       , const uno::Reference< lang::XMultiServiceFactory >& xShapeFactory )\n            throw (uno::RuntimeException)\n{\n    DBG_ASSERT(xLogicTarget.is()&&xFinalTarget.is()&&xShapeFactory.is(),\"no proper initialization parameters\");\n    \/\/is only allowed to be called once\n    m_xLogicTarget  = xLogicTarget;\n    m_xFinalTarget  = xFinalTarget;\n    m_xShapeFactory = xShapeFactory;\n    m_pShapeFactory = new ShapeFactory(xShapeFactory);\n}\n\nPlotterBase::~PlotterBase()\n{\n    delete m_pShapeFactory;\n}\n\nvoid SAL_CALL PlotterBase::setScales( const uno::Sequence< ExplicitScaleData >& rScales )\n                            throw (uno::RuntimeException)\n{\n    DBG_ASSERT(m_nDimension<=rScales.getLength(),\"Dimension of Plotter does not fit two dimension of given scale sequence\");\n    m_pPosHelper->setScales( rScales );\n}\n\n\nvoid PlotterBase::setTransformationSceneToScreen( const drawing::HomogenMatrix& rMatrix)\n{\n    DBG_ASSERT(m_nDimension==2,\"Set this transformation only in case of 2D\");\n    if(m_nDimension!=2)\n        return;\n    m_pPosHelper->setTransformationSceneToScreen( rMatrix );\n}\n\nuno::Reference< drawing::XShapes > PlotterBase::createGroupShape(\n            const uno::Reference< drawing::XShapes >& xTarget\n            , ::rtl::OUString rName )\n{\n    if(!m_xShapeFactory.is())\n        return NULL;\n\n    if(m_nDimension==2)\n    {\n        \/\/create and add to target\n        return m_pShapeFactory->createGroup2D( xTarget, rName );\n    }\n    else\n    {\n        \/\/create and added to target\n        return m_pShapeFactory->createGroup3D( xTarget, rName );\n    }\n}\n\n\/*\n\/\/-----------------------------------------------------------------\n\/\/ chart2::XPlotter\n\/\/-----------------------------------------------------------------\n\n    ::rtl::OUString SAL_CALL PlotterBase\n::getCoordinateSystemTypeID()\n    throw (uno::RuntimeException)\n{\n    return CHART2_COOSYSTEM_CARTESIAN_SERVICE_NAME;\n}\n\n    void SAL_CALL PlotterBase\n::setScales( const uno::Sequence< ExplicitScaleData >& rScales ) throw (uno::RuntimeException)\n{\n}\n    void SAL_CALL PlotterBase\n::setTransformation( const uno::Reference< XTransformation >& xTransformationToLogicTarget, const uno::Reference< XTransformation >& xTransformationToFinalPage ) throw (uno::RuntimeException)\n{\n}\n*\/\n\n\/\/e.g. for Rectangle\n\/*\nuno::Reference< drawing::XShape > PlotterBase::createPartialPointShape(\n                                    CooPoint + series dependent properties ...(create a special struct for each chart type)\n                                    , uno::Reference< XThinCoordinateSystem > xCoo\n                                    , sal_Bool bIsInBreak\n                                    , PointStyle* pStyle )\n{\n    \/\/create one here; use scaling and transformation to logic target\n\n    \/\/maybe do not show anything in the break \/\/maybe read the behavior out of the configuration\n    \/\/if(bIsInBreak)\n    \/\/  return NULL;\n\n    uno::Reference< drawing::XShape > xNewPartialPointShape(\n        m_xShapeFactory->createInstance(\n        rtl::OUString::createFromAscii( \"com.sun.star.drawing.RectangleShape\" ) )\n        , uno::UNO_QUERY );\n    \/\/set size and position\n    {\n        \/\/\n    }\n    if(pStyle||bIsInBreak)\n    {\n        \/\/set style properties if any for a single point\n        uno::Reference< beans::XPropertySet > xProp( xNewPartialPointShape, uno::UNO_QUERY );\n        xProp->setPropertyValue( ... );\n\n        \/\/set special properties if point in break (e.g. additional transparency ...)\n    }\n}\n\n\/\/e.g. for PlotterBase in 2 dim cartesian coordinates:\nsal_Bool ShapeFactory::isShown( const Sequence< ExplicitScaleData >& rScales, const CooPoint& rP, double dLogicalWidthBeforeScaling )\n{\n    ASSERT(rScales.getLength()==2)\n    double dMin_x = rScales[0].Minimum;\n    double dMax_x = rScales[0].Maximum;\n    double dMin_y = rScales[1].Minimum;\n    double dMax_y = rScales[1].Maximum;\n\n    \/\/we know that we have cartesian geometry\n    Rectangle aSysRect( rScales[0].Minimum, rScales[1].Maximum, rScales[0].Maximum, rScales[1].Minimum );\n    Rectangle aPointRect( dLogicalWidthBeforeScaling )\n    if(rP)\n}\n\n\/\/-----------------------------------------------------------------------------\n\nclass FatCoordinateSystem\n{\npublic:\n    \/\/XCoordinateSystemType getType();\n    Sequence<XThinCoordinateSystem> getCoordinateSystems();\n}\n\nclass ThinCoordinateSystem\n{\nprivate:\n\npublic:\n    sal_Bool        isBreak();\n    Sequence< ExplicitScaleData > getScales();\/\/SubScales without beak\n\n\n}\n*\/\n\/\/.............................................................................\n} \/\/namespace chart\n\/\/.............................................................................\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>improvement to Pick pipeline - after gripper is closed on the object, move vertically away from pose in order to avoid potential dragging of the gripper<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"duisettingspage.h\"\n\n#include <QtDebug>\n\n#include <duilinearlayout.h>\n#include <duilabel.h>\n#include <duipannableviewport.h>\n\n#include \"duisimplecategory.h\"\n#include \"duimaincategory.h\"\n\nDuiSettingsPage::DuiSettingsPage()\n{\n}\n\n\nvoid DuiSettingsPage::createContent()\n{\n    DuiLinearLayout* mainLayout = new DuiLinearLayout(Qt::Vertical);\n\n    DuiLabel* title = new DuiLabel(\"Title\");\n    title->setAlignment(Qt::AlignCenter);\n    title->setMaximumHeight(30);\n    mainLayout->addItem(title);\n\n    m_DesktopViewport = new DuiPannableViewport(Qt::Vertical, this);\n#if 0\n    DuiSimpleCategory *category = new DuiSimpleCategory(\"Example\");\n    DuiSimpleCategory *subcategory = new DuiSimpleCategory(\"SubCategory\");\n    category->add(subcategory);\n#endif\n\n    m_Category = new DuiMainCategory(tr(\"Settings\"));\n    for (int i=0; i<10;i++){\n        if (i%2){\n            DuiSimpleCategory *c2 = new DuiSimpleCategory(\"Two in a row1\");\n            DuiSimpleCategory *c3 = new DuiSimpleCategory(\"Tow in a row2\");\n            m_Category->add(c2, c3);\n        } else {\n            DuiSimpleCategory *c1 = new DuiSimpleCategory(\"One in a row\");\n            m_Category->add(c1);\n        }\n    }\n\n    connect (m_DesktopViewport,\n             SIGNAL(sizeChanged(const QSizeF &, const QSizeF &)),\n             this, SLOT(onSizeChanged(const QSizeF &, const QSizeF &)));\n    m_DesktopViewport->setWidget(m_Category);\n\n    \n    mainLayout->addItem(m_DesktopViewport);\n\n    setLayout(mainLayout);\n}\n\n\n\/* This function is responsible for keeping the width of the panned widget\n   and its viewport the same. *\/\nvoid DuiSettingsPage::onSizeChanged(const QSizeF & pannedWidgetSize,\n                                    const QSizeF & pannableViewportSize)\n{\n    int width = pannableViewportSize.width();\n    if (pannedWidgetSize.width() != width){\n        m_Category->setMinimumSize(width, -1);\n        m_Category->setMaximumSize(width, -1);\n    }\n}\n\n\nvoid DuiSettingsPage::organizeContent(Dui::Orientation ori)\n{\n    Q_UNUSED(ori);\n    qDebug() << \"WARNING: orientation change is not yet implemented\";\n}\n\n<commit_msg>new commit<commit_after>#include \"duisettingspage.h\"\n\n#include <QtDebug>\n\n#include <duilinearlayout.h>\n#include <duilabel.h>\n#include <duipannableviewport.h>\n\n#include <duibutton.h>\n\n#include <QGridLayout>\n\n#include \"duisimplecategory.h\"\n#include \"duimaincategory.h\"\n\n#include \"button2.h\"\n\nDuiSettingsPage::DuiSettingsPage()\n{\n}\n\n\nvoid DuiSettingsPage::createContent()\n{\n    DuiLinearLayout* mainLayout = new DuiLinearLayout(Qt::Vertical);\n\n    DuiLabel* title = new DuiLabel(\"Title\");\n    title->setAlignment(Qt::AlignCenter);\n    title->setMaximumHeight(130);\n\n    title->setMinimumWidth(300);\n\n    mainLayout->addItem(title);\n\n    CButton2 *button = new CButton2(\"alpha\", 200, 90, \"beta\", 110, 30, 30, 30);\n\n    mainLayout->addItem(button->layout());\n\n    m_DesktopViewport = new DuiPannableViewport(Qt::Vertical, this);\n#if 0\n    DuiSimpleCategory *category = new DuiSimpleCategory(\"Example\");\n    DuiSimpleCategory *subcategory = new DuiSimpleCategory(\"SubCategory\");\n    category->add(subcategory);\n#endif\n\n    m_Category = new DuiMainCategory(tr(\"Settings\"));\n    for (int i=0; i<10;i++){\n        if (i%2){\n            DuiSimpleCategory *c2 = new DuiSimpleCategory(\"Two in a row1\");\n            DuiSimpleCategory *c3 = new DuiSimpleCategory(\"Tow in a row2\");\n            m_Category->add(c2, c3);\n        } else {\n            DuiSimpleCategory *c1 = new DuiSimpleCategory(\"One in a row\");\n            m_Category->add(c1);\n        }\n    }\n\n    connect (m_DesktopViewport,\n             SIGNAL(sizeChanged(const QSizeF &, const QSizeF &)),\n             this, SLOT(onSizeChanged(const QSizeF &, const QSizeF &)));\n    m_DesktopViewport->setWidget(m_Category);\n\n    \n    mainLayout->addItem(m_DesktopViewport);\n\n    setLayout(mainLayout);\n}\n\n\n\/* This function is responsible for keeping the width of the panned widget\n   and its viewport the same. *\/\nvoid DuiSettingsPage::onSizeChanged(const QSizeF & pannedWidgetSize,\n                                    const QSizeF & pannableViewportSize)\n{\n    int width = pannableViewportSize.width();\n    if (pannedWidgetSize.width() != width){\n        m_Category->setMinimumSize(width, -1);\n        m_Category->setMaximumSize(width, -1);\n    }\n}\n\n\nvoid DuiSettingsPage::organizeContent(Dui::Orientation ori)\n{\n    Q_UNUSED(ori);\n    qDebug() << \"WARNING: orientation change is not yet implemented\";\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2013 Alessio Sclocco <a.sclocco@vu.nl>\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include <string>\nusing std::string;\n#include <vector>\nusing std::vector;\n#include <cmath>\nusing std::pow;\nusing std::ceil;\n#include <x86intrin.h>\n#include <omp.h>\n\n#include <Observation.hpp>\nusing AstroData::Observation;\n#include <Bins.hpp>\nusing PulsarSearch::getNrSamplesPerBin;\n\n\n#ifndef FOLDING_CPU_HPP\n#define FOLDING_CPU_HPP\n\nnamespace PulsarSearch {\n\n\/\/ Sequential folding algorithms\ntemplate< typename T > void folding(const unsigned int second, const Observation< T > & observation, const T * const __restrict__ samples, T * const __restrict__ bins, unsigned int * const __restrict__ counters);\ntemplate< typename T > void traditionalFolding(const unsigned int second, const Observation< T > & observation, const T * const __restrict__ samples, T * const __restrict__ bins, unsigned int * const __restrict__ counters);\n\n\n\/\/ Implementation\ntemplate< typename T > void folding(const unsigned int second, const Observation< T > & observation, const T * const __restrict__ samples, T * const __restrict__ bins, unsigned int * const __restrict__ counters) {\n\tvector< unsigned int > * samplesPerBin = getNrSamplesPerBin(observation);\n\n\tfor ( unsigned int periodIndex = 0; periodIndex < observation.getNrPeriods(); periodIndex++ ) {\n\t\tconst unsigned int periodValue = observation.getFirstPeriod() + (periodIndex * observation.getPeriodStep());\n\n\t\tfor ( unsigned int bin = 0; bin < observation.getNrBins(); bin++ ) {\n\t\t\tconst unsigned int pCounter = counters[(periodIndex * observation.getNrPaddedBins()) + bin];\n      const unsigned int mySamples = samplesPerBin->at((periodIndex * observation.getNrBins() * isa::utils::pad(2, observation.getPadding())) * (bin * isa::utils::pad(2, observation.getPadding())));\n      const unsigned int myOffset = samplesPerBin->at((periodIndex * observation.getNrBins() * isa::utils::pad(2, observation.getPadding())) * (bin * isa::utils::pad(2, observation.getPadding())) + 1);\n\n      if ( mySamples == 0 ) {\n        continue;\n      }\n\n\t\t\tfor ( unsigned int dm = 0; dm < observation.getNrDMs(); dm++ ) {\n\t\t\t\tT foldedSample = 0;\n\t\t\t\tunsigned int foldedCounter = 0;\n\t\t\t\tunsigned int sample = myOffset + ((pCounter \/ mySamples) * periodValue) + (pCounter % mySamples);\n\n\t\t\t\tif ( (sample \/ observation.getNrSamplesPerSecond()) == second ) {\n\t\t\t\t\tsample %= observation.getNrSamplesPerSecond();\n\t\t\t\t}\n\t\t\t\twhile ( sample < observation.getNrSamplesPerSecond() ) {\n\t\t\t\t\tfoldedSample += samples[(sample * observation.getNrPaddedDMs()) + dm];\n\t\t\t\t\tfoldedCounter++;\n\n\t\t\t\t\tif ( (foldedCounter + pCounter) % mySamples == 0 ) {\n\t\t\t\t\t\tsample += periodValue - (mySamples - 1);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tsample++;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif ( foldedCounter > 0 ) {\n\t\t\t\t\tconst T pValue = bins[(bin * observation.getNrPeriods() * observation.getNrPaddedDMs()) + (periodIndex * observation.getNrPaddedDMs()) + dm];\n\t\t\t\t\tfloat addedFraction = static_cast< float >(foldedCounter) \/ (foldedCounter + pCounter);\n\n\t\t\t\t\tfoldedSample \/= foldedCounter;\n\t\t\t\t\tbins[(bin * observation.getNrPeriods() * observation.getNrPaddedDMs()) + (periodIndex * observation.getNrPaddedDMs()) + dm] = (addedFraction * foldedSample) + ((1.0f - addedFraction) * pValue);\n\t\t\t\t\tif ( dm == observation.getNrDMs() - 1 ) {\n\t\t\t\t\t\tcounters[(periodIndex * observation.getNrPaddedBins()) + bin] = pCounter + foldedCounter;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\ntemplate< typename T > void traditionalFolding(const unsigned int second, const Observation< T > & observation, const T * const __restrict__ samples, T * const __restrict__ bins, unsigned int * const __restrict__ counters) {\n    for ( unsigned int dm = 0; dm < observation.getNrDMs(); dm++ ) {\n        for ( unsigned int periodIndex = 0; periodIndex < observation.getNrPeriods(); periodIndex++ ) {\n            const unsigned int periodValue = observation.getFirstPeriod() + (periodIndex * observation.getPeriodStep());\n\n            for ( unsigned int globalSample = 0; globalSample < observation.getNrSamplesPerSecond(); globalSample++ ) {\n                const unsigned int sample = (second * observation.getNrSamplesPerSecond()) + globalSample;\n                const float phase = (sample \/ static_cast< float >(periodValue)) - (sample \/ periodValue);\n                const unsigned int bin = static_cast< unsigned int >(phase * static_cast< float >(observation.getNrBins()));\n                const unsigned int globalItem = (((dm * observation.getNrPeriods()) + periodIndex) * observation.getNrPaddedBins()) + bin;\n\n                const T pValue = bins[globalItem];\n                T cValue = samples[(dm * observation.getNrSamplesPerPaddedSecond()) + globalSample];\n                const unsigned int pCounter = counters[globalItem];\n                unsigned int cCounter = pCounter + 1;\n\n                if ( pCounter != 0 ) {\n                \tcValue = pValue + ((cValue - pValue) \/ cCounter);\n                }\n                bins[globalItem] = cValue;\n                counters[globalItem] = cCounter;\n            }\n        }\n    }\n}\n\n} \/\/ PulsarSearch\n\n#endif \/\/ FOLDING_CPU_HPP\n<commit_msg>It is clearly not my day. I typed * instead of + and created a weird situation.<commit_after>\/\/ Copyright 2013 Alessio Sclocco <a.sclocco@vu.nl>\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include <string>\nusing std::string;\n#include <vector>\nusing std::vector;\n#include <cmath>\nusing std::pow;\nusing std::ceil;\n#include <x86intrin.h>\n#include <omp.h>\n\n#include <Observation.hpp>\nusing AstroData::Observation;\n#include <Bins.hpp>\nusing PulsarSearch::getNrSamplesPerBin;\n\n\n#ifndef FOLDING_CPU_HPP\n#define FOLDING_CPU_HPP\n\nnamespace PulsarSearch {\n\n\/\/ Sequential folding algorithms\ntemplate< typename T > void folding(const unsigned int second, const Observation< T > & observation, const T * const __restrict__ samples, T * const __restrict__ bins, unsigned int * const __restrict__ counters);\ntemplate< typename T > void traditionalFolding(const unsigned int second, const Observation< T > & observation, const T * const __restrict__ samples, T * const __restrict__ bins, unsigned int * const __restrict__ counters);\n\n\n\/\/ Implementation\ntemplate< typename T > void folding(const unsigned int second, const Observation< T > & observation, const T * const __restrict__ samples, T * const __restrict__ bins, unsigned int * const __restrict__ counters) {\n\tvector< unsigned int > * samplesPerBin = getNrSamplesPerBin(observation);\n\n\tfor ( unsigned int periodIndex = 0; periodIndex < observation.getNrPeriods(); periodIndex++ ) {\n\t\tconst unsigned int periodValue = observation.getFirstPeriod() + (periodIndex * observation.getPeriodStep());\n\n\t\tfor ( unsigned int bin = 0; bin < observation.getNrBins(); bin++ ) {\n\t\t\tconst unsigned int pCounter = counters[(periodIndex * observation.getNrPaddedBins()) + bin];\n      const unsigned int mySamples = samplesPerBin->at((periodIndex * observation.getNrBins() * isa::utils::pad(2, observation.getPadding())) + (bin * isa::utils::pad(2, observation.getPadding())));\n      const unsigned int myOffset = samplesPerBin->at((periodIndex * observation.getNrBins() * isa::utils::pad(2, observation.getPadding())) + (bin * isa::utils::pad(2, observation.getPadding())) + 1);\n\n      if ( mySamples == 0 ) {\n        continue;\n      }\n\n\t\t\tfor ( unsigned int dm = 0; dm < observation.getNrDMs(); dm++ ) {\n\t\t\t\tT foldedSample = 0;\n\t\t\t\tunsigned int foldedCounter = 0;\n\t\t\t\tunsigned int sample = myOffset + ((pCounter \/ mySamples) * periodValue) + (pCounter % mySamples);\n\n\t\t\t\tif ( (sample \/ observation.getNrSamplesPerSecond()) == second ) {\n\t\t\t\t\tsample %= observation.getNrSamplesPerSecond();\n\t\t\t\t}\n\t\t\t\twhile ( sample < observation.getNrSamplesPerSecond() ) {\n\t\t\t\t\tfoldedSample += samples[(sample * observation.getNrPaddedDMs()) + dm];\n\t\t\t\t\tfoldedCounter++;\n\n\t\t\t\t\tif ( (foldedCounter + pCounter) % mySamples == 0 ) {\n\t\t\t\t\t\tsample += periodValue - (mySamples - 1);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tsample++;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif ( foldedCounter > 0 ) {\n\t\t\t\t\tconst T pValue = bins[(bin * observation.getNrPeriods() * observation.getNrPaddedDMs()) + (periodIndex * observation.getNrPaddedDMs()) + dm];\n\t\t\t\t\tfloat addedFraction = static_cast< float >(foldedCounter) \/ (foldedCounter + pCounter);\n\n\t\t\t\t\tfoldedSample \/= foldedCounter;\n\t\t\t\t\tbins[(bin * observation.getNrPeriods() * observation.getNrPaddedDMs()) + (periodIndex * observation.getNrPaddedDMs()) + dm] = (addedFraction * foldedSample) + ((1.0f - addedFraction) * pValue);\n\t\t\t\t\tif ( dm == observation.getNrDMs() - 1 ) {\n\t\t\t\t\t\tcounters[(periodIndex * observation.getNrPaddedBins()) + bin] = pCounter + foldedCounter;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\ntemplate< typename T > void traditionalFolding(const unsigned int second, const Observation< T > & observation, const T * const __restrict__ samples, T * const __restrict__ bins, unsigned int * const __restrict__ counters) {\n    for ( unsigned int dm = 0; dm < observation.getNrDMs(); dm++ ) {\n        for ( unsigned int periodIndex = 0; periodIndex < observation.getNrPeriods(); periodIndex++ ) {\n            const unsigned int periodValue = observation.getFirstPeriod() + (periodIndex * observation.getPeriodStep());\n\n            for ( unsigned int globalSample = 0; globalSample < observation.getNrSamplesPerSecond(); globalSample++ ) {\n                const unsigned int sample = (second * observation.getNrSamplesPerSecond()) + globalSample;\n                const float phase = (sample \/ static_cast< float >(periodValue)) - (sample \/ periodValue);\n                const unsigned int bin = static_cast< unsigned int >(phase * static_cast< float >(observation.getNrBins()));\n                const unsigned int globalItem = (((dm * observation.getNrPeriods()) + periodIndex) * observation.getNrPaddedBins()) + bin;\n\n                const T pValue = bins[globalItem];\n                T cValue = samples[(dm * observation.getNrSamplesPerPaddedSecond()) + globalSample];\n                const unsigned int pCounter = counters[globalItem];\n                unsigned int cCounter = pCounter + 1;\n\n                if ( pCounter != 0 ) {\n                \tcValue = pValue + ((cValue - pValue) \/ cCounter);\n                }\n                bins[globalItem] = cValue;\n                counters[globalItem] = cCounter;\n            }\n        }\n    }\n}\n\n} \/\/ PulsarSearch\n\n#endif \/\/ FOLDING_CPU_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\/ui\/panels\/panel_manager.h\"\n\n#include \"base\/bind.h\"\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\/browser\/ui\/panels\/detached_panel_collection.h\"\n#include \"chrome\/browser\/ui\/panels\/docked_panel_collection.h\"\n#include \"chrome\/browser\/ui\/panels\/panel_drag_controller.h\"\n#include \"chrome\/browser\/ui\/panels\/panel_mouse_watcher.h\"\n#include \"chrome\/browser\/ui\/panels\/panel_resize_controller.h\"\n#include \"chrome\/common\/chrome_notification_types.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/chrome_version_info.h\"\n#include \"content\/public\/browser\/notification_service.h\"\n#include \"content\/public\/browser\/notification_source.h\"\n\n#if defined(TOOLKIT_GTK)\n#include \"ui\/base\/x\/x11_util.h\"\n#endif\n\n#if defined(OS_WIN)\n#include \"win8\/util\/win8_util.h\"\n#endif\n\nnamespace {\n\/\/ Width of spacing around panel collection and the left\/right edges of the\n\/\/ screen.\nconst int kPanelCollectionLeftMargin = 6;\nconst int kPanelCollectionRightMargin = 24;\n\n\/\/ Maxmium width of a panel is based on a factor of the working area.\n#if defined(OS_CHROMEOS)\n\/\/ ChromeOS device screens are relatively small and limiting the width\n\/\/ interferes with some apps (e.g. http:\/\/crbug.com\/111121).\nconst double kPanelMaxWidthFactor = 0.80;\n#else\nconst double kPanelMaxWidthFactor = 0.35;\n#endif\n\n\/\/ Maxmium height of a panel is based on a factor of the working area.\nconst double kPanelMaxHeightFactor = 0.5;\n\n\/\/ Width to height ratio is used to compute the default width or height\n\/\/ when only one value is provided.\nconst double kPanelDefaultWidthToHeightRatio = 1.62;  \/\/ golden ratio\n}  \/\/ namespace\n\n\/\/ static\nbool PanelManager::shorten_time_intervals_ = false;\n\n\/\/ static\nPanelManager* PanelManager::GetInstance() {\n  static base::LazyInstance<PanelManager> instance = LAZY_INSTANCE_INITIALIZER;\n  return instance.Pointer();\n}\n\n\/\/ static\nbool PanelManager::ShouldUsePanels(const std::string& extension_id) {\n#if defined(TOOLKIT_GTK)\n  \/\/ Panels are only supported on a white list of window managers for Linux.\n  ui::WindowManagerName wm_type = ui::GuessWindowManager();\n  if (wm_type != ui::WM_COMPIZ &&\n      wm_type != ui::WM_ICE_WM &&\n      wm_type != ui::WM_KWIN &&\n      wm_type != ui::WM_METACITY &&\n      wm_type != ui::WM_MUTTER &&\n      wm_type != ui::WM_XFWM4) {\n    return false;\n  }\n#endif  \/\/ TOOLKIT_GTK\n\n#if defined(OS_WIN)\n  \/\/ No panels in Metro mode.\n  if (win8::IsSingleWindowMetroMode())\n    return false;\n#endif \/\/ OS_WIN\n\n  chrome::VersionInfo::Channel channel = chrome::VersionInfo::GetChannel();\n  if (channel == chrome::VersionInfo::CHANNEL_STABLE ||\n      channel == chrome::VersionInfo::CHANNEL_BETA) {\n    return CommandLine::ForCurrentProcess()->HasSwitch(\n        switches::kEnablePanels) ||\n        extension_id == std::string(\"nckgahadagoaajjgafhacjanaoiihapd\") ||\n        extension_id == std::string(\"ljclpkphhpbpinifbeabbhlfddcpfdde\") ||\n        extension_id == std::string(\"ppleadejekpmccmnpjdimmlfljlkdfej\") ||\n        extension_id == std::string(\"eggnbpckecmjlblplehfpjjdhhidfdoj\");\n  }\n\n  return true;\n}\n\nPanelManager::PanelManager()\n    : panel_mouse_watcher_(PanelMouseWatcher::Create()),\n      auto_sizing_enabled_(true) {\n  \/\/ DisplaySettingsProvider should be created before the creation of\n  \/\/ collections since some collection might depend on it.\n  display_settings_provider_.reset(DisplaySettingsProvider::Create());\n  display_settings_provider_->AddDisplayAreaObserver(this);\n\n  detached_collection_.reset(new DetachedPanelCollection(this));\n  docked_collection_.reset(new DockedPanelCollection(this));\n  drag_controller_.reset(new PanelDragController(this));\n  resize_controller_.reset(new PanelResizeController(this));\n}\n\nPanelManager::~PanelManager() {\n  display_settings_provider_->RemoveDisplayAreaObserver(this);\n\n  \/\/ Docked collection should be disposed explicitly before\n  \/\/ DisplaySettingsProvider is gone since docked collection needs to remove\n  \/\/ the observer from DisplaySettingsProvider.\n  docked_collection_.reset();\n}\n\ngfx::Point PanelManager::GetDefaultDetachedPanelOrigin() {\n  return detached_collection_->GetDefaultPanelOrigin();\n}\n\nvoid PanelManager::OnDisplayAreaChanged(const gfx::Rect& display_area) {\n  if (display_area == display_area_)\n    return;\n  display_area_ = display_area;\n\n  gfx::Rect dock_bounds = display_area;\n  dock_bounds.set_x(display_area.x() + kPanelCollectionLeftMargin);\n  dock_bounds.set_width(display_area.width() -\n      kPanelCollectionLeftMargin - kPanelCollectionRightMargin);\n  docked_collection_->SetDisplayArea(dock_bounds);\n\n  detached_collection_->SetDisplayArea(display_area);\n}\n\nvoid PanelManager::OnFullScreenModeChanged(bool is_full_screen) {\n  docked_collection_->OnFullScreenModeChanged(is_full_screen);\n}\n\nint PanelManager::GetMaxPanelWidth() const {\n  return static_cast<int>(display_area_.width() * kPanelMaxWidthFactor);\n}\n\nint PanelManager::GetMaxPanelHeight() const {\n  return display_area_.height() * kPanelMaxHeightFactor;\n}\n\nPanel* PanelManager::CreatePanel(const std::string& app_name,\n                                 Profile* profile,\n                                 const GURL& url,\n                                 const gfx::Rect& requested_bounds,\n                                 CreateMode mode) {\n  \/\/ Need to sync the display area if no panel is present. This is because:\n  \/\/ 1) Display area is not initialized until first panel is created.\n  \/\/ 2) On windows, display settings notification is tied to a window. When\n  \/\/    display settings are changed at the time that no panel exists, we do\n  \/\/    not receive any notification.\n  if (num_panels() == 0) {\n    display_settings_provider_->OnDisplaySettingsChanged();\n    display_settings_provider_->AddFullScreenObserver(this);\n  }\n\n  \/\/ Compute initial bounds for the panel.\n  int width = requested_bounds.width();\n  int height = requested_bounds.height();\n  if (width == 0)\n    width = height * kPanelDefaultWidthToHeightRatio;\n  else if (height == 0)\n    height = width \/ kPanelDefaultWidthToHeightRatio;\n\n  gfx::Size min_size(panel::kPanelMinWidth, panel::kPanelMinHeight);\n  gfx::Size max_size(GetMaxPanelWidth(), GetMaxPanelHeight());\n  if (width < min_size.width())\n    width = min_size.width();\n  else if (width > max_size.width())\n    width = max_size.width();\n\n  if (height < min_size.height())\n    height = min_size.height();\n  else if (height > max_size.height())\n    height = max_size.height();\n\n  gfx::Rect bounds(width, height);\n  if (CREATE_AS_DOCKED == mode) {\n    bounds.set_origin(\n        docked_collection_->GetDefaultPositionForPanel(bounds.size()));\n  } else {\n    bounds.set_origin(requested_bounds.origin());\n    bounds.AdjustToFit(display_settings_provider_->GetDisplayArea());\n  }\n\n  \/\/ Create the panel.\n  Panel* panel = new Panel(app_name, min_size, max_size);\n  panel->Initialize(profile, url, bounds);\n\n  \/\/ Auto resizable feature is enabled only if no initial size is requested.\n  if (auto_sizing_enabled() && requested_bounds.width() == 0 &&\n      requested_bounds.height() == 0) {\n    panel->SetAutoResizable(true);\n  }\n\n  \/\/ Add the panel to the appropriate panel collection.\n  \/\/ Delay layout refreshes in case multiple panels are created within\n  \/\/ a short time of one another or the focus changes shortly after panel\n  \/\/ is created to avoid excessive screen redraws.\n  PanelCollection* collection;\n  PanelCollection::PositioningMask positioning_mask;\n  if (CREATE_AS_DOCKED == mode) {\n    collection = docked_collection_.get();\n    positioning_mask = PanelCollection::DELAY_LAYOUT_REFRESH;\n  } else {\n    collection = detached_collection_.get();\n    positioning_mask = PanelCollection::KNOWN_POSITION;\n  }\n\n  collection->AddPanel(panel, positioning_mask);\n  collection->UpdatePanelOnCollectionChange(panel);\n\n  return panel;\n}\n\nvoid PanelManager::OnPanelClosed(Panel* panel) {\n  if (num_panels() == 1) {\n    display_settings_provider_->RemoveFullScreenObserver(this);\n  }\n\n  drag_controller_->OnPanelClosed(panel);\n  resize_controller_->OnPanelClosed(panel);\n  panel->collection()->RemovePanel(panel);\n\n  content::NotificationService::current()->Notify(\n      chrome::NOTIFICATION_PANEL_CLOSED,\n      content::Source<Panel>(panel),\n      content::NotificationService::NoDetails());\n}\n\nvoid PanelManager::StartDragging(Panel* panel,\n                                 const gfx::Point& mouse_location) {\n  drag_controller_->StartDragging(panel, mouse_location);\n}\n\nvoid PanelManager::Drag(const gfx::Point& mouse_location) {\n  drag_controller_->Drag(mouse_location);\n}\n\nvoid PanelManager::EndDragging(bool cancelled) {\n  drag_controller_->EndDragging(cancelled);\n}\n\nvoid PanelManager::StartResizingByMouse(Panel* panel,\n    const gfx::Point& mouse_location,\n    panel::ResizingSides sides) {\n  if (panel->CanResizeByMouse() != panel::NOT_RESIZABLE &&\n      sides != panel::RESIZE_NONE)\n    resize_controller_->StartResizing(panel, mouse_location, sides);\n}\n\nvoid PanelManager::ResizeByMouse(const gfx::Point& mouse_location) {\n  if (resize_controller_->IsResizing())\n    resize_controller_->Resize(mouse_location);\n}\n\nvoid PanelManager::EndResizingByMouse(bool cancelled) {\n  if (resize_controller_->IsResizing()) {\n    Panel* resized_panel = resize_controller_->EndResizing(cancelled);\n    if (!cancelled && resized_panel->collection())\n      resized_panel->collection()->RefreshLayout();\n  }\n}\n\nvoid PanelManager::OnPanelExpansionStateChanged(Panel* panel) {\n  \/\/ For panels outside of the docked collection changing state is a no-op.\n  \/\/ But since this method may be called for panels in other collections\n  \/\/ we need to check this condition.\n  if (panel->collection() == docked_collection_.get())\n    docked_collection_->OnPanelExpansionStateChanged(panel);\n\n}\n\nvoid PanelManager::MovePanelToCollection(\n    Panel* panel,\n    PanelCollection::Type new_layout,\n    PanelCollection::PositioningMask positioning_mask) {\n  DCHECK(panel);\n  PanelCollection* current_collection = panel->collection();\n  DCHECK(current_collection);\n  DCHECK_NE(current_collection->type(), new_layout);\n  current_collection->RemovePanel(panel);\n\n  PanelCollection* target_collection = NULL;\n  switch (new_layout) {\n    case PanelCollection::DETACHED:\n      target_collection = detached_collection_.get();\n      break;\n    case PanelCollection::DOCKED:\n      target_collection = docked_collection_.get();\n      break;\n    default:\n      NOTREACHED();\n  }\n\n  target_collection->AddPanel(panel, positioning_mask);\n  target_collection->UpdatePanelOnCollectionChange(panel);\n}\n\nbool PanelManager::ShouldBringUpTitlebars(int mouse_x, int mouse_y) const {\n  return docked_collection_->ShouldBringUpTitlebars(mouse_x, mouse_y);\n}\n\nvoid PanelManager::BringUpOrDownTitlebars(bool bring_up) {\n  docked_collection_->BringUpOrDownTitlebars(bring_up);\n}\n\nvoid PanelManager::CloseAll() {\n  DCHECK(!drag_controller_->IsDragging());\n\n  detached_collection_->CloseAll();\n  docked_collection_->CloseAll();\n}\n\nint PanelManager::num_panels() const {\n  return detached_collection_->num_panels() + docked_collection_->num_panels();\n}\n\nstd::vector<Panel*> PanelManager::panels() const {\n  std::vector<Panel*> panels;\n  for (DetachedPanelCollection::Panels::const_iterator iter =\n           detached_collection_->panels().begin();\n       iter != detached_collection_->panels().end(); ++iter)\n    panels.push_back(*iter);\n  for (DockedPanelCollection::Panels::const_iterator iter =\n           docked_collection_->panels().begin();\n       iter != docked_collection_->panels().end(); ++iter)\n    panels.push_back(*iter);\n  return panels;\n}\n\nvoid PanelManager::SetMouseWatcher(PanelMouseWatcher* watcher) {\n  panel_mouse_watcher_.reset(watcher);\n}\n\nvoid PanelManager::OnPanelAnimationEnded(Panel* panel) {\n  content::NotificationService::current()->Notify(\n      chrome::NOTIFICATION_PANEL_BOUNDS_ANIMATIONS_FINISHED,\n      content::Source<Panel>(panel),\n      content::NotificationService::NoDetails());\n}\n<commit_msg>Allow --enable-panels to override window manager detection for panels.<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\/panels\/panel_manager.h\"\n\n#include \"base\/bind.h\"\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\/browser\/ui\/panels\/detached_panel_collection.h\"\n#include \"chrome\/browser\/ui\/panels\/docked_panel_collection.h\"\n#include \"chrome\/browser\/ui\/panels\/panel_drag_controller.h\"\n#include \"chrome\/browser\/ui\/panels\/panel_mouse_watcher.h\"\n#include \"chrome\/browser\/ui\/panels\/panel_resize_controller.h\"\n#include \"chrome\/common\/chrome_notification_types.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/chrome_version_info.h\"\n#include \"content\/public\/browser\/notification_service.h\"\n#include \"content\/public\/browser\/notification_source.h\"\n\n#if defined(TOOLKIT_GTK)\n#include \"ui\/base\/x\/x11_util.h\"\n#endif\n\n#if defined(OS_WIN)\n#include \"win8\/util\/win8_util.h\"\n#endif\n\nnamespace {\n\/\/ Width of spacing around panel collection and the left\/right edges of the\n\/\/ screen.\nconst int kPanelCollectionLeftMargin = 6;\nconst int kPanelCollectionRightMargin = 24;\n\n\/\/ Maxmium width of a panel is based on a factor of the working area.\n#if defined(OS_CHROMEOS)\n\/\/ ChromeOS device screens are relatively small and limiting the width\n\/\/ interferes with some apps (e.g. http:\/\/crbug.com\/111121).\nconst double kPanelMaxWidthFactor = 0.80;\n#else\nconst double kPanelMaxWidthFactor = 0.35;\n#endif\n\n\/\/ Maxmium height of a panel is based on a factor of the working area.\nconst double kPanelMaxHeightFactor = 0.5;\n\n\/\/ Width to height ratio is used to compute the default width or height\n\/\/ when only one value is provided.\nconst double kPanelDefaultWidthToHeightRatio = 1.62;  \/\/ golden ratio\n}  \/\/ namespace\n\n\/\/ static\nbool PanelManager::shorten_time_intervals_ = false;\n\n\/\/ static\nPanelManager* PanelManager::GetInstance() {\n  static base::LazyInstance<PanelManager> instance = LAZY_INSTANCE_INITIALIZER;\n  return instance.Pointer();\n}\n\n\/\/ static\nbool PanelManager::ShouldUsePanels(const std::string& extension_id) {\n#if defined(TOOLKIT_GTK)\n  \/\/ If --enable-panels is on, always use panels on Linux.\n  if (CommandLine::ForCurrentProcess()->HasSwitch(switches::kEnablePanels))\n    return true;\n\n  \/\/ Otherwise, panels are only supported on tested window managers.\n  ui::WindowManagerName wm_type = ui::GuessWindowManager();\n  if (wm_type != ui::WM_COMPIZ &&\n      wm_type != ui::WM_ICE_WM &&\n      wm_type != ui::WM_KWIN &&\n      wm_type != ui::WM_METACITY &&\n      wm_type != ui::WM_MUTTER &&\n      wm_type != ui::WM_XFWM4) {\n    return false;\n  }\n#endif  \/\/ TOOLKIT_GTK\n\n#if defined(OS_WIN)\n  \/\/ No panels in Metro mode.\n  if (win8::IsSingleWindowMetroMode())\n    return false;\n#endif \/\/ OS_WIN\n\n  chrome::VersionInfo::Channel channel = chrome::VersionInfo::GetChannel();\n  if (channel == chrome::VersionInfo::CHANNEL_STABLE ||\n      channel == chrome::VersionInfo::CHANNEL_BETA) {\n    return CommandLine::ForCurrentProcess()->HasSwitch(\n        switches::kEnablePanels) ||\n        extension_id == std::string(\"nckgahadagoaajjgafhacjanaoiihapd\") ||\n        extension_id == std::string(\"ljclpkphhpbpinifbeabbhlfddcpfdde\") ||\n        extension_id == std::string(\"ppleadejekpmccmnpjdimmlfljlkdfej\") ||\n        extension_id == std::string(\"eggnbpckecmjlblplehfpjjdhhidfdoj\");\n  }\n\n  return true;\n}\n\nPanelManager::PanelManager()\n    : panel_mouse_watcher_(PanelMouseWatcher::Create()),\n      auto_sizing_enabled_(true) {\n  \/\/ DisplaySettingsProvider should be created before the creation of\n  \/\/ collections since some collection might depend on it.\n  display_settings_provider_.reset(DisplaySettingsProvider::Create());\n  display_settings_provider_->AddDisplayAreaObserver(this);\n\n  detached_collection_.reset(new DetachedPanelCollection(this));\n  docked_collection_.reset(new DockedPanelCollection(this));\n  drag_controller_.reset(new PanelDragController(this));\n  resize_controller_.reset(new PanelResizeController(this));\n}\n\nPanelManager::~PanelManager() {\n  display_settings_provider_->RemoveDisplayAreaObserver(this);\n\n  \/\/ Docked collection should be disposed explicitly before\n  \/\/ DisplaySettingsProvider is gone since docked collection needs to remove\n  \/\/ the observer from DisplaySettingsProvider.\n  docked_collection_.reset();\n}\n\ngfx::Point PanelManager::GetDefaultDetachedPanelOrigin() {\n  return detached_collection_->GetDefaultPanelOrigin();\n}\n\nvoid PanelManager::OnDisplayAreaChanged(const gfx::Rect& display_area) {\n  if (display_area == display_area_)\n    return;\n  display_area_ = display_area;\n\n  gfx::Rect dock_bounds = display_area;\n  dock_bounds.set_x(display_area.x() + kPanelCollectionLeftMargin);\n  dock_bounds.set_width(display_area.width() -\n      kPanelCollectionLeftMargin - kPanelCollectionRightMargin);\n  docked_collection_->SetDisplayArea(dock_bounds);\n\n  detached_collection_->SetDisplayArea(display_area);\n}\n\nvoid PanelManager::OnFullScreenModeChanged(bool is_full_screen) {\n  docked_collection_->OnFullScreenModeChanged(is_full_screen);\n}\n\nint PanelManager::GetMaxPanelWidth() const {\n  return static_cast<int>(display_area_.width() * kPanelMaxWidthFactor);\n}\n\nint PanelManager::GetMaxPanelHeight() const {\n  return display_area_.height() * kPanelMaxHeightFactor;\n}\n\nPanel* PanelManager::CreatePanel(const std::string& app_name,\n                                 Profile* profile,\n                                 const GURL& url,\n                                 const gfx::Rect& requested_bounds,\n                                 CreateMode mode) {\n  \/\/ Need to sync the display area if no panel is present. This is because:\n  \/\/ 1) Display area is not initialized until first panel is created.\n  \/\/ 2) On windows, display settings notification is tied to a window. When\n  \/\/    display settings are changed at the time that no panel exists, we do\n  \/\/    not receive any notification.\n  if (num_panels() == 0) {\n    display_settings_provider_->OnDisplaySettingsChanged();\n    display_settings_provider_->AddFullScreenObserver(this);\n  }\n\n  \/\/ Compute initial bounds for the panel.\n  int width = requested_bounds.width();\n  int height = requested_bounds.height();\n  if (width == 0)\n    width = height * kPanelDefaultWidthToHeightRatio;\n  else if (height == 0)\n    height = width \/ kPanelDefaultWidthToHeightRatio;\n\n  gfx::Size min_size(panel::kPanelMinWidth, panel::kPanelMinHeight);\n  gfx::Size max_size(GetMaxPanelWidth(), GetMaxPanelHeight());\n  if (width < min_size.width())\n    width = min_size.width();\n  else if (width > max_size.width())\n    width = max_size.width();\n\n  if (height < min_size.height())\n    height = min_size.height();\n  else if (height > max_size.height())\n    height = max_size.height();\n\n  gfx::Rect bounds(width, height);\n  if (CREATE_AS_DOCKED == mode) {\n    bounds.set_origin(\n        docked_collection_->GetDefaultPositionForPanel(bounds.size()));\n  } else {\n    bounds.set_origin(requested_bounds.origin());\n    bounds.AdjustToFit(display_settings_provider_->GetDisplayArea());\n  }\n\n  \/\/ Create the panel.\n  Panel* panel = new Panel(app_name, min_size, max_size);\n  panel->Initialize(profile, url, bounds);\n\n  \/\/ Auto resizable feature is enabled only if no initial size is requested.\n  if (auto_sizing_enabled() && requested_bounds.width() == 0 &&\n      requested_bounds.height() == 0) {\n    panel->SetAutoResizable(true);\n  }\n\n  \/\/ Add the panel to the appropriate panel collection.\n  \/\/ Delay layout refreshes in case multiple panels are created within\n  \/\/ a short time of one another or the focus changes shortly after panel\n  \/\/ is created to avoid excessive screen redraws.\n  PanelCollection* collection;\n  PanelCollection::PositioningMask positioning_mask;\n  if (CREATE_AS_DOCKED == mode) {\n    collection = docked_collection_.get();\n    positioning_mask = PanelCollection::DELAY_LAYOUT_REFRESH;\n  } else {\n    collection = detached_collection_.get();\n    positioning_mask = PanelCollection::KNOWN_POSITION;\n  }\n\n  collection->AddPanel(panel, positioning_mask);\n  collection->UpdatePanelOnCollectionChange(panel);\n\n  return panel;\n}\n\nvoid PanelManager::OnPanelClosed(Panel* panel) {\n  if (num_panels() == 1) {\n    display_settings_provider_->RemoveFullScreenObserver(this);\n  }\n\n  drag_controller_->OnPanelClosed(panel);\n  resize_controller_->OnPanelClosed(panel);\n  panel->collection()->RemovePanel(panel);\n\n  content::NotificationService::current()->Notify(\n      chrome::NOTIFICATION_PANEL_CLOSED,\n      content::Source<Panel>(panel),\n      content::NotificationService::NoDetails());\n}\n\nvoid PanelManager::StartDragging(Panel* panel,\n                                 const gfx::Point& mouse_location) {\n  drag_controller_->StartDragging(panel, mouse_location);\n}\n\nvoid PanelManager::Drag(const gfx::Point& mouse_location) {\n  drag_controller_->Drag(mouse_location);\n}\n\nvoid PanelManager::EndDragging(bool cancelled) {\n  drag_controller_->EndDragging(cancelled);\n}\n\nvoid PanelManager::StartResizingByMouse(Panel* panel,\n    const gfx::Point& mouse_location,\n    panel::ResizingSides sides) {\n  if (panel->CanResizeByMouse() != panel::NOT_RESIZABLE &&\n      sides != panel::RESIZE_NONE)\n    resize_controller_->StartResizing(panel, mouse_location, sides);\n}\n\nvoid PanelManager::ResizeByMouse(const gfx::Point& mouse_location) {\n  if (resize_controller_->IsResizing())\n    resize_controller_->Resize(mouse_location);\n}\n\nvoid PanelManager::EndResizingByMouse(bool cancelled) {\n  if (resize_controller_->IsResizing()) {\n    Panel* resized_panel = resize_controller_->EndResizing(cancelled);\n    if (!cancelled && resized_panel->collection())\n      resized_panel->collection()->RefreshLayout();\n  }\n}\n\nvoid PanelManager::OnPanelExpansionStateChanged(Panel* panel) {\n  \/\/ For panels outside of the docked collection changing state is a no-op.\n  \/\/ But since this method may be called for panels in other collections\n  \/\/ we need to check this condition.\n  if (panel->collection() == docked_collection_.get())\n    docked_collection_->OnPanelExpansionStateChanged(panel);\n\n}\n\nvoid PanelManager::MovePanelToCollection(\n    Panel* panel,\n    PanelCollection::Type new_layout,\n    PanelCollection::PositioningMask positioning_mask) {\n  DCHECK(panel);\n  PanelCollection* current_collection = panel->collection();\n  DCHECK(current_collection);\n  DCHECK_NE(current_collection->type(), new_layout);\n  current_collection->RemovePanel(panel);\n\n  PanelCollection* target_collection = NULL;\n  switch (new_layout) {\n    case PanelCollection::DETACHED:\n      target_collection = detached_collection_.get();\n      break;\n    case PanelCollection::DOCKED:\n      target_collection = docked_collection_.get();\n      break;\n    default:\n      NOTREACHED();\n  }\n\n  target_collection->AddPanel(panel, positioning_mask);\n  target_collection->UpdatePanelOnCollectionChange(panel);\n}\n\nbool PanelManager::ShouldBringUpTitlebars(int mouse_x, int mouse_y) const {\n  return docked_collection_->ShouldBringUpTitlebars(mouse_x, mouse_y);\n}\n\nvoid PanelManager::BringUpOrDownTitlebars(bool bring_up) {\n  docked_collection_->BringUpOrDownTitlebars(bring_up);\n}\n\nvoid PanelManager::CloseAll() {\n  DCHECK(!drag_controller_->IsDragging());\n\n  detached_collection_->CloseAll();\n  docked_collection_->CloseAll();\n}\n\nint PanelManager::num_panels() const {\n  return detached_collection_->num_panels() + docked_collection_->num_panels();\n}\n\nstd::vector<Panel*> PanelManager::panels() const {\n  std::vector<Panel*> panels;\n  for (DetachedPanelCollection::Panels::const_iterator iter =\n           detached_collection_->panels().begin();\n       iter != detached_collection_->panels().end(); ++iter)\n    panels.push_back(*iter);\n  for (DockedPanelCollection::Panels::const_iterator iter =\n           docked_collection_->panels().begin();\n       iter != docked_collection_->panels().end(); ++iter)\n    panels.push_back(*iter);\n  return panels;\n}\n\nvoid PanelManager::SetMouseWatcher(PanelMouseWatcher* watcher) {\n  panel_mouse_watcher_.reset(watcher);\n}\n\nvoid PanelManager::OnPanelAnimationEnded(Panel* panel) {\n  content::NotificationService::current()->Notify(\n      chrome::NOTIFICATION_PANEL_BOUNDS_ANIMATIONS_FINISHED,\n      content::Source<Panel>(panel),\n      content::NotificationService::NoDetails());\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>[Infineon] Added implementation for Identify TriggerEffect (#22297)<commit_after><|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n\n#include <vector>\n#include <utility>\n\nnamespace helene\n{\ntemplate <class T, class Allocator = std::allocator<T>>\nclass handle_map\n{\npublic:\n    typedef typename std::vector<T>::size_type size_type;\n    typedef typename std::vector<size_type>::size_type handle_type;\n\npublic:\n    class iterator\n    {\n    public:\n    private:\n        std::vector<T>* dense_ref_;\n        std::vector<size_type>* sparse_ref_;\n        handle_type current_;\n    };\n\n    typedef typename std::vector<T>::iterator iterator;\n    typedef typename std::vector<T>::const_iterator const_iterator;\n\npublic:\n    handle_type\n    insert(const T& value)\n    {\n        \/\/ always insert at end of dense storage\n        dense_.push_back(value);\n\n        handle_type new_handle;\n        \/\/ find new handle\n        if(free_.empty())\n        {\n            \/\/ no free handle slots, push back new slot\n            sparse_.push_back(dense_.size() - 1);\n\n\n            new_handle = sparse_.size() - 1;\n        }\n        else\n        {\n            \/\/ slot is available for new handle\n            new_handle = free_.back();\n            sparse_[new_handle] = dense_.size() - 1;\n            free_.pop_back();\n        }\n\n        reverse_.push_back(new_handle);\n\n        return new_handle;\n    }\n\n\n    void\n    erase(handle_type n)\n    {\n        \/\/ find handle of dense's back\n        const auto index_of_dense_back = dense_.size() - 1;\n        const auto back_handle = reverse_[index_of_dense_back];\n\n\n        \/\/ swap element to erase with back element\n        std::swap(dense_[sparse_[n]], dense_.back());\n        std::swap(reverse_[n], reverse_[index_of_dense_back]);\n\n        \/\/ update handle reference to new dense location\n        sparse_[back_handle] = sparse_[n];\n\n        \/\/ pop back\n        dense_.pop_back();\n        reverse_.pop_back();\n\n        \/\/ add handle to free list\n        free_.push_back(n);\n    }\n\n    size_type\n    size() const\n    {\n        return dense_.size();\n    }\n\n    T& operator[](handle_type n)\n    {\n        return dense_[sparse_[n]];\n    }\n\n    const T& operator[](handle_type n) const\n    {\n        return dense_[sparse_[n]];\n    }\n\nprivate:\n    std::vector<T> dense_;\n    std::vector<size_type> sparse_;\n    std::vector<handle_type> reverse_;\n    std::vector<handle_type> free_;\n};\n} \/\/ namespace helene\n<commit_msg>Remove unused declaration. \tmodified:   include\/handle_map.hpp<commit_after>#pragma once\n\n\n#include <vector>\n#include <utility>\n\nnamespace helene\n{\ntemplate <class T, class Allocator = std::allocator<T>>\nclass handle_map\n{\npublic:\n    typedef typename std::vector<T>::size_type size_type;\n    typedef typename std::vector<size_type>::size_type handle_type;\n\npublic:\n    typedef typename std::vector<T>::iterator iterator;\n    typedef typename std::vector<T>::const_iterator const_iterator;\n\npublic:\n    handle_type\n    insert(const T& value)\n    {\n        \/\/ always insert at end of dense storage\n        dense_.push_back(value);\n\n        handle_type new_handle;\n        \/\/ find new handle\n        if(free_.empty())\n        {\n            \/\/ no free handle slots, push back new slot\n            sparse_.push_back(dense_.size() - 1);\n\n\n            new_handle = sparse_.size() - 1;\n        }\n        else\n        {\n            \/\/ slot is available for new handle\n            new_handle = free_.back();\n            sparse_[new_handle] = dense_.size() - 1;\n            free_.pop_back();\n        }\n\n        reverse_.push_back(new_handle);\n\n        return new_handle;\n    }\n\n\n    void\n    erase(handle_type n)\n    {\n        \/\/ find handle of dense's back\n        const auto index_of_dense_back = dense_.size() - 1;\n        const auto back_handle = reverse_[index_of_dense_back];\n\n\n        \/\/ swap element to erase with back element\n        std::swap(dense_[sparse_[n]], dense_.back());\n        std::swap(reverse_[n], reverse_[index_of_dense_back]);\n\n        \/\/ update handle reference to new dense location\n        sparse_[back_handle] = sparse_[n];\n\n        \/\/ pop back\n        dense_.pop_back();\n        reverse_.pop_back();\n\n        \/\/ add handle to free list\n        free_.push_back(n);\n    }\n\n    size_type\n    size() const\n    {\n        return dense_.size();\n    }\n\n    T& operator[](handle_type n)\n    {\n        return dense_[sparse_[n]];\n    }\n\n    const T& operator[](handle_type n) const\n    {\n        return dense_[sparse_[n]];\n    }\n\nprivate:\n    std::vector<T> dense_;\n    std::vector<size_type> sparse_;\n    std::vector<handle_type> reverse_;\n    std::vector<handle_type> free_;\n};\n} \/\/ namespace helene\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Revert 40313 - Revert 40305  Fix for cases when info bar is stealing focus on Windows<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>I don't know how it could happen, but according to this bug it's possible for a phantom tab to show the crashed icons. This should make it so that can never happen.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2013 The Chromium Authors. All rights reserved.\n\/\/ Copyright (c) 2015 Intel Corporation. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"xwalk\/runtime\/browser\/ui\/native_app_window_desktop.h\"\n\n#include \"base\/strings\/utf_string_conversions.h\"\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"grit\/xwalk_strings.h\"\n#include \"third_party\/skia\/include\/core\/SkPaint.h\"\n#include \"ui\/base\/l10n\/l10n_util.h\"\n#include \"ui\/views\/controls\/webview\/webview.h\"\n#include \"ui\/gfx\/canvas.h\"\n#include \"ui\/views\/background.h\"\n#include \"ui\/views\/controls\/button\/label_button.h\"\n#include \"ui\/views\/layout\/grid_layout.h\"\n#include \"ui\/views\/layout\/fill_layout.h\"\n#include \"xwalk\/runtime\/browser\/ui\/top_view_layout_views.h\"\n\nnamespace xwalk {\n\nclass NativeAppWindowDesktop::AddressView : public views::Label {\n public:\n  AddressView()\n    : progress_(0) {\n  }\n  ~AddressView() override {}\n\n  void SetProgress(double progress) {\n    DCHECK(progress >= 0 && progress <= 1);\n    progress_ = progress;\n    SchedulePaint();\n  }\n\n private:\n  void OnPaint(gfx::Canvas* canvas) override {\n    static const SkColor bg_color = SkColorSetARGB(128, 86, 167, 247);\n    gfx::Rect content_bounds = GetContentsBounds();\n    int bar_left = content_bounds.x();\n    int bar_top = content_bounds.y();\n    int bar_width = content_bounds.width();\n    int bar_height = content_bounds.height();\n\n    SkPath path;\n    path.addRect(bar_left, bar_top + 2, bar_width * progress_, bar_height - 2);\n    SkPaint paint;\n    paint.setStyle(SkPaint::kFill_Style);\n    paint.setFlags(SkPaint::kAntiAlias_Flag);\n    paint.setColor(bg_color);\n    canvas->DrawPath(path, paint);\n\n    views::Label::OnPaint(canvas);\n  }\n\n  double progress_;\n};\n\nNativeAppWindowDesktop::NativeAppWindowDesktop(\n    const NativeAppWindow::CreateParams& create_params)\n    : NativeAppWindowViews(create_params),\n      toolbar_view_(nullptr),\n      back_button_(nullptr),\n      forward_button_(nullptr),\n      refresh_button_(nullptr),\n      stop_button_(nullptr),\n      address_bar_(nullptr) {\n}\n\nNativeAppWindowDesktop::~NativeAppWindowDesktop() {\n}\n\nvoid NativeAppWindowDesktop::ViewHierarchyChanged(\n    const ViewHierarchyChangedDetails& details) {\n  if (details.is_add && details.child == this) {\n    if (create_params().mode == blink::WebDisplayModeMinimalUi)\n      InitMinimalUI();\n    else\n      InitStandaloneUI();\n  }\n}\n\nvoid NativeAppWindowDesktop::InitStandaloneUI() {\n  TopViewLayout* layout = new TopViewLayout();\n  SetLayoutManager(layout);\n\n  web_view_ = new views::WebView(NULL);\n  web_view_->SetWebContents(web_contents_);\n  AddChildView(web_view_);\n  layout->set_content_view(web_view_);\n}\n\nvoid NativeAppWindowDesktop::InitMinimalUI() {\n  set_background(views::Background::CreateStandardPanelBackground());\n  views::GridLayout* layout = new views::GridLayout(this);\n  SetLayoutManager(layout);\n\n  views::ColumnSet* column_set = layout->AddColumnSet(0);\n  column_set->AddPaddingColumn(0, 2);\n  column_set->AddColumn(views::GridLayout::FILL, views::GridLayout::FILL, 1,\n                        views::GridLayout::USE_PREF, 0, 0);\n  column_set->AddPaddingColumn(0, 2);\n\n  layout->AddPaddingRow(0, 2);\n\n  \/\/ Add toolbar buttons and URL address\n  {\n    layout->StartRow(0, 0);\n    toolbar_view_ = new views::View;\n    views::GridLayout* toolbar_layout = new views::GridLayout(toolbar_view_);\n    toolbar_view_->SetLayoutManager(toolbar_layout);\n\n    views::ColumnSet* toolbar_column_set = toolbar_layout->AddColumnSet(0);\n    \/\/ Back button\n    back_button_ = new views::LabelButton(\n        this, l10n_util::GetStringUTF16(IDS_MINIMAL_UI_BACK));\n    back_button_->SetStyle(views::Button::STYLE_BUTTON);\n    gfx::Size back_button_size = back_button_->GetPreferredSize();\n    toolbar_column_set->AddColumn(\n        views::GridLayout::CENTER, views::GridLayout::CENTER, 0,\n        views::GridLayout::FIXED, back_button_size.width(),\n        back_button_size.width() \/ 2);\n    \/\/ Forward button\n    forward_button_ = new views::LabelButton(\n        this, l10n_util::GetStringUTF16(IDS_MINIMAL_UI_FORWARD));\n    forward_button_->SetStyle(views::Button::STYLE_BUTTON);\n    gfx::Size forward_button_size = forward_button_->GetPreferredSize();\n    toolbar_column_set->AddColumn(\n        views::GridLayout::CENTER, views::GridLayout::CENTER, 0,\n        views::GridLayout::FIXED, forward_button_size.width(),\n        forward_button_size.width() \/ 2);\n    \/\/ Refresh button\n    refresh_button_ = new views::LabelButton(\n        this, l10n_util::GetStringUTF16(IDS_MINIMAL_UI_REFRESH));\n    refresh_button_->SetStyle(views::Button::STYLE_BUTTON);\n    gfx::Size refresh_button_size = refresh_button_->GetPreferredSize();\n    toolbar_column_set->AddColumn(\n        views::GridLayout::CENTER, views::GridLayout::CENTER, 0,\n        views::GridLayout::FIXED, refresh_button_size.width(),\n        refresh_button_size.width() \/ 2);\n    \/\/ Stop button\n    stop_button_ = new views::LabelButton(\n        this, l10n_util::GetStringUTF16(IDS_MINIMAL_UI_STOP));\n    stop_button_->SetStyle(views::Button::STYLE_BUTTON);\n    gfx::Size stop_button_size = stop_button_->GetPreferredSize();\n    toolbar_column_set->AddColumn(\n        views::GridLayout::CENTER, views::GridLayout::CENTER, 0,\n        views::GridLayout::FIXED, stop_button_size.width(),\n        stop_button_size.width() \/ 2);\n    toolbar_column_set->AddPaddingColumn(0, 2);\n    \/\/ URL entry\n    address_bar_ = new AddressView();\n    toolbar_column_set->AddColumn(views::GridLayout::FILL,\n                                  views::GridLayout::FILL, 1,\n                                  views::GridLayout::USE_PREF, 0, 0);\n    toolbar_column_set->AddPaddingColumn(0, 2);\n\n    \/\/ Fill up the first row\n    toolbar_layout->StartRow(0, 0);\n    toolbar_layout->AddView(back_button_);\n    toolbar_layout->AddView(forward_button_);\n    toolbar_layout->AddView(refresh_button_);\n    toolbar_layout->AddView(stop_button_);\n    toolbar_layout->AddView(address_bar_);\n\n    layout->AddView(toolbar_view_);\n  }\n\n  layout->AddPaddingRow(0, 5);\n\n  \/\/ Add web contents view as the second row\n  {\n    contents_view_ = new views::View;\n    contents_view_->SetLayoutManager(new views::FillLayout());\n\n    web_view_ = new views::WebView(NULL);\n    web_view_->SetWebContents(web_contents_);\n    AddChildView(web_view_);\n    contents_view_->AddChildView(web_view_);\n    layout->StartRow(1, 0);\n    layout->AddView(contents_view_);\n\n    address_bar_->SetText(\n        base::ASCIIToUTF16(web_contents_->GetVisibleURL().spec()));\n  }\n\n  layout->AddPaddingRow(0, 5);\n}\n\nvoid NativeAppWindowDesktop::ButtonPressed(views::Button* sender,\n                                           const ui::Event& event) {\n  if (sender == back_button_)\n    delegate_->OnBackPressed();\n  else if (sender == forward_button_)\n    delegate_->OnForwardPressed();\n  else if (sender == refresh_button_)\n    delegate_->OnReloadPressed();\n  else if (sender == stop_button_)\n    delegate_->OnStopPressed();\n  else\n    NOTREACHED();\n}\n\nvoid NativeAppWindowDesktop::SetLoadProgress(double progress) {\n  if (toolbar_view_) {\n    DCHECK(address_bar_);\n    address_bar_->SetProgress(progress);\n  }\n}\n\nvoid NativeAppWindowDesktop::SetAddressURL(const std::string& url) {\n  if (toolbar_view_) {\n    DCHECK(address_bar_);\n    address_bar_->SetText(base::ASCIIToUTF16(url));\n  }\n}\n\n}  \/\/ namespace xwalk\n<commit_msg>Fix DCHECK failure on desktop minimal-UI.<commit_after>\/\/ Copyright 2013 The Chromium Authors. All rights reserved.\n\/\/ Copyright (c) 2015 Intel Corporation. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"xwalk\/runtime\/browser\/ui\/native_app_window_desktop.h\"\n\n#include \"base\/strings\/utf_string_conversions.h\"\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"grit\/xwalk_strings.h\"\n#include \"third_party\/skia\/include\/core\/SkPaint.h\"\n#include \"ui\/base\/l10n\/l10n_util.h\"\n#include \"ui\/views\/controls\/webview\/webview.h\"\n#include \"ui\/gfx\/canvas.h\"\n#include \"ui\/views\/background.h\"\n#include \"ui\/views\/controls\/button\/label_button.h\"\n#include \"ui\/views\/layout\/grid_layout.h\"\n#include \"ui\/views\/layout\/fill_layout.h\"\n#include \"xwalk\/runtime\/browser\/ui\/top_view_layout_views.h\"\n\nnamespace xwalk {\n\nclass NativeAppWindowDesktop::AddressView : public views::Label {\n public:\n  AddressView()\n    : progress_(0) {\n  }\n  ~AddressView() override {}\n\n  void SetProgress(double progress) {\n    DCHECK(progress >= 0 && progress <= 1);\n    progress_ = progress;\n    SchedulePaint();\n  }\n\n private:\n  void OnPaint(gfx::Canvas* canvas) override {\n    static const SkColor bg_color = SkColorSetARGB(128, 86, 167, 247);\n    gfx::Rect content_bounds = GetContentsBounds();\n    int bar_left = content_bounds.x();\n    int bar_top = content_bounds.y();\n    int bar_width = content_bounds.width();\n    int bar_height = content_bounds.height();\n\n    SkPath path;\n    path.addRect(bar_left, bar_top + 2, bar_width * progress_, bar_height - 2);\n    SkPaint paint;\n    paint.setStyle(SkPaint::kFill_Style);\n    paint.setFlags(SkPaint::kAntiAlias_Flag);\n    paint.setColor(bg_color);\n    canvas->DrawPath(path, paint);\n\n    views::Label::OnPaint(canvas);\n  }\n\n  double progress_;\n};\n\nNativeAppWindowDesktop::NativeAppWindowDesktop(\n    const NativeAppWindow::CreateParams& create_params)\n    : NativeAppWindowViews(create_params),\n      toolbar_view_(nullptr),\n      back_button_(nullptr),\n      forward_button_(nullptr),\n      refresh_button_(nullptr),\n      stop_button_(nullptr),\n      address_bar_(nullptr) {\n}\n\nNativeAppWindowDesktop::~NativeAppWindowDesktop() {\n}\n\nvoid NativeAppWindowDesktop::ViewHierarchyChanged(\n    const ViewHierarchyChangedDetails& details) {\n  if (details.is_add && details.child == this) {\n    if (create_params().mode == blink::WebDisplayModeMinimalUi)\n      InitMinimalUI();\n    else\n      InitStandaloneUI();\n  }\n}\n\nvoid NativeAppWindowDesktop::InitStandaloneUI() {\n  TopViewLayout* layout = new TopViewLayout();\n  SetLayoutManager(layout);\n\n  web_view_ = new views::WebView(NULL);\n  web_view_->SetWebContents(web_contents_);\n  AddChildView(web_view_);\n  layout->set_content_view(web_view_);\n}\n\nvoid NativeAppWindowDesktop::InitMinimalUI() {\n  set_background(views::Background::CreateStandardPanelBackground());\n  views::GridLayout* layout = new views::GridLayout(this);\n  SetLayoutManager(layout);\n\n  views::ColumnSet* column_set = layout->AddColumnSet(0);\n  column_set->AddPaddingColumn(0, 2);\n  column_set->AddColumn(views::GridLayout::FILL, views::GridLayout::FILL, 1,\n                        views::GridLayout::USE_PREF, 0, 0);\n  column_set->AddPaddingColumn(0, 2);\n\n  layout->AddPaddingRow(0, 2);\n\n  \/\/ Add toolbar buttons and URL address\n  {\n    layout->StartRow(0, 0);\n    toolbar_view_ = new views::View;\n    views::GridLayout* toolbar_layout = new views::GridLayout(toolbar_view_);\n    toolbar_view_->SetLayoutManager(toolbar_layout);\n\n    views::ColumnSet* toolbar_column_set = toolbar_layout->AddColumnSet(0);\n    \/\/ Back button\n    back_button_ = new views::LabelButton(\n        this, l10n_util::GetStringUTF16(IDS_MINIMAL_UI_BACK));\n    back_button_->SetStyle(views::Button::STYLE_BUTTON);\n    gfx::Size back_button_size = back_button_->GetPreferredSize();\n    toolbar_column_set->AddColumn(\n        views::GridLayout::CENTER, views::GridLayout::CENTER, 0,\n        views::GridLayout::FIXED, back_button_size.width(),\n        back_button_size.width() \/ 2);\n    \/\/ Forward button\n    forward_button_ = new views::LabelButton(\n        this, l10n_util::GetStringUTF16(IDS_MINIMAL_UI_FORWARD));\n    forward_button_->SetStyle(views::Button::STYLE_BUTTON);\n    gfx::Size forward_button_size = forward_button_->GetPreferredSize();\n    toolbar_column_set->AddColumn(\n        views::GridLayout::CENTER, views::GridLayout::CENTER, 0,\n        views::GridLayout::FIXED, forward_button_size.width(),\n        forward_button_size.width() \/ 2);\n    \/\/ Refresh button\n    refresh_button_ = new views::LabelButton(\n        this, l10n_util::GetStringUTF16(IDS_MINIMAL_UI_REFRESH));\n    refresh_button_->SetStyle(views::Button::STYLE_BUTTON);\n    gfx::Size refresh_button_size = refresh_button_->GetPreferredSize();\n    toolbar_column_set->AddColumn(\n        views::GridLayout::CENTER, views::GridLayout::CENTER, 0,\n        views::GridLayout::FIXED, refresh_button_size.width(),\n        refresh_button_size.width() \/ 2);\n    \/\/ Stop button\n    stop_button_ = new views::LabelButton(\n        this, l10n_util::GetStringUTF16(IDS_MINIMAL_UI_STOP));\n    stop_button_->SetStyle(views::Button::STYLE_BUTTON);\n    gfx::Size stop_button_size = stop_button_->GetPreferredSize();\n    toolbar_column_set->AddColumn(\n        views::GridLayout::CENTER, views::GridLayout::CENTER, 0,\n        views::GridLayout::FIXED, stop_button_size.width(),\n        stop_button_size.width() \/ 2);\n    toolbar_column_set->AddPaddingColumn(0, 2);\n    \/\/ URL entry\n    address_bar_ = new AddressView();\n    toolbar_column_set->AddColumn(views::GridLayout::FILL,\n                                  views::GridLayout::FILL, 1,\n                                  views::GridLayout::USE_PREF, 0, 0);\n    toolbar_column_set->AddPaddingColumn(0, 2);\n\n    \/\/ Fill up the first row\n    toolbar_layout->StartRow(0, 0);\n    toolbar_layout->AddView(back_button_);\n    toolbar_layout->AddView(forward_button_);\n    toolbar_layout->AddView(refresh_button_);\n    toolbar_layout->AddView(stop_button_);\n    toolbar_layout->AddView(address_bar_);\n\n    layout->AddView(toolbar_view_);\n  }\n\n  layout->AddPaddingRow(0, 5);\n\n  \/\/ Add web contents view as the second row\n  {\n    contents_view_ = new views::View;\n    contents_view_->SetLayoutManager(new views::FillLayout());\n\n    web_view_ = new views::WebView(NULL);\n    web_view_->SetWebContents(web_contents_);\n    contents_view_->AddChildView(web_view_);\n    layout->StartRow(1, 0);\n    layout->AddView(contents_view_);\n\n    address_bar_->SetText(\n        base::ASCIIToUTF16(web_contents_->GetVisibleURL().spec()));\n  }\n\n  layout->AddPaddingRow(0, 5);\n}\n\nvoid NativeAppWindowDesktop::ButtonPressed(views::Button* sender,\n                                           const ui::Event& event) {\n  if (sender == back_button_)\n    delegate_->OnBackPressed();\n  else if (sender == forward_button_)\n    delegate_->OnForwardPressed();\n  else if (sender == refresh_button_)\n    delegate_->OnReloadPressed();\n  else if (sender == stop_button_)\n    delegate_->OnStopPressed();\n  else\n    NOTREACHED();\n}\n\nvoid NativeAppWindowDesktop::SetLoadProgress(double progress) {\n  if (toolbar_view_) {\n    DCHECK(address_bar_);\n    address_bar_->SetProgress(progress);\n  }\n}\n\nvoid NativeAppWindowDesktop::SetAddressURL(const std::string& url) {\n  if (toolbar_view_) {\n    DCHECK(address_bar_);\n    address_bar_->SetText(base::ASCIIToUTF16(url));\n  }\n}\n\n}  \/\/ namespace xwalk\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 \"gfx\/canvas_skia.h\"\n\n#include <cairo\/cairo.h>\n#include <gtk\/gtk.h>\n#include <pango\/pango.h>\n#include <pango\/pangocairo.h>\n\n#include \"base\/logging.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"gfx\/font.h\"\n#include \"gfx\/gtk_util.h\"\n#include \"gfx\/rect.h\"\n\nnamespace {\n\nconst gunichar kAcceleratorChar = '&';\n\n\/\/ Font settings that we initialize once and then use when drawing text in\n\/\/ DrawStringInt().\nstatic cairo_font_options_t* cairo_font_options = NULL;\n\n\/\/ Update |cairo_font_options| based on GtkSettings, allocating it if needed.\nstatic void UpdateCairoFontOptions() {\n  if (!cairo_font_options)\n    cairo_font_options = cairo_font_options_create();\n\n  GtkSettings* gtk_settings = gtk_settings_get_default();\n  gint antialias = 0;\n  gint hinting = 0;\n  gchar* hint_style = NULL;\n  gchar* rgba_style = NULL;\n  g_object_get(gtk_settings,\n               \"gtk-xft-antialias\", &antialias,\n               \"gtk-xft-hinting\", &hinting,\n               \"gtk-xft-hintstyle\", &hint_style,\n               \"gtk-xft-rgba\", &rgba_style,\n               NULL);\n\n  \/\/ g_object_get() doesn't tell us whether the properties were present or not,\n  \/\/ but if they aren't (because gnome-settings-daemon isn't running), we'll get\n  \/\/ NULL values for the strings.\n  if (hint_style && rgba_style) {\n    if (!antialias) {\n      cairo_font_options_set_antialias(cairo_font_options,\n                                       CAIRO_ANTIALIAS_NONE);\n    } else if (strcmp(rgba_style, \"none\") == 0) {\n      cairo_font_options_set_antialias(cairo_font_options,\n                                       CAIRO_ANTIALIAS_GRAY);\n    } else {\n      cairo_font_options_set_antialias(cairo_font_options,\n                                       CAIRO_ANTIALIAS_SUBPIXEL);\n      cairo_subpixel_order_t cairo_subpixel_order =\n          CAIRO_SUBPIXEL_ORDER_DEFAULT;\n      if (strcmp(rgba_style, \"rgb\") == 0) {\n        cairo_subpixel_order = CAIRO_SUBPIXEL_ORDER_RGB;\n      } else if (strcmp(rgba_style, \"bgr\") == 0) {\n        cairo_subpixel_order = CAIRO_SUBPIXEL_ORDER_BGR;\n      } else if (strcmp(rgba_style, \"vrgb\") == 0) {\n        cairo_subpixel_order = CAIRO_SUBPIXEL_ORDER_VRGB;\n      } else if (strcmp(rgba_style, \"vbgr\") == 0) {\n        cairo_subpixel_order = CAIRO_SUBPIXEL_ORDER_VBGR;\n      }\n      cairo_font_options_set_subpixel_order(cairo_font_options,\n                                            cairo_subpixel_order);\n    }\n\n    cairo_hint_style_t cairo_hint_style = CAIRO_HINT_STYLE_DEFAULT;\n    if (hinting == 0 || strcmp(hint_style, \"hintnone\") == 0) {\n      cairo_hint_style = CAIRO_HINT_STYLE_NONE;\n    } else if (strcmp(hint_style, \"hintslight\") == 0) {\n      cairo_hint_style = CAIRO_HINT_STYLE_SLIGHT;\n    } else if (strcmp(hint_style, \"hintmedium\") == 0) {\n      cairo_hint_style = CAIRO_HINT_STYLE_MEDIUM;\n    } else if (strcmp(hint_style, \"hintfull\") == 0) {\n      cairo_hint_style = CAIRO_HINT_STYLE_FULL;\n    }\n    cairo_font_options_set_hint_style(cairo_font_options, cairo_hint_style);\n  }\n\n  if (hint_style)\n    g_free(hint_style);\n  if (rgba_style)\n    g_free(rgba_style);\n}\n\n}  \/\/ namespace\n\nnamespace gfx {\n\nCanvasSkia::CanvasSkia(int width, int height, bool is_opaque)\n    : skia::PlatformCanvas(width, height, is_opaque) {\n}\n\nCanvasSkia::CanvasSkia() : skia::PlatformCanvas() {\n}\n\nCanvasSkia::~CanvasSkia() {\n}\n\n\/\/ Pass a width > 0 to force wrapping and elliding.\nstatic void SetupPangoLayout(PangoLayout* layout,\n                             const std::wstring& text,\n                             const gfx::Font& font,\n                             int width,\n                             int flags) {\n  if (!cairo_font_options)\n    UpdateCairoFontOptions();\n  \/\/ This needs to be done early on; it has no effect when called just before\n  \/\/ pango_cairo_show_layout().\n  pango_cairo_context_set_font_options(\n      pango_layout_get_context(layout), cairo_font_options);\n\n  \/\/ Callers of DrawStringInt handle RTL layout themselves, so tell pango to not\n  \/\/ scope out RTL characters.\n  pango_layout_set_auto_dir(layout, FALSE);\n\n  if (width > 0)\n    pango_layout_set_width(layout, width * PANGO_SCALE);\n\n  if (flags & Canvas::NO_ELLIPSIS) {\n    pango_layout_set_ellipsize(layout, PANGO_ELLIPSIZE_NONE);\n  } else {\n    pango_layout_set_ellipsize(layout, PANGO_ELLIPSIZE_END);\n  }\n\n  if (flags & Canvas::TEXT_ALIGN_CENTER) {\n    pango_layout_set_alignment(layout, PANGO_ALIGN_CENTER);\n  } else if (flags & Canvas::TEXT_ALIGN_RIGHT) {\n    pango_layout_set_alignment(layout, PANGO_ALIGN_RIGHT);\n  }\n\n  if (flags & Canvas::MULTI_LINE) {\n    pango_layout_set_wrap(layout,\n        (flags & Canvas::CHARACTER_BREAK) ?\n            PANGO_WRAP_WORD_CHAR : PANGO_WRAP_WORD);\n  }\n\n  \/\/ Set the resolution to match that used by Gtk. If we don't set the\n  \/\/ resolution and the resolution differs from the default, Gtk and Chrome end\n  \/\/ up drawing at different sizes.\n  double resolution = gfx::GetPangoResolution();\n  if (resolution > 0) {\n    pango_cairo_context_set_resolution(pango_layout_get_context(layout),\n                                       resolution);\n  }\n\n  PangoFontDescription* desc = gfx::Font::PangoFontFromGfxFont(font);\n  pango_layout_set_font_description(layout, desc);\n  pango_font_description_free(desc);\n\n  \/\/ Set text and accelerator character if needed.\n  std::string utf8 = WideToUTF8(text);\n  if (flags & gfx::Canvas::HIDE_PREFIX) {\n    \/\/ Escape the text string to be used as markup.\n    gchar* escaped_text = g_markup_escape_text(utf8.c_str(), utf8.size());\n    pango_layout_set_markup_with_accel(layout,\n                                       escaped_text,\n                                       strlen(escaped_text),\n                                       kAcceleratorChar, NULL);\n    g_free(escaped_text);\n  } else {\n    pango_layout_set_text(layout, utf8.data(), utf8.size());\n  }\n}\n\n\/\/ static\nvoid CanvasSkia::SizeStringInt(const std::wstring& text,\n                               const gfx::Font& font,\n                               int* width, int* height, int flags) {\n  int org_width = *width;\n  cairo_surface_t* surface =\n      cairo_image_surface_create(CAIRO_FORMAT_ARGB32, 0, 0);\n  cairo_t* cr = cairo_create(surface);\n  PangoLayout* layout = pango_cairo_create_layout(cr);\n\n  SetupPangoLayout(layout, text, font, *width, flags);\n\n  pango_layout_get_pixel_size(layout, width, height);\n\n  if (org_width > 0 && flags & Canvas::MULTI_LINE &&\n      pango_layout_is_wrapped(layout)) {\n    \/\/ The text wrapped. There seems to be a bug in Pango when this happens\n    \/\/ such that the width returned from pango_layout_get_pixel_size is too\n    \/\/ small. Using the width from pango_layout_get_pixel_size in this case\n    \/\/ results in wrapping across more lines, which requires a bigger height.\n    \/\/ As a workaround we use the original width, which is not necessarily\n    \/\/ exactly correct, but isn't wrong by much.\n    \/\/\n    \/\/ It looks like Pango uses the size of whitespace in calculating wrapping\n    \/\/ but doesn't include the size of the whitespace when the extents are\n    \/\/ asked for. See the loop in pango-layout.c process_item that determines\n    \/\/ where to wrap.\n    *width = org_width;\n  }\n\n  g_object_unref(layout);\n  cairo_destroy(cr);\n  cairo_surface_destroy(surface);\n}\n\nvoid CanvasSkia::DrawStringInt(const std::wstring& text,\n                               const gfx::Font& font,\n                               const SkColor& color,\n                               int x, int y, int w, int h,\n                               int flags) {\n  if (w <= 0 || h <= 0)\n    return;\n\n  cairo_t* cr = beginPlatformPaint();\n  PangoLayout* layout = pango_cairo_create_layout(cr);\n\n  SetupPangoLayout(layout, text, font, w, flags);\n\n  pango_layout_set_height(layout, h * PANGO_SCALE);\n\n  cairo_save(cr);\n  cairo_set_source_rgba(cr,\n                        SkColorGetR(color) \/ 255.0,\n                        SkColorGetG(color) \/ 255.0,\n                        SkColorGetB(color) \/ 255.0,\n                        SkColorGetA(color) \/ 255.0);\n\n  int width, height;\n  pango_layout_get_pixel_size(layout, &width, &height);\n\n  cairo_rectangle(cr, x, y, w, h);\n  cairo_clip(cr);\n\n  if (flags & Canvas::TEXT_VALIGN_TOP) {\n    \/\/ Cairo should draw from the top left corner already.\n  } else if (flags & Canvas::TEXT_VALIGN_BOTTOM) {\n    y += (h - height);\n  } else {\n    \/\/ Vertically centered.\n    y += ((h - height) \/ 2);\n  }\n\n  cairo_move_to(cr, x, y);\n  pango_cairo_show_layout(cr, layout);\n  if (font.style() & gfx::Font::UNDERLINED) {\n    double underline_y =\n        static_cast<double>(y) + height + font.underline_position();\n    cairo_set_line_width(cr, font.underline_thickness());\n    cairo_move_to(cr, x, underline_y);\n    cairo_line_to(cr, x + width, underline_y);\n    cairo_stroke(cr);\n  }\n  cairo_restore(cr);\n\n  g_object_unref(layout);\n  \/\/ NOTE: beginPlatformPaint returned its surface, we shouldn't destroy it.\n}\n\nvoid CanvasSkia::DrawGdkPixbuf(GdkPixbuf* pixbuf, int x, int y) {\n  if (!pixbuf) {\n    NOTREACHED();\n    return;\n  }\n\n  cairo_t* cr = beginPlatformPaint();\n  gdk_cairo_set_source_pixbuf(cr, pixbuf, x, y);\n  cairo_paint(cr);\n}\n\n}  \/\/ namespace gfx\n<commit_msg>Fixes bug in showing accelerators where on views\/gtk where we would incorrectly show the ampersand character in some situations, and in others show the underline when we shouldn't have.<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 \"gfx\/canvas_skia.h\"\n\n#include <cairo\/cairo.h>\n#include <gtk\/gtk.h>\n#include <pango\/pango.h>\n#include <pango\/pangocairo.h>\n\n#include \"base\/logging.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"gfx\/font.h\"\n#include \"gfx\/gtk_util.h\"\n#include \"gfx\/rect.h\"\n\nnamespace {\n\nconst gunichar kAcceleratorChar = '&';\n\n\/\/ Font settings that we initialize once and then use when drawing text in\n\/\/ DrawStringInt().\nstatic cairo_font_options_t* cairo_font_options = NULL;\n\n\/\/ Update |cairo_font_options| based on GtkSettings, allocating it if needed.\nstatic void UpdateCairoFontOptions() {\n  if (!cairo_font_options)\n    cairo_font_options = cairo_font_options_create();\n\n  GtkSettings* gtk_settings = gtk_settings_get_default();\n  gint antialias = 0;\n  gint hinting = 0;\n  gchar* hint_style = NULL;\n  gchar* rgba_style = NULL;\n  g_object_get(gtk_settings,\n               \"gtk-xft-antialias\", &antialias,\n               \"gtk-xft-hinting\", &hinting,\n               \"gtk-xft-hintstyle\", &hint_style,\n               \"gtk-xft-rgba\", &rgba_style,\n               NULL);\n\n  \/\/ g_object_get() doesn't tell us whether the properties were present or not,\n  \/\/ but if they aren't (because gnome-settings-daemon isn't running), we'll get\n  \/\/ NULL values for the strings.\n  if (hint_style && rgba_style) {\n    if (!antialias) {\n      cairo_font_options_set_antialias(cairo_font_options,\n                                       CAIRO_ANTIALIAS_NONE);\n    } else if (strcmp(rgba_style, \"none\") == 0) {\n      cairo_font_options_set_antialias(cairo_font_options,\n                                       CAIRO_ANTIALIAS_GRAY);\n    } else {\n      cairo_font_options_set_antialias(cairo_font_options,\n                                       CAIRO_ANTIALIAS_SUBPIXEL);\n      cairo_subpixel_order_t cairo_subpixel_order =\n          CAIRO_SUBPIXEL_ORDER_DEFAULT;\n      if (strcmp(rgba_style, \"rgb\") == 0) {\n        cairo_subpixel_order = CAIRO_SUBPIXEL_ORDER_RGB;\n      } else if (strcmp(rgba_style, \"bgr\") == 0) {\n        cairo_subpixel_order = CAIRO_SUBPIXEL_ORDER_BGR;\n      } else if (strcmp(rgba_style, \"vrgb\") == 0) {\n        cairo_subpixel_order = CAIRO_SUBPIXEL_ORDER_VRGB;\n      } else if (strcmp(rgba_style, \"vbgr\") == 0) {\n        cairo_subpixel_order = CAIRO_SUBPIXEL_ORDER_VBGR;\n      }\n      cairo_font_options_set_subpixel_order(cairo_font_options,\n                                            cairo_subpixel_order);\n    }\n\n    cairo_hint_style_t cairo_hint_style = CAIRO_HINT_STYLE_DEFAULT;\n    if (hinting == 0 || strcmp(hint_style, \"hintnone\") == 0) {\n      cairo_hint_style = CAIRO_HINT_STYLE_NONE;\n    } else if (strcmp(hint_style, \"hintslight\") == 0) {\n      cairo_hint_style = CAIRO_HINT_STYLE_SLIGHT;\n    } else if (strcmp(hint_style, \"hintmedium\") == 0) {\n      cairo_hint_style = CAIRO_HINT_STYLE_MEDIUM;\n    } else if (strcmp(hint_style, \"hintfull\") == 0) {\n      cairo_hint_style = CAIRO_HINT_STYLE_FULL;\n    }\n    cairo_font_options_set_hint_style(cairo_font_options, cairo_hint_style);\n  }\n\n  if (hint_style)\n    g_free(hint_style);\n  if (rgba_style)\n    g_free(rgba_style);\n}\n\n\/\/ TODO(sky): this is a copy of the one in gtk_util. It needs to be moved to a\n\/\/ common place.\n\/\/ Common implementation of ConvertAcceleratorsFromWindowsStyle() and\n\/\/ RemoveWindowsStyleAccelerators().\n\/\/ Replaces all ampersands (as used in our grd files to indicate mnemonics)\n\/\/ to |target|. Similarly any underscores get replaced with two underscores as\n\/\/ is needed by pango.\nstd::string ConvertAmperstandsTo(const std::string& label,\n                                 const std::string& target) {\n  std::string ret;\n  ret.reserve(label.length() * 2);\n  for (size_t i = 0; i < label.length(); ++i) {\n    if ('_' == label[i]) {\n      ret.push_back('_');\n      ret.push_back('_');\n    } else if ('&' == label[i]) {\n      if (i + 1 < label.length() && '&' == label[i + 1]) {\n        ret.push_back('&');\n        ++i;\n      } else {\n        ret.append(target);\n      }\n    } else {\n      ret.push_back(label[i]);\n    }\n  }\n\n  return ret;\n}\n\n}  \/\/ namespace\n\nnamespace gfx {\n\nCanvasSkia::CanvasSkia(int width, int height, bool is_opaque)\n    : skia::PlatformCanvas(width, height, is_opaque) {\n}\n\nCanvasSkia::CanvasSkia() : skia::PlatformCanvas() {\n}\n\nCanvasSkia::~CanvasSkia() {\n}\n\n\/\/ Pass a width > 0 to force wrapping and elliding.\nstatic void SetupPangoLayout(PangoLayout* layout,\n                             const std::wstring& text,\n                             const gfx::Font& font,\n                             int width,\n                             int flags) {\n  if (!cairo_font_options)\n    UpdateCairoFontOptions();\n  \/\/ This needs to be done early on; it has no effect when called just before\n  \/\/ pango_cairo_show_layout().\n  pango_cairo_context_set_font_options(\n      pango_layout_get_context(layout), cairo_font_options);\n\n  \/\/ Callers of DrawStringInt handle RTL layout themselves, so tell pango to not\n  \/\/ scope out RTL characters.\n  pango_layout_set_auto_dir(layout, FALSE);\n\n  if (width > 0)\n    pango_layout_set_width(layout, width * PANGO_SCALE);\n\n  if (flags & Canvas::NO_ELLIPSIS) {\n    pango_layout_set_ellipsize(layout, PANGO_ELLIPSIZE_NONE);\n  } else {\n    pango_layout_set_ellipsize(layout, PANGO_ELLIPSIZE_END);\n  }\n\n  if (flags & Canvas::TEXT_ALIGN_CENTER) {\n    pango_layout_set_alignment(layout, PANGO_ALIGN_CENTER);\n  } else if (flags & Canvas::TEXT_ALIGN_RIGHT) {\n    pango_layout_set_alignment(layout, PANGO_ALIGN_RIGHT);\n  }\n\n  if (flags & Canvas::MULTI_LINE) {\n    pango_layout_set_wrap(layout,\n        (flags & Canvas::CHARACTER_BREAK) ?\n            PANGO_WRAP_WORD_CHAR : PANGO_WRAP_WORD);\n  }\n\n  \/\/ Set the resolution to match that used by Gtk. If we don't set the\n  \/\/ resolution and the resolution differs from the default, Gtk and Chrome end\n  \/\/ up drawing at different sizes.\n  double resolution = gfx::GetPangoResolution();\n  if (resolution > 0) {\n    pango_cairo_context_set_resolution(pango_layout_get_context(layout),\n                                       resolution);\n  }\n\n  PangoFontDescription* desc = gfx::Font::PangoFontFromGfxFont(font);\n  pango_layout_set_font_description(layout, desc);\n  pango_font_description_free(desc);\n\n  \/\/ Set text and accelerator character if needed.\n  std::string utf8 = WideToUTF8(text);\n  if (flags & gfx::Canvas::SHOW_PREFIX) {\n    \/\/ Escape the text string to be used as markup.\n    gchar* escaped_text = g_markup_escape_text(utf8.c_str(), utf8.size());\n    pango_layout_set_markup_with_accel(layout,\n                                       escaped_text,\n                                       strlen(escaped_text),\n                                       kAcceleratorChar, NULL);\n    g_free(escaped_text);\n  } else if (flags & gfx::Canvas::HIDE_PREFIX) {\n    \/\/ Remove the ampersand character.\n    utf8 = ConvertAmperstandsTo(utf8, \"\");\n    pango_layout_set_text(layout, utf8.data(), utf8.size());\n  } else {\n    pango_layout_set_text(layout, utf8.data(), utf8.size());\n  }\n}\n\n\/\/ static\nvoid CanvasSkia::SizeStringInt(const std::wstring& text,\n                               const gfx::Font& font,\n                               int* width, int* height, int flags) {\n  int org_width = *width;\n  cairo_surface_t* surface =\n      cairo_image_surface_create(CAIRO_FORMAT_ARGB32, 0, 0);\n  cairo_t* cr = cairo_create(surface);\n  PangoLayout* layout = pango_cairo_create_layout(cr);\n\n  SetupPangoLayout(layout, text, font, *width, flags);\n\n  pango_layout_get_pixel_size(layout, width, height);\n\n  if (org_width > 0 && flags & Canvas::MULTI_LINE &&\n      pango_layout_is_wrapped(layout)) {\n    \/\/ The text wrapped. There seems to be a bug in Pango when this happens\n    \/\/ such that the width returned from pango_layout_get_pixel_size is too\n    \/\/ small. Using the width from pango_layout_get_pixel_size in this case\n    \/\/ results in wrapping across more lines, which requires a bigger height.\n    \/\/ As a workaround we use the original width, which is not necessarily\n    \/\/ exactly correct, but isn't wrong by much.\n    \/\/\n    \/\/ It looks like Pango uses the size of whitespace in calculating wrapping\n    \/\/ but doesn't include the size of the whitespace when the extents are\n    \/\/ asked for. See the loop in pango-layout.c process_item that determines\n    \/\/ where to wrap.\n    *width = org_width;\n  }\n\n  g_object_unref(layout);\n  cairo_destroy(cr);\n  cairo_surface_destroy(surface);\n}\n\nvoid CanvasSkia::DrawStringInt(const std::wstring& text,\n                               const gfx::Font& font,\n                               const SkColor& color,\n                               int x, int y, int w, int h,\n                               int flags) {\n  if (w <= 0 || h <= 0)\n    return;\n\n  cairo_t* cr = beginPlatformPaint();\n  PangoLayout* layout = pango_cairo_create_layout(cr);\n\n  SetupPangoLayout(layout, text, font, w, flags);\n\n  pango_layout_set_height(layout, h * PANGO_SCALE);\n\n  cairo_save(cr);\n  cairo_set_source_rgba(cr,\n                        SkColorGetR(color) \/ 255.0,\n                        SkColorGetG(color) \/ 255.0,\n                        SkColorGetB(color) \/ 255.0,\n                        SkColorGetA(color) \/ 255.0);\n\n  int width, height;\n  pango_layout_get_pixel_size(layout, &width, &height);\n\n  cairo_rectangle(cr, x, y, w, h);\n  cairo_clip(cr);\n\n  if (flags & Canvas::TEXT_VALIGN_TOP) {\n    \/\/ Cairo should draw from the top left corner already.\n  } else if (flags & Canvas::TEXT_VALIGN_BOTTOM) {\n    y += (h - height);\n  } else {\n    \/\/ Vertically centered.\n    y += ((h - height) \/ 2);\n  }\n\n  cairo_move_to(cr, x, y);\n  pango_cairo_show_layout(cr, layout);\n  if (font.style() & gfx::Font::UNDERLINED) {\n    double underline_y =\n        static_cast<double>(y) + height + font.underline_position();\n    cairo_set_line_width(cr, font.underline_thickness());\n    cairo_move_to(cr, x, underline_y);\n    cairo_line_to(cr, x + width, underline_y);\n    cairo_stroke(cr);\n  }\n  cairo_restore(cr);\n\n  g_object_unref(layout);\n  \/\/ NOTE: beginPlatformPaint returned its surface, we shouldn't destroy it.\n}\n\nvoid CanvasSkia::DrawGdkPixbuf(GdkPixbuf* pixbuf, int x, int y) {\n  if (!pixbuf) {\n    NOTREACHED();\n    return;\n  }\n\n  cairo_t* cr = beginPlatformPaint();\n  gdk_cairo_set_source_pixbuf(cr, pixbuf, x, y);\n  cairo_paint(cr);\n}\n\n}  \/\/ namespace gfx\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_frame\/test\/test_mock_with_web_server.h\"\n\n#include \"base\/scoped_variant_win.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome_frame\/test\/simulate_input.h\"\n#include \"chrome_frame\/test\/test_with_web_server.h\"\n\nusing chrome_frame_test::CloseIeAtEndOfScope;\nusing chrome_frame_test::ComStackObjectWithUninitialize;\nusing chrome_frame_test::kChromeFrameLongNavigationTimeoutInSeconds;\nusing testing::_;\n\nnamespace {\n\n\/\/ The same as MockWebBrowserEventSink, except OnDocumentComplete is added.\n\/\/ This class can be merged with its base class, but it would require some\n\/\/ modification to most of the test cases.\nclass MockWebBrowserEventSink\n    : public chrome_frame_test::MockWebBrowserEventSink {\n public:\n  \/\/ This method is called for each OnDocumentComplete event in which the\n  \/\/ document is rendered by IE and not CF.\n  MOCK_METHOD1(OnIELoad, void (const wchar_t* url));  \/\/ NOLINT\n\n  \/\/ The OnDocumentComplete event is received for every document load,\n  \/\/ regardless of whether IE or CF is hosting. This method will call\n  \/\/ OnIELoad iff the document was loaded in an IE renderer.\n  STDMETHOD_(void, OnDocumentComplete)(IDispatch* dispatch,\n                                       VARIANT* url_variant) {\n    ScopedVariant url;\n    if (url_variant)\n      url.Reset(*url_variant);\n    \/\/ To determine if the document is loaded in IE or CF, check if\n    \/\/ IHTMLDocument2 can be retrieved. If so, call OnIELoad.\n    ScopedComPtr<IWebBrowser2> web_browser2;\n    web_browser2.QueryFrom(dispatch);\n    EXPECT_TRUE(web_browser2);\n    if (web_browser2) {\n      ScopedComPtr<IDispatch> doc_dispatch;\n      HRESULT hr = web_browser2->get_Document(doc_dispatch.Receive());\n      EXPECT_HRESULT_SUCCEEDED(hr);\n      EXPECT_TRUE(doc_dispatch);\n      if (doc_dispatch) {\n        ScopedComPtr<IHTMLDocument2> doc;\n        doc.QueryFrom(doc_dispatch);\n        if (doc) {\n          OnIELoad(V_BSTR(&url));\n        }\n      }\n    }\n  }\n};\n\n\/\/ Fixture for tests which ensure that Chrome Frame does not interfere with\n\/\/ normal IE operation.\n\/\/ TODO(kkania): Move this fixture to test_mock_with_web_server.h and change\n\/\/ those tests to use this too.\nclass NoInterferenceTest : public ChromeFrameTestWithWebServer {\n protected:\n  \/\/ Launches IE and navigates to |url|, then waits until receiving a quit\n  \/\/ message or the timeout is exceeded.\n  void LaunchIEAndNavigate(const std::wstring& url) {\n    EXPECT_CALL(mock_, OnQuit())\n        .Times(testing::AtMost(1))\n        .WillOnce(QUIT_LOOP(loop_));\n    HRESULT hr = mock_.LaunchIEAndNavigate(url);\n    ASSERT_HRESULT_SUCCEEDED(hr);\n    if (hr == S_FALSE)\n      return;\n\n    ASSERT_TRUE(mock_.web_browser2() != NULL);\n    loop_.RunFor(kChromeFrameLongNavigationTimeoutInSeconds);\n    mock_.Uninitialize();\n  }\n\n  const std::wstring GetTestUrl(const wchar_t* relative_path) {\n    std::wstring path = std::wstring(L\"files\/no_interference\/\") +\n        relative_path;\n    return UTF8ToWide(server_.Resolve(path.c_str()).spec());\n  }\n\n  const std::wstring empty_page_url() {\n    return GetTestUrl(L\"empty.html\");\n  }\n\n  \/\/ Returns the url for a page with a single link, which points to the\n  \/\/ empty page.\n  const std::wstring link_page_url() {\n    return GetTestUrl(L\"link.html\");\n  }\n\n  CloseIeAtEndOfScope last_resort_close_ie;\n  chrome_frame_test::TimedMsgLoop loop_;\n  CComObjectStackEx<testing::StrictMock<MockWebBrowserEventSink> > mock_;\n};\n\nACTION_P(ExpectIERendererWindowHasFocus, mock) {\n  mock->ExpectIERendererWindowHasFocus();\n}\n\nACTION_P6(DelaySendMouseClickToIE, mock, loop, delay, x, y, button) {\n  loop->PostDelayedTask(FROM_HERE, NewRunnableMethod(mock,\n      &MockWebBrowserEventSink::SendMouseClickToIE, x, y, button), delay);\n}\n\nACTION_P2(OpenContextMenu, loop, delay) {\n  loop->PostDelayedTask(FROM_HERE, NewRunnableFunction(\n      simulate_input::SendScanCode, VK_F10, simulate_input::SHIFT), delay);\n}\n\nACTION_P3(SelectItem, loop, delay, index) {\n  chrome_frame_test::DelaySendExtendedKeysEnter(loop, delay, VK_DOWN, index + 1,\n      simulate_input::NONE);\n}\n\n\/\/ A new IE renderer window should have focus.\nTEST_F(NoInterferenceTest, FLAKY_SimpleFocus) {\n  mock_.ExpectNavigationInIE(empty_page_url());\n  EXPECT_CALL(mock_, OnIELoad(testing::StrCaseEq(empty_page_url())))\n      .WillOnce(testing::DoAll(\n          ExpectIERendererWindowHasFocus(&mock_),\n          VerifyAddressBarUrl(&mock_),\n          CloseBrowserMock(&mock_)));\n\n  LaunchIEAndNavigate(empty_page_url());\n}\n\n\/\/ Javascript window.open should open a new window with an IE renderer.\nTEST_F(NoInterferenceTest, FLAKY_JavascriptWindowOpen) {\n  const std::wstring kWindowOpenUrl = GetTestUrl(L\"window_open.html\");\n  ComStackObjectWithUninitialize<\n      testing::StrictMock<MockWebBrowserEventSink> > new_window_mock;\n\n  mock_.ExpectNavigationInIE(kWindowOpenUrl);\n  EXPECT_CALL(mock_, OnIELoad(testing::StrCaseEq(kWindowOpenUrl)))\n      .WillOnce(testing::DoAll(\n          DelaySendMouseClickToIE(&mock_, &loop_, 0, 100, 100,\n                                  simulate_input::LEFT),\n          DelaySendMouseClickToIE(&mock_, &loop_, 0, 100, 100,\n                                  simulate_input::LEFT)));\n\n  EXPECT_CALL(mock_, OnNewWindow3(_, _, _, _, _));\n\n  EXPECT_CALL(mock_, OnNewBrowserWindow(_, _))\n      .WillOnce(testing::WithArgs<0>(testing::Invoke(CreateFunctor(\n          &new_window_mock, &MockWebBrowserEventSink::Attach))));\n\n  EXPECT_CALL(new_window_mock, OnBeforeNavigate2(_,\n                  testing::Field(&VARIANT::bstrVal,\n                  testing::StrCaseEq(empty_page_url())),\n                  _, _, _, _, _));\n\n  EXPECT_CALL(new_window_mock, OnFileDownload(VARIANT_TRUE, _))\n      .Times(testing::AnyNumber());\n\n  EXPECT_CALL(new_window_mock, OnNavigateComplete2(_,\n                            testing::Field(&VARIANT::bstrVal,\n                            testing::StrCaseEq(empty_page_url()))))\n      .WillOnce(testing::DoAll(\n          testing::InvokeWithoutArgs(CreateFunctor(&new_window_mock,\n              &chrome_frame_test::MockWebBrowserEventSink::ExpectAddressBarUrl,\n              empty_page_url())),\n          DelayCloseBrowserMock(&loop_, 2000, &new_window_mock)));\n\n  if (chrome_frame_test::GetInstalledIEVersion() != IE_6) {\n    \/\/ On IE7\/8 the DocumentComplete at times fires twice for new windows. Hack\n    \/\/ to account for that.\n    EXPECT_CALL(new_window_mock,\n                OnIELoad(testing::StrCaseEq(empty_page_url())))\n        .Times(testing::AtMost(2));\n  } else {\n    EXPECT_CALL(new_window_mock,\n                OnIELoad(testing::StrCaseEq(empty_page_url())))\n        .Times(1);\n  }\n\n  EXPECT_CALL(new_window_mock, OnQuit())\n      .WillOnce(DelayCloseBrowserMock(&loop_, 2000, &mock_));\n\n  LaunchIEAndNavigate(kWindowOpenUrl);\n}\n\n\/\/ Redirecting with window.location in Javascript should work.\nTEST_F(NoInterferenceTest, JavascriptRedirect) {\n  const std::wstring kRedirectUrl = GetTestUrl(L\"javascript_redirect.html\");\n  mock_.ExpectNavigationInIE(kRedirectUrl);\n  EXPECT_CALL(mock_, OnIELoad(testing::StrCaseEq(kRedirectUrl)))\n      .WillOnce(VerifyAddressBarUrl(&mock_));\n\n  mock_.ExpectNavigationInIE(empty_page_url());\n  EXPECT_CALL(mock_, OnIELoad(testing::StrCaseEq(empty_page_url())))\n      .WillOnce(testing::DoAll(\n          VerifyAddressBarUrl(&mock_),\n          CloseBrowserMock(&mock_)));\n\n  LaunchIEAndNavigate(kRedirectUrl);\n}\n\nTEST_F(NoInterferenceTest, FLAKY_FollowLink) {\n  mock_.ExpectNavigationInIE(link_page_url());\n  EXPECT_CALL(mock_, OnIELoad(testing::StrCaseEq(link_page_url())))\n      .WillOnce(testing::DoAll(\n          DelaySendMouseClickToIE(&mock_, &loop_, 0, 1, 1,\n                                  simulate_input::LEFT),\n          DelaySendScanCode(&loop_, 500, VK_TAB, simulate_input::NONE),\n          DelaySendScanCode(&loop_, 1000, VK_RETURN, simulate_input::NONE)));\n\n  mock_.ExpectNavigationInIE(empty_page_url());\n  EXPECT_CALL(mock_, OnIELoad(testing::StrCaseEq(empty_page_url())))\n      .WillOnce(testing::DoAll(\n          VerifyAddressBarUrl(&mock_),\n          CloseBrowserMock(&mock_)));\n\n  LaunchIEAndNavigate(link_page_url());\n}\n\nTEST_F(NoInterferenceTest, FLAKY_SelectContextMenuOpen) {\n  mock_.ExpectNavigationInIE(link_page_url());\n  \/\/ Focus the renderer window by clicking and then tab once to highlight the\n  \/\/ link.\n  EXPECT_CALL(mock_, OnIELoad(testing::StrCaseEq(link_page_url())))\n      .WillOnce(testing::DoAll(\n          DelaySendMouseClickToIE(&mock_, &loop_, 0, 1, 1,\n                                  simulate_input::LEFT),\n          DelaySendScanCode(&loop_, 500, VK_TAB, simulate_input::NONE),\n          OpenContextMenu(&loop_, 1000),\n          SelectItem(&loop_, 1500, 0)));\n\n  mock_.ExpectNavigationInIE(empty_page_url());\n  EXPECT_CALL(mock_, OnIELoad(testing::StrCaseEq(empty_page_url())))\n      .WillOnce(testing::DoAll(\n          VerifyAddressBarUrl(&mock_),\n          CloseBrowserMock(&mock_)));\n\n  LaunchIEAndNavigate(link_page_url());\n}\n\nTEST_F(NoInterferenceTest, FLAKY_SelectContextMenuOpenInNewWindow) {\n  ComStackObjectWithUninitialize<\n      testing::StrictMock<MockWebBrowserEventSink> > new_window_mock;\n  int open_new_window_index = 2;\n  if (chrome_frame_test::GetInstalledIEVersion() == IE_6)\n    open_new_window_index = 1;\n\n  \/\/ Focus the renderer window by clicking and then tab once to highlight the\n  \/\/ link.\n  mock_.ExpectNavigationInIE(link_page_url());\n  EXPECT_CALL(mock_, OnIELoad(testing::StrCaseEq(link_page_url())))\n      .WillOnce(testing::DoAll(\n          DelaySendMouseClickToIE(&mock_, &loop_, 0, 1, 1,\n                                  simulate_input::LEFT),\n          DelaySendScanCode(&loop_, 500, VK_TAB, simulate_input::NONE),\n          OpenContextMenu(&loop_, 1000),\n          SelectItem(&loop_, 1500, open_new_window_index)));\n\n  mock_.ExpectNewWindowWithIE(empty_page_url(), &new_window_mock);\n  if (chrome_frame_test::GetInstalledIEVersion() != IE_6) {\n    \/\/ On IE6\/7 the DocumentComplete at times fires twice for new windows. Hack\n    \/\/ to account for that.\n    \/\/ TODO(kkania): Verifying the address bar is flaky with this, at least\n    \/\/ on XP ie6. Fix.\n    EXPECT_CALL(new_window_mock,\n                OnIELoad(testing::StrCaseEq(empty_page_url())))\n        .Times(testing::AtMost(2))\n        .WillOnce(DelayCloseBrowserMock(&loop_, 2000, &new_window_mock));\n  } else {\n    \/\/ TODO(kkania): Verifying the address bar is flaky with this, at least\n    \/\/ on XP ie6. Fix.\n    EXPECT_CALL(new_window_mock,\n                OnIELoad(testing::StrCaseEq(empty_page_url())))\n        .WillOnce(DelayCloseBrowserMock(&loop_, 2000, &new_window_mock));\n  }\n\n  EXPECT_CALL(new_window_mock, OnQuit()).WillOnce(CloseBrowserMock(&mock_));\n\n  LaunchIEAndNavigate(link_page_url());\n}\n\n}  \/\/ namespace<commit_msg>Hopefully the last of the ChromeFrame window open test failures. The DocumentComplete event at times is fired twice by all  IE versions for new windows. Updated the expectations to account for this.<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_frame\/test\/test_mock_with_web_server.h\"\n\n#include \"base\/scoped_variant_win.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome_frame\/test\/simulate_input.h\"\n#include \"chrome_frame\/test\/test_with_web_server.h\"\n\nusing chrome_frame_test::CloseIeAtEndOfScope;\nusing chrome_frame_test::ComStackObjectWithUninitialize;\nusing chrome_frame_test::kChromeFrameLongNavigationTimeoutInSeconds;\nusing testing::_;\n\nnamespace {\n\n\/\/ The same as MockWebBrowserEventSink, except OnDocumentComplete is added.\n\/\/ This class can be merged with its base class, but it would require some\n\/\/ modification to most of the test cases.\nclass MockWebBrowserEventSink\n    : public chrome_frame_test::MockWebBrowserEventSink {\n public:\n  \/\/ This method is called for each OnDocumentComplete event in which the\n  \/\/ document is rendered by IE and not CF.\n  MOCK_METHOD1(OnIELoad, void (const wchar_t* url));  \/\/ NOLINT\n\n  \/\/ The OnDocumentComplete event is received for every document load,\n  \/\/ regardless of whether IE or CF is hosting. This method will call\n  \/\/ OnIELoad iff the document was loaded in an IE renderer.\n  STDMETHOD_(void, OnDocumentComplete)(IDispatch* dispatch,\n                                       VARIANT* url_variant) {\n    ScopedVariant url;\n    if (url_variant)\n      url.Reset(*url_variant);\n    \/\/ To determine if the document is loaded in IE or CF, check if\n    \/\/ IHTMLDocument2 can be retrieved. If so, call OnIELoad.\n    ScopedComPtr<IWebBrowser2> web_browser2;\n    web_browser2.QueryFrom(dispatch);\n    EXPECT_TRUE(web_browser2);\n    if (web_browser2) {\n      ScopedComPtr<IDispatch> doc_dispatch;\n      HRESULT hr = web_browser2->get_Document(doc_dispatch.Receive());\n      EXPECT_HRESULT_SUCCEEDED(hr);\n      EXPECT_TRUE(doc_dispatch);\n      if (doc_dispatch) {\n        ScopedComPtr<IHTMLDocument2> doc;\n        doc.QueryFrom(doc_dispatch);\n        if (doc) {\n          OnIELoad(V_BSTR(&url));\n        }\n      }\n    }\n  }\n};\n\n\/\/ Fixture for tests which ensure that Chrome Frame does not interfere with\n\/\/ normal IE operation.\n\/\/ TODO(kkania): Move this fixture to test_mock_with_web_server.h and change\n\/\/ those tests to use this too.\nclass NoInterferenceTest : public ChromeFrameTestWithWebServer {\n protected:\n  \/\/ Launches IE and navigates to |url|, then waits until receiving a quit\n  \/\/ message or the timeout is exceeded.\n  void LaunchIEAndNavigate(const std::wstring& url) {\n    EXPECT_CALL(mock_, OnQuit())\n        .Times(testing::AtMost(1))\n        .WillOnce(QUIT_LOOP(loop_));\n    HRESULT hr = mock_.LaunchIEAndNavigate(url);\n    ASSERT_HRESULT_SUCCEEDED(hr);\n    if (hr == S_FALSE)\n      return;\n\n    ASSERT_TRUE(mock_.web_browser2() != NULL);\n    loop_.RunFor(kChromeFrameLongNavigationTimeoutInSeconds);\n    mock_.Uninitialize();\n  }\n\n  const std::wstring GetTestUrl(const wchar_t* relative_path) {\n    std::wstring path = std::wstring(L\"files\/no_interference\/\") +\n        relative_path;\n    return UTF8ToWide(server_.Resolve(path.c_str()).spec());\n  }\n\n  const std::wstring empty_page_url() {\n    return GetTestUrl(L\"empty.html\");\n  }\n\n  \/\/ Returns the url for a page with a single link, which points to the\n  \/\/ empty page.\n  const std::wstring link_page_url() {\n    return GetTestUrl(L\"link.html\");\n  }\n\n  CloseIeAtEndOfScope last_resort_close_ie;\n  chrome_frame_test::TimedMsgLoop loop_;\n  CComObjectStackEx<testing::StrictMock<MockWebBrowserEventSink> > mock_;\n};\n\nACTION_P(ExpectIERendererWindowHasFocus, mock) {\n  mock->ExpectIERendererWindowHasFocus();\n}\n\nACTION_P6(DelaySendMouseClickToIE, mock, loop, delay, x, y, button) {\n  loop->PostDelayedTask(FROM_HERE, NewRunnableMethod(mock,\n      &MockWebBrowserEventSink::SendMouseClickToIE, x, y, button), delay);\n}\n\nACTION_P2(OpenContextMenu, loop, delay) {\n  loop->PostDelayedTask(FROM_HERE, NewRunnableFunction(\n      simulate_input::SendScanCode, VK_F10, simulate_input::SHIFT), delay);\n}\n\nACTION_P3(SelectItem, loop, delay, index) {\n  chrome_frame_test::DelaySendExtendedKeysEnter(loop, delay, VK_DOWN, index + 1,\n      simulate_input::NONE);\n}\n\n\/\/ A new IE renderer window should have focus.\nTEST_F(NoInterferenceTest, FLAKY_SimpleFocus) {\n  mock_.ExpectNavigationInIE(empty_page_url());\n  EXPECT_CALL(mock_, OnIELoad(testing::StrCaseEq(empty_page_url())))\n      .WillOnce(testing::DoAll(\n          ExpectIERendererWindowHasFocus(&mock_),\n          VerifyAddressBarUrl(&mock_),\n          CloseBrowserMock(&mock_)));\n\n  LaunchIEAndNavigate(empty_page_url());\n}\n\n\/\/ Javascript window.open should open a new window with an IE renderer.\nTEST_F(NoInterferenceTest, FLAKY_JavascriptWindowOpen) {\n  const std::wstring kWindowOpenUrl = GetTestUrl(L\"window_open.html\");\n  ComStackObjectWithUninitialize<\n      testing::StrictMock<MockWebBrowserEventSink> > new_window_mock;\n\n  mock_.ExpectNavigationInIE(kWindowOpenUrl);\n  EXPECT_CALL(mock_, OnIELoad(testing::StrCaseEq(kWindowOpenUrl)))\n      .WillOnce(testing::DoAll(\n          DelaySendMouseClickToIE(&mock_, &loop_, 0, 100, 100,\n                                  simulate_input::LEFT),\n          DelaySendMouseClickToIE(&mock_, &loop_, 0, 100, 100,\n                                  simulate_input::LEFT)));\n\n  EXPECT_CALL(mock_, OnNewWindow3(_, _, _, _, _));\n\n  EXPECT_CALL(mock_, OnNewBrowserWindow(_, _))\n      .WillOnce(testing::WithArgs<0>(testing::Invoke(CreateFunctor(\n          &new_window_mock, &MockWebBrowserEventSink::Attach))));\n\n  EXPECT_CALL(new_window_mock, OnBeforeNavigate2(_,\n                  testing::Field(&VARIANT::bstrVal,\n                  testing::StrCaseEq(empty_page_url())),\n                  _, _, _, _, _));\n\n  EXPECT_CALL(new_window_mock, OnFileDownload(VARIANT_TRUE, _))\n      .Times(testing::AnyNumber());\n\n  EXPECT_CALL(new_window_mock, OnNavigateComplete2(_,\n                            testing::Field(&VARIANT::bstrVal,\n                            testing::StrCaseEq(empty_page_url()))))\n      .WillOnce(testing::DoAll(\n          testing::InvokeWithoutArgs(CreateFunctor(&new_window_mock,\n              &chrome_frame_test::MockWebBrowserEventSink::ExpectAddressBarUrl,\n              empty_page_url())),\n          DelayCloseBrowserMock(&loop_, 2000, &new_window_mock)));\n\n  \/\/ The DocumentComplete at times fires twice for new windows. Hack to account\n  \/\/ for that.\n  EXPECT_CALL(new_window_mock,\n              OnIELoad(testing::StrCaseEq(empty_page_url())))\n      .Times(testing::AtMost(2));\n\n  EXPECT_CALL(new_window_mock, OnQuit())\n      .WillOnce(DelayCloseBrowserMock(&loop_, 2000, &mock_));\n\n  LaunchIEAndNavigate(kWindowOpenUrl);\n}\n\n\/\/ Redirecting with window.location in Javascript should work.\nTEST_F(NoInterferenceTest, JavascriptRedirect) {\n  const std::wstring kRedirectUrl = GetTestUrl(L\"javascript_redirect.html\");\n  mock_.ExpectNavigationInIE(kRedirectUrl);\n  EXPECT_CALL(mock_, OnIELoad(testing::StrCaseEq(kRedirectUrl)))\n      .WillOnce(VerifyAddressBarUrl(&mock_));\n\n  mock_.ExpectNavigationInIE(empty_page_url());\n  EXPECT_CALL(mock_, OnIELoad(testing::StrCaseEq(empty_page_url())))\n      .WillOnce(testing::DoAll(\n          VerifyAddressBarUrl(&mock_),\n          CloseBrowserMock(&mock_)));\n\n  LaunchIEAndNavigate(kRedirectUrl);\n}\n\nTEST_F(NoInterferenceTest, FLAKY_FollowLink) {\n  mock_.ExpectNavigationInIE(link_page_url());\n  EXPECT_CALL(mock_, OnIELoad(testing::StrCaseEq(link_page_url())))\n      .WillOnce(testing::DoAll(\n          DelaySendMouseClickToIE(&mock_, &loop_, 0, 1, 1,\n                                  simulate_input::LEFT),\n          DelaySendScanCode(&loop_, 500, VK_TAB, simulate_input::NONE),\n          DelaySendScanCode(&loop_, 1000, VK_RETURN, simulate_input::NONE)));\n\n  mock_.ExpectNavigationInIE(empty_page_url());\n  EXPECT_CALL(mock_, OnIELoad(testing::StrCaseEq(empty_page_url())))\n      .WillOnce(testing::DoAll(\n          VerifyAddressBarUrl(&mock_),\n          CloseBrowserMock(&mock_)));\n\n  LaunchIEAndNavigate(link_page_url());\n}\n\nTEST_F(NoInterferenceTest, FLAKY_SelectContextMenuOpen) {\n  mock_.ExpectNavigationInIE(link_page_url());\n  \/\/ Focus the renderer window by clicking and then tab once to highlight the\n  \/\/ link.\n  EXPECT_CALL(mock_, OnIELoad(testing::StrCaseEq(link_page_url())))\n      .WillOnce(testing::DoAll(\n          DelaySendMouseClickToIE(&mock_, &loop_, 0, 1, 1,\n                                  simulate_input::LEFT),\n          DelaySendScanCode(&loop_, 500, VK_TAB, simulate_input::NONE),\n          OpenContextMenu(&loop_, 1000),\n          SelectItem(&loop_, 1500, 0)));\n\n  mock_.ExpectNavigationInIE(empty_page_url());\n  EXPECT_CALL(mock_, OnIELoad(testing::StrCaseEq(empty_page_url())))\n      .WillOnce(testing::DoAll(\n          VerifyAddressBarUrl(&mock_),\n          CloseBrowserMock(&mock_)));\n\n  LaunchIEAndNavigate(link_page_url());\n}\n\nTEST_F(NoInterferenceTest, FLAKY_SelectContextMenuOpenInNewWindow) {\n  ComStackObjectWithUninitialize<\n      testing::StrictMock<MockWebBrowserEventSink> > new_window_mock;\n  int open_new_window_index = 2;\n  if (chrome_frame_test::GetInstalledIEVersion() == IE_6)\n    open_new_window_index = 1;\n\n  \/\/ Focus the renderer window by clicking and then tab once to highlight the\n  \/\/ link.\n  mock_.ExpectNavigationInIE(link_page_url());\n  EXPECT_CALL(mock_, OnIELoad(testing::StrCaseEq(link_page_url())))\n      .WillOnce(testing::DoAll(\n          DelaySendMouseClickToIE(&mock_, &loop_, 0, 1, 1,\n                                  simulate_input::LEFT),\n          DelaySendScanCode(&loop_, 500, VK_TAB, simulate_input::NONE),\n          OpenContextMenu(&loop_, 1000),\n          SelectItem(&loop_, 1500, open_new_window_index)));\n\n  mock_.ExpectNewWindowWithIE(empty_page_url(), &new_window_mock);\n  \/\/ The DocumentComplete at times fires twice for new windows. Hack to account\n  \/\/ for that.\n  \/\/ TODO(kkania): Verifying the address bar is flaky with this, at least\n  \/\/ on XP ie6. Fix.\n  EXPECT_CALL(new_window_mock,\n              OnIELoad(testing::StrCaseEq(empty_page_url())))\n      .Times(testing::AtMost(2))\n      .WillOnce(DelayCloseBrowserMock(&loop_, 2000, &new_window_mock));\n\n  EXPECT_CALL(new_window_mock, OnQuit()).WillOnce(CloseBrowserMock(&mock_));\n\n  LaunchIEAndNavigate(link_page_url());\n}\n\n}  \/\/ namespace<|endoftext|>"}
{"text":"<commit_before>\/**\n * Copyright (c) 2011-2014 sx developers (see AUTHORS)\n *\n * This file is part of sx.\n *\n * sx 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#ifndef SX_COMMAND_HPP\n#define SX_COMMAND_HPP\n\n#include <iostream>\n#include <string>\n#include <vector>\n#include <boost\/filesystem.hpp>\n#include <boost\/program_options.hpp>\n#include <sx\/utility\/config.hpp>\n#include <sx\/utility\/console.hpp>\n\n\/********* GENERATED SOURCE CODE, DO NOT EDIT EXCEPT EXPERIMENTALLY **********\/\n\nnamespace sx {\n\n#define SX_VARIABLE_CONFIG \"config\"\n\n\/**\n * Abstract base class for definition of each SX command.\n *\/\nclass command\n{\npublic:\n\n    \/**\n     * The symbolic (not localizable) command name, lower case.\n     *\/\n    static const char* symbol() { return \"not-implemented\"; }\n\n    \/**\n     * The symbolic (not localizable) command name, lower case.\n     *\n     * @return  Example: \"fetch-transaction\"\n     *\/\n    virtual const char* name()\n    {\n        return symbol();\n    }\n\n    \/**\n     * The localizable command category name, upper case.\n     *\n     * @return  Example: \"ONLINE (OBELISK)\"\n     *\/\n    virtual const char* category()\n    {\n        return symbol();\n    }\n\n    \/**\n     * The localizable command subcategory name, upper case.\n     *\n     * @return  Example: \"BLOCKCHAIN QUERIES\"\n     *\/\n    virtual const char* subcategory()\n    {\n        return symbol();\n    }\n\n    \/**\n     * The localizable command description, multiple lines, punctuated.\n     *\n     * @return  Example:\n     * \"Fetch a raw transaction using a network connection to\"\n     * \"make requests against the obelisk load balancer back end.\"\n     *\/\n    virtual const std::vector<const char*> description()\n    {\n        return { symbol() };\n    }\n\n    \/**\n     * The non-localizable command usage examples, multiple lines.\n     *\n     * @return  Example:\n     * \"sx fetch-transaction HASH\"\n     *\/\n    virtual const std::vector<const char*> example()\n    {\n        return { symbol() };\n    }\n\n    \/**\n     * The localizable command explanation, multiple lines, punctuated.\n     *\n     * @return  Example:\n     * \"$ sx fetch-transaction ... # fetches raw data\"\n     *\/\n    virtual const std::vector<const char*> explanation()\n    {\n        return { symbol() };\n    }\n    \n    \/**\n     * Write the usage help for this command to the specified stream.\n     *\n     * @param[out] stream  The stream of interest.\n     *\/\n    virtual void write_usage(std::ostream& stream)\n    {\n        auto options = load_options();\n        auto arguments = load_arguments();\n    }\n    \n    \/**\n     * Invoke the command.\n     *\n     * @param[in]   input   The input stream for the command execution.\n     * @param[out]  output  The input stream for the command execution.\n     * @param[out]  error   The input stream for the command execution.\n     * @return              The appropriate console return code { -1, 0, 1 }.\n     *\/\n    virtual console_result invoke(std::istream& input, std::ostream& output,\n        std::ostream& error)\n    {\n        return console_result::failure;\n    }\n\n    \/**\n     * Load command argument definitions.\n     * A value of -1 indicates that the number of instances is unlimited.\n     *\n     * @return  The loaded argument definitions.\n     *\/\n    virtual boost::program_options::positional_options_description&\n        load_arguments()\n    {\n        return argument_metadata_;\n    }\n\n    \/**\n     * Load environment variable definitions.\n     *\n     * @param[out] definitions  The defined program argument definitions.\n     *\/\n    virtual void load_environment(\n        boost::program_options::options_description& definitions)\n    {\n        using namespace boost::program_options;\n        definitions.add_options()\n            \/* This composes with the command line options. *\/\n            (\n                SX_VARIABLE_CONFIG, \n                value<boost::filesystem::path>()\n                    ->composing()->default_value(config_default()),\n                \"The path and file name for the configuration settings file for this application.\"\n            );\n    }\n\n    \/**\n     * Load command option definitions.\n     * The implicit_value call allows flags to be strongly-typed on read while\n     * allowing but not requiring a value on the command line for the option.\n     *\n     * BUGBUG: see boost bug\/fix: svn.boost.org\/trac\/boost\/ticket\/8009\n     *\n     * @return  The loaded option definitions.\n     *\/\n    virtual boost::program_options::options_description& load_options()\n    {\n        return option_metadata_;\n    }\n    \n    \/**\n     * Load configuration setting definitions.\n     *\n     * @param[out] definitions  The defined program argument definitions.\n     *\/\n    virtual void load_settings(\n        boost::program_options::options_description& definitions)\n    {\n        using namespace boost::program_options;\n        definitions.add_options()\n            (\n                \"general.testnet\",\n                value<bool>(&setting_.general.testnet),\n                \"Set to true in order to operate this application using Bitcoin testnet (vs. mainnet) addressing and blockchain data. This option is EXPERIMENTAL because other  libraries on which this application depends must currently be compiled with the testnet flag to ensure complete testnet semantics.\"\n            )\n            (\n                \"obelisk.client-certificate\",\n                value<boost::filesystem::path>(&setting_.obelisk.client_certificate),\n                \"The path to a private key certificate (file) that the server can use to prove the identity of this client. This is useful in authorizing remote administration of the server. The associated public key would need to be known by the server. Use the CZMQ program 'makecert' to generate the key certificate. For example: \/home\/genjix\/.sx.cert\"\n            )\n            (\n                \"obelisk.server-public-key\",\n                value<std::string>(&setting_.obelisk.server_public_key),\n                \"The public key of the server to which this application may connect. This must be the key for server specified by the 'service' option. For example: W=GRFxHUuUN#En3MI]f{}X:KWnV=pRZ$((byg=:h\"\n            )\n            (\n                \"obelisk.service\",\n                value<std::string>(&setting_.obelisk.service)->default_value(\"tcp:\/\/obelisk.unsystem.net:8081\"),\n                \"The URI of the server to which this application may connect.\"\n            );\n    }\n\t\n\t\/**\n     * Load streamed value as parameter fallback.\n     *\n     * @param[in]  input  The input stream for loading the parameter.\n     * @param[in]         The loaded variables.\n     *\/\n    virtual void load_stream(std::istream& input,\n        boost::program_options::variables_map& variables)\n    {\n    }\n    \n    \/* Properties *\/\n    \n    \/**\n     * Get command line argument metadata.\n     *\/\n    virtual boost::program_options::positional_options_description& \n        get_argument_metadata()\n    {\n        return argument_metadata_;\n    }\n    \n    \/**\n     * Get command line option metadata.\n     *\/\n    virtual boost::program_options::options_description& get_option_metadata()\n    {\n        return option_metadata_;\n    }\n\n    \/**\n     * Get the value of the general.testnet setting.\n     *\/\n    virtual bool get_general_testnet_setting()\n    {\n        return setting_.general.testnet;\n    }\n\n    \/**\n     * Set the value of the general.testnet setting.\n     *\/\n    virtual void set_general_testnet_setting(bool value)\n    {\n        setting_.general.testnet = value;\n    }\n    \n    \/**\n     * Get the value of the obelisk.client-certificate setting.\n     *\/\n    virtual boost::filesystem::path get_obelisk_client_certificate_setting()\n    {\n        return setting_.obelisk.client_certificate;\n    }\n\n    \/**\n     * Set the value of the obelisk.client-certificate setting.\n     *\/\n    virtual void set_obelisk_client_certificate_setting(boost::filesystem::path value)\n    {\n        setting_.obelisk.client_certificate = value;\n    }\n    \n    \/**\n     * Get the value of the obelisk.server-public-key setting.\n     *\/\n    virtual std::string get_obelisk_server_public_key_setting()\n    {\n        return setting_.obelisk.server_public_key;\n    }\n\n    \/**\n     * Set the value of the obelisk.server-public-key setting.\n     *\/\n    virtual void set_obelisk_server_public_key_setting(std::string value)\n    {\n        setting_.obelisk.server_public_key = value;\n    }\n    \n    \/**\n     * Get the value of the obelisk.service setting.\n     *\/\n    virtual std::string get_obelisk_service_setting()\n    {\n        return setting_.obelisk.service;\n    }\n\n    \/**\n     * Set the value of the obelisk.service setting.\n     *\/\n    virtual void set_obelisk_service_setting(std::string value)\n    {\n        setting_.obelisk.service = value;\n    }\n    \nprotected:\n\n    \/**\n     * This base class is abstract but not pure virtual, so prevent direct \n     * construction here.\n     *\/\n    command() {}\n    \nprivate:\n    \n    \/**\n     * Command line argument metadata.\n     *\/\n    boost::program_options::positional_options_description argument_metadata_;\n\n    \/**\n     * Command line option metadata.\n     *\/\n    boost::program_options::options_description option_metadata_;\n    \n    \/**\n     * Environment variable bound variables.\n     * Uses cross-compiler safe constructor-based zeroize.\n     * Zeroize for unit test consistency with program_options initialization.\n     *\/\n    struct environment\n    {\n        environment()\n            {}\n    } environment_;\n\n    \/**\n     * Configuration setting file bound variables.\n     * Uses cross-compiler safe constructor-based zeroize.\n     * Zeroize for unit test consistency with program_options initialization.\n     *\/\n    struct setting\n    {\n        struct general\n        {\n            general()\n              : testnet()\n                {}\n            bool testnet;\n        } general;\n\n        struct obelisk\n        {\n            obelisk()\n              : client_certificate(),\n                server_public_key(),\n                service()\n                {}\n            boost::filesystem::path client_certificate;\n            std::string server_public_key;\n            std::string service;\n        } obelisk;\n\n        setting()\n          : general(),\n            obelisk()\n            {}\n    } setting_;\n};\n\n} \/\/ sx\n\n#endif\n<commit_msg>use namespace alias<commit_after>\/**\n * Copyright (c) 2011-2014 sx developers (see AUTHORS)\n *\n * This file is part of sx.\n *\n * sx 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#ifndef SX_COMMAND_HPP\n#define SX_COMMAND_HPP\n\n#include <iostream>\n#include <string>\n#include <vector>\n#include <boost\/filesystem.hpp>\n#include <boost\/program_options.hpp>\n#include <sx\/define.hpp>\n#include <sx\/utility\/config.hpp>\n#include <sx\/utility\/console.hpp>\n\n\/********* GENERATED SOURCE CODE, DO NOT EDIT EXCEPT EXPERIMENTALLY **********\/\n\nnamespace sx {\n\n#define SX_VARIABLE_CONFIG \"config\"\n\n\/**\n * Abstract base class for definition of each SX command.\n *\/\nclass command\n{\npublic:\n\n    \/**\n     * The symbolic (not localizable) command name, lower case.\n     *\/\n    static const char* symbol() { return \"not-implemented\"; }\n\n    \/**\n     * The symbolic (not localizable) command name, lower case.\n     *\n     * @return  Example: \"fetch-transaction\"\n     *\/\n    virtual const char* name()\n    {\n        return symbol();\n    }\n\n    \/**\n     * The localizable command category name, upper case.\n     *\n     * @return  Example: \"ONLINE (OBELISK)\"\n     *\/\n    virtual const char* category()\n    {\n        return symbol();\n    }\n\n    \/**\n     * The localizable command subcategory name, upper case.\n     *\n     * @return  Example: \"BLOCKCHAIN QUERIES\"\n     *\/\n    virtual const char* subcategory()\n    {\n        return symbol();\n    }\n\n    \/**\n     * The localizable command description, multiple lines, punctuated.\n     *\n     * @return  Example:\n     * \"Fetch a raw transaction using a network connection to\"\n     * \"make requests against the obelisk load balancer back end.\"\n     *\/\n    virtual const std::vector<const char*> description()\n    {\n        return { symbol() };\n    }\n\n    \/**\n     * The non-localizable command usage examples, multiple lines.\n     *\n     * @return  Example:\n     * \"sx fetch-transaction HASH\"\n     *\/\n    virtual const std::vector<const char*> example()\n    {\n        return { symbol() };\n    }\n\n    \/**\n     * The localizable command explanation, multiple lines, punctuated.\n     *\n     * @return  Example:\n     * \"$ sx fetch-transaction ... # fetches raw data\"\n     *\/\n    virtual const std::vector<const char*> explanation()\n    {\n        return { symbol() };\n    }\n    \n    \/**\n     * Write the usage help for this command to the specified stream.\n     *\n     * @param[out] stream  The stream of interest.\n     *\/\n    virtual void write_usage(std::ostream& stream)\n    {\n        auto options = load_options();\n        auto arguments = load_arguments();\n    }\n    \n    \/**\n     * Invoke the command.\n     *\n     * @param[in]   input   The input stream for the command execution.\n     * @param[out]  output  The input stream for the command execution.\n     * @param[out]  error   The input stream for the command execution.\n     * @return              The appropriate console return code { -1, 0, 1 }.\n     *\/\n    virtual console_result invoke(std::istream& input, std::ostream& output,\n        std::ostream& error)\n    {\n        return console_result::failure;\n    }\n\n    \/**\n     * Load command argument definitions.\n     * A value of -1 indicates that the number of instances is unlimited.\n     *\n     * @return  The loaded argument definitions.\n     *\/\n    virtual po::positional_options_description& load_arguments()\n    {\n        return argument_metadata_;\n    }\n\n    \/**\n     * Load environment variable definitions.\n     *\n     * @param[out] definitions  The defined program argument definitions.\n     *\/\n    virtual void load_environment(po::options_description& definitions)\n    {\n        using namespace po;\n        definitions.add_options()\n            \/* This composes with the command line options. *\/\n            (\n                SX_VARIABLE_CONFIG, \n                value<boost::filesystem::path>()\n                    ->composing()->default_value(config_default()),\n                \"The path and file name for the configuration settings file for this application.\"\n            );\n    }\n\n    \/**\n     * Load command option definitions.\n     * The implicit_value call allows flags to be strongly-typed on read while\n     * allowing but not requiring a value on the command line for the option.\n     *\n     * BUGBUG: see boost bug\/fix: svn.boost.org\/trac\/boost\/ticket\/8009\n     *\n     * @return  The loaded option definitions.\n     *\/\n    virtual po::options_description& load_options()\n    {\n        return option_metadata_;\n    }\n    \n    \/**\n     * Load configuration setting definitions.\n     *\n     * @param[out] definitions  The defined program argument definitions.\n     *\/\n    virtual void load_settings(po::options_description& definitions)\n    {\n        using namespace po;\n        definitions.add_options()\n            (\n                \"general.testnet\",\n                value<bool>(&setting_.general.testnet),\n                \"Set to true in order to operate this application using Bitcoin testnet (vs. mainnet) addressing and blockchain data. This option is EXPERIMENTAL because other  libraries on which this application depends must currently be compiled with the testnet flag to ensure complete testnet semantics.\"\n            )\n            (\n                \"obelisk.client-certificate\",\n                value<boost::filesystem::path>(&setting_.obelisk.client_certificate),\n                \"The path to a private key certificate (file) that the server can use to prove the identity of this client. This is useful in authorizing remote administration of the server. The associated public key would need to be known by the server. Use the CZMQ program 'makecert' to generate the key certificate. For example: \/home\/genjix\/.sx.cert\"\n            )\n            (\n                \"obelisk.server-public-key\",\n                value<std::string>(&setting_.obelisk.server_public_key),\n                \"The public key of the server to which this application may connect. This must be the key for server specified by the 'service' option. For example: W=GRFxHUuUN#En3MI]f{}X:KWnV=pRZ$((byg=:h\"\n            )\n            (\n                \"obelisk.service\",\n                value<std::string>(&setting_.obelisk.service)->default_value(\"tcp:\/\/obelisk.unsystem.net:8081\"),\n                \"The URI of the server to which this application may connect.\"\n            );\n    }\n\t\n\t\/**\n     * Load streamed value as parameter fallback.\n     *\n     * @param[in]  input  The input stream for loading the parameter.\n     * @param[in]         The loaded variables.\n     *\/\n    virtual void load_stream(std::istream& input, po::variables_map& variables)\n\t{\n\t}\n    \n    \/* Properties *\/\n    \n    \/**\n     * Get command line argument metadata.\n     *\/\n    virtual po::positional_options_description& get_argument_metadata()\n    {\n        return argument_metadata_;\n    }\n    \n    \/**\n     * Get command line option metadata.\n     *\/\n    virtual po::options_description& get_option_metadata()\n    {\n        return option_metadata_;\n    }\n\n    \/**\n     * Get the value of the general.testnet setting.\n     *\/\n    virtual bool get_general_testnet_setting()\n    {\n        return setting_.general.testnet;\n    }\n\n    \/**\n     * Set the value of the general.testnet setting.\n     *\/\n    virtual void set_general_testnet_setting(bool value)\n    {\n        setting_.general.testnet = value;\n    }\n    \n    \/**\n     * Get the value of the obelisk.client-certificate setting.\n     *\/\n    virtual boost::filesystem::path get_obelisk_client_certificate_setting()\n    {\n        return setting_.obelisk.client_certificate;\n    }\n\n    \/**\n     * Set the value of the obelisk.client-certificate setting.\n     *\/\n    virtual void set_obelisk_client_certificate_setting(boost::filesystem::path value)\n    {\n        setting_.obelisk.client_certificate = value;\n    }\n    \n    \/**\n     * Get the value of the obelisk.server-public-key setting.\n     *\/\n    virtual std::string get_obelisk_server_public_key_setting()\n    {\n        return setting_.obelisk.server_public_key;\n    }\n\n    \/**\n     * Set the value of the obelisk.server-public-key setting.\n     *\/\n    virtual void set_obelisk_server_public_key_setting(std::string value)\n    {\n        setting_.obelisk.server_public_key = value;\n    }\n    \n    \/**\n     * Get the value of the obelisk.service setting.\n     *\/\n    virtual std::string get_obelisk_service_setting()\n    {\n        return setting_.obelisk.service;\n    }\n\n    \/**\n     * Set the value of the obelisk.service setting.\n     *\/\n    virtual void set_obelisk_service_setting(std::string value)\n    {\n        setting_.obelisk.service = value;\n    }\n    \nprotected:\n\n    \/**\n     * This base class is abstract but not pure virtual, so prevent direct \n     * construction here.\n     *\/\n    command() {}\n    \nprivate:\n    \n    \/**\n     * Command line argument metadata.\n     *\/\n    po::positional_options_description argument_metadata_;\n\n    \/**\n     * Command line option metadata.\n     *\/\n    po::options_description option_metadata_;\n    \n    \/**\n     * Environment variable bound variables.\n     * Uses cross-compiler safe constructor-based zeroize.\n     * Zeroize for unit test consistency with program_options initialization.\n     *\/\n    struct environment\n    {\n        environment()\n            {}\n    } environment_;\n\n    \/**\n     * Configuration setting file bound variables.\n     * Uses cross-compiler safe constructor-based zeroize.\n     * Zeroize for unit test consistency with program_options initialization.\n     *\/\n    struct setting\n    {\n        struct general\n        {\n            general()\n              : testnet()\n                {}\n            bool testnet;\n        } general;\n\n        struct obelisk\n        {\n            obelisk()\n              : client_certificate(),\n                server_public_key(),\n                service()\n                {}\n            boost::filesystem::path client_certificate;\n            std::string server_public_key;\n            std::string service;\n        } obelisk;\n\n        setting()\n          : general(),\n            obelisk()\n            {}\n    } setting_;\n};\n\n} \/\/ sx\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include <phys_engine.h>\n#include <phys_constants.h>\n\n#include <algorithm>\n#include <vector>\n#include <iostream>\n\nusing namespace physic;\n\nclass EngineImpl : public IEngine\n{\npublic:\n\tvirtual void SetWorldSize(\n\t\tint left = 0, \n\t\tint bot = 0, \n\t\tint right = kWorldMarginRight, \n\t\tint top = kWorldMarginTop) override;\n\n\tvirtual void SetWorldConstants(\n\t\tfloat gravity = kGravity, \n\t\tfloat air_density = kAirDragFactor, \n\t\tfloat ground_friction = kGroundFriction) override;\n\t\n\tvirtual void AddBody(const BodyPtr&) override;\n\tvirtual void RemoveBody(const BodyPtr&) override;\n\tvirtual void Step(double dt) override;\n\n\tEngineImpl();\n\tvirtual ~EngineImpl() = default;\n\n\tEngineImpl(const EngineImpl&) = delete;\n\tEngineImpl& operator=(const EngineImpl&) = delete;\n\tEngineImpl(EngineImpl&&) = delete;\n\tEngineImpl& operator=(EngineImpl&&) = delete;\n\nprivate:\n\n\t\/\/ Return penetration distance if collision occurred, else 0.f\n\tfloat checkCollision(const BodyPtr&, const BodyPtr&) const;\n\tvoid solveCollision(const BodyPtr&, const BodyPtr&) const;\n\tfVec2D clipPositionToWorldMargins(const fVec2D&) const;\n\n\tint m_botBorder;\n\tint m_leftBorder;\n\tint m_upBorder;\n\tint m_rightBorder;\n\n\tstd::vector<BodyPtr> m_bodies;\n\n\tfVec2D m_gravity;\n\tfloat m_airDrag;\n\tfloat m_groundFricion;\n};\n\nvoid EngineImpl::SetWorldSize(int left, int bot, int right, int top)\n{\n\t\/\/ Set world margins\n\tm_botBorder = bot;\n\tm_upBorder = top;\n\tm_rightBorder = right;\n\tm_leftBorder = left;\n}\n\nvoid EngineImpl::SetWorldConstants(float gravity, float air_drag, float ground_friction)\n{\n\t\/\/ Set world margins\n\tm_gravity = fVec2D(gravity, fAngle(-90.));\n\tm_airDrag = air_drag;\n\tm_groundFricion = ground_friction;\n}\n\n\nvoid EngineImpl::AddBody(const BodyPtr& body)\n{\n\n\tm_bodies.push_back(body);\n}\n\nvoid EngineImpl::RemoveBody(const BodyPtr& body)\n{\n\tm_bodies.erase(std::remove(m_bodies.begin(), m_bodies.end(), body), m_bodies.end());\n}\n\nvoid EngineImpl::Step(double dt)\n{\n\tstatic int search_collisions = 0;\n\tstatic int n2_collisions = 0;\n\n\tQuadTree<BodyPtr> tree(0, m_leftBorder, m_botBorder, m_rightBorder, m_upBorder);\n\n\tfor (const auto& body : m_bodies)\n\t\ttree.insert(body);\n\n\t\/\/std::vector<BodyPtr> sorted_x = m_bodies;\n\t\/\/std::vector<BodyPtr> sorted_y = m_bodies;\n\n\t\/\/std::sort(sorted_x.begin(), sorted_x.end(),\n\t\/\/\t[](const BodyPtr & a, const BodyPtr & b) -> bool\n\t\/\/{\n\t\/\/\treturn a->GetPosition().x < b->GetPosition().x;\n\t\/\/});\n\n\t\/\/std::sort(sorted_y.begin(), sorted_y.end(),\n\t\/\/\t[](const BodyPtr & a, const BodyPtr & b) -> bool\n\t\/\/{\n\t\/\/\treturn a->GetPosition().y < b->GetPosition().y;\n\t\/\/});\n\n\tfor (auto& body : m_bodies)\n\t{\n\t\tfVec2D velocity = body->GetVelocityVector();\n\t\tfVec2D position = body->GetPosition();\n\n\t\tposition = clipPositionToWorldMargins(position);\n\n\t\tconst float mass = body->GetMass();\n\t\tconst float kBounceFactor = body->GetBounceFactor();\n\n\t\tauto colliding = tree.locate(body);\n\t\tfor (auto collide : colliding)\n\t\t{\n\t\t\tsearch_collisions++;\n\t\t\tdouble peneration = checkCollision(body, collide);\n\t\t\tif (peneration > 0.f)\n\t\t\t\tsolveCollision(body, collide);\n\t\t}\n\n\n\t\t\/\/auto find = std::find(sorted_x.begin(), sorted_x.end(), body);\n\t\t\/\/if (find != sorted_x.end())\n\t\t\/\/{\n\t\t\/\/\tauto start = find;\n\t\t\/\/\tauto end = find;\n\t\t\/\/\tif (find != sorted_x.begin())\n\t\t\/\/\t\t--start;\n\t\t\/\/\tif (find != sorted_x.end())\n\t\t\/\/\t\t++end;\n\n\t\t\/\/\tfor (auto collide = start; collide != end; ++collide)\n\t\t\/\/\t{\n\t\t\/\/\t\tsearch_collisions++;\n\t\t\/\/\t\tdouble peneration = checkCollision(body, *collide);\n\t\t\/\/\t\tif (peneration > 0.f)\n\t\t\/\/\t\t\tsolveCollision(body, *collide);\n\t\t\/\/\t}\n\t\t\/\/}\n\n\t\t\/\/find = std::find(sorted_y.begin(), sorted_y.end(), body);\n\t\t\/\/if (find != sorted_y.end())\n\t\t\/\/{\n\t\t\/\/\tauto start = find;\n\t\t\/\/\tauto end = find;\n\t\t\/\/\tif (find != sorted_y.begin())\n\t\t\/\/\t\t--start;\n\t\t\/\/\tif (find != sorted_y.end())\n\t\t\/\/\t\t++end;\n\n\t\t\/\/\tfor (auto collide = start; collide != end; ++collide)\n\t\t\/\/\t{\n\t\t\/\/\t\tsearch_collisions++;\n\t\t\/\/\t\tdouble peneration = checkCollision(body, *collide);\n\t\t\/\/\t\tif (peneration > 0.f)\n\t\t\/\/\t\t\tsolveCollision(body, *collide);\n\t\t\/\/\t}\n\t\t\/\/}\n\n\t\t\/\/ O(N^2) collision calculation. Change for quadtree.\n\t\t\/\/for (auto& collide : m_bodies)\n\t\t\/\/{\n\t\t\/\/\tn2_collisions++;\n\t\t\/\/\tdouble peneration = checkCollision(body, collide);\n\t\t\/\/\tif (peneration > 0.f)\n\t\t\/\/\t\tsolveCollision(body, collide);\n\t\t\/\/}\n\n\t\tfVec2D ground_friction_force = { 0, 0 };\n\n\t\t\/\/ Check restrictions. Body will bounce at world margins.\n\t\tif (position.x >= m_rightBorder || position.x <= m_leftBorder)\n\t\t\tvelocity.x *= -kBounceFactor;\n\n\t\tif (position.y >= m_upBorder || position.y <= m_botBorder)\n\t\t{\n\t\t\t\/\/ Apply ground frictions simulation\n\t\t\tif (position.y <= m_botBorder)\n\t\t\t\t\/\/ Vector of force is negative to velocity vector\n\t\t\t\tif (m_groundFricion != 0.f)\n\t\t\t\t\tground_friction_force = -m_groundFricion * EuclideanNorm(m_gravity) * mass * velocity\n\t\t\t\t\t\t\t\t\t\t\t\t\/ EuclideanNorm(velocity);\n\n\t\t\tvelocity.y *= -kBounceFactor;\n\t\t}\n\n\t\t\/\/Apply air drag force\n\t\tfVec2D air_drag_force = m_airDrag * -velocity;\n\t\t\/\/ Sum of force vectors, gravity force and air drag force\n\t\tfVec2D force = m_gravity * mass + air_drag_force + ground_friction_force;\n\t\tfVec2D acceleration = force \/ mass;\n\n\t\t\/\/ Change position and velocity\n\t\tposition += Round(dt * (velocity + (0.5f * acceleration * dt)));\n\t\tvelocity += Round(dt * acceleration);\n\t\t\n\t\tbody->SetPosition(position);\n\t\tbody->SetVelocityVector(velocity);\n\n\n\t}\n\n\tstd::cout << \"Search collisions: \" << search_collisions << std::endl;\n\tstd::cout << \"n2 collisions: \" << n2_collisions << std::endl;\n\tsearch_collisions = 0;\n\tn2_collisions = 0;\n}\n\nEngineImpl::EngineImpl()\n\t: m_botBorder(0)\n\t, m_leftBorder(0)\n\t, m_upBorder(kWorldMarginTop)\n\t, m_rightBorder(kWorldMarginRight)\n\t, m_bodies()\n\t, m_gravity(0, -kGravity)\n\t, m_airDrag(kAirDragFactor)\n\t, m_groundFricion(kGroundFriction)\n{\n\n}\n\nfloat EngineImpl::checkCollision(const BodyPtr& body, const BodyPtr& collide) const\n{\n\tif (body == collide)\n\t\treturn 0.f;\n\n\tfVec2D position = body->GetPosition();\n\tfVec2D collide_position = collide->GetPosition();\n\n\t\/\/ Get size from body interface\n\tstatic unsigned radius = 10;\n\tfVec2D diff = collide_position - position;\n\tfloat penetration = 0.f;\n\n\tif ((diff.x * diff.x) + (diff.y * diff.y) <= radius * radius)\n\t\tpenetration = std::sqrt((radius * radius) - ((diff.x * diff.x) + (diff.y * diff.y)));\n\n\treturn penetration;\n}\n\nvoid EngineImpl::solveCollision(const BodyPtr& body, const BodyPtr& collide) const\n{\n\tfVec2D velocity = body->GetVelocityVector();\n\tfVec2D position = body->GetPosition();\n\tconst float mass = body->GetMass();\n\n\tfVec2D collide_velocity = collide->GetVelocityVector();\n\tfVec2D collide_position = collide->GetPosition();\n\tconst float collide_mass = collide->GetMass();\n\n\tfVec2D collision_vector = collide_position - position;\n\tfVec2D collision_normal = Normalized(collision_vector);\n\n\tfVec2D relative_vel = collide_velocity - velocity;\n\tdouble length_relative = DotProduct(relative_vel, collision_normal);\n\n\t\/\/ Objects moving in different directions, nothing to solve\n\tif (length_relative > 0.f + 0.5f)\n\t\treturn;\n\n\t\/\/ TODO get inverted mass from body\n\tdouble impulse_val = -(1.f + kBounceFactor) * length_relative;\n\timpulse_val \/= (1 \/ mass) + (1 \/ collide_mass);\n\n\tfVec2D impulse = impulse_val * collision_normal;\n\n\tfVec2D new_vel = velocity - impulse * (1 \/ mass);\n\tfVec2D new_collide_vel = collide_velocity + impulse * (1 \/ collide_mass);\n\n\tbody->SetVelocityVector(new_vel);\n\tcollide->SetVelocityVector(new_collide_vel);\n}\n\nfVec2D EngineImpl::clipPositionToWorldMargins(const fVec2D& pos) const\n{\n\treturn { Clip(pos.x,\n\t\t\t\tstatic_cast<fVec2D::type>(m_leftBorder),\n\t\t\t\tstatic_cast<fVec2D::type>(m_rightBorder)),\n\t\t\t Clip(pos.y,\n\t\t\t\tstatic_cast<fVec2D::type>(m_botBorder),\n\t\t\t\tstatic_cast<fVec2D::type>(m_upBorder)) };\n}\n\nIEngine* IEngine::Instance()\n{\n\tstatic EngineImpl _instance;\n\treturn &_instance;\n}<commit_msg>Code cleanup.<commit_after>#include <phys_engine.h>\n#include <phys_constants.h>\n\n#include <algorithm>\n#include <vector>\n#include <iostream>\n\nusing namespace physic;\n\nclass EngineImpl : public IEngine\n{\npublic:\n\tvirtual void SetWorldSize(\n\t\tint left = 0, \n\t\tint bot = 0, \n\t\tint right = kWorldMarginRight, \n\t\tint top = kWorldMarginTop) override;\n\n\tvirtual void SetWorldConstants(\n\t\tfloat gravity = kGravity, \n\t\tfloat air_density = kAirDragFactor, \n\t\tfloat ground_friction = kGroundFriction) override;\n\t\n\tvirtual void AddBody(const BodyPtr&) override;\n\tvirtual void RemoveBody(const BodyPtr&) override;\n\tvirtual void Step(double dt) override;\n\n\tEngineImpl();\n\tvirtual ~EngineImpl() = default;\n\n\tEngineImpl(const EngineImpl&) = delete;\n\tEngineImpl& operator=(const EngineImpl&) = delete;\n\tEngineImpl(EngineImpl&&) = delete;\n\tEngineImpl& operator=(EngineImpl&&) = delete;\n\nprivate:\n\n\t\/\/ Return penetration distance if collision occurred, else 0.f\n\tfloat checkCollision(const BodyPtr&, const BodyPtr&) const;\n\tvoid solveCollision(const BodyPtr&, const BodyPtr&) const;\n\tfVec2D clipPositionToWorldMargins(const fVec2D&) const;\n\n\tint m_botBorder;\n\tint m_leftBorder;\n\tint m_upBorder;\n\tint m_rightBorder;\n\n\tstd::vector<BodyPtr> m_bodies;\n\n\tfVec2D m_gravity;\n\tfloat m_airDrag;\n\tfloat m_groundFricion;\n};\n\nvoid EngineImpl::SetWorldSize(int left, int bot, int right, int top)\n{\n\t\/\/ Set world margins\n\tm_botBorder = bot;\n\tm_upBorder = top;\n\tm_rightBorder = right;\n\tm_leftBorder = left;\n}\n\nvoid EngineImpl::SetWorldConstants(float gravity, float air_drag, float ground_friction)\n{\n\t\/\/ Set world margins\n\tm_gravity = fVec2D(gravity, fAngle(-90.));\n\tm_airDrag = air_drag;\n\tm_groundFricion = ground_friction;\n}\n\n\nvoid EngineImpl::AddBody(const BodyPtr& body)\n{\n\n\tm_bodies.push_back(body);\n}\n\nvoid EngineImpl::RemoveBody(const BodyPtr& body)\n{\n\tm_bodies.erase(std::remove(m_bodies.begin(), m_bodies.end(), body), m_bodies.end());\n}\n\nvoid EngineImpl::Step(double dt)\n{\n\t\/\/static int search_collisions = 0;\n\t\/\/static int n2_collisions = 0;\n\n\tQuadTree<BodyPtr> tree(0, m_leftBorder, m_botBorder, m_rightBorder, m_upBorder);\n\n\tfor (const auto& body : m_bodies)\n\t\ttree.insert(body);\n\n\tfor (auto& body : m_bodies)\n\t{\n\t\tfVec2D velocity = body->GetVelocityVector();\n\t\tfVec2D position = body->GetPosition();\n\n\t\tposition = clipPositionToWorldMargins(position);\n\n\t\tconst float mass = body->GetMass();\n\t\tconst float kBounceFactor = body->GetBounceFactor();\n\n\t\tauto colliding = tree.locate(body);\n\t\tfor (auto collide : colliding)\n\t\t{\n\t\t\t\/\/search_collisions++;\n\t\t\tdouble peneration = checkCollision(body, collide);\n\t\t\tif (peneration > 0.f)\n\t\t\t\tsolveCollision(body, collide);\n\t\t}\n\n\t\tfVec2D ground_friction_force = { 0, 0 };\n\n\t\t\/\/ Check restrictions. Body will bounce at world margins.\n\t\tif (position.x >= m_rightBorder || position.x <= m_leftBorder)\n\t\t\tvelocity.x *= -kBounceFactor;\n\n\t\tif (position.y >= m_upBorder || position.y <= m_botBorder)\n\t\t{\n\t\t\t\/\/ Apply ground frictions simulation\n\t\t\tif (position.y <= m_botBorder)\n\t\t\t\t\/\/ Vector of force is negative to velocity vector\n\t\t\t\tif (m_groundFricion != 0.f)\n\t\t\t\t\tground_friction_force = -m_groundFricion * EuclideanNorm(m_gravity) * mass * velocity\n\t\t\t\t\t\t\t\t\t\t\t\t\/ EuclideanNorm(velocity);\n\n\t\t\tvelocity.y *= -kBounceFactor;\n\t\t}\n\n\t\t\/\/Apply air drag force\n\t\tfVec2D air_drag_force = m_airDrag * -velocity;\n\t\t\/\/ Sum of force vectors, gravity force and air drag force\n\t\tfVec2D force = m_gravity * mass + air_drag_force + ground_friction_force;\n\t\tfVec2D acceleration = force \/ mass;\n\n\t\t\/\/ Change position and velocity\n\t\tposition += Round(dt * (velocity + (0.5f * acceleration * dt)));\n\t\tvelocity += Round(dt * acceleration);\n\t\t\n\t\tbody->SetPosition(position);\n\t\tbody->SetVelocityVector(velocity);\n\t}\n\n\t\/\/std::cout << \"Search collisions: \" << search_collisions << std::endl;\n\t\/\/std::cout << \"n2 collisions: \" << n2_collisions << std::endl;\n\t\/\/search_collisions = 0;\n\t\/\/n2_collisions = 0;\n}\n\nEngineImpl::EngineImpl()\n\t: m_botBorder(0)\n\t, m_leftBorder(0)\n\t, m_upBorder(kWorldMarginTop)\n\t, m_rightBorder(kWorldMarginRight)\n\t, m_bodies()\n\t, m_gravity(0, -kGravity)\n\t, m_airDrag(kAirDragFactor)\n\t, m_groundFricion(kGroundFriction)\n{\n\n}\n\nfloat EngineImpl::checkCollision(const BodyPtr& body, const BodyPtr& collide) const\n{\n\tif (body == collide)\n\t\treturn 0.f;\n\n\tfVec2D position = body->GetPosition();\n\tfVec2D collide_position = collide->GetPosition();\n\n\t\/\/ Get size from body interface\n\tstatic unsigned radius = 10;\n\tfVec2D diff = collide_position - position;\n\tfloat penetration = 0.f;\n\n\tif ((diff.x * diff.x) + (diff.y * diff.y) <= radius * radius)\n\t\tpenetration = std::sqrt((radius * radius) - ((diff.x * diff.x) + (diff.y * diff.y)));\n\n\treturn penetration;\n}\n\nvoid EngineImpl::solveCollision(const BodyPtr& body, const BodyPtr& collide) const\n{\n\tfVec2D velocity = body->GetVelocityVector();\n\tfVec2D position = body->GetPosition();\n\tconst float mass = body->GetMass();\n\n\tfVec2D collide_velocity = collide->GetVelocityVector();\n\tfVec2D collide_position = collide->GetPosition();\n\tconst float collide_mass = collide->GetMass();\n\n\tfVec2D collision_vector = collide_position - position;\n\tfVec2D collision_normal = Normalized(collision_vector);\n\n\tfVec2D relative_vel = collide_velocity - velocity;\n\tdouble length_relative = DotProduct(relative_vel, collision_normal);\n\n\t\/\/ Objects moving in different directions, nothing to solve\n\tif (length_relative > 0.f + 0.5f)\n\t\treturn;\n\n\t\/\/ TODO get inverted mass from body\n\tdouble impulse_val = -(1.f + kBounceFactor) * length_relative;\n\timpulse_val \/= (1 \/ mass) + (1 \/ collide_mass);\n\n\tfVec2D impulse = impulse_val * collision_normal;\n\n\tfVec2D new_vel = velocity - impulse * (1 \/ mass);\n\tfVec2D new_collide_vel = collide_velocity + impulse * (1 \/ collide_mass);\n\n\tbody->SetVelocityVector(new_vel);\n\tcollide->SetVelocityVector(new_collide_vel);\n}\n\nfVec2D EngineImpl::clipPositionToWorldMargins(const fVec2D& pos) const\n{\n\treturn { Clip(pos.x,\n\t\t\t\tstatic_cast<fVec2D::type>(m_leftBorder),\n\t\t\t\tstatic_cast<fVec2D::type>(m_rightBorder)),\n\t\t\t Clip(pos.y,\n\t\t\t\tstatic_cast<fVec2D::type>(m_botBorder),\n\t\t\t\tstatic_cast<fVec2D::type>(m_upBorder)) };\n}\n\nIEngine* IEngine::Instance()\n{\n\tstatic EngineImpl _instance;\n\treturn &_instance;\n}<|endoftext|>"}
{"text":"<commit_before>\/***********************************************************************************\n** MIT License                                                                    **\n**                                                                                **\n** Copyright (c) 2018 Victor DENIS (victordenis01@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 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 \"Web\/WebPage.hpp\"\n\n#include <QPointer>\n#include <QTimer>\n#include <QDesktopServices>\n#include <QFileInfo>\n\n#include <QWebEngineSettings>\n#include <QWebChannel>\n\n#include <QMessageBox>\n\n#include <QSettings>\n\n#include \"Web\/WebHitTestResult.hpp\"\n#include \"Web\/WebView.hpp\"\n#include \"Web\/Tab\/TabbedWebView.hpp\"\n#include \"Web\/HTML5Permissions\/HTML5PermissionsManager.hpp\"\n#include \"Web\/Scripts.hpp\"\n\n#include \"Download\/DownloadManager.hpp\"\n\n#include \"AdBlock\/Manager.hpp\"\n\n#include \"Password\/AutoFill\/AutoFill.hpp\"\n\n#include \"Network\/NetworkManager.hpp\"\n\n#include \"Widgets\/CheckBoxDialog.hpp\"\n#include \"Widgets\/Tab\/TabWidget.hpp\"\n\n#include \"Utils\/DelayedFileWatcher.hpp\"\n#include \"Utils\/ExternalJsObject.hpp\"\n\n#include \"Plugins\/PluginProxy.hpp\"\n\n#include \"Application.hpp\"\n#include \"BrowserWindow.hpp\"\n\nnamespace Sn {\n\nQString WebPage::setCSS(const QString& css)\n{\n\tQString source = QLatin1String(\"(function() {\"\n\t\t\t\t\t\t\t\t\t   \"var head = document.getElementsByTagName('head')[0];\"\n\t\t\t\t\t\t\t\t\t   \"if (!head) return;\"\n\t\t\t\t\t\t\t\t\t   \"var css = document.createElement('style');\"\n\t\t\t\t\t\t\t\t\t   \"css.setAttribute('type', 'text\/css');\"\n\t\t\t\t\t\t\t\t\t   \"css.appendChild(document.createTextNode('%1'));\"\n\t\t\t\t\t\t\t\t\t   \"head.appendChild(css);\"\n\t\t\t\t\t\t\t\t\t   \"})()\");\n\n\tQString style = css;\n\tstyle.replace(QLatin1String(\"'\"), QLatin1String(\"\\\\'\"));\n\tstyle.replace(QLatin1String(\"\\n\"), QLatin1String(\"\\\\n\"));\n\treturn source.arg(style);\n}\n\nWebPage::WebPage(QObject* parent) :\n\tQWebEnginePage(Application::instance()->webProfile(), parent),\n\tm_runningLoop(nullptr),\n\tm_loadProgress(-1),\n\tm_blockAlerts(false),\n\tm_secureStatus(false),\n\tm_adjustingSheduled(false)\n{\n\n\tsetupWebChannel();\n\n\tconnect(this, &QWebEnginePage::loadProgress, this, &WebPage::progress);\n\tconnect(this, &QWebEnginePage::loadFinished, this, &WebPage::finished);\n\tconnect(this, &QWebEnginePage::urlChanged, this, &WebPage::urlChanged);\n\tconnect(this, &QWebEnginePage::featurePermissionRequested, this, &WebPage::featurePermissionRequested);\n\tconnect(this, &QWebEnginePage::windowCloseRequested, this, &WebPage::windowCloseRequested);\n\n\tconnect(this, &QWebEnginePage::authenticationRequired, this, [this](const QUrl& url, QAuthenticator* authenticator)\n\t{\n\t\tApplication::instance()->networkManager()->authentication(url, authenticator, view());\n\t});\n\n\tconnect(this,\n\t\t\t&QWebEnginePage::proxyAuthenticationRequired,\n\t\t\tthis,\n\t\t\t[this](const QUrl& url, QAuthenticator* authenticator, const QString& proxyHost)\n\t\t\t{\n\t\t\t\tQ_UNUSED(url);\n\t\t\t\tApplication::instance()->networkManager()->proxyAuthentication(proxyHost, authenticator, view());\n\t\t\t});\n}\n\nWebPage::~WebPage()\n{\n\tApplication::instance()->plugins()->emitWebPageDeleted(this);\n\n\tif (m_runningLoop) {\n\t\tm_runningLoop->exit(1);\n\t\tm_runningLoop = nullptr;\n\t}\n}\n\nWebView* WebPage::view() const\n{\n\treturn static_cast<WebView*>(QWebEnginePage::view());\n}\n\nQVariant WebPage::executeJavaScript(const QString& scriptSrc, quint32 worldId, int timeout)\n{\n\tQPointer<QEventLoop> loop{new QEventLoop};\n\tQVariant result{};\n\tQTimer::singleShot(timeout, loop.data(), &QEventLoop::quit);\n\n\trunJavaScript(scriptSrc, worldId, [loop, &result](const QVariant& res)\n\t{\n\t\tif (loop && loop->isRunning()) {\n\t\t\tresult = res;\n\t\t\tloop->quit();\n\t\t}\n\t});\n\n\tloop->exec();\n\tdelete loop;\n\n\treturn result;\n}\n\nQPointF WebPage::mapToViewport(const QPointF& pos) const\n{\n\treturn QPointF(pos.x() \/ zoomFactor(), pos.y() \/ zoomFactor());\n}\n\nWebHitTestResult WebPage::hitTestContent(const QPoint& pos) const\n{\n\treturn WebHitTestResult(this, pos);\n}\n\nvoid WebPage::scroll(int x, int y)\n{\n\trunJavaScript(QStringLiteral(\"window.scrollTo(window.scrollX + %1, window.scrollY + %2)\").arg(x).arg(y),\n\t\t\t\t  QWebEngineScript::ApplicationWorld);\n}\n\nvoid WebPage::setScrollPosition(const QPointF& pos)\n{\n\tconst QPointF v{mapToViewport(pos.toPoint())};\n\trunJavaScript(QStringLiteral(\"window.scrollTo(%1, %2)\").arg(v.x()).arg(v.y()));\n}\n\nvoid WebPage::javaScriptAlert(const QUrl& securityOrigin, const QString& msg)\n{\n\tQ_UNUSED(securityOrigin)\n\n\tif (m_blockAlerts || m_runningLoop)\n\t\treturn;\n\n\tQString title{tr(\"JavaScript Alert\")};\n\n\tif (!url().host().isEmpty())\n\t\ttitle.append(QString(\" - %1\").arg(url().host()));\n\n\tCheckBoxDialog dialog(QMessageBox::Ok, view());\n\tdialog.setWindowTitle(title);\n\tdialog.setText(msg);\n\tdialog.setCheckBoxText(tr(\"Prevent this page from creating additional dialogues box.\"));\n\tdialog.setIcon(QMessageBox::Information);\n\tdialog.exec();\n\n\tm_blockAlerts = dialog.isChecked();\n}\n\nvoid WebPage::setJavaScriptEnable(bool enabled)\n{\n\tsettings()->setAttribute(QWebEngineSettings::JavascriptEnabled, enabled);\n}\n\nbool WebPage::isRunningLoop()\n{\n\treturn m_runningLoop;\n}\n\nbool WebPage::isLoading() const\n{\n\treturn m_loadProgress < 100;\n}\n\nvoid WebPage::setupWebChannel()\n{\n\tQWebChannel* old = webChannel();\n\tconst QString objectName = QStringLiteral(\"sielo_object\");\n\tQWebChannel* channel{new QWebChannel(this)};\n\n\tchannel->registerObject(QStringLiteral(\"sielo_object\"), new ExternalJsObject(this));\n\tsetWebChannel(channel);\n\n\tif (old) {\n\t\tdelete old->registeredObjects().value(objectName);\n\t\tdelete old;\n\t}\n}\n\nvoid WebPage::progress(int progression)\n{\n\tm_loadProgress = progression;\n\n\tbool secStatus = url().scheme() == QLatin1String(\"https\");\n\n\tif (secStatus != m_secureStatus) {\n\t\tm_secureStatus = secStatus;\n\t\temit privacyChanged(secStatus);\n\t}\n}\n\nvoid WebPage::finished()\n{\n\tprogress(100);\n\n\tif (m_adjustingSheduled) {\n\t\tm_adjustingSheduled = false;\n\t\tsetZoomFactor(zoomFactor() + 1);\n\t\tsetZoomFactor(zoomFactor() - 1);\n\t}\n\n\tif (url().scheme() == QLatin1String(\"file\")) {\n\t\tQFileInfo info{url().toLocalFile()};\n\n\t\tif (info.isFile()) {\n\t\t\tif (!m_fileWatcher) {\n\t\t\t\tm_fileWatcher = new DelayedFileWatcher(this);\n\t\t\t\tconnect(m_fileWatcher, &DelayedFileWatcher::delayedFileChanged, this, &WebPage::watchedFileChanged);\n\t\t\t}\n\n\t\t\tconst QString filePath{url().toLocalFile()};\n\n\t\t\tif (QFile::exists(filePath) && !m_fileWatcher->files().contains(filePath))\n\t\t\t\tm_fileWatcher->addPath(filePath);\n\n\t\t}\n\t\telse if (m_fileWatcher && !m_fileWatcher->files().isEmpty())\n\t\t\tm_fileWatcher->removePaths(m_fileWatcher->files());\n\t}\n\n\tcleanBlockedObject();\n\n\tm_passwordEntries = Application::instance()->autoFill()->completePage(this, url());\n\n\temit pageRendering();\n}\n\nvoid WebPage::cleanBlockedObject()\n{\n\tADB::Manager* manager = ADB::Manager::instance();\n\n\tif (!manager->isEnabled())\n\t\treturn;\n\n\tconst QString elementHiding{manager->elementHidingRules(url())};\n\n\tif (!elementHiding.isEmpty())\n\t\trunJavaScript(WebPage::setCSS(elementHiding), QWebEngineScript::ApplicationWorld);\n\n\tconst QString siteElementHiding{manager->elementHidingRulesForDomain(url())};\n\n\tif (!siteElementHiding.isEmpty())\n\t\trunJavaScript(WebPage::setCSS(siteElementHiding), QWebEngineScript::ApplicationWorld);\n}\n\nvoid WebPage::urlChanged(const QUrl& url)\n{\n\n\tQ_UNUSED(url)\n\n\tif (isLoading())\n\t\tm_blockAlerts = false;\n}\n\nvoid WebPage::watchedFileChanged(const QString& file)\n{\n\tif (url().toLocalFile() == file)\n\t\ttriggerAction(QWebEnginePage::Reload);\n}\n\nvoid WebPage::windowCloseRequested()\n{\n\tif (!view())\n\t\treturn;\n\n\tview()->closeView();\n}\n\nvoid WebPage::featurePermissionRequested(const QUrl& origin, const QWebEnginePage::Feature& feature)\n{\n\tif (feature == MouseLock && view()->isFullScreen())\n\t\tsetFeaturePermission(origin, feature, PermissionGrantedByUser);\n\telse\n\t\tApplication::instance()->permissionsManager()->requestPermissions(this, origin, feature);\n}\n\nbool WebPage::acceptNavigationRequest(const QUrl& url, NavigationType type, bool isMainFrame)\n{\n\tif (!Application::instance()->plugins()->acceptNavigationRequest(this, url, type, isMainFrame))\n\t\treturn false;\n\n\tif (url.scheme() == QLatin1String(\"abp\") && ADB::Manager::instance()->addSubscriptionFromUrl(url))\n\t\treturn false;\n\n\treturn QWebEnginePage::acceptNavigationRequest(url, type, isMainFrame);\n}\n\nQWebEnginePage* WebPage::createWindow(QWebEnginePage::WebWindowType type)\n{\n\tTabbedWebView* tabbedWebView = qobject_cast<TabbedWebView*>(view());\n\tBrowserWindow* window = tabbedWebView ? tabbedWebView->browserWindow() : Application::instance()->getWindow();\n\n\tauto createTab = [=](Application::NewTabTypeFlags tabType)\n\t{\n\t\tint index{window->tabWidget()->addView(QUrl(), tabType)};\n\t\tTabbedWebView* view{window->webView(index)};\n\t\tview->setPage(new WebPage);\n\t\treturn view->page();\n\t};\n\n\tswitch (type) {\n\tcase QWebEnginePage::WebBrowserWindow: {\n\t\tBrowserWindow* window{Application::instance()->createWindow(Application::WT_NewWindow)};\n\t\tWebPage* page{new WebPage};\n\t\twindow->setStartPage(page);\n\t\treturn page;\n\t}\n\tcase QWebEnginePage::WebDialog: \/\/TODO: do\n\tcase QWebEnginePage::WebBrowserTab:\n\t\treturn createTab(Application::NTT_CleanSelectedTab);\n\tcase QWebEnginePage::WebBrowserBackgroundTab:\n\t\treturn createTab(Application::NTT_CleanNotSelectedTab);\n\tdefault:\n\t\tbreak;\n\t}\n\n\treturn Q_NULLPTR;\n\n}\n\nvoid WebPage::handleUnknowProtocol(const QUrl& url)\n{\n\tQSettings settings{};\n\n\tconst QString protocol = url.scheme();\n\tQStringList\n\t\tautoOpenProtocols{settings.value(\"Web-Settings\/AutomaticallyOpenProtocols\", QStringList()).toStringList()};\n\tQStringList blockedProtocols{settings.value(\"Web-Settings\/BlockedProtocols\", QStringList()).toStringList()};\n\n\tif (protocol == QLatin1String(\"mailto\")) {\n\t\tdesktopServiceOpen(url);\n\t\treturn;\n\t}\n\n\tif (blockedProtocols.contains(protocol))\n\t\treturn;\n\n\tif (autoOpenProtocols.contains(protocol)) {\n\t\tdesktopServiceOpen(url);\n\t\treturn;\n\t}\n\n\tCheckBoxDialog dialog(QMessageBox::Yes | QMessageBox::No, view());\n\n\tconst QString text{tr(\"Sielo is unable to process the <b>%1<\/b> protocol. \"\n\t\t\t\t\t\t\t  \"Do you want Sielo to try to open the \"\n\t\t\t\t\t\t\t  \"llink b>%2%<\/b> with an external application?\").arg(protocol, url.toString())};\n\tdialog.setText(text);\n\tdialog.setCheckBoxText(tr(\"Remember my action for this protocol\"));\n\tdialog.setWindowTitle(tr(\"Request of an external protocol\"));\n\n\tswitch (dialog.exec()) {\n\tcase QDialog::Accepted:\n\t\tif (dialog.isChecked()) {\n\t\t\tautoOpenProtocols.append(protocol);\n\t\t\tsettings.setValue(\"Web-Settings\/AutomaticallyOpenProtocols\", autoOpenProtocols);\n\t\t}\n\n\t\tQDesktopServices::openUrl(url);\n\t\tbreak;\n\tcase QDialog::Rejected:\n\t\tif (dialog.isChecked()) {\n\t\t\tblockedProtocols.append(protocol);\n\t\t\tsettings.setValue(\"Web-Settings\/BlockedProtocols\", blockedProtocols);\n\t\t}\n\tdefault:\n\t\tbreak;\n\t}\n\n}\n\nvoid WebPage::desktopServiceOpen(const QUrl& url)\n{\n\t\/\/TODO: do some actions\n\tQDesktopServices::openUrl(url);\n}\n\n}\n<commit_msg>[Add] Workaround for load finished<commit_after>\/***********************************************************************************\n** MIT License                                                                    **\n**                                                                                **\n** Copyright (c) 2018 Victor DENIS (victordenis01@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 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 \"Web\/WebPage.hpp\"\n\n#include <QPointer>\n#include <QTimer>\n#include <QDesktopServices>\n#include <QFileInfo>\n\n#include <QWebEngineSettings>\n#include <QWebChannel>\n\n#include <QMessageBox>\n\n#include <QSettings>\n\n#include \"Web\/WebHitTestResult.hpp\"\n#include \"Web\/WebView.hpp\"\n#include \"Web\/Tab\/TabbedWebView.hpp\"\n#include \"Web\/HTML5Permissions\/HTML5PermissionsManager.hpp\"\n#include \"Web\/Scripts.hpp\"\n\n#include \"Download\/DownloadManager.hpp\"\n\n#include \"AdBlock\/Manager.hpp\"\n\n#include \"Password\/AutoFill\/AutoFill.hpp\"\n\n#include \"Network\/NetworkManager.hpp\"\n\n#include \"Widgets\/CheckBoxDialog.hpp\"\n#include \"Widgets\/Tab\/TabWidget.hpp\"\n\n#include \"Utils\/DelayedFileWatcher.hpp\"\n#include \"Utils\/ExternalJsObject.hpp\"\n\n#include \"Plugins\/PluginProxy.hpp\"\n\n#include \"Application.hpp\"\n#include \"BrowserWindow.hpp\"\n\nnamespace Sn {\n\nQString WebPage::setCSS(const QString& css)\n{\n\tQString source = QLatin1String(\"(function() {\"\n\t\t\t\t\t\t\t\t\t   \"var head = document.getElementsByTagName('head')[0];\"\n\t\t\t\t\t\t\t\t\t   \"if (!head) return;\"\n\t\t\t\t\t\t\t\t\t   \"var css = document.createElement('style');\"\n\t\t\t\t\t\t\t\t\t   \"css.setAttribute('type', 'text\/css');\"\n\t\t\t\t\t\t\t\t\t   \"css.appendChild(document.createTextNode('%1'));\"\n\t\t\t\t\t\t\t\t\t   \"head.appendChild(css);\"\n\t\t\t\t\t\t\t\t\t   \"})()\");\n\n\tQString style = css;\n\tstyle.replace(QLatin1String(\"'\"), QLatin1String(\"\\\\'\"));\n\tstyle.replace(QLatin1String(\"\\n\"), QLatin1String(\"\\\\n\"));\n\treturn source.arg(style);\n}\n\nWebPage::WebPage(QObject* parent) :\n\tQWebEnginePage(Application::instance()->webProfile(), parent),\n\tm_runningLoop(nullptr),\n\tm_loadProgress(-1),\n\tm_blockAlerts(false),\n\tm_secureStatus(false),\n\tm_adjustingSheduled(false)\n{\n\n\tsetupWebChannel();\n\n\tconnect(this, &QWebEnginePage::loadProgress, this, &WebPage::progress);\n\tconnect(this, &QWebEnginePage::loadFinished, this, &WebPage::finished);\n\tconnect(this, &QWebEnginePage::urlChanged, this, &WebPage::urlChanged);\n\tconnect(this, &QWebEnginePage::featurePermissionRequested, this, &WebPage::featurePermissionRequested);\n\tconnect(this, &QWebEnginePage::windowCloseRequested, this, &WebPage::windowCloseRequested);\n\n\tconnect(this, &QWebEnginePage::authenticationRequired, this, [this](const QUrl& url, QAuthenticator* authenticator)\n\t{\n\t\tApplication::instance()->networkManager()->authentication(url, authenticator, view());\n\t});\n\n\t\/\/ Workaround for broken load started\/finished signals in QtWebEngine 5.10\n\tif (qstrncmp(qVersion(), \"5.10.\", 5) == 0) {\n\t\tconnect(this, &QWebEnginePage::loadProgress, this, [this](int progress) {\n\t\t\tif (progress == 100) {\n\t\t\t\temit loadFinished(true);\n\t\t\t}\n\t\t});\n\t}\n\n\tconnect(this,\n\t\t\t&QWebEnginePage::proxyAuthenticationRequired,\n\t\t\tthis,\n\t\t\t[this](const QUrl& url, QAuthenticator* authenticator, const QString& proxyHost)\n\t\t\t{\n\t\t\t\tQ_UNUSED(url);\n\t\t\t\tApplication::instance()->networkManager()->proxyAuthentication(proxyHost, authenticator, view());\n\t\t\t});\n}\n\nWebPage::~WebPage()\n{\n\tApplication::instance()->plugins()->emitWebPageDeleted(this);\n\n\tif (m_runningLoop) {\n\t\tm_runningLoop->exit(1);\n\t\tm_runningLoop = nullptr;\n\t}\n}\n\nWebView* WebPage::view() const\n{\n\treturn static_cast<WebView*>(QWebEnginePage::view());\n}\n\nQVariant WebPage::executeJavaScript(const QString& scriptSrc, quint32 worldId, int timeout)\n{\n\tQPointer<QEventLoop> loop{new QEventLoop};\n\tQVariant result{};\n\tQTimer::singleShot(timeout, loop.data(), &QEventLoop::quit);\n\n\trunJavaScript(scriptSrc, worldId, [loop, &result](const QVariant& res)\n\t{\n\t\tif (loop && loop->isRunning()) {\n\t\t\tresult = res;\n\t\t\tloop->quit();\n\t\t}\n\t});\n\n\tloop->exec();\n\tdelete loop;\n\n\treturn result;\n}\n\nQPointF WebPage::mapToViewport(const QPointF& pos) const\n{\n\treturn QPointF(pos.x() \/ zoomFactor(), pos.y() \/ zoomFactor());\n}\n\nWebHitTestResult WebPage::hitTestContent(const QPoint& pos) const\n{\n\treturn WebHitTestResult(this, pos);\n}\n\nvoid WebPage::scroll(int x, int y)\n{\n\trunJavaScript(QStringLiteral(\"window.scrollTo(window.scrollX + %1, window.scrollY + %2)\").arg(x).arg(y),\n\t\t\t\t  QWebEngineScript::ApplicationWorld);\n}\n\nvoid WebPage::setScrollPosition(const QPointF& pos)\n{\n\tconst QPointF v{mapToViewport(pos.toPoint())};\n\trunJavaScript(QStringLiteral(\"window.scrollTo(%1, %2)\").arg(v.x()).arg(v.y()));\n}\n\nvoid WebPage::javaScriptAlert(const QUrl& securityOrigin, const QString& msg)\n{\n\tQ_UNUSED(securityOrigin)\n\n\tif (m_blockAlerts || m_runningLoop)\n\t\treturn;\n\n\tQString title{tr(\"JavaScript Alert\")};\n\n\tif (!url().host().isEmpty())\n\t\ttitle.append(QString(\" - %1\").arg(url().host()));\n\n\tCheckBoxDialog dialog(QMessageBox::Ok, view());\n\tdialog.setWindowTitle(title);\n\tdialog.setText(msg);\n\tdialog.setCheckBoxText(tr(\"Prevent this page from creating additional dialogues box.\"));\n\tdialog.setIcon(QMessageBox::Information);\n\tdialog.exec();\n\n\tm_blockAlerts = dialog.isChecked();\n}\n\nvoid WebPage::setJavaScriptEnable(bool enabled)\n{\n\tsettings()->setAttribute(QWebEngineSettings::JavascriptEnabled, enabled);\n}\n\nbool WebPage::isRunningLoop()\n{\n\treturn m_runningLoop;\n}\n\nbool WebPage::isLoading() const\n{\n\treturn m_loadProgress < 100;\n}\n\nvoid WebPage::setupWebChannel()\n{\n\tQWebChannel* old = webChannel();\n\tconst QString objectName = QStringLiteral(\"sielo_object\");\n\tQWebChannel* channel{new QWebChannel(this)};\n\n\tchannel->registerObject(QStringLiteral(\"sielo_object\"), new ExternalJsObject(this));\n\tsetWebChannel(channel);\n\n\tif (old) {\n\t\tdelete old->registeredObjects().value(objectName);\n\t\tdelete old;\n\t}\n}\n\nvoid WebPage::progress(int progression)\n{\n\tm_loadProgress = progression;\n\n\tbool secStatus = url().scheme() == QLatin1String(\"https\");\n\n\tif (secStatus != m_secureStatus) {\n\t\tm_secureStatus = secStatus;\n\t\temit privacyChanged(secStatus);\n\t}\n}\n\nvoid WebPage::finished()\n{\n\tprogress(100);\n\n\tif (m_adjustingSheduled) {\n\t\tm_adjustingSheduled = false;\n\t\tsetZoomFactor(zoomFactor() + 1);\n\t\tsetZoomFactor(zoomFactor() - 1);\n\t}\n\n\tif (url().scheme() == QLatin1String(\"file\")) {\n\t\tQFileInfo info{url().toLocalFile()};\n\n\t\tif (info.isFile()) {\n\t\t\tif (!m_fileWatcher) {\n\t\t\t\tm_fileWatcher = new DelayedFileWatcher(this);\n\t\t\t\tconnect(m_fileWatcher, &DelayedFileWatcher::delayedFileChanged, this, &WebPage::watchedFileChanged);\n\t\t\t}\n\n\t\t\tconst QString filePath{url().toLocalFile()};\n\n\t\t\tif (QFile::exists(filePath) && !m_fileWatcher->files().contains(filePath))\n\t\t\t\tm_fileWatcher->addPath(filePath);\n\n\t\t}\n\t\telse if (m_fileWatcher && !m_fileWatcher->files().isEmpty())\n\t\t\tm_fileWatcher->removePaths(m_fileWatcher->files());\n\t}\n\n\tcleanBlockedObject();\n\n\tm_passwordEntries = Application::instance()->autoFill()->completePage(this, url());\n\n\temit pageRendering();\n}\n\nvoid WebPage::cleanBlockedObject()\n{\n\tADB::Manager* manager = ADB::Manager::instance();\n\n\tif (!manager->isEnabled())\n\t\treturn;\n\n\tconst QString elementHiding{manager->elementHidingRules(url())};\n\n\tif (!elementHiding.isEmpty())\n\t\trunJavaScript(WebPage::setCSS(elementHiding), QWebEngineScript::ApplicationWorld);\n\n\tconst QString siteElementHiding{manager->elementHidingRulesForDomain(url())};\n\n\tif (!siteElementHiding.isEmpty())\n\t\trunJavaScript(WebPage::setCSS(siteElementHiding), QWebEngineScript::ApplicationWorld);\n}\n\nvoid WebPage::urlChanged(const QUrl& url)\n{\n\n\tQ_UNUSED(url)\n\n\tif (isLoading())\n\t\tm_blockAlerts = false;\n}\n\nvoid WebPage::watchedFileChanged(const QString& file)\n{\n\tif (url().toLocalFile() == file)\n\t\ttriggerAction(QWebEnginePage::Reload);\n}\n\nvoid WebPage::windowCloseRequested()\n{\n\tif (!view())\n\t\treturn;\n\n\tview()->closeView();\n}\n\nvoid WebPage::featurePermissionRequested(const QUrl& origin, const QWebEnginePage::Feature& feature)\n{\n\tif (feature == MouseLock && view()->isFullScreen())\n\t\tsetFeaturePermission(origin, feature, PermissionGrantedByUser);\n\telse\n\t\tApplication::instance()->permissionsManager()->requestPermissions(this, origin, feature);\n}\n\nbool WebPage::acceptNavigationRequest(const QUrl& url, NavigationType type, bool isMainFrame)\n{\n\tif (!Application::instance()->plugins()->acceptNavigationRequest(this, url, type, isMainFrame))\n\t\treturn false;\n\n\tif (url.scheme() == QLatin1String(\"abp\") && ADB::Manager::instance()->addSubscriptionFromUrl(url))\n\t\treturn false;\n\n\treturn QWebEnginePage::acceptNavigationRequest(url, type, isMainFrame);\n}\n\nQWebEnginePage* WebPage::createWindow(QWebEnginePage::WebWindowType type)\n{\n\tTabbedWebView* tabbedWebView = qobject_cast<TabbedWebView*>(view());\n\tBrowserWindow* window = tabbedWebView ? tabbedWebView->browserWindow() : Application::instance()->getWindow();\n\n\tauto createTab = [=](Application::NewTabTypeFlags tabType)\n\t{\n\t\tint index{window->tabWidget()->addView(QUrl(), tabType)};\n\t\tTabbedWebView* view{window->webView(index)};\n\t\tview->setPage(new WebPage);\n\t\treturn view->page();\n\t};\n\n\tswitch (type) {\n\tcase QWebEnginePage::WebBrowserWindow: {\n\t\tBrowserWindow* window{Application::instance()->createWindow(Application::WT_NewWindow)};\n\t\tWebPage* page{new WebPage};\n\t\twindow->setStartPage(page);\n\t\treturn page;\n\t}\n\tcase QWebEnginePage::WebDialog: \/\/TODO: do\n\tcase QWebEnginePage::WebBrowserTab:\n\t\treturn createTab(Application::NTT_CleanSelectedTab);\n\tcase QWebEnginePage::WebBrowserBackgroundTab:\n\t\treturn createTab(Application::NTT_CleanNotSelectedTab);\n\tdefault:\n\t\tbreak;\n\t}\n\n\treturn Q_NULLPTR;\n\n}\n\nvoid WebPage::handleUnknowProtocol(const QUrl& url)\n{\n\tQSettings settings{};\n\n\tconst QString protocol = url.scheme();\n\tQStringList\n\t\tautoOpenProtocols{settings.value(\"Web-Settings\/AutomaticallyOpenProtocols\", QStringList()).toStringList()};\n\tQStringList blockedProtocols{settings.value(\"Web-Settings\/BlockedProtocols\", QStringList()).toStringList()};\n\n\tif (protocol == QLatin1String(\"mailto\")) {\n\t\tdesktopServiceOpen(url);\n\t\treturn;\n\t}\n\n\tif (blockedProtocols.contains(protocol))\n\t\treturn;\n\n\tif (autoOpenProtocols.contains(protocol)) {\n\t\tdesktopServiceOpen(url);\n\t\treturn;\n\t}\n\n\tCheckBoxDialog dialog(QMessageBox::Yes | QMessageBox::No, view());\n\n\tconst QString text{tr(\"Sielo is unable to process the <b>%1<\/b> protocol. \"\n\t\t\t\t\t\t\t  \"Do you want Sielo to try to open the \"\n\t\t\t\t\t\t\t  \"llink b>%2%<\/b> with an external application?\").arg(protocol, url.toString())};\n\tdialog.setText(text);\n\tdialog.setCheckBoxText(tr(\"Remember my action for this protocol\"));\n\tdialog.setWindowTitle(tr(\"Request of an external protocol\"));\n\n\tswitch (dialog.exec()) {\n\tcase QDialog::Accepted:\n\t\tif (dialog.isChecked()) {\n\t\t\tautoOpenProtocols.append(protocol);\n\t\t\tsettings.setValue(\"Web-Settings\/AutomaticallyOpenProtocols\", autoOpenProtocols);\n\t\t}\n\n\t\tQDesktopServices::openUrl(url);\n\t\tbreak;\n\tcase QDialog::Rejected:\n\t\tif (dialog.isChecked()) {\n\t\t\tblockedProtocols.append(protocol);\n\t\t\tsettings.setValue(\"Web-Settings\/BlockedProtocols\", blockedProtocols);\n\t\t}\n\tdefault:\n\t\tbreak;\n\t}\n\n}\n\nvoid WebPage::desktopServiceOpen(const QUrl& url)\n{\n\t\/\/TODO: do some actions\n\tQDesktopServices::openUrl(url);\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Aspia Project\n\/\/ Copyright (C) 2020 Dmitry Chapyshev <dmitry@aspia.ru>\n\/\/\n\/\/ This program is free software: you can redistribute it and\/or modify\n\/\/ it under the terms of the GNU General Public License as published by\n\/\/ the Free Software Foundation, either version 3 of the License, or\n\/\/ (at your option) any later version.\n\/\/\n\/\/ This program is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\/\/ GNU General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU General Public License\n\/\/ along with this program. If not, see <https:\/\/www.gnu.org\/licenses\/>.\n\/\/\n\n#include \"base\/logging.h\"\n\n#include \"base\/debug.h\"\n#include \"base\/system_time.h\"\n\n#if defined(OS_WIN)\n#include \"base\/strings\/unicode.h\"\n#endif \/\/ defined(OS_WIN)\n\n#include <fstream>\n#include <iomanip>\n#include <mutex>\n#include <ostream>\n#include <thread>\n\n#if defined(OS_WIN)\n#include <Windows.h>\n#include <Psapi.h>\n#endif \/\/ defined(OS_WIN)\n\nnamespace base {\n\nnamespace {\n\nLoggingSeverity g_min_log_level = LS_INFO;\nLoggingDestination g_logging_destination = LOG_DEFAULT;\n\nstd::ofstream g_log_file;\nstd::mutex g_log_file_lock;\n\nconst char* severityName(LoggingSeverity severity)\n{\n    static const char* const kLogSeverityNames[] =\n    {\n        \"INFO\", \"WARNING\", \"ERROR\", \"FATAL\"\n    };\n\n    static_assert(LS_NUMBER == std::size(kLogSeverityNames));\n\n    if (severity >= 0 && severity < LS_NUMBER)\n        return kLogSeverityNames[severity];\n\n    return \"UNKNOWN\";\n}\n\nvoid removeOldFiles(const std::filesystem::path& path,\n                    const std::filesystem::file_time_type& current_time,\n                    int max_file_age)\n{\n    std::filesystem::file_time_type time = current_time - std::chrono::hours(24 * max_file_age);\n\n    std::error_code ignored_code;\n    for (const auto& item : std::filesystem::directory_iterator(path, ignored_code))\n    {\n        if (item.is_directory())\n            continue;\n\n        if (item.last_write_time() < time)\n            std::filesystem::remove(item.path(), ignored_code);\n    }\n}\n\nstd::filesystem::path defaultLogFileDir()\n{\n    std::error_code error_code;\n\n    std::filesystem::path path = std::filesystem::temp_directory_path(error_code);\n    if (error_code)\n        return std::filesystem::path();\n\n    return path;\n}\n\nbool initLoggingImpl(const LoggingSettings& settings)\n{\n    std::scoped_lock lock(g_log_file_lock);\n    g_log_file.close();\n\n    g_logging_destination = settings.destination;\n\n    if (!(g_logging_destination & LOG_TO_FILE))\n        return true;\n\n    std::filesystem::path file_dir = settings.log_dir;\n\n    if (file_dir.empty())\n        file_dir = defaultLogFileDir();\n\n    if (file_dir.empty())\n        return false;\n\n    std::error_code error_code;\n    if (!std::filesystem::exists(file_dir, error_code))\n    {\n        if (error_code)\n            return false;\n\n        if (!std::filesystem::create_directories(file_dir, error_code))\n            return false;\n    }\n\n    SystemTime time = SystemTime::now();\n\n    std::ostringstream file_name_stream;\n    file_name_stream << std::setfill('0')\n                     << std::setw(4) << time.year()\n                     << std::setw(2) << time.month()\n                     << std::setw(2) << time.day()\n                     << '-'\n                     << std::setw(2) << time.hour()\n                     << std::setw(2) << time.minute()\n                     << std::setw(2) << time.second()\n                     << '.'\n                     << std::setw(3) << time.millisecond()\n                     << \".log\";\n\n    std::filesystem::path file_path(file_dir);\n    file_path.append(file_name_stream.str());\n\n    g_log_file.open(file_path);\n    if (!g_log_file.is_open())\n        return false;\n\n    std::filesystem::file_time_type file_time =\n        std::filesystem::last_write_time(file_path, error_code);\n    if (!error_code)\n        removeOldFiles(file_dir, file_time, settings.max_log_age);\n\n    return true;\n}\n\n} \/\/ namespace\n\n\/\/ This is never instantiated, it's just used for EAT_STREAM_PARAMETERS to have\n\/\/ an object of the correct type on the LHS of the unused part of the ternary\n\/\/ operator.\nstd::ostream* g_swallow_stream;\n\nLoggingSettings::LoggingSettings()\n    : destination(LOG_DEFAULT),\n      min_log_level(LS_INFO),\n      max_log_age(7)\n{\n    \/\/ Nothing\n}\n\nbool initLogging(const LoggingSettings& settings)\n{\n    if (!initLoggingImpl(settings))\n        return false;\n\n#if defined(OS_WIN)\n    wchar_t buffer[MAX_PATH] = { 0 };\n\n    if (GetModuleFileNameExW(GetCurrentProcess(), nullptr, buffer, std::size(buffer)))\n    {\n        LOG(LS_INFO) << \"Executable file: \" << buffer;\n    }\n\n#if defined(NDEBUG)\n    LOG(LS_INFO) << \"Debug build: No\";\n#else\n    LOG(LS_INFO) << \"Debug build: Yes\";\n#endif \/\/ defined(NDEBUG)\n#else\n    #warning Not implemented\n#endif\n\n    LOG(LS_INFO) << \"Debugger present: \" << (isDebuggerPresent() ? \"Yes\" : \"No\");\n    LOG(LS_INFO) << \"Logging started\";\n    return true;\n}\n\nvoid shutdownLogging()\n{\n    LOG(LS_INFO) << \"Logging finished\";\n\n    std::scoped_lock lock(g_log_file_lock);\n    g_log_file.close();\n}\n\nbool shouldCreateLogMessage(LoggingSeverity severity)\n{\n    if (severity < g_min_log_level)\n        return false;\n\n    \/\/ Return true here unless we know ~LogMessage won't do anything. Note that\n    \/\/ ~LogMessage writes to stderr if severity_ >= kAlwaysPrintErrorLevel, even\n    \/\/ when g_logging_destination is LOG_NONE.\n    return g_logging_destination != LOG_NONE || severity >= LS_ERROR;\n}\n\nvoid makeCheckOpValueString(std::ostream* os, std::nullptr_t \/* p *\/)\n{\n    (*os) << \"nullptr\";\n}\n\nstd::string* makeCheckOpString(const int& v1, const int& v2, const char* names)\n{\n    return makeCheckOpString<int, int>(v1, v2, names);\n}\n\nstd::string* makeCheckOpString(const unsigned long& v1, const unsigned long& v2, const char* names)\n{\n    return makeCheckOpString<unsigned long, unsigned long>(v1, v2, names);\n}\n\nstd::string* makeCheckOpString(const unsigned int& v1, const unsigned int& v2, const char* names)\n{\n    return makeCheckOpString<unsigned int, unsigned int>(v1, v2, names);\n}\n\nstd::string* makeCheckOpString(const unsigned long long& v1,\n                               const unsigned long long& v2,\n                               const char* names)\n{\n    return makeCheckOpString<unsigned long long, unsigned long long>(v1, v2, names);\n}\n\nstd::string* makeCheckOpString(const unsigned long& v1, const unsigned int& v2, const char* names)\n{\n    return makeCheckOpString<unsigned long, int>(v1, v2, names);\n}\n\nstd::string* makeCheckOpString(const unsigned int& v1, const unsigned long& v2, const char* names)\n{\n    return makeCheckOpString<unsigned int, unsigned long>(v1, v2, names);\n}\n\nstd::string* makeCheckOpString(const std::string& v1, const std::string& v2, const char* names)\n{\n    return makeCheckOpString<std::string, std::string>(v1, v2, names);\n}\n\nLogMessage::LogMessage(std::string_view file, int line, LoggingSeverity severity)\n    : severity_(severity)\n{\n    init(file, line);\n}\n\nLogMessage::LogMessage(std::string_view file, int line, const char* condition)\n    : severity_(LS_FATAL)\n{\n    init(file, line);\n    stream_ << \"Check failed: \" << condition << \". \";\n}\n\nLogMessage::LogMessage(std::string_view file, int line, std::string* result)\n    : severity_(LS_FATAL)\n{\n    std::unique_ptr<std::string> result_deleter(result);\n    init(file, line);\n    stream_ << \"Check failed: \" << *result;\n}\n\nLogMessage::LogMessage(std::string_view file,\n                       int line,\n                       LoggingSeverity severity,\n                       std::string* result)\n    : severity_(severity)\n{\n    std::unique_ptr<std::string> result_deleter(result);\n    init(file, line);\n    stream_ << \"Check failed: \" << *result;\n}\n\nLogMessage::~LogMessage()\n{\n    stream_ << std::endl;\n\n    std::string message(stream_.str());\n\n    if ((g_logging_destination & LOG_TO_SYSTEM_DEBUG_LOG) != 0)\n    {\n        debugPrint(message.data());\n\n        fwrite(message.data(), message.size(), 1, stderr);\n        fflush(stderr);\n    }\n    else if (severity_ >= LS_ERROR)\n    {\n        \/\/ When we're only outputting to a log file, above a certain log level, we\n        \/\/ should still output to stderr so that we can better detect and diagnose\n        \/\/ problems with unit tests, especially on the buildbots.\n        fwrite(message.data(), message.size(), 1, stderr);\n        fflush(stderr);\n    }\n\n    \/\/ Write to log file.\n    if ((g_logging_destination & LOG_TO_FILE) != 0)\n    {\n        std::scoped_lock lock(g_log_file_lock);\n        g_log_file.write(message.c_str(), message.size());\n        g_log_file.flush();\n    }\n\n    if (severity_ == LS_FATAL)\n    {\n        \/\/ Crash the process.\n        debugBreak();\n    }\n}\n\n\/\/ Writes the common header info to the stream.\nvoid LogMessage::init(std::string_view file, int line)\n{\n    size_t last_slash_pos = file.find_last_of(\"\\\\\/\");\n    if (last_slash_pos != std::string_view::npos)\n        file.remove_prefix(last_slash_pos + 1);\n\n    SystemTime time = SystemTime::now();\n\n    stream_ << std::setfill('0')\n            << std::setw(2) << time.hour()        << ':'\n            << std::setw(2) << time.minute()      << ':'\n            << std::setw(2) << time.second()      << '.'\n            << std::setw(3) << time.millisecond() << ' '\n            << std::this_thread::get_id()         << ' '\n            << severityName(severity_)            << ' '\n            << file.data() << \":\" << line << \"] \";\n\n    message_start_ = stream_.str().length();\n}\n\nErrorLogMessage::ErrorLogMessage(std::string_view file,\n                                 int line,\n                                 LoggingSeverity severity,\n                                 SystemError error)\n    : error_(error),\n      log_message_(file, line, severity)\n{\n    \/\/ Nothing\n}\n\nErrorLogMessage::~ErrorLogMessage()\n{\n    stream() << \": \" << error_.toString();\n}\n\nvoid logErrorNotReached(const char* file, int line)\n{\n    LogMessage(file, line, LS_ERROR).stream() << \"NOTREACHED() hit.\";\n}\n\n} \/\/ namespace base\n\nnamespace std {\n\n#if defined(OS_WIN)\nstd::ostream& operator<<(std::ostream& out, const std::wstring& wstr)\n{\n    return out << base::utf8FromWide(wstr);\n}\n\nstd::ostream& std::operator<<(std::ostream& out, const wchar_t* wstr)\n{\n    return out << (wstr ? base::utf8FromWide(wstr) : \"nullptr\");\n}\n#endif \/\/ defined(OS_WIN)\n\nstd::ostream& operator<<(std::ostream& out, const char16_t* ustr)\n{\n    return out << (ustr ? base::utf8FromUtf16(ustr) : \"nullptr\");\n}\n\nstd::ostream& operator<<(std::ostream& out, const std::u16string& ustr)\n{\n    return out << base::utf8FromUtf16(ustr);\n}\n\n} \/\/ namespace std\n<commit_msg>File name prefix.<commit_after>\/\/\n\/\/ Aspia Project\n\/\/ Copyright (C) 2020 Dmitry Chapyshev <dmitry@aspia.ru>\n\/\/\n\/\/ This program is free software: you can redistribute it and\/or modify\n\/\/ it under the terms of the GNU General Public License as published by\n\/\/ the Free Software Foundation, either version 3 of the License, or\n\/\/ (at your option) any later version.\n\/\/\n\/\/ This program is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\/\/ GNU General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU General Public License\n\/\/ along with this program. If not, see <https:\/\/www.gnu.org\/licenses\/>.\n\/\/\n\n#include \"base\/logging.h\"\n\n#include \"base\/debug.h\"\n#include \"base\/system_time.h\"\n\n#if defined(OS_WIN)\n#include \"base\/strings\/unicode.h\"\n#endif \/\/ defined(OS_WIN)\n\n#include <fstream>\n#include <iomanip>\n#include <mutex>\n#include <ostream>\n#include <thread>\n\n#if defined(OS_WIN)\n#include <Windows.h>\n#include <Psapi.h>\n#endif \/\/ defined(OS_WIN)\n\nnamespace base {\n\nnamespace {\n\nLoggingSeverity g_min_log_level = LS_INFO;\nLoggingDestination g_logging_destination = LOG_DEFAULT;\n\nstd::ofstream g_log_file;\nstd::mutex g_log_file_lock;\n\nconst char* severityName(LoggingSeverity severity)\n{\n    static const char* const kLogSeverityNames[] =\n    {\n        \"INFO\", \"WARNING\", \"ERROR\", \"FATAL\"\n    };\n\n    static_assert(LS_NUMBER == std::size(kLogSeverityNames));\n\n    if (severity >= 0 && severity < LS_NUMBER)\n        return kLogSeverityNames[severity];\n\n    return \"UNKNOWN\";\n}\n\nvoid removeOldFiles(const std::filesystem::path& path,\n                    const std::filesystem::file_time_type& current_time,\n                    int max_file_age)\n{\n    std::filesystem::file_time_type time = current_time - std::chrono::hours(24 * max_file_age);\n\n    std::error_code ignored_code;\n    for (const auto& item : std::filesystem::directory_iterator(path, ignored_code))\n    {\n        if (item.is_directory())\n            continue;\n\n        if (item.last_write_time() < time)\n            std::filesystem::remove(item.path(), ignored_code);\n    }\n}\n\nstd::filesystem::path defaultLogFileDir()\n{\n    std::error_code error_code;\n\n    std::filesystem::path path = std::filesystem::temp_directory_path(error_code);\n    if (error_code)\n        return std::filesystem::path();\n\n    return path;\n}\n\nbool initLoggingImpl(const LoggingSettings& settings, const std::filesystem::path& file_name)\n{\n    std::scoped_lock lock(g_log_file_lock);\n    g_log_file.close();\n\n    g_logging_destination = settings.destination;\n\n    if (!(g_logging_destination & LOG_TO_FILE))\n        return true;\n\n    std::filesystem::path file_dir = settings.log_dir;\n\n    if (file_dir.empty())\n        file_dir = defaultLogFileDir();\n\n    if (file_dir.empty())\n        return false;\n\n    std::error_code error_code;\n    if (!std::filesystem::exists(file_dir, error_code))\n    {\n        if (error_code)\n            return false;\n\n        if (!std::filesystem::create_directories(file_dir, error_code))\n            return false;\n    }\n\n    SystemTime time = SystemTime::now();\n\n    std::ostringstream file_name_stream;\n    file_name_stream << file_name.c_str() << '-'\n                     << std::setfill('0')\n                     << std::setw(4) << time.year()\n                     << std::setw(2) << time.month()\n                     << std::setw(2) << time.day()\n                     << '-'\n                     << std::setw(2) << time.hour()\n                     << std::setw(2) << time.minute()\n                     << std::setw(2) << time.second()\n                     << '.'\n                     << std::setw(3) << time.millisecond()\n                     << \".log\";\n\n    std::filesystem::path file_path(file_dir);\n    file_path.append(file_name_stream.str());\n\n    g_log_file.open(file_path);\n    if (!g_log_file.is_open())\n        return false;\n\n    std::filesystem::file_time_type file_time =\n        std::filesystem::last_write_time(file_path, error_code);\n    if (!error_code)\n        removeOldFiles(file_dir, file_time, settings.max_log_age);\n\n    return true;\n}\n\n} \/\/ namespace\n\n\/\/ This is never instantiated, it's just used for EAT_STREAM_PARAMETERS to have\n\/\/ an object of the correct type on the LHS of the unused part of the ternary\n\/\/ operator.\nstd::ostream* g_swallow_stream;\n\nLoggingSettings::LoggingSettings()\n    : destination(LOG_DEFAULT),\n      min_log_level(LS_INFO),\n      max_log_age(7)\n{\n    \/\/ Nothing\n}\n\nbool initLogging(const LoggingSettings& settings)\n{\n    std::filesystem::path file_path;\n#if defined(OS_WIN)\n    wchar_t buffer[MAX_PATH] = { 0 };\n    GetModuleFileNameExW(GetCurrentProcess(), nullptr, buffer, std::size(buffer));\n    file_path = buffer;\n#else\n    file_path = \"unknown\";\n#endif\n\n    std::filesystem::path file_name = file_path.filename();\n    file_name.replace_extension();\n\n    if (!initLoggingImpl(settings, file_name))\n        return false;\n\n    LOG(LS_INFO) << \"Executable file: \" << file_path.c_str();\n    LOG(LS_INFO) << \"Debugger present: \" << (isDebuggerPresent() ? \"Yes\" : \"No\");\n\n#if defined(OS_WIN)\n#if defined(NDEBUG)\n    LOG(LS_INFO) << \"Debug build: No\";\n#else\n    LOG(LS_INFO) << \"Debug build: Yes\";\n#endif \/\/ defined(NDEBUG)\n#else\n    #warning Not implemented\n#endif\n\n    LOG(LS_INFO) << \"Logging started\";\n    return true;\n}\n\nvoid shutdownLogging()\n{\n    LOG(LS_INFO) << \"Logging finished\";\n\n    std::scoped_lock lock(g_log_file_lock);\n    g_log_file.close();\n}\n\nbool shouldCreateLogMessage(LoggingSeverity severity)\n{\n    if (severity < g_min_log_level)\n        return false;\n\n    \/\/ Return true here unless we know ~LogMessage won't do anything. Note that\n    \/\/ ~LogMessage writes to stderr if severity_ >= kAlwaysPrintErrorLevel, even\n    \/\/ when g_logging_destination is LOG_NONE.\n    return g_logging_destination != LOG_NONE || severity >= LS_ERROR;\n}\n\nvoid makeCheckOpValueString(std::ostream* os, std::nullptr_t \/* p *\/)\n{\n    (*os) << \"nullptr\";\n}\n\nstd::string* makeCheckOpString(const int& v1, const int& v2, const char* names)\n{\n    return makeCheckOpString<int, int>(v1, v2, names);\n}\n\nstd::string* makeCheckOpString(const unsigned long& v1, const unsigned long& v2, const char* names)\n{\n    return makeCheckOpString<unsigned long, unsigned long>(v1, v2, names);\n}\n\nstd::string* makeCheckOpString(const unsigned int& v1, const unsigned int& v2, const char* names)\n{\n    return makeCheckOpString<unsigned int, unsigned int>(v1, v2, names);\n}\n\nstd::string* makeCheckOpString(const unsigned long long& v1,\n                               const unsigned long long& v2,\n                               const char* names)\n{\n    return makeCheckOpString<unsigned long long, unsigned long long>(v1, v2, names);\n}\n\nstd::string* makeCheckOpString(const unsigned long& v1, const unsigned int& v2, const char* names)\n{\n    return makeCheckOpString<unsigned long, int>(v1, v2, names);\n}\n\nstd::string* makeCheckOpString(const unsigned int& v1, const unsigned long& v2, const char* names)\n{\n    return makeCheckOpString<unsigned int, unsigned long>(v1, v2, names);\n}\n\nstd::string* makeCheckOpString(const std::string& v1, const std::string& v2, const char* names)\n{\n    return makeCheckOpString<std::string, std::string>(v1, v2, names);\n}\n\nLogMessage::LogMessage(std::string_view file, int line, LoggingSeverity severity)\n    : severity_(severity)\n{\n    init(file, line);\n}\n\nLogMessage::LogMessage(std::string_view file, int line, const char* condition)\n    : severity_(LS_FATAL)\n{\n    init(file, line);\n    stream_ << \"Check failed: \" << condition << \". \";\n}\n\nLogMessage::LogMessage(std::string_view file, int line, std::string* result)\n    : severity_(LS_FATAL)\n{\n    std::unique_ptr<std::string> result_deleter(result);\n    init(file, line);\n    stream_ << \"Check failed: \" << *result;\n}\n\nLogMessage::LogMessage(std::string_view file,\n                       int line,\n                       LoggingSeverity severity,\n                       std::string* result)\n    : severity_(severity)\n{\n    std::unique_ptr<std::string> result_deleter(result);\n    init(file, line);\n    stream_ << \"Check failed: \" << *result;\n}\n\nLogMessage::~LogMessage()\n{\n    stream_ << std::endl;\n\n    std::string message(stream_.str());\n\n    if ((g_logging_destination & LOG_TO_SYSTEM_DEBUG_LOG) != 0)\n    {\n        debugPrint(message.data());\n\n        fwrite(message.data(), message.size(), 1, stderr);\n        fflush(stderr);\n    }\n    else if (severity_ >= LS_ERROR)\n    {\n        \/\/ When we're only outputting to a log file, above a certain log level, we\n        \/\/ should still output to stderr so that we can better detect and diagnose\n        \/\/ problems with unit tests, especially on the buildbots.\n        fwrite(message.data(), message.size(), 1, stderr);\n        fflush(stderr);\n    }\n\n    \/\/ Write to log file.\n    if ((g_logging_destination & LOG_TO_FILE) != 0)\n    {\n        std::scoped_lock lock(g_log_file_lock);\n        g_log_file.write(message.c_str(), message.size());\n        g_log_file.flush();\n    }\n\n    if (severity_ == LS_FATAL)\n    {\n        \/\/ Crash the process.\n        debugBreak();\n    }\n}\n\n\/\/ Writes the common header info to the stream.\nvoid LogMessage::init(std::string_view file, int line)\n{\n    size_t last_slash_pos = file.find_last_of(\"\\\\\/\");\n    if (last_slash_pos != std::string_view::npos)\n        file.remove_prefix(last_slash_pos + 1);\n\n    SystemTime time = SystemTime::now();\n\n    stream_ << std::setfill('0')\n            << std::setw(2) << time.hour()        << ':'\n            << std::setw(2) << time.minute()      << ':'\n            << std::setw(2) << time.second()      << '.'\n            << std::setw(3) << time.millisecond() << ' '\n            << std::this_thread::get_id()         << ' '\n            << severityName(severity_)            << ' '\n            << file.data() << \":\" << line << \"] \";\n\n    message_start_ = stream_.str().length();\n}\n\nErrorLogMessage::ErrorLogMessage(std::string_view file,\n                                 int line,\n                                 LoggingSeverity severity,\n                                 SystemError error)\n    : error_(error),\n      log_message_(file, line, severity)\n{\n    \/\/ Nothing\n}\n\nErrorLogMessage::~ErrorLogMessage()\n{\n    stream() << \": \" << error_.toString();\n}\n\nvoid logErrorNotReached(const char* file, int line)\n{\n    LogMessage(file, line, LS_ERROR).stream() << \"NOTREACHED() hit.\";\n}\n\n} \/\/ namespace base\n\nnamespace std {\n\n#if defined(OS_WIN)\nstd::ostream& operator<<(std::ostream& out, const std::wstring& wstr)\n{\n    return out << base::utf8FromWide(wstr);\n}\n\nstd::ostream& std::operator<<(std::ostream& out, const wchar_t* wstr)\n{\n    return out << (wstr ? base::utf8FromWide(wstr) : \"nullptr\");\n}\n#endif \/\/ defined(OS_WIN)\n\nstd::ostream& operator<<(std::ostream& out, const char16_t* ustr)\n{\n    return out << (ustr ? base::utf8FromUtf16(ustr) : \"nullptr\");\n}\n\nstd::ostream& operator<<(std::ostream& out, const std::u16string& ustr)\n{\n    return out << base::utf8FromUtf16(ustr);\n}\n\n} \/\/ namespace std\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 \"quickitemnodeinstance.h\"\n\n#include \"qt5nodeinstanceserver.h\"\n\n#include <QQmlExpression>\n#include <QQuickView>\n#include <cmath>\n\n#include <private\/qquicktextinput_p.h>\n#include <private\/qquicktextedit_p.h>\n\n#include <QHash>\n\n#include <QDebug>\n\nnamespace QmlDesigner {\nnamespace Internal {\n\nQuickItemNodeInstance::QuickItemNodeInstance(QQuickItem *item)\n   : GraphicalNodeInstance(item),\n     m_isResizable(true),\n     m_isMovable(true)\n{\n}\n\nQuickItemNodeInstance::~QuickItemNodeInstance()\n{\n}\n\nstatic bool isContentItem(QQuickItem *item, NodeInstanceServer *nodeInstanceServer)\n{\n\n    return item->parentItem()\n            && nodeInstanceServer->hasInstanceForObject(item->parentItem())\n            && nodeInstanceServer->instanceForObject(item->parentItem()).internalInstance()->contentItem() == item;\n}\n\nstatic QTransform transformForItem(QQuickItem *item, NodeInstanceServer *nodeInstanceServer)\n{\n    if (isContentItem(item, nodeInstanceServer))\n        return QTransform();\n\n    QTransform toParentTransform = DesignerSupport::parentTransform(item);\n    if (item->parentItem() && !nodeInstanceServer->hasInstanceForObject(item->parentItem())) {\n\n        return transformForItem(item->parentItem(), nodeInstanceServer) * toParentTransform;\n    }\n\n    return toParentTransform;\n}\n\nQTransform QuickItemNodeInstance::transform() const\n{\n    return transformForItem(quickItem(), nodeInstanceServer());\n}\n\n\nQObject *QuickItemNodeInstance::parent() const\n{\n    if (!quickItem() || !quickItem()->parentItem())\n        return 0;\n\n    return quickItem()->parentItem();\n}\nbool QuickItemNodeInstance::isMovable() const\n{\n    if (isRootNodeInstance())\n        return false;\n\n    return m_isMovable && quickItem() && quickItem()->parentItem();\n}\n\nvoid QuickItemNodeInstance::setMovable(bool movable)\n{\n    m_isMovable = movable;\n}\n\nQuickItemNodeInstance::Pointer QuickItemNodeInstance::create(QObject *object)\n{\n    QQuickItem *quickItem = qobject_cast<QQuickItem*>(object);\n\n    Q_ASSERT(quickItem);\n\n    Pointer instance(new QuickItemNodeInstance(quickItem));\n\n    instance->setHasContent(anyItemHasContent(quickItem));\n    quickItem->setFlag(QQuickItem::ItemHasContents, true);\n\n    static_cast<QQmlParserStatus*>(quickItem)->classBegin();\n\n    instance->populateResetHashes();\n\n    return instance;\n}\n\nQQuickItem *QuickItemNodeInstance::contentItem() const\n{\n    return m_contentItem.data();\n}\n\nvoid QuickItemNodeInstance::doComponentComplete()\n{\n    GraphicalNodeInstance::doComponentComplete();\n\n    QQmlProperty contentItemProperty(quickItem(), \"contentItem\", engine());\n    if (contentItemProperty.isValid())\n        m_contentItem = contentItemProperty.read().value<QQuickItem*>();\n}\n\nQRectF QuickItemNodeInstance::contentItemBoundingBox() const\n{\n    if (contentItem()) {\n        QTransform contentItemTransform = DesignerSupport::parentTransform(contentItem());\n        return contentItemTransform.mapRect(contentItem()->boundingRect());\n    }\n\n    return QRectF();\n}\n\nQTransform QuickItemNodeInstance::contentItemTransform() const\n{\n    return DesignerSupport::parentTransform(contentItem());\n}\n\n\nbool QuickItemNodeInstance::isQuickItem() const\n{\n    return true;\n}\n\nbool QuickItemNodeInstance::isResizable() const\n{\n    if (isRootNodeInstance())\n        return false;\n\n    return m_isResizable && quickItem() && quickItem()->parentItem();\n}\n\nvoid QuickItemNodeInstance::setResizable(bool resizable)\n{\n    m_isResizable = resizable;\n}\n\nvoid QuickItemNodeInstance::reparent(const ObjectNodeInstance::Pointer &oldParentInstance, const PropertyName &oldParentProperty, const ObjectNodeInstance::Pointer &newParentInstance, const PropertyName &newParentProperty)\n{\n    if (oldParentInstance && oldParentInstance->isPositioner()) {\n        setInLayoutable(false);\n        setMovable(true);\n    }\n\n    ObjectNodeInstance::reparent(oldParentInstance, oldParentProperty, newParentInstance, newParentProperty);\n\n    if (newParentInstance && newParentInstance->isPositioner()) {\n        setInLayoutable(true);\n        setMovable(false);\n    }\n\n    if (oldParentInstance && oldParentInstance->isPositioner() && !(newParentInstance && newParentInstance->isPositioner())) {\n        if (!hasBindingForProperty(\"x\"))\n            setPropertyVariant(\"x\", x());\n\n        if (!hasBindingForProperty(\"y\"))\n            setPropertyVariant(\"y\", y());\n    }\n\n    refresh();\n    DesignerSupport::updateDirtyNode(quickItem());\n\n    if (parentInstance() && isInLayoutable())\n        parentInstance()->refreshLayoutable();\n}\n\nbool QuickItemNodeInstance::isAnchoredBySibling() const\n{\n    if (quickItem()->parentItem()) {\n        foreach (QQuickItem *siblingItem, quickItem()->parentItem()->childItems()) { \/\/ search in siblings for a anchor to this item\n            if (siblingItem) {\n                if (DesignerSupport::isAnchoredTo(siblingItem, quickItem()))\n                    return true;\n            }\n        }\n    }\n\n    return false;\n}\n\n\n\nQQuickItem *QuickItemNodeInstance::quickItem() const\n{\n    if (object() == 0)\n        return 0;\n\n    return static_cast<QQuickItem*>(object());\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace QmlDesigner\n\n<commit_msg>QmlDesigner: Fix transformation bug for tab widgets<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 \"quickitemnodeinstance.h\"\n\n#include \"qt5nodeinstanceserver.h\"\n\n#include <QQmlExpression>\n#include <QQuickView>\n#include <cmath>\n\n#include <private\/qquicktextinput_p.h>\n#include <private\/qquicktextedit_p.h>\n\n#include <QHash>\n\n#include <QDebug>\n\nnamespace QmlDesigner {\nnamespace Internal {\n\nQuickItemNodeInstance::QuickItemNodeInstance(QQuickItem *item)\n   : GraphicalNodeInstance(item),\n     m_isResizable(true),\n     m_isMovable(true)\n{\n}\n\nQuickItemNodeInstance::~QuickItemNodeInstance()\n{\n}\n\nstatic bool isContentItem(QQuickItem *item, NodeInstanceServer *nodeInstanceServer)\n{\n\n    return item->parentItem()\n            && nodeInstanceServer->hasInstanceForObject(item->parentItem())\n            && nodeInstanceServer->instanceForObject(item->parentItem()).internalInstance()->contentItem() == item;\n}\n\nstatic QTransform transformForItem(QQuickItem *item, NodeInstanceServer *nodeInstanceServer)\n{\n    if (isContentItem(item, nodeInstanceServer))\n        return QTransform();\n\n    QTransform toParentTransform = DesignerSupport::parentTransform(item);\n    if (item->parentItem() && !nodeInstanceServer->hasInstanceForObject(item->parentItem())) {\n\n        return transformForItem(item->parentItem(), nodeInstanceServer) * toParentTransform;\n    }\n\n    return toParentTransform;\n}\n\nQTransform QuickItemNodeInstance::transform() const\n{   if (quickItem()->parentItem())\n        return DesignerSupport::parentTransform(quickItem());;\n\n    return QTransform();\n}\n\n\nQObject *QuickItemNodeInstance::parent() const\n{\n    if (!quickItem() || !quickItem()->parentItem())\n        return 0;\n\n    return quickItem()->parentItem();\n}\nbool QuickItemNodeInstance::isMovable() const\n{\n    if (isRootNodeInstance())\n        return false;\n\n    return m_isMovable && quickItem() && quickItem()->parentItem();\n}\n\nvoid QuickItemNodeInstance::setMovable(bool movable)\n{\n    m_isMovable = movable;\n}\n\nQuickItemNodeInstance::Pointer QuickItemNodeInstance::create(QObject *object)\n{\n    QQuickItem *quickItem = qobject_cast<QQuickItem*>(object);\n\n    Q_ASSERT(quickItem);\n\n    Pointer instance(new QuickItemNodeInstance(quickItem));\n\n    instance->setHasContent(anyItemHasContent(quickItem));\n    quickItem->setFlag(QQuickItem::ItemHasContents, true);\n\n    static_cast<QQmlParserStatus*>(quickItem)->classBegin();\n\n    instance->populateResetHashes();\n\n    return instance;\n}\n\nQQuickItem *QuickItemNodeInstance::contentItem() const\n{\n    return m_contentItem.data();\n}\n\nvoid QuickItemNodeInstance::doComponentComplete()\n{\n    GraphicalNodeInstance::doComponentComplete();\n\n    QQmlProperty contentItemProperty(quickItem(), \"contentItem\", engine());\n    if (contentItemProperty.isValid())\n        m_contentItem = contentItemProperty.read().value<QQuickItem*>();\n}\n\nQRectF QuickItemNodeInstance::contentItemBoundingBox() const\n{\n    if (contentItem()) {\n        QTransform contentItemTransform = DesignerSupport::parentTransform(contentItem());\n        return contentItemTransform.mapRect(contentItem()->boundingRect());\n    }\n\n    return QRectF();\n}\n\nstatic QTransform contentItemTransformForItem(QQuickItem *item, NodeInstanceServer *nodeInstanceServer)\n{\n    QTransform toParentTransform = DesignerSupport::parentTransform(item);\n    if (item->parentItem() && !nodeInstanceServer->hasInstanceForObject(item->parentItem())) {\n\n        return transformForItem(item->parentItem(), nodeInstanceServer) * toParentTransform;\n    }\n\n    return toParentTransform;\n}\n\nQTransform QuickItemNodeInstance::contentItemTransform() const\n{\n    if (contentItem())\n        return contentItemTransformForItem(contentItem(), nodeInstanceServer());\n\n    return QTransform();\n}\n\n\nbool QuickItemNodeInstance::isQuickItem() const\n{\n    return true;\n}\n\nbool QuickItemNodeInstance::isResizable() const\n{\n    if (isRootNodeInstance())\n        return false;\n\n    return m_isResizable && quickItem() && quickItem()->parentItem();\n}\n\nvoid QuickItemNodeInstance::setResizable(bool resizable)\n{\n    m_isResizable = resizable;\n}\n\nvoid QuickItemNodeInstance::reparent(const ObjectNodeInstance::Pointer &oldParentInstance, const PropertyName &oldParentProperty, const ObjectNodeInstance::Pointer &newParentInstance, const PropertyName &newParentProperty)\n{\n    if (oldParentInstance && oldParentInstance->isPositioner()) {\n        setInLayoutable(false);\n        setMovable(true);\n    }\n\n    ObjectNodeInstance::reparent(oldParentInstance, oldParentProperty, newParentInstance, newParentProperty);\n\n    if (newParentInstance && newParentInstance->isPositioner()) {\n        setInLayoutable(true);\n        setMovable(false);\n    }\n\n    if (oldParentInstance && oldParentInstance->isPositioner() && !(newParentInstance && newParentInstance->isPositioner())) {\n        if (!hasBindingForProperty(\"x\"))\n            setPropertyVariant(\"x\", x());\n\n        if (!hasBindingForProperty(\"y\"))\n            setPropertyVariant(\"y\", y());\n    }\n\n    refresh();\n    DesignerSupport::updateDirtyNode(quickItem());\n\n    if (parentInstance() && isInLayoutable())\n        parentInstance()->refreshLayoutable();\n}\n\nbool QuickItemNodeInstance::isAnchoredBySibling() const\n{\n    if (quickItem()->parentItem()) {\n        foreach (QQuickItem *siblingItem, quickItem()->parentItem()->childItems()) { \/\/ search in siblings for a anchor to this item\n            if (siblingItem) {\n                if (DesignerSupport::isAnchoredTo(siblingItem, quickItem()))\n                    return true;\n            }\n        }\n    }\n\n    return false;\n}\n\n\n\nQQuickItem *QuickItemNodeInstance::quickItem() const\n{\n    if (object() == 0)\n        return 0;\n\n    return static_cast<QQuickItem*>(object());\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace QmlDesigner\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"itkImage.h\"\n#include \"itkRandomImageSource.h\"\n#include \"itkGradientRecursiveGaussianImageFilter.h\"\n#include \"itkGradientMagnitudeImageFilter.h\"\n#include \"itkImageFileReader.h\"\n\n#include <vtkRenderWindow.h>\n#include <vtkRenderWindowInteractor.h>\n#include <vtkRenderer.h>\n#include <vtkActor.h>\n#include <vtkSmartPointer.h>\n#include <vtkCellArray.h>\n#include <vtkCellData.h>\n#include <vtkDoubleArray.h>\n#include <vtkPoints.h>\n#include <vtkPolyLine.h>\n#include <vtkPolyData.h>\n#include <vtkPolyDataMapper2D.h>\n\n#include <opencv2\/core.hpp>\n#include <iostream>\n\n#ifndef M_PI\n#define M_PI\t\t3.14159265358979323846\t\/* pi *\/\n#endif \/\/ M_PI\n\nnamespace\n{\ntypedef itk::Image< unsigned char, 2 >    ImageType;\ntypedef itk::Image< float,  2 >           FloatImageType;\ntypedef ImageType::IndexType              IndexType;\ntypedef itk::CovariantVector< float, 2  > OutputPixelType;\ntypedef itk::Image< OutputPixelType, 2 >  OutputImageType;\ntypedef itk::GradientRecursiveGaussianImageFilter<\nFloatImageType, OutputImageType>        FilterType;\ntypedef itk::GradientMagnitudeImageFilter<\nImageType, FloatImageType >             GradMagfilterType;\ntypedef itk::ImageFileReader< ImageType > ReaderType;\n}\n\ncv::Mat1d generateCircle( double cx, double cy, double rx, double ry, int n);\nvoid createImage(ImageType::Pointer image,\n                 int w, int h, double cx, double cy, double rx, double ry);\ncv::Mat1d computeP(double alpha, double beta, double gamma, double N) throw (int);\ncv::Mat1d sampleImage(cv::Mat1d x, cv::Mat1d y, OutputImageType::Pointer gradient, int position);\n\nvtkSmartPointer<vtkPolyData> createPolydataLine( cv::Mat1d const & v )\n{\n    \/\/ Create a vtkPoints object and store the points in it\n    vtkSmartPointer<vtkPoints> points =\n            vtkSmartPointer<vtkPoints>::New();\n    for( int i = 0; i < v.rows; ++i )\n    {\n        points->InsertNextPoint( v(2*i+0), v(2*i+1), 0 );\n    }\n\n    vtkSmartPointer<vtkPolyLine> polyLine =\n            vtkSmartPointer<vtkPolyLine>::New();\n    polyLine->GetPointIds()->SetNumberOfIds(v.rows);\n    for(unsigned int i = 0; i < v.rows; i++)\n    {\n        polyLine->GetPointIds()->SetId(i,i);\n    }\n\n    \/\/ Create a cell array to store the lines in and add the lines to it\n    vtkSmartPointer<vtkCellArray> cells =\n            vtkSmartPointer<vtkCellArray>::New();\n    cells->InsertNextCell( polyLine );\n\n    \/\/ Create a polydata to store everything in\n    vtkSmartPointer<vtkPolyData> polyData =\n            vtkSmartPointer<vtkPolyData>::New();\n\n    \/\/ Add the points to the dataset\n    polyData->SetPoints(points);\n\n    \/\/ Add the lines to the dataset\n    polyData->SetLines(cells);\n\n    return polyData;\n}\n\nint main( int argc, char* argv[] )\n{\n    \/\/Image dimensions\n    int w = 300;\n    int h = 300;\n    ImageType::Pointer image;\n    if (argc < 7)\n    {\n        std::cout << \"Usage \" << argv[0]\n                  << \" points alpha beta gamma sigma iterations [image]\"\n                  << std::endl;\n        return EXIT_SUCCESS;;\n    }\n    else if (argc < 8)\n    {\n        \/\/Synthesize the image\n        image = ImageType::New();\n        createImage(image, w, h, 150, 150, 50, 50);\n    }\n    else if (argc == 8)\n    {\n        \/\/Open the image\n        ReaderType::Pointer reader = ReaderType::New();\n        reader->SetFileName( argv[7] );\n        try\n        {\n            reader->Update();\n            image = reader->GetOutput();\n            w = image->GetLargestPossibleRegion().GetSize()[0];\n            h = image->GetLargestPossibleRegion().GetSize()[1];\n        }\n        catch( itk::ExceptionObject & err )\n        {\n            std::cerr << \"Caught unexpected exception \" << err;\n            return EXIT_FAILURE;\n        }\n    }\n\n    \/\/Snake parameters\n    double alpha = 0.001;\n    double beta = 0.4;\n    double gamma = 100;\n    double iterations = 1;\n    int nPoints = 20;\n    double sigma;\n\n    nPoints = atoi(argv[1]);\n    alpha = atof(argv[2]);\n    beta = atof(argv[3]);\n    gamma = atof(argv[4]);\n    sigma = atof(argv[5]);\n    iterations = atoi(argv[6]);\n\n    \/\/Temporal variables\n    cv::Mat1d P;\n    cv::Mat1d v;\n    double N;\n\n    \/\/Generate initial snake circle\n    v = generateCircle(130, 130, 50, 50, nPoints);\n\n    vtkSmartPointer<vtkPolyData> polyData =\n            createPolydataLine( v );\n\n    \/\/ Setup actor and mapper\n    vtkSmartPointer<vtkPolyDataMapper2D> mapper =\n            vtkSmartPointer<vtkPolyDataMapper2D>::New();\n    mapper->SetInputData(polyData);\n\n    vtkSmartPointer<vtkActor> actor =\n            vtkSmartPointer<vtkActor>::New();\n    actor->SetMapper(mapper);\n\n    \/\/ Setup render window, renderer, and interactor\n    vtkSmartPointer<vtkRenderer> renderer =\n            vtkSmartPointer<vtkRenderer>::New();\n    vtkSmartPointer<vtkRenderWindow> renderWindow =\n            vtkSmartPointer<vtkRenderWindow>::New();\n    renderWindow->AddRenderer(renderer);\n    vtkSmartPointer<vtkRenderWindowInteractor> renderWindowInteractor =\n            vtkSmartPointer<vtkRenderWindowInteractor>::New();\n    renderWindowInteractor->SetRenderWindow(renderWindow);\n    renderer->AddActor(actor);\n\n    renderWindow->Render();\n\n\n    \/\/Computes P matrix.\n    N = v.rows\/2;\n    try\n    {\n        P = computeP(alpha, beta, gamma, N);\n    }\n    catch (int n)\n    {\n        return EXIT_FAILURE;;\n    }\n\n    \/\/Computes the magnitude gradient\n    GradMagfilterType::Pointer gradientMagnitudeFilter =\n            GradMagfilterType::New();\n    gradientMagnitudeFilter->SetInput( image );\n    gradientMagnitudeFilter->Update();\n\n    \/\/Computes the gradient of the gradient magnitude\n    FilterType::Pointer gradientFilter = FilterType::New();\n    gradientFilter->SetInput( gradientMagnitudeFilter->GetOutput() );\n    gradientFilter->SetSigma( sigma );\n    gradientFilter->Update();\n\n    \/\/Loop\n    cv::Mat1d x(N,1);\n    cv::Mat1d y(N,1);\n\n    std::cout << \"Initial snake\" << std::endl;\n    for (int i = 0; i < N; i++)\n    {\n        x(i) = v(2*i);\n        y(i) = v(2*i+1);\n        std::cout << \"(\" << x(i) << \", \" << y(i) << \")\" << std::endl;\n    }\n\n    for (int i = 0; i < iterations; i++)\n    {\n\n        x = (x+gamma*sampleImage(x, y, gradientFilter->GetOutput(), 0));\n        x = (x.t() * P).t();\n        y = (y+gamma*sampleImage(x, y, gradientFilter->GetOutput(), 1));\n        y = ( y.t() * P ).t();\n    }\n\n    \/\/Display the answer\n    std::cout << \"Final snake after \" << iterations << \" iterations\" << std::endl;\n    cv::Mat1d v2(2*N,1);\n    for (int i=0; i<N; i++)\n    {\n        v2(2*i) = x(i);\n        v2(2*i+1) = y(i);\n        std::cout << \"(\" << x(i) << \", \" << y(i) << \")\" << std::endl;\n    }\n\n    return EXIT_SUCCESS;;\n}\n\ncv::Mat1d generateCircle( double cx, double cy, double rx, double ry, int n)\n{\n    cv::Mat1d v(2*(n+1),1);\n\n    for (int i=0; i<n; i++)\n    {\n        v(2*i) = cx + rx*cos(2*M_PI*i\/n);\n        v(2*i+1) = cy + ry*sin(2*M_PI*i\/n);\n    }\n    v(2*n)=v(0);\n    v(2*n+1)=v(1);\n    return v;\n}\n\nvoid createImage(ImageType::Pointer image,\n                 int w, int h, double cx, double cy, double rx, double ry)\n{\n\n    itk::Size<2> size;\n    size[0] = w;\n    size[1] = h;\n\n    itk::RandomImageSource<ImageType>::Pointer randomImageSource = itk::RandomImageSource<ImageType>::New();\n    randomImageSource->SetNumberOfThreads(1); \/\/ to produce non-random results\n    randomImageSource->SetSize(size);\n    randomImageSource->SetMin(200);\n    randomImageSource->SetMax(255);\n    randomImageSource->Update();\n\n    image->SetRegions(randomImageSource->GetOutput()->GetLargestPossibleRegion());\n    image->Allocate();\n\n    IndexType index;\n\n    \/\/Draw oval.\n    for (int i=0; i<w; i++)\n    {\n        for (int j=0; j<h; j++)\n        {\n            index[0] = i; index[1] = j;\n            if ( ((i-cx)*(i-cx)\/(rx*rx) + (j-cy)*(j-cy)\/(ry*ry) ) < 1)\n            {\n                image->SetPixel(index, randomImageSource->GetOutput()->GetPixel(index)-100);\n            }\n            else\n            {\n                image->SetPixel(index, randomImageSource->GetOutput()->GetPixel(index));\n            }\n\n        }\n    }\n}\n\ncv::Mat1d computeP(double alpha, double beta, double gamma, double N) throw (int)\n{\n\n    double a = gamma*(2*alpha+6*beta)+1;\n    double b = gamma*(-alpha-4*beta);\n    double c = gamma*beta;\n\n    cv::Mat1d P( N, N, 0.0 );\n\n    \/\/fill diagonal\n    cv::Mat1d diag = P.diag();\n    diag.setTo( cv::Scalar( a ) );\n\n    \/\/fill next two diagonals\n    for (int i=0; i<(N-1); i++)\n    {\n        P(i+1,i) = b;\n        P(i,i+1) = b;\n    }\n    \/\/Moreover\n    P(0, N-1)=b;\n    P(N-1, 0)=b;\n\n    \/\/fill next two diagonals\n    for (int i=0; i<(N-2); i++)\n    {\n        P(i+2,i) = c;\n        P(i,i+2) = c;\n    }\n    \/\/Moreover\n    P(0, N-2)=c;\n    P(1, N-1)=c;\n    P(N-2, 0)=c;\n    P(N-1, 1)=c;\n\n    if ( cv::determinant( P ) == 0.0 )\n    {\n        std::cerr << \"Singular matrix. Determinant is 0.\" << std::endl;\n        throw 2;\n    }\n\n    \/\/Compute the inverse of the matrix P\n    cv::Mat1d Pinv;\n    Pinv = P.inv();\n\n    return Pinv.t();\n}\n\ncv::Mat1d sampleImage(cv::Mat1d x, cv::Mat1d y, OutputImageType::Pointer gradient, int position)\n{\n    int size;\n    size = x.rows;\n    cv::Mat1d ans(size,1);\n\n    IndexType index;\n    for (int i=0; i<size; i++)\n    {\n        index[0] = x(i);\n        index[1] = y(i);\n        ans(i) = gradient->GetPixel(index)[position];\n    }\n    return ans;\n}\n<commit_msg>#8 fixed compile error<commit_after>#include \"itkImage.h\"\n#include \"itkRandomImageSource.h\"\n#include \"itkGradientRecursiveGaussianImageFilter.h\"\n#include \"itkGradientMagnitudeImageFilter.h\"\n#include \"itkImageFileReader.h\"\n\n#include <vtkRenderWindow.h>\n#include <vtkRenderWindowInteractor.h>\n#include <vtkRenderer.h>\n#include <vtkActor2D.h>\n#include <vtkSmartPointer.h>\n#include <vtkCellArray.h>\n#include <vtkCellData.h>\n#include <vtkDoubleArray.h>\n#include <vtkPoints.h>\n#include <vtkPolyLine.h>\n#include <vtkPolyData.h>\n#include <vtkPolyDataMapper2D.h>\n\n#include <opencv2\/core.hpp>\n#include <iostream>\n\n#ifndef M_PI\n#define M_PI\t\t3.14159265358979323846\t\/* pi *\/\n#endif \/\/ M_PI\n\nnamespace\n{\ntypedef itk::Image< unsigned char, 2 >    ImageType;\ntypedef itk::Image< float,  2 >           FloatImageType;\ntypedef ImageType::IndexType              IndexType;\ntypedef itk::CovariantVector< float, 2  > OutputPixelType;\ntypedef itk::Image< OutputPixelType, 2 >  OutputImageType;\ntypedef itk::GradientRecursiveGaussianImageFilter<\nFloatImageType, OutputImageType>        FilterType;\ntypedef itk::GradientMagnitudeImageFilter<\nImageType, FloatImageType >             GradMagfilterType;\ntypedef itk::ImageFileReader< ImageType > ReaderType;\n}\n\ncv::Mat1d generateCircle( double cx, double cy, double rx, double ry, int n);\nvoid createImage(ImageType::Pointer image,\n                 int w, int h, double cx, double cy, double rx, double ry);\ncv::Mat1d computeP(double alpha, double beta, double gamma, double N) throw (int);\ncv::Mat1d sampleImage(cv::Mat1d x, cv::Mat1d y, OutputImageType::Pointer gradient, int position);\n\nvtkSmartPointer<vtkPolyData> createPolydataLine( cv::Mat1d const & v )\n{\n    \/\/ Create a vtkPoints object and store the points in it\n    vtkSmartPointer<vtkPoints> points =\n            vtkSmartPointer<vtkPoints>::New();\n    for( int i = 0; i < v.rows; ++i )\n    {\n        points->InsertNextPoint( v(2*i+0), v(2*i+1), 0 );\n    }\n\n    vtkSmartPointer<vtkPolyLine> polyLine =\n            vtkSmartPointer<vtkPolyLine>::New();\n    polyLine->GetPointIds()->SetNumberOfIds(v.rows);\n    for(unsigned int i = 0; i < v.rows; i++)\n    {\n        polyLine->GetPointIds()->SetId(i,i);\n    }\n\n    \/\/ Create a cell array to store the lines in and add the lines to it\n    vtkSmartPointer<vtkCellArray> cells =\n            vtkSmartPointer<vtkCellArray>::New();\n    cells->InsertNextCell( polyLine );\n\n    \/\/ Create a polydata to store everything in\n    vtkSmartPointer<vtkPolyData> polyData =\n            vtkSmartPointer<vtkPolyData>::New();\n\n    \/\/ Add the points to the dataset\n    polyData->SetPoints(points);\n\n    \/\/ Add the lines to the dataset\n    polyData->SetLines(cells);\n\n    return polyData;\n}\n\nint main( int argc, char* argv[] )\n{\n    \/\/Image dimensions\n    int w = 300;\n    int h = 300;\n    ImageType::Pointer image;\n    if (argc < 7)\n    {\n        std::cout << \"Usage \" << argv[0]\n                  << \" points alpha beta gamma sigma iterations [image]\"\n                  << std::endl;\n        return EXIT_SUCCESS;;\n    }\n    else if (argc < 8)\n    {\n        \/\/Synthesize the image\n        image = ImageType::New();\n        createImage(image, w, h, 150, 150, 50, 50);\n    }\n    else if (argc == 8)\n    {\n        \/\/Open the image\n        ReaderType::Pointer reader = ReaderType::New();\n        reader->SetFileName( argv[7] );\n        try\n        {\n            reader->Update();\n            image = reader->GetOutput();\n            w = image->GetLargestPossibleRegion().GetSize()[0];\n            h = image->GetLargestPossibleRegion().GetSize()[1];\n        }\n        catch( itk::ExceptionObject & err )\n        {\n            std::cerr << \"Caught unexpected exception \" << err;\n            return EXIT_FAILURE;\n        }\n    }\n\n    \/\/Snake parameters\n    double alpha = 0.001;\n    double beta = 0.4;\n    double gamma = 100;\n    double iterations = 1;\n    int nPoints = 20;\n    double sigma;\n\n    nPoints = atoi(argv[1]);\n    alpha = atof(argv[2]);\n    beta = atof(argv[3]);\n    gamma = atof(argv[4]);\n    sigma = atof(argv[5]);\n    iterations = atoi(argv[6]);\n\n    \/\/Temporal variables\n    cv::Mat1d P;\n    cv::Mat1d v;\n    double N;\n\n    \/\/Generate initial snake circle\n    v = generateCircle(130, 130, 50, 50, nPoints);\n\n    vtkSmartPointer<vtkPolyData> polyData =\n            createPolydataLine( v );\n\n    \/\/ Setup actor and mapper\n    vtkSmartPointer<vtkPolyDataMapper2D> mapper =\n            vtkSmartPointer<vtkPolyDataMapper2D>::New();\n    mapper->SetInputData(polyData);\n\n    vtkSmartPointer<vtkActor2D> actor =\n            vtkSmartPointer<vtkActor2D>::New();\n    actor->SetMapper(mapper);\n\n    \/\/ Setup render window, renderer, and interactor\n    vtkSmartPointer<vtkRenderer> renderer =\n            vtkSmartPointer<vtkRenderer>::New();\n    vtkSmartPointer<vtkRenderWindow> renderWindow =\n            vtkSmartPointer<vtkRenderWindow>::New();\n    renderWindow->AddRenderer(renderer);\n    vtkSmartPointer<vtkRenderWindowInteractor> renderWindowInteractor =\n            vtkSmartPointer<vtkRenderWindowInteractor>::New();\n    renderWindowInteractor->SetRenderWindow(renderWindow);\n    renderer->AddActor(actor);\n\n    renderWindow->Render();\n\n\n    \/\/Computes P matrix.\n    N = v.rows\/2;\n    try\n    {\n        P = computeP(alpha, beta, gamma, N);\n    }\n    catch (int n)\n    {\n        return EXIT_FAILURE;;\n    }\n\n    \/\/Computes the magnitude gradient\n    GradMagfilterType::Pointer gradientMagnitudeFilter =\n            GradMagfilterType::New();\n    gradientMagnitudeFilter->SetInput( image );\n    gradientMagnitudeFilter->Update();\n\n    \/\/Computes the gradient of the gradient magnitude\n    FilterType::Pointer gradientFilter = FilterType::New();\n    gradientFilter->SetInput( gradientMagnitudeFilter->GetOutput() );\n    gradientFilter->SetSigma( sigma );\n    gradientFilter->Update();\n\n    \/\/Loop\n    cv::Mat1d x(N,1);\n    cv::Mat1d y(N,1);\n\n    std::cout << \"Initial snake\" << std::endl;\n    for (int i = 0; i < N; i++)\n    {\n        x(i) = v(2*i);\n        y(i) = v(2*i+1);\n        std::cout << \"(\" << x(i) << \", \" << y(i) << \")\" << std::endl;\n    }\n\n    for (int i = 0; i < iterations; i++)\n    {\n\n        x = (x+gamma*sampleImage(x, y, gradientFilter->GetOutput(), 0));\n        x = (x.t() * P).t();\n        y = (y+gamma*sampleImage(x, y, gradientFilter->GetOutput(), 1));\n        y = ( y.t() * P ).t();\n    }\n\n    \/\/Display the answer\n    std::cout << \"Final snake after \" << iterations << \" iterations\" << std::endl;\n    cv::Mat1d v2(2*N,1);\n    for (int i=0; i<N; i++)\n    {\n        v2(2*i) = x(i);\n        v2(2*i+1) = y(i);\n        std::cout << \"(\" << x(i) << \", \" << y(i) << \")\" << std::endl;\n    }\n\n    return EXIT_SUCCESS;;\n}\n\ncv::Mat1d generateCircle( double cx, double cy, double rx, double ry, int n)\n{\n    cv::Mat1d v(2*(n+1),1);\n\n    for (int i=0; i<n; i++)\n    {\n        v(2*i) = cx + rx*cos(2*M_PI*i\/n);\n        v(2*i+1) = cy + ry*sin(2*M_PI*i\/n);\n    }\n    v(2*n)=v(0);\n    v(2*n+1)=v(1);\n    return v;\n}\n\nvoid createImage(ImageType::Pointer image,\n                 int w, int h, double cx, double cy, double rx, double ry)\n{\n\n    itk::Size<2> size;\n    size[0] = w;\n    size[1] = h;\n\n    itk::RandomImageSource<ImageType>::Pointer randomImageSource = itk::RandomImageSource<ImageType>::New();\n    randomImageSource->SetNumberOfThreads(1); \/\/ to produce non-random results\n    randomImageSource->SetSize(size);\n    randomImageSource->SetMin(200);\n    randomImageSource->SetMax(255);\n    randomImageSource->Update();\n\n    image->SetRegions(randomImageSource->GetOutput()->GetLargestPossibleRegion());\n    image->Allocate();\n\n    IndexType index;\n\n    \/\/Draw oval.\n    for (int i=0; i<w; i++)\n    {\n        for (int j=0; j<h; j++)\n        {\n            index[0] = i; index[1] = j;\n            if ( ((i-cx)*(i-cx)\/(rx*rx) + (j-cy)*(j-cy)\/(ry*ry) ) < 1)\n            {\n                image->SetPixel(index, randomImageSource->GetOutput()->GetPixel(index)-100);\n            }\n            else\n            {\n                image->SetPixel(index, randomImageSource->GetOutput()->GetPixel(index));\n            }\n\n        }\n    }\n}\n\ncv::Mat1d computeP(double alpha, double beta, double gamma, double N) throw (int)\n{\n\n    double a = gamma*(2*alpha+6*beta)+1;\n    double b = gamma*(-alpha-4*beta);\n    double c = gamma*beta;\n\n    cv::Mat1d P( N, N, 0.0 );\n\n    \/\/fill diagonal\n    cv::Mat1d diag = P.diag();\n    diag.setTo( cv::Scalar( a ) );\n\n    \/\/fill next two diagonals\n    for (int i=0; i<(N-1); i++)\n    {\n        P(i+1,i) = b;\n        P(i,i+1) = b;\n    }\n    \/\/Moreover\n    P(0, N-1)=b;\n    P(N-1, 0)=b;\n\n    \/\/fill next two diagonals\n    for (int i=0; i<(N-2); i++)\n    {\n        P(i+2,i) = c;\n        P(i,i+2) = c;\n    }\n    \/\/Moreover\n    P(0, N-2)=c;\n    P(1, N-1)=c;\n    P(N-2, 0)=c;\n    P(N-1, 1)=c;\n\n    if ( cv::determinant( P ) == 0.0 )\n    {\n        std::cerr << \"Singular matrix. Determinant is 0.\" << std::endl;\n        throw 2;\n    }\n\n    \/\/Compute the inverse of the matrix P\n    cv::Mat1d Pinv;\n    Pinv = P.inv();\n\n    return Pinv.t();\n}\n\ncv::Mat1d sampleImage(cv::Mat1d x, cv::Mat1d y, OutputImageType::Pointer gradient, int position)\n{\n    int size;\n    size = x.rows;\n    cv::Mat1d ans(size,1);\n\n    IndexType index;\n    for (int i=0; i<size; i++)\n    {\n        index[0] = x(i);\n        index[1] = y(i);\n        ans(i) = gradient->GetPixel(index)[position];\n    }\n    return ans;\n}\n<|endoftext|>"}
{"text":"<commit_before>c734d03d-2e4e-11e5-b320-28cfe91dbc4b<commit_msg>c74390b8-2e4e-11e5-b201-28cfe91dbc4b<commit_after>c74390b8-2e4e-11e5-b201-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>\/*==============================================================================\n\n  Copyright (c) Kapteyn Astronomical Institute\n  University of Groningen, Groningen, Netherlands. All Rights Reserved.\n\n  See COPYRIGHT.txt\n  or http:\/\/www.slicer.org\/copyright\/copyright.txt for details.\n\n  Unless required by applicable law or agreed to in writing, software\n  distributed under the License is distributed on an \"AS IS\" BASIS,\n  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n  See the License for the specific language governing permissions and\n  limitations under the License.\n\n  This file was originally developed by Davide Punzo, Kapteyn Astronomical Institute,\n  and was supported through the European Research Consil grant nr. 291531.\n\n==============================================================================*\/\n\n\/\/ MRML includes\n#include <vtkMRMLAstroLabelMapVolumeDisplayNode.h>\n#include <vtkMRMLAstroLabelMapVolumeNode.h>\n#include <vtkMRMLAstroVolumeDisplayNode.h>\n#include <vtkMRMLAstroVolumeNode.h>\n#include <vtkMRMLAstroVolumeStorageNode.h>\n#include <vtkMRMLScene.h>\n#include <vtkMRMLVolumeNode.h>\n\n\/\/vtkFits includes\n#include <vtkFITSReader.h>\n#include <vtkFITSWriter.h>\n\n\/\/ VTK includes\n#include <vtkDataSetAttributes.h>\n#include <vtkImageChangeInformation.h>\n#include <vtkImageData.h>\n#include <vtkNew.h>\n#include <vtkObjectFactory.h>\n#include <vtkType.h>\n\n\n\/\/----------------------------------------------------------------------------\nvtkMRMLNodeNewMacro(vtkMRMLAstroVolumeStorageNode);\n\n\/\/----------------------------------------------------------------------------\nvtkMRMLAstroVolumeStorageNode::vtkMRMLAstroVolumeStorageNode()\n{\n  this->CenterImage = 2;\n  this->DefaultWriteFileExtension = \"fits\";\n}\n\n\/\/----------------------------------------------------------------------------\nvtkMRMLAstroVolumeStorageNode::~vtkMRMLAstroVolumeStorageNode()\n{\n}\n\nnamespace\n{\n\/\/----------------------------------------------------------------------------\ntemplate <typename T> std::string NumberToString(T V)\n{\n  std::string stringValue;\n  std::stringstream strstream;\n  strstream << V;\n  strstream >> stringValue;\n  return stringValue;\n}\n\n\/\/----------------------------------------------------------------------------\nstd::string DoubleToString(double Value)\n{\n  return NumberToString<double>(Value);\n}\n}\/\/end namespace\n\n\/\/----------------------------------------------------------------------------\nvoid vtkMRMLAstroVolumeStorageNode::WriteXML(ostream& of, int nIndent)\n{\n  Superclass::WriteXML(of, nIndent);\n  vtkIndent indent(nIndent);\n\n  std::stringstream ss;\n  ss << this->CenterImage;\n  of << indent << \" centerImage=\\\"\" << ss.str() << \"\\\"\";\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkMRMLAstroVolumeStorageNode::ReadXMLAttributes(const char** atts)\n{\n  int disabledModify = this->StartModify();\n\n  Superclass::ReadXMLAttributes(atts);\n\n  const char* attName;\n  const char* attValue;\n  while (*atts != NULL)\n    {\n    attName = *(atts++);\n    attValue = *(atts++);\n    if (!strcmp(attName, \"centerImage\"))\n      {\n      std::stringstream ss;\n      ss << attValue;\n      ss >> this->CenterImage;\n      }\n    }\n\n  this->EndModify(disabledModify);\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ Copy the node's attributes to this object.\n\/\/ Does NOT copy: ID, FilePrefix, Name, StorageID\nvoid vtkMRMLAstroVolumeStorageNode::Copy(vtkMRMLNode *anode)\n{\n  if (!anode)\n    {\n    return;\n    }\n\n  int disabledModify = this->StartModify();\n\n  Superclass::Copy(anode);\n  vtkMRMLAstroVolumeStorageNode *node = (vtkMRMLAstroVolumeStorageNode *) anode;\n\n  this->SetCenterImage(node->CenterImage);\n\n  this->EndModify(disabledModify);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkMRMLAstroVolumeStorageNode::PrintSelf(ostream& os, vtkIndent indent)\n{\n  vtkMRMLStorageNode::PrintSelf(os,indent);\n  os << indent << \"CenterImage:   \" << this->CenterImage << \"\\n\";\n}\n\n\/\/----------------------------------------------------------------------------\nbool vtkMRMLAstroVolumeStorageNode::CanReadInReferenceNode(vtkMRMLNode *refNode)\n{\n  return refNode->IsA(\"vtkMRMLAstroVolumeNode\") ||\n         refNode->IsA(\"vtkMRMLAstroLabelMapVolumeNode\");\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkMRMLAstroVolumeStorageNode::ReadDataInternal(vtkMRMLNode *refNode)\n{\n  vtkMRMLAstroVolumeNode *volNode = NULL;\n  vtkMRMLAstroLabelMapVolumeNode *labvolNode = NULL;\n  vtkMRMLAstroVolumeDisplayNode *disNode = NULL;\n  vtkMRMLAstroLabelMapVolumeDisplayNode *labdisNode = NULL;\n\n  if ( refNode->IsA(\"vtkMRMLAstroVolumeNode\") )\n    {\n    volNode = vtkMRMLAstroVolumeNode::SafeDownCast(refNode);\n    disNode = volNode->GetAstroVolumeDisplayNode();\n    }\n  else if ( refNode->IsA(\"vtkMRMLAstroLabelMapVolumeNode\") )\n    {\n    labvolNode = vtkMRMLAstroLabelMapVolumeNode::SafeDownCast(refNode);\n    labdisNode = labvolNode->GetAstroLabelMapVolumeDisplayNode();\n    }\n  else\n    {\n    vtkErrorMacro(<< \"vtkMRMLAstroVolumeStorageNode::ReadDataInternal : \"\n                     \"Do not recognize node type \" << refNode->GetClassName());\n    return 0;\n    }\n\n  vtkNew<vtkFITSReader> reader;\n\n  \/\/ Set Reader member variables\n  if (this->CenterImage)\n    {\n    reader->SetUseNativeOriginOff();\n    }\n  else\n    {\n    reader->SetUseNativeOriginOn();\n    }\n\n  if ( refNode->IsA(\"vtkMRMLAstroVolumeNode\") )\n    {\n    if (volNode->GetImageData())\n      {\n      volNode->SetAndObserveImageData (NULL);\n      }\n    }\n  else if ( refNode->IsA(\"vtkMRMLAstroLabelMapVolumeNode\") )\n    {\n    if (labvolNode->GetImageData())\n      {\n      labvolNode->SetAndObserveImageData (NULL);\n      }\n    }\n\n  std::string fullName = this->GetFullNameFromFileName();\n\n  if (fullName.empty())\n    {\n    vtkErrorMacro(\"vtkMRMLAstroVolumeStorageNode::ReadDataInternal : File name not specified\");\n    return 0;\n    }\n\n  reader->SetFileName(fullName.c_str());\n\n  \/\/ Check if this is a FITS file that we can read\n  if (!reader->CanReadFile(fullName.c_str()))\n    {\n    vtkErrorMacro(\"vtkMRMLAstroVolumeStorageNode::ReadDataInternal : This is not a fits file\");\n    return 0;\n    }\n\n  \/\/ Read the header to see if the file corresponds to the MRML Node\n  reader->UpdateInformation();\n\n  if( refNode->IsA(\"vtkMRMLAstroVolumeNode\") || refNode->IsA(\"vtkMRMLAstroLabelMapVolumeNode\") )\n    {\n    if (reader->GetPointDataType() != vtkDataSetAttributes::SCALARS &&\n         reader->GetNumberOfComponents() > 1 )\n      {\n      vtkErrorMacro(\"vtkMRMLAstroVolumeStorageNode::ReadDataInternal : MRMLVolumeNode does not match file kind\");\n      return 0;\n      }\n    }\n\n  reader->Update();\n\n  if ( refNode->IsA(\"vtkMRMLAstroVolumeNode\") )\n    {\n    \/\/ set volume attributes\n    vtkMatrix4x4* mat = reader->GetRasToIjkMatrix();\n    volNode->SetRASToIJKMatrix(mat);\n\n    \/\/set WCSstruct\n    disNode->SetWCSStruct(reader->GetWCSStruct());\n\n    \/\/ parse WCS Status\n    disNode->SetWCSStatus(reader->GetWCSStatus());\n\n    \/\/ parse non-specific key-value pairs\n    std::vector<std::string> keys = reader->GetHeaderKeysVector();\n    for ( std::vector<std::string>::iterator kit = keys.begin();\n          kit != keys.end(); ++kit)\n      {\n      volNode->SetAttribute((*kit).c_str(), reader->GetHeaderValue((*kit).c_str()));\n      }\n    disNode->SetAttribute(\"SlicerAstro.NAXIS\", reader->GetHeaderValue(\"SlicerAstro.NAXIS\"));\n\n    if (disNode->GetWCSStatus() != 0)\n      {\n      disNode->SetSpace(\"IJK\");\n      }\n\n    if(!strcmp(disNode->GetWCSStruct()->ctype[2] , \"FREQ\"))\n      {\n      disNode->SetSpaceQuantity(2,\"frequency\");\n      }\n\n    if (!strcmp(reader->GetHeaderValue(\"SlicerAstro.BUNIT\"), \"W.U.\"))\n      {\n      volNode->SetAttribute(\"SlicerAstro.BUNIT\", \"JY\/BEAM\");\n      vtkWarningMacro(\"vtkMRMLAstroVolumeStorageNode::ReadDataInternal : the flux unit of Volume \"<<volNode->GetName()<<\n                      \" is in Westerbork Unit. It will be automatically converted in JY\/BEAM\"<<endl);\n      }\n\n    \/\/ rescaling flux\n    if (!strcmp(reader->GetHeaderValue(\"SlicerAstro.BUNIT\"), \"W.U.\"))\n      {\n      vtkImageData *imageData = reader->GetOutput();\n      int vtkType = reader->GetDataType();\n      int *dims = imageData->GetDimensions();\n      const int numComponents = imageData->GetNumberOfScalarComponents();\n      const int numElements = dims[0] * dims[1] * dims[2] * numComponents;\n      switch (vtkType)\n        {\n        case VTK_DOUBLE:\n          double *dPixel;\n          dPixel = static_cast<double*>(imageData->GetScalarPointer(0,0,0));\n\n          if (!strcmp(reader->GetHeaderValue(\"SlicerAstro.BUNIT\"), \"W.U.\"))\n            {\n            for( int elemCnt = 0; elemCnt < numElements; elemCnt++)\n              {\n              *(dPixel+elemCnt) *= 0.005;\n              }\n            }\n          break;\n        case VTK_FLOAT:\n          float *fPixel;\n          fPixel = static_cast<float*>(imageData->GetScalarPointer(0,0,0));\n          if (!strcmp(reader->GetHeaderValue(\"SlicerAstro.BUNIT\"), \"W.U.\"))\n            {\n            for( int elemCnt = 0; elemCnt < numElements; elemCnt++)\n              {\n              *(fPixel+elemCnt) *= 0.005;\n              }\n            }\n          break;\n        default:\n          vtkErrorMacro(\"vtkMRMLAstroVolumeStorageNode::ReadDataInternal :\"\n                        \"Could not get the data pointer. DataType not allowed.\");\n          return 0;\n        }\n      }\n    }\n  else if ( refNode->IsA(\"vtkMRMLAstroLabelMapVolumeNode\") )\n    {\n    \/\/ set volume attributes\n    vtkMatrix4x4* mat = reader->GetRasToIjkMatrix();\n    labvolNode->SetRASToIJKMatrix(mat);\n    \/\/set WCSstruct\n    labdisNode->SetWCSStruct(reader->GetWCSStruct());\n    \/\/ parse WCS Status\n    labdisNode->SetWCSStatus(reader->GetWCSStatus());\n    \/\/ parse non-specific key-value pairs\n    std::vector<std::string> keys = reader->GetHeaderKeysVector();\n    for ( std::vector<std::string>::iterator kit = keys.begin();\n          kit != keys.end(); ++kit)\n      {\n      labvolNode->SetAttribute((*kit).c_str(), reader->GetHeaderValue((*kit).c_str()));\n      }\n    labdisNode->SetAttribute(\"SlicerAstro.NAXIS\", reader->GetHeaderValue(\"SlicerAstro.NAXIS\"));\n\n      \/\/ parse Space (WCS or IJK) to the display node\n    if (labdisNode->GetWCSStatus() != 0)\n      {\n      labdisNode->SetSpace(\"IJK\");\n      }\n    if(!strcmp(reader->GetHeaderValue(\"SlicerAstro.CUNIT3\"), \"HZ\") ||\n       !strcmp(reader->GetHeaderValue(\"SlicerAstro.CUNIT3\"), \"Hz\") ||\n       !strncmp(reader->GetHeaderValue(\"SlicerAstro.CTYPE3\"), \"FREQ\", 4))\n      {\n      labdisNode->SetSpaceQuantity(2,\"frequency\");\n      }\n    if (!strcmp(reader->GetHeaderValue(\"SlicerAstro.BUNIT\"), \"\"))\n      {\n      labvolNode->SetAttribute(\"SlicerAstro.BUNIT\", \"\");\n      }\n    }\n\n  vtkNew<vtkImageChangeInformation> ici;\n  ici->SetInputConnection(reader->GetOutputPort());\n  ici->SetOutputSpacing( 1, 1, 1 );\n  ici->SetOutputOrigin( 0, 0, 0 );\n  ici->Update();\n\n  if ( refNode->IsA(\"vtkMRMLAstroVolumeNode\") )\n    {\n    volNode->SetImageDataConnection(ici->GetOutputPort());\n    if(!strcmp(reader->GetHeaderValue(\"SlicerAstro.DATAMAX\"), \"0.\") ||\n           !strcmp(reader->GetHeaderValue(\"SlicerAstro.DATAMIN\"), \"0.\"))\n      {\n      volNode->UpdateRangeAttributes();\n      }\n    if (!strcmp(reader->GetHeaderValue(\"SlicerAstro.RMS\"), \"0.\"))\n      {\n      volNode->UpdateNoiseAttributes();\n      }\n    volNode->SetAttribute(\"SlicerAstro.RenderingInitialized\",\"0\");\n    }\n  else if ( refNode->IsA(\"vtkMRMLAstroLabelMapVolumeNode\") )\n    {\n    labvolNode->SetImageDataConnection(ici->GetOutputPort());\n    if(!strcmp(reader->GetHeaderValue(\"SlicerAstro.DATAMAX\"), \"0.\") ||\n           !strcmp(reader->GetHeaderValue(\"SlicerAstro.DATAMIN\"), \"0.\"))\n      {\n      labvolNode->UpdateRangeAttributes();\n      }\n\n    if (!strcmp(reader->GetHeaderValue(\"SlicerAstro.RMS\"), \"0.\"))\n      {\n      double noise = 1.;\n      labvolNode->SetAttribute(\"SlicerAstro.RMS\", DoubleToString(noise).c_str());\n      }\n    }\n\n  return 1;\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkMRMLAstroVolumeStorageNode::WriteDataInternal(vtkMRMLNode *refNode)\n{\n  vtkMRMLVolumeNode *volNode = NULL;\n\n  if ( refNode->IsA(\"vtkMRMLAstroVolumeNode\") )\n    {\n    volNode = vtkMRMLAstroVolumeNode::SafeDownCast(refNode);\n    }\n  else if ( refNode->IsA(\"vtkMRMLAstroLabelMapVolumeNode\") )\n    {\n    volNode = vtkMRMLAstroLabelMapVolumeNode::SafeDownCast(refNode);\n    }\n  else if ( refNode->IsA(\"vtkMRMLVolumeNode\") )\n    {\n    \/\/ Generic case used for any VolumeNode. Used when Extensions add\n    \/\/ node types that are subclasses of VolumeNode.\n    volNode = vtkMRMLVolumeNode::SafeDownCast(refNode);\n    }\n  else\n    {\n    vtkErrorMacro(<< \"vtkMRMLAstroVolumeStorageNode::WriteDataInternal :\"\n                     \" Do not recognize node type \" << refNode->GetClassName());\n    return 0;\n    }\n\n  if (volNode->GetImageData() == NULL)\n    {\n    vtkErrorMacro(\"vtkMRMLAstroVolumeStorageNode::WriteDataInternal :\"\n                  \" Cannot write NULL ImageData\");\n    }\n\n  std::string fullName = this->GetFullNameFromFileName();\n  if (fullName == std::string(\"\"))\n    {\n    vtkErrorMacro(\"vtkMRMLAstroVolumeStorageNode::WriteDataInternal :\"\n                  \" File name not specified\");\n    return 0;\n    }\n\n  \/\/ Use here the FITS Writer\n  vtkNew<vtkFITSWriter> writer;\n  writer->SetFileName(fullName.c_str());\n  writer->SetInputConnection(volNode->GetImageDataConnection());\n  writer->SetUseCompression(0);\n\n  \/\/ pass down all MRML attributes\n  std::vector<std::string> attributeNames = volNode->GetAttributeNames();\n  std::vector<std::string>::iterator ait = attributeNames.begin();\n  for (; ait != attributeNames.end(); ++ait)\n    {\n    writer->SetAttribute((*ait), volNode->GetAttribute((*ait).c_str()));\n    }\n\n  writer->Write();\n  int writeFlag = 1;\n  if (writer->GetWriteError())\n    {\n    vtkErrorMacro(\"vtkMRMLAstroVolumeStorageNode::WriteDataInternal : \"\n                  \"ERROR writing FITS file \" << (writer->GetFileName() == NULL ? \"null\" : writer->GetFileName()));\n    writeFlag = 0;\n    }\n\n  this->StageWriteData(refNode);\n\n  return writeFlag;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkMRMLAstroVolumeStorageNode::InitializeSupportedReadFileTypes()\n{\n  this->SupportedReadFileTypes->InsertNextValue(\"FITS (.fits)\");\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkMRMLAstroVolumeStorageNode::InitializeSupportedWriteFileTypes()\n{\n  this->SupportedWriteFileTypes->InsertNextValue(\"FITS (.fits)\");\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkMRMLAstroVolumeStorageNode::ConfigureForDataExchange()\n{\n  this->UseCompressionOff();\n}\n<commit_msg>BUG: fixing Label 3rd axis string display<commit_after>\/*==============================================================================\n\n  Copyright (c) Kapteyn Astronomical Institute\n  University of Groningen, Groningen, Netherlands. All Rights Reserved.\n\n  See COPYRIGHT.txt\n  or http:\/\/www.slicer.org\/copyright\/copyright.txt for details.\n\n  Unless required by applicable law or agreed to in writing, software\n  distributed under the License is distributed on an \"AS IS\" BASIS,\n  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n  See the License for the specific language governing permissions and\n  limitations under the License.\n\n  This file was originally developed by Davide Punzo, Kapteyn Astronomical Institute,\n  and was supported through the European Research Consil grant nr. 291531.\n\n==============================================================================*\/\n\n\/\/ MRML includes\n#include <vtkMRMLAstroLabelMapVolumeDisplayNode.h>\n#include <vtkMRMLAstroLabelMapVolumeNode.h>\n#include <vtkMRMLAstroVolumeDisplayNode.h>\n#include <vtkMRMLAstroVolumeNode.h>\n#include <vtkMRMLAstroVolumeStorageNode.h>\n#include <vtkMRMLScene.h>\n#include <vtkMRMLVolumeNode.h>\n\n\/\/vtkFits includes\n#include <vtkFITSReader.h>\n#include <vtkFITSWriter.h>\n\n\/\/ VTK includes\n#include <vtkDataSetAttributes.h>\n#include <vtkImageChangeInformation.h>\n#include <vtkImageData.h>\n#include <vtkNew.h>\n#include <vtkObjectFactory.h>\n#include <vtkType.h>\n\n\n\/\/----------------------------------------------------------------------------\nvtkMRMLNodeNewMacro(vtkMRMLAstroVolumeStorageNode);\n\n\/\/----------------------------------------------------------------------------\nvtkMRMLAstroVolumeStorageNode::vtkMRMLAstroVolumeStorageNode()\n{\n  this->CenterImage = 2;\n  this->DefaultWriteFileExtension = \"fits\";\n}\n\n\/\/----------------------------------------------------------------------------\nvtkMRMLAstroVolumeStorageNode::~vtkMRMLAstroVolumeStorageNode()\n{\n}\n\nnamespace\n{\n\/\/----------------------------------------------------------------------------\ntemplate <typename T> std::string NumberToString(T V)\n{\n  std::string stringValue;\n  std::stringstream strstream;\n  strstream << V;\n  strstream >> stringValue;\n  return stringValue;\n}\n\n\/\/----------------------------------------------------------------------------\nstd::string DoubleToString(double Value)\n{\n  return NumberToString<double>(Value);\n}\n}\/\/end namespace\n\n\/\/----------------------------------------------------------------------------\nvoid vtkMRMLAstroVolumeStorageNode::WriteXML(ostream& of, int nIndent)\n{\n  Superclass::WriteXML(of, nIndent);\n  vtkIndent indent(nIndent);\n\n  std::stringstream ss;\n  ss << this->CenterImage;\n  of << indent << \" centerImage=\\\"\" << ss.str() << \"\\\"\";\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkMRMLAstroVolumeStorageNode::ReadXMLAttributes(const char** atts)\n{\n  int disabledModify = this->StartModify();\n\n  Superclass::ReadXMLAttributes(atts);\n\n  const char* attName;\n  const char* attValue;\n  while (*atts != NULL)\n    {\n    attName = *(atts++);\n    attValue = *(atts++);\n    if (!strcmp(attName, \"centerImage\"))\n      {\n      std::stringstream ss;\n      ss << attValue;\n      ss >> this->CenterImage;\n      }\n    }\n\n  this->EndModify(disabledModify);\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ Copy the node's attributes to this object.\n\/\/ Does NOT copy: ID, FilePrefix, Name, StorageID\nvoid vtkMRMLAstroVolumeStorageNode::Copy(vtkMRMLNode *anode)\n{\n  if (!anode)\n    {\n    return;\n    }\n\n  int disabledModify = this->StartModify();\n\n  Superclass::Copy(anode);\n  vtkMRMLAstroVolumeStorageNode *node = (vtkMRMLAstroVolumeStorageNode *) anode;\n\n  this->SetCenterImage(node->CenterImage);\n\n  this->EndModify(disabledModify);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkMRMLAstroVolumeStorageNode::PrintSelf(ostream& os, vtkIndent indent)\n{\n  vtkMRMLStorageNode::PrintSelf(os,indent);\n  os << indent << \"CenterImage:   \" << this->CenterImage << \"\\n\";\n}\n\n\/\/----------------------------------------------------------------------------\nbool vtkMRMLAstroVolumeStorageNode::CanReadInReferenceNode(vtkMRMLNode *refNode)\n{\n  return refNode->IsA(\"vtkMRMLAstroVolumeNode\") ||\n         refNode->IsA(\"vtkMRMLAstroLabelMapVolumeNode\");\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkMRMLAstroVolumeStorageNode::ReadDataInternal(vtkMRMLNode *refNode)\n{\n  vtkMRMLAstroVolumeNode *volNode = NULL;\n  vtkMRMLAstroLabelMapVolumeNode *labvolNode = NULL;\n  vtkMRMLAstroVolumeDisplayNode *disNode = NULL;\n  vtkMRMLAstroLabelMapVolumeDisplayNode *labdisNode = NULL;\n\n  if ( refNode->IsA(\"vtkMRMLAstroVolumeNode\") )\n    {\n    volNode = vtkMRMLAstroVolumeNode::SafeDownCast(refNode);\n    disNode = volNode->GetAstroVolumeDisplayNode();\n    }\n  else if ( refNode->IsA(\"vtkMRMLAstroLabelMapVolumeNode\") )\n    {\n    labvolNode = vtkMRMLAstroLabelMapVolumeNode::SafeDownCast(refNode);\n    labdisNode = labvolNode->GetAstroLabelMapVolumeDisplayNode();\n    }\n  else\n    {\n    vtkErrorMacro(<< \"vtkMRMLAstroVolumeStorageNode::ReadDataInternal : \"\n                     \"Do not recognize node type \" << refNode->GetClassName());\n    return 0;\n    }\n\n  vtkNew<vtkFITSReader> reader;\n\n  \/\/ Set Reader member variables\n  if (this->CenterImage)\n    {\n    reader->SetUseNativeOriginOff();\n    }\n  else\n    {\n    reader->SetUseNativeOriginOn();\n    }\n\n  if ( refNode->IsA(\"vtkMRMLAstroVolumeNode\") )\n    {\n    if (volNode->GetImageData())\n      {\n      volNode->SetAndObserveImageData (NULL);\n      }\n    }\n  else if ( refNode->IsA(\"vtkMRMLAstroLabelMapVolumeNode\") )\n    {\n    if (labvolNode->GetImageData())\n      {\n      labvolNode->SetAndObserveImageData (NULL);\n      }\n    }\n\n  std::string fullName = this->GetFullNameFromFileName();\n\n  if (fullName.empty())\n    {\n    vtkErrorMacro(\"vtkMRMLAstroVolumeStorageNode::ReadDataInternal : File name not specified\");\n    return 0;\n    }\n\n  reader->SetFileName(fullName.c_str());\n\n  \/\/ Check if this is a FITS file that we can read\n  if (!reader->CanReadFile(fullName.c_str()))\n    {\n    vtkErrorMacro(\"vtkMRMLAstroVolumeStorageNode::ReadDataInternal : This is not a fits file\");\n    return 0;\n    }\n\n  \/\/ Read the header to see if the file corresponds to the MRML Node\n  reader->UpdateInformation();\n\n  if( refNode->IsA(\"vtkMRMLAstroVolumeNode\") || refNode->IsA(\"vtkMRMLAstroLabelMapVolumeNode\") )\n    {\n    if (reader->GetPointDataType() != vtkDataSetAttributes::SCALARS &&\n         reader->GetNumberOfComponents() > 1 )\n      {\n      vtkErrorMacro(\"vtkMRMLAstroVolumeStorageNode::ReadDataInternal : MRMLVolumeNode does not match file kind\");\n      return 0;\n      }\n    }\n\n  reader->Update();\n\n  if ( refNode->IsA(\"vtkMRMLAstroVolumeNode\") )\n    {\n    \/\/ set volume attributes\n    vtkMatrix4x4* mat = reader->GetRasToIjkMatrix();\n    volNode->SetRASToIJKMatrix(mat);\n\n    \/\/set WCSstruct\n    disNode->SetWCSStruct(reader->GetWCSStruct());\n\n    \/\/ parse WCS Status\n    disNode->SetWCSStatus(reader->GetWCSStatus());\n\n    \/\/ parse non-specific key-value pairs\n    std::vector<std::string> keys = reader->GetHeaderKeysVector();\n    for ( std::vector<std::string>::iterator kit = keys.begin();\n          kit != keys.end(); ++kit)\n      {\n      volNode->SetAttribute((*kit).c_str(), reader->GetHeaderValue((*kit).c_str()));\n      }\n    disNode->SetAttribute(\"SlicerAstro.NAXIS\", reader->GetHeaderValue(\"SlicerAstro.NAXIS\"));\n\n    if (disNode->GetWCSStatus() != 0)\n      {\n      disNode->SetSpace(\"IJK\");\n      }\n\n    if(!strcmp(disNode->GetWCSStruct()->ctype[2] , \"FREQ\"))\n      {\n      disNode->SetSpaceQuantity(2,\"frequency\");\n      }\n\n    if (!strcmp(reader->GetHeaderValue(\"SlicerAstro.BUNIT\"), \"W.U.\"))\n      {\n      volNode->SetAttribute(\"SlicerAstro.BUNIT\", \"JY\/BEAM\");\n      vtkWarningMacro(\"vtkMRMLAstroVolumeStorageNode::ReadDataInternal : the flux unit of Volume \"<<volNode->GetName()<<\n                      \" is in Westerbork Unit. It will be automatically converted in JY\/BEAM\"<<endl);\n      }\n\n    \/\/ rescaling flux\n    if (!strcmp(reader->GetHeaderValue(\"SlicerAstro.BUNIT\"), \"W.U.\"))\n      {\n      vtkImageData *imageData = reader->GetOutput();\n      int vtkType = reader->GetDataType();\n      int *dims = imageData->GetDimensions();\n      const int numComponents = imageData->GetNumberOfScalarComponents();\n      const int numElements = dims[0] * dims[1] * dims[2] * numComponents;\n      switch (vtkType)\n        {\n        case VTK_DOUBLE:\n          double *dPixel;\n          dPixel = static_cast<double*>(imageData->GetScalarPointer(0,0,0));\n\n          if (!strcmp(reader->GetHeaderValue(\"SlicerAstro.BUNIT\"), \"W.U.\"))\n            {\n            for( int elemCnt = 0; elemCnt < numElements; elemCnt++)\n              {\n              *(dPixel+elemCnt) *= 0.005;\n              }\n            }\n          break;\n        case VTK_FLOAT:\n          float *fPixel;\n          fPixel = static_cast<float*>(imageData->GetScalarPointer(0,0,0));\n          if (!strcmp(reader->GetHeaderValue(\"SlicerAstro.BUNIT\"), \"W.U.\"))\n            {\n            for( int elemCnt = 0; elemCnt < numElements; elemCnt++)\n              {\n              *(fPixel+elemCnt) *= 0.005;\n              }\n            }\n          break;\n        default:\n          vtkErrorMacro(\"vtkMRMLAstroVolumeStorageNode::ReadDataInternal :\"\n                        \"Could not get the data pointer. DataType not allowed.\");\n          return 0;\n        }\n      }\n    }\n  else if ( refNode->IsA(\"vtkMRMLAstroLabelMapVolumeNode\") )\n    {\n    \/\/ set volume attributes\n    vtkMatrix4x4* mat = reader->GetRasToIjkMatrix();\n    labvolNode->SetRASToIJKMatrix(mat);\n    \/\/set WCSstruct\n    labdisNode->SetWCSStruct(reader->GetWCSStruct());\n    \/\/ parse WCS Status\n    labdisNode->SetWCSStatus(reader->GetWCSStatus());\n    \/\/ parse non-specific key-value pairs\n    std::vector<std::string> keys = reader->GetHeaderKeysVector();\n    for ( std::vector<std::string>::iterator kit = keys.begin();\n          kit != keys.end(); ++kit)\n      {\n      labvolNode->SetAttribute((*kit).c_str(), reader->GetHeaderValue((*kit).c_str()));\n      }\n    labdisNode->SetAttribute(\"SlicerAstro.NAXIS\", reader->GetHeaderValue(\"SlicerAstro.NAXIS\"));\n\n      \/\/ parse Space (WCS or IJK) to the display node\n    if (labdisNode->GetWCSStatus() != 0)\n      {\n      labdisNode->SetSpace(\"IJK\");\n      }\n\n    if(!strcmp(disNode->GetWCSStruct()->ctype[2] , \"FREQ\"))\n      {\n      disNode->SetSpaceQuantity(2,\"frequency\");\n      }\n\n    if (!strcmp(reader->GetHeaderValue(\"SlicerAstro.BUNIT\"), \"\"))\n      {\n      labvolNode->SetAttribute(\"SlicerAstro.BUNIT\", \"\");\n      }\n    }\n\n  vtkNew<vtkImageChangeInformation> ici;\n  ici->SetInputConnection(reader->GetOutputPort());\n  ici->SetOutputSpacing( 1, 1, 1 );\n  ici->SetOutputOrigin( 0, 0, 0 );\n  ici->Update();\n\n  if ( refNode->IsA(\"vtkMRMLAstroVolumeNode\") )\n    {\n    volNode->SetImageDataConnection(ici->GetOutputPort());\n    if(!strcmp(reader->GetHeaderValue(\"SlicerAstro.DATAMAX\"), \"0.\") ||\n           !strcmp(reader->GetHeaderValue(\"SlicerAstro.DATAMIN\"), \"0.\"))\n      {\n      volNode->UpdateRangeAttributes();\n      }\n    if (!strcmp(reader->GetHeaderValue(\"SlicerAstro.RMS\"), \"0.\"))\n      {\n      volNode->UpdateNoiseAttributes();\n      }\n    volNode->SetAttribute(\"SlicerAstro.RenderingInitialized\",\"0\");\n    }\n  else if ( refNode->IsA(\"vtkMRMLAstroLabelMapVolumeNode\") )\n    {\n    labvolNode->SetImageDataConnection(ici->GetOutputPort());\n    if(!strcmp(reader->GetHeaderValue(\"SlicerAstro.DATAMAX\"), \"0.\") ||\n           !strcmp(reader->GetHeaderValue(\"SlicerAstro.DATAMIN\"), \"0.\"))\n      {\n      labvolNode->UpdateRangeAttributes();\n      }\n\n    if (!strcmp(reader->GetHeaderValue(\"SlicerAstro.RMS\"), \"0.\"))\n      {\n      double noise = 1.;\n      labvolNode->SetAttribute(\"SlicerAstro.RMS\", DoubleToString(noise).c_str());\n      }\n    }\n\n  return 1;\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkMRMLAstroVolumeStorageNode::WriteDataInternal(vtkMRMLNode *refNode)\n{\n  vtkMRMLVolumeNode *volNode = NULL;\n\n  if ( refNode->IsA(\"vtkMRMLAstroVolumeNode\") )\n    {\n    volNode = vtkMRMLAstroVolumeNode::SafeDownCast(refNode);\n    }\n  else if ( refNode->IsA(\"vtkMRMLAstroLabelMapVolumeNode\") )\n    {\n    volNode = vtkMRMLAstroLabelMapVolumeNode::SafeDownCast(refNode);\n    }\n  else if ( refNode->IsA(\"vtkMRMLVolumeNode\") )\n    {\n    \/\/ Generic case used for any VolumeNode. Used when Extensions add\n    \/\/ node types that are subclasses of VolumeNode.\n    volNode = vtkMRMLVolumeNode::SafeDownCast(refNode);\n    }\n  else\n    {\n    vtkErrorMacro(<< \"vtkMRMLAstroVolumeStorageNode::WriteDataInternal :\"\n                     \" Do not recognize node type \" << refNode->GetClassName());\n    return 0;\n    }\n\n  if (volNode->GetImageData() == NULL)\n    {\n    vtkErrorMacro(\"vtkMRMLAstroVolumeStorageNode::WriteDataInternal :\"\n                  \" Cannot write NULL ImageData\");\n    }\n\n  std::string fullName = this->GetFullNameFromFileName();\n  if (fullName == std::string(\"\"))\n    {\n    vtkErrorMacro(\"vtkMRMLAstroVolumeStorageNode::WriteDataInternal :\"\n                  \" File name not specified\");\n    return 0;\n    }\n\n  \/\/ Use here the FITS Writer\n  vtkNew<vtkFITSWriter> writer;\n  writer->SetFileName(fullName.c_str());\n  writer->SetInputConnection(volNode->GetImageDataConnection());\n  writer->SetUseCompression(0);\n\n  \/\/ pass down all MRML attributes\n  std::vector<std::string> attributeNames = volNode->GetAttributeNames();\n  std::vector<std::string>::iterator ait = attributeNames.begin();\n  for (; ait != attributeNames.end(); ++ait)\n    {\n    writer->SetAttribute((*ait), volNode->GetAttribute((*ait).c_str()));\n    }\n\n  writer->Write();\n  int writeFlag = 1;\n  if (writer->GetWriteError())\n    {\n    vtkErrorMacro(\"vtkMRMLAstroVolumeStorageNode::WriteDataInternal : \"\n                  \"ERROR writing FITS file \" << (writer->GetFileName() == NULL ? \"null\" : writer->GetFileName()));\n    writeFlag = 0;\n    }\n\n  this->StageWriteData(refNode);\n\n  return writeFlag;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkMRMLAstroVolumeStorageNode::InitializeSupportedReadFileTypes()\n{\n  this->SupportedReadFileTypes->InsertNextValue(\"FITS (.fits)\");\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkMRMLAstroVolumeStorageNode::InitializeSupportedWriteFileTypes()\n{\n  this->SupportedWriteFileTypes->InsertNextValue(\"FITS (.fits)\");\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkMRMLAstroVolumeStorageNode::ConfigureForDataExchange()\n{\n  this->UseCompressionOff();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *  Copyright (c) 2012 The WebRTC project authors. All Rights Reserved.\n *\n *  Use of this source code is governed by a BSD-style license\n *  that can be found in the LICENSE file in the root of the source\n *  tree. An additional intellectual property rights grant can be found\n *  in the file PATENTS.  All contributing project authors may\n *  be found in the AUTHORS file in the root of the source tree.\n *\/\n\n#include \"webrtc\/modules\/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 (paused_) {\n    \/\/ Queue all packets when we are paused.\n    switch (priority) {\n      case kHighPriority:\n        high_priority_packets_->push_back(paced_sender::Packet(ssrc,\n                                                               sequence_number,\n                                                               capture_time_ms,\n                                                               bytes));\n        break;\n      case kNormalPriority:\n        if (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      case kLowPriority:\n        \/\/ Queue the low priority packets in the normal priority queue when we\n        \/\/ are paused to avoid starvation.\n        normal_priority_packets_->push_back(paced_sender::Packet(\n            ssrc, sequence_number, capture_time_ms, bytes));\n        break;\n    }\n    return false;\n  }\n  paced_sender::PacketList* packet_list;\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  if (packet_list->empty() &&\n      media_budget_->bytes_remaining() > 0) {\n    UpdateMediaBytesSent(bytes);\n    return true;  \/\/ We can send now.\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_ && elapsed_time_ms > 0) {\n    uint32_t delta_time_ms = std::min(kMaxIntervalTimeMs, elapsed_time_ms);\n    UpdateBytesPerInterval(delta_time_ms);\n    uint32_t ssrc;\n    uint16_t sequence_number;\n    int64_t capture_time_ms;\n    Priority priority;\n    bool last_packet;\n    while (GetNextPacket(&ssrc, &sequence_number, &capture_time_ms,\n                         &priority, &last_packet)) {\n      if (priority == kNormalPriority) {\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      critsect_->Leave();\n      callback_->TimeToSendPacket(ssrc, sequence_number, capture_time_ms);\n      critsect_->Enter();\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::GetNextPacket(uint32_t* ssrc, uint16_t* sequence_number,\n                                int64_t* capture_time_ms, Priority* priority,\n                                bool* last_packet) {\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        *priority = kHighPriority;\n        GetNextPacketFromList(high_priority_packets_.get(), ssrc,\n                              sequence_number, capture_time_ms, last_packet);\n        return true;\n      }\n      if (!normal_priority_packets_->empty()) {\n        *priority = kNormalPriority;\n        GetNextPacketFromList(normal_priority_packets_.get(), ssrc,\n                              sequence_number, capture_time_ms, last_packet);\n        return true;\n      }\n    }\n    return false;\n  }\n  if (!high_priority_packets_->empty()) {\n    *priority = kHighPriority;\n    GetNextPacketFromList(high_priority_packets_.get(), ssrc, sequence_number,\n                          capture_time_ms, last_packet);\n    return true;\n  }\n  if (!normal_priority_packets_->empty()) {\n    *priority = kNormalPriority;\n    GetNextPacketFromList(normal_priority_packets_.get(), ssrc,\n                          sequence_number, capture_time_ms, last_packet);\n    return true;\n  }\n  if (!low_priority_packets_->empty()) {\n    *priority = kLowPriority;\n    GetNextPacketFromList(low_priority_packets_.get(), ssrc, sequence_number,\n                          capture_time_ms, last_packet);\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    bool* last_packet) {\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  packets->pop_front();\n  *last_packet = packets->empty() ||\n      packets->front().capture_time_ms_ > *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 build error introduced with r4168.<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 (paused_) {\n    \/\/ Queue all packets when we are paused.\n    switch (priority) {\n      case kHighPriority:\n        high_priority_packets_->push_back(paced_sender::Packet(ssrc,\n                                                               sequence_number,\n                                                               capture_time_ms,\n                                                               bytes));\n        break;\n      case kNormalPriority:\n        if (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      case kLowPriority:\n        \/\/ Queue the low priority packets in the normal priority queue when we\n        \/\/ are paused to avoid starvation.\n        normal_priority_packets_->push_back(paced_sender::Packet(\n            ssrc, sequence_number, capture_time_ms, bytes));\n        break;\n    }\n    return false;\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  if (packet_list->empty() &&\n      media_budget_->bytes_remaining() > 0) {\n    UpdateMediaBytesSent(bytes);\n    return true;  \/\/ We can send now.\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_ && elapsed_time_ms > 0) {\n    uint32_t delta_time_ms = std::min(kMaxIntervalTimeMs, elapsed_time_ms);\n    UpdateBytesPerInterval(delta_time_ms);\n    uint32_t ssrc;\n    uint16_t sequence_number;\n    int64_t capture_time_ms;\n    Priority priority;\n    bool last_packet;\n    while (GetNextPacket(&ssrc, &sequence_number, &capture_time_ms,\n                         &priority, &last_packet)) {\n      if (priority == kNormalPriority) {\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      critsect_->Leave();\n      callback_->TimeToSendPacket(ssrc, sequence_number, capture_time_ms);\n      critsect_->Enter();\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::GetNextPacket(uint32_t* ssrc, uint16_t* sequence_number,\n                                int64_t* capture_time_ms, Priority* priority,\n                                bool* last_packet) {\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        *priority = kHighPriority;\n        GetNextPacketFromList(high_priority_packets_.get(), ssrc,\n                              sequence_number, capture_time_ms, last_packet);\n        return true;\n      }\n      if (!normal_priority_packets_->empty()) {\n        *priority = kNormalPriority;\n        GetNextPacketFromList(normal_priority_packets_.get(), ssrc,\n                              sequence_number, capture_time_ms, last_packet);\n        return true;\n      }\n    }\n    return false;\n  }\n  if (!high_priority_packets_->empty()) {\n    *priority = kHighPriority;\n    GetNextPacketFromList(high_priority_packets_.get(), ssrc, sequence_number,\n                          capture_time_ms, last_packet);\n    return true;\n  }\n  if (!normal_priority_packets_->empty()) {\n    *priority = kNormalPriority;\n    GetNextPacketFromList(normal_priority_packets_.get(), ssrc,\n                          sequence_number, capture_time_ms, last_packet);\n    return true;\n  }\n  if (!low_priority_packets_->empty()) {\n    *priority = kLowPriority;\n    GetNextPacketFromList(low_priority_packets_.get(), ssrc, sequence_number,\n                          capture_time_ms, last_packet);\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    bool* last_packet) {\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  packets->pop_front();\n  *last_packet = packets->empty() ||\n      packets->front().capture_time_ms_ > *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>fa2a5751-2e4e-11e5-8ace-28cfe91dbc4b<commit_msg>fa3365fd-2e4e-11e5-9562-28cfe91dbc4b<commit_after>fa3365fd-2e4e-11e5-9562-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>#define _BSD_SOURCE\n\n#include <errno.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <time.h>\n#include <string.h>\n#include <signal.h>\n#include <sys\/time.h>\n#include <sys\/resource.h>\n#include <sys\/wait.h>\n#include <unistd.h>\n#include <sys\/ptrace.h>\n\n#include \"ptbox.h\"\n\npt_process *pt_alloc_process(pt_debugger *debugger) {\n    return new pt_process(debugger);\n}\n\nvoid pt_free_process(pt_process *process) {\n    delete process;\n}\n\npt_process::pt_process(pt_debugger *debugger) :\n    pid(0), callback(NULL), context(NULL), debugger(debugger),\n    event_proc(NULL), event_context(NULL), _trace_syscalls(true),\n    _initialized(false)\n{\n    memset(&exec_time, 0, sizeof exec_time);\n    memset(handler, 0, sizeof handler);\n    debugger->set_process(this);\n}\n\nvoid pt_process::set_callback(pt_handler_callback callback, void *context) {\n    this->callback = callback;\n    this->context = context;\n}\n\nvoid pt_process::set_event_proc(pt_event_callback callback, void *context) {\n    this->event_proc = callback;\n    this->event_context = context;\n}\n\nint pt_process::set_handler(int syscall, int handler) {\n    if (syscall >= MAX_SYSCALL || syscall < 0)\n        return 1;\n    this->handler[syscall] = handler;\n    return 0;\n}\n\nint pt_process::dispatch(int event, unsigned long param) {\n    if (event_proc != NULL)\n        return event_proc(event_context, event, param);\n    return -1;\n}\n\nint pt_process::spawn(pt_fork_handler child, void *context) {\n    pid_t pid = fork();\n    if (pid == -1)\n        return 1;\n    if (pid == 0) {\n        setpgid(0, 0);\n        _exit(child(context));\n    }\n    this->pid = pid;\n    debugger->new_process();\n    return 0;\n}\n\nint pt_process::protection_fault(int syscall) {\n    dispatch(PTBOX_EVENT_PROTECTION, syscall);\n    dispatch(PTBOX_EVENT_EXITING, PTBOX_EXIT_PROTECTION);\n    kill(pid, SIGKILL);\n    return PTBOX_EXIT_PROTECTION;\n}\n\nint pt_process::monitor() {\n    bool in_syscall = false, first = true, spawned = false;\n    struct timespec start, end, delta;\n    int status, exit_reason = PTBOX_EXIT_NORMAL;\n    siginfo_t si;\n    \/\/ Set pgid to -this->pid such that -pgid becomes pid, resulting\n    \/\/ in the initial wait be on the main thread. This allows it a chance\n    \/\/ of creating a new process group.\n    pid_t pid, pgid = -this->pid;\n\n    while (true) {\n        clock_gettime(CLOCK_MONOTONIC, &start);\n        pid = wait4(-pgid, &status, __WALL, &_rusage);\n        clock_gettime(CLOCK_MONOTONIC, &end);\n        timespec_sub(&end, &start, &delta);\n        timespec_add(&exec_time, &delta, &exec_time);\n        int signal = 0;\n\n        \/\/printf(\"pid: %d (%d)\\n\", pid, this->pid);\n\n        if (WIFEXITED(status) || WIFSIGNALED(status)) {\n            if (first || pid == pgid)\n                break;\n            \/\/else printf(\"Thread exit: %d\\n\", pid);\n        }\n\n        if (first) {\n            dispatch(PTBOX_EVENT_ATTACH, 0);\n\n#if defined(__FreeBSD__)\n            \/\/ No FreeBSD equivalent that I know of\n            \/\/ * TRACESYSGOOD is only for bit 7 of SIGTRAP, we can do without\n            \/\/ * TRACECLONE makes no sense since FreeBSD has no clone(2)\n            \/\/ * TRACEEXIT... I'm not sure about\n#else\n            \/\/ This is right after SIGSTOP is received:\n            ptrace(PTRACE_SETOPTIONS, pid, NULL, PTRACE_O_TRACESYSGOOD | PTRACE_O_TRACEEXIT | PTRACE_O_TRACECLONE);\n#endif\n            \/\/ We now set the process group to the actual pgid.\n            pgid = pid;\n        }\n\n        if (WIFSTOPPED(status)) {\n#if defined(__FreeBSD__)\n            \/\/ FreeBSD has no PTRACE_O_TRACESYSGOOD equivalent\n            if (WSTOPSIG(status) == SIGTRAP) {\nelse\n            if (WSTOPSIG(status) == (0x80 | SIGTRAP)) {\n#endif\n                debugger->settid(pid);\n                int syscall = debugger->syscall();\n                in_syscall ^= true;\n                \/\/printf(\"%d: %s syscall %d\\n\", pid, in_syscall ? \"Enter\" : \"Exit\", syscall);\n\n                if (!spawned) {\n                    \/\/ Does execve not return if the process hits an rlimit and gets SIGKILLed?\n                    \/\/\n                    \/\/ It doesn't. See the strace below.\n                    \/\/      $ ulimit -Sv50000\n                    \/\/      $ strace .\/a.out\n                    \/\/      execve(\".\/a.out\", [\".\/a.out\"], [\/* 17 vars *\/] <unfinished ...>\n                    \/\/      +++ killed by SIGKILL +++\n                    \/\/      Killed\n                    \/\/\n                    \/\/ From this we can see that execve doesn't return (<unfinished ...>) if the process fails to\n                    \/\/ initialize, so we don't need to wait until the next non-execve syscall to set\n                    \/\/ _initialized to true - if it exited execve, it's good to go.\n                    if (!in_syscall && syscall == debugger->execve_syscall())\n                        spawned = this->_initialized = true;\n                } else if (in_syscall) {\n                    if (syscall < MAX_SYSCALL) {\n                        switch (handler[syscall]) {\n                            case PTBOX_HANDLER_ALLOW:\n                                break;\n                            case PTBOX_HANDLER_STDOUTERR: {\n                                int arg0 = debugger->arg0();\n                                if (arg0 != 1 && arg0 != 2)\n                                    exit_reason = protection_fault(syscall);\n                                break;\n                            }\n                            case PTBOX_HANDLER_CALLBACK:\n                                if (callback(context, syscall))\n                                    break;\n                                \/\/printf(\"Killed by callback: %d\\n\", syscall);\n                                exit_reason = protection_fault(syscall);\n                                continue;\n                            default:\n                                \/\/ Default is to kill, safety first.\n                                \/\/printf(\"Killed by DISALLOW or None: %d\\n\", syscall);\n                                exit_reason = protection_fault(syscall);\n                                continue;\n                        }\n                    }\n                } else if (debugger->on_return_callback) {\n                    debugger->on_return_callback(debugger->on_return_context, syscall);\n                    debugger->on_return_callback = NULL;\n                    debugger->on_return_context = NULL;\n                }\n            } else {\n#if defined(__FreeBSD__)\n                \/\/ No events aside from signal event on FreeBSD\n                \/\/ (TODO: maybe check for PL_SIGNAL instead of both PL_SIGNAL and PL_NONE?)\n                signal = WSTOPSIG(status);\n#else\n                switch (WSTOPSIG(status)) {\n                    case SIGTRAP:\n                        switch (status >> 16) {\n                            case PTRACE_EVENT_EXIT:\n                                if (exit_reason != PTBOX_EXIT_NORMAL)\n                                    dispatch(PTBOX_EVENT_EXITING, PTBOX_EXIT_NORMAL);\n                            case PTRACE_EVENT_CLONE: {\n                                unsigned long tid;\n                                ptrace(PTRACE_GETEVENTMSG, pid, NULL, &tid);\n                                \/\/printf(\"Created thread: %d\\n\", tid);\n                                break;\n                            }\n                        }\n                        break;\n                    default:\n                        signal = WSTOPSIG(status);\n                }\n#endif\n                if (!first) \/\/ *** Don't set _signal to SIGSTOP if this is the \/first\/ SIGSTOP\n                    dispatch(PTBOX_EVENT_SIGNAL, WSTOPSIG(status));\n            }\n        }\n        \/\/ Pass NULL as signal in case of our first SIGSTOP because the runtime tends to resend it, making all our\n        \/\/ work for naught. Like abort(), it catches the signal, prints something (^Z?) and then resends it.\n        \/\/ Doing this prevents a second SIGSTOP from being dispatched to our event handler above. ***\n#if defined(__FreeBSD__)\n        ptrace(_trace_syscalls ? PT_SYSCALL : PT_CONTINUE, pid, (caddr_t) 1, first ? 0 : signal);\n#else\n        ptrace(_trace_syscalls ? PTRACE_SYSCALL : PTRACE_CONT, pid, NULL, first ? NULL : (void*) signal);\n#endif\n        first = false;\n    }\n    dispatch(PTBOX_EVENT_EXITED, exit_reason);\n    return WIFEXITED(status) ? WEXITSTATUS(status) : -WTERMSIG(status);\n}\n<commit_msg>Lack of # + same color in PyCharm; #192<commit_after>#define _BSD_SOURCE\n\n#include <errno.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <time.h>\n#include <string.h>\n#include <signal.h>\n#include <sys\/time.h>\n#include <sys\/resource.h>\n#include <sys\/wait.h>\n#include <unistd.h>\n#include <sys\/ptrace.h>\n\n#include \"ptbox.h\"\n\npt_process *pt_alloc_process(pt_debugger *debugger) {\n    return new pt_process(debugger);\n}\n\nvoid pt_free_process(pt_process *process) {\n    delete process;\n}\n\npt_process::pt_process(pt_debugger *debugger) :\n    pid(0), callback(NULL), context(NULL), debugger(debugger),\n    event_proc(NULL), event_context(NULL), _trace_syscalls(true),\n    _initialized(false)\n{\n    memset(&exec_time, 0, sizeof exec_time);\n    memset(handler, 0, sizeof handler);\n    debugger->set_process(this);\n}\n\nvoid pt_process::set_callback(pt_handler_callback callback, void *context) {\n    this->callback = callback;\n    this->context = context;\n}\n\nvoid pt_process::set_event_proc(pt_event_callback callback, void *context) {\n    this->event_proc = callback;\n    this->event_context = context;\n}\n\nint pt_process::set_handler(int syscall, int handler) {\n    if (syscall >= MAX_SYSCALL || syscall < 0)\n        return 1;\n    this->handler[syscall] = handler;\n    return 0;\n}\n\nint pt_process::dispatch(int event, unsigned long param) {\n    if (event_proc != NULL)\n        return event_proc(event_context, event, param);\n    return -1;\n}\n\nint pt_process::spawn(pt_fork_handler child, void *context) {\n    pid_t pid = fork();\n    if (pid == -1)\n        return 1;\n    if (pid == 0) {\n        setpgid(0, 0);\n        _exit(child(context));\n    }\n    this->pid = pid;\n    debugger->new_process();\n    return 0;\n}\n\nint pt_process::protection_fault(int syscall) {\n    dispatch(PTBOX_EVENT_PROTECTION, syscall);\n    dispatch(PTBOX_EVENT_EXITING, PTBOX_EXIT_PROTECTION);\n    kill(pid, SIGKILL);\n    return PTBOX_EXIT_PROTECTION;\n}\n\nint pt_process::monitor() {\n    bool in_syscall = false, first = true, spawned = false;\n    struct timespec start, end, delta;\n    int status, exit_reason = PTBOX_EXIT_NORMAL;\n    siginfo_t si;\n    \/\/ Set pgid to -this->pid such that -pgid becomes pid, resulting\n    \/\/ in the initial wait be on the main thread. This allows it a chance\n    \/\/ of creating a new process group.\n    pid_t pid, pgid = -this->pid;\n\n    while (true) {\n        clock_gettime(CLOCK_MONOTONIC, &start);\n        pid = wait4(-pgid, &status, __WALL, &_rusage);\n        clock_gettime(CLOCK_MONOTONIC, &end);\n        timespec_sub(&end, &start, &delta);\n        timespec_add(&exec_time, &delta, &exec_time);\n        int signal = 0;\n\n        \/\/printf(\"pid: %d (%d)\\n\", pid, this->pid);\n\n        if (WIFEXITED(status) || WIFSIGNALED(status)) {\n            if (first || pid == pgid)\n                break;\n            \/\/else printf(\"Thread exit: %d\\n\", pid);\n        }\n\n        if (first) {\n            dispatch(PTBOX_EVENT_ATTACH, 0);\n\n#if defined(__FreeBSD__)\n            \/\/ No FreeBSD equivalent that I know of\n            \/\/ * TRACESYSGOOD is only for bit 7 of SIGTRAP, we can do without\n            \/\/ * TRACECLONE makes no sense since FreeBSD has no clone(2)\n            \/\/ * TRACEEXIT... I'm not sure about\n#else\n            \/\/ This is right after SIGSTOP is received:\n            ptrace(PTRACE_SETOPTIONS, pid, NULL, PTRACE_O_TRACESYSGOOD | PTRACE_O_TRACEEXIT | PTRACE_O_TRACECLONE);\n#endif\n            \/\/ We now set the process group to the actual pgid.\n            pgid = pid;\n        }\n\n        if (WIFSTOPPED(status)) {\n#if __FreeBSD__\n            \/\/ FreeBSD has no PTRACE_O_TRACESYSGOOD equivalent\n            if (WSTOPSIG(status) == SIGTRAP) {\n#else\n            if (WSTOPSIG(status) == (0x80 | SIGTRAP)) {\n#endif\n                debugger->settid(pid);\n                int syscall = debugger->syscall();\n                in_syscall ^= true;\n                \/\/printf(\"%d: %s syscall %d\\n\", pid, in_syscall ? \"Enter\" : \"Exit\", syscall);\n\n                if (!spawned) {\n                    \/\/ Does execve not return if the process hits an rlimit and gets SIGKILLed?\n                    \/\/\n                    \/\/ It doesn't. See the strace below.\n                    \/\/      $ ulimit -Sv50000\n                    \/\/      $ strace .\/a.out\n                    \/\/      execve(\".\/a.out\", [\".\/a.out\"], [\/* 17 vars *\/] <unfinished ...>\n                    \/\/      +++ killed by SIGKILL +++\n                    \/\/      Killed\n                    \/\/\n                    \/\/ From this we can see that execve doesn't return (<unfinished ...>) if the process fails to\n                    \/\/ initialize, so we don't need to wait until the next non-execve syscall to set\n                    \/\/ _initialized to true - if it exited execve, it's good to go.\n                    if (!in_syscall && syscall == debugger->execve_syscall())\n                        spawned = this->_initialized = true;\n                } else if (in_syscall) {\n                    if (syscall < MAX_SYSCALL) {\n                        switch (handler[syscall]) {\n                            case PTBOX_HANDLER_ALLOW:\n                                break;\n                            case PTBOX_HANDLER_STDOUTERR: {\n                                int arg0 = debugger->arg0();\n                                if (arg0 != 1 && arg0 != 2)\n                                    exit_reason = protection_fault(syscall);\n                                break;\n                            }\n                            case PTBOX_HANDLER_CALLBACK:\n                                if (callback(context, syscall))\n                                    break;\n                                \/\/printf(\"Killed by callback: %d\\n\", syscall);\n                                exit_reason = protection_fault(syscall);\n                                continue;\n                            default:\n                                \/\/ Default is to kill, safety first.\n                                \/\/printf(\"Killed by DISALLOW or None: %d\\n\", syscall);\n                                exit_reason = protection_fault(syscall);\n                                continue;\n                        }\n                    }\n                } else if (debugger->on_return_callback) {\n                    debugger->on_return_callback(debugger->on_return_context, syscall);\n                    debugger->on_return_callback = NULL;\n                    debugger->on_return_context = NULL;\n                }\n            } else {\n#if defined(__FreeBSD__)\n                \/\/ No events aside from signal event on FreeBSD\n                \/\/ (TODO: maybe check for PL_SIGNAL instead of both PL_SIGNAL and PL_NONE?)\n                signal = WSTOPSIG(status);\n#else\n                switch (WSTOPSIG(status)) {\n                    case SIGTRAP:\n                        switch (status >> 16) {\n                            case PTRACE_EVENT_EXIT:\n                                if (exit_reason != PTBOX_EXIT_NORMAL)\n                                    dispatch(PTBOX_EVENT_EXITING, PTBOX_EXIT_NORMAL);\n                            case PTRACE_EVENT_CLONE: {\n                                unsigned long tid;\n                                ptrace(PTRACE_GETEVENTMSG, pid, NULL, &tid);\n                                \/\/printf(\"Created thread: %d\\n\", tid);\n                                break;\n                            }\n                        }\n                        break;\n                    default:\n                        signal = WSTOPSIG(status);\n                }\n#endif\n                if (!first) \/\/ *** Don't set _signal to SIGSTOP if this is the \/first\/ SIGSTOP\n                    dispatch(PTBOX_EVENT_SIGNAL, WSTOPSIG(status));\n            }\n        }\n        \/\/ Pass NULL as signal in case of our first SIGSTOP because the runtime tends to resend it, making all our\n        \/\/ work for naught. Like abort(), it catches the signal, prints something (^Z?) and then resends it.\n        \/\/ Doing this prevents a second SIGSTOP from being dispatched to our event handler above. ***\n#if defined(__FreeBSD__)\n        ptrace(_trace_syscalls ? PT_SYSCALL : PT_CONTINUE, pid, (caddr_t) 1, first ? 0 : signal);\n#else\n        ptrace(_trace_syscalls ? PTRACE_SYSCALL : PTRACE_CONT, pid, NULL, first ? NULL : (void*) signal);\n#endif\n        first = false;\n    }\n    dispatch(PTBOX_EVENT_EXITED, exit_reason);\n    return WIFEXITED(status) ? WEXITSTATUS(status) : -WTERMSIG(status);\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>9db306c6-35ca-11e5-b9ed-6c40088e03e4<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>cf0cf7ca-327f-11e5-a1c5-9cf387a8033e<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>99e7faa3-327f-11e5-9835-9cf387a8033e<commit_after><|endoftext|>"}
{"text":"<commit_before>d7d6494a-2e4e-11e5-98bb-28cfe91dbc4b<commit_msg>d7dcfa19-2e4e-11e5-8171-28cfe91dbc4b<commit_after>d7dcfa19-2e4e-11e5-8171-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before><commit_msg>489d0574-2e1d-11e5-affc-60f81dce716c<commit_after><|endoftext|>"}
{"text":"<commit_before>67c12a14-2fa5-11e5-817f-00012e3d3f12<commit_msg>67c325e4-2fa5-11e5-b373-00012e3d3f12<commit_after>67c325e4-2fa5-11e5-b373-00012e3d3f12<|endoftext|>"}
{"text":"<commit_before>5bbb5c06-2e3a-11e5-9883-c03896053bdd<commit_msg>5bcdaee2-2e3a-11e5-9d9f-c03896053bdd<commit_after>5bcdaee2-2e3a-11e5-9d9f-c03896053bdd<|endoftext|>"}
{"text":"<commit_before>81602f6b-2e4f-11e5-ac54-28cfe91dbc4b<commit_msg>8166de66-2e4f-11e5-b8fa-28cfe91dbc4b<commit_after>8166de66-2e4f-11e5-b8fa-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before><commit_msg>ca75015a-35ca-11e5-877a-6c40088e03e4<commit_after><|endoftext|>"}
{"text":"<commit_before>#include <chrono>\n#include <iostream>\n#include <vector>\n#include <memory>\n#include <string>\n#include <SFML\/Graphics.hpp>\n#include \"TextButtonWidget.hpp\"\n#include \"CheckBoxWidget.hpp\"\n#include \"ConsoleWidget.hpp\"\n#include \"GUIEnvironment.hpp\"\n#include \"ProgressWidget.hpp\"\n#include \"TextWidget.hpp\"\n#include \"TextInputWidget.hpp\"\n#include \"VerticalLayout.hpp\"\n#include \"ScrollableWidget.hpp\"\n#include \"WindowWidget.hpp\"\n\ntypedef std::chrono::high_resolution_clock CLOCK;\n\nvoid determineFpsAndDeltaTime(sf::Text &txtStatFPS, float &dt, \n        CLOCK::time_point &timePoint1);\n\nint main()\n{\n    unsigned int windowWidth{ 1280 };\n    unsigned int windowHeight{ 720 };\n    sf::RenderWindow window(sf::VideoMode{ windowWidth, windowHeight }, \"GUI-SFML\");\n\n    sf::Font font;\n    if (!font.loadFromFile(\"assets\/fonts\/LiberationSans-Regular.ttf\"))\n    {\n        std::cout << \"Error by loading Font\" << std::endl;\n    }\n\n    sf::Text txtStatFPS;\n    txtStatFPS.setFont(font);\n    txtStatFPS.setCharacterSize(12);\n    txtStatFPS.setFillColor(sf::Color::Black);\n    float dt{ 0.f };\n    CLOCK::time_point timePoint1{ CLOCK::now() };\n\n    gsf::GUIEnvironment guiEnvironment;\n    std::unique_ptr<gsf::TextWidget> textWidget{ \n    std::make_unique<gsf::TextWidget>\n        \/\/012345678 9012345 678901 23456\n        (\"IM A TEXT\\nTESTA\\nTESTB\\nTESTC\\nS\", font) };\n    \/\/textWidget->centerOrigin();\n    textWidget->setBackgroundColor(sf::Color::Red);\n    textWidget->setCharacterSize(60);\n    textWidget->setPosition(windowWidth \/ 2.f + 100.f, windowHeight \/ 2.f - 330.f);\n    guiEnvironment.addWidget(std::move(textWidget));\n\n    std::unique_ptr<gsf::ScrollableWidget> scrollableWidget{ \n        std::make_unique<gsf::ScrollableWidget>(300, 200) };\n    scrollableWidget->setBackgroundColor(sf::Color::Blue);\n\n    std::unique_ptr<gsf::VerticalLayout> layout{ \n        std::make_unique<gsf::VerticalLayout>() };\n    layout->setPosition(0.f , 0.f);\n    layout->setBackgroundColor(sf::Color::Cyan);\n\n    std::unique_ptr<gsf::ProgressWidget> progressWidget{ \n        std::make_unique<gsf::ProgressWidget>(260, 40) };\n    progressWidget->setPosition(460, 460);\n    progressWidget->setProgress(50);\n    guiEnvironment.addWidget(std::move(progressWidget));\n\n    for (int i{ 0 }; i != 6; i++)\n    {\n        std::string textString{ \"Text Num \" + std::to_string(i) };\n        std::unique_ptr<gsf::TextWidget> text{ std::make_unique<gsf::TextWidget>\n                (textString, font, 40, sf::Color::White) };\n        if (i % 2 == 0)\n        {\n            text->setBackgroundColor(sf::Color::Green);\n        }\n        else\n        {\n            text->setBackgroundColor(sf::Color::Magenta);\n        }\n        std::function<void(gsf::Widget*, sf::Vector2f)> leftClickListener = \n            [] (gsf::Widget* widget, sf::Vector2f mousePos)\n        {\n            gsf::TextWidget *textWidget = static_cast<gsf::TextWidget*>(widget);\n            std::cout << \"TextWidget: Left Mouse Button Clicked. Text: \" \n                << textWidget->getText().toAnsiString() << std::endl;\n        };\n        text->setOnLeftClickListener(leftClickListener);\n        layout->attachChild(std::move(text));\n    }\n\n    scrollableWidget->attachChild(std::move(layout));\n\n    std::unique_ptr<gsf::WindowWidget> windowWidget{ \n        std::make_unique<gsf::WindowWidget>(300.f, 360.f, \"\", font) };\n    windowWidget->setPosition(60.f , 40.f);\n    \/\/windowWidget->setBackgroundColor(sf::Color::White);\n    windowWidget->attachChild(std::move(scrollableWidget));\n    windowWidget->setIsVisible(true);\n    guiEnvironment.addWidget(std::move(windowWidget));\n\n    std::unique_ptr<gsf::WindowWidget> windowWidget2{ \n        std::make_unique<gsf::WindowWidget>(300.f, 360.f, \"\", font) };\n    windowWidget2->setPosition(240.f , 40.f);\n    \/\/windowWidget2->setBackgroundColor(sf::Color::Red);\n    \/\/windowWidget2->setTopBarFillColor(sf::Color::Green);\n    \/\/windowWidget2->setCloseButtonFillColor(sf::Color::Blue);\n    windowWidget2->setWindowTitle(\"Test\");\n    \/\/windowWidget2->setWindowTitleColor(sf::Color::Red);\n    guiEnvironment.addWidget(std::move(windowWidget2));\n\n    std::unique_ptr<gsf::WindowWidget> windowWidget3{ \n        std::make_unique<gsf::WindowWidget>\n            (300.f, 360.f, \"Test Window TTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTT\", font) };\n    windowWidget3->setPosition(300.f , 60.f);\n    \/\/windowWidget3->setOutlineThickness(12.f);\n    \/\/windowWidget3->setOutlineColor(sf::Color::White);\n    \/\/windowWidget3->setBackgroundColor(sf::Color::Blue);\n    guiEnvironment.addWidget(std::move(windowWidget3));\n    \n    \/\/ BUTTON TEST\n    std::unique_ptr<gsf::TextButtonWidget> buttonWidget{ \n        std::make_unique<gsf::TextButtonWidget>\n            (200.f, 80.f, \"CABBBBBTTTTTTTTTTTTTTTTTTTTTTClick me\", font) };\n    buttonWidget->setPosition(240.f , 360.f);\n    buttonWidget->setOnLeftClickListener(\n            [] (gsf::Widget* widget, sf::Vector2f mousePos)\n            {\n                std::cout << \"Button Left Click\\n\";\n\n            });\n    buttonWidget->setOnRightClickListener(\n            [] (gsf::Widget* widget, sf::Vector2f mousePos)\n            {\n                std::cout << \"Button Right Click\\n\";\n\n            });\n    buttonWidget->setOnMiddleClickListener(\n            [] (gsf::Widget* widget, sf::Vector2f mousePos)\n            {\n                std::cout << \"Button Middle Click\\n\";\n\n            });\n    guiEnvironment.addWidget(std::move(buttonWidget));\n\n    \/\/ SCROLLBAR TEST\n    std::unique_ptr<gsf::ScrollableWidget> scrollableWidget3{ \n        std::make_unique<gsf::ScrollableWidget>(300, 200) };\n    scrollableWidget3->setPosition(820.f, 420.f);\n    scrollableWidget3->setBackgroundColor(sf::Color::Yellow);\n\n    std::unique_ptr<gsf::VerticalLayout> layout4{ \n        std::make_unique<gsf::VerticalLayout>() };\n    layout4->setBackgroundColor(sf::Color::Cyan);\n\n    for (int i{0}; i != 10; i++)\n    {\n        std::string textString{ \"Text Text Text Text Text Text Text Num \" \n            + std::to_string(i) };\n        std::unique_ptr<gsf::TextWidget> text{ \n            std::make_unique<gsf::TextWidget>\n                (textString, font, 40, sf::Color::White) };\n        if (i % 2 == 0)\n        {\n            text->setBackgroundColor(sf::Color::Green);\n        }\n        else\n        {\n            text->setBackgroundColor(sf::Color::Magenta);\n        }\n        std::function<void(gsf::Widget*, sf::Vector2f)> leftClickListener = \n            [] (gsf::Widget* widget, sf::Vector2f mousePos)\n        {\n            gsf::TextWidget *textWidget = static_cast<gsf::TextWidget*>(widget);\n            std::cout << \"TextWidget: Left Mouse Button Clicked. Text: \" \n                << textWidget->getText().toAnsiString() << std::endl;\n        };\n        text->setOnLeftClickListener(leftClickListener);\n        \/\/text->setBackgroundColor(sf::Color::Red);\n        layout4->attachChild(std::move(text));\n    }\n    scrollableWidget3->attachChild(std::move(layout4));\n    guiEnvironment.addWidget(std::move(scrollableWidget3));\n\n    std::unique_ptr<gsf::TextInputWidget> textInput1{ \n        std::make_unique<gsf::TextInputWidget>(300.f, 60.f, font) };\n    textInput1->setPosition(320.f, 520.f);\n    textInput1->setBackgroundColor(sf::Color::White);\n    textInput1->setIsHorizontalScrollEnabled(false);\n    textInput1->setText(L\"Test Text HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH :)\");\n    guiEnvironment.addWidget(std::move(textInput1));\n\n    \/\/ Console Widget\n    std::unique_ptr<gsf::ConsoleWidget> console1{ \n        std::make_unique<gsf::ConsoleWidget>(500.f, 200.f, font) };\n    console1->setPosition(700.f, 200.f);\n    console1->setOnCommandEnteredListener(\n            [] (gsf::Widget *widget, std::wstring inputText)\n            {\n                std::wcout << \"CommandEnteredListener command: \" << inputText \n                    << std::endl;\n                gsf::ConsoleWidget *consoleWidget{ \n                    static_cast<gsf::ConsoleWidget*>(widget) };\n                consoleWidget->addTextToDisplay(L\"OK\");\n            }\n    );\n    guiEnvironment.addWidget(std::move(console1));\n\n    \/\/ CheckBoxWidget\n    std::unique_ptr<gsf::CheckBoxWidget> checkBox1{ \n        std::make_unique<gsf::CheckBoxWidget>(60, 60.f) };\n    checkBox1->setPosition(10.f, 620.f);\n    guiEnvironment.addWidget(std::move(checkBox1));\n    while (window.isOpen())\n    {\n        determineFpsAndDeltaTime(txtStatFPS, dt, timePoint1);\n        sf::Event event;\n        while (window.pollEvent(event))\n        {\n            if (event.type == sf::Event::Closed)\n            {\n                window.close();\n            }\n            guiEnvironment.handleEvent(event);\n        }\n        guiEnvironment.update(dt);\n\n\n        window.clear(sf::Color::White);\n        window.draw(guiEnvironment);\n        window.draw(txtStatFPS);\n        window.display();\n    }\n\n    return 0;\n}\n\nvoid determineFpsAndDeltaTime(sf::Text &txtStatFPS, \n        float &dt, CLOCK::time_point &timePoint1)\n{\n    CLOCK::time_point timePoint2{ CLOCK::now() };\n    std::chrono::duration<float> timeSpan{ timePoint2 - timePoint1 };\n    timePoint1 = CLOCK::now();\n    \/\/ Get deltaTime as float in seconds\n    dt = std::chrono::duration_cast<std::chrono::duration<float,std::ratio<1>>> \n        (timeSpan).count();\n    float fps{ 1.f \/ dt };\n    txtStatFPS.setString(\"FPS: \" + std::to_string(fps));\n}\n<commit_msg>Adjust fps counter<commit_after>#include <chrono>\n#include <iostream>\n#include <vector>\n#include <memory>\n#include <string>\n#include <SFML\/Graphics.hpp>\n#include \"TextButtonWidget.hpp\"\n#include \"CheckBoxWidget.hpp\"\n#include \"ConsoleWidget.hpp\"\n#include \"GUIEnvironment.hpp\"\n#include \"ProgressWidget.hpp\"\n#include \"TextWidget.hpp\"\n#include \"TextInputWidget.hpp\"\n#include \"VerticalLayout.hpp\"\n#include \"ScrollableWidget.hpp\"\n#include \"WindowWidget.hpp\"\n\ntypedef std::chrono::high_resolution_clock CLOCK;\n\nvoid determineFpsAndDeltaTime(sf::Text &txtStatFPS, float &dt, \n        float &averageFpsTime, float &fpsInSec, int &fpsCnt, \n        int &averageFpsInOneSec,\n        CLOCK::time_point &timePoint1);\n\nint main()\n{\n    unsigned int windowWidth{ 1280 };\n    unsigned int windowHeight{ 720 };\n    sf::RenderWindow window(sf::VideoMode{ windowWidth, windowHeight }, \"GUI-SFML\");\n\n    sf::Font font;\n    if (!font.loadFromFile(\"assets\/fonts\/LiberationSans-Regular.ttf\"))\n    {\n        std::cout << \"Error by loading Font\" << std::endl;\n    }\n\n    sf::Text txtStatFPS;\n    txtStatFPS.setFont(font);\n    txtStatFPS.setCharacterSize(12);\n    txtStatFPS.setFillColor(sf::Color::Black);\n    float dt{ 0.f };\n    float averageFpsTime{ 0.f };\n    float fpsInSec{ 0.f };\n    int fpsCnt{ 0 };\n    int averageFpsInOneSec{ 0 };\n    CLOCK::time_point timePoint1{ CLOCK::now() };\n\n    gsf::GUIEnvironment guiEnvironment;\n    std::unique_ptr<gsf::TextWidget> textWidget{ \n    std::make_unique<gsf::TextWidget>\n        \/\/012345678 9012345 678901 23456\n        (\"IM A TEXT\\nTESTA\\nTESTB\\nTESTC\\nS\", font) };\n    \/\/textWidget->centerOrigin();\n    textWidget->setBackgroundColor(sf::Color::Red);\n    textWidget->setCharacterSize(60);\n    textWidget->setPosition(windowWidth \/ 2.f + 100.f, windowHeight \/ 2.f - 330.f);\n    guiEnvironment.addWidget(std::move(textWidget));\n\n    std::unique_ptr<gsf::ScrollableWidget> scrollableWidget{ \n        std::make_unique<gsf::ScrollableWidget>(300, 200) };\n    scrollableWidget->setBackgroundColor(sf::Color::Blue);\n\n    std::unique_ptr<gsf::VerticalLayout> layout{ \n        std::make_unique<gsf::VerticalLayout>() };\n    layout->setPosition(0.f , 0.f);\n    layout->setBackgroundColor(sf::Color::Cyan);\n\n    std::unique_ptr<gsf::ProgressWidget> progressWidget{ \n        std::make_unique<gsf::ProgressWidget>(260, 40) };\n    progressWidget->setPosition(460, 460);\n    progressWidget->setProgress(50);\n    guiEnvironment.addWidget(std::move(progressWidget));\n\n    for (int i{ 0 }; i != 6; i++)\n    {\n        std::string textString{ \"Text Num \" + std::to_string(i) };\n        std::unique_ptr<gsf::TextWidget> text{ std::make_unique<gsf::TextWidget>\n                (textString, font, 40, sf::Color::White) };\n        if (i % 2 == 0)\n        {\n            text->setBackgroundColor(sf::Color::Green);\n        }\n        else\n        {\n            text->setBackgroundColor(sf::Color::Magenta);\n        }\n        std::function<void(gsf::Widget*, sf::Vector2f)> leftClickListener = \n            [] (gsf::Widget* widget, sf::Vector2f mousePos)\n        {\n            gsf::TextWidget *textWidget = static_cast<gsf::TextWidget*>(widget);\n            std::cout << \"TextWidget: Left Mouse Button Clicked. Text: \" \n                << textWidget->getText().toAnsiString() << std::endl;\n        };\n        text->setOnLeftClickListener(leftClickListener);\n        layout->attachChild(std::move(text));\n    }\n\n    scrollableWidget->attachChild(std::move(layout));\n\n    std::unique_ptr<gsf::WindowWidget> windowWidget{ \n        std::make_unique<gsf::WindowWidget>(300.f, 360.f, \"\", font) };\n    windowWidget->setPosition(60.f , 40.f);\n    \/\/windowWidget->setBackgroundColor(sf::Color::White);\n    windowWidget->attachChild(std::move(scrollableWidget));\n    windowWidget->setIsVisible(true);\n    guiEnvironment.addWidget(std::move(windowWidget));\n\n    std::unique_ptr<gsf::WindowWidget> windowWidget2{ \n        std::make_unique<gsf::WindowWidget>(300.f, 360.f, \"\", font) };\n    windowWidget2->setPosition(240.f , 40.f);\n    \/\/windowWidget2->setBackgroundColor(sf::Color::Red);\n    \/\/windowWidget2->setTopBarFillColor(sf::Color::Green);\n    \/\/windowWidget2->setCloseButtonFillColor(sf::Color::Blue);\n    windowWidget2->setWindowTitle(\"Test\");\n    \/\/windowWidget2->setWindowTitleColor(sf::Color::Red);\n    guiEnvironment.addWidget(std::move(windowWidget2));\n\n    std::unique_ptr<gsf::WindowWidget> windowWidget3{ \n        std::make_unique<gsf::WindowWidget>\n            (300.f, 360.f, \"Test Window TTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTT\", font) };\n    windowWidget3->setPosition(300.f , 60.f);\n    \/\/windowWidget3->setOutlineThickness(12.f);\n    \/\/windowWidget3->setOutlineColor(sf::Color::White);\n    \/\/windowWidget3->setBackgroundColor(sf::Color::Blue);\n    guiEnvironment.addWidget(std::move(windowWidget3));\n    \n    \/\/ BUTTON TEST\n    std::unique_ptr<gsf::TextButtonWidget> buttonWidget{ \n        std::make_unique<gsf::TextButtonWidget>\n            (200.f, 80.f, \"CABBBBBTTTTTTTTTTTTTTTTTTTTTTClick me\", font) };\n    buttonWidget->setPosition(240.f , 360.f);\n    buttonWidget->setOnLeftClickListener(\n            [] (gsf::Widget* widget, sf::Vector2f mousePos)\n            {\n                std::cout << \"Button Left Click\\n\";\n\n            });\n    buttonWidget->setOnRightClickListener(\n            [] (gsf::Widget* widget, sf::Vector2f mousePos)\n            {\n                std::cout << \"Button Right Click\\n\";\n\n            });\n    buttonWidget->setOnMiddleClickListener(\n            [] (gsf::Widget* widget, sf::Vector2f mousePos)\n            {\n                std::cout << \"Button Middle Click\\n\";\n\n            });\n    guiEnvironment.addWidget(std::move(buttonWidget));\n\n    \/\/ SCROLLBAR TEST\n    std::unique_ptr<gsf::ScrollableWidget> scrollableWidget3{ \n        std::make_unique<gsf::ScrollableWidget>(300, 200) };\n    scrollableWidget3->setPosition(820.f, 420.f);\n    scrollableWidget3->setBackgroundColor(sf::Color::Yellow);\n\n    std::unique_ptr<gsf::VerticalLayout> layout4{ \n        std::make_unique<gsf::VerticalLayout>() };\n    layout4->setBackgroundColor(sf::Color::Cyan);\n\n    for (int i{0}; i != 10; i++)\n    {\n        std::string textString{ \"Text Text Text Text Text Text Text Num \" \n            + std::to_string(i) };\n        std::unique_ptr<gsf::TextWidget> text{ \n            std::make_unique<gsf::TextWidget>\n                (textString, font, 40, sf::Color::White) };\n        if (i % 2 == 0)\n        {\n            text->setBackgroundColor(sf::Color::Green);\n        }\n        else\n        {\n            text->setBackgroundColor(sf::Color::Magenta);\n        }\n        std::function<void(gsf::Widget*, sf::Vector2f)> leftClickListener = \n            [] (gsf::Widget* widget, sf::Vector2f mousePos)\n        {\n            gsf::TextWidget *textWidget = static_cast<gsf::TextWidget*>(widget);\n            std::cout << \"TextWidget: Left Mouse Button Clicked. Text: \" \n                << textWidget->getText().toAnsiString() << std::endl;\n        };\n        text->setOnLeftClickListener(leftClickListener);\n        \/\/text->setBackgroundColor(sf::Color::Red);\n        layout4->attachChild(std::move(text));\n    }\n    scrollableWidget3->attachChild(std::move(layout4));\n    guiEnvironment.addWidget(std::move(scrollableWidget3));\n\n    std::unique_ptr<gsf::TextInputWidget> textInput1{ \n        std::make_unique<gsf::TextInputWidget>(300.f, 60.f, font) };\n    textInput1->setPosition(320.f, 520.f);\n    textInput1->setBackgroundColor(sf::Color::White);\n    textInput1->setIsHorizontalScrollEnabled(false);\n    textInput1->setText(L\"Test Text HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH :)\");\n    guiEnvironment.addWidget(std::move(textInput1));\n\n    \/\/ Console Widget\n    std::unique_ptr<gsf::ConsoleWidget> console1{ \n        std::make_unique<gsf::ConsoleWidget>(500.f, 200.f, font) };\n    console1->setPosition(700.f, 200.f);\n    console1->setOnCommandEnteredListener(\n            [] (gsf::Widget *widget, std::wstring inputText)\n            {\n                std::wcout << \"CommandEnteredListener command: \" << inputText \n                    << std::endl;\n                gsf::ConsoleWidget *consoleWidget{ \n                    static_cast<gsf::ConsoleWidget*>(widget) };\n                consoleWidget->addTextToDisplay(L\"OK\");\n            }\n    );\n    guiEnvironment.addWidget(std::move(console1));\n\n    \/\/ CheckBoxWidget\n    std::unique_ptr<gsf::CheckBoxWidget> checkBox1{ \n        std::make_unique<gsf::CheckBoxWidget>(60, 60.f) };\n    checkBox1->setPosition(10.f, 620.f);\n    guiEnvironment.addWidget(std::move(checkBox1));\n    while (window.isOpen())\n    {\n        determineFpsAndDeltaTime(txtStatFPS, dt, averageFpsTime, fpsInSec, fpsCnt, \n            averageFpsInOneSec, timePoint1);\n        sf::Event event;\n        while (window.pollEvent(event))\n        {\n            if (event.type == sf::Event::Closed)\n            {\n                window.close();\n            }\n            guiEnvironment.handleEvent(event);\n        }\n        guiEnvironment.update(dt);\n\n\n        window.clear(sf::Color::White);\n        window.draw(guiEnvironment);\n        window.draw(txtStatFPS);\n        window.display();\n    }\n\n    return 0;\n}\n\nvoid determineFpsAndDeltaTime(sf::Text &txtStatFPS, float &dt, \n        float &averageFpsTime, float &fpsInSec, int &fpsCnt, \n        int &averageFpsInOneSec,\n        CLOCK::time_point &timePoint1)\n{\n    CLOCK::time_point timePoint2{ CLOCK::now() };\n    std::chrono::duration<float> timeSpan{ timePoint2 - timePoint1 };\n    timePoint1 = CLOCK::now();\n    \/\/ Get deltaTime as float in seconds\n    dt = std::chrono::duration_cast<std::chrono::duration<float,std::ratio<1>>> \n        (timeSpan).count();\n    float fps{ 1.f \/ dt };\n    \n    averageFpsTime += dt;\n    fpsInSec += fps;\n    fpsCnt++;\n    if (averageFpsTime >= 1.f)\n    {\n        averageFpsInOneSec = fpsInSec \/ fpsCnt;\n        averageFpsTime = 0.f;\n        fpsInSec = 0.f;\n        fpsCnt = 0;\n    }\n\n    txtStatFPS.setString(\"FPS: \" + std::to_string(averageFpsInOneSec) + \" (\" \n            + std::to_string(fps) + \")\");\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Fixed more lighting model<commit_after><|endoftext|>"}
{"text":"<commit_before>ea3a3645-2747-11e6-8f07-e0f84713e7b8<commit_msg>Typical bobby<commit_after>ea4e8bcf-2747-11e6-9208-e0f84713e7b8<|endoftext|>"}
{"text":"<commit_before><commit_msg>183a8711-2e4f-11e5-bb5a-28cfe91dbc4b<commit_after><|endoftext|>"}
{"text":"<commit_before>694c4eac-5216-11e5-a731-6c40088e03e4<commit_msg>6952e852-5216-11e5-99c4-6c40088e03e4<commit_after>6952e852-5216-11e5-99c4-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before><commit_msg>762076ea-2d53-11e5-baeb-247703a38240<commit_after><|endoftext|>"}
{"text":"<commit_before>263fd600-2e4f-11e5-bebe-28cfe91dbc4b<commit_msg>2646c42e-2e4f-11e5-b529-28cfe91dbc4b<commit_after>2646c42e-2e4f-11e5-b529-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before><commit_msg>89fb658f-2d3e-11e5-90f4-c82a142b6f9b<commit_after><|endoftext|>"}
{"text":"<commit_before>45a716ca-2e4f-11e5-9933-28cfe91dbc4b<commit_msg>45ad9838-2e4f-11e5-b54c-28cfe91dbc4b<commit_after>45ad9838-2e4f-11e5-b54c-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before><commit_msg>cf53cf59-352a-11e5-b634-34363b65e550<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>4906d6a2-2e1d-11e5-affc-60f81dce716c<commit_after><|endoftext|>"}
{"text":"<commit_before>d6f67f4c-327f-11e5-b4fe-9cf387a8033e<commit_msg>d6ff3573-327f-11e5-a7d9-9cf387a8033e<commit_after>d6ff3573-327f-11e5-a7d9-9cf387a8033e<|endoftext|>"}
{"text":"<commit_before>77d25274-2d53-11e5-baeb-247703a38240<commit_msg>77d2d0e6-2d53-11e5-baeb-247703a38240<commit_after>77d2d0e6-2d53-11e5-baeb-247703a38240<|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 * Declarations for unit tester interface.\n *\/\n\n#ifndef NTA_TESTER_HPP\n#define NTA_TESTER_HPP\n\n\/\/----------------------------------------------------------------------\n\n#include \"gtest\/gtest.h\"\n#include <sstream>\n#include <vector>\n#include <cmath> \/\/ fabs\n#include <nta\/utils\/Log.hpp>\n\n\/\/----------------------------------------------------------------------\n\nnamespace nta {\n\n  \/** Abstract base class for unit testers.\n   *\n   * This class specifies a simple interface for unit testing all Numenta classes.\n   * A unit test is created by subclassing from Tester and implementing RunTests().\n   * \n   *\/\n  class Tester  {\n  public:\n\n    \/** Default constructor\t *\/\n    Tester();\n\n    virtual ~Tester();\n    \n    \/\/\/ This is the main method that subclasses should implement.\n    \/\/\/ It is expected that this method will thoroughly test the target class by calling\n    \/\/\/ each method and testing boundary conditions.\n    \/\/\/ @todo change capitalization. Must be changed in all tests. \n    virtual void RunTests() {}\n      \n    static void init();\n\n    \/*\n     * All tests have access to a standard input dir (read only) and output dir\n     * Make these static so that they can be accessed even if you don't have a tester object.\n     *\/\n    static std::string testInputDir_;\n    static std::string testOutputDir_;\n    static std::string fromTestInputDir(const std::string& path);\n    static std::string fromTestOutputDir(const std::string& path);\n\n  private:\n    \n    \/\/ Default copy ctor and assignment operator forbidden by default\n    Tester(const Tester&);\n    Tester& operator=(const Tester&);\n    \n  }; \/\/ end class Tester\n  \n\n} \/\/ end namespace nta\n\n#define TESTEQUAL(expected, actual) \\\n  EXPECT_EQ(expected, actual);\n#define TESTEQUAL_FLOAT(expected, actual) \\\n  EXPECT_TRUE(::fabs(expected - actual) < 0.000001) << \"assertion \\\"\" #expected \" == \" #actual << \"\\\" failed at \" << __FILE__ << \":\" << __LINE__ ;\n\n#define TESTEQUAL2(name, expected, actual) \\\n  EXPECT_EQ(expected, actual) << \"assertion \\\"\" #name \"\\\" failed at \" << __FILE__ << \":\" << __LINE__ ;\n\n#undef TEST\n\n#define TEST(condition) \\\n  EXPECT_TRUE(condition) << \"assertion \\\"\" #condition \"\\\" failed at \" << __FILE__ << \":\" << __LINE__ ;\n#define TEST2(name, condition) \\\n  EXPECT_TRUE(condition) << \"assertion \\\"\" #name \": \" #condition \"\\\" failed at \" << __FILE__ << \":\" << __LINE__ ;\n\n\/\/ http:\/\/code.google.com\/p\/googletest\/wiki\/V1_7_AdvancedGuide#Exception_Assertions\n#define SHOULDFAIL(statement) \\\n  EXPECT_THROW(statement, std::exception);\n\n\/\/ { \\\n\/\/   if (!disableNegativeTests_) \\\n\/\/   { \\\n\/\/     bool caughtException = false; \\\n\/\/     try { \\\n\/\/       statement; \\\n\/\/     } catch(std::exception& ) { \\\n\/\/       caughtException = true; \\\n\/\/     } \\\n\/\/     testEqual(\"statement '\" #statement \"' should fail\", __FILE__, __LINE__, true, caughtException); \\\n\/\/   } else { \\\n\/\/     disable(\"statement '\" #statement \"' should fail\", __FILE__, __LINE__); \\\n\/\/   } \\\n\/\/ }\n\n#define SHOULDFAIL_WITH_MESSAGE(statement, message) \\\n  { \\\n    bool caughtException = false; \\\n    try { \\\n      statement; \\\n    } catch(nta::LoggingException& e) { \\\n      caughtException = true; \\\n      EXPECT_STREQ(message, e.getMessage()) << \"statement '\" #statement \"' should fail with message \\\"\" \\\n      << message << \"\\\", but failed with message \\\"\" << e.getMessage() << \"\\\"\"; \\\n    } catch(...) { \\\n      FAIL() << \"statement '\" #statement \"' did not generate a logging exception\"; \\\n    } \\\n    EXPECT_EQ(true, caughtException) << \"statement '\" #statement \"' should fail\"; \\\n  }\n\n#define ADDING_TEST(testname, postfix) \\\n    GTEST_TEST(testname##postfix, testname) { \\\n    testname t; \\\n    t.RunTests(); \\\n  }  \n\n#define ADD_TEST(testname) \\\n   ADDING_TEST(testname, Case)\n\n#endif \/\/ NTA_TESTER_HPP\n\n<commit_msg>Prefer EXPECT_DOUBLE_EQ<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 * Declarations for unit tester interface.\n *\/\n\n#ifndef NTA_TESTER_HPP\n#define NTA_TESTER_HPP\n\n\/\/----------------------------------------------------------------------\n\n#include \"gtest\/gtest.h\"\n#include <sstream>\n#include <vector>\n#include <cmath> \/\/ fabs\n#include <nta\/utils\/Log.hpp>\n\n\/\/----------------------------------------------------------------------\n\nnamespace nta {\n\n  \/** Abstract base class for unit testers.\n   *\n   * This class specifies a simple interface for unit testing all Numenta classes.\n   * A unit test is created by subclassing from Tester and implementing RunTests().\n   * \n   *\/\n  class Tester  {\n  public:\n\n    \/** Default constructor\t *\/\n    Tester();\n\n    virtual ~Tester();\n    \n    \/\/\/ This is the main method that subclasses should implement.\n    \/\/\/ It is expected that this method will thoroughly test the target class by calling\n    \/\/\/ each method and testing boundary conditions.\n    \/\/\/ @todo change capitalization. Must be changed in all tests. \n    virtual void RunTests() {}\n      \n    static void init();\n\n    \/*\n     * All tests have access to a standard input dir (read only) and output dir\n     * Make these static so that they can be accessed even if you don't have a tester object.\n     *\/\n    static std::string testInputDir_;\n    static std::string testOutputDir_;\n    static std::string fromTestInputDir(const std::string& path);\n    static std::string fromTestOutputDir(const std::string& path);\n\n  private:\n    \n    \/\/ Default copy ctor and assignment operator forbidden by default\n    Tester(const Tester&);\n    Tester& operator=(const Tester&);\n    \n  }; \/\/ end class Tester\n  \n\n} \/\/ end namespace nta\n\n#define TESTEQUAL(expected, actual) \\\n  EXPECT_EQ(expected, actual);\n#define TESTEQUAL_FLOAT(expected, actual) \\\n  EXPECT_DOUBLE_EQ(expected, actual) << \"assertion \\\"\" #expected \" == \" #actual << \"\\\" failed at \" << __FILE__ << \":\" << __LINE__ ;\n\n#define TESTEQUAL2(name, expected, actual) \\\n  EXPECT_EQ(expected, actual) << \"assertion \\\"\" #name \"\\\" failed at \" << __FILE__ << \":\" << __LINE__ ;\n\n#undef TEST\n\n#define TEST(condition) \\\n  EXPECT_TRUE(condition) << \"assertion \\\"\" #condition \"\\\" failed at \" << __FILE__ << \":\" << __LINE__ ;\n#define TEST2(name, condition) \\\n  EXPECT_TRUE(condition) << \"assertion \\\"\" #name \": \" #condition \"\\\" failed at \" << __FILE__ << \":\" << __LINE__ ;\n\n\/\/ http:\/\/code.google.com\/p\/googletest\/wiki\/V1_7_AdvancedGuide#Exception_Assertions\n#define SHOULDFAIL(statement) \\\n  EXPECT_THROW(statement, std::exception);\n\n\/\/ { \\\n\/\/   if (!disableNegativeTests_) \\\n\/\/   { \\\n\/\/     bool caughtException = false; \\\n\/\/     try { \\\n\/\/       statement; \\\n\/\/     } catch(std::exception& ) { \\\n\/\/       caughtException = true; \\\n\/\/     } \\\n\/\/     testEqual(\"statement '\" #statement \"' should fail\", __FILE__, __LINE__, true, caughtException); \\\n\/\/   } else { \\\n\/\/     disable(\"statement '\" #statement \"' should fail\", __FILE__, __LINE__); \\\n\/\/   } \\\n\/\/ }\n\n#define SHOULDFAIL_WITH_MESSAGE(statement, message) \\\n  { \\\n    bool caughtException = false; \\\n    try { \\\n      statement; \\\n    } catch(nta::LoggingException& e) { \\\n      caughtException = true; \\\n      EXPECT_STREQ(message, e.getMessage()) << \"statement '\" #statement \"' should fail with message \\\"\" \\\n      << message << \"\\\", but failed with message \\\"\" << e.getMessage() << \"\\\"\"; \\\n    } catch(...) { \\\n      FAIL() << \"statement '\" #statement \"' did not generate a logging exception\"; \\\n    } \\\n    EXPECT_EQ(true, caughtException) << \"statement '\" #statement \"' should fail\"; \\\n  }\n\n#define ADDING_TEST(testname, postfix) \\\n    GTEST_TEST(testname##postfix, testname) { \\\n    testname t; \\\n    t.RunTests(); \\\n  }  \n\n#define ADD_TEST(testname) \\\n   ADDING_TEST(testname, Case)\n\n#endif \/\/ NTA_TESTER_HPP\n\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\nexpand.cpp\n\n(c) 2009, 2010, 2011 - Aaron Quinlan\nCenter for Public Health Genomics\nUniversity of Virginia\naaronquinlan@gmail.com\n\nLicenced under the MIT license.\n******************************************************************************\/\n#include <vector>\n#include <map>\n#include <numeric>\n#include <algorithm>\n#include <iterator>\n#include <iostream>\n#include <iomanip>\n#include <fstream>\n#include <sstream>\n#include <stdlib.h>\n#include <math.h>\n#include <limits.h>\n#include <string.h>\n#include <exception>\n#include <stdexcept> \/\/ out_of_range exception\n\n#include \"version.h\"\n#include \"lineFileUtilities.h\"\n#include \"tabFile.h\"\n#include \"VectorOps.h\"\nusing namespace std;\n\n\n\/\/ define our program name\n#define PROGRAM_NAME \"bedtools expand\"\n\/\/ define our parameter checking macro\n#define PARAMETER_CHECK(param, paramLen, actualLen) ((strncmp(argv[i], param, min(actualLen, paramLen))== 0) && \\\n                                                              (actualLen == paramLen))\n#define LOOKS_LIKE_A_PARAM(string) (strlen(string)>0 && string[0]=='-')\n\n\/\/ function declarations\nvoid expand_help(void);\nvoid Expand(const string &inFile, \n            const vector<int> &expColumns);\n\nint expand_main(int argc, char* argv[]) {\n\n    \/\/ input files\n    string inFile             = \"stdin\";\n    string groupColumnsString = \"1,2,3\";\n    string expColumnString;\n\n    \/\/ our configuration variables\n    bool showHelp          = false;\n    bool haveExpColumns     = false;\n\n    \/\/ check to see if we should print out some help\n    if(argc <= 1) showHelp = true;\n\n    for(int i = 1; i < argc; i++) {\n        int parameterLength = (int)strlen(argv[i]);\n\n        if((PARAMETER_CHECK(\"-h\", 2, parameterLength)) ||\n        (PARAMETER_CHECK(\"--help\", 5, parameterLength))) {\n            showHelp = true;\n        }\n    }\n\n    if(showHelp) expand_help();\n\n    \/\/ do some parsing (all of these parameters require 2 strings)\n    for(int i = 1; i < argc; i++) {\n\n        int parameterLength = (int)strlen(argv[i]);\n\n        if(PARAMETER_CHECK(\"-i\", 2, parameterLength)) {\n            if ((i+1) >= argc || LOOKS_LIKE_A_PARAM(argv[i+1])) {\n                cerr << endl << \"*****ERROR: -i parameter requires a value.\" << endl << endl;\n                expand_help();\n                break;\n            }\n            else {\n                inFile     = argv[i + 1];\n                i++;\n            }\n        }\n        else if(PARAMETER_CHECK(\"-expcols\", 7, parameterLength) || PARAMETER_CHECK(\"-c\", 2, parameterLength)) {\n            if ((i+1) >= argc || LOOKS_LIKE_A_PARAM(argv[i+1])) {\n                cerr << endl << \"*****ERROR: -opCols parameter requires a value.\" << endl << endl;\n                expand_help();\n                break;\n            }\n            else {\n                haveExpColumns       = true;\n                expColumnString     = argv[i + 1];\n                i++;\n            }\n        }\n        else {\n            cerr << endl << \"*****ERROR: Unrecognized parameter: \" << argv[i] << \" *****\" << endl << endl;\n            showHelp = true;\n        }\n    }\n\n    if (!haveExpColumns) {\n        cerr << endl << \"*****\" << endl << \"*****ERROR: Need -opCols.\" << endl << \"*****\" << endl;\n        showHelp = true;\n    }\n    \n\n\n    if (!showHelp) {\n        vector<int> expColumns;\n        Tokenize(expColumnString, expColumns, ',');\n\n        \/\/ sanity check the exp columns\n        for(size_t i = 0; i < expColumns.size(); ++i) {\n            int expCol = expColumns[i];\n            if (expCol < 1) {\n                cerr << endl << \"*****\" << endl << \"*****ERROR: expansion columns must be >=1. \" << endl << \"*****\" << endl;\n                expand_help();\n            }\n        }\n        Expand(inFile, expColumns);\n    }\n    else {\n        expand_help();\n    }\n    return 0;\n}\n\nvoid expand_help(void) {\n\n    cerr << \"\\nTool:    bedtools expand \" << endl;\n    cerr << \"Version: \" << VERSION << \"\\n\";    \n    cerr << \"Summary: Replicate lines in a file based on columns of comma-separated values.\" << endl << endl;\n\n    cerr << \"Usage:\\t \" << PROGRAM_NAME << \" -c [COLS] \" << endl;\n\n    cerr << \"Options: \" << endl;\n    cerr << \"\\t-i\\t\"        << \"Input file. Assumes \\\"stdin\\\" if omitted.\" << endl << endl;\n\n    cerr << \"\\t-c \\t\"    << \"Specify the column (1-based) that should be summarized.\" << endl;\n    cerr                 << \"\\t\\t- Required.\" << endl;\n\n    cerr << \"Examples: \" << endl;\n    cerr << \"  $ cat test.txt\" << endl;\n    cerr << \"  chr1\t10\t20\t1,2,3\t10,20,30\" << endl;\n    cerr << \"  chr1\t40\t50\t4,5,6\t40,50,60\" << endl << endl;\n               \n    cerr << \"  $ bedtools expand test.txt -c 5\" << endl;\n    cerr << \"  chr1\t10\t20\t1,2,3\t10\" << endl;\n    cerr << \"  chr1\t10\t20\t1,2,3\t20\" << endl;\n    cerr << \"  chr1\t10\t20\t1,2,3\t30\" << endl;\n    cerr << \"  chr1\t40\t50\t4,5,6\t40\" << endl;\n    cerr << \"  chr1\t40\t50\t4,5,6\t50\" << endl;\n    cerr << \"  chr1\t40\t50\t4,5,6\t60\" << endl << endl;\n\n    cerr << \"  $ bedtools expand test.txt -c 4,5\" << endl;\n    cerr << \"  chr1\t10\t20\t1\t10\" << endl;\n    cerr << \"  chr1\t10\t20\t2\t20\" << endl;\n    cerr << \"  chr1\t10\t20\t3\t30\" << endl;\n    cerr << \"  chr1\t40\t50\t4\t40\" << endl;\n    cerr << \"  chr1\t40\t50\t5\t50\" << endl;\n    cerr << \"  chr1\t40\t50\t6\t60\" << endl;\n\n    \/\/ end the program here\n    exit(1);\n\n}\n\n\nvoid Expand (const string &inFile,\n    const vector<int> &expColumns) \n{\n\n    \/\/ current line number\n    int lineNum = 0;\n    \/\/ string representing current line\n    string inLine;\n\n    \/\/ vector of strings holding the tokenized current line\n    vector<string>  inFields;\n    inFields.reserve(20);\n\n    \/\/ build a map of the columns to be expanded\n    \/\/ to allow quic lookups to test if a column is\n    \/\/ \"normal\" or whether it is one of the columns \n    \/\/ that is being expaded\n    map<int, bool> expColMap;\n    for (size_t c = 0; c < expColumns.size(); c++)\n        expColMap[expColumns[c]] = true;\n    \n    \/\/ open a new tab file, loop through it line by line\n    \/\/ and expand each line into multiple lines according to the\n    \/\/ columns the user has requested.\n    \/\/ \n    TabLineStatus tabLineStatus;\n    TabFile *_tab = new TabFile(inFile);\n    _tab->Open();\n    while ((tabLineStatus = _tab->GetNextTabLine(inFields, lineNum)) != TAB_INVALID) {\n        lineNum++;\n        if (tabLineStatus == TAB_VALID) {\n            \n            \/\/ a list containing the expanded values (inner) for each column (outer)\n            vector< vector<string> >  expandedCols;\n            \n            \/\/ expand each requested column into a vector\n            int prev_size = -1;\n            for (size_t c = 0; c < expColumns.size(); c++)\n            {\n                vector<string> expansion;\n                if ((expColumns[c]-1) >= (int) inFields.size()) {\n                    cerr << endl\n                    << \"*****\" << endl\n                    << \"*****ERROR: Requested column number exceeds number of columns.\" << endl\n                    << \"*****       This was violated at line: \" << lineNum << endl\n                    << \"*****\" << endl;\n                    exit(1);\n                }\n               \n                \/\/ expand the requested column into a vector\n                Tokenize(inFields[expColumns[c]-1], expansion, ',');\n               \n                if ((int) expansion.size() != prev_size && prev_size >= 0) {\n                    cerr << endl\n                    << \"*****\" << endl\n                    << \"*****ERROR: Each expanded column must have the same number of elements.\" << endl\n                    << \"*****       This was violated at line: \" << lineNum << endl\n                    << \"*****\" << endl;\n                    exit(1);\n                }\n                else {\n                    expandedCols.push_back(expansion);\n                }\n                prev_size = expansion.size();\n            }\n\n            \/\/ now replicate\/expand the original line based on the \n            \/\/ values in the requested columns\n            size_t totalCols  = inFields.size();\n            for (size_t n = 0; n < expandedCols[0].size(); n++) \n            {\n                int numExpColsSeen = 0;\n                for (size_t c = 0; c < totalCols; c++)\n                {\n                    \/\/ normal column, print as-is\n                    if (!expColMap[c+1]) {\n                        printf(\"%s\", inFields[c].c_str());\n                    }\n                    \/\/ expanded column, grab relevant value from expanded vector.\n                    else {\n                        \/\/ expandedCols[i][j]\n                        \/\/ i == column, j = row\n                        printf(\"%s\", expandedCols[numExpColsSeen][n].c_str());\n                        numExpColsSeen++;\n                    }\n                    \/\/ add a tab if not the very last value\n                    if (c < totalCols - 1)\n                        printf(\"\\t\");\n                }\n                printf(\"\\n\");\n            }\n        }\n        inFields.clear();\n    }\n    _tab->Close();\n}\n\n<commit_msg>expand now supports - for stdin<commit_after>\/*****************************************************************************\nexpand.cpp\n\n(c) 2009, 2010, 2011 - Aaron Quinlan\nCenter for Public Health Genomics\nUniversity of Virginia\naaronquinlan@gmail.com\n\nLicenced under the MIT license.\n******************************************************************************\/\n#include <vector>\n#include <map>\n#include <numeric>\n#include <algorithm>\n#include <iterator>\n#include <iostream>\n#include <iomanip>\n#include <fstream>\n#include <sstream>\n#include <stdlib.h>\n#include <math.h>\n#include <limits.h>\n#include <string.h>\n#include <exception>\n#include <stdexcept> \/\/ out_of_range exception\n\n#include \"version.h\"\n#include \"lineFileUtilities.h\"\n#include \"tabFile.h\"\n#include \"VectorOps.h\"\nusing namespace std;\n\n\n\/\/ define our program name\n#define PROGRAM_NAME \"bedtools expand\"\n\/\/ define our parameter checking macro\n#define PARAMETER_CHECK(param, paramLen, actualLen) ((strncmp(argv[i], param, min(actualLen, paramLen))== 0) && \\\n                                                              (actualLen == paramLen))\n#define LOOKS_LIKE_A_PARAM(string) (strlen(string)>0 && string[0]=='-')\n\n\/\/ function declarations\nvoid expand_help(void);\nvoid Expand(const string &inFile, \n            const vector<int> &expColumns);\n\nint expand_main(int argc, char* argv[]) {\n\n    \/\/ input files\n    string inFile             = \"stdin\";\n    string groupColumnsString = \"1,2,3\";\n    string expColumnString;\n\n    \/\/ our configuration variables\n    bool showHelp          = false;\n    bool haveExpColumns     = false;\n\n    \/\/ check to see if we should print out some help\n    if(argc <= 1) showHelp = true;\n\n    for(int i = 1; i < argc; i++) {\n        int parameterLength = (int)strlen(argv[i]);\n\n        if((PARAMETER_CHECK(\"-h\", 2, parameterLength)) ||\n        (PARAMETER_CHECK(\"--help\", 5, parameterLength))) {\n            showHelp = true;\n        }\n    }\n\n    if(showHelp) expand_help();\n\n    \/\/ do some parsing (all of these parameters require 2 strings)\n    for(int i = 1; i < argc; i++) {\n\n        int parameterLength = (int)strlen(argv[i]);\n\n        if(PARAMETER_CHECK(\"-i\", 2, parameterLength)) {\n            if ((i+1) < argc) {\n                inFile     = argv[i + 1];\n                i++;\n            }\n        }\n        else if(PARAMETER_CHECK(\"-c\", 2, parameterLength)) {\n            if ((i+1) >= argc || LOOKS_LIKE_A_PARAM(argv[i+1])) {\n                cerr << endl << \"*****ERROR: -opCols parameter requires a value.\" << endl << endl;\n                expand_help();\n                break;\n            }\n            else {\n                haveExpColumns       = true;\n                expColumnString     = argv[i + 1];\n                i++;\n            }\n        }\n        else {\n            cerr << endl << \"*****ERROR: Unrecognized parameter: \" << argv[i] << \" *****\" << endl << endl;\n            showHelp = true;\n        }\n    }\n\n    if (!haveExpColumns) {\n        cerr << endl << \"*****\" << endl << \"*****ERROR: Need -opCols.\" << endl << \"*****\" << endl;\n        showHelp = true;\n    }\n    \n\n\n    if (!showHelp) {\n        vector<int> expColumns;\n        Tokenize(expColumnString, expColumns, ',');\n\n        \/\/ sanity check the exp columns\n        for(size_t i = 0; i < expColumns.size(); ++i) {\n            int expCol = expColumns[i];\n            if (expCol < 1) {\n                cerr << endl << \"*****\" << endl << \"*****ERROR: expansion columns must be >=1. \" << endl << \"*****\" << endl;\n                expand_help();\n            }\n        }\n        Expand(inFile, expColumns);\n    }\n    else {\n        expand_help();\n    }\n    return 0;\n}\n\nvoid expand_help(void) {\n\n    cerr << \"\\nTool:    bedtools expand \" << endl;\n    cerr << \"Version: \" << VERSION << \"\\n\";    \n    cerr << \"Summary: Replicate lines in a file based on columns of comma-separated values.\" << endl << endl;\n\n    cerr << \"Usage:\\t \" << PROGRAM_NAME << \" -c [COLS] \" << endl;\n\n    cerr << \"Options: \" << endl;\n    cerr << \"\\t-i\\t\"        << \"Input file. Assumes \\\"stdin\\\" if omitted.\" << endl << endl;\n\n    cerr << \"\\t-c \\t\"    << \"Specify the column (1-based) that should be summarized.\" << endl;\n    cerr                 << \"\\t\\t- Required.\" << endl;\n\n    cerr << \"Examples: \" << endl;\n    cerr << \"  $ cat test.txt\" << endl;\n    cerr << \"  chr1\t10\t20\t1,2,3\t10,20,30\" << endl;\n    cerr << \"  chr1\t40\t50\t4,5,6\t40,50,60\" << endl << endl;\n               \n    cerr << \"  $ bedtools expand test.txt -c 5\" << endl;\n    cerr << \"  chr1\t10\t20\t1,2,3\t10\" << endl;\n    cerr << \"  chr1\t10\t20\t1,2,3\t20\" << endl;\n    cerr << \"  chr1\t10\t20\t1,2,3\t30\" << endl;\n    cerr << \"  chr1\t40\t50\t4,5,6\t40\" << endl;\n    cerr << \"  chr1\t40\t50\t4,5,6\t50\" << endl;\n    cerr << \"  chr1\t40\t50\t4,5,6\t60\" << endl << endl;\n\n    cerr << \"  $ bedtools expand test.txt -c 4,5\" << endl;\n    cerr << \"  chr1\t10\t20\t1\t10\" << endl;\n    cerr << \"  chr1\t10\t20\t2\t20\" << endl;\n    cerr << \"  chr1\t10\t20\t3\t30\" << endl;\n    cerr << \"  chr1\t40\t50\t4\t40\" << endl;\n    cerr << \"  chr1\t40\t50\t5\t50\" << endl;\n    cerr << \"  chr1\t40\t50\t6\t60\" << endl;\n\n    \/\/ end the program here\n    exit(1);\n\n}\n\n\nvoid Expand (const string &inFile,\n    const vector<int> &expColumns) \n{\n\n    \/\/ current line number\n    int lineNum = 0;\n    \/\/ string representing current line\n    string inLine;\n\n    \/\/ vector of strings holding the tokenized current line\n    vector<string>  inFields;\n    inFields.reserve(20);\n\n    \/\/ build a map of the columns to be expanded\n    \/\/ to allow quic lookups to test if a column is\n    \/\/ \"normal\" or whether it is one of the columns \n    \/\/ that is being expaded\n    map<int, bool> expColMap;\n    for (size_t c = 0; c < expColumns.size(); c++)\n        expColMap[expColumns[c]] = true;\n    \n    \/\/ open a new tab file, loop through it line by line\n    \/\/ and expand each line into multiple lines according to the\n    \/\/ columns the user has requested.\n    \/\/ \n    TabLineStatus tabLineStatus;\n    TabFile *_tab = new TabFile(inFile);\n    _tab->Open();\n    while ((tabLineStatus = _tab->GetNextTabLine(inFields, lineNum)) != TAB_INVALID) {\n        lineNum++;\n        if (tabLineStatus == TAB_VALID) {\n            \n            \/\/ a list containing the expanded values (inner) for each column (outer)\n            vector< vector<string> >  expandedCols;\n            \n            \/\/ expand each requested column into a vector\n            int prev_size = -1;\n            for (size_t c = 0; c < expColumns.size(); c++)\n            {\n                vector<string> expansion;\n                if ((expColumns[c]-1) >= (int) inFields.size()) {\n                    cerr << endl\n                    << \"*****\" << endl\n                    << \"*****ERROR: Requested column number exceeds number of columns.\" << endl\n                    << \"*****       This was violated at line: \" << lineNum << endl\n                    << \"*****\" << endl;\n                    exit(1);\n                }\n               \n                \/\/ expand the requested column into a vector\n                Tokenize(inFields[expColumns[c]-1], expansion, ',');\n               \n                if ((int) expansion.size() != prev_size && prev_size >= 0) {\n                    cerr << endl\n                    << \"*****\" << endl\n                    << \"*****ERROR: Each expanded column must have the same number of elements.\" << endl\n                    << \"*****       This was violated at line: \" << lineNum << endl\n                    << \"*****\" << endl;\n                    exit(1);\n                }\n                else {\n                    expandedCols.push_back(expansion);\n                }\n                prev_size = expansion.size();\n            }\n\n            \/\/ now replicate\/expand the original line based on the \n            \/\/ values in the requested columns\n            size_t totalCols  = inFields.size();\n            for (size_t n = 0; n < expandedCols[0].size(); n++) \n            {\n                int numExpColsSeen = 0;\n                for (size_t c = 0; c < totalCols; c++)\n                {\n                    \/\/ normal column, print as-is\n                    if (!expColMap[c+1]) {\n                        printf(\"%s\", inFields[c].c_str());\n                    }\n                    \/\/ expanded column, grab relevant value from expanded vector.\n                    else {\n                        \/\/ expandedCols[i][j]\n                        \/\/ i == column, j = row\n                        printf(\"%s\", expandedCols[numExpColsSeen][n].c_str());\n                        numExpColsSeen++;\n                    }\n                    \/\/ add a tab if not the very last value\n                    if (c < totalCols - 1)\n                        printf(\"\\t\");\n                }\n                printf(\"\\n\");\n            }\n        }\n        inFields.clear();\n    }\n    _tab->Close();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n  EMCAL DA for online calibration: for LED studies\n  \n  Contact: silvermy@ornl.gov\n  Run Type: PHYSICS or STANDALONE\n  DA Type: MON \n  Number of events needed: continously accumulating for all runs, rate ~0.1-1 Hz\n  Input Files: argument list\n  Output Files: RESULT_FILE=EMCALLED.root, to be exported to the DAQ FXS\n  fileId:  FILE_ID=EMCALLED    \n  Trigger types used: CALIBRATION_EVENT (temporarily also PHYSICS_EVENT to start with)\n  [When we have real data files later, we should only use CALIBRATION_EVENT]\n*\/\n\/*\n  This process reads RAW data from the files provided as command line arguments\n  and save results (class itself) in a file (named from RESULT_FILE define - \n  see below).\n*\/\n\n#define RESULT_FILE  \"EMCALLED.root\"\n#define FILE_ID \"EMCALLED\"\n#define AliDebugLevel() -1\n#define FILE_PEDClassName \"emcCalibPedestal\"\n#define FILE_SIGClassName \"emcCalibSignal\"\nconst int kNRCU = 2;\n\/* LOCAL_DEBUG is used to bypass daq* calls that do not work locally *\/\n\/\/#define LOCAL_DEBUG 1 \/\/ comment out to run normally                                                            \nextern \"C\" {\n#include <daqDA.h>\n}\n#include \"event.h\" \/* in $DATE_COMMON_DEFS\/; includes definition of event types *\/\n#include \"monitor.h\" \/* in $DATE_MONITOR_DIR\/; monitor* interfaces *\/\n\n#include \"stdio.h\"\n#include \"stdlib.h\"\n\n\/\/ ROOT includes\n#include <TFile.h> \n#include <TROOT.h> \n#include <TPluginManager.h> \n#include <TSystem.h> \n\n\/\/\n\/\/AliRoot includes\n\/\/\n#include \"AliRawReader.h\"\n#include \"AliRawReaderDate.h\"\n#include \"AliRawEventHeaderBase.h\"\n#include \"AliCaloRawStream.h\"\n#include \"AliCaloAltroMapping.h\"\n#include \"AliLog.h\"\n\n\/\/\n\/\/ EMC calibration-helper algorithm includes\n\/\/\n#include \"AliCaloCalibPedestal.h\"\n#include \"AliCaloCalibSignal.h\"\n\n\/*\n  Main routine, EMC signal detector algorithm \n  Arguments: list of DATE raw data files\n*\/\n\nint main(int argc, char **argv) {\n\n  AliLog::SetClassDebugLevel(\"AliCaloRawStream\",-5);\n  AliLog::SetClassDebugLevel(\"AliRawReaderDate\",-5);\n  AliLog::SetModuleDebugLevel(\"RAW\",-5);\n\n  if (argc<2) {\n    printf(\"Wrong number of arguments\\n\");\n    return -1;  \n  }\n\n  \/* magic line - for TStreamerInfo *\/\n  gROOT->GetPluginManager()->AddHandler(\"TVirtualStreamerInfo\",\n\t\t\t\t\t\"*\",\n\t\t\t\t\t\"TStreamerInfo\",\n\t\t\t\t\t\"RIO\",\n\t\t\t\t\t\"TStreamerInfo()\"); \n\n  int i, status;\n\n  \/* log start of process *\/\n  printf(\"EMCAL DA started - %s\\n\",__FILE__);\n\n  \/* declare monitoring program *\/\n  status=monitorDeclareMp( __FILE__ );\n  if (status!=0) {\n    printf(\"monitorDeclareMp() failed : %s\\n\",monitorDecodeError(status));\n    return -1;\n  }\n  \/* define wait event timeout - 1s max *\/\n  monitorSetNowait();\n  monitorSetNoWaitNetworkTimeout(1000);\n\n  \/* Retrieve mapping files from DAQ DB *\/ \n  const char* mapFiles[kNRCU] = {\"RCU0.data\",\"RCU1.data\"};\n\n  for(Int_t iFile=0; iFile<kNRCU; iFile++) {\n    int failed = daqDA_DB_getFile(mapFiles[iFile], mapFiles[iFile]);\n    if(failed) { \n      printf(\"Cannot retrieve file %d : %s from DAQ DB. Exit now..\\n\",\n\t     iFile, mapFiles[iFile]);\n#ifdef LOCAL_DEBUG\n#else\n      return -1;\n#endif\n    }\n  }\n  \n  \/* Open mapping files *\/\n  AliCaloAltroMapping *mapping[kNRCU];\n  TString path = \".\/\";\n  path += \"RCU\";\n  TString path2;\n  for(Int_t i = 0; i < kNRCU; i++) {\n    path2 = path;\n    path2 += i;\n    path2 += \".data\";\n    mapping[i] = new AliCaloAltroMapping(path2.Data());\n  }\n  \n  \/* set up our analysis classes *\/  \n  AliCaloCalibPedestal * calibPedestal = new AliCaloCalibPedestal(AliCaloCalibPedestal::kEmCal); \n  calibPedestal->SetAltroMapping( mapping );\n  AliCaloCalibSignal * calibSignal = new AliCaloCalibSignal(AliCaloCalibSignal::kEmCal); \n  calibSignal->SetAltroMapping( mapping );\n\n  AliRawReader *rawReader = NULL;\n  AliRawReader *rawReader2 = NULL;\n  int nevents=0;\n\n  \/* loop over RAW data files *\/\n  for ( i=1; i<argc; i++ ) {\n\n    \/* define data source : this is argument i *\/\n    printf(\"Processing file %s\\n\", argv[i]);\n    status=monitorSetDataSource( argv[i] );\n    if (status!=0) {\n      printf(\"monitorSetDataSource() failed. Error=%s. Exiting ...\\n\", monitorDecodeError(status));\n      return -1;\n    }\n\n    \/* read until EOF *\/\n    struct eventHeaderStruct *event;\n    eventTypeType eventT;\n\n    for ( ; ; ) { \/\/ infinite loop\n\n      \/* check shutdown condition *\/\n      if (daqDA_checkShutdown()) {break;}\n\n      \/* get next event (blocking call until timeout) *\/\n      status=monitorGetEventDynamic((void **)&event);\n      if (status==MON_ERR_EOF) {\n\tprintf (\"End of File %d (%s) detected\\n\", i, argv[i]);\n\tbreak; \/* end of monitoring file has been reached *\/\n      }\n      if (status!=0) {\n\tprintf(\"monitorGetEventDynamic() failed : %s\\n\",monitorDecodeError(status));\n\tbreak;\n      }\n\n      \/* retry if got no event *\/\n      if (event==NULL) {\n\tcontinue;\n      }\n      eventT = event->eventType; \/* just convenient shorthand *\/\n\n      \/* skip start\/end of run events *\/\n      if ( (eventT != physicsEvent) && (eventT != calibrationEvent) ) {\n\tcontinue;\n      }\n\n      nevents++; \/\/ count how many acceptable events we have\n\n      \/\/  Signal calibration\n      rawReader = new AliRawReaderDate((void*)event);\n      calibSignal->ProcessEvent(rawReader);\n      delete rawReader;\n      \/\/ seems like we need a fresh rawreader for a 2nd read customer(?)\n      \/\/ otherwise, we have already fast-forwarded past the event(?)\n      rawReader2 = new AliRawReaderDate((void*)event);\n      calibPedestal->ProcessEvent(rawReader2);\n      delete rawReader2;\n\n      \/* free resources *\/\n      free(event);    \n\n    } \/\/until EOF\n  } \/\/ loop over files\n\n  \/\/\n  \/\/ write class to rootfile\n  \/\/\n\n  printf (\"%d physics\/calibration events processed.\\n\",nevents);\n\n  TFile f(RESULT_FILE, \"recreate\");\n  if (!f.IsZombie()) { \n    f.cd();\n    calibPedestal->Write(FILE_PEDClassName);\n    calibSignal->Write(FILE_SIGClassName);\n    f.Close();\n    printf(\"Objects saved to file \\\"%s\\\" as \\\"%s\\\" and \\\"%s\\\".\\n\", \n\t   RESULT_FILE, FILE_PEDClassName, FILE_SIGClassName); \n  } \n  else {\n    printf(\"Could not save the object to file \\\"%s\\\".\\n\", \n\t   RESULT_FILE);\n  }\n\n  \/\/\n  \/\/ closing down; see if we can delete our analysis helper(s) also\n  \/\/\n  delete calibPedestal;\n  delete calibSignal;\n  for(Int_t iFile=0; iFile<kNRCU; iFile++) {\n    if (mapping[iFile]) delete mapping[iFile];\n  }\n\n  \/* store the result file on FES *\/\n#ifdef LOCAL_DEBUG\n#else\n  status = daqDA_FES_storeFile(RESULT_FILE, FILE_ID);\n#endif\n\n  return status;\n}\n<commit_msg>silvermy@ornl.gov - use Reset instead of a 2nd RawReader - thanks Cvetan<commit_after>\/*\n  EMCAL DA for online calibration: for LED studies\n  \n  Contact: silvermy@ornl.gov\n  Run Type: PHYSICS or STANDALONE\n  DA Type: MON \n  Number of events needed: continously accumulating for all runs, rate ~0.1-1 Hz\n  Input Files: argument list\n  Output Files: RESULT_FILE=EMCALLED.root, to be exported to the DAQ FXS\n  fileId:  FILE_ID=EMCALLED    \n  Trigger types used: CALIBRATION_EVENT (temporarily also PHYSICS_EVENT to start with)\n  [When we have real data files later, we should only use CALIBRATION_EVENT]\n*\/\n\/*\n  This process reads RAW data from the files provided as command line arguments\n  and save results (class itself) in a file (named from RESULT_FILE define - \n  see below).\n*\/\n\n#define RESULT_FILE  \"EMCALLED.root\"\n#define FILE_ID \"EMCALLED\"\n#define AliDebugLevel() -1\n#define FILE_PEDClassName \"emcCalibPedestal\"\n#define FILE_SIGClassName \"emcCalibSignal\"\nconst int kNRCU = 2;\n\/* LOCAL_DEBUG is used to bypass daq* calls that do not work locally *\/\n\/\/#define LOCAL_DEBUG 1 \/\/ comment out to run normally                                                            \nextern \"C\" {\n#include <daqDA.h>\n}\n#include \"event.h\" \/* in $DATE_COMMON_DEFS\/; includes definition of event types *\/\n#include \"monitor.h\" \/* in $DATE_MONITOR_DIR\/; monitor* interfaces *\/\n\n#include \"stdio.h\"\n#include \"stdlib.h\"\n\n\/\/ ROOT includes\n#include <TFile.h> \n#include <TROOT.h> \n#include <TPluginManager.h> \n#include <TSystem.h> \n\n\/\/\n\/\/AliRoot includes\n\/\/\n#include \"AliRawReader.h\"\n#include \"AliRawReaderDate.h\"\n#include \"AliRawEventHeaderBase.h\"\n#include \"AliCaloRawStream.h\"\n#include \"AliCaloAltroMapping.h\"\n#include \"AliLog.h\"\n\n\/\/\n\/\/ EMC calibration-helper algorithm includes\n\/\/\n#include \"AliCaloCalibPedestal.h\"\n#include \"AliCaloCalibSignal.h\"\n\n\/*\n  Main routine, EMC signal detector algorithm \n  Arguments: list of DATE raw data files\n*\/\n\nint main(int argc, char **argv) {\n\n  AliLog::SetClassDebugLevel(\"AliCaloRawStream\",-5);\n  AliLog::SetClassDebugLevel(\"AliRawReaderDate\",-5);\n  AliLog::SetModuleDebugLevel(\"RAW\",-5);\n\n  if (argc<2) {\n    printf(\"Wrong number of arguments\\n\");\n    return -1;  \n  }\n\n  \/* magic line - for TStreamerInfo *\/\n  gROOT->GetPluginManager()->AddHandler(\"TVirtualStreamerInfo\",\n\t\t\t\t\t\"*\",\n\t\t\t\t\t\"TStreamerInfo\",\n\t\t\t\t\t\"RIO\",\n\t\t\t\t\t\"TStreamerInfo()\"); \n\n  int i, status;\n\n  \/* log start of process *\/\n  printf(\"EMCAL DA started - %s\\n\",__FILE__);\n\n  \/* declare monitoring program *\/\n  status=monitorDeclareMp( __FILE__ );\n  if (status!=0) {\n    printf(\"monitorDeclareMp() failed : %s\\n\",monitorDecodeError(status));\n    return -1;\n  }\n  \/* define wait event timeout - 1s max *\/\n  monitorSetNowait();\n  monitorSetNoWaitNetworkTimeout(1000);\n\n  \/* Retrieve mapping files from DAQ DB *\/ \n  const char* mapFiles[kNRCU] = {\"RCU0.data\",\"RCU1.data\"};\n\n  for(Int_t iFile=0; iFile<kNRCU; iFile++) {\n    int failed = daqDA_DB_getFile(mapFiles[iFile], mapFiles[iFile]);\n    if(failed) { \n      printf(\"Cannot retrieve file %d : %s from DAQ DB. Exit now..\\n\",\n\t     iFile, mapFiles[iFile]);\n#ifdef LOCAL_DEBUG\n#else\n      return -1;\n#endif\n    }\n  }\n  \n  \/* Open mapping files *\/\n  AliCaloAltroMapping *mapping[kNRCU];\n  TString path = \".\/\";\n  path += \"RCU\";\n  TString path2;\n  for(Int_t i = 0; i < kNRCU; i++) {\n    path2 = path;\n    path2 += i;\n    path2 += \".data\";\n    mapping[i] = new AliCaloAltroMapping(path2.Data());\n  }\n  \n  \/* set up our analysis classes *\/  \n  AliCaloCalibPedestal * calibPedestal = new AliCaloCalibPedestal(AliCaloCalibPedestal::kEmCal); \n  calibPedestal->SetAltroMapping( mapping );\n  AliCaloCalibSignal * calibSignal = new AliCaloCalibSignal(AliCaloCalibSignal::kEmCal); \n  calibSignal->SetAltroMapping( mapping );\n\n  AliRawReader *rawReader = NULL;\n  int nevents=0;\n\n  \/* loop over RAW data files *\/\n  for ( i=1; i<argc; i++ ) {\n\n    \/* define data source : this is argument i *\/\n    printf(\"Processing file %s\\n\", argv[i]);\n    status=monitorSetDataSource( argv[i] );\n    if (status!=0) {\n      printf(\"monitorSetDataSource() failed. Error=%s. Exiting ...\\n\", monitorDecodeError(status));\n      return -1;\n    }\n\n    \/* read until EOF *\/\n    struct eventHeaderStruct *event;\n    eventTypeType eventT;\n\n    for ( ; ; ) { \/\/ infinite loop\n\n      \/* check shutdown condition *\/\n      if (daqDA_checkShutdown()) {break;}\n\n      \/* get next event (blocking call until timeout) *\/\n      status=monitorGetEventDynamic((void **)&event);\n      if (status==MON_ERR_EOF) {\n\tprintf (\"End of File %d (%s) detected\\n\", i, argv[i]);\n\tbreak; \/* end of monitoring file has been reached *\/\n      }\n      if (status!=0) {\n\tprintf(\"monitorGetEventDynamic() failed : %s\\n\",monitorDecodeError(status));\n\tbreak;\n      }\n\n      \/* retry if got no event *\/\n      if (event==NULL) {\n\tcontinue;\n      }\n      eventT = event->eventType; \/* just convenient shorthand *\/\n\n      \/* skip start\/end of run events *\/\n      if ( (eventT != physicsEvent) && (eventT != calibrationEvent) ) {\n\tcontinue;\n      }\n\n      nevents++; \/\/ count how many acceptable events we have\n\n      \/\/  Signal calibration\n      rawReader = new AliRawReaderDate((void*)event);\n      calibSignal->ProcessEvent(rawReader);\n      rawReader->Reset();\n      calibPedestal->ProcessEvent(rawReader);\n      delete rawReader;\n\n      \/* free resources *\/\n      free(event);    \n\n    } \/\/until EOF\n  } \/\/ loop over files\n\n  \/\/\n  \/\/ write class to rootfile\n  \/\/\n\n  printf (\"%d physics\/calibration events processed.\\n\",nevents);\n\n  TFile f(RESULT_FILE, \"recreate\");\n  if (!f.IsZombie()) { \n    f.cd();\n    calibPedestal->Write(FILE_PEDClassName);\n    calibSignal->Write(FILE_SIGClassName);\n    f.Close();\n    printf(\"Objects saved to file \\\"%s\\\" as \\\"%s\\\" and \\\"%s\\\".\\n\", \n\t   RESULT_FILE, FILE_PEDClassName, FILE_SIGClassName); \n  } \n  else {\n    printf(\"Could not save the object to file \\\"%s\\\".\\n\", \n\t   RESULT_FILE);\n  }\n\n  \/\/\n  \/\/ closing down; see if we can delete our analysis helper(s) also\n  \/\/\n  delete calibPedestal;\n  delete calibSignal;\n  for(Int_t iFile=0; iFile<kNRCU; iFile++) {\n    if (mapping[iFile]) delete mapping[iFile];\n  }\n\n  \/* store the result file on FES *\/\n#ifdef LOCAL_DEBUG\n#else\n  status = daqDA_FES_storeFile(RESULT_FILE, FILE_ID);\n#endif\n\n  return status;\n}\n<|endoftext|>"}
{"text":"<commit_before>758f514c-2d53-11e5-baeb-247703a38240<commit_msg>758fd07c-2d53-11e5-baeb-247703a38240<commit_after>758fd07c-2d53-11e5-baeb-247703a38240<|endoftext|>"}
{"text":"<commit_before>\n#include \"explode_chunk.hpp\"\n#include \"type_pun.hpp\"\n\n#include \"tbb\/parallel_for.h\"\n\n#include <vector>\n\nnamespace {\n\ninline bool is_usable_chunk_name(const Magic_number magic_number) noexcept\n{\n   constexpr auto safe_chars =\n      \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz\"_sv;\n\n   const auto string = view_pod_as_string(magic_number);\n\n   for (const auto& c : string) {\n      if (safe_chars.find(c) == safe_chars.npos) return false;\n   }\n\n   return true;\n}\n\ninline bool is_possible_parent(Ucfb_reader chunk)\n{\n   if (!is_usable_chunk_name(chunk.magic_number()) && chunk.size() == 0) return false;\n\n   return true;\n}\n\ninline bool is_possible_child(Ucfb_reader chunk)\n{\n   if (!is_usable_chunk_name(chunk.magic_number()) && chunk.size() <= 3) return false;\n\n   return true;\n}\n\ninline std::string get_chunk_name(const Ucfb_reader& chunk, const std::size_t index)\n{\n   std::string name;\n   name += std::to_string(index);\n\n   name += '_';\n\n   if (is_usable_chunk_name(chunk.magic_number())) {\n      name += view_pod_as_string(chunk.magic_number());\n   }\n   else {\n      name += serialize_magic_number(chunk.magic_number());\n   }\n\n   name += '_';\n\n   name += std::to_string(chunk.size());\n\n   return name;\n}\n\nvoid write_child_chunks(const std::vector<Ucfb_reader>& children, File_saver& file_saver)\n{\n   tbb::parallel_for(std::size_t{0u}, children.size(),\n                     [&](auto i) { explode_chunk(children[i], file_saver, i); });\n}\n\nvoid write_data_chunk(Ucfb_reader chunk, File_saver& file_saver, const std::size_t index)\n{\n   const auto name = get_chunk_name(chunk, index);\n\n   const auto data = chunk.read_array_unaligned<char>(chunk.size());\n\n   std::string buffer;\n   buffer.reserve(data.size() + 8);\n   buffer += view_pod_as_string(chunk.magic_number());\n   buffer += view_pod_as_string(static_cast<std::uint32_t>(chunk.size()));\n   buffer += view_pod_span_as_string(data);\n\n   file_saver.save_file(buffer, \"\", name, \".chunk\");\n}\n}\n\nvoid explode_chunk(Ucfb_reader chunk, File_saver& file_saver, const std::size_t index)\n{\n   if (!is_possible_parent(chunk)) return write_data_chunk(chunk, file_saver, index);\n\n   std::vector<Ucfb_reader> children;\n   children.reserve(32);\n\n   while (chunk) {\n      const auto child = chunk.read_child(std::nothrow);\n\n      if (!child || !is_possible_child(*child)) {\n         chunk.reset_head();\n\n         return write_data_chunk(chunk, file_saver, index);\n      }\n\n      children.emplace_back(*child);\n   }\n\n   const auto name = get_chunk_name(chunk, index);\n\n   auto nested_saver = file_saver.create_nested(name);\n\n   write_child_chunks(children, nested_saver);\n}<commit_msg>Adjusted naming for exploded chunks<commit_after>\n#include \"explode_chunk.hpp\"\n#include \"type_pun.hpp\"\n\n#include \"tbb\/parallel_for.h\"\n\n#include <vector>\n\nnamespace {\n\ninline bool is_usable_chunk_name(const Magic_number magic_number) noexcept\n{\n   constexpr auto safe_chars =\n      \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz\"_sv;\n\n   const auto string = view_pod_as_string(magic_number);\n\n   for (const auto& c : string) {\n      if (safe_chars.find(c) == safe_chars.npos) return false;\n   }\n\n   return true;\n}\n\ninline bool is_possible_parent(Ucfb_reader chunk)\n{\n   if (!is_usable_chunk_name(chunk.magic_number()) && chunk.size() == 0) return false;\n\n   return true;\n}\n\ninline bool is_possible_child(Ucfb_reader chunk)\n{\n   if (!is_usable_chunk_name(chunk.magic_number()) && chunk.size() <= 3) return false;\n\n   return true;\n}\n\ninline std::string get_chunk_name(const Ucfb_reader& chunk, const std::size_t index)\n{\n   std::string name;\n   name += std::to_string(index);\n\n   name += ' ';\n\n   if (is_usable_chunk_name(chunk.magic_number())) {\n      name += view_pod_as_string(chunk.magic_number());\n   }\n   else {\n      name += serialize_magic_number(chunk.magic_number());\n   }\n\n   name += ' ';\n\n   name += to_hexstring(chunk.size());\n\n   return name;\n}\n\nvoid write_child_chunks(const std::vector<Ucfb_reader>& children, File_saver& file_saver)\n{\n   tbb::parallel_for(std::size_t{0u}, children.size(),\n                     [&](auto i) { explode_chunk(children[i], file_saver, i); });\n}\n\nvoid write_data_chunk(Ucfb_reader chunk, File_saver& file_saver, const std::size_t index)\n{\n   const auto name = get_chunk_name(chunk, index);\n\n   const auto data = chunk.read_array_unaligned<char>(chunk.size());\n\n   std::string buffer;\n   buffer.reserve(data.size() + 8);\n   buffer += view_pod_as_string(chunk.magic_number());\n   buffer += view_pod_as_string(static_cast<std::uint32_t>(chunk.size()));\n   buffer += view_pod_span_as_string(data);\n\n   file_saver.save_file(buffer, \"\", name, \".chunk\");\n}\n}\n\nvoid explode_chunk(Ucfb_reader chunk, File_saver& file_saver, const std::size_t index)\n{\n   if (!is_possible_parent(chunk)) return write_data_chunk(chunk, file_saver, index);\n\n   std::vector<Ucfb_reader> children;\n   children.reserve(32);\n\n   while (chunk) {\n      const auto child = chunk.read_child(std::nothrow);\n\n      if (!child || !is_possible_child(*child)) {\n         chunk.reset_head();\n\n         return write_data_chunk(chunk, file_saver, index);\n      }\n\n      children.emplace_back(*child);\n   }\n\n   const auto name = get_chunk_name(chunk, index);\n\n   auto nested_saver = file_saver.create_nested(name);\n\n   write_child_chunks(children, nested_saver);\n}<|endoftext|>"}
{"text":"<commit_before>#ifndef __CINT__\n# include <TGFileDialog.h>\n# include <TGFileBrowser.h>\n# include <TControlBar.h>\n# include <TString.h>\n# include <TSystem.h>\n# include <TROOT.h>\n# include <TEveManager.h>\n# include <TSystemDirectory.h>\n# include <TEveMacro.h>\n# include <TEveBrowser.h>\n# include <TFolder.h>\n# include <TList.h>\n# include <TApplication.h>\n# include \"aliroot\/EVE\/EveBase\/AliEveEventManager.h\"\n# include <iostream>\n#endif\n\nclass Display\n{\npublic:\n  \/\/____________________________________________________________________\n  \/** Constructor \n      @param file File or directory to read data from *\/\n  Display(const char* file=\".\/\")\n    : fCb(0), \n      fEnableHits(kFALSE),\n      fEnableDigits(kFALSE),\n      fEnableRaw(kFALSE),\n      fEnableESD(kFALSE),\n      fHasHits(kFALSE),\n      fHasDigits(kFALSE),\n      fHasRaw(kFALSE),\n      fHasESD(kFALSE)\n  {\n    AliEveEventManager::SetCdbUri(\"local:\/\/$ALICE_ROOT\");\n    LoadMacros();\n    Setup(file, false);\n    SetupSelect();\n    SetupControl();\n  }\n  \/\/____________________________________________________________________\n  \/** Setup the control bar *\/\n  void SetupControl()\n  {\n    fCb = new TControlBar(\"vertical\", \"EVE Controls\");\n    const char* buts[] = { \"Load ...\", \n\t\t\t   \"Select ...\",\n\t\t\t   \"Next event\", \n\t\t\t   \"Previous event\", \n\t\t\t   \"Hits\", \n\t\t\t   \"Digits\", \n\t\t\t   \"Raw\", \n\t\t\t   \"ESD\", \n\t\t\t   \"Tracks\", \n\t\t\t   \"Quit\", \n\t\t\t   0 }; \n    const char* meths[] = { \"LoadFile\", \n\t\t\t    \"Select\",\n\t\t\t    \"NextEvent\", \n\t\t\t    \"PrevEvent\", \n\t\t\t    \"ToggleHits\", \n\t\t\t    \"ToggleDigits\", \n\t\t\t    \"ToggleRaw\", \n\t\t\t    \"ToggleESD\", \n\t\t\t    \"ToggleTracks\", \n\t\t\t    \"Quit\", \n\t\t\t    0 };\n    const char* hints[] = { \"Specify input\" , \n\t\t\t    \"Select which detectors to show\",\n\t\t\t    \"Get next event\", \n\t\t\t    \"Get previous event\", \n\t\t\t    \"Toggle display of hits\", \n\t\t\t    \"Toggle display of simulated digits\", \n\t\t\t    \"Toggle display of raw digits\", \n\t\t\t    \"Toggle display of event summary data\", \n\t\t\t    \"Toggle display of tracks\", \n\t\t\t    \"Quit\", \n\t\t\t    0 };\n\t\t\t    \n    char** but  = const_cast<char**>(buts);\n    char** meth = const_cast<char**>(meths);\n    char** hint = const_cast<char**>(hints);\n    while (*but) { \n      fCb->AddButton(*but, Form(\"Display::Instance()->%s()\", *meth), *hint);\n      but++;\n      meth++;\n      hint++;\n    }\n    fCb->Show();\n  }\n  \/\/____________________________________________________________________\n  \/** Setup the selection bar *\/\n  void SetupSelect()\n  {\n    fSelect = new TControlBar(\"vertical\", \"Detector selection\");\n    char* dets[] = { \"emcal\", \n\t\t     \"fmd\", \n\t\t     \"its\", \n\t\t     \"pmd\", \n\t\t     \"t0\", \n\t\t     \"tof\", \n\t\t     \"tpc\", \n\t\t     \"trd\", \n\t\t     \"vzero\",\n\t\t     \"kine\", \n\t\t     \"esd\",\n\t\t     0 };\n    char** det = dets;\n    while (*det) { \n      \/\/ TString cmd(Form(\"Display::Instance()->Enable(\\\"%s\\\")\", *det));\n      \/\/ TString help(Form(\"Enable display of %s data\", name.Data()));\n      fSelect->AddButton(*det, \n\t\t\t Form(\"Display::Instance()->Enable(\\\"%s\\\")\", *det),\n\t\t\t Form(\"Enable display of %s data\", *det));\n      det++;\n    }\n    std::cout << \"Adding \\\"Hide\\\" to select\" << std::endl;\n    fSelect->AddButton(\"Hide\", \"Display::Instance()->HideSelect()\", \n\t\t       \"Hide the detector selection menu\");\n  }\n  \/\/____________________________________________________________________\n  \/** Load macros used by EVE *\/\n  void LoadMacros()\n  {\n    std::cout << \"Loading macros ... \" << std::flush;\n    TString savdir(gSystem->pwd());\n    TString macdir(\"$(ALICE_ROOT)\/EVE\/alice-macros\");\n    gSystem->ExpandPathName(macdir);\n  \n    TFolder*          f     = gEve->GetMacroFolder();\n    TSystemDirectory* dir   = new TSystemDirectory(macdir.Data(), \n\t\t\t\t\t\t   macdir.Data());\n    TList*            files = dir->GetListOfFiles();\n    files->Sort();\n    TIter             next(files);\n    TSystemFile*      file  = 0;\n    while ((file = static_cast<TSystemFile*>(next()))) { \n      if (file->IsDirectory()) continue;\n      TString name(gSystem->ConcatFileName(macdir.Data(),file->GetName()));\n      if (!name.EndsWith(\".C\")) continue;\n      f->Add(new TEveMacro(name.Data()));\n    }\n    \n    gROOT->GetListOfBrowsables()->Add(dir);\n  \n    {\n      TEveBrowser*   b  = gEve->GetBrowser();\n      TGFileBrowser* fb = b->GetFileBrowser();\n      fb->GotoDir(macdir);\n      { \n\tb->StartEmbedding(0);\n\tfb = b->MakeFileBrowser();\n\tfb->BrowseObj(f);\n\tfb->Show();\n\tb->StopEmbedding(0);\n\tb->SetTabTitle(\"Macros\", 0);\n\tb->SetTab(0,0);\n      }\n    }\n    gSystem->cd(savdir);\n    std::cout << \"done\" << std::endl;\n  }\n  \/\/____________________________________________________________________\n  \/** Set-up load location, etc. \n      @param file File or directory to read data from \n      @param refresh Force a refresh *\/\n  void Setup(const char* file, bool refresh)\n  {\n    TString fileName(gSystem->BaseName(file));\n    TString dirName(gSystem->DirName(file));\n    \n    if (fileName.Contains(\"ESD\")) { \n      std::cout << \"Adding ESD file \" << fileName << std::endl;\n      AliEveEventManager::SetESDFileName(fileName.Data());\n    }\n    else if (fileName.EndsWith(\".root\") || fileName.EndsWith(\".raw\")) { \n      std::cout << \"Adding raw file \" << fileName << std::endl;\n      AliEveEventManager::SetRawFileName(fileName.Data());\n    }\n    else if (fileName.IsNull()) { \n      std::cout << \"No file given!\" << std::endl;\n      \/\/ std::cout << \"Adding raw directory \" << dirName.Data() << std::endl;\n      \/\/ AliEveEventManager::SetRawFileName(dirName.Data());\n    }\n    else {\n      std::cerr << \"Don't know how to deal with '\" << fileName << \"'\" \n\t\t<< std::endl;\n      return;\n    }\n    std::cout << \"Opening \" << fileName << \" (\" << dirName << \")\" << std::endl;\n    \n    if (AliEveEventManager::GetMaster()) delete AliEveEventManager::GetMaster();\n    TString eventName(\"Event\"); \/\/ CINT has trouble with direct \"Event\".\n    AliEveEventManager::GetMaster() = new AliEveEventManager(eventName, dirName, 0);\n    gEve->AddEvent(AliEveEventManager::GetMaster());\n    \n    if (refresh) Refresh();\n  }\n  \/\/____________________________________________________________________\n  \/** Executed in response to hitting the \"Load ...\" button. *\/\n  void \n  LoadFile()\n  {\n    fCb->SetButtonState(\"Load ...\", 1);\n    TGFileInfo fi;\n    fi.fIniDir = StrDup(gSystem->pwd());\n    new TGFileDialog(gClient->GetRoot(), gClient->GetRoot(), kFDOpen, &fi);\n    Setup(fi.fFilename, true);\n    fCb->SetButtonState(\"Load ...\", 0);\n  }\n  \/\/____________________________________________________________________\n  \/** Pop-up or down the selection menu *\/\n  void \n  Select()\n  {\n    fSelect->Show();\n    fCb->SetButtonState(\"Select ...\", 1);\n  }\n  \/\/____________________________________________________________________\n  \/** Enable a detector or type of display *\/\n  void \n  Enable(const char* what)\n  {\n    TObject* o = fEnabled.FindObject(what);\n    \/\/TString n(what);\n    \/\/ n.ToUpper();\n    std::cout << \"Enable \" << what << \"?\" << std::endl;\n    if (o) { \n      fEnabled.Remove(o);\n      fSelect->SetButtonState(what, 0);\n      delete o;\n    }\n    else { \n      fEnabled.Add(new TObjString(what));\n      fSelect->SetButtonState(what, 1);\n    }\n    Refresh();\n  }\n  \/\/____________________________________________________________________\n  \/** Pop-down the selection menu *\/\n  void \n  HideSelect()\n  {\n    fCb->SetButtonState(\"Select ...\", 0);\n    fSelect->Hide();\n  }\n  \/\/____________________________________________________________________\n  \/** Prepare for a new event *\/\n  void \n  Prepare()\n  {\n    fHasHits   = kFALSE;\n    fHasDigits = kFALSE;\n    fHasRaw    = kFALSE;\n    fHasESD    = kFALSE;\n    fHasTracks = kFALSE;\n  }\n  \/\/____________________________________________________________________\n  \/** Get the next event *\/\n  void \n  NextEvent()\n  {\n    Prepare();\n    std::cout << \"Getting next event, please wait ... \" << std::flush;\n    gROOT->Macro(\"event_next.C\");\n    std::cout << \"done\" << std::endl;\n    Refresh();\n  }\n  \/\/____________________________________________________________________\n  \/** Get the previous event *\/\n  void \n  PrevEvent()\n  {\n    Prepare();\n    std::cout << \"Getting previous event, please wait ... \" << std::flush;\n    gROOT->Macro(\"event_prev.C\"); \n    std::cout << \"done\" << std::endl;\n    Refresh();\n  }\n  \/\/____________________________________________________________________\n  \/** Reload the current event *\/\n  void\n  Reload()\n  {\n    Prepare();\n    Int_t event = AliEveEventManager::GetMaster()->GetEventId();\n    std::cout << \"Getting event \" << event \n\t      << \", please wait ... \" << std::flush;\n    gROOT->Macro(Form(\"event_goto.C(%d)\", event));\n    std::cout << \"done\" << std::endl;\n    Refresh();\n  }\n  \/\/__________________________________________________________________\n  \/** Refresh the display of something\n      @param enabled Whether this something is enabled or not \n      @param has     Whether we have already shown this data \n      @param what    What data to show *\/\n  void \n  RefreshOne(Bool_t enabled, Bool_t& has, const char* what)\n  {\n    if (!enabled || has) return;\n    std::cout << what << \"...\" << std::flush;\n    TIter next(&fEnabled);\n    TObject* o = 0;\n    while ((o = next())) { \n      TMacro* macro = gEve->GetMacro(Form(\"%s_%s\", o->GetName(), what));\n      if (macro) macro->Exec();\n    }\n    has = kTRUE;\n  }\n  \n  \/\/____________________________________________________________________\n  \/** Refresh the display of the data *\/\n  void \n  Refresh()\n  {\n    std::cout << \"Drawing ... \" << std::flush;\n    RefreshOne(fEnableTracks, fHasTracks, \"tracks\");\n    RefreshOne(fEnableHits,   fHasHits,   \"hits2\");\n    RefreshOne(fEnableDigits, fHasDigits, \"digits\");\n    RefreshOne(fEnableRaw,    fHasRaw,    \"raw\");\n    RefreshOne(fEnableESD,    fHasESD,    \"esd\");\n    std::cout << \"done\" << std::endl;\n  }\n  \/\/____________________________________________________________________\n  \/** Toggle the diplay of some data *\/\n  void \n  Toggle(Bool_t& what, const char* name)\n  {\n    what = !what;\n    fCb->SetButtonState(name, what ? 1 : 0);\n    if (!what) Reload();\n    Refresh();\n  }\n  \/\/____________________________________________________________________\n  \/** Toggle the diplay the simulated hits *\/\n  void ToggleHits() { Toggle(fEnableHits, \"Hits\"); } \n  \/\/____________________________________________________________________\n  \/** Toggle the diplay the simulated digits *\/\n  void ToggleDigits() { Toggle(fEnableDigits, \"Digits\"); }\n  \/\/____________________________________________________________________\n  \/** Toggle the diplay the raw digits *\/\n  void ToggleRaw() { Toggle(fEnableRaw, \"Raw\"); }\n  \/\/____________________________________________________________________\n  \/** Toggle the diplay the Event Summary Data *\/\n  void ToggleESD() { Toggle(fEnableESD, \"ESD\"); }\n  \/\/____________________________________________________________________\n  \/** Toggle the diplay of tracks *\/\n  void ToggleTracks() { Toggle(fEnableTracks, \"Tracks\"); }\n  \/\/____________________________________________________________________\n  \/** Pop-down both menues *\/\n  void Quit() \n  { \n    fCb->Hide();\n    fSelect->Hide();\n    fgInstance = 0;\n    delete this;\n  }\n  \/\/____________________________________________________________________\n  \/** Get the static instance *\/\n  static Display* Instance() { \n    if (!fgInstance) fgInstance = new Display();\n    return fgInstance;\n  }\nprotected:\n  TControlBar* fCb;       \/\/ Control bar\n  TControlBar* fSelect;   \/\/ Selection bar\n  Bool_t fEnableHits;     \/\/ Whether simulated hits are enabled \n  Bool_t fEnableDigits;   \/\/ Whether simulated digits are enabled \n  Bool_t fEnableRaw;      \/\/ Whehter raw data digits are enabled\n  Bool_t fEnableESD;      \/\/ Whehter Event Summary Data is enabled\n  Bool_t fEnableTracks;   \/\/ Whether tracks are shown\n  Bool_t fHasHits;        \/\/ Whether simulated hits are rendered\n  Bool_t fHasDigits;      \/\/ Whether simulated digits are rendered\n  Bool_t fHasRaw;         \/\/ Whether raw data digits are rendered\n  Bool_t fHasESD;         \/\/ Whether Event Summary Data is rendered\n  Bool_t fHasTracks;      \/\/ Whether tracks are rendered\n  TList  fEnabled;\n  static Display* fgInstance; \/\/ Static singleton instance \n};\nDisplay* Display::fgInstance = 0;\n\n\n\/\/____________________________________________________________________\nDisplay* display()\n{\n  TGeoManager::Import(\"geometry.root\");\n\n  Display* d = Display::Instance();\n  return d;\n\n}\n\/\/____________________________________________________________________\n\/\/\n\/\/ EOF\n\/\/\n<commit_msg>Fix to allow specifying initial file<commit_after>#ifndef __CINT__\n# include <TGFileDialog.h>\n# include <TGFileBrowser.h>\n# include <TControlBar.h>\n# include <TString.h>\n# include <TSystem.h>\n# include <TROOT.h>\n# include <TEveManager.h>\n# include <TSystemDirectory.h>\n# include <TEveMacro.h>\n# include <TEveBrowser.h>\n# include <TFolder.h>\n# include <TList.h>\n# include <TApplication.h>\n# include \"aliroot\/EVE\/EveBase\/AliEveEventManager.h\"\n# include <iostream>\n#endif\n\nclass Display\n{\npublic:\n  \/\/____________________________________________________________________\n  \/** Constructor \n      @param file File or directory to read data from *\/\n  Display(const char* file=\".\/\")\n    : fCb(0), \n      fEnableHits(kFALSE),\n      fEnableDigits(kFALSE),\n      fEnableRaw(kFALSE),\n      fEnableESD(kFALSE),\n      fHasHits(kFALSE),\n      fHasDigits(kFALSE),\n      fHasRaw(kFALSE),\n      fHasESD(kFALSE)\n  {\n    AliEveEventManager::SetCdbUri(\"local:\/\/$ALICE_ROOT\");\n    LoadMacros();\n    Setup(file, false);\n    SetupSelect();\n    SetupControl();\n  }\n  \/\/____________________________________________________________________\n  \/** Setup the control bar *\/\n  void SetupControl()\n  {\n    fCb = new TControlBar(\"vertical\", \"EVE Controls\");\n    const char* buts[] = { \"Load ...\", \n\t\t\t   \"Select ...\",\n\t\t\t   \"Next event\", \n\t\t\t   \"Previous event\", \n\t\t\t   \"Hits\", \n\t\t\t   \"Digits\", \n\t\t\t   \"Raw\", \n\t\t\t   \"ESD\", \n\t\t\t   \"Tracks\", \n\t\t\t   \"Quit\", \n\t\t\t   0 }; \n    const char* meths[] = { \"LoadFile\", \n\t\t\t    \"Select\",\n\t\t\t    \"NextEvent\", \n\t\t\t    \"PrevEvent\", \n\t\t\t    \"ToggleHits\", \n\t\t\t    \"ToggleDigits\", \n\t\t\t    \"ToggleRaw\", \n\t\t\t    \"ToggleESD\", \n\t\t\t    \"ToggleTracks\", \n\t\t\t    \"Quit\", \n\t\t\t    0 };\n    const char* hints[] = { \"Specify input\" , \n\t\t\t    \"Select which detectors to show\",\n\t\t\t    \"Get next event\", \n\t\t\t    \"Get previous event\", \n\t\t\t    \"Toggle display of hits\", \n\t\t\t    \"Toggle display of simulated digits\", \n\t\t\t    \"Toggle display of raw digits\", \n\t\t\t    \"Toggle display of event summary data\", \n\t\t\t    \"Toggle display of tracks\", \n\t\t\t    \"Quit\", \n\t\t\t    0 };\n\t\t\t    \n    char** but  = const_cast<char**>(buts);\n    char** meth = const_cast<char**>(meths);\n    char** hint = const_cast<char**>(hints);\n    while (*but) { \n      fCb->AddButton(*but, Form(\"Display::Instance()->%s()\", *meth), *hint);\n      but++;\n      meth++;\n      hint++;\n    }\n    fCb->Show();\n  }\n  \/\/____________________________________________________________________\n  \/** Setup the selection bar *\/\n  void SetupSelect()\n  {\n    fSelect = new TControlBar(\"vertical\", \"Detector selection\");\n    char* dets[] = { \"emcal\", \n\t\t     \"fmd\", \n\t\t     \"its\", \n\t\t     \"pmd\", \n\t\t     \"t0\", \n\t\t     \"tof\", \n\t\t     \"tpc\", \n\t\t     \"trd\", \n\t\t     \"vzero\",\n\t\t     \"kine\", \n\t\t     \"esd\",\n\t\t     0 };\n    char** det = dets;\n    while (*det) { \n      \/\/ TString cmd(Form(\"Display::Instance()->Enable(\\\"%s\\\")\", *det));\n      \/\/ TString help(Form(\"Enable display of %s data\", name.Data()));\n      fSelect->AddButton(*det, \n\t\t\t Form(\"Display::Instance()->Enable(\\\"%s\\\")\", *det),\n\t\t\t Form(\"Enable display of %s data\", *det));\n      det++;\n    }\n    std::cout << \"Adding \\\"Hide\\\" to select\" << std::endl;\n    fSelect->AddButton(\"Hide\", \"Display::Instance()->HideSelect()\", \n\t\t       \"Hide the detector selection menu\");\n  }\n  \/\/____________________________________________________________________\n  \/** Load macros used by EVE *\/\n  void LoadMacros()\n  {\n    std::cout << \"Loading macros ... \" << std::flush;\n    TString savdir(gSystem->pwd());\n    TString macdir(\"$(ALICE_ROOT)\/EVE\/alice-macros\");\n    gSystem->ExpandPathName(macdir);\n  \n    TFolder*          f     = gEve->GetMacroFolder();\n    TSystemDirectory* dir   = new TSystemDirectory(macdir.Data(), \n\t\t\t\t\t\t   macdir.Data());\n    TList*            files = dir->GetListOfFiles();\n    files->Sort();\n    TIter             next(files);\n    TSystemFile*      file  = 0;\n    while ((file = static_cast<TSystemFile*>(next()))) { \n      if (file->IsDirectory()) continue;\n      TString name(gSystem->ConcatFileName(macdir.Data(),file->GetName()));\n      if (!name.EndsWith(\".C\")) continue;\n      f->Add(new TEveMacro(name.Data()));\n    }\n    \n    gROOT->GetListOfBrowsables()->Add(dir);\n  \n    {\n      TEveBrowser*   b  = gEve->GetBrowser();\n      TGFileBrowser* fb = b->GetFileBrowser();\n      fb->GotoDir(macdir);\n      { \n\tb->StartEmbedding(0);\n\tfb = b->MakeFileBrowser();\n\tfb->BrowseObj(f);\n\tfb->Show();\n\tb->StopEmbedding(0);\n\tb->SetTabTitle(\"Macros\", 0);\n\tb->SetTab(0,0);\n      }\n    }\n    gSystem->cd(savdir);\n    std::cout << \"done\" << std::endl;\n  }\n  \/\/____________________________________________________________________\n  \/** Set-up load location, etc. \n      @param file File or directory to read data from \n      @param refresh Force a refresh *\/\n  void Setup(const char* file, bool refresh)\n  {\n    TString fileName(gSystem->BaseName(file));\n    TString dirName(gSystem->DirName(file));\n    \n    if (fileName.Contains(\"ESD\")) { \n      std::cout << \"Adding ESD file \" << fileName << std::endl;\n      AliEveEventManager::SetESDFileName(fileName.Data());\n    }\n    else if (fileName.EndsWith(\".root\") || fileName.EndsWith(\".raw\")) { \n      std::cout << \"Adding raw file \" << fileName << std::endl;\n      AliEveEventManager::SetRawFileName(fileName.Data());\n    }\n    else if (fileName.IsNull()) { \n      std::cout << \"No file given!\" << std::endl;\n      \/\/ std::cout << \"Adding raw directory \" << dirName.Data() << std::endl;\n      \/\/ AliEveEventManager::SetRawFileName(dirName.Data());\n    }\n    else {\n      std::cerr << \"Don't know how to deal with '\" << fileName << \"'\" \n\t\t<< std::endl;\n      return;\n    }\n    std::cout << \"Opening \" << fileName << \" (\" << dirName << \")\" << std::endl;\n    \n    if (AliEveEventManager::GetMaster()) delete AliEveEventManager::GetMaster();\n    TString eventName(\"Event\"); \/\/ CINT has trouble with direct \"Event\".\n    AliEveEventManager::GetMaster() = new AliEveEventManager(eventName, dirName, 0);\n    gEve->AddEvent(AliEveEventManager::GetMaster());\n    \n    if (refresh) Refresh();\n  }\n  \/\/____________________________________________________________________\n  \/** Executed in response to hitting the \"Load ...\" button. *\/\n  void \n  LoadFile()\n  {\n    fCb->SetButtonState(\"Load ...\", 1);\n    TGFileInfo fi;\n    fi.fIniDir = StrDup(gSystem->pwd());\n    new TGFileDialog(gClient->GetRoot(), gClient->GetRoot(), kFDOpen, &fi);\n    Setup(fi.fFilename, true);\n    fCb->SetButtonState(\"Load ...\", 0);\n  }\n  \/\/____________________________________________________________________\n  \/** Pop-up or down the selection menu *\/\n  void \n  Select()\n  {\n    fSelect->Show();\n    fCb->SetButtonState(\"Select ...\", 1);\n  }\n  \/\/____________________________________________________________________\n  \/** Enable a detector or type of display *\/\n  void \n  Enable(const char* what)\n  {\n    TObject* o = fEnabled.FindObject(what);\n    \/\/TString n(what);\n    \/\/ n.ToUpper();\n    std::cout << \"Enable \" << what << \"?\" << std::endl;\n    if (o) { \n      fEnabled.Remove(o);\n      fSelect->SetButtonState(what, 0);\n      delete o;\n    }\n    else { \n      fEnabled.Add(new TObjString(what));\n      fSelect->SetButtonState(what, 1);\n    }\n    Refresh();\n  }\n  \/\/____________________________________________________________________\n  \/** Pop-down the selection menu *\/\n  void \n  HideSelect()\n  {\n    fCb->SetButtonState(\"Select ...\", 0);\n    fSelect->Hide();\n  }\n  \/\/____________________________________________________________________\n  \/** Prepare for a new event *\/\n  void \n  Prepare()\n  {\n    fHasHits   = kFALSE;\n    fHasDigits = kFALSE;\n    fHasRaw    = kFALSE;\n    fHasESD    = kFALSE;\n    fHasTracks = kFALSE;\n  }\n  \/\/____________________________________________________________________\n  \/** Get the next event *\/\n  void \n  NextEvent()\n  {\n    Prepare();\n    std::cout << \"Getting next event, please wait ... \" << std::flush;\n    gROOT->Macro(\"event_next.C\");\n    std::cout << \"done\" << std::endl;\n    Refresh();\n  }\n  \/\/____________________________________________________________________\n  \/** Get the previous event *\/\n  void \n  PrevEvent()\n  {\n    Prepare();\n    std::cout << \"Getting previous event, please wait ... \" << std::flush;\n    gROOT->Macro(\"event_prev.C\"); \n    std::cout << \"done\" << std::endl;\n    Refresh();\n  }\n  \/\/____________________________________________________________________\n  \/** Reload the current event *\/\n  void\n  Reload()\n  {\n    Prepare();\n    Int_t event = AliEveEventManager::GetMaster()->GetEventId();\n    std::cout << \"Getting event \" << event \n\t      << \", please wait ... \" << std::flush;\n    gROOT->Macro(Form(\"event_goto.C(%d)\", event));\n    std::cout << \"done\" << std::endl;\n    Refresh();\n  }\n  \/\/__________________________________________________________________\n  \/** Refresh the display of something\n      @param enabled Whether this something is enabled or not \n      @param has     Whether we have already shown this data \n      @param what    What data to show *\/\n  void \n  RefreshOne(Bool_t enabled, Bool_t& has, const char* what)\n  {\n    if (!enabled || has) return;\n    std::cout << what << \"...\" << std::flush;\n    TIter next(&fEnabled);\n    TObject* o = 0;\n    while ((o = next())) { \n      TMacro* macro = gEve->GetMacro(Form(\"%s_%s\", o->GetName(), what));\n      if (macro) macro->Exec();\n    }\n    has = kTRUE;\n  }\n  \n  \/\/____________________________________________________________________\n  \/** Refresh the display of the data *\/\n  void \n  Refresh()\n  {\n    std::cout << \"Drawing ... \" << std::flush;\n    RefreshOne(fEnableTracks, fHasTracks, \"tracks\");\n    RefreshOne(fEnableHits,   fHasHits,   \"hits2\");\n    RefreshOne(fEnableDigits, fHasDigits, \"digits\");\n    RefreshOne(fEnableRaw,    fHasRaw,    \"raw\");\n    RefreshOne(fEnableESD,    fHasESD,    \"esd\");\n    std::cout << \"done\" << std::endl;\n  }\n  \/\/____________________________________________________________________\n  \/** Toggle the diplay of some data *\/\n  void \n  Toggle(Bool_t& what, const char* name)\n  {\n    what = !what;\n    fCb->SetButtonState(name, what ? 1 : 0);\n    if (!what) Reload();\n    Refresh();\n  }\n  \/\/____________________________________________________________________\n  \/** Toggle the diplay the simulated hits *\/\n  void ToggleHits() { Toggle(fEnableHits, \"Hits\"); } \n  \/\/____________________________________________________________________\n  \/** Toggle the diplay the simulated digits *\/\n  void ToggleDigits() { Toggle(fEnableDigits, \"Digits\"); }\n  \/\/____________________________________________________________________\n  \/** Toggle the diplay the raw digits *\/\n  void ToggleRaw() { Toggle(fEnableRaw, \"Raw\"); }\n  \/\/____________________________________________________________________\n  \/** Toggle the diplay the Event Summary Data *\/\n  void ToggleESD() { Toggle(fEnableESD, \"ESD\"); }\n  \/\/____________________________________________________________________\n  \/** Toggle the diplay of tracks *\/\n  void ToggleTracks() { Toggle(fEnableTracks, \"Tracks\"); }\n  \/\/____________________________________________________________________\n  \/** Pop-down both menues *\/\n  void Quit() \n  { \n    fCb->Hide();\n    fSelect->Hide();\n    fgInstance = 0;\n    delete this;\n  }\n  \/\/____________________________________________________________________\n  \/** Get the static instance *\/\n  static Display* Instance(const char* file=0) { \n    if (!fgInstance) fgInstance = new Display(file);\n    return fgInstance;\n  }\nprotected:\n  TControlBar* fCb;       \/\/ Control bar\n  TControlBar* fSelect;   \/\/ Selection bar\n  Bool_t fEnableHits;     \/\/ Whether simulated hits are enabled \n  Bool_t fEnableDigits;   \/\/ Whether simulated digits are enabled \n  Bool_t fEnableRaw;      \/\/ Whehter raw data digits are enabled\n  Bool_t fEnableESD;      \/\/ Whehter Event Summary Data is enabled\n  Bool_t fEnableTracks;   \/\/ Whether tracks are shown\n  Bool_t fHasHits;        \/\/ Whether simulated hits are rendered\n  Bool_t fHasDigits;      \/\/ Whether simulated digits are rendered\n  Bool_t fHasRaw;         \/\/ Whether raw data digits are rendered\n  Bool_t fHasESD;         \/\/ Whether Event Summary Data is rendered\n  Bool_t fHasTracks;      \/\/ Whether tracks are rendered\n  TList  fEnabled;\n  static Display* fgInstance; \/\/ Static singleton instance \n};\nDisplay* Display::fgInstance = 0;\n\n\n\/\/____________________________________________________________________\nDisplay* display(const char* file=\"\")\n{\n  \/\/ TGeoManager::Import(geom);\n\n  Display* d = Display::Instance(file);\n  return d;\n\n}\n\/\/____________________________________________________________________\n\/\/\n\/\/ EOF\n\/\/\n<|endoftext|>"}
{"text":"<commit_before>#include <event2\/listener.h>\n#include <event2\/bufferevent.h>\n#include <event2\/buffer.h>\n\n#include <arpa\/inet.h>\n\n#include <string.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <errno.h>\n#include \"Controller.h\"\n\n#include <sys\/types.h>\n#include <sys\/socket.h>\n#include <netinet\/tcp.h>\n\nusing namespace std;\n\nOpenFlow::Controller controller;\n\nstruct bufferevent *bev;\nstruct evbuffer *output;\n\nstatic void\ncontroller_read_cb(struct bufferevent *bev, void *ctx)\n{\n    unsigned char buf[BUFFER_SIZE];\n    struct evbuffer *input = bufferevent_get_input(bev);\n\n    ev_ssize_t len = BUFFER_SIZE;\n    do\n    {\n        uint32_t bytesInBuffer = evbuffer_copyout(input, &buf, len);\n        len = controller.getMessageLength(buf, len);\n\n        if(bytesInBuffer < len)\n        {\n            break;\n        }\n\n        if(len != 0)\n        {\n            len = evbuffer_remove(input, &buf, len);\n            controller.rxPacket(buf, len);\n        }\n    } while(len > 0 );\n}\n\nstatic void\ncontroller_event_cb(struct bufferevent *bev, short events, void *ctx)\n{    \n    if (events & BEV_EVENT_ERROR)\n    {\n            perror(\"Error from bufferevent\");\n    }\n    if (events & (BEV_EVENT_EOF | BEV_EVENT_ERROR))\n    {\n            bufferevent_free(bev);\n    }\n}\n\nstatic void\naccept_conn_cb(struct evconnlistener *listener,\n    evutil_socket_t fd, struct sockaddr *address, int socklen,\n    void *ctx)\n{\n    \/* We got a new connection! Set up a bufferevent for it. *\/\n    struct event_base *base = evconnlistener_get_base(listener);\n    bev = bufferevent_socket_new(\n\n            base, fd, BEV_OPT_CLOSE_ON_FREE );\n\n    \/\/BEV_OPT_THREADSAFE\n\n    bufferevent_setcb(bev, controller_read_cb, NULL, controller_event_cb, NULL);\n    output = evbuffer_new();\n    bufferevent_enable(bev, EV_READ|EV_WRITE);\n    controller.connectionHandler();\n\n\n\n}\n\nstatic void\naccept_error_cb(struct evconnlistener *listener, void *ctx)\n{\n    struct event_base *base = evconnlistener_get_base(listener);\n    int err = EVUTIL_SOCKET_ERROR();\n    fprintf(stderr, \"Got an error %d (%s) on the listener. \"\n            \"Shutting down.\\n\", err, evutil_socket_error_to_string(err));\n    \n    event_base_loopexit(base, NULL);\n}\n\nint txPacket(unsigned char *buf, ssize_t size) {\n    evbuffer_add(output, buf, size);\n    bufferevent_write(bev, buf, size);\n}\n\n\n#ifndef TESTMAIN\nint\nmain(int argc, char **argv)\n{\n    struct event_base *base;\n    struct evconnlistener *listener;\n    struct sockaddr_in sin;\n    \n    base = event_base_new();\n    if (!base)\n    {\n        puts(\"Couldn't open event base\");\n        return 1;\n    }\n    \n    \/* Clear the sockaddr before using it, in case there are extra\n    * platform-specific fields that can mess us up. *\/\n    memset(&sin, 0, sizeof(sin));\n    \/* This is an INET address *\/\n    sin.sin_family = AF_INET;\n    \/* Listen on 0.0.0.0 *\/\n    sin.sin_addr.s_addr = htonl(0);\n    \/* Listen on the given port. *\/\n    sin.sin_port = htons(LISTEN_PORT);\n    \n    listener = evconnlistener_new_bind(base, accept_conn_cb, NULL,\n    LEV_OPT_CLOSE_ON_FREE|LEV_OPT_REUSEABLE, -1,\n        (struct sockaddr*)&sin, sizeof(sin));\n    if (!listener)\n    {\n        perror(\"Couldn't create listener\");\n        return 1;\n    }\n    evconnlistener_set_error_cb(listener, accept_error_cb);\n    \n    event_base_dispatch(base);\n    return 0;\n}\n#endif\n<commit_msg>Fixing a use after free bug.<commit_after>#include <event2\/listener.h>\n#include <event2\/bufferevent.h>\n#include <event2\/buffer.h>\n\n#include <arpa\/inet.h>\n\n#include <string.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <errno.h>\n#include \"Controller.h\"\n\n#include <sys\/types.h>\n#include <sys\/socket.h>\n#include <netinet\/tcp.h>\n\nusing namespace std;\n\nOpenFlow::Controller controller;\n\nstruct bufferevent *bev;\nstruct evbuffer *output;\n\nstatic void\ncontroller_read_cb(struct bufferevent *bev, void *ctx)\n{\n    unsigned char buf[BUFFER_SIZE];\n    struct evbuffer *input = bufferevent_get_input(bev);\n\n    ev_ssize_t len = BUFFER_SIZE;\n    do\n    {\n        uint32_t bytesInBuffer = evbuffer_copyout(input, &buf, len);\n        len = controller.getMessageLength(buf, len);\n\n        if(bytesInBuffer < len)\n        {\n            break;\n        }\n\n        if(len != 0)\n        {\n            len = evbuffer_remove(input, &buf, len);\n            controller.rxPacket(buf, len);\n        }\n    } while(len > 0 );\n}\n\nstatic void\ncontroller_event_cb(struct bufferevent *bev, short events, void *ctx)\n{    \n    if (events & BEV_EVENT_ERROR)\n    {\n            perror(\"Error from bufferevent\");\n    }\n    if (events & (BEV_EVENT_EOF | BEV_EVENT_ERROR))\n    {\n            bufferevent_free(bev);\n    }\n}\n\nstatic void\naccept_conn_cb(struct evconnlistener *listener,\n    evutil_socket_t fd, struct sockaddr *address, int socklen,\n    void *ctx)\n{\n    \/* We got a new connection! Set up a bufferevent for it. *\/\n    struct event_base *base = evconnlistener_get_base(listener);\n    bev = bufferevent_socket_new(\n\n            base, fd, BEV_OPT_CLOSE_ON_FREE );\n\n    \/\/BEV_OPT_THREADSAFE\n\n    bufferevent_setcb(bev, controller_read_cb, NULL, controller_event_cb, NULL);\n    output = evbuffer_new();\n    bufferevent_enable(bev, EV_READ|EV_WRITE);\n    controller.connectionHandler();\n\n\n\n}\n\nstatic void\naccept_error_cb(struct evconnlistener *listener, void *ctx)\n{\n    struct event_base *base = evconnlistener_get_base(listener);\n    int err = EVUTIL_SOCKET_ERROR();\n    fprintf(stderr, \"Got an error %d (%s) on the listener. \"\n            \"Shutting down.\\n\", err, evutil_socket_error_to_string(err));\n    \n    event_base_loopexit(base, NULL);\n}\n\nint txPacket(unsigned char *buf, ssize_t size) {\n    evbuffer_add(output, buf, size);\n    bufferevent_write(bev, buf, size);\n    bufferevent_flush(bev, EV_WRITE, BEV_FLUSH);\n}\n\n\n#ifndef TESTMAIN\nint\nmain(int argc, char **argv)\n{\n    struct event_base *base;\n    struct evconnlistener *listener;\n    struct sockaddr_in sin;\n    \n    base = event_base_new();\n    if (!base)\n    {\n        puts(\"Couldn't open event base\");\n        return 1;\n    }\n    \n    \/* Clear the sockaddr before using it, in case there are extra\n    * platform-specific fields that can mess us up. *\/\n    memset(&sin, 0, sizeof(sin));\n    \/* This is an INET address *\/\n    sin.sin_family = AF_INET;\n    \/* Listen on 0.0.0.0 *\/\n    sin.sin_addr.s_addr = htonl(0);\n    \/* Listen on the given port. *\/\n    sin.sin_port = htons(LISTEN_PORT);\n    \n    listener = evconnlistener_new_bind(base, accept_conn_cb, NULL,\n    LEV_OPT_CLOSE_ON_FREE|LEV_OPT_REUSEABLE, -1,\n        (struct sockaddr*)&sin, sizeof(sin));\n    if (!listener)\n    {\n        perror(\"Couldn't create listener\");\n        return 1;\n    }\n    evconnlistener_set_error_cb(listener, accept_error_cb);\n    \n    event_base_dispatch(base);\n    return 0;\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>78206a54-2d53-11e5-baeb-247703a38240<commit_msg>7820e86c-2d53-11e5-baeb-247703a38240<commit_after>7820e86c-2d53-11e5-baeb-247703a38240<|endoftext|>"}
{"text":"<commit_before>6bcadc75-2e4f-11e5-80bd-28cfe91dbc4b<commit_msg>6bd27359-2e4f-11e5-82ef-28cfe91dbc4b<commit_after>6bd27359-2e4f-11e5-82ef-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>#include \"context.h\"\n#include \"renderer.h\"\n#include \"pmesh.h\"\n#include \"glm\/glm.hpp\"\n#include <unistd.h>\n\n#define width 1024\n#define height 768\n\nusing namespace std ;\n\nint main(int argc, char** argv)\n{\n    Renderer renderer;\n\tContext context(renderer);\n    if (!context.init(width, height, \"Jeu de voitures trop de ouf !!!\", 16))\n    {\n        cerr << \"Impossible d'initialiser le contexte OpenGL.\" << endl ;\n        return 0;\n    }\n\n    PMesh* obj = new PMesh();\n    obj->loadObject(\"suzanne.obj\");\n\n    Drawable drw;\n    drw.load(obj->getVertices(), obj->getIndices());\n\n    Shader shdr1(\"shaders\/vert.vert\", \"shaders\/couleur3D.frag\");\n    Shader shdr2(\"shaders\/gris.vert\", \"shaders\/couleur3D.frag\");\n\n    while (context.eventLoop())\n    {\n        context.clean();\n        drw.setShader(&shdr2);\n        renderer.draw(drw); \n        drw.setShader(&shdr1);\n        renderer.draw(drw, GL_LINE); \n        context.show();\n    }\n\n    return 0;\n}\n<commit_msg>initialisation du mesh gun avec la bonne rotation<commit_after>#include \"context.h\"\n#include \"renderer.h\"\n#include \"pmesh.h\"\n#include \"glm\/glm.hpp\"\n#include <unistd.h>\n\n#define width 1024\n#define height 768\n\nusing namespace std ;\n\nint main(int argc, char** argv)\n{\n    Renderer renderer;\n\tContext context(renderer);\n    if (!context.init(width, height, \"Jeu de voitures trop de ouf !!!\", 16))\n    {\n        cerr << \"Impossible d'initialiser le contexte OpenGL.\" << endl ;\n        return 0;\n    }\n\n    PMesh* obj = new PMesh();\n    obj->loadObject(\"gun.obj\");\n\n    Drawable drw;\n    drw.load(obj->getVertices(), obj->getIndices());\n\tdrw.rotate(glm::vec3(1,0,0), 90);\n\n    Shader shdr1(\"shaders\/vert.vert\", \"shaders\/couleur3D.frag\");\n    Shader shdr2(\"shaders\/gris.vert\", \"shaders\/couleur3D.frag\");\n\n    while (context.eventLoop())\n    {\n        context.clean();\n        drw.setShader(&shdr2);\n        renderer.draw(drw); \n        drw.setShader(&shdr1);\n        renderer.draw(drw, GL_LINE); \n        context.show();\n\t\tdrw.rotate(glm::vec3(0,1,0), 0.01);\n    }\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>f3869bcc-2e4e-11e5-9d9c-28cfe91dbc4b<commit_msg>f38ccce1-2e4e-11e5-88f7-28cfe91dbc4b<commit_after>f38ccce1-2e4e-11e5-88f7-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>bb57e187-2e4f-11e5-a42c-28cfe91dbc4b<commit_msg>bb639c07-2e4f-11e5-9286-28cfe91dbc4b<commit_after>bb639c07-2e4f-11e5-9286-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>6a651f26-5216-11e5-8cdd-6c40088e03e4<commit_msg>6a712318-5216-11e5-a616-6c40088e03e4<commit_after>6a712318-5216-11e5-a616-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>a85683b0-4b02-11e5-b7cf-28cfe9171a43<commit_msg>Fix that bug where things didn't work but now they should<commit_after>a865f1d9-4b02-11e5-aec1-28cfe9171a43<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include \"Engine.h\"\n\nint main()\n{\n    std::cout << \"start\\n\";\n\tEngine engine;\n\n\tfor (int i = 0; i < 10; i++)\n\t{\n\t\tstd::cout << \"cycle \" << i << \"\\n\";\n\t\tengine.update(i);\n\t}\n\t\n\tstd::cout << \"finished\\n\";\n\n    return 0;\n}<commit_msg>Add: remove node once move finished<commit_after>#include <iostream>\n#include \"Engine.h\"\n\nint main()\n{\n    std::cout << \"start\\n\";\n\tEngine engine;\n\n\tfor (int i = 0; i < 16; i++)\n\t{\n\t\tstd::cout << \"cycle \" << i << \"\\n\";\n\t\tengine.update(i);\n\t}\n\t\n\tstd::cout << \"finished\\n\";\n\n    return 0;\n}<|endoftext|>"}
{"text":"<commit_before>594feb6e-5216-11e5-aa33-6c40088e03e4<commit_msg>595677f4-5216-11e5-ae18-6c40088e03e4<commit_after>595677f4-5216-11e5-ae18-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>51f9458c-2d3d-11e5-b27b-c82a142b6f9b<commit_msg>52510842-2d3d-11e5-ad9e-c82a142b6f9b<commit_after>52510842-2d3d-11e5-ad9e-c82a142b6f9b<|endoftext|>"}
{"text":"<commit_before>954d9f00-2e4f-11e5-bd20-28cfe91dbc4b<commit_msg>95547487-2e4f-11e5-b60e-28cfe91dbc4b<commit_after>95547487-2e4f-11e5-b60e-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2006, 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\/\/ minidump_file_writer.cc: Minidump file writer implementation.\n\/\/\n\/\/ See minidump_file_writer.h for documentation.\n\n#include <fcntl.h>\n#include <limits.h>\n#include <stdio.h>\n#include <string.h>\n#include <unistd.h>\n\n#include \"client\/minidump_file_writer-inl.h\"\n#include \"common\/linux\/linux_libc_support.h\"\n#include \"common\/string_conversion.h\"\n#include \"third_party\/lss\/linux_syscall_support.h\"\n\nnamespace google_breakpad {\n\nconst MDRVA MinidumpFileWriter::kInvalidMDRVA = static_cast<MDRVA>(-1);\n\nMinidumpFileWriter::MinidumpFileWriter() : file_(-1), position_(0), size_(0) {\n}\n\nMinidumpFileWriter::~MinidumpFileWriter() {\n  Close();\n}\n\nbool MinidumpFileWriter::Open(const char *path) {\n  assert(file_ == -1);\n#if __linux__\n  file_ = sys_open(path, O_WRONLY | O_CREAT | O_EXCL, 0600);\n#else\n  file_ = open(path, O_WRONLY | O_CREAT | O_EXCL, 0600);\n#endif\n\n  return file_ != -1;\n}\n\nbool MinidumpFileWriter::Close() {\n  bool result = true;\n\n  if (file_ != -1) {\n    if (-1 == ftruncate(file_, position_)) {\n       return false;\n    }\n#if __linux__\n    result = (sys_close(file_) == 0);\n#else\n    result = (close(file_) == 0);\n#endif\n    file_ = -1;\n  }\n\n  return result;\n}\n\nbool MinidumpFileWriter::CopyStringToMDString(const wchar_t *str,\n                                              unsigned int length,\n                                              TypedMDRVA<MDString> *mdstring) {\n  bool result = true;\n  if (sizeof(wchar_t) == sizeof(u_int16_t)) {\n    \/\/ Shortcut if wchar_t is the same size as MDString's buffer\n    result = mdstring->Copy(str, mdstring->get()->length);\n  } else {\n    u_int16_t out[2];\n    int out_idx = 0;\n\n    \/\/ Copy the string character by character\n    while (length && result) {\n      UTF32ToUTF16Char(*str, out);\n      if (!out[0])\n        return false;\n\n      \/\/ Process one character at a time\n      --length;\n      ++str;\n\n      \/\/ Append the one or two UTF-16 characters.  The first one will be non-\n      \/\/ zero, but the second one may be zero, depending on the conversion from\n      \/\/ UTF-32.\n      int out_count = out[1] ? 2 : 1;\n      size_t out_size = sizeof(u_int16_t) * out_count;\n      result = mdstring->CopyIndexAfterObject(out_idx, out, out_size);\n      out_idx += out_count;\n    }\n  }\n  return result;\n}\n\nbool MinidumpFileWriter::CopyStringToMDString(const char *str,\n                                              unsigned int length,\n                                              TypedMDRVA<MDString> *mdstring) {\n  bool result = true;\n  u_int16_t out[2];\n  int out_idx = 0;\n\n  \/\/ Copy the string character by character\n  while (length && result) {\n    int conversion_count = UTF8ToUTF16Char(str, length, out);\n    if (!conversion_count)\n      return false;\n\n    \/\/ Move the pointer along based on the nubmer of converted characters\n    length -= conversion_count;\n    str += conversion_count;\n\n    \/\/ Append the one or two UTF-16 characters\n    int out_count = out[1] ? 2 : 1;\n    size_t out_size = sizeof(u_int16_t) * out_count;\n    result = mdstring->CopyIndexAfterObject(out_idx, out, out_size);\n    out_idx += out_count;\n  }\n  return result;\n}\n\ntemplate <typename CharType>\nbool MinidumpFileWriter::WriteStringCore(const CharType *str,\n                                         unsigned int length,\n                                         MDLocationDescriptor *location) {\n  assert(str);\n  assert(location);\n  \/\/ Calculate the mdstring length by either limiting to |length| as passed in\n  \/\/ or by finding the location of the NULL character.\n  unsigned int mdstring_length = 0;\n  if (!length)\n    length = INT_MAX;\n  for (; mdstring_length < length && str[mdstring_length]; ++mdstring_length)\n    ;\n\n  \/\/ Allocate the string buffer\n  TypedMDRVA<MDString> mdstring(this);\n  if (!mdstring.AllocateObjectAndArray(mdstring_length + 1, sizeof(u_int16_t)))\n    return false;\n\n  \/\/ Set length excluding the NULL and copy the string\n  mdstring.get()->length =\n      static_cast<u_int32_t>(mdstring_length * sizeof(u_int16_t));\n  bool result = CopyStringToMDString(str, mdstring_length, &mdstring);\n\n  \/\/ NULL terminate\n  if (result) {\n    u_int16_t ch = 0;\n    result = mdstring.CopyIndexAfterObject(mdstring_length, &ch, sizeof(ch));\n\n    if (result)\n      *location = mdstring.location();\n  }\n\n  return result;\n}\n\nbool MinidumpFileWriter::WriteString(const wchar_t *str, unsigned int length,\n                 MDLocationDescriptor *location) {\n  return WriteStringCore(str, length, location);\n}\n\nbool MinidumpFileWriter::WriteString(const char *str, unsigned int length,\n                 MDLocationDescriptor *location) {\n  return WriteStringCore(str, length, location);\n}\n\nbool MinidumpFileWriter::WriteMemory(const void *src, size_t size,\n                                     MDMemoryDescriptor *output) {\n  assert(src);\n  assert(output);\n  UntypedMDRVA mem(this);\n\n  if (!mem.Allocate(size))\n    return false;\n  if (!mem.Copy(src, mem.size()))\n    return false;\n\n  output->start_of_memory_range = reinterpret_cast<u_int64_t>(src);\n  output->memory = mem.location();\n\n  return true;\n}\n\nMDRVA MinidumpFileWriter::Allocate(size_t size) {\n  assert(size);\n  assert(file_ != -1);\n  size_t aligned_size = (size + 7) & ~7;  \/\/ 64-bit alignment\n\n  if (position_ + aligned_size > size_) {\n    size_t growth = aligned_size;\n    size_t minimal_growth = getpagesize();\n\n    \/\/ Ensure that the file grows by at least the size of a memory page\n    if (growth < minimal_growth)\n      growth = minimal_growth;\n\n    size_t new_size = size_ + growth;\n    if (ftruncate(file_, new_size) != 0)\n      return kInvalidMDRVA;\n\n    size_ = new_size;\n  }\n\n  MDRVA current_position = position_;\n  position_ += static_cast<MDRVA>(aligned_size);\n\n  return current_position;\n}\n\nbool MinidumpFileWriter::Copy(MDRVA position, const void *src, ssize_t size) {\n  assert(src);\n  assert(size);\n  assert(file_ != -1);\n\n  \/\/ Ensure that the data will fit in the allocated space\n  if (static_cast<size_t>(size + position) > size_)\n    return false;\n\n  \/\/ Seek and write the data\n#if __linux__\n  if (sys_lseek(file_, position, SEEK_SET) == static_cast<off_t>(position)) {\n    if (sys_write(file_, src, size) == size) {\n#else\n  if (lseek(file_, position, SEEK_SET) == static_cast<off_t>(position)) {\n    if (write(file_, src, size) == size) {\n#endif\n      return true;\n    }\n  }\n\n  return false;\n}\n\nbool UntypedMDRVA::Allocate(size_t size) {\n  assert(size_ == 0);\n  size_ = size;\n  position_ = writer_->Allocate(size_);\n  return position_ != MinidumpFileWriter::kInvalidMDRVA;\n}\n\nbool UntypedMDRVA::Copy(MDRVA pos, const void *src, size_t size) {\n  assert(src);\n  assert(size);\n  assert(pos + size <= position_ + size_);\n  return writer_->Copy(pos, src, size);\n}\n\n}  \/\/ namespace google_breakpad\n<commit_msg>Only include linux_syscall_support.h on Linux in cross platform files.<commit_after>\/\/ Copyright (c) 2006, 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\/\/ minidump_file_writer.cc: Minidump file writer implementation.\n\/\/\n\/\/ See minidump_file_writer.h for documentation.\n\n#include <fcntl.h>\n#include <limits.h>\n#include <stdio.h>\n#include <string.h>\n#include <unistd.h>\n\n#include \"client\/minidump_file_writer-inl.h\"\n#include \"common\/linux\/linux_libc_support.h\"\n#include \"common\/string_conversion.h\"\n#if __linux__\n#include \"third_party\/lss\/linux_syscall_support.h\"\n#endif\n\nnamespace google_breakpad {\n\nconst MDRVA MinidumpFileWriter::kInvalidMDRVA = static_cast<MDRVA>(-1);\n\nMinidumpFileWriter::MinidumpFileWriter() : file_(-1), position_(0), size_(0) {\n}\n\nMinidumpFileWriter::~MinidumpFileWriter() {\n  Close();\n}\n\nbool MinidumpFileWriter::Open(const char *path) {\n  assert(file_ == -1);\n#if __linux__\n  file_ = sys_open(path, O_WRONLY | O_CREAT | O_EXCL, 0600);\n#else\n  file_ = open(path, O_WRONLY | O_CREAT | O_EXCL, 0600);\n#endif\n\n  return file_ != -1;\n}\n\nbool MinidumpFileWriter::Close() {\n  bool result = true;\n\n  if (file_ != -1) {\n    if (-1 == ftruncate(file_, position_)) {\n       return false;\n    }\n#if __linux__\n    result = (sys_close(file_) == 0);\n#else\n    result = (close(file_) == 0);\n#endif\n    file_ = -1;\n  }\n\n  return result;\n}\n\nbool MinidumpFileWriter::CopyStringToMDString(const wchar_t *str,\n                                              unsigned int length,\n                                              TypedMDRVA<MDString> *mdstring) {\n  bool result = true;\n  if (sizeof(wchar_t) == sizeof(u_int16_t)) {\n    \/\/ Shortcut if wchar_t is the same size as MDString's buffer\n    result = mdstring->Copy(str, mdstring->get()->length);\n  } else {\n    u_int16_t out[2];\n    int out_idx = 0;\n\n    \/\/ Copy the string character by character\n    while (length && result) {\n      UTF32ToUTF16Char(*str, out);\n      if (!out[0])\n        return false;\n\n      \/\/ Process one character at a time\n      --length;\n      ++str;\n\n      \/\/ Append the one or two UTF-16 characters.  The first one will be non-\n      \/\/ zero, but the second one may be zero, depending on the conversion from\n      \/\/ UTF-32.\n      int out_count = out[1] ? 2 : 1;\n      size_t out_size = sizeof(u_int16_t) * out_count;\n      result = mdstring->CopyIndexAfterObject(out_idx, out, out_size);\n      out_idx += out_count;\n    }\n  }\n  return result;\n}\n\nbool MinidumpFileWriter::CopyStringToMDString(const char *str,\n                                              unsigned int length,\n                                              TypedMDRVA<MDString> *mdstring) {\n  bool result = true;\n  u_int16_t out[2];\n  int out_idx = 0;\n\n  \/\/ Copy the string character by character\n  while (length && result) {\n    int conversion_count = UTF8ToUTF16Char(str, length, out);\n    if (!conversion_count)\n      return false;\n\n    \/\/ Move the pointer along based on the nubmer of converted characters\n    length -= conversion_count;\n    str += conversion_count;\n\n    \/\/ Append the one or two UTF-16 characters\n    int out_count = out[1] ? 2 : 1;\n    size_t out_size = sizeof(u_int16_t) * out_count;\n    result = mdstring->CopyIndexAfterObject(out_idx, out, out_size);\n    out_idx += out_count;\n  }\n  return result;\n}\n\ntemplate <typename CharType>\nbool MinidumpFileWriter::WriteStringCore(const CharType *str,\n                                         unsigned int length,\n                                         MDLocationDescriptor *location) {\n  assert(str);\n  assert(location);\n  \/\/ Calculate the mdstring length by either limiting to |length| as passed in\n  \/\/ or by finding the location of the NULL character.\n  unsigned int mdstring_length = 0;\n  if (!length)\n    length = INT_MAX;\n  for (; mdstring_length < length && str[mdstring_length]; ++mdstring_length)\n    ;\n\n  \/\/ Allocate the string buffer\n  TypedMDRVA<MDString> mdstring(this);\n  if (!mdstring.AllocateObjectAndArray(mdstring_length + 1, sizeof(u_int16_t)))\n    return false;\n\n  \/\/ Set length excluding the NULL and copy the string\n  mdstring.get()->length =\n      static_cast<u_int32_t>(mdstring_length * sizeof(u_int16_t));\n  bool result = CopyStringToMDString(str, mdstring_length, &mdstring);\n\n  \/\/ NULL terminate\n  if (result) {\n    u_int16_t ch = 0;\n    result = mdstring.CopyIndexAfterObject(mdstring_length, &ch, sizeof(ch));\n\n    if (result)\n      *location = mdstring.location();\n  }\n\n  return result;\n}\n\nbool MinidumpFileWriter::WriteString(const wchar_t *str, unsigned int length,\n                 MDLocationDescriptor *location) {\n  return WriteStringCore(str, length, location);\n}\n\nbool MinidumpFileWriter::WriteString(const char *str, unsigned int length,\n                 MDLocationDescriptor *location) {\n  return WriteStringCore(str, length, location);\n}\n\nbool MinidumpFileWriter::WriteMemory(const void *src, size_t size,\n                                     MDMemoryDescriptor *output) {\n  assert(src);\n  assert(output);\n  UntypedMDRVA mem(this);\n\n  if (!mem.Allocate(size))\n    return false;\n  if (!mem.Copy(src, mem.size()))\n    return false;\n\n  output->start_of_memory_range = reinterpret_cast<u_int64_t>(src);\n  output->memory = mem.location();\n\n  return true;\n}\n\nMDRVA MinidumpFileWriter::Allocate(size_t size) {\n  assert(size);\n  assert(file_ != -1);\n  size_t aligned_size = (size + 7) & ~7;  \/\/ 64-bit alignment\n\n  if (position_ + aligned_size > size_) {\n    size_t growth = aligned_size;\n    size_t minimal_growth = getpagesize();\n\n    \/\/ Ensure that the file grows by at least the size of a memory page\n    if (growth < minimal_growth)\n      growth = minimal_growth;\n\n    size_t new_size = size_ + growth;\n    if (ftruncate(file_, new_size) != 0)\n      return kInvalidMDRVA;\n\n    size_ = new_size;\n  }\n\n  MDRVA current_position = position_;\n  position_ += static_cast<MDRVA>(aligned_size);\n\n  return current_position;\n}\n\nbool MinidumpFileWriter::Copy(MDRVA position, const void *src, ssize_t size) {\n  assert(src);\n  assert(size);\n  assert(file_ != -1);\n\n  \/\/ Ensure that the data will fit in the allocated space\n  if (static_cast<size_t>(size + position) > size_)\n    return false;\n\n  \/\/ Seek and write the data\n#if __linux__\n  if (sys_lseek(file_, position, SEEK_SET) == static_cast<off_t>(position)) {\n    if (sys_write(file_, src, size) == size) {\n#else\n  if (lseek(file_, position, SEEK_SET) == static_cast<off_t>(position)) {\n    if (write(file_, src, size) == size) {\n#endif\n      return true;\n    }\n  }\n\n  return false;\n}\n\nbool UntypedMDRVA::Allocate(size_t size) {\n  assert(size_ == 0);\n  size_ = size;\n  position_ = writer_->Allocate(size_);\n  return position_ != MinidumpFileWriter::kInvalidMDRVA;\n}\n\nbool UntypedMDRVA::Copy(MDRVA pos, const void *src, size_t size) {\n  assert(src);\n  assert(size);\n  assert(pos + size <= position_ + size_);\n  return writer_->Copy(pos, src, size);\n}\n\n}  \/\/ namespace google_breakpad\n<|endoftext|>"}
{"text":"<commit_before>9a678348-35ca-11e5-8794-6c40088e03e4<commit_msg>9a6e403e-35ca-11e5-9e22-6c40088e03e4<commit_after>9a6e403e-35ca-11e5-9e22-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>#include <unistd.h>\n#include <getopt.h>\n#include <stdlib.h>\n#include <signal.h>\n#include \"znc.h\"\n#include \"Modules.h\"\n#include \"md5.h\"\n\nstatic struct option g_LongOpts[] = {\n\t{ \"help\",\t\t\t\t0,\tNULL,\t0 },\n\t{ \"version\",\t\t\t0,\tNULL,\t0 },\n\t{ \"makepass\",\t\t\t0,\tNULL,\t0 },\n#ifdef HAVE_LIBSSL\n\t{ \"makepem\",\t\t\t0,\tNULL,\t0 },\n\t{ \"encrypt-pem\",\t\t0,\tNULL, \t0 },\n#endif \/* HAVE_LIBSSL *\/\n\t{ NULL }\n};\n\nvoid GenerateHelp(const char *appname) {\n\tCUtils::PrintMessage(\"USAGE: \" + string(appname) + \" [options] [config]\");\n\tCUtils::PrintMessage(\"Options are:\");\n\tCUtils::PrintMessage(\"\\t--help\");\n\tCUtils::PrintMessage(\"\\t--version       Output version information and exit\");\n\tCUtils::PrintMessage(\"\\t--makepass      Generates a password for use in config\");\n#ifdef HAVE_LIBSSL\n\tCUtils::PrintMessage(\"\\t--makepem       Generates a pemfile for use with SSL\");\n\tCUtils::PrintMessage(\"\\t--encrypt-pem   Encrypts the pemfile\");\n#endif \/* HAVE_LIBSSL *\/\n}\n\nvoid die(int sig) {\n\tsignal(SIGSEGV, SIG_DFL);\n\tsignal(SIGABRT, SIG_DFL);\n\tsignal(SIGPIPE, SIG_DFL);\n\n#ifdef _DEBUG\n\tCUtils::PrintMessage(\"Exiting on SIG [\" + CUtils::ToString(sig) + \"]\");\n\tif ((sig == SIGABRT) || (sig == SIGSEGV)) {\n\t\tabort();\n\t}\n#endif \/* _DEBUG *\/\n\n\tdelete CZNC::New();\n\texit(sig);\n}\n\nint main(int argc, char** argv) {\n\tstring sConfig;\n\n#ifdef HAVE_LIBSSL\n\t\/\/ initialize ssl, allow client to have compression enabled if desired\n\tInitSSL(CT_ZLIB);\n#endif \/* HAVE_LIBSSL *\/\n\n\tint iArg, iOptIndex = -1;\n#ifdef HAVE_LIBSSL\n\tbool bMakePem = false;\n\tbool bEncPem = false;\n#endif \/* HAVE_LIBSSL *\/\n\tbool bMakePass = false;\n\twhile ((iArg = getopt_long(argc, argv, \"h\", g_LongOpts, &iOptIndex) != -1)) {\n\t\tswitch (iArg) {\n\t\t\tcase 1: { \/\/ long options\n\t\t\t\tif (iOptIndex >= 0) {\n\t\t\t\t\tstring sOption = Lower(g_LongOpts[iOptIndex].name);\n\t\t\t\t\tif (sOption == \"version\") {\n\t\t\t\t\t\tprintf(\"ZNC %1.3f - by prozac@gmail.com\\n\", VERSION);\n\t\t\t\t\t\treturn 0;\n\t\t\t\t\t} else if (sOption == \"makepass\") {\n\t\t\t\t\t\tbMakePass = true;\n#ifdef HAVE_LIBSSL\n\t\t\t\t\t} else if (sOption == \"makepem\") {\n\t\t\t\t\t\tbMakePem = true;\n\t\t\t\t\t} else if (sOption == \"encrypt-pem\") {\n\t\t\t\t\t\tbEncPem = true;\n#endif \/* HAVE_LIBSSL *\/\n\t\t\t\t\t} else if (sOption == \"help\") {\n\t\t\t\t\t\tGenerateHelp(argv[0]);\n\t\t\t\t\t\treturn 0;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tGenerateHelp(argv[0]);\n\t\t\t\t\treturn 1;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase 'h':\n\t\t\t\tGenerateHelp(argv[0]);\n\t\t\t\treturn 0;\n\t\t\tdefault: {\n\t\t\t\tGenerateHelp(argv[0]);\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (optind < argc) {\n\t\tsConfig = argv[optind];\n\t}\n\n#ifdef HAVE_LIBSSL\n\tif (bMakePem) {\n\t\tCZNC* pZNC = CZNC::New();\n\t\tpZNC->InitDirs(\"\");\n\t\tstring sPemFile = pZNC->GetPemLocation();\n\n\t\tCUtils::PrintAction(\"Writing Pem file [\" + sPemFile + \"]\");\n\n\t\tif (CFile::Exists(sPemFile)) {\n\t\t\tCUtils::PrintStatus(false, \"File already exists\");\n\t\t\tdelete pZNC;\n\t\t\treturn 1;\n\t\t}\n\n\t\tFILE *f = fopen(sPemFile.c_str(), \"w\");\n\n\t\tif (!f) {\n\t\t\tCUtils::PrintStatus(false, \"Unable to open\");\n\t\t\tdelete pZNC;\n\t\t\treturn 1 ;\n\t\t}\n\n\t\tCUtils::GenerateCert(f, bEncPem);\n\t\tfclose(f);\n\n\t\tCUtils::PrintStatus(true);\n\n\t\tdelete pZNC;\n\t\treturn 0;\n\t}\n#endif \/* HAVE_LIBSSL *\/\n\tif (bMakePass) {\n\t\tstring sHash = CUtils::GetHashPass();\n\t\tCUtils::PrintMessage(\"Use this in the <User> section of your config:\");\n\t\tCUtils::PrintMessage(\"Pass = \" + sHash + \" -\");\n\n\t\treturn 0;\n\t}\n\n\tCZNC* pZNC = CZNC::New();\n\tpZNC->InitDirs(((argc) ? argv[0] : \"\"));\n\n\tif (!pZNC->ParseConfig(sConfig)) {\n\t\tCUtils::PrintError(\"Unrecoverable config error.\");\n\t\tdelete pZNC;\n\t\treturn 1;\n\t}\n\n\tif (!pZNC->GetListenPort()) {\n\t\tCUtils::PrintError(\"You must supply a ListenPort in your config.\");\n\t\tdelete pZNC;\n\t\treturn 1;\n\t}\n\n\tif (!pZNC->OnBoot()) {\n\t\tCUtils::PrintError(\"Exiting due to module boot errors.\");\n\t\tdelete pZNC;\n\t\treturn 1;\n\t}\n\n#ifndef _DEBUG\n\tCUtils::PrintAction(\"Forking into the background\");\n\n\tint iPid = fork();\n\n\tif (iPid == -1) {\n\t\tCUtils::PrintStatus(false, strerror(errno));\n\t\tdelete pZNC;\n\t\texit(1);\n\t}\n\n\tif (iPid > 0) {\n\t\tCUtils::PrintStatus(true, \"[pid: \" + CUtils::ToString(iPid) + \"]\");\n\n\t\tpZNC->WritePidFile(iPid);\n\t\tCUtils::PrintMessage(\"ZNC - by prozac@gmail.com\");\n\t\texit(0);\n\t}\n\n\t\/\/ Redirect std in\/out\/err to \/dev\/null\n\tclose(0); open(\"\/dev\/null\", O_RDONLY);\n\tclose(1); open(\"\/dev\/null\", O_WRONLY);\n\tclose(2); open(\"\/dev\/null\", O_WRONLY);\n\n#endif\n\n\tstruct sigaction sa;\n\tsa.sa_flags = 0;\n\tsigemptyset(&sa.sa_mask);\n\n\tsa.sa_handler = SIG_IGN;\n\tsigaction(SIGPIPE, &sa, (struct sigaction *)NULL);\n\n\tsa.sa_handler = die;\n\tsigaction(SIGINT,  &sa, (struct sigaction *)NULL);\n\tsigaction(SIGILL,  &sa, (struct sigaction *)NULL);\n\tsigaction(SIGQUIT, &sa, (struct sigaction *)NULL);\n\tsigaction(SIGBUS,  &sa, (struct sigaction *)NULL);\n\tsigaction(SIGSEGV, &sa, (struct sigaction *)NULL);\n\tsigaction(SIGTERM, &sa, (struct sigaction *)NULL);\n\n\tint iRet = 0;\n\n\ttry {\n\t\tiRet = pZNC->Loop();\n\t} catch (CException e) {\n\t\t\/\/ EX_Shutdown is thrown to exit\n\t\tswitch (e.GetType()) {\n\t\t\tcase CException::EX_Shutdown:\n\t\t\t\tiRet = 0;\n\t\t\tdefault:\n\t\t\t\tiRet = 1;\n\t\t}\n\t}\n\n\tdelete pZNC;\n\n\treturn iRet;\n}\n<commit_msg>Changed to using CZNC::GetTag()<commit_after>#include <unistd.h>\n#include <getopt.h>\n#include <stdlib.h>\n#include <signal.h>\n#include \"znc.h\"\n#include \"Modules.h\"\n#include \"md5.h\"\n\nstatic struct option g_LongOpts[] = {\n\t{ \"help\",\t\t\t\t0,\tNULL,\t0 },\n\t{ \"version\",\t\t\t0,\tNULL,\t0 },\n\t{ \"makepass\",\t\t\t0,\tNULL,\t0 },\n#ifdef HAVE_LIBSSL\n\t{ \"makepem\",\t\t\t0,\tNULL,\t0 },\n\t{ \"encrypt-pem\",\t\t0,\tNULL, \t0 },\n#endif \/* HAVE_LIBSSL *\/\n\t{ NULL }\n};\n\nvoid GenerateHelp(const char *appname) {\n\tCUtils::PrintMessage(\"USAGE: \" + string(appname) + \" [options] [config]\");\n\tCUtils::PrintMessage(\"Options are:\");\n\tCUtils::PrintMessage(\"\\t--help\");\n\tCUtils::PrintMessage(\"\\t--version       Output version information and exit\");\n\tCUtils::PrintMessage(\"\\t--makepass      Generates a password for use in config\");\n#ifdef HAVE_LIBSSL\n\tCUtils::PrintMessage(\"\\t--makepem       Generates a pemfile for use with SSL\");\n\tCUtils::PrintMessage(\"\\t--encrypt-pem   Encrypts the pemfile\");\n#endif \/* HAVE_LIBSSL *\/\n}\n\nvoid die(int sig) {\n\tsignal(SIGSEGV, SIG_DFL);\n\tsignal(SIGABRT, SIG_DFL);\n\tsignal(SIGPIPE, SIG_DFL);\n\n#ifdef _DEBUG\n\tCUtils::PrintMessage(\"Exiting on SIG [\" + CUtils::ToString(sig) + \"]\");\n\tif ((sig == SIGABRT) || (sig == SIGSEGV)) {\n\t\tabort();\n\t}\n#endif \/* _DEBUG *\/\n\n\tdelete CZNC::New();\n\texit(sig);\n}\n\nint main(int argc, char** argv) {\n\tstring sConfig;\n\n#ifdef HAVE_LIBSSL\n\t\/\/ initialize ssl, allow client to have compression enabled if desired\n\tInitSSL(CT_ZLIB);\n#endif \/* HAVE_LIBSSL *\/\n\n\tint iArg, iOptIndex = -1;\n#ifdef HAVE_LIBSSL\n\tbool bMakePem = false;\n\tbool bEncPem = false;\n#endif \/* HAVE_LIBSSL *\/\n\tbool bMakePass = false;\n\twhile ((iArg = getopt_long(argc, argv, \"h\", g_LongOpts, &iOptIndex) != -1)) {\n\t\tswitch (iArg) {\n\t\t\tcase 1: { \/\/ long options\n\t\t\t\tif (iOptIndex >= 0) {\n\t\t\t\t\tstring sOption = Lower(g_LongOpts[iOptIndex].name);\n\t\t\t\t\tif (sOption == \"version\") {\n\t\t\t\t\t\tcout << CZNC::GetTag() << endl;\n\t\t\t\t\t\treturn 0;\n\t\t\t\t\t} else if (sOption == \"makepass\") {\n\t\t\t\t\t\tbMakePass = true;\n#ifdef HAVE_LIBSSL\n\t\t\t\t\t} else if (sOption == \"makepem\") {\n\t\t\t\t\t\tbMakePem = true;\n\t\t\t\t\t} else if (sOption == \"encrypt-pem\") {\n\t\t\t\t\t\tbEncPem = true;\n#endif \/* HAVE_LIBSSL *\/\n\t\t\t\t\t} else if (sOption == \"help\") {\n\t\t\t\t\t\tGenerateHelp(argv[0]);\n\t\t\t\t\t\treturn 0;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tGenerateHelp(argv[0]);\n\t\t\t\t\treturn 1;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase 'h':\n\t\t\t\tGenerateHelp(argv[0]);\n\t\t\t\treturn 0;\n\t\t\tdefault: {\n\t\t\t\tGenerateHelp(argv[0]);\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (optind < argc) {\n\t\tsConfig = argv[optind];\n\t}\n\n#ifdef HAVE_LIBSSL\n\tif (bMakePem) {\n\t\tCZNC* pZNC = CZNC::New();\n\t\tpZNC->InitDirs(\"\");\n\t\tstring sPemFile = pZNC->GetPemLocation();\n\n\t\tCUtils::PrintAction(\"Writing Pem file [\" + sPemFile + \"]\");\n\n\t\tif (CFile::Exists(sPemFile)) {\n\t\t\tCUtils::PrintStatus(false, \"File already exists\");\n\t\t\tdelete pZNC;\n\t\t\treturn 1;\n\t\t}\n\n\t\tFILE *f = fopen(sPemFile.c_str(), \"w\");\n\n\t\tif (!f) {\n\t\t\tCUtils::PrintStatus(false, \"Unable to open\");\n\t\t\tdelete pZNC;\n\t\t\treturn 1 ;\n\t\t}\n\n\t\tCUtils::GenerateCert(f, bEncPem);\n\t\tfclose(f);\n\n\t\tCUtils::PrintStatus(true);\n\n\t\tdelete pZNC;\n\t\treturn 0;\n\t}\n#endif \/* HAVE_LIBSSL *\/\n\tif (bMakePass) {\n\t\tstring sHash = CUtils::GetHashPass();\n\t\tCUtils::PrintMessage(\"Use this in the <User> section of your config:\");\n\t\tCUtils::PrintMessage(\"Pass = \" + sHash + \" -\");\n\n\t\treturn 0;\n\t}\n\n\tCZNC* pZNC = CZNC::New();\n\tpZNC->InitDirs(((argc) ? argv[0] : \"\"));\n\n\tif (!pZNC->ParseConfig(sConfig)) {\n\t\tCUtils::PrintError(\"Unrecoverable config error.\");\n\t\tdelete pZNC;\n\t\treturn 1;\n\t}\n\n\tif (!pZNC->GetListenPort()) {\n\t\tCUtils::PrintError(\"You must supply a ListenPort in your config.\");\n\t\tdelete pZNC;\n\t\treturn 1;\n\t}\n\n\tif (!pZNC->OnBoot()) {\n\t\tCUtils::PrintError(\"Exiting due to module boot errors.\");\n\t\tdelete pZNC;\n\t\treturn 1;\n\t}\n\n#ifndef _DEBUG\n\tCUtils::PrintAction(\"Forking into the background\");\n\n\tint iPid = fork();\n\n\tif (iPid == -1) {\n\t\tCUtils::PrintStatus(false, strerror(errno));\n\t\tdelete pZNC;\n\t\texit(1);\n\t}\n\n\tif (iPid > 0) {\n\t\tCUtils::PrintStatus(true, \"[pid: \" + CUtils::ToString(iPid) + \"]\");\n\n\t\tpZNC->WritePidFile(iPid);\n\t\tCUtils::PrintMessage(CZNC::GetTag(false));\n\t\texit(0);\n\t}\n\n\t\/\/ Redirect std in\/out\/err to \/dev\/null\n\tclose(0); open(\"\/dev\/null\", O_RDONLY);\n\tclose(1); open(\"\/dev\/null\", O_WRONLY);\n\tclose(2); open(\"\/dev\/null\", O_WRONLY);\n\n#endif\n\n\tstruct sigaction sa;\n\tsa.sa_flags = 0;\n\tsigemptyset(&sa.sa_mask);\n\n\tsa.sa_handler = SIG_IGN;\n\tsigaction(SIGPIPE, &sa, (struct sigaction*) NULL);\n\n\tsa.sa_handler = die;\n\tsigaction(SIGINT,  &sa, (struct sigaction*) NULL);\n\tsigaction(SIGILL,  &sa, (struct sigaction*) NULL);\n\tsigaction(SIGQUIT, &sa, (struct sigaction*) NULL);\n\tsigaction(SIGBUS,  &sa, (struct sigaction*) NULL);\n\tsigaction(SIGSEGV, &sa, (struct sigaction*) NULL);\n\tsigaction(SIGTERM, &sa, (struct sigaction*) NULL);\n\n\tint iRet = 0;\n\n\ttry {\n\t\tiRet = pZNC->Loop();\n\t} catch (CException e) {\n\t\t\/\/ EX_Shutdown is thrown to exit\n\t\tswitch (e.GetType()) {\n\t\t\tcase CException::EX_Shutdown:\n\t\t\t\tiRet = 0;\n\t\t\tdefault:\n\t\t\t\tiRet = 1;\n\t\t}\n\t}\n\n\tdelete pZNC;\n\n\treturn iRet;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * File:   main.cpp\n * Author: beltoforion, scones\n *\n * Created on 5. Juli 2009, 22:15\n * Updated on 2015.07.03\n *\/\n\n#include <cstdlib>\n#include <iostream>\n\n\n#include \"NBodyWnd.h\"\n\n\nint main(int argc, char** argv) {\n  try {\n    NBodyWnd wndMain(800, \"Density wave simulation\");\n\n    \/\/ Define simulation size\n    wndMain.Init(4000);\n    wndMain.MainLoop();\n  } catch(std::exception & exc) {\n    std::cout << \"Fatal error: \" << exc.what() << std::endl;\n  } catch(...) {\n    std::cout << \"Fatal error: unexpected exception\" << std::endl;\n  }\n\n  return 0;\n}\n\n<commit_msg>master - use glfw window<commit_after>\/*\n * File:   main.cpp\n * Author: beltoforion, scones\n *\n * Created on 5. Juli 2009, 22:15\n * Updated on 2015.07.03\n *\/\n\n#include <cstdlib>\n#include <iostream>\n\n\n#include \"core\/window.h\"\n\n\nint main(int argc, char** argv) {\n  try {\n    NBodyWnd wndMain(800, \"Density wave simulation\");\n\n    \/\/ Define simulation size\n    wndMain.Init(4000);\n    wndMain.MainLoop();\n  } catch(std::exception & exc) {\n    std::cout << \"Fatal error: \" << exc.what() << std::endl;\n  } catch(...) {\n    std::cout << \"Fatal error: unexpected exception\" << std::endl;\n  }\n\n  return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>2d122902-2748-11e6-be9e-e0f84713e7b8<commit_msg>bug fix<commit_after>2d1f94c0-2748-11e6-ae48-e0f84713e7b8<|endoftext|>"}
{"text":"<commit_before>146acbde-585b-11e5-92e9-6c40088e03e4<commit_msg>1472363a-585b-11e5-b0a8-6c40088e03e4<commit_after>1472363a-585b-11e5-b0a8-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>b367448a-35ca-11e5-9520-6c40088e03e4<commit_msg>b36d8e98-35ca-11e5-a00f-6c40088e03e4<commit_after>b36d8e98-35ca-11e5-a00f-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>d43a3e4a-2e4e-11e5-a7e1-28cfe91dbc4b<commit_msg>d4461757-2e4e-11e5-95fc-28cfe91dbc4b<commit_after>d4461757-2e4e-11e5-95fc-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>9d2950dc-327f-11e5-b7da-9cf387a8033e<commit_msg>9d301411-327f-11e5-9391-9cf387a8033e<commit_after>9d301411-327f-11e5-9391-9cf387a8033e<|endoftext|>"}
{"text":"<commit_before>8c3d2096-2d14-11e5-af21-0401358ea401<commit_msg>8c3d2097-2d14-11e5-af21-0401358ea401<commit_after>8c3d2097-2d14-11e5-af21-0401358ea401<|endoftext|>"}
{"text":"<commit_before>6ff38d94-2fa5-11e5-971d-00012e3d3f12<commit_msg>6ff56252-2fa5-11e5-bee4-00012e3d3f12<commit_after>6ff56252-2fa5-11e5-bee4-00012e3d3f12<|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#include \"condor_common.h\"\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 AND COMPILE-TIME.  DO NOT ALTER THE\n   FORMAT OR ENTER ANYTHING EXTRA BEFORE THE DATE.  IF YOU WISH TO ADD\n   EXTRA INFORMATION, DO SO _AFTER_ THE BUILDIDSTR AND BEFORE THE TRAILING\n   '$' 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.4.1 \" __DATE__ BUILDIDSTR \" PRE-RELEASE $\";\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>removed PRE-RELEASE from the CondorVersion.<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#include \"condor_common.h\"\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 AND COMPILE-TIME.  DO NOT ALTER THE\n   FORMAT OR ENTER ANYTHING EXTRA BEFORE THE DATE.  IF YOU WISH TO ADD\n   EXTRA INFORMATION, DO SO _AFTER_ THE BUILDIDSTR AND BEFORE THE TRAILING\n   '$' 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.4.1 \" __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>856278c4-2d15-11e5-af21-0401358ea401<commit_msg>856278c5-2d15-11e5-af21-0401358ea401<commit_after>856278c5-2d15-11e5-af21-0401358ea401<|endoftext|>"}
{"text":"<commit_before>aa333ee1-2747-11e6-80eb-e0f84713e7b8<commit_msg>I'm done<commit_after>aa444821-2747-11e6-9bab-e0f84713e7b8<|endoftext|>"}
{"text":"<commit_before>dc0da0a1-327f-11e5-aaba-9cf387a8033e<commit_msg>dc1578f0-327f-11e5-876f-9cf387a8033e<commit_after>dc1578f0-327f-11e5-876f-9cf387a8033e<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2004-2008  See the AUTHORS file for details.\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 version 2 as published\n * by the Free Software Foundation.\n *\/\n\n#include \"znc.h\"\n#include <getopt.h>\n\nstatic struct option g_LongOpts[] = {\n\t{ \"help\",\t\t\tno_argument,\t0,\t'h' },\n\t{ \"version\",\t\t\tno_argument,\t0,\t'v' },\n\t{ \"no-color\",\t\t\tno_argument,\t0,\t'n' },\n\t{ \"makeconf\",\t\t\tno_argument,\t0,\t'c' },\n\t{ \"makepass\",\t\t\tno_argument,\t0,\t's' },\n#ifdef HAVE_LIBSSL\n\t{ \"makepem\",\t\t\tno_argument,\t0,\t'p' },\n\t{ \"encrypt-pem\",\t\tno_argument,\t0, \t'e' },\n#endif \/* HAVE_LIBSSL *\/\n\t{ \"datadir\",                    required_argument,\t0,   'd' },\n\t{ 0, 0, 0, 0 }\n};\n\nstatic void GenerateHelp(const char *appname) {\n\tCUtils::PrintMessage(\"USAGE: \" + CString(appname) + \" [options] [config]\");\n\tCUtils::PrintMessage(\"Options are:\");\n\tCUtils::PrintMessage(\"\\t-h, --help         List available command line options (this page)\");\n\tCUtils::PrintMessage(\"\\t-v, --version      Output version information and exit\");\n\tCUtils::PrintMessage(\"\\t-n, --no-color     Don't use escape sequences in the output\");\n\tCUtils::PrintMessage(\"\\t-c, --makeconf     Interactively create a new config\");\n\tCUtils::PrintMessage(\"\\t-s, --makepass     Generates a password for use in config\");\n#ifdef HAVE_LIBSSL\n\tCUtils::PrintMessage(\"\\t-p, --makepem      Generates a pemfile for use with SSL\");\n\tCUtils::PrintMessage(\"\\t-e, --encrypt-pem  when used along with --makepem, encrypts the private key in the pemfile\");\n#endif \/* HAVE_LIBSSL *\/\n\tCUtils::PrintMessage(\"\\t-d, --datadir      Set a different znc repository (default is ~\/.znc)\");\n}\n\nstatic void die(int sig) {\n\tsignal(SIGSEGV, SIG_DFL);\n\tsignal(SIGABRT, SIG_DFL);\n\tsignal(SIGPIPE, SIG_DFL);\n\n#ifdef _DEBUG\n\tCUtils::PrintMessage(\"Exiting on SIG [\" + CString(sig) + \"]\");\n\tif ((sig == SIGABRT) || (sig == SIGSEGV)) {\n\t\tabort();\n\t}\n#endif \/* _DEBUG *\/\n\n\tdelete &CZNC::Get();\n\texit(sig);\n}\n\nstatic void rehash(int sig) {\n\tCZNC::Get().SetNeedRehash(true);\n}\n\nint main(int argc, char** argv) {\n\tCString sConfig;\n\tCString sDataDir = \"\";\n\n\tsrand(time(NULL));\n\tCUtils::SetStdoutIsTTY(isatty(1));\n\n#ifdef HAVE_LIBSSL\n\tInitSSL();\n#endif \/* HAVE_LIBSSL *\/\n\n\tint iArg, iOptIndex = -1;\n\tbool bMakeConf = false;\n\tbool bMakePass = false;\n#ifdef HAVE_LIBSSL\n\tbool bMakePem = false;\n\tbool bEncPem = false;\n\n\twhile ((iArg = getopt_long(argc, argv, \"hvncsped:\", g_LongOpts, &iOptIndex)) != -1) {\n#else\n\twhile ((iArg = getopt_long(argc, argv, \"hvncsd:\", g_LongOpts, &iOptIndex)) != -1) {\n#endif \/* HAVE_LIBSSL *\/\n\t    switch (iArg) {\n\t\tcase 'h':\n\t\t\t    GenerateHelp(argv[0]);\n\t\t\t    return 0;\n\t\tcase 'v':\n\t\t\t    cout << CZNC::GetTag() << endl;\n\t\t\t    return 0;\n\t\tcase 'n':\n\t\t\t    CUtils::SetStdoutIsTTY(false);\n\t\t\t    break;\n\t\tcase 'c':\n\t\t\t    bMakeConf = true;\n\t\t\t    break;\n\t\tcase 's':\n\t\t\t    bMakePass = true;\n\t\t\t    break;\n#ifdef HAVE_LIBSSL\n\t\tcase 'p':\n\t\t\t    bMakePem = true;\n\t\t\t    break;\n\t\tcase 'e':\n\t\t\t    bEncPem = true;\n\t\t\t    break;\n#endif \/* HAVE_LIBSSL *\/\n\t\tcase 'd':\n\t\t\t    sDataDir = CString(optarg);\n\t\t\t    break;\n\t\tcase '?':\n\t\tdefault:\n\t\t\t    GenerateHelp(argv[0]);\n\t\t\t    return 1;\n\t    }\n\t}\n\n\tif (optind < argc) {\n\t\tsConfig = argv[optind];\n\t} else {\n\t\tsConfig = \"znc.conf\";\n\t}\n\n\tif (bMakeConf) {\n\t\tCZNC& ZNC = CZNC::Get();\n\t\tZNC.InitDirs(\"\", sDataDir);\n\t\tif (ZNC.WriteNewConfig(sConfig)) {\n\t\t\tchar const* args[5];\n\n\t\t\tif (argc > 2) {\n\t\t\t\targs[0] = argv[0];\n\t\t\t\tif (!sDataDir.empty()) {\n\t\t\t\t\targs[1] = \"--datadir\";\n\t\t\t\t\targs[2] = strdup(sDataDir.c_str());\n\t\t\t\t\targs[3] = argv[optind];\n\t\t\t\t\targs[4] = NULL;\n\t\t\t\t} else {\n\t\t\t\t\targs[1] = argv[optind];\n\t\t\t\t\targs[2] = NULL;\n\t\t\t\t}\n\t\t\t} else if (argc > 1) {\n\t\t\t\targs[0] = argv[0];\n\t\t\t\tif (!sDataDir.empty()) {\n\t\t\t\t\targs[1] = \"--datadir\";\n\t\t\t\t\targs[2] = strdup(sDataDir.c_str());\n\t\t\t\t\targs[3] = NULL;\n\t\t\t\t} else {\n\t\t\t\t\targs[1] = NULL;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tCUtils::PrintError(\"Unable to launch znc [Try manually restarting]\");\n\t\t\t\treturn 1;\n\t\t\t}\n\n\t\t\tif ((chdir(ZNC.GetCurPath().c_str()) == -1)\n\t\t\t\t\t|| (execv(*argv, (char *const*)args) == -1)) {\n\t\t\t\tCUtils::PrintError(\"Unable to launch znc [\" + CString(strerror(errno)) + \"]\");\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t}\n\n\t\treturn 0;\n\t}\n\n#ifdef HAVE_LIBSSL\n\tif (bMakePem) {\n\t\tCZNC* pZNC = &CZNC::Get();\n\t\tpZNC->InitDirs(\"\", sDataDir);\n\t\tpZNC->WritePemFile(bEncPem);\n\n\t\tdelete pZNC;\n\t\treturn 0;\n\t}\n\tif (bEncPem && !bMakePem) {\n\t\tCUtils::PrintError(\"--encrypt-pem should be used along with --makepem.\");\n\t\treturn 1;\n\t}\n\n#endif \/* HAVE_LIBSSL *\/\n\tif (bMakePass) {\n\t\tCString sHash = CUtils::GetHashPass();\n\t\tCUtils::PrintMessage(\"Use this in the <User> section of your config:\");\n\t\tCUtils::PrintMessage(\"Pass = \" + sHash + \" -\");\n\n\t\treturn 0;\n\t}\n\n\tCZNC* pZNC = &CZNC::Get();\n\tpZNC->InitDirs(((argc) ? argv[0] : \"\"), sDataDir);\n\n\tif (!pZNC->ParseConfig(sConfig)) {\n\t\tCUtils::PrintError(\"Unrecoverable config error.\");\n\t\tdelete pZNC;\n\t\treturn 1;\n\t}\n\n\tif (!pZNC->OnBoot()) {\n\t\tCUtils::PrintError(\"Exiting due to module boot errors.\");\n\t\tdelete pZNC;\n\t\treturn 1;\n\t}\n\n#ifdef _DEBUG\n\tint iPid = getpid();\n\tCUtils::PrintMessage(\"Staying open for debugging [pid: \" + CString(iPid) + \"]\");\n\n\tpZNC->WritePidFile(iPid);\n\tCUtils::PrintMessage(CZNC::GetTag());\n#else\n\tCUtils::PrintAction(\"Forking into the background\");\n\n\tint iPid = fork();\n\n\tif (iPid == -1) {\n\t\tCUtils::PrintStatus(false, strerror(errno));\n\t\tdelete pZNC;\n\t\texit(1);\n\t}\n\n\tif (iPid > 0) {\n\t\t\/\/ We are the parent. We are done and will go to bed.\n\t\tCUtils::PrintStatus(true, \"[pid: \" + CString(iPid) + \"]\");\n\n\t\tpZNC->WritePidFile(iPid);\n\t\tCUtils::PrintMessage(CZNC::GetTag());\n\t\texit(0);\n\t}\n\n\t\/\/ Redirect std in\/out\/err to \/dev\/null\n\tclose(0); open(\"\/dev\/null\", O_RDONLY);\n\tclose(1); open(\"\/dev\/null\", O_WRONLY);\n\tclose(2); open(\"\/dev\/null\", O_WRONLY);\n\n\tCUtils::SetStdoutIsTTY(false);\n\n\t\/\/ We are the child. There is no way we can be a process group\n\t\/\/ leader, thus setsid() must succeed.\n\tsetsid();\n\t\/\/ Now we are in our own process group and session (no controlling\n\t\/\/ terminal). We are independent!\n#endif\n\n\tstruct sigaction sa;\n\tsa.sa_flags = 0;\n\tsigemptyset(&sa.sa_mask);\n\n\tsa.sa_handler = SIG_IGN;\n\tsigaction(SIGPIPE, &sa, (struct sigaction*) NULL);\n\n\tsa.sa_handler = die;\n\tsigaction(SIGINT,  &sa, (struct sigaction*) NULL);\n\tsigaction(SIGILL,  &sa, (struct sigaction*) NULL);\n\tsigaction(SIGQUIT, &sa, (struct sigaction*) NULL);\n\tsigaction(SIGBUS,  &sa, (struct sigaction*) NULL);\n\tsigaction(SIGSEGV, &sa, (struct sigaction*) NULL);\n\tsigaction(SIGTERM, &sa, (struct sigaction*) NULL);\n\n\tsa.sa_handler = rehash;\n\tsigaction(SIGHUP,  &sa, (struct sigaction*) NULL);\n\n\tint iRet = 0;\n\n\ttry {\n\t\tiRet = pZNC->Loop();\n\t} catch (CException e) {\n\t\t\/\/ EX_Shutdown is thrown to exit\n\t\tswitch (e.GetType()) {\n\t\t\tcase CException::EX_Shutdown:\n\t\t\t\tiRet = 0;\n\t\t\tdefault:\n\t\t\t\tiRet = 1;\n\t\t}\n\t}\n\n\tdelete pZNC;\n\n\treturn iRet;\n}\n<commit_msg>Use the SA_RESETHAND flag to sigaction()<commit_after>\/*\n * Copyright (C) 2004-2008  See the AUTHORS file for details.\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 version 2 as published\n * by the Free Software Foundation.\n *\/\n\n#include \"znc.h\"\n#include <getopt.h>\n\nstatic struct option g_LongOpts[] = {\n\t{ \"help\",\t\t\tno_argument,\t0,\t'h' },\n\t{ \"version\",\t\t\tno_argument,\t0,\t'v' },\n\t{ \"no-color\",\t\t\tno_argument,\t0,\t'n' },\n\t{ \"makeconf\",\t\t\tno_argument,\t0,\t'c' },\n\t{ \"makepass\",\t\t\tno_argument,\t0,\t's' },\n#ifdef HAVE_LIBSSL\n\t{ \"makepem\",\t\t\tno_argument,\t0,\t'p' },\n\t{ \"encrypt-pem\",\t\tno_argument,\t0, \t'e' },\n#endif \/* HAVE_LIBSSL *\/\n\t{ \"datadir\",                    required_argument,\t0,   'd' },\n\t{ 0, 0, 0, 0 }\n};\n\nstatic void GenerateHelp(const char *appname) {\n\tCUtils::PrintMessage(\"USAGE: \" + CString(appname) + \" [options] [config]\");\n\tCUtils::PrintMessage(\"Options are:\");\n\tCUtils::PrintMessage(\"\\t-h, --help         List available command line options (this page)\");\n\tCUtils::PrintMessage(\"\\t-v, --version      Output version information and exit\");\n\tCUtils::PrintMessage(\"\\t-n, --no-color     Don't use escape sequences in the output\");\n\tCUtils::PrintMessage(\"\\t-c, --makeconf     Interactively create a new config\");\n\tCUtils::PrintMessage(\"\\t-s, --makepass     Generates a password for use in config\");\n#ifdef HAVE_LIBSSL\n\tCUtils::PrintMessage(\"\\t-p, --makepem      Generates a pemfile for use with SSL\");\n\tCUtils::PrintMessage(\"\\t-e, --encrypt-pem  when used along with --makepem, encrypts the private key in the pemfile\");\n#endif \/* HAVE_LIBSSL *\/\n\tCUtils::PrintMessage(\"\\t-d, --datadir      Set a different znc repository (default is ~\/.znc)\");\n}\n\nstatic void die(int sig) {\n\tsignal(SIGPIPE, SIG_DFL);\n\n#ifdef _DEBUG\n\tCUtils::PrintMessage(\"Exiting on SIG [\" + CString(sig) + \"]\");\n\tif ((sig == SIGABRT) || (sig == SIGSEGV)) {\n\t\tabort();\n\t}\n#endif \/* _DEBUG *\/\n\n\tdelete &CZNC::Get();\n\texit(sig);\n}\n\nstatic void rehash(int sig) {\n\tCZNC::Get().SetNeedRehash(true);\n}\n\nint main(int argc, char** argv) {\n\tCString sConfig;\n\tCString sDataDir = \"\";\n\n\tsrand(time(NULL));\n\tCUtils::SetStdoutIsTTY(isatty(1));\n\n#ifdef HAVE_LIBSSL\n\tInitSSL();\n#endif \/* HAVE_LIBSSL *\/\n\n\tint iArg, iOptIndex = -1;\n\tbool bMakeConf = false;\n\tbool bMakePass = false;\n#ifdef HAVE_LIBSSL\n\tbool bMakePem = false;\n\tbool bEncPem = false;\n\n\twhile ((iArg = getopt_long(argc, argv, \"hvncsped:\", g_LongOpts, &iOptIndex)) != -1) {\n#else\n\twhile ((iArg = getopt_long(argc, argv, \"hvncsd:\", g_LongOpts, &iOptIndex)) != -1) {\n#endif \/* HAVE_LIBSSL *\/\n\t    switch (iArg) {\n\t\tcase 'h':\n\t\t\t    GenerateHelp(argv[0]);\n\t\t\t    return 0;\n\t\tcase 'v':\n\t\t\t    cout << CZNC::GetTag() << endl;\n\t\t\t    return 0;\n\t\tcase 'n':\n\t\t\t    CUtils::SetStdoutIsTTY(false);\n\t\t\t    break;\n\t\tcase 'c':\n\t\t\t    bMakeConf = true;\n\t\t\t    break;\n\t\tcase 's':\n\t\t\t    bMakePass = true;\n\t\t\t    break;\n#ifdef HAVE_LIBSSL\n\t\tcase 'p':\n\t\t\t    bMakePem = true;\n\t\t\t    break;\n\t\tcase 'e':\n\t\t\t    bEncPem = true;\n\t\t\t    break;\n#endif \/* HAVE_LIBSSL *\/\n\t\tcase 'd':\n\t\t\t    sDataDir = CString(optarg);\n\t\t\t    break;\n\t\tcase '?':\n\t\tdefault:\n\t\t\t    GenerateHelp(argv[0]);\n\t\t\t    return 1;\n\t    }\n\t}\n\n\tif (optind < argc) {\n\t\tsConfig = argv[optind];\n\t} else {\n\t\tsConfig = \"znc.conf\";\n\t}\n\n\tif (bMakeConf) {\n\t\tCZNC& ZNC = CZNC::Get();\n\t\tZNC.InitDirs(\"\", sDataDir);\n\t\tif (ZNC.WriteNewConfig(sConfig)) {\n\t\t\tchar const* args[5];\n\n\t\t\tif (argc > 2) {\n\t\t\t\targs[0] = argv[0];\n\t\t\t\tif (!sDataDir.empty()) {\n\t\t\t\t\targs[1] = \"--datadir\";\n\t\t\t\t\targs[2] = strdup(sDataDir.c_str());\n\t\t\t\t\targs[3] = argv[optind];\n\t\t\t\t\targs[4] = NULL;\n\t\t\t\t} else {\n\t\t\t\t\targs[1] = argv[optind];\n\t\t\t\t\targs[2] = NULL;\n\t\t\t\t}\n\t\t\t} else if (argc > 1) {\n\t\t\t\targs[0] = argv[0];\n\t\t\t\tif (!sDataDir.empty()) {\n\t\t\t\t\targs[1] = \"--datadir\";\n\t\t\t\t\targs[2] = strdup(sDataDir.c_str());\n\t\t\t\t\targs[3] = NULL;\n\t\t\t\t} else {\n\t\t\t\t\targs[1] = NULL;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tCUtils::PrintError(\"Unable to launch znc [Try manually restarting]\");\n\t\t\t\treturn 1;\n\t\t\t}\n\n\t\t\tif ((chdir(ZNC.GetCurPath().c_str()) == -1)\n\t\t\t\t\t|| (execv(*argv, (char *const*)args) == -1)) {\n\t\t\t\tCUtils::PrintError(\"Unable to launch znc [\" + CString(strerror(errno)) + \"]\");\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t}\n\n\t\treturn 0;\n\t}\n\n#ifdef HAVE_LIBSSL\n\tif (bMakePem) {\n\t\tCZNC* pZNC = &CZNC::Get();\n\t\tpZNC->InitDirs(\"\", sDataDir);\n\t\tpZNC->WritePemFile(bEncPem);\n\n\t\tdelete pZNC;\n\t\treturn 0;\n\t}\n\tif (bEncPem && !bMakePem) {\n\t\tCUtils::PrintError(\"--encrypt-pem should be used along with --makepem.\");\n\t\treturn 1;\n\t}\n\n#endif \/* HAVE_LIBSSL *\/\n\tif (bMakePass) {\n\t\tCString sHash = CUtils::GetHashPass();\n\t\tCUtils::PrintMessage(\"Use this in the <User> section of your config:\");\n\t\tCUtils::PrintMessage(\"Pass = \" + sHash + \" -\");\n\n\t\treturn 0;\n\t}\n\n\tCZNC* pZNC = &CZNC::Get();\n\tpZNC->InitDirs(((argc) ? argv[0] : \"\"), sDataDir);\n\n\tif (!pZNC->ParseConfig(sConfig)) {\n\t\tCUtils::PrintError(\"Unrecoverable config error.\");\n\t\tdelete pZNC;\n\t\treturn 1;\n\t}\n\n\tif (!pZNC->OnBoot()) {\n\t\tCUtils::PrintError(\"Exiting due to module boot errors.\");\n\t\tdelete pZNC;\n\t\treturn 1;\n\t}\n\n#ifdef _DEBUG\n\tint iPid = getpid();\n\tCUtils::PrintMessage(\"Staying open for debugging [pid: \" + CString(iPid) + \"]\");\n\n\tpZNC->WritePidFile(iPid);\n\tCUtils::PrintMessage(CZNC::GetTag());\n#else\n\tCUtils::PrintAction(\"Forking into the background\");\n\n\tint iPid = fork();\n\n\tif (iPid == -1) {\n\t\tCUtils::PrintStatus(false, strerror(errno));\n\t\tdelete pZNC;\n\t\texit(1);\n\t}\n\n\tif (iPid > 0) {\n\t\t\/\/ We are the parent. We are done and will go to bed.\n\t\tCUtils::PrintStatus(true, \"[pid: \" + CString(iPid) + \"]\");\n\n\t\tpZNC->WritePidFile(iPid);\n\t\tCUtils::PrintMessage(CZNC::GetTag());\n\t\texit(0);\n\t}\n\n\t\/\/ Redirect std in\/out\/err to \/dev\/null\n\tclose(0); open(\"\/dev\/null\", O_RDONLY);\n\tclose(1); open(\"\/dev\/null\", O_WRONLY);\n\tclose(2); open(\"\/dev\/null\", O_WRONLY);\n\n\tCUtils::SetStdoutIsTTY(false);\n\n\t\/\/ We are the child. There is no way we can be a process group\n\t\/\/ leader, thus setsid() must succeed.\n\tsetsid();\n\t\/\/ Now we are in our own process group and session (no controlling\n\t\/\/ terminal). We are independent!\n#endif\n\n\tstruct sigaction sa;\n\tsa.sa_flags = 0;\n\tsigemptyset(&sa.sa_mask);\n\n\tsa.sa_handler = SIG_IGN;\n\tsigaction(SIGPIPE, &sa, (struct sigaction*) NULL);\n\n\tsa.sa_handler = rehash;\n\tsigaction(SIGHUP,  &sa, (struct sigaction*) NULL);\n\n\t\/\/ Once this signal is caught, the signal handler is reset\n\t\/\/ to SIG_DFL. This avoids endless loop with signals.\n\tsa.sa_flags = SA_RESETHAND;\n\tsa.sa_handler = die;\n\tsigaction(SIGINT,  &sa, (struct sigaction*) NULL);\n\tsigaction(SIGILL,  &sa, (struct sigaction*) NULL);\n\tsigaction(SIGQUIT, &sa, (struct sigaction*) NULL);\n\tsigaction(SIGBUS,  &sa, (struct sigaction*) NULL);\n\tsigaction(SIGSEGV, &sa, (struct sigaction*) NULL);\n\tsigaction(SIGTERM, &sa, (struct sigaction*) NULL);\n\n\tint iRet = 0;\n\n\ttry {\n\t\tiRet = pZNC->Loop();\n\t} catch (CException e) {\n\t\t\/\/ EX_Shutdown is thrown to exit\n\t\tswitch (e.GetType()) {\n\t\t\tcase CException::EX_Shutdown:\n\t\t\t\tiRet = 0;\n\t\t\tdefault:\n\t\t\t\tiRet = 1;\n\t\t}\n\t}\n\n\tdelete pZNC;\n\n\treturn iRet;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"src\/htl\/hqueue.h\"\n#include <iostream>\n\nint main()\n{\n\thtl::queue<int> i;\n\ti.push(1), i.push(2), i.push(3);\n\twhile(!i.empty())\n\t{\n\t\tstd::cout << i.front() << std::endl;\n\t\ti.pop();\n\t}\n\tgetchar();\n\tgetchar();\n}<commit_msg>testing sorted list<commit_after>#include \"src\/SortedList.h\"\n#include <iostream>\n\nint main()\n{\n\trty::SortedList<int> a;\n\ta.insert(5);\n\ta.insert(3);\n\ta.insert(4);\n\ta.insert(7);\n\ta.insert(1);\n\ta.insert(9);\n\n\tfor(rty::SortedList<int>::iterator it = a.begin(); it != a.end(); it++)\n\t{\n\t\tstd::cout << *it << std::endl;\n\t}\n\n\tgetchar();\n\tgetchar();\n}<|endoftext|>"}
{"text":"<commit_before>7f6cf621-2d15-11e5-af21-0401358ea401<commit_msg>7f6cf622-2d15-11e5-af21-0401358ea401<commit_after>7f6cf622-2d15-11e5-af21-0401358ea401<|endoftext|>"}
{"text":"<commit_before>1b0085b0-2e3a-11e5-9618-c03896053bdd<commit_msg>1b0da768-2e3a-11e5-9ccc-c03896053bdd<commit_after>1b0da768-2e3a-11e5-9ccc-c03896053bdd<|endoftext|>"}
{"text":"<commit_before>d1cd97ba-2e4e-11e5-b2f4-28cfe91dbc4b<commit_msg>d1d5fe9e-2e4e-11e5-b9ab-28cfe91dbc4b<commit_after>d1d5fe9e-2e4e-11e5-b9ab-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>5cb3fb54-5216-11e5-92cd-6c40088e03e4<commit_msg>5cbaabfe-5216-11e5-a1c5-6c40088e03e4<commit_after>5cbaabfe-5216-11e5-a1c5-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>148f6fc0-585b-11e5-99dc-6c40088e03e4<commit_msg>14962b76-585b-11e5-9618-6c40088e03e4<commit_after>14962b76-585b-11e5-9618-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>593bc7b8-5216-11e5-ab99-6c40088e03e4<commit_msg>59426848-5216-11e5-b27e-6c40088e03e4<commit_after>59426848-5216-11e5-b27e-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>#include \"sgct.h\"\n#include \"ParticleSystem.h\"\n#include \"Snow.h\"\n#include \"World.h\"\n#include \"HelperFunctions.h\"\n#include \"Field.h\"\n#include \"DebugField.h\"\n#include \"Gravity.h\"\n#include \"Wind.h\"\n#include \"ObjSystem.h\"\n#include \"SoapBubble.h\"\n#include \"Vortex.h\"\n#include <iostream>\n#include \"SimplexNoise.h\"\n\n\/\/our beautiful global variables\nsgct::Engine* gEngine;\nSnow* gParticles;\nWorld* gWorld;\nObject* road;\nObject* tree;\nSoapBubble* gBubble;\nWind* gWind;\nGravity* gGrav;\nVortex* gTurbine;\n\nbool gDisplayInfo;\nbool gStatsGraph;\nbool gWireframe;\n\nsgct::SharedDouble curr_time(0.0);\nsgct::SharedDouble sizeFactorX(0.0);\nsgct::SharedDouble sizeFactorY(0.0);\nsgct::SharedDouble sizeFactorZ(0.0);\nsgct::SharedDouble vortFactorX(0.0);\nsgct::SharedDouble vortFactorY(0.0);\nsgct::SharedDouble vortFactorZ(0.0);\nsgct::SharedDouble positionX(0.0);\nsgct::SharedDouble positionZ(0.0);\nsgct::SharedDouble radius(0.0);\nsgct::SharedDouble fadeDistance(0.0);\n\n\nvoid initialize();\nvoid draw();\nvoid myPreSyncFun();\nvoid statsDrawFun();\nvoid myEncodeFun();\nvoid myDecodeFun();\nvoid externalControlCallback(const char * receivedChars, int size, int clientId);\nvoid sendMessageToExternalControl(void * data, int length);\n\n\nint main(int argc, char *argv[])\n{\n\tinitRandom();\n\n\tgEngine = new sgct::Engine(argc, argv);\n\n\tgEngine->setInitOGLFunction(initialize);\n\tgEngine->setDrawFunction(draw);\n\tgEngine->setPreSyncFunction(myPreSyncFun);\n\tgEngine->setPostSyncPreDrawFunction(statsDrawFun);\n\tgEngine->setExternalControlCallback(externalControlCallback);\n\tsgct::SharedData::instance()->setEncodeFunction(myEncodeFun);\n\tsgct::SharedData::instance()->setDecodeFunction(myDecodeFun);\n\n\tgParticles = new Snow(gEngine);\n\tgWorld = new World(gEngine);\n\n\tgBubble = new SoapBubble(gEngine);\n\n\troad = new Object(gEngine);\n\ttree = new Object(gEngine);\n\n\tgGrav = new Gravity();\n\tgGrav->init(-9.81f);\n\tgParticles->addField(gGrav);\n\n\n\tgWind = new Wind();\n\t\/\/wind->init(getRandom(-0.2, 0.2), 0.0f, getRandom(-0.2, 0.2));\n\tgWind->setAcceleration(getRandom(-0.2, 0.2), 0.0f, getRandom(-0.2, 0.2));\n\t\/\/gParticles->addField(gWind);\n\n\tgTurbine = new Vortex();\n\tgTurbine->init(0.0f, 0.0f, 0.0f);\n\t\/\/ gParticles->addField(gTurbine);\n\n\tif(!gEngine->init(sgct::Engine::OpenGL_3_3_Core_Profile))\n\t{\n\t\tdelete gEngine;\n\t\treturn EXIT_FAILURE;\n\t}\n\n\t\/\/Not working yet... :(\n\tSimplexNoise* noise = new SimplexNoise();\n\tnoise->init(glm::vec3(0), glm::vec3(0), gEngine->getTime());\n\n\t\/\/ gParticles->addField(noise);\n\n\tcout << \"---- Fields active on gParticles ----\" << endl;\n\tgParticles->printFields();\n\tcout << \"---------------\" << endl << endl;\n\n\tgEngine->render();\n\n\tgParticles->destroy();\n\troad->deleteObject();\n\tdelete road;\n\tdelete gEngine;\n\tdelete gParticles;\n\tdelete gWorld;\n\tdelete gBubble;\n\tdelete gWind;\n\tdelete gTurbine;\n\n\texit(EXIT_SUCCESS);\n}\n\nvoid initialize()\n{\n\tif(!gParticles->initialize())\n\t{\n\t\tstd::cout << \"Error Initialzing Particle System:\" << std::endl;\n\t\texit(EXIT_FAILURE);\n\t}\n\tgWorld->initializeWorld();\n\n\troad->loadObj(\"road\/road.obj\", \"road\/road.png\");\n\troad->scale(0.2f,0.2f,0.2f);\n\troad->translate(0.0f, -2.0f, 5.0f);\n\n\ttree->loadObj(\"road\/tree.obj\",\"road\/tree.png\");\n\ttree->scale(0.05f,0.05f,0.05f);\n\ttree->translate(0.0f, -1.0f, -6.0f);\n\n\tgBubble->createSphere(1.5f, 100);\n\n\n\tgDisplayInfo = false;\n\tgStatsGraph = false;\n\tgWireframe = false;\n}\n\nvoid draw()\n{\n\tdouble delta = gEngine->getDt();\n\tgWorld->drawWorld();\n\tgBubble->drawBubble();\n\troad->draw();\n\ttree->draw();\n\tgParticles->move(delta);\n\tgParticles->draw(delta);\n\n\t\/\/if(gEngine->isExternalControlConnected())\n\t\/\/\tcout << \"Connectad is very nice\";\n}\n\n\/\/Checking the time since the program started, not sure if we need this either.\nvoid myPreSyncFun()\n{\n\t\/\/Checks so the gEnginenode is actually the master.\n\tif( gEngine->isMaster() )\n\t{\n\t\t\/\/Sets the current time since the program started\n\t\tcurr_time.setVal(sgct::Engine::getTime());\n\t}\n}\n\nvoid myEncodeFun()\n{\n\tsgct::SharedData::instance()->writeDouble(&curr_time);\n \tsgct::SharedData::instance()->writeDouble(&sizeFactorX);\n \tsgct::SharedData::instance()->writeDouble(&sizeFactorY);\n \tsgct::SharedData::instance()->writeDouble(&sizeFactorZ);\n \tsgct::SharedData::instance()->writeDouble(&vortFactorX);\n \tsgct::SharedData::instance()->writeDouble(&vortFactorY);\n \tsgct::SharedData::instance()->writeDouble(&vortFactorZ);\n \tsgct::SharedData::instance()->writeDouble(&positionX);\n \tsgct::SharedData::instance()->writeDouble(&positionZ);\n \tsgct::SharedData::instance()->writeDouble(&radius);\n \tsgct::SharedData::instance()->writeDouble(&fadeDistance);\n\n}\n\n\nvoid myDecodeFun()\n{\n\tsgct::SharedData::instance()->readDouble(&curr_time);\n\tsgct::SharedData::instance()->readDouble(&sizeFactorX);\n\tsgct::SharedData::instance()->readDouble(&sizeFactorY);\n\tsgct::SharedData::instance()->readDouble(&sizeFactorZ);\n\tsgct::SharedData::instance()->readDouble(&vortFactorX);\n\tsgct::SharedData::instance()->readDouble(&vortFactorY);\n\tsgct::SharedData::instance()->readDouble(&vortFactorZ);\n\tsgct::SharedData::instance()->readDouble(&positionX);\n\tsgct::SharedData::instance()->readDouble(&positionZ);\n\tsgct::SharedData::instance()->readDouble(&radius);\n\tsgct::SharedData::instance()->readDouble(&fadeDistance);\n}\n\n\/\/Shows stats and graph depending on if the variables are true or not. Dont know if we need this? Currently set to false.\nvoid statsDrawFun()\n{\n\tgEngine->setDisplayInfoVisibility(gDisplayInfo);\n\tgEngine->setStatsGraphVisibility(gStatsGraph);\n\tgEngine->setWireframe(gWireframe);\n}\n\n\/\/Used to alter certain values when sent from GUI. This way we can alter the fields or change gravity in realtime!\nvoid externalControlCallback(const char * receivedChars, int size, int clientId)\n{\n\t\/\/Checks so the gEnginenode is actually the master.\n\tif(gEngine->isMaster())\n\t{\n\t\tif(size >= 6 && strncmp(receivedChars, \"winX\", 4) == 0)\n\t\t{\n\t\t\t\/\/We need an int.\n \t\t\tint tmpVal = atoi(receivedChars + 5);\n \t\t\tsizeFactorX.setVal(tmpVal);\n\t\t\tgWind->setAcceleration((sizeFactorX.getVal()*0.01f), (sizeFactorY.getVal()*0.01f), (sizeFactorZ.getVal()*0.01f));\n\n\t\t}\n\n\t\telse if(size >= 6 && strncmp(receivedChars, \"winY\", 4) == 0)\n\t\t{\n\t\t\t\/\/We need an int.\n\t\t\tint tmpVal = atoi(receivedChars + 5);\n \t\t\tsizeFactorY.setVal(tmpVal);\n\t\t\tgWind->setAcceleration((sizeFactorX.getVal()*0.01f), (sizeFactorY.getVal()*0.01f), (sizeFactorZ.getVal()*0.01f));\n\t\t}\n\n\t\telse if(size >= 6 && strncmp(receivedChars, \"winZ\", 4) == 0)\n\t\t{\n\t\t\t\/\/We need an int.\n\t\t\tint tmpVal = atoi(receivedChars + 5);\n \t\t\tsizeFactorZ.setVal(tmpVal);\n\t\t\tgWind->setAcceleration((sizeFactorX.getVal()*0.01f), (sizeFactorY.getVal()*0.01f), (sizeFactorZ.getVal()*0.01f));\n\t\t}\n\t\telse if(size >= 6 && strncmp(receivedChars, \"vorX\", 4) == 0)\n\t\t{\n\t\t\t\/\/We need an int.\n\t\t\tint tmpVal = atoi(receivedChars + 5);\n\t\t\tgTurbine->setForce((tmpVal*0.01f), (tmpVal*0.01f), (tmpVal*0.01f));\n\t\t}\n\n\t\telse if(size >= 6 && strncmp(receivedChars, \"vorY\", 4) == 0)\n\t\t{\n\t\t\t\/\/We need an int.\n\t\t\tint tmpVal = atoi(receivedChars + 5);\n\t\t\tvortFactorY.setVal(tmpVal);\n\t\t\tgTurbine->setForce((vortFactorX.getVal()*0.01f), (vortFactorY.getVal()*0.01f), (vortFactorZ.getVal()*0.01f));\n\t\t}\n\n\t\telse if(size >= 6 && strncmp(receivedChars, \"vorZ\", 4) == 0)\n\t\t{\n\t\t\t\/\/We need an int.\n\t\t\tint tmpVal = atoi(receivedChars + 5);\n\t\t\tvortFactorZ.setVal(tmpVal);\n\t\t\tgTurbine->setForce((vortFactorX.getVal()*0.01f), (vortFactorY.getVal()*0.01f), (vortFactorZ.getVal()*0.01f));\n\t\t}\n\n\t\telse if(size >= 6 && strncmp(receivedChars, \"posX\", 4) == 0)\n\t\t{\n\t\t\t\/\/We need an int.\n\t\t\tint tmpVal = atoi(receivedChars + 5);\n\t\t\tpositionX.setVal(tmpVal);\n\t\t\tgTurbine->setPosition((positionX.getVal()*0.01f),(positionZ.getVal()*0.01f));\n\t\t}\n\n\t\telse if(size >= 6 && strncmp(receivedChars, \"posZ\", 4) == 0)\n\t\t{\n\t\t\t\/\/We need an int.\n\t\t\tint tmpVal = atoi(receivedChars + 5);\n\t\t\tpositionZ.setVal(tmpVal);\n\t\t\tgTurbine->setPosition((positionX.getVal()*0.01f),(positionZ.getVal()*0.01f));\n\t\t}\n\n\t\telse if(size >= 6 && strncmp(receivedChars, \"radi\", 4) == 0)\n\t\t{\n\t\t\t\/\/We need an int.\n\t\t\tint tmpVal = atoi(receivedChars + 5);\n\t\t\tradius.setVal(tmpVal);\n\t\t\tgTurbine->setRadius(radius.getVal());\n\t\t}\n\n\t\telse if(size >= 6 && strncmp(receivedChars, \"paus\", 4) == 0)\n\t\t{\n\t\t\tgParticles->togglePause();\n\t\t}\n\n\t\telse if(size >= 6 && strncmp(receivedChars, \"grav\", 4) == 0)\n\t\t{\n\t\t\t\/\/We need an int.\n\t\t\tint tmpVal = atoi(receivedChars + 5);\n\t\t\tgGrav->init(-tmpVal);\n\t\t}\n\n\t\telse if(strncmp(receivedChars, \"fade\", 1) == 0)\n\t\t{\n\t\t\tfloat tmpVal = atof(receivedChars + 5);\n\t\t\tfadeDistance.setVal(tmpVal);\n\t\t\tgParticles->setFadeDistance(fadeDistance.getVal());\n\t\t}\n\n\t\telse if(size >= 6 && strncmp(receivedChars, \"disp\", 4) == 0)\n\t\t{\n\t\t\t\/\/gDisplayInfo = !gDisplayInfo;\n\t\t}\n\n\t\telse if(size >= 6 && strncmp(receivedChars, \"stat\", 4) == 0)\n\t\t{\n\t\t\t\/\/gStatsGraph = !gStatsGraph;\n\t\t}\n\n\t\telse if(size >= 6 && strncmp(receivedChars, \"wire\", 4) == 0)\n\t\t{\n\t\t\t\/\/gWireframe = !gWireframe;\n\t\t}\n\t}\n}\n<commit_msg>minor fix for fadedistance<commit_after>#include \"sgct.h\"\n#include \"ParticleSystem.h\"\n#include \"Snow.h\"\n#include \"World.h\"\n#include \"HelperFunctions.h\"\n#include \"Field.h\"\n#include \"DebugField.h\"\n#include \"Gravity.h\"\n#include \"Wind.h\"\n#include \"ObjSystem.h\"\n#include \"SoapBubble.h\"\n#include \"Vortex.h\"\n#include <iostream>\n#include \"SimplexNoise.h\"\n\n\/\/our beautiful global variables\nsgct::Engine* gEngine;\nSnow* gParticles;\nWorld* gWorld;\nObject* road;\nObject* tree;\nSoapBubble* gBubble;\nWind* gWind;\nGravity* gGrav;\nVortex* gTurbine;\n\nbool gDisplayInfo;\nbool gStatsGraph;\nbool gWireframe;\n\nsgct::SharedDouble curr_time(0.0);\nsgct::SharedDouble sizeFactorX(0.0);\nsgct::SharedDouble sizeFactorY(0.0);\nsgct::SharedDouble sizeFactorZ(0.0);\nsgct::SharedDouble vortFactorX(0.0);\nsgct::SharedDouble vortFactorY(0.0);\nsgct::SharedDouble vortFactorZ(0.0);\nsgct::SharedDouble positionX(0.0);\nsgct::SharedDouble positionZ(0.0);\nsgct::SharedDouble radius(0.0);\nsgct::SharedDouble fadeDistance(0.0);\n\n\nvoid initialize();\nvoid draw();\nvoid myPreSyncFun();\nvoid statsDrawFun();\nvoid myEncodeFun();\nvoid myDecodeFun();\nvoid externalControlCallback(const char * receivedChars, int size, int clientId);\nvoid sendMessageToExternalControl(void * data, int length);\n\n\nint main(int argc, char *argv[])\n{\n\tinitRandom();\n\n\tgEngine = new sgct::Engine(argc, argv);\n\n\tgEngine->setInitOGLFunction(initialize);\n\tgEngine->setDrawFunction(draw);\n\tgEngine->setPreSyncFunction(myPreSyncFun);\n\tgEngine->setPostSyncPreDrawFunction(statsDrawFun);\n\tgEngine->setExternalControlCallback(externalControlCallback);\n\tsgct::SharedData::instance()->setEncodeFunction(myEncodeFun);\n\tsgct::SharedData::instance()->setDecodeFunction(myDecodeFun);\n\n\tgParticles = new Snow(gEngine);\n\tgWorld = new World(gEngine);\n\n\tgBubble = new SoapBubble(gEngine);\n\n\troad = new Object(gEngine);\n\ttree = new Object(gEngine);\n\n\tgGrav = new Gravity();\n\tgGrav->init(-9.81f);\n\tgParticles->addField(gGrav);\n\n\n\tgWind = new Wind();\n\t\/\/wind->init(getRandom(-0.2, 0.2), 0.0f, getRandom(-0.2, 0.2));\n\tgWind->setAcceleration(getRandom(-0.2, 0.2), 0.0f, getRandom(-0.2, 0.2));\n\tgParticles->addField(gWind);\n\n\tgTurbine = new Vortex();\n\tgTurbine->init(0.0f, 0.0f, 0.0f);\n\tgParticles->addField(gTurbine);\n\n\tif(!gEngine->init(sgct::Engine::OpenGL_3_3_Core_Profile))\n\t{\n\t\tdelete gEngine;\n\t\treturn EXIT_FAILURE;\n\t}\n\n\t\/\/Not working yet... :(\n\tSimplexNoise* noise = new SimplexNoise();\n\tnoise->init(glm::vec3(0), glm::vec3(0), gEngine->getTime());\n\n\t\/\/ gParticles->addField(noise);\n\n\tcout << \"---- Fields active on gParticles ----\" << endl;\n\tgParticles->printFields();\n\tcout << \"---------------\" << endl << endl;\n\n\tgEngine->render();\n\n\tgParticles->destroy();\n\troad->deleteObject();\n\tdelete road;\n\tdelete gEngine;\n\tdelete gParticles;\n\tdelete gWorld;\n\tdelete gBubble;\n\tdelete gWind;\n\tdelete gTurbine;\n\n\texit(EXIT_SUCCESS);\n}\n\nvoid initialize()\n{\n\tif(!gParticles->initialize())\n\t{\n\t\tstd::cout << \"Error Initialzing Particle System:\" << std::endl;\n\t\texit(EXIT_FAILURE);\n\t}\n\tgWorld->initializeWorld();\n\n\troad->loadObj(\"road\/road.obj\", \"road\/road.png\");\n\troad->scale(0.2f,0.2f,0.2f);\n\troad->translate(0.0f, -2.0f, 5.0f);\n\n\ttree->loadObj(\"road\/tree.obj\",\"road\/tree.png\");\n\ttree->scale(0.05f,0.05f,0.05f);\n\ttree->translate(0.0f, -1.0f, -6.0f);\n\n\tgBubble->createSphere(1.5f, 100);\n\n\n\tgDisplayInfo = false;\n\tgStatsGraph = false;\n\tgWireframe = false;\n}\n\nvoid draw()\n{\n\tdouble delta = gEngine->getDt();\n\tgWorld->drawWorld();\n\tgBubble->drawBubble();\n\troad->draw();\n\ttree->draw();\n\tgParticles->move(delta);\n\tgParticles->draw(delta);\n\n\t\/\/if(gEngine->isExternalControlConnected())\n\t\/\/\tcout << \"Connectad is very nice\";\n}\n\n\/\/Checking the time since the program started, not sure if we need this either.\nvoid myPreSyncFun()\n{\n\t\/\/Checks so the gEnginenode is actually the master.\n\tif( gEngine->isMaster() )\n\t{\n\t\t\/\/Sets the current time since the program started\n\t\tcurr_time.setVal(sgct::Engine::getTime());\n\t}\n}\n\nvoid myEncodeFun()\n{\n\tsgct::SharedData::instance()->writeDouble(&curr_time);\n \tsgct::SharedData::instance()->writeDouble(&sizeFactorX);\n \tsgct::SharedData::instance()->writeDouble(&sizeFactorY);\n \tsgct::SharedData::instance()->writeDouble(&sizeFactorZ);\n \tsgct::SharedData::instance()->writeDouble(&vortFactorX);\n \tsgct::SharedData::instance()->writeDouble(&vortFactorY);\n \tsgct::SharedData::instance()->writeDouble(&vortFactorZ);\n \tsgct::SharedData::instance()->writeDouble(&positionX);\n \tsgct::SharedData::instance()->writeDouble(&positionZ);\n \tsgct::SharedData::instance()->writeDouble(&radius);\n \tsgct::SharedData::instance()->writeDouble(&fadeDistance);\n\n}\n\n\nvoid myDecodeFun()\n{\n\tsgct::SharedData::instance()->readDouble(&curr_time);\n\tsgct::SharedData::instance()->readDouble(&sizeFactorX);\n\tsgct::SharedData::instance()->readDouble(&sizeFactorY);\n\tsgct::SharedData::instance()->readDouble(&sizeFactorZ);\n\tsgct::SharedData::instance()->readDouble(&vortFactorX);\n\tsgct::SharedData::instance()->readDouble(&vortFactorY);\n\tsgct::SharedData::instance()->readDouble(&vortFactorZ);\n\tsgct::SharedData::instance()->readDouble(&positionX);\n\tsgct::SharedData::instance()->readDouble(&positionZ);\n\tsgct::SharedData::instance()->readDouble(&radius);\n\tsgct::SharedData::instance()->readDouble(&fadeDistance);\n}\n\n\/\/Shows stats and graph depending on if the variables are true or not. Dont know if we need this? Currently set to false.\nvoid statsDrawFun()\n{\n\tgEngine->setDisplayInfoVisibility(gDisplayInfo);\n\tgEngine->setStatsGraphVisibility(gStatsGraph);\n\tgEngine->setWireframe(gWireframe);\n}\n\n\/\/Used to alter certain values when sent from GUI. This way we can alter the fields or change gravity in realtime!\nvoid externalControlCallback(const char * receivedChars, int size, int clientId)\n{\n\t\/\/Checks so the gEnginenode is actually the master.\n\tif(gEngine->isMaster())\n\t{\n\t\tif(size >= 6 && strncmp(receivedChars, \"winX\", 4) == 0)\n\t\t{\n\t\t\t\/\/We need an int.\n \t\t\tint tmpVal = atof(receivedChars + 5);\n \t\t\tsizeFactorX.setVal(tmpVal);\n\t\t\tgWind->setAcceleration((sizeFactorX.getVal()*0.01f), (sizeFactorY.getVal()*0.01f), (sizeFactorZ.getVal()*0.01f));\n\n\t\t}\n\n\t\telse if(size >= 6 && strncmp(receivedChars, \"winY\", 4) == 0)\n\t\t{\n\t\t\t\/\/We need an int.\n\t\t\tint tmpVal = atof(receivedChars + 5);\n \t\t\tsizeFactorY.setVal(tmpVal);\n\t\t\tgWind->setAcceleration((sizeFactorX.getVal()*0.01f), (sizeFactorY.getVal()*0.01f), (sizeFactorZ.getVal()*0.01f));\n\t\t}\n\n\t\telse if(size >= 6 && strncmp(receivedChars, \"winZ\", 4) == 0)\n\t\t{\n\t\t\t\/\/We need an int.\n\t\t\tint tmpVal = atoi(receivedChars + 5);\n \t\t\tsizeFactorZ.setVal(tmpVal);\n\t\t\tgWind->setAcceleration((sizeFactorX.getVal()*0.01f), (sizeFactorY.getVal()*0.01f), (sizeFactorZ.getVal()*0.01f));\n\t\t}\n\t\telse if(size >= 6 && strncmp(receivedChars, \"vorX\", 4) == 0)\n\t\t{\n\t\t\t\/\/We need an int.\n\t\t\tint tmpVal = atoi(receivedChars + 5);\n\t\t\tgTurbine->setForce((tmpVal*0.01f), (tmpVal*0.01f), (tmpVal*0.01f));\n\t\t}\n\n\t\telse if(size >= 6 && strncmp(receivedChars, \"vorY\", 4) == 0)\n\t\t{\n\t\t\t\/\/We need an int.\n\t\t\tint tmpVal = atoi(receivedChars + 5);\n\t\t\tvortFactorY.setVal(tmpVal);\n\t\t\tgTurbine->setForce((vortFactorX.getVal()*0.01f), (vortFactorY.getVal()*0.01f), (vortFactorZ.getVal()*0.01f));\n\t\t}\n\n\t\telse if(size >= 6 && strncmp(receivedChars, \"vorZ\", 4) == 0)\n\t\t{\n\t\t\t\/\/We need an int.\n\t\t\tint tmpVal = atoi(receivedChars + 5);\n\t\t\tvortFactorZ.setVal(tmpVal);\n\t\t\tgTurbine->setForce((vortFactorX.getVal()*0.01f), (vortFactorY.getVal()*0.01f), (vortFactorZ.getVal()*0.01f));\n\t\t}\n\n\t\telse if(size >= 6 && strncmp(receivedChars, \"posX\", 4) == 0)\n\t\t{\n\t\t\t\/\/We need an int.\n\t\t\tint tmpVal = atoi(receivedChars + 5);\n\t\t\tpositionX.setVal(tmpVal);\n\t\t\tgTurbine->setPosition((positionX.getVal()*0.01f),(positionZ.getVal()*0.01f));\n\t\t}\n\n\t\telse if(size >= 6 && strncmp(receivedChars, \"posZ\", 4) == 0)\n\t\t{\n\t\t\t\/\/We need an int.\n\t\t\tint tmpVal = atoi(receivedChars + 5);\n\t\t\tpositionZ.setVal(tmpVal);\n\t\t\tgTurbine->setPosition((positionX.getVal()*0.01f),(positionZ.getVal()*0.01f));\n\t\t}\n\n\t\telse if(size >= 6 && strncmp(receivedChars, \"radi\", 4) == 0)\n\t\t{\n\t\t\t\/\/We need an int.\n\t\t\tint tmpVal = atoi(receivedChars + 5);\n\t\t\tradius.setVal(tmpVal);\n\t\t\tgTurbine->setRadius(radius.getVal());\n\t\t}\n\n\t\telse if(size >= 6 && strncmp(receivedChars, \"paus\", 4) == 0)\n\t\t{\n\t\t\tgParticles->togglePause();\n\t\t}\n\n\t\telse if(size >= 6 && strncmp(receivedChars, \"grav\", 4) == 0)\n\t\t{\n\t\t\t\/\/We need an int.\n\t\t\tint tmpVal = atoi(receivedChars + 5);\n\t\t\tgGrav->init(-tmpVal);\n\t\t}\n\n\t\telse if(size >= strncmp(receivedChars, \"fade\", 4) == 0)\n\t\t{\n\t\t\tfloat tmpVal = atof(receivedChars + 5);\n\t\t\tfadeDistance.setVal(tmpVal);\n\t\t\tgParticles->setFadeDistance(fadeDistance.getVal());\n\t\t}\n\n\t\telse if(size >= 6 && strncmp(receivedChars, \"disp\", 4) == 0)\n\t\t{\n\t\t\tgDisplayInfo = !gDisplayInfo;\n\t\t}\n\n\t\telse if(size >= 6 && strncmp(receivedChars, \"stat\", 4) == 0)\n\t\t{\n\t\t\tgStatsGraph = !gStatsGraph;\n\t\t}\n\n\t\telse if(size >= 6 && strncmp(receivedChars, \"wire\", 4) == 0)\n\t\t{\n\t\t\tgWireframe = !gWireframe;\n\t\t}\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>44e86335-2e4f-11e5-9d4c-28cfe91dbc4b<commit_msg>44efca9c-2e4f-11e5-be42-28cfe91dbc4b<commit_after>44efca9c-2e4f-11e5-be42-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>67722e26-ad59-11e7-9f97-ac87a332f658<commit_msg>this is my first commit?<commit_after>680b7873-ad59-11e7-bcff-ac87a332f658<|endoftext|>"}
{"text":"<commit_before>e2470e63-2e4e-11e5-80a2-28cfe91dbc4b<commit_msg>e2522363-2e4e-11e5-ac36-28cfe91dbc4b<commit_after>e2522363-2e4e-11e5-ac36-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright © 2008, 2009 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#include <cstdlib>\n#include <cstdio>\n#include <getopt.h>\n\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <unistd.h>\n\n#include \"ast.h\"\n#include \"glsl_parser_extras.h\"\n#include \"glsl_parser.h\"\n#include \"ir_optimization.h\"\n#include \"ir_print_visitor.h\"\n#include \"program.h\"\n\n\nstatic char *\nload_text_file(const char *file_name, size_t *size)\n{\n\tchar *text = NULL;\n\tstruct stat st;\n\tssize_t total_read = 0;\n\tint fd = open(file_name, O_RDONLY);\n\n\t*size = 0;\n\tif (fd < 0) {\n\t\treturn NULL;\n\t}\n\n\tif (fstat(fd, & st) == 0) {\n\t   text = (char *) malloc(st.st_size + 1);\n\t\tif (text != NULL) {\n\t\t\tdo {\n\t\t\t\tssize_t bytes = read(fd, text + total_read,\n\t\t\t\t\t\t     st.st_size - total_read);\n\t\t\t\tif (bytes < 0) {\n\t\t\t\t\tfree(text);\n\t\t\t\t\ttext = NULL;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tif (bytes == 0) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\ttotal_read += bytes;\n\t\t\t} while (total_read < st.st_size);\n\n\t\t\ttext[total_read] = '\\0';\n\t\t\t*size = total_read;\n\t\t}\n\t}\n\n\tclose(fd);\n\n\treturn text;\n}\n\n\nvoid\nusage_fail(const char *name)\n{\n      printf(\"%s <filename.frag|filename.vert>\\n\", name);\n      exit(EXIT_FAILURE);\n}\n\n\nint dump_ast = 0;\nint dump_lir = 0;\nint do_link = 0;\n\nconst struct option compiler_opts[] = {\n   { \"dump-ast\", 0, &dump_ast, 1 },\n   { \"dump-lir\", 0, &dump_lir, 1 },\n   { \"link\",     0, &do_link,  1 },\n   { NULL, 0, NULL, 0 }\n};\n\nvoid\ncompile_shader(struct glsl_shader *shader)\n{\n   struct _mesa_glsl_parse_state *state;\n\n   state = talloc_zero(talloc_parent(shader), struct _mesa_glsl_parse_state);\n\n   switch (shader->Type) {\n   case GL_VERTEX_SHADER:   state->target = vertex_shader; break;\n   case GL_FRAGMENT_SHADER: state->target = fragment_shader; break;\n   case GL_GEOMETRY_SHADER: state->target = geometry_shader; break;\n   }\n\n   state->scanner = NULL;\n   state->translation_unit.make_empty();\n   state->symbols = new(shader) glsl_symbol_table;\n   state->info_log = talloc_strdup(shader, \"\");\n   state->error = false;\n   state->temp_index = 0;\n   state->loop_or_switch_nesting = NULL;\n   state->ARB_texture_rectangle_enable = true;\n\n   \/* Create a new context for the preprocessor output.  Ultimately, this\n    * should probably be the parser context, but there isn't one yet.\n   *\/\n   const char *source = shader->Source;\n   state->error = preprocess(shader, &source, &state->info_log);\n\n   if (!state->error) {\n      _mesa_glsl_lexer_ctor(state, source);\n      _mesa_glsl_parse(state);\n      _mesa_glsl_lexer_dtor(state);\n   }\n\n   if (dump_ast) {\n      foreach_list_const(n, &state->translation_unit) {\n\t ast_node *ast = exec_node_data(ast_node, n, link);\n\t ast->print();\n      }\n      printf(\"\\n\\n\");\n   }\n\n   shader->ir.make_empty();\n   if (!state->error && !state->translation_unit.is_empty())\n      _mesa_ast_to_hir(&shader->ir, state);\n\n   validate_ir_tree(&shader->ir);\n\n   \/* Optimization passes *\/\n   if (!state->error && !shader->ir.is_empty()) {\n      bool progress;\n      do {\n\t progress = false;\n\n\t progress = do_function_inlining(&shader->ir) || progress;\n\t progress = do_if_simplification(&shader->ir) || progress;\n\t progress = do_copy_propagation(&shader->ir) || progress;\n\t progress = do_dead_code_local(&shader->ir) || progress;\n\t progress = do_dead_code_unlinked(&shader->ir) || progress;\n\t progress = do_constant_variable_unlinked(&shader->ir) || progress;\n\t progress = do_constant_folding(&shader->ir) || progress;\n\t progress = do_vec_index_to_swizzle(&shader->ir) || progress;\n\t progress = do_swizzle_swizzle(&shader->ir) || progress;\n      } while (progress);\n   }\n\n   validate_ir_tree(&shader->ir);\n\n   \/* Print out the resulting IR *\/\n   if (!state->error && dump_lir) {\n      _mesa_print_ir(&shader->ir, state);\n   }\n\n   shader->symbols = state->symbols;\n   shader->CompileStatus = !state->error;\n\n   if (shader->InfoLog)\n      talloc_free(shader->InfoLog);\n\n   shader->InfoLog = state->info_log;\n\n   talloc_free(state);\n\n   return;\n}\n\nint\nmain(int argc, char **argv)\n{\n   int status = EXIT_SUCCESS;\n\n   int c;\n   int idx = 0;\n   while ((c = getopt_long(argc, argv, \"\", compiler_opts, &idx)) != -1)\n      \/* empty *\/ ;\n\n\n   if (argc <= optind)\n      usage_fail(argv[0]);\n\n   struct glsl_program *whole_program;\n\n   whole_program = talloc_zero (NULL, struct glsl_program);\n   assert(whole_program != NULL);\n\n   for (\/* empty *\/; argc > optind; optind++) {\n      whole_program->Shaders = (struct glsl_shader **)\n\t realloc(whole_program->Shaders,\n\t\t sizeof(struct glsl_shader *) * (whole_program->NumShaders + 1));\n      assert(whole_program->Shaders != NULL);\n\n      struct glsl_shader *shader = talloc_zero(whole_program, glsl_shader);\n\n      whole_program->Shaders[whole_program->NumShaders] = shader;\n      whole_program->NumShaders++;\n\n      const unsigned len = strlen(argv[optind]);\n      if (len < 6)\n\t usage_fail(argv[0]);\n\n      const char *const ext = & argv[optind][len - 5];\n      if (strncmp(\".vert\", ext, 5) == 0)\n\t shader->Type = GL_VERTEX_SHADER;\n      else if (strncmp(\".geom\", ext, 5) == 0)\n\t shader->Type = GL_GEOMETRY_SHADER;\n      else if (strncmp(\".frag\", ext, 5) == 0)\n\t shader->Type = GL_FRAGMENT_SHADER;\n      else\n\t usage_fail(argv[0]);\n\n      shader->Source = load_text_file(argv[optind], &shader->SourceLen);\n      if (shader->Source == NULL) {\n\t printf(\"File \\\"%s\\\" does not exist.\\n\", argv[optind]);\n\t exit(EXIT_FAILURE);\n      }\n\n      compile_shader(shader);\n\n      if (!shader->CompileStatus) {\n\t printf(\"Info log for %s:\\n%s\\n\", argv[optind], shader->InfoLog);\n\t status = EXIT_FAILURE;\n\t break;\n      }\n   }\n\n   if ((status == EXIT_SUCCESS) && do_link)  {\n      link_shaders(whole_program);\n      status = (whole_program->LinkStatus) ? EXIT_SUCCESS : EXIT_FAILURE;\n   }\n\n   talloc_free(whole_program);\n\n   return status;\n}\n<commit_msg>main: Close memory leak of shader string from load_text_file.<commit_after>\/*\n * Copyright © 2008, 2009 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#include <cstdlib>\n#include <cstdio>\n#include <getopt.h>\n\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <unistd.h>\n\n#include \"ast.h\"\n#include \"glsl_parser_extras.h\"\n#include \"glsl_parser.h\"\n#include \"ir_optimization.h\"\n#include \"ir_print_visitor.h\"\n#include \"program.h\"\n\n\/* Returned string will have 'ctx' as its talloc owner. *\/\nstatic char *\nload_text_file(void *ctx, const char *file_name, size_t *size)\n{\n\tchar *text = NULL;\n\tstruct stat st;\n\tssize_t total_read = 0;\n\tint fd = open(file_name, O_RDONLY);\n\n\t*size = 0;\n\tif (fd < 0) {\n\t\treturn NULL;\n\t}\n\n\tif (fstat(fd, & st) == 0) {\n\t   text = (char *) talloc_size(ctx, st.st_size + 1);\n\t\tif (text != NULL) {\n\t\t\tdo {\n\t\t\t\tssize_t bytes = read(fd, text + total_read,\n\t\t\t\t\t\t     st.st_size - total_read);\n\t\t\t\tif (bytes < 0) {\n\t\t\t\t\tfree(text);\n\t\t\t\t\ttext = NULL;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tif (bytes == 0) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\ttotal_read += bytes;\n\t\t\t} while (total_read < st.st_size);\n\n\t\t\ttext[total_read] = '\\0';\n\t\t\t*size = total_read;\n\t\t}\n\t}\n\n\tclose(fd);\n\n\treturn text;\n}\n\n\nvoid\nusage_fail(const char *name)\n{\n      printf(\"%s <filename.frag|filename.vert>\\n\", name);\n      exit(EXIT_FAILURE);\n}\n\n\nint dump_ast = 0;\nint dump_lir = 0;\nint do_link = 0;\n\nconst struct option compiler_opts[] = {\n   { \"dump-ast\", 0, &dump_ast, 1 },\n   { \"dump-lir\", 0, &dump_lir, 1 },\n   { \"link\",     0, &do_link,  1 },\n   { NULL, 0, NULL, 0 }\n};\n\nvoid\ncompile_shader(struct glsl_shader *shader)\n{\n   struct _mesa_glsl_parse_state *state;\n\n   state = talloc_zero(talloc_parent(shader), struct _mesa_glsl_parse_state);\n\n   switch (shader->Type) {\n   case GL_VERTEX_SHADER:   state->target = vertex_shader; break;\n   case GL_FRAGMENT_SHADER: state->target = fragment_shader; break;\n   case GL_GEOMETRY_SHADER: state->target = geometry_shader; break;\n   }\n\n   state->scanner = NULL;\n   state->translation_unit.make_empty();\n   state->symbols = new(shader) glsl_symbol_table;\n   state->info_log = talloc_strdup(shader, \"\");\n   state->error = false;\n   state->temp_index = 0;\n   state->loop_or_switch_nesting = NULL;\n   state->ARB_texture_rectangle_enable = true;\n\n   \/* Create a new context for the preprocessor output.  Ultimately, this\n    * should probably be the parser context, but there isn't one yet.\n   *\/\n   const char *source = shader->Source;\n   state->error = preprocess(shader, &source, &state->info_log);\n\n   if (!state->error) {\n      _mesa_glsl_lexer_ctor(state, source);\n      _mesa_glsl_parse(state);\n      _mesa_glsl_lexer_dtor(state);\n   }\n\n   if (dump_ast) {\n      foreach_list_const(n, &state->translation_unit) {\n\t ast_node *ast = exec_node_data(ast_node, n, link);\n\t ast->print();\n      }\n      printf(\"\\n\\n\");\n   }\n\n   shader->ir.make_empty();\n   if (!state->error && !state->translation_unit.is_empty())\n      _mesa_ast_to_hir(&shader->ir, state);\n\n   validate_ir_tree(&shader->ir);\n\n   \/* Optimization passes *\/\n   if (!state->error && !shader->ir.is_empty()) {\n      bool progress;\n      do {\n\t progress = false;\n\n\t progress = do_function_inlining(&shader->ir) || progress;\n\t progress = do_if_simplification(&shader->ir) || progress;\n\t progress = do_copy_propagation(&shader->ir) || progress;\n\t progress = do_dead_code_local(&shader->ir) || progress;\n\t progress = do_dead_code_unlinked(&shader->ir) || progress;\n\t progress = do_constant_variable_unlinked(&shader->ir) || progress;\n\t progress = do_constant_folding(&shader->ir) || progress;\n\t progress = do_vec_index_to_swizzle(&shader->ir) || progress;\n\t progress = do_swizzle_swizzle(&shader->ir) || progress;\n      } while (progress);\n   }\n\n   validate_ir_tree(&shader->ir);\n\n   \/* Print out the resulting IR *\/\n   if (!state->error && dump_lir) {\n      _mesa_print_ir(&shader->ir, state);\n   }\n\n   shader->symbols = state->symbols;\n   shader->CompileStatus = !state->error;\n\n   if (shader->InfoLog)\n      talloc_free(shader->InfoLog);\n\n   shader->InfoLog = state->info_log;\n\n   talloc_free(state);\n\n   return;\n}\n\nint\nmain(int argc, char **argv)\n{\n   int status = EXIT_SUCCESS;\n\n   int c;\n   int idx = 0;\n   while ((c = getopt_long(argc, argv, \"\", compiler_opts, &idx)) != -1)\n      \/* empty *\/ ;\n\n\n   if (argc <= optind)\n      usage_fail(argv[0]);\n\n   struct glsl_program *whole_program;\n\n   whole_program = talloc_zero (NULL, struct glsl_program);\n   assert(whole_program != NULL);\n\n   for (\/* empty *\/; argc > optind; optind++) {\n      whole_program->Shaders = (struct glsl_shader **)\n\t realloc(whole_program->Shaders,\n\t\t sizeof(struct glsl_shader *) * (whole_program->NumShaders + 1));\n      assert(whole_program->Shaders != NULL);\n\n      struct glsl_shader *shader = talloc_zero(whole_program, glsl_shader);\n\n      whole_program->Shaders[whole_program->NumShaders] = shader;\n      whole_program->NumShaders++;\n\n      const unsigned len = strlen(argv[optind]);\n      if (len < 6)\n\t usage_fail(argv[0]);\n\n      const char *const ext = & argv[optind][len - 5];\n      if (strncmp(\".vert\", ext, 5) == 0)\n\t shader->Type = GL_VERTEX_SHADER;\n      else if (strncmp(\".geom\", ext, 5) == 0)\n\t shader->Type = GL_GEOMETRY_SHADER;\n      else if (strncmp(\".frag\", ext, 5) == 0)\n\t shader->Type = GL_FRAGMENT_SHADER;\n      else\n\t usage_fail(argv[0]);\n\n      shader->Source = load_text_file(whole_program,\n\t\t\t\t      argv[optind], &shader->SourceLen);\n      if (shader->Source == NULL) {\n\t printf(\"File \\\"%s\\\" does not exist.\\n\", argv[optind]);\n\t exit(EXIT_FAILURE);\n      }\n\n      compile_shader(shader);\n\n      if (!shader->CompileStatus) {\n\t printf(\"Info log for %s:\\n%s\\n\", argv[optind], shader->InfoLog);\n\t status = EXIT_FAILURE;\n\t break;\n      }\n   }\n\n   if ((status == EXIT_SUCCESS) && do_link)  {\n      link_shaders(whole_program);\n      status = (whole_program->LinkStatus) ? EXIT_SUCCESS : EXIT_FAILURE;\n   }\n\n   talloc_free(whole_program);\n\n   return status;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\r\n\/\/ Copyright (c) 2008-2013 the Urho3D project.\r\n\/\/\r\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\r\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\r\n\/\/ in the Software without restriction, including without limitation the rights\r\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\r\n\/\/ copies of the Software, and to permit persons to whom the Software is\r\n\/\/ furnished to do so, subject to the following conditions:\r\n\/\/\r\n\/\/ The above copyright notice and this permission notice shall be included in\r\n\/\/ all copies or substantial portions of the Software.\r\n\/\/\r\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\n\/\/ THE SOFTWARE.\r\n\/\/\r\n\r\n#include \"Precompiled.h\"\r\n#include \"Context.h\"\r\n#include \"Cursor.h\"\r\n#include \"InputEvents.h\"\r\n#include \"UI.h\"\r\n#include \"UIEvents.h\"\r\n#include \"Window.h\"\r\n\r\n#include \"DebugNew.h\"\r\n\r\nnamespace Urho3D\r\n{\r\n\r\nstatic const int DEFAULT_RESIZE_BORDER = 4;\r\n\r\nextern const char* UI_CATEGORY;\r\n\r\nOBJECTTYPESTATIC(Window);\r\n\r\nWindow::Window(Context* context) :\r\n    BorderImage(context),\r\n    movable_(false),\r\n    resizable_(false),\r\n    resizeBorder_(DEFAULT_RESIZE_BORDER, DEFAULT_RESIZE_BORDER, DEFAULT_RESIZE_BORDER, DEFAULT_RESIZE_BORDER),\r\n    dragMode_(DRAG_NONE),\r\n    modal_(false),\r\n    modalShadeColor_(Color::TRANSPARENT),\r\n    modalFrameColor_(Color::TRANSPARENT),\r\n    modalFrameSize_(IntVector2::ZERO)\r\n\r\n{\r\n    bringToFront_ = true;\r\n    clipChildren_ = true;\r\n    enabled_ = true;\r\n}\r\n\r\nWindow::~Window()\r\n{\r\n}\r\n\r\nvoid Window::RegisterObject(Context* context)\r\n{\r\n    context->RegisterFactory<Window>(UI_CATEGORY);\r\n\r\n    COPY_BASE_ATTRIBUTES(Window, BorderImage);\r\n    UPDATE_ATTRIBUTE_DEFAULT_VALUE(Window, \"Bring To Front\", true);\r\n    UPDATE_ATTRIBUTE_DEFAULT_VALUE(Window, \"Clip Children\", true);\r\n    UPDATE_ATTRIBUTE_DEFAULT_VALUE(Window, \"Is Enabled\", true);\r\n    REF_ACCESSOR_ATTRIBUTE(Window, VAR_INTRECT, \"Resize Border\", GetResizeBorder, SetResizeBorder, IntRect, IntRect(DEFAULT_RESIZE_BORDER, \\\r\n        DEFAULT_RESIZE_BORDER, DEFAULT_RESIZE_BORDER, DEFAULT_RESIZE_BORDER), AM_FILE);\r\n    ACCESSOR_ATTRIBUTE(Window, VAR_BOOL, \"Is Movable\", IsMovable, SetMovable, bool, false, AM_FILE);\r\n    ACCESSOR_ATTRIBUTE(Window, VAR_BOOL, \"Is Resizable\", IsResizable, SetResizable, bool, false, AM_FILE);\r\n    ACCESSOR_ATTRIBUTE(Window, VAR_BOOL, \"Is Modal\", IsModal, SetModal, bool, false, AM_FILE);\r\n    REF_ACCESSOR_ATTRIBUTE(Window, VAR_COLOR, \"Modal Shade Color\", GetModalShadeColor, SetModalShadeColor, Color, Color::TRANSPARENT, AM_FILE);\r\n    REF_ACCESSOR_ATTRIBUTE(Window, VAR_COLOR, \"Modal Frame Color\", GetModalFrameColor, SetModalFrameColor, Color, Color::TRANSPARENT, AM_FILE);\r\n    REF_ACCESSOR_ATTRIBUTE(Window, VAR_INTVECTOR2, \"Modal Frame Size\", GetModalFrameSize, SetModalFrameSize, IntVector2, IntVector2::ZERO, AM_FILE);\r\n}\r\n\r\nvoid Window::GetBatches(PODVector<UIBatch>& batches, PODVector<float>& vertexData, const IntRect& currentScissor)\r\n{\r\n    if (modal_)\r\n    {\r\n        \/\/ Modal shade\r\n        if (modalShadeColor_ != Color::TRANSPARENT)\r\n        {\r\n            UIElement* rootElement = GetRoot();\r\n            const IntVector2& rootSize = rootElement->GetSize();\r\n            UIBatch batch(rootElement, BLEND_ALPHA, IntRect(0, 0, rootSize.x_, rootSize.y_), 0, &vertexData);\r\n            batch.AddQuad(0, 0, rootSize.x_, rootSize.y_, 0, 0, 0, 0, modalShadeColor_);\r\n            UIBatch::AddOrMerge(batch, batches);\r\n        }\r\n\r\n        \/\/ Modal frame\r\n        if (modalFrameColor_ != Color::TRANSPARENT && modalFrameSize_ != IntVector2::ZERO)\r\n        {\r\n            UIBatch batch(this, BLEND_ALPHA, currentScissor, 0, &vertexData);\r\n            int x = GetIndentWidth();\r\n            IntVector2 size = GetSize();\r\n            size.x_ -= x;\r\n            batch.AddQuad(x - modalFrameSize_.x_, -modalFrameSize_.y_, size.x_ + 2 * modalFrameSize_.x_, size.y_ + 2 * modalFrameSize_.y_, 0, 0, 0, 0, modalFrameColor_);\r\n            UIBatch::AddOrMerge(batch, batches);\r\n        }\r\n    }\r\n\r\n    BorderImage::GetBatches(batches, vertexData, currentScissor);\r\n}\r\n\r\nvoid Window::OnHover(const IntVector2& position, const IntVector2& screenPosition, int buttons, int qualifiers, Cursor* cursor)\r\n{\r\n    if (dragMode_ == DRAG_NONE)\r\n    {\r\n        WindowDragMode mode = GetDragMode(position);\r\n        SetCursorShape(mode, cursor);\r\n    }\r\n    else\r\n        SetCursorShape(dragMode_, cursor);\r\n}\r\n\r\nvoid Window::OnDragBegin(const IntVector2& position, const IntVector2& screenPosition, int buttons, int qualifiers, Cursor* cursor)\r\n{\r\n    if (buttons != MOUSEB_LEFT || !CheckAlignment())\r\n    {\r\n        dragMode_ = DRAG_NONE;\r\n        return;\r\n    }\r\n\r\n    dragBeginCursor_ = screenPosition;\r\n    dragBeginPosition_ = GetPosition();\r\n    dragBeginSize_ = GetSize();\r\n    dragMode_ = GetDragMode(position);\r\n    SetCursorShape(dragMode_, cursor);\r\n}\r\n\r\nvoid Window::OnDragMove(const IntVector2& position, const IntVector2& screenPosition, int buttons, int qualifiers, Cursor* cursor)\r\n{\r\n    if (dragMode_ == DRAG_NONE)\r\n        return;\r\n\r\n    IntVector2 delta = screenPosition - dragBeginCursor_;\r\n\r\n    const IntVector2& position_ = GetPosition();\r\n    const IntVector2& size_ = GetSize();\r\n    const IntVector2& minSize_ = GetMinSize();\r\n    const IntVector2& maxSize_ = GetMaxSize();\r\n\r\n    switch (dragMode_)\r\n    {\r\n    case DRAG_MOVE:\r\n        SetPosition(dragBeginPosition_ + delta);\r\n        break;\r\n\r\n    case DRAG_RESIZE_TOPLEFT:\r\n        SetPosition(Clamp(dragBeginPosition_.x_ + delta.x_, position_.x_ - (maxSize_.x_ - size_.x_), position_.x_ + (size_.x_ - minSize_.x_)),\r\n            Clamp(dragBeginPosition_.y_ + delta.y_, position_.y_ - (maxSize_.y_ - size_.y_), position_.y_ + (size_.y_ - minSize_.y_)));\r\n        SetSize(dragBeginSize_ - delta);\r\n        break;\r\n\r\n    case DRAG_RESIZE_TOP:\r\n        SetPosition(dragBeginPosition_.x_, Clamp(dragBeginPosition_.y_ + delta.y_, position_.y_ - (maxSize_.y_ - size_.y_), position_.y_ + (size_.y_ - minSize_.y_)));\r\n        SetSize(dragBeginSize_.x_, dragBeginSize_.y_ - delta.y_);\r\n        break;\r\n\r\n    case DRAG_RESIZE_TOPRIGHT:\r\n        SetPosition(dragBeginPosition_.x_, dragBeginPosition_.y_ + delta.y_);\r\n        SetSize(dragBeginSize_.x_ + delta.x_, dragBeginSize_.y_ - delta.y_);\r\n        break;\r\n\r\n    case DRAG_RESIZE_RIGHT:\r\n        SetSize(dragBeginSize_.x_ + delta.x_, dragBeginSize_.y_);\r\n        break;\r\n\r\n    case DRAG_RESIZE_BOTTOMRIGHT:\r\n        SetSize(dragBeginSize_ + delta);\r\n        break;\r\n\r\n    case DRAG_RESIZE_BOTTOM:\r\n        SetSize(dragBeginSize_.x_, dragBeginSize_.y_ + delta.y_);\r\n        break;\r\n\r\n    case DRAG_RESIZE_BOTTOMLEFT:\r\n        SetPosition(Clamp(dragBeginPosition_.x_ + delta.x_, position_.x_ - (maxSize_.x_ - size_.x_), position_.x_ + (size_.x_ - minSize_.x_)), dragBeginPosition_.y_);\r\n        SetSize(dragBeginSize_.x_ - delta.x_, dragBeginSize_.y_ + delta.y_);\r\n        break;\r\n\r\n    case DRAG_RESIZE_LEFT:\r\n        SetPosition(Clamp(dragBeginPosition_.x_ + delta.x_, position_.x_ - (maxSize_.x_ - size_.x_), position_.x_ + (size_.x_ - minSize_.x_)), dragBeginPosition_.y_);\r\n        SetSize(dragBeginSize_.x_ - delta.x_, dragBeginSize_.y_);\r\n        break;\r\n\r\n    default:\r\n        break;\r\n    }\r\n\r\n    ValidatePosition();\r\n    SetCursorShape(dragMode_, cursor);\r\n}\r\n\r\nvoid Window::OnDragEnd(const IntVector2& position, const IntVector2& screenPosition, Cursor* cursor)\r\n{\r\n    dragMode_ = DRAG_NONE;\r\n}\r\n\r\nvoid Window::SetMovable(bool enable)\r\n{\r\n    movable_ = enable;\r\n}\r\n\r\nvoid Window::SetResizable(bool enable)\r\n{\r\n    resizable_ = enable;\r\n}\r\n\r\nvoid Window::SetResizeBorder(const IntRect& rect)\r\n{\r\n    resizeBorder_.left_ = Max(rect.left_, 0);\r\n    resizeBorder_.top_ = Max(rect.top_, 0);\r\n    resizeBorder_.right_ = Max(rect.right_, 0);\r\n    resizeBorder_.bottom_ = Max(rect.bottom_, 0);\r\n}\r\n\r\nvoid Window::SetModal(bool modal)\r\n{\r\n    \/\/ UI may be null at shutdown if for example a script was holding a reference to this window\r\n    UI* ui = GetSubsystem<UI>();\r\n    if (!ui)\r\n        return;\r\n\r\n    if (ui->SetModalElement(this, modal))\r\n        modal_ = modal;\r\n\r\n    using namespace ModalChanged;\r\n\r\n    VariantMap eventData;\r\n    eventData[P_ELEMENT] = (void*)this;\r\n    eventData[P_MODAL] = modal;\r\n    SendEvent(E_MODALCHANGED, eventData);\r\n}\r\n\r\nvoid Window::SetModalShadeColor(const Color& color)\r\n{\r\n    modalShadeColor_ = color;\r\n}\r\n\r\nvoid Window::SetModalFrameColor(const Color& color)\r\n{\r\n    modalFrameColor_ = color;\r\n}\r\n\r\nvoid Window::SetModalFrameSize(const IntVector2& size)\r\n{\r\n    modalFrameSize_ = size;\r\n}\r\n\r\nWindowDragMode Window::GetDragMode(const IntVector2& position) const\r\n{\r\n    WindowDragMode mode = DRAG_NONE;\r\n\r\n    \/\/ Top row\r\n    if (position.y_ < resizeBorder_.top_)\r\n    {\r\n        if (movable_)\r\n            mode = DRAG_MOVE;\r\n        if (resizable_)\r\n        {\r\n            mode = DRAG_RESIZE_TOP;\r\n            if (position.x_ < resizeBorder_.left_)\r\n                mode = DRAG_RESIZE_TOPLEFT;\r\n            if (position.x_ >= GetWidth() - resizeBorder_.right_)\r\n                mode = DRAG_RESIZE_TOPRIGHT;\r\n        }\r\n    }\r\n    \/\/ Bottom row\r\n    else if (position.y_ >= GetHeight() - resizeBorder_.bottom_)\r\n    {\r\n        if (movable_)\r\n            mode = DRAG_MOVE;\r\n        if (resizable_)\r\n        {\r\n            mode = DRAG_RESIZE_BOTTOM;\r\n            if (position.x_ < resizeBorder_.left_)\r\n                mode = DRAG_RESIZE_BOTTOMLEFT;\r\n            if (position.x_ >= GetWidth() - resizeBorder_.right_)\r\n                mode = DRAG_RESIZE_BOTTOMRIGHT;\r\n        }\r\n    }\r\n    \/\/ Middle\r\n    else\r\n    {\r\n        if (movable_)\r\n            mode = DRAG_MOVE;\r\n        if (resizable_)\r\n        {\r\n            if (position.x_ < resizeBorder_.left_)\r\n                mode = DRAG_RESIZE_LEFT;\r\n            if (position.x_ >= GetWidth() - resizeBorder_.right_)\r\n                mode = DRAG_RESIZE_RIGHT;\r\n        }\r\n    }\r\n\r\n    return mode;\r\n}\r\n\r\nvoid Window::SetCursorShape(WindowDragMode mode, Cursor* cursor) const\r\n{\r\n    if (!cursor)\r\n        return;\r\n\r\n    switch (mode)\r\n    {\r\n    case DRAG_NONE:\r\n    case DRAG_MOVE:\r\n        cursor->SetShape(CS_NORMAL);\r\n        break;\r\n\r\n    case DRAG_RESIZE_TOP:\r\n    case DRAG_RESIZE_BOTTOM:\r\n        cursor->SetShape(CS_RESIZEVERTICAL);\r\n        break;\r\n\r\n    case DRAG_RESIZE_LEFT:\r\n    case DRAG_RESIZE_RIGHT:\r\n        cursor->SetShape(CS_RESIZEHORIZONTAL);\r\n        break;\r\n\r\n    case DRAG_RESIZE_TOPRIGHT:\r\n    case DRAG_RESIZE_BOTTOMLEFT:\r\n        cursor->SetShape(CS_RESIZEDIAGONAL_TOPRIGHT);\r\n        break;\r\n\r\n    case DRAG_RESIZE_TOPLEFT:\r\n    case DRAG_RESIZE_BOTTOMRIGHT:\r\n        cursor->SetShape(CS_RESIZEDIAGONAL_TOPLEFT);\r\n        break;\r\n\r\n    default:\r\n        break;\r\n    }\r\n}\r\n\r\nvoid Window::ValidatePosition()\r\n{\r\n    \/\/ Check that window does not go more than halfway outside its parent in either dimension\r\n    if (!parent_)\r\n        return;\r\n\r\n    const IntVector2& parentSize = parent_->GetSize();\r\n    IntVector2 position = GetPosition();\r\n    IntVector2 halfSize = GetSize() \/ 2;\r\n\r\n    position.x_ = Clamp(position.x_, -halfSize.x_, parentSize.x_ - halfSize.x_);\r\n    position.y_ = Clamp(position.y_, -halfSize.y_, parentSize.y_ - halfSize.y_);\r\n\r\n    SetPosition(position);\r\n}\r\n\r\nbool Window::CheckAlignment() const\r\n{\r\n    \/\/ Only top left-alignment is supported for move and resize\r\n    if (GetHorizontalAlignment() == HA_LEFT && GetVerticalAlignment() == VA_TOP)\r\n        return true;\r\n    else\r\n        return false;\r\n}\r\n\r\n}\r\n<commit_msg>Send E_MODALCHANGED event only when the modal flag changes successfully.<commit_after>\/\/\r\n\/\/ Copyright (c) 2008-2013 the Urho3D project.\r\n\/\/\r\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\r\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\r\n\/\/ in the Software without restriction, including without limitation the rights\r\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\r\n\/\/ copies of the Software, and to permit persons to whom the Software is\r\n\/\/ furnished to do so, subject to the following conditions:\r\n\/\/\r\n\/\/ The above copyright notice and this permission notice shall be included in\r\n\/\/ all copies or substantial portions of the Software.\r\n\/\/\r\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\n\/\/ THE SOFTWARE.\r\n\/\/\r\n\r\n#include \"Precompiled.h\"\r\n#include \"Context.h\"\r\n#include \"Cursor.h\"\r\n#include \"InputEvents.h\"\r\n#include \"UI.h\"\r\n#include \"UIEvents.h\"\r\n#include \"Window.h\"\r\n\r\n#include \"DebugNew.h\"\r\n\r\nnamespace Urho3D\r\n{\r\n\r\nstatic const int DEFAULT_RESIZE_BORDER = 4;\r\n\r\nextern const char* UI_CATEGORY;\r\n\r\nOBJECTTYPESTATIC(Window);\r\n\r\nWindow::Window(Context* context) :\r\n    BorderImage(context),\r\n    movable_(false),\r\n    resizable_(false),\r\n    resizeBorder_(DEFAULT_RESIZE_BORDER, DEFAULT_RESIZE_BORDER, DEFAULT_RESIZE_BORDER, DEFAULT_RESIZE_BORDER),\r\n    dragMode_(DRAG_NONE),\r\n    modal_(false),\r\n    modalShadeColor_(Color::TRANSPARENT),\r\n    modalFrameColor_(Color::TRANSPARENT),\r\n    modalFrameSize_(IntVector2::ZERO)\r\n\r\n{\r\n    bringToFront_ = true;\r\n    clipChildren_ = true;\r\n    enabled_ = true;\r\n}\r\n\r\nWindow::~Window()\r\n{\r\n}\r\n\r\nvoid Window::RegisterObject(Context* context)\r\n{\r\n    context->RegisterFactory<Window>(UI_CATEGORY);\r\n\r\n    COPY_BASE_ATTRIBUTES(Window, BorderImage);\r\n    UPDATE_ATTRIBUTE_DEFAULT_VALUE(Window, \"Bring To Front\", true);\r\n    UPDATE_ATTRIBUTE_DEFAULT_VALUE(Window, \"Clip Children\", true);\r\n    UPDATE_ATTRIBUTE_DEFAULT_VALUE(Window, \"Is Enabled\", true);\r\n    REF_ACCESSOR_ATTRIBUTE(Window, VAR_INTRECT, \"Resize Border\", GetResizeBorder, SetResizeBorder, IntRect, IntRect(DEFAULT_RESIZE_BORDER, \\\r\n        DEFAULT_RESIZE_BORDER, DEFAULT_RESIZE_BORDER, DEFAULT_RESIZE_BORDER), AM_FILE);\r\n    ACCESSOR_ATTRIBUTE(Window, VAR_BOOL, \"Is Movable\", IsMovable, SetMovable, bool, false, AM_FILE);\r\n    ACCESSOR_ATTRIBUTE(Window, VAR_BOOL, \"Is Resizable\", IsResizable, SetResizable, bool, false, AM_FILE);\r\n    ACCESSOR_ATTRIBUTE(Window, VAR_BOOL, \"Is Modal\", IsModal, SetModal, bool, false, AM_FILE);\r\n    REF_ACCESSOR_ATTRIBUTE(Window, VAR_COLOR, \"Modal Shade Color\", GetModalShadeColor, SetModalShadeColor, Color, Color::TRANSPARENT, AM_FILE);\r\n    REF_ACCESSOR_ATTRIBUTE(Window, VAR_COLOR, \"Modal Frame Color\", GetModalFrameColor, SetModalFrameColor, Color, Color::TRANSPARENT, AM_FILE);\r\n    REF_ACCESSOR_ATTRIBUTE(Window, VAR_INTVECTOR2, \"Modal Frame Size\", GetModalFrameSize, SetModalFrameSize, IntVector2, IntVector2::ZERO, AM_FILE);\r\n}\r\n\r\nvoid Window::GetBatches(PODVector<UIBatch>& batches, PODVector<float>& vertexData, const IntRect& currentScissor)\r\n{\r\n    if (modal_)\r\n    {\r\n        \/\/ Modal shade\r\n        if (modalShadeColor_ != Color::TRANSPARENT)\r\n        {\r\n            UIElement* rootElement = GetRoot();\r\n            const IntVector2& rootSize = rootElement->GetSize();\r\n            UIBatch batch(rootElement, BLEND_ALPHA, IntRect(0, 0, rootSize.x_, rootSize.y_), 0, &vertexData);\r\n            batch.AddQuad(0, 0, rootSize.x_, rootSize.y_, 0, 0, 0, 0, modalShadeColor_);\r\n            UIBatch::AddOrMerge(batch, batches);\r\n        }\r\n\r\n        \/\/ Modal frame\r\n        if (modalFrameColor_ != Color::TRANSPARENT && modalFrameSize_ != IntVector2::ZERO)\r\n        {\r\n            UIBatch batch(this, BLEND_ALPHA, currentScissor, 0, &vertexData);\r\n            int x = GetIndentWidth();\r\n            IntVector2 size = GetSize();\r\n            size.x_ -= x;\r\n            batch.AddQuad(x - modalFrameSize_.x_, -modalFrameSize_.y_, size.x_ + 2 * modalFrameSize_.x_, size.y_ + 2 * modalFrameSize_.y_, 0, 0, 0, 0, modalFrameColor_);\r\n            UIBatch::AddOrMerge(batch, batches);\r\n        }\r\n    }\r\n\r\n    BorderImage::GetBatches(batches, vertexData, currentScissor);\r\n}\r\n\r\nvoid Window::OnHover(const IntVector2& position, const IntVector2& screenPosition, int buttons, int qualifiers, Cursor* cursor)\r\n{\r\n    if (dragMode_ == DRAG_NONE)\r\n    {\r\n        WindowDragMode mode = GetDragMode(position);\r\n        SetCursorShape(mode, cursor);\r\n    }\r\n    else\r\n        SetCursorShape(dragMode_, cursor);\r\n}\r\n\r\nvoid Window::OnDragBegin(const IntVector2& position, const IntVector2& screenPosition, int buttons, int qualifiers, Cursor* cursor)\r\n{\r\n    if (buttons != MOUSEB_LEFT || !CheckAlignment())\r\n    {\r\n        dragMode_ = DRAG_NONE;\r\n        return;\r\n    }\r\n\r\n    dragBeginCursor_ = screenPosition;\r\n    dragBeginPosition_ = GetPosition();\r\n    dragBeginSize_ = GetSize();\r\n    dragMode_ = GetDragMode(position);\r\n    SetCursorShape(dragMode_, cursor);\r\n}\r\n\r\nvoid Window::OnDragMove(const IntVector2& position, const IntVector2& screenPosition, int buttons, int qualifiers, Cursor* cursor)\r\n{\r\n    if (dragMode_ == DRAG_NONE)\r\n        return;\r\n\r\n    IntVector2 delta = screenPosition - dragBeginCursor_;\r\n\r\n    const IntVector2& position_ = GetPosition();\r\n    const IntVector2& size_ = GetSize();\r\n    const IntVector2& minSize_ = GetMinSize();\r\n    const IntVector2& maxSize_ = GetMaxSize();\r\n\r\n    switch (dragMode_)\r\n    {\r\n    case DRAG_MOVE:\r\n        SetPosition(dragBeginPosition_ + delta);\r\n        break;\r\n\r\n    case DRAG_RESIZE_TOPLEFT:\r\n        SetPosition(Clamp(dragBeginPosition_.x_ + delta.x_, position_.x_ - (maxSize_.x_ - size_.x_), position_.x_ + (size_.x_ - minSize_.x_)),\r\n            Clamp(dragBeginPosition_.y_ + delta.y_, position_.y_ - (maxSize_.y_ - size_.y_), position_.y_ + (size_.y_ - minSize_.y_)));\r\n        SetSize(dragBeginSize_ - delta);\r\n        break;\r\n\r\n    case DRAG_RESIZE_TOP:\r\n        SetPosition(dragBeginPosition_.x_, Clamp(dragBeginPosition_.y_ + delta.y_, position_.y_ - (maxSize_.y_ - size_.y_), position_.y_ + (size_.y_ - minSize_.y_)));\r\n        SetSize(dragBeginSize_.x_, dragBeginSize_.y_ - delta.y_);\r\n        break;\r\n\r\n    case DRAG_RESIZE_TOPRIGHT:\r\n        SetPosition(dragBeginPosition_.x_, dragBeginPosition_.y_ + delta.y_);\r\n        SetSize(dragBeginSize_.x_ + delta.x_, dragBeginSize_.y_ - delta.y_);\r\n        break;\r\n\r\n    case DRAG_RESIZE_RIGHT:\r\n        SetSize(dragBeginSize_.x_ + delta.x_, dragBeginSize_.y_);\r\n        break;\r\n\r\n    case DRAG_RESIZE_BOTTOMRIGHT:\r\n        SetSize(dragBeginSize_ + delta);\r\n        break;\r\n\r\n    case DRAG_RESIZE_BOTTOM:\r\n        SetSize(dragBeginSize_.x_, dragBeginSize_.y_ + delta.y_);\r\n        break;\r\n\r\n    case DRAG_RESIZE_BOTTOMLEFT:\r\n        SetPosition(Clamp(dragBeginPosition_.x_ + delta.x_, position_.x_ - (maxSize_.x_ - size_.x_), position_.x_ + (size_.x_ - minSize_.x_)), dragBeginPosition_.y_);\r\n        SetSize(dragBeginSize_.x_ - delta.x_, dragBeginSize_.y_ + delta.y_);\r\n        break;\r\n\r\n    case DRAG_RESIZE_LEFT:\r\n        SetPosition(Clamp(dragBeginPosition_.x_ + delta.x_, position_.x_ - (maxSize_.x_ - size_.x_), position_.x_ + (size_.x_ - minSize_.x_)), dragBeginPosition_.y_);\r\n        SetSize(dragBeginSize_.x_ - delta.x_, dragBeginSize_.y_);\r\n        break;\r\n\r\n    default:\r\n        break;\r\n    }\r\n\r\n    ValidatePosition();\r\n    SetCursorShape(dragMode_, cursor);\r\n}\r\n\r\nvoid Window::OnDragEnd(const IntVector2& position, const IntVector2& screenPosition, Cursor* cursor)\r\n{\r\n    dragMode_ = DRAG_NONE;\r\n}\r\n\r\nvoid Window::SetMovable(bool enable)\r\n{\r\n    movable_ = enable;\r\n}\r\n\r\nvoid Window::SetResizable(bool enable)\r\n{\r\n    resizable_ = enable;\r\n}\r\n\r\nvoid Window::SetResizeBorder(const IntRect& rect)\r\n{\r\n    resizeBorder_.left_ = Max(rect.left_, 0);\r\n    resizeBorder_.top_ = Max(rect.top_, 0);\r\n    resizeBorder_.right_ = Max(rect.right_, 0);\r\n    resizeBorder_.bottom_ = Max(rect.bottom_, 0);\r\n}\r\n\r\nvoid Window::SetModal(bool modal)\r\n{\r\n    \/\/ UI may be null at shutdown if for example a script was holding a reference to this window\r\n    UI* ui = GetSubsystem<UI>();\r\n    if (!ui)\r\n        return;\r\n\r\n    if (ui->SetModalElement(this, modal))\r\n    {\r\n        modal_ = modal;\r\n\r\n        using namespace ModalChanged;\r\n\r\n        VariantMap eventData;\r\n        eventData[P_ELEMENT] = (void*)this;\r\n        eventData[P_MODAL] = modal;\r\n        SendEvent(E_MODALCHANGED, eventData);\r\n    }\r\n}\r\n\r\nvoid Window::SetModalShadeColor(const Color& color)\r\n{\r\n    modalShadeColor_ = color;\r\n}\r\n\r\nvoid Window::SetModalFrameColor(const Color& color)\r\n{\r\n    modalFrameColor_ = color;\r\n}\r\n\r\nvoid Window::SetModalFrameSize(const IntVector2& size)\r\n{\r\n    modalFrameSize_ = size;\r\n}\r\n\r\nWindowDragMode Window::GetDragMode(const IntVector2& position) const\r\n{\r\n    WindowDragMode mode = DRAG_NONE;\r\n\r\n    \/\/ Top row\r\n    if (position.y_ < resizeBorder_.top_)\r\n    {\r\n        if (movable_)\r\n            mode = DRAG_MOVE;\r\n        if (resizable_)\r\n        {\r\n            mode = DRAG_RESIZE_TOP;\r\n            if (position.x_ < resizeBorder_.left_)\r\n                mode = DRAG_RESIZE_TOPLEFT;\r\n            if (position.x_ >= GetWidth() - resizeBorder_.right_)\r\n                mode = DRAG_RESIZE_TOPRIGHT;\r\n        }\r\n    }\r\n    \/\/ Bottom row\r\n    else if (position.y_ >= GetHeight() - resizeBorder_.bottom_)\r\n    {\r\n        if (movable_)\r\n            mode = DRAG_MOVE;\r\n        if (resizable_)\r\n        {\r\n            mode = DRAG_RESIZE_BOTTOM;\r\n            if (position.x_ < resizeBorder_.left_)\r\n                mode = DRAG_RESIZE_BOTTOMLEFT;\r\n            if (position.x_ >= GetWidth() - resizeBorder_.right_)\r\n                mode = DRAG_RESIZE_BOTTOMRIGHT;\r\n        }\r\n    }\r\n    \/\/ Middle\r\n    else\r\n    {\r\n        if (movable_)\r\n            mode = DRAG_MOVE;\r\n        if (resizable_)\r\n        {\r\n            if (position.x_ < resizeBorder_.left_)\r\n                mode = DRAG_RESIZE_LEFT;\r\n            if (position.x_ >= GetWidth() - resizeBorder_.right_)\r\n                mode = DRAG_RESIZE_RIGHT;\r\n        }\r\n    }\r\n\r\n    return mode;\r\n}\r\n\r\nvoid Window::SetCursorShape(WindowDragMode mode, Cursor* cursor) const\r\n{\r\n    if (!cursor)\r\n        return;\r\n\r\n    switch (mode)\r\n    {\r\n    case DRAG_NONE:\r\n    case DRAG_MOVE:\r\n        cursor->SetShape(CS_NORMAL);\r\n        break;\r\n\r\n    case DRAG_RESIZE_TOP:\r\n    case DRAG_RESIZE_BOTTOM:\r\n        cursor->SetShape(CS_RESIZEVERTICAL);\r\n        break;\r\n\r\n    case DRAG_RESIZE_LEFT:\r\n    case DRAG_RESIZE_RIGHT:\r\n        cursor->SetShape(CS_RESIZEHORIZONTAL);\r\n        break;\r\n\r\n    case DRAG_RESIZE_TOPRIGHT:\r\n    case DRAG_RESIZE_BOTTOMLEFT:\r\n        cursor->SetShape(CS_RESIZEDIAGONAL_TOPRIGHT);\r\n        break;\r\n\r\n    case DRAG_RESIZE_TOPLEFT:\r\n    case DRAG_RESIZE_BOTTOMRIGHT:\r\n        cursor->SetShape(CS_RESIZEDIAGONAL_TOPLEFT);\r\n        break;\r\n\r\n    default:\r\n        break;\r\n    }\r\n}\r\n\r\nvoid Window::ValidatePosition()\r\n{\r\n    \/\/ Check that window does not go more than halfway outside its parent in either dimension\r\n    if (!parent_)\r\n        return;\r\n\r\n    const IntVector2& parentSize = parent_->GetSize();\r\n    IntVector2 position = GetPosition();\r\n    IntVector2 halfSize = GetSize() \/ 2;\r\n\r\n    position.x_ = Clamp(position.x_, -halfSize.x_, parentSize.x_ - halfSize.x_);\r\n    position.y_ = Clamp(position.y_, -halfSize.y_, parentSize.y_ - halfSize.y_);\r\n\r\n    SetPosition(position);\r\n}\r\n\r\nbool Window::CheckAlignment() const\r\n{\r\n    \/\/ Only top left-alignment is supported for move and resize\r\n    if (GetHorizontalAlignment() == HA_LEFT && GetVerticalAlignment() == VA_TOP)\r\n        return true;\r\n    else\r\n        return false;\r\n}\r\n\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *   CrissCross\n *   A multi-purpose cross-platform library.\n *\n *   A product of Uplink Laboratories.\n *\n *   (c) 2006-2008 Steven Noonan.\n *   Licensed under the New BSD License.\n *\n *\/\n\n#include <crisscross\/universal_include.h>\n#include <crisscross\/debug.h>\n#include <crisscross\/core_network.h>\n#include <crisscross\/core_socket.h>\n\n\/* We're leaving sockets unimplemented on the Nintendo DS for the moment. We\n * need to familiarize ourselves with the devkitARM API for sockets first *\/\n#if !defined (TARGET_OS_NDSFIRMWARE)\n\n#if defined (TARGET_OS_WINDOWS)\ntypedef int socklen_t;\n#endif\n\n#if !defined (TARGET_OS_WINDOWS) && !defined (TARGET_OS_NDSFIRMWARE)\n#include <arpa\/inet.h>\n#include <errno.h>\n#include <netdb.h>\n#include <netinet\/in.h>\n#include <netinet\/tcp.h>\n#include <sys\/ioctl.h>\n#include <sys\/socket.h>\n#include <signal.h>\n#define INVALID_SOCKET -1\n#define SOCKET_ERROR -1\n#endif\n\n#if defined (TARGET_OS_NDSFIRMWARE)\n#include <sys\/socket.h>\n#define INVALID_SOCKET -1\n#define SOCKET_ERROR -1\n#endif\n\n\/* #define PACKET_DEBUG *\/\n\nnamespace CrissCross\n{\n\tnamespace Network\n\t{\n\t\tCoreSocket::CoreSocket()\n\t\t{\n\t\t\tint retval = __initialise_network();\n\t\t\tm_calledInitialise = 1;\n\t\t\tCoreAssert(retval == CC_ERR_NONE);\n\t\t\tmemset(&m_sock, 0, sizeof(socket_t));\n\t\t\tm_sock = INVALID_SOCKET;\n\t\t\tm_state = SOCKET_STATE_NOT_CREATED;\n\t\t\tm_bufferSize = 8192;\n\t\t}\n\n\t\tCoreSocket::CoreSocket(socket_t socket) : m_calledInitialise(0)\n\t\t{\n\t\t\t\/* Calling __initialise_network() is NOT\n\t\t\t * necessary if we have a socket to copy. *\/\n\t\t\tCoreAssert(socket != INVALID_SOCKET);\n\t\t\tm_sock = socket;\n\t\t\tm_state = SOCKET_STATE_UNKNOWN;\n\t\t\tm_bufferSize = 8192;\n\t\t}\n\n\t\tCoreSocket::~CoreSocket()\n\t\t{\n\t\t\tClose();\n\t\t\tif (m_calledInitialise == 1)\n\t\t\t\t__cleanup_network();\n\t\t}\n\n\t\tint CoreSocket::Close()\n\t\t{\n\t\t\tif (m_sock == INVALID_SOCKET) return CC_ERR_NOT_SOCKET;\n\n\t\t\t\/* Close the socket. *\/\n#ifdef TARGET_OS_WINDOWS\n\t\t\tclosesocket(m_sock);\n#else\n\t\t\tclose(m_sock);\n#endif\n\t\t\tm_sock = INVALID_SOCKET;\n\t\t\tm_state = SOCKET_STATE_NOT_CREATED;\n\t\t\treturn CC_ERR_NONE;\n\t\t}\n\n\t\tconst char *CoreSocket::GetRemoteIP()\n\t\t{\n\t\t\t\/* Verify the socket. *\/\n\t\t\tif (m_sock == INVALID_SOCKET) return NULL;\n\n\t\t\tstatic char        buffer[15];\n\t\t\tstruct sockaddr_in sock; int sock_size = sizeof(sock);\n\t\t\tmemset(&sock, 0, sizeof(sock));\n\n\t\t\t\/* Resolve the remote IP. *\/\n\t\t\tgetpeername(m_sock, (sockaddr *)&sock, (socklen_t *)&sock_size);\n\n\t\t\t\/* Print it to a buffer. *\/\n\t\t\tsprintf(buffer, inet_ntoa(sock.sin_addr));\n\n\t\t\t\/* Return it. *\/\n\t\t\treturn buffer;\n\t\t}\n\n\t\tu_long CoreSocket::GetLocalHost()\n\t\t{\n\t\t\tchar                 str[512];\n\t\t\tlong                 result = gethostname(str, sizeof(str));\n\t\t\tif (result < 0) {\n\t\t\t\treturn 0;\n\t\t\t}\n\n\t\t\tstruct hostent      *lpHostEnt;\n\t\t\tlpHostEnt = gethostbyname(str);\n\n\t\t\tstruct sockaddr_in   addr;\n\t\t\tmemcpy(&addr.sin_addr, lpHostEnt->h_addr_list[0], sizeof(addr.sin_addr));\n\t\t\taddr.sin_port = 0;\n\n\t\t\tconst unsigned char *a = (const unsigned char *)&addr.sin_addr;\n\t\t\tresult = (a[0] << 24) + (a[1] << 16) + (a[2] << 8) + a[3];\n\n\t\t\treturn result;\n\t\t}\n\n\t\tu_long CoreSocket::GetRemoteHost()\n\t\t{\n\t\t\tif (m_sock == INVALID_SOCKET) return 0;\n\n\t\t\tstruct sockaddr_in addr; int sock_size = sizeof(addr);\n\t\t\tmemset(&addr, 0, sizeof(addr));\n\t\t\tgetpeername(m_sock, (sockaddr *)&addr, (socklen_t *)&sock_size);\n\n\t\t\t\/* Return the remote host (not the IP, but the bare host). *\/\n\t\t\treturn addr.sin_addr.s_addr;\n\t\t}\n\n\t\tsocket_t CoreSocket::GetSocket()\n\t\t{\n\t\t\t\/* ugh. Allow the user to do whatever they want with the socket. *\/\n\t\t\treturn m_sock;\n\t\t}\n\n\t\tint CoreSocket::Read(std::string &_output)\n\t\t{\n\t\t\tif (m_sock == INVALID_SOCKET) return CC_ERR_NOT_SOCKET;\n\t\t\tif (!IsReadable()) return CC_ERR_WOULD_BLOCK;\n\t\t\t\n\t\t\t_output = \"\";\n\t\t\t\n\t\t\tint errbefore = GetError();\n\n\t\t\tchar *buf = new char[m_bufferSize];\n\t\t\tint   recvlen = 0;\n\t\t\tbool  receivedData = false;\n\t\t\tdo {\n\t\t\t\tmemset(buf, 0, m_bufferSize);\n\t\t\t\trecvlen = recv(m_sock, buf, 1, MSG_PEEK);\n\t\t\t\tif (recvlen > 0) {\n\t\t\t\t\trecvlen = recv(m_sock, buf, m_bufferSize - 1, 0);\n\t\t\t\t\t_output += std::string(buf);\n\t\t\t\t\treceivedData = true;\n\t\t\t\t}\n\t\t\t} while (recvlen > 0);\n\n\t\t\tdelete [] buf;\n\t\t\t\n\t\t\tint err = GetError();\n\t\t\t\n\t\t\t\/* The error wasn't triggered by what we did here *\/\n\t\t\tif (err == errbefore)\n\t\t\t\terr = CC_ERR_NONE;\n\n\t\t\treturn err;\n\t\t}\n\n\t\tint CoreSocket::Read(char *_output, unsigned int *_len)\n\t\t{\n\t\t\t\/* Sanity checks. *\/\n\t\t\tif (m_sock == INVALID_SOCKET) return CC_ERR_NOT_SOCKET;\n\t\t\tif (_len == NULL || *_len < 1) return CC_ERR_BADPARAMETER;\n\t\t\tif (_output == NULL) return CC_ERR_BADPARAMETER;\n\n\t\t\t\/* Set up a buffer. *\/\n\t\t\tint recvlen = 0;\n\t\t\tmemset(_output, 0, *_len);\n\n\t\t\t\/* Receive some data. *\/\n\t\t\trecvlen = recv(m_sock, _output, *_len, 0);\n\t\t\tif (recvlen < 0) {\n\t\t\t\t\/* Something's wrong here... *\/\n\t\t\t\treturn GetError();\n\t\t\t}\n\n\t\t\t*_len = recvlen;\n\n\t\t\treturn CC_ERR_NONE;\n\t\t}\n\n\t\tint CoreSocket::GetError() const\n\t\t{\n\t\t\tCoreAssert(m_sock != 0);\n\t\t\tint retval = 0;\n\n#if !defined (TARGET_OS_WINDOWS)\n\t\t\tretval = errno;\n#else\n\t\t\tint retsize = sizeof(int), ret = 0;\n\n\t\t\tretval = WSAGetLastError();\n\n\t\t\tif (retval == WSAEWOULDBLOCK || retval == 0) {\n\t\t\t\tgetsockopt(m_sock, SOL_SOCKET, SO_ERROR, (char *)&ret, (socklen_t *)&retsize);\n\t\t\t\tif (ret != 0)\n\t\t\t\t\treturn TranslateError(ret);\n\t\t\t}\n\n#endif\n\t\t\treturn TranslateError(retval);\n\t\t}\n\n\t\tint CoreSocket::Send(const void *_data, size_t _length)\n\t\t{\n\t\t\tif (m_sock == INVALID_SOCKET) return CC_ERR_NOT_SOCKET;\n\t\t\tif (!IsWritable()) return CC_ERR_WOULD_BLOCK;\n\n\t\t\tint   sent = 0;\n#ifdef PACKET_DEBUG\n\t\t\tchar *temp_buf = new char[m_bufferSize];\n\t\t\tmemset(temp_buf, 0, m_bufferSize);\n\t\t\tchar *p = temp_buf, *d = (char *)_data;\n\t\t\twhile (*d != '\\x0') {\n\t\t\t\tif (!(*d == '\\n' || *d == '\\r'))\n\t\t\t\t\t*p = *d;\n\n\t\t\t\tp++; d++;\n\t\t\t}\n\t\t\tfprintf(stdout, \"<<< '%s'\\n\", temp_buf);\n\t\t\tdelete [] temp_buf;\n#endif\n\t\t\tsent = send(m_sock, (const char *)_data, (int)_length, 0);\n\n\t\t\treturn sent;\n\t\t}\n\n\t\tint CoreSocket::Send(std::string _data)\n\t\t{\n\t\t\treturn Send(_data.c_str(), _data.size());\n\t\t}\n\n\t\tbool CoreSocket::IsReadable() const\n\t\t{\n\t\t\tint                ret;\n\t\t\tfd_set             read;\n\t\t\tstruct timeval     timeout;\n\n\t\t\t\/* We only take 0.001 seconds to check *\/\n\t\t\ttimeout.tv_sec = 0;\n\t\t\ttimeout.tv_usec = 1000;\n\n\t\t\tFD_ZERO(&read);\n\t\t\tFD_SET(m_sock, &read);\n\n\t\t\tint errbefore = GetError(), errafter;\n\n\t\t\t\/* Select to check if it's readable. *\/\n\t\t\tret = select(m_sock + 1, &read, NULL, NULL, &timeout);\n\n\t\t\terrafter = GetError();\n\n\t\t\t\/* ret < 0   is error *\/\n\t\t\t\/* ret == 0  is in progress *\/\n\t\t\t\/* ret > 0   is success *\/\n\t\t\tif (ret < 0 || (errafter && errafter != errbefore && errafter != CC_ERR_WOULD_BLOCK && errafter != TRY_AGAIN)) {\n\t\t\t\t\/* Bugger. Operation timed out. *\/\n\t\t\t\tm_state = SOCKET_STATE_ERROR;\n\t\t\t\treturn false;\n\t\t\t} else if (ret == 0) {\n\t\t\t\t\/* Keep going. No state change. *\/\n\t\t\t\treturn false;\n\t\t\t} else {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\n\t\tbool CoreSocket::IsWritable() const\n\t\t{\n\t\t\tint                ret;\n\t\t\tfd_set             write;\n\t\t\tstruct timeval     timeout;\n\n\t\t\t\/* We only take 0.001 seconds to check *\/\n\t\t\ttimeout.tv_sec = 0;\n\t\t\ttimeout.tv_usec = 1000;\n\n\t\t\tFD_ZERO(&write);\n\t\t\tFD_SET(m_sock, &write);\n\n\t\t\tint errbefore = GetError(), errafter;\n\n\t\t\t\/* Select to check if it's readable. *\/\n\t\t\tret = select(m_sock + 1, NULL, &write, NULL, &timeout);\n\n\t\t\terrafter = GetError();\n\n\t\t\t\/* ret < 0   is error *\/\n\t\t\t\/* ret == 0  is in progress *\/\n\t\t\t\/* ret > 0   is success *\/\n\t\t\tif (ret < 0 || (errafter && errafter != errbefore && errafter != CC_ERR_WOULD_BLOCK && errafter != TRY_AGAIN)) {\n\t\t\t\t\/* Bugger. Operation timed out. *\/\n\t\t\t\tm_state = SOCKET_STATE_ERROR;\n\t\t\t\treturn false;\n\t\t\t} else if (ret == 0) {\n\t\t\t\t\/* Keep going. No state change. *\/\n\t\t\t\treturn false;\n\t\t\t} else {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\n\t\tsocketState CoreSocket::State() const\n\t\t{\n\t\t\t\/* SO_ACCEPTCONN (DWORD:boolean, get) : determine whether a socket is listening. *\/\n\t\t\t\/* SO_CONDITIONAL_ACCEPT (DWORD:boolean, get\/set): determines whether a socket on *\/\n\t\t\t\/*    the stack level will accept connections or not. *\/\n\t\t\t\/* SO_ERROR (DWORD, get): per-socket error code. *\/\n\t\t\t\/* *\/\n\t\t\treturn m_state;\n\t\t}\n\t}\n}\n\n#endif\n<commit_msg>Fixlet to get linkage working.<commit_after>\/*\n *   CrissCross\n *   A multi-purpose cross-platform library.\n *\n *   A product of Uplink Laboratories.\n *\n *   (c) 2006-2008 Steven Noonan.\n *   Licensed under the New BSD License.\n *\n *\/\n\n#include <crisscross\/universal_include.h>\n#include <crisscross\/debug.h>\n#include <crisscross\/core_network.h>\n#include <crisscross\/core_socket.h>\n\n\/* We're leaving sockets unimplemented on the Nintendo DS for the moment. We\n * need to familiarize ourselves with the devkitARM API for sockets first *\/\n#if !defined (TARGET_OS_NDSFIRMWARE)\n\n#if defined (TARGET_OS_WINDOWS)\n#pragma comment (lib,\"ws2_32.lib\")\ntypedef int socklen_t;\n#endif\n\n#if !defined (TARGET_OS_WINDOWS) && !defined (TARGET_OS_NDSFIRMWARE)\n#include <arpa\/inet.h>\n#include <errno.h>\n#include <netdb.h>\n#include <netinet\/in.h>\n#include <netinet\/tcp.h>\n#include <sys\/ioctl.h>\n#include <sys\/socket.h>\n#include <signal.h>\n#define INVALID_SOCKET -1\n#define SOCKET_ERROR -1\n#endif\n\n#if defined (TARGET_OS_NDSFIRMWARE)\n#include <sys\/socket.h>\n#define INVALID_SOCKET -1\n#define SOCKET_ERROR -1\n#endif\n\n\/* #define PACKET_DEBUG *\/\n\nnamespace CrissCross\n{\n\tnamespace Network\n\t{\n\t\tCoreSocket::CoreSocket()\n\t\t{\n\t\t\tint retval = __initialise_network();\n\t\t\tm_calledInitialise = 1;\n\t\t\tCoreAssert(retval == CC_ERR_NONE);\n\t\t\tmemset(&m_sock, 0, sizeof(socket_t));\n\t\t\tm_sock = INVALID_SOCKET;\n\t\t\tm_state = SOCKET_STATE_NOT_CREATED;\n\t\t\tm_bufferSize = 8192;\n\t\t}\n\n\t\tCoreSocket::CoreSocket(socket_t socket) : m_calledInitialise(0)\n\t\t{\n\t\t\t\/* Calling __initialise_network() is NOT\n\t\t\t * necessary if we have a socket to copy. *\/\n\t\t\tCoreAssert(socket != INVALID_SOCKET);\n\t\t\tm_sock = socket;\n\t\t\tm_state = SOCKET_STATE_UNKNOWN;\n\t\t\tm_bufferSize = 8192;\n\t\t}\n\n\t\tCoreSocket::~CoreSocket()\n\t\t{\n\t\t\tClose();\n\t\t\tif (m_calledInitialise == 1)\n\t\t\t\t__cleanup_network();\n\t\t}\n\n\t\tint CoreSocket::Close()\n\t\t{\n\t\t\tif (m_sock == INVALID_SOCKET) return CC_ERR_NOT_SOCKET;\n\n\t\t\t\/* Close the socket. *\/\n#ifdef TARGET_OS_WINDOWS\n\t\t\tclosesocket(m_sock);\n#else\n\t\t\tclose(m_sock);\n#endif\n\t\t\tm_sock = INVALID_SOCKET;\n\t\t\tm_state = SOCKET_STATE_NOT_CREATED;\n\t\t\treturn CC_ERR_NONE;\n\t\t}\n\n\t\tconst char *CoreSocket::GetRemoteIP()\n\t\t{\n\t\t\t\/* Verify the socket. *\/\n\t\t\tif (m_sock == INVALID_SOCKET) return NULL;\n\n\t\t\tstatic char        buffer[15];\n\t\t\tstruct sockaddr_in sock; int sock_size = sizeof(sock);\n\t\t\tmemset(&sock, 0, sizeof(sock));\n\n\t\t\t\/* Resolve the remote IP. *\/\n\t\t\tgetpeername(m_sock, (sockaddr *)&sock, (socklen_t *)&sock_size);\n\n\t\t\t\/* Print it to a buffer. *\/\n\t\t\tsprintf(buffer, inet_ntoa(sock.sin_addr));\n\n\t\t\t\/* Return it. *\/\n\t\t\treturn buffer;\n\t\t}\n\n\t\tu_long CoreSocket::GetLocalHost()\n\t\t{\n\t\t\tchar                 str[512];\n\t\t\tlong                 result = gethostname(str, sizeof(str));\n\t\t\tif (result < 0) {\n\t\t\t\treturn 0;\n\t\t\t}\n\n\t\t\tstruct hostent      *lpHostEnt;\n\t\t\tlpHostEnt = gethostbyname(str);\n\n\t\t\tstruct sockaddr_in   addr;\n\t\t\tmemcpy(&addr.sin_addr, lpHostEnt->h_addr_list[0], sizeof(addr.sin_addr));\n\t\t\taddr.sin_port = 0;\n\n\t\t\tconst unsigned char *a = (const unsigned char *)&addr.sin_addr;\n\t\t\tresult = (a[0] << 24) + (a[1] << 16) + (a[2] << 8) + a[3];\n\n\t\t\treturn result;\n\t\t}\n\n\t\tu_long CoreSocket::GetRemoteHost()\n\t\t{\n\t\t\tif (m_sock == INVALID_SOCKET) return 0;\n\n\t\t\tstruct sockaddr_in addr; int sock_size = sizeof(addr);\n\t\t\tmemset(&addr, 0, sizeof(addr));\n\t\t\tgetpeername(m_sock, (sockaddr *)&addr, (socklen_t *)&sock_size);\n\n\t\t\t\/* Return the remote host (not the IP, but the bare host). *\/\n\t\t\treturn addr.sin_addr.s_addr;\n\t\t}\n\n\t\tsocket_t CoreSocket::GetSocket()\n\t\t{\n\t\t\t\/* ugh. Allow the user to do whatever they want with the socket. *\/\n\t\t\treturn m_sock;\n\t\t}\n\n\t\tint CoreSocket::Read(std::string &_output)\n\t\t{\n\t\t\tif (m_sock == INVALID_SOCKET) return CC_ERR_NOT_SOCKET;\n\t\t\tif (!IsReadable()) return CC_ERR_WOULD_BLOCK;\n\t\t\t\n\t\t\t_output = \"\";\n\t\t\t\n\t\t\tint errbefore = GetError();\n\n\t\t\tchar *buf = new char[m_bufferSize];\n\t\t\tint   recvlen = 0;\n\t\t\tbool  receivedData = false;\n\t\t\tdo {\n\t\t\t\tmemset(buf, 0, m_bufferSize);\n\t\t\t\trecvlen = recv(m_sock, buf, 1, MSG_PEEK);\n\t\t\t\tif (recvlen > 0) {\n\t\t\t\t\trecvlen = recv(m_sock, buf, m_bufferSize - 1, 0);\n\t\t\t\t\t_output += std::string(buf);\n\t\t\t\t\treceivedData = true;\n\t\t\t\t}\n\t\t\t} while (recvlen > 0);\n\n\t\t\tdelete [] buf;\n\t\t\t\n\t\t\tint err = GetError();\n\t\t\t\n\t\t\t\/* The error wasn't triggered by what we did here *\/\n\t\t\tif (err == errbefore)\n\t\t\t\terr = CC_ERR_NONE;\n\n\t\t\treturn err;\n\t\t}\n\n\t\tint CoreSocket::Read(char *_output, unsigned int *_len)\n\t\t{\n\t\t\t\/* Sanity checks. *\/\n\t\t\tif (m_sock == INVALID_SOCKET) return CC_ERR_NOT_SOCKET;\n\t\t\tif (_len == NULL || *_len < 1) return CC_ERR_BADPARAMETER;\n\t\t\tif (_output == NULL) return CC_ERR_BADPARAMETER;\n\n\t\t\t\/* Set up a buffer. *\/\n\t\t\tint recvlen = 0;\n\t\t\tmemset(_output, 0, *_len);\n\n\t\t\t\/* Receive some data. *\/\n\t\t\trecvlen = recv(m_sock, _output, *_len, 0);\n\t\t\tif (recvlen < 0) {\n\t\t\t\t\/* Something's wrong here... *\/\n\t\t\t\treturn GetError();\n\t\t\t}\n\n\t\t\t*_len = recvlen;\n\n\t\t\treturn CC_ERR_NONE;\n\t\t}\n\n\t\tint CoreSocket::GetError() const\n\t\t{\n\t\t\tCoreAssert(m_sock != 0);\n\t\t\tint retval = 0;\n\n#if !defined (TARGET_OS_WINDOWS)\n\t\t\tretval = errno;\n#else\n\t\t\tint retsize = sizeof(int), ret = 0;\n\n\t\t\tretval = WSAGetLastError();\n\n\t\t\tif (retval == WSAEWOULDBLOCK || retval == 0) {\n\t\t\t\tgetsockopt(m_sock, SOL_SOCKET, SO_ERROR, (char *)&ret, (socklen_t *)&retsize);\n\t\t\t\tif (ret != 0)\n\t\t\t\t\treturn TranslateError(ret);\n\t\t\t}\n\n#endif\n\t\t\treturn TranslateError(retval);\n\t\t}\n\n\t\tint CoreSocket::Send(const void *_data, size_t _length)\n\t\t{\n\t\t\tif (m_sock == INVALID_SOCKET) return CC_ERR_NOT_SOCKET;\n\t\t\tif (!IsWritable()) return CC_ERR_WOULD_BLOCK;\n\n\t\t\tint   sent = 0;\n#ifdef PACKET_DEBUG\n\t\t\tchar *temp_buf = new char[m_bufferSize];\n\t\t\tmemset(temp_buf, 0, m_bufferSize);\n\t\t\tchar *p = temp_buf, *d = (char *)_data;\n\t\t\twhile (*d != '\\x0') {\n\t\t\t\tif (!(*d == '\\n' || *d == '\\r'))\n\t\t\t\t\t*p = *d;\n\n\t\t\t\tp++; d++;\n\t\t\t}\n\t\t\tfprintf(stdout, \"<<< '%s'\\n\", temp_buf);\n\t\t\tdelete [] temp_buf;\n#endif\n\t\t\tsent = send(m_sock, (const char *)_data, (int)_length, 0);\n\n\t\t\treturn sent;\n\t\t}\n\n\t\tint CoreSocket::Send(std::string _data)\n\t\t{\n\t\t\treturn Send(_data.c_str(), _data.size());\n\t\t}\n\n\t\tbool CoreSocket::IsReadable() const\n\t\t{\n\t\t\tint                ret;\n\t\t\tfd_set             read;\n\t\t\tstruct timeval     timeout;\n\n\t\t\t\/* We only take 0.001 seconds to check *\/\n\t\t\ttimeout.tv_sec = 0;\n\t\t\ttimeout.tv_usec = 1000;\n\n\t\t\tFD_ZERO(&read);\n\t\t\tFD_SET(m_sock, &read);\n\n\t\t\tint errbefore = GetError(), errafter;\n\n\t\t\t\/* Select to check if it's readable. *\/\n\t\t\tret = select(m_sock + 1, &read, NULL, NULL, &timeout);\n\n\t\t\terrafter = GetError();\n\n\t\t\t\/* ret < 0   is error *\/\n\t\t\t\/* ret == 0  is in progress *\/\n\t\t\t\/* ret > 0   is success *\/\n\t\t\tif (ret < 0 || (errafter && errafter != errbefore && errafter != CC_ERR_WOULD_BLOCK && errafter != TRY_AGAIN)) {\n\t\t\t\t\/* Bugger. Operation timed out. *\/\n\t\t\t\tm_state = SOCKET_STATE_ERROR;\n\t\t\t\treturn false;\n\t\t\t} else if (ret == 0) {\n\t\t\t\t\/* Keep going. No state change. *\/\n\t\t\t\treturn false;\n\t\t\t} else {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\n\t\tbool CoreSocket::IsWritable() const\n\t\t{\n\t\t\tint                ret;\n\t\t\tfd_set             write;\n\t\t\tstruct timeval     timeout;\n\n\t\t\t\/* We only take 0.001 seconds to check *\/\n\t\t\ttimeout.tv_sec = 0;\n\t\t\ttimeout.tv_usec = 1000;\n\n\t\t\tFD_ZERO(&write);\n\t\t\tFD_SET(m_sock, &write);\n\n\t\t\tint errbefore = GetError(), errafter;\n\n\t\t\t\/* Select to check if it's readable. *\/\n\t\t\tret = select(m_sock + 1, NULL, &write, NULL, &timeout);\n\n\t\t\terrafter = GetError();\n\n\t\t\t\/* ret < 0   is error *\/\n\t\t\t\/* ret == 0  is in progress *\/\n\t\t\t\/* ret > 0   is success *\/\n\t\t\tif (ret < 0 || (errafter && errafter != errbefore && errafter != CC_ERR_WOULD_BLOCK && errafter != TRY_AGAIN)) {\n\t\t\t\t\/* Bugger. Operation timed out. *\/\n\t\t\t\tm_state = SOCKET_STATE_ERROR;\n\t\t\t\treturn false;\n\t\t\t} else if (ret == 0) {\n\t\t\t\t\/* Keep going. No state change. *\/\n\t\t\t\treturn false;\n\t\t\t} else {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\n\t\tsocketState CoreSocket::State() const\n\t\t{\n\t\t\t\/* SO_ACCEPTCONN (DWORD:boolean, get) : determine whether a socket is listening. *\/\n\t\t\t\/* SO_CONDITIONAL_ACCEPT (DWORD:boolean, get\/set): determines whether a socket on *\/\n\t\t\t\/*    the stack level will accept connections or not. *\/\n\t\t\t\/* SO_ERROR (DWORD, get): per-socket error code. *\/\n\t\t\t\/* *\/\n\t\t\treturn m_state;\n\t\t}\n\t}\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>f5acce4c-2e4e-11e5-ad1f-28cfe91dbc4b<commit_msg>f5b4a1f0-2e4e-11e5-80bd-28cfe91dbc4b<commit_after>f5b4a1f0-2e4e-11e5-80bd-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2015 Dan Leinir Turthra Jensen <admin@leinir.dk>\n *\n * This 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\n#include \"BalooContentLister.h\"\n\n#include <Baloo\/IndexerConfig>\n#include <Baloo\/File>\n#include <KFileMetaData\/PropertyInfo>\n#include <KFileMetaData\/UserMetaData>\n\n#include <QDateTime>\n#include <QList>\n#include <QFileInfo>\n#include <QProcess>\n#include <QThreadPool>\n#include <QMimeDatabase>\n\n#include \"ContentQuery.h\"\n\nclass BalooContentLister::Private\n{\npublic:\n    Private(BalooContentLister* qq) : q(qq) {}\n\n    BalooContentLister* q = nullptr;\n\n    Baloo::QueryRunnable* createQuery(ContentQuery* contentQuery, const QString& location = QString{});\n\n    QStringList locations;\n    QString searchString;\n    QList<Baloo::QueryRunnable*> queries;\n    QList<QString> queryLocations;\n\n    QMimeDatabase mimeDatabase;\n};\n\nBalooContentLister::BalooContentLister(QObject* parent)\n    : ContentListerBase(parent)\n    , d(new Private(this))\n{\n}\n\nBalooContentLister::~BalooContentLister()\n{\n    QThreadPool::globalInstance()->waitForDone();\n    delete d;\n}\n\nbool BalooContentLister::balooEnabled() const\n{\n    Baloo::IndexerConfig config;\n    bool result = config.fileIndexingEnabled();\n\n    if(result)\n    {\n        \/\/ It would be terribly nice with a bit of baloo engine exporting, so\n        \/\/ we can ask the database about whether or not it is accessible...\n        \/\/ But, this is a catch-all check anyway, so we get a complete \"everything's broken\"\n        \/\/ result if anything is broken... guess it will do :)\n        QProcess statuscheck;\n        statuscheck.start(\"balooctl\", QStringList() << \"status\");\n        statuscheck.waitForFinished();\n        QString output = statuscheck.readAll();\n        if(statuscheck.exitStatus() == QProcess::CrashExit || statuscheck.exitCode() != 0)\n        {\n            result = false;\n        }\n    }\n\n    return result;\n}\n\nvoid BalooContentLister::startSearch(const QList<ContentQuery*>& queries)\n{\n    for(const auto& query : queries)\n    {\n        for(const auto& location : query->locations())\n        {\n            d->queries.append(d->createQuery(query, location));\n        }\n\n        if(query->locations().isEmpty())\n            d->queries.append(d->createQuery(query));\n    }\n\n    if(!d->queries.empty())\n    {\n        QThreadPool::globalInstance()->start(d->queries.first());\n    }\n}\n\nvoid BalooContentLister::queryCompleted(Baloo::QueryRunnable* query)\n{\n    d->queries.removeAll(query);\n    if(d->queries.empty())\n    {\n        emit searchCompleted();\n    }\n    else\n    {\n        QThreadPool::globalInstance()->start(d->queries.first());\n    }\n}\n\nvoid BalooContentLister::queryResult(const ContentQuery* query, const QString& location, const QString& file)\n{\n    if(knownFiles.contains(file)) {\n        return;\n    }\n\n    \/\/ wow, this isn't nice... why is baloo not limiting searches like it's supposed to?\n    if(!file.startsWith(location)) {\n        return;\n    }\n\n    \/\/ Like the one above, this is also not nice: apparently Baloo can return results to\n    \/\/ files that no longer exist on the file system. So we have to check manually whether\n    \/\/ the results provided are actually sensible results...\n    if(!QFile::exists(file)) {\n        return;\n    }\n\n    \/\/ It would be nice if Baloo could do mime type filtering on its own...\n    if(!query->mimeTypes().isEmpty()) {\n        const auto &mimeType = d->mimeDatabase.mimeTypeForFile(file).name();\n        if(!query->mimeTypes().contains(mimeType))\n            return;\n    }\n\n    auto metadata = metaDataForFile(file);\n\n    Baloo::File balooFile(file);\n    balooFile.load();\n    KFileMetaData::PropertyMap properties = balooFile.properties();\n    KFileMetaData::PropertyMap::const_iterator it = properties.constBegin();\n    for (; it != properties.constEnd(); it++)\n    {\n        KFileMetaData::PropertyInfo propInfo(it.key());\n        metadata[propInfo.name()] = it.value();\n    }\n\n    emit fileFound(file, metadata);\n}\n\nBaloo::QueryRunnable* BalooContentLister::Private::createQuery(ContentQuery* contentQuery, const QString& location)\n{\n    auto balooQuery = Baloo::Query{};\n    if(!location.isEmpty())\n        balooQuery.setIncludeFolder(location);\n\n    switch(contentQuery->type())\n    {\n        case ContentQuery::Audio:\n            balooQuery.setType(\"Audio\");\n            break;\n        case ContentQuery::Documents:\n            balooQuery.setType(\"Document\");\n            break;\n        case ContentQuery::Images:\n            balooQuery.setType(\"Image\");\n            break;\n        case ContentQuery::Video:\n            balooQuery.setType(\"Video\");\n            break;\n        default:\n            break;\n    }\n\n    if(!contentQuery->searchString().isEmpty())\n        balooQuery.setSearchString(contentQuery->searchString());\n\n    auto runnable = new Baloo::QueryRunnable{balooQuery};\n    connect(runnable, &Baloo::QueryRunnable::queryResult, q, [this, contentQuery, location](QRunnable*, const QString& file) {\n        q->queryResult(contentQuery, location, file);\n    });\n    connect(runnable, &Baloo::QueryRunnable::finished, q, &BalooContentLister::queryCompleted);\n\n    return runnable;\n}\n<commit_msg>Don't use Baloo except inside something that sets KDE_FULL_SESSION<commit_after>\/*\n * Copyright (C) 2015 Dan Leinir Turthra Jensen <admin@leinir.dk>\n *\n * This 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\n#include \"BalooContentLister.h\"\n\n#include <Baloo\/IndexerConfig>\n#include <Baloo\/File>\n#include <KFileMetaData\/PropertyInfo>\n#include <KFileMetaData\/UserMetaData>\n\n#include <QDateTime>\n#include <QList>\n#include <QFileInfo>\n#include <QProcess>\n#include <QThreadPool>\n#include <QMimeDatabase>\n\n#include \"ContentQuery.h\"\n\nclass BalooContentLister::Private\n{\npublic:\n    Private(BalooContentLister* qq) : q(qq) {}\n\n    BalooContentLister* q = nullptr;\n\n    Baloo::QueryRunnable* createQuery(ContentQuery* contentQuery, const QString& location = QString{});\n\n    QStringList locations;\n    QString searchString;\n    QList<Baloo::QueryRunnable*> queries;\n    QList<QString> queryLocations;\n\n    QMimeDatabase mimeDatabase;\n};\n\nBalooContentLister::BalooContentLister(QObject* parent)\n    : ContentListerBase(parent)\n    , d(new Private(this))\n{\n}\n\nBalooContentLister::~BalooContentLister()\n{\n    QThreadPool::globalInstance()->waitForDone();\n    delete d;\n}\n\nbool BalooContentLister::balooEnabled() const\n{\n    \/\/ Baloo is not intended to be used outside of Plasma sessions\n    \/\/ and so we can bypass all the testing if we are not actually\n    \/\/ in a full KDE session.\n    bool result{qEnvironmentVariableIsSet(\"KDE_FULL_SESSION\")};\n\n    if (result) {\n        Baloo::IndexerConfig config;\n        result = config.fileIndexingEnabled();\n\n        if(result)\n        {\n            \/\/ It would be terribly nice with a bit of baloo engine exporting, so\n            \/\/ we can ask the database about whether or not it is accessible...\n            \/\/ But, this is a catch-all check anyway, so we get a complete \"everything's broken\"\n            \/\/ result if anything is broken... guess it will do :)\n            QProcess statuscheck;\n            statuscheck.start(\"balooctl\", QStringList() << \"status\");\n            statuscheck.waitForFinished();\n            QString output = statuscheck.readAll();\n            if(statuscheck.exitStatus() == QProcess::CrashExit || statuscheck.exitCode() != 0)\n            {\n                result = false;\n            }\n        }\n    }\n\n    return result;\n}\n\nvoid BalooContentLister::startSearch(const QList<ContentQuery*>& queries)\n{\n    for(const auto& query : queries)\n    {\n        for(const auto& location : query->locations())\n        {\n            d->queries.append(d->createQuery(query, location));\n        }\n\n        if(query->locations().isEmpty())\n            d->queries.append(d->createQuery(query));\n    }\n\n    if(!d->queries.empty())\n    {\n        QThreadPool::globalInstance()->start(d->queries.first());\n    }\n}\n\nvoid BalooContentLister::queryCompleted(Baloo::QueryRunnable* query)\n{\n    d->queries.removeAll(query);\n    if(d->queries.empty())\n    {\n        emit searchCompleted();\n    }\n    else\n    {\n        QThreadPool::globalInstance()->start(d->queries.first());\n    }\n}\n\nvoid BalooContentLister::queryResult(const ContentQuery* query, const QString& location, const QString& file)\n{\n    if(knownFiles.contains(file)) {\n        return;\n    }\n\n    \/\/ wow, this isn't nice... why is baloo not limiting searches like it's supposed to?\n    if(!file.startsWith(location)) {\n        return;\n    }\n\n    \/\/ Like the one above, this is also not nice: apparently Baloo can return results to\n    \/\/ files that no longer exist on the file system. So we have to check manually whether\n    \/\/ the results provided are actually sensible results...\n    if(!QFile::exists(file)) {\n        return;\n    }\n\n    \/\/ It would be nice if Baloo could do mime type filtering on its own...\n    if(!query->mimeTypes().isEmpty()) {\n        const auto &mimeType = d->mimeDatabase.mimeTypeForFile(file).name();\n        if(!query->mimeTypes().contains(mimeType))\n            return;\n    }\n\n    auto metadata = metaDataForFile(file);\n\n    Baloo::File balooFile(file);\n    balooFile.load();\n    KFileMetaData::PropertyMap properties = balooFile.properties();\n    KFileMetaData::PropertyMap::const_iterator it = properties.constBegin();\n    for (; it != properties.constEnd(); it++)\n    {\n        KFileMetaData::PropertyInfo propInfo(it.key());\n        metadata[propInfo.name()] = it.value();\n    }\n\n    emit fileFound(file, metadata);\n}\n\nBaloo::QueryRunnable* BalooContentLister::Private::createQuery(ContentQuery* contentQuery, const QString& location)\n{\n    auto balooQuery = Baloo::Query{};\n    if(!location.isEmpty())\n        balooQuery.setIncludeFolder(location);\n\n    switch(contentQuery->type())\n    {\n        case ContentQuery::Audio:\n            balooQuery.setType(\"Audio\");\n            break;\n        case ContentQuery::Documents:\n            balooQuery.setType(\"Document\");\n            break;\n        case ContentQuery::Images:\n            balooQuery.setType(\"Image\");\n            break;\n        case ContentQuery::Video:\n            balooQuery.setType(\"Video\");\n            break;\n        default:\n            break;\n    }\n\n    if(!contentQuery->searchString().isEmpty())\n        balooQuery.setSearchString(contentQuery->searchString());\n\n    auto runnable = new Baloo::QueryRunnable{balooQuery};\n    connect(runnable, &Baloo::QueryRunnable::queryResult, q, [this, contentQuery, location](QRunnable*, const QString& file) {\n        q->queryResult(contentQuery, location, file);\n    });\n    connect(runnable, &Baloo::QueryRunnable::finished, q, &BalooContentLister::queryCompleted);\n\n    return runnable;\n}\n<|endoftext|>"}
{"text":"<commit_before>2193c114-2748-11e6-9409-e0f84713e7b8<commit_msg>ashley broke it<commit_after>219f7126-2748-11e6-965f-e0f84713e7b8<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 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\n#include \"SkAdvancedTypefaceMetrics.h\"\n#include \"SkTypes.h\"\n\n#ifdef SK_BUILD_FOR_UNIX\n#include <ft2build.h>\n#include FT_FREETYPE_H\n#endif\n\nnamespace skia_advanced_typeface_metrics_utils {\n\ntemplate <typename Data>\nvoid resetRange(SkAdvancedTypefaceMetrics::AdvanceMetric<Data>* range,\n                int startId) {\n    range->fStartId = startId;\n    range->fAdvance.setCount(0);\n}\n\ntemplate <typename Data>\nSkAdvancedTypefaceMetrics::AdvanceMetric<Data>* appendRange(\n        SkTScopedPtr<SkAdvancedTypefaceMetrics::AdvanceMetric<Data> >* nextSlot,\n        int startId) {\n    nextSlot->reset(new SkAdvancedTypefaceMetrics::AdvanceMetric<Data>);\n    resetRange(nextSlot->get(), startId);\n    return nextSlot->get();\n}\n\ntemplate <typename Data>\nvoid finishRange(\n        SkAdvancedTypefaceMetrics::AdvanceMetric<Data>* range,\n        int endId,\n        typename SkAdvancedTypefaceMetrics::AdvanceMetric<Data>::MetricType\n                type) {\n    range->fEndId = endId;\n    range->fType = type;\n    int newLength;\n    if (type == SkAdvancedTypefaceMetrics::AdvanceMetric<Data>::kRange) {\n        newLength = endId - range->fStartId + 1;\n    } else {\n        newLength = 1;\n    }\n    SkASSERT(range->fAdvance.count() >= newLength);\n    range->fAdvance.setCount(newLength);\n}\n\ntemplate <typename Data, typename FontHandle>\nSkAdvancedTypefaceMetrics::AdvanceMetric<Data>* getAdvanceData(\n        FontHandle fontHandle,\n        int num_glyphs,\n        bool (*getAdvance)(FontHandle fontHandle, int gId, Data* data)) {\n    \/\/ Assuming that an ASCII representation of a width or a glyph id is,\n    \/\/ on average, 3 characters long gives the following cut offs for\n    \/\/ using different range types:\n    \/\/ When currently in a range\n    \/\/  - Removing 4 0's is a win\n    \/\/  - Removing 5 repeats is a win\n    \/\/ When not currently in a range\n    \/\/  - Removing 1 0 is a win\n    \/\/  - Removing 3 repeats is a win\n\n    SkTScopedPtr<SkAdvancedTypefaceMetrics::AdvanceMetric<Data> > result;\n    SkAdvancedTypefaceMetrics::AdvanceMetric<Data>* curRange;\n    curRange = appendRange(&result, 0);\n    Data lastAdvance = SK_MinS16;\n    int repeats = 0;\n    for (int gId = 0; gId < num_glyphs; gId++) {\n        Data advance;\n        if (!getAdvance(fontHandle, gId, &advance)) {\n            num_glyphs = (gId > 0) ? gId - 1 : 0;\n            break;\n        }\n        if (advance == lastAdvance) {\n            repeats++;\n        } else if (curRange->fAdvance.count() == repeats + 1) {\n            if (lastAdvance == 0 && repeats >= 0) {\n                resetRange(curRange, gId);\n            } else if (repeats >= 2) {\n                finishRange(curRange, gId - 1,\n                            SkAdvancedTypefaceMetrics::WidthRange::kRun);\n                curRange = appendRange(&curRange->fNext, gId);\n            }\n            repeats = 0;\n        } else {\n            if (lastAdvance == 0 && repeats >= 3) {\n                finishRange(curRange, gId - repeats - 2,\n                            SkAdvancedTypefaceMetrics::WidthRange::kRange);\n                curRange = appendRange(&curRange->fNext, gId);\n            } else if (repeats >= 4) {\n                finishRange(curRange, gId - repeats - 2,\n                            SkAdvancedTypefaceMetrics::WidthRange::kRange);\n                curRange = appendRange(&curRange->fNext, gId - repeats - 1);\n                curRange->fAdvance.append(1, &lastAdvance);\n                finishRange(curRange, gId - 1,\n                            SkAdvancedTypefaceMetrics::WidthRange::kRun);\n                curRange = appendRange(&curRange->fNext, gId);\n            }\n            repeats = 0;\n        }\n        curRange->fAdvance.append(1, &advance);\n        lastAdvance = advance;\n    }\n    finishRange(curRange, num_glyphs - 1,\n                SkAdvancedTypefaceMetrics::WidthRange::kRange);\n    return result.release();\n}\n\n\/\/ Make AdvanceMetric template functions available for linking with typename\n\/\/ WidthRange and VerticalAdvanceRange.\n#ifdef SK_BUILD_FOR_WIN\ntemplate SkAdvancedTypefaceMetrics::WidthRange* getAdvanceData(\n        HDC hdc,\n        int num_glyphs,\n        bool (*getAdvance)(HDC hdc, int gId, int16_t* data));\n#elif SK_BUILD_FOR_UNIX\ntemplate SkAdvancedTypefaceMetrics::WidthRange* getAdvanceData(\n        FT_Face face,\n        int num_glyphs,\n        bool (*getAdvance)(FT_Face face, int gId, int16_t* data));\n#endif\ntemplate void resetRange(\n        SkAdvancedTypefaceMetrics::WidthRange* range,\n        int startId);\ntemplate SkAdvancedTypefaceMetrics::WidthRange* appendRange(\n        SkTScopedPtr<SkAdvancedTypefaceMetrics::WidthRange >* nextSlot,\n        int startId);\ntemplate void finishRange<int16_t>(\n        SkAdvancedTypefaceMetrics::WidthRange* range,\n        int endId,\n        SkAdvancedTypefaceMetrics::WidthRange::MetricType type);\n\ntemplate void resetRange(\n        SkAdvancedTypefaceMetrics::VerticalAdvanceRange* range,\n        int startId);\ntemplate SkAdvancedTypefaceMetrics::VerticalAdvanceRange* appendRange(\n        SkTScopedPtr<SkAdvancedTypefaceMetrics::VerticalAdvanceRange >*\n            nextSlot,\n        int startId);\ntemplate void finishRange<SkAdvancedTypefaceMetrics::VerticalMetric>(\n        SkAdvancedTypefaceMetrics::VerticalAdvanceRange* range,\n        int endId,\n        SkAdvancedTypefaceMetrics::VerticalAdvanceRange::MetricType type);\n\n} \/\/ namespace skia_advanced_typeface_metrics_utils\n<commit_msg>fix compile error for linux<commit_after>\/*\n * Copyright (C) 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\n#include \"SkAdvancedTypefaceMetrics.h\"\n#include \"SkTypes.h\"\n\n#ifdef SK_BUILD_FOR_UNIX\n#include <ft2build.h>\n#include FT_FREETYPE_H\n#endif\n\nnamespace skia_advanced_typeface_metrics_utils {\n\ntemplate <typename Data>\nvoid resetRange(SkAdvancedTypefaceMetrics::AdvanceMetric<Data>* range,\n                int startId) {\n    range->fStartId = startId;\n    range->fAdvance.setCount(0);\n}\n\ntemplate <typename Data>\nSkAdvancedTypefaceMetrics::AdvanceMetric<Data>* appendRange(\n        SkTScopedPtr<SkAdvancedTypefaceMetrics::AdvanceMetric<Data> >* nextSlot,\n        int startId) {\n    nextSlot->reset(new SkAdvancedTypefaceMetrics::AdvanceMetric<Data>);\n    resetRange(nextSlot->get(), startId);\n    return nextSlot->get();\n}\n\ntemplate <typename Data>\nvoid finishRange(\n        SkAdvancedTypefaceMetrics::AdvanceMetric<Data>* range,\n        int endId,\n        typename SkAdvancedTypefaceMetrics::AdvanceMetric<Data>::MetricType\n                type) {\n    range->fEndId = endId;\n    range->fType = type;\n    int newLength;\n    if (type == SkAdvancedTypefaceMetrics::AdvanceMetric<Data>::kRange) {\n        newLength = endId - range->fStartId + 1;\n    } else {\n        newLength = 1;\n    }\n    SkASSERT(range->fAdvance.count() >= newLength);\n    range->fAdvance.setCount(newLength);\n}\n\ntemplate <typename Data, typename FontHandle>\nSkAdvancedTypefaceMetrics::AdvanceMetric<Data>* getAdvanceData(\n        FontHandle fontHandle,\n        int num_glyphs,\n        bool (*getAdvance)(FontHandle fontHandle, int gId, Data* data)) {\n    \/\/ Assuming that an ASCII representation of a width or a glyph id is,\n    \/\/ on average, 3 characters long gives the following cut offs for\n    \/\/ using different range types:\n    \/\/ When currently in a range\n    \/\/  - Removing 4 0's is a win\n    \/\/  - Removing 5 repeats is a win\n    \/\/ When not currently in a range\n    \/\/  - Removing 1 0 is a win\n    \/\/  - Removing 3 repeats is a win\n\n    SkTScopedPtr<SkAdvancedTypefaceMetrics::AdvanceMetric<Data> > result;\n    SkAdvancedTypefaceMetrics::AdvanceMetric<Data>* curRange;\n    curRange = appendRange(&result, 0);\n    Data lastAdvance = SK_MinS16;\n    int repeats = 0;\n    for (int gId = 0; gId < num_glyphs; gId++) {\n        Data advance;\n        if (!getAdvance(fontHandle, gId, &advance)) {\n            num_glyphs = (gId > 0) ? gId - 1 : 0;\n            break;\n        }\n        if (advance == lastAdvance) {\n            repeats++;\n        } else if (curRange->fAdvance.count() == repeats + 1) {\n            if (lastAdvance == 0 && repeats >= 0) {\n                resetRange(curRange, gId);\n            } else if (repeats >= 2) {\n                finishRange(curRange, gId - 1,\n                            SkAdvancedTypefaceMetrics::WidthRange::kRun);\n                curRange = appendRange(&curRange->fNext, gId);\n            }\n            repeats = 0;\n        } else {\n            if (lastAdvance == 0 && repeats >= 3) {\n                finishRange(curRange, gId - repeats - 2,\n                            SkAdvancedTypefaceMetrics::WidthRange::kRange);\n                curRange = appendRange(&curRange->fNext, gId);\n            } else if (repeats >= 4) {\n                finishRange(curRange, gId - repeats - 2,\n                            SkAdvancedTypefaceMetrics::WidthRange::kRange);\n                curRange = appendRange(&curRange->fNext, gId - repeats - 1);\n                curRange->fAdvance.append(1, &lastAdvance);\n                finishRange(curRange, gId - 1,\n                            SkAdvancedTypefaceMetrics::WidthRange::kRun);\n                curRange = appendRange(&curRange->fNext, gId);\n            }\n            repeats = 0;\n        }\n        curRange->fAdvance.append(1, &advance);\n        lastAdvance = advance;\n    }\n    finishRange(curRange, num_glyphs - 1,\n                SkAdvancedTypefaceMetrics::WidthRange::kRange);\n    return result.release();\n}\n\n\/\/ Make AdvanceMetric template functions available for linking with typename\n\/\/ WidthRange and VerticalAdvanceRange.\n#if defined(SK_BUILD_FOR_WIN)\ntemplate SkAdvancedTypefaceMetrics::WidthRange* getAdvanceData(\n        HDC hdc,\n        int num_glyphs,\n        bool (*getAdvance)(HDC hdc, int gId, int16_t* data));\n#elif defined(SK_BUILD_FOR_UNIX)\ntemplate SkAdvancedTypefaceMetrics::WidthRange* getAdvanceData(\n        FT_Face face,\n        int num_glyphs,\n        bool (*getAdvance)(FT_Face face, int gId, int16_t* data));\n#endif\ntemplate void resetRange(\n        SkAdvancedTypefaceMetrics::WidthRange* range,\n        int startId);\ntemplate SkAdvancedTypefaceMetrics::WidthRange* appendRange(\n        SkTScopedPtr<SkAdvancedTypefaceMetrics::WidthRange >* nextSlot,\n        int startId);\ntemplate void finishRange<int16_t>(\n        SkAdvancedTypefaceMetrics::WidthRange* range,\n        int endId,\n        SkAdvancedTypefaceMetrics::WidthRange::MetricType type);\n\ntemplate void resetRange(\n        SkAdvancedTypefaceMetrics::VerticalAdvanceRange* range,\n        int startId);\ntemplate SkAdvancedTypefaceMetrics::VerticalAdvanceRange* appendRange(\n        SkTScopedPtr<SkAdvancedTypefaceMetrics::VerticalAdvanceRange >*\n            nextSlot,\n        int startId);\ntemplate void finishRange<SkAdvancedTypefaceMetrics::VerticalMetric>(\n        SkAdvancedTypefaceMetrics::VerticalAdvanceRange* range,\n        int endId,\n        SkAdvancedTypefaceMetrics::VerticalAdvanceRange::MetricType type);\n\n} \/\/ namespace skia_advanced_typeface_metrics_utils\n<|endoftext|>"}
{"text":"<commit_before>d78f54a8-585a-11e5-93b7-6c40088e03e4<commit_msg>d796edbe-585a-11e5-a4e5-6c40088e03e4<commit_after>d796edbe-585a-11e5-a4e5-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>d7f68c88-585a-11e5-bd00-6c40088e03e4<commit_msg>d7fd5c1e-585a-11e5-bfed-6c40088e03e4<commit_after>d7fd5c1e-585a-11e5-bfed-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>da3341f5-4b02-11e5-98b0-28cfe9171a43<commit_msg>Bug fixes and performance improvements<commit_after>da4259d1-4b02-11e5-8c4d-28cfe9171a43<|endoftext|>"}
{"text":"<commit_before>645946b8-2e4f-11e5-a1b7-28cfe91dbc4b<commit_msg>64609245-2e4f-11e5-abe2-28cfe91dbc4b<commit_after>64609245-2e4f-11e5-abe2-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>\/* Copyright © 2001-2014, Canal TP and\/or its affiliates. All rights reserved.\n  \nThis file is part of Navitia,\n    the software to build cool stuff with public transport.\n \nHope you'll enjoy and contribute to this project,\n    powered by Canal TP (www.canaltp.fr).\nHelp us simplify mobility and open public transport:\n    a non ending quest to the responsive locomotion way of traveling!\n  \nLICENCE: This program is free software; you can redistribute it and\/or modify\nit under the terms of the GNU Affero General Public License as published by\nthe Free Software Foundation, either version 3 of the License, or\n(at your option) any later version.\n   \nThis program is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\nGNU Affero General Public License for more details.\n   \nYou should have received a copy of the GNU Affero General Public License\nalong with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n  \nStay tuned using\ntwitter @navitia \nIRC #navitia on freenode\nhttps:\/\/groups.google.com\/d\/forum\/navitia\nwww.navitia.io\n*\/\n\n#include \"conf.h\"\n#include <iostream>\n#include \"ed\/connectors\/fusio_parser.h\"\n#include \"ed\/connectors\/fare_parser.h\"\n\n#include \"utils\/timer.h\"\n#include \"utils\/init.h\"\n\n#include <fstream>\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n#include <boost\/program_options.hpp>\n#include <boost\/filesystem.hpp>\n#include \"utils\/exception.h\"\n#include \"ed_persistor.h\"\n#include \"fare\/fare.h\"\n\nnamespace po = boost::program_options;\nnamespace pt = boost::posix_time;\n\nint main(int argc, char * argv[])\n{\n    navitia::init_app();\n    auto logger = log4cplus::Logger::getInstance(\"log\");\n\n    std::string input, date, connection_string,\n                fare_dir;\n    po::options_description desc(\"Allowed options\");\n    desc.add_options()\n        (\"help,h\", \"Show this message\")\n        (\"date,d\", po::value<std::string>(&date), \"Beginning date\")\n        (\"input,i\", po::value<std::string>(&input), \"Input directory\")\n        (\"version,v\", \"Show version\")\n        (\"fare,f\", po::value<std::string>(&fare_dir), \"Directory of fare files\")\n        (\"config-file\", po::value<std::string>(), \"Path to configuration file\")\n        (\"connection-string\", po::value<std::string>(&connection_string)->required(),\n             \"Database connection parameters: host=localhost \"\n             \"user=navitia dbname=navitia password=navitia\");\n\n    po::variables_map vm;\n    po::store(po::parse_command_line(argc, argv, desc), vm);\n\n    if(vm.count(\"version\")){\n        std::cout << argv[0] << \" V\" << navitia::config::kraken_version << \" \"\n                  << navitia::config::navitia_build_type << std::endl;\n        return 0;\n    }\n\n    if(vm.count(\"config-file\")){\n        std::ifstream stream;\n        stream.open(vm[\"config-file\"].as<std::string>());\n        if(!stream.is_open()){\n            throw navitia::exception(\"loading config file failed\");\n        }else{\n            po::store(po::parse_config_file(stream, desc), vm);\n        }\n    }\n\n    if(vm.count(\"help\") || !vm.count(\"input\")) {\n        std::cout << \"Reads and inserts in database fusio files\" << std::endl;\n        std::cout << desc <<  \"\\n\";\n        return 1;\n    }\n    po::notify(vm);\n\n    if (fare_dir.empty()) {\n        fare_dir = input;\n    }\n\n    pt::ptime start;\n    int read, complete, clean, sort, save, fare(0);\n\n    ed::Data data;\n\n    start = pt::microsec_clock::local_time();\n\n    ed::connectors::FusioParser fusio_parser(input);\n    fusio_parser.fill(data, date);\n    read = (pt::microsec_clock::local_time() - start).total_milliseconds();\n\n    LOG4CPLUS_INFO(logger, \"We excluded \" << data.count_too_long_connections << \" connections \"\n                   \" because they were too long\");\n    LOG4CPLUS_INFO(logger, \"We excluded \" << data.count_empty_connections << \" connections \"\n                   \" because they had no duration time\");\n\n\n    start = pt::microsec_clock::local_time();\n    data.complete();\n    complete = (pt::microsec_clock::local_time() - start).total_milliseconds();\n\n    start = pt::microsec_clock::local_time();\n    data.clean();\n    clean = (pt::microsec_clock::local_time() - start).total_milliseconds();\n\n    start = pt::microsec_clock::local_time();\n    data.sort();\n    sort = (pt::microsec_clock::local_time() - start).total_milliseconds();\n\n    data.normalize_uri();\n\n    if(vm.count(\"fare\") || boost::filesystem::exists(fare_dir + \"\/fares.csv\")) {\n        start = pt::microsec_clock::local_time();\n        LOG4CPLUS_INFO(logger, \"loading fare\");\n\n        ed::connectors::fare_parser fareParser(data, fare_dir + \"\/fares.csv\",\n                                           fare_dir + \"\/prices.csv\",\n                                           fare_dir + \"\/od_fares.csv\");\n        fareParser.load();\n        fare = (pt::microsec_clock::local_time() - start).total_milliseconds();\n    }\n\n    LOG4CPLUS_INFO(logger, \"line: \" << data.lines.size());\n    LOG4CPLUS_INFO(logger, \"route: \" << data.routes.size());\n    LOG4CPLUS_INFO(logger, \"journey_pattern: \" << data.journey_patterns.size());\n    LOG4CPLUS_INFO(logger, \"stoparea: \" << data.stop_areas.size());\n    LOG4CPLUS_INFO(logger, \"stoppoint: \" << data.stop_points.size());\n    LOG4CPLUS_INFO(logger, \"vehiclejourney: \" << data.vehicle_journeys.size());\n    LOG4CPLUS_INFO(logger, \"stop: \" << data.stops.size());\n    LOG4CPLUS_INFO(logger, \"connection: \" << data.stop_point_connections.size());\n    LOG4CPLUS_INFO(logger, \"journey_pattern points: \" << data.journey_pattern_points.size());\n    LOG4CPLUS_INFO(logger, \"modes: \" << data.physical_modes.size());\n    LOG4CPLUS_INFO(logger, \"validity pattern : \" << data.validity_patterns.size());\n\n    start = pt::microsec_clock::local_time();\n    ed::EdPersistor p(connection_string);\n    p.persist(data);\n    save = (pt::microsec_clock::local_time() - start).total_milliseconds();\n\n    LOG4CPLUS_INFO(logger, \"temps de traitement\");\n    LOG4CPLUS_INFO(logger, \"\\t lecture des fichiers \" << read << \"ms\");\n    LOG4CPLUS_INFO(logger, \"\\t completion des données \" << complete << \"ms\");\n    LOG4CPLUS_INFO(logger, \"\\t netoyage des données \" << clean << \"ms\");\n    LOG4CPLUS_INFO(logger, \"\\t trie des données \" << sort << \"ms\");\n    if (vm.count(\"fare\")) {\n        LOG4CPLUS_INFO(logger, \"\\t fares loaded in : \" << fare << \"ms\");\n    }\n    LOG4CPLUS_INFO(logger, \"\\t enregistrement des données \" << save << \"ms\");\n\n    return 0;\n}\n<commit_msg>ed: forbid teleportation by patching the vj to take 10min instead of 0.<commit_after>\/* Copyright © 2001-2014, Canal TP and\/or its affiliates. All rights reserved.\n  \nThis file is part of Navitia,\n    the software to build cool stuff with public transport.\n \nHope you'll enjoy and contribute to this project,\n    powered by Canal TP (www.canaltp.fr).\nHelp us simplify mobility and open public transport:\n    a non ending quest to the responsive locomotion way of traveling!\n  \nLICENCE: This program is free software; you can redistribute it and\/or modify\nit under the terms of the GNU Affero General Public License as published by\nthe Free Software Foundation, either version 3 of the License, or\n(at your option) any later version.\n   \nThis program is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\nGNU Affero General Public License for more details.\n   \nYou should have received a copy of the GNU Affero General Public License\nalong with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n  \nStay tuned using\ntwitter @navitia \nIRC #navitia on freenode\nhttps:\/\/groups.google.com\/d\/forum\/navitia\nwww.navitia.io\n*\/\n\n#include \"conf.h\"\n#include <iostream>\n#include \"ed\/connectors\/fusio_parser.h\"\n#include \"ed\/connectors\/fare_parser.h\"\n\n#include \"utils\/timer.h\"\n#include \"utils\/init.h\"\n\n#include <fstream>\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n#include <boost\/program_options.hpp>\n#include <boost\/filesystem.hpp>\n#include \"utils\/exception.h\"\n#include \"ed_persistor.h\"\n#include \"fare\/fare.h\"\n\nnamespace po = boost::program_options;\nnamespace pt = boost::posix_time;\n\nint main(int argc, char * argv[])\n{\n    navitia::init_app();\n    auto logger = log4cplus::Logger::getInstance(\"log\");\n\n    std::string input, date, connection_string,\n                fare_dir;\n    po::options_description desc(\"Allowed options\");\n    desc.add_options()\n        (\"help,h\", \"Show this message\")\n        (\"date,d\", po::value<std::string>(&date), \"Beginning date\")\n        (\"input,i\", po::value<std::string>(&input), \"Input directory\")\n        (\"version,v\", \"Show version\")\n        (\"fare,f\", po::value<std::string>(&fare_dir), \"Directory of fare files\")\n        (\"config-file\", po::value<std::string>(), \"Path to configuration file\")\n        (\"connection-string\", po::value<std::string>(&connection_string)->required(),\n             \"Database connection parameters: host=localhost \"\n             \"user=navitia dbname=navitia password=navitia\");\n\n    po::variables_map vm;\n    po::store(po::parse_command_line(argc, argv, desc), vm);\n\n    if(vm.count(\"version\")){\n        std::cout << argv[0] << \" V\" << navitia::config::kraken_version << \" \"\n                  << navitia::config::navitia_build_type << std::endl;\n        return 0;\n    }\n\n    if(vm.count(\"config-file\")){\n        std::ifstream stream;\n        stream.open(vm[\"config-file\"].as<std::string>());\n        if(!stream.is_open()){\n            throw navitia::exception(\"loading config file failed\");\n        }else{\n            po::store(po::parse_config_file(stream, desc), vm);\n        }\n    }\n\n    if(vm.count(\"help\") || !vm.count(\"input\")) {\n        std::cout << \"Reads and inserts in database fusio files\" << std::endl;\n        std::cout << desc <<  \"\\n\";\n        return 1;\n    }\n    po::notify(vm);\n\n    if (fare_dir.empty()) {\n        fare_dir = input;\n    }\n\n    pt::ptime start;\n    int read, complete, clean, sort, save, fare(0);\n\n    ed::Data data;\n\n    start = pt::microsec_clock::local_time();\n\n    ed::connectors::FusioParser fusio_parser(input);\n    fusio_parser.fill(data, date);\n    read = (pt::microsec_clock::local_time() - start).total_milliseconds();\n\n    LOG4CPLUS_INFO(logger, \"We excluded \" << data.count_too_long_connections << \" connections \"\n                   \" because they were too long\");\n    LOG4CPLUS_INFO(logger, \"We excluded \" << data.count_empty_connections << \" connections \"\n                   \" because they had no duration time\");\n\n    start = pt::microsec_clock::local_time();\n    data.complete();\n    complete = (pt::microsec_clock::local_time() - start).total_milliseconds();\n\n    LOG4CPLUS_INFO(logger, \"Starting da ugly TAD hack...\");\n    size_t nb_hacked = 0;\n    for (auto* vj: data.vehicle_journeys) {\n        if (vj->stop_time_list.size() != 2) { continue; }\n        if (vj->stop_time_list[0]->journey_pattern_point->stop_point\n            != vj->stop_time_list[1]->journey_pattern_point->stop_point) {\n            continue;\n        }\n        if (vj->stop_time_list[0]->departure_time != vj->stop_time_list[1]->arrival_time) { continue; }\n\n        \/\/ No, teleportation can't exist, even on a null distance!\n        \/\/ You'll take 10 min, I said!\n        ++nb_hacked;\n        vj->stop_time_list[1]->arrival_time += 10 * 60;\n        vj->stop_time_list[1]->departure_time += 10 * 60;\n    }\n    LOG4CPLUS_INFO(logger, \"Da ugly TAD hack: \" << nb_hacked << \" patched\");\n\n    start = pt::microsec_clock::local_time();\n    data.clean();\n    clean = (pt::microsec_clock::local_time() - start).total_milliseconds();\n\n    start = pt::microsec_clock::local_time();\n    data.sort();\n    sort = (pt::microsec_clock::local_time() - start).total_milliseconds();\n\n    data.normalize_uri();\n\n    if(vm.count(\"fare\") || boost::filesystem::exists(fare_dir + \"\/fares.csv\")) {\n        start = pt::microsec_clock::local_time();\n        LOG4CPLUS_INFO(logger, \"loading fare\");\n\n        ed::connectors::fare_parser fareParser(data, fare_dir + \"\/fares.csv\",\n                                           fare_dir + \"\/prices.csv\",\n                                           fare_dir + \"\/od_fares.csv\");\n        fareParser.load();\n        fare = (pt::microsec_clock::local_time() - start).total_milliseconds();\n    }\n\n    LOG4CPLUS_INFO(logger, \"line: \" << data.lines.size());\n    LOG4CPLUS_INFO(logger, \"route: \" << data.routes.size());\n    LOG4CPLUS_INFO(logger, \"journey_pattern: \" << data.journey_patterns.size());\n    LOG4CPLUS_INFO(logger, \"stoparea: \" << data.stop_areas.size());\n    LOG4CPLUS_INFO(logger, \"stoppoint: \" << data.stop_points.size());\n    LOG4CPLUS_INFO(logger, \"vehiclejourney: \" << data.vehicle_journeys.size());\n    LOG4CPLUS_INFO(logger, \"stop: \" << data.stops.size());\n    LOG4CPLUS_INFO(logger, \"connection: \" << data.stop_point_connections.size());\n    LOG4CPLUS_INFO(logger, \"journey_pattern points: \" << data.journey_pattern_points.size());\n    LOG4CPLUS_INFO(logger, \"modes: \" << data.physical_modes.size());\n    LOG4CPLUS_INFO(logger, \"validity pattern : \" << data.validity_patterns.size());\n\n    start = pt::microsec_clock::local_time();\n    ed::EdPersistor p(connection_string);\n    p.persist(data);\n    save = (pt::microsec_clock::local_time() - start).total_milliseconds();\n\n    LOG4CPLUS_INFO(logger, \"temps de traitement\");\n    LOG4CPLUS_INFO(logger, \"\\t lecture des fichiers \" << read << \"ms\");\n    LOG4CPLUS_INFO(logger, \"\\t completion des données \" << complete << \"ms\");\n    LOG4CPLUS_INFO(logger, \"\\t netoyage des données \" << clean << \"ms\");\n    LOG4CPLUS_INFO(logger, \"\\t trie des données \" << sort << \"ms\");\n    if (vm.count(\"fare\")) {\n        LOG4CPLUS_INFO(logger, \"\\t fares loaded in : \" << fare << \"ms\");\n    }\n    LOG4CPLUS_INFO(logger, \"\\t enregistrement des données \" << save << \"ms\");\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>98febe2b-327f-11e5-a79f-9cf387a8033e<commit_msg>9904b94c-327f-11e5-8008-9cf387a8033e<commit_after>9904b94c-327f-11e5-8008-9cf387a8033e<|endoftext|>"}
{"text":"<commit_before>5f89495c-2d16-11e5-af21-0401358ea401<commit_msg>5f89495d-2d16-11e5-af21-0401358ea401<commit_after>5f89495d-2d16-11e5-af21-0401358ea401<|endoftext|>"}
{"text":"<commit_before>6a1b184a-2e3a-11e5-a1d5-c03896053bdd<commit_msg>6a309ff8-2e3a-11e5-a127-c03896053bdd<commit_after>6a309ff8-2e3a-11e5-a127-c03896053bdd<|endoftext|>"}
{"text":"<commit_before>#include \"SIO\/SIORunHeaderHandler.h\"\n#include \"SIO\/SIOLCParameters.h\"\n#include \"SIO\/LCSIO.h\"\n\n#include \"EVENT\/LCRunHeader.h\"\n#include \"EVENT\/LCIO.h\"\n\n#include \"SIO_functions.h\"\n#include \"SIO_stream.h\"\n\n#include <iostream>\n\n\nusing namespace EVENT ; \/\/ for LCIO object\nusing namespace IOIMPL ;\n\nnamespace SIO  {\n\n\n  SIORunHeaderHandler::SIORunHeaderHandler(const std::string& bname) : \n    SIO_block( bname.c_str() ),\n    _rhP(0), \n    _hdr(0) {\n  }\n\n  SIORunHeaderHandler::SIORunHeaderHandler(const std::string& bname, IOIMPL::LCRunHeaderIOImpl** aRhP) : \n    SIO_block( bname.c_str() ),\n    _rhP( aRhP ), \n    _hdr(0) {\n    \n    *_rhP = 0 ;\n  }\n\n\n  SIORunHeaderHandler::~SIORunHeaderHandler(){\n\/\/     if (*_rhP != 0 )  delete *_rhP ;\n  }\n\n  \n  void SIORunHeaderHandler::setRunHeader(const LCRunHeader* rh ){\n    _hdr = rh ;\n  }\n  void SIORunHeaderHandler::setRunHeaderPtr( LCRunHeaderIOImpl** hdrP ) {\n    _rhP= hdrP ;\n  } \n\n\n  unsigned int SIORunHeaderHandler::xfer( SIO_stream* stream, SIO_operation op, \n\t\t\t\t\t  unsigned int versionID){\n  \n    LCSIO::checkVersion(versionID) ;\n    \n    unsigned int status ; \/\/ needed by the SIO_DATA macro\n  \n    if( op == SIO_OP_READ ){ \n\n      if(!_rhP) return LCIO::ERROR ;  \/\/ in read mode we need an address for the pointer\n\n      \/\/ delete the old run header object \n      \/\/ -> for every handler there will only be one RunHeader object at any given time\n      if (*_rhP != 0 )  delete *_rhP ;\n      *_rhP = new IOIMPL::LCRunHeaderIOImpl ;\n\n      \/\/ for the run header we read all the data into temporary variables\n      \/\/ as the data is mostly strings that need temporaries anyhow ...\n      int rnTmp ;\n      SIO_DATA( stream ,  &rnTmp  , 1  ) ;\n      (*_rhP)->setRunNumber( rnTmp    );\n\n      std::string detNameTmp ; \n      LCSIO_READ( stream,  detNameTmp ) ; \n      (*_rhP)->setDetectorName( detNameTmp  )  ;\n\n      std::string descTmp ; \n      LCSIO_READ( stream,  descTmp ) ; \n      (*_rhP)->setDescription( descTmp  )  ;\n      \n      \/\/ read  active sub detector names\n      int nSDN ;\n      SIO_DATA( stream ,  &nSDN , 1 ) ;\n      for( int i=0; i<nSDN ; i++ ){\n\n      \tstd::string sdnTmp ; \n      \tLCSIO_READ( stream,  sdnTmp ) ; \n      \t(*_rhP)->addActiveSubdetector( sdnTmp ) ;\n      }\n\n      \/\/ read parameters\n      if( versionID > SIO_VERSION_ENCODE( 1, 1)   ) \n\tSIOLCParameters::read( stream ,  (*_rhP)->parameters() , versionID) ;\n      \n    }  else if( op == SIO_OP_WRITE ){ \n    \n      if( _hdr ){\n\n\tLCSIO_WRITE( stream, _hdr->getRunNumber() ) ; \n\tLCSIO_WRITE( stream, _hdr->getDetectorName() ) ;\n\tLCSIO_WRITE( stream, _hdr->getDescription() ) ;\n\t\n\t\/\/ now write list of  active sub detector names\n\tconst std::vector<std::string>* strVec = _hdr->getActiveSubdetectors() ;\n\t\n\tint nSDN = strVec->size() ;\n\tSIO_DATA( stream, &nSDN, 1 ) ;\n\t\n\tfor( std::vector<std::string>::const_iterator nameI = strVec->begin() ; nameI != strVec->end() ; ++nameI){\n\t  LCSIO_WRITE( stream, *nameI ) ;\n\t} \n\t\n\t\/\/ write parameters\n\tif( version() > SIO_VERSION_ENCODE( 1, 1) ) \n\t  SIOLCParameters::write( stream , _hdr->getParameters() ) ;\n\n\t\n\n      } else {\n\tstd::cout << \" SIORunHeaderHandler::xfer : run header pointer not set !  \" << std::endl ;\n\treturn LCIO::ERROR ;\n      }\n    }\n    \n    \n    return ( SIO_BLOCK_SUCCESS ) ;\n  }\n  \n  unsigned int   SIORunHeaderHandler::version() const {\n    \n    return SIO_VERSION_ENCODE( LCIO::MAJORVERSION, LCIO::MINORVERSION ) ;\n  }\n  \n}\n<commit_msg>Added debug statement in case the run header pointer is not set<commit_after>#include \"SIO\/SIORunHeaderHandler.h\"\n#include \"SIO\/SIOLCParameters.h\"\n#include \"SIO\/LCSIO.h\"\n\n#include \"EVENT\/LCRunHeader.h\"\n#include \"EVENT\/LCIO.h\"\n\n#include \"SIO_functions.h\"\n#include \"SIO_stream.h\"\n\n#include <iostream>\n\n\nusing namespace EVENT ; \/\/ for LCIO object\nusing namespace IOIMPL ;\n\nnamespace SIO  {\n\n\n  SIORunHeaderHandler::SIORunHeaderHandler(const std::string& bname) : \n    SIO_block( bname.c_str() ),\n    _rhP(0), \n    _hdr(0) {\n  }\n\n  SIORunHeaderHandler::SIORunHeaderHandler(const std::string& bname, IOIMPL::LCRunHeaderIOImpl** aRhP) : \n    SIO_block( bname.c_str() ),\n    _rhP( aRhP ), \n    _hdr(0) {\n    \n    *_rhP = 0 ;\n  }\n\n\n  SIORunHeaderHandler::~SIORunHeaderHandler(){\n\/\/     if (*_rhP != 0 )  delete *_rhP ;\n  }\n\n  \n  void SIORunHeaderHandler::setRunHeader(const LCRunHeader* rh ){\n    _hdr = rh ;\n  }\n  void SIORunHeaderHandler::setRunHeaderPtr( LCRunHeaderIOImpl** hdrP ) {\n    _rhP= hdrP ;\n  } \n\n\n  unsigned int SIORunHeaderHandler::xfer( SIO_stream* stream, SIO_operation op, \n\t\t\t\t\t  unsigned int versionID){\n  \n    LCSIO::checkVersion(versionID) ;\n    \n    unsigned int status ; \/\/ needed by the SIO_DATA macro\n  \n    if( op == SIO_OP_READ ){ \n\n      if(!_rhP) {\n        SIO_DEBUG( \"SIORunHeaderHandler::xfer: [READ] no run pointer set\" );\n        return LCIO::ERROR ;  \/\/ in read mode we need an address for the pointer\n      }\n\n      \/\/ delete the old run header object \n      \/\/ -> for every handler there will only be one RunHeader object at any given time\n      if (*_rhP != 0 )  delete *_rhP ;\n      *_rhP = new IOIMPL::LCRunHeaderIOImpl ;\n\n      \/\/ for the run header we read all the data into temporary variables\n      \/\/ as the data is mostly strings that need temporaries anyhow ...\n      int rnTmp ;\n      SIO_DATA( stream ,  &rnTmp  , 1  ) ;\n      (*_rhP)->setRunNumber( rnTmp    );\n\n      std::string detNameTmp ; \n      LCSIO_READ( stream,  detNameTmp ) ; \n      (*_rhP)->setDetectorName( detNameTmp  )  ;\n\n      std::string descTmp ; \n      LCSIO_READ( stream,  descTmp ) ; \n      (*_rhP)->setDescription( descTmp  )  ;\n      \n      \/\/ read  active sub detector names\n      int nSDN ;\n      SIO_DATA( stream ,  &nSDN , 1 ) ;\n      for( int i=0; i<nSDN ; i++ ){\n\n      \tstd::string sdnTmp ; \n      \tLCSIO_READ( stream,  sdnTmp ) ; \n      \t(*_rhP)->addActiveSubdetector( sdnTmp ) ;\n      }\n\n      \/\/ read parameters\n      if( versionID > SIO_VERSION_ENCODE( 1, 1)   ) \n\tSIOLCParameters::read( stream ,  (*_rhP)->parameters() , versionID) ;\n      \n    }  else if( op == SIO_OP_WRITE ){ \n    \n      if( _hdr ){\n\n\tLCSIO_WRITE( stream, _hdr->getRunNumber() ) ; \n\tLCSIO_WRITE( stream, _hdr->getDetectorName() ) ;\n\tLCSIO_WRITE( stream, _hdr->getDescription() ) ;\n\t\n\t\/\/ now write list of  active sub detector names\n\tconst std::vector<std::string>* strVec = _hdr->getActiveSubdetectors() ;\n\t\n\tint nSDN = strVec->size() ;\n\tSIO_DATA( stream, &nSDN, 1 ) ;\n\t\n\tfor( std::vector<std::string>::const_iterator nameI = strVec->begin() ; nameI != strVec->end() ; ++nameI){\n\t  LCSIO_WRITE( stream, *nameI ) ;\n\t} \n\t\n\t\/\/ write parameters\n\tif( version() > SIO_VERSION_ENCODE( 1, 1) ) \n\t  SIOLCParameters::write( stream , _hdr->getParameters() ) ;\n\n\t\n\n      } else {\n\tstd::cout << \" SIORunHeaderHandler::xfer : run header pointer not set !  \" << std::endl ;\n\treturn LCIO::ERROR ;\n      }\n    }\n    \n    \n    return ( SIO_BLOCK_SUCCESS ) ;\n  }\n  \n  unsigned int   SIORunHeaderHandler::version() const {\n    \n    return SIO_VERSION_ENCODE( LCIO::MAJORVERSION, LCIO::MINORVERSION ) ;\n  }\n  \n}\n<|endoftext|>"}
{"text":"<commit_before>543735de-5216-11e5-9496-6c40088e03e4<commit_msg>5442734c-5216-11e5-bc6b-6c40088e03e4<commit_after>5442734c-5216-11e5-bc6b-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>\/\/ $Id$\n\n\/***********************************************************************\nMoses - factored phrase-based language decoder\nCopyright (C) 2006 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#include <cassert>\n#include <cstring>\n#include <iostream>\n#include \"lm\/binary_format.hh\"\n#include \"lm\/enumerate_vocab.hh\"\n#include \"lm\/model.hh\"\n\n#include \"LanguageModelKen.h\"\n#include \"FFState.h\"\n#include \"TypeDef.h\"\n#include \"Util.h\"\n#include \"FactorCollection.h\"\n#include \"Phrase.h\"\n#include \"InputFileStream.h\"\n#include \"StaticData.h\"\n\nusing namespace std;\n\nnamespace Moses\n{\n\nLanguageModelKenBase::~LanguageModelKenBase() {}\n\nnamespace\n{\n\nclass MappingBuilder : public lm::ngram::EnumerateVocab\n{\npublic:\n  MappingBuilder(FactorType factorType, FactorCollection &factorCollection, std::vector<lm::WordIndex> &mapping)\n    : m_factorType(factorType), m_factorCollection(factorCollection), m_mapping(mapping) {}\n\n  void Add(lm::WordIndex index, const StringPiece &str) {\n    m_word.assign(str.data(), str.size());\n    std::size_t factorId = m_factorCollection.AddFactor(Output, m_factorType, m_word)->GetId();\n    if (m_mapping.size() <= factorId) {\n      \/\/ 0 is <unk> :-)\n      m_mapping.resize(factorId + 1);\n    }\n    m_mapping[factorId] = index;\n  }\n\nprivate:\n  std::string m_word;\n  FactorType m_factorType;\n  FactorCollection &m_factorCollection;\n  std::vector<lm::WordIndex> &m_mapping;\n};\n\nstruct KenLMState : public FFState {\n  lm::ngram::State state;\n  int Compare(const FFState &o) const {\n    const KenLMState &other = static_cast<const KenLMState &>(o);\n    if (state.valid_length_ < other.state.valid_length_) return -1;\n    if (state.valid_length_ > other.state.valid_length_) return 1;\n    return std::memcmp(state.history_, other.state.history_, sizeof(lm::WordIndex) * state.valid_length_);\n  }\n};\n\n\/** Implementation of single factor LM using Ken's code.\n*\/\ntemplate <class Model> class LanguageModelKen : public LanguageModelKenBase\n{\nprivate:\n  Model *m_ngram;\n  std::vector<lm::WordIndex> m_lmIdLookup;\n  bool m_lazy;\n  KenLMState m_nullContextState;\n  KenLMState m_beginSentenceState;\n\n  void TranslateIDs(const std::vector<const Word*> &contextFactor, lm::WordIndex *indices) const;\n\npublic:\n  LanguageModelKen(bool lazy);\n  ~LanguageModelKen();\n\n  bool Load(const std::string &filePath\n            , FactorType factorType\n            , size_t nGramOrder);\n\n  LMResult GetValueGivenState(const std::vector<const Word*> &contextFactor, FFState &state) const {\n    return GetKenFullScoreGivenState(contextFactor, state);\n  }\n  LMKenResult GetKenFullScoreGivenState(const std::vector<const Word*> &contextFactor, FFState &state) const;\n\n  LMResult GetValueForgotState(const std::vector<const Word*> &contextFactor, FFState &outState) const {\n    return GetKenFullScoreForgotState(contextFactor, outState);\n  }\n  LMKenResult GetKenFullScoreForgotState(const std::vector<const Word*> &contextFactor, FFState &outState) const;\n\n  void GetState(const std::vector<const Word*> &contextFactor, FFState &outState) const;\n\n  const FFState *GetNullContextState() const;\n  const FFState *GetBeginSentenceState() const;\n  FFState *NewState(const FFState *from = NULL) const;\n\n  lm::WordIndex GetLmID(const std::string &str) const;\n\n  void CleanUpAfterSentenceProcessing() {}\n  void InitializeBeforeSentenceProcessing() {}\n\n};\n\ntemplate <class Model> void LanguageModelKen<Model>::TranslateIDs(const std::vector<const Word*> &contextFactor, lm::WordIndex *indices) const\n{\n  FactorType factorType = GetFactorType();\n  \/\/ set up context\n  for (size_t i = 0 ; i < contextFactor.size(); i++) {\n    std::size_t factor = contextFactor[i]->GetFactor(factorType)->GetId();\n    lm::WordIndex new_word = (factor >= m_lmIdLookup.size() ? 0 : m_lmIdLookup[factor]);\n    indices[contextFactor.size() - 1 - i] = new_word;\n  }\n}\n\ntemplate <class Model> LanguageModelKen<Model>::LanguageModelKen(bool lazy)\n  :m_ngram(NULL), m_lazy(lazy)\n{\n}\n\ntemplate <class Model> LanguageModelKen<Model>::~LanguageModelKen()\n{\n  delete m_ngram;\n}\n\ntemplate <class Model> bool LanguageModelKen<Model>::Load(const std::string &filePath,\n    FactorType factorType,\n    size_t \/*nGramOrder*\/)\n{\n  m_factorType  = factorType;\n  m_filePath    = filePath;\n\n  FactorCollection &factorCollection = FactorCollection::Instance();\n  m_sentenceStart = factorCollection.AddFactor(Output, m_factorType, BOS_);\n  m_sentenceStartArray[m_factorType] = m_sentenceStart;\n  m_sentenceEnd = factorCollection.AddFactor(Output, m_factorType, EOS_);\n  m_sentenceEndArray[m_factorType] = m_sentenceEnd;\n\n  MappingBuilder builder(m_factorType, factorCollection, m_lmIdLookup);\n  lm::ngram::Config config;\n\n  IFVERBOSE(1) {\n    config.messages = &std::cerr;\n  }\n  else {\n    config.messages = NULL;\n  }\n\n  config.enumerate_vocab = &builder;\n  config.load_method = m_lazy ? util::LAZY : util::POPULATE_OR_READ;\n\n  m_ngram = new Model(filePath.c_str(), config);\n  m_nGramOrder  = m_ngram->Order();\n\n  m_nullContextState.state = m_ngram->NullContextState();\n  m_beginSentenceState.state = m_ngram->BeginSentenceState();\n  return true;\n}\n\ntemplate <class Model> LMKenResult LanguageModelKen<Model>::GetKenFullScoreGivenState(const std::vector<const Word*> &contextFactor, FFState &state) const\n{\n  LMKenResult result;\n  if (contextFactor.empty()) {\n    result.score = 0.0;\n    result.unknown = false;\n    result.ngram_length = 0;\n    return result;\n  }\n  lm::ngram::State &realState = static_cast<KenLMState&>(state).state;\n  std::size_t factor = contextFactor.back()->GetFactor(GetFactorType())->GetId();\n  lm::WordIndex new_word = (factor >= m_lmIdLookup.size() ? 0 : m_lmIdLookup[factor]);\n  lm::ngram::State copied(realState);\n  lm::FullScoreReturn ret(m_ngram->FullScore(copied, new_word, realState));\n\n  result.score = TransformLMScore(ret.prob);\n  result.unknown = (new_word == 0);\n  result.ngram_length = ret.ngram_length;\n  return result;\n}\n\ntemplate <class Model> LMKenResult LanguageModelKen<Model>::GetKenFullScoreForgotState(const vector<const Word*> &contextFactor, FFState &outState) const\n{\n  LMKenResult result;\n  if (contextFactor.empty()) {\n    static_cast<KenLMState&>(outState).state = m_ngram->NullContextState();\n    result.score = 0.0;\n    result.unknown = false;\n    result.ngram_length = 0;\n    return result;\n  }\n\n  lm::WordIndex indices[contextFactor.size()];\n  TranslateIDs(contextFactor, indices);\n\n  lm::FullScoreReturn ret(m_ngram->FullScoreForgotState(indices + 1, indices + contextFactor.size(), indices[0], static_cast<KenLMState&>(outState).state));\n\n  result.score = TransformLMScore(ret.prob);\n  result.unknown = (indices[0] == 0);\n  result.ngram_length = ret.ngram_length;\n  return result;\n}\n\ntemplate <class Model> void LanguageModelKen<Model>::GetState(const std::vector<const Word*> &contextFactor, FFState &outState) const\n{\n  if (contextFactor.empty()) {\n    static_cast<KenLMState&>(outState).state = m_ngram->NullContextState();\n    return;\n  }\n  lm::WordIndex indices[contextFactor.size()];\n  TranslateIDs(contextFactor, indices);\n  m_ngram->GetState(indices, indices + contextFactor.size(), static_cast<KenLMState&>(outState).state);\n}\n\ntemplate <class Model> const FFState *LanguageModelKen<Model>::GetNullContextState() const\n{\n  return &m_nullContextState;\n}\n\ntemplate <class Model> const FFState *LanguageModelKen<Model>::GetBeginSentenceState() const\n{\n  return &m_beginSentenceState;\n}\n\ntemplate <class Model> FFState *LanguageModelKen<Model>::NewState(const FFState *from) const\n{\n  KenLMState *ret = new KenLMState;\n  if (from) {\n    ret->state = static_cast<const KenLMState&>(*from).state;\n  }\n  return ret;\n}\n\ntemplate <class Model> lm::WordIndex LanguageModelKen<Model>::GetLmID(const std::string &str) const\n{\n  return m_ngram->GetVocabulary().Index(str);\n}\n\n} \/\/ namespace\n\nLanguageModelSingleFactor *ConstructKenLM(const std::string &file, bool lazy)\n{\n  lm::ngram::ModelType model_type;\n  if (lm::ngram::RecognizeBinary(file.c_str(), model_type)) {\n    switch(model_type) {\n    case lm::ngram::HASH_PROBING:\n      return new LanguageModelKen<lm::ngram::ProbingModel>(lazy);\n    case lm::ngram::TRIE_SORTED:\n      return new LanguageModelKen<lm::ngram::TrieModel>(lazy);\n    case lm::ngram::QUANT_TRIE_SORTED:\n      return new LanguageModelKen<lm::ngram::QuantTrieModel>(lazy);\n    case lm::ngram::ARRAY_TRIE_SORTED:\n      return new LanguageModelKen<lm::ngram::ArrayTrieModel>(lazy);\n    case lm::ngram::QUANT_ARRAY_TRIE_SORTED:\n      return new LanguageModelKen<lm::ngram::QuantArrayTrieModel>(lazy);\n    default:\n      std::cerr << \"Unrecognized kenlm model type \" << model_type << std::endl;\n      abort();\n    }\n  } else {\n    return new LanguageModelKen<lm::ngram::ProbingModel>(lazy);\n  }\n}\n\n}\n\n<commit_msg>Print exceptions because some peopls' machines don't.  <commit_after>\/\/ $Id$\n\n\/***********************************************************************\nMoses - factored phrase-based language decoder\nCopyright (C) 2006 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#include <cassert>\n#include <cstring>\n#include <iostream>\n#include <stdlib.h>\n#include \"lm\/binary_format.hh\"\n#include \"lm\/enumerate_vocab.hh\"\n#include \"lm\/model.hh\"\n\n#include \"LanguageModelKen.h\"\n#include \"FFState.h\"\n#include \"TypeDef.h\"\n#include \"Util.h\"\n#include \"FactorCollection.h\"\n#include \"Phrase.h\"\n#include \"InputFileStream.h\"\n#include \"StaticData.h\"\n\nusing namespace std;\n\nnamespace Moses\n{\n\nLanguageModelKenBase::~LanguageModelKenBase() {}\n\nnamespace\n{\n\nclass MappingBuilder : public lm::ngram::EnumerateVocab\n{\npublic:\n  MappingBuilder(FactorType factorType, FactorCollection &factorCollection, std::vector<lm::WordIndex> &mapping)\n    : m_factorType(factorType), m_factorCollection(factorCollection), m_mapping(mapping) {}\n\n  void Add(lm::WordIndex index, const StringPiece &str) {\n    m_word.assign(str.data(), str.size());\n    std::size_t factorId = m_factorCollection.AddFactor(Output, m_factorType, m_word)->GetId();\n    if (m_mapping.size() <= factorId) {\n      \/\/ 0 is <unk> :-)\n      m_mapping.resize(factorId + 1);\n    }\n    m_mapping[factorId] = index;\n  }\n\nprivate:\n  std::string m_word;\n  FactorType m_factorType;\n  FactorCollection &m_factorCollection;\n  std::vector<lm::WordIndex> &m_mapping;\n};\n\nstruct KenLMState : public FFState {\n  lm::ngram::State state;\n  int Compare(const FFState &o) const {\n    const KenLMState &other = static_cast<const KenLMState &>(o);\n    if (state.valid_length_ < other.state.valid_length_) return -1;\n    if (state.valid_length_ > other.state.valid_length_) return 1;\n    return std::memcmp(state.history_, other.state.history_, sizeof(lm::WordIndex) * state.valid_length_);\n  }\n};\n\n\/** Implementation of single factor LM using Ken's code.\n*\/\ntemplate <class Model> class LanguageModelKen : public LanguageModelKenBase\n{\nprivate:\n  Model *m_ngram;\n  std::vector<lm::WordIndex> m_lmIdLookup;\n  bool m_lazy;\n  KenLMState m_nullContextState;\n  KenLMState m_beginSentenceState;\n\n  void TranslateIDs(const std::vector<const Word*> &contextFactor, lm::WordIndex *indices) const;\n\npublic:\n  LanguageModelKen(bool lazy);\n  ~LanguageModelKen();\n\n  bool Load(const std::string &filePath\n            , FactorType factorType\n            , size_t nGramOrder);\n\n  LMResult GetValueGivenState(const std::vector<const Word*> &contextFactor, FFState &state) const {\n    return GetKenFullScoreGivenState(contextFactor, state);\n  }\n  LMKenResult GetKenFullScoreGivenState(const std::vector<const Word*> &contextFactor, FFState &state) const;\n\n  LMResult GetValueForgotState(const std::vector<const Word*> &contextFactor, FFState &outState) const {\n    return GetKenFullScoreForgotState(contextFactor, outState);\n  }\n  LMKenResult GetKenFullScoreForgotState(const std::vector<const Word*> &contextFactor, FFState &outState) const;\n\n  void GetState(const std::vector<const Word*> &contextFactor, FFState &outState) const;\n\n  const FFState *GetNullContextState() const;\n  const FFState *GetBeginSentenceState() const;\n  FFState *NewState(const FFState *from = NULL) const;\n\n  lm::WordIndex GetLmID(const std::string &str) const;\n\n  void CleanUpAfterSentenceProcessing() {}\n  void InitializeBeforeSentenceProcessing() {}\n\n};\n\ntemplate <class Model> void LanguageModelKen<Model>::TranslateIDs(const std::vector<const Word*> &contextFactor, lm::WordIndex *indices) const\n{\n  FactorType factorType = GetFactorType();\n  \/\/ set up context\n  for (size_t i = 0 ; i < contextFactor.size(); i++) {\n    std::size_t factor = contextFactor[i]->GetFactor(factorType)->GetId();\n    lm::WordIndex new_word = (factor >= m_lmIdLookup.size() ? 0 : m_lmIdLookup[factor]);\n    indices[contextFactor.size() - 1 - i] = new_word;\n  }\n}\n\ntemplate <class Model> LanguageModelKen<Model>::LanguageModelKen(bool lazy)\n  :m_ngram(NULL), m_lazy(lazy)\n{\n}\n\ntemplate <class Model> LanguageModelKen<Model>::~LanguageModelKen()\n{\n  delete m_ngram;\n}\n\ntemplate <class Model> bool LanguageModelKen<Model>::Load(const std::string &filePath,\n    FactorType factorType,\n    size_t \/*nGramOrder*\/)\n{\n  m_factorType  = factorType;\n  m_filePath    = filePath;\n\n  FactorCollection &factorCollection = FactorCollection::Instance();\n  m_sentenceStart = factorCollection.AddFactor(Output, m_factorType, BOS_);\n  m_sentenceStartArray[m_factorType] = m_sentenceStart;\n  m_sentenceEnd = factorCollection.AddFactor(Output, m_factorType, EOS_);\n  m_sentenceEndArray[m_factorType] = m_sentenceEnd;\n\n  MappingBuilder builder(m_factorType, factorCollection, m_lmIdLookup);\n  lm::ngram::Config config;\n\n  IFVERBOSE(1) {\n    config.messages = &std::cerr;\n  }\n  else {\n    config.messages = NULL;\n  }\n\n  config.enumerate_vocab = &builder;\n  config.load_method = m_lazy ? util::LAZY : util::POPULATE_OR_READ;\n\n  try {\n    m_ngram = new Model(filePath.c_str(), config);\n  } catch (std::exception &e) {\n    std::cerr << e.what() << std::endl;\n    abort();\n  }\n  m_nGramOrder  = m_ngram->Order();\n\n  m_nullContextState.state = m_ngram->NullContextState();\n  m_beginSentenceState.state = m_ngram->BeginSentenceState();\n  return true;\n}\n\ntemplate <class Model> LMKenResult LanguageModelKen<Model>::GetKenFullScoreGivenState(const std::vector<const Word*> &contextFactor, FFState &state) const\n{\n  LMKenResult result;\n  if (contextFactor.empty()) {\n    result.score = 0.0;\n    result.unknown = false;\n    result.ngram_length = 0;\n    return result;\n  }\n  lm::ngram::State &realState = static_cast<KenLMState&>(state).state;\n  std::size_t factor = contextFactor.back()->GetFactor(GetFactorType())->GetId();\n  lm::WordIndex new_word = (factor >= m_lmIdLookup.size() ? 0 : m_lmIdLookup[factor]);\n  lm::ngram::State copied(realState);\n  lm::FullScoreReturn ret(m_ngram->FullScore(copied, new_word, realState));\n\n  result.score = TransformLMScore(ret.prob);\n  result.unknown = (new_word == 0);\n  result.ngram_length = ret.ngram_length;\n  return result;\n}\n\ntemplate <class Model> LMKenResult LanguageModelKen<Model>::GetKenFullScoreForgotState(const vector<const Word*> &contextFactor, FFState &outState) const\n{\n  LMKenResult result;\n  if (contextFactor.empty()) {\n    static_cast<KenLMState&>(outState).state = m_ngram->NullContextState();\n    result.score = 0.0;\n    result.unknown = false;\n    result.ngram_length = 0;\n    return result;\n  }\n\n  lm::WordIndex indices[contextFactor.size()];\n  TranslateIDs(contextFactor, indices);\n\n  lm::FullScoreReturn ret(m_ngram->FullScoreForgotState(indices + 1, indices + contextFactor.size(), indices[0], static_cast<KenLMState&>(outState).state));\n\n  result.score = TransformLMScore(ret.prob);\n  result.unknown = (indices[0] == 0);\n  result.ngram_length = ret.ngram_length;\n  return result;\n}\n\ntemplate <class Model> void LanguageModelKen<Model>::GetState(const std::vector<const Word*> &contextFactor, FFState &outState) const\n{\n  if (contextFactor.empty()) {\n    static_cast<KenLMState&>(outState).state = m_ngram->NullContextState();\n    return;\n  }\n  lm::WordIndex indices[contextFactor.size()];\n  TranslateIDs(contextFactor, indices);\n  m_ngram->GetState(indices, indices + contextFactor.size(), static_cast<KenLMState&>(outState).state);\n}\n\ntemplate <class Model> const FFState *LanguageModelKen<Model>::GetNullContextState() const\n{\n  return &m_nullContextState;\n}\n\ntemplate <class Model> const FFState *LanguageModelKen<Model>::GetBeginSentenceState() const\n{\n  return &m_beginSentenceState;\n}\n\ntemplate <class Model> FFState *LanguageModelKen<Model>::NewState(const FFState *from) const\n{\n  KenLMState *ret = new KenLMState;\n  if (from) {\n    ret->state = static_cast<const KenLMState&>(*from).state;\n  }\n  return ret;\n}\n\ntemplate <class Model> lm::WordIndex LanguageModelKen<Model>::GetLmID(const std::string &str) const\n{\n  return m_ngram->GetVocabulary().Index(str);\n}\n\n} \/\/ namespace\n\nLanguageModelSingleFactor *ConstructKenLM(const std::string &file, bool lazy)\n{\n  lm::ngram::ModelType model_type;\n  if (lm::ngram::RecognizeBinary(file.c_str(), model_type)) {\n    switch(model_type) {\n    case lm::ngram::HASH_PROBING:\n      return new LanguageModelKen<lm::ngram::ProbingModel>(lazy);\n    case lm::ngram::TRIE_SORTED:\n      return new LanguageModelKen<lm::ngram::TrieModel>(lazy);\n    case lm::ngram::QUANT_TRIE_SORTED:\n      return new LanguageModelKen<lm::ngram::QuantTrieModel>(lazy);\n    case lm::ngram::ARRAY_TRIE_SORTED:\n      return new LanguageModelKen<lm::ngram::ArrayTrieModel>(lazy);\n    case lm::ngram::QUANT_ARRAY_TRIE_SORTED:\n      return new LanguageModelKen<lm::ngram::QuantArrayTrieModel>(lazy);\n    default:\n      std::cerr << \"Unrecognized kenlm model type \" << model_type << std::endl;\n      abort();\n    }\n  } else {\n    return new LanguageModelKen<lm::ngram::ProbingModel>(lazy);\n  }\n}\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>d023cc42-35ca-11e5-bcbe-6c40088e03e4<commit_msg>d02bb0f8-35ca-11e5-b14e-6c40088e03e4<commit_after>d02bb0f8-35ca-11e5-b14e-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>0882410c-2e4f-11e5-98e3-28cfe91dbc4b<commit_msg>0889ea19-2e4f-11e5-bda1-28cfe91dbc4b<commit_after>0889ea19-2e4f-11e5-bda1-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>52debf8c-2e4f-11e5-b69a-28cfe91dbc4b<commit_msg>52e584a1-2e4f-11e5-93d2-28cfe91dbc4b<commit_after>52e584a1-2e4f-11e5-93d2-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\n *\n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2014 Artem Pavlenko\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA\n *\n *****************************************************************************\/\n\n#include <mapnik\/function_call.hpp>\n\nnamespace mapnik {\n\n\n\/\/ functions\n\/\/ exp\n\/\/template <typename T>\nstruct exp_impl\n{\n    \/\/using type = T;\n    value_type operator() (value_type const& val) const\n    {\n        return std::exp(val.to_double());\n    }\n\n};\n\n\/\/ sin\nstruct sin_impl\n{\n    value_type operator() (value_type const& val) const\n    {\n        return std::sin(val.to_double());\n    }\n};\n\n\/\/ cos\nstruct cos_impl\n{\n    value_type operator() (value_type const& val) const\n    {\n        return std::cos(val.to_double());\n    }\n};\n\n\/\/ tan\nstruct tan_impl\n{\n    value_type operator() (value_type const& val) const\n    {\n        return std::tan(val.to_double());\n    }\n};\n\n\/\/ atan\nstruct atan_impl\n{\n    value_type operator()(value_type const& val) const\n    {\n        return std::atan(val.to_double());\n    }\n};\n\n\/\/ abs\nstruct abs_impl\n{\n    value_type operator() (value_type const& val) const\n    {\n        return std::fabs(val.to_double());\n    }\n};\n\nunary_function_types::unary_function_types()\n{\n    add\n        (\"sin\",  sin_impl())\n        (\"cos\",  cos_impl())\n        (\"tan\",  tan_impl())\n        (\"atan\", atan_impl())\n        (\"exp\",  exp_impl())\n        (\"abs\",  abs_impl())\n        ;\n}\n\nchar const* unary_function_name(unary_function_impl const& fun)\n{\n    if (fun.target<sin_impl>()) return \"sin\";\n    else if (fun.target<cos_impl>()) return \"cos\";\n    else if (fun.target<tan_impl>()) return \"tan\";\n    else if (fun.target<atan_impl>()) return \"atan\";\n    else if (fun.target<exp_impl>()) return \"exp\";\n    else if (fun.target<abs_impl>()) return \"abs\";\n    else return \"unknown\";\n}\n\n\/\/ binary functions\n\/\/ min\ninline value_type min_impl(value_type const& arg1, value_type const& arg2)\n{\n    return std::min(arg1.to_double(), arg2.to_double());\n}\n\/\/ max\ninline value_type max_impl(value_type const& arg1, value_type const& arg2)\n{\n    return std::max(arg1.to_double(), arg2.to_double());\n}\n\/\/ pow\ninline value_type pow_impl(value_type const& arg1, value_type const& arg2)\n{\n    return std::pow(arg1.to_double(), arg2.to_double());\n}\n\nbinary_function_types::binary_function_types()\n{\n    add\n        (\"min\", binary_function_impl(min_impl))\n        (\"max\", binary_function_impl(max_impl))\n        (\"pow\", binary_function_impl(pow_impl))\n        ;\n}\n\nchar const* binary_function_name(binary_function_impl const& fun)\n{\n    value_type(*const* f_ptr)(value_type const&, value_type const&) =\n        fun.target<value_type(*)\n                   (value_type const&, value_type const&)>();\n    if (f_ptr)\n    {\n        if (*f_ptr == min_impl) return \"min\";\n        else if(*f_ptr == max_impl) return \"max\";\n        else if(*f_ptr == pow_impl) return \"pow\";\n    }\n    return \"unknown\";\n}\n\n}\n<commit_msg>expressions : add ```lenght()``` unary function<commit_after>\/*****************************************************************************\n *\n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2014 Artem Pavlenko\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA\n *\n *****************************************************************************\/\n\n#include <mapnik\/function_call.hpp>\n\nnamespace mapnik {\n\n\n\/\/ functions\n\/\/ exp\n\/\/template <typename T>\nstruct exp_impl\n{\n    \/\/using type = T;\n    value_type operator() (value_type const& val) const\n    {\n        return std::exp(val.to_double());\n    }\n\n};\n\n\/\/ sin\nstruct sin_impl\n{\n    value_type operator() (value_type const& val) const\n    {\n        return std::sin(val.to_double());\n    }\n};\n\n\/\/ cos\nstruct cos_impl\n{\n    value_type operator() (value_type const& val) const\n    {\n        return std::cos(val.to_double());\n    }\n};\n\n\/\/ tan\nstruct tan_impl\n{\n    value_type operator() (value_type const& val) const\n    {\n        return std::tan(val.to_double());\n    }\n};\n\n\/\/ atan\nstruct atan_impl\n{\n    value_type operator()(value_type const& val) const\n    {\n        return std::atan(val.to_double());\n    }\n};\n\n\/\/ abs\nstruct abs_impl\n{\n    value_type operator() (value_type const& val) const\n    {\n        return std::fabs(val.to_double());\n    }\n};\n\n\/\/ length\nstruct length_impl\n{\n    value_type operator() (value_type const& val) const\n    {\n        return val.to_unicode().length();\n    }\n};\n\nunary_function_types::unary_function_types()\n{\n    add\n        (\"sin\",  sin_impl())\n        (\"cos\",  cos_impl())\n        (\"tan\",  tan_impl())\n        (\"atan\", atan_impl())\n        (\"exp\",  exp_impl())\n        (\"abs\",  abs_impl())\n        (\"length\",length_impl())\n        ;\n}\n\nchar const* unary_function_name(unary_function_impl const& fun)\n{\n    if (fun.target<sin_impl>()) return \"sin\";\n    else if (fun.target<cos_impl>()) return \"cos\";\n    else if (fun.target<tan_impl>()) return \"tan\";\n    else if (fun.target<atan_impl>()) return \"atan\";\n    else if (fun.target<exp_impl>()) return \"exp\";\n    else if (fun.target<abs_impl>()) return \"abs\";\n    else return \"unknown\";\n}\n\n\/\/ binary functions\n\/\/ min\ninline value_type min_impl(value_type const& arg1, value_type const& arg2)\n{\n    return std::min(arg1.to_double(), arg2.to_double());\n}\n\/\/ max\ninline value_type max_impl(value_type const& arg1, value_type const& arg2)\n{\n    return std::max(arg1.to_double(), arg2.to_double());\n}\n\/\/ pow\ninline value_type pow_impl(value_type const& arg1, value_type const& arg2)\n{\n    return std::pow(arg1.to_double(), arg2.to_double());\n}\n\nbinary_function_types::binary_function_types()\n{\n    add\n        (\"min\", binary_function_impl(min_impl))\n        (\"max\", binary_function_impl(max_impl))\n        (\"pow\", binary_function_impl(pow_impl))\n        ;\n}\n\nchar const* binary_function_name(binary_function_impl const& fun)\n{\n    value_type(*const* f_ptr)(value_type const&, value_type const&) =\n        fun.target<value_type(*)\n                   (value_type const&, value_type const&)>();\n    if (f_ptr)\n    {\n        if (*f_ptr == min_impl) return \"min\";\n        else if(*f_ptr == max_impl) return \"max\";\n        else if(*f_ptr == pow_impl) return \"pow\";\n    }\n    return \"unknown\";\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <QApplication>\n#include <QCompleter>\n#include <QKeySequence>\n#include <QLineEdit>\n#include <QMainWindow>\n#include <QMessageLogger>\n#include <QShortcut>\n#include <QStringListModel>\n#include <QVBoxLayout>\n#include <QWebEngineView>\n#include <qtwebengineglobal.h>\n\n\n#define HOMEPAGE  \"http:\/\/google.com\"\n\n#define SHORTCUT_META     (Qt::CTRL)\n\n#define SHORTCUT_FORWARD  (SHORTCUT_META + Qt::Key_I)\n#define SHORTCUT_BACK     (SHORTCUT_META + Qt::Key_O)\n#define SHORTCUT_BAR      (SHORTCUT_META + Qt::Key_Colon)\n\n\nQMessageLogger logger;\n\n\nclass TortaCompleter : public QCompleter {\nQ_OBJECT\n\nprivate:\n    QStringList list;\n    QStringListModel model;\n\npublic:\n    TortaCompleter(QLineEdit *line, QObject *parent=0) : QCompleter(parent) {\n        list << \"hello\" << \"world\" << \"foo\" << \"bar\";\n        model.setStringList(list);\n\n        setModel(&model);\n        setCompletionMode(QCompleter::UnfilteredPopupCompletion);\n        setModelSorting(QCompleter::CaseInsensitivelySortedModel);\n        setCaseSensitivity(Qt::CaseInsensitive);\n    }\n};\n\n\nclass DobosTorta : public QMainWindow {\nQ_OBJECT\n\nprivate:\n    QLineEdit bar;\n    QWebEngineView view;\n\n\n    void setShortcuts() {\n        connect(new QShortcut(QKeySequence(SHORTCUT_FORWARD), this), &QShortcut::activated, &view, &QWebEngineView::forward);\n        connect(new QShortcut(QKeySequence(SHORTCUT_BACK), this), &QShortcut::activated, &view, &QWebEngineView::back);\n\n        connect(new QShortcut(QKeySequence(SHORTCUT_BAR), this), &QShortcut::activated, this, &DobosTorta::toggleBar);\n    }\n\n    void setupBar() {\n        connect(&bar, &QLineEdit::returnPressed, this, &DobosTorta::executeBar);\n\n        bar.setCompleter(new TortaCompleter(&bar, this));\n\n        setMenuWidget(&bar);\n    }\n\n    void setupView() {\n        connect(&view, &QWebEngineView::titleChanged, this, &QWidget::setWindowTitle);\n        connect(&view, &QWebEngineView::urlChanged, this, &DobosTorta::urlChanged);\n\n        view.load(QUrl(HOMEPAGE));\n\n        setCentralWidget(&view);\n    }\n\npublic:\n    DobosTorta() : bar(HOMEPAGE, this), view(this) {\n        setupBar();\n        setupView();\n        setShortcuts();\n    }\n\nsignals:\nprivate slots:\n    void executeBar() {\n        view.load(bar.text());\n    }\n\n    void urlChanged(const QUrl &url) {\n        bar.setText(url.toString());\n    }\n\n    void toggleBar() {\n        if (!bar.hasFocus()) {\n            bar.setFocus();\n            bar.selectAll();\n        } else {\n            view.setFocus();\n        }\n    }\n};\n\n\nint main(int argc, char **argv) {\n    QCoreApplication::setAttribute(Qt::AA_EnableHighDpiScaling);\n    QApplication app(argc, argv);\n\n    QtWebEngine::initialize();\n\n    DobosTorta window;\n    window.show();\n\n    return app.exec();\n}\n\n\n#include \"main.moc\"\n<commit_msg>Enhanced bar<commit_after>#include <QApplication>\n#include <QCompleter>\n#include <QKeySequence>\n#include <QLineEdit>\n#include <QMainWindow>\n#include <QMessageLogger>\n#include <QShortcut>\n#include <QStringListModel>\n#include <QVBoxLayout>\n#include <QWebEngineView>\n#include <qtwebengineglobal.h>\n\n\n#define HOMEPAGE       \"http:\/\/google.com\"\n#define SEARCH_ENGINE  \"http:\/\/google.com\/search?q=%1\"\n\n#define SHORTCUT_META     (Qt::CTRL)\n\n#define SHORTCUT_FORWARD  (SHORTCUT_META + Qt::Key_I)\n#define SHORTCUT_BACK     (SHORTCUT_META + Qt::Key_O)\n#define SHORTCUT_BAR      (SHORTCUT_META + Qt::Key_Colon)\n\n\nQMessageLogger logger;\n\n\nclass TortaCompleter : public QCompleter {\nQ_OBJECT\n\nprivate:\n    QStringList list;\n    QStringListModel model;\n\npublic:\n    TortaCompleter(QLineEdit *line, QObject *parent=0) : QCompleter(parent) {\n        list << \"hello\" << \"world\" << \"foo\" << \"bar\";\n        model.setStringList(list);\n\n        setModel(&model);\n        setCompletionMode(QCompleter::UnfilteredPopupCompletion);\n        setModelSorting(QCompleter::CaseInsensitivelySortedModel);\n        setCaseSensitivity(Qt::CaseInsensitive);\n    }\n};\n\n\nclass DobosTorta : public QMainWindow {\nQ_OBJECT\n\nprivate:\n    QLineEdit bar;\n    QWebEngineView view;\n\n\n    void setShortcuts() {\n        connect(new QShortcut(QKeySequence(SHORTCUT_FORWARD), this), &QShortcut::activated, &view, &QWebEngineView::forward);\n        connect(new QShortcut(QKeySequence(SHORTCUT_BACK), this), &QShortcut::activated, &view, &QWebEngineView::back);\n\n        connect(new QShortcut(QKeySequence(SHORTCUT_BAR), this), &QShortcut::activated, this, &DobosTorta::toggleBar);\n    }\n\n    void setupBar() {\n        connect(&bar, &QLineEdit::returnPressed, this, &DobosTorta::executeBar);\n\n        bar.setCompleter(new TortaCompleter(&bar, this));\n\n        setMenuWidget(&bar);\n    }\n\n    void setupView() {\n        connect(&view, &QWebEngineView::titleChanged, this, &QWidget::setWindowTitle);\n        connect(&view, &QWebEngineView::urlChanged, this, &DobosTorta::urlChanged);\n\n        view.load(QUrl(HOMEPAGE));\n\n        setCentralWidget(&view);\n    }\n\npublic:\n    DobosTorta() : bar(HOMEPAGE, this), view(this) {\n        setupBar();\n        setupView();\n        setShortcuts();\n    }\n\nsignals:\nprivate slots:\n    void executeBar() {\n        static const QRegExp hasSchema(\"^[a-zA-Z0-9]+:\/\/\");\n        static const QRegExp address(\"^[^\/]+(\\\\.[^\/]+|:[0-9]+)\");\n\n        QString query(bar.text());\n\n        if (hasSchema.indexIn(query) != -1) {\n            view.load(query);\n        } else if (address.indexIn(bar.text()) != -1) {\n            view.load(\"http:\/\/\" + query);\n        } else {\n            view.load(QString(SEARCH_ENGINE).arg(query));\n        }\n    }\n\n    void urlChanged(const QUrl &url) {\n        bar.setText(url.toString());\n    }\n\n    void toggleBar() {\n        if (!bar.hasFocus()) {\n            bar.setFocus();\n            bar.selectAll();\n        } else {\n            view.setFocus();\n        }\n    }\n};\n\n\nint main(int argc, char **argv) {\n    QCoreApplication::setAttribute(Qt::AA_EnableHighDpiScaling);\n    QApplication app(argc, argv);\n\n    QtWebEngine::initialize();\n\n    DobosTorta window;\n    window.show();\n\n    return app.exec();\n}\n\n\n#include \"main.moc\"\n<|endoftext|>"}
{"text":"<commit_before>\/\/#define _GRIBCXX_DEBUG\n#include <algorithm>\n#include <cctype>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <list>\n#include <map>\n#include <memory>\n#include <numeric>\n#include <queue>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\n\n\n\/\/ 基本テンプレート\n#define rep(i,n) for(int i=0; i<(int)n; ++i)\n#define REP(i,x,n) for(int i=x; i<(int)n; ++i)\n#define repi(i,n) for(int i=0; i<=(int)n; ++i)\n#define REPI(i,x,n) for(int i=x; i<=(int)n; ++i)\n#define FOR(i,c) for(__typeof((c).begin())!=(c).begin(); i!=(c).end(); ++i)\n#define ALL(c) (c).begin(), (c).end()\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef vector<double> vd;\ntypedef vector<int> vi;\ntypedef vector<long long> vl;\ntypedef vector<long, long> pil;\n\n\n\/\/ Effective std\ntemplate<typename C, typename T>\nconstexpr int count(C& c, T t) { return count(ALL(c), t); }\n\ntemplate<typename C, typename F>\nconstexpr int count_if(C& c, F f) { return count_if(ALL(c), f); }\n\ntemplate<typename C, typename T, typename U>\nconstexpr void replace(C& c, T t, U u) { replace(ALL(c), t, u); }\n\ntemplate<typename C, typename F, typename U>\nconstexpr void replace_if(C& c, F f, U u) { (ALL(c), f, u); }\n\ntemplate<typename C>\nconstexpr void sort(C& c) { sort(ALL(c)); }\n\ntemplate<typename C, typename Pred>\nconstexpr void sort(C& c, Pred p) { sort(ALL(c), p); }\n\n\n\/\/ グラフテンプレート\ntypedef int Weight;\n\nstruct Edge {\n  int src, dst;\n  Weight weight;\n  Edge(int src, int dst, Weight weight) :\n    src(src), dst(dst), weight(weight) {}\n};\n\nbool operator < (const Edge &e, const Edge &f) {\n  return e.weight != f.weight ? e.weight > f.weight :\n    e.src != f.src ? e.src < f.src : e.dst < f.dst;\n}\n\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\ntypedef vector<Weight> Array;\ntypedef vector<Array> Matrix;\n\n\/*\n * 行列演算クラス\n *\/\nclass Ematrix\n{\n  private:\n    int row;\n    int col;\n    std::vector< std::vector<long long> > value;\n  public:\n    \/\/ 1行1列の行列\n    Ematrix();\n    \/\/ 単位行列\n    Ematrix(int);\n    \/\/ 行数と列数を指定した行列\n    Ematrix(int, int);\n    \/\/ コピーコンストラクタ\n    Ematrix(const Ematrix&);\n    \/\/ 添字演算子\n    inline std::vector<long long> operator [](int) const;\n    inline std::vector<long long>& operator [](int);\n    \/\/ 算術演算子\n    const Ematrix operator +(const Ematrix&) const;\n    const Ematrix operator -(const Ematrix&) const;\n    const Ematrix operator *(const Ematrix&) const;\n    const Ematrix operator *(const int&) const;\n    \/\/ 行数ゲッタ\n    int get_row() const;\n    \/\/ 列数ゲッタ\n    int get_col() const;\n    \/\/ 要素ベクトルゲッタ\n    std::vector< std::vector<long long> > get_value() const;\n};\n\nEmatrix::Ematrix()\n  :row(1), col(1),\n   value(std::vector< std::vector<long long> >(1,\n         std::vector<long long>(1,0)))\n{\n}\n\nEmatrix::Ematrix(int row, int col)\n  :row(row),\n   col(col),\n   value(std::vector< std::vector<long long> >(row,\n         std::vector<long long>(col,0)))\n{\n}\n\nEmatrix::Ematrix(int e)\n  :row(e),\n   col(e),\n   value(std::vector< std::vector<long long> >(row,\n         std::vector<long long>(col,0)))\n{\n  int c = 0;\n  for (int i=0; i<row; i++) {\n    value[i][c] = 1;\n    c++;\n  }\n}\n\nEmatrix::Ematrix(const Ematrix& rhs)\n  :row(rhs.get_row()),\n   col(rhs.get_col())\n{\n  value = rhs.get_value();\n}\n\ninline std::vector<long long> Ematrix::operator [](int index) const\n{\n  return this->value[index];\n}\n\ninline std::vector<long long>& Ematrix::operator [](int index)\n{\n  return this->value[index];\n}\n\n\/\/ 和\n\/\/ 行列の型が同じでなければならない(row==rhs.get_row(), col==rhs.get_col())\nconst Ematrix Ematrix::operator +(const Ematrix& rhs) const\n{\n  try {\n    Ematrix tmp(row, col);\n    for (int i=0; i<row; i++) {\n      for (int j=0; j<col; j++) {\n        tmp[i][j] = value[i][j] + rhs[i][j];\n      }\n    }\n    return tmp;\n  } catch (...) {}\n}\n\n\/\/ 差\n\/\/ 行列の型が同じでなければならない(row==rhs.get_row(), col==rhs.get_col())\nconst Ematrix Ematrix::operator -(const Ematrix& rhs) const\n{\n  try {\n    Ematrix tmp(row, col);\n    for (int i=0; i<row; i++) {\n      for (int j=0; j<col; j++) {\n        tmp[i][j] = value[i][j] - rhs[i][j];\n      }\n    }\n    return tmp;\n  } catch (...) {}\n}\n\n\/\/ 積\n\/\/ Aの列数とBの行数が等しくなければならない(col==rhs.get_row())\nconst Ematrix Ematrix::operator *(const Ematrix& rhs) const {\n  try {\n    Ematrix tmp(row, rhs.get_col());\n    for (int i=0; i<row; i++) {\n      for (int j=0; j<rhs.get_col(); j++) {\n        for (int k=0; k<col; k++) {\n          tmp[i][j] +=  value[i][k] * rhs[k][j];\n        }\n      }\n    }\n    return tmp;\n  } catch (...) {}\n}\n\n\/\/ 実数倍\nconst Ematrix Ematrix::operator *(const int& k) const\n{\n  try {\n    Ematrix tmp(row, col);\n    for (int i=0; i<row; i++) {\n      for (int j=0; j<col; j++) {\n        tmp[i][j] = value[i][j] * k;\n      }\n    }\n    return tmp;\n  } catch (...) {}\n}\n\nint Ematrix::get_row() const\n{\n  return this->row;\n}\n\nint Ematrix::get_col() const\n{\n  return this->col;\n}\n\nstd::vector< std::vector<long long> > Ematrix::get_value() const\n{\n  return this->value;\n}\n\n\nint main() {\n  return 0;\n}\n<commit_msg>iomanip<commit_after>\/\/#define _GRIBCXX_DEBUG\n#include <algorithm>\n#include <cctype>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <iomanip>\n#include <list>\n#include <map>\n#include <memory>\n#include <numeric>\n#include <queue>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\n\n\n\/\/ 基本テンプレート\n#define rep(i,n) for(int i=0; i<(int)n; ++i)\n#define REP(i,x,n) for(int i=x; i<(int)n; ++i)\n#define repi(i,n) for(int i=0; i<=(int)n; ++i)\n#define REPI(i,x,n) for(int i=x; i<=(int)n; ++i)\n#define FOR(i,c) for(__typeof((c).begin())!=(c).begin(); i!=(c).end(); ++i)\n#define ALL(c) (c).begin(), (c).end()\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef vector<double> vd;\ntypedef vector<int> vi;\ntypedef vector<long long> vl;\ntypedef vector<long, long> pil;\n\n\n\/\/ Effective std\ntemplate<typename C, typename T>\nconstexpr int count(C& c, T t) { return count(ALL(c), t); }\n\ntemplate<typename C, typename F>\nconstexpr int count_if(C& c, F f) { return count_if(ALL(c), f); }\n\ntemplate<typename C, typename T, typename U>\nconstexpr void replace(C& c, T t, U u) { replace(ALL(c), t, u); }\n\ntemplate<typename C, typename F, typename U>\nconstexpr void replace_if(C& c, F f, U u) { (ALL(c), f, u); }\n\ntemplate<typename C>\nconstexpr void sort(C& c) { sort(ALL(c)); }\n\ntemplate<typename C, typename Pred>\nconstexpr void sort(C& c, Pred p) { sort(ALL(c), p); }\n\n\n\/\/ グラフテンプレート\ntypedef int Weight;\n\nstruct Edge {\n  int src, dst;\n  Weight weight;\n  Edge(int src, int dst, Weight weight) :\n    src(src), dst(dst), weight(weight) {}\n};\n\nbool operator < (const Edge &e, const Edge &f) {\n  return e.weight != f.weight ? e.weight > f.weight :\n    e.src != f.src ? e.src < f.src : e.dst < f.dst;\n}\n\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\ntypedef vector<Weight> Array;\ntypedef vector<Array> Matrix;\n\n\/*\n * 行列演算クラス\n *\/\nclass Ematrix\n{\n  private:\n    int row;\n    int col;\n    std::vector< std::vector<long long> > value;\n  public:\n    \/\/ 1行1列の行列\n    Ematrix();\n    \/\/ 単位行列\n    Ematrix(int);\n    \/\/ 行数と列数を指定した行列\n    Ematrix(int, int);\n    \/\/ コピーコンストラクタ\n    Ematrix(const Ematrix&);\n    \/\/ 添字演算子\n    inline std::vector<long long> operator [](int) const;\n    inline std::vector<long long>& operator [](int);\n    \/\/ 算術演算子\n    const Ematrix operator +(const Ematrix&) const;\n    const Ematrix operator -(const Ematrix&) const;\n    const Ematrix operator *(const Ematrix&) const;\n    const Ematrix operator *(const int&) const;\n    \/\/ 行数ゲッタ\n    int get_row() const;\n    \/\/ 列数ゲッタ\n    int get_col() const;\n    \/\/ 要素ベクトルゲッタ\n    std::vector< std::vector<long long> > get_value() const;\n};\n\nEmatrix::Ematrix()\n  :row(1), col(1),\n   value(std::vector< std::vector<long long> >(1,\n         std::vector<long long>(1,0)))\n{\n}\n\nEmatrix::Ematrix(int row, int col)\n  :row(row),\n   col(col),\n   value(std::vector< std::vector<long long> >(row,\n         std::vector<long long>(col,0)))\n{\n}\n\nEmatrix::Ematrix(int e)\n  :row(e),\n   col(e),\n   value(std::vector< std::vector<long long> >(row,\n         std::vector<long long>(col,0)))\n{\n  int c = 0;\n  for (int i=0; i<row; i++) {\n    value[i][c] = 1;\n    c++;\n  }\n}\n\nEmatrix::Ematrix(const Ematrix& rhs)\n  :row(rhs.get_row()),\n   col(rhs.get_col())\n{\n  value = rhs.get_value();\n}\n\ninline std::vector<long long> Ematrix::operator [](int index) const\n{\n  return this->value[index];\n}\n\ninline std::vector<long long>& Ematrix::operator [](int index)\n{\n  return this->value[index];\n}\n\n\/\/ 和\n\/\/ 行列の型が同じでなければならない(row==rhs.get_row(), col==rhs.get_col())\nconst Ematrix Ematrix::operator +(const Ematrix& rhs) const\n{\n  try {\n    Ematrix tmp(row, col);\n    for (int i=0; i<row; i++) {\n      for (int j=0; j<col; j++) {\n        tmp[i][j] = value[i][j] + rhs[i][j];\n      }\n    }\n    return tmp;\n  } catch (...) {}\n}\n\n\/\/ 差\n\/\/ 行列の型が同じでなければならない(row==rhs.get_row(), col==rhs.get_col())\nconst Ematrix Ematrix::operator -(const Ematrix& rhs) const\n{\n  try {\n    Ematrix tmp(row, col);\n    for (int i=0; i<row; i++) {\n      for (int j=0; j<col; j++) {\n        tmp[i][j] = value[i][j] - rhs[i][j];\n      }\n    }\n    return tmp;\n  } catch (...) {}\n}\n\n\/\/ 積\n\/\/ Aの列数とBの行数が等しくなければならない(col==rhs.get_row())\nconst Ematrix Ematrix::operator *(const Ematrix& rhs) const {\n  try {\n    Ematrix tmp(row, rhs.get_col());\n    for (int i=0; i<row; i++) {\n      for (int j=0; j<rhs.get_col(); j++) {\n        for (int k=0; k<col; k++) {\n          tmp[i][j] +=  value[i][k] * rhs[k][j];\n        }\n      }\n    }\n    return tmp;\n  } catch (...) {}\n}\n\n\/\/ 実数倍\nconst Ematrix Ematrix::operator *(const int& k) const\n{\n  try {\n    Ematrix tmp(row, col);\n    for (int i=0; i<row; i++) {\n      for (int j=0; j<col; j++) {\n        tmp[i][j] = value[i][j] * k;\n      }\n    }\n    return tmp;\n  } catch (...) {}\n}\n\nint Ematrix::get_row() const\n{\n  return this->row;\n}\n\nint Ematrix::get_col() const\n{\n  return this->col;\n}\n\nstd::vector< std::vector<long long> > Ematrix::get_value() const\n{\n  return this->value;\n}\n\n\nint main() {\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>8860cbbd-2e4f-11e5-a4c2-28cfe91dbc4b<commit_msg>8867809e-2e4f-11e5-aa10-28cfe91dbc4b<commit_after>8867809e-2e4f-11e5-aa10-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>a3dc95b5-ad5b-11e7-b1a4-ac87a332f658<commit_msg>fixed bug<commit_after>a45340d9-ad5b-11e7-acb4-ac87a332f658<|endoftext|>"}
{"text":"<commit_before>9f2d3a76-35ca-11e5-8252-6c40088e03e4<commit_msg>9f431364-35ca-11e5-87e9-6c40088e03e4<commit_after>9f431364-35ca-11e5-87e9-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>\/** Copyright (C) 2013 David Braam - Released under terms of the AGPLv3 License *\/\r\n#include <stdio.h>\r\n#include <stdlib.h>\r\n#include <string.h>\r\n#include <sys\/time.h>\r\n#include <signal.h>\r\n#if defined(__linux__) || (defined(__APPLE__) && defined(__MACH__))\r\n#include <execinfo.h>\r\n#include <sys\/resource.h>\r\n#endif\r\n#include <stddef.h>\r\n\r\n#include \"utils\/gettime.h\"\r\n#include \"utils\/logoutput.h\"\r\n#include \"sliceDataStorage.h\"\r\n\r\n#include \"modelFile\/modelFile.h\"\r\n#include \"settings.h\"\r\n#include \"optimizedModel.h\"\r\n#include \"multiVolumes.h\"\r\n#include \"polygonOptimizer.h\"\r\n#include \"slicer.h\"\r\n#include \"layerPart.h\"\r\n#include \"inset.h\"\r\n#include \"skin.h\"\r\n#include \"infill.h\"\r\n#include \"bridge.h\"\r\n#include \"support.h\"\r\n#include \"pathOrderOptimizer.h\"\r\n#include \"skirt.h\"\r\n#include \"raft.h\"\r\n#include \"comb.h\"\r\n#include \"gcodeExport.h\"\r\n#include \"fffProcessor.h\"\r\n\r\nvoid print_usage()\r\n{\r\n    log(\"usage: CuraEngine [-h] [-v] [-m 3x3matrix] [-c <config file>] [-s <settingkey>=<value>] -o <output.gcode> <model.stl>\\n\");\r\n}\r\n\r\n\/\/Signal handler for a \"floating point exception\", which can also be integer division by zero errors.\r\nvoid signal_FPE(int n)\r\n{\r\n    (void)n;\r\n    logError(\"Arithmetic exception.\\n\");\r\n    exit(1);\r\n}\r\n\r\nint main(int argc, char **argv)\r\n{\r\n#if defined(__linux__) || (defined(__APPLE__) && defined(__MACH__))\r\n    \/\/Lower the process priority on linux and mac. On windows this is done on process creation from the GUI.\r\n    setpriority(PRIO_PROCESS, 0, 10);\r\n#endif\r\n\r\n    \/\/Register the exception handling for arithmic exceptions, this prevents the \"something went wrong\" dialog on windows to pop up on a division by zero.\r\n    signal(SIGFPE, signal_FPE);\r\n\r\n    ConfigSettings config;\r\n    fffProcessor processor(config);\r\n\r\n    logError(\"Cura_SteamEngine version %s\\n\", VERSION);\r\n\r\n    if(!config.readSettings()) {\r\n        logError(\"Default config '%s' not used\\n\", DEFAULT_CONFIG_PATH);\r\n    }\r\n    \r\n    for(int argn = 1; argn < argc; argn++)\r\n    {\r\n        char* str = argv[argn];\r\n        if (str[0] == '-')\r\n        {\r\n            for(str++; *str; str++)\r\n            {\r\n                switch(*str)\r\n                {\r\n                case 'h':\r\n                    print_usage();\r\n                    exit(1);\r\n                case 'v':\r\n                    increaseVerboseLevel();\r\n                    break;\r\n                case 'p':\r\n                    enableProgressLogging();\r\n                    break;\r\n                case 'g':\r\n                    argn++;\r\n                    \/\/Connect the GUI socket to the given port number.\r\n                    processor.guiConnect(atoi(argv[argn]));\r\n                    break;\r\n                case 'b':\r\n                    argn++;\r\n                    \/\/The binaryMeshBlob is depricated and will be removed in the future.\r\n                    binaryMeshBlob = fopen(argv[argn], \"rb\");\r\n                    break;\r\n                case 'o':\r\n                    argn++;\r\n                    if (!processor.setTargetFile(argv[argn]))\r\n                    {\r\n                        logError(\"Failed to open %s for output.\\n\", argv[argn]);\r\n                        exit(1);\r\n                    }\r\n                    break;\r\n                case 'c':\r\n                    {\r\n                        \/\/ Read a config file from the given path\r\n                        argn++;\r\n                        if(!config.readSettings(argv[argn])) {\r\n                            logError(\"Failed to read config '%s'\\n\", argv[argn]);\r\n                        }\r\n                    }\r\n                    break;\r\n                case 's':\r\n                    {\r\n                        \/\/Parse the given setting and store it.\r\n                        argn++;\r\n                        char* valuePtr = strchr(argv[argn], '=');\r\n                        if (valuePtr)\r\n                        {\r\n                            *valuePtr++ = '\\0';\r\n\r\n                            if (!config.setSetting(argv[argn], valuePtr))\r\n                                logError(\"Setting not found: %s %s\\n\", argv[argn], valuePtr);\r\n                        }\r\n                    }\r\n                    break;\r\n                case 'm':\r\n                    \/\/Read the given rotation\/scale matrix\r\n                    argn++;\r\n                    sscanf(argv[argn], \"%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf\",\r\n                        &config.matrix.m[0][0], &config.matrix.m[0][1], &config.matrix.m[0][2],\r\n                        &config.matrix.m[1][0], &config.matrix.m[1][1], &config.matrix.m[1][2],\r\n                        &config.matrix.m[2][0], &config.matrix.m[2][1], &config.matrix.m[2][2]);\r\n                    break;\r\n                default:\r\n                    logError(\"Unknown option: %c\\n\", *str);\r\n                    break;\r\n                }\r\n            }\r\n        }else{\r\n            try {\r\n                \/\/Catch all exceptions, this prevents the \"something went wrong\" dialog on windows to pop up on a thrown exception.\r\n                \/\/ Only ClipperLib currently throws exceptions. And only in case that it makes an internal error.\r\n                processor.processFile(argv[argn]);\r\n            }catch(...){\r\n                logError(\"Unknown exception\\n\");\r\n                exit(1);\r\n            }\r\n        }\r\n    }\r\n\r\n    \/\/Finalize the processor, this adds the end.gcode. And reports statistics.\r\n    processor.finalize();\r\n}\r\n<commit_msg>Add some more debug logging to catch that annoying bug.<commit_after>\/** Copyright (C) 2013 David Braam - Released under terms of the AGPLv3 License *\/\r\n#include <stdio.h>\r\n#include <stdlib.h>\r\n#include <string.h>\r\n#include <sys\/time.h>\r\n#include <signal.h>\r\n#if defined(__linux__) || (defined(__APPLE__) && defined(__MACH__))\r\n#include <execinfo.h>\r\n#include <sys\/resource.h>\r\n#endif\r\n#include <stddef.h>\r\n\r\n#include \"utils\/gettime.h\"\r\n#include \"utils\/logoutput.h\"\r\n#include \"sliceDataStorage.h\"\r\n\r\n#include \"modelFile\/modelFile.h\"\r\n#include \"settings.h\"\r\n#include \"optimizedModel.h\"\r\n#include \"multiVolumes.h\"\r\n#include \"polygonOptimizer.h\"\r\n#include \"slicer.h\"\r\n#include \"layerPart.h\"\r\n#include \"inset.h\"\r\n#include \"skin.h\"\r\n#include \"infill.h\"\r\n#include \"bridge.h\"\r\n#include \"support.h\"\r\n#include \"pathOrderOptimizer.h\"\r\n#include \"skirt.h\"\r\n#include \"raft.h\"\r\n#include \"comb.h\"\r\n#include \"gcodeExport.h\"\r\n#include \"fffProcessor.h\"\r\n\r\nvoid print_usage()\r\n{\r\n    log(\"usage: CuraEngine [-h] [-v] [-m 3x3matrix] [-c <config file>] [-s <settingkey>=<value>] -o <output.gcode> <model.stl>\\n\");\r\n}\r\n\r\n\/\/Signal handler for a \"floating point exception\", which can also be integer division by zero errors.\r\nvoid signal_FPE(int n)\r\n{\r\n    (void)n;\r\n    logError(\"Arithmetic exception.\\n\");\r\n    exit(1);\r\n}\r\n\r\nint main(int argc, char **argv)\r\n{\r\n#if defined(__linux__) || (defined(__APPLE__) && defined(__MACH__))\r\n    \/\/Lower the process priority on linux and mac. On windows this is done on process creation from the GUI.\r\n    setpriority(PRIO_PROCESS, 0, 10);\r\n#endif\r\n\r\n    \/\/Register the exception handling for arithmic exceptions, this prevents the \"something went wrong\" dialog on windows to pop up on a division by zero.\r\n    signal(SIGFPE, signal_FPE);\r\n\r\n    ConfigSettings config;\r\n    fffProcessor processor(config);\r\n\r\n    logError(\"Cura_SteamEngine version %s\\n\", VERSION);\r\n\r\n    if(!config.readSettings()) {\r\n        logError(\"Default config '%s' not used\\n\", DEFAULT_CONFIG_PATH);\r\n    }\r\n    for(int argn = 1; argn < argc; argn++)\r\n        log(\"Arg: %s\\n\", argv[argn]);\r\n    \r\n    for(int argn = 1; argn < argc; argn++)\r\n    {\r\n        char* str = argv[argn];\r\n        if (str[0] == '-')\r\n        {\r\n            for(str++; *str; str++)\r\n            {\r\n                switch(*str)\r\n                {\r\n                case 'h':\r\n                    print_usage();\r\n                    exit(1);\r\n                case 'v':\r\n                    increaseVerboseLevel();\r\n                    break;\r\n                case 'p':\r\n                    enableProgressLogging();\r\n                    break;\r\n                case 'g':\r\n                    argn++;\r\n                    \/\/Connect the GUI socket to the given port number.\r\n                    processor.guiConnect(atoi(argv[argn]));\r\n                    break;\r\n                case 'b':\r\n                    argn++;\r\n                    \/\/The binaryMeshBlob is depricated and will be removed in the future.\r\n                    binaryMeshBlob = fopen(argv[argn], \"rb\");\r\n                    break;\r\n                case 'o':\r\n                    argn++;\r\n                    if (!processor.setTargetFile(argv[argn]))\r\n                    {\r\n                        logError(\"Failed to open %s for output.\\n\", argv[argn]);\r\n                        exit(1);\r\n                    }\r\n                    break;\r\n                case 'c':\r\n                    {\r\n                        \/\/ Read a config file from the given path\r\n                        argn++;\r\n                        if(!config.readSettings(argv[argn])) {\r\n                            logError(\"Failed to read config '%s'\\n\", argv[argn]);\r\n                        }\r\n                    }\r\n                    break;\r\n                case 's':\r\n                    {\r\n                        \/\/Parse the given setting and store it.\r\n                        argn++;\r\n                        char* valuePtr = strchr(argv[argn], '=');\r\n                        if (valuePtr)\r\n                        {\r\n                            *valuePtr++ = '\\0';\r\n\r\n                            if (!config.setSetting(argv[argn], valuePtr))\r\n                                logError(\"Setting not found: %s %s\\n\", argv[argn], valuePtr);\r\n                        }\r\n                    }\r\n                    break;\r\n                case 'm':\r\n                    \/\/Read the given rotation\/scale matrix\r\n                    argn++;\r\n                    sscanf(argv[argn], \"%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf\",\r\n                        &config.matrix.m[0][0], &config.matrix.m[0][1], &config.matrix.m[0][2],\r\n                        &config.matrix.m[1][0], &config.matrix.m[1][1], &config.matrix.m[1][2],\r\n                        &config.matrix.m[2][0], &config.matrix.m[2][1], &config.matrix.m[2][2]);\r\n                    break;\r\n                default:\r\n                    logError(\"Unknown option: %c\\n\", *str);\r\n                    break;\r\n                }\r\n            }\r\n        }else{\r\n            try {\r\n                \/\/Catch all exceptions, this prevents the \"something went wrong\" dialog on windows to pop up on a thrown exception.\r\n                \/\/ Only ClipperLib currently throws exceptions. And only in case that it makes an internal error.\r\n                processor.processFile(argv[argn]);\r\n            }catch(...){\r\n                logError(\"Unknown exception\\n\");\r\n                exit(1);\r\n            }\r\n        }\r\n    }\r\n\r\n    \/\/Finalize the processor, this adds the end.gcode. And reports statistics.\r\n    processor.finalize();\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * $Id: XMSIPConnection.cpp,v 1.22 2007\/04\/10 19:04:32 hfriederich Exp $\n *\n * Copyright (c) 2006-2007 XMeeting Project (\"http:\/\/xmeeting.sf.net\").\n * All rights reserved.\n * Copyright (c) 2006-2007 Hannes Friederich. All rights reserved.\n *\/\n\n#include \"XMSIPConnection.h\"\n\n#include <opal\/mediafmt.h>\n#include <opal\/patch.h>\n#include <sip\/sipep.h>\n#include <ptclib\/enum.h>\n#include <codec\/rfc2833.h>\n#include \"XMOpalManager.h\"\n#include \"XMMediaFormats.h\"\n#include \"XMRFC2833Handler.h\"\n#include \"XMSIPEndPoint.h\"\n\nXMSIPConnection::XMSIPConnection(OpalCall & call,\n\t\t\t\t\t\t\t\t SIPEndPoint & endpoint,\n\t\t\t\t\t\t\t\t const PString & token,\n\t\t\t\t\t\t\t\t const SIPURL & address,\n\t\t\t\t\t\t\t\t OpalTransport * transport,\n\t\t\t\t\t\t\t\t unsigned int options,\n                                 OpalConnection::StringOptions * stringOptions)\n\n: SIPConnection(call, endpoint, token, address, transport, options, stringOptions)\n{\n\tinitialBandwidth = (XMOpalManager::GetManager()->GetBandwidthLimit() \/ 100);\n    bandwidthAvailable = initialBandwidth;\n    \n    \/\/ Delete the default RFC2833 handler and replace it with our own implementation\n\tdelete rfc2833Handler;\n\trfc2833Handler = new XMRFC2833Handler(PCREATE_NOTIFIER(OnUserInputInlineRFC2833));\n\t\n\tinBandDTMFHandler = NULL;\n}\n\nXMSIPConnection::~XMSIPConnection()\n{\n    delete inBandDTMFHandler;\n}\n\nvoid XMSIPConnection::OnCreatingINVITE(SIP_PDU & invite)\n{\n    \/* Add bandwidth information to SDP *\/\n\tif(invite.HasSDP()) {\n\t\tSDPSessionDescription & sdp = invite.GetSDP();\n\t\tunsigned bandwidth = bandwidthAvailable \/ 10;\n        sdp.SetBandwidthModifier(SDPSessionDescription::ApplicationSpecificBandwidthModifier);\n        sdp.SetBandwidthValue(bandwidth);\n\t}\n}\n\nBOOL XMSIPConnection::OnSendSDPMediaDescription(const SDPSessionDescription & sdpIn,\n\t\t\t\t\t\t\t\t\t\t\t\tconst OpalMediaType & mediaType,\n\t\t\t\t\t\t\t\t\t\t\t\tSDPSessionDescription & sdpOut)\n{\n\t\/\/ adjusting bandwidth information,\n\t\/\/ taking the lower value of remote (if set)\n\t\/\/ and own bandwidth limit\n\tPString bandwidthModifier = sdpIn.GetBandwidthModifier();\n\tif(bandwidthModifier.IsEmpty())\n\t{\n\t\tbandwidthModifier = SDPSessionDescription::ConferenceTotalBandwidthModifier;\n\t}\n\tsdpOut.SetBandwidthModifier(bandwidthModifier);\n\t\n\tunsigned remoteBandwidth = sdpIn.GetBandwidthValue();\n\tunsigned localBandwidth = bandwidthAvailable\/10;\n\tif(remoteBandwidth != 0 && remoteBandwidth < localBandwidth)\n\t{\n\t\tSetBandwidthAvailable(10*remoteBandwidth);\n\t}\n\tsdpOut.SetBandwidthValue(bandwidthAvailable\/10);\n\t\n    return SIPConnection::OnSendSDPMediaDescription(sdpIn, mediaType, sdpOut);\n}\n\nOpalMediaStream * XMSIPConnection::CreateMediaStream(const OpalMediaFormat & mediaFormat,\n\t\t\t\t\t\t\t\t\t\t\t\t\t BOOL isSource)\n{\n\t\/\/ Adjust some audio parameters if needed\n\tconst SDPMediaDescriptionList & mediaDescriptionList = remoteSDP.GetMediaDescriptions();\n\tfor(PINDEX i = 0; i < mediaDescriptionList.GetSize(); i++)\n\t{\n\t\tSDPMediaDescription & description = mediaDescriptionList[i];\n\t\tif(description.GetMediaType() == OpalDefaultAudioMediaType)\n\t\t{\n\t\t\tPINDEX packetTime = description.GetPacketTime();\n\t\t\tif(packetTime != 0)\n\t\t\t{\n\t\t\t\tXMOpalManager::GetManager()->SetCurrentAudioPacketTime(packetTime);\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\t\n\treturn SIPConnection::CreateMediaStream(mediaFormat, isSource);\n}\n\nBOOL XMSIPConnection::OnOpenMediaStream(OpalMediaStream & mediaStream)\n{\n\tif(!SIPConnection::OnOpenMediaStream(mediaStream))\n\t{\n\t\treturn FALSE;\n\t}\n    \n    XMOpalManager::GetManager()->OnOpenRTPMediaStream(*this, mediaStream);\n\t\n\treturn TRUE;\n}\n\nBOOL XMSIPConnection::SetBandwidthAvailable(unsigned newBandwidth, BOOL force)\n{\n\tbandwidthAvailable = std::min(initialBandwidth, newBandwidth);\n    GetCall().GetOtherPartyConnection(*this)->SetBandwidthAvailable(bandwidthAvailable, force);\n\treturn TRUE;\n}\n\nBOOL XMSIPConnection::SendUserInputTone(char tone, unsigned duration)\n{\n    \/\/ Separate RFC2833 is not implemented. Therefore it is used within\n    \/\/ XMeeting to signal in-band DTMF\n\tif(sendUserInputMode == OpalConnection::SendUserInputAsSeparateRFC2833 &&\n\t   inBandDTMFHandler != NULL)\n\t{\n\t\tinBandDTMFHandler->SendTone(tone, duration);\n\t\treturn TRUE;\n\t}\n\t\n\treturn SIPConnection::SendUserInputTone(tone, duration);\n}\n\nvoid XMSIPConnection::OnPatchMediaStream(BOOL isSource, OpalMediaPatch & patch)\n{\n\tSIPConnection::OnPatchMediaStream(isSource, patch);\n\t\n    \/\/ Add the in-band DTMF handler if this is an audio sending stream\n\tif(!isSource && patch.GetSource().GetMediaFormat().GetMediaType() == OpalDefaultAudioMediaType)\n\t{\n\t\tif(inBandDTMFHandler == NULL)\n\t\t{\n\t\t\tinBandDTMFHandler = new XMInBandDTMFHandler();\n\t\t}\n\t\tpatch.AddFilter(inBandDTMFHandler->GetTransmitHandler(), OpalPCM16);\n\t}\n}\n\nvoid XMSIPConnection::CleanUp()\n{\n    \/\/ Abort all pending transactions\n    PWaitAndSignal m(jobProcessingMutex);\n    for (PINDEX i = transactions.GetSize(); i > 0; i--) {\n        const PString & key = transactions.GetKeyAt(i-1);\n        transactions[key].Abort();\n    }\n}\n\nvoid XMSIPConnection::OnReleased()\n{\n    XMSIPEndPoint * sipEndPoint = XMOpalManager::GetSIPEndPoint();\n    sipEndPoint->AddReleasingConnection(this);\n    SIPConnection::OnReleased();\n    sipEndPoint->RemoveReleasingConnection(this);\n}\n<commit_msg>Fix for API changes in OPAL<commit_after>\/*\n * $Id: XMSIPConnection.cpp,v 1.23 2007\/05\/04 09:53:15 hfriederich Exp $\n *\n * Copyright (c) 2006-2007 XMeeting Project (\"http:\/\/xmeeting.sf.net\").\n * All rights reserved.\n * Copyright (c) 2006-2007 Hannes Friederich. All rights reserved.\n *\/\n\n#include \"XMSIPConnection.h\"\n\n#include <opal\/mediafmt.h>\n#include <opal\/patch.h>\n#include <sip\/sipep.h>\n#include <ptclib\/enum.h>\n#include <codec\/rfc2833.h>\n#include \"XMOpalManager.h\"\n#include \"XMMediaFormats.h\"\n#include \"XMRFC2833Handler.h\"\n#include \"XMSIPEndPoint.h\"\n\nXMSIPConnection::XMSIPConnection(OpalCall & call,\n\t\t\t\t\t\t\t\t SIPEndPoint & endpoint,\n\t\t\t\t\t\t\t\t const PString & token,\n\t\t\t\t\t\t\t\t const SIPURL & address,\n\t\t\t\t\t\t\t\t OpalTransport * transport,\n\t\t\t\t\t\t\t\t unsigned int options,\n                                 OpalConnection::StringOptions * stringOptions)\n\n: SIPConnection(call, endpoint, token, address, transport, options, stringOptions)\n{\n\tinitialBandwidth = (XMOpalManager::GetManager()->GetBandwidthLimit() \/ 100);\n    bandwidthAvailable = initialBandwidth;\n    \n    \/\/ Delete the default RFC2833 handler and replace it with our own implementation\n\tdelete rfc2833Handler;\n\trfc2833Handler = new XMRFC2833Handler(PCREATE_NOTIFIER(OnUserInputInlineRFC2833));\n\t\n\tinBandDTMFHandler = NULL;\n}\n\nXMSIPConnection::~XMSIPConnection()\n{\n    delete inBandDTMFHandler;\n}\n\nvoid XMSIPConnection::OnCreatingINVITE(SIP_PDU & invite)\n{\n    \/* Add bandwidth information to SDP *\/\n\tif(invite.HasSDP()) {\n\t\tSDPSessionDescription & sdp = invite.GetSDP();\n\t\tunsigned bandwidth = bandwidthAvailable \/ 10;\n        sdp.SetBandwidthModifier(SDPSessionDescription::ApplicationSpecificBandwidthModifier());\n        sdp.SetBandwidthValue(bandwidth);\n\t}\n}\n\nBOOL XMSIPConnection::OnSendSDPMediaDescription(const SDPSessionDescription & sdpIn,\n\t\t\t\t\t\t\t\t\t\t\t\tconst OpalMediaType & mediaType,\n\t\t\t\t\t\t\t\t\t\t\t\tSDPSessionDescription & sdpOut)\n{\n\t\/\/ adjusting bandwidth information,\n\t\/\/ taking the lower value of remote (if set)\n\t\/\/ and own bandwidth limit\n\tPString bandwidthModifier = sdpIn.GetBandwidthModifier();\n\tif(bandwidthModifier.IsEmpty())\n\t{\n\t\tbandwidthModifier = SDPSessionDescription::ConferenceTotalBandwidthModifier();\n\t}\n\tsdpOut.SetBandwidthModifier(bandwidthModifier);\n\t\n\tunsigned remoteBandwidth = sdpIn.GetBandwidthValue();\n\tunsigned localBandwidth = bandwidthAvailable\/10;\n\tif(remoteBandwidth != 0 && remoteBandwidth < localBandwidth)\n\t{\n\t\tSetBandwidthAvailable(10*remoteBandwidth);\n\t}\n\tsdpOut.SetBandwidthValue(bandwidthAvailable\/10);\n\t\n    return SIPConnection::OnSendSDPMediaDescription(sdpIn, mediaType, sdpOut);\n}\n\nOpalMediaStream * XMSIPConnection::CreateMediaStream(const OpalMediaFormat & mediaFormat,\n\t\t\t\t\t\t\t\t\t\t\t\t\t BOOL isSource)\n{\n\t\/\/ Adjust some audio parameters if needed\n\tconst SDPMediaDescriptionList & mediaDescriptionList = remoteSDP.GetMediaDescriptions();\n\tfor(PINDEX i = 0; i < mediaDescriptionList.GetSize(); i++)\n\t{\n\t\tSDPMediaDescription & description = mediaDescriptionList[i];\n\t\tif(description.GetMediaType() == OpalDefaultAudioMediaType)\n\t\t{\n\t\t\tPINDEX packetTime = description.GetPacketTime();\n\t\t\tif(packetTime != 0)\n\t\t\t{\n\t\t\t\tXMOpalManager::GetManager()->SetCurrentAudioPacketTime(packetTime);\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\t\n\treturn SIPConnection::CreateMediaStream(mediaFormat, isSource);\n}\n\nBOOL XMSIPConnection::OnOpenMediaStream(OpalMediaStream & mediaStream)\n{\n\tif(!SIPConnection::OnOpenMediaStream(mediaStream))\n\t{\n\t\treturn FALSE;\n\t}\n    \n    XMOpalManager::GetManager()->OnOpenRTPMediaStream(*this, mediaStream);\n\t\n\treturn TRUE;\n}\n\nBOOL XMSIPConnection::SetBandwidthAvailable(unsigned newBandwidth, BOOL force)\n{\n\tbandwidthAvailable = std::min(initialBandwidth, newBandwidth);\n    GetCall().GetOtherPartyConnection(*this)->SetBandwidthAvailable(bandwidthAvailable, force);\n\treturn TRUE;\n}\n\nBOOL XMSIPConnection::SendUserInputTone(char tone, unsigned duration)\n{\n    \/\/ Separate RFC2833 is not implemented. Therefore it is used within\n    \/\/ XMeeting to signal in-band DTMF\n\tif(sendUserInputMode == OpalConnection::SendUserInputAsSeparateRFC2833 &&\n\t   inBandDTMFHandler != NULL)\n\t{\n\t\tinBandDTMFHandler->SendTone(tone, duration);\n\t\treturn TRUE;\n\t}\n\t\n\treturn SIPConnection::SendUserInputTone(tone, duration);\n}\n\nvoid XMSIPConnection::OnPatchMediaStream(BOOL isSource, OpalMediaPatch & patch)\n{\n\tSIPConnection::OnPatchMediaStream(isSource, patch);\n\t\n    \/\/ Add the in-band DTMF handler if this is an audio sending stream\n\tif(!isSource && patch.GetSource().GetMediaFormat().GetMediaType() == OpalDefaultAudioMediaType)\n\t{\n\t\tif(inBandDTMFHandler == NULL)\n\t\t{\n\t\t\tinBandDTMFHandler = new XMInBandDTMFHandler();\n\t\t}\n\t\tpatch.AddFilter(inBandDTMFHandler->GetTransmitHandler(), OpalPCM16);\n\t}\n}\n\nvoid XMSIPConnection::CleanUp()\n{\n    \/\/ Abort all pending transactions\n    PWaitAndSignal m(jobProcessingMutex);\n    for (PINDEX i = transactions.GetSize(); i > 0; i--) {\n        const PString & key = transactions.GetKeyAt(i-1);\n        transactions[key].Abort();\n    }\n}\n\nvoid XMSIPConnection::OnReleased()\n{\n    XMSIPEndPoint * sipEndPoint = XMOpalManager::GetSIPEndPoint();\n    sipEndPoint->AddReleasingConnection(this);\n    SIPConnection::OnReleased();\n    sipEndPoint->RemoveReleasingConnection(this);\n}\n<|endoftext|>"}
{"text":"<commit_before>1602359c-2f67-11e5-ab0e-6c40088e03e4<commit_msg>16093c70-2f67-11e5-a38c-6c40088e03e4<commit_after>16093c70-2f67-11e5-a38c-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>644c4512-2e3a-11e5-8d61-c03896053bdd<commit_msg>645966d2-2e3a-11e5-99d4-c03896053bdd<commit_after>645966d2-2e3a-11e5-99d4-c03896053bdd<|endoftext|>"}
{"text":"<commit_before>#include <RenHook\/RenHook.hpp>\n#include <RenHook\/Capstone\/Capstone.hpp>\n\nRenHook::Capstone::Capstone()\n    : m_handle(0)\n    , m_instructionInfo(nullptr)\n    , m_instructions(0)\n{\n    if (cs_open(CS_ARCH_X86, CS_MODE_64, &m_handle) != CS_ERR_OK)\n    {\n        LOG_ERROR << \"Fail to initialize Capstone handle\";\n    }\n}\n\nRenHook::Capstone::~Capstone()\n{\n    if (m_handle != 0)\n    {\n        ReleaseInstructions();\n        cs_close(&m_handle);\n    }\n}\n\nconst size_t RenHook::Capstone::Disassemble(const uintptr_t Address, const size_t Size)\n{\n    size_t Result = 0;\n\n    if (m_handle != 0)\n    {\n        ReleaseInstructions();\n\n        Result = cs_disasm(m_handle, reinterpret_cast<uint8_t*>(Address), Size, Address, 0, &m_instructionInfo);\n        m_instructions = Result;\n    }\n\n    return Result;\n}\n\nconst size_t RenHook::Capstone::GetInstructionSize(size_t Index) const\n{\n    return m_instructionInfo[Index].size;\n}\n\nconst size_t RenHook::Capstone::GetTotalNumberOfInstruction() const\n{\n    return m_instructions;\n}\n\nvoid RenHook::Capstone::ReleaseInstructions()\n{\n    if (m_instructionInfo != nullptr)\n    {\n        cs_free(m_instructionInfo, m_instructions);\n    }\n}\n<commit_msg>Add index check for \"Capstone::GetInstructionSize\"<commit_after>#include <RenHook\/RenHook.hpp>\n#include <RenHook\/Capstone\/Capstone.hpp>\n\nRenHook::Capstone::Capstone()\n    : m_handle(0)\n    , m_instructionInfo(nullptr)\n    , m_instructions(0)\n{\n    if (cs_open(CS_ARCH_X86, CS_MODE_64, &m_handle) != CS_ERR_OK)\n    {\n        LOG_ERROR << \"Fail to initialize Capstone handle\";\n    }\n}\n\nRenHook::Capstone::~Capstone()\n{\n    if (m_handle != 0)\n    {\n        ReleaseInstructions();\n        cs_close(&m_handle);\n    }\n}\n\nconst size_t RenHook::Capstone::Disassemble(const uintptr_t Address, const size_t Size)\n{\n    size_t Result = 0;\n\n    if (m_handle != 0)\n    {\n        ReleaseInstructions();\n\n        Result = cs_disasm(m_handle, reinterpret_cast<uint8_t*>(Address), Size, Address, 0, &m_instructionInfo);\n        m_instructions = Result;\n    }\n\n    return Result;\n}\n\nconst size_t RenHook::Capstone::GetInstructionSize(size_t Index) const\n{\n    if (Index < 0 || Index >= m_instructions)\n    {\n        return 0;\n    }\n\n    return m_instructionInfo[Index].size;\n}\n\nconst size_t RenHook::Capstone::GetTotalNumberOfInstruction() const\n{\n    return m_instructions;\n}\n\nvoid RenHook::Capstone::ReleaseInstructions()\n{\n    if (m_instructionInfo != nullptr)\n    {\n        cs_free(m_instructionInfo, m_instructions);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2014 Zubax, zubax.com\n * Please refer to the file LICENSE for terms and conditions.\n * Author: Pavel Kirienko <pavel.kirienko@zubax.com>\n *\/\n\n#pragma once\n\n#include <functional>\n#include <ros\/ros.h>\n#include <gps_common\/GPSFix.h>\n#include <eigen_conversions\/eigen_msg.h>\n#include \"linear_algebra.hpp\"\n#include \"debug_publisher.hpp\"\n#include \"exception.hpp\"\n#include \"mathematica.hpp\"\n\nnamespace zubax_posekf\n{\n\/**\n * This is the representation that can be directly used by the filter.\n *\/\nstruct GNSSLocalPosVel\n{\n    ros::Time timestamp;\n\n    Vector3 position;\n    Matrix3 position_covariance;\n\n    Vector3 velocity;\n    Matrix3 velocity_covariance;\n\n    GNSSLocalPosVel()\n    {\n        position.setZero();\n        position_covariance.setZero();\n\n        velocity.setZero();\n        velocity_covariance.setZero();\n    }\n\n    bool isValid() const { return timestamp.isValid(); }\n};\n\n\/**\n * Geo coordinates expressed as longitude and latitude degrees (not radians).\n *\/\nstruct GeoLonLat\n{\n    Scalar lon = 0.0;\n    Scalar lat = 0.0;\n\n    GeoLonLat() { }\n\n    GeoLonLat(Scalar arg_lon, Scalar arg_lat)\n        : lon(arg_lon)\n        , lat(arg_lat)\n    { }\n};\n\n\/**\n * This class converts between spherical geo coordinates and metric offset around certain origin.\n *\/\nclass GeoPositionConverter\n{\n    const Scalar MetersPerLatDegree = (110567.0 + 111699.0) * 0.5; \/\/ average from equator to poles\n    const Scalar MetersPerLonDegreeOnEquator = 111321.0;\n\n    const GeoLonLat origin_;\n\n    Scalar latM2Deg(Scalar m) const { return m \/ MetersPerLatDegree; }\n    Scalar latDeg2M(Scalar d) const { return d * MetersPerLatDegree; }\n\n    Scalar lonMPerDeg(Scalar lat) const\n    {\n        return MetersPerLonDegreeOnEquator * ((90. - std::min(std::abs(lat), Scalar(89.999999))) \/ 90.);\n    }\n\n    Scalar lonM2Deg(Scalar lat, Scalar m) const { return m \/ lonMPerDeg(lat); }\n    Scalar lonDeg2M(Scalar lat, Scalar d) const { return d * lonMPerDeg(lat); }\n\npublic:\n    GeoPositionConverter(const GeoLonLat& arg_origin)\n        : origin_(arg_origin)\n    { }\n\n    Vector<2> convertGeoToMetric(const GeoLonLat& geo) const\n    {\n        Vector<2> metric;\n        metric[1] = latDeg2M(geo.lat - origin_.lat);          \/\/ lat, Y\n        metric[0] = lonDeg2M(geo.lat, geo.lon - origin_.lon); \/\/ lon, X\n        return metric;\n    }\n\n    GeoLonLat convertMetricToGeo(const Vector<2>& metric) const\n    {\n        GeoLonLat geo;\n        geo.lat = latM2Deg(metric[1]) + origin_.lat;          \/\/ lat, Y\n        geo.lon = lonM2Deg(geo.lat, metric[0]) + origin_.lon; \/\/ lon, X\n        return geo;\n    }\n};\n\n\/**\n * This class obtains GNSS measurements from the specified ROS topic and converts them to proper form.\n *\/\nclass GNSSProvider\n{\n    const Scalar DefaultTrackStdevDeg = 30.0;\n    const Scalar DefaultClimbRateStdevMS = 4.0;\n    const Scalar MaxSaneSpeedMS = 515.0;\n\n    ros::Subscriber sub_gnss_;\n    DebugPublisher pub_debug_;\n\n    GeoLonLat origin_;\n    bool origin_set_ = false;\n\n    GNSSLocalPosVel last_sample_;\n\n    struct Config\n    {\n        int min_sats_to_init_origin = 0;\n        double max_err_horz_to_init_origin = 40.0;\n\n        Config()\n        {\n            ros::NodeHandle node(\"~gnss\");\n\n            (void)node.getParam(\"min_sats_to_init_origin\", min_sats_to_init_origin);\n            (void)node.getParam(\"max_err_horz_to_init_origin\", max_err_horz_to_init_origin);\n\n            ROS_INFO(\"GNSS Provider:\\n\"\n                     \"\\t~gnss\/min_sats_to_init_origin     = %d\\n\"\n                     \"\\t~gnss\/max_err_horz_to_init_origin = %f\",\n                     min_sats_to_init_origin,\n                     max_err_horz_to_init_origin);\n        }\n    } const config_;\n\n    std::pair<Vector3, Matrix3> computeLocalPositionWithCovariance(const gps_common::GPSFix& msg) const\n    {\n        enforce(\"GNSS origin is not set\", origin_set_);\n\n        const auto metric = GeoPositionConverter(origin_).convertGeoToMetric(GeoLonLat(msg.longitude, msg.latitude));\n\n        Vector3 pos;\n        pos[0] = metric[0];\n        pos[1] = metric[1];\n        pos[2] = msg.altitude;\n\n        Matrix3 cov;\n        cov.setZero();\n        if (msg.position_covariance_type == msg.COVARIANCE_TYPE_UNKNOWN)\n        {\n            cov(0, 0) = msg.err_horz * msg.err_horz;\n            cov(1, 1) = msg.err_horz * msg.err_horz;\n            cov(2, 2) = msg.err_vert * msg.err_vert;\n        }\n        else\n        {\n            cov = matrixMsgToEigen<3, 3>(msg.position_covariance);\n            cov = (cov + cov.transpose()) * 0.5;          \/\/ Ensure it's symmetric\n        }\n\n        enforce(\"GNSS position\", cov.sum() > 0);\n\n        return {pos, cov};\n    }\n\n    std::pair<Vector3, Matrix3> computeVelocityVectorWithCovariance(const gps_common::GPSFix& msg) const\n    {\n        using namespace mathematica;\n\n        const Scalar gnssTrack = msg.track * Degree;\n        const Scalar gnssSpeed = msg.speed;\n        const Scalar gnssClimb = msg.climb;\n\n        enforce(\"GNSS track, speed, climb\",\n                (Abs(gnssTrack) <= 2.0 * Pi) &&\n                (Abs(gnssSpeed) < MaxSaneSpeedMS) &&\n                (Abs(gnssClimb) < MaxSaneSpeedMS));\n\n        const auto vel = List(List(gnssSpeed * Sin(gnssTrack)),  \/\/ Lon\n                              List(gnssSpeed * Cos(gnssTrack)),  \/\/ Lat\n                              List(gnssClimb));                  \/\/ Climb\n\n        const Scalar err_track_rad = ((msg.err_track > 0) ? msg.err_track : DefaultTrackStdevDeg) * Degree;\n\n        const auto Rpolar = List(List(Power(err_track_rad, 2), 0, 0),  \/\/ stdev --> covariance matrix\n                                 List(0, Power(msg.err_speed, 2), 0),\n                                 List(0, 0, Power((msg.err_climb > 0) ? msg.err_climb : DefaultClimbRateStdevMS, 2)));\n\n        if ((Rpolar(0, 0) <= 0) || (Rpolar(1, 1) <= 0) || (Rpolar(2, 2) <= 0))\n        {\n            std::ostringstream os;\n            os << \"GNSS R polar:\\n\" << Rpolar;\n            throw Exception(os.str());\n        }\n\n        \/\/ Convariance transformation Jacobian\n        const auto Gpolar = List(List(gnssSpeed * Cos(gnssTrack), Sin(gnssTrack), 0),\n                                 List(-(gnssSpeed * Sin(gnssTrack)), Cos(gnssTrack), 0),\n                                 List(0, 0, 1));\n\n        const Matrix3 R = Gpolar * Rpolar * Gpolar.transpose();\n\n        if ((R(0, 0) <= 0) || (R(1, 1) <= 0) || (R(2, 2) <= 0) || !std::isfinite(R.sum()))\n        {\n            std::ostringstream os;\n            os << \"GNSS R vel:\\n\" << R << \"\\nGNSS R polar:\\n\" << Rpolar;\n            throw Exception(os.str());\n        }\n\n        return {vel, R};\n    }\n\n    void cbGnss(const gps_common::GPSFix& msg)\n    {\n        \/*\n         * Drop invalid messages\n         *\/\n        {\n            const bool has_fix = msg.status.status >= msg.status.STATUS_FIX;\n            const bool sats_ok = msg.status.satellites_used > 3;\n            if (!has_fix || !sats_ok)\n            {\n                ROS_DEBUG(\"GNSS Provider: Message dropped: status=%d, nsats=%d\",\n                          msg.status.status, msg.status.satellites_used);\n                return;\n            }\n        }\n\n        \/*\n         * Initialize origin if necessary\n         *\/\n        if (!origin_set_)\n        {\n            if (msg.status.satellites_used >= config_.min_sats_to_init_origin &&\n                msg.err_horz < config_.max_err_horz_to_init_origin &&\n                msg.status.status >= msg.status.STATUS_FIX)\n            {\n                origin_.lon = msg.longitude;\n                origin_.lat = msg.latitude;\n                origin_set_ = true;\n                ROS_INFO(\"GNSS Provider: Origin at lon=%f, lat=%f\", origin_.lon, origin_.lat);\n            }\n            else\n            {\n                ROS_INFO_THROTTLE(1, \"GNSS Provider: Can't initialize origin: nsats=%d, err_horz=%f, status=%d\",\n                                  msg.status.satellites_used, msg.err_horz, static_cast<int>(msg.status.status));\n                return;\n            }\n        }\n\n        \/*\n         * Position and covariance\n         *\/\n        const auto pos_and_cov = computeLocalPositionWithCovariance(msg);\n        pub_debug_.publish(\"gnss_pos\", pos_and_cov.first);\n        pub_debug_.publish(\"gnss_pos_cov\", pos_and_cov.second);\n\n        \/*\n         * Velocity and covariance\n         *\/\n        const auto vel_and_cov = computeVelocityVectorWithCovariance(msg);\n        pub_debug_.publish(\"gnss_vel\", vel_and_cov.first);\n        pub_debug_.publish(\"gnss_vel_cov\", vel_and_cov.second);\n\n        \/*\n         * Output\n         *\/\n        last_sample_.timestamp = msg.header.stamp;\n\n        last_sample_.velocity = vel_and_cov.first;\n        last_sample_.velocity_covariance = vel_and_cov.second;\n\n        last_sample_.position = pos_and_cov.first;\n        last_sample_.position_covariance = pos_and_cov.second;\n\n        ROS_ASSERT(origin_set_);\n        if (on_sample)\n        {\n            on_sample(last_sample_, msg);\n        }\n    }\n\npublic:\n    GNSSProvider(ros::NodeHandle& node, const std::string topic)\n    {\n        sub_gnss_ = node.subscribe(topic, 10, &GNSSProvider::cbGnss, this);\n    }\n\n    GNSSLocalPosVel getLastSample() const { return last_sample_; }\n\n    GeoLonLat getOrigin() const { return origin_; }\n    bool isOriginSet() const { return origin_set_; }\n\n    std::function<void (const GNSSLocalPosVel&, const gps_common::GPSFix&)> on_sample;\n};\n\n}\n<commit_msg>Better GNSS failure debug output<commit_after>\/*\n * Copyright (c) 2014 Zubax, zubax.com\n * Please refer to the file LICENSE for terms and conditions.\n * Author: Pavel Kirienko <pavel.kirienko@zubax.com>\n *\/\n\n#pragma once\n\n#include <functional>\n#include <ros\/ros.h>\n#include <gps_common\/GPSFix.h>\n#include <eigen_conversions\/eigen_msg.h>\n#include \"linear_algebra.hpp\"\n#include \"debug_publisher.hpp\"\n#include \"exception.hpp\"\n#include \"mathematica.hpp\"\n\nnamespace zubax_posekf\n{\n\/**\n * This is the representation that can be directly used by the filter.\n *\/\nstruct GNSSLocalPosVel\n{\n    ros::Time timestamp;\n\n    Vector3 position;\n    Matrix3 position_covariance;\n\n    Vector3 velocity;\n    Matrix3 velocity_covariance;\n\n    GNSSLocalPosVel()\n    {\n        position.setZero();\n        position_covariance.setZero();\n\n        velocity.setZero();\n        velocity_covariance.setZero();\n    }\n\n    bool isValid() const { return timestamp.isValid(); }\n};\n\n\/**\n * Geo coordinates expressed as longitude and latitude degrees (not radians).\n *\/\nstruct GeoLonLat\n{\n    Scalar lon = 0.0;\n    Scalar lat = 0.0;\n\n    GeoLonLat() { }\n\n    GeoLonLat(Scalar arg_lon, Scalar arg_lat)\n        : lon(arg_lon)\n        , lat(arg_lat)\n    { }\n};\n\n\/**\n * This class converts between spherical geo coordinates and metric offset around certain origin.\n *\/\nclass GeoPositionConverter\n{\n    const Scalar MetersPerLatDegree = (110567.0 + 111699.0) * 0.5; \/\/ average from equator to poles\n    const Scalar MetersPerLonDegreeOnEquator = 111321.0;\n\n    const GeoLonLat origin_;\n\n    Scalar latM2Deg(Scalar m) const { return m \/ MetersPerLatDegree; }\n    Scalar latDeg2M(Scalar d) const { return d * MetersPerLatDegree; }\n\n    Scalar lonMPerDeg(Scalar lat) const\n    {\n        return MetersPerLonDegreeOnEquator * ((90. - std::min(std::abs(lat), Scalar(89.999999))) \/ 90.);\n    }\n\n    Scalar lonM2Deg(Scalar lat, Scalar m) const { return m \/ lonMPerDeg(lat); }\n    Scalar lonDeg2M(Scalar lat, Scalar d) const { return d * lonMPerDeg(lat); }\n\npublic:\n    GeoPositionConverter(const GeoLonLat& arg_origin)\n        : origin_(arg_origin)\n    { }\n\n    Vector<2> convertGeoToMetric(const GeoLonLat& geo) const\n    {\n        Vector<2> metric;\n        metric[1] = latDeg2M(geo.lat - origin_.lat);          \/\/ lat, Y\n        metric[0] = lonDeg2M(geo.lat, geo.lon - origin_.lon); \/\/ lon, X\n        return metric;\n    }\n\n    GeoLonLat convertMetricToGeo(const Vector<2>& metric) const\n    {\n        GeoLonLat geo;\n        geo.lat = latM2Deg(metric[1]) + origin_.lat;          \/\/ lat, Y\n        geo.lon = lonM2Deg(geo.lat, metric[0]) + origin_.lon; \/\/ lon, X\n        return geo;\n    }\n};\n\n\/**\n * This class obtains GNSS measurements from the specified ROS topic and converts them to proper form.\n *\/\nclass GNSSProvider\n{\n    const Scalar DefaultTrackStdevDeg = 30.0;\n    const Scalar DefaultClimbRateStdevMS = 4.0;\n    const Scalar MaxSaneSpeedMS = 515.0;\n\n    ros::Subscriber sub_gnss_;\n    DebugPublisher pub_debug_;\n\n    GeoLonLat origin_;\n    bool origin_set_ = false;\n\n    GNSSLocalPosVel last_sample_;\n\n    struct Config\n    {\n        int min_sats_to_init_origin = 0;\n        double max_err_horz_to_init_origin = 40.0;\n\n        Config()\n        {\n            ros::NodeHandle node(\"~gnss\");\n\n            (void)node.getParam(\"min_sats_to_init_origin\", min_sats_to_init_origin);\n            (void)node.getParam(\"max_err_horz_to_init_origin\", max_err_horz_to_init_origin);\n\n            ROS_INFO(\"GNSS Provider:\\n\"\n                     \"\\t~gnss\/min_sats_to_init_origin     = %d\\n\"\n                     \"\\t~gnss\/max_err_horz_to_init_origin = %f\",\n                     min_sats_to_init_origin,\n                     max_err_horz_to_init_origin);\n        }\n    } const config_;\n\n    std::pair<Vector3, Matrix3> computeLocalPositionWithCovariance(const gps_common::GPSFix& msg) const\n    {\n        enforce(\"GNSS origin is not set\", origin_set_);\n\n        const auto metric = GeoPositionConverter(origin_).convertGeoToMetric(GeoLonLat(msg.longitude, msg.latitude));\n\n        Vector3 pos;\n        pos[0] = metric[0];\n        pos[1] = metric[1];\n        pos[2] = msg.altitude;\n\n        Matrix3 cov;\n        cov.setZero();\n        if (msg.position_covariance_type == msg.COVARIANCE_TYPE_UNKNOWN)\n        {\n            cov(0, 0) = msg.err_horz * msg.err_horz;\n            cov(1, 1) = msg.err_horz * msg.err_horz;\n            cov(2, 2) = msg.err_vert * msg.err_vert;\n        }\n        else\n        {\n            cov = matrixMsgToEigen<3, 3>(msg.position_covariance);\n            cov = (cov + cov.transpose()) * 0.5;          \/\/ Ensure it's symmetric\n        }\n\n        enforce(\"GNSS position\", cov.sum() > 0);\n\n        return {pos, cov};\n    }\n\n    std::pair<Vector3, Matrix3> computeVelocityVectorWithCovariance(const gps_common::GPSFix& msg) const\n    {\n        using namespace mathematica;\n\n        const Scalar gnssTrack = msg.track * Degree;\n        const Scalar gnssSpeed = msg.speed;\n        const Scalar gnssClimb = msg.climb;\n\n        enforce(\"GNSS track, speed, climb\",\n                (Abs(gnssTrack) <= 2.0 * Pi) &&\n                (Abs(gnssSpeed) < MaxSaneSpeedMS) &&\n                (Abs(gnssClimb) < MaxSaneSpeedMS));\n\n        const auto vel = List(List(gnssSpeed * Sin(gnssTrack)),  \/\/ Lon\n                              List(gnssSpeed * Cos(gnssTrack)),  \/\/ Lat\n                              List(gnssClimb));                  \/\/ Climb\n\n        const Scalar err_track_rad = ((msg.err_track > 0) ? msg.err_track : DefaultTrackStdevDeg) * Degree;\n\n        const auto Rpolar = List(List(Power(err_track_rad, 2), 0, 0),  \/\/ stdev --> covariance matrix\n                                 List(0, Power(msg.err_speed, 2), 0),\n                                 List(0, 0, Power((msg.err_climb > 0) ? msg.err_climb : DefaultClimbRateStdevMS, 2)));\n\n        if ((Rpolar(0, 0) <= 0) || (Rpolar(1, 1) <= 0) || (Rpolar(2, 2) <= 0))\n        {\n            std::ostringstream os;\n            os << \"GNSS R polar:\\n\" << Rpolar;\n            throw Exception(os.str());\n        }\n\n        \/\/ Convariance transformation Jacobian\n        const auto Gpolar = List(List(gnssSpeed * Cos(gnssTrack), Sin(gnssTrack), 0),\n                                 List(-(gnssSpeed * Sin(gnssTrack)), Cos(gnssTrack), 0),\n                                 List(0, 0, 1));\n\n        const Matrix3 R = Gpolar * Rpolar * Gpolar.transpose();\n\n        if ((R(0, 0) <= 0) || (R(1, 1) <= 0) || (R(2, 2) <= 0) || !std::isfinite(R.sum()))\n        {\n            std::ostringstream os;\n            os << \"GNSS R vel:\\n\" << R << \"\\nGNSS R polar:\\n\" << Rpolar << \"\\nGNSS G polar:\\n\" << Gpolar\n                << \"\\ntrack=\" << gnssTrack << \"\\nspeed=\" << gnssSpeed;\n            throw Exception(os.str());\n        }\n\n        return {vel, R};\n    }\n\n    void cbGnss(const gps_common::GPSFix& msg)\n    {\n        \/*\n         * Drop invalid messages\n         *\/\n        {\n            const bool has_fix = msg.status.status >= msg.status.STATUS_FIX;\n            const bool sats_ok = msg.status.satellites_used > 3;\n            if (!has_fix || !sats_ok)\n            {\n                ROS_DEBUG(\"GNSS Provider: Message dropped: status=%d, nsats=%d\",\n                          msg.status.status, msg.status.satellites_used);\n                return;\n            }\n        }\n\n        \/*\n         * Initialize origin if necessary\n         *\/\n        if (!origin_set_)\n        {\n            if (msg.status.satellites_used >= config_.min_sats_to_init_origin &&\n                msg.err_horz < config_.max_err_horz_to_init_origin &&\n                msg.status.status >= msg.status.STATUS_FIX)\n            {\n                origin_.lon = msg.longitude;\n                origin_.lat = msg.latitude;\n                origin_set_ = true;\n                ROS_INFO(\"GNSS Provider: Origin at lon=%f, lat=%f\", origin_.lon, origin_.lat);\n            }\n            else\n            {\n                ROS_INFO_THROTTLE(1, \"GNSS Provider: Can't initialize origin: nsats=%d, err_horz=%f, status=%d\",\n                                  msg.status.satellites_used, msg.err_horz, static_cast<int>(msg.status.status));\n                return;\n            }\n        }\n\n        \/*\n         * Position and covariance\n         *\/\n        const auto pos_and_cov = computeLocalPositionWithCovariance(msg);\n        pub_debug_.publish(\"gnss_pos\", pos_and_cov.first);\n        pub_debug_.publish(\"gnss_pos_cov\", pos_and_cov.second);\n\n        \/*\n         * Velocity and covariance\n         *\/\n        const auto vel_and_cov = computeVelocityVectorWithCovariance(msg);\n        pub_debug_.publish(\"gnss_vel\", vel_and_cov.first);\n        pub_debug_.publish(\"gnss_vel_cov\", vel_and_cov.second);\n\n        \/*\n         * Output\n         *\/\n        last_sample_.timestamp = msg.header.stamp;\n\n        last_sample_.velocity = vel_and_cov.first;\n        last_sample_.velocity_covariance = vel_and_cov.second;\n\n        last_sample_.position = pos_and_cov.first;\n        last_sample_.position_covariance = pos_and_cov.second;\n\n        ROS_ASSERT(origin_set_);\n        if (on_sample)\n        {\n            on_sample(last_sample_, msg);\n        }\n    }\n\npublic:\n    GNSSProvider(ros::NodeHandle& node, const std::string topic)\n    {\n        sub_gnss_ = node.subscribe(topic, 10, &GNSSProvider::cbGnss, this);\n    }\n\n    GNSSLocalPosVel getLastSample() const { return last_sample_; }\n\n    GeoLonLat getOrigin() const { return origin_; }\n    bool isOriginSet() const { return origin_set_; }\n\n    std::function<void (const GNSSLocalPosVel&, const gps_common::GPSFix&)> on_sample;\n};\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  main.cpp\n\/\/\n\/\/  Copyright (c) 2014 J3NI. All rights reserved.\n\/\/\n\n\/\/ System Includes\n#include <stdio.h>\n#include <stdlib.h>\n#include <syslog.h>\n#include <unistd.h>\n\n#include <sys\/types.h>\n#include <sys\/socket.h>\n#include <netdb.h>\n\n#include <fstream>\n#include <iostream>\n#include <cstring>\n\n\/\/ Local Includes\n#include \"DaemonServer.h\"\n\n\/\/ Setup local log file\nstd::ofstream log_file(\n                       \"J3NI_log_file.log\", std::ios_base::out | std::ios_base::app );\n\nint main(int args, char** argv)\n{\n\n    int portnum=8087;\n    char* user = NULL;\n    char* password = NULL;\n\n    if(args==1){ \n    }\n    else if(args==3 && (strcmp(argv[1],\"-p\")==0)){\n\t    portnum = atoi(argv[2]);\n\t    if(portnum==0){\n\t\t    std::cout<< \"Invalid input entered\" << std::endl;\n\t\t    exit(EXIT_FAILURE);\n\t    }\n    }\n    else if(args==7){\n\t    bool portSet = false;\n\t    bool userSet = false;\n\t    bool passSet = false;\n\t   for(int i=1; i<6; i+=2){\n\t\t    if(strcmp(argv[i],\"-p\")==0 && !portSet){\n\t\t\t    portnum=atoi(argv[i+1]);\n\t\t\t    if(portnum==0){\n\t\t\t\t    std::cout<< \"Invalid input entered\" << std::endl;\n\t\t\t\t    exit(EXIT_FAILURE);\n\t\t\t    }\t\t\n\t\t\t    portSet=true;\n\t\t    }\n\t\t    if(strcmp(argv[i],\"-u\")==0 && !userSet){\n\t\t\t    user=argv[i+1];\n\t\t\t    userSet=true;\n\t\t    }\n\t\t    if(strcmp(argv[i],\"-k\")==0 && !passSet){\n\t\t\t    password=argv[i+1];\n\t\t\t    passSet=true;\n\t\t    }\t\t \n\t    }\n\t    if(!portSet || !userSet || !passSet){\t\/\/ If not all fields are set, exit\n\t\t    std::cout<< \"Invalid input entered\" << std::endl;\n\t\t    exit(EXIT_FAILURE);\n\t    }\n    }\n    else{\n\t    std::cout<< \"Invalid input entered\" << std::endl;\n\t    exit(EXIT_FAILURE);\n    }\n    \n    DaemonServer* udp_daemon = new J3NI_Daemon(portnum, user, password);\n\n    udp_daemon->startDaemon();\n    \n    \/\/! \\todo   Signal Handling\n    \n    \n    openlog(\"IpmiDaemon\", LOG_PID, LOG_DAEMON);\n    syslog(LOG_NOTICE, \"Daemon Started\");\n    \n    udpDaemon.startServer();\n    \n    while(1)\n    {\n        udpDaemon.receiveData();\n        \n        \/\/! \\todo   remaining implementation\n        sleep(2);\n    }\n    \n    return 1;\n}\n\n<commit_msg>main.cpp additional error fixes<commit_after>\/\/\n\/\/  main.cpp\n\/\/\n\/\/  Copyright (c) 2014 J3NI. All rights reserved.\n\/\/\n\n\/\/ System Includes\n#include <stdio.h>\n#include <stdlib.h>\n#include <syslog.h>\n#include <unistd.h>\n\n#include <sys\/types.h>\n#include <sys\/socket.h>\n#include <netdb.h>\n\n#include <fstream>\n#include <iostream>\n#include <cstring>\n\n\/\/ Local Includes\n#include \"DaemonServer.h\"\n\n\/\/ Setup local log file\nstd::ofstream log_file(\n                       \"J3NI_log_file.log\", std::ios_base::out | std::ios_base::app );\n\nint main(int args, char** argv)\n{\n\n    int portnum=8087;\n    char* user = NULL;\n    char* password = NULL;\n\n    if(args==1){ \n    }\n    else if(args==3 && (strcmp(argv[1],\"-p\")==0)){\n\t    portnum = atoi(argv[2]);\n\t    if(portnum==0){\n\t\t    std::cout<< \"Invalid input entered\" << std::endl;\n\t\t    exit(EXIT_FAILURE);\n\t    }\n    }\n    else if(args==7){\n\t    bool portSet = false;\n\t    bool userSet = false;\n\t    bool passSet = false;\n\t   for(int i=1; i<6; i+=2){\n\t\t    if(strcmp(argv[i],\"-p\")==0 && !portSet){\n\t\t\t    portnum=atoi(argv[i+1]);\n\t\t\t    if(portnum==0){\n\t\t\t\t    std::cout<< \"Invalid input entered\" << std::endl;\n\t\t\t\t    exit(EXIT_FAILURE);\n\t\t\t    }\t\t\n\t\t\t    portSet=true;\n\t\t    }\n\t\t    if(strcmp(argv[i],\"-u\")==0 && !userSet){\n\t\t\t    user=argv[i+1];\n\t\t\t    userSet=true;\n\t\t    }\n\t\t    if(strcmp(argv[i],\"-k\")==0 && !passSet){\n\t\t\t    password=argv[i+1];\n\t\t\t    passSet=true;\n\t\t    }\t\t \n\t    }\n\t    if(!portSet || !userSet || !passSet){\t\/\/ If not all fields are set, exit\n\t\t    std::cout<< \"Invalid input entered\" << std::endl;\n\t\t    exit(EXIT_FAILURE);\n\t    }\n    }\n    else{\n\t    std::cout<< \"Invalid input entered\" << std::endl;\n\t    exit(EXIT_FAILURE);\n    }\n    \n    DaemonServer* udpDaemon = new DaemonServer(portnum, user, password);\n\n    udpDaemon->startDaemon();\n    \n    \/\/! \\todo   Signal Handling\n    \n    \n    openlog(\"IpmiDaemon\", LOG_PID, LOG_DAEMON);\n    syslog(LOG_NOTICE, \"Daemon Started\");\n    \n    \n    while(1)\n    {\n        udpDaemon->receiveData();\n        \n        \/\/! \\todo   remaining implementation\n        sleep(2);\n    }\n    \n    return 1;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>b8c4ae54-327f-11e5-86e9-9cf387a8033e<commit_msg>b8caea42-327f-11e5-ad3d-9cf387a8033e<commit_after>b8caea42-327f-11e5-ad3d-9cf387a8033e<|endoftext|>"}
{"text":"<commit_before>ea621bf3-2e4e-11e5-8ed5-28cfe91dbc4b<commit_msg>ea69146e-2e4e-11e5-b9fc-28cfe91dbc4b<commit_after>ea69146e-2e4e-11e5-b9fc-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>\/\/ $Id$\n\/\/\n\/\/  Copyright (C) 2013 Greg Landrum and Rational Discovery LLC\n\/\/\n\/\/   @@ All Rights Reserved @@\n\/\/  This file is part of the RDKit.\n\/\/  The contents are covered by the terms of the BSD license\n\/\/  which is included in the file license.txt, found at the root\n\/\/  of the RDKit source tree.\n\/\/\n\n#include <GraphMol\/RDKitBase.h>\n#include <GraphMol\/QueryOps.h>\n#include <DataStructs\/ExplicitBitVect.h>\n#include <DataStructs\/BitOps.h>\n#include \"Fingerprints.h\"\n#include <GraphMol\/Subgraphs\/Subgraphs.h>\n#include <GraphMol\/Subgraphs\/SubgraphUtils.h>\n#include <GraphMol\/Substruct\/SubstructMatch.h>\n#include <GraphMol\/SmilesParse\/SmilesParse.h>\n#include <RDGeneral\/Invariant.h>\n#include <boost\/random.hpp>\n#include <limits.h>\n#include <boost\/cstdint.hpp>\n#include <RDGeneral\/hash\/hash.hpp>\n#include <RDGeneral\/types.h>\n#include <algorithm>\n#include <boost\/dynamic_bitset.hpp>\n\n\/\/#define VERBOSE_FINGERPRINTING 1\n\/\/#define REPORT_FP_STATS 1\n#ifdef REPORT_FP_STATS\n#include <GraphMol\/SmilesParse\/SmilesWrite.h>\n#endif\n\nnamespace RDKit{\n  const char *pqs[]={ \"[*]~[*]\",\n                      \"[*]~[*]~[*]\",\n                      \"[R]~1~[R]~[R]~1\",\n                      \/\/\"[*]~[*]~[*]~[*]\",\n                      \"[*]~[*](~[*])~[*]\",\n                      \/\/\"[*]~[R]~1[R]~[R]~1\",\n                      \"[R]~1[R]~[R]~[R]~1\",\n                      \/\/\"[*]~[*]~[*]~[*]~[*]\",\n                      \"[*]~[*]~[*](~[*])~[*]\",\n                      \"\/\/[*]~[R]~1[R]~[R]~1~[*]\",\n                      \"[R]~1~[R]~[R]~[R]~[R]~1\",\n                      \"[R]~1~[R]~[R]~[R]~[R]~[R]~1\",\n                      \"[R2]~[R1]~[R2]\",\n                      \"[R2]~[R1]~[R1]~[R2]\",\n                      \"[*]!@[R]~[R]!@[*]\",\n                      \"[*]!@[R]~[R]~[R]!@[*]\",\n\n#if 0\n                      \"[*]~[*](~[*])(~[*])~[*]\",\n                      \"[*]~[*]~[*]~[*]~[*]~[*]\",\n                      \"[*]~[*]~[*]~[*](~[*])~[*]\",\n                      \"[*]~[*]~[*](~[*])~[*]~[*]\",\n                      \"[*]~[*]~[*](~[*])(~[*])~[*]\",\n                      \"[*]~[*](~[*])~[*](~[*])~[*]\",\n                      \"[*]~[R]~1[R]~[R]~1(~[*])~[*]\",\n                      \"[*]~[R]~1[R](~[*])~[R]~1[*]\",\n                      \"[*]~[R]~1[R]~[R](~[*])~[R]~1\",\n                      \"[*]~[R]~1[R]~[R]~[R]~1[*]\",\n                      \"[*]~[R]~1[R]~[R]~[R]~[R]~1\",\n                      \"[*]~[R]~1(~[*])~[R]~[R]~[R]~1\",\n                      \"[*]~[*]~[*]~[*]~[*]~[*]~[*]\",\n                      \"[*]~[*]~[*]~[*]~[*](~[*])~[*]\",\n                      \"[*]~[*]~[*]~[*](~[*])~[*]~[*]\",\n                      \"[*]~[*]~[*]~[*](~[*])(~[*])~[*]\",\n                      \"[*]~[*]~[*](~[*])~[*](~[*])~[*]\",\n                      \"[*]~[*](~[*])~[*]~[*](~[*])~[*]\",\n                      \"[*]~[*](~[*])~[*](~[*])(~[*])~[*]\",\n#endif\n                      \"\"};\n\n  namespace detail {\n    void getAtomNumbers(const Atom *a,std::vector<int> &atomNums){\n      atomNums.clear();\n      if( !a->hasQuery()){\n        atomNums.push_back(a->getAtomicNum());\n        return;\n      }\n      \/\/ negated things are always complex:\n      if( a->getQuery()->getNegation()) return;\n      std::string descr=a->getQuery()->getDescription();\n      if(descr==\"AtomAtomicNum\"){\n        atomNums.push_back(static_cast<ATOM_EQUALS_QUERY *>(a->getQuery())->getVal());\n      } else if(descr==\"AtomXor\"){\n        return;\n      } else if(descr==\"AtomAnd\"){\n        Queries::Query<int,Atom const *,true>::CHILD_VECT_CI childIt=a->getQuery()->beginChildren();\n        if( (*childIt)->getDescription()==\"AtomAtomicNum\" &&\n            ((*(childIt+1))->getDescription()==\"AtomIsAliphatic\" ||\n             (*(childIt+1))->getDescription()==\"AtomIsAromatic\") &&\n            (childIt+2)==a->getQuery()->endChildren()){\n          atomNums.push_back(static_cast<ATOM_EQUALS_QUERY *>((*childIt).get())->getVal());\n          return;\n        }\n      } else if(descr==\"AtomOr\"){\n        Queries::Query<int,Atom const *,true>::CHILD_VECT_CI childIt=a->getQuery()->beginChildren();\n        while(childIt !=a->getQuery()->endChildren()){\n          if( (*childIt)->getDescription()==\"AtomAtomicNum\" ){\n            atomNums.push_back(static_cast<ATOM_EQUALS_QUERY *>((*childIt).get())->getVal());\n          } else if((*childIt)->getDescription()==\"AtomAnd\"){\n            Queries::Query<int,Atom const *,true>::CHILD_VECT_CI childIt2=(*childIt)->beginChildren();\n            if( (*childIt2)->getDescription()==\"AtomAtomicNum\" &&\n                ((*(childIt2+1))->getDescription()==\"AtomIsAliphatic\" ||\n                 (*(childIt2+1))->getDescription()==\"AtomIsAromatic\") &&\n                (childIt2+2)==(*childIt)->endChildren()){\n              atomNums.push_back(static_cast<ATOM_EQUALS_QUERY *>((*childIt2).get())->getVal());\n            } else {\n              atomNums.clear();\n              return;\n            }\n          } else {\n            atomNums.clear();\n            return;\n          }\n          ++childIt;\n        }\n      }\n      return;\n    }\n  }    \n\n\n  \/\/ caller owns the result, it must be deleted\n  ExplicitBitVect *PatternFingerprintMol(const ROMol &mol,\n                                         unsigned int fpSize,\n                                         std::vector<unsigned int> *atomCounts,\n                                         ExplicitBitVect *setOnlyBits){\n    PRECONDITION(fpSize!=0,\"fpSize==0\");\n    PRECONDITION(!atomCounts || atomCounts->size()>=mol.getNumAtoms(),\"bad atomCounts size\");\n    PRECONDITION(!setOnlyBits || setOnlyBits->getNumBits()==fpSize,\"bad setOnlyBits size\");\n\n    static std::vector<ROMOL_SPTR> patts;\n    \/\/ FIX: need a mutex here to be threadsafe\n    if(patts.size()==0){\n      unsigned int idx=0;\n      while(1){\n        std::string pq=pqs[idx];\n        if(pq==\"\") break;\n        idx++;\n        RWMol *tm;\n        try {\n          tm = SmartsToMol(pq);\n        }catch (...) {\n          tm=NULL;\n        }\n        if(!tm) continue;\n        patts.push_back(ROMOL_SPTR(static_cast<ROMol *>(tm)));\n      }\n    }\n    if(!mol.getRingInfo()->isInitialized()){\n      MolOps::findSSSR(mol);\n    }\n\n    boost::dynamic_bitset<> isQueryAtom(mol.getNumAtoms()),isQueryBond(mol.getNumBonds());\n    ROMol::VERTEX_ITER firstA,lastA;\n    boost::tie(firstA,lastA) = mol.getVertices();  \n    while(firstA!=lastA){\n      const Atom *at=mol[*firstA].get();\n      if(Fingerprints::detail::isComplexQuery(at)) isQueryAtom.set(at->getIdx());\n      ++firstA;\n    }\n    ROMol::EDGE_ITER firstB,lastB;\n    boost::tie(firstB,lastB) = mol.getEdges();\n    while(firstB!=lastB){\n      const Bond *bond = mol[*firstB].get();\n      if( Fingerprints::detail::isComplexQuery(bond) ){\n        isQueryBond.set(bond->getIdx());\n      }\n      ++firstB;\n    }\n    \n    ExplicitBitVect *res = new ExplicitBitVect(fpSize);\n    unsigned int pIdx=0;\n    BOOST_FOREACH(ROMOL_SPTR patt,patts){\n      ++pIdx;\n      \/\/if(patt->getNumBonds()<minPath || patt->getNumBonds()>maxPath){\n      \/\/  continue;\n      \/\/}\n      std::vector<MatchVectType> matches;\n      \/\/ uniquify matches?\n      \/\/   time for 10K molecules w\/ uniquify: 5.24s\n      \/\/   time for 10K molecules w\/o uniquify: 4.87s\n      SubstructMatch(mol,*(patt.get()),matches,false); \n      boost::uint32_t mIdx=pIdx+patt->getNumAtoms()+patt->getNumBonds();\n#if 0\n      \/\/ this was an effort to tune the composition of the fingerprint,\n      \/\/ particularly when queries are used. It hasn't proved successful\n      BOOST_FOREACH(MatchVectType &mv,matches){\n        \/\/ collect bits counting the number of occurances of the pattern:\n        gboost::hash_combine(mIdx,0xBEEF);\n        res->setBit(mIdx%fpSize);\n\n        bool isQuery=false;\n        boost::uint32_t bitId=pIdx;\n        std::vector<unsigned int> amap(mv.size(),0);\n        BOOST_FOREACH(MatchVectType::value_type &p,mv){\n          if(isQueryAtom[p.second]){\n            isQuery=true;\n            break;\n          }\n          gboost::hash_combine(bitId,mol.getAtomWithIdx(p.second)->getAtomicNum());\n          amap[p.first]=p.second;\n        }\n        if(!isQuery) res->setBit(bitId%(fpSize\/2));\n\n        isQuery=false;\n        bitId=pIdx;\n        ROMol::EDGE_ITER firstB,lastB;\n        boost::tie(firstB,lastB) = patt->getEdges();\n        while(firstB!=lastB){\n          BOND_SPTR pbond = (*patt.get())[*firstB];\n          ++firstB;\n          if(isQueryBond[pbond->getIdx()]){\n            isQuery=true;\n            break;\n          }\n          const Bond *mbond=mol.getBondBetweenAtoms(amap[pbond->getBeginAtomIdx()],\n                                                    amap[pbond->getEndAtomIdx()]);\n          gboost::hash_combine(bitId,(boost::uint32_t)mbond->getBondType());\n        }\n        if(!isQuery) res->setBit((fpSize\/2) + bitId%(fpSize\/2));\n      }\n#else\n      BOOST_FOREACH(MatchVectType &mv,matches){\n        \/\/ collect bits counting the number of occurances of the pattern:\n        gboost::hash_combine(mIdx,0xBEEF);\n        res->setBit(mIdx%fpSize);\n\n        bool isQuery=false;\n        boost::uint32_t bitId=pIdx;\n        std::vector<unsigned int> amap(mv.size(),0);\n        BOOST_FOREACH(MatchVectType::value_type &p,mv){\n          if(isQueryAtom[p.second]){\n            isQuery=true;\n            break;\n          }\n          gboost::hash_combine(bitId,mol.getAtomWithIdx(p.second)->getAtomicNum());\n          amap[p.first]=p.second;\n        }\n        if(isQuery) continue;\n        ROMol::EDGE_ITER firstB,lastB;\n        boost::tie(firstB,lastB) = patt->getEdges();\n        while(firstB!=lastB){\n          BOND_SPTR pbond = (*patt.get())[*firstB];\n          ++firstB;\n          if(isQueryBond[pbond->getIdx()]){\n            isQuery=true;\n            break;\n          }\n          const Bond *mbond=mol.getBondBetweenAtoms(amap[pbond->getBeginAtomIdx()],\n                                                    amap[pbond->getEndAtomIdx()]);\n          gboost::hash_combine(bitId,(boost::uint32_t)mbond->getBondType());\n        }\n        if(!isQuery) res->setBit(bitId%fpSize);\n      }\n#endif      \n    }\n    return res;\n  }\n}\n<commit_msg>code cleanup<commit_after>\/\/ $Id$\n\/\/\n\/\/  Copyright (C) 2013 Greg Landrum and Rational Discovery LLC\n\/\/\n\/\/   @@ All Rights Reserved @@\n\/\/  This file is part of the RDKit.\n\/\/  The contents are covered by the terms of the BSD license\n\/\/  which is included in the file license.txt, found at the root\n\/\/  of the RDKit source tree.\n\/\/\n\n#include <GraphMol\/RDKitBase.h>\n#include <GraphMol\/QueryOps.h>\n#include <DataStructs\/ExplicitBitVect.h>\n#include <DataStructs\/BitOps.h>\n#include \"Fingerprints.h\"\n#include <GraphMol\/Subgraphs\/Subgraphs.h>\n#include <GraphMol\/Subgraphs\/SubgraphUtils.h>\n#include <GraphMol\/Substruct\/SubstructMatch.h>\n#include <GraphMol\/SmilesParse\/SmilesParse.h>\n#include <RDGeneral\/Invariant.h>\n#include <boost\/random.hpp>\n#include <limits.h>\n#include <boost\/cstdint.hpp>\n#include <RDGeneral\/hash\/hash.hpp>\n#include <RDGeneral\/types.h>\n#include <algorithm>\n#include <boost\/dynamic_bitset.hpp>\n\n\/\/#define VERBOSE_FINGERPRINTING 1\n\/\/#define REPORT_FP_STATS 1\n#ifdef REPORT_FP_STATS\n#include <GraphMol\/SmilesParse\/SmilesWrite.h>\n#endif\n\nnamespace RDKit{\n  const char *pqs[]={ \"[*]~[*]\",\n                      \"[*]~[*]~[*]\",\n                      \"[R]~1~[R]~[R]~1\",\n                      \/\/\"[*]~[*]~[*]~[*]\",\n                      \"[*]~[*](~[*])~[*]\",\n                      \/\/\"[*]~[R]~1[R]~[R]~1\",\n                      \"[R]~1[R]~[R]~[R]~1\",\n                      \/\/\"[*]~[*]~[*]~[*]~[*]\",\n                      \"[*]~[*]~[*](~[*])~[*]\",\n                      \/\/\"[*]~[R]~1[R]~[R]~1~[*]\",\n                      \"[R]~1~[R]~[R]~[R]~[R]~1\",\n                      \"[R]~1~[R]~[R]~[R]~[R]~[R]~1\",\n                      \"[R2]~[R1]~[R2]\",\n                      \"[R2]~[R1]~[R1]~[R2]\",\n                      \"[*]!@[R]~[R]!@[*]\",\n                      \"[*]!@[R]~[R]~[R]!@[*]\",\n\n#if 0\n                      \"[*]~[*](~[*])(~[*])~[*]\",\n                      \"[*]~[*]~[*]~[*]~[*]~[*]\",\n                      \"[*]~[*]~[*]~[*](~[*])~[*]\",\n                      \"[*]~[*]~[*](~[*])~[*]~[*]\",\n                      \"[*]~[*]~[*](~[*])(~[*])~[*]\",\n                      \"[*]~[*](~[*])~[*](~[*])~[*]\",\n                      \"[*]~[R]~1[R]~[R]~1(~[*])~[*]\",\n                      \"[*]~[R]~1[R](~[*])~[R]~1[*]\",\n                      \"[*]~[R]~1[R]~[R](~[*])~[R]~1\",\n                      \"[*]~[R]~1[R]~[R]~[R]~1[*]\",\n                      \"[*]~[R]~1[R]~[R]~[R]~[R]~1\",\n                      \"[*]~[R]~1(~[*])~[R]~[R]~[R]~1\",\n                      \"[*]~[*]~[*]~[*]~[*]~[*]~[*]\",\n                      \"[*]~[*]~[*]~[*]~[*](~[*])~[*]\",\n                      \"[*]~[*]~[*]~[*](~[*])~[*]~[*]\",\n                      \"[*]~[*]~[*]~[*](~[*])(~[*])~[*]\",\n                      \"[*]~[*]~[*](~[*])~[*](~[*])~[*]\",\n                      \"[*]~[*](~[*])~[*]~[*](~[*])~[*]\",\n                      \"[*]~[*](~[*])~[*](~[*])(~[*])~[*]\",\n#endif\n                      \"\"};\n\n  namespace detail {\n    void getAtomNumbers(const Atom *a,std::vector<int> &atomNums){\n      atomNums.clear();\n      if( !a->hasQuery()){\n        atomNums.push_back(a->getAtomicNum());\n        return;\n      }\n      \/\/ negated things are always complex:\n      if( a->getQuery()->getNegation()) return;\n      std::string descr=a->getQuery()->getDescription();\n      if(descr==\"AtomAtomicNum\"){\n        atomNums.push_back(static_cast<ATOM_EQUALS_QUERY *>(a->getQuery())->getVal());\n      } else if(descr==\"AtomXor\"){\n        return;\n      } else if(descr==\"AtomAnd\"){\n        Queries::Query<int,Atom const *,true>::CHILD_VECT_CI childIt=a->getQuery()->beginChildren();\n        if( (*childIt)->getDescription()==\"AtomAtomicNum\" &&\n            ((*(childIt+1))->getDescription()==\"AtomIsAliphatic\" ||\n             (*(childIt+1))->getDescription()==\"AtomIsAromatic\") &&\n            (childIt+2)==a->getQuery()->endChildren()){\n          atomNums.push_back(static_cast<ATOM_EQUALS_QUERY *>((*childIt).get())->getVal());\n          return;\n        }\n      } else if(descr==\"AtomOr\"){\n        Queries::Query<int,Atom const *,true>::CHILD_VECT_CI childIt=a->getQuery()->beginChildren();\n        while(childIt !=a->getQuery()->endChildren()){\n          if( (*childIt)->getDescription()==\"AtomAtomicNum\" ){\n            atomNums.push_back(static_cast<ATOM_EQUALS_QUERY *>((*childIt).get())->getVal());\n          } else if((*childIt)->getDescription()==\"AtomAnd\"){\n            Queries::Query<int,Atom const *,true>::CHILD_VECT_CI childIt2=(*childIt)->beginChildren();\n            if( (*childIt2)->getDescription()==\"AtomAtomicNum\" &&\n                ((*(childIt2+1))->getDescription()==\"AtomIsAliphatic\" ||\n                 (*(childIt2+1))->getDescription()==\"AtomIsAromatic\") &&\n                (childIt2+2)==(*childIt)->endChildren()){\n              atomNums.push_back(static_cast<ATOM_EQUALS_QUERY *>((*childIt2).get())->getVal());\n            } else {\n              atomNums.clear();\n              return;\n            }\n          } else {\n            atomNums.clear();\n            return;\n          }\n          ++childIt;\n        }\n      }\n      return;\n    }\n  }    \n\n\n  \/\/ caller owns the result, it must be deleted\n  ExplicitBitVect *PatternFingerprintMol(const ROMol &mol,\n                                         unsigned int fpSize,\n                                         std::vector<unsigned int> *atomCounts,\n                                         ExplicitBitVect *setOnlyBits){\n    PRECONDITION(fpSize!=0,\"fpSize==0\");\n    PRECONDITION(!atomCounts || atomCounts->size()>=mol.getNumAtoms(),\"bad atomCounts size\");\n    PRECONDITION(!setOnlyBits || setOnlyBits->getNumBits()==fpSize,\"bad setOnlyBits size\");\n\n    static std::vector<ROMOL_SPTR> patts;\n    \/\/ FIX: need a mutex here to be threadsafe\n    if(patts.size()==0){\n      unsigned int idx=0;\n      while(1){\n        std::string pq=pqs[idx];\n        if(pq==\"\") break;\n        idx++;\n        RWMol *tm;\n        try {\n          tm = SmartsToMol(pq);\n        }catch (...) {\n          tm=NULL;\n        }\n        if(!tm) continue;\n        patts.push_back(ROMOL_SPTR(static_cast<ROMol *>(tm)));\n      }\n    }\n    if(!mol.getRingInfo()->isInitialized()){\n      MolOps::findSSSR(mol);\n    }\n\n    boost::dynamic_bitset<> isQueryAtom(mol.getNumAtoms()),isQueryBond(mol.getNumBonds());\n    ROMol::VERTEX_ITER firstA,lastA;\n    boost::tie(firstA,lastA) = mol.getVertices();  \n    while(firstA!=lastA){\n      const Atom *at=mol[*firstA].get();\n      if(Fingerprints::detail::isComplexQuery(at)) isQueryAtom.set(at->getIdx());\n      ++firstA;\n    }\n    ROMol::EDGE_ITER firstB,lastB;\n    boost::tie(firstB,lastB) = mol.getEdges();\n    while(firstB!=lastB){\n      const Bond *bond = mol[*firstB].get();\n      if( Fingerprints::detail::isComplexQuery(bond) ){\n        isQueryBond.set(bond->getIdx());\n      }\n      ++firstB;\n    }\n    \n    ExplicitBitVect *res = new ExplicitBitVect(fpSize);\n    unsigned int pIdx=0;\n    BOOST_FOREACH(ROMOL_SPTR patt,patts){\n      ++pIdx;\n      std::vector<MatchVectType> matches;\n      \/\/ uniquify matches?\n      \/\/   time for 10K molecules w\/ uniquify: 5.24s\n      \/\/   time for 10K molecules w\/o uniquify: 4.87s\n      SubstructMatch(mol,*(patt.get()),matches,false); \n      boost::uint32_t mIdx=pIdx+patt->getNumAtoms()+patt->getNumBonds();\n      BOOST_FOREACH(MatchVectType &mv,matches){\n#ifdef VERBOSE_FINGERPRINTING\n        std::cerr<<\"\\nPatt: \"<<pIdx<<\" | \";\n#endif          \n        \/\/ collect bits counting the number of occurances of the pattern:\n        gboost::hash_combine(mIdx,0xBEEF);\n        res->setBit(mIdx%fpSize);\n\n        bool isQuery=false;\n        boost::uint32_t bitId=pIdx;\n        std::vector<unsigned int> amap(mv.size(),0);\n        BOOST_FOREACH(MatchVectType::value_type &p,mv){\n#ifdef VERBOSE_FINGERPRINTING\n          std::cerr<<p.second<<\" \";\n#endif\n          if(isQueryAtom[p.second]){\n            isQuery=true;\n#ifdef VERBOSE_FINGERPRINTING\n            std::cerr<<\"atom query.\";\n#endif\n            break;\n          }\n          gboost::hash_combine(bitId,mol.getAtomWithIdx(p.second)->getAtomicNum());\n          amap[p.first]=p.second;\n        }\n        if(isQuery) continue;\n        ROMol::EDGE_ITER firstB,lastB;\n        boost::tie(firstB,lastB) = patt->getEdges();\n        while(firstB!=lastB){\n          BOND_SPTR pbond = (*patt.get())[*firstB];\n          ++firstB;\n          if(isQueryBond[pbond->getIdx()]){\n            isQuery=true;\n#ifdef VERBOSE_FINGERPRINTING\n            std::cerr<<\"bond query: \"<<pbond->getIdx();\n#endif\n            break;\n          }\n          const Bond *mbond=mol.getBondBetweenAtoms(amap[pbond->getBeginAtomIdx()],\n                                                    amap[pbond->getEndAtomIdx()]);\n          gboost::hash_combine(bitId,(boost::uint32_t)mbond->getBondType());\n        }\n        if(!isQuery){\n#ifdef VERBOSE_FINGERPRINTING\n          std::cerr<<\" set: \"<<bitId<<\" \"<<bitId%fpSize;\n#endif\n          res->setBit(bitId%fpSize);\n        }\n      }\n    }\n    return res;\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <sstream>\n#include <vector>\n#include <map>\n#include <vector>\n#include <ostream>\n#include <string>\n#include \"ast.h\"\n#include \"generator.h\"\n#include \"ecc.tab.h\"\n\nextern int _yylex(void);\nextern void yysetstream(std::istream*);\n\n#define YY_NULL (0)\n\nnamespace ecc\n{\n    extern const std::string version = \"ecc v0.0alpha\"; \/**< Version string *\/\n    ast::elist_t MasterList;\t\t\t\t\/**< Parser places output here *\/\n    ast::enumdef* CurrentEnumDef;\t\t\t\/**< Used during parsing *\/\n}\n\nnamespace\n{\n    std::istream* pStream;\n}\n\nnamespace ecc\n{\n    void input(char* buf, int& result, size_t max_size)\n    {\n \tchar c;\n \tif (pStream->peek()==EOF)\n \t    result = YY_NULL;\t\t\t\n \telse \n\t{ \n\t    pStream->read(&c,1); \n\t    buf[0] = c; \n\t    result = 1; \n \t} \n\n    }\n}\n\n\/**\n * Included for future use\n *\/\nint yylex(void) { return _yylex(); }\n\n\/**\n * Main execution loop of the ecc utility\n *\/\nint main(void)\n{\n    \/\/ Set up example input\n    std::stringstream ss;\n    \n    ss << \"typedef enum { frog=9, tree, banana = 7 } enum_t;\"\n       << \"typedef enum { willow } other_t;\";\n    \n    \/\/ Tell the scanner where to get its input\n    pStream = &ss;\n\n    \/\/ Parse the stream\n    yyparse();\n\n    \/\/ Generate the output (defaults to std::cout)\n    ecc::generator* pGen = new ecc::defgen();\n    pGen->translate( ecc::MasterList );\n    delete pGen;\n}\n<commit_msg>Optimisation of ecc::input<commit_after>#include <iostream>\n#include <sstream>\n#include <vector>\n#include <map>\n#include <vector>\n#include <ostream>\n#include <string>\n#include \"ast.h\"\n#include \"generator.h\"\n#include \"ecc.tab.h\"\n\nextern int _yylex(void);\nextern void yysetstream(std::istream*);\n\n#define YY_NULL (0)\n\nnamespace ecc\n{\n    extern const std::string version = \"ecc v0.0alpha\"; \/**< Version string *\/\n    ast::elist_t MasterList;\t\t\t\t\/**< Parser places output here *\/\n    ast::enumdef* CurrentEnumDef;\t\t\t\/**< Used during parsing *\/\n}\n\nnamespace\n{\n    \/** Holds a pointer to the current input stream, for ecc::input to access *\/\n    std::istream* pStream;\n}\n\nnamespace ecc\n{\n    \/** Provides stream input functionality to the lexer. *\/\n    void input(char* buf, int& result, size_t max_size)\n    {\n \tif (pStream->peek()==EOF)\n \t    result = YY_NULL;\t\t\t\n \telse \n\t{ \n\t    pStream->read(buf,max_size); \n\t    result = pStream->gcount(); \n \t} \n\n    }\n\n}\n\n\/**\n * Included for future use\n *\/\nint yylex(void) { return _yylex(); }\n\n\/**\n * Main execution loop of the ecc utility\n *\/\nint main(void)\n{\n    \/\/ Set up example input\n    std::stringstream ss;\n    \n    ss << \"typedef enum { frog=9, tree, banana = 7 } enum_t;\"\n       << \"typedef enum { willow } other_t;\";\n    \n    \/\/ Tell the scanner where to get its input\n    pStream = &ss;\n\n    \/\/ Parse the stream\n    yyparse();\n\n    \/\/ Generate the output (defaults to std::cout)\n    ecc::generator* pGen = new ecc::defgen();\n    pGen->translate( ecc::MasterList );\n    delete pGen;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"views.h\"\n\nusing namespace std;\n\nnamespace rviews {\n\nvoid login(JsonValue * message, ServerHandler * handler) {\n    JsonDict * dictMessage = JDICT(message);\n\n    if (dictMessage == NULL) {\n        throw BadRequest(\"Malformatted request. Need a JSON dict\");\n    }\n\n    bool success = getBool(dictMessage, \"success\");\n    if(success){\n        emit handler->getWindow()->loginSuccess();\n    }\n    else {\n        emit handler->getWindow()->loginFailure(getString(dictMessage, \"reason\"));\n    }\n}\n\nvoid signup(JsonValue * message, ServerHandler * handler) {\n    JsonDict * dictMessage = JDICT(message);\n\n    if (dictMessage == NULL) {\n        throw BadRequest(\"Malformatted request. Need a JSON dict\");\n    }\n\n    bool success = getBool(dictMessage, \"success\");\n    if(success){\n        emit handler->getWindow()->registerSuccess();\n    }\n    else {\n        emit handler->getWindow()->registerFailure(getInt(dictMessage, \"code\"));\n    }\n}\n\nvoid userlist(JsonValue * message, ServerHandler * handler) {\n    JsonDict * listMessage = JLIST(message);\n\n    if (listMessage == NULL) {\n        throw BadRequest(\"Malformatted request. Need a JSON list\");\n    }\n\n    bool success = getBool(dictMessage, \"success\");\n    if(success){\n        JsonList * jlist = getList(dictMessage, \"userlist\");\n        vector<string> ulist;\n        for(int i = 0; i < jlist->size(); i++){\n            ulist.push_back(getString(jlist, i));\n        }\n        emit handler->getWindow()->userlist(ulist);\n    }\n    else {\n        emit handler->getWindow()->registerFailure(getInt(dictMessage, \"code\"));\n    }\n}\n\n\n\n\/\/ void userlist(JsonValue * message, UserHandler * handler) {\n\/\/     JsonList answer;\n\/\/     std::vector<UserHandler *> handlers_vector = *(handler->getHandlers_listPtr());\n\n\/\/     for (int i = 0; i < handlers_vector.size(); i++) {\n\/\/         Manager * manager = handlers_vector[i]->getManager();\n\/\/         if (manager != NULL) {\n\/\/             answer.add(new JsonString(manager->getName()));\n\/\/         }\n\/\/     }\n\/\/     handler->writeToClient(\"userlist\", &answer);\n\/\/ }\n}\n<commit_msg>Use new signals<commit_after>#include \"views.h\"\n\nusing namespace std;\n\nnamespace rviews {\n\nvoid login(JsonValue * message, ServerHandler * handler) {\n    JsonDict * dictMessage = JDICT(message);\n\n    if (dictMessage == NULL) {\n        throw BadRequest(\"Malformatted request. Need a JSON dict\");\n    }\n\n    bool success = getBool(dictMessage, \"success\");\n    if(success){\n        emit handler->getWindow()->loginSuccess();\n    }\n    else {\n        emit handler->getWindow()->loginFailure(getInt(dictMessage, \"code\"));\n    }\n}\n\nvoid signup(JsonValue * message, ServerHandler * handler) {\n    JsonDict * dictMessage = JDICT(message);\n\n    if (dictMessage == NULL) {\n        throw BadRequest(\"Malformatted request. Need a JSON dict\");\n    }\n\n    bool success = getBool(dictMessage, \"success\");\n    if(success){\n        emit handler->getWindow()->registerSuccess();\n    }\n    else {\n        emit handler->getWindow()->registerFailure(getInt(dictMessage, \"code\"));\n    }\n}\n\nvoid userlist(JsonValue * message, ServerHandler * handler) {\n    JsonDict * listMessage = JLIST(message);\n\n    if (listMessage == NULL) {\n        throw BadRequest(\"Malformatted request. Need a JSON list\");\n    }\n\n    JsonList * jlist = getList(dictMessage, \"userlist\");\n    vector<string> ulist;\n    for(int i = 0; i < jlist->size(); i++){\n        ulist.push_back(getString(jlist, i));\n    }\n    emit handler->getWindow()->refreshRegisterList(ulist);\n}<|endoftext|>"}
{"text":"<commit_before>\/*\n   Copyright 2014 Software Reliability Lab, ETH Zurich\n\n   Licensed under the Apache License, Version 2.0 (the \"License\");\n   you may not use this file except in compliance with the License.\n   You may obtain a copy of the License at\n\n       http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n   Unless required by applicable law or agreed to in writing, software\n   distributed under the License is distributed on an \"AS IS\" BASIS,\n   WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 <unistd.h>\n#include <vector>\n\n#include \"gflags\/gflags.h\"\n\n#include \"RaceApp.h\"\n#include \"stringprintf.h\"\n#include \"strutil.h\"\n#include \"TraceReorder.h\"\n\nDEFINE_string(in_schedule_file, \"\/tmp\/schedule.data\",\n\t\t\"Filename with the schedules\");\nDEFINE_string(out_schedule_file, \"\/tmp\/new_schedule.data\",\n\t\t\"Filename with the schedules\");\n\nnamespace {\n\nRaceApp* race_app;\nTraceReorder* reorder;\n\nvoid createReorders() {\n\tconst VarsInfo& vinfo = race_app->vinfo();\n\n\tTraceReorder::Options options;\n\toptions.include_change_marker = true;\n\toptions.minimize_variation_from_original = true;\n\toptions.relax_replay_after_all_races = true;\n\n\tint all_schedules = 0;\n\tint successful_reverses = 0;\n\tint successful_schedules = 0;\n\n\n\tfor (int race_id = 0; race_id < static_cast<int>(vinfo.races().size()); ++race_id) {\n\t\tconst VarsInfo::RaceInfo& race = vinfo.races()[race_id];\n\t\tif (!race.m_multiParentRaces.empty() || race.m_coveredBy != -1) continue;\n\n\t\tstd::vector<int> rev_races;\n\t\trev_races.push_back(race_id);\n\n\t\t++all_schedules;\n\t\tstd::vector<int> new_schedule;\n\t\tif (reorder->GetScheduleFromRaces(vinfo, rev_races, race_app->graph(), options, &new_schedule)) {\n\t\t\t++successful_reverses;\n\t\t\treorder->SaveSchedule(FLAGS_out_schedule_file.c_str(), new_schedule);\n\t\t}\n\t}\n\n\tprintf(\"Tried %d schedules. %d generated, %d successful\\n\",\n\t\t\tall_schedules, successful_reverses, successful_schedules);\n}\n\n}  \/\/ namespace\n\n\nint main(int argc, char* argv[]) {\n\tgoogle::ParseCommandLineFlags(&argc, &argv, true);\n\treorder = new TraceReorder();\n\treorder->LoadSchedule(FLAGS_in_schedule_file.c_str());\n\trace_app = new RaceApp(0, argv[1], false);\n\n\tcreateReorders();\n\n\treturn 0;\n}\n<commit_msg>Add replay and generate a bunch of logs.<commit_after>\/*\n   Copyright 2014 Software Reliability Lab, ETH Zurich\n\n   Licensed under the Apache License, Version 2.0 (the \"License\");\n   you may not use this file except in compliance with the License.\n   You may obtain a copy of the License at\n\n       http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n   Unless required by applicable law or agreed to in writing, software\n   distributed under the License is distributed on an \"AS IS\" BASIS,\n   WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 <stdlib.h>\n#include <string.h>\n#include <unistd.h>\n#include <vector>\n\n#include \"gflags\/gflags.h\"\n\n#include \"RaceApp.h\"\n#include \"stringprintf.h\"\n#include \"strutil.h\"\n#include \"TraceReorder.h\"\n\nDEFINE_string(in_schedule_file, \"\/tmp\/schedule.data\",\n\t\t\"Filename with the schedules.\");\n\nDEFINE_string(site, \"\", \"The website to replay\");\n\nDEFINE_string(replay_command, \"LD_LIBRARY_PATH=\/home\/veselin\/gitwk\/WebERA\/WebKitBuild\/Release\/lib \/home\/veselin\/gitwk\/WebERA\/R5\/clients\/Replay\/bin\/replay %s %s\",\n\t\t\"Command to run replay with twice %s for the site and the replay file.\");\n\nDEFINE_string(tmp_schedule_file, \"\/tmp\/new_schedule.data\",\n\t\t\"Filename with the schedules.\");\nDEFINE_string(tmp_error_log, \"\/tmp\/errors.log\",\n\t\t\"Filename with the schedules.\");\nDEFINE_string(tmp_png_file, \"\/tmp\/replay.png\",\n\t\t\"Filename with the schedules.\");\n\nDEFINE_string(out_dir, \"\/tmp\/outdir\", \"Location of the output.\");\n\nnamespace {\n\nRaceApp* race_app;\nTraceReorder* reorder;\n\n\nbool MoveFile(const std::string& file, const std::string& out_dir) {\n\tif (system(StringPrintf(\"mv %s %s\", file.c_str(), out_dir.c_str()).c_str()) != 0) {\n\t\tfprintf(stderr, \"Cannot move %s\\n\", file.c_str());\n\t\treturn false;\n\t}\n\treturn true;\n}\n\nbool performSavedSchedule(const std::string& schedule_name) {\n\tstd::string command;\n\tStringAppendF(&command, FLAGS_replay_command.c_str(),\n\t\t\tFLAGS_site.c_str(), FLAGS_tmp_schedule_file.c_str());\n\tif (system(command.c_str()) != 0) {\n\t\tfprintf(stderr, \"Could not run command: %s\\n\", command.c_str());\n\t\treturn false;\n\t}\n\n\tstd::string out_dir = StringPrintf(\"%s\/%s\", FLAGS_out_dir.c_str(), schedule_name.c_str());\n\n\tif (system(StringPrintf(\"mkdir -p %s\", out_dir.c_str()).c_str()) != 0) {\n\t\tfprintf(stderr, \"Could not create output dir %s. Set the flag --out_dir\\n\", out_dir.c_str());\n\t\treturn false;\n\t}\n\tif (!MoveFile(FLAGS_tmp_schedule_file, out_dir)) return false;\n\tif (!MoveFile(FLAGS_tmp_png_file, out_dir)) return false;\n\tif (!MoveFile(FLAGS_tmp_error_log, out_dir)) return false;\n\n\treturn true;\n}\n\n\nvoid createReorders() {\n\tconst VarsInfo& vinfo = race_app->vinfo();\n\n\tTraceReorder::Options options;\n\toptions.include_change_marker = true;\n\toptions.minimize_variation_from_original = true;\n\toptions.relax_replay_after_all_races = true;\n\n\tint all_schedules = 0;\n\tint successful_reverses = 0;\n\tint successful_schedules = 0;\n\n\tfor (int race_id = -1; race_id < static_cast<int>(vinfo.races().size()); ++race_id) {\n\t\tstd::string name;\n\t\tstd::vector<int> rev_races;\n\t\tif (race_id == -1) {\n\t\t\tname = \"base\";\n\t\t} else {\n\t\t\tname = StringPrintf(\"race%d\", race_id);\n\t\t\tconst VarsInfo::RaceInfo& race = vinfo.races()[race_id];\n\t\t\tif (!race.m_multiParentRaces.empty() || race.m_coveredBy != -1) continue;\n\t\t\trev_races.push_back(race_id);\n\t\t}\n\n\t\t++all_schedules;\n\t\tstd::vector<int> new_schedule;\n\t\tif (reorder->GetScheduleFromRaces(vinfo, rev_races, race_app->graph(), options, &new_schedule)) {\n\t\t\t++successful_reverses;\n\t\t\treorder->SaveSchedule(FLAGS_tmp_schedule_file.c_str(), new_schedule);\n\t\t\tif (performSavedSchedule(name)) {\n\t\t\t\t++successful_schedules;\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"Tried %d schedules. %d generated, %d successful\\n\",\n\t\t\tall_schedules, successful_reverses, successful_schedules);\n}\n\n}  \/\/ namespace\n\n\nint main(int argc, char* argv[]) {\n\tgoogle::ParseCommandLineFlags(&argc, &argv, true);\n\treorder = new TraceReorder();\n\treorder->LoadSchedule(FLAGS_in_schedule_file.c_str());\n\trace_app = new RaceApp(0, argv[1], false);\n\n\tcreateReorders();\n\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>0a8d98fa-2e4f-11e5-bf01-28cfe91dbc4b<commit_msg>0a94721c-2e4f-11e5-bf6f-28cfe91dbc4b<commit_after>0a94721c-2e4f-11e5-bf6f-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>93108edc-2e4f-11e5-8a69-28cfe91dbc4b<commit_msg>93187e80-2e4f-11e5-82cb-28cfe91dbc4b<commit_after>93187e80-2e4f-11e5-82cb-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>2119735a-2e3a-11e5-ba32-c03896053bdd<commit_msg>212f711c-2e3a-11e5-b07e-c03896053bdd<commit_after>212f711c-2e3a-11e5-b07e-c03896053bdd<|endoftext|>"}
{"text":"<commit_before>8fd048fc-2d14-11e5-af21-0401358ea401<commit_msg>8fd048fd-2d14-11e5-af21-0401358ea401<commit_after>8fd048fd-2d14-11e5-af21-0401358ea401<|endoftext|>"}
{"text":"<commit_before>7707fe2a-2d53-11e5-baeb-247703a38240<commit_msg>77087f3a-2d53-11e5-baeb-247703a38240<commit_after>77087f3a-2d53-11e5-baeb-247703a38240<|endoftext|>"}
{"text":"<commit_before>\/*********************************\n**********************************\n**                              **\n** Wababa: Simple Question Game **\n**                              **\n**********************************\n*********************************\/\n\n\/\/ Preprocessor Commands\n#include <iostream>\n#include <string>\n\/\/Global Scope Namespace \nusing namespace std;\n\n\n\/\/ Wababa Answer Variables\nint a = 5;\nint apples;\nstring b = \"woof\";\nstring c = \"sally\";\nstring bark;\nstring dollname;\n\n\n\nvoid answerA (int answer, int thevar) {\n\nif ( answer == thevar )\n    cout << \"Yes!\\n\";\nelse \n    cout << \"Wrong!\\n\";\n}\n\nvoid answerQ (string answer, string thevar) {\n\nif ( answer == thevar )\n    cout << \"Yes!\\n\";\nelse \n    cout << \"Wrong!\\n\";\n}\n\nint main () {\n\n\n\n    \/\/ Wababa Welcome.\n    string wababa;\n    wababa = \"Wababa!\\n\\n\";\n    cout << wababa;\n\n    \/\/ Question #1\n    cout << \"How many red items are there: \";\n    cin >> apples;\n    answerA(apples, a);\n\n    \/\/ Question #2\n    cout << \"What did the dog say: \";\n    cin >> bark;\n    answerQ(bark,b);\n\n    \/\/ Question #3\n    cout << \"What's her name: \";\n    cin >> dollname;\n    answerQ(dollname,c);\n\n\n    \/\/ Returns 0\n    return 0;\n\n}\n<commit_msg>Made the anwser to question 2 less obvious.<commit_after>\/*********************************\n**********************************\n**                              **\n** Wababa: Simple Question Game **\n**                              **\n**********************************\n*********************************\/\n\n\/\/ Preprocessor Commands\n#include <iostream>\n#include <string>\n\/\/Global Scope Namespace \nusing namespace std;\n\n\n\/\/ Wababa Answer Variables\nint a = 5;\nint apples;\nstring b = \"woof\";\nstring c = \"sally\";\nstring bark;\nstring dollname;\n\n\n\nvoid answerA (int answer, int thevar) {\n\nif ( answer == thevar )\n    cout << \"Yes!\\n\";\nelse \n    cout << \"Wrong!\\n\";\n}\n\nvoid answerQ (string answer, string thevar) {\n\nif ( answer == thevar )\n    cout << \"Yes!\\n\";\nelse \n    cout << \"Wrong!\\n\";\n}\n\nint main () {\n\n\n\n    \/\/ Wababa Welcome.\n    string wababa;\n    wababa = \"Wababa!\\n\\n\";\n    cout << wababa;\n\n    \/\/ Question #1\n    cout << \"How many red items are there: \";\n    cin >> apples;\n    answerA(apples, a);\n\n    \/\/ Question #2\n    cout << \"What did the pet say: \";\n    cin >> bark;\n    answerQ(bark,b);\n\n    \/\/ Question #3\n    cout << \"What's her name: \";\n    cin >> dollname;\n    answerQ(dollname,c);\n\n\n    \/\/ Returns 0\n    return 0;\n\n}\n<|endoftext|>"}
{"text":"<commit_before>c16f57d8-35ca-11e5-89b2-6c40088e03e4<commit_msg>c175b76e-35ca-11e5-ae8d-6c40088e03e4<commit_after>c175b76e-35ca-11e5-ae8d-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>6315f74a-5216-11e5-ac54-6c40088e03e4<commit_msg>631f4566-5216-11e5-acf1-6c40088e03e4<commit_after>631f4566-5216-11e5-acf1-6c40088e03e4<|endoftext|>"}
{"text":"<commit_before>425ac294-2e4f-11e5-a136-28cfe91dbc4b<commit_msg>4264a7dc-2e4f-11e5-a8b0-28cfe91dbc4b<commit_after>4264a7dc-2e4f-11e5-a8b0-28cfe91dbc4b<|endoftext|>"}
{"text":"<commit_before>6ed60fa4-2fa5-11e5-87a0-00012e3d3f12<commit_msg>6ed80b74-2fa5-11e5-967f-00012e3d3f12<commit_after>6ed80b74-2fa5-11e5-967f-00012e3d3f12<|endoftext|>"}
{"text":"<commit_before>\/*\n * The MIT License\n *\n * Copyright 2017-2018 Norwegian University of Technology\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 <boost\/optional.hpp>\n#include <fmicpp\/fmi2\/xml\/ModelStructure.hpp>\n\n\nusing namespace std;\nusing namespace fmicpp::fmi2::xml;\n\nnamespace {\n\n    void loadUnknowns(const ptree &node, vector<Unknown> &vector) {\n\n        for (const ptree::value_type &v : node) {\n            if (v.first == \"Unknown\") {\n                Unknown unknown;\n                unknown.load(v.second);\n                vector.push_back(unknown);\n            }\n        }\n\n    }\n\n    template <class T>\n    std::optional<T> convert(boost::optional<T> opt) {\n        if (!opt) {\n            return {};\n        } else {\n            return *opt;\n        }\n    }\n\n}\n\nunsigned int Unknown::index() const {\n    return index_;\n}\n\nstd::optional<std::string> Unknown::dependencyKind() const {\n    return dependencyKind_;\n}\n\nconst std::optional<std::vector<unsigned int>> &Unknown::dependencies() const {\n    return *dependencies_;\n}\n\nvoid Unknown::load(const ptree &node) {\n    index_ = node.get<unsigned int>(\"<xmlattr>.index\");\n    dependencyKind_ = convert(node.get_optional<string>(\"<xmlattr>.dependencyKind\"));\n}\n\n\nconst std::vector<Unknown> &ModelStructure::outputs() const {\n    return outputs_;\n}\n\nconst std::vector<Unknown> &ModelStructure::derivatives() const {\n    return derivatives_;\n}\n\nconst std::vector<Unknown> &ModelStructure::initialUnknowns() const {\n    return initialUnknowns_;\n}\n\nvoid ModelStructure::load(const ptree &node) {\n\n    for (const ptree::value_type &v : node) {\n        if (v.first == \"Outputs\") {\n            loadUnknowns(v.second, outputs_);\n        } else if (v.first == \"Derivatives\") {\n            loadUnknowns(v.second, derivatives_);\n        } else if (v.first == \"InitialUnknowns\") {\n            loadUnknowns(v.second, initialUnknowns_);\n        }\n    }\n\n}\n<commit_msg>fix return type warning<commit_after>\/*\n * The MIT License\n *\n * Copyright 2017-2018 Norwegian University of Technology\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 <boost\/optional.hpp>\n#include <fmicpp\/fmi2\/xml\/ModelStructure.hpp>\n\n\nusing namespace std;\nusing namespace fmicpp::fmi2::xml;\n\nnamespace {\n\n    void loadUnknowns(const ptree &node, vector<Unknown> &vector) {\n\n        for (const ptree::value_type &v : node) {\n            if (v.first == \"Unknown\") {\n                Unknown unknown;\n                unknown.load(v.second);\n                vector.push_back(unknown);\n            }\n        }\n\n    }\n\n    template <class T>\n    std::optional<T> convert(boost::optional<T> opt) {\n        if (!opt) {\n            return {};\n        } else {\n            return *opt;\n        }\n    }\n\n}\n\nunsigned int Unknown::index() const {\n    return index_;\n}\n\nstd::optional<std::string> Unknown::dependencyKind() const {\n    return dependencyKind_;\n}\n\nconst std::optional<std::vector<unsigned int>> &Unknown::dependencies() const {\n    return dependencies_;\n}\n\nvoid Unknown::load(const ptree &node) {\n    index_ = node.get<unsigned int>(\"<xmlattr>.index\");\n    dependencyKind_ = convert(node.get_optional<string>(\"<xmlattr>.dependencyKind\"));\n}\n\n\nconst std::vector<Unknown> &ModelStructure::outputs() const {\n    return outputs_;\n}\n\nconst std::vector<Unknown> &ModelStructure::derivatives() const {\n    return derivatives_;\n}\n\nconst std::vector<Unknown> &ModelStructure::initialUnknowns() const {\n    return initialUnknowns_;\n}\n\nvoid ModelStructure::load(const ptree &node) {\n\n    for (const ptree::value_type &v : node) {\n        if (v.first == \"Outputs\") {\n            loadUnknowns(v.second, outputs_);\n        } else if (v.first == \"Derivatives\") {\n            loadUnknowns(v.second, derivatives_);\n        } else if (v.first == \"InitialUnknowns\") {\n            loadUnknowns(v.second, initialUnknowns_);\n        }\n    }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/** \\copyright\n * Copyright (c) 2015, 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 Select.cxx\n * This file imlements POSIX select().\n *\n * @author Stuart W. Baker\n * @date 26 January 2015\n *\/\n\n#include <fcntl.h>\n#include <sys\/select.h>\n\n#include \"Devtab.hxx\"\n\n\/** event used to wakeup select calls *\/\nstatic OSEvent wakeup;\n\n\/** Returns an event bit unique to the current thread.\n * @return event bit unique to the current thread\n *\/\nstatic OSEventType get_event()\n{\n    static int thread_count = 0;\n    ThreadPriv *priv = (ThreadPriv*)xTaskGetApplicationTaskTag(NULL);\n\n    if (priv->selectEventBit == 0)\n    {\n        if(thread_count >= OSEvent::number_of_bits())\n        {\n            thread_count = 0;\n        }\n        priv->selectEventBit = 0x1 << thread_count;\n        ++thread_count;\n    }\n\n    return priv->selectEventBit;\n}\n\n\/** POSIX select().\n * @param nfds highest numbered file descriptor in any of the three, sets plus 1\n * @param readfds fd_set of file descritpors to pend on read active\n * @param writefds fd_set of file descritpors to pend on write active\n * @param exceptfds fd_set of file descritpors to pend on error active\n * @param timeout timeout value to wait, if 0, return immediately, if NULL\n *                wait forever\n * @return on success, number of file descriptors in the three sets that are\n *         active, 0 on timeout, -1 with errno set appropriately upon error.\n *\/\nint Device::select(int nfds, fd_set *readfds, fd_set *writefds,\n                   fd_set *exceptfds, struct timeval *timeout)\n{\n    long long until = 0;\n    if (timeout)\n    {\n        until = OSTime::get_monotonic() +\n                ((long long)timeout->tv_sec * 1000LL * 1000LL *1000LL) +\n                ((long long)timeout->tv_usec * 1000LL);\n    }\n    fd_set rd_result;\n    fd_set wr_result;\n    fd_set ex_result;\n\n    int mode_type[] = {FREAD, FWRITE, 0};\n    fd_set *in_set[3] = {readfds, writefds, exceptfds};\n    fd_set *out_set[3] = {&rd_result, &wr_result, &ex_result};\n    int number = 0;\n\n    FD_ZERO(&rd_result);\n    FD_ZERO(&wr_result);\n    FD_ZERO(&ex_result);\n\n    portENTER_CRITICAL();\n    OSEventType event = get_event();\n    portEXIT_CRITICAL();\n    wakeup.clear(event);\n\n    for ( ; \/* forever *\/ ; )\n    {\n        \/* cycle through all the FD Sets *\/\n        for (int mode = 0; mode < 3; ++mode)\n        {\n            if (in_set[mode])\n            {\n                \/* cycle through all the file descriptors *\/\n                for (int i = 0; i < nfds; ++i)\n                {\n                    if (FD_ISSET(i, in_set[mode]))\n                    {\n                        File *file = file_lookup(i);\n                        if (!file)\n                        {\n                            \/* errno should already be set appropriately *\/\n                            return -1;\n                        }\n                        if (file->dev->select(file, mode_type[mode]))\n                        {\n                            \/* active *\/\n                            FD_SET(i, out_set[mode]);\n                            ++number;\n                        }\n                    }\n                }\n            }\n        }\n\n        if (number)\n        {\n            \/* We have a read *\/\n            if (readfds)\n            {\n                *readfds = rd_result;\n            }\n            if (writefds)\n            {\n                *writefds = wr_result;\n            }\n            if (exceptfds)\n            {\n                *exceptfds = ex_result;\n            }\n            return number;\n        }\n\n        if (timeout)\n        {\n            long long now = OSTime::get_monotonic();\n            if (now >= until)\n            {\n                return 0;\n            }\n            wakeup.timedwait(event, NULL, true, OSEvent::WAIT_ANY, until - now);\n        }\n        else\n        {\n            \/* block forever until fd active *\/\n            wakeup.wait(event, NULL, true, OSEvent::WAIT_ANY);\n        }\n    }\n}\n\n\/** Device select method. Default impementation returns true.\n * @param file reference to the file\n * @param mode FREAD for read active, FWRITE for write active, 0 for\n *        exceptions\n * @return true if active, false if inactive\n *\/\nbool Device::select(File* file, int mode)\n{\n    return true;\n}\n\n\/** Add client to list of clients needing woken,\n * @param info wakeup event instance\n *\/\nvoid Device::select_insert(SelectInfo *info)\n{\n    portENTER_CRITICAL();\n    info->event |= get_event();\n    portEXIT_CRITICAL();\n}\n\n\/** Wakeup the list of clients needing woken,\n * @param info wakeup event instance\n *\/\nvoid Device::select_wakeup(SelectInfo *info)\n{\n    portENTER_CRITICAL();\n    if (info->event != 0)\n    {\n        wakeup.set(info->event);\n        info->event = 0;\n    }\n    portEXIT_CRITICAL();\n}\n\n\/** Wakeup the list of clients needing woken,\n * @param info wakeup event instance\n *\/\nvoid Device::select_wakeup_from_isr(SelectInfo *info, int *woken)\n{\n    if (info->event != 0)\n    {\n        wakeup.set_from_isr(info->event, woken);\n        info->event = 0;\n    }\n}\n\n\n<commit_msg>Add todo comment<commit_after>\/** \\copyright\n * Copyright (c) 2015, 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 Select.cxx\n * This file imlements POSIX select().\n *\n * @author Stuart W. Baker\n * @date 26 January 2015\n *\/\n\n#include <fcntl.h>\n#include <sys\/select.h>\n\n#include \"Devtab.hxx\"\n\n\/** event used to wakeup select calls *\/\nstatic OSEvent wakeup;\n\n\/** Returns an event bit unique to the current thread.\n * @return event bit unique to the current thread\n *\/\nstatic OSEventType get_event()\n{\n    static int thread_count = 0;\n    ThreadPriv *priv = (ThreadPriv*)xTaskGetApplicationTaskTag(NULL);\n\n    if (priv->selectEventBit == 0)\n    {\n        if(thread_count >= OSEvent::number_of_bits())\n        {\n            thread_count = 0;\n        }\n        priv->selectEventBit = 0x1 << thread_count;\n        ++thread_count;\n    }\n\n    return priv->selectEventBit;\n}\n\n\/** POSIX select().\n * @param nfds highest numbered file descriptor in any of the three, sets plus 1\n * @param readfds fd_set of file descritpors to pend on read active\n * @param writefds fd_set of file descritpors to pend on write active\n * @param exceptfds fd_set of file descritpors to pend on error active\n * @param timeout timeout value to wait, if 0, return immediately, if NULL\n *                wait forever\n * @return on success, number of file descriptors in the three sets that are\n *         active, 0 on timeout, -1 with errno set appropriately upon error.\n *\/\nint Device::select(int nfds, fd_set *readfds, fd_set *writefds,\n                   fd_set *exceptfds, struct timeval *timeout)\n{\n    long long until = 0;\n    if (timeout)\n    {\n        until = OSTime::get_monotonic() +\n                ((long long)timeout->tv_sec * 1000LL * 1000LL *1000LL) +\n                ((long long)timeout->tv_usec * 1000LL);\n    }\n    fd_set rd_result;\n    fd_set wr_result;\n    fd_set ex_result;\n\n    int mode_type[] = {FREAD, FWRITE, 0};\n    fd_set *in_set[3] = {readfds, writefds, exceptfds};\n    fd_set *out_set[3] = {&rd_result, &wr_result, &ex_result};\n    int number = 0;\n\n    FD_ZERO(&rd_result);\n    FD_ZERO(&wr_result);\n    FD_ZERO(&ex_result);\n\n    portENTER_CRITICAL();\n    OSEventType event = get_event();\n    portEXIT_CRITICAL();\n    wakeup.clear(event);\n\n    for ( ; \/* forever *\/ ; )\n    {\n        \/* cycle through all the FD Sets *\/\n        for (int mode = 0; mode < 3; ++mode)\n        {\n            if (in_set[mode])\n            {\n                \/* cycle through all the file descriptors *\/\n                for (int i = 0; i < nfds; ++i)\n                {\n                    if (FD_ISSET(i, in_set[mode]))\n                    {\n                        File *file = file_lookup(i);\n                        if (!file)\n                        {\n                            \/* errno should already be set appropriately *\/\n                            return -1;\n                        }\n                        if (file->dev->select(file, mode_type[mode]))\n                        {\n                            \/* active *\/\n                            FD_SET(i, out_set[mode]);\n                            ++number;\n                        }\n                    }\n                }\n            }\n        }\n\n        if (number)\n        {\n            \/* We have a read *\/\n            if (readfds)\n            {\n                *readfds = rd_result;\n            }\n            if (writefds)\n            {\n                *writefds = wr_result;\n            }\n            if (exceptfds)\n            {\n                *exceptfds = ex_result;\n            }\n            return number;\n        }\n\n        if (timeout)\n        {\n            long long now = OSTime::get_monotonic();\n            if (now >= until)\n            {\n                return 0;\n            }\n            wakeup.timedwait(event, NULL, true, OSEvent::WAIT_ANY, until - now);\n        }\n        else\n        {\n            \/* block forever until fd active *\/\n            wakeup.wait(event, NULL, true, OSEvent::WAIT_ANY);\n        }\n    }\n}\n\n\/** Device select method. Default impementation returns true.\n * @param file reference to the file\n * @param mode FREAD for read active, FWRITE for write active, 0 for\n *        exceptions\n * @return true if active, false if inactive\n *\/\nbool Device::select(File* file, int mode)\n{\n    return true;\n}\n\n\/** Add client to list of clients needing woken,\n * @param info wakeup event instance\n *\/\nvoid Device::select_insert(SelectInfo *info)\n{\n    \/** @todo do we need the critical lock here, or are we always already\n     * locked?\n     *\/\n    portENTER_CRITICAL();\n    info->event |= get_event();\n    portEXIT_CRITICAL();\n}\n\n\/** Wakeup the list of clients needing woken,\n * @param info wakeup event instance\n *\/\nvoid Device::select_wakeup(SelectInfo *info)\n{\n    portENTER_CRITICAL();\n    if (info->event != 0)\n    {\n        wakeup.set(info->event);\n        info->event = 0;\n    }\n    portEXIT_CRITICAL();\n}\n\n\/** Wakeup the list of clients needing woken,\n * @param info wakeup event instance\n *\/\nvoid Device::select_wakeup_from_isr(SelectInfo *info, int *woken)\n{\n    if (info->event != 0)\n    {\n        wakeup.set_from_isr(info->event, woken);\n        info->event = 0;\n    }\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*Copyright 2010 George Karagoulis\r\n\r\nLicensed under the Apache License, Version 2.0 (the \"License\");\r\nyou may not use this file except in compliance with the License.\r\nYou may obtain a copy of the License at\r\n\r\n    http:\/\/www.apache.org\/licenses\/LICENSE-2.0\r\n\r\nUnless required by applicable law or agreed to in writing, software\r\ndistributed under the License is distributed on an \"AS IS\" BASIS,\r\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\nSee the License for the specific language governing permissions and\r\nlimitations under the License.*\/\r\n\r\n#include \"DataAccess\/gconsoleiodevice.h\"\r\n#include \"DataAccess\/gfileiodevice.h\"\r\n#include \"DataAccess\/gdatabaseiodevice.h\"\r\n#include \"DataObjects\/DataSet\/datatable.h\"\r\n#include \"Logging\/filelogger.h\"\r\n#include \"Logging\/globallogger.h\"\r\n#include \"Logging\/debuglogger.h\"\r\n#include \"Core\/exception.h\"\r\n#include <QtCore\/QString>\r\n#include <QtTest\/QtTest>\r\n#include <QtCore\/QCoreApplication>\r\n#include <QSqlDatabase>\r\n#include <QSqlDriver>\r\n#include <QSqlQuery>\r\n#include <QSqlError>\r\nusing namespace GUtil::DataAccess;\r\nusing namespace GUtil::Logging;\r\nusing namespace GUtil;\r\n\r\nclass TransportsTest : public QObject\r\n{\r\n    Q_OBJECT\r\n\r\npublic:\r\n    TransportsTest();\r\n\r\nprivate Q_SLOTS:\r\n    void initTestCase();\r\n    void cleanupTestCase();\r\n    \/\/void test_console_transport();\r\n    void test_file_transport();\r\n    void test_database_transport();\r\n};\r\n\r\nTransportsTest::TransportsTest()\r\n{\r\n    GlobalLogger::SetupDefaultLogger(new FileLogger(\"transports.log\"));\r\n}\r\n\r\nvoid TransportsTest::initTestCase()\r\n{\r\n}\r\n\r\nvoid TransportsTest::cleanupTestCase()\r\n{\r\n}\r\n\r\n\/\/void TransportsTest::test_console_transport()\r\n\/\/{\r\n\/\/    try\r\n\/\/    {\r\n\/\/        GConsoleIODevice ct;\r\n\/\/        std::string inval;\r\n\r\n\/\/        ct<<\"Hello World!\\n\\nYou must type an h: \";\r\n\/\/        ct>>inval;\r\n\r\n\/\/        QVERIFY2(inval == \"h\", inval.c_str());\r\n\r\n\/\/        ct<<\"Now type a k: \";\r\n\/\/        ct>>inval;\r\n\/\/        QVERIFY2(inval == \"k\", inval.c_str());\r\n\/\/    }\r\n\/\/    catch(Core::Exception &ex)\r\n\/\/    {\r\n\/\/        GlobalLogger::LogException(ex);\r\n\/\/        QVERIFY2(false, \"Check log for details\");\r\n\/\/    }\r\n\/\/}\r\n\r\nvoid TransportsTest::test_file_transport()\r\n{\r\n    try\r\n    {\r\n        GFileIODevice ft(\"Testfile.txt\");\r\n\r\n        ft.SetWriteMode(GFileIODevice::WriteOver);\r\n        ft.Write(\"Bogus data\");\r\n        QVERIFY2(ft.FileData() == \"Bogus data\", QString(ft.FileData()).toStdString().c_str());\r\n\r\n        ft.Write(\"Hello World!\");\r\n        QVERIFY2(ft.FileData() == \"Hello World!\", QString(ft.FileData()).toStdString().c_str());\r\n\r\n        ft.SetWriteMode(GFileIODevice::WriteAppend);\r\n        ft.Write(\"7\");\r\n        QVERIFY(ft.FileData() == \"Hello World!7\");\r\n\r\n        ft.Write(\"\\nNew line\");\r\n\r\n        GFileIODevice ft2(\"Testfile.txt\");\r\n        QVERIFY2(ft.FileData() == ft2.FileData(), QString(\"(%1, %2)\")\r\n                 .arg(QString(ft.FileData()))\r\n                 .arg(QString(ft2.FileData())).toStdString().c_str()\r\n                 );\r\n    }\r\n    catch(Core::Exception &ex)\r\n    {\r\n        GlobalLogger::LogException(ex);\r\n        throw;\r\n    }\r\n}\r\n\r\nvoid TransportsTest::test_database_transport()\r\n{\r\n    try\r\n    {\r\n        QString connection_name(\"MyConnection\");\r\n        QSqlDatabase::addDatabase(\"QSQLITE\", connection_name)\r\n                .setDatabaseName(\"temp.sqlite\");\r\n\r\n        GDatabaseIODevice dbio(connection_name, this);\r\n\r\n        \/\/ Create a table with two columns, the first an integer, the second\r\n        \/\/  is text, and make the first column a primary key\r\n        dbio.CreateTable(\"test\",\r\n                         Custom::GPairList<QString, QString>() <<\r\n                         QPair<QString, QString>(\"one\", \"INTEGER\") <<\r\n                         QPair<QString, QString>(\"two\", \"TEXT\"),\r\n                         QList<int>() << 0,\r\n                         true);\r\n\r\n        \/\/ Insert a new row\r\n        DataObjects::DataTable tbl(dbio.GetBlankTable(\"test\"));\r\n\r\n        \/\/ The new row is blank for the first column, because it will be assigned an auto-incrementing id\r\n        tbl.AddNewRow(Custom::GVariantList() << Custom::GVariant() << \"2\");\r\n        try\r\n        {\r\n            \/\/ To start we shouldn't have any data in the table\r\n            QVERIFY(dbio.Count(\"test\") == 0);\r\n\r\n            dbio.Insert(tbl);\r\n\r\n            \/\/ Now we have one row in the database\r\n            QVERIFY(dbio.Count(\"test\") == 1);\r\n        }\r\n        catch(Core::Exception &ex)\r\n        {\r\n            dLogException(ex);\r\n            QFAIL(ex.GetMessage().c_str());\r\n        }\r\n\r\n\r\n        \/\/ Select the row we just inserted\r\n        try\r\n        {\r\n            DatabaseSelectionParameters params = dbio.GetBlankSelectionParameters(\"test\");\r\n            params[\"one\"] = \"1\";\r\n\r\n            tbl = dbio.Select(params);\r\n        }\r\n        catch(Core::Exception &ex)\r\n        {\r\n            dLogException(ex);\r\n            QFAIL(ex.GetMessage().c_str());\r\n        }\r\n\r\n        QVERIFY2(tbl[0][0] == 1, tbl[0][0].toString().toStdString().c_str());\r\n        QVERIFY2(tbl[0][1] == 2, tbl[0][1].toString().toStdString().c_str());\r\n    }\r\n    catch(Core::Exception &ex)\r\n    {\r\n        dLogException(ex);\r\n        QFAIL(\"Exception caught\");\r\n    }\r\n}\r\n\r\nQTEST_MAIN(TransportsTest);\r\n\r\n#include \"tst_transportstest.moc\"\r\n<commit_msg>Added a verify statement that verifies the last insert id<commit_after>\/*Copyright 2010 George Karagoulis\r\n\r\nLicensed under the Apache License, Version 2.0 (the \"License\");\r\nyou may not use this file except in compliance with the License.\r\nYou may obtain a copy of the License at\r\n\r\n    http:\/\/www.apache.org\/licenses\/LICENSE-2.0\r\n\r\nUnless required by applicable law or agreed to in writing, software\r\ndistributed under the License is distributed on an \"AS IS\" BASIS,\r\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\nSee the License for the specific language governing permissions and\r\nlimitations under the License.*\/\r\n\r\n#include \"DataAccess\/gconsoleiodevice.h\"\r\n#include \"DataAccess\/gfileiodevice.h\"\r\n#include \"DataAccess\/gdatabaseiodevice.h\"\r\n#include \"DataObjects\/DataSet\/datatable.h\"\r\n#include \"Logging\/filelogger.h\"\r\n#include \"Logging\/globallogger.h\"\r\n#include \"Logging\/debuglogger.h\"\r\n#include \"Core\/exception.h\"\r\n#include <QtCore\/QString>\r\n#include <QtTest\/QtTest>\r\n#include <QtCore\/QCoreApplication>\r\n#include <QSqlDatabase>\r\n#include <QSqlDriver>\r\n#include <QSqlQuery>\r\n#include <QSqlError>\r\nusing namespace GUtil::DataAccess;\r\nusing namespace GUtil::Logging;\r\nusing namespace GUtil;\r\n\r\nclass TransportsTest : public QObject\r\n{\r\n    Q_OBJECT\r\n\r\npublic:\r\n    TransportsTest();\r\n\r\nprivate Q_SLOTS:\r\n    void initTestCase();\r\n    void cleanupTestCase();\r\n    \/\/void test_console_transport();\r\n    void test_file_transport();\r\n    void test_database_transport();\r\n};\r\n\r\nTransportsTest::TransportsTest()\r\n{\r\n    GlobalLogger::SetupDefaultLogger(new FileLogger(\"transports.log\"));\r\n}\r\n\r\nvoid TransportsTest::initTestCase()\r\n{\r\n}\r\n\r\nvoid TransportsTest::cleanupTestCase()\r\n{\r\n}\r\n\r\n\/\/void TransportsTest::test_console_transport()\r\n\/\/{\r\n\/\/    try\r\n\/\/    {\r\n\/\/        GConsoleIODevice ct;\r\n\/\/        std::string inval;\r\n\r\n\/\/        ct<<\"Hello World!\\n\\nYou must type an h: \";\r\n\/\/        ct>>inval;\r\n\r\n\/\/        QVERIFY2(inval == \"h\", inval.c_str());\r\n\r\n\/\/        ct<<\"Now type a k: \";\r\n\/\/        ct>>inval;\r\n\/\/        QVERIFY2(inval == \"k\", inval.c_str());\r\n\/\/    }\r\n\/\/    catch(Core::Exception &ex)\r\n\/\/    {\r\n\/\/        GlobalLogger::LogException(ex);\r\n\/\/        QVERIFY2(false, \"Check log for details\");\r\n\/\/    }\r\n\/\/}\r\n\r\nvoid TransportsTest::test_file_transport()\r\n{\r\n    try\r\n    {\r\n        GFileIODevice ft(\"Testfile.txt\");\r\n\r\n        ft.SetWriteMode(GFileIODevice::WriteOver);\r\n        ft.Write(\"Bogus data\");\r\n        QVERIFY2(ft.FileData() == \"Bogus data\", QString(ft.FileData()).toStdString().c_str());\r\n\r\n        ft.Write(\"Hello World!\");\r\n        QVERIFY2(ft.FileData() == \"Hello World!\", QString(ft.FileData()).toStdString().c_str());\r\n\r\n        ft.SetWriteMode(GFileIODevice::WriteAppend);\r\n        ft.Write(\"7\");\r\n        QVERIFY(ft.FileData() == \"Hello World!7\");\r\n\r\n        ft.Write(\"\\nNew line\");\r\n\r\n        GFileIODevice ft2(\"Testfile.txt\");\r\n        QVERIFY2(ft.FileData() == ft2.FileData(), QString(\"(%1, %2)\")\r\n                 .arg(QString(ft.FileData()))\r\n                 .arg(QString(ft2.FileData())).toStdString().c_str()\r\n                 );\r\n    }\r\n    catch(Core::Exception &ex)\r\n    {\r\n        GlobalLogger::LogException(ex);\r\n        throw;\r\n    }\r\n}\r\n\r\nvoid TransportsTest::test_database_transport()\r\n{\r\n    try\r\n    {\r\n        QString connection_name(\"MyConnection\");\r\n        QSqlDatabase::addDatabase(\"QSQLITE\", connection_name)\r\n                .setDatabaseName(\"temp.sqlite\");\r\n\r\n        GDatabaseIODevice dbio(connection_name, this);\r\n\r\n        \/\/ Create a table with two columns, the first an integer, the second\r\n        \/\/  is text, and make the first column a primary key\r\n        dbio.CreateTable(\"test\",\r\n                         Custom::GPairList<QString, QString>() <<\r\n                         QPair<QString, QString>(\"one\", \"INTEGER\") <<\r\n                         QPair<QString, QString>(\"two\", \"TEXT\"),\r\n                         QList<int>() << 0,\r\n                         true);\r\n\r\n        \/\/ Insert a new row\r\n        DataObjects::DataTable tbl(dbio.GetBlankTable(\"test\"));\r\n\r\n        \/\/ The new row is blank for the first column, because it will be assigned an auto-incrementing id\r\n        tbl.AddNewRow(Custom::GVariantList() << Custom::GVariant() << \"2\");\r\n        try\r\n        {\r\n            \/\/ To start we shouldn't have any data in the table\r\n            QVERIFY(dbio.Count(\"test\") == 0);\r\n            QVERIFY(dbio.LastInsertId() == 0);\r\n\r\n            dbio.Insert(tbl);\r\n\r\n            \/\/ Verify that the auto-incrementing key is working\r\n            QVERIFY2(dbio.LastInsertId() == 1,\r\n                     QString(\"%1\").arg(dbio.LastInsertId()).toStdString().c_str());\r\n\r\n            \/\/ Now we have one row in the database\r\n            QVERIFY(dbio.Count(\"test\") == 1);\r\n        }\r\n        catch(Core::Exception &ex)\r\n        {\r\n            dLogException(ex);\r\n            QFAIL(ex.GetMessage().c_str());\r\n        }\r\n\r\n\r\n        \/\/ Select the row we just inserted\r\n        try\r\n        {\r\n            DatabaseSelectionParameters params = dbio.GetBlankSelectionParameters(\"test\");\r\n            params[\"one\"] = \"1\";\r\n\r\n            tbl = dbio.Select(params);\r\n        }\r\n        catch(Core::Exception &ex)\r\n        {\r\n            dLogException(ex);\r\n            QFAIL(ex.GetMessage().c_str());\r\n        }\r\n\r\n        QVERIFY2(tbl[0][0] == 1, tbl[0][0].toString().toStdString().c_str());\r\n        QVERIFY2(tbl[0][1] == 2, tbl[0][1].toString().toStdString().c_str());\r\n    }\r\n    catch(Core::Exception &ex)\r\n    {\r\n        dLogException(ex);\r\n        QFAIL(\"Exception caught\");\r\n    }\r\n}\r\n\r\nQTEST_MAIN(TransportsTest);\r\n\r\n#include \"tst_transportstest.moc\"\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * This file is part of the µOS++ distribution.\n *   (https:\/\/github.com\/micro-os-plus)\n * Copyright (c) 2016 Liviu Ionescu.\n *\n * µOS++ 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, version 3.\n *\n * µOS++ 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 License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include <cmsis-plus\/rtos\/os.h>\n#include <cmsis-plus\/diag\/trace.h>\n\n#include <cmsis-plus\/rtos\/port\/os-decls.h>\n#include <cmsis-plus\/rtos\/port\/os-inlines.h>\n\n\/\/ ----------------------------------------------------------------------------\n\n#include <cassert>\n#include <cerrno>\n#include <cstdlib>\n\n\/\/ ----------------------------------------------------------------------------\n\nnamespace os\n{\n  namespace rtos\n  {\n\n    \/\/ ------------------------------------------------------------------------\n\n    namespace mempool\n    {\n      const Attributes initializer\n        { nullptr };\n\n    } \/* namespace mempool *\/\n\n    \/\/ ------------------------------------------------------------------------\n\n    \/**\n     *\n     * @warning Cannot be invoked from Interrupt Service Routines.\n     *\/\n    Memory_pool::Memory_pool (mempool::size_t blocks,\n                              mempool::size_t block_size_bytes) :\n        Memory_pool\n          { mempool::initializer, blocks, block_size_bytes }\n    {\n      ;\n    }\n\n    \/**\n     *\n     * @warning Cannot be invoked from Interrupt Service Routines.\n     *\/\n    Memory_pool::Memory_pool (const mempool::Attributes& attr,\n                              mempool::size_t blocks,\n                              mempool::size_t block_size_bytes) :\n        Named_object\n          { attr.name () }, \/\/\n        blocks_ (blocks), \/\/\n        block_size_bytes_ (block_size_bytes)\n\n    {\n      os_assert_throw(!scheduler::in_handler_mode (), EPERM);\n\n      pool_addr_ = (char*) attr.mp_pool_address;\n\n      assert(blocks_ > 0);\n      \/\/ Blocks must be large enough to store the index, used\n      \/\/ to construct the list of free blocks.\n      assert(block_size_bytes_ >= sizeof(std::ptrdiff_t));\n\n      flags_ = 0;\n\n      trace::printf (\"%s() @%p %s %d %d\\n\", __func__, this, name (), blocks_,\n                     block_size_bytes_);\n\n      if (pool_addr_ == nullptr)\n        {\n          pool_addr_ = new (std::nothrow) char[blocks_ * block_size_bytes_];\n          flags_ |= flags_allocated;\n        }\n\n      os_assert_throw(pool_addr_ != nullptr, ENOMEM);\n\n      \/\/ Construct a linked list of blocks. Store the pointer at\n      \/\/ the beginning of each block. Each block\n      \/\/ will hold the address of the next free block, or nullptr at the end.\n      char* p = pool_addr_;\n      for (std::size_t i = 1; i < blocks_; ++i)\n        {\n          *(void**) p = (p + block_size_bytes_);\n          p += block_size_bytes_;\n        }\n      *(void**) p = nullptr;\n\n      first_ = pool_addr_; \/\/ Pointer to first block.\n      last_ = p; \/\/ Pointer to last block.\n\n      count_ = 0; \/\/ No allocated blocks.\n    }\n\n    \/**\n     * @warning Cannot be invoked from Interrupt Service Routines.\n     *\/\n    Memory_pool::~Memory_pool ()\n    {\n      trace::printf (\"%s() @%p %s\\n\", __func__, this, name ());\n\n      if (flags_ | flags_allocated)\n        {\n          delete[] (pool_addr_);\n        }\n    }\n\n    \/*\n     * Internal function used to return the first block in the\n     * free list.\n     *\/\n    void*\n    Memory_pool::try_first (void)\n    {\n      if (first_ != nullptr)\n        {\n          void* p = (void*) first_;\n          first_ = *(void**) first_;\n          ++count_;\n          return p;\n        }\n      return nullptr;\n    }\n\n    \/**\n     * @details\n     * Allocate a fixed size memory block from the memory pool.\n     *\n     * It uses a critical section to protect simultaneous access from\n     * other threads or interrupts.\n     *\n     * @warning Cannot be invoked from Interrupt Service Routines.\n     *\/\n    void*\n    Memory_pool::alloc (void)\n    {\n      os_assert_throw(!scheduler::in_handler_mode (), EPERM);\n\n      trace::printf (\"%s() @%p %s\\n\", __func__, this, name ());\n\n      bool queued = false;\n      for (;;)\n        {\n            {\n              Critical_section_irq cs; \/\/ ----- Critical section -----\n\n              void* p = try_first ();\n              if (p != nullptr)\n                {\n                  return p;\n                }\n\n              if (!queued)\n                {\n                  \/\/ Add this thread to the waiting list.\n                  \/\/ Will be removed by free().\n                  list_.add (&this_thread::thread ());\n                  queued = true;\n                }\n            }\n          this_thread::suspend ();\n\n          if (this_thread::thread ().interrupted ())\n            {\n              return nullptr;\n            }\n        }\n\n      \/* NOTREACHED *\/\n      return nullptr;\n    }\n\n    \/**\n     * @details\n     * Allocate a fixed size memory block from the memory pool.\n     *\n     * It uses a critical section to protect simultaneous access from\n     * other threads or interrupts.\n     *\n     * @note Can be invoked from Interrupt Service Routines.\n     *\/\n    void*\n    Memory_pool::try_alloc (void)\n    {\n      trace::printf (\"%s() @%p %s\\n\", __func__, this, name ());\n\n      return try_first ();\n    }\n\n    \/**\n     * @details\n     * Allocate a fixed size memory block from the memory pool.\n     *\n     * It uses a critical section to protect simultaneous access from\n     * other threads or interrupts.\n     *\n     * @warning Cannot be invoked from Interrupt Service Routines.\n     *\/\n    void*\n    Memory_pool::timed_alloc (systicks_t ticks)\n    {\n      os_assert_throw(!scheduler::in_handler_mode (), EPERM);\n\n      trace::printf (\"%s(%d) @%p %s\\n\", __func__, ticks, this, name ());\n\n      bool queued = false;\n\n      Systick_clock::rep start = Systick_clock::now ();\n      for (;;)\n        {\n          Systick_clock::sleep_rep slept_ticks;\n            {\n              Critical_section_irq cs; \/\/ ----- Critical section -----\n\n              void* p = try_first ();\n              if (p != nullptr)\n                {\n                  return p;\n                }\n\n              Systick_clock::rep now = Systick_clock::now ();\n              slept_ticks = (Systick_clock::sleep_rep) (now - start);\n              if (slept_ticks >= ticks)\n                {\n                  if (queued)\n                    {\n                      list_.remove (&this_thread::thread ());\n                    }\n                  return nullptr;\n                }\n\n              if (!queued)\n                {\n                  \/\/ Add this thread to the waiting list.\n                  \/\/ Will be removed by free() or if timeout occurs.\n                  list_.add (&this_thread::thread ());\n                  queued = true;\n                }\n            }\n\n          Systick_clock::sleep_for (ticks - slept_ticks);\n\n          if (this_thread::thread ().interrupted ())\n            {\n              return nullptr;\n            }\n        }\n\n      \/* NOTREACHED *\/\n      return nullptr;\n    }\n\n    \/**\n     * @details\n     * Return a memory block previously allocated by `alloc()` or\n     * `calloc()` back to the memory pool.\n     *\n     * It uses a critical section to protect simultaneous access from\n     * other threads or interrupts.\n     *\n     * @note Can be invoked from Interrupt Service Routines.\n     *\/\n    result_t\n    Memory_pool::free (void* block)\n    {\n      trace::printf (\"%s() @%p %s\\n\", __func__, this, name ());\n\n      \/\/ Validate pointer.\n      if ((block < pool_addr_)\n          || (block >= (pool_addr_ + blocks_ * block_size_bytes_)))\n        {\n          return EINVAL;\n        }\n\n      Critical_section_irq cs; \/\/ ----- Critical section -----\n\n      \/\/ Perform a push_back() on the single linked FIFO list,\n      \/\/ i.e. add the block to the end of the list.\n      if (last_ != nullptr)\n        {\n          \/\/ Link the block after the current last.\n          *(void**) last_ = block;\n        }\n\n      \/\/ Mark block as end of list.\n      *(void**) block = nullptr;\n\n      \/\/ Now this block is the last one.\n      last_ = block;\n\n      \/\/ If the list was empty (all blocks were allocated, so no first),\n      \/\/ this block will be both the first and the last.\n      if (first_ == nullptr)\n        {\n          first_ = block;\n        }\n\n      --count_;\n\n      if (!list_.empty ())\n        {\n          \/\/ Wake-up one thread, if any.\n          list_.top_prio_task ()->wakeup ();\n        }\n\n      return result::ok;\n    }\n\n    \/**\n     * @details\n     * Reset the memory pool to initial state, all block are free.\n     *\n     * @warning Cannot be invoked from Interrupt Service Routines.\n     *\/\n    result_t\n    Memory_pool::reset (void)\n    {\n      os_assert_err(!scheduler::in_handler_mode (), EPERM);\n\n      trace::printf (\"%s() @%p %s\\n\", __func__, this, name ());\n\n      \/\/ TODO\n      return result::ok;\n    }\n\n  \/\/ --------------------------------------------------------------------------\n\n  } \/* namespace rtos *\/\n} \/* namespace os *\/\n<commit_msg>os-mempool: adjust 0 ticks<commit_after>\/*\n * This file is part of the µOS++ distribution.\n *   (https:\/\/github.com\/micro-os-plus)\n * Copyright (c) 2016 Liviu Ionescu.\n *\n * µOS++ 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, version 3.\n *\n * µOS++ 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 License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include <cmsis-plus\/rtos\/os.h>\n#include <cmsis-plus\/diag\/trace.h>\n\n#include <cmsis-plus\/rtos\/port\/os-decls.h>\n#include <cmsis-plus\/rtos\/port\/os-inlines.h>\n\n\/\/ ----------------------------------------------------------------------------\n\n#include <cassert>\n#include <cerrno>\n#include <cstdlib>\n\n\/\/ ----------------------------------------------------------------------------\n\nnamespace os\n{\n  namespace rtos\n  {\n\n    \/\/ ------------------------------------------------------------------------\n\n    namespace mempool\n    {\n      const Attributes initializer\n        { nullptr };\n\n    } \/* namespace mempool *\/\n\n    \/\/ ------------------------------------------------------------------------\n\n    \/**\n     *\n     * @warning Cannot be invoked from Interrupt Service Routines.\n     *\/\n    Memory_pool::Memory_pool (mempool::size_t blocks,\n                              mempool::size_t block_size_bytes) :\n        Memory_pool\n          { mempool::initializer, blocks, block_size_bytes }\n    {\n      ;\n    }\n\n    \/**\n     *\n     * @warning Cannot be invoked from Interrupt Service Routines.\n     *\/\n    Memory_pool::Memory_pool (const mempool::Attributes& attr,\n                              mempool::size_t blocks,\n                              mempool::size_t block_size_bytes) :\n        Named_object\n          { attr.name () }, \/\/\n        blocks_ (blocks), \/\/\n        block_size_bytes_ (block_size_bytes)\n\n    {\n      os_assert_throw(!scheduler::in_handler_mode (), EPERM);\n\n      pool_addr_ = (char*) attr.mp_pool_address;\n\n      assert(blocks_ > 0);\n      \/\/ Blocks must be large enough to store the index, used\n      \/\/ to construct the list of free blocks.\n      assert(block_size_bytes_ >= sizeof(std::ptrdiff_t));\n\n      flags_ = 0;\n\n      trace::printf (\"%s() @%p %s %d %d\\n\", __func__, this, name (), blocks_,\n                     block_size_bytes_);\n\n      if (pool_addr_ == nullptr)\n        {\n          pool_addr_ = new (std::nothrow) char[blocks_ * block_size_bytes_];\n          flags_ |= flags_allocated;\n        }\n\n      os_assert_throw(pool_addr_ != nullptr, ENOMEM);\n\n      \/\/ Construct a linked list of blocks. Store the pointer at\n      \/\/ the beginning of each block. Each block\n      \/\/ will hold the address of the next free block, or nullptr at the end.\n      char* p = pool_addr_;\n      for (std::size_t i = 1; i < blocks_; ++i)\n        {\n          *(void**) p = (p + block_size_bytes_);\n          p += block_size_bytes_;\n        }\n      *(void**) p = nullptr;\n\n      first_ = pool_addr_; \/\/ Pointer to first block.\n      last_ = p; \/\/ Pointer to last block.\n\n      count_ = 0; \/\/ No allocated blocks.\n    }\n\n    \/**\n     * @warning Cannot be invoked from Interrupt Service Routines.\n     *\/\n    Memory_pool::~Memory_pool ()\n    {\n      trace::printf (\"%s() @%p %s\\n\", __func__, this, name ());\n\n      if (flags_ | flags_allocated)\n        {\n          delete[] (pool_addr_);\n        }\n    }\n\n    \/*\n     * Internal function used to return the first block in the\n     * free list.\n     *\/\n    void*\n    Memory_pool::try_first (void)\n    {\n      if (first_ != nullptr)\n        {\n          void* p = (void*) first_;\n          first_ = *(void**) first_;\n          ++count_;\n          return p;\n        }\n      return nullptr;\n    }\n\n    \/**\n     * @details\n     * Allocate a fixed size memory block from the memory pool.\n     *\n     * It uses a critical section to protect simultaneous access from\n     * other threads or interrupts.\n     *\n     * @warning Cannot be invoked from Interrupt Service Routines.\n     *\/\n    void*\n    Memory_pool::alloc (void)\n    {\n      os_assert_throw(!scheduler::in_handler_mode (), EPERM);\n\n      trace::printf (\"%s() @%p %s\\n\", __func__, this, name ());\n\n      bool queued = false;\n      for (;;)\n        {\n            {\n              Critical_section_irq cs; \/\/ ----- Critical section -----\n\n              void* p = try_first ();\n              if (p != nullptr)\n                {\n                  return p;\n                }\n\n              if (!queued)\n                {\n                  \/\/ Add this thread to the waiting list.\n                  \/\/ Will be removed by free().\n                  list_.add (&this_thread::thread ());\n                  queued = true;\n                }\n            }\n          this_thread::suspend ();\n\n          if (this_thread::thread ().interrupted ())\n            {\n              return nullptr;\n            }\n        }\n\n      \/* NOTREACHED *\/\n      return nullptr;\n    }\n\n    \/**\n     * @details\n     * Allocate a fixed size memory block from the memory pool.\n     *\n     * It uses a critical section to protect simultaneous access from\n     * other threads or interrupts.\n     *\n     * @note Can be invoked from Interrupt Service Routines.\n     *\/\n    void*\n    Memory_pool::try_alloc (void)\n    {\n      trace::printf (\"%s() @%p %s\\n\", __func__, this, name ());\n\n      return try_first ();\n    }\n\n    \/**\n     * @details\n     * Allocate a fixed size memory block from the memory pool.\n     *\n     * It uses a critical section to protect simultaneous access from\n     * other threads or interrupts.\n     *\n     * @warning Cannot be invoked from Interrupt Service Routines.\n     *\/\n    void*\n    Memory_pool::timed_alloc (systicks_t ticks)\n    {\n      os_assert_throw(!scheduler::in_handler_mode (), EPERM);\n\n      trace::printf (\"%s(%d) @%p %s\\n\", __func__, ticks, this, name ());\n\n      bool queued = false;\n\n      if (ticks == 0)\n        {\n          ticks = 1;\n        }\n\n      Systick_clock::rep start = Systick_clock::now ();\n      for (;;)\n        {\n          Systick_clock::sleep_rep slept_ticks;\n            {\n              Critical_section_irq cs; \/\/ ----- Critical section -----\n\n              void* p = try_first ();\n              if (p != nullptr)\n                {\n                  return p;\n                }\n\n              Systick_clock::rep now = Systick_clock::now ();\n              slept_ticks = (Systick_clock::sleep_rep) (now - start);\n              if (slept_ticks >= ticks)\n                {\n                  if (queued)\n                    {\n                      list_.remove (&this_thread::thread ());\n                    }\n                  return nullptr;\n                }\n\n              if (!queued)\n                {\n                  \/\/ Add this thread to the waiting list.\n                  \/\/ Will be removed by free() or if timeout occurs.\n                  list_.add (&this_thread::thread ());\n                  queued = true;\n                }\n            }\n\n          Systick_clock::sleep_for (ticks - slept_ticks);\n\n          if (this_thread::thread ().interrupted ())\n            {\n              return nullptr;\n            }\n        }\n\n      \/* NOTREACHED *\/\n      return nullptr;\n    }\n\n    \/**\n     * @details\n     * Return a memory block previously allocated by `alloc()` or\n     * `calloc()` back to the memory pool.\n     *\n     * It uses a critical section to protect simultaneous access from\n     * other threads or interrupts.\n     *\n     * @note Can be invoked from Interrupt Service Routines.\n     *\/\n    result_t\n    Memory_pool::free (void* block)\n    {\n      trace::printf (\"%s() @%p %s\\n\", __func__, this, name ());\n\n      \/\/ Validate pointer.\n      if ((block < pool_addr_)\n          || (block >= (pool_addr_ + blocks_ * block_size_bytes_)))\n        {\n          return EINVAL;\n        }\n\n      Critical_section_irq cs; \/\/ ----- Critical section -----\n\n      \/\/ Perform a push_back() on the single linked FIFO list,\n      \/\/ i.e. add the block to the end of the list.\n      if (last_ != nullptr)\n        {\n          \/\/ Link the block after the current last.\n          *(void**) last_ = block;\n        }\n\n      \/\/ Mark block as end of list.\n      *(void**) block = nullptr;\n\n      \/\/ Now this block is the last one.\n      last_ = block;\n\n      \/\/ If the list was empty (all blocks were allocated, so no first),\n      \/\/ this block will be both the first and the last.\n      if (first_ == nullptr)\n        {\n          first_ = block;\n        }\n\n      --count_;\n\n      if (!list_.empty ())\n        {\n          \/\/ Wake-up one thread, if any.\n          list_.top_prio_task ()->wakeup ();\n        }\n\n      return result::ok;\n    }\n\n    \/**\n     * @details\n     * Reset the memory pool to initial state, all block are free.\n     *\n     * @warning Cannot be invoked from Interrupt Service Routines.\n     *\/\n    result_t\n    Memory_pool::reset (void)\n    {\n      os_assert_err(!scheduler::in_handler_mode (), EPERM);\n\n      trace::printf (\"%s() @%p %s\\n\", __func__, this, name ());\n\n      \/\/ TODO\n      return result::ok;\n    }\n\n  \/\/ --------------------------------------------------------------------------\n\n  } \/* namespace rtos *\/\n} \/* namespace os *\/\n<|endoftext|>"}
{"text":"<commit_before>\/\/Contains hooks that control unit movement speed, acceleration, and turn speed.\r\n\r\n#include \"unit_speed.h\"\r\n#include \"..\/SCBW\/enumerations.h\"\r\n#include \"..\/SCBW\/scbwdata.h\"\r\n#include <algorithm>\r\n\r\nnamespace hooks {\r\n\r\n\/\/\/ Calculates the unit's modified movement speed, factoring in upgrades and status effects.\r\n\/\/\/\r\n\/\/\/ @return\t\tThe modified speed value.\r\nu32 getModifiedUnitSpeedHook(const CUnit* unit, u32 baseSpeed) {\r\n\tu32 speed = baseSpeed;\r\n\r\n  if (unit->stimTimer || unit->status & UnitStatus::SpeedUpgrade)\r\n    speed = CLAMP(speed + speed \/ 2, 853u, 2133u);  \/\/ +50% speed; minimum 3.33, maximum 8.33\r\n\r\n  if (unit->ensnareTimer)\r\n    speed -= speed \/ 4; \/\/ -25% speed\r\n\r\n\treturn speed;\r\n}\r\n\r\n\/\/\/ Calculates the unit's acceleration, factoring in upgrades and status effects.\r\n\/\/\/\r\n\/\/\/ @return\t\tThe modified acceleration value.\r\nu32 getModifiedUnitAccelerationHook(const CUnit* unit) {\r\n\t\/\/Default StarCraft behavior\r\n\tu32 acceleration = Flingy::Acceleration[Unit::Graphic[unit->id]];\r\n\tint modifier = (unit->stimTimer ? 1 : 0) - (unit->ensnareTimer ? 1 : 0)\r\n                 + (unit->status & UnitStatus::SpeedUpgrade ? 1 : 0);\r\n\tif (modifier > 0)\r\n\t\tacceleration <<= 1;\r\n\telse if (modifier < 0)\r\n\t\tacceleration -= acceleration >> 2;\r\n\treturn acceleration;\r\n}\r\n\r\n\/\/\/ Calculates the unit's turn speed, factoring in upgrades and status effects.\r\n\/\/\/\r\n\/\/\/ @return\t\tThe modified turning speed value.\r\nu32 getModifiedUnitTurnSpeedHook(const CUnit* unit) {\r\n\tu32 turnSpeed = Flingy::TurnSpeed[Unit::Graphic[unit->id]];\r\n\tint modifier = (unit->stimTimer ? 1 : 0) - (unit->ensnareTimer ? 1 : 0)\r\n                 + (unit->status & UnitStatus::SpeedUpgrade ? 1 : 0);\r\n\tif (modifier > 0)\r\n\t\tturnSpeed <<= 1;\r\n\telse if (modifier < 0)\r\n\t\tturnSpeed -= turnSpeed >> 2;\r\n\r\n  return std::min(turnSpeed, 127u); \/\/To prevent jerky movement bug\r\n}\r\n\r\n} \/\/hooks\r\n<commit_msg>SCT: Fixed bug that caused speed-upgraded Zerglings\/Hydralisks\/Ultralisks to be slower than they should be.<commit_after>\/\/Contains hooks that control unit movement speed, acceleration, and turn speed.\r\n\r\n#include \"unit_speed.h\"\r\n#include \"..\/SCBW\/enumerations.h\"\r\n#include \"..\/SCBW\/scbwdata.h\"\r\n#include <algorithm>\r\n\r\nnamespace hooks {\r\n\r\n\/\/\/ Calculates the unit's modified movement speed, factoring in upgrades and status effects.\r\n\/\/\/\r\n\/\/\/ @return\t\tThe modified speed value.\r\nu32 getModifiedUnitSpeedHook(const CUnit* unit, u32 baseSpeed) {\r\n\tu32 speed = baseSpeed;\r\n\r\n  if (unit->stimTimer || unit->status & UnitStatus::SpeedUpgrade) {\r\n    speed += speed \/ 2; \/\/ +50% speed\r\n    \r\n    \/\/Apply maximum only if flingy is not iscript-controlled; intended to target Vultures and Scouts\r\n    if (Flingy::MovementControl[Unit::Graphic[unit->id]] != 1)\r\n      speed = CLAMP(speed, 853u, 2133u);  \/\/minimum 3.33, maximum 8.33\r\n  }\r\n\r\n  if (unit->ensnareTimer)\r\n    speed -= speed \/ 4; \/\/ -25% speed\r\n\r\n\treturn speed;\r\n}\r\n\r\n\/\/\/ Calculates the unit's acceleration, factoring in upgrades and status effects.\r\n\/\/\/\r\n\/\/\/ @return\t\tThe modified acceleration value.\r\nu32 getModifiedUnitAccelerationHook(const CUnit* unit) {\r\n\t\/\/Default StarCraft behavior\r\n\tu32 acceleration = Flingy::Acceleration[Unit::Graphic[unit->id]];\r\n\tint modifier = (unit->stimTimer ? 1 : 0) - (unit->ensnareTimer ? 1 : 0)\r\n                 + (unit->status & UnitStatus::SpeedUpgrade ? 1 : 0);\r\n\tif (modifier > 0)\r\n\t\tacceleration <<= 1;\r\n\telse if (modifier < 0)\r\n\t\tacceleration -= acceleration >> 2;\r\n\treturn acceleration;\r\n}\r\n\r\n\/\/\/ Calculates the unit's turn speed, factoring in upgrades and status effects.\r\n\/\/\/\r\n\/\/\/ @return\t\tThe modified turning speed value.\r\nu32 getModifiedUnitTurnSpeedHook(const CUnit* unit) {\r\n\tu32 turnSpeed = Flingy::TurnSpeed[Unit::Graphic[unit->id]];\r\n\tint modifier = (unit->stimTimer ? 1 : 0) - (unit->ensnareTimer ? 1 : 0)\r\n                 + (unit->status & UnitStatus::SpeedUpgrade ? 1 : 0);\r\n\tif (modifier > 0)\r\n\t\tturnSpeed <<= 1;\r\n\telse if (modifier < 0)\r\n\t\tturnSpeed -= turnSpeed >> 2;\r\n\r\n  return std::min(turnSpeed, 127u); \/\/To prevent jerky movement bug\r\n}\r\n\r\n} \/\/hooks\r\n<|endoftext|>"}
{"text":"<commit_before>\/\/===-- ProcessLauncherWindows.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\/HostProcess.h\"\n#include \"lldb\/Host\/windows\/ProcessLauncherWindows.h\"\n#include \"lldb\/Target\/ProcessLaunchInfo.h\"\n\n#include <string>\n#include <vector>\n\nusing namespace lldb;\nusing namespace lldb_private;\n\nHostProcess\nProcessLauncherWindows::LaunchProcess(const ProcessLaunchInfo &launch_info, Error &error)\n{\n    error.Clear();\n\n    std::string executable;\n    std::string commandLine;\n    std::vector<char> environment;\n    STARTUPINFO startupinfo = {0};\n    PROCESS_INFORMATION pi = {0};\n\n    HANDLE stdin_handle = GetStdioHandle(launch_info, STDIN_FILENO);\n    HANDLE stdout_handle = GetStdioHandle(launch_info, STDOUT_FILENO);\n    HANDLE stderr_handle = GetStdioHandle(launch_info, STDERR_FILENO);\n\n    startupinfo.cb = sizeof(startupinfo);\n    startupinfo.dwFlags |= STARTF_USESTDHANDLES;\n    startupinfo.hStdError = stderr_handle;\n    startupinfo.hStdInput = stdin_handle;\n    startupinfo.hStdOutput = stdout_handle;\n\n    const char *hide_console_var = getenv(\"LLDB_LAUNCH_INFERIORS_WITHOUT_CONSOLE\");\n    if (hide_console_var && llvm::StringRef(hide_console_var).equals_lower(\"true\"))\n    {\n        startupinfo.dwFlags |= STARTF_USESHOWWINDOW;\n        startupinfo.wShowWindow = SW_HIDE;\n    }\n\n    DWORD flags = CREATE_NEW_CONSOLE;\n    if (launch_info.GetFlags().Test(eLaunchFlagDebug))\n        flags |= DEBUG_ONLY_THIS_PROCESS;\n\n    executable = launch_info.GetExecutableFile().GetPath();\n    launch_info.GetArguments().GetQuotedCommandString(commandLine);\n    BOOL result = ::CreateProcessA(executable.c_str(), const_cast<char *>(commandLine.c_str()), NULL, NULL, TRUE, flags, NULL,\n                                   launch_info.GetWorkingDirectory().GetCString(), &startupinfo, &pi);\n    if (result)\n    {\n        \/\/ Do not call CloseHandle on pi.hProcess, since we want to pass that back through the HostProcess.\n        ::CloseHandle(pi.hThread);\n    }\n\n    if (stdin_handle)\n        ::CloseHandle(stdin_handle);\n    if (stdout_handle)\n        ::CloseHandle(stdout_handle);\n    if (stderr_handle)\n        ::CloseHandle(stderr_handle);\n\n    if (!result)\n        error.SetError(::GetLastError(), eErrorTypeWin32);\n    return HostProcess(pi.hProcess);\n}\n\nHANDLE\nProcessLauncherWindows::GetStdioHandle(const ProcessLaunchInfo &launch_info, int fd)\n{\n    const FileAction *action = launch_info.GetFileActionForFD(fd);\n    if (action == nullptr)\n        return NULL;\n    SECURITY_ATTRIBUTES secattr = {0};\n    secattr.nLength = sizeof(SECURITY_ATTRIBUTES);\n    secattr.bInheritHandle = TRUE;\n\n    const char *path = action->GetPath();\n    DWORD access = 0;\n    DWORD share = FILE_SHARE_READ | FILE_SHARE_WRITE;\n    DWORD create = 0;\n    DWORD flags = 0;\n    if (fd == STDIN_FILENO)\n    {\n        access = GENERIC_READ;\n        create = OPEN_EXISTING;\n        flags = FILE_ATTRIBUTE_READONLY;\n    }\n    if (fd == STDOUT_FILENO || fd == STDERR_FILENO)\n    {\n        access = GENERIC_WRITE;\n        create = CREATE_ALWAYS;\n        if (fd == STDERR_FILENO)\n            flags = FILE_FLAG_WRITE_THROUGH;\n    }\n\n    HANDLE result = ::CreateFile(path, access, share, &secattr, create, flags, NULL);\n    return (result == INVALID_HANDLE_VALUE) ? NULL : result;\n}\n<commit_msg>Fix inferior's i\/o connections to its console window on Windows 7.<commit_after>\/\/===-- ProcessLauncherWindows.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\/HostProcess.h\"\n#include \"lldb\/Host\/windows\/ProcessLauncherWindows.h\"\n#include \"lldb\/Target\/ProcessLaunchInfo.h\"\n\n#include <string>\n#include <vector>\n\nusing namespace lldb;\nusing namespace lldb_private;\n\nHostProcess\nProcessLauncherWindows::LaunchProcess(const ProcessLaunchInfo &launch_info, Error &error)\n{\n    error.Clear();\n\n    std::string executable;\n    std::string commandLine;\n    std::vector<char> environment;\n    STARTUPINFO startupinfo = {0};\n    PROCESS_INFORMATION pi = {0};\n\n    HANDLE stdin_handle = GetStdioHandle(launch_info, STDIN_FILENO);\n    HANDLE stdout_handle = GetStdioHandle(launch_info, STDOUT_FILENO);\n    HANDLE stderr_handle = GetStdioHandle(launch_info, STDERR_FILENO);\n\n    startupinfo.cb = sizeof(startupinfo);\n    startupinfo.dwFlags |= STARTF_USESTDHANDLES;\n    startupinfo.hStdError  = stderr_handle ? stderr_handle : ::GetStdHandle(STD_ERROR_HANDLE);\n    startupinfo.hStdInput  = stdin_handle  ? stdin_handle  : ::GetStdHandle(STD_INPUT_HANDLE);\n    startupinfo.hStdOutput = stdout_handle ? stdout_handle : ::GetStdHandle(STD_OUTPUT_HANDLE);\n\n    const char *hide_console_var = getenv(\"LLDB_LAUNCH_INFERIORS_WITHOUT_CONSOLE\");\n    if (hide_console_var && llvm::StringRef(hide_console_var).equals_lower(\"true\"))\n    {\n        startupinfo.dwFlags |= STARTF_USESHOWWINDOW;\n        startupinfo.wShowWindow = SW_HIDE;\n    }\n\n    DWORD flags = CREATE_NEW_CONSOLE;\n    if (launch_info.GetFlags().Test(eLaunchFlagDebug))\n        flags |= DEBUG_ONLY_THIS_PROCESS;\n\n    executable = launch_info.GetExecutableFile().GetPath();\n    launch_info.GetArguments().GetQuotedCommandString(commandLine);\n    BOOL result = ::CreateProcessA(executable.c_str(), const_cast<char *>(commandLine.c_str()), NULL, NULL, TRUE, flags, NULL,\n                                   launch_info.GetWorkingDirectory().GetCString(), &startupinfo, &pi);\n    if (result)\n    {\n        \/\/ Do not call CloseHandle on pi.hProcess, since we want to pass that back through the HostProcess.\n        ::CloseHandle(pi.hThread);\n    }\n\n    if (stdin_handle)\n        ::CloseHandle(stdin_handle);\n    if (stdout_handle)\n        ::CloseHandle(stdout_handle);\n    if (stderr_handle)\n        ::CloseHandle(stderr_handle);\n\n    if (!result)\n        error.SetError(::GetLastError(), eErrorTypeWin32);\n    return HostProcess(pi.hProcess);\n}\n\nHANDLE\nProcessLauncherWindows::GetStdioHandle(const ProcessLaunchInfo &launch_info, int fd)\n{\n    const FileAction *action = launch_info.GetFileActionForFD(fd);\n    if (action == nullptr)\n        return NULL;\n    SECURITY_ATTRIBUTES secattr = {0};\n    secattr.nLength = sizeof(SECURITY_ATTRIBUTES);\n    secattr.bInheritHandle = TRUE;\n\n    const char *path = action->GetPath();\n    DWORD access = 0;\n    DWORD share = FILE_SHARE_READ | FILE_SHARE_WRITE;\n    DWORD create = 0;\n    DWORD flags = 0;\n    if (fd == STDIN_FILENO)\n    {\n        access = GENERIC_READ;\n        create = OPEN_EXISTING;\n        flags = FILE_ATTRIBUTE_READONLY;\n    }\n    if (fd == STDOUT_FILENO || fd == STDERR_FILENO)\n    {\n        access = GENERIC_WRITE;\n        create = CREATE_ALWAYS;\n        if (fd == STDERR_FILENO)\n            flags = FILE_FLAG_WRITE_THROUGH;\n    }\n\n    HANDLE result = ::CreateFile(path, access, share, &secattr, create, flags, NULL);\n    return (result == INVALID_HANDLE_VALUE) ? NULL : result;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\nAllocore Example: MIDI In App\n\nDescription:\nThe example demonstrates how to open a MIDI input port and parse some of the\nmore common channel messages.\n\nAuthor:\nLance Putnam, 9\/2013\n*\/\n\n#include <stdio.h>\n#include \"allocore\/io\/al_App.hpp\"\n#include \"allocore\/io\/al_MIDI.hpp\"\nusing namespace al;\n\nclass MyApp : public App, public MIDIMessageHandler{\npublic:\n\n\tMIDIIn midiIn;\n\n\tMyApp(){\n\t\t\/\/ Check for connected MIDI devices\n\t\tif(midiIn.getPortCount() > 0){\n\n\t\t\t\/\/ Bind ourself to the MIDIIn\n\t\t\tMIDIMessageHandler::bindTo(midiIn);\n\n\t\t\t\/\/ Open the first device found\n\t\t\tmidiIn.openPort(0);\n\t\t\tprintf(\"Opened port to %s\\n\", midiIn.getPortName(0).c_str());\n\t\t}\n\t\telse{\n\t\t\tprintf(\"Error: No MIDI devices found.\\n\");\n\t\t}\n\t}\n\n\t\/\/ This gets called whenever a MIDI message is received on the port\n\tvoid onMIDIMessage(const MIDIMessage& m){\n\n\t\tprintf(\"%s: \", MIDIByte::messageTypeString(m.status()));\n\n\t\t\/\/ Here we demonstrate how to parse common channel messages\n\t\tswitch(m.type()){\n\t\tcase MIDIByte::NOTE_ON:\n\t\t\tprintf(\"Note %u, Vel %f\", m.noteNumber(), m.velocity());\n\t\t\tbreak;\n\n\t\tcase MIDIByte::NOTE_OFF:\n\t\t\tprintf(\"Note %u, Vel %f\", m.noteNumber(), m.velocity());\n\t\t\tbreak;\n\n\t\tcase MIDIByte::PITCH_BEND:\n\t\t\tprintf(\"Value %f\", m.pitchBend());\n\t\t\tbreak;\n\n\t\t\/\/ Control messages need to be parsed again...\n\t\tcase MIDIByte::CONTROL_CHANGE:\n\t\t\tprintf(\"%s \", MIDIByte::controlNumberString(m.controlNumber()));\n\t\t\tswitch(m.controlNumber()){\n\t\t\tcase MIDIByte::MODULATION:\n\t\t\t\tprintf(\"%f\", m.controlValue());\n\t\t\t\tbreak;\n\n\t\t\tcase MIDIByte::EXPRESSION:\n\t\t\t\tprintf(\"%f\", m.controlValue());\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tbreak;\n\t\tdefault:;\n\t\t}\n\n\t\t\/\/ If it's a channel message, print out channel number\n\t\tif(m.isChannelMessage()){\n\t\t\tprintf(\" (MIDI chan %u)\", m.channel() + 1);\n\t\t}\n\n\t\tprintf(\"\\n\");\n\n\t\t\/\/ Print the raw byte values and time stamp\n\t\tprintf(\"\\tBytes = \");\n\t\tfor(unsigned i=0; i<3; ++i){\n\t\t\tprintf(\"%3u \", (int)m.bytes[i]);\n\t\t}\n\t\tprintf(\", time = %g\\n\", m.timeStamp());\n\t}\n};\n\n\nint main(){\n\tMyApp().start();\n}\n<commit_msg>open last MIDI port by default<commit_after>\/*\nAllocore Example: MIDI In App\n\nDescription:\nThe example demonstrates how to open a MIDI input port and parse some of the\nmore common channel messages.\n\nAuthor:\nLance Putnam, 9\/2013\n*\/\n\n#include <stdio.h>\n#include \"allocore\/io\/al_App.hpp\"\n#include \"allocore\/io\/al_MIDI.hpp\"\nusing namespace al;\n\nclass MyApp : public App, public MIDIMessageHandler{\npublic:\n\n\tMIDIIn midiIn;\n\n\tMyApp(){\n\t\t\/\/ Check for connected MIDI devices\n\t\tif(midiIn.getPortCount() > 0){\n\n\t\t\t\/\/ Bind ourself to the MIDIIn\n\t\t\tMIDIMessageHandler::bindTo(midiIn);\n\n\t\t\t\/\/ Open the last device found\n\t\t\tint port = midiIn.getPortCount()-1;\n\t\t\tmidiIn.openPort(port);\n\t\t\tprintf(\"Opened port to %s\\n\", midiIn.getPortName(port).c_str());\n\t\t}\n\t\telse{\n\t\t\tprintf(\"Error: No MIDI devices found.\\n\");\n\t\t}\n\t}\n\n\t\/\/ This gets called whenever a MIDI message is received on the port\n\tvoid onMIDIMessage(const MIDIMessage& m){\n\n\t\tprintf(\"%s: \", MIDIByte::messageTypeString(m.status()));\n\n\t\t\/\/ Here we demonstrate how to parse common channel messages\n\t\tswitch(m.type()){\n\t\tcase MIDIByte::NOTE_ON:\n\t\t\tprintf(\"Note %u, Vel %f\", m.noteNumber(), m.velocity());\n\t\t\tbreak;\n\n\t\tcase MIDIByte::NOTE_OFF:\n\t\t\tprintf(\"Note %u, Vel %f\", m.noteNumber(), m.velocity());\n\t\t\tbreak;\n\n\t\tcase MIDIByte::PITCH_BEND:\n\t\t\tprintf(\"Value %f\", m.pitchBend());\n\t\t\tbreak;\n\n\t\t\/\/ Control messages need to be parsed again...\n\t\tcase MIDIByte::CONTROL_CHANGE:\n\t\t\tprintf(\"%s \", MIDIByte::controlNumberString(m.controlNumber()));\n\t\t\tswitch(m.controlNumber()){\n\t\t\tcase MIDIByte::MODULATION:\n\t\t\t\tprintf(\"%f\", m.controlValue());\n\t\t\t\tbreak;\n\n\t\t\tcase MIDIByte::EXPRESSION:\n\t\t\t\tprintf(\"%f\", m.controlValue());\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tbreak;\n\t\tdefault:;\n\t\t}\n\n\t\t\/\/ If it's a channel message, print out channel number\n\t\tif(m.isChannelMessage()){\n\t\t\tprintf(\" (MIDI chan %u)\", m.channel() + 1);\n\t\t}\n\n\t\tprintf(\"\\n\");\n\n\t\t\/\/ Print the raw byte values and time stamp\n\t\tprintf(\"\\tBytes = \");\n\t\tfor(unsigned i=0; i<3; ++i){\n\t\t\tprintf(\"%3u \", (int)m.bytes[i]);\n\t\t}\n\t\tprintf(\", time = %g\\n\", m.timeStamp());\n\t}\n};\n\n\nint main(){\n\tMyApp().start();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"genetic.h\"\n\n#include <string>\n#include <sstream>\n#include <iostream>\n#include <utility>    \/\/ std::map\n#include <algorithm>  \/\/ std::max\n#include <random>     \/\/ std::mt19937\n\n#include <vector>\n#include <algorithm>\n\n#include <cstdio>\n#include <cstdlib>\n#include <ctime>  \/\/ std::time\n\n#include \"gate.h\"\n#include \"genetic_circuit.h\"\n#include \"utility.h\"\n\nGenetic::Genetic(int n, BooleanTable outputs, int population_size)\n    : input_no(n),\n      expected_outputs(outputs),\n      rand_engine(std::random_device{}()) {\n  population = spawnPopulation(population_size);\n}\n\nGenetic::Genetic(int n, BooleanTable outputs,\n                 std::map<std::size_t, GeneticCircuit> pop)\n    : population(pop),\n      input_no(n),\n      expected_outputs(outputs),\n      rand_engine(std::random_device{}()) {}\n\nstd::pair<std::vector<Gate *>, std::vector<Gate *>> Genetic::split(\n    GeneticCircuit circuit, int split_index) {\n  \/\/ split gates\n\n  std::vector<Gate *> a = circuit.getGates();\n  std::vector<Gate *> lhs_gates(a.begin(), a.begin() + split_index);\n  std::vector<Gate *> rhs_gates(a.begin() + split_index, a.end());\n\n  \/\/ split circuit and c2 into a and b at dist(rand_engine)\n  return std::pair<std::vector<Gate *>, std::vector<Gate *>>(lhs_gates,\n                                                             rhs_gates);\n}\n\nGeneticCircuit Genetic::splice(std::vector<Gate *> base_part,\n                               std::vector<Gate *> appended_part) {\n  std::vector<Gate *> combined_gates = base_part;\n  std::vector<Gate *> a = appended_part;\n\n  combined_gates.insert(std::end(combined_gates), std::begin(a), std::end(a));\n\n  GeneticCircuit new_circuit(input_no, expected_outputs.front().size(),\n                             &rand_engine, combined_gates);\n  return new_circuit;\n}\n\nstd::pair<GeneticCircuit, GeneticCircuit> Genetic::splitAndSplice(\n    GeneticCircuit c_1, GeneticCircuit c_2) {\n  std::pair<GeneticCircuit, GeneticCircuit> swapped_circuits(c_1, c_2);\n\n  errlog(\"Started s&s\", true);\n  \/\/ Generate random index to split at\n  std::uniform_int_distribution<> dist{\n      input_no, (std::min(c_1.getGateCount(), c_2.getGateCount())) - 1};\n\n  int split_index = dist(rand_engine);\n\n  if (c_1.getGateCount() <= input_no || c_2.getGateCount() <= input_no) {\n    split_index = input_no;\n  }\n\n  std::pair<std::vector<Gate *>, std::vector<Gate *>> c_1_halves =\n      split(c_1, split_index);\n  std::pair<std::vector<Gate *>, std::vector<Gate *>> c_2_halves =\n      split(c_2, split_index);\n\n  swapped_circuits.first = splice(c_1_halves.first, c_2_halves.second);\n  swapped_circuits.second = splice(c_2_halves.first, c_1_halves.second);\n\n  return swapped_circuits;\n}\n\n\/* void GeneticCircuit::insertIntoPopulation(GeneticCircuit c){ *\/\n\/*   c.setFitness(generateFitness(c)); *\/\n\/*   std::pair<std::size_t, GeneticCircuit> zergling(c.hash_circ(), c); *\/\n\/*   population.insert(zergling); *\/\n\/* } *\/\n\nstd::map<std::size_t, GeneticCircuit> Genetic::spawnPopulation(\n    std::size_t populationSize) {\n  std::map<std::size_t, GeneticCircuit> spawned_pop;\n  while (spawned_pop.size() < populationSize) {\n    GeneticCircuit c(input_no, expected_outputs.front().size(), &rand_engine);\n    c.setFitness(generateFitness(c));\n\n    if (SHOW_POPULATION_LOG) {\n      std::string errmsg =\n          \"Genetic::spawnPopulation inserting Circuit \"\n          \"fitness: \" +\n          std::to_string(c.getFitness());\n      errlog(errmsg);\n    }\n\n    std::pair<std::size_t, GeneticCircuit> zergling(c.hash_circ(), c);\n    spawned_pop.insert(zergling);\n\n    if (SHOW_POPULATION_LOG) {\n      std::ostringstream errstream;\n      errstream << \"Genetic::spawnPopulation --  \" << spawned_pop.size();\n      errlog(errstream.str(), SHOW_POPULATION_LOG);\n    }\n  }\n  return spawned_pop;\n}\n\nvoid Genetic::cullHerd() {\n  int avg = 0;\n  double total = 0.0;\n  std::map<std::size_t, GeneticCircuit>::iterator it;\n  for (it = population.begin(); it != population.end(); ++it) {\n    int fit = generateFitness((*it).second);\n    total += fit;\n    avg = total \/ population.size();\n  }\n  it = population.begin();\n  while (it != population.end()) {\n    if (generateFitness((*it).second) > avg) {\n      population.erase(it++);\n    } else {\n      ++it;\n    }\n  }\n\n  errlog(\"I should be done\", true);\n  std::string errmsg =\n      \"Deleted stuff. Population is now: \" + std::to_string(population.size());\n  errlog(errmsg, true);\n  errlog(\"I should be done\", true);\n}\n\nGeneticCircuit Genetic::evolve(){\n  while(!correct_found){\n    cullHerd();\n    std::vector<GeneticCircuit *> breedable;\n    std::map<std::size_t, GeneticCircuit>::iterator it;\n    for (it = population.begin(); it != population.end(); ++it) {\n      breedable.push_back(&(it->second));\n    }\n    errlog(\"not yet\", true);\n\n    for (std::size_t i = 0; i < breedable.size() - 2; i += 2) {\n      errlog(\"Ran..\", true);\n      std::pair<GeneticCircuit, GeneticCircuit> twins =\n          splitAndSplice(*breedable[i], *breedable[i + 1]);\n      twins.first.setFitness(generateFitness(twins.first));\n      population.insert(std::pair<std::size_t, GeneticCircuit>(\n          twins.first.hash_circ(), twins.first));\n      twins.second.setFitness(generateFitness(twins.second));\n      population.insert(std::pair<std::size_t, GeneticCircuit>(\n          twins.second.hash_circ(), twins.second));\n    }\n    errlog(\"Done\", true);\n  }\n\n  return population.at(hashExpectedOutput());\n}\n\nint Genetic::generateFitness(GeneticCircuit c) {\n  int score = 0;\n  BooleanTable actual_output = c.evaluateAllInputs();\n  for (std::size_t i = 0; i < actual_output.size(); ++i) {\n    if (actual_output[i] != expected_outputs[i]) {\n      score += 10000;\n    }\n  }\n  score += c.getNotCount() * 1000;\n  score += (c.getOrCount() + c.getAndCount()) * 10;\n  if (score < 10000) {\n    correct_found = true;\n  }\n  return score;\n}\n\nsize_t Genetic::hashExpectedOutput(){\n  std::string s = \"\";\n  std::hash<std::string> hash_fn;\n  for (std::vector<bool> row : expected_outputs) {\n    for (bool bit : row) {\n      s += std::to_string((int)bit);\n    }\n  }\n  std::size_t hash = hash_fn(s);\n  return hash;\n}\n\n<commit_msg>cullHerd doesnt ever delete more than half<commit_after>#include \"genetic.h\"\n\n#include <string>\n#include <sstream>\n#include <iostream>\n#include <utility>    \/\/ std::map\n#include <algorithm>  \/\/ std::max\n#include <random>     \/\/ std::mt19937\n\n#include <vector>\n#include <algorithm>\n\n#include <cstdio>\n#include <cstdlib>\n#include <ctime>  \/\/ std::time\n\n#include \"gate.h\"\n#include \"genetic_circuit.h\"\n#include \"utility.h\"\n\nGenetic::Genetic(int n, BooleanTable outputs, int population_size)\n    : input_no(n),\n      expected_outputs(outputs),\n      rand_engine(std::random_device{}()) {\n  population = spawnPopulation(population_size);\n}\n\nGenetic::Genetic(int n, BooleanTable outputs,\n                 std::map<std::size_t, GeneticCircuit> pop)\n    : population(pop),\n      input_no(n),\n      expected_outputs(outputs),\n      rand_engine(std::random_device{}()) {}\n\nstd::pair<std::vector<Gate *>, std::vector<Gate *>> Genetic::split(\n    GeneticCircuit circuit, int split_index) {\n  \/\/ split gates\n\n  std::vector<Gate *> a = circuit.getGates();\n  std::vector<Gate *> lhs_gates(a.begin(), a.begin() + split_index);\n  std::vector<Gate *> rhs_gates(a.begin() + split_index, a.end());\n\n  \/\/ split circuit and c2 into a and b at dist(rand_engine)\n  return std::pair<std::vector<Gate *>, std::vector<Gate *>>(lhs_gates,\n                                                             rhs_gates);\n}\n\nGeneticCircuit Genetic::splice(std::vector<Gate *> base_part,\n                               std::vector<Gate *> appended_part) {\n  std::vector<Gate *> combined_gates = base_part;\n  std::vector<Gate *> a = appended_part;\n\n  combined_gates.insert(std::end(combined_gates), std::begin(a), std::end(a));\n\n  GeneticCircuit new_circuit(input_no, expected_outputs.front().size(),\n                             &rand_engine, combined_gates);\n  return new_circuit;\n}\n\nstd::pair<GeneticCircuit, GeneticCircuit> Genetic::splitAndSplice(\n    GeneticCircuit c_1, GeneticCircuit c_2) {\n  std::pair<GeneticCircuit, GeneticCircuit> swapped_circuits(c_1, c_2);\n\n  errlog(\"Started s&s\", true);\n  \/\/ Generate random index to split at\n  std::uniform_int_distribution<> dist{\n      input_no, (std::min(c_1.getGateCount(), c_2.getGateCount())) - 1};\n\n  int split_index = dist(rand_engine);\n\n  if (c_1.getGateCount() <= input_no || c_2.getGateCount() <= input_no) {\n    split_index = input_no;\n  }\n\n  std::pair<std::vector<Gate *>, std::vector<Gate *>> c_1_halves =\n      split(c_1, split_index);\n  std::pair<std::vector<Gate *>, std::vector<Gate *>> c_2_halves =\n      split(c_2, split_index);\n\n  swapped_circuits.first = splice(c_1_halves.first, c_2_halves.second);\n  swapped_circuits.second = splice(c_2_halves.first, c_1_halves.second);\n\n  return swapped_circuits;\n}\n\n\/* void GeneticCircuit::insertIntoPopulation(GeneticCircuit c){ *\/\n\/*   c.setFitness(generateFitness(c)); *\/\n\/*   std::pair<std::size_t, GeneticCircuit> zergling(c.hash_circ(), c); *\/\n\/*   population.insert(zergling); *\/\n\/* } *\/\n\nstd::map<std::size_t, GeneticCircuit> Genetic::spawnPopulation(\n    std::size_t populationSize) {\n  std::map<std::size_t, GeneticCircuit> spawned_pop;\n  while (spawned_pop.size() < populationSize) {\n    GeneticCircuit c(input_no, expected_outputs.front().size(), &rand_engine);\n    c.setFitness(generateFitness(c));\n\n    if (SHOW_POPULATION_LOG) {\n      std::string errmsg =\n          \"Genetic::spawnPopulation inserting Circuit \"\n          \"fitness: \" +\n          std::to_string(c.getFitness());\n      errlog(errmsg);\n    }\n\n    std::pair<std::size_t, GeneticCircuit> zergling(c.hash_circ(), c);\n    spawned_pop.insert(zergling);\n\n    if (SHOW_POPULATION_LOG) {\n      std::ostringstream errstream;\n      errstream << \"Genetic::spawnPopulation --  \" << spawned_pop.size();\n      errlog(errstream.str(), SHOW_POPULATION_LOG);\n    }\n  }\n  return spawned_pop;\n}\n\nvoid Genetic::cullHerd() {\n  int initial_size = population.size();\n  int avg = 0;\n  double total = 0.0;\n  std::map<std::size_t, GeneticCircuit>::iterator it;\n  for (it = population.begin(); it != population.end(); ++it) {\n    int fit = generateFitness((*it).second);\n    total += fit;\n    avg = total \/ population.size();\n  }\n  it = population.begin();\n  \/\/keep going until either deletes most or half\n  while (it != population.end() || population.size() < (initial_size \/2)) {\n    if (generateFitness((*it).second) > avg) {\n      population.erase(it++);\n    } else {\n      ++it;\n    }\n  }\n\n  errlog(\"I should be done\", true);\n  std::string errmsg =\n      \"Deleted stuff. Population is now: \" + std::to_string(population.size());\n  errlog(errmsg, true);\n  errlog(\"I should be done\", true);\n}\n\nGeneticCircuit Genetic::evolve(){\n  while(!correct_found){\n    cullHerd();\n    std::vector<GeneticCircuit *> breedable;\n    std::map<std::size_t, GeneticCircuit>::iterator it;\n    for (it = population.begin(); it != population.end(); ++it) {\n      breedable.push_back(&(it->second));\n    }\n    errlog(\"not yet\", true);\n\n    for (std::size_t i = 0; i < breedable.size() - 2; i += 2) {\n      errlog(\"Ran..\", true);\n      std::pair<GeneticCircuit, GeneticCircuit> twins =\n          splitAndSplice(*breedable[i], *breedable[i + 1]);\n      twins.first.setFitness(generateFitness(twins.first));\n      population.insert(std::pair<std::size_t, GeneticCircuit>(\n          twins.first.hash_circ(), twins.first));\n      twins.second.setFitness(generateFitness(twins.second));\n      population.insert(std::pair<std::size_t, GeneticCircuit>(\n          twins.second.hash_circ(), twins.second));\n    }\n    errlog(\"Done\", true);\n  }\n\n  return population.at(hashExpectedOutput());\n}\n\nint Genetic::generateFitness(GeneticCircuit c) {\n  int score = 0;\n  BooleanTable actual_output = c.evaluateAllInputs();\n  for (std::size_t i = 0; i < actual_output.size(); ++i) {\n    if (actual_output[i] != expected_outputs[i]) {\n      score += 10000;\n    }\n  }\n  score += c.getNotCount() * 1000;\n  score += (c.getOrCount() + c.getAndCount()) * 10;\n  if (score < 10000) {\n    correct_found = true;\n  }\n  return score;\n}\n\nsize_t Genetic::hashExpectedOutput(){\n  std::string s = \"\";\n  std::hash<std::string> hash_fn;\n  for (std::vector<bool> row : expected_outputs) {\n    for (bool bit : row) {\n      s += std::to_string((int)bit);\n    }\n  }\n  std::size_t hash = hash_fn(s);\n  return hash;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/**\n *  For conditions of distribution and use, see copyright notice in license.txt\n *\n *  @file   InputMapper.h\n *  @brief  Registers an InputContext from the Naali Input subsystem and uses it to translate\n *          given set of keys to Entity Actions on the entity the component is part of.\n *\/\n\n#include \"StableHeaders.h\"\n#include \"EC_InputMapper.h\"\n\n#include \"AttributeInterface.h\"\n#include \"InputServiceInterface.h\"\n#include \"Entity.h\"\n\n#include \"LoggingFunctions.h\"\n\nDEFINE_POCO_LOGGING_FUNCTIONS(\"EC_InputMapper\")\n\nEC_InputMapper::~EC_InputMapper()\n{\n    input_.reset();\n}\n\nvoid EC_InputMapper::RegisterMapping(const QKeySequence &keySeq, const QString &action)\n{\n    mappings_[keySeq] = action;\n}\n\nEC_InputMapper::EC_InputMapper(Foundation::ModuleInterface *module):\n    Foundation::ComponentInterface(module->GetFramework()),\n    contextName(this, \"Input context name\", \"EC_InputMapper\"),\n    contextPriority(this, \"Input context priority\", 90),\n    takeKeyboardEventsOverQt(this, \"Take keyboard events over Qt\", false),\n    takeMouseEventsOverQt(this, \"Take mouse events over Qt\", false),\n    mappings(this, \"Mappings\")\n{\n    connect(this, SIGNAL(OnAttributeChanged(AttributeInterface *, AttributeChange::Type)),\n        SLOT(AttributeUpdated(AttributeInterface *, AttributeChange::Type)));\n\n    input_ = GetFramework()->Input().RegisterInputContext(contextName.Get().toStdString().c_str(), contextPriority.Get());\n    input_->SetTakeKeyboardEventsOverQt(takeKeyboardEventsOverQt.Get());\n    input_->SetTakeMouseEventsOverQt(takeMouseEventsOverQt.Get());\n    connect(input_.get(), SIGNAL(OnKeyEvent(KeyEvent *)), SLOT(HandleKeyEvent(KeyEvent *)));\n    connect(input_.get(), SIGNAL(OnMouseEvent(MouseEvent *)), SLOT(HandleMouseEvent(MouseEvent *)));\n\n    RegisterMapping(Qt::Key_I, \"Move(Forward)\");\n    RegisterMapping(Qt::Key_K, \"Move(Backward)\");\n    RegisterMapping(Qt::Key_J, \"Move(Left)\");\n    RegisterMapping(Qt::Key_L, \"Move(Right)\");\n    RegisterMapping(Qt::Key_U, \"Rotate(Left)\");\n    RegisterMapping(Qt::Key_O, \"Rotate(Right)\");\n}\n\nvoid EC_InputMapper::AttributeUpdated(AttributeInterface *attribute, AttributeChange::Type change)\n{\n    const std::string &name = attribute->GetNameString();\n    if(name == contextName.GetNameString() || name == contextPriority.GetNameString())\n    {\n        input_.reset();\n        input_ = GetFramework()->Input().RegisterInputContext(contextName.Get().toStdString().c_str(), contextPriority.Get());\n        connect(input_.get(), SIGNAL(OnKeyEvent(KeyEvent *)), SLOT(HandleKeyEvent(KeyEvent *)));\n        connect(input_.get(), SIGNAL(OnMouseEvent(MouseEvent *)), SLOT(HandleMouseEvent(MouseEvent *)));\n    }\n    else if(name == takeKeyboardEventsOverQt.GetNameString())\n    {\n        input_->SetTakeKeyboardEventsOverQt(takeKeyboardEventsOverQt.Get());\n    }\n    else if(name == takeMouseEventsOverQt.GetNameString())\n    {\n        input_->SetTakeMouseEventsOverQt(takeMouseEventsOverQt.Get());\n    }\n    else if(name == mappings.GetNameString())\n    {\n    }\n}\n\nvoid EC_InputMapper::HandleKeyEvent(KeyEvent *e)\n{\n    Mappings_t::iterator it = mappings_.find(QKeySequence(e->keyCode | e->modifiers));\n    if (it == mappings_.end())\n        return;\n\n    Scene::Entity *entity = GetParentEntity();\n    if (!entity)\n    {\n        LogWarning(\"Parent entity not set. Cannot execute action.\");\n        return;\n    }\n\n    QString &action = it.value();\n\/\/    LogDebug(\"Invoking action \" + action.toStdString() + \" for entity \" + ToString(entity->GetId()));\n\n    \/\/ If the action has parameters, parse them from the action string.\n    int idx = action.indexOf('(');\n    if (idx != -1)\n    {\n        QString act = action.left(idx);\n        QString parsedAction = action.mid(idx + 1);\n        parsedAction.remove('(');\n        parsedAction.remove(')');\n        QStringVector parameters = parsedAction.split(',').toVector();\n        entity->Exec(act, parameters);\n    }\n    else\n        entity->Exec(action);\n}\n\nvoid EC_InputMapper::HandleMouseEvent(MouseEvent *e)\n{\n    if (!GetParentEntity())\n        return;\n\n    if (e->IsButtonDown(MouseEvent::MiddleButton))\n    {\n        std::cout << e->relativeX << \" \" << e->relativeY << \" \" << e->relativeZ << std::endl;\n        if (e->relativeX > 0 && abs(e->relativeX) >= 1)\n        {\n            GetParentEntity()->Exec(\"Move\" ,\"Right\");\n        }\n        if (e->relativeX < 0 && abs(e->relativeX) >= 1)\n        {\n            GetParentEntity()->Exec(\"Move\", \"Left\");\n        }\n        if (e->relativeY > 0 && abs(e->relativeY) >= 1)\n        {\n            GetParentEntity()->Exec(\"Move\" ,\"Backward\");\n        }\n        if (e->relativeY < 0 && abs(e->relativeY) >= 1)\n        {\n            GetParentEntity()->Exec(\"Move\", \"Forward\");\n        }\n    }\n}\n<commit_msg>Remove debug print.<commit_after>\/**\n *  For conditions of distribution and use, see copyright notice in license.txt\n *\n *  @file   InputMapper.h\n *  @brief  Registers an InputContext from the Naali Input subsystem and uses it to translate\n *          given set of keys to Entity Actions on the entity the component is part of.\n *\/\n\n#include \"StableHeaders.h\"\n#include \"EC_InputMapper.h\"\n\n#include \"AttributeInterface.h\"\n#include \"InputServiceInterface.h\"\n#include \"Entity.h\"\n\n#include \"LoggingFunctions.h\"\n\nDEFINE_POCO_LOGGING_FUNCTIONS(\"EC_InputMapper\")\n\nEC_InputMapper::~EC_InputMapper()\n{\n    input_.reset();\n}\n\nvoid EC_InputMapper::RegisterMapping(const QKeySequence &keySeq, const QString &action)\n{\n    mappings_[keySeq] = action;\n}\n\nEC_InputMapper::EC_InputMapper(Foundation::ModuleInterface *module):\n    Foundation::ComponentInterface(module->GetFramework()),\n    contextName(this, \"Input context name\", \"EC_InputMapper\"),\n    contextPriority(this, \"Input context priority\", 90),\n    takeKeyboardEventsOverQt(this, \"Take keyboard events over Qt\", false),\n    takeMouseEventsOverQt(this, \"Take mouse events over Qt\", false),\n    mappings(this, \"Mappings\")\n{\n    connect(this, SIGNAL(OnAttributeChanged(AttributeInterface *, AttributeChange::Type)),\n        SLOT(AttributeUpdated(AttributeInterface *, AttributeChange::Type)));\n\n    input_ = GetFramework()->Input().RegisterInputContext(contextName.Get().toStdString().c_str(), contextPriority.Get());\n    input_->SetTakeKeyboardEventsOverQt(takeKeyboardEventsOverQt.Get());\n    input_->SetTakeMouseEventsOverQt(takeMouseEventsOverQt.Get());\n    connect(input_.get(), SIGNAL(OnKeyEvent(KeyEvent *)), SLOT(HandleKeyEvent(KeyEvent *)));\n    connect(input_.get(), SIGNAL(OnMouseEvent(MouseEvent *)), SLOT(HandleMouseEvent(MouseEvent *)));\n\n    RegisterMapping(Qt::Key_I, \"Move(Forward)\");\n    RegisterMapping(Qt::Key_K, \"Move(Backward)\");\n    RegisterMapping(Qt::Key_J, \"Move(Left)\");\n    RegisterMapping(Qt::Key_L, \"Move(Right)\");\n    RegisterMapping(Qt::Key_U, \"Rotate(Left)\");\n    RegisterMapping(Qt::Key_O, \"Rotate(Right)\");\n}\n\nvoid EC_InputMapper::AttributeUpdated(AttributeInterface *attribute, AttributeChange::Type change)\n{\n    const std::string &name = attribute->GetNameString();\n    if(name == contextName.GetNameString() || name == contextPriority.GetNameString())\n    {\n        input_.reset();\n        input_ = GetFramework()->Input().RegisterInputContext(contextName.Get().toStdString().c_str(), contextPriority.Get());\n        connect(input_.get(), SIGNAL(OnKeyEvent(KeyEvent *)), SLOT(HandleKeyEvent(KeyEvent *)));\n        connect(input_.get(), SIGNAL(OnMouseEvent(MouseEvent *)), SLOT(HandleMouseEvent(MouseEvent *)));\n    }\n    else if(name == takeKeyboardEventsOverQt.GetNameString())\n    {\n        input_->SetTakeKeyboardEventsOverQt(takeKeyboardEventsOverQt.Get());\n    }\n    else if(name == takeMouseEventsOverQt.GetNameString())\n    {\n        input_->SetTakeMouseEventsOverQt(takeMouseEventsOverQt.Get());\n    }\n    else if(name == mappings.GetNameString())\n    {\n    }\n}\n\nvoid EC_InputMapper::HandleKeyEvent(KeyEvent *e)\n{\n    Mappings_t::iterator it = mappings_.find(QKeySequence(e->keyCode | e->modifiers));\n    if (it == mappings_.end())\n        return;\n\n    Scene::Entity *entity = GetParentEntity();\n    if (!entity)\n    {\n        LogWarning(\"Parent entity not set. Cannot execute action.\");\n        return;\n    }\n\n    QString &action = it.value();\n\/\/    LogDebug(\"Invoking action \" + action.toStdString() + \" for entity \" + ToString(entity->GetId()));\n\n    \/\/ If the action has parameters, parse them from the action string.\n    int idx = action.indexOf('(');\n    if (idx != -1)\n    {\n        QString act = action.left(idx);\n        QString parsedAction = action.mid(idx + 1);\n        parsedAction.remove('(');\n        parsedAction.remove(')');\n        QStringVector parameters = parsedAction.split(',').toVector();\n        entity->Exec(act, parameters);\n    }\n    else\n        entity->Exec(action);\n}\n\nvoid EC_InputMapper::HandleMouseEvent(MouseEvent *e)\n{\n    if (!GetParentEntity())\n        return;\n\n    if (e->IsButtonDown(MouseEvent::MiddleButton))\n    {\n        if (e->relativeX > 0 && abs(e->relativeX) >= 1)\n        {\n            GetParentEntity()->Exec(\"Move\" ,\"Right\");\n        }\n        if (e->relativeX < 0 && abs(e->relativeX) >= 1)\n        {\n            GetParentEntity()->Exec(\"Move\", \"Left\");\n        }\n        if (e->relativeY > 0 && abs(e->relativeY) >= 1)\n        {\n            GetParentEntity()->Exec(\"Move\" ,\"Backward\");\n        }\n        if (e->relativeY < 0 && abs(e->relativeY) >= 1)\n        {\n            GetParentEntity()->Exec(\"Move\", \"Forward\");\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*==========================================================================\r\n               SeqAn - The Library for Sequence Analysis\r\n                         http:\/\/www.seqan.de \r\n============================================================================\r\nCopyright (C) 2007\r\n\r\nThis library is free software; you can redistribute it and\/or\r\nmodify it under the terms of the GNU Lesser General Public\r\nLicense as published by the Free Software Foundation; either\r\nversion 3 of the License, or (at your option) any later version.\r\n\r\nThis library 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 GNU\r\nLesser General Public License for more details.\r\n==========================================================================*\/\r\n\r\n#define SEQAN_PROFILE\r\n\r\n#include <seqan\/basic.h>\r\n\r\n\/\/ Profiling\r\n#ifdef SEQAN_PROFILE\r\n\t\tSEQAN_PROTIMESTART(__myProfileTime); \r\n#endif\r\n\r\n#include <seqan\/consensus.h>\r\n#include <seqan\/modifier.h>\r\n#include <seqan\/misc\/misc_cmdparser.h>\r\n\r\n#include <iostream>\r\n#include <fstream>\r\n\r\n\r\nusing namespace seqan;\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\ninline void\r\n_addVersion(CommandLineParser& parser) {\r\n\t::std::string rev = \"$Revision: 4637 $\";\r\n\taddVersionLine(parser, \"Version 0.21 (31. July 2009) Revision: \" + rev.substr(11, 4) + \"\");\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\nint main(int argc, const char *argv[]) {\r\n\t\/\/ Command line parsing\r\n\tCommandLineParser parser;\r\n\t_addVersion(parser);\r\n\r\n\taddTitleLine(parser, \"***************************************\");\r\n\taddTitleLine(parser, \"* Multi-read alignment - SeqCons      *\");\r\n\taddTitleLine(parser, \"* (c) Copyright 2009 by Tobias Rausch *\");\r\n\taddTitleLine(parser, \"***************************************\");\r\n\r\n\taddUsageLine(parser, \"-r <FASTA file with reads> [Options]\");\r\n\taddUsageLine(parser, \"-a <AMOS message file> [Options]\");\r\n\r\n\taddSection(parser, \"Main Options:\");\r\n\taddOption(parser, addArgumentText(CommandLineOption(\"r\", \"reads\", \"file with reads\", OptionType::String), \"<FASTA reads file>\"));\r\n\taddOption(parser, addArgumentText(CommandLineOption(\"a\", \"afg\", \"message file\", OptionType::String), \"<AMOS afg file>\"));\r\n\taddOption(parser, addArgumentText(CommandLineOption(\"o\", \"outfile\", \"output filename\", OptionType::String, \"align.txt\"), \"<Filename>\"));\r\n\taddOption(parser, addArgumentText(CommandLineOption(\"f\", \"format\", \"output format\", OptionType::String, \"afg\"), \"[seqan | afg]\"));\r\n\taddOption(parser, addArgumentText(CommandLineOption(\"m\", \"method\", \"multi-read alignment method\", OptionType::String, \"realign\"), \"[realign | msa]\"));\r\n\taddOption(parser, addArgumentText(CommandLineOption(\"b\", \"bandwidth\", \"bandwidth\", OptionType::Int, 8), \"<Int>\"));\r\n\taddOption(parser, CommandLineOption(\"n\", \"noalign\", \"no align, only convert input\", OptionType::Boolean));\r\n\r\n\taddSection(parser, \"MSA Method Options:\");\r\n\taddOption(parser, addArgumentText(CommandLineOption(\"ma\", \"matchlength\", \"minimum overlap length\", OptionType::Int, 15), \"<Int>\"));\r\n\taddOption(parser, addArgumentText(CommandLineOption(\"qu\", \"quality\", \"minimum overlap precent identity\", OptionType::Int, 80), \"<Int>\"));\r\n\taddOption(parser, addArgumentText(CommandLineOption(\"ov\", \"overlaps\", \"minimum number of overlaps per read\", OptionType::Int, 3), \"<Int>\"));\r\n\taddOption(parser, addArgumentText(CommandLineOption(\"wi\", \"window\", \"window size\", OptionType::Int, 0), \"<Int>\"));\r\n\taddHelpLine(parser, \"\/*If this parameter is > 0 then all\");\r\n\taddHelpLine(parser, \"  overlaps within a given window\");\r\n\taddHelpLine(parser, \"  are computed.*\/\");\r\n\r\n\taddSection(parser, \"ReAlign Method Options:\");\r\n\taddOption(parser, CommandLineOption(\"in\", \"include\", \"include contig sequence\", OptionType::Boolean));\r\n\taddOption(parser, addArgumentText(CommandLineOption(\"rm\", \"rmethod\", \"realign method\", OptionType::String, \"gotoh\"), \"[nw | gotoh]\"));\r\n\r\n\tif (argc == 1)\r\n\t{\r\n\t\tshortHelp(parser, std::cerr);\t\/\/ print short help and exit\r\n\t\treturn 0;\r\n\t}\r\n\r\n\tif (!parse(parser, argc, argv, ::std::cerr)) return 1;\r\n\tif (isSetLong(parser, \"help\") || isSetLong(parser, \"version\")) return 0;\t\/\/ print help or version and exit\r\n\r\n\r\n\t\/\/ Get all command line options\r\n\tConsensusOptions consOpt;\r\n\r\n\t\/\/ Main options\r\n\tgetOptionValueLong(parser, \"reads\", consOpt.readsfile);\r\n\tgetOptionValueLong(parser, \"afg\", consOpt.afgfile);\r\n\tgetOptionValueLong(parser, \"outfile\", consOpt.outfile);\r\n\tString<char> optionVal;\r\n\tgetOptionValueLong(parser, \"format\", optionVal);\r\n\tif (optionVal == \"seqan\") consOpt.output = 0;\r\n\telse if (optionVal == \"afg\") consOpt.output = 1;\r\n\telse if (optionVal == \"frg\") consOpt.output = 2;\r\n\telse if (optionVal == \"cgb\") consOpt.output = 3;\r\n\tgetOptionValueLong(parser, \"method\", optionVal);\r\n\tif (optionVal == \"realign\") consOpt.method = 0;\r\n\telse if (optionVal == \"msa\") consOpt.method = 1;\r\n\tgetOptionValueLong(parser, \"bandwidth\", consOpt.bandwidth);\r\n#ifdef CELERA_OFFSET\r\n\tif (!isSetLong(parser, \"bandwidth\")) consOpt.bandwidth = 15;\t\r\n#endif\r\n\tgetOptionValueLong(parser, \"noalign\", consOpt.noalign);\r\n\r\n\t\/\/ Msa options\r\n\tgetOptionValueLong(parser, \"matchlength\", consOpt.matchlength);\r\n\tgetOptionValueLong(parser, \"quality\", consOpt.quality);\r\n\tgetOptionValueLong(parser, \"overlaps\", consOpt.overlaps);\r\n#ifdef CELERA_OFFSET\r\n\tif (!isSetLong(parser, \"overlaps\")) consOpt.overlaps = 5;\t\r\n#endif\r\n\tgetOptionValueLong(parser, \"window\", consOpt.window);\r\n\t\r\n\t\/\/ ReAlign options\r\n\tgetOptionValueLong(parser, \"include\", consOpt.include);\r\n\tgetOptionValueLong(parser, \"rmethod\", optionVal);\r\n\tif (optionVal == \"nw\") consOpt.rmethod = 0;\r\n\telse if (optionVal == \"gotoh\") consOpt.rmethod = 1;\r\n\r\n\r\n\t\/\/ Create a new fragment store\r\n\ttypedef FragmentStore<> TFragmentStore;\r\n\ttypedef Size<TFragmentStore>::Type TSize;\r\n\tTFragmentStore fragStore;\r\n\r\n\t\/\/ Load the reads and layout positions\r\n\tTSize numberOfContigs = 0;\r\n\tif (!empty(consOpt.readsfile)) {\r\n\t\t\/\/ Load simple read file\r\n\t\tFILE* strmReads = fopen(consOpt.readsfile.c_str(), \"rb\");\r\n\t\tbool moveToFront = false;\r\n\t\tif ((consOpt.output == 2) || (consOpt.output == 3)) moveToFront = true;\r\n\t\tbool success = _convertSimpleReadFile(strmReads, fragStore, consOpt.readsfile, moveToFront);\r\n\t\tfclose(strmReads);\r\n\t\tif (!success) { \r\n\t\t\tshortHelp(parser, std::cerr);\r\n\t\t\treturn 0;\r\n\t\t}\r\n\t\tnumberOfContigs = 1;\r\n\t} else if (!empty(consOpt.afgfile)) {\r\n\t\t\/\/ Load Amos message file\r\n\t\tFILE* strmReads = fopen(consOpt.afgfile.c_str(), \"rb\");\r\n\t\tread(strmReads, fragStore, Amos());\t\r\n\t\tfclose(strmReads);\r\n\t\tnumberOfContigs = length(fragStore.contigStore);\r\n\t} else {\r\n\t\tshortHelp(parser, std::cerr);\r\n\t\treturn 0;\r\n\t}\r\n\r\n\r\n\r\n\t\/\/ Multi-realignment desired or just conversion of the input\r\n\tif (!consOpt.noalign) {\r\n\t\r\n\t\t\/\/ Profiling\r\n#ifdef SEQAN_PROFILE\r\n\t\t\t\tSEQAN_PROTIMEUPDATE(__myProfileTime); \r\n#endif\r\n\t\r\n\t\t\/\/ Iterate over all contigs\r\n\t\tfor(TSize currentContig = 0; currentContig < numberOfContigs; ++currentContig) {\r\n\r\n\t\t\tif (consOpt.method == 0) {\r\n#ifdef SEQAN_PROFILE\r\n\t\t\t\t::std::cout << \"ReAlign method\" << ::std::endl;\r\n\t\t\t\tif (consOpt.rmethod == 0) ::std::cout << \"Realign algorithm: Needleman-Wunsch\" << ::std::endl;\r\n\t\t\t\telse if (consOpt.rmethod == 1) ::std::cout << \"Realign algorithm: Gotoh\" << ::std::endl;\r\n\t\t\t\t::std::cout << \"Bandwidth: \" << consOpt.bandwidth << ::std::endl;\r\n\t\t\t\t::std::cout << \"Include reference: \" << consOpt.include << ::std::endl;\r\n#endif\r\n\t\t\t\tScore<int, WeightedConsensusScore<Score<int, FractionalScore>, Score<int, ConsensusScore> > > combinedScore;\r\n\t\t\t\treAlign(fragStore, combinedScore, currentContig, consOpt.rmethod, consOpt.bandwidth, consOpt.include);\r\n\r\n#ifdef SEQAN_PROFILE\r\n\t\t\t\t::std::cout << \"ReAlignment done: \" << SEQAN_PROTIMEUPDATE(__myProfileTime) << \" seconds\" << ::std::endl;\r\n#endif\r\n\t\t\t} else {\r\n\r\n#ifdef SEQAN_PROFILE\r\n\t\t\t\t::std::cout << \"MSA method\" << ::std::endl;\r\n\t\t\t\t::std::cout << \"Bandwidth: \" << consOpt.bandwidth << ::std::endl;\r\n\t\t\t\t::std::cout << \"Matchlength: \" << consOpt.matchlength << ::std::endl;\r\n\t\t\t\t::std::cout << \"Quality: \" << consOpt.quality << ::std::endl;\r\n\t\t\t\t::std::cout << \"Overlaps: \" << consOpt.overlaps << ::std::endl;\r\n\t\t\t\t::std::cout << \"Window: \" << consOpt.window << ::std::endl;\r\n#endif\r\n\r\n\t\t\t\t\/\/ Import all reads of the given contig\r\n\t\t\t\ttypedef TFragmentStore::TReadSeq TReadSeq;\r\n\t\t\t\tStringSet<TReadSeq, Owner<> > readSet;\r\n\t\t\t\tString<Pair<TSize, TSize> > begEndPos;\r\n\t\t\t\t_loadContigReads(readSet, begEndPos, fragStore, currentContig);\r\n\t\t\t\tif (!length(readSet)) continue;\r\n\r\n#ifdef SEQAN_PROFILE\r\n\t\t\t\t::std::cout << \"Import sequences done: \" << SEQAN_PROTIMEUPDATE(__myProfileTime) << \" seconds\" << ::std::endl;\r\n#endif\r\n\r\n\t\t\t\t\/\/ Align the reads\r\n\t\t\t\ttypedef StringSet<TReadSeq, Dependent<> > TStringSet;\r\n\t\t\t\ttypedef Graph<Alignment<TStringSet, void, WithoutEdgeId> > TAlignGraph;\r\n\t\t\t\tTAlignGraph gOut(readSet);\r\n\t\t\t\tconsensusAlignment(gOut, begEndPos, consOpt);\r\n#ifdef SEQAN_PROFILE\r\n\t\t\t\tstd::cout << \"Multi-read Alignment done: \" << SEQAN_PROTIMEUPDATE(__myProfileTime) << \" seconds\" << std::endl;\r\n#endif\r\n\r\n\t\t\t\r\n\t\t\t\t\/\/ Update the contig in the fragment store\r\n\t\t\t\tupdateContig(fragStore, gOut, currentContig);\r\n\t\t\t\tclear(gOut);\r\n#ifdef SEQAN_PROFILE\r\n\t\t\t\tstd::cout << \"Update contig done: \" << SEQAN_PROTIMEUPDATE(__myProfileTime) << \" seconds\" << std::endl;\r\n#endif\r\n\r\n\t\t\t\t\/\/\/\/ Debug code for CA\r\n\t\t\t\t\/\/mtRandInit();\r\n\t\t\t\t\/\/String<char> fileTmp1 = \"tmp1\";\r\n\t\t\t\t\/\/String<char> fileTmp2 = \"tmp2\";\r\n\t\t\t\t\/\/for(int i = 0; i<10; ++i) {\r\n\t\t\t\t\/\/\tint file = (mtRand() % 20) + 65;\r\n\t\t\t\t\/\/\tappendValue(fileTmp1, char(file));\r\n\t\t\t\t\/\/\tappendValue(fileTmp2, char(file));\r\n\t\t\t\t\/\/}\r\n\t\t\t\t\/\/std::fstream strm3;\r\n\t\t\t\t\/\/strm3.open(toCString(fileTmp2), std::ios_base::out | std::ios_base::trunc);\r\n\t\t\t\t\/\/for(int i = 0;i<(int) length(origStrSet); ++i) {\r\n\t\t\t\t\/\/\tstd::stringstream name;\r\n\t\t\t\t\/\/\tname << value(begEndPos, i).i1 << \",\" << value(begEndPos, i).i2;\r\n\t\t\t\t\/\/\tString<char> myTitle = name.str();\r\n\t\t\t\t\/\/\twrite(strm3, origStrSet[i], myTitle, Fasta());\t\t\t\r\n\t\t\t\t\/\/\tif (value(begEndPos, i).i1 > value(begEndPos, i).i2) reverseComplementInPlace(origStrSet[i]);\r\n\t\t\t\t\/\/}\r\n\t\t\t\t\/\/strm3.close();\r\n\t\t\t}\r\n\t\t} \/\/ end loop over all contigs\r\n\t}\r\n\t\r\n\t\/\/ Output\r\n\tif (consOpt.output == 0) {\r\n\t\t\/\/ Write old SeqAn multi-read alignment format\r\n\t\tFILE* strmWrite = fopen(consOpt.outfile.c_str(), \"w\");\r\n\t\twrite(strmWrite, fragStore, FastaReadFormat());\t\r\n\t\tfclose(strmWrite);\r\n\t} else if (consOpt.output == 1) {\r\n\t\t\/\/ Write Amos\r\n\t\tFILE* strmWrite = fopen(consOpt.outfile.c_str(), \"w\");\r\n\t\twrite(strmWrite, fragStore, Amos());\t\r\n\t\tfclose(strmWrite);\r\n\t} else if (consOpt.output == 2) {\r\n\t\tFILE* strmWrite = fopen(consOpt.outfile.c_str(), \"w\");\r\n\t\t_writeCeleraFrg(strmWrite, fragStore);\t\r\n\t\tfclose(strmWrite);\r\n\t} else if (consOpt.output == 3) {\r\n\t\tFILE* strmWrite = fopen(consOpt.outfile.c_str(), \"w\");\r\n\t\t_writeCeleraCgb(strmWrite, fragStore);\t\r\n\t\tfclose(strmWrite);\r\n\t}\r\n\r\n\treturn 0;\r\n}\r\n<commit_msg>Finished updating seqcons.<commit_after>\/*==========================================================================\r\n               SeqAn - The Library for Sequence Analysis\r\n                         http:\/\/www.seqan.de \r\n============================================================================\r\nCopyright (C) 2007\r\n\r\nThis library is free software; you can redistribute it and\/or\r\nmodify it under the terms of the GNU Lesser General Public\r\nLicense as published by the Free Software Foundation; either\r\nversion 3 of the License, or (at your option) any later version.\r\n\r\nThis library 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 GNU\r\nLesser General Public License for more details.\r\n==========================================================================*\/\r\n\r\n#define SEQAN_PROFILE\r\n\r\n#include <seqan\/basic.h>\r\n\r\n\/\/ Profiling\r\n#ifdef SEQAN_PROFILE\r\n\t\tSEQAN_PROTIMESTART(__myProfileTime); \r\n#endif\r\n\r\n#include <seqan\/consensus.h>\r\n#include <seqan\/modifier.h>\r\n#include <seqan\/misc\/misc_cmdparser.h>\r\n\r\n#include <iostream>\r\n#include <fstream>\r\n\r\n\r\nusing namespace seqan;\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\ninline void\r\n_addVersion(CommandLineParser& parser) {\r\n\t::std::string rev = \"$Revision: 4637 $\";\r\n\taddVersionLine(parser, \"Version 0.21 (31. July 2009) Revision: \" + rev.substr(11, 4) + \"\");\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\nint main(int argc, const char *argv[]) {\r\n\t\/\/ Command line parsing\r\n\tCommandLineParser parser;\r\n\t_addVersion(parser);\r\n\r\n\taddTitleLine(parser, \"***************************************\");\r\n\taddTitleLine(parser, \"* Multi-read alignment - SeqCons      *\");\r\n\taddTitleLine(parser, \"* (c) Copyright 2009 by Tobias Rausch *\");\r\n\taddTitleLine(parser, \"***************************************\");\r\n\r\n\taddUsageLine(parser, \"-r <FASTA file with reads> [Options]\");\r\n\taddUsageLine(parser, \"-a <AMOS message file> [Options]\");\r\n\r\n\taddSection(parser, \"Main Options:\");\r\n\taddOption(parser, addArgumentText(CommandLineOption(\"r\", \"reads\", \"file with reads\", OptionType::String), \"<FASTA reads file>\"));\r\n\taddOption(parser, addArgumentText(CommandLineOption(\"a\", \"afg\", \"message file\", OptionType::String), \"<AMOS afg file>\"));\r\n\taddOption(parser, addArgumentText(CommandLineOption(\"o\", \"outfile\", \"output filename\", OptionType::String, \"align.txt\"), \"<Filename>\"));\r\n\taddOption(parser, addArgumentText(CommandLineOption(\"f\", \"format\", \"output format\", OptionType::String, \"afg\"), \"[seqan | afg]\"));\r\n\taddOption(parser, addArgumentText(CommandLineOption(\"m\", \"method\", \"multi-read alignment method\", OptionType::String, \"realign\"), \"[realign | msa]\"));\r\n\taddOption(parser, addArgumentText(CommandLineOption(\"b\", \"bandwidth\", \"bandwidth\", OptionType::Int, 8), \"<Int>\"));\r\n\taddOption(parser, CommandLineOption(\"n\", \"noalign\", \"no align, only convert input\", OptionType::Boolean));\r\n\r\n\taddSection(parser, \"MSA Method Options:\");\r\n\taddOption(parser, addArgumentText(CommandLineOption(\"ma\", \"matchlength\", \"minimum overlap length\", OptionType::Int, 15), \"<Int>\"));\r\n\taddOption(parser, addArgumentText(CommandLineOption(\"qu\", \"quality\", \"minimum overlap precent identity\", OptionType::Int, 80), \"<Int>\"));\r\n\taddOption(parser, addArgumentText(CommandLineOption(\"ov\", \"overlaps\", \"minimum number of overlaps per read\", OptionType::Int, 3), \"<Int>\"));\r\n\taddOption(parser, addArgumentText(CommandLineOption(\"wi\", \"window\", \"window size\", OptionType::Int, 0), \"<Int>\"));\r\n\taddHelpLine(parser, \"\/*If this parameter is > 0 then all\");\r\n\taddHelpLine(parser, \"  overlaps within a given window\");\r\n\taddHelpLine(parser, \"  are computed.*\/\");\r\n\r\n\taddSection(parser, \"ReAlign Method Options:\");\r\n\taddOption(parser, CommandLineOption(\"in\", \"include\", \"include contig sequence\", OptionType::Boolean));\r\n\taddOption(parser, addArgumentText(CommandLineOption(\"rm\", \"rmethod\", \"realign method\", OptionType::String, \"gotoh\"), \"[nw | gotoh]\"));\r\n\r\n\tif (argc == 1)\r\n\t{\r\n\t\tshortHelp(parser, std::cerr);\t\/\/ print short help and exit\r\n\t\treturn 0;\r\n\t}\r\n\r\n\tif (!parse(parser, argc, argv, ::std::cerr)) return 1;\r\n\tif (isSetLong(parser, \"help\") || isSetLong(parser, \"version\")) return 0;\t\/\/ print help or version and exit\r\n\r\n\r\n\t\/\/ Get all command line options\r\n\tConsensusOptions consOpt;\r\n\r\n\t\/\/ Main options\r\n\tgetOptionValueLong(parser, \"reads\", consOpt.readsfile);\r\n\tgetOptionValueLong(parser, \"afg\", consOpt.afgfile);\r\n\tgetOptionValueLong(parser, \"outfile\", consOpt.outfile);\r\n\tString<char> optionVal;\r\n\tgetOptionValueLong(parser, \"format\", optionVal);\r\n\tif (optionVal == \"seqan\") consOpt.output = 0;\r\n\telse if (optionVal == \"afg\") consOpt.output = 1;\r\n\telse if (optionVal == \"frg\") consOpt.output = 2;\r\n\telse if (optionVal == \"cgb\") consOpt.output = 3;\r\n\tgetOptionValueLong(parser, \"method\", optionVal);\r\n\tif (optionVal == \"realign\") consOpt.method = 0;\r\n\telse if (optionVal == \"msa\") consOpt.method = 1;\r\n\tgetOptionValueLong(parser, \"bandwidth\", consOpt.bandwidth);\r\n#ifdef CELERA_OFFSET\r\n\tif (!isSetLong(parser, \"bandwidth\")) consOpt.bandwidth = 15;\t\r\n#endif\r\n\tgetOptionValueLong(parser, \"noalign\", consOpt.noalign);\r\n\r\n\t\/\/ Msa options\r\n\tgetOptionValueLong(parser, \"matchlength\", consOpt.matchlength);\r\n\tgetOptionValueLong(parser, \"quality\", consOpt.quality);\r\n\tgetOptionValueLong(parser, \"overlaps\", consOpt.overlaps);\r\n#ifdef CELERA_OFFSET\r\n\tif (!isSetLong(parser, \"overlaps\")) consOpt.overlaps = 5;\t\r\n#endif\r\n\tgetOptionValueLong(parser, \"window\", consOpt.window);\r\n\t\r\n\t\/\/ ReAlign options\r\n\tgetOptionValueLong(parser, \"include\", consOpt.include);\r\n\tgetOptionValueLong(parser, \"rmethod\", optionVal);\r\n\tif (optionVal == \"nw\") consOpt.rmethod = 0;\r\n\telse if (optionVal == \"gotoh\") consOpt.rmethod = 1;\r\n\r\n\r\n\t\/\/ Create a new fragment store\r\n\ttypedef FragmentStore<> TFragmentStore;\r\n\ttypedef Size<TFragmentStore>::Type TSize;\r\n\tTFragmentStore fragStore;\r\n\r\n\t\/\/ Load the reads and layout positions\r\n\tTSize numberOfContigs = 0;\r\n\tif (!empty(consOpt.readsfile)) {\r\n\t\t\/\/ Load simple read file\r\n\t\tFILE* strmReads = fopen(consOpt.readsfile.c_str(), \"rb\");\r\n\t\tbool moveToFront = false;\r\n\t\tif (consOpt.noalign) moveToFront = true;\r\n\t\tbool success = _convertSimpleReadFile(strmReads, fragStore, consOpt.readsfile, moveToFront);\r\n\t\tfclose(strmReads);\r\n\t\tif (!success) { \r\n\t\t\tshortHelp(parser, std::cerr);\r\n\t\t\treturn 0;\r\n\t\t}\r\n\t\tnumberOfContigs = 1;\r\n\t} else if (!empty(consOpt.afgfile)) {\r\n\t\t\/\/ Load Amos message file\r\n\t\tFILE* strmReads = fopen(consOpt.afgfile.c_str(), \"rb\");\r\n\t\tread(strmReads, fragStore, Amos());\t\r\n\t\tfclose(strmReads);\r\n\t\tnumberOfContigs = length(fragStore.contigStore);\r\n\t} else {\r\n\t\tshortHelp(parser, std::cerr);\r\n\t\treturn 0;\r\n\t}\r\n\r\n\r\n\r\n\t\/\/ Multi-realignment desired or just conversion of the input\r\n\tif (!consOpt.noalign) {\r\n\t\r\n\t\t\/\/ Profiling\r\n#ifdef SEQAN_PROFILE\r\n\t\t\t\tSEQAN_PROTIMEUPDATE(__myProfileTime); \r\n#endif\r\n\t\r\n\t\t\/\/ Iterate over all contigs\r\n\t\tfor(TSize currentContig = 0; currentContig < numberOfContigs; ++currentContig) {\r\n\r\n\t\t\tif (consOpt.method == 0) {\r\n#ifdef SEQAN_PROFILE\r\n\t\t\t\t::std::cout << \"ReAlign method\" << ::std::endl;\r\n\t\t\t\tif (consOpt.rmethod == 0) ::std::cout << \"Realign algorithm: Needleman-Wunsch\" << ::std::endl;\r\n\t\t\t\telse if (consOpt.rmethod == 1) ::std::cout << \"Realign algorithm: Gotoh\" << ::std::endl;\r\n\t\t\t\t::std::cout << \"Bandwidth: \" << consOpt.bandwidth << ::std::endl;\r\n\t\t\t\t::std::cout << \"Include reference: \" << consOpt.include << ::std::endl;\r\n#endif\r\n\t\t\t\tScore<int, WeightedConsensusScore<Score<int, FractionalScore>, Score<int, ConsensusScore> > > combinedScore;\r\n\t\t\t\treAlign(fragStore, combinedScore, currentContig, consOpt.rmethod, consOpt.bandwidth, consOpt.include);\r\n\r\n#ifdef SEQAN_PROFILE\r\n\t\t\t\t::std::cout << \"ReAlignment done: \" << SEQAN_PROTIMEUPDATE(__myProfileTime) << \" seconds\" << ::std::endl;\r\n#endif\r\n\t\t\t} else {\r\n\r\n#ifdef SEQAN_PROFILE\r\n\t\t\t\t::std::cout << \"MSA method\" << ::std::endl;\r\n\t\t\t\t::std::cout << \"Bandwidth: \" << consOpt.bandwidth << ::std::endl;\r\n\t\t\t\t::std::cout << \"Matchlength: \" << consOpt.matchlength << ::std::endl;\r\n\t\t\t\t::std::cout << \"Quality: \" << consOpt.quality << ::std::endl;\r\n\t\t\t\t::std::cout << \"Overlaps: \" << consOpt.overlaps << ::std::endl;\r\n\t\t\t\t::std::cout << \"Window: \" << consOpt.window << ::std::endl;\r\n#endif\r\n\r\n\t\t\t\t\/\/ Import all reads of the given contig\r\n\t\t\t\ttypedef TFragmentStore::TReadSeq TReadSeq;\r\n\t\t\t\tStringSet<TReadSeq, Owner<> > readSet;\r\n\t\t\t\tString<Pair<TSize, TSize> > begEndPos;\r\n\t\t\t\t_loadContigReads(readSet, begEndPos, fragStore, currentContig);\r\n\t\t\t\tif (!length(readSet)) continue;\r\n\r\n#ifdef SEQAN_PROFILE\r\n\t\t\t\t::std::cout << \"Import sequences done: \" << SEQAN_PROTIMEUPDATE(__myProfileTime) << \" seconds\" << ::std::endl;\r\n#endif\r\n\r\n\t\t\t\t\/\/ Align the reads\r\n\t\t\t\ttypedef StringSet<TReadSeq, Dependent<> > TStringSet;\r\n\t\t\t\ttypedef Graph<Alignment<TStringSet, void, WithoutEdgeId> > TAlignGraph;\r\n\t\t\t\tTAlignGraph gOut(readSet);\r\n\t\t\t\tconsensusAlignment(gOut, begEndPos, consOpt);\r\n#ifdef SEQAN_PROFILE\r\n\t\t\t\tstd::cout << \"Multi-read Alignment done: \" << SEQAN_PROTIMEUPDATE(__myProfileTime) << \" seconds\" << std::endl;\r\n#endif\r\n\r\n\t\t\t\r\n\t\t\t\t\/\/ Update the contig in the fragment store\r\n\t\t\t\tupdateContig(fragStore, gOut, currentContig);\r\n\t\t\t\tclear(gOut);\r\n#ifdef SEQAN_PROFILE\r\n\t\t\t\tstd::cout << \"Update contig done: \" << SEQAN_PROTIMEUPDATE(__myProfileTime) << \" seconds\" << std::endl;\r\n#endif\r\n\r\n\t\t\t\t\/\/\/\/ Debug code for CA\r\n\t\t\t\t\/\/mtRandInit();\r\n\t\t\t\t\/\/String<char> fileTmp1 = \"tmp1\";\r\n\t\t\t\t\/\/String<char> fileTmp2 = \"tmp2\";\r\n\t\t\t\t\/\/for(int i = 0; i<10; ++i) {\r\n\t\t\t\t\/\/\tint file = (mtRand() % 20) + 65;\r\n\t\t\t\t\/\/\tappendValue(fileTmp1, char(file));\r\n\t\t\t\t\/\/\tappendValue(fileTmp2, char(file));\r\n\t\t\t\t\/\/}\r\n\t\t\t\t\/\/std::fstream strm3;\r\n\t\t\t\t\/\/strm3.open(toCString(fileTmp2), std::ios_base::out | std::ios_base::trunc);\r\n\t\t\t\t\/\/for(int i = 0;i<(int) length(origStrSet); ++i) {\r\n\t\t\t\t\/\/\tstd::stringstream name;\r\n\t\t\t\t\/\/\tname << value(begEndPos, i).i1 << \",\" << value(begEndPos, i).i2;\r\n\t\t\t\t\/\/\tString<char> myTitle = name.str();\r\n\t\t\t\t\/\/\twrite(strm3, origStrSet[i], myTitle, Fasta());\t\t\t\r\n\t\t\t\t\/\/\tif (value(begEndPos, i).i1 > value(begEndPos, i).i2) reverseComplementInPlace(origStrSet[i]);\r\n\t\t\t\t\/\/}\r\n\t\t\t\t\/\/strm3.close();\r\n\t\t\t}\r\n\t\t} \/\/ end loop over all contigs\r\n\t}\r\n\t\r\n\t\/\/ Output\r\n\tif (consOpt.output == 0) {\r\n\t\t\/\/ Write old SeqAn multi-read alignment format\r\n\t\tFILE* strmWrite = fopen(consOpt.outfile.c_str(), \"w\");\r\n\t\twrite(strmWrite, fragStore, FastaReadFormat());\t\r\n\t\tfclose(strmWrite);\r\n\t} else if (consOpt.output == 1) {\r\n\t\t\/\/ Write Amos\r\n\t\tFILE* strmWrite = fopen(consOpt.outfile.c_str(), \"w\");\r\n\t\twrite(strmWrite, fragStore, Amos());\t\r\n\t\tfclose(strmWrite);\r\n\t} else if (consOpt.output == 2) {\r\n\t\tFILE* strmWrite = fopen(consOpt.outfile.c_str(), \"w\");\r\n\t\t_writeCeleraFrg(strmWrite, fragStore);\t\r\n\t\tfclose(strmWrite);\r\n\t} else if (consOpt.output == 3) {\r\n\t\tFILE* strmWrite = fopen(consOpt.outfile.c_str(), \"w\");\r\n\t\t_writeCeleraCgb(strmWrite, fragStore);\t\r\n\t\tfclose(strmWrite);\r\n\t}\r\n\r\n\treturn 0;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2013 Ambroz Bizjak\n * All 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 * \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 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 <stdint.h>\n#include <stdio.h>\n#include <math.h>\n\n#include <avr\/io.h>\n#include <avr\/interrupt.h>\n\n#define AMBROLIB_ABORT_ACTION { cli(); while (1); }\n\n#include <aprinter\/meta\/MakeTypeList.h>\n#include <aprinter\/base\/DebugObject.h>\n#include <aprinter\/system\/AvrEventLoop.h>\n#include <aprinter\/system\/AvrClock.h>\n#include <aprinter\/system\/AvrPins.h>\n#include <aprinter\/system\/AvrPinWatcher.h>\n#include <aprinter\/system\/AvrLock.h>\n#include <aprinter\/system\/AvrAdc.h>\n#include <aprinter\/devices\/ThermistorFormula.h>\n#include <aprinter\/printer\/PrinterMain.h>\n\nusing namespace APrinter;\n\nstatic const int AdcRefSel = 1;\nstatic const int AdcPrescaler = 7;\nstatic const int clock_timer_prescaler = 3;\nstatic const int stepper_command_buffer_size_exp = 3;\n\nusing LedBlinkInterval = AMBRO_WRAP_DOUBLE(0.5);\nusing DefaultInactiveTime = AMBRO_WRAP_DOUBLE(60.0);\nusing SpeedLimitMultiply = AMBRO_WRAP_DOUBLE(1.0 \/ 60.0);\n\nusing XDefaultStepsPerUnit = AMBRO_WRAP_DOUBLE(80.0);\nusing XDefaultMaxSpeed = AMBRO_WRAP_DOUBLE(80.0);\nusing XDefaultMaxAccel = AMBRO_WRAP_DOUBLE(500.0);\nusing XDefaultMin = AMBRO_WRAP_DOUBLE(-53.0);\nusing XDefaultMax = AMBRO_WRAP_DOUBLE(210.0);\nusing XDefaultHomeFastMaxDist = AMBRO_WRAP_DOUBLE(280.0);\nusing XDefaultHomeRetractDist = AMBRO_WRAP_DOUBLE(3.0);\nusing XDefaultHomeSlowMaxDist = AMBRO_WRAP_DOUBLE(5.0);\nusing XDefaultHomeFastSpeed = AMBRO_WRAP_DOUBLE(40.0);\nusing XDefaultHomeRetractSpeed = AMBRO_WRAP_DOUBLE(50.0);\nusing XDefaultHomeSlowSpeed = AMBRO_WRAP_DOUBLE(5.0);\n\nusing YDefaultStepsPerUnit = AMBRO_WRAP_DOUBLE(80.0);\nusing YDefaultMaxSpeed = AMBRO_WRAP_DOUBLE(80.0);\nusing YDefaultMaxAccel = AMBRO_WRAP_DOUBLE(500.0);\nusing YDefaultMin = AMBRO_WRAP_DOUBLE(0.0);\nusing YDefaultMax = AMBRO_WRAP_DOUBLE(170.0);\nusing YDefaultHomeFastMaxDist = AMBRO_WRAP_DOUBLE(280.0);\nusing YDefaultHomeRetractDist = AMBRO_WRAP_DOUBLE(3.0);\nusing YDefaultHomeSlowMaxDist = AMBRO_WRAP_DOUBLE(5.0);\nusing YDefaultHomeFastSpeed = AMBRO_WRAP_DOUBLE(40.0);\nusing YDefaultHomeRetractSpeed = AMBRO_WRAP_DOUBLE(50.0);\nusing YDefaultHomeSlowSpeed = AMBRO_WRAP_DOUBLE(5.0);\n\nusing ZDefaultStepsPerUnit = AMBRO_WRAP_DOUBLE(4000.0);\nusing ZDefaultMaxSpeed = AMBRO_WRAP_DOUBLE(2.0);\nusing ZDefaultMaxAccel = AMBRO_WRAP_DOUBLE(30.0);\nusing ZDefaultMin = AMBRO_WRAP_DOUBLE(0.0);\nusing ZDefaultMax = AMBRO_WRAP_DOUBLE(100.0);\nusing ZDefaultHomeFastMaxDist = AMBRO_WRAP_DOUBLE(100.0);\nusing ZDefaultHomeRetractDist = AMBRO_WRAP_DOUBLE(0.8);\nusing ZDefaultHomeSlowMaxDist = AMBRO_WRAP_DOUBLE(1.2);\nusing ZDefaultHomeFastSpeed = AMBRO_WRAP_DOUBLE(2.0);\nusing ZDefaultHomeRetractSpeed = AMBRO_WRAP_DOUBLE(2.0);\nusing ZDefaultHomeSlowSpeed = AMBRO_WRAP_DOUBLE(0.6);\n\nusing EDefaultStepsPerUnit = AMBRO_WRAP_DOUBLE(928.0);\nusing EDefaultMaxSpeed = AMBRO_WRAP_DOUBLE(10.0);\nusing EDefaultMaxAccel = AMBRO_WRAP_DOUBLE(250.0);\nusing EDefaultMin = AMBRO_WRAP_DOUBLE(-10000.0);\nusing EDefaultMax = AMBRO_WRAP_DOUBLE(10000.0);\n\nusing TSensorResistorR = AMBRO_WRAP_DOUBLE(4700.0);\nusing TSensorThermistorR0 = AMBRO_WRAP_DOUBLE(100000.0);\nusing TSensorThermistorBeta = AMBRO_WRAP_DOUBLE(3960.0);\nusing TSensorFormula = ThermistorFormula<TSensorResistorR, TSensorThermistorR0, TSensorThermistorBeta>;\n\nusing BSensorResistorR = AMBRO_WRAP_DOUBLE(4700.0);\nusing BSensorThermistorR0 = AMBRO_WRAP_DOUBLE(10000.0);\nusing BSensorThermistorBeta = AMBRO_WRAP_DOUBLE(3480.0);\nusing BSensorFormula = ThermistorFormula<BSensorResistorR, BSensorThermistorR0, BSensorThermistorBeta>;\n\nusing PrinterParams = PrinterMainParams<\n    PrinterMainSerialParams<\n        UINT32_C(115200), \/\/ baud rate\n        GcodeParserParams<8> \/\/ receive buffer size exponent\n    >,\n    AvrPin<AvrPortA, 4>, \/\/ LED pin\n    LedBlinkInterval,\n    DefaultInactiveTime,\n    SpeedLimitMultiply,\n    MakeTypeList<\n        PrinterMainAxisParams<\n            'X', \/\/ axis name\n            AvrPin<AvrPortC, 5>, \/\/ dir pin\n            AvrPin<AvrPortD, 7>, \/\/ step pin\n            AvrPin<AvrPortD, 6>, \/\/ enable pin\n            true, \/\/ invert dir\n            AxisStepperParams<\n                stepper_command_buffer_size_exp,\n                AvrClockInterruptTimer_TC1_OCA \/\/ stepper timer\n            >,\n            XDefaultStepsPerUnit, \/\/ default steps per unit\n            XDefaultMaxSpeed, \/\/ default max speed\n            XDefaultMaxAccel, \/\/ default max acceleration\n            XDefaultMin,\n            XDefaultMax,\n            true, \/\/ enable cartesian speed limit\n            PrinterMainHomingParams<\n                AvrPin<AvrPortC, 2>, \/\/ endstop pin\n                false, \/\/ invert endstop value\n                false, \/\/ home direction (false=negative)\n                XDefaultHomeFastMaxDist,\n                XDefaultHomeRetractDist,\n                XDefaultHomeSlowMaxDist,\n                XDefaultHomeFastSpeed,\n                XDefaultHomeRetractSpeed,\n                XDefaultHomeSlowSpeed\n            >\n        >,\n        PrinterMainAxisParams<\n            'Y', \/\/ axis name\n            AvrPin<AvrPortC, 7>, \/\/ dir pin\n            AvrPin<AvrPortC, 6>, \/\/ step pin\n            AvrPin<AvrPortD, 6>, \/\/ enable pin\n            true, \/\/ invert dir\n            AxisStepperParams<\n                stepper_command_buffer_size_exp,\n                AvrClockInterruptTimer_TC1_OCB \/\/ stepper timer\n            >,\n            YDefaultStepsPerUnit, \/\/ default steps per unit\n            YDefaultMaxSpeed, \/\/ default max speed\n            YDefaultMaxAccel, \/\/ default max acceleration\n            YDefaultMin,\n            YDefaultMax,\n            true, \/\/ enable cartesian speed limit\n            PrinterMainHomingParams<\n                AvrPin<AvrPortC, 3>, \/\/ endstop pin\n                false, \/\/ invert endstop value\n                false, \/\/ home direction (false=negative)\n                YDefaultHomeFastMaxDist,\n                YDefaultHomeRetractDist,\n                YDefaultHomeSlowMaxDist,\n                YDefaultHomeFastSpeed,\n                YDefaultHomeRetractSpeed,\n                YDefaultHomeSlowSpeed\n            >\n        >,\n        PrinterMainAxisParams<\n            'Z', \/\/ axis name\n            AvrPin<AvrPortB, 2>, \/\/ dir pin\n            AvrPin<AvrPortB, 3>, \/\/ step pin\n            AvrPin<AvrPortA, 5>, \/\/ enable pin\n            false, \/\/ invert dir\n            AxisStepperParams<\n                stepper_command_buffer_size_exp,\n                AvrClockInterruptTimer_TC3_OCA \/\/ stepper timer\n            >,\n            ZDefaultStepsPerUnit, \/\/ default steps per unit\n            ZDefaultMaxSpeed, \/\/ default max speed\n            ZDefaultMaxAccel, \/\/ default max acceleration\n            ZDefaultMin,\n            ZDefaultMax,\n            true, \/\/ enable cartesian speed limit\n            PrinterMainHomingParams<\n                AvrPin<AvrPortC, 4>, \/\/ endstop pin\n                false, \/\/ invert endstop value\n                false, \/\/ home direction (false=negative)\n                ZDefaultHomeFastMaxDist,\n                ZDefaultHomeRetractDist,\n                ZDefaultHomeSlowMaxDist,\n                ZDefaultHomeFastSpeed,\n                ZDefaultHomeRetractSpeed,\n                ZDefaultHomeSlowSpeed\n            >\n        >,\n        PrinterMainAxisParams<\n            'E', \/\/ axis name\n            AvrPin<AvrPortB, 0>, \/\/ dir pin\n            AvrPin<AvrPortB, 1>, \/\/ step pin\n            AvrPin<AvrPortD, 6>, \/\/ enable pin\n            true, \/\/ invert dir\n            AxisStepperParams<\n                stepper_command_buffer_size_exp,\n                AvrClockInterruptTimer_TC3_OCB \/\/ stepper timer\n            >,\n            EDefaultStepsPerUnit, \/\/ default steps per unit\n            EDefaultMaxSpeed, \/\/ default max speed\n            EDefaultMaxAccel, \/\/ default max acceleration\n            EDefaultMin,\n            EDefaultMax,\n            false, \/\/ enable cartesian speed limit\n            PrinterMainNoHomingParams\n        >\n    >,\n    MakeTypeList<\n        PrinterMainSensorParams<\n            'T', \/\/ sensor name\n            AvrPin<AvrPortA, 7>, \/\/ analog input pin\n            TSensorFormula\n        >,\n        PrinterMainSensorParams<\n            'B', \/\/ sensor name\n            AvrPin<AvrPortA, 6>, \/\/ analog input pin\n            BSensorFormula\n        >\n    >\n>;\n\n\/\/ need to list all used ADC pins here\nusing AdcPins = MakeTypeList<\n    AvrPin<AvrPortA, 6>,\n    AvrPin<AvrPortA, 7>\n>;\n\nstruct MyContext;\nstruct EventLoopParams;\n\nusing MyDebugObjectGroup = DebugObjectGroup<MyContext>;\nusing MyClock = AvrClock<MyContext, clock_timer_prescaler>;\nusing MyLoop = AvrEventLoop<EventLoopParams>;\nusing MyPins = AvrPins<MyContext>;\nusing MyPinWatcherService = AvrPinWatcherService<MyContext>;\nusing MyAdc = AvrAdc<MyContext, AdcPins, AdcRefSel, AdcPrescaler>;\nusing MyPrinter = PrinterMain<MyContext, PrinterParams>;\n\nstruct MyContext {\n    using DebugGroup = MyDebugObjectGroup;\n    using Lock = AvrLock<MyContext>;\n    using Clock = MyClock;\n    using EventLoop = MyLoop;\n    using Pins = MyPins;\n    using PinWatcherService = MyPinWatcherService;\n    using Adc = MyAdc;\n    \n    MyDebugObjectGroup * debugGroup () const;\n    MyClock * clock () const;\n    MyLoop * eventLoop () const;\n    MyPins * pins () const;\n    MyPinWatcherService * pinWatcherService () const;\n    MyAdc * adc () const;\n};\n\nstruct EventLoopParams {\n    typedef MyContext Context;\n};\n\nstatic MyDebugObjectGroup d_group;\nstatic MyClock myclock;\nstatic MyLoop myloop;\nstatic MyPins mypins;\nstatic MyPinWatcherService mypinwatcherservice;\nstatic MyAdc myadc;\nstatic MyPrinter myprinter;\n\nMyDebugObjectGroup * MyContext::debugGroup () const { return &d_group; }\nMyClock * MyContext::clock () const { return &myclock; }\nMyLoop * MyContext::eventLoop () const { return &myloop; }\nMyPins * MyContext::pins () const { return &mypins; }\nMyPinWatcherService * MyContext::pinWatcherService () const { return &mypinwatcherservice; }\nMyAdc * MyContext::adc () const { return &myadc; }\n\nAMBRO_AVR_CLOCK_ISRS(myclock, MyContext())\nAMBRO_AVR_PIN_WATCHER_ISRS(mypinwatcherservice, MyContext())\nAMBRO_AVR_ADC_ISRS(myadc, MyContext())\nAMBRO_AVR_SERIAL_ISRS(*myprinter.getSerial(), MyContext())\nAMBRO_AVR_CLOCK_INTERRUPT_TIMER_TC1_OCA_ISRS(*myprinter.template getSharer<0>()->getTimer(), MyContext())\nAMBRO_AVR_CLOCK_INTERRUPT_TIMER_TC1_OCB_ISRS(*myprinter.template getSharer<1>()->getTimer(), MyContext())\nAMBRO_AVR_CLOCK_INTERRUPT_TIMER_TC3_OCA_ISRS(*myprinter.template getSharer<2>()->getTimer(), MyContext())\nAMBRO_AVR_CLOCK_INTERRUPT_TIMER_TC3_OCB_ISRS(*myprinter.template getSharer<3>()->getTimer(), MyContext())\n\nFILE uart_output;\n\nstatic int uart_putchar (char ch, FILE *stream)\n{\n    while (!(UCSR0A & (1 << UDRE0)));\n    UDR0 = ch;\n    return 1;\n}\n\nstatic void setup_uart_stdio ()\n{\n    uart_output.put = uart_putchar;\n    uart_output.flags = _FDEV_SETUP_WRITE;\n    stdout = &uart_output;\n    stderr = &uart_output;\n}\n\nint main ()\n{\n    sei();\n    setup_uart_stdio();\n    \n    MyContext c;\n    \n    d_group.init(c);\n    myclock.init(c);\n#ifdef TCNT3\n    myclock.initTC3(c);\n#endif\n    myloop.init(c);\n    mypins.init(c);\n    mypinwatcherservice.init(c);\n    myadc.init(c);\n    myprinter.init(c);\n    \n    myloop.run(c);\n}\n<commit_msg>No need for #ifdef TCNT3.<commit_after>\/*\n * Copyright (c) 2013 Ambroz Bizjak\n * All 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 * \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 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 <stdint.h>\n#include <stdio.h>\n#include <math.h>\n\n#include <avr\/io.h>\n#include <avr\/interrupt.h>\n\n#define AMBROLIB_ABORT_ACTION { cli(); while (1); }\n\n#include <aprinter\/meta\/MakeTypeList.h>\n#include <aprinter\/base\/DebugObject.h>\n#include <aprinter\/system\/AvrEventLoop.h>\n#include <aprinter\/system\/AvrClock.h>\n#include <aprinter\/system\/AvrPins.h>\n#include <aprinter\/system\/AvrPinWatcher.h>\n#include <aprinter\/system\/AvrLock.h>\n#include <aprinter\/system\/AvrAdc.h>\n#include <aprinter\/devices\/ThermistorFormula.h>\n#include <aprinter\/printer\/PrinterMain.h>\n\nusing namespace APrinter;\n\nstatic const int AdcRefSel = 1;\nstatic const int AdcPrescaler = 7;\nstatic const int clock_timer_prescaler = 3;\nstatic const int stepper_command_buffer_size_exp = 3;\n\nusing LedBlinkInterval = AMBRO_WRAP_DOUBLE(0.5);\nusing DefaultInactiveTime = AMBRO_WRAP_DOUBLE(60.0);\nusing SpeedLimitMultiply = AMBRO_WRAP_DOUBLE(1.0 \/ 60.0);\n\nusing XDefaultStepsPerUnit = AMBRO_WRAP_DOUBLE(80.0);\nusing XDefaultMaxSpeed = AMBRO_WRAP_DOUBLE(80.0);\nusing XDefaultMaxAccel = AMBRO_WRAP_DOUBLE(500.0);\nusing XDefaultMin = AMBRO_WRAP_DOUBLE(-53.0);\nusing XDefaultMax = AMBRO_WRAP_DOUBLE(210.0);\nusing XDefaultHomeFastMaxDist = AMBRO_WRAP_DOUBLE(280.0);\nusing XDefaultHomeRetractDist = AMBRO_WRAP_DOUBLE(3.0);\nusing XDefaultHomeSlowMaxDist = AMBRO_WRAP_DOUBLE(5.0);\nusing XDefaultHomeFastSpeed = AMBRO_WRAP_DOUBLE(40.0);\nusing XDefaultHomeRetractSpeed = AMBRO_WRAP_DOUBLE(50.0);\nusing XDefaultHomeSlowSpeed = AMBRO_WRAP_DOUBLE(5.0);\n\nusing YDefaultStepsPerUnit = AMBRO_WRAP_DOUBLE(80.0);\nusing YDefaultMaxSpeed = AMBRO_WRAP_DOUBLE(80.0);\nusing YDefaultMaxAccel = AMBRO_WRAP_DOUBLE(500.0);\nusing YDefaultMin = AMBRO_WRAP_DOUBLE(0.0);\nusing YDefaultMax = AMBRO_WRAP_DOUBLE(170.0);\nusing YDefaultHomeFastMaxDist = AMBRO_WRAP_DOUBLE(280.0);\nusing YDefaultHomeRetractDist = AMBRO_WRAP_DOUBLE(3.0);\nusing YDefaultHomeSlowMaxDist = AMBRO_WRAP_DOUBLE(5.0);\nusing YDefaultHomeFastSpeed = AMBRO_WRAP_DOUBLE(40.0);\nusing YDefaultHomeRetractSpeed = AMBRO_WRAP_DOUBLE(50.0);\nusing YDefaultHomeSlowSpeed = AMBRO_WRAP_DOUBLE(5.0);\n\nusing ZDefaultStepsPerUnit = AMBRO_WRAP_DOUBLE(4000.0);\nusing ZDefaultMaxSpeed = AMBRO_WRAP_DOUBLE(2.0);\nusing ZDefaultMaxAccel = AMBRO_WRAP_DOUBLE(30.0);\nusing ZDefaultMin = AMBRO_WRAP_DOUBLE(0.0);\nusing ZDefaultMax = AMBRO_WRAP_DOUBLE(100.0);\nusing ZDefaultHomeFastMaxDist = AMBRO_WRAP_DOUBLE(100.0);\nusing ZDefaultHomeRetractDist = AMBRO_WRAP_DOUBLE(0.8);\nusing ZDefaultHomeSlowMaxDist = AMBRO_WRAP_DOUBLE(1.2);\nusing ZDefaultHomeFastSpeed = AMBRO_WRAP_DOUBLE(2.0);\nusing ZDefaultHomeRetractSpeed = AMBRO_WRAP_DOUBLE(2.0);\nusing ZDefaultHomeSlowSpeed = AMBRO_WRAP_DOUBLE(0.6);\n\nusing EDefaultStepsPerUnit = AMBRO_WRAP_DOUBLE(928.0);\nusing EDefaultMaxSpeed = AMBRO_WRAP_DOUBLE(10.0);\nusing EDefaultMaxAccel = AMBRO_WRAP_DOUBLE(250.0);\nusing EDefaultMin = AMBRO_WRAP_DOUBLE(-10000.0);\nusing EDefaultMax = AMBRO_WRAP_DOUBLE(10000.0);\n\nusing TSensorResistorR = AMBRO_WRAP_DOUBLE(4700.0);\nusing TSensorThermistorR0 = AMBRO_WRAP_DOUBLE(100000.0);\nusing TSensorThermistorBeta = AMBRO_WRAP_DOUBLE(3960.0);\nusing TSensorFormula = ThermistorFormula<TSensorResistorR, TSensorThermistorR0, TSensorThermistorBeta>;\n\nusing BSensorResistorR = AMBRO_WRAP_DOUBLE(4700.0);\nusing BSensorThermistorR0 = AMBRO_WRAP_DOUBLE(10000.0);\nusing BSensorThermistorBeta = AMBRO_WRAP_DOUBLE(3480.0);\nusing BSensorFormula = ThermistorFormula<BSensorResistorR, BSensorThermistorR0, BSensorThermistorBeta>;\n\nusing PrinterParams = PrinterMainParams<\n    PrinterMainSerialParams<\n        UINT32_C(115200), \/\/ baud rate\n        GcodeParserParams<8> \/\/ receive buffer size exponent\n    >,\n    AvrPin<AvrPortA, 4>, \/\/ LED pin\n    LedBlinkInterval,\n    DefaultInactiveTime,\n    SpeedLimitMultiply,\n    MakeTypeList<\n        PrinterMainAxisParams<\n            'X', \/\/ axis name\n            AvrPin<AvrPortC, 5>, \/\/ dir pin\n            AvrPin<AvrPortD, 7>, \/\/ step pin\n            AvrPin<AvrPortD, 6>, \/\/ enable pin\n            true, \/\/ invert dir\n            AxisStepperParams<\n                stepper_command_buffer_size_exp,\n                AvrClockInterruptTimer_TC1_OCA \/\/ stepper timer\n            >,\n            XDefaultStepsPerUnit, \/\/ default steps per unit\n            XDefaultMaxSpeed, \/\/ default max speed\n            XDefaultMaxAccel, \/\/ default max acceleration\n            XDefaultMin,\n            XDefaultMax,\n            true, \/\/ enable cartesian speed limit\n            PrinterMainHomingParams<\n                AvrPin<AvrPortC, 2>, \/\/ endstop pin\n                false, \/\/ invert endstop value\n                false, \/\/ home direction (false=negative)\n                XDefaultHomeFastMaxDist,\n                XDefaultHomeRetractDist,\n                XDefaultHomeSlowMaxDist,\n                XDefaultHomeFastSpeed,\n                XDefaultHomeRetractSpeed,\n                XDefaultHomeSlowSpeed\n            >\n        >,\n        PrinterMainAxisParams<\n            'Y', \/\/ axis name\n            AvrPin<AvrPortC, 7>, \/\/ dir pin\n            AvrPin<AvrPortC, 6>, \/\/ step pin\n            AvrPin<AvrPortD, 6>, \/\/ enable pin\n            true, \/\/ invert dir\n            AxisStepperParams<\n                stepper_command_buffer_size_exp,\n                AvrClockInterruptTimer_TC1_OCB \/\/ stepper timer\n            >,\n            YDefaultStepsPerUnit, \/\/ default steps per unit\n            YDefaultMaxSpeed, \/\/ default max speed\n            YDefaultMaxAccel, \/\/ default max acceleration\n            YDefaultMin,\n            YDefaultMax,\n            true, \/\/ enable cartesian speed limit\n            PrinterMainHomingParams<\n                AvrPin<AvrPortC, 3>, \/\/ endstop pin\n                false, \/\/ invert endstop value\n                false, \/\/ home direction (false=negative)\n                YDefaultHomeFastMaxDist,\n                YDefaultHomeRetractDist,\n                YDefaultHomeSlowMaxDist,\n                YDefaultHomeFastSpeed,\n                YDefaultHomeRetractSpeed,\n                YDefaultHomeSlowSpeed\n            >\n        >,\n        PrinterMainAxisParams<\n            'Z', \/\/ axis name\n            AvrPin<AvrPortB, 2>, \/\/ dir pin\n            AvrPin<AvrPortB, 3>, \/\/ step pin\n            AvrPin<AvrPortA, 5>, \/\/ enable pin\n            false, \/\/ invert dir\n            AxisStepperParams<\n                stepper_command_buffer_size_exp,\n                AvrClockInterruptTimer_TC3_OCA \/\/ stepper timer\n            >,\n            ZDefaultStepsPerUnit, \/\/ default steps per unit\n            ZDefaultMaxSpeed, \/\/ default max speed\n            ZDefaultMaxAccel, \/\/ default max acceleration\n            ZDefaultMin,\n            ZDefaultMax,\n            true, \/\/ enable cartesian speed limit\n            PrinterMainHomingParams<\n                AvrPin<AvrPortC, 4>, \/\/ endstop pin\n                false, \/\/ invert endstop value\n                false, \/\/ home direction (false=negative)\n                ZDefaultHomeFastMaxDist,\n                ZDefaultHomeRetractDist,\n                ZDefaultHomeSlowMaxDist,\n                ZDefaultHomeFastSpeed,\n                ZDefaultHomeRetractSpeed,\n                ZDefaultHomeSlowSpeed\n            >\n        >,\n        PrinterMainAxisParams<\n            'E', \/\/ axis name\n            AvrPin<AvrPortB, 0>, \/\/ dir pin\n            AvrPin<AvrPortB, 1>, \/\/ step pin\n            AvrPin<AvrPortD, 6>, \/\/ enable pin\n            true, \/\/ invert dir\n            AxisStepperParams<\n                stepper_command_buffer_size_exp,\n                AvrClockInterruptTimer_TC3_OCB \/\/ stepper timer\n            >,\n            EDefaultStepsPerUnit, \/\/ default steps per unit\n            EDefaultMaxSpeed, \/\/ default max speed\n            EDefaultMaxAccel, \/\/ default max acceleration\n            EDefaultMin,\n            EDefaultMax,\n            false, \/\/ enable cartesian speed limit\n            PrinterMainNoHomingParams\n        >\n    >,\n    MakeTypeList<\n        PrinterMainSensorParams<\n            'T', \/\/ sensor name\n            AvrPin<AvrPortA, 7>, \/\/ analog input pin\n            TSensorFormula\n        >,\n        PrinterMainSensorParams<\n            'B', \/\/ sensor name\n            AvrPin<AvrPortA, 6>, \/\/ analog input pin\n            BSensorFormula\n        >\n    >\n>;\n\n\/\/ need to list all used ADC pins here\nusing AdcPins = MakeTypeList<\n    AvrPin<AvrPortA, 6>,\n    AvrPin<AvrPortA, 7>\n>;\n\nstruct MyContext;\nstruct EventLoopParams;\n\nusing MyDebugObjectGroup = DebugObjectGroup<MyContext>;\nusing MyClock = AvrClock<MyContext, clock_timer_prescaler>;\nusing MyLoop = AvrEventLoop<EventLoopParams>;\nusing MyPins = AvrPins<MyContext>;\nusing MyPinWatcherService = AvrPinWatcherService<MyContext>;\nusing MyAdc = AvrAdc<MyContext, AdcPins, AdcRefSel, AdcPrescaler>;\nusing MyPrinter = PrinterMain<MyContext, PrinterParams>;\n\nstruct MyContext {\n    using DebugGroup = MyDebugObjectGroup;\n    using Lock = AvrLock<MyContext>;\n    using Clock = MyClock;\n    using EventLoop = MyLoop;\n    using Pins = MyPins;\n    using PinWatcherService = MyPinWatcherService;\n    using Adc = MyAdc;\n    \n    MyDebugObjectGroup * debugGroup () const;\n    MyClock * clock () const;\n    MyLoop * eventLoop () const;\n    MyPins * pins () const;\n    MyPinWatcherService * pinWatcherService () const;\n    MyAdc * adc () const;\n};\n\nstruct EventLoopParams {\n    typedef MyContext Context;\n};\n\nstatic MyDebugObjectGroup d_group;\nstatic MyClock myclock;\nstatic MyLoop myloop;\nstatic MyPins mypins;\nstatic MyPinWatcherService mypinwatcherservice;\nstatic MyAdc myadc;\nstatic MyPrinter myprinter;\n\nMyDebugObjectGroup * MyContext::debugGroup () const { return &d_group; }\nMyClock * MyContext::clock () const { return &myclock; }\nMyLoop * MyContext::eventLoop () const { return &myloop; }\nMyPins * MyContext::pins () const { return &mypins; }\nMyPinWatcherService * MyContext::pinWatcherService () const { return &mypinwatcherservice; }\nMyAdc * MyContext::adc () const { return &myadc; }\n\nAMBRO_AVR_CLOCK_ISRS(myclock, MyContext())\nAMBRO_AVR_PIN_WATCHER_ISRS(mypinwatcherservice, MyContext())\nAMBRO_AVR_ADC_ISRS(myadc, MyContext())\nAMBRO_AVR_SERIAL_ISRS(*myprinter.getSerial(), MyContext())\nAMBRO_AVR_CLOCK_INTERRUPT_TIMER_TC1_OCA_ISRS(*myprinter.template getSharer<0>()->getTimer(), MyContext())\nAMBRO_AVR_CLOCK_INTERRUPT_TIMER_TC1_OCB_ISRS(*myprinter.template getSharer<1>()->getTimer(), MyContext())\nAMBRO_AVR_CLOCK_INTERRUPT_TIMER_TC3_OCA_ISRS(*myprinter.template getSharer<2>()->getTimer(), MyContext())\nAMBRO_AVR_CLOCK_INTERRUPT_TIMER_TC3_OCB_ISRS(*myprinter.template getSharer<3>()->getTimer(), MyContext())\n\nFILE uart_output;\n\nstatic int uart_putchar (char ch, FILE *stream)\n{\n    while (!(UCSR0A & (1 << UDRE0)));\n    UDR0 = ch;\n    return 1;\n}\n\nstatic void setup_uart_stdio ()\n{\n    uart_output.put = uart_putchar;\n    uart_output.flags = _FDEV_SETUP_WRITE;\n    stdout = &uart_output;\n    stderr = &uart_output;\n}\n\nint main ()\n{\n    sei();\n    setup_uart_stdio();\n    \n    MyContext c;\n    \n    d_group.init(c);\n    myclock.init(c);\n    myclock.initTC3(c);\n    myloop.init(c);\n    mypins.init(c);\n    mypinwatcherservice.init(c);\n    myadc.init(c);\n    myprinter.init(c);\n    \n    myloop.run(c);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2012 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n\n#include \"gm.h\"\n\n#include \"SkBitmapSource.h\"\n#include \"SkBlurImageFilter.h\"\n#include \"SkMorphologyImageFilter.h\"\n\n#include \"SkTestImageFilters.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass ImageFiltersGraphGM : public skiagm::GM {\npublic:\n    ImageFiltersGraphGM() : fInitialized(false) {}\n\nprotected:\n\n    virtual SkString onShortName() {\n        return SkString(\"imagefiltersgraph\");\n    }\n\n    void make_bitmap() {\n        fBitmap.setConfig(SkBitmap::kARGB_8888_Config, 100, 100);\n        fBitmap.allocPixels();\n        SkDevice device(fBitmap);\n        SkCanvas canvas(&device);\n        canvas.clear(0x00000000);\n        SkPaint paint;\n        paint.setAntiAlias(true);\n        paint.setColor(0xFFFFFFFF);\n        paint.setTextSize(SkIntToScalar(96));\n        const char* str = \"e\";\n        canvas.drawText(str, strlen(str), SkIntToScalar(20), SkIntToScalar(70), paint);\n    }\n\n    virtual SkISize onISize() { return SkISize::Make(500, 500); }\n\n    virtual void onDraw(SkCanvas* canvas) {\n        if (!fInitialized) {\n            this->make_bitmap();\n            fInitialized = true;\n        }\n        canvas->clear(0x00000000);\n        \n        SkAutoTUnref<SkImageFilter> bitmapSource(new SkBitmapSource(fBitmap));\n\n        SkAutoTUnref<SkColorFilter> cf(SkColorFilter::CreateModeFilter(SK_ColorRED,\n                                                     SkXfermode::kSrcIn_Mode));\n        SkAutoTUnref<SkImageFilter> blur(new SkBlurImageFilter(4.0f, 4.0f, bitmapSource));\n        SkAutoTUnref<SkImageFilter> erode(new SkErodeImageFilter(4, 4, blur));\n        SkAutoTUnref<SkImageFilter> color(new SkColorFilterImageFilter(cf, erode));\n        SkAutoTUnref<SkImageFilter> merge(new SkMergeImageFilter(blur, color));\n\n        SkPaint paint;\n        paint.setImageFilter(merge);\n        canvas->drawPaint(paint);\n    }\n\nprivate:\n    typedef GM INHERITED;\n    SkBitmap fBitmap;\n    bool fInitialized;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic skiagm::GM* MyFactory(void*) { return new ImageFiltersGraphGM; }\nstatic skiagm::GMRegistry reg(MyFactory);\n\n\n<commit_msg>Disable imagefiltersgraph from running through pipe on android<commit_after>\/*\n * Copyright 2012 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n\n#include \"gm.h\"\n\n#include \"SkBitmapSource.h\"\n#include \"SkBlurImageFilter.h\"\n#include \"SkMorphologyImageFilter.h\"\n\n#include \"SkTestImageFilters.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass ImageFiltersGraphGM : public skiagm::GM {\npublic:\n    ImageFiltersGraphGM() : fInitialized(false) {}\n\nprotected:\n#ifdef SK_BUILD_FOR_ANDROID\n    \/\/ This test is currently broken when using pipe on Android\n    virtual uint32_t onGetFlags() const SK_OVERRIDE {\n        return this->INHERITED::onGetFlags() | skiagm::GM::kSkipPipe_Flag;\n    }\n#endif\n\n    virtual SkString onShortName() {\n        return SkString(\"imagefiltersgraph\");\n    }\n\n    void make_bitmap() {\n        fBitmap.setConfig(SkBitmap::kARGB_8888_Config, 100, 100);\n        fBitmap.allocPixels();\n        SkDevice device(fBitmap);\n        SkCanvas canvas(&device);\n        canvas.clear(0x00000000);\n        SkPaint paint;\n        paint.setAntiAlias(true);\n        paint.setColor(0xFFFFFFFF);\n        paint.setTextSize(SkIntToScalar(96));\n        const char* str = \"e\";\n        canvas.drawText(str, strlen(str), SkIntToScalar(20), SkIntToScalar(70), paint);\n    }\n\n    virtual SkISize onISize() { return SkISize::Make(500, 500); }\n\n    virtual void onDraw(SkCanvas* canvas) {\n        if (!fInitialized) {\n            this->make_bitmap();\n            fInitialized = true;\n        }\n        canvas->clear(0x00000000);\n        \n        SkAutoTUnref<SkImageFilter> bitmapSource(new SkBitmapSource(fBitmap));\n\n        SkAutoTUnref<SkColorFilter> cf(SkColorFilter::CreateModeFilter(SK_ColorRED,\n                                                     SkXfermode::kSrcIn_Mode));\n        SkAutoTUnref<SkImageFilter> blur(new SkBlurImageFilter(4.0f, 4.0f, bitmapSource));\n        SkAutoTUnref<SkImageFilter> erode(new SkErodeImageFilter(4, 4, blur));\n        SkAutoTUnref<SkImageFilter> color(new SkColorFilterImageFilter(cf, erode));\n        SkAutoTUnref<SkImageFilter> merge(new SkMergeImageFilter(blur, color));\n\n        SkPaint paint;\n        paint.setImageFilter(merge);\n        canvas->drawPaint(paint);\n    }\n\nprivate:\n    typedef GM INHERITED;\n    SkBitmap fBitmap;\n    bool fInitialized;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic skiagm::GM* MyFactory(void*) { return new ImageFiltersGraphGM; }\nstatic skiagm::GMRegistry reg(MyFactory);\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * Copyright (C) 2013 Regents of the University of California.\n * @author: Jeff Thompson <jefft0@remap.ucla.edu>\n * See COPYING for copyright and distribution information.\n *\/\n\n#ifndef NDN_KEY_CHAIN_HPP\n#define NDN_KEY_CHAIN_HPP\n\n#include \"..\/data.hpp\"\n#include \"..\/face.hpp\"\n#include \"identity\/identity-manager.hpp\"\n\nnamespace ndn {\n\n\/**\n * An OnVerified function object is used to pass a callback to verifyData to report a successful verification.\n *\/\ntypedef func_lib::function<void(const ptr_lib::shared_ptr<Data>& data)> OnVerified;\n\n\/**\n * An OnVerifyFailed function object is used to pass a callback to verifyData to report a failed verification.\n *\/\ntypedef func_lib::function<void()> OnVerifyFailed;\n\nclass KeyChain {\npublic:\n  KeyChain(ptr_lib::shared_ptr<IdentityManager> identityManager)\n  : identityManager_(identityManager), face_(0), maxSteps_(100)\n  {  \n  }\n\n  \/**\n   * Wire encode the Data object, sign it and set its signature.\n   * Note: the caller must make sure the timestamp is correct, for example with \n   * data.getMetaInfo().setTimestampMilliseconds(time(NULL) * 1000.0).\n   * @param data The Data object to be signed.  This updates its signature and key locator field and wireEncoding.\n   * @param signerName The signing identity or certificate name, depending on byKeyName. If omitted, infer the certificate name from data.getName().\n   * @param byKeyName If true, the signerName is the key name, otherwise it is the certificate name. If omitted, the default is true.\n   * @param wireFormat\n   *\/\n  void \n  signData(Data& data, const Name& signerName = Name(), bool byKeyName = true, WireFormat& wireFormat = *WireFormat::getDefaultWireFormat());\n\n  \/**\n   * Check the signature on the Data object and call either onVerify or onVerifyFailed. \n   * We use callback functions because verify may fetch information to check the signature.\n   * @param data\n   * @param onVerified\n   * @param onVerifyFailed\n   *\/\n  void\n  verifyData(const ptr_lib::shared_ptr<Data>& data, const OnVerified& onVerified, const OnVerifyFailed& onVerifyFailed);\n\n  \/**\n   * Set the Face which will be used to fetch required certificates.\n   * @param face A pointer to the Face object.\n   *\/\n  void\n  setFace(Face* face) { face_ = face; }\n\nprivate:\n  ptr_lib::shared_ptr<IdentityManager> identityManager_;\n  Face* face_;\n  const int maxSteps_;\n};\n\n}\n\n#endif\n<commit_msg>security: In signData, update doc comment.<commit_after>\/**\n * Copyright (C) 2013 Regents of the University of California.\n * @author: Jeff Thompson <jefft0@remap.ucla.edu>\n * See COPYING for copyright and distribution information.\n *\/\n\n#ifndef NDN_KEY_CHAIN_HPP\n#define NDN_KEY_CHAIN_HPP\n\n#include \"..\/data.hpp\"\n#include \"..\/face.hpp\"\n#include \"identity\/identity-manager.hpp\"\n\nnamespace ndn {\n\n\/**\n * An OnVerified function object is used to pass a callback to verifyData to report a successful verification.\n *\/\ntypedef func_lib::function<void(const ptr_lib::shared_ptr<Data>& data)> OnVerified;\n\n\/**\n * An OnVerifyFailed function object is used to pass a callback to verifyData to report a failed verification.\n *\/\ntypedef func_lib::function<void()> OnVerifyFailed;\n\nclass KeyChain {\npublic:\n  KeyChain(ptr_lib::shared_ptr<IdentityManager> identityManager)\n  : identityManager_(identityManager), face_(0), maxSteps_(100)\n  {  \n  }\n\n  \/**\n   * Wire encode the Data object, sign it and set its signature.\n   * Note: the caller must make sure the timestamp is correct, for example with \n   * data.getMetaInfo().setTimestampMilliseconds(time(NULL) * 1000.0).\n   * @param data The Data object to be signed.  This updates its signature and key locator field and wireEncoding.\n   * @param signerName The signing identity or certificate name, depending on byKeyName. If omitted, infer the certificate name from data.getName().\n   * @param byKeyName If true, the signerName is the key name, otherwise it is the certificate name. If omitted, the default is true.\n   * @param wireFormat A WireFormat object used to encode the input. If omitted, use WireFormat getDefaultWireFormat().\n   *\/\n  void \n  signData(Data& data, const Name& signerName = Name(), bool byKeyName = true, WireFormat& wireFormat = *WireFormat::getDefaultWireFormat());\n\n  \/**\n   * Check the signature on the Data object and call either onVerify or onVerifyFailed. \n   * We use callback functions because verify may fetch information to check the signature.\n   * @param data\n   * @param onVerified\n   * @param onVerifyFailed\n   *\/\n  void\n  verifyData(const ptr_lib::shared_ptr<Data>& data, const OnVerified& onVerified, const OnVerifyFailed& onVerifyFailed);\n\n  \/**\n   * Set the Face which will be used to fetch required certificates.\n   * @param face A pointer to the Face object.\n   *\/\n  void\n  setFace(Face* face) { face_ = face; }\n\nprivate:\n  ptr_lib::shared_ptr<IdentityManager> identityManager_;\n  Face* face_;\n  const int maxSteps_;\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 \"net\/base\/ssl_config_service.h\"\n#include \"net\/base\/ssl_false_start_blacklist.h\"\n\n#if defined(OS_WIN)\n#include \"net\/base\/ssl_config_service_win.h\"\n#elif defined(OS_MACOSX)\n#include \"net\/base\/ssl_config_service_mac.h\"\n#else\n#include \"net\/base\/ssl_config_service_defaults.h\"\n#endif\n\nnamespace net {\n\nSSLConfig::CertAndStatus::CertAndStatus() {}\n\nSSLConfig::CertAndStatus::~CertAndStatus() {}\n\nSSLConfig::SSLConfig()\n    : rev_checking_enabled(true),  ssl2_enabled(false), ssl3_enabled(true),\n      tls1_enabled(true), dnssec_enabled(false), snap_start_enabled(false),\n      mitm_proxies_allowed(false), false_start_enabled(true),\n      send_client_cert(false), verify_ev_cert(false), ssl3_fallback(false) {\n}\n\nSSLConfig::~SSLConfig() {\n}\n\nbool SSLConfig::IsAllowedBadCert(X509Certificate* cert) const {\n  for (size_t i = 0; i < allowed_bad_certs.size(); ++i) {\n    if (cert == allowed_bad_certs[i].cert)\n      return true;\n  }\n  return false;\n}\n\nSSLConfigService::SSLConfigService()\n    : observer_list_(ObserverList<Observer>::NOTIFY_EXISTING_ONLY) {\n}\n\nSSLConfigService::~SSLConfigService() {\n}\n\n\/\/ static\nSSLConfigService* SSLConfigService::CreateSystemSSLConfigService() {\n#if defined(OS_WIN)\n  return new SSLConfigServiceWin;\n#elif defined(OS_MACOSX)\n  return new SSLConfigServiceMac;\n#else\n  return new SSLConfigServiceDefaults;\n#endif\n}\n\n\/\/ static\nbool SSLConfigService::IsKnownStrictTLSServer(const std::string& hostname) {\n  \/\/ If you wish to add an entry to this list, please contact agl AT chromium\n  \/\/ DOT org.\n  \/\/\n  \/\/ If this list starts growing, it'll need to be something more efficient\n  \/\/ than a linear list.\n  static const char kStrictServers[][22] = {\n      \"www.google.com\",\n      \"mail.google.com\",\n      \"www.gmail.com\",\n      \"docs.google.com\",\n      \"clients1.google.com\",\n      \"sunshinepress.org\",\n      \"www.sunshinepress.org\",\n\n      \/\/ Removed until we update the XMPP servers with the renegotiation\n      \/\/ extension.\n      \/\/ \"gmail.com\",\n  };\n\n  for (size_t i = 0; i < arraysize(kStrictServers); i++) {\n    \/\/ Note that the hostname is normalised to lower-case by this point.\n    if (strcmp(hostname.c_str(), kStrictServers[i]) == 0)\n      return true;\n  }\n\n  return false;\n}\n\n\/\/ static\nbool SSLConfigService::IsKnownFalseStartIncompatibleServer(\n    const std::string& hostname) {\n  return SSLFalseStartBlacklist::IsMember(hostname.c_str());\n}\n\nstatic bool g_dnssec_enabled = false;\nstatic bool g_false_start_enabled = true;\nstatic bool g_mitm_proxies_allowed = false;\nstatic bool g_snap_start_enabled = false;\n\n\/\/ static\nvoid SSLConfigService::SetSSLConfigFlags(SSLConfig* ssl_config) {\n  ssl_config->dnssec_enabled = g_dnssec_enabled;\n  ssl_config->false_start_enabled = g_false_start_enabled;\n  ssl_config->mitm_proxies_allowed = g_mitm_proxies_allowed;\n  ssl_config->snap_start_enabled = g_snap_start_enabled;\n}\n\n\/\/ static\nvoid SSLConfigService::EnableDNSSEC() {\n  g_dnssec_enabled = true;\n}\n\n\/\/ static\nbool SSLConfigService::dnssec_enabled() {\n  return g_dnssec_enabled;\n}\n\n\/\/ static\nvoid SSLConfigService::EnableSnapStart() {\n  g_snap_start_enabled = true;\n}\n\n\/\/ static\nbool SSLConfigService::snap_start_enabled() {\n  return g_snap_start_enabled;\n}\n\n\/\/ static\nvoid SSLConfigService::DisableFalseStart() {\n  g_false_start_enabled = false;\n}\n\n\/\/ static\nbool SSLConfigService::false_start_enabled() {\n  return g_false_start_enabled;\n}\n\n\/\/ static\nvoid SSLConfigService::AllowMITMProxies() {\n  g_mitm_proxies_allowed = true;\n}\n\n\/\/ static\nbool SSLConfigService::mitm_proxies_allowed() {\n  return g_mitm_proxies_allowed;\n}\n\nvoid SSLConfigService::AddObserver(Observer* observer) {\n  observer_list_.AddObserver(observer);\n}\n\nvoid SSLConfigService::RemoveObserver(Observer* observer) {\n  observer_list_.RemoveObserver(observer);\n}\n\nvoid SSLConfigService::ProcessConfigUpdate(const SSLConfig& orig_config,\n                                           const SSLConfig& new_config) {\n  if (orig_config.rev_checking_enabled != new_config.rev_checking_enabled ||\n      orig_config.ssl2_enabled != new_config.ssl2_enabled ||\n      orig_config.ssl3_enabled != new_config.ssl3_enabled ||\n      orig_config.tls1_enabled != new_config.tls1_enabled) {\n    FOR_EACH_OBSERVER(Observer, observer_list_, OnSSLConfigChanged());\n  }\n}\n\n}  \/\/ namespace net\n<commit_msg>SSLConfig struct CertAndStatus is not initializing all its members.<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\/base\/ssl_config_service.h\"\n#include \"net\/base\/ssl_false_start_blacklist.h\"\n\n#if defined(OS_WIN)\n#include \"net\/base\/ssl_config_service_win.h\"\n#elif defined(OS_MACOSX)\n#include \"net\/base\/ssl_config_service_mac.h\"\n#else\n#include \"net\/base\/ssl_config_service_defaults.h\"\n#endif\n\nnamespace net {\n\nSSLConfig::CertAndStatus::CertAndStatus() : cert_status(0) {}\n\nSSLConfig::CertAndStatus::~CertAndStatus() {}\n\nSSLConfig::SSLConfig()\n    : rev_checking_enabled(true),  ssl2_enabled(false), ssl3_enabled(true),\n      tls1_enabled(true), dnssec_enabled(false), snap_start_enabled(false),\n      mitm_proxies_allowed(false), false_start_enabled(true),\n      send_client_cert(false), verify_ev_cert(false), ssl3_fallback(false) {\n}\n\nSSLConfig::~SSLConfig() {\n}\n\nbool SSLConfig::IsAllowedBadCert(X509Certificate* cert) const {\n  for (size_t i = 0; i < allowed_bad_certs.size(); ++i) {\n    if (cert == allowed_bad_certs[i].cert)\n      return true;\n  }\n  return false;\n}\n\nSSLConfigService::SSLConfigService()\n    : observer_list_(ObserverList<Observer>::NOTIFY_EXISTING_ONLY) {\n}\n\nSSLConfigService::~SSLConfigService() {\n}\n\n\/\/ static\nSSLConfigService* SSLConfigService::CreateSystemSSLConfigService() {\n#if defined(OS_WIN)\n  return new SSLConfigServiceWin;\n#elif defined(OS_MACOSX)\n  return new SSLConfigServiceMac;\n#else\n  return new SSLConfigServiceDefaults;\n#endif\n}\n\n\/\/ static\nbool SSLConfigService::IsKnownStrictTLSServer(const std::string& hostname) {\n  \/\/ If you wish to add an entry to this list, please contact agl AT chromium\n  \/\/ DOT org.\n  \/\/\n  \/\/ If this list starts growing, it'll need to be something more efficient\n  \/\/ than a linear list.\n  static const char kStrictServers[][22] = {\n      \"www.google.com\",\n      \"mail.google.com\",\n      \"www.gmail.com\",\n      \"docs.google.com\",\n      \"clients1.google.com\",\n      \"sunshinepress.org\",\n      \"www.sunshinepress.org\",\n\n      \/\/ Removed until we update the XMPP servers with the renegotiation\n      \/\/ extension.\n      \/\/ \"gmail.com\",\n  };\n\n  for (size_t i = 0; i < arraysize(kStrictServers); i++) {\n    \/\/ Note that the hostname is normalised to lower-case by this point.\n    if (strcmp(hostname.c_str(), kStrictServers[i]) == 0)\n      return true;\n  }\n\n  return false;\n}\n\n\/\/ static\nbool SSLConfigService::IsKnownFalseStartIncompatibleServer(\n    const std::string& hostname) {\n  return SSLFalseStartBlacklist::IsMember(hostname.c_str());\n}\n\nstatic bool g_dnssec_enabled = false;\nstatic bool g_false_start_enabled = true;\nstatic bool g_mitm_proxies_allowed = false;\nstatic bool g_snap_start_enabled = false;\n\n\/\/ static\nvoid SSLConfigService::SetSSLConfigFlags(SSLConfig* ssl_config) {\n  ssl_config->dnssec_enabled = g_dnssec_enabled;\n  ssl_config->false_start_enabled = g_false_start_enabled;\n  ssl_config->mitm_proxies_allowed = g_mitm_proxies_allowed;\n  ssl_config->snap_start_enabled = g_snap_start_enabled;\n}\n\n\/\/ static\nvoid SSLConfigService::EnableDNSSEC() {\n  g_dnssec_enabled = true;\n}\n\n\/\/ static\nbool SSLConfigService::dnssec_enabled() {\n  return g_dnssec_enabled;\n}\n\n\/\/ static\nvoid SSLConfigService::EnableSnapStart() {\n  g_snap_start_enabled = true;\n}\n\n\/\/ static\nbool SSLConfigService::snap_start_enabled() {\n  return g_snap_start_enabled;\n}\n\n\/\/ static\nvoid SSLConfigService::DisableFalseStart() {\n  g_false_start_enabled = false;\n}\n\n\/\/ static\nbool SSLConfigService::false_start_enabled() {\n  return g_false_start_enabled;\n}\n\n\/\/ static\nvoid SSLConfigService::AllowMITMProxies() {\n  g_mitm_proxies_allowed = true;\n}\n\n\/\/ static\nbool SSLConfigService::mitm_proxies_allowed() {\n  return g_mitm_proxies_allowed;\n}\n\nvoid SSLConfigService::AddObserver(Observer* observer) {\n  observer_list_.AddObserver(observer);\n}\n\nvoid SSLConfigService::RemoveObserver(Observer* observer) {\n  observer_list_.RemoveObserver(observer);\n}\n\nvoid SSLConfigService::ProcessConfigUpdate(const SSLConfig& orig_config,\n                                           const SSLConfig& new_config) {\n  if (orig_config.rev_checking_enabled != new_config.rev_checking_enabled ||\n      orig_config.ssl2_enabled != new_config.ssl2_enabled ||\n      orig_config.ssl3_enabled != new_config.ssl3_enabled ||\n      orig_config.tls1_enabled != new_config.tls1_enabled) {\n    FOR_EACH_OBSERVER(Observer, observer_list_, OnSSLConfigChanged());\n  }\n}\n\n}  \/\/ namespace net\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n\n  nomlib - C++11 cross-platform game engine\n\nCopyright (c) 2013, Jeffrey Carpenter <jeffrey.carp@gmail.com>\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n\n1. Redistributions of source code must retain the above copyright notice, this\n   list of conditions and the following disclaimer.\n2. Redistributions in binary form must reproduce the above copyright notice,\n   this list of conditions and the following disclaimer in the documentation\n   and\/or other materials provided with the distribution.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\nANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\nWARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\nANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\nLOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\nON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n******************************************************************************\/\n#include \"App.hpp\"\n\nApp::App ( nom::int32 args_count, char* args[] )\n{\n  NOM_LOG_TRACE ( NOM );\n\n  nom::File dir;\n  \/\/ Use this class to obtain the platform's directory delimiter\n  nom::Path p;\n  \/\/ Form the PWD (parent working directory); this must be an absolute file\n  \/\/ path.\n  std::string pwd = \"\\0\";\n\n  \/\/ Define these definitions at build time via header files or passing\n  \/\/ manually to your compiler.\n  #if defined ( OSXAPP ) \/\/ OS X Application Bundle; assumes Darwin platform\n    \/\/ <app_name.app\/Contents\/Resources\n    pwd = nom::getBundleResourcePath();\n  #elif defined ( PLATFORM_WINDOWS )\n    pwd = APP_INSTALL_PREFIX + APP_NAME + p.native() + APP_RESOURCES_DIR;\n  #elif defined ( PLATFORM_POSIX ) \/\/ TODO \/ Assume POSIX-compatible platform\n    pwd = APP_INSTALL_PREFIX + p.native() + \"share\" + p.native() + APP_NAME + p.native() + APP_RESOURCES_DIR;\n  #else\n    pwd = dir.path ( args[0] ) + p.native() + APP_RESOURCES_DIR;\n  #endif\n\n  \/\/ Change the working directory to whatever pwd has been set to.\n  \/\/\n  \/\/ This should generally be done *after* processing command line\n  \/\/ arguments!\n  dir.setPath ( pwd );\n}\n\nApp::~App ( void )\n{\nNOM_LOG_TRACE ( NOM );\n}\n\nbool App::onInit ( void )\n{\n  nom::uint32 window_flags = SDL_WINDOW_RESIZABLE;\n\n  \/\/ optional flags below; accelerated rendering is the default when not\n  \/\/ specified:\n  \/\/\n  \/\/ nom::uint32 context_flags = SDL_RENDERER_ACCELERATED;\n\n  if ( this->context.create ( WINDOW_WIDTH, WINDOW_HEIGHT, window_flags \/*, context_flags*\/ ) == false )\n  {\n    return false;\n  }\n\n  if ( this->context.setWindowIcon ( RESOURCE_ICON ) == false )\n  {\n    \/\/ FIXME\n    \/\/ Jeffrey Carpenter <jeffrey.carp@gmail.com> @ 2013-10-01\n    \/\/return false;\n  }\n\n  this->context.setWindowTitle ( APP_NAME );\n\n  this->Running(); \/\/ If all is well, here goes nothing!\n\n  return true;\n}\n\nvoid App::onKeyDown ( nom::int32 key, nom::int32 mod )\n{\n  switch ( key )\n  {\n    default: break;\n\n    case SDLK_ESCAPE:\n    case SDLK_q: this->onQuit(); break;\n\n    case SDLK_BACKSLASH: this->toggleFPS(); break;\n\n    case SDLK_f:\n    {\n      if ( this->isFullScreen() == true )\n      {\n        this->context.toggleFullScreen ( 0 );\n        this->setFullScreen ( false );\n      }\n      else\n      {\n        this->context.toggleFullScreen ( SDL_WINDOW_FULLSCREEN_DESKTOP );\n        this->setFullScreen ( true );\n      }\n    }\n    break;\n  } \/\/ end switch key\n}\n\nnom::int32 App::Run ( void )\n{\n  this->update.start();\n  this->fps.start();\n\n  \/\/ 1. Events\n  \/\/ 2. Logic\n  \/\/ 3. Render\n  while ( this->isRunning() == true )\n  {\n    while ( this->PollEvents ( &this->event ) )\n    {\n      this->onEvent ( &this->event );\n    }\n\n    this->context.update();\n\n    if ( this->isFullScreen() == true )\n    {\n      this->context.clear ( nom::Color::NomPrimaryColorKey );\n    }\n    else\n    {\n      this->context.clear ( nom::Color::NomSecondaryColorKey );\n    }\n\n    \/\/this->background.Update( this->context.get() );\n    \/\/this->background.Draw();\n\n    this->fps.update();\n\n    \/\/ Refresh the frames per second at 1 second intervals\n    if ( this->update.ticks() > 1000 )\n    {\n      if ( this->getShowFPS() == true )\n      {\n        this->context.setWindowTitle ( APP_NAME + \" - \" + this->fps.asString() + '\\x20' + \"fps\" );\n      }\n      else\n      {\n        this->context.setWindowTitle ( APP_NAME );\n      }\n      this->update.restart();\n    }\n  } \/\/ end while isRunning() is true\n\n  return EXIT_SUCCESS;\n}\n\nnom::int32 main ( nom::int32 argc, char* argv[] )\n{\n  App game ( argc, argv );\n\n  if ( game.onInit() == false )\n  {\nNOM_LOG_ERR ( NOM_EXAMPLES, \"Could not initialize game.\" );\n    return EXIT_FAILURE;\n  }\n\n  return game.Run();\n\n  \/\/ END OF EXECUTION; anything beyond this comment will never get executed!\n}\n<commit_msg>Update FIXME comments<commit_after>\/******************************************************************************\n\n  nomlib - C++11 cross-platform game engine\n\nCopyright (c) 2013, Jeffrey Carpenter <jeffrey.carp@gmail.com>\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n\n1. Redistributions of source code must retain the above copyright notice, this\n   list of conditions and the following disclaimer.\n2. Redistributions in binary form must reproduce the above copyright notice,\n   this list of conditions and the following disclaimer in the documentation\n   and\/or other materials provided with the distribution.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\nANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\nWARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\nANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\nLOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\nON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n******************************************************************************\/\n#include \"App.hpp\"\n\nApp::App ( nom::int32 args_count, char* args[] )\n{\n  NOM_LOG_TRACE ( NOM );\n\n  nom::File dir;\n  \/\/ Use this class to obtain the platform's directory delimiter\n  nom::Path p;\n  \/\/ Form the PWD (parent working directory); this must be an absolute file\n  \/\/ path.\n  std::string pwd = \"\\0\";\n\n  \/\/ Define these definitions at build time via header files or passing\n  \/\/ manually to your compiler.\n  #if defined ( OSXAPP ) \/\/ OS X Application Bundle; assumes Darwin platform\n    \/\/ <app_name.app\/Contents\/Resources\n    pwd = nom::getBundleResourcePath();\n  #elif defined ( PLATFORM_WINDOWS )\n    pwd = APP_INSTALL_PREFIX + APP_NAME + p.native() + APP_RESOURCES_DIR;\n  #elif defined ( PLATFORM_POSIX ) \/\/ TODO \/ Assume POSIX-compatible platform\n    pwd = APP_INSTALL_PREFIX + p.native() + \"share\" + p.native() + APP_NAME + p.native() + APP_RESOURCES_DIR;\n  #else\n    pwd = dir.path ( args[0] ) + p.native() + APP_RESOURCES_DIR;\n  #endif\n\n  \/\/ Change the working directory to whatever pwd has been set to.\n  \/\/\n  \/\/ This should generally be done *after* processing command line\n  \/\/ arguments!\n  dir.setPath ( pwd );\n}\n\nApp::~App ( void )\n{\nNOM_LOG_TRACE ( NOM );\n}\n\nbool App::onInit ( void )\n{\n  nom::uint32 window_flags = SDL_WINDOW_RESIZABLE;\n\n  \/\/ optional flags below; accelerated rendering is the default when not\n  \/\/ specified:\n  \/\/\n  \/\/ nom::uint32 context_flags = SDL_RENDERER_ACCELERATED;\n\n  if ( this->context.create ( WINDOW_WIDTH, WINDOW_HEIGHT, window_flags \/*, context_flags*\/ ) == false )\n  {\n    return false;\n  }\n\n  if ( this->context.setWindowIcon ( RESOURCE_ICON ) == false )\n  {\n    \/\/ FIXME\n    \/\/ (Windows does not like this call for some reason!)\n    \/\/ Jeffrey Carpenter <jeffrey.carp@gmail.com> @ 2013-10-01\n    \/\/return false;\n  }\n\n  this->context.setWindowTitle ( APP_NAME );\n\n  this->Running(); \/\/ If all is well, here goes nothing!\n\n  return true;\n}\n\nvoid App::onKeyDown ( nom::int32 key, nom::int32 mod )\n{\n  switch ( key )\n  {\n    default: break;\n\n    case SDLK_ESCAPE:\n    case SDLK_q: this->onQuit(); break;\n\n    case SDLK_BACKSLASH: this->toggleFPS(); break;\n\n    case SDLK_f:\n    {\n      if ( this->isFullScreen() == true )\n      {\n        this->context.toggleFullScreen ( 0 );\n        this->setFullScreen ( false );\n      }\n      else\n      {\n        this->context.toggleFullScreen ( SDL_WINDOW_FULLSCREEN_DESKTOP );\n        this->setFullScreen ( true );\n      }\n    }\n    break;\n  } \/\/ end switch key\n}\n\nnom::int32 App::Run ( void )\n{\n  this->update.start();\n  this->fps.start();\n\n  \/\/ 1. Events\n  \/\/ 2. Logic\n  \/\/ 3. Render\n  while ( this->isRunning() == true )\n  {\n    while ( this->PollEvents ( &this->event ) )\n    {\n      this->onEvent ( &this->event );\n    }\n\n    this->context.update();\n\n    if ( this->isFullScreen() == true )\n    {\n      this->context.clear ( nom::Color::NomPrimaryColorKey );\n    }\n    else\n    {\n      this->context.clear ( nom::Color::NomSecondaryColorKey );\n    }\n\n    \/\/this->background.Update( this->context.get() );\n    \/\/this->background.Draw();\n\n    this->fps.update();\n\n    \/\/ Refresh the frames per second at 1 second intervals\n    if ( this->update.ticks() > 1000 )\n    {\n      if ( this->getShowFPS() == true )\n      {\n        this->context.setWindowTitle ( APP_NAME + \" - \" + this->fps.asString() + '\\x20' + \"fps\" );\n      }\n      else\n      {\n        this->context.setWindowTitle ( APP_NAME );\n      }\n      this->update.restart();\n    }\n  } \/\/ end while isRunning() is true\n\n  return EXIT_SUCCESS;\n}\n\nnom::int32 main ( nom::int32 argc, char* argv[] )\n{\n  App game ( argc, argv );\n\n  if ( game.onInit() == false )\n  {\nNOM_LOG_ERR ( NOM_EXAMPLES, \"Could not initialize game.\" );\n    return EXIT_FAILURE;\n  }\n\n  return game.Run();\n\n  \/\/ END OF EXECUTION; anything beyond this comment will never get executed!\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n *\n *  Copyright RTK 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#include \"rtkDigisensGeometryXMLFileReader.h\"\n\n#include <itksys\/SystemTools.hxx>\n#include <itkMetaDataObject.h>\n#include <itkVector.h>\n\nnamespace rtk\n{\n\nint\nDigisensGeometryXMLFileReader::\nCanReadFile(const char *name)\n{\n  if(!itksys::SystemTools::FileExists(name) ||\n     itksys::SystemTools::FileIsDirectory(name) ||\n     itksys::SystemTools::FileLength(name) == 0)\n    return 0;\n  return 1;\n}\n\nvoid\nDigisensGeometryXMLFileReader::\nStartElement(const char * name,const char ** itkNotUsed(atts))\n{\n  m_CurCharacterData = \"\";\n\n  if(m_TreeLevel==1)\n    {\n    if(itksys::SystemTools::Strucmp(name, \"Rotation\") == 0)\n      m_CurrentSection = ROTATION;\n    else if(itksys::SystemTools::Strucmp(name, \"XRay\") == 0)\n      m_CurrentSection = XRAY;\n    else if(itksys::SystemTools::Strucmp(name, \"Camera\") == 0)\n      m_CurrentSection = CAMERA;\n    else if(itksys::SystemTools::Strucmp(name, \"Radios\") == 0)\n      m_CurrentSection = RADIOS;\n    else if(itksys::SystemTools::Strucmp(name, \"Grid\") == 0)\n      m_CurrentSection = GRID;\n    else if(itksys::SystemTools::Strucmp(name, \"Processing\") == 0)\n      m_CurrentSection = PROCESSING;\n    else if(itksys::SystemTools::Strucmp(name, \"files\") == 0)\n      m_NumberOfFiles = 0;\n    }\n  m_TreeLevel++;\n}\n\nvoid\nDigisensGeometryXMLFileReader::\nEndElement(const char *name)\n{\n  typedef itk::Vector<double, 3> VectorThreeDType;\n\n#define ENCAPLULATE_META_DATA_3D(section, metaName) \\\n  if(m_CurrentSection == section && itksys::SystemTools::Strucmp(name, metaName) == 0) \\\n    { \\\n    VectorThreeDType vec; \\\n    std::istringstream iss(m_CurCharacterData); \\\n    iss >> vec; \\\n    itk::EncapsulateMetaData<VectorThreeDType>(m_Dictionary, #section metaName, vec); \\\n    }\n\n#define ENCAPLULATE_META_DATA_INTEGER(section, metaName) \\\n  if(m_CurrentSection == section && itksys::SystemTools::Strucmp(name, metaName) == 0) \\\n    { \\\n    int i = atoi(m_CurCharacterData.c_str() ); \\\n    itk::EncapsulateMetaData<int>(m_Dictionary, #section metaName, i); \\\n    }\n\n#define ENCAPLULATE_META_DATA_DOUBLE(section, metaName) \\\n  if(m_CurrentSection == section && itksys::SystemTools::Strucmp(name, metaName) == 0) \\\n    { \\\n    double d = atof(m_CurCharacterData.c_str() ); \\\n    itk::EncapsulateMetaData<double>(m_Dictionary, #section metaName, d); \\\n    }\n\n  ENCAPLULATE_META_DATA_3D(ROTATION, \"axis\");\n  ENCAPLULATE_META_DATA_3D(ROTATION, \"center\");\n  ENCAPLULATE_META_DATA_3D(XRAY, \"source\");\n  ENCAPLULATE_META_DATA_3D(CAMERA, \"reference\");\n  ENCAPLULATE_META_DATA_3D(CAMERA, \"normal\");\n  ENCAPLULATE_META_DATA_3D(CAMERA, \"horizontal\");\n  ENCAPLULATE_META_DATA_3D(CAMERA, \"vertical\");\n\n  ENCAPLULATE_META_DATA_INTEGER(CAMERA, \"pixelWidth\");\n  ENCAPLULATE_META_DATA_INTEGER(CAMERA, \"pixelHeight\");\n\n  ENCAPLULATE_META_DATA_DOUBLE(CAMERA, \"totalWidth\");\n  ENCAPLULATE_META_DATA_DOUBLE(CAMERA, \"totalHeight\");\n  ENCAPLULATE_META_DATA_DOUBLE(RADIOS, \"angularRange\");\n  ENCAPLULATE_META_DATA_DOUBLE(RADIOS, \"startAngle\");\n\n  if(m_CurrentSection == RADIOS && itksys::SystemTools::Strucmp(name, \"files\") == 0)\n    itk::EncapsulateMetaData<int>(m_Dictionary, \"RADIOSNumberOfFiles\", m_NumberOfFiles);\n\n  if(itksys::SystemTools::Strucmp(name, \"file\") == 0)\n    m_NumberOfFiles++;\n\n  m_TreeLevel--;\n}\n\nvoid\nDigisensGeometryXMLFileReader::\nCharacterDataHandler(const char *inData, int inLength)\n{\n  for(int i = 0; i < inLength; i++)\n    m_CurCharacterData = m_CurCharacterData + inData[i];\n}\n\n}\n<commit_msg>Fix for Digisens geometry (while preparing test!)<commit_after>\/*=========================================================================\n *\n *  Copyright RTK 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#include \"rtkDigisensGeometryXMLFileReader.h\"\n\n#include <itksys\/SystemTools.hxx>\n#include <itkMetaDataObject.h>\n#include <itkVector.h>\n\nnamespace rtk\n{\n\nint\nDigisensGeometryXMLFileReader::\nCanReadFile(const char *name)\n{\n  if(!itksys::SystemTools::FileExists(name) ||\n     itksys::SystemTools::FileIsDirectory(name) ||\n     itksys::SystemTools::FileLength(name) == 0)\n    return 0;\n  return 1;\n}\n\nvoid\nDigisensGeometryXMLFileReader::\nStartElement(const char * name,const char ** itkNotUsed(atts))\n{\n  m_CurCharacterData = \"\";\n\n  if(m_TreeLevel==1)\n    {\n    if(itksys::SystemTools::Strucmp(name, \"Rotation\") == 0)\n      m_CurrentSection = ROTATION;\n    else if(itksys::SystemTools::Strucmp(name, \"XRay\") == 0)\n      m_CurrentSection = XRAY;\n    else if(itksys::SystemTools::Strucmp(name, \"Camera\") == 0)\n      m_CurrentSection = CAMERA;\n    else if(itksys::SystemTools::Strucmp(name, \"Radios\") == 0)\n      {\n      m_CurrentSection = RADIOS;\n      m_NumberOfFiles = 0;\n      }\n    else if(itksys::SystemTools::Strucmp(name, \"Grid\") == 0)\n      m_CurrentSection = GRID;\n    else if(itksys::SystemTools::Strucmp(name, \"Processing\") == 0)\n      m_CurrentSection = PROCESSING;\n    }\n  m_TreeLevel++;\n}\n\nvoid\nDigisensGeometryXMLFileReader::\nEndElement(const char *name)\n{\n  typedef itk::Vector<double, 3> VectorThreeDType;\n\n#define ENCAPLULATE_META_DATA_3D(section, metaName) \\\n  if(m_CurrentSection == section && itksys::SystemTools::Strucmp(name, metaName) == 0) \\\n    { \\\n    VectorThreeDType vec; \\\n    std::istringstream iss(m_CurCharacterData); \\\n    iss >> vec; \\\n    itk::EncapsulateMetaData<VectorThreeDType>(m_Dictionary, #section metaName, vec); \\\n    }\n\n#define ENCAPLULATE_META_DATA_INTEGER(section, metaName) \\\n  if(m_CurrentSection == section && itksys::SystemTools::Strucmp(name, metaName) == 0) \\\n    { \\\n    int i = atoi(m_CurCharacterData.c_str() ); \\\n    itk::EncapsulateMetaData<int>(m_Dictionary, #section metaName, i); \\\n    }\n\n#define ENCAPLULATE_META_DATA_DOUBLE(section, metaName) \\\n  if(m_CurrentSection == section && itksys::SystemTools::Strucmp(name, metaName) == 0) \\\n    { \\\n    double d = atof(m_CurCharacterData.c_str() ); \\\n    itk::EncapsulateMetaData<double>(m_Dictionary, #section metaName, d); \\\n    }\n\n  ENCAPLULATE_META_DATA_3D(ROTATION, \"axis\");\n  ENCAPLULATE_META_DATA_3D(ROTATION, \"center\");\n  ENCAPLULATE_META_DATA_3D(XRAY, \"source\");\n  ENCAPLULATE_META_DATA_3D(CAMERA, \"reference\");\n  ENCAPLULATE_META_DATA_3D(CAMERA, \"normal\");\n  ENCAPLULATE_META_DATA_3D(CAMERA, \"horizontal\");\n  ENCAPLULATE_META_DATA_3D(CAMERA, \"vertical\");\n\n  ENCAPLULATE_META_DATA_INTEGER(CAMERA, \"pixelWidth\");\n  ENCAPLULATE_META_DATA_INTEGER(CAMERA, \"pixelHeight\");\n\n  ENCAPLULATE_META_DATA_DOUBLE(CAMERA, \"totalWidth\");\n  ENCAPLULATE_META_DATA_DOUBLE(CAMERA, \"totalHeight\");\n  ENCAPLULATE_META_DATA_DOUBLE(RADIOS, \"angularRange\");\n  ENCAPLULATE_META_DATA_DOUBLE(RADIOS, \"startAngle\");\n\n  if(m_CurrentSection == RADIOS && itksys::SystemTools::Strucmp(name, \"files\") == 0)\n    itk::EncapsulateMetaData<int>(m_Dictionary, \"RADIOSNumberOfFiles\", m_NumberOfFiles);\n\n  if(itksys::SystemTools::Strucmp(name, \"file\") == 0)\n    m_NumberOfFiles++;\n\n  m_TreeLevel--;\n}\n\nvoid\nDigisensGeometryXMLFileReader::\nCharacterDataHandler(const char *inData, int inLength)\n{\n  for(int i = 0; i < inLength; i++)\n    m_CurCharacterData = m_CurCharacterData + inData[i];\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>`load::load_ASCII_grid`: check `x_step` & `z_step` for too small values.<commit_after><|endoftext|>"}
{"text":"<commit_before><commit_msg>`yli::load::load_ASCII_grid`: refactoring code.<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"texture_loader.hpp\"\n#include \"bmp_loader.hpp\"\n\n\/\/ Include GLEW\n#ifndef __GL_GLEW_H_INCLUDED\n#define __GL_GLEW_H_INCLUDED\n#include <GL\/glew.h> \/\/ GLfloat, GLuint etc.\n#endif\n\n\/\/ Include GLFW\n#ifndef __GLFW3_H_INCLUDED\n#define __GLFW3_H_INCLUDED\n#include <GLFW\/glfw3.h>\n#endif\n\n\/\/ Include standard headers\n#include <cstdio>   \/\/ std::FILE, std::fclose, std::fopen, std::fread, std::getchar, std::printf etc.\n#include <cstring>  \/\/ std::memcmp, std::strcmp, std::strlen, std::strncmp\n#include <iostream> \/\/ std::cout, std::cin, std::cerr\n#include <stdint.h> \/\/ uint32_t etc.\n#include <stdlib.h> \/\/ free, malloc\n#include <string>   \/\/ std::string\n\nnamespace loaders\n{\n    GLuint load_BMP_texture(const std::string& filename)\n    {\n        int32_t image_width;\n        int32_t image_height;\n        int32_t image_size;\n\n        uint32_t x_step = 1;\n        uint32_t z_step = 1;\n\n        uint8_t* image_data = load_BMP_file(filename, image_width, image_height, image_size);\n\n        \/\/ Create one OpenGL texture\n        GLuint textureID;\n        glGenTextures(1, &textureID);\n\n        \/\/ \"Bind\" the newly created texture : all future texture functions will modify this texture\n        glBindTexture(GL_TEXTURE_2D, textureID);\n\n        \/\/ Give the image to OpenGL\n        glTexImage2D(GL_TEXTURE_2D, 0, GL_RGB, image_width, image_height, 0, GL_BGR, GL_UNSIGNED_BYTE, image_data);\n\n        \/\/ OpenGL has now copied the data. Free our own version\n        delete[] image_data;\n\n        \/\/ Poor filtering, or ...\n        \/\/glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);\n        \/\/glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);\n\n#define CLAMP_TEXTURES\n        \/\/ #define REPEAT_TEXTURES\n\n#ifdef CLAMP_TEXTURES\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#endif\n\n#ifdef REPEAT_TEXTURES\n        \/\/ ... nice trilinear filtering.\n        glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT);\n        glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT);\n#endif\n\n        glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n        glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR_MIPMAP_LINEAR);\n        glGenerateMipmap(GL_TEXTURE_2D);\n\n        \/\/ Return the ID of the texture we just created\n        return textureID;\n    }\n\n    \/\/ Since GLFW 3, glfwLoadTexture2D() has been removed. You have to use another texture loading library,\n    \/\/ or do it yourself (just like load_BMP_texture and load_DDS_texture)\n    \/\/GLuint loadTGA_glfw(const char*  imagepath){\n    \/\/\n    \/\/    \/\/ Create one OpenGL texture\n    \/\/    GLuint textureID;\n    \/\/    glGenTextures(1, &textureID);\n    \/\/\n    \/\/    \/\/ \"Bind\" the newly created texture : all future texture functions will modify this texture\n    \/\/    glBindTexture(GL_TEXTURE_2D, textureID);\n    \/\/\n    \/\/    \/\/ Read the file, call glTexImage2D with the right parameters\n    \/\/    glfwLoadTexture2D(imagepath, 0);\n    \/\/\n    \/\/    \/\/ Nice trilinear filtering.\n    \/\/    glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT);\n    \/\/    glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT);\n    \/\/    glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n    \/\/    glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR_MIPMAP_LINEAR);\n    \/\/    glGenerateMipmap(GL_TEXTURE_2D);\n    \/\/\n    \/\/    \/\/ Return the ID of the texture we just created\n    \/\/    return textureID;\n    \/\/}\n\n#define FOURCC_DXT1 0x31545844 \/\/ Equivalent to \"DXT1\" in ASCII\n#define FOURCC_DXT3 0x33545844 \/\/ Equivalent to \"DXT3\" in ASCII\n#define FOURCC_DXT5 0x35545844 \/\/ Equivalent to \"DXT5\" in ASCII\n\n    GLuint load_DDS_texture(const std::string& filename)\n    {\n        const char* imagepath = filename.c_str();\n\n        uint8_t header[124];\n        std::FILE* fp;\n\n        \/* try to open the file *\/\n        fp = std::fopen(imagepath, \"rb\");\n        if (fp == nullptr)\n        {\n            std::printf(\"%s could not be opened. Are you in the right directory ? Don't forget to read the FAQ !\\n\", imagepath);\n            return 0;\n        }\n\n        \/* verify the type of file *\/\n        const uint32_t dds_magic_number_size_in_bytes = 4; \/\/ \"DDS \"\n        char filecode[dds_magic_number_size_in_bytes];\n\n        if (std::fread(filecode, 1, dds_magic_number_size_in_bytes, fp) != dds_magic_number_size_in_bytes)\n        {\n            std::cerr << \"Error while reading \" << filename << \"\\n\";\n            std::fclose(fp);\n            return 0;\n        }\n\n        if (std::strncmp(filecode, \"DDS \", dds_magic_number_size_in_bytes) != 0)\n        {\n            std::fclose(fp);\n            return 0;\n        }\n\n        \/* get the surface desc *\/\n        \/\/ TODO: add check for file reading!\n        \/\/ TODO: store hardcoded value 4 into a variable.\n        std::fread(&header, 124, 1, fp);\n\n        uint32_t height      = *(uint32_t*) &header[8];\n        uint32_t width       = *(uint32_t*) &header[12];\n        uint32_t linearSize  = *(uint32_t*) &header[16];\n        uint32_t mipMapCount = *(uint32_t*) &header[24];\n        uint32_t fourCC      = *(uint32_t*) &header[80];\n\n        uint8_t* buffer;\n        uint32_t bufsize;\n        \/* how big is it going to be including all mipmaps? *\/\n        bufsize = mipMapCount > 1 ? linearSize * 2 : linearSize;\n        buffer = (uint8_t*) malloc(bufsize * sizeof(uint8_t));\n\n        \/\/ TODO: add check for file reading!\n        \/\/ TODO: store hardcoded value 4 into a variable.\n        std::fread(buffer, 1, bufsize, fp);\n        \/* close the file pointer *\/\n        std::fclose(fp);\n\n        uint32_t components = (fourCC == FOURCC_DXT1) ? 3 : 4;\n        uint32_t format;\n        switch(fourCC)\n        {\n            case FOURCC_DXT1:\n                format = GL_COMPRESSED_RGBA_S3TC_DXT1_EXT;\n                break;\n            case FOURCC_DXT3:\n                format = GL_COMPRESSED_RGBA_S3TC_DXT3_EXT;\n                break;\n            case FOURCC_DXT5:\n                format = GL_COMPRESSED_RGBA_S3TC_DXT5_EXT;\n                break;\n            default:\n                free(buffer);\n                return 0;\n        }\n\n        \/\/ Create one OpenGL texture\n        GLuint textureID;\n        glGenTextures(1, &textureID);\n\n        \/\/ \"Bind\" the newly created texture : all future texture functions will modify this texture\n        glBindTexture(GL_TEXTURE_2D, textureID);\n        glPixelStorei(GL_UNPACK_ALIGNMENT, 1);\n\n        uint32_t blockSize = (format == GL_COMPRESSED_RGBA_S3TC_DXT1_EXT) ? 8 : 16;\n        uint32_t offset = 0;\n\n        \/* load the mipmaps *\/\n        for (uint32_t level = 0; level < mipMapCount && (width || height); ++level)\n        {\n            uint32_t size = ((width + 3) \/ 4) * ((height + 3) \/ 4) * blockSize;\n            glCompressedTexImage2D(\n                    GL_TEXTURE_2D,\n                    level,\n                    format,\n                    width,\n                    height,\n                    0,\n                    size,\n                    buffer + offset);\n\n            offset += size;\n            width  \/= 2;\n            height \/= 2;\n\n            \/\/ Deal with Non-Power-Of-Two textures. This code is not included in the webpage to reduce clutter.\n            if (width < 1)\n            {\n                width = 1;\n            }\n            if (height < 1)\n            {\n                height = 1;\n            }\n        }\n        free(buffer);\n\n        return textureID;\n    }\n}\n<commit_msg>`loaders::load_DDS_texture`: added check for file reading.<commit_after>#include \"texture_loader.hpp\"\n#include \"bmp_loader.hpp\"\n\n\/\/ Include GLEW\n#ifndef __GL_GLEW_H_INCLUDED\n#define __GL_GLEW_H_INCLUDED\n#include <GL\/glew.h> \/\/ GLfloat, GLuint etc.\n#endif\n\n\/\/ Include GLFW\n#ifndef __GLFW3_H_INCLUDED\n#define __GLFW3_H_INCLUDED\n#include <GLFW\/glfw3.h>\n#endif\n\n\/\/ Include standard headers\n#include <cstdio>   \/\/ std::FILE, std::fclose, std::fopen, std::fread, std::getchar, std::printf etc.\n#include <cstring>  \/\/ std::memcmp, std::strcmp, std::strlen, std::strncmp\n#include <iostream> \/\/ std::cout, std::cin, std::cerr\n#include <stdint.h> \/\/ uint32_t etc.\n#include <stdlib.h> \/\/ free, malloc\n#include <string>   \/\/ std::string\n\nnamespace loaders\n{\n    GLuint load_BMP_texture(const std::string& filename)\n    {\n        int32_t image_width;\n        int32_t image_height;\n        int32_t image_size;\n\n        uint32_t x_step = 1;\n        uint32_t z_step = 1;\n\n        uint8_t* image_data = load_BMP_file(filename, image_width, image_height, image_size);\n\n        \/\/ Create one OpenGL texture\n        GLuint textureID;\n        glGenTextures(1, &textureID);\n\n        \/\/ \"Bind\" the newly created texture : all future texture functions will modify this texture\n        glBindTexture(GL_TEXTURE_2D, textureID);\n\n        \/\/ Give the image to OpenGL\n        glTexImage2D(GL_TEXTURE_2D, 0, GL_RGB, image_width, image_height, 0, GL_BGR, GL_UNSIGNED_BYTE, image_data);\n\n        \/\/ OpenGL has now copied the data. Free our own version\n        delete[] image_data;\n\n        \/\/ Poor filtering, or ...\n        \/\/glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);\n        \/\/glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);\n\n#define CLAMP_TEXTURES\n        \/\/ #define REPEAT_TEXTURES\n\n#ifdef CLAMP_TEXTURES\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#endif\n\n#ifdef REPEAT_TEXTURES\n        \/\/ ... nice trilinear filtering.\n        glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT);\n        glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT);\n#endif\n\n        glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n        glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR_MIPMAP_LINEAR);\n        glGenerateMipmap(GL_TEXTURE_2D);\n\n        \/\/ Return the ID of the texture we just created\n        return textureID;\n    }\n\n    \/\/ Since GLFW 3, glfwLoadTexture2D() has been removed. You have to use another texture loading library,\n    \/\/ or do it yourself (just like load_BMP_texture and load_DDS_texture)\n    \/\/GLuint loadTGA_glfw(const char*  imagepath){\n    \/\/\n    \/\/    \/\/ Create one OpenGL texture\n    \/\/    GLuint textureID;\n    \/\/    glGenTextures(1, &textureID);\n    \/\/\n    \/\/    \/\/ \"Bind\" the newly created texture : all future texture functions will modify this texture\n    \/\/    glBindTexture(GL_TEXTURE_2D, textureID);\n    \/\/\n    \/\/    \/\/ Read the file, call glTexImage2D with the right parameters\n    \/\/    glfwLoadTexture2D(imagepath, 0);\n    \/\/\n    \/\/    \/\/ Nice trilinear filtering.\n    \/\/    glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT);\n    \/\/    glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT);\n    \/\/    glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n    \/\/    glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR_MIPMAP_LINEAR);\n    \/\/    glGenerateMipmap(GL_TEXTURE_2D);\n    \/\/\n    \/\/    \/\/ Return the ID of the texture we just created\n    \/\/    return textureID;\n    \/\/}\n\n#define FOURCC_DXT1 0x31545844 \/\/ Equivalent to \"DXT1\" in ASCII\n#define FOURCC_DXT3 0x33545844 \/\/ Equivalent to \"DXT3\" in ASCII\n#define FOURCC_DXT5 0x35545844 \/\/ Equivalent to \"DXT5\" in ASCII\n\n    GLuint load_DDS_texture(const std::string& filename)\n    {\n        const char* imagepath = filename.c_str();\n\n        uint8_t header[124];\n        std::FILE* fp;\n\n        \/* try to open the file *\/\n        fp = std::fopen(imagepath, \"rb\");\n        if (fp == nullptr)\n        {\n            std::printf(\"%s could not be opened. Are you in the right directory ? Don't forget to read the FAQ !\\n\", imagepath);\n            return 0;\n        }\n\n        \/* verify the type of file *\/\n        const uint32_t dds_magic_number_size_in_bytes = 4; \/\/ \"DDS \"\n        char filecode[dds_magic_number_size_in_bytes];\n\n        if (std::fread(filecode, 1, dds_magic_number_size_in_bytes, fp) != dds_magic_number_size_in_bytes)\n        {\n            std::cerr << \"Error while reading \" << filename << \"\\n\";\n            std::fclose(fp);\n            return 0;\n        }\n\n        if (std::strncmp(filecode, \"DDS \", dds_magic_number_size_in_bytes) != 0)\n        {\n            std::fclose(fp);\n            return 0;\n        }\n\n        \/* get the surface desc *\/\n        if (std::fread(&header, 124, 1, fp) != 1)\n        {\n            std::cerr << \"Error while reading \" << filename << \"\\n\";\n            std::fclose(fp);\n            return 0;\n        }\n\n        uint32_t height      = *(uint32_t*) &header[8];\n        uint32_t width       = *(uint32_t*) &header[12];\n        uint32_t linearSize  = *(uint32_t*) &header[16];\n        uint32_t mipMapCount = *(uint32_t*) &header[24];\n        uint32_t fourCC      = *(uint32_t*) &header[80];\n\n        uint8_t* buffer;\n        uint32_t bufsize;\n        \/* how big is it going to be including all mipmaps? *\/\n        bufsize = mipMapCount > 1 ? linearSize * 2 : linearSize;\n        buffer = (uint8_t*) malloc(bufsize * sizeof(uint8_t));\n\n        \/\/ TODO: add check for file reading!\n        \/\/ TODO: store hardcoded value 4 into a variable.\n        std::fread(buffer, 1, bufsize, fp);\n        \/* close the file pointer *\/\n        std::fclose(fp);\n\n        uint32_t components = (fourCC == FOURCC_DXT1) ? 3 : 4;\n        uint32_t format;\n        switch(fourCC)\n        {\n            case FOURCC_DXT1:\n                format = GL_COMPRESSED_RGBA_S3TC_DXT1_EXT;\n                break;\n            case FOURCC_DXT3:\n                format = GL_COMPRESSED_RGBA_S3TC_DXT3_EXT;\n                break;\n            case FOURCC_DXT5:\n                format = GL_COMPRESSED_RGBA_S3TC_DXT5_EXT;\n                break;\n            default:\n                free(buffer);\n                return 0;\n        }\n\n        \/\/ Create one OpenGL texture\n        GLuint textureID;\n        glGenTextures(1, &textureID);\n\n        \/\/ \"Bind\" the newly created texture : all future texture functions will modify this texture\n        glBindTexture(GL_TEXTURE_2D, textureID);\n        glPixelStorei(GL_UNPACK_ALIGNMENT, 1);\n\n        uint32_t blockSize = (format == GL_COMPRESSED_RGBA_S3TC_DXT1_EXT) ? 8 : 16;\n        uint32_t offset = 0;\n\n        \/* load the mipmaps *\/\n        for (uint32_t level = 0; level < mipMapCount && (width || height); ++level)\n        {\n            uint32_t size = ((width + 3) \/ 4) * ((height + 3) \/ 4) * blockSize;\n            glCompressedTexImage2D(\n                    GL_TEXTURE_2D,\n                    level,\n                    format,\n                    width,\n                    height,\n                    0,\n                    size,\n                    buffer + offset);\n\n            offset += size;\n            width  \/= 2;\n            height \/= 2;\n\n            \/\/ Deal with Non-Power-Of-Two textures. This code is not included in the webpage to reduce clutter.\n            if (width < 1)\n            {\n                width = 1;\n            }\n            if (height < 1)\n            {\n                height = 1;\n            }\n        }\n        free(buffer);\n\n        return textureID;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Time:  push: O(n), pop: O(1), top: O(1)\n\/\/ Space: O(n)\n\nclass Stack {\npublic:\n    queue<int> q_;\n    \n    \/\/ Push element x onto stack.\n    void push(int x) {  \/\/ O(n)\n        q_.emplace(x);\n        for (int i = 0; i < q_.size() - 1; ++i) {\n            q_.emplace(q_.front());\n            q_.pop();\n        }\n    }\n\n    \/\/ Removes the element on top of the stack.\n    void pop() {  \/\/ O(1)\n        q_.pop();\n    }\n\n    \/\/ Get the top element.\n    int top() {  \/\/ O(1)\n        return q_.front();\n    }\n\n    \/\/ Return whether the stack is empty.\n    bool empty() {  \/\/ O(1)\n        return q_.empty();\n    }\n};\n\n\/\/ Time:  push: O(1), pop: O(n), top: O(1)\n\/\/ Space: O(n)\nclass Stack2 {\npublic:\n    queue<int> q_;\n    int top_;\n    \n    \/\/ Push element x onto stack.\n    void push(int x) {  \/\/ O(1)\n        q_.emplace(x);\n        top_ = x;\n    }\n\n    \/\/ Removes the element on top of the stack.\n    void pop() {  \/\/ O(n)\n        for (int i = 0; i < q_.size() - 1; ++i) {\n            top_ = q_.front();\n            q_.emplace(top_);\n            q_.pop();\n        }\n        q_.pop();\n    }\n\n    \/\/ Get the top element.\n    int top() {  \/\/ O(1)\n        return top_;\n    }\n\n    \/\/ Return whether the stack is empty.\n    bool empty() {  \/\/ O(1)\n        return q_.empty();\n    }\n};\n\n<commit_msg>Update implement-stack-using-queues.cpp<commit_after>\/\/ Time:  push: O(n), pop: O(1), top: O(1)\n\/\/ Space: O(n)\n\nclass Stack {\npublic:\n    queue<int> q_;\n    \n    \/\/ Push element x onto stack.\n    void push(int x) {  \/\/ O(n)\n        q_.emplace(x);\n        for (int i = 0; i < q_.size() - 1; ++i) {\n            q_.emplace(q_.front());\n            q_.pop();\n        }\n    }\n\n    \/\/ Remove the element on top of the stack.\n    void pop() {  \/\/ O(1)\n        q_.pop();\n    }\n\n    \/\/ Get the top element.\n    int top() {  \/\/ O(1)\n        return q_.front();\n    }\n\n    \/\/ Return whether the stack is empty.\n    bool empty() {  \/\/ O(1)\n        return q_.empty();\n    }\n};\n\n\/\/ Time:  push: O(1), pop: O(n), top: O(1)\n\/\/ Space: O(n)\nclass Stack2 {\npublic:\n    queue<int> q_;\n    int top_;\n    \n    \/\/ Push element x onto stack.\n    void push(int x) {  \/\/ O(1)\n        q_.emplace(x);\n        top_ = x;\n    }\n\n    \/\/ Remove the element on top of the stack.\n    void pop() {  \/\/ O(n)\n        for (int i = 0; i < q_.size() - 1; ++i) {\n            top_ = q_.front();\n            q_.emplace(top_);\n            q_.pop();\n        }\n        q_.pop();\n    }\n\n    \/\/ Get the top element.\n    int top() {  \/\/ O(1)\n        return top_;\n    }\n\n    \/\/ Return whether the stack is empty.\n    bool empty() {  \/\/ O(1)\n        return q_.empty();\n    }\n};\n\n<|endoftext|>"}
{"text":"<commit_before>template <class T>\nclass sref {\npublic:\n  sref(T* p = nullptr) : ptr_(p) {\n    if (ptr_)\n      ptr_->inc();\n  }\n\n  ~sref() {\n    if (ptr_)\n      ptr_->dec();\n  }\n\n  bool init(T* p) {\n    if (ptr_ || !p->tryinc())\n      return false;\n    ptr_ = p;\n    return true;\n  }\n\n  bool operator==(const sref<T>& pr) const { return ptr_ == pr.ptr_; }\n  bool operator!=(const sref<T>& pr) const { return ptr_ != pr.ptr_; }\n  bool operator==(T* p) const { return ptr_ == p; }\n  bool operator!=(T* p) const { return ptr_ != p; }\n\n  const T * operator->() const { return ptr_; }\n  T * operator->() { return ptr_; }\n  T * ptr() const { return ptr_; }\n\nprivate:\n  sref<T>& operator=(sref<T>& mp);\n  sref<T>& operator=(T* p);\n  sref<T>& operator=(const sref<T>& pr);\n  sref(const sref<T>& pr);\n\n  T *ptr_;\n};\n\nclass referenced {\npublic:\n  \/\/ Start with 1 reference\n  referenced() { ref_.v = 0; }\n\n  \/\/ The number of valid references is:\n  \/\/   ref_.invalid ? 0 : ref_.count+1;\n\n  inline bool valid() const {\n    return ref_.invalid == 0;\n  }\n\n  inline void inc() const {\n    \/\/ If references is 0 (i.e. ref_.count is 0xffffffff) a 32-bit \n    \/\/ increment will increases ref_.count to 0, but ref_.invalid\n    \/\/ will remain unchanged.\n    asm volatile(\"lock; incl %0\" : \"+m\" (ref_.count));\n  }\n\n  inline bool tryinc() const {\n    inc();\n    return valid();\n  }\n\n  inline void dec() const {\n    unsigned char c;\n    \/\/ If references is 1 (i.e. ref_.v is 0), a 64-bit decrement will\n    \/\/ underflow ref_.invalid to 0xffffffff (and ref_.count to 0xffffffff).\n    asm volatile(\"lock; decq %0; sets %1\" : \"+m\" (ref_.v), \"=qm\" (c));\n    if (c)\n      onzero();\n  }\n  \n  NEW_DELETE_OPS(referenced);\n\nprotected:\n  virtual ~referenced() { }\n  virtual void onzero() const { delete this; }\n\nprivate:\n  mutable union {\n    volatile u64 v;\n    struct {\n      volatile u32 count;\n      volatile u32 invalid;\n    };\n  } ref_;\n};\n<commit_msg>Add \"memory\" and \"cc\" to the clobbers of atomic instructions in ref.hh<commit_after>template <class T>\nclass sref {\npublic:\n  sref(T* p = nullptr) : ptr_(p) {\n    if (ptr_)\n      ptr_->inc();\n  }\n\n  ~sref() {\n    if (ptr_)\n      ptr_->dec();\n  }\n\n  bool init(T* p) {\n    if (ptr_ || !p->tryinc())\n      return false;\n    ptr_ = p;\n    return true;\n  }\n\n  bool operator==(const sref<T>& pr) const { return ptr_ == pr.ptr_; }\n  bool operator!=(const sref<T>& pr) const { return ptr_ != pr.ptr_; }\n  bool operator==(T* p) const { return ptr_ == p; }\n  bool operator!=(T* p) const { return ptr_ != p; }\n\n  const T * operator->() const { return ptr_; }\n  T * operator->() { return ptr_; }\n  T * ptr() const { return ptr_; }\n\nprivate:\n  sref<T>& operator=(sref<T>& mp);\n  sref<T>& operator=(T* p);\n  sref<T>& operator=(const sref<T>& pr);\n  sref(const sref<T>& pr);\n\n  T *ptr_;\n};\n\nclass referenced {\npublic:\n  \/\/ Start with 1 reference\n  referenced() { ref_.v = 0; }\n\n  \/\/ The number of valid references is:\n  \/\/   ref_.invalid ? 0 : ref_.count+1;\n\n  inline bool valid() const {\n    return ref_.invalid == 0;\n  }\n\n  inline void inc() const {\n    \/\/ If references is 0 (i.e. ref_.count is 0xffffffff) a 32-bit \n    \/\/ increment will increases ref_.count to 0, but ref_.invalid\n    \/\/ will remain unchanged.\n    asm volatile(\"lock; incl %0\" : \"+m\" (ref_.count) :: \"memory\", \"cc\");\n  }\n\n  inline bool tryinc() const {\n    inc();\n    return valid();\n  }\n\n  inline void dec() const {\n    unsigned char c;\n    \/\/ If references is 1 (i.e. ref_.v is 0), a 64-bit decrement will\n    \/\/ underflow ref_.invalid to 0xffffffff (and ref_.count to 0xffffffff).\n    asm volatile(\"lock; decq %0; sets %1\" : \"+m\" (ref_.v), \"=qm\" (c) \n                 :: \"memory\", \"cc\");\n    if (c)\n      onzero();\n  }\n  \n  NEW_DELETE_OPS(referenced);\n\nprotected:\n  virtual ~referenced() { }\n  virtual void onzero() const { delete this; }\n\nprivate:\n  mutable union {\n    volatile u64 v;\n    struct {\n      volatile u32 count;\n      volatile u32 invalid;\n    };\n  } ref_;\n};\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Time:  ctor:   O(m * n)\n\/\/        lookup: O(1)\n\/\/ Space: O(m * n)\n\nclass NumMatrix {\npublic:\n    NumMatrix(vector<vector<int>> &matrix) {\n        if (matrix.empty()) {\n            return;\n        }\n\n        const auto m = matrix.size(), n = matrix[0].size();\n        for (int i = 0; i <= m; ++i) {\n            sums.emplace_back(n + 1, 0);\n        }\n        for (int i = 1; i <= m; ++i) {\n            for (int j = 0; j <= n; ++j) {\n                sums[i][j] = sums[i][j - 1] + matrix[i - 1][j - 1] ;\n            }\n        }\n        for (int j = 0; j <= n; ++j) {\n            for (int i = 1; i <= m; ++i) {\n                sums[i][j] += sums[i - 1][j];\n            }\n        }\n    }\n\n    int sumRegion(int row1, int col1, int row2, int col2) {\n        return sums[row2+1][col2+1] - sums[row2+1][col1] - \n               sums[row1][col2+1] + sums[row1][col1];   \n    }\n\nprivate:\n    vector<vector<int>> sums;\n};\n\n\n\/\/ Your NumMatrix object will be instantiated and called as such:\n\/\/ NumMatrix numMatrix(matrix);\n\/\/ numMatrix.sumRegion(0, 1, 2, 3);\n\/\/ numMatrix.sumRegion(1, 2, 3, 4);\n<commit_msg>Update range-sum-query-2d-immutable.cpp<commit_after>\/\/ Time:  ctor:   O(m * n)\n\/\/        lookup: O(1)\n\/\/ Space: O(m * n)\n\nclass NumMatrix {\npublic:\n    NumMatrix(vector<vector<int>> &matrix) {\n        if (matrix.empty()) {\n            return;\n        }\n\n        const auto m = matrix.size(), n = matrix[0].size();\n        for (int i = 0; i <= m; ++i) {\n            sums.emplace_back(n + 1, 0);\n        }\n        for (int i = 1; i <= m; ++i) {\n            for (int j = 0; j <= n; ++j) {\n                sums[i][j] = sums[i][j - 1] + matrix[i - 1][j - 1];\n            }\n        }\n        for (int j = 0; j <= n; ++j) {\n            for (int i = 1; i <= m; ++i) {\n                sums[i][j] += sums[i - 1][j];\n            }\n        }\n    }\n\n    int sumRegion(int row1, int col1, int row2, int col2) {\n        return sums[row2+1][col2+1] - sums[row2+1][col1] - \n               sums[row1][col2+1] + sums[row1][col1];   \n    }\n\nprivate:\n    vector<vector<int>> sums;\n};\n\n\n\/\/ Your NumMatrix object will be instantiated and called as such:\n\/\/ NumMatrix numMatrix(matrix);\n\/\/ numMatrix.sumRegion(0, 1, 2, 3);\n\/\/ numMatrix.sumRegion(1, 2, 3, 4);\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Time:  O(m * n * l), A is m x n matrix, B is n x l matrix\n\/\/ Space: O(m * l)\n\nclass Solution {\npublic:\n    vector<vector<int>> multiply(vector<vector<int>>& A, vector<vector<int>>& B) {\n        const int m = A.size(), n = A[0].size(), l = B[0].size();\n        vector<vector<int>> res(m, vector<int>(l));\n        for (int i = 0; i < m; ++i) {\n            for (int k = 0; k < n; ++k) {\n                if (A[i][k] != 0) {\n                    for (int j = 0; j < l; ++j) {\n                        res[i][j] += A[i][k] * B[k][j];\n                    }\n                }\n            }\n        }\n        return res;\n    }\n};\n<commit_msg>Update sparse-matrix-multiplication.cpp<commit_after>\/\/ Time:  O(m * n * l), A is m x n matrix, B is n x l matrix\n\/\/ Space: O(m * l)\n\nclass Solution {\npublic:\n    vector<vector<int>> multiply(vector<vector<int>>& A, vector<vector<int>>& B) {\n        const int m = A.size(), n = A[0].size(), l = B[0].size();\n        vector<vector<int>> res(m, vector<int>(l));\n        for (int i = 0; i < m; ++i) {\n            for (int k = 0; k < n; ++k) {\n                if (A[i][k]) {\n                    for (int j = 0; j < l; ++j) {\n                        res[i][j] += A[i][k] * B[k][j];\n                    }\n                }\n            }\n        }\n        return res;\n    }\n};\n<|endoftext|>"}
{"text":"<commit_before>\n\/* 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_FLASH\n#error [NOT_SUPPORTED] Flash API not supported for this target\n#endif\n\n#include \"utest\/utest.h\"\n#include \"utest\/utest_serial.h\"\n#include \"unity\/unity.h\"\n#include \"greentea-client\/test_env.h\"\n#include \"FlashIAP.h\"\n#include \"unity.h\"\n#include <algorithm>\n\n#include \"mbed.h\"\n\nusing namespace utest::v1;\n\n\nvoid flashiap_init_test()\n{\n    FlashIAP flash_device;\n    uint32_t ret = flash_device.init();\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n    ret = flash_device.deinit();\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n}\n\nvoid flashiap_program_test()\n{\n    FlashIAP flash_device;\n    uint32_t ret = flash_device.init();\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n\n    \/\/ get the last sector size (flash size - 1)\n    uint32_t sector_size = flash_device.get_sector_size(flash_device.get_flash_start() + flash_device.get_flash_size() - 1UL);\n    uint32_t page_size = flash_device.get_page_size();\n    TEST_ASSERT_NOT_EQUAL(0, sector_size);\n    TEST_ASSERT_NOT_EQUAL(0, page_size);\n    TEST_ASSERT_TRUE(sector_size % page_size == 0);\n    uint32_t prog_size = std::max(page_size, (uint32_t)8);\n    uint8_t *data = new uint8_t[prog_size + 2];\n\n    \/\/ the one before the last sector in the system\n    uint32_t address = (flash_device.get_flash_start() + flash_device.get_flash_size()) - (sector_size);\n    TEST_ASSERT_TRUE(address != 0UL);\n    utest_printf(\"ROM ends at 0x%lx, test starts at 0x%lx\\n\", FLASHIAP_APP_ROM_END_ADDR, address);\n    TEST_SKIP_UNLESS_MESSAGE(address >= FLASHIAP_APP_ROM_END_ADDR, \"Test skipped. Test region overlaps code.\");\n\n    ret = flash_device.erase(address, sector_size);\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n\n    uint8_t erase_val = flash_device.get_erase_value();\n    memset(data, erase_val, prog_size);\n\n    uint8_t *data_flashed = new uint8_t[prog_size];\n    for (uint32_t i = 0; i < sector_size \/ prog_size; i++) {\n        uint32_t page_addr = address + i * prog_size;\n        ret = flash_device.read(data_flashed, page_addr, prog_size);\n        TEST_ASSERT_EQUAL_INT32(0, ret);\n        TEST_ASSERT_EQUAL_UINT8_ARRAY(data, data_flashed, prog_size);\n    }\n\n    for (uint32_t i = 0; i < prog_size + 2; i++) {\n        data[i] = i;\n    }\n\n    for (uint32_t i = 0; i < sector_size \/ prog_size; i++) {\n        uint32_t prog_addr = address + i * prog_size;\n        ret = flash_device.program(data, prog_addr, prog_size);\n        TEST_ASSERT_EQUAL_INT32(0, ret);\n    }\n\n    for (uint32_t i = 0; i < sector_size \/ prog_size; i++) {\n        uint32_t page_addr = address + i * prog_size;\n        ret = flash_device.read(data_flashed, page_addr, prog_size);\n        TEST_ASSERT_EQUAL_INT32(0, ret);\n        TEST_ASSERT_EQUAL_UINT8_ARRAY(data, data_flashed, prog_size);\n    }\n\n    \/\/ check programming of unaligned buffer and size\n    ret = flash_device.erase(address, sector_size);\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n    ret = flash_device.program(data + 2, address, prog_size);\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n    ret = flash_device.read(data_flashed, address, prog_size - 1);\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n    TEST_ASSERT_EQUAL_UINT8_ARRAY(data + 2, data_flashed, prog_size - 1);\n\n    delete[] data;\n    delete[] data_flashed;\n\n    ret = flash_device.deinit();\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n}\n\n\nvoid flashiap_cross_sector_program_test()\n{\n    FlashIAP flash_device;\n    uint32_t ret = flash_device.init();\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n\n    uint32_t page_size = flash_device.get_page_size();\n\n    \/\/ Erase last two sectors\n    uint32_t address = flash_device.get_flash_start() + flash_device.get_flash_size();\n    uint32_t sector_size, agg_size = 0;\n    for (uint32_t i = 0; i < 2; i++) {\n        sector_size = flash_device.get_sector_size(address - 1UL);\n        TEST_ASSERT_NOT_EQUAL(0, sector_size);\n        TEST_ASSERT_TRUE(sector_size % page_size == 0);\n        agg_size += sector_size;\n        address -= sector_size;\n    }\n    utest_printf(\"ROM ends at 0x%lx, test starts at 0x%lx\\n\", FLASHIAP_APP_ROM_END_ADDR, address);\n    TEST_SKIP_UNLESS_MESSAGE(address >= FLASHIAP_APP_ROM_END_ADDR, \"Test skipped. Test region overlaps code.\");\n    ret = flash_device.erase(address, agg_size);\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n\n    address += sector_size - page_size;\n    uint32_t aligned_prog_size = 2 * page_size;\n    uint32_t prog_size = aligned_prog_size;\n    if (page_size > 1) {\n        prog_size--;\n    }\n    uint8_t *data = new uint8_t[aligned_prog_size];\n    for (uint32_t i = 0; i < prog_size; i++) {\n        data[i] = rand() % 256;\n    }\n    for (uint32_t i = prog_size; i < aligned_prog_size; i++) {\n        data[i] = 0xFF;\n    }\n\n    ret = flash_device.program(data, address, prog_size);\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n\n    uint8_t *data_flashed = new uint8_t[aligned_prog_size];\n    ret = flash_device.read(data_flashed, address, aligned_prog_size);\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n    TEST_ASSERT_EQUAL_UINT8_ARRAY(data, data_flashed, aligned_prog_size);\n\n    delete[] data;\n    delete[] data_flashed;\n\n    ret = flash_device.deinit();\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n}\n\nvoid flashiap_program_error_test()\n{\n    FlashIAP flash_device;\n    uint32_t ret = flash_device.init();\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n\n    \/\/ get the last sector size (flash size - 1)\n    uint32_t sector_size = flash_device.get_sector_size(flash_device.get_flash_start() + flash_device.get_flash_size() - 1UL);\n    uint32_t page_size = flash_device.get_page_size();\n    TEST_ASSERT_NOT_EQUAL(0, sector_size);\n    TEST_ASSERT_NOT_EQUAL(0, page_size);\n    TEST_ASSERT_TRUE(sector_size % page_size == 0);\n    const uint8_t test_value = 0xCE;\n    uint8_t *data = new uint8_t[page_size];\n    for (uint32_t i = 0; i < page_size; i++) {\n        data[i] = test_value;\n    }\n\n    \/\/ the one before the last page in the system\n    uint32_t address = (flash_device.get_flash_start() + flash_device.get_flash_size()) - (sector_size);\n    TEST_ASSERT_TRUE(address != 0UL);\n\n    \/\/ unaligned address\n    utest_printf(\"ROM ends at 0x%lx, test starts at 0x%lx\\n\", FLASHIAP_APP_ROM_END_ADDR, address);\n    TEST_SKIP_UNLESS_MESSAGE(address >= FLASHIAP_APP_ROM_END_ADDR, \"Test skipped. Test region overlaps code.\");\n    ret = flash_device.erase(address + 1, sector_size);\n    TEST_ASSERT_EQUAL_INT32(-1, ret);\n    if (flash_device.get_page_size() > 1) {\n        ret = flash_device.program(data, address + 1, page_size);\n        TEST_ASSERT_EQUAL_INT32(-1, ret);\n    }\n\n    delete[] data;\n\n    ret = flash_device.deinit();\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n}\n\nvoid flashiap_timing_test()\n{\n    FlashIAP flash_device;\n    uint32_t ret = flash_device.init();\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n    mbed::Timer timer;\n    unsigned int num_write_sizes;\n    unsigned int curr_time, byte_usec_ratio;\n    unsigned int avg_erase_time = 0;\n    unsigned int max_erase_time = 0, min_erase_time = (unsigned int) -1;\n    const unsigned int max_writes = 128;\n    const unsigned int max_write_sizes = 6;\n    const unsigned int max_byte_usec_ratio = 200;\n\n    uint32_t page_size = flash_device.get_page_size();\n    uint32_t write_size = page_size;\n\n    uint32_t end_address = flash_device.get_flash_start() + flash_device.get_flash_size();\n\n    utest_printf(\"\\nFlash timing:\\n\");\n    uint32_t sector_size = flash_device.get_sector_size(end_address - 1UL);\n    uint32_t base_address = end_address - sector_size;\n    utest_printf(\"ROM ends at 0x%lx, test starts at 0x%lx\\n\", FLASHIAP_APP_ROM_END_ADDR, base_address);\n    TEST_SKIP_UNLESS_MESSAGE(base_address >= FLASHIAP_APP_ROM_END_ADDR, \"Test skipped. Test region overlaps code.\");\n\n    timer.start();\n    for (num_write_sizes = 0; num_write_sizes < max_write_sizes; num_write_sizes++) {\n        if (write_size > sector_size) {\n            break;\n        }\n        uint8_t *buf = new (std::nothrow) uint8_t[write_size];\n        if (!buf) {\n            \/\/ Don't fail the test on lack of heap memory for the buffer\n            break;\n        }\n        memset(buf, 0x5A, write_size);\n        timer.reset();\n        ret = flash_device.erase(base_address, sector_size);\n        curr_time = timer.read_us();\n        avg_erase_time += curr_time;\n        TEST_ASSERT_EQUAL_INT32(0, ret);\n        max_erase_time = std::max(max_erase_time, curr_time);\n        min_erase_time = std::min(min_erase_time, curr_time);\n        uint32_t address = base_address;\n        unsigned int avg_write_time = 0;\n        unsigned int max_write_time = 0, min_write_time = (unsigned int) -1;\n        unsigned int num_writes;\n        for (num_writes = 0; num_writes < max_writes; num_writes++) {\n            if ((address + write_size) > end_address) {\n                break;\n            }\n            timer.reset();\n            ret = flash_device.program(buf, address, write_size);\n            curr_time = timer.read_us();\n            avg_write_time += curr_time;\n            TEST_ASSERT_EQUAL_INT32(0, ret);\n            max_write_time = std::max(max_write_time, curr_time);\n            min_write_time = std::min(min_write_time, curr_time);\n            address += write_size;\n        }\n        delete[] buf;\n        avg_write_time \/= num_writes;\n        utest_printf(\"Write size %6u bytes: avg %10u, min %10u, max %10u (usec)\\n\",\n                     write_size, avg_write_time, min_write_time, max_write_time);\n        byte_usec_ratio = write_size \/ avg_write_time;\n        TEST_ASSERT(byte_usec_ratio < max_byte_usec_ratio);\n        write_size *= 4;\n    }\n\n    if (num_write_sizes) {\n        avg_erase_time \/= num_write_sizes;\n        utest_printf(\"\\nErase size %6u bytes: avg %10u, min %10u, max %10u (usec)\\n\\n\",\n                     sector_size, avg_erase_time, min_erase_time, max_erase_time);\n        byte_usec_ratio = sector_size \/ avg_erase_time;\n        TEST_ASSERT(byte_usec_ratio < max_byte_usec_ratio);\n    }\n\n    ret = flash_device.deinit();\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n}\n\n\nCase cases[] = {\n    Case(\"FlashIAP - init\", flashiap_init_test),\n    Case(\"FlashIAP - program\", flashiap_program_test),\n    Case(\"FlashIAP - program across sectors\", flashiap_cross_sector_program_test),\n    Case(\"FlashIAP - program errors\", flashiap_program_error_test),\n    Case(\"FlashIAP - timing\", flashiap_timing_test),\n};\n\nutest::v1::status_t greentea_test_setup(const size_t number_of_cases)\n{\n    GREENTEA_SETUP(120, \"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>Add flash sum check<commit_after>\n\/* 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_FLASH\n#error [NOT_SUPPORTED] Flash API not supported for this target\n#endif\n\n#include \"utest\/utest.h\"\n#include \"utest\/utest_serial.h\"\n#include \"unity\/unity.h\"\n#include \"greentea-client\/test_env.h\"\n#include \"FlashIAP.h\"\n#include \"unity.h\"\n#include <algorithm>\n\n#include \"mbed.h\"\n\n\/\/ Debug available\n#ifndef FLASHIAP_DEBUG\n#define FLASHIAP_DEBUG      0\n#endif\n\n#if FLASHIAP_DEBUG\n#define DEBUG_PRINTF(...) printf(__VA_ARGS__)\n#else\n#define DEBUG_PRINTF(...)\n#endif\n\nusing namespace utest::v1;\n\n\nvoid flashiap_init_test()\n{\n    FlashIAP flash_device;\n    uint32_t ret = flash_device.init();\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n\n    uint32_t flash_start = flash_device.get_flash_start();\n    uint32_t flash_size = flash_device.get_flash_size();\n    utest_printf(\"Flash address: 0x%08x, size: %d\\n\", flash_start, flash_size);\n    uint32_t address = flash_start;\n    int num = 0;\n    while (flash_size) {\n        uint32_t sector_size = flash_device.get_sector_size(address);\n        \/\/ Make sure all sectors sum up to the total flash size\n        TEST_ASSERT(flash_size >= sector_size);\n        DEBUG_PRINTF(\"\\tsector %3d: address 0x%08x, size %8d\\n\", num++, address, sector_size);\n        flash_size -= sector_size;\n        address += sector_size;\n    }\n\n    ret = flash_device.deinit();\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n}\n\nvoid flashiap_program_test()\n{\n    FlashIAP flash_device;\n    uint32_t ret = flash_device.init();\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n\n    \/\/ get the last sector size (flash size - 1)\n    uint32_t sector_size = flash_device.get_sector_size(flash_device.get_flash_start() + flash_device.get_flash_size() - 1UL);\n    uint32_t page_size = flash_device.get_page_size();\n    TEST_ASSERT_NOT_EQUAL(0, sector_size);\n    TEST_ASSERT_NOT_EQUAL(0, page_size);\n    TEST_ASSERT_TRUE(sector_size % page_size == 0);\n    uint32_t prog_size = std::max(page_size, (uint32_t)8);\n    uint8_t *data = new uint8_t[prog_size + 2];\n\n    \/\/ the one before the last sector in the system\n    uint32_t address = (flash_device.get_flash_start() + flash_device.get_flash_size()) - (sector_size);\n    TEST_ASSERT_TRUE(address != 0UL);\n    utest_printf(\"ROM ends at 0x%lx, test starts at 0x%lx\\n\", FLASHIAP_APP_ROM_END_ADDR, address);\n    TEST_SKIP_UNLESS_MESSAGE(address >= FLASHIAP_APP_ROM_END_ADDR, \"Test skipped. Test region overlaps code.\");\n\n    ret = flash_device.erase(address, sector_size);\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n\n    uint8_t erase_val = flash_device.get_erase_value();\n    memset(data, erase_val, prog_size);\n\n    uint8_t *data_flashed = new uint8_t[prog_size];\n    for (uint32_t i = 0; i < sector_size \/ prog_size; i++) {\n        uint32_t page_addr = address + i * prog_size;\n        ret = flash_device.read(data_flashed, page_addr, prog_size);\n        TEST_ASSERT_EQUAL_INT32(0, ret);\n        TEST_ASSERT_EQUAL_UINT8_ARRAY(data, data_flashed, prog_size);\n    }\n\n    for (uint32_t i = 0; i < prog_size + 2; i++) {\n        data[i] = i;\n    }\n\n    for (uint32_t i = 0; i < sector_size \/ prog_size; i++) {\n        uint32_t prog_addr = address + i * prog_size;\n        ret = flash_device.program(data, prog_addr, prog_size);\n        TEST_ASSERT_EQUAL_INT32(0, ret);\n    }\n\n    for (uint32_t i = 0; i < sector_size \/ prog_size; i++) {\n        uint32_t page_addr = address + i * prog_size;\n        ret = flash_device.read(data_flashed, page_addr, prog_size);\n        TEST_ASSERT_EQUAL_INT32(0, ret);\n        TEST_ASSERT_EQUAL_UINT8_ARRAY(data, data_flashed, prog_size);\n    }\n\n    \/\/ check programming of unaligned buffer and size\n    ret = flash_device.erase(address, sector_size);\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n    ret = flash_device.program(data + 2, address, prog_size);\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n    ret = flash_device.read(data_flashed, address, prog_size - 1);\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n    TEST_ASSERT_EQUAL_UINT8_ARRAY(data + 2, data_flashed, prog_size - 1);\n\n    delete[] data;\n    delete[] data_flashed;\n\n    ret = flash_device.deinit();\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n}\n\n\nvoid flashiap_cross_sector_program_test()\n{\n    FlashIAP flash_device;\n    uint32_t ret = flash_device.init();\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n\n    uint32_t page_size = flash_device.get_page_size();\n\n    \/\/ Erase last two sectors\n    uint32_t address = flash_device.get_flash_start() + flash_device.get_flash_size();\n    uint32_t sector_size, agg_size = 0;\n    for (uint32_t i = 0; i < 2; i++) {\n        sector_size = flash_device.get_sector_size(address - 1UL);\n        TEST_ASSERT_NOT_EQUAL(0, sector_size);\n        TEST_ASSERT_TRUE(sector_size % page_size == 0);\n        agg_size += sector_size;\n        address -= sector_size;\n    }\n    utest_printf(\"ROM ends at 0x%lx, test starts at 0x%lx\\n\", FLASHIAP_APP_ROM_END_ADDR, address);\n    TEST_SKIP_UNLESS_MESSAGE(address >= FLASHIAP_APP_ROM_END_ADDR, \"Test skipped. Test region overlaps code.\");\n    ret = flash_device.erase(address, agg_size);\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n\n    address += sector_size - page_size;\n    uint32_t aligned_prog_size = 2 * page_size;\n    uint32_t prog_size = aligned_prog_size;\n    if (page_size > 1) {\n        prog_size--;\n    }\n    uint8_t *data = new uint8_t[aligned_prog_size];\n    for (uint32_t i = 0; i < prog_size; i++) {\n        data[i] = rand() % 256;\n    }\n    for (uint32_t i = prog_size; i < aligned_prog_size; i++) {\n        data[i] = 0xFF;\n    }\n\n    ret = flash_device.program(data, address, prog_size);\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n\n    uint8_t *data_flashed = new uint8_t[aligned_prog_size];\n    ret = flash_device.read(data_flashed, address, aligned_prog_size);\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n    TEST_ASSERT_EQUAL_UINT8_ARRAY(data, data_flashed, aligned_prog_size);\n\n    delete[] data;\n    delete[] data_flashed;\n\n    ret = flash_device.deinit();\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n}\n\nvoid flashiap_program_error_test()\n{\n    FlashIAP flash_device;\n    uint32_t ret = flash_device.init();\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n\n    \/\/ get the last sector size (flash size - 1)\n    uint32_t sector_size = flash_device.get_sector_size(flash_device.get_flash_start() + flash_device.get_flash_size() - 1UL);\n    uint32_t page_size = flash_device.get_page_size();\n    TEST_ASSERT_NOT_EQUAL(0, sector_size);\n    TEST_ASSERT_NOT_EQUAL(0, page_size);\n    TEST_ASSERT_TRUE(sector_size % page_size == 0);\n    const uint8_t test_value = 0xCE;\n    uint8_t *data = new uint8_t[page_size];\n    for (uint32_t i = 0; i < page_size; i++) {\n        data[i] = test_value;\n    }\n\n    \/\/ the one before the last page in the system\n    uint32_t address = (flash_device.get_flash_start() + flash_device.get_flash_size()) - (sector_size);\n    TEST_ASSERT_TRUE(address != 0UL);\n\n    \/\/ unaligned address\n    utest_printf(\"ROM ends at 0x%lx, test starts at 0x%lx\\n\", FLASHIAP_APP_ROM_END_ADDR, address);\n    TEST_SKIP_UNLESS_MESSAGE(address >= FLASHIAP_APP_ROM_END_ADDR, \"Test skipped. Test region overlaps code.\");\n    ret = flash_device.erase(address + 1, sector_size);\n    TEST_ASSERT_EQUAL_INT32(-1, ret);\n    if (flash_device.get_page_size() > 1) {\n        ret = flash_device.program(data, address + 1, page_size);\n        TEST_ASSERT_EQUAL_INT32(-1, ret);\n    }\n\n    delete[] data;\n\n    ret = flash_device.deinit();\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n}\n\nvoid flashiap_timing_test()\n{\n    FlashIAP flash_device;\n    uint32_t ret = flash_device.init();\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n    mbed::Timer timer;\n    unsigned int num_write_sizes;\n    unsigned int curr_time, byte_usec_ratio;\n    unsigned int avg_erase_time = 0;\n    unsigned int max_erase_time = 0, min_erase_time = (unsigned int) -1;\n    const unsigned int max_writes = 128;\n    const unsigned int max_write_sizes = 6;\n    const unsigned int max_byte_usec_ratio = 200;\n\n    uint32_t page_size = flash_device.get_page_size();\n    uint32_t write_size = page_size;\n\n    uint32_t end_address = flash_device.get_flash_start() + flash_device.get_flash_size();\n\n    utest_printf(\"\\nFlash timing:\\n\");\n    uint32_t sector_size = flash_device.get_sector_size(end_address - 1UL);\n    uint32_t base_address = end_address - sector_size;\n    utest_printf(\"ROM ends at 0x%lx, test starts at 0x%lx\\n\", FLASHIAP_APP_ROM_END_ADDR, base_address);\n    TEST_SKIP_UNLESS_MESSAGE(base_address >= FLASHIAP_APP_ROM_END_ADDR, \"Test skipped. Test region overlaps code.\");\n\n    timer.start();\n    for (num_write_sizes = 0; num_write_sizes < max_write_sizes; num_write_sizes++) {\n        if (write_size > sector_size) {\n            break;\n        }\n        uint8_t *buf = new (std::nothrow) uint8_t[write_size];\n        if (!buf) {\n            \/\/ Don't fail the test on lack of heap memory for the buffer\n            break;\n        }\n        memset(buf, 0x5A, write_size);\n        timer.reset();\n        ret = flash_device.erase(base_address, sector_size);\n        curr_time = timer.read_us();\n        avg_erase_time += curr_time;\n        TEST_ASSERT_EQUAL_INT32(0, ret);\n        max_erase_time = std::max(max_erase_time, curr_time);\n        min_erase_time = std::min(min_erase_time, curr_time);\n        uint32_t address = base_address;\n        unsigned int avg_write_time = 0;\n        unsigned int max_write_time = 0, min_write_time = (unsigned int) -1;\n        unsigned int num_writes;\n        for (num_writes = 0; num_writes < max_writes; num_writes++) {\n            if ((address + write_size) > end_address) {\n                break;\n            }\n            timer.reset();\n            ret = flash_device.program(buf, address, write_size);\n            curr_time = timer.read_us();\n            avg_write_time += curr_time;\n            TEST_ASSERT_EQUAL_INT32(0, ret);\n            max_write_time = std::max(max_write_time, curr_time);\n            min_write_time = std::min(min_write_time, curr_time);\n            address += write_size;\n        }\n        delete[] buf;\n        avg_write_time \/= num_writes;\n        utest_printf(\"Write size %6u bytes: avg %10u, min %10u, max %10u (usec)\\n\",\n                     write_size, avg_write_time, min_write_time, max_write_time);\n        byte_usec_ratio = write_size \/ avg_write_time;\n        TEST_ASSERT(byte_usec_ratio < max_byte_usec_ratio);\n        write_size *= 4;\n    }\n\n    if (num_write_sizes) {\n        avg_erase_time \/= num_write_sizes;\n        utest_printf(\"\\nErase size %6u bytes: avg %10u, min %10u, max %10u (usec)\\n\\n\",\n                     sector_size, avg_erase_time, min_erase_time, max_erase_time);\n        byte_usec_ratio = sector_size \/ avg_erase_time;\n        TEST_ASSERT(byte_usec_ratio < max_byte_usec_ratio);\n    }\n\n    ret = flash_device.deinit();\n    TEST_ASSERT_EQUAL_INT32(0, ret);\n}\n\n\nCase cases[] = {\n    Case(\"FlashIAP - init\", flashiap_init_test),\n    Case(\"FlashIAP - program\", flashiap_program_test),\n    Case(\"FlashIAP - program across sectors\", flashiap_cross_sector_program_test),\n    Case(\"FlashIAP - program errors\", flashiap_program_error_test),\n    Case(\"FlashIAP - timing\", flashiap_timing_test),\n};\n\nutest::v1::status_t greentea_test_setup(const size_t number_of_cases)\n{\n    GREENTEA_SETUP(120, \"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 * Copyright (c) 2006 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 \"base\/trace.hh\"\n#include \"dev\/io_device.hh\"\n#include \"sim\/builder.hh\"\n\n\nPioPort::PioPort(PioDevice *dev, Platform *p)\n    : Port(dev->name() + \"-pioport\"), device(dev), platform(p)\n{ }\n\n\nTick\nPioPort::recvAtomic(Packet *pkt)\n{\n    return device->recvAtomic(pkt);\n}\n\nvoid\nPioPort::recvFunctional(Packet *pkt)\n{\n    device->recvAtomic(pkt);\n}\n\nvoid\nPioPort::getDeviceAddressRanges(AddrRangeList &resp, AddrRangeList &snoop)\n{\n    snoop.clear();\n    device->addressRanges(resp);\n}\n\n\nvoid\nPioPort::recvRetry()\n{\n    Packet* pkt = transmitList.front();\n    if (Port::sendTiming(pkt)) {\n        transmitList.pop_front();\n    }\n}\n\n\nvoid\nPioPort::SendEvent::process()\n{\n    if (port->Port::sendTiming(packet))\n        return;\n\n    port->transmitList.push_back(packet);\n}\n\n\n\nbool\nPioPort::recvTiming(Packet *pkt)\n{\n    device->recvAtomic(pkt);\n    \/\/ turn packet around to go back to requester\n    pkt->makeTimingResponse();\n    sendTiming(pkt, pkt->time - pkt->req->getTime());\n    return true;\n}\n\nPioDevice::~PioDevice()\n{\n    if (pioPort)\n        delete pioPort;\n}\n\nvoid\nPioDevice::init()\n{\n    if (!pioPort)\n        panic(\"Pio port not connected to anything!\");\n    pioPort->sendStatusChange(Port::RangeChange);\n}\n\nvoid\nBasicPioDevice::addressRanges(AddrRangeList &range_list)\n{\n    assert(pioSize != 0);\n    range_list.clear();\n    range_list.push_back(RangeSize(pioAddr, pioSize));\n}\n\n\nDmaPort::DmaPort(DmaDevice *dev, Platform *p)\n    : Port(dev->name() + \"-dmaport\"), device(dev), platform(p), pendingCount(0)\n{ }\n\nbool\nDmaPort::recvTiming(Packet *pkt)\n{\n    if (pkt->senderState) {\n        DmaReqState *state;\n        DPRINTF(DMA, \"Received response Packet %#x with senderState: %#x\\n\",\n               pkt, pkt->senderState);\n        state = dynamic_cast<DmaReqState*>(pkt->senderState);\n        assert(state);\n        state->completionEvent->process();\n        delete pkt->req;\n        delete pkt;\n    }  else {\n        DPRINTF(DMA, \"Received response Packet %#x with no senderState\\n\", pkt);\n        delete pkt->req;\n        delete pkt;\n    }\n\n    return true;\n}\n\nDmaDevice::DmaDevice(Params *p)\n    : PioDevice(p), dmaPort(NULL)\n{ }\n\nvoid\nDmaPort::recvRetry()\n{\n    Packet* pkt = transmitList.front();\n    DPRINTF(DMA, \"Retry on  Packet %#x with senderState: %#x\\n\",\n               pkt, pkt->senderState);\n    if (sendTiming(pkt)) {\n        DPRINTF(DMA, \"-- Done\\n\");\n        transmitList.pop_front();\n        pendingCount--;\n        assert(pendingCount >= 0);\n    } else {\n        DPRINTF(DMA, \"-- Failed, queued\\n\");\n    }\n}\n\n\nvoid\nDmaPort::dmaAction(Packet::Command cmd, Addr addr, int size, Event *event,\n                   uint8_t *data)\n{\n    assert(event);\n\n    int prevSize = 0;\n\n    for (ChunkGenerator gen(addr, size, peerBlockSize());\n         !gen.done(); gen.next()) {\n            Request *req = new Request(false);\n            req->setPaddr(gen.addr());\n            req->setSize(gen.size());\n            req->setTime(curTick);\n            Packet *pkt = new Packet(req, cmd, Packet::Broadcast);\n\n            \/\/ Increment the data pointer on a write\n            if (data)\n                pkt->dataStatic(data + prevSize) ;\n\n            prevSize += gen.size();\n\n            \/\/ Set the last bit of the dma as the final packet for this dma\n            \/\/ and set it's completion event.\n            if (prevSize == size) {\n                pkt->senderState = new DmaReqState(event, true);\n            }\n            assert(pendingCount >= 0);\n            pendingCount++;\n            sendDma(pkt);\n    }\n}\n\n\nvoid\nDmaPort::sendDma(Packet *pkt)\n{\n   \/\/ some kind of selction between access methods\n   \/\/ more work is going to have to be done to make\n   \/\/ switching actually work\n  \/* MemState state = device->platform->system->memState;\n\n   if (state == Timing) {  *\/\n       DPRINTF(DMA, \"Attempting to send Packet %#x with senderState: %#x\\n\",\n               pkt, pkt->senderState);\n       if (!sendTiming(pkt)) {\n           transmitList.push_back(pkt);\n           DPRINTF(DMA, \"-- Failed: queued\\n\");\n       } else {\n           DPRINTF(DMA, \"-- Done\\n\");\n           pendingCount--;\n           assert(pendingCount >= 0);\n       }\n  \/*  } else if (state == Atomic) {\n       sendAtomic(pkt);\n       if (pkt->senderState) {\n           DmaReqState *state = dynamic_cast<DmaReqState*>(pkt->senderState);\n           assert(state);\n           state->completionEvent->schedule(curTick + (pkt->time - pkt->req->getTime()) +1);\n       }\n       pendingCount--;\n       assert(pendingCount >= 0);\n       delete pkt->req;\n       delete pkt;\n\n   } else if (state == Functional) {\n       sendFunctional(pkt);\n       \/\/ Is this correct???\n       completionEvent->schedule(pkt->req->responseTime - pkt->req->requestTime);\n       completionEvent == NULL;\n   } else\n       panic(\"Unknown memory command state.\");\n  *\/\n}\n\nDmaDevice::~DmaDevice()\n{\n    if (dmaPort)\n        delete dmaPort;\n}\n\n\n<commit_msg>make io device be a little nicer about scheduling retries on the bus<commit_after>\/*\n * Copyright (c) 2006 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 \"base\/trace.hh\"\n#include \"dev\/io_device.hh\"\n#include \"sim\/builder.hh\"\n\n\nPioPort::PioPort(PioDevice *dev, Platform *p)\n    : Port(dev->name() + \"-pioport\"), device(dev), platform(p)\n{ }\n\n\nTick\nPioPort::recvAtomic(Packet *pkt)\n{\n    return device->recvAtomic(pkt);\n}\n\nvoid\nPioPort::recvFunctional(Packet *pkt)\n{\n    device->recvAtomic(pkt);\n}\n\nvoid\nPioPort::getDeviceAddressRanges(AddrRangeList &resp, AddrRangeList &snoop)\n{\n    snoop.clear();\n    device->addressRanges(resp);\n}\n\n\nvoid\nPioPort::recvRetry()\n{\n    Packet* pkt = transmitList.front();\n    if (Port::sendTiming(pkt)) {\n        transmitList.pop_front();\n    }\n}\n\n\nvoid\nPioPort::SendEvent::process()\n{\n    if (port->Port::sendTiming(packet))\n        return;\n\n    port->transmitList.push_back(packet);\n}\n\n\n\nbool\nPioPort::recvTiming(Packet *pkt)\n{\n    device->recvAtomic(pkt);\n    \/\/ turn packet around to go back to requester\n    pkt->makeTimingResponse();\n    sendTiming(pkt, pkt->time - pkt->req->getTime());\n    return true;\n}\n\nPioDevice::~PioDevice()\n{\n    if (pioPort)\n        delete pioPort;\n}\n\nvoid\nPioDevice::init()\n{\n    if (!pioPort)\n        panic(\"Pio port not connected to anything!\");\n    pioPort->sendStatusChange(Port::RangeChange);\n}\n\nvoid\nBasicPioDevice::addressRanges(AddrRangeList &range_list)\n{\n    assert(pioSize != 0);\n    range_list.clear();\n    range_list.push_back(RangeSize(pioAddr, pioSize));\n}\n\n\nDmaPort::DmaPort(DmaDevice *dev, Platform *p)\n    : Port(dev->name() + \"-dmaport\"), device(dev), platform(p), pendingCount(0)\n{ }\n\nbool\nDmaPort::recvTiming(Packet *pkt)\n{\n    if (pkt->senderState) {\n        DmaReqState *state;\n        DPRINTF(DMA, \"Received response Packet %#x with senderState: %#x\\n\",\n               pkt, pkt->senderState);\n        state = dynamic_cast<DmaReqState*>(pkt->senderState);\n        assert(state);\n        state->completionEvent->process();\n        delete pkt->req;\n        delete pkt;\n    }  else {\n        DPRINTF(DMA, \"Received response Packet %#x with no senderState\\n\", pkt);\n        delete pkt->req;\n        delete pkt;\n    }\n\n    return true;\n}\n\nDmaDevice::DmaDevice(Params *p)\n    : PioDevice(p), dmaPort(NULL)\n{ }\n\nvoid\nDmaPort::recvRetry()\n{\n    Packet* pkt = transmitList.front();\n    bool result = true;\n    while (result && transmitList.size()) {\n        DPRINTF(DMA, \"Retry on  Packet %#x with senderState: %#x\\n\",\n                   pkt, pkt->senderState);\n        result = sendTiming(pkt);\n        if (result) {\n            DPRINTF(DMA, \"-- Done\\n\");\n            transmitList.pop_front();\n            pendingCount--;\n            assert(pendingCount >= 0);\n        } else {\n            DPRINTF(DMA, \"-- Failed, queued\\n\");\n        }\n    }\n}\n\n\nvoid\nDmaPort::dmaAction(Packet::Command cmd, Addr addr, int size, Event *event,\n                   uint8_t *data)\n{\n    assert(event);\n\n    int prevSize = 0;\n\n    for (ChunkGenerator gen(addr, size, peerBlockSize());\n         !gen.done(); gen.next()) {\n            Request *req = new Request(false);\n            req->setPaddr(gen.addr());\n            req->setSize(gen.size());\n            req->setTime(curTick);\n            Packet *pkt = new Packet(req, cmd, Packet::Broadcast);\n\n            \/\/ Increment the data pointer on a write\n            if (data)\n                pkt->dataStatic(data + prevSize) ;\n\n            prevSize += gen.size();\n\n            \/\/ Set the last bit of the dma as the final packet for this dma\n            \/\/ and set it's completion event.\n            if (prevSize == size) {\n                pkt->senderState = new DmaReqState(event, true);\n            }\n            assert(pendingCount >= 0);\n            pendingCount++;\n            sendDma(pkt);\n    }\n}\n\n\nvoid\nDmaPort::sendDma(Packet *pkt)\n{\n   \/\/ some kind of selction between access methods\n   \/\/ more work is going to have to be done to make\n   \/\/ switching actually work\n  \/* MemState state = device->platform->system->memState;\n\n   if (state == Timing) {  *\/\n       DPRINTF(DMA, \"Attempting to send Packet %#x with senderState: %#x\\n\",\n               pkt, pkt->senderState);\n       if (transmitList.size() || !sendTiming(pkt)) {\n           transmitList.push_back(pkt);\n           DPRINTF(DMA, \"-- Failed: queued\\n\");\n       } else {\n           DPRINTF(DMA, \"-- Done\\n\");\n           pendingCount--;\n           assert(pendingCount >= 0);\n       }\n  \/*  } else if (state == Atomic) {\n       sendAtomic(pkt);\n       if (pkt->senderState) {\n           DmaReqState *state = dynamic_cast<DmaReqState*>(pkt->senderState);\n           assert(state);\n           state->completionEvent->schedule(curTick + (pkt->time - pkt->req->getTime()) +1);\n       }\n       pendingCount--;\n       assert(pendingCount >= 0);\n       delete pkt->req;\n       delete pkt;\n\n   } else if (state == Functional) {\n       sendFunctional(pkt);\n       \/\/ Is this correct???\n       completionEvent->schedule(pkt->req->responseTime - pkt->req->requestTime);\n       completionEvent == NULL;\n   } else\n       panic(\"Unknown memory command state.\");\n  *\/\n}\n\nDmaDevice::~DmaDevice()\n{\n    if (dmaPort)\n        delete dmaPort;\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2018 Rokas Kupstys\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 <Urho3D\/Resource\/XMLFile.h>\n#include <Urho3D\/Core\/StringUtils.h>\n#include <Urho3D\/Graphics\/Graphics.h>\n#include <Urho3D\/IO\/Log.h>\n#include <Urho3D\/Resource\/ResourceCache.h>\n#include <Urho3D\/SystemUI\/SystemUI.h>\n#include <Toolbox\/SystemUI\/ImGuiDock.h>\n#include <Tabs\/ConsoleTab.h>\n#include <Tabs\/ResourceTab.h>\n#include <Tabs\/HierarchyTab.h>\n#include <Tabs\/InspectorTab.h>\n\n#include \"Editor.h\"\n#include \"EditorEvents.h\"\n#include \"Project.h\"\n#include \"Tabs\/Scene\/SceneTab.h\"\n#include \"Tabs\/UI\/UITab.h\"\n\n\nnamespace Urho3D\n{\n\nProject::Project(Context* context)\n    : Object(context)\n    , assetConverter_(context)\n{\n    SubscribeToEvent(E_EDITORRESOURCESAVED, std::bind(&Project::SaveProject, this));\n}\n\nProject::~Project()\n{\n    ui::GetIO().IniFilename = nullptr;\n\n    if (auto* cache = GetCache())\n    {\n        cache->RemoveResourceDir(GetCachePath());\n        cache->RemoveResourceDir(GetResourcePath());\n\n        for (const auto& path : cachedEngineResourcePaths_)\n            GetCache()->AddResourceDir(path);\n    }\n\n    \/\/ Clear dock state\n    ui::LoadDock(JSONValue::EMPTY);\n}\n\nbool Project::LoadProject(const String& projectPath)\n{\n    if (!projectFileDir_.Empty())\n        \/\/ Project is already loaded.\n        return false;\n\n    if (projectPath.Empty())\n        return false;\n\n    projectFileDir_ = AddTrailingSlash(projectPath);\n\n    if (!GetFileSystem()->Exists(GetCachePath()))\n        GetFileSystem()->CreateDirsRecursive(GetCachePath());\n\n    if (!GetFileSystem()->Exists(GetResourcePath()))\n    {\n        \/\/ Initialize new project\n        GetFileSystem()->CreateDirsRecursive(GetResourcePath());\n\n        for (const auto& path : GetCache()->GetResourceDirs())\n        {\n            if (path.EndsWith(\"\/EditorData\/\") || path.Contains(\"\/Autoload\/\"))\n                continue;\n\n            StringVector names;\n\n            URHO3D_LOGINFOF(\"Importing resources from '%s'\", path.CString());\n\n            \/\/ Copy default resources to the project.\n            GetFileSystem()->ScanDir(names, path, \"*\", SCAN_FILES, false);\n            for (const auto& name : names)\n                GetFileSystem()->Copy(path + name, GetResourcePath() + name);\n\n            GetFileSystem()->ScanDir(names, path, \"*\", SCAN_DIRS, false);\n            for (const auto& name : names)\n            {\n                if (name == \".\" || name == \"..\")\n                    continue;\n                GetFileSystem()->CopyDir(path + name, GetResourcePath() + name);\n            }\n        }\n    }\n\n    \/\/ Register asset dirs\n    GetCache()->AddResourceDir(GetCachePath(), 0);\n    GetCache()->AddResourceDir(GetResourcePath(), 1);\n    assetConverter_.SetCachePath(GetCachePath());\n    assetConverter_.AddAssetDirectory(GetResourcePath());\n    assetConverter_.VerifyCacheAsync();\n\n    \/\/ Unregister engine dirs\n    auto enginePrefixPath = GetSubsystem<Editor>()->GetCoreResourcePrefixPath();\n    auto pathsCopy = GetCache()->GetResourceDirs();\n    cachedEngineResourcePaths_.Clear();\n    for (const auto& path : pathsCopy)\n    {\n        if (path.StartsWith(enginePrefixPath) && !path.EndsWith(\"\/EditorData\/\"))\n        {\n            cachedEngineResourcePaths_.EmplaceBack(path);\n            GetCache()->RemoveResourceDir(path);\n        }\n    }\n\n    uiConfigPath_ = projectPath + \"\/.ui.ini\";\n    ui::GetIO().IniFilename = uiConfigPath_.CString();\n    String userSessionPath(projectFileDir_ + \".user.json\");\n\n    if (GetFileSystem()->Exists(userSessionPath))\n    {\n        \/\/ Load user session\n        JSONFile file(context_);\n        if (!file.LoadFile(userSessionPath))\n            return false;\n\n        const auto& root = file.GetRoot();\n        if (root.IsObject())\n        {\n            SendEvent(E_EDITORPROJECTLOADINGSTART);\n\n            const auto& window = root[\"window\"];\n            if (window.IsObject())\n            {\n                auto size = window[\"size\"].GetVariant().GetIntVector2();\n                GetGraphics()->SetMode(size.x_, size.y_);\n                GetGraphics()->SetWindowPosition(window[\"position\"].GetVariant().GetIntVector2());\n            }\n\n            const auto& tabs = root[\"tabs\"];\n            if (tabs.IsArray())\n            {\n                auto* editor = GetSubsystem<Editor>();\n                for (auto i = 0; i < tabs.Size(); i++)\n                {\n                    const auto& tab = tabs[i];\n\n                    auto tabType = tab[\"type\"].GetString();\n                    auto* runtimeTab = editor->CreateTab(tabType);\n\n                    if (runtimeTab == nullptr)\n                        URHO3D_LOGERRORF(\"Unknown tab type '%s'\", tabType.CString());\n                    else\n                        runtimeTab->OnLoadProject(tab);\n                }\n            }\n\n            ui::LoadDock(root[\"docks\"]);\n\n            \/\/ Plugins may load state by subscribing to this event\n            using namespace EditorProjectLoading;\n            SendEvent(E_EDITORPROJECTLOADING, P_ROOT, (void*)&root);\n        }\n    }\n    else\n    {\n        \/\/ Load default layout if no user session exists\n        GetSubsystem<Editor>()->LoadDefaultLayout();\n    }\n\n    \/\/ StringHashNames.json\n    {\n        String hashNamesPath(projectFileDir_ + \"StringHashNames.json\");\n\n        JSONFile file(context_);\n        if (!file.LoadFile(hashNamesPath))\n            return false;\n\n        for (const auto& value : file.GetRoot().GetArray())\n        {\n            \/\/ Seed global string hash to name map.\n            StringHash hash(value.GetString());\n            (void)(hash);\n        }\n    }\n\n    return true;\n}\n\nbool Project::SaveProject()\n{\n    \/\/ Saving project data of tabs may trigger saving resources, which in turn triggers saving editor project. Avoid\n    \/\/ that loop.\n    UnsubscribeFromEvent(E_EDITORRESOURCESAVED);\n\n    if (projectFileDir_.Empty())\n    {\n        URHO3D_LOGERROR(\"Unable to save project. Project path is empty.\");\n        return false;\n    }\n\n    \/\/ .user.json\n    {\n        JSONFile file(context_);\n        JSONValue& root = file.GetRoot();\n        root[\"version\"] = 0;\n\n        JSONValue& window = root[\"window\"];\n        {\n            window[\"size\"].SetVariant(GetGraphics()->GetSize());\n            window[\"position\"].SetVariant(GetGraphics()->GetWindowPosition());\n        }\n\n        \/\/ Plugins may save state by subscribing to this event\n        using namespace EditorProjectSaving;\n        SendEvent(E_EDITORPROJECTSAVING, P_ROOT, (void*)&root);\n\n        ui::SaveDock(root[\"docks\"]);\n\n        String filePath(projectFileDir_ + \".user.json\");\n        if (!file.SaveFile(filePath))\n        {\n            projectFileDir_.Clear();\n            URHO3D_LOGERRORF(\"Saving project to '%s' failed\", filePath.CString());\n            return false;\n        }\n    }\n\n#if URHO3D_HASH_DEBUG\n    \/\/ StringHashNames.json\n    {\n        auto hashNames = StringHash::GetGlobalStringHashRegister()->GetInternalMap().Values();\n        Sort(hashNames.Begin(), hashNames.End());\n        JSONFile file(context_);\n        JSONArray names;\n        for (const auto& string : hashNames)\n            names.Push(string);\n        file.GetRoot() = names;\n\n        String filePath(projectFileDir_ + \"StringHashNames.json\");\n        if (!file.SaveFile(filePath))\n        {\n            projectFileDir_.Clear();\n            URHO3D_LOGERRORF(\"Saving StringHash names to '%s' failed\", filePath.CString());\n            return false;\n        }\n    }\n#endif\n\n    SubscribeToEvent(E_EDITORRESOURCESAVED, std::bind(&Project::SaveProject, this));\n\n    return true;\n}\n\nString Project::GetCachePath() const\n{\n    if (projectFileDir_.Empty())\n        return String::EMPTY;\n    return projectFileDir_ + \"Cache\/\";\n}\n\nString Project::GetResourcePath() const\n{\n    if (projectFileDir_.Empty())\n        return String::EMPTY;\n    return projectFileDir_ + \"Resources\/\";\n}\n\n}\n<commit_msg>Editor: Fix creating new project.<commit_after>\/\/\n\/\/ Copyright (c) 2018 Rokas Kupstys\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 <Urho3D\/Resource\/XMLFile.h>\n#include <Urho3D\/Core\/StringUtils.h>\n#include <Urho3D\/Graphics\/Graphics.h>\n#include <Urho3D\/IO\/Log.h>\n#include <Urho3D\/Resource\/ResourceCache.h>\n#include <Urho3D\/SystemUI\/SystemUI.h>\n#include <Toolbox\/SystemUI\/ImGuiDock.h>\n#include <Tabs\/ConsoleTab.h>\n#include <Tabs\/ResourceTab.h>\n#include <Tabs\/HierarchyTab.h>\n#include <Tabs\/InspectorTab.h>\n\n#include \"Editor.h\"\n#include \"EditorEvents.h\"\n#include \"Project.h\"\n#include \"Tabs\/Scene\/SceneTab.h\"\n#include \"Tabs\/UI\/UITab.h\"\n\n\nnamespace Urho3D\n{\n\nProject::Project(Context* context)\n    : Object(context)\n    , assetConverter_(context)\n{\n    SubscribeToEvent(E_EDITORRESOURCESAVED, std::bind(&Project::SaveProject, this));\n}\n\nProject::~Project()\n{\n    ui::GetIO().IniFilename = nullptr;\n\n    if (auto* cache = GetCache())\n    {\n        cache->RemoveResourceDir(GetCachePath());\n        cache->RemoveResourceDir(GetResourcePath());\n\n        for (const auto& path : cachedEngineResourcePaths_)\n            GetCache()->AddResourceDir(path);\n    }\n\n    \/\/ Clear dock state\n    ui::LoadDock(JSONValue::EMPTY);\n}\n\nbool Project::LoadProject(const String& projectPath)\n{\n    if (!projectFileDir_.Empty())\n        \/\/ Project is already loaded.\n        return false;\n\n    if (projectPath.Empty())\n        return false;\n\n    projectFileDir_ = AddTrailingSlash(projectPath);\n\n    if (!GetFileSystem()->Exists(GetCachePath()))\n        GetFileSystem()->CreateDirsRecursive(GetCachePath());\n\n    if (!GetFileSystem()->Exists(GetResourcePath()))\n    {\n        \/\/ Initialize new project\n        GetFileSystem()->CreateDirsRecursive(GetResourcePath());\n\n        for (const auto& path : GetCache()->GetResourceDirs())\n        {\n            if (path.EndsWith(\"\/EditorData\/\") || path.Contains(\"\/Autoload\/\"))\n                continue;\n\n            StringVector names;\n\n            URHO3D_LOGINFOF(\"Importing resources from '%s'\", path.CString());\n\n            \/\/ Copy default resources to the project.\n            GetFileSystem()->ScanDir(names, path, \"*\", SCAN_FILES, false);\n            for (const auto& name : names)\n                GetFileSystem()->Copy(path + name, GetResourcePath() + name);\n\n            GetFileSystem()->ScanDir(names, path, \"*\", SCAN_DIRS, false);\n            for (const auto& name : names)\n            {\n                if (name == \".\" || name == \"..\")\n                    continue;\n                GetFileSystem()->CopyDir(path + name, GetResourcePath() + name);\n            }\n        }\n    }\n\n    \/\/ Register asset dirs\n    GetCache()->AddResourceDir(GetCachePath(), 0);\n    GetCache()->AddResourceDir(GetResourcePath(), 1);\n    assetConverter_.SetCachePath(GetCachePath());\n    assetConverter_.AddAssetDirectory(GetResourcePath());\n    assetConverter_.VerifyCacheAsync();\n\n    \/\/ Unregister engine dirs\n    auto enginePrefixPath = GetSubsystem<Editor>()->GetCoreResourcePrefixPath();\n    auto pathsCopy = GetCache()->GetResourceDirs();\n    cachedEngineResourcePaths_.Clear();\n    for (const auto& path : pathsCopy)\n    {\n        if (path.StartsWith(enginePrefixPath) && !path.EndsWith(\"\/EditorData\/\"))\n        {\n            cachedEngineResourcePaths_.EmplaceBack(path);\n            GetCache()->RemoveResourceDir(path);\n        }\n    }\n\n    uiConfigPath_ = projectPath + \"\/.ui.ini\";\n    ui::GetIO().IniFilename = uiConfigPath_.CString();\n    String userSessionPath(projectFileDir_ + \".user.json\");\n\n    if (GetFileSystem()->Exists(userSessionPath))\n    {\n        \/\/ Load user session\n        JSONFile file(context_);\n        if (!file.LoadFile(userSessionPath))\n            return false;\n\n        const auto& root = file.GetRoot();\n        if (root.IsObject())\n        {\n            SendEvent(E_EDITORPROJECTLOADINGSTART);\n\n            const auto& window = root[\"window\"];\n            if (window.IsObject())\n            {\n                auto size = window[\"size\"].GetVariant().GetIntVector2();\n                GetGraphics()->SetMode(size.x_, size.y_);\n                GetGraphics()->SetWindowPosition(window[\"position\"].GetVariant().GetIntVector2());\n            }\n\n            const auto& tabs = root[\"tabs\"];\n            if (tabs.IsArray())\n            {\n                auto* editor = GetSubsystem<Editor>();\n                for (auto i = 0; i < tabs.Size(); i++)\n                {\n                    const auto& tab = tabs[i];\n\n                    auto tabType = tab[\"type\"].GetString();\n                    auto* runtimeTab = editor->CreateTab(tabType);\n\n                    if (runtimeTab == nullptr)\n                        URHO3D_LOGERRORF(\"Unknown tab type '%s'\", tabType.CString());\n                    else\n                        runtimeTab->OnLoadProject(tab);\n                }\n            }\n\n            ui::LoadDock(root[\"docks\"]);\n\n            \/\/ Plugins may load state by subscribing to this event\n            using namespace EditorProjectLoading;\n            SendEvent(E_EDITORPROJECTLOADING, P_ROOT, (void*)&root);\n        }\n    }\n    else\n    {\n        \/\/ Load default layout if no user session exists\n        GetSubsystem<Editor>()->LoadDefaultLayout();\n    }\n\n    \/\/ StringHashNames.json\n    {\n        String hashNamesPath(projectFileDir_ + \"StringHashNames.json\");\n        if (GetFileSystem()->Exists(hashNamesPath))\n        {\n            JSONFile file(context_);\n            if (!file.LoadFile(hashNamesPath))\n                return false;\n\n            for (const auto& value : file.GetRoot().GetArray())\n            {\n                \/\/ Seed global string hash to name map.\n                StringHash hash(value.GetString());\n                (void) (hash);\n            }\n        }\n    }\n\n    return true;\n}\n\nbool Project::SaveProject()\n{\n    \/\/ Saving project data of tabs may trigger saving resources, which in turn triggers saving editor project. Avoid\n    \/\/ that loop.\n    UnsubscribeFromEvent(E_EDITORRESOURCESAVED);\n\n    if (projectFileDir_.Empty())\n    {\n        URHO3D_LOGERROR(\"Unable to save project. Project path is empty.\");\n        return false;\n    }\n\n    \/\/ .user.json\n    {\n        JSONFile file(context_);\n        JSONValue& root = file.GetRoot();\n        root[\"version\"] = 0;\n\n        JSONValue& window = root[\"window\"];\n        {\n            window[\"size\"].SetVariant(GetGraphics()->GetSize());\n            window[\"position\"].SetVariant(GetGraphics()->GetWindowPosition());\n        }\n\n        \/\/ Plugins may save state by subscribing to this event\n        using namespace EditorProjectSaving;\n        SendEvent(E_EDITORPROJECTSAVING, P_ROOT, (void*)&root);\n\n        ui::SaveDock(root[\"docks\"]);\n\n        String filePath(projectFileDir_ + \".user.json\");\n        if (!file.SaveFile(filePath))\n        {\n            projectFileDir_.Clear();\n            URHO3D_LOGERRORF(\"Saving project to '%s' failed\", filePath.CString());\n            return false;\n        }\n    }\n\n#if URHO3D_HASH_DEBUG\n    \/\/ StringHashNames.json\n    {\n        auto hashNames = StringHash::GetGlobalStringHashRegister()->GetInternalMap().Values();\n        Sort(hashNames.Begin(), hashNames.End());\n        JSONFile file(context_);\n        JSONArray names;\n        for (const auto& string : hashNames)\n            names.Push(string);\n        file.GetRoot() = names;\n\n        String filePath(projectFileDir_ + \"StringHashNames.json\");\n        if (!file.SaveFile(filePath))\n        {\n            projectFileDir_.Clear();\n            URHO3D_LOGERRORF(\"Saving StringHash names to '%s' failed\", filePath.CString());\n            return false;\n        }\n    }\n#endif\n\n    SubscribeToEvent(E_EDITORRESOURCESAVED, std::bind(&Project::SaveProject, this));\n\n    return true;\n}\n\nString Project::GetCachePath() const\n{\n    if (projectFileDir_.Empty())\n        return String::EMPTY;\n    return projectFileDir_ + \"Cache\/\";\n}\n\nString Project::GetResourcePath() const\n{\n    if (projectFileDir_.Empty())\n        return String::EMPTY;\n    return projectFileDir_ + \"Resources\/\";\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/=- ClangDiagnosticsEmitter.cpp - Generate Clang diagnostics tables -*- 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\/\/ These tablegen backends emit Clang diagnostics tables.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"ClangDiagnosticsEmitter.h\"\n#include \"Record.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/Compiler.h\"\n#include \"llvm\/Support\/Streams.h\"\n#include \"llvm\/ADT\/DenseSet.h\"\n#include \"llvm\/ADT\/StringExtras.h\"\n#include \"llvm\/ADT\/VectorExtras.h\"\n#include <set>\n#include <map>\nusing namespace llvm;\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Warning Tables (.inc file) generation.\n\/\/===----------------------------------------------------------------------===\/\/\n\nvoid ClangDiagsDefsEmitter::run(std::ostream &OS) {\n  \/\/ Write the #if guard\n  if (!Component.empty()) {\n    std::string ComponentName = UppercaseString(Component);\n    OS << \"#ifdef \" << ComponentName << \"START\\n\";\n    OS << \"__\" << ComponentName << \"START = DIAG_START_\" << ComponentName\n       << \",\\n\";\n    OS << \"#undef \" << ComponentName << \"START\\n\";\n    OS << \"#endif\\n\";\n  }\n\n  const std::vector<Record*> &Diags =\n    Records.getAllDerivedDefinitions(\"Diagnostic\");\n  \n  for (unsigned i = 0, e = Diags.size(); i != e; ++i) {\n    const Record &R = *Diags[i];\n    \/\/ Filter by component.\n    if (!Component.empty() && Component != R.getValueAsString(\"Component\"))\n      continue;\n    \n    OS << \"DIAG(\" << R.getName() << \", \";\n    OS << R.getValueAsDef(\"Class\")->getName();\n    OS << \", diag::\" << R.getValueAsDef(\"DefaultMapping\")->getName();\n    OS << \", \\\"\";\n    std::string S = R.getValueAsString(\"Text\");\n    EscapeString(S);\n    OS << S << \"\\\")\\n\";\n  }\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Warning Group Tables generation\n\/\/===----------------------------------------------------------------------===\/\/\n\nstruct GroupInfo {\n  std::vector<const Record*> DiagsInGroup;\n  std::vector<std::string> SubGroups;\n};\n\nvoid ClangDiagGroupsEmitter::run(std::ostream &OS) {\n  \/\/ Invert the 1-[0\/1] mapping of diags to group into a one to many mapping of\n  \/\/ groups to diags in the group.\n  std::map<std::string, GroupInfo> DiagsInGroup;\n  \n  std::vector<Record*> Diags =\n    Records.getAllDerivedDefinitions(\"Diagnostic\");\n  for (unsigned i = 0, e = Diags.size(); i != e; ++i) {\n    const Record *R = Diags[i];\n    DefInit *DI = dynamic_cast<DefInit*>(R->getValueInit(\"Group\"));\n    if (DI == 0) continue;\n    std::string GroupName = DI->getDef()->getValueAsString(\"GroupName\");\n    DiagsInGroup[GroupName].DiagsInGroup.push_back(R);\n  }\n  \n  \/\/ Add all DiagGroup's to the DiagsInGroup list to make sure we pick up empty\n  \/\/ groups (these are warnings that GCC supports that clang never produces).\n  Diags = Records.getAllDerivedDefinitions(\"DiagGroup\");\n  for (unsigned i = 0, e = Diags.size(); i != e; ++i) {\n    Record *Group = Diags[i];\n    GroupInfo &GI = DiagsInGroup[Group->getValueAsString(\"GroupName\")];\n    \n    std::vector<Record*> SubGroups = Group->getValueAsListOfDefs(\"SubGroups\");\n    for (unsigned j = 0, e = SubGroups.size(); j != e; ++j)\n      GI.SubGroups.push_back(SubGroups[j]->getValueAsString(\"GroupName\"));\n  }\n  \n  \/\/ Walk through the groups emitting an array for each diagnostic of the diags\n  \/\/ that are mapped to.\n  OS << \"\\n#ifdef GET_DIAG_ARRAYS\\n\";\n  unsigned IDNo = 0;\n  unsigned MaxLen = 0;\n  for (std::map<std::string, GroupInfo>::iterator\n       I = DiagsInGroup.begin(), E = DiagsInGroup.end(); I != E; ++I) {\n    MaxLen = std::max(MaxLen, (unsigned)I->first.size());\n    \n    std::vector<const Record*> &V = I->second.DiagsInGroup;\n    if (V.empty()) continue;\n    \n    OS << \"static const short DiagArray\" << IDNo++\n       << \"[] = { \";\n    for (unsigned i = 0, e = V.size(); i != e; ++i)\n      OS << \"diag::\" << V[i]->getName() << \", \";\n    OS << \"-1 };\\n\";\n  }\n  OS << \"#endif \/\/ GET_DIAG_ARRAYS\\n\\n\";\n  \n  \/\/ Emit the table now.\n  OS << \"\\n#ifdef GET_DIAG_TABLE\\n\";\n  IDNo = 0;\n  for (std::map<std::string, GroupInfo>::iterator\n       I = DiagsInGroup.begin(), E = DiagsInGroup.end(); I != E; ++I) {\n    std::string S = I->first;\n    EscapeString(S);\n    \/\/ Group option string.\n    OS << \"  { \\\"\" << S << \"\\\",\"\n      << std::string(MaxLen-I->first.size()+1, ' ');\n    \n    \/\/ Diagnostics in the group.\n    if (I->second.DiagsInGroup.empty())\n      OS << \"0, \";\n    else\n      OS << \"DiagArray\" << IDNo++ << \", \";\n    \n    \/\/ FIXME: Subgroups.\n    OS << 0;\n    OS << \" },\\n\";\n  }\n  OS << \"#endif \/\/ GET_DIAG_TABLE\\n\\n\";\n}\n<commit_msg>encode subgroups into the clang .inc file.  -Wall now works!<commit_after>\/\/=- ClangDiagnosticsEmitter.cpp - Generate Clang diagnostics tables -*- 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\/\/ These tablegen backends emit Clang diagnostics tables.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"ClangDiagnosticsEmitter.h\"\n#include \"Record.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/Compiler.h\"\n#include \"llvm\/Support\/Streams.h\"\n#include \"llvm\/ADT\/DenseSet.h\"\n#include \"llvm\/ADT\/StringExtras.h\"\n#include \"llvm\/ADT\/VectorExtras.h\"\n#include <set>\n#include <map>\nusing namespace llvm;\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Warning Tables (.inc file) generation.\n\/\/===----------------------------------------------------------------------===\/\/\n\nvoid ClangDiagsDefsEmitter::run(std::ostream &OS) {\n  \/\/ Write the #if guard\n  if (!Component.empty()) {\n    std::string ComponentName = UppercaseString(Component);\n    OS << \"#ifdef \" << ComponentName << \"START\\n\";\n    OS << \"__\" << ComponentName << \"START = DIAG_START_\" << ComponentName\n       << \",\\n\";\n    OS << \"#undef \" << ComponentName << \"START\\n\";\n    OS << \"#endif\\n\";\n  }\n\n  const std::vector<Record*> &Diags =\n    Records.getAllDerivedDefinitions(\"Diagnostic\");\n  \n  for (unsigned i = 0, e = Diags.size(); i != e; ++i) {\n    const Record &R = *Diags[i];\n    \/\/ Filter by component.\n    if (!Component.empty() && Component != R.getValueAsString(\"Component\"))\n      continue;\n    \n    OS << \"DIAG(\" << R.getName() << \", \";\n    OS << R.getValueAsDef(\"Class\")->getName();\n    OS << \", diag::\" << R.getValueAsDef(\"DefaultMapping\")->getName();\n    OS << \", \\\"\";\n    std::string S = R.getValueAsString(\"Text\");\n    EscapeString(S);\n    OS << S << \"\\\")\\n\";\n  }\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Warning Group Tables generation\n\/\/===----------------------------------------------------------------------===\/\/\n\nstruct GroupInfo {\n  std::vector<const Record*> DiagsInGroup;\n  std::vector<std::string> SubGroups;\n  unsigned IDNo;\n};\n\nvoid ClangDiagGroupsEmitter::run(std::ostream &OS) {\n  \/\/ Invert the 1-[0\/1] mapping of diags to group into a one to many mapping of\n  \/\/ groups to diags in the group.\n  std::map<std::string, GroupInfo> DiagsInGroup;\n  \n  std::vector<Record*> Diags =\n    Records.getAllDerivedDefinitions(\"Diagnostic\");\n  for (unsigned i = 0, e = Diags.size(); i != e; ++i) {\n    const Record *R = Diags[i];\n    DefInit *DI = dynamic_cast<DefInit*>(R->getValueInit(\"Group\"));\n    if (DI == 0) continue;\n    std::string GroupName = DI->getDef()->getValueAsString(\"GroupName\");\n    DiagsInGroup[GroupName].DiagsInGroup.push_back(R);\n  }\n  \n  \/\/ Add all DiagGroup's to the DiagsInGroup list to make sure we pick up empty\n  \/\/ groups (these are warnings that GCC supports that clang never produces).\n  Diags = Records.getAllDerivedDefinitions(\"DiagGroup\");\n  for (unsigned i = 0, e = Diags.size(); i != e; ++i) {\n    Record *Group = Diags[i];\n    GroupInfo &GI = DiagsInGroup[Group->getValueAsString(\"GroupName\")];\n    \n    std::vector<Record*> SubGroups = Group->getValueAsListOfDefs(\"SubGroups\");\n    for (unsigned j = 0, e = SubGroups.size(); j != e; ++j)\n      GI.SubGroups.push_back(SubGroups[j]->getValueAsString(\"GroupName\"));\n  }\n  \n  \/\/ Assign unique ID numbers to the groups.\n  unsigned IDNo = 0;\n  for (std::map<std::string, GroupInfo>::iterator\n       I = DiagsInGroup.begin(), E = DiagsInGroup.end(); I != E; ++I, ++IDNo)\n    I->second.IDNo = IDNo;\n  \n  \/\/ Walk through the groups emitting an array for each diagnostic of the diags\n  \/\/ that are mapped to.\n  OS << \"\\n#ifdef GET_DIAG_ARRAYS\\n\";\n  unsigned MaxLen = 0;\n  for (std::map<std::string, GroupInfo>::iterator\n       I = DiagsInGroup.begin(), E = DiagsInGroup.end(); I != E; ++I) {\n    MaxLen = std::max(MaxLen, (unsigned)I->first.size());\n    \n    std::vector<const Record*> &V = I->second.DiagsInGroup;\n    if (!V.empty()) {\n      OS << \"static const short DiagArray\" << I->second.IDNo << \"[] = { \";\n      for (unsigned i = 0, e = V.size(); i != e; ++i)\n        OS << \"diag::\" << V[i]->getName() << \", \";\n      OS << \"-1 };\\n\";\n    }\n    \n    const std::vector<std::string> &SubGroups = I->second.SubGroups;\n    if (!SubGroups.empty()) {\n      OS << \"static const char DiagSubGroup\" << I->second.IDNo << \"[] = { \";\n      for (unsigned i = 0, e = SubGroups.size(); i != e; ++i) {\n        std::map<std::string, GroupInfo>::iterator RI =\n          DiagsInGroup.find(SubGroups[i]);\n        assert(RI != DiagsInGroup.end() && \"Referenced without existing?\");\n        OS << RI->second.IDNo << \", \";\n      }\n      OS << \"-1 };\\n\";\n    }\n  }\n  OS << \"#endif \/\/ GET_DIAG_ARRAYS\\n\\n\";\n  \n  \/\/ Emit the table now.\n  OS << \"\\n#ifdef GET_DIAG_TABLE\\n\";\n  for (std::map<std::string, GroupInfo>::iterator\n       I = DiagsInGroup.begin(), E = DiagsInGroup.end(); I != E; ++I) {\n    std::string S = I->first;\n    EscapeString(S);\n    \/\/ Group option string.\n    OS << \"  { \\\"\" << S << \"\\\",\"\n      << std::string(MaxLen-I->first.size()+1, ' ');\n    \n    \/\/ Diagnostics in the group.\n    if (I->second.DiagsInGroup.empty())\n      OS << \"0, \";\n    else\n      OS << \"DiagArray\" << I->second.IDNo << \", \";\n    \n    \/\/ Subgroups.\n    if (I->second.SubGroups.empty())\n      OS << 0;\n    else\n      OS << \"DiagSubGroup\" << I->second.IDNo;\n    OS << \" },\\n\";\n  }\n  OS << \"#endif \/\/ GET_DIAG_TABLE\\n\\n\";\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*******************************************************************************\n*    ALMA - Atacama Large Millimiter Array\n*    (c) European Southern Observatory, 2002\n*    Copyright by ESO (in the framework of the ALMA collaboration),\n*    All rights reserved\n*\n*    This library is free software; you can redistribute it and\/or\n*    modify it under the terms of the GNU Lesser General Public\n*    License as published by the Free Software Foundation; either\n*    version 2.1 of the License, or (at your option) any later version.\n*\n*    This library is distributed in the hope that it will be useful,\n*    but WITHOUT ANY WARRANTY; without even the implied warranty of\n*    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n*    Lesser General Public License for more details.\n*\n*    You should have received a copy of the GNU Lesser General Public\n*    License along with this library; if not, write to the Free Software\n*    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA\n*\n* \"@(#) $Id: baciBACIProperty.cpp,v 1.11 2010\/06\/30 09:24:53 bjeram Exp $\"\n*\n* who       when      what\n* --------  --------  ----------------------------------------------\n* dfugate 2005-01-17 created\n*\/\n\n\n#include \"baciBACIProperty.h\"\n#include \"baci.h\"\n\n#include \"baciUtil.h\"\n#include \"baciDB.h\"\n\n\nACE_RCSID(baci, baci, \"$Id: baciBACIProperty.cpp,v 1.11 2010\/06\/30 09:24:53 bjeram Exp $\");\n\nnamespace baci {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ BACIProperty\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nBACIProperty::BACIProperty(const ACE_CString& _name,\n\t\t\t   PropertyImplementator* _propertyImplementator,\n\t\t\t   CharacteristicModelImpl *characteristicModel,\n\t\t\t   const BACIValue& _defaultValue,\n\t\t\t   BACIComponent* component_p) :\n  name_m(_name), \n  propertyImplementator_mp(_propertyImplementator),\n  characteristicModel_mp(characteristicModel),\n  lastValue_m(_defaultValue), component_mp(component_p), \n  monitorVector_m(), triggerOnValueMonitor_m(false), \n  pollInterval_m(0), lastPollTime_m(0), monMinTriggerTime_m(0LL),\n  inDestructionState_m(false)\n{\n  ACS_TRACE(\"baci::BACIProperty::BACIProperty\");\n  ACS_DEBUG_PARAM(\"baci::BACIProperty::BACIProperty\", \"Creating property '%s'\", name_m.c_str());\n\n  \/\/ check\n  if (component_mp==0) \n    {\n      ACS_LOG(0, \"baci::BACIProperty::BACIProperty\", \n\t      (LM_ERROR, \"Null Component given! Constuction of property %s aborted.\", name_m.c_str()));\n      return;\n    }\n\n  \/\/ should not be null type\n  if (_defaultValue.isNull()!=0) \n    {\n      ACS_LOG(0, \"baci::BACIProperty::BACIProperty\", \n\t      (LM_ERROR, \"Null-type default value given! Constuction of property %s aborted.\", name_m.c_str()));\n      return;\n    }\n\n  \/\/\/ !!!! for Sequences default value is not the same as type\n  type_m = _defaultValue.getType();\n\n  \/* setup archiver - read from DB *\/\n  CORBA::ULong archive_priority = 3UL, archiveMinInt=0UL, archiveMaxInt=0UL;\n  BACIValue archiveDelta;\n  ACE_CString archiveMechanism;\n\n\n  cdb::DAONode* dao = characteristicModel_mp->getDAONode();\n  if (!dao)\n      return;\n  \n\n  try\n     {\n\t  archiveMechanism = dao->get_string(\"archive_mechanism\");\n     }\n  catch (...)\n     {\n\t  \/\/ noop\n     }\n\n  try\n      {\n      archive_priority = dao->get_long(\"archive_priority\");\n      }\n  catch (...)\n      {\n      \/\/ noop\n      }\n\n  try\n      {\n      CORBA::Double dbl = dao->get_double(\"archive_min_int\");\n      dbl = dbl * static_cast<CORBA::Double>(10000000.0);\n      archiveMinInt = static_cast<CORBA::ULong>(dbl);\n      }\n  catch(...)\n      {\n      \/\/ noop\n      }\n\n\n  try\n      {\n      CORBA::Double dbl = dao->get_double(\"archive_max_int\");\n      dbl = dbl * static_cast<CORBA::Double>(10000000.0);\n      archiveMaxInt = static_cast<CORBA::ULong>(dbl);\n      }\n  catch(...)\n      {\n      \/\/ noop\n      }\n\n  try\n      {\n      CORBA::String_var str = dao->get_string(\"archive_delta\");\n      \/\/ use no type definitions in stringified values, obtain it from defaultValue\n      archiveDelta.setType(type_m);\n      archiveDelta.fromString(str.in(), false);\n      }\n  catch (...)\n      {\n      \/\/ noop\n      }\n\n  if (archiveMechanism==\"notification_channel\" ||\n      archiveMinInt!=0 ||\n      archiveMaxInt!=0 || \n      (archiveDelta.isNull()==false && archiveDelta.noDelta()==false))\n    { \n      CBDescIn inDesc; \n      inDesc.id_tag = 0;\n      int callbackID = component_mp->registerCallback(BACIValue::type_null, 0, inDesc);\n      if (callbackID!=0)\n        {\n          \/\/ name must be w\/o device name\n          const char * pos_p = ACE_OS::strchr(name_m.c_str(), ':');\n          ACE_CString archiverName;\n          if (pos_p!=0)\n\t      {\n\t      archiverName = pos_p+1;\n\t      }\n          else\n\t      {\n\t      archiverName = name_m;\n\t      }\n\t  archiver_mp = new BACIMonitor(archiverName, callbackID, 0,\n\t\t\t\t     archiveMaxInt, archiveDelta, \n\t\t\t\t     archiveMinInt, BACIValue(BACIValue::NullValue),\n\t\t\t\t     this, 0, BACIMonitor::mumLast, true, false, true, archive_priority);\n        }\n    }\n  else\n    {\n      ACS_LOG(LM_RUNTIME_CONTEXT, \"baci::BACIProperty::BACIProperty\",\n    \t\t  (LM_DEBUG, \"Archiver disabled! (archive_mechanism=%s, archive_min_int=%d, archive_max_int=%d)\",\n    \t\t  archiveMechanism.c_str(), archiveMinInt, archiveMaxInt));\n      archiver_mp = 0;\n    }\n    \n  \/\/ add to Component's property list\n  component_mp->addProperty(this);\n}\n\nBACIProperty::~BACIProperty() {\n  ACS_TRACE(\"baci::BACIProperty::~BACIProperty\");\n  ACS_DEBUG_PARAM(\"baci::BACIProperty::~BACIProperty\", \"Destroying: %s\", getName());\n    \n  \/\/ set destruction flag\n  inDestructionState_m = true;\n\n  component_mp->removeProperty(this);\n\n  ACS_DEBUG_PARAM(\"baci::BACIProperty::~BACIProperty\", \"Now I will go through monitors of '%s'.\", getName());\n  \/*    \n  if (archiver_mp!=0) \n    delete archiver_mp;\n  *\/\n\n  ThreadSyncGuard guard(&monitorVectorMutex_m);\n  BACIMonitorVector vectorCopy(monitorVector_m);\n\n  for (BACIMonitorVector::iterator iter = vectorCopy.begin();\n       iter != vectorCopy.end(); \n       iter++)\n      {\n      (*iter)->internalDestroy();\n      }\n\n  ACS_DEBUG_PARAM(\"baci::BACIProperty::~BACIProperty\", \"Property '%s' destroyed.\", getName());\n}\n\t\nvoid BACIProperty::addMonitor(BACIMonitor* monitor) \n{\n  ACS_TRACE(\"baci::BACIProperty::addMonitor\");\n\n  if (inDestructionState_m==true) \n      {\n      return;\n      }\n\n  ThreadSyncGuard guard(&monitorVectorMutex_m);\n  monitorVector_m.push_back(monitor);\n  guard.release();\n  updateMonitorStates();\n}\n\nvoid BACIProperty::removeMonitor(BACIMonitor* monitor)\n{\n  ACS_TRACE(\"baci::BACIProperty::removeMonitor\");\n\n  if (inDestructionState_m==true) \n      {\n      return;\n      }\n\n  ThreadSyncGuard guard(&monitorVectorMutex_m);\n  BACIMonitorVector::iterator i = find(monitorVector_m.begin(), monitorVector_m.end(), monitor);\n  if (i!=monitorVector_m.end())\n      {\n      monitorVector_m.erase(i);\n      }\n  guard.release();\n  updateMonitorStates();\n}\n\nvoid BACIProperty::dispatchMonitors(Completion& completion, CBDescOut& descOut)\n{\n  if (component_mp->isInDestructionState()==true || inDestructionState_m==true) \n      {\n      return;\n      }\n  \n  BACIValue lastValue = getLastValue();\n  ACS::TimeInterval lastPollTime = getLastPollTime();\n  \/\/Completion lastCompletion = getLastCompletion();\n  \n  bool ok;\n\n  ACS::TimeInterval monitorTriggerTime, monitorLastTime;\n  BACIValue monitorTriggerValue;\n  \n  BACIMonitor* mon_p=0;\n\n  ThreadSyncGuard guard(&monitorVectorMutex_m);\n\n  for (int n=0; n<getMonitorCount() && inDestructionState_m==false; n++) \n    {\n      mon_p = getMonitorAt(n);\n      if (mon_p==0 || mon_p->isInDestructionState()==true || mon_p->isSuspended()==true ||\n\t  (mon_p->getTransmitTime()>lastPollTime)) \n\t  {\n\t  continue;\n\t  }\n      \n      \/\/ monitor name (used for archiving)\n      BACIMonitor * archiver_p = 0;\n      if (mon_p->isArchivingMonitor()==true) \n\t  {\n\t  archiver_p = mon_p;\n\t  }\n\n      monitorTriggerTime = mon_p->getTriggerTime();\n      monitorLastTime = mon_p->getLastTime();\n      \n      \/\/ on-time check\n      if (monitorTriggerTime > 0) \n\t  {\t  \n\t  if ((lastPollTime-monitorLastTime)>=monitorTriggerTime) \n\t      {\n\/*\n  completion.timeStamp = mon->getLastTime();\n  completion.code = ACSErr::ACSErrMonitorOnTimer;\t\t\/\/  time triggered\n  bool ok = component_mp->dispatchCallback(mon->getCallbackID(), lastValue, descOut, completion, archiver);\n  if (!ok && !component_mp->getCallback(mon->getCallbackID())->isOK() && !mon->isInDestructionState()) \n  {\t\/\/ removed\n  \/\/ACS_DEBUG(\"baci::BACIProperty::dispatchMonitors\", \"Before internalDestroy()\");\n  mon->internalDestroy(); n--;\n  continue;\n  }\n*\/\t    \n\t      switch (mon_p->getUpdateMode()) \n\t\t  {\n\t\t  case BACIMonitor::mumLast: \n\t\t  {\n\t\t  ACS::TimeInterval delay=calculateModulus(lastPollTime-monitorLastTime, monitorTriggerTime);\n\t\t  mon_p->setLastTime(lastPollTime-delay); \n\t\t  break; \n\t\t  }\n\t\t  case BACIMonitor::mumTrunc: \n\t\t  {\n\t\t  mon_p->setLastTime(lastPollTime); \n\t\t  break;\n\t\t  }\n\t\t  default: {}\n\t\t  }\n\n\t      if ( completion.previousError.length() == 0 ) \/\/ does completion contain an error ?\n\t\t  {\n\t\t  completion.timeStamp = mon_p->getLastTime();\n\t\t  completion.type = ACSErr::ACSErrTypeMonitor;\n\t\t  completion.code = ACSErrTypeMonitor::ACSErrMonitorOnTimer;\t       \/\/  time triggered\n\t\t  ok = component_mp->dispatchCallback(mon_p->getCallbackID(), lastValue, descOut, completion, archiver_p);\n\t\t  }\n\t      else\n\t\t  {\n\t\t    ACSErrTypeMonitor::ACSErrMonitorErrorCompletion c(completion, __FILE__, __LINE__, \"BACIProperty::dispatchMonitors\");\n\t\t  ok = component_mp->dispatchCallback(mon_p->getCallbackID(), lastValue, descOut, c, archiver_p);\t  \n\t\t  }\/\/if-else\n\t\t  \n\t      if (ok==false && \n\t\t  component_mp->getCallback(mon_p->getCallbackID())->isOK()==false && \n\t\t  mon_p->isInDestructionState()==false) \n\t\t  {\t\/\/ removed\n\t\t  \/\/ACS_DEBUG(\"baci::BACIProperty::dispatchMonitors\", \"Before internalDestroy()\");\n\t\t  mon_p->internalDestroy(); \n\t\t  n--;\n\t\t  continue;\n\t\t  }\/\/if\n\t      }\/\/if\n\t  }\/\/if\n      \n\n\n      \/\/ if this monitor is setup to be triggered when the property's underlying value\n      \/\/ reaches a specific delta value\n      if (mon_p->getTriggerOnValue() == true)\n\t  {\n\t  \/\/ monitorTriggerValue is a local copy of the monitor's trigger value\n\t  monitorTriggerValue = mon_p->getTriggerValue(); \n\t  \/\/ if the trigger value is not null and contains a delta value do something\n\t  if ((monitorTriggerValue.isNull()==0) && (monitorTriggerValue.noDelta()==false)) \n\t    {\n\t    \/\/create a copy of the last monitored value\n\t    BACIValue monitorLastValue=mon_p->getLastValue();\n\t    \n\t    \/\/ if the last monitored value is not null OR the \"lastValue\" (DWF-this looks like\n\t    \/\/ a bug to me...why not use the local copy just created!!!)\n\t    if (( (monitorLastValue.isNull()!=0 ) || (lastValue.lessThanDelta(monitorLastValue, monitorTriggerValue)==false))\n\t\t  && \n\t\t( (mon_p->isDeltaValueAndTimerInteraction()==false) || (lastPollTime-monitorLastTime)>=mon_p->getMinTriggerTime())\n\t\t  ) \n\t\t{\n\t\t\n\t\tif ( completion.previousError.length() == 0 ) \/\/ does completion contain an error ?\n\t\t    {\n\t\t    completion.type = ACSErr::ACSErrTypeMonitor;\n\t\t    completion.code = ACSErrTypeMonitor::ACSErrMonitorOnValue;\t \/\/  value triggered\n\t\t    ok = component_mp->dispatchCallback(mon_p->getCallbackID(), lastValue, descOut, completion, archiver_p);\n\t\t    }\n\t\telse\n\t\t    {\n\t\t    ACSErrTypeMonitor::ACSErrMonitorErrorCompletion c(completion, __FILE__, __LINE__, \"BACIProperty::dispatchMonitors\");\n\t\t    ok  = component_mp->dispatchCallback(mon_p->getCallbackID(), lastValue, descOut, c, archiver_p);\t  \n\t\t    }\/\/if-else\n\t\t\n\t\t  if (ok==false && \n\t\t      component_mp->getCallback(mon_p->getCallbackID())->isOK()==false && \n\t\t      mon_p->isInDestructionState()==false) \n\t\t    {\n\t\t      mon_p->internalDestroy(); \n\t\t      n--;\n\t\t      continue;\n\t\t    }\n\t      \n\t\t  mon_p->setLastValue(lastValue);\n\t\t  if (mon_p->isDeltaValueAndTimerInteraction()==true)\n\t\t      {\n\t\t      mon_p->setLastTime(lastPollTime);\n\t\t      }\n\t\t}\n\t    }\n\t}      \n    }\n}\n\nACS::TimeInterval BACIProperty::GCD(ACS::TimeInterval t1, ACS::TimeInterval t2) \n{\n  ACS_TRACE(\"baci::BACIProperty::GCD\");\n  if (t1==0) \n      {\n      return t2;\n      }\n  else if (t2==0) \n      {\n      return t1;\n      }\n  else if (t2>t1)\n    {\n      ACS::TimeInterval t = t2;\n      t2=t1; \n      t1=t;\n    }\n  \n  while ((t2!=0) && (t1>component_mp->getMTSleepTime())) \n    {\n    ACS::TimeInterval t=calculateModulus(t1,t2); \n    t1=t2; \n    t2=t;\n    }\n  \n  if (t1<component_mp->getMTSleepTime()) \n      {\n      t1=component_mp->getMTSleepTime();\n      }\n\n  return t1;\n}\n\nvoid BACIProperty::updateMonitorStates() \n{\n  ACS_TRACE(\"baci::BACIProperty::updateMonitorStates\");\n  \/\/ThreadSyncGuard guard(&monitorVectorMutex_m, !isInDestructionState());\n  \n  \/\/ update pollInterval\n  triggerOnValueMonitor_m=false;\n  setMonMinTriggerTime(0LL);\n  ACS::TimeInterval pi=0;\n  ACS::TimeInterval minTriggerTime = 0LL;\n \n  for (int n=0; n<getMonitorCount(); n++) \n    {\n      BACIMonitor *mon_p = getMonitorAt(n);\n      if (mon_p!=0 && \n\t  mon_p->isSuspended()==false) \n\t{\n\t  if (mon_p->getTriggerOnValue() == true)\n\t      {\n\t      triggerOnValueMonitor_m=true;\n\t      \/\/first time being set...take the monitor's value!\n\t      if (minTriggerTime==0)\n\t\t  {\n\t\t  minTriggerTime = mon_p->getMinTriggerTime();\n\t\t  }\n\t      \/\/new monitor value is smaller...take it!\n\t      else if (minTriggerTime < mon_p->getMinTriggerTime())\n\t\t  {\n\t\t  minTriggerTime = mon_p->getMinTriggerTime();\n\t\t  }\n\t      }\n\n\t  pi=GCD(pi, mon_p->getTriggerTime());\n\t}\n    }\n  setPollInterval(pi);\n  setMonMinTriggerTime(minTriggerTime);\n}\n\n\n\n }; \n\n\/*___oOo___*\/\n\n\n<commit_msg>archive monitor is created if archive_suppress is false (COMp-3900)<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: baciBACIProperty.cpp,v 1.12 2010\/07\/05 10:54:19 bjeram Exp $\"\n*\n* who       when      what\n* --------  --------  ----------------------------------------------\n* dfugate 2005-01-17 created\n*\/\n\n\n#include \"baciBACIProperty.h\"\n#include \"baci.h\"\n\n#include \"baciUtil.h\"\n#include \"baciDB.h\"\n\n\nACE_RCSID(baci, baci, \"$Id: baciBACIProperty.cpp,v 1.12 2010\/07\/05 10:54:19 bjeram Exp $\");\n\nnamespace baci {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ BACIProperty\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nBACIProperty::BACIProperty(const ACE_CString& _name,\n\t\t\t   PropertyImplementator* _propertyImplementator,\n\t\t\t   CharacteristicModelImpl *characteristicModel,\n\t\t\t   const BACIValue& _defaultValue,\n\t\t\t   BACIComponent* component_p) :\n  name_m(_name), \n  propertyImplementator_mp(_propertyImplementator),\n  characteristicModel_mp(characteristicModel),\n  lastValue_m(_defaultValue), component_mp(component_p), \n  monitorVector_m(), triggerOnValueMonitor_m(false), \n  pollInterval_m(0), lastPollTime_m(0), monMinTriggerTime_m(0LL),\n  inDestructionState_m(false)\n{\n  ACS_TRACE(\"baci::BACIProperty::BACIProperty\");\n  ACS_DEBUG_PARAM(\"baci::BACIProperty::BACIProperty\", \"Creating property '%s'\", name_m.c_str());\n\n  \/\/ check\n  if (component_mp==0) \n    {\n      ACS_LOG(0, \"baci::BACIProperty::BACIProperty\", \n\t      (LM_ERROR, \"Null Component given! Constuction of property %s aborted.\", name_m.c_str()));\n      return;\n    }\n\n  \/\/ should not be null type\n  if (_defaultValue.isNull()!=0) \n    {\n      ACS_LOG(0, \"baci::BACIProperty::BACIProperty\", \n\t      (LM_ERROR, \"Null-type default value given! Constuction of property %s aborted.\", name_m.c_str()));\n      return;\n    }\n\n  \/\/\/ !!!! for Sequences default value is not the same as type\n  type_m = _defaultValue.getType();\n\n  \/* setup archiver - read from DB *\/\n  CORBA::ULong archive_priority = 3UL, archiveMinInt=0UL, archiveMaxInt=0UL;\n  BACIValue archiveDelta;\n  ACE_CString archiveMechanism, archiveSuppress;\n\n\n  cdb::DAONode* dao = characteristicModel_mp->getDAONode();\n  if (!dao)\n      return;\n  \n\n  try\n     {\n\t  archiveMechanism = dao->get_string(\"archive_mechanism\");\n\t  archiveSuppress = dao->get_string(\"archive_suppress\");\n     }\n  catch (...)\n     {\n\t  \/\/ noop\n     }\n\n   try\n      {\n      archive_priority = dao->get_long(\"archive_priority\");\n      }\n  catch (...)\n      {\n      \/\/ noop\n      }\n\n  try\n      {\n      CORBA::Double dbl = dao->get_double(\"archive_min_int\");\n      dbl = dbl * static_cast<CORBA::Double>(10000000.0);\n      archiveMinInt = static_cast<CORBA::ULong>(dbl);\n      }\n  catch(...)\n      {\n      \/\/ noop\n      }\n\n\n  try\n      {\n      CORBA::Double dbl = dao->get_double(\"archive_max_int\");\n      dbl = dbl * static_cast<CORBA::Double>(10000000.0);\n      archiveMaxInt = static_cast<CORBA::ULong>(dbl);\n      }\n  catch(...)\n      {\n      \/\/ noop\n      }\n\n  try\n      {\n      CORBA::String_var str = dao->get_string(\"archive_delta\");\n      \/\/ use no type definitions in stringified values, obtain it from defaultValue\n      archiveDelta.setType(type_m);\n      archiveDelta.fromString(str.in(), false);\n      }\n  catch (...)\n      {\n      \/\/ noop\n      }\n\n    if (\n      archiveSuppress == \"false\" &&\n      archiveMechanism == \"notification_channel\" &&\n      (archiveMinInt!=0 ||\n      archiveMaxInt!=0 ||\n      (archiveDelta.isNull()==false && archiveDelta.noDelta()==false)))\n    { \n      CBDescIn inDesc; \n      inDesc.id_tag = 0;\n      int callbackID = component_mp->registerCallback(BACIValue::type_null, 0, inDesc);\n      if (callbackID!=0)\n        {\n          \/\/ name must be w\/o device name\n          const char * pos_p = ACE_OS::strchr(name_m.c_str(), ':');\n          ACE_CString archiverName;\n          if (pos_p!=0)\n\t      {\n\t      archiverName = pos_p+1;\n\t      }\n          else\n\t      {\n\t      archiverName = name_m;\n\t      }\n\t  archiver_mp = new BACIMonitor(archiverName, callbackID, 0,\n\t\t\t\t     archiveMaxInt, archiveDelta, \n\t\t\t\t     archiveMinInt, BACIValue(BACIValue::NullValue),\n\t\t\t\t     this, 0, BACIMonitor::mumLast, true, false, true, archive_priority);\n        }\n    }\n  else\n    {\n      ACS_LOG(LM_RUNTIME_CONTEXT, \"baci::BACIProperty::BACIProperty\",\n    \t\t  (LM_DEBUG, \"Archiver disabled! (archive_suppress=%s, archive_mechanism=%s, archive_min_int=%d, archive_max_int=%d)\",\n    \t\t  archiveSuppress.c_str(), archiveMechanism.c_str(),\n    \t\t  archiveMinInt, archiveMaxInt));\n      archiver_mp = 0;\n    }\n    \n  \/\/ add to Component's property list\n  component_mp->addProperty(this);\n}\n\nBACIProperty::~BACIProperty() {\n  ACS_TRACE(\"baci::BACIProperty::~BACIProperty\");\n  ACS_DEBUG_PARAM(\"baci::BACIProperty::~BACIProperty\", \"Destroying: %s\", getName());\n    \n  \/\/ set destruction flag\n  inDestructionState_m = true;\n\n  component_mp->removeProperty(this);\n\n  ACS_DEBUG_PARAM(\"baci::BACIProperty::~BACIProperty\", \"Now I will go through monitors of '%s'.\", getName());\n  \/*    \n  if (archiver_mp!=0) \n    delete archiver_mp;\n  *\/\n\n  ThreadSyncGuard guard(&monitorVectorMutex_m);\n  BACIMonitorVector vectorCopy(monitorVector_m);\n\n  for (BACIMonitorVector::iterator iter = vectorCopy.begin();\n       iter != vectorCopy.end(); \n       iter++)\n      {\n      (*iter)->internalDestroy();\n      }\n\n  ACS_DEBUG_PARAM(\"baci::BACIProperty::~BACIProperty\", \"Property '%s' destroyed.\", getName());\n}\n\t\nvoid BACIProperty::addMonitor(BACIMonitor* monitor) \n{\n  ACS_TRACE(\"baci::BACIProperty::addMonitor\");\n\n  if (inDestructionState_m==true) \n      {\n      return;\n      }\n\n  ThreadSyncGuard guard(&monitorVectorMutex_m);\n  monitorVector_m.push_back(monitor);\n  guard.release();\n  updateMonitorStates();\n}\n\nvoid BACIProperty::removeMonitor(BACIMonitor* monitor)\n{\n  ACS_TRACE(\"baci::BACIProperty::removeMonitor\");\n\n  if (inDestructionState_m==true) \n      {\n      return;\n      }\n\n  ThreadSyncGuard guard(&monitorVectorMutex_m);\n  BACIMonitorVector::iterator i = find(monitorVector_m.begin(), monitorVector_m.end(), monitor);\n  if (i!=monitorVector_m.end())\n      {\n      monitorVector_m.erase(i);\n      }\n  guard.release();\n  updateMonitorStates();\n}\n\nvoid BACIProperty::dispatchMonitors(Completion& completion, CBDescOut& descOut)\n{\n  if (component_mp->isInDestructionState()==true || inDestructionState_m==true) \n      {\n      return;\n      }\n  \n  BACIValue lastValue = getLastValue();\n  ACS::TimeInterval lastPollTime = getLastPollTime();\n  \/\/Completion lastCompletion = getLastCompletion();\n  \n  bool ok;\n\n  ACS::TimeInterval monitorTriggerTime, monitorLastTime;\n  BACIValue monitorTriggerValue;\n  \n  BACIMonitor* mon_p=0;\n\n  ThreadSyncGuard guard(&monitorVectorMutex_m);\n\n  for (int n=0; n<getMonitorCount() && inDestructionState_m==false; n++) \n    {\n      mon_p = getMonitorAt(n);\n      if (mon_p==0 || mon_p->isInDestructionState()==true || mon_p->isSuspended()==true ||\n\t  (mon_p->getTransmitTime()>lastPollTime)) \n\t  {\n\t  continue;\n\t  }\n      \n      \/\/ monitor name (used for archiving)\n      BACIMonitor * archiver_p = 0;\n      if (mon_p->isArchivingMonitor()==true) \n\t  {\n\t  archiver_p = mon_p;\n\t  }\n\n      monitorTriggerTime = mon_p->getTriggerTime();\n      monitorLastTime = mon_p->getLastTime();\n      \n      \/\/ on-time check\n      if (monitorTriggerTime > 0) \n\t  {\t  \n\t  if ((lastPollTime-monitorLastTime)>=monitorTriggerTime) \n\t      {\n\/*\n  completion.timeStamp = mon->getLastTime();\n  completion.code = ACSErr::ACSErrMonitorOnTimer;\t\t\/\/  time triggered\n  bool ok = component_mp->dispatchCallback(mon->getCallbackID(), lastValue, descOut, completion, archiver);\n  if (!ok && !component_mp->getCallback(mon->getCallbackID())->isOK() && !mon->isInDestructionState()) \n  {\t\/\/ removed\n  \/\/ACS_DEBUG(\"baci::BACIProperty::dispatchMonitors\", \"Before internalDestroy()\");\n  mon->internalDestroy(); n--;\n  continue;\n  }\n*\/\t    \n\t      switch (mon_p->getUpdateMode()) \n\t\t  {\n\t\t  case BACIMonitor::mumLast: \n\t\t  {\n\t\t  ACS::TimeInterval delay=calculateModulus(lastPollTime-monitorLastTime, monitorTriggerTime);\n\t\t  mon_p->setLastTime(lastPollTime-delay); \n\t\t  break; \n\t\t  }\n\t\t  case BACIMonitor::mumTrunc: \n\t\t  {\n\t\t  mon_p->setLastTime(lastPollTime); \n\t\t  break;\n\t\t  }\n\t\t  default: {}\n\t\t  }\n\n\t      if ( completion.previousError.length() == 0 ) \/\/ does completion contain an error ?\n\t\t  {\n\t\t  completion.timeStamp = mon_p->getLastTime();\n\t\t  completion.type = ACSErr::ACSErrTypeMonitor;\n\t\t  completion.code = ACSErrTypeMonitor::ACSErrMonitorOnTimer;\t       \/\/  time triggered\n\t\t  ok = component_mp->dispatchCallback(mon_p->getCallbackID(), lastValue, descOut, completion, archiver_p);\n\t\t  }\n\t      else\n\t\t  {\n\t\t    ACSErrTypeMonitor::ACSErrMonitorErrorCompletion c(completion, __FILE__, __LINE__, \"BACIProperty::dispatchMonitors\");\n\t\t  ok = component_mp->dispatchCallback(mon_p->getCallbackID(), lastValue, descOut, c, archiver_p);\t  \n\t\t  }\/\/if-else\n\t\t  \n\t      if (ok==false && \n\t\t  component_mp->getCallback(mon_p->getCallbackID())->isOK()==false && \n\t\t  mon_p->isInDestructionState()==false) \n\t\t  {\t\/\/ removed\n\t\t  \/\/ACS_DEBUG(\"baci::BACIProperty::dispatchMonitors\", \"Before internalDestroy()\");\n\t\t  mon_p->internalDestroy(); \n\t\t  n--;\n\t\t  continue;\n\t\t  }\/\/if\n\t      }\/\/if\n\t  }\/\/if\n      \n\n\n      \/\/ if this monitor is setup to be triggered when the property's underlying value\n      \/\/ reaches a specific delta value\n      if (mon_p->getTriggerOnValue() == true)\n\t  {\n\t  \/\/ monitorTriggerValue is a local copy of the monitor's trigger value\n\t  monitorTriggerValue = mon_p->getTriggerValue(); \n\t  \/\/ if the trigger value is not null and contains a delta value do something\n\t  if ((monitorTriggerValue.isNull()==0) && (monitorTriggerValue.noDelta()==false)) \n\t    {\n\t    \/\/create a copy of the last monitored value\n\t    BACIValue monitorLastValue=mon_p->getLastValue();\n\t    \n\t    \/\/ if the last monitored value is not null OR the \"lastValue\" (DWF-this looks like\n\t    \/\/ a bug to me...why not use the local copy just created!!!)\n\t    if (( (monitorLastValue.isNull()!=0 ) || (lastValue.lessThanDelta(monitorLastValue, monitorTriggerValue)==false))\n\t\t  && \n\t\t( (mon_p->isDeltaValueAndTimerInteraction()==false) || (lastPollTime-monitorLastTime)>=mon_p->getMinTriggerTime())\n\t\t  ) \n\t\t{\n\t\t\n\t\tif ( completion.previousError.length() == 0 ) \/\/ does completion contain an error ?\n\t\t    {\n\t\t    completion.type = ACSErr::ACSErrTypeMonitor;\n\t\t    completion.code = ACSErrTypeMonitor::ACSErrMonitorOnValue;\t \/\/  value triggered\n\t\t    ok = component_mp->dispatchCallback(mon_p->getCallbackID(), lastValue, descOut, completion, archiver_p);\n\t\t    }\n\t\telse\n\t\t    {\n\t\t    ACSErrTypeMonitor::ACSErrMonitorErrorCompletion c(completion, __FILE__, __LINE__, \"BACIProperty::dispatchMonitors\");\n\t\t    ok  = component_mp->dispatchCallback(mon_p->getCallbackID(), lastValue, descOut, c, archiver_p);\t  \n\t\t    }\/\/if-else\n\t\t\n\t\t  if (ok==false && \n\t\t      component_mp->getCallback(mon_p->getCallbackID())->isOK()==false && \n\t\t      mon_p->isInDestructionState()==false) \n\t\t    {\n\t\t      mon_p->internalDestroy(); \n\t\t      n--;\n\t\t      continue;\n\t\t    }\n\t      \n\t\t  mon_p->setLastValue(lastValue);\n\t\t  if (mon_p->isDeltaValueAndTimerInteraction()==true)\n\t\t      {\n\t\t      mon_p->setLastTime(lastPollTime);\n\t\t      }\n\t\t}\n\t    }\n\t}      \n    }\n}\n\nACS::TimeInterval BACIProperty::GCD(ACS::TimeInterval t1, ACS::TimeInterval t2) \n{\n  ACS_TRACE(\"baci::BACIProperty::GCD\");\n  if (t1==0) \n      {\n      return t2;\n      }\n  else if (t2==0) \n      {\n      return t1;\n      }\n  else if (t2>t1)\n    {\n      ACS::TimeInterval t = t2;\n      t2=t1; \n      t1=t;\n    }\n  \n  while ((t2!=0) && (t1>component_mp->getMTSleepTime())) \n    {\n    ACS::TimeInterval t=calculateModulus(t1,t2); \n    t1=t2; \n    t2=t;\n    }\n  \n  if (t1<component_mp->getMTSleepTime()) \n      {\n      t1=component_mp->getMTSleepTime();\n      }\n\n  return t1;\n}\n\nvoid BACIProperty::updateMonitorStates() \n{\n  ACS_TRACE(\"baci::BACIProperty::updateMonitorStates\");\n  \/\/ThreadSyncGuard guard(&monitorVectorMutex_m, !isInDestructionState());\n  \n  \/\/ update pollInterval\n  triggerOnValueMonitor_m=false;\n  setMonMinTriggerTime(0LL);\n  ACS::TimeInterval pi=0;\n  ACS::TimeInterval minTriggerTime = 0LL;\n \n  for (int n=0; n<getMonitorCount(); n++) \n    {\n      BACIMonitor *mon_p = getMonitorAt(n);\n      if (mon_p!=0 && \n\t  mon_p->isSuspended()==false) \n\t{\n\t  if (mon_p->getTriggerOnValue() == true)\n\t      {\n\t      triggerOnValueMonitor_m=true;\n\t      \/\/first time being set...take the monitor's value!\n\t      if (minTriggerTime==0)\n\t\t  {\n\t\t  minTriggerTime = mon_p->getMinTriggerTime();\n\t\t  }\n\t      \/\/new monitor value is smaller...take it!\n\t      else if (minTriggerTime < mon_p->getMinTriggerTime())\n\t\t  {\n\t\t  minTriggerTime = mon_p->getMinTriggerTime();\n\t\t  }\n\t      }\n\n\t  pi=GCD(pi, mon_p->getTriggerTime());\n\t}\n    }\n  setPollInterval(pi);\n  setMonMinTriggerTime(minTriggerTime);\n}\n\n\n\n }; \n\n\/*___oOo___*\/\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * CommandLineArgs.cpp\n *\n *  Created on: 02.05.2016\n *      Author: hartung\n *\/\n\n#include \"initialization\/CommandLineArgs.hpp\"\n\n#include <boost\/program_options.hpp>\n#include <boost\/filesystem.hpp>\n#include <boost\/algorithm\/string\/split.hpp>\n#include <boost\/algorithm\/string\/classification.hpp>\n\nnamespace Initialization\n{\n\n    CommandLineArgs::CommandLineArgs(const std::string & configFile, const Util::LogLevel & logLvl)\n            : _configFilePath(configFile),\n              _logSettings(Util::LogSettings()),\n              _simulationServerPort(-1),\n              _simulationClient(false),\n              _argc(nullptr),\n              _argv(nullptr)\n    {\n        _logSettings.setAll(logLvl);\n    }\n\n    CommandLineArgs::CommandLineArgs(int * argc, char ** argv[])\n            : _configFilePath(\"\"),\n              _logSettings(Util::LogSettings()),\n              _simulationServerPort(-1),\n              _simulationClient(false),\n              _argc(nullptr),\n              _argv(nullptr)\n    {\n        initialize(argc, argv);\n    }\n\n    const std::string& CommandLineArgs::getConfigFilePath() const\n    {\n        return _configFilePath;\n    }\n\n    const Util::LogSettings & CommandLineArgs::getLogSettings() const\n    {\n        return _logSettings;\n    }\n\n    Util::LogSettings & CommandLineArgs::getLogSettings()\n    {\n        return _logSettings;\n    }\n\n    tuple<int *, char ***> CommandLineArgs::getProgramArgs()\n    {\n        \/\/if(_argc == nullptr || _argv == nullptr)\n        \/\/throw std::runtime_error(\"CommandLineArgs: cannot access program arguments, they wasn't set.\");\n        return make_tuple(_argc, _argv);\n    }\n\n    tuple<const int *, const char ***> CommandLineArgs::getProgramArgs() const\n    {\n        \/\/ Infinite recursion\n        \/\/return getProgramArgs();\n    }\n\n    void CommandLineArgs::initialize(int * argc, char ** argv[])\n    {\n        map<std::string, Util::LogCategory> logCatMap = getLogCatMap();\n\n        map<std::string, Util::LogLevel> logLvlMap = getLogLvlMap();\n\n        namespace po = boost::program_options;\n        po::options_description desc(\"Options\");\n        desc.add_options()(\"help\", \"Print help messages\")(\"configFile,c\", boost::program_options::value<std::string>()->required(), \"Path to the configuration file containing detailed information about the FMUs\")(\"log-settings,V\", po::value<vector<std::string> >(), \"log information: loader, event, solver, system, other\")(\n        \/\/\"numThreads,n\", po::value<size_type>(), \"The number of threads respectively processes to use\")(\n                \"server,S\", po::value<int>(), \"Setting up an simulation server based on NetworkOffloader interface. Takes the port on which it should open\")(\"client,C\", \"Starting a client program for remote connection based on the NetworkOffload interface\");\n\n        po::variables_map vm;\n        this->_argc = argc;\n        this->_argv = argv;\n        try\n        {\n            po::store(po::parse_command_line(*argc, *argv, desc), vm);\n\n            if (vm.count(\"help\"))\n            {\n                cout << \"Basic Command Line Parameter App\" << endl << desc << endl;\n                return;\n            }\n            if (vm.count(\"server\"))\n            {\n#ifdef USE_NETWORK_OFFLOADER\n                cout << \"Creating FMU calculation server.\" << endl;\n                _simulationServerPort = vm[\"server\"].as<int>();\n#else\n                throw std::runtime_error(\"FMU server is not supported, since submodule NetworkOffloader is missing or hasn't been build.\");\n#endif\n            }\n\n            if (vm.count(\"client\"))\n            {\n#ifdef USE_NETWORK_OFFLOADER\n                cout << \"Creating FMU client.\" << endl;\n                throw std::runtime_error(\"FMU client is not supported, yet.\");\n                _simulationClient = true;\n#else\n                throw std::runtime_error(\"FMU client is not supported, since submodule NetworkOffloader is missing or hasn't been build.\");\n#endif\n            }\n\n            if (vm.count(\"configFile\"))\n                this->_configFilePath = vm[\"configFile\"].as<std::string>();\n            else\n                throw runtime_error(\"Path to configuration file required, but missing.\");\n\n            Util::LogSettings logSet;\n            if (vm.count(\"log-settings\"))\n            {\n                vector<std::string> log_vec = vm[\"log-settings\"].as<vector<std::string> >(), tmpvec;\n                for (unsigned i = 0; i < log_vec.size(); ++i)\n                {\n                    tmpvec.clear();\n                    boost::split(tmpvec, log_vec[i], boost::is_any_of(\"=\"));\n\n                    if (tmpvec.size() > 1 && logLvlMap.find(tmpvec[1]) != logLvlMap.end() && (tmpvec[0] == \"all\" || logCatMap.find(tmpvec[0]) != logCatMap.end()))\n                    {\n                        if (tmpvec[0] == \"all\")\n                        {\n                            logSet.setAll(logLvlMap[tmpvec[1]]);\n                            break;\n                        }\n                        else\n                            logSet.modes[logCatMap[tmpvec[0]]] = logLvlMap[tmpvec[1]];\n                    }\n                    else\n                        throw runtime_error(\"log-settings flags not supported: \" + log_vec[i] + \"\\n\");\n                }\n                this->_logSettings = logSet;\n            }\n        }\n        catch (po::error& e)\n        {\n            throw runtime_error((std::string(\"Cannot parse command line arguments. \") + std::string(e.what())).c_str());\n        }\n    }\n\n    map<std::string, Util::LogCategory> CommandLineArgs::getLogCatMap()\n    {\n        map<std::string, Util::LogCategory> logCatMap;\n        logCatMap[\"loader\"] = Util::LC_LOADER;\n        logCatMap[\"event\"] = Util::LC_EVT;\n        logCatMap[\"solver\"] = Util::LC_SOLVER;\n        logCatMap[\"system\"] = Util::LC_SYS;\n        logCatMap[\"other\"] = Util::LC_OTHER;\n        return logCatMap;\n    }\n\n    bool CommandLineArgs::isSimulationServer() const\n    {\n        return _simulationServerPort != -1;\n    }\n\n    bool CommandLineArgs::isSimulationClient() const\n    {\n        return _simulationClient;\n    }\n\n    int CommandLineArgs::getSimulationServerPort() const\n    {\n        return _simulationServerPort;\n    }\n\n    map<std::string, Util::LogLevel> CommandLineArgs::getLogLvlMap()\n    {\n        map<std::string, Util::LogLevel> logLvlMap;\n        logLvlMap[\"error\"] = Util::LL_ERROR;\n        logLvlMap[\"warning\"] = Util::LL_WARNING;\n        logLvlMap[\"info\"] = Util::LL_INFO;\n        logLvlMap[\"debug\"] = Util::LL_DEBUG;\n        return logLvlMap;\n    }\n\n}  \/\/ namespace Initialization\n\n<commit_msg>Cosmetic changes<commit_after>\/*\n * CommandLineArgs.cpp\n *\n *  Created on: 02.05.2016\n *      Author: hartung\n *\/\n\n#include \"initialization\/CommandLineArgs.hpp\"\n\n#include <boost\/program_options.hpp>\n#include <boost\/filesystem.hpp>\n#include <boost\/algorithm\/string\/split.hpp>\n#include <boost\/algorithm\/string\/classification.hpp>\n\nnamespace Initialization\n{\n\n    CommandLineArgs::CommandLineArgs(const std::string & configFile, const Util::LogLevel & logLvl)\n            : _configFilePath(configFile),\n              _logSettings(Util::LogSettings()),\n              _simulationServerPort(-1),\n              _simulationClient(false),\n              _argc(nullptr),\n              _argv(nullptr)\n    {\n        _logSettings.setAll(logLvl);\n    }\n\n    CommandLineArgs::CommandLineArgs(int * argc, char ** argv[])\n            : _configFilePath(\"\"),\n              _logSettings(Util::LogSettings()),\n              _simulationServerPort(-1),\n              _simulationClient(false),\n              _argc(nullptr),\n              _argv(nullptr)\n    {\n        initialize(argc, argv);\n    }\n\n    const std::string& CommandLineArgs::getConfigFilePath() const\n    {\n        return _configFilePath;\n    }\n\n    const Util::LogSettings & CommandLineArgs::getLogSettings() const\n    {\n        return _logSettings;\n    }\n\n    Util::LogSettings & CommandLineArgs::getLogSettings()\n    {\n        return _logSettings;\n    }\n\n    tuple<int *, char ***> CommandLineArgs::getProgramArgs()\n    {\n        \/\/if(_argc == nullptr || _argv == nullptr)\n        \/\/throw std::runtime_error(\"CommandLineArgs: cannot access program arguments, they wasn't set.\");\n        return make_tuple(_argc, _argv);\n    }\n\n    tuple<const int *, const char ***> CommandLineArgs::getProgramArgs() const\n    {\n        \/\/ Infinite recursion\n        \/\/return getProgramArgs();\n    }\n\n    void CommandLineArgs::initialize(int * argc, char ** argv[])\n    {\n        map<std::string, Util::LogCategory> logCatMap = getLogCatMap();\n\n        map<std::string, Util::LogLevel> logLvlMap = getLogLvlMap();\n\n        namespace po = boost::program_options;\n        po::options_description desc(\"Options\");\n        desc.add_options()(\"help\", \"Print help messages\")\n                          (\"configFile,c\", boost::program_options::value<std::string>()->required(),\n                           \"Path to the configuration file containing detailed information about the FMUs\")\n                          (\"log-settings,V\", po::value<vector<std::string> >(),\n                           \"log information: loader, event, solver, system, other\")\n                          \/\/\"numThreads,n\", po::value<size_type>(), \"The number of threads respectively processes to use\")\n                          (\"server,S\", po::value<int>(),\n                           \"Setting up an simulation server based on NetworkOffloader interface. Takes the port on which it should open\")\n                          (\"client,C\", \"Starting a client program for remote connection based on the NetworkOffload interface\");\n\n        po::variables_map vm;\n        this->_argc = argc;\n        this->_argv = argv;\n        try\n        {\n            po::store(po::parse_command_line(*argc, *argv, desc), vm);\n\n            if (vm.count(\"help\"))\n            {\n                cout << \"Basic Command Line Parameter App\" << endl << desc << endl;\n                return;\n            }\n            if (vm.count(\"server\"))\n            {\n#ifdef USE_NETWORK_OFFLOADER\n                cout << \"Creating FMU calculation server.\" << endl;\n                _simulationServerPort = vm[\"server\"].as<int>();\n#else\n                throw std::runtime_error(\"FMU server is not supported, since submodule NetworkOffloader is missing or hasn't been build.\");\n#endif\n            }\n\n            if (vm.count(\"client\"))\n            {\n#ifdef USE_NETWORK_OFFLOADER\n                cout << \"Creating FMU client.\" << endl;\n                throw std::runtime_error(\"FMU client is not supported, yet.\");\n                _simulationClient = true;\n#else\n                throw std::runtime_error(\"FMU client is not supported, since submodule NetworkOffloader is missing or hasn't been build.\");\n#endif\n            }\n\n            if (vm.count(\"configFile\"))\n                this->_configFilePath = vm[\"configFile\"].as<std::string>();\n            else\n                throw runtime_error(\"Path to configuration file required, but missing.\");\n\n            Util::LogSettings logSet;\n            if (vm.count(\"log-settings\"))\n            {\n                vector<std::string> log_vec = vm[\"log-settings\"].as<vector<std::string> >(), tmpvec;\n                for (unsigned i = 0; i < log_vec.size(); ++i)\n                {\n                    tmpvec.clear();\n                    boost::split(tmpvec, log_vec[i], boost::is_any_of(\"=\"));\n\n                    if (tmpvec.size() > 1 && logLvlMap.find(tmpvec[1]) != logLvlMap.end() && (tmpvec[0] == \"all\" || logCatMap.find(tmpvec[0]) != logCatMap.end()))\n                    {\n                        if (tmpvec[0] == \"all\")\n                        {\n                            logSet.setAll(logLvlMap[tmpvec[1]]);\n                            break;\n                        }\n                        else\n                            logSet.modes[logCatMap[tmpvec[0]]] = logLvlMap[tmpvec[1]];\n                    }\n                    else\n                        throw runtime_error(\"log-settings flags not supported: \" + log_vec[i] + \"\\n\");\n                }\n                this->_logSettings = logSet;\n            }\n        }\n        catch (po::error& e)\n        {\n            throw runtime_error((std::string(\"Cannot parse command line arguments. \") + std::string(e.what())).c_str());\n        }\n    }\n\n    map<std::string, Util::LogCategory> CommandLineArgs::getLogCatMap()\n    {\n        map<std::string, Util::LogCategory> logCatMap;\n        logCatMap[\"loader\"] = Util::LC_LOADER;\n        logCatMap[\"event\"] = Util::LC_EVT;\n        logCatMap[\"solver\"] = Util::LC_SOLVER;\n        logCatMap[\"system\"] = Util::LC_SYS;\n        logCatMap[\"other\"] = Util::LC_OTHER;\n        return logCatMap;\n    }\n\n    bool CommandLineArgs::isSimulationServer() const\n    {\n        return _simulationServerPort != -1;\n    }\n\n    bool CommandLineArgs::isSimulationClient() const\n    {\n        return _simulationClient;\n    }\n\n    int CommandLineArgs::getSimulationServerPort() const\n    {\n        return _simulationServerPort;\n    }\n\n    map<std::string, Util::LogLevel> CommandLineArgs::getLogLvlMap()\n    {\n        map<std::string, Util::LogLevel> logLvlMap;\n        logLvlMap[\"error\"] = Util::LL_ERROR;\n        logLvlMap[\"warning\"] = Util::LL_WARNING;\n        logLvlMap[\"info\"] = Util::LL_INFO;\n        logLvlMap[\"debug\"] = Util::LL_DEBUG;\n        return logLvlMap;\n    }\n\n}  \/\/ namespace Initialization\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (C) 2012-2017 Leap Motion, Inc. All rights reserved.\n#include \"stdafx.h\"\n#include \"CircularBufferEndpoint.h\"\n#include <system_error>\n\nusing namespace leap::ipc;\n\nCircularBufferEndpoint::CircularBufferEndpoint(size_t bufferSize) :\n  m_data{new uint8_t[bufferSize]},\n  m_capacity{bufferSize}\n{\n}\n\nstd::streamsize CircularBufferEndpoint::ReadRaw(void* buffer, std::streamsize size)\n{\n  {\n    std::unique_lock<std::mutex> lock(m_dataMutex);\n    m_lastReadSize = size;\n    m_dataCV.wait(lock, [this] {\n      auto read = readAvailable();\n      const auto write = m_capacity - read;\n      if (m_lastReadSize > read && m_lastWriteSize > write) {\n        resizeUnsafe(std::max<size_t>(m_lastReadSize + m_lastWriteSize, m_capacity * 2));\n        read = m_writeIdx;\n      }\n      return read >= m_lastReadSize;\n    });\n\n    \/\/ there are 'size' bytes available in the buffer\n    readUnsafe(buffer, size);\n\n    m_lastReadSize = 0;\n  }\n  m_dataCV.notify_one();\n\n  return size;\n}\n\nbool CircularBufferEndpoint::WriteRaw(const void* pBuf, std::streamsize nBytes)\n{\n  {\n    std::unique_lock<std::mutex> lock(m_dataMutex);\n    m_lastWriteSize = nBytes;\n    m_dataCV.wait(lock, [this] {\n      const auto read = readAvailable();\n      auto write = m_capacity - read;\n      if (m_lastReadSize > read && m_lastWriteSize > write) {\n        resizeUnsafe(std::max<size_t>(m_lastReadSize + m_lastWriteSize, m_capacity * 2));\n        write = m_capacity - m_writeIdx;\n      }\n      return write > m_lastWriteSize; \/\/ must be strictly greater to avoid ambiguous m_writeIdx == m_readIdx state\n    });\n\n    \/\/ the data fits in the buffer so we copy it\n    writeUnsafe(pBuf, nBytes);\n\n    m_lastWriteSize = 0;\n  }\n  m_dataCV.notify_one();\n\n  return true;\n}\n\nbool CircularBufferEndpoint::Abort(Reason reason) {\n  return true;\n}\n\nvoid CircularBufferEndpoint::clear()\n{\n  std::lock_guard<std::mutex> lock(m_dataMutex);\n  m_readIdx = 0;\n  m_writeIdx = 0;\n}\n\nsize_t CircularBufferEndpoint::readAvailable() {\n  if (m_writeIdx >= m_readIdx)\n    return m_writeIdx - m_readIdx;\n  else\n    return m_capacity - (m_readIdx - m_writeIdx);\n}\n\nvoid CircularBufferEndpoint::resizeUnsafe(size_t newCapacity)\n{\n  const size_t n = readAvailable();\n  std::unique_ptr<uint8_t[]> newbuf{new uint8_t[newCapacity]};\n\n  \/\/ copy to new buffer\n  readUnsafe(newbuf.get(), n);\n\n  m_data = std::move(newbuf);\n  m_readIdx = 0;\n  m_writeIdx = n;\n  m_capacity = newCapacity;\n}\n\nvoid CircularBufferEndpoint::readUnsafe(void* buffer, size_t size) {\n  const int wrap = static_cast<int>(m_readIdx + size) - static_cast<int>(m_capacity);\n  if (wrap > 0) {\n    memcpy(buffer, m_data.get() + m_readIdx, size - wrap);\n    memcpy(reinterpret_cast<char*>(buffer) + (size - wrap), m_data.get(), wrap);\n    m_readIdx = wrap;\n  }\n  else {\n    memcpy(buffer, m_data.get() + m_readIdx, size);\n    m_readIdx += size;\n  }\n}\n\nvoid CircularBufferEndpoint::writeUnsafe(const void* buffer, size_t size) {\n  const int wrap = static_cast<int>(m_writeIdx + size) - static_cast<int>(m_capacity);\n  if (wrap > 0) {\n    memcpy(m_data.get() + m_writeIdx, buffer, size - wrap);\n    memcpy(m_data.get(), reinterpret_cast<const char*>(buffer) + size - wrap, wrap);\n    m_writeIdx = wrap;\n  }\n  else {\n    memcpy(m_data.get() + m_writeIdx, buffer, size);\n    m_writeIdx += size;\n  }\n}\n<commit_msg>Fix occasional hang<commit_after>\/\/ Copyright (C) 2012-2017 Leap Motion, Inc. All rights reserved.\n#include \"stdafx.h\"\n#include \"CircularBufferEndpoint.h\"\n#include <system_error>\n\nusing namespace leap::ipc;\n\nCircularBufferEndpoint::CircularBufferEndpoint(size_t bufferSize) :\n  m_data{new uint8_t[bufferSize]},\n  m_capacity{bufferSize}\n{\n}\n\nstd::streamsize CircularBufferEndpoint::ReadRaw(void* buffer, std::streamsize size)\n{\n  {\n    std::unique_lock<std::mutex> lock(m_dataMutex);\n    m_lastReadSize = size;\n    m_dataCV.wait(lock, [this] {\n      auto read = readAvailable();\n      const auto write = m_capacity - read;\n      if (m_lastReadSize > read && m_lastWriteSize > write) {\n        resizeUnsafe(std::max<size_t>(m_lastReadSize + m_lastWriteSize, m_capacity * 2));\n        read = m_writeIdx;\n        m_dataCV.notify_one(); \/\/ Fix hang that was occurring when this path was triggered\n      }\n      return read >= m_lastReadSize;\n    });\n\n    \/\/ there are 'size' bytes available in the buffer\n    readUnsafe(buffer, size);\n\n    m_lastReadSize = 0;\n  }\n  m_dataCV.notify_one();\n\n  return size;\n}\n\nbool CircularBufferEndpoint::WriteRaw(const void* pBuf, std::streamsize nBytes)\n{\n  {\n    std::unique_lock<std::mutex> lock(m_dataMutex);\n    m_lastWriteSize = nBytes;\n    m_dataCV.wait(lock, [this] {\n      const auto read = readAvailable();\n      auto write = m_capacity - read;\n      if (m_lastReadSize > read && m_lastWriteSize > write) {\n        resizeUnsafe(std::max<size_t>(m_lastReadSize + m_lastWriteSize, m_capacity * 2));\n        write = m_capacity - m_writeIdx;\n      }\n      return write > m_lastWriteSize; \/\/ must be strictly greater to avoid ambiguous m_writeIdx == m_readIdx state\n    });\n\n    \/\/ the data fits in the buffer so we copy it\n    writeUnsafe(pBuf, nBytes);\n\n    m_lastWriteSize = 0;\n  }\n  m_dataCV.notify_one();\n\n  return true;\n}\n\nbool CircularBufferEndpoint::Abort(Reason reason) {\n  return true;\n}\n\nvoid CircularBufferEndpoint::clear()\n{\n  std::lock_guard<std::mutex> lock(m_dataMutex);\n  m_readIdx = 0;\n  m_writeIdx = 0;\n}\n\nsize_t CircularBufferEndpoint::readAvailable() {\n  if (m_writeIdx >= m_readIdx)\n    return m_writeIdx - m_readIdx;\n  else\n    return m_capacity - (m_readIdx - m_writeIdx);\n}\n\nvoid CircularBufferEndpoint::resizeUnsafe(size_t newCapacity)\n{\n  const size_t n = readAvailable();\n  std::unique_ptr<uint8_t[]> newbuf{new uint8_t[newCapacity]};\n\n  \/\/ copy to new buffer\n  readUnsafe(newbuf.get(), n);\n\n  m_data = std::move(newbuf);\n  m_readIdx = 0;\n  m_writeIdx = n;\n  m_capacity = newCapacity;\n}\n\nvoid CircularBufferEndpoint::readUnsafe(void* buffer, size_t size) {\n  const int wrap = static_cast<int>(m_readIdx + size) - static_cast<int>(m_capacity);\n  if (wrap > 0) {\n    memcpy(buffer, m_data.get() + m_readIdx, size - wrap);\n    memcpy(reinterpret_cast<char*>(buffer) + (size - wrap), m_data.get(), wrap);\n    m_readIdx = wrap;\n  }\n  else {\n    memcpy(buffer, m_data.get() + m_readIdx, size);\n    m_readIdx += size;\n  }\n}\n\nvoid CircularBufferEndpoint::writeUnsafe(const void* buffer, size_t size) {\n  const int wrap = static_cast<int>(m_writeIdx + size) - static_cast<int>(m_capacity);\n  if (wrap > 0) {\n    memcpy(m_data.get() + m_writeIdx, buffer, size - wrap);\n    memcpy(m_data.get(), reinterpret_cast<const char*>(buffer) + size - wrap, wrap);\n    m_writeIdx = wrap;\n  }\n  else {\n    memcpy(m_data.get() + m_writeIdx, buffer, size);\n    m_writeIdx += size;\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ This is an open source non-commercial project. Dear PVS-Studio, please check it.\n\/\/ PVS-Studio Static Code Analyzer for C, C++ and C#: http:\/\/www.viva64.com\n#include \"stdafx.h\"\n#include \"AnnSplashLevel.hpp\"\n#include \"AnnEngine.hpp\"\n#include \"AnnLogger.hpp\"\n#include \"AnnGetter.hpp\"\n#include \"AnnException.hpp\"\n\nusing namespace Annwvyn;\n\nAnnSplashLevel::AnnSplashLevel(Ogre::String resourceName, std::shared_ptr<AnnLevel> nextLevel, float timeoutTime) :\n constructLevel(),\n timeout(timeoutTime * 1000),\n currentTime(0),\n startTime(-1),\n next(nextLevel),\n CurvedPlane{ nullptr },\n Splash{ nullptr },\n splashImageName(resourceName),\n hasBGM(false) {}\n\nstd::vector<AnnVect3> AnnSplashLevel::createCurvedPlaneVertices(float curvature, float width, float height, float definition)\n{\n\t\/\/This will return a vertex list describing a vertical plane with a parabolic curve.\n\t\/\/The curvature of the plane follow the equation\n\t\/\/\n\t\/\/\t\tz = - (1 \/ curvature) * x^2\n\t\/\/\n\t\/\/Used as a vertex buffer, the pivot point of the object is in the center of the plane\n\t\/\/The definition parameter set the \"resolution\" of the curve. It's the number of points\n\t\/\/in the x axis used to define it.\n\n\t\/\/Compute some basic parameters\n\tconst auto resolution = width \/ definition;\n\tconst auto alpha\t  = 1 \/ curvature;\n\tconst auto xmax\t\t  = width \/ 2;\n\tconst auto xmin\t\t  = -xmax;\n\tconst auto ymax\t\t  = height \/ 2;\n\tconst auto ymin\t\t  = -ymax;\n\n\t\/\/how the z component is calculated\n\tauto depth = [=](float x) { return alpha * (x * x); };\n\n\t\/\/Where the data is stored. Take advantage of RVO\n\tstd::vector<AnnVect3> curve;\n\tcurve.reserve(size_t(definition));\n\n\tfor(float x = xmin; x < xmax; x += resolution)\n\t{\n\t\tcurve.emplace_back(x, ymax, depth(x));\n\t\tcurve.emplace_back(x, ymin, depth(x));\n\t}\n\n\treturn curve;\n}\n\nvoid AnnSplashLevel::createSplashCurvedPlane()\n{\n\t\/\/Create manual object\n\tAnnDebug() << \"Creating the display \\\"plane\\\" for the splash\";\n\tauto smgr(AnnGetEngine()->getSceneManager());\n\n\tCurvedPlane = smgr->createManualObject();\n\tCurvedPlane->begin(\"Splash\", Ogre::OT_TRIANGLE_STRIP);\n\n\tconst float curvature = 50;\n\tconst float width\t = 40;\n\tconst float height\t= 40;\n\tconst float definiton = 10;\n\n\tauto vertices = createCurvedPlaneVertices(curvature, width, height, definiton);\n\n\tOgre::uint32 index = 0;\n\tfor(const auto& pos : vertices)\n\t{\n\t\tCurvedPlane->position(pos);\n\t\tCurvedPlane->textureCoord((pos.x + width \/ 2.f) \/ width, 1.0f - ((pos.y + height \/ 2.f) \/ height));\n\t\tCurvedPlane->index(index++);\n\t}\n\n\tCurvedPlane->end();\n\n\tAnnDebug() << \"Add plane to scene\";\n\tSplash = smgr->getRootSceneNode()->createChildSceneNode();\n\tSplash->attachObject(CurvedPlane);\n}\n\nOgre::HlmsUnlitDatablock* AnnSplashLevel::createSplashDatablock(Ogre::HlmsUnlit* unlit)\n{\n\tauto macroblock\t\t\t\t   = Ogre::HlmsMacroblock();\n\tauto blendblock\t\t\t\t   = Ogre::HlmsBlendblock();\n\tmacroblock.mCullMode\t\t   = Ogre::CULL_NONE;\n\tmacroblock.mDepthCheck\t\t   = false;\n\tmacroblock.mDepthWrite\t\t   = false;\n\tmacroblock.mScissorTestEnabled = false;\n\treturn static_cast<Ogre::HlmsUnlitDatablock*>(unlit->createDatablock(\"Splash\", \"Splash\", macroblock, blendblock, Ogre::HlmsParamVec(), true, Ogre::BLANKSTRING, AnnGetResourceManager()->getDefaultResourceGroupName()));\n}\n\nvoid AnnSplashLevel::load()\n{\n\tAnnDebug() << \"Ignore physics\";\n\tAnnGetPlayer()->setPosition({ 0, 0, 10 });\n\tAnnGetPlayer()->resetPlayerPhysics();\n\tAnnGetPlayer()->setOrientation(Ogre::Euler(0, 0, 0));\n\tAnnGetPlayer()->ignorePhysics = false;\n\tAnnGetPhysicsEngine()->changeGravity(AnnVect3::ZERO);\n\n\tfloat ev = 1;\n\tAnnGetSceneryManager()->setExposure(ev, ev, ev);\n\tAnnGetSceneryManager()->setSkyColor(AnnColor(0, 0, 0), 0);\n\n\tauto sun = addLightObject();\n\tsun->setType(AnnLightObject::ANN_LIGHT_DIRECTIONAL);\n\tsun->setDirection({ 0, 1, 0.5f });\n\n\t\/\/Get splashscreen material\n\tauto unlit\t\t\t = static_cast<Ogre::HlmsUnlit*>(AnnGetVRRenderer()->getRoot()->getHlmsManager()->getHlms(Ogre::HLMS_UNLIT));\n\tauto splashDatablock = static_cast<Ogre::HlmsUnlitDatablock*>(unlit->getDatablock(\"Splash\"));\n\tif(!splashDatablock) splashDatablock = createSplashDatablock(unlit);\n\n\t\/\/Get splashscreen texture\n\tauto textureManager = Ogre::TextureManager::getSingletonPtr();\n\tauto texture\t\t= textureManager->getByName(splashImageName);\n\tif(!texture) texture = textureManager->load(splashImageName, AnnGetResourceManager()->getDefaultResourceGroupName(), Ogre::TEX_TYPE_2D, 0, 1, false, Ogre::PF_UNKNOWN, true);\n\tif(!texture) throw AnnInitializationError(ANN_ERR_NOTINIT, \"Texture not found for splash \" + splashImageName);\n\n\t\/\/Set datablock parameters\n\tsplashDatablock->setColour(Ogre::ColourValue::White * 97);\n\tsplashDatablock->setTexture(Ogre::HlmsTextureManager::TEXTURE_TYPE_DIFFUSE, 0, texture);\n\n\tcreateSplashCurvedPlane();\n}\n\nvoid AnnSplashLevel::setBGM(std::string soundfileName, bool preload)\n{\n\tif(preload) AnnGetAudioEngine()->preLoadBuffer(soundfileName);\n\tbgmName = soundfileName;\n\thasBGM  = true;\n}\n\nvoid AnnSplashLevel::runLogic()\n{\n\tSplash->setPosition(AnnGetPlayer()->getPosition() + AnnVect3{ 0, 0, -10 });\n\n\t\/\/If start time not set yet\n\tif(startTime == -1)\n\t{\n\t\t\/\/The app is \"not visible\" before the Health and Safety warning is displayed, or when you're inside the Oculus Home menu\n\t\tif(AnnGetEngine()->appVisibleInHMD())\n\t\t{\n\t\t\tAnnDebug() << \"visible\";\n\t\t\t\/\/This set the \"startTime\" variable, preventing this piece of code to be ran twice\n\t\t\tAnnDebug() << \"Starting time at : \" << AnnGetEngine()->getTimeFromStartUp();\n\t\t\tstartTime = float(AnnGetEngine()->getTimeFromStartUp());\n\t\t\t\/\/If you put some background music or sound for the splash-screen, we start it\n\t\t\tif(hasBGM)\n\t\t\t\tAnnGetAudioEngine()->playBGM(bgmName);\n\t\t}\n\t\telse\n\t\t\treturn;\n\t}\n\n\t\/\/Run the following only if you set a \"next\" level to jump to\n\tauto nextLevel = next.lock();\n\tif(nextLevel && AnnGetEngine()->getTimeFromStartUp() - startTime > timeout)\n\t{\n\t\tstartTime = -1;\n\t\tAnnGetEngine()->getLevelManager()->jump(nextLevel);\n\t}\n}\n\nvoid AnnSplashLevel::unload()\n{\n\t\/\/Normal level unload\n\tAnnLevel::unload();\n\n\tAnnDebug() << \"Removing object from scene\";\n\tauto smgr(AnnGetEngine()->getSceneManager());\n\tsmgr->destroySceneNode(Splash);\n\tOgre::MaterialManager::getSingleton().remove(\"Splash\");\n\n\tAnnDebug() << \"Restore Player's normal state : \";\n\tAnnGetPlayer()->ignorePhysics = false;\n\tAnnGetPlayer()->setPosition(AnnVect3(0, 0, 10));\n\tAnnGetPlayer()->resetPlayerPhysics();\n}\n\nvoid AnnSplashLevel::setNextLevel(std::shared_ptr<AnnLevel> level)\n{\n\tnext = level;\n}\n\nvoid AnnSplashLevel::setTimeout(float time)\n{\n\tif(time > 0)\n\t\ttimeout = 1000 * time;\n}\n\nvoid AnnSplashLevel::setTimeoutMillisec(unsigned time)\n{\n\ttimeout = float(time);\n}\n<commit_msg>Fix ogre assert : datablock wasn't using color, but color was set<commit_after>\/\/ This is an open source non-commercial project. Dear PVS-Studio, please check it.\n\/\/ PVS-Studio Static Code Analyzer for C, C++ and C#: http:\/\/www.viva64.com\n#include \"stdafx.h\"\n#include \"AnnSplashLevel.hpp\"\n#include \"AnnEngine.hpp\"\n#include \"AnnLogger.hpp\"\n#include \"AnnGetter.hpp\"\n#include \"AnnException.hpp\"\n\nusing namespace Annwvyn;\n\nAnnSplashLevel::AnnSplashLevel(Ogre::String resourceName, std::shared_ptr<AnnLevel> nextLevel, float timeoutTime) :\n constructLevel(),\n timeout(timeoutTime * 1000),\n currentTime(0),\n startTime(-1),\n next(nextLevel),\n CurvedPlane{ nullptr },\n Splash{ nullptr },\n splashImageName(resourceName),\n hasBGM(false) {}\n\nstd::vector<AnnVect3> AnnSplashLevel::createCurvedPlaneVertices(float curvature, float width, float height, float definition)\n{\n\t\/\/This will return a vertex list describing a vertical plane with a parabolic curve.\n\t\/\/The curvature of the plane follow the equation\n\t\/\/\n\t\/\/\t\tz = - (1 \/ curvature) * x^2\n\t\/\/\n\t\/\/Used as a vertex buffer, the pivot point of the object is in the center of the plane\n\t\/\/The definition parameter set the \"resolution\" of the curve. It's the number of points\n\t\/\/in the x axis used to define it.\n\n\t\/\/Compute some basic parameters\n\tconst auto resolution = width \/ definition;\n\tconst auto alpha\t  = 1 \/ curvature;\n\tconst auto xmax\t\t  = width \/ 2;\n\tconst auto xmin\t\t  = -xmax;\n\tconst auto ymax\t\t  = height \/ 2;\n\tconst auto ymin\t\t  = -ymax;\n\n\t\/\/how the z component is calculated\n\tauto depth = [=](float x) { return alpha * (x * x); };\n\n\t\/\/Where the data is stored. Take advantage of RVO\n\tstd::vector<AnnVect3> curve;\n\tcurve.reserve(size_t(definition));\n\n\tfor(float x = xmin; x < xmax; x += resolution)\n\t{\n\t\tcurve.emplace_back(x, ymax, depth(x));\n\t\tcurve.emplace_back(x, ymin, depth(x));\n\t}\n\n\treturn curve;\n}\n\nvoid AnnSplashLevel::createSplashCurvedPlane()\n{\n\t\/\/Create manual object\n\tAnnDebug() << \"Creating the display \\\"plane\\\" for the splash\";\n\tauto smgr(AnnGetEngine()->getSceneManager());\n\n\tCurvedPlane = smgr->createManualObject();\n\tCurvedPlane->begin(\"Splash\", Ogre::OT_TRIANGLE_STRIP);\n\n\tconst float curvature = 50;\n\tconst float width\t = 40;\n\tconst float height\t= 40;\n\tconst float definiton = 10;\n\n\tauto vertices = createCurvedPlaneVertices(curvature, width, height, definiton);\n\n\tOgre::uint32 index = 0;\n\tfor(const auto& pos : vertices)\n\t{\n\t\tCurvedPlane->position(pos);\n\t\tCurvedPlane->textureCoord((pos.x + width \/ 2.f) \/ width, 1.0f - ((pos.y + height \/ 2.f) \/ height));\n\t\tCurvedPlane->index(index++);\n\t}\n\n\tCurvedPlane->end();\n\n\tAnnDebug() << \"Add plane to scene\";\n\tSplash = smgr->getRootSceneNode()->createChildSceneNode();\n\tSplash->attachObject(CurvedPlane);\n}\n\nOgre::HlmsUnlitDatablock* AnnSplashLevel::createSplashDatablock(Ogre::HlmsUnlit* unlit)\n{\n\tauto macroblock\t\t\t\t   = Ogre::HlmsMacroblock();\n\tauto blendblock\t\t\t\t   = Ogre::HlmsBlendblock();\n\tmacroblock.mCullMode\t\t   = Ogre::CULL_NONE;\n\tmacroblock.mDepthCheck\t\t   = false;\n\tmacroblock.mDepthWrite\t\t   = false;\n\tmacroblock.mScissorTestEnabled = false;\n\n\tauto block = static_cast<Ogre::HlmsUnlitDatablock*>(unlit->createDatablock(\"Splash\", \"Splash\", macroblock, blendblock, Ogre::HlmsParamVec(), true, Ogre::BLANKSTRING, AnnGetResourceManager()->getDefaultResourceGroupName()));\n\tblock->setUseColour(true);\n\n\treturn block;\n}\n\nvoid AnnSplashLevel::load()\n{\n\tAnnDebug() << \"Ignore physics\";\n\tAnnGetPlayer()->setPosition({ 0, 0, 10 });\n\tAnnGetPlayer()->resetPlayerPhysics();\n\tAnnGetPlayer()->setOrientation(Ogre::Euler(0, 0, 0));\n\tAnnGetPlayer()->ignorePhysics = false;\n\tAnnGetPhysicsEngine()->changeGravity(AnnVect3::ZERO);\n\n\tfloat ev = 1;\n\tAnnGetSceneryManager()->setExposure(ev, ev, ev);\n\tAnnGetSceneryManager()->setSkyColor(AnnColor(0, 0, 0), 0);\n\n\tauto sun = addLightObject();\n\tsun->setType(AnnLightObject::ANN_LIGHT_DIRECTIONAL);\n\tsun->setDirection({ 0, 1, 0.5f });\n\n\t\/\/Get splashscreen material\n\tauto unlit\t\t\t = static_cast<Ogre::HlmsUnlit*>(AnnGetVRRenderer()->getRoot()->getHlmsManager()->getHlms(Ogre::HLMS_UNLIT));\n\tauto splashDatablock = static_cast<Ogre::HlmsUnlitDatablock*>(unlit->getDatablock(\"Splash\"));\n\tif(!splashDatablock) splashDatablock = createSplashDatablock(unlit);\n\n\t\/\/Get splashscreen texture\n\tauto textureManager = Ogre::TextureManager::getSingletonPtr();\n\tauto texture\t\t= textureManager->getByName(splashImageName);\n\tif(!texture) texture = textureManager->load(splashImageName, AnnGetResourceManager()->getDefaultResourceGroupName(), Ogre::TEX_TYPE_2D, 0, 1, false, Ogre::PF_UNKNOWN, true);\n\tif(!texture) throw AnnInitializationError(ANN_ERR_NOTINIT, \"Texture not found for splash \" + splashImageName);\n\n\t\/\/Set datablock parameters\n\tsplashDatablock->setColour(Ogre::ColourValue::White * 1);\n\tsplashDatablock->setTexture(Ogre::HlmsTextureManager::TEXTURE_TYPE_DIFFUSE, 0, texture);\n\n\tcreateSplashCurvedPlane();\n}\n\nvoid AnnSplashLevel::setBGM(std::string soundfileName, bool preload)\n{\n\tif(preload) AnnGetAudioEngine()->preLoadBuffer(soundfileName);\n\tbgmName = soundfileName;\n\thasBGM  = true;\n}\n\nvoid AnnSplashLevel::runLogic()\n{\n\tSplash->setPosition(AnnGetPlayer()->getPosition() + AnnVect3{ 0, 0, -10 });\n\n\t\/\/If start time not set yet\n\tif(startTime == -1)\n\t{\n\t\t\/\/The app is \"not visible\" before the Health and Safety warning is displayed, or when you're inside the Oculus Home menu\n\t\tif(AnnGetEngine()->appVisibleInHMD())\n\t\t{\n\t\t\tAnnDebug() << \"visible\";\n\t\t\t\/\/This set the \"startTime\" variable, preventing this piece of code to be ran twice\n\t\t\tAnnDebug() << \"Starting time at : \" << AnnGetEngine()->getTimeFromStartUp();\n\t\t\tstartTime = float(AnnGetEngine()->getTimeFromStartUp());\n\t\t\t\/\/If you put some background music or sound for the splash-screen, we start it\n\t\t\tif(hasBGM)\n\t\t\t\tAnnGetAudioEngine()->playBGM(bgmName);\n\t\t}\n\t\telse\n\t\t\treturn;\n\t}\n\n\t\/\/Run the following only if you set a \"next\" level to jump to\n\tauto nextLevel = next.lock();\n\tif(nextLevel && AnnGetEngine()->getTimeFromStartUp() - startTime > timeout)\n\t{\n\t\tstartTime = -1;\n\t\tAnnGetEngine()->getLevelManager()->jump(nextLevel);\n\t}\n}\n\nvoid AnnSplashLevel::unload()\n{\n\t\/\/Normal level unload\n\tAnnLevel::unload();\n\n\tAnnDebug() << \"Removing object from scene\";\n\tauto smgr(AnnGetEngine()->getSceneManager());\n\tsmgr->destroySceneNode(Splash);\n\tOgre::MaterialManager::getSingleton().remove(\"Splash\");\n\n\tAnnDebug() << \"Restore Player's normal state : \";\n\tAnnGetPlayer()->ignorePhysics = false;\n\tAnnGetPlayer()->setPosition(AnnVect3(0, 0, 10));\n\tAnnGetPlayer()->resetPlayerPhysics();\n}\n\nvoid AnnSplashLevel::setNextLevel(std::shared_ptr<AnnLevel> level)\n{\n\tnext = level;\n}\n\nvoid AnnSplashLevel::setTimeout(float time)\n{\n\tif(time > 0)\n\t\ttimeout = 1000 * time;\n}\n\nvoid AnnSplashLevel::setTimeoutMillisec(unsigned time)\n{\n\ttimeout = float(time);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright (c) 2014 UCR-UAS\n * You should have recieved a copy of the MIT licence with this file.\n * Engineer: Brandon Lu\n * Description: This is the BISON-Transfer client version 1.\n * This is not a multi-threaded client.\n *\/\n\n\/* ================ Notices ===============\n * You should probably read the server code comments for the most updated\n * information.  The server kind of came first.\n *\/\n\n\/\/ =============== Includes ===============\n#include <arpa\/inet.h>\n#include \"BISON-Defaults.h\"\n#include <boost\/filesystem.hpp>\n#include \"config-check.h\"\n#include <dirent.h>\n#include <errno.h>\n#include <exception>\n#include <fstream>\n#include <map>\n#include <netinet\/in.h>\n#include <openssl\/md5.h>\n#include \"filetable.h\"\n#include <queue>\n#include <signal.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <string>\n#include <string.h>\n#include <sys\/socket.h>\n#include <sys\/types.h>\n#include <unistd.h>\n#include \"filetable.h\"\n#include <vector>\n#include <yaml-cpp\/yaml.h>\n\ntypedef enum {FILETABLE, TRANSFER, REALTIME, RECALCULATE_MD5} action_t;\n\n\/\/ =========== Global Variables ===========\nint sfd;\nstd::string BISON_TRANSFER_SERVER;\nint BISON_TRANSFER_PORT;\nstd::string BISON_RECIEVE_DIR;\nint ERROR_WAIT;\nstd::queue<std::string> filequeue;\nstd::queue<std::string> recalc_queue;\nstd::map<std::string, std::vector<unsigned char>> filetable;\nYAML::Node config;\n\n\/\/ ============ Configuration ==============\n\/*\n * The configuration functions for the server and client get very repetetive.\n * But they're darn easy to program in!!! -- Brandon\n *\n *\/\nvoid configure_client(YAML::Node &config)\n{\n\ttry {\n\t\tconfig = YAML::LoadFile(__DEF_CLIENT_CONFIG_PATH__ \n\t\t\t+ std::string(__DEF_CLIENT_CONFIG_FILE__));\n#if DEBUG\n\t\tstd::cout << \"Successfully opened configuration file.\" << std::endl;\n#endif \/\/ DEBUG\n\t} catch (std::exception& e) {\n\t\tstd::cerr << e.what() << std::endl;\n\t\tstd::cerr << \"Attempting to configure automatically.\" << std::endl;\n\t}\n\n\tif (!config[\"BISON-Transfer\"][\"Client\"][\"Server-address\"])\n\t\tconfig[\"BISON-Transfer\"][\"Client\"][\"Server-address\"] \n\t\t\t= DEF_BISON_TRANSFER_SERVER;\n\tif (!config[\"BISON-Transfer\"][\"Client\"][\"Port\"])\n\t\tconfig[\"BISON-Transfer\"][\"Client\"][\"Port\"] = DEF_BISON_TRANSFER_PORT;\n\tif (!config[\"BISON-Transfer\"][\"Client\"][\"Recieve-Dir\"])\n\t\tconfig[\"BISON-Transfer\"][\"Client\"][\"Recieve-Dir\"] = DEF_RECIEVE_DIR;\n\tif (!config[\"BISON-Transfer\"][\"Client\"][\"Error-Wait\"])\n\t\tconfig[\"BISON-Transfer\"][\"Client\"][\"Error-Wait\"] = DEF_ERROR_WAIT;\n\n\tBISON_TRANSFER_SERVER\n\t\t= config[\"BISON-Transfer\"][\"Client\"][\"Server-address\"]\n\t\t.as<std::string>();\n\tBISON_TRANSFER_PORT = config[\"BISON-Transfer\"][\"Client\"][\"Port\"].as<int>();\n\tBISON_RECIEVE_DIR = config[\"BISON-Transfer\"][\"Client\"][\"Recieve-Dir\"]\n\t\t.as<std::string>();\n\tERROR_WAIT = config[\"BISON-Transfer\"][\"Client\"][\"Error-Wait\"].as<int>();\n\n\tif (DEBUG) {\n\t\tstd::cout << \"Transfer Address (for binding): \"\n\t\t\t<< BISON_TRANSFER_SERVER << std::endl;\n\t\tstd::cout << \"Transfer port: \" << BISON_TRANSFER_PORT << std::endl;\n\t}\n\n#if DEBUG\n\tstd::cout << \"Writing config file\" << std::endl;\n#endif \/\/ if DEBUG\n\n\t\/\/ Write out the configuration before starting \n\tdirChkCreate(__DEF_CLIENT_CONFIG_PATH__, \"configuration\");\n\n\twriteOutYaml(config, __DEF_CLIENT_CONFIG_PATH__ \n\t\t\t+ std::string(__DEF_CLIENT_CONFIG_FILE__));\n}\n\n\/\/ ======= Nice Termination handler =======\n\/\/ terminate nicely!\nvoid terminate_nicely(int sig)\n{\n\tclose(sfd);\n\texit(0);\n}\n\n\/\/ ===== Not Nice Termination handler =====\nvoid error_terminate(const int status) {\n\tclose(sfd);\n\texit(status);\n}\n\n\/\/ =========== Handle Connection ===========\nvoid handle_connection(action_t &action)\n{\n#if DEBUG\n\t\/\/ printf(\"Socketing... \\n\");\n#endif \/\/ if DEBUG\n\tsfd = socket(PF_INET, SOCK_STREAM, 0);\n\tif (sfd == -1) {\n\t\tclose(sfd);\n\t}\n\n\t\/\/ set things for sockaddr_in before connection\n\tstruct sockaddr_in srv_addr;\n\tmemset(&srv_addr, 0, sizeof(struct sockaddr_in));\n\tsrv_addr.sin_family = AF_INET;\n\tsrv_addr.sin_port = htons(BISON_TRANSFER_PORT);\n\tif (!inet_aton(BISON_TRANSFER_SERVER.c_str(),\n\t\t(struct in_addr*) &srv_addr.sin_addr.s_addr)) {\n\t\tstd::cerr << \"Server Address Invalid\" << std::endl;\n\t\tclose(sfd);\n\t\treturn;\n\t}\n\n#if DEBUG\n\t\/\/ printf(\"Connecting... \\n\");\n#endif \/\/ if DEBUG\n\tif (connect(sfd, (struct sockaddr*) &srv_addr,\n\t\tsizeof(struct sockaddr_in)) == -1) {\n\t\terrno = 0;\n\t\tclose(sfd);\n\t\treturn;\n\t}\n\n\tif (filequeue.empty()) {\n\t\tstd::cout << \"Filequeue is empty.  Checking for new files.\"\n\t\t\t<< std::endl;\n\t\taction = FILETABLE;\n\t}\n\n\tif (!recalc_queue.empty()) {\n\t\tstd::cout << \"Recalculation queue is not empty. Relaying filenames.\"\n\t\t\t<< std::endl;\n\t\taction = RECALCULATE_MD5;\n\t}\n\n\tswitch (action) {\n\t\tcase TRANSFER:\n\t\t{\n\t\t\t\/\/ In this case, we transfer over the file that is on top of the--\n\t\t\t\/\/ file queue.\n\n\t\t\t\/\/ Man, I really need to implement loglevels -- Brandon\n\t\t\tstd::cout << \"Front is: \" << filequeue.front() << std::endl;\n\n\t\t\t\/\/ Get the filename\n\t\t\tstd::string filename(filequeue.front());\n\t\t\t\/\/ Remove the very top file\n\t\t\tfilequeue.pop();\t\t\t\t\/\/ remove front member\n\t\t\t\/\/ Tell the server exactly what we want.\n\t\t\tdprintf(sfd, \"REQ: %s\\n\\n\", filename.c_str());\n\t\t\t\/\/ Open the file that we want to put it in.\n\t\t\tFILE *output_file = fopen((BISON_RECIEVE_DIR + filename).c_str(),\n\t\t\t\t\"w\");\n\t\t\t\/\/ If we couldn't open it for some reason, let the server continue\n\t\t\tif (output_file == 0) {\n\t\t\t\tstd::cerr << \"Could not open new file for writing.\"\n\t\t\t\t\t<< std::endl;\n\t\t\t\tclose(sfd);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t\/\/ Write the data into the output file which was opened earlier.\n\t\t\tbool delete_flag = false;\n\t\t\tchar buf[MAXBUFLEN + 1];\n\t\t\tint len = 0;\n            \/\/ file descriptor set for writing to file\n            fd_set set;\n            FD_SET(sfd, &set);\n            struct timeval timeout;\n            timeout.tv_sec = 30;\n            timeout.tv_usec = 0;\n\t\t\twhile(select(sfd+1, &set, NULL, NULL, &timeout) != 0) {\n                len = read(sfd, buf, MAXBUFLEN);\n                if (len == 0)\t\t\t\t\t\/\/ reached end of file\n                    break;\n\t\t\t\tif (len == -1) {\t\t\t\t\/\/ error condition\n\t\t\t\t\tstd::cerr << \"Error on socket read from client.\"\n\t\t\t\t\t\t<< strerror(errno) << std::endl;\n\t\t\t\t\terrno = 0;\n\t\t\t\t\tdelete_flag = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tfwrite(buf, sizeof(char), len, output_file);\n                timeout.tv_sec = 30;\n                timeout.tv_usec = 0;\n\t\t\t}\n\n\t\t\t\/\/ Close the file, of course.\n\t\t\tfclose(output_file);\n\n\t\t\t\/\/ Delete the file if necessary\n\t\t\tif (delete_flag == true) {\n\t\t\t\tstd::cerr << \"Deleting error'd file.\" << std::endl;\n\t\t\t}\n\t\t}\tbreak;\n\n\t\tcase FILETABLE:\n\t\t{\n\t\t\t\/\/ Have the server send over a fresh copy of its file queue so --\n\t\t\t\/\/ that we know what's going on.\n\n\t\t\t\/\/ Start off by asking ourselves what we have.\n            const char *ret;\n\t\t\tret = update_filetable(BISON_RECIEVE_DIR, filetable);\n\t\t\t\/\/ Oh yeah, and if we failed at that... try again.\n\t\t\tif (ret) {\n\t\t\t\tstd::cerr << \"Filetable did not update:\" << ret << std::endl;\n\t\t\t\tstd::cerr << \"Well, the file recieve directory is being made.\"\n\t\t\t\t\t<< std::endl;\n\t\t\t\tdirChkCreate(BISON_RECIEVE_DIR.c_str(), \"recieve\");\n\t\t\t\tclose(sfd);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t\/\/ Ask the server for its file table.\n\t\t\t\/\/ (What is this?  A date? -- Brandon)\n\t\t\tdprintf(sfd, \"FTREQ\\n\\n\");\n\t\t\tstd::map<std::string, std::vector<unsigned char>> tmp_filetable;\n\n\t\t\t\/\/ Parse the filetable information.\n\t\t\t\/\/ (Hang in there buddy, it's going to take a little work to --\n\t\t\t\/\/ make it all work out. -- Brandon)\n\t\t\tmd5_parse(sfd, tmp_filetable);\n\n\t\t\t\/\/ If our current filetable is empty, dump it.\n\t\t\tif (!filequeue.empty())\n\t\t\t\tstd::cerr << \"Filetable is not empty. Emptying.\" << std::endl;\n\t\t\twhile(!filequeue.empty())\n\t\t\t\tfilequeue.pop();\n\n\t\t\t\/\/ Check for files here that do not exist on our end.\n\t\t\tfor (std::map<std::string, std::vector<unsigned char>>::iterator\n\t\t\t\tit = tmp_filetable.begin(); it != tmp_filetable.end(); it++) {\n\t\t\t\tstd::map<std::string, std::vector<unsigned char>>::iterator\n\t\t\t\t\tit2 = filetable.find(it->first);\n\n\t\t\t\t\/\/ nonexistent file\n\t\t\t\tif (it2 == filetable.end()) {\n\t\t\t\t\tstd::cout << \"Missing: \" << it->first << std::endl;\n\t\t\t\t\tfilequeue.push(it->first);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\t\/\/ handle incorrect \/ incomplete files\n\t\t\t\tif (it2->second != it->second) {\n\t\t\t\t\tstd::cout << \"Corrupt file: \" << it->first << std::endl;\n\t\t\t\t\trecalc_queue.push(it->first);\n\t\t\t\t\tfilequeue.push(it->first);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\taction = TRANSFER;\n\t\t}\tbreak;\n\t\tcase REALTIME:\n\t\t\t\/\/ Not implemented yet, I blame the rest of the requirements.\n\t\t\tbreak;\n\t\tcase RECALCULATE_MD5:\n\t\t{\n\t\t\t\/\/ Oh, we're in trouble.  We need to recalculate a faulty MD5 sum.\n\t\t\tstd::cout << \"Recalculating for\"\n\t\t\t\t<< recalc_queue.front() << std::endl;\n\t\t\t\/\/ Get the file that we need to recalculate\n\t\t\tstd::string filename = recalc_queue.front();\n\t\t\trecalc_queue.pop();\n\n\t\t\t\/\/ Tell the server to recalculate it.\n\t\t\tdprintf(sfd, \"RECALC: %s\\n\\n\", filename.c_str());\n\n\t\t\t\/\/ And recalculate it ourselves.\n\t\t\trecalculate_MD5(BISON_RECIEVE_DIR, filename, filetable);\n\t\t}\tbreak;\n\t}\n\tclose(sfd);\n}\n\n\/\/ ======= Configuration Reloading ========\nvoid configuration_reload(int sig)\n{\n\tconfigure_client(config);\n}\n\n\/\/ =========== Signal Handling =============\nvoid signalHandling()\n{\n\tsignal (SIGHUP, configuration_reload);\n\tsignal(SIGCHLD, SIG_IGN);\t\t\t\t\/\/ ignore children for now\n\t\/\/ Handle different ways of program termination\n\tsignal(SIGTERM, terminate_nicely);\n\tsignal(SIGINT, terminate_nicely);\n\n}\n\n\/\/ ========== The Main Function ============\nint main (int argc, char *argv[])\n{\n\tconfigure_client(config);\n\n\t\/\/ PID management is offloaded to initialization daemon\n\n\tsignalHandling();\n\n\tdirChkCreate(BISON_RECIEVE_DIR.c_str(), \"recieve\");\n\n\tprintf(\"Client Starting Up...\\n\");\n\taction_t action = FILETABLE;\n\n\twhile(1) {\n\t\thandle_connection(action);\n\t\t\/\/ Actually time things out after return\n\t\t\/\/ this runs for one second.\n\t\tfor (int i = 0; i < ERROR_WAIT; i++)\n\t\t\tusleep(1000);\n\t}\n\treturn 0;\n}\n<commit_msg>Changed filequeue front because of segmentation faults.<commit_after>\/* Copyright (c) 2014 UCR-UAS\n * You should have recieved a copy of the MIT licence with this file.\n * Engineer: Brandon Lu\n * Description: This is the BISON-Transfer client version 1.\n * This is not a multi-threaded client.\n *\/\n\n\/* ================ Notices ===============\n * You should probably read the server code comments for the most updated\n * information.  The server kind of came first.\n *\/\n\n\/\/ =============== Includes ===============\n#include <arpa\/inet.h>\n#include \"BISON-Defaults.h\"\n#include <boost\/filesystem.hpp>\n#include \"config-check.h\"\n#include <dirent.h>\n#include <errno.h>\n#include <exception>\n#include <fstream>\n#include <map>\n#include <netinet\/in.h>\n#include <openssl\/md5.h>\n#include \"filetable.h\"\n#include <queue>\n#include <signal.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <string>\n#include <string.h>\n#include <sys\/socket.h>\n#include <sys\/types.h>\n#include <unistd.h>\n#include \"filetable.h\"\n#include <vector>\n#include <yaml-cpp\/yaml.h>\n\ntypedef enum {FILETABLE, TRANSFER, REALTIME, RECALCULATE_MD5} action_t;\n\n\/\/ =========== Global Variables ===========\nint sfd;\nstd::string BISON_TRANSFER_SERVER;\nint BISON_TRANSFER_PORT;\nstd::string BISON_RECIEVE_DIR;\nint ERROR_WAIT;\nstd::queue<std::string> filequeue;\nstd::queue<std::string> recalc_queue;\nstd::map<std::string, std::vector<unsigned char>> filetable;\nYAML::Node config;\n\n\/\/ ============ Configuration ==============\n\/*\n * The configuration functions for the server and client get very repetetive.\n * But they're darn easy to program in!!! -- Brandon\n *\n *\/\nvoid configure_client(YAML::Node &config)\n{\n\ttry {\n\t\tconfig = YAML::LoadFile(__DEF_CLIENT_CONFIG_PATH__ \n\t\t\t+ std::string(__DEF_CLIENT_CONFIG_FILE__));\n#if DEBUG\n\t\tstd::cout << \"Successfully opened configuration file.\" << std::endl;\n#endif \/\/ DEBUG\n\t} catch (std::exception& e) {\n\t\tstd::cerr << e.what() << std::endl;\n\t\tstd::cerr << \"Attempting to configure automatically.\" << std::endl;\n\t}\n\n\tif (!config[\"BISON-Transfer\"][\"Client\"][\"Server-address\"])\n\t\tconfig[\"BISON-Transfer\"][\"Client\"][\"Server-address\"] \n\t\t\t= DEF_BISON_TRANSFER_SERVER;\n\tif (!config[\"BISON-Transfer\"][\"Client\"][\"Port\"])\n\t\tconfig[\"BISON-Transfer\"][\"Client\"][\"Port\"] = DEF_BISON_TRANSFER_PORT;\n\tif (!config[\"BISON-Transfer\"][\"Client\"][\"Recieve-Dir\"])\n\t\tconfig[\"BISON-Transfer\"][\"Client\"][\"Recieve-Dir\"] = DEF_RECIEVE_DIR;\n\tif (!config[\"BISON-Transfer\"][\"Client\"][\"Error-Wait\"])\n\t\tconfig[\"BISON-Transfer\"][\"Client\"][\"Error-Wait\"] = DEF_ERROR_WAIT;\n\n\tBISON_TRANSFER_SERVER\n\t\t= config[\"BISON-Transfer\"][\"Client\"][\"Server-address\"]\n\t\t.as<std::string>();\n\tBISON_TRANSFER_PORT = config[\"BISON-Transfer\"][\"Client\"][\"Port\"].as<int>();\n\tBISON_RECIEVE_DIR = config[\"BISON-Transfer\"][\"Client\"][\"Recieve-Dir\"]\n\t\t.as<std::string>();\n\tERROR_WAIT = config[\"BISON-Transfer\"][\"Client\"][\"Error-Wait\"].as<int>();\n\n\tif (DEBUG) {\n\t\tstd::cout << \"Transfer Address (for binding): \"\n\t\t\t<< BISON_TRANSFER_SERVER << std::endl;\n\t\tstd::cout << \"Transfer port: \" << BISON_TRANSFER_PORT << std::endl;\n\t}\n\n#if DEBUG\n\tstd::cout << \"Writing config file\" << std::endl;\n#endif \/\/ if DEBUG\n\n\t\/\/ Write out the configuration before starting \n\tdirChkCreate(__DEF_CLIENT_CONFIG_PATH__, \"configuration\");\n\n\twriteOutYaml(config, __DEF_CLIENT_CONFIG_PATH__ \n\t\t\t+ std::string(__DEF_CLIENT_CONFIG_FILE__));\n}\n\n\/\/ ======= Nice Termination handler =======\n\/\/ terminate nicely!\nvoid terminate_nicely(int sig)\n{\n\tclose(sfd);\n\texit(0);\n}\n\n\/\/ ===== Not Nice Termination handler =====\nvoid error_terminate(const int status) {\n\tclose(sfd);\n\texit(status);\n}\n\n\/\/ =========== Handle Connection ===========\nvoid handle_connection(action_t &action)\n{\n#if DEBUG\n\t\/\/ printf(\"Socketing... \\n\");\n#endif \/\/ if DEBUG\n\tsfd = socket(PF_INET, SOCK_STREAM, 0);\n\tif (sfd == -1) {\n\t\tclose(sfd);\n\t}\n\n\t\/\/ set things for sockaddr_in before connection\n\tstruct sockaddr_in srv_addr;\n\tmemset(&srv_addr, 0, sizeof(struct sockaddr_in));\n\tsrv_addr.sin_family = AF_INET;\n\tsrv_addr.sin_port = htons(BISON_TRANSFER_PORT);\n\tif (!inet_aton(BISON_TRANSFER_SERVER.c_str(),\n\t\t(struct in_addr*) &srv_addr.sin_addr.s_addr)) {\n\t\tstd::cerr << \"Server Address Invalid\" << std::endl;\n\t\tclose(sfd);\n\t\treturn;\n\t}\n\n#if DEBUG\n\t\/\/ printf(\"Connecting... \\n\");\n#endif \/\/ if DEBUG\n\tif (connect(sfd, (struct sockaddr*) &srv_addr,\n\t\tsizeof(struct sockaddr_in)) == -1) {\n\t\terrno = 0;\n\t\tclose(sfd);\n\t\treturn;\n\t}\n\n\tif (filequeue.empty()) {\n\t\tstd::cout << \"Filequeue is empty.  Checking for new files.\"\n\t\t\t<< std::endl;\n\t\taction = FILETABLE;\n\t}\n\n\tif (!recalc_queue.empty()) {\n\t\tstd::cout << \"Recalculation queue is not empty. Relaying filenames.\"\n\t\t\t<< std::endl;\n\t\taction = RECALCULATE_MD5;\n\t}\n\n\tswitch (action) {\n\t\tcase TRANSFER:\n\t\t{\n\t\t\t\/\/ In this case, we transfer over the file that is on top of the--\n\t\t\t\/\/ file queue.\n\n\t\t\t\/\/ Man, I really need to implement loglevels -- Brandon\n\t\t\tstd::cout << \"Front is: \" << filequeue.front() << std::endl;\n\n\t\t\t\/\/ Get the filename\n\t\t\tstd::string filename(filequeue.front());\n\t\t\t\/\/ Remove the very top file\n\t\t\tfilequeue.pop();\t\t\t\t\/\/ remove front member\n\t\t\t\/\/ Tell the server exactly what we want.\n\t\t\tdprintf(sfd, \"REQ: %s\\n\\n\", filename.c_str());\n\t\t\t\/\/ Open the file that we want to put it in.\n\t\t\tFILE *output_file = fopen((BISON_RECIEVE_DIR + filename).c_str(),\n\t\t\t\t\"w\");\n\t\t\t\/\/ If we couldn't open it for some reason, let the server continue\n\t\t\tif (output_file == 0) {\n\t\t\t\tstd::cerr << \"Could not open new file for writing.\"\n\t\t\t\t\t<< std::endl;\n\t\t\t\tclose(sfd);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t\/\/ Write the data into the output file which was opened earlier.\n\t\t\tbool delete_flag = false;\n\t\t\tchar buf[MAXBUFLEN + 1];\n\t\t\tint len = 0;\n            \/\/ file descriptor set for writing to file\n            fd_set set;\n            FD_SET(sfd, &set);\n            struct timeval timeout;\n            timeout.tv_sec = 30;\n            timeout.tv_usec = 0;\n\t\t\twhile(select(sfd+1, &set, NULL, NULL, &timeout) != 0) {\n                len = read(sfd, buf, MAXBUFLEN);\n                if (len == 0)\t\t\t\t\t\/\/ reached end of file\n                    break;\n\t\t\t\tif (len == -1) {\t\t\t\t\/\/ error condition\n\t\t\t\t\tstd::cerr << \"Error on socket read from client.\"\n\t\t\t\t\t\t<< strerror(errno) << std::endl;\n\t\t\t\t\terrno = 0;\n\t\t\t\t\tdelete_flag = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tfwrite(buf, sizeof(char), len, output_file);\n                timeout.tv_sec = 30;\n                timeout.tv_usec = 0;\n\t\t\t}\n\n\t\t\t\/\/ Close the file, of course.\n\t\t\tfclose(output_file);\n\n\t\t\t\/\/ Delete the file if necessary\n\t\t\tif (delete_flag == true) {\n\t\t\t\tstd::cerr << \"Deleting error'd file.\" << std::endl;\n\t\t\t}\n\t\t}\tbreak;\n\n\t\tcase FILETABLE:\n\t\t{\n\t\t\t\/\/ Have the server send over a fresh copy of its file queue so --\n\t\t\t\/\/ that we know what's going on.\n\n\t\t\t\/\/ Start off by asking ourselves what we have.\n            const char *ret;\n\t\t\tret = update_filetable(BISON_RECIEVE_DIR, filetable);\n\t\t\t\/\/ Oh yeah, and if we failed at that... try again.\n\t\t\tif (ret) {\n\t\t\t\tstd::cerr << \"Filetable did not update:\" << ret << std::endl;\n\t\t\t\tstd::cerr << \"Well, the file recieve directory is being made.\"\n\t\t\t\t\t<< std::endl;\n\t\t\t\tdirChkCreate(BISON_RECIEVE_DIR.c_str(), \"recieve\");\n\t\t\t\tclose(sfd);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t\/\/ Ask the server for its file table.\n\t\t\t\/\/ (What is this?  A date? -- Brandon)\n\t\t\tdprintf(sfd, \"FTREQ\\n\\n\");\n\t\t\tstd::map<std::string, std::vector<unsigned char>> tmp_filetable;\n\n\t\t\t\/\/ Parse the filetable information.\n\t\t\t\/\/ (Hang in there buddy, it's going to take a little work to --\n\t\t\t\/\/ make it all work out. -- Brandon)\n\t\t\tmd5_parse(sfd, tmp_filetable);\n\n\t\t\t\/\/ If our current filetable is empty, dump it.\n\t\t\tif (!filequeue.empty())\n\t\t\t\tstd::cerr << \"Filetable is not empty. Emptying.\" << std::endl;\n\t\t\twhile(!filequeue.empty())\n\t\t\t\tfilequeue.pop();\n\n\t\t\t\/\/ Check for files here that do not exist on our end.\n\t\t\tfor (std::map<std::string, std::vector<unsigned char>>::iterator\n\t\t\t\tit = tmp_filetable.begin(); it != tmp_filetable.end(); it++) {\n\t\t\t\tstd::map<std::string, std::vector<unsigned char>>::iterator\n\t\t\t\t\tit2 = filetable.find(it->first);\n\n\t\t\t\t\/\/ nonexistent file\n\t\t\t\tif (it2 == filetable.end()) {\n\t\t\t\t\tstd::cout << \"Missing: \" << it->first << std::endl;\n\t\t\t\t\tfilequeue.push(it->first);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\t\/\/ handle incorrect \/ incomplete files\n\t\t\t\tif (it2->second != it->second) {\n\t\t\t\t\tstd::cout << \"Corrupt file: \" << it->first << std::endl;\n\t\t\t\t\trecalc_queue.push(it->first);\n\t\t\t\t\tfilequeue.push(it->first);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\taction = TRANSFER;\n\t\t}\tbreak;\n\t\tcase REALTIME:\n\t\t\t\/\/ Not implemented yet, I blame the rest of the requirements.\n\t\t\tbreak;\n\t\tcase RECALCULATE_MD5:\n\t\t{\n\t\t\t\/\/ Oh, we're in trouble.  We need to recalculate a faulty MD5 sum.\n\t\t\tstd::cout << \"Recalculating for\"\n\t\t\t\t<< recalc_queue.front() << std::endl;\n\t\t\t\/\/ Get the file that we need to recalculate\n\t\t\tstd::string filename(recalc_queue.front());\n\t\t\trecalc_queue.pop();\n\n\t\t\t\/\/ Tell the server to recalculate it.\n\t\t\tdprintf(sfd, \"RECALC: %s\\n\\n\", filename.c_str());\n\n\t\t\t\/\/ And recalculate it ourselves.\n\t\t\trecalculate_MD5(BISON_RECIEVE_DIR, filename, filetable);\n\t\t}\tbreak;\n\t}\n\tclose(sfd);\n}\n\n\/\/ ======= Configuration Reloading ========\nvoid configuration_reload(int sig)\n{\n\tconfigure_client(config);\n}\n\n\/\/ =========== Signal Handling =============\nvoid signalHandling()\n{\n\tsignal (SIGHUP, configuration_reload);\n\tsignal(SIGCHLD, SIG_IGN);\t\t\t\t\/\/ ignore children for now\n\t\/\/ Handle different ways of program termination\n\tsignal(SIGTERM, terminate_nicely);\n\tsignal(SIGINT, terminate_nicely);\n\n}\n\n\/\/ ========== The Main Function ============\nint main (int argc, char *argv[])\n{\n\tconfigure_client(config);\n\n\t\/\/ PID management is offloaded to initialization daemon\n\n\tsignalHandling();\n\n\tdirChkCreate(BISON_RECIEVE_DIR.c_str(), \"recieve\");\n\n\tprintf(\"Client Starting Up...\\n\");\n\taction_t action = FILETABLE;\n\n\twhile(1) {\n\t\thandle_connection(action);\n\t\t\/\/ Actually time things out after return\n\t\t\/\/ this runs for one second.\n\t\tfor (int i = 0; i < ERROR_WAIT; i++)\n\t\t\tusleep(1000);\n\t}\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <filesystem>\n#include <json.hpp>\n#include <logger.hpp>\n#include <nbt\/parser.hpp>\n#include <nbt\/to_json.hpp>\n#include <zlib.h>\n\n#define BUFFERSIZE 2000000\n\nusing nlohmann::json;\nusing std::filesystem::exists;\nusing std::filesystem::path;\n\nSETUP_LOGGER\n\nint main(int argc, char **argv) {\n  if (argc > 2 || (argc == 2 && !exists(path(argv[1]))) ||\n      !nbt::assert_NBT(argv[1])) {\n    logger::error(\"Usage: {} [NBT file]\\n\", argv[0]);\n    return 1;\n  }\n\n  gzFile f;\n\n#ifndef _WINDOWS\n  if (argc == 1)\n    f = gzdopen(STDIN_FILENO, \"r\");\n  else\n#endif\n    f = gzopen(argv[1], \"r\");\n\n  if (!f) {\n    logger::error(\"Error opening file: {}\\n\", strerror(errno));\n    return 1;\n  }\n\n  uint8_t buffer[BUFFERSIZE];\n  size_t length = gzread(f, buffer, sizeof(uint8_t) * BUFFERSIZE);\n  gzclose(f);\n\n  nbt::NBT data;\n\n  if (!nbt::parse(buffer, length, data)) {\n    logger::error(\"Error parsing data !\\n\");\n    return 1;\n  } else\n    logger::info(\"{}\", json(data).dump());\n\n  return 0;\n}\n<commit_msg>Fixed segfault on pipe input<commit_after>#include <filesystem>\n#include <json.hpp>\n#include <logger.hpp>\n#include <nbt\/parser.hpp>\n#include <nbt\/to_json.hpp>\n#include <zlib.h>\n\n#define BUFFERSIZE 2000000\n\nusing nlohmann::json;\nusing std::filesystem::exists;\nusing std::filesystem::path;\n\nSETUP_LOGGER\n\nint main(int argc, char **argv) {\n  if (argc > 2 || (argc == 2 && !exists(path(argv[1]))) ||\n      (argc > 2 && !nbt::assert_NBT(argv[1]))) {\n    logger::error(\"Usage: {} [NBT file]\\n\", argv[0]);\n    return 1;\n  }\n\n  gzFile f;\n\n#ifndef _WINDOWS\n  if (argc == 1)\n    f = gzdopen(STDIN_FILENO, \"r\");\n  else\n#endif\n    f = gzopen(argv[1], \"r\");\n\n  if (!f) {\n    logger::error(\"Error opening file: {}\\n\", strerror(errno));\n    return 1;\n  }\n\n  uint8_t buffer[BUFFERSIZE];\n  size_t length = gzread(f, buffer, sizeof(uint8_t) * BUFFERSIZE);\n  gzclose(f);\n\n  nbt::NBT data;\n\n  if (!nbt::parse(buffer, length, data)) {\n    logger::error(\"Error parsing data !\\n\");\n    return 1;\n  } else\n    logger::info(\"{}\", json(data).dump());\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <Commands\/Shoot.h>\n\n\/**\n * Commands namespace with implementation\n * of Shoot command group.\n *\/\nnamespace commands\n{\n\n\/\/ Constructor:\nShoot::Shoot(Intake* intake, Shooter* shooter, double wait_time, double shoot_time, double timeout) : CommandGroup(\"Shoot\")\n{\n\tintake_ = intake;\n\tshooter_ = shooter;\n\n\tshoot_time_ = shoot_time;\n\ttimeout_ = timeout;\n\twait_time_ = wait_time;\n\n\tshoot_intake_ = new ShootIntake(intake_, shooter_, shoot_time_, timeout_);\n\twait_ = new WaitCommand(wait_time_);\n\tspin_down_ = new SpinDown(shooter_);\n\n\tAddSequential(shoot_intake_);\n\tAddSequential(wait_);\n\tAddSequential(spin_down_);\n\n\tRequires(intake);\n\tSetInterruptible(false);\n}\n\n\/\/ Main functions:\nvoid Shoot::Initialize()\n{\n\tstd::cout << \"Intake and Shooter : Shoot : Started with wait time = \" << wait_time_ << \", shoot time = \";\n\tstd::cout << shoot_time_ << \", and timeout = \" << timeout_ << std::endl;\n\tif (shooter_->GetState() != State_t::SPUNUP)\n\t\tCancel();\n}\n\nvoid Shoot::SetShootTime(double shoot_time)\n{\n\tshoot_time_ = shoot_time;\n\tshoot_intake_->SetShootTime(shoot_time_);\n}\n\ndouble Shoot::GetShootTime() const\n{\n\treturn shoot_time_;\n}\n\nvoid Shoot::SetTimeOut(double timeout)\n{\n\ttimeout_ = timeout;\n\tshoot_intake_->SetOverallTimeout(timeout_);\n}\n\ndouble Shoot::GetTimeOut() const\n{\n\treturn timeout_;\n}\n\nvoid Shoot::SetWaitTime(double wait_time)\n{\n\twait_time_ = wait_time;\n}\n\ndouble Shoot::GetWaitTime() const\n{\n\treturn wait_time_;\n}\n\n} \/\/ end namespace commands\n<commit_msg>Implements the previous changes detailed.<commit_after>#include <Commands\/Shoot.h>\n\n\/**\n * Commands namespace with implementation\n * of Shoot command group.\n *\/\nnamespace commands\n{\n\n\/\/ Constructor:\nShoot::Shoot(Intake* intake, Shooter* shooter, double wait_time, double shoot_time, double timeout) : CommandGroup(\"Shoot\")\n{\n\tintake_ = intake;\n\tshooter_ = shooter;\n\n\tshoot_time_ = shoot_time;\n\ttimeout_ = timeout;\n\twait_time_ = wait_time;\n\n\tshoot_intake_ = new ShootIntake(intake_, shooter_, shoot_time_, timeout_);\n\tspin_down_ = new SpinDown(shooter_);\n\n\tAddSequential(shoot_intake_);\n\tAddSequential(spin_down_, wait_time_);\n\n\tRequires(intake);\n\tSetInterruptible(false);\n}\n\n\/\/ Main functions:\nvoid Shoot::Initialize()\n{\n\tstd::cout << \"Intake and Shooter : Shoot : Started with wait time = \" << wait_time_ << \", shoot time = \";\n\tstd::cout << shoot_time_ << \", and timeout = \" << timeout_ << std::endl;\n\tif (shooter_->GetState() != State_t::SPUNUP)\n\t\tCancel();\n}\n\nvoid Shoot::SetShootTime(double shoot_time)\n{\n\tshoot_time_ = shoot_time;\n\tshoot_intake_->SetShootTime(shoot_time_);\n}\n\ndouble Shoot::GetShootTime() const\n{\n\treturn shoot_time_;\n}\n\nvoid Shoot::SetTimeOut(double timeout)\n{\n\ttimeout_ = timeout;\n\tshoot_intake_->SetOverallTimeout(timeout_);\n}\n\ndouble Shoot::GetTimeOut() const\n{\n\treturn timeout_;\n}\n\nvoid Shoot::SetWaitTime(double wait_time)\n{\n\twait_time_ = wait_time;\n}\n\ndouble Shoot::GetWaitTime() const\n{\n\treturn wait_time_;\n}\n\n} \/\/ end namespace commands\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2007-2017 Content Management AG\n * All rights reserved.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * - Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * - Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the\n * distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE\n * FOUNDATION OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n * OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"file_headers.hxx\"\n#include \"static_headers.hxx\"\n#include \"GrowingBuffer.hxx\"\n#include \"header_writer.hxx\"\n#include \"request.hxx\"\n#include \"http_server\/Request.hxx\"\n#include \"http_headers.hxx\"\n#include \"translation\/Vary.hxx\"\n#include \"http\/List.hxx\"\n#include \"http\/Date.hxx\"\n#include \"util\/DecimalFormat.h\"\n\n#include <attr\/xattr.h>\n\n#include <assert.h>\n#include <stdlib.h>\n#include <sys\/stat.h>\n\ngcc_pure\nstatic std::chrono::seconds\nread_xattr_max_age(int fd)\n{\n    assert(fd >= 0);\n\n    char buffer[32];\n    ssize_t nbytes = fgetxattr(fd, \"user.MaxAge\",\n                               buffer, sizeof(buffer) - 1);\n    if (nbytes <= 0)\n        return std::chrono::seconds::zero();\n\n    buffer[nbytes] = 0;\n\n    char *endptr;\n    unsigned long max_age = strtoul(buffer, &endptr, 10);\n    if (*endptr != 0)\n        return std::chrono::seconds::zero();\n\n    return std::chrono::seconds(max_age);\n}\n\nstatic void\ngenerate_expires(GrowingBuffer &headers,\n                 std::chrono::system_clock::duration max_age)\n{\n    constexpr std::chrono::system_clock::duration max_max_age =\n        std::chrono::hours(365 * 24);\n    if (max_age > max_max_age)\n        \/* limit max_age to approximately one year *\/\n        max_age = max_max_age;\n\n    \/* generate an \"Expires\" response header *\/\n    header_write(headers, \"expires\",\n                 http_date_format(std::chrono::system_clock::now() + max_age));\n}\n\nstatic void\nfile_cache_headers(GrowingBuffer &headers,\n                   int fd, const struct stat &st,\n                   std::chrono::seconds max_age)\n{\n    assert(fd >= 0);\n\n    char buffer[64];\n\n    ssize_t nbytes;\n    char etag[512];\n\n    nbytes = fgetxattr(fd, \"user.ETag\",\n                       etag + 1, sizeof(etag) - 3);\n    if (nbytes > 0) {\n        assert((size_t)nbytes < sizeof(etag));\n        etag[0] = '\"';\n        etag[nbytes + 1] = '\"';\n        etag[nbytes + 2] = 0;\n        header_write(headers, \"etag\", etag);\n    } else {\n        static_etag(buffer, st);\n        header_write(headers, \"etag\", buffer);\n    }\n\n    if (max_age == std::chrono::seconds::zero())\n        max_age = read_xattr_max_age(fd);\n\n    if (max_age > std::chrono::seconds::zero())\n        generate_expires(headers, max_age);\n}\n\n\/**\n * Verifies the If-Range request header (RFC 2616 14.27).\n *\/\nstatic bool\ncheck_if_range(const char *if_range, const struct stat &st)\n{\n    if (if_range == nullptr)\n        return true;\n\n    const auto t = http_date_parse(if_range);\n    if (t != std::chrono::system_clock::from_time_t(-1))\n        return std::chrono::system_clock::from_time_t(st.st_mtime) == t;\n\n    char etag[64];\n    static_etag(etag, st);\n    return strcmp(if_range, etag) == 0;\n}\n\nbool\nfile_evaluate_request(Request &request2,\n                      int fd, const struct stat &st,\n                      struct file_request &file_request)\n{\n    const auto &request = request2.request;\n    const auto &request_headers = request.headers;\n    const auto &tr = *request2.translate.response;\n    bool ignore_if_modified_since = false;\n\n    if (tr.status == 0 && request.method == HTTP_METHOD_GET &&\n        !request2.IsTransformationEnabled()) {\n        const char *p = request_headers.Get(\"range\");\n\n        if (p != nullptr &&\n            check_if_range(request_headers.Get(\"if-range\"), st))\n            file_request.range.ParseRangeHeader(p);\n    }\n\n    if (!request2.IsTransformationEnabled()) {\n        const char *p = request_headers.Get(\"if-match\");\n        if (p != nullptr && strcmp(p, \"*\") != 0) {\n            char buffer[64];\n            static_etag(buffer, st);\n\n            if (!http_list_contains(p, buffer)) {\n                response_dispatch(request2, HTTP_STATUS_PRECONDITION_FAILED,\n                                  HttpHeaders(request2.pool), nullptr);\n                return false;\n            }\n        }\n\n        p = request_headers.Get(\"if-none-match\");\n        if (p != nullptr && strcmp(p, \"*\") == 0) {\n            response_dispatch(request2, HTTP_STATUS_PRECONDITION_FAILED,\n                              HttpHeaders(request2.pool), nullptr);\n            return false;\n        }\n\n        if (p != nullptr) {\n            char buffer[64];\n            static_etag(buffer, st);\n\n            if (http_list_contains(p, buffer)) {\n                response_dispatch(request2, HTTP_STATUS_PRECONDITION_FAILED,\n                                  HttpHeaders(request2.pool), nullptr);\n                return false;\n            }\n\n            \/* RFC 2616 14.26: \"If none of the entity tags match, then\n               the server MAY perform the requested method as if the\n               If-None-Match header field did not exist, but MUST also\n               ignore any If-Modified-Since header field(s) in the\n               request.\" *\/\n            ignore_if_modified_since = true;\n        }\n    }\n\n    if (!request2.IsProcessorEnabled()) {\n        const char *p = ignore_if_modified_since\n            ? nullptr\n            : request_headers.Get(\"if-modified-since\");\n        if (p != nullptr) {\n            const auto t = http_date_parse(p);\n            if (t != std::chrono::system_clock::from_time_t(-1) &&\n                std::chrono::system_clock::from_time_t(st.st_mtime) <= t) {\n                HttpHeaders headers(request2.pool);\n                GrowingBuffer headers2 = headers.MakeBuffer();\n\n                if (fd >= 0)\n                    file_cache_headers(headers2, fd, st,\n                                       tr.expires_relative);\n\n                write_translation_vary_header(headers2, tr);\n\n                response_dispatch(request2, HTTP_STATUS_NOT_MODIFIED,\n                                  std::move(headers), nullptr);\n                return false;\n            }\n        }\n\n        p = request_headers.Get(\"if-unmodified-since\");\n        if (p != nullptr) {\n            const auto t = http_date_parse(p);\n            if (t != std::chrono::system_clock::from_time_t(-1) &&\n                std::chrono::system_clock::from_time_t(st.st_mtime) > t) {\n                response_dispatch(request2, HTTP_STATUS_PRECONDITION_FAILED,\n                                  HttpHeaders(request2.pool), nullptr);\n                return false;\n            }\n        }\n    }\n\n    return true;\n}\n\nvoid\nfile_response_headers(GrowingBuffer &headers,\n                      const char *override_content_type,\n                      int fd, const struct stat &st,\n                      std::chrono::seconds expires_relative,\n                      bool processor_enabled, bool processor_first)\n{\n    if (!processor_first && fd >= 0)\n        file_cache_headers(headers, fd, st, expires_relative);\n    else {\n        char etag[64];\n        static_etag(etag, st);\n        header_write(headers, \"etag\", etag);\n\n        if (expires_relative > std::chrono::seconds::zero())\n            generate_expires(headers, expires_relative);\n    }\n\n    if (override_content_type != nullptr) {\n        \/* content type override from the translation server *\/\n        header_write(headers, \"content-type\", override_content_type);\n    } else {\n        char content_type[256];\n        if (load_xattr_content_type(content_type, sizeof(content_type), fd)) {\n            header_write(headers, \"content-type\", content_type);\n        } else {\n            header_write(headers, \"content-type\", \"application\/octet-stream\");\n        }\n    }\n\n#ifndef NO_LAST_MODIFIED_HEADER\n    if (!processor_enabled)\n        header_write(headers, \"last-modified\",\n                     http_date_format(std::chrono::system_clock::from_time_t(st.st_mtime)));\n#endif\n}\n<commit_msg>file_headers: move code to ReadETag()<commit_after>\/*\n * Copyright 2007-2017 Content Management AG\n * All rights reserved.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * - Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * - Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the\n * distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE\n * FOUNDATION OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n * OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"file_headers.hxx\"\n#include \"static_headers.hxx\"\n#include \"GrowingBuffer.hxx\"\n#include \"header_writer.hxx\"\n#include \"request.hxx\"\n#include \"http_server\/Request.hxx\"\n#include \"http_headers.hxx\"\n#include \"translation\/Vary.hxx\"\n#include \"http\/List.hxx\"\n#include \"http\/Date.hxx\"\n#include \"util\/DecimalFormat.h\"\n\n#include <attr\/xattr.h>\n\n#include <assert.h>\n#include <stdlib.h>\n#include <sys\/stat.h>\n\ngcc_pure\nstatic std::chrono::seconds\nread_xattr_max_age(int fd)\n{\n    assert(fd >= 0);\n\n    char buffer[32];\n    ssize_t nbytes = fgetxattr(fd, \"user.MaxAge\",\n                               buffer, sizeof(buffer) - 1);\n    if (nbytes <= 0)\n        return std::chrono::seconds::zero();\n\n    buffer[nbytes] = 0;\n\n    char *endptr;\n    unsigned long max_age = strtoul(buffer, &endptr, 10);\n    if (*endptr != 0)\n        return std::chrono::seconds::zero();\n\n    return std::chrono::seconds(max_age);\n}\n\nstatic void\ngenerate_expires(GrowingBuffer &headers,\n                 std::chrono::system_clock::duration max_age)\n{\n    constexpr std::chrono::system_clock::duration max_max_age =\n        std::chrono::hours(365 * 24);\n    if (max_age > max_max_age)\n        \/* limit max_age to approximately one year *\/\n        max_age = max_max_age;\n\n    \/* generate an \"Expires\" response header *\/\n    header_write(headers, \"expires\",\n                 http_date_format(std::chrono::system_clock::now() + max_age));\n}\n\nstatic bool\nReadETag(int fd, char *buffer, size_t size) noexcept\n{\n    assert(fd >= 0);\n    assert(size > 4);\n\n    const auto nbytes = fgetxattr(fd, \"user.ETag\", buffer + 1, size - 3);\n    if (nbytes <= 0)\n        return false;\n\n    assert((size_t)nbytes < size);\n\n    buffer[0] = '\"';\n    buffer[nbytes + 1] = '\"';\n    buffer[nbytes + 2] = 0;\n    return true;\n}\n\nstatic void\nfile_cache_headers(GrowingBuffer &headers,\n                   int fd, const struct stat &st,\n                   std::chrono::seconds max_age)\n{\n    assert(fd >= 0);\n\n    char buffer[64];\n\n    char etag[512];\n\n    if (ReadETag(fd, etag, sizeof(etag))) {\n        header_write(headers, \"etag\", etag);\n    } else {\n        static_etag(buffer, st);\n        header_write(headers, \"etag\", buffer);\n    }\n\n    if (max_age == std::chrono::seconds::zero())\n        max_age = read_xattr_max_age(fd);\n\n    if (max_age > std::chrono::seconds::zero())\n        generate_expires(headers, max_age);\n}\n\n\/**\n * Verifies the If-Range request header (RFC 2616 14.27).\n *\/\nstatic bool\ncheck_if_range(const char *if_range, const struct stat &st)\n{\n    if (if_range == nullptr)\n        return true;\n\n    const auto t = http_date_parse(if_range);\n    if (t != std::chrono::system_clock::from_time_t(-1))\n        return std::chrono::system_clock::from_time_t(st.st_mtime) == t;\n\n    char etag[64];\n    static_etag(etag, st);\n    return strcmp(if_range, etag) == 0;\n}\n\nbool\nfile_evaluate_request(Request &request2,\n                      int fd, const struct stat &st,\n                      struct file_request &file_request)\n{\n    const auto &request = request2.request;\n    const auto &request_headers = request.headers;\n    const auto &tr = *request2.translate.response;\n    bool ignore_if_modified_since = false;\n\n    if (tr.status == 0 && request.method == HTTP_METHOD_GET &&\n        !request2.IsTransformationEnabled()) {\n        const char *p = request_headers.Get(\"range\");\n\n        if (p != nullptr &&\n            check_if_range(request_headers.Get(\"if-range\"), st))\n            file_request.range.ParseRangeHeader(p);\n    }\n\n    if (!request2.IsTransformationEnabled()) {\n        const char *p = request_headers.Get(\"if-match\");\n        if (p != nullptr && strcmp(p, \"*\") != 0) {\n            char buffer[64];\n            static_etag(buffer, st);\n\n            if (!http_list_contains(p, buffer)) {\n                response_dispatch(request2, HTTP_STATUS_PRECONDITION_FAILED,\n                                  HttpHeaders(request2.pool), nullptr);\n                return false;\n            }\n        }\n\n        p = request_headers.Get(\"if-none-match\");\n        if (p != nullptr && strcmp(p, \"*\") == 0) {\n            response_dispatch(request2, HTTP_STATUS_PRECONDITION_FAILED,\n                              HttpHeaders(request2.pool), nullptr);\n            return false;\n        }\n\n        if (p != nullptr) {\n            char buffer[64];\n            static_etag(buffer, st);\n\n            if (http_list_contains(p, buffer)) {\n                response_dispatch(request2, HTTP_STATUS_PRECONDITION_FAILED,\n                                  HttpHeaders(request2.pool), nullptr);\n                return false;\n            }\n\n            \/* RFC 2616 14.26: \"If none of the entity tags match, then\n               the server MAY perform the requested method as if the\n               If-None-Match header field did not exist, but MUST also\n               ignore any If-Modified-Since header field(s) in the\n               request.\" *\/\n            ignore_if_modified_since = true;\n        }\n    }\n\n    if (!request2.IsProcessorEnabled()) {\n        const char *p = ignore_if_modified_since\n            ? nullptr\n            : request_headers.Get(\"if-modified-since\");\n        if (p != nullptr) {\n            const auto t = http_date_parse(p);\n            if (t != std::chrono::system_clock::from_time_t(-1) &&\n                std::chrono::system_clock::from_time_t(st.st_mtime) <= t) {\n                HttpHeaders headers(request2.pool);\n                GrowingBuffer headers2 = headers.MakeBuffer();\n\n                if (fd >= 0)\n                    file_cache_headers(headers2, fd, st,\n                                       tr.expires_relative);\n\n                write_translation_vary_header(headers2, tr);\n\n                response_dispatch(request2, HTTP_STATUS_NOT_MODIFIED,\n                                  std::move(headers), nullptr);\n                return false;\n            }\n        }\n\n        p = request_headers.Get(\"if-unmodified-since\");\n        if (p != nullptr) {\n            const auto t = http_date_parse(p);\n            if (t != std::chrono::system_clock::from_time_t(-1) &&\n                std::chrono::system_clock::from_time_t(st.st_mtime) > t) {\n                response_dispatch(request2, HTTP_STATUS_PRECONDITION_FAILED,\n                                  HttpHeaders(request2.pool), nullptr);\n                return false;\n            }\n        }\n    }\n\n    return true;\n}\n\nvoid\nfile_response_headers(GrowingBuffer &headers,\n                      const char *override_content_type,\n                      int fd, const struct stat &st,\n                      std::chrono::seconds expires_relative,\n                      bool processor_enabled, bool processor_first)\n{\n    if (!processor_first && fd >= 0)\n        file_cache_headers(headers, fd, st, expires_relative);\n    else {\n        char etag[64];\n        static_etag(etag, st);\n        header_write(headers, \"etag\", etag);\n\n        if (expires_relative > std::chrono::seconds::zero())\n            generate_expires(headers, expires_relative);\n    }\n\n    if (override_content_type != nullptr) {\n        \/* content type override from the translation server *\/\n        header_write(headers, \"content-type\", override_content_type);\n    } else {\n        char content_type[256];\n        if (load_xattr_content_type(content_type, sizeof(content_type), fd)) {\n            header_write(headers, \"content-type\", content_type);\n        } else {\n            header_write(headers, \"content-type\", \"application\/octet-stream\");\n        }\n    }\n\n#ifndef NO_LAST_MODIFIED_HEADER\n    if (!processor_enabled)\n        header_write(headers, \"last-modified\",\n                     http_date_format(std::chrono::system_clock::from_time_t(st.st_mtime)));\n#endif\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Handle the request\/response headers for static files.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"file_headers.hxx\"\n#include \"static-headers.h\"\n#include \"growing-buffer.h\"\n#include \"header-writer.h\"\n#include \"format.h\"\n#include \"date.h\"\n#include \"request.hxx\"\n#include \"http_server.h\"\n#include \"http_util.h\"\n#include \"tvary.hxx\"\n\n#include <assert.h>\n#include <stdlib.h>\n#include <sys\/stat.h>\n\n#ifndef HAVE_ATTR_XATTR_H\n#define NO_XATTR 1\n#endif\n\n#ifndef NO_XATTR\n#include <attr\/xattr.h>\n#endif\n\nstatic enum range_type\nparse_range_header(const char *p, off_t *skip_r, off_t *size_r)\n{\n    unsigned long v;\n    char *endptr;\n\n    assert(p != nullptr);\n    assert(skip_r != nullptr);\n    assert(size_r != nullptr);\n\n    if (memcmp(p, \"bytes=\", 6) != 0)\n        return RANGE_INVALID;\n\n    p += 6;\n\n    if (*p == '-') {\n        \/* suffix-byte-range-spec *\/\n        ++p;\n\n        v = strtoul(p, &endptr, 10);\n        if (v >= (unsigned long)*size_r)\n            return RANGE_NONE;\n\n        *skip_r = *size_r - v;\n    } else {\n        *skip_r = strtoul(p, &endptr, 10);\n        if (*skip_r >= *size_r)\n            return RANGE_INVALID;\n\n        if (*endptr == '-') {\n            p = endptr + 1;\n            if (*p == 0)\n                \/* \"wget -c\" *\/\n                return RANGE_VALID;\n\n            v = strtoul(p, &endptr, 10);\n            if (*endptr != 0 || v < (unsigned long)*skip_r ||\n                v >= (unsigned long)*size_r)\n                return RANGE_INVALID;\n\n            *size_r = v + 1;\n        }\n    }\n\n    return RANGE_VALID;\n}\n\n\/**\n * Verifies the If-Range request header (RFC 2616 14.27).\n *\/\nstatic bool\ncheck_if_range(const char *if_range, const struct stat *st)\n{\n    if (if_range == nullptr)\n        return true;\n\n    time_t t = http_date_parse(if_range);\n    if (t != (time_t)-1)\n        return st->st_mtime == t;\n\n    char etag[64];\n    static_etag(etag, st);\n    return strcmp(if_range, etag) == 0;\n}\n\nbool\nfile_evaluate_request(struct request *request2,\n                      int fd, const struct stat *st,\n                      struct file_request *file_request)\n{\n    struct http_server_request *request = request2->request;\n    const TranslateResponse *tr = request2->translate.response;\n    const char *p;\n    char buffer[64];\n\n    if (tr->status == 0 && request->method == HTTP_METHOD_GET &&\n        !request_transformation_enabled(request2)) {\n        p = strmap_get(request->headers, \"range\");\n\n        if (p != nullptr &&\n            check_if_range(strmap_get(request->headers, \"if-range\"), st))\n            file_request->range =\n                parse_range_header(p, &file_request->skip,\n                                   &file_request->size);\n    }\n\n    if (!request_processor_enabled(request2)) {\n        p = strmap_get(request->headers, \"if-modified-since\");\n        if (p != nullptr) {\n            time_t t = http_date_parse(p);\n            if (t != (time_t)-1 && st->st_mtime <= t) {\n                struct growing_buffer *headers = nullptr;\n                headers = growing_buffer_new(request->pool, 512);\n\n                if (fd >= 0)\n                    file_cache_headers(headers, fd, st);\n\n                write_translation_vary_header(headers,\n                                              request2->translate.response);\n\n                response_dispatch(request2, HTTP_STATUS_NOT_MODIFIED,\n                                  headers, nullptr);\n                return false;\n            }\n        }\n\n        p = strmap_get(request->headers, \"if-unmodified-since\");\n        if (p != nullptr) {\n            time_t t = http_date_parse(p);\n            if (t != (time_t)-1 && st->st_mtime > t) {\n                response_dispatch(request2, HTTP_STATUS_PRECONDITION_FAILED,\n                                  nullptr, nullptr);\n                return false;\n            }\n        }\n    }\n\n    if (!request_transformation_enabled(request2)) {\n        p = strmap_get(request->headers, \"if-match\");\n        if (p != nullptr && strcmp(p, \"*\") != 0) {\n            static_etag(buffer, st);\n\n            if (!http_list_contains(p, buffer)) {\n                response_dispatch(request2, HTTP_STATUS_PRECONDITION_FAILED,\n                                  nullptr, nullptr);\n                return false;\n            }\n        }\n\n        p = strmap_get(request->headers, \"if-none-match\");\n        if (p != nullptr && strcmp(p, \"*\") == 0) {\n            response_dispatch(request2, HTTP_STATUS_PRECONDITION_FAILED,\n                              nullptr, nullptr);\n            return false;\n        }\n\n        if (p != nullptr) {\n            static_etag(buffer, st);\n\n            if (http_list_contains(p, buffer)) {\n                response_dispatch(request2, HTTP_STATUS_PRECONDITION_FAILED,\n                                  nullptr, nullptr);\n                return false;\n            }\n        }\n    }\n\n    return true;\n}\n\ngcc_pure\nstatic unsigned\nread_xattr_max_age(int fd)\n{\n    assert(fd >= 0);\n\n    char buffer[32];\n    ssize_t nbytes = fgetxattr(fd, \"user.MaxAge\",\n                               buffer, sizeof(buffer) - 1);\n    if (nbytes <= 0)\n        return 0;\n\n    buffer[nbytes] = 0;\n\n    char *endptr;\n    unsigned long max_age = strtoul(buffer, &endptr, 10);\n    if (*endptr != 0)\n        return 0;\n\n    return max_age;\n}\n\nvoid\nfile_cache_headers(struct growing_buffer *headers,\n                   int fd, const struct stat *st)\n{\n    assert(fd >= 0);\n\n    char buffer[64];\n\n#ifdef NO_XATTR\n    (void)fd;\n#endif\n\n#ifndef NO_XATTR\n    ssize_t nbytes;\n    char etag[512];\n\n    nbytes = fgetxattr(fd, \"user.ETag\",\n                       etag + 1, sizeof(etag) - 3);\n    if (nbytes > 0) {\n        assert((size_t)nbytes < sizeof(etag));\n        etag[0] = '\"';\n        etag[nbytes + 1] = '\"';\n        etag[nbytes + 2] = 0;\n        header_write(headers, \"etag\", etag);\n    } else {\n#endif\n        static_etag(buffer, st);\n        header_write(headers, \"etag\", buffer);\n#ifndef NO_XATTR\n    }\n#endif\n\n#ifndef NO_XATTR\n    unsigned max_age = read_xattr_max_age(fd);\n    if (max_age > 0) {\n        if (max_age > 365 * 24 * 3600)\n            \/* limit max_age to approximately one year *\/\n            max_age = 365 * 24 * 3600;\n\n        \/* generate an \"Expires\" response header *\/\n        header_write(headers, \"expires\",\n                     http_date_format(time(nullptr) + max_age));\n    }\n#endif\n}\n\nvoid\nfile_response_headers(struct growing_buffer *headers,\n                      const char *override_content_type,\n                      int fd, const struct stat *st,\n                      bool processor_enabled, bool processor_first)\n{\n    if (!processor_first && fd >= 0)\n        file_cache_headers(headers, fd, st);\n    else {\n        char etag[64];\n        static_etag(etag, st);\n        header_write(headers, \"etag\", etag);\n    }\n\n    if (override_content_type != nullptr) {\n        \/* content type override from the translation server *\/\n        header_write(headers, \"content-type\", override_content_type);\n    } else {\n#ifndef NO_XATTR\n        char content_type[256];\n        if (load_xattr_content_type(content_type, sizeof(content_type), fd)) {\n            header_write(headers, \"content-type\", content_type);\n        } else {\n#endif \/* #ifndef NO_XATTR *\/\n            header_write(headers, \"content-type\", \"application\/octet-stream\");\n#ifndef NO_XATTR\n        }\n#endif \/* #ifndef NO_XATTR *\/\n    }\n\n#ifndef NO_LAST_MODIFIED_HEADER\n    if (!processor_enabled)\n        header_write(headers, \"last-modified\", http_date_format(st->st_mtime));\n#endif\n}\n<commit_msg>file_headers: move code to generate_expires()<commit_after>\/*\n * Handle the request\/response headers for static files.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"file_headers.hxx\"\n#include \"static-headers.h\"\n#include \"growing-buffer.h\"\n#include \"header-writer.h\"\n#include \"format.h\"\n#include \"date.h\"\n#include \"request.hxx\"\n#include \"http_server.h\"\n#include \"http_util.h\"\n#include \"tvary.hxx\"\n\n#include <assert.h>\n#include <stdlib.h>\n#include <sys\/stat.h>\n\n#ifndef HAVE_ATTR_XATTR_H\n#define NO_XATTR 1\n#endif\n\n#ifndef NO_XATTR\n#include <attr\/xattr.h>\n#endif\n\nstatic enum range_type\nparse_range_header(const char *p, off_t *skip_r, off_t *size_r)\n{\n    unsigned long v;\n    char *endptr;\n\n    assert(p != nullptr);\n    assert(skip_r != nullptr);\n    assert(size_r != nullptr);\n\n    if (memcmp(p, \"bytes=\", 6) != 0)\n        return RANGE_INVALID;\n\n    p += 6;\n\n    if (*p == '-') {\n        \/* suffix-byte-range-spec *\/\n        ++p;\n\n        v = strtoul(p, &endptr, 10);\n        if (v >= (unsigned long)*size_r)\n            return RANGE_NONE;\n\n        *skip_r = *size_r - v;\n    } else {\n        *skip_r = strtoul(p, &endptr, 10);\n        if (*skip_r >= *size_r)\n            return RANGE_INVALID;\n\n        if (*endptr == '-') {\n            p = endptr + 1;\n            if (*p == 0)\n                \/* \"wget -c\" *\/\n                return RANGE_VALID;\n\n            v = strtoul(p, &endptr, 10);\n            if (*endptr != 0 || v < (unsigned long)*skip_r ||\n                v >= (unsigned long)*size_r)\n                return RANGE_INVALID;\n\n            *size_r = v + 1;\n        }\n    }\n\n    return RANGE_VALID;\n}\n\n\/**\n * Verifies the If-Range request header (RFC 2616 14.27).\n *\/\nstatic bool\ncheck_if_range(const char *if_range, const struct stat *st)\n{\n    if (if_range == nullptr)\n        return true;\n\n    time_t t = http_date_parse(if_range);\n    if (t != (time_t)-1)\n        return st->st_mtime == t;\n\n    char etag[64];\n    static_etag(etag, st);\n    return strcmp(if_range, etag) == 0;\n}\n\nbool\nfile_evaluate_request(struct request *request2,\n                      int fd, const struct stat *st,\n                      struct file_request *file_request)\n{\n    struct http_server_request *request = request2->request;\n    const TranslateResponse *tr = request2->translate.response;\n    const char *p;\n    char buffer[64];\n\n    if (tr->status == 0 && request->method == HTTP_METHOD_GET &&\n        !request_transformation_enabled(request2)) {\n        p = strmap_get(request->headers, \"range\");\n\n        if (p != nullptr &&\n            check_if_range(strmap_get(request->headers, \"if-range\"), st))\n            file_request->range =\n                parse_range_header(p, &file_request->skip,\n                                   &file_request->size);\n    }\n\n    if (!request_processor_enabled(request2)) {\n        p = strmap_get(request->headers, \"if-modified-since\");\n        if (p != nullptr) {\n            time_t t = http_date_parse(p);\n            if (t != (time_t)-1 && st->st_mtime <= t) {\n                struct growing_buffer *headers = nullptr;\n                headers = growing_buffer_new(request->pool, 512);\n\n                if (fd >= 0)\n                    file_cache_headers(headers, fd, st);\n\n                write_translation_vary_header(headers,\n                                              request2->translate.response);\n\n                response_dispatch(request2, HTTP_STATUS_NOT_MODIFIED,\n                                  headers, nullptr);\n                return false;\n            }\n        }\n\n        p = strmap_get(request->headers, \"if-unmodified-since\");\n        if (p != nullptr) {\n            time_t t = http_date_parse(p);\n            if (t != (time_t)-1 && st->st_mtime > t) {\n                response_dispatch(request2, HTTP_STATUS_PRECONDITION_FAILED,\n                                  nullptr, nullptr);\n                return false;\n            }\n        }\n    }\n\n    if (!request_transformation_enabled(request2)) {\n        p = strmap_get(request->headers, \"if-match\");\n        if (p != nullptr && strcmp(p, \"*\") != 0) {\n            static_etag(buffer, st);\n\n            if (!http_list_contains(p, buffer)) {\n                response_dispatch(request2, HTTP_STATUS_PRECONDITION_FAILED,\n                                  nullptr, nullptr);\n                return false;\n            }\n        }\n\n        p = strmap_get(request->headers, \"if-none-match\");\n        if (p != nullptr && strcmp(p, \"*\") == 0) {\n            response_dispatch(request2, HTTP_STATUS_PRECONDITION_FAILED,\n                              nullptr, nullptr);\n            return false;\n        }\n\n        if (p != nullptr) {\n            static_etag(buffer, st);\n\n            if (http_list_contains(p, buffer)) {\n                response_dispatch(request2, HTTP_STATUS_PRECONDITION_FAILED,\n                                  nullptr, nullptr);\n                return false;\n            }\n        }\n    }\n\n    return true;\n}\n\ngcc_pure\nstatic unsigned\nread_xattr_max_age(int fd)\n{\n    assert(fd >= 0);\n\n    char buffer[32];\n    ssize_t nbytes = fgetxattr(fd, \"user.MaxAge\",\n                               buffer, sizeof(buffer) - 1);\n    if (nbytes <= 0)\n        return 0;\n\n    buffer[nbytes] = 0;\n\n    char *endptr;\n    unsigned long max_age = strtoul(buffer, &endptr, 10);\n    if (*endptr != 0)\n        return 0;\n\n    return max_age;\n}\n\nstatic void\ngenerate_expires(struct growing_buffer *headers, unsigned max_age)\n{\n    if (max_age > 365 * 24 * 3600)\n        \/* limit max_age to approximately one year *\/\n        max_age = 365 * 24 * 3600;\n\n    \/* generate an \"Expires\" response header *\/\n    header_write(headers, \"expires\",\n                 http_date_format(time(nullptr) + max_age));\n}\n\nvoid\nfile_cache_headers(struct growing_buffer *headers,\n                   int fd, const struct stat *st)\n{\n    assert(fd >= 0);\n\n    char buffer[64];\n\n#ifdef NO_XATTR\n    (void)fd;\n#endif\n\n#ifndef NO_XATTR\n    ssize_t nbytes;\n    char etag[512];\n\n    nbytes = fgetxattr(fd, \"user.ETag\",\n                       etag + 1, sizeof(etag) - 3);\n    if (nbytes > 0) {\n        assert((size_t)nbytes < sizeof(etag));\n        etag[0] = '\"';\n        etag[nbytes + 1] = '\"';\n        etag[nbytes + 2] = 0;\n        header_write(headers, \"etag\", etag);\n    } else {\n#endif\n        static_etag(buffer, st);\n        header_write(headers, \"etag\", buffer);\n#ifndef NO_XATTR\n    }\n#endif\n\n#ifndef NO_XATTR\n    unsigned max_age = read_xattr_max_age(fd);\n    if (max_age > 0)\n        generate_expires(headers, max_age);\n#endif\n}\n\nvoid\nfile_response_headers(struct growing_buffer *headers,\n                      const char *override_content_type,\n                      int fd, const struct stat *st,\n                      bool processor_enabled, bool processor_first)\n{\n    if (!processor_first && fd >= 0)\n        file_cache_headers(headers, fd, st);\n    else {\n        char etag[64];\n        static_etag(etag, st);\n        header_write(headers, \"etag\", etag);\n    }\n\n    if (override_content_type != nullptr) {\n        \/* content type override from the translation server *\/\n        header_write(headers, \"content-type\", override_content_type);\n    } else {\n#ifndef NO_XATTR\n        char content_type[256];\n        if (load_xattr_content_type(content_type, sizeof(content_type), fd)) {\n            header_write(headers, \"content-type\", content_type);\n        } else {\n#endif \/* #ifndef NO_XATTR *\/\n            header_write(headers, \"content-type\", \"application\/octet-stream\");\n#ifndef NO_XATTR\n        }\n#endif \/* #ifndef NO_XATTR *\/\n    }\n\n#ifndef NO_LAST_MODIFIED_HEADER\n    if (!processor_enabled)\n        header_write(headers, \"last-modified\", http_date_format(st->st_mtime));\n#endif\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * This File is part of Davix, The IO library for HTTP based protocols\n * Copyright (C) CERN 2017\n * Author: Georgios Bitzes <georgios.bitzes@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 \"S3IO.hpp\"\n#include <utils\/davix_logger_internal.hpp>\n#include <xml\/S3MultiPartInitiationParser.hpp>\n\n#define SSTR(message) static_cast<std::ostringstream&>(std::ostringstream().flush() << message).str()\n\nnamespace Davix{\n\nstatic bool is_s3_operation(IOChainContext & context){\n  if(context._reqparams->getProtocol() == RequestProtocol::AwsS3) {\n    return true;\n  }\n\n  return false;\n}\n\nstatic bool should_use_s3_multipart(IOChainContext & context, dav_size_t size) {\n  return is_s3_operation(context) && size > (1024 * 1024 * 512); \/\/ 512 MB\n}\n\nS3IO::S3IO() {\n\n}\n\nS3IO::~S3IO() {\n\n}\n\nstd::string S3IO::initiateMultipart(IOChainContext & iocontext) {\n  DavixError * tmp_err=NULL;\n  Uri url(iocontext._uri);\n  url.addQueryParam(\"uploads\", \"\");\n\n  PostRequest req(iocontext._context, url, &tmp_err);\n  checkDavixError(&tmp_err);\n\n  req.setParameters(iocontext._reqparams);\n  req.setRequestBody(\"\");\n  req.executeRequest(&tmp_err);\n  if(!tmp_err && httpcodeIsValid(req.getRequestCode()) == false){\n    httpcodeToDavixError(req.getRequestCode(), davix_scope_io_buff(),\n      \"write error: \", &tmp_err);\n  }\n  checkDavixError(&tmp_err);\n\n  std::string response = req.getAnswerContent();\n  S3MultiPartInitiationParser parser;\n  if(parser.parseChunk(response) != 0) {\n    DavixError::setupError(&tmp_err, \"S3::MultiPart\", StatusCode::InvalidServerResponse, \"Unable to parse server response for multi-part initiation\");\n  }\n  checkDavixError(&tmp_err);\n\n\n  DAVIX_SLOG(DAVIX_LOG_DEBUG, DAVIX_LOG_CHAIN, \"Obtained multi-part upload id {} for {}\", parser.getUploadId(), iocontext._uri);\n  return parser.getUploadId();\n}\n\nstd::string S3IO::writeChunk(IOChainContext & iocontext, const char* buff, dav_size_t size, const std::string &uploadId, int partNumber) {\n  DAVIX_SLOG(DAVIX_LOG_DEBUG, DAVIX_LOG_CHAIN, \"writing chunk #{} with size {}\", partNumber, size);\n\n  DavixError * tmp_err=NULL;\n  Uri url(iocontext._uri);\n  url.addQueryParam(\"uploadId\", uploadId);\n  url.addQueryParam(\"partNumber\", SSTR(partNumber));\n\n  PutRequest req(iocontext._context, url, &tmp_err);\n  checkDavixError(&tmp_err);\n\n  req.setParameters(iocontext._reqparams);\n  req.setRequestBody(buff, size);\n  req.executeRequest(&tmp_err);\n  if(!tmp_err && httpcodeIsValid(req.getRequestCode()) == false){\n      httpcodeToDavixError(req.getRequestCode(), davix_scope_io_buff(),\n                           \"write error: \", &tmp_err);\n  }\n  DAVIX_SLOG(DAVIX_LOG_DEBUG, DAVIX_LOG_CHAIN, \"write result size {}\", size);\n  checkDavixError(&tmp_err);\n\n  std::string etag;\n  if(!req.getAnswerHeader(\"Etag\", etag)) {\n    DavixError::setupError(&tmp_err, \"S3::MultiPart\", StatusCode::InvalidServerResponse, \"Unable to retrieve chunk Etag, necessary when committing chunks\");\n  }\n\n  DAVIX_SLOG(DAVIX_LOG_DEBUG, DAVIX_LOG_CHAIN, \"chunk #{} written successfully, etag: {}\", partNumber, etag);\n  return etag;\n}\n\nvoid S3IO::commitChunks(IOChainContext & iocontext,  const std::string &uploadId, const std::vector<std::string> &etags) {\n  DAVIX_SLOG(DAVIX_LOG_DEBUG, DAVIX_LOG_CHAIN, \"committing {} chunks\", etags.size());\n\n  std::ostringstream payload;\n  payload << \"<CompleteMultipartUpload>\";\n  for(size_t i = 1; i <= etags.size(); i++) {\n    payload << \"<Part>\";\n    payload << \"<PartNumber>\" << i << \"<\/PartNumber>\";\n    payload << \"<ETag>\" << etags[i-1] << \"<\/ETag>\";\n    payload << \"<\/Part>\";\n  }\n  payload << \"<\/CompleteMultipartUpload>\";\n\n  DavixError * tmp_err=NULL;\n  Uri url(iocontext._uri);\n  url.addQueryParam(\"uploadId\", uploadId);\n\n  PostRequest req(iocontext._context, url, &tmp_err);\n  req.setParameters(iocontext._reqparams);\n  req.setRequestBody(payload.str());\n  req.executeRequest(&tmp_err);\n\n  if(!tmp_err && httpcodeIsValid(req.getRequestCode()) == false){\n      httpcodeToDavixError(req.getRequestCode(), davix_scope_io_buff(),\n                           \"write error: \", &tmp_err);\n  }\n  checkDavixError(&tmp_err);\n}\n\nstatic dav_ssize_t readFunction(int fd, void* buffer, dav_size_t size) {\n  dav_ssize_t ret = ::read(fd, buffer, size);\n  if(ret < 0) {\n    int myerr = errno;\n    DAVIX_SLOG(DAVIX_LOG_DEBUG, DAVIX_LOG_CHAIN, \"Error in readFunction when attempting to read from fd {}: Return code {}, errno: {}\", fd, ret, myerr);\n  }\n  return ret;\n}\n\ndav_ssize_t S3IO::writeFromFd(IOChainContext & iocontext, int fd, dav_size_t size) {\n  if(!should_use_s3_multipart(iocontext, size)) {\n    CHAIN_FORWARD(writeFromFd(iocontext, fd, size));\n  }\n\n  using std::placeholders::_1;\n  using std::placeholders::_2;\n\n  DataProviderFun providerFunc = std::bind(readFunction, fd, _1, _2);\n  return this->writeFromCb(iocontext, providerFunc, size);\n}\n\ndav_ssize_t S3IO::writeFromCb(IOChainContext & iocontext, const DataProviderFun & func, dav_size_t size) {\n  if(!should_use_s3_multipart(iocontext, size)) {\n    CHAIN_FORWARD(writeFromCb(iocontext, func, size));\n  }\n\n  DAVIX_SLOG(DAVIX_LOG_DEBUG, DAVIX_LOG_CHAIN, \"Initiating multi-part upload towards {} to upload file with size {}\", iocontext._uri, size);\n  std::string uploadId = initiateMultipart(iocontext);\n\n  size_t remaining = size;\n  const dav_size_t MAX_CHUNK_SIZE = 1024 * 1024 * 256; \/\/ 256 MB\n\n  std::vector<char> buffer;\n  buffer.resize(std::min(MAX_CHUNK_SIZE, size) + 10);\n\n  std::vector<std::string> etags;\n\n  size_t partNumber = 0;\n  while(remaining > 0) {\n    size_t toRead = std::min(size, MAX_CHUNK_SIZE);\n    DAVIX_SLOG(DAVIX_LOG_DEBUG, DAVIX_LOG_CHAIN, \"S3IO write: toRead from cb {}\", toRead);\n\n    dav_ssize_t bytesRead = func(buffer.data(), toRead);\n    DAVIX_SLOG(DAVIX_LOG_DEBUG, DAVIX_LOG_CHAIN, \"S3IO write: bytesRead from cb {}\", bytesRead);\n    if(bytesRead < 0) {\n      throw DavixException(davix_scope_io_buff(), StatusCode::InvalidFileHandle, fmt::format(\"Error when reading from callback: {}\", bytesRead));\n    }\n    if(bytesRead == 0) break; \/\/ EOF?\n\n    partNumber++;\n    etags.emplace_back(writeChunk(iocontext, buffer.data(), bytesRead, uploadId, partNumber));\n   }\n\n   commitChunks(iocontext, uploadId, etags);\n}\n\n\n}<commit_msg>Add ability to force multi-part S3 uploads even for small files<commit_after>\/*\n * This File is part of Davix, The IO library for HTTP based protocols\n * Copyright (C) CERN 2017\n * Author: Georgios Bitzes <georgios.bitzes@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 \"S3IO.hpp\"\n#include <utils\/davix_logger_internal.hpp>\n#include <xml\/S3MultiPartInitiationParser.hpp>\n\n#define SSTR(message) static_cast<std::ostringstream&>(std::ostringstream().flush() << message).str()\n\nnamespace Davix{\n\nstatic bool is_s3_operation(IOChainContext & context){\n  if(context._reqparams->getProtocol() == RequestProtocol::AwsS3) {\n    return true;\n  }\n\n  return false;\n}\n\nstatic bool should_use_s3_multipart(IOChainContext & context, dav_size_t size) {\n  bool is_s3 = is_s3_operation(context);\n\n  if(!is_s3) return false;\n\n  if(context._uri.fragmentParamExists(\"forceMultiPart\")) {\n\n    return true;\n  }\n\n  return size > (1024 * 1024 * 512); \/\/ 512 MB\n}\n\nS3IO::S3IO() {\n\n}\n\nS3IO::~S3IO() {\n\n}\n\nstd::string S3IO::initiateMultipart(IOChainContext & iocontext) {\n  DavixError * tmp_err=NULL;\n  Uri url(iocontext._uri);\n  url.addQueryParam(\"uploads\", \"\");\n\n  PostRequest req(iocontext._context, url, &tmp_err);\n  checkDavixError(&tmp_err);\n\n  req.setParameters(iocontext._reqparams);\n  req.setRequestBody(\"\");\n  req.executeRequest(&tmp_err);\n  if(!tmp_err && httpcodeIsValid(req.getRequestCode()) == false){\n    httpcodeToDavixError(req.getRequestCode(), davix_scope_io_buff(),\n      \"write error: \", &tmp_err);\n  }\n  checkDavixError(&tmp_err);\n\n  std::string response = req.getAnswerContent();\n  S3MultiPartInitiationParser parser;\n  if(parser.parseChunk(response) != 0) {\n    DavixError::setupError(&tmp_err, \"S3::MultiPart\", StatusCode::InvalidServerResponse, \"Unable to parse server response for multi-part initiation\");\n  }\n  checkDavixError(&tmp_err);\n\n\n  DAVIX_SLOG(DAVIX_LOG_DEBUG, DAVIX_LOG_CHAIN, \"Obtained multi-part upload id {} for {}\", parser.getUploadId(), iocontext._uri);\n  return parser.getUploadId();\n}\n\nstd::string S3IO::writeChunk(IOChainContext & iocontext, const char* buff, dav_size_t size, const std::string &uploadId, int partNumber) {\n  DAVIX_SLOG(DAVIX_LOG_DEBUG, DAVIX_LOG_CHAIN, \"writing chunk #{} with size {}\", partNumber, size);\n\n  DavixError * tmp_err=NULL;\n  Uri url(iocontext._uri);\n  url.addQueryParam(\"uploadId\", uploadId);\n  url.addQueryParam(\"partNumber\", SSTR(partNumber));\n\n  PutRequest req(iocontext._context, url, &tmp_err);\n  checkDavixError(&tmp_err);\n\n  req.setParameters(iocontext._reqparams);\n  req.setRequestBody(buff, size);\n  req.executeRequest(&tmp_err);\n  if(!tmp_err && httpcodeIsValid(req.getRequestCode()) == false){\n      httpcodeToDavixError(req.getRequestCode(), davix_scope_io_buff(),\n                           \"write error: \", &tmp_err);\n  }\n  DAVIX_SLOG(DAVIX_LOG_DEBUG, DAVIX_LOG_CHAIN, \"write result size {}\", size);\n  checkDavixError(&tmp_err);\n\n  std::string etag;\n  if(!req.getAnswerHeader(\"Etag\", etag)) {\n    DavixError::setupError(&tmp_err, \"S3::MultiPart\", StatusCode::InvalidServerResponse, \"Unable to retrieve chunk Etag, necessary when committing chunks\");\n  }\n\n  DAVIX_SLOG(DAVIX_LOG_DEBUG, DAVIX_LOG_CHAIN, \"chunk #{} written successfully, etag: {}\", partNumber, etag);\n  return etag;\n}\n\nvoid S3IO::commitChunks(IOChainContext & iocontext,  const std::string &uploadId, const std::vector<std::string> &etags) {\n  DAVIX_SLOG(DAVIX_LOG_DEBUG, DAVIX_LOG_CHAIN, \"committing {} chunks\", etags.size());\n\n  std::ostringstream payload;\n  payload << \"<CompleteMultipartUpload>\";\n  for(size_t i = 1; i <= etags.size(); i++) {\n    payload << \"<Part>\";\n    payload << \"<PartNumber>\" << i << \"<\/PartNumber>\";\n    payload << \"<ETag>\" << etags[i-1] << \"<\/ETag>\";\n    payload << \"<\/Part>\";\n  }\n  payload << \"<\/CompleteMultipartUpload>\";\n\n  DavixError * tmp_err=NULL;\n  Uri url(iocontext._uri);\n  url.addQueryParam(\"uploadId\", uploadId);\n\n  PostRequest req(iocontext._context, url, &tmp_err);\n  req.setParameters(iocontext._reqparams);\n  req.setRequestBody(payload.str());\n  req.executeRequest(&tmp_err);\n\n  if(!tmp_err && httpcodeIsValid(req.getRequestCode()) == false){\n      httpcodeToDavixError(req.getRequestCode(), davix_scope_io_buff(),\n                           \"write error: \", &tmp_err);\n  }\n  checkDavixError(&tmp_err);\n}\n\nstatic dav_ssize_t readFunction(int fd, void* buffer, dav_size_t size) {\n  dav_ssize_t ret = ::read(fd, buffer, size);\n  if(ret < 0) {\n    int myerr = errno;\n    DAVIX_SLOG(DAVIX_LOG_DEBUG, DAVIX_LOG_CHAIN, \"Error in readFunction when attempting to read from fd {}: Return code {}, errno: {}\", fd, ret, myerr);\n  }\n  return ret;\n}\n\ndav_ssize_t S3IO::writeFromFd(IOChainContext & iocontext, int fd, dav_size_t size) {\n  if(!should_use_s3_multipart(iocontext, size)) {\n    CHAIN_FORWARD(writeFromFd(iocontext, fd, size));\n  }\n\n  using std::placeholders::_1;\n  using std::placeholders::_2;\n\n  DataProviderFun providerFunc = std::bind(readFunction, fd, _1, _2);\n  return this->writeFromCb(iocontext, providerFunc, size);\n}\n\ndav_ssize_t S3IO::writeFromCb(IOChainContext & iocontext, const DataProviderFun & func, dav_size_t size) {\n  if(!should_use_s3_multipart(iocontext, size)) {\n    CHAIN_FORWARD(writeFromCb(iocontext, func, size));\n  }\n\n  DAVIX_SLOG(DAVIX_LOG_DEBUG, DAVIX_LOG_CHAIN, \"Initiating multi-part upload towards {} to upload file with size {}\", iocontext._uri, size);\n  std::string uploadId = initiateMultipart(iocontext);\n\n  size_t remaining = size;\n  const dav_size_t MAX_CHUNK_SIZE = 1024 * 1024 * 256; \/\/ 256 MB\n\n  std::vector<char> buffer;\n  buffer.resize(std::min(MAX_CHUNK_SIZE, size) + 10);\n\n  std::vector<std::string> etags;\n\n  size_t partNumber = 0;\n  while(remaining > 0) {\n    size_t toRead = std::min(size, MAX_CHUNK_SIZE);\n    DAVIX_SLOG(DAVIX_LOG_DEBUG, DAVIX_LOG_CHAIN, \"S3IO write: toRead from cb {}\", toRead);\n\n    dav_ssize_t bytesRead = func(buffer.data(), toRead);\n    DAVIX_SLOG(DAVIX_LOG_DEBUG, DAVIX_LOG_CHAIN, \"S3IO write: bytesRead from cb {}\", bytesRead);\n    if(bytesRead < 0) {\n      throw DavixException(davix_scope_io_buff(), StatusCode::InvalidFileHandle, fmt::format(\"Error when reading from callback: {}\", bytesRead));\n    }\n    if(bytesRead == 0) break; \/\/ EOF?\n\n    partNumber++;\n    etags.emplace_back(writeChunk(iocontext, buffer.data(), bytesRead, uploadId, partNumber));\n   }\n\n   commitChunks(iocontext, uploadId, etags);\n}\n\n\n}<|endoftext|>"}
{"text":"<commit_before>\/**************************************************************************\n * Copyright(c) 2004, 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\/** @file    AliFMDBaseDA.cxx\n    @author  Hans Hjersing Dalsgaard <canute@nbi.dk>\n    @date    Wed Mar 26 11:30:45 2008\n    @brief   Base class for detector algorithms.\n*\/\n\/\/\n\/\/This is the implementation of the (virtual) base class for the FMD detector \n\/\/algorithms(DA). It implements the creation of the relevant containers and handles the \n\/\/loop over the raw data. The derived classes can control the parameters and action\n\/\/to be taken making this the base class for the Pedestal, Gain and Physics DA.\n\/\/\n\n#include \"AliFMDBaseDA.h\"\n#include \"iostream\"\n\n#include \"AliFMDRawReader.h\"\n#include \"AliLog.h\"\n\/\/_____________________________________________________________________\nClassImp(AliFMDBaseDA)\n\n\/\/_____________________________________________________________________\nAliFMDBaseDA::AliFMDBaseDA() : TNamed(),\n  fDiagnosticsFilename(\"diagnosticsHistograms.root\"),\n  fOutputFile(),\n  fConditionsFile(),\n  fSaveHistograms(kFALSE),\n  fDetectorArray(),\n  fRequiredEvents(0),\n  fCurrentEvent(0)\n{\n  fDetectorArray.SetOwner();\n  fConditionsFile.open(\"conditions.csv\");\n}\n\/\/_____________________________________________________________________\nAliFMDBaseDA::AliFMDBaseDA(const AliFMDBaseDA & baseDA) : \n  TNamed(baseDA),\n  fDiagnosticsFilename(baseDA.fDiagnosticsFilename),\n  fOutputFile(),\n  fConditionsFile(),\n  fSaveHistograms(baseDA.fSaveHistograms),\n  fDetectorArray(baseDA.fDetectorArray),\n  fRequiredEvents(baseDA.fRequiredEvents),\n  fCurrentEvent(baseDA.fCurrentEvent)\n{\n  fDetectorArray.SetOwner();\n  \n}\n\n\/\/_____________________________________________________________________\nAliFMDBaseDA::~AliFMDBaseDA() {\n\n  \/\/destructor\n  \n}\n\n\/\/_____________________________________________________________________\nvoid AliFMDBaseDA::Run(AliRawReader* reader) {\n  \n  \n  \n  InitContainer();\n\n  Init();\n\n  TFile* diagFile = 0;\n  if(fSaveHistograms)\n    {\n      diagFile = TFile::Open(fDiagnosticsFilename,\"RECREATE\");\n      for(UShort_t det=1;det<=3;det++) {\n\tUShort_t FirstRing = (det == 1 ? 1 : 0);\n\t\n\tfor (UShort_t ir = FirstRing; ir < 2; ir++) {\n\t  Char_t   ring = (ir == 0 ? 'O' : 'I');\n\t  UShort_t nsec = (ir == 0 ? 40  : 20);\n\t  UShort_t nstr = (ir == 0 ? 256 : 512);\n\t  \n\t  gDirectory->cd(Form(\"%s:\/\",fDiagnosticsFilename));\n\t  gDirectory->mkdir(Form(\"FMD%d%c\",det,ring),Form(\"FMD%d%c\",det,ring));\n\t  for(UShort_t sec =0; sec < nsec;  sec++)  {\n\t    gDirectory->cd(Form(\"%s:\/FMD%d%c\",fDiagnosticsFilename,det,ring));\n\t    gDirectory->mkdir(Form(\"sector_%d\",sec));\n\t    for(UShort_t strip = 0; strip < nstr; strip++) {\n\t      gDirectory->cd(Form(\"%s:\/FMD%d%c\/sector_%d\",fDiagnosticsFilename,det,ring,sec));\n\t      gDirectory->mkdir(Form(\"strip_%d\",strip));\n\t      \n\t     }\n\t  }\n\t}\n      }\n      \n    }\n    \n  reader->Reset();\n  \n  \n  \n  AliFMDRawReader* fmdReader = new AliFMDRawReader(reader,0);\n  TClonesArray* digitArray   = new TClonesArray(\"AliFMDDigit\",0);\n  \n  WriteConditionsData();\n  \n  reader->NextEvent();\n  reader->NextEvent();\n  \n  \n  for(Int_t n =1;n <= GetRequiredEvents(); n++)\n    {\n      if(!reader->NextEvent()) \n\tcontinue;\n      \n      SetCurrentEvent(*(reader->GetEventId()));\n      \n      digitArray->Clear();\n      fmdReader->ReadAdcs(digitArray);\n      \n      \n      \/\/std::cout<<\"In event # \"<< *(reader->GetEventId()) << \" with \" <<digitArray->GetEntries()<<\" digits     \\r\"<<std::flush;\n      \n      \n      for(Int_t i = 0; i<digitArray->GetEntries();i++) {\n\tAliFMDDigit* digit = static_cast<AliFMDDigit*>(digitArray->At(i));\n\tFillChannels(digit);\n      }\n      \n      FinishEvent();\n      \n    }\n  AliInfo(Form(\"Looped over %d events\",GetCurrentEvent()));\n  WriteHeaderToFile();\n  \n  for(UShort_t det=1;det<=3;det++) {\n    UShort_t FirstRing = (det == 1 ? 1 : 0);\n    for (UShort_t ir = FirstRing; ir < 2; ir++) {\n      Char_t   ring = (ir == 0 ? 'O' : 'I');\n      UShort_t nsec = (ir == 0 ? 40  : 20);\n      UShort_t nstr = (ir == 0 ? 256 : 512);\n      for(UShort_t sec =0; sec < nsec;  sec++)  {\n  \tfor(UShort_t strip = 0; strip < nstr; strip++) {\n\t  Analyse(det,ring,sec,strip);\n\t  \n  \t}\n      }\n    }\n  }\n\n  if(fOutputFile.is_open()) {\n    \n    fOutputFile.write(\"# EOF\\n\",6);\n    fOutputFile.close();\n    \n  }\n  \n  if(fSaveHistograms ) {\n    AliInfo(\"Closing diagnostics file...please wait\");\n    diagFile->Close();\n  }\n}\n\/\/_____________________________________________________________________\n\nvoid AliFMDBaseDA::InitContainer(){\n\n  TObjArray* detArray;\n  TObjArray* ringArray;\n  TObjArray* sectorArray;\n    \n  for(UShort_t det=1;det<=3;det++) {\n    detArray = new TObjArray();\n    detArray->SetOwner();\n    fDetectorArray.AddAtAndExpand(detArray,det);\n    UShort_t FirstRing = (det == 1 ? 1 : 0);\n    for (UShort_t ir = FirstRing; ir < 2; ir++) {\n      Char_t   ring = (ir == 0 ? 'O' : 'I');\n      UShort_t nsec = (ir == 0 ? 40  : 20);\n      UShort_t nstr = (ir == 0 ? 256 : 512);\n      ringArray = new TObjArray();\n      ringArray->SetOwner();\n      detArray->AddAtAndExpand(ringArray,ir);\n      for(UShort_t sec =0; sec < nsec;  sec++)  {\n\tsectorArray = new TObjArray();\n\tsectorArray->SetOwner();\n\tringArray->AddAtAndExpand(sectorArray,sec);\n\tfor(UShort_t strip = 0; strip < nstr; strip++) {\n\t  AddChannelContainer(sectorArray, det, ring, sec, strip);\n\t}\n      }\n    }\n  }\n}\n\n\/\/_____________________________________________________________________ \nvoid AliFMDBaseDA::WriteConditionsData() {\n  \n  AliFMDParameters* pars       = AliFMDParameters::Instance();\n  fConditionsFile.write(Form(\"# %s \\n\",pars->GetConditionsShuttleID()),14);\n  fConditionsFile.write(\"# Sample Rate, timebins \\n\",25);\n  \n  UInt_t sampleRate = 4;\n  UInt_t timebins   = 544;\n  fConditionsFile     << sampleRate   << ',' \n\t\t      << timebins     <<\"\\n\";\n  \/\/if(fConditionsFile.is_open()) {\n  \/\/  \n  \/\/  fConditionsFile.write(\"# EOF\\n\",6);\n  \/\/  fConditionsFile.close();\n    \n  \/\/}\n  \n}\n\n\/\/_____________________________________________________________________ \n\/\/\n\/\/ EOF\n\/\/\n<commit_msg>New version to reduce printouts and to comply with the static linking required for the DA RPMs<commit_after>\/**************************************************************************\n * Copyright(c) 2004, 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\/** @file    AliFMDBaseDA.cxx\n    @author  Hans Hjersing Dalsgaard <canute@nbi.dk>\n    @date    Wed Mar 26 11:30:45 2008\n    @brief   Base class for detector algorithms.\n*\/\n\/\/\n\/\/This is the implementation of the (virtual) base class for the FMD detector \n\/\/algorithms(DA). It implements the creation of the relevant containers and handles the \n\/\/loop over the raw data. The derived classes can control the parameters and action\n\/\/to be taken making this the base class for the Pedestal, Gain and Physics DA.\n\/\/\n\n#include \"AliFMDBaseDA.h\"\n#include \"iostream\"\n\n#include \"AliFMDRawReader.h\"\n#include \"AliLog.h\"\n\/\/_____________________________________________________________________\nClassImp(AliFMDBaseDA)\n\n\/\/_____________________________________________________________________\nAliFMDBaseDA::AliFMDBaseDA() : TNamed(),\n  fDiagnosticsFilename(\"diagnosticsHistograms.root\"),\n  fOutputFile(),\n  fConditionsFile(),\n  fSaveHistograms(kFALSE),\n  fDetectorArray(),\n  fRequiredEvents(0),\n  fCurrentEvent(0)\n{\n  fDetectorArray.SetOwner();\n  fConditionsFile.open(\"conditions.csv\");\n}\n\/\/_____________________________________________________________________\nAliFMDBaseDA::AliFMDBaseDA(const AliFMDBaseDA & baseDA) : \n  TNamed(baseDA),\n  fDiagnosticsFilename(baseDA.fDiagnosticsFilename),\n  fOutputFile(),\n  fConditionsFile(),\n  fSaveHistograms(baseDA.fSaveHistograms),\n  fDetectorArray(baseDA.fDetectorArray),\n  fRequiredEvents(baseDA.fRequiredEvents),\n  fCurrentEvent(baseDA.fCurrentEvent)\n{\n  fDetectorArray.SetOwner();\n  \n}\n\n\n\/\/_____________________________________________________________________\nAliFMDBaseDA::~AliFMDBaseDA() {\n\n  \/\/destructor\n  \n}\n\n\/\/_____________________________________________________________________\nvoid AliFMDBaseDA::Run(AliRawReader* reader) {\n  \n  \n  \n  InitContainer();\n\n  Init();\n\n  TFile* diagFile = 0;\n  if(fSaveHistograms)\n    {\n      diagFile = TFile::Open(fDiagnosticsFilename,\"RECREATE\");\n      for(UShort_t det=1;det<=3;det++) {\n\tUShort_t FirstRing = (det == 1 ? 1 : 0);\n\t\n\tfor (UShort_t ir = FirstRing; ir < 2; ir++) {\n\t  Char_t   ring = (ir == 0 ? 'O' : 'I');\n\t  UShort_t nsec = (ir == 0 ? 40  : 20);\n\t  UShort_t nstr = (ir == 0 ? 256 : 512);\n\t  \n\t  gDirectory->cd(Form(\"%s:\/\",fDiagnosticsFilename));\n\t  gDirectory->mkdir(Form(\"FMD%d%c\",det,ring),Form(\"FMD%d%c\",det,ring));\n\t  for(UShort_t sec =0; sec < nsec;  sec++)  {\n\t    gDirectory->cd(Form(\"%s:\/FMD%d%c\",fDiagnosticsFilename,det,ring));\n\t    gDirectory->mkdir(Form(\"sector_%d\",sec));\n\t    for(UShort_t strip = 0; strip < nstr; strip++) {\n\t      gDirectory->cd(Form(\"%s:\/FMD%d%c\/sector_%d\",fDiagnosticsFilename,det,ring,sec));\n\t      gDirectory->mkdir(Form(\"strip_%d\",strip));\n\t      \n\t     }\n\t  }\n\t}\n      }\n      \n    }\n    \n  reader->Reset();\n  \n  \n  \n  AliFMDRawReader* fmdReader = new AliFMDRawReader(reader,0);\n  TClonesArray* digitArray   = new TClonesArray(\"AliFMDDigit\",0);\n  \n  WriteConditionsData();\n  \n  reader->NextEvent();\n  reader->NextEvent();\n  \n  \n  for(Int_t n =1;n <= GetRequiredEvents(); n++)\n    {\n      if(!reader->NextEvent()) \n\tcontinue;\n      \n      SetCurrentEvent(*(reader->GetEventId()));\n      \n      digitArray->Clear();\n      fmdReader->ReadAdcs(digitArray);\n      \n      \n      \/\/std::cout<<\"In event # \"<< *(reader->GetEventId()) << \" with \" <<digitArray->GetEntries()<<\" digits     \\r\"<<std::flush;\n      \n      \n      for(Int_t i = 0; i<digitArray->GetEntries();i++) {\n\tAliFMDDigit* digit = static_cast<AliFMDDigit*>(digitArray->At(i));\n\tFillChannels(digit);\n      }\n      \n      FinishEvent();\n      \n    }\n  AliInfo(Form(\"Looped over %d events\",GetCurrentEvent()));\n  WriteHeaderToFile();\n  \n  for(UShort_t det=1;det<=3;det++) {\n    UShort_t FirstRing = (det == 1 ? 1 : 0);\n    for (UShort_t ir = FirstRing; ir < 2; ir++) {\n      Char_t   ring = (ir == 0 ? 'O' : 'I');\n      UShort_t nsec = (ir == 0 ? 40  : 20);\n      UShort_t nstr = (ir == 0 ? 256 : 512);\n      for(UShort_t sec =0; sec < nsec;  sec++)  {\n  \tfor(UShort_t strip = 0; strip < nstr; strip++) {\n\t  Analyse(det,ring,sec,strip);\n\t  \n  \t}\n      }\n    }\n  }\n\n  if(fOutputFile.is_open()) {\n    \n    fOutputFile.write(\"# EOF\\n\",6);\n    fOutputFile.close();\n    \n  }\n  \n  if(fSaveHistograms ) {\n    AliInfo(\"Closing diagnostics file...please wait\");\n    diagFile->Close();\n  }\n}\n\/\/_____________________________________________________________________\n\nvoid AliFMDBaseDA::InitContainer(){\n\n  TObjArray* detArray;\n  TObjArray* ringArray;\n  TObjArray* sectorArray;\n    \n  for(UShort_t det=1;det<=3;det++) {\n    detArray = new TObjArray();\n    detArray->SetOwner();\n    fDetectorArray.AddAtAndExpand(detArray,det);\n    UShort_t FirstRing = (det == 1 ? 1 : 0);\n    for (UShort_t ir = FirstRing; ir < 2; ir++) {\n      Char_t   ring = (ir == 0 ? 'O' : 'I');\n      UShort_t nsec = (ir == 0 ? 40  : 20);\n      UShort_t nstr = (ir == 0 ? 256 : 512);\n      ringArray = new TObjArray();\n      ringArray->SetOwner();\n      detArray->AddAtAndExpand(ringArray,ir);\n      for(UShort_t sec =0; sec < nsec;  sec++)  {\n\tsectorArray = new TObjArray();\n\tsectorArray->SetOwner();\n\tringArray->AddAtAndExpand(sectorArray,sec);\n\tfor(UShort_t strip = 0; strip < nstr; strip++) {\n\t  AddChannelContainer(sectorArray, det, ring, sec, strip);\n\t}\n      }\n    }\n  }\n}\n\n\/\/_____________________________________________________________________ \nvoid AliFMDBaseDA::WriteConditionsData() {\n  \n  AliFMDParameters* pars       = AliFMDParameters::Instance();\n  fConditionsFile.write(Form(\"# %s \\n\",pars->GetConditionsShuttleID()),14);\n  fConditionsFile.write(\"# Sample Rate, timebins \\n\",25);\n  \n  UInt_t sampleRate = 4;\n  UInt_t timebins   = 544;\n  fConditionsFile     << sampleRate   << ',' \n\t\t      << timebins     <<\"\\n\";\n  \/\/if(fConditionsFile.is_open()) {\n  \/\/  \n  \/\/  fConditionsFile.write(\"# EOF\\n\",6);\n  \/\/  fConditionsFile.close();\n    \n  \/\/}\n  \n}\n\n\/\/_____________________________________________________________________ \n\/\/\n\/\/ EOF\n\/\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"CylinderShapeEditor.hpp\"\n\n#include <Engine\/Component\/Shape.hpp>\n#include <Engine\/Manager\/Managers.hpp>\n#include <Engine\/Manager\/PhysicsManager.hpp>\n#include <Engine\/Physics\/Shape.hpp>\n#include <imgui.h>\n\nnamespace GUI {\n    void CylinderShapeEditor::Show(Component::Shape* comp) {\n        ImGui::Indent();\n\n        if (ImGui::InputFloat(\"Radius\", &radius))\n            Apply(comp);\n\n        if (ImGui::InputFloat(\"Length\", &length))\n            Apply(comp);\n\n        ImGui::Unindent();\n    }\n\n    void CylinderShapeEditor::Apply(Component::Shape* comp) {\n        Managers().physicsManager->SetShape(comp, std::shared_ptr<Physics::Shape>(new Physics::Shape(Physics::Shape::Cylinder(radius, length))));\n    }\n\n    bool CylinderShapeEditor::SetFromShape(const Physics::Shape& shape) {\n        if (shape.GetKind() == Physics::Shape::Kind::Cylinder) {\n            auto cylinderData = shape.GetCylinderData();\n            radius = cylinderData->radius;\n            length = cylinderData->length;\n            return true;\n        }\n\n        return false;\n    }\n}\n<commit_msg>Prevent negative cylinder values<commit_after>#include \"CylinderShapeEditor.hpp\"\n\n#include <Engine\/Component\/Shape.hpp>\n#include <Engine\/Manager\/Managers.hpp>\n#include <Engine\/Manager\/PhysicsManager.hpp>\n#include <Engine\/Physics\/Shape.hpp>\n#include <imgui.h>\n\nnamespace GUI {\n    void CylinderShapeEditor::Show(Component::Shape* comp) {\n        ImGui::Indent();\n\n        if (ImGui::InputFloat(\"Radius\", &radius)) {\n            if (radius < 0.0f)\n                radius = 0.0f;\n            \n            Apply(comp);\n        }\n\n        if (ImGui::InputFloat(\"Length\", &length)) {\n            if (length < 0.0f)\n                length = 0.0f;\n            \n            Apply(comp);\n        }\n\n        ImGui::Unindent();\n    }\n\n    void CylinderShapeEditor::Apply(Component::Shape* comp) {\n        Managers().physicsManager->SetShape(comp, std::shared_ptr<Physics::Shape>(new Physics::Shape(Physics::Shape::Cylinder(radius, length))));\n    }\n\n    bool CylinderShapeEditor::SetFromShape(const Physics::Shape& shape) {\n        if (shape.GetKind() == Physics::Shape::Kind::Cylinder) {\n            auto cylinderData = shape.GetCylinderData();\n            radius = cylinderData->radius;\n            length = cylinderData->length;\n            return true;\n        }\n\n        return false;\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    RawSpeed - RAW file decoder.\n\n    Copyright (C) 2009-2014 Klaus Post\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 \"common\/TableLookUp.h\"\n#include \"decoders\/RawDecoderException.h\" \/\/ for RawDecoderException (ptr o...\n#include <cassert>                        \/\/ for assert\n\nnamespace rawspeed {\n\nconst int TABLE_SIZE = 65536 * 2;\n\n\/\/ Creates n numre of tables.\nTableLookUp::TableLookUp(int _ntables, bool _dither)\n    : ntables(_ntables), dither(_dither) {\n  if (ntables < 1) {\n    ThrowRDE(\"Cannot construct 0 tables\");\n  }\n  tables.resize(ntables * TABLE_SIZE, ushort16(0));\n}\n\nvoid TableLookUp::setTable(int ntable, const std::vector<ushort16>& table) {\n  assert(!table.empty());\n\n  const int nfilled = table.size();\n  if (nfilled >= 65536)\n    ThrowRDE(\"Table lookup with %i entries is unsupported\", nfilled);\n\n  if (ntable > ntables) {\n    ThrowRDE(\"Table lookup with number greater than number of tables.\");\n  }\n  ushort16* t = &tables[ntable * TABLE_SIZE];\n  if (!dither) {\n    for (int i = 0; i < 65536; i++) {\n      t[i] = (i < nfilled) ? table[i] : table[nfilled - 1];\n    }\n    return;\n  }\n  for (int i = 0; i < nfilled; i++) {\n    int center = table[i];\n    int lower = i > 0 ? table[i - 1] : center;\n    int upper = i < (nfilled - 1) ? table[i + 1] : center;\n    int delta = upper - lower;\n    t[i * 2] = center - ((upper - lower + 2) \/ 4);\n    t[i * 2 + 1] = delta;\n  }\n\n  for (int i = nfilled; i < 65536; i++) {\n    t[i * 2] = table[nfilled - 1];\n    t[i * 2 + 1] = 0;\n  }\n  t[0] = t[1];\n  t[TABLE_SIZE - 1] = t[TABLE_SIZE - 2];\n}\n\nushort16* TableLookUp::getTable(int n) {\n  if (n > ntables) {\n    ThrowRDE(\"Table lookup with number greater than number of tables.\");\n  }\n  return &tables[n * TABLE_SIZE];\n}\n\n} \/\/ namespace rawspeed\n<commit_msg>TableLookUp::setTable(): fix completely broken calculation of 'middle'<commit_after>\/*\n    RawSpeed - RAW file decoder.\n\n    Copyright (C) 2009-2014 Klaus Post\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 \"common\/TableLookUp.h\"\n#include \"decoders\/RawDecoderException.h\" \/\/ for RawDecoderException (ptr o...\n#include <cassert>                        \/\/ for assert\n\nnamespace rawspeed {\n\nconst int TABLE_SIZE = 65536 * 2;\n\n\/\/ Creates n numre of tables.\nTableLookUp::TableLookUp(int _ntables, bool _dither)\n    : ntables(_ntables), dither(_dither) {\n  if (ntables < 1) {\n    ThrowRDE(\"Cannot construct 0 tables\");\n  }\n  tables.resize(ntables * TABLE_SIZE, ushort16(0));\n}\n\nvoid TableLookUp::setTable(int ntable, const std::vector<ushort16>& table) {\n  assert(!table.empty());\n\n  const int nfilled = table.size();\n  if (nfilled >= 65536)\n    ThrowRDE(\"Table lookup with %i entries is unsupported\", nfilled);\n\n  if (ntable > ntables) {\n    ThrowRDE(\"Table lookup with number greater than number of tables.\");\n  }\n  ushort16* t = &tables[ntable * TABLE_SIZE];\n  if (!dither) {\n    for (int i = 0; i < 65536; i++) {\n      t[i] = (i < nfilled) ? table[i] : table[nfilled - 1];\n    }\n    return;\n  }\n  for (int i = 0; i < nfilled; i++) {\n    int center = table[i];\n    int lower = i > 0 ? table[i - 1] : center;\n    int upper = i < (nfilled - 1) ? table[i + 1] : center;\n    int delta = upper - lower;\n    t[i * 2] = clampBits(center - ((upper - lower + 2) \/ 4), 16);\n    t[i * 2 + 1] = delta;\n  }\n\n  for (int i = nfilled; i < 65536; i++) {\n    t[i * 2] = table[nfilled - 1];\n    t[i * 2 + 1] = 0;\n  }\n  t[0] = t[1];\n  t[TABLE_SIZE - 1] = t[TABLE_SIZE - 2];\n}\n\nushort16* TableLookUp::getTable(int n) {\n  if (n > ntables) {\n    ThrowRDE(\"Table lookup with number greater than number of tables.\");\n  }\n  return &tables[n * TABLE_SIZE];\n}\n\n} \/\/ namespace rawspeed\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * PointProbe.cpp\n *\n *  Created on: Mar 10, 2009\n *      Author: rasmussn\n *\/\n\n#include \"PointProbe.hpp\"\n#include <string.h>\n\nnamespace PV {\n\n\/**\n * @filename\n * @xLoc\n * @yLoc\n * @fLoc\n * @msg\n *\/\nPointProbe::PointProbe(const char * filename, int xLoc, int yLoc, int fLoc, const char * msg)\n   : PVLayerProbe(filename)\n{\n   this->xLoc = xLoc;\n   this->yLoc = yLoc;\n   this->fLoc = fLoc;\n   this->msg = strdup(msg);\n}\n\n\/**\n * @xLoc\n * @yLoc\n * @fLoc\n * @msg\n *\/\nPointProbe::PointProbe(int xLoc, int yLoc, int fLoc, const char * msg)\n   : PVLayerProbe()\n{\n   this->xLoc = xLoc;\n   this->yLoc = yLoc;\n   this->fLoc = fLoc;\n   this->msg = strdup(msg);\n}\n\nPointProbe::~PointProbe()\n{\n   free(msg);\n}\n\n\/**\n * @time\n * @l\n *\/\nint PointProbe::outputState(float time, PVLayer * l)\n{\n   int nf = l->numFeatures;\n   int sf = 1;\n   int sx = nf;\n   int sy = nf * l->loc.nx;\n   int offset = yLoc * sy + xLoc * sx + fLoc * sf;\n\n   fprintf(fp, \"%s t=%6.1f\", msg, time);\n   fprintf(fp, \" G_E=%6.3f\", l->G_E[offset]);\n   fprintf(fp, \" G_I=%6.3f\", l->G_I[offset]);\n   fprintf(fp, \" V=%6.3f\", l->V[offset]);\n   fprintf(fp, \" Vth=%6.3f\", l->Vth[offset]);\n   fprintf(fp, \" a=%3.1f\\n\", l->activity->data[offset]);\n\n   fflush(fp);\n\n   return 0;\n}\n\n} \/\/ namespace PV\n<commit_msg>Updated to extended activity region.<commit_after>\/*\n * PointProbe.cpp\n *\n *  Created on: Mar 10, 2009\n *      Author: rasmussn\n *\/\n\n#include \"PointProbe.hpp\"\n#include <string.h>\n\nnamespace PV {\n\n\/**\n * @filename\n * @xLoc\n * @yLoc\n * @fLoc\n * @msg\n *\/\nPointProbe::PointProbe(const char * filename, int xLoc, int yLoc, int fLoc, const char * msg)\n   : PVLayerProbe(filename)\n{\n   this->xLoc = xLoc;\n   this->yLoc = yLoc;\n   this->fLoc = fLoc;\n   this->msg = strdup(msg);\n}\n\n\/**\n * @xLoc\n * @yLoc\n * @fLoc\n * @msg\n *\/\nPointProbe::PointProbe(int xLoc, int yLoc, int fLoc, const char * msg)\n   : PVLayerProbe()\n{\n   this->xLoc = xLoc;\n   this->yLoc = yLoc;\n   this->fLoc = fLoc;\n   this->msg = strdup(msg);\n}\n\nPointProbe::~PointProbe()\n{\n   free(msg);\n}\n\n\/**\n * @time\n * @l\n *\/\nint PointProbe::outputState(float time, PVLayer * l)\n{\n   int nf = l->numFeatures;\n   int sf = 1;\n   int sx = nf;\n   int sy = nf * (l->loc.nx + 2*l->loc.nPad);\n   int offset = yLoc * sy + xLoc * sx + fLoc * sf;\n\n   fprintf(fp, \"%s t=%6.1f\", msg, time);\n   fprintf(fp, \" G_E=%6.3f\", l->G_E[offset]);\n   fprintf(fp, \" G_I=%6.3f\", l->G_I[offset]);\n   fprintf(fp, \" V=%6.3f\", l->V[offset]);\n   fprintf(fp, \" Vth=%6.3f\", l->Vth[offset]);\n   fprintf(fp, \" a=%3.1f\\n\", l->activity->data[offset]);\n\n   fflush(fp);\n\n   return 0;\n}\n\n} \/\/ namespace PV\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * This istream filter catches fatal errors and attempts to ignore\n * them.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"istream_catch.hxx\"\n#include \"istream_internal.hxx\"\n#include \"istream_forward.hxx\"\n#include \"util\/Cast.hxx\"\n\n#include <daemon\/log.h>\n\n#include <assert.h>\n\nstruct istream_catch {\n    struct istream output;\n    struct istream *input;\n    off_t available;\n\n    GError *(*callback)(GError *error, void *ctx);\n    void *callback_ctx;\n};\n\nstatic constexpr char space[] =\n    \"                                \"\n    \"                                \"\n    \"                                \"\n    \"                                \";\n\nstatic void\ncatch_send_whitespace(struct istream_catch *c)\n{\n    size_t length, nbytes;\n\n    assert(c->input == nullptr);\n    assert(c->available > 0);\n\n    do {\n        if (c->available >= (off_t)sizeof(space) - 1)\n            length = sizeof(space) - 1;\n        else\n            length = (size_t)c->available;\n\n        nbytes = istream_invoke_data(&c->output, space, length);\n        if (nbytes == 0)\n            return;\n\n        c->available -= nbytes;\n        if (nbytes < length)\n            return;\n    } while (c->available > 0);\n\n    istream_deinit_eof(&c->output);\n}\n\n\n\/*\n * istream handler\n *\n *\/\n\nstatic size_t\ncatch_input_data(const void *data, size_t length, void *ctx)\n{\n    auto *c = (struct istream_catch *)ctx;\n\n    size_t nbytes = istream_invoke_data(&c->output, data, length);\n    if (nbytes > 0) {\n        if ((off_t)nbytes < c->available)\n            c->available -= (off_t)nbytes;\n        else\n            c->available = 0;\n    }\n\n    return nbytes;\n}\n\nstatic ssize_t\ncatch_input_direct(enum istream_direct type, int fd, size_t max_length,\n                   void *ctx)\n{\n    auto *c = (struct istream_catch *)ctx;\n\n    ssize_t nbytes = istream_invoke_direct(&c->output, type, fd, max_length);\n    if (nbytes > 0) {\n        if ((off_t)nbytes < c->available)\n            c->available -= (off_t)nbytes;\n        else\n            c->available = 0;\n    }\n\n    return nbytes;\n}\n\nstatic void\ncatch_input_abort(GError *error, void *ctx)\n{\n    auto *c = (struct istream_catch *)ctx;\n\n    error = c->callback(error, c->callback_ctx);\n    if (error != nullptr) {\n        \/* forward error to our handler *\/\n        istream_deinit_abort(&c->output, error);\n        return;\n    }\n\n    \/* the error has been handled by the callback, and he has disposed\n       it *\/\n\n    c->input = nullptr;\n\n    if (c->available > 0) {\n        \/* according to a previous call to method \"available\", there\n           is more data which we must provide - fill that with space\n           characters *\/\n        c->input = nullptr;\n        catch_send_whitespace(c);\n    } else\n        istream_deinit_eof(&c->output);\n}\n\nstatic const struct istream_handler catch_input_handler = {\n    .data = catch_input_data,\n    .direct = catch_input_direct,\n    .eof = istream_forward_eof,\n    .abort = catch_input_abort,\n};\n\n\n\/*\n * istream implementation\n *\n *\/\n\nstatic inline struct istream_catch *\nistream_to_catch(struct istream *istream)\n{\n    return &ContainerCast2(*istream, &istream_catch::output);\n}\n\nstatic off_t\nistream_catch_available(struct istream *istream, bool partial)\n{\n    struct istream_catch *c = istream_to_catch(istream);\n\n    if (c->input != nullptr) {\n        off_t available = istream_available(c->input, partial);\n        if (available != (off_t)-1 && available > c->available)\n            c->available = available;\n\n        return available;\n    } else\n        return c->available;\n}\n\nstatic void\nistream_catch_read(struct istream *istream)\n{\n    struct istream_catch *c = istream_to_catch(istream);\n\n    if (c->input != nullptr) {\n        istream_handler_set_direct(c->input, c->output.handler_direct);\n        istream_read(c->input);\n    } else\n        catch_send_whitespace(c);\n}\n\nstatic void\nistream_catch_close(struct istream *istream)\n{\n    struct istream_catch *c = istream_to_catch(istream);\n\n    if (c->input != nullptr)\n        istream_free_handler(&c->input);\n\n    istream_deinit(&c->output);\n}\n\nstatic const struct istream_class istream_catch = {\n    .available = istream_catch_available,\n    .read = istream_catch_read,\n    .close = istream_catch_close,\n};\n\n\n\/*\n * constructor\n *\n *\/\n\nstruct istream *\nistream_catch_new(struct pool *pool, struct istream *input,\n                  GError *(*callback)(GError *error, void *ctx), void *ctx)\n{\n    assert(input != nullptr);\n    assert(!istream_has_handler(input));\n    assert(callback != nullptr);\n\n    auto *c = NewFromPool<struct istream_catch>(*pool);\n    istream_init(&c->output, &istream_catch, pool);\n\n    istream_assign_handler(&c->input, input,\n                           &catch_input_handler, c,\n                           0);\n    c->available = 0;\n    c->callback = callback;\n    c->callback_ctx = ctx;\n\n    return &c->output;\n}\n<commit_msg>istream_catch: rename the struct with CamelCase<commit_after>\/*\n * This istream filter catches fatal errors and attempts to ignore\n * them.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"istream_catch.hxx\"\n#include \"istream_internal.hxx\"\n#include \"istream_forward.hxx\"\n#include \"util\/Cast.hxx\"\n\n#include <daemon\/log.h>\n\n#include <assert.h>\n\nstruct CatchIstream {\n    struct istream output;\n    struct istream *input;\n    off_t available;\n\n    GError *(*callback)(GError *error, void *ctx);\n    void *callback_ctx;\n};\n\nstatic constexpr char space[] =\n    \"                                \"\n    \"                                \"\n    \"                                \"\n    \"                                \";\n\nstatic void\ncatch_send_whitespace(CatchIstream *c)\n{\n    size_t length, nbytes;\n\n    assert(c->input == nullptr);\n    assert(c->available > 0);\n\n    do {\n        if (c->available >= (off_t)sizeof(space) - 1)\n            length = sizeof(space) - 1;\n        else\n            length = (size_t)c->available;\n\n        nbytes = istream_invoke_data(&c->output, space, length);\n        if (nbytes == 0)\n            return;\n\n        c->available -= nbytes;\n        if (nbytes < length)\n            return;\n    } while (c->available > 0);\n\n    istream_deinit_eof(&c->output);\n}\n\n\n\/*\n * istream handler\n *\n *\/\n\nstatic size_t\ncatch_input_data(const void *data, size_t length, void *ctx)\n{\n    auto *c = (CatchIstream *)ctx;\n\n    size_t nbytes = istream_invoke_data(&c->output, data, length);\n    if (nbytes > 0) {\n        if ((off_t)nbytes < c->available)\n            c->available -= (off_t)nbytes;\n        else\n            c->available = 0;\n    }\n\n    return nbytes;\n}\n\nstatic ssize_t\ncatch_input_direct(enum istream_direct type, int fd, size_t max_length,\n                   void *ctx)\n{\n    auto *c = (CatchIstream *)ctx;\n\n    ssize_t nbytes = istream_invoke_direct(&c->output, type, fd, max_length);\n    if (nbytes > 0) {\n        if ((off_t)nbytes < c->available)\n            c->available -= (off_t)nbytes;\n        else\n            c->available = 0;\n    }\n\n    return nbytes;\n}\n\nstatic void\ncatch_input_abort(GError *error, void *ctx)\n{\n    auto *c = (CatchIstream *)ctx;\n\n    error = c->callback(error, c->callback_ctx);\n    if (error != nullptr) {\n        \/* forward error to our handler *\/\n        istream_deinit_abort(&c->output, error);\n        return;\n    }\n\n    \/* the error has been handled by the callback, and he has disposed\n       it *\/\n\n    c->input = nullptr;\n\n    if (c->available > 0) {\n        \/* according to a previous call to method \"available\", there\n           is more data which we must provide - fill that with space\n           characters *\/\n        c->input = nullptr;\n        catch_send_whitespace(c);\n    } else\n        istream_deinit_eof(&c->output);\n}\n\nstatic const struct istream_handler catch_input_handler = {\n    .data = catch_input_data,\n    .direct = catch_input_direct,\n    .eof = istream_forward_eof,\n    .abort = catch_input_abort,\n};\n\n\n\/*\n * istream implementation\n *\n *\/\n\nstatic inline CatchIstream *\nistream_to_catch(struct istream *istream)\n{\n    return &ContainerCast2(*istream, &CatchIstream::output);\n}\n\nstatic off_t\nistream_catch_available(struct istream *istream, bool partial)\n{\n    CatchIstream *c = istream_to_catch(istream);\n\n    if (c->input != nullptr) {\n        off_t available = istream_available(c->input, partial);\n        if (available != (off_t)-1 && available > c->available)\n            c->available = available;\n\n        return available;\n    } else\n        return c->available;\n}\n\nstatic void\nistream_catch_read(struct istream *istream)\n{\n    CatchIstream *c = istream_to_catch(istream);\n\n    if (c->input != nullptr) {\n        istream_handler_set_direct(c->input, c->output.handler_direct);\n        istream_read(c->input);\n    } else\n        catch_send_whitespace(c);\n}\n\nstatic void\nistream_catch_close(struct istream *istream)\n{\n    CatchIstream *c = istream_to_catch(istream);\n\n    if (c->input != nullptr)\n        istream_free_handler(&c->input);\n\n    istream_deinit(&c->output);\n}\n\nstatic const struct istream_class istream_catch = {\n    .available = istream_catch_available,\n    .read = istream_catch_read,\n    .close = istream_catch_close,\n};\n\n\n\/*\n * constructor\n *\n *\/\n\nstruct istream *\nistream_catch_new(struct pool *pool, struct istream *input,\n                  GError *(*callback)(GError *error, void *ctx), void *ctx)\n{\n    assert(input != nullptr);\n    assert(!istream_has_handler(input));\n    assert(callback != nullptr);\n\n    auto *c = NewFromPool<CatchIstream>(*pool);\n    istream_init(&c->output, &istream_catch, pool);\n\n    istream_assign_handler(&c->input, input,\n                           &catch_input_handler, c,\n                           0);\n    c->available = 0;\n    c->callback = callback;\n    c->callback_ctx = ctx;\n\n    return &c->output;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * This istream filter catches fatal errors and attempts to ignore\n * them.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"istream_catch.hxx\"\n#include \"istream_internal.hxx\"\n#include \"istream_forward.hxx\"\n#include \"util\/Cast.hxx\"\n\n#include <daemon\/log.h>\n\n#include <assert.h>\n\nstruct istream_catch {\n    struct istream output;\n    struct istream *input;\n    off_t available;\n\n    GError *(*callback)(GError *error, void *ctx);\n    void *callback_ctx;\n};\n\nstatic constexpr char space[] =\n    \"                                \"\n    \"                                \"\n    \"                                \"\n    \"                                \";\n\nstatic void\ncatch_send_whitespace(struct istream_catch *c)\n{\n    size_t length, nbytes;\n\n    assert(c->input == nullptr);\n    assert(c->available > 0);\n\n    do {\n        if (c->available >= (off_t)sizeof(space) - 1)\n            length = sizeof(space) - 1;\n        else\n            length = (size_t)c->available;\n\n        nbytes = istream_invoke_data(&c->output, space, length);\n        if (nbytes == 0)\n            return;\n\n        c->available -= nbytes;\n        if (nbytes < length)\n            return;\n    } while (c->available > 0);\n\n    istream_deinit_eof(&c->output);\n}\n\n\n\/*\n * istream handler\n *\n *\/\n\nstatic size_t\ncatch_input_data(const void *data, size_t length, void *ctx)\n{\n    auto *c = (struct istream_catch *)ctx;\n\n    size_t nbytes = istream_invoke_data(&c->output, data, length);\n    if (nbytes > 0) {\n        if ((off_t)nbytes < c->available)\n            c->available -= (off_t)nbytes;\n        else\n            c->available = 0;\n    }\n\n    return nbytes;\n}\n\nstatic ssize_t\ncatch_input_direct(enum istream_direct type, int fd, size_t max_length,\n                   void *ctx)\n{\n    auto *c = (struct istream_catch *)ctx;\n\n    ssize_t nbytes = istream_invoke_direct(&c->output, type, fd, max_length);\n    if (nbytes > 0) {\n        if ((off_t)nbytes < c->available)\n            c->available -= (off_t)nbytes;\n        else\n            c->available = 0;\n    }\n\n    return nbytes;\n}\n\nstatic void\ncatch_input_abort(GError *error, void *ctx)\n{\n    auto *c = (struct istream_catch *)ctx;\n\n    error = c->callback(error, c->callback_ctx);\n    if (error != nullptr) {\n        \/* forward error to our handler *\/\n        istream_deinit_abort(&c->output, error);\n        return;\n    }\n\n    \/* the error has been handled by the callback, and he has disposed\n       it *\/\n\n    c->input = nullptr;\n\n    if (c->available > 0) {\n        \/* according to a previous call to method \"available\", there\n           is more data which we must provide - fill that with space\n           characters *\/\n        c->input = nullptr;\n        catch_send_whitespace(c);\n    } else\n        istream_deinit_eof(&c->output);\n}\n\nstatic const struct istream_handler catch_input_handler = {\n    .data = catch_input_data,\n    .direct = catch_input_direct,\n    .eof = istream_forward_eof,\n    .abort = catch_input_abort,\n};\n\n\n\/*\n * istream implementation\n *\n *\/\n\nstatic inline struct istream_catch *\nistream_to_catch(struct istream *istream)\n{\n    return &ContainerCast2(*istream, &istream_catch::output);\n}\n\nstatic off_t\nistream_catch_available(struct istream *istream, bool partial)\n{\n    struct istream_catch *c = istream_to_catch(istream);\n\n    if (c->input != nullptr) {\n        off_t available = istream_available(c->input, partial);\n        if (available != (off_t)-1 && available > c->available)\n            c->available = available;\n\n        return available;\n    } else\n        return c->available;\n}\n\nstatic void\nistream_catch_read(struct istream *istream)\n{\n    struct istream_catch *c = istream_to_catch(istream);\n\n    if (c->input != nullptr) {\n        istream_handler_set_direct(c->input, c->output.handler_direct);\n        istream_read(c->input);\n    } else\n        catch_send_whitespace(c);\n}\n\nstatic void\nistream_catch_close(struct istream *istream)\n{\n    struct istream_catch *c = istream_to_catch(istream);\n\n    if (c->input != nullptr)\n        istream_free_handler(&c->input);\n\n    istream_deinit(&c->output);\n}\n\nstatic const struct istream_class istream_catch = {\n    .available = istream_catch_available,\n    .read = istream_catch_read,\n    .close = istream_catch_close,\n};\n\n\n\/*\n * constructor\n *\n *\/\n\nstruct istream *\nistream_catch_new(struct pool *pool, struct istream *input,\n                  GError *(*callback)(GError *error, void *ctx), void *ctx)\n{\n    struct istream_catch *c = istream_new_macro(pool, catch);\n\n    assert(input != nullptr);\n    assert(!istream_has_handler(input));\n    assert(callback != nullptr);\n\n    istream_assign_handler(&c->input, input,\n                           &catch_input_handler, c,\n                           0);\n    c->available = 0;\n    c->callback = callback;\n    c->callback_ctx = ctx;\n\n    return &c->output;\n}\n<commit_msg>istream_catch: use NewFromPool()<commit_after>\/*\n * This istream filter catches fatal errors and attempts to ignore\n * them.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"istream_catch.hxx\"\n#include \"istream_internal.hxx\"\n#include \"istream_forward.hxx\"\n#include \"util\/Cast.hxx\"\n\n#include <daemon\/log.h>\n\n#include <assert.h>\n\nstruct istream_catch {\n    struct istream output;\n    struct istream *input;\n    off_t available;\n\n    GError *(*callback)(GError *error, void *ctx);\n    void *callback_ctx;\n};\n\nstatic constexpr char space[] =\n    \"                                \"\n    \"                                \"\n    \"                                \"\n    \"                                \";\n\nstatic void\ncatch_send_whitespace(struct istream_catch *c)\n{\n    size_t length, nbytes;\n\n    assert(c->input == nullptr);\n    assert(c->available > 0);\n\n    do {\n        if (c->available >= (off_t)sizeof(space) - 1)\n            length = sizeof(space) - 1;\n        else\n            length = (size_t)c->available;\n\n        nbytes = istream_invoke_data(&c->output, space, length);\n        if (nbytes == 0)\n            return;\n\n        c->available -= nbytes;\n        if (nbytes < length)\n            return;\n    } while (c->available > 0);\n\n    istream_deinit_eof(&c->output);\n}\n\n\n\/*\n * istream handler\n *\n *\/\n\nstatic size_t\ncatch_input_data(const void *data, size_t length, void *ctx)\n{\n    auto *c = (struct istream_catch *)ctx;\n\n    size_t nbytes = istream_invoke_data(&c->output, data, length);\n    if (nbytes > 0) {\n        if ((off_t)nbytes < c->available)\n            c->available -= (off_t)nbytes;\n        else\n            c->available = 0;\n    }\n\n    return nbytes;\n}\n\nstatic ssize_t\ncatch_input_direct(enum istream_direct type, int fd, size_t max_length,\n                   void *ctx)\n{\n    auto *c = (struct istream_catch *)ctx;\n\n    ssize_t nbytes = istream_invoke_direct(&c->output, type, fd, max_length);\n    if (nbytes > 0) {\n        if ((off_t)nbytes < c->available)\n            c->available -= (off_t)nbytes;\n        else\n            c->available = 0;\n    }\n\n    return nbytes;\n}\n\nstatic void\ncatch_input_abort(GError *error, void *ctx)\n{\n    auto *c = (struct istream_catch *)ctx;\n\n    error = c->callback(error, c->callback_ctx);\n    if (error != nullptr) {\n        \/* forward error to our handler *\/\n        istream_deinit_abort(&c->output, error);\n        return;\n    }\n\n    \/* the error has been handled by the callback, and he has disposed\n       it *\/\n\n    c->input = nullptr;\n\n    if (c->available > 0) {\n        \/* according to a previous call to method \"available\", there\n           is more data which we must provide - fill that with space\n           characters *\/\n        c->input = nullptr;\n        catch_send_whitespace(c);\n    } else\n        istream_deinit_eof(&c->output);\n}\n\nstatic const struct istream_handler catch_input_handler = {\n    .data = catch_input_data,\n    .direct = catch_input_direct,\n    .eof = istream_forward_eof,\n    .abort = catch_input_abort,\n};\n\n\n\/*\n * istream implementation\n *\n *\/\n\nstatic inline struct istream_catch *\nistream_to_catch(struct istream *istream)\n{\n    return &ContainerCast2(*istream, &istream_catch::output);\n}\n\nstatic off_t\nistream_catch_available(struct istream *istream, bool partial)\n{\n    struct istream_catch *c = istream_to_catch(istream);\n\n    if (c->input != nullptr) {\n        off_t available = istream_available(c->input, partial);\n        if (available != (off_t)-1 && available > c->available)\n            c->available = available;\n\n        return available;\n    } else\n        return c->available;\n}\n\nstatic void\nistream_catch_read(struct istream *istream)\n{\n    struct istream_catch *c = istream_to_catch(istream);\n\n    if (c->input != nullptr) {\n        istream_handler_set_direct(c->input, c->output.handler_direct);\n        istream_read(c->input);\n    } else\n        catch_send_whitespace(c);\n}\n\nstatic void\nistream_catch_close(struct istream *istream)\n{\n    struct istream_catch *c = istream_to_catch(istream);\n\n    if (c->input != nullptr)\n        istream_free_handler(&c->input);\n\n    istream_deinit(&c->output);\n}\n\nstatic const struct istream_class istream_catch = {\n    .available = istream_catch_available,\n    .read = istream_catch_read,\n    .close = istream_catch_close,\n};\n\n\n\/*\n * constructor\n *\n *\/\n\nstruct istream *\nistream_catch_new(struct pool *pool, struct istream *input,\n                  GError *(*callback)(GError *error, void *ctx), void *ctx)\n{\n    assert(input != nullptr);\n    assert(!istream_has_handler(input));\n    assert(callback != nullptr);\n\n    auto *c = NewFromPool<struct istream_catch>(*pool);\n    istream_init(&c->output, &istream_catch, pool);\n\n    istream_assign_handler(&c->input, input,\n                           &catch_input_handler, c,\n                           0);\n    c->available = 0;\n    c->callback = callback;\n    c->callback_ctx = ctx;\n\n    return &c->output;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2015.  All rights reserved\n *\/\n#include    \"..\/StroikaPreComp.h\"\n\n#include    <cstdlib>\n#include    <cstring>\n#include    <ctime>\n\n#if     qPlatform_POSIX\n#include    <time.h>\n#endif\n\n#include    \"..\/Configuration\/Common.h\"\n#include    \"..\/Characters\/String.h\"\n#include    \"..\/Characters\/String_Constant.h\"\n#include    \"..\/Debug\/Assertions.h\"\n#include    \"..\/Debug\/Trace.h\"\n#include    \"DateTime.h\"\n#include    \"..\/IO\/FileSystem\/BinaryFileInputStream.h\"\n#include    \"..\/Streams\/TextInputStreamBinaryAdapter.h\"\n\n#include    \"Timezone.h\"\n\nusing   namespace   Stroika;\nusing   namespace   Stroika::Foundation;\nusing   namespace   Stroika::Foundation::Characters;\nusing   namespace   Stroika::Foundation::Time;\n\n\n\n\n\n\/*\n ********************************************************************************\n ***************************** Time::GetTimezoneInfo ****************************\n ********************************************************************************\n *\/\nTimeZoneInformationType    Time::GetTimezoneInfo ()\n{\n    TimeZoneInformationType result;\n#if     qPlatform_Windows\n    TIME_ZONE_INFORMATION   tzInfo;\n    memset (&tzInfo, 0, sizeof (tzInfo));\n    (void)::GetTimeZoneInformation (&tzInfo);\n    result.fStandardTime.fName = tzInfo.StandardName;\n    result.fDaylightSavingsTime.fName = tzInfo.DaylightName;\n#elif   qPlatform_POSIX\n    try {\n        result.fID = Streams::TextInputStreamBinaryAdapter (IO::FileSystem::BinaryFileInputStream::mk (String_Constant (L\"\/etc\/timezone\"))).ReadAll ().Trim ();\n    }\n    catch (...) {\n        DbgTrace (\"Ignoring missing ID from \/etc\/timezone\");\n    }\n    \/\/ @see http:\/\/pubs.opengroup.org\/onlinepubs\/7908799\/xsh\/tzset.html\n    result.fStandardTime.fName = String::FromSDKString (tzname[0]);\n    result.fDaylightSavingsTime.fName = String::FromSDKString (tzname[1]);\n#else\n    AssertNotImplemented ();\n    return String ();\n#endif\n    return result;\n}\n\n\n\/*\n ********************************************************************************\n ********************************* Time::GetTimezone ****************************\n ********************************************************************************\n *\/\nString    Time::GetTimezone ()\n{\n    return GetTimezone (DateTime::Now ());\n}\n\nString    Time::GetTimezone (bool applyDST)\n{\n#if     qPlatform_Windows\n    TIME_ZONE_INFORMATION   tzInfo;\n    memset (&tzInfo, 0, sizeof (tzInfo));\n    (void)::GetTimeZoneInformation (&tzInfo);\n    return tzInfo.StandardName;\n#elif   qPlatform_POSIX\n    \/\/ @see http:\/\/pubs.opengroup.org\/onlinepubs\/7908799\/xsh\/tzset.html\n    return String::FromSDKString (IsDaylightSavingsTime (DateTime::Now ()) ? tzname[1] : tzname[0]);\n#else\n    AssertNotImplemented ();\n    return String ();\n#endif\n}\n\nString    Time::GetTimezone (const DateTime& d)\n{\n    return GetTimezone (IsDaylightSavingsTime (d));\n}\n\n\n\n\n\n\/*\n ********************************************************************************\n *********************** Time::IsDaylightSavingsTime ****************************\n ********************************************************************************\n *\/\nbool    Time::IsDaylightSavingsTime (const DateTime& d)\n{\n    struct  tm  asTM    =   d.As<struct tm> ();\n    asTM.tm_isdst = -1; \/\/ force calc of correct daylight savings time flag\n    \/\/ THINK this is true - not totally clear - docs on mktime () don't specify unambiguously that this should work...\n    \/\/ So far it seems too however, --LGP 2011-10-15\n    time_t  result  =   mktime (&asTM);\n    return asTM.tm_isdst >= 1;\n}\n\n\n\n\n\n\n\n\/*\n ********************************************************************************\n ********************* Time::GetLocaltimeToGMTOffset ****************************\n ********************************************************************************\n *\/\ntime_t  Time::GetLocaltimeToGMTOffset (bool applyDST)\n{\n#if     0\n    \/\/ WRONG - but COULD use this API - but not sure needed\n#if     qPlatform_Windows\n    TIME_ZONE_INFORMATION   tzInfo;\n    memset (&tzInfo, 0, sizeof (tzInfo));\n    (void)::GetTimeZoneInformation (&tzInfo);\n    int unsignedBias    =   abs (tzInfo.Bias);\n    int hrs =   unsignedBias \/ 60;\n    int mins = unsignedBias - hrs * 60;\n    tzBiasString = ::Format (L\"%s%.2d:%.2d\", (tzInfo.Bias >= 0 ? L\"-\" : L\"+\"), hrs, mins);\n#endif\n#endif\n\n    \/*\n     * COULD this be cached? It SHOULD be - but what about when the timezone changes? there maybe a better way to compute this using the\n     * timezone global var???\n     *\/\n    struct tm tm;\n    memset (&tm, 0, sizeof(tm));\n    tm.tm_year = 70;\n    tm.tm_mon = 0;      \/\/ Jan\n    tm.tm_mday = 1;\n    tm.tm_isdst = applyDST;\n    time_t  result  =   mktime (&tm);\n    return result;\n}\n\ntime_t  Time::GetLocaltimeToGMTOffset (const DateTime& forTime)\n{\n    return GetLocaltimeToGMTOffset (IsDaylightSavingsTime (forTime));\n}<commit_msg>Support on windows returing proper 'olson db id' for timezone<commit_after>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2015.  All rights reserved\n *\/\n#include    \"..\/StroikaPreComp.h\"\n\n#include    <cstdlib>\n#include    <cstring>\n#include    <ctime>\n\n#if     qPlatform_POSIX\n#include    <time.h>\n#endif\n\n#include    \"..\/Configuration\/Common.h\"\n#include    \"..\/Characters\/String.h\"\n#include    \"..\/Characters\/String_Constant.h\"\n#include    \"..\/Containers\/Mapping.h\"\n#include    \"..\/Debug\/Assertions.h\"\n#include    \"..\/Debug\/Trace.h\"\n#include    \"DateTime.h\"\n#include    \"..\/IO\/FileSystem\/BinaryFileInputStream.h\"\n#include    \"..\/Streams\/TextInputStreamBinaryAdapter.h\"\n\n#include    \"Timezone.h\"\n\nusing   namespace   Stroika;\nusing   namespace   Stroika::Foundation;\nusing   namespace   Stroika::Foundation::Characters;\nusing   namespace   Stroika::Foundation::Time;\n\n\n\n\n\n\/*\n ********************************************************************************\n ***************************** Time::GetTimezoneInfo ****************************\n ********************************************************************************\n *\/\nTimeZoneInformationType    Time::GetTimezoneInfo ()\n{\n    TimeZoneInformationType result;\n#if     qPlatform_POSIX\n    try {\n        result.fID = Streams::TextInputStreamBinaryAdapter (IO::FileSystem::BinaryFileInputStream::mk (String_Constant (L\"\/etc\/timezone\"))).ReadAll ().Trim ();\n    }\n    catch (...) {\n        DbgTrace (\"Ignoring missing ID from \/etc\/timezone\");\n    }\n    \/\/ @see http:\/\/pubs.opengroup.org\/onlinepubs\/7908799\/xsh\/tzset.html\n    result.fStandardTime.fName = String::FromSDKString (tzname[0]);\n    result.fDaylightSavingsTime.fName = String::FromSDKString (tzname[1]);\n#elif   qPlatform_Windows\n    using   Containers::Mapping;\n    using   Common::KeyValuePair;\n    static const    Mapping<String, String> kWinDoze2OlsonName_ =  {\n        KeyValuePair<String, String> { L\"Afghanistan Standard Time\", L\"Asia\/Kabul\" },\n        KeyValuePair<String, String> { L\"Alaskan Standard Time\", L\"America\/Juneau\" },\n        KeyValuePair<String, String> { L\"Arab Standard Time\", L\"Asia\/Riyadh\" },\n        KeyValuePair<String, String> { L\"Arabian Standard Time\", L\"Asia\/Muscat\" },\n        KeyValuePair<String, String> { L\"Arabic Standard Time\", L\"Asia\/Baghdad\" },\n        KeyValuePair<String, String> { L\"Argentina Standard Time\", L\"America\/Rosario\" },\n        KeyValuePair<String, String> { L\"Atlantic Standard Time\", L\"America\/Halifax\" },\n        KeyValuePair<String, String> { L\"AUS Central Standard Time\", L\"Australia\/Darwin\" },\n        KeyValuePair<String, String> { L\"AUS Eastern Standard Time\", L\"Australia\/Sydney\" },\n        KeyValuePair<String, String> { L\"Azerbaijan Standard Time\", L\"Asia\/Baku\" },\n        KeyValuePair<String, String> { L\"Azores Standard Time\", L\"Atlantic\/Azores\" },\n        KeyValuePair<String, String> { L\"Bahia Standard Time\", L\"America\/Maceio\" },\n        KeyValuePair<String, String> { L\"Bangladesh Standard Time\", L\"Asia\/Dhaka\" },\n        KeyValuePair<String, String> { L\"Canada Central Standard Time\", L\"America\/Swift_Current\" },\n        KeyValuePair<String, String> { L\"Cape Verde Standard Time\", L\"Atlantic\/Cape_Verde\" },\n        KeyValuePair<String, String> { L\"Caucasus Standard Time\", L\"Asia\/Yerevan\" },\n        KeyValuePair<String, String> { L\"Cen. Australia Standard Time\", L\"Australia\/Adelaide\" },\n        KeyValuePair<String, String> { L\"Central America Standard Time\", L\"America\/Tegucigalpa\" },\n        KeyValuePair<String, String> { L\"Central Asia Standard Time\", L\"Asia\/Almaty\" },\n        KeyValuePair<String, String> { L\"Central Brazilian Standard Time\", L\"America\/Cuiaba\" },\n        KeyValuePair<String, String> { L\"Central Europe Standard Time\", L\"Europe\/Prague\" },\n        KeyValuePair<String, String> { L\"Central European Standard Time\", L\"Europe\/Skopje\" },\n        KeyValuePair<String, String> { L\"Central Pacific Standard Time\", L\"Pacific\/Guadalcanal\" },\n        KeyValuePair<String, String> { L\"Central Standard Time\", L\"America\/Chicago\" },\n        KeyValuePair<String, String> { L\"Central Standard Time (Mexico)\", L\"America\/Monterrey\" },\n        KeyValuePair<String, String> { L\"China Standard Time\", L\"Asia\/Urumqi\" },\n        KeyValuePair<String, String> { L\"E. Africa Standard Time\", L\"Africa\/Nairobi\" },\n        KeyValuePair<String, String> { L\"E. Australia Standard Time\", L\"Australia\/Brisbane\" },\n        KeyValuePair<String, String> { L\"E. Europe Standard Time\", L\"Europe\/Bucharest\" },\n        KeyValuePair<String, String> { L\"E. South America Standard Time\", L\"America\/Sao_Paulo\" },\n        KeyValuePair<String, String> { L\"Eastern Standard Time\", L\"America\/New_York\" },\n        KeyValuePair<String, String> { L\"Egypt Standard Time\", L\"Africa\/Cairo\" },\n        KeyValuePair<String, String> { L\"Ekaterinburg Standard Time\", L\"Asia\/Yekaterinburg\" },\n        KeyValuePair<String, String> { L\"Fiji Standard Time\", L\"Pacific\/Fiji\" },\n        KeyValuePair<String, String> { L\"FLE Standard Time\", L\"Europe\/Helsinki\" },\n        KeyValuePair<String, String> { L\"Georgian Standard Time\", L\"Asia\/Tbilisi\" },\n        KeyValuePair<String, String> { L\"GMT Standard Time\", L\"Europe\/London\" },\n        KeyValuePair<String, String> { L\"Greenland Standard Time\", L\"America\/Godthab\" },\n        KeyValuePair<String, String> { L\"Greenwich Standard Time\", L\"Atlantic\/Reykjavik\" },\n        KeyValuePair<String, String> { L\"GTB Standard Time\", L\"Europe\/Bucharest\" },\n        KeyValuePair<String, String> { L\"Hawaiian Standard Time\", L\"Pacific\/Honolulu\" },\n        KeyValuePair<String, String> { L\"India Standard Time\", L\"Asia\/Calcutta\" },\n        KeyValuePair<String, String> { L\"Iran Standard Time\", L\"Asia\/Tehran\" },\n        KeyValuePair<String, String> { L\"Jerusalem Standard Time\", L\"Asia\/Jerusalem\" },\n        KeyValuePair<String, String> { L\"Jordan Standard Time\", L\"Asia\/Amman\" },\n        KeyValuePair<String, String> { L\"Kaliningrad Standard Time\", L\"Europe\/Kaliningrad\" },\n        KeyValuePair<String, String> { L\"Korea Standard Time\", L\"Asia\/Seoul\" },\n        KeyValuePair<String, String> { L\"Libya Standard Time\", L\"Africa\/Tripoli\" },\n        KeyValuePair<String, String> { L\"Magadan Standard Time\", L\"Asia\/Magadan\" },\n        KeyValuePair<String, String> { L\"Mauritius Standard Time\", L\"Indian\/Mauritius\" },\n        KeyValuePair<String, String> { L\"Middle East Standard Time\", L\"Asia\/Beirut\" },\n        KeyValuePair<String, String> { L\"Montevideo Standard Time\", L\"America\/Montevideo\" },\n        KeyValuePair<String, String> { L\"Morocco Standard Time\", L\"Africa\/Casablanca\" },\n        KeyValuePair<String, String> { L\"Mountain Standard Time\", L\"America\/Denver\" },\n        KeyValuePair<String, String> { L\"Mountain Standard Time (Mexico)\", L\"America\/Mazatlan\" },\n        KeyValuePair<String, String> { L\"Myanmar Standard Time\", L\"Asia\/Rangoon\" },\n        KeyValuePair<String, String> { L\"N. Central Asia Standard Time\", L\"Asia\/Novosibirsk\" },\n        KeyValuePair<String, String> { L\"Namibia Standard Time\", L\"Africa\/Windhoek\" },\n        KeyValuePair<String, String> { L\"Nepal Standard Time\", L\"Asia\/Katmandu\" },\n        KeyValuePair<String, String> { L\"New Zealand Standard Time\", L\"Pacific\/Auckland\" },\n        KeyValuePair<String, String> { L\"Newfoundland Standard Time\", L\"America\/St_Johns\" },\n        KeyValuePair<String, String> { L\"North Asia East Standard Time\", L\"Asia\/Irkutsk\" },\n        KeyValuePair<String, String> { L\"North Asia Standard Time\", L\"Asia\/Krasnoyarsk\" },\n        KeyValuePair<String, String> { L\"Pacific SA Standard Time\", L\"America\/Santiago\" },\n        KeyValuePair<String, String> { L\"Pacific Standard Time\", L\"America\/Los_Angeles\" },\n        KeyValuePair<String, String> { L\"Pacific Standard Time (Mexico)\", L\"America\/Tijuana\" },\n        KeyValuePair<String, String> { L\"Pakistan Standard Time\", L\"Asia\/Karachi\" },\n        KeyValuePair<String, String> { L\"Paraguay Standard Time\", L\"America\/Asuncion\" },\n        KeyValuePair<String, String> { L\"Romance Standard Time\", L\"Europe\/Paris\" },\n        KeyValuePair<String, String> { L\"Russian Standard Time\", L\"Europe\/Moscow\" },\n        KeyValuePair<String, String> { L\"SA Eastern Standard Time\", L\"America\/Cayenne\" },\n        KeyValuePair<String, String> { L\"SA Pacific Standard Time\", L\"America\/Lima\" },\n        KeyValuePair<String, String> { L\"SA Western Standard Time\", L\"America\/La_Paz\" },\n        KeyValuePair<String, String> { L\"SE Asia Standard Time\", L\"Asia\/Jakarta\" },\n        KeyValuePair<String, String> { L\"Malay Peninsula Standard Time\", L\"Asia\/Singapore\" },\n        KeyValuePair<String, String> { L\"South Africa Standard Time\", L\"Africa\/Harare\" },\n        KeyValuePair<String, String> { L\"Syria Standard Time\", L\"Asia\/Damascus\" },\n        KeyValuePair<String, String> { L\"Taipei Standard Time\", L\"Asia\/Taipei\" },\n        KeyValuePair<String, String> { L\"Tasmania Standard Time\", L\"Australia\/Hobart\" },\n        KeyValuePair<String, String> { L\"Tokyo Standard Time\", L\"Asia\/Tokyo\" },\n        KeyValuePair<String, String> { L\"Tonga Standard Time\", L\"Pacific\/Tongatapu\" },\n        KeyValuePair<String, String> { L\"Turkey Standard Time\", L\"Asia\/Istanbul\" },\n        KeyValuePair<String, String> { L\"Ulaanbaatar Standard Time\", L\"Asia\/Ulaanbaatar\" },\n        KeyValuePair<String, String> { L\"US Eastern Standard Time\", L\"America\/Indianapolis\" },\n        KeyValuePair<String, String> { L\"US Mountain Standard Time\", L\"America\/Denver\" },\n        KeyValuePair<String, String> { L\"Venezuela Standard Time\", L\"America\/Caracas\" },\n        KeyValuePair<String, String> { L\"Vladivostok Standard Time\", L\"Asia\/Vladivostok\" },\n        KeyValuePair<String, String> { L\"W. Australia Standard Time\", L\"Australia\/Perth\" },\n        KeyValuePair<String, String> { L\"W. Central Africa Standard Time\", L\"Africa\/Brazzaville\" },\n        KeyValuePair<String, String> { L\"W. Europe Standard Time\", L\"Europe\/Vienna\" },\n        KeyValuePair<String, String> { L\"West Asia Standard Time\", L\"Asia\/Tashkent\" },\n        KeyValuePair<String, String> { L\"West Pacific Standard Time\", L\"Pacific\/Port_Moresby\" },\n        KeyValuePair<String, String> { L\"Yakutsk Standard Time\", L\"Asia\/Yakutsk\" }\n    };\n    TIME_ZONE_INFORMATION   tzInfo;\n    memset (&tzInfo, 0, sizeof (tzInfo));\n    (void)::GetTimeZoneInformation (&tzInfo);\n    result.fStandardTime.fName = tzInfo.StandardName;\n    result.fDaylightSavingsTime.fName = tzInfo.DaylightName;\n    result.fID = kWinDoze2OlsonName_.LookupValue (tzInfo.StandardName, tzInfo.StandardName);\n#else\n    AssertNotImplemented ();\n    return String ();\n#endif\n    return result;\n}\n\n\n\/*\n ********************************************************************************\n ********************************* Time::GetTimezone ****************************\n ********************************************************************************\n *\/\nString    Time::GetTimezone ()\n{\n    return GetTimezone (DateTime::Now ());\n}\n\nString    Time::GetTimezone (bool applyDST)\n{\n#if     qPlatform_Windows\n    TIME_ZONE_INFORMATION   tzInfo;\n    memset (&tzInfo, 0, sizeof (tzInfo));\n    (void)::GetTimeZoneInformation (&tzInfo);\n    return tzInfo.StandardName;\n#elif   qPlatform_POSIX\n    \/\/ @see http:\/\/pubs.opengroup.org\/onlinepubs\/7908799\/xsh\/tzset.html\n    return String::FromSDKString (IsDaylightSavingsTime (DateTime::Now ()) ? tzname[1] : tzname[0]);\n#else\n    AssertNotImplemented ();\n    return String ();\n#endif\n}\n\nString    Time::GetTimezone (const DateTime& d)\n{\n    return GetTimezone (IsDaylightSavingsTime (d));\n}\n\n\n\n\n\n\/*\n ********************************************************************************\n *********************** Time::IsDaylightSavingsTime ****************************\n ********************************************************************************\n *\/\nbool    Time::IsDaylightSavingsTime (const DateTime& d)\n{\n    struct  tm  asTM    =   d.As<struct tm> ();\n    asTM.tm_isdst = -1; \/\/ force calc of correct daylight savings time flag\n    \/\/ THINK this is true - not totally clear - docs on mktime () don't specify unambiguously that this should work...\n    \/\/ So far it seems too however, --LGP 2011-10-15\n    time_t  result  =   mktime (&asTM);\n    return asTM.tm_isdst >= 1;\n}\n\n\n\n\n\n\n\n\/*\n ********************************************************************************\n ********************* Time::GetLocaltimeToGMTOffset ****************************\n ********************************************************************************\n *\/\ntime_t  Time::GetLocaltimeToGMTOffset (bool applyDST)\n{\n#if     0\n    \/\/ WRONG - but COULD use this API - but not sure needed\n#if     qPlatform_Windows\n    TIME_ZONE_INFORMATION   tzInfo;\n    memset (&tzInfo, 0, sizeof (tzInfo));\n    (void)::GetTimeZoneInformation (&tzInfo);\n    int unsignedBias    =   abs (tzInfo.Bias);\n    int hrs =   unsignedBias \/ 60;\n    int mins = unsignedBias - hrs * 60;\n    tzBiasString = ::Format (L\"%s%.2d:%.2d\", (tzInfo.Bias >= 0 ? L\"-\" : L\"+\"), hrs, mins);\n#endif\n#endif\n\n    \/*\n     * COULD this be cached? It SHOULD be - but what about when the timezone changes? there maybe a better way to compute this using the\n     * timezone global var???\n     *\/\n    struct tm tm;\n    memset (&tm, 0, sizeof(tm));\n    tm.tm_year = 70;\n    tm.tm_mon = 0;      \/\/ Jan\n    tm.tm_mday = 1;\n    tm.tm_isdst = applyDST;\n    time_t  result  =   mktime (&tm);\n    return result;\n}\n\ntime_t  Time::GetLocaltimeToGMTOffset (const DateTime& forTime)\n{\n    return GetLocaltimeToGMTOffset (IsDaylightSavingsTime (forTime));\n}<|endoftext|>"}
{"text":"<commit_before>#include \"listbox.h\"\n\n#include <Tempest\/Panel>\n#include <Tempest\/ScrollWidget>\n#include <Tempest\/Layout>\n#include <Tempest\/ListDelegate>\n#include <Tempest\/ListView>\n#include <Tempest\/Application>\n\nusing namespace Tempest;\n\nstruct ListBox::ProxyDelegate : public ListDelegate {\n  ProxyDelegate(const std::shared_ptr<ListDelegate>& d):delegate(d){\n    d->invalidateView    .bind(invalidateView    );\n    d->updateView        .bind(updateView        );\n    d->onItemSelected    .bind(onItemSelected    );\n    d->onItemViewSelected.bind(onItemViewSelected);\n    }\n\n  std::shared_ptr<ListDelegate> delegate;\n\n  virtual size_t size() const{\n    return delegate->size();\n    }\n\n  virtual Widget* createView(size_t position){\n    return delegate->createView(position);\n    }\n\n  virtual void removeView(Widget* w, size_t position){\n    return delegate->removeView(w,position);\n    }\n  };\n\nclass ListBox::ItemBtn:public Button{\n  public:\n    ItemBtn( size_t id ):id(id){\n      onClicked.bind( this, &ItemBtn::onClick );\n      }\n\n    size_t id;\n    void onClick(){\n      clickedEx(id);\n      }\n\n    Tempest::signal<size_t> clickedEx;\n  };\n\nListBox::ListBox() : view(0) {\n  selected = 0;\n  dropListEnabled = true;\n  }\n\nListBox::~ListBox() {\n  removeDelegate();\n  }\n\nvoid ListBox::removeDelegate() {\n  if(view){\n    layout().take(view);\n    delegate->removeView(view,selected);\n    view = 0;\n    }\n\n  if(delegate){\n    delegate->onItemViewSelected.ubind(this, &ListBox::onItem);\n    delegate->updateView.ubind(this,&ListBox::updateView);\n    delegate.reset();\n    }\n  }\n\nvoid ListBox::setCurrentItem(size_t i) {\n  if( !delegate || delegate->size()==0 )\n    return;\n\n  i = std::min( delegate->size()-1, i );\n  if( selected!=i ){\n    selected = i;\n    auto tmp = dropListEnabled;\n    dropListEnabled = false;\n    onItem(selected,nullptr);\n    dropListEnabled = tmp;\n    }\n  }\n\nvoid ListBox::mouseWheelEvent(Tempest::MouseEvent &e) {\n  if( !rect().contains(e.x+x(), e.y+y()) ){\n    e.ignore();\n    return;\n    }\n\n  dropListEnabled = false;\n  if( delegate && delegate->size() ){\n    Layout& l = layout();\n    Widget* view = (l.widgets().size()==0 ? nullptr : l.widgets()[0]);\n    if( e.delta < 0 && selected+1<delegate->size() )\n      delegate->onItemViewSelected(selected+1,view);\n      else\n    if( e.delta > 0 && selected>0 )\n      delegate->onItemViewSelected(selected-1,view);\n    }\n  dropListEnabled = true;\n  }\n\nvoid ListBox::setupView(size_t oldSelected) {\n  if(!delegate)\n    return;\n\n  if(view){\n    layout().take(view);\n    delegate->removeView(view,oldSelected);\n    view = 0;\n    }\n\n  if(delegate->size()){\n    view = delegate->createView(selected,ListDelegate::R_ListBoxView);\n    layout().add(view);\n    }\n  }\n\nvoid ListBox::updateView() {\n  setupView(selected);\n  }\n\nTempest::Widget* ListBox::createDropList() {\n  if(!delegate)\n    return nullptr;\n\n  Panel *box = new Panel();\n\n  box->setLayout( Tempest::Horizontal );\n  box->layout().setMargin(6);\n  box->setPosition( mapToRoot( Tempest::Point(0,h()) ) );\n\n  ScrollWidget *sw = new ScrollWidget();\n  ListView* list   = new ListView(Vertical);\n  list->setDelegate(ProxyDelegate(delegate));\n\n  sw->centralWidget().layout().add(list);\n  int wx = std::max(w(), list->minSize().w+box->margin().xMargin());\n  box->resize(wx, list->h()+box->margin().yMargin());\n  box->layout().add(sw);\n\n  return box;\n  }\n\nvoid ListBox::onItem(size_t id,Widget* item) {\n  Layout& l    = layout();\n  Widget* view = (l.widgets().size()==0 ? nullptr : l.widgets()[0]);\n\n  if(dropListLayer()!=nullptr || !dropListEnabled ){\n    selectItem(id);\n    } else {\n    if(view==item)\n      showList();\n    }\n  }\n\nvoid ListBox::selectItem(size_t id) {\n  size_t old = selected;\n  selected = id;\n  onItemSelected(id);\n  setupView(old);\n  close();\n  }\n\nvoid ListBox::setupDelegateCallback() {\n  delegate->onItemViewSelected.bind(this, &ListBox::onItem);\n  delegate->updateView.bind(this, &ListBox::updateView);\n  }\n\nsize_t Tempest::ListBox::currentItem() const {\n  return selected;\n  }\n<commit_msg>fix invalid onItemSelected call<commit_after>#include \"listbox.h\"\n\n#include <Tempest\/Panel>\n#include <Tempest\/ScrollWidget>\n#include <Tempest\/Layout>\n#include <Tempest\/ListDelegate>\n#include <Tempest\/ListView>\n#include <Tempest\/Application>\n\nusing namespace Tempest;\n\nstruct ListBox::ProxyDelegate : public ListDelegate {\n  ProxyDelegate(const std::shared_ptr<ListDelegate>& d):delegate(d){\n    d->invalidateView    .bind(invalidateView    );\n    d->updateView        .bind(updateView        );\n    d->onItemSelected    .bind(onItemSelected    );\n    d->onItemViewSelected.bind(onItemViewSelected);\n    }\n\n  std::shared_ptr<ListDelegate> delegate;\n\n  virtual size_t size() const{\n    return delegate->size();\n    }\n\n  virtual Widget* createView(size_t position){\n    return delegate->createView(position);\n    }\n\n  virtual void removeView(Widget* w, size_t position){\n    return delegate->removeView(w,position);\n    }\n  };\n\nclass ListBox::ItemBtn:public Button{\n  public:\n    ItemBtn( size_t id ):id(id){\n      onClicked.bind( this, &ItemBtn::onClick );\n      }\n\n    size_t id;\n    void onClick(){\n      clickedEx(id);\n      }\n\n    Tempest::signal<size_t> clickedEx;\n  };\n\nListBox::ListBox() : view(0) {\n  selected = 0;\n  dropListEnabled = true;\n  }\n\nListBox::~ListBox() {\n  removeDelegate();\n  }\n\nvoid ListBox::removeDelegate() {\n  if(view){\n    layout().take(view);\n    delegate->removeView(view,selected);\n    view = 0;\n    }\n\n  if(delegate){\n    delegate->onItemViewSelected.ubind(this, &ListBox::onItem);\n    delegate->updateView.ubind(this,&ListBox::updateView);\n    delegate.reset();\n    }\n  }\n\nvoid ListBox::setCurrentItem(size_t i) {\n  if( !delegate || delegate->size()==0 )\n    return;\n\n  i = std::min( delegate->size()-1, i );\n  if( selected!=i ){\n    auto tmp = dropListEnabled;\n    dropListEnabled = false;\n    onItem(i,nullptr);\n    selected = i;\n    dropListEnabled = tmp;\n    }\n  }\n\nvoid ListBox::mouseWheelEvent(Tempest::MouseEvent &e) {\n  if( !rect().contains(e.x+x(), e.y+y()) ){\n    e.ignore();\n    return;\n    }\n\n  dropListEnabled = false;\n  if( delegate && delegate->size() ){\n    Layout& l = layout();\n    Widget* view = (l.widgets().size()==0 ? nullptr : l.widgets()[0]);\n    if( e.delta < 0 && selected+1<delegate->size() )\n      delegate->onItemViewSelected(selected+1,view);\n      else\n    if( e.delta > 0 && selected>0 )\n      delegate->onItemViewSelected(selected-1,view);\n    }\n  dropListEnabled = true;\n  }\n\nvoid ListBox::setupView(size_t oldSelected) {\n  if(!delegate)\n    return;\n\n  if(view){\n    layout().take(view);\n    delegate->removeView(view,oldSelected);\n    view = 0;\n    }\n\n  if(delegate->size()){\n    view = delegate->createView(selected,ListDelegate::R_ListBoxView);\n    layout().add(view);\n    }\n  }\n\nvoid ListBox::updateView() {\n  setupView(selected);\n  }\n\nTempest::Widget* ListBox::createDropList() {\n  if(!delegate)\n    return nullptr;\n\n  Panel *box = new Panel();\n\n  box->setLayout( Tempest::Horizontal );\n  box->layout().setMargin(6);\n  box->setPosition( mapToRoot( Tempest::Point(0,h()) ) );\n\n  ScrollWidget *sw = new ScrollWidget();\n  ListView* list   = new ListView(Vertical);\n  list->setDelegate(ProxyDelegate(delegate));\n\n  sw->centralWidget().layout().add(list);\n  int wx = std::max(w(), list->minSize().w+box->margin().xMargin());\n  box->resize(wx, list->h()+box->margin().yMargin());\n  box->layout().add(sw);\n\n  return box;\n  }\n\nvoid ListBox::onItem(size_t id,Widget* item) {\n  Layout& l    = layout();\n  Widget* view = (l.widgets().size()==0 ? nullptr : l.widgets()[0]);\n\n  if(dropListLayer()!=nullptr || !dropListEnabled ){\n    selectItem(id);\n    } else {\n    if(view==item)\n      showList();\n    }\n  }\n\nvoid ListBox::selectItem(size_t id) {\n  size_t old = selected;\n  selected = id;\n  if(old!=id)\n    onItemSelected(id);\n  setupView(old);\n  close();\n  }\n\nvoid ListBox::setupDelegateCallback() {\n  delegate->onItemViewSelected.bind(this, &ListBox::onItem);\n  delegate->updateView.bind(this, &ListBox::updateView);\n  }\n\nsize_t Tempest::ListBox::currentItem() const {\n  return selected;\n  }\n<|endoftext|>"}
{"text":"<commit_before>#include \"stdafx.h\"\n\n#include \"GraphHandler.h\"\n#include \"Options.h\"\n\n#include <cinder\/app\/AppNative.h>\n#include <cinder\/params\/Params.h>\n#include <cinder\/qtime\/MovieWriter.h>\n\nusing namespace ci;\nusing namespace ci::app;\n\nclass GraphStudioApp : public AppNative {\npublic:\n    void prepareSettings(Settings *settings) override;\n    void setup() override;\n    void mouseDown(MouseEvent event) override;\n    void keyDown(KeyEvent event) override;\n    void update() override;\n    void draw() override;\n    void resize() override;\n    void shutdown() override;\n\n    const ColorScheme &getCurrentColorScheme();\nprivate:\n    ci::params::InterfaceGlRef\tparams;\n    qtime::MovieWriterRef\tmMovieWriter;\n    std::map<std::string, ColorScheme> colorSchemes;\n    std::vector<std::string> colorSchemeNames;\n    GraphHandler gh;\n    int prevColorSchemeIndex;\n    void addNewColorScheme();\n    void storeColorScheme();\n\n    void loadSettings();\n    void saveSettings();\n};\n\n\nvoid GraphStudioApp::prepareSettings(Settings *settings)\n{\n    settings->enableConsoleWindow();\n    settings->setWindowSize(800, 600);\n    settings->setFrameRate(60.0f);\n}\n\n\nconst ColorScheme &GraphStudioApp::getCurrentColorScheme()\n{\n    return colorSchemes[colorSchemeNames[Options::instance().currentColorSchemeIdx]];\n}\n\n\nvoid GraphStudioApp::addNewColorScheme()\n{\n    auto &cs = Options::instance().currentColorScheme;\n    cs = ColorScheme();\n    bool freeNameFound = false;\n    int freeNameIdx = 0;\n    std::string newName;\n    do\n    {\n        newName = \"ColorScheme #\" + std::to_string(++freeNameIdx);\n        if (find(begin(colorSchemeNames), end(colorSchemeNames), newName) == colorSchemeNames.end())\n            freeNameFound = true;\n    } while (!freeNameFound);\n    cs.name = newName;\n    colorSchemeNames.push_back(cs.name);\n    colorSchemes[cs.name] = cs;\n    Options::instance().currentColorSchemeIdx = colorSchemes.size() - 1;\n    params->addParam(\"ColorScheme\", colorSchemeNames, &Options::instance().currentColorSchemeIdx);\n}\n\n\nvoid GraphStudioApp::storeColorScheme()\n{\n    auto &cs = Options::instance().currentColorScheme;\n    colorSchemes[cs.name] = cs;\n}\n\n\nvoid GraphStudioApp::saveSettings()\n{\n    ci::XmlTree configXml(\"graphStudioSettings\", \"\");\n    configXml.push_back(ci::XmlTree(\"nodeSize\", std::to_string(Options::instance().nodeSize)));\n    configXml.push_back(ci::XmlTree(\"edgeWidth\", std::to_string(Options::instance().edgeWidth)));\n    configXml.push_back(ci::XmlTree(\"highlightedEdgeWidth\", std::to_string(Options::instance().highlighedEdgeWidth)));\n    configXml.push_back(ci::XmlTree(\"arrowLength\", std::to_string(Options::instance().arrowLength)));\n    configXml.push_back(ci::XmlTree(\"arrowAngle\", std::to_string(Options::instance().arrowAngle)));\n    configXml.push_back(ci::XmlTree(\"showEdgeWeights\", std::to_string(Options::instance().showEdgeWeights)));\n    configXml.push_back(ci::XmlTree(\"showNodeWeights\", std::to_string(Options::instance().showNodeWeights)));\n    configXml.push_back(ci::XmlTree(\"force\", std::to_string(Options::instance().force)));\n    configXml.push_back(ci::XmlTree(\"speed\", std::to_string(Options::instance().speed)));\n    configXml.push_back(ci::XmlTree(\"edgeWeightScale\", std::to_string(Options::instance().edgeWeightScale)));\n    ci::XmlTree csList(\"colorSchemes\", \"\");\n    for (const auto &cs : colorSchemes)\n    {\n        csList.push_back(cs.second.toXml());\n    }\n    configXml.push_back(csList);\n\n    configXml.write(ci::writeFile(\"config.xml\"));\n}\n\n\nvoid GraphStudioApp::loadSettings()\n{\n    ci::XmlTree configXml(ci::loadFile(\"config.xml\"));\n    ci::XmlTree settings = configXml.getChild(\"graphStudioSettings\");\n    Options::instance().nodeSize = settings.getChild(\"nodeSize\").getValue<float>();\n    Options::instance().edgeWidth = settings.getChild(\"edgeWidth\").getValue<float>();\n    Options::instance().highlighedEdgeWidth = settings.getChild(\"highlightedEdgeWidth\").getValue<float>();\n    Options::instance().arrowLength = settings.getChild(\"arrowLength\").getValue<float>();\n    Options::instance().arrowAngle = settings.getChild(\"arrowAngle\").getValue<float>();\n    Options::instance().showEdgeWeights = settings.getChild(\"showEdgeWeights\").getValue<bool>();\n    Options::instance().showNodeWeights = settings.getChild(\"showNodeWeights\").getValue<bool>();\n\n    Options::instance().force = settings.getChild(\"force\").getValue<float>();\n    Options::instance().speed = settings.getChild(\"speed\").getValue<int>();\n    Options::instance().edgeWeightScale = settings.getChild(\"edgeWeightScale\").getValue<int>();\n\n    ci::XmlTree csList = settings.getChild(\"colorSchemes\");\n    for (auto csIt = csList.begin(); csIt != csList.end(); ++csIt)\n    {\n        ColorScheme cs = ColorScheme::fromXml(*csIt);\n        colorSchemes[cs.name] = cs;\n        colorSchemeNames.push_back(cs.name);\n    }\n}\n\n\nvoid GraphStudioApp::setup()\n{    \n    loadSettings();\n\n    params = params::InterfaceGl::create(\"Graph Studio\", Vec2i(200, 310));\n    params->addParam(\"Node Size\", &Options::instance().nodeSize, \"min=1.0 max=50.0 step=1.0\");\n    params->addParam(\"Edge Width\", &Options::instance().edgeWidth, \"min=0.1 max=10.0 step=0.1\");\n    params->addParam(\"Highlighted Edge Width\", &Options::instance().highlighedEdgeWidth, \"min=0.0 max=10.0 step=0.1\");\n    params->addParam(\"Arrow Length\", &Options::instance().arrowLength, \"min=1.0 max=50.0 step=1.0\");\n    params->addParam(\"Arrow Angle\", &Options::instance().arrowAngle, \"min=0.0 max=90.0 step=1.0\");\n    params->addParam(\"Show Edge Weights\", &Options::instance().showEdgeWeights);\n    params->addParam(\"Show Node Weights\", &Options::instance().showNodeWeights);\n    params->addSeparator();\n    params->addParam(\"Algorithm\", AlgorithmNames, &Options::instance().algorithm);\n    params->addParam(\"Starting Node\",  &Options::instance().startNode, \"min=1 step=1\");\n    params->addSeparator();\n    params->addParam(\"Force\", &Options::instance().force, \"min=1.0 max=300.0 step=1.0\");\n    params->addParam(\"Speed\", &Options::instance().speed, \"min=1.0 max=300.0 step=1.0\");\n    params->addParam(\"Edge Weight Scale\", &Options::instance().edgeWeightScale, \"min=1.0 max=1000.0 step=1.0\");\n    params->addSeparator();\n    params->addText(\"Colors\");\n    params->addParam(\"ColorScheme\", colorSchemeNames, &Options::instance().currentColorSchemeIdx);\n    params->addParam(\"Background\", &Options::instance().currentColorScheme.backgroundColor);\n\n    params->addParam(\"Node \", &Options::instance().currentColorScheme.nodeColor);\n    params->addParam(\"Highlighted Node 1\", &Options::instance().currentColorScheme.highlightedNodeColor1);\n    params->addParam(\"Highlighted Node 2\", &Options::instance().currentColorScheme.highlightedNodeColor2);\n    params->addParam(\"Highlighted Node 3\", &Options::instance().currentColorScheme.highlightedNodeColor3);\n\n    params->addParam(\"Edge\", &Options::instance().currentColorScheme.edgeColor);\n    params->addParam(\"Dark Edge\", &Options::instance().currentColorScheme.darkEdgeColor);\n    params->addParam(\"Highlighted Edge 1\", &Options::instance().currentColorScheme.highlightedEdgeColor1);\n    params->addParam(\"Highlighted Edge 2\", &Options::instance().currentColorScheme.highlightedEdgeColor2);\n    params->addParam(\"Highlighted Edge 3\", &Options::instance().currentColorScheme.highlightedEdgeColor3);\n\n    params->addParam(\"Node Text\", &Options::instance().currentColorScheme.nodeTextColor);\n    params->addParam(\"highlightednodeText\", &Options::instance().currentColorScheme.highlightednodeTextColor);\n    params->addParam(\"Edge Text\", &Options::instance().currentColorScheme.edgeTextColor);\n    params->addParam(\"Highlighted Edge Text\", &Options::instance().currentColorScheme.highlightedEdgeTextColor);\n\n    params->addButton(\"New\", std::bind(&GraphStudioApp::addNewColorScheme, this));\n    params->addSeparator();\n    params->addText(\"Random Edge Weights\");\n    params->addParam(\"Min\", &Options::instance().minRandomEdgeWeight, \"min=1, max=1000, step=1\");\n    params->addParam(\"Max\", &Options::instance().maxRandomEdgeWeight, \"min=1, max=1000, step=1\");\n    params->addButton(\"Generate Weights\", std::bind(&GraphHandler::setRandomEdgeWeights, &gh));\n    params->addSeparator();\n    params->addText(\"Generate Grid\");\n    params->addParam(\"Columns\", &GraphParamsGrid::instance().columns, \"min=1 step=1\");\n    params->addParam(\"Rows\", &GraphParamsGrid::instance().rows, \"min=1 step=1\");\n    params->addParam(\"Directed\", &GraphParamsGrid::instance().directed);\n    params->addParam(\"Horizontal Edges\", &GraphParamsGrid::instance().horizontal);\n    params->addParam(\"Vertical Edges\", &GraphParamsGrid::instance().vertical);\n    params->addParam(\"Diagonal \/\", &GraphParamsGrid::instance().upDiagonal);\n    params->addParam(\"Diagonal \\\\\", &GraphParamsGrid::instance().downDiagonal);\n    params->addButton(\"Generate grid\", std::bind(&GraphHandler::generateSpecialGraph, &gh, GraphHandler::GraphType::grid));\n    params->addText(\"Generate Triangle Mesh\");\n    params->addParam(\"Triangles\", &GraphParamsTriangleMesh::instance().triangles, \"min=1 step=1\");\n    params->addParam(\"Randomness\", &GraphParamsTriangleMesh::instance().randomness, \"min=0.0 step=0.1\");\n    params->addButton(\"Generate tri\", std::bind(&GraphHandler::generateSpecialGraph, &gh, GraphHandler::GraphType::triangleMesh));\n    \n    prevColorSchemeIndex = -1;\n    gh.setup(getWindow());\n\n}\n\nvoid GraphStudioApp::shutdown()\n{\n    saveSettings();\n}\n\nvoid GraphStudioApp::keyDown(KeyEvent event)\n{\n    std::string nameBase = \"graph_small2\";\n    static const std::vector<std::string> extensions{ \"graph\", \"txt\" };\n    if (event.getCode() == KeyEvent::KEY_SPACE)\n    {\n        \/\/ stop - play - pause - play - pause - play - until the last state is reached\n        if (!Options::instance().animationPlaying)\n        {\n            Options::instance().animationPlaying = true;\n            Options::instance().animationPaused = false;\n            gh.animationPrepare();\n        }\n        else\n        {\n            Options::instance().animationPaused = !Options::instance().animationPaused;\n            if (Options::instance().animationPaused)\n            {\n                gh.animationPause();\n            }\n            else\n            {\n                gh.animationResume();\n            }\n        }\n        \n        return;\n    }\n    else  if (event.getCode() == KeyEvent::KEY_RIGHT)\n    {\n        gh.animationNext();\n        return;\n    }\n    else  if (event.getCode() == KeyEvent::KEY_LEFT)\n    {\n        gh.animationPrevious();\n        return;\n    }\n    else  if (event.getCode() == KeyEvent::KEY_ESCAPE)\n    {\n        Options::instance().animationPlaying = false;\n        Options::instance().animationPaused = true;\n        gh.animationPause();\n        setFullScreen(false);\n        showCursor();\n        params->show();\n        return;\n    }\n    if (event.getChar() == 'm')\n    {\n        Options::instance().randomMovement = !Options::instance().randomMovement;\n        if (Options::instance().randomMovement)\n            Options::instance().animationPlaying = false;\n    }\n    if (event.getChar() == 's')\n    {\n        boost::filesystem::path path;\n        if (event.isAltDown())\n        {\n            path = getSaveFilePath(\"\", extensions);\n            if (path.empty())\n                return;\n\n            if (path.extension().empty())\n            {\n                path += \".graph\";\n            }\n            gh.saveGraph(path.string());\n            gh.saveGraphPositions(path.replace_extension(\"pos\").string());\n        }\n        else\n        {\n            gh.saveGraph(nameBase + \".txt\");\n            gh.saveGraphPositions(nameBase + \".pos\");\n        }\n    }\n    if (event.getChar() == 'l')\n    {\n        boost::filesystem::path path;\n        if (event.isAltDown())\n        {\n            path = getOpenFilePath(nameBase + \".txt\", extensions);\n            if (path.empty())\n                return;\n\n            gh.loadGraph(path.string());\n            gh.loadGraphPositions(path.replace_extension(\"pos\").string());\n        }\n        else\n        {\n            gh.loadGraph(nameBase + \".txt\");\n            gh.loadGraphPositions(nameBase + \".pos\");\n        }\n\n        Options::instance().startNode = 1;\n        gh.fitToWindow();\n    }\n    if (event.getChar() == 'u')\n    {\n        gh.toggleAutomaticEdgeWeightUpdate();\n        std::cout << \"automaticEdgeWeightUpdate = \" << gh.getAutomaticEdgeWeightUpdate() << std::endl;\n    }\n    if (event.getChar() == 'f')\n    {\n        gh.fitToWindow();\n    }\n    if (event.getChar() == 'r')\n    {\n        if (event.isControlDown())\n        {\n            setFullScreen(true);\n            hideCursor();\n            params->hide();\n            Options::instance().animationPlaying = true;\n            Options::instance().animationPaused = false;\n            gh.animationPrepare();\n            \/*\n            fs::path path = getSaveFilePath();\n            if (path.empty())\n            return; \/\/ user cancelled save\n            qtime::MovieWriter::Format format;\n            if (qtime::MovieWriter::getUserCompressionSettings(&format)) {\n            mMovieWriter = qtime::MovieWriter::create(path, getWindowWidth(), getWindowHeight(), format);\n            }\n            *\/\n        }\n        else\n        {\n            gh.reorderNodesSquare();\n        }\n    }\n\n    if (event.getChar() == 'q')\n    {\n        saveSettings();\n        quit();\n    }\n    \n}\n\n\nvoid GraphStudioApp::mouseDown( MouseEvent event )\n{\n    \/\/std::cout << \"GraphStudioApp::mouseDown\" << std::endl;\n}\n\n\nvoid GraphStudioApp::update()\n{\n    gh.update();\n    if (prevColorSchemeIndex != Options::instance().currentColorSchemeIdx)\n    {\n        prevColorSchemeIndex = Options::instance().currentColorSchemeIdx;\n        Options::instance().currentColorScheme = colorSchemes[colorSchemeNames[Options::instance().currentColorSchemeIdx]];\n    }\n    else\n    {\n        storeColorScheme();\n    }\n}\n\n\nvoid GraphStudioApp::draw()\n{\n    \/\/ clear out the window with black\n    gl::clear(Color(0, 0, 0));\n    gh.draw();\n    if (!Options::instance().animationPlaying || Options::instance().animationPaused)\n        params->draw();\n    \/*\n    if (mMovieWriter)\n        mMovieWriter->addFrame(copyWindowSurface());\n    *\/\n}\n\nvoid GraphStudioApp::resize()\n{\n    gh.resize(getWindowBounds());\n}\n\nCINDER_APP_NATIVE( GraphStudioApp, RendererGl )\n<commit_msg>Turned on recording<commit_after>#include \"stdafx.h\"\n\n#include \"GraphHandler.h\"\n#include \"Options.h\"\n\n#include <cinder\/app\/AppNative.h>\n#include <cinder\/params\/Params.h>\n#include <cinder\/qtime\/MovieWriter.h>\n\nusing namespace ci;\nusing namespace ci::app;\n\nclass GraphStudioApp : public AppNative {\npublic:\n    void prepareSettings(Settings *settings) override;\n    void setup() override;\n    void mouseDown(MouseEvent event) override;\n    void keyDown(KeyEvent event) override;\n    void update() override;\n    void draw() override;\n    void resize() override;\n    void shutdown() override;\n\n    const ColorScheme &getCurrentColorScheme();\nprivate:\n    ci::params::InterfaceGlRef\tparams;\n    qtime::MovieWriterRef\tmMovieWriter;\n    std::map<std::string, ColorScheme> colorSchemes;\n    std::vector<std::string> colorSchemeNames;\n    GraphHandler gh;\n    int prevColorSchemeIndex;\n    void addNewColorScheme();\n    void storeColorScheme();\n\n    void loadSettings();\n    void saveSettings();\n};\n\n\nvoid GraphStudioApp::prepareSettings(Settings *settings)\n{\n    settings->enableConsoleWindow();\n    settings->setWindowSize(800, 600);\n    settings->setFrameRate(30.0f);\n}\n\n\nconst ColorScheme &GraphStudioApp::getCurrentColorScheme()\n{\n    return colorSchemes[colorSchemeNames[Options::instance().currentColorSchemeIdx]];\n}\n\n\nvoid GraphStudioApp::addNewColorScheme()\n{\n    auto &cs = Options::instance().currentColorScheme;\n    cs = ColorScheme();\n    bool freeNameFound = false;\n    int freeNameIdx = 0;\n    std::string newName;\n    do\n    {\n        newName = \"ColorScheme #\" + std::to_string(++freeNameIdx);\n        if (find(begin(colorSchemeNames), end(colorSchemeNames), newName) == colorSchemeNames.end())\n            freeNameFound = true;\n    } while (!freeNameFound);\n    cs.name = newName;\n    colorSchemeNames.push_back(cs.name);\n    colorSchemes[cs.name] = cs;\n    Options::instance().currentColorSchemeIdx = colorSchemes.size() - 1;\n    params->addParam(\"ColorScheme\", colorSchemeNames, &Options::instance().currentColorSchemeIdx);\n}\n\n\nvoid GraphStudioApp::storeColorScheme()\n{\n    auto &cs = Options::instance().currentColorScheme;\n    colorSchemes[cs.name] = cs;\n}\n\n\nvoid GraphStudioApp::saveSettings()\n{\n    ci::XmlTree configXml(\"graphStudioSettings\", \"\");\n    configXml.push_back(ci::XmlTree(\"nodeSize\", std::to_string(Options::instance().nodeSize)));\n    configXml.push_back(ci::XmlTree(\"edgeWidth\", std::to_string(Options::instance().edgeWidth)));\n    configXml.push_back(ci::XmlTree(\"highlightedEdgeWidth\", std::to_string(Options::instance().highlighedEdgeWidth)));\n    configXml.push_back(ci::XmlTree(\"arrowLength\", std::to_string(Options::instance().arrowLength)));\n    configXml.push_back(ci::XmlTree(\"arrowAngle\", std::to_string(Options::instance().arrowAngle)));\n    configXml.push_back(ci::XmlTree(\"showEdgeWeights\", std::to_string(Options::instance().showEdgeWeights)));\n    configXml.push_back(ci::XmlTree(\"showNodeWeights\", std::to_string(Options::instance().showNodeWeights)));\n    configXml.push_back(ci::XmlTree(\"force\", std::to_string(Options::instance().force)));\n    configXml.push_back(ci::XmlTree(\"speed\", std::to_string(Options::instance().speed)));\n    configXml.push_back(ci::XmlTree(\"edgeWeightScale\", std::to_string(Options::instance().edgeWeightScale)));\n    ci::XmlTree csList(\"colorSchemes\", \"\");\n    for (const auto &cs : colorSchemes)\n    {\n        csList.push_back(cs.second.toXml());\n    }\n    configXml.push_back(csList);\n\n    configXml.write(ci::writeFile(\"config.xml\"));\n}\n\n\nvoid GraphStudioApp::loadSettings()\n{\n    ci::XmlTree configXml(ci::loadFile(\"config.xml\"));\n    ci::XmlTree settings = configXml.getChild(\"graphStudioSettings\");\n    Options::instance().nodeSize = settings.getChild(\"nodeSize\").getValue<float>();\n    Options::instance().edgeWidth = settings.getChild(\"edgeWidth\").getValue<float>();\n    Options::instance().highlighedEdgeWidth = settings.getChild(\"highlightedEdgeWidth\").getValue<float>();\n    Options::instance().arrowLength = settings.getChild(\"arrowLength\").getValue<float>();\n    Options::instance().arrowAngle = settings.getChild(\"arrowAngle\").getValue<float>();\n    Options::instance().showEdgeWeights = settings.getChild(\"showEdgeWeights\").getValue<bool>();\n    Options::instance().showNodeWeights = settings.getChild(\"showNodeWeights\").getValue<bool>();\n\n    Options::instance().force = settings.getChild(\"force\").getValue<float>();\n    Options::instance().speed = settings.getChild(\"speed\").getValue<int>();\n    Options::instance().edgeWeightScale = settings.getChild(\"edgeWeightScale\").getValue<int>();\n\n    ci::XmlTree csList = settings.getChild(\"colorSchemes\");\n    for (auto csIt = csList.begin(); csIt != csList.end(); ++csIt)\n    {\n        ColorScheme cs = ColorScheme::fromXml(*csIt);\n        colorSchemes[cs.name] = cs;\n        colorSchemeNames.push_back(cs.name);\n    }\n}\n\n\nvoid GraphStudioApp::setup()\n{    \n    loadSettings();\n\n    params = params::InterfaceGl::create(\"Graph Studio\", Vec2i(200, 310));\n    params->addParam(\"Node Size\", &Options::instance().nodeSize, \"min=1.0 max=50.0 step=1.0\");\n    params->addParam(\"Edge Width\", &Options::instance().edgeWidth, \"min=0.1 max=10.0 step=0.1\");\n    params->addParam(\"Highlighted Edge Width\", &Options::instance().highlighedEdgeWidth, \"min=0.0 max=10.0 step=0.1\");\n    params->addParam(\"Arrow Length\", &Options::instance().arrowLength, \"min=1.0 max=50.0 step=1.0\");\n    params->addParam(\"Arrow Angle\", &Options::instance().arrowAngle, \"min=0.0 max=90.0 step=1.0\");\n    params->addParam(\"Show Edge Weights\", &Options::instance().showEdgeWeights);\n    params->addParam(\"Show Node Weights\", &Options::instance().showNodeWeights);\n    params->addSeparator();\n    params->addParam(\"Algorithm\", AlgorithmNames, &Options::instance().algorithm);\n    params->addParam(\"Starting Node\",  &Options::instance().startNode, \"min=1 step=1\");\n    params->addSeparator();\n    params->addParam(\"Force\", &Options::instance().force, \"min=1.0 max=300.0 step=1.0\");\n    params->addParam(\"Speed\", &Options::instance().speed, \"min=1.0 max=300.0 step=1.0\");\n    params->addParam(\"Edge Weight Scale\", &Options::instance().edgeWeightScale, \"min=1.0 max=1000.0 step=1.0\");\n    params->addSeparator();\n    params->addText(\"Colors\");\n    params->addParam(\"ColorScheme\", colorSchemeNames, &Options::instance().currentColorSchemeIdx);\n    params->addParam(\"Background\", &Options::instance().currentColorScheme.backgroundColor);\n\n    params->addParam(\"Node \", &Options::instance().currentColorScheme.nodeColor);\n    params->addParam(\"Highlighted Node 1\", &Options::instance().currentColorScheme.highlightedNodeColor1);\n    params->addParam(\"Highlighted Node 2\", &Options::instance().currentColorScheme.highlightedNodeColor2);\n    params->addParam(\"Highlighted Node 3\", &Options::instance().currentColorScheme.highlightedNodeColor3);\n\n    params->addParam(\"Edge\", &Options::instance().currentColorScheme.edgeColor);\n    params->addParam(\"Dark Edge\", &Options::instance().currentColorScheme.darkEdgeColor);\n    params->addParam(\"Highlighted Edge 1\", &Options::instance().currentColorScheme.highlightedEdgeColor1);\n    params->addParam(\"Highlighted Edge 2\", &Options::instance().currentColorScheme.highlightedEdgeColor2);\n    params->addParam(\"Highlighted Edge 3\", &Options::instance().currentColorScheme.highlightedEdgeColor3);\n\n    params->addParam(\"Node Text\", &Options::instance().currentColorScheme.nodeTextColor);\n    params->addParam(\"highlightednodeText\", &Options::instance().currentColorScheme.highlightednodeTextColor);\n    params->addParam(\"Edge Text\", &Options::instance().currentColorScheme.edgeTextColor);\n    params->addParam(\"Highlighted Edge Text\", &Options::instance().currentColorScheme.highlightedEdgeTextColor);\n\n    params->addButton(\"New\", std::bind(&GraphStudioApp::addNewColorScheme, this));\n    params->addSeparator();\n    params->addText(\"Random Edge Weights\");\n    params->addParam(\"Min\", &Options::instance().minRandomEdgeWeight, \"min=1, max=1000, step=1\");\n    params->addParam(\"Max\", &Options::instance().maxRandomEdgeWeight, \"min=1, max=1000, step=1\");\n    params->addButton(\"Generate Weights\", std::bind(&GraphHandler::setRandomEdgeWeights, &gh));\n    params->addSeparator();\n    params->addText(\"Generate Grid\");\n    params->addParam(\"Columns\", &GraphParamsGrid::instance().columns, \"min=1 step=1\");\n    params->addParam(\"Rows\", &GraphParamsGrid::instance().rows, \"min=1 step=1\");\n    params->addParam(\"Directed\", &GraphParamsGrid::instance().directed);\n    params->addParam(\"Horizontal Edges\", &GraphParamsGrid::instance().horizontal);\n    params->addParam(\"Vertical Edges\", &GraphParamsGrid::instance().vertical);\n    params->addParam(\"Diagonal \/\", &GraphParamsGrid::instance().upDiagonal);\n    params->addParam(\"Diagonal \\\\\", &GraphParamsGrid::instance().downDiagonal);\n    params->addButton(\"Generate grid\", std::bind(&GraphHandler::generateSpecialGraph, &gh, GraphHandler::GraphType::grid));\n    params->addText(\"Generate Triangle Mesh\");\n    params->addParam(\"Triangles\", &GraphParamsTriangleMesh::instance().triangles, \"min=1 step=1\");\n    params->addParam(\"Randomness\", &GraphParamsTriangleMesh::instance().randomness, \"min=0.0 step=0.1\");\n    params->addButton(\"Generate tri\", std::bind(&GraphHandler::generateSpecialGraph, &gh, GraphHandler::GraphType::triangleMesh));\n    \n    prevColorSchemeIndex = -1;\n    gh.setup(getWindow());\n\n}\n\nvoid GraphStudioApp::shutdown()\n{\n    saveSettings();\n}\n\nvoid GraphStudioApp::keyDown(KeyEvent event)\n{\n    std::string nameBase = \"graph_small2\";\n    static const std::vector<std::string> extensions{ \"graph\", \"txt\" };\n    if (event.getCode() == KeyEvent::KEY_SPACE)\n    {\n        \/\/ stop - play - pause - play - pause - play - until the last state is reached\n        if (!Options::instance().animationPlaying)\n        {\n            Options::instance().animationPlaying = true;\n            Options::instance().animationPaused = false;\n            gh.animationPrepare();\n        }\n        else\n        {\n            Options::instance().animationPaused = !Options::instance().animationPaused;\n            if (Options::instance().animationPaused)\n            {\n                gh.animationPause();\n            }\n            else\n            {\n                gh.animationResume();\n            }\n        }\n        \n        return;\n    }\n    else  if (event.getCode() == KeyEvent::KEY_RIGHT)\n    {\n        gh.animationNext();\n        return;\n    }\n    else  if (event.getCode() == KeyEvent::KEY_LEFT)\n    {\n        gh.animationPrevious();\n        return;\n    }\n    else  if (event.getCode() == KeyEvent::KEY_ESCAPE)\n    {\n        Options::instance().animationPlaying = false;\n        Options::instance().animationPaused = true;\n        gh.animationPause();\n        setFullScreen(false);\n        showCursor();\n        params->show();\n        return;\n    }\n    if (event.getChar() == 'm')\n    {\n        Options::instance().randomMovement = !Options::instance().randomMovement;\n        if (Options::instance().randomMovement)\n            Options::instance().animationPlaying = false;\n    }\n    if (event.getChar() == 's')\n    {\n        boost::filesystem::path path;\n        if (event.isAltDown())\n        {\n            path = getSaveFilePath(\"\", extensions);\n            if (path.empty())\n                return;\n\n            if (path.extension().empty())\n            {\n                path += \".graph\";\n            }\n            gh.saveGraph(path.string());\n            gh.saveGraphPositions(path.replace_extension(\"pos\").string());\n        }\n        else\n        {\n            gh.saveGraph(nameBase + \".txt\");\n            gh.saveGraphPositions(nameBase + \".pos\");\n        }\n    }\n    if (event.getChar() == 'l')\n    {\n        boost::filesystem::path path;\n        if (event.isAltDown())\n        {\n            path = getOpenFilePath(nameBase + \".txt\", extensions);\n            if (path.empty())\n                return;\n\n            gh.loadGraph(path.string());\n            gh.loadGraphPositions(path.replace_extension(\"pos\").string());\n        }\n        else\n        {\n            gh.loadGraph(nameBase + \".txt\");\n            gh.loadGraphPositions(nameBase + \".pos\");\n        }\n\n        Options::instance().startNode = 1;\n        gh.fitToWindow();\n    }\n    if (event.getChar() == 'u')\n    {\n        gh.toggleAutomaticEdgeWeightUpdate();\n        std::cout << \"automaticEdgeWeightUpdate = \" << gh.getAutomaticEdgeWeightUpdate() << std::endl;\n    }\n    if (event.getChar() == 'f')\n    {\n        gh.fitToWindow();\n    }\n    if (event.getChar() == 'r')\n    {\n        if (event.isControlDown())\n        {\n            setFullScreen(true);\n            \n            params->hide();\n            Options::instance().animationPlaying = true;\n            Options::instance().animationPaused = false;\n            gh.animationPrepare();\n\n            fs::path path = getSaveFilePath();\n            if (path.empty())\n                return; \/\/ user cancelled save\n            qtime::MovieWriter::Format format;\n            if (qtime::MovieWriter::getUserCompressionSettings(&format)) \n            {\n                hideCursor();\n                mMovieWriter = qtime::MovieWriter::create(path, getWindowWidth(), getWindowHeight(), format);\n            }\n\n        }\n        else\n        {\n            gh.reorderNodesSquare();\n        }\n    }\n\n    if (event.getChar() == 'q')\n    {\n        saveSettings();\n        quit();\n    }\n    \n}\n\n\nvoid GraphStudioApp::mouseDown( MouseEvent event )\n{\n    \/\/std::cout << \"GraphStudioApp::mouseDown\" << std::endl;\n}\n\n\nvoid GraphStudioApp::update()\n{\n    gh.update();\n    if (prevColorSchemeIndex != Options::instance().currentColorSchemeIdx)\n    {\n        prevColorSchemeIndex = Options::instance().currentColorSchemeIdx;\n        Options::instance().currentColorScheme = colorSchemes[colorSchemeNames[Options::instance().currentColorSchemeIdx]];\n    }\n    else\n    {\n        storeColorScheme();\n    }\n}\n\n\nvoid GraphStudioApp::draw()\n{\n    \/\/ clear out the window with black\n    gl::clear(Color(0, 0, 0));\n    gh.draw();\n    if (!Options::instance().animationPlaying || Options::instance().animationPaused)\n        params->draw();\n    \n    if (mMovieWriter)\n        mMovieWriter->addFrame(copyWindowSurface());    \n}\n\nvoid GraphStudioApp::resize()\n{\n    gh.resize(getWindowBounds());\n}\n\nCINDER_APP_NATIVE( GraphStudioApp, RendererGl )\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <fstream>\n#include <memory>\n\n#include \"HexagonOffload.h\"\n#include \"IRMutator.h\"\n#include \"Substitute.h\"\n#include \"Closure.h\"\n#include \"Param.h\"\n#include \"Image.h\"\n#include \"LLVM_Output.h\"\n#include \"RemoveTrivialForLoops.h\"\n\nnamespace Halide {\nnamespace Internal {\n\nusing std::string;\nusing std::vector;\n\nnamespace {\n\n\/\/ Replace the parameter objects of loads\/stores with a new parameter\n\/\/ object.\nclass ReplaceParams : public IRMutator {\n    const std::map<std::string, Parameter> &replacements;\n\n    using IRMutator::visit;\n\n    void visit(const Load *op) {\n        auto i = replacements.find(op->name);\n        if (i != replacements.end()) {\n            expr = Load::make(op->type, op->name, mutate(op->index), op->image, i->second);\n        } else {\n            IRMutator::visit(op);\n        }\n    }\n\n    void visit(const Store *op) {\n        auto i = replacements.find(op->name);\n        if (i != replacements.end()) {\n            stmt = Store::make(op->name, mutate(op->value), mutate(op->index), i->second);\n        } else {\n            IRMutator::visit(op);\n        }\n    }\n\npublic:\n    ReplaceParams(const std::map<std::string, Parameter> &replacements)\n        : replacements(replacements) {}\n};\n\nStmt replace_params(Stmt s, const std::map<std::string, Parameter> &replacements) {\n    return ReplaceParams(replacements).mutate(s);\n}\n\n\nclass InjectHexagonRpc : public IRMutator {\n    std::map<std::string, Expr> state_vars;\n\n    Module device_code;\n\n    \/** Alignment info for Int(32) variables in scope, so we don't\n     * lose the information when creating Hexagon kernels. *\/\n    Scope<ModulusRemainder> alignment_info;\n\n    Expr state_var(const std::string& name, Type type) {\n        Expr& var = state_vars[name];\n        if (!var.defined()) {\n            Buffer storage(type, {}, nullptr, name + \"_buf\");\n            *(void **)storage.host_ptr() = nullptr;\n            var = Load::make(type_of<void*>(), name + \"_buf\", 0, storage, Parameter());\n        }\n        return var;\n    }\n\n    Expr state_var_ptr(const std::string& name, Type type) {\n        Expr var = state_var(name, type);\n        return Call::make(Handle(), Call::address_of, {var}, Call::Intrinsic);\n    }\n\n    Expr module_state() {\n        return state_var(\"hexagon_module_state\", type_of<void*>());\n    }\n\n    Expr module_state_ptr() {\n        return state_var_ptr(\"hexagon_module_state\", type_of<void*>());\n    }\n\n    \/\/ Create a Buffer containing the given buffer\/size, and return an\n    \/\/ expression for a pointer to the first element.\n    Expr buffer_ptr(const uint8_t* buffer, size_t size, const char* name) {\n        Buffer code(type_of<uint8_t>(), {(int)size}, nullptr, name);\n        memcpy(code.host_ptr(), buffer, (int)size);\n\n        Expr ptr_0 = Load::make(type_of<uint8_t>(), name, 0, code, Parameter());\n        return Call::make(Handle(), Call::address_of, {ptr_0}, Call::Intrinsic);\n    }\n\n    Stmt call_extern_and_assert(const std::string& name, const std::vector<Expr>& args) {\n        Expr call = Call::make(Int(32), name, args, Call::Extern);\n        string call_result_name = unique_name(name + \"_result\");\n        Expr call_result_var = Variable::make(Int(32), call_result_name);\n        return LetStmt::make(call_result_name, call,\n                             AssertStmt::make(EQ::make(call_result_var, 0), call_result_var));\n    }\n\n    using IRMutator::visit;\n\n    void visit(const For *loop) {\n        if (loop->device_api == DeviceAPI::Hexagon) {\n            \/\/ Unrolling or loop partitioning might generate multiple\n            \/\/ loops with the same name, so we need to make them unique.\n            std::string hex_name = unique_name(\"hex_\" + loop->name);\n\n            \/\/ After moving this to Hexagon, it doesn't need to be\n            \/\/ marked Hexagon anymore.\n            Stmt body = For::make(loop->name, loop->min, loop->extent, loop->for_type,\n                                  DeviceAPI::None, loop->body);\n            body = remove_trivial_for_loops(body);\n\n            \/\/ Build a closure for the device code.\n            \/\/ TODO: Should this move the body of the loop to Hexagon,\n            \/\/ or the loop itself? Currently, this moves the loop itself.\n            Closure c(body);\n\n            \/\/ Make an argument list, and generate a function in the\n            \/\/ device_code module. The hexagon runtime code expects\n            \/\/ the arguments to appear in the order of (input buffers,\n            \/\/ output buffers, input scalars).  Scalars must be last\n            \/\/ for the scalar arguments to shadow the symbols of the\n            \/\/ buffer that get generated by CodeGen_LLVM.\n            std::vector<LoweredArgument> input_buffers, output_buffers;\n            std::map<std::string, Parameter> replacement_params;\n            for (const auto& i : c.buffers) {\n                if (i.second.write) {\n                    Argument::Kind kind = Argument::OutputBuffer;\n                    output_buffers.push_back(LoweredArgument(i.first, kind, i.second.type, i.second.dimensions));\n                } else {\n                    Argument::Kind kind = Argument::InputBuffer;\n                    input_buffers.push_back(LoweredArgument(i.first, kind, i.second.type, i.second.dimensions));\n                }\n\n                \/\/ Build a parameter to replace.\n                Parameter p(i.second.type, true, i.second.dimensions);\n                \/\/ Assert that buffers are aligned to one HVX vector.\n                const int alignment = 128;\n                p.set_host_alignment(alignment);\n                \/\/ The other parameter constraints are already\n                \/\/ accounted for by the closure grabbing those\n                \/\/ arguments, so we only need to provide the host\n                \/\/ alignment.\n                replacement_params[i.first] = p;\n\n                \/\/ Add an assert to the body that validates the\n                \/\/ alignment of the buffer.\n                if (!device_code.target().has_feature(Target::NoAsserts)) {\n                    Expr host_ptr = reinterpret<uint64_t>(Variable::make(Handle(), i.first + \".host\"));\n                    Expr error = Call::make(Int(32), \"halide_error_unaligned_host_ptr\",\n                                            {i.first, alignment}, Call::Extern);\n                    body = Block::make(AssertStmt::make(host_ptr % alignment == 0, error), body);\n                }\n            }\n            body = replace_params(body, replacement_params);\n\n            std::vector<LoweredArgument> args;\n            args.insert(args.end(), input_buffers.begin(), input_buffers.end());\n            args.insert(args.end(), output_buffers.begin(), output_buffers.end());\n            for (const auto& i : c.vars) {\n                LoweredArgument arg(i.first, Argument::InputScalar, i.second, 0);\n                if (alignment_info.contains(i.first)) {\n                    arg.alignment = alignment_info.get(i.first);\n                }\n                args.push_back(arg);\n            }\n            device_code.append(LoweredFunc(hex_name, args, body, LoweredFunc::External));\n\n            \/\/ Generate a call to hexagon_device_run.\n            std::vector<Expr> arg_sizes;\n            std::vector<Expr> arg_ptrs;\n            std::vector<Expr> arg_flags;\n\n            for (const auto& i : c.buffers) {\n                arg_sizes.push_back(Expr((uint64_t) sizeof(buffer_t*)));\n                arg_ptrs.push_back(Variable::make(type_of<buffer_t *>(), i.first + \".buffer\"));\n                \/\/ In the flags parameter, bit 0 set indicates the\n                \/\/ buffer is read, bit 1 set indicates the buffer is\n                \/\/ written. If neither are set, the argument is a scalar.\n                int flags = 0;\n                if (i.second.read) flags |= 0x1;\n                if (i.second.write) flags |= 0x2;\n                arg_flags.push_back(flags);\n            }\n            for (const auto& i : c.vars) {\n                Expr arg = Variable::make(i.second, i.first);\n                Expr arg_ptr = Call::make(type_of<void *>(), Call::make_struct, {arg}, Call::Intrinsic);\n\n                \/\/ sizeof(scalar-type) will always fit into int32\n                arg_sizes.push_back(Expr((uint64_t) i.second.bytes()));\n                arg_ptrs.push_back(arg_ptr);\n                arg_flags.push_back(0x0);\n            }\n\n            \/\/ The argument list is terminated with an argument of size 0.\n            arg_sizes.push_back(Expr((uint64_t) 0));\n\n            std::string pipeline_name = hex_name + \"_argv\";\n            std::vector<Expr> params;\n            params.push_back(module_state());\n            params.push_back(pipeline_name);\n            params.push_back(state_var_ptr(hex_name, type_of<int>()));\n            params.push_back(Call::make(type_of<size_t*>(), Call::make_struct, arg_sizes, Call::Intrinsic));\n            params.push_back(Call::make(type_of<void**>(), Call::make_struct, arg_ptrs, Call::Intrinsic));\n            params.push_back(Call::make(type_of<int*>(), Call::make_struct, arg_flags, Call::Intrinsic));\n\n            stmt = call_extern_and_assert(\"halide_hexagon_run\", params);\n\n        } else {\n            IRMutator::visit(loop);\n        }\n    }\n\n    void visit(const Let *op) {\n        if (op->value.type() == Int(32)) {\n            alignment_info.push(op->name, modulus_remainder(op->value, alignment_info));\n        }\n\n        IRMutator::visit(op);\n\n        if (op->value.type() == Int(32)) {\n            alignment_info.pop(op->name);\n        }\n    }\n\n    void visit(const LetStmt *op) {\n        if (op->value.type() == Int(32)) {\n            alignment_info.push(op->name, modulus_remainder(op->value, alignment_info));\n        }\n\n        IRMutator::visit(op);\n\n        if (op->value.type() == Int(32)) {\n            alignment_info.pop(op->name);\n        }\n    }\n\npublic:\n    InjectHexagonRpc(const Target &target) : device_code(\"hexagon\", target) {}\n\n    Stmt inject(Stmt s) {\n        s = mutate(s);\n\n        \/\/ Skip if there are no device kernels.\n        if (device_code.functions().empty()) {\n            return s;\n        }\n\n        \/\/ Compile the device code.\n        \/\/ TODO: Currently, this requires shelling out to\n        \/\/ hexagon-clang from the Qualcomm Hexagon SDK, because the\n        \/\/ Hexagon LLVM target is not fully open source yet. When the\n        \/\/ LLVM Hexagon target is fully open sourced, we can instead\n        \/\/ just compile the module to an object, and find a way to\n        \/\/ link it to a shared object.\n        TemporaryFile tmp_bitcode(\"hex\", \".bc\");\n        TemporaryFile tmp_shared_object(\"hex\", \".so\");\n        debug(1) << \"Hexagon device code module: \" << device_code << \"\\n\";\n        device_code.compile(Outputs().bitcode(tmp_bitcode.pathname()));\n\n        string hex_command;\n\n        const char *path = getenv(\"HL_HEXAGON_CLANG\");\n        if (path && path[0]) {\n            hex_command = path;\n        } else {\n            path = getenv(\"HL_HEXAGON_TOOLS\");\n            if (path && path[0]) {\n                hex_command = string(path) + \"\/bin\/hexagon-clang\";\n            } else {\n                user_error << \"Unable to find hexagon-clang: neither HL_HEXAGON_CLANG nor HL_HEXAGON_TOOLS are set properly.\";\n            }\n        }\n\n        hex_command += \" \";\n        hex_command += tmp_bitcode.pathname();\n        hex_command += \" -fPIC -O3 -Wno-override-module -shared \";\n        if (device_code.target().has_feature(Target::HVX_v62)) {\n            hex_command += \" -mv62\";\n        }\n        if (device_code.target().has_feature(Target::HVX_128)) {\n            hex_command += \" -mhvx-double\";\n        }\n        hex_command += \" -o \" + tmp_shared_object.pathname();\n        int result = system(hex_command.c_str());\n        internal_assert(result == 0) << \"hexagon-clang failed\\n\";\n\n        std::ifstream so(tmp_shared_object.pathname(), std::ios::binary | std::ios::ate);\n        internal_assert(so.good()) << \"failed to open temporary shared object.\";\n        std::vector<uint8_t> object(so.tellg());\n        so.seekg(0, std::ios::beg);\n        so.read(reinterpret_cast<char*>(&object[0]), object.size());\n\n        \/\/ Put the compiled object into a buffer.\n        size_t code_size = object.size();\n        Expr code_ptr = buffer_ptr(&object[0], code_size, \"hexagon_code\");\n\n        \/\/ Wrap the statement in calls to halide_initialize_kernels.\n        Stmt init_kernels = call_extern_and_assert(\"halide_hexagon_initialize_kernels\",\n                                                   {module_state_ptr(), code_ptr, Expr((uint64_t) code_size)});\n        s = Block::make(init_kernels, s);\n\n        return s;\n    }\n};\n\n}\n\nStmt inject_hexagon_rpc(Stmt s, const Target &host_target) {\n    \/\/ Make a new target for the device module.\n    Target target(Target::NoOS, Target::Hexagon, 32);\n\n    \/\/ These feature flags are propagated from the host target to the\n    \/\/ device module.\n    static const Target::Feature shared_features[] = {\n        Target::Debug,\n        Target::NoAsserts,\n        Target::HVX_64,\n        Target::HVX_128,\n        Target::HVX_v62\n    };\n    for (Target::Feature i : shared_features) {\n        if (host_target.has_feature(i)) {\n            target = target.with_feature(i);\n        }\n    }\n\n    InjectHexagonRpc injector(target);\n    s = injector.inject(s);\n    return s;\n}\n\n}  \/\/ namespace Internal\n}  \/\/ namespace Halide\n<commit_msg>paper over differences between hexagon-clang and trunk llvm<commit_after>#include <iostream>\n#include <fstream>\n#include <memory>\n\n#include \"HexagonOffload.h\"\n#include \"IRMutator.h\"\n#include \"Substitute.h\"\n#include \"Closure.h\"\n#include \"Param.h\"\n#include \"Image.h\"\n#include \"LLVM_Output.h\"\n#include \"RemoveTrivialForLoops.h\"\n#include \"LLVM_Headers.h\"\n\nnamespace Halide {\nnamespace Internal {\n\nusing std::string;\nusing std::vector;\n\nnamespace {\n\n\/\/ Replace the parameter objects of loads\/stores with a new parameter\n\/\/ object.\nclass ReplaceParams : public IRMutator {\n    const std::map<std::string, Parameter> &replacements;\n\n    using IRMutator::visit;\n\n    void visit(const Load *op) {\n        auto i = replacements.find(op->name);\n        if (i != replacements.end()) {\n            expr = Load::make(op->type, op->name, mutate(op->index), op->image, i->second);\n        } else {\n            IRMutator::visit(op);\n        }\n    }\n\n    void visit(const Store *op) {\n        auto i = replacements.find(op->name);\n        if (i != replacements.end()) {\n            stmt = Store::make(op->name, mutate(op->value), mutate(op->index), i->second);\n        } else {\n            IRMutator::visit(op);\n        }\n    }\n\npublic:\n    ReplaceParams(const std::map<std::string, Parameter> &replacements)\n        : replacements(replacements) {}\n};\n\nStmt replace_params(Stmt s, const std::map<std::string, Parameter> &replacements) {\n    return ReplaceParams(replacements).mutate(s);\n}\n\n\nclass InjectHexagonRpc : public IRMutator {\n    std::map<std::string, Expr> state_vars;\n\n    Module device_code;\n\n    \/** Alignment info for Int(32) variables in scope, so we don't\n     * lose the information when creating Hexagon kernels. *\/\n    Scope<ModulusRemainder> alignment_info;\n\n    Expr state_var(const std::string& name, Type type) {\n        Expr& var = state_vars[name];\n        if (!var.defined()) {\n            Buffer storage(type, {}, nullptr, name + \"_buf\");\n            *(void **)storage.host_ptr() = nullptr;\n            var = Load::make(type_of<void*>(), name + \"_buf\", 0, storage, Parameter());\n        }\n        return var;\n    }\n\n    Expr state_var_ptr(const std::string& name, Type type) {\n        Expr var = state_var(name, type);\n        return Call::make(Handle(), Call::address_of, {var}, Call::Intrinsic);\n    }\n\n    Expr module_state() {\n        return state_var(\"hexagon_module_state\", type_of<void*>());\n    }\n\n    Expr module_state_ptr() {\n        return state_var_ptr(\"hexagon_module_state\", type_of<void*>());\n    }\n\n    \/\/ Create a Buffer containing the given buffer\/size, and return an\n    \/\/ expression for a pointer to the first element.\n    Expr buffer_ptr(const uint8_t* buffer, size_t size, const char* name) {\n        Buffer code(type_of<uint8_t>(), {(int)size}, nullptr, name);\n        memcpy(code.host_ptr(), buffer, (int)size);\n\n        Expr ptr_0 = Load::make(type_of<uint8_t>(), name, 0, code, Parameter());\n        return Call::make(Handle(), Call::address_of, {ptr_0}, Call::Intrinsic);\n    }\n\n    Stmt call_extern_and_assert(const std::string& name, const std::vector<Expr>& args) {\n        Expr call = Call::make(Int(32), name, args, Call::Extern);\n        string call_result_name = unique_name(name + \"_result\");\n        Expr call_result_var = Variable::make(Int(32), call_result_name);\n        return LetStmt::make(call_result_name, call,\n                             AssertStmt::make(EQ::make(call_result_var, 0), call_result_var));\n    }\n\n    using IRMutator::visit;\n\n    void visit(const For *loop) {\n        if (loop->device_api == DeviceAPI::Hexagon) {\n            \/\/ Unrolling or loop partitioning might generate multiple\n            \/\/ loops with the same name, so we need to make them unique.\n            std::string hex_name = unique_name(\"hex_\" + loop->name);\n\n            \/\/ After moving this to Hexagon, it doesn't need to be\n            \/\/ marked Hexagon anymore.\n            Stmt body = For::make(loop->name, loop->min, loop->extent, loop->for_type,\n                                  DeviceAPI::None, loop->body);\n            body = remove_trivial_for_loops(body);\n\n            \/\/ Build a closure for the device code.\n            \/\/ TODO: Should this move the body of the loop to Hexagon,\n            \/\/ or the loop itself? Currently, this moves the loop itself.\n            Closure c(body);\n\n            \/\/ Make an argument list, and generate a function in the\n            \/\/ device_code module. The hexagon runtime code expects\n            \/\/ the arguments to appear in the order of (input buffers,\n            \/\/ output buffers, input scalars).  Scalars must be last\n            \/\/ for the scalar arguments to shadow the symbols of the\n            \/\/ buffer that get generated by CodeGen_LLVM.\n            std::vector<LoweredArgument> input_buffers, output_buffers;\n            std::map<std::string, Parameter> replacement_params;\n            for (const auto& i : c.buffers) {\n                if (i.second.write) {\n                    Argument::Kind kind = Argument::OutputBuffer;\n                    output_buffers.push_back(LoweredArgument(i.first, kind, i.second.type, i.second.dimensions));\n                } else {\n                    Argument::Kind kind = Argument::InputBuffer;\n                    input_buffers.push_back(LoweredArgument(i.first, kind, i.second.type, i.second.dimensions));\n                }\n\n                \/\/ Build a parameter to replace.\n                Parameter p(i.second.type, true, i.second.dimensions);\n                \/\/ Assert that buffers are aligned to one HVX vector.\n                const int alignment = 128;\n                p.set_host_alignment(alignment);\n                \/\/ The other parameter constraints are already\n                \/\/ accounted for by the closure grabbing those\n                \/\/ arguments, so we only need to provide the host\n                \/\/ alignment.\n                replacement_params[i.first] = p;\n\n                \/\/ Add an assert to the body that validates the\n                \/\/ alignment of the buffer.\n                if (!device_code.target().has_feature(Target::NoAsserts)) {\n                    Expr host_ptr = reinterpret<uint64_t>(Variable::make(Handle(), i.first + \".host\"));\n                    Expr error = Call::make(Int(32), \"halide_error_unaligned_host_ptr\",\n                                            {i.first, alignment}, Call::Extern);\n                    body = Block::make(AssertStmt::make(host_ptr % alignment == 0, error), body);\n                }\n            }\n            body = replace_params(body, replacement_params);\n\n            std::vector<LoweredArgument> args;\n            args.insert(args.end(), input_buffers.begin(), input_buffers.end());\n            args.insert(args.end(), output_buffers.begin(), output_buffers.end());\n            for (const auto& i : c.vars) {\n                LoweredArgument arg(i.first, Argument::InputScalar, i.second, 0);\n                if (alignment_info.contains(i.first)) {\n                    arg.alignment = alignment_info.get(i.first);\n                }\n                args.push_back(arg);\n            }\n            device_code.append(LoweredFunc(hex_name, args, body, LoweredFunc::External));\n\n            \/\/ Generate a call to hexagon_device_run.\n            std::vector<Expr> arg_sizes;\n            std::vector<Expr> arg_ptrs;\n            std::vector<Expr> arg_flags;\n\n            for (const auto& i : c.buffers) {\n                arg_sizes.push_back(Expr((uint64_t) sizeof(buffer_t*)));\n                arg_ptrs.push_back(Variable::make(type_of<buffer_t *>(), i.first + \".buffer\"));\n                \/\/ In the flags parameter, bit 0 set indicates the\n                \/\/ buffer is read, bit 1 set indicates the buffer is\n                \/\/ written. If neither are set, the argument is a scalar.\n                int flags = 0;\n                if (i.second.read) flags |= 0x1;\n                if (i.second.write) flags |= 0x2;\n                arg_flags.push_back(flags);\n            }\n            for (const auto& i : c.vars) {\n                Expr arg = Variable::make(i.second, i.first);\n                Expr arg_ptr = Call::make(type_of<void *>(), Call::make_struct, {arg}, Call::Intrinsic);\n\n                \/\/ sizeof(scalar-type) will always fit into int32\n                arg_sizes.push_back(Expr((uint64_t) i.second.bytes()));\n                arg_ptrs.push_back(arg_ptr);\n                arg_flags.push_back(0x0);\n            }\n\n            \/\/ The argument list is terminated with an argument of size 0.\n            arg_sizes.push_back(Expr((uint64_t) 0));\n\n            std::string pipeline_name = hex_name + \"_argv\";\n            std::vector<Expr> params;\n            params.push_back(module_state());\n            params.push_back(pipeline_name);\n            params.push_back(state_var_ptr(hex_name, type_of<int>()));\n            params.push_back(Call::make(type_of<size_t*>(), Call::make_struct, arg_sizes, Call::Intrinsic));\n            params.push_back(Call::make(type_of<void**>(), Call::make_struct, arg_ptrs, Call::Intrinsic));\n            params.push_back(Call::make(type_of<int*>(), Call::make_struct, arg_flags, Call::Intrinsic));\n\n            stmt = call_extern_and_assert(\"halide_hexagon_run\", params);\n\n        } else {\n            IRMutator::visit(loop);\n        }\n    }\n\n    void visit(const Let *op) {\n        if (op->value.type() == Int(32)) {\n            alignment_info.push(op->name, modulus_remainder(op->value, alignment_info));\n        }\n\n        IRMutator::visit(op);\n\n        if (op->value.type() == Int(32)) {\n            alignment_info.pop(op->name);\n        }\n    }\n\n    void visit(const LetStmt *op) {\n        if (op->value.type() == Int(32)) {\n            alignment_info.push(op->name, modulus_remainder(op->value, alignment_info));\n        }\n\n        IRMutator::visit(op);\n\n        if (op->value.type() == Int(32)) {\n            alignment_info.pop(op->name);\n        }\n    }\n\npublic:\n    InjectHexagonRpc(const Target &target) : device_code(\"hexagon\", target) {}\n\n    Stmt inject(Stmt s) {\n        s = mutate(s);\n\n        \/\/ Skip if there are no device kernels.\n        if (device_code.functions().empty()) {\n            return s;\n        }\n\n        \/\/ Compile the device code.\n        \/\/ TODO: Currently, this requires shelling out to\n        \/\/ hexagon-clang from the Qualcomm Hexagon SDK, because the\n        \/\/ Hexagon LLVM target is not fully open source yet. When the\n        \/\/ LLVM Hexagon target is fully open sourced, we can instead\n        \/\/ just compile the module to an object, and find a way to\n        \/\/ link it to a shared object.\n        debug(1) << \"Hexagon device code module: \" << device_code << \"\\n\";\n\n        \/\/ First compile the module to an llvm module\n        llvm::LLVMContext context;\n        std::unique_ptr<llvm::Module> llvm_module =\n            compile_module_to_llvm_module(device_code, context);\n\n        #if LLVM_VERSION >= 39\n        \/\/ Then mess with it, to fix up version differences between\n        \/\/ our LLVM and hexagon-clang. Yuck.\n        for (auto &gv : llvm_module->globals()) {\n            \/\/ hexagon-clang doesn't understand the local_unnamed_addr\n            \/\/ attribute, so we must strip it.\n            gv.setUnnamedAddr(llvm::GlobalValue::UnnamedAddr::None);\n        }\n        for (auto &fn : llvm_module->functions()) {\n            fn.setUnnamedAddr(llvm::GlobalValue::UnnamedAddr::None);\n        }\n        #endif\n\n        \/\/ Dump the llvm module to a temp file as .ll\n        TemporaryFile tmp_bitcode(\"hex\", \".ll\");\n        TemporaryFile tmp_shared_object(\"hex\", \".so\");\n        std::unique_ptr<llvm::raw_fd_ostream> ostream =\n            make_raw_fd_ostream(tmp_bitcode.pathname());\n        compile_llvm_module_to_llvm_assembly(*llvm_module, *ostream);\n        ostream->flush();\n\n        \/\/ Shell out to hexagon clang to compile it.\n        string hex_command;\n\n        const char *path = getenv(\"HL_HEXAGON_CLANG\");\n        if (path && path[0]) {\n            hex_command = path;\n        } else {\n            path = getenv(\"HL_HEXAGON_TOOLS\");\n            if (path && path[0]) {\n                hex_command = string(path) + \"\/bin\/hexagon-clang\";\n            } else {\n                user_error << \"Unable to find hexagon-clang: neither HL_HEXAGON_CLANG nor HL_HEXAGON_TOOLS are set properly.\";\n            }\n        }\n\n        hex_command += \" \";\n        hex_command += tmp_bitcode.pathname();\n        hex_command += \" -fPIC -O3 -Wno-override-module -shared \";\n        if (device_code.target().has_feature(Target::HVX_v62)) {\n            hex_command += \" -mv62\";\n        }\n        if (device_code.target().has_feature(Target::HVX_128)) {\n            hex_command += \" -mhvx-double\";\n        }\n        hex_command += \" -o \" + tmp_shared_object.pathname();\n        int result = system(hex_command.c_str());\n        internal_assert(result == 0) << \"hexagon-clang failed\\n\";\n\n        \/\/ Read the compiled object back in and put it in a buffer in the module\n        std::ifstream so(tmp_shared_object.pathname(), std::ios::binary | std::ios::ate);\n        internal_assert(so.good()) << \"failed to open temporary shared object.\";\n        std::vector<uint8_t> object(so.tellg());\n        so.seekg(0, std::ios::beg);\n        so.read(reinterpret_cast<char*>(&object[0]), object.size());\n\n        size_t code_size = object.size();\n        Expr code_ptr = buffer_ptr(&object[0], code_size, \"hexagon_code\");\n\n        \/\/ Wrap the statement in calls to halide_initialize_kernels.\n        Stmt init_kernels = call_extern_and_assert(\"halide_hexagon_initialize_kernels\",\n                                                   {module_state_ptr(), code_ptr, Expr((uint64_t) code_size)});\n        s = Block::make(init_kernels, s);\n\n        return s;\n    }\n};\n\n}\n\nStmt inject_hexagon_rpc(Stmt s, const Target &host_target) {\n    \/\/ Make a new target for the device module.\n    Target target(Target::NoOS, Target::Hexagon, 32);\n\n    \/\/ These feature flags are propagated from the host target to the\n    \/\/ device module.\n    \/\/\n    \/\/ TODO: We'd like Target::Debug to be in this list too, but trunk\n    \/\/ llvm currently disagrees with hexagon clang as to what\n    \/\/ constitutes valid debug info.\n    static const Target::Feature shared_features[] = {\n        Target::NoAsserts,\n        Target::HVX_64,\n        Target::HVX_128,\n        Target::HVX_v62\n    };\n    for (Target::Feature i : shared_features) {\n        if (host_target.has_feature(i)) {\n            target = target.with_feature(i);\n        }\n    }\n\n    InjectHexagonRpc injector(target);\n    s = injector.inject(s);\n    return s;\n}\n\n}  \/\/ namespace Internal\n}  \/\/ namespace Halide\n<|endoftext|>"}
{"text":"<commit_before>#include \"JenkinsManager.h\"\n#include <qjson\/parser.h>\n#include <qjson\/qobjecthelper.h>\n#include \"HttpPort.h\"\n\nJenkinsManager::JenkinsManager(QObject *parent)\n  : BaseJenkinsManager(parent)\n{\n}\n\nJenkinsManager::~JenkinsManager()\n{\n}\n\nQString JenkinsManager::makeJsonUrl(const QString &url)\n{\n  \/\/ append \/api\/json to access JSON interface of Jenkins\/Hudson\n  QString jsonUrl(url);\n  QString path = \"\/api\/json\";\n\n  if (!url.endsWith(path, Qt::CaseInsensitive))\n  {\n    if (!url.endsWith(\"\/\"))\n    {\n      jsonUrl += path;\n    }\n    else\n    {\n      \/\/ append path without first slash\n      jsonUrl += path.mid(1);\n    }\n  }\n\n  return jsonUrl;\n}\n\nbool JenkinsManager::parseJsonData(const QByteArray &data)\n{\n  if (data.isEmpty())\n  {\n    \/\/ no data, done\n    return true;\n  }\n\n  \/\/ parse JSON data\n  QJson::Parser parser;\n  bool ok;\n\n  QVariantMap result = parser.parse(data, &ok).toMap();\n\n  if (!ok)\n  {\n    \/\/ parse error\n    return false;\n  }\n\n  \/\/ convert to jobs and add to list\n  QList<QVariant> jobList = result[\"jobs\"].toList();\n\n  for (int i=0; i<jobList.size(); ++i)\n  {\n    QVariantMap jobMap = jobList.at(i).toMap();\n\n    JenkinsJob *job = new JenkinsJob;\n\n    QJson::QObjectHelper::qvariant2qobject(jobMap, job);\n\n    if (m_jobStatus.contains(job->name()))\n    {\n      \/\/ delete if key already exists\n      JenkinsJob *tmp = m_jobStatus.take(job->name());\n      delete tmp;\n    }\n\n    m_jobStatus[job->name()] = job;\n  }\n\n  \/\/ done\n  return true;\n}\n\nbool JenkinsManager::getStatus(const QString &url)\n{\n  m_error.clear();\n\n  \/\/ clear job list\n  clearJobs();\n\n  if (url.isEmpty())\n  {\n    \/\/ nothing to do\n    return true;\n  }\n\n  if (m_httpPort == NULL)\n  {\n    m_error = tr(\"No HTTP port set\");\n\n    return false;\n  }\n\n  \/\/ make JSON url\n  QString jsonUrl = makeJsonUrl(url);\n\n  \/\/ get data\n  bool getOk = m_httpPort->get(QUrl(jsonUrl));\n\n  if (getOk)\n  {\n    \/\/ get data and parse\n    QByteArray jsonData = m_httpPort->data().toUtf8();\n\n    \/\/ parse JSON data\n    bool parseOk = parseJsonData(jsonData);\n\n    if (!parseOk)\n    {\n      \/\/ parsing failed\n      m_error = tr(\"Cannot parse JSON data\");\n\n      return false;\n    }\n  }\n  else\n  {\n    \/\/ error getting data\n    m_error = m_httpPort->error();\n\n    return false;\n  }\n\n  return true;\n}\n\nQScriptValue jenkinsManagerConstructor(QScriptContext *context,\n  QScriptEngine *engine)\n{\n  \/\/ parent of new object is in context\n  QObject *parent = context->argument(0).toQObject();\n\n  \/\/ create new JenkinsManager object\n  QObject *object = new JenkinsManager(parent);\n\n  \/\/ pass object to script\n  return engine->newQObject(object, QScriptEngine::ScriptOwnership);\n}\n<commit_msg>Improved readability<commit_after>#include \"JenkinsManager.h\"\n#include <qjson\/parser.h>\n#include <qjson\/qobjecthelper.h>\n#include \"HttpPort.h\"\n\nJenkinsManager::JenkinsManager(QObject *parent)\n  : BaseJenkinsManager(parent)\n{\n}\n\nJenkinsManager::~JenkinsManager()\n{\n}\n\nQString JenkinsManager::makeJsonUrl(const QString &url)\n{\n  \/\/ append \/api\/json to access JSON interface of Jenkins\/Hudson\n  QString jsonUrl(url);\n  QString path = \"\/api\/json\";\n\n  if (!url.endsWith(path, Qt::CaseInsensitive))\n  {\n    if (!url.endsWith(\"\/\"))\n    {\n      jsonUrl += path;\n    }\n    else\n    {\n      \/\/ append path without first slash\n      jsonUrl += path.mid(1);\n    }\n  }\n\n  return jsonUrl;\n}\n\nbool JenkinsManager::parseJsonData(const QByteArray &data)\n{\n  if (data.isEmpty())\n  {\n    \/\/ no data, done\n    return true;\n  }\n\n  \/\/ parse JSON data\n  QJson::Parser parser;\n  bool ok;\n\n  QVariantMap result = parser.parse(data, &ok).toMap();\n\n  if (!ok)\n  {\n    \/\/ parse error\n    return false;\n  }\n\n  \/\/ convert to jobs and add to list\n  QList<QVariant> jobList = result[\"jobs\"].toList();\n\n  for (int i = 0; i < jobList.size(); ++i)\n  {\n    QVariantMap jobMap = jobList.at(i).toMap();\n\n    JenkinsJob *job = new JenkinsJob;\n\n    QJson::QObjectHelper::qvariant2qobject(jobMap, job);\n\n    if (m_jobStatus.contains(job->name()))\n    {\n      \/\/ delete if key already exists\n      JenkinsJob *tmp = m_jobStatus.take(job->name());\n      delete tmp;\n    }\n\n    m_jobStatus[job->name()] = job;\n  }\n\n  \/\/ done\n  return true;\n}\n\nbool JenkinsManager::getStatus(const QString &url)\n{\n  m_error.clear();\n\n  \/\/ clear job list\n  clearJobs();\n\n  if (url.isEmpty())\n  {\n    \/\/ nothing to do\n    return true;\n  }\n\n  if (m_httpPort == NULL)\n  {\n    m_error = tr(\"No HTTP port set\");\n\n    return false;\n  }\n\n  \/\/ make JSON url\n  QString jsonUrl = makeJsonUrl(url);\n\n  \/\/ get data\n  bool getOk = m_httpPort->get(QUrl(jsonUrl));\n\n  if (getOk)\n  {\n    \/\/ get data and parse\n    QByteArray jsonData = m_httpPort->data().toUtf8();\n\n    \/\/ parse JSON data\n    bool parseOk = parseJsonData(jsonData);\n\n    if (!parseOk)\n    {\n      \/\/ parsing failed\n      m_error = tr(\"Cannot parse JSON data\");\n\n      return false;\n    }\n  }\n  else\n  {\n    \/\/ error getting data\n    m_error = m_httpPort->error();\n\n    return false;\n  }\n\n  return true;\n}\n\nQScriptValue jenkinsManagerConstructor(QScriptContext *context,\n  QScriptEngine *engine)\n{\n  \/\/ parent of new object is in context\n  QObject *parent = context->argument(0).toQObject();\n\n  \/\/ create new JenkinsManager object\n  QObject *object = new JenkinsManager(parent);\n\n  \/\/ pass object to script\n  return engine->newQObject(object, QScriptEngine::ScriptOwnership);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n NUI3 - C++ cross-platform GUI framework for OpenGL based applications\n  Copyright (C) 2002-2003 Sebastien Metrot\n\n  licence: see nui3\/LICENCE.TXT\n*\/\n\n#include \"nui.h\"\n#include \"nuiVBox.h\"\n\nnuiVBox::nuiVBox(uint32 nbcells)\n: nuiBox(1, nbcells)\n{\n  if (SetObjectClass(_T(\"nuiVBox\")))\n    InitAttributes();\n  \n  \/\/mpGrid = new nuiGrid(1, nbcells);\n  \/\/AddChild(mpGrid);\n  \/\/nuiGrid::SetProperty(_T(\"Name\"), _T(\"nuiVBox::Grid\"));\n\n}\n\n\nnuiVBox::~nuiVBox()\n{\n}\n\n\nvoid nuiVBox::InitAttributes()\n{\n  InitBoxAttributes();\n\n  \/\/ VerticalSpacing in \"common sens\" corresponds to DefaultHSpacing in \"nuiGrid sens\". It's better for css understanding\n  AddAttribute(new nuiAttribute<nuiSize>\n   (nglString(_T(\"VerticalSpacing\")), nuiUnitSize,\n    nuiAttribute<nuiSize>::GetterDelegate(this, &nuiVBox::GetDefaultSpacing),\n    nuiAttribute<nuiSize>::SetterDelegate(this, &nuiVBox::SetDefaultSpacing)));                \n\n  \/\/ Spacing is a shorcut for VerticalSpacing, in nuiVBox\n  AddAttribute(new nuiAttribute<nuiSize>\n   (nglString(_T(\"Spacing\")), nuiUnitSize,\n    nuiAttribute<nuiSize>::GetterDelegate(this, &nuiVBox::GetDefaultSpacing),\n    nuiAttribute<nuiSize>::SetterDelegate(this, &nuiVBox::SetDefaultSpacing)));                \n       \n}\n\n  \nvoid nuiVBox::DisplayGridBorder(bool enable, nuiSize gridBorderSize)\n{\n  nuiGrid::DisplayGridBorder(enable, gridBorderSize);\n}\n\n\nvoid nuiVBox::DisplayWidgetBoundingRect(bool enable)\n{\n  nuiGrid::DisplayWidgetBoundingRect(enable);\n}\n\n\n\nvoid nuiVBox::PlaceInvisibleWidgets(bool enable)\n{\n  nuiGrid::PlaceInvisibleWidgets(enable);\n}\n\n\n  \nbool nuiVBox::SetCell(uint32 cell, nuiWidget* pWidget, nuiPosition position, bool ReplaceExisting, bool TrashExisting)\n{\n  return nuiGrid::SetCell(0, cell, pWidget, position, ReplaceExisting, TrashExisting);\n\n}\n\n\n\nvoid nuiVBox::SetCellPosition(uint32 cell, nuiPosition position)\n{\n  nuiGrid::SetCellPosition(0, cell, position);\n}\n\n\n\nbool nuiVBox::FindCell(nuiWidgetPtr pWidget, uint& rCell) const\n{\n  uint32 col;\n  return nuiGrid::FindCell(pWidget, col, rCell);\n}\n\n\n\nvoid nuiVBox::ClearCells(bool trash)\n{\n  nuiGrid::ClearCells(trash);\n}\n\n\n\nnuiWidget* nuiVBox::GetCell(uint32 cell) const\n{\n  return nuiGrid::GetCell(0, cell);\n}\n\n\n\n  \/\/ Cells settings:\nvoid nuiVBox::SetCellSpacing(uint32 cell, nuiSize vgap)\n{\n  nuiGrid::SetRowSpacing(cell, vgap);\n}\n\nvoid nuiVBox::SetAllCellsSpacing(nuiSize gap)\n{\n  for (uint32 i = 0; i < GetNbCells(); i++)\n  {\n    SetCellSpacing (i, gap);\n  }\n}\n\n\nvoid nuiVBox::SetBoxSpacing(nuiSize hgap)\n{\n  nuiGrid::SetColumnSpacing(0, hgap);\n}\n\nvoid nuiVBox::SetBoxSize(uint32 cells)\n{\n  nuiGrid::SetGridSize(1, cells);\n}\n\n\n\nvoid nuiVBox::SetCellExpand(uint32 cell, nuiExpandMode mode, nuiSize ratio)\n{\n  nuiGrid::SetRowExpand(cell, mode, ratio);\n}\n\nvoid nuiVBox::SetAllCellsExpand(nuiExpandMode mode)\n{\n  for (uint32 i = 0; i < GetNbCells(); i++)\n  {\n     nuiGrid::SetRowExpand(i, mode);\n  }\n}\n\n\nvoid nuiVBox::SetExpand(nuiExpandMode mode, nuiSize ratio)\n{\n  nuiGrid::SetColumnExpand(0, mode, ratio);\n}\n\n  \nvoid nuiVBox::SetCellMaxGrow(uint32 cell, nuiSize ratio)\n{\n  nuiGrid::SetRowMaxGrow(cell, ratio);\n}\n\n\n\nvoid nuiVBox::SetCellMaxPixels(uint32 cell, nuiSize size)\n{\n  nuiGrid::SetRowMaxPixels(cell, size);\n}\n\n\n\n    \nvoid nuiVBox::SetCellMaxShrink(uint32 cell, nuiSize ratio)\n{\n  nuiGrid::SetRowMaxShrink(cell, ratio);\n}\n\n\n\nvoid nuiVBox::SetCellMinPixels(uint32 cell, nuiSize size)\n{\n  nuiGrid::SetRowMinPixels(cell, size);\n}\n\n\n\n  \n  \/\/ Corresponding Getters:\nnuiSize nuiVBox::GetCellSpacing(uint32 cell) const\n{\n  return nuiGrid::GetRowSpacing(cell);\n}\n\n\nnuiSize nuiVBox::GetCellGrowRatio(uint32 cell) const\n{\n  return nuiGrid::GetRowGrowRatio(cell);\n}\n\n\n\nnuiSize nuiVBox::GetCellShrinkRatio(uint32 cell) const\n{\n  return nuiGrid::GetRowShrinkRatio(cell);\n}\n\n\n\n\nnuiSize nuiVBox::GetCellMaxGrow(uint32 cell) const\n{\n  return nuiGrid::GetRowMaxGrow(cell);\n}\n\n\n\nnuiSize nuiVBox::GetCellMaxPixels(uint32 cell) const\n{\n  return nuiGrid::GetRowMaxPixels(cell);\n}\n\n\n\n\nnuiSize nuiVBox::GetCellMaxShrink(uint32 cell) const\n{\n  return nuiGrid::GetRowMaxShrink(cell);\n}\n\n\n\nnuiSize nuiVBox::GetCellMinPixels(uint32 cell) const\n{\n  return nuiGrid::GetRowMinPixels(cell);\n}\n\n\n\n\nvoid nuiVBox::AddCells(uint32 pos, uint32 cells)\n{\n  nuiGrid::AddRows(pos, cells);\n}\n\nvoid nuiVBox::AddCell(nuiWidget* pWidget, nuiPosition position)\n{\n  uint32 pos = nuiGrid::GetNbRows();\n  nuiGrid::AddRows(pos, 1);\n  if (GetNbColumns() == 0)\n    nuiGrid::AddColumns(0,1);\n  \n  nuiGrid::SetCell(0, pos, pWidget, position); \n}\n\n\nvoid nuiVBox::RemoveCells(uint32 pos, uint32 cells)\n{\n  nuiGrid::RemoveRows(pos, cells);\n}\n\n\nuint32 nuiVBox::GetNbCells() const\n{\n  return nuiGrid::GetNbRows();\n}  \n\nbool nuiVBox::Clear(bool Delete)\n{\n  bool res = Clear(Delete);\n  nuiGrid::AddColumns(0,1);\n  return res;\n}\n\nnuiSize nuiVBox::GetDefaultSpacing() const\n{\n  return nuiGrid::GetDefaultHSpacing();\n}\n\nvoid nuiVBox::SetDefaultSpacing(nuiSize set)\n{\n  nuiGrid::SetDefaultHSpacing(set);\n}\n\n\nvoid nuiVBox::SetCellPixels(uint32 row, nuiSize size)\n{\n  nuiGrid::SetRowPixels(row, size);\n}\n\nvoid nuiVBox::ResetCellPixels(uint32 row)\n{\n  nuiGrid::ResetRowPixels(row);\n}\n\n\n\nvoid nuiVBox::SetSize(nuiSize size)\n{\n  nuiGrid::SetColumnPixels(0, size);\n}\n\nnuiSize nuiVBox::GetCellPixels(uint32 cell) const\n{\n  return nuiGrid::GetRowPixels(cell);\n}\n\n\n\n<commit_msg>fixes recursive call to Clear<commit_after>\/*\n NUI3 - C++ cross-platform GUI framework for OpenGL based applications\n  Copyright (C) 2002-2003 Sebastien Metrot\n\n  licence: see nui3\/LICENCE.TXT\n*\/\n\n#include \"nui.h\"\n#include \"nuiVBox.h\"\n\nnuiVBox::nuiVBox(uint32 nbcells)\n: nuiBox(1, nbcells)\n{\n  if (SetObjectClass(_T(\"nuiVBox\")))\n    InitAttributes();\n  \n  \/\/mpGrid = new nuiGrid(1, nbcells);\n  \/\/AddChild(mpGrid);\n  \/\/nuiGrid::SetProperty(_T(\"Name\"), _T(\"nuiVBox::Grid\"));\n\n}\n\n\nnuiVBox::~nuiVBox()\n{\n}\n\n\nvoid nuiVBox::InitAttributes()\n{\n  InitBoxAttributes();\n\n  \/\/ VerticalSpacing in \"common sens\" corresponds to DefaultHSpacing in \"nuiGrid sens\". It's better for css understanding\n  AddAttribute(new nuiAttribute<nuiSize>\n   (nglString(_T(\"VerticalSpacing\")), nuiUnitSize,\n    nuiAttribute<nuiSize>::GetterDelegate(this, &nuiVBox::GetDefaultSpacing),\n    nuiAttribute<nuiSize>::SetterDelegate(this, &nuiVBox::SetDefaultSpacing)));                \n\n  \/\/ Spacing is a shorcut for VerticalSpacing, in nuiVBox\n  AddAttribute(new nuiAttribute<nuiSize>\n   (nglString(_T(\"Spacing\")), nuiUnitSize,\n    nuiAttribute<nuiSize>::GetterDelegate(this, &nuiVBox::GetDefaultSpacing),\n    nuiAttribute<nuiSize>::SetterDelegate(this, &nuiVBox::SetDefaultSpacing)));                \n       \n}\n\n  \nvoid nuiVBox::DisplayGridBorder(bool enable, nuiSize gridBorderSize)\n{\n  nuiGrid::DisplayGridBorder(enable, gridBorderSize);\n}\n\n\nvoid nuiVBox::DisplayWidgetBoundingRect(bool enable)\n{\n  nuiGrid::DisplayWidgetBoundingRect(enable);\n}\n\n\n\nvoid nuiVBox::PlaceInvisibleWidgets(bool enable)\n{\n  nuiGrid::PlaceInvisibleWidgets(enable);\n}\n\n\n  \nbool nuiVBox::SetCell(uint32 cell, nuiWidget* pWidget, nuiPosition position, bool ReplaceExisting, bool TrashExisting)\n{\n  return nuiGrid::SetCell(0, cell, pWidget, position, ReplaceExisting, TrashExisting);\n\n}\n\n\n\nvoid nuiVBox::SetCellPosition(uint32 cell, nuiPosition position)\n{\n  nuiGrid::SetCellPosition(0, cell, position);\n}\n\n\n\nbool nuiVBox::FindCell(nuiWidgetPtr pWidget, uint& rCell) const\n{\n  uint32 col;\n  return nuiGrid::FindCell(pWidget, col, rCell);\n}\n\n\n\nvoid nuiVBox::ClearCells(bool trash)\n{\n  nuiGrid::ClearCells(trash);\n}\n\n\n\nnuiWidget* nuiVBox::GetCell(uint32 cell) const\n{\n  return nuiGrid::GetCell(0, cell);\n}\n\n\n\n  \/\/ Cells settings:\nvoid nuiVBox::SetCellSpacing(uint32 cell, nuiSize vgap)\n{\n  nuiGrid::SetRowSpacing(cell, vgap);\n}\n\nvoid nuiVBox::SetAllCellsSpacing(nuiSize gap)\n{\n  for (uint32 i = 0; i < GetNbCells(); i++)\n  {\n    SetCellSpacing (i, gap);\n  }\n}\n\n\nvoid nuiVBox::SetBoxSpacing(nuiSize hgap)\n{\n  nuiGrid::SetColumnSpacing(0, hgap);\n}\n\nvoid nuiVBox::SetBoxSize(uint32 cells)\n{\n  nuiGrid::SetGridSize(1, cells);\n}\n\n\n\nvoid nuiVBox::SetCellExpand(uint32 cell, nuiExpandMode mode, nuiSize ratio)\n{\n  nuiGrid::SetRowExpand(cell, mode, ratio);\n}\n\nvoid nuiVBox::SetAllCellsExpand(nuiExpandMode mode)\n{\n  for (uint32 i = 0; i < GetNbCells(); i++)\n  {\n     nuiGrid::SetRowExpand(i, mode);\n  }\n}\n\n\nvoid nuiVBox::SetExpand(nuiExpandMode mode, nuiSize ratio)\n{\n  nuiGrid::SetColumnExpand(0, mode, ratio);\n}\n\n  \nvoid nuiVBox::SetCellMaxGrow(uint32 cell, nuiSize ratio)\n{\n  nuiGrid::SetRowMaxGrow(cell, ratio);\n}\n\n\n\nvoid nuiVBox::SetCellMaxPixels(uint32 cell, nuiSize size)\n{\n  nuiGrid::SetRowMaxPixels(cell, size);\n}\n\n\n\n    \nvoid nuiVBox::SetCellMaxShrink(uint32 cell, nuiSize ratio)\n{\n  nuiGrid::SetRowMaxShrink(cell, ratio);\n}\n\n\n\nvoid nuiVBox::SetCellMinPixels(uint32 cell, nuiSize size)\n{\n  nuiGrid::SetRowMinPixels(cell, size);\n}\n\n\n\n  \n  \/\/ Corresponding Getters:\nnuiSize nuiVBox::GetCellSpacing(uint32 cell) const\n{\n  return nuiGrid::GetRowSpacing(cell);\n}\n\n\nnuiSize nuiVBox::GetCellGrowRatio(uint32 cell) const\n{\n  return nuiGrid::GetRowGrowRatio(cell);\n}\n\n\n\nnuiSize nuiVBox::GetCellShrinkRatio(uint32 cell) const\n{\n  return nuiGrid::GetRowShrinkRatio(cell);\n}\n\n\n\n\nnuiSize nuiVBox::GetCellMaxGrow(uint32 cell) const\n{\n  return nuiGrid::GetRowMaxGrow(cell);\n}\n\n\n\nnuiSize nuiVBox::GetCellMaxPixels(uint32 cell) const\n{\n  return nuiGrid::GetRowMaxPixels(cell);\n}\n\n\n\n\nnuiSize nuiVBox::GetCellMaxShrink(uint32 cell) const\n{\n  return nuiGrid::GetRowMaxShrink(cell);\n}\n\n\n\nnuiSize nuiVBox::GetCellMinPixels(uint32 cell) const\n{\n  return nuiGrid::GetRowMinPixels(cell);\n}\n\n\n\n\nvoid nuiVBox::AddCells(uint32 pos, uint32 cells)\n{\n  nuiGrid::AddRows(pos, cells);\n}\n\nvoid nuiVBox::AddCell(nuiWidget* pWidget, nuiPosition position)\n{\n  uint32 pos = nuiGrid::GetNbRows();\n  nuiGrid::AddRows(pos, 1);\n  if (GetNbColumns() == 0)\n    nuiGrid::AddColumns(0,1);\n  \n  nuiGrid::SetCell(0, pos, pWidget, position); \n}\n\n\nvoid nuiVBox::RemoveCells(uint32 pos, uint32 cells)\n{\n  nuiGrid::RemoveRows(pos, cells);\n}\n\n\nuint32 nuiVBox::GetNbCells() const\n{\n  return nuiGrid::GetNbRows();\n}  \n\nbool nuiVBox::Clear(bool Delete)\n{\n  bool res = nuiGrid::Clear(Delete);\n  nuiGrid::AddColumns(0,1);\n  return res;\n}\n\nnuiSize nuiVBox::GetDefaultSpacing() const\n{\n  return nuiGrid::GetDefaultHSpacing();\n}\n\nvoid nuiVBox::SetDefaultSpacing(nuiSize set)\n{\n  nuiGrid::SetDefaultHSpacing(set);\n}\n\n\nvoid nuiVBox::SetCellPixels(uint32 row, nuiSize size)\n{\n  nuiGrid::SetRowPixels(row, size);\n}\n\nvoid nuiVBox::ResetCellPixels(uint32 row)\n{\n  nuiGrid::ResetRowPixels(row);\n}\n\n\n\nvoid nuiVBox::SetSize(nuiSize size)\n{\n  nuiGrid::SetColumnPixels(0, size);\n}\n\nnuiSize nuiVBox::GetCellPixels(uint32 cell) const\n{\n  return nuiGrid::GetRowPixels(cell);\n}\n\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Vehicles.cpp\n\/\/\n\/\/ Copyright (c) 2001-2005 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n#include \"vtlib\/vtlib.h\"\n#include \"vtlib\/core\/Roads.h\"\n#include \"vtlib\/core\/TerrainScene.h\"\n#include \"CarEngine.h\"\n#include \"Engines.h\"\n#include \"Hawaii.h\"\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ helpers\n\nvoid ConvertPurpleToColor(vtGroupBase *pModel, RGBf replace)\n{\n#if 0\n\tRGBf color;\n\tint i;\n\n\tvtGeom *pShape;\n\tvtMaterialArray *pMats;\n\tvtMaterial *pMat;\n\n\t\/\/ TODO\n\t\/\/ walk down through a part of the scene graph, converting\n\t\/\/ any geometry encountered\n\tif (pModel->m_pModel->IsClass(vtGeom))\n\t{\n\t\tpShape = (vtGeom *)pModel;\n\t\tbool has_purple = false;\n\t\tpMats = pShape->GetMaterials();\n\t\tif (!pMats)\n\t\t\treturn;\n\t\tfor (i = 0; i < pMats->GetSize(); i++)\n\t\t{\n\t\t\tpMat = pMats->GetAt(i);\n\n\t\t\t\/\/ is purple?\n\t\t\tcolor = pMat->GetDiffuse();\n\t\t\tif (color.r == 1.0f && color.g == 0.0f && color.b == 1.0f)\n\t\t\t{\n\t\t\t\thas_purple = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (has_purple)\n\t\t{\n\t\t\tvtMaterialArray *pMats2 = new vtMaterialArray;\n\t\t\tpMats2->CopyFrom(pMats);\n\t\t\tpShape->SetMaterials(pMats2);\n\t\t\tpMats2->Release();\n\t\t\tfor (i = 0; i < pMats2->GetSize(); i++)\n\t\t\t{\n\t\t\t\tpMat = pMats2->GetAt(i);\n\t\t\t\tif (!pMat) continue;\n\t\t\t\tcolor = pMat->GetDiffuse();\n\t\t\t\tif (color.r == 1.0f && color.g == 0.0f && color.b == 1.0f)\n\t\t\t\t{\n\t\t\t\t\tvtMaterial *pMat2 = new vtMaterial;\n\t\t\t\t\tpMat2->Copy(pMat);\n\t\t\t\t\tpMats2->SetAt(i, pMat2);\n\t\t\t\t\tpMat2->SetDiffuse2(replace);\n\t\t\t\t\tpMat2->SetAmbient2(replace*0.6f);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor (i = 0; i < pModel->GetNumChildren(); i++)\n\t{\n\t\tvtTransform *pChild = (vtTransform *) pModel->GetChild(i);\n\t\tConvertPurpleToColor(pChild, replace);\n\t}\n#endif\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nVehicleManager::VehicleManager()\n{\n\tm_pFirstVehicleType = NULL;\n\tm_bAttemptedVehicleLoad = false;\n}\n\nVehicleManager::~VehicleManager()\n{\n\tReleaseVehicles();\n}\n\nvoid VehicleManager::AddVehicleType(VehicleType *vt)\n{\n\tvt->m_pNext = m_pFirstVehicleType;\n\tm_pFirstVehicleType = vt;\n}\n\n\nvoid VehicleManager::SetupVehicles()\n{\n\tvtString fname;\n\n\tfname = FindFileOnPaths(vtGetDataPath(), \"Vehicles\/bronco\/bronco.ive\");\n\tif (fname != \"\")\n\t{\n\t\t\/\/ the bronco is modeled in centimeters (0.01)\n\t\tVehicleType *bronco = new VehicleType(\"bronco\");\n\t\tbronco->AddModel(fname, 0.3048f, 500);\n\t\tAddVehicleType(bronco);\n\t}\n\/*\n\tfname = FindFileOnPaths(vtGetDataPath(), \"Vehicles\/discovery\/discovery_LOD01.3ds\");\n\tif (fname != \"\")\n\t{\n\t\t\/\/ the discovery is modeled in centimeters (0.01)\n\t\tVehicleType *discovery = new VehicleType(\"discovery\");\n\t\tfname = FindFileOnPaths(vtGetDataPath(), \"Vehicles\/discovery\/discovery_LOD01.3ds\");\n\t\tdiscovery->AddModel(fname, 0.01f, 50);\n\t\tfname = FindFileOnPaths(vtGetDataPath(), \"Vehicles\/discovery\/discovery_LOD02.3ds\");\n\t\tdiscovery->AddModel(fname, 0.01f, 100);\n\t\tfname = FindFileOnPaths(vtGetDataPath(), \"Vehicles\/discovery\/discovery_LOD03.3ds\");\n\t\tdiscovery->AddModel(fname, 0.01f, 200);\n\t\tfname = FindFileOnPaths(vtGetDataPath(), \"Vehicles\/discovery\/discovery_LOD04.3ds\");\n\t\tdiscovery->AddModel(fname, 0.01f, 500);\n\t\tAddVehicleType(discovery);\n\t}\n*\/\n\tfname = FindFileOnPaths(vtGetDataPath(), \"Vehicles\/hele-on\/hele-on.ive\");\n\tif (fname != \"\")\n\t{\n\t\t\/\/ the bus is modeled in centimeters (0.01)\n\t\tVehicleType *hele_on = new VehicleType(\"bus\");\n\t\thele_on->AddModel(fname, 1.00f, 800);\n\t\tAddVehicleType(hele_on);\n\t}\n\n\t\/\/ the 747 is modeled in meters (1.0)\n\tfname = FindFileOnPaths(vtGetDataPath(), \"Vehicles\/747\/747-lod00.ive\");\n\tif (fname != \"\")\n\t{\n\t\tVehicleType *b747 = new VehicleType(\"747\");\n\t\tfname = FindFileOnPaths(vtGetDataPath(), \"Vehicles\/747\/747-lod00.ive\");\n\t\tb747->AddModel(fname, 1.0f, 200);\n\t\tfname = FindFileOnPaths(vtGetDataPath(), \"Vehicles\/747\/747-lod01.ive\");\n\t\tb747->AddModel(fname, 1.0f, 2000);\n\t\tfname = FindFileOnPaths(vtGetDataPath(), \"Vehicles\/747\/747-lod02.ive\");\n\t\tb747->AddModel(fname, 1.0f, 20000);\n\t\tAddVehicleType(b747);\n\t}\n}\n\nvoid VehicleManager::ReleaseVehicles()\n{\n\tVehicleType *vt, *next;\n\tfor (vt = m_pFirstVehicleType; vt; vt=next)\n\t{\n\t\tnext = vt->m_pNext;\n\t\tdelete vt;\n\t}\n}\n\nVehicle *VehicleManager::CreateVehicle(const char *szType, const RGBf &cColor, float fSize)\n{\n\t\/\/if vehicles haven't been created yet...\n\tif (!m_bAttemptedVehicleLoad)\n\t{\n\t\tSetupVehicles();\n\t\tm_bAttemptedVehicleLoad = true;\n\t}\n\n\tfor (VehicleType *vt = m_pFirstVehicleType; vt; vt=vt->m_pNext)\n\t{\n\t\tif (!strcmp(szType, vt->m_strTypeName))\n\t\t\treturn vt->CreateVehicle(cColor, fSize);\n\t}\n\treturn NULL;\n}\n\n\nvoid VehicleManager::create_ground_vehicles(vtTerrain *pTerrain, float fSize, float fSpeed)\n{\n\tvtRoadMap3d *pRoadMap = pTerrain->GetRoadMap();\n\n\t\/\/ add some test vehicles\n\tNodeGeom *n = NULL;\n\tFPoint3 vNormal, center;\n\tFPoint3 start_point;\n\tint num, col;\n\tRGBf color;\n\tfor (int i = 0; i < 2; i++)\n\t{\n\t\tif (n == NULL) {\n\t\t\tn = pRoadMap->GetFirstNode();\n\t\t}\n\t\tnum = i % 3;\n\t\tcol = i % 5;\n\n\t\tswitch (col) {\n\t\tcase 0:\n\t\t\tcolor.Set(1.0f, 1.0f, 1.0f);\n\t\t\tbreak;\n\t\tcase 1:\n\t\t\tcolor.Set(1.0f, 1.0f, 0.0f);\n\t\t\tbreak;\n\t\tcase 2:\n\t\t\tcolor.Set(0.0f, 0.0f, .5f);\n\t\t\tbreak;\n\t\tcase 3:\n\t\t\tcolor.Set(1.0f, 0.0f, 0.0f);\n\t\t\tbreak;\n\t\tcase 4:\n\t\t\tcolor.Set(0.0f, .5f, 0.0f);\n\t\t\tbreak;\n\t\t}\n\n\t\tvtTransform *car=NULL;\n\t\tswitch (num) {\n\t\tcase 0:\n\t\t\tcar = CreateVehicle(\"discovery\", color, fSize);\n\t\t\tbreak;\n\t\tcase 1:\n\t\t\tcar = CreateVehicle(\"bronco\", color, fSize);\n\t\t\tbreak;\n\t\tcase 2:\n\t\t\tcar = CreateVehicle(\"bus\", color, fSize);\n\t\t\tbreak;\n\t\t}\n\t\tif (car)\n\t\t{\n\t\t\tpTerrain->AddNode(car);\n\t\t\tpTerrain->PlantModelAtPoint(car, n->m_p);\n\n\t\t\tfloat fSpeed = 60.0f;\n\t\t\tTNode *pNode = n;\n\n\t\t\tCarEngine *pE1;\n\t\t\tif (pNode == NULL)\n\t\t\t{\n\t\t\t\tpE1 = new CarEngine(car->GetTrans(),\n\t\t\t\t\tpTerrain->GetHeightField(), fSpeed, .25f);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tfloat height = pTerrain->GetParams().GetValueFloat(STR_ROADHEIGHT);\n\t\t\t\tpE1 = new CarEngine(car->GetTrans(),\n\t\t\t\t\tpTerrain->GetHeightField(), fSpeed, .25f, pNode, 1, height);\n\t\t\t}\n\t\t\tpE1->SetName2(\"drive\");\n\t\t\tpE1->SetTarget(car);\n\t\t\tif (pE1->SetTires())\n\t\t\t\tpTerrain->AddEngine(pE1);\n\t\t\telse\n\t\t\t\tdelete pE1;\n\t\t}\n\t\tn = (NodeGeom*) n->m_pNext;\n\t}\n}\n\nVehicleType::VehicleType(const char *szName)\n{\n\tm_strTypeName = szName;\n\tm_pNext = NULL;\n\tm_bAttemptedLoaded = false;\n}\n\nVehicleType::~VehicleType()\n{\n\tReleaseModels();\n}\n\nVehicle::Vehicle()\n{\n\tm_pLOD = new vtLOD;\n\tAddChild(m_pLOD);\n}\n\n\n\/\/\n\/\/ set filename and swap-out distance (in meters) for each LOD\n\/\/\nvoid VehicleType::AddModel(const char *filename, float fScale, float fDistance)\n{\n\tm_strFilename.push_back(vtString(filename));\n\tm_fScale.Append(fScale);\n\tm_fDistance.Append(fDistance);\n}\n\nvoid VehicleType::AttemptModelLoad()\n{\n\tm_bAttemptedLoaded = true;\n\n\tfor (unsigned int i = 0; i < m_strFilename.size(); i++)\n\t{\n\t\t\/\/ can we read the file?\n\t\tvtString fname = m_strFilename[i];\n\t\tif (vtNode *pMod = vtNode::LoadModel(fname))\n\t\t{\n\t\t\tvtTransform *trans = new vtTransform;\n\t\t\ttrans->AddChild(pMod);\n\n\t\t\tfloat scale = m_fScale[i];\n\t\t\ttrans->Scale3(scale, scale, scale);\n\t\t\tm_pModels.SetAt(i, trans);\n\n\t\t\t\/\/ See if I can find the top of the tyres group\n\t\t\tvtGroup *pTyres = dynamic_cast<vtGroup*>(trans->FindNativeNode(\"tires\"));\n\t\t\tvtGroup *pParent = dynamic_cast<vtGroup*>(trans->FindNativeNode(\"Scene Root\"));\n\t\t\tif ((NULL != pTyres) && (NULL != pParent))\n\t\t\t{\n\t\t\t\tm_pTyres.SetAt(i, pTyres);\n\t\t\t\tpParent->RemoveChild(pTyres);\n\/\/\t\t\t\tosgDB::writeNodeFile(*pMod->GetOsgNode(), \"debugvehicle.osg\");\n\t\t\t}\n\t\t\telse\n\t\t\t\tm_pTyres.SetAt(i, NULL);\n\t\t}\n\t}\n}\n\nVehicle *VehicleType::CreateVehicle(const RGBf &cColor, float fScale)\n{\n\t\/\/ check if it's loaded yet\n\tif (!m_bAttemptedLoaded)\n\t\tAttemptModelLoad();\n\tif (m_pModels.GetSize() == 0)\n\t\treturn NULL;\n\n\tVehicle *pNewVehicle = new Vehicle();\n\tpNewVehicle->SetName2(\"VehicleLOD-\" + m_strTypeName);\n\n\tfloat distances[10];\n\t\/\/ there is no distance at which the object should vanish for being too close\n\tdistances[0] = 0.0f;\n\n\tunsigned int iModels = m_pModels.GetSize();\n\tfor (unsigned int i = 0; i < iModels; i++)\n\t{\n\t\tvtTransform *pNewModel = (Vehicle *)m_pModels.GetAt(i)->Clone();\n\t\tpNewVehicle->AddChild(pNewModel);\n\t\tdistances[i+1] = m_fDistance.GetAt(i) * fScale;\n\n\t\t\/\/ Add in the tyre infrastructure\n\t\tvtNode* pTyres = m_pTyres.GetAt(i);\n\t\tif (NULL != pTyres)\n\t\t{\n\t\t\tvtNode *pFrontLeft;\n\t\t\tvtNode *pFrontRight;\n\t\t\tvtNode *pRearLeft;\n\t\t\tvtNode *pRearRight;\n\n\t\t\tpFrontLeft = pTyres->FindNativeNode(\"front left\");\n\t\t\tpFrontRight = pTyres->FindNativeNode(\"front right\");\n\t\t\tpRearLeft = pTyres->FindNativeNode(\"rear left\");\n\t\t\tpRearRight = pTyres->FindNativeNode(\"rear right\");\n\n\t\t\tif ((NULL != pFrontLeft) && (NULL != pFrontRight) && (NULL != pRearLeft) && (NULL != pRearRight))\n\t\t\t{\n\t\t\t\tvtGroup* pTyreGroup = new vtGroup;\n\t\t\t\tpTyreGroup->SetName2(\"tires\");\n\t\t\t\tpNewModel->AddChild(pTyreGroup);\n\t\t\t\tvtTransform *pTransform;\n\t\t\t\tpTransform = new vtTransform;\n\t\t\t\tpTransform->SetName2(\"front left\");\n\t\t\t\tpTransform->AddChild(pFrontLeft);\n\t\t\t\tpTyreGroup->AddChild(pTransform);\n\t\t\t\tpTransform = new vtTransform;\n\t\t\t\tpTransform->SetName2(\"front right\");\n\t\t\t\tpTransform->AddChild(pFrontRight);\n\t\t\t\tpTyreGroup->AddChild(pTransform);\n\t\t\t\tpTransform = new vtTransform;\n\t\t\t\tpTransform->SetName2(\"rear left\");\n\t\t\t\tpTransform->AddChild(pRearLeft);\n\t\t\t\tpTyreGroup->AddChild(pTransform);\n\t\t\t\tpTransform = new vtTransform;\n\t\t\t\tpTransform->SetName2(\"rear right\");\n\t\t\t\tpTransform->AddChild(pRearRight);\n\t\t\t\tpTyreGroup->AddChild(pTransform);\n\/\/\t\t\t\tSetDebugCallbacks(pNewVehicle->GetOsgNode());\n\t\t\t}\n\t\t}\n\t}\n\tpNewVehicle->m_pLOD->SetRanges(distances, iModels+1);\n\n\tpNewVehicle->m_fSize = fScale;\n\tConvertPurpleToColor(pNewVehicle, cColor);\n\n\treturn pNewVehicle;\n}\n\nvoid VehicleType::ReleaseModels()\n{\n\tfor (unsigned int i = 0; i < m_pModels.GetSize(); i++)\n\t{\n\t\tm_pModels[i]->Release();\n\n\t\tvtNode *pTyres = m_pTyres[i];\n\t\tif(NULL != pTyres)\n\t\t\tpTyres->Release();\n\t}\n\tm_pModels.Empty();\n\tm_pTyres.Empty();\n}\n\n<commit_msg>tweaks<commit_after>\/\/\n\/\/ Vehicles.cpp\n\/\/\n\/\/ Copyright (c) 2001-2005 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n#include \"vtlib\/vtlib.h\"\n#include \"vtlib\/core\/Roads.h\"\n#include \"vtlib\/core\/TerrainScene.h\"\n#include \"CarEngine.h\"\n#include \"Engines.h\"\n#include \"Hawaii.h\"\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ helpers\n\nvoid ConvertPurpleToColor(vtGroupBase *pModel, RGBf replace)\n{\n#if 0\n\tRGBf color;\n\tint i;\n\n\tvtGeom *pShape;\n\tvtMaterialArray *pMats;\n\tvtMaterial *pMat;\n\n\t\/\/ TODO\n\t\/\/ walk down through a part of the scene graph, converting\n\t\/\/ any geometry encountered\n\tif (pModel->m_pModel->IsClass(vtGeom))\n\t{\n\t\tpShape = (vtGeom *)pModel;\n\t\tbool has_purple = false;\n\t\tpMats = pShape->GetMaterials();\n\t\tif (!pMats)\n\t\t\treturn;\n\t\tfor (i = 0; i < pMats->GetSize(); i++)\n\t\t{\n\t\t\tpMat = pMats->GetAt(i);\n\n\t\t\t\/\/ is purple?\n\t\t\tcolor = pMat->GetDiffuse();\n\t\t\tif (color.r == 1.0f && color.g == 0.0f && color.b == 1.0f)\n\t\t\t{\n\t\t\t\thas_purple = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (has_purple)\n\t\t{\n\t\t\tvtMaterialArray *pMats2 = new vtMaterialArray;\n\t\t\tpMats2->CopyFrom(pMats);\n\t\t\tpShape->SetMaterials(pMats2);\n\t\t\tpMats2->Release();\n\t\t\tfor (i = 0; i < pMats2->GetSize(); i++)\n\t\t\t{\n\t\t\t\tpMat = pMats2->GetAt(i);\n\t\t\t\tif (!pMat) continue;\n\t\t\t\tcolor = pMat->GetDiffuse();\n\t\t\t\tif (color.r == 1.0f && color.g == 0.0f && color.b == 1.0f)\n\t\t\t\t{\n\t\t\t\t\tvtMaterial *pMat2 = new vtMaterial;\n\t\t\t\t\tpMat2->Copy(pMat);\n\t\t\t\t\tpMats2->SetAt(i, pMat2);\n\t\t\t\t\tpMat2->SetDiffuse2(replace);\n\t\t\t\t\tpMat2->SetAmbient2(replace*0.6f);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor (i = 0; i < pModel->GetNumChildren(); i++)\n\t{\n\t\tvtTransform *pChild = (vtTransform *) pModel->GetChild(i);\n\t\tConvertPurpleToColor(pChild, replace);\n\t}\n#endif\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nVehicleManager::VehicleManager()\n{\n\tm_pFirstVehicleType = NULL;\n\tm_bAttemptedVehicleLoad = false;\n}\n\nVehicleManager::~VehicleManager()\n{\n\tReleaseVehicles();\n}\n\nvoid VehicleManager::AddVehicleType(VehicleType *vt)\n{\n\tvt->m_pNext = m_pFirstVehicleType;\n\tm_pFirstVehicleType = vt;\n}\n\n\nvoid VehicleManager::SetupVehicles()\n{\n\tvtString fname;\n\n\tfname = FindFileOnPaths(vtGetDataPath(), \"Vehicles\/bronco\/bronco.ive\");\n\tif (fname != \"\")\n\t{\n\t\t\/\/ the bronco is modeled in centimeters (0.01)\n\t\tVehicleType *bronco = new VehicleType(\"bronco\");\n\t\tbronco->AddModel(fname, 0.3048f, 500);\n\t\tAddVehicleType(bronco);\n\t}\n\/*\n\tfname = FindFileOnPaths(vtGetDataPath(), \"Vehicles\/discovery\/discovery_LOD01.3ds\");\n\tif (fname != \"\")\n\t{\n\t\t\/\/ the discovery is modeled in centimeters (0.01)\n\t\tVehicleType *discovery = new VehicleType(\"discovery\");\n\t\tfname = FindFileOnPaths(vtGetDataPath(), \"Vehicles\/discovery\/discovery_LOD01.3ds\");\n\t\tdiscovery->AddModel(fname, 0.01f, 50);\n\t\tfname = FindFileOnPaths(vtGetDataPath(), \"Vehicles\/discovery\/discovery_LOD02.3ds\");\n\t\tdiscovery->AddModel(fname, 0.01f, 100);\n\t\tfname = FindFileOnPaths(vtGetDataPath(), \"Vehicles\/discovery\/discovery_LOD03.3ds\");\n\t\tdiscovery->AddModel(fname, 0.01f, 200);\n\t\tfname = FindFileOnPaths(vtGetDataPath(), \"Vehicles\/discovery\/discovery_LOD04.3ds\");\n\t\tdiscovery->AddModel(fname, 0.01f, 500);\n\t\tAddVehicleType(discovery);\n\t}\n*\/\n\tfname = FindFileOnPaths(vtGetDataPath(), \"Vehicles\/hele-on\/hele-on.ive\");\n\tif (fname != \"\")\n\t{\n\t\t\/\/ the bus is modeled in centimeters (0.01)\n\t\tVehicleType *hele_on = new VehicleType(\"bus\");\n\t\thele_on->AddModel(fname, 1.00f, 800);\n\t\tAddVehicleType(hele_on);\n\t}\n\n\t\/\/ the 747 is modeled in meters (1.0)\n\tfname = FindFileOnPaths(vtGetDataPath(), \"Vehicles\/747\/747-lod00.ive\");\n\tif (fname != \"\")\n\t{\n\t\tVehicleType *b747 = new VehicleType(\"747\");\n\t\tfname = FindFileOnPaths(vtGetDataPath(), \"Vehicles\/747\/747-lod00.ive\");\n\t\tb747->AddModel(fname, 1.0f, 200);\n\t\tfname = FindFileOnPaths(vtGetDataPath(), \"Vehicles\/747\/747-lod01.ive\");\n\t\tb747->AddModel(fname, 1.0f, 2000);\n\t\tfname = FindFileOnPaths(vtGetDataPath(), \"Vehicles\/747\/747-lod02.ive\");\n\t\tb747->AddModel(fname, 1.0f, 20000);\n\t\tAddVehicleType(b747);\n\t}\n}\n\nvoid VehicleManager::ReleaseVehicles()\n{\n\tVehicleType *vt, *next;\n\tfor (vt = m_pFirstVehicleType; vt; vt=next)\n\t{\n\t\tnext = vt->m_pNext;\n\t\tdelete vt;\n\t}\n}\n\nVehicle *VehicleManager::CreateVehicle(const char *szType, const RGBf &cColor, float fSize)\n{\n\t\/\/if vehicles haven't been created yet...\n\tif (!m_bAttemptedVehicleLoad)\n\t{\n\t\tSetupVehicles();\n\t\tm_bAttemptedVehicleLoad = true;\n\t}\n\n\tfor (VehicleType *vt = m_pFirstVehicleType; vt; vt=vt->m_pNext)\n\t{\n\t\tif (!strcmp(szType, vt->m_strTypeName))\n\t\t\treturn vt->CreateVehicle(cColor, fSize);\n\t}\n\treturn NULL;\n}\n\n\nvoid VehicleManager::create_ground_vehicles(vtTerrain *pTerrain, float fSize, float fSpeed)\n{\n\tvtRoadMap3d *pRoadMap = pTerrain->GetRoadMap();\n\n\t\/\/ add some test vehicles\n\tNodeGeom *n = NULL;\n\tFPoint3 vNormal, center;\n\tFPoint3 start_point;\n\tint num, col;\n\tRGBf color;\n\tfor (int i = 0; i < 2; i++)\n\t{\n\t\tif (n == NULL) {\n\t\t\tn = pRoadMap->GetFirstNode();\n\t\t}\n\t\tnum = i % 3;\n\t\tcol = i % 5;\n\n\t\tswitch (col) {\n\t\tcase 0:\n\t\t\tcolor.Set(1.0f, 1.0f, 1.0f);\n\t\t\tbreak;\n\t\tcase 1:\n\t\t\tcolor.Set(1.0f, 1.0f, 0.0f);\n\t\t\tbreak;\n\t\tcase 2:\n\t\t\tcolor.Set(0.0f, 0.0f, .5f);\n\t\t\tbreak;\n\t\tcase 3:\n\t\t\tcolor.Set(1.0f, 0.0f, 0.0f);\n\t\t\tbreak;\n\t\tcase 4:\n\t\t\tcolor.Set(0.0f, .5f, 0.0f);\n\t\t\tbreak;\n\t\t}\n\n\t\tvtTransform *car=NULL;\n\t\tswitch (num) {\n\t\tcase 0:\n\t\t\tcar = CreateVehicle(\"discovery\", color, fSize);\n\t\t\tbreak;\n\t\tcase 1:\n\t\t\tcar = CreateVehicle(\"bronco\", color, fSize);\n\t\t\tbreak;\n\t\tcase 2:\n\t\t\tcar = CreateVehicle(\"bus\", color, fSize);\n\t\t\tbreak;\n\t\t}\n\t\tif (car)\n\t\t{\n\t\t\tpTerrain->AddNode(car);\n\t\t\tpTerrain->PlantModelAtPoint(car, n->m_p);\n\n\t\t\tfloat fSpeed = 60.0f;\n\t\t\tTNode *pNode = n;\n\n\t\t\tCarEngine *pE1;\n\t\t\tif (pNode == NULL)\n\t\t\t{\n\t\t\t\tpE1 = new CarEngine(car->GetTrans(),\n\t\t\t\t\tpTerrain->GetHeightField(), fSpeed, .25f);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tfloat height = pTerrain->GetParams().GetValueFloat(STR_ROADHEIGHT);\n\t\t\t\tpE1 = new CarEngine(car->GetTrans(),\n\t\t\t\t\tpTerrain->GetHeightField(), fSpeed, .25f, pNode, 1, height);\n\t\t\t}\n\t\t\tpE1->SetName2(\"drive\");\n\t\t\tpE1->SetTarget(car);\n\t\t\tif (pE1->SetTires())\n\t\t\t\tpTerrain->AddEngine(pE1);\n\t\t\telse\n\t\t\t\tdelete pE1;\n\t\t}\n\t\tn = (NodeGeom*) n->m_pNext;\n\t}\n}\n\nVehicleType::VehicleType(const char *szName)\n{\n\tm_strTypeName = szName;\n\tm_pNext = NULL;\n\tm_bAttemptedLoaded = false;\n}\n\nVehicleType::~VehicleType()\n{\n\tReleaseModels();\n}\n\nVehicle::Vehicle()\n{\n\tm_pLOD = new vtLOD;\n\tAddChild(m_pLOD);\n}\n\n\n\/\/\n\/\/ set filename and swap-out distance (in meters) for each LOD\n\/\/\nvoid VehicleType::AddModel(const char *filename, float fScale, float fDistance)\n{\n\tm_strFilename.push_back(vtString(filename));\n\tm_fScale.Append(fScale);\n\tm_fDistance.Append(fDistance);\n}\n\nvoid VehicleType::AttemptModelLoad()\n{\n\tm_bAttemptedLoaded = true;\n\n\tfor (unsigned int i = 0; i < m_strFilename.size(); i++)\n\t{\n\t\t\/\/ can we read the file?\n\t\tvtString fname = m_strFilename[i];\n\t\tif (vtNode *pMod = vtNode::LoadModel(fname))\n\t\t{\n\t\t\tvtTransform *trans = new vtTransform;\n\t\t\ttrans->AddChild(pMod);\n\n\t\t\tfloat scale = m_fScale[i];\n\t\t\ttrans->Scale3(scale, scale, scale);\n\t\t\tm_pModels.SetAt(i, trans);\n\n\t\t\t\/\/ See if I can find the top of the tyres group\n\t\t\tvtGroup *pTyres = dynamic_cast<vtGroup*>(trans->FindNativeNode(\"tires\"));\n\t\t\tvtGroup *pParent = dynamic_cast<vtGroup*>(trans->FindNativeNode(\"Scene Root\"));\n\t\t\tif ((NULL != pTyres) && (NULL != pParent))\n\t\t\t{\n\t\t\t\tm_pTyres.SetAt(i, pTyres);\n\t\t\t\tpParent->RemoveChild(pTyres);\n\/\/\t\t\t\tosgDB::writeNodeFile(*pMod->GetOsgNode(), \"debugvehicle.osg\");\n\t\t\t}\n\t\t\telse\n\t\t\t\tm_pTyres.SetAt(i, NULL);\n\t\t}\n\t}\n}\n\nVehicle *VehicleType::CreateVehicle(const RGBf &cColor, float fScale)\n{\n\t\/\/ check if it's loaded yet\n\tif (!m_bAttemptedLoaded)\n\t\tAttemptModelLoad();\n\tif (m_pModels.GetSize() == 0)\n\t\treturn NULL;\n\n\tVehicle *pNewVehicle = new Vehicle;\n\tpNewVehicle->SetName2(\"VehicleLOD-\" + m_strTypeName);\n\n\tfloat distances[10];\n\t\/\/ there is no distance at which the object should vanish for being too close\n\tdistances[0] = 0.0f;\n\n\tunsigned int iModels = m_pModels.GetSize();\n\tfor (unsigned int i = 0; i < iModels; i++)\n\t{\n\t\tvtTransform *pNewModel = (Vehicle *)m_pModels.GetAt(i)->Clone();\n\t\tpNewVehicle->AddChild(pNewModel);\n\t\tdistances[i+1] = m_fDistance.GetAt(i) * fScale;\n\n\t\t\/\/ Add in the tyre infrastructure\n\t\tvtNode* pTyres = m_pTyres.GetAt(i);\n\t\tif (NULL != pTyres)\n\t\t{\n\t\t\tvtNode *pFrontLeft = pTyres->FindNativeNode(\"front left\");\n\t\t\tvtNode *pFrontRight = pTyres->FindNativeNode(\"front right\");\n\t\t\tvtNode *pRearLeft = pTyres->FindNativeNode(\"rear left\");\n\t\t\tvtNode *pRearRight = pTyres->FindNativeNode(\"rear right\");\n\n\t\t\tif ((NULL != pFrontLeft) && (NULL != pFrontRight) && (NULL != pRearLeft) && (NULL != pRearRight))\n\t\t\t{\n\t\t\t\tvtGroup* pTyreGroup = new vtGroup;\n\t\t\t\tpTyreGroup->SetName2(\"tires\");\n\t\t\t\tpNewModel->AddChild(pTyreGroup);\n\t\t\t\tvtTransform *pTransform;\n\t\t\t\tpTransform = new vtTransform;\n\t\t\t\tpTransform->SetName2(\"front left\");\n\t\t\t\tpTransform->AddChild(pFrontLeft);\n\t\t\t\tpTyreGroup->AddChild(pTransform);\n\t\t\t\tpTransform = new vtTransform;\n\t\t\t\tpTransform->SetName2(\"front right\");\n\t\t\t\tpTransform->AddChild(pFrontRight);\n\t\t\t\tpTyreGroup->AddChild(pTransform);\n\t\t\t\tpTransform = new vtTransform;\n\t\t\t\tpTransform->SetName2(\"rear left\");\n\t\t\t\tpTransform->AddChild(pRearLeft);\n\t\t\t\tpTyreGroup->AddChild(pTransform);\n\t\t\t\tpTransform = new vtTransform;\n\t\t\t\tpTransform->SetName2(\"rear right\");\n\t\t\t\tpTransform->AddChild(pRearRight);\n\t\t\t\tpTyreGroup->AddChild(pTransform);\n\/\/\t\t\t\tSetDebugCallbacks(pNewVehicle->GetOsgNode());\n\t\t\t}\n\t\t}\n\t}\n\tpNewVehicle->m_pLOD->SetRanges(distances, iModels+1);\n\n\tpNewVehicle->m_fSize = fScale;\n\tConvertPurpleToColor(pNewVehicle, cColor);\n\n\treturn pNewVehicle;\n}\n\nvoid VehicleType::ReleaseModels()\n{\n\tfor (unsigned int i = 0; i < m_pModels.GetSize(); i++)\n\t{\n\t\tm_pModels[i]->Release();\n\n\t\tvtNode *pTyres = m_pTyres[i];\n\t\tif(NULL != pTyres)\n\t\t\tpTyres->Release();\n\t}\n\tm_pModels.Empty();\n\tm_pTyres.Empty();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Vehicles.cpp\n\/\/\n\/\/ Copyright (c) 2001 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n#include \"vtlib\/vtlib.h\"\n#include \"vtlib\/core\/Roads.h\"\n#include \"Engines.h\"\n#include \"Hawaii.h\"\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ helpers\n\nvoid ConvertPurpleToColor(vtGroupBase *pModel, RGBf replace)\n{\n#if 0\n\tRGBf color;\n\tint i;\n\n\tvtGeom *pShape;\n\tvtMaterialArray *pApps;\n\tvtMaterial *pApp;\n\n\t\/\/ TODO\n\t\/\/ walk down through a part of the scene graph, converting\n\t\/\/ any geometry encountered\n\tif (pModel->m_pModel->IsClass(vtGeom))\n\t{\n\t\tpShape = (vtGeom *)pModel;\n\t\tbool has_purple = false;\n\t\tpApps = pShape->GetMaterials();\n\t\tif (!pApps)\n\t\t\treturn;\n\t\tfor (i = 0; i < pApps->GetSize(); i++)\n\t\t{\n\t\t\tpApp = pApps->GetAt(i);\n\n\t\t\t\/\/ is purple?\n\t\t\tcolor = pApp->GetDiffuse();\n\t\t\tif (color.r == 1.0f && color.g == 0.0f && color.b == 1.0f)\n\t\t\t{\n\t\t\t\thas_purple = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (has_purple)\n\t\t{\n\t\t\tvtMaterialArray *pApps2 = new vtMaterialArray();\n\t\t\tpApps2->CopyFrom(pApps);\n\t\t\tpShape->SetMaterials(pApps2);\n\t\t\tpApps2->Release();\n\t\t\tfor (i = 0; i < pApps2->GetSize(); i++)\n\t\t\t{\n\t\t\t\tpApp = pApps2->GetAt(i);\n\t\t\t\tif (!pApp) continue;\n\t\t\t\tcolor = pApp->GetDiffuse();\n\t\t\t\tif (color.r == 1.0f && color.g == 0.0f && color.b == 1.0f)\n\t\t\t\t{\n\t\t\t\t\tvtMaterial *pApp2 = new vtMaterial();\n\t\t\t\t\tpApp2->Copy(pApp);\n\t\t\t\t\tpApps2->SetAt(i, pApp2);\n\t\t\t\t\tpApp2->SetDiffuse2(replace);\n\t\t\t\t\tpApp2->SetAmbient2(replace*0.6f);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor (i = 0; i < pModel->GetNumChildren(); i++)\n\t{\n\t\tvtTransform *pChild = (vtTransform *) pModel->GetChild(i);\n\t\tConvertPurpleToColor(pChild, replace);\n\t}\n#endif\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\nvoid PTerrain::create_ground_vehicles(float fSize, float fSpeed)\n{\n\tFPoint3 vNormal, center;\n\tFPoint3 start_point;\n\n\t\/\/ add some cars!\n\tif (m_pRoadMap)\n\t{\n\t\tNodeGeom *n = (NodeGeom*) m_pRoadMap->GetFirstNode();\n\t\tvtTransform *car;\n\t\tint num, col;\n\t\tRGBf color;\n\t\tfor (int i = 0; i < m_Params.GetValueInt(STR_NUMCARS); i++)\n\t\t{\n\t\t\tif (n == NULL) {\n\t\t\t\tn = (NodeGeom*) m_pRoadMap->GetFirstNode();\n\t\t\t}\n\t\t\tnum = i % 3;\n\t\t\tcol = i % 5;\n\n\t\t\tswitch (col) {\n\t\t\tcase 0:\n\t\t\t\tcolor.Set(1.0f, 1.0f, 1.0f);\n\t\t\t\tbreak;\n\t\t\tcase 1:\n\t\t\t\tcolor.Set(1.0f, 1.0f, 0.0f);\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\tcolor.Set(0.0f, 0.0f, .5f);\n\t\t\t\tbreak;\n\t\t\tcase 3:\n\t\t\t\tcolor.Set(1.0f, 0.0f, 0.0f);\n\t\t\t\tbreak;\n\t\t\tcase 4:\n\t\t\t\tcolor.Set(0.0f, .5f, 0.0f);\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tswitch (num) {\n\t\t\tcase 0:\n\t\t\t\tcar = CreateVehicle(\"discovery\", color, fSize);\n\t\t\t\tbreak;\n\t\t\tcase 1:\n\t\t\t\tcar = CreateVehicle(\"bronco\", color, fSize);\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\tcar = CreateVehicle(\"bus\", color, fSize);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tAddNode(car);\n\t\t\tPlantModelAtPoint(car, n->m_p);\n\t\t\tAddCarEngine(car, 60.0f, n);\n\t\t\tn = (NodeGeom*) n->m_pNext;\n\t\t}\n\t}\n}\n\nVehicleType::VehicleType(const char *szName)\n{\n\tm_strTypeName = szName;\n\tm_pNext = NULL;\n\tm_bAttemptedLoaded = false;\n}\n\nVehicleType::~VehicleType()\n{\n\tReleaseModels();\n}\n\nVehicle::Vehicle()\n{\n\tm_pLOD = new vtLOD();\n\tAddChild(m_pLOD);\n}\n\n\n\/\/\n\/\/ set filename and swap-out distance (in meters) for each LOD\n\/\/\nvoid VehicleType::AddModel(const char *filename, float fScale, float fDistance)\n{\n\tm_strFilename.push_back(vtString(filename));\n\tm_fScale.Append(fScale);\n\tm_fDistance.Append(fDistance);\n}\n\nvoid VehicleType::AttemptModelLoad()\n{\n\tm_bAttemptedLoaded = true;\n\n\tfor (unsigned int i = 0; i < m_strFilename.size(); i++)\n\t{\n\t\t\/\/ can we read the file?\n\t\tvtString fname = m_strFilename[i];\n\t\tif (vtNodeBase *pMod = vtLoadModel(fname))\n\t\t{\n\t\t\tvtTransform *trans = new vtTransform();\n\t\t\ttrans->AddChild(pMod);\n\t\t\tif (fname.Right(3).CompareNoCase(\"3ds\") == 0)\n\t\t\t{\n\t\t\t\t\/\/ Must rotate by 90 degrees for 3DS -> OpenGL (or Lightwave LWO)\n\t\t\t\ttrans->Rotate2(FPoint3(1.0f, 0.0f, 0.0f), -PID2f);\n\t\t\t}\n\t\t\tfloat scale = m_fScale[i];\n\t\t\ttrans->Scale3(scale, scale, scale);\n\t\t\tm_pModels.SetAt(i, trans);\n\t\t}\n\t}\n}\n\nVehicle *VehicleType::CreateVehicle(const RGBf &cColor, float fScale)\n{\n\t\/\/ check if it's loaded yet\n\tif (!m_bAttemptedLoaded)\n\t\tAttemptModelLoad();\n\tif (m_pModels.GetSize() == 0)\n\t\treturn NULL;\n\n\tVehicle *pNewVehicle = new Vehicle();\n\tpNewVehicle->SetName2(\"VehicleLOD-\" + m_strTypeName);\n\n\tfloat distances[10];\n\t\/\/ there is no distance at which the object should vanish for being too close\n\tdistances[0] = 0.0f;\n\n\tunsigned int iModels = m_pModels.GetSize();\n\tfor (unsigned int i = 0; i < iModels; i++)\n\t{\n\t\tvtTransform *pNewModel = (Vehicle *)m_pModels.GetAt(i)->Clone();\n\t\tpNewVehicle->AddChild(pNewModel);\n\t\tdistances[i+1] = m_fDistance.GetAt(i) * fScale;\n\t}\n\tpNewVehicle->m_pLOD->SetRanges(distances, iModels+1);\n\n\tpNewVehicle->m_fSize = fScale;\n\tConvertPurpleToColor(pNewVehicle, cColor);\n\n\treturn pNewVehicle;\n}\n\nvoid VehicleType::ReleaseModels()\n{\n\tfor (unsigned int i = 0; i < m_pModels.GetSize(); i++)\n\t{\n\t\tm_pModels[i]->Release();\n\t}\n\tm_pModels.Empty();\n}\n\n<commit_msg>chg to use vtNode::LoadModel<commit_after>\/\/\n\/\/ Vehicles.cpp\n\/\/\n\/\/ Copyright (c) 2001 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n#include \"vtlib\/vtlib.h\"\n#include \"vtlib\/core\/Roads.h\"\n#include \"Engines.h\"\n#include \"Hawaii.h\"\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ helpers\n\nvoid ConvertPurpleToColor(vtGroupBase *pModel, RGBf replace)\n{\n#if 0\n\tRGBf color;\n\tint i;\n\n\tvtGeom *pShape;\n\tvtMaterialArray *pApps;\n\tvtMaterial *pApp;\n\n\t\/\/ TODO\n\t\/\/ walk down through a part of the scene graph, converting\n\t\/\/ any geometry encountered\n\tif (pModel->m_pModel->IsClass(vtGeom))\n\t{\n\t\tpShape = (vtGeom *)pModel;\n\t\tbool has_purple = false;\n\t\tpApps = pShape->GetMaterials();\n\t\tif (!pApps)\n\t\t\treturn;\n\t\tfor (i = 0; i < pApps->GetSize(); i++)\n\t\t{\n\t\t\tpApp = pApps->GetAt(i);\n\n\t\t\t\/\/ is purple?\n\t\t\tcolor = pApp->GetDiffuse();\n\t\t\tif (color.r == 1.0f && color.g == 0.0f && color.b == 1.0f)\n\t\t\t{\n\t\t\t\thas_purple = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (has_purple)\n\t\t{\n\t\t\tvtMaterialArray *pApps2 = new vtMaterialArray();\n\t\t\tpApps2->CopyFrom(pApps);\n\t\t\tpShape->SetMaterials(pApps2);\n\t\t\tpApps2->Release();\n\t\t\tfor (i = 0; i < pApps2->GetSize(); i++)\n\t\t\t{\n\t\t\t\tpApp = pApps2->GetAt(i);\n\t\t\t\tif (!pApp) continue;\n\t\t\t\tcolor = pApp->GetDiffuse();\n\t\t\t\tif (color.r == 1.0f && color.g == 0.0f && color.b == 1.0f)\n\t\t\t\t{\n\t\t\t\t\tvtMaterial *pApp2 = new vtMaterial();\n\t\t\t\t\tpApp2->Copy(pApp);\n\t\t\t\t\tpApps2->SetAt(i, pApp2);\n\t\t\t\t\tpApp2->SetDiffuse2(replace);\n\t\t\t\t\tpApp2->SetAmbient2(replace*0.6f);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor (i = 0; i < pModel->GetNumChildren(); i++)\n\t{\n\t\tvtTransform *pChild = (vtTransform *) pModel->GetChild(i);\n\t\tConvertPurpleToColor(pChild, replace);\n\t}\n#endif\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\nvoid PTerrain::create_ground_vehicles(float fSize, float fSpeed)\n{\n\tFPoint3 vNormal, center;\n\tFPoint3 start_point;\n\n\t\/\/ add some cars!\n\tif (m_pRoadMap)\n\t{\n\t\tNodeGeom *n = (NodeGeom*) m_pRoadMap->GetFirstNode();\n\t\tvtTransform *car;\n\t\tint num, col;\n\t\tRGBf color;\n\t\tfor (int i = 0; i < m_Params.GetValueInt(STR_NUMCARS); i++)\n\t\t{\n\t\t\tif (n == NULL) {\n\t\t\t\tn = (NodeGeom*) m_pRoadMap->GetFirstNode();\n\t\t\t}\n\t\t\tnum = i % 3;\n\t\t\tcol = i % 5;\n\n\t\t\tswitch (col) {\n\t\t\tcase 0:\n\t\t\t\tcolor.Set(1.0f, 1.0f, 1.0f);\n\t\t\t\tbreak;\n\t\t\tcase 1:\n\t\t\t\tcolor.Set(1.0f, 1.0f, 0.0f);\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\tcolor.Set(0.0f, 0.0f, .5f);\n\t\t\t\tbreak;\n\t\t\tcase 3:\n\t\t\t\tcolor.Set(1.0f, 0.0f, 0.0f);\n\t\t\t\tbreak;\n\t\t\tcase 4:\n\t\t\t\tcolor.Set(0.0f, .5f, 0.0f);\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tswitch (num) {\n\t\t\tcase 0:\n\t\t\t\tcar = CreateVehicle(\"discovery\", color, fSize);\n\t\t\t\tbreak;\n\t\t\tcase 1:\n\t\t\t\tcar = CreateVehicle(\"bronco\", color, fSize);\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\tcar = CreateVehicle(\"bus\", color, fSize);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tAddNode(car);\n\t\t\tPlantModelAtPoint(car, n->m_p);\n\t\t\tAddCarEngine(car, 60.0f, n);\n\t\t\tn = (NodeGeom*) n->m_pNext;\n\t\t}\n\t}\n}\n\nVehicleType::VehicleType(const char *szName)\n{\n\tm_strTypeName = szName;\n\tm_pNext = NULL;\n\tm_bAttemptedLoaded = false;\n}\n\nVehicleType::~VehicleType()\n{\n\tReleaseModels();\n}\n\nVehicle::Vehicle()\n{\n\tm_pLOD = new vtLOD();\n\tAddChild(m_pLOD);\n}\n\n\n\/\/\n\/\/ set filename and swap-out distance (in meters) for each LOD\n\/\/\nvoid VehicleType::AddModel(const char *filename, float fScale, float fDistance)\n{\n\tm_strFilename.push_back(vtString(filename));\n\tm_fScale.Append(fScale);\n\tm_fDistance.Append(fDistance);\n}\n\nvoid VehicleType::AttemptModelLoad()\n{\n\tm_bAttemptedLoaded = true;\n\n\tfor (unsigned int i = 0; i < m_strFilename.size(); i++)\n\t{\n\t\t\/\/ can we read the file?\n\t\tvtString fname = m_strFilename[i];\n\t\tif (vtNode *pMod = vtNode::LoadModel(fname))\n\t\t{\n\t\t\tvtTransform *trans = new vtTransform();\n\t\t\ttrans->AddChild(pMod);\n\t\t\tvtString ext = GetExtension(fname, false);\n\t\t\tif (ext.CompareNoCase(\".3ds\") == 0 ||\n\t\t\t\text.CompareNoCase(\".flt\") == 0)\n\t\t\t{\n\t\t\t\t\/\/ Must rotate by 90 degrees for 3DS -> OpenGL (or Lightwave LWO)\n\t\t\t\ttrans->Rotate2(FPoint3(1.0f, 0.0f, 0.0f), -PID2f);\n\t\t\t}\n\t\t\tfloat scale = m_fScale[i];\n\t\t\ttrans->Scale3(scale, scale, scale);\n\t\t\tm_pModels.SetAt(i, trans);\n\t\t}\n\t}\n}\n\nVehicle *VehicleType::CreateVehicle(const RGBf &cColor, float fScale)\n{\n\t\/\/ check if it's loaded yet\n\tif (!m_bAttemptedLoaded)\n\t\tAttemptModelLoad();\n\tif (m_pModels.GetSize() == 0)\n\t\treturn NULL;\n\n\tVehicle *pNewVehicle = new Vehicle();\n\tpNewVehicle->SetName2(\"VehicleLOD-\" + m_strTypeName);\n\n\tfloat distances[10];\n\t\/\/ there is no distance at which the object should vanish for being too close\n\tdistances[0] = 0.0f;\n\n\tunsigned int iModels = m_pModels.GetSize();\n\tfor (unsigned int i = 0; i < iModels; i++)\n\t{\n\t\tvtTransform *pNewModel = (Vehicle *)m_pModels.GetAt(i)->Clone();\n\t\tpNewVehicle->AddChild(pNewModel);\n\t\tdistances[i+1] = m_fDistance.GetAt(i) * fScale;\n\t}\n\tpNewVehicle->m_pLOD->SetRanges(distances, iModels+1);\n\n\tpNewVehicle->m_fSize = fScale;\n\tConvertPurpleToColor(pNewVehicle, cColor);\n\n\treturn pNewVehicle;\n}\n\nvoid VehicleType::ReleaseModels()\n{\n\tfor (unsigned int i = 0; i < m_pModels.GetSize(); i++)\n\t{\n\t\tm_pModels[i]->Release();\n\t}\n\tm_pModels.Empty();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  dfa_symbol_deduplicate.cpp\n\/\/  Parse\n\/\/\n\/\/  Created by Andrew Hunter on 26\/04\/2011.\n\/\/  Copyright 2011 __MyCompanyName__. All rights reserved.\n\/\/\n\n#include \"dfa_symbol_deduplicate.h\"\n#include \"Dfa\/remapped_symbol_map.h\"\n\nusing namespace dfa;\n\nvoid test_dfa_symbol_deduplicate::run_tests() {\n    \/\/ Simple to start with\n    symbol_map has_duplicates1;\n    \n    int firstSet    = has_duplicates1.identifier_for_symbols(range<int>(0, 20));\n    int secondSet   = has_duplicates1.identifier_for_symbols(range<int>(10, 30));\n    \n    remapped_symbol_map* no_duplicates = remapped_symbol_map::deduplicate(has_duplicates1);\n    \n    int  count      = 0;\n    int  extras     = 0;\n    bool has0to10   = false;\n    bool has10to20  = false;\n    bool has20to30  = false;\n    \n    for (symbol_map::iterator it = no_duplicates->begin(); it != no_duplicates->end(); it++) {\n        count++;\n\n        remapped_symbol_map::new_symbols newSyms = no_duplicates->old_symbols(it->second);\n\n        if (it->first == range<int>(0, 10)) {\n            has0to10 = true;\n            report(\"OldSet1\", newSyms.find(firstSet) != newSyms.end() && newSyms.find(secondSet) == newSyms.end() && newSyms.size() == 1);\n        } else if (it->first == range<int>(10, 20)) {\n            has10to20 = true;\n            report(\"OldSet2\", newSyms.find(firstSet) != newSyms.end() && newSyms.find(secondSet) != newSyms.end() && newSyms.size() == 2);\n        } else if (it->first == range<int>(20, 30)) {\n            has20to30 = true;\n            report(\"OldSet3\", newSyms.find(firstSet) == newSyms.end() && newSyms.find(secondSet) != newSyms.end() && newSyms.size() == 1);\n        } else {\n            extras++;\n        }\n    }\n    \n    report(\"HasAllSets1\", has0to10 && has10to20 && has20to30);\n    report(\"NoExtras1\", extras == 0 && count == 3);\n    \n    delete no_duplicates;\n\n    \/\/ Complex cases\n    symbol_map has_duplicates2;\n    \n    firstSet    = has_duplicates2.identifier_for_symbols(range<int>(10, 20));\n    secondSet   = has_duplicates2.identifier_for_symbols(range<int>(30, 40));\n    int thirdSet   = has_duplicates2.identifier_for_symbols(range<int>(0, 50));\n    \n    no_duplicates = remapped_symbol_map::deduplicate(has_duplicates2);\n    \n    count      = 0;\n    extras     = 0;\n    has0to10   = false;\n    has10to20  = false;\n    has20to30  = false;\n    bool has30to40 = false;\n    bool has40to50 = false;\n    \n    for (symbol_map::iterator it = no_duplicates->begin(); it != no_duplicates->end(); it++) {\n        count++;\n        \n        remapped_symbol_map::new_symbols newSyms = no_duplicates->old_symbols(it->second);\n        \n        if (it->first == range<int>(0, 10)) {\n            has0to10 = true;\n            report(\"OldSet4\", newSyms.find(thirdSet) != newSyms.end() && newSyms.size() == 1);\n        } else if (it->first == range<int>(10, 20)) {\n            has10to20 = true;\n            report(\"OldSet5\", newSyms.find(firstSet) != newSyms.end() && newSyms.find(thirdSet) != newSyms.end() && newSyms.size() == 2);\n        } else if (it->first == range<int>(20, 30)) {\n            has20to30 = true;\n            report(\"OldSet6\", newSyms.find(thirdSet) != newSyms.end() && newSyms.size() == 1);\n        } else if (it->first == range<int>(30, 40)) {\n            has30to40 = true;\n            report(\"OldSet7\", newSyms.find(secondSet) != newSyms.end() && newSyms.find(thirdSet) != newSyms.end() && newSyms.size() == 2);\n        } else if (it->first == range<int>(40, 50)) {\n            has40to50 = true;\n            report(\"OldSet8\", newSyms.find(thirdSet) != newSyms.end() && newSyms.size() == 1);\n        } else {\n            extras++;\n        }\n    }\n    \n    report(\"HasAllSets2\", has0to10 && has10to20 && has20to30 && has30to40 && has40to50);\n    report(\"NoExtras2\", extras == 0 && count == 5);\n    \n    delete no_duplicates;\n}\n<commit_msg>Adjusted so this ignores the epsilon set if it's present in the remapped symbols<commit_after>\/\/\n\/\/  dfa_symbol_deduplicate.cpp\n\/\/  Parse\n\/\/\n\/\/  Created by Andrew Hunter on 26\/04\/2011.\n\/\/  Copyright 2011 __MyCompanyName__. All rights reserved.\n\/\/\n\n#include \"dfa_symbol_deduplicate.h\"\n#include \"Dfa\/remapped_symbol_map.h\"\n#include \"Dfa\/epsilon.h\"\n\nusing namespace dfa;\n\nvoid test_dfa_symbol_deduplicate::run_tests() {\n    \/\/ Simple to start with\n    symbol_map has_duplicates1;\n    \n    int firstSet    = has_duplicates1.identifier_for_symbols(range<int>(0, 20));\n    int secondSet   = has_duplicates1.identifier_for_symbols(range<int>(10, 30));\n    \n    remapped_symbol_map* no_duplicates = remapped_symbol_map::deduplicate(has_duplicates1);\n    \n    int  count      = 0;\n    int  extras     = 0;\n    bool has0to10   = false;\n    bool has10to20  = false;\n    bool has20to30  = false;\n    \n    for (symbol_map::iterator it = no_duplicates->begin(); it != no_duplicates->end(); it++) {\n        count++;\n\n        remapped_symbol_map::new_symbols newSyms = no_duplicates->old_symbols(it->second);\n\n        if (it->first == epsilon()) {\n            count--;\n        } else if (it->first == range<int>(0, 10)) {\n            has0to10 = true;\n            report(\"OldSet1\", newSyms.find(firstSet) != newSyms.end() && newSyms.find(secondSet) == newSyms.end() && newSyms.size() == 1);\n        } else if (it->first == range<int>(10, 20)) {\n            has10to20 = true;\n            report(\"OldSet2\", newSyms.find(firstSet) != newSyms.end() && newSyms.find(secondSet) != newSyms.end() && newSyms.size() == 2);\n        } else if (it->first == range<int>(20, 30)) {\n            has20to30 = true;\n            report(\"OldSet3\", newSyms.find(firstSet) == newSyms.end() && newSyms.find(secondSet) != newSyms.end() && newSyms.size() == 1);\n        } else {\n            extras++;\n        }\n    }\n    \n    report(\"HasAllSets1\", has0to10 && has10to20 && has20to30);\n    report(\"NoExtras1\", extras == 0 && count == 3);\n    \n    delete no_duplicates;\n\n    \/\/ Complex cases\n    symbol_map has_duplicates2;\n    \n    firstSet    = has_duplicates2.identifier_for_symbols(range<int>(10, 20));\n    secondSet   = has_duplicates2.identifier_for_symbols(range<int>(30, 40));\n    int thirdSet   = has_duplicates2.identifier_for_symbols(range<int>(0, 50));\n    \n    no_duplicates = remapped_symbol_map::deduplicate(has_duplicates2);\n    \n    count      = 0;\n    extras     = 0;\n    has0to10   = false;\n    has10to20  = false;\n    has20to30  = false;\n    bool has30to40 = false;\n    bool has40to50 = false;\n    \n    for (symbol_map::iterator it = no_duplicates->begin(); it != no_duplicates->end(); it++) {\n        count++;\n        \n        remapped_symbol_map::new_symbols newSyms = no_duplicates->old_symbols(it->second);\n        \n        if (it->first == epsilon()) {\n            count--;\n        } else if (it->first == range<int>(0, 10)) {\n            has0to10 = true;\n            report(\"OldSet4\", newSyms.find(thirdSet) != newSyms.end() && newSyms.size() == 1);\n        } else if (it->first == range<int>(10, 20)) {\n            has10to20 = true;\n            report(\"OldSet5\", newSyms.find(firstSet) != newSyms.end() && newSyms.find(thirdSet) != newSyms.end() && newSyms.size() == 2);\n        } else if (it->first == range<int>(20, 30)) {\n            has20to30 = true;\n            report(\"OldSet6\", newSyms.find(thirdSet) != newSyms.end() && newSyms.size() == 1);\n        } else if (it->first == range<int>(30, 40)) {\n            has30to40 = true;\n            report(\"OldSet7\", newSyms.find(secondSet) != newSyms.end() && newSyms.find(thirdSet) != newSyms.end() && newSyms.size() == 2);\n        } else if (it->first == range<int>(40, 50)) {\n            has40to50 = true;\n            report(\"OldSet8\", newSyms.find(thirdSet) != newSyms.end() && newSyms.size() == 1);\n        } else {\n            extras++;\n        }\n    }\n    \n    report(\"HasAllSets2\", has0to10 && has10to20 && has20to30 && has30to40 && has40to50);\n    report(\"NoExtras2\", extras == 0 && count == 5);\n    \n    delete no_duplicates;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"ClusterMap.hxx\"\n#include \"lb_config.hxx\"\n\nvoid\nLbClusterMap::Scan(const LbConfig &config, MyAvahiClient &avahi_client)\n{\n    for (const auto &i : config.listeners)\n        Scan(i, avahi_client);\n}\n\nvoid\nLbClusterMap::Scan(const LbTranslationHandlerConfig &config,\n                   MyAvahiClient &avahi_client)\n{\n    for (const auto &i : config.clusters)\n        Scan(*i.second, avahi_client);\n}\n\nvoid\nLbClusterMap::Scan(const LbGotoIfConfig &config, MyAvahiClient &avahi_client)\n{\n    Scan(config.destination, avahi_client);\n}\n\nvoid\nLbClusterMap::Scan(const LbBranchConfig &config, MyAvahiClient &avahi_client)\n{\n    Scan(config.fallback, avahi_client);\n\n    for (const auto &i : config.conditions)\n        Scan(i, avahi_client);\n}\n\nvoid\nLbClusterMap::Scan(const LbGotoConfig &g, MyAvahiClient &avahi_client)\n{\n    if (g.cluster != nullptr)\n        Scan(*g.cluster, avahi_client);\n\n    if (g.branch != nullptr)\n        Scan(*g.branch, avahi_client);\n\n    if (g.translation != nullptr)\n        Scan(*g.translation, avahi_client);\n}\n\nvoid\nLbClusterMap::Scan(const LbListenerConfig &config, MyAvahiClient &avahi_client)\n{\n    Scan(config.destination, avahi_client);\n}\n\nvoid\nLbClusterMap::Scan(const LbClusterConfig &config, MyAvahiClient &avahi_client)\n{\n    if (!config.HasZeroConf())\n        \/* doesn't need runtime data *\/\n        return;\n\n    auto i = clusters.find(config.name);\n    if (i != clusters.end())\n        \/* already added *\/\n        return;\n\n    clusters.emplace(std::piecewise_construct,\n                     std::forward_as_tuple(config.name),\n                     std::forward_as_tuple(config, avahi_client));\n}\n<commit_msg>lb\/ClusterMap: create LbCluster instance for non-Zeroconf clusters<commit_after>\/*\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"ClusterMap.hxx\"\n#include \"lb_config.hxx\"\n\nvoid\nLbClusterMap::Scan(const LbConfig &config, MyAvahiClient &avahi_client)\n{\n    for (const auto &i : config.listeners)\n        Scan(i, avahi_client);\n}\n\nvoid\nLbClusterMap::Scan(const LbTranslationHandlerConfig &config,\n                   MyAvahiClient &avahi_client)\n{\n    for (const auto &i : config.clusters)\n        Scan(*i.second, avahi_client);\n}\n\nvoid\nLbClusterMap::Scan(const LbGotoIfConfig &config, MyAvahiClient &avahi_client)\n{\n    Scan(config.destination, avahi_client);\n}\n\nvoid\nLbClusterMap::Scan(const LbBranchConfig &config, MyAvahiClient &avahi_client)\n{\n    Scan(config.fallback, avahi_client);\n\n    for (const auto &i : config.conditions)\n        Scan(i, avahi_client);\n}\n\nvoid\nLbClusterMap::Scan(const LbGotoConfig &g, MyAvahiClient &avahi_client)\n{\n    if (g.cluster != nullptr)\n        Scan(*g.cluster, avahi_client);\n\n    if (g.branch != nullptr)\n        Scan(*g.branch, avahi_client);\n\n    if (g.translation != nullptr)\n        Scan(*g.translation, avahi_client);\n}\n\nvoid\nLbClusterMap::Scan(const LbListenerConfig &config, MyAvahiClient &avahi_client)\n{\n    Scan(config.destination, avahi_client);\n}\n\nvoid\nLbClusterMap::Scan(const LbClusterConfig &config, MyAvahiClient &avahi_client)\n{\n    auto i = clusters.find(config.name);\n    if (i != clusters.end())\n        \/* already added *\/\n        return;\n\n    clusters.emplace(std::piecewise_construct,\n                     std::forward_as_tuple(config.name),\n                     std::forward_as_tuple(config, avahi_client));\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 libkeynote 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 <cassert>\n\n#include \"libkeynote_utils.h\"\n#include \"libkeynote_xml.h\"\n#include \"KN2Parser.h\"\n#include \"KN2Token.h\"\n#include \"KNXMLAttributeIterator.h\"\n\nnamespace libkeynote\n{\n\nnamespace\n{\n\nbool checkElement(xmlTextReaderPtr reader, const int name, const int ns, const bool start = true)\n{\n  return isElement(reader)\n         && getNamespace(reader) && (getKN2TokenID(getNamespace(reader)) == ns)\n         && (getKN2TokenID(getName(reader)) == name)\n         && (isStartElement(reader) == start);\n}\n\nunsigned getVersion(const int token)\n{\n  switch (token)\n  {\n  case KN2Token::VERSION_STR_2 :\n    return 2;\n  case KN2Token::VERSION_STR_3 :\n    return 3;\n  case KN2Token::VERSION_STR_4 :\n    return 4;\n  case KN2Token::VERSION_STR_5 :\n    return 5;\n  }\n\n  return 0;\n}\n\n}\n\nKN2Parser::KN2Parser(WPXInputStream *const input, KNCollector *const collector)\n  : KNParser(input, collector)\n  , m_version(0)\n{\n}\n\nKN2Parser::~KN2Parser()\n{\n}\n\nvoid KN2Parser::processXmlNode(xmlTextReaderPtr reader)\n{\n  assert(checkElement(reader, KN2Token::presentation, KN2Token::NS_URI_KEY));\n\n  \/\/ read attributes\n  KNXMLAttributeIterator attr(reader);\n  while (attr.next())\n  {\n    if (attr->ns)\n    {\n      switch (getKN2TokenID(attr->ns))\n      {\n      case KN2Token::NS_URI_KEY :\n        switch (getKN2TokenID(attr->name))\n        {\n        case KN2Token::all_images_bundled :\n        case KN2Token::compatible_version :\n        case KN2Token::kiosk_build_delay :\n        case KN2Token::kiosk_slide_delay :\n        case KN2Token::mode :\n        case KN2Token::play_mode :\n        case KN2Token::sticky_visibility :\n          KN_DEBUG_XML_TODO(\"attribute\", attr->name, attr->ns);\n          break;\n        case KN2Token::version :\n          m_version = getVersion(getKN2TokenID(attr->value));\n          if (0 == m_version)\n          {\n            KN_DEBUG_MSG((\"unknown version %s\\n\", attr->value));\n          }\n          break;\n        default :\n          KN_DEBUG_XML_UNKNOWN(\"attribute\", attr->name, attr->ns);\n          break;\n        }\n        break;\n      case KN2Token::NS_URI_SFA :\n        if (KN2Token::ID != getKN2TokenID(attr->name))\n        {\n          KN_DEBUG_XML_TODO(\"attribute\", attr->name, attr->ns);\n        }\n        break;\n      default :\n        KN_DEBUG_XML_UNKNOWN(\"attribute\", attr->name, attr->ns);\n        break;\n      }\n    }\n    else\n    {\n      KN_DEBUG_XML_UNKNOWN(\"attribute\", attr->name, attr->ns);\n    }\n  }\n\n  \/\/ read elements\n  while (moveToNextNode(reader))\n  {\n    const char *const name = getName(reader);\n    const char *const ns = getNamespace(reader);\n\n    if (checkElement(reader, KN2Token::presentation, KN2Token::NS_URI_KEY, false))\n      break;\n\n    if (isEndElement(reader))\n      throw GenericException();\n\n    if (ns && (KN2Token::NS_URI_KEY == getKN2TokenID(ns)))\n    {\n      switch (getKN2TokenID(name))\n      {\n      case KN2Token::size :\n      case KN2Token::theme_list :\n      case KN2Token::master_order :\n      case KN2Token::slide_list :\n      case KN2Token::ui_state :\n      case KN2Token::metadata :\n      case KN2Token::soundtrack_list :\n      case KN2Token::calculation_engine :\n      case KN2Token::calc_engine :\n      case KN2Token::version_history :\n        KN_DEBUG_XML_TODO(\"element\", name, ns);\n        skipElement(reader);\n        break;\n      }\n    }\n    else\n    {\n      KN_DEBUG_XML_UNKNOWN(\"element\", name, ns);\n      skipElement(reader);\n    }\n  }\n}\n\n}\n\n\/* vim:set shiftwidth=2 softtabstop=2 expandtab: *\/\n<commit_msg>calc-engine is in sf namespace<commit_after>\/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- *\/\n\/*\n * This file is part of the libkeynote 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 <cassert>\n\n#include \"libkeynote_utils.h\"\n#include \"libkeynote_xml.h\"\n#include \"KN2Parser.h\"\n#include \"KN2Token.h\"\n#include \"KNXMLAttributeIterator.h\"\n\nnamespace libkeynote\n{\n\nnamespace\n{\n\nbool checkElement(xmlTextReaderPtr reader, const int name, const int ns, const bool start = true)\n{\n  return isElement(reader)\n         && getNamespace(reader) && (getKN2TokenID(getNamespace(reader)) == ns)\n         && (getKN2TokenID(getName(reader)) == name)\n         && (isStartElement(reader) == start);\n}\n\nunsigned getVersion(const int token)\n{\n  switch (token)\n  {\n  case KN2Token::VERSION_STR_2 :\n    return 2;\n  case KN2Token::VERSION_STR_3 :\n    return 3;\n  case KN2Token::VERSION_STR_4 :\n    return 4;\n  case KN2Token::VERSION_STR_5 :\n    return 5;\n  }\n\n  return 0;\n}\n\n}\n\nKN2Parser::KN2Parser(WPXInputStream *const input, KNCollector *const collector)\n  : KNParser(input, collector)\n  , m_version(0)\n{\n}\n\nKN2Parser::~KN2Parser()\n{\n}\n\nvoid KN2Parser::processXmlNode(xmlTextReaderPtr reader)\n{\n  assert(checkElement(reader, KN2Token::presentation, KN2Token::NS_URI_KEY));\n\n  \/\/ read attributes\n  KNXMLAttributeIterator attr(reader);\n  while (attr.next())\n  {\n    if (attr->ns)\n    {\n      switch (getKN2TokenID(attr->ns))\n      {\n      case KN2Token::NS_URI_KEY :\n        switch (getKN2TokenID(attr->name))\n        {\n        case KN2Token::all_images_bundled :\n        case KN2Token::compatible_version :\n        case KN2Token::kiosk_build_delay :\n        case KN2Token::kiosk_slide_delay :\n        case KN2Token::mode :\n        case KN2Token::play_mode :\n        case KN2Token::sticky_visibility :\n          KN_DEBUG_XML_TODO(\"attribute\", attr->name, attr->ns);\n          break;\n        case KN2Token::version :\n          m_version = getVersion(getKN2TokenID(attr->value));\n          if (0 == m_version)\n          {\n            KN_DEBUG_MSG((\"unknown version %s\\n\", attr->value));\n          }\n          break;\n        default :\n          KN_DEBUG_XML_UNKNOWN(\"attribute\", attr->name, attr->ns);\n          break;\n        }\n        break;\n      case KN2Token::NS_URI_SFA :\n        if (KN2Token::ID != getKN2TokenID(attr->name))\n        {\n          KN_DEBUG_XML_TODO(\"attribute\", attr->name, attr->ns);\n        }\n        break;\n      default :\n        KN_DEBUG_XML_UNKNOWN(\"attribute\", attr->name, attr->ns);\n        break;\n      }\n    }\n    else\n    {\n      KN_DEBUG_XML_UNKNOWN(\"attribute\", attr->name, attr->ns);\n    }\n  }\n\n  \/\/ read elements\n  while (moveToNextNode(reader))\n  {\n    const char *const name = getName(reader);\n    const char *const ns = getNamespace(reader);\n\n    if (checkElement(reader, KN2Token::presentation, KN2Token::NS_URI_KEY, false))\n      break;\n\n    if (isEndElement(reader))\n      throw GenericException();\n\n    if (ns && (KN2Token::NS_URI_KEY == getKN2TokenID(ns)))\n    {\n      switch (getKN2TokenID(name))\n      {\n      case KN2Token::size :\n      case KN2Token::theme_list :\n      case KN2Token::master_order :\n      case KN2Token::slide_list :\n      case KN2Token::ui_state :\n      case KN2Token::metadata :\n      case KN2Token::soundtrack_list :\n      case KN2Token::calculation_engine :\n      case KN2Token::version_history :\n        KN_DEBUG_XML_TODO(\"element\", name, ns);\n        skipElement(reader);\n        break;\n      }\n    }\n    else if (ns && (KN2Token::NS_URI_SF == getKN2TokenID(ns)) && (KN2Token::calc_engine == getKN2TokenID(name)))\n    {\n      KN_DEBUG_XML_TODO(\"element\", name, ns);\n      skipElement(reader);\n    }\n    else\n    {\n      KN_DEBUG_XML_UNKNOWN(\"element\", name, ns);\n      skipElement(reader);\n    }\n  }\n}\n\n}\n\n\/* vim:set shiftwidth=2 softtabstop=2 expandtab: *\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"MqClientThread.h\"\n\nMqClientThread::MqClientThread (const char *name, QObject *parent)\n: QThread(parent)\n, mosquittopp(name)\n, bQuit(false)\n, strHost (\"localhost\")\n, strTopic (\"gv_notify\")\n{\n}\/\/MqClientThread::MqClientThread\n\nvoid\nMqClientThread::on_connect (int rc)\n{\n    if (0 != rc) {\n        qWarning() << \"Mosquitto: Failed in on_connect. Error =\" << rc;\n        return;\n    }\n    qDebug() << \"Mosquitto: Connected to\" << strHost;\n\n    rc = this->subscribe (NULL, strTopic.toLatin1().constData ());\n    if (0 != rc) {\n        qWarning() << \"Mosquitto: Failed in subscribe. Error =\" << rc;\n        emit status (\"Failed to subscribe to Mosquitto server\");\n        return;\n    }\n    qDebug() << \"Mosquitto: Subscribed to\" << strTopic << \"established.\";\n}\/\/MqClientThread::on_connect\n\nvoid\nMqClientThread::on_message (const struct mosquitto_message *message)\n{\n    if (0 == message->payloadlen) {\n        qDebug(\"Mosquitto: No payload!\");\n        return;\n    }\n\n    QString strPayload = (char*)message->payload;\n    qDebug() << \"Mosquitto: topic = \" << message->topic\n             << \". message = \" << strPayload;\n\n    if (strPayload.startsWith (\"inbox\")) {\n        emit status (\"Mosquitto: New inbox entry\");\n        emit sigUpdateInbox();\n    }\n    if (strPayload.startsWith (\"contact\")) {\n        emit status (\"Mosquitto: Contact changes\");\n        emit sigUpdateContacts ();\n    }\n}\/\/MqClientThread::on_message\n\nvoid\nMqClientThread::run ()\n{\n    qDebug (\"Mosquitto: Enter thread loop\");\n\n    do { \/\/ Begin cleanup block (not a loop)\n        if (strHost.length () == 0) {\n            qWarning (\"Mosquitto: Invalid Host\");\n            break;\n        }\n\n        QHostInfo hInfo = QHostInfo::fromName (strHost);\n        QString strFirst = hInfo.addresses().first().toString();\n\n        qDebug() << \"Mosquitto: Attempting to connect to\" << strHost\n                 << \"at\" << strFirst;\n        int rv = ((mosquittopp*)this)->connect (strFirst.toLatin1().constData ());\n        if (0 != rv) {\n            qWarning() << \"Mosquitto: Failed to connect. Error =\" << rv;\n            emit status (\"Failed to connect to Mosquitto server\");\n            break;\n        }\n\n        while (!bQuit) {\n            qDebug (\"Mosquitto: Working the Mq loop\");\n            this->loop (1*1000);\n        }\n\n        qDebug (\"Mosquitto: End Mq loop. Unsubscribe and disconnect\");\n        this->unsubscribe(NULL, strTopic.toLatin1().constData ());\n        ((mosquittopp*)this)->disconnect ();\n        this->loop (100);\n    } while (0); \/\/ End cleanup block (not a loop)\n\n    \/\/ Ready for the next time\n    bQuit = false;\n    qDebug (\"Mosquitto: Exit thread loop\");\n}\/\/MqClientThread::run\n\nvoid\nMqClientThread::setSettings (bool bEnable, const QString &host, int p,\n                             const QString &topic)\n{\n    if (bEnable) {\n        strHost = host;\n        if (0 == p) {\n            p = 1883;\n        }\n        port = p;\n        strTopic = topic;\n    } else {\n        strHost.clear ();\n        port = 0;\n        strTopic.clear ();\n    }\n}\/\/MqClientThread::setSettings\n\nvoid\nMqClientThread::setUserPass (const QString &user, const QString &pass)\n{\n    strUser = user;\n    strPass = pass;\n    int rv =\n    this->username_pw_set(strUser.toLatin1().constData (),\n                          strPass.toLatin1().constData ());\n    if (0 != rv) {\n        qWarning() << \"Mosquitto: Failed to set user and pass. Error =\" << rv;\n    }\n}\/\/MqClientThread::setUserPass\n\nvoid\nMqClientThread::setQuit (bool set)\n{\n    bQuit = set;\n    qDebug() << \"Mosquitto: quit = \" << (bQuit?\"True\":\"False\");\n}\/\/MqClientThread::setQuit\n<commit_msg>dont display crap every second<commit_after>#include \"MqClientThread.h\"\n\nMqClientThread::MqClientThread (const char *name, QObject *parent)\n: QThread(parent)\n, mosquittopp(name)\n, bQuit(false)\n, strHost (\"localhost\")\n, strTopic (\"gv_notify\")\n{\n}\/\/MqClientThread::MqClientThread\n\nvoid\nMqClientThread::on_connect (int rc)\n{\n    if (0 != rc) {\n        qWarning() << \"Mosquitto: Failed in on_connect. Error =\" << rc;\n        return;\n    }\n    qDebug() << \"Mosquitto: Connected to\" << strHost;\n\n    rc = this->subscribe (NULL, strTopic.toLatin1().constData ());\n    if (0 != rc) {\n        qWarning() << \"Mosquitto: Failed in subscribe. Error =\" << rc;\n        emit status (\"Failed to subscribe to Mosquitto server\");\n        return;\n    }\n    qDebug() << \"Mosquitto: Subscribed to\" << strTopic << \"established.\";\n}\/\/MqClientThread::on_connect\n\nvoid\nMqClientThread::on_message (const struct mosquitto_message *message)\n{\n    if (0 == message->payloadlen) {\n        qDebug(\"Mosquitto: No payload!\");\n        return;\n    }\n\n    QString strPayload = (char*)message->payload;\n    qDebug() << \"Mosquitto: topic = \" << message->topic\n             << \". message = \" << strPayload;\n\n    if (strPayload.startsWith (\"inbox\")) {\n        emit status (\"Mosquitto: New inbox entry\");\n        emit sigUpdateInbox();\n    }\n    if (strPayload.startsWith (\"contact\")) {\n        emit status (\"Mosquitto: Contact changes\");\n        emit sigUpdateContacts ();\n    }\n}\/\/MqClientThread::on_message\n\nvoid\nMqClientThread::run ()\n{\n    qDebug (\"Mosquitto: Enter thread loop\");\n\n    do { \/\/ Begin cleanup block (not a loop)\n        if (strHost.length () == 0) {\n            qWarning (\"Mosquitto: Invalid Host\");\n            break;\n        }\n\n        QHostInfo hInfo = QHostInfo::fromName (strHost);\n        QString strFirst = hInfo.addresses().first().toString();\n\n        qDebug() << \"Mosquitto: Attempting to connect to\" << strHost\n                 << \"at\" << strFirst;\n        int rv = ((mosquittopp*)this)->connect (strFirst.toLatin1().constData ());\n        if (0 != rv) {\n            qWarning() << \"Mosquitto: Failed to connect. Error =\" << rv;\n            emit status (\"Failed to connect to Mosquitto server\");\n            break;\n        }\n\n        while (!bQuit) {\n            this->loop (1*1000);\n        }\n\n        qDebug (\"Mosquitto: End Mq loop. Unsubscribe and disconnect\");\n        this->unsubscribe(NULL, strTopic.toLatin1().constData ());\n        ((mosquittopp*)this)->disconnect ();\n        this->loop (100);\n    } while (0); \/\/ End cleanup block (not a loop)\n\n    \/\/ Ready for the next time\n    bQuit = false;\n    qDebug (\"Mosquitto: Exit thread loop\");\n}\/\/MqClientThread::run\n\nvoid\nMqClientThread::setSettings (bool bEnable, const QString &host, int p,\n                             const QString &topic)\n{\n    if (bEnable) {\n        strHost = host;\n        if (0 == p) {\n            p = 1883;\n        }\n        port = p;\n        strTopic = topic;\n    } else {\n        strHost.clear ();\n        port = 0;\n        strTopic.clear ();\n    }\n}\/\/MqClientThread::setSettings\n\nvoid\nMqClientThread::setUserPass (const QString &user, const QString &pass)\n{\n    strUser = user;\n    strPass = pass;\n    int rv =\n    this->username_pw_set(strUser.toLatin1().constData (),\n                          strPass.toLatin1().constData ());\n    if (0 != rv) {\n        qWarning() << \"Mosquitto: Failed to set user and pass. Error =\" << rv;\n    }\n}\/\/MqClientThread::setUserPass\n\nvoid\nMqClientThread::setQuit (bool set)\n{\n    bQuit = set;\n    qDebug() << \"Mosquitto: quit = \" << (bQuit?\"True\":\"False\");\n}\/\/MqClientThread::setQuit\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file This is the library to control the LCD Nanoshield\n * \n * Copyright (c) 2013 Circuitar\n * This software is released under the MIT license. See the attached LICENSE file for details.\n *\/\n#include \"Arduino.h\"\n#include <Wire.h>\n#include \"Nanoshield_LCD.h\"\n\n#define LCD_I2C_ADDRESS 0x27\n\n\/\/ Bit masks\n#define DISPLAY_ON     0x04\n#define DISPLAY_OFF    0x00\n#define CURSOR_ON      0x02\n#define CURSOR_OFF     0x00\n#define BLINK_ON       0x01\n#define BLINK_OFF      0x00\n#define BACKLIGHT_ON   0x80\n#define BACKLIGHT_OFF  0x00\n#define AUTOSCROLL_ON  0x01\n#define AUTOSCROLL_OFF 0x00\n#define LEFT_TO_RIGHT  0x02\n#define RIGHT_TO_LEFT  0x00\n\nNanoshield_LCD::Nanoshield_LCD(byte a0, byte a1, byte a2) {\n  \/\/ Select the three LSBs of the LCD address in the I2C bus\n  i2cAddress = LCD_I2C_ADDRESS;\n  if (!a0) i2cAddress &= 0x01;\n  if (!a1) i2cAddress &= 0x02;\n  if (!a2) i2cAddress &= 0x04;\n  displayMask = DISPLAY_ON;\n  cursorMask = CURSOR_OFF;\n  blinkMask = BLINK_OFF;\n  backlightMask = BACKLIGHT_ON;\n  autoscrollMask = AUTOSCROLL_OFF;\n  directionMask = LEFT_TO_RIGHT;\n}\n\nvoid Nanoshield_LCD::writeRegister(uint8_t addr, uint8_t data)\n{\n  Wire.beginTransmission(i2cAddress);\n  Wire.write(addr);\n  Wire.write(data);\n  Wire.endTransmission();\n}\n\nvoid Nanoshield_LCD::writeLcd4(uint8_t data, bool rs)\n{\n  \/\/ Use only lower 4 bits of data\n  data &= 0x0F;\n\n  \/\/ Set to pin GP7 in MCP23008 to high if backlight is on\n  data |= backlightMask;\n  if (rs) data |= 0x40;\n  writeRegister(0x0A, data);\n\n  \/\/ Raise clock line\n  data |= 0x10;\n  writeRegister(0x0A, data);\n\n  \/\/ Lower clock line\n  data &= ~0x10;\n  writeRegister(0x0A, data);\n  delay(1);\n}\n\nvoid Nanoshield_LCD::writeLcd8(uint8_t data, bool rs)\n{\n  writeLcd4((data >> 4) & 0x0F, rs);\n  writeLcd4(data & 0x0F, rs);\n}\n\nvoid Nanoshield_LCD::displayOnOffControl()\n{\n  writeLcd8(0x08 | displayMask | cursorMask | blinkMask, false);\n}\n\nvoid Nanoshield_LCD::entryModeSet()\n{\n  writeLcd8(0x04 | directionMask | autoscrollMask, false);\n}\n\nvoid Nanoshield_LCD::begin()\n{\n  \/\/ Initiate the Wire library and join the I2C bus as a master\n  Wire.begin();\n  \n  \/\/ Configure all GPIO pins in MCP23008 as outputs and leave everything else as default\n  writeRegister(0x00, 0x00);\n  \n  \/\/ Perform LCD reset by instruction in 4-bit mode as described in the HD44780 datasheet\n  delay(50);\n  writeLcd4(0x03, false);\n  delay(5);\n  writeLcd4(0x03, false);\n  delayMicroseconds(100);\n  writeLcd4(0x03, false);\n  delay(5);\n  writeLcd4(0x02, false);\n  writeLcd8(0x28, false);\n  writeLcd8(0x08, false); \/\/ Two lines, 5x8 dots per character\n  writeLcd8(0x01, false);\n  writeLcd8(0x06, false); \/\/ When writing, increment address and do not shift the display\n  writeLcd8(0x0C, false);\n  delayMicroseconds(100);\n}\n\nvoid Nanoshield_LCD::clear()\n{\n  writeLcd8(0x01, false);\n}\n\nvoid Nanoshield_LCD::home()\n{\n  writeLcd8(0x02, false);\n  delay(1);\n}\n\nvoid Nanoshield_LCD::setCursor(uint8_t col, uint8_t row)\n{\n  \/\/ Get address in the first row\n  uint8_t addr = col & 0x0F;\n  \n  \/\/ Add offset if it's not the first row \n  if (row == 1) {\n    addr += 0x40;\n  }\n\n  \/\/ Set DDRAM address\n  writeLcd8(addr | 0x80, false);\n}\n\nsize_t Nanoshield_LCD::write(uint8_t data)\n{\n  writeLcd8(data, true);\n  return 1;\n}\n\nvoid Nanoshield_LCD::cursor()\n{\n  cursorMask = CURSOR_ON;\n  displayOnOffControl();\n}\n\nvoid Nanoshield_LCD::noCursor()\n{\n  cursorMask = CURSOR_OFF;\n  displayOnOffControl();\n}\n\nvoid Nanoshield_LCD::blink()\n{\n  blinkMask = BLINK_ON;\n  displayOnOffControl();\n}\n\nvoid Nanoshield_LCD::noBlink()\n{\n  blinkMask = BLINK_OFF;\n  displayOnOffControl();\n}\n\nvoid Nanoshield_LCD::display()\n{\n  displayMask = DISPLAY_ON;\n  displayOnOffControl();\n}\n\nvoid Nanoshield_LCD::noDisplay()\n{\n  displayMask = DISPLAY_OFF;\n  displayOnOffControl();\n}\n\nvoid Nanoshield_LCD::backlight()\n{\n  backlightMask = BACKLIGHT_ON;\n  writeRegister(0x0A, backlightMask);\n}\n\nvoid Nanoshield_LCD::noBacklight()\n{\n  backlightMask = BACKLIGHT_OFF;\n  writeRegister(0x0A, backlightMask);\n}\n\nvoid Nanoshield_LCD::scrollDisplayLeft()\n{\n  writeLcd8(0x18, false);\n}\n\nvoid Nanoshield_LCD::scrollDisplayRight()\n{\n  writeLcd8(0x1C, false);\n}\n\nvoid Nanoshield_LCD::autoscroll()\n{\n  autoscrollMask = AUTOSCROLL_ON;\n  entryModeSet();\n}\n\nvoid Nanoshield_LCD::noAutoscroll()\n{\n  autoscrollMask = AUTOSCROLL_OFF;\n  entryModeSet();\n}\n\nvoid Nanoshield_LCD::leftToRight()\n{\n  directionMask = LEFT_TO_RIGHT;\n  entryModeSet();\n}\n\nvoid Nanoshield_LCD::rightToLeft()\n{\n  directionMask = RIGHT_TO_LEFT;\n  entryModeSet();\n}\n\nvoid Nanoshield_LCD::createChar(uint8_t num, uint8_t data[])\n{\n  if (num > 7) return;\n\n  \/\/ Address character position in CGRAM\n  writeLcd8(0x40 | (num << 3), false);\n  \n  \/\/ Write character in CGRAM\n  for (int i = 0; i < 8; i++) {\n    writeLcd8(data[i], true);\n  }\n}\n<commit_msg>Add support for LCDs with 4 rows.<commit_after>\/**\n * @file This is the library to control the LCD Nanoshield\n * \n * Copyright (c) 2013 Circuitar\n * This software is released under the MIT license. See the attached LICENSE file for details.\n *\/\n#include \"Arduino.h\"\n#include <Wire.h>\n#include \"Nanoshield_LCD.h\"\n\n#define LCD_I2C_ADDRESS 0x27\n\n\/\/ Bit masks\n#define DISPLAY_ON     0x04\n#define DISPLAY_OFF    0x00\n#define CURSOR_ON      0x02\n#define CURSOR_OFF     0x00\n#define BLINK_ON       0x01\n#define BLINK_OFF      0x00\n#define BACKLIGHT_ON   0x80\n#define BACKLIGHT_OFF  0x00\n#define AUTOSCROLL_ON  0x01\n#define AUTOSCROLL_OFF 0x00\n#define LEFT_TO_RIGHT  0x02\n#define RIGHT_TO_LEFT  0x00\n\nNanoshield_LCD::Nanoshield_LCD(byte a0, byte a1, byte a2) {\n  \/\/ Select the three LSBs of the LCD address in the I2C bus\n  i2cAddress = LCD_I2C_ADDRESS;\n  if (!a0) i2cAddress &= 0x01;\n  if (!a1) i2cAddress &= 0x02;\n  if (!a2) i2cAddress &= 0x04;\n  displayMask = DISPLAY_ON;\n  cursorMask = CURSOR_OFF;\n  blinkMask = BLINK_OFF;\n  backlightMask = BACKLIGHT_ON;\n  autoscrollMask = AUTOSCROLL_OFF;\n  directionMask = LEFT_TO_RIGHT;\n}\n\nvoid Nanoshield_LCD::writeRegister(uint8_t addr, uint8_t data)\n{\n  Wire.beginTransmission(i2cAddress);\n  Wire.write(addr);\n  Wire.write(data);\n  Wire.endTransmission();\n}\n\nvoid Nanoshield_LCD::writeLcd4(uint8_t data, bool rs)\n{\n  \/\/ Use only lower 4 bits of data\n  data &= 0x0F;\n\n  \/\/ Set to pin GP7 in MCP23008 to high if backlight is on\n  data |= backlightMask;\n  if (rs) data |= 0x40;\n  writeRegister(0x0A, data);\n\n  \/\/ Raise clock line\n  data |= 0x10;\n  writeRegister(0x0A, data);\n\n  \/\/ Lower clock line\n  data &= ~0x10;\n  writeRegister(0x0A, data);\n  delay(1);\n}\n\nvoid Nanoshield_LCD::writeLcd8(uint8_t data, bool rs)\n{\n  writeLcd4((data >> 4) & 0x0F, rs);\n  writeLcd4(data & 0x0F, rs);\n}\n\nvoid Nanoshield_LCD::displayOnOffControl()\n{\n  writeLcd8(0x08 | displayMask | cursorMask | blinkMask, false);\n}\n\nvoid Nanoshield_LCD::entryModeSet()\n{\n  writeLcd8(0x04 | directionMask | autoscrollMask, false);\n}\n\nvoid Nanoshield_LCD::begin()\n{\n  \/\/ Initiate the Wire library and join the I2C bus as a master\n  Wire.begin();\n  \n  \/\/ Configure all GPIO pins in MCP23008 as outputs and leave everything else as default\n  writeRegister(0x00, 0x00);\n  \n  \/\/ Perform LCD reset by instruction in 4-bit mode as described in the HD44780 datasheet\n  delay(50);\n  writeLcd4(0x03, false);\n  delay(5);\n  writeLcd4(0x03, false);\n  delayMicroseconds(100);\n  writeLcd4(0x03, false);\n  delay(5);\n  writeLcd4(0x02, false);\n  writeLcd8(0x28, false);\n  writeLcd8(0x08, false); \/\/ Two lines, 5x8 dots per character\n  writeLcd8(0x01, false);\n  writeLcd8(0x06, false); \/\/ When writing, increment address and do not shift the display\n  writeLcd8(0x0C, false);\n  delayMicroseconds(100);\n}\n\nvoid Nanoshield_LCD::clear()\n{\n  writeLcd8(0x01, false);\n}\n\nvoid Nanoshield_LCD::home()\n{\n  writeLcd8(0x02, false);\n  delay(1);\n}\n\nvoid Nanoshield_LCD::setCursor(uint8_t col, uint8_t row)\n{\n  \/\/ Get address in the first row\n  uint8_t addr = col & 0x3F;\n  \n  \/\/ Add row offset\n  addr += (row % 2 * 0x40) + (row \/ 2 * 20);\n\n  \/\/ Set DDRAM address\n  writeLcd8(addr | 0x80, false);\n}\n\nsize_t Nanoshield_LCD::write(uint8_t data)\n{\n  writeLcd8(data, true);\n  return 1;\n}\n\nvoid Nanoshield_LCD::cursor()\n{\n  cursorMask = CURSOR_ON;\n  displayOnOffControl();\n}\n\nvoid Nanoshield_LCD::noCursor()\n{\n  cursorMask = CURSOR_OFF;\n  displayOnOffControl();\n}\n\nvoid Nanoshield_LCD::blink()\n{\n  blinkMask = BLINK_ON;\n  displayOnOffControl();\n}\n\nvoid Nanoshield_LCD::noBlink()\n{\n  blinkMask = BLINK_OFF;\n  displayOnOffControl();\n}\n\nvoid Nanoshield_LCD::display()\n{\n  displayMask = DISPLAY_ON;\n  displayOnOffControl();\n}\n\nvoid Nanoshield_LCD::noDisplay()\n{\n  displayMask = DISPLAY_OFF;\n  displayOnOffControl();\n}\n\nvoid Nanoshield_LCD::backlight()\n{\n  backlightMask = BACKLIGHT_ON;\n  writeRegister(0x0A, backlightMask);\n}\n\nvoid Nanoshield_LCD::noBacklight()\n{\n  backlightMask = BACKLIGHT_OFF;\n  writeRegister(0x0A, backlightMask);\n}\n\nvoid Nanoshield_LCD::scrollDisplayLeft()\n{\n  writeLcd8(0x18, false);\n}\n\nvoid Nanoshield_LCD::scrollDisplayRight()\n{\n  writeLcd8(0x1C, false);\n}\n\nvoid Nanoshield_LCD::autoscroll()\n{\n  autoscrollMask = AUTOSCROLL_ON;\n  entryModeSet();\n}\n\nvoid Nanoshield_LCD::noAutoscroll()\n{\n  autoscrollMask = AUTOSCROLL_OFF;\n  entryModeSet();\n}\n\nvoid Nanoshield_LCD::leftToRight()\n{\n  directionMask = LEFT_TO_RIGHT;\n  entryModeSet();\n}\n\nvoid Nanoshield_LCD::rightToLeft()\n{\n  directionMask = RIGHT_TO_LEFT;\n  entryModeSet();\n}\n\nvoid Nanoshield_LCD::createChar(uint8_t num, uint8_t data[])\n{\n  if (num > 7) return;\n\n  \/\/ Address character position in CGRAM\n  writeLcd8(0x40 | (num << 3), false);\n  \n  \/\/ Write character in CGRAM\n  for (int i = 0; i < 8; i++) {\n    writeLcd8(data[i], true);\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Created by Sam on 9\/25\/2017.\n\/\/\n\n#include \"..\/..\/include\/Network\/Server.h\"\n#include \"..\/..\/include\/Game\/Game.h\"\n#include \"..\/..\/include\/Game\/Player.h\"\n#include \"..\/..\/include\/Network\/Message.h\"\n\nvoid Server::writeAll(std::string data)\n{\n    for (const auto &i : clients)\n    {\n        i->write(data);\n    }\n\n    std::cout << data << std::endl;\n}\n\nvoid Server::start()\n{\n    \/\/ Is the io_thread or matchmaking_thread already running?\n    if (io_thread && matchmaking_thread)\n    {\n        return;\n    }\n\n    std::cout << \"Starting server...\" << std::endl;\n\n    listen();\n\n    io_thread.reset(new boost::thread(\n            boost::bind(&boost::asio::io_service::run, &io_service)\n    ));\n\n    matchmaking_thread.reset(new boost::thread(\n            boost::bind(&Server::matchMake, shared_from_this(), std::ref(quit))\n    ));\n\n    std::cout << \"Server started!\" << std::endl;\n}\n\nvoid Server::stop()\n{\n    \/\/ Is the io_thread already stopped\n    if (!io_thread && !matchmaking_thread)\n    {\n        return;\n    }\n\n    \/\/ Stop and join the io_thread and matchmaking_thread\n    io_service.stop();\n    io_thread->join();\n    quit = true;\n    matchmaking_thread->join();\n\n    io_service.reset();\n    io_thread.reset();\n    matchmaking_thread.reset();\n}\n\nvoid Server::addClient(Client::pointer client)\n{\n    clients.push_back(client);\n    std::cout << \"'\" << client->name << \"' has connected from \" << client->getAddress() << \"!\" << std::endl;\n}\n\nvoid Server::removeClient(Client::pointer client)\n{\n    \/\/ Close the connection\n    close(client);\n\n    \/\/ Remove this client from the list of active clients\n    clients.erase(std::remove(clients.begin(), clients.end(), client), clients.end());\n\n    \/\/ Remove this clients player pointer from the queue\n    queue.erase(std::remove(queue.begin(), queue.end(), client->player), queue.end());\n}\n\nvoid Server::endGame(std::shared_ptr<Game> game)\n{\n\n    std::cout << \"Game over between \";\n    for (const auto& player : game->players)\n    {\n        if (player != game->players.back())\n        {\n            std::cout << player->name;\n        }\n        else\n        {\n            std::cout << \" and \" << player->name << std::endl;\n        }\n    }\n\n    \/\/ Reset the callback listeners to listen for the lobby function\n    resetPlayerClientListeners(game);\n    games.erase(std::remove(games.begin(), games.end(), game), games.end());\n}\n\nvoid Server::resetPlayerClientListeners(const std::shared_ptr<Game> &game) const\n{\n    for (const auto& player : game->players)\n    {\n        player->client->resetLobbyListen();\n    }\n}\n\nServer::Server(int port)\n        : database(Database()), factory(Factory()), io_service(), workLock(io_service), io_thread(),\n          matchmaking_thread(), acceptor(io_service,\n                                         boost::asio::ip::tcp::endpoint(boost::asio::ip::tcp::v4(),\n                                                                        static_cast<unsigned short>(port))),\n          quit(false)\n{\n    std::cout << \"Initializing server...\" << std::endl;\n}\n\nvoid Server::listen()\n{\n    Client::pointer client = Client::create(acceptor.get_io_service());\n\n    \/\/ Calls onAccept when a connection happens\n    acceptor.async_accept(client->getSocket(),\n                          boost::bind(&Server::onAccept, this, client,\n                                      boost::asio::placeholders::error));\n}\n\nvoid Server::matchMake(std::atomic<bool>& quit)\n{\n    while(!quit)\n    {\n        if (queue.size() >= 2)\n        {\n            std::vector<std::shared_ptr<Player>> players;\n\n            while(players.size() < 2)\n            {\n                std::shared_ptr<Player> player = queue.front();\n                queue.pop_front();\n                players.push_back(player);\n            }\n\n            \/\/ Wait until cards have been refreshed to start a game\n            boost::thread refreshWait(boost::bind(&Factory::refreshCards, &factory));\n            refreshWait.join();\n\n            std::shared_ptr<Game> game = std::make_shared<Game>(players, shared_from_this());\n            game->registerPlayers();\n            game->startGame();\n\n            std::cout << \"Game started for \";\n            for (const auto& player : game->players)\n            {\n                if (player != game->players.back())\n                {\n                    std::cout << player->name;\n                }\n                else\n                {\n                    std::cout << \" and \" << player->name << std::endl;\n                }\n            }\n\n            games.push_back(game);\n        }\n    }\n}\n\nvoid Server::onAccept(Client::pointer client, const boost::system::error_code &error)\n{\n    if (!error)\n    {\n        std::cout << \"Connection from \" << client->getAddress() << std::endl;\n        factory.refreshCards();\n        client->start(shared_from_this());\n    }\n\n    \/\/ pesudo recursive\n    listen();\n}\n\nvoid Server::close(Client::pointer client)\n{\n    std::cout << \"Closing connection from \" << client->name << std::endl;\n    client->getSocket().close();\n}\n<commit_msg>Removed unnecessary boost code<commit_after>\/\/\n\/\/ Created by Sam on 9\/25\/2017.\n\/\/\n\n#include \"..\/..\/include\/Network\/Server.h\"\n#include \"..\/..\/include\/Game\/Game.h\"\n#include \"..\/..\/include\/Game\/Player.h\"\n#include \"..\/..\/include\/Network\/Message.h\"\n\nvoid Server::writeAll(std::string data)\n{\n    for (const auto &i : clients)\n    {\n        i->write(data);\n    }\n\n    std::cout << data << std::endl;\n}\n\nvoid Server::start()\n{\n    \/\/ Is the io_thread or matchmaking_thread already running?\n    if (io_thread && matchmaking_thread)\n    {\n        return;\n    }\n\n    std::cout << \"Starting server...\" << std::endl;\n\n    listen();\n\n    io_thread.reset(new boost::thread(\n            boost::bind(&boost::asio::io_service::run, &io_service)\n    ));\n\n    matchmaking_thread.reset(new boost::thread(\n            boost::bind(&Server::matchMake, shared_from_this(), std::ref(quit))\n    ));\n\n    std::cout << \"Server started!\" << std::endl;\n}\n\nvoid Server::stop()\n{\n    \/\/ Is the io_thread already stopped\n    if (!io_thread && !matchmaking_thread)\n    {\n        return;\n    }\n\n    \/\/ Stop and join the io_thread and matchmaking_thread\n    io_service.stop();\n    io_thread->join();\n    quit = true;\n    matchmaking_thread->join();\n\n    io_service.reset();\n    io_thread.reset();\n    matchmaking_thread.reset();\n}\n\nvoid Server::addClient(Client::pointer client)\n{\n    clients.push_back(client);\n    std::cout << \"'\" << client->name << \"' has connected from \" << client->getAddress() << \"!\" << std::endl;\n}\n\nvoid Server::removeClient(Client::pointer client)\n{\n    \/\/ Close the connection\n    close(client);\n\n    \/\/ Remove this client from the list of active clients\n    clients.erase(std::remove(clients.begin(), clients.end(), client), clients.end());\n\n    \/\/ Remove this clients player pointer from the queue\n    queue.erase(std::remove(queue.begin(), queue.end(), client->player), queue.end());\n}\n\nvoid Server::endGame(std::shared_ptr<Game> game)\n{\n\n    std::cout << \"Game over between \";\n    for (const auto& player : game->players)\n    {\n        if (player != game->players.back())\n        {\n            std::cout << player->name;\n        }\n        else\n        {\n            std::cout << \" and \" << player->name << std::endl;\n        }\n    }\n\n    \/\/ Reset the callback listeners to listen for the lobby function\n    resetPlayerClientListeners(game);\n    games.erase(std::remove(games.begin(), games.end(), game), games.end());\n}\n\nvoid Server::resetPlayerClientListeners(const std::shared_ptr<Game> &game) const\n{\n    for (const auto& player : game->players)\n    {\n        player->client->resetLobbyListen();\n    }\n}\n\nServer::Server(int port)\n        : database(Database()), factory(Factory()), io_service(), workLock(io_service), io_thread(),\n          matchmaking_thread(), acceptor(io_service,\n                                         boost::asio::ip::tcp::endpoint(boost::asio::ip::tcp::v4(),\n                                                                        static_cast<unsigned short>(port))),\n          quit(false)\n{\n    std::cout << \"Initializing server...\" << std::endl;\n}\n\nvoid Server::listen()\n{\n    Client::pointer client = Client::create(acceptor.get_io_service());\n\n    \/\/ Calls onAccept when a connection happens\n    acceptor.async_accept(client->getSocket(),\n                          boost::bind(&Server::onAccept, this, client,\n                                      boost::asio::placeholders::error));\n}\n\nvoid Server::matchMake(std::atomic<bool>& quit)\n{\n    while(!quit)\n    {\n        if (queue.size() >= 2)\n        {\n            std::vector<std::shared_ptr<Player>> players;\n\n            while(players.size() < 2)\n            {\n                std::shared_ptr<Player> player = queue.front();\n                queue.pop_front();\n                players.push_back(player);\n            }\n\n            \/\/ Wait until cards have been refreshed to start a game\n            factory.refreshCards();\n\n            std::shared_ptr<Game> game = std::make_shared<Game>(players, shared_from_this());\n            game->registerPlayers();\n            game->startGame();\n\n            std::cout << \"Game started for \";\n            for (const auto& player : game->players)\n            {\n                if (player != game->players.back())\n                {\n                    std::cout << player->name;\n                }\n                else\n                {\n                    std::cout << \" and \" << player->name << std::endl;\n                }\n            }\n\n            games.push_back(game);\n        }\n    }\n}\n\nvoid Server::onAccept(Client::pointer client, const boost::system::error_code &error)\n{\n    if (!error)\n    {\n        std::cout << \"Connection from \" << client->getAddress() << std::endl;\n        factory.refreshCards();\n        client->start(shared_from_this());\n    }\n\n    \/\/ pesudo recursive\n    listen();\n}\n\nvoid Server::close(Client::pointer client)\n{\n    std::cout << \"Closing connection from \" << client->name << std::endl;\n    client->getSocket().close();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * Copyright © 2012, United States Government, as represented by the\n * Administrator of the National Aeronautics and Space Administration.\n * All rights reserved.\n * \n * The NASA Tensegrity Robotics Toolkit (NTRT) v1 platform is licensed\n * under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0.\n * \n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND,\n * either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n *\/\n\n\/**\n * @file tgHillyGround.cpp\n * @brief Contains the implementation of class tgHillyGround\n * @author Steven Lessard\n * $Id$\n *\/\n\n\/\/This Module\n#include \"tgHillyGround.h\"\n\n\/\/Bullet Physics\n#include \"BulletCollision\/CollisionShapes\/btBoxShape.h\"\n#include \"BulletCollision\/CollisionShapes\/btTriangleIndexVertexArray.h\"\n#include \"BulletCollision\/CollisionShapes\/btBvhTriangleMeshShape.h\"\n#include \"BulletDynamics\/Dynamics\/btRigidBody.h\"\n#include \"LinearMath\/btDefaultMotionState.h\"\n#include \"LinearMath\/btTransform.h\"\n\n\/\/ The C++ Standard Library\n#include <cassert>\n#include <iostream> \/\/For debugging\n\ntgHillyGround::Config::Config(btVector3 eulerAngles,\n        btScalar friction,\n        btScalar restitution,\n        btVector3 size,\n        btVector3 origin,\n        size_t nx,\n        size_t ny,\n        double margin,\n        double triangleSize,\n        double waveHeight,\n        double offset) :\n    m_eulerAngles(eulerAngles),\n    m_friction(friction),\n    m_restitution(restitution),\n    m_size(size),\n    m_origin(origin),\n    m_nx(nx),\n    m_ny(ny),\n    m_margin(margin),\n    m_triangleSize(triangleSize),\n    m_waveHeight(waveHeight),\n    m_offset(offset)\n{\n    assert((m_friction >= 0.0) && (m_friction <= 1.0));\n    assert((m_restitution >= 0.0) && (m_restitution <= 1.0));\n    assert((m_size[0] >= 0.0) && (m_size[1] >= 0.0) && (m_size[2] >= 0.0));\n    assert(m_nx > 0);\n    assert(m_ny > 0);\n    assert((m_margin >= 0.0) && (m_margin >= 1.0));\n    assert(m_triangleSize >= 0.0);\n    assert(m_waveHeight >= 0.0);\n    assert(m_offset >= 0.0);\n}\n\ntgHillyGround::tgHillyGround() :\n    m_config(Config())\n{\n    \/\/ @todo make constructor aux to avoid repeated code\n    pGroundShape = hillyCollisionShape();\n}\n\ntgHillyGround::tgHillyGround(const tgHillyGround::Config& config) :\n    m_config(config)\n{\n    pGroundShape = hillyCollisionShape();\n}\n\nbtRigidBody* tgHillyGround::getGroundRigidBody() const\n{\n    const btScalar mass = 0.0;\n\n    btTransform groundTransform;\n    groundTransform.setIdentity();\n    groundTransform.setOrigin(m_config.m_origin);\n\n    btQuaternion orientation;\n    orientation.setEuler(m_config.m_eulerAngles[0], \/\/ Yaw\n                         m_config.m_eulerAngles[1], \/\/ Pitch\n                         m_config.m_eulerAngles[2]); \/\/ Roll\n    groundTransform.setRotation(orientation);\n\n    \/\/ Using motionstate is recommended\n    \/\/ It provides interpolation capabilities, and only synchronizes 'active' objects\n    btDefaultMotionState* const pMotionState =\n        new btDefaultMotionState(groundTransform);\n\n    const btVector3 localInertia(0, 0, 0);\n\n    btRigidBody::btRigidBodyConstructionInfo const rbInfo(mass, pMotionState, pGroundShape, localInertia);\n\n    btRigidBody* const pGroundBody = new btRigidBody(rbInfo);\n\n    assert(pGroundBody);\n    return pGroundBody;\n}  \n\nbtCollisionShape* tgHillyGround::hillyCollisionShape() {\n    btCollisionShape * pShape = 0;\n    \/\/ The number of vertices in the mesh\n    \/\/ Hill Paramenters: Subject to Change\n    const size_t vertexCount = m_config.m_nx * m_config.m_ny;\n    std::cout << \"vertexCount: \" << vertexCount << std::endl;\n\n    std::cout << \"In hillyCollisionShape()\" << std::endl;\n    if (vertexCount > 0) {\n        \/\/ The number of triangles in the mesh\n        const size_t triangleCount = 2 * (m_config.m_nx - 1) * (m_config.m_ny - 1);\n        std::cout << \"triangleCount: \" << triangleCount << std::endl;\n\n        \/\/ A flattened array of all vertices in the mesh\n        btVector3 * const vertices = new btVector3[vertexCount];\n\n        \/\/ Supplied by the derived class\n        setVertices(vertices);\n        \/\/ A flattened array of indices for each corner of each triangle\n        int *indices = new int[triangleCount * 3];\n\n        \/\/ Supplied by the derived class\n        setIndices(indices);\n\n        \/\/ Create the mesh object\n        btTriangleIndexVertexArray* const pMesh =\n            createMesh(triangleCount, indices, vertexCount, vertices);\n\n        \/\/ Create the shape object\n        pShape = createShape(pMesh);\n\n        \/\/ Set the margin\n        pShape->setMargin(m_config.m_margin);\n        \/\/ DO NOT deallocate vertices, indices or pMesh! The shape owns them.\n    }\n\n    assert(pShape);\n    return pShape; \n}\n\nbtTriangleIndexVertexArray *tgHillyGround::createMesh(size_t triangleCount, int indices[], size_t vertexCount, btVector3 vertices[]) {\n    const int vertexStride = sizeof(btVector3);\n    const int indexStride = 3 * sizeof(int);\n\n    btTriangleIndexVertexArray* const pMesh = \n        new btTriangleIndexVertexArray(triangleCount,\n                indices,\n                indexStride,\n                vertexCount,\n                (btScalar*) &vertices[0].x(),\n                vertexStride);\n    return pMesh;\n}\n\nbtCollisionShape *tgHillyGround::createShape(btTriangleIndexVertexArray *pMesh) {\n    const bool useQuantizedAabbCompression = true;\n    btCollisionShape *const pShape = \n        new btBvhTriangleMeshShape(pMesh, useQuantizedAabbCompression);\n    return pShape;\n}\n\nvoid tgHillyGround::setVertices(btVector3 vertices[]) {\n    for (size_t i = 0; i < m_config.m_nx; i++)\n    {\n        for (size_t j = 0; j < m_config.m_ny; j++)\n        {\n            const btScalar x = (i - (m_config.m_nx * 0.5)) * m_config.m_triangleSize;\n            const btScalar y = (m_config.m_waveHeight * sinf((float)i) * cosf((float)j) +\n                    m_config.m_offset);\n            const btScalar z = (j - (m_config.m_ny * 0.5)) * m_config.m_triangleSize;\n            vertices[i + (j * m_config.m_nx)].setValue(x, y, z);\n        }\n    }\n}\n\nvoid tgHillyGround::setIndices(int indices[]) {\n    int index = 0;\n    for (int i = 0; i < m_config.m_nx - 1; i++)\n    {\n        for (int j = 0; j < m_config.m_ny - 1; j++)\n        {\n            indices[index++] = (j       * m_config.m_nx) + i;\n            indices[index++] = (j       * m_config.m_nx) + i + 1;\n            indices[index++] = ((j + 1) * m_config.m_nx) + i + 1;\n\n            indices[index++] = (j       * m_config.m_nx) + i;\n            indices[index++] = ((j + 1) * m_config.m_nx) + i + 1;\n            indices[index++] = ((j + 1) * m_config.m_nx) + i;\n        }\n    }\n}\n\n<commit_msg>Now allows margin to be > 1<commit_after>\/**\n * Copyright © 2012, United States Government, as represented by the\n * Administrator of the National Aeronautics and Space Administration.\n * All rights reserved.\n * \n * The NASA Tensegrity Robotics Toolkit (NTRT) v1 platform is licensed\n * under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0.\n * \n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND,\n * either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n *\/\n\n\/**\n * @file tgHillyGround.cpp\n * @brief Contains the implementation of class tgHillyGround\n * @author Steven Lessard\n * $Id$\n *\/\n\n\/\/This Module\n#include \"tgHillyGround.h\"\n\n\/\/Bullet Physics\n#include \"BulletCollision\/CollisionShapes\/btBoxShape.h\"\n#include \"BulletCollision\/CollisionShapes\/btTriangleIndexVertexArray.h\"\n#include \"BulletCollision\/CollisionShapes\/btBvhTriangleMeshShape.h\"\n#include \"BulletDynamics\/Dynamics\/btRigidBody.h\"\n#include \"LinearMath\/btDefaultMotionState.h\"\n#include \"LinearMath\/btTransform.h\"\n\n\/\/ The C++ Standard Library\n#include <cassert>\n#include <iostream> \/\/For debugging\n\ntgHillyGround::Config::Config(btVector3 eulerAngles,\n        btScalar friction,\n        btScalar restitution,\n        btVector3 size,\n        btVector3 origin,\n        size_t nx,\n        size_t ny,\n        double margin,\n        double triangleSize,\n        double waveHeight,\n        double offset) :\n    m_eulerAngles(eulerAngles),\n    m_friction(friction),\n    m_restitution(restitution),\n    m_size(size),\n    m_origin(origin),\n    m_nx(nx),\n    m_ny(ny),\n    m_margin(margin),\n    m_triangleSize(triangleSize),\n    m_waveHeight(waveHeight),\n    m_offset(offset)\n{\n    assert((m_friction >= 0.0) && (m_friction <= 1.0));\n    assert((m_restitution >= 0.0) && (m_restitution <= 1.0));\n    assert((m_size[0] >= 0.0) && (m_size[1] >= 0.0) && (m_size[2] >= 0.0));\n    assert(m_nx > 0);\n    assert(m_ny > 0);\n    assert(m_margin >= 0.0);\n    assert(m_triangleSize >= 0.0);\n    assert(m_waveHeight >= 0.0);\n    assert(m_offset >= 0.0);\n}\n\ntgHillyGround::tgHillyGround() :\n    m_config(Config())\n{\n    \/\/ @todo make constructor aux to avoid repeated code\n    pGroundShape = hillyCollisionShape();\n}\n\ntgHillyGround::tgHillyGround(const tgHillyGround::Config& config) :\n    m_config(config)\n{\n    pGroundShape = hillyCollisionShape();\n}\n\nbtRigidBody* tgHillyGround::getGroundRigidBody() const\n{\n    const btScalar mass = 0.0;\n\n    btTransform groundTransform;\n    groundTransform.setIdentity();\n    groundTransform.setOrigin(m_config.m_origin);\n\n    btQuaternion orientation;\n    orientation.setEuler(m_config.m_eulerAngles[0], \/\/ Yaw\n                         m_config.m_eulerAngles[1], \/\/ Pitch\n                         m_config.m_eulerAngles[2]); \/\/ Roll\n    groundTransform.setRotation(orientation);\n\n    \/\/ Using motionstate is recommended\n    \/\/ It provides interpolation capabilities, and only synchronizes 'active' objects\n    btDefaultMotionState* const pMotionState =\n        new btDefaultMotionState(groundTransform);\n\n    const btVector3 localInertia(0, 0, 0);\n\n    btRigidBody::btRigidBodyConstructionInfo const rbInfo(mass, pMotionState, pGroundShape, localInertia);\n\n    btRigidBody* const pGroundBody = new btRigidBody(rbInfo);\n\n    assert(pGroundBody);\n    return pGroundBody;\n}  \n\nbtCollisionShape* tgHillyGround::hillyCollisionShape() {\n    btCollisionShape * pShape = 0;\n    \/\/ The number of vertices in the mesh\n    \/\/ Hill Paramenters: Subject to Change\n    const size_t vertexCount = m_config.m_nx * m_config.m_ny;\n    std::cout << \"vertexCount: \" << vertexCount << std::endl;\n\n    std::cout << \"In hillyCollisionShape()\" << std::endl;\n    if (vertexCount > 0) {\n        \/\/ The number of triangles in the mesh\n        const size_t triangleCount = 2 * (m_config.m_nx - 1) * (m_config.m_ny - 1);\n        std::cout << \"triangleCount: \" << triangleCount << std::endl;\n\n        \/\/ A flattened array of all vertices in the mesh\n        btVector3 * const vertices = new btVector3[vertexCount];\n\n        \/\/ Supplied by the derived class\n        setVertices(vertices);\n        \/\/ A flattened array of indices for each corner of each triangle\n        int *indices = new int[triangleCount * 3];\n\n        \/\/ Supplied by the derived class\n        setIndices(indices);\n\n        \/\/ Create the mesh object\n        btTriangleIndexVertexArray* const pMesh =\n            createMesh(triangleCount, indices, vertexCount, vertices);\n\n        \/\/ Create the shape object\n        pShape = createShape(pMesh);\n\n        \/\/ Set the margin\n        pShape->setMargin(m_config.m_margin);\n        \/\/ DO NOT deallocate vertices, indices or pMesh! The shape owns them.\n    }\n\n    assert(pShape);\n    return pShape; \n}\n\nbtTriangleIndexVertexArray *tgHillyGround::createMesh(size_t triangleCount, int indices[], size_t vertexCount, btVector3 vertices[]) {\n    const int vertexStride = sizeof(btVector3);\n    const int indexStride = 3 * sizeof(int);\n\n    btTriangleIndexVertexArray* const pMesh = \n        new btTriangleIndexVertexArray(triangleCount,\n                indices,\n                indexStride,\n                vertexCount,\n                (btScalar*) &vertices[0].x(),\n                vertexStride);\n    return pMesh;\n}\n\nbtCollisionShape *tgHillyGround::createShape(btTriangleIndexVertexArray *pMesh) {\n    const bool useQuantizedAabbCompression = true;\n    btCollisionShape *const pShape = \n        new btBvhTriangleMeshShape(pMesh, useQuantizedAabbCompression);\n    return pShape;\n}\n\nvoid tgHillyGround::setVertices(btVector3 vertices[]) {\n    for (size_t i = 0; i < m_config.m_nx; i++)\n    {\n        for (size_t j = 0; j < m_config.m_ny; j++)\n        {\n            const btScalar x = (i - (m_config.m_nx * 0.5)) * m_config.m_triangleSize;\n            const btScalar y = (m_config.m_waveHeight * sinf((float)i) * cosf((float)j) +\n                    m_config.m_offset);\n            const btScalar z = (j - (m_config.m_ny * 0.5)) * m_config.m_triangleSize;\n            vertices[i + (j * m_config.m_nx)].setValue(x, y, z);\n        }\n    }\n}\n\nvoid tgHillyGround::setIndices(int indices[]) {\n    int index = 0;\n    for (int i = 0; i < m_config.m_nx - 1; i++)\n    {\n        for (int j = 0; j < m_config.m_ny - 1; j++)\n        {\n            indices[index++] = (j       * m_config.m_nx) + i;\n            indices[index++] = (j       * m_config.m_nx) + i + 1;\n            indices[index++] = ((j + 1) * m_config.m_nx) + i + 1;\n\n            indices[index++] = (j       * m_config.m_nx) + i;\n            indices[index++] = ((j + 1) * m_config.m_nx) + i + 1;\n            indices[index++] = ((j + 1) * m_config.m_nx) + i;\n        }\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 (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 \"mclassfactory.h\"\n#include \"mviewcreator.h\"\n#include \"mstylecreator.h\"\n#include \"mwidgetcreator.h\"\n#include \"manimationcreator.h\"\n#include \"meffectcreator.h\"\n\n#include <QHash>\n#include <QString>\n#include <MDebug>\n\nclass MClassFactoryPrivate\n{\npublic:\n    QHash<QByteArray, MWidgetCreatorBase *> widgetCreators;\n    QHash<QString, MViewCreatorBase *> viewCreators;\n    QHash<QString, MStyleCreatorBase *> styleCreators;\n    QHash<QString, MAnimationCreatorBase *> animationCreators;\n    QHash<QString, MEffectCreatorBase *> effectCreators;\n};\n\nMClassFactory::MClassFactory() :\n    d_ptr(new MClassFactoryPrivate)\n{\n}\n\nMClassFactory::~MClassFactory()\n{\n    delete d_ptr;\n}\n\nMClassFactory *MClassFactory::instance()\n{\n    static MClassFactory *gFactory = 0;\n\n    if ( ! gFactory )\n    {\n        gFactory = new MClassFactory();\n    }\n\n    return gFactory;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Widget \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\nvoid MClassFactory::registerWidgetCreator(MWidgetCreatorBase *creator, const char *widgetClassName)\n{\n    QByteArray type(widgetClassName);\n    if (type.isEmpty())\n        qFatal(\"MClassFactory cannot register MWidgetCreator with empty type identifier\");\n\n    if (d_ptr->widgetCreators.contains(type)) {\n        qWarning(\"MClassFactory already contains MWidgetCreator for %s\", widgetClassName);\n    } else {\n        d_ptr->widgetCreators.insert(type, creator);\n    }\n}\n\nvoid MClassFactory::unregisterWidgetCreator(MWidgetCreatorBase *creator)\n{\n    QByteArray widgetClassName = d_ptr->widgetCreators.key(creator);\n    if (widgetClassName.isEmpty()) {\n        qWarning(\"MClassFactory cannot unregister MWidgetCreator which is not registered\");\n    } else {\n        d_ptr->widgetCreators.remove(widgetClassName);\n    }\n}\n\nQString MClassFactory::widgetAssemblyName(const QByteArray &widgetClassName) const\n{\n    const MWidgetCreatorBase *widgetCreator = d_ptr->widgetCreators.value(widgetClassName, NULL);\n    if (!widgetCreator) {\n        return QString();\n    }\n    return widgetCreator->assemblyName();\n}\n\nM::AssemblyType MClassFactory::widgetAssemblyType(const QByteArray &widgetClassName) const\n{\n    const MWidgetCreatorBase *widgetCreator = d_ptr->widgetCreators.value(widgetClassName, NULL);\n    if (!widgetCreator) {\n        return M::AssemblyNone;\n    }\n    return widgetCreator->assemblyType();\n}\n\n\/\/\/\/\/\/\/\/\/\/\n\/\/ View \/\/\n\/\/\/\/\/\/\/\/\/\/\nvoid MClassFactory::registerViewCreator(MViewCreatorBase *creator, const char *viewClassName)\n{\n    QString type(viewClassName);\n    if (type.isEmpty())\n        qFatal(\"MClassFactory cannot register MViewCreator with empty type identifier\");\n\n    if (d_ptr->viewCreators.contains(type)) {\n        qWarning(\"MClassFactory already contains MViewCreator for %s\", viewClassName);\n    } else {\n        d_ptr->viewCreators.insert(type, creator);\n    }\n}\n\nvoid MClassFactory::unregisterViewCreator(MViewCreatorBase *creator)\n{\n    QString viewClassName = d_ptr->viewCreators.key(creator);\n    if (viewClassName.isEmpty()) {\n        qWarning(\"MClassFactory cannot unregister MViewCreator which is not registered\");\n    } else {\n        d_ptr->viewCreators.remove(viewClassName);\n    }\n}\n\nMWidgetView *MClassFactory::createView(const char *viewClassName, const MWidgetController *controller) const\n{\n    const MViewCreatorBase *viewCreator = d_ptr->viewCreators.value(QString(viewClassName), NULL);\n    if (!viewCreator) {\n        mWarning(\"MClassFactory\") << \"could not create\" << viewClassName;\n        return NULL;\n    }\n    return viewCreator->create(controller);\n}\n\nconst char *MClassFactory::viewStyleType(const char *viewClassName) const\n{\n    const MViewCreatorBase *viewCreator = d_ptr->viewCreators.value(QString(viewClassName), NULL);\n    if (!viewCreator) {\n        mWarning(\"MClassFactory\") << \"could not find\" << viewClassName;\n        return NULL;\n    }\n    return viewCreator->styleType();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Style \/\/\n\/\/\/\/\/\/\/\/\/\/\/\nvoid MClassFactory::registerStyleCreator(MStyleCreatorBase *creator, const char *styleClassName)\n{\n    QString type(styleClassName);\n    if (type.isEmpty())\n        qFatal(\"MClassFactory cannot register MStyleCreator with empty type identifier\");\n\n    if (d_ptr->styleCreators.contains(type)) {\n        qWarning(\"MClassFactory already contains MStyleCreator for %s\", styleClassName);\n    } else {\n        d_ptr->styleCreators.insert(type, creator);\n    }\n}\n\nvoid MClassFactory::unregisterStyleCreator(MStyleCreatorBase *creator)\n{\n    QString styleClassName = d_ptr->styleCreators.key(creator);\n    if (styleClassName.isEmpty()) {\n        qWarning(\"MClassFactory cannot unregister MStyleCreator which is not registered\");\n    } else {\n        d_ptr->styleCreators.remove(styleClassName);\n    }\n}\n\nMStyle *MClassFactory::createStyle(const char *styleClassName) const\n{\n    const MStyleCreatorBase *styleCreator = d_ptr->styleCreators.value(QString(styleClassName), NULL);\n    if (!styleCreator) {\n        mWarning(\"MClassFactory\") << \"could not create\" << styleClassName;\n        return NULL;\n    }\n    return styleCreator->create();\n}\n\nconst char *MClassFactory::styleAttributeType(const char *styleClassName, const char *attributeName) const\n{\n    const MStyleCreatorBase *styleCreator = d_ptr->styleCreators.value(QString(styleClassName), NULL);\n    if (!styleCreator) {\n        mWarning(\"MClassFactory\") << \"could not find\" << styleClassName;\n        return NULL;\n    }\n    return styleCreator->attributeType(attributeName);\n}\n\nconst QMetaObject *MClassFactory::styleMetaObject(const char *styleClassName) const\n{\n    const MStyleCreatorBase *styleCreator = d_ptr->styleCreators.value(QString(styleClassName), NULL);\n    if (!styleCreator) {\n        mWarning(\"MClassFactory\") << \"could not find meta object for\" << styleClassName;\n        return NULL;\n    }\n    return styleCreator->metaObject();\n}\n\nQString MClassFactory::styleAssemblyName(const char *styleClassName) const\n{\n    const MStyleCreatorBase *styleCreator = d_ptr->styleCreators.value(QString(styleClassName), NULL);\n    if (!styleCreator) {\n        mWarning(\"MClassFactory\") << \"could not find assembly name for\" << styleClassName;\n        return QString();\n    }\n    return styleCreator->assemblyName();\n}\n\nM::AssemblyType MClassFactory::styleAssemblyType(const char *styleClassName) const\n{\n    const MStyleCreatorBase *styleCreator = d_ptr->styleCreators.value(QString(styleClassName), NULL);\n    if (!styleCreator) {\n        mWarning(\"MClassFactory\") << \"could not find assembly type for\" << styleClassName;\n        return M::AssemblyNone;\n    }\n    return styleCreator->assemblyType();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Animation \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid MClassFactory::registerAnimationCreator(MAnimationCreatorBase *creator, const char *animationClassName)\n{\n    QString type(animationClassName);\n    if (type.isEmpty())\n        qFatal(\"MClassFactory cannot register MAnimationCreator with empty type identifier\");\n\n    if (d_ptr->animationCreators.contains(type)) {\n        qWarning(\"MClassFactory already contains MAnimationCreator for %s\", animationClassName);\n    } else {\n        d_ptr->animationCreators.insert(type, creator);\n    }\n}\n\nvoid MClassFactory::unregisterAnimationCreator(MAnimationCreatorBase *creator)\n{\n    QString animationClassName = d_ptr->animationCreators.key(creator);\n    if (animationClassName.isEmpty()) {\n        qWarning(\"MClassFactory cannot unregister MAnimationCreator which is not registered\");\n    } else {\n        d_ptr->animationCreators.remove(animationClassName);\n    }\n}\n\nQAbstractAnimation *MClassFactory::createAnimation(const QString &animationClassName) const\n{\n    const MAnimationCreatorBase *animationCreator = d_ptr->animationCreators.value(animationClassName, NULL);\n    if (!animationCreator) {\n        mWarning(\"MClassFactory\") << \"could not create\" << animationClassName;\n        return NULL;\n    }\n    return animationCreator->create();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Effect    \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid MClassFactory::registerEffectCreator(MEffectCreatorBase *creator, const char *effectClassName)\n{\n    QString type(effectClassName);\n    if (type.isEmpty())\n        qFatal(\"MClassFactory cannot register MEffectCreator with empty type identifier\");\n\n    if (d_ptr->effectCreators.contains(type)) {\n        qWarning(\"MClassFactory already contains MEffectCreator for %s\", effectClassName);\n    } else {\n        d_ptr->effectCreators.insert(type, creator);\n    }\n}\n\nvoid MClassFactory::unregisterEffectCreator(MEffectCreatorBase *creator)\n{\n    QString effectClassName = d_ptr->effectCreators.key(creator);\n    if (effectClassName.isEmpty()) {\n        qWarning(\"MClassFactory cannot unregister MEffectCreator which is not registered\");\n    } else {\n        d_ptr->effectCreators.remove(effectClassName);\n    }\n}\n\nQGraphicsEffect *MClassFactory::createEffect(const QString &effectClassName) const\n{\n    const MEffectCreatorBase *effectCreator = d_ptr->effectCreators.value(effectClassName, NULL);\n    if (!effectCreator) {\n        mWarning(\"MClassFactory\") << \"could not create\" << effectClassName;\n        return NULL;\n    }\n    return effectCreator->create();\n}\n<commit_msg>Fixes: NB#200879 - Accounts-UI crashes after closing<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 \"mclassfactory.h\"\n#include \"mviewcreator.h\"\n#include \"mstylecreator.h\"\n#include \"mwidgetcreator.h\"\n#include \"manimationcreator.h\"\n#include \"meffectcreator.h\"\n\n#include <QHash>\n#include <QString>\n#include <MDebug>\n\nvoid mMessageHandler(QtMsgType type, const char *msg);\n\nclass MClassFactoryPrivate\n{\npublic:\n    static void registerDefaultMessageHandler()\n    {\n        \/\/ The MClassFactory::unregister*() methods are called\n        \/\/ when static objects are destroyed.\n        \/\/ Before they can use qDebug() they must register a\n        \/\/ message handler as the original one could already\n        \/\/ be destroyed at this point in time which leads to\n        \/\/ a crash.\n        qInstallMsgHandler(mMessageHandler);\n    }\n\n    QHash<QByteArray, MWidgetCreatorBase *> widgetCreators;\n    QHash<QString, MViewCreatorBase *> viewCreators;\n    QHash<QString, MStyleCreatorBase *> styleCreators;\n    QHash<QString, MAnimationCreatorBase *> animationCreators;\n    QHash<QString, MEffectCreatorBase *> effectCreators;\n};\n\nMClassFactory::MClassFactory() :\n    d_ptr(new MClassFactoryPrivate)\n{\n}\n\nMClassFactory::~MClassFactory()\n{\n    delete d_ptr;\n}\n\nMClassFactory *MClassFactory::instance()\n{\n    static MClassFactory *gFactory = 0;\n\n    if ( ! gFactory )\n    {\n        gFactory = new MClassFactory();\n    }\n\n    return gFactory;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Widget \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\nvoid MClassFactory::registerWidgetCreator(MWidgetCreatorBase *creator, const char *widgetClassName)\n{\n    QByteArray type(widgetClassName);\n    if (type.isEmpty())\n        qFatal(\"MClassFactory cannot register MWidgetCreator with empty type identifier\");\n\n    if (d_ptr->widgetCreators.contains(type)) {\n        qWarning(\"MClassFactory already contains MWidgetCreator for %s\", widgetClassName);\n    } else {\n        d_ptr->widgetCreators.insert(type, creator);\n    }\n}\n\nvoid MClassFactory::unregisterWidgetCreator(MWidgetCreatorBase *creator)\n{\n    QByteArray widgetClassName = d_ptr->widgetCreators.key(creator);\n    if (widgetClassName.isEmpty()) {\n        MClassFactoryPrivate::registerDefaultMessageHandler();\n        qWarning(\"MClassFactory cannot unregister MWidgetCreator which is not registered\");\n    } else {\n        d_ptr->widgetCreators.remove(widgetClassName);\n    }\n}\n\nQString MClassFactory::widgetAssemblyName(const QByteArray &widgetClassName) const\n{\n    const MWidgetCreatorBase *widgetCreator = d_ptr->widgetCreators.value(widgetClassName, NULL);\n    if (!widgetCreator) {\n        return QString();\n    }\n    return widgetCreator->assemblyName();\n}\n\nM::AssemblyType MClassFactory::widgetAssemblyType(const QByteArray &widgetClassName) const\n{\n    const MWidgetCreatorBase *widgetCreator = d_ptr->widgetCreators.value(widgetClassName, NULL);\n    if (!widgetCreator) {\n        return M::AssemblyNone;\n    }\n    return widgetCreator->assemblyType();\n}\n\n\/\/\/\/\/\/\/\/\/\/\n\/\/ View \/\/\n\/\/\/\/\/\/\/\/\/\/\nvoid MClassFactory::registerViewCreator(MViewCreatorBase *creator, const char *viewClassName)\n{\n    QString type(viewClassName);\n    if (type.isEmpty())\n        qFatal(\"MClassFactory cannot register MViewCreator with empty type identifier\");\n\n    if (d_ptr->viewCreators.contains(type)) {\n        qWarning(\"MClassFactory already contains MViewCreator for %s\", viewClassName);\n    } else {\n        d_ptr->viewCreators.insert(type, creator);\n    }\n}\n\nvoid MClassFactory::unregisterViewCreator(MViewCreatorBase *creator)\n{\n    QString viewClassName = d_ptr->viewCreators.key(creator);\n    if (viewClassName.isEmpty()) {\n        MClassFactoryPrivate::registerDefaultMessageHandler();\n        qWarning(\"MClassFactory cannot unregister MViewCreator which is not registered\");\n    } else {\n        d_ptr->viewCreators.remove(viewClassName);\n    }\n}\n\nMWidgetView *MClassFactory::createView(const char *viewClassName, const MWidgetController *controller) const\n{\n    const MViewCreatorBase *viewCreator = d_ptr->viewCreators.value(QString(viewClassName), NULL);\n    if (!viewCreator) {\n        mWarning(\"MClassFactory\") << \"could not create\" << viewClassName;\n        return NULL;\n    }\n    return viewCreator->create(controller);\n}\n\nconst char *MClassFactory::viewStyleType(const char *viewClassName) const\n{\n    const MViewCreatorBase *viewCreator = d_ptr->viewCreators.value(QString(viewClassName), NULL);\n    if (!viewCreator) {\n        mWarning(\"MClassFactory\") << \"could not find\" << viewClassName;\n        return NULL;\n    }\n    return viewCreator->styleType();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Style \/\/\n\/\/\/\/\/\/\/\/\/\/\/\nvoid MClassFactory::registerStyleCreator(MStyleCreatorBase *creator, const char *styleClassName)\n{\n    QString type(styleClassName);\n    if (type.isEmpty())\n        qFatal(\"MClassFactory cannot register MStyleCreator with empty type identifier\");\n\n    if (d_ptr->styleCreators.contains(type)) {\n        qWarning(\"MClassFactory already contains MStyleCreator for %s\", styleClassName);\n    } else {\n        d_ptr->styleCreators.insert(type, creator);\n    }\n}\n\nvoid MClassFactory::unregisterStyleCreator(MStyleCreatorBase *creator)\n{\n    QString styleClassName = d_ptr->styleCreators.key(creator);\n    if (styleClassName.isEmpty()) {\n        MClassFactoryPrivate::registerDefaultMessageHandler();\n        qWarning(\"MClassFactory cannot unregister MStyleCreator which is not registered\");\n    } else {\n        d_ptr->styleCreators.remove(styleClassName);\n    }\n}\n\nMStyle *MClassFactory::createStyle(const char *styleClassName) const\n{\n    const MStyleCreatorBase *styleCreator = d_ptr->styleCreators.value(QString(styleClassName), NULL);\n    if (!styleCreator) {\n        mWarning(\"MClassFactory\") << \"could not create\" << styleClassName;\n        return NULL;\n    }\n    return styleCreator->create();\n}\n\nconst char *MClassFactory::styleAttributeType(const char *styleClassName, const char *attributeName) const\n{\n    const MStyleCreatorBase *styleCreator = d_ptr->styleCreators.value(QString(styleClassName), NULL);\n    if (!styleCreator) {\n        mWarning(\"MClassFactory\") << \"could not find\" << styleClassName;\n        return NULL;\n    }\n    return styleCreator->attributeType(attributeName);\n}\n\nconst QMetaObject *MClassFactory::styleMetaObject(const char *styleClassName) const\n{\n    const MStyleCreatorBase *styleCreator = d_ptr->styleCreators.value(QString(styleClassName), NULL);\n    if (!styleCreator) {\n        mWarning(\"MClassFactory\") << \"could not find meta object for\" << styleClassName;\n        return NULL;\n    }\n    return styleCreator->metaObject();\n}\n\nQString MClassFactory::styleAssemblyName(const char *styleClassName) const\n{\n    const MStyleCreatorBase *styleCreator = d_ptr->styleCreators.value(QString(styleClassName), NULL);\n    if (!styleCreator) {\n        mWarning(\"MClassFactory\") << \"could not find assembly name for\" << styleClassName;\n        return QString();\n    }\n    return styleCreator->assemblyName();\n}\n\nM::AssemblyType MClassFactory::styleAssemblyType(const char *styleClassName) const\n{\n    const MStyleCreatorBase *styleCreator = d_ptr->styleCreators.value(QString(styleClassName), NULL);\n    if (!styleCreator) {\n        mWarning(\"MClassFactory\") << \"could not find assembly type for\" << styleClassName;\n        return M::AssemblyNone;\n    }\n    return styleCreator->assemblyType();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Animation \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid MClassFactory::registerAnimationCreator(MAnimationCreatorBase *creator, const char *animationClassName)\n{\n    QString type(animationClassName);\n    if (type.isEmpty())\n        qFatal(\"MClassFactory cannot register MAnimationCreator with empty type identifier\");\n\n    if (d_ptr->animationCreators.contains(type)) {\n        qWarning(\"MClassFactory already contains MAnimationCreator for %s\", animationClassName);\n    } else {\n        d_ptr->animationCreators.insert(type, creator);\n    }\n}\n\nvoid MClassFactory::unregisterAnimationCreator(MAnimationCreatorBase *creator)\n{\n    QString animationClassName = d_ptr->animationCreators.key(creator);\n    if (animationClassName.isEmpty()) {\n        MClassFactoryPrivate::registerDefaultMessageHandler();\n        qWarning(\"MClassFactory cannot unregister MAnimationCreator which is not registered\");\n    } else {\n        d_ptr->animationCreators.remove(animationClassName);\n    }\n}\n\nQAbstractAnimation *MClassFactory::createAnimation(const QString &animationClassName) const\n{\n    const MAnimationCreatorBase *animationCreator = d_ptr->animationCreators.value(animationClassName, NULL);\n    if (!animationCreator) {\n        mWarning(\"MClassFactory\") << \"could not create\" << animationClassName;\n        return NULL;\n    }\n    return animationCreator->create();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Effect    \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid MClassFactory::registerEffectCreator(MEffectCreatorBase *creator, const char *effectClassName)\n{\n    QString type(effectClassName);\n    if (type.isEmpty())\n        qFatal(\"MClassFactory cannot register MEffectCreator with empty type identifier\");\n\n    if (d_ptr->effectCreators.contains(type)) {\n        qWarning(\"MClassFactory already contains MEffectCreator for %s\", effectClassName);\n    } else {\n        d_ptr->effectCreators.insert(type, creator);\n    }\n}\n\nvoid MClassFactory::unregisterEffectCreator(MEffectCreatorBase *creator)\n{\n    QString effectClassName = d_ptr->effectCreators.key(creator);\n    if (effectClassName.isEmpty()) {\n        MClassFactoryPrivate::registerDefaultMessageHandler();\n        qWarning(\"MClassFactory cannot unregister MEffectCreator which is not registered\");\n    } else {\n        d_ptr->effectCreators.remove(effectClassName);\n    }\n}\n\nQGraphicsEffect *MClassFactory::createEffect(const QString &effectClassName) const\n{\n    const MEffectCreatorBase *effectCreator = d_ptr->effectCreators.value(effectClassName, NULL);\n    if (!effectCreator) {\n        mWarning(\"MClassFactory\") << \"could not create\" << effectClassName;\n        return NULL;\n    }\n    return effectCreator->create();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * RInterface.hpp\n *\n * Copyright (C) 2009-17 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#ifndef R_INTERFACE_HPP\n#define R_INTERFACE_HPP\n\n#include <string>\n#include <setjmp.h>\n\n#ifdef _WIN32\n\n#include <R_ext\/Boolean.h>\n#include <R_ext\/RStartup.h>\n\nextern \"C\" {\n\nvoid R_RestoreGlobalEnvFromFile(const char *, Rboolean);\nvoid R_SaveGlobalEnvToFile(const char *);\nvoid R_Suicide(const char *);\nchar *R_HomeDir(void);\nvoid Rf_jump_to_toplevel(void);\nvoid Rf_onintr(void);\n#define R_ClearerrConsole void\nvoid R_FlushConsole();\nvoid run_Rmainloop();\nvoid Rf_mainloop(void);\n\nextern __declspec(dllimport) int R_SignalHandlers;\nextern __declspec(dllimport) void* R_GlobalContext;\n\n}\n\ntypedef struct SEXPREC *SEXP;\n\n#else\n\n#define R_INTERFACE_PTRS 1\n#include <Rinterface.h>\n\n#endif\n\ntypedef struct R_BCSTACK_T {\n   int tag;\n   union {\n      int ival;\n      double dval;\n      SEXP sxpval;\n   } u;\n} R_BCSTACK_T;\n\ntypedef struct RCNTXT_40 {\n    struct RCNTXT_40 *nextcontext;\n    int callflag;\n#ifdef _WIN32\n    struct\n    {\n      jmp_buf buf;\n      int sigmask;\n      int savedmask;\n    } cjumpbuf;\n#else\n    sigjmp_buf cjmpbuf;\n#endif\n    int cstacktop;\n    int evaldepth;\n    SEXP promargs;\n    SEXP callfun;\n    SEXP sysparent;\n    SEXP call;\n    SEXP cloenv;\n    SEXP conexit;\n    void (*cend)(void *);\n    void *cenddata;\n    void *vmax;\n    int intsusp;\n    int gcenabled;\n    int bcintactive;\n    SEXP bcbody;\n    void *bcpc;\n    SEXP handlerstack;\n    SEXP restartstack;\n    struct RPRSTACK *prstack;\n    R_BCSTACK_T *nodestack;\n    R_BCSTACK_T *bcprottop; \/\/ new in R 4.0\n#ifdef BC_INT_STACK\n    IStackval *intstack;\n#endif\n    SEXP srcref;\n    int browserfinish;\n    SEXP returnValue;\n    struct RCNTXT_40 *jumptarget;\n    int jumpmask;\n} RCNTXT_40;\n\ntypedef struct RCNTXT_34 {\n    struct RCNTXT_34 *nextcontext;\n    int callflag;\n#ifdef _WIN32\n    struct\n    {\n      jmp_buf buf;\n      int sigmask;\n      int savedmask;\n    } cjumpbuf;\n#else\n    sigjmp_buf cjmpbuf;\n#endif\n    int cstacktop;\n    int evaldepth;\n    SEXP promargs;\n    SEXP callfun;\n    SEXP sysparent;\n    SEXP call;\n    SEXP cloenv;\n    SEXP conexit;\n    void (*cend)(void *);\n    void *cenddata;\n    void *vmax;\n    int intsusp;\n    int gcenabled;\n    int bcintactive;\n    SEXP bcbody;\n    void *bcpc;\n    SEXP handlerstack;\n    SEXP restartstack;\n    struct RPRSTACK *prstack;\n    R_BCSTACK_T *nodestack;\n#ifdef BC_INT_STACK\n    IStackval *intstack;\n#endif\n    SEXP srcref;\n    int browserfinish;\n    SEXP returnValue;\n    struct RCNTXT_34 *jumptarget;\n    int jumpmask;\n} RCNTXT_34;\n\ntypedef struct RCNTXT_33 {\n    struct RCNTXT_33 *nextcontext;\n    int callflag;\n#ifdef _WIN32\n    struct\n    {\n      jmp_buf buf;\n      int sigmask;\n      int savedmask;\n    } cjumpbuf;\n#else\n    sigjmp_buf cjmpbuf;\n#endif\n    int cstacktop;\n    int evaldepth;\n    SEXP promargs;\n    SEXP callfun;\n    SEXP sysparent;\n    SEXP call;\n    SEXP cloenv;\n    SEXP conexit;\n    void (*cend)(void *);\n    void *cenddata;\n    void *vmax;\n    int intsusp;\n    int gcenabled;\n    SEXP handlerstack;\n    SEXP restartstack;\n    struct RPRSTACK *prstack;\n    SEXP *nodestack;\n#ifdef BC_INT_STACK\n    IStackval *intstack;\n#endif\n    SEXP srcref;\n    int browserfinish;\n    SEXP returnValue;\n    struct RCNTXT_33 *jumptarget;\n    int jumpmask;\n} RCNTXT_33;\n\ntypedef struct RCNTXT_32 {\n    struct RCNTXT_32 *nextcontext;\n    int callflag;\n#ifdef _WIN32\n    struct\n    {\n      jmp_buf buf;\n      int sigmask;\n      int savedmask;\n    } cjumpbuf;\n#else\n    sigjmp_buf cjmpbuf;\n#endif\n    int cstacktop;\n    int evaldepth;\n    SEXP promargs;\n    SEXP callfun;\n    SEXP sysparent;\n    SEXP call;\n    SEXP cloenv;\n    SEXP conexit;\n    void (*cend)(void *);\n    void *cenddata;\n    void *vmax;\n    int intsusp;\n    SEXP handlerstack;\n    SEXP restartstack;\n    struct RPRSTACK *prstack;\n    SEXP *nodestack;\n#ifdef BC_INT_STACK\n    IStackval *intstack;\n#endif\n    SEXP srcref;\n} RCNTXT_32;\n\nenum {\n    CTXT_TOPLEVEL = 0,\n    CTXT_NEXT\t  = 1,\n    CTXT_BREAK\t  = 2,\n    CTXT_LOOP\t  = 3,\n    CTXT_FUNCTION = 4,\n    CTXT_CCODE\t  = 8,\n    CTXT_RETURN\t  = 12,\n    CTXT_BROWSER  = 16,\n    CTXT_GENERIC  = 20,\n    CTXT_RESTART  = 32,\n    CTXT_BUILTIN  = 64\n};\n\nnamespace rstudio {\nnamespace r {\n\ninline void* getGlobalContext()\n{\n   return R_GlobalContext;\n}\n\n} \/\/ namespace r\n} \/\/ namespace rstudio\n\n#endif \/\/ R_INTERFACE_HPP\n\n<commit_msg>update struct defs; remove unused BC_INT_STACK<commit_after>\/*\n * RInterface.hpp\n *\n * Copyright (C) 2009-19 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#ifndef R_INTERFACE_HPP\n#define R_INTERFACE_HPP\n\n#include <string>\n#include <setjmp.h>\n\n#ifdef _WIN32\n\n#include <R_ext\/Boolean.h>\n#include <R_ext\/RStartup.h>\n\nextern \"C\" {\n\nvoid R_RestoreGlobalEnvFromFile(const char *, Rboolean);\nvoid R_SaveGlobalEnvToFile(const char *);\nvoid R_Suicide(const char *);\nchar *R_HomeDir(void);\nvoid Rf_jump_to_toplevel(void);\nvoid Rf_onintr(void);\n#define R_ClearerrConsole void\nvoid R_FlushConsole();\nvoid run_Rmainloop();\nvoid Rf_mainloop(void);\n\nextern __declspec(dllimport) int R_SignalHandlers;\nextern __declspec(dllimport) void* R_GlobalContext;\n\n}\n\ntypedef struct SEXPREC *SEXP;\n\n#else\n\n#define R_INTERFACE_PTRS 1\n#include <Rinterface.h>\n\n#endif\n\ntypedef struct R_BCSTACK_T {\n   int tag;\n   int flags;\n   union {\n      int ival;\n      double dval;\n      SEXP sxpval;\n   } u;\n} R_BCSTACK_T;\n\ntypedef struct RCNTXT_40 {\n    struct RCNTXT_40 *nextcontext;\n    int callflag;\n#ifdef _WIN32\n    struct\n    {\n      jmp_buf buf;\n      int sigmask;\n      int savedmask;\n    } cjumpbuf;\n#else\n    sigjmp_buf cjmpbuf;\n#endif\n    int cstacktop;\n    int evaldepth;\n    SEXP promargs;\n    SEXP callfun;\n    SEXP sysparent;\n    SEXP call;\n    SEXP cloenv;\n    SEXP conexit;\n    void (*cend)(void *);\n    void *cenddata;\n    void *vmax;\n    int intsusp;\n    int gcenabled;\n    int bcintactive;\n    SEXP bcbody;\n    void *bcpc;\n    SEXP handlerstack;\n    SEXP restartstack;\n    struct RPRSTACK *prstack;\n    R_BCSTACK_T *nodestack;\n    R_BCSTACK_T *bcprottop; \/\/ new in R 4.0\n    SEXP srcref;\n    int browserfinish;\n    SEXP returnValue;\n    struct RCNTXT_40 *jumptarget;\n    int jumpmask;\n} RCNTXT_40;\n\ntypedef struct RCNTXT_34 {\n    struct RCNTXT_34 *nextcontext;\n    int callflag;\n#ifdef _WIN32\n    struct\n    {\n      jmp_buf buf;\n      int sigmask;\n      int savedmask;\n    } cjumpbuf;\n#else\n    sigjmp_buf cjmpbuf;\n#endif\n    int cstacktop;\n    int evaldepth;\n    SEXP promargs;\n    SEXP callfun;\n    SEXP sysparent;\n    SEXP call;\n    SEXP cloenv;\n    SEXP conexit;\n    void (*cend)(void *);\n    void *cenddata;\n    void *vmax;\n    int intsusp;\n    int gcenabled;\n    int bcintactive;\n    SEXP bcbody;\n    void *bcpc;\n    SEXP handlerstack;\n    SEXP restartstack;\n    struct RPRSTACK *prstack;\n    struct {\n       int tag;\n       union {\n          int ival;\n          double dval;\n          SEXP sxpval;\n       } u;\n    } *nodestack;\n#ifdef BC_INT_STACK\n    IStackval *intstack;\n#endif\n    SEXP srcref;\n    int browserfinish;\n    SEXP returnValue;\n    struct RCNTXT_34 *jumptarget;\n    int jumpmask;\n} RCNTXT_34;\n\ntypedef struct RCNTXT_33 {\n    struct RCNTXT_33 *nextcontext;\n    int callflag;\n#ifdef _WIN32\n    struct\n    {\n      jmp_buf buf;\n      int sigmask;\n      int savedmask;\n    } cjumpbuf;\n#else\n    sigjmp_buf cjmpbuf;\n#endif\n    int cstacktop;\n    int evaldepth;\n    SEXP promargs;\n    SEXP callfun;\n    SEXP sysparent;\n    SEXP call;\n    SEXP cloenv;\n    SEXP conexit;\n    void (*cend)(void *);\n    void *cenddata;\n    void *vmax;\n    int intsusp;\n    int gcenabled;\n    SEXP handlerstack;\n    SEXP restartstack;\n    struct RPRSTACK *prstack;\n    SEXP *nodestack;\n#ifdef BC_INT_STACK\n    IStackval *intstack;\n#endif\n    SEXP srcref;\n    int browserfinish;\n    SEXP returnValue;\n    struct RCNTXT_33 *jumptarget;\n    int jumpmask;\n} RCNTXT_33;\n\ntypedef struct RCNTXT_32 {\n    struct RCNTXT_32 *nextcontext;\n    int callflag;\n#ifdef _WIN32\n    struct\n    {\n      jmp_buf buf;\n      int sigmask;\n      int savedmask;\n    } cjumpbuf;\n#else\n    sigjmp_buf cjmpbuf;\n#endif\n    int cstacktop;\n    int evaldepth;\n    SEXP promargs;\n    SEXP callfun;\n    SEXP sysparent;\n    SEXP call;\n    SEXP cloenv;\n    SEXP conexit;\n    void (*cend)(void *);\n    void *cenddata;\n    void *vmax;\n    int intsusp;\n    SEXP handlerstack;\n    SEXP restartstack;\n    struct RPRSTACK *prstack;\n    SEXP *nodestack;\n#ifdef BC_INT_STACK\n    IStackval *intstack;\n#endif\n    SEXP srcref;\n} RCNTXT_32;\n\nenum {\n    CTXT_TOPLEVEL = 0,\n    CTXT_NEXT\t  = 1,\n    CTXT_BREAK\t  = 2,\n    CTXT_LOOP\t  = 3,\n    CTXT_FUNCTION = 4,\n    CTXT_CCODE\t  = 8,\n    CTXT_RETURN\t  = 12,\n    CTXT_BROWSER  = 16,\n    CTXT_GENERIC  = 20,\n    CTXT_RESTART  = 32,\n    CTXT_BUILTIN  = 64\n};\n\nnamespace rstudio {\nnamespace r {\n\ninline void* getGlobalContext()\n{\n   return R_GlobalContext;\n}\n\n} \/\/ namespace r\n} \/\/ namespace rstudio\n\n#endif \/\/ R_INTERFACE_HPP\n\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <cassert>\n#include <iosfwd>\n\n#include \"sdd\/internal_manager_fwd.hh\"\n#include \"sdd\/dd\/context_fwd.hh\"\n#include \"sdd\/dd\/definition.hh\"\n#include \"sdd\/dd\/operations_fwd.hh\"\n#include \"sdd\/dd\/square_union.hh\"\n#include \"sdd\/dd\/top.hh\"\n#include \"sdd\/util\/hash.hh\"\n#include \"sdd\/values\/empty.hh\"\n\nnamespace sdd {\n\n\/*------------------------------------------------------------------------------------------------*\/\n\nnamespace dd {\n\n\/\/\/ @internal\n\/\/\/ @brief Implementation of the difference operation.\n\/\/\/\n\/\/\/ Called by difference_op.\ntemplate <typename C>\nstruct difference_visitor\n{\n  \/\/\/ @brief The evaluation context.\n  context<C>& cxt_;\n\n  difference_visitor(context<C>& cxt)\n  noexcept\n  \t: cxt_(cxt)\n  {}\n\n  \/\/\/ @brief Perform the difference operation.\n  template <typename Valuation>\n  SDD<C>\n  operator()( const node<C, Valuation>& lhs, const node<C, Valuation>& rhs\n            , const SDD<C>& lhs_orig, const SDD<C>& rhs_orig)\n  const\n  {\n    \/\/ Check if both operands are compatible.\n    if (not (lhs.variable() == rhs.variable()))\n    {\n      throw top<C>(lhs_orig, rhs_orig);\n    }\n\n    mem::rewinder _(cxt_.arena());\n\n    \/\/ Compute union of all rhs valuations.\n    sum_builder<C, Valuation> sum_builder(cxt_);\n    sum_builder.reserve(rhs.size());\n    for (auto& rhs_arc : rhs)\n    {\n      sum_builder.add(rhs_arc.valuation());\n    }\n    auto rhs_union = sum(cxt_, std::move(sum_builder));\n\n    square_union<C, Valuation> su(cxt_);\n\n    \/\/ We iterate two times on lhs's alpha, and we possibly add each arc, modified, two times.\n    \/\/ First when removing rhs_union, then when we look for all common parts.\n    su.reserve(lhs.size() * 2);\n\n    \/\/ For each valuation of lhs, remove the quantity rhs_union.\n    for (auto& lhs_arc : lhs)\n    {\n      auto tmp = difference(cxt_, lhs_arc.valuation(), std::move(rhs_union));\n      if (not values::empty_values(tmp))\n      {\n        su.add(lhs_arc.successor(), std::move(tmp));\n      }\n    }\n\n    \/\/ For all common parts, propagate the difference on succcessors.\n    for (auto& lhs_arc : lhs)\n    {\n      for (auto& rhs_arc : rhs)\n      {\n        intersection_builder<C, Valuation> inter_builder(cxt_);\n        inter_builder.add(lhs_arc.valuation());\n        inter_builder.add(rhs_arc.valuation());\n        Valuation tmp_val = intersection(cxt_, std::move(inter_builder));\n        if (not values::empty_values(tmp_val))\n        {\n          SDD<C> tmp_succ = difference(cxt_, lhs_arc.successor(), rhs_arc.successor());\n          if (not values::empty_values(tmp_succ))\n          {\n            su.add(std::move(tmp_succ), std::move(tmp_val));\n          }\n        }\n      }\n    }\n\n    return su.empty()\n         ? zero<C>() \/\/ avoid a useless allocation when calling square_union::operator()\n         : SDD<C>(lhs.variable(), su());\n  }\n\n  \/\/\/ @brief Always an error, difference with |0| is not cached.\n  SDD<C>\n  operator()(const zero_terminal<C>&, const zero_terminal<C>&, const SDD<C>&, const SDD<C>&)\n  const noexcept\n  {\n    assert(false && \"SDD difference: |0| in cache.\");\n    __builtin_unreachable();\n  }\n\n  \/\/\/ @brief Always an error, difference with |1| is not cached.\n  SDD<C>\n  operator()(const one_terminal<C>&, const one_terminal<C>&, const SDD<C>&, const SDD<C>&)\n  const noexcept\n  {\n    assert(false && \"SDD difference: |1| in cache.\");\n    __builtin_unreachable();\n  }\n\n  \/\/\/ @brief The difference of two different types is always an error.\n  template <typename T, typename U>\n  __attribute__((noreturn))\n  SDD<C>\n  operator()(const T&, const U&, const SDD<C>& lhs_orig, const SDD<C>& rhs_orig)\n  const\n  {\n    throw top<C>(lhs_orig, rhs_orig);\n  }\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @internal\n\/\/\/ @brief The difference operation in the cache.\ntemplate <typename C>\nstruct difference_op\n{\n  \/\/\/ @brief Needed by the cache to know the result of this operation.\n  using result_type = SDD<C>;\n\n  \/\/\/ @brief The left operand of this difference operation.\n  const SDD<C> left;\n\n  \/\/\/ @brief The right operand of this difference operation.\n  const SDD<C> right;\n\n  \/\/\/ @brief Constructor.\n  difference_op(SDD<C>&& l, SDD<C>&& r)\n  \t: left(std::move(l)), right(std::move(r))\n  {}\n\n  \/\/\/ @brief Apply this operation.\n  \/\/\/\n  \/\/\/ Called by the cache.\n  SDD<C>\n  operator()(context<C>& cxt)\n  const\n  {\n    return binary_visit(difference_visitor<C>(cxt), left, right, left, right);\n  }\n\n  friend\n  bool\n  operator==(const difference_op& lhs, const difference_op& rhs)\n  noexcept\n  {\n    return lhs.left == rhs.left and lhs.right == rhs.right;\n  }\n\n  friend\n  std::ostream&\n  operator<<(std::ostream& os, const difference_op& x)\n  {\n    return os << \"- (\" << x.left << \",\" << x.right << \")\";\n  }\n\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @internal\n\/\/\/ @related SDD\n\/\/\/ @brief The difference operation.\n\/\/\/\n\/\/\/ The computation is cached, except for the trivial cases (when the two operands are\n\/\/\/ equal or when one of the operand is |0|).\ntemplate <typename C>\ninline\nSDD<C>\ndifference(context<C>& cxt, SDD<C> lhs, SDD<C> rhs)\n{\n  if (lhs == rhs or lhs == zero<C>())\n  {\n    return zero<C>();\n  }\n  else if (rhs == zero<C>())\n  {\n    return lhs;\n  }\n  return cxt.difference_cache()(difference_op<C>(std::move(lhs), std::move(rhs)));\n}\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @internal\ntemplate <typename C, typename Values>\ninline\nValues\ndifference(context<C>&, const Values& lhs, const Values& rhs)\n{\n  return difference(lhs, rhs);\n}\n\n} \/\/ namespace dd\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @brief Perform the difference of two SDD.\n\/\/\/ @related SDD\ntemplate <typename C>\ninline\nSDD<C>\noperator-(const SDD<C>& lhs, const SDD<C>& rhs)\n{\n  return dd::difference(global<C>().sdd_context, lhs, rhs);\n}\n\n\/\/\/ @brief Perform the difference of two SDD.\n\/\/\/ @related SDD\ntemplate <typename C>\ninline\nSDD<C>&\noperator-=(SDD<C>& lhs, const SDD<C>& rhs)\n{\n  SDD<C> tmp = dd::difference(global<C>().sdd_context, lhs, rhs);\n  using std::swap;\n  swap(tmp, lhs);\n  return lhs;\n}\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n} \/\/ namespace sdd\n\nnamespace std {\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @internal\n\/\/\/ @brief Hash specialization for sdd::dd::difference_op\ntemplate <typename C>\nstruct hash<sdd::dd::difference_op<C>>\n{\n  std::size_t\n  operator()(const sdd::dd::difference_op<C>& op)\n  const\n  {\n    using namespace sdd::hash;\n    return seed(op.left) (val(op.right));\n  }\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n} \/\/ namespace std\n<commit_msg>Fix incorrect move<commit_after>#pragma once\n\n#include <cassert>\n#include <iosfwd>\n\n#include \"sdd\/internal_manager_fwd.hh\"\n#include \"sdd\/dd\/context_fwd.hh\"\n#include \"sdd\/dd\/definition.hh\"\n#include \"sdd\/dd\/operations_fwd.hh\"\n#include \"sdd\/dd\/square_union.hh\"\n#include \"sdd\/dd\/top.hh\"\n#include \"sdd\/util\/hash.hh\"\n#include \"sdd\/values\/empty.hh\"\n\nnamespace sdd {\n\n\/*------------------------------------------------------------------------------------------------*\/\n\nnamespace dd {\n\n\/\/\/ @internal\n\/\/\/ @brief Implementation of the difference operation.\n\/\/\/\n\/\/\/ Called by difference_op.\ntemplate <typename C>\nstruct difference_visitor\n{\n  \/\/\/ @brief The evaluation context.\n  context<C>& cxt_;\n\n  difference_visitor(context<C>& cxt)\n  noexcept\n  \t: cxt_(cxt)\n  {}\n\n  \/\/\/ @brief Perform the difference operation.\n  template <typename Valuation>\n  SDD<C>\n  operator()( const node<C, Valuation>& lhs, const node<C, Valuation>& rhs\n            , const SDD<C>& lhs_orig, const SDD<C>& rhs_orig)\n  const\n  {\n    \/\/ Check if both operands are compatible.\n    if (not (lhs.variable() == rhs.variable()))\n    {\n      throw top<C>(lhs_orig, rhs_orig);\n    }\n\n    mem::rewinder _(cxt_.arena());\n\n    \/\/ Compute union of all rhs valuations.\n    sum_builder<C, Valuation> sum_builder(cxt_);\n    sum_builder.reserve(rhs.size());\n    for (auto& rhs_arc : rhs)\n    {\n      sum_builder.add(rhs_arc.valuation());\n    }\n    auto rhs_union = sum(cxt_, std::move(sum_builder));\n\n    square_union<C, Valuation> su(cxt_);\n\n    \/\/ We iterate two times on lhs's alpha, and we possibly add each arc, modified, two times.\n    \/\/ First when removing rhs_union, then when we look for all common parts.\n    su.reserve(lhs.size() * 2);\n\n    \/\/ For each valuation of lhs, remove the quantity rhs_union.\n    for (auto& lhs_arc : lhs)\n    {\n      auto tmp = difference(cxt_, lhs_arc.valuation(), rhs_union);\n      if (not values::empty_values(tmp))\n      {\n        su.add(lhs_arc.successor(), std::move(tmp));\n      }\n    }\n\n    \/\/ For all common parts, propagate the difference on succcessors.\n    for (auto& lhs_arc : lhs)\n    {\n      for (auto& rhs_arc : rhs)\n      {\n        intersection_builder<C, Valuation> inter_builder(cxt_);\n        inter_builder.add(lhs_arc.valuation());\n        inter_builder.add(rhs_arc.valuation());\n        Valuation tmp_val = intersection(cxt_, std::move(inter_builder));\n        if (not values::empty_values(tmp_val))\n        {\n          SDD<C> tmp_succ = difference(cxt_, lhs_arc.successor(), rhs_arc.successor());\n          if (not values::empty_values(tmp_succ))\n          {\n            su.add(std::move(tmp_succ), std::move(tmp_val));\n          }\n        }\n      }\n    }\n\n    return su.empty()\n         ? zero<C>() \/\/ avoid a useless allocation when calling square_union::operator()\n         : SDD<C>(lhs.variable(), su());\n  }\n\n  \/\/\/ @brief Always an error, difference with |0| is not cached.\n  SDD<C>\n  operator()(const zero_terminal<C>&, const zero_terminal<C>&, const SDD<C>&, const SDD<C>&)\n  const noexcept\n  {\n    assert(false && \"SDD difference: |0| in cache.\");\n    __builtin_unreachable();\n  }\n\n  \/\/\/ @brief Always an error, difference with |1| is not cached.\n  SDD<C>\n  operator()(const one_terminal<C>&, const one_terminal<C>&, const SDD<C>&, const SDD<C>&)\n  const noexcept\n  {\n    assert(false && \"SDD difference: |1| in cache.\");\n    __builtin_unreachable();\n  }\n\n  \/\/\/ @brief The difference of two different types is always an error.\n  template <typename T, typename U>\n  __attribute__((noreturn))\n  SDD<C>\n  operator()(const T&, const U&, const SDD<C>& lhs_orig, const SDD<C>& rhs_orig)\n  const\n  {\n    throw top<C>(lhs_orig, rhs_orig);\n  }\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @internal\n\/\/\/ @brief The difference operation in the cache.\ntemplate <typename C>\nstruct difference_op\n{\n  \/\/\/ @brief Needed by the cache to know the result of this operation.\n  using result_type = SDD<C>;\n\n  \/\/\/ @brief The left operand of this difference operation.\n  const SDD<C> left;\n\n  \/\/\/ @brief The right operand of this difference operation.\n  const SDD<C> right;\n\n  \/\/\/ @brief Constructor.\n  difference_op(SDD<C>&& l, SDD<C>&& r)\n  \t: left(std::move(l)), right(std::move(r))\n  {}\n\n  \/\/\/ @brief Apply this operation.\n  \/\/\/\n  \/\/\/ Called by the cache.\n  SDD<C>\n  operator()(context<C>& cxt)\n  const\n  {\n    return binary_visit(difference_visitor<C>(cxt), left, right, left, right);\n  }\n\n  friend\n  bool\n  operator==(const difference_op& lhs, const difference_op& rhs)\n  noexcept\n  {\n    return lhs.left == rhs.left and lhs.right == rhs.right;\n  }\n\n  friend\n  std::ostream&\n  operator<<(std::ostream& os, const difference_op& x)\n  {\n    return os << \"- (\" << x.left << \",\" << x.right << \")\";\n  }\n\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @internal\n\/\/\/ @related SDD\n\/\/\/ @brief The difference operation.\n\/\/\/\n\/\/\/ The computation is cached, except for the trivial cases (when the two operands are\n\/\/\/ equal or when one of the operand is |0|).\ntemplate <typename C>\ninline\nSDD<C>\ndifference(context<C>& cxt, SDD<C> lhs, SDD<C> rhs)\n{\n  if (lhs == rhs or lhs == zero<C>())\n  {\n    return zero<C>();\n  }\n  else if (rhs == zero<C>())\n  {\n    return lhs;\n  }\n  return cxt.difference_cache()(difference_op<C>(std::move(lhs), std::move(rhs)));\n}\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @internal\ntemplate <typename C, typename Values>\ninline\nValues\ndifference(context<C>&, const Values& lhs, const Values& rhs)\n{\n  return difference(lhs, rhs);\n}\n\n} \/\/ namespace dd\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @brief Perform the difference of two SDD.\n\/\/\/ @related SDD\ntemplate <typename C>\ninline\nSDD<C>\noperator-(const SDD<C>& lhs, const SDD<C>& rhs)\n{\n  return dd::difference(global<C>().sdd_context, lhs, rhs);\n}\n\n\/\/\/ @brief Perform the difference of two SDD.\n\/\/\/ @related SDD\ntemplate <typename C>\ninline\nSDD<C>&\noperator-=(SDD<C>& lhs, const SDD<C>& rhs)\n{\n  SDD<C> tmp = dd::difference(global<C>().sdd_context, lhs, rhs);\n  using std::swap;\n  swap(tmp, lhs);\n  return lhs;\n}\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n} \/\/ namespace sdd\n\nnamespace std {\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @internal\n\/\/\/ @brief Hash specialization for sdd::dd::difference_op\ntemplate <typename C>\nstruct hash<sdd::dd::difference_op<C>>\n{\n  std::size_t\n  operator()(const sdd::dd::difference_op<C>& op)\n  const\n  {\n    using namespace sdd::hash;\n    return seed(op.left) (val(op.right));\n  }\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n} \/\/ namespace std\n<|endoftext|>"}
{"text":"<commit_before>#include \"ParameterMixin.h\"\n#include \"LessStylesheet.h\"\n#include \"LessRuleset.h\"\n\n#include <config.h>\n\n#ifdef WITH_LIBGLOG\n#include <glog\/logging.h>\n#endif\n\nParameterMixin::ParameterMixin() {\n  this->name = new Selector();\n  this->arguments = new list<TokenList*>();\n}\n\nParameterMixin::ParameterMixin(Selector* name, list<TokenList*>* arguments) {\n  this->name = name;\n  this->arguments = arguments;\n}\n\n\nParameterMixin::~ParameterMixin() {\n  delete this->name;\n\n  while(!arguments->empty()) {\n    delete arguments->back();\n    arguments->pop_back();\n  }\n  delete arguments;\n}\n\nbool ParameterMixin::parse(Selector* selector) {\n  \n  TokenListIterator* itl = selector->iterator();\n  \n  while (itl->hasNext() &&\n         itl->next()->type != Token::PAREN_OPEN) {\n    this->name->push(itl->current()->clone());\n  }\n\n  while(this->name->back()->type == Token::WHITESPACE)\n    delete this->name->pop();\n\n  parseArguments(itl);\n  \n  delete itl;\n  return true;\n}\n\nbool ParameterMixin::insert(Stylesheet* s, Ruleset* ruleset,\n                            LessRuleset* parent) {\n  list<TokenList*>::iterator arg_i;\n  list<LessRuleset*>::iterator i;\n  list<LessRuleset*> rulesetList;\n  LessRuleset* lessruleset;\n\n  VLOG(2) << \"Mixin: \\\"\" << *name->toString() << \"\\\"\";\n  \n  for (arg_i = arguments->begin(); arg_i != arguments->end(); arg_i++) {\n    VLOG(3) << \"Mixin Arg: \" << *(*arg_i)->toString();\n    getLessStylesheet()->getValueProcessor()->processValue(*arg_i);\n  }\n\n  rulesetList = getLessStylesheet()->getLessRulesets(this);\n  \n  for (i = rulesetList.begin(); i != rulesetList.end();\n       i++) {\n    lessruleset = *i;\n    \n    VLOG(3) << \"Mixin: \" << *lessruleset->getSelector()->toString();\n\n    if (ruleset != NULL)\n      lessruleset->insert(arguments, ruleset);\n    else\n      lessruleset->insert(arguments, s);\n  }\n\n  return !rulesetList.empty();\n}\n\nvoid ParameterMixin::setStylesheet(LessStylesheet* s) {\n  lessStylesheet = s;\n  stylesheet = s;\n}\n\nLessStylesheet* ParameterMixin::getLessStylesheet() {\n  return lessStylesheet;\n}\n\n\nvoid ParameterMixin::process(Stylesheet* s) {\n  insert(s, NULL, NULL);\n}\n\nvoid ParameterMixin::parseArguments(TokenListIterator* tli) {\n  TokenListIterator tli2 = *tli;\n  string delimiter = \",\";\n\n  TokenList* argument;\n  Token* current;\n  size_t nestedParenthesis = 0;\n\n  \/\/ if a ';' token occurs then that is the delimiter instead of the ','.\n  while (tli2.hasNext()) {\n    if (tli2.next()->str == \";\") {\n      delimiter = \";\";\n      break;\n    }\n  }\n\n  while (tli->hasNext() && tli->peek()->type != Token::PAREN_CLOSED) {\n    argument = new TokenList();\n\n    while (tli->hasNext()) {\n      current = tli->next();\n      if (nestedParenthesis == 0 &&\n          (current->str == delimiter ||\n           current->type == Token::PAREN_CLOSED))\n        break;\n      \n      if (current->type == Token::PAREN_OPEN) \n        nestedParenthesis++;\n      \n      if (current->type == Token::PAREN_CLOSED) \n        nestedParenthesis--;\n      \n      argument->push(current->clone());\n    }\n\n    this->arguments->push_back(argument);\n  }\n}\n\n<commit_msg>Updated ParameterMixin so rulesets don't call themselves unless they are parametric rulesets.<commit_after>#include \"ParameterMixin.h\"\n#include \"LessStylesheet.h\"\n#include \"LessRuleset.h\"\n\n#include <config.h>\n\n#ifdef WITH_LIBGLOG\n#include <glog\/logging.h>\n#endif\n\nParameterMixin::ParameterMixin() {\n  this->name = new Selector();\n  this->arguments = new list<TokenList*>();\n}\n\nParameterMixin::ParameterMixin(Selector* name, list<TokenList*>* arguments) {\n  this->name = name;\n  this->arguments = arguments;\n}\n\n\nParameterMixin::~ParameterMixin() {\n  delete this->name;\n\n  while(!arguments->empty()) {\n    delete arguments->back();\n    arguments->pop_back();\n  }\n  delete arguments;\n}\n\nbool ParameterMixin::parse(Selector* selector) {\n  \n  TokenListIterator* itl = selector->iterator();\n  \n  while (itl->hasNext() &&\n         itl->next()->type != Token::PAREN_OPEN) {\n    this->name->push(itl->current()->clone());\n  }\n\n  while(this->name->back()->type == Token::WHITESPACE)\n    delete this->name->pop();\n\n  parseArguments(itl);\n  \n  delete itl;\n  return true;\n}\n\nbool ParameterMixin::insert(Stylesheet* s, Ruleset* ruleset,\n                            LessRuleset* parent) {\n  list<TokenList*>::iterator arg_i;\n  list<LessRuleset*>::iterator i;\n  list<LessRuleset*> rulesetList;\n  LessRuleset* lessruleset;\n\n  VLOG(2) << \"Mixin: \\\"\" << *name->toString() << \"\\\"\";\n  \n  for (arg_i = arguments->begin(); arg_i != arguments->end(); arg_i++) {\n    VLOG(3) << \"Mixin Arg: \" << *(*arg_i)->toString();\n    getLessStylesheet()->getValueProcessor()->processValue(*arg_i);\n  }\n\n  rulesetList = getLessStylesheet()->getLessRulesets(this);\n  \n  for (i = rulesetList.begin(); i != rulesetList.end();\n       i++) {\n    lessruleset = *i;\n    \n    VLOG(3) << \"Mixin: \" << *lessruleset->getSelector()->toString();\n\n    if (parent == NULL || parent != lessruleset ||\n        lessruleset->getLessSelector()->needsArguments()) {\n      if (ruleset != NULL)\n        lessruleset->insert(arguments, ruleset);\n      else\n        lessruleset->insert(arguments, s);\n    }\n  }\n\n  return !rulesetList.empty();\n}\n\nvoid ParameterMixin::setStylesheet(LessStylesheet* s) {\n  lessStylesheet = s;\n  stylesheet = s;\n}\n\nLessStylesheet* ParameterMixin::getLessStylesheet() {\n  return lessStylesheet;\n}\n\n\nvoid ParameterMixin::process(Stylesheet* s) {\n  insert(s, NULL, NULL);\n}\n\nvoid ParameterMixin::parseArguments(TokenListIterator* tli) {\n  TokenListIterator tli2 = *tli;\n  string delimiter = \",\";\n\n  TokenList* argument;\n  Token* current;\n  size_t nestedParenthesis = 0;\n\n  \/\/ if a ';' token occurs then that is the delimiter instead of the ','.\n  while (tli2.hasNext()) {\n    if (tli2.next()->str == \";\") {\n      delimiter = \";\";\n      break;\n    }\n  }\n\n  while (tli->hasNext() && tli->peek()->type != Token::PAREN_CLOSED) {\n    argument = new TokenList();\n\n    while (tli->hasNext()) {\n      current = tli->next();\n      if (nestedParenthesis == 0 &&\n          (current->str == delimiter ||\n           current->type == Token::PAREN_CLOSED))\n        break;\n      \n      if (current->type == Token::PAREN_OPEN) \n        nestedParenthesis++;\n      \n      if (current->type == Token::PAREN_CLOSED) \n        nestedParenthesis--;\n      \n      argument->push(current->clone());\n    }\n\n    this->arguments->push_back(argument);\n  }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ PROJECT CHRONO - http:\/\/projectchrono.org\n\/\/\n\/\/ Copyright (c) 2010-2012 Alessandro Tasora\n\/\/ Copyright (c) 2013 Project Chrono\n\/\/ All rights reserved.\n\/\/\n\/\/ Use of this source code is governed by a BSD-style license that can be \n\/\/ found in the LICENSE file at the top level of the distribution\n\/\/ and at http:\/\/projectchrono.org\/license-chrono.txt.\n\/\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/      \n\/\/   Demo code about   \n\/\/   \n\/\/     - collisions and contacts \n\/\/\n\/\/       (This is just a possible method of integration\n\/\/       of Chrono::Engine + Irrlicht: many others \n\/\/       are possible.)\n\/\/     \n\/\/\t CHRONO   \n\/\/   ------\n\/\/   Multibody dinamics engine \n\/\/   \n\/\/ ------------------------------------------------ \n\/\/             www.deltaknowledge.com\n\/\/ ------------------------------------------------ \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \n  \n \n#include \"physics\/ChApidll.h\" \n#include \"physics\/ChSystem.h\"\n#include \"irrlicht_interface\/ChBodySceneNode.h\"\n#include \"irrlicht_interface\/ChBodySceneNodeTools.h\" \n#include \"irrlicht_interface\/ChIrrAppInterface.h\"\n#include \"core\/ChRealtimeStep.h\"\n#include \"lcp\/ChLcpIterativeMINRES.h\" \/\/ test\n#include \"physics\/ChMaterialSurface.h\"\n\n\n \n\/\/ Use the namespace of Chrono\n\nusing namespace chrono;\n\n\/\/ Use the main namespaces of Irrlicht\nusing namespace irr;\n\nusing namespace core;\nusing namespace scene;\nusing namespace video;\nusing namespace io;\nusing namespace gui;\n\n\n\nvoid create_some_falling_items(ChSystem& mphysicalSystem, ISceneManager* msceneManager, IVideoDriver* driver)\n{\n\n\tChBodySceneNode* mrigidBody; \n\n\tChSharedPtr<ChMaterialSurface> mmaterial(new ChMaterialSurface);\n\tmmaterial->SetFriction(0.4f);\n\tmmaterial->SetCompliance (0.00005f);\n\tmmaterial->SetComplianceT(0.00005f);\n\tmmaterial->SetDampingF(0.2);\n\n\t\/\/ Create a bunch of ChronoENGINE rigid bodies (spheres and\n\t\/\/ boxes) which will fall..\n\t\/\/ Bodies are Irrlicht nodes of the special class ChBodySceneNode, \n\t\/\/ which encapsulates ChBody items).  \n\t\n\tvideo::ITexture* cubeMap   = driver->getTexture(\"..\/data\/cubetexture_borders.png\");\n\tvideo::ITexture* sphereMap = driver->getTexture(\"..\/data\/bluwhite.png\");\n\t\t\n\n\tfor (int ai = 0; ai < 1; ai++)  \/\/ N. of walls\n\t{ \n\t\tfor (int bi = 0; bi < 10; bi++)  \/\/ N. of vert. bricks\n\t\t{ \n\t\t\tfor (int ui = 0; ui < 15; ui++)  \/\/ N. of hor. bricks\n\t\t\t{ \n\t\t\t\tmrigidBody = (ChBodySceneNode*)addChBodySceneNode_easyBox(\n\t\t\t\t\t\t\t\t\t\t\t\t\t&mphysicalSystem, msceneManager,\n\t\t\t\t\t\t\t\t\t\t\t\t\t0.8,\n\t\t\t\t\t\t\t\t\t\t\t\t\tChVector<>(-8+ui*4.0+2*(bi%2),  1.0+bi*2.0, ai*9),\n\t\t\t\t\t\t\t\t\t\t\t\t\tChQuaternion<>(1,0,0,0), \n\t\t\t\t\t\t\t\t\t\t\t\t\tChVector<>(3.96,2,4) );\n\t\t\t\tmrigidBody->GetBody()->SetMaterialSurface(mmaterial);\n\t\t\t\tmrigidBody->setMaterialTexture(0,\tcubeMap);\n\t\t\t\tmrigidBody->addShadowVolumeSceneNode();\n\t\t\t}\n\t\t}\n\t}\n\n\n\t\/\/ Jenga tower\n\t\/*\n\tfor (int bi = 0; bi < 12; bi+=2) \n\t{ \n\t\tChBodySceneNode* mrigidBody1;\n\t\tmrigidBody1 = (ChBodySceneNode*)addChBodySceneNode_easyBox(\n\t\t\t\t\t\t\t\t\t\t\t&mphysicalSystem, msceneManager,\n\t\t\t\t\t\t\t\t\t\t\t0.2,\n\t\t\t\t\t\t\t\t\t\t\tChVector<>(-5, 1.0+bi*2.0,  0),\n\t\t\t\t\t\t\t\t\t\t\tChQuaternion<>(1,0,0,0), \n\t\t\t\t\t\t\t\t\t\t\tChVector<>(2,2, 14) );\n\t\tmrigidBody1->GetBody()->SetMaterialSurface(mmaterial);\n\t\tmrigidBody1->setMaterialTexture(0,\tcubeMap);\n\n\t\tChBodySceneNode* mrigidBody2;\n\t\tmrigidBody2 = (ChBodySceneNode*)addChBodySceneNode_easyBox(\n\t\t\t\t\t\t\t\t\t\t\t&mphysicalSystem, msceneManager,\n\t\t\t\t\t\t\t\t\t\t\t0.2,\n\t\t\t\t\t\t\t\t\t\t\tChVector<>( 5, 1.0+bi*2.0,  0),\n\t\t\t\t\t\t\t\t\t\t\tChQuaternion<>(1,0,0,0), \n\t\t\t\t\t\t\t\t\t\t\tChVector<>(2,2, 14) );\n\t\tmrigidBody2->GetBody()->SetMaterialSurface(mmaterial);\n\t\tmrigidBody2->setMaterialTexture(0,\tcubeMap);\n\n\t\tChBodySceneNode* mrigidBody3;\n\t\tmrigidBody3 = (ChBodySceneNode*)addChBodySceneNode_easyBox(\n\t\t\t\t\t\t\t\t\t\t\t&mphysicalSystem, msceneManager,\n\t\t\t\t\t\t\t\t\t\t\t0.2,\n\t\t\t\t\t\t\t\t\t\t\tChVector<>(0, 3.0+bi*2.0,  5),\n\t\t\t\t\t\t\t\t\t\t\tChQuaternion<>(1,0,0,0), \n\t\t\t\t\t\t\t\t\t\t\tChVector<>(14,2, 2) );\n\t\tmrigidBody3->GetBody()->SetMaterialSurface(mmaterial);\n\t\tmrigidBody3->setMaterialTexture(0,\tcubeMap);\n\n\t\tChBodySceneNode* mrigidBody4;\n\t\tmrigidBody4 = (ChBodySceneNode*)addChBodySceneNode_easyBox(\n\t\t\t\t\t\t\t\t\t\t\t&mphysicalSystem, msceneManager,\n\t\t\t\t\t\t\t\t\t\t\t0.2,\n\t\t\t\t\t\t\t\t\t\t\tChVector<>(0, 3.0+bi*2.0,  -5),\n\t\t\t\t\t\t\t\t\t\t\tChQuaternion<>(1,0,0,0), \n\t\t\t\t\t\t\t\t\t\t\tChVector<>(14,2, 2) );\n\t\tmrigidBody4->GetBody()->SetMaterialSurface(mmaterial);\n\t\tmrigidBody4->setMaterialTexture(0,\tcubeMap);\n\t}\n\t*\/\n\n\t\/\/ Create the floor using\n\t\/\/ fixed rigid body of 'box' type:\n\n\tmrigidBody = (ChBodySceneNode*)addChBodySceneNode_easyBox(\n\t\t\t\t\t\t\t\t\t\t\t&mphysicalSystem, msceneManager,\n\t\t\t\t\t\t\t\t\t\t\t200.0,\n\t\t\t\t\t\t\t\t\t\t\tChVector<>(0,-2,0),\n\t\t\t\t\t\t\t\t\t\t\tChQuaternion<>(1,0,0,0), \n\t\t\t\t\t\t\t\t\t\t\tChVector<>(550,4,550) );\n\tmrigidBody->GetBody()->SetBodyFixed(true);\n\tmrigidBody->GetBody()->SetMaterialSurface(mmaterial);\n\n\n\t\/\/ Create a ball that will collide with wall\n\tdouble mradius = 4;\n\tdouble density = 1.01;\n\tdouble mmass = (4.\/3.)*CH_C_PI*pow(mradius,3)*density; \n\tGetLog() << \"Ball mass = \" << mmass << \"\\n\";\n\tdouble minert = (2.\/5.)* mmass * pow(mradius,2);\n\n\tmrigidBody = (ChBodySceneNode*)addChBodySceneNode_easySphere(\n\t\t\t\t\t\t\t\t\t\t&mphysicalSystem, msceneManager,\n\t\t\t\t\t\t\t\t\t\tmmass, \/\/ mass\n\t\t\t\t\t\t\t\t\t\tChVector<>(0, 3, -8), \/\/ pos\n\t\t\t\t\t\t\t\t\t\tmradius, \/\/ radius\n\t\t\t\t\t\t\t\t\t\t20,  \/\/ hslices, for rendering\n\t\t\t\t\t\t\t\t\t\t15); \/\/ vslices, for rendering\n\n\t\/\/ set moment of inertia (more realistic than default 1,1,1).\n\tmrigidBody->GetBody()->SetInertiaXX(ChVector<>(minert,minert,minert));\n\tmrigidBody->GetBody()->SetPos_dt(ChVector<>(0,0,16));\n\tmrigidBody->GetBody()->GetMaterialSurface()->SetFriction(0.4f);\n\tmrigidBody->GetBody()->GetMaterialSurface()->SetCompliance(0.0);\n\tmrigidBody->GetBody()->GetMaterialSurface()->SetComplianceT(0.0);\n\tmrigidBody->GetBody()->GetMaterialSurface()->SetDampingF(0.2);\n\n\t\/\/ Some aesthetics for 3d view..\n\tmrigidBody->addShadowVolumeSceneNode();\n\tmrigidBody->setMaterialTexture(0,\tsphereMap);\n\n}\n\n\n \n\n \n \nint main(int argc, char* argv[])\n{ \n\n\t\/\/ In CHRONO engine, The DLL_CreateGlobals() - DLL_DeleteGlobals(); pair is needed if\n\t\/\/ global functions are needed.\n\tDLL_CreateGlobals();\n\n\t\/\/ Create a ChronoENGINE physical system\n\tChSystem mphysicalSystem; \n\n\t\/\/ Create the Irrlicht visualization (open the Irrlicht device, \n\t\/\/ bind a simple user interface, etc. etc.)\n\tChIrrAppInterface application(&mphysicalSystem, L\"Bricks test\",core::dimension2d<u32>(800,600),false, true); \n\n \n\t\/\/ Easy shortcuts to add camera, lights, logo and sky in Irrlicht scene:\n\tChIrrWizard::add_typical_Logo  (application.GetDevice());\n\tChIrrWizard::add_typical_Sky   (application.GetDevice());\n\tChIrrWizard::add_typical_Lights(application.GetDevice(), core::vector3df(70.f, 120.f, -90.f), core::vector3df(30.f, 80.f, 60.f), 590,  400);\n\tChIrrWizard::add_typical_Camera(application.GetDevice(), core::vector3df(-15,14,-30), core::vector3df(0,5,0)); \n\n\t\/\/ \n\t\/\/ HERE YOU CREATE THE MECHANICAL SYSTEM OF CHRONO... \n\t\/\/ \n\n \n\t\/\/ Create all the rigid bodies.\n\tcreate_some_falling_items(mphysicalSystem, application.GetSceneManager(), application.GetVideoDriver());\n  \n  \n\t\/\/ Prepare the physical system for the simulation \n\n\tmphysicalSystem.SetLcpSolverType(ChSystem::LCP_ITERATIVE_SOR_MULTITHREAD);\n\n\tmphysicalSystem.SetUseSleeping(false);\n\n\tmphysicalSystem.SetMaxPenetrationRecoverySpeed(1.6); \/\/ used by Anitescu stepper only\n\tmphysicalSystem.SetIterLCPmaxItersSpeed(40);\n\tmphysicalSystem.SetIterLCPmaxItersStab(20); \/\/ unuseful for Anitescu, only Tasora uses this\n\tmphysicalSystem.SetIterLCPwarmStarting(true);\n\tmphysicalSystem.SetParallelThreadNumber(4);\n\n\t\/\/\n\t\/\/ THE SOFT-REAL-TIME CYCLE\n\t\/\/\n \n\tapplication.SetStepManage(true);\n\tapplication.SetTimestep(0.02);\n\n\twhile(application.GetDevice()->run())\n\t{\n\t\tapplication.GetVideoDriver()->beginScene(true, true, SColor(255,140,161,192));\n\n\t\tChIrrTools::drawGrid(application.GetVideoDriver(), 5,5, 20,20, \n\t\t\tChCoordsys<>(ChVector<>(0,0.2,0),Q_from_AngAxis(CH_C_PI\/2,VECT_X)), video::SColor(50,90,90,150),true);\n\n\t\tapplication.DrawAll();\n\n\t\tapplication.DoStep();\n \n\t\tapplication.GetVideoDriver()->endScene();  \n\t}\n\t \n \n\n\treturn 0;\n}\n  \n<commit_msg>I am slowly changing the old demos so that they will use the new 'asset based' approach for visualization instead than the old approach of the functions \"addChBodySceneNode_easyBox(...) etc. Those functions will be made deprecated in future. The new approach offers advantages: - it is not dependent on Irrlicht - it can be used also for POVray postprocessing - it is bound to Irrlicht scene manager in a more reliable way - it is easier to understand.<commit_after>\/\/\n\/\/ PROJECT CHRONO - http:\/\/projectchrono.org\n\/\/\n\/\/ Copyright (c) 2010-2012 Alessandro Tasora\n\/\/ Copyright (c) 2013 Project Chrono\n\/\/ All rights reserved.\n\/\/\n\/\/ Use of this source code is governed by a BSD-style license that can be \n\/\/ found in the LICENSE file at the top level of the distribution\n\/\/ and at http:\/\/projectchrono.org\/license-chrono.txt.\n\/\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/      \n\/\/   Demo code about   \n\/\/   \n\/\/     - collisions and contacts \n\/\/\n\/\/       (This is just a possible method of integration\n\/\/       of Chrono::Engine + Irrlicht: many others \n\/\/       are possible.)\n\/\/     \n\/\/\t CHRONO   \n\/\/   ------\n\/\/   Multibody dinamics engine \n\/\/   \n\/\/ ------------------------------------------------ \n\/\/             www.deltaknowledge.com\n\/\/ ------------------------------------------------ \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n    \n  \n \n#include \"physics\/ChApidll.h\" \n#include \"physics\/ChSystem.h\"\n#include \"physics\/ChBodyEasy.h\"\n#include \"physics\/ChMaterialSurface.h\"\n#include \"assets\/ChTexture.h\"\n#include \"irrlicht_interface\/ChIrrApp.h\"\n\n\n\n \n\/\/ Use the namespace of Chrono\n\nusing namespace chrono;\n\n\/\/ Use the main namespaces of Irrlicht\nusing namespace irr;\n\nusing namespace core;\nusing namespace scene;\nusing namespace video;\nusing namespace io;\nusing namespace gui;\n\n\n\n\t\/\/ Create a bunch of ChronoENGINE rigid bodies that\n\t\/\/ represent bricks in a large wall.\n\nvoid create_wall_bodies(ChSystem& mphysicalSystem)\n{\n\t\/\/ Create a material that will be shared between bricks\n\tChSharedPtr<ChMaterialSurface> mmaterial(new ChMaterialSurface);\n\tmmaterial->SetFriction(0.4f);\n\tmmaterial->SetCompliance (0.0000005f);\n\tmmaterial->SetComplianceT(0.0000005f);\n\tmmaterial->SetDampingF(0.2f);\n\t\t\n\t\/\/ Create bricks\n\tfor (int ai = 0; ai < 1; ai++)  \/\/ N. of walls\n\t{ \n\t\tfor (int bi = 0; bi < 10; bi++)  \/\/ N. of vert. bricks\n\t\t{ \n\t\t\tfor (int ui = 0; ui < 15; ui++)  \/\/ N. of hor. bricks\n\t\t\t{ \n\t\t\t\tChSharedPtr<ChBodyEasyBox> mrigidBody(new ChBodyEasyBox(\n\t\t\t\t\t\t\t\t\t\t\t3.96, 2, 4, \/\/ x,y,z size\n\t\t\t\t\t\t\t\t\t\t\t 100,\t\t\/\/ density\n\t\t\t\t\t\t\t\t\t\t\ttrue,\t\t\/\/ collide enable?\n\t\t\t\t\t\t\t\t\t\t\ttrue));\t\t\/\/ visualization?\n\t\t\t\tmrigidBody->SetPos(ChVector<>(-8+ui*4.0+2*(bi%2),  1.0+bi*2.0, ai*9));\n\t\t\t\tmrigidBody->SetMaterialSurface(mmaterial); \/\/ use shared surface properties\n\t\t\t\t\n\t\t\t\tmphysicalSystem.Add(mrigidBody);\n\t\t\t\t\n\t\t\t\t\/\/ optional, attach a texture for better visualization\n\t\t\t\tChSharedPtr<ChTexture> mtexture(new ChTexture());\n\t\t\t\tmtexture->SetTextureFilename(\"..\/data\/cubetexture_borders.png\");\n\t\t\t\tmrigidBody->AddAsset(mtexture);\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ Create the floor using\n\t\/\/ fixed rigid body of 'box' type:\n\n\tChSharedPtr<ChBodyEasyBox> mrigidFloor(new ChBodyEasyBox(\n\t\t\t\t\t\t\t\t\t\t\t250, 4, 250, \/\/ x,y,z size\n\t\t\t\t\t\t\t\t\t\t\t1000,\t\t\/\/ density\n\t\t\t\t\t\t\t\t\t\t\ttrue,\t\t\/\/ collide enable?\n\t\t\t\t\t\t\t\t\t\t\ttrue));\t\t\/\/ visualization?\n\tmrigidFloor->SetPos(ChVector<>(0,-2,0));\n\tmrigidFloor->SetMaterialSurface(mmaterial);\n\tmrigidFloor->SetBodyFixed(true);\n\t\n\tmphysicalSystem.Add(mrigidFloor);\n\n\n\t\n\t\/\/ Create a ball that will collide with wall\n\tChSharedPtr<ChBodyEasySphere> mrigidBall(new ChBodyEasySphere(\n\t\t\t\t\t\t\t\t\t\t\t4,\t\t\t\/\/ radius\n\t\t\t\t\t\t\t\t\t\t\t8000,\t\t\/\/ density\n\t\t\t\t\t\t\t\t\t\t\ttrue,\t\t\/\/ collide enable?\n\t\t\t\t\t\t\t\t\t\t\ttrue));\t\t\/\/ visualization?\n\tmrigidBall->SetPos(ChVector<>(0,-2,0));\n\tmrigidBall->SetMaterialSurface(mmaterial);\n\tmrigidBall->SetPos(ChVector<>(0, 3, -8));\n\tmrigidBall->SetPos_dt(ChVector<>(0,0,16)); \/\/ set initial speed \n\tmrigidBall->GetMaterialSurface()->SetFriction(0.4f); \/\/ use own (not shared) matrial properties\n\tmrigidBall->GetMaterialSurface()->SetCompliance(0.0);\n\tmrigidBall->GetMaterialSurface()->SetComplianceT(0.0);\n\tmrigidBall->GetMaterialSurface()->SetDampingF(0.2f);\n\n\tmphysicalSystem.Add(mrigidBall);\n\n\t\/\/ optional, attach a texture for better visualization\n\tChSharedPtr<ChTexture> mtextureball(new ChTexture());\n\tmtextureball->SetTextureFilename(\"..\/data\/bluwhite.png\");\n\tmrigidBall->AddAsset(mtextureball);\n\n\n}\n\n\n\/\/ Create a bunch of ChronoENGINE rigid bodies that\n\/\/ represent bricks in a Jenga tower\n\nvoid create_jengatower_bodies(ChSystem& mphysicalSystem)\n{\n\t\/\/ Create a material that will be shared between bricks\n\tChSharedPtr<ChMaterialSurface> mmaterial(new ChMaterialSurface);\n\tmmaterial->SetFriction(0.4f);\n\tmmaterial->SetCompliance (0.0000005f);\n\tmmaterial->SetComplianceT(0.0000005f);\n\tmmaterial->SetDampingF(0.2f);\n\n\t\/\/ Create bricks\n\tfor (int bi = 0; bi < 12; bi+=2) \n\t{ \n\t\tChSharedPtr<ChBodyEasyBox> mrigidBody1(new ChBodyEasyBox(\n\t\t\t\t\t\t\t\t\t\t\t2, 2, 14,   \/\/ x,y,z size\n\t\t\t\t\t\t\t\t\t\t\t 100,\t\t\/\/ density\n\t\t\t\t\t\t\t\t\t\t\ttrue,\t\t\/\/ collide enable?\n\t\t\t\t\t\t\t\t\t\t\ttrue));\t\t\/\/ visualization?\n\t\tmrigidBody1->SetPos( ChVector<>(-5, 1.0+bi*2.0,  0) );\n\t\tmrigidBody1->SetMaterialSurface(mmaterial); \/\/ use shared surface properties\t\n\t\tmphysicalSystem.Add(mrigidBody1);\n\n\n\t\tChSharedPtr<ChBodyEasyBox> mrigidBody2(new ChBodyEasyBox(\n\t\t\t\t\t\t\t\t\t\t\t2, 2, 14,   \/\/ x,y,z size\n\t\t\t\t\t\t\t\t\t\t\t 100,\t\t\/\/ density\n\t\t\t\t\t\t\t\t\t\t\ttrue,\t\t\/\/ collide enable?\n\t\t\t\t\t\t\t\t\t\t\ttrue));\t\t\/\/ visualization?\n\t\tmrigidBody2->SetPos( ChVector<>( 5, 1.0+bi*2.0,  0) );\n\t\tmrigidBody2->SetMaterialSurface(mmaterial); \/\/ use shared surface properties\t\n\t\tmphysicalSystem.Add(mrigidBody2);\n\n\n\t\tChSharedPtr<ChBodyEasyBox> mrigidBody3(new ChBodyEasyBox(\n\t\t\t\t\t\t\t\t\t\t\t14, 2, 2,   \/\/ x,y,z size\n\t\t\t\t\t\t\t\t\t\t\t 100,\t\t\/\/ density\n\t\t\t\t\t\t\t\t\t\t\ttrue,\t\t\/\/ collide enable?\n\t\t\t\t\t\t\t\t\t\t\ttrue));\t\t\/\/ visualization?\n\t\tmrigidBody3->SetPos( ChVector<>(0, 3.0+bi*2.0,  5) );\n\t\tmrigidBody3->SetMaterialSurface(mmaterial); \/\/ use shared surface properties\t\n\t\tmphysicalSystem.Add(mrigidBody3);\n\n\n\t\tChSharedPtr<ChBodyEasyBox> mrigidBody4(new ChBodyEasyBox(\n\t\t\t\t\t\t\t\t\t\t\t14, 2, 2,   \/\/ x,y,z size\n\t\t\t\t\t\t\t\t\t\t\t 100,\t\t\/\/ density\n\t\t\t\t\t\t\t\t\t\t\ttrue,\t\t\/\/ collide enable?\n\t\t\t\t\t\t\t\t\t\t\ttrue));\t\t\/\/ visualization?\n\t\tmrigidBody4->SetPos( ChVector<>(0, 3.0+bi*2.0,  -5) );\n\t\tmrigidBody4->SetMaterialSurface(mmaterial); \/\/ use shared surface properties\t\n\t\tmphysicalSystem.Add(mrigidBody4);\n\t}\n\n\t\/\/ Create the floor using\n\t\/\/ fixed rigid body of 'box' type:\n\n\tChSharedPtr<ChBodyEasyBox> mrigidFloor(new ChBodyEasyBox(\n\t\t\t\t\t\t\t\t\t\t\t250, 4, 250, \/\/ x,y,z size\n\t\t\t\t\t\t\t\t\t\t\t1000,\t\t\/\/ density\n\t\t\t\t\t\t\t\t\t\t\ttrue,\t\t\/\/ collide enable?\n\t\t\t\t\t\t\t\t\t\t\ttrue));\t\t\/\/ visualization?\n\tmrigidFloor->SetPos(ChVector<>(0,-2,0));\n\tmrigidFloor->SetMaterialSurface(mmaterial);\n\tmrigidFloor->SetBodyFixed(true);\n\t\n\tmphysicalSystem.Add(mrigidFloor);\n\n\n\t\n\t\/\/ Create a ball that will collide with tower\n\tChSharedPtr<ChBodyEasySphere> mrigidBall(new ChBodyEasySphere(\n\t\t\t\t\t\t\t\t\t\t\t4,\t\t\t\/\/ radius\n\t\t\t\t\t\t\t\t\t\t\t1000,\t\t\/\/ density\n\t\t\t\t\t\t\t\t\t\t\ttrue,\t\t\/\/ collide enable?\n\t\t\t\t\t\t\t\t\t\t\ttrue));\t\t\/\/ visualization?\n\tmrigidBall->SetPos(ChVector<>(0,-2,0));\n\tmrigidBall->SetMaterialSurface(mmaterial);\n\tmrigidBall->SetPos(ChVector<>(0, 3, -8));\n\tmrigidBall->SetPos_dt(ChVector<>(0,0,2)); \/\/ set initial speed \n\tmrigidBall->GetMaterialSurface()->SetFriction(0.4f); \/\/ use own (not shared) matrial properties\n\tmrigidBall->GetMaterialSurface()->SetCompliance(0.0);\n\tmrigidBall->GetMaterialSurface()->SetComplianceT(0.0);\n\tmrigidBall->GetMaterialSurface()->SetDampingF(0.2f);\n\n\tmphysicalSystem.Add(mrigidBall);\n\n\t\/\/ optional, attach a texture for better visualization\n\tChSharedPtr<ChTexture> mtextureball(new ChTexture());\n\tmtextureball->SetTextureFilename(\"..\/data\/bluwhite.png\");\n\tmrigidBall->AddAsset(mtextureball);\n\n\n}\n \n\n \n \nint main(int argc, char* argv[])\n{ \n\n\t\/\/ In CHRONO engine, The DLL_CreateGlobals() - DLL_DeleteGlobals(); pair is needed if\n\t\/\/ global functions are needed.\n\tDLL_CreateGlobals();\n\n\t\/\/ Create a ChronoENGINE physical system\n\tChSystem mphysicalSystem; \n\n\t\/\/ Create the Irrlicht visualization (open the Irrlicht device, \n\t\/\/ bind a simple user interface, etc. etc.)\n\tChIrrApp application(&mphysicalSystem, L\"Bricks test\",core::dimension2d<u32>(800,600),false, true); \n\n \n\t\/\/ Easy shortcuts to add camera, lights, logo and sky in Irrlicht scene:\n\tChIrrWizard::add_typical_Logo  (application.GetDevice());\n\tChIrrWizard::add_typical_Sky   (application.GetDevice());\n\tChIrrWizard::add_typical_Lights(application.GetDevice(), core::vector3df(70.f, 120.f, -90.f), core::vector3df(30.f, 80.f, 60.f), 290,  190);\n\tChIrrWizard::add_typical_Camera(application.GetDevice(), core::vector3df(-15,14,-30), core::vector3df(0,5,0)); \n\n\t\/\/ \n\t\/\/ HERE YOU POPULATE THE MECHANICAL SYSTEM OF CHRONO... \n\t\/\/ \n\n \n\t\/\/ Create all the rigid bodies.\n    create_wall_bodies (mphysicalSystem);\n\t\/\/create_jengatower_bodies (mphysicalSystem);\n\n\n\t\/\/ Use this function for adding a ChIrrNodeAsset to all items\n\t\/\/ If you need a finer control on which item really needs a visualization proxy in \n\t\/\/ Irrlicht, just use application.AssetBind(myitem); on a per-item basis.\n\tapplication.AssetBindAll();\n\n\t\/\/ Use this function for 'converting' into Irrlicht meshes the assets \n\t\/\/ into Irrlicht-visualizable meshes\n\tapplication.AssetUpdateAll();\n\n\n  \n\t\/\/ Prepare the physical system for the simulation \n\n\tmphysicalSystem.SetLcpSolverType(ChSystem::LCP_ITERATIVE_SOR_MULTITHREAD);\n\n\tmphysicalSystem.SetUseSleeping(false);\n\n\tmphysicalSystem.SetMaxPenetrationRecoverySpeed(1.6); \/\/ used by Anitescu stepper only\n\tmphysicalSystem.SetIterLCPmaxItersSpeed(40);\n\tmphysicalSystem.SetIterLCPmaxItersStab(20); \/\/ unuseful for Anitescu, only Tasora uses this\n\tmphysicalSystem.SetIterLCPwarmStarting(true);\n\tmphysicalSystem.SetParallelThreadNumber(4);\n\n\t\/\/\n\t\/\/ THE SOFT-REAL-TIME CYCLE\n\t\/\/\n \n\tapplication.SetStepManage(true);\n\tapplication.SetTimestep(0.02);\n\n\twhile(application.GetDevice()->run())\n\t{\n\t\tapplication.GetVideoDriver()->beginScene(true, true, SColor(255,140,161,192));\n\n\t\tChIrrTools::drawGrid(application.GetVideoDriver(), 5,5, 20,20, \n\t\t\tChCoordsys<>(ChVector<>(0,0.2,0),Q_from_AngAxis(CH_C_PI\/2,VECT_X)), video::SColor(50,90,90,150),true);\n\n\t\tapplication.DrawAll();\n\n\t\tapplication.DoStep();\n \n\t\tapplication.GetVideoDriver()->endScene();  \n\t}\n\t \n \n\n\treturn 0;\n}\n  \n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2011-2013 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#ifdef WITH_OPENCL\n\n#include \"opencl.h\"\n\n#include \"buffers.h\"\n\n#include \"kernel_types.h\"\n#include \"kernel_split_data_types.h\"\n\n#include \"device_split_kernel.h\"\n\n#include \"util_logging.h\"\n#include \"util_md5.h\"\n#include \"util_path.h\"\n#include \"util_time.h\"\n\nCCL_NAMESPACE_BEGIN\n\nclass OpenCLSplitKernel;\n\nstatic string get_build_options(OpenCLDeviceBase *device, const DeviceRequestedFeatures& requested_features)\n{\n\tstring build_options = \"-D__SPLIT_KERNEL__ \";\n\tbuild_options += requested_features.get_build_options();\n\n\t\/* Set compute device build option. *\/\n\tcl_device_type device_type;\n\tdevice->ciErr = clGetDeviceInfo(device->cdDevice,\n\t                        CL_DEVICE_TYPE,\n\t                        sizeof(cl_device_type),\n\t                        &device_type,\n\t                        NULL);\n\tassert(device->ciErr == CL_SUCCESS);\n\tif(device_type == CL_DEVICE_TYPE_GPU) {\n\t\tbuild_options += \" -D__COMPUTE_DEVICE_GPU__\";\n\t}\n\n\treturn build_options;\n}\n\n\/* OpenCLDeviceSplitKernel's declaration\/definition. *\/\nclass OpenCLDeviceSplitKernel : public OpenCLDeviceBase\n{\npublic:\n\tDeviceSplitKernel *split_kernel;\n\tOpenCLProgram program_data_init;\n\tOpenCLProgram program_state_buffer_size;\n\n\tOpenCLDeviceSplitKernel(DeviceInfo& info, Stats &stats, bool background_);\n\n\t~OpenCLDeviceSplitKernel()\n\t{\n\t\ttask_pool.stop();\n\n\t\t\/* Release kernels *\/\n\t\tprogram_data_init.release();\n\n\t\tdelete split_kernel;\n\t}\n\n\tvirtual bool load_kernels(const DeviceRequestedFeatures& requested_features,\n\t                          vector<OpenCLDeviceBase::OpenCLProgram*> &programs)\n\t{\n\t\tbool single_program = OpenCLInfo::use_single_program();\n\t\tprogram_data_init = OpenCLDeviceBase::OpenCLProgram(this,\n\t\t                                  single_program ? \"split\" : \"split_data_init\",\n\t\t                                  single_program ? \"kernel_split.cl\" : \"kernel_data_init.cl\",\n\t\t                                  get_build_options(this, requested_features));\n\n\t\tprogram_data_init.add_kernel(ustring(\"path_trace_data_init\"));\n\t\tprograms.push_back(&program_data_init);\n\n\t\tprogram_state_buffer_size = OpenCLDeviceBase::OpenCLProgram(this,\n\t\t                                  single_program ? \"split\" : \"split_state_buffer_size\",\n\t\t                                  single_program ? \"kernel_split.cl\" : \"kernel_state_buffer_size.cl\",\n\t\t                                  get_build_options(this, requested_features));\n\t\tprogram_state_buffer_size.add_kernel(ustring(\"path_trace_state_buffer_size\"));\n\t\tprograms.push_back(&program_state_buffer_size);\n\n\t\treturn split_kernel->load_kernels(requested_features);\n\t}\n\n\tvoid thread_run(DeviceTask *task)\n\t{\n\t\tif(task->type == DeviceTask::FILM_CONVERT) {\n\t\t\tfilm_convert(*task, task->buffer, task->rgba_byte, task->rgba_half);\n\t\t}\n\t\telse if(task->type == DeviceTask::SHADER) {\n\t\t\tshader(*task);\n\t\t}\n\t\telse if(task->type == DeviceTask::PATH_TRACE) {\n\t\t\tRenderTile tile;\n\n\t\t\t\/* Copy dummy KernelGlobals related to OpenCL from kernel_globals.h to\n\t\t\t * fetch its size.\n\t\t\t *\/\n\t\t\ttypedef struct KernelGlobals {\n\t\t\t\tccl_constant KernelData *data;\n#define KERNEL_TEX(type, ttype, name) \\\n\t\t\t\tccl_global type *name;\n#include \"kernel_textures.h\"\n#undef KERNEL_TEX\n\t\t\t\tSplitData split_data;\n\t\t\t\tSplitParams split_param_data;\n\t\t\t} KernelGlobals;\n\n\t\t\t\/* Allocate buffer for kernel globals *\/\n\t\t\tdevice_memory kgbuffer;\n\t\t\tkgbuffer.resize(sizeof(KernelGlobals));\n\t\t\tmem_alloc(\"kernel_globals\", kgbuffer, MEM_READ_WRITE);\n\n\t\t\t\/* Keep rendering tiles until done. *\/\n\t\t\twhile(task->acquire_tile(this, tile)) {\n\t\t\t\tsplit_kernel->path_trace(task,\n\t\t\t\t                         tile,\n\t\t\t\t                         kgbuffer,\n\t\t\t\t                         *const_mem_map[\"__data\"]);\n\n\t\t\t\t\/* Complete kernel execution before release tile. *\/\n\t\t\t\t\/* This helps in multi-device render;\n\t\t\t\t * The device that reaches the critical-section function\n\t\t\t\t * release_tile waits (stalling other devices from entering\n\t\t\t\t * release_tile) for all kernels to complete. If device1 (a\n\t\t\t\t * slow-render device) reaches release_tile first then it would\n\t\t\t\t * stall device2 (a fast-render device) from proceeding to render\n\t\t\t\t * next tile.\n\t\t\t\t *\/\n\t\t\t\tclFinish(cqCommandQueue);\n\n\t\t\t\ttask->release_tile(tile);\n\t\t\t}\n\n\t\t\tmem_free(kgbuffer);\n\t\t}\n\t}\n\nprotected:\n\t\/* ** Those guys are for workign around some compiler-specific bugs ** *\/\n\n\tstring build_options_for_base_program(\n\t        const DeviceRequestedFeatures& requested_features)\n\t{\n\t\treturn requested_features.get_build_options();\n\t}\n\n\tfriend class OpenCLSplitKernel;\n\tfriend class OpenCLSplitKernelFunction;\n};\n\nclass OpenCLSplitKernelFunction : public SplitKernelFunction {\npublic:\n\tOpenCLDeviceSplitKernel* device;\n\tOpenCLDeviceBase::OpenCLProgram program;\n\n\tOpenCLSplitKernelFunction(OpenCLDeviceSplitKernel* device) : device(device) {}\n\t~OpenCLSplitKernelFunction() { program.release(); }\n\n\tvirtual bool enqueue(const KernelDimensions& dim, device_memory& kg, device_memory& data)\n\t{\n\t\tdevice->kernel_set_args(program(), 0, kg, data);\n\n\t\tdevice->ciErr = clEnqueueNDRangeKernel(device->cqCommandQueue,\n\t\t                                       program(),\n\t\t                                       2,\n\t\t                                       NULL,\n\t\t                                       dim.global_size,\n\t\t                                       dim.local_size,\n\t\t                                       0,\n\t\t                                       NULL,\n\t\t                                       NULL);\n\n\t\tdevice->opencl_assert_err(device->ciErr, \"clEnqueueNDRangeKernel\");\n\n\t\tif(device->ciErr != CL_SUCCESS) {\n\t\t\tstring message = string_printf(\"OpenCL error: %s in clEnqueueNDRangeKernel()\",\n\t\t\t                               clewErrorString(device->ciErr));\n\t\t\tdevice->opencl_error(message);\n\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t}\n};\n\nclass OpenCLSplitKernel : public DeviceSplitKernel {\n\tOpenCLDeviceSplitKernel *device;\npublic:\n\texplicit OpenCLSplitKernel(OpenCLDeviceSplitKernel *device) : DeviceSplitKernel(device), device(device) {\n\t}\n\n\tvirtual SplitKernelFunction* get_split_kernel_function(string kernel_name,\n\t                                                       const DeviceRequestedFeatures& requested_features)\n\t{\n\t\tOpenCLSplitKernelFunction* kernel = new OpenCLSplitKernelFunction(device);\n\n\t\tbool single_program = OpenCLInfo::use_single_program();\n\t\tkernel->program =\n\t\t\tOpenCLDeviceBase::OpenCLProgram(device,\n\t\t\t                                single_program ? \"split\" : \"split_\" + kernel_name,\n\t\t\t                                single_program ? \"kernel_split.cl\" : \"kernel_\" + kernel_name + \".cl\",\n\t\t\t                                get_build_options(device, requested_features));\n\n\t\tkernel->program.add_kernel(ustring(\"path_trace_\" + kernel_name));\n\t\tkernel->program.load();\n\n\t\tif(!kernel->program.is_loaded()) {\n\t\t\tdelete kernel;\n\t\t\treturn NULL;\n\t\t}\n\n\t\treturn kernel;\n\t}\n\n\tvirtual uint64_t state_buffer_size(device_memory& kg, device_memory& data, size_t num_threads)\n\t{\n\t\tdevice_vector<uint64_t> size_buffer;\n\t\tsize_buffer.resize(1);\n\t\tdevice->mem_alloc(NULL, size_buffer, MEM_READ_WRITE);\n\n\t\tuint threads = num_threads;\n\t\tdevice->kernel_set_args(device->program_state_buffer_size(), 0, kg, data, threads, size_buffer);\n\n\t\tsize_t global_size = 64;\n\t\tdevice->ciErr = clEnqueueNDRangeKernel(device->cqCommandQueue,\n\t\t                               device->program_state_buffer_size(),\n\t\t                               1,\n\t\t                               NULL,\n\t\t                               &global_size,\n\t\t                               NULL,\n\t\t                               0,\n\t\t                               NULL,\n\t\t                               NULL);\n\n\t\tdevice->opencl_assert_err(device->ciErr, \"clEnqueueNDRangeKernel\");\n\n\t\tdevice->mem_copy_from(size_buffer, 0, 1, 1, sizeof(uint64_t));\n\t\tdevice->mem_free(size_buffer);\n\n\t\tif(device->ciErr != CL_SUCCESS) {\n\t\t\tstring message = string_printf(\"OpenCL error: %s in clEnqueueNDRangeKernel()\",\n\t\t\t                               clewErrorString(device->ciErr));\n\t\t\tdevice->opencl_error(message);\n\t\t\treturn 0;\n\t\t}\n\n\t\treturn *size_buffer.get_data();\n\t}\n\n\tvirtual bool enqueue_split_kernel_data_init(const KernelDimensions& dim,\n\t                                            RenderTile& rtile,\n\t                                            int num_global_elements,\n\t                                            device_memory& kernel_globals,\n\t                                            device_memory& kernel_data,\n\t                                            device_memory& split_data,\n\t                                            device_memory& ray_state,\n\t                                            device_memory& queue_index,\n\t                                            device_memory& use_queues_flag,\n\t                                            device_memory& work_pool_wgs\n\t                                            )\n\t{\n\t\tcl_int dQueue_size = dim.global_size[0] * dim.global_size[1];\n\n\t\t\/* Set the range of samples to be processed for every ray in\n\t\t * path-regeneration logic.\n\t\t *\/\n\t\tcl_int start_sample = rtile.start_sample;\n\t\tcl_int end_sample = rtile.start_sample + rtile.num_samples;\n\n\t\tcl_uint start_arg_index =\n\t\t\tdevice->kernel_set_args(device->program_data_init(),\n\t\t\t                0,\n\t\t\t                kernel_globals,\n\t\t\t                kernel_data,\n\t\t\t                split_data,\n\t\t\t                num_global_elements,\n\t\t\t                ray_state,\n\t\t\t                rtile.rng_state);\n\n\/* TODO(sergey): Avoid map lookup here. *\/\n#define KERNEL_TEX(type, ttype, name) \\\n\tdevice->set_kernel_arg_mem(device->program_data_init(), &start_arg_index, #name);\n#include \"kernel_textures.h\"\n#undef KERNEL_TEX\n\n\t\tstart_arg_index +=\n\t\t\tdevice->kernel_set_args(device->program_data_init(),\n\t\t\t                start_arg_index,\n\t\t\t                start_sample,\n\t\t\t                end_sample,\n\t\t\t                rtile.x,\n\t\t\t                rtile.y,\n\t\t\t                rtile.w,\n\t\t\t                rtile.h,\n\t\t\t                rtile.offset,\n\t\t\t                rtile.stride,\n\t\t\t                queue_index,\n\t\t\t                dQueue_size,\n\t\t\t                use_queues_flag,\n\t\t\t                work_pool_wgs,\n\t\t\t                rtile.num_samples,\n\t\t\t                rtile.buffer);\n\n\t\t\/* Enqueue ckPathTraceKernel_data_init kernel. *\/\n\t\tdevice->ciErr = clEnqueueNDRangeKernel(device->cqCommandQueue,\n\t\t                               device->program_data_init(),\n\t\t                               2,\n\t\t                               NULL,\n\t\t                               dim.global_size,\n\t\t                               dim.local_size,\n\t\t                               0,\n\t\t                               NULL,\n\t\t                               NULL);\n\n\t\tdevice->opencl_assert_err(device->ciErr, \"clEnqueueNDRangeKernel\");\n\n\t\tif(device->ciErr != CL_SUCCESS) {\n\t\t\tstring message = string_printf(\"OpenCL error: %s in clEnqueueNDRangeKernel()\",\n\t\t\t                               clewErrorString(device->ciErr));\n\t\t\tdevice->opencl_error(message);\n\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tvirtual int2 split_kernel_local_size()\n\t{\n\t\treturn make_int2(64, 1);\n\t}\n\n\tvirtual int2 split_kernel_global_size(device_memory& kg, device_memory& data, DeviceTask *\/*task*\/)\n\t{\n\t\tcl_ulong max_buffer_size;\n\t\tclGetDeviceInfo(device->cdDevice, CL_DEVICE_MAX_MEM_ALLOC_SIZE, sizeof(cl_ulong), &max_buffer_size, NULL);\n\t\tVLOG(1) << \"Maximum device allocation side: \"\n\t\t        << string_human_readable_number(max_buffer_size) << \" bytes. (\"\n\t\t        << string_human_readable_size(max_buffer_size) << \").\";\n\n\t\tsize_t num_elements = max_elements_for_max_buffer_size(kg, data, max_buffer_size \/ 2);\n\t\tint2 global_size = make_int2(round_down((int)sqrt(num_elements), 64), (int)sqrt(num_elements));\n\t\tVLOG(1) << \"Global size: \" << global_size << \".\";\n\t\treturn global_size;\n\t}\n};\n\nOpenCLDeviceSplitKernel::OpenCLDeviceSplitKernel(DeviceInfo& info, Stats &stats, bool background_)\n: OpenCLDeviceBase(info, stats, background_)\n{\n\tsplit_kernel = new OpenCLSplitKernel(this);\n\n\tbackground = background_;\n}\n\nDevice *opencl_create_split_device(DeviceInfo& info, Stats& stats, bool background)\n{\n\treturn new OpenCLDeviceSplitKernel(info, stats, background);\n}\n\nCCL_NAMESPACE_END\n\n#endif \/* WITH_OPENCL *\/\n<commit_msg>Adjust global size for OpenCL CPU devices to make them faster<commit_after>\/*\n * Copyright 2011-2013 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#ifdef WITH_OPENCL\n\n#include \"opencl.h\"\n\n#include \"buffers.h\"\n\n#include \"kernel_types.h\"\n#include \"kernel_split_data_types.h\"\n\n#include \"device_split_kernel.h\"\n\n#include \"util_logging.h\"\n#include \"util_md5.h\"\n#include \"util_path.h\"\n#include \"util_time.h\"\n\nCCL_NAMESPACE_BEGIN\n\nclass OpenCLSplitKernel;\n\nstatic string get_build_options(OpenCLDeviceBase *device, const DeviceRequestedFeatures& requested_features)\n{\n\tstring build_options = \"-D__SPLIT_KERNEL__ \";\n\tbuild_options += requested_features.get_build_options();\n\n\t\/* Set compute device build option. *\/\n\tcl_device_type device_type;\n\tdevice->ciErr = clGetDeviceInfo(device->cdDevice,\n\t                        CL_DEVICE_TYPE,\n\t                        sizeof(cl_device_type),\n\t                        &device_type,\n\t                        NULL);\n\tassert(device->ciErr == CL_SUCCESS);\n\tif(device_type == CL_DEVICE_TYPE_GPU) {\n\t\tbuild_options += \" -D__COMPUTE_DEVICE_GPU__\";\n\t}\n\n\treturn build_options;\n}\n\n\/* OpenCLDeviceSplitKernel's declaration\/definition. *\/\nclass OpenCLDeviceSplitKernel : public OpenCLDeviceBase\n{\npublic:\n\tDeviceSplitKernel *split_kernel;\n\tOpenCLProgram program_data_init;\n\tOpenCLProgram program_state_buffer_size;\n\n\tOpenCLDeviceSplitKernel(DeviceInfo& info, Stats &stats, bool background_);\n\n\t~OpenCLDeviceSplitKernel()\n\t{\n\t\ttask_pool.stop();\n\n\t\t\/* Release kernels *\/\n\t\tprogram_data_init.release();\n\n\t\tdelete split_kernel;\n\t}\n\n\tvirtual bool load_kernels(const DeviceRequestedFeatures& requested_features,\n\t                          vector<OpenCLDeviceBase::OpenCLProgram*> &programs)\n\t{\n\t\tbool single_program = OpenCLInfo::use_single_program();\n\t\tprogram_data_init = OpenCLDeviceBase::OpenCLProgram(this,\n\t\t                                  single_program ? \"split\" : \"split_data_init\",\n\t\t                                  single_program ? \"kernel_split.cl\" : \"kernel_data_init.cl\",\n\t\t                                  get_build_options(this, requested_features));\n\n\t\tprogram_data_init.add_kernel(ustring(\"path_trace_data_init\"));\n\t\tprograms.push_back(&program_data_init);\n\n\t\tprogram_state_buffer_size = OpenCLDeviceBase::OpenCLProgram(this,\n\t\t                                  single_program ? \"split\" : \"split_state_buffer_size\",\n\t\t                                  single_program ? \"kernel_split.cl\" : \"kernel_state_buffer_size.cl\",\n\t\t                                  get_build_options(this, requested_features));\n\t\tprogram_state_buffer_size.add_kernel(ustring(\"path_trace_state_buffer_size\"));\n\t\tprograms.push_back(&program_state_buffer_size);\n\n\t\treturn split_kernel->load_kernels(requested_features);\n\t}\n\n\tvoid thread_run(DeviceTask *task)\n\t{\n\t\tif(task->type == DeviceTask::FILM_CONVERT) {\n\t\t\tfilm_convert(*task, task->buffer, task->rgba_byte, task->rgba_half);\n\t\t}\n\t\telse if(task->type == DeviceTask::SHADER) {\n\t\t\tshader(*task);\n\t\t}\n\t\telse if(task->type == DeviceTask::PATH_TRACE) {\n\t\t\tRenderTile tile;\n\n\t\t\t\/* Copy dummy KernelGlobals related to OpenCL from kernel_globals.h to\n\t\t\t * fetch its size.\n\t\t\t *\/\n\t\t\ttypedef struct KernelGlobals {\n\t\t\t\tccl_constant KernelData *data;\n#define KERNEL_TEX(type, ttype, name) \\\n\t\t\t\tccl_global type *name;\n#include \"kernel_textures.h\"\n#undef KERNEL_TEX\n\t\t\t\tSplitData split_data;\n\t\t\t\tSplitParams split_param_data;\n\t\t\t} KernelGlobals;\n\n\t\t\t\/* Allocate buffer for kernel globals *\/\n\t\t\tdevice_memory kgbuffer;\n\t\t\tkgbuffer.resize(sizeof(KernelGlobals));\n\t\t\tmem_alloc(\"kernel_globals\", kgbuffer, MEM_READ_WRITE);\n\n\t\t\t\/* Keep rendering tiles until done. *\/\n\t\t\twhile(task->acquire_tile(this, tile)) {\n\t\t\t\tsplit_kernel->path_trace(task,\n\t\t\t\t                         tile,\n\t\t\t\t                         kgbuffer,\n\t\t\t\t                         *const_mem_map[\"__data\"]);\n\n\t\t\t\t\/* Complete kernel execution before release tile. *\/\n\t\t\t\t\/* This helps in multi-device render;\n\t\t\t\t * The device that reaches the critical-section function\n\t\t\t\t * release_tile waits (stalling other devices from entering\n\t\t\t\t * release_tile) for all kernels to complete. If device1 (a\n\t\t\t\t * slow-render device) reaches release_tile first then it would\n\t\t\t\t * stall device2 (a fast-render device) from proceeding to render\n\t\t\t\t * next tile.\n\t\t\t\t *\/\n\t\t\t\tclFinish(cqCommandQueue);\n\n\t\t\t\ttask->release_tile(tile);\n\t\t\t}\n\n\t\t\tmem_free(kgbuffer);\n\t\t}\n\t}\n\nprotected:\n\t\/* ** Those guys are for workign around some compiler-specific bugs ** *\/\n\n\tstring build_options_for_base_program(\n\t        const DeviceRequestedFeatures& requested_features)\n\t{\n\t\treturn requested_features.get_build_options();\n\t}\n\n\tfriend class OpenCLSplitKernel;\n\tfriend class OpenCLSplitKernelFunction;\n};\n\nclass OpenCLSplitKernelFunction : public SplitKernelFunction {\npublic:\n\tOpenCLDeviceSplitKernel* device;\n\tOpenCLDeviceBase::OpenCLProgram program;\n\n\tOpenCLSplitKernelFunction(OpenCLDeviceSplitKernel* device) : device(device) {}\n\t~OpenCLSplitKernelFunction() { program.release(); }\n\n\tvirtual bool enqueue(const KernelDimensions& dim, device_memory& kg, device_memory& data)\n\t{\n\t\tdevice->kernel_set_args(program(), 0, kg, data);\n\n\t\tdevice->ciErr = clEnqueueNDRangeKernel(device->cqCommandQueue,\n\t\t                                       program(),\n\t\t                                       2,\n\t\t                                       NULL,\n\t\t                                       dim.global_size,\n\t\t                                       dim.local_size,\n\t\t                                       0,\n\t\t                                       NULL,\n\t\t                                       NULL);\n\n\t\tdevice->opencl_assert_err(device->ciErr, \"clEnqueueNDRangeKernel\");\n\n\t\tif(device->ciErr != CL_SUCCESS) {\n\t\t\tstring message = string_printf(\"OpenCL error: %s in clEnqueueNDRangeKernel()\",\n\t\t\t                               clewErrorString(device->ciErr));\n\t\t\tdevice->opencl_error(message);\n\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t}\n};\n\nclass OpenCLSplitKernel : public DeviceSplitKernel {\n\tOpenCLDeviceSplitKernel *device;\npublic:\n\texplicit OpenCLSplitKernel(OpenCLDeviceSplitKernel *device) : DeviceSplitKernel(device), device(device) {\n\t}\n\n\tvirtual SplitKernelFunction* get_split_kernel_function(string kernel_name,\n\t                                                       const DeviceRequestedFeatures& requested_features)\n\t{\n\t\tOpenCLSplitKernelFunction* kernel = new OpenCLSplitKernelFunction(device);\n\n\t\tbool single_program = OpenCLInfo::use_single_program();\n\t\tkernel->program =\n\t\t\tOpenCLDeviceBase::OpenCLProgram(device,\n\t\t\t                                single_program ? \"split\" : \"split_\" + kernel_name,\n\t\t\t                                single_program ? \"kernel_split.cl\" : \"kernel_\" + kernel_name + \".cl\",\n\t\t\t                                get_build_options(device, requested_features));\n\n\t\tkernel->program.add_kernel(ustring(\"path_trace_\" + kernel_name));\n\t\tkernel->program.load();\n\n\t\tif(!kernel->program.is_loaded()) {\n\t\t\tdelete kernel;\n\t\t\treturn NULL;\n\t\t}\n\n\t\treturn kernel;\n\t}\n\n\tvirtual uint64_t state_buffer_size(device_memory& kg, device_memory& data, size_t num_threads)\n\t{\n\t\tdevice_vector<uint64_t> size_buffer;\n\t\tsize_buffer.resize(1);\n\t\tdevice->mem_alloc(NULL, size_buffer, MEM_READ_WRITE);\n\n\t\tuint threads = num_threads;\n\t\tdevice->kernel_set_args(device->program_state_buffer_size(), 0, kg, data, threads, size_buffer);\n\n\t\tsize_t global_size = 64;\n\t\tdevice->ciErr = clEnqueueNDRangeKernel(device->cqCommandQueue,\n\t\t                               device->program_state_buffer_size(),\n\t\t                               1,\n\t\t                               NULL,\n\t\t                               &global_size,\n\t\t                               NULL,\n\t\t                               0,\n\t\t                               NULL,\n\t\t                               NULL);\n\n\t\tdevice->opencl_assert_err(device->ciErr, \"clEnqueueNDRangeKernel\");\n\n\t\tdevice->mem_copy_from(size_buffer, 0, 1, 1, sizeof(uint64_t));\n\t\tdevice->mem_free(size_buffer);\n\n\t\tif(device->ciErr != CL_SUCCESS) {\n\t\t\tstring message = string_printf(\"OpenCL error: %s in clEnqueueNDRangeKernel()\",\n\t\t\t                               clewErrorString(device->ciErr));\n\t\t\tdevice->opencl_error(message);\n\t\t\treturn 0;\n\t\t}\n\n\t\treturn *size_buffer.get_data();\n\t}\n\n\tvirtual bool enqueue_split_kernel_data_init(const KernelDimensions& dim,\n\t                                            RenderTile& rtile,\n\t                                            int num_global_elements,\n\t                                            device_memory& kernel_globals,\n\t                                            device_memory& kernel_data,\n\t                                            device_memory& split_data,\n\t                                            device_memory& ray_state,\n\t                                            device_memory& queue_index,\n\t                                            device_memory& use_queues_flag,\n\t                                            device_memory& work_pool_wgs\n\t                                            )\n\t{\n\t\tcl_int dQueue_size = dim.global_size[0] * dim.global_size[1];\n\n\t\t\/* Set the range of samples to be processed for every ray in\n\t\t * path-regeneration logic.\n\t\t *\/\n\t\tcl_int start_sample = rtile.start_sample;\n\t\tcl_int end_sample = rtile.start_sample + rtile.num_samples;\n\n\t\tcl_uint start_arg_index =\n\t\t\tdevice->kernel_set_args(device->program_data_init(),\n\t\t\t                0,\n\t\t\t                kernel_globals,\n\t\t\t                kernel_data,\n\t\t\t                split_data,\n\t\t\t                num_global_elements,\n\t\t\t                ray_state,\n\t\t\t                rtile.rng_state);\n\n\/* TODO(sergey): Avoid map lookup here. *\/\n#define KERNEL_TEX(type, ttype, name) \\\n\tdevice->set_kernel_arg_mem(device->program_data_init(), &start_arg_index, #name);\n#include \"kernel_textures.h\"\n#undef KERNEL_TEX\n\n\t\tstart_arg_index +=\n\t\t\tdevice->kernel_set_args(device->program_data_init(),\n\t\t\t                start_arg_index,\n\t\t\t                start_sample,\n\t\t\t                end_sample,\n\t\t\t                rtile.x,\n\t\t\t                rtile.y,\n\t\t\t                rtile.w,\n\t\t\t                rtile.h,\n\t\t\t                rtile.offset,\n\t\t\t                rtile.stride,\n\t\t\t                queue_index,\n\t\t\t                dQueue_size,\n\t\t\t                use_queues_flag,\n\t\t\t                work_pool_wgs,\n\t\t\t                rtile.num_samples,\n\t\t\t                rtile.buffer);\n\n\t\t\/* Enqueue ckPathTraceKernel_data_init kernel. *\/\n\t\tdevice->ciErr = clEnqueueNDRangeKernel(device->cqCommandQueue,\n\t\t                               device->program_data_init(),\n\t\t                               2,\n\t\t                               NULL,\n\t\t                               dim.global_size,\n\t\t                               dim.local_size,\n\t\t                               0,\n\t\t                               NULL,\n\t\t                               NULL);\n\n\t\tdevice->opencl_assert_err(device->ciErr, \"clEnqueueNDRangeKernel\");\n\n\t\tif(device->ciErr != CL_SUCCESS) {\n\t\t\tstring message = string_printf(\"OpenCL error: %s in clEnqueueNDRangeKernel()\",\n\t\t\t                               clewErrorString(device->ciErr));\n\t\t\tdevice->opencl_error(message);\n\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tvirtual int2 split_kernel_local_size()\n\t{\n\t\treturn make_int2(64, 1);\n\t}\n\n\tvirtual int2 split_kernel_global_size(device_memory& kg, device_memory& data, DeviceTask *\/*task*\/)\n\t{\n\t\tcl_device_type type;\n\t\tclGetDeviceInfo(device->cdDevice, CL_DEVICE_TYPE, sizeof(cl_device_type), &type, NULL);\n\n\t\t\/* Use small global size on CPU devices as it seems to be much faster. *\/\n\t\tif(type == CL_DEVICE_TYPE_CPU) {\n\t\t\tVLOG(1) << \"Global size: (64, 64).\";\n\t\t\treturn make_int2(64, 64);\n\t\t}\n\n\t\tcl_ulong max_buffer_size;\n\t\tclGetDeviceInfo(device->cdDevice, CL_DEVICE_MAX_MEM_ALLOC_SIZE, sizeof(cl_ulong), &max_buffer_size, NULL);\n\t\tVLOG(1) << \"Maximum device allocation size: \"\n\t\t        << string_human_readable_number(max_buffer_size) << \" bytes. (\"\n\t\t        << string_human_readable_size(max_buffer_size) << \").\";\n\n\t\tsize_t num_elements = max_elements_for_max_buffer_size(kg, data, max_buffer_size \/ 2);\n\t\tint2 global_size = make_int2(round_down((int)sqrt(num_elements), 64), (int)sqrt(num_elements));\n\t\tVLOG(1) << \"Global size: \" << global_size << \".\";\n\t\treturn global_size;\n\t}\n};\n\nOpenCLDeviceSplitKernel::OpenCLDeviceSplitKernel(DeviceInfo& info, Stats &stats, bool background_)\n: OpenCLDeviceBase(info, stats, background_)\n{\n\tsplit_kernel = new OpenCLSplitKernel(this);\n\n\tbackground = background_;\n}\n\nDevice *opencl_create_split_device(DeviceInfo& info, Stats& stats, bool background)\n{\n\treturn new OpenCLDeviceSplitKernel(info, stats, background);\n}\n\nCCL_NAMESPACE_END\n\n#endif \/* WITH_OPENCL *\/\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Copyright (C) 2010  Collabora Multimedia.\n      @author Mauricio Piacentini <mauricio.piacentini@collabora.co.uk>\n\n    This library is free software; you can redistribute it and\/or modify\n    it under the terms of the GNU Lesser General Public License as published\n    by the Free Software Foundation; either version 2.1 of the License, or\n    (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, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n#include \"clocktime.h\"\n\n#include <QtCore\/QTime>\n#include <gst\/gstclock.h>\n\nnamespace QGst {\n\nQTime ClockTime::toTime() const\n{\n    ClockTime asSeconds = GST_TIME_AS_SECONDS(m_clocktime);\n    ClockTime h = (asSeconds \/ 3600) % 24;\n    ClockTime min = (asSeconds \/ 60) % 60;\n    ClockTime sec = asSeconds % 60;\n    ClockTime msec = GST_TIME_AS_MSECONDS(m_clocktime) % 1000;\n    return QTime(h, min, sec, msec);\n}\n\nClockTime ClockTime::fromTime(const QTime & time)\n{\n    return (time.hour()*3600*Q_UINT64_C(1000000000)) + (time.minute()*60*Q_UINT64_C(1000000000))\n            + (time.second()*Q_UINT64_C(1000000000)) + (time.msec()*Q_UINT64_C(1000000));\n}\n\n} \/\/namespace QGst\n<commit_msg>src\/QGst\/clocktime.cpp add #include <glib-object.h>, <gst\/gstconfig.h><commit_after>\/*\n    Copyright (C) 2010  Collabora Multimedia.\n      @author Mauricio Piacentini <mauricio.piacentini@collabora.co.uk>\n\n    This library is free software; you can redistribute it and\/or modify\n    it under the terms of the GNU Lesser General Public License as published\n    by the Free Software Foundation; either version 2.1 of the License, or\n    (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, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n#include \"clocktime.h\"\n\n#include <QtCore\/QTime>\n#include <glib-object.h>\n#include <gst\/gstconfig.h>\n#include <gst\/gstclock.h>\n\nnamespace QGst {\n\nQTime ClockTime::toTime() const\n{\n    ClockTime asSeconds = GST_TIME_AS_SECONDS(m_clocktime);\n    ClockTime h = (asSeconds \/ 3600) % 24;\n    ClockTime min = (asSeconds \/ 60) % 60;\n    ClockTime sec = asSeconds % 60;\n    ClockTime msec = GST_TIME_AS_MSECONDS(m_clocktime) % 1000;\n    return QTime(h, min, sec, msec);\n}\n\nClockTime ClockTime::fromTime(const QTime & time)\n{\n    return (time.hour()*3600*Q_UINT64_C(1000000000)) + (time.minute()*60*Q_UINT64_C(1000000000))\n            + (time.second()*Q_UINT64_C(1000000000)) + (time.msec()*Q_UINT64_C(1000000));\n}\n\n} \/\/namespace QGst\n<|endoftext|>"}
{"text":"<commit_before>#include \"ImageFile.h\"\n\n#include <string.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <limits.h>\n#include <assert.h>\n#include <algorithm>\n\n#include \"ImageWriter.h\"\n#include \"ImageLoader.h\"\n#include \"CompressedImage.h\"\n#include \"Image.h\"\n#include \"FileStream.h\"\n\n#ifdef PNG_FOUND\n#  include \"ImageLoaderPNG.h\"\n#  include \"ImageWriterPNG.h\"\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Static helper functions\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic inline void ReportError(const CHAR *msg) {\n  fprintf(stderr, \"ImageFile -- %s\\n\", msg);\n}\n\ntemplate <typename T>\nstatic inline T abs(const T &a) {\n  return a > 0? a : -a;\n}\n\n\/\/!HACK!\n#ifdef _MSC_VER\n#define strncpy strncpy_s\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ ImageFile implementation\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nImageFile::ImageFile(const CHAR *filename)\n  : m_FileFormat(  DetectFileFormat(filename) )\n  , m_Image(NULL)\n{ \n\tstrncpy(m_Filename, filename, kMaxFilenameSz);\n}\n\nImageFile::ImageFile(const CHAR *filename, EImageFileFormat format)\n  : m_FileFormat(format)\n  , m_Image(NULL)\n{ \n\tstrncpy(m_Filename, filename, kMaxFilenameSz);\n}\n\nImageFile::ImageFile(const char *filename, EImageFileFormat format, const Image &image)\n\t: m_FileFormat(format)\n\t, m_Image(new Image(image))\n{\n\tstrncpy(m_Filename, filename, kMaxFilenameSz);\n}\n\nImageFile::~ImageFile() { \n  if(m_Image) {\n    delete m_Image;\n    m_Image = NULL;\n  }\n}\n\nbool ImageFile::Load() {\n\n\tif(m_Image) {\n\t\tdelete m_Image;\n\t\tm_Image = NULL;\n\t}\n\t\n\tunsigned char *rawData = ReadFileData(m_Filename);\n  if(rawData) {\n    m_Image = LoadImage(rawData);\n    delete [] rawData;\n  }\n\n\treturn m_Image != NULL;\n}\n\nbool ImageFile::Write() {\n\n\tImageWriter *writer = NULL;\n  switch(m_FileFormat) {\n\n#ifdef PNG_FOUND\n    case eFileFormat_PNG:\n      {\n\t\t\t\twriter = new ImageWriterPNG(*m_Image);\n      }\n      break;\n#endif \/\/ PNG_FOUND\n\n    default:\n      fprintf(stderr, \"Unable to write image: unknown file format.\\n\");\n      return false;\n  }\n\n\tif(NULL == writer)\n\t\treturn false;\n\n\tif(!writer->WriteImage()) {\n\t\tdelete writer;\n\t\treturn false;\n\t}\n\n\tWriteImageDataToFile(writer->GetRawFileData(), uint32(writer->GetRawFileDataSz()), m_Filename);\n\n\tdelete writer;\n\treturn true;\n}\n\nImage *ImageFile::LoadImage(const unsigned char *rawImageData) const {\n\n  ImageLoader *loader = NULL;\n  switch(m_FileFormat) {\n\n#ifdef PNG_FOUND\n    case eFileFormat_PNG:\n      {\n\tloader = new ImageLoaderPNG(rawImageData);\n      }\n      break;\n#endif \/\/ PNG_FOUND\n\n    default:\n      fprintf(stderr, \"Unable to load image: unknown file format.\\n\");\n      return NULL;\n  }\n\n  if(!loader)\n    return NULL;\n\n  if(!(loader->LoadImage())) {\n    fprintf(stderr, \"Unable to load image!\\n\");\n    delete loader;\n    return NULL;\n  }\n\n  Image *i = new Image(*loader);\n  delete loader;\n\n  return i;\n}\n\nEImageFileFormat ImageFile::DetectFileFormat(const CHAR *filename) {\n\n  size_t len = strlen(filename);\n  if(len >= 256) {\n    \/\/ !FIXME! Report Error...\n    return kNumImageFileFormats;\n  }\n\n  size_t dotPos = len - 1;\n\n  while(dotPos >= 0 && filename[dotPos--] != '.');\n\n  if(dotPos < 0) {\n    \/\/ !FIXME! Report Error.....\n    return kNumImageFileFormats;\n  }\n  \n  \/\/ consume the last character...\n  dotPos++;\n\n  const CHAR *ext = &filename[dotPos];\n\n  if(strcmp(ext, \".png\") == 0) {\n    return eFileFormat_PNG;\n  }\n  return kNumImageFileFormats;\n}\n\nunsigned char *ImageFile::ReadFileData(const CHAR *filename) {\n  FileStream fstr (filename, eFileMode_ReadBinary);\n  if(fstr.Tell() < 0) {\n    fprintf(stderr, \"Error opening file for reading: %s\\n\", filename);\n    return 0;\n  }\n\n  \/\/ Figure out the filesize.\n  fstr.Seek(0, FileStream::eSeekPosition_End);\n  uint64 fileSize = fstr.Tell();\n\n  \/\/ Allocate data for file contents\n  unsigned char *rawData = new unsigned char[fileSize];\n\n  \/\/ Return stream to beginning of file\n  fstr.Seek(0, FileStream::eSeekPosition_Beginning);\n  assert(fstr.Tell() == 0);\n\n  \/\/ Read all of the data\n  uint64 totalBytesRead = 0;\n  uint64 totalBytesLeft = fileSize;\n  uint32 bytesToRead = uint32(std::min(totalBytesLeft, uint64(1 << 31)));\n  int32 bytesRead;\n  while((bytesRead = fstr.Read(rawData, uint32(fileSize))) >= 0) {\n\t  totalBytesRead += bytesRead;\n\t  totalBytesLeft -= bytesRead;\n  }\n\n  if(totalBytesRead != fileSize) {\n    assert(!\"We didn't read as much data as we thought we had!\");\n    fprintf(stderr, \"Internal error: Incorrect file size assumption\\n\");\n    return 0;\n  }\n\n  \/\/ Return the data..\n  return rawData;\n}\n\nbool ImageFile::WriteImageDataToFile(const uint8 *data, const uint32 dataSz, const CHAR *filename) {\n\t\n\t\/\/ Open a file stream and write out the data...\n\tFileStream fstr (filename, eFileMode_WriteBinary);\n  if(fstr.Tell() < 0) {\n    fprintf(stderr, \"Error opening file for reading: %s\\n\", filename);\n    return 0;\n  }\n\n\tfstr.Write(data, dataSz);\n\tfstr.Flush();\n\treturn true;\n}\n<commit_msg>Fix small bug where we enter an infinite loop after we finish reading a file.<commit_after>#include \"ImageFile.h\"\n\n#include <string.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <limits.h>\n#include <assert.h>\n#include <algorithm>\n\n#include \"ImageWriter.h\"\n#include \"ImageLoader.h\"\n#include \"CompressedImage.h\"\n#include \"Image.h\"\n#include \"FileStream.h\"\n\n#ifdef PNG_FOUND\n#  include \"ImageLoaderPNG.h\"\n#  include \"ImageWriterPNG.h\"\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Static helper functions\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic inline void ReportError(const CHAR *msg) {\n  fprintf(stderr, \"ImageFile -- %s\\n\", msg);\n}\n\ntemplate <typename T>\nstatic inline T abs(const T &a) {\n  return a > 0? a : -a;\n}\n\n\/\/!HACK!\n#ifdef _MSC_VER\n#define strncpy strncpy_s\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ ImageFile implementation\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nImageFile::ImageFile(const CHAR *filename)\n  : m_FileFormat(  DetectFileFormat(filename) )\n  , m_Image(NULL)\n{ \n\tstrncpy(m_Filename, filename, kMaxFilenameSz);\n}\n\nImageFile::ImageFile(const CHAR *filename, EImageFileFormat format)\n  : m_FileFormat(format)\n  , m_Image(NULL)\n{ \n\tstrncpy(m_Filename, filename, kMaxFilenameSz);\n}\n\nImageFile::ImageFile(const char *filename, EImageFileFormat format, const Image &image)\n\t: m_FileFormat(format)\n\t, m_Image(new Image(image))\n{\n\tstrncpy(m_Filename, filename, kMaxFilenameSz);\n}\n\nImageFile::~ImageFile() { \n  if(m_Image) {\n    delete m_Image;\n    m_Image = NULL;\n  }\n}\n\nbool ImageFile::Load() {\n\n\tif(m_Image) {\n\t\tdelete m_Image;\n\t\tm_Image = NULL;\n\t}\n\t\n\tunsigned char *rawData = ReadFileData(m_Filename);\n  if(rawData) {\n    m_Image = LoadImage(rawData);\n    delete [] rawData;\n  }\n\n\treturn m_Image != NULL;\n}\n\nbool ImageFile::Write() {\n\n\tImageWriter *writer = NULL;\n  switch(m_FileFormat) {\n\n#ifdef PNG_FOUND\n    case eFileFormat_PNG:\n      {\n\t\t\t\twriter = new ImageWriterPNG(*m_Image);\n      }\n      break;\n#endif \/\/ PNG_FOUND\n\n    default:\n      fprintf(stderr, \"Unable to write image: unknown file format.\\n\");\n      return false;\n  }\n\n\tif(NULL == writer)\n\t\treturn false;\n\n\tif(!writer->WriteImage()) {\n\t\tdelete writer;\n\t\treturn false;\n\t}\n\n\tWriteImageDataToFile(writer->GetRawFileData(), uint32(writer->GetRawFileDataSz()), m_Filename);\n\n\tdelete writer;\n\treturn true;\n}\n\nImage *ImageFile::LoadImage(const unsigned char *rawImageData) const {\n\n  ImageLoader *loader = NULL;\n  switch(m_FileFormat) {\n\n#ifdef PNG_FOUND\n    case eFileFormat_PNG:\n      {\n\tloader = new ImageLoaderPNG(rawImageData);\n      }\n      break;\n#endif \/\/ PNG_FOUND\n\n    default:\n      fprintf(stderr, \"Unable to load image: unknown file format.\\n\");\n      return NULL;\n  }\n\n  if(!loader)\n    return NULL;\n\n  if(!(loader->LoadImage())) {\n    fprintf(stderr, \"Unable to load image!\\n\");\n    delete loader;\n    return NULL;\n  }\n\n  Image *i = new Image(*loader);\n  delete loader;\n\n  return i;\n}\n\nEImageFileFormat ImageFile::DetectFileFormat(const CHAR *filename) {\n\n  size_t len = strlen(filename);\n  if(len >= 256) {\n    \/\/ !FIXME! Report Error...\n    return kNumImageFileFormats;\n  }\n\n  size_t dotPos = len - 1;\n\n  while(dotPos >= 0 && filename[dotPos--] != '.');\n\n  if(dotPos < 0) {\n    \/\/ !FIXME! Report Error.....\n    return kNumImageFileFormats;\n  }\n  \n  \/\/ consume the last character...\n  dotPos++;\n\n  const CHAR *ext = &filename[dotPos];\n\n  if(strcmp(ext, \".png\") == 0) {\n    return eFileFormat_PNG;\n  }\n  return kNumImageFileFormats;\n}\n\nunsigned char *ImageFile::ReadFileData(const CHAR *filename) {\n  FileStream fstr (filename, eFileMode_ReadBinary);\n  if(fstr.Tell() < 0) {\n    fprintf(stderr, \"Error opening file for reading: %s\\n\", filename);\n    return 0;\n  }\n\n  \/\/ Figure out the filesize.\n  fstr.Seek(0, FileStream::eSeekPosition_End);\n  uint64 fileSize = fstr.Tell();\n\n  \/\/ Allocate data for file contents\n  unsigned char *rawData = new unsigned char[fileSize];\n\n  \/\/ Return stream to beginning of file\n  fstr.Seek(0, FileStream::eSeekPosition_Beginning);\n  assert(fstr.Tell() == 0);\n\n  \/\/ Read all of the data\n  uint64 totalBytesRead = 0;\n  uint64 totalBytesLeft = fileSize;\n  uint32 bytesToRead = uint32(std::min(totalBytesLeft, uint64(1 << 31)));\n  int32 bytesRead;\n  while((bytesRead = fstr.Read(rawData, uint32(fileSize))) > 0) {\n\t  totalBytesRead += bytesRead;\n\t  totalBytesLeft -= bytesRead;\n  }\n\n  if(totalBytesRead != fileSize) {\n    assert(!\"We didn't read as much data as we thought we had!\");\n    fprintf(stderr, \"Internal error: Incorrect file size assumption\\n\");\n    return 0;\n  }\n\n  \/\/ Return the data..\n  return rawData;\n}\n\nbool ImageFile::WriteImageDataToFile(const uint8 *data, const uint32 dataSz, const CHAR *filename) {\n\t\n\t\/\/ Open a file stream and write out the data...\n\tFileStream fstr (filename, eFileMode_WriteBinary);\n  if(fstr.Tell() < 0) {\n    fprintf(stderr, \"Error opening file for reading: %s\\n\", filename);\n    return 0;\n  }\n\n\tfstr.Write(data, dataSz);\n\tfstr.Flush();\n\treturn true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright 2009 Blanton Black\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 Channel.cpp\n * @brief Channel implementation\n *\/\n\n#include \"Channel.moc\"\n\n#include \"DSP.h\"\n#include \"DSPConnection.h\"\n\n#include <fmod_errors.h>\n\n#include <QDebug>\n\nusing namespace QtFMOD;\n\nstruct Channel::Private\n{\n    mutable FMOD_RESULT fr;\n    FMOD::Channel* fchannel;\n\n    Private () :\n        fr(FMOD_OK),\n        fchannel(NULL)\n    {\n    }\n    ~Private ()\n    {\n    }\n};\n\n\/**\n * @note This is intended to be wrapped in a shared pointer, without a parent.\n *\/\nChannel::Channel () :\n    QObject(),\n    d(new Private)\n{\n}\n\nChannel::~Channel ()\n{\n}\n\nvoid Channel::setInternalPointer (FMOD::Channel* fchannel)\n{\n    d->fchannel = fchannel;\n    d->fchannel->setUserData(this);\n    d->fchannel->setCallback(Channel::callback);\n}\n\nFMOD::Channel* Channel::internalPointer () const\n{\n    return d->fchannel;\n}\n\nbool Channel::isNull () const\n{\n    return (d->fchannel == NULL);\n}\n\nint Channel::error () const\n{\n    return d->fr;\n}\n\nQString Channel::errorString () const\n{\n    return FMOD_ErrorString(d->fr);\n}\n\nChannel::operator FMOD::Channel*& () const\n{\n    return d->fchannel;\n}\n\nbool Channel::isPlaying () const\n{\n    bool v;\n    d->fr = d->fchannel->isPlaying(&v);\n    return v;\n}\n\n\/**\n * Static channel callback.\n *\/\nFMOD_RESULT F_CALLBACK Channel::callback (FMOD_CHANNEL* fchannel,\n                                          FMOD_CHANNEL_CALLBACKTYPE type,\n                                          void* command_data1,\n                                          void* command_data2)\n{\n    Q_UNUSED(command_data1);\n    Q_UNUSED(command_data2);\n\n    FMOD_RESULT fr;\n    Channel* channel = NULL;\n\n    \/\/ get QtFMOD::Channel from the user data\n    fr = FMOD_Channel_GetUserData(fchannel, (void**)&channel);\n\n    if (fr != FMOD_OK) {\n        qCritical() << FMOD_ErrorString(fr);\n        return FMOD_OK;\n    }\n\n    Q_ASSERT(channel);\n    Q_ASSERT(fchannel==reinterpret_cast<FMOD_CHANNEL*>(channel->d->fchannel));\n\n    \/\/ process\n    switch (type) {\n    case FMOD_CHANNEL_CALLBACKTYPE_END:\n        qDebug() << \"callback: channel: end\";\n        emit channel->soundEnded();\n        break;\n    case FMOD_CHANNEL_CALLBACKTYPE_VIRTUALVOICE:\n        qDebug() << \"callback: channel: virtual voice\";\n        break;\n    case FMOD_CHANNEL_CALLBACKTYPE_SYNCPOINT:\n        qDebug() << \"callback: channel: syncpoint\";\n        break;\n    case FMOD_CHANNEL_CALLBACKTYPE_OCCLUSION:\n        qDebug() << \"callback: channel: occlusion\";\n        break;\n    default:\n        qCritical() << \"callback: channel: unsupported callback type\";\n        break;\n    }\n\n    return FMOD_OK;\n}\n\nvoid Channel::setPaused (bool paused)\n{\n    d->fr = d->fchannel->setPaused(paused);\n}\n\nbool Channel::paused () const\n{\n    bool paused;\n    d->fr = d->fchannel->getPaused(&paused);\n    return paused;\n}\n\n\/**\n * @param array A power of two (64 to 8192).\n *\/\nvoid Channel::spectrum (QVector<float>& array, int channelOffset,\n                        FMOD_DSP_FFT_WINDOW windowType) const\n{\n    d->fr = d->fchannel->getSpectrum(array.data(), array.size(),\n                                     channelOffset, windowType);\n}\n\n\/**\n * @param waveArray Max size 16384.\n *\/\nvoid Channel::waveData (QVector<float>& waveArray, int channelOffset) const\n{\n    d->fr = d->fchannel->getWaveData(waveArray.data(), waveArray.size(),\n                                     channelOffset);\n}\n\nQSharedPointer<DSPConnection> Channel::addDSP (QSharedPointer<DSP>& dsp)\n{\n    FMOD::DSPConnection* fdspConnection = NULL;\n    d->fr = d->fchannel->addDSP(dsp->internalPointer(), &fdspConnection);\n    return QSharedPointer<DSPConnection>(new DSPConnection(fdspConnection));\n}\n\n\/\/ vim: sw=4\n<commit_msg>remove channel callbacks when destroying wrapper<commit_after>\/*\n * Copyright 2009 Blanton Black\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 Channel.cpp\n * @brief Channel implementation\n *\/\n\n#include \"Channel.moc\"\n\n#include \"DSP.h\"\n#include \"DSPConnection.h\"\n\n#include <fmod_errors.h>\n\n#include <QDebug>\n\nusing namespace QtFMOD;\n\nstruct Channel::Private\n{\n    mutable FMOD_RESULT fr;\n    FMOD::Channel* fchannel;\n\n    Private () :\n        fr(FMOD_OK),\n        fchannel(NULL)\n    {\n    }\n    ~Private ()\n    {\n    }\n};\n\n\/**\n * @note This is intended to be wrapped in a shared pointer, without a parent.\n *\/\nChannel::Channel () :\n    QObject(),\n    d(new Private)\n{\n}\n\nChannel::~Channel ()\n{\n    \/\/ this channel may still be playing.  this is just a wrapper, and channels\n    \/\/ can't be released, so remove the callback\n    d->fchannel->setCallback(NULL);\n}\n\nvoid Channel::setInternalPointer (FMOD::Channel* fchannel)\n{\n    d->fchannel = fchannel;\n    d->fchannel->setUserData(this);\n    d->fchannel->setCallback(Channel::callback);\n}\n\nFMOD::Channel* Channel::internalPointer () const\n{\n    return d->fchannel;\n}\n\nbool Channel::isNull () const\n{\n    return (d->fchannel == NULL);\n}\n\nint Channel::error () const\n{\n    return d->fr;\n}\n\nQString Channel::errorString () const\n{\n    return FMOD_ErrorString(d->fr);\n}\n\nChannel::operator FMOD::Channel*& () const\n{\n    return d->fchannel;\n}\n\nbool Channel::isPlaying () const\n{\n    bool v;\n    d->fr = d->fchannel->isPlaying(&v);\n    return v;\n}\n\n\/**\n * Static channel callback.\n *\/\nFMOD_RESULT F_CALLBACK Channel::callback (FMOD_CHANNEL* fchannel,\n                                          FMOD_CHANNEL_CALLBACKTYPE type,\n                                          void* command_data1,\n                                          void* command_data2)\n{\n    Q_UNUSED(command_data1);\n    Q_UNUSED(command_data2);\n\n    FMOD_RESULT fr;\n    Channel* channel = NULL;\n\n    \/\/ get QtFMOD::Channel from the user data\n    fr = FMOD_Channel_GetUserData(fchannel, (void**)&channel);\n\n    if (fr != FMOD_OK) {\n        qCritical() << FMOD_ErrorString(fr);\n        return FMOD_OK;\n    }\n\n    Q_ASSERT(channel);\n    Q_ASSERT(fchannel==reinterpret_cast<FMOD_CHANNEL*>(channel->d->fchannel));\n\n    \/\/ process\n    switch (type) {\n    case FMOD_CHANNEL_CALLBACKTYPE_END:\n        qDebug() << \"callback: channel: end\";\n        emit channel->soundEnded();\n        break;\n    case FMOD_CHANNEL_CALLBACKTYPE_VIRTUALVOICE:\n        qDebug() << \"callback: channel: virtual voice\";\n        break;\n    case FMOD_CHANNEL_CALLBACKTYPE_SYNCPOINT:\n        qDebug() << \"callback: channel: syncpoint\";\n        break;\n    case FMOD_CHANNEL_CALLBACKTYPE_OCCLUSION:\n        qDebug() << \"callback: channel: occlusion\";\n        break;\n    default:\n        qCritical() << \"callback: channel: unsupported callback type\";\n        break;\n    }\n\n    return FMOD_OK;\n}\n\nvoid Channel::setPaused (bool paused)\n{\n    d->fr = d->fchannel->setPaused(paused);\n}\n\nbool Channel::paused () const\n{\n    bool paused;\n    d->fr = d->fchannel->getPaused(&paused);\n    return paused;\n}\n\n\/**\n * @param array A power of two (64 to 8192).\n *\/\nvoid Channel::spectrum (QVector<float>& array, int channelOffset,\n                        FMOD_DSP_FFT_WINDOW windowType) const\n{\n    d->fr = d->fchannel->getSpectrum(array.data(), array.size(),\n                                     channelOffset, windowType);\n}\n\n\/**\n * @param waveArray Max size 16384.\n *\/\nvoid Channel::waveData (QVector<float>& waveArray, int channelOffset) const\n{\n    d->fr = d->fchannel->getWaveData(waveArray.data(), waveArray.size(),\n                                     channelOffset);\n}\n\nQSharedPointer<DSPConnection> Channel::addDSP (QSharedPointer<DSP>& dsp)\n{\n    FMOD::DSPConnection* fdspConnection = NULL;\n    d->fr = d->fchannel->addDSP(dsp->internalPointer(), &fdspConnection);\n    return QSharedPointer<DSPConnection>(new DSPConnection(fdspConnection));\n}\n\n\/\/ vim: sw=4\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *            Copyright 2009-2019 The VOTCA Development Team\n *                       (http:\/\/www.votca.org)\n *\n *      Licensed under the Apache License, Version 2.0 (the \"License\")\n *\n * You may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *              http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n#include <algorithm>\n#include <cassert>\n#include <string>\n#include <votca\/tools\/graph.h>\n\nusing namespace std;\n\nnamespace votca {\nnamespace tools {\n\nclass GraphNode;\n\nbool nodeForEveryVertex_(vector<Index> vertices,\n                         unordered_map<Index, GraphNode> nodes) {\n  for (const Index vertex : vertices) {\n    if (nodes.count(vertex) == 0) {\n      return false;\n    }\n  }\n  return true;\n}\n\nGraph::Graph(vector<Edge> edges, unordered_map<Index, GraphNode> nodes) {\n  edge_container_ = EdgeContainer(edges);\n  vector<Index> vertices = edge_container_.getVertices();\n  assert(nodeForEveryVertex_(vertices, nodes) &&\n         \"A node must exist for every vertex.\");\n  nodes_ = nodes;\n  for (const pair<Index, GraphNode> id_and_node : nodes_) {\n    if (edge_container_.vertexExist(id_and_node.first) == false) {\n      edge_container_.addVertex(id_and_node.first);\n    }\n  }\n  calcId_();\n}\n\nbool Graph::operator!=(const Graph& graph) const {\n  return id_.compare(graph.id_);\n}\n\nbool Graph::operator==(const Graph& graph) const { return !(*(this) != graph); }\n\nvector<pair<Index, GraphNode>> Graph::getIsolatedNodes(void) const {\n  vector<pair<Index, GraphNode>> isolated_nodes;\n  vector<Index> vertices_degree_0 = edge_container_.getVerticesDegree(0);\n\n  for (const Index vertex : vertices_degree_0) {\n    pair<Index, GraphNode> id_and_node{vertex, nodes_.at(vertex)};\n    isolated_nodes.push_back(id_and_node);\n  }\n  return isolated_nodes;\n}\n\nvector<pair<Index, GraphNode>> Graph::getNeighNodes(Index vertex) const {\n  vector<Index> neigh_vertices = edge_container_.getNeighVertices(vertex);\n  vector<pair<Index, GraphNode>> neigh_ids_and_nodes;\n  for (const Index& neigh_vert : neigh_vertices) {\n    auto id_and_node =\n        pair<Index, GraphNode>(neigh_vert, nodes_.at(neigh_vert));\n    neigh_ids_and_nodes.push_back(id_and_node);\n  }\n  return neigh_ids_and_nodes;\n}\n\nvoid Graph::setNode(Index vertex, GraphNode& graph_node) {\n  assert(nodes_.count(vertex) && \"Can only set a node that already exists\");\n  nodes_[vertex] = graph_node;\n  calcId_();\n}\n\nvoid Graph::setNode(std::pair<Index, GraphNode>& id_and_node) {\n  setNode(id_and_node.first, id_and_node.second);\n}\n\nGraphNode Graph::getNode(const Index vertex) const {\n  assert(nodes_.count(vertex));\n  return nodes_.at(vertex);\n}\n\nvector<pair<Index, GraphNode>> Graph::getNodes(void) const {\n  vector<pair<Index, GraphNode>> vec_nodes;\n  for (const pair<Index, GraphNode>& id_and_node : nodes_) {\n    vec_nodes.push_back(id_and_node);\n  }\n  return vec_nodes;\n}\n\nvector<Index> Graph::getJunctions() const {\n  vector<Index> junctions;\n  Index max_degree = edge_container_.getMaxDegree();\n  for (Index degree = 3; degree <= max_degree; ++degree) {\n    vector<Index> vertices = edge_container_.getVerticesDegree(degree);\n    junctions.insert(junctions.end(), vertices.begin(), vertices.end());\n  }\n  return junctions;\n}\n\nvoid Graph::clearNodes() { nodes_.clear(); }\n\nvoid Graph::copyNodes(Graph& graph) {\n  assert(nodes_.size() == 0);\n  for (const pair<Index, GraphNode>& id_and_node : graph.nodes_) {\n    this->nodes_[id_and_node.first] = id_and_node.second;\n  }\n}\n\nvoid Graph::calcId_() {\n  auto nodes = getNodes();\n  sort(nodes.begin(), nodes.end(), cmpVertNodePair);\n  string struct_Id_temp = \"\";\n  for (const pair<Index, GraphNode>& id_and_node : nodes) {\n    struct_Id_temp.append(id_and_node.second.getStringId());\n  }\n  id_ = struct_Id_temp;\n  return;\n}\n\nlong Graph::getDegree(Index vertex) const {\n  if (edge_container_.vertexExist(vertex)) {\n    return edge_container_.getDegree(vertex);\n  }\n  if (nodes_.count(vertex)) {\n    return 0;\n  }\n  throw invalid_argument(\n      \"vertex does not exist within the graph the degree is \"\n      \"not defined.\");\n}\n\nbool Graph::vertexExist(Index vertex) const {\n  if (edge_container_.vertexExist(vertex)) {\n    return true;\n  }\n  if (nodes_.count(vertex)) {\n    return true;\n  }\n  return false;\n}\n\nvector<Index> Graph::getVerticesDegree(Index degree) const {\n  return edge_container_.getVerticesDegree(degree);\n}\n\nvector<Index> Graph::getVertices() const {\n  return edge_container_.getVertices();\n}\n\nostream& operator<<(ostream& os, const Graph graph) {\n  os << \"Graph\" << endl;\n  for (const pair<Index, GraphNode>& id_and_node : graph.nodes_) {\n    os << \"Node \" << id_and_node.first << endl;\n    os << id_and_node.second << endl;\n  }\n  return os;\n}\n\nbool cmpVertNodePair(const pair<Index, GraphNode>& id_and_node1,\n                     const pair<Index, GraphNode>& id_and_node2) {\n  string str1_Id = id_and_node1.second.getStringId();\n  return str1_Id.compare(id_and_node2.second.getStringId()) < 0;\n}\n}  \/\/ namespace tools\n}  \/\/ namespace votca\n<commit_msg>Graph::getDegree index type<commit_after>\/*\n *            Copyright 2009-2019 The VOTCA Development Team\n *                       (http:\/\/www.votca.org)\n *\n *      Licensed under the Apache License, Version 2.0 (the \"License\")\n *\n * You may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *              http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n#include <algorithm>\n#include <cassert>\n#include <string>\n#include <votca\/tools\/graph.h>\n\nusing namespace std;\n\nnamespace votca {\nnamespace tools {\n\nclass GraphNode;\n\nbool nodeForEveryVertex_(vector<Index> vertices,\n                         unordered_map<Index, GraphNode> nodes) {\n  for (const Index vertex : vertices) {\n    if (nodes.count(vertex) == 0) {\n      return false;\n    }\n  }\n  return true;\n}\n\nGraph::Graph(vector<Edge> edges, unordered_map<Index, GraphNode> nodes) {\n  edge_container_ = EdgeContainer(edges);\n  vector<Index> vertices = edge_container_.getVertices();\n  assert(nodeForEveryVertex_(vertices, nodes) &&\n         \"A node must exist for every vertex.\");\n  nodes_ = nodes;\n  for (const pair<Index, GraphNode> id_and_node : nodes_) {\n    if (edge_container_.vertexExist(id_and_node.first) == false) {\n      edge_container_.addVertex(id_and_node.first);\n    }\n  }\n  calcId_();\n}\n\nbool Graph::operator!=(const Graph& graph) const {\n  return id_.compare(graph.id_);\n}\n\nbool Graph::operator==(const Graph& graph) const { return !(*(this) != graph); }\n\nvector<pair<Index, GraphNode>> Graph::getIsolatedNodes(void) const {\n  vector<pair<Index, GraphNode>> isolated_nodes;\n  vector<Index> vertices_degree_0 = edge_container_.getVerticesDegree(0);\n\n  for (const Index vertex : vertices_degree_0) {\n    pair<Index, GraphNode> id_and_node{vertex, nodes_.at(vertex)};\n    isolated_nodes.push_back(id_and_node);\n  }\n  return isolated_nodes;\n}\n\nvector<pair<Index, GraphNode>> Graph::getNeighNodes(Index vertex) const {\n  vector<Index> neigh_vertices = edge_container_.getNeighVertices(vertex);\n  vector<pair<Index, GraphNode>> neigh_ids_and_nodes;\n  for (const Index& neigh_vert : neigh_vertices) {\n    auto id_and_node =\n        pair<Index, GraphNode>(neigh_vert, nodes_.at(neigh_vert));\n    neigh_ids_and_nodes.push_back(id_and_node);\n  }\n  return neigh_ids_and_nodes;\n}\n\nvoid Graph::setNode(Index vertex, GraphNode& graph_node) {\n  assert(nodes_.count(vertex) && \"Can only set a node that already exists\");\n  nodes_[vertex] = graph_node;\n  calcId_();\n}\n\nvoid Graph::setNode(std::pair<Index, GraphNode>& id_and_node) {\n  setNode(id_and_node.first, id_and_node.second);\n}\n\nGraphNode Graph::getNode(const Index vertex) const {\n  assert(nodes_.count(vertex));\n  return nodes_.at(vertex);\n}\n\nvector<pair<Index, GraphNode>> Graph::getNodes(void) const {\n  vector<pair<Index, GraphNode>> vec_nodes;\n  for (const pair<Index, GraphNode>& id_and_node : nodes_) {\n    vec_nodes.push_back(id_and_node);\n  }\n  return vec_nodes;\n}\n\nvector<Index> Graph::getJunctions() const {\n  vector<Index> junctions;\n  Index max_degree = edge_container_.getMaxDegree();\n  for (Index degree = 3; degree <= max_degree; ++degree) {\n    vector<Index> vertices = edge_container_.getVerticesDegree(degree);\n    junctions.insert(junctions.end(), vertices.begin(), vertices.end());\n  }\n  return junctions;\n}\n\nvoid Graph::clearNodes() { nodes_.clear(); }\n\nvoid Graph::copyNodes(Graph& graph) {\n  assert(nodes_.size() == 0);\n  for (const pair<Index, GraphNode>& id_and_node : graph.nodes_) {\n    this->nodes_[id_and_node.first] = id_and_node.second;\n  }\n}\n\nvoid Graph::calcId_() {\n  auto nodes = getNodes();\n  sort(nodes.begin(), nodes.end(), cmpVertNodePair);\n  string struct_Id_temp = \"\";\n  for (const pair<Index, GraphNode>& id_and_node : nodes) {\n    struct_Id_temp.append(id_and_node.second.getStringId());\n  }\n  id_ = struct_Id_temp;\n  return;\n}\n\nIndex Graph::getDegree(Index vertex) const {\n  if (edge_container_.vertexExist(vertex)) {\n    return edge_container_.getDegree(vertex);\n  }\n  if (nodes_.count(vertex)) {\n    return 0;\n  }\n  throw invalid_argument(\n      \"vertex does not exist within the graph the degree is \"\n      \"not defined.\");\n}\n\nbool Graph::vertexExist(Index vertex) const {\n  if (edge_container_.vertexExist(vertex)) {\n    return true;\n  }\n  if (nodes_.count(vertex)) {\n    return true;\n  }\n  return false;\n}\n\nvector<Index> Graph::getVerticesDegree(Index degree) const {\n  return edge_container_.getVerticesDegree(degree);\n}\n\nvector<Index> Graph::getVertices() const {\n  return edge_container_.getVertices();\n}\n\nostream& operator<<(ostream& os, const Graph graph) {\n  os << \"Graph\" << endl;\n  for (const pair<Index, GraphNode>& id_and_node : graph.nodes_) {\n    os << \"Node \" << id_and_node.first << endl;\n    os << id_and_node.second << endl;\n  }\n  return os;\n}\n\nbool cmpVertNodePair(const pair<Index, GraphNode>& id_and_node1,\n                     const pair<Index, GraphNode>& id_and_node2) {\n  string str1_Id = id_and_node1.second.getStringId();\n  return str1_Id.compare(id_and_node2.second.getStringId()) < 0;\n}\n}  \/\/ namespace tools\n}  \/\/ namespace votca\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file   MakeFMDMCTrackTrain.C\n * @author Christian Holm Christensen <cholm@nbi.dk>\n * @date   Fri Jun  1 13:54:47 2012\n * \n * @brief  \n * \n * @ingroup pwglf_forward_trains_specific\n *\/\n#include \"TrainSetup.C\"\n\/\/ #include \"ParUtilities.C\"\n\n\/\/====================================================================\n\/**\n * Analysis train to make Forward and Central MC corrections\n * \n *\n * @ingroup pwglf_forward_mc\n * @ingroup pwglf_forward_trains_specific\n *\/\nclass MakeFMDMCTrackTrain : public TrainSetup\n{\npublic:\n  \/** \n   * Constructor.  Date and time must be specified when running this\n   * in Termiante mode on Grid\n   * \n   * @param name     Name of train (free form)\n   *\/\n  MakeFMDMCTrackTrain(const  char* name) \n    : TrainSetup(name)\n  {\n    fOptions.Add(\"use-tuple\", \"Whether to make an NTuple of hits\");\n    fOptions.Add(\"max-strips\", \"NUMBER\", \"Max strips\/cluster\", 2);\n    fOptions.Set(\"type\", \"ESD\");\n  }\nprotected:\n  \/** \n   * Create the tasks \n   * \n   * @param mgr  Analysis manager \n   *\/\n  void CreateTasks(AliAnalysisManager* mgr)\n  {\n    \/\/ --- Output file name ------------------------------------------\n    AliAnalysisManager::SetCommonFileName(\"forward_mctracks.root\");\n\n\n    \/\/ --- Load libraries\/pars ---------------------------------------\n    fRailway->LoadLibrary(\"PWGLFforward2\");\n    \/\/ fRailway->LoadLibrary(\"Proof\");\n    \/\/ fRailway->LoadLibrary(\"Gui\"); \/\/ Sigh! CDB depends on GUI!\n    \/\/ fRailway->LoadLibrary(\"CDB\");\n    \/\/ fRailway->LoadLibrary(\"RAWDatabase\");\n    \/\/ fRailway->LoadLibrary(\"STEER\");\n    \/\/ fRailway->LoadLibrary(\"FMDbase\");\n    \/\/ fRailway->LoadLibrary(\"FMDsim\");\n    \/\/ fRailway->LoadLibrary(\"PWGLFforwardhit\");\n    \n    \/\/ --- Set load path ---------------------------------------------\n    gROOT->SetMacroPath(Form(\"%s:$(ALICE_ROOT)\/PWGLF\/FORWARD\/analysis2\",\n\t\t\t     gROOT->GetMacroPath()));\n\n    \/\/ --- Check if this is MC ---------------------------------------\n    if (!mgr->GetMCtruthEventHandler()) \n      Fatal(\"CreateTasks\", \"No MC truth handler\");\n    \n    Bool_t   useTuple  = fOptions.AsBool(\"use-tuple\");\n    UShort_t maxStrips = fOptions.AsInt(\"max-strips\");\n    Int_t    verbose   = fOptions.AsInt(\"verbose\");\n\n    TString args = TString::Format(\"%d,%d,%d\", \n\t\t\t\t   useTuple,\n\t\t\t\t   maxStrips, \n\t\t\t\t   verbose);\n    if (!CoupleCar(\"AddTaskFMDMCTracks.C\", args))\n      Fatal(\"CreateTasks\", \"Couldn't add our task\");\n  }\n  \/\/__________________________________________________________________\n  \/** \n   * Create physics selection , and add to manager\n   * \n   * @param mc Whether this is for MC \n   * @param mgr Manager \n   *\/\n  void CreatePhysicsSelection(Bool_t mc,\n\t\t\t      AliAnalysisManager* mgr)\n  {\n    TrainSetup::CreatePhysicsSelection(mc, mgr);\n\n    \/\/ --- Get input event handler -----------------------------------\n    AliInputEventHandler* ih =\n      dynamic_cast<AliInputEventHandler*>(mgr->GetInputEventHandler());\n    if (!ih) \n      Fatal(\"CreatePhysicsSelection\", \"Couldn't get input handler (%p)\", ih);\n    \n    \/\/ --- Get Physics selection -------------------------------------\n    AliPhysicsSelection* ps = \n      dynamic_cast<AliPhysicsSelection*>(ih->GetEventSelection());\n    if (!ps) \n      Fatal(\"CreatePhysicsSelection\", \"Couldn't get PhysicsSelection (%p)\", ps);\n\n    \/\/ --- Ignore trigger class when selecting events.  This means ---\n    \/\/ --- that we get offline+(A,C,E) events too --------------------\n    \/\/ ps->SetSkipTriggerClassSelection(true);\n  }\n  \/\/__________________________________________________________________\n  \/** \n   * @return 0 - AOD disabled \n   *\/\n  virtual AliVEventHandler* CreateOutputHandler(UShort_t) { return 0; }\n  \/** \n   * Do not the centrality selection\n   *\/\n  \/\/ void CreateCentralitySelection(Bool_t) {}\n  \/\/__________________________________________________________________\n  const char* ClassName() const { return \"MakeFMDMCTrackTrain\"; }\n\n  \/** \n   * Overloaded to create new dNdeta.C and dndeta.sh in the output \n   * directory\n   * \n   * @param asShellScript \n   *\/\n  void SaveSetup(Bool_t asShellScript)\n  {\n    TrainSetup::SaveSetup(asShellScript);\n    SaveSummarize();\n\n    if (!fRailway || fRailway->Mode() != Railway::kGrid) return;\n\n    SaveDownloadTrees();\n\n  }\n  \/** \n   * Write a ROOT script to draw summary \n   * \n   *\/\n  void SaveSummarize()\n  {\n    std::ofstream f(\"Summarize.C\");\n    if (!f) { \n      Error(\"SaveSummarize\", \"Failed to open Summarize.C script\");\n      return;\n    }\n    f << \"\/\/ Generated by \" << ClassName() << \"\\n\"\n      << \"\/\/ WHAT is a bit mask of\\n\"\n      << \"\/\/   0x001     Event inspector\\n\"\n      << \"\/\/   0x002     Track inspector\\n\"\n      << \"\/\/   0x004     Energy loss fits\\n\"\n      << \"\/\/   0x100     Landscape\\n\"\n      << \"\/\/   0x200     Pause\\n\"\n      << \"\/\/\\n\"\n      << \"void Summarize(const char* filename=\\\"forward_mctracks.root\\\",\\n\"\n      << \"               UShort_t what=0x10F)\\n\"\n      << \"{\\n\"\n      << \"  const char* fwd=\\\"$ALICE_ROOT\/PWGLF\/FORWARD\/analysis2\\\";\\n\"\n      << \"  gROOT->LoadMacro(Form(\\\"%s\/scripts\/SummaryMCTrackDrawer.C+g\\\",fwd));\\n\"\n      << \"  SummaryMCTrackDrawer smd;\\n\"\n      << \"  smd.Run(filename,what);\\n\"\n      << \"}\\n\"\n      << \"\/\/ EOF\" << std::endl;\n    f.close();\n  }\n  \/** \n   * Make a ROOT Script to download the generated AODs\n   * \n   *\/\n  void SaveDownloadTrees()\n  {\n    std::ofstream f(\"DownloadTrees.C\");\n    if (!f) { \n      Error(\"SaveDownloadTrees\", \"Failed to open DownloadTrees.C\");\n      return;\n    }\n    f << \"\/\/ Generated by \" << ClassName() << \"\\n\"\n      << \"void DownloadTrees(Bool_t force=false)\\n\"\n      << \"{\\n\"\n      << \"  if (!TGrid::Connect(\\\"alien:\/\/\\\")) {\\n\"\n      << \"    Error(\\\"DownloadTrees\\\",\\\"Failed to connect to AliEn\\\");\\n\"\n      << \"    return;\\n\"\n      << \"  }\\n\\n\"\n      << \"  TString dir(\\\"\" << fRailway->OutputPath() << \"\\\");\\n\"\n      << \"  TString pat(\\\"*\/forward_tuple.root\\\");\\n\"\n      << \"  TGridResult* r = gGrid->Query(dir,pat);\\n\"\n      << \"  if (!r) {\\n\"\n      << \"    Error(\\\"DownloadTrees\\\",\\\"No result from query\\\");\\n\"\n      << \"    return;\\n\"\n      << \"  }\\n\\n\"\n      << \"  Int_t n = r->GetEntries();\\n\"\n      << \"  Printf(\\\"=== Got a total of %d AOD files\\\",n);\\n\"\n      << \"  for (Int_t i = 0; i < n; i++) {\\n\"\n      << \"     TString path(r->GetKey(i, \\\"turl\\\"));\\n\"\n      << \"     TString dir(gSystem->DirName(path));\\n\"\n      << \"     TString sub(gSystem->BaseName(dir));\\n\"\n      << \"     TString subsub(gSystem->BaseName(gSystem->DirName(dir)));\\n\"\n      << \"     TString out = TString::Format(\\\"forward_tree_%s_%s.root\\\",\\n\"\n      << \"                                   subsub.Data(),sub.Data());\\n\"\n      << \"     if (!gSystem->AccessPathName(out.Data()) && !force) {\\n\"\n      << \"       Printf(\\\"=== Already have %s\\\",out.Data());\\n\"\n      << \"       continue;\\n\"\n      << \"     }\\n\"\n      << \"     Printf(\\\"=== Getting %s %s (%3d\/%3d)\\\",\\n\"\n      << \"            subsub.Data(),sub.Data(),i,n);\\n\"\n      << \"     if (!TFile::Cp(path, out)) {\\n\"\n      << \"       Warning(\\\"DownloadTrees\\\",\\\"Failed to copy %s -> %s\\\",\\n\"\n      << \"               path.Data(), out.Data());\\n\"\n      << \"       continue;\\n\"\n      << \"     }\\n\"\n      << \"   }\\n\"\n      << \"}\\n\"\n      << \"\/\/ EOF\\n\"\n      << std::endl;\n    f.close();\n  }   \n  void PostShellCode(std::ostream& f)\n  {\n    f << \"  echo \\\"=== Summarizing results ...\\\"\\n\"\n      << \"  aliroot -l -b -q ${prefix}Summarize.C\\n\"\n      << std::endl;\n  }\n\n};\n\n\/\/\n\/\/ EOF\n\/\/\n<commit_msg>Write some scripts<commit_after>\/**\n * @file   MakeFMDMCTrackTrain.C\n * @author Christian Holm Christensen <cholm@nbi.dk>\n * @date   Fri Jun  1 13:54:47 2012\n * \n * @brief  \n * \n * @ingroup pwglf_forward_trains_specific\n *\/\n#include \"TrainSetup.C\"\n\/\/ #include \"ParUtilities.C\"\n\n\/\/====================================================================\n\/**\n * Analysis train to make Forward and Central MC corrections\n * \n *\n * @ingroup pwglf_forward_mc\n * @ingroup pwglf_forward_trains_specific\n *\/\nclass MakeFMDMCTrackTrain : public TrainSetup\n{\npublic:\n  \/** \n   * Constructor.  Date and time must be specified when running this\n   * in Termiante mode on Grid\n   * \n   * @param name     Name of train (free form)\n   *\/\n  MakeFMDMCTrackTrain(const  char* name) \n    : TrainSetup(name)\n  {\n    fOptions.Add(\"use-tuple\", \"Whether to make an NTuple of hits\");\n    fOptions.Add(\"max-strips\", \"NUMBER\", \"Max strips\/cluster\", 2);\n    fOptions.Set(\"type\", \"ESD\");\n  }\nprotected:\n  \/** \n   * Create the tasks \n   * \n   * @param mgr  Analysis manager \n   *\/\n  void CreateTasks(AliAnalysisManager* mgr)\n  {\n    \/\/ --- Output file name ------------------------------------------\n    AliAnalysisManager::SetCommonFileName(\"forward_mctracks.root\");\n\n\n    \/\/ --- Load libraries\/pars ---------------------------------------\n    fRailway->LoadLibrary(\"PWGLFforward2\");\n    \/\/ fRailway->LoadLibrary(\"Proof\");\n    \/\/ fRailway->LoadLibrary(\"Gui\"); \/\/ Sigh! CDB depends on GUI!\n    \/\/ fRailway->LoadLibrary(\"CDB\");\n    \/\/ fRailway->LoadLibrary(\"RAWDatabase\");\n    \/\/ fRailway->LoadLibrary(\"STEER\");\n    \/\/ fRailway->LoadLibrary(\"FMDbase\");\n    \/\/ fRailway->LoadLibrary(\"FMDsim\");\n    \/\/ fRailway->LoadLibrary(\"PWGLFforwardhit\");\n    \n    \/\/ --- Set load path ---------------------------------------------\n    gROOT->SetMacroPath(Form(\"%s:$(ALICE_ROOT)\/PWGLF\/FORWARD\/analysis2\",\n\t\t\t     gROOT->GetMacroPath()));\n\n    \/\/ --- Check if this is MC ---------------------------------------\n    if (!mgr->GetMCtruthEventHandler()) \n      Fatal(\"CreateTasks\", \"No MC truth handler\");\n    \n    Bool_t   useTuple  = fOptions.AsBool(\"use-tuple\");\n    UShort_t maxStrips = fOptions.AsInt(\"max-strips\");\n    Int_t    verbose   = fOptions.AsInt(\"verbose\");\n\n    TString args = TString::Format(\"%d,%d,%d\", \n\t\t\t\t   useTuple,\n\t\t\t\t   maxStrips, \n\t\t\t\t   verbose);\n    if (!CoupleCar(\"AddTaskFMDMCTracks.C\", args))\n      Fatal(\"CreateTasks\", \"Couldn't add our task\");\n  }\n  \/\/__________________________________________________________________\n  \/** \n   * Create physics selection , and add to manager\n   * \n   * @param mc Whether this is for MC \n   * @param mgr Manager \n   *\/\n  void CreatePhysicsSelection(Bool_t mc,\n\t\t\t      AliAnalysisManager* mgr)\n  {\n    TrainSetup::CreatePhysicsSelection(mc, mgr);\n\n    \/\/ --- Get input event handler -----------------------------------\n    AliInputEventHandler* ih =\n      dynamic_cast<AliInputEventHandler*>(mgr->GetInputEventHandler());\n    if (!ih) \n      Fatal(\"CreatePhysicsSelection\", \"Couldn't get input handler (%p)\", ih);\n    \n    \/\/ --- Get Physics selection -------------------------------------\n    AliPhysicsSelection* ps = \n      dynamic_cast<AliPhysicsSelection*>(ih->GetEventSelection());\n    if (!ps) \n      Fatal(\"CreatePhysicsSelection\", \"Couldn't get PhysicsSelection (%p)\", ps);\n\n    \/\/ --- Ignore trigger class when selecting events.  This means ---\n    \/\/ --- that we get offline+(A,C,E) events too --------------------\n    \/\/ ps->SetSkipTriggerClassSelection(true);\n  }\n  \/\/__________________________________________________________________\n  \/** \n   * @return 0 - AOD disabled \n   *\/\n  virtual AliVEventHandler* CreateOutputHandler(UShort_t) { return 0; }\n  \/** \n   * Do not the centrality selection\n   *\/\n  \/\/ void CreateCentralitySelection(Bool_t) {}\n  \/\/__________________________________________________________________\n  const char* ClassName() const { return \"MakeFMDMCTrackTrain\"; }\n\n  \/** \n   * Overloaded to create new dNdeta.C and dndeta.sh in the output \n   * directory\n   * \n   * @param asShellScript \n   *\/\n  void SaveSetup(Bool_t asShellScript)\n  {\n    TrainSetup::SaveSetup(asShellScript);\n    SaveSummarize();\n    SaveAnalyseNTuple();\n    SaveReFit();\n\n\n    if (!fRailway || fRailway->Mode() != Railway::kGrid) return;\n\n    SaveDownloadTrees();\n\n  }\n  \/** \n   * Write a ROOT script to draw summary \n   * \n   *\/\n  void SaveSummarize()\n  {\n    std::ofstream f(\"Summarize.C\");\n    if (!f) { \n      Error(\"SaveSummarize\", \"Failed to open Summarize.C script\");\n      return;\n    }\n    f << \"\/\/ Generated by \" << ClassName() << \"\\n\"\n      << \"\/\/ WHAT is a bit mask of\\n\"\n      << \"\/\/   0x001     Event inspector\\n\"\n      << \"\/\/   0x002     Track inspector\\n\"\n      << \"\/\/   0x004     Energy loss fits\\n\"\n      << \"\/\/   0x100     Landscape\\n\"\n      << \"\/\/   0x200     Pause\\n\"\n      << \"\/\/\\n\"\n      << \"void Summarize(const char* filename=\\\"forward_mctracks.root\\\",\\n\"\n      << \"               UShort_t what=0x10F)\\n\"\n      << \"{\\n\"\n      << \"  const char* fwd=\\\"$ALICE_ROOT\/PWGLF\/FORWARD\/analysis2\\\";\\n\"\n      << \"  gROOT->LoadMacro(Form(\\\"%s\/scripts\/SummaryMCTrackDrawer.C+g\\\",fwd));\\n\"\n      << \"  SummaryMCTrackDrawer smd;\\n\"\n      << \"  smd.Run(filename,what);\\n\"\n      << \"}\\n\"\n      << \"\/\/ EOF\" << std::endl;\n    f.close();\n  }\n  \/** \n   * Make a ROOT Script to download the generated AODs\n   * \n   *\/\n  void SaveDownloadTrees()\n  {\n    std::ofstream f(\"DownloadTrees.C\");\n    if (!f) { \n      Error(\"SaveDownloadTrees\", \"Failed to open DownloadTrees.C\");\n      return;\n    }\n    f << \"\/\/ Generated by \" << ClassName() << \"\\n\"\n      << \"void DownloadTrees(Bool_t force=false)\\n\"\n      << \"{\\n\"\n      << \"  if (!TGrid::Connect(\\\"alien:\/\/\\\")) {\\n\"\n      << \"    Error(\\\"DownloadTrees\\\",\\\"Failed to connect to AliEn\\\");\\n\"\n      << \"    return;\\n\"\n      << \"  }\\n\\n\"\n      << \"  TString dir(\\\"\" << fRailway->OutputPath() << \"\\\");\\n\"\n      << \"  TString pat(\\\"*\/forward_tuple.root\\\");\\n\"\n      << \"  TGridResult* r = gGrid->Query(dir,pat);\\n\"\n      << \"  if (!r) {\\n\"\n      << \"    Error(\\\"DownloadTrees\\\",\\\"No result from query\\\");\\n\"\n      << \"    return;\\n\"\n      << \"  }\\n\\n\"\n      << \"  Int_t n = r->GetEntries();\\n\"\n      << \"  Printf(\\\"=== Got a total of %d AOD files\\\",n);\\n\"\n      << \"  for (Int_t i = 0; i < n; i++) {\\n\"\n      << \"     TString path(r->GetKey(i, \\\"turl\\\"));\\n\"\n      << \"     TString dir(gSystem->DirName(path));\\n\"\n      << \"     TString sub(gSystem->BaseName(dir));\\n\"\n      << \"     TString subsub(gSystem->BaseName(gSystem->DirName(dir)));\\n\"\n      << \"     TString out = TString::Format(\\\"forward_tree_%s_%s.root\\\",\\n\"\n      << \"                                   subsub.Data(),sub.Data());\\n\"\n      << \"     if (!gSystem->AccessPathName(out.Data()) && !force) {\\n\"\n      << \"       Printf(\\\"=== Already have %s\\\",out.Data());\\n\"\n      << \"       continue;\\n\"\n      << \"     }\\n\"\n      << \"     Printf(\\\"=== Getting %s %s (%3d\/%3d)\\\",\\n\"\n      << \"            subsub.Data(),sub.Data(),i,n);\\n\"\n      << \"     if (!TFile::Cp(path, out)) {\\n\"\n      << \"       Warning(\\\"DownloadTrees\\\",\\\"Failed to copy %s -> %s\\\",\\n\"\n      << \"               path.Data(), out.Data());\\n\"\n      << \"       continue;\\n\"\n      << \"     }\\n\"\n      << \"   }\\n\"\n      << \"}\\n\"\n      << \"\/\/ EOF\\n\"\n      << std::endl;\n    f.close();\n  }   \n  \/** \n   * Make a ROOT Script to download the generated AODs\n   * \n   *\/\n  void SaveAnalyseNTuple()\n  {\n    std::ofstream f(\"AnalyseNTuple.C\");\n    if (!f) { \n      Error(\"SaveAnalyseNTuple\", \"Failed to open AnalyseNTuple.C\");\n      return;\n    }\n    f << \"\/\/ Generated by \" << ClassName() << \"\\n\"\n      << \"\/\/ Process with bare ROOT in ProofLite\\n\"\n      << \"void AnalyseNTuple(Bool_t proof=true,\\n\"\n      << \"                   Long64_t max=-1,\\n\"\n      << \"                   const char* opt=\\\"\\\")\\n\"\n      << \"{\\n\"\n      << \"  const char* fwd=\\\"$ALICE_ROOT\/PWGLF\/FORWARD\/analysis2\\\";\\n\"\n      << \"  gSystem->AddIncludePath(\\\"-I${ALICE_ROOT}\/include\\\");\\n\"\n      << \"  gROOT->Macro(Form(\\\"%s\/scripts\/LoadLibs.C\\\",fwd));\\n\"\n      << \"  gROOT->LoadMacro(Form(\\\"%s\/scripts\/TupleSelector.C+%s\\\",\\n\"\n      << \"                        fwd, opt));\\n\"\n      << \"  if (proof) TupleSelector::Proof(maxEvents, opt);\\n\"\n      << \"  else       TupleSelector::Run(maxEvents);\\n\"\n      << \"}\\n\"\n      << \"\/\/ EOF\" << std::endl;\n    f.close();\n  }\n  void SaveReFit()\n  {\n    std::ofstream f(\"ReFit.C\");\n    if (!f) { \n      Error(\"SaveRerun\", \"Failed to open ReFit.C script\");\n      return;\n    }\n    f << std::boolalpha \n      << \"\/\/ Generated by \" << ClassName() << \"\\n\"\n      << \"\/\/ If force=true, then force set parameters\\n\"\n      << \"\/\/\\n\"\n      << \"void ReFit(Bool_t      force=false,\\n\"\n      << \"           const char* filename=\\\"forward_mctracks.root\\\")\\n\"\n      << \"{\\n\"\n      << \"  const char* fwd=\\\"$ALICE_ROOT\/PWGLF\/FORWARD\/analysis2\\\";\\n\"\n      << \"  gROOT->LoadMacro(Form(\\\"%s\/corrs\/RerunTrackELoss.C\\\",fwd));\\n\"\n      << \"  RerunTrackELoss(force,filename);\\n\"\n      << \"}\\n\"\n      << \"\/\/ EOF\" << std::endl;\n    f.close();\n  }\n\n  void PostShellCode(std::ostream& f)\n  {\n    f << \"  echo \\\"=== Summarizing results ...\\\"\\n\"\n      << \"  aliroot -l -b -q ${prefix}Summarize.C\\n\"\n      << std::endl;\n  }\n\n};\n\n\/\/\n\/\/ EOF\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 <fcntl.h>\n#include <stdbool.h>\n#include <stdint.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <stdint.h>\n\n#include <string>\n#include <vector>\n\n#include <stout\/os.hpp>\n#include <stout\/try.hpp>\n\n#include \"linux\/ldcache.hpp\"\n\nusing std::string;\nusing std::vector;\n\n\/\/ There are two formats for ld.so.cache. The pre-glibc format 2.2\n\/\/ listed the number of library entries, followed by the entries\n\/\/ themselves, followed by a string table holding strings pointed\n\/\/ to by the library entries. This format is summarized below:\n\/\/\n\/\/      HEADER_MAGIC_OLD\n\/\/      nlibs\n\/\/      libs[0]\n\/\/      ...\n\/\/      libs[nlibs-1]\n\/\/      first string\\0second string\\0...last string\\0\n\/\/      ^                                           ^\n\/\/      start of string table     end of string table\n\/\/\n\/\/ For glibc 2.2 and beyond, a new format was created so that each\n\/\/ library entry could hold more meta-data about the libraries they\n\/\/ reference. To preserve backwards compatibility, the new format was\n\/\/ embedded in the old format inside its string table (simply moving\n\/\/ all existing strings further down in the string table). This makes\n\/\/ sense for backwards compatibility because code that could parse the\n\/\/ old format still works (the offsets for strings pointed to by\n\/\/ the library entries are just larger now).\n\/\/\n\/\/ However, it adds complications when parsing for the new format\n\/\/ because the new format header needs to be aligned on an 8 byte\n\/\/ boundary (potentially pushing the start address of the string table\n\/\/ down a few bytes). A summary of the new format embedded in the old\n\/\/ format with annotations on the start address of the string table\n\/\/ can be seen below:\n\/\/\n\/\/      HEADER_MAGIC_OLD\n\/\/      nlibs\n\/\/      libs[0]\n\/\/      ...\n\/\/      libs[nlibs-1]\n\/\/      pad (align for new format)\n\/\/      HEADER_MAGIC_NEW    <-- start of string table\n\/\/      nlibs\n\/\/      len_strings\n\/\/      unused    \/\/ 20 bytes reserved for extensions\n\/\/      libs[0]\n\/\/      ...\n\/\/      libs[nlibs-1]\n\/\/      first string\\0second string\\0...last string\\0\n\/\/                                                  ^\n\/\/                                end of string table\n\/\/\n\/\/ We currently only support the new format, since glibc 2.2\n\/\/ was released in late 2000.\n\nnamespace ldcache {\n\nconstexpr char HEADER_MAGIC_OLD[] = \"ld.so-1.7.0\";\nconstexpr char HEADER_MAGIC_NEW[] = \"glibc-ld.so.cache1.1\";\n\n#define IS_ELF  0x00000001\n\n\nstruct HeaderOld\n{\n  char magic[sizeof(HEADER_MAGIC_OLD) - 1];\n  uint32_t libraryCount; \/\/ Number of library entries.\n};\n\n\nstruct EntryOld\n{\n  int32_t flags;  \/\/ 0x01 indicates ELF library.\n  uint32_t key;   \/\/ String table index.\n  uint32_t value; \/\/ String table index.\n};\n\n\nstruct HeaderNew\n{\n  char magic[sizeof(HEADER_MAGIC_NEW) - 1];\n  uint32_t libraryCount;  \/\/ Number of library entries.\n  uint32_t stringsLength; \/\/ Length of \"actual\" string table.\n  uint32_t unused[5];     \/\/ Leave space for future extensions\n                          \/\/ and align to 8 byte boundary.\n};\n\n\nstruct EntryNew\n{\n  int16_t flags;        \/\/ Flags bits determine arch and library type.\n  uint32_t key;         \/\/ String table index.\n  uint32_t value;       \/\/ String table index.\n  uint32_t osVersion;   \/\/ Required OS version.\n  uint64_t hwcap;       \/\/ Hwcap entry.\n};\n\n\n\/\/ Returns a 'boundary' aligned pointer by rounding up to\n\/\/ the nearest multiple of 'boundary'.\nstatic inline const char* align(const char* address, size_t boundary)\n{\n  if ((size_t)address % boundary == 0) {\n    return address;\n  }\n  return (address + boundary) - ((size_t)address % boundary);\n}\n\n\nTry<vector<Entry>> parse(const string& path)\n{\n  \/\/ Read the complete file into a buffer\n  Try<string> buffer = os::read(path);\n  if (buffer.isError()) {\n    return Error(buffer.error());\n  }\n\n  const char* data = buffer->data();\n\n  \/\/ Grab a pointer to the old format header (for verification of\n  \/\/ HEADER_MAGIC_OLD later on). Then jump forward to the location of\n  \/\/ the new format header (it is the only format we support).\n  HeaderOld* headerOld = (HeaderOld*)data;\n  data += sizeof(HeaderOld);\n  if (data >= buffer->data() + buffer->size()) {\n    return Error(\"Invalid format\");\n  }\n\n  data += headerOld->libraryCount * sizeof(EntryOld);\n  if (data >= buffer->data() + buffer->size()) {\n    return Error(\"Invalid format\");\n  }\n\n  \/\/ The new format header and all of its library entries are embedded\n  \/\/ in the old format's string table (the current location of data).\n  \/\/ However, the header is aligned on an 8 byte boundary, so we\n  \/\/ need to align 'data' to get it to point to the new header.\n  data = align(data, alignof(HeaderNew));\n  if (data >= buffer->data() + buffer->size()) {\n    return Error(\"Invalid format\");\n  }\n\n  \/\/ Construct pointers to all of the important regions in the new\n  \/\/ format: the header, the libentry array, and the new string table\n  \/\/ (which starts at the same address as the aligned headerNew pointer).\n  HeaderNew* headerNew = (HeaderNew*)data;\n  data += sizeof(HeaderNew);\n  if (data >= buffer->data() + buffer->size()) {\n    return Error(\"Invalid format\");\n  }\n\n  EntryNew* entriesNew = (EntryNew*)data;\n  data += headerNew->libraryCount * sizeof(EntryNew);\n  if (data >= buffer->data() + buffer->size()) {\n    return Error(\"Invalid format\");\n  }\n\n  \/\/ The start of the strings table is at the beginning of\n  \/\/ the new header, per the above format description.\n  char* strings = (char*)headerNew;\n\n  \/\/ Adjust the pointer to add on the additional size of the strings\n  \/\/ contained in the string table. At this point, 'data' should\n  \/\/ point to an address just beyond the end of the file.\n  data += headerNew->stringsLength;\n  if ((size_t)(data - buffer->data()) != buffer->size()) {\n    return Error(\"Invalid format\");\n  }\n\n  \/\/ Validate our header magic.\n  if (strncmp(headerOld->magic,\n        HEADER_MAGIC_OLD,\n        sizeof(HEADER_MAGIC_OLD) - 1) != 0) {\n    return Error(\"Invalid format\");\n  }\n\n  if (strncmp(headerNew->magic,\n        HEADER_MAGIC_NEW,\n        sizeof(HEADER_MAGIC_NEW) - 1) != 0) {\n    return Error(\"Invalid format\");\n  }\n\n  \/\/ Make sure the very last character in the buffer is a '\\0'.\n  \/\/ This way, no matter what strings we index in the string\n  \/\/ table, we know they will never run beyond the end of the\n  \/\/ file buffer when extracting them.\n  if (*(data - 1) != '\\0') {\n    return Error(\"Invalid format\");\n  }\n\n  \/\/ Build our vector of ldcache entries.\n  vector<Entry> ldcache;\n  for (uint32_t i = 0; i < headerNew->libraryCount; i++) {\n    if (!(entriesNew[i].flags & IS_ELF)) {\n      continue;\n    }\n\n    if (strings + entriesNew[i].key >= data) {\n      return Error(\"Invalid format\");\n    }\n\n    if (strings + entriesNew[i].value >= data) {\n      return Error(\"Invalid format\");\n    }\n\n    Entry entry;\n    entry.name = &strings[entriesNew[i].key];\n    entry.path = &strings[entriesNew[i].value];\n    ldcache.push_back(entry);\n  }\n\n  return ldcache;\n}\n\n} \/\/ namespace ldcache {\n<commit_msg>Updated ldcache flags to 32bit width.<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 <fcntl.h>\n#include <stdbool.h>\n#include <stdint.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <stdint.h>\n\n#include <string>\n#include <vector>\n\n#include <stout\/os.hpp>\n#include <stout\/try.hpp>\n\n#include \"linux\/ldcache.hpp\"\n\nusing std::string;\nusing std::vector;\n\n\/\/ There are two formats for ld.so.cache. The pre-glibc format 2.2\n\/\/ listed the number of library entries, followed by the entries\n\/\/ themselves, followed by a string table holding strings pointed\n\/\/ to by the library entries. This format is summarized below:\n\/\/\n\/\/      HEADER_MAGIC_OLD\n\/\/      nlibs\n\/\/      libs[0]\n\/\/      ...\n\/\/      libs[nlibs-1]\n\/\/      first string\\0second string\\0...last string\\0\n\/\/      ^                                           ^\n\/\/      start of string table     end of string table\n\/\/\n\/\/ For glibc 2.2 and beyond, a new format was created so that each\n\/\/ library entry could hold more meta-data about the libraries they\n\/\/ reference. To preserve backwards compatibility, the new format was\n\/\/ embedded in the old format inside its string table (simply moving\n\/\/ all existing strings further down in the string table). This makes\n\/\/ sense for backwards compatibility because code that could parse the\n\/\/ old format still works (the offsets for strings pointed to by\n\/\/ the library entries are just larger now).\n\/\/\n\/\/ However, it adds complications when parsing for the new format\n\/\/ because the new format header needs to be aligned on an 8 byte\n\/\/ boundary (potentially pushing the start address of the string table\n\/\/ down a few bytes). A summary of the new format embedded in the old\n\/\/ format with annotations on the start address of the string table\n\/\/ can be seen below:\n\/\/\n\/\/      HEADER_MAGIC_OLD\n\/\/      nlibs\n\/\/      libs[0]\n\/\/      ...\n\/\/      libs[nlibs-1]\n\/\/      pad (align for new format)\n\/\/      HEADER_MAGIC_NEW    <-- start of string table\n\/\/      nlibs\n\/\/      len_strings\n\/\/      unused    \/\/ 20 bytes reserved for extensions\n\/\/      libs[0]\n\/\/      ...\n\/\/      libs[nlibs-1]\n\/\/      first string\\0second string\\0...last string\\0\n\/\/                                                  ^\n\/\/                                end of string table\n\/\/\n\/\/ We currently only support the new format, since glibc 2.2\n\/\/ was released in late 2000.\n\nnamespace ldcache {\n\nconstexpr char HEADER_MAGIC_OLD[] = \"ld.so-1.7.0\";\nconstexpr char HEADER_MAGIC_NEW[] = \"glibc-ld.so.cache1.1\";\n\n#define IS_ELF  0x00000001\n\n\nstruct HeaderOld\n{\n  char magic[sizeof(HEADER_MAGIC_OLD) - 1];\n  uint32_t libraryCount; \/\/ Number of library entries.\n};\n\n\nstruct EntryOld\n{\n  int32_t flags;  \/\/ 0x01 indicates ELF library.\n  uint32_t key;   \/\/ String table index.\n  uint32_t value; \/\/ String table index.\n};\n\n\nstruct HeaderNew\n{\n  char magic[sizeof(HEADER_MAGIC_NEW) - 1];\n  uint32_t libraryCount;  \/\/ Number of library entries.\n  uint32_t stringsLength; \/\/ Length of \"actual\" string table.\n  uint32_t unused[5];     \/\/ Leave space for future extensions\n                          \/\/ and align to 8 byte boundary.\n};\n\n\nstruct EntryNew\n{\n  int32_t flags;        \/\/ Flags bits determine arch and library type.\n  uint32_t key;         \/\/ String table index.\n  uint32_t value;       \/\/ String table index.\n  uint32_t osVersion;   \/\/ Required OS version.\n  uint64_t hwcap;       \/\/ Hwcap entry.\n};\n\n\n\/\/ Returns a 'boundary' aligned pointer by rounding up to\n\/\/ the nearest multiple of 'boundary'.\nstatic inline const char* align(const char* address, size_t boundary)\n{\n  if ((size_t)address % boundary == 0) {\n    return address;\n  }\n  return (address + boundary) - ((size_t)address % boundary);\n}\n\n\nTry<vector<Entry>> parse(const string& path)\n{\n  \/\/ Read the complete file into a buffer\n  Try<string> buffer = os::read(path);\n  if (buffer.isError()) {\n    return Error(buffer.error());\n  }\n\n  const char* data = buffer->data();\n\n  \/\/ Grab a pointer to the old format header (for verification of\n  \/\/ HEADER_MAGIC_OLD later on). Then jump forward to the location of\n  \/\/ the new format header (it is the only format we support).\n  HeaderOld* headerOld = (HeaderOld*)data;\n  data += sizeof(HeaderOld);\n  if (data >= buffer->data() + buffer->size()) {\n    return Error(\"Invalid format\");\n  }\n\n  data += headerOld->libraryCount * sizeof(EntryOld);\n  if (data >= buffer->data() + buffer->size()) {\n    return Error(\"Invalid format\");\n  }\n\n  \/\/ The new format header and all of its library entries are embedded\n  \/\/ in the old format's string table (the current location of data).\n  \/\/ However, the header is aligned on an 8 byte boundary, so we\n  \/\/ need to align 'data' to get it to point to the new header.\n  data = align(data, alignof(HeaderNew));\n  if (data >= buffer->data() + buffer->size()) {\n    return Error(\"Invalid format\");\n  }\n\n  \/\/ Construct pointers to all of the important regions in the new\n  \/\/ format: the header, the libentry array, and the new string table\n  \/\/ (which starts at the same address as the aligned headerNew pointer).\n  HeaderNew* headerNew = (HeaderNew*)data;\n  data += sizeof(HeaderNew);\n  if (data >= buffer->data() + buffer->size()) {\n    return Error(\"Invalid format\");\n  }\n\n  EntryNew* entriesNew = (EntryNew*)data;\n  data += headerNew->libraryCount * sizeof(EntryNew);\n  if (data >= buffer->data() + buffer->size()) {\n    return Error(\"Invalid format\");\n  }\n\n  \/\/ The start of the strings table is at the beginning of\n  \/\/ the new header, per the above format description.\n  char* strings = (char*)headerNew;\n\n  \/\/ Adjust the pointer to add on the additional size of the strings\n  \/\/ contained in the string table. At this point, 'data' should\n  \/\/ point to an address just beyond the end of the file.\n  data += headerNew->stringsLength;\n  if ((size_t)(data - buffer->data()) != buffer->size()) {\n    return Error(\"Invalid format\");\n  }\n\n  \/\/ Validate our header magic.\n  if (strncmp(headerOld->magic,\n        HEADER_MAGIC_OLD,\n        sizeof(HEADER_MAGIC_OLD) - 1) != 0) {\n    return Error(\"Invalid format\");\n  }\n\n  if (strncmp(headerNew->magic,\n        HEADER_MAGIC_NEW,\n        sizeof(HEADER_MAGIC_NEW) - 1) != 0) {\n    return Error(\"Invalid format\");\n  }\n\n  \/\/ Make sure the very last character in the buffer is a '\\0'.\n  \/\/ This way, no matter what strings we index in the string\n  \/\/ table, we know they will never run beyond the end of the\n  \/\/ file buffer when extracting them.\n  if (*(data - 1) != '\\0') {\n    return Error(\"Invalid format\");\n  }\n\n  \/\/ Build our vector of ldcache entries.\n  vector<Entry> ldcache;\n  for (uint32_t i = 0; i < headerNew->libraryCount; i++) {\n    if (!(entriesNew[i].flags & IS_ELF)) {\n      continue;\n    }\n\n    if (strings + entriesNew[i].key >= data) {\n      return Error(\"Invalid format\");\n    }\n\n    if (strings + entriesNew[i].value >= data) {\n      return Error(\"Invalid format\");\n    }\n\n    Entry entry;\n    entry.name = &strings[entriesNew[i].key];\n    entry.path = &strings[entriesNew[i].value];\n    ldcache.push_back(entry);\n  }\n\n  return ldcache;\n}\n\n} \/\/ namespace ldcache {\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n    SDL_BitmapFont.cpp\n\n  SDL-based Bitmap Font Rendering API\n\n  Copyright (c) 2013 Jeffrey Carpenter\n  All rights reserved.\n\n  Portions Copyright Lazy Foo' Productions 2004-2013\n  All rights reserved.\n\n  1. http:\/\/lazyfoo.net\/SDL_tutorials\/lesson30\/index.php\n\n******************************************************************************\/\n#include \"SDL_BitmapFont.h\"\n\nusing namespace nom;\n\nSDL_BitmapFont::SDL_BitmapFont ( void )\n{\n  #ifdef DEBUG_BITMAP_FONT_OBJ\n    std::cout << \"SDL_BitmapFont::SDL_BitmapFont (): \" << \"Hello, world!\" << \"\\n\" << std::endl;\n  #endif\n\n  this->text_buffer = \"\\0\";\n  this->newline = 0; \/\/ holds the y coords value to increment upon newline break char\n  this->spacing = 0; \/\/ holds the x coords value to increment upon space char\n  this->text_style = Style::Regular; \/\/ default text styling effect\n\n  this->coords.setCoords ( 0, 0, 0, 0 );\n\n  for ( unsigned int idx = 0; idx < 256; idx++ )\n  {\n    this->chars[idx].setCoords ( 0, 0, 0, 0 );\n  }\n}\n\nSDL_BitmapFont::~SDL_BitmapFont ( void )\n{\n  #ifdef DEBUG_BITMAP_FONT_OBJ\n    std::cout << \"SDL_BitmapFont::~SDL_BitmapFont (): \" << \"Goodbye cruel world!\" << \"\\n\" << std::endl;\n  #endif\n}\n\nint32_t SDL_BitmapFont::getTextWidth ( void )\n{\n  int32_t text_width = 0;\n\n  if ( this->bitmap_font.get() != nullptr )\n  {\n    for ( int t = 0; t < this->text_buffer.length(); t++ )\n    {\n      if ( this->text_buffer[t] == ' ' )\n        text_width += this->chars[t].getWidth() \/ this->spacing;\n      else if ( this->text_buffer[t] == '\\n' )\n        text_width = 0;\n      else\n        text_width += this->chars[t].getWidth() - ( this->spacing + 2 );\n    }\n  }\n\n  return text_width;\n}\n\nint32_t SDL_BitmapFont::getTextHeight ( void )\n{\n  int32_t text_height = 0;\n\n  for ( int t = 0; t < this->text_buffer.length(); t++ )\n  {\n    if ( this->text_buffer[t] == '\\n' )\n      text_height += this->newline;\n    else\n      text_height = this->chars[t].getHeight();\n  }\n\n  return text_height;\n}\n\nconst std::string& SDL_BitmapFont::getText ( void ) const\n{\n  return this->text_buffer;\n}\n\nvoid SDL_BitmapFont::setText ( const std::string& text )\n{\n  this->text_buffer = text;\n}\n\nuint32_t SDL_BitmapFont::getSpacing ( void )\n{\n  return this->spacing;\n}\n\nvoid SDL_BitmapFont::setSpacing ( uint32_t spaces )\n{\n  this->spacing = spaces;\n}\n\nuint32_t SDL_BitmapFont::getNewline ( void )\n{\n  return this->newline;\n}\n\nvoid SDL_BitmapFont::setNewline ( uint32_t newline )\n{\n  this->newline = newline;\n}\n\nuint8_t nom::SDL_BitmapFont::getStyle ( void ) const\n{\n  return this->text_style;\n}\n\nvoid SDL_BitmapFont::setStyle ( uint8_t style, uint8_t options )\n{\n  switch ( style )\n  {\n    default:\n    break;\n    case Style::Regular:\n    case Style::Bold:\n    case Style::Italic:\n    case Style::Underlined:\n      \/\/ Do nothing stub\n    break;\n\n    \/\/\/ Text effect utilizing alpha channels for the appearance of gray text\n    case Style::Faded:\n    {\n      if ( this->bitmap_font.get() != nullptr )\n        if ( this->bitmap_font.setAlpha ( static_cast<SDL_Surface*> ( this->bitmap_font.get() ), options ) == true )\n          this->text_style = Style::Faded;\n    break;\n    }\n  }\n}\n\nbool SDL_BitmapFont::Load ( const std::string& filename, const nom::Color& colorkey, uint32_t sheet_width, uint32_t sheet_height )\n{\n  uint32_t tile_width = 0;\n  uint32_t tile_height = 0;\n  uint32_t top = 0;\n  uint32_t baseA = 0;\n  uint32_t currentChar = 0;\n  int32_t background_color = 0;\n\n  this->bitmap_font.loadImageFromFile ( filename, colorkey );\n\n  if ( this->bitmap_font.get() == nullptr )\n  {\n    #ifdef DEBUG_BITMAP_FONT\n      std::cout << \"ERR in SDL_BitmapFont::LoadImage() at Gfx::LoadImage(): \" << std::endl;\n    #endif\n    return false;\n  }\n\n  background_color = colorkey.getColorAsInt ( this->bitmap_font.getCanvasPixelsFormat() );\n\n  tile_width = this->bitmap_font.getCanvasWidth() \/ sheet_width;\n  tile_height = this->bitmap_font.getCanvasHeight() \/ sheet_height;\n  top = tile_height;\n  baseA = tile_height;\n\n  for ( uint32_t rows = 0; rows < sheet_width; rows++ )\n  {\n    for ( uint32_t cols = 0; cols < sheet_height; cols++ )\n    {\n      \/\/ Set character offsets\n      this->chars[ currentChar ].setXY ( tile_width * cols, tile_height * rows );\n      this->chars[ currentChar ].setDimensions ( tile_width, tile_height );\n\n      \/\/Find Left Side; go through pixel columns\n      for ( uint32_t pCol = 0; pCol < tile_width; pCol++ )\n      {\n        \/\/Go through pixel rows\n        for ( uint32_t pRow = 0; pRow < tile_height; pRow++ )\n        {\n          \/\/Get the pixel offsets\n          int pX = ( tile_width * cols ) + pCol;\n          int pY = ( tile_height * rows ) + pRow;\n\n          \/\/If a non colorkey pixel is found\n          if( Gfx::getPixel ( this->bitmap_font.get(), pX, pY ) != background_color )\n          {\n              \/\/Set the x offset\n              this->chars[ currentChar ].setX ( pX );\n\n              \/\/Break the loops\n              pCol = tile_width;\n              pRow = tile_height;\n          }\n        }\n      }\n\n      \/\/Find Right Side; go through pixel columns\n      for ( int32_t pCol_w = tile_width - 1; pCol_w >= 0; pCol_w-- )\n      {\n        \/\/Go through pixel rows\n        for ( int32_t pRow_w = 0; pRow_w < tile_height; pRow_w++ )\n        {\n          \/\/Get the pixel offsets\n          uint32_t pX = ( tile_width * cols ) + pCol_w;\n          uint32_t pY = ( tile_height * rows ) + pRow_w;\n\n          \/\/If a non colorkey pixel is found\n          if ( Gfx::getPixel ( this->bitmap_font.get(), pX, pY ) != background_color )\n          {\n            \/\/Set the width\n            uint32_t width = ( pX - this->chars[ currentChar ].getX() ) + 1;\n            this->chars[ currentChar ].setWidth ( width );\n\n            \/\/Break the loops\n            pCol_w = -1;\n            pRow_w = tile_height;\n          }\n        }\n      }\n\n      \/\/Find Top; go through pixel rows\n      for ( int32_t pRow = 0; pRow < tile_height; pRow++ )\n      {\n        \/\/Go through pixel columns\n        for ( int32_t pCol = 0; pCol < tile_width; pCol++ )\n        {\n          \/\/Get the pixel offsets\n          uint32_t pX = ( tile_width * cols ) + pCol;\n          uint32_t pY = ( tile_height * rows ) + pRow;\n\n          \/\/ If a non colorkey pixel is found\n          if( Gfx::getPixel ( this->bitmap_font.get(), pX, pY ) != background_color )\n          {\n            \/\/ If new top is found\n            if ( pRow < top )\n            {\n              top = pRow;\n            }\n\n            \/\/ Break the loops\n            pCol = tile_width;\n            pRow = tile_height;\n          }\n        }\n      }\n\n      \/\/ FIXME: I don't think this does anything for us\n      \/\/ Find Bottom of A\n      if ( currentChar == 'A' )\n      {\n        \/\/ Go through pixel rows\n        for ( int32_t pRow = tile_height - 1; pRow >= 0; pRow-- )\n        {\n          \/\/ Go through pixel columns\n          for ( int32_t pCol = 0; pCol < tile_width; pCol++ )\n          {\n            \/\/ Get the pixel offsets\n            unsigned int pX = ( tile_width * cols ) + pCol;\n            unsigned int pY = ( tile_height * rows ) + pRow;\n\n            \/\/ If a non colorkey pixel is found\n            if ( Gfx::getPixel ( this->bitmap_font.get(), pX, pY ) != background_color )\n            {\n              \/\/ Bottom of a is found\n              baseA = pRow;\n\n              \/\/Break the loops\n              pCol = tile_width;\n              pRow = -1;\n            }\n          }\n        }\n      }\n\n      \/\/ Go to the next character\n      currentChar++;\n    }\n  }\n\n  \/\/ Checks to see if we have modified the instance variable before calling this\n  \/\/ method\n  if ( this->spacing == 0 )\n  {\n    \/\/ Calculate space\n    this->spacing = tile_width \/ 2;\n  }\n\n  \/\/ Calculate new line\n  this->newline = baseA - top;\n\n  \/\/ Loop off excess top pixels\n  for ( uint32_t t = 0; t < 256; t++ )\n  {\n    int32_t y = this->chars[ t ].getY();\n    int32_t height = this->chars[ t ].getHeight();\n\n    this->chars[ t ].setY ( y += top );\n    this->chars[ t ].setHeight ( height -= top );\n  }\n\n  return true;\n}\n\nvoid SDL_BitmapFont::Draw ( void* video_buffer )\n{\n  \/\/ Use coordinates provided by interface user as our starting origin\n  \/\/ coordinates to compute from\n  int32_t x_offset = this->coords.getX();\n  int32_t y_offset = this->coords.getY();\n\n  \/\/If the font has been built\n  if ( this->bitmap_font.get() != nullptr )\n  {\n    for ( uint32_t show = 0; show < this->text_buffer.length(); show++ )\n    {\n      \/\/If the current character is a space\n      if ( this->text_buffer[show] == ' ' )\n      {\n        \/\/Move over\n        x_offset += this->spacing;\n      }\n      \/\/ If the current character is a newline\n      else if( this->text_buffer[show] == '\\n' )\n      {\n        \/\/Move down and back over to the beginning of line\n        y_offset += this->newline;\n        x_offset = this->coords.getX();\n      }\n      else\n      {\n        \/\/Get the ASCII value of the character\n        uint32_t ascii = ( u_char ) this->text_buffer[show];\n\n        this->bitmap_font.setPosition ( nom::Coords ( x_offset, y_offset ) );\n        this->bitmap_font.setOffsets ( this->chars[ascii] );\n        this->bitmap_font.Draw ( video_buffer );\n\n        \/\/ Move over the width of the character with one pixel of padding\n        x_offset += ( this->chars[ascii].getWidth() ) + 1;\n      } \/\/ end else\n    } \/\/ end for loop\n  } \/\/ end if this->bitmap_font != nullptr\n}\n<commit_msg>Added checking case for \\t carriage character<commit_after>\/******************************************************************************\n    SDL_BitmapFont.cpp\n\n  SDL-based Bitmap Font Rendering API\n\n  Copyright (c) 2013 Jeffrey Carpenter\n  All rights reserved.\n\n  Portions Copyright Lazy Foo' Productions 2004-2013\n  All rights reserved.\n\n  1. http:\/\/lazyfoo.net\/SDL_tutorials\/lesson30\/index.php\n\n******************************************************************************\/\n#include \"SDL_BitmapFont.h\"\n\nusing namespace nom;\n\nSDL_BitmapFont::SDL_BitmapFont ( void )\n{\n  #ifdef DEBUG_BITMAP_FONT_OBJ\n    std::cout << \"SDL_BitmapFont::SDL_BitmapFont (): \" << \"Hello, world!\" << \"\\n\" << std::endl;\n  #endif\n\n  this->text_buffer = \"\\0\";\n  this->newline = 0; \/\/ holds the y coords value to increment upon newline break char\n  this->spacing = 0; \/\/ holds the x coords value to increment upon space char\n  this->text_style = Style::Regular; \/\/ default text styling effect\n\n  this->coords.setCoords ( 0, 0, 0, 0 );\n\n  for ( unsigned int idx = 0; idx < 256; idx++ )\n  {\n    this->chars[idx].setCoords ( 0, 0, 0, 0 );\n  }\n}\n\nSDL_BitmapFont::~SDL_BitmapFont ( void )\n{\n  #ifdef DEBUG_BITMAP_FONT_OBJ\n    std::cout << \"SDL_BitmapFont::~SDL_BitmapFont (): \" << \"Goodbye cruel world!\" << \"\\n\" << std::endl;\n  #endif\n}\n\nint32_t SDL_BitmapFont::getTextWidth ( void )\n{\n  int32_t text_width = 0;\n\n  if ( this->bitmap_font.get() != nullptr )\n  {\n    for ( int t = 0; t < this->text_buffer.length(); t++ )\n    {\n      if ( this->text_buffer[t] == ' ' )\n        text_width += this->chars[t].getWidth() \/ this->spacing;\n      else if ( this->text_buffer[t] == '\\n' )\n        text_width = 0;\n      else\n        text_width += this->chars[t].getWidth() - ( this->spacing + 2 );\n    }\n  }\n\n  return text_width;\n}\n\nint32_t SDL_BitmapFont::getTextHeight ( void )\n{\n  int32_t text_height = 0;\n\n  for ( int t = 0; t < this->text_buffer.length(); t++ )\n  {\n    if ( this->text_buffer[t] == '\\n' )\n      text_height += this->newline;\n    else\n      text_height = this->chars[t].getHeight();\n  }\n\n  return text_height;\n}\n\nconst std::string& SDL_BitmapFont::getText ( void ) const\n{\n  return this->text_buffer;\n}\n\nvoid SDL_BitmapFont::setText ( const std::string& text )\n{\n  this->text_buffer = text;\n}\n\nuint32_t SDL_BitmapFont::getSpacing ( void )\n{\n  return this->spacing;\n}\n\nvoid SDL_BitmapFont::setSpacing ( uint32_t spaces )\n{\n  this->spacing = spaces;\n}\n\nuint32_t SDL_BitmapFont::getNewline ( void )\n{\n  return this->newline;\n}\n\nvoid SDL_BitmapFont::setNewline ( uint32_t newline )\n{\n  this->newline = newline;\n}\n\nuint8_t nom::SDL_BitmapFont::getStyle ( void ) const\n{\n  return this->text_style;\n}\n\nvoid SDL_BitmapFont::setStyle ( uint8_t style, uint8_t options )\n{\n  switch ( style )\n  {\n    default:\n    break;\n    case Style::Regular:\n    case Style::Bold:\n    case Style::Italic:\n    case Style::Underlined:\n      \/\/ Do nothing stub\n    break;\n\n    \/\/\/ Text effect utilizing alpha channels for the appearance of gray text\n    case Style::Faded:\n    {\n      if ( this->bitmap_font.get() != nullptr )\n        if ( this->bitmap_font.setAlpha ( static_cast<SDL_Surface*> ( this->bitmap_font.get() ), options ) == true )\n          this->text_style = Style::Faded;\n    break;\n    }\n  }\n}\n\nbool SDL_BitmapFont::Load ( const std::string& filename, const nom::Color& colorkey, uint32_t sheet_width, uint32_t sheet_height )\n{\n  uint32_t tile_width = 0;\n  uint32_t tile_height = 0;\n  uint32_t top = 0;\n  uint32_t baseA = 0;\n  uint32_t currentChar = 0;\n  int32_t background_color = 0;\n\n  this->bitmap_font.loadImageFromFile ( filename, colorkey );\n\n  if ( this->bitmap_font.get() == nullptr )\n  {\n    #ifdef DEBUG_BITMAP_FONT\n      std::cout << \"ERR in SDL_BitmapFont::LoadImage() at Gfx::LoadImage(): \" << std::endl;\n    #endif\n    return false;\n  }\n\n  background_color = colorkey.getColorAsInt ( this->bitmap_font.getCanvasPixelsFormat() );\n\n  tile_width = this->bitmap_font.getCanvasWidth() \/ sheet_width;\n  tile_height = this->bitmap_font.getCanvasHeight() \/ sheet_height;\n  top = tile_height;\n  baseA = tile_height;\n\n  for ( uint32_t rows = 0; rows < sheet_width; rows++ )\n  {\n    for ( uint32_t cols = 0; cols < sheet_height; cols++ )\n    {\n      \/\/ Set character offsets\n      this->chars[ currentChar ].setXY ( tile_width * cols, tile_height * rows );\n      this->chars[ currentChar ].setDimensions ( tile_width, tile_height );\n\n      \/\/Find Left Side; go through pixel columns\n      for ( uint32_t pCol = 0; pCol < tile_width; pCol++ )\n      {\n        \/\/Go through pixel rows\n        for ( uint32_t pRow = 0; pRow < tile_height; pRow++ )\n        {\n          \/\/Get the pixel offsets\n          int pX = ( tile_width * cols ) + pCol;\n          int pY = ( tile_height * rows ) + pRow;\n\n          \/\/If a non colorkey pixel is found\n          if( Gfx::getPixel ( this->bitmap_font.get(), pX, pY ) != background_color )\n          {\n              \/\/Set the x offset\n              this->chars[ currentChar ].setX ( pX );\n\n              \/\/Break the loops\n              pCol = tile_width;\n              pRow = tile_height;\n          }\n        }\n      }\n\n      \/\/Find Right Side; go through pixel columns\n      for ( int32_t pCol_w = tile_width - 1; pCol_w >= 0; pCol_w-- )\n      {\n        \/\/Go through pixel rows\n        for ( int32_t pRow_w = 0; pRow_w < tile_height; pRow_w++ )\n        {\n          \/\/Get the pixel offsets\n          uint32_t pX = ( tile_width * cols ) + pCol_w;\n          uint32_t pY = ( tile_height * rows ) + pRow_w;\n\n          \/\/If a non colorkey pixel is found\n          if ( Gfx::getPixel ( this->bitmap_font.get(), pX, pY ) != background_color )\n          {\n            \/\/Set the width\n            uint32_t width = ( pX - this->chars[ currentChar ].getX() ) + 1;\n            this->chars[ currentChar ].setWidth ( width );\n\n            \/\/Break the loops\n            pCol_w = -1;\n            pRow_w = tile_height;\n          }\n        }\n      }\n\n      \/\/Find Top; go through pixel rows\n      for ( int32_t pRow = 0; pRow < tile_height; pRow++ )\n      {\n        \/\/Go through pixel columns\n        for ( int32_t pCol = 0; pCol < tile_width; pCol++ )\n        {\n          \/\/Get the pixel offsets\n          uint32_t pX = ( tile_width * cols ) + pCol;\n          uint32_t pY = ( tile_height * rows ) + pRow;\n\n          \/\/ If a non colorkey pixel is found\n          if( Gfx::getPixel ( this->bitmap_font.get(), pX, pY ) != background_color )\n          {\n            \/\/ If new top is found\n            if ( pRow < top )\n            {\n              top = pRow;\n            }\n\n            \/\/ Break the loops\n            pCol = tile_width;\n            pRow = tile_height;\n          }\n        }\n      }\n\n      \/\/ FIXME: I don't think this does anything for us\n      \/\/ Find Bottom of A\n      if ( currentChar == 'A' )\n      {\n        \/\/ Go through pixel rows\n        for ( int32_t pRow = tile_height - 1; pRow >= 0; pRow-- )\n        {\n          \/\/ Go through pixel columns\n          for ( int32_t pCol = 0; pCol < tile_width; pCol++ )\n          {\n            \/\/ Get the pixel offsets\n            unsigned int pX = ( tile_width * cols ) + pCol;\n            unsigned int pY = ( tile_height * rows ) + pRow;\n\n            \/\/ If a non colorkey pixel is found\n            if ( Gfx::getPixel ( this->bitmap_font.get(), pX, pY ) != background_color )\n            {\n              \/\/ Bottom of a is found\n              baseA = pRow;\n\n              \/\/Break the loops\n              pCol = tile_width;\n              pRow = -1;\n            }\n          }\n        }\n      }\n\n      \/\/ Go to the next character\n      currentChar++;\n    }\n  }\n\n  \/\/ Checks to see if we have modified the instance variable before calling this\n  \/\/ method\n  if ( this->spacing == 0 )\n  {\n    \/\/ Calculate space\n    this->spacing = tile_width \/ 2;\n  }\n\n  \/\/ Calculate new line\n  this->newline = baseA - top;\n\n  \/\/ Loop off excess top pixels\n  for ( uint32_t t = 0; t < 256; t++ )\n  {\n    int32_t y = this->chars[ t ].getY();\n    int32_t height = this->chars[ t ].getHeight();\n\n    this->chars[ t ].setY ( y += top );\n    this->chars[ t ].setHeight ( height -= top );\n  }\n\n  return true;\n}\n\nvoid SDL_BitmapFont::Draw ( void* video_buffer )\n{\n  \/\/ Use coordinates provided by interface user as our starting origin\n  \/\/ coordinates to compute from\n  int32_t x_offset = this->coords.getX();\n  int32_t y_offset = this->coords.getY();\n\n  \/\/If the font has been built\n  if ( this->bitmap_font.get() != nullptr )\n  {\n    for ( uint32_t show = 0; show < this->text_buffer.length(); show++ )\n    {\n      \/\/If the current character is a space\n      if ( this->text_buffer[show] == ' ' )\n      {\n        \/\/Move over\n        x_offset += this->spacing;\n      }\n      \/\/ If the current character is a newline\n      else if( this->text_buffer[show] == '\\n' )\n      {\n        \/\/Move down and back over to the beginning of line\n        y_offset += this->newline;\n        x_offset = this->coords.getX();\n      }\n      \/\/ If the current character is a newline\n      else if( this->text_buffer[show] == '\\t' )\n      {\n        x_offset += this->spacing * 4;\n      }\n      else\n      {\n        \/\/Get the ASCII value of the character\n        uint32_t ascii = ( u_char ) this->text_buffer[show];\n\n        this->bitmap_font.setPosition ( nom::Coords ( x_offset, y_offset ) );\n        this->bitmap_font.setOffsets ( this->chars[ascii] );\n        this->bitmap_font.Draw ( video_buffer );\n\n        \/\/ Move over the width of the character with one pixel of padding\n        x_offset += ( this->chars[ascii].getWidth() ) + 1;\n      } \/\/ end else\n    } \/\/ end for loop\n  } \/\/ end if this->bitmap_font != nullptr\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifdef __CLING__\r\nR__ADD_INCLUDE_PATH($ALICE_PHYSICS)\r\n#include <PWGLF\/RESONANCES\/macros\/mini\/ConfigPhiPP13TeV_PID.C>\r\n#endif\r\n\/***************************************************************************\r\n              Anders Knospe\r\n\r\n\/\/Launches phi analysis with rsn mini package\r\n\/\/Allows basic configuration of pile-up check and event cuts\r\n****************************************************************************\/\r\n\r\n\/*\r\n#include \"AliRsnMiniAnalysisTask.h\"\r\n#include \"AliRsnMiniValue.h\"\r\n#include \"AliRsnCutPrimaryVertex.h\"\r\n#include \"AliRsnCutEventUtils.h\"\r\n#include \"AliRsnMiniPair.h\"\r\n#include \"AliRsnCutMiniPair.h\"\r\n#include \"AliRsnMiniOutput.h\"\r\n#include \".\/ConfigPhiPP13TeV_PID.C\"\r\n *\/\r\n\r\nenum pairYCutSet { kPairDefault=0,\r\n\t\t   kCentral \/\/=1\r\n                 };\r\n\r\nenum eventCutSet { kEvtDefault=0,\r\n\t\t   kNoPileUpCut, \/\/=1\r\n\t\t   kDefaultVtx12,\/\/=2\r\n\t\t   kDefaultVtx8, \/\/=3\r\n\t\t   kDefaultVtx5, \/\/=4\r\n\t\t   kMCEvtDefault, \/\/=5\r\n\t\t   kTriggered, \/\/=6\r\n\t\t   kNoVzCut, \/\/=7\r\n\t\t   kNoEvtSel, \/\/=8\r\n\t\t   kINEL10, \/\/=9\r\n\t\t   kIGZ10, \/\/=10\r\n           kIGZ \/\/=11\r\n                 };\r\n\r\nenum eventMixConfig { kDisabled = -1,\r\n\t\t      kMixDefault,\/\/=0 \/\/10 events, Dvz = 1cm, DC = 10\r\n\t\t      k5Evts, \/\/=1 \/\/5 events, Dvz = 1cm, DC = 10\r\n\t\t      k5Cent,  \/\/=2 \/\/10 events, Dvz = 1cm, DC = 5\r\n\t\t      k5Evts5Cent\r\n                    };\r\n\r\nAliRsnMiniAnalysisTask * AddTaskPhiPP13TeV_PID\r\n(\r\n Bool_t      isMC=kFALSE,\r\n Bool_t      isPP=kTRUE,\r\n TString     outNameSuffix=\"tpc2stof3sveto\",\r\n Int_t       evtCutSetID=0,\r\n Int_t       pairCutSetID=0,\r\n Int_t       mixingConfigID=0,\r\n Int_t       aodFilterBit=5,\r\n Int_t       customQualityCutsID=1,\r\n AliRsnCutSetDaughterParticle::ERsnDaughterCutSet cutKaCandidate=AliRsnCutSetDaughterParticle::kTPCpidTOFveto3s,\r\n Float_t     nsigmaKa=2.,\r\n Bool_t      enableMonitor=kTRUE,\r\n Bool_t      IsMcTrueOnly=kFALSE,\r\n TString     monitorOpt=\"NoSIGN\",\r\n Bool_t      useMixLS=0,\r\n Bool_t      checkReflex=0,\r\n AliRsnMiniValue::EType yaxisvar=AliRsnMiniValue::kPt,\r\n TString     polarizationOpt=\"\" \/* J - Jackson,T - Transversity *\/\r\n)\r\n{\r\n  \/\/-------------------------------------------\r\n  \/\/ event cuts\r\n  \/\/-------------------------------------------\r\n  UInt_t      triggerMask=AliVEvent::kINT7;\r\n  if(evtCutSetID>=100){\r\n    triggerMask=AliVEvent::kHighMultV0;\r\n    evtCutSetID=evtCutSetID%100;\r\n  }\r\n\r\n  Bool_t      rejectPileUp=kTRUE;\r\n  Double_t    vtxZcut=10.0;\/\/cm, default cut on vtx z\r\n  Int_t       MultBins=aodFilterBit\/100;\r\n\r\n  if(evtCutSetID==eventCutSet::kDefaultVtx12) vtxZcut=12.0; \/\/cm\r\n  if(evtCutSetID==eventCutSet::kDefaultVtx8) vtxZcut=8.0; \/\/cm\r\n  if(evtCutSetID==eventCutSet::kDefaultVtx5) vtxZcut=5.0; \/\/cm\r\n  if(evtCutSetID==eventCutSet::kNoPileUpCut) rejectPileUp=kFALSE;\r\n  if(evtCutSetID==eventCutSet::kNoVzCut) vtxZcut=1.e6;\/\/off\r\n\r\n  if(!isPP || isMC || MultBins) rejectPileUp=kFALSE;\r\n\r\n  \/\/-------------------------------------------\r\n  \/\/pair cuts\r\n  \/\/-------------------------------------------\r\n  Double_t    minYlab=-0.5;\r\n  Double_t    maxYlab= 0.5;\r\n\r\n  if(pairCutSetID==pairYCutSet::kCentral){\/\/|y_cm|<0.3\r\n    minYlab=-0.3; maxYlab=0.3;\r\n  }\r\n\r\n  Bool_t CheckDecay=true;\r\n  if(customQualityCutsID==99){customQualityCutsID=1; CheckDecay=false;}\r\n\r\n  \/\/-------------------------------------------\r\n  \/\/mixing settings\r\n  \/\/-------------------------------------------\r\n  Int_t       nmix=0;\r\n  Float_t     maxDiffVzMix=1.;\r\n  Float_t     maxDiffMultMix=10.;\r\n\r\n  if(mixingConfigID==eventMixConfig::kMixDefault) nmix=10;\r\n  if(mixingConfigID==eventMixConfig::k5Evts) nmix=5;\r\n  if(mixingConfigID==eventMixConfig::k5Cent) maxDiffMultMix=5;\r\n  if(mixingConfigID==eventMixConfig::k5Evts5Cent){nmix=5; maxDiffMultMix=5;}\r\n\r\n  \/\/ -- INITIALIZATION ----------------------------------------------------------------------------\r\n  \/\/ retrieve analysis manager\r\n\r\n  AliAnalysisManager* mgr=AliAnalysisManager::GetAnalysisManager();\r\n  if(!mgr){\r\n    ::Error(\"AddTaskPhiPP13TeV_PID\", \"No analysis manager to connect to.\");\r\n    return NULL;\r\n  }\r\n\r\n  \/\/ create the task and configure\r\n  TString taskName=Form(\"phi%s%s_%i\",(isPP? \"pp\" : \"PbPb\"),(isMC ? \"MC\" : \"Data\"),(Int_t)cutKaCandidate);\r\n  AliRsnMiniAnalysisTask* task=new AliRsnMiniAnalysisTask(taskName.Data(),isMC);\r\n  if(evtCutSetID!=eventCutSet::kNoEvtSel && evtCutSetID!=eventCutSet::kINEL10 && evtCutSetID!=eventCutSet::kIGZ10 && evtCutSetID!=eventCutSet::kIGZ){\r\n    task->UseESDTriggerMask(triggerMask); \/\/ESD\r\n    \/\/task->SelectCollisionCandidates(triggerMask); \/\/AOD\r\n  }\r\n\r\n  if(isPP){\r\n    if(MultBins==1) task->UseMultiplicity(\"AliMultSelection_V0M\");\r\n    else if(MultBins==2) task->UseMultiplicity(\"AliMultSelection_SPDTracklets08\");\r\n    else if(MultBins==3) task->UseMultiplicity(\"AliMultSelection_SPDTracklets08to15\");\r\n    else task->UseMultiplicity(\"QUALITY\");\r\n  }else task->UseCentrality(\"V0M\");\r\n\r\n  \/\/ set event mixing options\r\n  task->UseContinuousMix();\r\n  \/\/task->UseBinnedMix();\r\n  task->SetNMix(nmix);\r\n  task->SetMaxDiffVz(maxDiffVzMix);\r\n  task->SetMaxDiffMult(maxDiffMultMix);\r\n  ::Info(\"AddTaskPhiPP13TeV_PID\", \"%s\", Form(\"Event mixing configuration: \\n events to mix = %i \\n max diff. vtxZ = cm %5.3f \\n max diff multi = %5.3f\", nmix, maxDiffVzMix, maxDiffMultMix));\r\n  \/\/task->SaveRsnTreeInFile(kTRUE);\r\n\r\n  mgr->AddTask(task);\r\n\r\n  \/\/ cut on primary vertex:\r\n  \/\/ - 2nd argument --> |Vz| range\r\n  \/\/ - 3rd argument --> minimum required number of contributors to vtx\r\n  \/\/ - 4th argument --> tells if TPC stand-alone vertexes must be accepted\r\n\r\n  AliRsnCutPrimaryVertex* cutVertex=0;\r\n  if(evtCutSetID!=eventCutSet::kTriggered && evtCutSetID!=eventCutSet::kNoEvtSel && evtCutSetID!=eventCutSet::kIGZ){\r\n    if(evtCutSetID==eventCutSet::kINEL10 || evtCutSetID==eventCutSet::kIGZ10){\r\n      cutVertex=new AliRsnCutPrimaryVertex(\"cutVertex\",vtxZcut,0,kFALSE);\r\n      cutVertex->SetCheckGeneratedVertexZ();\r\n\r\n    }else if(!MultBins || fabs(vtxZcut-10.)>1.e-10){\r\n      cutVertex=new AliRsnCutPrimaryVertex(\"cutVertex\",vtxZcut,0,kFALSE);\r\n      if(!MultBins){\r\n        cutVertex->SetCheckZResolutionSPD();\r\n        cutVertex->SetCheckDispersionSPD();\r\n        cutVertex->SetCheckZDifferenceSPDTrack();\r\n      }\r\n    }\r\n  }\r\n\r\n  AliRsnCutEventUtils* cutEventUtils=0;\r\n  if(evtCutSetID!=eventCutSet::kNoEvtSel && evtCutSetID!=eventCutSet::kINEL10){\r\n    cutEventUtils=new AliRsnCutEventUtils(\"cutEventUtils\",kTRUE,rejectPileUp);\r\n    if(evtCutSetID==eventCutSet::kIGZ10 || evtCutSetID==eventCutSet::kIGZ) cutEventUtils->SetCheckInelGt0MC();\r\n    else if(!MultBins){\r\n      cutEventUtils->SetCheckIncompleteDAQ();\r\n      cutEventUtils->SetCheckSPDClusterVsTrackletBG();\r\n    }else{\r\n      \/\/cutEventUtils->SetCheckInelGt0SPDtracklets();\r\n      cutEventUtils->SetRemovePileUppA2013(kFALSE);\r\n      if(evtCutSetID!=eventCutSet::kTriggered) cutEventUtils->SetCheckAcceptedMultSelection();\r\n    }\r\n  }\r\n\r\n  if(isPP && (!isMC) && cutVertex){\r\n    cutVertex->SetCheckPileUp(rejectPileUp);\/\/ set the check for pileup\r\n    ::Info(\"AddTaskPhiPP13TeV_PID\", \"%s\", Form(\":::::::::::::::::: Pile-up rejection mode: %s\", (rejectPileUp)?\"ON\":\"OFF\"));\r\n  }\r\n\r\n  \/\/ define and fill cut set for event cut\r\n  AliRsnCutSet* eventCuts=0;\r\n  if(cutEventUtils || cutVertex){\r\n    eventCuts=new AliRsnCutSet(\"eventCuts\",AliRsnTarget::kEvent);\r\n\r\n    if(cutEventUtils && cutVertex){\r\n      eventCuts->AddCut(cutEventUtils);\r\n      eventCuts->AddCut(cutVertex);\r\n      eventCuts->SetCutScheme(Form(\"%s&%s\",cutEventUtils->GetName(),cutVertex->GetName()));\r\n    }else if(cutEventUtils && !cutVertex){\r\n      eventCuts->AddCut(cutEventUtils);\r\n      eventCuts->SetCutScheme(Form(\"%s\",cutEventUtils->GetName()));\r\n    }else if(!cutEventUtils && cutVertex){\r\n      eventCuts->AddCut(cutVertex);\r\n      eventCuts->SetCutScheme(Form(\"%s\",cutVertex->GetName()));\r\n    }\r\n\r\n    task->SetEventCuts(eventCuts);\r\n  }\r\n\r\n  \/\/ -- EVENT-ONLY COMPUTATIONS -------------------------------------------------------------------\r\n\r\n  \/\/vertex\r\n  Int_t vtxID=task->CreateValue(AliRsnMiniValue::kVz,kFALSE);\r\n  AliRsnMiniOutput* outVtx=task->CreateOutput(\"eventVtx\",\"HIST\",\"EVENT\");\r\n  outVtx->AddAxis(vtxID,240,-12.0,12.0);\r\n\r\n  \/\/multiplicity or centrality\r\n  Int_t multID=task->CreateValue(AliRsnMiniValue::kMult,kFALSE);\r\n  AliRsnMiniOutput* outMult=task->CreateOutput(\"eventMult\",\"HIST\",\"EVENT\");\r\n  if(isPP && !MultBins) outMult->AddAxis(multID,400,0.5,400.5);\r\n  else outMult->AddAxis(multID,110,0.,110.);\r\n\r\n  Double_t multbins[200];\r\n  int j,nmult=0;\r\n  for(j=0;j<10;j++){multbins[nmult]=0.0001*j; nmult++;}\r\n  for(j=1;j<10;j++){multbins[nmult]=0.001*j; nmult++;}\r\n  for(j=1;j<50;j++){multbins[nmult]=0.01*j; nmult++;}\r\n  for(j=5;j<10;j++){multbins[nmult]=0.1*j; nmult++;}\r\n  for(j=1;j<=100;j++){multbins[nmult]=j; nmult++;}\r\n  nmult--;\r\n  TH1F* hEventsVsMulti=new TH1F(\"hAEventsVsMulti\",\"\",nmult,multbins);\r\n  task->SetEventQAHist(\"EventsVsMulti\",hEventsVsMulti);\/\/custom binning for fHAEventsVsMulti\r\n\r\n  TH2F* hvz=new TH2F(\"hVzVsCent\",\"\",110,0.,110., 240,-12.0,12.0);\r\n  task->SetEventQAHist(\"vz\",hvz);\/\/plugs this histogram into the fHAEventVz data member\r\n\r\n  double ybins[500];\r\n  for(j=0;j<=401;j++) ybins[j]=j-0.5;\r\n\r\n  \/\/TH2F* hmc=new TH2F(\"MultiVsCent\",\"\", nmult,multbins, 401,ybins);\r\n  \/\/hmc->GetYaxis()->SetTitle(\"QUALITY\");\r\n  TH2F* hmc=new TH2F(\"TrackletsVsCent\",\"\", nmult,multbins, 401,ybins);\r\n  hmc->GetYaxis()->SetTitle(\"TRACKLETS\");\r\n  task->SetEventQAHist(\"multicent\",hmc);\/\/plugs this histogram into the fHAEventMultiCent data member\r\n\r\n  \/\/ -- PAIR CUTS (common to all resonances) ------------------------------------------------------\r\n\r\n  AliRsnCutMiniPair* cutY=new AliRsnCutMiniPair(\"cutRapidity\",AliRsnCutMiniPair::kRapidityRange);\r\n  cutY->SetRangeD(minYlab,maxYlab);\r\n\r\n  AliRsnCutSet* cutsPair=new AliRsnCutSet(\"pairCuts\",AliRsnTarget::kMother);\r\n  cutsPair->AddCut(cutY);\r\n  cutsPair->SetCutScheme(cutY->GetName());\r\n\r\n  task->SetCheckDecay(CheckDecay);\r\n\r\n  \/\/ -- CONFIG ANALYSIS --------------------------------------------------------------------------\r\n  #ifdef __CINT__\r\n  gROOT->LoadMacro(\r\n      \"$ALICE_PHYSICS\/PWGLF\/RESONANCES\/macros\/mini\/ConfigPhiPP13TeV_PID.C\");\r\n  #endif\r\n  if(customQualityCutsID>=0 && !ConfigPhiPP13TeV_PID(task,isMC,isPP,\"\",cutsPair,aodFilterBit,customQualityCutsID,cutKaCandidate,nsigmaKa,enableMonitor,isMC&IsMcTrueOnly,monitorOpt.Data(),useMixLS,isMC&checkReflex,yaxisvar,polarizationOpt,triggerMask)) return 0x0;\r\n\r\n  \/\/ -- CONTAINERS --------------------------------------------------------------------------------\r\n\r\n  TString outputFileName = AliAnalysisManager::GetCommonFileName();\r\n  \/\/  outputFileName += \":Rsn\";\r\n  Printf(\"AddAnalysisTaskPhiPP13TeV_PID - Set OutputFileName : \\n %s\\n\",outputFileName.Data());\r\n\r\n  AliAnalysisDataContainer* output=mgr->CreateContainer(Form(\"RsnOut_%s\",outNameSuffix.Data()),\r\n\t\t\t\t\t\t\tTList::Class(),\r\n\t\t\t\t\t\t\tAliAnalysisManager::kOutputContainer,\r\n\t\t\t\t\t\t\toutputFileName);\r\n  mgr->ConnectInput(task, 0, mgr->GetCommonInputContainer());\r\n  mgr->ConnectOutput(task, 1, output);\r\n\r\n  return task;\r\n}\r\n<commit_msg>allow for AOD analysis<commit_after>#ifdef __CLING__\r\nR__ADD_INCLUDE_PATH($ALICE_PHYSICS)\r\n#include <PWGLF\/RESONANCES\/macros\/mini\/ConfigPhiPP13TeV_PID.C>\r\n#endif\r\n\/***************************************************************************\r\n              Anders Knospe\r\n\r\n\/\/Launches phi analysis with rsn mini package\r\n\/\/Allows basic configuration of pile-up check and event cuts\r\n****************************************************************************\/\r\n\r\n\/*\r\n#include \"AliRsnMiniAnalysisTask.h\"\r\n#include \"AliRsnMiniValue.h\"\r\n#include \"AliRsnCutPrimaryVertex.h\"\r\n#include \"AliRsnCutEventUtils.h\"\r\n#include \"AliRsnMiniPair.h\"\r\n#include \"AliRsnCutMiniPair.h\"\r\n#include \"AliRsnMiniOutput.h\"\r\n#include \".\/ConfigPhiPP13TeV_PID.C\"\r\n *\/\r\n\r\nenum pairYCutSet { kPairDefault=0,\r\n\t\t   kCentral \/\/=1\r\n                 };\r\n\r\nenum eventCutSet { kEvtDefault=0,\r\n\t\t   kNoPileUpCut, \/\/=1\r\n\t\t   kDefaultVtx12,\/\/=2\r\n\t\t   kDefaultVtx8, \/\/=3\r\n\t\t   kDefaultVtx5, \/\/=4\r\n\t\t   kMCEvtDefault, \/\/=5\r\n\t\t   kTriggered, \/\/=6\r\n\t\t   kNoVzCut, \/\/=7\r\n\t\t   kNoEvtSel, \/\/=8\r\n\t\t   kINEL10, \/\/=9\r\n\t\t   kIGZ10, \/\/=10\r\n           kIGZ \/\/=11\r\n                 };\r\n\r\nenum eventMixConfig { kDisabled = -1,\r\n\t\t      kMixDefault,\/\/=0 \/\/10 events, Dvz = 1cm, DC = 10\r\n\t\t      k5Evts, \/\/=1 \/\/5 events, Dvz = 1cm, DC = 10\r\n\t\t      k5Cent,  \/\/=2 \/\/10 events, Dvz = 1cm, DC = 5\r\n\t\t      k5Evts5Cent\r\n                    };\r\n\r\nAliRsnMiniAnalysisTask * AddTaskPhiPP13TeV_PID\r\n(\r\n Bool_t      isMC=kFALSE,\r\n Bool_t      isPP=kTRUE,\r\n TString     outNameSuffix=\"tpc2stof3sveto\",\r\n Int_t       evtCutSetID=0,\r\n Int_t       pairCutSetID=0,\r\n Int_t       mixingConfigID=0,\r\n Int_t       aodFilterBit=5,\r\n Int_t       customQualityCutsID=1,\r\n AliRsnCutSetDaughterParticle::ERsnDaughterCutSet cutKaCandidate=AliRsnCutSetDaughterParticle::kTPCpidTOFveto3s,\r\n Float_t     nsigmaKa=2.,\r\n Bool_t      enableMonitor=kTRUE,\r\n Bool_t      IsMcTrueOnly=kFALSE,\r\n TString     monitorOpt=\"NoSIGN\",\r\n Bool_t      useMixLS=0,\r\n Bool_t      checkReflex=0,\r\n AliRsnMiniValue::EType yaxisvar=AliRsnMiniValue::kPt,\r\n TString     polarizationOpt=\"\" \/* J - Jackson,T - Transversity *\/\r\n)\r\n{\r\n  \/\/-------------------------------------------\r\n  \/\/ event cuts\r\n  \/\/-------------------------------------------\r\n  bool isAOD=(evtCutSetID>=1000);\r\n  UInt_t      triggerMask=AliVEvent::kINT7;\r\n  if(evtCutSetID%1000>=100){\r\n    triggerMask=AliVEvent::kHighMultV0;\r\n  }\r\n  evtCutSetID=evtCutSetID%100;\r\n\r\n  Bool_t      rejectPileUp=kTRUE;\r\n  Double_t    vtxZcut=10.0;\/\/cm, default cut on vtx z\r\n  Int_t       MultBins=aodFilterBit\/100;\r\n\r\n  if(evtCutSetID==eventCutSet::kDefaultVtx12) vtxZcut=12.0; \/\/cm\r\n  if(evtCutSetID==eventCutSet::kDefaultVtx8) vtxZcut=8.0; \/\/cm\r\n  if(evtCutSetID==eventCutSet::kDefaultVtx5) vtxZcut=5.0; \/\/cm\r\n  if(evtCutSetID==eventCutSet::kNoPileUpCut) rejectPileUp=kFALSE;\r\n  if(evtCutSetID==eventCutSet::kNoVzCut) vtxZcut=1.e6;\/\/off\r\n\r\n  if(!isPP || isMC || MultBins) rejectPileUp=kFALSE;\r\n\r\n  \/\/-------------------------------------------\r\n  \/\/pair cuts\r\n  \/\/-------------------------------------------\r\n  Double_t    minYlab=-0.5;\r\n  Double_t    maxYlab= 0.5;\r\n\r\n  if(pairCutSetID==pairYCutSet::kCentral){\/\/|y_cm|<0.3\r\n    minYlab=-0.3; maxYlab=0.3;\r\n  }\r\n\r\n  Bool_t CheckDecay=true;\r\n  if(customQualityCutsID==99){customQualityCutsID=1; CheckDecay=false;}\r\n\r\n  \/\/-------------------------------------------\r\n  \/\/mixing settings\r\n  \/\/-------------------------------------------\r\n  Int_t       nmix=0;\r\n  Float_t     maxDiffVzMix=1.;\r\n  Float_t     maxDiffMultMix=10.;\r\n\r\n  if(mixingConfigID==eventMixConfig::kMixDefault) nmix=10;\r\n  if(mixingConfigID==eventMixConfig::k5Evts) nmix=5;\r\n  if(mixingConfigID==eventMixConfig::k5Cent) maxDiffMultMix=5;\r\n  if(mixingConfigID==eventMixConfig::k5Evts5Cent){nmix=5; maxDiffMultMix=5;}\r\n\r\n  \/\/ -- INITIALIZATION ----------------------------------------------------------------------------\r\n  \/\/ retrieve analysis manager\r\n\r\n  AliAnalysisManager* mgr=AliAnalysisManager::GetAnalysisManager();\r\n  if(!mgr){\r\n    ::Error(\"AddTaskPhiPP13TeV_PID\", \"No analysis manager to connect to.\");\r\n    return NULL;\r\n  }\r\n\r\n  \/\/ create the task and configure\r\n  TString taskName=Form(\"phi%s%s_%i\",(isPP? \"pp\" : \"PbPb\"),(isMC ? \"MC\" : \"Data\"),(Int_t)cutKaCandidate);\r\n  AliRsnMiniAnalysisTask* task=new AliRsnMiniAnalysisTask(taskName.Data(),isMC);\r\n  if(evtCutSetID!=eventCutSet::kNoEvtSel && evtCutSetID!=eventCutSet::kINEL10 && evtCutSetID!=eventCutSet::kIGZ10 && evtCutSetID!=eventCutSet::kIGZ){\r\n    if(!isAOD) task->UseESDTriggerMask(triggerMask); \/\/ESD\r\n    else task->SelectCollisionCandidates(triggerMask); \/\/AOD\r\n  }\r\n\r\n  if(isPP){\r\n    if(MultBins==1) task->UseMultiplicity(\"AliMultSelection_V0M\");\r\n    else if(MultBins==2) task->UseMultiplicity(\"AliMultSelection_SPDTracklets08\");\r\n    else if(MultBins==3) task->UseMultiplicity(\"AliMultSelection_SPDTracklets08to15\");\r\n    else task->UseMultiplicity(\"QUALITY\");\r\n  }else task->UseCentrality(\"V0M\");\r\n\r\n  \/\/ set event mixing options\r\n  task->UseContinuousMix();\r\n  \/\/task->UseBinnedMix();\r\n  task->SetNMix(nmix);\r\n  task->SetMaxDiffVz(maxDiffVzMix);\r\n  task->SetMaxDiffMult(maxDiffMultMix);\r\n  ::Info(\"AddTaskPhiPP13TeV_PID\", \"%s\", Form(\"Event mixing configuration: \\n events to mix = %i \\n max diff. vtxZ = cm %5.3f \\n max diff multi = %5.3f\", nmix, maxDiffVzMix, maxDiffMultMix));\r\n  \/\/task->SaveRsnTreeInFile(kTRUE);\r\n\r\n  mgr->AddTask(task);\r\n\r\n  \/\/ cut on primary vertex:\r\n  \/\/ - 2nd argument --> |Vz| range\r\n  \/\/ - 3rd argument --> minimum required number of contributors to vtx\r\n  \/\/ - 4th argument --> tells if TPC stand-alone vertexes must be accepted\r\n\r\n  AliRsnCutPrimaryVertex* cutVertex=0;\r\n  if(evtCutSetID!=eventCutSet::kTriggered && evtCutSetID!=eventCutSet::kNoEvtSel && evtCutSetID!=eventCutSet::kIGZ){\r\n    if(evtCutSetID==eventCutSet::kINEL10 || evtCutSetID==eventCutSet::kIGZ10){\r\n      cutVertex=new AliRsnCutPrimaryVertex(\"cutVertex\",vtxZcut,0,kFALSE);\r\n      cutVertex->SetCheckGeneratedVertexZ();\r\n\r\n    }else if(!MultBins || fabs(vtxZcut-10.)>1.e-10){\r\n      cutVertex=new AliRsnCutPrimaryVertex(\"cutVertex\",vtxZcut,0,kFALSE);\r\n      if(!MultBins){\r\n        cutVertex->SetCheckZResolutionSPD();\r\n        cutVertex->SetCheckDispersionSPD();\r\n        cutVertex->SetCheckZDifferenceSPDTrack();\r\n      }\r\n    }\r\n  }\r\n\r\n  AliRsnCutEventUtils* cutEventUtils=0;\r\n  if(evtCutSetID!=eventCutSet::kNoEvtSel && evtCutSetID!=eventCutSet::kINEL10){\r\n    cutEventUtils=new AliRsnCutEventUtils(\"cutEventUtils\",kTRUE,rejectPileUp);\r\n    if(evtCutSetID==eventCutSet::kIGZ10 || evtCutSetID==eventCutSet::kIGZ) cutEventUtils->SetCheckInelGt0MC();\r\n    else if(!MultBins){\r\n      cutEventUtils->SetCheckIncompleteDAQ();\r\n      cutEventUtils->SetCheckSPDClusterVsTrackletBG();\r\n    }else{\r\n      \/\/cutEventUtils->SetCheckInelGt0SPDtracklets();\r\n      cutEventUtils->SetRemovePileUppA2013(kFALSE);\r\n      if(evtCutSetID!=eventCutSet::kTriggered) cutEventUtils->SetCheckAcceptedMultSelection();\r\n    }\r\n  }\r\n\r\n  if(isPP && (!isMC) && cutVertex){\r\n    cutVertex->SetCheckPileUp(rejectPileUp);\/\/ set the check for pileup\r\n    ::Info(\"AddTaskPhiPP13TeV_PID\", \"%s\", Form(\":::::::::::::::::: Pile-up rejection mode: %s\", (rejectPileUp)?\"ON\":\"OFF\"));\r\n  }\r\n\r\n  \/\/ define and fill cut set for event cut\r\n  AliRsnCutSet* eventCuts=0;\r\n  if(cutEventUtils || cutVertex){\r\n    eventCuts=new AliRsnCutSet(\"eventCuts\",AliRsnTarget::kEvent);\r\n\r\n    if(cutEventUtils && cutVertex){\r\n      eventCuts->AddCut(cutEventUtils);\r\n      eventCuts->AddCut(cutVertex);\r\n      eventCuts->SetCutScheme(Form(\"%s&%s\",cutEventUtils->GetName(),cutVertex->GetName()));\r\n    }else if(cutEventUtils && !cutVertex){\r\n      eventCuts->AddCut(cutEventUtils);\r\n      eventCuts->SetCutScheme(Form(\"%s\",cutEventUtils->GetName()));\r\n    }else if(!cutEventUtils && cutVertex){\r\n      eventCuts->AddCut(cutVertex);\r\n      eventCuts->SetCutScheme(Form(\"%s\",cutVertex->GetName()));\r\n    }\r\n\r\n    task->SetEventCuts(eventCuts);\r\n  }\r\n\r\n  \/\/ -- EVENT-ONLY COMPUTATIONS -------------------------------------------------------------------\r\n\r\n  \/\/vertex\r\n  Int_t vtxID=task->CreateValue(AliRsnMiniValue::kVz,kFALSE);\r\n  AliRsnMiniOutput* outVtx=task->CreateOutput(\"eventVtx\",\"HIST\",\"EVENT\");\r\n  outVtx->AddAxis(vtxID,240,-12.0,12.0);\r\n\r\n  \/\/multiplicity or centrality\r\n  Int_t multID=task->CreateValue(AliRsnMiniValue::kMult,kFALSE);\r\n  AliRsnMiniOutput* outMult=task->CreateOutput(\"eventMult\",\"HIST\",\"EVENT\");\r\n  if(isPP && !MultBins) outMult->AddAxis(multID,400,0.5,400.5);\r\n  else outMult->AddAxis(multID,110,0.,110.);\r\n\r\n  Double_t multbins[200];\r\n  int j,nmult=0;\r\n  for(j=0;j<10;j++){multbins[nmult]=0.0001*j; nmult++;}\r\n  for(j=1;j<10;j++){multbins[nmult]=0.001*j; nmult++;}\r\n  for(j=1;j<50;j++){multbins[nmult]=0.01*j; nmult++;}\r\n  for(j=5;j<10;j++){multbins[nmult]=0.1*j; nmult++;}\r\n  for(j=1;j<=100;j++){multbins[nmult]=j; nmult++;}\r\n  nmult--;\r\n  TH1F* hEventsVsMulti=new TH1F(\"hAEventsVsMulti\",\"\",nmult,multbins);\r\n  task->SetEventQAHist(\"EventsVsMulti\",hEventsVsMulti);\/\/custom binning for fHAEventsVsMulti\r\n\r\n  TH2F* hvz=new TH2F(\"hVzVsCent\",\"\",110,0.,110., 240,-12.0,12.0);\r\n  task->SetEventQAHist(\"vz\",hvz);\/\/plugs this histogram into the fHAEventVz data member\r\n\r\n  double ybins[500];\r\n  for(j=0;j<=401;j++) ybins[j]=j-0.5;\r\n\r\n  \/\/TH2F* hmc=new TH2F(\"MultiVsCent\",\"\", nmult,multbins, 401,ybins);\r\n  \/\/hmc->GetYaxis()->SetTitle(\"QUALITY\");\r\n  TH2F* hmc=new TH2F(\"TrackletsVsCent\",\"\", nmult,multbins, 401,ybins);\r\n  hmc->GetYaxis()->SetTitle(\"TRACKLETS\");\r\n  task->SetEventQAHist(\"multicent\",hmc);\/\/plugs this histogram into the fHAEventMultiCent data member\r\n\r\n  \/\/ -- PAIR CUTS (common to all resonances) ------------------------------------------------------\r\n\r\n  AliRsnCutMiniPair* cutY=new AliRsnCutMiniPair(\"cutRapidity\",AliRsnCutMiniPair::kRapidityRange);\r\n  cutY->SetRangeD(minYlab,maxYlab);\r\n\r\n  AliRsnCutSet* cutsPair=new AliRsnCutSet(\"pairCuts\",AliRsnTarget::kMother);\r\n  cutsPair->AddCut(cutY);\r\n  cutsPair->SetCutScheme(cutY->GetName());\r\n\r\n  task->SetCheckDecay(CheckDecay);\r\n\r\n  \/\/ -- CONFIG ANALYSIS --------------------------------------------------------------------------\r\n  #ifdef __CINT__\r\n  gROOT->LoadMacro(\r\n      \"$ALICE_PHYSICS\/PWGLF\/RESONANCES\/macros\/mini\/ConfigPhiPP13TeV_PID.C\");\r\n  #endif\r\n  if(customQualityCutsID>=0 && !ConfigPhiPP13TeV_PID(task,isMC,isPP,\"\",cutsPair,aodFilterBit,customQualityCutsID,cutKaCandidate,nsigmaKa,enableMonitor,isMC&IsMcTrueOnly,monitorOpt.Data(),useMixLS,isMC&checkReflex,yaxisvar,polarizationOpt,triggerMask)) return 0x0;\r\n\r\n  \/\/ -- CONTAINERS --------------------------------------------------------------------------------\r\n\r\n  TString outputFileName = AliAnalysisManager::GetCommonFileName();\r\n  \/\/  outputFileName += \":Rsn\";\r\n  Printf(\"AddAnalysisTaskPhiPP13TeV_PID - Set OutputFileName : \\n %s\\n\",outputFileName.Data());\r\n\r\n  AliAnalysisDataContainer* output=mgr->CreateContainer(Form(\"RsnOut_%s\",outNameSuffix.Data()),\r\n\t\t\t\t\t\t\tTList::Class(),\r\n\t\t\t\t\t\t\tAliAnalysisManager::kOutputContainer,\r\n\t\t\t\t\t\t\toutputFileName);\r\n  mgr->ConnectInput(task, 0, mgr->GetCommonInputContainer());\r\n  mgr->ConnectOutput(task, 1, output);\r\n\r\n  return task;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>#include \"StackAllocator.h\"\n#include \"Utils.h\"  \/* CalculatePadding *\/\n#include <stdlib.h>     \/* malloc, free *\/\n#include <algorithm>    \/* max *\/\n#ifdef _DEBUG\n#include <iostream>\n#endif\n\nStackAllocator::StackAllocator(const std::size_t totalSize)\n: Allocator(totalSize) {\n\n}\n\nvoid StackAllocator::Init() {\n    if (m_start_ptr != nullptr) {\n        free(m_start_ptr);\n    }\n    m_start_ptr = malloc(m_totalSize);\n    m_offset = 0;\n}\n\nStackAllocator::~StackAllocator() {\n    free(m_start_ptr);\n    m_start_ptr = nullptr;\n}\n\nvoid* StackAllocator::Allocate(const std::size_t size, const std::size_t alignment) {\n    const std::size_t currentAddress = (std::size_t)m_start_ptr + m_offset;\n\n    std::size_t padding = Utils::CalculatePaddingWithHeader(currentAddress, alignment, sizeof (AllocationHeader));\n\n    if (m_offset + padding + size > m_totalSize) {\n        return nullptr;\n    }\n    m_offset += padding;\n\n    const std::size_t nextAddress = currentAddress + padding;\n    const std::size_t headerAddress = nextAddress - sizeof (AllocationHeader);\n    AllocationHeader allocationHeader{padding};\n    AllocationHeader * headerPtr = (AllocationHeader*) headerAddress;\n    headerPtr = &allocationHeader;\n    \n    m_offset += size;\n\n#ifdef _DEBUG\n    std::cout << \"A\" << \"\\t@C \" << (void*) currentAddress << \"\\t@R \" << (void*) nextAddress << \"\\tO \" << m_offset << \"\\tP \" << padding << std::endl;\n#endif\n    m_used = m_offset;\n    m_peak = std::max(m_peak, m_used);\n\n    return (void*) nextAddress;\n}\n\nvoid StackAllocator::Free(void *ptr) {\n    \/\/ Move offset back to clear address\n    const std::size_t currentAddress = (std::size_t) ptr;\n    const std::size_t headerAddress = currentAddress - sizeof (AllocationHeader);\n    const AllocationHeader * allocationHeader{ (AllocationHeader *) headerAddress};\n\n    m_offset = currentAddress - allocationHeader->padding - (std::size_t) m_start_ptr;\n    m_used = m_offset;\n\n#ifdef _DEBUG\n    std::cout << \"F\" << \"\\t@C \" << (void*) currentAddress << \"\\t@F \" << (void*) m_start_ptr + m_offset << \"\\tO \" << m_offset << std::endl;\n#endif\n}\n\nvoid StackAllocator::Reset() {\n    m_offset = 0;\n    m_used = 0;\n    m_peak = 0;\n}<commit_msg>Fixed void pointer arithmetic error<commit_after>#include \"StackAllocator.h\"\n#include \"Utils.h\"  \/* CalculatePadding *\/\n#include <stdlib.h>     \/* malloc, free *\/\n#include <algorithm>    \/* max *\/\n#ifdef _DEBUG\n#include <iostream>\n#endif\n\nStackAllocator::StackAllocator(const std::size_t totalSize)\n: Allocator(totalSize) {\n\n}\n\nvoid StackAllocator::Init() {\n    if (m_start_ptr != nullptr) {\n        free(m_start_ptr);\n    }\n    m_start_ptr = malloc(m_totalSize);\n    m_offset = 0;\n}\n\nStackAllocator::~StackAllocator() {\n    free(m_start_ptr);\n    m_start_ptr = nullptr;\n}\n\nvoid* StackAllocator::Allocate(const std::size_t size, const std::size_t alignment) {\n    const std::size_t currentAddress = (std::size_t)m_start_ptr + m_offset;\n\n    std::size_t padding = Utils::CalculatePaddingWithHeader(currentAddress, alignment, sizeof (AllocationHeader));\n\n    if (m_offset + padding + size > m_totalSize) {\n        return nullptr;\n    }\n    m_offset += padding;\n\n    const std::size_t nextAddress = currentAddress + padding;\n    const std::size_t headerAddress = nextAddress - sizeof (AllocationHeader);\n    AllocationHeader allocationHeader{padding};\n    AllocationHeader * headerPtr = (AllocationHeader*) headerAddress;\n    headerPtr = &allocationHeader;\n    \n    m_offset += size;\n\n#ifdef _DEBUG\n    std::cout << \"A\" << \"\\t@C \" << (void*) currentAddress << \"\\t@R \" << (void*) nextAddress << \"\\tO \" << m_offset << \"\\tP \" << padding << std::endl;\n#endif\n    m_used = m_offset;\n    m_peak = std::max(m_peak, m_used);\n\n    return (void*) nextAddress;\n}\n\nvoid StackAllocator::Free(void *ptr) {\n    \/\/ Move offset back to clear address\n    const std::size_t currentAddress = (std::size_t) ptr;\n    const std::size_t headerAddress = currentAddress - sizeof (AllocationHeader);\n    const AllocationHeader * allocationHeader{ (AllocationHeader *) headerAddress};\n\n    m_offset = currentAddress - allocationHeader->padding - (std::size_t) m_start_ptr;\n    m_used = m_offset;\n\n#ifdef _DEBUG\n    std::cout << \"F\" << \"\\t@C \" << (void*) currentAddress << \"\\t@F \" << (void*) ((char*) m_start_ptr + m_offset) << \"\\tO \" << m_offset << std::endl;\n#endif\n}\n\nvoid StackAllocator::Reset() {\n    m_offset = 0;\n    m_used = 0;\n    m_peak = 0;\n}<|endoftext|>"}
{"text":"<commit_before>\/**\nCopyright (c) 2017, Philip Deegan.\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\n    * Redistributions of source code must retain the above copyright\nnotice, this list of conditions and the following disclaimer.\n    * Redistributions in binary form must reproduce the above\ncopyright notice, this list of conditions and the following disclaimer\nin the documentation and\/or other materials provided with the\ndistribution.\n    * Neither the name of Philip Deegan nor the names of its\ncontributors may be used to endorse or promote products derived from\nthis software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\nLIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\nA PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\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#include \"maiken\/github.hpp\"\n#include \"maiken\/scm.hpp\"\n\nvoid maiken::Application::loadDepOrMod(const YAML::Node &node, const kul::Dir &depOrMod,\n                                       bool module) KTHROW(kul::Exception) {\n  KOUT(NON) << MKN_PROJECT_NOT_FOUND << depOrMod;\n#ifdef _MKN_DISABLE_SCM_\n  KEXIT(1, \"dep does not exist and remote retrieval is disabled - path: \" + depOrMod.path());\n#endif\n  if (!node[STR_SCM] && !node[STR_NAME])\n    KEXIT(1,\n          \"dep has no name or scm tag so cannot be resolved automatically from \"\n          \"remote repositories - path: \" +\n              depOrMod.path());\n  kul::env::CWD(this->project().dir());\n  const std::string &tscr(node[STR_SCM] ? Properties::RESOLVE(*this, node[STR_SCM].Scalar())\n                                        : node[STR_NAME].Scalar());\n  const std::string &v(node[STR_VERSION] ? Properties::RESOLVE(*this, node[STR_VERSION].Scalar())\n                                         : \"\");\n  try {\n    KOUT(NON) << SCMGetter::GET(depOrMod, tscr, module)\n                     ->co(depOrMod.path(), SCMGetter::REPO(depOrMod, tscr, module), v);\n  } catch (const kul::scm::Exception &e) {\n    if (node[STR_NAME]) {\n      kul::File version(\".mkn\/dep\/ver\/\" + node[STR_NAME].Scalar());\n      if (version) version.rm();\n    }\n    std::rethrow_exception(std::current_exception());\n  }\n  kul::env::CWD(depOrMod);\n\n  if (_MKN_REMOTE_EXEC_) {\n#ifdef _WIN32\n    if (kul::File(\"mkn.bat\").is() &&\n        kul::proc::Call(\"mkn.bat\", AppVars::INSTANCE().envVars()).run())\n      KEXIT(1, \"ERROR in \" + depOrMod.path() + \"\/mkn.bat\");\n#else\n    if (kul::File(\"mkn.\" + std::string(KTOSTRING(__KUL_OS__)) + \".sh\").is() &&\n        kul::proc::Call(\".\/mkn.\" + std::string(KTOSTRING(__KUL_OS__)) + \".sh\",\n                        AppVars::INSTANCE().envVars())\n            .run())\n      KEXIT(1, \"ERROR in \" + depOrMod.path() + \"mkn.\" + std::string(KTOSTRING(__KUL_OS__)) + \".sh\");\n    else if (kul::File(\"mkn.sh\").is() &&\n             kul::proc::Call(\".\/mkn.sh\", AppVars::INSTANCE().envVars()).run())\n      KEXIT(1, \"ERROR in \" + depOrMod.path() + \"\/mkn.sh\");\n#endif\n  }\n  kul::env::CWD(this->project().dir());\n}\n\nkul::Dir maiken::Application::resolveDepOrModDirectory(const YAML::Node &n, bool module) {\n  std::string d;\n  if (n[STR_LOCAL])\n    d = Properties::RESOLVE(*this, n[STR_LOCAL].Scalar());\n  else {\n    std::string depName{n[STR_NAME].Scalar()};\n    std::string name(Properties::RESOLVE(*this, depName));\n    d = (*AppVars::INSTANCE().properkeys().find(module ? \"MKN_MOD_REPO\" : \"MKN_REPO\")).second;\n    try {\n      kul::File verFile(depName, \".mkn\/dep\/ver\");\n      auto resolveSCMBranch = [=]() -> std::string {\n        if (n[STR_VERSION]) return Properties::RESOLVE(*this, n[STR_VERSION].Scalar());\n        if (verFile) return kul::io::Reader(verFile).readLine();\n        {\n          auto app = Applications::INSTANCE().getOrNullptr(depName);\n          if (app) return app->project().dir().name();\n        }\n#ifdef _MKN_WITH_MKN_RAM_\n        KOUT(NON) << \"Attempting branch deduction resolution for: \" << depName;\n        std::string version;\n        if (Github::GET_LATEST(depName, version)) return version;\n#endif  \/\/_MKN_WITH_MKN_RAM_\n\n        auto scm = SCMGetter::INSTANCE().GET(kul::Dir::JOIN(d, kul::Dir::JOIN(name, \"__unknown__\")),\n                                             name, module);\n\n        return scm->defaultRemoteBranch(SCMGetter::INSTANCE().REPO(\n            kul::Dir::JOIN(d, kul::Dir::JOIN(name, \"__unknown__\")), name, module));\n      };\n      std::string version(resolveSCMBranch());\n      if (version.empty()) {\n        KEXIT(1, \"Error in file: \") << verFile << \"\\n\\tCannot be empty\";\n      }\n      {\n        verFile.rm();\n        verFile.dir().mk();\n        kul::io::Writer(verFile) << version;\n      }\n      if (_MKN_REP_VERS_DOT_) kul::String::REPLACE_ALL(version, \".\", kul::Dir::SEP());\n\n      if (_MKN_REP_NAME_DOT_) kul::String::REPLACE_ALL(name, \".\", kul::Dir::SEP());\n      d = kul::Dir::JOIN(d, kul::Dir::JOIN(name, version));\n    } catch (const kul::Exception &e) {\n      KERR << e.debug();\n    }\n  }\n  return kul::Dir(d);\n}\n\nvoid maiken::Application::popDepOrMod(const YAML::Node &n, std::vector<Application *> &vec,\n                                      const std::string &s, bool module, bool with)\n    KTHROW(kul::Exception) {\n  auto setApp = [&](Application &app, const YAML::Node &node) {\n    if (node[STR_SCM]) app.scr = Properties::RESOLVE(*this, node[STR_SCM].Scalar());\n    if (node[STR_VERSION]) app.scv = Properties::RESOLVE(*this, node[STR_VERSION].Scalar());\n    if (module && node) {\n      if (node[STR_INIT]) this->modInit(&app, node[STR_INIT]);\n      if (node[STR_COMPILE]) this->modCompile(&app, node[STR_COMPILE]);\n      if (node[STR_LINK]) this->modLink(&app, node[STR_LINK]);\n      if (node[STR_TEST]) this->modTest(&app, node[STR_TEST]);\n      if (node[STR_PACK]) this->modPack(&app, node[STR_PACK]);\n      app.isMod = 1;\n    }\n  };\n  std::vector<std::pair<std::string, std::string>> apps;\n  auto lam = [&](auto const &depOrMod) {\n    const kul::Dir &projectDir = resolveDepOrModDirectory(depOrMod, module);\n    bool f = false;\n    for (const Application *ap : vec)\n      if (projectDir == ap->project().dir() && p == ap->p) return;\n\n    const maiken::Project &c(*maiken::Projects::INSTANCE().getOrCreate(projectDir));\n\n    auto withoutThis = [=](const std::string &name, const std::string &pro) {\n      for (auto const &wo : AppVars::INSTANCE().withoutParsed()) {\n        kul::hash::set::String profiles;\n        std::string proName(wo);\n        auto lb(wo.find(\"[\"));\n        auto rb(wo.find(\"]\"));\n        if (lb != std::string::npos) {\n          if (rb == std::string::npos || rb < lb) KEXIT(1, \"Invalid -t argument format provided\");\n          std::string profile = proName.substr(lb + 1, rb - lb - 1);\n          for (auto const &pr : kul::String::SPLIT(profile, \",\")) profiles.insert(pr);\n          proName = proName.substr(0, lb);\n        }\n        if (name == proName) {\n          if (pro.empty() && profiles.count(\"@\")) return true;\n          if (profiles.count(pro)) return true;\n        }\n      }\n      return false;\n    };\n\n    if (depOrMod[STR_PROFILE]) {\n      for (auto p :\n           kul::String::SPLIT(Properties::RESOLVE(*this, depOrMod[STR_PROFILE].Scalar()), ' ')) {\n        if (p.empty()) continue;\n        f = 0;\n        if (p == \"@\")\n          p = \"\";\n        else\n          for (auto const &node : c.root()[STR_PROFILE])\n            if (node[STR_NAME].Scalar() == p) {\n              f = 1;\n              break;\n            }\n\n        if (!f && !p.empty())\n          KEXIT(1, \"profile does not exist\\n\" + p + \"\\n\" + project().dir().path());\n\n        if (!module && (depOrMod[STR_NAME] && withoutThis(depOrMod[STR_NAME].Scalar(), p)))\n          continue;\n        auto *app = Applications::INSTANCE().getOrCreate(c, p, 0);\n        if (!with && !module) app->par = this;\n        setApp(*app, depOrMod);\n        vec.push_back(app);\n        app->addRDep(this);\n        apps.push_back(std::make_pair(app->project().dir().path(), app->p));\n      }\n    } else {\n      if (!module && (depOrMod[STR_NAME] && withoutThis(depOrMod[STR_NAME].Scalar(), \"\"))) return;\n      auto *app = Applications::INSTANCE().getOrCreate(c, \"\", 0);\n      if (!with && !module) app->par = this;\n      setApp(*app, depOrMod);\n      vec.push_back(app);\n      app->addRDep(this);\n      apps.push_back(std::make_pair(app->project().dir().path(), app->p));\n    }\n  };\n\n  for (auto const &depOrMod : n[s]) lam(depOrMod);\n\n  if (!module && n[STR_SELF])\n    for (auto const &split :\n         kul::String::SPLIT(Properties::RESOLVE(*this, n[STR_SELF].Scalar()), ' ')) {\n      auto *app = Applications::INSTANCE().getOrCreate(project(), split);\n      app->par = this;\n      app->scr = scr;\n      vec.push_back(app);\n      app->addRDep(this);\n      apps.push_back(std::make_pair(app->project().dir().path(), app->p));\n    }\n\n  cyclicCheck(apps);\n\n  auto cmds = maiken::AppVars::INSTANCE().commands();\n  for (auto *ap : vec) {\n    auto &app(*ap);\n    if (app.buildDir().path().empty()) {\n      kul::env::CWD(app.project().dir());\n      if (app.project().root()[STR_SCM])\n        app.scr = Properties::RESOLVE(app, app.project().root()[STR_SCM].Scalar());\n      if (app.project().root()[STR_BIN])\n        app.bin = Properties::RESOLVE(app, app.project().root()[STR_BIN].Scalar());\n      if (module) app.ro = false;\n      app.setup();\n      if (app.sources().size()) app.buildDir().mk();\n      kul::env::CWD(this->project().dir());\n    }\n    std::string _path(app.inst ? app.inst.escr() : app.buildDir().escr());\n    if (app.sources().size() &&\n        std::find(app.paths.begin(), app.paths.end(), _path) == app.paths.end())\n      app.paths.push_back(_path);\n  }\n}\n<commit_msg>test dep without version<commit_after>\/**\nCopyright (c) 2017, Philip Deegan.\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\n    * Redistributions of source code must retain the above copyright\nnotice, this list of conditions and the following disclaimer.\n    * Redistributions in binary form must reproduce the above\ncopyright notice, this list of conditions and the following disclaimer\nin the documentation and\/or other materials provided with the\ndistribution.\n    * Neither the name of Philip Deegan nor the names of its\ncontributors may be used to endorse or promote products derived from\nthis software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\nLIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\nA PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\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#include \"maiken\/github.hpp\"\n#include \"maiken\/scm.hpp\"\n\nvoid maiken::Application::loadDepOrMod(const YAML::Node &node, const kul::Dir &depOrMod,\n                                       bool module) KTHROW(kul::Exception) {\n  KOUT(NON) << MKN_PROJECT_NOT_FOUND << depOrMod;\n#ifdef _MKN_DISABLE_SCM_\n  KEXIT(1, \"dep does not exist and remote retrieval is disabled - path: \" + depOrMod.path());\n#endif\n  if (!node[STR_SCM] && !node[STR_NAME])\n    KEXIT(1,\n          \"dep has no name or scm tag so cannot be resolved automatically from \"\n          \"remote repositories - path: \" +\n              depOrMod.path());\n  kul::env::CWD(this->project().dir());\n  const std::string &tscr(node[STR_SCM] ? Properties::RESOLVE(*this, node[STR_SCM].Scalar())\n                                        : node[STR_NAME].Scalar());\n  const std::string &v(node[STR_VERSION] ? Properties::RESOLVE(*this, node[STR_VERSION].Scalar())\n                                         : \"\");\n  try {\n    KOUT(NON) << SCMGetter::GET(depOrMod, tscr, module)\n                     ->co(depOrMod.path(), SCMGetter::REPO(depOrMod, tscr, module), v);\n  } catch (const kul::scm::Exception &e) {\n    if (node[STR_NAME]) {\n      kul::File version(\".mkn\/dep\/ver\/\" + node[STR_NAME].Scalar());\n      if (version) version.rm();\n    }\n    std::rethrow_exception(std::current_exception());\n  }\n  kul::env::CWD(depOrMod);\n\n  if (_MKN_REMOTE_EXEC_) {\n#ifdef _WIN32\n    if (kul::File(\"mkn.bat\").is() &&\n        kul::proc::Call(\"mkn.bat\", AppVars::INSTANCE().envVars()).run())\n      KEXIT(1, \"ERROR in \" + depOrMod.path() + \"\/mkn.bat\");\n#else\n    if (kul::File(\"mkn.\" + std::string(KTOSTRING(__KUL_OS__)) + \".sh\").is() &&\n        kul::proc::Call(\".\/mkn.\" + std::string(KTOSTRING(__KUL_OS__)) + \".sh\",\n                        AppVars::INSTANCE().envVars())\n            .run())\n      KEXIT(1, \"ERROR in \" + depOrMod.path() + \"mkn.\" + std::string(KTOSTRING(__KUL_OS__)) + \".sh\");\n    else if (kul::File(\"mkn.sh\").is() &&\n             kul::proc::Call(\".\/mkn.sh\", AppVars::INSTANCE().envVars()).run())\n      KEXIT(1, \"ERROR in \" + depOrMod.path() + \"\/mkn.sh\");\n#endif\n  }\n  kul::env::CWD(this->project().dir());\n}\n\nkul::Dir maiken::Application::resolveDepOrModDirectory(const YAML::Node &n, bool module) {\n  std::string d;\n  if (n[STR_LOCAL])\n    d = Properties::RESOLVE(*this, n[STR_LOCAL].Scalar());\n  else {\n    std::string depName{n[STR_NAME].Scalar()};\n    std::string name(Properties::RESOLVE(*this, depName));\n    d = (*AppVars::INSTANCE().properkeys().find(module ? \"MKN_MOD_REPO\" : \"MKN_REPO\")).second;\n    try {\n      kul::File verFile(depName, \".mkn\/dep\/ver\");\n      auto resolveSCMBranch = [=]() -> std::string {\n        if (n[STR_VERSION]) return Properties::RESOLVE(*this, n[STR_VERSION].Scalar());\n        if (verFile) return kul::io::Reader(verFile).readLine();\n        {\n          auto app = Applications::INSTANCE().getOrNullptr(depName);\n          if (app) return app->project().dir().name();\n        }\n#ifdef _MKN_WITH_MKN_RAM_\n        KOUT(NON) << \"Attempting branch deduction resolution for: \" << depName;\n        std::string version;\n        if (Github::GET_LATEST(depName, version)) return version;\n#endif  \/\/_MKN_WITH_MKN_RAM_\n\n        return \"master\";\n      };\n      std::string version(resolveSCMBranch());\n      if (version.empty()) {\n        KEXIT(1, \"Error in file: \") << verFile << \"\\n\\tCannot be empty\";\n      }\n      {\n        verFile.rm();\n        verFile.dir().mk();\n        kul::io::Writer(verFile) << version;\n      }\n      if (_MKN_REP_VERS_DOT_) kul::String::REPLACE_ALL(version, \".\", kul::Dir::SEP());\n\n      if (_MKN_REP_NAME_DOT_) kul::String::REPLACE_ALL(name, \".\", kul::Dir::SEP());\n      d = kul::Dir::JOIN(d, kul::Dir::JOIN(name, version));\n    } catch (const kul::Exception &e) {\n      KERR << e.debug();\n    }\n  }\n  return kul::Dir(d);\n}\n\nvoid maiken::Application::popDepOrMod(const YAML::Node &n, std::vector<Application *> &vec,\n                                      const std::string &s, bool module, bool with)\n    KTHROW(kul::Exception) {\n  auto setApp = [&](Application &app, const YAML::Node &node) {\n    if (node[STR_SCM]) app.scr = Properties::RESOLVE(*this, node[STR_SCM].Scalar());\n    if (node[STR_VERSION]) app.scv = Properties::RESOLVE(*this, node[STR_VERSION].Scalar());\n    if (module && node) {\n      if (node[STR_INIT]) this->modInit(&app, node[STR_INIT]);\n      if (node[STR_COMPILE]) this->modCompile(&app, node[STR_COMPILE]);\n      if (node[STR_LINK]) this->modLink(&app, node[STR_LINK]);\n      if (node[STR_TEST]) this->modTest(&app, node[STR_TEST]);\n      if (node[STR_PACK]) this->modPack(&app, node[STR_PACK]);\n      app.isMod = 1;\n    }\n  };\n  std::vector<std::pair<std::string, std::string>> apps;\n  auto lam = [&](auto const &depOrMod) {\n    const kul::Dir &projectDir = resolveDepOrModDirectory(depOrMod, module);\n    bool f = false;\n    for (const Application *ap : vec)\n      if (projectDir == ap->project().dir() && p == ap->p) return;\n\n    const maiken::Project &c(*maiken::Projects::INSTANCE().getOrCreate(projectDir));\n\n    auto withoutThis = [=](const std::string &name, const std::string &pro) {\n      for (auto const &wo : AppVars::INSTANCE().withoutParsed()) {\n        kul::hash::set::String profiles;\n        std::string proName(wo);\n        auto lb(wo.find(\"[\"));\n        auto rb(wo.find(\"]\"));\n        if (lb != std::string::npos) {\n          if (rb == std::string::npos || rb < lb) KEXIT(1, \"Invalid -t argument format provided\");\n          std::string profile = proName.substr(lb + 1, rb - lb - 1);\n          for (auto const &pr : kul::String::SPLIT(profile, \",\")) profiles.insert(pr);\n          proName = proName.substr(0, lb);\n        }\n        if (name == proName) {\n          if (pro.empty() && profiles.count(\"@\")) return true;\n          if (profiles.count(pro)) return true;\n        }\n      }\n      return false;\n    };\n\n    if (depOrMod[STR_PROFILE]) {\n      for (auto p :\n           kul::String::SPLIT(Properties::RESOLVE(*this, depOrMod[STR_PROFILE].Scalar()), ' ')) {\n        if (p.empty()) continue;\n        f = 0;\n        if (p == \"@\")\n          p = \"\";\n        else\n          for (auto const &node : c.root()[STR_PROFILE])\n            if (node[STR_NAME].Scalar() == p) {\n              f = 1;\n              break;\n            }\n\n        if (!f && !p.empty())\n          KEXIT(1, \"profile does not exist\\n\" + p + \"\\n\" + project().dir().path());\n\n        if (!module && (depOrMod[STR_NAME] && withoutThis(depOrMod[STR_NAME].Scalar(), p)))\n          continue;\n        auto *app = Applications::INSTANCE().getOrCreate(c, p, 0);\n        if (!with && !module) app->par = this;\n        setApp(*app, depOrMod);\n        vec.push_back(app);\n        app->addRDep(this);\n        apps.push_back(std::make_pair(app->project().dir().path(), app->p));\n      }\n    } else {\n      if (!module && (depOrMod[STR_NAME] && withoutThis(depOrMod[STR_NAME].Scalar(), \"\"))) return;\n      auto *app = Applications::INSTANCE().getOrCreate(c, \"\", 0);\n      if (!with && !module) app->par = this;\n      setApp(*app, depOrMod);\n      vec.push_back(app);\n      app->addRDep(this);\n      apps.push_back(std::make_pair(app->project().dir().path(), app->p));\n    }\n  };\n\n  for (auto const &depOrMod : n[s]) lam(depOrMod);\n\n  if (!module && n[STR_SELF])\n    for (auto const &split :\n         kul::String::SPLIT(Properties::RESOLVE(*this, n[STR_SELF].Scalar()), ' ')) {\n      auto *app = Applications::INSTANCE().getOrCreate(project(), split);\n      app->par = this;\n      app->scr = scr;\n      vec.push_back(app);\n      app->addRDep(this);\n      apps.push_back(std::make_pair(app->project().dir().path(), app->p));\n    }\n\n  cyclicCheck(apps);\n\n  auto cmds = maiken::AppVars::INSTANCE().commands();\n  for (auto *ap : vec) {\n    auto &app(*ap);\n    if (app.buildDir().path().empty()) {\n      kul::env::CWD(app.project().dir());\n      if (app.project().root()[STR_SCM])\n        app.scr = Properties::RESOLVE(app, app.project().root()[STR_SCM].Scalar());\n      if (app.project().root()[STR_BIN])\n        app.bin = Properties::RESOLVE(app, app.project().root()[STR_BIN].Scalar());\n      if (module) app.ro = false;\n      app.setup();\n      if (app.sources().size()) app.buildDir().mk();\n      kul::env::CWD(this->project().dir());\n    }\n    std::string _path(app.inst ? app.inst.escr() : app.buildDir().escr());\n    if (app.sources().size() &&\n        std::find(app.paths.begin(), app.paths.end(), _path) == app.paths.end())\n      app.paths.push_back(_path);\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef EBITEN_SAMPLES_SAMPLE_GAME_HPP\n#define EBITEN_SAMPLES_SAMPLE_GAME_HPP\n\n#include \"ebiten\/ebiten.hpp\"\n#include \"ebiten\/image_loader.hpp\"\n#include <cstdlib>\n#include <iostream>\n\n#include \"yield.hpp\"\n\nnamespace ebiten_samples {\n\nclass sprite {\npublic:\n  double x;\n  double y;\n  sprite()\n    : x(0), y(0) {\n  }\n  sprite(double x, double y)\n    : x(x), y(y) {\n  }\n};\n\nclass sample_game : private ebiten::noncopyable {\nprivate:\n  typedef std::vector<sprite> sprites_type;\n  ebiten::graphics::texture texture_;\n  sprites_type sprites_;\n  coroutine c;\n  int i;\npublic:\n  sample_game() {\n    for (int i = 0; i < 6; ++i) {\n      this->sprites_.emplace_back();\n    }\n  }\n  void\n  update(ebiten::graphics::texture_factory& tf) {\n    reenter(c) {\n      {\n        NSBundle* bundle = [NSBundle mainBundle];\n        NSString* ns_path = [bundle pathForResource:@\"test.png\" ofType:nil];\n        std::string path([ns_path UTF8String]);\n        \/\/ TODO: Load Async\n        std::unique_ptr<ebiten::image> image = ebiten::image_loader::load_png(path);\n        \/\/ TODO: Texture Atlas\n        this->texture_ = tf.from_image(*image);\n      }\n      {\n        this->sprites_.at(0) = sprite(32, 32);\n        this->sprites_.at(1) = sprite(32, 132);\n        this->sprites_.at(2) = sprite(132, 32);\n        this->sprites_.at(3) = sprite(132, 132);\n        this->sprites_.at(4) = sprite(32, 32);\n        this->sprites_.at(5) = sprite(64, 32);\n      }\n      {\n        for (;;) {\n          for (this->i = 0; this->i < 240; ++this->i) {\n            {\n              auto& s = this->sprites_.at(0);\n              s.x = 32 + (this->i % 240);\n            }\n            yield();\n          }\n          for (this->i = 240 - 1; 0 <= this->i; --this->i) {\n            {\n              auto& s = this->sprites_.at(0);\n              s.x = 32 + (this->i % 240);\n            }\n            yield();\n          }\n        }\n      }\n    }\n  }\n  void\n  draw(ebiten::graphics::graphics_context& gc) const {\n    if (!this->texture_) {\n      \/\/ loading...\n      return;\n    }\n    gc.draw_rect(0, 0, 100, 100, 51, 102, 153, 128);\n    \n    gc.set_texture(this->texture_);\n    int i = 0;\n    for (auto const& s : this->sprites_) {\n      if (i == 5) {\n        auto mat = ebiten::graphics::geometry_matrix(2, 0, 0, 2, 0, 0);\n        gc.set_geometry_matrix(mat);\n      } else if (i == 4) {\n        ebiten::graphics::color_matrix mat(ebiten::graphics::color_matrix::identity());\n        mat.set_element<0, 0>(0);\n        gc.set_color_matrix(mat);\n      } else {\n        auto mat = ebiten::graphics::geometry_matrix(1, 0, 0, 1, 0, 0);\n        gc.set_geometry_matrix(mat);\n      }\n      gc.draw(0, 0, 32, 32, s.x, s.y, 32, 32);\n      ++i;\n    }\n  }\n};\n\n}\n\n#include \"unyield.hpp\"\n\n#endif\n<commit_msg>Reading images async<commit_after>#ifndef EBITEN_SAMPLES_SAMPLE_GAME_HPP\n#define EBITEN_SAMPLES_SAMPLE_GAME_HPP\n\n#include \"ebiten\/ebiten.hpp\"\n#include \"ebiten\/image_loader.hpp\"\n#include <cstdlib>\n#include <future>\n#include <iostream>\n\n#include \"yield.hpp\"\n\nnamespace ebiten_samples {\n\nclass sprite {\npublic:\n  double x;\n  double y;\n  sprite()\n    : x(0), y(0) {\n  }\n  sprite(double x, double y)\n    : x(x), y(y) {\n  }\n};\n\nclass sample_game : private ebiten::noncopyable {\nprivate:\n  typedef std::vector<sprite> sprites_type;\n  ebiten::graphics::texture texture_;\n  sprites_type sprites_;\n  coroutine c;\n  std::future<std::unique_ptr<ebiten::image>> image_;\n  int i;\npublic:\n  sample_game() {\n    for (int i = 0; i < 6; ++i) {\n      this->sprites_.emplace_back();\n    }\n  }\n  void\n  update(ebiten::graphics::texture_factory& tf) {\n    reenter(c) {\n      {\n        {\n          NSBundle* bundle = [NSBundle mainBundle];\n          NSString* ns_path = [bundle pathForResource:@\"test.png\" ofType:nil];\n          std::string path([ns_path UTF8String]);\n          this->image_ = std::async(ebiten::image_loader::load_png, path);\n        }\n        while (!this->image_.valid()) {\n          yield();\n        }\n        \/\/ TODO: Texture Atlas\n        this->texture_ = tf.from_image(*(this->image_.get()));\n      }\n      {\n        this->sprites_.at(0) = sprite(32, 32);\n        this->sprites_.at(1) = sprite(32, 132);\n        this->sprites_.at(2) = sprite(132, 32);\n        this->sprites_.at(3) = sprite(132, 132);\n        this->sprites_.at(4) = sprite(32, 32);\n        this->sprites_.at(5) = sprite(64, 32);\n      }\n      {\n        for (;;) {\n          for (this->i = 0; this->i < 240; ++this->i) {\n            {\n              auto& s = this->sprites_.at(0);\n              s.x = 32 + (this->i % 240);\n            }\n            yield();\n          }\n          for (this->i = 240 - 1; 0 <= this->i; --this->i) {\n            {\n              auto& s = this->sprites_.at(0);\n              s.x = 32 + (this->i % 240);\n            }\n            yield();\n          }\n        }\n      }\n    }\n  }\n  void\n  draw(ebiten::graphics::graphics_context& gc) const {\n    if (!this->texture_) {\n      \/\/ loading...\n      std::cout << \"loading...\" << std::endl;\n      return;\n    }\n    gc.draw_rect(0, 0, 100, 100, 51, 102, 153, 128);\n    \n    gc.set_texture(this->texture_);\n    int i = 0;\n    for (auto const& s : this->sprites_) {\n      if (i == 5) {\n        auto mat = ebiten::graphics::geometry_matrix(2, 0, 0, 2, 0, 0);\n        gc.set_geometry_matrix(mat);\n      } else if (i == 4) {\n        ebiten::graphics::color_matrix mat(ebiten::graphics::color_matrix::identity());\n        mat.set_element<0, 0>(0);\n        gc.set_color_matrix(mat);\n      } else {\n        auto mat = ebiten::graphics::geometry_matrix(1, 0, 0, 1, 0, 0);\n        gc.set_geometry_matrix(mat);\n      }\n      gc.draw(0, 0, 32, 32, s.x, s.y, 32, 32);\n      ++i;\n    }\n  }\n};\n\n}\n\n#include \"unyield.hpp\"\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#ifndef EE_X_LAMBDA_AWAITER_HPP\n#define EE_X_LAMBDA_AWAITER_HPP\n\n#include <experimental\/coroutine>\n#include <functional>\n#include <vector>\n\n#include \"ee\/CoroutineFwd.hpp\"\n\nnamespace ee {\nnamespace coroutine {\ntemplate <class Result>\nstruct LambdaAwaiter {\npublic:\n    using Resolve = std::function<void(Result result)>;\n    using Function = std::function<void(const Resolve& resolve)>;\n\n    explicit LambdaAwaiter(const Function& f)\n        : f_(f)\n        , invoked_(false)\n        , ready_(false) {}\n\n    LambdaAwaiter(const LambdaAwaiter&) = delete;\n\n    LambdaAwaiter(LambdaAwaiter&& other)\n        : f_(std::exchange(other.f_, nullptr))\n        , invoked_(std::exchange(other.invoked_, false))\n        , ready_(std::exchange(other.ready_, false))\n        , result_(std::exchange(other.result_, Result()))\n        , handles_(std::exchange(other.handles_, {})) {}\n\n    void await_suspend(std::experimental::coroutine_handle<> handle) {\n        handles_.push_back(handle);\n        if (invoked_) {\n            \/\/ Waiting.\n        } else {\n            invoked_ = true;\n            f_([this, handle](Result result) mutable {\n                ready_ = true;\n                result_ = result;\n                for (auto&& handle : handles_) {\n                    handle.resume();\n                }\n            });\n        }\n    }\n\n    bool await_ready() { \/\/\n        return ready_;\n    }\n\n    Result await_resume() { \/\/\n        return result_;\n    }\n\nprivate:\n    Function f_;\n    bool invoked_;\n    bool ready_;\n    Result result_;\n    std::vector<std::experimental::coroutine_handle<>> handles_;\n};\n\ntemplate <>\nstruct LambdaAwaiter<void> {\n    using Resolve = std::function<void()>;\n    using Function = std::function<void(const Resolve& resolve)>;\n\n    explicit LambdaAwaiter(const Function& f)\n        : f_(f)\n        , invoked_(false)\n        , ready_(false) {}\n\n    LambdaAwaiter(const LambdaAwaiter&) = delete;\n\n    LambdaAwaiter(LambdaAwaiter&& other)\n        : f_(std::exchange(other.f_, nullptr))\n        , invoked_(std::exchange(other.invoked_, false))\n        , ready_(std::exchange(other.ready_, false))\n        , handles_(std::exchange(other.handles_, {})) {\n        int x = 1;\n    }\n\n    ~LambdaAwaiter() { \/\/\n        int x = 1;\n    }\n\n    void await_suspend(std::experimental::coroutine_handle<> handle) {\n        handles_.push_back(handle);\n        if (invoked_) {\n            \/\/ Waiting.\n        } else {\n            invoked_ = true;\n            f_([this]() mutable {\n                ready_ = true;\n                for (auto&& handle : handles_) {\n                    handle.resume();\n                }\n            });\n        }\n    }\n\n    bool await_ready() { \/\/\n        return ready_;\n    }\n\n    void await_resume() {}\n\nprivate:\n    Function f_;\n    bool invoked_;\n    bool ready_;\n    std::vector<std::experimental::coroutine_handle<>> handles_;\n};\n} \/\/ namespace coroutine\n} \/\/ namespace ee\n\n#endif \/\/ EE_X_LAMBDA_AWAITER_HPP\n<commit_msg>Remove unused params.<commit_after>#ifndef EE_X_LAMBDA_AWAITER_HPP\n#define EE_X_LAMBDA_AWAITER_HPP\n\n#include <experimental\/coroutine>\n#include <functional>\n#include <vector>\n\n#include \"ee\/CoroutineFwd.hpp\"\n\nnamespace ee {\nnamespace coroutine {\ntemplate <class Result>\nstruct LambdaAwaiter {\npublic:\n    using Resolve = std::function<void(Result result)>;\n    using Function = std::function<void(const Resolve& resolve)>;\n\n    explicit LambdaAwaiter(const Function& f)\n        : f_(f)\n        , invoked_(false)\n        , ready_(false) {}\n\n    LambdaAwaiter(const LambdaAwaiter&) = delete;\n\n    LambdaAwaiter(LambdaAwaiter&& other)\n        : f_(std::exchange(other.f_, nullptr))\n        , invoked_(std::exchange(other.invoked_, false))\n        , ready_(std::exchange(other.ready_, false))\n        , result_(std::exchange(other.result_, Result()))\n        , handles_(std::exchange(other.handles_, {})) {}\n\n    void await_suspend(std::experimental::coroutine_handle<> handle) {\n        handles_.push_back(handle);\n        if (invoked_) {\n            \/\/ Waiting.\n        } else {\n            invoked_ = true;\n            f_([this, handle](Result result) mutable {\n                ready_ = true;\n                result_ = result;\n                for (auto&& handle : handles_) {\n                    handle.resume();\n                }\n            });\n        }\n    }\n\n    bool await_ready() { \/\/\n        return ready_;\n    }\n\n    Result await_resume() { \/\/\n        return result_;\n    }\n\nprivate:\n    Function f_;\n    bool invoked_;\n    bool ready_;\n    Result result_;\n    std::vector<std::experimental::coroutine_handle<>> handles_;\n};\n\ntemplate <>\nstruct LambdaAwaiter<void> {\n    using Resolve = std::function<void()>;\n    using Function = std::function<void(const Resolve& resolve)>;\n\n    explicit LambdaAwaiter(const Function& f)\n        : f_(f)\n        , invoked_(false)\n        , ready_(false) {}\n\n    LambdaAwaiter(const LambdaAwaiter&) = delete;\n\n    LambdaAwaiter(LambdaAwaiter&& other)\n        : f_(std::exchange(other.f_, nullptr))\n        , invoked_(std::exchange(other.invoked_, false))\n        , ready_(std::exchange(other.ready_, false))\n        , handles_(std::exchange(other.handles_, {})) {}\n\n    void await_suspend(std::experimental::coroutine_handle<> handle) {\n        handles_.push_back(handle);\n        if (invoked_) {\n            \/\/ Waiting.\n        } else {\n            invoked_ = true;\n            f_([this]() mutable {\n                ready_ = true;\n                for (auto&& handle : handles_) {\n                    handle.resume();\n                }\n            });\n        }\n    }\n\n    bool await_ready() { \/\/\n        return ready_;\n    }\n\n    void await_resume() {}\n\nprivate:\n    Function f_;\n    bool invoked_;\n    bool ready_;\n    std::vector<std::experimental::coroutine_handle<>> handles_;\n};\n} \/\/ namespace coroutine\n} \/\/ namespace ee\n\n#endif \/\/ EE_X_LAMBDA_AWAITER_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/* This file is part of VoltDB.\n * Copyright (C) 2008-2012 VoltDB Inc.\n *\n * This file contains original code and\/or modifications of original code.\n * Any modifications made by VoltDB Inc. are licensed under the following\n * terms and conditions:\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\/* Copyright (C) 2008 by H-Store Project\n * Brown University\n * Massachusetts Institute of Technology\n * Yale University\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\n#include \"limitexecutor.h\"\n#include \"common\/debuglog.h\"\n#include \"common\/common.h\"\n#include \"common\/tabletuple.h\"\n#include \"plannodes\/limitnode.h\"\n#include \"storage\/table.h\"\n#include \"storage\/temptable.h\"\n#include \"storage\/tableiterator.h\"\n#include \"storage\/tablefactory.h\"\n\nusing namespace voltdb;\n\nbool\nLimitExecutor::p_init(AbstractPlanNode* abstract_node,\n                      TempTableLimits* limits)\n{\n    VOLT_TRACE(\"init limit Executor\");\n\n    LimitPlanNode* node = dynamic_cast<LimitPlanNode*>(abstract_node);\n    assert(node);\n\n    \/\/\n    \/\/ Skip if we are inline\n    \/\/\n    if (!node->isInline())\n    {\n        \/\/\n        \/\/ Just copy the table schema of our input table\n        \/\/\n        assert(node->getInputTables().size() == 1);\n        node->\n            setOutputTable(TableFactory::\n                           getCopiedTempTable(node->databaseId(),\n                                              node->getInputTables()[0]->name(),\n                                              node->getInputTables()[0],\n                                              limits));\n    }\n    return true;\n}\n\nbool\nLimitExecutor::p_execute(const NValueArray &params)\n{\n    LimitPlanNode* node = dynamic_cast<LimitPlanNode*>(m_abstractNode);\n    assert(node);\n    Table* output_table = node->getOutputTable();\n    assert(output_table);\n    Table* input_table = node->getInputTables()[0];\n    assert(input_table);\n\n    \/\/\n    \/\/ Grab the iterator for our input table, and loop through until\n    \/\/ we have copy enough tuples for the limit specified by the node\n    \/\/\n    TableTuple tuple(input_table->schema());\n    TableIterator iterator = input_table->iterator();\n    int tuple_ctr = 0;\n\n    int limit = 0, offset = 0;\n    node->getLimitAndOffsetByReference(params, limit, offset);\n\n    bool start = (offset == 0);\n    while (iterator.next(tuple) && (tuple_ctr < limit))\n    {\n        \/\/ TODO: need a way to skip \/ iterate N items.\n        if (start) {\n            if (!output_table->insertTuple(tuple))\n            {\n                VOLT_ERROR(\"Failed to insert tuple from input table '%s' into\"\n                           \" output table '%s'\",\n                           input_table->name().c_str(),\n                           output_table->name().c_str());\n                return false;\n            }\n            tuple_ctr++;\n        } else\n        {\n            start = (iterator.getLocation() >= offset);\n        }\n    }\n\n    return true;\n}\n<commit_msg>ENG-2758: Make limit fail with error if passed 0 or <0. Less than zero is also bad for offset. A test case to come tomorrow, but this passes SQLCov and existing tests.<commit_after>\/* This file is part of VoltDB.\n * Copyright (C) 2008-2012 VoltDB Inc.\n *\n * This file contains original code and\/or modifications of original code.\n * Any modifications made by VoltDB Inc. are licensed under the following\n * terms and conditions:\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\/* Copyright (C) 2008 by H-Store Project\n * Brown University\n * Massachusetts Institute of Technology\n * Yale University\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\n#include \"limitexecutor.h\"\n#include \"common\/debuglog.h\"\n#include \"common\/common.h\"\n#include \"common\/tabletuple.h\"\n#include \"plannodes\/limitnode.h\"\n#include \"storage\/table.h\"\n#include \"storage\/temptable.h\"\n#include \"storage\/tableiterator.h\"\n#include \"storage\/tablefactory.h\"\n\nusing namespace voltdb;\n\nbool\nLimitExecutor::p_init(AbstractPlanNode* abstract_node,\n                      TempTableLimits* limits)\n{\n    VOLT_TRACE(\"init limit Executor\");\n\n    LimitPlanNode* node = dynamic_cast<LimitPlanNode*>(abstract_node);\n    assert(node);\n\n    \/\/\n    \/\/ Skip if we are inline\n    \/\/\n    if (!node->isInline())\n    {\n        \/\/\n        \/\/ Just copy the table schema of our input table\n        \/\/\n        assert(node->getInputTables().size() == 1);\n        node->\n            setOutputTable(TableFactory::\n                           getCopiedTempTable(node->databaseId(),\n                                              node->getInputTables()[0]->name(),\n                                              node->getInputTables()[0],\n                                              limits));\n    }\n    return true;\n}\n\nbool\nLimitExecutor::p_execute(const NValueArray &params)\n{\n    LimitPlanNode* node = dynamic_cast<LimitPlanNode*>(m_abstractNode);\n    assert(node);\n    Table* output_table = node->getOutputTable();\n    assert(output_table);\n    Table* input_table = node->getInputTables()[0];\n    assert(input_table);\n\n    \/\/\n    \/\/ Grab the iterator for our input table, and loop through until\n    \/\/ we have copy enough tuples for the limit specified by the node\n    \/\/\n    TableTuple tuple(input_table->schema());\n    TableIterator iterator = input_table->iterator();\n    int tuple_ctr = 0;\n\n    int limit = 0, offset = 0;\n    node->getLimitAndOffsetByReference(params, limit, offset);\n\n    \/\/ handle whacky limits and offsets\n    if (limit <= 0) {\n        throw SQLException(SQLException::data_exception_numeric_value_out_of_range,\n                           \"Limit values must be greater than zero.\");\n    }\n    if (offset < 0) {\n        throw SQLException(SQLException::data_exception_numeric_value_out_of_range,\n                           \"Offset values must not be less than zero.\");\n    }\n\n    bool start = (offset == 0);\n    while (iterator.next(tuple) && (tuple_ctr < limit))\n    {\n        \/\/ TODO: need a way to skip \/ iterate N items.\n        if (start) {\n            if (!output_table->insertTuple(tuple))\n            {\n                VOLT_ERROR(\"Failed to insert tuple from input table '%s' into\"\n                           \" output table '%s'\",\n                           input_table->name().c_str(),\n                           output_table->name().c_str());\n                return false;\n            }\n            tuple_ctr++;\n        } else\n        {\n            start = (iterator.getLocation() >= offset);\n        }\n    }\n\n    return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: simpletypehelper.hxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: vg $ $Date: 2003-05-26 08: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 CONFIGMGR_SIMPLETYPEHELPER_HXX\n#define CONFIGMGR_SIMPLETYPEHELPER_HXX\n\n#ifndef _COM_SUN_STAR_UNO_TYPE_HXX_\n#include <com\/sun\/star\/uno\/Type.hxx>\n#endif\n\nnamespace configmgr\n{\n    namespace uno = com::sun::star::uno;\n\n    namespace SimpleTypeHelper\n    {\n        uno::Type getBooleanType();\n\n        uno::Type getByteType();\n        uno::Type getShortType();\n        uno::Type getIntType();\n        uno::Type getLongType();\n\n        uno::Type getDoubleType();\n\n        uno::Type getStringType();\n\n        uno::Type getBinaryType();\n        uno::Type getAnyType();\n    }\n}\n#endif\n<commit_msg>INTEGRATION: CWS ooo19126 (1.2.170); FILE MERGED 2005\/09\/05 17:04:36 rt 1.2.170.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: simpletypehelper.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 03:56: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 CONFIGMGR_SIMPLETYPEHELPER_HXX\n#define CONFIGMGR_SIMPLETYPEHELPER_HXX\n\n#ifndef _COM_SUN_STAR_UNO_TYPE_HXX_\n#include <com\/sun\/star\/uno\/Type.hxx>\n#endif\n\nnamespace configmgr\n{\n    namespace uno = com::sun::star::uno;\n\n    namespace SimpleTypeHelper\n    {\n        uno::Type getBooleanType();\n\n        uno::Type getByteType();\n        uno::Type getShortType();\n        uno::Type getIntType();\n        uno::Type getLongType();\n\n        uno::Type getDoubleType();\n\n        uno::Type getStringType();\n\n        uno::Type getBinaryType();\n        uno::Type getAnyType();\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 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: templateimpl.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#ifndef CONFIGMGR_TEMPLATEIMPL_HXX_\n#define CONFIGMGR_TEMPLATEIMPL_HXX_\n\n#include \"template.hxx\"\n#include \"configpath.hxx\"\n#include \"requestoptions.hxx\"\n#include <rtl\/ustrbuf.hxx>\n#include <rtl\/ref.hxx>\n#include \"utility.hxx\"\n\n#ifndef INCLUDED_MAP\n#include <map>\n#define INCLUDED_MAP\n#endif\n\nnamespace configmgr\n{\n\/\/-----------------------------------------------------------------------------\n    struct ITemplateProvider;\n\/\/-----------------------------------------------------------------------------\n    namespace data { class SetNodeAccess; class TreeSegment; }\n\/\/-----------------------------------------------------------------------------\n\n    namespace configuration\n    {\n\/\/-----------------------------------------------------------------------------\n\n        typedef com::sun::star::uno::Type       UnoType;\n\n\/\/-----------------------------------------------------------------------------\n\n\n        \/\/-----------------------------------------------------------------------------\n        \/\/ class TemplateName\n        \/\/-----------------------------------------------------------------------------\n        struct TemplateName\n        {\n            \/\/-----------------------------------------------------------------\n            Name aName, aModule;\n\n            \/\/-----------------------------------------------------------------\n            TemplateName()\n            : aName()\n            , aModule()\n            {}\n\n            TemplateName(UnoType const& aType, bool bLocalized)\n            : aName(makeSimpleTypeName(aType))\n            , aModule(makeSimpleTypeModuleName(bLocalized))\n            {}\n\n            TemplateName(Name const& aName_)\n            : aName(aName_)\n            , aModule()\n            {}\n\n            TemplateName(Name const& aName_, Name const& aModule_)\n            : aName(aName_)\n            , aModule(aModule_)\n            {}\n\n            TemplateName(OUString const& sName_, OUString const& sModule_)\n            : aName(    makeName(sName_, Name::NoValidate()) )\n            , aModule(  makeName(sModule_, Name::NoValidate()) )\n            {}\n            \/\/-----------------------------------------------------------------\n\n            \/\/\/ compose the path where the template is located\n            OUString makePathString() const\n            {\n                rtl::OUStringBuffer aBuffer;\n\n                if (!aModule.isEmpty())\n                    aBuffer.append( this->aModule.toString() ).append(sal_Unicode('\/'));\n\n                aBuffer.append( this->aName.toString() );\n\n                return aBuffer.makeStringAndClear();\n            }\n            \/\/-----------------------------------------------------------------\n            bool isEmpty() const\n            {\n                return aName.isEmpty();\n            }\n\n            bool isSimpleTypeName() const;\n\n            UnoType resolveToSimpleType() const;\n            \/\/-----------------------------------------------------------------\n\n            bool operator<(TemplateName const& aOther) const\n            {\n                return (aModule == aOther.aModule) ? (aName < aOther.aName) : (aModule < aOther.aModule);\n            }\n\n            \/\/-----------------------------------------------------------------\n            static UnoType resolveSimpleTypeName(Name const& aName);\n            \/\/-----------------------------------------------------------------\n            static Name makeSimpleTypeName(UnoType const& aType);\n            \/\/-----------------------------------------------------------------\n            static Name makeNativeTypeModuleName();\n            \/\/-----------------------------------------------------------------\n            static Name makeLocalizedTypeModuleName();\n            \/\/-----------------------------------------------------------------\n            static Name makeSimpleTypeModuleName(bool bLocalized)\n            {\n                return bLocalized ? makeLocalizedTypeModuleName() : makeNativeTypeModuleName();\n            }\n            \/\/-----------------------------------------------------------------\n        };\n    \/\/-------------------------------------------------------------------------\n\n        \/\/---------------------------------------------------------------------\n        \/\/ class TemplateImplHelper\n        \/\/---------------------------------------------------------------------\n\n        class TemplateImplHelper\n        {\n        public:\n            \/\/-----------------------------------------------------------------\n\n            static UnoType getNoTypeAvailable()\n            {\n                return getVoidCppuType();\n            }\n            \/\/-----------------------------------------------------------------\n\n            static void assignActualType (Template& aTemplate,UnoType const& aType);\n            \/\/-----------------------------------------------------------------\n\n            static TemplateHolder makeSpecialTemplate (TemplateName const& _aNames, SpecialTemplateProvider const& aProvider, UnoType const& aType);\n\n            static TemplateHolder makeElementTemplateWithType(TemplateName const& aNames, TemplateProvider const& _aProvider, data::SetNodeAccess const& _aSet);\n            \/\/-----------------------------------------------------------------\n\n            static TemplateHolder createNew (TemplateName const& aNames,UnoType const& aType);\n            \/\/-----------------------------------------------------------------\n        };\n    \/\/-------------------------------------------------------------------------\n\n        typedef std::map<TemplateName, TemplateHolder> TemplateRepository;\n    \/\/-------------------------------------------------------------------------\n\n        \/\/---------------------------------------------------------------------\n        \/\/ class SpecialTemplateProvider_Impl\n        \/\/---------------------------------------------------------------------\n\n        struct SpecialTemplateProvider_Impl : configmgr::SimpleReferenceObject\n        {\n            SpecialTemplateProvider_Impl();\n\n            TemplateHolder makeTemplate (TemplateName const& aNames, UnoType const& aType);\n\n        private:\n            TemplateRepository m_aRepository;\n        };\n\n        \/\/---------------------------------------------------------------------\n        \/\/ class TemplateProvider_Impl\n        \/\/---------------------------------------------------------------------\n\n        struct TemplateProvider_Impl : configmgr::SimpleReferenceObject\n        {\n            typedef TemplateProvider::TemplateManagerRef TemplateManagerRef;\n\n            TemplateProvider_Impl(TemplateManagerRef const & xProvider, RequestOptions const& aOptions);\n\n            data::TreeSegment instantiate(TemplateHolder const& aTemplate);\n\n            TemplateHolder makeElementTemplateWithType(TemplateName const& _aNames, data::SetNodeAccess const& _aSet);\n        private:\n            TemplateManagerRef      m_xProvider;\n            RequestOptions          m_aOptions;\n\n            TemplateRepository      m_aRepository;\n        };\n\n\/\/-----------------------------------------------------------------------------\n    }\n}\n\n#endif \/\/ CONFIGMGR_TEMPLATEIMPL_HXX_\n<commit_msg>INTEGRATION: CWS sb88 (1.16.10); FILE MERGED 2008\/06\/03 15:29:54 sb 1.16.10.1: #i89553 applied patch by cmc<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: templateimpl.hxx,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#ifndef CONFIGMGR_TEMPLATEIMPL_HXX_\n#define CONFIGMGR_TEMPLATEIMPL_HXX_\n\n#include \"template.hxx\"\n#include \"configpath.hxx\"\n#include \"requestoptions.hxx\"\n#include <rtl\/ustrbuf.hxx>\n#include <rtl\/ref.hxx>\n#include \"utility.hxx\"\n\n#ifndef INCLUDED_MAP\n#include <map>\n#define INCLUDED_MAP\n#endif\n\nnamespace configmgr\n{\n\/\/-----------------------------------------------------------------------------\n    struct ITemplateProvider;\n\/\/-----------------------------------------------------------------------------\n    namespace data { class SetNodeAccess; class TreeSegment; }\n\/\/-----------------------------------------------------------------------------\n\n    namespace configuration\n    {\n\/\/-----------------------------------------------------------------------------\n\n        typedef com::sun::star::uno::Type       UnoType;\n\n\/\/-----------------------------------------------------------------------------\n\n\n        \/\/-----------------------------------------------------------------------------\n        \/\/ class TemplateName\n        \/\/-----------------------------------------------------------------------------\n        struct TemplateName\n        {\n            \/\/-----------------------------------------------------------------\n            Name aName, aModule;\n\n            \/\/-----------------------------------------------------------------\n            TemplateName()\n            : aName()\n            , aModule()\n            {}\n\n            TemplateName(Name const& aName_)\n            : aName(aName_)\n            , aModule()\n            {}\n\n            TemplateName(Name const& aName_, Name const& aModule_)\n            : aName(aName_)\n            , aModule(aModule_)\n            {}\n\n            TemplateName(OUString const& sName_, OUString const& sModule_)\n            : aName(    makeName(sName_, Name::NoValidate()) )\n            , aModule(  makeName(sModule_, Name::NoValidate()) )\n            {}\n            \/\/-----------------------------------------------------------------\n\n            \/\/\/ compose the path where the template is located\n            OUString makePathString() const\n            {\n                rtl::OUStringBuffer aBuffer;\n\n                if (!aModule.isEmpty())\n                    aBuffer.append( this->aModule.toString() ).append(sal_Unicode('\/'));\n\n                aBuffer.append( this->aName.toString() );\n\n                return aBuffer.makeStringAndClear();\n            }\n            \/\/-----------------------------------------------------------------\n            bool isEmpty() const\n            {\n                return aName.isEmpty();\n            }\n\n            bool isSimpleTypeName() const;\n\n            UnoType resolveToSimpleType() const;\n            \/\/-----------------------------------------------------------------\n\n            bool operator<(TemplateName const& aOther) const\n            {\n                return (aModule == aOther.aModule) ? (aName < aOther.aName) : (aModule < aOther.aModule);\n            }\n\n            \/\/-----------------------------------------------------------------\n            static UnoType resolveSimpleTypeName(Name const& aName);\n            \/\/-----------------------------------------------------------------\n#if OSL_DEBUG_LEVEL > 0\n            static Name makeNativeTypeModuleName();\n            \/\/-----------------------------------------------------------------\n            static Name makeLocalizedTypeModuleName();\n#endif\n            \/\/-----------------------------------------------------------------\n        };\n    \/\/-------------------------------------------------------------------------\n\n        \/\/---------------------------------------------------------------------\n        \/\/ class TemplateImplHelper\n        \/\/---------------------------------------------------------------------\n\n        class TemplateImplHelper\n        {\n        public:\n            \/\/-----------------------------------------------------------------\n\n            static UnoType getNoTypeAvailable()\n            {\n                return getVoidCppuType();\n            }\n            \/\/-----------------------------------------------------------------\n\n            static void assignActualType (Template& aTemplate,UnoType const& aType);\n            \/\/-----------------------------------------------------------------\n\n            static TemplateHolder makeElementTemplateWithType(TemplateName const& aNames, TemplateProvider const& _aProvider, data::SetNodeAccess const& _aSet);\n            \/\/-----------------------------------------------------------------\n\n            static TemplateHolder createNew (TemplateName const& aNames,UnoType const& aType);\n            \/\/-----------------------------------------------------------------\n        };\n    \/\/-------------------------------------------------------------------------\n\n        typedef std::map<TemplateName, TemplateHolder> TemplateRepository;\n    \/\/-------------------------------------------------------------------------\n\n        \/\/---------------------------------------------------------------------\n        \/\/ class TemplateProvider_Impl\n        \/\/---------------------------------------------------------------------\n\n        struct TemplateProvider_Impl : configmgr::SimpleReferenceObject\n        {\n            typedef TemplateProvider::TemplateManagerRef TemplateManagerRef;\n\n            TemplateProvider_Impl(TemplateManagerRef const & xProvider, RequestOptions const& aOptions);\n\n            data::TreeSegment instantiate(TemplateHolder const& aTemplate);\n\n            TemplateHolder makeElementTemplateWithType(TemplateName const& _aNames, data::SetNodeAccess const& _aSet);\n        private:\n            TemplateManagerRef      m_xProvider;\n            RequestOptions          m_aOptions;\n\n            TemplateRepository      m_aRepository;\n        };\n\n\/\/-----------------------------------------------------------------------------\n    }\n}\n\n#endif \/\/ CONFIGMGR_TEMPLATEIMPL_HXX_\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: AKeys.cxx,v $\n *\n *  $Revision: 1.17 $\n *\n *  last change: $Author: obo $ $Date: 2006-07-10 14:23: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#ifndef _CONNECTIVITY_ADO_KEYS_HXX_\n#include \"ado\/AKeys.hxx\"\n#endif\n#ifndef _CONNECTIVITY_ADO_INDEX_HXX_\n#include \"ado\/AKey.hxx\"\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_XRESULTSET_HPP_\n#include <com\/sun\/star\/sdbc\/XResultSet.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBCX_KEYTYPE_HPP_\n#include <com\/sun\/star\/sdbcx\/KeyType.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_KEYRULE_HPP_\n#include <com\/sun\/star\/sdbc\/KeyRule.hpp>\n#endif\n#ifndef _CONNECTIVITY_ADO_ACONNECTION_HXX_\n#include \"ado\/AConnection.hxx\"\n#endif\n#ifndef _COMPHELPER_TYPES_HXX_\n#include <comphelper\/types.hxx>\n#endif\n#ifndef _CONNECTIVITY_ADO_AWRAPADO_HXX_\n#include \"ado\/Awrapado.hxx\"\n#endif\n#ifndef _COMPHELPER_PROPERTY_HXX_\n#include <comphelper\/property.hxx>\n#endif\n#ifndef _DBHELPER_DBEXCEPTION_HXX_\n#include <connectivity\/dbexception.hxx>\n#endif\n\nusing namespace ::comphelper;\nusing namespace connectivity;\nusing namespace connectivity::ado;\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::lang;\nusing namespace com::sun::star::beans;\nusing namespace com::sun::star::sdbc;\nusing namespace com::sun::star::sdbcx;\nusing namespace com::sun::star::container;\n\nsdbcx::ObjectType OKeys::createObject(const ::rtl::OUString& _rName)\n{\n    return new OAdoKey(isCaseSensitive(),m_pConnection,m_aCollection.GetItem(_rName));\n}\n\/\/ -------------------------------------------------------------------------\nvoid OKeys::impl_refresh() throw(RuntimeException)\n{\n    m_aCollection.Refresh();\n}\n\/\/ -------------------------------------------------------------------------\nReference< XPropertySet > OKeys::createDescriptor()\n{\n    return new OAdoKey(isCaseSensitive(),m_pConnection);\n}\n\/\/ -------------------------------------------------------------------------\n\/\/ XAppend\nsdbcx::ObjectType OKeys::appendObject( const ::rtl::OUString& _rForName, const Reference< XPropertySet >& descriptor )\n{\n    OAdoKey* pKey = NULL;\n    if ( !getImplementation( pKey, descriptor ) || pKey == NULL)\n        ::dbtools::throwGenericSQLException(\n            ::rtl::OUString::createFromAscii( \"Could not create key: invalid object descriptor.\" ),\n            static_cast<XTypeProvider*>(this)\n        );\n\n    \/\/ To pass as column parameter to Key's Apppend method\n    OLEVariant vOptional;\n    vOptional.setNoArg();\n\n#if OSL_DEBUG_LEVEL > 0\n    KeyTypeEnum eKey =\n#endif\n        OAdoKey::Map2KeyRule(getINT32(descriptor->getPropertyValue(OMetaConnection::getPropMap().getNameByIndex(PROPERTY_ID_TYPE))));\n#if OSL_DEBUG_LEVEL > 0\n    (void)eKey;\n#endif\n\n    WpADOKey aKey = pKey->getImpl();\n    ::rtl::OUString sName = aKey.get_Name();\n    if(!sName.getLength())\n        aKey.put_Name(::rtl::OUString::createFromAscii(\"PrimaryKey\") );\n\n    ADOKeys* pKeys = m_aCollection;\n    if ( FAILED(pKeys->Append(OLEVariant((ADOKey*)aKey),\n                            adKeyPrimary, \/\/ must be every time adKeyPrimary\n                            vOptional)) )\n    {\n        ADOS::ThrowException(*m_pConnection->getConnection(),static_cast<XTypeProvider*>(this));\n        \/\/ just make sure that an SQLExceptionis thrown here\n        ::dbtools::throwGenericSQLException(\n            ::rtl::OUString::createFromAscii( \"Could not append key.\" ),\n            static_cast<XTypeProvider*>(this)\n        );\n    }\n\n    return new OAdoKey(isCaseSensitive(),m_pConnection,pKey->getImpl());\n}\n\/\/ -------------------------------------------------------------------------\n\/\/ XDrop\nvoid OKeys::dropObject(sal_Int32 \/*_nPos*\/,const ::rtl::OUString _sElementName)\n{\n    if(!m_aCollection.Delete(OLEVariant(_sElementName)))\n        ADOS::ThrowException(*m_pConnection->getConnection(),static_cast<XTypeProvider*>(this));\n}\n\/\/ -----------------------------------------------------------------------------\n\n\n<commit_msg>INTEGRATION: CWS pchfix02 (1.17.42); FILE MERGED 2006\/09\/01 17:21:57 kaib 1.17.42.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: AKeys.cxx,v $\n *\n *  $Revision: 1.18 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 02:14: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_connectivity.hxx\"\n\n#ifndef _CONNECTIVITY_ADO_KEYS_HXX_\n#include \"ado\/AKeys.hxx\"\n#endif\n#ifndef _CONNECTIVITY_ADO_INDEX_HXX_\n#include \"ado\/AKey.hxx\"\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_XRESULTSET_HPP_\n#include <com\/sun\/star\/sdbc\/XResultSet.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBCX_KEYTYPE_HPP_\n#include <com\/sun\/star\/sdbcx\/KeyType.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_KEYRULE_HPP_\n#include <com\/sun\/star\/sdbc\/KeyRule.hpp>\n#endif\n#ifndef _CONNECTIVITY_ADO_ACONNECTION_HXX_\n#include \"ado\/AConnection.hxx\"\n#endif\n#ifndef _COMPHELPER_TYPES_HXX_\n#include <comphelper\/types.hxx>\n#endif\n#ifndef _CONNECTIVITY_ADO_AWRAPADO_HXX_\n#include \"ado\/Awrapado.hxx\"\n#endif\n#ifndef _COMPHELPER_PROPERTY_HXX_\n#include <comphelper\/property.hxx>\n#endif\n#ifndef _DBHELPER_DBEXCEPTION_HXX_\n#include <connectivity\/dbexception.hxx>\n#endif\n\nusing namespace ::comphelper;\nusing namespace connectivity;\nusing namespace connectivity::ado;\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::lang;\nusing namespace com::sun::star::beans;\nusing namespace com::sun::star::sdbc;\nusing namespace com::sun::star::sdbcx;\nusing namespace com::sun::star::container;\n\nsdbcx::ObjectType OKeys::createObject(const ::rtl::OUString& _rName)\n{\n    return new OAdoKey(isCaseSensitive(),m_pConnection,m_aCollection.GetItem(_rName));\n}\n\/\/ -------------------------------------------------------------------------\nvoid OKeys::impl_refresh() throw(RuntimeException)\n{\n    m_aCollection.Refresh();\n}\n\/\/ -------------------------------------------------------------------------\nReference< XPropertySet > OKeys::createDescriptor()\n{\n    return new OAdoKey(isCaseSensitive(),m_pConnection);\n}\n\/\/ -------------------------------------------------------------------------\n\/\/ XAppend\nsdbcx::ObjectType OKeys::appendObject( const ::rtl::OUString& _rForName, const Reference< XPropertySet >& descriptor )\n{\n    OAdoKey* pKey = NULL;\n    if ( !getImplementation( pKey, descriptor ) || pKey == NULL)\n        ::dbtools::throwGenericSQLException(\n            ::rtl::OUString::createFromAscii( \"Could not create key: invalid object descriptor.\" ),\n            static_cast<XTypeProvider*>(this)\n        );\n\n    \/\/ To pass as column parameter to Key's Apppend method\n    OLEVariant vOptional;\n    vOptional.setNoArg();\n\n#if OSL_DEBUG_LEVEL > 0\n    KeyTypeEnum eKey =\n#endif\n        OAdoKey::Map2KeyRule(getINT32(descriptor->getPropertyValue(OMetaConnection::getPropMap().getNameByIndex(PROPERTY_ID_TYPE))));\n#if OSL_DEBUG_LEVEL > 0\n    (void)eKey;\n#endif\n\n    WpADOKey aKey = pKey->getImpl();\n    ::rtl::OUString sName = aKey.get_Name();\n    if(!sName.getLength())\n        aKey.put_Name(::rtl::OUString::createFromAscii(\"PrimaryKey\") );\n\n    ADOKeys* pKeys = m_aCollection;\n    if ( FAILED(pKeys->Append(OLEVariant((ADOKey*)aKey),\n                            adKeyPrimary, \/\/ must be every time adKeyPrimary\n                            vOptional)) )\n    {\n        ADOS::ThrowException(*m_pConnection->getConnection(),static_cast<XTypeProvider*>(this));\n        \/\/ just make sure that an SQLExceptionis thrown here\n        ::dbtools::throwGenericSQLException(\n            ::rtl::OUString::createFromAscii( \"Could not append key.\" ),\n            static_cast<XTypeProvider*>(this)\n        );\n    }\n\n    return new OAdoKey(isCaseSensitive(),m_pConnection,pKey->getImpl());\n}\n\/\/ -------------------------------------------------------------------------\n\/\/ XDrop\nvoid OKeys::dropObject(sal_Int32 \/*_nPos*\/,const ::rtl::OUString _sElementName)\n{\n    if(!m_aCollection.Delete(OLEVariant(_sElementName)))\n        ADOS::ThrowException(*m_pConnection->getConnection(),static_cast<XTypeProvider*>(this));\n}\n\/\/ -----------------------------------------------------------------------------\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief DB server job\n\/\/\/\n\/\/\/ @file\n\/\/\/\n\/\/\/ DISCLAIMER\n\/\/\/\n\/\/\/ Copyright 2014 ArangoDB GmbH, Cologne, Germany\n\/\/\/ Copyright 2004-2014 triAGENS GmbH, Cologne, Germany\n\/\/\/\n\/\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/\/ you may not use this file except in compliance with the License.\n\/\/\/ You may obtain a copy of the License at\n\/\/\/\n\/\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\/\n\/\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/\/ See the License for the specific language governing permissions and\n\/\/\/ limitations under the License.\n\/\/\/\n\/\/\/ Copyright holder is ArangoDB GmbH, Cologne, Germany\n\/\/\/\n\/\/\/ @author Jan Steemann\n\/\/\/ @author Copyright 2014, ArangoDB GmbH, Cologne, Germany\n\/\/\/ @author Copyright 2009-2014, triAGENS GmbH, Cologne, Germany\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"ServerJob.h\"\n#include \"Basics\/MutexLocker.h\"\n#include \"Basics\/logging.h\"\n#include \"Cluster\/HeartbeatThread.h\"\n#include \"V8Server\/ApplicationV8.h\"\n#include \"V8\/v8-utils.h\"\n#include \"VocBase\/server.h\"\n#include \"VocBase\/vocbase.h\"\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION--                                                 class ServerJob\n\/\/ -----------------------------------------------------------------------------\n\nstatic triagens::basics::Mutex ExecutorLock;\n\nusing namespace triagens::arango;\nusing namespace triagens::rest;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief general server job\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION--                                      constructors and destructors\n\/\/ -----------------------------------------------------------------------------\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief constructs a new db server job\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nServerJob::ServerJob (HeartbeatThread* heartbeat,\n                      TRI_server_t* server,\n                      ApplicationV8* applicationV8)\n  : Job(\"HttpServerJob\"),\n    _heartbeat(heartbeat),\n    _server(server),\n    _applicationV8(applicationV8),\n    _shutdown(0),\n    _abandon(false) {\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief destructs a db server job\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nServerJob::~ServerJob () {\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION--                                                       Job methods\n\/\/ -----------------------------------------------------------------------------\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ {@inheritDoc}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nJob::status_t ServerJob::work () {\n  LOG_TRACE(\"starting plan update handler\");\n\n  if (_shutdown != 0) {\n    return status_t(Job::JOB_DONE);\n  }\n\n  bool result = execute();\n  _heartbeat->ready(true);\n\n  if (result) {\n    return status_t(Job::JOB_DONE);\n  }\n\n  return status_t(Job::JOB_FAILED);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ {@inheritDoc}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nbool ServerJob::cancel (bool running) {\n  return false;\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION--                                                   private methods\n\/\/ -----------------------------------------------------------------------------\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief execute job\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nbool ServerJob::execute () {\n\n  \/\/ default to system database\n  TRI_vocbase_t* vocbase = TRI_UseDatabaseServer(_server, TRI_VOC_SYSTEM_DATABASE);\n\n  if (vocbase == 0) {\n    \/\/ database is gone\n    return false;\n  }\n\n  MUTEX_LOCKER(ExecutorLock);\n\n  ApplicationV8::V8Context* context = _applicationV8->enterContext(\"STANDARD\", vocbase, 0, false, true);\n\n  if (context == 0) {\n    TRI_ReleaseDatabaseServer(_server, vocbase);\n    return false;\n  }\n\n  {\n    v8::HandleScope scope;\n    \/\/ execute script inside the context\n    char const* file = \"handle-plan-change\";\n    char const* content = \"require('org\/arangodb\/cluster').handlePlanChange();\";\n\n    TRI_ExecuteJavaScriptString(v8::Context::GetCurrent(), v8::String::New(content), v8::String::New(file), false);\n  }\n\n  \/\/ get the pointer to the last used vocbase\n  TRI_v8_global_t* v8g = (TRI_v8_global_t*) context->_isolate->GetData();\n  void* orig = v8g->_vocbase;\n\n  _applicationV8->exitContext(context);\n  TRI_ReleaseDatabaseServer(_server, (TRI_vocbase_t*) orig);\n\n  return true;\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION--                                                       END-OF-FILE\n\/\/ -----------------------------------------------------------------------------\n\n\/\/ Local Variables:\n\/\/ mode: outline-minor\n\/\/ outline-regexp: \"\/\/\/ @brief\\\\|\/\/\/ {@inheritDoc}\\\\|\/\/\/ @page\\\\|\/\/ --SECTION--\\\\|\/\/\/ @\\\\}\"\n\/\/ End:\n<commit_msg>nullptr<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief DB server job\n\/\/\/\n\/\/\/ @file\n\/\/\/\n\/\/\/ DISCLAIMER\n\/\/\/\n\/\/\/ Copyright 2014 ArangoDB GmbH, Cologne, Germany\n\/\/\/ Copyright 2004-2014 triAGENS GmbH, Cologne, Germany\n\/\/\/\n\/\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/\/ you may not use this file except in compliance with the License.\n\/\/\/ You may obtain a copy of the License at\n\/\/\/\n\/\/\/     http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\/\n\/\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/\/ See the License for the specific language governing permissions and\n\/\/\/ limitations under the License.\n\/\/\/\n\/\/\/ Copyright holder is ArangoDB GmbH, Cologne, Germany\n\/\/\/\n\/\/\/ @author Jan Steemann\n\/\/\/ @author Copyright 2014, ArangoDB GmbH, Cologne, Germany\n\/\/\/ @author Copyright 2009-2014, triAGENS GmbH, Cologne, Germany\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"ServerJob.h\"\n#include \"Basics\/MutexLocker.h\"\n#include \"Basics\/logging.h\"\n#include \"Cluster\/HeartbeatThread.h\"\n#include \"V8Server\/ApplicationV8.h\"\n#include \"V8\/v8-utils.h\"\n#include \"VocBase\/server.h\"\n#include \"VocBase\/vocbase.h\"\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION--                                                 class ServerJob\n\/\/ -----------------------------------------------------------------------------\n\nstatic triagens::basics::Mutex ExecutorLock;\n\nusing namespace triagens::arango;\nusing namespace triagens::rest;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief general server job\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION--                                      constructors and destructors\n\/\/ -----------------------------------------------------------------------------\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief constructs a new db server job\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nServerJob::ServerJob (HeartbeatThread* heartbeat,\n                      TRI_server_t* server,\n                      ApplicationV8* applicationV8)\n  : Job(\"HttpServerJob\"),\n    _heartbeat(heartbeat),\n    _server(server),\n    _applicationV8(applicationV8),\n    _shutdown(0),\n    _abandon(false) {\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief destructs a db server job\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nServerJob::~ServerJob () {\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION--                                                       Job methods\n\/\/ -----------------------------------------------------------------------------\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ {@inheritDoc}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nJob::status_t ServerJob::work () {\n  LOG_TRACE(\"starting plan update handler\");\n\n  if (_shutdown != 0) {\n    return status_t(Job::JOB_DONE);\n  }\n\n  bool result = execute();\n  _heartbeat->ready(true);\n\n  if (result) {\n    return status_t(Job::JOB_DONE);\n  }\n\n  return status_t(Job::JOB_FAILED);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ {@inheritDoc}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nbool ServerJob::cancel (bool running) {\n  return false;\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION--                                                   private methods\n\/\/ -----------------------------------------------------------------------------\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief execute job\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nbool ServerJob::execute () {\n\n  \/\/ default to system database\n  TRI_vocbase_t* vocbase = TRI_UseDatabaseServer(_server, TRI_VOC_SYSTEM_DATABASE);\n\n  if (vocbase == nullptr) {\n    \/\/ database is gone\n    return false;\n  }\n\n  MUTEX_LOCKER(ExecutorLock);\n\n  ApplicationV8::V8Context* context = _applicationV8->enterContext(\"STANDARD\", vocbase, nullptr, false, true);\n\n  if (context == nullptr) {\n    TRI_ReleaseDatabaseServer(_server, vocbase);\n    return false;\n  }\n\n  {\n    v8::HandleScope scope;\n    \/\/ execute script inside the context\n    char const* file = \"handle-plan-change\";\n    char const* content = \"require('org\/arangodb\/cluster').handlePlanChange();\";\n\n    TRI_ExecuteJavaScriptString(v8::Context::GetCurrent(), v8::String::New(content), v8::String::New(file), false);\n  }\n\n  \/\/ get the pointer to the last used vocbase\n  TRI_v8_global_t* v8g = static_cast<TRI_v8_global_t*>(context->_isolate->GetData());\n  void* orig = v8g->_vocbase;\n\n  _applicationV8->exitContext(context);\n  TRI_ReleaseDatabaseServer(_server, static_cast<TRI_vocbase_t*>(orig));\n\n  return true;\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION--                                                       END-OF-FILE\n\/\/ -----------------------------------------------------------------------------\n\n\/\/ Local Variables:\n\/\/ mode: outline-minor\n\/\/ outline-regexp: \"\/\/\/ @brief\\\\|\/\/\/ {@inheritDoc}\\\\|\/\/\/ @page\\\\|\/\/ --SECTION--\\\\|\/\/\/ @\\\\}\"\n\/\/ End:\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\nusing namespace std;\n\n#include \"mxnet\/ndarray.h\"\n#include \"mxnet\/base.h\"\n#include \"mxnet\/operator.h\"\n#include \"mxnet\/symbolic.h\"\n\n\n#if MSHADOW_USE_CUDA\n#define DEV_CTX (mxnet::Context::Create(mxnet::Context::kGPU, 2))\n#else\n#define DEV_CTX (mxnet::Context::Create(mxnet::Context::kCPU, 0))\n#endif\n\nclass MLP{\n\tpublic:\n\t\tmxnet::Symbol LeakyReLULayer(mxnet::Symbol input,std::string name=\"relu\"){\n\n\t\t\tmxnet::OperatorProperty * leaky_relu_op=mxnet::OperatorProperty::Create(\"LeakyReLU\");\n\n\t\t\tstd::vector<std::pair<std::string,std::string> > relu_config;\n\t\t\trelu_config.push_back(std::make_pair(\"act_type\",\"leaky\"));\/\/rrelu leaky prelu elu\n\t\t\trelu_config.push_back(std::make_pair(\"slope\",\"0.25\"));\n\t\t\trelu_config.push_back(std::make_pair(\"lower_bound\",\"0.125\"));\n\t\t\trelu_config.push_back(std::make_pair(\"upper_bound\",\"0.334\"));\n\t\t\tleaky_relu_op->Init(relu_config);\n\t\t\tstd::vector<mxnet::Symbol> sym_vec;\n\n\t\t\tsym_vec.push_back(input);\n\t\t\tmxnet::Symbol leaky_relu=mxnet::Symbol::Create(leaky_relu_op)(sym_vec,name);\n\t\t\treturn leaky_relu;\n\t\t}\n\t\tmxnet::Symbol FullyConnectedLayer(mxnet::Symbol input,std::string num_hidden=\"28\",std::string name=\"fc\"){\n\n\t\t\tmxnet::OperatorProperty * fully_connected_op=mxnet::OperatorProperty::Create(\"FullyConnected\");\n\n\t\t\tstd::vector<std::pair<std::string,std::string> > fc_config;\n\t\t\tfc_config.push_back(std::make_pair(\"num_hidden\",num_hidden));\n\t\t\tfc_config.push_back(std::make_pair(\"no_bias\",\"false\"));\n\t\t\tfully_connected_op->Init(fc_config);\n\n\t\t\tstd::vector<mxnet::Symbol> sym_vec;\n\t\t\tsym_vec.push_back(input);\n\t\t\tmxnet::Symbol fc=mxnet::Symbol::Create(fully_connected_op)(sym_vec,name);\n\n\t\t\treturn fc;\n\t\t}\n\t\tmxnet::Symbol SoftmaxLayer(mxnet::Symbol input,std::string name=\"softmax\"){\n\n\t\t\tmxnet::OperatorProperty * softmax_output_op=mxnet::OperatorProperty::Create(\"SoftmaxOutput\");\n\n\t\t\tstd::vector<std::pair<std::string,std::string> > config;\n\t\t\tsoftmax_output_op->Init(config);\n\n\t\t\tstd::vector<mxnet::Symbol> sym_vec;\n\t\t\tsym_vec.push_back(input);\n\t\t\tmxnet::Symbol softmax=mxnet::Symbol::Create(softmax_output_op)(sym_vec,name);\n\n\t\t\treturn softmax;\n\t\t}\n\n\t\tvoid Train(){\n\n\t\t\t\/\/ setup sym network\n\t\t\tmxnet::Symbol sym_x=mxnet::Symbol::CreateVariable(\"X\");\n\t\t\tmxnet::Symbol sym_fc_1=FullyConnectedLayer(sym_x,\"128\",\"fc1\");\n\t\t\tmxnet::Symbol sym_act_1=LeakyReLULayer(sym_fc_1,\"act_1\");\n\t\t\tmxnet::Symbol sym_fc_2=FullyConnectedLayer(sym_act_1,\"10\",\"fc2\");\n\t\t\tmxnet::Symbol sym_act_2=LeakyReLULayer(sym_fc_2,\"act_2\");\n\t\t\tmxnet::Symbol sym_out=SoftmaxLayer(sym_act_2,\"softmax\");\n\n\t\t\t\/\/ prepare train data\n\t\t\tmxnet::Context ctx_cpu = mxnet::Context::Create(mxnet::Context::kCPU, 1);\n\t\t\tmxnet::Context ctx_dev = DEV_CTX;\/\/ use gpu if possible\n\n\t\t\tmxnet::NDArray array_x(mshadow::Shape2(100,28),ctx_dev,false);\n\t\t\tmxnet::NDArray array_y(mshadow::Shape1(100),ctx_dev,false);\n\n\t\t\tmxnet::real_t* aptr_x=new mxnet::real_t[100*28];\n\t\t\tmxnet::real_t* aptr_y=new mxnet::real_t[100];\n\t\t\tfor (int i=0;i<100;i++){\n\t\t\t\tfor (int j=0;j<28;j++){\n\t\t\t\t\taptr_x[i*28+j]=i%10*1.0f;\n\t\t\t\t}\n\t\t\t\taptr_y[i]=1;\n\t\t\t}\n\t\t\tarray_x.SyncCopyFromCPU(aptr_x,100*28);\n\t\t\tarray_x.WaitToRead();\n\t\t\tarray_y.SyncCopyFromCPU(aptr_y,100);\n\t\t\tarray_y.WaitToRead();\n\t\t\tdelete []aptr_x;\n\t\t\tdelete []aptr_y;\n\n\t\t\t\/\/ init the parameters\n\t\t\tmxnet::NDArray array_w_1(mshadow::Shape2(128,28),ctx_dev,false);\n\t\t\tmxnet::NDArray array_b_1(mshadow::Shape1(128),ctx_dev,false);\n\t\t\tmxnet::NDArray array_w_2(mshadow::Shape2(10,128),ctx_dev,false);\n\t\t\tmxnet::NDArray array_b_2(mshadow::Shape1(10),ctx_dev,false);\n\n\t\t\tarray_w_1=1.1f;\n\t\t\tarray_b_1=0.1f;\n\t\t\tarray_w_2=1.1f;\n\t\t\tarray_b_2=0.1f;\n\n\t\t\t\/\/ the grads\n\t\t\tmxnet::NDArray array_w_1_g(mshadow::Shape2(128,28),ctx_dev,false);\n\t\t\tmxnet::NDArray array_b_1_g(mshadow::Shape1(128),ctx_dev,false);\n\t\t\tmxnet::NDArray array_w_2_g(mshadow::Shape2(10,128),ctx_dev,false);\n\t\t\tmxnet::NDArray array_b_2_g(mshadow::Shape1(10),ctx_dev,false);\n\n\n\t\t\t\/\/ Bind\n\t\t\tstd::map<std::string,mxnet::Context> g2c;\n\t\t\t\/\/g2c[\"X\"]=ctx_dev;\n\t\t\t\/\/g2c[\"fc1\"]=ctx_dev;\n\t\t\tstd::vector<mxnet::NDArray> in_args;\n\t\t\tin_args.push_back(array_x);\n\t\t\tin_args.push_back(array_w_1);\n\t\t\tin_args.push_back(array_b_1);\n\t\t\tin_args.push_back(array_w_2);\n\t\t\tin_args.push_back(array_b_2);\n\t\t\tin_args.push_back(array_y);\n\n\t\t\tstd::vector<mxnet::NDArray> arg_grad_store;\n\t\t\targ_grad_store.push_back(mxnet::NDArray());\n\t\t\targ_grad_store.push_back(array_w_1_g);\n\t\t\targ_grad_store.push_back(array_b_1_g);\n\t\t\targ_grad_store.push_back(array_w_2_g);\n\t\t\targ_grad_store.push_back(array_b_2_g);\n\t\t\targ_grad_store.push_back(mxnet::NDArray());\n\t\t\tstd::vector<mxnet::OpReqType> grad_req_type;\n\t\t\tgrad_req_type.push_back(mxnet::kNullOp);\n\t\t\tgrad_req_type.push_back(mxnet::kWriteTo);\n\t\t\tgrad_req_type.push_back(mxnet::kWriteTo);\n\t\t\tgrad_req_type.push_back(mxnet::kWriteTo);\n\t\t\tgrad_req_type.push_back(mxnet::kWriteTo);\n\t\t\tgrad_req_type.push_back(mxnet::kNullOp);\n\t\t\tstd::vector<mxnet::NDArray> aux_states;\n\n\t\t\tcout<<\"make the Executor\"<<endl;\n\t\t\tmxnet::Executor * exe=mxnet::Executor::Bind(sym_out,\n\t\t\t\t\tctx_dev,\n\t\t\t\t\tg2c,\n\t\t\t\t\tin_args,\n\t\t\t\t\targ_grad_store,\n\t\t\t\t\tgrad_req_type,\n\t\t\t\t\taux_states);\n\n\t\t\tcout<<\"Training\"<<endl;\n\t\t\tint max_iters=100000;\n\t\t\tmxnet::real_t learning_rate=0.00001;\n\t\t\tfor(int iter=0;iter<max_iters;++iter){\n\t\t\t\texe->Forward(true);\n\n\n\t\t\t\tif(iter%100==0){\n\t\t\t\t\tcout<<\"epoch \"<<iter<<endl;\n\t\t\t\t\tfor(int i=0;i<10;++i){\n\t\t\t\t\t\tconst std::vector<mxnet::NDArray> &out=exe->outputs();\n\n\t\t\t\t\t\tmxnet::NDArray c_cpu=out[0].Copy(ctx_cpu);\n\t\t\t\t\t\tc_cpu.WaitToRead();\n\t\t\t\t\t\tmxnet::real_t * cptr = static_cast<mxnet::real_t*>(c_cpu.data().dptr_);\n\t\t\t\t\t\tcout << \"prob \"<<i<<\": \"<<cptr[i] << endl;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t\/\/update\n\t\t\t\texe->Backward(std::vector<mxnet::NDArray>());\n\t\t\t\tfor(int i=1;i<5;++i){\n\t\t\t\t\tin_args[i]-=arg_grad_store[i]*learning_rate;\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n};\n\nint main(int argc, char ** argv)\n{\n\tMLP mlp;\n\tmlp.Train();\n\treturn 0;\n}\n<commit_msg>Update mlp.cpp<commit_after>#include <iostream>\nusing namespace std;\n\n#include \"mxnet\/ndarray.h\"\n#include \"mxnet\/base.h\"\n#include \"mxnet\/operator.h\"\n#include \"mxnet\/symbolic.h\"\n\n\n#if MSHADOW_USE_CUDA\n#define DEV_CTX (mxnet::Context::Create(mxnet::Context::kGPU, 0))\/\/ use no. 0 gpu\n#else\n#define DEV_CTX (mxnet::Context::Create(mxnet::Context::kCPU, 0))\/\/ use cpu\n#endif\n\n\/*\n * In this example, \n * we make by hand some data in 10 classes with some pattern \n * and try to use MLP to recongnize the pattern.\n *\/\n\nclass MLP{\n\tpublic:\n\t\tmxnet::Symbol LeakyReLULayer(mxnet::Symbol input,std::string name=\"relu\"){\n\n\t\t\tmxnet::OperatorProperty * leaky_relu_op=mxnet::OperatorProperty::Create(\"LeakyReLU\");\n\n\t\t\tstd::vector<std::pair<std::string,std::string> > relu_config;\n\t\t\trelu_config.push_back(std::make_pair(\"act_type\",\"leaky\"));\/\/rrelu leaky prelu elu\n\t\t\trelu_config.push_back(std::make_pair(\"slope\",\"0.25\"));\n\t\t\trelu_config.push_back(std::make_pair(\"lower_bound\",\"0.125\"));\n\t\t\trelu_config.push_back(std::make_pair(\"upper_bound\",\"0.334\"));\n\t\t\tleaky_relu_op->Init(relu_config);\n\t\t\tstd::vector<mxnet::Symbol> sym_vec;\n\n\t\t\tsym_vec.push_back(input);\n\t\t\tmxnet::Symbol leaky_relu=mxnet::Symbol::Create(leaky_relu_op)(sym_vec,name);\n\t\t\treturn leaky_relu;\n\t\t}\n\t\tmxnet::Symbol FullyConnectedLayer(mxnet::Symbol input,std::string num_hidden=\"28\",std::string name=\"fc\"){\n\n\t\t\tmxnet::OperatorProperty * fully_connected_op=mxnet::OperatorProperty::Create(\"FullyConnected\");\n\n\t\t\tstd::vector<std::pair<std::string,std::string> > fc_config;\n\t\t\tfc_config.push_back(std::make_pair(\"num_hidden\",num_hidden));\n\t\t\tfc_config.push_back(std::make_pair(\"no_bias\",\"false\"));\n\t\t\tfully_connected_op->Init(fc_config);\n\n\t\t\tstd::vector<mxnet::Symbol> sym_vec;\n\t\t\tsym_vec.push_back(input);\n\t\t\tmxnet::Symbol fc=mxnet::Symbol::Create(fully_connected_op)(sym_vec,name);\n\n\t\t\treturn fc;\n\t\t}\n\t\tmxnet::Symbol SoftmaxLayer(mxnet::Symbol input,std::string name=\"softmax\"){\n\n\t\t\tmxnet::OperatorProperty * softmax_output_op=mxnet::OperatorProperty::Create(\"SoftmaxOutput\");\n\n\t\t\tstd::vector<std::pair<std::string,std::string> > config;\n\t\t\tsoftmax_output_op->Init(config);\n\n\t\t\tstd::vector<mxnet::Symbol> sym_vec;\n\t\t\tsym_vec.push_back(input);\n\t\t\tmxnet::Symbol softmax=mxnet::Symbol::Create(softmax_output_op)(sym_vec,name);\n\n\t\t\treturn softmax;\n\t\t}\n\n\t\tvoid OutputAccuracy(mxnet::real_t * pred,mxnet::real_t * target){\n\t\t\tint right=0;\n\t\t\tfor(int i=0;i<128;++i){\n\t\t\t\tfloat mx_p=pred[i*10+0];\n\t\t\t\tfloat p_y=0;\n\t\t\t\tfor(int j=0;j<10;++j){\n\t\t\t\t\tif(pred[i*10+j]>mx_p){\n\t\t\t\t\t\tmx_p=pred[i*10+j];\n\t\t\t\t\t\tp_y=j;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(p_y==target[i]) right++;\n\t\t\t}\n\t\t\tcout<<\"Accuracy: \"<<right\/128.0<<endl;\n\t\t}\n\n\t\tvoid Train(){\n\n\t\t\t\/\/ setup sym network\n\t\t\tmxnet::Symbol sym_x=mxnet::Symbol::CreateVariable(\"X\");\n\t\t\tmxnet::Symbol sym_fc_1=FullyConnectedLayer(sym_x,\"512\",\"fc1\");\n\t\t\tmxnet::Symbol sym_act_1=LeakyReLULayer(sym_fc_1,\"act_1\");\n\t\t\tmxnet::Symbol sym_fc_2=FullyConnectedLayer(sym_act_1,\"10\",\"fc2\");\n\t\t\tmxnet::Symbol sym_act_2=LeakyReLULayer(sym_fc_2,\"act_2\");\n\t\t\tmxnet::Symbol sym_out=SoftmaxLayer(sym_act_2,\"softmax\");\n\n\t\t\t\/\/ prepare train data\n\t\t\tmxnet::Context ctx_cpu = mxnet::Context::Create(mxnet::Context::kCPU, 1);\n\t\t\tmxnet::Context ctx_dev = DEV_CTX;\/\/ use gpu if possible\n\n\t\t\tmxnet::NDArray array_x(mshadow::Shape2(128,28),ctx_dev,false);\n\t\t\tmxnet::NDArray array_y(mshadow::Shape1(128),ctx_dev,false);\n\n\t\t\tmxnet::real_t* aptr_x=new mxnet::real_t[128*28];\n\t\t\tmxnet::real_t* aptr_y=new mxnet::real_t[128];\n\n\t\t\t\/\/ we make the data by hand, in 10 classes, with some pattern\n\t\t\tfor (int i=0;i<128;i++){\n\t\t\t\tfor (int j=0;j<28;j++){\n\t\t\t\t\taptr_x[i*28+j]=i%10*1.0f;\n\t\t\t\t}\n\t\t\t\taptr_y[i]=i%10;\n\t\t\t}\n\t\t\tarray_x.SyncCopyFromCPU(aptr_x,128*28);\n\t\t\tarray_x.WaitToRead();\n\t\t\tarray_y.SyncCopyFromCPU(aptr_y,128);\n\t\t\tarray_y.WaitToRead();\n\n\t\t\t\/\/ init the parameters\n\t\t\tmxnet::NDArray array_w_1(mshadow::Shape2(512,28),ctx_dev,false);\n\t\t\tmxnet::NDArray array_b_1(mshadow::Shape1(512),ctx_dev,false);\n\t\t\tmxnet::NDArray array_w_2(mshadow::Shape2(10,512),ctx_dev,false);\n\t\t\tmxnet::NDArray array_b_2(mshadow::Shape1(10),ctx_dev,false);\n\n\t\t\t\/\/ the parameters should be initialized in some kind of distribution,\n\t\t\t\/\/ so it learns fast\n\t\t\t\/\/ but here just give a const value by hand\n\t\t\tarray_w_1=0.5f;\n\t\t\tarray_b_1=0.0f;\n\t\t\tarray_w_2=0.5f;\n\t\t\tarray_b_2=0.0f;\n\n\t\t\t\/\/ the grads\n\t\t\tmxnet::NDArray array_w_1_g(mshadow::Shape2(512,28),ctx_dev,false);\n\t\t\tmxnet::NDArray array_b_1_g(mshadow::Shape1(512),ctx_dev,false);\n\t\t\tmxnet::NDArray array_w_2_g(mshadow::Shape2(10,512),ctx_dev,false);\n\t\t\tmxnet::NDArray array_b_2_g(mshadow::Shape1(10),ctx_dev,false);\n\n\t\t\t\/\/ Bind the symolic network with the ndarray\n\t\t\tstd::map<std::string,mxnet::Context> g2c;\n\t\t\t\/\/ all the input args\n\t\t\tstd::vector<mxnet::NDArray> in_args;\n\t\t\tin_args.push_back(array_x);\n\t\t\tin_args.push_back(array_w_1);\n\t\t\tin_args.push_back(array_b_1);\n\t\t\tin_args.push_back(array_w_2);\n\t\t\tin_args.push_back(array_b_2);\n\t\t\tin_args.push_back(array_y);\n\t\t\t\/\/ all the grads\n\t\t\tstd::vector<mxnet::NDArray> arg_grad_store;\n\t\t\targ_grad_store.push_back(mxnet::NDArray());\/\/ we don't need the grad of the input\n\t\t\targ_grad_store.push_back(array_w_1_g);\n\t\t\targ_grad_store.push_back(array_b_1_g);\n\t\t\targ_grad_store.push_back(array_w_2_g);\n\t\t\targ_grad_store.push_back(array_b_2_g);\n\t\t\targ_grad_store.push_back(mxnet::NDArray()); \/\/ neither do we need the grad of the loss\n\t\t\t\/\/ how to handle the grad\n\t\t\tstd::vector<mxnet::OpReqType> grad_req_type;\n\t\t\tgrad_req_type.push_back(mxnet::kNullOp);\n\t\t\tgrad_req_type.push_back(mxnet::kWriteTo);\n\t\t\tgrad_req_type.push_back(mxnet::kWriteTo);\n\t\t\tgrad_req_type.push_back(mxnet::kWriteTo);\n\t\t\tgrad_req_type.push_back(mxnet::kWriteTo);\n\t\t\tgrad_req_type.push_back(mxnet::kNullOp);\n\t\t\tstd::vector<mxnet::NDArray> aux_states;\n\n\t\t\tcout<<\"make the Executor\"<<endl;\n\t\t\tmxnet::Executor * exe=mxnet::Executor::Bind(sym_out,\n\t\t\t\t\tctx_dev,\n\t\t\t\t\tg2c,\n\t\t\t\t\tin_args,\n\t\t\t\t\targ_grad_store,\n\t\t\t\t\tgrad_req_type,\n\t\t\t\t\taux_states);\n\n\t\t\tcout<<\"Training\"<<endl;\n\t\t\tint max_iters=20000;\n\t\t\tmxnet::real_t learning_rate=0.0001;\n\t\t\tfor(int iter=0;iter<max_iters;++iter){\n\t\t\t\texe->Forward(true);\n\n\t\t\t\tif(iter%100==0){\n\t\t\t\t\tcout<<\"epoch \"<<iter<<endl;\n\t\t\t\t\tconst std::vector<mxnet::NDArray> &out=exe->outputs();\n\t\t\t\t\tmxnet::NDArray c_cpu=out[0].Copy(ctx_cpu);\n\t\t\t\t\tc_cpu.WaitToRead();\n\t\t\t\t\tmxnet::real_t * cptr = static_cast<mxnet::real_t*>(c_cpu.data().dptr_);\n\t\t\t\t\tOutputAccuracy(cptr,aptr_y);\n\t\t\t\t}\n\n\t\t\t\t\/\/update the parameters\n\t\t\t\texe->Backward(std::vector<mxnet::NDArray>());\n\t\t\t\tfor(int i=1;i<5;++i){\n\t\t\t\t\tin_args[i]-=arg_grad_store[i]*learning_rate;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tdelete []aptr_x;\n\t\t\tdelete []aptr_y;\n\n\t\t}\n};\n\nint main(int argc, char ** argv)\n{\n\tMLP mlp;\n\tmlp.Train();\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\\\n**\n**  tInputFile.cpp: Member functions for class tInputFile.\n**\n**  (see tInputFile.h for a description of this class)\n**\n**  Greg Tucker, November 1997\n**\n**  $Id: tInputFile.cpp,v 1.18 2002-11-29 13:42:34 childcvs Exp $\n\\****************************************************************************\/\n\n#if !defined(HAVE_NO_NAMESPACE)\n# include <iostream>\nusing namespace std;\n#else\n# include <iostream.h>\n#endif\n#include \"..\/tAssert.h\"\n#include <string.h>\n#include <stdlib.h>\n#include <time.h>\n\n\/\/#include \"..\/Definitions.h\"\n\/\/#include \"..\/Classes.h\"\n#include \"tInputFile.h\"\n#include \"..\/errors\/errors.h\"\n\n\n\/****************************************************************************\\\n**\n**  tInputFile Constructor\n**\n**  Looks for a file called filename, opens it if found or generates an\n**  error if not. Then reads the base name for output files and creates\n**  a file called <filename>.inputs which will act as a log file for\n**  parameters read. (This is often useful when the original input file\n**  gets lost or modified).\n**\n**  Modifications:\n**    - 2\/02: error check for inoutfile added (GT)\n**\n\\****************************************************************************\/\ntInputFile::tInputFile( const char *filename )\n  :\n  infile(), inoutfile(), inoutfile_opened(false)\n{\n   char inoutname[kMaxNameLength];\n\n   \/\/ Open file\n   infile.open( filename );\n   if( !infile.good() )\n   {\n      cerr << \"tInputFile::tInputFile: Unable to open '\" << filename << \"'.\" << endl;\n      ReportFatalError( \"The file may not exist or may be mis-named.\" );\n   }\n\n   \/\/ Create log file for inputs\n   ReadItem( inoutname, \"OUTFILENAME\" );\n   strcat( inoutname, \".inputs\" );\n   inoutfile.open( inoutname );\n   if( !inoutfile.good() )\n     {\n       cerr << \"Unable to open '\" << inoutname << \"'.\\n\";\n       cerr << \"(Error generated in module tInputFile, function tInputFile::tInputFile( const char * ) )\\n\";\n       ReportFatalError( \"The specified path name may not exist.\\n\" );\n     }\n \n   {\n     const time_t now = time(NULL);\n     char *p = ctime(&now);\n     *strchr(p, '\\n') = '\\0';\n     inoutfile << \"# Created by CHILD on \" << p << \".\" << endl;\n   }\n   inoutfile_opened = true;\n}\n\n\/****************************************************************************\\\n**\n**  tInputFile::ReadItem\n**\n**  Reads one parameter from the file. The format is assumed to be a line\n**  of text that begins with the code \"itemCode\", followed by a line containing\n**  the parameter to be read. The function is overloaded according to the\n**  type of data desired (datType simply governs which overloaded function\n**  will be called; it is not used by the routines).\n**\n**  Inputs:  datType -- dummy variable indicating the data type to be read\n**                      (in the case of the string version, the string read\n**                      is placed here)\n**           itemCode -- string that describes the parameter to be read\n**  Returns:  the item read (except in the case of the string version)\n**  Modifications:\n**    - revised to allow arbitrary ordering of items in infile and\/or\n**      ReadItem calls in code; routine searches through\n**      list until it either finds the right itemCode or reaches EOF.\n**      12\/23\/97 SL\n**\n\\****************************************************************************\/\n\/\/ read a line in headerLine and discards the any remaining characters\nstatic\nvoid readLine(char *headerLine, ifstream& infile){\n  infile.getline( headerLine, kMaxNameLength );\n  \/\/ still some characters left on the current line ?\n  if ( !infile.eof() && !infile.bad() && infile.rdstate() & ios::failbit){\n    \/\/ clear failbit\n    infile.clear(infile.rdstate() & ~ios::failbit);\n    \/\/ discard characters.\n    char c;\n    while( infile.get(c) && c != '\\n');\n  }\n}\n\nstatic\nvoid readUntilKeyword(char *headerLine, ifstream& infile,\n\t\t      const char *itemCode){\n  do {\n    readLine(headerLine, infile);\n  } while( !infile.eof() && !infile.bad() &&\n\t   ( headerLine[0]==kCommentMark ||\n\t     strncmp( itemCode, headerLine, strlen( itemCode ) )!=0 ) );\n}\n\nstatic\nvoid skipCommentsAndReadValue(char *headerLine, ifstream& infile){\n  do {\n    readLine(headerLine, infile);\n  } while( !infile.eof() && !infile.bad() &&\n\t   ( headerLine[0]==kCommentMark ) );\n}\n\n\nint tInputFile::ReadItem( const int & \/*datType*\/, const char *itemCode )\n{\n   \/\/cout << \"ReadItem( int )...\";\n   int item;\n   char headerLine[kMaxNameLength];\n   \n   assert( infile.good() );\n\n   \/\/ look for itemCode\n   readUntilKeyword(headerLine, infile, itemCode);\n   if ( infile.eof() || infile.bad() )\n     goto fail;\n\n   \/\/ skip any comment and read value\n   skipCommentsAndReadValue(headerLine, infile);\n   if( headerLine[0]!=kCommentMark )\n     {\n       item = atoi(headerLine);\n       if (inoutfile_opened)\n\t inoutfile << itemCode << endl << item << endl;\n     }\n   else\n     {\n       goto fail;\n     }\n   infile.seekg( 0, ios::beg );\n   return item;\n   \n fail:\n   cerr << \"I expected to read the parameter '\" << itemCode\n\t<< \"', but reached EOF first\" << endl;\n   ReportFatalError( \"Missing parameter in input file\" );\n}\n\nlong tInputFile::ReadItem( const long & \/*datType*\/, const char *itemCode )\n{\n   \/\/cout << \"ReadItem( long )...\";\n   long item;\n   char headerLine[kMaxNameLength];\n  \n   assert( infile.good() );\n  \n   \/\/ look for itemCode\n   readUntilKeyword(headerLine, infile, itemCode);\n   if ( infile.eof() || infile.bad() )\n     goto fail;\n\n   \/\/ skip any comment and read value\n   skipCommentsAndReadValue(headerLine, infile);\n   if( headerLine[0]!=kCommentMark )\n     {\n       item = atol(headerLine);\n       if (inoutfile_opened)\n\t inoutfile << itemCode << endl << item << endl;\n     }\n   else\n     {\n       goto fail;\n     }\n   infile.seekg( 0, ios::beg );\n   return item;\n\n fail:\n   cerr << \"I expected to read the parameter '\" << itemCode\n\t<< \"', but reached EOF first\" << endl;\n   ReportFatalError( \"Missing parameter in input file\" );\n}\n\ndouble tInputFile::ReadItem( const double & \/*datType*\/, const char *itemCode )\n{\n   \/\/cout << \"ReadItem( double )...\";\n   double item;\n   char headerLine[kMaxNameLength];\n   \n   assert( infile.good() );\n  \n   \/\/ look for itemCode\n   readUntilKeyword(headerLine, infile, itemCode);\n   if ( infile.eof() || infile.bad() )\n     goto fail;\n\n   \/\/ skip any comment and read value\n   skipCommentsAndReadValue(headerLine, infile);\n   if( headerLine[0]!=kCommentMark )\n     {\n       item = atof(headerLine);\n       if (inoutfile_opened)\n\t inoutfile << itemCode << endl << item << endl;\n     }\n   else\n     {\n       goto fail;\n     }\n   infile.seekg( 0, ios::beg );\n   return item;\n\n fail:\n   cerr << \"I expected to read the parameter '\" << itemCode\n\t<< \"', but reached EOF first\" << endl;\n   ReportFatalError( \"Missing parameter in input file\" );\n}\n\n\nvoid tInputFile::ReadItem(  char * theString, const char *itemCode )\n{\n   \/\/cout << \"ReadItem( char )...\";\n   char headerLine[kMaxNameLength];\n   \n   assert( infile.good() );\n\n   \/\/ look for itemCode\n   readUntilKeyword(headerLine, infile, itemCode);\n   if ( infile.eof() || infile.bad() )\n     goto fail;\n\n   \/\/ skip any comment and read value\n   do {\n     readLine(headerLine, infile);\n   } while( !infile.eof() && !infile.bad() &&\n\t    ( headerLine[0]==kCommentMark ) );\n   if( headerLine[0]!=kCommentMark )\n     {\n       strcpy(theString,headerLine);\n       if (inoutfile_opened)\n\t inoutfile << itemCode << endl << theString << endl;\n     }\n   else\n     {\n       goto fail;\n     }\n   infile.seekg( 0, ios::beg );\n   return;\n\n fail:\n   cerr << \"I expected to read the parameter '\" << itemCode\n\t<< \"', but reached EOF first\" << endl;\n   ReportFatalError( \"Missing parameter in input file\" );\n}\n<commit_msg>Arnaud: added anotations to suppress warnings emitted by the Intel C++ compiler<commit_after>\/****************************************************************************\\\n**\n**  tInputFile.cpp: Member functions for class tInputFile.\n**\n**  (see tInputFile.h for a description of this class)\n**\n**  Greg Tucker, November 1997\n**\n**  $Id: tInputFile.cpp,v 1.19 2002-12-12 10:13:34 childcvs Exp $\n\\****************************************************************************\/\n\n#if !defined(HAVE_NO_NAMESPACE)\n# include <iostream>\nusing namespace std;\n#else\n# include <iostream.h>\n#endif\n#include \"..\/tAssert.h\"\n#include <string.h>\n#include <stdlib.h>\n#include <time.h>\n\n\/\/#include \"..\/Definitions.h\"\n\/\/#include \"..\/Classes.h\"\n#include \"tInputFile.h\"\n#include \"..\/errors\/errors.h\"\n\n\n\/****************************************************************************\\\n**\n**  tInputFile Constructor\n**\n**  Looks for a file called filename, opens it if found or generates an\n**  error if not. Then reads the base name for output files and creates\n**  a file called <filename>.inputs which will act as a log file for\n**  parameters read. (This is often useful when the original input file\n**  gets lost or modified).\n**\n**  Modifications:\n**    - 2\/02: error check for inoutfile added (GT)\n**\n\\****************************************************************************\/\ntInputFile::tInputFile( const char *filename )\n  :\n  infile(), inoutfile(), inoutfile_opened(false)\n{\n   char inoutname[kMaxNameLength];\n\n   \/\/ Open file\n   infile.open( filename );\n   if( !infile.good() )\n   {\n      cerr << \"tInputFile::tInputFile: Unable to open '\" << filename << \"'.\" << endl;\n      ReportFatalError( \"The file may not exist or may be mis-named.\" );\n   }\n\n   \/\/ Create log file for inputs\n   ReadItem( inoutname, \"OUTFILENAME\" );\n   strcat( inoutname, \".inputs\" );\n   inoutfile.open( inoutname );\n   if( !inoutfile.good() )\n     {\n       cerr << \"Unable to open '\" << inoutname << \"'.\\n\";\n       cerr << \"(Error generated in module tInputFile, function tInputFile::tInputFile( const char * ) )\\n\";\n       ReportFatalError( \"The specified path name may not exist.\\n\" );\n     }\n \n   {\n     const time_t now = time(NULL);\n     char *p = ctime(&now);\n     *strchr(p, '\\n') = '\\0';\n     inoutfile << \"# Created by CHILD on \" << p << \".\" << endl;\n   }\n   inoutfile_opened = true;\n}\n\n\/****************************************************************************\\\n**\n**  tInputFile::ReadItem\n**\n**  Reads one parameter from the file. The format is assumed to be a line\n**  of text that begins with the code \"itemCode\", followed by a line containing\n**  the parameter to be read. The function is overloaded according to the\n**  type of data desired (datType simply governs which overloaded function\n**  will be called; it is not used by the routines).\n**\n**  Inputs:  datType -- dummy variable indicating the data type to be read\n**                      (in the case of the string version, the string read\n**                      is placed here)\n**           itemCode -- string that describes the parameter to be read\n**  Returns:  the item read (except in the case of the string version)\n**  Modifications:\n**    - revised to allow arbitrary ordering of items in infile and\/or\n**      ReadItem calls in code; routine searches through\n**      list until it either finds the right itemCode or reaches EOF.\n**      12\/23\/97 SL\n**\n\\****************************************************************************\/\n\/\/ read a line in headerLine and discards the any remaining characters\nstatic\nvoid readLine(char *headerLine, ifstream& infile){\n  infile.getline( headerLine, kMaxNameLength );\n  \/\/ still some characters left on the current line ?\n  if ( !infile.eof() && !infile.bad() && infile.rdstate() & ios::failbit){\n    \/\/ clear failbit\n    infile.clear(infile.rdstate() & ~ios::failbit);\n    \/\/ discard characters.\n    char c;\n    while( infile.get(c) && c != '\\n');\n  }\n}\n\nstatic\nvoid readUntilKeyword(char *headerLine, ifstream& infile,\n\t\t      const char *itemCode){\n  do {\n    readLine(headerLine, infile);\n  } while( !infile.eof() && !infile.bad() &&\n\t   ( headerLine[0]==kCommentMark ||\n\t     strncmp( itemCode, headerLine, strlen( itemCode ) )!=0 ) );\n}\n\nstatic\nvoid skipCommentsAndReadValue(char *headerLine, ifstream& infile){\n  do {\n    readLine(headerLine, infile);\n  } while( !infile.eof() && !infile.bad() &&\n\t   ( headerLine[0]==kCommentMark ) );\n}\n\n\nint tInputFile::ReadItem( const int & \/*datType*\/, const char *itemCode )\n{\n   \/\/cout << \"ReadItem( int )...\";\n   int item;\n   char headerLine[kMaxNameLength];\n   \n   assert( infile.good() );\n\n   \/\/ look for itemCode\n   readUntilKeyword(headerLine, infile, itemCode);\n   if ( infile.eof() || infile.bad() )\n     goto fail;\n\n   \/\/ skip any comment and read value\n   skipCommentsAndReadValue(headerLine, infile);\n   if( headerLine[0]!=kCommentMark )\n     {\n       item = atoi(headerLine);\n       if (inoutfile_opened)\n\t inoutfile << itemCode << endl << item << endl;\n     }\n   else\n     {\n       goto fail;\n     }\n   infile.seekg( 0, ios::beg );\n   return item;\n   \n fail:\n   cerr << \"I expected to read the parameter '\" << itemCode\n\t<< \"', but reached EOF first\" << endl;\n   ReportFatalError( \"Missing parameter in input file\" );\n   \/*NOTREACHED*\/\n}\n\nlong tInputFile::ReadItem( const long & \/*datType*\/, const char *itemCode )\n{\n   \/\/cout << \"ReadItem( long )...\";\n   long item;\n   char headerLine[kMaxNameLength];\n  \n   assert( infile.good() );\n  \n   \/\/ look for itemCode\n   readUntilKeyword(headerLine, infile, itemCode);\n   if ( infile.eof() || infile.bad() )\n     goto fail;\n\n   \/\/ skip any comment and read value\n   skipCommentsAndReadValue(headerLine, infile);\n   if( headerLine[0]!=kCommentMark )\n     {\n       item = atol(headerLine);\n       if (inoutfile_opened)\n\t inoutfile << itemCode << endl << item << endl;\n     }\n   else\n     {\n       goto fail;\n     }\n   infile.seekg( 0, ios::beg );\n   return item;\n\n fail:\n   cerr << \"I expected to read the parameter '\" << itemCode\n\t<< \"', but reached EOF first\" << endl;\n   ReportFatalError( \"Missing parameter in input file\" );\n   \/*NOTREACHED*\/\n}\n\ndouble tInputFile::ReadItem( const double & \/*datType*\/, const char *itemCode )\n{\n   \/\/cout << \"ReadItem( double )...\";\n   double item;\n   char headerLine[kMaxNameLength];\n   \n   assert( infile.good() );\n  \n   \/\/ look for itemCode\n   readUntilKeyword(headerLine, infile, itemCode);\n   if ( infile.eof() || infile.bad() )\n     goto fail;\n\n   \/\/ skip any comment and read value\n   skipCommentsAndReadValue(headerLine, infile);\n   if( headerLine[0]!=kCommentMark )\n     {\n       item = atof(headerLine);\n       if (inoutfile_opened)\n\t inoutfile << itemCode << endl << item << endl;\n     }\n   else\n     {\n       goto fail;\n     }\n   infile.seekg( 0, ios::beg );\n   return item;\n\n fail:\n   cerr << \"I expected to read the parameter '\" << itemCode\n\t<< \"', but reached EOF first\" << endl;\n   ReportFatalError( \"Missing parameter in input file\" );\n   \/*NOTREACHED*\/\n}\n\n\nvoid tInputFile::ReadItem(  char * theString, const char *itemCode )\n{\n   \/\/cout << \"ReadItem( char )...\";\n   char headerLine[kMaxNameLength];\n   \n   assert( infile.good() );\n\n   \/\/ look for itemCode\n   readUntilKeyword(headerLine, infile, itemCode);\n   if ( infile.eof() || infile.bad() )\n     goto fail;\n\n   \/\/ skip any comment and read value\n   do {\n     readLine(headerLine, infile);\n   } while( !infile.eof() && !infile.bad() &&\n\t    ( headerLine[0]==kCommentMark ) );\n   if( headerLine[0]!=kCommentMark )\n     {\n       strcpy(theString,headerLine);\n       if (inoutfile_opened)\n\t inoutfile << itemCode << endl << theString << endl;\n     }\n   else\n     {\n       goto fail;\n     }\n   infile.seekg( 0, ios::beg );\n   return;\n\n fail:\n   cerr << \"I expected to read the parameter '\" << itemCode\n\t<< \"', but reached EOF first\" << endl;\n   ReportFatalError( \"Missing parameter in input file\" );\n   \/*NOTREACHED*\/\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef __TILE_INTERFACE_HPP\n#define __TILE_INTERFACE_HPP\n\n\/**\n * @author K\/OURIO Alexandre <kourio.alexandre@gmail.com>\n * *\/\n\n\n\nclass BoardInterface;\nclass Board;\nclass Bot;\n\n\nclass TileInterface{\n\t\npublic:\n\n\tvirtual ~TileInterface();\n\n\t\n\t\/**\n\t *\tGet the Board the tile is in\n\t * \n\t *\t@return Board*\n\t *\/\n\tvirtual const Board* getBoard() const =0;\t\n\tvirtual Board* getBoard() =0;\n\t\n\t\/**\n\t *\tGet the bot on the tile\n\t * \n\t *\t@return Bot* or nullptr if no bot on the tile\n\t *\/\n\tvirtual const Bot* getBot() const =0;\n\tvirtual Bot* getBot() =0;\n\t\n\t\/**\n\t *\tIf there is nothing on the tile\n\t * \n\t *\t@return bool\n\t *\/\n\tvirtual bool isFree() const =0;\n\t\n\t\/**\n\t *\tCalled when a bot enters the tile\n\t * \n\t * \t@throws TileNotFreeException - the tile isn't free.\n\t * \n\t * \t@param Bot& bot The bot that enters the tile\n\t *\/\n\tvirtual void onEnter(Bot& bot) =0;\n\t\n\t\/**\n\t *\tCalled when a bot leaves the tile\n\t * \n\t * \t@throws TileFreeException - No Bot on tile so it can't leave it\n\t * \n\t * \t@param Bot& bot The bot that leaves the tile\n\t *\/\n\tvirtual void onExit(Bot& bot) =0;\n\t\n}\n\n\n\n#endif\n<commit_msg>Ajout de la fonction de copy #2<commit_after>#ifndef __TILE_INTERFACE_HPP\n#define __TILE_INTERFACE_HPP\n\n\/**\n * @author K\/OURIO Alexandre <kourio.alexandre@gmail.com>\n * *\/\n\n\n\nclass BoardInterface;\nclass Board;\nclass Bot;\n\n\nclass TileInterface{\n\t\npublic:\n\n\tvirtual ~TileInterface();\n\n\t\n\t\/**\n\t *\tGet the Board the tile is in\n\t * \n\t *\t@return Board*\n\t *\/\n\tvirtual const Board* getBoard() const =0;\t\n\tvirtual Board* getBoard() =0;\n\t\n\t\/**\n\t *\tGet the bot on the tile\n\t * \n\t *\t@return Bot* or nullptr if no bot on the tile\n\t *\/\n\tvirtual const Bot* getBot() const =0;\n\tvirtual Bot* getBot() =0;\n\t\n\t\/**\n\t *\tIf there is nothing on the tile\n\t * \n\t *\t@return bool\n\t *\/\n\tvirtual bool isFree() const =0;\n\t\n\t\/**\n\t *\tCalled when a bot enters the tile\n\t * \n\t * \t@throws TileNotFreeException - the tile isn't free.\n\t * \n\t * \t@param Bot& bot The bot that enters the tile\n\t *\/\n\tvirtual void onEnter(Bot& bot) =0;\n\t\n\t\/**\n\t *\tCalled when a bot leaves the tile\n\t * \n\t * \t@throws TileFreeException - No Bot on tile so it can't leave it\n\t * \n\t * \t@param Bot& bot The bot that leaves the tile\n\t *\/\n\tvirtual void onExit(Bot& bot) =0;\n\t\n\t\n\t\n\t\/**\n\t *\tReturn a copy of the tile\n\t * \n\t * \t@return TileInterface* - A real copy of the tile\n\t *\/\n\tvirtual TileInterface* copy() const;\n}\n\n\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"TopoJSONLoader.h\"\n\n#include \"PlanarGraph.h\"\n#include \"ArcData2D.h\"\n\n#include <Table.h>\n#include <SRID.h>\n\n#include <sstream>\n#include <cassert>\n#include <iostream>\n#include <cmath>\n\n#include <glm\/glm.hpp>\n\nusing namespace std;\n\nTopoJSONLoader::TopoJSONLoader() : FileTypeHandler(\"TopoJSON\", false) {\n  addExtension(\"json\");\n}\n\nvoid\nTopoJSONLoader::handleCollection(const string & parent_id, Graph & graph, map<string, int> & nodes, map<int, vector<int> > & connections, Json::Value & objects, const vector<ArcData2D> & arc_data) {\n  \/\/ ColumnArc & ag = dynamic_cast<ColumnArc &>(graph.getEdgeData()[\"_geometry\"]);\n\n  for (Json::ValueIterator it = objects.begin() ; it != objects.end() ; it++ ) {\n    Json::Value object = *it;\n    assert(object.type() == Json::objectValue);\n    string type = object[\"type\"].asString();\n    string id_text = object[\"id\"].asString();\n\n    id_text = parent_id + \"\/\" + id_text;\n\n    cerr << \"got type \" << type << \", id \" << id_text << endl;\n\n    if (type == \"Point\") {\n      Json::Value coordinates = object[\"coordinates\"];\n      glm::vec3 v(coordinates[0].asDouble(), coordinates[1].asDouble(), 0);\n      ostringstream key;\n      key << v.x << \"\/\" << v.y;\n      map<string, int>::iterator it = nodes.find(key.str());\n      if (it != nodes.end()) {\n\tgraph.getNodeArray().getTable()[\"id\"].setValue(it->second, id_text);\n      } else {\n\tint node_id = nodes[key.str()] = graph.addNode();\n\tgraph.getNodeArray().getTable()[\"id\"].setValue(it->second, id_text);\n\tgraph.getNodeArray().setPosition(node_id, v);\n      }\n    } else if (type == \"MultiPoint\") {\n      assert(0);\n    } else if (type == \"GeometryCollection\") {\n      Json::Value geometries = object[\"geometries\"];\n      handleCollection(id_text, graph, nodes, connections, geometries, arc_data);\n    } else {\n      Json::Value arcs = object[\"arcs\"];\n      assert(arcs.type() == Json::arrayValue);\n      if (type == \"LineString\" || type == \"MultiLineString\") {\n\tcerr << \"skipping linestring\\n\";\n#if 0\n\tint n = 0;\n\tfor (unsigned int i = 0; i < arcs.size(); i++) {\n\t  int arc_id = arcs[i].asInt();\n\t  bool rev = false; \n\t  if (arc_id < 0) {\n\t    arc_id = -arc_id - 1;\n\t    rev = true;\n\t  }\n\t  const Arc & arc = arc_data[arc_id];\n\t  pair<int, int> arc_nodes = createNodesForArc(arc, graph, nodes, rev);\n\t  \n\t  vector<int> & v = connections[arc_id];\n\t  assert(v.size() <= 1);\n\t  int target_id = v.size() ? v[0] : -1;\n\t  assert(target_id != node_id);\n\t  v.push_back(node_id);\n\t  if (target_id == -1) continue;\n\t  int arc_id = graph.addArcGeometry(arc); \/\/ should only be created once\n\t  int edge_id = rev ? graph.addEdge(target_id, node_id, -1, 1.0f, -arc_id) : graph.addEdge(node_id, target_id, -1, 1.0f, arc_id);\n\t}\n#endif\n      } else if (type == \"Polygon\")  {\n\tint region_id = graph.addRegion();\n\tif (!id_text.empty()) {\n\t  graph.getRegionData()[\"id\"].setValue(region_id, id_text);\n\t}\n\tfor (unsigned int i = 0; i < arcs.size(); i++) {\n\t  int face_id = graph.addFace(region_id);\n\t  Json::Value ring = arcs[i];\n\t  assert(ring.type() == Json::arrayValue);\n\t  for (unsigned int j = 0; j < ring.size(); j++) {\n\t    int arc_id = ring[j].asInt();\n\t    bool rev = false;\t    \n\t    if (arc_id < 0) {\n\t      arc_id = -arc_id - 1;\n\t      rev = true;\n\t    }\n\t    const ArcData2D & arc = arc_data[arc_id];\n\t    pair<int, int> arc_nodes = createNodesForArc(arc, graph, nodes, rev);\n\t    vector<int> & v = connections[arc_id];\n\t    assert(v.size() <= 1);\n\t    int target_id = v.size() ? v[0] : -1;\n\t    assert(target_id != face_id);\n\t    v.push_back(face_id);\n\t    if (target_id == -1) continue;\n\t    int arc_id2 = graph.addArcGeometry(arc); \/\/ should only be created once\n\t    int edge_id = !rev ? graph.addEdge(arc_nodes.first, arc_nodes.second, face_id, 1.0f, arc_id2) : graph.addEdge(arc_nodes.first, arc_nodes.second, face_id, 1.0f, -arc_id2);\n\t    \/\/ add target_id\n\t    \/\/ ag.setArc(edge_id, arc);\n\t  }\n\t}\n      } else if (type == \"MultiPolygon\") {\n\tint region_id = graph.addRegion();\n\tif (!id_text.empty()) {\n\t  graph.getRegionData()[\"id\"].setValue(region_id, id_text);\n\t}\n \tfor (unsigned int h = 0; h < arcs.size(); h++) {\n\t  Json::Value polygon = arcs[h];\n\t  int face_id = graph.addFace(region_id);\n\t  assert(polygon.type() == Json::arrayValue);\n\t  for (unsigned int i = 0; i < polygon.size(); i++) {\n\t    Json::Value ring = polygon[i];\n\t    assert(ring.type() == Json::arrayValue);\n\t    for (unsigned int j = 0; j < ring.size(); j++) {\n\t      int arc_id = ring[j].asInt();\n\t      bool rev = false;\n\t      if (arc_id < 0) {\n\t\tarc_id = -arc_id - 1;\n\t\trev = true;\n\t      }\n\t      const ArcData2D & arc = arc_data[arc_id];\n\t      pair<int, int> arc_nodes = createNodesForArc(arc, graph, nodes, rev);\n\t      vector<int> & v = connections[arc_id];\n\t      if (v.size() > 1) {\n\t\tcerr << \"multiple connections(\" << v.size() << \")\\n\";\n\t      }\n\t      int target_id = v.size() ? v[0] : -1;\n\t      if (target_id == face_id) {\n\t\ttarget_id = -1;\n\t      } else {\n\t\tv.push_back(face_id);\n\t      }\n\t      if (target_id == -1) continue;\n\t      int arc_id2 = graph.addArcGeometry(arc); \/\/ create only once\n\t      int edge_id = rev ? graph.addEdge(arc_nodes.first, arc_nodes.second, face_id, 1.0f, -arc_id2) : graph.addEdge(arc_nodes.first, arc_nodes.second, face_id, 1.0f, arc_id2);\n\t      \/\/ target_id, \n\t      \/\/ ag.setArc(edge_id, arc);\n\t    }\t    \n\t  }\n\t}\t\n      } else {\n\tcerr << \"unhandled type \" << type << \"\\n\";\n\tassert(0);\n      }\n    }\n  }\n}\n\nstd::shared_ptr<Graph>\nTopoJSONLoader::openGraph(const char * filename) {\n  FILE * in = fopen(filename, \"rt\");\n  string json;\n  char buffer[4096];\n  while (!feof(in)) {\n    size_t r = fread(buffer, 1, 4096, in);\n    if (!r) {\n      break;\n    } else {\n      json += string(buffer, r);\n    }\n  }\n  \n  Json::Reader reader;\n  Json::Value root;\n  if (!reader.parse( json, root )) {\n    cerr << \"TopoJSONLoader.cpp: malformed json: \" << json << endl;\n    assert(0);\n  }\n  \n  string root_type = root[\"type\"].asString();\n  Json::Value transform = root[\"transform\"];\n  Json::Value objects = root[\"objects\"];\n  Json::Value arcs = root[\"arcs\"];\n\n  auto graph = std::make_shared<PlanarGraph>();\n  graph->setNodeArray(std::make_shared<NodeArray>());\n  graph->setHasSpatialData(true);\n  graph->setHasArcData(true);\n  graph->getNodeArray().getTable().addTextColumn(\"id\");\n  \n  assert(root_type == \"Topology\");\n\n  double scale_x = 1, scale_y = 1, translate_x = 0, translate_y = 0;\n  if (transform.type() == Json::objectValue) {\n    scale_x = transform[\"scale\"][0].asDouble();\n    scale_y = transform[\"scale\"][1].asDouble();\n    translate_x = transform[\"translate\"][0].asDouble();\n    translate_y = transform[\"translate\"][1].asDouble();\n  }\n\n  \/\/ graph->getEdgeData().addArcColumn(\"_geometry\");\n  graph->getFaceData().addTextColumn(\"id\");  \n  graph->getRegionData().addTextColumn(\"id\");\n  \n  map<string, int> nodes;\n  map<int, vector<int> > connections;\n\n  vector<ArcData2D> arc_data;\n  for (unsigned int i = 0; i < arcs.size(); i++) {\n    Json::Value d = arcs[i];\n    assert(d.type() == Json::arrayValue);\n    ArcData2D arc;\n    double x = 0, y = 0;\n    for (unsigned int j = 0; j < d.size(); j++) {\n      Json::Value p = d[j];\n      assert(p.type() == Json::arrayValue);\n      x += p[0].asDouble();\n      y += p[1].asDouble();\n      arc.data.push_back(glm::dvec2(x * scale_x + translate_x,\n\t\t\t\t    y * scale_y + translate_y\n\t\t\t\t    ));\n    }\n    arc_data.push_back(arc);\n  }\n\n  handleCollection(\"\", *graph, nodes, connections, objects, arc_data);\n\n  return graph;\n}\n<commit_msg>remove regions<commit_after>#include \"TopoJSONLoader.h\"\n\n#include \"PlanarGraph.h\"\n#include \"ArcData2D.h\"\n\n#include <Table.h>\n#include <SRID.h>\n\n#include <sstream>\n#include <cassert>\n#include <iostream>\n#include <cmath>\n\n#include <glm\/glm.hpp>\n\nusing namespace std;\n\nTopoJSONLoader::TopoJSONLoader() : FileTypeHandler(\"TopoJSON\", false) {\n  addExtension(\"json\");\n}\n\nvoid\nTopoJSONLoader::handleCollection(const string & parent_id, Graph & graph, map<string, int> & nodes, map<int, vector<int> > & connections, Json::Value & objects, const vector<ArcData2D> & arc_data) {\n  \/\/ ColumnArc & ag = dynamic_cast<ColumnArc &>(graph.getEdgeData()[\"_geometry\"]);\n\n  for (Json::ValueIterator it = objects.begin() ; it != objects.end() ; it++ ) {\n    Json::Value object = *it;\n    assert(object.type() == Json::objectValue);\n    string type = object[\"type\"].asString();\n    string id_text = object[\"id\"].asString();\n\n    id_text = parent_id + \"\/\" + id_text;\n\n    cerr << \"got type \" << type << \", id \" << id_text << endl;\n\n    if (type == \"Point\") {\n      Json::Value coordinates = object[\"coordinates\"];\n      glm::vec3 v(coordinates[0].asDouble(), coordinates[1].asDouble(), 0);\n      ostringstream key;\n      key << v.x << \"\/\" << v.y;\n      map<string, int>::iterator it = nodes.find(key.str());\n      if (it != nodes.end()) {\n\tgraph.getNodeArray().getTable()[\"id\"].setValue(it->second, id_text);\n      } else {\n\tint node_id = nodes[key.str()] = graph.addNode();\n\tgraph.getNodeArray().getTable()[\"id\"].setValue(it->second, id_text);\n\tgraph.getNodeArray().setPosition(node_id, v);\n      }\n    } else if (type == \"MultiPoint\") {\n      assert(0);\n    } else if (type == \"GeometryCollection\") {\n      Json::Value geometries = object[\"geometries\"];\n      handleCollection(id_text, graph, nodes, connections, geometries, arc_data);\n    } else {\n      Json::Value arcs = object[\"arcs\"];\n      assert(arcs.type() == Json::arrayValue);\n      if (type == \"LineString\" || type == \"MultiLineString\") {\n\tcerr << \"skipping linestring\\n\";\n#if 0\n\tint n = 0;\n\tfor (unsigned int i = 0; i < arcs.size(); i++) {\n\t  int arc_id = arcs[i].asInt();\n\t  bool rev = false; \n\t  if (arc_id < 0) {\n\t    arc_id = -arc_id - 1;\n\t    rev = true;\n\t  }\n\t  const Arc & arc = arc_data[arc_id];\n\t  pair<int, int> arc_nodes = createNodesForArc(arc, graph, nodes, rev);\n\t  \n\t  vector<int> & v = connections[arc_id];\n\t  assert(v.size() <= 1);\n\t  int target_id = v.size() ? v[0] : -1;\n\t  assert(target_id != node_id);\n\t  v.push_back(node_id);\n\t  if (target_id == -1) continue;\n\t  int arc_id = graph.addArcGeometry(arc); \/\/ should only be created once\n\t  int edge_id = rev ? graph.addEdge(target_id, node_id, -1, 1.0f, -arc_id) : graph.addEdge(node_id, target_id, -1, 1.0f, arc_id);\n\t}\n#endif\n      } else if (type == \"Polygon\")  {\n\tint face_id = graph.addFace();\n\t\/\/ int region_id = graph.addRegion();\n\tif (!id_text.empty()) {\n\t  graph.getFaceData()[\"id\"].setValue(face_id, id_text);\n\t}\n\tfor (unsigned int i = 0; i < arcs.size(); i++) {\n\t  Json::Value ring = arcs[i];\n\t  assert(ring.type() == Json::arrayValue);\n\t  for (unsigned int j = 0; j < ring.size(); j++) {\n\t    int arc_id = ring[j].asInt();\n\t    bool rev = false;\t    \n\t    if (arc_id < 0) {\n\t      arc_id = -arc_id - 1;\n\t      rev = true;\n\t    }\n\t    const ArcData2D & arc = arc_data[arc_id];\n\t    pair<int, int> arc_nodes = createNodesForArc(arc, graph, nodes, rev);\n\t    vector<int> & v = connections[arc_id];\n\t    assert(v.size() <= 1);\n\t    int target_id = v.size() ? v[0] : -1;\n\t    assert(target_id != face_id);\n\t    v.push_back(face_id);\n\t    if (target_id == -1) continue;\n\t    int arc_id2 = graph.addArcGeometry(arc); \/\/ should only be created once\n\t    int edge_id = !rev ? graph.addEdge(arc_nodes.first, arc_nodes.second, face_id, 1.0f, arc_id2) : graph.addEdge(arc_nodes.first, arc_nodes.second, face_id, 1.0f, -arc_id2);\n\t    \/\/ add target_id\n\t    \/\/ ag.setArc(edge_id, arc);\n\t  }\n\t}\n      } else if (type == \"MultiPolygon\") {\n\tint face_id = graph.addFace();\n\t\/\/ int region_id = graph.addRegion();\n\tif (!id_text.empty()) {\n\t  graph.getFaceData()[\"id\"].setValue(face_id, id_text);\n\t}\n \tfor (unsigned int h = 0; h < arcs.size(); h++) {\n\t  Json::Value polygon = arcs[h];\n\t  \/\/ int face_id = graph.addFace(region_id);\n\t  assert(polygon.type() == Json::arrayValue);\n\t  for (unsigned int i = 0; i < polygon.size(); i++) {\n\t    Json::Value ring = polygon[i];\n\t    assert(ring.type() == Json::arrayValue);\n\t    for (unsigned int j = 0; j < ring.size(); j++) {\n\t      int arc_id = ring[j].asInt();\n\t      bool rev = false;\n\t      if (arc_id < 0) {\n\t\tarc_id = -arc_id - 1;\n\t\trev = true;\n\t      }\n\t      const ArcData2D & arc = arc_data[arc_id];\n\t      pair<int, int> arc_nodes = createNodesForArc(arc, graph, nodes, rev);\n\t      vector<int> & v = connections[arc_id];\n\t      if (v.size() > 1) {\n\t\tcerr << \"multiple connections(\" << v.size() << \")\\n\";\n\t      }\n\t      int target_id = v.size() ? v[0] : -1;\n\t      if (target_id == face_id) {\n\t\ttarget_id = -1;\n\t      } else {\n\t\tv.push_back(face_id);\n\t      }\n\t      if (target_id == -1) continue;\n\t      int arc_id2 = graph.addArcGeometry(arc); \/\/ create only once\n\t      int edge_id = rev ? graph.addEdge(arc_nodes.first, arc_nodes.second, face_id, 1.0f, -arc_id2) : graph.addEdge(arc_nodes.first, arc_nodes.second, face_id, 1.0f, arc_id2);\n\t      \/\/ target_id, \n\t      \/\/ ag.setArc(edge_id, arc);\n\t    }\t    \n\t  }\n\t}\t\n      } else {\n\tcerr << \"unhandled type \" << type << \"\\n\";\n\tassert(0);\n      }\n    }\n  }\n}\n\nstd::shared_ptr<Graph>\nTopoJSONLoader::openGraph(const char * filename) {\n  FILE * in = fopen(filename, \"rt\");\n  string json;\n  char buffer[4096];\n  while (!feof(in)) {\n    size_t r = fread(buffer, 1, 4096, in);\n    if (!r) {\n      break;\n    } else {\n      json += string(buffer, r);\n    }\n  }\n  \n  Json::Reader reader;\n  Json::Value root;\n  if (!reader.parse( json, root )) {\n    cerr << \"TopoJSONLoader.cpp: malformed json: \" << json << endl;\n    assert(0);\n  }\n  \n  string root_type = root[\"type\"].asString();\n  Json::Value transform = root[\"transform\"];\n  Json::Value objects = root[\"objects\"];\n  Json::Value arcs = root[\"arcs\"];\n\n  auto graph = std::make_shared<PlanarGraph>();\n  graph->setNodeArray(std::make_shared<NodeArray>());\n  graph->setHasSpatialData(true);\n  graph->setHasArcData(true);\n  graph->getNodeArray().getTable().addTextColumn(\"id\");\n  \n  assert(root_type == \"Topology\");\n\n  double scale_x = 1, scale_y = 1, translate_x = 0, translate_y = 0;\n  if (transform.type() == Json::objectValue) {\n    scale_x = transform[\"scale\"][0].asDouble();\n    scale_y = transform[\"scale\"][1].asDouble();\n    translate_x = transform[\"translate\"][0].asDouble();\n    translate_y = transform[\"translate\"][1].asDouble();\n  }\n\n  \/\/ graph->getEdgeData().addArcColumn(\"_geometry\");\n  graph->getFaceData().addTextColumn(\"id\");  \n  \/\/ graph->getRegionData().addTextColumn(\"id\");\n  \n  map<string, int> nodes;\n  map<int, vector<int> > connections;\n\n  vector<ArcData2D> arc_data;\n  for (unsigned int i = 0; i < arcs.size(); i++) {\n    Json::Value d = arcs[i];\n    assert(d.type() == Json::arrayValue);\n    ArcData2D arc;\n    double x = 0, y = 0;\n    for (unsigned int j = 0; j < d.size(); j++) {\n      Json::Value p = d[j];\n      assert(p.type() == Json::arrayValue);\n      x += p[0].asDouble();\n      y += p[1].asDouble();\n      arc.data.push_back(glm::dvec2(x * scale_x + translate_x,\n\t\t\t\t    y * scale_y + translate_y\n\t\t\t\t    ));\n    }\n    arc_data.push_back(arc);\n  }\n\n  handleCollection(\"\", *graph, nodes, connections, objects, arc_data);\n\n  return graph;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"UpdaterOptions.h\"\n\n#include \"Log.h\"\n#include \"AnyOption\/anyoption.h\"\n#include \"FileUtils.h\"\n#include \"Platform.h\"\n#include \"StringUtils.h\"\n\n#include <cstdlib>\n#include <iostream>\n\n#ifdef PLATFORM_WINDOWS\nlong long atoll(const char* string)\n{\n\treturn _atoi64(string);\n}\n#endif\n\nUpdaterOptions::UpdaterOptions()\n: mode(UpdateInstaller::Setup)\n, waitPid(0)\n, showVersion(false)\n, forceElevated(false)\n, autoClose(false)\n{\n}\n\nUpdateInstaller::Mode stringToMode(const std::string& modeStr)\n{\n\tif (modeStr == \"main\")\n\t{\n\t\treturn UpdateInstaller::Main;\n\t}\n\telse\n\t{\n\t\tif (!modeStr.empty())\n\t\t{\n\t\t\tLOG(Error,\"Unknown mode \" + modeStr);\n\t\t}\n\t\treturn UpdateInstaller::Setup;\n\t}\n}\n\nvoid UpdaterOptions::parseOldFormatArg(const std::string& arg, std::string* key, std::string* value)\n{\n\tsize_t pos = arg.find('=');\n\tif (pos != std::string::npos)\n\t{\n\t\t*key = arg.substr(0,pos);\n\t\t*value = arg.substr(pos+1);\n\t}\n}\n\n\/\/ this is a compatibility function to allow the updater binary\n\/\/ to be involved by legacy versions of Mendeley Desktop\n\/\/ which used a different syntax for the updater's command-line\n\/\/ arguments\nvoid UpdaterOptions::parseOldFormatArgs(int argc, char** argv)\n{\n\tfor (int i=0; i < argc; i++)\n\t{\n\t\tstd::string key;\n\t\tstd::string value;\n\n\t\tparseOldFormatArg(argv[i],&key,&value);\n\n\t\tif (key == \"CurrentDir\")\n\t\t{\n\t\t\t\/\/ CurrentDir is the directory containing the main application\n\t\t\t\/\/ binary.  On Mac and Linux this differs from the root of\n\t\t\t\/\/ the installation directory\n\n#if defined(PLATFORM_LINUX) || defined(PLATFORM_FREEBSD)\n\t\t\t\/\/ the main binary is in lib\/mendeleydesktop\/libexec,\n\t\t\t\/\/ go up 3 levels\n\t\t\tinstallDir = FileUtils::canonicalPath((value + \"\/..\/..\/..\/\").c_str());\n#elif defined(PLATFORM_MAC)\n\t\t\t\/\/ the main binary is in Contents\/MacOS,\n\t\t\t\/\/ go up 2 levels\n\t\t\tinstallDir = FileUtils::canonicalPath((value + \"\/..\/..\/\").c_str());\n#elif defined(PLATFORM_WINDOWS)\n\t\t\t\/\/ the main binary is in the root of the install directory\n\t\t\tinstallDir = value;\n#endif\n\t\t}\n\t\telse if (key == \"TempDir\")\n\t\t{\n\t\t\tpackageDir = value;\n\t\t}\n\t\telse if (key == \"UpdateScriptFileName\")\n\t\t{\n\t\t\tscriptPath = value;\n\t\t}\n\t\telse if (key == \"AppFileName\")\n\t\t{\n\t\t\t\/\/ TODO - Store app file name\n\t\t}\n\t\telse if (key == \"PID\")\n\t\t{\n\t\t\twaitPid = static_cast<PLATFORM_PID>(atoll(value.c_str()));\n\t\t}\n\t\telse if (key == \"--main\")\n\t\t{\n\t\t\tmode = UpdateInstaller::Main;\n\t\t}\n\t}\n}\n\nvoid UpdaterOptions::parse(int argc, char** argv)\n{\n\tAnyOption parser;\n\tparser.setOption(\"install-dir\");\n\tparser.setOption(\"package-dir\");\n\tparser.setOption(\"script\");\n\tparser.setOption(\"wait\");\n\tparser.setOption(\"mode\");\n\tparser.setFlag(\"version\");\n\tparser.setFlag(\"force-elevated\");\n\tparser.setFlag(\"auto-close\");\n\n\tparser.processCommandArgs(argc,argv);\n\n\tif (parser.getValue(\"mode\"))\n\t{\n\t\tmode = stringToMode(parser.getValue(\"mode\"));\n\t}\n\tif (parser.getValue(\"install-dir\"))\n\t{\n\t\tinstallDir = parser.getValue(\"install-dir\");\n\t}\n\tif (parser.getValue(\"package-dir\"))\n\t{\n\t\tpackageDir = parser.getValue(\"package-dir\");\n\t}\n\tif (parser.getValue(\"script\"))\n\t{\n\t\tscriptPath = parser.getValue(\"script\");\n\t}\n\tif (parser.getValue(\"wait\"))\n\t{\n\t\twaitPid = static_cast<PLATFORM_PID>(atoll(parser.getValue(\"wait\")));\n\t}\n\n\tshowVersion = parser.getFlag(\"version\");\n\tforceElevated = parser.getFlag(\"force-elevated\");\n\tautoClose = parser.getFlag(\"auto-close\");\n\t\t\n\tif (installDir.empty())\n\t{\n\t\t\/\/ if no --install-dir argument is present, try parsing\n\t\t\/\/ the command-line arguments in the old format (which uses\n\t\t\/\/ a list of 'Key=Value' args)\n\t\tparseOldFormatArgs(argc,argv);\n\t}\n}\n\n<commit_msg>Avoid unnecessary redefinition of atoll() under MSVC 2013<commit_after>#include \"UpdaterOptions.h\"\n\n#include \"Log.h\"\n#include \"AnyOption\/anyoption.h\"\n#include \"FileUtils.h\"\n#include \"Platform.h\"\n#include \"StringUtils.h\"\n\n#include <cstdlib>\n#include <iostream>\n\n#if defined(PLATFORM_WINDOWS) && (_MSC_VER < 1800)\n\/\/ atoll() was added in MSVC 2013\nlong long atoll(const char* string)\n{\n\treturn _atoi64(string);\n}\n#endif\n\nUpdaterOptions::UpdaterOptions()\n: mode(UpdateInstaller::Setup)\n, waitPid(0)\n, showVersion(false)\n, forceElevated(false)\n, autoClose(false)\n{\n}\n\nUpdateInstaller::Mode stringToMode(const std::string& modeStr)\n{\n\tif (modeStr == \"main\")\n\t{\n\t\treturn UpdateInstaller::Main;\n\t}\n\telse\n\t{\n\t\tif (!modeStr.empty())\n\t\t{\n\t\t\tLOG(Error,\"Unknown mode \" + modeStr);\n\t\t}\n\t\treturn UpdateInstaller::Setup;\n\t}\n}\n\nvoid UpdaterOptions::parseOldFormatArg(const std::string& arg, std::string* key, std::string* value)\n{\n\tsize_t pos = arg.find('=');\n\tif (pos != std::string::npos)\n\t{\n\t\t*key = arg.substr(0,pos);\n\t\t*value = arg.substr(pos+1);\n\t}\n}\n\n\/\/ this is a compatibility function to allow the updater binary\n\/\/ to be involved by legacy versions of Mendeley Desktop\n\/\/ which used a different syntax for the updater's command-line\n\/\/ arguments\nvoid UpdaterOptions::parseOldFormatArgs(int argc, char** argv)\n{\n\tfor (int i=0; i < argc; i++)\n\t{\n\t\tstd::string key;\n\t\tstd::string value;\n\n\t\tparseOldFormatArg(argv[i],&key,&value);\n\n\t\tif (key == \"CurrentDir\")\n\t\t{\n\t\t\t\/\/ CurrentDir is the directory containing the main application\n\t\t\t\/\/ binary.  On Mac and Linux this differs from the root of\n\t\t\t\/\/ the installation directory\n\n#if defined(PLATFORM_LINUX) || defined(PLATFORM_FREEBSD)\n\t\t\t\/\/ the main binary is in lib\/mendeleydesktop\/libexec,\n\t\t\t\/\/ go up 3 levels\n\t\t\tinstallDir = FileUtils::canonicalPath((value + \"\/..\/..\/..\/\").c_str());\n#elif defined(PLATFORM_MAC)\n\t\t\t\/\/ the main binary is in Contents\/MacOS,\n\t\t\t\/\/ go up 2 levels\n\t\t\tinstallDir = FileUtils::canonicalPath((value + \"\/..\/..\/\").c_str());\n#elif defined(PLATFORM_WINDOWS)\n\t\t\t\/\/ the main binary is in the root of the install directory\n\t\t\tinstallDir = value;\n#endif\n\t\t}\n\t\telse if (key == \"TempDir\")\n\t\t{\n\t\t\tpackageDir = value;\n\t\t}\n\t\telse if (key == \"UpdateScriptFileName\")\n\t\t{\n\t\t\tscriptPath = value;\n\t\t}\n\t\telse if (key == \"AppFileName\")\n\t\t{\n\t\t\t\/\/ TODO - Store app file name\n\t\t}\n\t\telse if (key == \"PID\")\n\t\t{\n\t\t\twaitPid = static_cast<PLATFORM_PID>(atoll(value.c_str()));\n\t\t}\n\t\telse if (key == \"--main\")\n\t\t{\n\t\t\tmode = UpdateInstaller::Main;\n\t\t}\n\t}\n}\n\nvoid UpdaterOptions::parse(int argc, char** argv)\n{\n\tAnyOption parser;\n\tparser.setOption(\"install-dir\");\n\tparser.setOption(\"package-dir\");\n\tparser.setOption(\"script\");\n\tparser.setOption(\"wait\");\n\tparser.setOption(\"mode\");\n\tparser.setFlag(\"version\");\n\tparser.setFlag(\"force-elevated\");\n\tparser.setFlag(\"auto-close\");\n\n\tparser.processCommandArgs(argc,argv);\n\n\tif (parser.getValue(\"mode\"))\n\t{\n\t\tmode = stringToMode(parser.getValue(\"mode\"));\n\t}\n\tif (parser.getValue(\"install-dir\"))\n\t{\n\t\tinstallDir = parser.getValue(\"install-dir\");\n\t}\n\tif (parser.getValue(\"package-dir\"))\n\t{\n\t\tpackageDir = parser.getValue(\"package-dir\");\n\t}\n\tif (parser.getValue(\"script\"))\n\t{\n\t\tscriptPath = parser.getValue(\"script\");\n\t}\n\tif (parser.getValue(\"wait\"))\n\t{\n\t\twaitPid = static_cast<PLATFORM_PID>(atoll(parser.getValue(\"wait\")));\n\t}\n\n\tshowVersion = parser.getFlag(\"version\");\n\tforceElevated = parser.getFlag(\"force-elevated\");\n\tautoClose = parser.getFlag(\"auto-close\");\n\t\t\n\tif (installDir.empty())\n\t{\n\t\t\/\/ if no --install-dir argument is present, try parsing\n\t\t\/\/ the command-line arguments in the old format (which uses\n\t\t\/\/ a list of 'Key=Value' args)\n\t\tparseOldFormatArgs(argc,argv);\n\t}\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    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\n#include \"GrGLInterface.h\"\n\n#include <Windows.h>\n#include <GL\/GL.h>\n\n\/*\n * Windows makes the GL funcs all be __stdcall instead of __cdecl :(\n * This implementation will only work if GR_GL_FUNCTION_TYPE is __stdcall.\n * Otherwise, a springboard would be needed that hides the calling convention.\n *\/\n\n#define GR_GL_GET_PROC(F) gDefaultInterface.f ## F = (GrGLInterface::GrGL ## F ## Proc) wglGetProcAddress(\"gl\" #F);\n#define GR_GL_GET_PROC_SUFFIX(F, S) gDefaultInterface.f ## F = (GrGLInterface::GrGL ## F ## Proc) wglGetProcAddress(\"gl\" #F #S);\n\nvoid GrGLSetDefaultGLInterface() {\n    static GrGLInterface gDefaultInterface;\n    static bool gDefaultInterfaceInit;\n    if (!gDefaultInterfaceInit) {\n        \n        \/\/ wglGetProcAddress requires a context.\n        if (NULL != wglGetCurrentContext()) {\n            int major, minor;\n            const char* versionString = (const char*) glGetString(GL_VERSION);\n            const char* extString = (const char*) glGetString(GL_EXTENSIONS);\n            gl_version_from_string(&major, &minor, versionString);\n\n            if (major == 1 && minor < 5) {\n                \/\/ We must have array and element_array buffer objects.\n                return;\n            }\n\n            \/\/ Functions that are part of GL 1.1 will return NULL in \n            \/\/ wglGetProcAddress\n            gDefaultInterface.fBlendFunc = glBlendFunc;\n            gDefaultInterface.fClear = glClear;\n            gDefaultInterface.fClearColor = glClearColor;\n            gDefaultInterface.fClearStencil = glClearStencil;\n            gDefaultInterface.fColor4ub = glColor4ub;\n            gDefaultInterface.fColorMask = glColorMask;\n            gDefaultInterface.fColorPointer = glColorPointer;\n            gDefaultInterface.fCullFace = glCullFace;\n            gDefaultInterface.fDeleteTextures = glDeleteTextures;\n            gDefaultInterface.fDepthMask = glDepthMask;\n            gDefaultInterface.fDisable = glDisable;\n            gDefaultInterface.fDisableClientState = glDisableClientState;\n            gDefaultInterface.fDrawArrays = glDrawArrays;\n            gDefaultInterface.fDrawElements = glDrawElements;\n            gDefaultInterface.fEnable = glEnable;\n            gDefaultInterface.fEnableClientState = glEnableClientState;\n            gDefaultInterface.fFrontFace = glFrontFace;\n            gDefaultInterface.fGenTextures = glGenTextures;\n            gDefaultInterface.fGetError = glGetError;\n            gDefaultInterface.fGetIntegerv = glGetIntegerv;\n            gDefaultInterface.fGetString = glGetString;\n            gDefaultInterface.fLineWidth = glLineWidth;\n            gDefaultInterface.fLoadMatrixf = glLoadMatrixf;\n            gDefaultInterface.fMatrixMode = glMatrixMode;\n            gDefaultInterface.fPixelStorei = glPixelStorei;\n            gDefaultInterface.fPointSize = glPointSize;\n            gDefaultInterface.fReadPixels = glReadPixels;\n            gDefaultInterface.fScissor = glScissor;\n            gDefaultInterface.fShadeModel = glShadeModel;\n            gDefaultInterface.fStencilFunc = glStencilFunc;\n            gDefaultInterface.fStencilMask = glStencilMask;\n            gDefaultInterface.fStencilOp = glStencilOp;\n            gDefaultInterface.fTexImage2D = glTexImage2D;\n            gDefaultInterface.fTexParameteri = glTexParameteri;\n            gDefaultInterface.fTexCoordPointer = glTexCoordPointer;\n            gDefaultInterface.fTexEnvi = glTexEnvi;\n            gDefaultInterface.fTexSubImage2D = glTexSubImage2D;\n            gDefaultInterface.fViewport = glViewport;\n            gDefaultInterface.fVertexPointer = glVertexPointer;\n\n            GR_GL_GET_PROC(ActiveTexture);\n            GR_GL_GET_PROC(AttachShader);\n            GR_GL_GET_PROC(BindAttribLocation);\n            GR_GL_GET_PROC(BindBuffer);\n            GR_GL_GET_PROC(BindTexture);\n            GR_GL_GET_PROC(BlendColor);\n            GR_GL_GET_PROC(BufferData);\n            GR_GL_GET_PROC(BufferSubData);\n            GR_GL_GET_PROC(ClientActiveTexture);\n            GR_GL_GET_PROC(CompileShader);\n            GR_GL_GET_PROC(CompressedTexImage2D);\n            GR_GL_GET_PROC(CreateProgram);\n            GR_GL_GET_PROC(CreateShader);\n            GR_GL_GET_PROC(DeleteBuffers);\n            GR_GL_GET_PROC(DeleteProgram);\n            GR_GL_GET_PROC(DeleteShader);\n            GR_GL_GET_PROC(DisableVertexAttribArray);\n            GR_GL_GET_PROC(EnableVertexAttribArray);\n            GR_GL_GET_PROC(GenBuffers);\n            GR_GL_GET_PROC(GetBufferParameteriv);\n            GR_GL_GET_PROC(GetProgramInfoLog);\n            GR_GL_GET_PROC(GetProgramiv);\n            GR_GL_GET_PROC(GetShaderInfoLog);\n            GR_GL_GET_PROC(GetShaderiv);\n            GR_GL_GET_PROC(GetUniformLocation);\n            GR_GL_GET_PROC(LinkProgram);\n            GR_GL_GET_PROC(ShaderSource);\n            GR_GL_GET_PROC(StencilFuncSeparate);\n            GR_GL_GET_PROC(StencilMaskSeparate);\n            GR_GL_GET_PROC(StencilOpSeparate);\n            GR_GL_GET_PROC(Uniform1fv);\n            GR_GL_GET_PROC(Uniform1i);\n            GR_GL_GET_PROC(Uniform4fv);\n            GR_GL_GET_PROC(UniformMatrix3fv);\n            GR_GL_GET_PROC(UseProgram);\n            GR_GL_GET_PROC(VertexAttrib4fv);\n            GR_GL_GET_PROC(VertexAttribPointer);\n\n            \/\/ First look for GL3.0 FBO or GL_ARB_framebuffer_object (same since\n            \/\/ GL_ARB_framebuffer_object doesn't use ARB suffix.)\n            if (major >= 3 || has_gl_extension(\"GL_ARB_framebuffer_object\")) {\n                GR_GL_GET_PROC(GenFramebuffers);\n                GR_GL_GET_PROC(BindFramebuffer);\n                GR_GL_GET_PROC(FramebufferTexture2D);\n                GR_GL_GET_PROC(CheckFramebufferStatus);\n                GR_GL_GET_PROC(DeleteFramebuffers);\n                GR_GL_GET_PROC(RenderbufferStorage);\n                GR_GL_GET_PROC(GenRenderbuffers);\n                GR_GL_GET_PROC(DeleteRenderbuffers);\n                GR_GL_GET_PROC(FramebufferRenderbuffer);\n                GR_GL_GET_PROC(BindRenderbuffer);\n                GR_GL_GET_PROC(RenderbufferStorageMultisample);\n                GR_GL_GET_PROC(BlitFramebuffer);\n            } else if (has_gl_extension_from_string(\"GL_EXT_framebuffer_object\",\n                                                    extString)) {\n                GR_GL_GET_PROC_SUFFIX(GenFramebuffers, EXT);\n                GR_GL_GET_PROC_SUFFIX(BindFramebuffer, EXT);\n                GR_GL_GET_PROC_SUFFIX(FramebufferTexture2D, EXT);\n                GR_GL_GET_PROC_SUFFIX(CheckFramebufferStatus, EXT);\n                GR_GL_GET_PROC_SUFFIX(DeleteFramebuffers, EXT);\n                GR_GL_GET_PROC_SUFFIX(RenderbufferStorage, EXT);\n                GR_GL_GET_PROC_SUFFIX(GenRenderbuffers, EXT);\n                GR_GL_GET_PROC_SUFFIX(DeleteRenderbuffers, EXT);\n                GR_GL_GET_PROC_SUFFIX(FramebufferRenderbuffer, EXT);\n                GR_GL_GET_PROC_SUFFIX(BindRenderbuffer, EXT);\n                if (has_gl_extension_from_string(\"GL_EXT_framebuffer_multisample\",\n                                                 extString)) {\n                    GR_GL_GET_PROC_SUFFIX(RenderbufferStorageMultisample, EXT);\n                }\n                if (has_gl_extension_from_string(\"GL_EXT_framebuffer_blit\",\n                                                 extString)) {\n                    GR_GL_GET_PROC_SUFFIX(BlitFramebuffer, EXT);\n                }\n            } else {\n                \/\/ we must have FBOs\n                return;\n            }\n            GR_GL_GET_PROC(MapBuffer);\n            GR_GL_GET_PROC(UnmapBuffer);\n\n            gDefaultInterface.fBindingsExported = kDesktop_GrGLBinding;\n\n            gDefaultInterfaceInit = true;\n        }\n    }\n    if (gDefaultInterfaceInit) {\n        GrGLSetGLInterface(&gDefaultInterface);\n    }\n}\n<commit_msg>Use has_gl_extension_from_string in GrGLDefaultInterface_win.cpp (before the GL iface is installed).<commit_after>\/*\n    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\n#include \"GrGLInterface.h\"\n\n#include <Windows.h>\n#include <GL\/GL.h>\n\n\/*\n * Windows makes the GL funcs all be __stdcall instead of __cdecl :(\n * This implementation will only work if GR_GL_FUNCTION_TYPE is __stdcall.\n * Otherwise, a springboard would be needed that hides the calling convention.\n *\/\n\n#define GR_GL_GET_PROC(F) gDefaultInterface.f ## F = (GrGLInterface::GrGL ## F ## Proc) wglGetProcAddress(\"gl\" #F);\n#define GR_GL_GET_PROC_SUFFIX(F, S) gDefaultInterface.f ## F = (GrGLInterface::GrGL ## F ## Proc) wglGetProcAddress(\"gl\" #F #S);\n\nvoid GrGLSetDefaultGLInterface() {\n    static GrGLInterface gDefaultInterface;\n    static bool gDefaultInterfaceInit;\n    if (!gDefaultInterfaceInit) {\n        \n        \/\/ wglGetProcAddress requires a context.\n        if (NULL != wglGetCurrentContext()) {\n            int major, minor;\n            const char* versionString = (const char*) glGetString(GL_VERSION);\n            const char* extString = (const char*) glGetString(GL_EXTENSIONS);\n            gl_version_from_string(&major, &minor, versionString);\n\n            if (major == 1 && minor < 5) {\n                \/\/ We must have array and element_array buffer objects.\n                return;\n            }\n\n            \/\/ Functions that are part of GL 1.1 will return NULL in \n            \/\/ wglGetProcAddress\n            gDefaultInterface.fBlendFunc = glBlendFunc;\n            gDefaultInterface.fClear = glClear;\n            gDefaultInterface.fClearColor = glClearColor;\n            gDefaultInterface.fClearStencil = glClearStencil;\n            gDefaultInterface.fColor4ub = glColor4ub;\n            gDefaultInterface.fColorMask = glColorMask;\n            gDefaultInterface.fColorPointer = glColorPointer;\n            gDefaultInterface.fCullFace = glCullFace;\n            gDefaultInterface.fDeleteTextures = glDeleteTextures;\n            gDefaultInterface.fDepthMask = glDepthMask;\n            gDefaultInterface.fDisable = glDisable;\n            gDefaultInterface.fDisableClientState = glDisableClientState;\n            gDefaultInterface.fDrawArrays = glDrawArrays;\n            gDefaultInterface.fDrawElements = glDrawElements;\n            gDefaultInterface.fEnable = glEnable;\n            gDefaultInterface.fEnableClientState = glEnableClientState;\n            gDefaultInterface.fFrontFace = glFrontFace;\n            gDefaultInterface.fGenTextures = glGenTextures;\n            gDefaultInterface.fGetError = glGetError;\n            gDefaultInterface.fGetIntegerv = glGetIntegerv;\n            gDefaultInterface.fGetString = glGetString;\n            gDefaultInterface.fLineWidth = glLineWidth;\n            gDefaultInterface.fLoadMatrixf = glLoadMatrixf;\n            gDefaultInterface.fMatrixMode = glMatrixMode;\n            gDefaultInterface.fPixelStorei = glPixelStorei;\n            gDefaultInterface.fPointSize = glPointSize;\n            gDefaultInterface.fReadPixels = glReadPixels;\n            gDefaultInterface.fScissor = glScissor;\n            gDefaultInterface.fShadeModel = glShadeModel;\n            gDefaultInterface.fStencilFunc = glStencilFunc;\n            gDefaultInterface.fStencilMask = glStencilMask;\n            gDefaultInterface.fStencilOp = glStencilOp;\n            gDefaultInterface.fTexImage2D = glTexImage2D;\n            gDefaultInterface.fTexParameteri = glTexParameteri;\n            gDefaultInterface.fTexCoordPointer = glTexCoordPointer;\n            gDefaultInterface.fTexEnvi = glTexEnvi;\n            gDefaultInterface.fTexSubImage2D = glTexSubImage2D;\n            gDefaultInterface.fViewport = glViewport;\n            gDefaultInterface.fVertexPointer = glVertexPointer;\n\n            GR_GL_GET_PROC(ActiveTexture);\n            GR_GL_GET_PROC(AttachShader);\n            GR_GL_GET_PROC(BindAttribLocation);\n            GR_GL_GET_PROC(BindBuffer);\n            GR_GL_GET_PROC(BindTexture);\n            GR_GL_GET_PROC(BlendColor);\n            GR_GL_GET_PROC(BufferData);\n            GR_GL_GET_PROC(BufferSubData);\n            GR_GL_GET_PROC(ClientActiveTexture);\n            GR_GL_GET_PROC(CompileShader);\n            GR_GL_GET_PROC(CompressedTexImage2D);\n            GR_GL_GET_PROC(CreateProgram);\n            GR_GL_GET_PROC(CreateShader);\n            GR_GL_GET_PROC(DeleteBuffers);\n            GR_GL_GET_PROC(DeleteProgram);\n            GR_GL_GET_PROC(DeleteShader);\n            GR_GL_GET_PROC(DisableVertexAttribArray);\n            GR_GL_GET_PROC(EnableVertexAttribArray);\n            GR_GL_GET_PROC(GenBuffers);\n            GR_GL_GET_PROC(GetBufferParameteriv);\n            GR_GL_GET_PROC(GetProgramInfoLog);\n            GR_GL_GET_PROC(GetProgramiv);\n            GR_GL_GET_PROC(GetShaderInfoLog);\n            GR_GL_GET_PROC(GetShaderiv);\n            GR_GL_GET_PROC(GetUniformLocation);\n            GR_GL_GET_PROC(LinkProgram);\n            GR_GL_GET_PROC(ShaderSource);\n            GR_GL_GET_PROC(StencilFuncSeparate);\n            GR_GL_GET_PROC(StencilMaskSeparate);\n            GR_GL_GET_PROC(StencilOpSeparate);\n            GR_GL_GET_PROC(Uniform1fv);\n            GR_GL_GET_PROC(Uniform1i);\n            GR_GL_GET_PROC(Uniform4fv);\n            GR_GL_GET_PROC(UniformMatrix3fv);\n            GR_GL_GET_PROC(UseProgram);\n            GR_GL_GET_PROC(VertexAttrib4fv);\n            GR_GL_GET_PROC(VertexAttribPointer);\n\n            \/\/ First look for GL3.0 FBO or GL_ARB_framebuffer_object (same since\n            \/\/ GL_ARB_framebuffer_object doesn't use ARB suffix.)\n            if (major >= 3 || has_gl_extension_from_string(\"GL_ARB_framebuffer_object\", extString)) {\n                GR_GL_GET_PROC(GenFramebuffers);\n                GR_GL_GET_PROC(BindFramebuffer);\n                GR_GL_GET_PROC(FramebufferTexture2D);\n                GR_GL_GET_PROC(CheckFramebufferStatus);\n                GR_GL_GET_PROC(DeleteFramebuffers);\n                GR_GL_GET_PROC(RenderbufferStorage);\n                GR_GL_GET_PROC(GenRenderbuffers);\n                GR_GL_GET_PROC(DeleteRenderbuffers);\n                GR_GL_GET_PROC(FramebufferRenderbuffer);\n                GR_GL_GET_PROC(BindRenderbuffer);\n                GR_GL_GET_PROC(RenderbufferStorageMultisample);\n                GR_GL_GET_PROC(BlitFramebuffer);\n            } else if (has_gl_extension_from_string(\"GL_EXT_framebuffer_object\", extString)) {\n                GR_GL_GET_PROC_SUFFIX(GenFramebuffers, EXT);\n                GR_GL_GET_PROC_SUFFIX(BindFramebuffer, EXT);\n                GR_GL_GET_PROC_SUFFIX(FramebufferTexture2D, EXT);\n                GR_GL_GET_PROC_SUFFIX(CheckFramebufferStatus, EXT);\n                GR_GL_GET_PROC_SUFFIX(DeleteFramebuffers, EXT);\n                GR_GL_GET_PROC_SUFFIX(RenderbufferStorage, EXT);\n                GR_GL_GET_PROC_SUFFIX(GenRenderbuffers, EXT);\n                GR_GL_GET_PROC_SUFFIX(DeleteRenderbuffers, EXT);\n                GR_GL_GET_PROC_SUFFIX(FramebufferRenderbuffer, EXT);\n                GR_GL_GET_PROC_SUFFIX(BindRenderbuffer, EXT);\n                if (has_gl_extension_from_string(\"GL_EXT_framebuffer_multisample\", extString)) {\n                    GR_GL_GET_PROC_SUFFIX(RenderbufferStorageMultisample, EXT);\n                }\n                if (has_gl_extension_from_string(\"GL_EXT_framebuffer_blit\", extString)) {\n                    GR_GL_GET_PROC_SUFFIX(BlitFramebuffer, EXT);\n                }\n            } else {\n                \/\/ we must have FBOs\n                return;\n            }\n            GR_GL_GET_PROC(MapBuffer);\n            GR_GL_GET_PROC(UnmapBuffer);\n\n            gDefaultInterface.fBindingsExported = kDesktop_GrGLBinding;\n\n            gDefaultInterfaceInit = true;\n        }\n    }\n    if (gDefaultInterfaceInit) {\n        GrGLSetGLInterface(&gDefaultInterface);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"VirtualMachine.h\"\n\nVirtualMachine::VirtualMachine()\n{\n    \/\/ctor\n    stackSize = 0;\n}\n\nVirtualMachine::~VirtualMachine()\n{\n    \/\/dtor\n}\n\nvoid VirtualMachine::interpret(unsigned int bytecode[], int byteSize)\n{\n    auto startPoint = std::chrono::system_clock::now();\n\n    for(int a = 0; a < byteSize; ++a)\n    {\n        switch(bytecode[a])\n        {\n        case Instruction::CONSOLE_OUT:\n        {\n            std::stringstream output;\n            unsigned int argCount = bytecode[++a];\n            for(unsigned int arg = 0; arg < argCount; arg++)\n            {\n                Type variable = pop();\n                switch(variable.type)\n                {\n                case DataType::INT:\n                    output << variable.intData;\n                    break;\n                case DataType::CHAR:\n                    output << variable.charData;\n                    break;\n                case DataType::BOOL:\n                    output << variable.boolData;\n                    break;\n                case DataType::STRING:\n                    output << *variable.stringData;\n                    break;\n                default:\n                    throwError(std::string(\"Failed to CONSOLE_OUT, Unknown data type '\" + std::to_string(variable.type) + \"'\"));\n                }\n            }\n            std::cout << output.str();\n            break;\n        }\n        case Instruction::CREATE_INT:\n            push_integer(bytecode[++a]);\n            break;\n        case Instruction::CREATE_CHAR:\n            push_char(bytecode[++a]);\n            break;\n        case Instruction::CREATE_BOOL:\n            push_bool(bytecode[++a]);\n            break;\n        case Instruction::CREATE_STRING:\n        {\n            unsigned int stringSize = bytecode[++a]; \/\/String length stored in next byte\n            std::string wholeString;\n            wholeString.resize(stringSize);\n            for(unsigned int cChar = 0; cChar < stringSize; ++cChar) \/\/Read in the string from the bytecode into the allocated memory\n                wholeString[cChar] = bytecode[++a];\n\n            push_string(wholeString); \/\/Push the resulting string\n            break;\n        }\n        case Instruction::GOTO:\n            a = bytecode[a+1]-1; \/\/-1 because the bytecode position will increment after the loop ends\n            break;\n        case Instruction::CONSOLE_IN:\n        {\n            Type &variable = stack[stackSize - bytecode[++a] - 1];\n            switch(variable.type)\n            {\n            case DataType::INT:\n                std::cin >> variable.intData;\n                break;\n            case DataType::CHAR:\n                std::cin >> variable.charData;\n                break;\n            case DataType::BOOL:\n                std::cin >> variable.boolData;\n                break;\n            case DataType::STRING:\n                std::cin >> *variable.stringData;\n                break;\n            default:\n                throwError(std::string(\"Failed to CONSOLE_IN, Unknown data type '\" + std::to_string(variable.type) + \"'\"));\n            }\n            break;\n        }\n        case Instruction::MATH_ADD:\n            {\n                unsigned int numberCount = bytecode[++a]; \/\/Get number of bytes to subtract from bytecode\n                int32_t result = 0;\n                for(unsigned int b = 0; b < numberCount; ++b)\n                    result += pop().intData;\n                push_integer(result); \/\/Push the result to the stack\n                break;\n            }\n        case Instruction::MATH_SUBTRACT:\n            {\n                unsigned int numberCount = bytecode[++a]; \/\/Get number of bytes to subtract from bytecode\n                stackSize -= numberCount;\n                int32_t result = stack[stackSize].intData;\n                for(unsigned int a = stackSize+1; a < stackSize + numberCount; ++a) \/\/For the number of arguments specified, pop them all off the stack and subtract from 'result'\n                    result -= stack[a].intData;\n                push_integer(result); \/\/Push the result to the stack\n                break;\n            }\n        case Instruction::MATH_MULTIPLY:\n            {\n                unsigned int numberCount = bytecode[++a]; \/\/Get number of bytes to subtract from bytecode\n                int32_t result = 1;\n                for(unsigned int b = 0; b < numberCount; ++b)\n                    result *= pop().intData;\n                push_integer(result); \/\/Push the result to the stack\n                break;\n            }\n        case Instruction::MATH_DIVIDE:\n            {\n                \/\/TEMPORARY\n                unsigned int numberCount = bytecode[++a]; \/\/Get number of bytes to subtract from bytecode\n                std::vector<unsigned int> values;\n                int result = 0;\n                for(unsigned int a = 0; a < numberCount; ++a) \/\/For the number of arguments specified, pop them all off the stack and subtract from 'result'\n                    values.emplace_back(pop().intData);\n                result = values.back();\n                values.pop_back();\n                for(auto iter = values.rbegin(); iter != values.rend(); ++iter)\n                    result \/= *iter;\n                push_integer(result); \/\/Push the result to the stack\n                break;\n            }\n        case Instruction::MATH_MOD:\n            {\n                \/\/TEMPORARY\n                unsigned int numberCount = bytecode[++a]; \/\/Get number of bytes to subtract from bytecode\n                std::vector<unsigned int> values;\n                int result = 0;\n                for(unsigned int a = 0; a < numberCount; ++a) \/\/For the number of arguments specified, pop them all off the stack and subtract from 'result'\n                    values.emplace_back(pop().intData);\n                result = values.back();\n                values.pop_back();\n                for(auto iter = values.rbegin(); iter != values.rend(); ++iter)\n                {\n                    result %= *iter;\n                }\n                push_integer(result); \/\/Push the result to the stack\n                break;\n            }\n        case Instruction::CLONE_TOP:\n            {\n                push_type(stack[stackSize - bytecode[++a] - 1]); \/\/Clone a variable from an OFFSET. If 0 is given, the top variable is taken, if 1 is given, the second to top variable is taken etc\n                break;\n            }\n        case Instruction::CONCENTRATE_STRINGS:\n            {\n                \/\/Pop strings off first that need to be concentrated\n                unsigned int numberOfStrings = bytecode[++a];\n                std::string stringBuffer;\n                std::vector<std::string> poppedStrings;\n                for(unsigned int a = 0; a < numberOfStrings; ++a)\n                    poppedStrings.emplace_back(*pop().stringData);\n\n                \/\/Now add the strings to a buffer in reverse, as we need the first one to be first in the string, not last\n                for(auto iter = poppedStrings.rbegin(); iter != poppedStrings.rend(); ++iter)\n                    stringBuffer += *iter;\n\n                \/\/Push to stack\n                push_string(stringBuffer);\n                break;\n            }\n        case Instruction::COMPARE_EQUAL:\n            {\n                push_bool(isEqual(bytecode[++a])); \/\/Push results of comparison. Taking argument count from next bytecode\n                break;\n            }\n        case Instruction::CONDITIONAL_IF:\n            {\n                \/\/Move bytecode offset to the one specified in the bytecode.\n                \/\/bytecode[a+1] = position to set if false\n                if(!pop().boolData)\n                {\n                    a = bytecode[a+1];\n                }\n                else \/\/Else move past the false position and continue running the bytecode\n                {\n                    a++;\n                }\n                break;\n            }\n        case Instruction::SET_VARIABLE:\n            {\n                stack[stackSize - bytecode[++a]] = pop(); \/\/Get variable at the given offset and set it to the given value\n                break;\n            }\n        case Instruction::COMPARE_UNEQUAL: \/\/Compares last X things on the stack, returns true if they don't match\n            {\n                push_bool(!isEqual(bytecode[++a])); \/\/Push results of comparison. Taking argument count from next bytecode\n                break;\n            }\n        case Instruction::COMPARE_LESS_THAN:\n            {\n                ++a; \/\/Skip number of things to compare, not currently used\n                if(isLessThan(pop(), pop()))\n                    push_bool(true);\n                else\n                    push_bool(false);\n                break;\n            }\n        case Instruction::COMPARE_MORE_THAN:\n            {\n                ++a; \/\/Skip number of things to compare, not currently used\n                if(isMoreThan(pop(), pop()))\n                    push_bool(true);\n                else\n                    push_bool(false);\n                break;\n            }\n        case Instruction::COMPARE_MORE_THAN_OR_EQUAL:\n            {\n                ++a; \/\/Skip number of things to compare, not currently used\n                if(isMoreThanOrEqual(pop(), pop()))\n                    push_bool(true);\n                else\n                    push_bool(false);\n                break;\n            }\n        case Instruction::COMPARE_LESS_THAN_OR_EQUAL:\n            {\n                ++a; \/\/Skip number of things to compare, not currently used\n                if(isLessThanOrEqual(pop(), pop()))\n                    push_bool(true);\n                else\n                    push_bool(false);\n                break;\n            }\n        case Instruction::COMPARE_OR:\n            {\n                unsigned int compareCount = bytecode[++a]; \/\/Number of things to compare\n                bool orPassed = false;\n                for(unsigned int b = 0; b < compareCount; b++)\n                {\n                    if(pop().boolData)\n                    {\n                        orPassed = true;\n                        b = compareCount;\n                    }\n                }\n                if(orPassed)\n                    push_bool(true);\n                else\n                    push_bool(false);\n                break;\n            }\n        case Instruction::STACK_WALK:\n            {\n                stackSize -= bytecode[++a]; \/\/Get the new position from the next byte\n                break;\n            }\n        case Instruction::DYNAMIC_GOTO:\n            {\n                a = pop().intData-1; \/\/-1 as a will increment after this loop ends\n                break;\n            }\n        case Instruction::TO_INTEGER:\n            {\n                Type variable = pop();\n                switch(variable.type)\n                {\n                case DataType::CHAR:\n                        push_integer(variable.charData);\n                    break;\n                case DataType::STRING:\n                        push_integer(atoi(variable.stringData->c_str()));\n                    break;\n                default:\n                    throwError(std::string(\"Failed to TO_INTEGER, Unknown data type '\" + std::to_string(variable.type) + \"'\"));\n                }\n                break;\n            }\n        case Instruction::TO_STRING:\n            {\n                Type variable = pop();\n                switch(variable.type)\n                {\n                case DataType::INT:\n                        push_string(std::to_string(variable.intData));\n                    break;\n                case DataType::CHAR:\n                        push_string(std::to_string(variable.charData));\n                    break;\n                case DataType::BOOL:\n                        push_string(std::to_string(variable.boolData));\n                    break;\n                case DataType::STRING:\n                        push_string(*variable.stringData);\n                    break;\n                default:\n                    throwError(std::string(\"Failed to TO_STRING, Unknown data type '\" + std::to_string(variable.type) + \"'\"));\n                }\n                break;\n            }\n            case Instruction::COMPARE_AND:\n            {\n                unsigned int compareCount = bytecode[++a]; \/\/Number of things to compare\n                bool andPassed = true;\n                for(unsigned int b = 0; b < compareCount && andPassed; b++)\n                {\n                    if(!pop().boolData)\n                    {\n                        andPassed = false;\n                        b = compareCount;\n                    }\n                }\n                if(andPassed)\n                    push_bool(true);\n                else\n                    push_bool(false);\n                break;\n            }\n            case Instruction::DYNAMIC_CLONE_TOP:\n            {\n                push_type(stack[stackSize - pop().intData - 1]); \/\/Works the same way as CLONE_TOP, takes value from stack instead of next byte though\n                break;\n            }\n            case Instruction::DYNAMIC_SET_VARIABLE:\n            {\n                Type v1 = pop();\n                stack[stackSize - v1.intData] = pop(); \/\/Get variable at the given offset and set it to the given value\n                break;\n            }\n        default:\n            throwError(\"Unknown instruction '\" + std::to_string((int)bytecode[a]) + \"'\");\n        }\n    }\n\n    auto endPoint = std::chrono::system_clock::now();\n    std::cout << \"\\nTime elapsed: \" << std::chrono::duration_cast<std::chrono::milliseconds>(endPoint - startPoint).count() << \"ms\" << std::endl;\n\n    \/\/Dump variables to file for debugging\n    std::ofstream dump(\"dump.txt\");\n    if(!dump.is_open())\n    {\n        std::cout << \"\\nFailed to open file for dump.\";\n        return;\n    }\n    for(unsigned int a = 0; a < stackSize; a++)\n    {\n        dump << a << \": \";\n        switch(stack[a].type)\n        {\n        case DataType::INT:\n            dump << stack[a].intData;\n            break;\n        case DataType::CHAR:\n            dump << stack[a].charData;\n            break;\n        case DataType::BOOL:\n            dump << stack[a].boolData;\n            break;\n        case DataType::STRING:\n            dump << *stack[a].stringData;\n            break;\n        }\n        dump << std::endl;\n    }\n    dump.close();\n}\n\nvoid VirtualMachine::throwError(const std::string& reason)\n{\n    throw std::string(reason);\n}\n<commit_msg>Optimised MATH_DIVIDE and MATH_MOD instructions<commit_after>#include \"VirtualMachine.h\"\n\nVirtualMachine::VirtualMachine()\n{\n    \/\/ctor\n    stackSize = 0;\n}\n\nVirtualMachine::~VirtualMachine()\n{\n    \/\/dtor\n}\n\nvoid VirtualMachine::interpret(unsigned int bytecode[], int byteSize)\n{\n    auto startPoint = std::chrono::system_clock::now();\n\n    for(int a = 0; a < byteSize; ++a)\n    {\n        switch(bytecode[a])\n        {\n        case Instruction::CONSOLE_OUT:\n        {\n            std::stringstream output;\n            unsigned int argCount = bytecode[++a];\n            for(unsigned int arg = 0; arg < argCount; arg++)\n            {\n                Type variable = pop();\n                switch(variable.type)\n                {\n                case DataType::INT:\n                    output << variable.intData;\n                    break;\n                case DataType::CHAR:\n                    output << variable.charData;\n                    break;\n                case DataType::BOOL:\n                    output << variable.boolData;\n                    break;\n                case DataType::STRING:\n                    output << *variable.stringData;\n                    break;\n                default:\n                    throwError(std::string(\"Failed to CONSOLE_OUT, Unknown data type '\" + std::to_string(variable.type) + \"'\"));\n                }\n            }\n            std::cout << output.str();\n            break;\n        }\n        case Instruction::CREATE_INT:\n            push_integer(bytecode[++a]);\n            break;\n        case Instruction::CREATE_CHAR:\n            push_char(bytecode[++a]);\n            break;\n        case Instruction::CREATE_BOOL:\n            push_bool(bytecode[++a]);\n            break;\n        case Instruction::CREATE_STRING:\n        {\n            unsigned int stringSize = bytecode[++a]; \/\/String length stored in next byte\n            std::string wholeString;\n            wholeString.resize(stringSize);\n            for(unsigned int cChar = 0; cChar < stringSize; ++cChar) \/\/Read in the string from the bytecode into the allocated memory\n                wholeString[cChar] = bytecode[++a];\n\n            push_string(wholeString); \/\/Push the resulting string\n            break;\n        }\n        case Instruction::GOTO:\n            a = bytecode[a+1]-1; \/\/-1 because the bytecode position will increment after the loop ends\n            break;\n        case Instruction::CONSOLE_IN:\n        {\n            Type &variable = stack[stackSize - bytecode[++a] - 1];\n            switch(variable.type)\n            {\n            case DataType::INT:\n                std::cin >> variable.intData;\n                break;\n            case DataType::CHAR:\n                std::cin >> variable.charData;\n                break;\n            case DataType::BOOL:\n                std::cin >> variable.boolData;\n                break;\n            case DataType::STRING:\n                std::cin >> *variable.stringData;\n                break;\n            default:\n                throwError(std::string(\"Failed to CONSOLE_IN, Unknown data type '\" + std::to_string(variable.type) + \"'\"));\n            }\n            break;\n        }\n        case Instruction::MATH_ADD:\n            {\n                unsigned int numberCount = bytecode[++a]; \/\/Get number of bytes to subtract from bytecode\n                int32_t result = 0;\n                for(unsigned int b = 0; b < numberCount; ++b)\n                    result += pop().intData;\n                push_integer(result); \/\/Push the result to the stack\n                break;\n            }\n        case Instruction::MATH_SUBTRACT:\n            {\n                unsigned int numberCount = bytecode[++a]; \/\/Get number of bytes to subtract from bytecode\n                stackSize -= numberCount;\n                int32_t result = stack[stackSize].intData;\n                for(unsigned int a = stackSize+1; a < stackSize + numberCount; ++a) \/\/For the number of arguments specified, pop them all off the stack and subtract from 'result'\n                    result -= stack[a].intData;\n                push_integer(result); \/\/Push the result to the stack\n                break;\n            }\n        case Instruction::MATH_MULTIPLY:\n            {\n                unsigned int numberCount = bytecode[++a]; \/\/Get number of bytes to subtract from bytecode\n                int32_t result = 1;\n                for(unsigned int b = 0; b < numberCount; ++b)\n                    result *= pop().intData;\n                push_integer(result); \/\/Push the result to the stack\n                break;\n            }\n        case Instruction::MATH_DIVIDE:\n            {\n                unsigned int numberCount = bytecode[++a]; \/\/Get number of bytes to subtract from bytecode\n                stackSize -= numberCount;\n                int32_t result = stack[stackSize].intData;\n                for(unsigned int a = stackSize+1; a < stackSize + numberCount; ++a) \/\/For the number of arguments specified, pop them all off the stack and subtract from 'result'\n                    result \/= stack[a].intData;\n                push_integer(result); \/\/Push the result to the stack\n                break;\n            }\n        case Instruction::MATH_MOD:\n            {\n                unsigned int numberCount = bytecode[++a]; \/\/Get number of bytes to subtract from bytecode\n                stackSize -= numberCount;\n                int32_t result = stack[stackSize].intData;\n                for(unsigned int a = stackSize+1; a < stackSize + numberCount; ++a) \/\/For the number of arguments specified, pop them all off the stack and subtract from 'result'\n                    result %= stack[a].intData;\n                push_integer(result); \/\/Push the result to the stack\n                break;\n            }\n        case Instruction::CLONE_TOP:\n            {\n                push_type(stack[stackSize - bytecode[++a] - 1]); \/\/Clone a variable from an OFFSET. If 0 is given, the top variable is taken, if 1 is given, the second to top variable is taken etc\n                break;\n            }\n        case Instruction::CONCENTRATE_STRINGS:\n            {\n                \/\/Pop strings off first that need to be concentrated\n                unsigned int numberOfStrings = bytecode[++a];\n                std::string stringBuffer;\n                std::vector<std::string> poppedStrings;\n                for(unsigned int a = 0; a < numberOfStrings; ++a)\n                    poppedStrings.emplace_back(*pop().stringData);\n\n                \/\/Now add the strings to a buffer in reverse, as we need the first one to be first in the string, not last\n                for(auto iter = poppedStrings.rbegin(); iter != poppedStrings.rend(); ++iter)\n                    stringBuffer += *iter;\n\n                \/\/Push to stack\n                push_string(stringBuffer);\n                break;\n            }\n        case Instruction::COMPARE_EQUAL:\n            {\n                push_bool(isEqual(bytecode[++a])); \/\/Push results of comparison. Taking argument count from next bytecode\n                break;\n            }\n        case Instruction::CONDITIONAL_IF:\n            {\n                \/\/Move bytecode offset to the one specified in the bytecode.\n                \/\/bytecode[a+1] = position to set if false\n                if(!pop().boolData)\n                {\n                    a = bytecode[a+1];\n                }\n                else \/\/Else move past the false position and continue running the bytecode\n                {\n                    a++;\n                }\n                break;\n            }\n        case Instruction::SET_VARIABLE:\n            {\n                stack[stackSize - bytecode[++a]] = pop(); \/\/Get variable at the given offset and set it to the given value\n                break;\n            }\n        case Instruction::COMPARE_UNEQUAL: \/\/Compares last X things on the stack, returns true if they don't match\n            {\n                push_bool(!isEqual(bytecode[++a])); \/\/Push results of comparison. Taking argument count from next bytecode\n                break;\n            }\n        case Instruction::COMPARE_LESS_THAN:\n            {\n                ++a; \/\/Skip number of things to compare, not currently used\n                if(isLessThan(pop(), pop()))\n                    push_bool(true);\n                else\n                    push_bool(false);\n                break;\n            }\n        case Instruction::COMPARE_MORE_THAN:\n            {\n                ++a; \/\/Skip number of things to compare, not currently used\n                if(isMoreThan(pop(), pop()))\n                    push_bool(true);\n                else\n                    push_bool(false);\n                break;\n            }\n        case Instruction::COMPARE_MORE_THAN_OR_EQUAL:\n            {\n                ++a; \/\/Skip number of things to compare, not currently used\n                if(isMoreThanOrEqual(pop(), pop()))\n                    push_bool(true);\n                else\n                    push_bool(false);\n                break;\n            }\n        case Instruction::COMPARE_LESS_THAN_OR_EQUAL:\n            {\n                ++a; \/\/Skip number of things to compare, not currently used\n                if(isLessThanOrEqual(pop(), pop()))\n                    push_bool(true);\n                else\n                    push_bool(false);\n                break;\n            }\n        case Instruction::COMPARE_OR:\n            {\n                unsigned int compareCount = bytecode[++a]; \/\/Number of things to compare\n                bool orPassed = false;\n                for(unsigned int b = 0; b < compareCount; b++)\n                {\n                    if(pop().boolData)\n                    {\n                        orPassed = true;\n                        b = compareCount;\n                    }\n                }\n                if(orPassed)\n                    push_bool(true);\n                else\n                    push_bool(false);\n                break;\n            }\n        case Instruction::STACK_WALK:\n            {\n                stackSize -= bytecode[++a]; \/\/Get the new position from the next byte\n                break;\n            }\n        case Instruction::DYNAMIC_GOTO:\n            {\n                a = pop().intData-1; \/\/-1 as a will increment after this loop ends\n                break;\n            }\n        case Instruction::TO_INTEGER:\n            {\n                Type variable = pop();\n                switch(variable.type)\n                {\n                case DataType::CHAR:\n                        push_integer(variable.charData);\n                    break;\n                case DataType::STRING:\n                        push_integer(atoi(variable.stringData->c_str()));\n                    break;\n                default:\n                    throwError(std::string(\"Failed to TO_INTEGER, Unknown data type '\" + std::to_string(variable.type) + \"'\"));\n                }\n                break;\n            }\n        case Instruction::TO_STRING:\n            {\n                Type variable = pop();\n                switch(variable.type)\n                {\n                case DataType::INT:\n                        push_string(std::to_string(variable.intData));\n                    break;\n                case DataType::CHAR:\n                        push_string(std::to_string(variable.charData));\n                    break;\n                case DataType::BOOL:\n                        push_string(std::to_string(variable.boolData));\n                    break;\n                case DataType::STRING:\n                        push_string(*variable.stringData);\n                    break;\n                default:\n                    throwError(std::string(\"Failed to TO_STRING, Unknown data type '\" + std::to_string(variable.type) + \"'\"));\n                }\n                break;\n            }\n            case Instruction::COMPARE_AND:\n            {\n                unsigned int compareCount = bytecode[++a]; \/\/Number of things to compare\n                bool andPassed = true;\n                for(unsigned int b = 0; b < compareCount && andPassed; b++)\n                {\n                    if(!pop().boolData)\n                    {\n                        andPassed = false;\n                        b = compareCount;\n                    }\n                }\n                if(andPassed)\n                    push_bool(true);\n                else\n                    push_bool(false);\n                break;\n            }\n            case Instruction::DYNAMIC_CLONE_TOP:\n            {\n                push_type(stack[stackSize - pop().intData - 1]); \/\/Works the same way as CLONE_TOP, takes value from stack instead of next byte though\n                break;\n            }\n            case Instruction::DYNAMIC_SET_VARIABLE:\n            {\n                Type v1 = pop();\n                stack[stackSize - v1.intData] = pop(); \/\/Get variable at the given offset and set it to the given value\n                break;\n            }\n        default:\n            throwError(\"Unknown instruction '\" + std::to_string((int)bytecode[a]) + \"'\");\n        }\n    }\n\n    auto endPoint = std::chrono::system_clock::now();\n    std::cout << \"\\nTime elapsed: \" << std::chrono::duration_cast<std::chrono::milliseconds>(endPoint - startPoint).count() << \"ms\" << std::endl;\n\n    \/\/Dump variables to file for debugging\n    std::ofstream dump(\"dump.txt\");\n    if(!dump.is_open())\n    {\n        std::cout << \"\\nFailed to open file for dump.\";\n        return;\n    }\n    for(unsigned int a = 0; a < stackSize; a++)\n    {\n        dump << a << \": \";\n        switch(stack[a].type)\n        {\n        case DataType::INT:\n            dump << stack[a].intData;\n            break;\n        case DataType::CHAR:\n            dump << stack[a].charData;\n            break;\n        case DataType::BOOL:\n            dump << stack[a].boolData;\n            break;\n        case DataType::STRING:\n            dump << *stack[a].stringData;\n            break;\n        }\n        dump << std::endl;\n    }\n    dump.close();\n}\n\nvoid VirtualMachine::throwError(const std::string& reason)\n{\n    throw std::string(reason);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * opencog\/atoms\/core\/Checkers.cc\n *\n * Copyright (C) 2017 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 <opencog\/atoms\/base\/Atom.h>\n#include <opencog\/atoms\/base\/ClassServer.h>\n\nusing namespace opencog;\n\n\/\/\/ Check to see if every input atom is of Evaluatable type.\nbool check_evaluatable(const Handle& bool_atom)\n{\n\t\/\/ Make an exception for AndLink, its used in pattern matcher\n\t\/\/ in an unseemly way.\n\tif (bool_atom->get_type() == AND_LINK) return true;\n\n\tfor (const Handle& h: bool_atom->getOutgoingSet())\n\t{\n\t\t\/\/ PutLinks cannt be type-checked statically. So checking\n\t\t\/\/ has to be defered until runtime.\n\t\tif (PUT_LINK == h->get_type()) continue;\n\n\t\tif (not h->is_type(EVALUATABLE_LINK)) return false;\n\t}\n\treturn true;\n}\n\n\/* This runs when the shared lib is loaded. *\/\nstatic __attribute__ ((constructor)) void init(void)\n{\n\tclassserver().addValidator(BOOLEAN_LINK, check_evaluatable);\n}\n<commit_msg>Add Numeric checking<commit_after>\/*\n * opencog\/atoms\/core\/Checkers.cc\n *\n * Copyright (C) 2017 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 <opencog\/atoms\/base\/Atom.h>\n#include <opencog\/atoms\/base\/ClassServer.h>\n\nusing namespace opencog;\n\n\/\/\/ Provide static factory-time type checking.\n\/\/\/ This only performs a very simple kind of type checking;\n\/\/\/ it does not check deep types, nor does it check arity.\n\n\/\/\/ Check to see if every input atom is of Evaluatable type.\nbool check_evaluatable(const Handle& bool_atom)\n{\n\t\/\/ Make an exception for AndLink, its used in pattern matcher\n\t\/\/ in an unseemly way.\n\tif (bool_atom->get_type() == AND_LINK) return true;\n\n\tfor (const Handle& h: bool_atom->getOutgoingSet())\n\t{\n\t\tType t = h->get_type();\n\t\t\/\/ PutLinks and GetLinks cannot be type-checked statically.\n\t\t\/\/ Checking has to be defered until runtime.\n\t\tif (PUT_LINK == t) continue;\n\t\tif (GET_LINK == t) continue;\n\t\tif (VARIABLE_NODE == t) continue;\n\n\t\t\/\/ Fucking quote links. I hate those with a passion.\n\t\tif (QUOTE_LINK == t) continue;\n\t\tif (UNQUOTE_LINK == t) continue;\n\n\t\tif (not h->is_type(EVALUATABLE_LINK)) return false;\n\t}\n\treturn true;\n}\n\n\/\/\/ Check to see if every input atom is of Numeric type.\nbool check_numeric(const Handle& bool_atom)\n{\n\tfor (const Handle& h: bool_atom->getOutgoingSet())\n\t{\n\t\tType t = h->get_type();\n\t\t\/\/ PutLinks and GetLinks cannot be type-checked statically.\n\t\t\/\/ Checking has to be defered until runtime.\n\t\tif (PUT_LINK == t) continue;\n\t\tif (GET_LINK == t) continue;\n\t\tif (VARIABLE_NODE == t) continue;\n\t\tif (NUMBER_NODE == t) continue;\n\n\t\t\/\/ Oddly enough, sets of numbers are allowed.\n\t\tif (SET_LINK == t and check_numeric(h)) continue;\n\n\t\tif (not h->is_type(NUMERIC_OUTPUT_LINK)) return false;\n\t}\n\treturn true;\n}\n\n\/* This runs when the shared lib is loaded. *\/\nstatic __attribute__ ((constructor)) void init(void)\n{\n\tclassserver().addValidator(BOOLEAN_LINK, check_evaluatable);\n\tclassserver().addValidator(NUMERIC_LINK, check_numeric);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"mitkInteractor.h\"\n#include <mitkDataTreeNode.h>\n#include <mitkDisplayPositionEvent.h>\n#include <mitkPositionEvent.h>\n#include <mitkGeometry3D.h>\n#include <vtkCamera.h>\n#include <vtkRenderer.h>\n#include <mitkOpenGLRenderer.h>\n#include \"mitkInteractionConst.h\"\n\n\n\n\nmitk::Interactor::Interactor(const char * type, DataTreeNode* dataTreeNode)\n: mitk::StateMachine(type), m_DataTreeNode(dataTreeNode), m_Mode(SMDESELECTED)\n{\n  if (m_DataTreeNode != NULL)\n    m_DataTreeNode->SetInteractor(this);\n}\n\nvoid mitk::Interactor::SetMode(int mode)\n{\n  if ((-1<mode)&&(mode<3))\/\/if mode in range from 0 to 2\n    m_Mode = mode;\n}\n\nconst int mitk::Interactor::GetMode() const\n{\n  return m_Mode;\n}\n\n\/\/##Documentation\n\/\/## change if derived class can handle it better!\nfloat mitk::Interactor::CalculateJurisdiction(StateEvent const* stateEvent) const\n{\n  float returnvalue = 0.0;\n  \/\/if it is a key event that can be handled in the current state, then return 0.5\n  mitk::DisplayPositionEvent const  *disPosEvent = dynamic_cast <const mitk::DisplayPositionEvent *> (stateEvent->GetEvent());\n\t\n  \/\/Key event handling:\n  if (disPosEvent == NULL)\n  {\n    \/\/check, if the current state has a transition waiting for that key event.\n    if (this->GetCurrentState()->GetTransition(stateEvent->GetId())!=NULL)\n    {\n      returnvalue = 0.5;\n    }\n    else\n    {\n      returnvalue = 0;\n    }\n\n  }\n  \n  \/\/Mouse event handling:\n  else\/\/if we have 2d or 3d position\n  {\n    if (stateEvent->GetEvent()->GetType() == mitk::Type_MouseMove)\/\/on MouseMove do nothing! reimplement if needed differently\n    {\n      return 0;\n    }\n\n    \/\/compute the center of the data taken care of\n    mitk::BoundingBox *bBox = const_cast<mitk::BoundingBox*>(m_DataTreeNode->GetData()->GetGeometry()->GetBoundingBox());\n    if (bBox == NULL)\n      return 0;\n\n    mitk::PositionEvent const  *posEvent = dynamic_cast <const mitk::PositionEvent *> (stateEvent->GetEvent());\n\t  if (posEvent == NULL) \/\/2D information from a 3D window\n    {\n      \/\/get camera and calculate the distance between the center of this boundingbox and the camera\n      vtkCamera* camera = dynamic_cast<mitk::OpenGLRenderer*>(posEvent->GetSender())->GetVtkRenderer()->GetActiveCamera();\n      if (camera == NULL)\n      {\n        return 0;\n      }\n      float normal[3];\n      camera->GetViewPlaneNormal(normal);\n      mitk::BoundingBox::PointType center = bBox->GetCenter();\n      returnvalue = center.SquaredEuclideanDistanceTo(normal);\n      \/\/map between 0.5 and 1\n      \n    }\n    else\/\/3D information from a 2D window.\n    {\n      mitk::Point3D const point = posEvent->GetWorldPosition();\n      itk::BoundingBox<mitk::ScalarType,3>::PointType itkPoint;\n      vm2itk(point, itkPoint);\n\n      \/\/check if the given position lies inside the data-object\n\n      if (bBox->IsInside(itkPoint))\n      {\n        \/\/how near inside the center?\n        mitk::BoundingBox::PointType center = bBox->GetCenter();\n        \/\/distance between center and point \n        returnvalue = itkPoint.SquaredEuclideanDistanceTo(center);\n        \/\/now in rage of 0.5 to 1 compared to size of boundingbox\n\n\/\/#################\n\/\/TODO: map between 0.5 and 1\n\/\/#################\n\n      }\n      else\n      {\n        \/\/calculate the distance between the point and the BoundingBox\n        \/\/and set it in range between 0 and 0.5\n        returnvalue = 0;\n      }\n    }\n\n  }\n\n  return returnvalue;\n\n}\n\n<commit_msg>calculation of jursidiction<commit_after>#include \"mitkInteractor.h\"\n#include <mitkDataTreeNode.h>\n#include <mitkDisplayPositionEvent.h>\n#include <mitkPositionEvent.h>\n#include <mitkGeometry3D.h>\n#include <vtkCamera.h>\n#include <vtkRenderer.h>\n#include <mitkOpenGLRenderer.h>\n#include \"mitkInteractionConst.h\"\n#include <vtkTransform.h>\n#include <itkVector.h>\n\n\n\n\nmitk::Interactor::Interactor(const char * type, DataTreeNode* dataTreeNode)\n: mitk::StateMachine(type), m_DataTreeNode(dataTreeNode), m_Mode(SMDESELECTED)\n{\n  if (m_DataTreeNode != NULL)\n    m_DataTreeNode->SetInteractor(this);\n}\n\nvoid mitk::Interactor::SetMode(int mode)\n{\n  if ((-1<mode)&&(mode<3))\/\/if mode in range from 0 to 2\n    m_Mode = mode;\n}\n\nconst int mitk::Interactor::GetMode() const\n{\n  return m_Mode;\n}\n\n\/\/##Documentation\n\/\/## change if derived class can handle it better!\nfloat mitk::Interactor::CalculateJurisdiction(StateEvent const* stateEvent) const\n{\n  float returnvalue = 0.0;\n  \/\/if it is a key event that can be handled in the current state, then return 0.5\n  mitk::DisplayPositionEvent const  *disPosEvent = dynamic_cast <const mitk::DisplayPositionEvent *> (stateEvent->GetEvent());\n\t\n  \/\/Key event handling:\n  if (disPosEvent == NULL)\n  {\n    \/\/check, if the current state has a transition waiting for that key event.\n    if (this->GetCurrentState()->GetTransition(stateEvent->GetId())!=NULL)\n    {\n      returnvalue = 0.5;\n    }\n    else\n    {\n      returnvalue = 0;\n    }\n\n  }\n  \n  \/\/Mouse event handling:\n  else\/\/if we have 2d or 3d position\n  {\n    if (stateEvent->GetEvent()->GetType() == mitk::Type_MouseMove)\/\/on MouseMove do nothing! reimplement if needed differently\n    {\n      return 0;\n    }\n\n    \/\/compute the center of the data taken care of\n    mitk::BoundingBox *bBox = const_cast<mitk::BoundingBox*>(m_DataTreeNode->GetData()->GetGeometry()->GetBoundingBox());\n    if (bBox == NULL)\n      return 0;\n\n    mitk::PositionEvent const  *posEvent = dynamic_cast <const mitk::PositionEvent *> (stateEvent->GetEvent());\n\t  if (posEvent == NULL) \/\/2D information from a 3D window\n    {\n      \/\/get camera and calculate the distance between the center of this boundingbox and the camera\n      vtkCamera* camera = dynamic_cast<mitk::OpenGLRenderer*>(posEvent->GetSender())->GetVtkRenderer()->GetActiveCamera();\n      if (camera == NULL)\n      {\n        return 0;\n      }\n      float normal[3];\n      camera->GetViewPlaneNormal(normal);\n      mitk::BoundingBox::PointType center = bBox->GetCenter();\n      returnvalue = center.SquaredEuclideanDistanceTo(normal);\n      \/\/map between 0.5 and 1\n      \n    }\n    else\/\/3D information from a 2D window.\n    {\n      mitk::Point3D const point = posEvent->GetWorldPosition();\n      mitk::BoundingBox::PointType itkPoint;\n      float p[3];\n      p[0] = point.x;p[1] = point.y;p[2] = point.z;\n      \/\/transforming the Worldposition to local coordinatesystem\n      m_DataTreeNode->GetData()->GetGeometry()->GetVtkTransform()->GetInverse()->TransformPoint(p, p);\n      \n      itkPoint[0] = p[0];itkPoint[1] = p[1];itkPoint[2] = p[2];\n\n      \/\/check if the given position lies inside the data-object\n      if (bBox->IsInside(itkPoint))\n      {\n        \/\/how near inside the center?\n        mitk::BoundingBox::PointType center = bBox->GetCenter();\n        \/\/distance between center and point \n        returnvalue = 1 - itkPoint.SquaredEuclideanDistanceTo(center);\n        \/\/now in rage of 0.5 to 1 compared to size of boundingbox;\n        returnvalue = returnvalue\/( (bBox->GetMaximum() - bBox->GetMinimum()).GetNorm() \/ 2);\n        \n        \/\/map between 0.5 and 1\n        returnvalue = 0.5 + (returnvalue \/ 2);\n      }\n      else\n      {\n        \/\/calculate the distance between the point and the BoundingBox\n        \/\/and set it in range between 0 and 0.5\n        returnvalue = 0;\n      }\n    }\n\n  }\n\n  return returnvalue;\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <cassert>\n#include \"samplers\/stratified_sampler.h\"\n#include \"material\/bsdf.h\"\n\nBSDF::BSDF(const DifferentialGeometry &dg, float eta)\n\t: normal(dg.normal), geom_normal(dg.geom_normal), bitangent(dg.dp_du.normalized()),\n\ttangent(normal.cross(bitangent).normalized()), n_bxdfs(0), dg(dg), eta(eta)\n{\n\t\/\/Update the bitangent to get a proper coordinate system\n\tbitangent = tangent.cross(Vector{normal}).normalized();\n}\nvoid BSDF::add(BxDF *b){\n\tassert(n_bxdfs < 8);\n\tbxdfs[n_bxdfs++] = b;\n}\nint BSDF::num_bxdfs() const {\n\treturn n_bxdfs;\n}\nint BSDF::num_bxdfs(BxDFTYPE flags) const {\n\tint n = 0;\n\tfor (int i = 0; i < n_bxdfs; ++i){\n\t\tif (bxdfs[i]->matches(flags)){\n\t\t\t++n;\n\t\t}\n\t}\n\treturn n;\n}\nVector BSDF::to_shading(const Vector &v) const {\n\treturn Vector{v.dot(bitangent), v.dot(tangent), v.dot(normal)};\n}\nVector BSDF::from_shading(const Vector &v) const {\n\treturn Vector{bitangent.x * v.x + tangent.x * v.y + normal.x * v.z,\n\t\tbitangent.y * v.x + tangent.y * v.y + normal.y * v.z,\n\t\tbitangent.z * v.x + tangent.z * v.y + normal.z * v.z};\n}\nColorf BSDF::operator()(const Vector &wo_world, const Vector &wi_world, BxDFTYPE flags) const {\n\tVector wo = to_shading(wo_world);\n\tVector wi = to_shading(wi_world);\n\t\/\/Determine if we should be evaluating reflection or transmission based on the geometry normal\n\tif (wo_world.dot(geom_normal) * wi_world.dot(geom_normal) > 0){\n\t\tflags = BxDFTYPE(flags & ~BxDFTYPE::TRANSMISSION);\n\t}\n\telse {\n\t\tflags = BxDFTYPE(flags & ~BxDFTYPE::REFLECTION);\n\t}\n\tColorf color;\n\tfor (int i = 0; i < n_bxdfs; ++i){\n\t\tif (bxdfs[i]->matches(flags)){\n\t\t\tcolor += (*bxdfs[i])(wo, wi);\n\t\t}\n\t}\n\treturn color;\n}\nColorf BSDF::sample(const Vector &wo_world, Vector &wi_world, const std::array<float, 2> &u, float comp,\n\tfloat &pdf_val, BxDFTYPE flags, BxDFTYPE *sampled_type) const\n{\n\t\/\/Select which component to sample that matches the desired flags\n\tint n_matching = num_bxdfs(flags);\n\tif (n_matching == 0){\n\t\tpdf_val = 0;\n\t\tif (sampled_type){\n\t\t\t*sampled_type = BxDFTYPE(0);\n\t\t}\n\t\treturn Colorf{0};\n\t}\n\tint select = std::min(static_cast<int>(comp * n_matching), n_matching - 1);\n\tconst BxDF *bxdf = matching_at(select, flags);\n\tassert(bxdf);\n\n\tVector wo = to_shading(wo_world);\n\tVector wi;\n\tpdf_val = 0;\n\tColorf f = bxdf->sample(wo, wi, u, pdf_val);\n\tif (pdf_val == 0){\n\t\tif (sampled_type){\n\t\t\t*sampled_type = BxDFTYPE(0);\n\t\t}\n\t\treturn Colorf{0};\n\t}\n\tif (sampled_type){\n\t\t*sampled_type = bxdf->type;\n\t}\n\twi_world = from_shading(wi);\n\n\t\/\/Compute the overall sampling PDF for the direction we sampled. This is skipped for specular BxDFs\n\t\/\/since they contain a delta distribution which would make this incorrect\n\tif (!(bxdf->type & BxDFTYPE::SPECULAR)){\n\t\tif (n_matching > 1){\n\t\t\tpdf_val = pdf(wo_world, wi_world, flags);\n\t\t}\n\t\t\/\/Compute the total contribution from all BxDFs matching the flags along this direction\n\t\tf = (*this)(wo_world, wi_world, flags);\n\t}\n\t\/\/We do still need to normalize properly though for specular objects\n\telse if (n_matching > 1){\n\t\tpdf_val \/= n_matching;\n\t}\n\treturn f;\n}\nColorf BSDF::rho_hd(const Vector &w_o, Sampler &sampler, MemoryPool &pool, BxDFTYPE flags, int sqrt_samples) const {\n\tint n_samples = sqrt_samples * sqrt_samples;\n\tstd::array<float, 2> *samples = pool.alloc_array<std::array<float, 2>>(n_samples);\n\tsampler.get_samples(samples, n_samples);\n\tColorf color;\n\tfor (int i = 0; i < n_bxdfs; ++i){\n\t\tif (bxdfs[i]->matches(flags)){\n\t\t\tcolor += bxdfs[i]->rho_hd(w_o, samples, n_samples);\n\t\t}\n\t}\n\treturn color;\n}\nColorf BSDF::rho_hh(Sampler &sampler, MemoryPool &pool, BxDFTYPE flags, int sqrt_samples) const {\n\tint n_samples = sqrt_samples * sqrt_samples;\n\tstd::array<float, 2> *samples_a = pool.alloc_array<std::array<float, 2>>(n_samples);\n\tstd::array<float, 2> *samples_b = pool.alloc_array<std::array<float, 2>>(n_samples);\n\tsampler.get_samples(samples_a, n_samples);\n\tsampler.get_samples(samples_b, n_samples);\n\tColorf color;\n\tfor (int i = 0; i < n_bxdfs; ++i){\n\t\tif (bxdfs[i]->matches(flags)){\n\t\t\tcolor += bxdfs[i]->rho_hh(samples_a, samples_b, n_samples);\n\t\t}\n\t}\n\treturn color;\n\n}\nfloat BSDF::pdf(const Vector &wo_world, const Vector &wi_world, BxDFTYPE flags) const {\n\tVector wo = to_shading(wo_world);\n\tVector wi = to_shading(wi_world);\n\tfloat pdf_val = 0;\n\tint n_comps = 0;\n\tfor (int i = 0; i < n_bxdfs; ++i){\n\t\tif (bxdfs[i]->matches(flags)){\n\t\t\t++n_comps;\n\t\t\tpdf_val += bxdfs[i]->pdf(wo, wi);\n\t\t}\n\t}\n\treturn n_comps > 0 ? pdf_val \/ n_comps : 0;\n}\nBxDF* BSDF::operator[](int i){\n\treturn bxdfs[i];\n}\nconst BxDF* BSDF::matching_at(int n, BxDFTYPE flags) const {\n\tfor (int i = 0; i < n_bxdfs; ++i){\n\t\tif (bxdfs[i]->matches(flags) && n-- == 0){\n\t\t\treturn bxdfs[i];\n\t\t}\n\t}\n\treturn nullptr;\n}\n\n<commit_msg>Tweaking the order of the bsdf evaluation stuff, should be still equiv<commit_after>#include <cassert>\n#include \"samplers\/stratified_sampler.h\"\n#include \"material\/bsdf.h\"\n\nBSDF::BSDF(const DifferentialGeometry &dg, float eta)\n\t: normal(dg.normal), geom_normal(dg.geom_normal), bitangent(dg.dp_du.normalized()),\n\ttangent(normal.cross(bitangent).normalized()), n_bxdfs(0), dg(dg), eta(eta)\n{\n\t\/\/Update the bitangent to get a proper coordinate system\n\tbitangent = tangent.cross(Vector{normal}).normalized();\n}\nvoid BSDF::add(BxDF *b){\n\tassert(n_bxdfs < 8);\n\tbxdfs[n_bxdfs++] = b;\n}\nint BSDF::num_bxdfs() const {\n\treturn n_bxdfs;\n}\nint BSDF::num_bxdfs(BxDFTYPE flags) const {\n\tint n = 0;\n\tfor (int i = 0; i < n_bxdfs; ++i){\n\t\tif (bxdfs[i]->matches(flags)){\n\t\t\t++n;\n\t\t}\n\t}\n\treturn n;\n}\nVector BSDF::to_shading(const Vector &v) const {\n\treturn Vector{v.dot(bitangent), v.dot(tangent), v.dot(normal)};\n}\nVector BSDF::from_shading(const Vector &v) const {\n\treturn Vector{bitangent.x * v.x + tangent.x * v.y + normal.x * v.z,\n\t\tbitangent.y * v.x + tangent.y * v.y + normal.y * v.z,\n\t\tbitangent.z * v.x + tangent.z * v.y + normal.z * v.z};\n}\nColorf BSDF::operator()(const Vector &wo_world, const Vector &wi_world, BxDFTYPE flags) const {\n\tVector wo = to_shading(wo_world);\n\tVector wi = to_shading(wi_world);\n\t\/\/Determine if we should be evaluating reflection or transmission based on the geometry normal\n\tif (wo_world.dot(geom_normal) * wi_world.dot(geom_normal) > 0){\n\t\tflags = BxDFTYPE(flags & ~BxDFTYPE::TRANSMISSION);\n\t}\n\telse {\n\t\tflags = BxDFTYPE(flags & ~BxDFTYPE::REFLECTION);\n\t}\n\tColorf color;\n\tfor (int i = 0; i < n_bxdfs; ++i){\n\t\tif (bxdfs[i]->matches(flags)){\n\t\t\tcolor += (*bxdfs[i])(wo, wi);\n\t\t}\n\t}\n\treturn color;\n}\nColorf BSDF::sample(const Vector &wo_world, Vector &wi_world, const std::array<float, 2> &u, float comp,\n\tfloat &pdf_val, BxDFTYPE flags, BxDFTYPE *sampled_type) const\n{\n\t\/\/Select which component to sample that matches the desired flags\n\tint n_matching = num_bxdfs(flags);\n\tif (n_matching == 0){\n\t\tpdf_val = 0;\n\t\tif (sampled_type){\n\t\t\t*sampled_type = BxDFTYPE(0);\n\t\t}\n\t\treturn Colorf{0};\n\t}\n\tint select = std::min(static_cast<int>(comp * n_matching), n_matching - 1);\n\tconst BxDF *bxdf = matching_at(select, flags);\n\tassert(bxdf);\n\n\tVector wo = to_shading(wo_world);\n\tVector wi;\n\tpdf_val = 0;\n\tColorf f = bxdf->sample(wo, wi, u, pdf_val);\n\tif (pdf_val == 0){\n\t\tif (sampled_type){\n\t\t\t*sampled_type = BxDFTYPE(0);\n\t\t}\n\t\treturn Colorf{0};\n\t}\n\tif (sampled_type){\n\t\t*sampled_type = bxdf->type;\n\t}\n\twi_world = from_shading(wi);\n\n\tif (n_matching > 1){\n\t\t\/\/Compute the overall sampling PDF for the direction we sampled. This is skipped for specular BxDFs\n\t\t\/\/since they contain a delta distribution which would make this incorrect\n\t\tif (!(bxdf->type & BxDFTYPE::SPECULAR)){\n\t\t\tpdf_val = pdf(wo_world, wi_world, flags);\n\t\t\t\/\/Compute the total contribution from all BxDFs matching the flags along this direction\n\t\t\tf = (*this)(wo_world, wi_world, flags);\n\t\t}\n\t\t\/\/We do still need to normalize properly though for specular objects\n\t\telse {\n\t\t\tpdf_val \/= n_matching;\n\t\t}\n\t}\n\treturn f;\n}\nColorf BSDF::rho_hd(const Vector &w_o, Sampler &sampler, MemoryPool &pool, BxDFTYPE flags, int sqrt_samples) const {\n\tint n_samples = sqrt_samples * sqrt_samples;\n\tstd::array<float, 2> *samples = pool.alloc_array<std::array<float, 2>>(n_samples);\n\tsampler.get_samples(samples, n_samples);\n\tColorf color;\n\tfor (int i = 0; i < n_bxdfs; ++i){\n\t\tif (bxdfs[i]->matches(flags)){\n\t\t\tcolor += bxdfs[i]->rho_hd(w_o, samples, n_samples);\n\t\t}\n\t}\n\treturn color;\n}\nColorf BSDF::rho_hh(Sampler &sampler, MemoryPool &pool, BxDFTYPE flags, int sqrt_samples) const {\n\tint n_samples = sqrt_samples * sqrt_samples;\n\tstd::array<float, 2> *samples_a = pool.alloc_array<std::array<float, 2>>(n_samples);\n\tstd::array<float, 2> *samples_b = pool.alloc_array<std::array<float, 2>>(n_samples);\n\tsampler.get_samples(samples_a, n_samples);\n\tsampler.get_samples(samples_b, n_samples);\n\tColorf color;\n\tfor (int i = 0; i < n_bxdfs; ++i){\n\t\tif (bxdfs[i]->matches(flags)){\n\t\t\tcolor += bxdfs[i]->rho_hh(samples_a, samples_b, n_samples);\n\t\t}\n\t}\n\treturn color;\n\n}\nfloat BSDF::pdf(const Vector &wo_world, const Vector &wi_world, BxDFTYPE flags) const {\n\tVector wo = to_shading(wo_world);\n\tVector wi = to_shading(wi_world);\n\tfloat pdf_val = 0;\n\tint n_comps = 0;\n\tfor (int i = 0; i < n_bxdfs; ++i){\n\t\tif (bxdfs[i]->matches(flags)){\n\t\t\t++n_comps;\n\t\t\tpdf_val += bxdfs[i]->pdf(wo, wi);\n\t\t}\n\t}\n\treturn n_comps > 0 ? pdf_val \/ n_comps : 0;\n}\nBxDF* BSDF::operator[](int i){\n\treturn bxdfs[i];\n}\nconst BxDF* BSDF::matching_at(int n, BxDFTYPE flags) const {\n\tfor (int i = 0; i < n_bxdfs; ++i){\n\t\tif (bxdfs[i]->matches(flags) && n-- == 0){\n\t\t\treturn bxdfs[i];\n\t\t}\n\t}\n\treturn nullptr;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#ifndef INCLUDE_AL_SHADERMANAGER_HPP\n#define INCLUDE_AL_SHADERMANAGER_HPP\n\n#include \"allocore\/graphics\/al_Shader.hpp\"\n#include \"alloutil\/al_ResourceManager.hpp\"\n#include <map>\n\nstruct ShaderManager {\n  std::map<std::string, al::ShaderProgram*> shaderMap;\n  std::string vertLibCode;\n  std::string fragLibCode;\n  al::ResourceManager rm;\n\n  al::ShaderProgram* get(std::string name) {\n    return shaderMap[name];\n  }\n\n  al::ShaderProgram* addShaderString(std::string name, std::string vertCode, std::string fragCode) {\n    \/\/ destroy shader if one already exists with same name\n    if(shaderMap.count(name)){\n      shaderMap[name]->destroy();\n    }\n\n    al::Shader vert, frag;\n    vert.source(vertLibCode + vertCode, al::Shader::VERTEX).compile();\n    vert.printLog();\n    frag.source(fragLibCode + fragCode, al::Shader::FRAGMENT).compile();\n    frag.printLog();\n\n    al::ShaderProgram *s = new al::ShaderProgram();\n    s->attach(vert).attach(frag).link();\n    s->printLog();\n    \/\/s->listParams();\n\n    shaderMap[name] = s;\n\n    return s;\n  }\n\n  al::ShaderProgram* addShaderFile(std::string pName, std::string vName, std::string fName) {\n    \/\/ destroy shader if one already exists with same name\n    if(shaderMap.count(pName)){\n      shaderMap[pName]->destroy();\n    }\n    \n    rm.paths.addSearchPath(\"..\/..\/\", true);\n    rm.paths.addAppPaths();\n    rm.paths.addSearchPath(\".\", true);\n    \n    rm.add(vName);\n    rm.add(fName);\n\n    al::Shader vert, frag;\n\n    if(rm[vName].loaded) vert.source(vertLibCode + rm.data(vName), al::Shader::VERTEX).compile().printLog();\n    if(rm[fName].loaded) frag.source(fragLibCode + rm.data(fName), al::Shader::FRAGMENT).compile().printLog();\n\n    al::ShaderProgram *s = new al::ShaderProgram();\n\n    std::cout << \"Attaching Vertex Shader: \" << vName << std::endl;\n    std::cout << \"Attaching Fragment Shader: \" << fName << std::endl;\n    \n    if(rm[vName].loaded) s->attach(vert);\n    if(rm[fName].loaded) s->attach(frag);\n\n    s->link(); \n    s->printLog();\n    \/\/ s->listParams();\n\n    shaderMap[pName] = s;\n\n    return s;\n  }\n\n  al::ShaderProgram* addShaderFile(std::string pName) {\n    std::string vName = pName + \".vert\";\n    std::string fName = pName + \".frag\";\n\n    return addShaderFile(pName, vName, fName);\n  }\n\n  al::ShaderProgram* addShaderFile(std::string pName, std::string vName, std::string gName, std::string fName) {\n    \/\/ destroy shader if one already exists with same name\n    if(shaderMap.count(pName)){\n      shaderMap[pName]->destroy();\n    }\n    \n    rm.paths.addSearchPath(\"..\/..\/\", true);\n    rm.paths.addAppPaths();\n    rm.paths.addSearchPath(\".\", true);\n    \n    rm.add(vName);\n    rm.add(fName);\n    rm.add(gName);\n    \n    al::Shader vert, frag, geom;\n\n    if(rm[vName].loaded) vert.source(vertLibCode + rm.data(vName), al::Shader::VERTEX).compile().printLog();\n    if(rm[gName].loaded) geom.source(fragLibCode + rm.data(gName), al::Shader::GEOMETRY).compile().printLog();\n    if(rm[fName].loaded) frag.source(rm.data(fName), al::Shader::FRAGMENT).compile().printLog();\n\n    al::ShaderProgram *s = new al::ShaderProgram();\n\n    std::cout << \"Attaching Vertex Shader: \" << vName << std::endl;\n    if(rm[vName].loaded) s->attach(vert);\n    \n    if(rm[gName].loaded) {\n      std::cout << \"Attaching Geometry Shader: \" << gName << std::endl;\n      s->setGeometryInputPrimitive(al::Graphics::LINES);\n      s->setGeometryOutputPrimitive(al::Graphics::TRIANGLE_STRIP);\n      s->setGeometryOutputVertices(18);\n      s->attach(geom);\n    }\n\n    std::cout << \"Attaching Fragment Shader: \" << fName << std::endl;\n    if(rm[fName].loaded) s->attach(frag);\n\n    s->link(); \n    s->printLog();\n    \/\/ s->listParams();\n\n    shaderMap[pName] = s;\n\n    return s;\n  }\n  \n  \/\/ checks modified time tag and returns true if files in resource manager had been changed\n  bool poll() {\n    return rm.poll();\n  }\n\n  void destroy() {\n    for (std::map<std::string, al::ShaderProgram*>::iterator it = shaderMap.begin(); it != shaderMap.end(); ++it) {\n      (it->second)->invalidate();\n    }\n  }\n};\n\n#endif\n<commit_msg>add function to get searchpath ref from shadermanager<commit_after>#ifndef INCLUDE_AL_SHADERMANAGER_HPP\n#define INCLUDE_AL_SHADERMANAGER_HPP\n\n#include \"allocore\/graphics\/al_Shader.hpp\"\n#include \"alloutil\/al_ResourceManager.hpp\"\n#include <map>\n\nstruct ShaderManager {\n  std::map<std::string, al::ShaderProgram*> shaderMap;\n  std::string vertLibCode;\n  std::string fragLibCode;\n  al::ResourceManager rm;\n\n  al::SearchPaths& paths(){ return rm.paths;}\n\n  al::ShaderProgram* get(std::string name) {\n    return shaderMap[name];\n  }\n\n  al::ShaderProgram* addShaderString(std::string name, std::string vertCode, std::string fragCode) {\n    \/\/ destroy shader if one already exists with same name\n    if(shaderMap.count(name)){\n      shaderMap[name]->destroy();\n    }\n\n    al::Shader vert, frag;\n    vert.source(vertLibCode + vertCode, al::Shader::VERTEX).compile();\n    vert.printLog();\n    frag.source(fragLibCode + fragCode, al::Shader::FRAGMENT).compile();\n    frag.printLog();\n\n    al::ShaderProgram *s = new al::ShaderProgram();\n    s->attach(vert).attach(frag).link();\n    s->printLog();\n    \/\/s->listParams();\n\n    shaderMap[name] = s;\n\n    return s;\n  }\n\n  al::ShaderProgram* addShaderFile(std::string pName, std::string vName, std::string fName) {\n    \/\/ destroy shader if one already exists with same name\n    if(shaderMap.count(pName)){\n      shaderMap[pName]->destroy();\n    }\n    \n    rm.paths.addSearchPath(\"..\/..\/\", true);\n    rm.paths.addAppPaths();\n    rm.paths.addSearchPath(\".\", true);\n    \n    rm.add(vName);\n    rm.add(fName);\n\n    al::Shader vert, frag;\n\n    if(rm[vName].loaded) vert.source(vertLibCode + rm.data(vName), al::Shader::VERTEX).compile().printLog();\n    if(rm[fName].loaded) frag.source(fragLibCode + rm.data(fName), al::Shader::FRAGMENT).compile().printLog();\n\n    al::ShaderProgram *s = new al::ShaderProgram();\n\n    std::cout << \"Attaching Vertex Shader: \" << vName << std::endl;\n    std::cout << \"Attaching Fragment Shader: \" << fName << std::endl;\n    \n    if(rm[vName].loaded) s->attach(vert);\n    if(rm[fName].loaded) s->attach(frag);\n\n    s->link(); \n    s->printLog();\n    \/\/ s->listParams();\n\n    shaderMap[pName] = s;\n\n    return s;\n  }\n\n  al::ShaderProgram* addShaderFile(std::string pName) {\n    std::string vName = pName + \".vert\";\n    std::string fName = pName + \".frag\";\n\n    return addShaderFile(pName, vName, fName);\n  }\n\n  al::ShaderProgram* addShaderFile(std::string pName, std::string vName, std::string gName, std::string fName) {\n    \/\/ destroy shader if one already exists with same name\n    if(shaderMap.count(pName)){\n      shaderMap[pName]->destroy();\n    }\n    \n    rm.paths.addSearchPath(\"..\/..\/\", true);\n    rm.paths.addAppPaths();\n    rm.paths.addSearchPath(\".\", true);\n    \n    rm.add(vName);\n    rm.add(fName);\n    rm.add(gName);\n    \n    al::Shader vert, frag, geom;\n\n    if(rm[vName].loaded) vert.source(vertLibCode + rm.data(vName), al::Shader::VERTEX).compile().printLog();\n    if(rm[gName].loaded) geom.source(fragLibCode + rm.data(gName), al::Shader::GEOMETRY).compile().printLog();\n    if(rm[fName].loaded) frag.source(rm.data(fName), al::Shader::FRAGMENT).compile().printLog();\n\n    al::ShaderProgram *s = new al::ShaderProgram();\n\n    std::cout << \"Attaching Vertex Shader: \" << vName << std::endl;\n    if(rm[vName].loaded) s->attach(vert);\n    \n    if(rm[gName].loaded) {\n      std::cout << \"Attaching Geometry Shader: \" << gName << std::endl;\n      s->setGeometryInputPrimitive(al::Graphics::LINES);\n      s->setGeometryOutputPrimitive(al::Graphics::TRIANGLE_STRIP);\n      s->setGeometryOutputVertices(18);\n      s->attach(geom);\n    }\n\n    std::cout << \"Attaching Fragment Shader: \" << fName << std::endl;\n    if(rm[fName].loaded) s->attach(frag);\n\n    s->link(); \n    s->printLog();\n    \/\/ s->listParams();\n\n    shaderMap[pName] = s;\n\n    return s;\n  }\n  \n  \/\/ checks modified time tag and returns true if files in resource manager had been changed\n  bool poll() {\n    return rm.poll();\n  }\n\n  void destroy() {\n    for (std::map<std::string, al::ShaderProgram*>::iterator it = shaderMap.begin(); it != shaderMap.end(); ++it) {\n      (it->second)->invalidate();\n    }\n  }\n};\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2013, Matthew Harvey. All rights reserved.\n\n#include \"account_dialog.hpp\"\n#include \"account.hpp\"\n#include \"account_type.hpp\"\n#include \"account_type_ctrl.hpp\"\n#include \"budget_panel.hpp\"\n#include \"decimal_text_ctrl.hpp\"\n#include \"ordinary_journal.hpp\"\n#include \"persistent_object_event.hpp\"\n#include \"phatbooks_exceptions.hpp\"\n#include \"sizing.hpp\"\n#include <boost\/noncopyable.hpp>\n#include <jewel\/decimal.hpp>\n#include <jewel\/optional.hpp>\n#include <sqloxx\/database_transaction.hpp>\n#include <wx\/button.h>\n#include <wx\/dialog.h>\n#include <wx\/event.h>\n#include <wx\/gbsizer.h>\n#include <wx\/gdicmn.h>\n#include <wx\/msgdlg.h>\n#include <wx\/stattext.h>\n#include <wx\/string.h>\n#include <wx\/textctrl.h>\n#include <wx\/window.h>\n#include <cassert>\n\nusing jewel::Decimal;\nusing jewel::UninitializedOptionalException;\nusing sqloxx::DatabaseTransaction;\n\n\/\/ For debugging\n#include <jewel\/debug_log.hpp>\n#include <iostream>\nusing std::endl;\n\n\nnamespace phatbooks\n{\nnamespace gui\n{\n\nBEGIN_EVENT_TABLE(AccountDialog, wxDialog)\n\tEVT_BUTTON\n\t(\twxID_OK,\n\t\tAccountDialog::on_ok_button_click\n\t)\n\tEVT_BUTTON\n\t(\twxID_CANCEL,\n\t\tAccountDialog::on_cancel_button_click\n\t)\nEND_EVENT_TABLE()\n\n\nnamespace\n{\n\twxString account_super_type_string\n\t(\taccount_super_type::AccountSuperType p_account_super_type\n\t)\n\t{\n\t\treturn account_concept_name(p_account_super_type, true);\n\t}\n\n\twxString account_name_ctrl_label_string\n\t(\taccount_super_type::AccountSuperType p_account_super_type\n\t)\n\t{\n\t\treturn\n\t\t\taccount_super_type_string(p_account_super_type) +\n\t\t\twxString(\" name\");\n\t}\n\n\twxString account_type_ctrl_label_string\n\t(\taccount_super_type::AccountSuperType p_account_super_type\n\t)\n\t{\n\t\treturn\n\t\t\taccount_super_type_string(p_account_super_type) +\n\t\t\twxString(\" type\");\n\t}\n\n\twxString account_description_label_string\n\t(\taccount_super_type::AccountSuperType p_account_super_type\n\t)\n\t{\n\t\t(void)p_account_super_type;  \/\/ silence compiler re. unused param.\n\t\treturn wxString(\"Description\");\n\t}\n\n\twxString opening_amount_label_string\n\t(\taccount_super_type::AccountSuperType p_account_super_type\n\t)\n\t{\n\t\tswitch (p_account_super_type)\n\t\t{\n\t\tcase account_super_type::balance_sheet:\n\t\t\treturn wxString(\"Opening balance\");\n\t\tcase account_super_type::pl:\n\t\t\treturn wxString(\"Initial budget allocation\");\n\t\tdefault:\n\t\t\tassert (false);\n\t\t}\n\t\tassert (false);\n\t}\n\t\n}  \/\/ end anonymous namespace\n\n\nAccountDialog::AccountDialog\n(\twxWindow* p_parent,\n\tAccount& p_account,\n\taccount_super_type::AccountSuperType p_account_super_type\n):\n\twxDialog(p_parent, wxID_ANY, wxEmptyString),\n\tm_current_row(0),\n\tm_top_sizer(0),\n\tm_name_ctrl(0),\n\tm_account_type_ctrl(0),\n\tm_description_ctrl(0),\n\tm_opening_amount_ctrl(0),\n\tm_budget_panel(0),\n\tm_account(p_account)\n{\n\tassert (p_parent);  \/\/ precondition\n\tif\n\t(\tm_account.has_id() &&\n\t\t(super_type(m_account.account_type()) != p_account_super_type)\n\t)\n\t{\n\t\tthrow InvalidAccountTypeException\n\t\t(\t\"AccountType of Account passed to AccountDialog constructor does \"\n\t\t\t\"not belong to the AccountSuperType passed to the same \"\n\t\t\t\"constructor.\"\n\t\t);\n\t}\n\tm_top_sizer = new wxGridBagSizer(standard_gap(), standard_gap());\n\tSetSizer(m_top_sizer);\n\n\t\/\/ Row 0\n\t\n\twxStaticText* name_ctrl_label = new wxStaticText\n\t(\tthis,\n\t\twxID_ANY,\n\t\taccount_name_ctrl_label_string(p_account_super_type),\n\t\twxDefaultPosition,\n\t\twxSize(medium_width(), wxDefaultSize.GetY()),\n\t\twxALIGN_RIGHT | wxALIGN_CENTRE_VERTICAL\n\t);\n\tm_top_sizer->Add\n\t(\tname_ctrl_label,\n\t\twxGBPosition(m_current_row, 1),\n\t\twxDefaultSpan,\n\t\twxALIGN_RIGHT | wxALIGN_CENTRE_VERTICAL\n\t);\n\twxString name_tmp = wxEmptyString;\n\tif (m_account.has_id())\n\t{\n\t\tname_tmp = bstring_to_wx(p_account.name());\n\t}\n\tm_name_ctrl = new wxTextCtrl\n\t(\tthis,\n\t\twxID_ANY,\n\t\tname_tmp,\n\t\twxDefaultPosition,\n\t\twxSize(extra_large_width(), wxDefaultSize.y)\n\t);\n\tm_top_sizer->Add\n\t(\tm_name_ctrl,\n\t\twxGBPosition(m_current_row, 2),\n\t\twxGBSpan(1, 3)\n\t);\n\n\t++m_current_row;\n\n\t\/\/ Row 1\n\n\twxStaticText* account_type_ctrl_label = new wxStaticText\n\t(\tthis,\n\t\twxID_ANY,\n\t\taccount_type_ctrl_label_string(p_account_super_type),\n\t\twxDefaultPosition,\n\t\twxSize(medium_width(), wxDefaultSize.GetY()),\n\t\twxALIGN_RIGHT | wxALIGN_CENTRE_VERTICAL\n\t);\n\tm_top_sizer->Add\n\t(\taccount_type_ctrl_label,\n\t\twxGBPosition(m_current_row, 1),\n\t\twxDefaultSpan,\n\t\twxALIGN_RIGHT | wxALIGN_CENTRE_VERTICAL\n\t);\n\tm_account_type_ctrl = new AccountTypeCtrl\n\t(\tthis,\n\t\twxID_ANY,\n\t\tm_name_ctrl->GetSize(),\n\t\tm_account.database_connection(),\n\t\tp_account_super_type\n\t);\n\tif (m_account.has_id())\n\t{\t\n\t\tm_account_type_ctrl->set_account_type(m_account.account_type());\n\t}\n\tm_top_sizer->Add\n\t(\tm_account_type_ctrl,\n\t\twxGBPosition(m_current_row, 2),\n\t\twxGBSpan(1, 3)\n\t);\n\n\t++m_current_row;\n\n\t\/\/ Row 2\n\t\n\twxStaticText* description_label = new wxStaticText\n\t(\tthis,\n\t\twxID_ANY,\n\t\taccount_description_label_string(p_account_super_type),\n\t\twxDefaultPosition,\n\t\twxSize(medium_width(), wxDefaultSize.GetY()),\n\t\twxALIGN_RIGHT | wxALIGN_CENTRE_VERTICAL\n\t);\n\tm_top_sizer->Add\n\t(\tdescription_label,\n\t\twxGBPosition(m_current_row, 1),\n\t\twxDefaultSpan,\n\t\twxALIGN_RIGHT | wxALIGN_CENTRE_VERTICAL\n\t);\n\twxString description_tmp = wxEmptyString;\n\tif (m_account.has_id())\n\t{\n\t\tdescription_tmp = bstring_to_wx(p_account.description());\n\t}\n\tm_description_ctrl = new wxTextCtrl\n\t(\tthis,\n\t\twxID_ANY,\n\t\tdescription_tmp,\n\t\twxDefaultPosition,\n\t\tm_name_ctrl->GetSize()\n\t);\n\tm_top_sizer->Add\n\t(\tm_description_ctrl,\n\t\twxGBPosition(m_current_row, 2),\n\t\twxGBSpan(1, 3)\n\t);\n\n\t++m_current_row;\n\n\t\/\/ Row 3\n\t\n\twxStaticText* opening_amount_ctrl_label = new wxStaticText\n\t(\tthis,\n\t\twxID_ANY,\n\t\topening_amount_label_string(p_account_super_type),\n\t\twxDefaultPosition,\n\t\twxSize(medium_width(), wxDefaultSize.GetY()),\n\t\twxALIGN_RIGHT | wxALIGN_CENTRE_VERTICAL\n\t);\n\tm_top_sizer->Add\n\t(\topening_amount_ctrl_label,\n\t\twxGBPosition(m_current_row, 1),\n\t\twxDefaultSpan,\n\t\twxALIGN_RIGHT | wxALIGN_CENTRE_VERTICAL\n\t);\n\tm_opening_amount_ctrl = new DecimalTextCtrl\n\t(\tthis,\n\t\twxID_ANY,\n\t\twxSize(medium_width(), wxDefaultSize.y),\n\t\tm_account.database_connection().default_commodity().precision(),\n\t\tfalse\n\t);\n\tif (m_account.has_id())\n\t{\n\t\tm_opening_amount_ctrl->\n\t\t\tset_amount(m_account.friendly_opening_balance());\n\t}\n\tm_top_sizer->Add\n\t(\tm_opening_amount_ctrl,\n\t\twxGBPosition(m_current_row, 2),\n\t\twxGBSpan(1, 1)\n\t);\n\t\n\t\/\/ Hack to add some space to right.\n\twxStaticText* dummy = new wxStaticText(this, wxID_ANY, wxEmptyString);\n\tm_top_sizer->Add(dummy, wxGBPosition(m_current_row, standard_border()));\n\n\tconfigure_budget_panel();\n\tconfigure_buttons();\n\tm_top_sizer->Fit(this);\n\tm_top_sizer->SetSizeHints(this);\n\tCentreOnScreen();\n\tLayout();\n}\n\nvoid\nAccountDialog::configure_budget_panel()\n{\n\t++m_current_row;\n\tassert (!m_budget_panel);\n\tif (account_super_type() == account_super_type::balance_sheet)\n\t{\n\t\t\/\/ There are no \"bottom controls\" for balance sheet Accounts.\n\t\treturn;\n\t}\n\tif (m_account == m_account.database_connection().balancing_account())\n\t{\n\t\t\/\/ Cannot edit budgets for the budget balancing Account.\n\t\treturn;\n\t}\n\tassert (account_super_type() == account_super_type::pl);\n\t\n\t\/\/ Make sure m_account has an AccountType.\n\tassert (m_account_type_ctrl);\n\ttry\n\t{\n\t\taccount_type::AccountType dummy = m_account.account_type();\n\t\t(void)dummy;  \/\/ silence compiler re. unused variable\n\t}\n\tcatch (UninitializedOptionalException&)\n\t{\n\t\tm_account.set_account_type(m_account_type_ctrl->account_type());\n\t}\n\tm_budget_panel = new BudgetPanel(this, m_account);\n\tm_top_sizer->Add\n\t(\tm_budget_panel,\n\t\twxGBPosition(m_current_row, 1),\n\t\twxGBSpan(1, 4)\n\t);\n\t++m_current_row;\n\treturn;\n}\n\nvoid\nAccountDialog::configure_buttons()\n{\n\tm_cancel_button = new wxButton\n\t(\tthis,\n\t\twxID_CANCEL,\n\t\twxString(\"&Cancel\"),\n\t\twxDefaultPosition,\n\t\twxSize(medium_width(), m_name_ctrl->GetSize().y),\n\t\twxALIGN_RIGHT  \/\/ WARNING Doesn't seem to work\n\t);\n\tm_top_sizer->Add\n\t(\tm_cancel_button,\n\t\twxGBPosition(m_current_row, 3),\n\t\twxDefaultSpan,\n\t\twxALIGN_RIGHT  \/\/ WARNING Doesn't seem to work\n\t);\n\tm_ok_button = new wxButton\n\t(\tthis,\n\t\twxID_OK,\n\t\twxString(\"&Save\"),\n\t\twxDefaultPosition,\n\t\twxSize(medium_width(), m_name_ctrl->GetSize().y)\n\t);\n\tm_top_sizer->Add\n\t(\tm_ok_button,\n\t\twxGBPosition(m_current_row, 4),\n\t\twxDefaultSpan,\n\t\twxALIGN_LEFT\n\t);\n\treturn;\n}\n\naccount_super_type::AccountSuperType\nAccountDialog::account_super_type() const\n{\n\tassert (m_account_type_ctrl);\n\treturn super_type(m_account_type_ctrl->account_type());\n}\n\nvoid\nAccountDialog::on_ok_button_click(wxCommandEvent& event)\n{\n\t(void)event;  \/\/ Silence compiler re. unused parameter.\n\tif (update_account_from_dialog(!m_account.has_id()))\n\t{\n\t\tif (m_budget_panel && m_budget_panel->process_confirmation())\n\t\t{\n\t\t\tEndModal(wxID_OK);\n\t\t}\n\t}\n\treturn;\n}\n\nvoid\nAccountDialog::on_cancel_button_click(wxCommandEvent& event)\n{\n\t(void)event;  \/\/ Silence compiler re. unused parameter.\n\tEndModal(wxID_CANCEL);\n\treturn;\n}\n\nbool\nAccountDialog::update_account_from_dialog(bool p_is_new_account)\n{\n\tDatabaseTransaction transaction(m_account.database_connection());\n\n\tAccount temp = m_account;\n\tBString const prospective_name =\n\t\twx_to_bstring(m_name_ctrl->GetValue().Trim());\n\tif (Account::exists(temp.database_connection(), prospective_name))\n\t{\n\t\tbool const name_matches =\n\t\t(\tbstring_to_wx(m_account.name()).Lower() ==\n\t\t\tbstring_to_wx(prospective_name).Lower()\n\t\t);\n\t\tif (m_account.has_id() && name_matches)\n\t\t{\n\t\t\t\/\/ Then everything's OK, the user has just kept the original\n\t\t\t\/\/ name.\n\t\t}\n\t\telse\n\t\t{\n\t\t\twxMessageBox\n\t\t\t(\twxString(\"There is already \") +\n\t\t\t\tbstring_to_wx(account_concepts_phrase(true)) +\n\t\t\t\twxString(\" with this name.\")\n\t\t\t);\n\t\t\treturn false;\n\t\t}\n\t}\n\tif (prospective_name.IsEmpty())\n\t{\n\t\twxMessageBox(\"Name cannot be blank.\");\n\t\treturn false;\n\t}\n\ttemp.set_name(m_name_ctrl->GetValue());\n\ttemp.set_account_type(m_account_type_ctrl->account_type());\n\ttemp.set_description(m_description_ctrl->GetValue());\n\t\t\n\tif (p_is_new_account)\n\t{\n\t\ttemp.set_commodity\n\t\t(\tm_account.database_connection().default_commodity()\n\t\t);\n\t}\n\n\ttemp.save();\n\t\n\tDecimal opening_amount = m_opening_amount_ctrl->amount();\n\tif (super_type(temp.account_type()) == account_super_type::pl)\n\t{\n\t\t\/\/ TODO Handle small possibility of overflow here.\n\t\topening_amount = -opening_amount;\n\t}\n\tOrdinaryJournal objnl = OrdinaryJournal::create_opening_balance_journal\n\t(\ttemp,\n\t\topening_amount\n\t);\n\tobjnl.save();\n\n\tm_account = temp;\n\ttransaction.commit();\n\n\t\/\/ Notify window higher in the hierarchy that they need to update for\n\t\/\/ changed Account and new OridinaryJournal.\n\tassert (GetParent());\n\twxEventType const event_type =\n\t(\tp_is_new_account?\n\t\tPHATBOOKS_ACCOUNT_CREATED_EVENT:\n\t\tPHATBOOKS_ACCOUNT_EDITED_EVENT\n\t);\n\tPersistentObjectEvent::fire\n\t(\tGetParent(),  \/\/ can't use \"this\" here, or event is missed\n\t\tevent_type,\n\t\tm_account\n\t);\n\tPersistentObjectEvent::fire\n\t(\tGetParent(),  \/\/ can't use \"this\" here, or event is missed\n\t\tPHATBOOKS_JOURNAL_CREATED_EVENT,\n\t\tobjnl\n\t);\n\treturn true;\n}\n\n}  \/\/ namespace gui\n}  \/\/ namespace phatbooks\n<commit_msg>Fixed error in AccountDialog::on_ok_button_click, where EndModal(wxID_OK) was not being called for balance sheet Accounts.<commit_after>\/\/ Copyright (c) 2013, Matthew Harvey. All rights reserved.\n\n#include \"account_dialog.hpp\"\n#include \"account.hpp\"\n#include \"account_type.hpp\"\n#include \"account_type_ctrl.hpp\"\n#include \"budget_panel.hpp\"\n#include \"decimal_text_ctrl.hpp\"\n#include \"ordinary_journal.hpp\"\n#include \"persistent_object_event.hpp\"\n#include \"phatbooks_exceptions.hpp\"\n#include \"sizing.hpp\"\n#include <boost\/noncopyable.hpp>\n#include <jewel\/decimal.hpp>\n#include <jewel\/optional.hpp>\n#include <sqloxx\/database_transaction.hpp>\n#include <wx\/button.h>\n#include <wx\/dialog.h>\n#include <wx\/event.h>\n#include <wx\/gbsizer.h>\n#include <wx\/gdicmn.h>\n#include <wx\/msgdlg.h>\n#include <wx\/stattext.h>\n#include <wx\/string.h>\n#include <wx\/textctrl.h>\n#include <wx\/window.h>\n#include <cassert>\n\nusing jewel::Decimal;\nusing jewel::UninitializedOptionalException;\nusing sqloxx::DatabaseTransaction;\n\n\/\/ For debugging\n#include <jewel\/debug_log.hpp>\n#include <iostream>\nusing std::endl;\n\n\nnamespace phatbooks\n{\nnamespace gui\n{\n\nBEGIN_EVENT_TABLE(AccountDialog, wxDialog)\n\tEVT_BUTTON\n\t(\twxID_OK,\n\t\tAccountDialog::on_ok_button_click\n\t)\n\tEVT_BUTTON\n\t(\twxID_CANCEL,\n\t\tAccountDialog::on_cancel_button_click\n\t)\nEND_EVENT_TABLE()\n\n\nnamespace\n{\n\twxString account_super_type_string\n\t(\taccount_super_type::AccountSuperType p_account_super_type\n\t)\n\t{\n\t\treturn account_concept_name(p_account_super_type, true);\n\t}\n\n\twxString account_name_ctrl_label_string\n\t(\taccount_super_type::AccountSuperType p_account_super_type\n\t)\n\t{\n\t\treturn\n\t\t\taccount_super_type_string(p_account_super_type) +\n\t\t\twxString(\" name\");\n\t}\n\n\twxString account_type_ctrl_label_string\n\t(\taccount_super_type::AccountSuperType p_account_super_type\n\t)\n\t{\n\t\treturn\n\t\t\taccount_super_type_string(p_account_super_type) +\n\t\t\twxString(\" type\");\n\t}\n\n\twxString account_description_label_string\n\t(\taccount_super_type::AccountSuperType p_account_super_type\n\t)\n\t{\n\t\t(void)p_account_super_type;  \/\/ silence compiler re. unused param.\n\t\treturn wxString(\"Description\");\n\t}\n\n\twxString opening_amount_label_string\n\t(\taccount_super_type::AccountSuperType p_account_super_type\n\t)\n\t{\n\t\tswitch (p_account_super_type)\n\t\t{\n\t\tcase account_super_type::balance_sheet:\n\t\t\treturn wxString(\"Opening balance\");\n\t\tcase account_super_type::pl:\n\t\t\treturn wxString(\"Initial budget allocation\");\n\t\tdefault:\n\t\t\tassert (false);\n\t\t}\n\t\tassert (false);\n\t}\n\t\n}  \/\/ end anonymous namespace\n\n\nAccountDialog::AccountDialog\n(\twxWindow* p_parent,\n\tAccount& p_account,\n\taccount_super_type::AccountSuperType p_account_super_type\n):\n\twxDialog(p_parent, wxID_ANY, wxEmptyString),\n\tm_current_row(0),\n\tm_top_sizer(0),\n\tm_name_ctrl(0),\n\tm_account_type_ctrl(0),\n\tm_description_ctrl(0),\n\tm_opening_amount_ctrl(0),\n\tm_budget_panel(0),\n\tm_account(p_account)\n{\n\tassert (p_parent);  \/\/ precondition\n\tif\n\t(\tm_account.has_id() &&\n\t\t(super_type(m_account.account_type()) != p_account_super_type)\n\t)\n\t{\n\t\tthrow InvalidAccountTypeException\n\t\t(\t\"AccountType of Account passed to AccountDialog constructor does \"\n\t\t\t\"not belong to the AccountSuperType passed to the same \"\n\t\t\t\"constructor.\"\n\t\t);\n\t}\n\tm_top_sizer = new wxGridBagSizer(standard_gap(), standard_gap());\n\tSetSizer(m_top_sizer);\n\n\t\/\/ Row 0\n\t\n\twxStaticText* name_ctrl_label = new wxStaticText\n\t(\tthis,\n\t\twxID_ANY,\n\t\taccount_name_ctrl_label_string(p_account_super_type),\n\t\twxDefaultPosition,\n\t\twxSize(medium_width(), wxDefaultSize.GetY()),\n\t\twxALIGN_RIGHT | wxALIGN_CENTRE_VERTICAL\n\t);\n\tm_top_sizer->Add\n\t(\tname_ctrl_label,\n\t\twxGBPosition(m_current_row, 1),\n\t\twxDefaultSpan,\n\t\twxALIGN_RIGHT | wxALIGN_CENTRE_VERTICAL\n\t);\n\twxString name_tmp = wxEmptyString;\n\tif (m_account.has_id())\n\t{\n\t\tname_tmp = bstring_to_wx(p_account.name());\n\t}\n\tm_name_ctrl = new wxTextCtrl\n\t(\tthis,\n\t\twxID_ANY,\n\t\tname_tmp,\n\t\twxDefaultPosition,\n\t\twxSize(extra_large_width(), wxDefaultSize.y)\n\t);\n\tm_top_sizer->Add\n\t(\tm_name_ctrl,\n\t\twxGBPosition(m_current_row, 2),\n\t\twxGBSpan(1, 3)\n\t);\n\n\t++m_current_row;\n\n\t\/\/ Row 1\n\n\twxStaticText* account_type_ctrl_label = new wxStaticText\n\t(\tthis,\n\t\twxID_ANY,\n\t\taccount_type_ctrl_label_string(p_account_super_type),\n\t\twxDefaultPosition,\n\t\twxSize(medium_width(), wxDefaultSize.GetY()),\n\t\twxALIGN_RIGHT | wxALIGN_CENTRE_VERTICAL\n\t);\n\tm_top_sizer->Add\n\t(\taccount_type_ctrl_label,\n\t\twxGBPosition(m_current_row, 1),\n\t\twxDefaultSpan,\n\t\twxALIGN_RIGHT | wxALIGN_CENTRE_VERTICAL\n\t);\n\tm_account_type_ctrl = new AccountTypeCtrl\n\t(\tthis,\n\t\twxID_ANY,\n\t\tm_name_ctrl->GetSize(),\n\t\tm_account.database_connection(),\n\t\tp_account_super_type\n\t);\n\tif (m_account.has_id())\n\t{\t\n\t\tm_account_type_ctrl->set_account_type(m_account.account_type());\n\t}\n\tm_top_sizer->Add\n\t(\tm_account_type_ctrl,\n\t\twxGBPosition(m_current_row, 2),\n\t\twxGBSpan(1, 3)\n\t);\n\n\t++m_current_row;\n\n\t\/\/ Row 2\n\t\n\twxStaticText* description_label = new wxStaticText\n\t(\tthis,\n\t\twxID_ANY,\n\t\taccount_description_label_string(p_account_super_type),\n\t\twxDefaultPosition,\n\t\twxSize(medium_width(), wxDefaultSize.GetY()),\n\t\twxALIGN_RIGHT | wxALIGN_CENTRE_VERTICAL\n\t);\n\tm_top_sizer->Add\n\t(\tdescription_label,\n\t\twxGBPosition(m_current_row, 1),\n\t\twxDefaultSpan,\n\t\twxALIGN_RIGHT | wxALIGN_CENTRE_VERTICAL\n\t);\n\twxString description_tmp = wxEmptyString;\n\tif (m_account.has_id())\n\t{\n\t\tdescription_tmp = bstring_to_wx(p_account.description());\n\t}\n\tm_description_ctrl = new wxTextCtrl\n\t(\tthis,\n\t\twxID_ANY,\n\t\tdescription_tmp,\n\t\twxDefaultPosition,\n\t\tm_name_ctrl->GetSize()\n\t);\n\tm_top_sizer->Add\n\t(\tm_description_ctrl,\n\t\twxGBPosition(m_current_row, 2),\n\t\twxGBSpan(1, 3)\n\t);\n\n\t++m_current_row;\n\n\t\/\/ Row 3\n\t\n\twxStaticText* opening_amount_ctrl_label = new wxStaticText\n\t(\tthis,\n\t\twxID_ANY,\n\t\topening_amount_label_string(p_account_super_type),\n\t\twxDefaultPosition,\n\t\twxSize(medium_width(), wxDefaultSize.GetY()),\n\t\twxALIGN_RIGHT | wxALIGN_CENTRE_VERTICAL\n\t);\n\tm_top_sizer->Add\n\t(\topening_amount_ctrl_label,\n\t\twxGBPosition(m_current_row, 1),\n\t\twxDefaultSpan,\n\t\twxALIGN_RIGHT | wxALIGN_CENTRE_VERTICAL\n\t);\n\tm_opening_amount_ctrl = new DecimalTextCtrl\n\t(\tthis,\n\t\twxID_ANY,\n\t\twxSize(medium_width(), wxDefaultSize.y),\n\t\tm_account.database_connection().default_commodity().precision(),\n\t\tfalse\n\t);\n\tif (m_account.has_id())\n\t{\n\t\tm_opening_amount_ctrl->\n\t\t\tset_amount(m_account.friendly_opening_balance());\n\t}\n\tm_top_sizer->Add\n\t(\tm_opening_amount_ctrl,\n\t\twxGBPosition(m_current_row, 2),\n\t\twxGBSpan(1, 1)\n\t);\n\t\n\t\/\/ Hack to add some space to right.\n\twxStaticText* dummy = new wxStaticText(this, wxID_ANY, wxEmptyString);\n\tm_top_sizer->Add(dummy, wxGBPosition(m_current_row, standard_border()));\n\n\tconfigure_budget_panel();\n\tconfigure_buttons();\n\tm_top_sizer->Fit(this);\n\tm_top_sizer->SetSizeHints(this);\n\tCentreOnScreen();\n\tLayout();\n}\n\nvoid\nAccountDialog::configure_budget_panel()\n{\n\t++m_current_row;\n\tassert (!m_budget_panel);\n\tif (account_super_type() == account_super_type::balance_sheet)\n\t{\n\t\t\/\/ There are no \"bottom controls\" for balance sheet Accounts.\n\t\treturn;\n\t}\n\tif (m_account == m_account.database_connection().balancing_account())\n\t{\n\t\t\/\/ Cannot edit budgets for the budget balancing Account.\n\t\treturn;\n\t}\n\tassert (account_super_type() == account_super_type::pl);\n\t\n\t\/\/ Make sure m_account has an AccountType.\n\tassert (m_account_type_ctrl);\n\ttry\n\t{\n\t\taccount_type::AccountType dummy = m_account.account_type();\n\t\t(void)dummy;  \/\/ silence compiler re. unused variable\n\t}\n\tcatch (UninitializedOptionalException&)\n\t{\n\t\tm_account.set_account_type(m_account_type_ctrl->account_type());\n\t}\n\tm_budget_panel = new BudgetPanel(this, m_account);\n\tm_top_sizer->Add\n\t(\tm_budget_panel,\n\t\twxGBPosition(m_current_row, 1),\n\t\twxGBSpan(1, 4)\n\t);\n\t++m_current_row;\n\treturn;\n}\n\nvoid\nAccountDialog::configure_buttons()\n{\n\tm_cancel_button = new wxButton\n\t(\tthis,\n\t\twxID_CANCEL,\n\t\twxString(\"&Cancel\"),\n\t\twxDefaultPosition,\n\t\twxSize(medium_width(), m_name_ctrl->GetSize().y),\n\t\twxALIGN_RIGHT  \/\/ WARNING Doesn't seem to work\n\t);\n\tm_top_sizer->Add\n\t(\tm_cancel_button,\n\t\twxGBPosition(m_current_row, 3),\n\t\twxDefaultSpan,\n\t\twxALIGN_RIGHT  \/\/ WARNING Doesn't seem to work\n\t);\n\tm_ok_button = new wxButton\n\t(\tthis,\n\t\twxID_OK,\n\t\twxString(\"&Save\"),\n\t\twxDefaultPosition,\n\t\twxSize(medium_width(), m_name_ctrl->GetSize().y)\n\t);\n\tm_top_sizer->Add\n\t(\tm_ok_button,\n\t\twxGBPosition(m_current_row, 4),\n\t\twxDefaultSpan,\n\t\twxALIGN_LEFT\n\t);\n\treturn;\n}\n\naccount_super_type::AccountSuperType\nAccountDialog::account_super_type() const\n{\n\tassert (m_account_type_ctrl);\n\treturn super_type(m_account_type_ctrl->account_type());\n}\n\nvoid\nAccountDialog::on_ok_button_click(wxCommandEvent& event)\n{\n\t(void)event;  \/\/ Silence compiler re. unused parameter.\n\tif (update_account_from_dialog(!m_account.has_id()))\n\t{\n\t\tif (!m_budget_panel)\n\t\t{\n\t\t\tEndModal(wxID_OK);\n\t\t}\n\t\telse if (m_budget_panel->process_confirmation())\n\t\t{\n\t\t\tEndModal(wxID_OK);\n\t\t}\n\t}\n\treturn;\n}\n\nvoid\nAccountDialog::on_cancel_button_click(wxCommandEvent& event)\n{\n\t(void)event;  \/\/ Silence compiler re. unused parameter.\n\tEndModal(wxID_CANCEL);\n\treturn;\n}\n\nbool\nAccountDialog::update_account_from_dialog(bool p_is_new_account)\n{\n\tDatabaseTransaction transaction(m_account.database_connection());\n\n\tAccount temp = m_account;\n\tBString const prospective_name =\n\t\twx_to_bstring(m_name_ctrl->GetValue().Trim());\n\tif (Account::exists(temp.database_connection(), prospective_name))\n\t{\n\t\tbool const name_matches =\n\t\t(\tbstring_to_wx(m_account.name()).Lower() ==\n\t\t\tbstring_to_wx(prospective_name).Lower()\n\t\t);\n\t\tif (m_account.has_id() && name_matches)\n\t\t{\n\t\t\t\/\/ Then everything's OK, the user has just kept the original\n\t\t\t\/\/ name.\n\t\t}\n\t\telse\n\t\t{\n\t\t\twxMessageBox\n\t\t\t(\twxString(\"There is already \") +\n\t\t\t\tbstring_to_wx(account_concepts_phrase(true)) +\n\t\t\t\twxString(\" with this name.\")\n\t\t\t);\n\t\t\treturn false;\n\t\t}\n\t}\n\tif (prospective_name.IsEmpty())\n\t{\n\t\twxMessageBox(\"Name cannot be blank.\");\n\t\treturn false;\n\t}\n\ttemp.set_name(m_name_ctrl->GetValue());\n\ttemp.set_account_type(m_account_type_ctrl->account_type());\n\ttemp.set_description(m_description_ctrl->GetValue());\n\t\t\n\tif (p_is_new_account)\n\t{\n\t\ttemp.set_commodity\n\t\t(\tm_account.database_connection().default_commodity()\n\t\t);\n\t}\n\n\ttemp.save();\n\t\n\tDecimal opening_amount = m_opening_amount_ctrl->amount();\n\tif (super_type(temp.account_type()) == account_super_type::pl)\n\t{\n\t\t\/\/ TODO Handle small possibility of overflow here.\n\t\topening_amount = -opening_amount;\n\t}\n\tOrdinaryJournal objnl = OrdinaryJournal::create_opening_balance_journal\n\t(\ttemp,\n\t\topening_amount\n\t);\n\tobjnl.save();\n\n\tm_account = temp;\n\ttransaction.commit();\n\n\t\/\/ Notify window higher in the hierarchy that they need to update for\n\t\/\/ changed Account and new OridinaryJournal.\n\tassert (GetParent());\n\twxEventType const event_type =\n\t(\tp_is_new_account?\n\t\tPHATBOOKS_ACCOUNT_CREATED_EVENT:\n\t\tPHATBOOKS_ACCOUNT_EDITED_EVENT\n\t);\n\tPersistentObjectEvent::fire\n\t(\tGetParent(),  \/\/ can't use \"this\" here, or event is missed\n\t\tevent_type,\n\t\tm_account\n\t);\n\tPersistentObjectEvent::fire\n\t(\tGetParent(),  \/\/ can't use \"this\" here, or event is missed\n\t\tPHATBOOKS_JOURNAL_CREATED_EVENT,\n\t\tobjnl\n\t);\n\treturn true;\n}\n\n}  \/\/ namespace gui\n}  \/\/ namespace phatbooks\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <iomanip> \/\/ << fixed << setprecision(xxx)\n#include <algorithm> \/\/ do { } while ( next_permutation(A, A+xxx) ) ;\n#include <vector>\n#include <string> \/\/ to_string(nnn) \/\/ substr(m, n) \/\/ stoi(nnn)\n#include <complex>\n#include <tuple> \/\/ get<n>(xxx)\n#include <queue>\n#include <stack>\n#include <map> \/\/ if (M.find(key) != M.end()) { }\n#include <set> \/\/ S.insert(M);\n\/\/ if (S.find(key) != S.end()) { }\n\/\/ for (auto it=S.begin(); it != S.end(); it++) { }\n\/\/ auto it = S.lower_bound(M);\n#include <random> \/\/ random_device rd; mt19937 mt(rd());\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib> \/\/ atoi(xxx)\nusing namespace std;\n\n#define DEBUG 0 \/\/ change 0 -> 1 if we need debug.\n\/\/ insert #if<tab> by my emacs. #if DEBUG == 1 ... #end\n\ntypedef long long ll;\n\n\/\/ const int dx[4] = {1, 0, -1, 0};\n\/\/ const int dy[4] = {0, 1, 0, -1};\n\n\/\/ const int C = 1e6+10;\n\/\/ const ll M = 1000000007;\n\nvector<int> V[100010];\nbool visited[100010];\n\ntypedef tuple<int, int> state;\n\nint main () {\n  int N;\n  cin >> N;\n  for (auto i = 0; i < N-1; ++i) {\n    int a, b;\n    a--;\n    b--;\n    cin >> a >> b;\n    V[a].push_back(b);\n    V[b].push_back(a);\n  }\n  stack<state> S;\n  S.push(state(N-1, 0));\n  int parent;\n  int D;\n  fill(visited, visited+N, false);\n  while (!S.empty()) {\n    int now = get<0>(S.top());\n    int d = get<1>(S.top());\n    S.pop();\n    if (!visited[now]) {\n      visited[now] = true;\n      if (now == 0) {\n        D = d;\n        parent = now;\n        break;\n      }\n      for (auto x : V[now]) {\n        if (!visited[x]) {\n          S.push(state(x, d+1));\n        }\n      }\n    }\n  }\n  stack<state> SS;\n  SS.push(state(0, 0));\n  int cnt = 0;\n  fill(visited, visited+N, false);\n  while (!SS.empty()) {\n    int now = get<0>(SS.top());\n    int d = get<1>(SS.top());\n    SS.pop();\n    if (!visited[now]) {\n      visited[now] = true;\n      cnt++;\n      for (auto x : V[now]) {\n        if (!visited[x] && x != parent) {\n          SS.push(state(x, d+1));\n        }\n      }\n    }    \n  }\n  int su = (D-1)\/2 + cnt - 1;\n  int fa = N - 2 - fa;\n  if (fa > su) {\n    cout << \"Fennec\" << endl;\n  } else {\n    cout << \"Snuke\" << endl;\n  }\n}\n<commit_msg>submit D.cpp to 'D - Fennec VS. Snuke' (arc078) [C++14 (GCC 5.4.1)]<commit_after>#include <iostream>\n#include <iomanip> \/\/ << fixed << setprecision(xxx)\n#include <algorithm> \/\/ do { } while ( next_permutation(A, A+xxx) ) ;\n#include <vector>\n#include <string> \/\/ to_string(nnn) \/\/ substr(m, n) \/\/ stoi(nnn)\n#include <complex>\n#include <tuple> \/\/ get<n>(xxx)\n#include <queue>\n#include <stack>\n#include <map> \/\/ if (M.find(key) != M.end()) { }\n#include <set> \/\/ S.insert(M);\n\/\/ if (S.find(key) != S.end()) { }\n\/\/ for (auto it=S.begin(); it != S.end(); it++) { }\n\/\/ auto it = S.lower_bound(M);\n#include <random> \/\/ random_device rd; mt19937 mt(rd());\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib> \/\/ atoi(xxx)\nusing namespace std;\n\n#define DEBUG 0 \/\/ change 0 -> 1 if we need debug.\n\/\/ insert #if<tab> by my emacs. #if DEBUG == 1 ... #end\n\ntypedef long long ll;\n\n\/\/ const int dx[4] = {1, 0, -1, 0};\n\/\/ const int dy[4] = {0, 1, 0, -1};\n\n\/\/ const int C = 1e6+10;\n\/\/ const ll M = 1000000007;\n\nvector<int> V[100010];\nbool visited[100010];\n\ntypedef tuple<int, int> state;\n\nint main () {\n  int N;\n  cin >> N;\n  for (auto i = 0; i < N-1; ++i) {\n    int a, b;\n    a--;\n    b--;\n    cin >> a >> b;\n    V[a].push_back(b);\n    V[b].push_back(a);\n  }\n  stack<state> S;\n  S.push(state(N-1, 0));\n  int parent;\n  int D;\n  fill(visited, visited+N, false);\n  while (!S.empty()) {\n    int now = get<0>(S.top());\n    int d = get<1>(S.top());\n    S.pop();\n    if (!visited[now]) {\n      visited[now] = true;\n      if (now == 0) {\n        D = d;\n        parent = now;\n        break;\n      }\n      for (auto x : V[now]) {\n        if (!visited[x]) {\n          S.push(state(x, d+1));\n        }\n      }\n    }\n  }\n  stack<state> SS;\n  SS.push(state(0, 0));\n  int cnt = 0;\n  fill(visited, visited+N, false);\n  while (!SS.empty()) {\n    int now = get<0>(SS.top());\n    int d = get<1>(SS.top());\n    SS.pop();\n    if (!visited[now]) {\n      visited[now] = true;\n      cnt++;\n      for (auto x : V[now]) {\n        if (!visited[x] && x != parent) {\n          SS.push(state(x, d+1));\n        }\n      }\n    }    \n  }\n  int su = (D-1)\/2 + cnt - 1;\n  int fa = N - 2 - su;\n  if (fa > su) {\n    cout << \"Fennec\" << endl;\n  } else {\n    cout << \"Snuke\" << endl;\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <iomanip> \/\/ << fixed << setprecision(xxx)\n#include <algorithm> \/\/ do { } while ( next_permutation(A, A+xxx) ) ;\n#include <vector>\n#include <string> \/\/ to_string(nnn) \/\/ substr(m, n) \/\/ stoi(nnn)\n#include <complex>\n#include <tuple> \/\/ get<n>(xxx)\n#include <queue>\n#include <stack>\n#include <map> \/\/ if (M.find(key) != M.end()) { }\n#include <set> \/\/ S.insert(M);\n\/\/ if (S.find(key) != S.end()) { }\n\/\/ for (auto it=S.begin(); it != S.end(); it++) { }\n\/\/ auto it = S.lower_bound(M);\n#include <random> \/\/ random_device rd; mt19937 mt(rd());\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib> \/\/ atoi(xxx)\nusing namespace std;\n\n#define DEBUG 0 \/\/ change 0 -> 1 if we need debug.\n\/\/ insert #if<tab> by my emacs. #if DEBUG == 1 ... #end\n\ntypedef long long ll;\n\n\/\/ const int dx[4] = {1, 0, -1, 0};\n\/\/ const int dy[4] = {0, 1, 0, -1};\n\n\/\/ const int C = 1e6+10;\n\/\/ const ll M = 1000000007;\n\nint N;\nint p[200010];\nvector<int> V[200010];\nbool visited[200010];\nbool isloop[200010];\nint memo[200010];\n\nint calc(int v) {\n  if (memo[v] != -1) return memo[v];\n  set<int> S;\n  for (auto x : V[v]) {\n    S.insert(calc(x));\n  }\n  for (auto i = 0; ; ++i) {\n    if (S.find(i) == S.end()) {\n      return (memo[v] = i);\n    }\n  }\n}\n\nint main () {\n  cin >> N;\n  for (auto i = 0; i < N; ++i) {\n    cin >> p[i];\n    p[i]--;\n  }\n  for (auto i = 0; i < N; ++i) {\n    V[p[i]].push_back(i);\n  }\n  fill(visited, visited+200010, false);\n  int now = 0;\n  while (!visited[now]) {\n    visited[now] = true;\n    now = p[now];\n  }\n  fill(isloop, isloop+200010, false);\n  while (!isloop[now]) {\n    isloop[now] = true;\n    now = p[now];\n  }\n  cerr << \"now = \" << now << endl;\n  fill(memo, memo+200010, -1);\n  for (auto i = 0; i < N; ++i) {\n    if (!isloop[i]) calc(i);\n    cerr << \"calc(\" << i << \") = \" << calc(i) << endl;\n  }\n  vector<int> kouho;\n  set<int> S;\n  for (auto x : V[now]) {\n    cerr << \"x = \" << x << endl;\n    if (!isloop[x]) {\n      S.insert(calc(x));\n    }\n  }  \n  for (auto i = 0; ; ++i) {\n    if (S.find(i) == S.end()) {\n      kouho.push_back(i);\n      if (kouho.size() == 2) break;\n    }\n  }\n  cerr << \"kouho: \";\n  for (auto x : kouho) {\n    cerr << x << \" \";\n  }\n  cerr << endl;\n  for (auto z : kouho) {\n    for (auto i = 0; i < N; ++i) {\n      if (isloop[i]) memo[now] = -1;\n    }\n    memo[now] = z;\n    for (auto i = 0; i < N; ++i) {\n      if (isloop[i] && i != now) calc(i);\n    }\n    memo[now] = -1;\n    if (calc(now) == z) {\n      cout << \"POSSIBLE\" << endl;\n      return 0;\n    }\n  }\n  cout << \"IMPOSSIBLE\" << endl;\n}\n<commit_msg>tried F.cpp to 'F'<commit_after>#include <iostream>\n#include <iomanip> \/\/ << fixed << setprecision(xxx)\n#include <algorithm> \/\/ do { } while ( next_permutation(A, A+xxx) ) ;\n#include <vector>\n#include <string> \/\/ to_string(nnn) \/\/ substr(m, n) \/\/ stoi(nnn)\n#include <complex>\n#include <tuple> \/\/ get<n>(xxx)\n#include <queue>\n#include <stack>\n#include <map> \/\/ if (M.find(key) != M.end()) { }\n#include <set> \/\/ S.insert(M);\n\/\/ if (S.find(key) != S.end()) { }\n\/\/ for (auto it=S.begin(); it != S.end(); it++) { }\n\/\/ auto it = S.lower_bound(M);\n#include <random> \/\/ random_device rd; mt19937 mt(rd());\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib> \/\/ atoi(xxx)\nusing namespace std;\n\n#define DEBUG 0 \/\/ change 0 -> 1 if we need debug.\n\/\/ insert #if<tab> by my emacs. #if DEBUG == 1 ... #end\n\ntypedef long long ll;\n\n\/\/ const int dx[4] = {1, 0, -1, 0};\n\/\/ const int dy[4] = {0, 1, 0, -1};\n\n\/\/ const int C = 1e6+10;\n\/\/ const ll M = 1000000007;\n\nint N;\nint p[200010];\nvector<int> V[200010];\nbool visited[200010];\nbool isloop[200010];\nint memo[200010];\n\nint calc(int v) {\n  cerr << \"v = \" << v << endl;\n  if (memo[v] != -1) return memo[v];\n  set<int> S;\n  for (auto x : V[v]) {\n    S.insert(calc(x));\n  }\n  for (auto i = 0; ; ++i) {\n    if (S.find(i) == S.end()) {\n      return (memo[v] = i);\n    }\n  }\n}\n\nint main () {\n  cin >> N;\n  for (auto i = 0; i < N; ++i) {\n    cin >> p[i];\n    p[i]--;\n  }\n  for (auto i = 0; i < N; ++i) {\n    V[p[i]].push_back(i);\n  }\n  fill(visited, visited+200010, false);\n  int now = 0;\n  while (!visited[now]) {\n    visited[now] = true;\n    now = p[now];\n  }\n  fill(isloop, isloop+200010, false);\n  while (!isloop[now]) {\n    isloop[now] = true;\n    now = p[now];\n  }\n  cerr << \"now = \" << now << endl;\n  fill(memo, memo+200010, -1);\n  for (auto i = 0; i < N; ++i) {\n    if (!isloop[i]) calc(i);\n    cerr << \"calc(\" << i << \") = \" << calc(i) << endl;\n  }\n  vector<int> kouho;\n  set<int> S;\n  for (auto x : V[now]) {\n    if (!isloop[x]) {\n      S.insert(calc(x));\n    }\n  }  \n  for (auto i = 0; ; ++i) {\n    if (S.find(i) == S.end()) {\n      kouho.push_back(i);\n      if (kouho.size() == 2) break;\n    }\n  }\n  cerr << \"kouho: \";\n  for (auto x : kouho) {\n    cerr << x << \" \";\n  }\n  cerr << endl;\n  for (auto z : kouho) {\n    for (auto i = 0; i < N; ++i) {\n      if (isloop[i]) memo[now] = -1;\n    }\n    memo[now] = z;\n    for (auto i = 0; i < N; ++i) {\n      if (isloop[i] && i != now) calc(i);\n    }\n    memo[now] = -1;\n    if (calc(now) == z) {\n      cout << \"POSSIBLE\" << endl;\n      return 0;\n    }\n  }\n  cout << \"IMPOSSIBLE\" << endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <iomanip> \/\/ << fixed << setprecision(xxx)\n#include <algorithm> \/\/ do { } while ( next_permutation(A, A+xxx) ) ;\n#include <vector>\n#include <string> \/\/ to_string(nnn) \/\/ substr(m, n) \/\/ stoi(nnn)\n#include <complex>\n#include <tuple> \/\/ get<n>(xxx)\n#include <queue>\n#include <stack>\n#include <map> \/\/ if (M.find(key) != M.end()) { }\n#include <set> \/\/ S.insert(M);\n\/\/ if (S.find(key) != S.end()) { }\n\/\/ for (auto it=S.begin(); it != S.end(); it++) { }\n\/\/ auto it = S.lower_bound(M);\n#include <random> \/\/ random_device rd; mt19937 mt(rd());\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib> \/\/ atoi(xxx)\nusing namespace std;\n\n#define DEBUG 0 \/\/ change 0 -> 1 if we need debug.\n\/\/ insert #if<tab> by my emacs. #if DEBUG == 1 ... #end\n\ntypedef long long ll;\n\n\/\/ const int dx[4] = {1, 0, -1, 0};\n\/\/ const int dy[4] = {0, 1, 0, -1};\n\n\/\/ const int C = 1e6+10;\n\/\/ const ll M = 1000000007;\n\n\nconst int MAX_SIZE = 1000010;\nconst long long MOD = 1000000007;\n\nlong long inv[MAX_SIZE];\nlong long fact[MAX_SIZE];\nlong long factinv[MAX_SIZE];\n\nvoid init() {\n  inv[1] = 1;\n  for (int i=2; i<MAX_SIZE; i++) {\n    inv[i] = ((MOD - inv[MOD%i]) * (MOD\/i))%MOD;\n  }\n  fact[0] = factinv[0] = 1;\n  for (int i=1; i<MAX_SIZE; i++) {\n    fact[i] = (i * fact[i-1])%MOD;\n    factinv[i] = (inv[i] * factinv[i-1])%MOD;\n  }\n}\n\nlong long C(int n, int k) {\n  if (n >=0 && k >= 0 && n-k >= 0) {\n    return ((fact[n] * factinv[k])%MOD * factinv[n-k])%MOD;\n  }\n  return 0;\n}\n\nlong long power(long long x, long long n) {\n  if (n == 0) {\n    return 1;\n  } else if (n%2 == 1) {\n    return (x * power(x, n-1)) % MOD;\n  } else {\n    long long half = power(x, n\/2);\n    return (half * half) % MOD;\n  }\n}\n\nlong long gcm(long long a, long long b) {\n  if (a < b) {\n    return gcm(b, a);\n  }\n  if (b == 0) return a;\n  return gcm(b, a%b);\n}\n\nll H, W, A, B;\n\nll calc(ll x, ll y, ll s, ll t) {\n  return C(s-x+t-y, s-x);\n}\n\nint main() {\n  init();\n  cin >> H >> W >> A >> B;\n  ll ans = 0;\n  for (auto i = 0; i < H-A; ++i) {\n    ans += (calc(0, 0, i, B) * calc(i, B, H-1, W-1))%MOD;\n    ans %= MOD;\n  }\n  cout << ans << endl;\n}\n<commit_msg>submit D.cpp to 'D - いろはちゃんとマス目 \/ Iroha and a Grid' (abc042) [C++14 (GCC 5.4.1)]<commit_after>#include <iostream>\n#include <iomanip> \/\/ << fixed << setprecision(xxx)\n#include <algorithm> \/\/ do { } while ( next_permutation(A, A+xxx) ) ;\n#include <vector>\n#include <string> \/\/ to_string(nnn) \/\/ substr(m, n) \/\/ stoi(nnn)\n#include <complex>\n#include <tuple> \/\/ get<n>(xxx)\n#include <queue>\n#include <stack>\n#include <map> \/\/ if (M.find(key) != M.end()) { }\n#include <set> \/\/ S.insert(M);\n\/\/ if (S.find(key) != S.end()) { }\n\/\/ for (auto it=S.begin(); it != S.end(); it++) { }\n\/\/ auto it = S.lower_bound(M);\n#include <random> \/\/ random_device rd; mt19937 mt(rd());\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib> \/\/ atoi(xxx)\nusing namespace std;\n\n#define DEBUG 0 \/\/ change 0 -> 1 if we need debug.\n\/\/ insert #if<tab> by my emacs. #if DEBUG == 1 ... #end\n\ntypedef long long ll;\n\n\/\/ const int dx[4] = {1, 0, -1, 0};\n\/\/ const int dy[4] = {0, 1, 0, -1};\n\n\/\/ const int C = 1e6+10;\n\/\/ const ll M = 1000000007;\n\n\nconst int MAX_SIZE = 1000010;\nconst long long MOD = 1000000007;\n\nlong long inv[MAX_SIZE];\nlong long fact[MAX_SIZE];\nlong long factinv[MAX_SIZE];\n\nvoid init() {\n  inv[1] = 1;\n  for (int i=2; i<MAX_SIZE; i++) {\n    inv[i] = ((MOD - inv[MOD%i]) * (MOD\/i))%MOD;\n  }\n  fact[0] = factinv[0] = 1;\n  for (int i=1; i<MAX_SIZE; i++) {\n    fact[i] = (i * fact[i-1])%MOD;\n    factinv[i] = (inv[i] * factinv[i-1])%MOD;\n  }\n}\n\nlong long C(int n, int k) {\n  if (n >=0 && k >= 0 && n-k >= 0) {\n    return ((fact[n] * factinv[k])%MOD * factinv[n-k])%MOD;\n  }\n  return 0;\n}\n\nlong long power(long long x, long long n) {\n  if (n == 0) {\n    return 1;\n  } else if (n%2 == 1) {\n    return (x * power(x, n-1)) % MOD;\n  } else {\n    long long half = power(x, n\/2);\n    return (half * half) % MOD;\n  }\n}\n\nlong long gcm(long long a, long long b) {\n  if (a < b) {\n    return gcm(b, a);\n  }\n  if (b == 0) return a;\n  return gcm(b, a%b);\n}\n\nll H, W, A, B;\n\nll calc(ll x, ll y, ll s, ll t) {\n  return C(s-x+t-y, s-x);\n}\n\nint main() {\n  init();\n  cin >> H >> W >> A >> B;\n  ll ans = 0;\n  for (auto i = 0; i < H-A; ++i) {\n    ans += (calc(0, 0, i, B-1) * calc(i, B, H-1, W-1))%MOD;\n    ans %= MOD;\n  }\n  cout << ans << endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <iomanip> \/\/ << fixed << setprecision(xxx)\n#include <algorithm> \/\/ do { } while ( next_permutation(A, A+xxx) ) ;\n#include <vector>\n#include <string> \/\/ to_string(nnn) \/\/ substr(m, n) \/\/ stoi(nnn)\n#include <complex>\n#include <tuple> \/\/ get<n>(xxx)\n#include <queue>\n#include <stack>\n#include <map> \/\/ if (M.find(key) != M.end()) { }\n#include <set> \/\/ S.insert(M);\n\/\/ if (S.find(key) != S.end()) { }\n\/\/ for (auto it=S.begin(); it != S.end(); it++) { }\n\/\/ auto it = S.lower_bound(M);\n#include <random> \/\/ random_device rd; mt19937 mt(rd());\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib> \/\/ atoi(xxx)\nusing namespace std;\n\n#define DEBUG 0 \/\/ change 0 -> 1 if we need debug.\n\/\/ insert #if<tab> by my emacs. #if DEBUG == 1 ... #end\n\ntypedef long long ll;\n\n\/\/ const int dx[4] = {1, 0, -1, 0};\n\/\/ const int dy[4] = {0, 1, 0, -1};\n\n\/\/ const int C = 1e6+10;\n\/\/ const ll M = 1000000007;\n\nint N, M;\ntypedef tuple<int, int> takahashi;\nvector<takahashi> V;\n\nint main () {\n  cin >> N >> M;\n  for (auto i = 0; i < N; ++i) {\n    int L, R;\n    cin >> L >> R;\n    V.push_back(takahashi(L, R));\n  }\n  sort(V.begin(), V.end());\n  priority_queue<int, vector<int>, greater<int> > Q;\n  vector<int> W;\n  int ind = 1;\n  for (auto x : V) {\n    Q.push(get<1>(x));\n    if (ind <= get<0>(x)) {\n      ++ind;\n    } else {\n      \/\/ cerr << Q.top() << endl;\n      W.push_back(Q.top());\n      Q.pop();\n    }\n  }\n  for (auto it = W.begin(); it != W.end(); ++it) {\n    *it = M+1 - *it;\n  }\n  sort(W.begin(), W.end());\n  \/*\n  for (auto x : W) {\n    cerr << x << \" \";\n  }\n  cerr << endl;\n  *\/\n  ind = 1;\n  int ans = 0;\n  for (auto x : W) {\n    if (ind <= x) {\n      ++ind;\n    } else {\n      ++ans;\n    }\n  }\n  cout << ans << endl;\n}\n\n<commit_msg>submit F.cpp to 'F - Exhausted?' (arc076) [C++14 (GCC 5.4.1)]<commit_after>#include <iostream>\n#include <iomanip> \/\/ << fixed << setprecision(xxx)\n#include <algorithm> \/\/ do { } while ( next_permutation(A, A+xxx) ) ;\n#include <vector>\n#include <string> \/\/ to_string(nnn) \/\/ substr(m, n) \/\/ stoi(nnn)\n#include <complex>\n#include <tuple> \/\/ get<n>(xxx)\n#include <queue>\n#include <stack>\n#include <map> \/\/ if (M.find(key) != M.end()) { }\n#include <set> \/\/ S.insert(M);\n\/\/ if (S.find(key) != S.end()) { }\n\/\/ for (auto it=S.begin(); it != S.end(); it++) { }\n\/\/ auto it = S.lower_bound(M);\n#include <random> \/\/ random_device rd; mt19937 mt(rd());\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib> \/\/ atoi(xxx)\nusing namespace std;\n\n#define DEBUG 0 \/\/ change 0 -> 1 if we need debug.\n\/\/ insert #if<tab> by my emacs. #if DEBUG == 1 ... #end\n\ntypedef long long ll;\n\n\/\/ const int dx[4] = {1, 0, -1, 0};\n\/\/ const int dy[4] = {0, 1, 0, -1};\n\n\/\/ const int C = 1e6+10;\n\/\/ const ll M = 1000000007;\n\nint N, M;\ntypedef tuple<int, int> takahashi;\nvector<takahashi> V;\n\nint main () {\n  cin >> N >> M;\n  for (auto i = 0; i < N; ++i) {\n    int L, R;\n    cin >> L >> R;\n    V.push_back(takahashi(L, -R));\n  }\n  sort(V.begin(), V.end());\n  priority_queue<int, vector<int>, greater<int> > Q;\n  vector<int> W;\n  int ind = 1;\n  for (auto x : V) {\n    Q.push(-get<1>(x));\n    if (ind <= get<0>(x)) {\n      ++ind;\n    } else {\n      \/\/ cerr << Q.top() << endl;\n      W.push_back(Q.top());\n      Q.pop();\n    }\n  }\n  for (auto it = W.begin(); it != W.end(); ++it) {\n    *it = M+1 - *it;\n  }\n  sort(W.begin(), W.end());\n  \/*\n  for (auto x : W) {\n    cerr << x << \" \";\n  }\n  cerr << endl;\n  *\/\n  ind = 1;\n  int ans = 0;\n  for (auto x : W) {\n    if (ind <= x) {\n      ++ind;\n    } else {\n      ++ans;\n    }\n  }\n  cout << ans << endl;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <iomanip> \/\/ << fixed << setprecision(xxx)\n#include <algorithm> \/\/ do { } while ( next_permutation(A, A+xxx) ) ;\n#include <vector>\n#include <string> \/\/ to_string(nnn) \/\/ substr(m, n) \/\/ stoi(nnn)\n#include <complex>\n#include <tuple> \/\/ get<n>(xxx)\n#include <queue>\n#include <stack>\n#include <map> \/\/ if (M.find(key) != M.end()) { }\n#include <set> \/\/ S.insert(M);\n\/\/ if (S.find(key) != S.end()) { }\n\/\/ for (auto it=S.begin(); it != S.end(); it++) { }\n\/\/ auto it = S.lower_bound(M);\n#include <random> \/\/ random_device rd; mt19937 mt(rd());\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib> \/\/ atoi(xxx)\nusing namespace std;\n\n#define DEBUG 0 \/\/ change 0 -> 1 if we need debug.\n\/\/ insert #if<tab> by my emacs. #if DEBUG == 1 ... #end\n\ntypedef long long ll;\n\n\/\/ const int dx[4] = {1, 0, -1, 0};\n\/\/ const int dy[4] = {0, 1, 0, -1};\n\n\/\/ const int C = 1e6+10;\n\/\/ const ll M = 1000000007;\n\nstring rep(string c, int n) {\n  string ans = \"\";\n  for (auto i = 0; i < n; ++i) {\n    ans += c;\n  }\n  return ans;\n}\n\nstring repa(int n) {\n  return rep(\"A\", n);\n}\n\nstring repb(int n) {\n  return rep(\"B\", n);\n}\n\nll calc_K(ll A, ll B) {\n  ll ub = 500000010;\n  ll lb = 0;\n  while (ub - lb > 1) {\n    ll t = (ub+lb)\/2;\n    if (A <= (B+1) * t && B <= (A+1) * t) {\n      ub = t;\n    } else {\n      lb = t;\n    }\n  }\n  return ub;\n}\n\nstring f(ll A, ll B, ll C, ll D) {\n  ll K = calc_K(A, B);\n  cerr << \"K = \" << K << endl;\n  ll ub = A+B;\n  ll lb = -1;\n  while (ub - lb > 1) {\n    ll t = (ub+lb)\/2;\n    ll b = t\/(K+1);\n    ll a = t - b;\n    ll rema = A - a;\n    ll remb = B - b;\n    if (remb <= (rema+1) * K) {\n      ub = t;\n    } else {\n      lb = t;\n    }\n  }\n  ll L = ub;\n  cerr << \"L = \" << L << endl;\n  if (D <= L) {\n    int back = (C\/(K+1)) * (K+1);\n    C -= back;\n    D -= back;\n    string X = rep(repa(K) + \"B\", 100);\n    return X.substr(C-1, D-C+1);\n  } else if (C > L) {\n    C = A+B+1-C;\n    D = A+B+1-D;\n    int back = (D\/(K+1)) * (K+1);\n    C -= back;\n    D -= back;    \n    string X = rep(repb(K) + \"A\", 100);\n    cerr << \"X = \" << X << endl;\n    string Y = X.substr(D-1, C-D+1);\n    cerr << \"Y = \" << X << endl;\n    reverse(Y.begin(), Y.end());\n    return Y;\n  } else {\n    int rema = L%(K+1);\n    int remb = (A+B-L)%(K+1);\n    string X = repa(rema) + repb(remb);\n    X = rep(repa(K) + \"B\", 100) + X + rep(\"A\" + repb(K), 100);\n    int back = L - (100 * (K+1) + rema);\n    C -= back;\n    D -= back;\n    return X.substr(C-1, D-C+1);    \n  }\n}\n\nint main () {\n  int Q;\n  cin >> Q;\n  int A[1010], B[1010], C[1010], D[1010];\n  for (auto i = 0; i < Q; ++i) {\n    cin >> A[i] >> B[i] >> C[i] >> D[i];\n  }\n  for (auto i = 0; i < Q; ++i) {\n    string X = f(A[i], B[i], C[i], D[i]);\n    cout << X << endl;\n  }\n}\n<commit_msg>tried D.cpp to 'D'<commit_after>#include <iostream>\n#include <iomanip> \/\/ << fixed << setprecision(xxx)\n#include <algorithm> \/\/ do { } while ( next_permutation(A, A+xxx) ) ;\n#include <vector>\n#include <string> \/\/ to_string(nnn) \/\/ substr(m, n) \/\/ stoi(nnn)\n#include <complex>\n#include <tuple> \/\/ get<n>(xxx)\n#include <queue>\n#include <stack>\n#include <map> \/\/ if (M.find(key) != M.end()) { }\n#include <set> \/\/ S.insert(M);\n\/\/ if (S.find(key) != S.end()) { }\n\/\/ for (auto it=S.begin(); it != S.end(); it++) { }\n\/\/ auto it = S.lower_bound(M);\n#include <random> \/\/ random_device rd; mt19937 mt(rd());\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib> \/\/ atoi(xxx)\nusing namespace std;\n\n#define DEBUG 0 \/\/ change 0 -> 1 if we need debug.\n\/\/ insert #if<tab> by my emacs. #if DEBUG == 1 ... #end\n\ntypedef long long ll;\n\n\/\/ const int dx[4] = {1, 0, -1, 0};\n\/\/ const int dy[4] = {0, 1, 0, -1};\n\n\/\/ const int C = 1e6+10;\n\/\/ const ll M = 1000000007;\n\nstring rep(string c, int n) {\n  string ans = \"\";\n  for (auto i = 0; i < n; ++i) {\n    ans += c;\n  }\n  return ans;\n}\n\nstring repa(int n) {\n  return rep(\"A\", n);\n}\n\nstring repb(int n) {\n  return rep(\"B\", n);\n}\n\nll calc_K(ll A, ll B) {\n  ll ub = 500000010;\n  ll lb = 0;\n  while (ub - lb > 1) {\n    ll t = (ub+lb)\/2;\n    if (A <= (B+1) * t && B <= (A+1) * t) {\n      ub = t;\n    } else {\n      lb = t;\n    }\n  }\n  return ub;\n}\n\nstring f(ll A, ll B, ll C, ll D) {\n  ll K = calc_K(A, B);\n  cerr << \"K = \" << K << endl;\n  ll ub = A+B;\n  ll lb = -1;\n  while (ub - lb > 1) {\n    ll t = (ub+lb)\/2;\n    ll b = t\/(K+1);\n    ll a = t - b;\n    ll rema = A - a;\n    ll remb = B - b;\n    if (remb <= (rema+1) * K) {\n      ub = t;\n    } else {\n      lb = t;\n    }\n  }\n  ll L = ub;\n  cerr << \"L = \" << L << endl;\n  if (D <= L) {\n    int back = (C\/(K+1)) * (K+1);\n    C -= back;\n    D -= back;\n    string X = rep(repa(K) + \"B\", 100);\n    return X.substr(C-1, D-C+1);\n  } else if (C > L) {\n    C = A+B+1-C;\n    D = A+B+1-D;\n    int back = (D\/(K+1)) * (K+1);\n    C -= back;\n    D -= back;\n    cerr << \"C = \" << C << \", D = \" << D << endl;\n    string X = rep(repb(K) + \"A\", 100);\n    cerr << \"X = \" << X << endl;\n    string Y = X.substr(D-1, C-D+1);\n    cerr << \"Y = \" << X << endl;\n    reverse(Y.begin(), Y.end());\n    return Y;\n  } else {\n    int rema = L%(K+1);\n    int remb = (A+B-L)%(K+1);\n    string X = repa(rema) + repb(remb);\n    X = rep(repa(K) + \"B\", 100) + X + rep(\"A\" + repb(K), 100);\n    int back = L - (100 * (K+1) + rema);\n    C -= back;\n    D -= back;\n    return X.substr(C-1, D-C+1);    \n  }\n}\n\nint main () {\n  int Q;\n  cin >> Q;\n  int A[1010], B[1010], C[1010], D[1010];\n  for (auto i = 0; i < Q; ++i) {\n    cin >> A[i] >> B[i] >> C[i] >> D[i];\n  }\n  for (auto i = 0; i < Q; ++i) {\n    string X = f(A[i], B[i], C[i], D[i]);\n    cout << X << endl;\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 2018-4-15 23:25:04\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 <random> \/\/ random_device rd; mt19937 mt(rd());\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, M, Q;\nint a[50];\nint l[50];\nint r[50];\nbool used[50];\n\nll solve()\n{\n  ll ans = 0;\n  for (auto i = 0; i < Q; i++)\n  {\n    int maxi = -1;\n    int ind = 0;\n    for (auto j = 0; j < N; j++)\n    {\n      if (!used[j] && l[i] <= a[j] && a[j] <= r[i] && a[j] > maxi)\n      {\n        maxi = a[j];\n        ind = j;\n      }\n    }\n    if (maxi >= 0)\n    {\n      ans += maxi;\n    }\n  }\n  \/\/ cerr << \"ans = \" << ans << endl;\n  return ans;\n}\n\nvoid solveA()\n{\n  ll ans = 0;\n  for (auto i = 0; i < (1 << N); i++)\n  {\n    int cnt = 0;\n    for (auto j = 0; j < N; j++)\n    {\n      if ((i >> j) & 1)\n      {\n        cnt++;\n      }\n    }\n    if (cnt == M)\n    {\n      for (auto j = 0; j < N; j++)\n      {\n        used[j] = (i >> j) & 1;\n      }\n      ans = min(ans, solve());\n    }\n  }\n  cout << ans << endl;\n}\n\nvoid solveB()\n{\n  fill(used, used + N, false);\n  for (auto i = 0; i < M; i++)\n  {\n    used[i] = false;\n  }\n  cout << solve() << endl;\n}\n\nint main()\n{\n  cin >> N >> M >> Q;\n  for (auto i = 0; i < N; i++)\n  {\n    cin >> a[i];\n  }\n  for (auto i = 0; i < Q; i++)\n  {\n    cin >> l[i] >> r[i];\n  }\n  if (N <= 15)\n  {\n    solveA();\n  }\n  else\n  {\n    solveB();\n  }\n}<commit_msg>tried F.cpp to 'F'<commit_after>\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 2018-4-15 23:25:04\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 <random> \/\/ random_device rd; mt19937 mt(rd());\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, M, Q;\nint a[50];\nint l[50];\nint r[50];\nbool used[50];\n\nll solve()\n{\n  ll ans = 0;\n  for (auto i = 0; i < Q; i++)\n  {\n    int maxi = -1;\n    for (auto j = 0; j < N; j++)\n    {\n      if (!used[j] && l[i] <= a[j] && a[j] <= r[i] && a[j] > maxi)\n      {\n        maxi = a[j];\n      }\n    }\n    if (maxi >= 0)\n    {\n      ans += maxi;\n    }\n  }\n  \/\/ cerr << \"ans = \" << ans << endl;\n  return ans;\n}\n\nvoid solveA()\n{\n  ll ans = 100000000;\n  for (auto i = 0; i < (1 << N); i++)\n  {\n    int cnt = 0;\n    for (auto j = 0; j < N; j++)\n    {\n      if ((i >> j) & 1)\n      {\n        cnt++;\n      }\n    }\n    if (cnt == M)\n    {\n      for (auto j = 0; j < N; j++)\n      {\n        used[j] = (i >> j) & 1;\n      }\n      ans = min(ans, solve());\n    }\n  }\n  cout << ans << endl;\n}\n\nvoid solveB()\n{\n  fill(used, used + N, false);\n  for (auto i = 0; i < M; i++)\n  {\n    used[i] = false;\n  }\n  cout << solve() << endl;\n}\n\nint main()\n{\n  cin >> N >> M >> Q;\n  for (auto i = 0; i < N; i++)\n  {\n    cin >> a[i];\n  }\n  for (auto i = 0; i < Q; i++)\n  {\n    cin >> l[i] >> r[i];\n  }\n  if (N <= 15)\n  {\n    solveA();\n  }\n  else\n  {\n    solveB();\n  }\n}<|endoftext|>"}
{"text":"<commit_before>\/**\n * File    : C.cpp\n * Author  : Kazune Takahashi\n * Created : 2018-4-28 22:56:15\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 <random> \/\/ random_device rd; mt19937 mt(rd());\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\nconst int MAX_SIZE = 1000010;\nconst long long MOD = 1000000007;\n\nlong long inv[MAX_SIZE];\nlong long fact[MAX_SIZE];\nlong long factinv[MAX_SIZE];\n\nvoid init() {\n  inv[1] = 1;\n  for (int i=2; i<MAX_SIZE; i++) {\n    inv[i] = ((MOD - inv[MOD%i]) * (MOD\/i))%MOD;\n  }\n  fact[0] = factinv[0] = 1;\n  for (int i=1; i<MAX_SIZE; i++) {\n    fact[i] = (i * fact[i-1])%MOD;\n    factinv[i] = (inv[i] * factinv[i-1])%MOD;\n  }\n}\n\nlong long C(int n, int k) {\n  if (n >=0 && k >= 0 && n-k >= 0) {\n    return ((fact[n] * factinv[k])%MOD * factinv[n-k])%MOD;\n  }\n  return 0;\n}\n\nlong long power(long long x, long long n) {\n  if (n == 0) {\n    return 1;\n  } else if (n%2 == 1) {\n    return (x * power(x, n-1)) % MOD;\n  } else {\n    long long half = power(x, n\/2);\n    return (half * half) % MOD;\n  }\n}\n\nlong long gcm(long long a, long long b) {\n  if (a < b) {\n    return gcm(b, a);\n  }\n  if (b == 0) return a;\n  return gcm(b, a%b);\n}\n\nll N;\nll Ika[200010];\n\nint main()\n{\n  init();\n  cin >> N;\n  Ika[0] = Ika[1] = 0;\n  if (N == 2)\n  {\n    cout << 1 << endl;\n    return 0;\n  }\n  for (ll A = 2; A <= N - 1; A++)\n  {\n    ll x = N - 1 - A;\n    if (x >= 0 && A >= 0)\n    {\n      Ika[A] = (((C(A - 1, N - 1 - A) * fact[x]) % MOD) * fact[A]) % MOD;\n      cerr << \"Ika[\" << A << \"] = \" << Ika[A] << endl;\n    }\n  }\n  ll ans = 0;\n  for (ll A = 1; A <= N - 1; A++)\n  {\n    ans += (A * ((Ika[A] + MOD - Ika[A - 1]) % MOD)) % MOD;\n    ans %= MOD;\n  }\n  \/\/ cout << ans << endl;\n}<commit_msg>submit C.cpp to 'C - Painting Machines' (agc023) [C++14 (GCC 5.4.1)]<commit_after>\/**\n * File    : C.cpp\n * Author  : Kazune Takahashi\n * Created : 2018-4-28 22:56:15\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 <random> \/\/ random_device rd; mt19937 mt(rd());\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\nconst int MAX_SIZE = 1000010;\nconst long long MOD = 1000000007;\n\nlong long inv[MAX_SIZE];\nlong long fact[MAX_SIZE];\nlong long factinv[MAX_SIZE];\n\nvoid init() {\n  inv[1] = 1;\n  for (int i=2; i<MAX_SIZE; i++) {\n    inv[i] = ((MOD - inv[MOD%i]) * (MOD\/i))%MOD;\n  }\n  fact[0] = factinv[0] = 1;\n  for (int i=1; i<MAX_SIZE; i++) {\n    fact[i] = (i * fact[i-1])%MOD;\n    factinv[i] = (inv[i] * factinv[i-1])%MOD;\n  }\n}\n\nlong long C(int n, int k) {\n  if (n >=0 && k >= 0 && n-k >= 0) {\n    return ((fact[n] * factinv[k])%MOD * factinv[n-k])%MOD;\n  }\n  return 0;\n}\n\nlong long power(long long x, long long n) {\n  if (n == 0) {\n    return 1;\n  } else if (n%2 == 1) {\n    return (x * power(x, n-1)) % MOD;\n  } else {\n    long long half = power(x, n\/2);\n    return (half * half) % MOD;\n  }\n}\n\nlong long gcm(long long a, long long b) {\n  if (a < b) {\n    return gcm(b, a);\n  }\n  if (b == 0) return a;\n  return gcm(b, a%b);\n}\n\nll N;\nll Ika[200010];\n\nint main()\n{\n  init();\n  cin >> N;\n  Ika[0] = Ika[1] = 0;\n  if (N == 2)\n  {\n    cout << 1 << endl;\n    return 0;\n  }\n  for (ll A = 2; A <= N - 1; A++)\n  {\n    ll x = N - 1 - A;\n    if (x >= 0 && A >= 0)\n    {\n      Ika[A] = (((C(A - 1, N - 1 - A) * fact[x]) % MOD) * fact[A]) % MOD;\n      \/\/ cerr << \"Ika[\" << A << \"] = \" << Ika[A] << endl;\n    }\n  }\n  ll ans = 0;\n  for (ll A = 1; A <= N - 1; A++)\n  {\n    ans += (A * ((Ika[A] + MOD - Ika[A - 1]) % MOD)) % MOD;\n    ans %= MOD;\n  }\n  cout << ans << endl;\n}<|endoftext|>"}
{"text":"<commit_before>\/**\n * File    : B.cpp\n * Author  : Kazune Takahashi\n * Created : 2018-5-20 21:05:39\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 <random> \/\/ random_device rd; mt19937 mt(rd());\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;\nconst int infty = 1000000007;\n\nint N;\nint P[200010];\nint dp[200010];\n\nint solve()\n{\n  fill(dp, dp + 200010, infty);\n  for (auto i = 0; i < N; i++)\n  {\n    *lower_bound(dp, dp + N, P[i]) = P[i];\n  }\n  for (auto i = 0; i < N; i++)\n  {\n    cerr << \"dp[\" << i << \"] = \" << dp[i] << endl;\n  }\n  cerr << (lower_bound(dp, dp + N, infty) - dp) << endl;\n  return N - (lower_bound(dp, dp + N, infty) - dp);\n}\n\nint main()\n{\n  cin >> N;\n  for (auto i = 0; i < N; i++)\n  {\n    cin >> P[i];\n  }\n  int ans = solve();\n  cout << ans << endl;\n}<commit_msg>tried B.cpp to 'B'<commit_after>\/**\n * File    : B.cpp\n * Author  : Kazune Takahashi\n * Created : 2018-5-20 21:05:39\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 <random> \/\/ random_device rd; mt19937 mt(rd());\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;\nconst int infty = 1000000007;\n\nint N;\nint P[200010];\nint Q[200010];\nint dp[200010];\n\nint solve()\n{\n  fill(dp, dp + N, infty);\n  for (auto i = 0; i < N; i++)\n  {\n    *lower_bound(dp, dp + N, Q[i]) = Q[i];\n  }\n  return N - (lower_bound(dp, dp + N, infty) - dp);\n}\n\nint main()\n{\n  cin >> N;\n  for (auto i = 0; i < N; i++)\n  {\n    cin >> P[i];\n  }\n  for (auto i = 0; i < N; i++)\n  {\n    Q[P[i]] = i;\n  }\n  int ans = solve();\n  cout << ans << endl;\n}<|endoftext|>"}
{"text":"<commit_before>\/**\n * File    : B.cpp\n * Author  : Kazune Takahashi\n * Created : 2018-11-5 20:21:16\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, X;\nint m[110];\n\nint main()\n{\n  cin >> N >> X;\n  for (auto i = 0; i < N; i++)\n  {\n    cin >> m[i];\n  }\n  for (auto i = 0; i < N; i++)\n  {\n    X -= m[i];\n  }\n  int ans = N;\n  int mini = *min_element(m, m + N);\n  ans += X \/ mini;\n  cout << ans << endl;\n}<commit_msg>submit B.cpp to 'B - Bitter Alchemy' (abc095) [C++14 (GCC 5.4.1)]<commit_after>\/**\n * File    : B.cpp\n * Author  : Kazune Takahashi\n * Created : 2018-11-5 20:21:16\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, X;\nint m[110];\n\nint main()\n{\n  cin >> N >> X;\n  for (auto i = 0; i < N; i++)\n  {\n    cin >> m[i];\n  }\n  X -= accumulate(m, m + N, 0);\n  int ans = N;\n  int mini = *min_element(m, m + N);\n  ans += X \/ mini;\n  cout << ans << endl;\n}<|endoftext|>"}
{"text":"<commit_before>#define DEBUG 1\n\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 2019-5-26 22:16:32\n * Powered by Visual Studio Code\n *\/\n\n#include <iostream>\n#include <iomanip>   \/\/ << fixed << setprecision(xxx)\n#include <algorithm> \/\/ do { } while ( next_permutation(A, A+xxx) ) ;\n#include <vector>\n#include <string> \/\/ to_string(nnn) \/\/ substr(m, n) \/\/ stoi(nnn)\n#include <complex>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <map> \/\/ if (M.find(key) != M.end()) { }\n#include <set>\n#include <functional>\n#include <random> \/\/ auto rd = bind(uniform_int_distribution<int>(0, 9), mt19937(10101010));\n#include <chrono> \/\/ std::chrono::system_clock::time_point start_time, end_time;\n\/\/ start = std::chrono::system_clock::now();\n\/\/ double elapsed = std::chrono::duration_cast<std::chrono::milliseconds>(end_time-start_time).count();\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\nusing namespace std;\n\ntypedef long long ll;\n\n\/\/ const int dx[4] = {1, 0, -1, 0};\n\/\/ const int dy[4] = {0, 1, 0, -1};\n\n\/\/ const int C = 1e6+10;\n\/\/ const ll M = 1000000007;\n\nint N;\nll ans = 0;\nll s[100010];\n\nint main()\n{\n  cin >> N;\n  for (auto i = 0; i < N; i++)\n  {\n    cin >> s[i];\n  }\n  for (auto t = 1; t <= N - 1; t += 2)\n  {\n    if ((N - 1) % t == 0)\n    {\n      int d = (N - 1) \/ t;\n      ll t = 0;\n      for (auto i = 0; i < N; i += d)\n      {\n        t += s[i];\n      }\n      ans = max(ans, t);\n    }\n  }\n  for (auto d = 1; d < N; d++)\n  {\n    ll t = 0;\n    set<int> S;\n    int mini = 0;\n    int maxi = N - 1;\n    while (mini < N && maxi >= 0 && S.find(mini) == S.end() && S.find(maxi) == S.end())\n    {\n      t += s[mini];\n      t += s[maxi];\n      ans = max(ans, t);\n      mini += d;\n      maxi -= d;\n    }\n  }\n  cout << ans << endl;\n}<commit_msg>tried F.cpp to 'F'<commit_after>#define DEBUG 1\n\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 2019-5-26 22:16:32\n * Powered by Visual Studio Code\n *\/\n\n#include <iostream>\n#include <iomanip>   \/\/ << fixed << setprecision(xxx)\n#include <algorithm> \/\/ do { } while ( next_permutation(A, A+xxx) ) ;\n#include <vector>\n#include <string> \/\/ to_string(nnn) \/\/ substr(m, n) \/\/ stoi(nnn)\n#include <complex>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <map> \/\/ if (M.find(key) != M.end()) { }\n#include <set>\n#include <functional>\n#include <random> \/\/ auto rd = bind(uniform_int_distribution<int>(0, 9), mt19937(10101010));\n#include <chrono> \/\/ std::chrono::system_clock::time_point start_time, end_time;\n\/\/ start = std::chrono::system_clock::now();\n\/\/ double elapsed = std::chrono::duration_cast<std::chrono::milliseconds>(end_time-start_time).count();\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\nusing namespace std;\n\ntypedef long long ll;\n\n\/\/ const int dx[4] = {1, 0, -1, 0};\n\/\/ const int dy[4] = {0, 1, 0, -1};\n\n\/\/ const int C = 1e6+10;\n\/\/ const ll M = 1000000007;\n\nint N;\nll ans = 0;\nll s[100010];\n\nint main()\n{\n  cin >> N;\n  for (auto i = 0; i < N; i++)\n  {\n    cin >> s[i];\n  }\n  for (auto t = 1; t <= N - 1; t += 2)\n  {\n    if ((N - 1) % t == 0)\n    {\n      int d = (N - 1) \/ t;\n      ll t = 0;\n      for (auto i = 0; i < N; i += d)\n      {\n        t += s[i];\n      }\n      ans = max(ans, t);\n    }\n  }\n  for (auto d = 1; d < N; d++)\n  {\n    ll t = 0;\n    set<int> S;\n    int mini = 0;\n    int maxi = N - 1;\n    while (mini < N && maxi >= 0 && S.find(mini) == S.end() && S.find(maxi) == S.end())\n    {\n      t += s[mini];\n      t += s[maxi];\n      S.insert(mini);\n      S.insert(maxi);\n      ans = max(ans, t);\n      mini += d;\n      maxi -= d;\n    }\n  }\n  cout << ans << endl;\n}<|endoftext|>"}
{"text":"<commit_before>#define DEBUG 1\n\/**\n * File    : D.cpp\n * Author  : Kazune Takahashi\n * Created : 5\/18\/2020, 2:29:08 PM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(const Mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(const Mint &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(const Mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(const Mint &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n  Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n  Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n  Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n  bool operator<(const Mint &a) const { return x < a.x; }\n  bool operator<=(const Mint &a) const { return x <= a.x; }\n  bool operator>(const Mint &a) const { return x > a.x; }\n  bool operator>=(const Mint &a) const { return x >= a.x; }\n  bool operator==(const Mint &a) const { return x == a.x; }\n  bool operator!=(const Mint &a) const { return !(*this == a); }\n  const Mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, const Mint<MOD> &rhs)\n{\n  return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, const Mint<MOD> &rhs)\n{\n  return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n  return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, const Mint<MOD> &a)\n{\n  return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2LL; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1LL; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\ntemplate <typename T>\nT gcd(T x, T y) { return y ? gcd(y, x % y) : x; }\ntemplate <typename T>\nT lcm(T x, T y) { return x \/ gcd(x, y) * y; }\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n  int ans{0};\n  while (x != 0)\n  {\n    ans += x & 1;\n    x >>= 1;\n  }\n  return ans;\n}\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1000000000000000LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\/\/ ----- main() -----\n\nint main()\n{\n  ll N, K;\n  cin >> N >> K;\n  vector<ll> A(N);\n  for (auto i = 0; i < N; ++i)\n  {\n    cin >> A[i];\n  }\n  ll sum{0};\n  ll cnt{0};\n  int right{0};\n  for (auto left = 0; left < N; ++left)\n  {\n    while (right < N && sum + A[right] < K)\n    {\n      sum += A[right++];\n    }\n#if DEBUG == 1\n    cerr << \"left = \" << left << \", right = \" << right << endl;\n#endif\n    sum += right - left + 1;\n  }\n  cout << N * (N - 1) \/ 2 - cnt << endl;\n}\n<commit_msg>tried D.cpp to 'D'<commit_after>#define DEBUG 1\n\/**\n * File    : D.cpp\n * Author  : Kazune Takahashi\n * Created : 5\/18\/2020, 2:29:08 PM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(const Mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(const Mint &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(const Mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(const Mint &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n  Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n  Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n  Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n  bool operator<(const Mint &a) const { return x < a.x; }\n  bool operator<=(const Mint &a) const { return x <= a.x; }\n  bool operator>(const Mint &a) const { return x > a.x; }\n  bool operator>=(const Mint &a) const { return x >= a.x; }\n  bool operator==(const Mint &a) const { return x == a.x; }\n  bool operator!=(const Mint &a) const { return !(*this == a); }\n  const Mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, const Mint<MOD> &rhs)\n{\n  return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, const Mint<MOD> &rhs)\n{\n  return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n  return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, const Mint<MOD> &a)\n{\n  return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2LL; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1LL; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\ntemplate <typename T>\nT gcd(T x, T y) { return y ? gcd(y, x % y) : x; }\ntemplate <typename T>\nT lcm(T x, T y) { return x \/ gcd(x, y) * y; }\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n  int ans{0};\n  while (x != 0)\n  {\n    ans += x & 1;\n    x >>= 1;\n  }\n  return ans;\n}\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1000000000000000LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\/\/ ----- main() -----\n\nint main()\n{\n  ll N, K;\n  cin >> N >> K;\n  vector<ll> A(N);\n  for (auto i = 0; i < N; ++i)\n  {\n    cin >> A[i];\n  }\n  ll sum{0};\n  ll cnt{0};\n  int right{0};\n  for (auto left = 0; left < N; ++left)\n  {\n    while (right < N && sum < K)\n    {\n      sum += A[right++];\n    }\n#if DEBUG == 1\n    cerr << \"left = \" << left << \", right = \" << right << endl;\n#endif\n    sum += right - left;\n  }\n  cout << N * (N - 1) \/ 2 - cnt << endl;\n}\n<|endoftext|>"}
{"text":"<commit_before>#define DEBUG 1\n\/**\n * File    : E.cpp\n * Author  : Kazune Takahashi\n * Created : 5\/20\/2020, 11:04:10 PM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(const Mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(const Mint &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(const Mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(const Mint &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n  Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n  Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n  Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n  bool operator<(const Mint &a) const { return x < a.x; }\n  bool operator<=(const Mint &a) const { return x <= a.x; }\n  bool operator>(const Mint &a) const { return x > a.x; }\n  bool operator>=(const Mint &a) const { return x >= a.x; }\n  bool operator==(const Mint &a) const { return x == a.x; }\n  bool operator!=(const Mint &a) const { return !(*this == a); }\n  const Mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, const Mint<MOD> &rhs)\n{\n  return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, const Mint<MOD> &rhs)\n{\n  return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n  return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, const Mint<MOD> &a)\n{\n  return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2LL; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1LL; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\ntemplate <typename T>\nT gcd(T x, T y) { return y ? gcd(y, x % y) : x; }\ntemplate <typename T>\nT lcm(T x, T y) { return x \/ gcd(x, y) * y; }\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n  int ans{0};\n  while (x != 0)\n  {\n    ans += x & 1;\n    x >>= 1;\n  }\n  return ans;\n}\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1000000000000000LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"-1\" << endl;\n  exit(0);\n}\n\/\/ ----- main() -----\n\nstruct Point\n{\n  ll x, y;\n};\n\nostream &operator<<(ostream &os, Point const &p)\n{\n  return os << p.x << \" \" << p.y;\n}\n\nPoint &operator+=(Point &p, Point const &q)\n{\n  p.x += q.x;\n  p.y += q.y;\n  return p;\n}\n\nPoint operator-(Point const &p, Point const &q)\n{\n  return {p.x - q.x, p.y - q.y};\n}\n\nbool operator==(Point const &p, Point const &q)\n{\n  return (p.x == q.x && p.y == q.y);\n}\n\nbool operator!=(Point const &p, Point const &q)\n{\n  return !(p == q);\n}\n\nclass Solve\n{\n  ll K;\n  Point G;\n  vector<Point> V;\n\npublic:\n  Solve()\n  {\n    cin >> K >> G.x >> G.y;\n  }\n\n  void flush()\n  {\n    if ((G.x + G.y) % 2 == 1 && K % 2 == 0)\n    {\n      No();\n    }\n    golf();\n    cout << V.size() << endl;\n    for (auto const &p : V)\n    {\n      cout << p << endl;\n    }\n  }\n\nprivate:\n  void golf()\n  {\n    Point now({0, 0});\n    while (now != G)\n    {\n      auto delta{shot(G - now)};\n      now += delta;\n      V.push_back(now);\n    }\n  }\n\n  Point shot(Point q)\n  {\n    auto const &x{q.x};\n    auto const &y{q.y};\n    auto sum{x + y};\n    if (sum == K)\n    {\n      return q;\n    }\n    if (x < 0)\n    {\n      q.x *= -1;\n      Point p{shot(q)};\n      p.x *= -1;\n      return p;\n    }\n    if (y < 0)\n    {\n      q.y *= -1;\n      Point p{shot(q)};\n      p.y *= -1;\n      return p;\n    }\n    if (x < y)\n    {\n      swap(q.x, q.y);\n      Point p{shot(q)};\n      swap(p.x, p.y);\n      return p;\n    }\n    if (sum > 2 * K || sum % 2 == 1)\n    {\n      auto t{min(x, K)};\n      return {t, K - t};\n    }\n    auto Z{K - sum \/ 2};\n    return {x - (K - Z), y + Z};\n  }\n};\n\nint main()\n{\n  Solve solve;\n  solve.flush();\n}\n<commit_msg>tried E.cpp to 'E'<commit_after>#define DEBUG 1\n\/**\n * File    : E.cpp\n * Author  : Kazune Takahashi\n * Created : 5\/20\/2020, 11:04:10 PM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n  }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n  }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(const Mint &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(const Mint &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(const Mint &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(const Mint &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n  Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n  Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n  Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n  bool operator<(const Mint &a) const { return x < a.x; }\n  bool operator<=(const Mint &a) const { return x <= a.x; }\n  bool operator>(const Mint &a) const { return x > a.x; }\n  bool operator>=(const Mint &a) const { return x >= a.x; }\n  bool operator==(const Mint &a) const { return x == a.x; }\n  bool operator!=(const Mint &a) const { return !(*this == a); }\n  const Mint power(ll N)\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, const Mint<MOD> &rhs)\n{\n  return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, const Mint<MOD> &rhs)\n{\n  return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, const Mint<MOD> &rhs)\n{\n  return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n  return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, const Mint<MOD> &a)\n{\n  return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i = 2LL; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i = 1LL; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\ntemplate <typename T>\nT gcd(T x, T y) { return y ? gcd(y, x % y) : x; }\ntemplate <typename T>\nT lcm(T x, T y) { return x \/ gcd(x, y) * y; }\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n  int ans{0};\n  while (x != 0)\n  {\n    ans += x & 1;\n    x >>= 1;\n  }\n  return ans;\n}\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1000000000000000LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"-1\" << endl;\n  exit(0);\n}\n\/\/ ----- main() -----\n\nstruct Point\n{\n  ll x, y;\n};\n\nostream &operator<<(ostream &os, Point const &p)\n{\n  return os << p.x << \" \" << p.y;\n}\n\nPoint &operator+=(Point &p, Point const &q)\n{\n  p.x += q.x;\n  p.y += q.y;\n  return p;\n}\n\nPoint operator-(Point const &p, Point const &q)\n{\n  return {p.x - q.x, p.y - q.y};\n}\n\nbool operator==(Point const &p, Point const &q)\n{\n  return (p.x == q.x && p.y == q.y);\n}\n\nbool operator!=(Point const &p, Point const &q)\n{\n  return !(p == q);\n}\n\nclass Solve\n{\n  ll K;\n  Point G;\n  vector<Point> V;\n\npublic:\n  Solve()\n  {\n    cin >> K >> G.x >> G.y;\n  }\n\n  void flush()\n  {\n    if ((abs(G.x) + abs(G.y)) % 2 == 1 && K % 2 == 0)\n    {\n      No();\n    }\n    golf();\n    cout << V.size() << endl;\n    for (auto const &p : V)\n    {\n      cout << p << endl;\n    }\n  }\n\nprivate:\n  void golf()\n  {\n    Point now({0, 0});\n    while (now != G)\n    {\n      auto delta{shot(G - now)};\n      now += delta;\n      V.push_back(now);\n    }\n  }\n\n  Point shot(Point q)\n  {\n    auto const &x{q.x};\n    auto const &y{q.y};\n    auto sum{x + y};\n    if (sum == K)\n    {\n      return q;\n    }\n    if (x < 0)\n    {\n      q.x *= -1;\n      Point p{shot(q)};\n      p.x *= -1;\n      return p;\n    }\n    if (y < 0)\n    {\n      q.y *= -1;\n      Point p{shot(q)};\n      p.y *= -1;\n      return p;\n    }\n    if (x < y)\n    {\n      swap(q.x, q.y);\n      Point p{shot(q)};\n      swap(p.x, p.y);\n      return p;\n    }\n    if (sum > 2 * K || sum % 2 == 1)\n    {\n      auto t{min(x, K)};\n      return {t, K - t};\n    }\n    auto Z{K - sum \/ 2};\n    return {x - (K - Z), y + Z};\n  }\n};\n\nint main()\n{\n  Solve solve;\n  solve.flush();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"kvazaarfilter.h\"\n\n#include \"statisticsinterface.h\"\n\n#include <kvazaar.h>\n#include <common.h>\n\n#include <QtDebug>\n#include <QTime>\n#include <QSize>\n\nenum RETURN_STATUS {C_SUCCESS = 0, C_FAILURE = -1};\n\nKvazaarFilter::KvazaarFilter(QString id, StatisticsInterface *stats):\n  Filter(id, \"Kvazaar\", stats, YUV420VIDEO, HEVCVIDEO),\n  api_(nullptr),\n  config_(nullptr),\n  enc_(nullptr),\n  pts_(0),\n  input_pic_(nullptr),\n  framerate_num_(30),\n  framerate_denom_(1),\n  encodingFrames_()\n{\n  maxBufferSize_ = 3;\n}\n\nvoid KvazaarFilter::updateSettings()\n{\n  qDebug() << \"Updating kvazaar settings\";\n  close();\n  if(init())\n  {\n    qDebug() << getName() << \"Kvazaar resolution change successful\";\n  }\n  else\n  {\n    qDebug() << \"Failed to change resolution\";\n  }\n\n  Filter::updateSettings();\n}\n\nbool KvazaarFilter::init()\n{\n  qDebug() << getName() << \"iniating\";\n\n  \/\/ input picture should not exist at this point\n  Q_ASSERT(!input_pic_ && !api_);\n\n  api_ = kvz_api_get(8);\n  if(!api_)\n  {\n    printDebug(DEBUG_ERROR, this, \"Initiate Video\", \"Failed to retrieve Kvazaar API.\");\n    return false;\n  }\n  config_ = api_->config_alloc();\n  enc_ = nullptr;\n\n  if(!config_)\n  {\n    printDebug(DEBUG_ERROR, this, \"Initiate Video\", \"Failed to allocate Kvazaar config.\");\n    return false;\n  }\n  QSettings settings(\"kvazzup.ini\", QSettings::IniFormat);\n\n  api_->config_init(config_);\n\n  api_->config_parse(config_, \"preset\", settings.value(\"video\/Preset\").toString().toUtf8());\n  config_->width = settings.value(\"video\/ResolutionWidth\").toInt();\n  config_->height = settings.value(\"video\/ResolutionHeight\").toInt();\n  config_->threads = settings.value(\"video\/kvzThreads\").toInt();\n  config_->qp = settings.value(\"video\/QP\").toInt();\n  config_->wpp = settings.value(\"video\/WPP\").toInt();\n  config_->vps_period = settings.value(\"video\/VPS\").toInt();\n  config_->intra_period = settings.value(\"video\/Intra\").toInt();\n  config_->framerate_num = settings.value(\"video\/Framerate\").toInt();\n  config_->framerate_denom = framerate_denom_;\n  config_->hash = KVZ_HASH_NONE;\n\n  \/\/config_->fme_level = 0;\n\n  if(settings.value(\"video\/Slices\").toInt() == 1)\n  {\n    if(config_->wpp == 0)\n    {\n      api_->config_parse(config_, \"tiles\", \"2x2\");\n      config_->slices = KVZ_SLICES_TILES;\n    }\n    else\n    {\n      config_->slices = KVZ_SLICES_WPP;\n    }\n  }\n\n  \/\/ TODO Maybe send parameter sets only when needed\n  \/\/config_->target_bitrate = target_bitrate;\n\n  customParameters(settings);\n\n  enc_ = api_->encoder_open(config_);\n\n  if(!enc_)\n  {\n    printDebug(DEBUG_ERROR, this, \"Video Process\", \"Failed to open Kvazaar encoder.\");\n    return false;\n  }\n\n  input_pic_ = api_->picture_alloc(config_->width, config_->height);\n\n  if(!input_pic_)\n  {\n    printDebug(DEBUG_ERROR, this, \"Initiate Video\", \"Could not allocate input picture.\");\n    return false;\n  }\n\n  qDebug() << getName() << \"iniation succeeded.\";\n  return true;\n}\n\nvoid KvazaarFilter::close()\n{\n  if(api_)\n  {\n    api_->encoder_close(enc_);\n    api_->config_destroy(config_);\n    enc_ = nullptr;\n    config_ = nullptr;\n\n    api_->picture_free(input_pic_);\n    input_pic_ = nullptr;\n    api_ = nullptr;\n  }\n  qDebug() << getName() << \"Kvazaar closed\";\n\n  pts_ = 0;\n}\n\nvoid KvazaarFilter::process()\n{\n  Q_ASSERT(enc_);\n  Q_ASSERT(config_);\n\n  std::unique_ptr<Data> input = getInput();\n\n  while(input)\n  {\n    if(!input_pic_)\n    {\n      printDebug(DEBUG_ERROR, this, \"Video Process\", \"Input picture was not allocated correctly.\");\n      break;\n    }\n\n    feedInput(std::move(input));\n    \/\/ TODO: decrease latency by polling at least once more.\n\/*\n    while(data_out == nullptr && encodingPresentationTimes_.size() != 0)\n    {\n      qSleep(3);\n      api_->encoder_encode(enc_, nullptr,\n                           &data_out, &len_out,\n                           &recon_pic, nullptr,\n                           &frame_info );\n    }\n*\/\n\n    input = getInput();\n  }\n}\n\nvoid KvazaarFilter::customParameters(QSettings& settings)\n{\n\n\n  int size = settings.beginReadArray(\"parameters\");\n\n  qDebug() << \"Initialization,\" << metaObject()->className()\n           << \"Getting custom Kvazaar options:\" << size;\n\n  for(int i = 0; i < size; ++i)\n  {\n    settings.setArrayIndex(i);\n    QString name = settings.value(\"Name\").toString();\n    QString value = settings.value(\"Value\").toString();\n    if (api_->config_parse(config_, name.toStdString().c_str(),\n                           value.toStdString().c_str()) != 1)\n    {\n      qDebug() << \"Initialization,\" << metaObject()->className()\n               << \": Invalid custom parameter for kvazaar\";\n    }\n  }\n  settings.endArray();\n}\n\nvoid KvazaarFilter::feedInput(std::unique_ptr<Data> input)\n{\n  kvz_picture *recon_pic = nullptr;\n  kvz_frame_info frame_info;\n  kvz_data_chunk *data_out = nullptr;\n  uint32_t len_out = 0;\n\n  if(config_->width != input->width\n     || config_->height != input->height\n     || config_->framerate_num != input->framerate)\n  {\n    \/\/ This should not happen.\n    qDebug() << getName() << \"WARNING: Input resolution or framerate differs:\"\n             << config_->width << \"x\" << config_->height << \"input:\"\n             << input->width << \"x\" << input->height;\n\n    qDebug() << getName() << \"Framerate:\" << config_->framerate_num << \"input:\" << input->framerate;\n\n    QSettings settings(\"kvazzup.ini\", QSettings::IniFormat);\n    settings.setValue(\"video\/ResolutionWidth\", input->width);\n    settings.setValue(\"video\/ResolutionHeight\", input->height);\n    settings.setValue(\"video\/Framerate\", input->framerate);\n    updateSettings();\n  }\n\n\n  \/\/ copy input to kvazaar picture\n  memcpy(input_pic_->y,\n         input->data.get(),\n         input->width*input->height);\n  memcpy(input_pic_->u,\n         &(input->data.get()[input->width*input->height]),\n         input->width*input->height\/4);\n  memcpy(input_pic_->v,\n         &(input->data.get()[input->width*input->height + input->width*input->height\/4]),\n         input->width*input->height\/4);\n\n  input_pic_->pts = pts_;\n  ++pts_;\n\n  encodingFrames_.push_front(std::move(input));\n\n  api_->encoder_encode(enc_, input_pic_,\n                       &data_out, &len_out,\n                       &recon_pic, nullptr,\n                       &frame_info );\n\n  if(data_out != nullptr)\n  {\n    parseEncodedFrame(data_out, len_out, recon_pic);\n  }\n}\n\nvoid KvazaarFilter::parseEncodedFrame(kvz_data_chunk *data_out,\n                                      uint32_t len_out, kvz_picture *recon_pic)\n{\n  std::unique_ptr<Data> encodedFrame = std::move(encodingFrames_.back());\n  encodingFrames_.pop_back();\n\n  uint32_t delay = QDateTime::currentMSecsSinceEpoch() -\n      (encodedFrame->presentationTime.tv_sec * 1000 + encodedFrame->presentationTime.tv_usec\/1000);\n  getStats()->sendDelay(\"video\", delay);\n  getStats()->addEncodedPacket(\"video\", len_out);\n\n  std::unique_ptr<uchar[]> hevc_frame(new uchar[len_out]);\n  uint8_t* writer = hevc_frame.get();\n  uint32_t dataWritten = 0;\n\n  for (kvz_data_chunk *chunk = data_out; chunk != nullptr; chunk = chunk->next)\n  {\n    if(chunk->len > 3 && chunk->data[0] == 0 && chunk->data[1] == 0\n       &&( chunk->data[2] == 1 || (chunk->data[2] == 0 && chunk->data[3] == 1 ))\n       && dataWritten != 0 && config_->slices != KVZ_SLICES_NONE)\n    {\n      \/\/ send previous packet if this is not the first\n\n      \/\/ TODO: put delayes into deque, and set timestamp accordingly to get more accurate latency.\n      std::unique_ptr<Data> slice(shallowDataCopy(encodedFrame.get()));\n\n      sendEncodedFrame(std::move(slice), std::move(hevc_frame), dataWritten);\n\n      hevc_frame = std::unique_ptr<uchar[]>(new uchar[len_out - dataWritten]);\n      writer = hevc_frame.get();\n      dataWritten = 0;\n    }\n\n    memcpy(writer, chunk->data, chunk->len);\n    writer += chunk->len;\n    dataWritten += chunk->len;\n  }\n  api_->chunk_free(data_out);\n  api_->picture_free(recon_pic);\n\n  \/\/ send last packet reusing input structure\n  sendEncodedFrame(std::move(encodedFrame), std::move(hevc_frame), dataWritten);\n}\n\nvoid KvazaarFilter::sendEncodedFrame(std::unique_ptr<Data> input,\n                                     std::unique_ptr<uchar[]> hevc_frame, uint32_t dataWritten)\n{\n  input->type = HEVCVIDEO;\n  input->data_size = dataWritten;\n  input->data = std::move(hevc_frame);\n  sendOutput(std::move(input));\n}\n<commit_msg>fix(Processing): Fix Kvazaar initialization on Linux<commit_after>#include \"kvazaarfilter.h\"\n\n#include \"statisticsinterface.h\"\n\n#include <kvazaar.h>\n#include <common.h>\n\n#include <QtDebug>\n#include <QTime>\n#include <QSize>\n\nenum RETURN_STATUS {C_SUCCESS = 0, C_FAILURE = -1};\n\nKvazaarFilter::KvazaarFilter(QString id, StatisticsInterface *stats):\n  Filter(id, \"Kvazaar\", stats, YUV420VIDEO, HEVCVIDEO),\n  api_(nullptr),\n  config_(nullptr),\n  enc_(nullptr),\n  pts_(0),\n  input_pic_(nullptr),\n  framerate_num_(30),\n  framerate_denom_(1),\n  encodingFrames_()\n{\n  maxBufferSize_ = 3;\n}\n\nvoid KvazaarFilter::updateSettings()\n{\n  qDebug() << \"Updating kvazaar settings\";\n  close();\n  if(init())\n  {\n    qDebug() << getName() << \"Kvazaar resolution change successful\";\n  }\n  else\n  {\n    qDebug() << \"Failed to change resolution\";\n  }\n\n  Filter::updateSettings();\n}\n\nbool KvazaarFilter::init()\n{\n  qDebug() << getName() << \"iniating\";\n\n  \/\/ input picture should not exist at this point\n  Q_ASSERT(!input_pic_ && !api_);\n\n  api_ = kvz_api_get(8);\n  if(!api_)\n  {\n    printDebug(DEBUG_ERROR, this, \"Initiate Video\", \"Failed to retrieve Kvazaar API.\");\n    return false;\n  }\n  config_ = api_->config_alloc();\n  enc_ = nullptr;\n\n  if(!config_)\n  {\n    printDebug(DEBUG_ERROR, this, \"Initiate Video\", \"Failed to allocate Kvazaar config.\");\n    return false;\n  }\n  QSettings settings(\"kvazzup.ini\", QSettings::IniFormat);\n\n  api_->config_init(config_);\n\n#ifdef __linux__\n  api_->config_parse(config_, \"preset\", \"ultrafast\");\n\tconfig_->width = 640;\n\tconfig_->height = 480;\n\tconfig_->framerate_num = 30;\n#else\n  api_->config_parse(config_, \"preset\", settings.value(\"video\/Preset\").toString().toUtf8());\n  config_->width = settings.value(\"video\/ResolutionWidth\").toInt();\n  config_->height = settings.value(\"video\/ResolutionHeight\").toInt();\n  config_->threads = settings.value(\"video\/kvzThreads\").toInt();\n  config_->qp = settings.value(\"video\/QP\").toInt();\n  config_->wpp = settings.value(\"video\/WPP\").toInt();\n  config_->vps_period = settings.value(\"video\/VPS\").toInt();\n  config_->intra_period = settings.value(\"video\/Intra\").toInt();\n  config_->framerate_num = settings.value(\"video\/Framerate\").toInt();\n  config_->framerate_denom = framerate_denom_;\n  config_->hash = KVZ_HASH_NONE;\n#endif\n\n  \/\/config_->fme_level = 0;\n\n  if(settings.value(\"video\/Slices\").toInt() == 1)\n  {\n    if(config_->wpp == 0)\n    {\n      api_->config_parse(config_, \"tiles\", \"2x2\");\n      config_->slices = KVZ_SLICES_TILES;\n    }\n    else\n    {\n      config_->slices = KVZ_SLICES_WPP;\n    }\n  }\n\n  \/\/ TODO Maybe send parameter sets only when needed\n  \/\/config_->target_bitrate = target_bitrate;\n\n  customParameters(settings);\n\n  enc_ = api_->encoder_open(config_);\n\n  if(!enc_)\n  {\n    printDebug(DEBUG_ERROR, this, \"Video Process\", \"Failed to open Kvazaar encoder.\");\n    return false;\n  }\n\n  input_pic_ = api_->picture_alloc(config_->width, config_->height);\n\n  if(!input_pic_)\n  {\n    printDebug(DEBUG_ERROR, this, \"Initiate Video\", \"Could not allocate input picture.\");\n    return false;\n  }\n\n  qDebug() << getName() << \"iniation succeeded.\";\n  return true;\n}\n\nvoid KvazaarFilter::close()\n{\n  if(api_)\n  {\n    api_->encoder_close(enc_);\n    api_->config_destroy(config_);\n    enc_ = nullptr;\n    config_ = nullptr;\n\n    api_->picture_free(input_pic_);\n    input_pic_ = nullptr;\n    api_ = nullptr;\n  }\n  qDebug() << getName() << \"Kvazaar closed\";\n\n  pts_ = 0;\n}\n\nvoid KvazaarFilter::process()\n{\n  Q_ASSERT(enc_);\n  Q_ASSERT(config_);\n\n  std::unique_ptr<Data> input = getInput();\n\n  while(input)\n  {\n    if(!input_pic_)\n    {\n      printDebug(DEBUG_ERROR, this, \"Video Process\", \"Input picture was not allocated correctly.\");\n      break;\n    }\n\n    feedInput(std::move(input));\n    \/\/ TODO: decrease latency by polling at least once more.\n\/*\n    while(data_out == nullptr && encodingPresentationTimes_.size() != 0)\n    {\n      qSleep(3);\n      api_->encoder_encode(enc_, nullptr,\n                           &data_out, &len_out,\n                           &recon_pic, nullptr,\n                           &frame_info );\n    }\n*\/\n\n    input = getInput();\n  }\n}\n\nvoid KvazaarFilter::customParameters(QSettings& settings)\n{\n\n\n  int size = settings.beginReadArray(\"parameters\");\n\n  qDebug() << \"Initialization,\" << metaObject()->className()\n           << \"Getting custom Kvazaar options:\" << size;\n\n  for(int i = 0; i < size; ++i)\n  {\n    settings.setArrayIndex(i);\n    QString name = settings.value(\"Name\").toString();\n    QString value = settings.value(\"Value\").toString();\n    if (api_->config_parse(config_, name.toStdString().c_str(),\n                           value.toStdString().c_str()) != 1)\n    {\n      qDebug() << \"Initialization,\" << metaObject()->className()\n               << \": Invalid custom parameter for kvazaar\";\n    }\n  }\n  settings.endArray();\n}\n\nvoid KvazaarFilter::feedInput(std::unique_ptr<Data> input)\n{\n  kvz_picture *recon_pic = nullptr;\n  kvz_frame_info frame_info;\n  kvz_data_chunk *data_out = nullptr;\n  uint32_t len_out = 0;\n\n  if(config_->width != input->width\n     || config_->height != input->height\n     || config_->framerate_num != input->framerate)\n  {\n    \/\/ This should not happen.\n    qDebug() << getName() << \"WARNING: Input resolution or framerate differs:\"\n             << config_->width << \"x\" << config_->height << \"input:\"\n             << input->width << \"x\" << input->height;\n\n    qDebug() << getName() << \"Framerate:\" << config_->framerate_num << \"input:\" << input->framerate;\n\n    QSettings settings(\"kvazzup.ini\", QSettings::IniFormat);\n    settings.setValue(\"video\/ResolutionWidth\", input->width);\n    settings.setValue(\"video\/ResolutionHeight\", input->height);\n    settings.setValue(\"video\/Framerate\", input->framerate);\n    updateSettings();\n  }\n\n\n  \/\/ copy input to kvazaar picture\n  memcpy(input_pic_->y,\n         input->data.get(),\n         input->width*input->height);\n  memcpy(input_pic_->u,\n         &(input->data.get()[input->width*input->height]),\n         input->width*input->height\/4);\n  memcpy(input_pic_->v,\n         &(input->data.get()[input->width*input->height + input->width*input->height\/4]),\n         input->width*input->height\/4);\n\n  input_pic_->pts = pts_;\n  ++pts_;\n\n  encodingFrames_.push_front(std::move(input));\n\n  api_->encoder_encode(enc_, input_pic_,\n                       &data_out, &len_out,\n                       &recon_pic, nullptr,\n                       &frame_info );\n\n  if(data_out != nullptr)\n  {\n    parseEncodedFrame(data_out, len_out, recon_pic);\n  }\n}\n\nvoid KvazaarFilter::parseEncodedFrame(kvz_data_chunk *data_out,\n                                      uint32_t len_out, kvz_picture *recon_pic)\n{\n  std::unique_ptr<Data> encodedFrame = std::move(encodingFrames_.back());\n  encodingFrames_.pop_back();\n\n  uint32_t delay = QDateTime::currentMSecsSinceEpoch() -\n      (encodedFrame->presentationTime.tv_sec * 1000 + encodedFrame->presentationTime.tv_usec\/1000);\n  getStats()->sendDelay(\"video\", delay);\n  getStats()->addEncodedPacket(\"video\", len_out);\n\n  std::unique_ptr<uchar[]> hevc_frame(new uchar[len_out]);\n  uint8_t* writer = hevc_frame.get();\n  uint32_t dataWritten = 0;\n\n  for (kvz_data_chunk *chunk = data_out; chunk != nullptr; chunk = chunk->next)\n  {\n    if(chunk->len > 3 && chunk->data[0] == 0 && chunk->data[1] == 0\n       &&( chunk->data[2] == 1 || (chunk->data[2] == 0 && chunk->data[3] == 1 ))\n       && dataWritten != 0 && config_->slices != KVZ_SLICES_NONE)\n    {\n      \/\/ send previous packet if this is not the first\n\n      \/\/ TODO: put delayes into deque, and set timestamp accordingly to get more accurate latency.\n      std::unique_ptr<Data> slice(shallowDataCopy(encodedFrame.get()));\n\n      sendEncodedFrame(std::move(slice), std::move(hevc_frame), dataWritten);\n\n      hevc_frame = std::unique_ptr<uchar[]>(new uchar[len_out - dataWritten]);\n      writer = hevc_frame.get();\n      dataWritten = 0;\n    }\n\n    memcpy(writer, chunk->data, chunk->len);\n    writer += chunk->len;\n    dataWritten += chunk->len;\n  }\n  api_->chunk_free(data_out);\n  api_->picture_free(recon_pic);\n\n  \/\/ send last packet reusing input structure\n  sendEncodedFrame(std::move(encodedFrame), std::move(hevc_frame), dataWritten);\n}\n\nvoid KvazaarFilter::sendEncodedFrame(std::unique_ptr<Data> input,\n                                     std::unique_ptr<uchar[]> hevc_frame, uint32_t dataWritten)\n{\n  input->type = HEVCVIDEO;\n  input->data_size = dataWritten;\n  input->data = std::move(hevc_frame);\n  sendOutput(std::move(input));\n}\n<|endoftext|>"}
{"text":"<commit_before>#define DEBUG 1\n\/**\n * File    : E.cpp\n * Author  : Kazune Takahashi\n * Created : 6\/19\/2020, 12:05:05 AM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/integer\/common_factor_rt.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n#include <boost\/rational.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::integer::gcd; \/\/ for C++14 or for cpp_int\nusing boost::integer::lcm; \/\/ for C++14 or for cpp_int\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ld = long double;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1'000'000'007LL};\n\/\/ constexpr ll MOD{998'244'353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3'000'010LL};\n\/\/ constexpr ll MAX_SIZE{30'000'010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nbool ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n    return true;\n  }\n  return false;\n}\ntemplate <typename T>\nbool ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n    return true;\n  }\n  return false;\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(Mint const &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(Mint const &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(Mint const &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(Mint const &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(Mint const &a) const { return Mint(*this) += a; }\n  Mint operator-(Mint const &a) const { return Mint(*this) -= a; }\n  Mint operator*(Mint const &a) const { return Mint(*this) *= a; }\n  Mint operator\/(Mint const &a) const { return Mint(*this) \/= a; }\n  bool operator<(Mint const &a) const { return x < a.x; }\n  bool operator<=(Mint const &a) const { return x <= a.x; }\n  bool operator>(Mint const &a) const { return x > a.x; }\n  bool operator>=(Mint const &a) const { return x >= a.x; }\n  bool operator==(Mint const &a) const { return x == a.x; }\n  bool operator!=(Mint const &a) const { return !(*this == a); }\n  Mint power(ll N) const\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, Mint<MOD> const &rhs) { return rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, Mint<MOD> const &rhs) { return -rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, Mint<MOD> const &rhs) { return rhs * lhs; }\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, Mint<MOD> const &rhs) { return Mint<MOD>{lhs} \/ rhs; }\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a) { return stream >> a.x; }\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, Mint<MOD> const &a) { return stream << a.x; }\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i{2LL}; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i{1LL}; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\n\/\/ ----- for C++17 -----\ntemplate <typename T, typename enable_if<is_integral<T>::value>::type * = nullptr>\nsize_t popcount(T x) { return bitset<64>(x).count(); }\nsize_t popcount(string const &S) { return bitset<200010>{S}.count(); }\n\/\/ ----- Infty -----\ntemplate <typename T>\nconstexpr T Infty() { return numeric_limits<T>::max(); }\ntemplate <typename T>\nconstexpr T mInfty() { return numeric_limits<T>::min(); }\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1'000'000'000'000'010LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\n\/\/ ----- Solve -----\n\nclass Solve\n{\n  ll N, P;\n  string S;\n\npublic:\n  Solve(ll N, ll P, string S) : N{N}, P{P}, S{S}\n  {\n    reverse(S.begin(), S.end());\n  }\n\n  void flush()\n  {\n    vector<ll> V(P, 0);\n    V[0] = 1;\n    ll base{1};\n    ll ans{0};\n    ll now{0};\n    for (auto i{0}; i < N; ++i)\n    {\n      now += base * (S[i] - '0');\n      now %= P;\n      ans += V[now];\n      V[now]++;\n      base *= 10;\n      base %= P;\n    }\n    cout << ans << endl;\n  }\n\nprivate:\n};\n\n\/\/ ----- main() -----\n\nint main()\n{\n  ll N, P;\n  string S;\n  cin >> N >> P >> S;\n  if (P == 2 || P == 5)\n  {\n    ll ans{0};\n    for (auto i{0LL}; i < N; ++i)\n    {\n      if ((S[i] - '0') % P == 0)\n      {\n        ans += i + 1;\n      }\n    }\n    cout << ans << endl;\n  }\n  else\n  {\n    Solve solve(N, P, S);\n    solve.flush();\n  }\n}\n<commit_msg>submit E.cpp to 'E - Divisible Substring' (abc158) [C++ (GCC 9.2.1)]<commit_after>#define DEBUG 1\n\/**\n * File    : E.cpp\n * Author  : Kazune Takahashi\n * Created : 6\/19\/2020, 12:05:05 AM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/integer\/common_factor_rt.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n#include <boost\/rational.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::integer::gcd; \/\/ for C++14 or for cpp_int\nusing boost::integer::lcm; \/\/ for C++14 or for cpp_int\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ld = long double;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1'000'000'007LL};\n\/\/ constexpr ll MOD{998'244'353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3'000'010LL};\n\/\/ constexpr ll MAX_SIZE{30'000'010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nbool ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n    return true;\n  }\n  return false;\n}\ntemplate <typename T>\nbool ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n    return true;\n  }\n  return false;\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(Mint const &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(Mint const &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(Mint const &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(Mint const &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(Mint const &a) const { return Mint(*this) += a; }\n  Mint operator-(Mint const &a) const { return Mint(*this) -= a; }\n  Mint operator*(Mint const &a) const { return Mint(*this) *= a; }\n  Mint operator\/(Mint const &a) const { return Mint(*this) \/= a; }\n  bool operator<(Mint const &a) const { return x < a.x; }\n  bool operator<=(Mint const &a) const { return x <= a.x; }\n  bool operator>(Mint const &a) const { return x > a.x; }\n  bool operator>=(Mint const &a) const { return x >= a.x; }\n  bool operator==(Mint const &a) const { return x == a.x; }\n  bool operator!=(Mint const &a) const { return !(*this == a); }\n  Mint power(ll N) const\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, Mint<MOD> const &rhs) { return rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, Mint<MOD> const &rhs) { return -rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, Mint<MOD> const &rhs) { return rhs * lhs; }\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, Mint<MOD> const &rhs) { return Mint<MOD>{lhs} \/ rhs; }\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a) { return stream >> a.x; }\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, Mint<MOD> const &a) { return stream << a.x; }\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i{2LL}; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i{1LL}; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\n\/\/ ----- for C++17 -----\ntemplate <typename T, typename enable_if<is_integral<T>::value>::type * = nullptr>\nsize_t popcount(T x) { return bitset<64>(x).count(); }\nsize_t popcount(string const &S) { return bitset<200010>{S}.count(); }\n\/\/ ----- Infty -----\ntemplate <typename T>\nconstexpr T Infty() { return numeric_limits<T>::max(); }\ntemplate <typename T>\nconstexpr T mInfty() { return numeric_limits<T>::min(); }\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1'000'000'000'000'010LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"No\" << endl;\n  exit(0);\n}\n\n\/\/ ----- Solve -----\n\nclass Solve\n{\n  ll N, P;\n  string S;\n\npublic:\n  Solve(ll N, ll P, string S) : N{N}, P{P}, S{S}\n  {\n    reverse(S.begin(), S.end());\n  }\n\n  void flush()\n  {\n    vector<ll> V(P, 0);\n    V[0] = 1;\n    ll base{1};\n    ll ans{0};\n    ll now{0};\n    for (auto i{0}; i < N; ++i)\n    {\n      now += base * (S[i] - '0');\n      now %= P;\n      ans += V[now];\n      V[now]++;\n      base *= 10;\n      base %= P;\n    }\n    cout << ans << endl;\n  }\n\nprivate:\n};\n\n\/\/ ----- main() -----\n\nint main()\n{\n  ll N, P;\n  string S;\n  cin >> N >> P >> S;\n  if (P == 2 || P == 5)\n  {\n    ll ans{0};\n    for (auto i{0LL}; i < N; ++i)\n    {\n      if ((S[i] - '0') % P == 0)\n      {\n        ans += i + 1;\n      }\n    }\n    cout << ans << endl;\n  }\n  else\n  {\n    assert(false);\n    Solve solve(N, P, S);\n    solve.flush();\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#define DEBUG 1\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 2020\/7\/1 1:44:15\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/integer\/common_factor_rt.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n#include <boost\/rational.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::integer::gcd; \/\/ for C++14 or for cpp_int\nusing boost::integer::lcm; \/\/ for C++14 or for cpp_int\nusing boost::multiprecision::cpp_int;\nusing ll = unsigned long long;\nusing ld = long double;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1'000'000'007LL};\n\/\/ constexpr ll MOD{998'244'353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3'000'010LL};\n\/\/ constexpr ll MAX_SIZE{30'000'010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nbool ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n    return true;\n  }\n  return false;\n}\ntemplate <typename T>\nbool ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n    return true;\n  }\n  return false;\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(Mint const &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(Mint const &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(Mint const &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(Mint const &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(Mint const &a) const { return Mint(*this) += a; }\n  Mint operator-(Mint const &a) const { return Mint(*this) -= a; }\n  Mint operator*(Mint const &a) const { return Mint(*this) *= a; }\n  Mint operator\/(Mint const &a) const { return Mint(*this) \/= a; }\n  bool operator<(Mint const &a) const { return x < a.x; }\n  bool operator<=(Mint const &a) const { return x <= a.x; }\n  bool operator>(Mint const &a) const { return x > a.x; }\n  bool operator>=(Mint const &a) const { return x >= a.x; }\n  bool operator==(Mint const &a) const { return x == a.x; }\n  bool operator!=(Mint const &a) const { return !(*this == a); }\n  Mint power(ll N) const\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, Mint<MOD> const &rhs) { return rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, Mint<MOD> const &rhs) { return -rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, Mint<MOD> const &rhs) { return rhs * lhs; }\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, Mint<MOD> const &rhs) { return Mint<MOD>{lhs} \/ rhs; }\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a) { return stream >> a.x; }\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, Mint<MOD> const &a) { return stream << a.x; }\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i{2LL}; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i{1LL}; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\n\/\/ ----- for C++17 -----\ntemplate <typename T, typename enable_if<is_integral<T>::value>::type * = nullptr>\nsize_t popcount(T x) { return bitset<64>(x).count(); }\nsize_t popcount(string const &S) { return bitset<200010>{S}.count(); }\n\/\/ ----- Infty -----\ntemplate <typename T>\nconstexpr T Infty() { return numeric_limits<T>::max(); }\ntemplate <typename T>\nconstexpr T mInfty() { return numeric_limits<T>::min(); }\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1'000'000'000'000'010LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"-1\" << endl;\n  exit(0);\n}\n\n\/\/ ----- Solve -----\n\nclass Solve\n{\n  int n;\n  vector<bool> s, t, u, v;\n  vector<vector<int>> res;\n  vector<int> zero_row, zero_col, one_row, one_col;\n\npublic:\n  Solve(int n, vector<bool> s, vector<bool> t, vector<bool> u, vector<bool> v) : n{n}, s{s}, t{t}, u{u}, v{v}, res(n, vector<int>(n, -1))\n  {\n  }\n\n  vector<vector<int>> answer()\n  {\n    prepare();\n    make_vectors();\n    if (!one_row.empty() && !one_col.empty())\n    {\n      puts_ones();\n    }\n    else\n    {\n      careful();\n    }\n    final_check();\n    return res;\n  }\n\nprivate:\n  void ch(int i, int j, int v)\n  {\n    if (res[i][j] == -1)\n    {\n      res[i][j] = v;\n    }\n    else if (res[i][j] != v)\n    {\n      No();\n    }\n  }\n\n  void final_check()\n  {\n    for (auto i{0}; i < n; ++i)\n    {\n      for (auto j{0}; j < n; ++j)\n      {\n        if (res[i][j] == -1)\n        {\n          res[i][j] = 0;\n        }\n      }\n    }\n    {\n      for (auto i : zero_row)\n      {\n        bool ok{false};\n        for (auto j{0}; j < n; ++j)\n        {\n          if (res[i][j] == 0)\n          {\n            ok = true;\n            break;\n          }\n        }\n        if (!ok)\n        {\n          No();\n        }\n      }\n    }\n    {\n      for (auto j : zero_col)\n      {\n        bool ok{false};\n        for (auto i{0}; i < n; ++i)\n        {\n          if (res[i][j] == 0)\n          {\n            ok = true;\n            break;\n          }\n        }\n        if (!ok)\n        {\n          No();\n        }\n      }\n    }\n  }\n\n  void careful()\n  {\n    {\n      int cnt{0};\n      for (auto i : one_row)\n      {\n        bool ok{false};\n        for (auto j{0}; j < n; ++j)\n        {\n          if (res[i][j] == 1)\n          {\n            ok = true;\n          }\n        }\n        if (ok)\n        {\n          continue;\n        }\n        if (static_cast<int>(zero_col.size()) == 0)\n        {\n          No();\n        }\n        auto j{cnt % zero_col.size()};\n        ch(i, zero_col[j], 1);\n      }\n    }\n    {\n      int cnt{0};\n      for (auto j : one_col)\n      {\n        bool ok{false};\n        for (auto i{0}; i < n; ++i)\n        {\n          if (res[i][j] == 1)\n          {\n            ok = true;\n          }\n        }\n        if (ok)\n        {\n          continue;\n        }\n        if (static_cast<int>(zero_row.size()) == 0)\n        {\n          No();\n        }\n        auto i{cnt % zero_row.size()};\n        ch(zero_row[i], j, 1);\n      }\n    }\n  }\n\n  void puts_ones()\n  {\n    for (auto i : one_row)\n    {\n      for (auto j : one_col)\n      {\n        ch(i, j, 1);\n      }\n    }\n  }\n\n  void make_vectors()\n  {\n    for (auto i{0}; i < n; ++i)\n    {\n      if (!s[i] && !u[i])\n      {\n        zero_row.push_back(i);\n      }\n    }\n    for (auto i{0}; i < n; ++i)\n    {\n      if (s[i] && u[i])\n      {\n        one_row.push_back(i);\n      }\n    }\n    for (auto i{0}; i < n; ++i)\n    {\n      if (!t[i] && !v[i])\n      {\n        zero_col.push_back(i);\n      }\n    }\n    for (auto i{0}; i < n; ++i)\n    {\n      if (t[i] && v[i])\n      {\n        one_col.push_back(i);\n      }\n    }\n  }\n\n  void prepare()\n  {\n    for (auto i{0}; i < n; ++i)\n    {\n      if (!s[i] && u[i])\n      {\n        for (auto j{0}; j < n; ++j)\n        {\n          ch(i, j, 1);\n        }\n      }\n      else if (s[i] && !u[i])\n      {\n        for (auto j{0}; j < n; ++j)\n        {\n          ch(i, j, 0);\n        }\n      }\n    }\n    for (auto i{0}; i < n; ++i)\n    {\n      if (!t[i] && v[i])\n      {\n        for (auto j{0}; j < n; ++j)\n        {\n          ch(j, i, 1);\n        }\n      }\n      else if (t[i] && !v[i])\n      {\n        for (auto j{0}; j < n; ++j)\n        {\n          ch(j, i, 0);\n        }\n      }\n    }\n  }\n};\n\n\/\/ ----- main() -----\n\nconstexpr int C{60};\n\nint main()\n{\n  int n;\n  cin >> n;\n  vector<bool> s(n), t(n);\n  vector<ll> us(n), vs(n);\n  for (auto i{0}; i < n; ++i)\n  {\n    int x;\n    cin >> x;\n    s[i] = (x == 1);\n  }\n  for (auto i{0}; i < n; ++i)\n  {\n    int x;\n    cin >> x;\n    t[i] = (x == 1);\n  }\n  for (auto i{0}; i < n; ++i)\n  {\n    cin >> us[i];\n  }\n  for (auto i{0}; i < n; ++i)\n  {\n    cin >> vs[i];\n  }\n  vector<vector<ll>> ans(C);\n  for (auto k{0}; k < C; ++k)\n  {\n    vector<bool> u(n), v(n);\n    for (auto i{0}; i < n; ++i)\n    {\n      u[i] = (us[i] >> k & 1);\n    }\n    for (auto i{0}; i < n; ++i)\n    {\n      v[i] = (vs[i] >> k & 1);\n    }\n    Solve solve(n, s, t, u, v);\n    auto res{solve.answer()};\n#if DEBUG == 1\n    for (auto i{0}; i < n; ++i)\n    {\n      for (auto j{0}; j < n; ++j)\n      {\n        cerr << res[i][j];\n        if (j < n - 1)\n        {\n          cerr << \" \";\n        }\n        else\n        {\n          cerr << endl;\n        }\n      }\n    }\n#endif\n    for (auto i{0}; i < n; ++i)\n    {\n      for (auto j{0}; j < n; ++j)\n      {\n        ans[i][j] |= static_cast<ll>(res[i][j]) << k;\n      }\n    }\n  }\n  for (auto i{0}; i < n; ++i)\n  {\n    for (auto j{0}; j < n; ++j)\n    {\n      cout << ans[i][j];\n      if (j < n - 1)\n      {\n        cout << \" \";\n      }\n      else\n      {\n        cout << endl;\n      }\n    }\n  }\n}\n<commit_msg>submit F.cpp to 'F - I hate Matrix Construction' (abc164) [C++ (GCC 9.2.1)]<commit_after>#define DEBUG 1\n\/**\n * File    : F.cpp\n * Author  : Kazune Takahashi\n * Created : 2020\/7\/1 1:44:15\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/integer\/common_factor_rt.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n#include <boost\/rational.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::integer::gcd; \/\/ for C++14 or for cpp_int\nusing boost::integer::lcm; \/\/ for C++14 or for cpp_int\nusing boost::multiprecision::cpp_int;\nusing ll = unsigned long long;\nusing ld = long double;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1'000'000'007LL};\n\/\/ constexpr ll MOD{998'244'353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3'000'010LL};\n\/\/ constexpr ll MAX_SIZE{30'000'010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nbool ch_max(T &left, T right)\n{\n  if (left < right)\n  {\n    left = right;\n    return true;\n  }\n  return false;\n}\ntemplate <typename T>\nbool ch_min(T &left, T right)\n{\n  if (left > right)\n  {\n    left = right;\n    return true;\n  }\n  return false;\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n  ll x;\n  Mint() : x{0LL} {}\n  Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n  Mint operator-() const { return x ? MOD - x : 0; }\n  Mint &operator+=(Mint const &a)\n  {\n    if ((x += a.x) >= MOD)\n    {\n      x -= MOD;\n    }\n    return *this;\n  }\n  Mint &operator-=(Mint const &a) { return *this += -a; }\n  Mint &operator++() { return *this += 1; }\n  Mint operator++(int)\n  {\n    Mint tmp{*this};\n    ++*this;\n    return tmp;\n  }\n  Mint &operator--() { return *this -= 1; }\n  Mint operator--(int)\n  {\n    Mint tmp{*this};\n    --*this;\n    return tmp;\n  }\n  Mint &operator*=(Mint const &a)\n  {\n    (x *= a.x) %= MOD;\n    return *this;\n  }\n  Mint &operator\/=(Mint const &a)\n  {\n    Mint b{a};\n    return *this *= b.power(MOD - 2);\n  }\n  Mint operator+(Mint const &a) const { return Mint(*this) += a; }\n  Mint operator-(Mint const &a) const { return Mint(*this) -= a; }\n  Mint operator*(Mint const &a) const { return Mint(*this) *= a; }\n  Mint operator\/(Mint const &a) const { return Mint(*this) \/= a; }\n  bool operator<(Mint const &a) const { return x < a.x; }\n  bool operator<=(Mint const &a) const { return x <= a.x; }\n  bool operator>(Mint const &a) const { return x > a.x; }\n  bool operator>=(Mint const &a) const { return x >= a.x; }\n  bool operator==(Mint const &a) const { return x == a.x; }\n  bool operator!=(Mint const &a) const { return !(*this == a); }\n  Mint power(ll N) const\n  {\n    if (N == 0)\n    {\n      return 1;\n    }\n    else if (N % 2 == 1)\n    {\n      return *this * power(N - 1);\n    }\n    else\n    {\n      Mint half = power(N \/ 2);\n      return half * half;\n    }\n  }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, Mint<MOD> const &rhs) { return rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, Mint<MOD> const &rhs) { return -rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, Mint<MOD> const &rhs) { return rhs * lhs; }\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, Mint<MOD> const &rhs) { return Mint<MOD>{lhs} \/ rhs; }\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a) { return stream >> a.x; }\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, Mint<MOD> const &a) { return stream << a.x; }\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n  vector<Mint<MOD>> inv, fact, factinv;\n  Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n  {\n    inv[1] = 1;\n    for (auto i{2LL}; i < MAX_SIZE; i++)\n    {\n      inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n    }\n    fact[0] = factinv[0] = 1;\n    for (auto i{1LL}; i < MAX_SIZE; i++)\n    {\n      fact[i] = Mint<MOD>(i) * fact[i - 1];\n      factinv[i] = inv[i] * factinv[i - 1];\n    }\n  }\n  Mint<MOD> operator()(int n, int k)\n  {\n    if (n >= 0 && k >= 0 && n - k >= 0)\n    {\n      return fact[n] * factinv[k] * factinv[n - k];\n    }\n    return 0;\n  }\n  Mint<MOD> catalan(int x, int y)\n  {\n    return (*this)(x + y, y) - (*this)(x + y, y - 1);\n  }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\n\/\/ ----- for C++17 -----\ntemplate <typename T, typename enable_if<is_integral<T>::value>::type * = nullptr>\nsize_t popcount(T x) { return bitset<64>(x).count(); }\nsize_t popcount(string const &S) { return bitset<200010>{S}.count(); }\n\/\/ ----- Infty -----\ntemplate <typename T>\nconstexpr T Infty() { return numeric_limits<T>::max(); }\ntemplate <typename T>\nconstexpr T mInfty() { return numeric_limits<T>::min(); }\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1'000'000'000'000'010LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n  cout << \"Yes\" << endl;\n  exit(0);\n}\nvoid No()\n{\n  cout << \"-1\" << endl;\n  exit(0);\n}\n\n\/\/ ----- Solve -----\n\nclass Solve\n{\n  int n;\n  vector<bool> s, t, u, v;\n  vector<vector<int>> res;\n  vector<int> zero_row, zero_col, one_row, one_col;\n\npublic:\n  Solve(int n, vector<bool> s, vector<bool> t, vector<bool> u, vector<bool> v) : n{n}, s{s}, t{t}, u{u}, v{v}, res(n, vector<int>(n, -1))\n  {\n  }\n\n  vector<vector<int>> answer()\n  {\n    prepare();\n    make_vectors();\n    if (!one_row.empty() && !one_col.empty())\n    {\n      puts_ones();\n    }\n    else\n    {\n      careful();\n    }\n    final_check();\n    return res;\n  }\n\nprivate:\n  void ch(int i, int j, int v)\n  {\n    if (res[i][j] == -1)\n    {\n      res[i][j] = v;\n    }\n    else if (res[i][j] != v)\n    {\n      No();\n    }\n  }\n\n  void final_check()\n  {\n    for (auto i{0}; i < n; ++i)\n    {\n      for (auto j{0}; j < n; ++j)\n      {\n        if (res[i][j] == -1)\n        {\n          res[i][j] = 0;\n        }\n      }\n    }\n    {\n      for (auto i : zero_row)\n      {\n        bool ok{false};\n        for (auto j{0}; j < n; ++j)\n        {\n          if (res[i][j] == 0)\n          {\n            ok = true;\n            break;\n          }\n        }\n        if (!ok)\n        {\n          No();\n        }\n      }\n    }\n    {\n      for (auto j : zero_col)\n      {\n        bool ok{false};\n        for (auto i{0}; i < n; ++i)\n        {\n          if (res[i][j] == 0)\n          {\n            ok = true;\n            break;\n          }\n        }\n        if (!ok)\n        {\n          No();\n        }\n      }\n    }\n  }\n\n  void careful()\n  {\n    {\n      int cnt{0};\n      for (auto i : one_row)\n      {\n        bool ok{false};\n        for (auto j{0}; j < n; ++j)\n        {\n          if (res[i][j] == 1)\n          {\n            ok = true;\n          }\n        }\n        if (ok)\n        {\n          continue;\n        }\n        if (static_cast<int>(zero_col.size()) == 0)\n        {\n          No();\n        }\n        auto j{cnt % zero_col.size()};\n        ch(i, zero_col[j], 1);\n      }\n    }\n    {\n      int cnt{0};\n      for (auto j : one_col)\n      {\n        bool ok{false};\n        for (auto i{0}; i < n; ++i)\n        {\n          if (res[i][j] == 1)\n          {\n            ok = true;\n          }\n        }\n        if (ok)\n        {\n          continue;\n        }\n        if (static_cast<int>(zero_row.size()) == 0)\n        {\n          No();\n        }\n        auto i{cnt % zero_row.size()};\n        ch(zero_row[i], j, 1);\n      }\n    }\n  }\n\n  void puts_ones()\n  {\n    for (auto i : one_row)\n    {\n      for (auto j : one_col)\n      {\n        ch(i, j, 1);\n      }\n    }\n  }\n\n  void make_vectors()\n  {\n    for (auto i{0}; i < n; ++i)\n    {\n      if (!s[i] && !u[i])\n      {\n        zero_row.push_back(i);\n      }\n    }\n    for (auto i{0}; i < n; ++i)\n    {\n      if (s[i] && u[i])\n      {\n        one_row.push_back(i);\n      }\n    }\n    for (auto i{0}; i < n; ++i)\n    {\n      if (!t[i] && !v[i])\n      {\n        zero_col.push_back(i);\n      }\n    }\n    for (auto i{0}; i < n; ++i)\n    {\n      if (t[i] && v[i])\n      {\n        one_col.push_back(i);\n      }\n    }\n  }\n\n  void prepare()\n  {\n    for (auto i{0}; i < n; ++i)\n    {\n      if (!s[i] && u[i])\n      {\n        for (auto j{0}; j < n; ++j)\n        {\n          ch(i, j, 1);\n        }\n      }\n      else if (s[i] && !u[i])\n      {\n        for (auto j{0}; j < n; ++j)\n        {\n          ch(i, j, 0);\n        }\n      }\n    }\n    for (auto i{0}; i < n; ++i)\n    {\n      if (!t[i] && v[i])\n      {\n        for (auto j{0}; j < n; ++j)\n        {\n          ch(j, i, 1);\n        }\n      }\n      else if (t[i] && !v[i])\n      {\n        for (auto j{0}; j < n; ++j)\n        {\n          ch(j, i, 0);\n        }\n      }\n    }\n  }\n};\n\n\/\/ ----- main() -----\n\nconstexpr int C{60};\n\nint main()\n{\n  int n;\n  cin >> n;\n  vector<bool> s(n), t(n);\n  vector<ll> us(n), vs(n);\n  for (auto i{0}; i < n; ++i)\n  {\n    int x;\n    cin >> x;\n    s[i] = (x == 1);\n  }\n  for (auto i{0}; i < n; ++i)\n  {\n    int x;\n    cin >> x;\n    t[i] = (x == 1);\n  }\n  for (auto i{0}; i < n; ++i)\n  {\n    cin >> us[i];\n  }\n  for (auto i{0}; i < n; ++i)\n  {\n    cin >> vs[i];\n  }\n  vector<vector<ll>> ans(C, vector<ll>(C, 0));\n  for (auto k{0}; k < C; ++k)\n  {\n    vector<bool> u(n), v(n);\n    for (auto i{0}; i < n; ++i)\n    {\n      u[i] = (us[i] >> k & 1);\n    }\n    for (auto i{0}; i < n; ++i)\n    {\n      v[i] = (vs[i] >> k & 1);\n    }\n    Solve solve(n, s, t, u, v);\n    auto res{solve.answer()};\n#if DEBUG == 1\n    for (auto i{0}; i < n; ++i)\n    {\n      for (auto j{0}; j < n; ++j)\n      {\n        cerr << res[i][j];\n        if (j < n - 1)\n        {\n          cerr << \" \";\n        }\n        else\n        {\n          cerr << endl;\n        }\n      }\n    }\n#endif\n    for (auto i{0}; i < n; ++i)\n    {\n      for (auto j{0}; j < n; ++j)\n      {\n        ans[i][j] |= static_cast<ll>(res[i][j]) << k;\n      }\n    }\n  }\n  for (auto i{0}; i < n; ++i)\n  {\n    for (auto j{0}; j < n; ++j)\n    {\n      cout << ans[i][j];\n      if (j < n - 1)\n      {\n        cout << \" \";\n      }\n      else\n      {\n        cout << endl;\n      }\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <chrono>\n#include <thread>\n\n#include <lcm\/lcm-cpp.hpp>\n#include <ConciseArgs>\n#include <drc_utils\/BotWrapper.hpp>\n#include <bot_param\/param_client.h>\n\n#include \"Bridge.hpp\"\n\nbool configure(const std::string& iConfigFile, Bridge& oBridge) {\n  std::shared_ptr<lcm::LCM> lcm(new lcm::LCM());\n  BotParam* param;\n  if (iConfigFile.length() == 0) {\n    param = bot_param_new_from_server(lcm->getUnderlyingLCM(), false);\n  }\n  else {\n    param = bot_param_new_from_file(iConfigFile.c_str());\n  }\n  drc::BotWrapper botWrapper(lcm, param);\n  std::string keyBase = \"network.lcm_bridge\";\n\n  \/\/ communities\n  bool found = false;\n  auto names = botWrapper.getKeys(keyBase + \".communities\");\n  for (auto name : names) {\n    std::string key = keyBase + \".communities.\" + name;\n    std::string url = botWrapper.get(key);\n    oBridge.addCommunity(name, url);\n    std::cout << \"added community \" << name << \" at \" << url << std::endl;\n    found = true;\n  }\n  if (!found) {\n    std::cout << \"error: no communities found\" << std::endl;\n    return false;\n  }\n\n  \/\/ bindings\n  std::vector<std::string> bindingStrings;\n  if (!botWrapper.get(keyBase + \".bindings\", bindingStrings)) {\n    std::cout << \"error: cannot find bindings in config\" << std::endl;\n    return false;\n  }\n  if (bindingStrings.size() == 0) {\n    std::cout << \"error: no bindings in config\" << std::endl;\n    return false;\n  }\n  if ((bindingStrings.size() % 4) != 0) {\n    std::cout << \"error: bindings must all have four entries\" << std::endl;\n    return false;\n  }\n\n  int numBindings = 0;\n  for (int i = 0; i < (int)bindingStrings.size(); i+=4) {\n    Bridge::BindingSpec spec;\n    spec.mInputCommunity  = bindingStrings[i+0];\n    spec.mOutputCommunity = bindingStrings[i+1];\n    spec.mInputChannel    = bindingStrings[i+2];\n    spec.mOutputChannel   = bindingStrings[i+3];\n    oBridge.addBinding(spec);\n    ++numBindings;\n  }\n  std::cout << \"added \" << numBindings << \" channel bindings\" << std::endl;\n\n  return true;\n}\n\nint main(const int iArgc, const char** iArgv) {\n  std::string configFile;\n\n  ConciseArgs opt(iArgc, (char**)iArgv);\n  opt.add(configFile, \"c\", \"config-file\",\n          \"config file (use param server if empty)\");\n  opt.parse();\n\n  Bridge bridge;\n  if (!configure(configFile, bridge)) {\n    std::cout << \"cannot configure bridge\" << std::endl;\n    return -1;\n  }\n\n  if (!bridge.start()) {\n    std::cout << \"cannot start bridge\" << std::endl;\n    return -1;\n  }\n  std::cout << \"bridge started\" << std::endl;\n\n  while (true) {\n    std::this_thread::sleep_for(std::chrono::seconds(1));\n  }\n\n  bridge.stop();\n\n  return 1;\n}\n<commit_msg>added bridge name identifier and changed config conventions<commit_after>#include <iostream>\n#include <chrono>\n#include <thread>\n\n#include <lcm\/lcm-cpp.hpp>\n#include <ConciseArgs>\n#include <drc_utils\/BotWrapper.hpp>\n#include <bot_param\/param_client.h>\n\n#include \"Bridge.hpp\"\n\nbool configure(const std::string& iConfigFile, const std::string& iName,\n               Bridge& oBridge) {\n  std::shared_ptr<lcm::LCM> lcm(new lcm::LCM());\n  BotParam* param;\n  if (iConfigFile.length() == 0) {\n    param = bot_param_new_from_server(lcm->getUnderlyingLCM(), false);\n  }\n  else {\n    param = bot_param_new_from_file(iConfigFile.c_str());\n    if (param == NULL) {\n      std::cout << \"error: could not read config file \" <<\n        iConfigFile << std::endl;\n    }\n  }\n  drc::BotWrapper botWrapper(lcm, param);\n  std::string keyBase = \"network.lcm_bridge\";\n\n  \/\/ communities\n  bool found = false;\n  auto names = botWrapper.getKeys(keyBase + \".communities\");\n  for (auto name : names) {\n    std::string key = keyBase + \".communities.\" + name;\n    std::string url = botWrapper.get(key);\n    oBridge.addCommunity(name, url);\n    std::cout << \"added community \" << name << \" at \" << url << std::endl;\n    found = true;\n  }\n  if (!found) {\n    std::cout << \"error: no communities found\" << std::endl;\n    return false;\n  }\n\n  \/\/ bindings\n  std::string bindingsKey = keyBase + \".bindings.\" + iName;\n  std::vector<std::string> bindingStrings;\n  if (!botWrapper.get(bindingsKey, bindingStrings)) {\n    std::cout << \"error: cannot find bindings in config\" << std::endl;\n    return false;\n  }\n  if (bindingStrings.size() == 0) {\n    std::cout << \"error: no bindings in config\" << std::endl;\n    return false;\n  }\n  if ((bindingStrings.size() % 4) != 0) {\n    std::cout << \"error: bindings must all have four entries\" << std::endl;\n    return false;\n  }\n\n  int numBindings = 0;\n  for (int i = 0; i < (int)bindingStrings.size(); i+=4) {\n    Bridge::BindingSpec spec;\n    spec.mInputCommunity  = bindingStrings[i+0];\n    spec.mOutputCommunity = bindingStrings[i+1];\n    spec.mInputChannel    = bindingStrings[i+2];\n    spec.mOutputChannel   = bindingStrings[i+3];\n    oBridge.addBinding(spec);\n    ++numBindings;\n  }\n  std::cout << \"added \" << numBindings << \" channel bindings\" << std::endl;\n\n  return true;\n}\n\nint main(const int iArgc, const char** iArgv) {\n  std::string configFile;\n  std::string name;\n\n  ConciseArgs opt(iArgc, (char**)iArgv);\n  opt.add(name, \"n\", \"name\",\n          \"name identifier of this bridge\", true);\n  opt.add(configFile, \"c\", \"config-file\",\n          \"config file (use param server if empty)\");\n  opt.parse();\n\n  std::cout << \"setting up bridge \\\"\" << name << \"\\\"\" << std::endl;\n  if (configFile.length() == 0) {\n    std::cout << \"using config from server\" << std::endl;\n  }\n  else {\n    std::cout << \"using config file \" << configFile << std::endl;\n  }\n\n  Bridge bridge;\n  if (!configure(configFile, name, bridge)) {\n    std::cout << \"error: cannot configure bridge\" << std::endl;\n    return -1;\n  }\n\n  if (!bridge.start()) {\n    std::cout << \"error: cannot start bridge\" << std::endl;\n    return -1;\n  }\n  std::cout << \"bridge started\" << std::endl;\n\n  while (true) {\n    std::this_thread::sleep_for(std::chrono::seconds(1));\n  }\n\n  bridge.stop();\n\n  return 1;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 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 \"source\/fuzz\/fuzzer_pass_add_local_variables.h\"\n\n#include \"source\/fuzz\/fuzzer_util.h\"\n#include \"source\/fuzz\/transformation_add_local_variable.h\"\n#include \"source\/fuzz\/transformation_add_type_pointer.h\"\n\nnamespace spvtools {\nnamespace fuzz {\n\nFuzzerPassAddLocalVariables::FuzzerPassAddLocalVariables(\n    opt::IRContext* ir_context, TransformationContext* transformation_context,\n    FuzzerContext* fuzzer_context,\n    protobufs::TransformationSequence* transformations)\n    : FuzzerPass(ir_context, transformation_context, fuzzer_context,\n                 transformations) {}\n\nvoid FuzzerPassAddLocalVariables::Apply() {\n  auto basic_type_ids_and_pointers =\n      GetAvailableBasicTypesAndPointers(SpvStorageClassFunction);\n\n  \/\/ These are the basic types that are available to this fuzzer pass.\n  auto& basic_types = basic_type_ids_and_pointers.first;\n\n  \/\/ These are the pointers to those basic types that are *initially* available\n  \/\/ to the fuzzer pass.  The fuzzer pass might add pointer types in cases where\n  \/\/ none are available for a given basic type.\n  auto& basic_type_to_pointers = basic_type_ids_and_pointers.second;\n\n  \/\/ Consider every function in the module.\n  for (auto& function : *GetIRContext()->module()) {\n    \/\/ Probabilistically keep adding random variables to this function.\n    while (GetFuzzerContext()->ChoosePercentage(\n        GetFuzzerContext()->GetChanceOfAddingLocalVariable())) {\n      \/\/ Choose a random basic type; the new variable's type will be a pointer\n      \/\/ to this basic type.\n      uint32_t basic_type =\n          basic_types[GetFuzzerContext()->RandomIndex(basic_types)];\n      uint32_t pointer_type;\n      std::vector<uint32_t>& available_pointers_to_basic_type =\n          basic_type_to_pointers.at(basic_type);\n      \/\/ Determine whether there is at least one pointer to this basic type.\n      if (available_pointers_to_basic_type.empty()) {\n        \/\/ There is not.  Make one, to use here, and add it to the available\n        \/\/ pointers for the basic type so that future variables can potentially\n        \/\/ use it.\n        pointer_type = GetFuzzerContext()->GetFreshId();\n        ApplyTransformation(TransformationAddTypePointer(\n            pointer_type, SpvStorageClassFunction, basic_type));\n        available_pointers_to_basic_type.push_back(pointer_type);\n      } else {\n        \/\/ There is - grab one.\n        pointer_type =\n            available_pointers_to_basic_type[GetFuzzerContext()->RandomIndex(\n                available_pointers_to_basic_type)];\n      }\n      ApplyTransformation(TransformationAddLocalVariable(\n          GetFuzzerContext()->GetFreshId(), pointer_type, function.result_id(),\n          FindOrCreateZeroConstant(basic_type, false), true));\n    }\n  }\n}\n\n}  \/\/ namespace fuzz\n}  \/\/ namespace spvtools\n<commit_msg>spirv-fuzz: Avoid out-of-bounds access (#4395)<commit_after>\/\/ Copyright (c) 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 \"source\/fuzz\/fuzzer_pass_add_local_variables.h\"\n\n#include \"source\/fuzz\/fuzzer_util.h\"\n#include \"source\/fuzz\/transformation_add_local_variable.h\"\n#include \"source\/fuzz\/transformation_add_type_pointer.h\"\n\nnamespace spvtools {\nnamespace fuzz {\n\nFuzzerPassAddLocalVariables::FuzzerPassAddLocalVariables(\n    opt::IRContext* ir_context, TransformationContext* transformation_context,\n    FuzzerContext* fuzzer_context,\n    protobufs::TransformationSequence* transformations)\n    : FuzzerPass(ir_context, transformation_context, fuzzer_context,\n                 transformations) {}\n\nvoid FuzzerPassAddLocalVariables::Apply() {\n  auto basic_type_ids_and_pointers =\n      GetAvailableBasicTypesAndPointers(SpvStorageClassFunction);\n\n  \/\/ These are the basic types that are available to this fuzzer pass.\n  auto& basic_types = basic_type_ids_and_pointers.first;\n  if (basic_types.empty()) {\n    \/\/ The pass cannot do anything if there are no basic types.\n    return;\n  }\n\n  \/\/ These are the pointers to those basic types that are *initially* available\n  \/\/ to the fuzzer pass.  The fuzzer pass might add pointer types in cases where\n  \/\/ none are available for a given basic type.\n  auto& basic_type_to_pointers = basic_type_ids_and_pointers.second;\n\n  \/\/ Consider every function in the module.\n  for (auto& function : *GetIRContext()->module()) {\n    \/\/ Probabilistically keep adding random variables to this function.\n    while (GetFuzzerContext()->ChoosePercentage(\n        GetFuzzerContext()->GetChanceOfAddingLocalVariable())) {\n      \/\/ Choose a random basic type; the new variable's type will be a pointer\n      \/\/ to this basic type.\n      uint32_t basic_type =\n          basic_types[GetFuzzerContext()->RandomIndex(basic_types)];\n      uint32_t pointer_type;\n      std::vector<uint32_t>& available_pointers_to_basic_type =\n          basic_type_to_pointers.at(basic_type);\n      \/\/ Determine whether there is at least one pointer to this basic type.\n      if (available_pointers_to_basic_type.empty()) {\n        \/\/ There is not.  Make one, to use here, and add it to the available\n        \/\/ pointers for the basic type so that future variables can potentially\n        \/\/ use it.\n        pointer_type = GetFuzzerContext()->GetFreshId();\n        ApplyTransformation(TransformationAddTypePointer(\n            pointer_type, SpvStorageClassFunction, basic_type));\n        available_pointers_to_basic_type.push_back(pointer_type);\n      } else {\n        \/\/ There is - grab one.\n        pointer_type =\n            available_pointers_to_basic_type[GetFuzzerContext()->RandomIndex(\n                available_pointers_to_basic_type)];\n      }\n      ApplyTransformation(TransformationAddLocalVariable(\n          GetFuzzerContext()->GetFreshId(), pointer_type, function.result_id(),\n          FindOrCreateZeroConstant(basic_type, false), true));\n    }\n  }\n}\n\n}  \/\/ namespace fuzz\n}  \/\/ namespace spvtools\n<|endoftext|>"}
{"text":"<commit_before>#include <glad\/glad.h>\n#include <GLFW\/glfw3.h>\n#include <glm\/glm.hpp>\n#include <glm\/gtc\/matrix_transform.hpp>\n#include <glm\/gtc\/type_ptr.hpp>\n#include <glm\/gtx\/string_cast.hpp>\n#include <lua\/lua.hpp>\n#include <vector>\n#include <fmt\/format.h>\n#include <btBulletDynamicsCommon.h>\n\n#include \"terrian_config.hpp\"\n#include \"matrixstacksingleton.hpp\"\n#include \"polygon.hpp\"\n#include \"logiccontext.hpp\"\n#include \"visualcontext.hpp\"\n#include \"heightmap.hpp\"\n#include \"line.hpp\"\n#include \"triangle.hpp\"\n#include \"circle.hpp\"\n#include \"rectangle.hpp\"\n#include \"addtodrawqueue.hpp\"\n#include \"luae\/script.hpp\"\n#include \"luae\/scriptmanager.hpp\"\n#include \"luae\/scriptheightmap.hpp\"\n#include \"luae\/scriptriangle.hpp\"\n#include \"luae\/scriptmouse.hpp\"\n\n#include \"collision\/simpleworld.hpp\"\n#include \"collision\/spherecollider.hpp\"\n\n\/\/For stringifying preprocessor values\n#define xstr(s) str(s)\n     #define str(s) #s\n#define concat(first, second) first second\n\nstatic struct LogicContext logicContext;\nstatic glm::vec3 ray_world;\n\n\nstatic void key_callback(GLFWwindow* window, int key, int scancode, int action, int mods) {\n\tglm::vec3 up = glm::vec3(glm::vec4(0.0, 1.0, 0.0, 1.0) * logicContext.modelview);\n\tglm::vec3 down = glm::vec3(glm::vec4(0.0, -1.0, 0.0, 1.0) * logicContext.modelview);\n\tglm::vec3 left = glm::vec3(glm::vec4(-1.0, 0.0, 0.0, 1.0) * logicContext.modelview);\n\tglm::vec3 right = glm::vec3(glm::vec4(1.0, 0.0, 0.0, 1.0) * logicContext.modelview);\n\tglm::vec3 back = glm::vec3(glm::vec4(0.0, 0.0, -1.0, 1.0) * logicContext.modelview);\n\tglm::vec3 forward = glm::vec3(glm::vec4(0.0, 0.0, 1.0, 1.0) * logicContext.modelview);\n\tif (key == GLFW_KEY_ESCAPE && action == GLFW_PRESS){\n\t\tglfwSetWindowShouldClose(window, GL_TRUE);\n\t}\n\tif (key == GLFW_KEY_SPACE && action == GLFW_PRESS){\n\t\tprintf(\"Triangle 1 Model Matrix: %s\\n\", glm::to_string(logicContext.modelview).c_str());\n\t}\n\tif(key == GLFW_KEY_R && action == GLFW_RELEASE){\n\t\tlogicContext.modelview = glm::mat4();\n\n\t}\n\tif(key == GLFW_KEY_LEFT && mods == GLFW_MOD_SHIFT){\n\t\tlogicContext.modelview = glm::rotate(logicContext.modelview, 0.1f, up);\n\t}\n\telse if(key == GLFW_KEY_RIGHT && mods == GLFW_MOD_SHIFT){\n\t\tlogicContext.modelview = glm::rotate(logicContext.modelview, 0.1f, down);\n\t}\n\telse if(key == GLFW_KEY_LEFT && mods == 0){\n\t\tlogicContext.modelview = glm::translate(logicContext.modelview, left * 0.1f);\n\t}\n\telse if(key == GLFW_KEY_RIGHT && mods == 0){\n\t\tlogicContext.modelview = glm::translate(logicContext.modelview, right * 0.1f);\n\t}\n\tif(key == GLFW_KEY_UP && mods == 0){\n\t\tlogicContext.modelview = glm::translate(logicContext.modelview, up * 0.1f);\n\t}\n\telse if(key == GLFW_KEY_DOWN && mods == 0){\n\t\tlogicContext.modelview = glm::translate(logicContext.modelview, down * 0.1f);\n\t}\n\telse if(key == GLFW_KEY_UP && mods == GLFW_MOD_SHIFT){\n\t\tlogicContext.modelview = glm::rotate(logicContext.modelview, 0.1f, left);\n\t}\n\telse if(key == GLFW_KEY_DOWN && mods == GLFW_MOD_SHIFT){\n\t\tlogicContext.modelview = glm::rotate(logicContext.modelview, 0.1f, right);\n\n\t}else if(key == GLFW_KEY_UP && mods == GLFW_MOD_CONTROL){\n\t\tlogicContext.modelview = glm::translate(logicContext.modelview, back * 0.1f);\n\t}else if(key == GLFW_KEY_DOWN && mods == GLFW_MOD_CONTROL){\n\t\tlogicContext.modelview = glm::translate(logicContext.modelview, forward * 0.1f);\n\t}\n}\nstatic void calcWorldPickRay(GLFWwindow *window){\n\t\/\/Build ray from mouse\n\tdouble mouseX;\n\tdouble mouseY;\n\n\tglfwGetCursorPos(window, &mouseX, &mouseY);\n\n\tglm::vec4 ray_clip = glm::vec4((2.0f * mouseX) \/ VisualContext::width - 1.0f, 1.0f - (2.0f * mouseY) \/ VisualContext::height, -1.0f, 1.0f);\n\n\tglm::vec4 ray_eye = glm::inverse(VisualContext::projection_matrix) * ray_clip;\n\tray_eye.z = -1.0f;\n\tray_eye.w = 1.0f;\n\n\tray_world = glm::vec3(glm::inverse(logicContext.modelview) * ray_eye);\n\t\/\/\t\tray_world = glm::normalize(ray_world);\n\n}\n\nint main(void) {\n\n\t\/\/Setup for windows\n\tGLFWwindow *window = VisualContext::CreateGLFWWindow(key_callback);\n\tGLuint shader_program = VisualContext::make_shader_program(concat(xstr(SHADERS_DIR), \"\/shader.vert\"), concat(xstr(SHADERS_DIR), \"\/shader.frag\"));\n\tglUseProgram(shader_program);\n\tGLuint vertShaderLocation = glGetAttribLocation(shader_program, \"vert\");\n\tGLuint uloc_project   = glGetUniformLocation(shader_program, \"project\");\n\tGLuint uloc_modelview = glGetUniformLocation(shader_program, \"modelview\");\n\n\t\/* Compute the projection matrix *\/\n\tVisualContext::projection_matrix = glm::perspective(VisualContext::view_angle, VisualContext::aspect_ratio, VisualContext::z_near, VisualContext::z_far);\n\tlogicContext.uloc_modelview = uloc_modelview;\n\n\t\/* Set the camera position  *\/\n\tlogicContext.modelview = glm::translate(logicContext.modelview, glm::vec3(0.0f, 0.0f, -20.0f));\n\tlogicContext.modelview = glm::rotate(logicContext.modelview, 0.0f, glm::vec3(-1.0f, 0.0f, 0.0f));\n\tglViewport(0,0,VisualContext::width, VisualContext::height);\n\tglClearColor(0.0f, 0.0f, 0.0f, 0.0f);\n\t\/\/END Setup for windows\n\n\n\t\/\/Create a draw queue\n\tstd::vector<Geometry::Polygon*> drawQueue;\n\t\/\/Draw queue gets added to a command so other parts of code can easily add\n\t\/\/to queue\n\tAddToDrawQueueCommand::SetQueue(&drawQueue);\n\n\n\n\/\/\/-----includes_end-----\n\n\tint i;\n\t\/\/\/-----initialization_start-----\n\n\t\/\/\/collision configuration contains default setup for memory, collision setup. Advanced users can create their own configuration.\n\tbtDefaultCollisionConfiguration* collisionConfiguration = new btDefaultCollisionConfiguration();\n\n\t\/\/\/use the default collision dispatcher. For parallel processing you can use a diffent dispatcher (see Extras\/BulletMultiThreaded)\n\tbtCollisionDispatcher* dispatcher = new btCollisionDispatcher(collisionConfiguration);\n\n\t\/\/\/btDbvtBroadphase is a good general purpose broadphase. You can also try out btAxis3Sweep.\n\tbtBroadphaseInterface* overlappingPairCache = new btDbvtBroadphase();\n\n\t\/\/\/the default constraint solver. For parallel processing you can use a different solver (see Extras\/BulletMultiThreaded)\n\tbtSequentialImpulseConstraintSolver* solver = new btSequentialImpulseConstraintSolver;\n\n\tbtDiscreteDynamicsWorld* dynamicsWorld = new btDiscreteDynamicsWorld(dispatcher, overlappingPairCache, solver, collisionConfiguration);\n\n\tdynamicsWorld->setGravity(btVector3(0, -10, 0));\n\n\t\/\/\/-----initialization_end-----\n\n\t\/\/keep track of the shapes, we release memory at exit.\n\t\/\/make sure to re-use collision shapes among rigid bodies whenever possible!\n\tbtAlignedObjectArray<btCollisionShape*> collisionShapes;\n\n\t\/\/\/create a few basic rigid bodies\n\n\t\/\/the ground is a cube of side 100 at position y = -56.\n\t\/\/the sphere will hit it at y = -6, with center at -5\n\tbtRigidBody* rectBody;\n\t{\n\t\tbtCollisionShape* groundShape = new btBoxShape(btVector3(btScalar(10.), btScalar(10.), btScalar(10.)));\n\n\t\tcollisionShapes.push_back(groundShape);\n\n\t\tbtTransform groundTransform;\n\t\tgroundTransform.setIdentity();\n\t\tgroundTransform.setOrigin(btVector3(11, -15, 0));\n\n\t\tbtScalar mass(0.);\n\n\t\t\/\/rigidbody is dynamic if and only if mass is non zero, otherwise static\n\t\tbool isDynamic = (mass != 0.f);\n\n\t\tbtVector3 localInertia(0, 0, 0);\n\t\tif (isDynamic)\n\t\t\tgroundShape->calculateLocalInertia(mass, localInertia);\n\n\t\t\/\/using motionstate is optional, it provides interpolation capabilities, and only synchronizes 'active' objects\n\t\tbtDefaultMotionState* myMotionState = new btDefaultMotionState(groundTransform);\n\t\tbtRigidBody::btRigidBodyConstructionInfo rbInfo(mass, myMotionState, groundShape, localInertia);\n\t\trectBody = new btRigidBody(rbInfo);\n\t\trectBody->setRestitution(1.0);\n\n\t\t\/\/add the body to the dynamics world\n\t\tdynamicsWorld->addRigidBody(rectBody);\n\t}\n\tbtRigidBody* sphereBody;\n\t{\n\t\t\/\/create a dynamic rigidbody\n\n\t\t\/\/btCollisionShape* colShape = new btBoxShape(btVector3(1,1,1));\n\t\tbtCollisionShape* colShape = new btSphereShape(btScalar(1.));\n\t\tcollisionShapes.push_back(colShape);\n\n\t\t\/\/\/ Create Dynamic Objects\n\t\tbtTransform startTransform;\n\t\tstartTransform.setIdentity();\n\n\t\tbtScalar mass(10.f);\n\n\t\t\/\/rigidbody is dynamic if and only if mass is non zero, otherwise static\n\t\tbool isDynamic = (mass != 0.f);\n\n\t\tbtVector3 localInertia(1, 0, 0);\n\t\tif (isDynamic)\n\t\t\tcolShape->calculateLocalInertia(mass, localInertia);\n\n\t\tstartTransform.setOrigin(btVector3(0, 10, 0));\n\n\t\t\/\/using motionstate is recommended, it provides interpolation capabilities, and only synchronizes 'active' objects\n\t\tbtDefaultMotionState* myMotionState = new btDefaultMotionState(startTransform);\n\t\tbtRigidBody::btRigidBodyConstructionInfo rbInfo(mass, myMotionState, colShape, localInertia);\n\t\tsphereBody = new btRigidBody(rbInfo);\n\t\tsphereBody->setRestitution(1.0);\n\n\t\tdynamicsWorld->addRigidBody(sphereBody);\n\t}\n\n\tGeometry::Rectangle rectangle;\n\trectangle.setLengths(20,20);\n\n\trectangle.setLogicContext(&logicContext);\n\trectangle.setShaderLocations(vertShaderLocation);\n\trectangle.buildStatic();\n\n\tdrawQueue.push_back(&rectangle);\n\n\tbtTransform rectTrans;\n\trectBody->getMotionState()->getWorldTransform(rectTrans);\n\tbtVector3& rectOrigin = rectTrans.getOrigin();\n\trectangle.getMoveable().setPos(glm::vec3(\n\t\t\t\trectOrigin.getX()-10,rectOrigin.getY()-10,rectOrigin.getZ()));\n\n\tGeometry::Circle circle;\n\tcircle.setLogicContext(&logicContext);\n\tcircle.setShaderLocations(vertShaderLocation);\n\tcircle.buildStatic();\n\n\n\tdrawQueue.push_back(&circle);\n\n\t\/\/\/ Do some simulation\n\t\n\t\/\/Enables antialiasing\n\tglEnable(GL_MULTISAMPLE);\n\n\twhile (!glfwWindowShouldClose(window)) {\n\t\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\t\tglPolygonMode(GL_FRONT, GL_FILL);\n\t\tglUniformMatrix4fv(uloc_project, 1, GL_FALSE, glm::value_ptr(VisualContext::projection_matrix));\n\n\t\tdynamicsWorld->stepSimulation(1.f \/ 60.f, 10);\n\n\t\t\/\/print positions of all objects\n\t\tfor (int j = dynamicsWorld->getNumCollisionObjects() - 1; j >= 0; j--)\n\t\t{\n\t\t\tbtCollisionObject* obj = dynamicsWorld->getCollisionObjectArray()[j];\n\t\t\tbtRigidBody* body = btRigidBody::upcast(obj);\n\t\t\tbtTransform trans;\n\t\t\tif (body && body->getMotionState())\n\t\t\t{\n\t\t\t\tbody->getMotionState()->getWorldTransform(trans);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\ttrans = obj->getWorldTransform();\n\t\t\t}\n\t\t\tprintf(\"world pos object %d = %f,%f,%f\\n\", j, float(trans.getOrigin().getX()), float(trans.getOrigin().getY()), float(trans.getOrigin().getZ()));\n\t\t}\n\t\tbtTransform sphereTrans;\n\t\tsphereBody->getMotionState()->getWorldTransform(sphereTrans);\n\t\tbtVector3& sphereOrigin = sphereTrans.getOrigin();\n\t\tcircle.getMoveable().setPos(glm::vec3(\n\t\t\t\t\tsphereOrigin.getX(),sphereOrigin.getY(),sphereOrigin.getZ()));\n\t\/\/\/-----stepsimulation_end-----\n\n\t\tfor(std::vector<Geometry::Polygon*>::iterator drawHost = drawQueue.begin();\n\t\t\t\tdrawHost != drawQueue.end();\n\t\t\t\tdrawHost++){\n\t\t\tglDisable(GL_CULL_FACE);\n\t\t\t\/**\n\t\t\t * TODO This is okay for now, however the logicContext will become\n\t\t\t * the shader from a shader manager\/factory \n\t\t\t * so each object should set it, itself.\n\t\t\t * (*drawHost)->setLogicContext(&logicContext);\n\t\t\t *\/\n\t\t\t(*drawHost)->setLogicContext(&logicContext);\n\n\t\t\t(*drawHost)->update();\n\t\t\t(*drawHost)->draw();\n\t\t}\n\n\t\tglfwSwapBuffers(window);\n\t\tglfwPollEvents();\n\t}\n\n\tMatrixStackSingleton::Destroy();\n\t\/\/cleanup in the reverse order of creation\/initialization\n\n\t\/\/\/-----cleanup_start-----\n\n\t\/\/remove the rigidbodies from the dynamics world and delete them\n\tfor (i = dynamicsWorld->getNumCollisionObjects() - 1; i >= 0; i--)\n\t{\n\t\tbtCollisionObject* obj = dynamicsWorld->getCollisionObjectArray()[i];\n\t\tbtRigidBody* body = btRigidBody::upcast(obj);\n\t\tif (body && body->getMotionState())\n\t\t{\n\t\t\tdelete body->getMotionState();\n\t\t}\n\t\tdynamicsWorld->removeCollisionObject(obj);\n\t\tdelete obj;\n\t}\n\n\t\/\/delete collision shapes\n\tfor (int j = 0; j < collisionShapes.size(); j++)\n\t{\n\t\tbtCollisionShape* shape = collisionShapes[j];\n\t\tcollisionShapes[j] = 0;\n\t\tdelete shape;\n\t}\n\n\t\/\/delete dynamics world\n\tdelete dynamicsWorld;\n\n\t\/\/delete solver\n\tdelete solver;\n\n\t\/\/delete broadphase\n\tdelete overlappingPairCache;\n\n\t\/\/delete dispatcher\n\tdelete dispatcher;\n\n\tdelete collisionConfiguration;\n\n\t\/\/next line is optional: it will be cleared by the destructor when the array goes out of scope\ncollisionShapes.clear();\t\n\n\tglfwDestroyWindow(window);\n\n\tglfwTerminate();\n\treturn 0;\n}\n<commit_msg>Added comments about bullet's difference with origins and half lengths<commit_after>#include <glad\/glad.h>\n#include <GLFW\/glfw3.h>\n#include <glm\/glm.hpp>\n#include <glm\/gtc\/matrix_transform.hpp>\n#include <glm\/gtc\/type_ptr.hpp>\n#include <glm\/gtx\/string_cast.hpp>\n#include <lua\/lua.hpp>\n#include <vector>\n#include <fmt\/format.h>\n#include <btBulletDynamicsCommon.h>\n\n#include \"terrian_config.hpp\"\n#include \"matrixstacksingleton.hpp\"\n#include \"polygon.hpp\"\n#include \"logiccontext.hpp\"\n#include \"visualcontext.hpp\"\n#include \"heightmap.hpp\"\n#include \"line.hpp\"\n#include \"triangle.hpp\"\n#include \"circle.hpp\"\n#include \"rectangle.hpp\"\n#include \"addtodrawqueue.hpp\"\n#include \"luae\/script.hpp\"\n#include \"luae\/scriptmanager.hpp\"\n#include \"luae\/scriptheightmap.hpp\"\n#include \"luae\/scriptriangle.hpp\"\n#include \"luae\/scriptmouse.hpp\"\n\n#include \"collision\/simpleworld.hpp\"\n#include \"collision\/spherecollider.hpp\"\n\n\/\/For stringifying preprocessor values\n#define xstr(s) str(s)\n     #define str(s) #s\n#define concat(first, second) first second\n\nstatic struct LogicContext logicContext;\nstatic glm::vec3 ray_world;\n\n\nstatic void key_callback(GLFWwindow* window, int key, int scancode, int action, int mods) {\n\tglm::vec3 up = glm::vec3(glm::vec4(0.0, 1.0, 0.0, 1.0) * logicContext.modelview);\n\tglm::vec3 down = glm::vec3(glm::vec4(0.0, -1.0, 0.0, 1.0) * logicContext.modelview);\n\tglm::vec3 left = glm::vec3(glm::vec4(-1.0, 0.0, 0.0, 1.0) * logicContext.modelview);\n\tglm::vec3 right = glm::vec3(glm::vec4(1.0, 0.0, 0.0, 1.0) * logicContext.modelview);\n\tglm::vec3 back = glm::vec3(glm::vec4(0.0, 0.0, -1.0, 1.0) * logicContext.modelview);\n\tglm::vec3 forward = glm::vec3(glm::vec4(0.0, 0.0, 1.0, 1.0) * logicContext.modelview);\n\tif (key == GLFW_KEY_ESCAPE && action == GLFW_PRESS){\n\t\tglfwSetWindowShouldClose(window, GL_TRUE);\n\t}\n\tif (key == GLFW_KEY_SPACE && action == GLFW_PRESS){\n\t\tprintf(\"Triangle 1 Model Matrix: %s\\n\", glm::to_string(logicContext.modelview).c_str());\n\t}\n\tif(key == GLFW_KEY_R && action == GLFW_RELEASE){\n\t\tlogicContext.modelview = glm::mat4();\n\n\t}\n\tif(key == GLFW_KEY_LEFT && mods == GLFW_MOD_SHIFT){\n\t\tlogicContext.modelview = glm::rotate(logicContext.modelview, 0.1f, up);\n\t}\n\telse if(key == GLFW_KEY_RIGHT && mods == GLFW_MOD_SHIFT){\n\t\tlogicContext.modelview = glm::rotate(logicContext.modelview, 0.1f, down);\n\t}\n\telse if(key == GLFW_KEY_LEFT && mods == 0){\n\t\tlogicContext.modelview = glm::translate(logicContext.modelview, left * 0.1f);\n\t}\n\telse if(key == GLFW_KEY_RIGHT && mods == 0){\n\t\tlogicContext.modelview = glm::translate(logicContext.modelview, right * 0.1f);\n\t}\n\tif(key == GLFW_KEY_UP && mods == 0){\n\t\tlogicContext.modelview = glm::translate(logicContext.modelview, up * 0.1f);\n\t}\n\telse if(key == GLFW_KEY_DOWN && mods == 0){\n\t\tlogicContext.modelview = glm::translate(logicContext.modelview, down * 0.1f);\n\t}\n\telse if(key == GLFW_KEY_UP && mods == GLFW_MOD_SHIFT){\n\t\tlogicContext.modelview = glm::rotate(logicContext.modelview, 0.1f, left);\n\t}\n\telse if(key == GLFW_KEY_DOWN && mods == GLFW_MOD_SHIFT){\n\t\tlogicContext.modelview = glm::rotate(logicContext.modelview, 0.1f, right);\n\n\t}else if(key == GLFW_KEY_UP && mods == GLFW_MOD_CONTROL){\n\t\tlogicContext.modelview = glm::translate(logicContext.modelview, back * 0.1f);\n\t}else if(key == GLFW_KEY_DOWN && mods == GLFW_MOD_CONTROL){\n\t\tlogicContext.modelview = glm::translate(logicContext.modelview, forward * 0.1f);\n\t}\n}\nstatic void calcWorldPickRay(GLFWwindow *window){\n\t\/\/Build ray from mouse\n\tdouble mouseX;\n\tdouble mouseY;\n\n\tglfwGetCursorPos(window, &mouseX, &mouseY);\n\n\tglm::vec4 ray_clip = glm::vec4((2.0f * mouseX) \/ VisualContext::width - 1.0f, 1.0f - (2.0f * mouseY) \/ VisualContext::height, -1.0f, 1.0f);\n\n\tglm::vec4 ray_eye = glm::inverse(VisualContext::projection_matrix) * ray_clip;\n\tray_eye.z = -1.0f;\n\tray_eye.w = 1.0f;\n\n\tray_world = glm::vec3(glm::inverse(logicContext.modelview) * ray_eye);\n\t\/\/\t\tray_world = glm::normalize(ray_world);\n\n}\n\nint main(void) {\n\n\t\/\/Setup for windows\n\tGLFWwindow *window = VisualContext::CreateGLFWWindow(key_callback);\n\tGLuint shader_program = VisualContext::make_shader_program(concat(xstr(SHADERS_DIR), \"\/shader.vert\"), concat(xstr(SHADERS_DIR), \"\/shader.frag\"));\n\tglUseProgram(shader_program);\n\tGLuint vertShaderLocation = glGetAttribLocation(shader_program, \"vert\");\n\tGLuint uloc_project   = glGetUniformLocation(shader_program, \"project\");\n\tGLuint uloc_modelview = glGetUniformLocation(shader_program, \"modelview\");\n\n\t\/* Compute the projection matrix *\/\n\tVisualContext::projection_matrix = glm::perspective(VisualContext::view_angle, VisualContext::aspect_ratio, VisualContext::z_near, VisualContext::z_far);\n\tlogicContext.uloc_modelview = uloc_modelview;\n\n\t\/* Set the camera position  *\/\n\tlogicContext.modelview = glm::translate(logicContext.modelview, glm::vec3(0.0f, 0.0f, -20.0f));\n\tlogicContext.modelview = glm::rotate(logicContext.modelview, 0.0f, glm::vec3(-1.0f, 0.0f, 0.0f));\n\tglViewport(0,0,VisualContext::width, VisualContext::height);\n\tglClearColor(0.0f, 0.0f, 0.0f, 0.0f);\n\t\/\/END Setup for windows\n\n\n\t\/\/Create a draw queue\n\tstd::vector<Geometry::Polygon*> drawQueue;\n\t\/\/Draw queue gets added to a command so other parts of code can easily add\n\t\/\/to queue\n\tAddToDrawQueueCommand::SetQueue(&drawQueue);\n\n\n\n\/\/\/-----includes_end-----\n\n\tint i;\n\t\/\/\/-----initialization_start-----\n\n\t\/\/\/collision configuration contains default setup for memory, collision setup. Advanced users can create their own configuration.\n\tbtDefaultCollisionConfiguration* collisionConfiguration = new btDefaultCollisionConfiguration();\n\n\t\/\/\/use the default collision dispatcher. For parallel processing you can use a diffent dispatcher (see Extras\/BulletMultiThreaded)\n\tbtCollisionDispatcher* dispatcher = new btCollisionDispatcher(collisionConfiguration);\n\n\t\/\/\/btDbvtBroadphase is a good general purpose broadphase. You can also try out btAxis3Sweep.\n\tbtBroadphaseInterface* overlappingPairCache = new btDbvtBroadphase();\n\n\t\/\/\/the default constraint solver. For parallel processing you can use a different solver (see Extras\/BulletMultiThreaded)\n\tbtSequentialImpulseConstraintSolver* solver = new btSequentialImpulseConstraintSolver;\n\n\tbtDiscreteDynamicsWorld* dynamicsWorld = new btDiscreteDynamicsWorld(dispatcher, overlappingPairCache, solver, collisionConfiguration);\n\n\tdynamicsWorld->setGravity(btVector3(0, -10, 0));\n\n\t\/\/\/-----initialization_end-----\n\n\t\/\/keep track of the shapes, we release memory at exit.\n\t\/\/make sure to re-use collision shapes among rigid bodies whenever possible!\n\tbtAlignedObjectArray<btCollisionShape*> collisionShapes;\n\n\t\/\/\/create a few basic rigid bodies\n\n\t\/\/the ground is a cube of side 100 at position y = -56.\n\t\/\/the sphere will hit it at y = -6, with center at -5\n\tbtRigidBody* rectBody;\n\t{\n\t\t\/\/this creates a box with half lengths of 10\n\t\tbtCollisionShape* groundShape = new btBoxShape(btVector3(btScalar(10.), btScalar(10.), btScalar(10.)));\n\n\t\tcollisionShapes.push_back(groundShape);\n\n\t\tbtTransform groundTransform;\n\t\tgroundTransform.setIdentity();\n\t\t\/\/set middle of box at these coordinates\n\t\tgroundTransform.setOrigin(btVector3(11, -15, 0));\n\n\t\tbtScalar mass(0.);\n\t\t\n\n\t\t\/\/rigidbody is dynamic if and only if mass is non zero, otherwise static\n\t\tbool isDynamic = (mass != 0.f);\n\n\t\tbtVector3 localInertia(0, 0, 0);\n\t\tif (isDynamic)\n\t\t\tgroundShape->calculateLocalInertia(mass, localInertia);\n\n\t\t\/\/using motionstate is optional, it provides interpolation capabilities, and only synchronizes 'active' objects\n\t\tbtDefaultMotionState* myMotionState = new btDefaultMotionState(groundTransform);\n\t\tbtRigidBody::btRigidBodyConstructionInfo rbInfo(mass, myMotionState, groundShape, localInertia);\n\t\trectBody = new btRigidBody(rbInfo);\n\t\trectBody->setRestitution(1.0);\n\n\t\t\/\/add the body to the dynamics world\n\t\tdynamicsWorld->addRigidBody(rectBody);\n\t}\n\tbtRigidBody* sphereBody;\n\t{\n\t\t\/\/create a dynamic rigidbody\n\n\t\t\/\/btCollisionShape* colShape = new btBoxShape(btVector3(1,1,1));\n\t\tbtCollisionShape* colShape = new btSphereShape(btScalar(1.));\n\t\tcollisionShapes.push_back(colShape);\n\n\t\t\/\/\/ Create Dynamic Objects\n\t\tbtTransform startTransform;\n\t\tstartTransform.setIdentity();\n\n\t\tbtScalar mass(10.f);\n\n\t\t\/\/rigidbody is dynamic if and only if mass is non zero, otherwise static\n\t\tbool isDynamic = (mass != 0.f);\n\n\t\tbtVector3 localInertia(1, 0, 0);\n\t\tif (isDynamic)\n\t\t\tcolShape->calculateLocalInertia(mass, localInertia);\n\n\t\tstartTransform.setOrigin(btVector3(0, 10, 0));\n\n\t\t\/\/using motionstate is recommended, it provides interpolation capabilities, and only synchronizes 'active' objects\n\t\tbtDefaultMotionState* myMotionState = new btDefaultMotionState(startTransform);\n\t\tbtRigidBody::btRigidBodyConstructionInfo rbInfo(mass, myMotionState, colShape, localInertia);\n\t\tsphereBody = new btRigidBody(rbInfo);\n\t\tsphereBody->setRestitution(1.0);\n\n\t\tdynamicsWorld->addRigidBody(sphereBody);\n\t}\n\n\tGeometry::Rectangle rectangle;\n\t\/\/Our rectangle doesn't use half lengths at the moment\n\trectangle.setLengths(20,20);\n\n\trectangle.setLogicContext(&logicContext);\n\trectangle.setShaderLocations(vertShaderLocation);\n\trectangle.buildStatic();\n\n\tdrawQueue.push_back(&rectangle);\n\n\tbtTransform rectTrans;\n\trectBody->getMotionState()->getWorldTransform(rectTrans);\n\tbtVector3& rectOrigin = rectTrans.getOrigin();\n\t\/\/Minus half lengths of bulletbox because our objects origins are at\n\t\/\/bottom left, not middle of object\n\trectangle.getMoveable().setPos(glm::vec3(\n\t\t\t\trectOrigin.getX()-10,rectOrigin.getY()-10,rectOrigin.getZ()));\n\n\tGeometry::Circle circle;\n\tcircle.setLogicContext(&logicContext);\n\tcircle.setShaderLocations(vertShaderLocation);\n\tcircle.buildStatic();\n\n\n\tdrawQueue.push_back(&circle);\n\n\t\/\/\/ Do some simulation\n\t\n\t\/\/Enables antialiasing\n\tglEnable(GL_MULTISAMPLE);\n\n\twhile (!glfwWindowShouldClose(window)) {\n\t\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\t\tglPolygonMode(GL_FRONT, GL_FILL);\n\t\tglUniformMatrix4fv(uloc_project, 1, GL_FALSE, glm::value_ptr(VisualContext::projection_matrix));\n\n\t\tdynamicsWorld->stepSimulation(1.f \/ 60.f, 10);\n\n\t\t\/\/print positions of all objects\n\t\tfor (int j = dynamicsWorld->getNumCollisionObjects() - 1; j >= 0; j--)\n\t\t{\n\t\t\tbtCollisionObject* obj = dynamicsWorld->getCollisionObjectArray()[j];\n\t\t\tbtRigidBody* body = btRigidBody::upcast(obj);\n\t\t\tbtTransform trans;\n\t\t\tif (body && body->getMotionState())\n\t\t\t{\n\t\t\t\tbody->getMotionState()->getWorldTransform(trans);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\ttrans = obj->getWorldTransform();\n\t\t\t}\n\t\t\tprintf(\"world pos object %d = %f,%f,%f\\n\", j, float(trans.getOrigin().getX()), float(trans.getOrigin().getY()), float(trans.getOrigin().getZ()));\n\t\t}\n\t\tbtTransform sphereTrans;\n\t\tsphereBody->getMotionState()->getWorldTransform(sphereTrans);\n\t\tbtVector3& sphereOrigin = sphereTrans.getOrigin();\n\t\tcircle.getMoveable().setPos(glm::vec3(\n\t\t\t\t\tsphereOrigin.getX(),sphereOrigin.getY(),sphereOrigin.getZ()));\n\t\/\/\/-----stepsimulation_end-----\n\n\t\tfor(std::vector<Geometry::Polygon*>::iterator drawHost = drawQueue.begin();\n\t\t\t\tdrawHost != drawQueue.end();\n\t\t\t\tdrawHost++){\n\t\t\tglDisable(GL_CULL_FACE);\n\t\t\t\/**\n\t\t\t * TODO This is okay for now, however the logicContext will become\n\t\t\t * the shader from a shader manager\/factory \n\t\t\t * so each object should set it, itself.\n\t\t\t * (*drawHost)->setLogicContext(&logicContext);\n\t\t\t *\/\n\t\t\t(*drawHost)->setLogicContext(&logicContext);\n\n\t\t\t(*drawHost)->update();\n\t\t\t(*drawHost)->draw();\n\t\t}\n\n\t\tglfwSwapBuffers(window);\n\t\tglfwPollEvents();\n\t}\n\n\tMatrixStackSingleton::Destroy();\n\t\/\/cleanup in the reverse order of creation\/initialization\n\n\t\/\/\/-----cleanup_start-----\n\n\t\/\/remove the rigidbodies from the dynamics world and delete them\n\tfor (i = dynamicsWorld->getNumCollisionObjects() - 1; i >= 0; i--)\n\t{\n\t\tbtCollisionObject* obj = dynamicsWorld->getCollisionObjectArray()[i];\n\t\tbtRigidBody* body = btRigidBody::upcast(obj);\n\t\tif (body && body->getMotionState())\n\t\t{\n\t\t\tdelete body->getMotionState();\n\t\t}\n\t\tdynamicsWorld->removeCollisionObject(obj);\n\t\tdelete obj;\n\t}\n\n\t\/\/delete collision shapes\n\tfor (int j = 0; j < collisionShapes.size(); j++)\n\t{\n\t\tbtCollisionShape* shape = collisionShapes[j];\n\t\tcollisionShapes[j] = 0;\n\t\tdelete shape;\n\t}\n\n\t\/\/delete dynamics world\n\tdelete dynamicsWorld;\n\n\t\/\/delete solver\n\tdelete solver;\n\n\t\/\/delete broadphase\n\tdelete overlappingPairCache;\n\n\t\/\/delete dispatcher\n\tdelete dispatcher;\n\n\tdelete collisionConfiguration;\n\n\t\/\/next line is optional: it will be cleared by the destructor when the array goes out of scope\ncollisionShapes.clear();\t\n\n\tglfwDestroyWindow(window);\n\n\tglfwTerminate();\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include \"BlockChain.hpp\"\n\nusing namespace Eth;\n\n\nint main()\n{\n    Provider provider(\"ipc:\/\/home\/vic\/.ethereum\/geth.ipc\");\n    BlockChain blockchain(provider);\n\n    uint64_t id = blockchain.setNewFilter(\"0x580992b51e3925e23280efb93d3047c82f17e038\");\n    std::cout<<\"filter id \"<<id<<\"\\n\";\n    \n    Collection<TransactionEvent> events = blockchain.getEvents(id);\n    \n    std::cout<<\"events (\"<<events.size()<<\") : \\n\";\n    \n    for(Collection<TransactionEvent>::Iterator it = events.begin(), end= events.end(); it!= end; ++it)\n    {\n        std::cout<<\"type: \"<<it->getType()<<\", transaction \"<<it->getTransactionHash()<<\" (\"<<it->getTransactionIndex()<<\") \"<<\" block \"<<it->getBlockHash()<<\" (\"<<it->getBlockIndex()<<\") \\n\";\n    }\n\n    return 0;\n}\n\n<commit_msg>using FilterLog<commit_after>\n#include \"BlockChain.hpp\"\n\nusing namespace Eth;\n\n\nint main()\n{\n    Provider provider(\"ipc:\/\/home\/vic\/.ethereum\/geth.ipc\");\n    BlockChain blockchain(provider);\n\n    uint64_t id = blockchain.setNewFilter(\"0x1194e966965418c7d73a42cceeb254d875860356\", 1);\n    std::cout<<\"filter id \"<<id<<\"\\n\";\n\n    sleep(2);\n    Collection<FilterLog> events = blockchain.getFilterChanges(id);\n    \n    std::cout<<\"events (\"<<events.size()<<\") : \\n\";\n    \n    for(Collection<FilterLog>::Iterator it = events.begin(), end= events.end(); it!= end; ++it)\n    {\n        std::cout<<\"type: \"<<it->getType()<<\", transaction \"<<it->getTransactionHash()<<\" (\"<<it->getTransactionIndex()<<\") \"<<\" block \"<<it->getBlockHash()<<\" (\"<<it->getBlockIndex()<<\") \\n\";\n    }\n\n    return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\n\/\/\n\/\/ This source file is part of appleseed.\n\/\/ Visit http:\/\/appleseedhq.net\/ for additional information and resources.\n\/\/\n\/\/ This software is released under the MIT license.\n\/\/\n\/\/ Copyright (c) 2015 Esteban Tovagliari, 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\/\/ appleseed.renderer headers.\n#include \"renderer\/modeling\/bssrdf\/sss.h\"\n\n\/\/ appleseed.foundation headers.\n#include \"foundation\/math\/rng\/distribution.h\"\n#include \"foundation\/math\/rng\/mersennetwister.h\"\n#include \"foundation\/math\/fresnel.h\"\n#include \"foundation\/math\/scalar.h\"\n#include \"foundation\/utility\/gnuplotfile.h\"\n#include \"foundation\/utility\/string.h\"\n#include \"foundation\/utility\/test.h\"\n\n\/\/ Standard headers.\n#include <algorithm>\n#include <cstddef>\n#include <vector>\n\nusing namespace foundation;\nusing namespace renderer;\nusing namespace std;\n\nTEST_SUITE(Renderer_Modeling_BSSRDF_SSS)\n{\n    double rd_alpha_prime_roundtrip(\n        const double rd,\n        const double eta)\n    {\n        const double two_c1 = fresnel_moment_two_c1(eta);\n        const double three_c2 = fresnel_moment_three_c2(eta);\n\n        const double alpha_prime = compute_alpha_prime(rd, two_c1, three_c2);\n        return compute_rd(alpha_prime, two_c1, three_c2);\n    }\n\n    TEST_CASE(Rd_AlphaPrime_Roundtrip)\n    {\n        EXPECT_FEQ_EPS(0.0, rd_alpha_prime_roundtrip(0.0, 1.6), 0.001);\n        EXPECT_FEQ_EPS(0.1, rd_alpha_prime_roundtrip(0.1, 1.3), 0.001);\n        EXPECT_FEQ_EPS(0.2, rd_alpha_prime_roundtrip(0.2, 1.2), 0.001);\n        EXPECT_FEQ_EPS(0.4, rd_alpha_prime_roundtrip(0.4, 1.3), 0.001);\n        EXPECT_FEQ_EPS(0.6, rd_alpha_prime_roundtrip(0.6, 1.4), 0.001);\n        EXPECT_FEQ_EPS(0.8, rd_alpha_prime_roundtrip(0.8, 1.3), 0.001);\n        EXPECT_FEQ_EPS(1.0, rd_alpha_prime_roundtrip(1.0, 1.5), 0.001);\n    }\n\n    const double NormalizedDiffusionTestEps = 0.0001;\n\n    TEST_CASE(NormalizedDiffusionA)\n    {\n        static const double Result[] =\n        {\n            4.68592, 4.11466, 3.77984, 3.60498, 3.52856, 3.5041, 3.50008,\n            3.50002, 3.5024, 3.52074, 3.58352, 3.73426, 4.03144, 4.54858,\n            5.37416, 6.6117, 8.37968, 10.8116, 14.056, 18.2763, 23.6511\n        };\n\n        for (size_t i = 0, e = countof(Result); i < e; ++i)\n        {\n            const double s = normalized_diffusion_s(static_cast<double>(i) * 0.05);\n            EXPECT_FEQ_EPS(Result[i], s, NormalizedDiffusionTestEps);\n        }\n    }\n\n    TEST_CASE(NormalizedDiffusionR)\n    {\n        static const double Result[] =\n        {\n            2.53511, 0.674967, 0.327967, 0.192204, 0.124137, 0.0852575,\n            0.0611367, 0.0452741, 0.0343737, 0.0266197, 0.0209473, 0.0167009,\n            0.0134603, 0.0109471, 0.00897108, 0.00739936, 0.00613676, 0.00511384,\n            0.00427902, 0.0035934, 0.00302721\n        };\n\n        for (size_t i = 0, e = countof(Result); i < e; ++i)\n        {\n            const double r =\n                normalized_diffusion_r(\n                    static_cast<double>(i) * 0.1 + 0.05,\n                    1.0,\n                    3.583521,\n                    0.5);\n\n            EXPECT_FEQ_EPS(Result[i], r, NormalizedDiffusionTestEps);\n        }\n    }\n\n    TEST_CASE(NormalizedDiffusionCdf)\n    {\n        static const double Result[] =\n        {\n            0.282838, 0.598244, 0.760091, 0.85267, 0.908478, 0.942885, 0.964293,\n            0.97766, 0.98602, 0.99125, 0.994523, 0.996572, 0.997854, 0.998657,\n            0.999159, 0.999474, 0.999671, 0.999794, 0.999871, 0.999919, 0.999949,\n            0.999968, 0.99998, 0.999988, 0.999992, 0.999995, 0.999997, 0.999998,\n            0.999999, 0.999999, 1\n        };\n\n        for (size_t i = 0, e = countof(Result); i < e; ++i)\n        {\n            const double cdf =\n                normalized_diffusion_cdf(\n                    static_cast<double>(i) * 0.1 + 0.05,\n                    1.0,\n                    14.056001);\n\n            EXPECT_FEQ_EPS(Result[i], cdf, NormalizedDiffusionTestEps);\n        }\n    }\n\n    \/*\n    TEST_CASE(NormalizedDiffusionCdfPdf)\n    {\n        const double ndiff_step = 0.0001;\n\n        MersenneTwister rng;\n\n        for (size_t i = 0; i < 50; ++i)\n        {\n            const double a = rand_double1(rng);\n            const double l = rand_double1(rng, 0.0001, 10.0);\n            const double s = normalized_diffusion_s(a);\n            const double r = rand_double1(rng, 0.0001, 20.0);\n\n            const double pdf = normalized_diffusion_pdf(r, l, s);\n\n            const double pdf_ndiff =\n                (normalized_diffusion_cdf(r + ndiff_step, l, s) -\n                 normalized_diffusion_cdf(r, l, s)) \/ ndiff_step;\n\n            EXPECT_FEQ_EPS(pdf, pdf_ndiff, ndiff_step);\n        }\n    }\n    *\/\n\n    TEST_CASE(NormalizedDiffusionSample)\n    {\n        MersenneTwister rng;\n\n        for (size_t i = 0; i < 1000; ++i)\n        {\n            const double u = rand_double1(rng);\n            const double a = rand_double1(rng);\n            const double l = rand_double1(rng, 0.001, 10.0);\n            const double s = normalized_diffusion_s(a);\n            const double r = normalized_diffusion_sample(u, l, s);\n            EXPECT_FEQ_EPS(u, normalized_diffusion_cdf(r, l, s), NormalizedDiffusionTestEps);\n        }\n    }\n\n    TEST_CASE(PlotNormalizedDiffusionR)\n    {\n        GnuplotFile plotfile;\n        plotfile.set_title(\"Searchlight Configuration with dmfp Parameterization\");\n        plotfile.set_xlabel(\"r\");\n        plotfile.set_ylabel(\"r R(r)\");\n        plotfile.set_xrange(0.0, 8.0);\n        plotfile.set_yrange(0.001, 1.0);\n        plotfile.set_logscale_y();\n\n        for (size_t i = 9; i >= 1; --i)\n        {\n            const double a = static_cast<double>(i) \/ 10.0;\n            const double s = normalized_diffusion_s(a);\n\n            const size_t N = 1000;\n            vector<Vector2d> points;\n\n            for (size_t j = 0; j < N; ++j)\n            {\n                const double r = max(fit<size_t, double>(j, 0, N - 1, 0.0, 8.0), 0.0001);\n                const double y = r * normalized_diffusion_r(r, 1.0, s, a);\n                points.push_back(Vector2d(r, y));\n            }\n\n            static const char* Colors[9] =\n            {\n                \"gray\",\n                \"orange\",\n                \"black\",\n                \"brown\",\n                \"cyan\",\n                \"magenta\",\n                \"blue\",\n                \"green\",\n                \"red\"\n            };\n\n            plotfile\n                .new_plot()\n                .set_points(points)\n                .set_title(\"A = \" + to_string(a))\n                .set_color(Colors[i - 1]);\n        }\n\n        plotfile.write(\"unit tests\/outputs\/test_sss_normalized_diffusion_r.gnuplot\");\n    }\n}\n<commit_msg>minor code tweaks.<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) 2015 Esteban Tovagliari, 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\/\/ appleseed.renderer headers.\n#include \"renderer\/modeling\/bssrdf\/sss.h\"\n\n\/\/ appleseed.foundation headers.\n#include \"foundation\/math\/rng\/distribution.h\"\n#include \"foundation\/math\/rng\/mersennetwister.h\"\n#include \"foundation\/math\/fresnel.h\"\n#include \"foundation\/math\/scalar.h\"\n#include \"foundation\/utility\/gnuplotfile.h\"\n#include \"foundation\/utility\/string.h\"\n#include \"foundation\/utility\/test.h\"\n\n\/\/ Standard headers.\n#include <algorithm>\n#include <cstddef>\n#include <vector>\n\nusing namespace foundation;\nusing namespace renderer;\nusing namespace std;\n\nTEST_SUITE(Renderer_Modeling_BSSRDF_SSS)\n{\n    double rd_alpha_prime_roundtrip(\n        const double rd,\n        const double eta)\n    {\n        const double two_c1 = fresnel_moment_two_c1(eta);\n        const double three_c2 = fresnel_moment_three_c2(eta);\n\n        const double alpha_prime = compute_alpha_prime(rd, two_c1, three_c2);\n        return compute_rd(alpha_prime, two_c1, three_c2);\n    }\n\n    TEST_CASE(Rd_AlphaPrime_Roundtrip)\n    {\n        EXPECT_FEQ_EPS(0.0, rd_alpha_prime_roundtrip(0.0, 1.6), 0.001);\n        EXPECT_FEQ_EPS(0.1, rd_alpha_prime_roundtrip(0.1, 1.3), 0.001);\n        EXPECT_FEQ_EPS(0.2, rd_alpha_prime_roundtrip(0.2, 1.2), 0.001);\n        EXPECT_FEQ_EPS(0.4, rd_alpha_prime_roundtrip(0.4, 1.3), 0.001);\n        EXPECT_FEQ_EPS(0.6, rd_alpha_prime_roundtrip(0.6, 1.4), 0.001);\n        EXPECT_FEQ_EPS(0.8, rd_alpha_prime_roundtrip(0.8, 1.3), 0.001);\n        EXPECT_FEQ_EPS(1.0, rd_alpha_prime_roundtrip(1.0, 1.5), 0.001);\n    }\n\n    const double NormalizedDiffusionTestEps = 0.0001;\n\n    TEST_CASE(NormalizedDiffusionA)\n    {\n        static const double Expected[] =\n        {\n            4.68592, 4.11466, 3.77984, 3.60498, 3.52856, 3.5041, 3.50008,\n            3.50002, 3.5024, 3.52074, 3.58352, 3.73426, 4.03144, 4.54858,\n            5.37416, 6.6117, 8.37968, 10.8116, 14.056, 18.2763, 23.6511\n        };\n\n        for (size_t i = 0, e = countof(Expected); i < e; ++i)\n        {\n            const double s = normalized_diffusion_s(static_cast<double>(i) * 0.05);\n            EXPECT_FEQ_EPS(Expected[i], s, NormalizedDiffusionTestEps);\n        }\n    }\n\n    TEST_CASE(NormalizedDiffusionR)\n    {\n        static const double Expected[] =\n        {\n            2.53511, 0.674967, 0.327967, 0.192204, 0.124137, 0.0852575,\n            0.0611367, 0.0452741, 0.0343737, 0.0266197, 0.0209473, 0.0167009,\n            0.0134603, 0.0109471, 0.00897108, 0.00739936, 0.00613676, 0.00511384,\n            0.00427902, 0.0035934, 0.00302721\n        };\n\n        for (size_t i = 0, e = countof(Expected); i < e; ++i)\n        {\n            const double r =\n                normalized_diffusion_r(\n                    static_cast<double>(i) * 0.1 + 0.05,\n                    1.0,\n                    3.583521,\n                    0.5);\n\n            EXPECT_FEQ_EPS(Expected[i], r, NormalizedDiffusionTestEps);\n        }\n    }\n\n    TEST_CASE(NormalizedDiffusionCdf)\n    {\n        static const double Expected[] =\n        {\n            0.282838, 0.598244, 0.760091, 0.85267, 0.908478, 0.942885, 0.964293,\n            0.97766, 0.98602, 0.99125, 0.994523, 0.996572, 0.997854, 0.998657,\n            0.999159, 0.999474, 0.999671, 0.999794, 0.999871, 0.999919, 0.999949,\n            0.999968, 0.99998, 0.999988, 0.999992, 0.999995, 0.999997, 0.999998,\n            0.999999, 0.999999, 1\n        };\n\n        for (size_t i = 0, e = countof(Expected); i < e; ++i)\n        {\n            const double L = 1.0;           \/\/ mean free path\n            const double S = 14.056001;     \/\/ scaling factor s for A = 0.9\n\n            const double cdf =\n                normalized_diffusion_cdf(\n                    static_cast<double>(i) * 0.1 + 0.05,\n                    L,\n                    S);\n\n            EXPECT_FEQ_EPS(Expected[i], cdf, NormalizedDiffusionTestEps);\n        }\n    }\n\n    \/*\n    TEST_CASE(NormalizedDiffusionCdfPdf)\n    {\n        const double ndiff_step = 0.0001;\n\n        MersenneTwister rng;\n\n        for (size_t i = 0; i < 50; ++i)\n        {\n            const double a = rand_double1(rng);\n            const double l = rand_double1(rng, 0.0001, 10.0);\n            const double s = normalized_diffusion_s(a);\n            const double r = rand_double1(rng, 0.0001, 20.0);\n\n            const double pdf = normalized_diffusion_pdf(r, l, s);\n\n            const double pdf_ndiff =\n                (normalized_diffusion_cdf(r + ndiff_step, l, s) -\n                 normalized_diffusion_cdf(r, l, s)) \/ ndiff_step;\n\n            EXPECT_FEQ_EPS(pdf, pdf_ndiff, ndiff_step);\n        }\n    }\n    *\/\n\n    TEST_CASE(NormalizedDiffusionSample)\n    {\n        MersenneTwister rng;\n\n        for (size_t i = 0; i < 1000; ++i)\n        {\n            const double u = rand_double1(rng);\n            const double a = rand_double1(rng);\n            const double l = rand_double1(rng, 0.001, 10.0);\n            const double s = normalized_diffusion_s(a);\n            const double r = normalized_diffusion_sample(u, l, s);\n            EXPECT_FEQ_EPS(u, normalized_diffusion_cdf(r, l, s), NormalizedDiffusionTestEps);\n        }\n    }\n\n    TEST_CASE(PlotNormalizedDiffusionR)\n    {\n        GnuplotFile plotfile;\n        plotfile.set_title(\"Searchlight Configuration with dmfp Parameterization\");\n        plotfile.set_xlabel(\"r\");\n        plotfile.set_ylabel(\"r R(r)\");\n        plotfile.set_xrange(0.0, 8.0);\n        plotfile.set_yrange(0.001, 1.0);\n        plotfile.set_logscale_y();\n\n        for (size_t i = 9; i >= 1; --i)\n        {\n            const double a = static_cast<double>(i) \/ 10.0;\n            const double s = normalized_diffusion_s(a);\n\n            const size_t N = 1000;\n            vector<Vector2d> points;\n\n            for (size_t j = 0; j < N; ++j)\n            {\n                const double r = max(fit<size_t, double>(j, 0, N - 1, 0.0, 8.0), 0.0001);\n                const double y = r * normalized_diffusion_r(r, 1.0, s, a);\n                points.push_back(Vector2d(r, y));\n            }\n\n            static const char* Colors[9] =\n            {\n                \"gray\",\n                \"orange\",\n                \"black\",\n                \"brown\",\n                \"cyan\",\n                \"magenta\",\n                \"blue\",\n                \"green\",\n                \"red\"\n            };\n\n            plotfile\n                .new_plot()\n                .set_points(points)\n                .set_title(\"A = \" + to_string(a))\n                .set_color(Colors[i - 1]);\n        }\n\n        plotfile.write(\"unit tests\/outputs\/test_sss_normalized_diffusion_r.gnuplot\");\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <cilantro\/point_cloud.hpp>\n#include <cilantro\/image_viewer.hpp>\n#include <cilantro\/visualizer.hpp>\n#include <cilantro\/common_renderables.hpp>\n#include <cilantro\/icp_common_instances.hpp>\n\nvoid color_toggle_callback(cilantro::Visualizer &viz, cilantro::RenderingProperties &rp) {\n    if (rp.pointColor == cilantro::RenderingProperties::noColor) {\n        rp.setPointColor(0.8f, 0.8f, 0.8f);\n    } else {\n        rp.setPointColor(cilantro::RenderingProperties::noColor);\n    }\n    viz.setRenderingProperties(\"model\", rp);\n}\n\nvoid capture_callback(bool &capture) {\n    capture = true;\n}\n\nvoid clear_callback(cilantro::PointCloud3f &cloud) {\n    cloud.clear();\n}\n\nint main(int argc, char ** argv) {\n    \/\/ Intrinsics\n    Eigen::Matrix3f K;\n    K << 525, 0, 319.5, 0, 525, 239.5, 0, 0, 1;\n\n\/\/    std::string uri = \"files:\/\/[\/home\/kzampog\/Desktop\/rgbd_sequences\/dok_demo\/rgb_*.png,\/home\/kzampog\/Desktop\/rgbd_sequences\/dok_demo\/depth_*.png]\";\n    std::string uri = \"openni2:[img1=rgb,img2=depth_reg,coloursync=true,closerange=true,holefilter=true]\/\/\";\n\n    std::unique_ptr<pangolin::VideoInterface> dok = pangolin::OpenVideo(uri);\n    size_t w = 640, h = 480;\n    unsigned char* img = new unsigned char[dok->SizeBytes()];\n\n    pangolin::Image<unsigned char> rgb_img(img, w, h, 3*w*sizeof(unsigned char));\n    pangolin::Image<unsigned short> depth_img((unsigned short *)(img+3*w*h), w, h, w*sizeof(unsigned short));\n\n    std::string win_name = \"Fusion demo\";\n    pangolin::CreateWindowAndBind(win_name, 2*w, h);\n    pangolin::Display(\"multi\").SetBounds(0.0, 1.0, 0.0, 1.0).SetLayout(pangolin::LayoutEqual)\n            .AddDisplay(pangolin::Display(\"disp1\")).AddDisplay(pangolin::Display(\"disp2\"));\n\n    cilantro::Visualizer pcdv(win_name, \"disp1\");\n    cilantro::ImageViewer rgbv(win_name, \"disp2\");\n\n    cilantro::PointCloud3f model, frame;\n    bool capture = false;\n    pcdv.registerKeyboardCallback('a', std::bind(capture_callback, std::ref(capture)));\n    pcdv.registerKeyboardCallback('d', std::bind(clear_callback, std::ref(model)));\n\n    cilantro::RenderingProperties rp;\n    pcdv.registerKeyboardCallback('c', std::bind(color_toggle_callback, std::ref(pcdv), std::ref(rp)));\n    rp.setUseLighting(false);\n\n    cilantro::RigidTransformation3f cam_pose(cilantro::RigidTransformation3f::Identity());\n\n    float max_depth = 1.1f;\n    float fusion_weight = 0.1f;\n    float fusion_dist_thresh = 0.025f;\n    float factor = -0.5f\/(100*100);\n\n    cilantro::TruncatedDepthValueConverter<unsigned short,float> dc(1000.0f, max_depth);\n\n    if (argc < 2) std::cout << \"Note: no output PLY file path provided\" << std::endl;\n    std::cout << \"Highlight the left viewport and:\" << std::endl;\n    std::cout << \"\\tPress 'a' to initialize model\/fuse new view (keep pressed for continuous fusion)\" << std::endl;\n    std::cout << \"\\tPress 'd' to reinitialize process\" << std::endl;\n    std::cout << \"\\tPress 'c' to toggle model color\" << std::endl;\n    std::cout << \"\\tPress 'l' to toggle lighting\" << std::endl;\n\n    \/\/ Main loop\n    while (!pangolin::ShouldQuit()) {\n        dok->GrabNext(img, true);\n        frame.fromRGBDImages(rgb_img.ptr, depth_img.ptr, dc, w, h, K, false, true);\n\n        \/\/ Localize\n        if (!model.isEmpty()) {\n            cilantro::SimpleCombinedMetricRigidProjectiveICP3f icp(model.points, model.normals, frame.points);\n            icp.correspondenceSearchEngine().setProjectionExtrinsicMatrix(cam_pose).setMaxDistance(0.1f*0.1f);\n            icp.setInitialTransformation(cam_pose).setConvergenceTolerance(5e-4f);\n            icp.setMaxNumberOfIterations(6).setMaxNumberOfOptimizationStepIterations(1);\n            cam_pose = icp.estimateTransformation().getTransformation();\n        }\n\n        \/\/ Map\n        if (capture) {\n            capture = false;\n\n            if (model.isEmpty()) {\n                model = frame;\n                cam_pose.setIdentity();\n            } else {\n                cilantro::PointCloud3f frame_t(frame.transformed(cam_pose));\n                cilantro::PointCloud3f model_t(model.transformed(cam_pose.inverse()));\n\n                \/\/ Project cloud to index image maps\n                pangolin::ManagedImage<size_t> model_index_map(w, h);\n                cilantro::pointsToIndexMap<float>(model_t.points, K, model_index_map.ptr, w, h);\n                pangolin::ManagedImage<size_t> frame_index_map(w, h);\n                cilantro::pointsToIndexMap<float>(frame.points, K, frame_index_map.ptr, w, h);\n\n                cilantro::PointCloud3f to_append;\n                to_append.points.resize(Eigen::NoChange, w*h);\n                to_append.normals.resize(Eigen::NoChange, w*h);\n                to_append.colors.resize(Eigen::NoChange, w*h);\n\n                size_t append_count = 0;\n                std::vector<size_t> remove_ind;\n                remove_ind.reserve(w*h);\n                const size_t empty = std::numeric_limits<std::size_t>::max();\n\n                for (size_t y = 0; y < frame_index_map.h; y++) {\n                    for (size_t x = 0; x < frame_index_map.w; x++) {\n                        const size_t frame_pt_ind = frame_index_map(x,y);\n                        const size_t model_pt_ind = model_index_map(x,y);\n\n                        if (frame_pt_ind == empty) {\n                            \/\/ Nothing to do\n                            continue;\n                        }\n\n                        const float frame_depth = frame.points(2,frame_pt_ind);\n                        const float model_depth = (model_pt_ind != empty) ? model_t.points(2,model_pt_ind) : 0.0f;\n                        const float radial_weight = std::exp(factor*((x - K(0,2))*(x - K(0,2)) + (y - K(1,2))*(y - K(1,2))));\n\n                        if (model_pt_ind != empty && frame_depth > model_depth + fusion_dist_thresh) {\n                            \/\/ Remove points in free space\n                            remove_ind.emplace_back(model_pt_ind);\n                        }\n\n                        if (model_pt_ind == empty || frame_depth < model_depth - fusion_dist_thresh) {\n                            \/\/ Augment model\n                            if ((rand()%100)\/100.0f < radial_weight) {\n                                to_append.points.col(append_count) = frame_t.points.col(frame_pt_ind);\n                                to_append.normals.col(append_count) = frame_t.normals.col(frame_pt_ind);\n                                to_append.colors.col(append_count) = frame_t.colors.col(frame_pt_ind);\n                                append_count++;\n                            }\n                        }\n\n                        if (model_pt_ind != empty && std::abs(model_depth - frame_depth) < fusion_dist_thresh) {\n                            \/\/ Fuse\n                            const float weight = fusion_weight*radial_weight;\n                            const float weight_compl = 1.0f - weight;\n                            model.points.col(model_pt_ind) = weight_compl*model.points.col(model_pt_ind) + weight*frame_t.points.col(frame_pt_ind);\n                            model.normals.col(model_pt_ind) = (weight_compl*model.normals.col(model_pt_ind) + weight*frame_t.normals.col(frame_pt_ind)).normalized();\n                            model.colors.col(model_pt_ind) = weight_compl*model.colors.col(model_pt_ind) + weight*frame_t.colors.col(frame_pt_ind);\n                        }\n                    }\n                }\n                model.remove(remove_ind);\n                to_append.points.conservativeResize(Eigen::NoChange, append_count);\n                to_append.normals.conservativeResize(Eigen::NoChange, append_count);\n                to_append.colors.conservativeResize(Eigen::NoChange, append_count);\n                model.append(to_append);\n            }\n        }\n\n        \/\/ Visualization\n        rgbv.setImage(rgb_img.ptr, w, h, \"RGB24\");\n        pcdv.addObject<cilantro::PointCloudRenderable>(\"model\", model, rp);\n        pcdv.addObject<cilantro::CameraFrustumRenderable>(\"cam\", w, h, K, cam_pose.matrix(), 0.1f, cilantro::RenderingProperties().setLineWidth(2.0f).setLineColor(1.0f,1.0f,0.0f));\n\/\/        pcdv.addObject<cilantro::PointCloudRenderable>(\"frame\", frame.transformed(cam_pose), cilantro::RenderingProperties().setOpacity(0.2f).setPointColor(0.8f, 0.8f, 0.8f).setUseLighting(false));\n\/\/        pcdv.setCameraPose(cam_pose);\n\n        pcdv.clearRenderArea();\n        rgbv.render();\n        pcdv.render();\n        pangolin::FinishFrame();\n\n        \/\/ Keep model rendering properties on update\n        rp = pcdv.getRenderingProperties(\"model\");\n    }\n\n    if (argc > 1) model.toPLYFile(argv[1], true);\n\n    delete[] img;\n\n    return 0;\n}\n<commit_msg>Minor example updates<commit_after>#include <cilantro\/point_cloud.hpp>\n#include <cilantro\/image_viewer.hpp>\n#include <cilantro\/visualizer.hpp>\n#include <cilantro\/common_renderables.hpp>\n#include <cilantro\/icp_common_instances.hpp>\n\nvoid color_toggle_callback(cilantro::Visualizer &viz, cilantro::RenderingProperties &rp) {\n    if (rp.pointColor == cilantro::RenderingProperties::noColor) {\n        rp.setPointColor(0.8f, 0.8f, 0.8f);\n    } else {\n        rp.setPointColor(cilantro::RenderingProperties::noColor);\n    }\n    viz.setRenderingProperties(\"model\", rp);\n}\n\nvoid capture_callback(bool &capture) {\n    capture = true;\n}\n\nvoid clear_callback(cilantro::PointCloud3f &cloud) {\n    cloud.clear();\n}\n\nint main(int argc, char ** argv) {\n    \/\/ Intrinsics\n    Eigen::Matrix3f K;\n    K << 525, 0, 319.5, 0, 525, 239.5, 0, 0, 1;\n\n\/\/    std::string uri = \"files:\/\/[\/home\/kzampog\/Desktop\/rgbd_sequences\/dok_demo\/rgb_*.png,\/home\/kzampog\/Desktop\/rgbd_sequences\/dok_demo\/depth_*.png]\";\n    std::string uri = \"openni2:[img1=rgb,img2=depth_reg,coloursync=true,closerange=true,holefilter=true]\/\/\";\n\n    std::unique_ptr<pangolin::VideoInterface> dok = pangolin::OpenVideo(uri);\n    size_t w = 640, h = 480;\n    unsigned char* img = new unsigned char[dok->SizeBytes()];\n\n    pangolin::Image<unsigned char> rgb_img(img, w, h, 3*w*sizeof(unsigned char));\n    pangolin::Image<unsigned short> depth_img((unsigned short *)(img+3*w*h), w, h, w*sizeof(unsigned short));\n\n    std::string win_name = \"Fusion demo\";\n    pangolin::CreateWindowAndBind(win_name, 2*w, h);\n    pangolin::Display(\"multi\").SetBounds(0.0, 1.0, 0.0, 1.0).SetLayout(pangolin::LayoutEqual)\n            .AddDisplay(pangolin::Display(\"disp1\")).AddDisplay(pangolin::Display(\"disp2\"));\n\n    cilantro::Visualizer pcdv(win_name, \"disp1\");\n    cilantro::ImageViewer rgbv(win_name, \"disp2\");\n\n    cilantro::PointCloud3f model, frame;\n    bool capture = false;\n    pcdv.registerKeyboardCallback('a', std::bind(capture_callback, std::ref(capture)));\n    pcdv.registerKeyboardCallback('d', std::bind(clear_callback, std::ref(model)));\n\n    cilantro::RenderingProperties rp;\n    pcdv.registerKeyboardCallback('c', std::bind(color_toggle_callback, std::ref(pcdv), std::ref(rp)));\n    rp.setUseLighting(false);\n\n    cilantro::RigidTransformation3f cam_pose(cilantro::RigidTransformation3f::Identity());\n\n    float max_depth = 1.1f;\n    float fusion_weight = 0.1f;\n    float fusion_dist_thresh = 0.025f;\n    float factor = -0.5f\/(120*120);\n\n    cilantro::TruncatedDepthValueConverter<unsigned short,float> dc(1000.0f, max_depth);\n\n    if (argc < 2) std::cout << \"Note: no output PLY file path provided\" << std::endl;\n    std::cout << \"Highlight the left viewport and:\" << std::endl;\n    std::cout << \"\\tPress 'a' to initialize model\/fuse new view (keep pressed for continuous fusion)\" << std::endl;\n    std::cout << \"\\tPress 'd' to reinitialize process\" << std::endl;\n    std::cout << \"\\tPress 'c' to toggle model color\" << std::endl;\n    std::cout << \"\\tPress 'l' to toggle lighting\" << std::endl;\n\n    \/\/ Main loop\n    while (!pangolin::ShouldQuit()) {\n        dok->GrabNext(img, true);\n        frame.fromRGBDImages(rgb_img.ptr, depth_img.ptr, dc, w, h, K, false, true);\n\n        \/\/ Localize\n        if (!model.isEmpty()) {\n            cilantro::SimpleCombinedMetricRigidProjectiveICP3f icp(model.points, model.normals, frame.points);\n            icp.correspondenceSearchEngine().setProjectionExtrinsicMatrix(cam_pose).setMaxDistance(0.1f*0.1f);\n            icp.setInitialTransformation(cam_pose).setConvergenceTolerance(5e-4f);\n            icp.setMaxNumberOfIterations(6).setMaxNumberOfOptimizationStepIterations(1);\n            cam_pose = icp.estimateTransformation().getTransformation();\n        } else {\n            cam_pose.setIdentity();\n        }\n\n        \/\/ Map\n        if (capture) {\n            capture = false;\n\n            cilantro::PointCloud3f frame_t(frame.transformed(cam_pose));\n            cilantro::PointCloud3f model_t(model.transformed(cam_pose.inverse()));\n\n            \/\/ Project cloud to index image maps\n            pangolin::ManagedImage<size_t> model_index_map(w, h);\n            cilantro::pointsToIndexMap<float>(model_t.points, K, model_index_map.ptr, w, h);\n            pangolin::ManagedImage<size_t> frame_index_map(w, h);\n            cilantro::pointsToIndexMap<float>(frame.points, K, frame_index_map.ptr, w, h);\n\n            cilantro::PointCloud3f to_append;\n            to_append.points.resize(Eigen::NoChange, w*h);\n            to_append.normals.resize(Eigen::NoChange, w*h);\n            to_append.colors.resize(Eigen::NoChange, w*h);\n\n            size_t append_count = 0;\n            std::vector<size_t> remove_ind;\n            remove_ind.reserve(w*h);\n            const size_t empty = std::numeric_limits<std::size_t>::max();\n\n            for (size_t y = 0; y < frame_index_map.h; y++) {\n                for (size_t x = 0; x < frame_index_map.w; x++) {\n                    const size_t frame_pt_ind = frame_index_map(x,y);\n                    const size_t model_pt_ind = model_index_map(x,y);\n\n                    if (frame_pt_ind == empty) {\n                        \/\/ Nothing to do\n                        continue;\n                    }\n\n                    const float frame_depth = frame.points(2,frame_pt_ind);\n                    const float model_depth = (model_pt_ind != empty) ? model_t.points(2,model_pt_ind) : 0.0f;\n                    const float radial_weight = std::exp(factor*((x - K(0,2))*(x - K(0,2)) + (y - K(1,2))*(y - K(1,2))));\n\n                    if (model_pt_ind != empty && frame_depth > model_depth + fusion_dist_thresh) {\n                        \/\/ Remove points in free space\n                        remove_ind.emplace_back(model_pt_ind);\n                    }\n\n                    if (model_pt_ind == empty || frame_depth < model_depth - fusion_dist_thresh) {\n                        \/\/ Augment model\n                        if ((rand()%100)\/100.0f < radial_weight) {\n                            to_append.points.col(append_count) = frame_t.points.col(frame_pt_ind);\n                            to_append.normals.col(append_count) = frame_t.normals.col(frame_pt_ind);\n                            to_append.colors.col(append_count) = frame_t.colors.col(frame_pt_ind);\n                            append_count++;\n                        }\n                    }\n\n                    if (model_pt_ind != empty && std::abs(model_depth - frame_depth) < fusion_dist_thresh) {\n                        \/\/ Fuse\n                        const float weight = fusion_weight*radial_weight;\n                        const float weight_compl = 1.0f - weight;\n                        model.points.col(model_pt_ind) = weight_compl*model.points.col(model_pt_ind) + weight*frame_t.points.col(frame_pt_ind);\n                        model.normals.col(model_pt_ind) = (weight_compl*model.normals.col(model_pt_ind) + weight*frame_t.normals.col(frame_pt_ind)).normalized();\n                        model.colors.col(model_pt_ind) = weight_compl*model.colors.col(model_pt_ind) + weight*frame_t.colors.col(frame_pt_ind);\n                    }\n                }\n            }\n            model.remove(remove_ind);\n            to_append.points.conservativeResize(Eigen::NoChange, append_count);\n            to_append.normals.conservativeResize(Eigen::NoChange, append_count);\n            to_append.colors.conservativeResize(Eigen::NoChange, append_count);\n            model.append(to_append);\n        }\n\n        \/\/ Visualization\n        rgbv.setImage(rgb_img.ptr, w, h, \"RGB24\");\n        pcdv.addObject<cilantro::PointCloudRenderable>(\"model\", model, rp);\n        pcdv.addObject<cilantro::CameraFrustumRenderable>(\"cam\", w, h, K, cam_pose.matrix(), 0.1f, cilantro::RenderingProperties().setLineWidth(2.0f).setLineColor(1.0f,1.0f,0.0f));\n\/\/        pcdv.addObject<cilantro::PointCloudRenderable>(\"frame\", frame.transformed(cam_pose), cilantro::RenderingProperties().setOpacity(0.2f).setPointColor(0.8f, 0.8f, 0.8f).setUseLighting(false));\n\/\/        pcdv.setCameraPose(cam_pose);\n\n        pcdv.clearRenderArea();\n        rgbv.render();\n        pcdv.render();\n        pangolin::FinishFrame();\n\n        \/\/ Keep model rendering properties on update\n        rp = pcdv.getRenderingProperties(\"model\");\n    }\n\n    if (argc > 1) {\n        std::cout << \"Saving model to \\'\" << argv[1] << \"\\'\" << std::endl;\n        model.toPLYFile(argv[1], true);\n    }\n\n    delete[] img;\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/***********************************************************************\n resetdb.cpp - (Re)initializes the example database, mysql_cpp_data.\n \tYou must run this at least once before running most of the other\n\texamples, and it is helpful sometimes to run it again, as some of\n\tthe examples modify the table in this database.\n\n Copyright (c) 1998 by Kevin Atkinson, (c) 1999, 2000 and 2001 by\n MySQL AB, and (c) 2004, 2005 by Educational Technology Resources, Inc.\n Others may also hold copyrights on code in this file.  See the CREDITS\n file 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 \"util.h\"\n\n#include <mysql++.h>\n\n#include <iostream>\n\nusing namespace std;\n\nint\nmain(int argc, char *argv[])\n{\n\t\/\/ Ensure that we're not mixing library and header file versions.\n\t\/\/ This is really easy to do if you have MySQL++ on your system and\n\t\/\/ are trying to build a new version, and run the examples directly\n\t\/\/ instead of through exrun.\n\tif (mysqlpp::get_library_version() != MYSQLPP_HEADER_VERSION) {\n\t\tcerr << \"Library\/header version number mismatch.  Are you\" << endl;\n\t\tcerr << \"using exrun to run this?  See README.examples.\" << endl;\n\t\treturn 1;\n\t}\n\t\n\t\/\/ Connect to database server\n\tmysqlpp::Connection con;\n\ttry {\n\t\tcout << \"Connecting to database server...\" << endl;\n\t\tif (!connect_to_db(argc, argv, con, \"\")) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\tcatch (exception& er) {\n\t\tcerr << \"Connection failed: \" << er.what() << endl;\n\t\treturn 1;\n\t}\n\t\n\t\/\/ Create new sample database, or re-create it.  We suppress\n\t\/\/ exceptions, because it's not an error if DB doesn't yet exist.\n\tbool new_db = false;\n\t{\n\t\tmysqlpp::NoExceptions ne(con);\n\t\tmysqlpp::Query query = con.query();\n\t\tif (con.select_db(kpcSampleDatabase)) {\n\t\t\t\/\/ Toss old table, if it exists.  If it doesn't, we don't\n\t\t\t\/\/ really care, as it'll get created next.\n\t\t\tcout << \"Dropping existing sample data tables...\" << endl;\n\t\t\tquery.execute(\"drop table stock\");\n\t\t\tquery.execute(\"drop table images\");\n\t\t}\n\t\telse {\n\t\t\t\/\/ Database doesn't exist yet, so create and select it.\n\t\t\tif (con.create_db(kpcSampleDatabase) &&\n\t\t\t\t\tcon.select_db(kpcSampleDatabase)) {\n\t\t\t\tnew_db = true;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcerr << \"Error creating DB: \" << con.error() << endl;\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ Create sample data table within sample database.\n\ttry {\n\t\t\/\/ Send the query to create the stock table and execute it.\n\t\tcout << \"Creating stock table...\" << endl;\n\t\tmysqlpp::Query query = con.query();\n\t\tquery << \n\t\t\t\t\"CREATE TABLE stock (\" <<\n\t\t\t\t\"  item CHAR(20) NOT NULL, \" <<\n\t\t\t\t\"  num BIGINT, \" <<\n\t\t\t\t\"  weight DOUBLE, \" <<\n\t\t\t\t\"  price DOUBLE, \" <<\n\t\t\t\t\"  sdate DATE) \" <<\n\t\t\t\t\"ENGINE = InnoDB \" <<\n\t\t\t\t\"CHARACTER SET utf8 COLLATE utf8_general_ci\";\n\t\tquery.execute();\n\n\t\t\/\/ Set up the template query to insert the data.  The parse()\n\t\t\/\/ call tells the query object that this is a template and\n\t\t\/\/ not a literal query string.\n\t\tquery << \"insert into %5:table values (%0q, %1q, %2, %3, %4q)\";\n\t\tquery.parse();\n\n\t\t\/\/ Set the template query parameter \"table\" to \"stock\".\n\t\tquery.def[\"table\"] = \"stock\";\n\n\t\t\/\/ Notice that we don't give a sixth parameter in these calls,\n\t\t\/\/ so the default value of \"stock\" is used.  Also notice that\n\t\t\/\/ the first row is a UTF-8 encoded Unicode string!  All you\n\t\t\/\/ have to do to store Unicode data in recent versions of MySQL\n\t\t\/\/ is use UTF-8 encoding.\n\t\tcout << \"Populating stock table...\" << endl;\n\t\tquery.execute(\"Nürnberger Brats\", 92, 1.5, 8.79, \"2005-03-10\");\n\t\tquery.execute(\"Pickle Relish\", 87, 1.5, 1.75, \"1998-09-04\");\n\t\tquery.execute(\"Hot Mustard\", 75, .95, .97, \"1998-05-25\");\n\t\tquery.execute(\"Hotdog Buns\", 65, 1.1, 1.1, \"1998-04-23\");\n\n\t\t\/\/ Now create empty images table, for testing BLOB and auto-\n\t\t\/\/ increment column features.\n\t\tcout << \"Creating empty images table...\" << endl;\n\t\tquery.reset();\n\t\tquery << \n\t\t\t\t\"CREATE TABLE images (\" <<\n\t\t\t\t\"  id INT UNSIGNED NOT NULL AUTO_INCREMENT, \" <<\n\t\t\t\t\"  data BLOB, \" <<\n\t\t\t\t\"  PRIMARY KEY (id)\" <<\n\t\t\t\t\")\";\n\t\tquery.execute();\n\n\t\t\/\/ Report success\n\t\tcout << (new_db ? \"Created\" : \"Reinitialized\") <<\n\t\t\t\t\" sample database successfully.\" << endl;\n\t}\n\tcatch (const mysqlpp::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 mysqlpp::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 mysqlpp::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>More explicit message from resetdb when you accidentally mix library and version numbers.<commit_after>\/***********************************************************************\n resetdb.cpp - (Re)initializes the example database, mysql_cpp_data.\n \tYou must run this at least once before running most of the other\n\texamples, and it is helpful sometimes to run it again, as some of\n\tthe examples modify the table in this database.\n\n Copyright (c) 1998 by Kevin Atkinson, (c) 1999, 2000 and 2001 by\n MySQL AB, and (c) 2004, 2005 by Educational Technology Resources, Inc.\n Others may also hold copyrights on code in this file.  See the CREDITS\n file 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 \"util.h\"\n\n#include <mysql++.h>\n\n#include <iostream>\n\nusing namespace std;\n\n\/\/ Convert a packed version number in the format used within MySQL++\n\/\/ to a printable string.\nstatic string\nversion_str(int packed)\n{\n\tchar buf[9];\n\tsnprintf(buf, sizeof(buf), \"%d.%d.%d\",\n\t\t\t(packed & 0xFF0000) >> 16,\n\t\t\t(packed & 0x00FF00) >> 8,\n\t\t\t(packed & 0x0000FF));\n\treturn buf;\n}\n\n\nint\nmain(int argc, char *argv[])\n{\n\t\/\/ Ensure that we're not mixing library and header file versions.\n\t\/\/ This is really easy to do if you have MySQL++ on your system and\n\t\/\/ are trying to build a new version, and run the examples directly\n\t\/\/ instead of through exrun.\n\tif (mysqlpp::get_library_version() != MYSQLPP_HEADER_VERSION) {\n\t\tcerr << \"Version mismatch: library is v\" <<\n\t\t\t\tversion_str(mysqlpp::get_library_version()) <<\n\t\t\t\t\", headers are v\" <<\n\t\t\t\tversion_str(MYSQLPP_HEADER_VERSION) <<\n\t\t\t\t\".  Are you running this\" << endl <<\n\t\t\t\t\"with exrun?  See README.examples.\" << endl;\n\t\treturn 1;\n\t}\n\t\n\t\/\/ Connect to database server\n\tmysqlpp::Connection con;\n\ttry {\n\t\tcout << \"Connecting to database server...\" << endl;\n\t\tif (!connect_to_db(argc, argv, con, \"\")) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\tcatch (exception& er) {\n\t\tcerr << \"Connection failed: \" << er.what() << endl;\n\t\treturn 1;\n\t}\n\t\n\t\/\/ Create new sample database, or re-create it.  We suppress\n\t\/\/ exceptions, because it's not an error if DB doesn't yet exist.\n\tbool new_db = false;\n\t{\n\t\tmysqlpp::NoExceptions ne(con);\n\t\tmysqlpp::Query query = con.query();\n\t\tif (con.select_db(kpcSampleDatabase)) {\n\t\t\t\/\/ Toss old table, if it exists.  If it doesn't, we don't\n\t\t\t\/\/ really care, as it'll get created next.\n\t\t\tcout << \"Dropping existing sample data tables...\" << endl;\n\t\t\tquery.execute(\"drop table stock\");\n\t\t\tquery.execute(\"drop table images\");\n\t\t}\n\t\telse {\n\t\t\t\/\/ Database doesn't exist yet, so create and select it.\n\t\t\tif (con.create_db(kpcSampleDatabase) &&\n\t\t\t\t\tcon.select_db(kpcSampleDatabase)) {\n\t\t\t\tnew_db = true;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcerr << \"Error creating DB: \" << con.error() << endl;\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ Create sample data table within sample database.\n\ttry {\n\t\t\/\/ Send the query to create the stock table and execute it.\n\t\tcout << \"Creating stock table...\" << endl;\n\t\tmysqlpp::Query query = con.query();\n\t\tquery << \n\t\t\t\t\"CREATE TABLE stock (\" <<\n\t\t\t\t\"  item CHAR(20) NOT NULL, \" <<\n\t\t\t\t\"  num BIGINT, \" <<\n\t\t\t\t\"  weight DOUBLE, \" <<\n\t\t\t\t\"  price DOUBLE, \" <<\n\t\t\t\t\"  sdate DATE) \" <<\n\t\t\t\t\"ENGINE = InnoDB \" <<\n\t\t\t\t\"CHARACTER SET utf8 COLLATE utf8_general_ci\";\n\t\tquery.execute();\n\n\t\t\/\/ Set up the template query to insert the data.  The parse()\n\t\t\/\/ call tells the query object that this is a template and\n\t\t\/\/ not a literal query string.\n\t\tquery << \"insert into %5:table values (%0q, %1q, %2, %3, %4q)\";\n\t\tquery.parse();\n\n\t\t\/\/ Set the template query parameter \"table\" to \"stock\".\n\t\tquery.def[\"table\"] = \"stock\";\n\n\t\t\/\/ Notice that we don't give a sixth parameter in these calls,\n\t\t\/\/ so the default value of \"stock\" is used.  Also notice that\n\t\t\/\/ the first row is a UTF-8 encoded Unicode string!  All you\n\t\t\/\/ have to do to store Unicode data in recent versions of MySQL\n\t\t\/\/ is use UTF-8 encoding.\n\t\tcout << \"Populating stock table...\" << endl;\n\t\tquery.execute(\"Nürnberger Brats\", 92, 1.5, 8.79, \"2005-03-10\");\n\t\tquery.execute(\"Pickle Relish\", 87, 1.5, 1.75, \"1998-09-04\");\n\t\tquery.execute(\"Hot Mustard\", 75, .95, .97, \"1998-05-25\");\n\t\tquery.execute(\"Hotdog Buns\", 65, 1.1, 1.1, \"1998-04-23\");\n\n\t\t\/\/ Now create empty images table, for testing BLOB and auto-\n\t\t\/\/ increment column features.\n\t\tcout << \"Creating empty images table...\" << endl;\n\t\tquery.reset();\n\t\tquery << \n\t\t\t\t\"CREATE TABLE images (\" <<\n\t\t\t\t\"  id INT UNSIGNED NOT NULL AUTO_INCREMENT, \" <<\n\t\t\t\t\"  data BLOB, \" <<\n\t\t\t\t\"  PRIMARY KEY (id)\" <<\n\t\t\t\t\")\";\n\t\tquery.execute();\n\n\t\t\/\/ Report success\n\t\tcout << (new_db ? \"Created\" : \"Reinitialized\") <<\n\t\t\t\t\" sample database successfully.\" << endl;\n\t}\n\tcatch (const mysqlpp::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 mysqlpp::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 mysqlpp::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>\/* Rapicorn Examples\n * Copyright (C) 2006 Tim Janik\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n * Lesser General Public License for more details.\n *\n * A copy of the GNU Lesser General Public License should ship along\n * with this library; if not, see http:\/\/www.gnu.org\/copyleft\/.\n *\/\n#include <rapicorn.hh>\n\nnamespace {\nusing namespace Rapicorn;\n\nstatic void\nadd_button_row (ContainerH area, uint row)\n{\n  ItemH child = area.create_child (\"RapicornExamples:button-row\", Strings (\"id=row#\" + string_from_uint (row)));\n  ContainerH brow = ContainerH::downcast (child);\n  for (uint i = 0; i < 50; i++)\n    {\n      Strings args = Strings (\"test-button-text=\\\"(\" + string_from_uint (row) + \",\" + string_from_uint (i) + \")\\\"\");\n      child = brow.create_child (\"RapicornExamples:test-button\", args);\n      ButtonAreaH button = child.component<ButtonAreaH> (\".Button\");\n      button.on_click (string_printf (\"Item::print('Button-Click: (%d,%d)')\", row, i));\n    }\n}\n\nextern \"C\" int\nmain (int   argc,\n      char *argv[])\n{\n  \/\/ initialize Rapicorn\n  ApplicationH app = init_app (__SOURCE_COMPONENT__, &argc, argv);\n\n  \/\/ find and load GUI definitions relative to argv[0]\n  app.auto_load (\"RapicornExamples\", \"scroller.xml\", argv[0]);\n\n  \/\/ create main window\n  WindowH window = app.create_window (\"RapicornExamples:main-shell\");\n\n  \/\/ create button rows\n  ContainerH mshell = window;\n  for (uint i = 0; i < 50; i++)\n    add_button_row (mshell, i);\n\n  \/\/ show main window\n  window.show();\n\n  \/\/ run event loops while windows are on screen\n  return app.run_and_exit();\n}\n\n} \/\/ anon\n<commit_msg>EXAMPLES: license cleanups<commit_after>\/\/ Licensed GNU LGPL v3 or later: http:\/\/www.gnu.org\/licenses\/lgpl.html\n#include <rapicorn.hh>\n\nnamespace {\nusing namespace Rapicorn;\n\nstatic void\nadd_button_row (ContainerH area, uint row)\n{\n  ItemH child = area.create_child (\"RapicornExamples:button-row\", Strings (\"id=row#\" + string_from_uint (row)));\n  ContainerH brow = ContainerH::downcast (child);\n  for (uint i = 0; i < 50; i++)\n    {\n      Strings args = Strings (\"test-button-text=\\\"(\" + string_from_uint (row) + \",\" + string_from_uint (i) + \")\\\"\");\n      child = brow.create_child (\"RapicornExamples:test-button\", args);\n      ButtonAreaH button = child.component<ButtonAreaH> (\".Button\");\n      button.on_click (string_printf (\"Item::print('Button-Click: (%d,%d)')\", row, i));\n    }\n}\n\nextern \"C\" int\nmain (int   argc,\n      char *argv[])\n{\n  \/\/ initialize Rapicorn\n  ApplicationH app = init_app (__SOURCE_COMPONENT__, &argc, argv);\n\n  \/\/ find and load GUI definitions relative to argv[0]\n  app.auto_load (\"RapicornExamples\", \"scroller.xml\", argv[0]);\n\n  \/\/ create main window\n  WindowH window = app.create_window (\"RapicornExamples:main-shell\");\n\n  \/\/ create button rows\n  ContainerH mshell = window;\n  for (uint i = 0; i < 50; i++)\n    add_button_row (mshell, i);\n\n  \/\/ show main window\n  window.show();\n\n  \/\/ run event loops while windows are on screen\n  return app.run_and_exit();\n}\n\n} \/\/ anon\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * HMC_SST_TRACE.CC\n *\n * Implementation file for the SST trace handlers\n *\n *\/\n\n#ifdef SST_ENABLE_STAT\n\n#include \"hmc_sst_trace.h\"\n#include \"hmc_sim.h\"\n\n\/\/ force the use of the SST namespace\nusing namespace SST;\n\n\/* ----------------------------------------------------- HMCSIM_SST_REGISTER_THERMAL *\/\nstatic void hmcsim_sst_register_thermal(){\n  LinkPhyTherm = registerStatistic<uint64_t>(\"LinkPhyTherm\");\n  LinkLocalRouteTherm = registerStatistic<uint64_t>(\"LinkLocalRouteTherm\");\n  LinkRemoteRouteTherm = registerStatistic<uint64_t>(\"LinkRemoteRouteTherm\");\n  XbarRqstSlotTherm = registerStatistic<uint64_t>(\"XbarRqstSlotTherm\");\n  XbarRspSlotTherm = registerStatistic<uint64_t>(\"XbarRspSlotTherm\");\n  XbarRouteExternTherm = registerStatistic<uint64_t>(\"XbarRouteExternTherm\");\n  VaultRqstSlotTherm = registerStatistic<uint64_t>(\"VaultRqstSlotTherm\");\n  VaultRspSlotTherm = registerStatistic<uint64_t>(\"VaultRspSlotTherm\");\n  VaultCtrlTherm = registerStatistic<uint64_t>(\"VaultCtrlTherm\");\n  RowAccessTherm = registerStatistic<uint64_t>(\"RowAccessTherm\");\n}\n\n\/* ----------------------------------------------------- HMCSIM_SST_REGISTER_POWER *\/\nstatic void hmcsim_sst_register_power(){\n  LinkPhyPower = registerStatistic<uint64_t>(\"LinkPhyPower\");\n  LinkLocalRoutePower = registerStatistic<uint64_t>(\"LinkLocalRoutePower\");\n  LinkRemoteRoutePower = registerStatistic<uint64_t>(\"LinkRemoteRoutePower\");\n  XbarRqstSlotPower = registerStatistic<uint64_t>(\"XbarRqstSlotPower\");\n  XbarRspSlotPower = registerStatistic<uint64_t>(\"XbarRspSlotPower\");\n  XbarRouteExternPower = registerStatistic<uint64_t>(\"XbarRouteExternPower\");\n  VaultRqstSlotPower = registerStatistic<uint64_t>(\"VaultRqstSlotPower\");\n  VaultRspSlotPower = registerStatistic<uint64_t>(\"VaultRspSlotPower\");\n  VaultCtrlPower = registerStatistic<uint64_t>(\"VaultCtrlPower\");\n  RowAccessPower = registerStatistic<uint64_t>(\"RowAccessPower\");\n}\n\n\/* ----------------------------------------------------- HMCSIM_SST_REGISTER_MISC *\/\nstatic void hmcsim_sst_register_misc(){\n  BankConflict = registerStatistic<uint64_t>(\"BankConflict\");\n  XbarLatency = registerStatistic<uint64_t>(\"XbarLatency\");\n}\n\n\/* ----------------------------------------------------- HMCSIM_SST_REGISTER_STALLS *\/\nstatic void hmcsim_sst_register_stalls(){\n  XbarRqstStall = registerStatistic<uint64_t>(\"XbarRqstStall\");\n  VaultRqstStall = registerStatistic<uint64_t>(\"VaultRqstStall\");\n  XbarRspStall = registerStatistic<uint64_t>(\"XbarRspStall\");\n  RouteRqstStall = registerStatistic<uint64_t>(\"RouteRqstStall\");\n  RouteRspStall = registerStatistic<uint64_t>(\"RouteRspStall\");\n  UndefStall = registerStatistic<uint64_t>(\"UndefStall\");\n}\n\n\/* ----------------------------------------------------- HMCSIM_SST_REGISTER_PACKETS *\/\nstatic void hmcsim_sst_register_packets(){\n  Write16Ops = registerStatistic<uint64_t>(\"WR16\");\n  Write32Ops = registerStatistic<uint64_t>(\"WR32\");\n  Write48Ops = registerStatistic<uint64_t>(\"WR48\");\n  Write64Ops = registerStatistic<uint64_t>(\"WR64\");\n  Write80Ops = registerStatistic<uint64_t>(\"WR80\");\n  Write96Ops = registerStatistic<uint64_t>(\"WR96\");\n  Write112Ops = registerStatistic<uint64_t>(\"WR112\");\n  Write128Ops = registerStatistic<uint64_t>(\"WR128\");\n  Write256Ops = registerStatistic<uint64_t>(\"WR256\");\n  Read16Ops = registerStatistic<uint64_t>(\"RD16\");\n  Read32Ops = registerStatistic<uint64_t>(\"RD32\");\n  Read48Ops = registerStatistic<uint64_t>(\"RD48\");\n  Read64Ops = registerStatistic<uint64_t>(\"RD64\");\n  Read80Ops = registerStatistic<uint64_t>(\"RD80\");\n  Read96Ops = registerStatistic<uint64_t>(\"RD96\");\n  Read112Ops = registerStatistic<uint64_t>(\"RD112\");\n  Read128Ops = registerStatistic<uint64_t>(\"RD128\");\n  Read256Ops = registerStatistic<uint64_t>(\"RD256\");\n  ModeWriteOps = registerStatistic<uint64_t>(\"MD_WR\");\n  ModeReadOps = registerStatistic<uint64_t>(\"MD_RD\");\n  BWROps = registerStatistic<uint64_t>(\"BWR\");\n  TwoAdd8Ops = registerStatistic<uint64_t>(\"2ADD8\");\n  Add16Ops = registerStatistic<uint64_t>(\"ADD16\");\n  PWrite16Ops = registerStatistic<uint64_t>(\"P_WR16\");\n  PWrite32Ops = registerStatistic<uint64_t>(\"P_WR32\");\n  PWrite48Ops = registerStatistic<uint64_t>(\"P_WR48\");\n  PWrite64Ops = registerStatistic<uint64_t>(\"P_WR64\");\n  PWrite80Ops = registerStatistic<uint64_t>(\"P_WR80\");\n  PWrite96Ops = registerStatistic<uint64_t>(\"P_WR96\");\n  PWrite112Ops = registerStatistic<uint64_t>(\"P_WR112\");\n  PWrite128Ops = registerStatistic<uint64_t>(\"P_128\");\n  PWrite256Ops = registerStatistic<uint64_t>(\"P_256\");\n  TwoAddS8ROps = registerStatistic<uint64_t>(\"2ADDS8R\");\n  AddS16ROps = registerStatistic<uint64_t>(\"ADDS16\");\n  Inc8Ops = registerStatistic<uint64_t>(\"INC8\");\n  PInc8Ops = registerStatistic<uint64_t>(\"P_INC8\");\n  Xor16Ops = registerStatistic<uint64_t>(\"XOR16\");\n  Or16Ops = registerStatistic<uint64_t>(\"OR16\");\n  Nor16Ops = registerStatistic<uint64_t>(\"NOR16\");\n  And16Ops = registerStatistic<uint64_t>(\"AND16\");\n  Nand16Ops = registerStatistic<uint64_t>(\"NAND16\");\n  CasGT8Ops = registerStatistic<uint64_t>(\"CASGT8\");\n  CasGT16Ops = registerStatistic<uint64_t>(\"CASGT16\");\n  CasLT8Ops = registerStatistic<uint64_t>(\"CASLT8\");\n  CasLT16Ops = registerStatistic<uint64_t>(\"CASLT16\");\n  CasEQ8Ops = registerStatistic<uint64_t>(\"CASEQ8\");\n  CasZero16Ops = registerStatistic<uint64_t>(\"CASZERO16\");\n  Eq8Ops = registerStatistic<uint64_t>(\"EQ8\");\n  Eq16Ops = registerStatistic<uint64_t>(\"EQ16\");\n  BWR8ROps = registerStatistic<uint64_t>(\"BWR8R\");\n  Swap16Ops = registerStatistic<uint64_t>(\"SWAP16\");\n}\n\n\/* ----------------------------------------------------- HMCSIM_SST_TRACE_INIT *\/\nextern \"C\" int hmcsim_sst_trace_init();\nint hmcsim_sst_trace_init(){\n  \/* tell the SST sim not to end without this data *\/\n  registerAsPrimaryComponent();\n  primaryComponentDoNotEndSim();\n\n  \/* register all the new components *\/\n  hmcsim_sst_register_packets();\n  hmcsim_sst_register_stalls();\n  hmcsim_sst_register_power();\n  hmcsim_sst_register_thermal();\n  hmcsim_sst_register_misc();\n\n  return 0;\n}\n\n\/* ----------------------------------------------------- HMCSIM_SST_TRACE_CLOSE *\/\nextern \"C\" int hmcsim_sst_trace_close();\nint hmcsim_sst_trace_close(){\n  primaryComponentOKToEndSim();\n  return 0;\n}\n\n\/* ----------------------------------------------------- HMCSIM_SST_TRACE_STALL *\/\nextern \"C\" int hmcsim_sst_trace_stall( struct hmcsim_t *hmc,\n                                       uint32_t dev,\n                                       uint32_t quad,\n                                       uint32_t vault,\n                                       uint32_t src,\n                                       uint32_t dest,\n                                       uint32_t link,\n                                       uint32_t slot,\n                                       uint32_t type );\nint hmcsim_sst_trace_stall( struct hmcsim_t *hmc,\n                            uint32_t dev,\n                            uint32_t quad,\n                            uint32_t vault,\n                            uint32_t src,\n                            uint32_t dest,\n                            uint32_t link,\n                            uint32_t slot,\n                            uint32_t type ){\n  return 0;\n}\n\n\/* ----------------------------------------------------- HMCSIM_SST_TRACE_RQST *\/\nextern \"C\" int hmcsim_sst_trace_rqst( struct hmcsim_t *hmc,\n                           hmc_rqst_t rqst,\n                           uint32_t dev,\n                           uint32_t quad,\n                           uint32_t vault,\n                           uint32_t bank,\n                           uint64_t addr1,\n                           uint32_t size );\nint hmcsim_sst_trace_rqst( struct hmcsim_t *hmc,\n                           hmc_rqst_t rqst,\n                           uint32_t dev,\n                           uint32_t quad,\n                           uint32_t vault,\n                           uint32_t bank,\n                           uint64_t addr1,\n                           uint32_t size ){\n  switch( rqst ){\n  case WR16:\n    break;\n  case WR32:\n    break;\n  case WR48:\n    break;\n  case WR64:\n    break;\n  case WR80:\n    break;\n  case WR96:\n    break;\n  case WR112:\n    break;\n  case WR128:\n    break;\n  case WR256:\n    break;\n  case RD16:\n    break;\n  case RD32:\n    break;\n  case RD48:\n    break;\n  case RD64:\n    break;\n  case RD80:\n    break;\n  case RD96:\n    break;\n  case RD112:\n    break;\n  case RD128:\n    break;\n  case RD256:\n    break;\n  case MD_WR:\n    break;\n  case BWR:\n    break;\n  case TWOADD8:\n    break;\n  case ADD16:\n    break;\n  case P_WR16:\n    break;\n  case P_WR32:\n    break;\n  case P_WR48:\n    break;\n  case P_WR64:\n    break;\n  case P_WR80:\n    break;\n  case P_WR96:\n    break;\n  case P_WR112:\n    break;\n  case P_WR128:\n    break;\n  case P_WR256:\n    break;\n  case MD_RD:\n    break;\n  case TWOADDS8R:\n    break;\n  case ADDS16R:\n    break;\n  case INC8:\n    break;\n  case P_INC8:\n    break;\n  case XOR16:\n    break;\n  case OR16:\n    break;\n  case NOR16:\n    break;\n  case AND16:\n    break;\n  case NAND16:\n    break;\n  case CASGT8:\n    break;\n  case CASGT16:\n    break;\n  case CASLT8:\n    break;\n  case CASLT16:\n    break;\n  case CASEQ8:\n    break;\n  case CASZERO16:\n    break;\n  case EQ8:\n    break;\n  case EQ16:\n    break;\n  case BWR8R:\n    break;\n  case SWAP16:\n    break;\n  case FLOW_NULL:\n  case PRET:\n  case TRET:\n  case IRTRY:\n  default:\n    return -1;\n    break;\n  }\n\n  return 0;\n}\n\n\/* ----------------------------------------------------- HMCSIM_SST_TRACE_BANK_CONFLICT *\/\nextern \"C\" int hmcsim_sst_trace_bank_conflict( struct hmcsim_t *hmc,\n                                    uint32_t dev,\n                                    uint32_t quad,\n                                    uint32_t vault,\n                                    uint32_t bank,\n                                    uint64_t addr );\nint hmcsim_sst_trace_bank_conflict( struct hmcsim_t *hmc,\n                                    uint32_t dev,\n                                    uint32_t quad,\n                                    uint32_t vault,\n                                    uint32_t bank,\n                                    uint64_t addr ){\n  return 0;\n}\n\n\/* ----------------------------------------------------- HMCSIM_SST_TRACE_LATENCY *\/\nextern \"C\" int hmcsim_sst_trace_latency( struct hmcsim_t *hmc,\n                              uint32_t dev,\n                              uint32_t link,\n                              uint32_t slot,\n                              uint32_t quad,\n                              uint32_t vault );\nint hmcsim_sst_trace_latency( struct hmcsim_t *hmc,\n                              uint32_t dev,\n                              uint32_t link,\n                              uint32_t slot,\n                              uint32_t quad,\n                              uint32_t vault ){\n  return 0;\n}\n\n#endif \/* SST_ENABLE_STAT *\/\n\n\/* EOF *\/\n<commit_msg>adding logic to submit all the i\/o trace inputs to sst statistics handlers<commit_after>\/*\n * HMC_SST_TRACE.CC\n *\n * Implementation file for the SST trace handlers\n *\n *\/\n\n#ifdef SST_ENABLE_STAT\n\n#include \"hmc_sst_trace.h\"\n#include \"hmc_sim.h\"\n\n\/\/ force the use of the SST namespace\nusing namespace SST;\n\n\/* ----------------------------------------------------- HMCSIM_SST_REGISTER_THERMAL *\/\nstatic void hmcsim_sst_register_thermal(){\n  LinkPhyTherm = registerStatistic<uint64_t>(\"LinkPhyTherm\");\n  LinkLocalRouteTherm = registerStatistic<uint64_t>(\"LinkLocalRouteTherm\");\n  LinkRemoteRouteTherm = registerStatistic<uint64_t>(\"LinkRemoteRouteTherm\");\n  XbarRqstSlotTherm = registerStatistic<uint64_t>(\"XbarRqstSlotTherm\");\n  XbarRspSlotTherm = registerStatistic<uint64_t>(\"XbarRspSlotTherm\");\n  XbarRouteExternTherm = registerStatistic<uint64_t>(\"XbarRouteExternTherm\");\n  VaultRqstSlotTherm = registerStatistic<uint64_t>(\"VaultRqstSlotTherm\");\n  VaultRspSlotTherm = registerStatistic<uint64_t>(\"VaultRspSlotTherm\");\n  VaultCtrlTherm = registerStatistic<uint64_t>(\"VaultCtrlTherm\");\n  RowAccessTherm = registerStatistic<uint64_t>(\"RowAccessTherm\");\n}\n\n\/* ----------------------------------------------------- HMCSIM_SST_REGISTER_POWER *\/\nstatic void hmcsim_sst_register_power(){\n  LinkPhyPower = registerStatistic<uint64_t>(\"LinkPhyPower\");\n  LinkLocalRoutePower = registerStatistic<uint64_t>(\"LinkLocalRoutePower\");\n  LinkRemoteRoutePower = registerStatistic<uint64_t>(\"LinkRemoteRoutePower\");\n  XbarRqstSlotPower = registerStatistic<uint64_t>(\"XbarRqstSlotPower\");\n  XbarRspSlotPower = registerStatistic<uint64_t>(\"XbarRspSlotPower\");\n  XbarRouteExternPower = registerStatistic<uint64_t>(\"XbarRouteExternPower\");\n  VaultRqstSlotPower = registerStatistic<uint64_t>(\"VaultRqstSlotPower\");\n  VaultRspSlotPower = registerStatistic<uint64_t>(\"VaultRspSlotPower\");\n  VaultCtrlPower = registerStatistic<uint64_t>(\"VaultCtrlPower\");\n  RowAccessPower = registerStatistic<uint64_t>(\"RowAccessPower\");\n}\n\n\/* ----------------------------------------------------- HMCSIM_SST_REGISTER_MISC *\/\nstatic void hmcsim_sst_register_misc(){\n  BankConflict = registerStatistic<uint64_t>(\"BankConflict\");\n  XbarLatency = registerStatistic<uint64_t>(\"XbarLatency\");\n}\n\n\/* ----------------------------------------------------- HMCSIM_SST_REGISTER_STALLS *\/\nstatic void hmcsim_sst_register_stalls(){\n  XbarRqstStall = registerStatistic<uint64_t>(\"XbarRqstStall\");\n  VaultRqstStall = registerStatistic<uint64_t>(\"VaultRqstStall\");\n  XbarRspStall = registerStatistic<uint64_t>(\"XbarRspStall\");\n  RouteRqstStall = registerStatistic<uint64_t>(\"RouteRqstStall\");\n  RouteRspStall = registerStatistic<uint64_t>(\"RouteRspStall\");\n  UndefStall = registerStatistic<uint64_t>(\"UndefStall\");\n}\n\n\/* ----------------------------------------------------- HMCSIM_SST_REGISTER_PACKETS *\/\nstatic void hmcsim_sst_register_packets(){\n  Write16Ops = registerStatistic<uint64_t>(\"WR16\");\n  Write32Ops = registerStatistic<uint64_t>(\"WR32\");\n  Write48Ops = registerStatistic<uint64_t>(\"WR48\");\n  Write64Ops = registerStatistic<uint64_t>(\"WR64\");\n  Write80Ops = registerStatistic<uint64_t>(\"WR80\");\n  Write96Ops = registerStatistic<uint64_t>(\"WR96\");\n  Write112Ops = registerStatistic<uint64_t>(\"WR112\");\n  Write128Ops = registerStatistic<uint64_t>(\"WR128\");\n  Write256Ops = registerStatistic<uint64_t>(\"WR256\");\n  Read16Ops = registerStatistic<uint64_t>(\"RD16\");\n  Read32Ops = registerStatistic<uint64_t>(\"RD32\");\n  Read48Ops = registerStatistic<uint64_t>(\"RD48\");\n  Read64Ops = registerStatistic<uint64_t>(\"RD64\");\n  Read80Ops = registerStatistic<uint64_t>(\"RD80\");\n  Read96Ops = registerStatistic<uint64_t>(\"RD96\");\n  Read112Ops = registerStatistic<uint64_t>(\"RD112\");\n  Read128Ops = registerStatistic<uint64_t>(\"RD128\");\n  Read256Ops = registerStatistic<uint64_t>(\"RD256\");\n  ModeWriteOps = registerStatistic<uint64_t>(\"MD_WR\");\n  ModeReadOps = registerStatistic<uint64_t>(\"MD_RD\");\n  BWROps = registerStatistic<uint64_t>(\"BWR\");\n  TwoAdd8Ops = registerStatistic<uint64_t>(\"2ADD8\");\n  Add16Ops = registerStatistic<uint64_t>(\"ADD16\");\n  PWrite16Ops = registerStatistic<uint64_t>(\"P_WR16\");\n  PWrite32Ops = registerStatistic<uint64_t>(\"P_WR32\");\n  PWrite48Ops = registerStatistic<uint64_t>(\"P_WR48\");\n  PWrite64Ops = registerStatistic<uint64_t>(\"P_WR64\");\n  PWrite80Ops = registerStatistic<uint64_t>(\"P_WR80\");\n  PWrite96Ops = registerStatistic<uint64_t>(\"P_WR96\");\n  PWrite112Ops = registerStatistic<uint64_t>(\"P_WR112\");\n  PWrite128Ops = registerStatistic<uint64_t>(\"P_128\");\n  PWrite256Ops = registerStatistic<uint64_t>(\"P_256\");\n  TwoAddS8ROps = registerStatistic<uint64_t>(\"2ADDS8R\");\n  AddS16ROps = registerStatistic<uint64_t>(\"ADDS16\");\n  Inc8Ops = registerStatistic<uint64_t>(\"INC8\");\n  PInc8Ops = registerStatistic<uint64_t>(\"P_INC8\");\n  Xor16Ops = registerStatistic<uint64_t>(\"XOR16\");\n  Or16Ops = registerStatistic<uint64_t>(\"OR16\");\n  Nor16Ops = registerStatistic<uint64_t>(\"NOR16\");\n  And16Ops = registerStatistic<uint64_t>(\"AND16\");\n  Nand16Ops = registerStatistic<uint64_t>(\"NAND16\");\n  CasGT8Ops = registerStatistic<uint64_t>(\"CASGT8\");\n  CasGT16Ops = registerStatistic<uint64_t>(\"CASGT16\");\n  CasLT8Ops = registerStatistic<uint64_t>(\"CASLT8\");\n  CasLT16Ops = registerStatistic<uint64_t>(\"CASLT16\");\n  CasEQ8Ops = registerStatistic<uint64_t>(\"CASEQ8\");\n  CasZero16Ops = registerStatistic<uint64_t>(\"CASZERO16\");\n  Eq8Ops = registerStatistic<uint64_t>(\"EQ8\");\n  Eq16Ops = registerStatistic<uint64_t>(\"EQ16\");\n  BWR8ROps = registerStatistic<uint64_t>(\"BWR8R\");\n  Swap16Ops = registerStatistic<uint64_t>(\"SWAP16\");\n}\n\n\/* ----------------------------------------------------- HMCSIM_SST_TRACE_INIT *\/\nextern \"C\" int hmcsim_sst_trace_init();\nint hmcsim_sst_trace_init(){\n  \/* tell the SST sim not to end without this data *\/\n  registerAsPrimaryComponent();\n  primaryComponentDoNotEndSim();\n\n  \/* register all the new components *\/\n  hmcsim_sst_register_packets();\n  hmcsim_sst_register_stalls();\n  hmcsim_sst_register_power();\n  hmcsim_sst_register_thermal();\n  hmcsim_sst_register_misc();\n\n  return 0;\n}\n\n\/* ----------------------------------------------------- HMCSIM_SST_TRACE_CLOSE *\/\nextern \"C\" int hmcsim_sst_trace_close();\nint hmcsim_sst_trace_close(){\n  primaryComponentOKToEndSim();\n  return 0;\n}\n\n\/* ----------------------------------------------------- HMCSIM_SST_TRACE_STALL *\/\nextern \"C\" int hmcsim_sst_trace_stall( struct hmcsim_t *hmc,\n                                       uint32_t dev,\n                                       uint32_t quad,\n                                       uint32_t vault,\n                                       uint32_t src,\n                                       uint32_t dest,\n                                       uint32_t link,\n                                       uint32_t slot,\n                                       uint32_t type );\nint hmcsim_sst_trace_stall( struct hmcsim_t *hmc,\n                            uint32_t dev,\n                            uint32_t quad,\n                            uint32_t vault,\n                            uint32_t src,\n                            uint32_t dest,\n                            uint32_t link,\n                            uint32_t slot,\n                            uint32_t type ){\n  return 0;\n}\n\n\/* ----------------------------------------------------- HMCSIM_SST_TRACE_RQST *\/\nextern \"C\" int hmcsim_sst_trace_rqst( struct hmcsim_t *hmc,\n                           hmc_rqst_t rqst,\n                           uint32_t dev,\n                           uint32_t quad,\n                           uint32_t vault,\n                           uint32_t bank,\n                           uint64_t addr1,\n                           uint32_t size );\nint hmcsim_sst_trace_rqst( struct hmcsim_t *hmc,\n                           hmc_rqst_t rqst,\n                           uint32_t dev,\n                           uint32_t quad,\n                           uint32_t vault,\n                           uint32_t bank,\n                           uint64_t addr1,\n                           uint32_t size ){\n  switch( rqst ){\n  case WR16:\n    Write16Ops->addData(1);\n    break;\n  case WR32:\n    Write32Ops->addData(1);\n    break;\n  case WR48:\n    Write48Ops->addData(1);\n    break;\n  case WR64:\n    Write64Ops->addData(1);\n    break;\n  case WR80:\n    Write80Ops->addData(1);\n    break;\n  case WR96:\n    Write96Ops->addData(1);\n    break;\n  case WR112:\n    Write112Ops->addData(1);\n    break;\n  case WR128:\n    Write128Ops->addData(1);\n    break;\n  case WR256:\n    Write256Ops->addData(1);\n    break;\n  case RD16:\n    Read16Ops->addData(1);\n    break;\n  case RD32:\n    Read32Ops->addData(1);\n    break;\n  case RD48:\n    Read48Ops->addData(1);\n    break;\n  case RD64:\n    Read64Ops->addData(1);\n    break;\n  case RD80:\n    Read80Ops->addData(1);\n    break;\n  case RD96:\n    Read96Ops->addData(1);\n    break;\n  case RD112:\n    Read112Ops->addData(1);\n    break;\n  case RD128:\n    Read128Ops->addData(1);\n    break;\n  case RD256:\n    Read256Ops->addData(1);\n    break;\n  case MD_WR:\n    ModeWriteOps->addData(1);\n    break;\n  case BWR:\n    BWROps->addData(1);\n    break;\n  case TWOADD8:\n    TwoAdd8Ops->addData(1);\n    break;\n  case ADD16:\n    Add16Ops->addData(1);\n    break;\n  case P_WR16:\n    PWrite16Ops->addData(1);\n    break;\n  case P_WR32:\n    PWrite32Ops->addData(1);\n    break;\n  case P_WR48:\n    PWrite48Ops->addData(1);\n    break;\n  case P_WR64:\n    PWrite64Ops->addData(1);\n    break;\n  case P_WR80:\n    PWrite80Ops->addData(1);\n    break;\n  case P_WR96:\n    PWrite96Ops->addData(1);\n    break;\n  case P_WR112:\n    PWrite112Ops->addData(1);\n    break;\n  case P_WR128:\n    PWrite128Ops->addData(1);\n    break;\n  case P_WR256:\n    PWrite256Ops->addData(1);\n    break;\n  case MD_RD:\n    ModeReadOps->addData(1);\n    break;\n  case TWOADDS8R:\n    TwoAddS8ROps->addData(1);\n    break;\n  case ADDS16R:\n    AddS16ROps->addData(1);\n    break;\n  case INC8:\n    Inc8Ops->addData(1);\n    break;\n  case P_INC8:\n    PInc8Ops->addData(1);\n    break;\n  case XOR16:\n    Xor16Ops->addData(1);\n    break;\n  case OR16:\n    Or16Ops->addData(1);\n    break;\n  case NOR16:\n    Nor16Ops->addData(1);\n    break;\n  case AND16:\n    And16Ops->addData(1);\n    break;\n  case NAND16:\n    Nand16Ops->addData(1);\n    break;\n  case CASGT8:\n    CasGT8Ops->addData(1);\n    break;\n  case CASGT16:\n    CasGT16Ops->addData(1);\n    break;\n  case CASLT8:\n    CasLT8Ops->addData(1);\n    break;\n  case CASLT16:\n    CasLT16Ops->addData(1);\n    break;\n  case CASEQ8:\n    CasEQ8Ops->addData(1);\n    break;\n  case CASZERO16:\n    CasZero16Ops->addData(1);\n    break;\n  case EQ8:\n    Eq8Ops->addData(1);\n    break;\n  case EQ16:\n    Eq16Ops->addData(1);\n    break;\n  case BWR8R:\n    BWR8ROps->addData(1);\n    break;\n  case SWAP16:\n    Swap16Ops->addData(1);\n    break;\n  case FLOW_NULL:\n  case PRET:\n  case TRET:\n  case IRTRY:\n  default:\n    return -1;\n    break;\n  }\n\n  return 0;\n}\n\n\/* ----------------------------------------------------- HMCSIM_SST_TRACE_BANK_CONFLICT *\/\nextern \"C\" int hmcsim_sst_trace_bank_conflict( struct hmcsim_t *hmc,\n                                    uint32_t dev,\n                                    uint32_t quad,\n                                    uint32_t vault,\n                                    uint32_t bank,\n                                    uint64_t addr );\nint hmcsim_sst_trace_bank_conflict( struct hmcsim_t *hmc,\n                                    uint32_t dev,\n                                    uint32_t quad,\n                                    uint32_t vault,\n                                    uint32_t bank,\n                                    uint64_t addr ){\n  return 0;\n}\n\n\/* ----------------------------------------------------- HMCSIM_SST_TRACE_LATENCY *\/\nextern \"C\" int hmcsim_sst_trace_latency( struct hmcsim_t *hmc,\n                              uint32_t dev,\n                              uint32_t link,\n                              uint32_t slot,\n                              uint32_t quad,\n                              uint32_t vault );\nint hmcsim_sst_trace_latency( struct hmcsim_t *hmc,\n                              uint32_t dev,\n                              uint32_t link,\n                              uint32_t slot,\n                              uint32_t quad,\n                              uint32_t vault ){\n  return 0;\n}\n\n#endif \/* SST_ENABLE_STAT *\/\n\n\/* EOF *\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"arac.h\"\n#include <iostream>\n\nusing namespace arac::structure::networks;\nusing namespace arac::structure::connections;\nusing namespace arac::structure::modules;\nusing namespace arac::optimization;\nusing namespace arac::datasets;\n\n\nSupervisedDataset<double*, double*> make_dataset()\n{\n    SupervisedDataset<double*, double*> ds(2, 1);\n    double* data_p = new double[12];\n    data_p[0] = 0;\n    data_p[1] = 0;\n    data_p[2] = 0;\n    \n    data_p[3] = 0;\n    data_p[4] = 1;\n    data_p[5] = 1;\n\n    data_p[6] = 1;\n    data_p[7] = 0;\n    data_p[8] = 1;\n\n    data_p[9] = 1;\n    data_p[10] = 1;\n    data_p[11] = 0;\n    \n    ds.append(data_p, data_p + 2);\n    ds.append(data_p + 3, data_p + 5);\n    ds.append(data_p + 6, data_p + 8);\n    ds.append(data_p + 9, data_p + 11);\n    \n    return ds;\n}\n\n\nNetwork make_network()\n{\n    Network net;\n    LinearLayer* inlayer_p = new LinearLayer(2);\n    Bias* bias_p = new Bias();\n    TanhLayer* hidden_p = new TanhLayer(3);\n    SigmoidLayer* outlayer_p = new SigmoidLayer(1);\n    FullConnection* con1_p = new FullConnection(inlayer_p, hidden_p);\n    FullConnection* con2_p = new FullConnection(hidden_p, outlayer_p);\n    FullConnection* con3_p = new FullConnection(bias_p, hidden_p);\n    \n    net.add_module(inlayer_p, Network::InputModule);\n    net.add_module(hidden_p);\n    net.add_module(bias_p);\n    net.add_module(outlayer_p, Network::OutputModule);\n    net.add_connection(con1_p);\n    net.add_connection(con2_p);\n    net.add_connection(con3_p);\n    \n    return net;\n}\n\n\nint main (int argc, char const *argv[])\n{\n    SupervisedDataset<double*, double*> ds = make_dataset();\n    Network net = make_network();\n    SimpleBackprop optimizer = SimpleBackprop(net, ds);\n    optimizer.set_learningrate(0.05);\n    \n    for(int i = 0; i < 10000; i++)\n    {\n        optimizer.train_stochastic();\n        std::cout << *optimizer.error() << std::endl;\n    }\n}<commit_msg>Some enhancements to the XOR example.<commit_after>#include \"arac.h\"\n#include <iostream>\n#include <stdlib.h>\n#include <time.h>\n\n\nusing namespace arac::structure::networks;\nusing namespace arac::structure::connections;\nusing namespace arac::structure::modules;\nusing namespace arac::optimization;\nusing namespace arac::datasets;\nusing namespace arac::utilities;\n\n\nSupervisedDataset<double*, double*> make_dataset()\n{\n    SupervisedDataset<double*, double*> ds(2, 1);\n    double* data_p = new double[12];\n    data_p[0] = 0;\n    data_p[1] = 0;\n    data_p[2] = 0;\n    \n    data_p[3] = 0;\n    data_p[4] = 1;\n    data_p[5] = 1;\n\n    data_p[6] = 1;\n    data_p[7] = 0;\n    data_p[8] = 1;\n\n    data_p[9] = 1;\n    data_p[10] = 1;\n    data_p[11] = 0;\n    \n    ds.append(data_p, data_p + 2);\n    ds.append(data_p + 3, data_p + 5);\n    ds.append(data_p + 6, data_p + 8);\n    ds.append(data_p + 9, data_p + 11);\n    \n    return ds;\n}\n\n\nNetwork make_network()\n{\n    Network net;\n    LinearLayer* inlayer_p = new LinearLayer(2);\n    Bias* bias_p = new Bias();\n    TanhLayer* hidden_p = new TanhLayer(3);\n    LinearLayer* outlayer_p = new LinearLayer(1);\n    FullConnection* con1_p = new FullConnection(inlayer_p, hidden_p);\n    FullConnection* con2_p = new FullConnection(hidden_p, outlayer_p);\n    FullConnection* con3_p = new FullConnection(bias_p, hidden_p);\n    \n    net.add_module(inlayer_p, Network::InputModule);\n    net.add_module(hidden_p);\n    net.add_module(bias_p);\n    net.add_module(outlayer_p, Network::OutputModule);\n    net.add_connection(con1_p);\n    net.add_connection(con2_p);\n    net.add_connection(con3_p);\n    \n    net.randomize();\n    \n    return net;\n}\n\n\nint main (int argc, char const *argv[])\n{\n    srand(0);\n    SupervisedDataset<double*, double*> ds = make_dataset();\n    Network net = make_network();\n    srand(0);\n    SimpleBackprop optimizer = SimpleBackprop(net, ds);\n    optimizer.set_learningrate(0.05);\n    \/\/ print_parameters(net);\n    std::cout << std::endl;\n    for(int i = 0; i < 10000; i++)\n    {\n        optimizer.train_stochastic();\n        \/\/ print_derivatives(net);\n        std::cout << std::endl;\n        std::cout << *optimizer.error() << std::endl;\n    }\n    std::cout << \"Parameter: \";\n    print_parameters(net);\n    std::cout << std::endl;\n    print_activations(net, ds);\n}<|endoftext|>"}
{"text":"<commit_before><commit_msg>INTEGRATION: CWS pchfix02 (1.31.4); FILE MERGED 2006\/09\/01 17:24:39 kaib 1.31.4.1: #i68856# Added header markers and pch files<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"ffmpeg_video_source.h\"\nextern \"C\"\n{\n#include <libavutil\/imgutils.h>\n}\n\n\nnamespace gg\n{\n\nVideoSourceFFmpeg::VideoSourceFFmpeg()\n{\n    \/\/ nop\n}\n\n\nVideoSourceFFmpeg::VideoSourceFFmpeg(std::string source_path,\n                                     enum ColourSpace colour_space,\n                                     bool use_refcount)\n    : IVideoSource(colour_space)\n    , _x(0)\n    , _y(0)\n    , _source_path(source_path)\n    , _avformat_context(nullptr)\n    , _avstream_idx(-1)\n    , _use_refcount(use_refcount)\n    , _avframe_original(nullptr)\n    , _avframe_processed(nullptr)\n    , _daemon(nullptr)\n{\n    int ret = 0;\n    std::string error_msg = \"\";\n\n    av_register_all();\n\n    ffmpeg_open_source();\n    ffmpeg_open_decoder();\n    ffmpeg_allocate_reading_buffers();\n\n    _daemon = new gg::BroadcastDaemon(this);\n    _daemon->start(get_frame_rate());\n}\n\n\nVideoSourceFFmpeg::~VideoSourceFFmpeg()\n{\n    delete _daemon;\n\n    avcodec_close(_avformat_context->streams[_avstream_idx]->codec);\n    avformat_close_input(&_avformat_context);\n    av_frame_free(&_avframe_original);\n    av_frame_free(&_avframe_processed);\n    av_free(_data_buffer[0]);\n    _data_buffer_length = 0;\n}\n\n\nbool VideoSourceFFmpeg::get_frame_dimensions(int & width, int & height)\n{\n    std::lock_guard<std::mutex> buffer_lock_guard(_buffer_lock);\n\n    if (_avframe_processed->width > 0 and _avframe_processed->height > 0)\n    {\n        width = _avframe_processed->width;\n        height = _avframe_processed->height;\n        return true;\n    }\n    else\n        return false;\n}\n\n\nbool VideoSourceFFmpeg::get_frame(VideoFrame & frame)\n{\n    std::lock_guard<std::mutex> buffer_lock_guard(_buffer_lock);\n\n    int ret = 0;\n\n    \/\/ read frame\n    ret = av_read_frame(_avformat_context, &_avpacket);\n    if (ret < 0)\n        return false;\n\n    \/\/ decode frame\n    bool success = true;\n    AVPacket orig_pkt = _avpacket;\n    do\n    {\n        ret = ffmpeg_decode_packet();\n        if (ret < 0)\n        {\n            success = false;\n            break;\n        }\n        _avpacket.data += ret;\n        _avpacket.size -= ret;\n    }\n    while (_avpacket.size > 0);\n    av_packet_unref(&orig_pkt);\n    if (not success)\n        return false;\n\n    \/\/ TODO _avframe_original => _avframe_processed PIPELINE\n\n    \/\/ get non-aligned data from decoded frame\n    av_image_copy(_data_buffer, _data_buffer_linesizes,\n                  const_cast<const uint8_t **>(_avframe_processed->data),\n                  _avframe_processed->linesize,\n                  static_cast<AVPixelFormat>(_avframe_processed->format),\n                  _avframe_processed->width,\n                  _avframe_processed->height);\n\n    \/\/ initialise GIFT-Grab frame from flat data\n    frame.init_from_specs(_data_buffer[0], _data_buffer_length,\n                          _avframe_processed->width, _avframe_processed->height);\n    return true;\n}\n\n\ndouble VideoSourceFFmpeg::get_frame_rate()\n{\n    int num = _avformat_context->streams[_avstream_idx]->avg_frame_rate.num;\n    int den = _avformat_context->streams[_avstream_idx]->avg_frame_rate.den;\n    if (num == 0)\n        return 0.0;\n    return static_cast<double>(num) \/ den;\n}\n\n\nvoid VideoSourceFFmpeg::set_sub_frame(int x, int y, int width, int height)\n{\n    std::lock_guard<std::mutex> buffer_lock_guard(_buffer_lock);\n    \/\/ TODO\n}\n\n\nvoid VideoSourceFFmpeg::get_full_frame()\n{\n    std::lock_guard<std::mutex> buffer_lock_guard(_buffer_lock);\n    \/\/ TODO\n}\n\n\nvoid VideoSourceFFmpeg::ffmpeg_open_source()\n{\n    int ret = 0;\n    std::string error_msg = \"\";\n\n    ret = avformat_open_input(&_avformat_context, _source_path.c_str(),\n                              nullptr, nullptr);\n    if (ret < 0)\n    {\n        error_msg.append(\"Could not open video source \")\n                 .append(_source_path)\n                 .append(get_ffmpeg_error_desc(ret));\n        throw VideoSourceError(error_msg);\n    }\n\n    ret = avformat_find_stream_info(_avformat_context, nullptr);\n    if (ret < 0)\n    {\n        error_msg.append(\"Could not find stream information\")\n                 .append(get_ffmpeg_error_desc(ret));\n        throw VideoSourceError(error_msg);\n    }\n\n    ret = av_find_best_stream(_avformat_context, AVMEDIA_TYPE_VIDEO,\n                              -1, -1, nullptr, 0);\n    if (ret < 0)\n    {\n        error_msg.append(\"Could not find video stream in source \")\n                 .append(_source_path)\n                 .append(get_ffmpeg_error_desc(ret));\n        throw VideoSourceError(error_msg);\n    }\n    if (_avformat_context->streams[ret] == nullptr)\n        throw VideoSourceError(\"Found stream index is empty\");\n\n    _avstream_idx = ret;\n}\n\n\nvoid VideoSourceFFmpeg::ffmpeg_open_decoder()\n{\n    int ret = 0;\n    std::string error_msg = \"\";\n\n    \/\/ find codec\n    AVCodec * avcodec = nullptr;\n    avcodec = avcodec_find_decoder(\n        _avformat_context->streams[_avstream_idx]->codec->codec_id\n    );\n    if (avcodec == nullptr)\n        throw VideoSourceError(\"Could not find video decoder\");\n\n    \/\/ open codec\n    AVDictionary * opts = nullptr;\n    av_dict_set(&opts, \"refcounted_frames\", _use_refcount ? \"1\" : \"0\", 0);\n    ret = avcodec_open2(\n        _avformat_context->streams[_avstream_idx]->codec, avcodec, &opts\n    );\n    if (ret < 0)\n    {\n        error_msg.append(\"Could not open video decoder\")\n                 .append(get_ffmpeg_error_desc(ret));\n        throw VideoSourceError(error_msg);\n    }\n\n    _x = 0;\n    _y = 0;\n}\n\n\nvoid VideoSourceFFmpeg::ffmpeg_allocate_reading_buffers()\n{\n    int ret = 0;\n    std::string error_msg = \"\";\n\n    \/\/ allocate conversion frame\n    _avframe_processed = av_frame_alloc();\n    if (_avframe_processed == nullptr)\n        throw VideoSourceError(\"Could not allocate conversion frame\");\n    _avframe_processed->format = get_ffmpeg_pixel_format(_colour);\n    _avframe_processed->width  = _avformat_context->streams[_avstream_idx]->codec->width;\n    _avframe_processed->height = _avformat_context->streams[_avstream_idx]->codec->height;\n    int pixel_depth = 0;\n    try\n    {\n        pixel_depth = VideoFrame::required_pixel_length(_colour);\n    }\n    catch (BasicException & e)\n    {\n        throw VideoSourceError(e.what());\n    }\n\n    \/\/ allocate actual conversion buffer\n    ret = av_frame_get_buffer(_avframe_processed, pixel_depth);\n    if (ret < 0)\n    {\n        error_msg.append(\"Could not allocate conversion buffer\")\n                 .append(get_ffmpeg_error_desc(ret));\n        throw VideoSourceError(error_msg);\n    }\n\n    \/\/ decoded image will be put here\n    _avframe_original = av_frame_alloc();\n    if (_avframe_original == nullptr)\n        throw VideoSourceError(\"Could not allocate frame\");\n\n    \/\/ packet for decoding frames: demuxer will fill it\n    av_init_packet(&_avpacket);\n    _avpacket.data = nullptr;\n    _avpacket.size = 0;\n\n    \/\/ allocate actual data buffer\n    ret = av_image_alloc(_data_buffer, _data_buffer_linesizes,\n                         _avformat_context->streams[_avstream_idx]->codec->width,\n                         _avformat_context->streams[_avstream_idx]->codec->height,\n                         get_ffmpeg_pixel_format(_colour), 1);\n    if (ret < 0)\n    {\n        error_msg.append(\"Could not allocate raw video buffer\")\n                 .append(get_ffmpeg_error_desc(ret));\n        throw VideoSourceError(error_msg);\n    }\n    _data_buffer_length = ret;\n}\n\n\nbool VideoSourceFFmpeg::ffmpeg_reset_pipeline(\n    int x, int y, int width, int height\n)\n{\n    \/\/ TODO\n    return false;\n}\n\n\nbool VideoSourceFFmpeg::ffmpeg_realloc_processing_buffers(\n    int width, int height\n)\n{\n    \/\/ TODO\n    return false;\n}\n\n\nint VideoSourceFFmpeg::ffmpeg_decode_packet()\n{\n    int ret = 0, got_frame = 0;\n    int decoded = 0;\n    if (_avpacket.stream_index == _avstream_idx)\n    {\n        \/* decode video frame *\/\n        ret = avcodec_decode_video2(\n                    _avformat_context->streams[_avstream_idx]->codec,\n                    _avframe_original, &got_frame, &_avpacket);\n        if (ret < 0)\n            return ret;\n\n        if (got_frame)\n        {\n            if (_avframe_original->width != _avformat_context->streams[_avstream_idx]->codec->width\n                or _avframe_original->height != _avformat_context->streams[_avstream_idx]->codec->height\n                or _avframe_original->format != _avformat_context->streams[_avstream_idx]->codec->pix_fmt)\n                return -1;\n            decoded = ret;\n        }\n    }\n\n    \/* If we use frame reference counting, we own the data and need\n     * to de-reference it when we don't use it anymore *\/\n    if (got_frame and _use_refcount)\n        av_frame_unref(_avframe_original);\n\n    return decoded;\n}\n\nstd::string VideoSourceFFmpeg::get_ffmpeg_error_desc(int ffmpeg_error_code)\n{\n    const size_t FFMPEG_ERR_MSG_SIZE = 2048;\n    char ffmpeg_err_msg[FFMPEG_ERR_MSG_SIZE];\n    std::string ffmpeg_error_desc = \"\";\n    if (av_strerror(ffmpeg_error_code,\n                    ffmpeg_err_msg,\n                    FFMPEG_ERR_MSG_SIZE) == 0)\n        ffmpeg_error_desc.append(\" (FFmpeg error description: \")\n                         .append(std::string(ffmpeg_err_msg))\n                         .append(\")\");\n    else\n        ffmpeg_error_desc.append(\" (No specific error description\"\n                                 \" could be obtained from FFmpeg)\");\n    return ffmpeg_error_desc;\n}\n\n\nAVPixelFormat VideoSourceFFmpeg::get_ffmpeg_pixel_format(\n    enum ColourSpace colour\n)\n{\n    switch(colour)\n    {\n    case BGRA:\n        return AV_PIX_FMT_BGRA;\n    case I420:\n        return AV_PIX_FMT_YUV420P;\n    case UYVY:\n        return AV_PIX_FMT_UYVY422;\n    default:\n        throw VideoSourceError(\"Colour space not supported\");\n    }\n}\n\n}\n<commit_msg>Issue #74: implemented set_sub_frame and get_full_frame using newly created method stubs added in prev. commit<commit_after>#include \"ffmpeg_video_source.h\"\nextern \"C\"\n{\n#include <libavutil\/imgutils.h>\n}\n\n\nnamespace gg\n{\n\nVideoSourceFFmpeg::VideoSourceFFmpeg()\n{\n    \/\/ nop\n}\n\n\nVideoSourceFFmpeg::VideoSourceFFmpeg(std::string source_path,\n                                     enum ColourSpace colour_space,\n                                     bool use_refcount)\n    : IVideoSource(colour_space)\n    , _x(0)\n    , _y(0)\n    , _source_path(source_path)\n    , _avformat_context(nullptr)\n    , _avstream_idx(-1)\n    , _use_refcount(use_refcount)\n    , _avframe_original(nullptr)\n    , _avframe_processed(nullptr)\n    , _daemon(nullptr)\n{\n    int ret = 0;\n    std::string error_msg = \"\";\n\n    av_register_all();\n\n    ffmpeg_open_source();\n    ffmpeg_open_decoder();\n    ffmpeg_allocate_reading_buffers();\n\n    _daemon = new gg::BroadcastDaemon(this);\n    _daemon->start(get_frame_rate());\n}\n\n\nVideoSourceFFmpeg::~VideoSourceFFmpeg()\n{\n    delete _daemon;\n\n    avcodec_close(_avformat_context->streams[_avstream_idx]->codec);\n    avformat_close_input(&_avformat_context);\n    av_frame_free(&_avframe_original);\n    av_frame_free(&_avframe_processed);\n    av_free(_data_buffer[0]);\n    _data_buffer_length = 0;\n}\n\n\nbool VideoSourceFFmpeg::get_frame_dimensions(int & width, int & height)\n{\n    std::lock_guard<std::mutex> buffer_lock_guard(_buffer_lock);\n\n    if (_avframe_processed->width > 0 and _avframe_processed->height > 0)\n    {\n        width = _avframe_processed->width;\n        height = _avframe_processed->height;\n        return true;\n    }\n    else\n        return false;\n}\n\n\nbool VideoSourceFFmpeg::get_frame(VideoFrame & frame)\n{\n    std::lock_guard<std::mutex> buffer_lock_guard(_buffer_lock);\n\n    int ret = 0;\n\n    \/\/ read frame\n    ret = av_read_frame(_avformat_context, &_avpacket);\n    if (ret < 0)\n        return false;\n\n    \/\/ decode frame\n    bool success = true;\n    AVPacket orig_pkt = _avpacket;\n    do\n    {\n        ret = ffmpeg_decode_packet();\n        if (ret < 0)\n        {\n            success = false;\n            break;\n        }\n        _avpacket.data += ret;\n        _avpacket.size -= ret;\n    }\n    while (_avpacket.size > 0);\n    av_packet_unref(&orig_pkt);\n    if (not success)\n        return false;\n\n    \/\/ TODO _avframe_original => _avframe_processed PIPELINE\n\n    \/\/ get non-aligned data from decoded frame\n    av_image_copy(_data_buffer, _data_buffer_linesizes,\n                  const_cast<const uint8_t **>(_avframe_processed->data),\n                  _avframe_processed->linesize,\n                  static_cast<AVPixelFormat>(_avframe_processed->format),\n                  _avframe_processed->width,\n                  _avframe_processed->height);\n\n    \/\/ initialise GIFT-Grab frame from flat data\n    frame.init_from_specs(_data_buffer[0], _data_buffer_length,\n                          _avframe_processed->width, _avframe_processed->height);\n    return true;\n}\n\n\ndouble VideoSourceFFmpeg::get_frame_rate()\n{\n    int num = _avformat_context->streams[_avstream_idx]->avg_frame_rate.num;\n    int den = _avformat_context->streams[_avstream_idx]->avg_frame_rate.den;\n    if (num == 0)\n        return 0.0;\n    return static_cast<double>(num) \/ den;\n}\n\n\nvoid VideoSourceFFmpeg::set_sub_frame(int x, int y, int width, int height)\n{\n    std::lock_guard<std::mutex> buffer_lock_guard(_buffer_lock);\n\n    try\n    {\n        if (ffmpeg_reset_pipeline(x, y, width, height))\n        {\n            if (ffmpeg_realloc_processing_buffers(width, height))\n            {\n                _x = x;\n                _y = y;\n            }\n        }\n    }\n    catch (VideoSourceError & e)\n    {\n        \/\/ nop\n    }\n}\n\n\nvoid VideoSourceFFmpeg::get_full_frame()\n{\n    std::lock_guard<std::mutex> buffer_lock_guard(_buffer_lock);\n\n    try\n    {\n        int width = _avformat_context->streams[_avstream_idx]->codec->width;\n        int height = _avformat_context->streams[_avstream_idx]->codec->height;\n        if (ffmpeg_realloc_processing_buffers(width, height))\n        {\n            if (ffmpeg_reset_pipeline(0, 0, width, height))\n            {\n                _x = 0;\n                _y = 0;\n            }\n        }\n    }\n    catch (VideoSourceError & e)\n    {\n        \/\/ nop\n    }\n}\n\n\nvoid VideoSourceFFmpeg::ffmpeg_open_source()\n{\n    int ret = 0;\n    std::string error_msg = \"\";\n\n    ret = avformat_open_input(&_avformat_context, _source_path.c_str(),\n                              nullptr, nullptr);\n    if (ret < 0)\n    {\n        error_msg.append(\"Could not open video source \")\n                 .append(_source_path)\n                 .append(get_ffmpeg_error_desc(ret));\n        throw VideoSourceError(error_msg);\n    }\n\n    ret = avformat_find_stream_info(_avformat_context, nullptr);\n    if (ret < 0)\n    {\n        error_msg.append(\"Could not find stream information\")\n                 .append(get_ffmpeg_error_desc(ret));\n        throw VideoSourceError(error_msg);\n    }\n\n    ret = av_find_best_stream(_avformat_context, AVMEDIA_TYPE_VIDEO,\n                              -1, -1, nullptr, 0);\n    if (ret < 0)\n    {\n        error_msg.append(\"Could not find video stream in source \")\n                 .append(_source_path)\n                 .append(get_ffmpeg_error_desc(ret));\n        throw VideoSourceError(error_msg);\n    }\n    if (_avformat_context->streams[ret] == nullptr)\n        throw VideoSourceError(\"Found stream index is empty\");\n\n    _avstream_idx = ret;\n}\n\n\nvoid VideoSourceFFmpeg::ffmpeg_open_decoder()\n{\n    int ret = 0;\n    std::string error_msg = \"\";\n\n    \/\/ find codec\n    AVCodec * avcodec = nullptr;\n    avcodec = avcodec_find_decoder(\n        _avformat_context->streams[_avstream_idx]->codec->codec_id\n    );\n    if (avcodec == nullptr)\n        throw VideoSourceError(\"Could not find video decoder\");\n\n    \/\/ open codec\n    AVDictionary * opts = nullptr;\n    av_dict_set(&opts, \"refcounted_frames\", _use_refcount ? \"1\" : \"0\", 0);\n    ret = avcodec_open2(\n        _avformat_context->streams[_avstream_idx]->codec, avcodec, &opts\n    );\n    if (ret < 0)\n    {\n        error_msg.append(\"Could not open video decoder\")\n                 .append(get_ffmpeg_error_desc(ret));\n        throw VideoSourceError(error_msg);\n    }\n\n    _x = 0;\n    _y = 0;\n}\n\n\nvoid VideoSourceFFmpeg::ffmpeg_allocate_reading_buffers()\n{\n    int ret = 0;\n    std::string error_msg = \"\";\n\n    \/\/ allocate conversion frame\n    _avframe_processed = av_frame_alloc();\n    if (_avframe_processed == nullptr)\n        throw VideoSourceError(\"Could not allocate conversion frame\");\n    _avframe_processed->format = get_ffmpeg_pixel_format(_colour);\n    _avframe_processed->width  = _avformat_context->streams[_avstream_idx]->codec->width;\n    _avframe_processed->height = _avformat_context->streams[_avstream_idx]->codec->height;\n    int pixel_depth = 0;\n    try\n    {\n        pixel_depth = VideoFrame::required_pixel_length(_colour);\n    }\n    catch (BasicException & e)\n    {\n        throw VideoSourceError(e.what());\n    }\n\n    \/\/ allocate actual conversion buffer\n    ret = av_frame_get_buffer(_avframe_processed, pixel_depth);\n    if (ret < 0)\n    {\n        error_msg.append(\"Could not allocate conversion buffer\")\n                 .append(get_ffmpeg_error_desc(ret));\n        throw VideoSourceError(error_msg);\n    }\n\n    \/\/ decoded image will be put here\n    _avframe_original = av_frame_alloc();\n    if (_avframe_original == nullptr)\n        throw VideoSourceError(\"Could not allocate frame\");\n\n    \/\/ packet for decoding frames: demuxer will fill it\n    av_init_packet(&_avpacket);\n    _avpacket.data = nullptr;\n    _avpacket.size = 0;\n\n    \/\/ allocate actual data buffer\n    ret = av_image_alloc(_data_buffer, _data_buffer_linesizes,\n                         _avformat_context->streams[_avstream_idx]->codec->width,\n                         _avformat_context->streams[_avstream_idx]->codec->height,\n                         get_ffmpeg_pixel_format(_colour), 1);\n    if (ret < 0)\n    {\n        error_msg.append(\"Could not allocate raw video buffer\")\n                 .append(get_ffmpeg_error_desc(ret));\n        throw VideoSourceError(error_msg);\n    }\n    _data_buffer_length = ret;\n}\n\n\nbool VideoSourceFFmpeg::ffmpeg_reset_pipeline(\n    int x, int y, int width, int height\n)\n{\n    \/\/ TODO\n    return false;\n}\n\n\nbool VideoSourceFFmpeg::ffmpeg_realloc_processing_buffers(\n    int width, int height\n)\n{\n    \/\/ TODO\n    return false;\n}\n\n\nint VideoSourceFFmpeg::ffmpeg_decode_packet()\n{\n    int ret = 0, got_frame = 0;\n    int decoded = 0;\n    if (_avpacket.stream_index == _avstream_idx)\n    {\n        \/* decode video frame *\/\n        ret = avcodec_decode_video2(\n                    _avformat_context->streams[_avstream_idx]->codec,\n                    _avframe_original, &got_frame, &_avpacket);\n        if (ret < 0)\n            return ret;\n\n        if (got_frame)\n        {\n            if (_avframe_original->width != _avformat_context->streams[_avstream_idx]->codec->width\n                or _avframe_original->height != _avformat_context->streams[_avstream_idx]->codec->height\n                or _avframe_original->format != _avformat_context->streams[_avstream_idx]->codec->pix_fmt)\n                return -1;\n            decoded = ret;\n        }\n    }\n\n    \/* If we use frame reference counting, we own the data and need\n     * to de-reference it when we don't use it anymore *\/\n    if (got_frame and _use_refcount)\n        av_frame_unref(_avframe_original);\n\n    return decoded;\n}\n\nstd::string VideoSourceFFmpeg::get_ffmpeg_error_desc(int ffmpeg_error_code)\n{\n    const size_t FFMPEG_ERR_MSG_SIZE = 2048;\n    char ffmpeg_err_msg[FFMPEG_ERR_MSG_SIZE];\n    std::string ffmpeg_error_desc = \"\";\n    if (av_strerror(ffmpeg_error_code,\n                    ffmpeg_err_msg,\n                    FFMPEG_ERR_MSG_SIZE) == 0)\n        ffmpeg_error_desc.append(\" (FFmpeg error description: \")\n                         .append(std::string(ffmpeg_err_msg))\n                         .append(\")\");\n    else\n        ffmpeg_error_desc.append(\" (No specific error description\"\n                                 \" could be obtained from FFmpeg)\");\n    return ffmpeg_error_desc;\n}\n\n\nAVPixelFormat VideoSourceFFmpeg::get_ffmpeg_pixel_format(\n    enum ColourSpace colour\n)\n{\n    switch(colour)\n    {\n    case BGRA:\n        return AV_PIX_FMT_BGRA;\n    case I420:\n        return AV_PIX_FMT_YUV420P;\n    case UYVY:\n        return AV_PIX_FMT_UYVY422;\n    default:\n        throw VideoSourceError(\"Colour space not supported\");\n    }\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * main.cpp for MLPTest\n *\n *\/\n\n\n#include <columns\/buildandrun.hpp>\n#include \"ComparisonLayer.hpp\"\n#include \"InputLayer.hpp\"\n#include \"GTLayer.hpp\"\n\nvoid * addcustomgroup(const char * keyword, const char * groupname, HyPerCol * hc);\n\nint main(int argc, char * argv[]) {\n   int rank;\n#ifdef PV_USE_MPI\n   MPI_Init(&argc, &argv);\n   MPI_Comm_rank(MPI_COMM_WORLD, &rank);\n#endif \/\/ PV_USE_MPI\n\n   if (pv_getopt_str(argc, argv, \"-p\", NULL, NULL)==0) {\n      if (rank==0) {\n         fprintf(stderr, \"%s should be run without the params file argument.\\n\", argv[0]);\n         fprintf(stderr, \"This test hard-codes the necessary params file.\\n\");\n      }\n      MPI_Barrier(MPI_COMM_WORLD);\n      exit(EXIT_FAILURE);\n   }\n   int pv_argc = argc+2; \/\/ input arguments, plus \"-p\", plus params file argument\n   char ** pv_argv = (char **) malloc((pv_argc+1)*sizeof(char *));\n   assert(pv_argv);\n   int pv_arg=0;\n   for (pv_arg = 0; pv_arg < argc; pv_arg++) {\n      pv_argv[pv_arg] = strdup(argv[pv_arg]);\n      assert(pv_argv[pv_arg]);\n   }\n   assert(pv_arg==argc);\n   pv_argv[pv_arg] = strdup(\"-p\");\n   assert(pv_argv[pv_arg]!=NULL);\n   int paramFileArgIndex = pv_arg+1;\n   pv_argv[paramFileArgIndex] = NULL; \/\/ this will hold params filename\n   pv_argv[pv_argc]=NULL;\n\n   int status = PV_SUCCESS;\n\n   free(pv_argv[paramFileArgIndex]);\n   pv_argv[paramFileArgIndex] = strdup(\"input\/MLPTest.params\");\n   assert(pv_argv[paramFileArgIndex]);\n   status = buildandrun(pv_argc, pv_argv, NULL, NULL, &addcustomgroup);\n   if( status != PV_SUCCESS ) {\n      fprintf(stderr, \"%s: running with params file %s returned error %d.\\n\", pv_argv[0], pv_argv[2], status);\n   }\n   status = buildandrun(pv_argc, pv_argv, NULL, NULL, &addcustomgroup);\n   if( status != PV_SUCCESS ) {\n      fprintf(stderr, \"%s: running with params file %s returned error %d.\\n\", pv_argv[0], pv_argv[2], status);\n      exit(status);\n   }\n\n   free(pv_argv[paramFileArgIndex]);\n   pv_argv[2] = strdup(\"input\/AlexTrain.params\");\n   assert(pv_argv[paramFileArgIndex]);\n   status = buildandrun(pv_argc, pv_argv, NULL, NULL, &addcustomgroup);\n   if( status != PV_SUCCESS ) {\n      fprintf(stderr, \"%s: running with params file %s returned error %d.\\n\", pv_argv[0], pv_argv[2], status);\n   }\n\n   free(pv_argv[paramFileArgIndex]);\n   pv_argv[paramFileArgIndex] = strdup(\"input\/AlexTest.params\");\n   assert(pv_argv[paramFileArgIndex]);\n   status = buildandrun(pv_argc, pv_argv, NULL, NULL, &addcustomgroup);\n   if( status != PV_SUCCESS ) {\n      fprintf(stderr, \"%s: running with params file %s returned error %d.\\n\", pv_argv[0], pv_argv[2], status);\n   }\n\n#ifdef PV_USE_MPI\n   MPI_Finalize();\n#endif\n\n   for (int i=0; i<pv_argc; i++) {\n      free(pv_argv[i]);\n   }\n   return status==PV_SUCCESS ? EXIT_SUCCESS : EXIT_FAILURE;\n}\n\nvoid * addcustomgroup(const char * keyword, const char * groupname, HyPerCol * hc) {\n   void* addedGroup= NULL;\n   if ( !strcmp(keyword, \"ComparisonLayer\") ) {\n      addedGroup = new ComparisonLayer(groupname, hc);\n   }\n   if ( !strcmp(keyword, \"InputLayer\") ) {\n      addedGroup = new InputLayer(groupname, hc);\n   }\n   if ( !strcmp(keyword, \"GTLayer\") ) {\n      addedGroup = new GTLayer(groupname, hc);\n   }\n   if (!addedGroup) {\n      fprintf(stderr, \"Group \\\"%s\\\": Unable to create %s\\n\", groupname, keyword);\n      exit(EXIT_SUCCESS);\n   }\n   checknewobject((void *) addedGroup, keyword, groupname, hc);\n   return addedGroup;\n}\n<commit_msg>Recent commit to MLPTest is broken somehow; reverting<commit_after>\/*\n * main.cpp\n *\n *\/\n\n\n#include <columns\/buildandrun.hpp>\n#include \"ComparisonLayer.hpp\"\n#include \"InputLayer.hpp\"\n#include \"GTLayer.hpp\"\n\nvoid * addcustomgroup(const char * keyword, const char * groupname, HyPerCol * hc);\n\nint main(int argc, char * argv[]) {\n   int rank;\n   bool argerr = false;\n   int reqrtn = 0;\n   int threading = 0;\n\n   if (argc > 1){\n      for(int i = 1; i < argc; i++){\n         \/\/Allowed arguments are -t and --require-return\n         if(strcmp(argv[i], \"-t\") == 0){\n            if(i+1 >= argc || argv[i+1][0] == '-'){\n               \/\/Do nothing\n            }\n            else{\n               int numthreads = atoi(argv[i+1]);\n               if(numthreads != 4){\n                  std::cout << \"Hardcoding to 4 threads\\n\";\n               }\n               i++;\n            }\n            threading = 2;\n            argerr |= false;\n         }\n         else if(strcmp(argv[i], \"--require-return\") == 0){\n            reqrtn = 1;\n            argerr |= false;\n         }\n         else{\n            \/\/error\n            argerr = true;\n         }\n      }\n   }\n   if (argerr) {\n      fprintf(stderr, \"%s: run without input arguments (except for --require-return or -t); the necessary arguments are hardcoded.\\n\", argv[0]);\n      exit(EXIT_FAILURE);\n   }\n#ifdef PV_USE_MPI\n   MPI_Init(&argc, &argv);\n   MPI_Comm_rank(MPI_COMM_WORLD, &rank);\n#endif \/\/ PV_USE_MPI\n\n#undef REQUIRE_RETURN\n#ifdef REQUIRE_RETURN\n   int charhit;\n   fflush(stdout);\n   if( rank == 0 ) {\n      printf(\"Hit enter to begin! \");\n      fflush(stdout);\n      charhit = getc(stdin);\n   }\n#ifdef PV_USE_MPI\n   MPI_Bcast(&charhit, 1, MPI_INT, 0, MPI_COMM_WORLD);\n#endif\n#endif \/\/ REQUIRE_RETURN\n\n   int status;\n   assert(reqrtn==0 || reqrtn==1);\n   assert(threading == 0 || threading == 2);\n   int cl_argc = 3+reqrtn+threading;\n   char * cl_args[cl_argc];\n   cl_args[0] = strdup(argv[0]);\n   cl_args[1] = strdup(\"-p\");\n\n   cl_args[2] = strdup(\"input\/MLPTrain.params\");\n\n   if(threading && reqrtn){\n      assert(cl_argc==6);\n      cl_args[3] = strdup(\"-t\");\n      cl_args[4] = strdup(\"4\");\n      cl_args[5] = strdup(\"--require-return\");\n   }\n   else if (threading) {\n      assert(cl_argc==5);\n      cl_args[3] = strdup(\"-t\");\n      cl_args[4] = strdup(\"4\");\n   }\n   else if (reqrtn){\n      assert(cl_argc==4);\n      cl_args[3] = strdup(\"--require-return\");\n   }\n   status = buildandrun(cl_argc, cl_args, NULL, NULL, &addcustomgroup);\n   if( status != PV_SUCCESS ) {\n      fprintf(stderr, \"%s: running with params file %s returned error %d.\\n\", cl_args[0], cl_args[2], status);\n      exit(status);\n   }\n\n   free(cl_args[2]);\n   cl_args[2] = strdup(\"input\/MLPTest.params\");\n   status = buildandrun(cl_argc, cl_args, NULL, NULL, &addcustomgroup);\n   if( status != PV_SUCCESS ) {\n      fprintf(stderr, \"%s: running with params file %s returned error %d.\\n\", cl_args[0], cl_args[2], status);\n   }\n\n   free(cl_args[2]);\n   cl_args[2] = strdup(\"input\/AlexTrain.params\");\n   status = buildandrun(cl_argc, cl_args, NULL, NULL, &addcustomgroup);\n   if( status != PV_SUCCESS ) {\n      fprintf(stderr, \"%s: running with params file %s returned error %d.\\n\", cl_args[0], cl_args[2], status);\n   }\n\n   free(cl_args[2]);\n   cl_args[2] = strdup(\"input\/AlexTest.params\");\n   status = buildandrun(cl_argc, cl_args, NULL, NULL, &addcustomgroup);\n   if( status != PV_SUCCESS ) {\n      fprintf(stderr, \"%s: running with params file %s returned error %d.\\n\", cl_args[0], cl_args[2], status);\n   }\n\n\n\n\n\n\n\n\n#ifdef PV_USE_MPI\n   MPI_Finalize();\n#endif\n\n   for (int i=0; i<cl_argc; i++) {\n      free(cl_args[i]);\n   }\n   return status==PV_SUCCESS ? EXIT_SUCCESS : EXIT_FAILURE;\n}\n\nvoid * addcustomgroup(const char * keyword, const char * groupname, HyPerCol * hc) {\n   void* addedGroup= NULL;\n   if ( !strcmp(keyword, \"ComparisonLayer\") ) {\n      addedGroup = new ComparisonLayer(groupname, hc);\n   }\n   if ( !strcmp(keyword, \"InputLayer\") ) {\n      addedGroup = new InputLayer(groupname, hc);\n   }\n   if ( !strcmp(keyword, \"GTLayer\") ) {\n      addedGroup = new GTLayer(groupname, hc);\n   }\n   if (!addedGroup) {\n      fprintf(stderr, \"Group \\\"%s\\\": Unable to create %s\\n\", groupname, keyword);\n      exit(EXIT_SUCCESS);\n   }\n   checknewobject((void *) addedGroup, keyword, groupname, hc);\n   return addedGroup;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"ofMain.h\"\n#include \"ParticleSystem.h\"\n\nclass ofApp : public ofBaseApp {\npublic:\n    ParticleSystem ps;\n    \n    void setup(){\n        ofBackground(0);\n        \n        ps.clear();\n        int particleCount = 1000;\n        float size = 256;\n        \n        ps.setExact(true);\n        \n        float velocity = 1;\n        for(int i = 0; i < particleCount; i++) {\n            float x = ofRandom(-size, size);\n            float y = ofRandom(-size, size);\n            float theta = ofRandom(-PI, PI);\n            float xv = cos(theta) * velocity;\n            float yv = sin(theta) * velocity;\n            float mass = ofRandom(1, 4);\n            Particle particle(x, y, mass, xv, yv);\n            ps.add(particle);\n        }\n        \n        ps.setTimeStep(.1);\n        ps.setFriction(.9);\n        ps.setCentering(.1);\n        ps.setGravitationalConstant(-100);\n        ps.setIterations(1);\n    }\n    \n    void draw(){\n        ofPushMatrix();\n        ofFill();\n        ofTranslate(ofGetWidth() \/ 2, ofGetHeight() \/ 2);\n        ps.update();\n        ps.draw();\n        ofPopMatrix();\n        \n        ofSetColor(255);\n        ofDrawBitmapString(ofToString((int) ofGetFrameRate()) + \" fps\", 32, 52);\n    }\n    \n    void keyPressed(int key){\n        if(key == 'p')\n            ofSaveFrame();\n        if(key == 'r')\n            setup();\n    }\n    \n    void mousePressed(int x, int y, int button){\n        float mass = ofRandom(1, 4);\n        Particle particle(x - ofGetWidth() \/ 2, y - ofGetHeight() \/ 2, mass);\n        ps.add(particle);\n    }\n};\n\nint main() {\n    ofSetupOpenGL(512, 512, OF_WINDOW);\n    ofRunApp(new ofApp());\n}\n<commit_msg>switched back to approximate solution<commit_after>#include \"ofMain.h\"\n#include \"ParticleSystem.h\"\n\nclass ofApp : public ofBaseApp {\npublic:\n    ParticleSystem ps;\n    \n    void setup(){\n        ofBackground(0);\n        \n        ps.clear();\n        int particleCount = 1000;\n        float size = 256;\n        \n        ps.setExact(false);\n        \n        float velocity = 1;\n        for(int i = 0; i < particleCount; i++) {\n            float x = ofRandom(-size, size);\n            float y = ofRandom(-size, size);\n            float theta = ofRandom(-PI, PI);\n            float xv = cos(theta) * velocity;\n            float yv = sin(theta) * velocity;\n            float mass = ofRandom(1, 4);\n            Particle particle(x, y, mass, xv, yv);\n            ps.add(particle);\n        }\n        \n        ps.setTimeStep(.1);\n        ps.setFriction(.9);\n        ps.setCentering(.1);\n        ps.setGravitationalConstant(-100);\n        ps.setIterations(1);\n    }\n    \n    void draw(){\n        ofPushMatrix();\n        ofFill();\n        ofTranslate(ofGetWidth() \/ 2, ofGetHeight() \/ 2);\n        ps.update();\n        ps.draw();\n        ofPopMatrix();\n        \n        ofSetColor(255);\n        ofDrawBitmapString(ofToString((int) ofGetFrameRate()) + \" fps\", 32, 52);\n    }\n    \n    void keyPressed(int key){\n        if(key == 'p')\n            ofSaveFrame();\n        if(key == 'r')\n            setup();\n    }\n    \n    void mousePressed(int x, int y, int button){\n        float mass = ofRandom(1, 4);\n        Particle particle(x - ofGetWidth() \/ 2, y - ofGetHeight() \/ 2, mass);\n        ps.add(particle);\n    }\n};\n\nint main() {\n    ofSetupOpenGL(512, 512, OF_WINDOW);\n    ofRunApp(new ofApp());\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"CommandController.hpp\"\r\n\r\n#include \"Application.hpp\"\r\n#include \"common\/SignalVector.hpp\"\r\n#include \"controllers\/accounts\/AccountController.hpp\"\r\n#include \"controllers\/commands\/Command.hpp\"\r\n#include \"controllers\/commands\/CommandModel.hpp\"\r\n#include \"debug\/Log.hpp\"\r\n#include \"messages\/Message.hpp\"\r\n#include \"messages\/MessageBuilder.hpp\"\r\n#include \"messages\/MessageElement.hpp\"\r\n#include \"providers\/twitch\/TwitchApi.hpp\"\r\n#include \"providers\/twitch\/TwitchChannel.hpp\"\r\n#include \"providers\/twitch\/TwitchServer.hpp\"\r\n#include \"singletons\/Emotes.hpp\"\r\n#include \"singletons\/Paths.hpp\"\r\n#include \"singletons\/Settings.hpp\"\r\n#include \"singletons\/Theme.hpp\"\r\n#include \"util\/CombinePath.hpp\"\r\n#include \"widgets\/dialogs\/LogsPopup.hpp\"\r\n\r\n#include <QApplication>\r\n#include <QFile>\r\n#include <QRegularExpression>\r\n\r\n#define TWITCH_DEFAULT_COMMANDS                                         \\\r\n    {                                                                   \\\r\n        \"\/help\", \"\/w\", \"\/me\", \"\/disconnect\", \"\/mods\", \"\/color\", \"\/ban\", \\\r\n            \"\/unban\", \"\/timeout\", \"\/untimeout\", \"\/slow\", \"\/slowoff\",    \\\r\n            \"\/r9kbeta\", \"\/r9kbetaoff\", \"\/emoteonly\", \"\/emoteonlyoff\",   \\\r\n            \"\/clear\", \"\/subscribers\", \"\/subscribersoff\", \"\/followers\",  \\\r\n            \"\/followersoff\"                                             \\\r\n    }\r\n\r\nnamespace {\r\nusing namespace chatterino;\r\n\r\nvoid sendWhisperMessage(const QString &text)\r\n{\r\n    auto app = getApp();\r\n    app->twitch.server->sendMessage(\"jtv\", text.simplified());\r\n}\r\n\r\nbool appendWhisperMessageLocally(const QStringList &words)\r\n{\r\n    auto app = getApp();\r\n\r\n    MessageBuilder b;\r\n\r\n    b.emplace<TimestampElement>();\r\n    b.emplace<TextElement>(app->accounts->twitch.getCurrent()->getUserName(),\r\n                           MessageElementFlag::Text, MessageColor::Text,\r\n                           FontStyle::ChatMediumBold);\r\n    b.emplace<TextElement>(\"->\", MessageElementFlag::Text,\r\n                           getApp()->themes->messages.textColors.system);\r\n    b.emplace<TextElement>(words[1] + \":\", MessageElementFlag::Text,\r\n                           MessageColor::Text, FontStyle::ChatMediumBold);\r\n\r\n    const auto &acc = app->accounts->twitch.getCurrent();\r\n    const auto &accemotes = *acc->accessEmotes();\r\n    const auto &bttvemotes = app->twitch.server->getBttvEmotes();\r\n    const auto &ffzemotes = app->twitch.server->getFfzEmotes();\r\n    auto flags = MessageElementFlags();\r\n    auto emote = boost::optional<EmotePtr>{};\r\n    for (int i = 2; i < words.length(); i++)\r\n    {\r\n        {  \/\/ twitch emote\r\n            auto it = accemotes.emotes.find({words[i]});\r\n            if (it != accemotes.emotes.end())\r\n            {\r\n                b.emplace<EmoteElement>(it->second,\r\n                                        MessageElementFlag::TwitchEmote);\r\n                continue;\r\n            }\r\n        }  \/\/ twitch emote\r\n\r\n        {  \/\/ bttv\/ffz emote\r\n            if ((emote = bttvemotes.emote({words[i]})))\r\n            {\r\n                flags = MessageElementFlag::BttvEmote;\r\n            }\r\n            else if ((emote = ffzemotes.emote({words[i]})))\r\n            {\r\n                flags = MessageElementFlag::FfzEmote;\r\n            }\r\n            if (emote)\r\n            {\r\n                b.emplace<EmoteElement>(emote.get(), flags);\r\n                continue;\r\n            }\r\n        }  \/\/ bttv\/ffz emote\r\n        {  \/\/ emoji\/text\r\n            for (auto &variant : app->emotes->emojis.parse(words[i]))\r\n            {\r\n                constexpr const static struct {\r\n                    void operator()(EmotePtr emote, MessageBuilder &b) const\r\n                    {\r\n                        b.emplace<EmoteElement>(emote,\r\n                                                MessageElementFlag::EmojiAll);\r\n                    }\r\n                    void operator()(const QString &string,\r\n                                    MessageBuilder &b) const\r\n                    {\r\n                        auto linkString = b.matchLink(string);\r\n                        if (linkString.isEmpty())\r\n                        {\r\n                            b.emplace<TextElement>(string,\r\n                                                   MessageElementFlag::Text);\r\n                        }\r\n                        else\r\n                        {\r\n                            b.addLink(string, linkString);\r\n                        }\r\n                    }\r\n                } visitor;\r\n                boost::apply_visitor([&b](auto &&arg) { visitor(arg, b); },\r\n                                     variant);\r\n            }  \/\/ emoji\/text\r\n        }\r\n    }\r\n\r\n    b->flags.set(MessageFlag::DoNotTriggerNotification);\r\n    b->flags.set(MessageFlag::Whisper);\r\n    auto messagexD = b.release();\r\n\r\n    app->twitch.server->whispersChannel->addMessage(messagexD);\r\n\r\n    auto overrideFlags = boost::optional<MessageFlags>(messagexD->flags);\r\n    overrideFlags->set(MessageFlag::DoNotLog);\r\n\r\n    if (getSettings()->inlineWhispers)\r\n    {\r\n        app->twitch.server->forEachChannel(\r\n            [&messagexD, overrideFlags](ChannelPtr _channel) {\r\n                _channel->addMessage(messagexD, overrideFlags);\r\n            });\r\n    }\r\n\r\n    return true;\r\n}\r\n\r\nbool appendWhisperMessageLocally(const QString &textNoEmoji)\r\n{\r\n    QString text = getApp()->emotes->emojis.replaceShortCodes(textNoEmoji);\r\n    QStringList words = text.split(' ', QString::SkipEmptyParts);\r\n\r\n    if (words.length() == 0)\r\n    {\r\n        return false;\r\n    }\r\n\r\n    QString commandName = words[0];\r\n\r\n    if (commandName == \"\/w\")\r\n    {\r\n        if (words.length() > 2)\r\n        {\r\n            return appendWhisperMessageLocally(words);\r\n        }\r\n    }\r\n    return false;\r\n}\r\n}  \/\/ namespace\r\n\r\nnamespace chatterino {\r\n\r\nvoid CommandController::initialize(Settings &, Paths &paths)\r\n{\r\n    \/\/ Update commands map when the vector of commands has been updated\r\n    auto addFirstMatchToMap = [this](auto args) {\r\n        this->commandsMap_.remove(args.item.name);\r\n\r\n        for (const Command &cmd : this->items_.getVector())\r\n        {\r\n            if (cmd.name == args.item.name)\r\n            {\r\n                this->commandsMap_[cmd.name] = cmd;\r\n                break;\r\n            }\r\n        }\r\n\r\n        int maxSpaces = 0;\r\n\r\n        for (const Command &cmd : this->items_.getVector())\r\n        {\r\n            auto localMaxSpaces = cmd.name.count(' ');\r\n            if (localMaxSpaces > maxSpaces)\r\n            {\r\n                maxSpaces = localMaxSpaces;\r\n            }\r\n        }\r\n\r\n        this->maxSpaces_ = maxSpaces;\r\n    };\r\n    this->items_.itemInserted.connect(addFirstMatchToMap);\r\n    this->items_.itemRemoved.connect(addFirstMatchToMap);\r\n\r\n    \/\/ Initialize setting manager for commands.json\r\n    auto path = combinePath(paths.settingsDirectory, \"commands.json\");\r\n    this->sm_ = std::make_shared<pajlada::Settings::SettingManager>();\r\n    this->sm_->setPath(path.toStdString());\r\n\r\n    \/\/ Delayed initialization of the setting storing all commands\r\n    this->commandsSetting_.reset(\r\n        new pajlada::Settings::Setting<std::vector<Command>>(\"\/commands\",\r\n                                                             this->sm_));\r\n\r\n    \/\/ Update the setting when the vector of commands has been updated (most\r\n    \/\/ likely from the settings dialog)\r\n    this->items_.delayedItemsChanged.connect([this] {  \/\/\r\n        this->commandsSetting_->setValue(this->items_.getVector());\r\n    });\r\n\r\n    \/\/ Load commands from commands.json\r\n    this->sm_->load();\r\n\r\n    \/\/ Add loaded commands to our vector of commands (which will update the map\r\n    \/\/ of commands)\r\n    for (const auto &command : this->commandsSetting_->getValue())\r\n    {\r\n        this->items_.appendItem(command);\r\n    }\r\n}\r\n\r\nvoid CommandController::save()\r\n{\r\n    this->sm_->save();\r\n}\r\n\r\nCommandModel *CommandController::createModel(QObject *parent)\r\n{\r\n    CommandModel *model = new CommandModel(parent);\r\n    model->init(&this->items_);\r\n\r\n    return model;\r\n}\r\n\r\nQString CommandController::execCommand(const QString &textNoEmoji,\r\n                                       ChannelPtr channel, bool dryRun)\r\n{\r\n    QString text = getApp()->emotes->emojis.replaceShortCodes(textNoEmoji);\r\n    QStringList words = text.split(' ', QString::SkipEmptyParts);\r\n\r\n    std::lock_guard<std::mutex> lock(this->mutex_);\r\n\r\n    if (words.length() == 0)\r\n    {\r\n        return text;\r\n    }\r\n\r\n    QString commandName = words[0];\r\n\r\n    \/\/ works in a valid twitch channel and \/whispers, etc...\r\n    if (!dryRun && channel->isTwitchChannel())\r\n    {\r\n        if (commandName == \"\/w\")\r\n        {\r\n            if (words.length() > 2)\r\n            {\r\n                appendWhisperMessageLocally(words);\r\n                sendWhisperMessage(text);\r\n            }\r\n\r\n            return \"\";\r\n        }\r\n    }\r\n\r\n    \/\/ check if default command exists\r\n    auto *twitchChannel = dynamic_cast<TwitchChannel *>(channel.get());\r\n\r\n    \/\/ works only in a valid twitch channel\r\n    if (!dryRun && twitchChannel != nullptr)\r\n    {\r\n        if (commandName == \"\/debug-args\")\r\n        {\r\n            QString msg = QApplication::instance()->arguments().join(' ');\r\n\r\n            channel->addMessage(makeSystemMessage(msg));\r\n\r\n            return \"\";\r\n        }\r\n        else if (commandName == \"\/uptime\")\r\n        {\r\n            const auto &streamStatus = twitchChannel->accessStreamStatus();\r\n\r\n            QString messageText = streamStatus->live ? streamStatus->uptime\r\n                                                     : \"Channel is not live.\";\r\n\r\n            channel->addMessage(makeSystemMessage(messageText));\r\n\r\n            return \"\";\r\n        }\r\n        else if (commandName == \"\/ignore\")\r\n        {\r\n            if (words.size() < 2)\r\n            {\r\n                channel->addMessage(makeSystemMessage(\"Usage: \/ignore [user]\"));\r\n                return \"\";\r\n            }\r\n            auto app = getApp();\r\n\r\n            auto user = app->accounts->twitch.getCurrent();\r\n            auto target = words.at(1);\r\n\r\n            if (user->isAnon())\r\n            {\r\n                channel->addMessage(makeSystemMessage(\r\n                    \"You must be logged in to ignore someone\"));\r\n                return \"\";\r\n            }\r\n\r\n            user->ignore(target,\r\n                         [channel](auto resultCode, const QString &message) {\r\n                             channel->addMessage(makeSystemMessage(message));\r\n                         });\r\n\r\n            return \"\";\r\n        }\r\n        else if (commandName == \"\/unignore\")\r\n        {\r\n            if (words.size() < 2)\r\n            {\r\n                channel->addMessage(\r\n                    makeSystemMessage(\"Usage: \/unignore [user]\"));\r\n                return \"\";\r\n            }\r\n            auto app = getApp();\r\n\r\n            auto user = app->accounts->twitch.getCurrent();\r\n            auto target = words.at(1);\r\n\r\n            if (user->isAnon())\r\n            {\r\n                channel->addMessage(makeSystemMessage(\r\n                    \"You must be logged in to ignore someone\"));\r\n                return \"\";\r\n            }\r\n\r\n            user->unignore(target,\r\n                           [channel](auto resultCode, const QString &message) {\r\n                               channel->addMessage(makeSystemMessage(message));\r\n                           });\r\n\r\n            return \"\";\r\n        }\r\n        else if (commandName == \"\/follow\")\r\n        {\r\n            if (words.size() < 2)\r\n            {\r\n                channel->addMessage(makeSystemMessage(\"Usage: \/follow [user]\"));\r\n                return \"\";\r\n            }\r\n            auto app = getApp();\r\n\r\n            auto user = app->accounts->twitch.getCurrent();\r\n            auto target = words.at(1);\r\n\r\n            if (user->isAnon())\r\n            {\r\n                channel->addMessage(makeSystemMessage(\r\n                    \"You must be logged in to follow someone\"));\r\n                return \"\";\r\n            }\r\n\r\n            TwitchApi::findUserId(\r\n                target, [user, channel, target](QString userId) {\r\n                    if (userId.isEmpty())\r\n                    {\r\n                        channel->addMessage(makeSystemMessage(\r\n                            \"User \" + target + \" could not be followed!\"));\r\n                        return;\r\n                    }\r\n                    user->followUser(userId, [channel, target]() {\r\n                        channel->addMessage(makeSystemMessage(\r\n                            \"You successfully followed \" + target));\r\n                    });\r\n                });\r\n\r\n            return \"\";\r\n        }\r\n        else if (commandName == \"\/unfollow\")\r\n        {\r\n            if (words.size() < 2)\r\n            {\r\n                channel->addMessage(\r\n                    makeSystemMessage(\"Usage: \/unfollow [user]\"));\r\n                return \"\";\r\n            }\r\n            auto app = getApp();\r\n\r\n            auto user = app->accounts->twitch.getCurrent();\r\n            auto target = words.at(1);\r\n\r\n            if (user->isAnon())\r\n            {\r\n                channel->addMessage(makeSystemMessage(\r\n                    \"You must be logged in to follow someone\"));\r\n                return \"\";\r\n            }\r\n\r\n            TwitchApi::findUserId(\r\n                target, [user, channel, target](QString userId) {\r\n                    if (userId.isEmpty())\r\n                    {\r\n                        channel->addMessage(makeSystemMessage(\r\n                            \"User \" + target + \" could not be followed!\"));\r\n                        return;\r\n                    }\r\n                    user->unfollowUser(userId, [channel, target]() {\r\n                        channel->addMessage(makeSystemMessage(\r\n                            \"You successfully unfollowed \" + target));\r\n                    });\r\n                });\r\n\r\n            return \"\";\r\n        }\r\n        else if (commandName == \"\/logs\")\r\n        {\r\n            if (words.size() < 2)\r\n            {\r\n                channel->addMessage(\r\n                    makeSystemMessage(\"Usage: \/logs [user] (channel)\"));\r\n                return \"\";\r\n            }\r\n            auto app = getApp();\r\n\r\n            auto logs = new LogsPopup();\r\n            QString target = words.at(1);\r\n\r\n            if (target.at(0) == '@')\r\n            {\r\n                target = target.mid(1);\r\n            }\r\n\r\n            logs->setTargetUserName(target);\r\n\r\n            std::shared_ptr<Channel> logsChannel = channel;\r\n\r\n            if (words.size() == 3)\r\n            {\r\n                QString channelName = words.at(2);\r\n                if (words.at(2).at(0) == '#')\r\n                {\r\n                    channelName = channelName.mid(1);\r\n                }\r\n\r\n                logs->setChannelName(channelName);\r\n\r\n                logsChannel =\r\n                    app->twitch.server->getChannelOrEmpty(channelName);\r\n            }\r\n\r\n            logs->setChannel(logsChannel);\r\n\r\n            logs->getLogs();\r\n            logs->setAttribute(Qt::WA_DeleteOnClose);\r\n            logs->show();\r\n            return \"\";\r\n        }\r\n    }\r\n\r\n    \/\/ check if custom command exists\r\n    auto it = this->commandsMap_.find(commandName);\r\n    if (it != this->commandsMap_.end())\r\n    {\r\n        return this->execCustomCommand(words, it.value(), dryRun);\r\n    }\r\n\r\n    auto maxSpaces = std::min(this->maxSpaces_, words.length() - 1);\r\n    for (int i = 0; i < maxSpaces; ++i)\r\n    {\r\n        commandName += ' ' + words[i + 1];\r\n\r\n        auto it = this->commandsMap_.find(commandName);\r\n        if (it != this->commandsMap_.end())\r\n        {\r\n            return this->execCustomCommand(words, it.value(), dryRun);\r\n        }\r\n    }\r\n\r\n    return text;\r\n}\r\n\r\nQString CommandController::execCustomCommand(const QStringList &words,\r\n                                             const Command &command,\r\n                                             bool dryRun)\r\n{\r\n    QString result;\r\n\r\n    static QRegularExpression parseCommand(\"(^|[^{])({{)*{(\\\\d+\\\\+?)}\");\r\n\r\n    int lastCaptureEnd = 0;\r\n\r\n    auto globalMatch = parseCommand.globalMatch(command.func);\r\n    int matchOffset = 0;\r\n\r\n    while (true)\r\n    {\r\n        QRegularExpressionMatch match =\r\n            parseCommand.match(command.func, matchOffset);\r\n\r\n        if (!match.hasMatch())\r\n        {\r\n            break;\r\n        }\r\n\r\n        result += command.func.mid(lastCaptureEnd,\r\n                                   match.capturedStart() - lastCaptureEnd + 1);\r\n\r\n        lastCaptureEnd = match.capturedEnd();\r\n        matchOffset = lastCaptureEnd - 1;\r\n\r\n        QString wordIndexMatch = match.captured(3);\r\n\r\n        bool plus = wordIndexMatch.at(wordIndexMatch.size() - 1) == '+';\r\n        wordIndexMatch = wordIndexMatch.replace(\"+\", \"\");\r\n\r\n        bool ok;\r\n        int wordIndex = wordIndexMatch.replace(\"=\", \"\").toInt(&ok);\r\n        if (!ok || wordIndex == 0)\r\n        {\r\n            result += \"{\" + match.captured(3) + \"}\";\r\n            continue;\r\n        }\r\n\r\n        if (words.length() <= wordIndex)\r\n        {\r\n            continue;\r\n        }\r\n\r\n        if (plus)\r\n        {\r\n            bool first = true;\r\n            for (int i = wordIndex; i < words.length(); i++)\r\n            {\r\n                if (!first)\r\n                {\r\n                    result += \" \";\r\n                }\r\n                result += words[i];\r\n                first = false;\r\n            }\r\n        }\r\n        else\r\n        {\r\n            result += words[wordIndex];\r\n        }\r\n    }\r\n\r\n    result += command.func.mid(lastCaptureEnd);\r\n\r\n    if (result.size() > 0 && result.at(0) == '{')\r\n    {\r\n        result = result.mid(1);\r\n    }\r\n\r\n    auto res = result.replace(\"{{\", \"{\");\r\n\r\n    if (dryRun)\r\n    {\r\n        return res;\r\n    }\r\n\r\n    return appendWhisperMessageLocally(res) ? (sendWhisperMessage(res), \"\")\r\n                                            : res;\r\n}\r\n\r\nQStringList CommandController::getDefaultTwitchCommandList()\r\n{\r\n    QStringList l = TWITCH_DEFAULT_COMMANDS;\r\n    l += \"\/uptime\";\r\n\r\n    return l;\r\n}\r\n\r\n}  \/\/ namespace chatterino\r\n<commit_msg>fix comments<commit_after>#include \"CommandController.hpp\"\r\n\r\n#include \"Application.hpp\"\r\n#include \"common\/SignalVector.hpp\"\r\n#include \"controllers\/accounts\/AccountController.hpp\"\r\n#include \"controllers\/commands\/Command.hpp\"\r\n#include \"controllers\/commands\/CommandModel.hpp\"\r\n#include \"debug\/Log.hpp\"\r\n#include \"messages\/Message.hpp\"\r\n#include \"messages\/MessageBuilder.hpp\"\r\n#include \"messages\/MessageElement.hpp\"\r\n#include \"providers\/twitch\/TwitchApi.hpp\"\r\n#include \"providers\/twitch\/TwitchChannel.hpp\"\r\n#include \"providers\/twitch\/TwitchServer.hpp\"\r\n#include \"singletons\/Emotes.hpp\"\r\n#include \"singletons\/Paths.hpp\"\r\n#include \"singletons\/Settings.hpp\"\r\n#include \"singletons\/Theme.hpp\"\r\n#include \"util\/CombinePath.hpp\"\r\n#include \"widgets\/dialogs\/LogsPopup.hpp\"\r\n\r\n#include <QApplication>\r\n#include <QFile>\r\n#include <QRegularExpression>\r\n\r\n#define TWITCH_DEFAULT_COMMANDS                                         \\\r\n    {                                                                   \\\r\n        \"\/help\", \"\/w\", \"\/me\", \"\/disconnect\", \"\/mods\", \"\/color\", \"\/ban\", \\\r\n            \"\/unban\", \"\/timeout\", \"\/untimeout\", \"\/slow\", \"\/slowoff\",    \\\r\n            \"\/r9kbeta\", \"\/r9kbetaoff\", \"\/emoteonly\", \"\/emoteonlyoff\",   \\\r\n            \"\/clear\", \"\/subscribers\", \"\/subscribersoff\", \"\/followers\",  \\\r\n            \"\/followersoff\"                                             \\\r\n    }\r\n\r\nnamespace {\r\nusing namespace chatterino;\r\n\r\nstatic const QStringList whisperCommands{\"\/w\", \".w\"};\r\n\r\nvoid sendWhisperMessage(const QString &text)\r\n{\r\n    \/\/ (hemirt) pajlada: \"we should not be sending whispers through jtv, but\r\n    \/\/ rather to your own username\"\r\n    auto app = getApp();\r\n    app->twitch.server->sendMessage(\"jtv\", text.simplified());\r\n}\r\n\r\nbool appendWhisperMessageWordsLocally(const QStringList &words)\r\n{\r\n    auto app = getApp();\r\n\r\n    MessageBuilder b;\r\n\r\n    b.emplace<TimestampElement>();\r\n    b.emplace<TextElement>(app->accounts->twitch.getCurrent()->getUserName(),\r\n                           MessageElementFlag::Text, MessageColor::Text,\r\n                           FontStyle::ChatMediumBold);\r\n    b.emplace<TextElement>(\"->\", MessageElementFlag::Text,\r\n                           getApp()->themes->messages.textColors.system);\r\n    b.emplace<TextElement>(words[1] + \":\", MessageElementFlag::Text,\r\n                           MessageColor::Text, FontStyle::ChatMediumBold);\r\n\r\n    const auto &acc = app->accounts->twitch.getCurrent();\r\n    const auto &accemotes = *acc->accessEmotes();\r\n    const auto &bttvemotes = app->twitch.server->getBttvEmotes();\r\n    const auto &ffzemotes = app->twitch.server->getFfzEmotes();\r\n    auto flags = MessageElementFlags();\r\n    auto emote = boost::optional<EmotePtr>{};\r\n    for (int i = 2; i < words.length(); i++)\r\n    {\r\n        {  \/\/ twitch emote\r\n            auto it = accemotes.emotes.find({words[i]});\r\n            if (it != accemotes.emotes.end())\r\n            {\r\n                b.emplace<EmoteElement>(it->second,\r\n                                        MessageElementFlag::TwitchEmote);\r\n                continue;\r\n            }\r\n        }  \/\/ twitch emote\r\n\r\n        {  \/\/ bttv\/ffz emote\r\n            if ((emote = bttvemotes.emote({words[i]})))\r\n            {\r\n                flags = MessageElementFlag::BttvEmote;\r\n            }\r\n            else if ((emote = ffzemotes.emote({words[i]})))\r\n            {\r\n                flags = MessageElementFlag::FfzEmote;\r\n            }\r\n            if (emote)\r\n            {\r\n                b.emplace<EmoteElement>(emote.get(), flags);\r\n                continue;\r\n            }\r\n        }  \/\/ bttv\/ffz emote\r\n        {  \/\/ emoji\/text\r\n            for (auto &variant : app->emotes->emojis.parse(words[i]))\r\n            {\r\n                constexpr const static struct {\r\n                    void operator()(EmotePtr emote, MessageBuilder &b) const\r\n                    {\r\n                        b.emplace<EmoteElement>(emote,\r\n                                                MessageElementFlag::EmojiAll);\r\n                    }\r\n                    void operator()(const QString &string,\r\n                                    MessageBuilder &b) const\r\n                    {\r\n                        auto linkString = b.matchLink(string);\r\n                        if (linkString.isEmpty())\r\n                        {\r\n                            b.emplace<TextElement>(string,\r\n                                                   MessageElementFlag::Text);\r\n                        }\r\n                        else\r\n                        {\r\n                            b.addLink(string, linkString);\r\n                        }\r\n                    }\r\n                } visitor;\r\n                boost::apply_visitor([&b](auto &&arg) { visitor(arg, b); },\r\n                                     variant);\r\n            }  \/\/ emoji\/text\r\n        }\r\n    }\r\n\r\n    b->flags.set(MessageFlag::DoNotTriggerNotification);\r\n    b->flags.set(MessageFlag::Whisper);\r\n    auto messagexD = b.release();\r\n\r\n    app->twitch.server->whispersChannel->addMessage(messagexD);\r\n\r\n    auto overrideFlags = boost::optional<MessageFlags>(messagexD->flags);\r\n    overrideFlags->set(MessageFlag::DoNotLog);\r\n\r\n    if (getSettings()->inlineWhispers)\r\n    {\r\n        app->twitch.server->forEachChannel(\r\n            [&messagexD, overrideFlags](ChannelPtr _channel) {\r\n                _channel->addMessage(messagexD, overrideFlags);\r\n            });\r\n    }\r\n\r\n    return true;\r\n}\r\n\r\nbool appendWhisperMessageStringLocally(const QString &textNoEmoji)\r\n{\r\n    QString text = getApp()->emotes->emojis.replaceShortCodes(textNoEmoji);\r\n    QStringList words = text.split(' ', QString::SkipEmptyParts);\r\n\r\n    if (words.length() == 0)\r\n    {\r\n        return false;\r\n    }\r\n\r\n    QString commandName = words[0];\r\n\r\n    if (whisperCommands.contains(commandName, Qt::CaseInsensitive))\r\n    {\r\n        if (words.length() > 2)\r\n        {\r\n            return appendWhisperMessageWordsLocally(words);\r\n        }\r\n    }\r\n    return false;\r\n}\r\n}  \/\/ namespace\r\n\r\nnamespace chatterino {\r\n\r\nvoid CommandController::initialize(Settings &, Paths &paths)\r\n{\r\n    \/\/ Update commands map when the vector of commands has been updated\r\n    auto addFirstMatchToMap = [this](auto args) {\r\n        this->commandsMap_.remove(args.item.name);\r\n\r\n        for (const Command &cmd : this->items_.getVector())\r\n        {\r\n            if (cmd.name == args.item.name)\r\n            {\r\n                this->commandsMap_[cmd.name] = cmd;\r\n                break;\r\n            }\r\n        }\r\n\r\n        int maxSpaces = 0;\r\n\r\n        for (const Command &cmd : this->items_.getVector())\r\n        {\r\n            auto localMaxSpaces = cmd.name.count(' ');\r\n            if (localMaxSpaces > maxSpaces)\r\n            {\r\n                maxSpaces = localMaxSpaces;\r\n            }\r\n        }\r\n\r\n        this->maxSpaces_ = maxSpaces;\r\n    };\r\n    this->items_.itemInserted.connect(addFirstMatchToMap);\r\n    this->items_.itemRemoved.connect(addFirstMatchToMap);\r\n\r\n    \/\/ Initialize setting manager for commands.json\r\n    auto path = combinePath(paths.settingsDirectory, \"commands.json\");\r\n    this->sm_ = std::make_shared<pajlada::Settings::SettingManager>();\r\n    this->sm_->setPath(path.toStdString());\r\n\r\n    \/\/ Delayed initialization of the setting storing all commands\r\n    this->commandsSetting_.reset(\r\n        new pajlada::Settings::Setting<std::vector<Command>>(\"\/commands\",\r\n                                                             this->sm_));\r\n\r\n    \/\/ Update the setting when the vector of commands has been updated (most\r\n    \/\/ likely from the settings dialog)\r\n    this->items_.delayedItemsChanged.connect([this] {  \/\/\r\n        this->commandsSetting_->setValue(this->items_.getVector());\r\n    });\r\n\r\n    \/\/ Load commands from commands.json\r\n    this->sm_->load();\r\n\r\n    \/\/ Add loaded commands to our vector of commands (which will update the map\r\n    \/\/ of commands)\r\n    for (const auto &command : this->commandsSetting_->getValue())\r\n    {\r\n        this->items_.appendItem(command);\r\n    }\r\n}\r\n\r\nvoid CommandController::save()\r\n{\r\n    this->sm_->save();\r\n}\r\n\r\nCommandModel *CommandController::createModel(QObject *parent)\r\n{\r\n    CommandModel *model = new CommandModel(parent);\r\n    model->init(&this->items_);\r\n\r\n    return model;\r\n}\r\n\r\nQString CommandController::execCommand(const QString &textNoEmoji,\r\n                                       ChannelPtr channel, bool dryRun)\r\n{\r\n    QString text = getApp()->emotes->emojis.replaceShortCodes(textNoEmoji);\r\n    QStringList words = text.split(' ', QString::SkipEmptyParts);\r\n\r\n    std::lock_guard<std::mutex> lock(this->mutex_);\r\n\r\n    if (words.length() == 0)\r\n    {\r\n        return text;\r\n    }\r\n\r\n    QString commandName = words[0];\r\n\r\n    \/\/ works in a valid twitch channel and \/whispers, etc...\r\n    if (!dryRun && channel->isTwitchChannel())\r\n    {\r\n        if (whisperCommands.contains(commandName, Qt::CaseInsensitive))\r\n        {\r\n            if (words.length() > 2)\r\n            {\r\n                appendWhisperMessageWordsLocally(words);\r\n                sendWhisperMessage(text);\r\n            }\r\n\r\n            return \"\";\r\n        }\r\n    }\r\n\r\n    \/\/ check if default command exists\r\n    auto *twitchChannel = dynamic_cast<TwitchChannel *>(channel.get());\r\n\r\n    \/\/ works only in a valid twitch channel\r\n    if (!dryRun && twitchChannel != nullptr)\r\n    {\r\n        if (commandName == \"\/debug-args\")\r\n        {\r\n            QString msg = QApplication::instance()->arguments().join(' ');\r\n\r\n            channel->addMessage(makeSystemMessage(msg));\r\n\r\n            return \"\";\r\n        }\r\n        else if (commandName == \"\/uptime\")\r\n        {\r\n            const auto &streamStatus = twitchChannel->accessStreamStatus();\r\n\r\n            QString messageText = streamStatus->live ? streamStatus->uptime\r\n                                                     : \"Channel is not live.\";\r\n\r\n            channel->addMessage(makeSystemMessage(messageText));\r\n\r\n            return \"\";\r\n        }\r\n        else if (commandName == \"\/ignore\")\r\n        {\r\n            if (words.size() < 2)\r\n            {\r\n                channel->addMessage(makeSystemMessage(\"Usage: \/ignore [user]\"));\r\n                return \"\";\r\n            }\r\n            auto app = getApp();\r\n\r\n            auto user = app->accounts->twitch.getCurrent();\r\n            auto target = words.at(1);\r\n\r\n            if (user->isAnon())\r\n            {\r\n                channel->addMessage(makeSystemMessage(\r\n                    \"You must be logged in to ignore someone\"));\r\n                return \"\";\r\n            }\r\n\r\n            user->ignore(target,\r\n                         [channel](auto resultCode, const QString &message) {\r\n                             channel->addMessage(makeSystemMessage(message));\r\n                         });\r\n\r\n            return \"\";\r\n        }\r\n        else if (commandName == \"\/unignore\")\r\n        {\r\n            if (words.size() < 2)\r\n            {\r\n                channel->addMessage(\r\n                    makeSystemMessage(\"Usage: \/unignore [user]\"));\r\n                return \"\";\r\n            }\r\n            auto app = getApp();\r\n\r\n            auto user = app->accounts->twitch.getCurrent();\r\n            auto target = words.at(1);\r\n\r\n            if (user->isAnon())\r\n            {\r\n                channel->addMessage(makeSystemMessage(\r\n                    \"You must be logged in to ignore someone\"));\r\n                return \"\";\r\n            }\r\n\r\n            user->unignore(target,\r\n                           [channel](auto resultCode, const QString &message) {\r\n                               channel->addMessage(makeSystemMessage(message));\r\n                           });\r\n\r\n            return \"\";\r\n        }\r\n        else if (commandName == \"\/follow\")\r\n        {\r\n            if (words.size() < 2)\r\n            {\r\n                channel->addMessage(makeSystemMessage(\"Usage: \/follow [user]\"));\r\n                return \"\";\r\n            }\r\n            auto app = getApp();\r\n\r\n            auto user = app->accounts->twitch.getCurrent();\r\n            auto target = words.at(1);\r\n\r\n            if (user->isAnon())\r\n            {\r\n                channel->addMessage(makeSystemMessage(\r\n                    \"You must be logged in to follow someone\"));\r\n                return \"\";\r\n            }\r\n\r\n            TwitchApi::findUserId(\r\n                target, [user, channel, target](QString userId) {\r\n                    if (userId.isEmpty())\r\n                    {\r\n                        channel->addMessage(makeSystemMessage(\r\n                            \"User \" + target + \" could not be followed!\"));\r\n                        return;\r\n                    }\r\n                    user->followUser(userId, [channel, target]() {\r\n                        channel->addMessage(makeSystemMessage(\r\n                            \"You successfully followed \" + target));\r\n                    });\r\n                });\r\n\r\n            return \"\";\r\n        }\r\n        else if (commandName == \"\/unfollow\")\r\n        {\r\n            if (words.size() < 2)\r\n            {\r\n                channel->addMessage(\r\n                    makeSystemMessage(\"Usage: \/unfollow [user]\"));\r\n                return \"\";\r\n            }\r\n            auto app = getApp();\r\n\r\n            auto user = app->accounts->twitch.getCurrent();\r\n            auto target = words.at(1);\r\n\r\n            if (user->isAnon())\r\n            {\r\n                channel->addMessage(makeSystemMessage(\r\n                    \"You must be logged in to follow someone\"));\r\n                return \"\";\r\n            }\r\n\r\n            TwitchApi::findUserId(\r\n                target, [user, channel, target](QString userId) {\r\n                    if (userId.isEmpty())\r\n                    {\r\n                        channel->addMessage(makeSystemMessage(\r\n                            \"User \" + target + \" could not be followed!\"));\r\n                        return;\r\n                    }\r\n                    user->unfollowUser(userId, [channel, target]() {\r\n                        channel->addMessage(makeSystemMessage(\r\n                            \"You successfully unfollowed \" + target));\r\n                    });\r\n                });\r\n\r\n            return \"\";\r\n        }\r\n        else if (commandName == \"\/logs\")\r\n        {\r\n            if (words.size() < 2)\r\n            {\r\n                channel->addMessage(\r\n                    makeSystemMessage(\"Usage: \/logs [user] (channel)\"));\r\n                return \"\";\r\n            }\r\n            auto app = getApp();\r\n\r\n            auto logs = new LogsPopup();\r\n            QString target = words.at(1);\r\n\r\n            if (target.at(0) == '@')\r\n            {\r\n                target = target.mid(1);\r\n            }\r\n\r\n            logs->setTargetUserName(target);\r\n\r\n            std::shared_ptr<Channel> logsChannel = channel;\r\n\r\n            if (words.size() == 3)\r\n            {\r\n                QString channelName = words.at(2);\r\n                if (words.at(2).at(0) == '#')\r\n                {\r\n                    channelName = channelName.mid(1);\r\n                }\r\n\r\n                logs->setChannelName(channelName);\r\n\r\n                logsChannel =\r\n                    app->twitch.server->getChannelOrEmpty(channelName);\r\n            }\r\n\r\n            logs->setChannel(logsChannel);\r\n\r\n            logs->getLogs();\r\n            logs->setAttribute(Qt::WA_DeleteOnClose);\r\n            logs->show();\r\n            return \"\";\r\n        }\r\n    }\r\n\r\n    \/\/ check if custom command exists\r\n    auto it = this->commandsMap_.find(commandName);\r\n    if (it != this->commandsMap_.end())\r\n    {\r\n        return this->execCustomCommand(words, it.value(), dryRun);\r\n    }\r\n\r\n    auto maxSpaces = std::min(this->maxSpaces_, words.length() - 1);\r\n    for (int i = 0; i < maxSpaces; ++i)\r\n    {\r\n        commandName += ' ' + words[i + 1];\r\n\r\n        auto it = this->commandsMap_.find(commandName);\r\n        if (it != this->commandsMap_.end())\r\n        {\r\n            return this->execCustomCommand(words, it.value(), dryRun);\r\n        }\r\n    }\r\n\r\n    return text;\r\n}\r\n\r\nQString CommandController::execCustomCommand(const QStringList &words,\r\n                                             const Command &command,\r\n                                             bool dryRun)\r\n{\r\n    QString result;\r\n\r\n    static QRegularExpression parseCommand(\"(^|[^{])({{)*{(\\\\d+\\\\+?)}\");\r\n\r\n    int lastCaptureEnd = 0;\r\n\r\n    auto globalMatch = parseCommand.globalMatch(command.func);\r\n    int matchOffset = 0;\r\n\r\n    while (true)\r\n    {\r\n        QRegularExpressionMatch match =\r\n            parseCommand.match(command.func, matchOffset);\r\n\r\n        if (!match.hasMatch())\r\n        {\r\n            break;\r\n        }\r\n\r\n        result += command.func.mid(lastCaptureEnd,\r\n                                   match.capturedStart() - lastCaptureEnd + 1);\r\n\r\n        lastCaptureEnd = match.capturedEnd();\r\n        matchOffset = lastCaptureEnd - 1;\r\n\r\n        QString wordIndexMatch = match.captured(3);\r\n\r\n        bool plus = wordIndexMatch.at(wordIndexMatch.size() - 1) == '+';\r\n        wordIndexMatch = wordIndexMatch.replace(\"+\", \"\");\r\n\r\n        bool ok;\r\n        int wordIndex = wordIndexMatch.replace(\"=\", \"\").toInt(&ok);\r\n        if (!ok || wordIndex == 0)\r\n        {\r\n            result += \"{\" + match.captured(3) + \"}\";\r\n            continue;\r\n        }\r\n\r\n        if (words.length() <= wordIndex)\r\n        {\r\n            continue;\r\n        }\r\n\r\n        if (plus)\r\n        {\r\n            bool first = true;\r\n            for (int i = wordIndex; i < words.length(); i++)\r\n            {\r\n                if (!first)\r\n                {\r\n                    result += \" \";\r\n                }\r\n                result += words[i];\r\n                first = false;\r\n            }\r\n        }\r\n        else\r\n        {\r\n            result += words[wordIndex];\r\n        }\r\n    }\r\n\r\n    result += command.func.mid(lastCaptureEnd);\r\n\r\n    if (result.size() > 0 && result.at(0) == '{')\r\n    {\r\n        result = result.mid(1);\r\n    }\r\n\r\n    auto res = result.replace(\"{{\", \"{\");\r\n\r\n    if (dryRun || !appendWhisperMessageStringLocally(res))\r\n    {\r\n        return res;\r\n    }\r\n    else\r\n    {\r\n        sendWhisperMessage(res);\r\n        return \"\";\r\n    }\r\n}\r\n\r\nQStringList CommandController::getDefaultTwitchCommandList()\r\n{\r\n    QStringList l = TWITCH_DEFAULT_COMMANDS;\r\n    l += \"\/uptime\";\r\n\r\n    return l;\r\n}\r\n\r\n}  \/\/ namespace chatterino\r\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: EncryptionData.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: mtg $ $Date: 2001-09-05 19:29: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): Martin Gallwey (gallwey@sun.com)\n *\n *\n ************************************************************************\/\n#ifndef _ENCRYPTION_DATA_HXX_\n#define _ENCRYPTION_DATA_HXX_\n\n#ifndef _COM_SUN_STAR_UNO_SEQUENCE_HXX_\n#include <com\/sun\/star\/uno\/Sequence.hxx>\n#endif\n#ifndef _CPPUHELPER_WEAK_HXX_\n#include <cppuhelper\/weak.hxx>\n#endif\n\nclass EncryptionData : public cppu::OWeakObject\n{\npublic:\n    \/\/ On export aKey holds the derived key\n    \/\/ On import aKey holds the hash of the user enterred key\n    com::sun::star::uno::Sequence < sal_Int8 > aKey;\n    com::sun::star::uno::Sequence < sal_uInt8 > aSalt, aInitVector, aDigest;\n    sal_Int32 nIterationCount;\n    EncryptionData(): nIterationCount ( 0 ){}\n};\n#endif\n<commit_msg>INTEGRATION: CWS ooo19126 (1.3.220); FILE MERGED 2005\/09\/05 18:49:00 rt 1.3.220.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: EncryptionData.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 15:55: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 _ENCRYPTION_DATA_HXX_\n#define _ENCRYPTION_DATA_HXX_\n\n#ifndef _COM_SUN_STAR_UNO_SEQUENCE_HXX_\n#include <com\/sun\/star\/uno\/Sequence.hxx>\n#endif\n#ifndef _CPPUHELPER_WEAK_HXX_\n#include <cppuhelper\/weak.hxx>\n#endif\n\nclass EncryptionData : public cppu::OWeakObject\n{\npublic:\n    \/\/ On export aKey holds the derived key\n    \/\/ On import aKey holds the hash of the user enterred key\n    com::sun::star::uno::Sequence < sal_Int8 > aKey;\n    com::sun::star::uno::Sequence < sal_uInt8 > aSalt, aInitVector, aDigest;\n    sal_Int32 nIterationCount;\n    EncryptionData(): nIterationCount ( 0 ){}\n};\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n\nCopyright (c) 2010, Anton Petersson < anton (at) anp.nu >\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n    * Redistributions of source code must retain the above copyright\n      notice, this list of conditions and the following disclaimer.\n    * Redistributions in binary form must reproduce the above copyright\n      notice, this list of conditions and the following disclaimer in the\n      documentation and\/or other materials provided with the distribution.\n\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 <COPYRIGHT HOLDER> BE LIABLE FOR ANY\nDIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\nLOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\nON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n\/**\n * @file anp_jobqueue.cpp\n * Implementation of the job queue system.\n *\/\n\n#include \"..\/anp_jobqueue.h\"\n\n#include <iostream> \/\/ ETODO REMOVE THIS SHIT!\n\nnamespace anp\n{\nnamespace threading\n{\n\t\n\tJob::Job():\n\tm_status(JOBSTATUS_CREATED)\n\t{\n\t\t\n\t}\n\t\n\tJob::~Job()\n\t{\n\t\t\/\/\/ @todo If m_status == JOBSTATUS_EXECUTING,\n\t\t\/\/\/ thread.join() !\n\t}\n\t\n\tvoid Job::execute()\n\t{\n\t\tm_status = JOBSTATUS_EXECUTING;\n\t\texecuteCustom();\n\t}\n\t\n\tJob::JobStatus Job::getStatus() const\n\t{\n\t\treturn m_status;\n\t}\n\t\n\t\n\tJobQueue::JobQueue():\n\tm_dying(0)\n\t{\n\t\t\n\t}\n\n\tJobQueue::~JobQueue()\n\t{\n\t\t\n\t}\n\t\n\tvoid JobQueue::start()\n\t{\n\t\tfor ( uint32 i=0; i<MAX_THREADS; ++i )\n\t\t{\n\t\t\tm_workers[i].start(this);\n\t\t}\n\t}\n\t\n\tvoid JobQueue::stopWait()\n\t{\n\t\tWorkerThread *worker = NULL;\n\t\tm_dyingMutex.lock();\n\t\tm_dying = 1;\n\t\tm_dyingMutex.unlock();\n\t\tfor ( uint32 i=0; i<MAX_THREADS; ++i )\n\t\t{\n\t\t\tworker = m_workers+i;\n\t\t\tworker->stop(); \/\/ Raise dying flag\n\t\t}\n\t\t\n\t\tm_newJobEvent.signalBroadcast(); \/\/ Wake up all workers\n\t\tfor ( uint32 i=0; i<MAX_THREADS; ++i )\n\t\t{\n\t\t\tworker = m_workers+i;\n\t\t\tm_workers->join(); \/\/ Wait for it to finish\t\t\t\n\t\t}\n\t\t\n\t\t\/\/ All workers have been stopped\n\t\t\/\/ so it is safe to clean up the queue\n\t\t\/\/ without locking it\n\t\tJob *job = NULL;\n\t\twhile ( !m_queue.empty() )\n\t\t{\n\t\t\tstd::cout << \"Cleaning up unperformed job.\" << std::endl;\n\t\t\tjob = m_queue.front();\n\t\t\tm_queue.pop();\n\t\t\tdelete job;\n\t\t\tjob = NULL;\n\t\t}\n\t}\n\t\n\tvoid JobQueue::waitForJobsToBeCompleted()\n\t{\n\t\tm_jobQueueMutex.lock();\n\t\twhile ( !m_queue.empty() )\n\t\t{\n\t\t\tm_jobQueueMutex.unlock();\n\t\t\tm_jobsCompleted.wait();\n\t\t\tm_jobQueueMutex.lock();\n\t\t}\n\t\tm_jobQueueMutex.unlock();\n\t}\n\t\n\tbool32 JobQueue::waitForJob(Job **job)\n\t{\n\t\tuint32 dying = 0;\n\t\t\n\t\t*job = NULL;\n\t\t\n\t\tm_jobQueueMutex.lock();\n\n\t\t\/\/ Wait for a job to be added to the queue\n\t\t\/\/ (but what if there are already jobs in the queue?)\n\t\twhile ( m_queue.empty() ) {\n\t\t\tm_jobQueueMutex.unlock();\n\t\t\t\/\/\/ @todo Spurious wakeups; Is there really a new job?\n\t\t\tm_newJobEvent.wait();\n\t\t\t\/\/ Here, just in between the wait and acquire calls,\n\t\t\t\/\/ we can't lose the job to another thread. Only\n\t\t\t\/\/ one is released upon a signal().\n\t\t\t\/\/   However, spurious wakeups can happen, so check anyway.\n\t\t\tm_dyingMutex.lock();\n\t\t\tdying = m_dying;\n\t\t\tm_dyingMutex.unlock();\n\t\t\tif ( 1 == dying )\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\tm_jobQueueMutex.lock();\n\t\t}\n\n\t\t*job = m_queue.front();\n\t\tm_queue.pop();\n\t\tif ( m_queue.empty() )\n\t\t{\n\t\t\tm_jobsCompleted.signal();\n\t\t}\n\t\tm_jobQueueMutex.unlock();\n\t\t\n\t\treturn true;\n\t}\n\t\n\tvoid JobQueue::addJob(Job *job)\n\t{\n\t\tbool32 empty = false;\n\t\t\n\t\tm_jobQueueMutex.lock();\n\t\tm_queue.push(job);\n\t\t\/\/empty = m_queue.empty();\n\t\tm_jobQueueMutex.unlock();\n\t\t\n\t\t\/\/if ( empty )\n\t\t\/\/{\n\/\/\t\t\tm_newJobEvent.signal();\n\t\t\/\/}\n\t\tm_newJobEvent.signal();\n\t}\n\t\n} \/\/ namespace threading\n} \/\/ namespace anp\n<commit_msg>Remove iostream inclusion.<commit_after>\/*\n\nCopyright (c) 2010, Anton Petersson < anton (at) anp.nu >\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n    * Redistributions of source code must retain the above copyright\n      notice, this list of conditions and the following disclaimer.\n    * Redistributions in binary form must reproduce the above copyright\n      notice, this list of conditions and the following disclaimer in the\n      documentation and\/or other materials provided with the distribution.\n\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 <COPYRIGHT HOLDER> BE LIABLE FOR ANY\nDIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\nLOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\nON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n\/**\n * @file anp_jobqueue.cpp\n * Implementation of the job queue system.\n *\/\n\n#include \"..\/anp_jobqueue.h\"\n\nnamespace anp\n{\nnamespace threading\n{\n\t\n\tJob::Job():\n\tm_status(JOBSTATUS_CREATED)\n\t{\n\t\t\n\t}\n\t\n\tJob::~Job()\n\t{\n\t\t\/\/\/ @todo If m_status == JOBSTATUS_EXECUTING,\n\t\t\/\/\/ thread.join() !\n\t}\n\t\n\tvoid Job::execute()\n\t{\n\t\tm_status = JOBSTATUS_EXECUTING;\n\t\texecuteCustom();\n\t}\n\t\n\tJob::JobStatus Job::getStatus() const\n\t{\n\t\treturn m_status;\n\t}\n\t\n\t\n\tJobQueue::JobQueue():\n\tm_dying(0)\n\t{\n\t\t\n\t}\n\n\tJobQueue::~JobQueue()\n\t{\n\t\t\n\t}\n\t\n\tvoid JobQueue::start()\n\t{\n\t\tfor ( uint32 i=0; i<MAX_THREADS; ++i )\n\t\t{\n\t\t\tm_workers[i].start(this);\n\t\t}\n\t}\n\t\n\tvoid JobQueue::stopWait()\n\t{\n\t\tWorkerThread *worker = NULL;\n\t\tm_dyingMutex.lock();\n\t\tm_dying = 1;\n\t\tm_dyingMutex.unlock();\n\t\tfor ( uint32 i=0; i<MAX_THREADS; ++i )\n\t\t{\n\t\t\tworker = m_workers+i;\n\t\t\tworker->stop(); \/\/ Raise dying flag\n\t\t}\n\t\t\n\t\tm_newJobEvent.signalBroadcast(); \/\/ Wake up all workers\n\t\tfor ( uint32 i=0; i<MAX_THREADS; ++i )\n\t\t{\n\t\t\tworker = m_workers+i;\n\t\t\tm_workers->join(); \/\/ Wait for it to finish\t\t\t\n\t\t}\n\t\t\n\t\t\/\/ All workers have been stopped\n\t\t\/\/ so it is safe to clean up the queue\n\t\t\/\/ without locking it\n\t\tJob *job = NULL;\n\t\twhile ( !m_queue.empty() )\n\t\t{\n\t\t\tjob = m_queue.front();\n\t\t\tm_queue.pop();\n\t\t\tdelete job;\n\t\t\tjob = NULL;\n\t\t}\n\t}\n\t\n\tvoid JobQueue::waitForJobsToBeCompleted()\n\t{\n\t\tm_jobQueueMutex.lock();\n\t\twhile ( !m_queue.empty() )\n\t\t{\n\t\t\tm_jobQueueMutex.unlock();\n\t\t\tm_jobsCompleted.wait();\n\t\t\tm_jobQueueMutex.lock();\n\t\t}\n\t\tm_jobQueueMutex.unlock();\n\t}\n\t\n\tbool32 JobQueue::waitForJob(Job **job)\n\t{\n\t\tuint32 dying = 0;\n\t\t\n\t\t*job = NULL;\n\t\t\n\t\tm_jobQueueMutex.lock();\n\n\t\t\/\/ Wait for a job to be added to the queue\n\t\t\/\/ (but what if there are already jobs in the queue?)\n\t\twhile ( m_queue.empty() ) {\n\t\t\tm_jobQueueMutex.unlock();\n\t\t\t\/\/\/ @todo Spurious wakeups; Is there really a new job?\n\t\t\tm_newJobEvent.wait();\n\t\t\t\/\/ Here, just in between the wait and acquire calls,\n\t\t\t\/\/ we can't lose the job to another thread. Only\n\t\t\t\/\/ one is released upon a signal().\n\t\t\t\/\/   However, spurious wakeups can happen, so check anyway.\n\t\t\tm_dyingMutex.lock();\n\t\t\tdying = m_dying;\n\t\t\tm_dyingMutex.unlock();\n\t\t\tif ( 1 == dying )\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\tm_jobQueueMutex.lock();\n\t\t}\n\n\t\t*job = m_queue.front();\n\t\tm_queue.pop();\n\t\tif ( m_queue.empty() )\n\t\t{\n\t\t\tm_jobsCompleted.signal();\n\t\t}\n\t\tm_jobQueueMutex.unlock();\n\t\t\n\t\treturn true;\n\t}\n\t\n\tvoid JobQueue::addJob(Job *job)\n\t{\n\t\tbool32 empty = false;\n\t\t\n\t\tm_jobQueueMutex.lock();\n\t\tm_queue.push(job);\n\t\t\/\/empty = m_queue.empty();\n\t\tm_jobQueueMutex.unlock();\n\t\t\n\t\t\/\/if ( empty )\n\t\t\/\/{\n\/\/\t\t\tm_newJobEvent.signal();\n\t\t\/\/}\n\t\tm_newJobEvent.signal();\n\t}\n\t\n} \/\/ namespace threading\n} \/\/ namespace anp\n<|endoftext|>"}
{"text":"<commit_before>\/*****************************************************************************\/\n\/**\n *  @file   ApplicationBase.cpp\n *  @author Naohisa Sakamoto\n *\/\n\/*----------------------------------------------------------------------------\n *\n *  Copyright (c) Visualization Laboratory, Kyoto University.\n *  All rights reserved.\n *  See http:\/\/www.viz.media.kyoto-u.ac.jp\/kvs\/copyright\/ for details.\n *\n *  $Id: ApplicationBase.cpp 1514 2013-04-09 07:14:05Z naohisa.sakamoto@gmail.com $\n *\/\n\/*****************************************************************************\/\n#include \"ApplicationBase.h\"\n\n\nnamespace kvs\n{\n\n\/*===========================================================================*\/\n\/**\n *  @brief  Constructs a ApplicationBase class.\n *  @param  argc [in] arugment count\n *  @param  argv [in] argument values\n *\/\n\/*===========================================================================*\/\nApplicationBase::ApplicationBase( int argc, char** argv ):\n    m_argc( argc ),\n    m_argv( argv ),\n    m_color( kvs::UIColor::Instance() )\n{\n}\n\n\/*===========================================================================*\/\n\/**\n *  @brief  Attaches a pointer to the screeen.\n *  @param  screen [in] pointer to the screen\n *\/\n\/*===========================================================================*\/\nvoid ApplicationBase::attach( kvs::ScreenBase* screen )\n{\n    m_screens.push_back( screen );\n}\n\n\/*===========================================================================*\/\n\/**\n *  @brief  Detaches the pointer to the screen.\n *  @param  screen [in] pointer to the screen\n *\/\n\/*===========================================================================*\/\nvoid ApplicationBase::detach( kvs::ScreenBase* screen )\n{\n    m_screens.remove( screen );\n}\n\n} \/\/ end of namespace kvs\n<commit_msg>New environment variable: KVS_COLOR_MODE.<commit_after>\/*****************************************************************************\/\n\/**\n *  @file   ApplicationBase.cpp\n *  @author Naohisa Sakamoto\n *\/\n\/*----------------------------------------------------------------------------\n *\n *  Copyright (c) Visualization Laboratory, Kyoto University.\n *  All rights reserved.\n *  See http:\/\/www.viz.media.kyoto-u.ac.jp\/kvs\/copyright\/ for details.\n *\n *  $Id: ApplicationBase.cpp 1514 2013-04-09 07:14:05Z naohisa.sakamoto@gmail.com $\n *\/\n\/*****************************************************************************\/\n#include \"ApplicationBase.h\"\n#include <cstdlib>\n#include <string>\n\n\nnamespace kvs\n{\n\n\/*===========================================================================*\/\n\/**\n *  @brief  Constructs a ApplicationBase class.\n *  @param  argc [in] arugment count\n *  @param  argv [in] argument values\n *\/\n\/*===========================================================================*\/\nApplicationBase::ApplicationBase( int argc, char** argv ):\n    m_argc( argc ),\n    m_argv( argv ),\n    m_color( kvs::UIColor::Instance() )\n{\n    const char* kvs_color_mode = std::getenv( \"KVS_COLOR_MODE\" );\n    if ( kvs_color_mode != NULL )\n    {\n        auto mode = std::string( kvs_color_mode );\n        if ( mode == \"Dark\" ) { this->setColorModeToDark(); }\n        else if ( mode == \"Light\" ) { this->setColorModeToLight(); }\n    }\n}\n\n\/*===========================================================================*\/\n\/**\n *  @brief  Attaches a pointer to the screeen.\n *  @param  screen [in] pointer to the screen\n *\/\n\/*===========================================================================*\/\nvoid ApplicationBase::attach( kvs::ScreenBase* screen )\n{\n    m_screens.push_back( screen );\n}\n\n\/*===========================================================================*\/\n\/**\n *  @brief  Detaches the pointer to the screen.\n *  @param  screen [in] pointer to the screen\n *\/\n\/*===========================================================================*\/\nvoid ApplicationBase::detach( kvs::ScreenBase* screen )\n{\n    m_screens.remove( screen );\n}\n\n} \/\/ end of namespace kvs\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n * Copyright (c) 2016 Sergey Alexandrov\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 FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n ******************************************************************************\/\n\n#include <chrono>\n\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/throw_exception.hpp>\n\n#include <librealsense\/rs.hpp>\n\n#include <grabbers\/realsense_grabber.h>\n\nnamespace grabbers {\n\nstruct RealSenseGrabber::Impl {\n  rs::context ctx;\n  rs::device* device;\n\n  cv::Size color_image_resolution = {0, 0};\n  int next_frame_index = 0;\n\n  uint64_t timestamp_zero_offset = 0;\n\n  Impl() {\n    if (ctx.get_device_count() == 0)\n      BOOST_THROW_EXCEPTION(GrabberException(\"No RealSense devices connected\"));\n\n    device = ctx.get_device(0);\n    \/\/ device->enable_stream(rs::stream::color, rs::preset::best_quality);\n    device->enable_stream(rs::stream::color, 640, 480, rs::format::bgr8, 30);\n\n    if (!device->is_stream_enabled(rs::stream::color) ||\n        device->get_stream_format(rs::stream::color) != rs::format::bgr8)\n      BOOST_THROW_EXCEPTION(GrabberException(\"Failed to create color stream with requested format\"));\n\n    color_image_resolution.width = device->get_stream_width(rs::stream::color);\n    color_image_resolution.height = device->get_stream_height(rs::stream::color);\n\n    device->start();\n  }\n\n  ~Impl() {\n    if (device->is_streaming())\n      device->stop();\n    device->disable_stream(rs::stream::color);\n  }\n\n  double grabFrame(cv::Mat& color) {\n    device->wait_for_frames();\n\n    auto color_data = device->get_frame_data(rs::stream::color);\n    memcpy(color.data, color_data, color.total() * color.elemSize());\n\n    ++next_frame_index;\n    return computeTimestamp(device->get_frame_timestamp(rs::stream::color));\n  }\n\n  double computeTimestamp(int device_timestamp) {\n    if (timestamp_zero_offset == 0) {\n      auto now = std::chrono::high_resolution_clock::now();\n      auto ms = std::chrono::duration_cast<std::chrono::milliseconds>(now.time_since_epoch()).count();\n      timestamp_zero_offset = ms - device_timestamp;\n    }\n    return (timestamp_zero_offset + device_timestamp) * 0.001;\n  }\n};\n\nRealSenseGrabber::RealSenseGrabber(const std::string& \/*device_uri*\/) : p(new Impl) {\n}\n\nRealSenseGrabber::~RealSenseGrabber() {}\n\ninline bool RealSenseGrabber::hasMoreFrames() const {\n  return true;\n}\n\nbool RealSenseGrabber::grabFrame(cv::OutputArray _color) {\n  if (_color.kind() != cv::_InputArray::MAT)\n    BOOST_THROW_EXCEPTION(GrabberException(\"Grabbing only into cv::Mat\"));\n\n  _color.create(p->color_image_resolution.height, p->color_image_resolution.width, CV_8UC3);\n  cv::Mat color = _color.getMat();\n\n  return p->grabFrame(color);\n}\n\nvoid RealSenseGrabber::setAutoWhiteBalanceEnabled(bool state) {\n  p->device->set_option(rs::option::color_enable_auto_white_balance, state ? 1.0 : 0.0);\n}\n\nvoid RealSenseGrabber::setAutoExposureEnabled(bool state) {\n  p->device->set_option(rs::option::color_enable_auto_exposure, state ? 1.0 : 0.0);\n}\n\nvoid RealSenseGrabber::setExposure(int exposure) {\n  p->device->set_option(rs::option::color_exposure, exposure);\n}\n\nint RealSenseGrabber::getExposure() const {\n  return p->device->get_option(rs::option::color_exposure);\n}\n\nstd::pair<int, int> RealSenseGrabber::getExposureRange() const {\n  double min, max, step;\n  p->device->get_option_range(rs::option::color_exposure, min, max, step);\n  return {min, max};\n}\n\nvoid RealSenseGrabber::setGain(int gain) {\n  p->device->set_option(rs::option::color_gain, gain);\n}\n\nint RealSenseGrabber::getGain() const {\n  return p->device->get_option(rs::option::color_gain);\n}\n\nstd::pair<int, int> RealSenseGrabber::getGainRange() const {\n  double min, max, step;\n  p->device->get_option_range(rs::option::color_gain, min, max, step);\n  return {min, max};\n}\n\nstd::string RealSenseGrabber::getCameraModelName() const {\n  std::string expected_prefix = \"Intel RealSense \";\n  std::string name = p->device->get_name();\n  auto pos = name.find(expected_prefix);\n  if (pos == std::string::npos)\n    BOOST_THROW_EXCEPTION(GrabberException(\"Unable to extract camera model name from: \" + name));\n  name = name.substr(pos + expected_prefix.size());\n  boost::algorithm::to_lower(name);\n  return name;\n}\n\nstd::string RealSenseGrabber::getCameraSerialNumber() const {\n  return std::string(p->device->get_serial());\n}\n\n}  \/\/ namespace grabbers\n<commit_msg>Reduce RealSense framerate to 15 fps<commit_after>\/******************************************************************************\n * Copyright (c) 2016 Sergey Alexandrov\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 FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n ******************************************************************************\/\n\n#include <chrono>\n\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/throw_exception.hpp>\n\n#include <librealsense\/rs.hpp>\n\n#include <grabbers\/realsense_grabber.h>\n\nnamespace grabbers {\n\nstruct RealSenseGrabber::Impl {\n  rs::context ctx;\n  rs::device* device;\n\n  cv::Size color_image_resolution = {0, 0};\n  int next_frame_index = 0;\n\n  uint64_t timestamp_zero_offset = 0;\n\n  Impl() {\n    if (ctx.get_device_count() == 0)\n      BOOST_THROW_EXCEPTION(GrabberException(\"No RealSense devices connected\"));\n\n    device = ctx.get_device(0);\n    \/\/ device->enable_stream(rs::stream::color, rs::preset::best_quality);\n    device->enable_stream(rs::stream::color, 640, 480, rs::format::bgr8, 15);\n\n    if (!device->is_stream_enabled(rs::stream::color) ||\n        device->get_stream_format(rs::stream::color) != rs::format::bgr8)\n      BOOST_THROW_EXCEPTION(GrabberException(\"Failed to create color stream with requested format\"));\n\n    color_image_resolution.width = device->get_stream_width(rs::stream::color);\n    color_image_resolution.height = device->get_stream_height(rs::stream::color);\n\n    device->start();\n  }\n\n  ~Impl() {\n    if (device->is_streaming())\n      device->stop();\n    device->disable_stream(rs::stream::color);\n  }\n\n  double grabFrame(cv::Mat& color) {\n    device->wait_for_frames();\n\n    auto color_data = device->get_frame_data(rs::stream::color);\n    memcpy(color.data, color_data, color.total() * color.elemSize());\n\n    ++next_frame_index;\n    return computeTimestamp(device->get_frame_timestamp(rs::stream::color));\n  }\n\n  double computeTimestamp(int device_timestamp) {\n    if (timestamp_zero_offset == 0) {\n      auto now = std::chrono::high_resolution_clock::now();\n      auto ms = std::chrono::duration_cast<std::chrono::milliseconds>(now.time_since_epoch()).count();\n      timestamp_zero_offset = ms - device_timestamp;\n    }\n    return (timestamp_zero_offset + device_timestamp) * 0.001;\n  }\n};\n\nRealSenseGrabber::RealSenseGrabber(const std::string& \/*device_uri*\/) : p(new Impl) {\n}\n\nRealSenseGrabber::~RealSenseGrabber() {}\n\ninline bool RealSenseGrabber::hasMoreFrames() const {\n  return true;\n}\n\nbool RealSenseGrabber::grabFrame(cv::OutputArray _color) {\n  if (_color.kind() != cv::_InputArray::MAT)\n    BOOST_THROW_EXCEPTION(GrabberException(\"Grabbing only into cv::Mat\"));\n\n  _color.create(p->color_image_resolution.height, p->color_image_resolution.width, CV_8UC3);\n  cv::Mat color = _color.getMat();\n\n  return p->grabFrame(color);\n}\n\nvoid RealSenseGrabber::setAutoWhiteBalanceEnabled(bool state) {\n  p->device->set_option(rs::option::color_enable_auto_white_balance, state ? 1.0 : 0.0);\n}\n\nvoid RealSenseGrabber::setAutoExposureEnabled(bool state) {\n  p->device->set_option(rs::option::color_enable_auto_exposure, state ? 1.0 : 0.0);\n}\n\nvoid RealSenseGrabber::setExposure(int exposure) {\n  p->device->set_option(rs::option::color_exposure, exposure);\n}\n\nint RealSenseGrabber::getExposure() const {\n  return p->device->get_option(rs::option::color_exposure);\n}\n\nstd::pair<int, int> RealSenseGrabber::getExposureRange() const {\n  double min, max, step;\n  p->device->get_option_range(rs::option::color_exposure, min, max, step);\n  return {min, max};\n}\n\nvoid RealSenseGrabber::setGain(int gain) {\n  p->device->set_option(rs::option::color_gain, gain);\n}\n\nint RealSenseGrabber::getGain() const {\n  return p->device->get_option(rs::option::color_gain);\n}\n\nstd::pair<int, int> RealSenseGrabber::getGainRange() const {\n  double min, max, step;\n  p->device->get_option_range(rs::option::color_gain, min, max, step);\n  return {min, max};\n}\n\nstd::string RealSenseGrabber::getCameraModelName() const {\n  std::string expected_prefix = \"Intel RealSense \";\n  std::string name = p->device->get_name();\n  auto pos = name.find(expected_prefix);\n  if (pos == std::string::npos)\n    BOOST_THROW_EXCEPTION(GrabberException(\"Unable to extract camera model name from: \" + name));\n  name = name.substr(pos + expected_prefix.size());\n  boost::algorithm::to_lower(name);\n  return name;\n}\n\nstd::string RealSenseGrabber::getCameraSerialNumber() const {\n  return std::string(p->device->get_serial());\n}\n\n}  \/\/ namespace grabbers\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#ifdef _WIN32\n#include <winsock2.h>\n#include <ws2tcpip.h>\n#endif\n\n#include <stdio.h>\n#include <string.h>\n#include <errno.h>\n#include <vector>\n#include <string>\n#include \"common.h\"\n#include \"multicast.h\"\n#include \"ErrorHandler.h\"\n\nint\t\t\topenBroadcast(int port, const char* service,\n\t\t\t\t\tstruct sockaddr_in* addr)\n{\n#if defined(_WIN32)\n  const BOOL optOn = TRUE;\n#else\n  const int optOn = 1;\n#endif\n  int fd;\n\n  \/* check parameters *\/\n  if (!addr) {\n    printError(\"openBroadcast: Must supply a return address structure!\");\n    return -1;\n  }\n  memset(addr, 0, sizeof(*addr));\n\n  \/* lookup service and check port *\/\n  if (service) {\n    struct servent *sp = getservbyname(service, \"udp\");\n    if (!sp) {\n      if (port <= 0) {\n\tstd::vector<std::string> args;\n\targs.push_back(service);\n\n\tprintError(\"openBroadcast: No udp service {1}\", &args);\n\treturn -1;\n      }\n    }\n    else {\n      port = sp->s_port;\n    }\n  }\n  if (port <= 0) {\n    std::vector<std::string> args;\n    char buf[10];\n    sprintf(buf,\"%d\", port);\n    args.push_back(buf);\n    printError(\"openBroadcast: Invalid port {1}\", &args);\n    return -1;\n  }\n\n  \/* open socket *\/\n  fd = socket(AF_INET, SOCK_DGRAM, 0);\n  if (fd < 0) {\n    nerror(\"openBroadcast: socket\");\n    return -1;\n  }\n\n  \/* set address info *\/\n  addr->sin_family = AF_INET;\n  addr->sin_addr.s_addr = htonl(INADDR_ANY);\n\n#if defined(SO_REUSEPORT)\n  \/* set reuse port *\/\n  if (setsockopt(fd, SOL_SOCKET, SO_REUSEPORT,\n\t\t\t\t(SSOType)&optOn, sizeof(optOn)) < 0) {\n    nerror(\"openBroadcast: setsockopt SO_REUSEPORT\");\n    close(fd);\n    return -1;\n  }\n#elif defined(SO_REUSEADDR)\n  \/* set reuse address *\/\n  if (setsockopt(fd, SOL_SOCKET, SO_REUSEADDR,\n\t\t\t\t(SSOType)&optOn, sizeof(optOn)) < 0) {\n    nerror(\"openBroadcast: setsockopt SO_REUSEADDR\");\n    close(fd);\n    return -1;\n  }\n#endif\n\n  \/* bind address *\/\n  if (bind(fd, (const struct sockaddr*)addr, sizeof(*addr)) < 0) {\n    nerror(\"openBroadcast: bind\");\n    close(fd);\n    return -1;\n  }\n\n  \/* make broadcast *\/\n  if (setsockopt(fd, SOL_SOCKET, SO_BROADCAST,\n\t\t\t\t(SSOType)&optOn, sizeof(optOn)) < 0) {\n    nerror(\"openBroadcast: setsockopt SO_BROADCAST\");\n    close(fd);\n    return -1;\n  }\n\n  \/\/ address to send to is the broadcast address\n  addr->sin_addr.s_addr = INADDR_BROADCAST;\n  addr->sin_port = htons(port);\n\n#if defined(__linux__)\n  \/\/ linux doesn't seem to like INADDR_BROADCAST, but it's okay\n  \/\/ with the broadcast address on the local network.  get the\n  \/\/ broadcast address on the first interface that's not the\n  \/\/ loopback interface.  (check the first numInterfaces\n  \/\/ interfaces.)\n  const int numInterfaces = 5;\n  int i;\n  struct ifconf conf;\n  struct ifreq req[numInterfaces];\n\n  \/\/ get the list of interface names\n  conf.ifc_len = sizeof(req);\n  conf.ifc_ifcu.ifcu_req = req;\n  for (i = 0; i < numInterfaces; ++i)\n    req[i].ifr_ifrn.ifrn_name[0] = 0;\n  if (ioctl(fd, SIOCGIFCONF, &conf) < 0) {\n    nerror(\"openBroadcast: getting interface list\");\n    close(fd);\n    return(-1);\n  }\n\n  \/\/ get the broadcast address on each interface\n  for (i = 0; i < numInterfaces; ++i) {\n    \/\/ if no name then we're done\n    if (req[i].ifr_ifrn.ifrn_name[0] == 0)\n      break;\n\n    \/\/ if we can't get the address then skip this interface\n    if (ioctl(fd, SIOCGIFBRDADDR, req + i) < 0)\n      continue;\n\n    \/\/ if the address is the loopback broadcast address then skip it\n    const sockaddr_in* ifbaddr = (const sockaddr_in*)\n\t\t\t\t\t&req[i].ifr_ifru.ifru_broadaddr;\n    if (ntohl(ifbaddr->sin_addr.s_addr) == 0x7ffffffflu)\n      continue;\n    if (ifbaddr->sin_addr.s_addr == 0)\n      continue;\n\n    \/\/ got the broadcast address on the interface\n    addr->sin_addr.s_addr = ifbaddr->sin_addr.s_addr;\n    break;\n  }\n\n  \/\/ failed if no broadcast addresses found\n  if (i == numInterfaces) {\n    nerror(\"openBroadcast: getting broadcast address\");\n    close(fd);\n    return(-1);\n  }\n#endif\n\n  \/* turn on non-blocking io *\/\n  if (BzfNetwork::setNonBlocking(fd) < 0) {\n    nerror(\"openBroadcast: setNonBlocking\");\n    close(fd);\n    return(-1);\n  }\n\n  return fd;\n}\n\nint\t\t\tcloseBroadcast(int fd)\n{\n  if (fd == -1) return 0;\n  return close(fd);\n}\n\nint\t\t\tsendBroadcast(int fd, const void* buffer,\n\t\t\t\t\tint bufferLength,\n\t\t\t\t\tconst struct sockaddr_in* addr)\n{\n  return sendto(fd, (const char*)buffer, bufferLength, 0,\n\t\t\t\t(const struct sockaddr*)addr, sizeof(*addr));\n}\n\n#if !defined(AddrLen)\n#define AddrLen\t\tint\n#endif\n\n#ifdef WIN32\n\/* This is a really really fugly hack to get around winsock sillyness\n * The newer versions of winsock have a socken_t typedef, and there\n * doesn't seem to be any way to tell the versions apart. However,\n * VC++ helps us out here by treating typedef as #define\n * If we've got a socklen_t typedefed, define HAVE_SOCKLEN_T to\n * avoid #define'ing it in common.h *\/\n\n#ifndef socklen_t\n\t#define socklen_t int\n#endif\n#endif \/\/WIN32\n\nint\t\t\trecvBroadcast(int fd, void* buffer, int bufferLength,\n\t\t\t\t\t struct sockaddr_in* addr)\n{\n  struct sockaddr_in from;\n  AddrLen fromLength = sizeof(from);\n\n  int byteCount = recvfrom(fd, (char*)buffer, bufferLength, 0,\n\t\t\t\t(struct sockaddr*)&from, (socklen_t*) &fromLength);\n  if (byteCount < 0) {\n    if (getErrno() == EWOULDBLOCK) {\n      return 0;\n    }\n    else {\n      nerror(\"recvBroadcast\");\n      return -1;\n    }\n  }\n  if (addr) *addr = from;\n  return byteCount;\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\n<commit_msg>more header cleanup, follow inclusion conventions consistently -- this one definitely needs windows testing<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\/* interface header *\/\n#include \"multicast.h\"\n\n\/* system implementation headers *\/\n#ifdef _WIN32\n#  include <winsock2.h>\n#  include <ws2tcpip.h>\n#endif\n\n#include <stdio.h>\n#include <string.h>\n#include <errno.h>\n#include <vector>\n#include <string>\n\n\/* common implementation headers *\/\n#include \"ErrorHandler.h\"\n\n\nint\t\t\topenBroadcast(int port, const char* service,\n\t\t\t\t\tstruct sockaddr_in* addr)\n{\n#if defined(_WIN32)\n  const BOOL optOn = TRUE;\n#else\n  const int optOn = 1;\n#endif\n  int fd;\n\n  \/* check parameters *\/\n  if (!addr) {\n    printError(\"openBroadcast: Must supply a return address structure!\");\n    return -1;\n  }\n  memset(addr, 0, sizeof(*addr));\n\n  \/* lookup service and check port *\/\n  if (service) {\n    struct servent *sp = getservbyname(service, \"udp\");\n    if (!sp) {\n      if (port <= 0) {\n\tstd::vector<std::string> args;\n\targs.push_back(service);\n\n\tprintError(\"openBroadcast: No udp service {1}\", &args);\n\treturn -1;\n      }\n    }\n    else {\n      port = sp->s_port;\n    }\n  }\n  if (port <= 0) {\n    std::vector<std::string> args;\n    char buf[10];\n    sprintf(buf,\"%d\", port);\n    args.push_back(buf);\n    printError(\"openBroadcast: Invalid port {1}\", &args);\n    return -1;\n  }\n\n  \/* open socket *\/\n  fd = socket(AF_INET, SOCK_DGRAM, 0);\n  if (fd < 0) {\n    nerror(\"openBroadcast: socket\");\n    return -1;\n  }\n\n  \/* set address info *\/\n  addr->sin_family = AF_INET;\n  addr->sin_addr.s_addr = htonl(INADDR_ANY);\n\n#if defined(SO_REUSEPORT)\n  \/* set reuse port *\/\n  if (setsockopt(fd, SOL_SOCKET, SO_REUSEPORT,\n\t\t\t\t(SSOType)&optOn, sizeof(optOn)) < 0) {\n    nerror(\"openBroadcast: setsockopt SO_REUSEPORT\");\n    close(fd);\n    return -1;\n  }\n#elif defined(SO_REUSEADDR)\n  \/* set reuse address *\/\n  if (setsockopt(fd, SOL_SOCKET, SO_REUSEADDR,\n\t\t\t\t(SSOType)&optOn, sizeof(optOn)) < 0) {\n    nerror(\"openBroadcast: setsockopt SO_REUSEADDR\");\n    close(fd);\n    return -1;\n  }\n#endif\n\n  \/* bind address *\/\n  if (bind(fd, (const struct sockaddr*)addr, sizeof(*addr)) < 0) {\n    nerror(\"openBroadcast: bind\");\n    close(fd);\n    return -1;\n  }\n\n  \/* make broadcast *\/\n  if (setsockopt(fd, SOL_SOCKET, SO_BROADCAST,\n\t\t\t\t(SSOType)&optOn, sizeof(optOn)) < 0) {\n    nerror(\"openBroadcast: setsockopt SO_BROADCAST\");\n    close(fd);\n    return -1;\n  }\n\n  \/\/ address to send to is the broadcast address\n  addr->sin_addr.s_addr = INADDR_BROADCAST;\n  addr->sin_port = htons(port);\n\n#if defined(__linux__)\n  \/\/ linux doesn't seem to like INADDR_BROADCAST, but it's okay\n  \/\/ with the broadcast address on the local network.  get the\n  \/\/ broadcast address on the first interface that's not the\n  \/\/ loopback interface.  (check the first numInterfaces\n  \/\/ interfaces.)\n  const int numInterfaces = 5;\n  int i;\n  struct ifconf conf;\n  struct ifreq req[numInterfaces];\n\n  \/\/ get the list of interface names\n  conf.ifc_len = sizeof(req);\n  conf.ifc_ifcu.ifcu_req = req;\n  for (i = 0; i < numInterfaces; ++i)\n    req[i].ifr_ifrn.ifrn_name[0] = 0;\n  if (ioctl(fd, SIOCGIFCONF, &conf) < 0) {\n    nerror(\"openBroadcast: getting interface list\");\n    close(fd);\n    return(-1);\n  }\n\n  \/\/ get the broadcast address on each interface\n  for (i = 0; i < numInterfaces; ++i) {\n    \/\/ if no name then we're done\n    if (req[i].ifr_ifrn.ifrn_name[0] == 0)\n      break;\n\n    \/\/ if we can't get the address then skip this interface\n    if (ioctl(fd, SIOCGIFBRDADDR, req + i) < 0)\n      continue;\n\n    \/\/ if the address is the loopback broadcast address then skip it\n    const sockaddr_in* ifbaddr = (const sockaddr_in*)\n\t\t\t\t\t&req[i].ifr_ifru.ifru_broadaddr;\n    if (ntohl(ifbaddr->sin_addr.s_addr) == 0x7ffffffflu)\n      continue;\n    if (ifbaddr->sin_addr.s_addr == 0)\n      continue;\n\n    \/\/ got the broadcast address on the interface\n    addr->sin_addr.s_addr = ifbaddr->sin_addr.s_addr;\n    break;\n  }\n\n  \/\/ failed if no broadcast addresses found\n  if (i == numInterfaces) {\n    nerror(\"openBroadcast: getting broadcast address\");\n    close(fd);\n    return(-1);\n  }\n#endif\n\n  \/* turn on non-blocking io *\/\n  if (BzfNetwork::setNonBlocking(fd) < 0) {\n    nerror(\"openBroadcast: setNonBlocking\");\n    close(fd);\n    return(-1);\n  }\n\n  return fd;\n}\n\nint\t\t\tcloseBroadcast(int fd)\n{\n  if (fd == -1) return 0;\n  return close(fd);\n}\n\nint\t\t\tsendBroadcast(int fd, const void* buffer,\n\t\t\t\t\tint bufferLength,\n\t\t\t\t\tconst struct sockaddr_in* addr)\n{\n  return sendto(fd, (const char*)buffer, bufferLength, 0,\n\t\t\t\t(const struct sockaddr*)addr, sizeof(*addr));\n}\n\n#if !defined(AddrLen)\n#define AddrLen\t\tint\n#endif\n\n#ifdef WIN32\n\/* This is a really really fugly hack to get around winsock sillyness\n * The newer versions of winsock have a socken_t typedef, and there\n * doesn't seem to be any way to tell the versions apart. However,\n * VC++ helps us out here by treating typedef as #define\n * If we've got a socklen_t typedefed, define HAVE_SOCKLEN_T to\n * avoid #define'ing it in common.h *\/\n\n#ifndef socklen_t\n\t#define socklen_t int\n#endif\n#endif \/\/WIN32\n\nint\t\t\trecvBroadcast(int fd, void* buffer, int bufferLength,\n\t\t\t\t\t struct sockaddr_in* addr)\n{\n  struct sockaddr_in from;\n  AddrLen fromLength = sizeof(from);\n\n  int byteCount = recvfrom(fd, (char*)buffer, bufferLength, 0,\n\t\t\t\t(struct sockaddr*)&from, (socklen_t*) &fromLength);\n  if (byteCount < 0) {\n    if (getErrno() == EWOULDBLOCK) {\n      return 0;\n    }\n    else {\n      nerror(\"recvBroadcast\");\n      return -1;\n    }\n  }\n  if (addr) *addr = from;\n  return byteCount;\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\n<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Library   : Image Registration Toolkit (IRTK)\n  Module    : $Id$\n  Copyright : Imperial College, Department of Computing\n              Visual Information Processing (VIP), 2008 onwards\n  Date      : $Date$\n  Version   : $Revision$\n  Changes   : $Author$\n\n=========================================================================*\/\n\n#include <irtkImage.h>\n\n#include <irtkHistogram.h>\n\n#include <irtkTransformation.h>\n\n\/\/ Default filenames\nchar *output_name = NULL, *prefix_name = NULL, *suffix_name = NULL, *textfile = NULL;\n\n#define MAX_IMAGES 10000\n#define EPSILON    0.001\n\nvoid usage()\n{\n  cerr << \"Usage: atlas [output] <input1..inputN> <options>\\n\" << endl;\n  cerr << \"where <options> is one or more of the following:\\n\";\n  cerr << \"<-imagenames file>      Name of file containing image names for <input1..inputN>\\n\";\n  cerr << \"<-prefix directory>     Directory in which to find the images\\n\";\n  cerr << \"<-gaussian mean sigma>  Use Gaussian with mean and sigma for kernel-based smoothing\\n\";\n  cerr << \"<-epsilon value>        Epsilon value for ignoring image in kernel-based smoothing (default = \" << EPSILON << \")\\n\";\n  cerr << \"<-scaling value>        Scaling value for final atlas (default = 1)\\n\";\n  cerr << \"<-norm>                 Normalise intensities before atlas construction (default = off)\\n\";\n  exit(1);\n}\n\nvoid normalise(irtkGreyImage &input, irtkRealImage &output)\n{\n  int j;\n  double mean, std;\n  irtkGreyPixel *ptr1;\n  irtkRealPixel *ptr2;\n\n  \/\/ Set up input histogram\n  cerr << \"Setting up input histogram...\"; cout.flush();\n  irtkGreyPixel min, max;\n  input.GetMinMax(&min, &max);\n  irtkHistogram_1D histogram(max-min+1);\n  histogram.PutMin(min-0.5);\n  histogram.PutMax(max+0.5);\n\n  ptr1 = input.GetPointerToVoxels();\n  for (j = 0; j < input.GetNumberOfVoxels(); j++) {\n    histogram.AddSample(*ptr1);\n    ptr1++;\n  }\n\n  mean = histogram.Mean();\n  std  = histogram.StandardDeviation();\n  cout << \"done\" << endl;\n  cerr << \"Stats: Mean = \" << mean << \" SD = \" << std << endl;\n\n  ptr1 = input.GetPointerToVoxels();\n  ptr2 = output.GetPointerToVoxels();\n  for (j = 0; j < input.GetNumberOfVoxels(); j++) {\n    *ptr2 = (*ptr1 - mean) \/ std;\n    ptr1++;\n    ptr2++;\n  }\n}\n\nint main(int argc, char **argv)\n{\n  double scale, mean, sigma, epsilon;\n  int i, j, n, padding, norm, no, ok;\n  irtkGreyPixel *ptr1;\n  irtkGreyImage input;\n  irtkRealPixel *ptr2;\n  irtkRealImage tmp, output;\n\n  \/\/ Check command line\n  if (argc < 5) {\n    usage();\n  }\n\n  \/\/ Parse parameters\n  output_name = argv[1];\n  argc--;\n  argv++;\n\n  \/\/ Default: scaling factor\n  scale = 1;\n\n  \/\/ Default: No kernel smoothing\n  mean  = 0;\n  sigma = 1;\n\n  \/\/ Default: No intensity  normalisation\n  norm  = False;\n\n  \/\/ Default: Epsilon\n  epsilon = EPSILON;\n\n  \/\/ Default padding\n  padding = MIN_GREY;\n\n  \/\/ Parse input file names and values\n  char  **input_name   = new char *[MAX_IMAGES];\n  double *input_value  = new double[MAX_IMAGES];\n  double *input_weight = new double[MAX_IMAGES];\n  double  total_weight = 0;\n\n  \/\/ Parse any remaining paramters\n  no = 0;\n\n  while ((argc > 1) && (argv[1][0] != '-' )) {\n    input_name[no]   = argv[1];\n    input_weight[no] = 1;\n    total_weight    += 1;\n    no++;\n    argc--;\n    argv++;\n  }\n\n  while (argc > 1) {\n    ok = False;\n    if ((ok == False) && (strcmp(argv[1], \"-scaling\") == 0)) {\n      argc--;\n      argv++;\n      scale = atof(argv[1]);\n      argc--;\n      argv++;\n      ok = True;\n    }\n    if ((ok == False) && (strcmp(argv[1], \"-gaussian\") == 0)) {\n      argc--;\n      argv++;\n      mean = atof(argv[1]);\n      argc--;\n      argv++;\n      sigma = atof(argv[1]);\n      argc--;\n      argv++;\n      ok = True;\n    }\n    if ((ok == False) && (strcmp(argv[1], \"-norm\") == 0)) {\n      argc--;\n      argv++;\n      norm = True;\n      ok = True;\n    }\n    if ((ok == False) && (strcmp(argv[1], \"-imagenames\") == 0)) {\n      argc--;\n      argv++;\n      textfile = argv[1];\n      argc--;\n      argv++;\n      ok = True;\n    }\n    if ((ok == False) && (strcmp(argv[1], \"-padding\") == 0)) {\n      argc--;\n      argv++;\n      padding = atoi(argv[1]);\n      argc--;\n      argv++;\n      ok = True;\n    }\n    if ((ok == False) && (strcmp(argv[1], \"-prefix\") == 0)) {\n       argc--;\n       argv++;\n       prefix_name = argv[1];\n       argc--;\n       argv++;\n       ok = True;\n     }\n    if ((ok == False) && (strcmp(argv[1], \"-suffix\") == 0)) {\n       argc--;\n       argv++;\n       suffix_name = argv[1];\n       argc--;\n       argv++;\n       ok = True;\n     }\n    if ((ok == False) && (strcmp(argv[1], \"-epsilon\") == 0)) {\n      argc--;\n      argv++;\n      epsilon = atof(argv[1]);\n      argc--;\n      argv++;\n      ok = True;\n    }\n    if (ok == False) {\n      cerr << \"Unknown argument: \" << argv[1] << endl << endl;\n      usage();\n    }\n  }\n\n  if (textfile != NULL) {\n    ifstream in(textfile);\n    if (in.is_open()) {\n      while (!in.eof()) {\n        input_name[no] = new char[256];\n        in >> input_name[no] >> input_value[no];\n        if (strlen(input_name[no]) > 0) {\n          input_weight[no] = 1.0 \/ sqrt(2.0) \/ sigma * exp(-pow((mean - input_value[no])\/sigma, 2.0)\/2);\n          if (input_weight[no] > epsilon) {\n            total_weight   += input_weight[no];\n            cout << input_value[no] << \" \" << input_weight[no] << \" \" << total_weight << endl;\n            no++;\n          }\n        }\n      }\n      in.close();\n    } else {\n      cout << \"atlas: Unable to open file \" << textfile << endl;\n      exit(1);\n    }\n  }\n\n  \/\/ Read and add one input image after the other\n  n = 0;\n  for (i = 0; i < no; i++) {\n    char buffer[255];\n\n    \/\/ Read input\n    if (prefix_name != NULL) {\n      sprintf(buffer, \"%s%s\", prefix_name, input_name[i]);\n    } else {\n      sprintf(buffer, \"%s\", input_name[i]);\n    }\n    input_name[i] = strdup(buffer);\n    if (suffix_name != NULL) {\n      sprintf(buffer, \"%s%s\",  input_name[i], suffix_name);\n    } else {\n      sprintf(buffer, \"%s\", input_name[i]);\n    }\n    input_name[i] = strdup(buffer);\n\n    cout << \"Reading input image \" << input_name[i] << \"... \"; cout.flush();\n    input.Read(input_name[i]);\n    cout << \"done\" << endl;\n\n    if (i == 0) {\n      n = input.GetX()*input.GetY()*input.GetZ();\n      output = input;\n      ptr2 = output.GetPointerToVoxels();\n      for (j = 0; j < n; j++) {\n        *ptr2 = 0;\n        ptr2++;\n      }\n    }\n\n    tmp = input;\n    if (norm == True) normalise(input, tmp);\n\n    cerr << \"Adding input to atlas...\"; cout.flush();\n    tmp *= input_weight[i];\n    output += tmp;\n    cerr << \"done\\n\";\n\n  }\n\n  ptr1 = input.GetPointerToVoxels();\n  ptr2 = output.GetPointerToVoxels();\n  for (j = 0; j < n; j++) {\n    *ptr1 = round(scale * *ptr2 \/ total_weight);\n    ptr1++;\n    ptr2++;\n  }\n  cerr << \" done\\n\";\n\n  \/\/ Write atlas\n  cerr << \"Writing atlas to \" << output_name << \" ... \";\n  cout.flush();\n  input.Write(output_name);\n  cerr << \"done\\n\";\n}\n<commit_msg>Updated to reflect changes in histogram classes<commit_after>\/*=========================================================================\n\n  Library   : Image Registration Toolkit (IRTK)\n  Module    : $Id$\n  Copyright : Imperial College, Department of Computing\n              Visual Information Processing (VIP), 2008 onwards\n  Date      : $Date$\n  Version   : $Revision$\n  Changes   : $Author$\n\n=========================================================================*\/\n\n#include <irtkImage.h>\n\n#include <irtkHistogram.h>\n\n#include <irtkTransformation.h>\n\n\/\/ Default filenames\nchar *output_name = NULL, *prefix_name = NULL, *suffix_name = NULL, *textfile = NULL;\n\n#define MAX_IMAGES 10000\n#define EPSILON    0.001\n\nvoid usage()\n{\n  cerr << \"Usage: atlas [output] <input1..inputN> <options>\\n\" << endl;\n  cerr << \"where <options> is one or more of the following:\\n\";\n  cerr << \"<-imagenames file>      Name of file containing image names for <input1..inputN>\\n\";\n  cerr << \"<-prefix directory>     Directory in which to find the images\\n\";\n  cerr << \"<-gaussian mean sigma>  Use Gaussian with mean and sigma for kernel-based smoothing\\n\";\n  cerr << \"<-epsilon value>        Epsilon value for ignoring image in kernel-based smoothing (default = \" << EPSILON << \")\\n\";\n  cerr << \"<-scaling value>        Scaling value for final atlas (default = 1)\\n\";\n  cerr << \"<-norm>                 Normalise intensities before atlas construction (default = off)\\n\";\n  exit(1);\n}\n\nvoid normalise(irtkGreyImage &input, irtkRealImage &output)\n{\n  int j;\n  double mean, std;\n  irtkGreyPixel *ptr1;\n  irtkRealPixel *ptr2;\n\n  \/\/ Set up input histogram\n  cerr << \"Setting up input histogram...\"; cout.flush();\n  irtkGreyPixel min, max;\n  input.GetMinMax(&min, &max);\n  irtkHistogram histogram(max-min+1);\n  histogram.PutMin(min-0.5);\n  histogram.PutMax(max+0.5);\n\n  ptr1 = input.GetPointerToVoxels();\n  for (j = 0; j < input.GetNumberOfVoxels(); j++) {\n    histogram.AddSample(*ptr1);\n    ptr1++;\n  }\n\n  mean = histogram.Mean();\n  std  = histogram.StandardDeviation();\n  cout << \"done\" << endl;\n  cerr << \"Stats: Mean = \" << mean << \" SD = \" << std << endl;\n\n  ptr1 = input.GetPointerToVoxels();\n  ptr2 = output.GetPointerToVoxels();\n  for (j = 0; j < input.GetNumberOfVoxels(); j++) {\n    *ptr2 = (*ptr1 - mean) \/ std;\n    ptr1++;\n    ptr2++;\n  }\n}\n\nint main(int argc, char **argv)\n{\n  double scale, mean, sigma, epsilon;\n  int i, j, n, padding, norm, no, ok;\n  irtkGreyPixel *ptr1;\n  irtkGreyImage input;\n  irtkRealPixel *ptr2;\n  irtkRealImage tmp, output;\n\n  \/\/ Check command line\n  if (argc < 5) {\n    usage();\n  }\n\n  \/\/ Parse parameters\n  output_name = argv[1];\n  argc--;\n  argv++;\n\n  \/\/ Default: scaling factor\n  scale = 1;\n\n  \/\/ Default: No kernel smoothing\n  mean  = 0;\n  sigma = 1;\n\n  \/\/ Default: No intensity  normalisation\n  norm  = False;\n\n  \/\/ Default: Epsilon\n  epsilon = EPSILON;\n\n  \/\/ Default padding\n  padding = MIN_GREY;\n\n  \/\/ Parse input file names and values\n  char  **input_name   = new char *[MAX_IMAGES];\n  double *input_value  = new double[MAX_IMAGES];\n  double *input_weight = new double[MAX_IMAGES];\n  double  total_weight = 0;\n\n  \/\/ Parse any remaining paramters\n  no = 0;\n\n  while ((argc > 1) && (argv[1][0] != '-' )) {\n    input_name[no]   = argv[1];\n    input_weight[no] = 1;\n    total_weight    += 1;\n    no++;\n    argc--;\n    argv++;\n  }\n\n  while (argc > 1) {\n    ok = False;\n    if ((ok == False) && (strcmp(argv[1], \"-scaling\") == 0)) {\n      argc--;\n      argv++;\n      scale = atof(argv[1]);\n      argc--;\n      argv++;\n      ok = True;\n    }\n    if ((ok == False) && (strcmp(argv[1], \"-gaussian\") == 0)) {\n      argc--;\n      argv++;\n      mean = atof(argv[1]);\n      argc--;\n      argv++;\n      sigma = atof(argv[1]);\n      argc--;\n      argv++;\n      ok = True;\n    }\n    if ((ok == False) && (strcmp(argv[1], \"-norm\") == 0)) {\n      argc--;\n      argv++;\n      norm = True;\n      ok = True;\n    }\n    if ((ok == False) && (strcmp(argv[1], \"-imagenames\") == 0)) {\n      argc--;\n      argv++;\n      textfile = argv[1];\n      argc--;\n      argv++;\n      ok = True;\n    }\n    if ((ok == False) && (strcmp(argv[1], \"-padding\") == 0)) {\n      argc--;\n      argv++;\n      padding = atoi(argv[1]);\n      argc--;\n      argv++;\n      ok = True;\n    }\n    if ((ok == False) && (strcmp(argv[1], \"-prefix\") == 0)) {\n       argc--;\n       argv++;\n       prefix_name = argv[1];\n       argc--;\n       argv++;\n       ok = True;\n     }\n    if ((ok == False) && (strcmp(argv[1], \"-suffix\") == 0)) {\n       argc--;\n       argv++;\n       suffix_name = argv[1];\n       argc--;\n       argv++;\n       ok = True;\n     }\n    if ((ok == False) && (strcmp(argv[1], \"-epsilon\") == 0)) {\n      argc--;\n      argv++;\n      epsilon = atof(argv[1]);\n      argc--;\n      argv++;\n      ok = True;\n    }\n    if (ok == False) {\n      cerr << \"Unknown argument: \" << argv[1] << endl << endl;\n      usage();\n    }\n  }\n\n  if (textfile != NULL) {\n    ifstream in(textfile);\n    if (in.is_open()) {\n      while (!in.eof()) {\n        input_name[no] = new char[256];\n        in >> input_name[no] >> input_value[no];\n        if (strlen(input_name[no]) > 0) {\n          input_weight[no] = 1.0 \/ sqrt(2.0) \/ sigma * exp(-pow((mean - input_value[no])\/sigma, 2.0)\/2);\n          if (input_weight[no] > epsilon) {\n            total_weight   += input_weight[no];\n            cout << input_value[no] << \" \" << input_weight[no] << \" \" << total_weight << endl;\n            no++;\n          }\n        }\n      }\n      in.close();\n    } else {\n      cout << \"atlas: Unable to open file \" << textfile << endl;\n      exit(1);\n    }\n  }\n\n  \/\/ Read and add one input image after the other\n  n = 0;\n  for (i = 0; i < no; i++) {\n    char buffer[255];\n\n    \/\/ Read input\n    if (prefix_name != NULL) {\n      sprintf(buffer, \"%s%s\", prefix_name, input_name[i]);\n    } else {\n      sprintf(buffer, \"%s\", input_name[i]);\n    }\n    input_name[i] = strdup(buffer);\n    if (suffix_name != NULL) {\n      sprintf(buffer, \"%s%s\",  input_name[i], suffix_name);\n    } else {\n      sprintf(buffer, \"%s\", input_name[i]);\n    }\n    input_name[i] = strdup(buffer);\n\n    cout << \"Reading input image \" << input_name[i] << \"... \"; cout.flush();\n    input.Read(input_name[i]);\n    cout << \"done\" << endl;\n\n    if (i == 0) {\n      n = input.GetX()*input.GetY()*input.GetZ();\n      output = input;\n      ptr2 = output.GetPointerToVoxels();\n      for (j = 0; j < n; j++) {\n        *ptr2 = 0;\n        ptr2++;\n      }\n    }\n\n    tmp = input;\n    if (norm == True) normalise(input, tmp);\n\n    cerr << \"Adding input to atlas...\"; cout.flush();\n    tmp *= input_weight[i];\n    output += tmp;\n    cerr << \"done\\n\";\n\n  }\n\n  ptr1 = input.GetPointerToVoxels();\n  ptr2 = output.GetPointerToVoxels();\n  for (j = 0; j < n; j++) {\n    *ptr1 = round(scale * *ptr2 \/ total_weight);\n    ptr1++;\n    ptr2++;\n  }\n  cerr << \" done\\n\";\n\n  \/\/ Write atlas\n  cerr << \"Writing atlas to \" << output_name << \" ... \";\n  cout.flush();\n  input.Write(output_name);\n  cerr << \"done\\n\";\n}\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 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 \"msheetstandalonewindow.h\"\n#include <mdeviceprofile.h>\n#include <mdismissevent.h>\n#include <mscenemanager.h>\n#include <msheet.h>\n#include <mstatusbar.h>\n#include <mcomponentdata.h>\n\n#include <QApplication>\n#include <QTimer>\n\n#ifdef Q_WS_X11\n# include <QX11Info>\n# include <X11\/Xatom.h>\n# include <X11\/Xlib.h>\n#endif\n\nMSheetStandAloneWindow::MSheetStandAloneWindow()\n    : MWindow(new MSceneManager, 0)\n    , beingClosed(false)\n    , sheet(0)\n    , statusBar(0)\n{\n    setRoundedCornersEnabled(true);\n#ifdef Q_WS_X11\n    appendMSheetTypeProperty();\n#endif \/\/Q_WS_X11\n}\n\nMSheetStandAloneWindow::~MSheetStandAloneWindow()\n{\n    delete statusBar;\n    statusBar = 0;\n}\n\nvoid MSheetStandAloneWindow::setSheet(MSheet *sheet)\n{\n    this->sheet = sheet;\n}\n\nvoid MSheetStandAloneWindow::setStatusBarVisible(bool statusBarVisible)\n{\n    if (!statusBar && MDeviceProfile::instance()->showStatusbar()\n            && statusBarVisible)\n        statusBar = new MStatusBar;\n\n    if (statusBar) {\n        if (statusBarVisible) {\n            if (isVisible())\n                sceneManager()->appearSceneWindow(statusBar);\n            else\n                sceneManager()->appearSceneWindowNow(statusBar);\n        } else {\n            sceneManager()->disappearSceneWindow(statusBar);\n        }\n    }\n}\n\nvoid MSheetStandAloneWindow::closeEvent(QCloseEvent *event)\n{\n    if (sheet) {\n        MDismissEvent dismissEvent;\n        QApplication::sendEvent(sheet, &dismissEvent);\n\n        event->setAccepted(dismissEvent.isAccepted());\n    } else {\n        event->accept();\n    }\n\n    beingClosed = event->isAccepted();\n}\n\nvoid MSheetStandAloneWindow::showEvent(QShowEvent *event)\n{\n    Q_UNUSED(event);\n    \/\/ reset variable\n    beingClosed = false;\n}\n\nvoid MSheetStandAloneWindow::hideEvent(QHideEvent *event)\n{\n    Q_UNUSED(event);\n\n    if (!sheet)\n        return;\n\n    \/\/ OBS: disappear only on the next event loop as we might be\n    \/\/ called from within MSceneWindowPrivate::canDisappear()\n\n    if (beingClosed) {\n        QTimer::singleShot(0, sheet, SIGNAL(_q_dismissSystemSheetImmediately()));\n    } else {\n        QTimer::singleShot(0, sheet, SIGNAL(_q_makeSystemSheetDisappearImmediately()));\n    }\n}\n\n#ifdef Q_WS_X11\nvoid MSheetStandAloneWindow::appendMSheetTypeProperty()\n{\n    Atom atomWindowType = XInternAtom(QX11Info::display(),\n                                      \"_MEEGOTOUCH_NET_WM_WINDOW_TYPE_SHEET\", False);\n\n    XChangeProperty(QX11Info::display(), effectiveWinId(),\n                    XInternAtom(QX11Info::display(), \"_NET_WM_WINDOW_TYPE\", False),\n                    XA_ATOM, 32, PropModeAppend, (unsigned char*) &atomWindowType, 1);\n}\n\nvoid MSheetStandAloneWindow::setWindowChainedProperty(const WId &parentWinId, const WId &childWinId)\n{\n    Atom atomMInvokedBy = XInternAtom(QX11Info::display(), \"_MEEGOTOUCH_WM_INVOKED_BY\", False);\n    Display *display = QX11Info::display();\n\n    \/\/ for compositor page transition\n    XChangeProperty(display, childWinId,\n            atomMInvokedBy, XA_WINDOW,\n            32, PropModeReplace,\n            (unsigned char *)&parentWinId, 1);\n\n    \/\/ for task switcher view stacking\n    XSetTransientForHint(display, childWinId, parentWinId);\n}\n#endif \/\/Q_WS_X11\n\nvoid MSheetStandAloneWindow::updateChainTaskData()\n{\n#ifdef Q_WS_X11\n    \/\/ here we try to inject the chainTaskData into this MSheetStandAloneWindow\n    if (!MComponentData::chainDataStackIsEmpty()) {\n        MComponentData::ChainData thisData = MComponentData::popChainData();\n\n        WId chainParentWinId = thisData.first;\n\n        setWindowChainedProperty(chainParentWinId, effectiveWinId());\n    } else {\n        setWindowChainedProperty(0, effectiveWinId());\n    }\n#endif \/\/Q_WS_X11\n}\n\nvoid MSheetStandAloneWindow::maximizeSheetArea()\n{\n    setStatusBarVisible(false);\n}\n\nvoid MSheetStandAloneWindow::restoreSheetArea()\n{\n    setStatusBarVisible(sheet->isStatusBarVisibleInSystemwide());\n}\n\n<commit_msg>Fixes: NB#268062 - Segmentation fault when systemwide sheet's statusbar visibility state is changed during sheet is appearing.<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 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 \"msheetstandalonewindow.h\"\n#include <mdeviceprofile.h>\n#include <mdismissevent.h>\n#include <mscenemanager.h>\n#include <msheet.h>\n#include <mstatusbar.h>\n#include <mcomponentdata.h>\n\n#include <QApplication>\n#include <QTimer>\n\n#ifdef Q_WS_X11\n# include <QX11Info>\n# include <X11\/Xatom.h>\n# include <X11\/Xlib.h>\n#endif\n\nMSheetStandAloneWindow::MSheetStandAloneWindow()\n    : MWindow(new MSceneManager, 0)\n    , beingClosed(false)\n    , sheet(0)\n    , statusBar(0)\n{\n    setRoundedCornersEnabled(true);\n#ifdef Q_WS_X11\n    appendMSheetTypeProperty();\n#endif \/\/Q_WS_X11\n}\n\nMSheetStandAloneWindow::~MSheetStandAloneWindow()\n{\n    delete statusBar;\n    statusBar = 0;\n}\n\nvoid MSheetStandAloneWindow::setSheet(MSheet *sheet)\n{\n    this->sheet = sheet;\n}\n\nvoid MSheetStandAloneWindow::setStatusBarVisible(bool statusBarVisible)\n{\n    if (!statusBar && MDeviceProfile::instance()->showStatusbar()\n            && statusBarVisible)\n        statusBar = new MStatusBar;\n\n    if (statusBar) {\n        if (statusBarVisible) {\n            if (isVisible())\n                sceneManager()->appearSceneWindow(statusBar);\n            else\n                sceneManager()->appearSceneWindowNow(statusBar);\n        } else {\n            sceneManager()->disappearSceneWindow(statusBar);\n        }\n    }\n}\n\nvoid MSheetStandAloneWindow::closeEvent(QCloseEvent *event)\n{\n    if (sheet) {\n        MDismissEvent dismissEvent;\n        QApplication::sendEvent(sheet, &dismissEvent);\n\n        event->setAccepted(dismissEvent.isAccepted());\n    } else {\n        event->accept();\n    }\n\n    beingClosed = event->isAccepted();\n}\n\nvoid MSheetStandAloneWindow::showEvent(QShowEvent *event)\n{\n    Q_UNUSED(event);\n    \/\/ reset variable\n    beingClosed = false;\n}\n\nvoid MSheetStandAloneWindow::hideEvent(QHideEvent *event)\n{\n    Q_UNUSED(event);\n\n    if (!sheet)\n        return;\n\n    \/\/ OBS: disappear only on the next event loop as we might be\n    \/\/ called from within MSceneWindowPrivate::canDisappear()\n\n    if (beingClosed) {\n        QTimer::singleShot(0, sheet, SIGNAL(_q_dismissSystemSheetImmediately()));\n    } else {\n        QTimer::singleShot(0, sheet, SIGNAL(_q_makeSystemSheetDisappearImmediately()));\n    }\n}\n\n#ifdef Q_WS_X11\nvoid MSheetStandAloneWindow::appendMSheetTypeProperty()\n{\n    Atom atomWindowType = XInternAtom(QX11Info::display(),\n                                      \"_MEEGOTOUCH_NET_WM_WINDOW_TYPE_SHEET\", False);\n\n    XChangeProperty(QX11Info::display(), effectiveWinId(),\n                    XInternAtom(QX11Info::display(), \"_NET_WM_WINDOW_TYPE\", False),\n                    XA_ATOM, 32, PropModeAppend, (unsigned char*) &atomWindowType, 1);\n}\n\nvoid MSheetStandAloneWindow::setWindowChainedProperty(const WId &parentWinId, const WId &childWinId)\n{\n    Atom atomMInvokedBy = XInternAtom(QX11Info::display(), \"_MEEGOTOUCH_WM_INVOKED_BY\", False);\n    Display *display = QX11Info::display();\n\n    \/\/ for compositor page transition\n    XChangeProperty(display, childWinId,\n            atomMInvokedBy, XA_WINDOW,\n            32, PropModeReplace,\n            (unsigned char *)&parentWinId, 1);\n\n    \/\/ for task switcher view stacking\n    XSetTransientForHint(display, childWinId, parentWinId);\n}\n#endif \/\/Q_WS_X11\n\nvoid MSheetStandAloneWindow::updateChainTaskData()\n{\n#ifdef Q_WS_X11\n    \/\/ here we try to inject the chainTaskData into this MSheetStandAloneWindow\n    if (!MComponentData::chainDataStackIsEmpty()) {\n        MComponentData::ChainData thisData = MComponentData::popChainData();\n\n        WId chainParentWinId = thisData.first;\n\n        setWindowChainedProperty(chainParentWinId, effectiveWinId());\n    } else {\n        setWindowChainedProperty(0, effectiveWinId());\n    }\n#endif \/\/Q_WS_X11\n}\n\nvoid MSheetStandAloneWindow::maximizeSheetArea()\n{\n    setStatusBarVisible(false);\n}\n\nvoid MSheetStandAloneWindow::restoreSheetArea()\n{\n    if (sheet) {\n        setStatusBarVisible(sheet->isStatusBarVisibleInSystemwide());\n    }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"actions.h\"\n#include \"..\/render\/render.h\"\n#include \"..\/render\/html\/page.h\"\n#include \"..\/render\/http.h\"\n#include \"..\/render\/json.h\"\n#include \"..\/session.h\"\n#include \"..\/number.h\"\n#include \"..\/path.h\"\n#include \"..\/log.h\"\n#include \"..\/track.h\"\n#include \"..\/user.h\"\n#include \"..\/cgi.h\"\n#include \"..\/media.h\"\n#include <string.h>\n#include <fstream>\n#include <taglib\/mpegfile.h>\n#include <taglib\/tag.h>\n#include <sys\/stat.h>\n\nusing namespace Render;\nusing namespace Json;\n\nstd::string getTitle(const char *filename){\n    TagLib::MPEG::File f(filename);\n    TagLib::Tag *t = f.tag();\n    return t? t->title().to8Bit(): \"\";\n}\n\nvoid Action::uploadTrack(int id){\n    User u = Session::user();\n    Track t(id);\n\n    cgicc::file_iterator qqfile = cgi.getFile(\"qqfile\");\n    bool js = cgi(\"js\") != \"no\";\n\n    if(js) Http::header(\"text\/html\"); \/\/ Opera\n\n    if(t && t.artist() != u){\n        if(js) o << \"{\" << field(\"success\",\"false\",true) << \"}\";\n        else Http::redirect(u ? u.url() : \"\/\");\n        return;\n    }\n\n    std::string dir = eqbeatsDir() + \"\/tmp\";\n    char *tmpFile = tempnam(dir.c_str(), \"eqb\");\n    std::ofstream out(tmpFile, std::ios_base::binary);\n    std::string upfilename;\n\n    if(qqfile != cgi.getFiles().end())\n        qqfile->writeToStream(out);\n    else if(js) {\n        out << cgi.getEnvironment().getPostData();\n        upfilename = cgi(\"qqfile\");\n    }\n    out.close();\n\n    if(id == -1){\n        std::string title = getTitle(tmpFile);\n        if(title.empty())\n            title = upfilename.substr(0, upfilename.rfind('.'));\n        t = Track::create(u.id(), title.empty()? \"Untitled\":title);\n    }\n\n    std::string filename = eqbeatsDir() + \"\/tracks\/\"+number(t.id())+\".mp3\";\n    rename(tmpFile, filename.c_str());\n    free(tmpFile);\n\n    log(\"Track uploaded: \" + t.title() + \" (\" + number(t.id()) + \")\");\n\n    Media m(t);\n    m.updateTags(Track::MP3);\n    m.convertToVorbis();\n    if(js)\n        o << \"{\"+field(\"success\",\"true\")+field(\"track\",number(t.id()))+field(\"title\",jstring(t.title()),true)+\"}\";\n    else Http::redirect(t.url());\n}\n\nvoid Action::newTrack(){\n    uploadTrack(-1);\n}\n<commit_msg>check if the user is logged in uploadTrack<commit_after>#include \"actions.h\"\n#include \"..\/render\/render.h\"\n#include \"..\/render\/html\/page.h\"\n#include \"..\/render\/http.h\"\n#include \"..\/render\/json.h\"\n#include \"..\/session.h\"\n#include \"..\/number.h\"\n#include \"..\/path.h\"\n#include \"..\/log.h\"\n#include \"..\/track.h\"\n#include \"..\/user.h\"\n#include \"..\/cgi.h\"\n#include \"..\/media.h\"\n#include <string.h>\n#include <fstream>\n#include <taglib\/mpegfile.h>\n#include <taglib\/tag.h>\n#include <sys\/stat.h>\n\nusing namespace Render;\nusing namespace Json;\n\nstd::string getTitle(const char *filename){\n    TagLib::MPEG::File f(filename);\n    TagLib::Tag *t = f.tag();\n    return t? t->title().to8Bit(): \"\";\n}\n\nvoid Action::uploadTrack(int id){\n    User u = Session::user();\n    if(!u) return Http::redirect(Track::url(id));\n\n    cgicc::file_iterator qqfile = cgi.getFile(\"qqfile\");\n    bool js = cgi(\"js\") != \"no\";\n\n    if(js) Http::header(\"text\/html\"); \/\/ Opera\n\n    Track t(id);\n    if(t && t.artist() != u){\n        if(js) o << \"{\" << field(\"success\",\"false\",true) << \"}\";\n        else Http::redirect(u ? u.url() : \"\/\");\n        return;\n    }\n\n    std::string dir = eqbeatsDir() + \"\/tmp\";\n    char *tmpFile = tempnam(dir.c_str(), \"eqb\");\n    std::ofstream out(tmpFile, std::ios_base::binary);\n    std::string upfilename;\n\n    if(qqfile != cgi.getFiles().end())\n        qqfile->writeToStream(out);\n    else if(js) {\n        out << cgi.getEnvironment().getPostData();\n        upfilename = cgi(\"qqfile\");\n    }\n    out.close();\n\n    if(id == -1){\n        std::string title = getTitle(tmpFile);\n        if(title.empty())\n            title = upfilename.substr(0, upfilename.rfind('.'));\n        t = Track::create(u.id(), title.empty()? \"Untitled\":title);\n    }\n\n    std::string filename = eqbeatsDir() + \"\/tracks\/\"+number(t.id())+\".mp3\";\n    rename(tmpFile, filename.c_str());\n    free(tmpFile);\n\n    log(\"Track uploaded: \" + t.title() + \" (\" + number(t.id()) + \")\");\n\n    Media m(t);\n    m.updateTags(Track::MP3);\n    m.convertToVorbis();\n    if(js)\n        o << \"{\"+field(\"success\",\"true\")+field(\"track\",number(t.id()))+field(\"title\",jstring(t.title()),true)+\"}\";\n    else Http::redirect(t.url());\n}\n\nvoid Action::newTrack(){\n    uploadTrack(-1);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n* @file CleanRoleDecision.h\n*\n* @author <a href=\"mailto:schahin.tofangchi@hu-berlin.de\">Schahin Tofangchi<\/a>\n*\/\n\n#include \"CleanRoleDecision.h\"\n#include <PlatformInterface\/Platform.h>\n#include <Tools\/DataConversion.h>\n\n#include <math.h>\n#include <list>\n\nusing namespace std;\n\n\nCleanRoleDecision::CleanRoleDecision()\n{\n  getDebugParameterList().add(&parameters);\n}\n\nCleanRoleDecision::~CleanRoleDecision()\n{\n  getDebugParameterList().remove(&parameters);\n}\n\nvoid CleanRoleDecision::execute() {\n    computeStrikers();\n\n    \/\/ reset second striker decision, if we doesn't want to use the second striker\n    if(!parameters.useSecondStriker) {\n        getRoleDecisionModel().secondStriker = std::numeric_limits<int>::max();\n    }\n}\/\/end execute\n\nvoid CleanRoleDecision::computeStrikers()\n{\n    \/\/ skip \"first frame\"! (until i add myself to teamcomm)\n    if(getTeamMessage().data.find(getPlayerInfo().playerNumber) == getTeamMessage().data.end()) { return; }\n\n    \/\/ container storing robots, which want to be striker, sorted by their playernumber and their time to ball\n    std::map<unsigned int, unsigned int> possible_striker;\n\n    \/\/ iterate over all robots(messages)\n    for (auto const& i : getTeamMessage().data) {\n        unsigned int robotNumber = i.first;\n        const TeamMessageData& msg = i.second;\n\n        \/\/ if striker lost the ball, he gets a time bonus before he lost the ball completely ...\n        double loose_ball_bonus = msg.playerNumber == getRoleDecisionModel().firstStriker?parameters.strikerBonusTime:0.0;\n\n        \/\/ check if the robot is able to play and sees the ball\n        bool isRobotInactive = msg.fallen\n                || msg.custom.isPenalized\n                || msg.ballAge < 0 \/\/Ball was never seen\n                || (msg.ballAge + getFrameInfo().getTimeSince(msg.frameInfo.getTime()) > parameters.maxBallLostTime + loose_ball_bonus); \/\/Ball isn't fresh\n\n        \/\/ ignore \"DEAD\" and inactive robots\n        if(robotNumber != getPlayerInfo().playerNumber && (getTeamMessagePlayerIsAlive().isDead(robotNumber) || isRobotInactive)) { continue; }\n\n        \/\/ for all active robots, which sees the ball AND previously announced to want to be striker OR is striker ...\n        if (msg.custom.wantsToBeStriker || msg.custom.wasStriker) {\n            \/\/ ... remember them as possible striker with their time to ball\n            possible_striker[robotNumber] = msg.custom.timeToBall;\n        }\n    }\/\/end for\n\n    \/\/ get my own message\n    auto ownMessage = getTeamMessage().data.at(getPlayerInfo().playerNumber);\n    \/\/ i want to be striker, if i'm not the goalie and i'm \"active\" (not fallen\/panelized, see the ball)!!!\n    getRoleDecisionModel().wantsToBeStriker = ownMessage.playerNumber != 1\n                                              && !(ownMessage.fallen || ownMessage.custom.isPenalized || ownMessage.ballAge < 0\n                                              || (ownMessage.ballAge + getFrameInfo().getTimeSince(ownMessage.frameInfo.getTime()) > parameters.maxBallLostTime + (getPlayerInfo().playerNumber==getRoleDecisionModel().firstStriker?parameters.strikerBonusTime:0.0)));\n\n    \/\/ if i'm striker, i get a time bonus!\n    \/\/ NOTE: ownTimeToBall can be negative if the robot is close to ball (!)\n    double ownTimeToBall = static_cast<double>(ownMessage.custom.timeToBall) - (ownMessage.custom.wasStriker ? 300.0 : 0.0);\n\n    \/\/ clear for new striker decision\n    getRoleDecisionModel().resetStriker();\n    \/\/ set the new striker\n    switch (parameters.strikerSelection) {\n        case 1:  strikerSelectionByTime(possible_striker, ownTimeToBall); break;\n        case 2:  strikerSelectionByTimeExceptGoalie(possible_striker, ownTimeToBall); break;\n        case 3:  strikerSelectionByTimeExceptGoalieWithBallCompare(possible_striker, ownTimeToBall); break;\n        default: strikerSelectionByNumber(possible_striker, ownTimeToBall); break;\n    }\n\n    PLOT(std::string(\"CleanRoleDecision:FirstStrikerDecision\"), getRoleDecisionModel().firstStriker);\n    PLOT(std::string(\"CleanRoleDecision:SecondStrikerDecision\"), getRoleDecisionModel().secondStriker);\n    PLOT(std::string(\"CleanRoleDecision:PossibleStriker\"), static_cast<double>(possible_striker.size()));\n}\n\nvoid CleanRoleDecision::strikerSelectionByNumber(std::map<unsigned int, unsigned int>& possible_striker, double& ownTimeToBall)\n{\n    for (auto it = possible_striker.cbegin(); it != possible_striker.cend(); ++it) {\n        \/\/If two robots want to be striker, the one with a smaller number is favoured => is the first in the map!!\n        \/\/ NOTE: we're doesn't using 'timeToBall' as decision criteria by intention!\n        \/\/       if goalie is striker, he get's the first striker\n        if(getRoleDecisionModel().firstStriker == std::numeric_limits<int>::max()) {\n            getRoleDecisionModel().firstStriker = it->first;\n        } else if (getRoleDecisionModel().secondStriker == std::numeric_limits<int>::max()) {\n            getRoleDecisionModel().secondStriker = it->first;\n        }\n        \/\/ if there's a robot closer to the ball than myself, i don't want to be striker!\n        if(it->second < ownTimeToBall) {\n            getRoleDecisionModel().wantsToBeStriker = false;\n        }\n    }\n}\n\nvoid CleanRoleDecision::strikerSelectionByTime(std::map<unsigned int, unsigned int>& possible_striker, double &ownTimeToBall)\n{\n    unsigned int stFastest = std::numeric_limits<unsigned int>::max(); \/\/ time to ball of the fastest player\n    unsigned int ndFastest = std::numeric_limits<unsigned int>::max(); \/\/ time to ball of the second fastest player\n\n    for (auto it = possible_striker.cbegin(); it != possible_striker.cend(); ++it) {\n        \/\/ current player faster?\n        if(it->second < stFastest) {\n            \/\/ is there already a \"fastest\" striker ... but the current player is faster\n            if(getRoleDecisionModel().firstStriker != std::numeric_limits<int>::max()) {\n                \/\/ make the previous player the \"second fastest\" player\n                getRoleDecisionModel().secondStriker = getRoleDecisionModel().firstStriker;\n                ndFastest = stFastest;\n            }\n            \/\/ set the fastest player\n            getRoleDecisionModel().firstStriker = it->first;\n            stFastest = it->second;\n        } else if (it->second < ndFastest) {\n            \/\/ set the second fastest player\n            getRoleDecisionModel().secondStriker = it->first;\n            ndFastest = it->second;\n        }\n        \/\/ if there's a 2nd robot closer to the ball than myself, i don't want to be (second)striker!\n        if(ndFastest < ownTimeToBall) {\n            getRoleDecisionModel().wantsToBeStriker = false;\n        }\n    }\n}\n\nvoid CleanRoleDecision::strikerSelectionByTimeExceptGoalie(std::map<unsigned int, unsigned int>& possible_striker, double &ownTimeToBall)\n{\n    unsigned int stFastest = std::numeric_limits<unsigned int>::max(); \/\/ time to ball of the fastest player\n    unsigned int ndFastest = std::numeric_limits<unsigned int>::max(); \/\/ time to ball of the second fastest player\n\n    \/\/ NOTE: if the goalie is one of the \"possible striker\", it gets set as first strike! (sorted map!)\n    \/\/       and doesn't change, even if someone is faster (condition!)\n    \/\/ ATTENTION: we're iterating from the smallest player number to the highest!\n    for (auto it = possible_striker.cbegin(); it != possible_striker.cend(); ++it) {\n        \/\/ is current player clearly faster?\n        if(it->second < stFastest && (it->second + parameters.strikerSelectionDiffThreshold) < stFastest && getRoleDecisionModel().firstStriker != 1) {\n            \/\/ is there already a \"fastest\" striker ... but the current player is faster\n            if(getRoleDecisionModel().firstStriker != std::numeric_limits<int>::max()) {\n                \/\/ make the previous player the \"second fastest\" player\n                getRoleDecisionModel().secondStriker = getRoleDecisionModel().firstStriker;\n                ndFastest = stFastest;\n            }\n            \/\/ set the fastest player\n            getRoleDecisionModel().firstStriker = it->first;\n            stFastest = it->second;\n        } else if (it->second < ndFastest && (it->second + parameters.strikerSelectionDiffThreshold) < ndFastest) {\n            \/\/ set the second (clearly) fastest player\n            getRoleDecisionModel().secondStriker = it->first;\n            ndFastest = it->second;\n        }\n        \/\/ if there's a 2nd robot closer to the ball than myself, i don't want to be (second)striker!\n        if(ndFastest < ownTimeToBall) {\n            getRoleDecisionModel().wantsToBeStriker = false;\n        }\n    }\n}\n\nvoid CleanRoleDecision::strikerSelectionByTimeExceptGoalieWithBallCompare(std::map<unsigned int, unsigned int>& possible_striker, double &ownTimeToBall)\n{\n    unsigned int stFastest = std::numeric_limits<unsigned int>::max(); \/\/ time to ball of the fastest player\n    unsigned int ndFastest = std::numeric_limits<unsigned int>::max(); \/\/ time to ball of the second fastest player\n\n    \/\/ NOTE: if the goalie is one of the \"possible striker\", it gets set as first strike! (sorted map!)\n    \/\/       and doesn't change, even if someone is faster (condition!)\n    \/\/ ATTENTION: we're iterating from the smallest player number to the highest!\n    for (auto it = possible_striker.cbegin(); it != possible_striker.cend(); ++it) {\n        \/\/ is current player clearly faster?\n        if(it->second < stFastest && (it->second + parameters.strikerSelectionDiffThreshold) < stFastest && getRoleDecisionModel().firstStriker != 1) {\n            \/\/ is there already a \"fastest\" striker ... but the current player is faster\n            if(getRoleDecisionModel().firstStriker != std::numeric_limits<int>::max() && isSecondStrikerDifferentFromFirst(getRoleDecisionModel().firstStriker, it->first)) {\n                \/\/ make the previous player the \"second fastest\" player, if they see different balls\n                getRoleDecisionModel().secondStriker = getRoleDecisionModel().firstStriker;\n                ndFastest = stFastest;\n            }\n            \/\/ set the fastest player\n            getRoleDecisionModel().firstStriker = it->first;\n            stFastest = it->second;\n        } else if (it->second < ndFastest && (it->second + parameters.strikerSelectionDiffThreshold) < ndFastest && isSecondStrikerDifferentFromFirst(getRoleDecisionModel().firstStriker, it->first)) {\n            \/\/ make the previous player the \"second fastest\" player, if they see different balls\n            getRoleDecisionModel().secondStriker = it->first;\n            ndFastest = it->second;\n        }\n        \/\/ if there's a 2nd robot closer to the ball than myself, i don't want to be (second)striker!\n        if(ndFastest < ownTimeToBall) {\n            getRoleDecisionModel().wantsToBeStriker = false;\n        }\n    }\n}\n\nbool CleanRoleDecision::isSecondStrikerDifferentFromFirst(unsigned int firstNumber, unsigned int secondNumber) {\n    \/\/ retrieve the message of the players\n    const auto& first = getTeamMessage().data.at(firstNumber);\n    const auto& second = getTeamMessage().data.at(secondNumber);\n    \/\/ get the global ball position\n    Vector2d firstBall = first.pose * first.ballPosition;\n    Vector2d secondBall = second.pose * second.ballPosition;\n    \/\/ check if the ball distance is greater than the given parameter distance\n    return ((firstBall - secondBall).abs2() > parameters.firstSecondStrikerBallDistance*parameters.firstSecondStrikerBallDistance);\n}\n<commit_msg>fixed comparison of \"invalid\" player number<commit_after>\/**\n* @file CleanRoleDecision.h\n*\n* @author <a href=\"mailto:schahin.tofangchi@hu-berlin.de\">Schahin Tofangchi<\/a>\n*\/\n\n#include \"CleanRoleDecision.h\"\n#include <PlatformInterface\/Platform.h>\n#include <Tools\/DataConversion.h>\n\n#include <math.h>\n#include <list>\n\nusing namespace std;\n\n\nCleanRoleDecision::CleanRoleDecision()\n{\n  getDebugParameterList().add(&parameters);\n}\n\nCleanRoleDecision::~CleanRoleDecision()\n{\n  getDebugParameterList().remove(&parameters);\n}\n\nvoid CleanRoleDecision::execute() {\n    computeStrikers();\n\n    \/\/ reset second striker decision, if we doesn't want to use the second striker\n    if(!parameters.useSecondStriker) {\n        getRoleDecisionModel().secondStriker = std::numeric_limits<unsigned int>::max();\n    }\n}\/\/end execute\n\nvoid CleanRoleDecision::computeStrikers()\n{\n    \/\/ skip \"first frame\"! (until i add myself to teamcomm)\n    if(getTeamMessage().data.find(getPlayerInfo().playerNumber) == getTeamMessage().data.end()) { return; }\n\n    \/\/ container storing robots, which want to be striker, sorted by their playernumber and their time to ball\n    std::map<unsigned int, unsigned int> possible_striker;\n\n    \/\/ iterate over all robots(messages)\n    for (auto const& i : getTeamMessage().data) {\n        unsigned int robotNumber = i.first;\n        const TeamMessageData& msg = i.second;\n\n        \/\/ if striker lost the ball, he gets a time bonus before he lost the ball completely ...\n        double loose_ball_bonus = msg.playerNumber == getRoleDecisionModel().firstStriker?parameters.strikerBonusTime:0.0;\n\n        \/\/ check if the robot is able to play and sees the ball\n        bool isRobotInactive = msg.fallen\n                || msg.custom.isPenalized\n                || msg.ballAge < 0 \/\/Ball was never seen\n                || (msg.ballAge + getFrameInfo().getTimeSince(msg.frameInfo.getTime()) > parameters.maxBallLostTime + loose_ball_bonus); \/\/Ball isn't fresh\n\n        \/\/ ignore \"DEAD\" and inactive robots\n        if(robotNumber != getPlayerInfo().playerNumber && (getTeamMessagePlayerIsAlive().isDead(robotNumber) || isRobotInactive)) { continue; }\n\n        \/\/ for all active robots, which sees the ball AND previously announced to want to be striker OR is striker ...\n        if (msg.custom.wantsToBeStriker || msg.custom.wasStriker) {\n            \/\/ ... remember them as possible striker with their time to ball\n            possible_striker[robotNumber] = msg.custom.timeToBall;\n        }\n    }\/\/end for\n\n    \/\/ get my own message\n    auto ownMessage = getTeamMessage().data.at(getPlayerInfo().playerNumber);\n    \/\/ i want to be striker, if i'm not the goalie and i'm \"active\" (not fallen\/panelized, see the ball)!!!\n    getRoleDecisionModel().wantsToBeStriker = ownMessage.playerNumber != 1\n                                              && !(ownMessage.fallen || ownMessage.custom.isPenalized || ownMessage.ballAge < 0\n                                              || (ownMessage.ballAge + getFrameInfo().getTimeSince(ownMessage.frameInfo.getTime()) > parameters.maxBallLostTime + (getPlayerInfo().playerNumber==getRoleDecisionModel().firstStriker?parameters.strikerBonusTime:0.0)));\n\n    \/\/ if i'm striker, i get a time bonus!\n    \/\/ NOTE: ownTimeToBall can be negative if the robot is close to ball (!)\n    double ownTimeToBall = static_cast<double>(ownMessage.custom.timeToBall) - (ownMessage.custom.wasStriker ? 300.0 : 0.0);\n\n    \/\/ clear for new striker decision\n    getRoleDecisionModel().resetStriker();\n    \/\/ set the new striker\n    switch (parameters.strikerSelection) {\n        case 1:  strikerSelectionByTime(possible_striker, ownTimeToBall); break;\n        case 2:  strikerSelectionByTimeExceptGoalie(possible_striker, ownTimeToBall); break;\n        case 3:  strikerSelectionByTimeExceptGoalieWithBallCompare(possible_striker, ownTimeToBall); break;\n        default: strikerSelectionByNumber(possible_striker, ownTimeToBall); break;\n    }\n\n    PLOT(std::string(\"CleanRoleDecision:FirstStrikerDecision\"), getRoleDecisionModel().firstStriker);\n    PLOT(std::string(\"CleanRoleDecision:SecondStrikerDecision\"), getRoleDecisionModel().secondStriker);\n    PLOT(std::string(\"CleanRoleDecision:PossibleStriker\"), static_cast<double>(possible_striker.size()));\n}\n\nvoid CleanRoleDecision::strikerSelectionByNumber(std::map<unsigned int, unsigned int>& possible_striker, double& ownTimeToBall)\n{\n    for (auto it = possible_striker.cbegin(); it != possible_striker.cend(); ++it) {\n        \/\/If two robots want to be striker, the one with a smaller number is favoured => is the first in the map!!\n        \/\/ NOTE: we're doesn't using 'timeToBall' as decision criteria by intention!\n        \/\/       if goalie is striker, he get's the first striker\n        if(getRoleDecisionModel().firstStriker == std::numeric_limits<unsigned int>::max()) {\n            getRoleDecisionModel().firstStriker = it->first;\n        } else if (getRoleDecisionModel().secondStriker == std::numeric_limits<unsigned int>::max()) {\n            getRoleDecisionModel().secondStriker = it->first;\n        }\n        \/\/ if there's a robot closer to the ball than myself, i don't want to be striker!\n        if(it->second < ownTimeToBall) {\n            getRoleDecisionModel().wantsToBeStriker = false;\n        }\n    }\n}\n\nvoid CleanRoleDecision::strikerSelectionByTime(std::map<unsigned int, unsigned int>& possible_striker, double &ownTimeToBall)\n{\n    unsigned int stFastest = std::numeric_limits<unsigned int>::max(); \/\/ time to ball of the fastest player\n    unsigned int ndFastest = std::numeric_limits<unsigned int>::max(); \/\/ time to ball of the second fastest player\n\n    for (auto it = possible_striker.cbegin(); it != possible_striker.cend(); ++it) {\n        \/\/ current player faster?\n        if(it->second < stFastest) {\n            \/\/ is there already a \"fastest\" striker ... but the current player is faster\n            if(getRoleDecisionModel().firstStriker != std::numeric_limits<unsigned int>::max()) {\n                \/\/ make the previous player the \"second fastest\" player\n                getRoleDecisionModel().secondStriker = getRoleDecisionModel().firstStriker;\n                ndFastest = stFastest;\n            }\n            \/\/ set the fastest player\n            getRoleDecisionModel().firstStriker = it->first;\n            stFastest = it->second;\n        } else if (it->second < ndFastest) {\n            \/\/ set the second fastest player\n            getRoleDecisionModel().secondStriker = it->first;\n            ndFastest = it->second;\n        }\n        \/\/ if there's a 2nd robot closer to the ball than myself, i don't want to be (second)striker!\n        if(ndFastest < ownTimeToBall) {\n            getRoleDecisionModel().wantsToBeStriker = false;\n        }\n    }\n}\n\nvoid CleanRoleDecision::strikerSelectionByTimeExceptGoalie(std::map<unsigned int, unsigned int>& possible_striker, double &ownTimeToBall)\n{\n    unsigned int stFastest = std::numeric_limits<unsigned int>::max(); \/\/ time to ball of the fastest player\n    unsigned int ndFastest = std::numeric_limits<unsigned int>::max(); \/\/ time to ball of the second fastest player\n\n    \/\/ NOTE: if the goalie is one of the \"possible striker\", it gets set as first strike! (sorted map!)\n    \/\/       and doesn't change, even if someone is faster (condition!)\n    \/\/ ATTENTION: we're iterating from the smallest player number to the highest!\n    for (auto it = possible_striker.cbegin(); it != possible_striker.cend(); ++it) {\n        \/\/ is current player clearly faster?\n        if(it->second < stFastest && (it->second + parameters.strikerSelectionDiffThreshold) < stFastest && getRoleDecisionModel().firstStriker != 1) {\n            \/\/ is there already a \"fastest\" striker ... but the current player is faster\n            if(getRoleDecisionModel().firstStriker != std::numeric_limits<unsigned int>::max()) {\n                \/\/ make the previous player the \"second fastest\" player\n                getRoleDecisionModel().secondStriker = getRoleDecisionModel().firstStriker;\n                ndFastest = stFastest;\n            }\n            \/\/ set the fastest player\n            getRoleDecisionModel().firstStriker = it->first;\n            stFastest = it->second;\n        } else if (it->second < ndFastest && (it->second + parameters.strikerSelectionDiffThreshold) < ndFastest) {\n            \/\/ set the second (clearly) fastest player\n            getRoleDecisionModel().secondStriker = it->first;\n            ndFastest = it->second;\n        }\n        \/\/ if there's a 2nd robot closer to the ball than myself, i don't want to be (second)striker!\n        if(ndFastest < ownTimeToBall) {\n            getRoleDecisionModel().wantsToBeStriker = false;\n        }\n    }\n}\n\nvoid CleanRoleDecision::strikerSelectionByTimeExceptGoalieWithBallCompare(std::map<unsigned int, unsigned int>& possible_striker, double &ownTimeToBall)\n{\n    unsigned int stFastest = std::numeric_limits<unsigned int>::max(); \/\/ time to ball of the fastest player\n    unsigned int ndFastest = std::numeric_limits<unsigned int>::max(); \/\/ time to ball of the second fastest player\n\n    \/\/ NOTE: if the goalie is one of the \"possible striker\", it gets set as first strike! (sorted map!)\n    \/\/       and doesn't change, even if someone is faster (condition!)\n    \/\/ ATTENTION: we're iterating from the smallest player number to the highest!\n    for (auto it = possible_striker.cbegin(); it != possible_striker.cend(); ++it) {\n        \/\/ is current player clearly faster?\n        if(it->second < stFastest && (it->second + parameters.strikerSelectionDiffThreshold) < stFastest && getRoleDecisionModel().firstStriker != 1) {\n            \/\/ is there already a \"fastest\" striker ... but the current player is faster\n            if(getRoleDecisionModel().firstStriker != std::numeric_limits<unsigned int>::max() && isSecondStrikerDifferentFromFirst(getRoleDecisionModel().firstStriker, it->first)) {\n                \/\/ make the previous player the \"second fastest\" player, if they see different balls\n                getRoleDecisionModel().secondStriker = getRoleDecisionModel().firstStriker;\n                ndFastest = stFastest;\n            }\n            \/\/ set the fastest player\n            getRoleDecisionModel().firstStriker = it->first;\n            stFastest = it->second;\n        } else if (it->second < ndFastest && (it->second + parameters.strikerSelectionDiffThreshold) < ndFastest && isSecondStrikerDifferentFromFirst(getRoleDecisionModel().firstStriker, it->first)) {\n            \/\/ make the previous player the \"second fastest\" player, if they see different balls\n            getRoleDecisionModel().secondStriker = it->first;\n            ndFastest = it->second;\n        }\n        \/\/ if there's a 2nd robot closer to the ball than myself, i don't want to be (second)striker!\n        if(ndFastest < ownTimeToBall) {\n            getRoleDecisionModel().wantsToBeStriker = false;\n        }\n    }\n}\n\nbool CleanRoleDecision::isSecondStrikerDifferentFromFirst(unsigned int firstNumber, unsigned int secondNumber) {\n    \/\/ retrieve the message of the players\n    const auto& first = getTeamMessage().data.at(firstNumber);\n    const auto& second = getTeamMessage().data.at(secondNumber);\n    \/\/ get the global ball position\n    Vector2d firstBall = first.pose * first.ballPosition;\n    Vector2d secondBall = second.pose * second.ballPosition;\n    \/\/ check if the ball distance is greater than the given parameter distance\n    return ((firstBall - secondBall).abs2() > parameters.firstSecondStrikerBallDistance*parameters.firstSecondStrikerBallDistance);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/!\n\/\/! @file   HydraulicPressureControlledValve.hpp\n\/\/! @author Robert Braun <robert.braun@liu.se>\n\/\/! @date   2010-01-13\n\/\/!\n\/\/! @brief Contains a hydraulic pressure controlled valve with first order dynamics\n\/\/!\n\/\/$Id$\n\n#ifndef HYDRAULICPRESSURECONTROLLEDVALVE_HPP_INCLUDED\n#define HYDRAULICPRESSURECONTROLLEDVALVE_HPP_INCLUDED\n\n#include <iostream>\n#include <sstream>\n#include \"..\/..\/ComponentEssentials.h\"\n#include \"..\/..\/ComponentUtilities.h\"\n\nnamespace hopsan {\n\n    \/\/!\n    \/\/! @brief\n    \/\/! @ingroup HydraulicComponents\n    \/\/!\n    class HydraulicPressureControlledValve : public ComponentQ\n    {\n    private:\n        double x0, x0max, pref, tao, Kcs, Kcf, Cs, Cf, pnom, qnom, ph;\n        double mPrevX0;\n        TurbulentFlowFunction mTurb;\n        ValveHysteresis mHyst;\n        FirstOrderFilter mFilterLP;\n        \/\/SecondOrderTransferFunction mFilterLP;\n\n        double *mpND_p1, *mpND_q1, *mpND_c1, *mpND_Zc1, *mpND_p2, *mpND_q2, *mpND_c2, *mpND_Zc2,\n               *mpND_p_open, *mpND_c_open, *mpND_p_close, *mpND_c_close;\n\n        Port *mpP1, *mpP2, *mpP_OPEN, *mpP_CLOSE;\n\n    public:\n        static Component *Creator()\n        {\n            return new HydraulicPressureControlledValve(\"PressureControlledValve\");\n        }\n\n        HydraulicPressureControlledValve(const std::string name) : ComponentQ(name)\n        {\n            pref = 2000000;\n            tao = 0.01;\n            Kcs = 0.00000001;\n            Kcf = 0.00000001;\n            qnom = 0.001;\n            ph = 500000;\n            pnom = 7e6f;\n\n            mpP1 = addPowerPort(\"P1\", \"NodeHydraulic\");\n            mpP2 = addPowerPort(\"P2\", \"NodeHydraulic\");\n            mpP_OPEN = addPowerPort(\"P_OPEN\", \"NodeHydraulic\");\n            mpP_CLOSE = addPowerPort(\"P_CLOSE\", \"NodeHydraulic\");\n\n            registerParameter(\"p_ref\", \"Reference Opening Pressure\", \"[Pa]\", pref);\n            registerParameter(\"tao\", \"Time Constant of Spool\", \"[s]\", tao);\n            registerParameter(\"k_c,s\", \"Steady State Characteristic due to Spring\", \"[(m^3\/s)\/Pa]\", Kcs);\n            registerParameter(\"k_c,f\", \"Steady State Characteristic due to Flow Forces\", \"[(m^3\/s)\/Pa]\", Kcf);\n            registerParameter(\"q_nom\", \"Flow with Fully Open Valve and pressure drop Pnom\", \"[m^3\/s]\", qnom);\n            registerParameter(\"p_h\", \"Hysteresis Width\", \"[Pa]\", ph);\n        }\n\n\n        void initialize()\n        {\n            mpND_p1 = getSafeNodeDataPtr(mpP1, NodeHydraulic::PRESSURE);\n            mpND_q1 = getSafeNodeDataPtr(mpP1, NodeHydraulic::FLOW);\n            mpND_c1 = getSafeNodeDataPtr(mpP1, NodeHydraulic::WAVEVARIABLE);\n            mpND_Zc1 = getSafeNodeDataPtr(mpP1, NodeHydraulic::CHARIMP);\n\n            mpND_p2 = getSafeNodeDataPtr(mpP2, NodeHydraulic::PRESSURE);\n            mpND_q2 = getSafeNodeDataPtr(mpP2, NodeHydraulic::FLOW);\n            mpND_c2 = getSafeNodeDataPtr(mpP2, NodeHydraulic::WAVEVARIABLE);\n            mpND_Zc2 = getSafeNodeDataPtr(mpP2, NodeHydraulic::CHARIMP);\n\n            mpND_p_open = getSafeNodeDataPtr(mpP_OPEN, NodeHydraulic::PRESSURE);\n            mpND_c_open = getSafeNodeDataPtr(mpP_OPEN, NodeHydraulic::WAVEVARIABLE);\n\n            mpND_p_close = getSafeNodeDataPtr(mpP_CLOSE, NodeHydraulic::PRESSURE);\n            mpND_c_close = getSafeNodeDataPtr(mpP_CLOSE, NodeHydraulic::WAVEVARIABLE);\n\n            x0 = 0.00001;\n            mPrevX0 = 0.0;\n            Cs = sqrt(pnom)\/Kcs;\n            Cf = 1\/(Kcf * sqrt(pnom));\n            x0max = qnom\/sqrt(pnom);\n\n            double wCutoff = 1 \/ tao;      \/\/Ska det vara Timestep\/Tao?\n            \/\/double wCutoff = 100;     DEBUG\n            double num [2] = {0.0, 1.0};\n            double den [2] = {1.0\/wCutoff, 1.0};\n            mFilterLP.initialize(mTimestep, num, den, 0.0, 0.0, 0.0, x0max);\n        }\n\n\n        void simulateOneTimestep()\n        {\n            \/\/Declare local variables\n            double p1, q1, c1, Zc1, p2, q2, c2, Zc2, p_open, c_open, p_close, c_close;\n            double b1, xs, xh, xsh;\n            bool cav = false;\n\n            \/\/Get variable values from nodes\n            p1 = (*mpND_p1);\n            q1 = (*mpND_q1);\n            c1 = (*mpND_c1);\n            Zc1 = (*mpND_Zc1);\n            p2 = (*mpND_p2);\n            q2 = (*mpND_q2);\n            c2 = (*mpND_c2);\n            Zc2 = (*mpND_Zc2);\n            p_open = (*mpND_p_open);\n            c_open = (*mpND_c_open);\n            p_close = (*mpND_p_close);\n            c_close = (*mpND_c_close);\n\n            \/* Equations *\/\n\n            b1 = Cs+Cf*(p1-p2);        \/\/Help Variable, equals sqrt(p1-p2)\/Kctot\n\n            \/\/ Spool position calculation\n            xs = (p_open - pref - p_close) \/ b1;\n\n            xh = ph\/b1;\n            xsh = mHyst.getValue(xs, xh, mPrevX0);\n            x0 = mFilterLP.update(xsh);\n\n            if(mTime<0.01)\n            {\n                std::stringstream ss;\n                ss << \"xsh = \" << xsh << \", x0 = \" << x0;\n                addDebugMessage(ss.str());\n            }\n\n            \/\/ Turbulent Flow Calculation\n            mTurb.setFlowCoefficient(x0);\n            q2 = mTurb.getFlow(c1, c2, Zc1, Zc2);\n            q1 = -q2;\n\n            \/\/ Pressure Calulation\n            p1 = c1 + Zc1 * q1;\n            p2 = c2 + Zc2 * q2;\n            p_open = c_open;\n            p_close = c_close;\n\n            p_open = std::max(0.0, p_open);\n            p_close = std::max(0.0, p_close);\n\n            \/\/ Check for cavitation\n            if (p1 < 0.0)\n            {\n                c1 = 0.0;\n                Zc1 = 0.0;\n                cav = true;\n            }\n            if (p2 < 0.0)\n            {\n                c2 = 0.0;\n                Zc2 = 0.0;\n                cav = true;\n            }\n            if (cav)        \/\/Cavitatiaon, redo calculations with new c and Zc\n            {\n                q2 = mTurb.getFlow(c1, c2, Zc1, Zc2);\n                q1 = -q2;\n                p1 = c1 + Zc1 * q1;\n                p2 = c2 + Zc2 * q2;\n                if (p1 < 0.0) { p1 = 0.0; }\n                if (p2 < 0.0) { p2 = 0.0; }\n            }\n\n            mPrevX0 = x0;\n\n            \/\/Write new values to nodes\n\n            (*mpND_p1) = p1;\n            (*mpND_q1) = q1;\n            (*mpND_p2) = p2;\n            (*mpND_q2) = q2;\n            (*mpND_p_open) = p_open;\n            (*mpND_p_close) = p_close;\n        }\n    };\n}\n\n#endif \/\/ HYDRAULICPRESSURECONTROLLEDVALVE_HPP_INCLUDED\n<commit_msg>added a debug output<commit_after>\/\/!\n\/\/! @file   HydraulicPressureControlledValve.hpp\n\/\/! @author Robert Braun <robert.braun@liu.se>\n\/\/! @date   2010-01-13\n\/\/!\n\/\/! @brief Contains a hydraulic pressure controlled valve with first order dynamics\n\/\/!\n\/\/$Id$\n\n#ifndef HYDRAULICPRESSURECONTROLLEDVALVE_HPP_INCLUDED\n#define HYDRAULICPRESSURECONTROLLEDVALVE_HPP_INCLUDED\n\n#include <iostream>\n#include <sstream>\n#include \"..\/..\/ComponentEssentials.h\"\n#include \"..\/..\/ComponentUtilities.h\"\n\nnamespace hopsan {\n\n    \/\/!\n    \/\/! @brief\n    \/\/! @ingroup HydraulicComponents\n    \/\/!\n    class HydraulicPressureControlledValve : public ComponentQ\n    {\n    private:\n        double x0, x0max, pref, tao, Kcs, Kcf, Cs, Cf, pnom, qnom, ph;\n        double mPrevX0;\n        TurbulentFlowFunction mTurb;\n        ValveHysteresis mHyst;\n        FirstOrderFilter mFilterLP;\n        \/\/SecondOrderTransferFunction mFilterLP;\n\n        double *mpND_p1, *mpND_q1, *mpND_c1, *mpND_Zc1, *mpND_p2, *mpND_q2, *mpND_c2, *mpND_Zc2,\n               *mpND_p_open, *mpND_c_open, *mpND_p_close, *mpND_c_close;\n\n        Port *mpP1, *mpP2, *mpP_OPEN, *mpP_CLOSE;\n\n    public:\n        static Component *Creator()\n        {\n            return new HydraulicPressureControlledValve(\"PressureControlledValve\");\n        }\n\n        HydraulicPressureControlledValve(const std::string name) : ComponentQ(name)\n        {\n            pref = 2000000;\n            tao = 0.01;\n            Kcs = 0.00000001;\n            Kcf = 0.00000001;\n            qnom = 0.001;\n            ph = 500000;\n            pnom = 7e6f;\n\n            mpP1 = addPowerPort(\"P1\", \"NodeHydraulic\");\n            mpP2 = addPowerPort(\"P2\", \"NodeHydraulic\");\n            mpP_OPEN = addPowerPort(\"P_OPEN\", \"NodeHydraulic\");\n            mpP_CLOSE = addPowerPort(\"P_CLOSE\", \"NodeHydraulic\");\n\n            registerParameter(\"p_ref\", \"Reference Opening Pressure\", \"[Pa]\", pref);\n            registerParameter(\"tao\", \"Time Constant of Spool\", \"[s]\", tao);\n            registerParameter(\"k_c,s\", \"Steady State Characteristic due to Spring\", \"[(m^3\/s)\/Pa]\", Kcs);\n            registerParameter(\"k_c,f\", \"Steady State Characteristic due to Flow Forces\", \"[(m^3\/s)\/Pa]\", Kcf);\n            registerParameter(\"q_nom\", \"Flow with Fully Open Valve and pressure drop Pnom\", \"[m^3\/s]\", qnom);\n            registerParameter(\"p_h\", \"Hysteresis Width\", \"[Pa]\", ph);\n        }\n\n\n        void initialize()\n        {\n            mpND_p1 = getSafeNodeDataPtr(mpP1, NodeHydraulic::PRESSURE);\n            mpND_q1 = getSafeNodeDataPtr(mpP1, NodeHydraulic::FLOW);\n            mpND_c1 = getSafeNodeDataPtr(mpP1, NodeHydraulic::WAVEVARIABLE);\n            mpND_Zc1 = getSafeNodeDataPtr(mpP1, NodeHydraulic::CHARIMP);\n\n            mpND_p2 = getSafeNodeDataPtr(mpP2, NodeHydraulic::PRESSURE);\n            mpND_q2 = getSafeNodeDataPtr(mpP2, NodeHydraulic::FLOW);\n            mpND_c2 = getSafeNodeDataPtr(mpP2, NodeHydraulic::WAVEVARIABLE);\n            mpND_Zc2 = getSafeNodeDataPtr(mpP2, NodeHydraulic::CHARIMP);\n\n            mpND_p_open = getSafeNodeDataPtr(mpP_OPEN, NodeHydraulic::PRESSURE);\n            mpND_c_open = getSafeNodeDataPtr(mpP_OPEN, NodeHydraulic::WAVEVARIABLE);\n\n            mpND_p_close = getSafeNodeDataPtr(mpP_CLOSE, NodeHydraulic::PRESSURE);\n            mpND_c_close = getSafeNodeDataPtr(mpP_CLOSE, NodeHydraulic::WAVEVARIABLE);\n\n            x0 = 0.00001;\n            mPrevX0 = 0.0;\n            Cs = sqrt(pnom)\/Kcs;\n            Cf = 1\/(Kcf * sqrt(pnom));\n            x0max = qnom\/sqrt(pnom);\n\n            double wCutoff = 1 \/ tao;      \/\/Ska det vara Timestep\/Tao?\n            \/\/double wCutoff = 100;     DEBUG\n            double num [2] = {0.0, 1.0};\n            double den [2] = {1.0\/wCutoff, 1.0};\n            mFilterLP.initialize(mTimestep, num, den, 0.0, 0.0, 0.0, x0max);\n        }\n\n\n        void simulateOneTimestep()\n        {\n            \/\/Declare local variables\n            double p1, q1, c1, Zc1, p2, q2, c2, Zc2, p_open, c_open, p_close, c_close;\n            double b1, xs, xh, xsh;\n            bool cav = false;\n\n            \/\/Get variable values from nodes\n            p1 = (*mpND_p1);\n            q1 = (*mpND_q1);\n            c1 = (*mpND_c1);\n            Zc1 = (*mpND_Zc1);\n            p2 = (*mpND_p2);\n            q2 = (*mpND_q2);\n            c2 = (*mpND_c2);\n            Zc2 = (*mpND_Zc2);\n            p_open = (*mpND_p_open);\n            c_open = (*mpND_c_open);\n            p_close = (*mpND_p_close);\n            c_close = (*mpND_c_close);\n\n            \/* Equations *\/\n\n            b1 = Cs+Cf*(p1-p2);        \/\/Help Variable, equals sqrt(p1-p2)\/Kctot\n\n            \/\/ Spool position calculation\n            xs = (p_open - pref - p_close) \/ b1;\n\n            xh = ph\/b1;\n            xsh = mHyst.getValue(xs, xh, mPrevX0);\n            x0 = mFilterLP.update(xsh);\n\n            if(mTime<0.01)\n            {\n                std::stringstream ss;\n                ss << \"xsh = \" << xsh << \", x0 = \" << x0;\n                addDebugMessage(ss.str());\n            }\n\n            \/\/ Turbulent Flow Calculation\n            mTurb.setFlowCoefficient(x0);\n            q2 = mTurb.getFlow(c1, c2, Zc1, Zc2);\n            q1 = -q2;\n\n            \/\/ Pressure Calulation\n            p1 = c1 + Zc1 * q1;\n            p2 = c2 + Zc2 * q2;\n            p_open = c_open;\n            p_close = c_close;\n\n            p_open = std::max(0.0, p_open);\n            p_close = std::max(0.0, p_close);\n\n            \/\/ Check for cavitation\n            if (p1 < 0.0)\n            {\n                c1 = 0.0;\n                Zc1 = 0.0;\n                cav = true;\n            }\n            if (p2 < 0.0)\n            {\n                c2 = 0.0;\n                Zc2 = 0.0;\n                cav = true;\n            }\n            if (cav)        \/\/Cavitatiaon, redo calculations with new c and Zc\n            {\n                q2 = mTurb.getFlow(c1, c2, Zc1, Zc2);\n                q1 = -q2;\n                p1 = c1 + Zc1 * q1;\n                p2 = c2 + Zc2 * q2;\n                if (p1 < 0.0) { p1 = 0.0; }\n                if (p2 < 0.0) { p2 = 0.0; }\n            }\n\n            mPrevX0 = x0;\n\n            if((mTime > .08) && (mTime < .081))\n            {\n                std::stringstream ss;\n                ss << \"mTime: \" << mTime << \"       x0: \" << x0 << \"       p_open - p_close: \" << p_open - p_close << \"       b1: \" << b1 << \"       p_open - pref - p_close: \" << p_open - pref - p_close;\n                addInfoMessage(ss.str());\n            }\n\n            \/\/Write new values to nodes\n\n            (*mpND_p1) = p1;\n            (*mpND_q1) = q1;\n            (*mpND_p2) = p2;\n            (*mpND_q2) = q2;\n            (*mpND_p_open) = p_open;\n            (*mpND_p_close) = p_close;\n        }\n    };\n}\n\n#endif \/\/ HYDRAULICPRESSURECONTROLLEDVALVE_HPP_INCLUDED\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n * Copyright <2007>  <Michael Zanetti> <michael_zanetti@gmx.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 License as        *\n * published by the Free Software Foundation; either version 2 of        *\n * the License or (at your option) version 3 or any later version        *\n * accepted by the membership of KDE e.V. (or its successor approved     *\n * by the membership of KDE e.V.), which shall act as a proxy            *\n * defined in Section 14 of version 3 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, see <http:\/\/www.gnu.org\/licenses\/>. *\n *************************************************************************\/ \n\n#include \"otrplugin.h\"\n#include \"otrguiclient.h\"\n#include \"otrlchatinterface.h\"\n#include \"kopete_otr.h\"\n\n#include <qtimer.h>\n#include <qregexp.h>\n#include <qfile.h>\n#include <qcolor.h>\n\n#include <kdebug.h>\n#include <kaction.h>\n#include <kconfig.h>\n#include <kgenericfactory.h>\n#include <kselectaction.h>\n#include <kactioncollection.h>\n\n#include <kopetemetacontact.h>\n#include <kopetecontactlist.h>\n#include <kopetechatsessionmanager.h>\n#include <kopetesimplemessagehandler.h>\n#include <kopeteuiglobal.h>\n#include <kopetecontact.h>\n#include <kopetemessage.h>\n#include <kopeteaccount.h>\n#include <kopeteaccountmanager.h>\n#include <kopetemessageevent.h>\n#include <kopeteprotocol.h>\n#include <ui\/kopeteview.h>\n\n\n\/**\n  * @author Michael Zanetti\n  *\/\n\n\nK_PLUGIN_FACTORY ( OTRPluginFactory, registerPlugin<OTRPlugin>(); )\nK_EXPORT_PLUGIN ( OTRPluginFactory ( \"kopete_otr\" ) )\n\n\nOTRPlugin::OTRPlugin ( QObject *parent, const QVariantList &\/*args*\/ )\n\t: Kopete::Plugin ( OTRPluginFactory::componentData(), parent )\n{\n\n\tkDebug(14318) << \"OTR Plugin loading...\";\n\n\tif( !pluginStatic_ )\n\t\tpluginStatic_=this;\n\t\n\tm_inboundHandler = new OtrMessageHandlerFactory(this);\n\n\tconnect( Kopete::ChatSessionManager::self(), SIGNAL( aboutToSend( Kopete::Message & ) ),\n\t\tSLOT( slotOutgoingMessage( Kopete::Message & ) ) );\n\n\tconnect( Kopete::ChatSessionManager::self(), SIGNAL( chatSessionCreated( Kopete::ChatSession * ) ),\n\t\t\t this, SLOT( slotNewChatSessionWindow( Kopete::ChatSession * ) ) );\n\n\tconnect( this, SIGNAL( settingsChanged() ), this, SLOT( slotSettingsChanged() ) );\n\n\n\n\t\/\/initialize the otrlib and create the interface object\n\totrlChatInterface = OtrlChatInterface::self();\n\totrlChatInterface->setPlugin(this);\n\n\n\t\/\/ Checking file Permissions\n\tOtrlChatInterface::self()->checkFilePermissions( QString( KGlobal::dirs()->saveLocation( \"data\", \"kopete_otr\/\", true ) ) + \"privkeys\" );\n\tOtrlChatInterface::self()->checkFilePermissions( QString( KGlobal::dirs()->saveLocation( \"data\", \"kopete_otr\/\", true ) ) + \"fingerprints\" );\n\n\t\/\/setting the policy\n\tslotSettingsChanged();\n\n\t\/\/adding menu to contaclists menubar and contacts popup menu\n\totrPolicyMenu = new KSelectAction( KIcon(\"object-locked\"), i18nc( \"@item:inmenu\", \"&OTR Policy\" ), this );\n\tactionCollection()->addAction( \"otr_policy\", otrPolicyMenu );\n\n\tKAction *separatorAction = new KAction( otrPolicyMenu );\n\tseparatorAction->setSeparator( true );\n\n\totrPolicyMenu->addAction( i18nc( \"@item:inmenu Use the default encryption mode specified in settings dialog\", \"&Default\") );\n\totrPolicyMenu->addAction( separatorAction );\n\totrPolicyMenu->addAction( i18nc( \"@item:inmenu Always encrypt messages\", \"Al&ways\" ) );\n\totrPolicyMenu->addAction( i18nc( \"@item:inmenu Use the opportunistic encryption mode\", \"&Opportunistic\") );\n\totrPolicyMenu->addAction( i18nc( \"@item:inmenu Use the manual encryption mode\", \"&Manual\") );\n\totrPolicyMenu->addAction( i18nc( \"@item:inmenu Never encrypt messages\", \"Ne&ver\") );\n\n\totrPolicyMenu->setEnabled( false );\n\n\tconnect( otrPolicyMenu, SIGNAL( triggered( int ) ), this, SLOT( slotSetPolicy() ) );\n\tconnect( Kopete::ContactList::self(), SIGNAL( metaContactSelected( bool ) ), this, SLOT( slotSelectionChanged( bool ) ) );\n\n\tsetXMLFile( \"otrui.rc\" );\n\n\t\/\/Add GUI action to all already existing kmm \n\t\/\/ (if the plugin is launched when kopete already runing)\n\tQList<Kopete::ChatSession*> sessions =\n\t\t Kopete::ChatSessionManager::self()->sessions();\n\tQListIterator<Kopete::ChatSession*> it(sessions);\n\twhile (it.hasNext()){\n\t\tslotNewChatSessionWindow(it.next());\n\t}\n}\n\nOTRPlugin::~OTRPlugin()\n{\n\tdelete m_inboundHandler;\n\tpluginStatic_ = 0L;\n\tkDebug(14318) << \"Exiting OTR plugin\";\n}\n\n\nOTRPlugin* OTRPlugin::plugin()\n{\n\treturn pluginStatic_ ;\n}\n\nOTRPlugin* OTRPlugin::pluginStatic_ = 0L;\n\n\nvoid OTRPlugin::slotNewChatSessionWindow( Kopete::ChatSession *KMM )\n{\n\t\/\/Check if there is another user in the session.\n\t\/\/If not it could be a Jabber-MUC\n\t\/\/If there is more than one member it is a MUC\n\t\/\/ Also don't add the Button on an IRC window!\n\tif( KMM->members().count() == 1 && (KMM->protocol()) && ( KMM->protocol()->pluginId() != \"IRCProtocol\" ) ){\n\t\tnew OtrGUIClient( KMM );\n\t}\n}\n\n\nvoid OTRPlugin::slotOutgoingMessage( Kopete::Message& msg )\n{\n\tif( msg.direction() == Kopete::Message::Outbound ){\n\/\/        kDebug(14318) << \"Outgoing message: Plain: \" << msg.plainBody() << \"body:\" << msg.escapedBody();\n\t\tQString msgBody = msg.parsedBody();\n\t\tQString cacheBody = msg.parsedBody();\n\t\tQString accountId = msg.manager()->account()->accountId();\n\t\tKopete::Contact *contact = msg.to().first();\n\t\t\n\t\tint encryptionState = otrlChatInterface->encryptMessage( &msgBody, accountId, msg.manager()->account()->protocol()->displayName(), contact->contactId(), msg.manager() );\n\t\tif(encryptionState == -1){\n\t\t\tmsg.setPlainBody(i18n(\"An error occurred while encrypting the message.\"));\n\t\t} else if(encryptionState == 0){\n\/\/            kDebug(14318) << \"Encrypted successfully\";\n\t\t\tmsg.setPlainBody( msgBody );\n\t\t\tmsg.setType(Kopete::Message::TypeNormal);\n\t\t\tif( !msg.plainBody().isEmpty() ){\n\t\t\t\tmessageCache.insert( msgBody, cacheBody );\n\t\t\t} else {\n\t\t\t\tmessageCache.insert( \"!OTR:MsgDelByOTR\", cacheBody );\n\t\t\t}\n\t\t} else if(encryptionState == 1){\n\/\/            kDebug(14318) << \"Tagged plaintext!\";\n\t\t\tmsg.setHtmlBody(msgBody);\n\t\t\tmessageCache.insert( msgBody, cacheBody );\n\t\t}\n\t}\n}\n\nvoid  OTRPlugin::slotEnableOtr( Kopete::ChatSession *session, bool enable ){\n\n\n\tif( enable ){\n\t\tQString policy = session->members().first()->metaContact()->pluginData( OTRPlugin::plugin(), \"otr_policy\" );\n\t\tbool noerr;\n\t\tKopeteOtrKcfg::self()->readConfig();\n\t\tif( policy.toInt( &noerr, 10 ) == 4 || ( policy.toInt( &noerr, 10 ) == 0 && KopeteOtrKcfg::self()->rbNever() ) ){\n\t\t\tKopete::Message msg(  session->account()->myself(), session->members());\n\t\t\tmsg.setPlainBody( i18nc( \"@info:status\", \"Your policy settings do not allow encrypted sessions to this contact.\" ));\n\t\t\tmsg.setDirection( Kopete::Message::Internal);\n\t\t\tsession->appendMessage( msg );\n\t\t} else {\n\t\t\tQString body = otrlChatInterface->getDefaultQuery( session->account()->accountId() );\n\t\t\tKopete::Message msg1( session->account()->myself(), session->members().first());\n\t\t\tmsg1.setPlainBody( QString( body ) );\n\t\t\tmsg1.setDirection( Kopete::Message::Outbound );\n\t\t\tif( otrlChatInterface->privState( session ) > 0 ){\n\t\t\t\tbody = i18nc( \"@info:status\", \"Attempting to refresh the OTR session with <b>%1<\/b>...\", otrlChatInterface->formatContact( session->members().first()->contactId()) );\n\t\t\t} else {\n\t\t\t\tbody = i18nc( \"@info:status\", \"Attempting to start a private OTR session with <b>%1<\/b>...\", otrlChatInterface->formatContact( session->members().first()->contactId() ));\n\t\t\t}\n\t\t\tKopete::Message msg2( session->account()->myself(), session->members().first());\n\t\t\tmsg2.setHtmlBody( body );\n\t\t\tmsg2.setDirection( Kopete::Message::Internal );\n\n\t\t\tsession->sendMessage( msg1 );\n\t\t\tsession->appendMessage( msg2 );\n\t\t}\n\t} else {\n\t\totrlChatInterface->disconnectSession( session );\n\t}\n\n}\n\nvoid OTRPlugin::slotVerifyFingerprint( Kopete::ChatSession *session ){\n\totrlChatInterface->verifyFingerprint( session );\n}\n\nvoid OTRPlugin::slotSettingsChanged(){\n\n\tKopeteOtrKcfg::self()->readConfig();\n\tif( KopeteOtrKcfg::self()->rbAlways() ){\n\t\totrlChatInterface->setPolicy( OTRL_POLICY_ALWAYS );\n\t} else if( KopeteOtrKcfg::self()->rbOpportunistic() ){\n\t\totrlChatInterface->setPolicy( OTRL_POLICY_OPPORTUNISTIC );\n\t} else if( KopeteOtrKcfg::self()->rbManual() ){\n\t\totrlChatInterface->setPolicy( OTRL_POLICY_MANUAL );\n\t} else if( KopeteOtrKcfg::self()->rbNever() ){\n\t\totrlChatInterface->setPolicy( OTRL_POLICY_NEVER );\n\t} else {\n\t\totrlChatInterface->setPolicy( OTRL_POLICY_DEFAULT );\n\t}\n}\n\nvoid OTRPlugin::emitGoneSecure( Kopete::ChatSession *session, int status){\n\temit goneSecure( session, status );\n}\n\nQMap<QString, QString> OTRPlugin::getMessageCache(){\n\treturn messageCache;\n}\n\nvoid OtrMessageHandler::handleMessage( Kopete::MessageEvent *event ){\n\tif ( !plugin ){\n\t\tMessageHandler::handleMessage( event );\n\t\treturn;\n\t}\n\n\tKopete::Message msg = event->message();\n\/\/\tKopete::ChatSession *session = msg.manager();\n\tQMap<QString, QString> messageCache = plugin->getMessageCache();\n\n\tif( msg.direction() == Kopete::Message::Inbound ){\n\t\tif( msg.type() == Kopete::Message::TypeFileTransferRequest )\n\t\t{\n\t\t\t\/\/ file transfers aren't encrypted. Proceed with next plugin\n\t\t\tMessageHandler::handleMessage( event );\n\t\t\treturn;\n\t\t}\n\t\tQString body = msg.plainBody();\n\t\tQString accountId = msg.manager()->account()->accountId();\n\t\tQString contactId = msg.from()->contactId();\n\t\tint retValue = OtrlChatInterface::self()->decryptMessage( &body, accountId, msg.manager()->account()->protocol()->displayName(), contactId, msg.manager() );\n\t\tmsg.setHtmlBody( body );\n\t\tif( (retValue == 2) | OtrlChatInterface::self()->shouldDiscard( msg.plainBody() ) ){\n\t\t\t\/\/ internal OTR message\n\t\t\tevent->discard();\n\t\t\treturn;\n\t\t} else if(retValue == 1){\n\t\t\t\/\/ plaintext message. Proceed with next plugin\n\t\t\tMessageHandler::handleMessage( event );\n\t\t\treturn;\n\t\t}\n\t} else if( msg.direction() == Kopete::Message::Outbound ){\n\/\/        kDebug(14318) << \"searching cache for\" << msg.plainBody();\n\t\tif( messageCache.contains( msg.plainBody() ) ){\n\t\t\tmsg.setHtmlBody( messageCache[msg.plainBody()] );\n\t\t\tmessageCache.remove( messageCache[msg.plainBody()] );\n\t\t\tif(messageCache.count() > 5) messageCache.clear();\n\t\t}\n\t\t\/\/ Check if Message is an OTR message. Should it be discarded or shown?\n\t\tif( OtrlChatInterface::self()->shouldDiscard( msg.plainBody() ) ){\n\t\t\tevent->discard();\n\t\t\tkDebug(14318) << \"OTR: discarding message\";\n\t\t\treturn;\n\t\t}\n\t\t\/\/ If the message is sent while a Finished state libotr deletes the messagetext.\n\t\t\/\/ This prevents the empty message from being shown in our chatwindow\n\t\tif( msg.plainBody().isEmpty() ){\n\t\t\tevent->discard();\n\t\t\tif(messageCache.contains(\"!OTR:MsgDelByOTR\")){\n\t\t\t\tmsg.setPlainBody(messageCache[\"!OTR:MsgDelByOTR\"]);\n\t\t\t\tmsg.manager()->view()->setCurrentMessage(msg);\n\t\t\t\tmessageCache.remove(\"!OTR:MsgDelByOTR\");\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t}\n\t\n\tevent->setMessage( msg );\n\n\tMessageHandler::handleMessage( event );\n}\n\n\nvoid OTRPlugin::slotSelectionChanged( bool single){\n\totrPolicyMenu->setEnabled( single );\n\n\tif ( !single )\n\t\treturn;\n\n\tKopete::MetaContact *metaContact = Kopete::ContactList::self()->selectedMetaContacts().first();\n\n\tQString policy = metaContact->pluginData( this, \"otr_policy\" );\n\n\tbool noerr;\n\tif ( !policy.isEmpty() && policy != \"null\" )\n\t\totrPolicyMenu->setCurrentItem( policy.toInt( &noerr, 10 ) + 1); \/\/ +1 because of the Separator\n\telse\n\t\totrPolicyMenu->setCurrentItem( 0 );\n\n}\n\nvoid OTRPlugin::slotSetPolicy(){\n\tkDebug(14318) << \"Setting contact policy\";\n\tKopete::MetaContact *metaContact = Kopete::ContactList::self()->selectedMetaContacts().first();\n\tif( metaContact ){\n\t\tmetaContact->setPluginData( this, \"otr_policy\", QString::number( otrPolicyMenu->currentItem() - 1 ) ); \/\/ -1 because of the Separator\n\t}\n\tkDebug(14318) << \"Selected policy: \" << otrPolicyMenu->currentItem();\n}\n\nvoid OTRPlugin::slotSecuritySate(Kopete::ChatSession *session, int state)\n{\n\temitGoneSecure(session, state);\n}\n\n#include \"otrplugin.moc\"\n\n\/\/ vim: set noet ts=4 sts=4 sw=4:\n\n<commit_msg>dont use parsedBody before encrypting<commit_after>\/*************************************************************************\n * Copyright <2007>  <Michael Zanetti> <michael_zanetti@gmx.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 License as        *\n * published by the Free Software Foundation; either version 2 of        *\n * the License or (at your option) version 3 or any later version        *\n * accepted by the membership of KDE e.V. (or its successor approved     *\n * by the membership of KDE e.V.), which shall act as a proxy            *\n * defined in Section 14 of version 3 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, see <http:\/\/www.gnu.org\/licenses\/>. *\n *************************************************************************\/ \n\n#include \"otrplugin.h\"\n#include \"otrguiclient.h\"\n#include \"otrlchatinterface.h\"\n#include \"kopete_otr.h\"\n\n#include <qtimer.h>\n#include <qregexp.h>\n#include <qfile.h>\n#include <qcolor.h>\n\n#include <kdebug.h>\n#include <kaction.h>\n#include <kconfig.h>\n#include <kgenericfactory.h>\n#include <kselectaction.h>\n#include <kactioncollection.h>\n\n#include <kopetemetacontact.h>\n#include <kopetecontactlist.h>\n#include <kopetechatsessionmanager.h>\n#include <kopetesimplemessagehandler.h>\n#include <kopeteuiglobal.h>\n#include <kopetecontact.h>\n#include <kopetemessage.h>\n#include <kopeteaccount.h>\n#include <kopeteaccountmanager.h>\n#include <kopetemessageevent.h>\n#include <kopeteprotocol.h>\n#include <ui\/kopeteview.h>\n\n\n\/**\n  * @author Michael Zanetti\n  *\/\n\n\nK_PLUGIN_FACTORY ( OTRPluginFactory, registerPlugin<OTRPlugin>(); )\nK_EXPORT_PLUGIN ( OTRPluginFactory ( \"kopete_otr\" ) )\n\n\nOTRPlugin::OTRPlugin ( QObject *parent, const QVariantList &\/*args*\/ )\n\t: Kopete::Plugin ( OTRPluginFactory::componentData(), parent )\n{\n\n\tkDebug(14318) << \"OTR Plugin loading...\";\n\n\tif( !pluginStatic_ )\n\t\tpluginStatic_=this;\n\t\n\tm_inboundHandler = new OtrMessageHandlerFactory(this);\n\n\tconnect( Kopete::ChatSessionManager::self(), SIGNAL( aboutToSend( Kopete::Message & ) ),\n\t\tSLOT( slotOutgoingMessage( Kopete::Message & ) ) );\n\n\tconnect( Kopete::ChatSessionManager::self(), SIGNAL( chatSessionCreated( Kopete::ChatSession * ) ),\n\t\t\t this, SLOT( slotNewChatSessionWindow( Kopete::ChatSession * ) ) );\n\n\tconnect( this, SIGNAL( settingsChanged() ), this, SLOT( slotSettingsChanged() ) );\n\n\n\n\t\/\/initialize the otrlib and create the interface object\n\totrlChatInterface = OtrlChatInterface::self();\n\totrlChatInterface->setPlugin(this);\n\n\n\t\/\/ Checking file Permissions\n\tOtrlChatInterface::self()->checkFilePermissions( QString( KGlobal::dirs()->saveLocation( \"data\", \"kopete_otr\/\", true ) ) + \"privkeys\" );\n\tOtrlChatInterface::self()->checkFilePermissions( QString( KGlobal::dirs()->saveLocation( \"data\", \"kopete_otr\/\", true ) ) + \"fingerprints\" );\n\n\t\/\/setting the policy\n\tslotSettingsChanged();\n\n\t\/\/adding menu to contaclists menubar and contacts popup menu\n\totrPolicyMenu = new KSelectAction( KIcon(\"object-locked\"), i18nc( \"@item:inmenu\", \"&OTR Policy\" ), this );\n\tactionCollection()->addAction( \"otr_policy\", otrPolicyMenu );\n\n\tKAction *separatorAction = new KAction( otrPolicyMenu );\n\tseparatorAction->setSeparator( true );\n\n\totrPolicyMenu->addAction( i18nc( \"@item:inmenu Use the default encryption mode specified in settings dialog\", \"&Default\") );\n\totrPolicyMenu->addAction( separatorAction );\n\totrPolicyMenu->addAction( i18nc( \"@item:inmenu Always encrypt messages\", \"Al&ways\" ) );\n\totrPolicyMenu->addAction( i18nc( \"@item:inmenu Use the opportunistic encryption mode\", \"&Opportunistic\") );\n\totrPolicyMenu->addAction( i18nc( \"@item:inmenu Use the manual encryption mode\", \"&Manual\") );\n\totrPolicyMenu->addAction( i18nc( \"@item:inmenu Never encrypt messages\", \"Ne&ver\") );\n\n\totrPolicyMenu->setEnabled( false );\n\n\tconnect( otrPolicyMenu, SIGNAL( triggered( int ) ), this, SLOT( slotSetPolicy() ) );\n\tconnect( Kopete::ContactList::self(), SIGNAL( metaContactSelected( bool ) ), this, SLOT( slotSelectionChanged( bool ) ) );\n\n\tsetXMLFile( \"otrui.rc\" );\n\n\t\/\/Add GUI action to all already existing kmm \n\t\/\/ (if the plugin is launched when kopete already runing)\n\tQList<Kopete::ChatSession*> sessions =\n\t\t Kopete::ChatSessionManager::self()->sessions();\n\tQListIterator<Kopete::ChatSession*> it(sessions);\n\twhile (it.hasNext()){\n\t\tslotNewChatSessionWindow(it.next());\n\t}\n}\n\nOTRPlugin::~OTRPlugin()\n{\n\tdelete m_inboundHandler;\n\tpluginStatic_ = 0L;\n\tkDebug(14318) << \"Exiting OTR plugin\";\n}\n\n\nOTRPlugin* OTRPlugin::plugin()\n{\n\treturn pluginStatic_ ;\n}\n\nOTRPlugin* OTRPlugin::pluginStatic_ = 0L;\n\n\nvoid OTRPlugin::slotNewChatSessionWindow( Kopete::ChatSession *KMM )\n{\n\t\/\/Check if there is another user in the session.\n\t\/\/If not it could be a Jabber-MUC\n\t\/\/If there is more than one member it is a MUC\n\t\/\/ Also don't add the Button on an IRC window!\n\tif( KMM->members().count() == 1 && (KMM->protocol()) && ( KMM->protocol()->pluginId() != \"IRCProtocol\" ) ){\n\t\tnew OtrGUIClient( KMM );\n\t}\n}\n\n\nvoid OTRPlugin::slotOutgoingMessage( Kopete::Message& msg )\n{\n\tif( msg.direction() == Kopete::Message::Outbound ){\n\/\/        kDebug(14318) << \"Outgoing message: Plain: \" << msg.plainBody() << \"escapedBody:\" << msg.escapedBody() << \"parsedBody:\" << msg.parsedBody();\n\t\tQString msgBody = msg.escapedBody();\n\t\tQString cacheBody = msg.escapedBody();\n\t\tQString accountId = msg.manager()->account()->accountId();\n\t\tKopete::Contact *contact = msg.to().first();\n\t\t\n\t\tint encryptionState = otrlChatInterface->encryptMessage( &msgBody, accountId, msg.manager()->account()->protocol()->displayName(), contact->contactId(), msg.manager() );\n\t\tif(encryptionState == -1){\n\t\t\tmsg.setPlainBody(i18n(\"An error occurred while encrypting the message.\"));\n\t\t} else if(encryptionState == 0){\n\/\/            kDebug(14318) << \"Encrypted successfully\";\n\t\t\tmsg.setPlainBody( msgBody );\n\t\t\tmsg.setType(Kopete::Message::TypeNormal);\n\t\t\tif( !msg.plainBody().isEmpty() ){\n\t\t\t\tmessageCache.insert( msgBody, cacheBody );\n\t\t\t} else {\n\t\t\t\tmessageCache.insert( \"!OTR:MsgDelByOTR\", cacheBody );\n\t\t\t}\n\t\t} else if(encryptionState == 1){\n\/\/            kDebug(14318) << \"Tagged plaintext!\";\n\t\t\tmsg.setHtmlBody(msgBody);\n\t\t\tmessageCache.insert( msgBody, cacheBody );\n\t\t}\n\t}\n}\n\nvoid  OTRPlugin::slotEnableOtr( Kopete::ChatSession *session, bool enable ){\n\n\n\tif( enable ){\n\t\tQString policy = session->members().first()->metaContact()->pluginData( OTRPlugin::plugin(), \"otr_policy\" );\n\t\tbool noerr;\n\t\tKopeteOtrKcfg::self()->readConfig();\n\t\tif( policy.toInt( &noerr, 10 ) == 4 || ( policy.toInt( &noerr, 10 ) == 0 && KopeteOtrKcfg::self()->rbNever() ) ){\n\t\t\tKopete::Message msg(  session->account()->myself(), session->members());\n\t\t\tmsg.setPlainBody( i18nc( \"@info:status\", \"Your policy settings do not allow encrypted sessions to this contact.\" ));\n\t\t\tmsg.setDirection( Kopete::Message::Internal);\n\t\t\tsession->appendMessage( msg );\n\t\t} else {\n\t\t\tQString body = otrlChatInterface->getDefaultQuery( session->account()->accountId() );\n\t\t\tKopete::Message msg1( session->account()->myself(), session->members().first());\n\t\t\tmsg1.setPlainBody( QString( body ) );\n\t\t\tmsg1.setDirection( Kopete::Message::Outbound );\n\t\t\tif( otrlChatInterface->privState( session ) > 0 ){\n\t\t\t\tbody = i18nc( \"@info:status\", \"Attempting to refresh the OTR session with <b>%1<\/b>...\", otrlChatInterface->formatContact( session->members().first()->contactId()) );\n\t\t\t} else {\n\t\t\t\tbody = i18nc( \"@info:status\", \"Attempting to start a private OTR session with <b>%1<\/b>...\", otrlChatInterface->formatContact( session->members().first()->contactId() ));\n\t\t\t}\n\t\t\tKopete::Message msg2( session->account()->myself(), session->members().first());\n\t\t\tmsg2.setHtmlBody( body );\n\t\t\tmsg2.setDirection( Kopete::Message::Internal );\n\n\t\t\tsession->sendMessage( msg1 );\n\t\t\tsession->appendMessage( msg2 );\n\t\t}\n\t} else {\n\t\totrlChatInterface->disconnectSession( session );\n\t}\n\n}\n\nvoid OTRPlugin::slotVerifyFingerprint( Kopete::ChatSession *session ){\n\totrlChatInterface->verifyFingerprint( session );\n}\n\nvoid OTRPlugin::slotSettingsChanged(){\n\n\tKopeteOtrKcfg::self()->readConfig();\n\tif( KopeteOtrKcfg::self()->rbAlways() ){\n\t\totrlChatInterface->setPolicy( OTRL_POLICY_ALWAYS );\n\t} else if( KopeteOtrKcfg::self()->rbOpportunistic() ){\n\t\totrlChatInterface->setPolicy( OTRL_POLICY_OPPORTUNISTIC );\n\t} else if( KopeteOtrKcfg::self()->rbManual() ){\n\t\totrlChatInterface->setPolicy( OTRL_POLICY_MANUAL );\n\t} else if( KopeteOtrKcfg::self()->rbNever() ){\n\t\totrlChatInterface->setPolicy( OTRL_POLICY_NEVER );\n\t} else {\n\t\totrlChatInterface->setPolicy( OTRL_POLICY_DEFAULT );\n\t}\n}\n\nvoid OTRPlugin::emitGoneSecure( Kopete::ChatSession *session, int status){\n\temit goneSecure( session, status );\n}\n\nQMap<QString, QString> OTRPlugin::getMessageCache(){\n\treturn messageCache;\n}\n\nvoid OtrMessageHandler::handleMessage( Kopete::MessageEvent *event ){\n\tif ( !plugin ){\n\t\tMessageHandler::handleMessage( event );\n\t\treturn;\n\t}\n\n\tKopete::Message msg = event->message();\n\/\/\tKopete::ChatSession *session = msg.manager();\n\tQMap<QString, QString> messageCache = plugin->getMessageCache();\n\n\tif( msg.direction() == Kopete::Message::Inbound ){\n\t\tif( msg.type() == Kopete::Message::TypeFileTransferRequest )\n\t\t{\n\t\t\t\/\/ file transfers aren't encrypted. Proceed with next plugin\n\t\t\tMessageHandler::handleMessage( event );\n\t\t\treturn;\n\t\t}\n\t\tQString body = msg.plainBody();\n\t\tQString accountId = msg.manager()->account()->accountId();\n\t\tQString contactId = msg.from()->contactId();\n\t\tint retValue = OtrlChatInterface::self()->decryptMessage( &body, accountId, msg.manager()->account()->protocol()->displayName(), contactId, msg.manager() );\n\t\tmsg.setHtmlBody( body );\n\t\tif( (retValue == 2) | OtrlChatInterface::self()->shouldDiscard( msg.plainBody() ) ){\n\t\t\t\/\/ internal OTR message\n\t\t\tevent->discard();\n\t\t\treturn;\n\t\t} else if(retValue == 1){\n\t\t\t\/\/ plaintext message. Proceed with next plugin\n\t\t\tMessageHandler::handleMessage( event );\n\t\t\treturn;\n\t\t}\n\t} else if( msg.direction() == Kopete::Message::Outbound ){\n\/\/        kDebug(14318) << \"searching cache for\" << msg.plainBody();\n\t\tif( messageCache.contains( msg.plainBody() ) ){\n\t\t\tmsg.setHtmlBody( messageCache[msg.plainBody()] );\n\t\t\tmessageCache.remove( messageCache[msg.plainBody()] );\n\t\t\tif(messageCache.count() > 5) messageCache.clear();\n\t\t}\n\t\t\/\/ Check if Message is an OTR message. Should it be discarded or shown?\n\t\tif( OtrlChatInterface::self()->shouldDiscard( msg.plainBody() ) ){\n\t\t\tevent->discard();\n\t\t\tkDebug(14318) << \"OTR: discarding message\";\n\t\t\treturn;\n\t\t}\n\t\t\/\/ If the message is sent while a Finished state libotr deletes the messagetext.\n\t\t\/\/ This prevents the empty message from being shown in our chatwindow\n\t\tif( msg.plainBody().isEmpty() ){\n\t\t\tevent->discard();\n\t\t\tif(messageCache.contains(\"!OTR:MsgDelByOTR\")){\n\t\t\t\tmsg.setPlainBody(messageCache[\"!OTR:MsgDelByOTR\"]);\n\t\t\t\tmsg.manager()->view()->setCurrentMessage(msg);\n\t\t\t\tmessageCache.remove(\"!OTR:MsgDelByOTR\");\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t}\n\t\n\tevent->setMessage( msg );\n\n\tMessageHandler::handleMessage( event );\n}\n\n\nvoid OTRPlugin::slotSelectionChanged( bool single){\n\totrPolicyMenu->setEnabled( single );\n\n\tif ( !single )\n\t\treturn;\n\n\tKopete::MetaContact *metaContact = Kopete::ContactList::self()->selectedMetaContacts().first();\n\n\tQString policy = metaContact->pluginData( this, \"otr_policy\" );\n\n\tbool noerr;\n\tif ( !policy.isEmpty() && policy != \"null\" )\n\t\totrPolicyMenu->setCurrentItem( policy.toInt( &noerr, 10 ) + 1); \/\/ +1 because of the Separator\n\telse\n\t\totrPolicyMenu->setCurrentItem( 0 );\n\n}\n\nvoid OTRPlugin::slotSetPolicy(){\n\tkDebug(14318) << \"Setting contact policy\";\n\tKopete::MetaContact *metaContact = Kopete::ContactList::self()->selectedMetaContacts().first();\n\tif( metaContact ){\n\t\tmetaContact->setPluginData( this, \"otr_policy\", QString::number( otrPolicyMenu->currentItem() - 1 ) ); \/\/ -1 because of the Separator\n\t}\n\tkDebug(14318) << \"Selected policy: \" << otrPolicyMenu->currentItem();\n}\n\nvoid OTRPlugin::slotSecuritySate(Kopete::ChatSession *session, int state)\n{\n\temitGoneSecure(session, state);\n}\n\n#include \"otrplugin.moc\"\n\n\/\/ vim: set noet ts=4 sts=4 sw=4:\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2007-2009 Digital Bazaar, Inc. All rights reserved.\n *\/\n#include \"db\/sql\/sqlite3\/Sqlite3Statement.h\"\n\n#include \"db\/sql\/sqlite3\/Sqlite3Connection.h\"\n#include \"db\/sql\/sqlite3\/Sqlite3Row.h\"\n\nusing namespace std;\nusing namespace db::sql;\nusing namespace db::sql::sqlite3;\nusing namespace db::rt;\n\nSqlite3Statement::Sqlite3Statement(Sqlite3Connection *c, const char* sql) :\n   Statement(c, sql)\n{\n   \/\/ FIXME: switch to sqlite3_prepare_v2 when appropriate\n   const char* tail;\n   mState = sqlite3_prepare(c->getHandle(), sql, -1, &mHandle, &tail);\n   if(mState != SQLITE_OK)\n   {\n      \/\/ exception\n      ExceptionRef e = new Sqlite3Exception((Sqlite3Connection*)mConnection);\n      e->getDetails()[\"sql\"] = sql;\n      Exception::setLast(e, false);\n   }\n   \n   \/\/ no current row yet\n   mRow = NULL;\n}\n\nSqlite3Statement::~Sqlite3Statement()\n{\n   \/\/ clean up row, if any\n   if(mRow != NULL)\n   {\n      delete mRow;\n   }\n   \n   \/\/ clean up handle\n   sqlite3_finalize(mHandle);\n}\n\ninline sqlite3_stmt* Sqlite3Statement::getHandle()\n{\n   return mHandle;\n}\n\nbool Sqlite3Statement::setInt32(unsigned int param, int32_t value)\n{\n   bool rval = true;\n   \n   mState = sqlite3_bind_int(mHandle, param, value);\n   if(mState != SQLITE_OK)\n   {\n      \/\/ exception, could not bind parameter\n      ExceptionRef e = new Sqlite3Exception((Sqlite3Connection*)mConnection);\n      Exception::setLast(e, false);\n      rval = false;\n   }\n   \n   return rval;\n}\n\nbool Sqlite3Statement::setUInt32(unsigned int param, uint32_t value)\n{\n   bool rval = true;\n   \n   mState = sqlite3_bind_int(mHandle, param, value);\n   if(mState != SQLITE_OK)\n   {\n      \/\/ exception, could not bind parameter\n      ExceptionRef e = new Sqlite3Exception((Sqlite3Connection*)mConnection);\n      Exception::setLast(e, false);\n      rval = false;\n   }\n   \n   return rval;\n}\n\nbool Sqlite3Statement::setInt64(unsigned int param, int64_t value)\n{\n   bool rval = true;\n   \n   mState = sqlite3_bind_int64(mHandle, param, value);\n   if(mState != SQLITE_OK)\n   {\n      \/\/ exception, could not bind parameter\n      ExceptionRef e = new Sqlite3Exception((Sqlite3Connection*)mConnection);\n      Exception::setLast(e, false);\n      rval = false;\n   }\n   \n   return rval;\n}\n\nbool Sqlite3Statement::setUInt64(unsigned int param, uint64_t value)\n{\n   bool rval = true;\n   \n   mState = sqlite3_bind_int64(mHandle, param, value);\n   if(mState != SQLITE_OK)\n   {\n      \/\/ exception, could not bind parameter\n      ExceptionRef e = new Sqlite3Exception((Sqlite3Connection*)mConnection);\n      Exception::setLast(e, false);\n      rval = false;\n   }\n   \n   return rval;\n}\n\nbool Sqlite3Statement::setText(unsigned int param, const char* value)\n{\n   bool rval = true;\n   \n   \/\/ use SQLITE_STATIC to ensure the memory is not cleaned up by sqlite\n   mState = sqlite3_bind_text(mHandle, param, value, -1, SQLITE_STATIC);\n   if(mState != SQLITE_OK)\n   {\n      \/\/ exception, could not bind parameter\n      ExceptionRef e = new Sqlite3Exception((Sqlite3Connection*)mConnection);\n      Exception::setLast(e, false);\n      rval = false;\n   }\n   \n   return rval;\n}\n\nbool Sqlite3Statement::setInt32(const char* name, int32_t value)\n{\n   bool rval = false;\n   \n   int index = getParameterIndex(name);\n   if(index > 0)\n   {\n      rval = setInt32(index, value);\n   }\n   \n   return rval;\n}\n\nbool Sqlite3Statement::setUInt32(const char* name, uint32_t value)\n{\n   bool rval = false;\n   \n   int index = getParameterIndex(name);\n   if(index > 0)\n   {\n      rval = setUInt32(index, value);\n   }\n   \n   return rval;\n}\n\nbool Sqlite3Statement::setInt64(const char* name, int64_t value)\n{\n   bool rval = false;\n   \n   int index = getParameterIndex(name);\n   if(index > 0)\n   {\n      rval = setInt64(index, value);\n   }\n   \n   return rval;\n}\n\nbool Sqlite3Statement::setUInt64(const char* name, uint64_t value)\n{\n   bool rval = false;\n   \n   int index = getParameterIndex(name);\n   if(index > 0)\n   {\n      rval = setUInt64(index, value);\n   }\n   \n   return rval;\n}\n\nbool Sqlite3Statement::setText(const char* name, const char* value)\n{\n   bool rval = false;\n   \n   int index = getParameterIndex(name);\n   if(index > 0)\n   {\n      rval = setText(index, value);\n   }\n   \n   return rval;\n}\n\nbool Sqlite3Statement::execute()\n{\n   bool rval = true;\n   \n   switch(mState)\n   {\n      case SQLITE_OK:\n         \/\/ step to execute statement\n         mState = sqlite3_step(mHandle);\n         switch(mState)\n         {\n            case SQLITE_DONE:\n            case SQLITE_ROW:\n               \/\/ valid return state (done or got back a row)\n               break;\n            default:\n            {\n               \/\/ error stepping statement (version 1 of api requires reset)\n               ExceptionRef e =\n                  new Sqlite3Exception((Sqlite3Connection*)mConnection);\n               Exception::setLast(e, false);\n               rval = false;\n               break;\n            }\n         }\n         break;\n      case SQLITE_DONE:\n      case SQLITE_ROW:\n      {\n         \/\/ statement in bad state\n         ExceptionRef e = new Exception(\n            \"Statement state is invalid. Did you call reset() to reuse \"\n            \"the statement? (Connections should do this automatically).\",\n            \"db.sql.sqlite3.BadState\");\n         Exception::setLast(e, false);\n         rval = false;\n         break;\n      }\n      default:\n      {\n         \/\/ driver error\n         ExceptionRef e =\n            new Sqlite3Exception((Sqlite3Connection*)mConnection);\n         Exception::setLast(e, false);\n         rval = false;\n         break;\n      }\n   }\n   \n   return rval;\n}\n\nRow* Sqlite3Statement::fetch()\n{\n   Row* rval = NULL;\n   \n   if(mRow != NULL)\n   {\n      \/\/ get next row\n      mState = sqlite3_step(mHandle);\n      switch(mState)\n      {\n         case SQLITE_ROW:\n            \/\/ return next row\n            rval = mRow;\n            break;\n         case SQLITE_DONE:\n            \/\/ no more rows, clean up row object\n            delete mRow;\n            mRow = NULL;\n            break;\n         default:\n         {\n            \/\/ error stepping statement (version 1 of api requires reset)\n            ExceptionRef e =\n               new Sqlite3Exception((Sqlite3Connection*)mConnection);\n            Exception::setLast(e, false);\n            reset();\n            break;\n         }\n      }\n   }\n   else if(mState == SQLITE_ROW)\n   {\n      \/\/ create and return first row\n      rval = mRow = new Sqlite3Row(this);\n   }\n   \n   return rval;\n}\n\nbool Sqlite3Statement::reset()\n{\n   bool rval = true;\n   \n   \/\/ clean up existing row object\n   if(mRow != NULL)\n   {\n      delete mRow;\n      mRow = NULL;\n   }\n   \n   \/\/ reset statement\n   mState = sqlite3_reset(mHandle);\n   if(mState != SQLITE_OK)\n   {\n      \/\/ driver error\n      ExceptionRef e = new Sqlite3Exception((Sqlite3Connection*)mConnection);\n      Exception::setLast(e, false);\n      rval = false;\n   }\n   \n   return rval;\n}\n\nbool Sqlite3Statement::getRowsChanged(uint64_t& rows)\n{\n   \/\/ FIXME: handle exceptions\n   rows = sqlite3_changes(((Sqlite3Connection*)mConnection)->getHandle());\n   return true;\n}\n\nuint64_t Sqlite3Statement::getLastInsertRowId()\n{\n   return sqlite3_last_insert_rowid(\n      ((Sqlite3Connection*)mConnection)->getHandle());\n}\n\nint Sqlite3Statement::getParameterIndex(const char* name)\n{\n   int index = sqlite3_bind_parameter_index(mHandle, name);\n   if(index == 0)\n   {\n      \/\/ exception, no parameter with given name found (index=0 is invalid)\n      ExceptionRef e = new SqlException(\"Invalid parameter name.\");\n      e->getDetails()[\"name\"] = name;\n      Exception::setLast(e, false);\n   }\n   \n   return index;\n}\n<commit_msg>Added missing code under comment and made comment more explicit.<commit_after>\/*\n * Copyright (c) 2007-2009 Digital Bazaar, Inc. All rights reserved.\n *\/\n#include \"db\/sql\/sqlite3\/Sqlite3Statement.h\"\n\n#include \"db\/sql\/sqlite3\/Sqlite3Connection.h\"\n#include \"db\/sql\/sqlite3\/Sqlite3Row.h\"\n\nusing namespace std;\nusing namespace db::sql;\nusing namespace db::sql::sqlite3;\nusing namespace db::rt;\n\nSqlite3Statement::Sqlite3Statement(Sqlite3Connection *c, const char* sql) :\n   Statement(c, sql)\n{\n   \/\/ FIXME: switch to sqlite3_prepare_v2 when appropriate\n   const char* tail;\n   mState = sqlite3_prepare(c->getHandle(), sql, -1, &mHandle, &tail);\n   if(mState != SQLITE_OK)\n   {\n      \/\/ exception\n      ExceptionRef e = new Sqlite3Exception((Sqlite3Connection*)mConnection);\n      e->getDetails()[\"sql\"] = sql;\n      Exception::setLast(e, false);\n   }\n   \n   \/\/ no current row yet\n   mRow = NULL;\n}\n\nSqlite3Statement::~Sqlite3Statement()\n{\n   \/\/ clean up row, if any\n   if(mRow != NULL)\n   {\n      delete mRow;\n   }\n   \n   \/\/ clean up handle\n   sqlite3_finalize(mHandle);\n}\n\ninline sqlite3_stmt* Sqlite3Statement::getHandle()\n{\n   return mHandle;\n}\n\nbool Sqlite3Statement::setInt32(unsigned int param, int32_t value)\n{\n   bool rval = true;\n   \n   mState = sqlite3_bind_int(mHandle, param, value);\n   if(mState != SQLITE_OK)\n   {\n      \/\/ exception, could not bind parameter\n      ExceptionRef e = new Sqlite3Exception((Sqlite3Connection*)mConnection);\n      Exception::setLast(e, false);\n      rval = false;\n   }\n   \n   return rval;\n}\n\nbool Sqlite3Statement::setUInt32(unsigned int param, uint32_t value)\n{\n   bool rval = true;\n   \n   mState = sqlite3_bind_int(mHandle, param, value);\n   if(mState != SQLITE_OK)\n   {\n      \/\/ exception, could not bind parameter\n      ExceptionRef e = new Sqlite3Exception((Sqlite3Connection*)mConnection);\n      Exception::setLast(e, false);\n      rval = false;\n   }\n   \n   return rval;\n}\n\nbool Sqlite3Statement::setInt64(unsigned int param, int64_t value)\n{\n   bool rval = true;\n   \n   mState = sqlite3_bind_int64(mHandle, param, value);\n   if(mState != SQLITE_OK)\n   {\n      \/\/ exception, could not bind parameter\n      ExceptionRef e = new Sqlite3Exception((Sqlite3Connection*)mConnection);\n      Exception::setLast(e, false);\n      rval = false;\n   }\n   \n   return rval;\n}\n\nbool Sqlite3Statement::setUInt64(unsigned int param, uint64_t value)\n{\n   bool rval = true;\n   \n   mState = sqlite3_bind_int64(mHandle, param, value);\n   if(mState != SQLITE_OK)\n   {\n      \/\/ exception, could not bind parameter\n      ExceptionRef e = new Sqlite3Exception((Sqlite3Connection*)mConnection);\n      Exception::setLast(e, false);\n      rval = false;\n   }\n   \n   return rval;\n}\n\nbool Sqlite3Statement::setText(unsigned int param, const char* value)\n{\n   bool rval = true;\n   \n   \/\/ use SQLITE_STATIC to ensure the memory is not cleaned up by sqlite\n   mState = sqlite3_bind_text(mHandle, param, value, -1, SQLITE_STATIC);\n   if(mState != SQLITE_OK)\n   {\n      \/\/ exception, could not bind parameter\n      ExceptionRef e = new Sqlite3Exception((Sqlite3Connection*)mConnection);\n      Exception::setLast(e, false);\n      rval = false;\n   }\n   \n   return rval;\n}\n\nbool Sqlite3Statement::setInt32(const char* name, int32_t value)\n{\n   bool rval = false;\n   \n   int index = getParameterIndex(name);\n   if(index > 0)\n   {\n      rval = setInt32(index, value);\n   }\n   \n   return rval;\n}\n\nbool Sqlite3Statement::setUInt32(const char* name, uint32_t value)\n{\n   bool rval = false;\n   \n   int index = getParameterIndex(name);\n   if(index > 0)\n   {\n      rval = setUInt32(index, value);\n   }\n   \n   return rval;\n}\n\nbool Sqlite3Statement::setInt64(const char* name, int64_t value)\n{\n   bool rval = false;\n   \n   int index = getParameterIndex(name);\n   if(index > 0)\n   {\n      rval = setInt64(index, value);\n   }\n   \n   return rval;\n}\n\nbool Sqlite3Statement::setUInt64(const char* name, uint64_t value)\n{\n   bool rval = false;\n   \n   int index = getParameterIndex(name);\n   if(index > 0)\n   {\n      rval = setUInt64(index, value);\n   }\n   \n   return rval;\n}\n\nbool Sqlite3Statement::setText(const char* name, const char* value)\n{\n   bool rval = false;\n   \n   int index = getParameterIndex(name);\n   if(index > 0)\n   {\n      rval = setText(index, value);\n   }\n   \n   return rval;\n}\n\nbool Sqlite3Statement::execute()\n{\n   bool rval = true;\n   \n   switch(mState)\n   {\n      case SQLITE_OK:\n         \/\/ step to execute statement\n         mState = sqlite3_step(mHandle);\n         switch(mState)\n         {\n            case SQLITE_DONE:\n            case SQLITE_ROW:\n               \/\/ valid return state (done or got back a row)\n               break;\n            default:\n            {\n               \/\/ error stepping statement (version 1 of api requires reset\n               \/\/ to return actual cause of the problem)\n               mState = sqlite3_reset(mHandle);\n               ExceptionRef e =\n                  new Sqlite3Exception((Sqlite3Connection*)mConnection);\n               Exception::setLast(e, false);\n               rval = false;\n               break;\n            }\n         }\n         break;\n      case SQLITE_DONE:\n      case SQLITE_ROW:\n      {\n         \/\/ statement in bad state\n         ExceptionRef e = new Exception(\n            \"Statement state is invalid. Did you call reset() to reuse \"\n            \"the statement? (Connections should do this automatically).\",\n            \"db.sql.sqlite3.BadState\");\n         Exception::setLast(e, false);\n         rval = false;\n         break;\n      }\n      default:\n      {\n         \/\/ driver error\n         ExceptionRef e =\n            new Sqlite3Exception((Sqlite3Connection*)mConnection);\n         Exception::setLast(e, false);\n         rval = false;\n         break;\n      }\n   }\n   \n   return rval;\n}\n\nRow* Sqlite3Statement::fetch()\n{\n   Row* rval = NULL;\n   \n   if(mRow != NULL)\n   {\n      \/\/ get next row\n      mState = sqlite3_step(mHandle);\n      switch(mState)\n      {\n         case SQLITE_ROW:\n            \/\/ return next row\n            rval = mRow;\n            break;\n         case SQLITE_DONE:\n            \/\/ no more rows, clean up row object\n            delete mRow;\n            mRow = NULL;\n            break;\n         default:\n         {\n            \/\/ error stepping statement (version 1 of api requires reset)\n            ExceptionRef e =\n               new Sqlite3Exception((Sqlite3Connection*)mConnection);\n            Exception::setLast(e, false);\n            reset();\n            break;\n         }\n      }\n   }\n   else if(mState == SQLITE_ROW)\n   {\n      \/\/ create and return first row\n      rval = mRow = new Sqlite3Row(this);\n   }\n   \n   return rval;\n}\n\nbool Sqlite3Statement::reset()\n{\n   bool rval = true;\n   \n   \/\/ clean up existing row object\n   if(mRow != NULL)\n   {\n      delete mRow;\n      mRow = NULL;\n   }\n   \n   \/\/ reset statement\n   mState = sqlite3_reset(mHandle);\n   if(mState != SQLITE_OK)\n   {\n      \/\/ driver error\n      ExceptionRef e = new Sqlite3Exception((Sqlite3Connection*)mConnection);\n      Exception::setLast(e, false);\n      rval = false;\n   }\n   \n   return rval;\n}\n\nbool Sqlite3Statement::getRowsChanged(uint64_t& rows)\n{\n   \/\/ FIXME: handle exceptions\n   rows = sqlite3_changes(((Sqlite3Connection*)mConnection)->getHandle());\n   return true;\n}\n\nuint64_t Sqlite3Statement::getLastInsertRowId()\n{\n   return sqlite3_last_insert_rowid(\n      ((Sqlite3Connection*)mConnection)->getHandle());\n}\n\nint Sqlite3Statement::getParameterIndex(const char* name)\n{\n   int index = sqlite3_bind_parameter_index(mHandle, name);\n   if(index == 0)\n   {\n      \/\/ exception, no parameter with given name found (index=0 is invalid)\n      ExceptionRef e = new SqlException(\"Invalid parameter name.\");\n      e->getDetails()[\"name\"] = name;\n      Exception::setLast(e, false);\n   }\n   \n   return index;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  ThreadHangDetector.cpp\n\/\/  MusicPlayer\n\/\/\n\/\/  Created by Albert Zeyer on 19.02.14.\n\/\/  Copyright (c) 2014 Albert Zeyer. All rights reserved.\n\/\/\n\n#include <Python.h>\n#include <map>\n#include <pthread.h>\n#include <stdio.h>\n#include <assert.h>\n\n#include \"ThreadHangDetector.hpp\"\n#include \"sysutils.hpp\"\n#include \"pthread_mutex.hpp\"\n\n\n\nstruct ThreadInfo {\n\tfloat timeoutSecs;\n\tAbsMsTime lastLifeSignal;\n};\n\nvoid* backgroundThread_proc(void*);\n\nstruct ThreadHangDetector {\n\tpthread_mutex_t mutex;\n\tpthread_cond_t cond;\n\tThreadId backgroundThread;\n\tenum {\n\t\tState_Normal,\n\t\tState_JoinBackgroundThread,\n\t\tState_Exit\n\t} state;\n\tstd::map<ThreadId, ThreadInfo> timers;\n\t\n\tThreadHangDetector() {\n\t\tbackgroundThread = 0;\n\t\tstate = State_Normal;\n\t\tint ret;\n\t\tmutex = (pthread_mutex_t) PTHREAD_MUTEX_INITIALIZER;\n        ret = pthread_mutex_init(&mutex, NULL);\n        assert(ret == 0);\n\t\tcond = (pthread_cond_t) PTHREAD_COND_INITIALIZER;\n\t\tret = pthread_cond_init(&cond, NULL);\n\t\tassert(ret == 0);\n\t}\n\t\n\t~ThreadHangDetector() {\n\t\t{\n\t\t\tMutex::ScopedLock lock(mutex);\n\t\t\ttimers.clear();\n\t\t\t_joinBackgroundThread();\n\t\t\tstate = State_Exit;\n\t\t}\n\t\tpthread_mutex_destroy(&mutex);\n\t\tpthread_cond_destroy(&cond);\n\t}\n\t\n\tvoid registerCurThread(float timeoutSecs) {\n\t\tif(state == State_Exit) {\n\t\t\tprintf(\"ThreadHangDetector_registerCurThread after exit\\n\");\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tThreadId threadId = (ThreadId)pthread_self();\n\t\t\n\t\tThreadInfo info;\n\t\tinfo.timeoutSecs = timeoutSecs;\n\t\tinfo.lastLifeSignal = current_abs_time();\n\t\t\n\t\t{\n\t\t\tMutex::ScopedLock lock(mutex);\n\t\t\ttimers[threadId] = info;\n\n\t\t\twhile(true) {\n\t\t\t\tif(state == State_Exit) break;\n\n\t\t\t\tif(state == State_Normal) {\n\t\t\t\t\tif(!backgroundThread)\n\t\t\t\t\t\t_startBackgroundThread();\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tstruct timespec waitTime;\n\t\t\t\twaitTime.tv_sec = 0;\n\t\t\t\twaitTime.tv_nsec = 1UL * 1000UL * 1000UL; \/\/ 1ms in nanosecs\n\t\t\t\tpthread_cond_timedwait(&cond, &mutex, &waitTime);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tvoid lifeSignalCurThread() {\n\t\tif(state == State_Exit) {\n\t\t\tprintf(\"ThreadHangDetector_lifeSignalCurThread after exit\\n\");\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tThreadId threadId = (ThreadId)pthread_self();\n\t\t\n\t\tMutex::ScopedLock lock(mutex);\n\t\ttimers[threadId].lastLifeSignal = current_abs_time();\n\t}\n\t\n\tvoid unregisterCurThread() {\n\t\tif(state == State_Exit) {\n\t\t\tprintf(\"ThreadHangDetector_unregisterCurThread after exit\\n\");\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tThreadId threadId = (ThreadId)pthread_self();\n\t\t\n\t\tMutex::ScopedLock lock(mutex);\n\t\ttimers.erase(threadId);\n\n\t\twhile(true) {\n\t\t\tif(state == State_Exit) break;\n\t\t\t\n\t\t\tif(state == State_Normal) {\n\t\t\t\tif(timers.empty())\n\t\t\t\t\t_joinBackgroundThread();\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\tstruct timespec waitTime;\n\t\t\twaitTime.tv_sec = 0;\n\t\t\twaitTime.tv_nsec = 1UL * 1000UL * 1000UL; \/\/ 1ms in nanosecs\n\t\t\tpthread_cond_timedwait(&cond, &mutex, &waitTime);\n\t\t}\n\t}\n\t\n\tvoid _startBackgroundThread() {\n\t\tassert(state == State_Normal);\n\t\tassert(!backgroundThread);\n\t\tpthread_t t = 0;\n\t\tint ret = pthread_create(&t, NULL, &backgroundThread_proc, NULL);\n\t\tassert(ret == 0);\n\t\tassert(t);\n\t\tbackgroundThread = (ThreadId) t;\n\t}\n\n\tvoid _joinBackgroundThread() {\n\t\tpthread_t t = (pthread_t) backgroundThread;\n\t\tif(!t) return;\n\t\tbackgroundThread = NULL;\n\t\tassert(state == State_Normal);\n\t\tstate = State_JoinBackgroundThread;\n\t\tpthread_cond_broadcast(&cond);\n\t\t\n\t\tpthread_mutex_unlock(&mutex);\n\t\tpthread_join(t, NULL);\n\t\tpthread_mutex_lock(&mutex);\n\t\t\n\t\tassert(state == State_JoinBackgroundThread);\n\t\tstate = State_Normal;\n\t}\n\t\n\tvoid _backgroundThread() {\n\t\tstruct timespec waitTime;\n\t\twaitTime.tv_sec = 0;\n\t\twaitTime.tv_nsec = 100UL * 1000UL * 1000UL; \/\/ 100ms in nanosecs\n\t\t\n\t\tMutex::ScopedLock lock(mutex);\n\t\twhile(true) {\n\t\t\tif(state != State_Normal) break;\n\t\t\t\n\t\t\tAbsMsTime curTime = current_abs_time();\n\t\t\tfor(const auto& it : timers) {\n\t\t\t\tThreadId threadId = it.first;\n\t\t\t\tconst ThreadInfo& info = it.second;\n\t\t\t\tassert(curTime >= info.lastLifeSignal);\n\t\t\t\tif(curTime - info.lastLifeSignal > AbsMsTime(info.timeoutSecs * 1000)) {\n\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tpthread_cond_timedwait(&cond, &mutex, &waitTime);\n\t\t}\n\t}\n};\n\nstatic ThreadHangDetector detector;\n\n\nvoid* backgroundThread_proc(void*) {\n\tdetector._backgroundThread();\n}\n\n\nvoid ThreadHangDetector_registerCurThread(float timeoutSecs) {\n\tdetector.registerCurThread(timeoutSecs);\n}\n\nvoid ThreadHangDetector_lifeSignalCurThread() {\n\tdetector.lifeSignalCurThread();\n}\n\nvoid ThreadHangDetector_unregisterCurThread() {\n\tdetector.unregisterCurThread();\n}\n\n\n<commit_msg>final<commit_after>\/\/\n\/\/  ThreadHangDetector.cpp\n\/\/  MusicPlayer\n\/\/\n\/\/  Created by Albert Zeyer on 19.02.14.\n\/\/  Copyright (c) 2014 Albert Zeyer. All rights reserved.\n\/\/\n\n#include <Python.h>\n#include <map>\n#include <pthread.h>\n#include <stdio.h>\n#include <assert.h>\n\n#include \"ThreadHangDetector.hpp\"\n#include \"sysutils.hpp\"\n#include \"pthread_mutex.hpp\"\n\n\n\nstruct ThreadInfo {\n\tfloat timeoutSecs;\n\tAbsMsTime lastLifeSignal;\n};\n\nvoid* backgroundThread_proc(void*);\n\nstruct ThreadHangDetector {\n\tpthread_mutex_t mutex;\n\tpthread_cond_t cond;\n\tThreadId backgroundThread;\n\tenum {\n\t\tState_Normal,\n\t\tState_JoinBackgroundThread,\n\t\tState_Exit\n\t} state;\n\tstd::map<ThreadId, ThreadInfo> timers;\n\t\n\tThreadHangDetector() {\n\t\tbackgroundThread = 0;\n\t\tstate = State_Normal;\n\t\tint ret;\n\t\tmutex = (pthread_mutex_t) PTHREAD_MUTEX_INITIALIZER;\n        ret = pthread_mutex_init(&mutex, NULL);\n        assert(ret == 0);\n\t\tcond = (pthread_cond_t) PTHREAD_COND_INITIALIZER;\n\t\tret = pthread_cond_init(&cond, NULL);\n\t\tassert(ret == 0);\n\t}\n\t\n\t~ThreadHangDetector() {\n\t\t{\n\t\t\tMutex::ScopedLock lock(mutex);\n\t\t\ttimers.clear();\n\t\t\t_joinBackgroundThread();\n\t\t\tstate = State_Exit;\n\t\t}\n\t\tpthread_mutex_destroy(&mutex);\n\t\tpthread_cond_destroy(&cond);\n\t}\n\t\n\tvoid registerCurThread(float timeoutSecs) {\n\t\tif(state == State_Exit) {\n\t\t\tprintf(\"ThreadHangDetector_registerCurThread after exit\\n\");\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tThreadId threadId = (ThreadId)pthread_self();\n\t\t\n\t\tThreadInfo info;\n\t\tinfo.timeoutSecs = timeoutSecs;\n\t\tinfo.lastLifeSignal = current_abs_time();\n\t\t\n\t\t{\n\t\t\tMutex::ScopedLock lock(mutex);\n\t\t\ttimers[threadId] = info;\n\n\t\t\twhile(true) {\n\t\t\t\tif(state == State_Exit) break;\n\n\t\t\t\tif(state == State_Normal) {\n\t\t\t\t\tif(!backgroundThread)\n\t\t\t\t\t\t_startBackgroundThread();\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tstruct timespec waitTime;\n\t\t\t\twaitTime.tv_sec = 0;\n\t\t\t\twaitTime.tv_nsec = 1UL * 1000UL * 1000UL; \/\/ 1ms in nanosecs\n\t\t\t\tpthread_cond_timedwait(&cond, &mutex, &waitTime);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tvoid lifeSignalCurThread() {\n\t\tif(state == State_Exit) {\n\t\t\tprintf(\"ThreadHangDetector_lifeSignalCurThread after exit\\n\");\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tThreadId threadId = (ThreadId)pthread_self();\n\t\t\n\t\tMutex::ScopedLock lock(mutex);\n\t\ttimers[threadId].lastLifeSignal = current_abs_time();\n\t}\n\t\n\tvoid unregisterCurThread() {\n\t\tif(state == State_Exit) {\n\t\t\tprintf(\"ThreadHangDetector_unregisterCurThread after exit\\n\");\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tThreadId threadId = (ThreadId)pthread_self();\n\t\t\n\t\tMutex::ScopedLock lock(mutex);\n\t\ttimers.erase(threadId);\n\n\t\twhile(true) {\n\t\t\tif(state == State_Exit) break;\n\t\t\t\n\t\t\tif(state == State_Normal) {\n\t\t\t\tif(timers.empty())\n\t\t\t\t\t_joinBackgroundThread();\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\tstruct timespec waitTime;\n\t\t\twaitTime.tv_sec = 0;\n\t\t\twaitTime.tv_nsec = 1UL * 1000UL * 1000UL; \/\/ 1ms in nanosecs\n\t\t\tpthread_cond_timedwait(&cond, &mutex, &waitTime);\n\t\t}\n\t}\n\t\n\tvoid _startBackgroundThread() {\n\t\tassert(state == State_Normal);\n\t\tassert(!backgroundThread);\n\t\tpthread_t t = 0;\n\t\tint ret = pthread_create(&t, NULL, &backgroundThread_proc, NULL);\n\t\tassert(ret == 0);\n\t\tassert(t);\n\t\tbackgroundThread = (ThreadId) t;\n\t}\n\n\tvoid _joinBackgroundThread() {\n\t\tpthread_t t = (pthread_t) backgroundThread;\n\t\tif(!t) return;\n\t\tbackgroundThread = NULL;\n\t\tassert(state == State_Normal);\n\t\tstate = State_JoinBackgroundThread;\n\t\tpthread_cond_broadcast(&cond);\n\t\t\n\t\tpthread_mutex_unlock(&mutex);\n\t\tpthread_join(t, NULL);\n\t\tpthread_mutex_lock(&mutex);\n\t\t\n\t\tassert(state == State_JoinBackgroundThread);\n\t\tstate = State_Normal;\n\t}\n\t\n\tvoid _backgroundThread() {\n\t\tstruct timespec waitTime;\n\t\twaitTime.tv_sec = 0;\n\t\twaitTime.tv_nsec = 100UL * 1000UL * 1000UL; \/\/ 100ms in nanosecs\n\t\t\n\t\tMutex::ScopedLock lock(mutex);\n\t\twhile(true) {\n\t\t\tif(state != State_Normal) break;\n\t\t\t\n\t\t\tAbsMsTime curTime = current_abs_time();\n\t\t\tfor(const auto& it : timers) {\n\t\t\t\tThreadId threadId = it.first;\n\t\t\t\tconst ThreadInfo& info = it.second;\n\t\t\t\tassert(curTime >= info.lastLifeSignal);\n\t\t\t\tif(curTime - info.lastLifeSignal > AbsMsTime(info.timeoutSecs * 1000)) {\n\t\t\t\t\tExecInThread(threadId, [](int,void*,void*) {\n\t\t\t\t\t\tprintf(\"Thread is hanging\\n\");\n\t\t\t\t\t\tprint_backtrace(true);\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tpthread_cond_timedwait(&cond, &mutex, &waitTime);\n\t\t}\n\t}\n};\n\nstatic ThreadHangDetector detector;\n\n\nvoid* backgroundThread_proc(void*) {\n\tdetector._backgroundThread();\n}\n\n\nvoid ThreadHangDetector_registerCurThread(float timeoutSecs) {\n\tdetector.registerCurThread(timeoutSecs);\n}\n\nvoid ThreadHangDetector_lifeSignalCurThread() {\n\tdetector.lifeSignalCurThread();\n}\n\nvoid ThreadHangDetector_unregisterCurThread() {\n\tdetector.unregisterCurThread();\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*  This file is part of the KDE project.\n\nCopyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n\nThis library is free software: you can redistribute it and\/or modify\nit under the terms of the GNU Lesser General Public License as published by\nthe Free Software Foundation, either version 2.1 or 3 of the License.\n\nThis library is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\nGNU Lesser General Public License for more details.\n\nYou should have received a copy of the GNU Lesser General Public License\nalong with this library.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n#include <QUrl>\n\n#include \"abstractmediaplayer.h\"\n#include \"defs.h\"\n#include \"utils.h\"\n\nQT_BEGIN_NAMESPACE\n\nusing namespace Phonon;\nusing namespace Phonon::MMF;\n\n\/*! \\class MMF::AbstractMediaPlayer\n  \\internal\n*\/\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Constants\n\/\/-----------------------------------------------------------------------------\n\nconst int       NullMaxVolume = -1;\n\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Constructor \/ destructor\n\/\/-----------------------------------------------------------------------------\n\nMMF::AbstractMediaPlayer::AbstractMediaPlayer() :\n            m_playPending(false)\n        ,   m_tickTimer(new QTimer(this))\n        ,   m_mmfMaxVolume(NullMaxVolume)\n{\n    connect(m_tickTimer.data(), SIGNAL(timeout()), this, SLOT(tick()));\n}\n\nMMF::AbstractMediaPlayer::AbstractMediaPlayer(const AbstractPlayer& player) :\n        AbstractPlayer(player)\n        ,   m_playPending(false)\n        ,   m_tickTimer(new QTimer(this))\n        ,   m_mmfMaxVolume(NullMaxVolume)\n{\n    connect(m_tickTimer.data(), SIGNAL(timeout()), this, SLOT(tick()));\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ MediaObjectInterface\n\/\/-----------------------------------------------------------------------------\n\nvoid MMF::AbstractMediaPlayer::play()\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::play, EAudioApi);\n    TRACE_ENTRY(\"state %d\", privateState());\n\n    switch (privateState()) {\n    case GroundState:\n        setError(NormalError);\n        break;\n\n    case LoadingState:\n        m_playPending = true;\n        break;\n\n    case StoppedState:\n    case PausedState:\n        doPlay();\n        startTickTimer();\n        changeState(PlayingState);\n        break;\n\n    case PlayingState:\n    case BufferingState:\n    case ErrorState:\n        \/\/ Do nothing\n        break;\n\n        \/\/ Protection against adding new states and forgetting to update this switch\n    default:\n        TRACE_PANIC(InvalidStatePanic);\n    }\n\n    TRACE_EXIT(\"state %d\", privateState());\n}\n\nvoid MMF::AbstractMediaPlayer::pause()\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::pause, EAudioApi);\n    TRACE_ENTRY(\"state %d\", privateState());\n\n    m_playPending = false;\n\n    switch (privateState()) {\n    case GroundState:\n    case LoadingState:\n    case PausedState:\n    case ErrorState:\n        \/\/ Do nothing\n        break;\n\n    case StoppedState:\n    case PlayingState:\n    case BufferingState:\n        doPause();\n        stopTickTimer();\n        changeState(PausedState);\n        break;\n\n        \/\/ Protection against adding new states and forgetting to update this switch\n    default:\n        TRACE_PANIC(InvalidStatePanic);\n    }\n\n    TRACE_EXIT(\"state %d\", privateState());\n}\n\nvoid MMF::AbstractMediaPlayer::stop()\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::stop, EAudioApi);\n    TRACE_ENTRY(\"state %d\", privateState());\n\n    m_playPending = false;\n\n    switch (privateState()) {\n    case GroundState:\n    case LoadingState:\n    case StoppedState:\n    case ErrorState:\n        \/\/ Do nothing\n        break;\n\n    case PlayingState:\n    case BufferingState:\n    case PausedState:\n        doStop();\n        stopTickTimer();\n        changeState(StoppedState);\n        break;\n\n        \/\/ Protection against adding new states and forgetting to update this switch\n    default:\n        TRACE_PANIC(InvalidStatePanic);\n    }\n\n    TRACE_EXIT(\"state %d\", privateState());\n}\n\nvoid MMF::AbstractMediaPlayer::seek(qint64 ms)\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::seek, EAudioApi);\n    TRACE_ENTRY(\"state %d pos %Ld\", state(), ms);\n\n    switch (privateState()) {\n    \/\/ Fallthrough all these\n    case GroundState:\n    case StoppedState:\n    case PausedState:\n    case PlayingState:\n    case LoadingState:\n    {\n        const bool tickTimerWasRunning = m_tickTimer->isActive();\n        stopTickTimer();\n\n        doSeek(ms);\n\n        if (tickTimerWasRunning) {\n            startTickTimer();\n        }\n        break;\n    }\n    case BufferingState:\n    \/\/ Fallthrough\n    case ErrorState:\n        \/\/ Do nothing\n        break;\n    }\n\n    TRACE_EXIT_0();\n}\n\nbool MMF::AbstractMediaPlayer::isSeekable() const\n{\n    return true;\n}\n\nvoid MMF::AbstractMediaPlayer::doSetTickInterval(qint32 interval)\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::doSetTickInterval, EAudioApi);\n    TRACE_ENTRY(\"state %d m_interval %d interval %d\", privateState(), tickInterval(), interval);\n\n    m_tickTimer->setInterval(interval);\n\n    TRACE_EXIT_0();\n}\n\nMediaSource MMF::AbstractMediaPlayer::source() const\n{\n    return m_source;\n}\n\nvoid MMF::AbstractMediaPlayer::setFileSource(const MediaSource &source, RFile& file)\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::setFileSource, EAudioApi);\n    TRACE_ENTRY(\"state %d source.type %d\", privateState(), source.type());\n\n    close();\n    changeState(GroundState);\n\n    \/\/ TODO: is it correct to assign even if the media type is not supported in\n    \/\/ the switch statement below?\n    m_source = source;\n\n    TInt symbianErr = KErrNone;\n\n    switch (m_source.type()) {\n    case MediaSource::LocalFile: {\n        symbianErr = openFile(file);\n        break;\n    }\n\n    case MediaSource::Url: {\n        const QUrl url(source.url());\n\n        if (url.scheme() == QLatin1String(\"file\")) {\n            symbianErr = openFile(file);\n        }\n        else {\n            TRACE_0(\"Source type not supported\");\n            \/\/ TODO: support network URLs\n            symbianErr = KErrNotSupported;\n        }\n\n        break;\n    }\n\n    case MediaSource::Invalid:\n    case MediaSource::Disc:\n    case MediaSource::Stream:\n        TRACE_0(\"Source type not supported\");\n        symbianErr = KErrNotSupported;\n        break;\n\n    case MediaSource::Empty:\n        TRACE_0(\"Empty source - doing nothing\");\n        TRACE_EXIT_0();\n        return;\n\n        \/\/ Protection against adding new media types and forgetting to update this switch\n    default:\n        TRACE_PANIC(InvalidMediaTypePanic);\n    }\n\n    if (KErrNone == symbianErr) {\n        changeState(LoadingState);\n    } else {\n        TRACE(\"error %d\", symbianErr)\n        setError(NormalError);\n    }\n\n    TRACE_EXIT_0();\n}\n\nvoid MMF::AbstractMediaPlayer::setNextSource(const MediaSource &source)\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::setNextSource, EAudioApi);\n    TRACE_ENTRY(\"state %d\", privateState());\n\n    \/\/ TODO: handle 'next source'\n\n    m_nextSource = source;\n    Q_UNUSED(source);\n\n    TRACE_EXIT_0();\n}\n\n\n\/\/-----------------------------------------------------------------------------\n\/\/ VolumeObserver\n\/\/-----------------------------------------------------------------------------\n\nvoid MMF::AbstractMediaPlayer::volumeChanged(qreal volume)\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::volumeChanged, EAudioInternal);\n    TRACE_ENTRY(\"state %d\", privateState());\n\n    AbstractPlayer::volumeChanged(volume);\n    doVolumeChanged();\n\n    TRACE_EXIT_0();\n}\n\n\nvoid MMF::AbstractMediaPlayer::doVolumeChanged()\n{\n    switch (privateState()) {\n    case GroundState:\n    case LoadingState:\n    case ErrorState:\n        \/\/ Do nothing\n        break;\n\n    case StoppedState:\n    case PausedState:\n    case PlayingState:\n    case BufferingState: {\n        const int err = setDeviceVolume(m_volume * m_mmfMaxVolume);\n\n        if (KErrNone != err) {\n            setError(NormalError);\n        }\n        break;\n    }\n\n    \/\/ Protection against adding new states and forgetting to update this\n    \/\/ switch\n    default:\n        Utils::panic(InvalidStatePanic);\n    }\n}\n\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Protected functions\n\/\/-----------------------------------------------------------------------------\n\nvoid MMF::AbstractMediaPlayer::startTickTimer()\n{\n    m_tickTimer->start(tickInterval());\n}\n\nvoid MMF::AbstractMediaPlayer::stopTickTimer()\n{\n    m_tickTimer->stop();\n}\n\nvoid MMF::AbstractMediaPlayer::maxVolumeChanged(int mmfMaxVolume)\n{\n    m_mmfMaxVolume = mmfMaxVolume;\n    doVolumeChanged();\n}\n\nqint64 MMF::AbstractMediaPlayer::toMilliSeconds(const TTimeIntervalMicroSeconds &in)\n{\n    return in.Int64() \/ 1000;\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Slots\n\/\/-----------------------------------------------------------------------------\n\nvoid MMF::AbstractMediaPlayer::tick()\n{\n    \/\/ For the MWC compiler, we need to qualify the base class.\n    emit MMF::AbstractPlayer::tick(currentTime());\n}\n\nvoid MMF::AbstractMediaPlayer::changeState(PrivateState newState)\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::changeState, EAudioInternal);\n\n    \/\/ TODO: add some invariants to check that the transition is valid\n    AbstractPlayer::changeState(newState);\n\n    const Phonon::State oldPhononState = phononState(privateState());\n    const Phonon::State newPhononState = phononState(newState);\n\n    if (LoadingState == oldPhononState && StoppedState == newPhononState) {\n        \/\/ Ensure initial volume is set on MMF API before starting playback\n        doVolumeChanged();\n\n        \/\/ Check whether play() was called while clip was being loaded.  If so,\n        \/\/ playback should be started now\n        if (m_playPending) {\n            TRACE_0(\"play was called while loading; starting playback now\");\n            m_playPending = false;\n            play();\n        }\n    }\n\n}\n\nQT_END_NAMESPACE\n\n<commit_msg>Fixed state bug in Phonon MMF backend<commit_after>\/*  This file is part of the KDE project.\n\nCopyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n\nThis library is free software: you can redistribute it and\/or modify\nit under the terms of the GNU Lesser General Public License as published by\nthe Free Software Foundation, either version 2.1 or 3 of the License.\n\nThis library is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\nGNU Lesser General Public License for more details.\n\nYou should have received a copy of the GNU Lesser General Public License\nalong with this library.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n#include <QUrl>\n\n#include \"abstractmediaplayer.h\"\n#include \"defs.h\"\n#include \"utils.h\"\n\nQT_BEGIN_NAMESPACE\n\nusing namespace Phonon;\nusing namespace Phonon::MMF;\n\n\/*! \\class MMF::AbstractMediaPlayer\n  \\internal\n*\/\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Constants\n\/\/-----------------------------------------------------------------------------\n\nconst int       NullMaxVolume = -1;\n\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Constructor \/ destructor\n\/\/-----------------------------------------------------------------------------\n\nMMF::AbstractMediaPlayer::AbstractMediaPlayer() :\n            m_playPending(false)\n        ,   m_tickTimer(new QTimer(this))\n        ,   m_mmfMaxVolume(NullMaxVolume)\n{\n    connect(m_tickTimer.data(), SIGNAL(timeout()), this, SLOT(tick()));\n}\n\nMMF::AbstractMediaPlayer::AbstractMediaPlayer(const AbstractPlayer& player) :\n        AbstractPlayer(player)\n        ,   m_playPending(false)\n        ,   m_tickTimer(new QTimer(this))\n        ,   m_mmfMaxVolume(NullMaxVolume)\n{\n    connect(m_tickTimer.data(), SIGNAL(timeout()), this, SLOT(tick()));\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ MediaObjectInterface\n\/\/-----------------------------------------------------------------------------\n\nvoid MMF::AbstractMediaPlayer::play()\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::play, EAudioApi);\n    TRACE_ENTRY(\"state %d\", privateState());\n\n    switch (privateState()) {\n    case GroundState:\n        setError(NormalError);\n        break;\n\n    case LoadingState:\n        m_playPending = true;\n        break;\n\n    case StoppedState:\n    case PausedState:\n        doPlay();\n        startTickTimer();\n        changeState(PlayingState);\n        break;\n\n    case PlayingState:\n    case BufferingState:\n    case ErrorState:\n        \/\/ Do nothing\n        break;\n\n        \/\/ Protection against adding new states and forgetting to update this switch\n    default:\n        TRACE_PANIC(InvalidStatePanic);\n    }\n\n    TRACE_EXIT(\"state %d\", privateState());\n}\n\nvoid MMF::AbstractMediaPlayer::pause()\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::pause, EAudioApi);\n    TRACE_ENTRY(\"state %d\", privateState());\n\n    m_playPending = false;\n\n    switch (privateState()) {\n    case GroundState:\n    case LoadingState:\n    case PausedState:\n    case ErrorState:\n        \/\/ Do nothing\n        break;\n\n    case StoppedState:\n    case PlayingState:\n    case BufferingState:\n        doPause();\n        stopTickTimer();\n        changeState(PausedState);\n        break;\n\n        \/\/ Protection against adding new states and forgetting to update this switch\n    default:\n        TRACE_PANIC(InvalidStatePanic);\n    }\n\n    TRACE_EXIT(\"state %d\", privateState());\n}\n\nvoid MMF::AbstractMediaPlayer::stop()\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::stop, EAudioApi);\n    TRACE_ENTRY(\"state %d\", privateState());\n\n    m_playPending = false;\n\n    switch (privateState()) {\n    case GroundState:\n    case LoadingState:\n    case StoppedState:\n    case ErrorState:\n        \/\/ Do nothing\n        break;\n\n    case PlayingState:\n    case BufferingState:\n    case PausedState:\n        doStop();\n        stopTickTimer();\n        changeState(StoppedState);\n        break;\n\n        \/\/ Protection against adding new states and forgetting to update this switch\n    default:\n        TRACE_PANIC(InvalidStatePanic);\n    }\n\n    TRACE_EXIT(\"state %d\", privateState());\n}\n\nvoid MMF::AbstractMediaPlayer::seek(qint64 ms)\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::seek, EAudioApi);\n    TRACE_ENTRY(\"state %d pos %Ld\", state(), ms);\n\n    switch (privateState()) {\n    \/\/ Fallthrough all these\n    case GroundState:\n    case StoppedState:\n    case PausedState:\n    case PlayingState:\n    case LoadingState:\n    {\n        const bool tickTimerWasRunning = m_tickTimer->isActive();\n        stopTickTimer();\n\n        doSeek(ms);\n\n        if (tickTimerWasRunning) {\n            startTickTimer();\n        }\n        break;\n    }\n    case BufferingState:\n    \/\/ Fallthrough\n    case ErrorState:\n        \/\/ Do nothing\n        break;\n    }\n\n    TRACE_EXIT_0();\n}\n\nbool MMF::AbstractMediaPlayer::isSeekable() const\n{\n    return true;\n}\n\nvoid MMF::AbstractMediaPlayer::doSetTickInterval(qint32 interval)\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::doSetTickInterval, EAudioApi);\n    TRACE_ENTRY(\"state %d m_interval %d interval %d\", privateState(), tickInterval(), interval);\n\n    m_tickTimer->setInterval(interval);\n\n    TRACE_EXIT_0();\n}\n\nMediaSource MMF::AbstractMediaPlayer::source() const\n{\n    return m_source;\n}\n\nvoid MMF::AbstractMediaPlayer::setFileSource(const MediaSource &source, RFile& file)\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::setFileSource, EAudioApi);\n    TRACE_ENTRY(\"state %d source.type %d\", privateState(), source.type());\n\n    close();\n    changeState(GroundState);\n\n    \/\/ TODO: is it correct to assign even if the media type is not supported in\n    \/\/ the switch statement below?\n    m_source = source;\n\n    TInt symbianErr = KErrNone;\n\n    switch (m_source.type()) {\n    case MediaSource::LocalFile: {\n        symbianErr = openFile(file);\n        break;\n    }\n\n    case MediaSource::Url: {\n        const QUrl url(source.url());\n\n        if (url.scheme() == QLatin1String(\"file\")) {\n            symbianErr = openFile(file);\n        }\n        else {\n            TRACE_0(\"Source type not supported\");\n            \/\/ TODO: support network URLs\n            symbianErr = KErrNotSupported;\n        }\n\n        break;\n    }\n\n    case MediaSource::Invalid:\n    case MediaSource::Disc:\n    case MediaSource::Stream:\n        TRACE_0(\"Source type not supported\");\n        symbianErr = KErrNotSupported;\n        break;\n\n    case MediaSource::Empty:\n        TRACE_0(\"Empty source - doing nothing\");\n        TRACE_EXIT_0();\n        return;\n\n        \/\/ Protection against adding new media types and forgetting to update this switch\n    default:\n        TRACE_PANIC(InvalidMediaTypePanic);\n    }\n\n    if (KErrNone == symbianErr) {\n        changeState(LoadingState);\n    } else {\n        TRACE(\"error %d\", symbianErr)\n        setError(NormalError);\n    }\n\n    TRACE_EXIT_0();\n}\n\nvoid MMF::AbstractMediaPlayer::setNextSource(const MediaSource &source)\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::setNextSource, EAudioApi);\n    TRACE_ENTRY(\"state %d\", privateState());\n\n    \/\/ TODO: handle 'next source'\n\n    m_nextSource = source;\n    Q_UNUSED(source);\n\n    TRACE_EXIT_0();\n}\n\n\n\/\/-----------------------------------------------------------------------------\n\/\/ VolumeObserver\n\/\/-----------------------------------------------------------------------------\n\nvoid MMF::AbstractMediaPlayer::volumeChanged(qreal volume)\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::volumeChanged, EAudioInternal);\n    TRACE_ENTRY(\"state %d\", privateState());\n\n    AbstractPlayer::volumeChanged(volume);\n    doVolumeChanged();\n\n    TRACE_EXIT_0();\n}\n\n\nvoid MMF::AbstractMediaPlayer::doVolumeChanged()\n{\n    switch (privateState()) {\n    case GroundState:\n    case LoadingState:\n    case ErrorState:\n        \/\/ Do nothing\n        break;\n\n    case StoppedState:\n    case PausedState:\n    case PlayingState:\n    case BufferingState: {\n        const int err = setDeviceVolume(m_volume * m_mmfMaxVolume);\n\n        if (KErrNone != err) {\n            setError(NormalError);\n        }\n        break;\n    }\n\n    \/\/ Protection against adding new states and forgetting to update this\n    \/\/ switch\n    default:\n        Utils::panic(InvalidStatePanic);\n    }\n}\n\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Protected functions\n\/\/-----------------------------------------------------------------------------\n\nvoid MMF::AbstractMediaPlayer::startTickTimer()\n{\n    m_tickTimer->start(tickInterval());\n}\n\nvoid MMF::AbstractMediaPlayer::stopTickTimer()\n{\n    m_tickTimer->stop();\n}\n\nvoid MMF::AbstractMediaPlayer::maxVolumeChanged(int mmfMaxVolume)\n{\n    m_mmfMaxVolume = mmfMaxVolume;\n    doVolumeChanged();\n}\n\nqint64 MMF::AbstractMediaPlayer::toMilliSeconds(const TTimeIntervalMicroSeconds &in)\n{\n    return in.Int64() \/ 1000;\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Slots\n\/\/-----------------------------------------------------------------------------\n\nvoid MMF::AbstractMediaPlayer::tick()\n{\n    \/\/ For the MWC compiler, we need to qualify the base class.\n    emit MMF::AbstractPlayer::tick(currentTime());\n}\n\nvoid MMF::AbstractMediaPlayer::changeState(PrivateState newState)\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::changeState, EAudioInternal);\n\n    const Phonon::State oldPhononState = phononState(privateState());\n    const Phonon::State newPhononState = phononState(newState);\n\n    \/\/ TODO: add some invariants to check that the transition is valid\n    AbstractPlayer::changeState(newState);\n\n    if (LoadingState == oldPhononState && StoppedState == newPhononState) {\n        \/\/ Ensure initial volume is set on MMF API before starting playback\n        doVolumeChanged();\n\n        \/\/ Check whether play() was called while clip was being loaded.  If so,\n        \/\/ playback should be started now\n        if (m_playPending) {\n            TRACE_0(\"play was called while loading; starting playback now\");\n            m_playPending = false;\n            play();\n        }\n    }\n\n}\n\nQT_END_NAMESPACE\n\n<|endoftext|>"}
{"text":"<commit_before>\/*  This file is part of the KDE project.\n\nCopyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n\nThis library is free software: you can redistribute it and\/or modify\nit under the terms of the GNU Lesser General Public License as published by\nthe Free Software Foundation, either version 2.1 or 3 of the License.\n\nThis library is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\nGNU Lesser General Public License for more details.\n\nYou should have received a copy of the GNU Lesser General Public License\nalong with this library.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n#include <QUrl>\n\n#include \"abstractmediaplayer.h\"\n#include \"defs.h\"\n#include \"utils.h\"\n\nQT_BEGIN_NAMESPACE\n\nusing namespace Phonon;\nusing namespace Phonon::MMF;\n\n\/*! \\class MMF::AbstractMediaPlayer\n  \\internal\n*\/\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Constants\n\/\/-----------------------------------------------------------------------------\n\nconst int       NullMaxVolume = -1;\n\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Constructor \/ destructor\n\/\/-----------------------------------------------------------------------------\n\nMMF::AbstractMediaPlayer::AbstractMediaPlayer() :\n            m_playPending(false)\n        ,   m_tickTimer(new QTimer(this))\n        ,   m_mmfMaxVolume(NullMaxVolume)\n{\n    connect(m_tickTimer.data(), SIGNAL(timeout()), this, SLOT(tick()));\n}\n\nMMF::AbstractMediaPlayer::AbstractMediaPlayer(const AbstractPlayer& player) :\n        AbstractPlayer(player)\n        ,   m_playPending(false)\n        ,   m_tickTimer(new QTimer(this))\n        ,   m_mmfMaxVolume(NullMaxVolume)\n{\n    connect(m_tickTimer.data(), SIGNAL(timeout()), this, SLOT(tick()));\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ MediaObjectInterface\n\/\/-----------------------------------------------------------------------------\n\nvoid MMF::AbstractMediaPlayer::play()\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::play, EAudioApi);\n    TRACE_ENTRY(\"state %d\", privateState());\n\n    switch (privateState()) {\n    case GroundState:\n        setError(NormalError);\n        break;\n\n    case LoadingState:\n        m_playPending = true;\n        break;\n\n    case StoppedState:\n    case PausedState:\n        doPlay();\n        startTickTimer();\n        changeState(PlayingState);\n        break;\n\n    case PlayingState:\n    case BufferingState:\n    case ErrorState:\n        \/\/ Do nothing\n        break;\n\n        \/\/ Protection against adding new states and forgetting to update this switch\n    default:\n        TRACE_PANIC(InvalidStatePanic);\n    }\n\n    TRACE_EXIT(\"state %d\", privateState());\n}\n\nvoid MMF::AbstractMediaPlayer::pause()\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::pause, EAudioApi);\n    TRACE_ENTRY(\"state %d\", privateState());\n\n    m_playPending = false;\n\n    switch (privateState()) {\n    case GroundState:\n    case LoadingState:\n    case PausedState:\n    case ErrorState:\n        \/\/ Do nothing\n        break;\n\n    case StoppedState:\n    case PlayingState:\n    case BufferingState:\n        doPause();\n        stopTickTimer();\n        changeState(PausedState);\n        break;\n\n        \/\/ Protection against adding new states and forgetting to update this switch\n    default:\n        TRACE_PANIC(InvalidStatePanic);\n    }\n\n    TRACE_EXIT(\"state %d\", privateState());\n}\n\nvoid MMF::AbstractMediaPlayer::stop()\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::stop, EAudioApi);\n    TRACE_ENTRY(\"state %d\", privateState());\n\n    m_playPending = false;\n\n    switch (privateState()) {\n    case GroundState:\n    case LoadingState:\n    case StoppedState:\n    case ErrorState:\n        \/\/ Do nothing\n        break;\n\n    case PlayingState:\n    case BufferingState:\n    case PausedState:\n        doStop();\n        stopTickTimer();\n        changeState(StoppedState);\n        break;\n\n        \/\/ Protection against adding new states and forgetting to update this switch\n    default:\n        TRACE_PANIC(InvalidStatePanic);\n    }\n\n    TRACE_EXIT(\"state %d\", privateState());\n}\n\nvoid MMF::AbstractMediaPlayer::seek(qint64 ms)\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::seek, EAudioApi);\n    TRACE_ENTRY(\"state %d pos %Ld\", state(), ms);\n\n    switch (privateState()) {\n    \/\/ Fallthrough all these\n    case GroundState:\n    case StoppedState:\n    case PausedState:\n    case PlayingState:\n    case LoadingState:\n    {\n        const bool tickTimerWasRunning = m_tickTimer->isActive();\n        stopTickTimer();\n\n        doSeek(ms);\n\n        if (tickTimerWasRunning) {\n            startTickTimer();\n        }\n        break;\n    }\n    case BufferingState:\n    \/\/ Fallthrough\n    case ErrorState:\n        \/\/ Do nothing\n        break;\n    }\n\n    TRACE_EXIT_0();\n}\n\nbool MMF::AbstractMediaPlayer::isSeekable() const\n{\n    return true;\n}\n\nvoid MMF::AbstractMediaPlayer::doSetTickInterval(qint32 interval)\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::doSetTickInterval, EAudioApi);\n    TRACE_ENTRY(\"state %d m_interval %d interval %d\", privateState(), tickInterval(), interval);\n\n    m_tickTimer->setInterval(interval);\n\n    TRACE_EXIT_0();\n}\n\nMediaSource MMF::AbstractMediaPlayer::source() const\n{\n    return m_source;\n}\n\nvoid MMF::AbstractMediaPlayer::setFileSource(const MediaSource &source, RFile& file)\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::setFileSource, EAudioApi);\n    TRACE_ENTRY(\"state %d source.type %d\", privateState(), source.type());\n\n    close();\n    changeState(GroundState);\n\n    \/\/ TODO: is it correct to assign even if the media type is not supported in\n    \/\/ the switch statement below?\n    m_source = source;\n\n    TInt symbianErr = KErrNone;\n\n    switch (m_source.type()) {\n    case MediaSource::LocalFile: {\n        symbianErr = openFile(file);\n        break;\n    }\n\n    case MediaSource::Url: {\n        const QUrl url(source.url());\n\n        if (url.scheme() == QLatin1String(\"file\")) {\n            symbianErr = openFile(file);\n        }\n        else {\n            TRACE_0(\"Source type not supported\");\n            \/\/ TODO: support network URLs\n            symbianErr = KErrNotSupported;\n        }\n\n        break;\n    }\n\n    case MediaSource::Invalid:\n    case MediaSource::Disc:\n    case MediaSource::Stream:\n        TRACE_0(\"Source type not supported\");\n        symbianErr = KErrNotSupported;\n        break;\n\n    case MediaSource::Empty:\n        TRACE_0(\"Empty source - doing nothing\");\n        TRACE_EXIT_0();\n        return;\n\n        \/\/ Protection against adding new media types and forgetting to update this switch\n    default:\n        TRACE_PANIC(InvalidMediaTypePanic);\n    }\n\n    if (KErrNone == symbianErr) {\n        changeState(LoadingState);\n    } else {\n        TRACE(\"error %d\", symbianErr)\n        setError(NormalError);\n    }\n\n    TRACE_EXIT_0();\n}\n\nvoid MMF::AbstractMediaPlayer::setNextSource(const MediaSource &source)\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::setNextSource, EAudioApi);\n    TRACE_ENTRY(\"state %d\", privateState());\n\n    \/\/ TODO: handle 'next source'\n\n    m_nextSource = source;\n    Q_UNUSED(source);\n\n    TRACE_EXIT_0();\n}\n\n\n\/\/-----------------------------------------------------------------------------\n\/\/ VolumeObserver\n\/\/-----------------------------------------------------------------------------\n\nvoid MMF::AbstractMediaPlayer::volumeChanged(qreal volume)\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::volumeChanged, EAudioInternal);\n    TRACE_ENTRY(\"state %d\", privateState());\n\n    AbstractPlayer::volumeChanged(volume);\n    doVolumeChanged();\n\n    TRACE_EXIT_0();\n}\n\n\nvoid MMF::AbstractMediaPlayer::doVolumeChanged()\n{\n    switch (privateState()) {\n    case GroundState:\n    case LoadingState:\n    case ErrorState:\n        \/\/ Do nothing\n        break;\n\n    case StoppedState:\n    case PausedState:\n    case PlayingState:\n    case BufferingState: {\n        const int err = setDeviceVolume(m_volume * m_mmfMaxVolume);\n\n        if (KErrNone != err) {\n            setError(NormalError);\n        }\n        break;\n    }\n\n    \/\/ Protection against adding new states and forgetting to update this\n    \/\/ switch\n    default:\n        Utils::panic(InvalidStatePanic);\n    }\n}\n\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Protected functions\n\/\/-----------------------------------------------------------------------------\n\nvoid MMF::AbstractMediaPlayer::startTickTimer()\n{\n    m_tickTimer->start(tickInterval());\n}\n\nvoid MMF::AbstractMediaPlayer::stopTickTimer()\n{\n    m_tickTimer->stop();\n}\n\nvoid MMF::AbstractMediaPlayer::maxVolumeChanged(int mmfMaxVolume)\n{\n    m_mmfMaxVolume = mmfMaxVolume;\n    doVolumeChanged();\n}\n\nqint64 MMF::AbstractMediaPlayer::toMilliSeconds(const TTimeIntervalMicroSeconds &in)\n{\n    return in.Int64() \/ 1000;\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Slots\n\/\/-----------------------------------------------------------------------------\n\nvoid MMF::AbstractMediaPlayer::tick()\n{\n    \/\/ For the MWC compiler, we need to qualify the base class.\n    emit MMF::AbstractPlayer::tick(currentTime());\n}\n\nvoid MMF::AbstractMediaPlayer::changeState(PrivateState newState)\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::changeState, EAudioInternal);\n\n    const Phonon::State oldPhononState = phononState(privateState());\n    const Phonon::State newPhononState = phononState(newState);\n\n    \/\/ TODO: add some invariants to check that the transition is valid\n    AbstractPlayer::changeState(newState);\n\n    if (LoadingState == oldPhononState && StoppedState == newPhononState) {\n        \/\/ Ensure initial volume is set on MMF API before starting playback\n        doVolumeChanged();\n\n        \/\/ Check whether play() was called while clip was being loaded.  If so,\n        \/\/ playback should be started now\n        if (m_playPending) {\n            TRACE_0(\"play was called while loading; starting playback now\");\n            m_playPending = false;\n            play();\n        }\n    }\n\n}\n\nQT_END_NAMESPACE\n\n<commit_msg>Fixed volume calculation in Phonon MMF backend<commit_after>\/*  This file is part of the KDE project.\n\nCopyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n\nThis library is free software: you can redistribute it and\/or modify\nit under the terms of the GNU Lesser General Public License as published by\nthe Free Software Foundation, either version 2.1 or 3 of the License.\n\nThis library is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\nGNU Lesser General Public License for more details.\n\nYou should have received a copy of the GNU Lesser General Public License\nalong with this library.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n#include <QUrl>\n\n#include \"abstractmediaplayer.h\"\n#include \"defs.h\"\n#include \"utils.h\"\n\nQT_BEGIN_NAMESPACE\n\nusing namespace Phonon;\nusing namespace Phonon::MMF;\n\n\/*! \\class MMF::AbstractMediaPlayer\n  \\internal\n*\/\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Constants\n\/\/-----------------------------------------------------------------------------\n\nconst int       NullMaxVolume = -1;\n\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Constructor \/ destructor\n\/\/-----------------------------------------------------------------------------\n\nMMF::AbstractMediaPlayer::AbstractMediaPlayer() :\n            m_playPending(false)\n        ,   m_tickTimer(new QTimer(this))\n        ,   m_mmfMaxVolume(NullMaxVolume)\n{\n    connect(m_tickTimer.data(), SIGNAL(timeout()), this, SLOT(tick()));\n}\n\nMMF::AbstractMediaPlayer::AbstractMediaPlayer(const AbstractPlayer& player) :\n        AbstractPlayer(player)\n        ,   m_playPending(false)\n        ,   m_tickTimer(new QTimer(this))\n        ,   m_mmfMaxVolume(NullMaxVolume)\n{\n    connect(m_tickTimer.data(), SIGNAL(timeout()), this, SLOT(tick()));\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ MediaObjectInterface\n\/\/-----------------------------------------------------------------------------\n\nvoid MMF::AbstractMediaPlayer::play()\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::play, EAudioApi);\n    TRACE_ENTRY(\"state %d\", privateState());\n\n    switch (privateState()) {\n    case GroundState:\n        setError(NormalError);\n        break;\n\n    case LoadingState:\n        m_playPending = true;\n        break;\n\n    case StoppedState:\n    case PausedState:\n        doPlay();\n        startTickTimer();\n        changeState(PlayingState);\n        break;\n\n    case PlayingState:\n    case BufferingState:\n    case ErrorState:\n        \/\/ Do nothing\n        break;\n\n        \/\/ Protection against adding new states and forgetting to update this switch\n    default:\n        TRACE_PANIC(InvalidStatePanic);\n    }\n\n    TRACE_EXIT(\"state %d\", privateState());\n}\n\nvoid MMF::AbstractMediaPlayer::pause()\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::pause, EAudioApi);\n    TRACE_ENTRY(\"state %d\", privateState());\n\n    m_playPending = false;\n\n    switch (privateState()) {\n    case GroundState:\n    case LoadingState:\n    case PausedState:\n    case ErrorState:\n        \/\/ Do nothing\n        break;\n\n    case StoppedState:\n    case PlayingState:\n    case BufferingState:\n        doPause();\n        stopTickTimer();\n        changeState(PausedState);\n        break;\n\n        \/\/ Protection against adding new states and forgetting to update this switch\n    default:\n        TRACE_PANIC(InvalidStatePanic);\n    }\n\n    TRACE_EXIT(\"state %d\", privateState());\n}\n\nvoid MMF::AbstractMediaPlayer::stop()\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::stop, EAudioApi);\n    TRACE_ENTRY(\"state %d\", privateState());\n\n    m_playPending = false;\n\n    switch (privateState()) {\n    case GroundState:\n    case LoadingState:\n    case StoppedState:\n    case ErrorState:\n        \/\/ Do nothing\n        break;\n\n    case PlayingState:\n    case BufferingState:\n    case PausedState:\n        doStop();\n        stopTickTimer();\n        changeState(StoppedState);\n        break;\n\n        \/\/ Protection against adding new states and forgetting to update this switch\n    default:\n        TRACE_PANIC(InvalidStatePanic);\n    }\n\n    TRACE_EXIT(\"state %d\", privateState());\n}\n\nvoid MMF::AbstractMediaPlayer::seek(qint64 ms)\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::seek, EAudioApi);\n    TRACE_ENTRY(\"state %d pos %Ld\", state(), ms);\n\n    switch (privateState()) {\n    \/\/ Fallthrough all these\n    case GroundState:\n    case StoppedState:\n    case PausedState:\n    case PlayingState:\n    case LoadingState:\n    {\n        const bool tickTimerWasRunning = m_tickTimer->isActive();\n        stopTickTimer();\n\n        doSeek(ms);\n\n        if (tickTimerWasRunning) {\n            startTickTimer();\n        }\n        break;\n    }\n    case BufferingState:\n    \/\/ Fallthrough\n    case ErrorState:\n        \/\/ Do nothing\n        break;\n    }\n\n    TRACE_EXIT_0();\n}\n\nbool MMF::AbstractMediaPlayer::isSeekable() const\n{\n    return true;\n}\n\nvoid MMF::AbstractMediaPlayer::doSetTickInterval(qint32 interval)\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::doSetTickInterval, EAudioApi);\n    TRACE_ENTRY(\"state %d m_interval %d interval %d\", privateState(), tickInterval(), interval);\n\n    m_tickTimer->setInterval(interval);\n\n    TRACE_EXIT_0();\n}\n\nMediaSource MMF::AbstractMediaPlayer::source() const\n{\n    return m_source;\n}\n\nvoid MMF::AbstractMediaPlayer::setFileSource(const MediaSource &source, RFile& file)\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::setFileSource, EAudioApi);\n    TRACE_ENTRY(\"state %d source.type %d\", privateState(), source.type());\n\n    close();\n    changeState(GroundState);\n\n    \/\/ TODO: is it correct to assign even if the media type is not supported in\n    \/\/ the switch statement below?\n    m_source = source;\n\n    TInt symbianErr = KErrNone;\n\n    switch (m_source.type()) {\n    case MediaSource::LocalFile: {\n        symbianErr = openFile(file);\n        break;\n    }\n\n    case MediaSource::Url: {\n        const QUrl url(source.url());\n\n        if (url.scheme() == QLatin1String(\"file\")) {\n            symbianErr = openFile(file);\n        }\n        else {\n            TRACE_0(\"Source type not supported\");\n            \/\/ TODO: support network URLs\n            symbianErr = KErrNotSupported;\n        }\n\n        break;\n    }\n\n    case MediaSource::Invalid:\n    case MediaSource::Disc:\n    case MediaSource::Stream:\n        TRACE_0(\"Source type not supported\");\n        symbianErr = KErrNotSupported;\n        break;\n\n    case MediaSource::Empty:\n        TRACE_0(\"Empty source - doing nothing\");\n        TRACE_EXIT_0();\n        return;\n\n        \/\/ Protection against adding new media types and forgetting to update this switch\n    default:\n        TRACE_PANIC(InvalidMediaTypePanic);\n    }\n\n    if (KErrNone == symbianErr) {\n        changeState(LoadingState);\n    } else {\n        TRACE(\"error %d\", symbianErr)\n        setError(NormalError);\n    }\n\n    TRACE_EXIT_0();\n}\n\nvoid MMF::AbstractMediaPlayer::setNextSource(const MediaSource &source)\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::setNextSource, EAudioApi);\n    TRACE_ENTRY(\"state %d\", privateState());\n\n    \/\/ TODO: handle 'next source'\n\n    m_nextSource = source;\n    Q_UNUSED(source);\n\n    TRACE_EXIT_0();\n}\n\n\n\/\/-----------------------------------------------------------------------------\n\/\/ VolumeObserver\n\/\/-----------------------------------------------------------------------------\n\nvoid MMF::AbstractMediaPlayer::volumeChanged(qreal volume)\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::volumeChanged, EAudioInternal);\n    TRACE_ENTRY(\"state %d\", privateState());\n\n    AbstractPlayer::volumeChanged(volume);\n    doVolumeChanged();\n\n    TRACE_EXIT_0();\n}\n\n\nvoid MMF::AbstractMediaPlayer::doVolumeChanged()\n{\n    switch (privateState()) {\n    case GroundState:\n    case LoadingState:\n    case ErrorState:\n        \/\/ Do nothing\n        break;\n\n    case StoppedState:\n    case PausedState:\n    case PlayingState:\n    case BufferingState: {\n        const qreal volume = (m_volume * m_mmfMaxVolume) + 0.5;\n        const int err = setDeviceVolume(volume);\n\n        if (KErrNone != err) {\n            setError(NormalError);\n        }\n        break;\n    }\n\n    \/\/ Protection against adding new states and forgetting to update this\n    \/\/ switch\n    default:\n        Utils::panic(InvalidStatePanic);\n    }\n}\n\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Protected functions\n\/\/-----------------------------------------------------------------------------\n\nvoid MMF::AbstractMediaPlayer::startTickTimer()\n{\n    m_tickTimer->start(tickInterval());\n}\n\nvoid MMF::AbstractMediaPlayer::stopTickTimer()\n{\n    m_tickTimer->stop();\n}\n\nvoid MMF::AbstractMediaPlayer::maxVolumeChanged(int mmfMaxVolume)\n{\n    m_mmfMaxVolume = mmfMaxVolume;\n    doVolumeChanged();\n}\n\nqint64 MMF::AbstractMediaPlayer::toMilliSeconds(const TTimeIntervalMicroSeconds &in)\n{\n    return in.Int64() \/ 1000;\n}\n\n\/\/-----------------------------------------------------------------------------\n\/\/ Slots\n\/\/-----------------------------------------------------------------------------\n\nvoid MMF::AbstractMediaPlayer::tick()\n{\n    \/\/ For the MWC compiler, we need to qualify the base class.\n    emit MMF::AbstractPlayer::tick(currentTime());\n}\n\nvoid MMF::AbstractMediaPlayer::changeState(PrivateState newState)\n{\n    TRACE_CONTEXT(AbstractMediaPlayer::changeState, EAudioInternal);\n\n    const Phonon::State oldPhononState = phononState(privateState());\n    const Phonon::State newPhononState = phononState(newState);\n\n    \/\/ TODO: add some invariants to check that the transition is valid\n    AbstractPlayer::changeState(newState);\n\n    if (LoadingState == oldPhononState && StoppedState == newPhononState) {\n        \/\/ Ensure initial volume is set on MMF API before starting playback\n        doVolumeChanged();\n\n        \/\/ Check whether play() was called while clip was being loaded.  If so,\n        \/\/ playback should be started now\n        if (m_playPending) {\n            TRACE_0(\"play was called while loading; starting playback now\");\n            m_playPending = false;\n            play();\n        }\n    }\n\n}\n\nQT_END_NAMESPACE\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * REXIFunctions.hpp\n *\n *  Created on: 10 Aug 2017\n *      Author: Martin Schreiber <M.Schreiber@exeter.ac.uk>\n *\/\n\n#ifndef SRC_INCLUDE_REXI_REXIFUNCTIONS_HPP_\n#define SRC_INCLUDE_REXI_REXIFUNCTIONS_HPP_\n\n\/\/#include <complex.h>\n\/\/#include <complex>\n\/\/#include <cmath>\n#include <iostream>\n#include <typeinfo>\n#include <libmath\/DQStuff.hpp>\n\n\n\n\/**\n * This class implements various REXI functions.\n *\n * See Cox-Matthews paper for the provided REXI functions\n *\/\ntemplate <typename T>\nclass REXIFunctions\n{\npublic:\n\tint phi_id;\n\n\tT eps_phi;\n\tT eps_ups;\n\tT pi2;\n\n\tvoid setup_constvars()\n\t{\n#if SWEET_QUADMATH\n\t\tif (typeid(T) == typeid(__float128))\n\t\t{\n\t\t\teps_phi = 1e-10;\n\t\t\teps_ups= 1e-10;\n\n\t\t\tstatic char *sp;\n\n\t\t\tpi2 = (__float128)2.0*strtoflt128(\"3.1415926535897932384626433832795029\", &sp);\n\t\t}\n\t\telse\n#endif\n\t\tif (typeid(T) == typeid(double))\n\t\t{\n\t\t\teps_phi = 1e-10;\n\t\t\teps_ups= 1e-10;\n\t\t\tpi2 = (double)2.0*(double)M_PI;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tFatalError(\"Type not supported\");\n\t\t}\n\t}\n\n\n\npublic:\n\tREXIFunctions()\t:\n\t\tphi_id(0)\n\t{\n\t\tsetup_constvars();\n\t}\n\n\npublic:\n\tREXIFunctions(const std::string &i_function_name)\t:\n\t\tphi_id(0)\n\t{\n\t\tsetup_constvars();\n\t\tsetup(i_function_name);\n\t}\n\n\n\npublic:\n\tvoid setup(\n\t\t\tconst std::string &i_function_name\n\t)\n\t{\n\t\tif (i_function_name  == \"phi0\")\n\t\t\tphi_id = 0;\n\t\telse if (i_function_name  == \"phi1\")\n\t\t\tphi_id = 1;\n\t\telse if (i_function_name  == \"phi2\")\n\t\t\tphi_id = 2;\n\t\telse if (i_function_name  == \"phi3\")\n\t\t\tphi_id = 3;\n\t\telse if (i_function_name  == \"phi4\")\n\t\t\tphi_id = 4;\n\t\telse if (i_function_name  == \"phi5\")\n\t\t\tphi_id = 5;\n\n\t\telse if (i_function_name  == \"ups1\")\n\t\t\tphi_id = 101;\n\t\telse if (i_function_name  == \"ups2\")\n\t\t\tphi_id = 102;\n\t\telse if (i_function_name  == \"ups3\")\n\t\t\tphi_id = 103;\n\n\t\telse\n\t\t\tFatalError(\"This phi function is not supported!\");\n\n\t\tif (phi_id == 1 || phi_id == 2 || phi_id == 3 || phi_id == 101 || phi_id == 102 || phi_id == 103)\n\t\t{\n\t\t\tif (typeid(T) == typeid(double))\n\t\t\t{\n\t\t\t\tstd::cout << \"**************************************************************\" << std::endl;\n\t\t\t\tstd::cout << \"* WARNING: \" << i_function_name << \" typically requires __float128 precision!\" << std::endl;\n\t\t\t\tstd::cout << \"**************************************************************\" << std::endl;\n\t\t\t\tFatalError(\"Seriously, you shouldn't use me with only double precision!\");\n\t\t\t}\n\t\t}\n\t}\n\n\n#if SWEET_QUADMATH\n\t\/**************************************************************\n\t * __float128 TYPES\n\t **************************************************************\/\n\tstatic std::complex<__float128> l_expcplx(const std::complex<__float128> &i_value)\n\t{\n\t\t__complex128 z;\n\t\t__real__ z = i_value.real();\n\t\t__imag__ z = i_value.imag();\n\n\t\t__complex128 val = cexpq(z);\n\n\t\treturn std::complex<__float128>(crealq(val), cimagq(val));\n\t}\n\n\tinline\n\tstatic T l_sqrt(const __float128 &i_value)\n\t{\n\t\treturn sqrtq(i_value);\n\t}\n\n\tstatic const std::complex<__float128> l_sqrtcplx(const std::complex<__float128> &i_value)\n\t{\n\t\t__complex128 z;\n\t\t__real__ z = i_value.real();\n\t\t__imag__ z = i_value.imag();\n\n\t\t__complex128 val = csqrtq(z);\n\n\t\treturn std::complex<double>(crealq(val), cimagq(val));\n\t}\n#endif\n\n\n\t\/**************************************************************\n\t * double TYPES\n\t * Might suffer of numerical double precision limited effects\n\t **************************************************************\/\n\n\tstd::complex<double> l_expcplx(const std::complex<double> &i_value)\n\t{\n\t\treturn std::exp(i_value);\n\t};\n\n\tT l_sqrt(double &i_value)\n\t{\n\t\treturn std::sqrt(i_value);\n\t};\n\n\tstd::complex<double> l_sqrtcplx(const std::complex<double> &i_value)\n\t{\n\t\treturn std::sqrt(i_value);\n\t};\n\n\n\n\ttemplate <typename D>\n\tstatic\n\tstd::complex<D> convert(\n\t\t\tconst std::complex<T> &i_value\n\t)\n\t{\n\t\tstd::complex<D> data;\n\t\tdata.real(i_value.real());\n\t\tdata.imag(i_value.imag());\n\n\t\treturn data;\n\t}\n\n\tint factorial(int N)\n\t{\n\t\tint retval = 1;\n\n\t\tfor (; N > 0; N--)\n\t\t\tretval = retval * N;\n\n\t\treturn retval;\n\t}\n\n\tstd::complex<T> phi(\n\t\t\tint n,\n\t\t\tconst std::complex<T> &z\n\t)\n\t{\n\t\tif (n == 0)\n\t\t\treturn l_expcplx(z);\n\n        if (std::abs((double)z.real()) < eps_phi && std::abs((double)z.imag()) < eps_phi)\n\t\t\t\treturn (T)1.0\/(T)factorial(n);\n\n        return (phi(n-1, z) - (T)1.0\/(T)factorial(n-1))\/z;\n\t}\n\n\t\/**\n\t * Evaluate the function (phi\/ups)\n\t *\/\n\tstd::complex<T> eval(\n\t\tconst std::complex<T> &i_K\n\t)\n\t{\n\t\tstd::complex<T> K = i_K;\n\n\t\t\/\/ for tests of numerical instability\n\t\tT lamdt = K.imag();\n\t\tif (lamdt < 0)\n\t\t\tlamdt = -lamdt;\n\n\t\tswitch(phi_id)\n\t\t{\n#if 0\n\t\tcase 0:\t\/\/ \\phi_0\n\t\t\tK = l_expcplx(K);\n\t\t\tbreak;\n\n\n\t\tcase 1:\t\/\/ \\phi_1\n\t\t\t\/\/ http:\/\/www.wolframalpha.com\/input\/?i=(exp(i*x)-1)%2F(i*x)\n\t\t\tif (lamdt < eps_phi)\n\t\t\t{\n\t\t\t\tK = 1.0;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tK = (l_expcplx(K) - std::complex<T>(1.0))\/K;\n\t\t\t}\n\t\t\tbreak;\n\n\n\t\tcase 2:\t\/\/ \\phi_2\n\t\t\t\/\/ http:\/\/www.wolframalpha.com\/input\/?i=(exp(i*x)-1-i*x)%2F(i*x*i*x)\n\t\t\tif (lamdt*lamdt < eps_phi)\n\t\t\t{\n\t\t\t\tK = 1.0\/2.0;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tK = (l_expcplx(K) - std::complex<T>(1.0) - K)\/(K*K);\n\t\t\t}\n\t\t\tbreak;\n\n\n\t\tcase 3:\t\/\/ \\phi_3\n\t\t\tif (lamdt*lamdt*lamdt < eps_phi)\n\t\t\t{\n\t\t\t\tK = 1.0\/(2.0*3.0);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tK = (l_expcplx(K) - std::complex<T>(1.0) - K - K*K)\/(K*K*K);\n\t\t\t}\n\t\t\tbreak;\n#endif\n\n\t\tcase 101:\t\/\/ \\ups_1\n\t\t\t\/\/ http:\/\/www.wolframalpha.com\/input\/?i=(-4-K%2Bexp(K)*(4-3K%2BK*K))%2F(K*K*K)\n\t\t\tif (lamdt*lamdt*lamdt < eps_ups)\n\t\t\t{\n\t\t\t\tK = 1.0\/(2.0*3.0);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tK = (std::complex<T>(-4.0)-K+l_expcplx(K)*(std::complex<T>(4.0)-std::complex<T>(3.0)*K+K*K))\/(K*K*K);\n\t\t\t}\n\t\t\tbreak;\n\n\n\t\tcase 102:\t\/\/ \\ups_2\n\t\t\t\/\/ http:\/\/www.wolframalpha.com\/input\/?i=(2%2BK%2Bexp(K)*(-2%2BK))%2F(K*K*K)\n\t\t\tif (lamdt*lamdt*lamdt < eps_ups)\n\t\t\t{\n\t\t\t\tK = 1.0\/(2.0*3.0);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tK = (std::complex<T>(2.0)+K+l_expcplx(K)*(std::complex<T>(-2.0)+K))\/(K*K*K);\n\t\t\t}\n\t\t\tbreak;\n\n\n\t\tcase 103:\t\/\/ \\ups_3\n\t\t\t\/\/ http:\/\/www.wolframalpha.com\/input\/?i=(-4-3*K-K*K%2Bexp(K)*(4-K))%2F(K*K*K)\n\t\t\tif (lamdt*lamdt*lamdt < eps_ups)\n\t\t\t{\n\t\t\t\tK = 1.0\/(2.0*3.0);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tK = (std::complex<T>(-4.0)-std::complex<T>(3.0)*K-K*K+l_expcplx(K)*(std::complex<T>(4.0)-K))\/(K*K*K);\n\t\t\t}\n\t\t\tbreak;\n\n\n\t\tdefault:\n\t\t\treturn phi(phi_id, i_K);\n\t\t\t\/\/FatalError(\"This phi is not yet supported\");\n\t\t}\n\n\t\treturn K;\n\t}\n\n};\n\n\n\n#endif \/* SRC_INCLUDE_REXI_REXIFunctions_HPP_ *\/\n<commit_msg>removed fatal error for phi1\/2 utilization with double precision<commit_after>\/*\n * REXIFunctions.hpp\n *\n *  Created on: 10 Aug 2017\n *      Author: Martin Schreiber <M.Schreiber@exeter.ac.uk>\n *\/\n\n#ifndef SRC_INCLUDE_REXI_REXIFUNCTIONS_HPP_\n#define SRC_INCLUDE_REXI_REXIFUNCTIONS_HPP_\n\n\/\/#include <complex.h>\n\/\/#include <complex>\n\/\/#include <cmath>\n#include <iostream>\n#include <typeinfo>\n#include <libmath\/DQStuff.hpp>\n\n\n\n\/**\n * This class implements various REXI functions.\n *\n * See Cox-Matthews paper for the provided REXI functions\n *\/\ntemplate <typename T>\nclass REXIFunctions\n{\npublic:\n\tint phi_id;\n\n\tT eps_phi;\n\tT eps_ups;\n\tT pi2;\n\n\tvoid setup_constvars()\n\t{\n#if SWEET_QUADMATH\n\t\tif (typeid(T) == typeid(__float128))\n\t\t{\n\t\t\teps_phi = 1e-10;\n\t\t\teps_ups= 1e-10;\n\n\t\t\tstatic char *sp;\n\n\t\t\tpi2 = (__float128)2.0*strtoflt128(\"3.1415926535897932384626433832795029\", &sp);\n\t\t}\n\t\telse\n#endif\n\t\tif (typeid(T) == typeid(double))\n\t\t{\n\t\t\teps_phi = 1e-10;\n\t\t\teps_ups= 1e-10;\n\t\t\tpi2 = (double)2.0*(double)M_PI;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tFatalError(\"Type not supported\");\n\t\t}\n\t}\n\n\n\npublic:\n\tREXIFunctions()\t:\n\t\tphi_id(0)\n\t{\n\t\tsetup_constvars();\n\t}\n\n\npublic:\n\tREXIFunctions(const std::string &i_function_name)\t:\n\t\tphi_id(0)\n\t{\n\t\tsetup_constvars();\n\t\tsetup(i_function_name);\n\t}\n\n\n\npublic:\n\tvoid setup(\n\t\t\tconst std::string &i_function_name\n\t)\n\t{\n\t\tif (i_function_name  == \"phi0\")\n\t\t\tphi_id = 0;\n\t\telse if (i_function_name  == \"phi1\")\n\t\t\tphi_id = 1;\n\t\telse if (i_function_name  == \"phi2\")\n\t\t\tphi_id = 2;\n\t\telse if (i_function_name  == \"phi3\")\n\t\t\tphi_id = 3;\n\t\telse if (i_function_name  == \"phi4\")\n\t\t\tphi_id = 4;\n\t\telse if (i_function_name  == \"phi5\")\n\t\t\tphi_id = 5;\n\n\t\telse if (i_function_name  == \"ups1\")\n\t\t\tphi_id = 101;\n\t\telse if (i_function_name  == \"ups2\")\n\t\t\tphi_id = 102;\n\t\telse if (i_function_name  == \"ups3\")\n\t\t\tphi_id = 103;\n\n\t\telse\n\t\t\tFatalError(\"This phi function is not supported!\");\n\n\t\tif (phi_id == 1 || phi_id == 2 || phi_id == 3 || phi_id == 101 || phi_id == 102 || phi_id == 103)\n\t\t{\n\t\t\tif (typeid(T) == typeid(double))\n\t\t\t{\n\t\t\t\tstd::cout << \"**************************************************************\" << std::endl;\n\t\t\t\tstd::cout << \"* WARNING: \" << i_function_name << \" typically requires __float128 precision!\" << std::endl;\n\t\t\t\tstd::cout << \"**************************************************************\" << std::endl;\n\/\/\t\t\t\tFatalError(\"Seriously, you shouldn't use me with only double precision!\");\n\t\t\t}\n\t\t}\n\t}\n\n\n#if SWEET_QUADMATH\n\t\/**************************************************************\n\t * __float128 TYPES\n\t **************************************************************\/\n\tstatic std::complex<__float128> l_expcplx(const std::complex<__float128> &i_value)\n\t{\n\t\t__complex128 z;\n\t\t__real__ z = i_value.real();\n\t\t__imag__ z = i_value.imag();\n\n\t\t__complex128 val = cexpq(z);\n\n\t\treturn std::complex<__float128>(crealq(val), cimagq(val));\n\t}\n\n\tinline\n\tstatic T l_sqrt(const __float128 &i_value)\n\t{\n\t\treturn sqrtq(i_value);\n\t}\n\n\tstatic const std::complex<__float128> l_sqrtcplx(const std::complex<__float128> &i_value)\n\t{\n\t\t__complex128 z;\n\t\t__real__ z = i_value.real();\n\t\t__imag__ z = i_value.imag();\n\n\t\t__complex128 val = csqrtq(z);\n\n\t\treturn std::complex<double>(crealq(val), cimagq(val));\n\t}\n#endif\n\n\n\t\/**************************************************************\n\t * double TYPES\n\t * Might suffer of numerical double precision limited effects\n\t **************************************************************\/\n\n\tstd::complex<double> l_expcplx(const std::complex<double> &i_value)\n\t{\n\t\treturn std::exp(i_value);\n\t};\n\n\tT l_sqrt(double &i_value)\n\t{\n\t\treturn std::sqrt(i_value);\n\t};\n\n\tstd::complex<double> l_sqrtcplx(const std::complex<double> &i_value)\n\t{\n\t\treturn std::sqrt(i_value);\n\t};\n\n\n\n\ttemplate <typename D>\n\tstatic\n\tstd::complex<D> convert(\n\t\t\tconst std::complex<T> &i_value\n\t)\n\t{\n\t\tstd::complex<D> data;\n\t\tdata.real(i_value.real());\n\t\tdata.imag(i_value.imag());\n\n\t\treturn data;\n\t}\n\n\tint factorial(int N)\n\t{\n\t\tint retval = 1;\n\n\t\tfor (; N > 0; N--)\n\t\t\tretval = retval * N;\n\n\t\treturn retval;\n\t}\n\n\tstd::complex<T> phi(\n\t\t\tint n,\n\t\t\tconst std::complex<T> &z\n\t)\n\t{\n\t\tif (n == 0)\n\t\t\treturn l_expcplx(z);\n\n        if (std::abs((double)z.real()) < eps_phi && std::abs((double)z.imag()) < eps_phi)\n\t\t\t\treturn (T)1.0\/(T)factorial(n);\n\n        return (phi(n-1, z) - (T)1.0\/(T)factorial(n-1))\/z;\n\t}\n\n\t\/**\n\t * Evaluate the function (phi\/ups)\n\t *\/\n\tstd::complex<T> eval(\n\t\tconst std::complex<T> &i_K\n\t)\n\t{\n\t\tstd::complex<T> K = i_K;\n\n\t\t\/\/ for tests of numerical instability\n\t\tT lamdt = K.imag();\n\t\tif (lamdt < 0)\n\t\t\tlamdt = -lamdt;\n\n\t\tswitch(phi_id)\n\t\t{\n#if 0\n\t\tcase 0:\t\/\/ \\phi_0\n\t\t\tK = l_expcplx(K);\n\t\t\tbreak;\n\n\n\t\tcase 1:\t\/\/ \\phi_1\n\t\t\t\/\/ http:\/\/www.wolframalpha.com\/input\/?i=(exp(i*x)-1)%2F(i*x)\n\t\t\tif (lamdt < eps_phi)\n\t\t\t{\n\t\t\t\tK = 1.0;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tK = (l_expcplx(K) - std::complex<T>(1.0))\/K;\n\t\t\t}\n\t\t\tbreak;\n\n\n\t\tcase 2:\t\/\/ \\phi_2\n\t\t\t\/\/ http:\/\/www.wolframalpha.com\/input\/?i=(exp(i*x)-1-i*x)%2F(i*x*i*x)\n\t\t\tif (lamdt*lamdt < eps_phi)\n\t\t\t{\n\t\t\t\tK = 1.0\/2.0;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tK = (l_expcplx(K) - std::complex<T>(1.0) - K)\/(K*K);\n\t\t\t}\n\t\t\tbreak;\n\n\n\t\tcase 3:\t\/\/ \\phi_3\n\t\t\tif (lamdt*lamdt*lamdt < eps_phi)\n\t\t\t{\n\t\t\t\tK = 1.0\/(2.0*3.0);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tK = (l_expcplx(K) - std::complex<T>(1.0) - K - K*K)\/(K*K*K);\n\t\t\t}\n\t\t\tbreak;\n#endif\n\n\t\tcase 101:\t\/\/ \\ups_1\n\t\t\t\/\/ http:\/\/www.wolframalpha.com\/input\/?i=(-4-K%2Bexp(K)*(4-3K%2BK*K))%2F(K*K*K)\n\t\t\tif (lamdt*lamdt*lamdt < eps_ups)\n\t\t\t{\n\t\t\t\tK = 1.0\/(2.0*3.0);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tK = (std::complex<T>(-4.0)-K+l_expcplx(K)*(std::complex<T>(4.0)-std::complex<T>(3.0)*K+K*K))\/(K*K*K);\n\t\t\t}\n\t\t\tbreak;\n\n\n\t\tcase 102:\t\/\/ \\ups_2\n\t\t\t\/\/ http:\/\/www.wolframalpha.com\/input\/?i=(2%2BK%2Bexp(K)*(-2%2BK))%2F(K*K*K)\n\t\t\tif (lamdt*lamdt*lamdt < eps_ups)\n\t\t\t{\n\t\t\t\tK = 1.0\/(2.0*3.0);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tK = (std::complex<T>(2.0)+K+l_expcplx(K)*(std::complex<T>(-2.0)+K))\/(K*K*K);\n\t\t\t}\n\t\t\tbreak;\n\n\n\t\tcase 103:\t\/\/ \\ups_3\n\t\t\t\/\/ http:\/\/www.wolframalpha.com\/input\/?i=(-4-3*K-K*K%2Bexp(K)*(4-K))%2F(K*K*K)\n\t\t\tif (lamdt*lamdt*lamdt < eps_ups)\n\t\t\t{\n\t\t\t\tK = 1.0\/(2.0*3.0);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tK = (std::complex<T>(-4.0)-std::complex<T>(3.0)*K-K*K+l_expcplx(K)*(std::complex<T>(4.0)-K))\/(K*K*K);\n\t\t\t}\n\t\t\tbreak;\n\n\n\t\tdefault:\n\t\t\treturn phi(phi_id, i_K);\n\t\t\t\/\/FatalError(\"This phi is not yet supported\");\n\t\t}\n\n\t\treturn K;\n\t}\n\n};\n\n\n\n#endif \/* SRC_INCLUDE_REXI_REXIFunctions_HPP_ *\/\n<|endoftext|>"}
{"text":"<commit_before>\/**********************************************************************\nCopyright (c)2016 Advanced Micro Devices, Inc. All rights reserved.\n\nRedistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:\n\n?\tRedistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.\n?\tRedistributions 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\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\n WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY\n DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 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 POSSIBILITY OF SUCH DAMAGE.\n********************************************************************\/\n\/\/ to share code with between CPU and GPU\n\n#define MLOPEN\n#include <mlopen\/mlo_internal.hpp>\n#include <mlopen\/mlo_utils.hpp>\n\nint mlo_construct_neuron::mloConstruct()\n{\n\tint ret = 0;\n\n\n\tif (getDirection())\n\t{\n\n\t\tret = mloConstructFwd();\n\t}\n\telse\n\t{\n\t\tret = mloConstructBwd();\n\t}\n\treturn(ret);\n} \n\nint mlo_construct_neuron::mloConstructFwd()\n{\n\tint ret = 0;\n\tint data_len = (!_in_data_type.compare(\"FP32\") ? 4 : 8);\n\n\tsize_t size = (_bot_sz \/ data_len);\n\tif (((size \/ 4) * 4) != size)\n\t{\n\t\tprintf(\"Error: buffer size is not multipel of 4.\\n\");\n\t\/\/\tret = -1;\n\t\/\/\treturn(ret);\n\t}\n\n\tsize_t glbl_wk = size \/ 4;\n\n\t_grp_tile0 = 256;\n\t_grp_tile1 = 1;\n\n\t_comp_options =\n\t\tstd::string(\" -D MLO_NRN_GROUP_SZ0=\") + std::to_string(static_cast<long long>(_grp_tile0))\n\t\t+ std::string(\" -D MLO_NRN_GROUP_SZ1=\") + std::to_string(static_cast<long long>(_grp_tile1))\n\t\t+ std::string(\" -D MLO_NRN_OP_ID=\") + std::to_string(static_cast<long long>(_neuron_type))\n\t\t+ getGeneralCompOptions()\n\t\t;\n\n\t_l_wk.clear();\n\t_l_wk.push_back(_grp_tile0);\n\t_l_wk.push_back(_grp_tile1);\n\t_l_wk.push_back(1);\n\n\t_g_wk.clear();\n\t_g_wk.push_back(glbl_wk);\n\t_g_wk.push_back(1);\n\t_g_wk.push_back(1);\n\n\n\t_kernel_file = \"MLOpenNeuron.cl\";\n\t_kernel_name = \"MLOpenNeuron4\";\n\n\treturn(ret);\n}\n\n\nint mlo_construct_neuron::mloConstructBwd()\n{\n\tint ret = 0;\n\tint data_len = (!_in_data_type.compare(\"FP32\") ? 4 : 8);\n\n\tsize_t size = (_bot_sz \/ data_len);\n\tif (((size \/ 4) * 4) != size)\n\t{\n\t\tprintf(\"Error: buffer size is not multipel of 4.\\n\");\n\t\/\/\tret = -1;\n\t\/\/\treturn(ret);\n\t}\n\n\tsize_t glbl_wk = size \/ 4;\n\n\t_grp_tile0 = 256;\n\t_grp_tile1 = 1;\n\n\t_comp_options =\n\t\tstd::string(\" -D MLO_NRN_GROUP_SZ0=\") + std::to_string(static_cast<long long>(_grp_tile0))\n\t\t+ std::string(\" -D MLO_NRN_GROUP_SZ1=\") + std::to_string(static_cast<long long>(_grp_tile1))\n\t\t+ std::string(\" -D MLO_NRN_OP_ID=\") + std::to_string(static_cast<long long>(_neuron_type))\n\t\t+ getGeneralCompOptions()\n\t\t;\n\n\t_l_wk.clear();\n\t_l_wk.push_back(_grp_tile0);\n\t_l_wk.push_back(_grp_tile1);\n\t_l_wk.push_back(1);\n\n\t_g_wk.clear();\n\t_g_wk.push_back(glbl_wk);\n\t_g_wk.push_back(1);\n\t_g_wk.push_back(1);\n\t_kernel_file = \"MLOpenNeuron.cl\";\n\t_kernel_name = \"MLOpenNeuron4_Bwd\";\n\n\treturn(ret);\n}\n<commit_msg>Remove extra spaces<commit_after>\/**********************************************************************\nCopyright (c)2016 Advanced Micro Devices, Inc. All rights reserved.\n\nRedistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:\n\n?\tRedistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.\n?\tRedistributions 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\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\n WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY\n DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 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 POSSIBILITY OF SUCH DAMAGE.\n********************************************************************\/\n\/\/ to share code with between CPU and GPU\n\n#define MLOPEN\n#include <mlopen\/mlo_internal.hpp>\n#include <mlopen\/mlo_utils.hpp>\n\nint mlo_construct_neuron::mloConstruct()\n{\n\tint ret = 0;\n\n\n\tif (getDirection())\n\t{\n\n\t\tret = mloConstructFwd();\n\t}\n\telse\n\t{\n\t\tret = mloConstructBwd();\n\t}\n\treturn(ret);\n} \n\nint mlo_construct_neuron::mloConstructFwd()\n{\n\tint ret = 0;\n\tint data_len = (!_in_data_type.compare(\"FP32\") ? 4 : 8);\n\n\tsize_t size = (_bot_sz \/ data_len);\n\tif (((size \/ 4) * 4) != size)\n\t{\n\t\tprintf(\"Error: buffer size is not multipel of 4.\\n\");\n\t\/\/\tret = -1;\n\t\/\/\treturn(ret);\n\t}\n\n\tsize_t glbl_wk = size \/ 4;\n\n\t_grp_tile0 = 256;\n\t_grp_tile1 = 1;\n\n\t_comp_options =\n\t\tstd::string(\" -DMLO_NRN_GROUP_SZ0=\") + std::to_string(static_cast<long long>(_grp_tile0))\n\t\t+ std::string(\" -DMLO_NRN_GROUP_SZ1=\") + std::to_string(static_cast<long long>(_grp_tile1))\n\t\t+ std::string(\" -DMLO_NRN_OP_ID=\") + std::to_string(static_cast<long long>(_neuron_type))\n\t\t+ getGeneralCompOptions()\n\t\t;\n\n\t_l_wk.clear();\n\t_l_wk.push_back(_grp_tile0);\n\t_l_wk.push_back(_grp_tile1);\n\t_l_wk.push_back(1);\n\n\t_g_wk.clear();\n\t_g_wk.push_back(glbl_wk);\n\t_g_wk.push_back(1);\n\t_g_wk.push_back(1);\n\n\n\t_kernel_file = \"MLOpenNeuron.cl\";\n\t_kernel_name = \"MLOpenNeuron4\";\n\n\treturn(ret);\n}\n\n\nint mlo_construct_neuron::mloConstructBwd()\n{\n\tint ret = 0;\n\tint data_len = (!_in_data_type.compare(\"FP32\") ? 4 : 8);\n\n\tsize_t size = (_bot_sz \/ data_len);\n\tif (((size \/ 4) * 4) != size)\n\t{\n\t\tprintf(\"Error: buffer size is not multipel of 4.\\n\");\n\t\/\/\tret = -1;\n\t\/\/\treturn(ret);\n\t}\n\n\tsize_t glbl_wk = size \/ 4;\n\n\t_grp_tile0 = 256;\n\t_grp_tile1 = 1;\n\n\t_comp_options =\n\t\tstd::string(\" -DMLO_NRN_GROUP_SZ0=\") + std::to_string(static_cast<long long>(_grp_tile0))\n\t\t+ std::string(\" -DMLO_NRN_GROUP_SZ1=\") + std::to_string(static_cast<long long>(_grp_tile1))\n\t\t+ std::string(\" -DMLO_NRN_OP_ID=\") + std::to_string(static_cast<long long>(_neuron_type))\n\t\t+ getGeneralCompOptions()\n\t\t;\n\n\t_l_wk.clear();\n\t_l_wk.push_back(_grp_tile0);\n\t_l_wk.push_back(_grp_tile1);\n\t_l_wk.push_back(1);\n\n\t_g_wk.clear();\n\t_g_wk.push_back(glbl_wk);\n\t_g_wk.push_back(1);\n\t_g_wk.push_back(1);\n\t_kernel_file = \"MLOpenNeuron.cl\";\n\t_kernel_name = \"MLOpenNeuron4_Bwd\";\n\n\treturn(ret);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n *\n *   Copyright (c) 2012-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#include <string.h>\n#include \"modules\/uORB\/uORBManager.hpp\"\n#include \"uORBKraitFastRpcChannel.hpp\"\n\nextern \"C\" { __EXPORT int muorb_main(int argc, char *argv[]); }\n\nstatic void usage()\n{\n\twarnx(\"Usage: muorb 'start', 'stop', 'status'\");\n}\n\n\nint\nmuorb_main(int argc, char *argv[])\n{\n\tif (argc < 2) {\n\t\tusage();\n\t\treturn -EINVAL;\n\t}\n\n\t\/*\n\t * Start\/load the driver.\n\t *\n\t * XXX it would be nice to have a wrapper for this...\n\t *\/\n\tif (!strcmp(argv[1], \"start\")) {\n\t\tif (uORB::KraitFastRpcChannel::isInstance()) {\n\t\t\tPX4_WARN(\"muorb already running\");\n\t\t} else {\n\t\t\t\/\/ register the fast rpc channel with UORB.\n\t\t\tuORB::Manager::get_instance()->set_uorb_communicator(uORB::KraitFastRpcChannel::GetInstance());\n\n\t\t\t\/\/ start the KaitFastRPC channel thread.\n\t\t\tuORB::KraitFastRpcChannel::GetInstance()->Start();\n\t\t}\n\t\treturn OK;\n\n\t}\n\n\tif (!strcmp(argv[1], \"stop\")) {\n\n\t\tif (uORB::KraitFastRpcChannel::isInstance()) {\n\t\t\tuORB::KraitFastRpcChannel::GetInstance()->Stop();\n\t\t} else {\n\t\t\tPX4_WARN(\"muorb not running\");\n\t\t}\n\t\treturn OK;\n\t}\n\n\t\/*\n\t * Print driver information.\n\t *\/\n\tif (!strcmp(argv[1], \"status\")) {\n\t\tif (uORB::KraitFastRpcChannel::isInstance()) {\n\t\t\tPX4_WARN(\"muorb running\");\n\t\t} else {\n\t\t\tPX4_WARN(\"muorb not running\");\n\t\t}\n\t\treturn OK;\n\t}\n\n\tusage();\n\treturn -EINVAL;\n}\n<commit_msg>muorb: astyle<commit_after>\/****************************************************************************\n *\n *   Copyright (c) 2012-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#include <string.h>\n#include \"modules\/uORB\/uORBManager.hpp\"\n#include \"uORBKraitFastRpcChannel.hpp\"\n\nextern \"C\" { __EXPORT int muorb_main(int argc, char *argv[]); }\n\nstatic void usage()\n{\n\twarnx(\"Usage: muorb 'start', 'stop', 'status'\");\n}\n\n\nint\nmuorb_main(int argc, char *argv[])\n{\n\tif (argc < 2) {\n\t\tusage();\n\t\treturn -EINVAL;\n\t}\n\n\t\/*\n\t * Start\/load the driver.\n\t *\n\t * XXX it would be nice to have a wrapper for this...\n\t *\/\n\tif (!strcmp(argv[1], \"start\")) {\n\t\tif (uORB::KraitFastRpcChannel::isInstance()) {\n\t\t\tPX4_WARN(\"muorb already running\");\n\n\t\t} else {\n\t\t\t\/\/ register the fast rpc channel with UORB.\n\t\t\tuORB::Manager::get_instance()->set_uorb_communicator(uORB::KraitFastRpcChannel::GetInstance());\n\n\t\t\t\/\/ start the KaitFastRPC channel thread.\n\t\t\tuORB::KraitFastRpcChannel::GetInstance()->Start();\n\t\t}\n\n\t\treturn OK;\n\n\t}\n\n\tif (!strcmp(argv[1], \"stop\")) {\n\n\t\tif (uORB::KraitFastRpcChannel::isInstance()) {\n\t\t\tuORB::KraitFastRpcChannel::GetInstance()->Stop();\n\n\t\t} else {\n\t\t\tPX4_WARN(\"muorb not running\");\n\t\t}\n\n\t\treturn OK;\n\t}\n\n\t\/*\n\t * Print driver information.\n\t *\/\n\tif (!strcmp(argv[1], \"status\")) {\n\t\tif (uORB::KraitFastRpcChannel::isInstance()) {\n\t\t\tPX4_WARN(\"muorb running\");\n\n\t\t} else {\n\t\t\tPX4_WARN(\"muorb not running\");\n\t\t}\n\n\t\treturn OK;\n\t}\n\n\tusage();\n\treturn -EINVAL;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"DropDownSelector.hpp\"\n\n\n#include \"..\/App.hpp\"\n\n#include \"Button.hpp\"\n#include \"TextWidget.hpp\"\n\n#include \"containers\/OverlayContainer.hpp\"\n\n#include \"labels\/TextLabel.hpp\"\n#include \"MouseProxy.hpp\"\n#include \"labels\/ColorLabel.hpp\"\n\nusing namespace morda;\n\n\n\nnamespace{\n\nconst char* DLayout = R\"qwertyuiop(\n\t\tFrameContainer{\n\t\t\tname{morda_dropdown_selection}\n\t\t\tlayout{\n\t\t\t\tdimX{0} dimY{min}\n\t\t\t\tweight{1}\n\t\t\t}\n\t\t}\n\t\tPushButton{\n\t\t\tname{morda_dropdown_button}\n\t\t\tTextLabel{\n\t\t\t\ttext{\\\/}\n\t\t\t}\n\t\t}\n\t)qwertyuiop\";\n\nconst char* DDropDownItemLayout = R\"qwertyuiop(\n\t\tFrameContainer{\n\t\t\tMouseProxy{\n\t\t\t\tname{morda_dropdown_mouseproxy}\n\t\t\t\tlayout{\n\t\t\t\t\tdimX{max} dimY{max}\n\t\t\t\t}\n\t\t\t}\n\t\t\tColorLabel{\n\t\t\t\tname{morda_dropdown_color}\n\t\t\t\tlayout{\n\t\t\t\t\tdimX{max} dimY{max}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t)qwertyuiop\";\n\n\nclass StaticProvider : public DropDownSelector::ItemsProvider{\n\tstd::vector<std::unique_ptr<stob::Node>> widgets;\npublic:\n\n\tsize_t count() const noexcept override{\n\t\treturn this->widgets.size();\n\t}\n\t\n\tstd::shared_ptr<Widget> getWidget(size_t index, bool isSelection)override{\n\t\tauto w = morda::App::inst().inflater.inflate(*(this->widgets[index]));\n\t\t\n\t\tif(isSelection){\n\t\t\treturn w;\n\t\t}\n\t\t\n\t\tauto wd = std::dynamic_pointer_cast<FrameContainer>(morda::App::inst().inflater.inflate(*stob::parse(DDropDownItemLayout)));\n\t\tASSERT(wd)\n\t\t\n\t\tauto mp = wd->findChildByNameAs<MouseProxy>(\"morda_dropdown_mouseproxy\");\n\t\tASSERT(mp)\n\t\t\n\t\tauto cl = wd->findChildByNameAs<ColorLabel>(\"morda_dropdown_color\");\n\t\tASSERT(cl)\n\t\tauto clWeak = utki::makeWeak(cl);\n\t\t\n\t\twd->add(w);\n\t\t\n\t\tmp->hoverChanged = [clWeak](Widget& w, unsigned id){\n\t\t\tif(auto c = clWeak.lock()){\n\t\t\t\tif(w.isHovered()){\n\t\t\t\t\tc->setColor(0xff800000);\n\t\t\t\t}else{\n\t\t\t\t\tc->setColor(0xff404040);\n\t\t\t\t}\n\t\t\t}\n\t\t};\n\t\tmp->hoverChanged(*mp, 0);\n\t\t\n\t\tmp->mouseButton = [this, index](Widget& w, bool isDown, const Vec2r pos, Widget::EMouseButton button, unsigned id) -> bool{\n\t\t\tif(!isDown){\n\t\t\t\tif(this->dropDownSelector()){\n\t\t\t\t\tthis->dropDownSelector()->setSelection(index);\n\t\t\t\t\tauto oc = this->dropDownSelector()->findAncestor<OverlayContainer>();\n\t\t\t\t\tif(!oc){\n\t\t\t\t\t\tthrow Exc(\"No OverlayContainer found in ancestors of DropDownSelector\");\n\t\t\t\t\t}\n\t\t\t\t\tmorda::App::inst().postToUiThread_ts([oc](){\n\t\t\t\t\t\toc->hideContextMenu();\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\treturn true;\n\t\t};\n\t\t\n\t\treturn wd;\n\t}\n\t\n\n\tvoid recycle(size_t index, std::shared_ptr<Widget> w)override{\n\/\/\t\tTRACE(<< \"StaticProvider::recycle(): index = \" << index << std::endl)\n\t}\n\n\t\n\tvoid add(std::unique_ptr<stob::Node> w){\n\t\tthis->widgets.push_back(std::move(w));\n\t}\n};\n\n}\n\n\nDropDownSelector::DropDownSelector(const stob::Node* chain) :\n\t\tWidget(chain),\n\t\tHorizontalContainer(stob::parse(DLayout).get())\n{\n\tthis->selectionContainer = this->findChildByNameAs<FrameContainer>(\"morda_dropdown_selection\");\n\tASSERT(this->selectionContainer)\n\t\n\tauto b = this->findChildByNameAs<PushButton>(\"morda_dropdown_button\");\n\tb->clicked = [this](PushButton& b){\n\t\tif(!this->provider){\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tauto p = this->findAncestor<OverlayContainer>();\n\t\tif(!p){\n\t\t\tthrow Exc(\"DropDownSelector: no OverlayContainer parent found\");\n\t\t}\n\t\t\n\t\tauto w = utki::makeShared<VerticalContainer>();\n\t\t\n\t\tfor(size_t i = 0; i != this->provider->count(); ++i){\n\t\t\tw->add(this->provider->getWidget(i, false));\n\t\t}\n\t\t\n\t\tp->showContextMenu(w, this->calcPosInParent(Vec2r(0), p));\n\t};\n\t\n\t\n\tif(!chain){\n\t\treturn;\n\t}\n\t\n\tconst stob::Node* n = chain->thisOrNextNonProperty().node();\n\t\n\tif(!n){\n\t\treturn;\n\t}\n\t\n\tstd::shared_ptr<StaticProvider> p = utki::makeShared<StaticProvider>();\n\t\n\tfor(; n; n = n->nextNonProperty().node()){\n\t\tp->add(n->clone());\n\t}\n\t\n\tthis->setItemsProvider(std::move(p));\n}\n\nvoid DropDownSelector::setItemsProvider(std::shared_ptr<ItemsProvider> provider){\n\tif(provider && provider->dd){\n\t\tthrow Exc(\"given provider is already set to some DropDownSelector\");\n\t}\n\t\n\tif(this->provider){\n\t\tthis->provider->dd = nullptr;\n\t}\n\tthis->provider = std::move(provider);\n\tif(this->provider){\n\t\tthis->provider->dd = this;\n\t}\n\tthis->handleDataSetChanged();\n}\n\nvoid DropDownSelector::ItemsProvider::notifyDataSetChanged(){\n\tif(this->dd){\n\t\tthis->dd->handleDataSetChanged();\n\t}\n}\n\nvoid DropDownSelector::handleDataSetChanged(){\n\tthis->selectionContainer->removeAll();\n\t\n\tif(!this->provider){\n\t\treturn;\n\t}\n\tif(this->selectedItem >= this->provider->count()){\n\t\treturn;\n\t}\n\t\n\tthis->selectionContainer->add(this->provider->getWidget(this->selectedItem, true));\n}\n\nvoid DropDownSelector::setSelection(size_t i){\n\tthis->selectedItem = i;\n\t\n\tthis->handleDataSetChanged();\n}\n<commit_msg>stuff<commit_after>#include \"DropDownSelector.hpp\"\n\n\n#include \"..\/App.hpp\"\n\n#include \"Button.hpp\"\n#include \"TextWidget.hpp\"\n\n#include \"containers\/OverlayContainer.hpp\"\n\n#include \"labels\/TextLabel.hpp\"\n#include \"MouseProxy.hpp\"\n#include \"labels\/ColorLabel.hpp\"\n\nusing namespace morda;\n\n\n\nnamespace{\n\nconst char* DLayout = R\"qwertyuiop(\n\t\tFrameContainer{\n\t\t\tname{morda_dropdown_selection}\n\t\t\tlayout{\n\t\t\t\tdimX{0} dimY{min}\n\t\t\t\tweight{1}\n\t\t\t}\n\t\t}\n\t\tPushButton{\n\t\t\tname{morda_dropdown_button}\n\t\t\tTextLabel{\n\t\t\t\ttext{\\\/}\n\t\t\t}\n\t\t}\n\t)qwertyuiop\";\n\nconst char* DDropDownItemLayout = R\"qwertyuiop(\n\t\tFrameContainer{\n\t\t\tlayout{\n\t\t\t\tdimX{max}\n\t\t\t}\n\t\t\tMouseProxy{\n\t\t\t\tname{morda_dropdown_mouseproxy}\n\t\t\t\tlayout{\n\t\t\t\t\tdimX{max} dimY{max}\n\t\t\t\t}\n\t\t\t}\n\t\t\tColorLabel{\n\t\t\t\tname{morda_dropdown_color}\n\t\t\t\tlayout{\n\t\t\t\t\tdimX{max} dimY{max}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t)qwertyuiop\";\n\n\nclass StaticProvider : public DropDownSelector::ItemsProvider{\n\tstd::vector<std::unique_ptr<stob::Node>> widgets;\npublic:\n\n\tsize_t count() const noexcept override{\n\t\treturn this->widgets.size();\n\t}\n\t\n\tstd::shared_ptr<Widget> getWidget(size_t index, bool isSelection)override{\n\t\tauto w = morda::App::inst().inflater.inflate(*(this->widgets[index]));\n\t\t\n\t\tif(isSelection){\n\t\t\treturn w;\n\t\t}\n\t\t\n\t\tauto wd = std::dynamic_pointer_cast<FrameContainer>(morda::App::inst().inflater.inflate(*stob::parse(DDropDownItemLayout)));\n\t\tASSERT(wd)\n\t\t\n\t\tauto mp = wd->findChildByNameAs<MouseProxy>(\"morda_dropdown_mouseproxy\");\n\t\tASSERT(mp)\n\t\t\n\t\tauto cl = wd->findChildByNameAs<ColorLabel>(\"morda_dropdown_color\");\n\t\tASSERT(cl)\n\t\tauto clWeak = utki::makeWeak(cl);\n\t\t\n\t\twd->add(w);\n\t\t\n\t\tmp->hoverChanged = [clWeak](Widget& w, unsigned id){\n\t\t\tif(auto c = clWeak.lock()){\n\t\t\t\tif(w.isHovered()){\n\t\t\t\t\tc->setColor(0xff800000);\n\t\t\t\t}else{\n\t\t\t\t\tc->setColor(0xff404040);\n\t\t\t\t}\n\t\t\t}\n\t\t};\n\t\tmp->hoverChanged(*mp, 0);\n\t\t\n\t\tmp->mouseButton = [this, index](Widget& w, bool isDown, const Vec2r pos, Widget::EMouseButton button, unsigned id) -> bool{\n\t\t\tif(!isDown){\n\t\t\t\tif(this->dropDownSelector()){\n\t\t\t\t\tthis->dropDownSelector()->setSelection(index);\n\t\t\t\t\tauto oc = this->dropDownSelector()->findAncestor<OverlayContainer>();\n\t\t\t\t\tif(!oc){\n\t\t\t\t\t\tthrow Exc(\"No OverlayContainer found in ancestors of DropDownSelector\");\n\t\t\t\t\t}\n\t\t\t\t\tmorda::App::inst().postToUiThread_ts([oc](){\n\t\t\t\t\t\toc->hideContextMenu();\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\treturn true;\n\t\t};\n\t\t\n\t\treturn wd;\n\t}\n\t\n\n\tvoid recycle(size_t index, std::shared_ptr<Widget> w)override{\n\/\/\t\tTRACE(<< \"StaticProvider::recycle(): index = \" << index << std::endl)\n\t}\n\n\t\n\tvoid add(std::unique_ptr<stob::Node> w){\n\t\tthis->widgets.push_back(std::move(w));\n\t}\n};\n\n}\n\n\nDropDownSelector::DropDownSelector(const stob::Node* chain) :\n\t\tWidget(chain),\n\t\tHorizontalContainer(stob::parse(DLayout).get())\n{\n\tthis->selectionContainer = this->findChildByNameAs<FrameContainer>(\"morda_dropdown_selection\");\n\tASSERT(this->selectionContainer)\n\t\n\tauto b = this->findChildByNameAs<PushButton>(\"morda_dropdown_button\");\n\tb->clicked = [this](PushButton& b){\n\t\tif(!this->provider){\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tauto p = this->findAncestor<OverlayContainer>();\n\t\tif(!p){\n\t\t\tthrow Exc(\"DropDownSelector: no OverlayContainer parent found\");\n\t\t}\n\t\t\n\t\tauto w = utki::makeShared<VerticalContainer>();\n\t\t\n\t\tfor(size_t i = 0; i != this->provider->count(); ++i){\n\t\t\tw->add(this->provider->getWidget(i, false));\n\t\t}\n\t\t\n\t\tp->showContextMenu(w, this->calcPosInParent(Vec2r(0), p));\n\t};\n\t\n\t\n\tif(!chain){\n\t\treturn;\n\t}\n\t\n\tconst stob::Node* n = chain->thisOrNextNonProperty().node();\n\t\n\tif(!n){\n\t\treturn;\n\t}\n\t\n\tstd::shared_ptr<StaticProvider> p = utki::makeShared<StaticProvider>();\n\t\n\tfor(; n; n = n->nextNonProperty().node()){\n\t\tp->add(n->clone());\n\t}\n\t\n\tthis->setItemsProvider(std::move(p));\n}\n\nvoid DropDownSelector::setItemsProvider(std::shared_ptr<ItemsProvider> provider){\n\tif(provider && provider->dd){\n\t\tthrow Exc(\"given provider is already set to some DropDownSelector\");\n\t}\n\t\n\tif(this->provider){\n\t\tthis->provider->dd = nullptr;\n\t}\n\tthis->provider = std::move(provider);\n\tif(this->provider){\n\t\tthis->provider->dd = this;\n\t}\n\tthis->handleDataSetChanged();\n}\n\nvoid DropDownSelector::ItemsProvider::notifyDataSetChanged(){\n\tif(this->dd){\n\t\tthis->dd->handleDataSetChanged();\n\t}\n}\n\nvoid DropDownSelector::handleDataSetChanged(){\n\tthis->selectionContainer->removeAll();\n\t\n\tif(!this->provider){\n\t\treturn;\n\t}\n\tif(this->selectedItem >= this->provider->count()){\n\t\treturn;\n\t}\n\t\n\tthis->selectionContainer->add(this->provider->getWidget(this->selectedItem, true));\n}\n\nvoid DropDownSelector::setSelection(size_t i){\n\tthis->selectedItem = i;\n\t\n\tthis->handleDataSetChanged();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2017 offa\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining\n\/\/ a copy of this software and associated documentation files (the\n\/\/ \"Software\"), to deal in the Software without restriction, including\n\/\/ without limitation the rights to use, copy, modify, merge, publish,\n\/\/ distribute, sublicense, and\/or sell copies of the Software, and to\n\/\/ permit persons to whom the Software is furnished to do so, subject to\n\/\/ the following conditions.\n\/\/\n\/\/ The above copyright notice and this permission notice shall be\n\/\/ included in all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n\/\/ EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n\/\/ MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n\/\/ NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS\n\/\/ BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n\/\/ ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n\/\/ CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\/\/ SOFTWARE.\n\n\n#include \"danek\/internal\/LexToken.h\"\n#include \"danek\/internal\/LexBase.h\"\n#include <gmock\/gmock.h>\n\nusing namespace danek;\nusing namespace testing;\n\nclass LexTokenTest : public testing::Test\n{\n};\n\nTEST_F(LexTokenTest, initWithDefaultValues)\n{\n    LexToken t;\n    EXPECT_THAT(t.type(), Eq(LexBase::LEX_UNKNOWN_SYM));\n    EXPECT_THAT(t.lineNum(), Eq(-1));\n    EXPECT_THAT(t.spelling(), StrEq(\"\"));\n    EXPECT_FALSE(t.isStringFunc());\n    EXPECT_FALSE(t.isListFunc());\n    EXPECT_FALSE(t.isBoolFunc());\n}\n\nTEST_F(LexTokenTest, initWithValues)\n{\n    LexToken t{LexBase::LEX_PLUS_SYM, 15, \"abc\"};\n    EXPECT_THAT(t.type(), Eq(LexBase::LEX_PLUS_SYM));\n    EXPECT_THAT(t.lineNum(), Eq(15));\n    EXPECT_THAT(t.spelling(), StrEq(\"abc\"));\n    EXPECT_FALSE(t.isStringFunc());\n    EXPECT_FALSE(t.isListFunc());\n    EXPECT_FALSE(t.isBoolFunc());\n}\n\nTEST_F(LexTokenTest, stringFunction)\n{\n    LexToken t;\n    t.reset(LexBase::LEX_PLUS_SYM, 0, \"\", FunctionType::String);\n    EXPECT_TRUE(t.isStringFunc());\n    EXPECT_FALSE(t.isListFunc());\n    EXPECT_FALSE(t.isBoolFunc());\n}\n\nTEST_F(LexTokenTest, listFunction)\n{\n    LexToken t;\n    t.reset(LexBase::LEX_PLUS_SYM, 0, \"\", FunctionType::List);\n    EXPECT_FALSE(t.isStringFunc());\n    EXPECT_TRUE(t.isListFunc());\n    EXPECT_FALSE(t.isBoolFunc());\n}\n\nTEST_F(LexTokenTest, boolFunction)\n{\n    LexToken t;\n    t.reset(LexBase::LEX_PLUS_SYM, 0, \"\", FunctionType::Bool);\n    EXPECT_FALSE(t.isStringFunc());\n    EXPECT_FALSE(t.isListFunc());\n    EXPECT_TRUE(t.isBoolFunc());\n}\n\nTEST_F(LexTokenTest, noneFunctionType)\n{\n    LexToken t;\n    t.reset(LexBase::LEX_PLUS_SYM, 0, \"\", FunctionType::None);\n    EXPECT_FALSE(t.isStringFunc());\n    EXPECT_FALSE(t.isListFunc());\n    EXPECT_FALSE(t.isBoolFunc());\n}\n\nTEST_F(LexTokenTest, reset)\n{\n    LexToken t{LexBase::LEX_PLUS_SYM, 15, \"abc\"};\n    t.reset(LexBase::LEX_UNKNOWN_SYM, 9, \"aaa\", FunctionType::None);\n    EXPECT_THAT(t.type(), Eq(LexBase::LEX_UNKNOWN_SYM));\n    EXPECT_THAT(t.lineNum(), Eq(9));\n    EXPECT_THAT(t.spelling(), StrEq(\"aaa\"));\n    EXPECT_FALSE(t.isStringFunc());\n    EXPECT_FALSE(t.isListFunc());\n    EXPECT_FALSE(t.isBoolFunc());\n}\n\nTEST_F(LexTokenTest, resetWithFunctionType)\n{\n    LexToken t{LexBase::LEX_PLUS_SYM, 15, \"abc\"};\n    t.reset(LexBase::LEX_UNKNOWN_SYM, 8, \"xyz\", FunctionType::Bool);\n    EXPECT_THAT(t.type(), Eq(LexBase::LEX_UNKNOWN_SYM));\n    EXPECT_THAT(t.lineNum(), Eq(8));\n    EXPECT_THAT(t.spelling(), StrEq(\"xyz\"));\n    EXPECT_TRUE(t.isBoolFunc());\n}\n\n<commit_msg>Test refactoring.<commit_after>\/\/ Copyright (c) 2017 offa\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining\n\/\/ a copy of this software and associated documentation files (the\n\/\/ \"Software\"), to deal in the Software without restriction, including\n\/\/ without limitation the rights to use, copy, modify, merge, publish,\n\/\/ distribute, sublicense, and\/or sell copies of the Software, and to\n\/\/ permit persons to whom the Software is furnished to do so, subject to\n\/\/ the following conditions.\n\/\/\n\/\/ The above copyright notice and this permission notice shall be\n\/\/ included in all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n\/\/ EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n\/\/ MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n\/\/ NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS\n\/\/ BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n\/\/ ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n\/\/ CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\/\/ SOFTWARE.\n\n\n#include \"danek\/internal\/LexToken.h\"\n#include \"danek\/internal\/LexBase.h\"\n#include <gmock\/gmock.h>\n\nusing namespace danek;\nusing namespace testing;\n\nclass LexTokenTest : public testing::Test\n{\n};\n\nTEST_F(LexTokenTest, initWithDefaultValues)\n{\n    const LexToken t;\n    EXPECT_THAT(t.type(), Eq(LexBase::LEX_UNKNOWN_SYM));\n    EXPECT_THAT(t.lineNum(), Eq(-1));\n    EXPECT_THAT(t.spelling(), StrEq(\"\"));\n    EXPECT_FALSE(t.isStringFunc());\n    EXPECT_FALSE(t.isListFunc());\n    EXPECT_FALSE(t.isBoolFunc());\n}\n\nTEST_F(LexTokenTest, initWithValues)\n{\n    const LexToken t{LexBase::LEX_PLUS_SYM, 15, \"abc\"};\n    EXPECT_THAT(t.type(), Eq(LexBase::LEX_PLUS_SYM));\n    EXPECT_THAT(t.lineNum(), Eq(15));\n    EXPECT_THAT(t.spelling(), StrEq(\"abc\"));\n    EXPECT_FALSE(t.isStringFunc());\n    EXPECT_FALSE(t.isListFunc());\n    EXPECT_FALSE(t.isBoolFunc());\n}\n\nTEST_F(LexTokenTest, stringFunction)\n{\n    LexToken t;\n    t.reset(LexBase::LEX_PLUS_SYM, 0, \"\", FunctionType::String);\n    EXPECT_TRUE(t.isStringFunc());\n    EXPECT_FALSE(t.isListFunc());\n    EXPECT_FALSE(t.isBoolFunc());\n}\n\nTEST_F(LexTokenTest, listFunction)\n{\n    LexToken t;\n    t.reset(LexBase::LEX_PLUS_SYM, 0, \"\", FunctionType::List);\n    EXPECT_FALSE(t.isStringFunc());\n    EXPECT_TRUE(t.isListFunc());\n    EXPECT_FALSE(t.isBoolFunc());\n}\n\nTEST_F(LexTokenTest, boolFunction)\n{\n    LexToken t;\n    t.reset(LexBase::LEX_PLUS_SYM, 0, \"\", FunctionType::Bool);\n    EXPECT_FALSE(t.isStringFunc());\n    EXPECT_FALSE(t.isListFunc());\n    EXPECT_TRUE(t.isBoolFunc());\n}\n\nTEST_F(LexTokenTest, noneFunctionType)\n{\n    LexToken t;\n    t.reset(LexBase::LEX_PLUS_SYM, 0, \"\", FunctionType::None);\n    EXPECT_FALSE(t.isStringFunc());\n    EXPECT_FALSE(t.isListFunc());\n    EXPECT_FALSE(t.isBoolFunc());\n}\n\nTEST_F(LexTokenTest, reset)\n{\n    LexToken t{LexBase::LEX_PLUS_SYM, 15, \"abc\"};\n    t.reset(LexBase::LEX_UNKNOWN_SYM, 9, \"aaa\", FunctionType::None);\n    EXPECT_THAT(t.type(), Eq(LexBase::LEX_UNKNOWN_SYM));\n    EXPECT_THAT(t.lineNum(), Eq(9));\n    EXPECT_THAT(t.spelling(), StrEq(\"aaa\"));\n    EXPECT_FALSE(t.isStringFunc());\n    EXPECT_FALSE(t.isListFunc());\n    EXPECT_FALSE(t.isBoolFunc());\n}\n\nTEST_F(LexTokenTest, resetWithFunctionType)\n{\n    LexToken t{LexBase::LEX_PLUS_SYM, 15, \"abc\"};\n    t.reset(LexBase::LEX_UNKNOWN_SYM, 8, \"xyz\", FunctionType::Bool);\n    EXPECT_THAT(t.type(), Eq(LexBase::LEX_UNKNOWN_SYM));\n    EXPECT_THAT(t.lineNum(), Eq(8));\n    EXPECT_THAT(t.spelling(), StrEq(\"xyz\"));\n    EXPECT_TRUE(t.isBoolFunc());\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * The MIT License\n *\n * Copyright 2017-2018 Norwegian University of Technology\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\n#include <cvode\/cvode.h>\n#include <fmi4cpp\/fmi2\/import\/ModelExchangeSlave.hpp>\n\nusing namespace fmi4cpp::fmi2;\n\nnamespace {\n\n    const double EPS = 1E-13;\n\n    std::unique_ptr<CoSimulationModelDescription> wrap(const ModelExchangeModelDescription &me) {\n        CoSimulationAttributes attributes(me.attributes());\n        attributes.canHandleVariableCommunicationStepSize = true;\n        attributes.maxOutputDerivativeOrder = 0;\n        return std::make_unique<CoSimulationModelDescription>(CoSimulationModelDescription(me, attributes));\n    }\n\n}\n\nModelExchangeSlave::ModelExchangeSlave(\n        std::unique_ptr<ModelExchangeInstance> &instance,\n        std::unique_ptr<Solver> &solver)\n        : instance_(std::move(instance)), solver_(std::move(solver)) {\n\n    csModelDescription_ = std::move(wrap(*instance_->getModelDescription()));\n\n    size_t numberOfContinuousStates = instance_->getModelDescription()->numberOfContinuousStates();\n    size_t numberOfEventIndicators = instance_->getModelDescription()->numberOfEventIndicators();\n\n    x_.reserve(numberOfContinuousStates);\n    dx_.reserve(numberOfContinuousStates);\n\n    z_.reserve(numberOfEventIndicators);\n    pz_.reserve(numberOfEventIndicators);\n\n}\n\nvoid ModelExchangeSlave::operator()(const std::vector<double> &x, std::vector<double> &dxdt, const double t) {\n    instance_->setTime(t);\n    instance_->setContinuousStates(x);\n    instance_->getDerivatives(dxdt);\n}\n\nfmi2Status ModelExchangeSlave::doStep(const double stepSize) {\n\n    if (stepSize <= 0) {\n        return fmi2Error;\n    }\n\n    double time = simulationTime_;\n    double stopTime = (time + stepSize);\n\n    while (time <= stopTime) {\n\n        double tNext = std::min((time + stepSize), stopTime);\n\n        bool timeEvent = eventInfo_.nextEventTimeDefined && eventInfo_.nextEventTime <= time;\n        if (timeEvent) {\n            tNext = eventInfo_.nextEventTime;\n        }\n\n        bool stateEvent = false;\n        if ((tNext - time) > EPS) {\n            stateEvent = solve(time, tNext);\n        } else {\n            time = tNext;\n        }\n\n        instance_->setTime(time);\n        simulationTime_ = time;\n\n        bool enterEventMode = false;\n        if (!instance_->getModelDescription()->completedIntegratorStepNotNeeded()) {\n            int enterEventMode_ = 0;\n            int terminateSimulation_ = 0;\n            instance_->completedIntegratorStep(false, enterEventMode_, terminateSimulation_);\n            if (terminateSimulation_ == 1) {\n                terminate();\n            }\n            enterEventMode = (enterEventMode_ == 1);\n        }\n\n        if (timeEvent || stateEvent || enterEventMode) {\n            instance_->enterEventMode();\n        }\n\n        if (eventIteration()) {\n            return fmi2Discard;\n        }\n\n    }\n\n    return fmi2OK;\n}\n\nbool ModelExchangeSlave::solve(double t, double tNext) {\n\n    instance_->getContinuousStates(x_);\n\n    double stepSize = (tNext - t);\n    solver_->integrate(*this, t, x_, (simulationTime_ + stepSize));\n\n    pz_ = z_;\n    instance_->getEventIndicators(z_);\n    for (unsigned int i = 0; i < pz_.size(); i++) {\n        if (pz_[i] * z_[i] < 0) {\n            return true;\n        }\n    }\n\n    return false;\n\n}\n\nfmi2Status ModelExchangeSlave::cancelStep() {\n    return fmi2Discard;\n}\n\nfmi2Status ModelExchangeSlave::reset() {\n    return instance_->reset();\n}\n\nfmi2Status ModelExchangeSlave::terminate() {\n    return instance_->terminate();\n}\n\n\nstd::shared_ptr<CoSimulationModelDescription> ModelExchangeSlave::getModelDescription() const {\n    return csModelDescription_;\n}\n\nbool ModelExchangeSlave::eventIteration() {\n\n    eventInfo_.newDiscreteStatesNeeded = true;\n    eventInfo_.terminateSimulation = false;\n\n    while (eventInfo_.newDiscreteStatesNeeded) {\n         instance_->newDiscreteStates(eventInfo_);\n         if (eventInfo_.terminateSimulation) {\n             terminate();\n             return true;\n         }\n    }\n\n    instance_->enterContinuousTimeMode();\n\n    return false;\n}\n\nfmi2Status ModelExchangeSlave::setupExperiment(double startTime, double stopTime, double tolerance) {\n    return instance_->setupExperiment(startTime, stopTime, tolerance);\n}\n\nfmi2Status ModelExchangeSlave::enterInitializationMode() {\n    return instance_->enterInitializationMode();\n}\n\nfmi2Status ModelExchangeSlave::exitInitializationMode() {\n    auto status = instance_->exitInitializationMode();\n    if (eventIteration()) {\n        throw std::runtime_error(\"EventIteration failed during initialization!\");\n    }\n\n    return status;\n}\n\n\nfmi2Status ModelExchangeSlave::getFMUstate(fmi2FMUstate &state) {\n    return instance_->getFMUstate(state);\n}\n\nfmi2Status ModelExchangeSlave::setFMUstate(fmi2FMUstate state) {\n    return instance_->setFMUstate(state);\n}\n\nfmi2Status ModelExchangeSlave::freeFMUstate(fmi2FMUstate &state) {\n    return instance_->freeFMUstate(state);\n}\n\nfmi2Status ModelExchangeSlave::serializeFMUstate(const fmi2FMUstate &state,\n                                                 std::vector<fmi2Byte> &serializedState) {\n    return instance_->serializeFMUstate(state, serializedState);\n}\n\nfmi2Status ModelExchangeSlave::deSerializeFMUstate(fmi2FMUstate &state,\n                                                   const std::vector<fmi2Byte> &serializedState) {\n    return instance_->deSerializeFMUstate(state, serializedState);\n}\n\nfmi2Status\nModelExchangeSlave::getDirectionalDerivative(const std::vector<fmi2ValueReference> &vUnkownRef,\n                                             const std::vector<fmi2ValueReference> &vKnownRef,\n                                             const std::vector<fmi2Real> &dvKnownRef,\n                                             std::vector<fmi2Real> &dvUnknownRef) const {\n    return instance_->getDirectionalDerivative(vUnkownRef, vKnownRef, dvKnownRef, dvUnknownRef);\n}\n\nfmi2Status ModelExchangeSlave::readInteger(fmi2ValueReference vr, fmi2Integer &ref) const {\n    return instance_->readInteger(vr, ref);\n}\n\nfmi2Status ModelExchangeSlave::readInteger(const std::vector<fmi2ValueReference> &vr,\n                                           std::vector<fmi2Integer> &ref) const {\n    return instance_->readInteger(vr, ref);\n}\n\nfmi2Status ModelExchangeSlave::readReal(fmi2ValueReference vr, fmi2Real &ref) const {\n    return instance_->readReal(vr, ref);\n}\n\nfmi2Status ModelExchangeSlave::readReal(const std::vector<fmi2ValueReference> &vr,\n                                        std::vector<fmi2Real> &ref) const {\n    return instance_->readReal(vr, ref);\n}\n\nfmi2Status ModelExchangeSlave::readString(fmi2ValueReference vr, fmi2String &ref) const {\n    return instance_->readString(vr, ref);\n}\n\nfmi2Status ModelExchangeSlave::readString(const std::vector<fmi2ValueReference> &vr,\n                                          std::vector<fmi2String> &ref) const {\n    return instance_->readString(vr, ref);\n}\n\nfmi2Status ModelExchangeSlave::readBoolean(fmi2ValueReference vr, fmi2Boolean &ref) const {\n    return instance_->readBoolean(vr, ref);\n}\n\nfmi2Status ModelExchangeSlave::readBoolean(const std::vector<fmi2ValueReference> &vr,\n                                           std::vector<fmi2Boolean> &ref) const {\n    return instance_->readBoolean(vr, ref);\n}\n\nfmi2Status ModelExchangeSlave::writeInteger(fmi2ValueReference vr, fmi2Integer value) {\n    return instance_->writeInteger(vr, value);\n}\n\nfmi2Status ModelExchangeSlave::writeInteger(const std::vector<fmi2ValueReference> &vr,\n                                            const std::vector<fmi2Integer> &values) {\n    return instance_->writeInteger(vr, values);\n}\n\nfmi2Status ModelExchangeSlave::writeReal(fmi2ValueReference vr, fmi2Real value) {\n    return instance_->writeReal(vr, value);\n}\n\nfmi2Status ModelExchangeSlave::writeReal(const std::vector<fmi2ValueReference> &vr,\n                                         const std::vector<fmi2Real> &values) {\n    return instance_->writeReal(vr, values);\n}\n\nfmi2Status ModelExchangeSlave::writeString(fmi2ValueReference vr, fmi2String value) {\n    return instance_->writeString(vr, value);\n}\n\nfmi2Status ModelExchangeSlave::writeString(const std::vector<fmi2ValueReference> &vr,\n                                           const std::vector<fmi2String> &values) {\n    return instance_->writeString(vr, values);\n}\n\nfmi2Status ModelExchangeSlave::writeBoolean(fmi2ValueReference vr, fmi2Boolean value) {\n    return instance_->writeBoolean(vr, value);\n}\n\nfmi2Status ModelExchangeSlave::writeBoolean(const std::vector<fmi2ValueReference> &vr,\n                                            const std::vector<fmi2Boolean> &values) {\n    return instance_->writeBoolean(vr, values);\n}\n\n<commit_msg>update me wrapper<commit_after>\/*\n * The MIT License\n *\n * Copyright 2017-2018 Norwegian University of Technology\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\n#include <cvode\/cvode.h>\n#include <fmi4cpp\/fmi2\/import\/ModelExchangeSlave.hpp>\n\nusing namespace fmi4cpp::fmi2;\n\nnamespace {\n\n    const double EPS = 1E-13;\n\n    std::unique_ptr<CoSimulationModelDescription> wrap(const ModelExchangeModelDescription &me) {\n        CoSimulationAttributes attributes(me.attributes());\n        attributes.canHandleVariableCommunicationStepSize = true;\n        attributes.maxOutputDerivativeOrder = 0;\n        return std::make_unique<CoSimulationModelDescription>(CoSimulationModelDescription(me, attributes));\n    }\n\n}\n\nModelExchangeSlave::ModelExchangeSlave(\n        std::unique_ptr<ModelExchangeInstance> &instance,\n        std::unique_ptr<Solver> &solver)\n        : instance_(std::move(instance)), solver_(std::move(solver)) {\n\n    csModelDescription_ = std::move(wrap(*instance_->getModelDescription()));\n\n    size_t numberOfContinuousStates = instance_->getModelDescription()->numberOfContinuousStates();\n    size_t numberOfEventIndicators = instance_->getModelDescription()->numberOfEventIndicators();\n\n    x_.reserve(numberOfContinuousStates);\n    dx_.reserve(numberOfContinuousStates);\n\n    z_.reserve(numberOfEventIndicators);\n    pz_.reserve(numberOfEventIndicators);\n\n}\n\nvoid ModelExchangeSlave::operator()(const std::vector<double> &x, std::vector<double> &dxdt, const double t) {\n    instance_->setTime(t);\n    instance_->setContinuousStates(x);\n    instance_->getDerivatives(dxdt);\n}\n\nfmi2Status ModelExchangeSlave::doStep(const double stepSize) {\n\n    if (stepSize <= 0) {\n        return fmi2Error;\n    }\n\n    double time = simulationTime_;\n    double stopTime = (time + stepSize);\n\n    while (time <= stopTime) {\n\n        double tNext = std::min((time + stepSize), stopTime);\n\n        bool timeEvent = eventInfo_.nextEventTimeDefined && eventInfo_.nextEventTime <= time;\n        if (timeEvent) {\n            tNext = eventInfo_.nextEventTime;\n        }\n\n        bool stateEvent = false;\n        if ((tNext - time) > EPS) {\n            stateEvent = solve(time, tNext);\n        }\n        time = tNext;\n\n        instance_->setTime(time);\n\n        bool enterEventMode = false;\n        if (!instance_->getModelDescription()->completedIntegratorStepNotNeeded()) {\n            int enterEventMode_ = 0;\n            int terminateSimulation_ = 0;\n            instance_->completedIntegratorStep(false, enterEventMode_, terminateSimulation_);\n            if (terminateSimulation_ == 1) {\n                terminate();\n            }\n            enterEventMode = (enterEventMode_ == 1);\n        }\n\n        if (timeEvent || stateEvent || enterEventMode) {\n            instance_->enterEventMode();\n        }\n\n        if (eventIteration()) {\n            return fmi2Discard;\n        }\n\n    }\n\n    simulationTime_ = time;\n\n    return fmi2OK;\n}\n\nbool ModelExchangeSlave::solve(double t, double tNext) {\n\n    instance_->getContinuousStates(x_);\n\n    double stepSize = (tNext - t);\n    solver_->integrate(*this, t, x_, (simulationTime_ + stepSize));\n\n    pz_ = z_;\n    instance_->getEventIndicators(z_);\n    for (unsigned int i = 0; i < pz_.size(); i++) {\n        if (pz_[i] * z_[i] < 0) {\n            return true;\n        }\n    }\n\n    return false;\n\n}\n\nfmi2Status ModelExchangeSlave::cancelStep() {\n    return fmi2Discard;\n}\n\nfmi2Status ModelExchangeSlave::reset() {\n    return instance_->reset();\n}\n\nfmi2Status ModelExchangeSlave::terminate() {\n    return instance_->terminate();\n}\n\n\nstd::shared_ptr<CoSimulationModelDescription> ModelExchangeSlave::getModelDescription() const {\n    return csModelDescription_;\n}\n\nbool ModelExchangeSlave::eventIteration() {\n\n    eventInfo_.newDiscreteStatesNeeded = true;\n    eventInfo_.terminateSimulation = false;\n\n    while (eventInfo_.newDiscreteStatesNeeded) {\n         instance_->newDiscreteStates(eventInfo_);\n         if (eventInfo_.terminateSimulation) {\n             terminate();\n             return true;\n         }\n    }\n\n    instance_->enterContinuousTimeMode();\n\n    return false;\n}\n\nfmi2Status ModelExchangeSlave::setupExperiment(double startTime, double stopTime, double tolerance) {\n    return instance_->setupExperiment(startTime, stopTime, tolerance);\n}\n\nfmi2Status ModelExchangeSlave::enterInitializationMode() {\n    return instance_->enterInitializationMode();\n}\n\nfmi2Status ModelExchangeSlave::exitInitializationMode() {\n    auto status = instance_->exitInitializationMode();\n    if (eventIteration()) {\n        throw std::runtime_error(\"EventIteration failed during initialization!\");\n    }\n\n    return status;\n}\n\n\nfmi2Status ModelExchangeSlave::getFMUstate(fmi2FMUstate &state) {\n    return instance_->getFMUstate(state);\n}\n\nfmi2Status ModelExchangeSlave::setFMUstate(fmi2FMUstate state) {\n    return instance_->setFMUstate(state);\n}\n\nfmi2Status ModelExchangeSlave::freeFMUstate(fmi2FMUstate &state) {\n    return instance_->freeFMUstate(state);\n}\n\nfmi2Status ModelExchangeSlave::serializeFMUstate(const fmi2FMUstate &state,\n                                                 std::vector<fmi2Byte> &serializedState) {\n    return instance_->serializeFMUstate(state, serializedState);\n}\n\nfmi2Status ModelExchangeSlave::deSerializeFMUstate(fmi2FMUstate &state,\n                                                   const std::vector<fmi2Byte> &serializedState) {\n    return instance_->deSerializeFMUstate(state, serializedState);\n}\n\nfmi2Status\nModelExchangeSlave::getDirectionalDerivative(const std::vector<fmi2ValueReference> &vUnkownRef,\n                                             const std::vector<fmi2ValueReference> &vKnownRef,\n                                             const std::vector<fmi2Real> &dvKnownRef,\n                                             std::vector<fmi2Real> &dvUnknownRef) const {\n    return instance_->getDirectionalDerivative(vUnkownRef, vKnownRef, dvKnownRef, dvUnknownRef);\n}\n\nfmi2Status ModelExchangeSlave::readInteger(fmi2ValueReference vr, fmi2Integer &ref) const {\n    return instance_->readInteger(vr, ref);\n}\n\nfmi2Status ModelExchangeSlave::readInteger(const std::vector<fmi2ValueReference> &vr,\n                                           std::vector<fmi2Integer> &ref) const {\n    return instance_->readInteger(vr, ref);\n}\n\nfmi2Status ModelExchangeSlave::readReal(fmi2ValueReference vr, fmi2Real &ref) const {\n    return instance_->readReal(vr, ref);\n}\n\nfmi2Status ModelExchangeSlave::readReal(const std::vector<fmi2ValueReference> &vr,\n                                        std::vector<fmi2Real> &ref) const {\n    return instance_->readReal(vr, ref);\n}\n\nfmi2Status ModelExchangeSlave::readString(fmi2ValueReference vr, fmi2String &ref) const {\n    return instance_->readString(vr, ref);\n}\n\nfmi2Status ModelExchangeSlave::readString(const std::vector<fmi2ValueReference> &vr,\n                                          std::vector<fmi2String> &ref) const {\n    return instance_->readString(vr, ref);\n}\n\nfmi2Status ModelExchangeSlave::readBoolean(fmi2ValueReference vr, fmi2Boolean &ref) const {\n    return instance_->readBoolean(vr, ref);\n}\n\nfmi2Status ModelExchangeSlave::readBoolean(const std::vector<fmi2ValueReference> &vr,\n                                           std::vector<fmi2Boolean> &ref) const {\n    return instance_->readBoolean(vr, ref);\n}\n\nfmi2Status ModelExchangeSlave::writeInteger(fmi2ValueReference vr, fmi2Integer value) {\n    return instance_->writeInteger(vr, value);\n}\n\nfmi2Status ModelExchangeSlave::writeInteger(const std::vector<fmi2ValueReference> &vr,\n                                            const std::vector<fmi2Integer> &values) {\n    return instance_->writeInteger(vr, values);\n}\n\nfmi2Status ModelExchangeSlave::writeReal(fmi2ValueReference vr, fmi2Real value) {\n    return instance_->writeReal(vr, value);\n}\n\nfmi2Status ModelExchangeSlave::writeReal(const std::vector<fmi2ValueReference> &vr,\n                                         const std::vector<fmi2Real> &values) {\n    return instance_->writeReal(vr, values);\n}\n\nfmi2Status ModelExchangeSlave::writeString(fmi2ValueReference vr, fmi2String value) {\n    return instance_->writeString(vr, value);\n}\n\nfmi2Status ModelExchangeSlave::writeString(const std::vector<fmi2ValueReference> &vr,\n                                           const std::vector<fmi2String> &values) {\n    return instance_->writeString(vr, values);\n}\n\nfmi2Status ModelExchangeSlave::writeBoolean(fmi2ValueReference vr, fmi2Boolean value) {\n    return instance_->writeBoolean(vr, value);\n}\n\nfmi2Status ModelExchangeSlave::writeBoolean(const std::vector<fmi2ValueReference> &vr,\n                                            const std::vector<fmi2Boolean> &values) {\n    return instance_->writeBoolean(vr, values);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"formulation\/scalar\/cfem_diffusion.h\"\n\n#include <array>\n#include <memory>\n#include <cstdlib>\n\n#include \"data\/cross_sections.h\"\n#include \"domain\/tests\/finite_element_mock.h\"\n#include \"material\/tests\/mock_material.h\"\n#include \"test_helpers\/gmock_wrapper.h\"\n#include \"test_helpers\/test_helper_functions.h\"\n\n\nnamespace {\n\nusing ::testing::AssertionResult;\nusing ::testing::AssertionFailure;\nusing ::testing::AssertionSuccess;\nusing ::testing::Le;\nusing ::testing::Ge;\nusing ::testing::DoDefault;\nusing ::testing::NiceMock;\nusing ::testing::Return;\nusing ::testing::_;\nusing namespace bart;\n\nclass FormulationCFEMDiffusionTest : public ::testing::Test {\n protected:\n  using Matrix = dealii::FullMatrix<double>;\n  std::shared_ptr<domain::FiniteElementMock<2>> fe_mock_ptr;\n  std::shared_ptr<data::CrossSections> cross_sections_ptr;\n\n  int *a, *b;\n\n  void SetUp() override;\n};\n\nvoid FormulationCFEMDiffusionTest::SetUp() {\n  \/\/ Make mock objects. Cross-sections is a struct that cannot be mocked, but\n  \/\/ we can mock the material object it is based on.\n  NiceMock<btest::MockMaterial> mock_material;\n  fe_mock_ptr = std::make_shared<NiceMock<domain::FiniteElementMock<2>>>();\n  cross_sections_ptr = std::make_shared<data::CrossSections>(mock_material);\n\n  ON_CALL(*fe_mock_ptr, dofs_per_cell())\n      .WillByDefault(Return(2));\n  ON_CALL(*fe_mock_ptr, n_cell_quad_pts())\n      .WillByDefault(Return(2));\n  ON_CALL(*fe_mock_ptr, n_face_quad_pts())\n      .WillByDefault(Return(2));\n\n  for (int q = 0; q < 2; ++q) {\n    for (int i = 0; i < 2; ++i) {\n      ON_CALL(*fe_mock_ptr, ShapeValue(i, q))\n          .WillByDefault(Return(i + q));\n\n      dealii::Tensor<1, 2> gradient_tensor;\n      gradient_tensor[0] = i;\n      gradient_tensor[1] = q;\n\n      ON_CALL(*fe_mock_ptr, ShapeGradient(i, q))\n          .WillByDefault(Return(gradient_tensor));\n    }\n  }\n}\n\nAssertionResult CompareMatrices(const dealii::FullMatrix<double>& expected,\n                                const dealii::FullMatrix<double>& result,\n                                const double tol = 1e-6) {\n  unsigned int rows = expected.m();\n  unsigned int cols = expected.n();\n\n  if (result.m() != rows)\n    return AssertionFailure() << \"Result has wrong number of rows: \"\n                              << result.m() << \", expected\" << rows;\n  if (result.n() != cols)\n    return AssertionFailure() << \"Result has wrong number of columns: \"\n                              << result.n() << \", expected\" << cols;\n\n  for (unsigned int i = 0; i < rows; ++i) {\n    for (unsigned int j = 0; j < cols; ++j) {\n      if (abs(result(i, j) - expected(i, j)) > tol) {\n        return AssertionFailure() << \"Entry (\" << i << \", \" << j <<\n                                  \") has value: \" << result(i, j) <<\n                                  \", expected: \" << expected(i, j);\n      }\n    }\n  }\n  return AssertionSuccess();\n}\n\n\nTEST_F(FormulationCFEMDiffusionTest, ConstructorTest) {\n  EXPECT_CALL(*fe_mock_ptr, dofs_per_cell())\n      .WillOnce(DoDefault());\n  EXPECT_CALL(*fe_mock_ptr, n_cell_quad_pts())\n      .WillOnce(DoDefault());\n  EXPECT_CALL(*fe_mock_ptr, n_face_quad_pts())\n      .WillOnce(DoDefault());\n\n  formulation::scalar::CFEM_Diffusion<2> test_diffusion(fe_mock_ptr,\n                                                        cross_sections_ptr);\n\n  EXPECT_EQ(fe_mock_ptr.use_count(), 2);\n  EXPECT_EQ(cross_sections_ptr.use_count(), 2);\n}\n\nTEST_F(FormulationCFEMDiffusionTest, PrecalculateTest) {\n  \/\/ Shape call, by default, returns (quadrature point index + degree of freedom)\n  \/\/ Gradient call will return a tensor of [i, q]\n  \/\/ Expected results, we need to make arrays to put them into dealii matrices\n  std::array<double, 4> shape_matrix_q_0_values = {0, 0,\n                                                   0, 1};\n  std::array<double, 4> shape_matrix_q_1_values = {1, 2,\n                                                   2, 4};\n  std::array<double, 4> gradient_matrix_q_0_values = {0, 0,\n                                                      0, 1};\n  std::array<double, 4> gradient_matrix_q_1_values = {1, 1,\n                                                      1, 2};\n\n  dealii::FullMatrix<double> shape_matrix_q_0{2,2,\n                                              shape_matrix_q_0_values.begin()};\n  dealii::FullMatrix<double> shape_matrix_q_1{2,2,\n                                              shape_matrix_q_1_values.begin()};\n  dealii::FullMatrix<double> gradient_matrix_q_0{2,2,\n                                                 gradient_matrix_q_0_values.begin()};\n  dealii::FullMatrix<double> gradient_matrix_q_1{2,2,\n                                                 gradient_matrix_q_1_values.begin()};\n\n  formulation::scalar::CFEM_Diffusion<2> test_diffusion(fe_mock_ptr,\n                                                        cross_sections_ptr);\n  dealii::DoFHandler<2>::active_cell_iterator it;\n\n  \/\/ Set call expectations\n  EXPECT_CALL(*fe_mock_ptr, SetCell(_))\n      .Times(1);\n  EXPECT_CALL(*fe_mock_ptr, ShapeValue(_,_))\n      .Times(16)\n      .WillRepeatedly(DoDefault());\n  EXPECT_CALL(*fe_mock_ptr, ShapeGradient(_,_))\n      .Times(16)\n      .WillRepeatedly(DoDefault());\n  \n  test_diffusion.Precalculate(it);\n  auto shape_squared = test_diffusion.GetShapeSquared();\n  auto gradient_squared = test_diffusion.GetGradientSquared();\n\n  EXPECT_TRUE(CompareMatrices(shape_matrix_q_0, shape_squared.at(0)));\n  EXPECT_TRUE(CompareMatrices(shape_matrix_q_1, shape_squared.at(1)));\n  EXPECT_TRUE(CompareMatrices(gradient_matrix_q_0, gradient_squared.at(0)));\n  EXPECT_TRUE(CompareMatrices(gradient_matrix_q_1, gradient_squared.at(1)));\n}\n\n} \/\/ namespace<commit_msg>added test for FillCellStreamingTerm<commit_after>#include \"formulation\/scalar\/cfem_diffusion.h\"\n\n#include <array>\n#include <memory>\n#include <cstdlib>\n\n#include \"data\/cross_sections.h\"\n#include \"domain\/tests\/finite_element_mock.h\"\n#include \"material\/tests\/mock_material.h\"\n#include \"test_helpers\/gmock_wrapper.h\"\n#include \"test_helpers\/test_helper_functions.h\"\n\n\nnamespace {\n\nusing ::testing::AssertionResult;\nusing ::testing::AssertionFailure;\nusing ::testing::AssertionSuccess;\nusing ::testing::Le;\nusing ::testing::Ge;\nusing ::testing::DoDefault;\nusing ::testing::NiceMock;\nusing ::testing::Return;\nusing ::testing::_;\nusing namespace bart;\n\nclass FormulationCFEMDiffusionTest : public ::testing::Test {\n protected:\n  using Matrix = dealii::FullMatrix<double>;\n  std::shared_ptr<domain::FiniteElementMock<2>> fe_mock_ptr;\n  std::shared_ptr<data::CrossSections> cross_sections_ptr;\n\n  int *a, *b;\n\n  void SetUp() override;\n};\n\nvoid FormulationCFEMDiffusionTest::SetUp() {\n  \/\/ Make mock objects. Cross-sections is a struct that cannot be mocked, but\n  \/\/ we can mock the material object it is based on.\n  NiceMock<btest::MockMaterial> mock_material;\n  fe_mock_ptr = std::make_shared<NiceMock<domain::FiniteElementMock<2>>>();\n  cross_sections_ptr = std::make_shared<data::CrossSections>(mock_material);\n\n  ON_CALL(*fe_mock_ptr, dofs_per_cell())\n      .WillByDefault(Return(2));\n  ON_CALL(*fe_mock_ptr, n_cell_quad_pts())\n      .WillByDefault(Return(2));\n  ON_CALL(*fe_mock_ptr, n_face_quad_pts())\n      .WillByDefault(Return(2));\n\n  for (int q = 0; q < 2; ++q) {\n    ON_CALL(*fe_mock_ptr, Jacobian(q))\n        .WillByDefault(Return((1 + q)*3));\n    for (int i = 0; i < 2; ++i) {\n      ON_CALL(*fe_mock_ptr, ShapeValue(i, q))\n          .WillByDefault(Return(i + q));\n\n      dealii::Tensor<1, 2> gradient_tensor;\n      gradient_tensor[0] = i;\n      gradient_tensor[1] = q;\n\n      ON_CALL(*fe_mock_ptr, ShapeGradient(i, q))\n          .WillByDefault(Return(gradient_tensor));\n    }\n  }\n\n\n\n\n  \/\/ Cross-section data for fake two-group, with one material (id = 0)\n  std::array<double, 4> sigma_s_values{1.0, 1.0, 1.0, 2.0}; \/\/ (i*j + 1)\n  dealii::FullMatrix<double> sigma_s_matrix{2,2, sigma_s_values.begin()};\n  std::unordered_map<int, std::vector<double>> sigma_t{{0, {1.0, 2.0}}}; \/\/ i + 1\n  std::unordered_map<int, dealii::FullMatrix<double>> sigma_s{{0, sigma_s_matrix}};\n\n  ON_CALL(mock_material, GetSigT())\n      .WillByDefault(Return(sigma_t));\n  ON_CALL(mock_material, GetSigS())\n      .WillByDefault(Return(sigma_s));\n  ON_CALL(mock_material, GetDiffusionCoef())\n      .WillByDefault(Return(sigma_t));\n}\n\nAssertionResult CompareMatrices(const dealii::FullMatrix<double>& expected,\n                                const dealii::FullMatrix<double>& result,\n                                const double tol = 1e-6) {\n  unsigned int rows = expected.m();\n  unsigned int cols = expected.n();\n\n  if (result.m() != rows)\n    return AssertionFailure() << \"Result has wrong number of rows: \"\n                              << result.m() << \", expected\" << rows;\n  if (result.n() != cols)\n    return AssertionFailure() << \"Result has wrong number of columns: \"\n                              << result.n() << \", expected\" << cols;\n\n  for (unsigned int i = 0; i < rows; ++i) {\n    for (unsigned int j = 0; j < cols; ++j) {\n      if (abs(result(i, j) - expected(i, j)) > tol) {\n        return AssertionFailure() << \"Entry (\" << i << \", \" << j <<\n                                  \") has value: \" << result(i, j) <<\n                                  \", expected: \" << expected(i, j);\n      }\n    }\n  }\n  return AssertionSuccess();\n}\n\n\nTEST_F(FormulationCFEMDiffusionTest, ConstructorTest) {\n  EXPECT_CALL(*fe_mock_ptr, dofs_per_cell())\n      .WillOnce(DoDefault());\n  EXPECT_CALL(*fe_mock_ptr, n_cell_quad_pts())\n      .WillOnce(DoDefault());\n  EXPECT_CALL(*fe_mock_ptr, n_face_quad_pts())\n      .WillOnce(DoDefault());\n\n  formulation::scalar::CFEM_Diffusion<2> test_diffusion(fe_mock_ptr,\n                                                        cross_sections_ptr);\n\n  EXPECT_EQ(fe_mock_ptr.use_count(), 2);\n  EXPECT_EQ(cross_sections_ptr.use_count(), 2);\n}\n\nTEST_F(FormulationCFEMDiffusionTest, PrecalculateTest) {\n  \/\/ Shape call, by default, returns (quadrature point index + degree of freedom)\n  \/\/ Gradient call will return a tensor of [i, q]\n  \/\/ Expected results, we need to make arrays to put them into dealii matrices\n  std::array<double, 4> shape_matrix_q_0_values = {0, 0,\n                                                   0, 1};\n  std::array<double, 4> shape_matrix_q_1_values = {1, 2,\n                                                   2, 4};\n  std::array<double, 4> gradient_matrix_q_0_values = {0, 0,\n                                                      0, 1};\n  std::array<double, 4> gradient_matrix_q_1_values = {1, 1,\n                                                      1, 2};\n\n  dealii::FullMatrix<double> shape_matrix_q_0{2,2,\n                                              shape_matrix_q_0_values.begin()};\n  dealii::FullMatrix<double> shape_matrix_q_1{2,2,\n                                              shape_matrix_q_1_values.begin()};\n  dealii::FullMatrix<double> gradient_matrix_q_0{2,2,\n                                                 gradient_matrix_q_0_values.begin()};\n  dealii::FullMatrix<double> gradient_matrix_q_1{2,2,\n                                                 gradient_matrix_q_1_values.begin()};\n\n  formulation::scalar::CFEM_Diffusion<2> test_diffusion(fe_mock_ptr,\n                                                        cross_sections_ptr);\n  dealii::DoFHandler<2>::active_cell_iterator it;\n\n  \/\/ Set call expectations\n  EXPECT_CALL(*fe_mock_ptr, SetCell(_))\n      .Times(1);\n  EXPECT_CALL(*fe_mock_ptr, ShapeValue(_,_))\n      .Times(16)\n      .WillRepeatedly(DoDefault());\n  EXPECT_CALL(*fe_mock_ptr, ShapeGradient(_,_))\n      .Times(16)\n      .WillRepeatedly(DoDefault());\n\n  test_diffusion.Precalculate(it);\n  auto shape_squared = test_diffusion.GetShapeSquared();\n  auto gradient_squared = test_diffusion.GetGradientSquared();\n\n  EXPECT_TRUE(CompareMatrices(shape_matrix_q_0, shape_squared.at(0)));\n  EXPECT_TRUE(CompareMatrices(shape_matrix_q_1, shape_squared.at(1)));\n  EXPECT_TRUE(CompareMatrices(gradient_matrix_q_0, gradient_squared.at(0)));\n  EXPECT_TRUE(CompareMatrices(gradient_matrix_q_1, gradient_squared.at(1)));\n}\n\nTEST_F(FormulationCFEMDiffusionTest, FillCellStreamingTermTest) {\n  dealii::FullMatrix<double> test_matrix(2,2);\n  dealii::DoFHandler<2>::active_cell_iterator it;\n\n  std::array<double, 4> expected_values{6, 6,\n                                        6, 11};\n  dealii::FullMatrix<double> expected_matrix(2, 2, expected_values.begin());\n\n  formulation::scalar::CFEM_Diffusion<2> test_diffusion(fe_mock_ptr,\n                                                        cross_sections_ptr);\n  test_diffusion.Precalculate(it);\n\n  EXPECT_CALL(*fe_mock_ptr, Jacobian(_))\n      .Times(2)\n      .WillRepeatedly(DoDefault());\n  EXPECT_CALL(*fe_mock_ptr, SetCell(it))\n      .Times(1);\n\n  test_diffusion.FillCellStreamingTerm(test_matrix, it, 0, 0);\n\n  EXPECT_TRUE(CompareMatrices(expected_matrix, test_matrix));\n}\n\n\n} \/\/ namespace<|endoftext|>"}
{"text":"<commit_before>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit (ITK)\n  Module:    itkNeighborhoodAlgorithmTest.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 \"itkImage.h\"\n#include \"itkNeighborhood.h\"\n#include \"itkRegionNeighborhoodIterator.h\"\n#include \"itkImageRegionIterator.h\"\n#include \"itkSmartRegionNeighborhoodIterator.h\"\n#include \"itkNeighborhoodAlgorithm.h\"\n#include \"itkDerivativeOperator.h\"\n#include <iostream>\n\ninline void println(char *s) { std::cout << s << std::endl; }\n\nint main()\n{\n  typedef itk::Image<float, 2> ImageType2D;\n  typedef itk::Image<float, 3> ImageType3D;\n  typedef itk::Image<float, 4> ImageTypeND;\n\n  println(\"Creating some images\");\n  \n  \/\/ Create some images  \n  itk::ImageRegion<2> Region2D;\n  itk::ImageRegion<3> Region3D;\n  itk::ImageRegion<4> RegionND;\n  \n  itk::Size<2>  size2D;\n  size2D[0] = 123;\n  size2D[1] = 241;\n\n  itk::Size<3>  size3D;\n  size3D[0] = 123;\n  size3D[1] = 241;\n  size3D[2] = 10;\n  \n  itk::Size<4>  sizeND;\n  sizeND[0] = 10;\n  sizeND[1] = 10;\n  sizeND[2] = 4;\n  sizeND[3] = 2;\n  \n  itk::Index<2> orig2D;\n  orig2D[0] = 0;\n  orig2D[1] = 0;\n\n  itk::Index<3> orig3D;\n  orig3D[0] = 0;\n  orig3D[1] = 0;\n  orig3D[2] = 0;\n  \n  itk::Index<4> origND;\n  origND[0] = 0;\n  origND[1] = 0;\n  origND[2] = 0;\n  origND[3] = 0;\n  \n  Region2D.SetSize(size2D);\n  Region3D.SetSize(size3D);\n  RegionND.SetSize(sizeND);\n  \n  Region2D.SetIndex(orig2D);\n  Region3D.SetIndex(orig3D);\n  RegionND.SetIndex(origND);\n\n  ImageType2D::Pointer image2D = ImageType2D::New();\n  ImageType3D::Pointer image3D = ImageType3D::New();\n  ImageTypeND::Pointer imageND = ImageTypeND::New();\n\n  image2D->SetLargestPossibleRegion(Region2D);\n  image3D->SetLargestPossibleRegion(Region3D);\n  imageND->SetLargestPossibleRegion(RegionND);\n\n  image2D->SetBufferedRegion(Region2D);\n  image3D->SetBufferedRegion(Region3D);\n  imageND->SetBufferedRegion(RegionND);\n\n  image2D->SetRequestedRegion(Region2D);\n  image3D->SetRequestedRegion(Region3D);\n  imageND->SetRequestedRegion(RegionND);\n\n  image2D->Allocate();\n  image3D->Allocate();\n  imageND->Allocate();\n\n  itk::ImageRegionIterator<ImageType2D> it2D(image2D,\n                                          image2D->GetRequestedRegion());\n  itk::ImageRegionIterator<ImageType3D> it3D(image3D,\n                                          image3D->GetRequestedRegion());\n  itk::ImageRegionIterator<ImageTypeND> itND(imageND,\n                                          imageND->GetRequestedRegion());\n\n  println(\"Initializing some images\");\n  \n  for (it2D = it2D.Begin(); it2D != it2D.End(); ++it2D) it2D.Set( 1.0f );\n  for (it3D = it3D.Begin(); it3D != it3D.End(); ++it3D) it3D.Set( 1.0f );\n  for (itND = itND.Begin(); itND != itND.End(); ++itND) itND.Set( 1.0f );\n\n  \/\/ Set up some neighborhood iterators\n  println(\"Setting up some neighborhood iterators\");\n  itk::Index<2> orig2Dm;\n  orig2Dm[0] = 55;\n  orig2Dm[1] = 55;\n  \n  itk::Index<3> orig3Dm;\n  orig3Dm[0] = 55;\n  orig3Dm[1] = 55;\n  orig3Dm[2] = 5;\n  \n  itk::Index<4> origNDm;\n  origNDm[0] = 55;\n  origNDm[1] = 55;\n  origNDm[2] = 5;\n  origNDm[3] = 2;\n\n  itk::Size<2> sz2;\n  sz2[0] = 2;\n  sz2[1] = 3;\n  \n  itk::Size<3> sz3;\n  sz3[0] = 2;\n  sz3[1] = 3;\n  sz3[2] = 1;\n  \n  itk::Size<4> szN;\n  szN[0] = 1;\n  szN[1] = 3;\n  szN[2] = 1;\n  szN[3] = 1;\n\n  itk::RegionNeighborhoodIterator<ImageType2D> rni2D(sz2, image2D,\n                                           image2D->GetRequestedRegion());\n  itk::RegionNeighborhoodIterator<ImageType3D> rni3D(sz3, image3D,\n                                           image3D->GetRequestedRegion());\n  itk::RegionNeighborhoodIterator<ImageTypeND> rniND(szN, imageND,\n                                           imageND->GetRequestedRegion());\n\n  \/\/ Test convolution\n  println(\"Testing convolution\");\n  rni2D.SetLocation(orig2Dm);\n  itk::Neighborhood<float, 2> n2 = rni2D.GetNeighborhood();\n  n2 = itk::NeighborhoodAlgorithm::Convolve2D(n2, n2, 1);\n  n2 = itk::NeighborhoodAlgorithm::Convolve2D(n2, n2, 0);\n\n  rni3D.SetLocation(orig3Dm);\n  itk::Neighborhood<float, 3> n3 = rni3D.GetNeighborhood();\n  n3 = itk::NeighborhoodAlgorithm::Convolve3D(n3, n3, 1);\n  n3 = itk::NeighborhoodAlgorithm::Convolve3D(n3, n3, 0);\n\n  rniND.SetLocation(origNDm);\n  itk::Neighborhood<float, 4> nN = rniND.GetNeighborhood();\n  nN = itk::NeighborhoodAlgorithm::ConvolveND(nN, nN, 1);\n  nN = itk::NeighborhoodAlgorithm::ConvolveND(nN, nN, 0);\n  \n  \/\/ Test inner product\n  println(\"Testing inner product variations\");\n  itk::DerivativeOperator<float, 2> d2D;\n  itk::DerivativeOperator<float, 3> d3D;\n  itk::DerivativeOperator<float, 4> dND;\n\n  d2D.SetDirection(0);\n  d3D.SetDirection(0);\n  dND.SetDirection(0);\n  \n  d2D.SetOrder(1);\n  d3D.SetOrder(1);\n  dND.SetOrder(1);\n\n  d2D.CreateDirectional();\n  d3D.CreateDirectional();\n  dND.CreateDirectional();\n  \n  itk::SmartRegionNeighborhoodIterator<ImageType2D>\n    rni2Dd(d2D.GetRadius(), image2D, image2D->GetRequestedRegion());\n  itk::SmartRegionNeighborhoodIterator<ImageType3D>\n    rni3Dd(d3D.GetRadius(), image3D, image3D->GetRequestedRegion());\n  itk::SmartRegionNeighborhoodIterator<ImageTypeND>\n    rniNDd(dND.GetRadius(), imageND, imageND->GetRequestedRegion());\n\n  println(\"A\");\n  itk::NeighborhoodAlgorithm\n    ::IteratorInnerProduct<itk::NeighborhoodIterator<ImageType2D>,\n    itk::Neighborhood<float, 2> > ipi2D;\n  ipi2D(rni2Dd, d2D);\n\n  println(\"B\");\n  itk::NeighborhoodAlgorithm\n    ::InnerProduct<itk::Neighborhood<float, 2>, itk::Neighborhood<float,2> >\n    ipn2D;\n  n2 = rni2Dd.GetNeighborhood();\n  ipn2D(n2, d2D);\n\n  println(\"C\");\n  itk::NeighborhoodAlgorithm\n    ::IteratorInnerProduct<itk::NeighborhoodIterator<ImageType3D>,\n    itk::Neighborhood<float, 3> > ipi3D;\n  ipi3D(rni3Dd, d3D);\n\n  println(\"D\");\n  itk::NeighborhoodAlgorithm\n    ::InnerProduct<itk::Neighborhood<float, 3>,\n    itk::Neighborhood<float, 3> > ipn3D;\n  n3 = rni3Dd.GetNeighborhood();\n  ipn3D(n3, d3D);\n\n  println(\"E\");\n  itk::NeighborhoodAlgorithm\n    ::IteratorInnerProduct<itk::NeighborhoodIterator<ImageTypeND>,\n    itk::Neighborhood<float, 4> > ipiND;\n  ipiND(rniNDd, dND);\n\n  println(\"F\");\n  itk::NeighborhoodAlgorithm\n    ::InnerProduct<itk::Neighborhood<float, 4>,\n    itk::Neighborhood<float, 4> > ipnND;\n  nN = rniNDd.GetNeighborhood();\n  ipnND(nN, dND);\n  \n  println(\"G\");\n  itk::NeighborhoodAlgorithm\n    ::BoundsCheckingIteratorInnerProduct<itk::\n    SmartRegionNeighborhoodIterator<ImageTypeND>,\n    itk::Neighborhood<float, 4> > ipibND;\n  ipibND(rniNDd, dND);\n\n  return 0;\n}\n<commit_msg>FIX: Removed calls to missing itk::NeighborhoodAlgorithm::Convolve functions, which have been removed from the toolkit.<commit_after>\/*=========================================================================\n\n  Program:   Insight Segmentation & Registration Toolkit (ITK)\n  Module:    itkNeighborhoodAlgorithmTest.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 \"itkImage.h\"\n#include \"itkNeighborhood.h\"\n#include \"itkRegionNeighborhoodIterator.h\"\n#include \"itkImageRegionIterator.h\"\n#include \"itkSmartRegionNeighborhoodIterator.h\"\n#include \"itkRandomAccessNeighborhoodIterator.h\"\n#include \"itkNeighborhoodAlgorithm.h\"\n#include \"itkDerivativeOperator.h\"\n#include <iostream>\n\ninline void println(char *s) { std::cout << s << std::endl; }\n\nint main()\n{\n  typedef itk::Image<float, 2> ImageType2D;\n  typedef itk::Image<float, 3> ImageType3D;\n  typedef itk::Image<float, 4> ImageTypeND;\n\n  println(\"Creating some images\");\n  \n  \/\/ Create some images  \n  itk::ImageRegion<2> Region2D;\n  itk::ImageRegion<3> Region3D;\n  itk::ImageRegion<4> RegionND;\n  \n  itk::Size<2>  size2D;\n  size2D[0] = 123;\n  size2D[1] = 241;\n\n  itk::Size<3>  size3D;\n  size3D[0] = 123;\n  size3D[1] = 241;\n  size3D[2] = 10;\n  \n  itk::Size<4>  sizeND;\n  sizeND[0] = 100;\n  sizeND[1] = 100;\n  sizeND[2] = 4;\n  sizeND[3] = 3;\n  \n  itk::Index<2> orig2D;\n  orig2D[0] = 0;\n  orig2D[1] = 0;\n\n  itk::Index<3> orig3D;\n  orig3D[0] = 0;\n  orig3D[1] = 0;\n  orig3D[2] = 0;\n  \n  itk::Index<4> origND;\n  origND[0] = 0;\n  origND[1] = 0;\n  origND[2] = 0;\n  origND[3] = 0;\n  \n  Region2D.SetSize(size2D);\n  Region3D.SetSize(size3D);\n  RegionND.SetSize(sizeND);\n  \n  Region2D.SetIndex(orig2D);\n  Region3D.SetIndex(orig3D);\n  RegionND.SetIndex(origND);\n\n  ImageType2D::Pointer image2D = ImageType2D::New();\n  ImageType3D::Pointer image3D = ImageType3D::New();\n  ImageTypeND::Pointer imageND = ImageTypeND::New();\n\n  image2D->SetLargestPossibleRegion(Region2D);\n  image3D->SetLargestPossibleRegion(Region3D);\n  imageND->SetLargestPossibleRegion(RegionND);\n\n  image2D->SetBufferedRegion(Region2D);\n  image3D->SetBufferedRegion(Region3D);\n  imageND->SetBufferedRegion(RegionND);\n\n  image2D->SetRequestedRegion(Region2D);\n  image3D->SetRequestedRegion(Region3D);\n  imageND->SetRequestedRegion(RegionND);\n\n  image2D->Allocate();\n  image3D->Allocate();\n  imageND->Allocate();\n\n  itk::ImageRegionIterator<ImageType2D> it2D(image2D,\n                                          image2D->GetRequestedRegion());\n  itk::ImageRegionIterator<ImageType3D> it3D(image3D,\n                                          image3D->GetRequestedRegion());\n  itk::ImageRegionIterator<ImageTypeND> itND(imageND,\n                                          imageND->GetRequestedRegion());\n\n  println(\"Initializing some images\");\n  \n  for (it2D = it2D.Begin(); it2D != it2D.End(); ++it2D) it2D.Set( 1.0f );\n  for (it3D = it3D.Begin(); it3D != it3D.End(); ++it3D) it3D.Set( 1.0f );\n  for (itND = itND.Begin(); itND != itND.End(); ++itND) itND.Set( 1.0f );\n\n  \/\/ Set up some neighborhood iterators\n  println(\"Setting up some neighborhood iterators\");\n  itk::Offset<2> orig2Dm;\n  orig2Dm[0] = 55;\n  orig2Dm[1] = 55;\n  \n  itk::Offset<3> orig3Dm;\n  orig3Dm[0] = 55;\n  orig3Dm[1] = 55;\n  orig3Dm[2] = 5;\n  \n  itk::Offset<4> origNDm;\n  origNDm[0] = 0;\n  origNDm[1] = 0;\n  origNDm[2] = 0;\n  origNDm[3] = 1;\n\n  itk::Size<2> sz2;\n  sz2[0] = 2;\n  sz2[1] = 3;\n  \n  itk::Size<3> sz3;\n  sz3[0] = 2;\n  sz3[1] = 3;\n  sz3[2] = 1;\n  \n  itk::Size<4> szN;\n  szN[0] = 1;\n  szN[1] = 3;\n  szN[2] = 1;\n  szN[3] = 1;\n\n  itk::RegionNeighborhoodIterator<ImageType2D> rni2D(sz2, image2D,\n                                           image2D->GetRequestedRegion());\n  itk::RandomAccessNeighborhoodIterator<ImageType3D> rni3D(sz3, image3D,\n                                           image3D->GetRequestedRegion());\n  itk::RandomAccessNeighborhoodIterator<ImageTypeND> rniND(szN, imageND,\n                                           imageND->GetRequestedRegion());\n\n  rniND.Print(std::cout);\n\n  println(\"Grabbing some neighborhoods\");\n  itk::Neighborhood<float, 2> n2 = rni2D.GetNeighborhood();\n  rni3D += orig3Dm;\n  itk::Neighborhood<float, 3> n3 = rni3D.GetNeighborhood();\n  std::cout << imageND << std::endl;\n  rniND += origNDm;\n  rniND.Print(std::cout);\n  std::cout << rniND.Center() << std::endl;\n  itk::Neighborhood<float, 4> nN = rniND.GetNeighborhood();\n  nN.Print(std::cout);\n\n  \/\/ Test inner product\n  println(\"Testing inner product variations\");\n  itk::DerivativeOperator<float, 2> d2D;\n  itk::DerivativeOperator<float, 3> d3D;\n  itk::DerivativeOperator<float, 4> dND;\n\n  d2D.SetDirection(0);\n  d3D.SetDirection(0);\n  dND.SetDirection(0);\n  \n  d2D.SetOrder(1);\n  d3D.SetOrder(1);\n  dND.SetOrder(1);\n\n  d2D.CreateDirectional();\n  d3D.CreateDirectional();\n  dND.CreateDirectional();\n  \n  itk::SmartRegionNeighborhoodIterator<ImageType2D>\n    rni2Dd(d2D.GetRadius(), image2D, image2D->GetRequestedRegion());\n  itk::SmartRegionNeighborhoodIterator<ImageType3D>\n    rni3Dd(d3D.GetRadius(), image3D, image3D->GetRequestedRegion());\n  itk::SmartRegionNeighborhoodIterator<ImageTypeND>\n    rniNDd(dND.GetRadius(), imageND, imageND->GetRequestedRegion());\n\n  println(\"A\");\n  itk::NeighborhoodAlgorithm\n    ::IteratorInnerProduct<itk::NeighborhoodIterator<ImageType2D>,\n    itk::Neighborhood<float, 2> > ipi2D;\n  ipi2D(rni2Dd, d2D);\n\n  println(\"B\");\n  itk::NeighborhoodAlgorithm\n    ::InnerProduct<itk::Neighborhood<float, 2>, itk::Neighborhood<float,2> >\n    ipn2D;\n  n2 = rni2Dd.GetNeighborhood();\n  ipn2D(n2, d2D);\n\n  println(\"C\");\n  itk::NeighborhoodAlgorithm\n    ::IteratorInnerProduct<itk::NeighborhoodIterator<ImageType3D>,\n    itk::Neighborhood<float, 3> > ipi3D;\n  ipi3D(rni3Dd, d3D);\n\n  println(\"D\");\n  itk::NeighborhoodAlgorithm\n    ::InnerProduct<itk::Neighborhood<float, 3>,\n    itk::Neighborhood<float, 3> > ipn3D;\n  n3 = rni3Dd.GetNeighborhood();\n  ipn3D(n3, d3D);\n\n  println(\"E\");\n  itk::NeighborhoodAlgorithm\n    ::IteratorInnerProduct<itk::NeighborhoodIterator<ImageTypeND>,\n    itk::Neighborhood<float, 4> > ipiND;\n  ipiND(rniNDd, dND);\n\n  println(\"F\");\n  itk::NeighborhoodAlgorithm\n    ::InnerProduct<itk::Neighborhood<float, 4>,\n    itk::Neighborhood<float, 4> > ipnND;\n  nN = rniNDd.GetNeighborhood();\n  ipnND(nN, dND);\n  \n  println(\"G\");\n  itk::NeighborhoodAlgorithm\n    ::BoundsCheckingIteratorInnerProduct<itk::\n    SmartRegionNeighborhoodIterator<ImageTypeND>,\n    itk::Neighborhood<float, 4> > ipibND;\n  ipibND(rniNDd, dND);\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\nThis file is part of Groho, a simulator for inter-planetary travel and warfare.\nCopyright (c) 2017-2018 by Kaushik Ghose. Some rights reserved, see LICENSE\n\nThis class sets up a common interface for dealing with Orreries.\n\nIt provides a uniform interface where by\n    - We can load Orrery model(s) from disk\n    - Obtain a list of GM and (x, y, z) data for all bodies in the Orrery\n      at a given time point\n*\/\n\n#pragma once\n\n#include <string>\n#include <vector>\n\n#include \"vector.hpp\"\n\nnamespace orrery {\n\nstruct OrreryBody {\n    std::string name; \/\/ Human readable name for body\n    int         code; \/\/ SPK code for body (optional)\n    float       GM;   \/\/ GM value for body\n    float       r;    \/\/ Radius of body (for collision tests)\n    bool real_body; \/\/ Is this a real solar system body for display purposes and\n                    \/\/ gravitational pull computations ?\n    sim::Vector pos; \/\/ Position referenced to solar system barycenter\n};\n\ntypedef std::vector<OrreryBody> OrreryBodyVec;\n\nclass Orrery {\n\nprotected:\n    bool          ok;\n    OrreryBodyVec bodies;\n\npublic:\n    Orrery() { ok = false; }\n    bool is_ok() { return ok; }\n\n    \/\/ Given a model file path, load this orrery file\n    \/\/ Return false if an error occurs while loading the file\n    virtual bool\n    load_orrery_model(std::string fname, double begin_s, double end_s)\n        = 0;\n\n    \/\/ Fill out the (x, y, z) of each Orrery body and return us an immutable\n    \/\/ vector containing this information.\n    virtual const OrreryBodyVec& get_orrery_at(double s) = 0;\n};\n}<commit_msg>Implement function to return orrery body list<commit_after>\/*\nThis file is part of Groho, a simulator for inter-planetary travel and warfare.\nCopyright (c) 2017-2018 by Kaushik Ghose. Some rights reserved, see LICENSE\n\nThis class sets up a common interface for dealing with Orreries.\n\nIt provides a uniform interface where by\n    - We can load Orrery model(s) from disk\n    - Obtain a list of GM and (x, y, z) data for all bodies in the Orrery\n      at a given time point\n*\/\n\n#pragma once\n\n#include <string>\n#include <vector>\n\n#include \"vector.hpp\"\n\nnamespace orrery {\n\nstruct OrreryBody {\n    std::string name; \/\/ Human readable name for body\n    int         code; \/\/ SPK code for body (optional)\n    float       GM;   \/\/ GM value for body\n    float       r;    \/\/ Radius of body (for collision tests)\n    bool real_body; \/\/ Is this a real solar system body for display purposes and\n                    \/\/ gravitational pull computations ?\n    sim::Vector pos; \/\/ Position referenced to solar system barycenter\n};\n\ntypedef std::vector<OrreryBody> OrreryBodyVec;\n\nclass Orrery {\n\nprotected:\n    bool          ok;\n    OrreryBodyVec bodies;\n\npublic:\n    Orrery() { ok = false; }\n    bool is_ok() { return ok; }\n\n    \/\/ Given a model file path, load this orrery file\n    \/\/ Return false if an error occurs while loading the file\n    virtual bool\n    load_orrery_model(std::string fname, double begin_s, double end_s)\n        = 0;\n\n    \/\/ Just return the list of bodies with the positions in an undefined state\n    const OrreryBodyVec& get_orrery() { return bodies; }\n\n    \/\/ Fill out the (x, y, z) of each Orrery body and return us an immutable\n    \/\/ vector containing this information.\n    virtual const OrreryBodyVec& get_orrery_at(double s) = 0;\n};\n}<|endoftext|>"}
{"text":"<commit_before>#include \"ArtificialIntelligence.hpp\"\n#include \"Board.hpp\"\n#include \"Game.hpp\"\n\n#include <QDebug>\n\n#include <algorithm>\n#include <memory>\n#include <limits>\n\nnamespace Game\n{\nnamespace FourInALine\n{\n\n\/**\n * Create a new artificial intelligence using the given search depth.\n *\n * @param searchDepth The search depth to use.\n *\/\nArtificialIntelligence::ArtificialIntelligence(unsigned int searchDepth)\n\t: searchDepth(searchDepth)\n{\n\n}\n\n\/**\n * Frees all used resources.\n *\/\nArtificialIntelligence::~ArtificialIntelligence()\n{\n\n}\n\n\/**\n * Sets the search depth to the given search depth.\n *\n * @param searchDepth The new search depth.\n *\/\nvoid ArtificialIntelligence::setSearchDepth(unsigned int searchDepth)\n{\n\tthis->searchDepth = searchDepth;\n}\n\n\/**\n * Returns the search depth.\n *\n * @return Search depth.\n *\/\nunsigned int ArtificialIntelligence::getSearchDepth() const\n{\n\treturn this->searchDepth;\n}\n\n\/**\n * Computes the next best move for the given game.\n *\n * @param game The game to evaluate.\n * @return Column index.\n *\/\nunsigned int ArtificialIntelligence::computeNextMove(const Game& game) const\n{\n\tScoredMovesType scoredMoves;\n\tScoredMoveType bestMove;\n\tstd::shared_ptr<const Board> board = game.getBoard();\n\tBoard myBoard(*board);\n\tunsigned int player = game.getCurrentPlayer();\n\n\tscoredMoves = this->minimax(Node::MAX_NODE, myBoard, player, this->searchDepth,\n\t\t\t\t\t\t\t\tstd::numeric_limits<ScoreType>::min(),\n\t\t\t\t\t\t\t\tstd::numeric_limits<ScoreType>::max());\n\n\tbestMove = this->findBestMove(Node::MAX_NODE, scoredMoves);\n\n\treturn bestMove.first;\n}\n\n\/**\n * Returns the other player.\n *\n * @param player The player.\n * @return The other player.\n *\/\nArtificialIntelligence::PlayerType\nArtificialIntelligence::getOtherPlayer(ArtificialIntelligence::PlayerType player) const\n{\n\treturn (player == Game::PLAYER_ONE) ? Game::PLAYER_TWO : Game::PLAYER_ONE;\n}\n\n\/**\n * Finds and returns the best move in the given set of moves.\n *\n * For minimizing nodes this method returns the move with the lowest score, for maximizing nodes\n * the move with the highest score is returned.\n *\n * @param node Whether to look for the move with the minimum score (Node::MIN_NODE) or the maximum\n *        score (Node::MAX_NODE).\n * @param scoredMoves List of moves.\n * @return The scored move with the maximum\/minimum (see node) score.\n *\/\nArtificialIntelligence::ScoredMoveType\nArtificialIntelligence::findBestMove(ArtificialIntelligence::Node node,\n\t\t\t\t\t\t\t\t\t const ArtificialIntelligence::ScoredMovesType& scoredMoves) const\n{\n\tScoredMoveType result;\n\n\tauto compareMoves = [](const ScoredMoveType& move1, const ScoredMoveType& move2)\n\t{\n\t\treturn move1.second < move2.second;\n\t};\n\n\tif (scoredMoves.empty())\n\t{\n\t\tthrow std::runtime_error(\"Tried to find the best move in an empty list of moves.\");\n\t}\n\n\tif (node == Node::MIN_NODE)\n\t{\n\t\tresult = *std::min_element(scoredMoves.cbegin(), scoredMoves.cend(), compareMoves);\n\t}\n\telse\n\t{\n\t\tresult = *std::max_element(scoredMoves.cbegin(), scoredMoves.cend(), compareMoves);\n\t}\n\n\treturn result;\n}\n\n\/**\n * Returns a list of scored moves.\n *\n * This method is implementing the minimax-algorithm.\n *\n * First it will create a list of possible moves on the given board. If the remaining search depth\n * is greater than 0 and there are possible moves, it will iterate over the moves and execute and\n * score them using computeScore(). The result is saved in a list which is returned at the end.\n *\n * Each time a move is scored, it is checked whether the branch can be pruned using\n * alpha-beta-pruning.\n *\n * @param node Whether this node is minimizing or maximizing.\n * @param board The board to evaluate.\n * @param player The current player (who made the last move on the board).\n * @param depth Remaining search depth.\n * @param alpha Maximum score the maximizing player is assured of.\n * @param beta Minimum score the minimizing player is assured of.\n * @return List of scored moves.\n * @see ArtificialIntelligence::canPruneBranch() Alpha-beta-pruning.\n *\/\nArtificialIntelligence::ScoredMovesType\nArtificialIntelligence::minimax(ArtificialIntelligence::Node node, const Board& board,\n\t\t\t\t\t\t\t\tArtificialIntelligence::PlayerType player, unsigned int depth,\n\t\t\t\t\t\t\t\tScoreType alpha, ScoreType beta) const\n{\n\tArtificialIntelligence::ScoredMovesType result;\n\tstd::vector<unsigned int> possibleMoves = board.getAvailableColumns();\n\n\t\/\/ Return an empty set of results when:\n\t\/\/\n\t\/\/ - The search depth has been exceeded.\n\t\/\/ - No more moves are possible (board full).\n\t\/\/ - There is a winner.\n\n\tif (depth > 0 && possibleMoves.size() > 0 && board.findWinningCells().isEmpty())\n\t{\n\t\tfor(auto it = possibleMoves.begin(); it != possibleMoves.end(); ++it)\n\t\t{\n\t\t\tBoard boardAfterMove(board);\n\n\t\t\tboardAfterMove.dropToken(*it, player);\n\n\t\t\tScoreType score = this->computeScore(node, boardAfterMove, player, depth, alpha, beta);\n\t\t\tresult[*it] = score;\n\n\t\t\tif (this->canPruneBranch(node, score, alpha, beta))\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn result;\n}\n\n\/**\n * Computes and returns the score of the given board.\n *\n * This method is part of the minimax-algorithm. It will reduce the given depth by one and\n * it will call the minimax algorithm again with the opposite node type and player.\n * Thereby the minimax-algorithm is always alternately called with the minimizing and maximizing\n * player and in minimizing and maximizing mode.\n *\n * When the minimax algorithm returns no results that means that either the search depth has been\n * exceeded or no more moves were possible. In that case the given board is evaluated and the\n * score is returned.\n *\n * When the minimax algorithm returns a list of scored moves, the best move is selected and\n * returned. If the given node type is minimizing, the move with the lowest score is returned, if\n * the given node type is maximizing, the move with the highest score is returned.\n *\n * @param node Whether this node is minimizing or maximizing.\n * @param board The board to evaluate.\n * @param player The current player (who made the last move on the board).\n * @param depth Remaining search depth.\n * @param alpha Maximum score the maximizing player is assured of.\n * @param beta Minimum score the minimizing player is assured of.\n * @return The computed score.\n *\/\nArtificialIntelligence::ScoreType\nArtificialIntelligence::computeScore(ArtificialIntelligence::Node node, const Board& board,\n\t\t\t\t\t\t\t\t\t ArtificialIntelligence::PlayerType player, unsigned int depth,\n\t\t\t\t\t\t\t\t\t ScoreType alpha, ScoreType beta) const\n{\n\tScoreType score;\n\tScoredMovesType scoredMoves;\n\tNode childNode = (node == Node::MAX_NODE) ? Node::MIN_NODE : Node::MAX_NODE;\n\tPlayerType aiPlayer = (node == Node::MAX_NODE) ? player : this->getOtherPlayer(player);\n\n\tscoredMoves = this->minimax(childNode, board, this->getOtherPlayer(player), depth - 1, alpha, beta);\n\tif (scoredMoves.empty())\n\t{\n\t\t\/\/ No more moves were possible or depth exceeded.\n\n\t\tscore = this->evaluateBoard(board, aiPlayer);\n\t}\n\telse\n\t{\n\t\tscore = this->findBestMove(childNode, scoredMoves).second;\n\t}\n\n\treturn score;\n}\n\n\/**\n * Evaluates the given board and returns a score for the given player.\n *\n * When the given player won the game the maximum score is returned, when the other player won\n * the minimum possible score is returned. Otherwise, the result is the score of the player\n * subtracted by the score of the other player.\n *\n * @param board The board to evaluate.\n * @param player The player for which the score should be computed.\n * @return The computed score.\n *\/\nArtificialIntelligence::ScoreType\nArtificialIntelligence::evaluateBoard(const Board& board, ArtificialIntelligence::PlayerType player) const\n{\n\tScoreType result;\n\tPlayerType otherPlayer = this->getOtherPlayer(player);\n\n\tint playerScore = this->computePlayerScore(board, player);\n\tint otherPlayerScore = this->computePlayerScore(board, otherPlayer);\n\n\t\/\/ If one of the players won, return the score of the winner, otherwise, subtract the score\n\t\/\/ of the other player from the score of the player.\n\n\tif (playerScore == std::numeric_limits<ScoreType>::max())\n\t{\n\t\tresult = std::numeric_limits<ScoreType>::max();\n\t}\n\telse if (otherPlayerScore == std::numeric_limits<ScoreType>::max())\n\t{\n\t\tresult = std::numeric_limits<ScoreType>::min();\n\t}\n\telse\n\t{\n\t\tresult = playerScore - otherPlayerScore;\n\t}\n\n\treturn result;\n}\n\n\/**\n * Iterates over all cells of the given board and computes a score for the given player.\n *\n * The higher the returned score, the higher is the probability that the given player wins the game.\n *\n * The algorithm iterates over all horizontal\/vertical\/diagonal rows in the board and then checks\n * how many consecutive cells are owned by the player or empty (but not owned by the other player).\n * Whenever the algorithm finds 4 consecutive cells containing the player's token or an empty token,\n * it will increase the score depending on the amount of tokens in the 4 cells that belong to the\n * player.\n *\n * If in 4 consecutive tokens, 1 is owned by the player, the score is increased by 1, when 2 tokens\n * are owned by the player it is increased by 10. When the player owns 3 of the 4 tokens, the score\n * is increased by 100 and if the player owns all 4 tokens the score is set to the maximum score\n * (player wins).\n *\n * @param board The board to evaluate.\n * @param player The player for which the score is calculated.\n * @return Score for the given board\/player.\n *\/\nArtificialIntelligence::ScoreType\nArtificialIntelligence::computePlayerScore(const Board& board, unsigned int player) const\n{\n\tScoreType score = 0;\n\tstd::vector<CellSet> sets = board.getAllRows();\n\tstd::vector<CellSet>::const_iterator i;\n\tCellSetIterator j;\n\tunsigned int nConsecutive;\n\n\tfor (i = sets.begin(); i != sets.end() && score != std::numeric_limits<ScoreType>::max(); i++)\n\t{\n\t\tnConsecutive = 0;\n\t\tfor(j = i->begin(); j != i->end() && score != std::numeric_limits<ScoreType>::max(); j++)\n\t\t{\n\t\t\tif (Board::CELL_EMPTY == *j || player == *j)\n\t\t\t{\n\t\t\t\tnConsecutive++;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tnConsecutive = 0;\n\t\t\t}\n\n\t\t\tif (nConsecutive >= 4)\n\t\t\t{\n\t\t\t\tint value = 0;\n\n\t\t\t\tvalue += (i->getContent(j.getIndex() - 3) == player) ? 1 : 0;\n\t\t\t\tvalue += (i->getContent(j.getIndex() - 2) == player) ? 1 : 0;\n\t\t\t\tvalue += (i->getContent(j.getIndex() - 1) == player) ? 1 : 0;\n\t\t\t\tvalue += (*j == player) ? 1 : 0;\n\n\t\t\t\tswitch(value)\n\t\t\t\t{\n\t\t\t\t\tcase 1: score += 1; break;\n\t\t\t\t\tcase 2: score += 10; break;\n\t\t\t\t\tcase 3: score += 100; break;\n\t\t\t\t\tcase 4: score = std::numeric_limits<ScoreType>::max();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn score;\n}\n\n\/**\n * Adjusts given alpha\/beta values if neccessary and returns whether the current branch can be\n * pruned.\n *\n * This method implements alpha-beta-pruning to reduce the amount of game situations that have to\n * be evaluated.\n *\n * The algorithm maintains two values, alpha and beta. Alpha is the maximum score that the maximizing\n * player is assured of and beta is the minimum score that the minimizing player is assured of.\n *\n * If a move is scored and it's score is below beta on a minimizing node, then the score becomes the\n * new beta. If a move on a maximizing node is scored and the score is higher than alpha, the score\n * becomes the new alpha value.\n *\n * The beta value therefore is the worst-case scenario for the maximizing player and the alpha value\n * is the worst-case scenario for the minimum player.\n *\n * When beta is lower than alpha on a minimizing node, that means that the score of the node is\n * lower than the maximum score that the maximizing player is assured of through another already\n * evaluated move. The maximizing player would not offer this move to the minimizing player, because\n * there is a better alternative. Therefore the branch does not have to be evaluated anymore, as it\n * has no influence on the final result.\n *\n * The same applies to an alpha value higher or equal the beta value on a maximizing node. The\n * minimizing player would not allow the maximizing player to make that move anyway, because it is\n * worse than another previously evaluated move.\n *\n * @param node Type of the current node (minimizing or maximizing).\n * @param score The score of the node.\n * @param alpha Maximum score the maximizing player is assured of.\n * @param beta Minimum score the minimizing player is assured of.\n * @return When the branch can be pruned true, otherwise false.\n *\/\nbool ArtificialIntelligence::canPruneBranch(ArtificialIntelligence::Node node,\n\t\t\t\t\t\t\t\t\t\t\tArtificialIntelligence::ScoreType score,\n\t\t\t\t\t\t\t\t\t\t\tArtificialIntelligence::ScoreType& alpha,\n\t\t\t\t\t\t\t\t\t\t\tArtificialIntelligence::ScoreType& beta) const\n{\n\tbool result = false;\n\n\tif (Node::MIN_NODE == node)\n\t{\n\t\t\/\/ Minimizing node.\n\n\t\tif (score < beta)\n\t\t{\n\t\t\t\/\/ The score of this node is lower than the minimum score the minimizing player is\n\t\t\t\/\/ assured of.\n\t\t\t\/\/\n\t\t\t\/\/ Adjust the minimum assured score for the minimizing player.\n\n\t\t\tbeta = score;\n\t\t}\n\n\t\tif (beta <= alpha)\n\t\t{\n\t\t\t\/\/ The score of this node is lower than the maximum score that the maximizing player is\n\t\t\t\/\/ assured of. The maximizing player would not allow the minimizing player to make this\n\t\t\t\/\/ move, because there is a better alternative.\n\t\t\t\/\/\n\t\t\t\/\/ Therefore this branch can be pruned, as it has no influence on the final result\n\t\t\t\/\/ (alpha cutoff).\n\n\t\t\tresult = true;\n\t\t}\n\t}\n\telse\n\t{\n\t\t\/\/ Maximizing node.\n\n\t\tif (score > alpha)\n\t\t{\n\t\t\t\/\/ The score of this node is higher than the maximum score the maximizing player is\n\t\t\t\/\/ currently assured of.\n\t\t\t\/\/\n\t\t\t\/\/ Adjust the maximum assured score for the maximizing player.\n\n\t\t\talpha = score;\n\t\t}\n\n\t\tif (alpha >= beta)\n\t\t{\n\t\t\t\/\/ The score of this node is higher than the minimum score that the minimizing player is\n\t\t\t\/\/ assured of. The minimizing player would not allow the maximizing player to make this\n\t\t\t\/\/ move, because there is a better alternative.\n\t\t\t\/\/\n\t\t\t\/\/ Therefore this branch can be pruned, as it has not influence on the final result\n\t\t\t\/\/ (beta cutoff).\n\n\t\t\tresult = true;\n\t\t}\n\t}\n\n\treturn result;\n}\n\n}\n}\n<commit_msg>Added missing include.<commit_after>#include \"ArtificialIntelligence.hpp\"\n#include \"Board.hpp\"\n#include \"Game.hpp\"\n\n#include <QDebug>\n\n#include <stdexcept>\n#include <algorithm>\n#include <memory>\n#include <limits>\n\nnamespace Game\n{\nnamespace FourInALine\n{\n\n\/**\n * Create a new artificial intelligence using the given search depth.\n *\n * @param searchDepth The search depth to use.\n *\/\nArtificialIntelligence::ArtificialIntelligence(unsigned int searchDepth)\n\t: searchDepth(searchDepth)\n{\n\n}\n\n\/**\n * Frees all used resources.\n *\/\nArtificialIntelligence::~ArtificialIntelligence()\n{\n\n}\n\n\/**\n * Sets the search depth to the given search depth.\n *\n * @param searchDepth The new search depth.\n *\/\nvoid ArtificialIntelligence::setSearchDepth(unsigned int searchDepth)\n{\n\tthis->searchDepth = searchDepth;\n}\n\n\/**\n * Returns the search depth.\n *\n * @return Search depth.\n *\/\nunsigned int ArtificialIntelligence::getSearchDepth() const\n{\n\treturn this->searchDepth;\n}\n\n\/**\n * Computes the next best move for the given game.\n *\n * @param game The game to evaluate.\n * @return Column index.\n *\/\nunsigned int ArtificialIntelligence::computeNextMove(const Game& game) const\n{\n\tScoredMovesType scoredMoves;\n\tScoredMoveType bestMove;\n\tstd::shared_ptr<const Board> board = game.getBoard();\n\tBoard myBoard(*board);\n\tunsigned int player = game.getCurrentPlayer();\n\n\tscoredMoves = this->minimax(Node::MAX_NODE, myBoard, player, this->searchDepth,\n\t\t\t\t\t\t\t\tstd::numeric_limits<ScoreType>::min(),\n\t\t\t\t\t\t\t\tstd::numeric_limits<ScoreType>::max());\n\n\tbestMove = this->findBestMove(Node::MAX_NODE, scoredMoves);\n\n\treturn bestMove.first;\n}\n\n\/**\n * Returns the other player.\n *\n * @param player The player.\n * @return The other player.\n *\/\nArtificialIntelligence::PlayerType\nArtificialIntelligence::getOtherPlayer(ArtificialIntelligence::PlayerType player) const\n{\n\treturn (player == Game::PLAYER_ONE) ? Game::PLAYER_TWO : Game::PLAYER_ONE;\n}\n\n\/**\n * Finds and returns the best move in the given set of moves.\n *\n * For minimizing nodes this method returns the move with the lowest score, for maximizing nodes\n * the move with the highest score is returned.\n *\n * @param node Whether to look for the move with the minimum score (Node::MIN_NODE) or the maximum\n *        score (Node::MAX_NODE).\n * @param scoredMoves List of moves.\n * @return The scored move with the maximum\/minimum (see node) score.\n *\/\nArtificialIntelligence::ScoredMoveType\nArtificialIntelligence::findBestMove(ArtificialIntelligence::Node node,\n\t\t\t\t\t\t\t\t\t const ArtificialIntelligence::ScoredMovesType& scoredMoves) const\n{\n\tScoredMoveType result;\n\n\tauto compareMoves = [](const ScoredMoveType& move1, const ScoredMoveType& move2)\n\t{\n\t\treturn move1.second < move2.second;\n\t};\n\n\tif (scoredMoves.empty())\n\t{\n\t\tthrow std::runtime_error(\"Tried to find the best move in an empty list of moves.\");\n\t}\n\n\tif (node == Node::MIN_NODE)\n\t{\n\t\tresult = *std::min_element(scoredMoves.cbegin(), scoredMoves.cend(), compareMoves);\n\t}\n\telse\n\t{\n\t\tresult = *std::max_element(scoredMoves.cbegin(), scoredMoves.cend(), compareMoves);\n\t}\n\n\treturn result;\n}\n\n\/**\n * Returns a list of scored moves.\n *\n * This method is implementing the minimax-algorithm.\n *\n * First it will create a list of possible moves on the given board. If the remaining search depth\n * is greater than 0 and there are possible moves, it will iterate over the moves and execute and\n * score them using computeScore(). The result is saved in a list which is returned at the end.\n *\n * Each time a move is scored, it is checked whether the branch can be pruned using\n * alpha-beta-pruning.\n *\n * @param node Whether this node is minimizing or maximizing.\n * @param board The board to evaluate.\n * @param player The current player (who made the last move on the board).\n * @param depth Remaining search depth.\n * @param alpha Maximum score the maximizing player is assured of.\n * @param beta Minimum score the minimizing player is assured of.\n * @return List of scored moves.\n * @see ArtificialIntelligence::canPruneBranch() Alpha-beta-pruning.\n *\/\nArtificialIntelligence::ScoredMovesType\nArtificialIntelligence::minimax(ArtificialIntelligence::Node node, const Board& board,\n\t\t\t\t\t\t\t\tArtificialIntelligence::PlayerType player, unsigned int depth,\n\t\t\t\t\t\t\t\tScoreType alpha, ScoreType beta) const\n{\n\tArtificialIntelligence::ScoredMovesType result;\n\tstd::vector<unsigned int> possibleMoves = board.getAvailableColumns();\n\n\t\/\/ Return an empty set of results when:\n\t\/\/\n\t\/\/ - The search depth has been exceeded.\n\t\/\/ - No more moves are possible (board full).\n\t\/\/ - There is a winner.\n\n\tif (depth > 0 && possibleMoves.size() > 0 && board.findWinningCells().isEmpty())\n\t{\n\t\tfor(auto it = possibleMoves.begin(); it != possibleMoves.end(); ++it)\n\t\t{\n\t\t\tBoard boardAfterMove(board);\n\n\t\t\tboardAfterMove.dropToken(*it, player);\n\n\t\t\tScoreType score = this->computeScore(node, boardAfterMove, player, depth, alpha, beta);\n\t\t\tresult[*it] = score;\n\n\t\t\tif (this->canPruneBranch(node, score, alpha, beta))\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn result;\n}\n\n\/**\n * Computes and returns the score of the given board.\n *\n * This method is part of the minimax-algorithm. It will reduce the given depth by one and\n * it will call the minimax algorithm again with the opposite node type and player.\n * Thereby the minimax-algorithm is always alternately called with the minimizing and maximizing\n * player and in minimizing and maximizing mode.\n *\n * When the minimax algorithm returns no results that means that either the search depth has been\n * exceeded or no more moves were possible. In that case the given board is evaluated and the\n * score is returned.\n *\n * When the minimax algorithm returns a list of scored moves, the best move is selected and\n * returned. If the given node type is minimizing, the move with the lowest score is returned, if\n * the given node type is maximizing, the move with the highest score is returned.\n *\n * @param node Whether this node is minimizing or maximizing.\n * @param board The board to evaluate.\n * @param player The current player (who made the last move on the board).\n * @param depth Remaining search depth.\n * @param alpha Maximum score the maximizing player is assured of.\n * @param beta Minimum score the minimizing player is assured of.\n * @return The computed score.\n *\/\nArtificialIntelligence::ScoreType\nArtificialIntelligence::computeScore(ArtificialIntelligence::Node node, const Board& board,\n\t\t\t\t\t\t\t\t\t ArtificialIntelligence::PlayerType player, unsigned int depth,\n\t\t\t\t\t\t\t\t\t ScoreType alpha, ScoreType beta) const\n{\n\tScoreType score;\n\tScoredMovesType scoredMoves;\n\tNode childNode = (node == Node::MAX_NODE) ? Node::MIN_NODE : Node::MAX_NODE;\n\tPlayerType aiPlayer = (node == Node::MAX_NODE) ? player : this->getOtherPlayer(player);\n\n\tscoredMoves = this->minimax(childNode, board, this->getOtherPlayer(player), depth - 1, alpha, beta);\n\tif (scoredMoves.empty())\n\t{\n\t\t\/\/ No more moves were possible or depth exceeded.\n\n\t\tscore = this->evaluateBoard(board, aiPlayer);\n\t}\n\telse\n\t{\n\t\tscore = this->findBestMove(childNode, scoredMoves).second;\n\t}\n\n\treturn score;\n}\n\n\/**\n * Evaluates the given board and returns a score for the given player.\n *\n * When the given player won the game the maximum score is returned, when the other player won\n * the minimum possible score is returned. Otherwise, the result is the score of the player\n * subtracted by the score of the other player.\n *\n * @param board The board to evaluate.\n * @param player The player for which the score should be computed.\n * @return The computed score.\n *\/\nArtificialIntelligence::ScoreType\nArtificialIntelligence::evaluateBoard(const Board& board, ArtificialIntelligence::PlayerType player) const\n{\n\tScoreType result;\n\tPlayerType otherPlayer = this->getOtherPlayer(player);\n\n\tint playerScore = this->computePlayerScore(board, player);\n\tint otherPlayerScore = this->computePlayerScore(board, otherPlayer);\n\n\t\/\/ If one of the players won, return the score of the winner, otherwise, subtract the score\n\t\/\/ of the other player from the score of the player.\n\n\tif (playerScore == std::numeric_limits<ScoreType>::max())\n\t{\n\t\tresult = std::numeric_limits<ScoreType>::max();\n\t}\n\telse if (otherPlayerScore == std::numeric_limits<ScoreType>::max())\n\t{\n\t\tresult = std::numeric_limits<ScoreType>::min();\n\t}\n\telse\n\t{\n\t\tresult = playerScore - otherPlayerScore;\n\t}\n\n\treturn result;\n}\n\n\/**\n * Iterates over all cells of the given board and computes a score for the given player.\n *\n * The higher the returned score, the higher is the probability that the given player wins the game.\n *\n * The algorithm iterates over all horizontal\/vertical\/diagonal rows in the board and then checks\n * how many consecutive cells are owned by the player or empty (but not owned by the other player).\n * Whenever the algorithm finds 4 consecutive cells containing the player's token or an empty token,\n * it will increase the score depending on the amount of tokens in the 4 cells that belong to the\n * player.\n *\n * If in 4 consecutive tokens, 1 is owned by the player, the score is increased by 1, when 2 tokens\n * are owned by the player it is increased by 10. When the player owns 3 of the 4 tokens, the score\n * is increased by 100 and if the player owns all 4 tokens the score is set to the maximum score\n * (player wins).\n *\n * @param board The board to evaluate.\n * @param player The player for which the score is calculated.\n * @return Score for the given board\/player.\n *\/\nArtificialIntelligence::ScoreType\nArtificialIntelligence::computePlayerScore(const Board& board, unsigned int player) const\n{\n\tScoreType score = 0;\n\tstd::vector<CellSet> sets = board.getAllRows();\n\tstd::vector<CellSet>::const_iterator i;\n\tCellSetIterator j;\n\tunsigned int nConsecutive;\n\n\tfor (i = sets.begin(); i != sets.end() && score != std::numeric_limits<ScoreType>::max(); i++)\n\t{\n\t\tnConsecutive = 0;\n\t\tfor(j = i->begin(); j != i->end() && score != std::numeric_limits<ScoreType>::max(); j++)\n\t\t{\n\t\t\tif (Board::CELL_EMPTY == *j || player == *j)\n\t\t\t{\n\t\t\t\tnConsecutive++;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tnConsecutive = 0;\n\t\t\t}\n\n\t\t\tif (nConsecutive >= 4)\n\t\t\t{\n\t\t\t\tint value = 0;\n\n\t\t\t\tvalue += (i->getContent(j.getIndex() - 3) == player) ? 1 : 0;\n\t\t\t\tvalue += (i->getContent(j.getIndex() - 2) == player) ? 1 : 0;\n\t\t\t\tvalue += (i->getContent(j.getIndex() - 1) == player) ? 1 : 0;\n\t\t\t\tvalue += (*j == player) ? 1 : 0;\n\n\t\t\t\tswitch(value)\n\t\t\t\t{\n\t\t\t\t\tcase 1: score += 1; break;\n\t\t\t\t\tcase 2: score += 10; break;\n\t\t\t\t\tcase 3: score += 100; break;\n\t\t\t\t\tcase 4: score = std::numeric_limits<ScoreType>::max();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn score;\n}\n\n\/**\n * Adjusts given alpha\/beta values if neccessary and returns whether the current branch can be\n * pruned.\n *\n * This method implements alpha-beta-pruning to reduce the amount of game situations that have to\n * be evaluated.\n *\n * The algorithm maintains two values, alpha and beta. Alpha is the maximum score that the maximizing\n * player is assured of and beta is the minimum score that the minimizing player is assured of.\n *\n * If a move is scored and it's score is below beta on a minimizing node, then the score becomes the\n * new beta. If a move on a maximizing node is scored and the score is higher than alpha, the score\n * becomes the new alpha value.\n *\n * The beta value therefore is the worst-case scenario for the maximizing player and the alpha value\n * is the worst-case scenario for the minimum player.\n *\n * When beta is lower than alpha on a minimizing node, that means that the score of the node is\n * lower than the maximum score that the maximizing player is assured of through another already\n * evaluated move. The maximizing player would not offer this move to the minimizing player, because\n * there is a better alternative. Therefore the branch does not have to be evaluated anymore, as it\n * has no influence on the final result.\n *\n * The same applies to an alpha value higher or equal the beta value on a maximizing node. The\n * minimizing player would not allow the maximizing player to make that move anyway, because it is\n * worse than another previously evaluated move.\n *\n * @param node Type of the current node (minimizing or maximizing).\n * @param score The score of the node.\n * @param alpha Maximum score the maximizing player is assured of.\n * @param beta Minimum score the minimizing player is assured of.\n * @return When the branch can be pruned true, otherwise false.\n *\/\nbool ArtificialIntelligence::canPruneBranch(ArtificialIntelligence::Node node,\n\t\t\t\t\t\t\t\t\t\t\tArtificialIntelligence::ScoreType score,\n\t\t\t\t\t\t\t\t\t\t\tArtificialIntelligence::ScoreType& alpha,\n\t\t\t\t\t\t\t\t\t\t\tArtificialIntelligence::ScoreType& beta) const\n{\n\tbool result = false;\n\n\tif (Node::MIN_NODE == node)\n\t{\n\t\t\/\/ Minimizing node.\n\n\t\tif (score < beta)\n\t\t{\n\t\t\t\/\/ The score of this node is lower than the minimum score the minimizing player is\n\t\t\t\/\/ assured of.\n\t\t\t\/\/\n\t\t\t\/\/ Adjust the minimum assured score for the minimizing player.\n\n\t\t\tbeta = score;\n\t\t}\n\n\t\tif (beta <= alpha)\n\t\t{\n\t\t\t\/\/ The score of this node is lower than the maximum score that the maximizing player is\n\t\t\t\/\/ assured of. The maximizing player would not allow the minimizing player to make this\n\t\t\t\/\/ move, because there is a better alternative.\n\t\t\t\/\/\n\t\t\t\/\/ Therefore this branch can be pruned, as it has no influence on the final result\n\t\t\t\/\/ (alpha cutoff).\n\n\t\t\tresult = true;\n\t\t}\n\t}\n\telse\n\t{\n\t\t\/\/ Maximizing node.\n\n\t\tif (score > alpha)\n\t\t{\n\t\t\t\/\/ The score of this node is higher than the maximum score the maximizing player is\n\t\t\t\/\/ currently assured of.\n\t\t\t\/\/\n\t\t\t\/\/ Adjust the maximum assured score for the maximizing player.\n\n\t\t\talpha = score;\n\t\t}\n\n\t\tif (alpha >= beta)\n\t\t{\n\t\t\t\/\/ The score of this node is higher than the minimum score that the minimizing player is\n\t\t\t\/\/ assured of. The minimizing player would not allow the maximizing player to make this\n\t\t\t\/\/ move, because there is a better alternative.\n\t\t\t\/\/\n\t\t\t\/\/ Therefore this branch can be pruned, as it has not influence on the final result\n\t\t\t\/\/ (beta cutoff).\n\n\t\t\tresult = true;\n\t\t}\n\t}\n\n\treturn result;\n}\n\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <occa\/internal\/modes\/hip\/kernel.hpp>\n#include <occa\/internal\/modes\/hip\/device.hpp>\n#include <occa\/internal\/modes\/hip\/utils.hpp>\n#include <occa\/internal\/utils\/env.hpp>\n#include <occa\/internal\/io.hpp>\n#include <occa\/core\/base.hpp>\n\nnamespace occa {\n  namespace hip {\n    kernel::kernel(modeDevice_t *modeDevice_,\n                   const std::string &name_,\n                   const std::string &sourceFilename_,\n                   const occa::json &properties_) :\n      occa::launchedModeKernel_t(modeDevice_, name_, sourceFilename_, properties_),\n      hipModule(NULL),\n      hipFunction(NULL) {}\n\n    kernel::kernel(modeDevice_t *modeDevice_,\n                   const std::string &name_,\n                   const std::string &sourceFilename_,\n                   hipModule_t hipModule_,\n                   hipFunction_t hipFunction_,\n                   const occa::json &properties_) :\n      occa::launchedModeKernel_t(modeDevice_, name_, sourceFilename_, properties_),\n      hipModule(hipModule_),\n      hipFunction(hipFunction_) {}\n\n    kernel::~kernel() {\n      if (hipModule) {\n        OCCA_HIP_ERROR(\"Kernel (\" + name + \") : Unloading Module\",\n                       hipModuleUnload(hipModule));\n        hipModule = NULL;\n      }\n    }\n\n    hipStream_t& kernel::getHipStream() const {\n      return ((device*) modeDevice)->getHipStream();\n    }\n\n    int kernel::maxDims() const {\n      return 3;\n    }\n\n    dim kernel::maxOuterDims() const {\n      return dim(occa::UDIM_DEFAULT, occa::UDIM_DEFAULT, occa::UDIM_DEFAULT);\n    }\n\n    dim kernel::maxInnerDims() const {\n      static dim _maxInnerDims(0);\n      if (_maxInnerDims.x == 0) {\n        int maxSize;\n        int deviceID = properties[\"device_id\"];\n        hipDeviceProp_t props;\n        OCCA_HIP_ERROR(\"Getting device properties\",\n                       hipGetDeviceProperties(&props, deviceID));\n        maxSize = props.maxThreadsPerBlock;\n\n        _maxInnerDims.x = maxSize;\n      }\n      return _maxInnerDims;\n    }\n\n    void kernel::deviceRun() const {\n      const int args = (int) arguments.size();\n      if (!args) {\n        vArgs.resize(1);\n      } else if ((int) vArgs.size() < args) {\n        vArgs.resize(args);\n      }\n\n      \/\/ HIP expects kernel arguments to be byte-aligned so we add padding to arguments\n      char *dataPtr = (char*) &(vArgs[0]);\n      int padding = 0;\n      for (int i = 0; i < args; ++i) {\n        const kernelArgData &arg = arguments[i];\n        const udim_t argSize = arg.size();\n\n        size_t bytes;\n        if ((padding + argSize) <= sizeof(void*)) {\n          bytes = argSize;\n          padding = sizeof(void*) - padding - argSize;\n        } else {\n          bytes = sizeof(void*);\n          dataPtr += padding;\n          padding = 0;\n        }\n\n        ::memcpy(dataPtr, arg.ptr(), bytes);\n        dataPtr += bytes;\n      }\n\n      size_t size = vArgs.size() * sizeof(vArgs[0]);\n      void* config[] = {\n        (void*) HIP_LAUNCH_PARAM_BUFFER_POINTER, &(vArgs[0]),\n        (void*) HIP_LAUNCH_PARAM_BUFFER_SIZE, &size,\n        (void*) HIP_LAUNCH_PARAM_END\n      };\n\n      OCCA_HIP_ERROR(\"Launching Kernel\",\n                     hipModuleLaunchKernel(hipFunction,\n                                           outerDims.x, outerDims.y, outerDims.z,\n                                           innerDims.x, innerDims.y, innerDims.z,\n                                           0, getHipStream(),\n                                           NULL, (void**) &config));\n    }\n  }\n}\n<commit_msg>[HIP] Fix the way hip sets arguments, I broke it on #438 (#448)<commit_after>#include <occa\/internal\/modes\/hip\/kernel.hpp>\n#include <occa\/internal\/modes\/hip\/device.hpp>\n#include <occa\/internal\/modes\/hip\/utils.hpp>\n#include <occa\/internal\/utils\/env.hpp>\n#include <occa\/internal\/io.hpp>\n#include <occa\/core\/base.hpp>\n\nnamespace occa {\n  namespace hip {\n    kernel::kernel(modeDevice_t *modeDevice_,\n                   const std::string &name_,\n                   const std::string &sourceFilename_,\n                   const occa::json &properties_) :\n      occa::launchedModeKernel_t(modeDevice_, name_, sourceFilename_, properties_),\n      hipModule(NULL),\n      hipFunction(NULL) {}\n\n    kernel::kernel(modeDevice_t *modeDevice_,\n                   const std::string &name_,\n                   const std::string &sourceFilename_,\n                   hipModule_t hipModule_,\n                   hipFunction_t hipFunction_,\n                   const occa::json &properties_) :\n      occa::launchedModeKernel_t(modeDevice_, name_, sourceFilename_, properties_),\n      hipModule(hipModule_),\n      hipFunction(hipFunction_) {}\n\n    kernel::~kernel() {\n      if (hipModule) {\n        OCCA_HIP_ERROR(\"Kernel (\" + name + \") : Unloading Module\",\n                       hipModuleUnload(hipModule));\n        hipModule = NULL;\n      }\n    }\n\n    hipStream_t& kernel::getHipStream() const {\n      return ((device*) modeDevice)->getHipStream();\n    }\n\n    int kernel::maxDims() const {\n      return 3;\n    }\n\n    dim kernel::maxOuterDims() const {\n      return dim(occa::UDIM_DEFAULT, occa::UDIM_DEFAULT, occa::UDIM_DEFAULT);\n    }\n\n    dim kernel::maxInnerDims() const {\n      static dim _maxInnerDims(0);\n      if (_maxInnerDims.x == 0) {\n        int maxSize;\n        int deviceID = properties[\"device_id\"];\n        hipDeviceProp_t props;\n        OCCA_HIP_ERROR(\"Getting device properties\",\n                       hipGetDeviceProperties(&props, deviceID));\n        maxSize = props.maxThreadsPerBlock;\n\n        _maxInnerDims.x = maxSize;\n      }\n      return _maxInnerDims;\n    }\n\n    void kernel::deviceRun() const {\n      const int args = (int) arguments.size();\n      if (!args) {\n        vArgs.resize(1);\n      } else if ((int) vArgs.size() < args) {\n        vArgs.resize(args);\n      }\n\n      \/\/ HIP expects kernel arguments to be byte-aligned so we add padding to arguments\n      char *dataPtr = (char*) &(vArgs[0]);\n      int padding = 0;\n      for (int i = 0; i < args; ++i) {\n        const kernelArgData &arg = arguments[i];\n        const udim_t argSize = arg.size();\n\n        size_t bytes;\n        if ((padding + argSize) <= sizeof(void*)) {\n          bytes = argSize;\n          padding = sizeof(void*) - padding - argSize;\n        } else {\n          bytes = sizeof(void*);\n          dataPtr += padding;\n          padding = 0;\n        }\n\n        ::memcpy(dataPtr, &arg.value.value.int64_, bytes);\n        dataPtr += bytes;\n      }\n\n      size_t size = vArgs.size() * sizeof(vArgs[0]);\n      void* config[] = {\n        (void*) HIP_LAUNCH_PARAM_BUFFER_POINTER, &(vArgs[0]),\n        (void*) HIP_LAUNCH_PARAM_BUFFER_SIZE, &size,\n        (void*) HIP_LAUNCH_PARAM_END\n      };\n\n      OCCA_HIP_ERROR(\"Launching Kernel\",\n                     hipModuleLaunchKernel(hipFunction,\n                                           outerDims.x, outerDims.y, outerDims.z,\n                                           innerDims.x, innerDims.y, innerDims.z,\n                                           0, getHipStream(),\n                                           NULL, (void**) &config));\n    }\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2016.  All rights reserved\n *\/\n\/*\n * Note - used PUBLIC DOMAIN http:\/\/sourceforge.net\/projects\/libb64\/files\/libb64\/libb64\/libb64-1.2.src.zip\/download\n * code as a starting point.\n *\/\n#include    \"..\/..\/..\/StroikaPreComp.h\"\n\n#include    <algorithm>\n#include    <cstdlib>\n\n#include    \"..\/..\/..\/Containers\/Common.h\"\n#include    \"..\/..\/..\/DataExchange\/BadFormatException.h\"\n#include    \"..\/..\/..\/Debug\/Assertions.h\"\n#include    \"..\/..\/..\/Execution\/Exceptions.h\"\n#include    \"..\/..\/..\/Memory\/BLOB.h\"              \/\/ ONLY FOR QUICKHACK IMPL OF ENCODE...\n#include    \"..\/..\/..\/Memory\/SmallStackBuffer.h\"\n\n#include    \"Base64.h\"\n\n\nusing   namespace   Stroika::Foundation;\nusing   namespace   Stroika::Foundation::Containers;\nusing   namespace   Stroika::Foundation::Cryptography;\nusing   namespace   Stroika::Foundation::Cryptography::Encoding;\nusing   namespace   Stroika::Foundation::Cryptography::Encoding::Algorithm;\nusing   namespace   Stroika::Foundation::Memory;\n\n\n\n\n\/**\n *  IMPLEMENTATION NOTES:\n *\n *      The public domain (private) code in this file - is designed to operate in a STREAM mode. I've preserved that\n *  internally, evne though my current API doesnt work that way, because we will soon support a STREAM based API here,\n *  and that will fit perfectly.\n *\n *  @see    http:\/\/libb64.sourceforge.net\/ - which explains the design of the routines, and the queer nested loop \/ switch\n *          construct.\n *\n *      -- LGP 2011-06-21\n *\/\n\n\n\n\n\n\n\/*\n ********************************************************************************\n *************************** Encoding::DecodeBase64 *****************************\n ********************************************************************************\n *\/\nnamespace   {\n    enum base64_decodestep_ {\n        step_a, step_b, step_c, step_d\n    };\n    struct base64_decodestate_ {\n        base64_decodestep_  step;\n        Byte                plainchar;\n\n        base64_decodestate_ ()\n            : step (step_a)\n            , plainchar ('\\0')\n        {\n        }\n    };\n    int base64_decode_value_ (signed char value_in)\n    {\n        static const signed char kDecoding[] = {62, -1, -1, -1, 63, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, -1, -1, -1, -2, -1, -1, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, -1, -1, -1, -1, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51};\n        value_in -= 43;\n        if (value_in < 0 || value_in >= NEltsOf (kDecoding)) {\n            return -1;\n        }\n        Assert (0 <= value_in and value_in < NEltsOf (kDecoding));\n        return kDecoding[(int)value_in];\n    }\n    size_t base64_decode_block_ (const signed char* code_in, size_t length_in, Byte* plaintext_out, base64_decodestate_* state)\n    {\n        RequireNotNull (code_in);\n        RequireNotNull (plaintext_out);\n\n        const signed char*  codechar    =   code_in;\n        Byte*               plainchar   =   plaintext_out;\n        signed char         fragment    =   '\\0';\n\n        *plainchar = state->plainchar;\n\n        switch (state->step) {\n                while (1) {\n                case step_a:\n                    do {\n                        if (codechar == code_in + length_in) {\n                            state->step = step_a;\n                            state->plainchar = *plainchar;\n                            return plainchar - plaintext_out;\n                        }\n                        fragment = (signed char)base64_decode_value_ (*codechar++);\n                    }\n                    while (fragment < 0);\n                    *plainchar    = (fragment & 0x03f) << 2;\n                case step_b:\n                    do {\n                        if (codechar == code_in + length_in) {\n                            state->step = step_b;\n                            state->plainchar = *plainchar;\n                            return plainchar - plaintext_out;\n                        }\n                        fragment = (signed char)base64_decode_value_ (*codechar++);\n                    }\n                    while (fragment < 0);\n                    *plainchar++ |= (fragment & 0x030) >> 4;\n                    *plainchar    = (fragment & 0x00f) << 4;\n                case step_c:\n                    do {\n                        if (codechar == code_in + length_in) {\n                            state->step = step_c;\n                            state->plainchar = *plainchar;\n                            return plainchar - plaintext_out;\n                        }\n                        fragment = (signed char)base64_decode_value_ (*codechar++);\n                    }\n                    while (fragment < 0);\n                    *plainchar++ |= (fragment & 0x03c) >> 2;\n                    *plainchar    = (fragment & 0x003) << 6;\n                case step_d:\n                    do {\n                        if (codechar == code_in + length_in) {\n                            state->step = step_d;\n                            state->plainchar = *plainchar;\n                            return plainchar - plaintext_out;\n                        }\n                        fragment = (signed char)base64_decode_value_ (*codechar++);\n                    }\n                    while (fragment < 0);\n                    *plainchar++   |= (fragment & 0x03f);\n                }\n        }\n        return plainchar - plaintext_out;\n    }\n}\n\n\n\n\nMemory::BLOB    Algorithm::DecodeBase64 (const Characters::String& s)\n{\n    \/\/@todo - improve\/fix this\n    return DecodeBase64 (s.AsUTF8 ());\n}\n\nMemory::BLOB    Algorithm::DecodeBase64 (const string& s)\n{\n    if (s.empty ()) {\n        return Memory::BLOB ();\n    }\n    size_t dataSize1 = s.length ();\n    SmallStackBuffer<Byte>  buf1 (dataSize1);   \/\/ MUCH more than big enuf\n    base64_decodestate_ state;\n    size_t r = base64_decode_block_ (reinterpret_cast<const signed char*> (Containers::Start (s)), s.length (), buf1.begin (), &state);\n    Assert (r <= dataSize1);\n    return Memory::BLOB (buf1.begin (), buf1.begin () + r);\n}\n\nvoid    Algorithm::DecodeBase64 (const string& s, Streams::OutputStream<Byte> out)\n{\n    \/\/ QUICKIE implementation...\n    Memory::BLOB   tmp = DecodeBase64 (s);\n    out.Write (tmp.begin (), tmp.end ());\n}\n\n\n\n\n\n\n\n\n\n\/*\n ********************************************************************************\n ************************** Algorithm::EncodeBase64 *****************************\n ********************************************************************************\n *\/\nnamespace   {\n    enum base64_encodestep {\n        step_A, step_B, step_C\n    };\n    struct base64_encodestate {\n        base64_encodestep   step;\n        signed char         result;\n        int                 stepcount;\n        LineBreak           fLineBreak;\n\n        base64_encodestate  (LineBreak lb)\n            : step (step_A)\n            , result (0)\n            , stepcount (0)\n            , fLineBreak (lb)\n        {\n        }\n    };\n\n    signed char base64_encode_value_ (signed char value_in)\n    {\n        const signed char  BASE64_CHARS_[] = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+\/\";\n        Assert  (NEltsOf (BASE64_CHARS_) == (2 * 26 + 10 + 2 + 1));\n        if (value_in > 63) {\n            return '=';\n        }\n        return BASE64_CHARS_[(int)value_in];\n    }\n\n    size_t base64_encode_block_ (const Byte* plaintext_in, size_t length_in, signed char* code_out, base64_encodestate* state)\n    {\n        const int CHARS_PER_LINE = 76;\n\n        const Byte*         plainchar       =   plaintext_in;\n        const Byte* const   plaintextend    =   plaintext_in + length_in;\n        signed char*        codechar        =   code_out;\n        signed char         result          =   state->result;\n\n        signed char fragment   =   '\\0';\n        switch (state->step) {\n                while (1) {\n                case step_A:\n                    if (plainchar == plaintextend) {\n                        state->result = result;\n                        state->step = step_A;\n                        return codechar - code_out;\n                    }\n                    fragment = *plainchar++;\n                    result = (fragment & 0x0fc) >> 2;\n                    *codechar++ = base64_encode_value_ (result);\n                    result = (fragment & 0x003) << 4;\n                case step_B:\n                    if (plainchar == plaintextend) {\n                        state->result = result;\n                        state->step = step_B;\n                        return codechar - code_out;\n                    }\n                    fragment = *plainchar++;\n                    result |= (fragment & 0x0f0) >> 4;\n                    *codechar++ = base64_encode_value_ (result);\n                    result = (fragment & 0x00f) << 2;\n                case step_C:\n                    if (plainchar == plaintextend) {\n                        state->result = result;\n                        state->step = step_C;\n                        return codechar - code_out;\n                    }\n                    fragment = *plainchar++;\n                    result |= (fragment & 0x0c0) >> 6;\n                    *codechar++ = base64_encode_value_ (result);\n                    result  = (fragment & 0x03f) >> 0;\n                    *codechar++ = base64_encode_value_ (result);\n\n                    ++(state->stepcount);\n                    if (state->stepcount == CHARS_PER_LINE \/ 4) {\n                        switch (state->fLineBreak) {\n                            case    LineBreak::eLF_LB:\n                                *codechar++ = '\\n';\n                                break;\n                            case    LineBreak::eCRLF_LB:\n                                *codechar++ = '\\r';\n                                *codechar++ = '\\n';\n                                break;\n                        }\n                        state->stepcount = 0;\n                    }\n                }\n        }\n        return codechar - code_out;\n    }\n    inline  size_t  base64_encode_blockend_ (signed char* code_out, base64_encodestate* state)\n    {\n        signed char* codechar = code_out;\n        switch (state->step) {\n            case step_B:\n                *codechar++ = base64_encode_value_ (state->result);\n                *codechar++ = '=';\n                *codechar++ = '=';\n                break;\n            case step_C:\n                *codechar++ = base64_encode_value_ (state->result);\n                *codechar++ = '=';\n                break;\n            case step_A:\n                break;\n        }\n        return static_cast<size_t> (codechar - code_out);\n    }\n}\n\nstring  Algorithm::EncodeBase64 (const Streams::InputStream<Byte>& from, LineBreak lb)\n{\n#if 0\n    \/\/ Use look doing multiple base64_encode_block_() calls!\n#elif 1\n    \/\/ quick hack impl\n    Memory::BLOB    bytes = Streams::InputStream<Byte> (from).ReadAll ();\n    const Byte* start = bytes.begin ();\n    const Byte* end = bytes.end ();\n    Require (start == end or start != nullptr);\n    Require (start == end or end != nullptr);\n    base64_encodestate state (lb);\n    size_t srcLen = end - start;\n    size_t bufSize = 4 * srcLen;\n    Assert (bufSize >= srcLen);  \/\/ no overflow!\n    SmallStackBuffer<signed char>  data (bufSize);\n    size_t mostBytesCopied =     base64_encode_block_ (start, srcLen, data.begin (), &state);\n    size_t extraBytes = base64_encode_blockend_ (data.begin () + mostBytesCopied, &state);\n    size_t totalBytes = mostBytesCopied + extraBytes;\n    Assert (totalBytes <= bufSize);\n    return string (data.begin (), data.begin () + totalBytes);\n#else\n    Require (start == end or start != nullptr);\n    Require (start == end or end != nullptr);\n\n    base64_encodestate state (lb);\n    size_t srcLen = end - start;\n    size_t bufSize = 4 * srcLen;\n    Assert (bufSize >= srcLen);  \/\/ no overflow!\n    SmallStackBuffer<char>  data (bufSize);\n    size_t mostBytesCopied =     base64_encode_block_ (start, srcLen, data.begin (), &state);\n    size_t extraBytes = base64_encode_blockend_ (data.begin () + mostBytesCopied, &state);\n    size_t totalBytes = mostBytesCopied + extraBytes;\n    Assert (totalBytes <= bufSize);\n    return string (data.begin (), data.begin () + totalBytes);\n#endif\n}\n\nstring  Algorithm::EncodeBase64 (const Memory::BLOB& from, LineBreak lb)\n{\n    const Byte* start = from.begin ();\n    const Byte* end = from.end ();\n    Require (start == end or start != nullptr);\n    Require (start == end or end != nullptr);\n    base64_encodestate state (lb);\n    size_t srcLen = end - start;\n    size_t bufSize = 4 * srcLen;\n    Assert (bufSize >= srcLen);  \/\/ no overflow!\n    SmallStackBuffer<signed char>  data (bufSize);\n    size_t mostBytesCopied =     base64_encode_block_ (start, srcLen, data.begin (), &state);\n    size_t extraBytes = base64_encode_blockend_ (data.begin () + mostBytesCopied, &state);\n    size_t totalBytes = mostBytesCopied + extraBytes;\n    Assert (totalBytes <= bufSize);\n    return string (data.begin (), data.begin () + totalBytes);\n}\n<commit_msg>silence a warning in Encoding\/Algorithm\/Base64<commit_after>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2016.  All rights reserved\n *\/\n\/*\n * Note - used PUBLIC DOMAIN http:\/\/sourceforge.net\/projects\/libb64\/files\/libb64\/libb64\/libb64-1.2.src.zip\/download\n * code as a starting point.\n *\/\n#include    \"..\/..\/..\/StroikaPreComp.h\"\n\n#include    <algorithm>\n#include    <cstdlib>\n\n#include    \"..\/..\/..\/Containers\/Common.h\"\n#include    \"..\/..\/..\/DataExchange\/BadFormatException.h\"\n#include    \"..\/..\/..\/Debug\/Assertions.h\"\n#include    \"..\/..\/..\/Execution\/Exceptions.h\"\n#include    \"..\/..\/..\/Memory\/BLOB.h\"              \/\/ ONLY FOR QUICKHACK IMPL OF ENCODE...\n#include    \"..\/..\/..\/Memory\/SmallStackBuffer.h\"\n\n#include    \"Base64.h\"\n\n\nusing   namespace   Stroika::Foundation;\nusing   namespace   Stroika::Foundation::Containers;\nusing   namespace   Stroika::Foundation::Cryptography;\nusing   namespace   Stroika::Foundation::Cryptography::Encoding;\nusing   namespace   Stroika::Foundation::Cryptography::Encoding::Algorithm;\nusing   namespace   Stroika::Foundation::Memory;\n\n\n\n\n\/**\n *  IMPLEMENTATION NOTES:\n *\n *      The public domain (private) code in this file - is designed to operate in a STREAM mode. I've preserved that\n *  internally, evne though my current API doesnt work that way, because we will soon support a STREAM based API here,\n *  and that will fit perfectly.\n *\n *  @see    http:\/\/libb64.sourceforge.net\/ - which explains the design of the routines, and the queer nested loop \/ switch\n *          construct.\n *\n *      -- LGP 2011-06-21\n *\/\n\n\n\n\n\n\n\/*\n ********************************************************************************\n *************************** Encoding::DecodeBase64 *****************************\n ********************************************************************************\n *\/\nnamespace   {\n    enum base64_decodestep_ {\n        step_a, step_b, step_c, step_d\n    };\n    struct base64_decodestate_ {\n        base64_decodestep_  step;\n        Byte                plainchar;\n\n        base64_decodestate_ ()\n            : step (step_a)\n            , plainchar ('\\0')\n        {\n        }\n    };\n    int base64_decode_value_ (signed char value_in)\n    {\n        static const signed char kDecoding[] = {62, -1, -1, -1, 63, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, -1, -1, -1, -2, -1, -1, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, -1, -1, -1, -1, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51};\n        value_in -= 43;\n        if (value_in < 0 || static_cast<unsigned char> (value_in) >= NEltsOf (kDecoding)) {\n            return -1;\n        }\n        Assert (0 <= value_in and static_cast<unsigned char> (value_in) < NEltsOf (kDecoding));\n        return kDecoding[(int)value_in];\n    }\n    size_t base64_decode_block_ (const signed char* code_in, size_t length_in, Byte* plaintext_out, base64_decodestate_* state)\n    {\n        RequireNotNull (code_in);\n        RequireNotNull (plaintext_out);\n\n        const signed char*  codechar    =   code_in;\n        Byte*               plainchar   =   plaintext_out;\n        signed char         fragment    =   '\\0';\n\n        *plainchar = state->plainchar;\n\n        switch (state->step) {\n                while (1) {\n                case step_a:\n                    do {\n                        if (codechar == code_in + length_in) {\n                            state->step = step_a;\n                            state->plainchar = *plainchar;\n                            return plainchar - plaintext_out;\n                        }\n                        fragment = (signed char)base64_decode_value_ (*codechar++);\n                    }\n                    while (fragment < 0);\n                    *plainchar    = (fragment & 0x03f) << 2;\n                case step_b:\n                    do {\n                        if (codechar == code_in + length_in) {\n                            state->step = step_b;\n                            state->plainchar = *plainchar;\n                            return plainchar - plaintext_out;\n                        }\n                        fragment = (signed char)base64_decode_value_ (*codechar++);\n                    }\n                    while (fragment < 0);\n                    *plainchar++ |= (fragment & 0x030) >> 4;\n                    *plainchar    = (fragment & 0x00f) << 4;\n                case step_c:\n                    do {\n                        if (codechar == code_in + length_in) {\n                            state->step = step_c;\n                            state->plainchar = *plainchar;\n                            return plainchar - plaintext_out;\n                        }\n                        fragment = (signed char)base64_decode_value_ (*codechar++);\n                    }\n                    while (fragment < 0);\n                    *plainchar++ |= (fragment & 0x03c) >> 2;\n                    *plainchar    = (fragment & 0x003) << 6;\n                case step_d:\n                    do {\n                        if (codechar == code_in + length_in) {\n                            state->step = step_d;\n                            state->plainchar = *plainchar;\n                            return plainchar - plaintext_out;\n                        }\n                        fragment = (signed char)base64_decode_value_ (*codechar++);\n                    }\n                    while (fragment < 0);\n                    *plainchar++   |= (fragment & 0x03f);\n                }\n        }\n        return plainchar - plaintext_out;\n    }\n}\n\n\n\n\nMemory::BLOB    Algorithm::DecodeBase64 (const Characters::String& s)\n{\n    \/\/@todo - improve\/fix this\n    return DecodeBase64 (s.AsUTF8 ());\n}\n\nMemory::BLOB    Algorithm::DecodeBase64 (const string& s)\n{\n    if (s.empty ()) {\n        return Memory::BLOB ();\n    }\n    size_t dataSize1 = s.length ();\n    SmallStackBuffer<Byte>  buf1 (dataSize1);   \/\/ MUCH more than big enuf\n    base64_decodestate_ state;\n    size_t r = base64_decode_block_ (reinterpret_cast<const signed char*> (Containers::Start (s)), s.length (), buf1.begin (), &state);\n    Assert (r <= dataSize1);\n    return Memory::BLOB (buf1.begin (), buf1.begin () + r);\n}\n\nvoid    Algorithm::DecodeBase64 (const string& s, Streams::OutputStream<Byte> out)\n{\n    \/\/ QUICKIE implementation...\n    Memory::BLOB   tmp = DecodeBase64 (s);\n    out.Write (tmp.begin (), tmp.end ());\n}\n\n\n\n\n\n\n\n\n\n\/*\n ********************************************************************************\n ************************** Algorithm::EncodeBase64 *****************************\n ********************************************************************************\n *\/\nnamespace   {\n    enum base64_encodestep {\n        step_A, step_B, step_C\n    };\n    struct base64_encodestate {\n        base64_encodestep   step;\n        signed char         result;\n        int                 stepcount;\n        LineBreak           fLineBreak;\n\n        base64_encodestate  (LineBreak lb)\n            : step (step_A)\n            , result (0)\n            , stepcount (0)\n            , fLineBreak (lb)\n        {\n        }\n    };\n\n    signed char base64_encode_value_ (signed char value_in)\n    {\n        const signed char  BASE64_CHARS_[] = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+\/\";\n        Assert  (NEltsOf (BASE64_CHARS_) == (2 * 26 + 10 + 2 + 1));\n        if (value_in > 63) {\n            return '=';\n        }\n        return BASE64_CHARS_[(int)value_in];\n    }\n\n    size_t base64_encode_block_ (const Byte* plaintext_in, size_t length_in, signed char* code_out, base64_encodestate* state)\n    {\n        const int CHARS_PER_LINE = 76;\n\n        const Byte*         plainchar       =   plaintext_in;\n        const Byte* const   plaintextend    =   plaintext_in + length_in;\n        signed char*        codechar        =   code_out;\n        signed char         result          =   state->result;\n\n        signed char fragment   =   '\\0';\n        switch (state->step) {\n                while (1) {\n                case step_A:\n                    if (plainchar == plaintextend) {\n                        state->result = result;\n                        state->step = step_A;\n                        return codechar - code_out;\n                    }\n                    fragment = *plainchar++;\n                    result = (fragment & 0x0fc) >> 2;\n                    *codechar++ = base64_encode_value_ (result);\n                    result = (fragment & 0x003) << 4;\n                case step_B:\n                    if (plainchar == plaintextend) {\n                        state->result = result;\n                        state->step = step_B;\n                        return codechar - code_out;\n                    }\n                    fragment = *plainchar++;\n                    result |= (fragment & 0x0f0) >> 4;\n                    *codechar++ = base64_encode_value_ (result);\n                    result = (fragment & 0x00f) << 2;\n                case step_C:\n                    if (plainchar == plaintextend) {\n                        state->result = result;\n                        state->step = step_C;\n                        return codechar - code_out;\n                    }\n                    fragment = *plainchar++;\n                    result |= (fragment & 0x0c0) >> 6;\n                    *codechar++ = base64_encode_value_ (result);\n                    result  = (fragment & 0x03f) >> 0;\n                    *codechar++ = base64_encode_value_ (result);\n\n                    ++(state->stepcount);\n                    if (state->stepcount == CHARS_PER_LINE \/ 4) {\n                        switch (state->fLineBreak) {\n                            case    LineBreak::eLF_LB:\n                                *codechar++ = '\\n';\n                                break;\n                            case    LineBreak::eCRLF_LB:\n                                *codechar++ = '\\r';\n                                *codechar++ = '\\n';\n                                break;\n                        }\n                        state->stepcount = 0;\n                    }\n                }\n        }\n        return codechar - code_out;\n    }\n    inline  size_t  base64_encode_blockend_ (signed char* code_out, base64_encodestate* state)\n    {\n        signed char* codechar = code_out;\n        switch (state->step) {\n            case step_B:\n                *codechar++ = base64_encode_value_ (state->result);\n                *codechar++ = '=';\n                *codechar++ = '=';\n                break;\n            case step_C:\n                *codechar++ = base64_encode_value_ (state->result);\n                *codechar++ = '=';\n                break;\n            case step_A:\n                break;\n        }\n        return static_cast<size_t> (codechar - code_out);\n    }\n}\n\nstring  Algorithm::EncodeBase64 (const Streams::InputStream<Byte>& from, LineBreak lb)\n{\n#if 0\n    \/\/ Use look doing multiple base64_encode_block_() calls!\n#elif 1\n    \/\/ quick hack impl\n    Memory::BLOB    bytes = Streams::InputStream<Byte> (from).ReadAll ();\n    const Byte* start = bytes.begin ();\n    const Byte* end = bytes.end ();\n    Require (start == end or start != nullptr);\n    Require (start == end or end != nullptr);\n    base64_encodestate state (lb);\n    size_t srcLen = end - start;\n    size_t bufSize = 4 * srcLen;\n    Assert (bufSize >= srcLen);  \/\/ no overflow!\n    SmallStackBuffer<signed char>  data (bufSize);\n    size_t mostBytesCopied =     base64_encode_block_ (start, srcLen, data.begin (), &state);\n    size_t extraBytes = base64_encode_blockend_ (data.begin () + mostBytesCopied, &state);\n    size_t totalBytes = mostBytesCopied + extraBytes;\n    Assert (totalBytes <= bufSize);\n    return string (data.begin (), data.begin () + totalBytes);\n#else\n    Require (start == end or start != nullptr);\n    Require (start == end or end != nullptr);\n\n    base64_encodestate state (lb);\n    size_t srcLen = end - start;\n    size_t bufSize = 4 * srcLen;\n    Assert (bufSize >= srcLen);  \/\/ no overflow!\n    SmallStackBuffer<char>  data (bufSize);\n    size_t mostBytesCopied =     base64_encode_block_ (start, srcLen, data.begin (), &state);\n    size_t extraBytes = base64_encode_blockend_ (data.begin () + mostBytesCopied, &state);\n    size_t totalBytes = mostBytesCopied + extraBytes;\n    Assert (totalBytes <= bufSize);\n    return string (data.begin (), data.begin () + totalBytes);\n#endif\n}\n\nstring  Algorithm::EncodeBase64 (const Memory::BLOB& from, LineBreak lb)\n{\n    const Byte* start = from.begin ();\n    const Byte* end = from.end ();\n    Require (start == end or start != nullptr);\n    Require (start == end or end != nullptr);\n    base64_encodestate state (lb);\n    size_t srcLen = end - start;\n    size_t bufSize = 4 * srcLen;\n    Assert (bufSize >= srcLen);  \/\/ no overflow!\n    SmallStackBuffer<signed char>  data (bufSize);\n    size_t mostBytesCopied =     base64_encode_block_ (start, srcLen, data.begin (), &state);\n    size_t extraBytes = base64_encode_blockend_ (data.begin () + mostBytesCopied, &state);\n    size_t totalBytes = mostBytesCopied + extraBytes;\n    Assert (totalBytes <= bufSize);\n    return string (data.begin (), data.begin () + totalBytes);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ author: Maciej Chałapuk\n\/\/ license: MIT\n\/\/ vim: ts=2 sw=2 expandtab\n#include \"gyros\/builder.hpp\"\n\n#include \"test\/gyros\/components.hpp\"\n#include \"test\/static_assert.hpp\"\n\ntemplate <class ...Types>\nusing TypeList = gyros::util::type_list::TypeList<Types...>;\nusing Simple = test::gyros::component::EmptyComponent;\nusing Mock = test::gyros::component::MockComponent;\n\nvoid test_rotor_type_in_builder_type_with_one_component() {\n  typedef gyros::component::Rotor<Simple> ExpectedRotorType;\n  typedef typename gyros::Builder<TypeList<Simple>>::RotorType ActualRotorType;\n  test::AssertIsSame<ExpectedRotorType, ActualRotorType>();\n}\n\nvoid test_rotor_type_in_builder_with_two_components() {\n  typedef gyros::component::Rotor<Simple, Mock>\n      ExpectedRotorType;\n  typedef typename gyros::Builder<TypeList<Simple, Mock>>::RotorType\n      ActualRotorType;\n  test::AssertIsSame<ExpectedRotorType, ActualRotorType>();\n}\n\nvoid test_rotor_type_in_builder_with_two_tuples() {\n  typedef gyros::component::Rotor<Simple, Mock>\n      ExpectedRotorType;\n  typedef typename gyros::Builder<TypeList<Simple>, TypeList<Mock>>::RotorType\n      ActualRotorType;\n  test::AssertIsSame<ExpectedRotorType, ActualRotorType>();\n}\n\nvoid test_making_builder_type_with_two_tuples_with_recurring_types() {\n  typedef gyros::component::Rotor<Simple, Mock>\n      ExpectedRotorType;\n  typedef typename gyros::Builder<\n      TypeList<Simple>,\n      TypeList<Simple, Mock>\n      >::RotorType ActualRotorType;\n  test::AssertIsSame<ExpectedRotorType, ActualRotorType>();\n}\n\n<commit_msg>~ making static test function static :)<commit_after>\/\/ author: Maciej Chałapuk\n\/\/ license: MIT\n\/\/ vim: ts=2 sw=2 expandtab\n#include \"gyros\/builder.hpp\"\n\n#include \"test\/gyros\/components.hpp\"\n#include \"test\/static_assert.hpp\"\n\ntemplate <class ...Types>\nusing TypeList = gyros::util::type_list::TypeList<Types...>;\nusing Simple = test::gyros::component::EmptyComponent;\nusing Mock = test::gyros::component::MockComponent;\n\nstatic\nvoid test_rotor_type_in_builder_type_with_one_component() {\n  typedef gyros::component::Rotor<Simple> ExpectedRotorType;\n  typedef typename gyros::Builder<TypeList<Simple>>::RotorType ActualRotorType;\n  test::AssertIsSame<ExpectedRotorType, ActualRotorType>();\n}\n\nstatic\nvoid test_rotor_type_in_builder_with_two_components() {\n  typedef gyros::component::Rotor<Simple, Mock>\n      ExpectedRotorType;\n  typedef typename gyros::Builder<TypeList<Simple, Mock>>::RotorType\n      ActualRotorType;\n  test::AssertIsSame<ExpectedRotorType, ActualRotorType>();\n}\n\nstatic\nvoid test_rotor_type_in_builder_with_two_tuples() {\n  typedef gyros::component::Rotor<Simple, Mock>\n      ExpectedRotorType;\n  typedef typename gyros::Builder<TypeList<Simple>, TypeList<Mock>>::RotorType\n      ActualRotorType;\n  test::AssertIsSame<ExpectedRotorType, ActualRotorType>();\n}\n\nstatic\nvoid test_rotor_type_in_builder_type_with_two_tuples_with_recurring_types() {\n  typedef gyros::component::Rotor<Simple, Mock>\n      ExpectedRotorType;\n  typedef typename gyros::Builder<\n      TypeList<Simple>,\n      TypeList<Simple, Mock>\n      >::RotorType ActualRotorType;\n  test::AssertIsSame<ExpectedRotorType, ActualRotorType>();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Created by vrosca on 1\/26\/17.\n\/\/\n\n#include \"ShortestPathProvider.hpp\"\n#include <queue>\n#include <unordered_map>\n#include <Calendar.hpp>\n#include <future>\n\nstd::vector<std::pair<int, std::pair< std::pair<long long,  std::string>, std::pair<float, int> > > > getNeighbours (int id, Calendar c, float lat, float lng) {\n    std::string str_lng = std::to_string(lng);\n    std::string str_lat = std::to_string(lat);\n    std::string query = \"MATCH (a:Stop{id: '\" + std::to_string(id) + \"'})-[t1:TO_TRIP]->(tr:Trip)-[t2:TO_STOP]->(b:Stop), \" +\n            \"(tr)-[:HAS]->(s:Service) \" +\n            \"WHERE t1.nr < t2.nr RETURN b.id, b.lat, b.lng, t1.departure, t2.arrival, s, tr.id, size((b)-->())\";\n\n    std::vector<std::pair<int, std::pair<std::pair<long long,  std::string>, std::pair<float, int> > > > vresult;\n    DatabaseManager::GetInstance().query(query,[&](neo4j_result_stream_t *result_stream){\n        neo4j_result_t *result = neo4j_fetch_next(result_stream);\n\n        while (result != NULL) {\n            std::string idn_str = DatabaseUtils::GetInstance().neo4j_get_string(neo4j_result_field(result, 0));\n            std::string lat_str = DatabaseUtils::GetInstance().neo4j_get_string(neo4j_result_field(result, 1));\n            std::string lng_str = DatabaseUtils::GetInstance().neo4j_get_string(neo4j_result_field(result, 2));\n            int departure = (int) neo4j_int_value(neo4j_result_field(result, 3));\n            int arrival = (int) neo4j_int_value(neo4j_result_field(result, 4));\n            json service = DatabaseUtils::GetInstance().neo4j_to_json(neo4j_result_field(result, 5))[\"properties\"];\n            std::string trip_id  = DatabaseUtils::GetInstance().neo4j_get_string(neo4j_result_field(result, 6));\n            int rels = (int) neo4j_int_value(neo4j_result_field(result, 7));\n\n            int idn = std::stoi(idn_str);\n            if (idn == 11906)\n                idn = 11906;\n            float tlat = std::stof(lat_str);\n            float tlng = std::stof(lng_str);\n            float dist = (lat - tlat) * (lat - tlat) + (lng - tlng) * (lng - tlng);\n\n            long long time = arrival - departure;\n\n            if (c.getDayTimeUnix() < departure && service[c.getDayName()].get<std::string>() == \"1\") {\n                time += departure - c.getDayTimeUnix();\n            }\n            else {\n                Calendar c2 = c;\n                c2.set(23, Calendar::HOUR);\n                c2.set(59, Calendar::MINUTE);\n                c2.set(59, Calendar::SECOND);\n                time += c2.getDayTimeUnix() - c.getDayTimeUnix() + 1;\n                c2.add(1, Calendar::SECOND);\n\n                int day = 0;\n                while (day < 3 && service[c2.getDayName()].get<std::string>() != \"1\") {\n                    time += 24 * 60 * 60;\n                    c2.add(1, Calendar::DAY);\n                    day++;\n                }\n                if (day == 3) {\n                    result = neo4j_fetch_next(result_stream);\n                    continue;\n                }\n            }\n\n            vresult.push_back(std::make_pair (idn, std::make_pair(std::make_pair(time, trip_id), std::make_pair(dist, rels))));\n            result = neo4j_fetch_next(result_stream);\n        }\n    });\n    return vresult;\n};\n\nvoid createResult (int node,\n                   std::vector<json> & result,\n                   std::unordered_map<int, std::pair<int, std::string> > &prev,\n                   std::unordered_map<int, long long> &road\n) {\n    auto it = prev.find(node);\n    if ( it == prev.end ()) {\n        return;\n    }\n\n    createResult(it->second.first, result, prev, road);\n\n    json path;\n    path[\"start\"] = DatabaseUtils::GetInstance().getStopById (it->second.first);\n    long long departure = DatabaseUtils::GetInstance().getDepartureByStopAndTrip (it->second.first, it->second.second);\n    long long arrival = DatabaseUtils::GetInstance().getArrivalByStopAndTrip (node, it->second.second);\n    long long time = arrival - departure;\n\n    path[\"duration\"] = time;\n    path[\"route\"] = DatabaseUtils::GetInstance().getRouteByTripId (it->second.second);\n    path[\"arrival\"] = road[node];\n    path[\"end\"] = DatabaseUtils::GetInstance().getStopById (node);\n    result.push_back(path);\n}\n\njson ShortestPathProvider::provide(json request) {\n    std::string origin = request[\"origin\"];\n    std::string destination = request[\"destination\"];\n    Calendar time = Calendar::fromJSON(request[\"time\"]);\n\n    std::priority_queue<std::pair<std::pair<float, long long>, int>, std::vector<std::pair<std::pair<float, long long>, int> >, std::greater<std::pair<std::pair<float, long long>, int> > > q;\n    std::unordered_map<int, long long> road;\n    std::unordered_map<int, std::pair<int,  std::string> > prev;\n\n    int origin_id = DatabaseUtils::GetInstance().getId (origin);\n    int final_id = DatabaseUtils::GetInstance().getId (destination);\n\n    if (origin_id == -1 || final_id == -1) {\n        json result;\n        result[\"ERROR\"] = \"City not found\";\n        return result;\n    }\n\n    json origin_stop = DatabaseUtils::GetInstance().getStopById(origin_id);\n    json final_stop = DatabaseUtils::GetInstance().getStopById(final_id);\n    float olat = std::stof(origin_stop[\"lat\"].get<std::string>());\n    float olng = std::stof(origin_stop[\"lng\"].get<std::string>());\n\n    float lat = std::stof(final_stop[\"lat\"].get<std::string>());\n    float lng = std::stof(final_stop[\"lng\"].get<std::string>());\n\n    float max_dist = (lat - olat) * (lat - olat) + (lng - olng) * (lng - olng);\n\n    road[origin_id] = 0;\n    q.push (std::make_pair (std::make_pair (0, 0), origin_id));\n    while (!q.empty ()) {\n        auto nod = q.top ();\n        q.pop();\n        if (nod.second == final_id) break;\n\n        if (road[nod.second] < nod.first.second) continue;\n\n        Calendar c = time;\n        c.add((int) nod.first.second, Calendar::SECOND);\n        auto ngh = getNeighbours(nod.second, c, lat, lng);\n\n        bool stop = false;\n        for (auto it : ngh) {\n            long long &n = road[it.first];\n            if (nod.first.second + it.second.first.first < n || n == 0 && it.first != origin_id) {\n                n = nod.first.second + it.second.first.first;\n\n                float score = it.second.second.first;\n                score \/= max_dist;\n                score += (float) 100 \/ (float)it.second.second.second;\n\n                q.push (std::make_pair(std::make_pair (score, n), it.first));\n                prev[it.first] = std::make_pair(nod.second, it.second.first.second);\n                if (it.first == final_id)\n                    stop = true;\n            }\n\n            if (stop) {\n                std::vector<json> result;\n                createResult (final_id, result, prev, road);\n                json totals = json (result);\n                return totals;\n            }\n        }\n    }\n\n    if (prev.find(final_id) == prev.end ()) {\n        json result;\n        result[\"ERROR\"] = \"No path between cities\";\n        return result;\n    }\n\n    std::vector<json> result;\n    createResult (final_id, result, prev, road);\n    json totals = json (result);\n    return totals;\n}<commit_msg>Fixed Manager no included + timeout<commit_after>\/\/\n\/\/ Created by vrosca on 1\/26\/17.\n\/\/\n\n#include \"ShortestPathProvider.hpp\"\n#include <queue>\n#include <unordered_map>\n#include <Calendar.hpp>\n#include <future>\n\nstd::vector<std::pair<int, std::pair< std::pair<long long,  std::string>, std::pair<float, int> > > > getNeighbours (int id, Calendar c, float lat, float lng) {\n    std::string str_lng = std::to_string(lng);\n    std::string str_lat = std::to_string(lat);\n    std::string query = \"MATCH (a:Stop{id: '\" + std::to_string(id) + \"'})-[t1:TO_TRIP]->(tr:Trip)-[t2:TO_STOP]->(b:Stop), \" +\n            \"(tr)-[:HAS]->(s:Service) \" +\n            \"WHERE t1.nr < t2.nr RETURN b.id, b.lat, b.lng, t1.departure, t2.arrival, s, tr.id, size((b)-->())\";\n\n    std::vector<std::pair<int, std::pair<std::pair<long long,  std::string>, std::pair<float, int> > > > vresult;\n    DatabaseManager::GetInstance().query(query,[&](neo4j_result_stream_t *result_stream){\n        neo4j_result_t *result = neo4j_fetch_next(result_stream);\n\n        while (result != NULL) {\n            std::string idn_str = DatabaseUtils::GetInstance().neo4j_get_string(neo4j_result_field(result, 0));\n            std::string lat_str = DatabaseUtils::GetInstance().neo4j_get_string(neo4j_result_field(result, 1));\n            std::string lng_str = DatabaseUtils::GetInstance().neo4j_get_string(neo4j_result_field(result, 2));\n            int departure = (int) neo4j_int_value(neo4j_result_field(result, 3));\n            int arrival = (int) neo4j_int_value(neo4j_result_field(result, 4));\n            json service = DatabaseUtils::GetInstance().neo4j_to_json(neo4j_result_field(result, 5))[\"properties\"];\n            std::string trip_id  = DatabaseUtils::GetInstance().neo4j_get_string(neo4j_result_field(result, 6));\n            int rels = (int) neo4j_int_value(neo4j_result_field(result, 7));\n\n            int idn = std::stoi(idn_str);\n            if (idn == 11906)\n                idn = 11906;\n            float tlat = std::stof(lat_str);\n            float tlng = std::stof(lng_str);\n            float dist = (lat - tlat) * (lat - tlat) + (lng - tlng) * (lng - tlng);\n\n            long long time = arrival - departure;\n\n            if (c.getDayTimeUnix() < departure && service[c.getDayName()].get<std::string>() == \"1\") {\n                time += departure - c.getDayTimeUnix();\n            }\n            else {\n                Calendar c2 = c;\n                c2.set(23, Calendar::HOUR);\n                c2.set(59, Calendar::MINUTE);\n                c2.set(59, Calendar::SECOND);\n                time += c2.getDayTimeUnix() - c.getDayTimeUnix() + 1;\n                c2.add(1, Calendar::SECOND);\n\n                int day = 0;\n                while (day < 3 && service[c2.getDayName()].get<std::string>() != \"1\") {\n                    time += 24 * 60 * 60;\n                    c2.add(1, Calendar::DAY);\n                    day++;\n                }\n                if (day == 3) {\n                    result = neo4j_fetch_next(result_stream);\n                    continue;\n                }\n            }\n\n            vresult.push_back(std::make_pair (idn, std::make_pair(std::make_pair(time, trip_id), std::make_pair(dist, rels))));\n            result = neo4j_fetch_next(result_stream);\n        }\n    });\n    return vresult;\n};\n\nvoid createResult (int node,\n                   std::vector<json> & result,\n                   std::unordered_map<int, std::pair<int, std::string> > &prev,\n                   std::unordered_map<int, long long> &road\n) {\n    auto it = prev.find(node);\n    if ( it == prev.end ()) {\n        return;\n    }\n\n    createResult(it->second.first, result, prev, road);\n\n    json path;\n    path[\"start\"] = DatabaseUtils::GetInstance().getStopById (it->second.first);\n    long long departure = DatabaseUtils::GetInstance().getDepartureByStopAndTrip (it->second.first, it->second.second);\n    long long arrival = DatabaseUtils::GetInstance().getArrivalByStopAndTrip (node, it->second.second);\n    long long time = arrival - departure;\n\n    path[\"duration\"] = time;\n    path[\"route\"] = DatabaseUtils::GetInstance().getRouteByTripId (it->second.second);\n    path[\"arrival\"] = road[node];\n    path[\"end\"] = DatabaseUtils::GetInstance().getStopById (node);\n    result.push_back(path);\n}\n\njson ShortestPathProvider::provide(json request) {\n    canceled = false;\n    auto future = std::async(std::launch::async, [&]() {\n        std::string origin = request[\"origin\"];\n        std::string destination = request[\"destination\"];\n        Calendar time = Calendar::fromJSON(request[\"time\"]);\n\n        std::priority_queue<std::pair<std::pair<float, long long>, int>, std::vector<std::pair<std::pair<float, long long>, int> >, std::greater<std::pair<std::pair<float, long long>, int> > > q;\n        std::unordered_map<int, long long> road;\n        std::unordered_map<int, std::pair<int, std::string> > prev;\n\n        int origin_id = DatabaseUtils::GetInstance().getId(origin);\n        int final_id = DatabaseUtils::GetInstance().getId(destination);\n\n        if (origin_id == -1 || final_id == -1) {\n            json result;\n            result[\"ERROR\"] = \"City not found\";\n            return result;\n        }\n\n        json origin_stop = DatabaseUtils::GetInstance().getStopById(origin_id);\n        json final_stop = DatabaseUtils::GetInstance().getStopById(final_id);\n        float olat = std::stof(origin_stop[\"lat\"].get<std::string>());\n        float olng = std::stof(origin_stop[\"lng\"].get<std::string>());\n\n        float lat = std::stof(final_stop[\"lat\"].get<std::string>());\n        float lng = std::stof(final_stop[\"lng\"].get<std::string>());\n\n        float max_dist = (lat - olat) * (lat - olat) + (lng - olng) * (lng - olng);\n\n        road[origin_id] = 0;\n        q.push(std::make_pair(std::make_pair(0, 0), origin_id));\n        while (!canceled && !q.empty()) {\n            auto nod = q.top();\n            q.pop();\n            if (nod.second == final_id) break;\n\n            if (road[nod.second] < nod.first.second) continue;\n\n            Calendar c = time;\n            c.add((int) nod.first.second, Calendar::SECOND);\n            auto ngh = getNeighbours(nod.second, c, lat, lng);\n\n            bool stop = false;\n            for (auto it : ngh) {\n                long long &n = road[it.first];\n                if (nod.first.second + it.second.first.first < n || n == 0 && it.first != origin_id) {\n                    n = nod.first.second + it.second.first.first;\n\n                    float score = it.second.second.first;\n                    score \/= max_dist;\n                    score += (float) 100 \/ (float) it.second.second.second;\n\n                    q.push(std::make_pair(std::make_pair(score, n), it.first));\n                    prev[it.first] = std::make_pair(nod.second, it.second.first.second);\n                    if (it.first == final_id)\n                        stop = true;\n                }\n\n                if (stop) {\n                    std::vector<json> result;\n                    createResult(final_id, result, prev, road);\n                    json totals = json(result);\n                    return totals;\n                }\n            }\n        }\n\n        if (prev.find(final_id) == prev.end()) {\n            json result;\n            result[\"ERROR\"] = \"No path between cities\";\n            return result;\n        }\n\n        std::vector<json> result;\n        createResult(final_id, result, prev, road);\n        json totals = json(result);\n        return totals;\n    });\n\n    auto timeout = future.wait_for (std::chrono::seconds(15));\n    canceled = true;\n    if (timeout == std::future_status::timeout) {\n        json result;\n        result[\"ERROR\"] = \"No path between cities\";\n        return result;\n    }\n    return future.get();\n}<|endoftext|>"}
{"text":"<commit_before>\/\/ Filename: typeRegistryNode.cxx\n\/\/ Created by:  drose (06Aug01)\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ PANDA 3D SOFTWARE\n\/\/ Copyright (c) 2001, Disney Enterprises, Inc.  All rights reserved\n\/\/\n\/\/ All use of this software is subject to the terms of the Panda 3d\n\/\/ Software license.  You should have received a copy of this license\n\/\/ along with this source code; you will also find a current copy of\n\/\/ the license at http:\/\/www.panda3d.org\/license.txt .\n\/\/\n\/\/ To contact the maintainers of this program write to\n\/\/ panda3d@yahoogroups.com .\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"typeRegistryNode.h\"\n\n#include <algorithm>\n\n\/\/ Define this to double-check all the inheritance derivations.\n#define PARANOID_INHERITANCE\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: TypeRegistryNode::Constructor\n\/\/       Access: Public\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nTypeRegistryNode::\nTypeRegistryNode(TypeHandle handle, const string &name, TypeHandle &ref) :\n  _handle(handle), _name(name), _ref(ref) \n{\n  clear_subtree();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: TypeRegistryNode::is_derived_from\n\/\/       Access: Public, Static\n\/\/  Description: Returns true if the child RegistryNode represents a\n\/\/               class that inherits directly or indirectly from the\n\/\/               class represented by the base RegistryNode.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool TypeRegistryNode::\nis_derived_from(const TypeRegistryNode *child, const TypeRegistryNode *base) {\n  \/\/ This function is the basis for TypedObject::is_of_type(), which\n  \/\/ gets used quite frequently within Panda, often in inner-loop\n  \/\/ code.  Therefore, we go through some pains to make this function\n  \/\/ as efficient as possible.\n\n  \/\/ First, compare the subtree tops.  If they are the same, then this\n  \/\/ node and the base node are within the same single-inheritance\n  \/\/ subtree, and we can use our bitmask trick to determine the\n  \/\/ relationship with no additional work.  (See r_build_subtrees()).\n\n  if (child->_inherit._top == base->_inherit._top) {\n    nassertr(child->_inherit._top != (TypeRegistryNode *)NULL, false);\n\n    bool derives = \n      Inherit::is_derived_from(child->_inherit, base->_inherit);\n\n#ifdef PARANOID_INHERITANCE\n    bool paranoid_derives = check_derived_from(child, base);\n    if (derives != paranoid_derives) {\n      express_cat.error()\n        << \"Inheritance test for \" << child->_name \n        << \" from \" << base->_name << \" failed!\\n\"\n        << \"Result: \" << derives << \" should have been: \"\n        << paranoid_derives << \"\\n\"\n        << \"Classes are in the same single inheritance subtree, children of \"\n        << child->_inherit._top->_name << \"\\n\"\n        << hex\n        << child->_name << \" has mask \" << child->_inherit._mask\n        << \" and bits \" << child->_inherit._bits << \"\\n\"\n        << base->_name << \" has mask \" << base->_inherit._mask\n        << \" and bits \" << base->_inherit._bits << \"\\n\"\n        << dec;\n      return paranoid_derives;\n    }\n#endif\n\n    \/*\n    cerr << \"trivial: \" << child->_name << \" vs. \" << base->_name\n         << \" (\" << child->_inherit._top->_name << \") = \" << derives << \"\\n\";\n    *\/\n\n    return derives;\n  }\n\n  \/\/ The two nodes are not within the same single-inheritance subtree.\n  \/\/ This complicates things a bit.\n\n  \/\/ First, we should check whether the subtree tops of the two nodes\n  \/\/ inherit from each other.\n  const TypeRegistryNode *child_top = child->_inherit._top;\n  const TypeRegistryNode *base_top = base->_inherit._top;\n\n  bool derives = false;\n\n  \/\/ If child_top does not inherit from base_top, it follows that\n  \/\/ child does not inherit from base.\n  TopInheritance::const_iterator ti = child_top->find_top_inherit(base_top);\n\n  while (ti != child_top->_top_inheritance.end() && \n         (*ti)._top == base_top &&\n         !derives) {\n    \/\/ If child_top *does* inherit from base_top, then child may or\n    \/\/ may not inherit from base.  This depends on the exact path of\n    \/\/ inheritance.  Since there might be multiple paths from\n    \/\/ child_top to base_top, we have to examine all of them.\n    const Inherit &connection = (*ti);\n\n    \/\/ Here is one inheritance from child_top to base_top.  If the\n    \/\/ connecting node inherits from base, then child also inherits\n    \/\/ from base.  If the connecting node does not inherit from base,\n    \/\/ we must keep looking.\n    derives = Inherit::is_derived_from(connection, base->_inherit);\n\n    ++ti;\n  }\n\n#ifdef PARANOID_INHERITANCE\n  bool paranoid_derives = check_derived_from(child, base);\n  if (derives != paranoid_derives) {\n    express_cat.error()\n      << \"Inheritance test for \" << child->_name \n      << \" from \" << base->_name << \" failed!\\n\"\n      << \"Result: \" << derives << \" should have been: \"\n      << paranoid_derives << \"\\n\"\n      << child->_name << \" is a descendent of \"\n      << child_top->_name << \"\\n\"\n      << base->_name << \" is a descendent of \"\n      << base_top->_name << \"\\n\";\n    return paranoid_derives;\n  }\n#endif\n\n  \/*\n  cerr << \"complex: \" << child->_name << \" (\" << child->_inherit._top->_name\n       << \") vs. \" << base->_name << \" (\" << base->_inherit._top->_name\n       << \") = \" << derives << \"\\n\";\n  *\/\n  return derives;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: TypeRegistryNode::get_parent_towards\n\/\/       Access: Public, Static\n\/\/  Description: Returns the first parent class of child that is a\n\/\/               descendant of the indicated base class.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nTypeHandle TypeRegistryNode::\nget_parent_towards(const TypeRegistryNode *child,\n                   const TypeRegistryNode *base) {\n  if (child == base) {\n    return child->_handle;\n  }\n\n  Classes::const_iterator ni;\n  for (ni = child->_parent_classes.begin(); \n       ni != child->_parent_classes.end(); ++ni) {\n    if (is_derived_from((*ni), base)) {\n      return (*ni)->_handle;\n    }\n  }\n\n  return TypeHandle::none();\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: TypeRegistryNode::clear_subtree\n\/\/       Access: Public\n\/\/  Description: Removes any subtree definition previously set up via\n\/\/               define_subtree(), in preparation for rebuilding the\n\/\/               subtree data.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid TypeRegistryNode::\nclear_subtree() {\n  _inherit = Inherit();\n  _top_inheritance.clear();\n  _visit_count = 0;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: TypeRegistryNode::define_subtree\n\/\/       Access: Public\n\/\/  Description: Indicates that this TypeRegistryNode is the top of a\n\/\/               subtree within the inheritance graph (typically, this\n\/\/               indicates a multiple-inheritance node).  Builds all\n\/\/               the subtree_mask etc. flags for nodes at this level\n\/\/               and below.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid TypeRegistryNode::\ndefine_subtree() {\n  \/\/  cerr << \"Building subtree for \" << _name << \", top inheritance is:\\n\";\n\n    \/*\n  TopInheritance::const_iterator ti;\n  for (ti = _top_inheritance.begin(); ti != _top_inheritance.end(); ++ti) {\n    const Inherit &t = (*ti);\n    cerr << \"  from \" << t._top->_name << \" via \"\n         << hex << t._bits << \" \/ \" << t._mask << dec << \"\\n\";\n  }\n    *\/\n\n  r_build_subtrees(this, 0, 0);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: TypeRegistryNode::r_build_subtrees\n\/\/       Access: Public\n\/\/  Description: Recursively builds up all the subtree cache\n\/\/               information for this node and the ones below.  This\n\/\/               information is used to quickly determine class\n\/\/               inheritance.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid TypeRegistryNode::\nr_build_subtrees(TypeRegistryNode *top, int bit_count, \n                 TypeRegistryNode::SubtreeMaskType bits) {\n  \/\/ The idea with these bits is to optimize the common case of a\n  \/\/ single-inheritance graph (that is, an inheritance tree), or a\n  \/\/ single-inheritance subgraph of the full multiple-inheritance\n  \/\/ graph (i.e. a subtree of the inheritance graph).\n\n  \/\/ When we have just single inheritance, we can define a unique\n  \/\/ number for each node in the inheritance tree that allows us to\n  \/\/ immediately determine the inheritance relationship between any\n  \/\/ two nodes in the tree.  We choose a number such that for a given\n  \/\/ node whose number has n bits, each child node has m + n bits\n  \/\/ where the low-order n bits are the same as the parent node's\n  \/\/ bits, and the high-order m bits are unique among each sibling.\n  \/\/ The node at the top of the tree has zero bits.\n\n  \/\/ That way, we can simply compare bitmasks to determine if class A\n  \/\/ inherits from class B.  If the low-order bits are the same, they\n  \/\/ have some ancestry in common.  The highest-order bit that still\n  \/\/ matches corresponds to the lowest node in the tree that they have\n  \/\/ in common; i.e. the node from which they both inherit.\n\n  \/\/ To put it more formally, let count(A) be the number of bits in\n  \/\/ A's number, and count(B) be the number of bits in B's number.  A\n  \/\/ inherits from B if and only if count(B) <= count(A), and the\n  \/\/ lower count(B) bits of A's number are the same as those in B's\n  \/\/ number.\n\n  \/\/ This algorithm breaks down in the presence of multiple\n  \/\/ inheritance, since we can't make up a single number for each node\n  \/\/ any more.  We still take advantage of the algorithm by\n  \/\/ considering each single-inheritance subgraph separately.\n\n  \/\/ To handle multiple inheritance, we reset the numbers to zero\n  \/\/ every time we come across a multiple-inheritance node (this\n  \/\/ begins a new subtree).  There are relatively few of these\n  \/\/ \"subtree top\" nodes, and we record the explicit inheritance of\n  \/\/ each one from all of its ancestor \"subtree top\" nodes within the\n  \/\/ node itself.\n\n  if (top != this && _parent_classes.size() != 1) {\n    nassertv(!_parent_classes.empty());\n  \n    \/\/ This class multiply inherits; it therefore begins a new subtree.\n\n    \/\/ Copy in the inheritance relations from our parent subtree tops.\n    _top_inheritance.insert(_top_inheritance.end(),\n                            top->_top_inheritance.begin(), \n                            top->_top_inheritance.end());\n    _top_inheritance.push_back(Inherit(top, bit_count, bits));\n\n    _visit_count++;\n    if (_visit_count == (int)_parent_classes.size()) {\n      \/\/ This is the last time we'll visit this node, so continue the\n      \/\/ recursion now.\n      nassertv(_inherit._top == (TypeRegistryNode *)NULL);\n      sort(_top_inheritance.begin(), _top_inheritance.end());\n      define_subtree();\n    }\n\n  } else {\n    \/\/ This class singly inherits, so this had better be the only time\n    \/\/ this function is called on it since clear_subtree().\n    nassertv(_inherit._top == (TypeRegistryNode *)NULL);\n\n    nassertv(bit_count < (int)(sizeof(SubtreeMaskType) * 8));\n\n    _inherit = Inherit(top, bit_count, bits);\n\n    \/\/ Now, how many more bits do we need to encode each of our\n    \/\/ children?\n    int num_children = _child_classes.size();\n    int more_bits = 0;\n    int i = num_children - 1;\n    while (i > 0) {\n      more_bits++;\n      i >>= 1;\n    }\n\n    \/\/ We need at least one bit, even if there is only one child, so\n    \/\/ we can differentiate parent from child.\n    more_bits = max(more_bits, 1);\n\n    nassertv(more_bits < (int)(sizeof(SubtreeMaskType) * 8));\n\n    if (bit_count + more_bits > (int)(sizeof(SubtreeMaskType) * 8)) {\n      \/\/ Too many bits; we need to start a new subtree right here.\n      \/\/ This node becomes a subtree top node, even though it's not a\n      \/\/ multiple-inheritance node.\n      nassertv(top != this);\n      _top_inheritance = top->_top_inheritance;\n      _top_inheritance.push_back(_inherit);\n      sort(_top_inheritance.begin(), _top_inheritance.end());\n      _inherit = Inherit();\n      define_subtree();\n\n    } else {\n      \/\/ Still plenty of bits, so keep going.\n      for (i = 0; i < num_children; i++) {\n        TypeRegistryNode *child = _child_classes[i];\n        SubtreeMaskType next_bits = ((SubtreeMaskType)i << bit_count);\n\n        child->r_build_subtrees(top, bit_count + more_bits,\n                                bits | next_bits);\n      }\n    }      \n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: TypeRegistryNode::find_top_inherit\n\/\/       Access: Private, Static\n\/\/  Description: Finds the first element in the _top_inheritance array\n\/\/               that matches the indicated base node.  If the base\n\/\/               node does not appear in the _top_inheritance array\n\/\/               (implying that this node does not inherit from the\n\/\/               base node), returns _top_inheritance.end().\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nTypeRegistryNode::TopInheritance::const_iterator TypeRegistryNode::\nfind_top_inherit(const TypeRegistryNode *base) const {\n  TopInheritance::const_iterator ti;\n  for (ti = _top_inheritance.begin(); ti != _top_inheritance.end(); ++ti) {\n    if ((*ti)._top == base) {\n      return ti;\n    }\n  }\n\n  return _top_inheritance.end();\n}\n \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: TypeRegistryNode::check_derived_from\n\/\/       Access: Private, Static\n\/\/  Description: A recursive function to double-check the result of\n\/\/               is_derived_from().  This is the slow,\n\/\/               examine-the-whole-graph approach, as opposed to the\n\/\/               clever and optimal algorithm of is_derived_from();\n\/\/               it's intended to be used only for debugging said\n\/\/               clever algorithm.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool TypeRegistryNode::\ncheck_derived_from(const TypeRegistryNode *child, \n                   const TypeRegistryNode *base) {\n  if (child == base) {\n    return true;\n  }\n\n  Classes::const_iterator ni;\n  for (ni = child->_parent_classes.begin(); \n       ni != child->_parent_classes.end();\n       ++ni) {\n    if (check_derived_from(*ni, base)) {\n      return true;\n    }\n  }\n\n  return false;\n}\n<commit_msg>paranoid_inheritance for now<commit_after>\/\/ Filename: typeRegistryNode.cxx\n\/\/ Created by:  drose (06Aug01)\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ PANDA 3D SOFTWARE\n\/\/ Copyright (c) 2001, Disney Enterprises, Inc.  All rights reserved\n\/\/\n\/\/ All use of this software is subject to the terms of the Panda 3d\n\/\/ Software license.  You should have received a copy of this license\n\/\/ along with this source code; you will also find a current copy of\n\/\/ the license at http:\/\/www.panda3d.org\/license.txt .\n\/\/\n\/\/ To contact the maintainers of this program write to\n\/\/ panda3d@yahoogroups.com .\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"typeRegistryNode.h\"\n\n#include <algorithm>\n\n\/\/ Define this to double-check all the inheritance derivations.\n#ifndef NDEBUG\n#define PARANOID_INHERITANCE\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: TypeRegistryNode::Constructor\n\/\/       Access: Public\n\/\/  Description:\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nTypeRegistryNode::\nTypeRegistryNode(TypeHandle handle, const string &name, TypeHandle &ref) :\n  _handle(handle), _name(name), _ref(ref) \n{\n  clear_subtree();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: TypeRegistryNode::is_derived_from\n\/\/       Access: Public, Static\n\/\/  Description: Returns true if the child RegistryNode represents a\n\/\/               class that inherits directly or indirectly from the\n\/\/               class represented by the base RegistryNode.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool TypeRegistryNode::\nis_derived_from(const TypeRegistryNode *child, const TypeRegistryNode *base) {\n  \/\/ This function is the basis for TypedObject::is_of_type(), which\n  \/\/ gets used quite frequently within Panda, often in inner-loop\n  \/\/ code.  Therefore, we go through some pains to make this function\n  \/\/ as efficient as possible.\n\n  \/\/ First, compare the subtree tops.  If they are the same, then this\n  \/\/ node and the base node are within the same single-inheritance\n  \/\/ subtree, and we can use our bitmask trick to determine the\n  \/\/ relationship with no additional work.  (See r_build_subtrees()).\n\n  if (child->_inherit._top == base->_inherit._top) {\n    nassertr(child->_inherit._top != (TypeRegistryNode *)NULL, false);\n\n    bool derives = \n      Inherit::is_derived_from(child->_inherit, base->_inherit);\n\n#ifdef PARANOID_INHERITANCE\n    bool paranoid_derives = check_derived_from(child, base);\n    if (derives != paranoid_derives) {\n      express_cat.error()\n        << \"Inheritance test for \" << child->_name \n        << \" from \" << base->_name << \" failed!\\n\"\n        << \"Result: \" << derives << \" should have been: \"\n        << paranoid_derives << \"\\n\"\n        << \"Classes are in the same single inheritance subtree, children of \"\n        << child->_inherit._top->_name << \"\\n\"\n        << hex\n        << child->_name << \" has mask \" << child->_inherit._mask\n        << \" and bits \" << child->_inherit._bits << \"\\n\"\n        << base->_name << \" has mask \" << base->_inherit._mask\n        << \" and bits \" << base->_inherit._bits << \"\\n\"\n        << dec;\n      return paranoid_derives;\n    }\n#endif\n\n    \/*\n    cerr << \"trivial: \" << child->_name << \" vs. \" << base->_name\n         << \" (\" << child->_inherit._top->_name << \") = \" << derives << \"\\n\";\n    *\/\n\n    return derives;\n  }\n\n  \/\/ The two nodes are not within the same single-inheritance subtree.\n  \/\/ This complicates things a bit.\n\n  \/\/ First, we should check whether the subtree tops of the two nodes\n  \/\/ inherit from each other.\n  const TypeRegistryNode *child_top = child->_inherit._top;\n  const TypeRegistryNode *base_top = base->_inherit._top;\n\n  bool derives = false;\n\n  \/\/ If child_top does not inherit from base_top, it follows that\n  \/\/ child does not inherit from base.\n  TopInheritance::const_iterator ti = child_top->find_top_inherit(base_top);\n\n  while (ti != child_top->_top_inheritance.end() && \n         (*ti)._top == base_top &&\n         !derives) {\n    \/\/ If child_top *does* inherit from base_top, then child may or\n    \/\/ may not inherit from base.  This depends on the exact path of\n    \/\/ inheritance.  Since there might be multiple paths from\n    \/\/ child_top to base_top, we have to examine all of them.\n    const Inherit &connection = (*ti);\n\n    \/\/ Here is one inheritance from child_top to base_top.  If the\n    \/\/ connecting node inherits from base, then child also inherits\n    \/\/ from base.  If the connecting node does not inherit from base,\n    \/\/ we must keep looking.\n    derives = Inherit::is_derived_from(connection, base->_inherit);\n\n    ++ti;\n  }\n\n#ifdef PARANOID_INHERITANCE\n  bool paranoid_derives = check_derived_from(child, base);\n  if (derives != paranoid_derives) {\n    express_cat.error()\n      << \"Inheritance test for \" << child->_name \n      << \" from \" << base->_name << \" failed!\\n\"\n      << \"Result: \" << derives << \" should have been: \"\n      << paranoid_derives << \"\\n\"\n      << child->_name << \" is a descendent of \"\n      << child_top->_name << \"\\n\"\n      << base->_name << \" is a descendent of \"\n      << base_top->_name << \"\\n\";\n    return paranoid_derives;\n  }\n#endif\n\n  \/*\n  cerr << \"complex: \" << child->_name << \" (\" << child->_inherit._top->_name\n       << \") vs. \" << base->_name << \" (\" << base->_inherit._top->_name\n       << \") = \" << derives << \"\\n\";\n  *\/\n  return derives;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: TypeRegistryNode::get_parent_towards\n\/\/       Access: Public, Static\n\/\/  Description: Returns the first parent class of child that is a\n\/\/               descendant of the indicated base class.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nTypeHandle TypeRegistryNode::\nget_parent_towards(const TypeRegistryNode *child,\n                   const TypeRegistryNode *base) {\n  if (child == base) {\n    return child->_handle;\n  }\n\n  Classes::const_iterator ni;\n  for (ni = child->_parent_classes.begin(); \n       ni != child->_parent_classes.end(); ++ni) {\n    if (is_derived_from((*ni), base)) {\n      return (*ni)->_handle;\n    }\n  }\n\n  return TypeHandle::none();\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: TypeRegistryNode::clear_subtree\n\/\/       Access: Public\n\/\/  Description: Removes any subtree definition previously set up via\n\/\/               define_subtree(), in preparation for rebuilding the\n\/\/               subtree data.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid TypeRegistryNode::\nclear_subtree() {\n  _inherit = Inherit();\n  _top_inheritance.clear();\n  _visit_count = 0;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: TypeRegistryNode::define_subtree\n\/\/       Access: Public\n\/\/  Description: Indicates that this TypeRegistryNode is the top of a\n\/\/               subtree within the inheritance graph (typically, this\n\/\/               indicates a multiple-inheritance node).  Builds all\n\/\/               the subtree_mask etc. flags for nodes at this level\n\/\/               and below.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid TypeRegistryNode::\ndefine_subtree() {\n  \/\/  cerr << \"Building subtree for \" << _name << \", top inheritance is:\\n\";\n\n    \/*\n  TopInheritance::const_iterator ti;\n  for (ti = _top_inheritance.begin(); ti != _top_inheritance.end(); ++ti) {\n    const Inherit &t = (*ti);\n    cerr << \"  from \" << t._top->_name << \" via \"\n         << hex << t._bits << \" \/ \" << t._mask << dec << \"\\n\";\n  }\n    *\/\n\n  r_build_subtrees(this, 0, 0);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: TypeRegistryNode::r_build_subtrees\n\/\/       Access: Public\n\/\/  Description: Recursively builds up all the subtree cache\n\/\/               information for this node and the ones below.  This\n\/\/               information is used to quickly determine class\n\/\/               inheritance.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid TypeRegistryNode::\nr_build_subtrees(TypeRegistryNode *top, int bit_count, \n                 TypeRegistryNode::SubtreeMaskType bits) {\n  \/\/ The idea with these bits is to optimize the common case of a\n  \/\/ single-inheritance graph (that is, an inheritance tree), or a\n  \/\/ single-inheritance subgraph of the full multiple-inheritance\n  \/\/ graph (i.e. a subtree of the inheritance graph).\n\n  \/\/ When we have just single inheritance, we can define a unique\n  \/\/ number for each node in the inheritance tree that allows us to\n  \/\/ immediately determine the inheritance relationship between any\n  \/\/ two nodes in the tree.  We choose a number such that for a given\n  \/\/ node whose number has n bits, each child node has m + n bits\n  \/\/ where the low-order n bits are the same as the parent node's\n  \/\/ bits, and the high-order m bits are unique among each sibling.\n  \/\/ The node at the top of the tree has zero bits.\n\n  \/\/ That way, we can simply compare bitmasks to determine if class A\n  \/\/ inherits from class B.  If the low-order bits are the same, they\n  \/\/ have some ancestry in common.  The highest-order bit that still\n  \/\/ matches corresponds to the lowest node in the tree that they have\n  \/\/ in common; i.e. the node from which they both inherit.\n\n  \/\/ To put it more formally, let count(A) be the number of bits in\n  \/\/ A's number, and count(B) be the number of bits in B's number.  A\n  \/\/ inherits from B if and only if count(B) <= count(A), and the\n  \/\/ lower count(B) bits of A's number are the same as those in B's\n  \/\/ number.\n\n  \/\/ This algorithm breaks down in the presence of multiple\n  \/\/ inheritance, since we can't make up a single number for each node\n  \/\/ any more.  We still take advantage of the algorithm by\n  \/\/ considering each single-inheritance subgraph separately.\n\n  \/\/ To handle multiple inheritance, we reset the numbers to zero\n  \/\/ every time we come across a multiple-inheritance node (this\n  \/\/ begins a new subtree).  There are relatively few of these\n  \/\/ \"subtree top\" nodes, and we record the explicit inheritance of\n  \/\/ each one from all of its ancestor \"subtree top\" nodes within the\n  \/\/ node itself.\n\n  if (top != this && _parent_classes.size() != 1) {\n    nassertv(!_parent_classes.empty());\n  \n    \/\/ This class multiply inherits; it therefore begins a new subtree.\n\n    \/\/ Copy in the inheritance relations from our parent subtree tops.\n    _top_inheritance.insert(_top_inheritance.end(),\n                            top->_top_inheritance.begin(), \n                            top->_top_inheritance.end());\n    _top_inheritance.push_back(Inherit(top, bit_count, bits));\n\n    _visit_count++;\n    if (_visit_count == (int)_parent_classes.size()) {\n      \/\/ This is the last time we'll visit this node, so continue the\n      \/\/ recursion now.\n      nassertv(_inherit._top == (TypeRegistryNode *)NULL);\n      sort(_top_inheritance.begin(), _top_inheritance.end());\n      define_subtree();\n    }\n\n  } else {\n    \/\/ This class singly inherits, so this had better be the only time\n    \/\/ this function is called on it since clear_subtree().\n    nassertv(_inherit._top == (TypeRegistryNode *)NULL);\n\n    nassertv(bit_count < (int)(sizeof(SubtreeMaskType) * 8));\n\n    _inherit = Inherit(top, bit_count, bits);\n\n    \/\/ Now, how many more bits do we need to encode each of our\n    \/\/ children?\n    int num_children = _child_classes.size();\n    int more_bits = 0;\n    int i = num_children - 1;\n    while (i > 0) {\n      more_bits++;\n      i >>= 1;\n    }\n\n    \/\/ We need at least one bit, even if there is only one child, so\n    \/\/ we can differentiate parent from child.\n    more_bits = max(more_bits, 1);\n\n    nassertv(more_bits < (int)(sizeof(SubtreeMaskType) * 8));\n\n    if (bit_count + more_bits > (int)(sizeof(SubtreeMaskType) * 8)) {\n      \/\/ Too many bits; we need to start a new subtree right here.\n      \/\/ This node becomes a subtree top node, even though it's not a\n      \/\/ multiple-inheritance node.\n      nassertv(top != this);\n      _top_inheritance = top->_top_inheritance;\n      _top_inheritance.push_back(_inherit);\n      sort(_top_inheritance.begin(), _top_inheritance.end());\n      _inherit = Inherit();\n      define_subtree();\n\n    } else {\n      \/\/ Still plenty of bits, so keep going.\n      for (i = 0; i < num_children; i++) {\n        TypeRegistryNode *child = _child_classes[i];\n        SubtreeMaskType next_bits = ((SubtreeMaskType)i << bit_count);\n\n        child->r_build_subtrees(top, bit_count + more_bits,\n                                bits | next_bits);\n      }\n    }      \n  }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: TypeRegistryNode::find_top_inherit\n\/\/       Access: Private, Static\n\/\/  Description: Finds the first element in the _top_inheritance array\n\/\/               that matches the indicated base node.  If the base\n\/\/               node does not appear in the _top_inheritance array\n\/\/               (implying that this node does not inherit from the\n\/\/               base node), returns _top_inheritance.end().\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nTypeRegistryNode::TopInheritance::const_iterator TypeRegistryNode::\nfind_top_inherit(const TypeRegistryNode *base) const {\n  TopInheritance::const_iterator ti;\n  for (ti = _top_inheritance.begin(); ti != _top_inheritance.end(); ++ti) {\n    if ((*ti)._top == base) {\n      return ti;\n    }\n  }\n\n  return _top_inheritance.end();\n}\n \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: TypeRegistryNode::check_derived_from\n\/\/       Access: Private, Static\n\/\/  Description: A recursive function to double-check the result of\n\/\/               is_derived_from().  This is the slow,\n\/\/               examine-the-whole-graph approach, as opposed to the\n\/\/               clever and optimal algorithm of is_derived_from();\n\/\/               it's intended to be used only for debugging said\n\/\/               clever algorithm.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool TypeRegistryNode::\ncheck_derived_from(const TypeRegistryNode *child, \n                   const TypeRegistryNode *base) {\n  if (child == base) {\n    return true;\n  }\n\n  Classes::const_iterator ni;\n  for (ni = child->_parent_classes.begin(); \n       ni != child->_parent_classes.end();\n       ++ni) {\n    if (check_derived_from(*ni, base)) {\n      return true;\n    }\n  }\n\n  return false;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"engpar_zoltan.h\"\n#include <PCU.h>\n#include <agiMigration.h>\n#include <ngraph.h>\n#include <stdexcept>\n#include <engpar_support.h>\n#include \"engpar_split_input.h\"\n#ifdef HAS_ZOLTAN\n#include <zoltan.h>\n#endif\n\nnamespace engpar {\n#ifdef HAS_ZOLTAN\n  void setParameters(SplitInput* input, struct Zoltan_Struct* zz, int target_parts);\n  void setCallbacks(SplitInput* input, struct Zoltan_Struct* zz);\n  \n  agi::Migration* EnGPar_Zoltan(SplitInput* input, int target_parts, bool isLocal) {\n    float version;\n    int ret = Zoltan_Initialize(0, NULL, &version);\n    if (ret != ZOLTAN_OK) {\n      if (!PCU_Comm_Self())\n        EnGPar_Error_Message(\"Zoltan failed to initialize\\n\");\n      throw std::runtime_error(\"Zoltan failed to initialize\");\n    }\n\n    MPI_Comm comm;\n    if (isLocal)\n      comm = MPI_COMM_SELF;\n    else\n      comm = PCU_Get_Comm();\n\n    struct Zoltan_Struct* zz = Zoltan_Create(comm);\n    \/\/TODO: make some of these parameters changable in the input\n    Zoltan_Set_Param(zz,\"LB_METHOD\", \"HYPERGRAPH\");\n    Zoltan_Set_Param(zz,\"HYPERGRAPH_PACKAGE\", \"PHG\");\n    Zoltan_Set_Param(zz,\"LB_APPROACH\", \"REPARTITION\");\n\n    setParameters(input, zz, target_parts);\n    setCallbacks(input, zz);\n\n    int changes = 0;\n    int ngids = 1, nlids = 1;\n    int num_import = 0;\n    ZOLTAN_ID_PTR import_gids = NULL, import_lids = NULL;\n    int* import_procs = NULL, *import_parts = NULL;\n    int num_export = 0;\n    ZOLTAN_ID_PTR export_gids = NULL, export_lids = NULL;\n    int* export_procs = NULL, *export_parts = NULL;\n\n    ret = Zoltan_LB_Partition(zz, &changes, &ngids, &nlids,\n                              &num_import, &import_gids, &import_lids,\n                              &import_procs, &import_parts,\n                              &num_export, &export_gids, &export_lids,\n                              &export_procs, &export_parts);\n    if (ret != ZOLTAN_OK) {\n      if (!PCU_Comm_Self())\n        EnGPar_Error_Message(\"Zoltan_LB_Partition failed\\n\");\n      throw std::runtime_error(\"Zoltan_LB_Partition failed\");\n    }\n \n    agi::Migration* plan = new agi::Migration(input->g);\n\n    agi::PNgraph* pg = input->g->publicize();\n    for (int i = 0; i < num_export; ++i) {\n      agi::GraphVertex* v = pg->getVertex(export_lids[i]);\n      plan->insert(std::make_pair(v,export_procs[i]));\n    }\n\n    Zoltan_LB_Free_Part(&import_gids, &import_lids, &import_procs, &import_parts);\n    Zoltan_LB_Free_Part(&export_gids, &export_lids, &export_procs, &export_parts);\n    Zoltan_Destroy(&zz);\n    \n    return plan;\n  }\n\n  void setParameters(SplitInput* input, struct Zoltan_Struct* zz, int target_parts) {\n    Zoltan_Set_Param(zz,\"OBJ_WEIGHT_DIM\",\"1\");\n    \/\/Zoltan_Set_Param(zz,\"EDGE_WEIGHT_DIM\",\"1\");\n    char param[100];\n    sprintf(param,\"%d\",target_parts);\n    Zoltan_Set_Param(zz, \"NUM_GLOBAL_PARTS\",param);\n    Zoltan_Set_Param(zz, \"NUM_LOCAL_PARTS\",\"1\");\n    Zoltan_Set_Param(zz,\"RETURN_LISTS\",\"EXPORT\");\n    sprintf(param,\"%f\",input->tolerance);\n    Zoltan_Set_Param(zz,\"IMBALANCE_TOL\",param);\n  }\n\n  \/******  Callback functions  ******\/\n  \/\/ZOLTAN_NUM_OBJ_FN\n  int numVertices(void* data, int *ierr) {\n    agi::Ngraph* g = static_cast<agi::Ngraph*>(data);\n    *ierr = ZOLTAN_OK;\n    return g->numLocalVtxs();\n  }\n\n  \/\/ZOLTAN_OBJ_LIST_FN\n  void getVertices(void* data, int ngid, int nlid,\n                   ZOLTAN_ID_PTR gids, ZOLTAN_ID_PTR lids,\n                   int nwgts, float* wgts, int* ierr) {\n    agi::Ngraph* g = static_cast<agi::Ngraph*>(data);\n\n    agi::GraphVertex* v;\n    agi::VertexIterator* vitr = g->begin();\n    while ((v = g->iterate(vitr))) {\n      agi::lid_t l = g->localID(v);\n      lids[l*nlid] = l;\n      gids[l*ngid] = g->globalID(v);\n      wgts[l*nwgts] = g->weight(v);\n    }\n    *ierr = ZOLTAN_OK;\n  }\n\n  \/\/ZOLTAN_HG_SIZE_CS_FN\n  void numHyperedges(void* data, int* numVtxs, int* numPins, int* format, int* ierr) {\n    agi::Ngraph* g = static_cast<agi::Ngraph*>(data);\n    *numVtxs = g->numLocalVtxs();\n    \/\/TODO: this number is inaccurate in parallel\n    *numPins = g->numLocalPins();\n    *format = ZOLTAN_COMPRESSED_VERTEX;\n    *ierr = ZOLTAN_OK;\n  }\n\n  \/\/ZOLTAN_HG_CS_FN\n  void getHyperedges(void* data, int ngid, int, int, int,\n                     ZOLTAN_ID_PTR vtx_gids, int* offsets, ZOLTAN_ID_PTR edge_gids, int* ierr) {\n    agi::Ngraph* g = static_cast<agi::Ngraph*>(data);\n    agi::GraphVertex* v;\n    agi::VertexIterator* vitr = g->begin();\n    int index = 0;\n    offsets[0] = 0;\n    while ((v = g->iterate(vitr))) {\n      agi::lid_t lid = g->localID(v);\n      vtx_gids[lid*ngid] = g->globalID(v);\n      if (lid < g->numLocalVtxs()-1)\n        offsets[lid+1] = offsets[lid] + g->degree(v); \n      agi::GraphEdge* e;\n      agi::EdgeIterator* eitr = g->edges(v);\n      while ((e = g->iterate(eitr))) {\n        edge_gids[index++] = g->globalID(e);\n      }\n      g->destroy(eitr);\n    }\n    *ierr = ZOLTAN_OK;\n  }\n\n  \/\/ZOLTAN_HG_SIZE_EDGE_WTS_FN\n  void numHyperedgeWeights(void *data, int* num_edges, int* ierr) {\n    agi::Ngraph* g = static_cast<agi::Ngraph*>(data);\n    *num_edges = g->numLocalEdges();\n    *ierr = ZOLTAN_OK;\n  }\n  \n  \/\/ZOLTAN_HG_EDGE_ETS_FN\n  void getHyperedgeWeights(void* data, int ngids, int nlids, int, int nweights,\n                           ZOLTAN_ID_PTR gids, ZOLTAN_ID_PTR lids, float* wgts, int* ierr) {\n    agi::Ngraph* g = static_cast<agi::Ngraph*>(data);\n    agi::GraphEdge* e;\n    agi::EdgeIterator* eitr = g->begin(1);\n    while ((e = g->iterate(eitr))) {\n      agi::lid_t lid = g->localID(e);\n      lids[nlids*lid] = lid;\n      gids[ngids*lid] = g->globalID(e);\n      wgts[nweights*lid] = g->weight(e);\n    }\n    g->destroy(eitr);\n    *ierr = ZOLTAN_OK;\n  }\n  \n  \/\/TODO: add graph callbacks for when using a traditional graph\n\n  void setCallbacks(SplitInput* input, struct Zoltan_Struct* zz) {\n    Zoltan_Set_Fn(zz, ZOLTAN_NUM_OBJ_FN_TYPE,\n                  (void (*)())numVertices,(void*) input->g);\n    Zoltan_Set_Fn(zz, ZOLTAN_OBJ_LIST_FN_TYPE,\n                  (void (*)())getVertices,(void*) input->g);\n    Zoltan_Set_Fn(zz, ZOLTAN_HG_SIZE_CS_FN_TYPE,\n                  (void (*)())numHyperedges,(void*) input->g);\n    Zoltan_Set_Fn(zz, ZOLTAN_HG_CS_FN_TYPE,\n                  (void (*)())getHyperedges,(void*) input->g);\n    \/*\n    Zoltan_Set_Fn(zz, ZOLTAN_HG_SIZE_EDGE_WTS_FN_TYPE,\n                  (void (*)())numHyperedgeWeights,(void*) input->g);\n    Zoltan_Set_Fn(zz, ZOLTAN_HG_EDGE_WTS_FN_TYPE,\n                  (void (*)())getHyperedgeWeights,(void*) input->g);\n    *\/\n  }\n#else\n  agi::Migration* EnGPar_Zoltan(SplitInput*, int, bool) {\n    throw std::runtime_error(\"ZOLTAN not found\\n\");\n  }\n#endif\n}\n<commit_msg>Fix edge weights for zoltan phg splitter<commit_after>#include \"engpar_zoltan.h\"\n#include <PCU.h>\n#include <agiMigration.h>\n#include <ngraph.h>\n#include <stdexcept>\n#include <engpar_support.h>\n#include \"engpar_split_input.h\"\n#ifdef HAS_ZOLTAN\n#include <zoltan.h>\n#endif\n\nnamespace engpar {\n#ifdef HAS_ZOLTAN\n  void setParameters(SplitInput* input, struct Zoltan_Struct* zz, int target_parts);\n  void setCallbacks(SplitInput* input, struct Zoltan_Struct* zz);\n  \n  agi::Migration* EnGPar_Zoltan(SplitInput* input, int target_parts, bool isLocal) {\n    float version;\n    int ret = Zoltan_Initialize(0, NULL, &version);\n    if (ret != ZOLTAN_OK) {\n      if (!PCU_Comm_Self())\n        EnGPar_Error_Message(\"Zoltan failed to initialize\\n\");\n      throw std::runtime_error(\"Zoltan failed to initialize\");\n    }\n\n    MPI_Comm comm;\n    if (isLocal)\n      comm = MPI_COMM_SELF;\n    else\n      comm = PCU_Get_Comm();\n\n    struct Zoltan_Struct* zz = Zoltan_Create(comm);\n    \/\/TODO: make some of these parameters changable in the input\n    Zoltan_Set_Param(zz,\"LB_METHOD\", \"HYPERGRAPH\");\n    Zoltan_Set_Param(zz,\"HYPERGRAPH_PACKAGE\", \"PHG\");\n    Zoltan_Set_Param(zz,\"LB_APPROACH\", \"PARTITION\");\n\n    setParameters(input, zz, target_parts);\n    setCallbacks(input, zz);\n\n    int changes = 0;\n    int ngids = 1, nlids = 1;\n    int num_import = 0;\n    ZOLTAN_ID_PTR import_gids = NULL, import_lids = NULL;\n    int* import_procs = NULL, *import_parts = NULL;\n    int num_export = 0;\n    ZOLTAN_ID_PTR export_gids = NULL, export_lids = NULL;\n    int* export_procs = NULL, *export_parts = NULL;\n\n    ret = Zoltan_LB_Partition(zz, &changes, &ngids, &nlids,\n                              &num_import, &import_gids, &import_lids,\n                              &import_procs, &import_parts,\n                              &num_export, &export_gids, &export_lids,\n                              &export_procs, &export_parts);\n    if (ret != ZOLTAN_OK) {\n      if (!PCU_Comm_Self())\n        EnGPar_Error_Message(\"Zoltan_LB_Partition failed\\n\");\n      throw std::runtime_error(\"Zoltan_LB_Partition failed\");\n    }\n \n    agi::Migration* plan = new agi::Migration(input->g);\n\n    agi::PNgraph* pg = input->g->publicize();\n    for (int i = 0; i < num_export; ++i) {\n      agi::GraphVertex* v = pg->getVertex(export_lids[i]);\n      plan->insert(std::make_pair(v,export_procs[i]));\n    }\n\n    Zoltan_LB_Free_Part(&import_gids, &import_lids, &import_procs, &import_parts);\n    Zoltan_LB_Free_Part(&export_gids, &export_lids, &export_procs, &export_parts);\n    Zoltan_Destroy(&zz);\n    \n    return plan;\n  }\n\n  void setParameters(SplitInput* input, struct Zoltan_Struct* zz, int target_parts) {\n    Zoltan_Set_Param(zz,\"OBJ_WEIGHT_DIM\",\"1\");\n    Zoltan_Set_Param(zz,\"EDGE_WEIGHT_DIM\",\"1\");\n    char param[100];\n    sprintf(param,\"%d\",target_parts);\n    Zoltan_Set_Param(zz, \"NUM_GLOBAL_PARTS\",param);\n    Zoltan_Set_Param(zz, \"NUM_LOCAL_PARTS\",\"1\");\n    Zoltan_Set_Param(zz,\"RETURN_LISTS\",\"EXPORT\");\n    sprintf(param,\"%f\",input->tolerance);\n    Zoltan_Set_Param(zz,\"IMBALANCE_TOL\",param);\n    if (!EnGPar_Check_Verbosity(2))\n      Zoltan_Set_Param(zz,\"DEBUG_LEVEL\",\"0\");\n  }\n\n  \/******  Callback functions  ******\/\n  \/\/ZOLTAN_NUM_OBJ_FN\n  int numVertices(void* data, int *ierr) {\n    agi::Ngraph* g = static_cast<agi::Ngraph*>(data);\n    *ierr = ZOLTAN_OK;\n    return g->numLocalVtxs();\n  }\n\n  \/\/ZOLTAN_OBJ_LIST_FN\n  void getVertices(void* data, int ngid, int nlid,\n                   ZOLTAN_ID_PTR gids, ZOLTAN_ID_PTR lids,\n                   int nwgts, float* wgts, int* ierr) {\n    agi::Ngraph* g = static_cast<agi::Ngraph*>(data);\n\n    agi::GraphVertex* v;\n    agi::VertexIterator* vitr = g->begin();\n    while ((v = g->iterate(vitr))) {\n      agi::lid_t l = g->localID(v);\n      lids[l*nlid] = l;\n      gids[l*ngid] = g->globalID(v);\n      wgts[l*nwgts] = g->weight(v);\n    }\n    *ierr = ZOLTAN_OK;\n  }\n\n  \/\/ZOLTAN_HG_SIZE_CS_FN\n  void numHyperedges(void* data, int* numVtxs, int* numPins, int* format, int* ierr) {\n    agi::Ngraph* g = static_cast<agi::Ngraph*>(data);\n    *numVtxs = g->numLocalVtxs();\n    \/\/TODO: this number is inaccurate in parallel\n    *numPins = g->numLocalPins();\n    *format = ZOLTAN_COMPRESSED_VERTEX;\n    *ierr = ZOLTAN_OK;\n  }\n\n  \/\/ZOLTAN_HG_CS_FN\n  void getHyperedges(void* data, int ngid, int, int, int,\n                     ZOLTAN_ID_PTR vtx_gids, int* offsets, ZOLTAN_ID_PTR edge_gids, int* ierr) {\n    agi::Ngraph* g = static_cast<agi::Ngraph*>(data);\n    agi::GraphVertex* v;\n    agi::VertexIterator* vitr = g->begin();\n    int index = 0;\n    offsets[0] = 0;\n    while ((v = g->iterate(vitr))) {\n      agi::lid_t lid = g->localID(v);\n      vtx_gids[lid*ngid] = g->globalID(v);\n      if (lid < g->numLocalVtxs()-1)\n        offsets[lid+1] = offsets[lid] + g->degree(v); \n      agi::GraphEdge* e;\n      agi::EdgeIterator* eitr = g->edges(v);\n      while ((e = g->iterate(eitr))) {\n        edge_gids[index++] = g->globalID(e);\n      }\n      g->destroy(eitr);\n    }\n    *ierr = ZOLTAN_OK;\n  }\n\n  \/\/ZOLTAN_HG_SIZE_EDGE_WTS_FN\n  void numHyperedgeWeights(void *data, int* num_edges, int* ierr) {\n    agi::Ngraph* g = static_cast<agi::Ngraph*>(data);\n    *num_edges = g->numLocalEdges();\n    *ierr = ZOLTAN_OK;\n  }\n  \n  \/\/ZOLTAN_HG_EDGE_ETS_FN\n  void getHyperedgeWeights(void* data, int ngids, int nlids, int, int nweights,\n                           ZOLTAN_ID_PTR gids, ZOLTAN_ID_PTR lids, float* wgts, int* ierr) {\n    agi::Ngraph* g = static_cast<agi::Ngraph*>(data);\n    agi::GraphEdge* e;\n    agi::EdgeIterator* eitr = g->begin(0);\n    while ((e = g->iterate(eitr))) {\n      agi::lid_t lid = g->localID(e);\n      lids[nlids*lid] = lid;\n      gids[ngids*lid] = g->globalID(e);\n      wgts[nweights*lid] = g->weight(e);\n    }\n    g->destroy(eitr);\n    *ierr = ZOLTAN_OK;\n  }\n  \n  \/\/TODO: add graph callbacks for when using a traditional graph\n\n  void setCallbacks(SplitInput* input, struct Zoltan_Struct* zz) {\n    Zoltan_Set_Fn(zz, ZOLTAN_NUM_OBJ_FN_TYPE,\n                  (void (*)())numVertices,(void*) input->g);\n    Zoltan_Set_Fn(zz, ZOLTAN_OBJ_LIST_FN_TYPE,\n                  (void (*)())getVertices,(void*) input->g);\n    Zoltan_Set_Fn(zz, ZOLTAN_HG_SIZE_CS_FN_TYPE,\n                  (void (*)())numHyperedges,(void*) input->g);\n    Zoltan_Set_Fn(zz, ZOLTAN_HG_CS_FN_TYPE,\n                  (void (*)())getHyperedges,(void*) input->g);\n    Zoltan_Set_Fn(zz, ZOLTAN_HG_SIZE_EDGE_WTS_FN_TYPE,\n                  (void (*)())numHyperedgeWeights,(void*) input->g);\n    Zoltan_Set_Fn(zz, ZOLTAN_HG_EDGE_WTS_FN_TYPE,\n                  (void (*)())getHyperedgeWeights,(void*) input->g);\n  }\n#else\n  agi::Migration* EnGPar_Zoltan(SplitInput*, int, bool) {\n    throw std::runtime_error(\"ZOLTAN not found\\n\");\n  }\n#endif\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"AliAODEvent.h\"\n#include \"AliAnalysisManager.h\"\n#include \"AliAnalysisTask.h\"\n#include \"AliAnalysisTaskMKBase.h\"\n#include \"AliAnalysisTaskSpectraEtaPhi.h\"\n#include \"AliESDEvent.h\"\n#include \"AliESDInputHandler.h\"\n#include \"AliESDtrack.h\"\n#include \"AliESDtrackCuts.h\"\n#include \"AliGenEventHeader.h\"\n#include \"AliHeader.h\"\n#include \"AliLog.h\"\n#include \"AliMCEvent.h\"\n#include \"AlidNdPtTools.h\"\n#include \"TChain.h\"\n#include \"TGeoGlobalMagField.h\"\n#include \"TH1F.h\"\n#include \"TList.h\"\n#include \"TRandom.h\"\n#include \"TRandom3.h\"\n#include <iostream>\n\nnamespace {\nusing namespace AnalysisHelpers;\nusing namespace std;\n} \/\/ namespace\n\n\/\/\/ \\cond CLASSIMP\nClassImp(AliAnalysisTaskSpectraEtaPhi)\n    \/\/\/ \\endcond\n    \/\/_____________________________________________________________________________\n\n    AliAnalysisTaskSpectraEtaPhi::AliAnalysisTaskSpectraEtaPhi()\n    : AliAnalysisTaskMKBase(), fHistEffContNCluster{}, fHistEffContZ{},\n      fHistEffContEta{}, fHistEffContPhi{}, fHistTrackNCluster{}, fHistTrackZ{},\n      fHistTrackEta{}, fHistTrackPhi{}, fHistEvent{} {\n    \/\/ default contructor\n}\n\n\/\/_____________________________________________________________________________\n\nAliAnalysisTaskSpectraEtaPhi::AliAnalysisTaskSpectraEtaPhi(const char* name)\n    : AliAnalysisTaskMKBase(name), fHistEffContNCluster{}, fHistEffContZ{},\n      fHistEffContEta{}, fHistEffContPhi{}, fHistTrackNCluster{}, fHistTrackZ{},\n      fHistTrackEta{}, fHistTrackPhi{}, fHistEvent{} {\n    \/\/ constructor\n}\n\n\/\/_____________________________________________________________________________\n\nAliAnalysisTaskSpectraEtaPhi::~AliAnalysisTaskSpectraEtaPhi() {\n    \/\/ destructor\n}\n\n\/\/_____________________________________________________________________________\n\nvoid AliAnalysisTaskSpectraEtaPhi::AddOutput() {\n    \/\/ general binnings\n    std::vector<double> centBins = {0., 10, 20., 30., 40, 50, 60, 70, 80, 90};\n    std::vector<double> ptBins = {0.0, 0.1, 0.2, 0.3, 0.4,  0.5, 0.6, 0.7,\n                                  0.8, 0.9, 1.0, 1.1, 1.2,  1.3, 1.4, 1.5,\n                                  2.0, 3.5, 5.0, 7.5, 10.0, 20.0};\n    const Int_t nbins = 54;\n    std::vector<double> Multbins;\n    Multbins.resize(nbins + 1);\n    Multbins.push_back(-0.5);\n    {\n        int i = 0;\n        for (; i <= 10; i++) {\n            Multbins.push_back(Multbins.back() + 1);\n        }\n        for (; i <= 10 + 9; i++) {\n            Multbins.push_back(Multbins.back() + 10);\n        }\n        for (; i <= 10 + 9 + 9; i++) {\n            Multbins.push_back(Multbins.back() + 100);\n        }\n        for (; i <= 10 + 9 + 9 + 25; i++) {\n            Multbins.push_back(Multbins.back() + 200);\n        }\n    }\n\n    const int nCuts = 8;\n    Axis cutAxis = {\"cut\", \"cut setting\", {-1.5, nCuts - 0.5}, nCuts + 1};\n    Axis centAxis = {\"cent\", \"centrality\", centBins};\n    Axis ptAxis = {\"pt\", \"p_{T} [GeV\/c]\", ptBins};\n    Axis etaAxis = {\"eta\", \"#eta\", {-0.8, 0.8}, 8};\n    Axis phiAxis = {\n        \"phi\", \"#phi\", {0., 2. * M_PI}, 36}; \/\/ 36 to see tpc sectors\n    Axis mcInfoAxis = {\"mcInfo\", \"mcInfo\", {-0.3, 3.5}, 4};\n    Axis NClusterAxis = {\"NClusterPID\", \"N_{Cluster}^{PID}\", {-0.5, 160.5}, 20};\n    Axis ZInnerAxis = {\"ZInnerParam\", \"Z_{Inner}\", {-30.5, 29.5}, 60};\n    Axis ChargeQAxis = {\"MCQ\", \"Q\", {-1.5, 1.5}, 3};\n    Axis multAxis = {\"mult\", \"N_{ch}\", Multbins};\n    Axis zVrtAxis = {\"zV\", \"vertex_{Z}\", {-20, 20}, 8};\n\n    double requiredMemory = 0;\n    \/\/ MC\n    fHistEffContNCluster.AddAxis(centAxis);\n    fHistEffContNCluster.AddAxis(ptAxis);\n    fHistEffContNCluster.AddAxis(NClusterAxis);\n    fHistEffContNCluster.AddAxis(cutAxis);\n    fHistEffContNCluster.AddAxis(mcInfoAxis);\n    fOutputList->Add(fHistEffContNCluster.GenerateHist(\"fHistEffContNCluster\"));\n    requiredMemory += fHistEffContNCluster.GetSize();\n\n    fHistEffContZ.AddAxis(centAxis);\n    fHistEffContZ.AddAxis(ptAxis);\n    fHistEffContZ.AddAxis(ZInnerAxis);\n    fHistEffContZ.AddAxis(cutAxis);\n    fHistEffContZ.AddAxis(mcInfoAxis);\n    fOutputList->Add(fHistEffContZ.GenerateHist(\"fHistEffContZ\"));\n    requiredMemory += fHistEffContZ.GetSize();\n\n    fHistEffContEta.AddAxis(centAxis);\n    fHistEffContEta.AddAxis(ptAxis);\n    fHistEffContEta.AddAxis(etaAxis);\n    fHistEffContEta.AddAxis(cutAxis);\n    fHistEffContEta.AddAxis(mcInfoAxis);\n    fHistEffContEta.AddAxis(ChargeQAxis);\n    fOutputList->Add(fHistEffContEta.GenerateHist(\"fHistEffContEta\"));\n    requiredMemory += fHistEffContEta.GetSize();\n\n    fHistEffContPhi.AddAxis(centAxis);\n    fHistEffContPhi.AddAxis(ptAxis);\n    fHistEffContPhi.AddAxis(phiAxis);\n    fHistEffContPhi.AddAxis(cutAxis);\n    fHistEffContPhi.AddAxis(mcInfoAxis);\n    fOutputList->Add(fHistEffContPhi.GenerateHist(\"fHistEffContPhi\"));\n    requiredMemory += fHistEffContPhi.GetSize();\n\n    \/\/ data\n    fHistTrackNCluster.AddAxis(centAxis);\n    fHistTrackNCluster.AddAxis(ptAxis);\n    fHistTrackNCluster.AddAxis(NClusterAxis);\n    fHistTrackNCluster.AddAxis(cutAxis);\n    fOutputList->Add(fHistTrackNCluster.GenerateHist(\"fHistTrackNCluster\"));\n    requiredMemory += fHistTrackNCluster.GetSize();\n\n    fHistTrackZ.AddAxis(centAxis);\n    fHistTrackZ.AddAxis(ptAxis);\n    fHistTrackZ.AddAxis(ZInnerAxis);\n    fHistTrackZ.AddAxis(cutAxis);\n    fOutputList->Add(fHistTrackZ.GenerateHist(\"fHistTrackZ\"));\n    requiredMemory += fHistTrackZ.GetSize();\n\n    fHistTrackEta.AddAxis(centAxis);\n    fHistTrackEta.AddAxis(ptAxis);\n    fHistTrackEta.AddAxis(etaAxis);\n    fHistTrackEta.AddAxis(cutAxis);\n    fHistTrackEta.AddAxis(ChargeQAxis);\n    fOutputList->Add(fHistTrackEta.GenerateHist(\"fHistTrackEta\"));\n    requiredMemory += fHistTrackEta.GetSize();\n\n    fHistTrackPhi.AddAxis(centAxis);\n    fHistTrackPhi.AddAxis(ptAxis);\n    fHistTrackPhi.AddAxis(phiAxis);\n    fHistTrackPhi.AddAxis(cutAxis);\n    fOutputList->Add(fHistTrackPhi.GenerateHist(\"fHistTrackPhi\"));\n    requiredMemory += fHistTrackPhi.GetSize();\n\n    \/\/ Event hists\n    fHistEvent.AddAxis(centAxis);\n    fHistEvent.AddAxis(multAxis);\n    fHistEvent.AddAxis(zVrtAxis);\n    fOutputList->Add(fHistEvent.GenerateHist(\"fHistEvent\"));\n    requiredMemory += fHistEvent.GetSize();\n\n    AliError(Form(\"Estimated memory usage of histograms: %.0f Bytes (%f MiB)\",\n                  requiredMemory, requiredMemory \/ 1048576));\n}\n\n\/\/_____________________________________________________________________________\n\nBool_t AliAnalysisTaskSpectraEtaPhi::IsEventSelected() {\n    return fIsAcceptedAliEventCuts;\n}\n\n\/\/_____________________________________________________________________________\n\nvoid AliAnalysisTaskSpectraEtaPhi::AnaEvent() {\n\n    LoopOverAllTracks();\n    if (fIsMC)\n        LoopOverAllParticles();\n\n    fHistEvent.Fill(fMultPercentileV0M, fNTracksAcc, fZv);\n}\n\n\/\/_____________________________________________________________________________\n\nvoid AliAnalysisTaskSpectraEtaPhi::AnaTrack(Int_t flag) {\n    \/\/    if (!fAcceptTrackM) return;\n    for (int i = 0; i < 8; ++i) {\n        if (fAcceptTrack[i]) {\n            fHistTrackNCluster.Fill(fMultPercentileV0M, fPt, fTPCSignalN, i);\n            fHistTrackZ.Fill(fMultPercentileV0M, fPt, fZInner, i);\n            fHistTrackEta.Fill(fMultPercentileV0M, fPt, fEta, i, fChargeSign);\n            fHistTrackPhi.Fill(fMultPercentileV0M, fPt, fPhi, i);\n        }\n    }\n}\n\n\/\/_____________________________________________________________________________\n\nvoid AliAnalysisTaskSpectraEtaPhi::AnaTrackMC(Int_t flag) {\n    \/\/    if (!fAcceptTrackM) return;\n\n    if (fMCParticleType == AlidNdPtTools::kOther) {\n        Log(\"RecTrack.PDG.\", fMCPDGCode);\n    }\n    if (TMath::Abs(fMCQ > 1)) {\n        Log(\"RecTrack.Q>1.PDG.\", fMCPDGCode);\n    }\n\n    for (int i = 0; i < 8; ++i) {\n        if (fAcceptTrack[i]) {\n            fHistEffContNCluster.Fill(fMultPercentileV0M, fPt, fTPCSignalN, i,\n                                      fMCProdcutionType);\n            fHistEffContZ.Fill(fMultPercentileV0M, fPt, fZInner, i,\n                               fMCProdcutionType);\n            fHistEffContEta.Fill(fMultPercentileV0M, fPt, fEta, i,\n                                 fMCProdcutionType, fChargeSign);\n            fHistEffContPhi.Fill(fMultPercentileV0M, fPt, fPhi, i,\n                                 fMCProdcutionType);\n        }\n    }\n}\n\n\/\/_____________________________________________________________________________\n\nvoid AliAnalysisTaskSpectraEtaPhi::AnaParticleMC(Int_t flag) {\n    if (!fMCisPrim)\n        return;\n    if (!fMCIsCharged)\n        return;\n    if (TMath::Abs(fMCEta) > 0.8)\n        return;\n\n    if (fMCParticleType == AlidNdPtTools::kOther) {\n        Log(\"GenPrim.PDG.\", fMCPDGCode);\n    }\n    if (TMath::Abs(fMCQ > 1)) {\n        Log(\"GenPrim.Q>1.PDG.\", fMCPDGCode);\n    }\n\n    fHistEffContNCluster.Fill(fMultPercentileV0M, fPt, fTPCSignalN, -1., 3.);\n    fHistEffContZ.Fill(fMultPercentileV0M, fPt, fZInner, -1., 3.);\n    fHistEffContEta.Fill(fMultPercentileV0M, fPt, fEta, -1., 3., fChargeSign);\n    fHistEffContPhi.Fill(fMultPercentileV0M, fPt, fPhi, -1., 3.);\n}\n\n\/\/_____________________________________________________________________________\n\nAliAnalysisTaskSpectraEtaPhi*\nAliAnalysisTaskSpectraEtaPhi::AddTaskSpectra(const char* name,\n                                             const char* outfile) {\n    AliAnalysisManager* mgr = AliAnalysisManager::GetAnalysisManager();\n    if (!mgr) {\n        ::Error(\"AddTaskSpectraEtaPhi\", \"No analysis manager to connect to.\");\n        return 0;\n    }\n\n    \/\/ Check the analysis type using the event handlers connected to the\n    \/\/ analysis manager.\n    \/\/==============================================================================\n    if (!mgr->GetInputEventHandler()) {\n        ::Error(\"AddTaskSpectraEtaPhi\",\n                \"This task requires an input event handler\");\n        return NULL;\n    }\n\n    \/\/ Setup output file\n    \/\/===========================================================================\n    TString fileName = AliAnalysisManager::GetCommonFileName();\n    fileName += \":\";\n    fileName += name; \/\/ create a subfolder in the file\n    if (outfile) {    \/\/ if a finename is given, use that one\n        fileName = TString(outfile);\n    }\n\n    \/\/ create the task\n    \/\/===========================================================================\n    AliAnalysisTaskSpectraEtaPhi* task = new AliAnalysisTaskSpectraEtaPhi(name);\n    if (!task) {\n        return 0;\n    }\n\n    \/\/ configure the task\n    \/\/===========================================================================\n    task->SelectCollisionCandidates(AliVEvent::kAnyINT);\n    task->SetESDtrackCutsM(AlidNdPtTools::CreateESDtrackCuts(\"defaultEta08\"));\n    \/\/ default, nogeo, nogeonogold, geoCut116, geoCut117, geoCut118 geoCut119,\n    \/\/ tpconlyminimal\n    task->SetESDtrackCuts(0, AlidNdPtTools::CreateESDtrackCuts(\"defaultEta08\"));\n    task->SetESDtrackCuts(\n        1, AlidNdPtTools::CreateESDtrackCuts(\"tpcitsnogeoEta08\"));\n    task->SetESDtrackCuts(\n        2, AlidNdPtTools::CreateESDtrackCuts(\"tpcitsnogeonogoldEta08\"));\n    task->SetESDtrackCuts(\n        3, AlidNdPtTools::CreateESDtrackCuts(\"defaultEta08\", 116));\n    task->SetESDtrackCuts(\n        4, AlidNdPtTools::CreateESDtrackCuts(\"defaultEta08\", 117));\n    task->SetESDtrackCuts(\n        5, AlidNdPtTools::CreateESDtrackCuts(\"defaultEta08\", 118));\n    task->SetESDtrackCuts(\n        6, AlidNdPtTools::CreateESDtrackCuts(\"defaultEta08\", 119));\n    task->SetESDtrackCuts(\n        7, AlidNdPtTools::CreateESDtrackCuts(\"tpconlyminimalEta08\"));\n    task->SetNeedEventMult(kTRUE);\n    task->SetNeedTrackIP(kTRUE);\n\n    \/\/ attach the task to the manager and configure in and ouput\n    \/\/===========================================================================\n    mgr->AddTask(task);\n    mgr->ConnectInput(task, 0, mgr->GetCommonInputContainer());\n    mgr->ConnectOutput(\n        task, 1,\n        mgr->CreateContainer(name, TList::Class(),\n                             AliAnalysisManager::kOutputContainer,\n                             fileName.Data()));\n\n    return task;\n}\n<commit_msg>Charged-particles analysis framework: EtaPhi fill mc truth information<commit_after>#include \"AliAODEvent.h\"\n#include \"AliAnalysisManager.h\"\n#include \"AliAnalysisTask.h\"\n#include \"AliAnalysisTaskMKBase.h\"\n#include \"AliAnalysisTaskSpectraEtaPhi.h\"\n#include \"AliESDEvent.h\"\n#include \"AliESDInputHandler.h\"\n#include \"AliESDtrack.h\"\n#include \"AliESDtrackCuts.h\"\n#include \"AliGenEventHeader.h\"\n#include \"AliHeader.h\"\n#include \"AliLog.h\"\n#include \"AliMCEvent.h\"\n#include \"AlidNdPtTools.h\"\n#include \"TChain.h\"\n#include \"TGeoGlobalMagField.h\"\n#include \"TH1F.h\"\n#include \"TList.h\"\n#include \"TRandom.h\"\n#include \"TRandom3.h\"\n#include <iostream>\n\nnamespace {\nusing namespace AnalysisHelpers;\nusing namespace std;\n} \/\/ namespace\n\n\/\/\/ \\cond CLASSIMP\nClassImp(AliAnalysisTaskSpectraEtaPhi)\n    \/\/\/ \\endcond\n    \/\/_____________________________________________________________________________\n\n    AliAnalysisTaskSpectraEtaPhi::AliAnalysisTaskSpectraEtaPhi()\n    : AliAnalysisTaskMKBase(), fHistEffContNCluster{}, fHistEffContZ{},\n      fHistEffContEta{}, fHistEffContPhi{}, fHistTrackNCluster{}, fHistTrackZ{},\n      fHistTrackEta{}, fHistTrackPhi{}, fHistEvent{} {\n    \/\/ default contructor\n}\n\n\/\/_____________________________________________________________________________\n\nAliAnalysisTaskSpectraEtaPhi::AliAnalysisTaskSpectraEtaPhi(const char* name)\n    : AliAnalysisTaskMKBase(name), fHistEffContNCluster{}, fHistEffContZ{},\n      fHistEffContEta{}, fHistEffContPhi{}, fHistTrackNCluster{}, fHistTrackZ{},\n      fHistTrackEta{}, fHistTrackPhi{}, fHistEvent{} {\n    \/\/ constructor\n}\n\n\/\/_____________________________________________________________________________\n\nAliAnalysisTaskSpectraEtaPhi::~AliAnalysisTaskSpectraEtaPhi() {\n    \/\/ destructor\n}\n\n\/\/_____________________________________________________________________________\n\nvoid AliAnalysisTaskSpectraEtaPhi::AddOutput() {\n    \/\/ general binnings\n    std::vector<double> centBins = {0., 10, 20., 30., 40, 50, 60, 70, 80, 90};\n    std::vector<double> ptBins = {0.0, 0.1, 0.2, 0.3, 0.4,  0.5, 0.6, 0.7,\n                                  0.8, 0.9, 1.0, 1.1, 1.2,  1.3, 1.4, 1.5,\n                                  2.0, 3.5, 5.0, 7.5, 10.0, 20.0};\n    const Int_t nbins = 54;\n    std::vector<double> Multbins;\n    Multbins.resize(nbins + 1);\n    Multbins.push_back(-0.5);\n    {\n        int i = 0;\n        for (; i <= 10; i++) {\n            Multbins.push_back(Multbins.back() + 1);\n        }\n        for (; i <= 10 + 9; i++) {\n            Multbins.push_back(Multbins.back() + 10);\n        }\n        for (; i <= 10 + 9 + 9; i++) {\n            Multbins.push_back(Multbins.back() + 100);\n        }\n        for (; i <= 10 + 9 + 9 + 25; i++) {\n            Multbins.push_back(Multbins.back() + 200);\n        }\n    }\n\n    const int nCuts = 8;\n    Axis cutAxis = {\"cut\", \"cut setting\", {-1.5, nCuts - 0.5}, nCuts + 1};\n    Axis centAxis = {\"cent\", \"centrality\", centBins};\n    Axis ptAxis = {\"pt\", \"p_{T} [GeV\/c]\", ptBins};\n    Axis etaAxis = {\"eta\", \"#eta\", {-0.8, 0.8}, 8};\n    Axis phiAxis = {\n        \"phi\", \"#phi\", {0., 2. * M_PI}, 36}; \/\/ 36 to see tpc sectors\n    Axis mcInfoAxis = {\"mcInfo\", \"mcInfo\", {-0.3, 3.5}, 4};\n    Axis NClusterAxis = {\"NClusterPID\", \"N_{Cluster}^{PID}\", {-0.5, 160.5}, 20};\n    Axis ZInnerAxis = {\"ZInnerParam\", \"Z_{Inner}\", {-30.5, 29.5}, 60};\n    Axis ChargeQAxis = {\"MCQ\", \"Q\", {-1.5, 1.5}, 3};\n    Axis multAxis = {\"mult\", \"N_{ch}\", Multbins};\n    Axis zVrtAxis = {\"zV\", \"vertex_{Z}\", {-20, 20}, 8};\n\n    double requiredMemory = 0;\n    \/\/ MC\n    fHistEffContNCluster.AddAxis(centAxis);\n    fHistEffContNCluster.AddAxis(ptAxis);\n    fHistEffContNCluster.AddAxis(NClusterAxis);\n    fHistEffContNCluster.AddAxis(cutAxis);\n    fHistEffContNCluster.AddAxis(mcInfoAxis);\n    fOutputList->Add(fHistEffContNCluster.GenerateHist(\"fHistEffContNCluster\"));\n    requiredMemory += fHistEffContNCluster.GetSize();\n\n    fHistEffContZ.AddAxis(centAxis);\n    fHistEffContZ.AddAxis(ptAxis);\n    fHistEffContZ.AddAxis(ZInnerAxis);\n    fHistEffContZ.AddAxis(cutAxis);\n    fHistEffContZ.AddAxis(mcInfoAxis);\n    fOutputList->Add(fHistEffContZ.GenerateHist(\"fHistEffContZ\"));\n    requiredMemory += fHistEffContZ.GetSize();\n\n    fHistEffContEta.AddAxis(centAxis);\n    fHistEffContEta.AddAxis(ptAxis);\n    fHistEffContEta.AddAxis(etaAxis);\n    fHistEffContEta.AddAxis(cutAxis);\n    fHistEffContEta.AddAxis(mcInfoAxis);\n    fHistEffContEta.AddAxis(ChargeQAxis);\n    fOutputList->Add(fHistEffContEta.GenerateHist(\"fHistEffContEta\"));\n    requiredMemory += fHistEffContEta.GetSize();\n\n    fHistEffContPhi.AddAxis(centAxis);\n    fHistEffContPhi.AddAxis(ptAxis);\n    fHistEffContPhi.AddAxis(phiAxis);\n    fHistEffContPhi.AddAxis(cutAxis);\n    fHistEffContPhi.AddAxis(mcInfoAxis);\n    fOutputList->Add(fHistEffContPhi.GenerateHist(\"fHistEffContPhi\"));\n    requiredMemory += fHistEffContPhi.GetSize();\n\n    \/\/ data\n    fHistTrackNCluster.AddAxis(centAxis);\n    fHistTrackNCluster.AddAxis(ptAxis);\n    fHistTrackNCluster.AddAxis(NClusterAxis);\n    fHistTrackNCluster.AddAxis(cutAxis);\n    fOutputList->Add(fHistTrackNCluster.GenerateHist(\"fHistTrackNCluster\"));\n    requiredMemory += fHistTrackNCluster.GetSize();\n\n    fHistTrackZ.AddAxis(centAxis);\n    fHistTrackZ.AddAxis(ptAxis);\n    fHistTrackZ.AddAxis(ZInnerAxis);\n    fHistTrackZ.AddAxis(cutAxis);\n    fOutputList->Add(fHistTrackZ.GenerateHist(\"fHistTrackZ\"));\n    requiredMemory += fHistTrackZ.GetSize();\n\n    fHistTrackEta.AddAxis(centAxis);\n    fHistTrackEta.AddAxis(ptAxis);\n    fHistTrackEta.AddAxis(etaAxis);\n    fHistTrackEta.AddAxis(cutAxis);\n    fHistTrackEta.AddAxis(ChargeQAxis);\n    fOutputList->Add(fHistTrackEta.GenerateHist(\"fHistTrackEta\"));\n    requiredMemory += fHistTrackEta.GetSize();\n\n    fHistTrackPhi.AddAxis(centAxis);\n    fHistTrackPhi.AddAxis(ptAxis);\n    fHistTrackPhi.AddAxis(phiAxis);\n    fHistTrackPhi.AddAxis(cutAxis);\n    fOutputList->Add(fHistTrackPhi.GenerateHist(\"fHistTrackPhi\"));\n    requiredMemory += fHistTrackPhi.GetSize();\n\n    \/\/ Event hists\n    fHistEvent.AddAxis(centAxis);\n    fHistEvent.AddAxis(multAxis);\n    fHistEvent.AddAxis(zVrtAxis);\n    fOutputList->Add(fHistEvent.GenerateHist(\"fHistEvent\"));\n    requiredMemory += fHistEvent.GetSize();\n\n    AliError(Form(\"Estimated memory usage of histograms: %.0f Bytes (%f MiB)\",\n                  requiredMemory, requiredMemory \/ 1048576));\n}\n\n\/\/_____________________________________________________________________________\n\nBool_t AliAnalysisTaskSpectraEtaPhi::IsEventSelected() {\n    return fIsAcceptedAliEventCuts;\n}\n\n\/\/_____________________________________________________________________________\n\nvoid AliAnalysisTaskSpectraEtaPhi::AnaEvent() {\n\n    LoopOverAllTracks();\n    if (fIsMC)\n        LoopOverAllParticles();\n\n    fHistEvent.Fill(fMultPercentileV0M, fNTracksAcc, fZv);\n}\n\n\/\/_____________________________________________________________________________\n\nvoid AliAnalysisTaskSpectraEtaPhi::AnaTrack(Int_t flag) {\n    \/\/    if (!fAcceptTrackM) return;\n    for (int i = 0; i < 8; ++i) {\n        if (fAcceptTrack[i]) {\n            fHistTrackNCluster.Fill(fMultPercentileV0M, fPt, fTPCSignalN, i);\n            fHistTrackZ.Fill(fMultPercentileV0M, fPt, fZInner, i);\n            fHistTrackEta.Fill(fMultPercentileV0M, fPt, fEta, i, fChargeSign);\n            fHistTrackPhi.Fill(fMultPercentileV0M, fPt, fPhi, i);\n        }\n    }\n}\n\n\/\/_____________________________________________________________________________\n\nvoid AliAnalysisTaskSpectraEtaPhi::AnaTrackMC(Int_t flag) {\n    \/\/    if (!fAcceptTrackM) return;\n\n    if (fMCParticleType == AlidNdPtTools::kOther) {\n        Log(\"RecTrack.PDG.\", fMCPDGCode);\n    }\n    if (TMath::Abs(fMCQ > 1)) {\n        Log(\"RecTrack.Q>1.PDG.\", fMCPDGCode);\n    }\n\n    for (int i = 0; i < 8; ++i) {\n        if (fAcceptTrack[i]) {\n            fHistEffContNCluster.Fill(fMultPercentileV0M, fPt, fTPCSignalN, i,\n                                      fMCProdcutionType);\n            fHistEffContZ.Fill(fMultPercentileV0M, fPt, fZInner, i,\n                               fMCProdcutionType);\n            fHistEffContEta.Fill(fMultPercentileV0M, fPt, fEta, i,\n                                 fMCProdcutionType, fChargeSign);\n            fHistEffContPhi.Fill(fMultPercentileV0M, fPt, fPhi, i,\n                                 fMCProdcutionType);\n        }\n    }\n}\n\n\/\/_____________________________________________________________________________\n\nvoid AliAnalysisTaskSpectraEtaPhi::AnaParticleMC(Int_t flag) {\n    if (!fMCisPrim)\n        return;\n    if (!fMCIsCharged)\n        return;\n    if (TMath::Abs(fMCEta) > 0.8)\n        return;\n\n    if (fMCParticleType == AlidNdPtTools::kOther) {\n        Log(\"GenPrim.PDG.\", fMCPDGCode);\n    }\n    if (TMath::Abs(fMCQ > 1)) {\n        Log(\"GenPrim.Q>1.PDG.\", fMCPDGCode);\n    }\n\n    fHistEffContNCluster.Fill(fMultPercentileV0M, fMCPt, fTPCSignalN, -1., 3.);\n    fHistEffContZ.Fill(fMultPercentileV0M, fMCPt, fZInner, -1., 3.);\n    fHistEffContEta.Fill(fMultPercentileV0M, fMCPt, fMCEta, -1., 3., fChargeSign);\n    fHistEffContPhi.Fill(fMultPercentileV0M, fMCPt, fMCPhi, -1., 3.);\n}\n\n\/\/_____________________________________________________________________________\n\nAliAnalysisTaskSpectraEtaPhi*\nAliAnalysisTaskSpectraEtaPhi::AddTaskSpectra(const char* name,\n                                             const char* outfile) {\n    AliAnalysisManager* mgr = AliAnalysisManager::GetAnalysisManager();\n    if (!mgr) {\n        ::Error(\"AddTaskSpectraEtaPhi\", \"No analysis manager to connect to.\");\n        return 0;\n    }\n\n    \/\/ Check the analysis type using the event handlers connected to the\n    \/\/ analysis manager.\n    \/\/==============================================================================\n    if (!mgr->GetInputEventHandler()) {\n        ::Error(\"AddTaskSpectraEtaPhi\",\n                \"This task requires an input event handler\");\n        return NULL;\n    }\n\n    \/\/ Setup output file\n    \/\/===========================================================================\n    TString fileName = AliAnalysisManager::GetCommonFileName();\n    fileName += \":\";\n    fileName += name; \/\/ create a subfolder in the file\n    if (outfile) {    \/\/ if a finename is given, use that one\n        fileName = TString(outfile);\n    }\n\n    \/\/ create the task\n    \/\/===========================================================================\n    AliAnalysisTaskSpectraEtaPhi* task = new AliAnalysisTaskSpectraEtaPhi(name);\n    if (!task) {\n        return 0;\n    }\n\n    \/\/ configure the task\n    \/\/===========================================================================\n    task->SelectCollisionCandidates(AliVEvent::kAnyINT);\n    task->SetESDtrackCutsM(AlidNdPtTools::CreateESDtrackCuts(\"defaultEta08\"));\n    \/\/ default, nogeo, nogeonogold, geoCut116, geoCut117, geoCut118 geoCut119,\n    \/\/ tpconlyminimal\n    task->SetESDtrackCuts(0, AlidNdPtTools::CreateESDtrackCuts(\"defaultEta08\"));\n    task->SetESDtrackCuts(\n        1, AlidNdPtTools::CreateESDtrackCuts(\"tpcitsnogeoEta08\"));\n    task->SetESDtrackCuts(\n        2, AlidNdPtTools::CreateESDtrackCuts(\"tpcitsnogeonogoldEta08\"));\n    task->SetESDtrackCuts(\n        3, AlidNdPtTools::CreateESDtrackCuts(\"defaultEta08\", 116));\n    task->SetESDtrackCuts(\n        4, AlidNdPtTools::CreateESDtrackCuts(\"defaultEta08\", 117));\n    task->SetESDtrackCuts(\n        5, AlidNdPtTools::CreateESDtrackCuts(\"defaultEta08\", 118));\n    task->SetESDtrackCuts(\n        6, AlidNdPtTools::CreateESDtrackCuts(\"defaultEta08\", 119));\n    task->SetESDtrackCuts(\n        7, AlidNdPtTools::CreateESDtrackCuts(\"tpconlyminimalEta08\"));\n    task->SetNeedEventMult(kTRUE);\n    task->SetNeedTrackIP(kTRUE);\n\n    \/\/ attach the task to the manager and configure in and ouput\n    \/\/===========================================================================\n    mgr->AddTask(task);\n    mgr->ConnectInput(task, 0, mgr->GetCommonInputContainer());\n    mgr->ConnectOutput(\n        task, 1,\n        mgr->CreateContainer(name, TList::Class(),\n                             AliAnalysisManager::kOutputContainer,\n                             fileName.Data()));\n\n    return task;\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 \"ppapi\/tests\/test_utils.h\"\n\n#include \"ppapi\/c\/pp_errors.h\"\n#include \"ppapi\/cpp\/module.h\"\n\nconst PPB_Testing_Dev* GetTestingInterface() {\n  static const PPB_Testing_Dev* g_testing_interface =\n      reinterpret_cast<PPB_Testing_Dev const*>(\n          pp::Module::Get()->GetBrowserInterface(PPB_TESTING_DEV_INTERFACE));\n  return g_testing_interface;\n}\n\nstd::string ReportError(const char* method, int32_t error) {\n  char error_as_string[12];\n  sprintf(error_as_string, \"%d\", error);\n  std::string result = method + std::string(\" failed with error: \") +\n      error_as_string;\n  if (error == PP_ERROR_NOSPACE)\n    result += \". Did you run the test with --unlimited-quota-for-files?\";\n  return result;\n}\n\nTestCompletionCallback::TestCompletionCallback()\n    : result_(PP_ERROR_WOULDBLOCK),\n      post_quit_task_(false) {\n}\n\nint32_t TestCompletionCallback::WaitForResult() {\n  result_ = PP_ERROR_WOULDBLOCK;  \/\/ Reset\n  post_quit_task_ = true;\n  GetTestingInterface()->RunMessageLoop();\n  return result_;\n}\n\nTestCompletionCallback::operator pp::CompletionCallback() const {\n  return pp::CompletionCallback(&TestCompletionCallback::Handler,\n                                const_cast<TestCompletionCallback*>(this));\n}\n\n\/\/ static\nvoid TestCompletionCallback::Handler(void* user_data, int32_t result) {\n  TestCompletionCallback* callback =\n      static_cast<TestCompletionCallback*>(user_data);\n  callback->result_ = result;\n  if (callback->post_quit_task_) {\n    callback->post_quit_task_ = false;\n    GetTestingInterface()->QuitMessageLoop();\n  }\n}\n<commit_msg>Including <stdin.h> to hopefully fix a build error on the ChromeOS bots.<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 \"ppapi\/tests\/test_utils.h\"\n\n#include <stdin.h>\n\n#include \"ppapi\/c\/pp_errors.h\"\n#include \"ppapi\/cpp\/module.h\"\n\nconst PPB_Testing_Dev* GetTestingInterface() {\n  static const PPB_Testing_Dev* g_testing_interface =\n      reinterpret_cast<PPB_Testing_Dev const*>(\n          pp::Module::Get()->GetBrowserInterface(PPB_TESTING_DEV_INTERFACE));\n  return g_testing_interface;\n}\n\nstd::string ReportError(const char* method, int32_t error) {\n  char error_as_string[12];\n  sprintf(error_as_string, \"%d\", error);\n  std::string result = method + std::string(\" failed with error: \") +\n      error_as_string;\n  if (error == PP_ERROR_NOSPACE)\n    result += \". Did you run the test with --unlimited-quota-for-files?\";\n  return result;\n}\n\nTestCompletionCallback::TestCompletionCallback()\n    : result_(PP_ERROR_WOULDBLOCK),\n      post_quit_task_(false) {\n}\n\nint32_t TestCompletionCallback::WaitForResult() {\n  result_ = PP_ERROR_WOULDBLOCK;  \/\/ Reset\n  post_quit_task_ = true;\n  GetTestingInterface()->RunMessageLoop();\n  return result_;\n}\n\nTestCompletionCallback::operator pp::CompletionCallback() const {\n  return pp::CompletionCallback(&TestCompletionCallback::Handler,\n                                const_cast<TestCompletionCallback*>(this));\n}\n\n\/\/ static\nvoid TestCompletionCallback::Handler(void* user_data, int32_t result) {\n  TestCompletionCallback* callback =\n      static_cast<TestCompletionCallback*>(user_data);\n  callback->result_ = result;\n  if (callback->post_quit_task_) {\n    callback->post_quit_task_ = false;\n    GetTestingInterface()->QuitMessageLoop();\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <mutex>\n#include <new>\n\n#define JEMALLOC_CPP_CPP_\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n#include \"jemalloc\/internal\/jemalloc_preamble.h\"\n#include \"jemalloc\/internal\/jemalloc_internal_includes.h\"\n\n#ifdef __cplusplus\n}\n#endif\n\n\/\/ All operators in this file are exported.\n\n\/\/ Possibly alias hidden versions of malloc and sdallocx to avoid an extra plt\n\/\/ thunk?\n\/\/\n\/\/ extern __typeof (sdallocx) sdallocx_int\n\/\/  __attribute ((alias (\"sdallocx\"),\n\/\/\t\tvisibility (\"hidden\")));\n\/\/\n\/\/ ... but it needs to work with jemalloc namespaces.\n\nvoid\t*operator new(std::size_t size);\nvoid\t*operator new[](std::size_t size);\nvoid\t*operator new(std::size_t size, const std::nothrow_t &) noexcept;\nvoid\t*operator new[](std::size_t size, const std::nothrow_t &) noexcept;\nvoid\toperator delete(void *ptr) noexcept;\nvoid\toperator delete[](void *ptr) noexcept;\nvoid\toperator delete(void *ptr, const std::nothrow_t &) noexcept;\nvoid\toperator delete[](void *ptr, const std::nothrow_t &) noexcept;\n\n#if __cpp_sized_deallocation >= 201309\n\/* C++14's sized-delete operators. *\/\nvoid\toperator delete(void *ptr, std::size_t size) noexcept;\nvoid\toperator delete[](void *ptr, std::size_t size) noexcept;\n#endif\n\ntemplate <bool IsNoExcept>\nvoid *\nnewImpl(std::size_t size) noexcept(IsNoExcept) {\n\tvoid *ptr = je_malloc(size);\n\tif (likely(ptr != nullptr))\n\t\treturn ptr;\n\n\twhile (ptr == nullptr) {\n\t\tstd::new_handler handler;\n\t\t\/\/ GCC-4.8 and clang 4.0 do not have std::get_new_handler.\n\t\t{\n\t\t\tstatic std::mutex mtx;\n\t\t\tstd::lock_guard<std::mutex> lock(mtx);\n\n\t\t\thandler = std::set_new_handler(nullptr);\n\t\t\tstd::set_new_handler(handler);\n\t\t}\n\t\tif (handler == nullptr)\n\t\t\tbreak;\n\n\t\ttry {\n\t\t\thandler();\n\t\t} catch (const std::bad_alloc &) {\n\t\t\tbreak;\n\t\t}\n\n\t\tptr = je_malloc(size);\n\t}\n\n\tif (ptr == nullptr && !IsNoExcept)\n\t\tstd::__throw_bad_alloc();\n\treturn ptr;\n}\n\nvoid *\noperator new(std::size_t size) {\n\treturn newImpl<false>(size);\n}\n\nvoid *\noperator new[](std::size_t size) {\n\treturn newImpl<false>(size);\n}\n\nvoid *\noperator new(std::size_t size, const std::nothrow_t &) noexcept {\n\treturn newImpl<true>(size);\n}\n\nvoid *\noperator new[](std::size_t size, const std::nothrow_t &) noexcept {\n\treturn newImpl<true>(size);\n}\n\nvoid\noperator delete(void *ptr) noexcept {\n\tje_free(ptr);\n}\n\nvoid\noperator delete[](void *ptr) noexcept {\n\tje_free(ptr);\n}\n\nvoid\noperator delete(void *ptr, const std::nothrow_t &) noexcept {\n\tje_free(ptr);\n}\n\nvoid operator delete[](void *ptr, const std::nothrow_t &) noexcept {\n\tje_free(ptr);\n}\n\n#if __cpp_sized_deallocation >= 201309\n\nvoid\noperator delete(void *ptr, std::size_t size) noexcept {\n\tif (unlikely(ptr == nullptr)) {\n\t\treturn;\n\t}\n\tje_sdallocx(ptr, size, \/*flags=*\/0);\n}\n\nvoid operator delete[](void *ptr, std::size_t size) noexcept {\n\tif (unlikely(ptr == nullptr)) {\n\t\treturn;\n\t}\n\tje_sdallocx(ptr, size, \/*flags=*\/0);\n}\n\n#endif  \/\/ __cpp_sized_deallocation\n<commit_msg>Split out cold code path in newImpl<commit_after>#include <mutex>\n#include <new>\n\n#define JEMALLOC_CPP_CPP_\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n#include \"jemalloc\/internal\/jemalloc_preamble.h\"\n#include \"jemalloc\/internal\/jemalloc_internal_includes.h\"\n\n#ifdef __cplusplus\n}\n#endif\n\n\/\/ All operators in this file are exported.\n\n\/\/ Possibly alias hidden versions of malloc and sdallocx to avoid an extra plt\n\/\/ thunk?\n\/\/\n\/\/ extern __typeof (sdallocx) sdallocx_int\n\/\/  __attribute ((alias (\"sdallocx\"),\n\/\/\t\tvisibility (\"hidden\")));\n\/\/\n\/\/ ... but it needs to work with jemalloc namespaces.\n\nvoid\t*operator new(std::size_t size);\nvoid\t*operator new[](std::size_t size);\nvoid\t*operator new(std::size_t size, const std::nothrow_t &) noexcept;\nvoid\t*operator new[](std::size_t size, const std::nothrow_t &) noexcept;\nvoid\toperator delete(void *ptr) noexcept;\nvoid\toperator delete[](void *ptr) noexcept;\nvoid\toperator delete(void *ptr, const std::nothrow_t &) noexcept;\nvoid\toperator delete[](void *ptr, const std::nothrow_t &) noexcept;\n\n#if __cpp_sized_deallocation >= 201309\n\/* C++14's sized-delete operators. *\/\nvoid\toperator delete(void *ptr, std::size_t size) noexcept;\nvoid\toperator delete[](void *ptr, std::size_t size) noexcept;\n#endif\n\nJEMALLOC_NOINLINE\nstatic void *\nhandleOOM(std::size_t size, bool nothrow) {\n\tvoid *ptr = nullptr;\n\n\twhile (ptr == nullptr) {\n\t\tstd::new_handler handler;\n\t\t\/\/ GCC-4.8 and clang 4.0 do not have std::get_new_handler.\n\t\t{\n\t\t\tstatic std::mutex mtx;\n\t\t\tstd::lock_guard<std::mutex> lock(mtx);\n\n\t\t\thandler = std::set_new_handler(nullptr);\n\t\t\tstd::set_new_handler(handler);\n\t\t}\n\t\tif (handler == nullptr)\n\t\t\tbreak;\n\n\t\ttry {\n\t\t\thandler();\n\t\t} catch (const std::bad_alloc &) {\n\t\t\tbreak;\n\t\t}\n\n\t\tptr = je_malloc(size);\n\t}\n\n\tif (ptr == nullptr && !nothrow)\n\t\tstd::__throw_bad_alloc();\n\treturn ptr;\n}\n\ntemplate <bool IsNoExcept>\nJEMALLOC_ALWAYS_INLINE\nvoid *\nnewImpl(std::size_t size) noexcept(IsNoExcept) {\n\tvoid *ptr = je_malloc(size);\n\tif (likely(ptr != nullptr))\n\t\treturn ptr;\n\n\treturn handleOOM(size, IsNoExcept);\n}\n\nvoid *\noperator new(std::size_t size) {\n\treturn newImpl<false>(size);\n}\n\nvoid *\noperator new[](std::size_t size) {\n\treturn newImpl<false>(size);\n}\n\nvoid *\noperator new(std::size_t size, const std::nothrow_t &) noexcept {\n\treturn newImpl<true>(size);\n}\n\nvoid *\noperator new[](std::size_t size, const std::nothrow_t &) noexcept {\n\treturn newImpl<true>(size);\n}\n\nvoid\noperator delete(void *ptr) noexcept {\n\tje_free(ptr);\n}\n\nvoid\noperator delete[](void *ptr) noexcept {\n\tje_free(ptr);\n}\n\nvoid\noperator delete(void *ptr, const std::nothrow_t &) noexcept {\n\tje_free(ptr);\n}\n\nvoid operator delete[](void *ptr, const std::nothrow_t &) noexcept {\n\tje_free(ptr);\n}\n\n#if __cpp_sized_deallocation >= 201309\n\nvoid\noperator delete(void *ptr, std::size_t size) noexcept {\n\tif (unlikely(ptr == nullptr)) {\n\t\treturn;\n\t}\n\tje_sdallocx(ptr, size, \/*flags=*\/0);\n}\n\nvoid operator delete[](void *ptr, std::size_t size) noexcept {\n\tif (unlikely(ptr == nullptr)) {\n\t\treturn;\n\t}\n\tje_sdallocx(ptr, size, \/*flags=*\/0);\n}\n\n#endif  \/\/ __cpp_sized_deallocation\n<|endoftext|>"}
{"text":"<commit_before>#include \"engine\/blob.h\"\n#include \"engine\/command_line_parser.h\"\n#include \"engine\/crc32.h\"\n#include \"engine\/fs\/disk_file_device.h\"\n#include \"engine\/fs\/file_system.h\"\n#include \"engine\/fs\/file_system.h\"\n#include \"engine\/fs\/memory_file_device.h\"\n#include \"engine\/fs\/pack_file_device.h\"\n#include \"engine\/input_system.h\"\n#include \"engine\/log.h\"\n#include \"engine\/lua_wrapper.h\"\n#include \"engine\/mt\/thread.h\"\n#include \"engine\/path_utils.h\"\n#include \"engine\/profiler.h\"\n#include \"engine\/resource_manager.h\"\n#include \"engine\/resource_manager_base.h\"\n#include \"engine\/system.h\"\n#include \"engine\/timer.h\"\n#include \"engine\/debug\/debug.h\"\n#include \"editor\/gizmo.h\"\n#include \"editor\/world_editor.h\"\n#include \"engine\/engine.h\"\n#include \"engine\/plugin_manager.h\"\n#include \"renderer\/pipeline.h\"\n#include \"renderer\/renderer.h\"\n#include \"renderer\/texture.h\"\n#include \"engine\/universe\/universe.h\"\n#include <cstdio>\n#include <X11\/Xlib.h>\n\n\nnamespace Lumix\n{\n\n\nstruct App\n{\n\tApp()\n\t{\n\t\tm_universe = nullptr;\n\t\tm_exit_code = 0;\n\t\tm_frame_timer = Timer::create(m_allocator);\n\t\tASSERT(!s_instance);\n\t\ts_instance = this;\n\t\tm_pipeline = nullptr;\n\t}\n\n\n\t~App()\n\t{\n\t\tTimer::destroy(m_frame_timer);\n\t\tASSERT(!m_universe);\n\t\ts_instance = nullptr;\n\t}\n\n\t\/*\n\tLRESULT onMessage(HWND hwnd, UINT msg, WPARAM wparam, LPARAM lparam)\n\t{\n\t\tswitch (msg)\n\t\t{\n\t\t\tcase WM_CLOSE: PostQuitMessage(0); break;\n\t\t\tcase WM_MOVE:\n\t\t\tcase WM_SIZE: onResize(); break;\n\t\t\tcase WM_QUIT: m_finished = true; break;\n\t\t\tcase WM_INPUT: handleRawInput(lparam); break;\n\t\t}\n\t\treturn DefWindowProc(hwnd, msg, wparam, lparam);\n\t}\n\n\n\tstatic LRESULT CALLBACK msgProc(HWND hwnd, UINT msg, WPARAM wparam, LPARAM lparam)\n\t{\n\t\tif (!s_instance || !s_instance->m_pipeline) return DefWindowProc(hwnd, msg, wparam, lparam);\n\n\t\treturn s_instance->onMessage(hwnd, msg, wparam, lparam);\n\t}\n\n\n\tvoid onResize()\n\t{\n\t\tRECT rect;\n\t\tRECT screen_rect;\n\t\tGetClientRect(m_hwnd, &rect);\n\t\tGetWindowRect(m_hwnd, &screen_rect);\n\t\tint w = rect.right - rect.left;\n\t\tint h = rect.bottom - rect.top;\n\t\tif (w > 0)\n\t\t{\n\t\t\tClipCursor(&screen_rect);\n\t\t\tm_pipeline->setViewport(0, 0, w, h);\n\t\t\tRenderer* renderer =\n\t\t\t\tstatic_cast<Renderer*>(m_engine->getPluginManager().getPlugin(\"renderer\"));\n\t\t\trenderer->resize(w, h);\n\t\t}\n\t}\n*\/\n\n\tbool createWindow()\n\t{\n\t\tm_display = XOpenDisplay(nullptr);\n\t\tif (!m_display) return false;\n\t\t\n\t\tint s = DefaultScreen(m_display);\n\t\tm_window = XCreateSimpleWindow(m_display, RootWindow(m_display, s), 10, 10, 100, 100, 1\n\t\t\t, BlackPixel(m_display, s), WhitePixel(m_display, s));\n\t\tXSelectInput(m_display, m_window, ExposureMask | KeyPressMask);\n\t\tXMapWindow(m_display, m_window);\n\t\treturn true;\n\t}\n\n\tvoid init()\n\t{\n\t\tcopyString(m_pipeline_path, \"pipelines\/app.lua\");\n\t\tcopyString(m_startup_script_path, \"startup.lua\");\n\t\tchar cmd_line[1024];\n\t\tgetCommandLine(cmd_line, lengthOf(cmd_line));\n\t\tCommandLineParser parser(cmd_line);\n\t\twhile (parser.next())\n\t\t{\n\t\t\tif (parser.currentEquals(\"-pipeline\"))\n\t\t\t{\n\t\t\t\tif (!parser.next()) break;\n\n\t\t\t\tparser.getCurrent(m_pipeline_path, lengthOf(m_pipeline_path));\n\t\t\t}\n\t\t\telse if(parser.currentEquals(\"-script\"))\n\t\t\t{\n\t\t\t\tif (!parser.next()) break;\n\n\t\t\t\tparser.getCurrent(m_startup_script_path, lengthOf(m_startup_script_path));\n\t\t\t}\n\t\t}\n\n\t\tcreateWindow();\n\n\t\tg_log_info.getCallback().bind<outputToConsole>();\n\t\tg_log_warning.getCallback().bind<outputToConsole>();\n\t\tg_log_error.getCallback().bind<outputToConsole>();\n\n\t\tenableCrashReporting(false);\n\n\t\tm_file_system = FS::FileSystem::create(m_allocator);\n\n\t\tm_mem_file_device = LUMIX_NEW(m_allocator, FS::MemoryFileDevice)(m_allocator);\n\t\tm_disk_file_device = LUMIX_NEW(m_allocator, FS::DiskFileDevice)(\"disk\", \"\", m_allocator);\n\t\tm_pack_file_device = LUMIX_NEW(m_allocator, FS::PackFileDevice)(m_allocator);\n\n\t\tm_file_system->mount(m_mem_file_device);\n\t\tm_file_system->mount(m_disk_file_device);\n\t\tm_file_system->mount(m_pack_file_device);\n\t\tm_pack_file_device->mount(\"data.pak\");\n\t\tm_file_system->setDefaultDevice(\"memory:disk:pack\");\n\t\tm_file_system->setSaveGameDevice(\"memory:disk\");\n\n\t\tm_engine = Engine::create(\"\", \"\", m_file_system, m_allocator);\n\t\tEngine::PlatformData platform_data;\n\t\tplatform_data.window_handle = (void*)(uintptr_t)m_window;\n\t\tplatform_data.display = m_display;\n\t\tm_engine->setPlatformData(platform_data);\n\n\t\tm_engine->getPluginManager().load(\"renderer\");\n\t\tm_engine->getPluginManager().load(\"animation\");\n\t\tm_engine->getPluginManager().load(\"audio\");\n\t\tm_engine->getPluginManager().load(\"lua_script\");\n\t\tm_engine->getPluginManager().load(\"physics\");\n\t\tm_engine->getInputSystem().enable(true);\n\t\tRenderer* renderer = static_cast<Renderer*>(m_engine->getPluginManager().getPlugin(\"renderer\"));\n\t\tm_pipeline = Pipeline::create(*renderer, Path(m_pipeline_path), \"\", m_engine->getAllocator());\n\t\tm_pipeline->load();\n\n\t\twhile (m_engine->getFileSystem().hasWork())\n\t\t{\n\t\t\tMT::sleep(100);\n\t\t\tm_engine->getFileSystem().updateAsyncTransactions();\n\t\t}\n\n\t\tm_universe = &m_engine->createUniverse(true);\n\t\tm_pipeline->setScene((RenderScene*)m_universe->getScene(crc32(\"renderer\")));\n\t\tm_pipeline->setViewport(0, 0, 600, 400);\n\t\trenderer->resize(600, 400);\n\n\t\tregisterLuaAPI();\n\n\t\t\/\/while (ShowCursor(false) >= 0); \/\/ TODO\n\t\t\/\/ onResize(); \/\/ TODO\n\t}\n\n\n\tvoid startupScriptLoaded(FS::IFile& file, bool success)\n\t{\n\t\tif (!success)\n\t\t{\n\t\t\tg_log_error.log(\"App\") << \"Could not open \" << m_startup_script_path;\n\t\t\treturn;\n\t\t}\n\n\t\tm_engine->runScript((const char*)file.getBuffer(), (int)file.size(), m_startup_script_path);\n\t}\n\n\n\tvoid registerLuaAPI()\n\t{\n\t\tlua_State* L = m_engine->getState();\n\n\t\t#define REGISTER_FUNCTION(F, name) \\\n\t\t\tdo { \\\n\t\t\t\tauto* f = &LuaWrapper::wrapMethod<App, decltype(&App::F), &App::F>; \\\n\t\t\t\tLuaWrapper::createSystemFunction(L, \"App\", name, f); \\\n\t\t\t} while(false) \\\n\n\t\tREGISTER_FUNCTION(loadUniverse, \"loadUniverse\");\n\t\tREGISTER_FUNCTION(frame, \"frame\");\n\t\tREGISTER_FUNCTION(exit, \"exit\");\n\n\t\t#undef REGISTER_FUNCTION\n\n\t\tLuaWrapper::createSystemVariable(L, \"App\", \"instance\", this);\n\t\tLuaWrapper::createSystemVariable(L, \"App\", \"universe\", m_universe);\n\n\t\tauto& fs = m_engine->getFileSystem();\n\t\tFS::ReadCallback cb;\n\t\tcb.bind<App, &App::startupScriptLoaded>(this);\n\t\tfs.openAsync(fs.getDefaultDevice(), Path(m_startup_script_path), FS::Mode::OPEN_AND_READ, cb);\n\t}\n\n\n\tvoid universeFileLoaded(FS::IFile& file, bool success)\n\t{\n\t\tASSERT(success);\n\t\tif (!success) return;\n\n\t\tASSERT(file.getBuffer());\n\t\tInputBlob blob(file.getBuffer(), (int)file.size());\n\t\t#pragma pack(1)\n\t\t\tstruct Header\n\t\t\t{\n\t\t\t\tu32 magic;\n\t\t\t\tint version;\n\t\t\t\tu32 hash;\n\t\t\t\tu32 engine_hash;\n\t\t\t};\n\t\t#pragma pack()\n\t\tHeader header;\n\t\tblob.read(header);\n\t\tif (crc32((const u8*)blob.getData() + sizeof(header), blob.getSize() - sizeof(header)) !=\n\t\t\theader.hash)\n\t\t{\n\t\t\tg_log_error.log(\"App\") << \"Universe corrupted\";\n\t\t\treturn;\n\t\t}\n\t\tbool deserialize_succeeded = m_engine->deserialize(*m_universe, blob);\n\t\tif (!deserialize_succeeded)\n\t\t{\n\t\t\tg_log_error.log(\"App\") << \"Failed to deserialize universe\";\n\t\t}\n\t}\n\n\n\tvoid loadUniverse(const char* path)\n\t{\n\t\tauto& fs = m_engine->getFileSystem();\n\t\tFS::ReadCallback file_read_cb;\n\t\tfile_read_cb.bind<App, &App::universeFileLoaded>(this);\n\t\tfs.openAsync(fs.getDefaultDevice(), Path(path), FS::Mode::OPEN_AND_READ, file_read_cb);\n\t}\n\n\n\tvoid shutdown()\n\t{\n\t\tm_engine->destroyUniverse(*m_universe);\n\t\tFS::FileSystem::destroy(m_file_system);\n\t\tLUMIX_DELETE(m_allocator, m_disk_file_device);\n\t\tLUMIX_DELETE(m_allocator, m_mem_file_device);\n\t\tLUMIX_DELETE(m_allocator, m_pack_file_device);\n\t\tPipeline::destroy(m_pipeline);\n\t\tEngine::destroy(m_engine, m_allocator);\n\t\tm_engine = nullptr;\n\t\tm_pipeline = nullptr;\n\t\tm_universe = nullptr;\n\t\t\n\t\tXCloseDisplay(m_display);\n\t}\n\t\n\n\tint getExitCode() const { return m_exit_code; }\n\n\t\/*\n\tvoid handleRawInput(LPARAM lParam)\n\t{\n\t\tUINT dwSize;\n\t\tchar data[sizeof(RAWINPUT) * 10];\n\n\t\tGetRawInputData((HRAWINPUT)lParam, RID_INPUT, NULL, &dwSize, sizeof(RAWINPUTHEADER));\n\t\tif (dwSize > sizeof(data)) return;\n\n\t\tif (GetRawInputData((HRAWINPUT)lParam, RID_INPUT, data, &dwSize, sizeof(RAWINPUTHEADER)) !=\n\t\t\tdwSize) return;\n\n\t\tRAWINPUT* raw = (RAWINPUT*)data;\n\t\tif (raw->header.dwType == RIM_TYPEMOUSE &&\n\t\t\traw->data.mouse.usFlags == MOUSE_MOVE_RELATIVE)\n\t\t{\n\t\t\tPOINT p;\n\t\t\tGetCursorPos(&p);\n\t\t\tScreenToClient(m_hwnd, &p);\n\t\t\tauto& input_system = m_engine->getInputSystem();\n\t\t\tinput_system.injectMouseXMove(float(raw->data.mouse.lLastX));\n\t\t\tinput_system.injectMouseYMove(float(raw->data.mouse.lLastY));\n\t\t}\n\t}\n*\/\n\n\tvoid handleEvents()\n\t{\n\t\tXEvent e;\n\t\twhile (XPending(m_display) > 0)\n\t\t{\n\t\t\tXNextEvent(m_display, &e);\n\t\t\tif (e.type == KeyPress) break;\n\t\t}\n\t}\n\n\n\tstatic void outputToConsole(const char* system, const char* message) \n\t{\n\t\tprintf(\"%s: %s\\n\", system, message); \n\t}\n\n\n\tvoid exit(int exit_code)\n\t{\n\t\tm_finished = true;\n\t\tm_exit_code = exit_code;\n\t}\n\n\t\n\tvoid frame()\n\t{\n\t\tfloat frame_time = m_frame_timer->tick();\n\t\tm_engine->update(*m_universe);\n\t\tm_pipeline->render();\n\t\tauto* renderer = m_engine->getPluginManager().getPlugin(\"renderer\");\n\t\tstatic_cast<Renderer*>(renderer)->frame(false);\n\t\tm_engine->getFileSystem().updateAsyncTransactions();\n\t\tif (frame_time < 1 \/ 60.0f)\n\t\t{\n\t\t\tPROFILE_BLOCK(\"sleep\");\n\t\t\tMT::sleep(u32(1000 \/ 60.0f - frame_time * 1000));\n\t\t}\n\t\thandleEvents();\n\t}\n\n\tvoid run()\n\t{\n\t\tm_finished = false;\n\t\twhile (!m_finished)\n\t\t{\n\t\t\tframe();\n\t\t}\n\t}\n\t\n\nprivate:\n\tDefaultAllocator m_allocator;\n\tEngine* m_engine;\n\tUniverse* m_universe;\n\tPipeline* m_pipeline;\n\tFS::FileSystem* m_file_system;\n\tFS::MemoryFileDevice* m_mem_file_device;\n\tFS::DiskFileDevice* m_disk_file_device;\n\tFS::PackFileDevice* m_pack_file_device;\n\tTimer* m_frame_timer;\n\tbool m_finished;\n\tint m_exit_code;\n\tchar m_startup_script_path[MAX_PATH_LENGTH];\n\tchar m_pipeline_path[MAX_PATH_LENGTH];\n\tDisplay* m_display;\n\tWindow m_window;\n\n\tstatic App* s_instance;\n};\n\n\nApp* App::s_instance = nullptr;\n\n\n}\n\n\nint main(int argc, char* argv[])\n{\n\tLumix::setCommandLine(argc, argv);\n\tLumix::App app;\n\tapp.init();\n\tapp.run();\n\tapp.shutdown();\n\treturn app.getExitCode();\n}\n\n\n<commit_msg>linux fix<commit_after>#include \"engine\/blob.h\"\n#include \"engine\/command_line_parser.h\"\n#include \"engine\/crc32.h\"\n#include \"engine\/fs\/disk_file_device.h\"\n#include \"engine\/fs\/file_system.h\"\n#include \"engine\/fs\/file_system.h\"\n#include \"engine\/fs\/memory_file_device.h\"\n#include \"engine\/fs\/pack_file_device.h\"\n#include \"engine\/input_system.h\"\n#include \"engine\/log.h\"\n#include \"engine\/lua_wrapper.h\"\n#include \"engine\/mt\/thread.h\"\n#include \"engine\/path_utils.h\"\n#include \"engine\/profiler.h\"\n#include \"engine\/resource_manager.h\"\n#include \"engine\/resource_manager_base.h\"\n#include \"engine\/system.h\"\n#include \"engine\/timer.h\"\n#include \"engine\/debug\/debug.h\"\n#include \"editor\/gizmo.h\"\n#include \"editor\/world_editor.h\"\n#include \"engine\/engine.h\"\n#include \"engine\/plugin_manager.h\"\n#include \"renderer\/pipeline.h\"\n#include \"renderer\/renderer.h\"\n#include \"renderer\/texture.h\"\n#include \"engine\/universe\/universe.h\"\n#include <cstdio>\n#include <X11\/Xlib.h>\n\n\nnamespace Lumix\n{\n\n\nstruct App\n{\n\tApp()\n\t{\n\t\tm_universe = nullptr;\n\t\tm_exit_code = 0;\n\t\tm_frame_timer = Timer::create(m_allocator);\n\t\tASSERT(!s_instance);\n\t\ts_instance = this;\n\t\tm_pipeline = nullptr;\n\t}\n\n\n\t~App()\n\t{\n\t\tTimer::destroy(m_frame_timer);\n\t\tASSERT(!m_universe);\n\t\ts_instance = nullptr;\n\t}\n\n\t\/*\n\tLRESULT onMessage(HWND hwnd, UINT msg, WPARAM wparam, LPARAM lparam)\n\t{\n\t\tswitch (msg)\n\t\t{\n\t\t\tcase WM_CLOSE: PostQuitMessage(0); break;\n\t\t\tcase WM_MOVE:\n\t\t\tcase WM_SIZE: onResize(); break;\n\t\t\tcase WM_QUIT: m_finished = true; break;\n\t\t\tcase WM_INPUT: handleRawInput(lparam); break;\n\t\t}\n\t\treturn DefWindowProc(hwnd, msg, wparam, lparam);\n\t}\n\n\n\tstatic LRESULT CALLBACK msgProc(HWND hwnd, UINT msg, WPARAM wparam, LPARAM lparam)\n\t{\n\t\tif (!s_instance || !s_instance->m_pipeline) return DefWindowProc(hwnd, msg, wparam, lparam);\n\n\t\treturn s_instance->onMessage(hwnd, msg, wparam, lparam);\n\t}\n\n\n\tvoid onResize()\n\t{\n\t\tRECT rect;\n\t\tRECT screen_rect;\n\t\tGetClientRect(m_hwnd, &rect);\n\t\tGetWindowRect(m_hwnd, &screen_rect);\n\t\tint w = rect.right - rect.left;\n\t\tint h = rect.bottom - rect.top;\n\t\tif (w > 0)\n\t\t{\n\t\t\tClipCursor(&screen_rect);\n\t\t\tm_pipeline->setViewport(0, 0, w, h);\n\t\t\tRenderer* renderer =\n\t\t\t\tstatic_cast<Renderer*>(m_engine->getPluginManager().getPlugin(\"renderer\"));\n\t\t\trenderer->resize(w, h);\n\t\t}\n\t}\n*\/\n\n\tbool createWindow()\n\t{\n\t\tm_display = XOpenDisplay(nullptr);\n\t\tif (!m_display) return false;\n\t\t\n\t\tint s = DefaultScreen(m_display);\n\t\tm_window = XCreateSimpleWindow(m_display, RootWindow(m_display, s), 10, 10, 100, 100, 1\n\t\t\t, BlackPixel(m_display, s), WhitePixel(m_display, s));\n\t\tXSelectInput(m_display, m_window, ExposureMask | KeyPressMask);\n\t\tXMapWindow(m_display, m_window);\n\t\treturn true;\n\t}\n\n\tvoid init()\n\t{\n\t\tcopyString(m_pipeline_path, \"pipelines\/app.lua\");\n\t\tcopyString(m_startup_script_path, \"startup.lua\");\n\t\tchar cmd_line[1024];\n\t\tgetCommandLine(cmd_line, lengthOf(cmd_line));\n\t\tCommandLineParser parser(cmd_line);\n\t\twhile (parser.next())\n\t\t{\n\t\t\tif (parser.currentEquals(\"-pipeline\"))\n\t\t\t{\n\t\t\t\tif (!parser.next()) break;\n\n\t\t\t\tparser.getCurrent(m_pipeline_path, lengthOf(m_pipeline_path));\n\t\t\t}\n\t\t\telse if(parser.currentEquals(\"-script\"))\n\t\t\t{\n\t\t\t\tif (!parser.next()) break;\n\n\t\t\t\tparser.getCurrent(m_startup_script_path, lengthOf(m_startup_script_path));\n\t\t\t}\n\t\t}\n\n\t\tcreateWindow();\n\n\t\tg_log_info.getCallback().bind<outputToConsole>();\n\t\tg_log_warning.getCallback().bind<outputToConsole>();\n\t\tg_log_error.getCallback().bind<outputToConsole>();\n\n\t\tenableCrashReporting(false);\n\n\t\tm_file_system = FS::FileSystem::create(m_allocator);\n\n\t\tm_mem_file_device = LUMIX_NEW(m_allocator, FS::MemoryFileDevice)(m_allocator);\n\t\tm_disk_file_device = LUMIX_NEW(m_allocator, FS::DiskFileDevice)(\"disk\", \"\", m_allocator);\n\t\tm_pack_file_device = LUMIX_NEW(m_allocator, FS::PackFileDevice)(m_allocator);\n\n\t\tm_file_system->mount(m_mem_file_device);\n\t\tm_file_system->mount(m_disk_file_device);\n\t\tm_file_system->mount(m_pack_file_device);\n\t\tm_pack_file_device->mount(\"data.pak\");\n\t\tm_file_system->setDefaultDevice(\"memory:disk:pack\");\n\t\tm_file_system->setSaveGameDevice(\"memory:disk\");\n\n\t\tm_engine = Engine::create(\"\", \"\", m_file_system, m_allocator);\n\t\tEngine::PlatformData platform_data;\n\t\tplatform_data.window_handle = (void*)(uintptr_t)m_window;\n\t\tplatform_data.display = m_display;\n\t\tm_engine->setPlatformData(platform_data);\n\n\t\tm_engine->getPluginManager().load(\"renderer\");\n\t\tm_engine->getPluginManager().load(\"animation\");\n\t\tm_engine->getPluginManager().load(\"audio\");\n\t\tm_engine->getPluginManager().load(\"lua_script\");\n\t\tm_engine->getPluginManager().load(\"physics\");\n\t\tm_engine->getInputSystem().enable(true);\n\t\tRenderer* renderer = static_cast<Renderer*>(m_engine->getPluginManager().getPlugin(\"renderer\"));\n\t\tm_pipeline = Pipeline::create(*renderer, Path(m_pipeline_path), \"APP\", m_engine->getAllocator());\n\t\tm_pipeline->load();\n\n\t\twhile (m_engine->getFileSystem().hasWork())\n\t\t{\n\t\t\tMT::sleep(100);\n\t\t\tm_engine->getFileSystem().updateAsyncTransactions();\n\t\t}\n\n\t\tm_universe = &m_engine->createUniverse(true);\n\t\tm_pipeline->setScene((RenderScene*)m_universe->getScene(crc32(\"renderer\")));\n\t\tm_pipeline->resize(600, 400);\n\t\trenderer->resize(600, 400);\n\n\t\tregisterLuaAPI();\n\n\t\t\/\/while (ShowCursor(false) >= 0); \/\/ TODO\n\t\t\/\/ onResize(); \/\/ TODO\n\t}\n\n\n\tvoid startupScriptLoaded(FS::IFile& file, bool success)\n\t{\n\t\tif (!success)\n\t\t{\n\t\t\tg_log_error.log(\"App\") << \"Could not open \" << m_startup_script_path;\n\t\t\treturn;\n\t\t}\n\n\t\tm_engine->runScript((const char*)file.getBuffer(), (int)file.size(), m_startup_script_path);\n\t}\n\n\n\tvoid registerLuaAPI()\n\t{\n\t\tlua_State* L = m_engine->getState();\n\n\t\t#define REGISTER_FUNCTION(F, name) \\\n\t\t\tdo { \\\n\t\t\t\tauto* f = &LuaWrapper::wrapMethod<App, decltype(&App::F), &App::F>; \\\n\t\t\t\tLuaWrapper::createSystemFunction(L, \"App\", name, f); \\\n\t\t\t} while(false) \\\n\n\t\tREGISTER_FUNCTION(loadUniverse, \"loadUniverse\");\n\t\tREGISTER_FUNCTION(frame, \"frame\");\n\t\tREGISTER_FUNCTION(exit, \"exit\");\n\n\t\t#undef REGISTER_FUNCTION\n\n\t\tLuaWrapper::createSystemVariable(L, \"App\", \"instance\", this);\n\t\tLuaWrapper::createSystemVariable(L, \"App\", \"universe\", m_universe);\n\n\t\tauto& fs = m_engine->getFileSystem();\n\t\tFS::ReadCallback cb;\n\t\tcb.bind<App, &App::startupScriptLoaded>(this);\n\t\tfs.openAsync(fs.getDefaultDevice(), Path(m_startup_script_path), FS::Mode::OPEN_AND_READ, cb);\n\t}\n\n\n\tvoid universeFileLoaded(FS::IFile& file, bool success)\n\t{\n\t\tASSERT(success);\n\t\tif (!success) return;\n\n\t\tASSERT(file.getBuffer());\n\t\tInputBlob blob(file.getBuffer(), (int)file.size());\n\t\t#pragma pack(1)\n\t\t\tstruct Header\n\t\t\t{\n\t\t\t\tu32 magic;\n\t\t\t\tint version;\n\t\t\t\tu32 hash;\n\t\t\t\tu32 engine_hash;\n\t\t\t};\n\t\t#pragma pack()\n\t\tHeader header;\n\t\tblob.read(header);\n\t\tif (crc32((const u8*)blob.getData() + sizeof(header), blob.getSize() - sizeof(header)) !=\n\t\t\theader.hash)\n\t\t{\n\t\t\tg_log_error.log(\"App\") << \"Universe corrupted\";\n\t\t\treturn;\n\t\t}\n\t\tbool deserialize_succeeded = m_engine->deserialize(*m_universe, blob);\n\t\tif (!deserialize_succeeded)\n\t\t{\n\t\t\tg_log_error.log(\"App\") << \"Failed to deserialize universe\";\n\t\t}\n\t}\n\n\n\tvoid loadUniverse(const char* path)\n\t{\n\t\tauto& fs = m_engine->getFileSystem();\n\t\tFS::ReadCallback file_read_cb;\n\t\tfile_read_cb.bind<App, &App::universeFileLoaded>(this);\n\t\tfs.openAsync(fs.getDefaultDevice(), Path(path), FS::Mode::OPEN_AND_READ, file_read_cb);\n\t}\n\n\n\tvoid shutdown()\n\t{\n\t\tm_engine->destroyUniverse(*m_universe);\n\t\tFS::FileSystem::destroy(m_file_system);\n\t\tLUMIX_DELETE(m_allocator, m_disk_file_device);\n\t\tLUMIX_DELETE(m_allocator, m_mem_file_device);\n\t\tLUMIX_DELETE(m_allocator, m_pack_file_device);\n\t\tPipeline::destroy(m_pipeline);\n\t\tEngine::destroy(m_engine, m_allocator);\n\t\tm_engine = nullptr;\n\t\tm_pipeline = nullptr;\n\t\tm_universe = nullptr;\n\t\t\n\t\tXCloseDisplay(m_display);\n\t}\n\t\n\n\tint getExitCode() const { return m_exit_code; }\n\n\t\/*\n\tvoid handleRawInput(LPARAM lParam)\n\t{\n\t\tUINT dwSize;\n\t\tchar data[sizeof(RAWINPUT) * 10];\n\n\t\tGetRawInputData((HRAWINPUT)lParam, RID_INPUT, NULL, &dwSize, sizeof(RAWINPUTHEADER));\n\t\tif (dwSize > sizeof(data)) return;\n\n\t\tif (GetRawInputData((HRAWINPUT)lParam, RID_INPUT, data, &dwSize, sizeof(RAWINPUTHEADER)) !=\n\t\t\tdwSize) return;\n\n\t\tRAWINPUT* raw = (RAWINPUT*)data;\n\t\tif (raw->header.dwType == RIM_TYPEMOUSE &&\n\t\t\traw->data.mouse.usFlags == MOUSE_MOVE_RELATIVE)\n\t\t{\n\t\t\tPOINT p;\n\t\t\tGetCursorPos(&p);\n\t\t\tScreenToClient(m_hwnd, &p);\n\t\t\tauto& input_system = m_engine->getInputSystem();\n\t\t\tinput_system.injectMouseXMove(float(raw->data.mouse.lLastX));\n\t\t\tinput_system.injectMouseYMove(float(raw->data.mouse.lLastY));\n\t\t}\n\t}\n*\/\n\n\tvoid handleEvents()\n\t{\n\t\tXEvent e;\n\t\twhile (XPending(m_display) > 0)\n\t\t{\n\t\t\tXNextEvent(m_display, &e);\n\t\t\tif (e.type == KeyPress) break;\n\t\t}\n\t}\n\n\n\tstatic void outputToConsole(const char* system, const char* message) \n\t{\n\t\tprintf(\"%s: %s\\n\", system, message); \n\t}\n\n\n\tvoid exit(int exit_code)\n\t{\n\t\tm_finished = true;\n\t\tm_exit_code = exit_code;\n\t}\n\n\t\n\tvoid frame()\n\t{\n\t\tfloat frame_time = m_frame_timer->tick();\n\t\tm_engine->update(*m_universe);\n\t\tm_pipeline->render();\n\t\tauto* renderer = m_engine->getPluginManager().getPlugin(\"renderer\");\n\t\tstatic_cast<Renderer*>(renderer)->frame(false);\n\t\tm_engine->getFileSystem().updateAsyncTransactions();\n\t\tif (frame_time < 1 \/ 60.0f)\n\t\t{\n\t\t\tPROFILE_BLOCK(\"sleep\");\n\t\t\tMT::sleep(u32(1000 \/ 60.0f - frame_time * 1000));\n\t\t}\n\t\thandleEvents();\n\t}\n\n\tvoid run()\n\t{\n\t\tm_finished = false;\n\t\twhile (!m_finished)\n\t\t{\n\t\t\tframe();\n\t\t}\n\t}\n\t\n\nprivate:\n\tDefaultAllocator m_allocator;\n\tEngine* m_engine;\n\tUniverse* m_universe;\n\tPipeline* m_pipeline;\n\tFS::FileSystem* m_file_system;\n\tFS::MemoryFileDevice* m_mem_file_device;\n\tFS::DiskFileDevice* m_disk_file_device;\n\tFS::PackFileDevice* m_pack_file_device;\n\tTimer* m_frame_timer;\n\tbool m_finished;\n\tint m_exit_code;\n\tchar m_startup_script_path[MAX_PATH_LENGTH];\n\tchar m_pipeline_path[MAX_PATH_LENGTH];\n\tDisplay* m_display;\n\tWindow m_window;\n\n\tstatic App* s_instance;\n};\n\n\nApp* App::s_instance = nullptr;\n\n\n}\n\n\nint main(int argc, char* argv[])\n{\n\tLumix::setCommandLine(argc, argv);\n\tLumix::App app;\n\tapp.init();\n\tapp.run();\n\tapp.shutdown();\n\treturn app.getExitCode();\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>#include <stdio.h>\n\n#include \"being.h\"\n#include \"comm.h\"\n#include \"extern.h\"\n#include \"obj_base_weapon.h\"\n\nint thiefQuestWeapon(TBeing *victim, cmdTypeT command, const char *arg, TObj *object, TObj *thief) {\n  \/\/ Thief will only == nullptr when proc is called on the generic command proc\n  \/\/ check. Don't want proc to execute in that instance - should only happen in\n  \/\/ response to skill use. Otherwise it'll execute twice as often as it should.\n  if ((command != CMD_STAB && command != CMD_BACKSTAB && command != CMD_SLIT) || !thief || !victim || !object)\n    return false;\n\n  auto *weapon = dynamic_cast<TBaseWeapon *>(object);\n  auto *wielder = weapon ? dynamic_cast<TBeing *>(weapon->equippedBy) : nullptr;\n\n  \/\/ Cast both thief and wielder to base class and check if both pointing to same\n  \/\/ memory location\n  if (!weapon || !wielder || !(dynamic_cast<TThing *>(thief) == dynamic_cast<TThing *>(wielder)))\n    return false;\n\n  wearSlotT limb = WEAR_NOWHERE;\n\n  if (command == CMD_STAB)\n    limb = static_cast<wearSlotT>(reinterpret_cast<uintptr_t>(arg));\n\n  limb = command == CMD_BACKSTAB ? WEAR_BACK : command == CMD_SLIT ? WEAR_NECK : limb;\n\n  if (limb == WEAR_NOWHERE || limb == HOLD_RIGHT || limb == HOLD_LEFT || limb == MAX_WEAR)\n    return false;\n\n  \/\/ 10% chance on stab, 50% on backstab\/slit\n  if (command == CMD_STAB) {\n    if (::number(0, 9))\n      return false;\n  } else if (::number(0, 1))\n    return false;\n\n  int damage = 0;\n  spellNumT damageType = SKILL_STABBING;\n\n  if (command == CMD_STAB) {\n    damage = wielder->GetMaxLevel() * 1.5;\n  } else if (command == CMD_BACKSTAB) {\n    damage = wielder->GetMaxLevel() * 2.5;\n    damageType = SKILL_BACKSTAB;\n    act(\"<W>The weapon sears down $N's spine!<z>\", false, wielder, weapon, victim, TO_CHAR);\n    act(\"<W>The weapon sears down $N's spine!<z>\", false, wielder, weapon, victim, TO_ROOM);\n  } else {\n    damage = wielder->GetMaxLevel() * 3;\n    damageType = SKILL_THROATSLIT;\n    act(\"<W>The weapon sears through $N's throat!<z>\", false, wielder, weapon, victim, TO_CHAR);\n    act(\"<W>The weapon sears through $N's throat!<z>\", false, wielder, weapon, victim, TO_ROOM);\n  }\n\n  int rc = wielder->reconcileDamage(victim, damage, damageType);\n  if (IS_SET_DELETE(rc, DELETE_VICT))\n    return DELETE_VICT;\n\n  if (victim->slotChance(limb) && !victim->isImmune(IMMUNE_BLEED, WEAR_BACK) &&\n      !victim->isLimbFlags(limb, PART_BLEEDING) && !victim->isUndead()) {\n    act(\"<r>Blood begins to pour from the wound!<z>\", false, victim, nullptr, nullptr, TO_ROOM);\n    victim->rawBleed(limb, wielder->GetMaxLevel() * 3 + 100, SILENT_YES, CHECK_IMMUNITY_NO);\n  }\n\n  return true;\n}\n<commit_msg>Ensure thief is holding weapon with proc in primary hand<commit_after>#include <stdio.h>\n\n#include \"being.h\"\n#include \"comm.h\"\n#include \"extern.h\"\n#include \"obj_base_weapon.h\"\n\nint thiefQuestWeapon(TBeing *victim, cmdTypeT command, const char *arg, TObj *object, TObj *thief) {\n  \/\/ Thief will only == nullptr when proc is called on the generic command proc\n  \/\/ check. Don't want proc to execute in that instance - should only happen in\n  \/\/ response to skill use. Otherwise it'll execute twice as often as it should.\n  if ((command != CMD_STAB && command != CMD_BACKSTAB && command != CMD_SLIT) || !thief || !victim || !object)\n    return false;\n\n  auto *weapon = dynamic_cast<TBaseWeapon *>(object);\n\n  \/\/ Double cast required because thief comes in having already been cast\n  \/\/ from TBeing to TThing to TObj, and casting directly from TObj to TBeing\n  \/\/ is not allowed (outside of reinterpret_cast).\n  auto* thiefAsTBeing = dynamic_cast<TBeing*>(dynamic_cast<TThing*>(thief));\n\n  \/\/ Verify stabber is wielding the object in their primary hand\n  if (!weapon || !thiefAsTBeing || !(thiefAsTBeing->heldInPrimHand() == weapon))\n    return false;\n\n  wearSlotT limb = WEAR_NOWHERE;\n\n  \/\/ This reinterpret_cast is necessary because there's no clean way to pass the\n  \/\/ wearSlotT value of the stab location into the function, short of completely\n  \/\/ changing the function signature of every object spec proc function.\n  if (command == CMD_STAB)\n    limb = static_cast<wearSlotT>(reinterpret_cast<uintptr_t>(arg));\n\n  limb = command == CMD_BACKSTAB ? WEAR_BACK\n         : command == CMD_SLIT   ? WEAR_NECK\n                                 : limb;\n\n  if (limb == WEAR_NOWHERE || limb == HOLD_RIGHT || limb == HOLD_LEFT || limb == MAX_WEAR)\n    return false;\n\n  \/\/ 10% chance on stab, 50% on backstab\/slit\n  if (command == CMD_STAB && ::number(0, 9))\n    return false;\n\n  if (::number(0, 1))\n    return false;\n\n  int damage = 0;\n  spellNumT damageType = SKILL_STABBING;\n  int level = thiefAsTBeing->GetMaxLevel();\n\n  if (command == CMD_STAB) {\n    damage = level * 1.5;\n  } else if (command == CMD_BACKSTAB) {\n    damage = level * 2.5;\n    damageType = SKILL_BACKSTAB;\n    act(\"<W>The weapon sears down $N's spine!<z>\", false, thiefAsTBeing, weapon, victim, TO_CHAR);\n    act(\"<W>The weapon sears down $N's spine!<z>\", false, thiefAsTBeing, weapon, victim, TO_ROOM);\n  } else {\n    damage = level * 3;\n    damageType = SKILL_THROATSLIT;\n    act(\"<W>The weapon sears through $N's throat!<z>\", false, thiefAsTBeing, weapon, victim, TO_CHAR);\n    act(\"<W>The weapon sears through $N's throat!<z>\", false, thiefAsTBeing, weapon, victim, TO_ROOM);\n  }\n\n  int rc = thiefAsTBeing->reconcileDamage(victim, damage, damageType);\n  if (IS_SET_DELETE(rc, DELETE_VICT))\n    return DELETE_VICT;\n\n  if (victim->slotChance(limb) && !victim->isImmune(IMMUNE_BLEED, WEAR_BACK) &&\n      !victim->isLimbFlags(limb, PART_BLEEDING) && !victim->isUndead()) {\n    act(\"<r>Blood begins to pour from the wound!<z>\", false, victim, nullptr, nullptr, TO_ROOM);\n    victim->rawBleed(limb, level * 3 + 100, SILENT_YES, CHECK_IMMUNITY_NO);\n  }\n\n  return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"nailtool.h\"\n#include <boost\/format.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/foreach.hpp>\n#define MAP(f,collection) FOREACH(iter,collection){ f(*iter);}\n\n\n#define mk_str(x) std::string((const char *)x.elem,x.count)\nstatic const std::string parser_template(_binary_parser_template_c_start,_binary_parser_template_c_end - _binary_parser_template_c_start);\nclass CDataModel{\n  std::ostream &out;\n  std::string int_type(const intp &intp ){\n    int length = boost::lexical_cast<int>(mk_str(intp.SIGNED));\n    if(length<=8) length = 8;\n    else if(length<=16) length=16;\n    else if(length<=32) length=32;\n    else if(length<=64) length=64;\n    else throw std::range_error(\"Integer longer than 64 bits\");\n    return (boost::format(\"%s%d_t\") % (intp.N_type == UNSIGNED ? \"uint\":\"int\" )% length).str();\n  }\n\n  \/\/ Gets the type for a top-level parser (to be used in the typedef)\n  std::string typedef_type(const parser &p, std::string name){\n    const parserinner &inner(p.N_type == PR ? p.PR : p.PAREN);\n    switch(inner.N_type){\n    case INT:\n      return int_type(inner.INT.parser);\n    case WRAP:\n      return typedef_type(*inner.WRAP.parser,name);\n    case OPTIONAL:\n      return (boost::format(\"%s*\") % typedef_type(*inner.OPTIONAL,name)).str();\n    case NAME:\n      return mk_str(inner.NAME);\n    case REF:\n      return (boost::format(\"%s *\") % mk_str(inner.NAME)).str();\n    case UNION:\n      \/*   FOREACH(parser,inner.UNION){\n           if(!type_equal(inner.UNION.elem[0],parser))\n           throw std::runtime_error(\"Grammar invalid at UNION\");\n           } *\/\n      return typedef_type(*inner.UNION.elem[0],name);\n    case STRUCT:\n    case ARRAY:\n    case CHOICE:\n      return (boost::format(\"struct %s\") % name).str();\n \n    }\n  }\n  void emit_type( const parser &outer,const std::string name =\"\"){\n    const parserinner &p = outer.PR;\n    switch(p.N_type){\n    case INT:\n      out << int_type(p.INT.parser);\n      break;\n    case STRUCT:\n      out<<\"struct \" << name << \"{\\n\";\n      FOREACH(field,p.STRUCT){\n        if(field->N_type != FIELD)\n          continue;\n        emit_type(out, *field->FIELD.parser);\n        out << \" \" << mk_str(field->FIELD.name) << \";\\n\";\n      }\n      out << \"}\" << std::endl;\n      break;\n    case WRAP:\n      emit_type(out,*p.WRAP.parser);\n      break;\n    case CHOICE:{\n      out << \"struct \" << name<< \"{\\n enum  {\";\n      int idx=0;\n      FOREACH(option, p.CHOICE){\n        if(idx++ >0) \n          out << ',';\n        out << mk_str(option->tag);\n      }\n      out << \"} N_type; \\n\";\n      out << \"union {\\n\";\n      FOREACH(option, p.CHOICE){\n        emit_type(out,*option->parser);\n        out << \" \"<<  mk_str(option->tag) << \";\\n\";\n      }\n      out<< \"};\\n}\";\n    }\n      break;\n  \n    case ARRAY:\n      out << \"struct \"<< name <<\"{\\n\";\n      switch(p.ARRAY.N_type){\n      case MANY:\n      case MANYONE:\n        emit_type(out,*p.ARRAY.MANY);\n        break;\n      case SEPBY:\n      case SEPBYONE:\n        emit_type(out,*p.ARRAY.SEPBY.inner);\n        break;\n      }\n      out << \"*elem;\\n size_t count;\\n\";\n      out << \"}\" ;\n      break;\n    case OPTIONAL:\n      emit_type(out,*p.OPTIONAL);\n      out << \"*\";\n      break;\n    case UNION:\n      {\n        std::string first;\n        int idx=0;\n        FOREACH(elem, p.UNION){\n          std::stringstream tmp;\n          emit_type(tmp,**elem);\n          if(idx++==0)\n            first = tmp.str();\n          else{\n            \/\/TODO: Perform in-depth checking\n            \/\/         if(first!= tmp.str()){\n            \/\/        throw std::runtime_error(boost::str(boost::format(\"UNION elements do not induce the same type\\n %s \\n %s\") % tmp.str() % first)); \/\/Be more\n            \/\/descriptive\n            \/\/    }\n          }\n        }\n        out << first;\n      }\n      break;\n    case REF:\n      out << mk_str(p.REF)<<\"* \";\n      break;\n    case NAME:\n      out << mk_str(p.NAME);\n      break;\n    }\n  }\n  void emit_type_definition( const parser &p,const std::string name)\n  {\n    switch(p.PR.N_type){\n    case STRUCT:\n    case ARRAY:\n    case CHOICE:\n      emit_type(out,p,name);\n      out << \";\" << std::endl;\n      break;\n    case WRAP:\n      emit_type_definition(out,*p.PR.WRAP.parser,name);\n      break;\n    default:\n      break; \/\/Other definitions don't need a type\n    }\n  }\n  void emit_type( const definition &def){\n    if(def.N_type != PARSER)\n      return;\n    std::string name(mk_str(def.PARSER.name));\n    emit_type_definition(out,def.PARSER.definition,name);\n  }\npublic:\n  void emit_parser( grammar *grammar){\n    try{\n      assert(out.good());\n      out << \"#include <stdint.h>\\n #include <string.h>\\n\";\n      \/\/Emit forward declarations\n      FOREACH(definition,*grammar){\n        if(definition->N_type!=PARSER)\n          continue;\n        std::string name(mk_str(definition->PARSER.name));\n        out << \"typedef \"<< typedef_type(definition->PARSER.definition,name)<< \" \" << name << \";\" << std::endl;\n      }\n      FOREACH(definition, *grammar){\n        emit_type(out,*definition);\n      }\n      out<< std::endl;\n    } catch(std::exception &e){\n      std::cerr << \"Exception while generating parser\" << e.what()<<std::endl;\n      exit(-1);\n    }\n  }\n\n  CDataModel(std::ostream *os) : out(*os){}\n  \n};\nclass CPrimitiveParser{\n  std::ostream &out;\n  int nr_choice,nr_option;\n  int nr_many;\n  CPrimitiveParser(std::ostream *os) : out(*os), nr_choice(1),nr_many(0){}\n  std::string choice_label(){return  (boost::format(\"choice_%u_%u\") % nr_choice %n_option++).str();}\n  \/*Packrat pass emits a light-weight trace of data structure*\/\n  void packrat(const constrainedint &c, const std::string &fail){\n    \n  }\n  void packrat(const constparser &c, const std::string &fail){\n  }\n  typedef  std::list<const parser &> parserlist;\n  void packrat_choice(const parserlist &list, const std::string &fail){\n    nr_choice++;\n    nr_option = 0;\n    out << \"{pos backtrack = trace->iter;\\n\"\n        << \"pos choice_begin = n_tr_begin_choice(trace); \\n\"\n        << \"pos choice;\\n\"\n        << \"if(parser_fail(choice_begin)) {\" << fail <<\"}\\n\";\n    int i=0;\n    std::string success_label = (boost::format(\"choice_%d_succ\") % nr_choice).str();\n    BOOST_FOREACH(parser &p, list){\n      std::string fallthrough_memo  = choice_label();\n      std::string fallthrough_goto = boost::str(boost_format(\"goto %s\") % fallthrough_memo);\n      out << \"choice = n_tr_memo_choice(trace);\\n\";\n      packrat(p,fallthrough_goto);\n      out << \"goto \" << success_label<< \"\\n\";\n      out << fallthrough_memo << \":\\n\";\n    }\n    out << fail << \"\\n\";\n    out << success_label <<\":\\n\";\n  }\n  void packrat_repeat(const parser &p, const std::string &fail, size_t min, const constparser *separator){\n    std::string gotofail=(boost::format(\"goto fail_repeat_%d;\") % nr_many).str();\n    out << \"{\\n\";\n    out << \"pos many = n_tr_memo_many(n_trace *trace);\\n\"\n        << \"pos count = 0;\"\n        << \"succ_optional_\" << nr_many << \":\";\n    if(separator != NULL){\n      out << \"if(count>0){\\n\";\n      packrat(*separator,gotofail);\n      out << \"}\\n\";\n    }\n    packrat(p, gotofail);\n    out << \"count++;\\n\";\n    out << \" goto succ_optional_\"<< nr_many << \";\\n\";\n    out << \"fail_optional_\" << nr_many << \":\\n\";\n    if(min>0){\n      out << \"if(count < min){\"<< fail << \"}\\n\";\n    }\n    out << \"n_tr_write_many(trace,many,count);\\n\"\n    nr_many++;          \n  }\n  void packrat_array(const arrayparser &array, const std::string &fail){\n    switch(array.N_type){\n    case MANYONE:\n      packrat_repeat(*array.MANYONE,fail, 1,NULL);\n      break;\n    case MANY:\n      packrat_repeat(*array.MANY,fail, 0,NULL);\n      break;\n    case SEPBYONE:\n      packrat_repeat(*array.SEPBYONE.inner,fail, 1,&array.SEPBYONE.separator);\n      break;\n    case SEPBY:\n      packrat_repeat(*array.SEPBY,fail, 0, &array.SEPBY.separator);\n      break;\n    }\n    arrayparser\n  }\n  void packrat_optional(const parser &p, const std::string &fail){\n    out << \"{\\n\";\n    out << \"pos many = n_tr_memo_many(n_trace *trace);\\n\";\n    packrat(p, (boost::format(\"goto fail_optional_%d;\") % nr_many).str());\n    out << \"n_tr_write_many(trace,many, 1); goto succ_optional_\"<< nr_many << \";\\n\";\n    out << \"fail_optional_\" << nr_many << \":\\n\";\n    out << \"n_tr_write_many(trace,many,0);\\n\"\n        << \"succ_optional_\" << nr_many << \":\\n\";\n    nr_many++;      \n  }\n  void packrat(const parser &parser, const std::string &fail ){\n    switch(parser.PR.N_type){\n    case INT:\n      packrat(parser.PR.INT,fail);\n      break;\n    case STRUCT:\n      FOREACH(field,parser.PR.STRUCT){\n        switch(field.N_type){\n        case CONSTANT:\n          packrat(field.CONSTANT,fail);\n          break;\n        case FIELD:\n          packrat(field.PARSER.parser,fail);\n          break;\n        }\n      }\n      break;\n    case WRAP:\n      if(parser.PR.WRAP.constbefore){\n        FOREACH(c,parser.PR.WRAP.constbefore){\n          packrat(c,fail);\n        }\n      }\n      packrat(parser.PR.WRAP.parser);\n      if(parser.PR.WRAP.constafter){\n        FOREACH(c,parser.PR.WRAP.constafter){\n          packrat(c,fail);\n        }\n      }\n      break;\n    case CHOICE:\n      {\n        parserlist l;\n        FOREACH(c, parser.PR.CHOICE){\n          l.push_back(c.parser);\n        }\n        packrat_choice(l,fail);\n      }\n      break;\n    case UNION:\n      {\n        parserlist l;\n        FOREACH(c, parser.UNION){\n          l.push_back(c);\n        }\n        packrat_choice(l,fail);\n      }\n    case ARRAY:\n      packrat(parser.PR.ARRAY,fail);\n      break;\n    case OPTIONAL:\n      packrat(parser.PR.OPTIONAL,fail);\n      break;\n    case NAME: \/\/ Fallthrough intentional, and kludgy\n    case REF: \n      out << \"i = packrat_\" << parser.PR.REF.name<< \"(tmp, trace,data,pos,max);\";\n      out << \"if(parser_fail(i)){\" << fail << \"}\\n\";\n          << \"else{off=i;}\";\n      break;\n    }\n  }\n  void packrat(const definition &def) {\n    std::string name = mk_str(def.name);\n    out <<\"static int packrat_\" << name <<\"(NailArena *tmp,n_trace *trace, const char *data, pos off, pos max){\\n\";\n    out << \"pos i;\\n\"; \/\/Used in name and ref as temp variables\n    out << \"}\\n\";\n  }\n};\nvoid emit_parser(std::ostream *out, grammar *grammar){\n  CDataModel data(out);\n  CPrimitiveParser p(out);\n  data.emit_parser(grammar);\n}\n<commit_msg>should be done with parser<commit_after>#include \"nailtool.h\"\n#include <boost\/format.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/foreach.hpp>\n#define MAP(f,collection) FOREACH(iter,collection){ f(*iter);}\n\n\n#define mk_str(x) std::string((const char *)x.elem,x.count)\nstatic const std::string parser_template(_binary_parser_template_c_start,_binary_parser_template_c_end - _binary_parser_template_c_start);\nclass CDataModel{\n  std::ostream &out;\n  std::string int_type(const intp &intp ){\n    int length = boost::lexical_cast<int>(mk_str(intp.SIGNED));\n    if(length<=8) length = 8;\n    else if(length<=16) length=16;\n    else if(length<=32) length=32;\n    else if(length<=64) length=64;\n    else throw std::range_error(\"Integer longer than 64 bits\");\n    return (boost::format(\"%s%d_t\") % (intp.N_type == UNSIGNED ? \"uint\":\"int\" )% length).str();\n  }\n\n  \/\/ Gets the type for a top-level parser (to be used in the typedef)\n  std::string typedef_type(const parser &p, std::string name){\n    const parserinner &inner(p.N_type == PR ? p.PR : p.PAREN);\n    switch(inner.N_type){\n    case INT:\n      return int_type(inner.INT.parser);\n    case WRAP:\n      return typedef_type(*inner.WRAP.parser,name);\n    case OPTIONAL:\n      return (boost::format(\"%s*\") % typedef_type(*inner.OPTIONAL,name)).str();\n    case NAME:\n      return mk_str(inner.NAME);\n    case REF:\n      return (boost::format(\"%s *\") % mk_str(inner.NAME)).str();\n    case UNION:\n      \/*   FOREACH(parser,inner.UNION){\n           if(!type_equal(inner.UNION.elem[0],parser))\n           throw std::runtime_error(\"Grammar invalid at UNION\");\n           } *\/\n      return typedef_type(*inner.UNION.elem[0],name);\n    case STRUCT:\n    case ARRAY:\n    case CHOICE:\n      return (boost::format(\"struct %s\") % name).str();\n \n    }\n  }\n  void emit_type( const parser &outer,const std::string name =\"\"){\n    const parserinner &p = outer.PR;\n    switch(p.N_type){\n    case INT:\n      out << int_type(p.INT.parser);\n      break;\n    case STRUCT:\n      out<<\"struct \" << name << \"{\\n\";\n      FOREACH(field,p.STRUCT){\n        if(field->N_type != FIELD)\n          continue;\n        emit_type(out, *field->FIELD.parser);\n        out << \" \" << mk_str(field->FIELD.name) << \";\\n\";\n      }\n      out << \"}\" << std::endl;\n      break;\n    case WRAP:\n      emit_type(out,*p.WRAP.parser);\n      break;\n    case CHOICE:{\n      out << \"struct \" << name<< \"{\\n enum  {\";\n      int idx=0;\n      FOREACH(option, p.CHOICE){\n        if(idx++ >0) \n          out << ',';\n        out << mk_str(option->tag);\n      }\n      out << \"} N_type; \\n\";\n      out << \"union {\\n\";\n      FOREACH(option, p.CHOICE){\n        emit_type(out,*option->parser);\n        out << \" \"<<  mk_str(option->tag) << \";\\n\";\n      }\n      out<< \"};\\n}\";\n    }\n      break;\n  \n    case ARRAY:\n      out << \"struct \"<< name <<\"{\\n\";\n      switch(p.ARRAY.N_type){\n      case MANY:\n      case MANYONE:\n        emit_type(out,*p.ARRAY.MANY);\n        break;\n      case SEPBY:\n      case SEPBYONE:\n        emit_type(out,*p.ARRAY.SEPBY.inner);\n        break;\n      }\n      out << \"*elem;\\n size_t count;\\n\";\n      out << \"}\" ;\n      break;\n    case OPTIONAL:\n      emit_type(out,*p.OPTIONAL);\n      out << \"*\";\n      break;\n    case UNION:\n      {\n        std::string first;\n        int idx=0;\n        FOREACH(elem, p.UNION){\n          std::stringstream tmp;\n          emit_type(tmp,**elem);\n          if(idx++==0)\n            first = tmp.str();\n          else{\n            \/\/TODO: Perform in-depth checking\n            \/\/         if(first!= tmp.str()){\n            \/\/        throw std::runtime_error(boost::str(boost::format(\"UNION elements do not induce the same type\\n %s \\n %s\") % tmp.str() % first)); \/\/Be more\n            \/\/descriptive\n            \/\/    }\n          }\n        }\n        out << first;\n      }\n      break;\n    case REF:\n      out << mk_str(p.REF)<<\"* \";\n      break;\n    case NAME:\n      out << mk_str(p.NAME);\n      break;\n    }\n  }\n  void emit_type_definition( const parser &p,const std::string name)\n  {\n    switch(p.PR.N_type){\n    case STRUCT:\n    case ARRAY:\n    case CHOICE:\n      emit_type(out,p,name);\n      out << \";\" << std::endl;\n      break;\n    case WRAP:\n      emit_type_definition(out,*p.PR.WRAP.parser,name);\n      break;\n    default:\n      break; \/\/Other definitions don't need a type\n    }\n  }\n  void emit_type( const definition &def){\n    if(def.N_type != PARSER)\n      return;\n    std::string name(mk_str(def.PARSER.name));\n    emit_type_definition(out,def.PARSER.definition,name);\n  }\npublic:\n  void emit_parser( grammar *grammar){\n    try{\n      assert(out.good());\n      out << \"#include <stdint.h>\\n #include <string.h>\\n\";\n      \/\/Emit forward declarations\n      FOREACH(definition,*grammar){\n        if(definition->N_type!=PARSER)\n          continue;\n        std::string name(mk_str(definition->PARSER.name));\n        out << \"typedef \"<< typedef_type(definition->PARSER.definition,name)<< \" \" << name << \";\" << std::endl;\n      }\n      FOREACH(definition, *grammar){\n        emit_type(out,*definition);\n      }\n      out<< std::endl;\n    } catch(std::exception &e){\n      std::cerr << \"Exception while generating parser\" << e.what()<<std::endl;\n      exit(-1);\n    }\n  }\n\n  CDataModel(std::ostream *os) : out(*os){}\n  \n};\n\nstd::string intconstant_value(const intconstant &val){\n  switch(val.N_type){\n  case ASCII:\n    if(val.ASCII.N_type == escape)\n      return boost::str(boost::format(\"'\\\\%c'\") % val.ASCII.escape);\n    else\n      return boost::str(boost::format(\"'%c'\") % val.ASCII.direct);\n    break;\n  case NUMBER:\n    return mk_str(val.NUMBER);\n  }\n}\nclass CPrimitiveParser{\n  std::ostream &out;\n  int nr_choice,nr_option;\n  int nr_many;\n  int nr_const;\n  \n  int bit_offset = 0; \/\/ < 0 = unknown alignment, 0 == byte aligned, 1 = byte + 1, etc \n  CPrimitiveParser(std::ostream *os) : out(*os), nr_choice(1),nr_many(0),nr_const(0){}\n  std::string choice_label(){return  (boost::format(\"choice_%u_%u\") % nr_choice %n_option++).str();}\n  \/*Packrat pass emits a light-weight trace of data structure*\/\n  \/\/TODO: Keep track of bit alignment\n  void check_int(unsigned int width, const std::string &fail){\n    out << \"if(off + \"<< width <<\">= max) {fail}\";\n  }\n  std::string int_expr(unsigned int width){\n    if(width>=64){\n      throw std::runtime_error(\"More than 64 bits in integer\");\n    }\n    \/\/TODO: x\n    \/\/ TODO: Make big endian. Flip n bytes\n    return boost::str(boost::format(\"BITSLICE(*(uint64_t *)(data+(off % ~7)),off & 7 + %d, off&7)\") % bytes);\n  }\n  void constraint( const intconstraint &constraint){\n      switch(constraint.N_type){\n      case RANGE:\n        out << \"val>\"<<intconstant_value(constraint.RANGE.max) << \"|| val < \"<<intconstant_value(constraint.RANGE.min);\n        break;\n      case SET:\n        {\n          int first = 0;\n          FOREACH(val,constraint.SET){\n            if(first++ != 0)\n              out << \" && \";\n            out << \"val != \"<<intconstant_value(val);\n          }\n        }\n        break;\n      case NEGATE:\n        out << \"!(\";\n        constraint(!constraint.NEGATE);\n        out << \")\";\n        break;\n      }\n  }\n  \n  void packrat(const constrainedint &c, const std::string &fail){\n    int width = boost::lexical_cast<int>(mk_str(c.parser.UNSIGNED));\n    check_int(width,fail);\n    if(c.constraint != NULL){\n      out << \"{\\n uint64 val = \"<< int_expr(width) << \";\\n\";\n      out << \"if(\";\n      constraint(*c.constraint);\n      out << \"){\"<<fail<<\"}\\n\";\n      out << \"}\\n\";\n    }\n    out << \"pos +=\"<< width<<\";\\n\";\n  }\n  void packrat_constint(int width, std::string value,std::string &fail){\n      check_int(width,fail);\n      out << \"if( \"<< int_expr(width) << \"!= \"<<value\"){\"<<fail<<\"}\";\n      out << \"off += \" << width; \/\/TODO deal with bits\n      out << \"end_of_const = pos;\"\n  }\n  void packrat_const(const constarray &c, const std::string &fail){\n    switch(c.value.N_type){\n    case STRING:\n      assert(mk_str(c.parser.UNSIGNED) == \"8\");\n      FOREACH(ch, c.value.STRING){\n        packrat_constint(8,std::string(ch),fail);\n      }\n      break;\n    case VALUES:{\n      int width = boost::lexical_cast<int>(mk_str(c.parser.UNSIGNED));\n      FOREACH(v,c.value.VALUES){\n        packrat_constint(width, intconstant_value(v),fail);\n      }\n      break;\n    }\n      \n    }\n\n  }\n\n  void packrat_const(const constparser &c, const std::string &fail){\n\n    switch(c.N_type){\n    case CARRAY:\n      packrat_const(c.CARRAY);\n      break;\n    case CREPEAT:{\n      std::string retrylabel = (boost::format(\"constmany_%d_repeat\") % nr_const++).str();\n      std::string faillabel = (boost::format(\"constmany_%d_end\") % nr_const++).str();\n      out << retrylabel << \":\\n\";\n      packrat_const(c.CREPEAT,std::string(\"goto \")+faillabel+\";\");\n      out << \"goto \" << retrylabel << \";\\n\";\n      out << faillabel << \":\\n\";\n      break;\n    }\n    case CINT:{\n      int width = boost::lexical_cast<int>(mk_str(c.CINT.parser.UNSIGNED));\n      long long value = boost::lexical_cast<long long>();\n      packrat_constint(width,mk_str(c.CINT.value),fail);\n    }\n    break;\n    case CREF:\n      out << \"{\\n\"\n          <<\"pos ext = packrat_const_\" << make_str(c.CREF) << \"();\"\n          <<\"if(ext < 0){\" << fail << \"}\\n\"\n          << \"end_of_const = ext;\"\n          << \"}\";\n      break;\n    case CSTRUCT:\n      FOREACH(field,c.CSTRUCT){\n        packrat_const(field,fail);\n      }\n        break;\n    }\n\n  }\n  void packrat(const constparser &c, const std::string &fail){\n    out << \"{ pos end_of_const = off;\";\n    packrat_const(c,fail);\n    out << \"if(parser_fail(n_tr_const(trace,end_of_const))){\"<<fail<<\"}\\n\"\n    out << \"}\";    \n  }\n  typedef  std::list<const parser &> parserlist;\n  void packrat_choice(const parserlist &list, const std::string &fail){\n    nr_choice++;\n    nr_option = 0;\n    out << \"{pos backtrack = off;\\n\"\n        << \"pos choice_begin = n_tr_begin_choice(trace); \\n\"\n        << \"pos choice;\\n\"\n        << \"if(parser_fail(choice_begin)) {\" << fail <<\"}\\n\";\n    int i=0;\n    std::string success_label = (boost::format(\"choice_%d_succ\") % nr_choice).str();\n    BOOST_FOREACH(parser &p, list){\n      std::string fallthrough_memo  = choice_label();\n      std::string fallthrough_goto = boost::str(boost_format(\"goto %s\") % fallthrough_memo);\n      out << \"choice = n_tr_memo_choice(trace);\\n\";\n      packrat(p,fallthrough_goto);\n      out << \"goto \" << success_label<< \"\\n\";\n      out << fallthrough_memo << \":\\n\";\n      out << \"trace->iter = backtrack;\\n\";\n    }\n    out << fail << \"\\n\";\n    out << success_label <<\":\\n\";\n  }\n  void packrat_repeat(const parser &p, const std::string &fail, size_t min, const constparser *separator){\n    std::string gotofail=(boost::format(\"goto fail_repeat_%d;\") % nr_many).str();\n    out << \"{\\n\";\n    out << \"pos many = n_tr_memo_many(n_trace *trace);\\n\"\n        << \"pos count = 0;\\n\"\n        << \"succ_optional_\" << nr_many << \":\";\n    if(separator != NULL){\n      out << \"if(count>0){\\n\";\n      packrat(*separator,gotofail);\n      out << \"}\\n\";\n    }\n    packrat(p, gotofail);\n    out << \"count++;\\n\";\n    out << \" goto succ_optional_\"<< nr_many << \";\\n\";\n    out << \"fail_optional_\" << nr_many << \":\\n\";\n    if(min>0){\n      out << \"if(count < min){\"<< fail << \"}\\n\";\n    }\n    out << \"n_tr_write_many(trace,many,count);\\n\"\n    nr_many++;          \n  }\n  void packrat_array(const arrayparser &array, const std::string &fail){\n    switch(array.N_type){\n    case MANYONE:\n      packrat_repeat(*array.MANYONE,fail, 1,NULL);\n      break;\n    case MANY:\n      packrat_repeat(*array.MANY,fail, 0,NULL);\n      break;\n    case SEPBYONE:\n      packrat_repeat(*array.SEPBYONE.inner,fail, 1,&array.SEPBYONE.separator);\n      break;\n    case SEPBY:\n      packrat_repeat(*array.SEPBY,fail, 0, &array.SEPBY.separator);\n      break;\n    }\n  }\n  void packrat_optional(const parser &p, const std::string &fail){\n    out << \"{\\n\";\n    out << \"pos many = n_tr_memo_many(n_trace *trace);\\n\";\n    packrat(p, (boost::format(\"goto fail_optional_%d;\") % nr_many).str());\n    out << \"n_tr_write_many(trace,many, 1); goto succ_optional_\"<< nr_many << \";\\n\";\n    out << \"fail_optional_\" << nr_many << \":\\n\";\n    out << \"n_tr_write_many(trace,many,0);\\n\"\n        << \"succ_optional_\" << nr_many << \":\\n\";\n    nr_many++;      \n  }\n  void packrat(const parser &parser, const std::string &fail ){\n    switch(parser.PR.N_type){\n    case INT:\n      packrat(parser.PR.INT,fail);\n      break;\n    case STRUCT:\n      FOREACH(field,parser.PR.STRUCT){\n        switch(field.N_type){\n        case CONSTANT:\n          packrat(field.CONSTANT,fail);\n          break;\n        case FIELD:\n          packrat(field.PARSER.parser,fail);\n          break;\n        }\n      }\n      break;\n    case WRAP:\n      if(parser.PR.WRAP.constbefore){\n        FOREACH(c,parser.PR.WRAP.constbefore){\n          packrat(c,fail);\n        }\n      }\n      packrat(parser.PR.WRAP.parser);\n      if(parser.PR.WRAP.constafter){\n        FOREACH(c,parser.PR.WRAP.constafter){\n          packrat(c,fail);\n        }\n      }\n      break;\n    case CHOICE:\n      {\n        parserlist l;\n        FOREACH(c, parser.PR.CHOICE){\n          l.push_back(c.parser);\n        }\n        packrat_choice(l,fail);\n      }\n      break;\n    case UNION:\n      {\n        parserlist l;\n        FOREACH(c, parser.UNION){\n          l.push_back(c);\n        }\n        packrat_choice(l,fail);\n      }\n    case ARRAY:\n      packrat(parser.PR.ARRAY,fail); \n      break;\n    case OPTIONAL:\n      packrat(parser.PR.OPTIONAL,fail);\n      break;\n      \/\/TODO: Do caching here\n    case NAME: \/\/ Fallthrough intentional, and kludgy\n    case REF: \n      out << \"i = packrat_\" << parser.PR.REF.name<< \"(tmp, trace,data,pos,max);\";\n      out << \"if(parser_fail(i)){\" << fail << \"}\\n\";\n          << \"else{off=i;}\";\n      break;\n    }\n  }\n  void packrat(const definition &def) {\n    std::string name = mk_str(def.name);\n    out <<\"static int packrat_\" << name <<\"(NailArena *tmp,n_trace *trace, const char *data, pos off, pos max){\\n\";\n    out << \"pos i;\\n\"; \/\/Used in name and ref as temp variables\n    out << \"}\\n\";\n  }\n};\nvoid emit_parser(std::ostream *out, grammar *grammar){\n  CDataModel data(out);\n  CPrimitiveParser p(out);\n  data.emit_parser(grammar);\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 <QtCore>\n\n#include <getopt.h>\n\n#include <chemkit\/chemkit.h>\n#include <chemkit\/molecule.h>\n#include <chemkit\/lineformat.h>\n#include <chemkit\/moleculefile.h>\n\n\/\/ option flags\nint COMPOSITION_FLAG = 0;\nint EXACT_MATCH_FLAG = 0;\nint NAMES_ONLY_FLAG = 0;\nint INVERT_MATCH_FLAG = 0;\n\nstruct option options[] = {\n    {\"composition\", no_argument, &COMPOSITION_FLAG, 'c'},\n    {\"exact-match\", no_argument, &EXACT_MATCH_FLAG, 'e'},\n    {\"help\", no_argument, 0, 'h'},\n    {\"names-only\", no_argument, &NAMES_ONLY_FLAG, 'n'},\n    {\"invert-match\", no_argument, &INVERT_MATCH_FLAG, 'v'},\n    {0, 0, 0, 0},\n};\n\nvoid printHelp()\n{\n    QTextStream out(stdout);\n\n    out << QString(\"Usage: %1 [OPTIONS] PATTERN FILE\\n\").arg(qAppName());\n    out << \"\\n\";\n    out << \"Search for molecules matching PATTERN in FILE. PATTERN is a line\\n\";\n    out << \"representation (e.g. InChI or SMILES) of a molecule to search\\n\";\n    out << \"for. A matching molecule is either an exact match or a\\n\";\n    out << \"superstructure of PATTERN.\\n\";\n    out << \"\\n\";\n    out << \"Options:\\n\";\n    out << \"  -c, --composition    Match composition rather than structure.\\n\";\n    out << \"  -e, --exact-match    Return molecules that exactly match PATTERN.\\n\";\n    out << \"  -h, --help           Display this help and exit.\\n\";\n    out << \"  -n, --names-only     Output only the names of matching molecules.\\n\";\n    out << \"  -v, --invert-match   Return only non-matching molecules.\\n\";\n    out << \"\\n\";\n}\n\nint main(int argc, char *argv[])\n{\n    QCoreApplication app(argc, argv);\n    app.setApplicationName(argv[0]);\n\n    QTextStream out(stdout);\n    QTextStream err(stderr);\n\n    QString inputPattern;\n    QString inputFileName;\n\n    \/\/ parse options\n    for(;;){\n        int optionIndex = 0;\n\n        int c = getopt_long_only(argc, argv, \"cehnv\", options, &optionIndex);\n\n        \/\/ no more options\n        if(c == -1){\n            if(argc > optind)\n                inputPattern = argv[optind];\n            if(argc > optind + 1)\n                inputFileName = argv[optind+1];\n            break;\n        }\n\n        switch(c){\n            case '?':\n                return -1; \/\/ invalid argument\n            case 'h':\n                printHelp();\n                return 0;\n            default:\n                break;\n        }\n    }\n\n    if(inputPattern.isEmpty()){\n        err << \"Error: no input pattern given\\n\";\n        printHelp();\n        return -1;\n    }\n\n    if(inputFileName.isEmpty()){\n        err << \"Error: no input file given\\n\";\n        printHelp();\n        return -1;\n    }\n\n    \/\/ select input line format based on the input pattern given\n    QString inputFormat;\n    if(inputPattern.startsWith(\"InChI=\") || inputPattern[0].isDigit()){\n        inputFormat = \"inchi\";\n    }\n    else{\n        inputFormat = \"smiles\";\n    }\n\n    \/\/ create input line format\n    chemkit::LineFormat *patternFormat = chemkit::LineFormat::create(inputFormat.toStdString());\n    if(!patternFormat){\n        err << \"Error: failed to create line format\\n\";\n        return -1;\n    }\n\n    \/\/ read input molecule\n    chemkit::Molecule *patternMolecule = patternFormat->read(inputPattern.toStdString());\n    if(!patternMolecule){\n        err << \"Error: failed to read pattern molecule: \" << patternFormat->errorString().c_str() << \"\\n\";\n        delete patternFormat;\n        return -1;\n    }\n\n    \/\/ read input file\n    chemkit::MoleculeFile inputFile(inputFileName.toStdString());\n    if(!inputFile.read()){\n        err << \"Error: failed to read input file: \" << inputFile.errorString().c_str() << \"\\n\";\n        return -1;\n    }\n\n    chemkit::MoleculeFile outputFile;\n\n    chemkit::Molecule::CompareFlags flags;\n\n    if(COMPOSITION_FLAG){\n        flags |= chemkit::Molecule::CompareAtomsOnly;\n    }\n\n    foreach(chemkit::Molecule *molecule, inputFile.molecules()){\n        bool match = false;\n\n        if(EXACT_MATCH_FLAG){\n            match = patternMolecule->equals(molecule, flags);\n        }\n        else{\n            match = patternMolecule->isSubstructureOf(molecule, flags);\n        }\n\n        if((match && !INVERT_MATCH_FLAG) || (!match && INVERT_MATCH_FLAG)){\n            inputFile.removeMolecule(molecule);\n            outputFile.addMolecule(molecule);\n        }\n    }\n\n    if(NAMES_ONLY_FLAG){\n        foreach(const chemkit::Molecule *molecule, outputFile.molecules()){\n            out << molecule->name().c_str() << \"\\n\";\n        }\n    }\n    else{\n        QFile stdoutFile;\n        stdoutFile.open(stdout, QFile::WriteOnly);\n        bool ok = outputFile.write(&stdoutFile, inputFile.formatName());\n        stdoutFile.close();\n\n        if(!ok){\n            err << \"Error: failed to write output file: \" << outputFile.errorString().c_str() << \"\\n\";\n            return -1;\n        }\n    }\n\n    delete patternFormat;\n    delete patternMolecule;\n\n    return 0;\n}\n<commit_msg>Change chemkit-grep to use new iostream file methods<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 <QtCore>\n\n#include <getopt.h>\n#include <iostream>\n\n#include <chemkit\/chemkit.h>\n#include <chemkit\/molecule.h>\n#include <chemkit\/lineformat.h>\n#include <chemkit\/moleculefile.h>\n\n\/\/ option flags\nint COMPOSITION_FLAG = 0;\nint EXACT_MATCH_FLAG = 0;\nint NAMES_ONLY_FLAG = 0;\nint INVERT_MATCH_FLAG = 0;\n\nstruct option options[] = {\n    {\"composition\", no_argument, &COMPOSITION_FLAG, 'c'},\n    {\"exact-match\", no_argument, &EXACT_MATCH_FLAG, 'e'},\n    {\"help\", no_argument, 0, 'h'},\n    {\"names-only\", no_argument, &NAMES_ONLY_FLAG, 'n'},\n    {\"invert-match\", no_argument, &INVERT_MATCH_FLAG, 'v'},\n    {0, 0, 0, 0},\n};\n\nvoid printHelp()\n{\n    QTextStream out(stdout);\n\n    out << QString(\"Usage: %1 [OPTIONS] PATTERN FILE\\n\").arg(qAppName());\n    out << \"\\n\";\n    out << \"Search for molecules matching PATTERN in FILE. PATTERN is a line\\n\";\n    out << \"representation (e.g. InChI or SMILES) of a molecule to search\\n\";\n    out << \"for. A matching molecule is either an exact match or a\\n\";\n    out << \"superstructure of PATTERN.\\n\";\n    out << \"\\n\";\n    out << \"Options:\\n\";\n    out << \"  -c, --composition    Match composition rather than structure.\\n\";\n    out << \"  -e, --exact-match    Return molecules that exactly match PATTERN.\\n\";\n    out << \"  -h, --help           Display this help and exit.\\n\";\n    out << \"  -n, --names-only     Output only the names of matching molecules.\\n\";\n    out << \"  -v, --invert-match   Return only non-matching molecules.\\n\";\n    out << \"\\n\";\n}\n\nint main(int argc, char *argv[])\n{\n    QCoreApplication app(argc, argv);\n    app.setApplicationName(argv[0]);\n\n    QTextStream out(stdout);\n    QTextStream err(stderr);\n\n    QString inputPattern;\n    QString inputFileName;\n\n    \/\/ parse options\n    for(;;){\n        int optionIndex = 0;\n\n        int c = getopt_long_only(argc, argv, \"cehnv\", options, &optionIndex);\n\n        \/\/ no more options\n        if(c == -1){\n            if(argc > optind)\n                inputPattern = argv[optind];\n            if(argc > optind + 1)\n                inputFileName = argv[optind+1];\n            break;\n        }\n\n        switch(c){\n            case '?':\n                return -1; \/\/ invalid argument\n            case 'h':\n                printHelp();\n                return 0;\n            default:\n                break;\n        }\n    }\n\n    if(inputPattern.isEmpty()){\n        err << \"Error: no input pattern given\\n\";\n        printHelp();\n        return -1;\n    }\n\n    if(inputFileName.isEmpty()){\n        err << \"Error: no input file given\\n\";\n        printHelp();\n        return -1;\n    }\n\n    \/\/ select input line format based on the input pattern given\n    QString inputFormat;\n    if(inputPattern.startsWith(\"InChI=\") || inputPattern[0].isDigit()){\n        inputFormat = \"inchi\";\n    }\n    else{\n        inputFormat = \"smiles\";\n    }\n\n    \/\/ create input line format\n    chemkit::LineFormat *patternFormat = chemkit::LineFormat::create(inputFormat.toStdString());\n    if(!patternFormat){\n        err << \"Error: failed to create line format\\n\";\n        return -1;\n    }\n\n    \/\/ read input molecule\n    chemkit::Molecule *patternMolecule = patternFormat->read(inputPattern.toStdString());\n    if(!patternMolecule){\n        err << \"Error: failed to read pattern molecule: \" << patternFormat->errorString().c_str() << \"\\n\";\n        delete patternFormat;\n        return -1;\n    }\n\n    \/\/ read input file\n    chemkit::MoleculeFile inputFile(inputFileName.toStdString());\n    if(!inputFile.read()){\n        err << \"Error: failed to read input file: \" << inputFile.errorString().c_str() << \"\\n\";\n        return -1;\n    }\n\n    chemkit::MoleculeFile outputFile;\n\n    chemkit::Molecule::CompareFlags flags;\n\n    if(COMPOSITION_FLAG){\n        flags |= chemkit::Molecule::CompareAtomsOnly;\n    }\n\n    foreach(chemkit::Molecule *molecule, inputFile.molecules()){\n        bool match = false;\n\n        if(EXACT_MATCH_FLAG){\n            match = patternMolecule->equals(molecule, flags);\n        }\n        else{\n            match = patternMolecule->isSubstructureOf(molecule, flags);\n        }\n\n        if((match && !INVERT_MATCH_FLAG) || (!match && INVERT_MATCH_FLAG)){\n            inputFile.removeMolecule(molecule);\n            outputFile.addMolecule(molecule);\n        }\n    }\n\n    if(NAMES_ONLY_FLAG){\n        foreach(const chemkit::Molecule *molecule, outputFile.molecules()){\n            out << molecule->name().c_str() << \"\\n\";\n        }\n    }\n    else{\n        bool ok = outputFile.write(std::cout, inputFile.formatName());\n        if(!ok){\n            err << \"Error: failed to write output file: \" << outputFile.errorString().c_str() << \"\\n\";\n            return -1;\n        }\n    }\n\n    delete patternFormat;\n    delete patternMolecule;\n\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * \n *\/\n\n#include <ros\/ros.h>\n#include <tf\/transform_broadcaster.h>\n#include \"std_msgs\/Float32.h\"\n#include \"AprilTagReader.h\"\n\n#define NUM_APRIL_TAGS 10\n\nros::Time last_lw_time, last_rw_time;\n\nbool hasNewSpeeds = true;\n\nint main(int argc, char** argv){\n  ros::init(argc, argv, \"AprilTagsNode\");\n\n  ros::NodeHandle n;\n\n  \/*\n  std::vector<tf::TransformBroadcaster> tags_broadcaster;\n  for (int i = 0; i < NUM_APRIL_TAGS; ++i)\n  {\n    tags_broadcaster.push_back(tf::TransformBroadcaster());\n  }\n  *\/\n \n  ros::Publisher tags_pub = n.advertise<geometry_msgs::PoseStamped>(\"\/apriltags\", 1000);\n\n  tf::TransformBroadcaster tags_broadcaster;\n\n  AprilTagReader reader;\n  reader.setup();\n\n  ros::Time current_time, last_time;\n  current_time = ros::Time::now();\n  last_time = ros::Time::now();\n\n  ros::Rate r(1.0);\n\n  while(n.ok()){\n    ros::spinOnce();               \/\/ check for incoming messages\n\n    ROS_INFO(\"Reading April Tags...\");\n    reader.read();\n\n    current_time = ros::Time::now();\n\n    ROS_INFO(\"Running... #tags: %ld, time: %lf\",reader.getTags().size(), current_time.toSec());\n\n    for (int i=0; i<reader.getTags().size(); i++)\n    {\n      AprilTags::TagDetection td = reader.getTags()[i];\n      int id = reader.getTags()[i].id;\n\n      double x,y,z,roll,pitch,yaw;\n      reader.getTransformInfo(td, x,y,z,roll,pitch,yaw);\n\n      \/\/Pitch = z axis\n      \/\/Yaw = x axis\n      \/\/Roll = y axis\n\n      \/\/pitch += PI;\n      \/\/pitch = -pitch;\n\n      geometry_msgs::Quaternion odom_quat = tf::createQuaternionMsgFromRollPitchYaw(yaw, roll, pitch);\n\n      \/\/first, we'll publish the transform over tf\n      geometry_msgs::TransformStamped tag_transform;\n      tag_transform.header.stamp = current_time;\n      tag_transform.header.frame_id = \"camera_link\";\n\n      stringstream ss;\n      ss << \"april_tag[\"<<id<<\"]\";\n      \n      tag_transform.child_frame_id = ss.str().c_str();\n\n      tag_transform.transform.translation.x = x;\n      tag_transform.transform.translation.y = y;\n      tag_transform.transform.translation.z = z;\n      tag_transform.transform.rotation = odom_quat;\n\n      \/\/send the transform\n      tags_broadcaster.sendTransform(tag_transform);\n\n      \/\/\/trash can has been found\n      if (id % 2 == 0)\n      {\n        geometry_msgs::PoseStamped ps;\n        ps.header.frame_id = \"2\";\n        ps.pose.position.x = x;\n        ps.pose.position.y = y;\n        ps.pose.orientation = odom_quat;\n        tags_pub.publish(ps);\n      }\n    }\n\n    cvWaitKey(10);\n    last_time = current_time;\n    r.sleep();\n  }\n}\n<commit_msg>updated tag stuff<commit_after>\/**\n * \n *\/\n\n#include <ros\/ros.h>\n#include <tf\/transform_broadcaster.h>\n#include <tf\/transform_listener.h>\n#include <nav_msgs\/Odometry.h>\n#include \"std_msgs\/Float32.h\"\n#include \"AprilTagReader.h\"\n\n#define NUM_APRIL_TAGS 10\n\nros::Time last_lw_time, last_rw_time;\n\nbool hasNewSpeeds = true;\n\nint main(int argc, char** argv){\n  ros::init(argc, argv, \"AprilTagsNode\");\n\n  ros::NodeHandle n;\n\n  \/*\n  std::vector<tf::TransformBroadcaster> tags_broadcaster;\n  for (int i = 0; i < NUM_APRIL_TAGS; ++i)\n  {\n    tags_broadcaster.push_back(tf::TransformBroadcaster());\n  }\n  *\/\n \n\n  tf::TransformBroadcaster tags_broadcaster;\n\n  AprilTagReader reader;\n  reader.setup();\n\n  ros::Time current_time, last_time;\n  current_time = ros::Time::now();\n  last_time = ros::Time::now();\n\n  ros::Rate r(1.0);\n\n  tf::TransformListener listener(n);\n\n  while(n.ok()){\n    ros::spinOnce();               \/\/ check for incoming messages\n\n    ROS_INFO(\"Reading April Tags...\");\n    reader.read();\n\n    current_time = ros::Time::now();\n\n    ROS_INFO(\"Running... #tags: %ld, time: %lf\",reader.getTags().size(), current_time.toSec());\n\n    for (int i=0; i<reader.getTags().size(); i++)\n    {\n      AprilTags::TagDetection td = reader.getTags()[i];\n      int id = reader.getTags()[i].id;\n\n      double x,y,z,roll,pitch,yaw;\n      reader.getTransformInfo(td, x,y,z,roll,pitch,yaw);\n\n      \/\/Pitch = z axis\n      \/\/Yaw = x axis\n      \/\/Roll = y axis\n\n      \/\/pitch += PI;\n      \/\/pitch = -pitch;\n\n      geometry_msgs::Quaternion odom_quat = tf::createQuaternionMsgFromRollPitchYaw(yaw, roll, pitch);\n\n      \/\/first, we'll publish the transform over tf\n      geometry_msgs::TransformStamped tag_transform;\n      tag_transform.header.stamp = current_time;\n      tag_transform.header.frame_id = \"camera_link\";\n\n      stringstream ss;\n      ss << \"\/april_tag[\"<<id<<\"]\";\n      \n      tag_transform.child_frame_id = ss.str().c_str();\n\n      tag_transform.transform.translation.x = x;\n      tag_transform.transform.translation.y = y;\n      tag_transform.transform.translation.z = z;\n      tag_transform.transform.rotation = odom_quat;\n\n      \/\/send the transform\n      tags_broadcaster.sendTransform(tag_transform);\n\n      \/\/\/trash can has been found\n      if (id % 2 == 0)\n      {\n      }\n    }\n\n    cvWaitKey(10);\n    last_time = current_time;\n    r.sleep();\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * This file is part of the \"FnordMetric\" project\n *   Copyright (c) 2011-2014 Paul Asmuth, Google Inc.\n *\n * FnordMetric is free software: you can redistribute it and\/or modify it under\n * the terms of the GNU General Public License v3.0. You should have received a\n * copy of the GNU General Public License along with this program. If not, see\n * <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n#include <stdlib.h>\n#include <fnordmetric\/util\/exceptionhandler.h>\n#include <fnordmetric\/util\/runtimeexception.h>\n\nnamespace fnord {\nnamespace util {\n\nusing fnordmetric::util::RuntimeException;\n\nCatchAndPrintExceptionHandler::CatchAndPrintExceptionHandler(\n    Logger* logger) :\n    logger_(logger) {}\n\nvoid CatchAndPrintExceptionHandler::onException(\n    const std::exception& error) const {\n  logger_->exception(\"ERROR\", \"Uncaught exception\", error);\n}\n\nCatchAndAbortExceptionHandler::CatchAndAbortExceptionHandler(\n    const std::string& message) :\n    message_(message) {}\n\nvoid CatchAndAbortExceptionHandler::onException(\n    const std::exception& error) const {\n  fprintf(stderr, \"%s\\n\\n\", message_.c_str()); \/\/ FIXPAUL\n\n  try {\n    auto rte = dynamic_cast<const RuntimeException&>(error);\n    rte.debugPrint();\n    exit(1);\n  } catch (const std::exception& e) {\n    fprintf(stderr, \"Aborting...\\n\");\n    abort(); \/\/ core dump if enabled\n  }\n}\n\nstatic std::string globalEHandlerMessage;\nstatic void globalEHandler() {\n  fprintf(stderr, \"%s\\n\", globalEHandlerMessage.c_str());\n\n  try {\n    throw;\n  } catch (const std::exception& e) {\n    try {\n      auto rte = dynamic_cast<const RuntimeException&>(e);\n      rte.debugPrint();\n      exit(1);\n    } catch (...) {\n      \/* fallthrough *\/\n    }\n  } catch (...) {\n    \/* fallthrough *\/\n  }\n\n  abort();\n}\n\nvoid CatchAndAbortExceptionHandler::installGlobalHandlers() {\n  globalEHandlerMessage = message_;\n  std::set_terminate(&globalEHandler);\n  std::set_unexpected(&globalEHandler);\n}\n\n}\n}\n<commit_msg>always abort() in CatchAndAbortExceptionHandler<commit_after>\/**\n * This file is part of the \"FnordMetric\" project\n *   Copyright (c) 2011-2014 Paul Asmuth, Google Inc.\n *\n * FnordMetric is free software: you can redistribute it and\/or modify it under\n * the terms of the GNU General Public License v3.0. You should have received a\n * copy of the GNU General Public License along with this program. If not, see\n * <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n#include <stdlib.h>\n#include <fnordmetric\/util\/exceptionhandler.h>\n#include <fnordmetric\/util\/runtimeexception.h>\n\nnamespace fnord {\nnamespace util {\n\nusing fnordmetric::util::RuntimeException;\n\nCatchAndPrintExceptionHandler::CatchAndPrintExceptionHandler(\n    Logger* logger) :\n    logger_(logger) {}\n\nvoid CatchAndPrintExceptionHandler::onException(\n    const std::exception& error) const {\n  logger_->exception(\"ERROR\", \"Uncaught exception\", error);\n}\n\nCatchAndAbortExceptionHandler::CatchAndAbortExceptionHandler(\n    const std::string& message) :\n    message_(message) {}\n\nvoid CatchAndAbortExceptionHandler::onException(\n    const std::exception& error) const {\n  fprintf(stderr, \"%s\\n\\n\", message_.c_str()); \/\/ FIXPAUL\n\n  try {\n    auto rte = dynamic_cast<const RuntimeException&>(error);\n    rte.debugPrint();\n  } catch (const std::exception& e) {\n    fprintf(stderr, \"Aborting...\\n\");\n  }\n\n  abort(); \/\/ core dump if enabled\n}\n\nstatic std::string globalEHandlerMessage;\nstatic void globalEHandler() {\n  fprintf(stderr, \"%s\\n\", globalEHandlerMessage.c_str());\n\n  try {\n    throw;\n  } catch (const std::exception& e) {\n    try {\n      auto rte = dynamic_cast<const RuntimeException&>(e);\n      rte.debugPrint();\n      exit(1);\n    } catch (...) {\n      \/* fallthrough *\/\n    }\n  } catch (...) {\n    \/* fallthrough *\/\n  }\n\n  abort();\n}\n\nvoid CatchAndAbortExceptionHandler::installGlobalHandlers() {\n  globalEHandlerMessage = message_;\n  std::set_terminate(&globalEHandler);\n  std::set_unexpected(&globalEHandler);\n}\n\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"сomplex_t.hpp\"\ncomplex_t::complex_t() : a(0.0), b(0.0)\n{}\ncomplex_t::complex_t(double x, double y) : a(x), b(y)\n{}\ncomplex_t::complex_t(const complex_t&cop)\n{\n\ta = cop.a;\n\tb = cop.b;\n}\ndouble complex_t::a_() const\n{\n\treturn a;\n}\n\ndouble complex_t::b_() const\n{\n\treturn b;\n}\nbool complex_t::operator == (const complex_t& c2) const\n{\n\tif ((a == c2.a) && (b == c2.b))\n\t\treturn true;\n}\n\ncomplex_t complex_t::operator = (const complex_t& result)\n{\n\tif (this != &result) \n\t{\n\ta = result.a;\n\tb = result.b;\n\treturn *this;\n\t}\n\n}\nistream& operator >> (istream&cin,const complex_t& result) const\n{\n\tcout << \"Please enter real complex part:\" << endl;\n\tcin >> result.a;\n\tcout << \"Please enter imaginary complex part:\" << endl;\n\tcin >> result.b;\n\tcout << endl;\n\treturn cin;\n}\n\nostream& operator << (ostream&cout,const complex_t& result) \n{\n\tif (result.b < 0)\n\t{\n\t\tcout << result.a << result.b << \"i\" << endl;\n\t}\n\telse\n\t\tcout << result.a << \"+\" << result.b << \"i\" << endl;\n\treturn cout;\n}\ncomplex_t complex_t::operator * (const complex_t& c2) const\n{\n\treturn complex_t(a*c2.a - b*c2.b, a*c2.b + c2.a*b);\n}\n\ncomplex_t complex_t::operator \/ (const complex_t& c2) const\n{\n\treturn complex_t((a*c2.a + b*c2.b) \/ (c2.a*c2.a + c2.b*c2.b), (c2.a*b - a*c2.b) \/ (c2.a*c2.a + c2.b*c2.b));\n}\n\ncomplex_t complex_t::operator += (const complex_t& c2) \n{\n\ta += c2.a;\n\tb += c2.b;\n\treturn *this;\n}\n\ncomplex_t complex_t::operator -= (const complex_t& c2) \n{\n\ta -= c2.a;\n\tb -= c2.b;\n\treturn *this;\n}\ncomplex_t complex_t::operator \/= (const complex_t& c2) \n{\n\tfloat a_ = (a*c2.a + b*c2.b) \/ (c2.a*c2.a + c2.b*c2.b);\n\tb = (c2.a*b - a*c2.b) \/ (c2.a*c2.a + c2.b*c2.b);\n\ta = a_;\n\treturn *this;\n}\n\ncomplex_t complex_t::operator *= (const complex_t& c2) \n{\n\tfloat a_ = a*c2.a - b*c2.b;\n\tb = a*c2.b + c2.a*b;\n\ta = a_;\n\treturn *this;\n}\n<commit_msg>Update сomplex_t.cpp<commit_after>#include \"сomplex_t.hpp\"\ncomplex_t::complex_t() : a(0.0), b(0.0)\n{}\ncomplex_t::complex_t(double x, double y) : a(x), b(y)\n{}\ncomplex_t::complex_t(const complex_t&cop)\n{\n\ta = cop.a;\n\tb = cop.b;\n}\ndouble complex_t::a_() const\n{\n\treturn a;\n}\n\ndouble complex_t::b_() const\n{\n\treturn b;\n}\nbool complex_t::operator == (const complex_t& c2) const\n{\n\tif ((a == c2.a) && (b == c2.b))\n\t\treturn true;\n}\n\ncomplex_t complex_t::operator = (const complex_t& result)\n{\n\tif (this != &result) \n\t{\n\ta = result.a;\n\tb = result.b;\n\treturn *this;\n\t}\n\n}\nistream& operator >> (istream&cin, complex_t& result) \n{\n\tcout << \"Please enter real complex part:\" << endl;\n\tcin >> result.a;\n\tcout << \"Please enter imaginary complex part:\" << endl;\n\tcin >> result.b;\n\tcout << endl;\n\treturn cin;\n}\n\nostream& operator << (ostream&cout,complex_t& result) \n{\n\tif (result.b < 0)\n\t{\n\t\tcout << result.a << result.b << \"i\" << endl;\n\t}\n\telse\n\t\tcout << result.a << \"+\" << result.b << \"i\" << endl;\n\treturn cout;\n}\ncomplex_t complex_t::operator * (const complex_t& c2) const\n{\n\treturn complex_t(a*c2.a - b*c2.b, a*c2.b + c2.a*b);\n}\n\ncomplex_t complex_t::operator \/ (const complex_t& c2) const\n{\n\treturn complex_t((a*c2.a + b*c2.b) \/ (c2.a*c2.a + c2.b*c2.b), (c2.a*b - a*c2.b) \/ (c2.a*c2.a + c2.b*c2.b));\n}\n\ncomplex_t complex_t::operator += (const complex_t& c2) \n{\n\ta += c2.a;\n\tb += c2.b;\n\treturn *this;\n}\n\ncomplex_t complex_t::operator -= (const complex_t& c2) \n{\n\ta -= c2.a;\n\tb -= c2.b;\n\treturn *this;\n}\ncomplex_t complex_t::operator \/= (const complex_t& c2) \n{\n\tfloat a_ = (a*c2.a + b*c2.b) \/ (c2.a*c2.a + c2.b*c2.b);\n\tb = (c2.a*b - a*c2.b) \/ (c2.a*c2.a + c2.b*c2.b);\n\ta = a_;\n\treturn *this;\n}\n\ncomplex_t complex_t::operator *= (const complex_t& c2) \n{\n\tfloat a_ = a*c2.a - b*c2.b;\n\tb = a*c2.b + c2.a*b;\n\ta = a_;\n\treturn *this;\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\n#include <stdexcept>\n#include <nupic\/engine\/RegionImplFactory.hpp>\n#include <nupic\/engine\/RegionImpl.hpp>\n#include <nupic\/engine\/Region.hpp>\n#include <nupic\/engine\/RegisteredRegionImpl.hpp>\n#include <nupic\/engine\/Spec.hpp>\n#include <nupic\/os\/DynamicLibrary.hpp>\n#include <nupic\/os\/Path.hpp>\n#include <nupic\/os\/OS.hpp>\n#include <nupic\/os\/Env.hpp>\n#include <nupic\/ntypes\/Value.hpp>\n#include <nupic\/ntypes\/BundleIO.hpp>\n#include <nupic\/engine\/YAMLUtils.hpp>\n#include <nupic\/engine\/TestNode.hpp>\n#include <nupic\/regions\/VectorFileEffector.hpp>\n#include <nupic\/regions\/VectorFileSensor.hpp>\n#include <nupic\/utils\/Log.hpp>\n#include <nupic\/utils\/StringUtils.hpp>\n\n\/\/ from http:\/\/stackoverflow.com\/a\/9096509\/1781435\n#define stringify(x)  #x\n#define expand_and_stringify(x) stringify(x)\n\nnamespace nupic\n{\n  \/\/ Path from site-packages to packages that contain NuPIC Python regions\n  static std::map<const std::string, std::set<std::string>> pyRegions;\n\n  \/\/ Mappings for C++ regions\n  static std::map<const std::string, GenericRegisteredRegionImpl*> cppRegions;\n\n  bool initializedRegions = false;\n\n  \/\/ Allows the user to add custom regions\n  void RegionImplFactory::registerPyRegion(const std::string module, const std::string className)\n  {\n    \/\/ Module hasn't been added yet\n    if (pyRegions.find(module) == pyRegions.end())\n    {\n      pyRegions[module] = std::set<std::string>();\n    }\n        \n    pyRegions[module].insert(className);\n  }\n\n  void RegionImplFactory::registerCPPRegion(const std::string name, GenericRegisteredRegionImpl * wrapper)\n  {\n    cppRegions[name] = wrapper;\n  }\n\n  class DynamicPythonLibrary\n  {\n    typedef void (*initPythonFunc)();\n    typedef void (*finalizePythonFunc)();\n    typedef void * (*createSpecFunc)(const char *, void **, const char *);\n    typedef int (*destroySpecFunc)(const char *, const char *);\n    typedef void * (*createPyNodeFunc)(const char *, void *, void *, void **, const char *);\n    typedef void * (*deserializePyNodeFunc)(const char *, void *, void *, void *, const char *);\n  public:\n    DynamicPythonLibrary() :\n      initPython_(nullptr),\n      finalizePython_(nullptr),\n      createSpec_(nullptr),\n      destroySpec_(nullptr),\n      createPyNode_(nullptr)\n    {\n      \/\/ To find the pynode plugin we need the nupic\n      \/\/ installation directory.\n#if defined(NTA_OS_WINDOWS)\n      std::string command = \"python -c \\\"import sys;import os;import nupic;sys.stdout.write(os.path.abspath(os.path.join(nupic.__file__, \\\"\\\"..\/..\\\"\\\")))\\\"\";\n#else\n      std::string command = \"python -c 'import sys;import os;import nupic;sys.stdout.write(os.path.abspath(os.path.join(nupic.__file__, \\\"..\/..\\\")))'\";\n#endif\n      rootDir_ = OS::executeCommand(command);\n      if (!Path::exists(rootDir_))\n        NTA_THROW << \"Unable to find NuPIC library in '\" << rootDir_ << \"'\";\n      \n      \n#if defined(NTA_OS_WINDOWS)\n      const char * filename = \"cpp_region.dll\";\n#else\n      const char * filename = \"libcpp_region.so\";\n#endif\n\n      std::string libName = Path::join(rootDir_, \"nupic\", filename);\n\n      if (!Path::exists(libName))\n        NTA_THROW << \"Unable to find library '\" << libName << \"'\";\n\n      std::string errorString;\n      DynamicLibrary * p = \n        DynamicLibrary::load(libName, \n                             \/\/ export as LOCAL because we don't want\n                             \/\/ the symbols to be globally visible; \n                             \/\/ But the python module that we load\n                             \/\/ has to be able to access symbols from\n                             \/\/ libpython.so; Since libpython.so is linked\n                             \/\/ to the pynode shared library, it appears\n                             \/\/ we have to make the pynode shared library\n                             \/\/ symbols global. TODO: investigate\n                             DynamicLibrary::GLOBAL| \n                             \/\/ Evaluate them NOW instead of LAZY to catch \n                             \/\/ errors up front, even though this takes\n                             \/\/ a little longer to load the library. \n                             \/\/ However -- the current dependency chain\n                             \/\/ PyNode->Region->RegionImplFactory apparently\n                             \/\/ creates never-used dependencies on YAML\n                             \/\/ so until this is resolved use LAZY\n                             DynamicLibrary::LAZY,\n                             errorString);\n      NTA_CHECK(p) << \"Unable to load the pynode library: \" << errorString;\n\n      pynodeLibrary_ = boost::shared_ptr<DynamicLibrary>(p);\n\n      initPython_ = (initPythonFunc)pynodeLibrary_->getSymbol(\"NTA_initPython\");\n      NTA_CHECK(initPython_) << \"Unable to find NTA_initPython symbol in \" << filename;\n\n      finalizePython_ = (finalizePythonFunc)pynodeLibrary_->getSymbol(\"NTA_finalizePython\");\n      NTA_CHECK(finalizePython_) << \"Unable to find NTA_finalizePython symbol in \" << filename;\n\n      createPyNode_ = (createPyNodeFunc)pynodeLibrary_->getSymbol(\"NTA_createPyNode\");\n      NTA_CHECK(createPyNode_) << \"Unable to find NTA_createPyNode symbol in \" << filename;\n\n      deserializePyNode_ = (deserializePyNodeFunc)pynodeLibrary_->getSymbol(\"NTA_deserializePyNode\");\n      NTA_CHECK(createPyNode_) << \"Unable to find NTA_createPyNode symbol in \" << filename;\n\n      createSpec_ = (createSpecFunc)pynodeLibrary_->getSymbol(\"NTA_createSpec\");\n      NTA_CHECK(createSpec_) << \"Unable to find NTA_createSpec symbol in \" << filename;\n\n      destroySpec_ = (destroySpecFunc)pynodeLibrary_->getSymbol(\"NTA_destroySpec\");\n      NTA_CHECK(destroySpec_) << \"Unable to find NTA_destroySpec symbol in \" << filename;\n\n      (*initPython_)();\n    }\n\n    ~DynamicPythonLibrary()\n    {\n      \/\/NTA_DEBUG << \"In DynamicPythonLibrary Destructor\";\n      if (finalizePython_)\n        finalizePython_();\n    } \n\n    void * createSpec(std::string nodeType, void ** exception, std::string className)\n    {\n      \/\/NTA_DEBUG << \"RegionImplFactory::createSpec(\" << nodeType << \")\";\n      return (*createSpec_)(nodeType.c_str(), exception, className.c_str());\n    }\n\n    int destroySpec(std::string nodeType, std::string& className)\n    {\n      NTA_INFO << \"destroySpec(\" << nodeType << \")\";\n      return (*destroySpec_)(nodeType.c_str(), className.c_str());\n    }\n\n    void * createPyNode(const std::string& nodeType, \n                        ValueMap * nodeParams,\n                        Region * region,\n                        void ** exception,\n                        const std::string& className)\n    {\n      \/\/NTA_DEBUG << \"RegionImplFactory::createPyNode(\" << nodeType << \")\";\n      return (*createPyNode_)(nodeType.c_str(),\n                              reinterpret_cast<void *>(nodeParams),\n                              reinterpret_cast<void*>(region),\n                              exception,\n                              className.c_str());\n\n    }\n\n    void * deserializePyNode(const std::string& nodeType, \n                             BundleIO* bundle,\n                             Region * region, \n                             void ** exception,\n                             const std::string& className)\n    {\n      \/\/NTA_DEBUG << \"RegionImplFactory::deserializePyNode(\" << nodeType << \")\";\n      return (*deserializePyNode_)(nodeType.c_str(), \n                                   reinterpret_cast<void*>(bundle),\n                                   reinterpret_cast<void*>(region), \n                                   exception,\n                                   className.c_str());\n    }\n\n    const std::string& getRootDir() const\n    {\n      return rootDir_;\n    }\n\n  private:\n    std::string rootDir_;\n    boost::shared_ptr<DynamicLibrary> pynodeLibrary_;\n    initPythonFunc initPython_;\n    finalizePythonFunc finalizePython_;\n    createSpecFunc createSpec_;\n    destroySpecFunc destroySpec_;\n    createPyNodeFunc createPyNode_;\n    deserializePyNodeFunc deserializePyNode_;\n  };\n\nRegionImplFactory & RegionImplFactory::getInstance()\n{\n  static RegionImplFactory instance;\n\n  \/\/ Initialize Regions\n  if (!initializedRegions)\n  {\n    \/\/ Create C++ regions\n    cppRegions[\"TestNode\"] = new RegisteredRegionImpl<TestNode>();\n    cppRegions[\"VectorFileEffector\"] = new RegisteredRegionImpl<VectorFileEffector>();\n    cppRegions[\"VectorFileSensor\"] = new RegisteredRegionImpl<VectorFileSensor>();\n\n    initializedRegions = true;\n  }\n\n  return instance;\n}\n\n\/\/ This function creates either a NuPIC 2 or NuPIC 1 Python node \nstatic RegionImpl * createPyNode(DynamicPythonLibrary * pyLib, \n                                 const std::string & nodeType,\n                                 ValueMap * nodeParams,\n                                 Region * region)\n{\n  std::string className(nodeType.c_str() + 3);\n  for (auto pyr=pyRegions.begin(); pyr!=pyRegions.end(); pyr++)\n  {\n    const std::string module = pyr->first;\n    std::set<std::string> classes = pyr->second;\n\n    \/\/ This module contains the class\n    if (classes.find(className) != classes.end())\n    {\n      void * exception = nullptr;\n      void * node = pyLib->createPyNode(module, nodeParams, region, &exception, className);\n      if (node)\n      {\n        return static_cast<RegionImpl*>(node);\n      }\n    }\n  }\n\n  NTA_THROW << \"Unable to create region \" << region->getName() << \" of type \" << className;\n  return nullptr;\n}\n\n\/\/ This function deserializes either a NuPIC 2 or NuPIC 1 Python node \nstatic RegionImpl * deserializePyNode(DynamicPythonLibrary * pyLib, \n                                      const std::string & nodeType,\n                                      BundleIO & bundle,\n                                      Region * region)\n{\n  std::string className(nodeType.c_str() + 3);\n  for (auto pyr=pyRegions.begin(); pyr!=pyRegions.end(); pyr++)\n  {\n    const std::string module = pyr->first;\n    std::set<std::string> classes = pyr->second;\n\n    \/\/ This module contains the class\n    if (classes.find(className) != classes.end())\n    {\n      void * exception = nullptr;\n      void * node = pyLib->deserializePyNode(module, &bundle, region, &exception, className);\n      if (node)\n      {\n        return static_cast<RegionImpl*>(node);\n      }\n    }\n  }\n\n  NTA_THROW << \"Unable to deserialize region \" << region->getName() << \" of type \" << className;\n  return nullptr;\n\n\n\n}\n\nRegionImpl* RegionImplFactory::createRegionImpl(const std::string nodeType, \n                                                const std::string nodeParams,\n                                                Region* region)\n{\n\n  RegionImpl *mn = nullptr;\n  Spec *ns = getSpec(nodeType);\n  ValueMap vm = YAMLUtils::toValueMap(\n    nodeParams.c_str(), \n    ns->parameters, \n    nodeType, \n    region->getName());\n    \n  if (cppRegions.find(nodeType) != cppRegions.end())\n  {\n    mn = cppRegions[nodeType]->createRegionImpl(vm, region);\n  }\n  else if ((nodeType.find(std::string(\"py.\")) == 0))\n  {\n    if (!pyLib_)\n      pyLib_ = boost::shared_ptr<DynamicPythonLibrary>(new DynamicPythonLibrary());\n    \n    mn = createPyNode(pyLib_.get(), nodeType, &vm, region);\n  } else\n  {\n    NTA_THROW << \"Unsupported node type '\" << nodeType << \"'\";\n  }\n\n  return mn;\n\n}\n\nRegionImpl* RegionImplFactory::deserializeRegionImpl(const std::string nodeType, \n                                                     BundleIO& bundle,\n                                                     Region* region)\n{\n\n  RegionImpl *mn = nullptr;\n\n  if (cppRegions.find(nodeType) != cppRegions.end())\n  {\n    mn = cppRegions[nodeType]->deserializeRegionImpl(bundle, region);\n  }\n  else if (StringUtils::startsWith(nodeType, \"py.\"))\n  {\n    if (!pyLib_)\n      pyLib_ = boost::shared_ptr<DynamicPythonLibrary>(new DynamicPythonLibrary());\n    \n    mn = deserializePyNode(pyLib_.get(), nodeType, bundle, region);\n  } else\n  {\n    NTA_THROW << \"Unsupported node type '\" << nodeType << \"'\";\n  }\n  return mn;\n\n}\n\n\/\/ This function returns the node spec of a NuPIC 2 or NuPIC 1 Python node \nstatic Spec * getPySpec(DynamicPythonLibrary * pyLib,\n                                const std::string & nodeType)\n{\n  std::string className(nodeType.c_str() + 3);\n  for (auto pyr=pyRegions.begin(); pyr!=pyRegions.end(); pyr++)\n  {\n    const std::string module = pyr->first;\n    std::set<std::string> classes = pyr->second;\n\n    \/\/ This module contains the class\n    if (classes.find(className) != classes.end())\n    {\n      void * exception = nullptr;\n      void * ns = pyLib->createSpec(module, &exception, className);\n      if (ns)\n      {\n        return (Spec *)ns;\n      }\n    }\n  }\n\n  NTA_THROW << \"Matching Python module for \" << className << \" not found.\";\n}\n\nSpec * RegionImplFactory::getSpec(const std::string nodeType)\n{\n  std::map<std::string, Spec*>::iterator it;\n  \/\/ return from cache if we already have it\n  it = nodespecCache_.find(nodeType);\n  if (it != nodespecCache_.end())\n    return it->second;\n\n  \/\/ grab the nodespec and cache it\n  \/\/ one entry per supported node type\n  Spec * ns = nullptr;\n  if (cppRegions.find(nodeType) != cppRegions.end())\n  {\n    ns = cppRegions[nodeType]->createSpec();\n  }\n  else if (nodeType.find(std::string(\"py.\")) == 0)\n  {\n    if (!pyLib_)\n      pyLib_ = boost::shared_ptr<DynamicPythonLibrary>(new DynamicPythonLibrary());\n\n    ns = getPySpec(pyLib_.get(), nodeType);\n  } \n  else \n  {\n    NTA_THROW << \"getSpec() -- Unsupported node type '\" << nodeType << \"'\";\n  }\n\n  if (!ns)\n    NTA_THROW << \"Unable to get node spec for: \" << nodeType;\n\n  nodespecCache_[nodeType] = ns;\n  return ns;\n}\n    \nvoid RegionImplFactory::cleanup()\n{\n  std::map<std::string, Spec*>::iterator ns;\n  \/\/ destroy all nodespecs\n  for (ns = nodespecCache_.begin(); ns != nodespecCache_.end(); ns++)\n  {\n    assert(ns->second != nullptr);\n    \/\/ PyNode node specs are destroyed by the C++ PyNode\n    if (ns->first.substr(0, 3) == \"py.\")\n    {\n      std::string noClass = \"\";\n      pyLib_->destroySpec(ns->first, noClass);\n    }\n    else\n    {\n      delete ns->second;\n    }\n\n    ns->second = nullptr;\n  }\n\n  nodespecCache_.clear();\n\n  \/\/ destroy all RegisteredRegionImpls\n  for (auto rri = cppRegions.begin(); rri != cppRegions.end(); rri++)\n  {\n    NTA_ASSERT(rri->second != nullptr);\n    delete rri->second;\n    rri->second = nullptr;\n  }\n\n  cppRegions.clear();\n  initializedRegions = false;\n\n  \/\/ Never release the Python dynamic library!\n  \/\/ This is due to cleanup issues of Python itself\n  \/\/ See: http:\/\/docs.python.org\/c-api\/init.html#Py_Finalize\n  \/\/pyLib_.reset();\n}\n\n}\n\n<commit_msg>moved python regions back to nupic.core<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\n#include <stdexcept>\n#include <nupic\/engine\/RegionImplFactory.hpp>\n#include <nupic\/engine\/RegionImpl.hpp>\n#include <nupic\/engine\/Region.hpp>\n#include <nupic\/engine\/RegisteredRegionImpl.hpp>\n#include <nupic\/engine\/Spec.hpp>\n#include <nupic\/os\/DynamicLibrary.hpp>\n#include <nupic\/os\/Path.hpp>\n#include <nupic\/os\/OS.hpp>\n#include <nupic\/os\/Env.hpp>\n#include <nupic\/ntypes\/Value.hpp>\n#include <nupic\/ntypes\/BundleIO.hpp>\n#include <nupic\/engine\/YAMLUtils.hpp>\n#include <nupic\/engine\/TestNode.hpp>\n#include <nupic\/regions\/VectorFileEffector.hpp>\n#include <nupic\/regions\/VectorFileSensor.hpp>\n#include <nupic\/utils\/Log.hpp>\n#include <nupic\/utils\/StringUtils.hpp>\n\n\/\/ from http:\/\/stackoverflow.com\/a\/9096509\/1781435\n#define stringify(x)  #x\n#define expand_and_stringify(x) stringify(x)\n\nnamespace nupic\n{\n  \/\/ Path from site-packages to packages that contain NuPIC Python regions\n  static std::map<const std::string, std::set<std::string>> pyRegions;\n\n  \/\/ Mappings for C++ regions\n  static std::map<const std::string, GenericRegisteredRegionImpl*> cppRegions;\n\n  bool initializedRegions = false;\n\n  \/\/ Allows the user to add custom regions\n  void RegionImplFactory::registerPyRegion(const std::string module, const std::string className)\n  {\n    \/\/ Module hasn't been added yet\n    if (pyRegions.find(module) == pyRegions.end())\n    {\n      pyRegions[module] = std::set<std::string>();\n    }\n        \n    pyRegions[module].insert(className);\n  }\n\n  void RegionImplFactory::registerCPPRegion(const std::string name, GenericRegisteredRegionImpl * wrapper)\n  {\n    cppRegions[name] = wrapper;\n  }\n\n  class DynamicPythonLibrary\n  {\n    typedef void (*initPythonFunc)();\n    typedef void (*finalizePythonFunc)();\n    typedef void * (*createSpecFunc)(const char *, void **, const char *);\n    typedef int (*destroySpecFunc)(const char *, const char *);\n    typedef void * (*createPyNodeFunc)(const char *, void *, void *, void **, const char *);\n    typedef void * (*deserializePyNodeFunc)(const char *, void *, void *, void *, const char *);\n  public:\n    DynamicPythonLibrary() :\n      initPython_(nullptr),\n      finalizePython_(nullptr),\n      createSpec_(nullptr),\n      destroySpec_(nullptr),\n      createPyNode_(nullptr)\n    {\n      \/\/ To find the pynode plugin we need the nupic\n      \/\/ installation directory.\n#if defined(NTA_OS_WINDOWS)\n      std::string command = \"python -c \\\"import sys;import os;import nupic;sys.stdout.write(os.path.abspath(os.path.join(nupic.__file__, \\\"\\\"..\/..\\\"\\\")))\\\"\";\n#else\n      std::string command = \"python -c 'import sys;import os;import nupic;sys.stdout.write(os.path.abspath(os.path.join(nupic.__file__, \\\"..\/..\\\")))'\";\n#endif\n      rootDir_ = OS::executeCommand(command);\n      if (!Path::exists(rootDir_))\n        NTA_THROW << \"Unable to find NuPIC library in '\" << rootDir_ << \"'\";\n      \n      \n#if defined(NTA_OS_WINDOWS)\n      const char * filename = \"cpp_region.dll\";\n#else\n      const char * filename = \"libcpp_region.so\";\n#endif\n\n      std::string libName = Path::join(rootDir_, \"nupic\", filename);\n\n      if (!Path::exists(libName))\n        NTA_THROW << \"Unable to find library '\" << libName << \"'\";\n\n      std::string errorString;\n      DynamicLibrary * p = \n        DynamicLibrary::load(libName, \n                             \/\/ export as LOCAL because we don't want\n                             \/\/ the symbols to be globally visible; \n                             \/\/ But the python module that we load\n                             \/\/ has to be able to access symbols from\n                             \/\/ libpython.so; Since libpython.so is linked\n                             \/\/ to the pynode shared library, it appears\n                             \/\/ we have to make the pynode shared library\n                             \/\/ symbols global. TODO: investigate\n                             DynamicLibrary::GLOBAL| \n                             \/\/ Evaluate them NOW instead of LAZY to catch \n                             \/\/ errors up front, even though this takes\n                             \/\/ a little longer to load the library. \n                             \/\/ However -- the current dependency chain\n                             \/\/ PyNode->Region->RegionImplFactory apparently\n                             \/\/ creates never-used dependencies on YAML\n                             \/\/ so until this is resolved use LAZY\n                             DynamicLibrary::LAZY,\n                             errorString);\n      NTA_CHECK(p) << \"Unable to load the pynode library: \" << errorString;\n\n      pynodeLibrary_ = boost::shared_ptr<DynamicLibrary>(p);\n\n      initPython_ = (initPythonFunc)pynodeLibrary_->getSymbol(\"NTA_initPython\");\n      NTA_CHECK(initPython_) << \"Unable to find NTA_initPython symbol in \" << filename;\n\n      finalizePython_ = (finalizePythonFunc)pynodeLibrary_->getSymbol(\"NTA_finalizePython\");\n      NTA_CHECK(finalizePython_) << \"Unable to find NTA_finalizePython symbol in \" << filename;\n\n      createPyNode_ = (createPyNodeFunc)pynodeLibrary_->getSymbol(\"NTA_createPyNode\");\n      NTA_CHECK(createPyNode_) << \"Unable to find NTA_createPyNode symbol in \" << filename;\n\n      deserializePyNode_ = (deserializePyNodeFunc)pynodeLibrary_->getSymbol(\"NTA_deserializePyNode\");\n      NTA_CHECK(createPyNode_) << \"Unable to find NTA_createPyNode symbol in \" << filename;\n\n      createSpec_ = (createSpecFunc)pynodeLibrary_->getSymbol(\"NTA_createSpec\");\n      NTA_CHECK(createSpec_) << \"Unable to find NTA_createSpec symbol in \" << filename;\n\n      destroySpec_ = (destroySpecFunc)pynodeLibrary_->getSymbol(\"NTA_destroySpec\");\n      NTA_CHECK(destroySpec_) << \"Unable to find NTA_destroySpec symbol in \" << filename;\n\n      (*initPython_)();\n    }\n\n    ~DynamicPythonLibrary()\n    {\n      \/\/NTA_DEBUG << \"In DynamicPythonLibrary Destructor\";\n      if (finalizePython_)\n        finalizePython_();\n    } \n\n    void * createSpec(std::string nodeType, void ** exception, std::string className)\n    {\n      \/\/NTA_DEBUG << \"RegionImplFactory::createSpec(\" << nodeType << \")\";\n      return (*createSpec_)(nodeType.c_str(), exception, className.c_str());\n    }\n\n    int destroySpec(std::string nodeType, std::string& className)\n    {\n      NTA_INFO << \"destroySpec(\" << nodeType << \")\";\n      return (*destroySpec_)(nodeType.c_str(), className.c_str());\n    }\n\n    void * createPyNode(const std::string& nodeType, \n                        ValueMap * nodeParams,\n                        Region * region,\n                        void ** exception,\n                        const std::string& className)\n    {\n      \/\/NTA_DEBUG << \"RegionImplFactory::createPyNode(\" << nodeType << \")\";\n      return (*createPyNode_)(nodeType.c_str(),\n                              reinterpret_cast<void *>(nodeParams),\n                              reinterpret_cast<void*>(region),\n                              exception,\n                              className.c_str());\n\n    }\n\n    void * deserializePyNode(const std::string& nodeType, \n                             BundleIO* bundle,\n                             Region * region, \n                             void ** exception,\n                             const std::string& className)\n    {\n      \/\/NTA_DEBUG << \"RegionImplFactory::deserializePyNode(\" << nodeType << \")\";\n      return (*deserializePyNode_)(nodeType.c_str(), \n                                   reinterpret_cast<void*>(bundle),\n                                   reinterpret_cast<void*>(region), \n                                   exception,\n                                   className.c_str());\n    }\n\n    const std::string& getRootDir() const\n    {\n      return rootDir_;\n    }\n\n  private:\n    std::string rootDir_;\n    boost::shared_ptr<DynamicLibrary> pynodeLibrary_;\n    initPythonFunc initPython_;\n    finalizePythonFunc finalizePython_;\n    createSpecFunc createSpec_;\n    destroySpecFunc destroySpec_;\n    createPyNodeFunc createPyNode_;\n    deserializePyNodeFunc deserializePyNode_;\n  };\n\nRegionImplFactory & RegionImplFactory::getInstance()\n{\n  static RegionImplFactory instance;\n\n  \/\/ Initialize Regions\n  if (!initializedRegions)\n  {\n    \/\/ Create C++ regions\n    cppRegions[\"TestNode\"] = new RegisteredRegionImpl<TestNode>();\n    cppRegions[\"VectorFileEffector\"] = new RegisteredRegionImpl<VectorFileEffector>();\n    cppRegions[\"VectorFileSensor\"] = new RegisteredRegionImpl<VectorFileSensor>();\n\n    registerPyRegion(\"nupic.regions.AnomalyRegion\", \"AnomalyRegion\");\n    registerPyRegion(\"nupic.regions.CLAClassifierRegion\", \"CLAClassifierRegion\");\n    registerPyRegion(\"nupic.regions.ImageSensor\", \"ImageSensor\");\n    registerPyRegion(\"nupic.regions.KNNAnomalyClassifierRegion\", \"KNNAnomalyClassifierRegion\");\n    registerPyRegion(\"nupic.regions.KNNClassifierRegion\", \"KNNClassifierRegion\");\n    registerPyRegion(\"nupic.regions.PCANode\", \"PCANode\");\n    registerPyRegion(\"nupic.regions.PyRegion\", \"PyRegion\");\n    registerPyRegion(\"nupic.regions.RecordSensor\", \"RecordSensor\");\n    registerPyRegion(\"nupic.regions.SPRegion\", \"SPRegion\");\n    registerPyRegion(\"nupic.regions.SVMClassifierNode\", \"SVMClassifierNode\");\n    registerPyRegion(\"nupic.regions.TPRegion\", \"TPRegion\");\n    registerPyRegion(\"nupic.regions.TestNode\", \"TestNode\");\n    registerPyRegion(\"nupic.regions.TestRegion\", \"TestRegion\");\n    registerPyRegion(\"nupic.regions.UnimportableNode\", \"UnimportableNode\");\n    registerPyRegion(\"nupic.regions.extra.GaborNode2\", \"GaborNode2\");\n\n    initializedRegions = true;\n  }\n\n  return instance;\n}\n\n\/\/ This function creates either a NuPIC 2 or NuPIC 1 Python node \nstatic RegionImpl * createPyNode(DynamicPythonLibrary * pyLib, \n                                 const std::string & nodeType,\n                                 ValueMap * nodeParams,\n                                 Region * region)\n{\n  std::string className(nodeType.c_str() + 3);\n  for (auto pyr=pyRegions.begin(); pyr!=pyRegions.end(); pyr++)\n  {\n    const std::string module = pyr->first;\n    std::set<std::string> classes = pyr->second;\n\n    \/\/ This module contains the class\n    if (classes.find(className) != classes.end())\n    {\n      void * exception = nullptr;\n      void * node = pyLib->createPyNode(module, nodeParams, region, &exception, className);\n      if (node)\n      {\n        return static_cast<RegionImpl*>(node);\n      }\n    }\n  }\n\n  NTA_THROW << \"Unable to create region \" << region->getName() << \" of type \" << className;\n  return nullptr;\n}\n\n\/\/ This function deserializes either a NuPIC 2 or NuPIC 1 Python node \nstatic RegionImpl * deserializePyNode(DynamicPythonLibrary * pyLib, \n                                      const std::string & nodeType,\n                                      BundleIO & bundle,\n                                      Region * region)\n{\n  std::string className(nodeType.c_str() + 3);\n  for (auto pyr=pyRegions.begin(); pyr!=pyRegions.end(); pyr++)\n  {\n    const std::string module = pyr->first;\n    std::set<std::string> classes = pyr->second;\n\n    \/\/ This module contains the class\n    if (classes.find(className) != classes.end())\n    {\n      void * exception = nullptr;\n      void * node = pyLib->deserializePyNode(module, &bundle, region, &exception, className);\n      if (node)\n      {\n        return static_cast<RegionImpl*>(node);\n      }\n    }\n  }\n\n  NTA_THROW << \"Unable to deserialize region \" << region->getName() << \" of type \" << className;\n  return nullptr;\n\n\n\n}\n\nRegionImpl* RegionImplFactory::createRegionImpl(const std::string nodeType, \n                                                const std::string nodeParams,\n                                                Region* region)\n{\n\n  RegionImpl *mn = nullptr;\n  Spec *ns = getSpec(nodeType);\n  ValueMap vm = YAMLUtils::toValueMap(\n    nodeParams.c_str(), \n    ns->parameters, \n    nodeType, \n    region->getName());\n    \n  if (cppRegions.find(nodeType) != cppRegions.end())\n  {\n    mn = cppRegions[nodeType]->createRegionImpl(vm, region);\n  }\n  else if ((nodeType.find(std::string(\"py.\")) == 0))\n  {\n    if (!pyLib_)\n      pyLib_ = boost::shared_ptr<DynamicPythonLibrary>(new DynamicPythonLibrary());\n    \n    mn = createPyNode(pyLib_.get(), nodeType, &vm, region);\n  } else\n  {\n    NTA_THROW << \"Unsupported node type '\" << nodeType << \"'\";\n  }\n\n  return mn;\n\n}\n\nRegionImpl* RegionImplFactory::deserializeRegionImpl(const std::string nodeType, \n                                                     BundleIO& bundle,\n                                                     Region* region)\n{\n\n  RegionImpl *mn = nullptr;\n\n  if (cppRegions.find(nodeType) != cppRegions.end())\n  {\n    mn = cppRegions[nodeType]->deserializeRegionImpl(bundle, region);\n  }\n  else if (StringUtils::startsWith(nodeType, \"py.\"))\n  {\n    if (!pyLib_)\n      pyLib_ = boost::shared_ptr<DynamicPythonLibrary>(new DynamicPythonLibrary());\n    \n    mn = deserializePyNode(pyLib_.get(), nodeType, bundle, region);\n  } else\n  {\n    NTA_THROW << \"Unsupported node type '\" << nodeType << \"'\";\n  }\n  return mn;\n\n}\n\n\/\/ This function returns the node spec of a NuPIC 2 or NuPIC 1 Python node \nstatic Spec * getPySpec(DynamicPythonLibrary * pyLib,\n                                const std::string & nodeType)\n{\n  std::string className(nodeType.c_str() + 3);\n  for (auto pyr=pyRegions.begin(); pyr!=pyRegions.end(); pyr++)\n  {\n    const std::string module = pyr->first;\n    std::set<std::string> classes = pyr->second;\n\n    \/\/ This module contains the class\n    if (classes.find(className) != classes.end())\n    {\n      void * exception = nullptr;\n      void * ns = pyLib->createSpec(module, &exception, className);\n      if (ns)\n      {\n        return (Spec *)ns;\n      }\n    }\n  }\n\n  NTA_THROW << \"Matching Python module for \" << className << \" not found.\";\n}\n\nSpec * RegionImplFactory::getSpec(const std::string nodeType)\n{\n  std::map<std::string, Spec*>::iterator it;\n  \/\/ return from cache if we already have it\n  it = nodespecCache_.find(nodeType);\n  if (it != nodespecCache_.end())\n    return it->second;\n\n  \/\/ grab the nodespec and cache it\n  \/\/ one entry per supported node type\n  Spec * ns = nullptr;\n  if (cppRegions.find(nodeType) != cppRegions.end())\n  {\n    ns = cppRegions[nodeType]->createSpec();\n  }\n  else if (nodeType.find(std::string(\"py.\")) == 0)\n  {\n    if (!pyLib_)\n      pyLib_ = boost::shared_ptr<DynamicPythonLibrary>(new DynamicPythonLibrary());\n\n    ns = getPySpec(pyLib_.get(), nodeType);\n  } \n  else \n  {\n    NTA_THROW << \"getSpec() -- Unsupported node type '\" << nodeType << \"'\";\n  }\n\n  if (!ns)\n    NTA_THROW << \"Unable to get node spec for: \" << nodeType;\n\n  nodespecCache_[nodeType] = ns;\n  return ns;\n}\n    \nvoid RegionImplFactory::cleanup()\n{\n  std::map<std::string, Spec*>::iterator ns;\n  \/\/ destroy all nodespecs\n  for (ns = nodespecCache_.begin(); ns != nodespecCache_.end(); ns++)\n  {\n    assert(ns->second != nullptr);\n    \/\/ PyNode node specs are destroyed by the C++ PyNode\n    if (ns->first.substr(0, 3) == \"py.\")\n    {\n      std::string noClass = \"\";\n      pyLib_->destroySpec(ns->first, noClass);\n    }\n    else\n    {\n      delete ns->second;\n    }\n\n    ns->second = nullptr;\n  }\n\n  nodespecCache_.clear();\n\n  \/\/ destroy all RegisteredRegionImpls\n  for (auto rri = cppRegions.begin(); rri != cppRegions.end(); rri++)\n  {\n    NTA_ASSERT(rri->second != nullptr);\n    delete rri->second;\n    rri->second = nullptr;\n  }\n\n  cppRegions.clear();\n  initializedRegions = false;\n\n  \/\/ Never release the Python dynamic library!\n  \/\/ This is due to cleanup issues of Python itself\n  \/\/ See: http:\/\/docs.python.org\/c-api\/init.html#Py_Finalize\n  \/\/pyLib_.reset();\n}\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <catch2\/catch.hpp>\n#include <simdee\/simdee.hpp>\n#include <type_traits>\n\n#if SIMDEE_SSE2\n\nusing B = sd::sseb;\nconst B::storage_t dataAB{true, false, true, true};\nconst B::storage_t dataBB{false, true, false, true};\n\nusing U = sd::sseu;\nconst U::storage_t dataAU{1753029375U, 1117080442U, 3817141237U, 3761735248U};\nconst U::storage_t dataBU{1679702461U, 2102346647U, 480083363U, 3761735248U};\n\nusing not_B = sd::expr::deferred_lognot<B>;\nusing not_U = sd::expr::deferred_bitnot<U>;\n\nTEST_CASE(\"deferred_not types\", \"[deferred_not]\") {\n#if !defined(__clang__) && defined(__GNUC__) && __GNUC__ >= 6\n\/\/ GCC attempts to be helpful here by warning that some attributes of types such as __m128 are not\n\/\/ preserved when passsed as a template parameter.\n#pragma GCC diagnostic push\n#pragma GCC diagnostic ignored \"-Wignored-attributes\"\n#endif\n\n    REQUIRE((std::is_same<B::vector_t, not_B::vector_t>::value));\n    REQUIRE((std::is_same<B::scalar_t, not_B::scalar_t>::value));\n    REQUIRE((std::is_same<B::mask_t, not_B::mask_t>::value));\n    REQUIRE((std::is_same<B::storage_t, not_B::storage_t>::value));\n    REQUIRE((std::size_t(B::width) == not_B::width));\n\n    REQUIRE((std::is_same<U::vector_t, not_U::vector_t>::value));\n    REQUIRE((std::is_same<U::scalar_t, not_U::scalar_t>::value));\n    REQUIRE((std::is_same<U::mask_t, not_U::mask_t>::value));\n    REQUIRE((std::is_same<U::storage_t, not_U::storage_t>::value));\n    REQUIRE((std::size_t(U::width) == not_U::width));\n\n#if !defined(__clang__) && defined(__GNUC__) && __GNUC__ >= 6\n#pragma GCC diagnostic pop\n#endif\n}\n\nTEST_CASE(\"deferred_not cond\", \"[deferred_not]\") {\n    const B ba = !dataAB;\n    const B bb = !dataBB;\n    const not_B nba(dataAB);\n    const not_B nbb(dataBB);\n\n    auto expB = cond(ba, ba, bb);\n    REQUIRE(all(expB == cond(ba, ba, nbb)));\n    REQUIRE(all(expB == cond(ba, nba, bb)));\n    REQUIRE(all(expB == cond(ba, nba, nbb)));\n    REQUIRE(all(expB == cond(nba, ba, bb)));\n    REQUIRE(all(expB == cond(nba, ba, nbb)));\n    REQUIRE(all(expB == cond(nba, nba, bb)));\n    REQUIRE(all(expB == cond(nba, nba, nbb)));\n\n    const U ua = dataAU;\n    const U ub = dataBU;\n    auto expU = cond(ba, ua, ub);\n    REQUIRE(all(expU == cond(ba, ua, ub)));\n    REQUIRE(all(expU == cond(nba, ua, ub)));\n}\n\nTEST_CASE(\"deferred_not bool arithmetic\", \"[deferred_not]\") {\n    const B ba = !dataAB;\n    const not_B nba(dataAB);\n    SECTION(\"unary\") {\n        SECTION(\"log not\") {\n            REQUIRE(all((ba) == (nba)));\n            REQUIRE(all((!ba) == (!nba)));\n            REQUIRE(all((ba) == (!!nba)));\n            REQUIRE(all((!!ba) == nba));\n            REQUIRE(all((!!ba) == (!!nba)));\n            REQUIRE(all((!!!ba) == (!!!nba)));\n        }\n        SECTION(\"any, all\") {\n            const B zero = sd::zero();\n            const B allb = sd::all_bits();\n            const not_B nzero(B(!zero));\n            const not_B nallb(B(!allb));\n            REQUIRE(any(ba) == any(nba));\n            REQUIRE(all(ba) == all(nba));\n            REQUIRE(any(zero) == any(nzero));\n            REQUIRE(all(zero) == all(nzero));\n            REQUIRE(any(allb) == any(nallb));\n            REQUIRE(all(allb) == all(nallb));\n        }\n    }\n    SECTION(\"binary\") {\n        const B bb = !dataBB;\n        const not_B nbb(dataBB);\n        SECTION(\"log and\") {\n            B expect = ba && bb;\n            REQUIRE(all((ba && nbb) == expect));\n            REQUIRE(all((nba && bb) == expect));\n            REQUIRE(all((nba && nbb) == expect));\n        }\n        SECTION(\"log or\") {\n            B expect = ba || bb;\n            REQUIRE(all((ba || nbb) == expect));\n            REQUIRE(all((nba || bb) == expect));\n            REQUIRE(all((nba || nbb) == expect));\n        }\n    }\n}\n\nTEST_CASE(\"deferred_not uint arithmetic\", \"[deferred_not]\") {\n    const U ua = ~dataAU;\n    const not_U nua(dataAU);\n    SECTION(\"unary\") {\n        SECTION(\"bit not\") {\n            REQUIRE(all(ua == nua));\n            REQUIRE(all(~ua == ~nua));\n            REQUIRE(all(ua == ~~nua));\n            REQUIRE(all(~~ua == nua));\n            REQUIRE(all(~~ua == ~~nua));\n            REQUIRE(all(~~~ua == ~~~nua));\n        }\n    }\n    SECTION(\"binary\") {\n        const U ub = ~dataBU;\n        const not_U nub(dataBU);\n        SECTION(\"bit and\") {\n            U expect = ua & ub;\n            REQUIRE(all((ua & nub) == expect));\n            REQUIRE(all((nua & ub) == expect));\n            REQUIRE(all((nua & nub) == expect));\n        }\n        SECTION(\"bit or\") {\n            U expect = ua | ub;\n            REQUIRE(all((ua | nub) == expect));\n            REQUIRE(all((nua | ub) == expect));\n            REQUIRE(all((nua | nub) == expect));\n        }\n        SECTION(\"bit xor\") {\n            U expect = ua ^ ub;\n            REQUIRE(all((ua ^ nub) == expect));\n            REQUIRE(all((nua ^ ub) == expect));\n            REQUIRE(all((nua ^ nub) == expect));\n        }\n    }\n}\n\nTEST_CASE(\"deferred_not methods\", \"[deferred_not]\") {\n    const B ba = !dataAB;\n    const not_B nba(dataAB);\n    SECTION(\"eval\") {\n        auto res_ua = ba.eval();\n        auto res_nua = nba.eval();\n        REQUIRE((std::is_same<decltype(res_ua), decltype(res_nua)>::value));\n        REQUIRE(all(res_ua == res_nua));\n    }\n    SECTION(\"data\") { REQUIRE(all(B(ba.data()) == B(nba.data()))); }\n    SECTION(\"store\") {\n        SECTION(\"aligned\") {\n            B::storage_t res_ua{}, res_nua{};\n            ba.aligned_store(res_ua.data());\n            nba.aligned_store(res_nua.data());\n            REQUIRE((res_ua == res_nua));\n        }\n        SECTION(\"unaligned\") {\n            B::storage_t res_ua{}, res_nua{};\n            ba.unaligned_store(res_ua.data());\n            nba.unaligned_store(res_nua.data());\n            REQUIRE((res_ua == res_nua));\n        }\n        SECTION(\"interleaved\") {\n            B::storage_t res_ua[3]{}, res_nua[3]{};\n            ba.interleaved_store(res_ua[0].data(), 3);\n            nba.interleaved_store(res_nua[0].data(), 3);\n            REQUIRE((res_ua[0] == res_nua[0]));\n            REQUIRE((res_ua[1] == res_nua[1]));\n            REQUIRE((res_ua[2] == res_nua[2]));\n        }\n    }\n    SECTION(\"reduce\") {\n        auto res_ba = first_scalar(reduce(ba, [](B a, B b) { return a && b; }));\n        auto res_nba = first_scalar(reduce(nba, [](B a, B b) { return a && b; }));\n        REQUIRE(res_ba == res_nba);\n    }\n    SECTION(\"mask\") {\n        auto res_ba = mask(ba);\n        auto res_nba = mask(nba);\n        REQUIRE(res_ba == res_nba);\n    }\n    SECTION(\"first_scalar\") {\n        auto res_ba = first_scalar(ba);\n        auto res_nba = first_scalar(nba);\n        REQUIRE(res_ba == res_nba);\n    }\n}\n\n#endif\n<commit_msg>Improve coverage of deferred_bitnot methods<commit_after>#include <catch2\/catch.hpp>\n#include <simdee\/simdee.hpp>\n#include <type_traits>\n\n#if SIMDEE_SSE2\n\nusing B = sd::sseb;\nconst B::storage_t dataAB{true, false, true, true};\nconst B::storage_t dataBB{false, true, false, true};\n\nusing U = sd::sseu;\nconst U::storage_t dataAU{1753029375U, 1117080442U, 3817141237U, 3761735248U};\nconst U::storage_t dataBU{1679702461U, 2102346647U, 480083363U, 3761735248U};\n\nusing not_B = sd::expr::deferred_lognot<B>;\nusing not_U = sd::expr::deferred_bitnot<U>;\n\nTEST_CASE(\"deferred_not types\", \"[deferred_not]\") {\n#if !defined(__clang__) && defined(__GNUC__) && __GNUC__ >= 6\n\/\/ GCC attempts to be helpful here by warning that some attributes of types such as __m128 are not\n\/\/ preserved when passsed as a template parameter.\n#pragma GCC diagnostic push\n#pragma GCC diagnostic ignored \"-Wignored-attributes\"\n#endif\n\n    REQUIRE((std::is_same<B::vector_t, not_B::vector_t>::value));\n    REQUIRE((std::is_same<B::scalar_t, not_B::scalar_t>::value));\n    REQUIRE((std::is_same<B::mask_t, not_B::mask_t>::value));\n    REQUIRE((std::is_same<B::storage_t, not_B::storage_t>::value));\n    REQUIRE((std::size_t(B::width) == not_B::width));\n\n    REQUIRE((std::is_same<U::vector_t, not_U::vector_t>::value));\n    REQUIRE((std::is_same<U::scalar_t, not_U::scalar_t>::value));\n    REQUIRE((std::is_same<U::mask_t, not_U::mask_t>::value));\n    REQUIRE((std::is_same<U::storage_t, not_U::storage_t>::value));\n    REQUIRE((std::size_t(U::width) == not_U::width));\n\n#if !defined(__clang__) && defined(__GNUC__) && __GNUC__ >= 6\n#pragma GCC diagnostic pop\n#endif\n}\n\nTEST_CASE(\"deferred_lognot cond\", \"[deferred_not]\") {\n    const B ba = !dataAB;\n    const B bb = !dataBB;\n    const not_B nba(dataAB);\n    const not_B nbb(dataBB);\n\n    auto expB = cond(ba, ba, bb);\n    REQUIRE(all(expB == cond(ba, ba, nbb)));\n    REQUIRE(all(expB == cond(ba, nba, bb)));\n    REQUIRE(all(expB == cond(ba, nba, nbb)));\n    REQUIRE(all(expB == cond(nba, ba, bb)));\n    REQUIRE(all(expB == cond(nba, ba, nbb)));\n    REQUIRE(all(expB == cond(nba, nba, bb)));\n    REQUIRE(all(expB == cond(nba, nba, nbb)));\n\n    const U ua = dataAU;\n    const U ub = dataBU;\n    auto expU = cond(ba, ua, ub);\n    REQUIRE(all(expU == cond(ba, ua, ub)));\n    REQUIRE(all(expU == cond(nba, ua, ub)));\n}\n\nTEST_CASE(\"deferred_lognot bool arithmetic\", \"[deferred_not]\") {\n    const B ba = !dataAB;\n    const not_B nba(dataAB);\n    SECTION(\"unary\") {\n        SECTION(\"log not\") {\n            REQUIRE(all((ba) == (nba)));\n            REQUIRE(all((!ba) == (!nba)));\n            REQUIRE(all((ba) == (!!nba)));\n            REQUIRE(all((!!ba) == nba));\n            REQUIRE(all((!!ba) == (!!nba)));\n            REQUIRE(all((!!!ba) == (!!!nba)));\n        }\n        SECTION(\"any, all\") {\n            const B zero = sd::zero();\n            const B allb = sd::all_bits();\n            const not_B nzero(B(!zero));\n            const not_B nallb(B(!allb));\n            REQUIRE(any(ba) == any(nba));\n            REQUIRE(all(ba) == all(nba));\n            REQUIRE(any(zero) == any(nzero));\n            REQUIRE(all(zero) == all(nzero));\n            REQUIRE(any(allb) == any(nallb));\n            REQUIRE(all(allb) == all(nallb));\n        }\n    }\n    SECTION(\"binary\") {\n        const B bb = !dataBB;\n        const not_B nbb(dataBB);\n        SECTION(\"log and\") {\n            B expect = ba && bb;\n            REQUIRE(all((ba && nbb) == expect));\n            REQUIRE(all((nba && bb) == expect));\n            REQUIRE(all((nba && nbb) == expect));\n        }\n        SECTION(\"log or\") {\n            B expect = ba || bb;\n            REQUIRE(all((ba || nbb) == expect));\n            REQUIRE(all((nba || bb) == expect));\n            REQUIRE(all((nba || nbb) == expect));\n        }\n    }\n}\n\nTEST_CASE(\"deferred_bitnot uint arithmetic\", \"[deferred_not]\") {\n    const U ua = ~dataAU;\n    const not_U nua(dataAU);\n    SECTION(\"unary\") {\n        SECTION(\"bit not\") {\n            REQUIRE(all(ua == nua));\n            REQUIRE(all(~ua == ~nua));\n            REQUIRE(all(ua == ~~nua));\n            REQUIRE(all(~~ua == nua));\n            REQUIRE(all(~~ua == ~~nua));\n            REQUIRE(all(~~~ua == ~~~nua));\n        }\n    }\n    SECTION(\"binary\") {\n        const U ub = ~dataBU;\n        const not_U nub(dataBU);\n        SECTION(\"bit and\") {\n            U expect = ua & ub;\n            REQUIRE(all((ua & nub) == expect));\n            REQUIRE(all((nua & ub) == expect));\n            REQUIRE(all((nua & nub) == expect));\n        }\n        SECTION(\"bit or\") {\n            U expect = ua | ub;\n            REQUIRE(all((ua | nub) == expect));\n            REQUIRE(all((nua | ub) == expect));\n            REQUIRE(all((nua | nub) == expect));\n        }\n        SECTION(\"bit xor\") {\n            U expect = ua ^ ub;\n            REQUIRE(all((ua ^ nub) == expect));\n            REQUIRE(all((nua ^ ub) == expect));\n            REQUIRE(all((nua ^ nub) == expect));\n        }\n    }\n}\n\nTEST_CASE(\"deferred_lognot methods\", \"[deferred_not]\") {\n    const B ba = !dataAB;\n    const not_B nba(dataAB);\n    SECTION(\"eval\") {\n        auto res_ba = ba.eval();\n        auto res_nba = nba.eval();\n        REQUIRE((std::is_same<decltype(res_ba), decltype(res_nba)>::value));\n        REQUIRE(all(res_ba == res_nba));\n    }\n    SECTION(\"data\") { REQUIRE(all(B(ba.data()) == B(nba.data()))); }\n    SECTION(\"store\") {\n        SECTION(\"aligned\") {\n            B::storage_t res_ba{}, res_nba{};\n            ba.aligned_store(res_ba.data());\n            nba.aligned_store(res_nba.data());\n            REQUIRE((res_ba == res_nba));\n        }\n        SECTION(\"unaligned\") {\n            B::storage_t res_ba{}, res_nba{};\n            ba.unaligned_store(res_ba.data());\n            nba.unaligned_store(res_nba.data());\n            REQUIRE((res_ba == res_nba));\n        }\n        SECTION(\"interleaved\") {\n            B::storage_t res_ba[3]{}, res_nba[3]{};\n            ba.interleaved_store(res_ba[0].data(), 3);\n            nba.interleaved_store(res_nba[0].data(), 3);\n            REQUIRE((res_ba[0] == res_nba[0]));\n            REQUIRE((res_ba[1] == res_nba[1]));\n            REQUIRE((res_ba[2] == res_nba[2]));\n        }\n    }\n    SECTION(\"reduce\") {\n        auto res_ba = first_scalar(reduce(ba, [](B a, B b) { return a && b; }));\n        auto res_nba = first_scalar(reduce(nba, [](B a, B b) { return a && b; }));\n        REQUIRE(res_ba == res_nba);\n    }\n    SECTION(\"mask\") {\n        auto res_ba = mask(ba);\n        auto res_nba = mask(nba);\n        REQUIRE(res_ba == res_nba);\n    }\n    SECTION(\"first_scalar\") {\n        auto res_ba = first_scalar(ba);\n        auto res_nba = first_scalar(nba);\n        REQUIRE(res_ba == res_nba);\n    }\n}\n\nTEST_CASE(\"deferred_bitnot methods\", \"[deferred_not]\") {\n    const U ua = ~dataAU;\n    const not_U nua(dataAU);\n    SECTION(\"eval\") {\n        auto res_ua = ua.eval();\n        auto res_nua = nua.eval();\n        REQUIRE((std::is_same<decltype(res_ua), decltype(res_nua)>::value));\n        REQUIRE(all(res_ua == res_nua));\n    }\n    SECTION(\"data\") { REQUIRE(all(U(ua.data()) == U(nua.data()))); }\n    SECTION(\"store\") {\n        SECTION(\"aligned\") {\n            U::storage_t res_ua{}, res_nua{};\n            ua.aligned_store(res_ua.data());\n            nua.aligned_store(res_nua.data());\n            REQUIRE((res_ua == res_nua));\n        }\n        SECTION(\"unaligned\") {\n            U::storage_t res_ua{}, res_nua{};\n            ua.unaligned_store(res_ua.data());\n            nua.unaligned_store(res_nua.data());\n            REQUIRE((res_ua == res_nua));\n        }\n        SECTION(\"interleaved\") {\n            U::storage_t res_ua[3]{}, res_nua[3]{};\n            ua.interleaved_store(res_ua[0].data(), 3);\n            nua.interleaved_store(res_nua[0].data(), 3);\n            REQUIRE((res_ua[0] == res_nua[0]));\n            REQUIRE((res_ua[1] == res_nua[1]));\n            REQUIRE((res_ua[2] == res_nua[2]));\n        }\n    }\n    SECTION(\"reduce\") {\n        auto res_ua = first_scalar(reduce(ua, [](U a, U b) { return a ^ b; }));\n        auto res_nua = first_scalar(reduce(nua, [](U a, U b) { return a ^ b; }));\n        REQUIRE(res_ua == res_nua);\n    }\n    SECTION(\"first_scalar\") {\n        auto res_ua = first_scalar(ua);\n        auto res_nua = first_scalar(nua);\n        REQUIRE(res_ua == res_nua);\n    }\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include <algorithm>\n#include <fcntl.h>\n#include <linux\/fs.h>\n#include <stdio.h>\n#include <unistd.h>\n#include \"arch\/linux\/system_event\/eventfd.hpp\"\n#include <sys\/ioctl.h>\n#include <sys\/socket.h>\n#include <sys\/stat.h>\n#include \"arch\/linux\/arch.hpp\"\n#include \"config\/args.hpp\"\n#include \"utils2.hpp\"\n#include \"print_backtrace.hpp\"\n#include \"arch\/linux\/coroutines.hpp\"\n#include \"logger.hpp\"\n#include \"arch\/linux\/disk\/aio.hpp\"\n#include \"arch\/linux\/disk\/pool.hpp\"\n#include \"arch\/linux\/disk\/conflict_resolving.hpp\"\n#include \"arch\/linux\/disk\/stats.hpp\"\n#include \"arch\/linux\/disk\/accounting.hpp\"\n\n\/\/ #define DEBUG_DUMP_WRITES 1\n\nperfmon_duration_sampler_t\n    pm_io_disk_stack_reads(\"io_disk_stack_reads\", secs_to_ticks(1)),\n    pm_io_disk_stack_writes(\"io_disk_stack_writes\", secs_to_ticks(1));\n\nperfmon_duration_sampler_t\n    pm_io_disk_backend_reads(\"io_disk_backend_reads\", secs_to_ticks(1), false),\n    pm_io_disk_backend_writes(\"io_disk_backend_writes\", secs_to_ticks(1), false);\n\n\/* Disk manager object takes care of queueing operations, collecting statistics, preventing\nconflicts, and actually sending them to the disk. Defined as an abstract class so that different\nactual implementations can be swapped in at runtime. *\/\n\n\/\/ TODO: If two files are on the same disk, should they share part of the IO stack?\n\nstruct linux_disk_manager_t {\n    virtual ~linux_disk_manager_t() { }\n\n    virtual void *create_account(int priority, int outstanding_requests_limit) = 0;\n    virtual void destroy_account(void *account) = 0;\n\n    virtual void submit_write(fd_t fd, const void *buf, size_t count, size_t offset,\n        void *account, linux_iocallback_t *cb) = 0;\n    virtual void submit_read(fd_t fd, void *buf, size_t count, size_t offset,\n        void *account, linux_iocallback_t *cb) = 0;\n};\n\ntemplate<class backend_t>\nstruct linux_templated_disk_manager_t : public linux_disk_manager_t {\n\n    typedef stats_diskmgr_2_t<typename backend_t::action_t> backend_stats_t;\n    typedef accounting_diskmgr_t<typename backend_stats_t::action_t> accounter_t;\n    typedef conflict_resolving_diskmgr_t<typename accounter_t::action_t> conflict_resolver_t;\n    typedef stats_diskmgr_t<typename conflict_resolver_t::action_t> stack_stats_t;\n    struct action_t : public stack_stats_t::action_t {\n        linux_iocallback_t *cb;\n    };\n\n    \/* These fields describe the entire IO stack. At the top level, we allocate a new\n    action_t object for each operation and record its callback. Then it passes through\n    the conflict resolver, which enforces ordering constraints between IO operations by\n    holding back operations that must be run after other, currently-running, operations.\n    Then it goes to the account manager, which queues up running IO operations according\n    to which account they are part of. Finally the backend (which may be either AIO-based\n    or thread-pool-based) pops the IO operations from the queue.\n\n    At two points in the process--once as soon as it is submitted, and again right\n    as the backend pops it off the queue--its statistics are recorded. The \"stack stats\"\n    will tell you how many IO operations are queued. The \"backend stats\" will tell you\n    how long the OS takes to perform the operations. Note that it's not perfect, because\n    it counts operations that have been queued by the backend but not sent to the OS yet\n    as having been sent to the OS. *\/\n\n    stack_stats_t stack_stats;\n    conflict_resolver_t conflict_resolver;\n    accounter_t accounter;\n    backend_stats_t backend_stats;\n    backend_t backend;\n\n    linux_templated_disk_manager_t(linux_event_queue_t *queue) :\n        stack_stats(&pm_io_disk_stack_reads, &pm_io_disk_stack_writes),\n        conflict_resolver(),\n        accounter(),\n        backend_stats(&pm_io_disk_backend_reads, &pm_io_disk_backend_writes, accounter.producer),\n        backend(queue, backend_stats.producer)\n    {\n        \/* Hook up the `submit_fun`s of the parts of the IO stack that are above the\n        queue. (The parts below the queue use the `passive_producer_t` interface instead\n        of a callback function.) *\/\n        stack_stats.submit_fun = boost::bind(&conflict_resolver_t::submit, &conflict_resolver, _1);\n        conflict_resolver.submit_fun = boost::bind(&accounter_t::submit, &accounter, _1);\n\n        \/* Hook up everything's `done_fun`. *\/\n        backend.done_fun = boost::bind(&backend_stats_t::done, &backend_stats, _1);\n        backend_stats.done_fun = boost::bind(&accounter_t::done, &accounter, _1);\n        accounter.done_fun = boost::bind(&conflict_resolver_t::done, &conflict_resolver, _1);\n        conflict_resolver.done_fun = boost::bind(&stack_stats_t::done, &stack_stats, _1);\n        stack_stats.done_fun = boost::bind(&linux_templated_disk_manager_t<backend_t>::done, this, _1);\n    }\n\n    void *create_account(int pri, int outstanding_requests_limit) {\n        return reinterpret_cast<void*>(new typename accounter_t::account_t(&accounter, pri, outstanding_requests_limit));\n    }\n\n    void destroy_account(void *account) {\n        delete reinterpret_cast<typename accounter_t::account_t*>(account);\n    }\n\n    void submit_write(fd_t fd, const void *buf, size_t count, size_t offset, void *account, linux_iocallback_t *cb) {\n        action_t *a = new action_t;\n        a->make_write(fd, buf, count, offset);\n        a->account = reinterpret_cast<typename accounter_t::account_t*>(account);\n        a->cb = cb;\n        stack_stats.submit(a);\n    }\n\n    void submit_read(fd_t fd, void *buf, size_t count, size_t offset, void *account, linux_iocallback_t *cb) {\n        action_t *a = new action_t;\n        a->make_read(fd, buf, count, offset);\n        a->account = reinterpret_cast<typename accounter_t::account_t*>(account);\n        a->cb = cb;\n        stack_stats.submit(a);\n    };\n\n    void done(typename stack_stats_t::action_t *a) {\n        action_t *a2 = static_cast<action_t *>(a);\n        a2->cb->on_io_complete();\n        delete a2;\n    }\n};\n\n\/* Disk account object *\/\n\nlinux_file_t::account_t::account_t(linux_file_t *par, int pri, int outstanding_requests_limit) :\n    parent(par), account(parent->diskmgr->create_account(pri, outstanding_requests_limit))\n    { }\n\nlinux_file_t::account_t::~account_t() {\n    parent->diskmgr->destroy_account(account);\n}\n\n\/* Disk file object *\/\n\nlinux_file_t::linux_file_t(const char *path, int mode, bool is_really_direct, const linux_io_backend_t io_backend)\n    : fd(INVALID_FD), file_size(0)\n{\n    \/\/ Determine if it is a block device\n\n    struct stat64 file_stat;\n    bzero((void*)&file_stat, sizeof(file_stat)); \/\/ make valgrind happy\n    int res = stat64(path, &file_stat);\n    guarantee_err(res == 0 || errno == ENOENT, \"Could not stat file '%s'\", path);\n\n    if (res == -1 && errno == ENOENT) {\n        if (!(mode & mode_create)) {\n            file_exists = false;\n            return;\n        }\n        is_block = false;\n    } else {\n        is_block = S_ISBLK(file_stat.st_mode);\n    }\n\n    \/\/ Construct file flags\n\n    int flags = O_CREAT | (is_really_direct ? O_DIRECT : 0) | O_LARGEFILE;\n\n    if ((mode & mode_write) && (mode & mode_read)) flags |= O_RDWR;\n    else if (mode & mode_write) flags |= O_WRONLY;\n    else if (mode & mode_read) flags |= O_RDONLY;\n    else crash(\"Bad file access mode.\");\n\n\n    \/\/ O_NOATIME requires owner or root privileges. This is a bit of a hack; we assume that\n    \/\/ if we are opening a regular file, we are the owner, but if we are opening a block device,\n    \/\/ we are not.\n    if (!is_block) flags |= O_NOATIME;\n\n    \/\/ Open the file\n\n    fd.reset(open(path, flags, 0644));\n    if (fd.get() == INVALID_FD) {\n        fail_due_to_user_error(\n            \"Inaccessible database file: \\\"%s\\\": %s\"\n            \"\\nSome possible reasons:\"\n            \"%s\"    \/\/ for creation\/open error\n            \"%s\"    \/\/ for O_DIRECT message\n            \"%s\",   \/\/ for O_NOATIME message\n            path, strerror(errno),\n            is_block ?\n                \"\\n- the database device couldn't be opened for reading and writing\" :\n                \"\\n- the database file couldn't be created or opened for reading and writing\",\n            is_really_direct ?\n                (is_block ?\n                    \"\\n- the database block device cannot be opened with O_DIRECT flag\" :\n                    \"\\n- the database file is located on a filesystem that doesn't support O_DIRECT open flag (e.g. in case when the filesystem is working in journaled mode)\"\n                ) : \"\",\n            !is_block ? \"\\n- user which was used to start the database is not an owner of the file\" : \"\"\n        );\n    }\n\n    file_exists = true;\n\n    \/\/ Determine the file size\n\n    if (is_block) {\n        res = ioctl(fd.get(), BLKGETSIZE64, &file_size);\n        guarantee_err(res != -1, \"Could not determine block device size\");\n    } else {\n        off64_t size = lseek64(fd.get(), 0, SEEK_END);\n        guarantee_err(size != -1, \"Could not determine file size\");\n        res = lseek64(fd.get(), 0, SEEK_SET);\n        guarantee_err(res != -1, \"Could not reset file position\");\n\n        file_size = size;\n    }\n\n    \/\/ Construct a disk manager. (given that we have an event pool)\n    if (linux_thread_pool_t::thread) {\n        linux_event_queue_t *queue = &linux_thread_pool_t::thread->queue;\n        if (io_backend == aio_native) {\n            diskmgr.reset(new linux_templated_disk_manager_t<linux_diskmgr_aio_t>(queue));\n        } else {\n            diskmgr.reset(new linux_templated_disk_manager_t<pool_diskmgr_t>(queue));\n        }\n\n        default_account.reset(new account_t(this, 1, UNLIMITED_OUTSTANDING_REQUESTS));\n    }\n}\n\nbool linux_file_t::exists() {\n    return file_exists;\n}\n\nbool linux_file_t::is_block_device() {\n    return is_block;\n}\n\nsize_t linux_file_t::get_size() {\n    return file_size;\n}\n\nvoid linux_file_t::set_size(size_t size) {\n    rassert(!is_block);\n    int res = ftruncate(fd.get(), size);\n    guarantee_err(res == 0, \"Could not ftruncate()\");\n    file_size = size;\n}\n\nvoid linux_file_t::set_size_at_least(size_t size) {\n    if (is_block) {\n        rassert(file_size >= size);\n    } else {\n        \/* Grow in large chunks at a time *\/\n        if (file_size < size) {\n            \/\/ TODO: we should make the growth rate of a db file\n            \/\/ configurable.\n            set_size(ceil_aligned(size, DEVICE_BLOCK_SIZE * 128));\n        }\n    }\n}\n\nbool linux_file_t::read_async(size_t offset, size_t length, void *buf, account_t *account, linux_iocallback_t *callback) {\n    rassert(diskmgr, \"No diskmgr has been constructed (are we running without an event queue?)\");\n\n    verify(offset, length, buf);\n    diskmgr->submit_read(fd.get(), buf, length, offset,\n        account == DEFAULT_DISK_ACCOUNT ? default_account->account : account->account,\n        callback);\n\n    return false;\n}\n\nbool linux_file_t::write_async(size_t offset, size_t length, const void *buf, account_t *account, linux_iocallback_t *callback) {\n    rassert(diskmgr, \"No diskmgr has been constructed (are we running without an event queue?)\");\n\n#ifdef DEBUG_DUMP_WRITES\n    printf(\"--- WRITE BEGIN ---\\n\");\n    print_backtrace(stdout);\n    printf(\"\\n\");\n    print_hd(buf, offset, length);\n    printf(\"---- WRITE END ----\\n\\n\");\n#endif\n\n    verify(offset, length, buf);\n    diskmgr->submit_write(fd.get(), buf, length, offset,\n        account == DEFAULT_DISK_ACCOUNT ? default_account->account : account->account,\n        callback);\n\n    return false;\n}\n\nvoid linux_file_t::read_blocking(size_t offset, size_t length, void *buf) {\n    verify(offset, length, buf);\n tryagain:\n    ssize_t res = pread(fd.get(), buf, length, offset);\n    if (res == -1 && errno == EINTR) {\n        goto tryagain;\n    }\n    rassert(size_t(res) == length, \"Blocking read failed\");\n    (void)res;\n}\n\nvoid linux_file_t::write_blocking(size_t offset, size_t length, const void *buf) {\n    verify(offset, length, buf);\n tryagain:\n    ssize_t res = pwrite(fd.get(), buf, length, offset);\n    if (res == -1 && errno == EINTR) {\n        goto tryagain;\n    }\n    rassert(size_t(res) == length, \"Blocking write failed\");\n    (void)res;\n}\n\nlinux_file_t::~linux_file_t() {\n    \/\/ scoped_fd_t's destructor takes care of close()ing the file\n}\n\nvoid linux_file_t::verify(UNUSED size_t offset, UNUSED size_t length, UNUSED const void *buf) {\n    rassert(buf);\n    rassert(offset + length <= file_size);\n    rassert((intptr_t)buf % DEVICE_BLOCK_SIZE == 0);\n    rassert(offset % DEVICE_BLOCK_SIZE == 0);\n    rassert(length % DEVICE_BLOCK_SIZE == 0);\n}\n<commit_msg>Fsync() after ftruncate() to make sure metadata changes become durable.<commit_after>#include <algorithm>\n#include <fcntl.h>\n#include <linux\/fs.h>\n#include <stdio.h>\n#include <unistd.h>\n#include \"arch\/linux\/system_event\/eventfd.hpp\"\n#include <sys\/ioctl.h>\n#include <sys\/socket.h>\n#include <sys\/stat.h>\n#include \"arch\/linux\/arch.hpp\"\n#include \"config\/args.hpp\"\n#include \"utils2.hpp\"\n#include \"print_backtrace.hpp\"\n#include \"arch\/linux\/coroutines.hpp\"\n#include \"logger.hpp\"\n#include \"arch\/linux\/disk\/aio.hpp\"\n#include \"arch\/linux\/disk\/pool.hpp\"\n#include \"arch\/linux\/disk\/conflict_resolving.hpp\"\n#include \"arch\/linux\/disk\/stats.hpp\"\n#include \"arch\/linux\/disk\/accounting.hpp\"\n\n\/\/ #define DEBUG_DUMP_WRITES 1\n\nperfmon_duration_sampler_t\n    pm_io_disk_stack_reads(\"io_disk_stack_reads\", secs_to_ticks(1)),\n    pm_io_disk_stack_writes(\"io_disk_stack_writes\", secs_to_ticks(1));\n\nperfmon_duration_sampler_t\n    pm_io_disk_backend_reads(\"io_disk_backend_reads\", secs_to_ticks(1), false),\n    pm_io_disk_backend_writes(\"io_disk_backend_writes\", secs_to_ticks(1), false);\n\n\/* Disk manager object takes care of queueing operations, collecting statistics, preventing\nconflicts, and actually sending them to the disk. Defined as an abstract class so that different\nactual implementations can be swapped in at runtime. *\/\n\n\/\/ TODO: If two files are on the same disk, should they share part of the IO stack?\n\nstruct linux_disk_manager_t {\n    virtual ~linux_disk_manager_t() { }\n\n    virtual void *create_account(int priority, int outstanding_requests_limit) = 0;\n    virtual void destroy_account(void *account) = 0;\n\n    virtual void submit_write(fd_t fd, const void *buf, size_t count, size_t offset,\n        void *account, linux_iocallback_t *cb) = 0;\n    virtual void submit_read(fd_t fd, void *buf, size_t count, size_t offset,\n        void *account, linux_iocallback_t *cb) = 0;\n};\n\ntemplate<class backend_t>\nstruct linux_templated_disk_manager_t : public linux_disk_manager_t {\n\n    typedef stats_diskmgr_2_t<typename backend_t::action_t> backend_stats_t;\n    typedef accounting_diskmgr_t<typename backend_stats_t::action_t> accounter_t;\n    typedef conflict_resolving_diskmgr_t<typename accounter_t::action_t> conflict_resolver_t;\n    typedef stats_diskmgr_t<typename conflict_resolver_t::action_t> stack_stats_t;\n    struct action_t : public stack_stats_t::action_t {\n        linux_iocallback_t *cb;\n    };\n\n    \/* These fields describe the entire IO stack. At the top level, we allocate a new\n    action_t object for each operation and record its callback. Then it passes through\n    the conflict resolver, which enforces ordering constraints between IO operations by\n    holding back operations that must be run after other, currently-running, operations.\n    Then it goes to the account manager, which queues up running IO operations according\n    to which account they are part of. Finally the backend (which may be either AIO-based\n    or thread-pool-based) pops the IO operations from the queue.\n\n    At two points in the process--once as soon as it is submitted, and again right\n    as the backend pops it off the queue--its statistics are recorded. The \"stack stats\"\n    will tell you how many IO operations are queued. The \"backend stats\" will tell you\n    how long the OS takes to perform the operations. Note that it's not perfect, because\n    it counts operations that have been queued by the backend but not sent to the OS yet\n    as having been sent to the OS. *\/\n\n    stack_stats_t stack_stats;\n    conflict_resolver_t conflict_resolver;\n    accounter_t accounter;\n    backend_stats_t backend_stats;\n    backend_t backend;\n\n    linux_templated_disk_manager_t(linux_event_queue_t *queue) :\n        stack_stats(&pm_io_disk_stack_reads, &pm_io_disk_stack_writes),\n        conflict_resolver(),\n        accounter(),\n        backend_stats(&pm_io_disk_backend_reads, &pm_io_disk_backend_writes, accounter.producer),\n        backend(queue, backend_stats.producer)\n    {\n        \/* Hook up the `submit_fun`s of the parts of the IO stack that are above the\n        queue. (The parts below the queue use the `passive_producer_t` interface instead\n        of a callback function.) *\/\n        stack_stats.submit_fun = boost::bind(&conflict_resolver_t::submit, &conflict_resolver, _1);\n        conflict_resolver.submit_fun = boost::bind(&accounter_t::submit, &accounter, _1);\n\n        \/* Hook up everything's `done_fun`. *\/\n        backend.done_fun = boost::bind(&backend_stats_t::done, &backend_stats, _1);\n        backend_stats.done_fun = boost::bind(&accounter_t::done, &accounter, _1);\n        accounter.done_fun = boost::bind(&conflict_resolver_t::done, &conflict_resolver, _1);\n        conflict_resolver.done_fun = boost::bind(&stack_stats_t::done, &stack_stats, _1);\n        stack_stats.done_fun = boost::bind(&linux_templated_disk_manager_t<backend_t>::done, this, _1);\n    }\n\n    void *create_account(int pri, int outstanding_requests_limit) {\n        return reinterpret_cast<void*>(new typename accounter_t::account_t(&accounter, pri, outstanding_requests_limit));\n    }\n\n    void destroy_account(void *account) {\n        delete reinterpret_cast<typename accounter_t::account_t*>(account);\n    }\n\n    void submit_write(fd_t fd, const void *buf, size_t count, size_t offset, void *account, linux_iocallback_t *cb) {\n        action_t *a = new action_t;\n        a->make_write(fd, buf, count, offset);\n        a->account = reinterpret_cast<typename accounter_t::account_t*>(account);\n        a->cb = cb;\n        stack_stats.submit(a);\n    }\n\n    void submit_read(fd_t fd, void *buf, size_t count, size_t offset, void *account, linux_iocallback_t *cb) {\n        action_t *a = new action_t;\n        a->make_read(fd, buf, count, offset);\n        a->account = reinterpret_cast<typename accounter_t::account_t*>(account);\n        a->cb = cb;\n        stack_stats.submit(a);\n    };\n\n    void done(typename stack_stats_t::action_t *a) {\n        action_t *a2 = static_cast<action_t *>(a);\n        a2->cb->on_io_complete();\n        delete a2;\n    }\n};\n\n\/* Disk account object *\/\n\nlinux_file_t::account_t::account_t(linux_file_t *par, int pri, int outstanding_requests_limit) :\n    parent(par), account(parent->diskmgr->create_account(pri, outstanding_requests_limit))\n    { }\n\nlinux_file_t::account_t::~account_t() {\n    parent->diskmgr->destroy_account(account);\n}\n\n\/* Disk file object *\/\n\nlinux_file_t::linux_file_t(const char *path, int mode, bool is_really_direct, const linux_io_backend_t io_backend)\n    : fd(INVALID_FD), file_size(0)\n{\n    \/\/ Determine if it is a block device\n\n    struct stat64 file_stat;\n    bzero((void*)&file_stat, sizeof(file_stat)); \/\/ make valgrind happy\n    int res = stat64(path, &file_stat);\n    guarantee_err(res == 0 || errno == ENOENT, \"Could not stat file '%s'\", path);\n\n    if (res == -1 && errno == ENOENT) {\n        if (!(mode & mode_create)) {\n            file_exists = false;\n            return;\n        }\n        is_block = false;\n    } else {\n        is_block = S_ISBLK(file_stat.st_mode);\n    }\n\n    \/\/ Construct file flags\n\n    int flags = O_CREAT | (is_really_direct ? O_DIRECT : 0) | O_LARGEFILE;\n\n    if ((mode & mode_write) && (mode & mode_read)) flags |= O_RDWR;\n    else if (mode & mode_write) flags |= O_WRONLY;\n    else if (mode & mode_read) flags |= O_RDONLY;\n    else crash(\"Bad file access mode.\");\n\n\n    \/\/ O_NOATIME requires owner or root privileges. This is a bit of a hack; we assume that\n    \/\/ if we are opening a regular file, we are the owner, but if we are opening a block device,\n    \/\/ we are not.\n    if (!is_block) flags |= O_NOATIME;\n\n    \/\/ Open the file\n\n    fd.reset(open(path, flags, 0644));\n    if (fd.get() == INVALID_FD) {\n        fail_due_to_user_error(\n            \"Inaccessible database file: \\\"%s\\\": %s\"\n            \"\\nSome possible reasons:\"\n            \"%s\"    \/\/ for creation\/open error\n            \"%s\"    \/\/ for O_DIRECT message\n            \"%s\",   \/\/ for O_NOATIME message\n            path, strerror(errno),\n            is_block ?\n                \"\\n- the database device couldn't be opened for reading and writing\" :\n                \"\\n- the database file couldn't be created or opened for reading and writing\",\n            is_really_direct ?\n                (is_block ?\n                    \"\\n- the database block device cannot be opened with O_DIRECT flag\" :\n                    \"\\n- the database file is located on a filesystem that doesn't support O_DIRECT open flag (e.g. in case when the filesystem is working in journaled mode)\"\n                ) : \"\",\n            !is_block ? \"\\n- user which was used to start the database is not an owner of the file\" : \"\"\n        );\n    }\n\n    file_exists = true;\n\n    \/\/ Determine the file size\n\n    if (is_block) {\n        res = ioctl(fd.get(), BLKGETSIZE64, &file_size);\n        guarantee_err(res != -1, \"Could not determine block device size\");\n    } else {\n        off64_t size = lseek64(fd.get(), 0, SEEK_END);\n        guarantee_err(size != -1, \"Could not determine file size\");\n        res = lseek64(fd.get(), 0, SEEK_SET);\n        guarantee_err(res != -1, \"Could not reset file position\");\n\n        file_size = size;\n    }\n\n    \/\/ TODO: We have a very minor correctness issue here, which is that\n    \/\/ we don't guarantee data durability for newly created database files.\n    \/\/ In theory, we would have to fsync() not only the file itself, but\n    \/\/ also the directory containing it. Otherwise the file might not\n    \/\/ survive a crash of the system. However, the window for data to get lost\n    \/\/ this way is just a few seconds after the creation of a new database,\n    \/\/ until the file system flushes the metadata to disk.\n\n    \/\/ Construct a disk manager. (given that we have an event pool)\n    if (linux_thread_pool_t::thread) {\n        linux_event_queue_t *queue = &linux_thread_pool_t::thread->queue;\n        if (io_backend == aio_native) {\n            diskmgr.reset(new linux_templated_disk_manager_t<linux_diskmgr_aio_t>(queue));\n        } else {\n            diskmgr.reset(new linux_templated_disk_manager_t<pool_diskmgr_t>(queue));\n        }\n\n        default_account.reset(new account_t(this, 1, UNLIMITED_OUTSTANDING_REQUESTS));\n    }\n}\n\nbool linux_file_t::exists() {\n    return file_exists;\n}\n\nbool linux_file_t::is_block_device() {\n    return is_block;\n}\n\nsize_t linux_file_t::get_size() {\n    return file_size;\n}\n\nvoid linux_file_t::set_size(size_t size) {\n    rassert(!is_block);\n    int res = ftruncate(fd.get(), size);\n    guarantee_err(res == 0, \"Could not ftruncate()\");\n    fsync(fd.get()); \/\/ Make sure that the metadata change gets persisted\n                     \/\/ before we start writing to the resized file.\n                     \/\/ (to be safe in case of system crashes etc.)\n    file_size = size;\n}\n\nvoid linux_file_t::set_size_at_least(size_t size) {\n    if (is_block) {\n        rassert(file_size >= size);\n    } else {\n        \/* Grow in large chunks at a time *\/\n        if (file_size < size) {\n            \/\/ TODO: we should make the growth rate of a db file\n            \/\/ configurable.\n            set_size(ceil_aligned(size, DEVICE_BLOCK_SIZE * 128));\n        }\n    }\n}\n\nbool linux_file_t::read_async(size_t offset, size_t length, void *buf, account_t *account, linux_iocallback_t *callback) {\n    rassert(diskmgr, \"No diskmgr has been constructed (are we running without an event queue?)\");\n\n    verify(offset, length, buf);\n    diskmgr->submit_read(fd.get(), buf, length, offset,\n        account == DEFAULT_DISK_ACCOUNT ? default_account->account : account->account,\n        callback);\n\n    return false;\n}\n\nbool linux_file_t::write_async(size_t offset, size_t length, const void *buf, account_t *account, linux_iocallback_t *callback) {\n    rassert(diskmgr, \"No diskmgr has been constructed (are we running without an event queue?)\");\n\n#ifdef DEBUG_DUMP_WRITES\n    printf(\"--- WRITE BEGIN ---\\n\");\n    print_backtrace(stdout);\n    printf(\"\\n\");\n    print_hd(buf, offset, length);\n    printf(\"---- WRITE END ----\\n\\n\");\n#endif\n\n    verify(offset, length, buf);\n    diskmgr->submit_write(fd.get(), buf, length, offset,\n        account == DEFAULT_DISK_ACCOUNT ? default_account->account : account->account,\n        callback);\n\n    return false;\n}\n\nvoid linux_file_t::read_blocking(size_t offset, size_t length, void *buf) {\n    verify(offset, length, buf);\n tryagain:\n    ssize_t res = pread(fd.get(), buf, length, offset);\n    if (res == -1 && errno == EINTR) {\n        goto tryagain;\n    }\n    rassert(size_t(res) == length, \"Blocking read failed\");\n    (void)res;\n}\n\nvoid linux_file_t::write_blocking(size_t offset, size_t length, const void *buf) {\n    verify(offset, length, buf);\n tryagain:\n    ssize_t res = pwrite(fd.get(), buf, length, offset);\n    if (res == -1 && errno == EINTR) {\n        goto tryagain;\n    }\n    rassert(size_t(res) == length, \"Blocking write failed\");\n    (void)res;\n}\n\nlinux_file_t::~linux_file_t() {\n    \/\/ scoped_fd_t's destructor takes care of close()ing the file\n}\n\nvoid linux_file_t::verify(UNUSED size_t offset, UNUSED size_t length, UNUSED const void *buf) {\n    rassert(buf);\n    rassert(offset + length <= file_size);\n    rassert((intptr_t)buf % DEVICE_BLOCK_SIZE == 0);\n    rassert(offset % DEVICE_BLOCK_SIZE == 0);\n    rassert(length % DEVICE_BLOCK_SIZE == 0);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2014 New Designs Unlimited, LLC\n * Opensource Automated License Plate Recognition [http:\/\/www.openalpr.com]\n *\n * This file is part of OpenAlpr.\n *\n * OpenAlpr is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License\n * version 3 as published by the Free Software Foundation\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include \"detectorcpu.h\"\n\nusing namespace cv;\nusing namespace std;\n\nnamespace alpr\n{\n\n  DetectorCPU::DetectorCPU(Config* config) : Detector(config) {\n\n\n\n    if( this->plate_cascade.load( config->getCascadeRuntimeDir() + config->country + \".xml\" ) )\n    {\n      this->loaded = true;\n    }\n    else\n    {\n      this->loaded = false;\n      printf(\"--(!)Error loading classifier\\n\");\n    }\n  }\n\n\n  DetectorCPU::~DetectorCPU() {\n  }\n\n  vector<PlateRegion> DetectorCPU::detect(Mat frame, std::vector<cv::Rect> regionsOfInterest)\n  {\n\n    Mat frame_gray;\n    cvtColor( frame, frame_gray, CV_BGR2GRAY );\n\n    vector<PlateRegion> detectedRegions = doCascade(frame_gray, regionsOfInterest);\n\n    return detectedRegions;\n  }\n\n  vector<PlateRegion> DetectorCPU::doCascade(Mat frame, std::vector<cv::Rect> regionsOfInterest)\n  {\n\n\n    if (frame.cols > config->maxDetectionInputWidth)\n    {\n      \/\/ The frame is too wide\n      this->scale_factor = ((float) config->maxDetectionInputWidth) \/ ((float) frame.cols);\n\n      if (config->debugGeneral)\n        std::cout << \"Input detection image is too wide.  Resizing with scale: \" << this->scale_factor << endl;\n    }\n    else if (frame.rows > config->maxDetectionInputHeight)\n    {\n      \/\/ The frame is too tall\n      this->scale_factor = ((float) config->maxDetectionInputHeight) \/ ((float) frame.rows);\n\n      if (config->debugGeneral)\n        std::cout << \"Input detection image is too tall.  Resizing with scale: \" << this->scale_factor << endl;\n    }\n\n    int w = frame.size().width;\n    int h = frame.size().height;\n\n    vector<Rect> plates;\n\n    equalizeHist( frame, frame );\n    resize(frame, frame, Size(w * this->scale_factor, h * this->scale_factor));\n\n    \/\/-- Detect plates\n    timespec startTime;\n    getTime(&startTime);\n\n    float maxWidth = ((float) w) * (config->maxPlateWidthPercent \/ 100.0f) * this->scale_factor;\n    float maxHeight = ((float) h) * (config->maxPlateHeightPercent \/ 100.0f) * this->scale_factor;\n    Size minSize(config->minPlateSizeWidthPx * this->scale_factor, config->minPlateSizeHeightPx * this->scale_factor);\n    Size maxSize(maxWidth, maxHeight);\n\n    plate_cascade.detectMultiScale( frame, plates, config->detection_iteration_increase, config->detectionStrictness,\n                                      0,\n                                      \/\/0|CV_HAAR_SCALE_IMAGE,\n                                      minSize, maxSize );\n\n\n    if (config->debugTiming)\n    {\n      timespec endTime;\n      getTime(&endTime);\n      cout << \"LBP Time: \" << diffclock(startTime, endTime) << \"ms.\" << endl;\n    }\n\n    for( unsigned int i = 0; i < plates.size(); i++ )\n    {\n      plates[i].x = plates[i].x \/ scale_factor;\n      plates[i].y = plates[i].y \/ scale_factor;\n      plates[i].width = plates[i].width \/ scale_factor;\n      plates[i].height = plates[i].height \/ scale_factor;\n    }\n\n    vector<PlateRegion> orderedRegions = aggregateRegions(plates);\n\n    return orderedRegions;\n\n  }\n  \n}<commit_msg>Added detector support for regionsofinterest<commit_after>\/*\n * Copyright (c) 2014 New Designs Unlimited, LLC\n * Opensource Automated License Plate Recognition [http:\/\/www.openalpr.com]\n *\n * This file is part of OpenAlpr.\n *\n * OpenAlpr is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License\n * version 3 as published by the Free Software Foundation\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include \"detectorcpu.h\"\n\nusing namespace cv;\nusing namespace std;\n\nnamespace alpr\n{\n\n\n  DetectorCPU::DetectorCPU(Config* config) : Detector(config) {\n\n\n\n    if( this->plate_cascade.load( config->getCascadeRuntimeDir() + config->country + \".xml\" ) )\n    {\n      this->loaded = true;\n    }\n    else\n    {\n      this->loaded = false;\n      printf(\"--(!)Error loading CPU classifier\\n\");\n    }\n  }\n\n\n  DetectorCPU::~DetectorCPU() {\n  }\n\n  vector<PlateRegion> DetectorCPU::detect(Mat frame, std::vector<cv::Rect> regionsOfInterest)\n  {\n\n    Mat frame_gray;\n    cvtColor( frame, frame_gray, CV_BGR2GRAY );\n\n    vector<PlateRegion> detectedRegions;\n    for (int i = 0; i < regionsOfInterest.size(); i++)\n    {\n      Mat cropped = frame_gray(regionsOfInterest[i]);\n      vector<PlateRegion> subRegions = doCascade(cropped, regionsOfInterest[i].x, regionsOfInterest[i].y);\n\n      for (int j = 0; j < subRegions.size(); j++)\n        detectedRegions.push_back(subRegions[j]);\n    }\n    return detectedRegions;\n  }\n\n  vector<PlateRegion> DetectorCPU::doCascade(Mat frame, int offset_x, int offset_y)\n  {\n\n\n    if (frame.cols > config->maxDetectionInputWidth)\n    {\n      \/\/ The frame is too wide\n      this->scale_factor = ((float) config->maxDetectionInputWidth) \/ ((float) frame.cols);\n\n      if (config->debugGeneral)\n        std::cout << \"Input detection image is too wide.  Resizing with scale: \" << this->scale_factor << endl;\n    }\n    else if (frame.rows > config->maxDetectionInputHeight)\n    {\n      \/\/ The frame is too tall\n      this->scale_factor = ((float) config->maxDetectionInputHeight) \/ ((float) frame.rows);\n\n      if (config->debugGeneral)\n        std::cout << \"Input detection image is too tall.  Resizing with scale: \" << this->scale_factor << endl;\n    }\n\n    int w = frame.size().width;\n    int h = frame.size().height;\n\n    vector<Rect> plates;\n\n    equalizeHist( frame, frame );\n    resize(frame, frame, Size(w * this->scale_factor, h * this->scale_factor));\n\n    \/\/-- Detect plates\n    timespec startTime;\n    getTime(&startTime);\n\n    float maxWidth = ((float) w) * (config->maxPlateWidthPercent \/ 100.0f) * this->scale_factor;\n    float maxHeight = ((float) h) * (config->maxPlateHeightPercent \/ 100.0f) * this->scale_factor;\n    Size minSize(config->minPlateSizeWidthPx * this->scale_factor, config->minPlateSizeHeightPx * this->scale_factor);\n    Size maxSize(maxWidth, maxHeight);\n\n    plate_cascade.detectMultiScale( frame, plates, config->detection_iteration_increase, config->detectionStrictness,\n                                      0,\n                                      \/\/0|CV_HAAR_SCALE_IMAGE,\n                                      minSize, maxSize );\n\n\n    if (config->debugTiming)\n    {\n      timespec endTime;\n      getTime(&endTime);\n      cout << \"LBP Time: \" << diffclock(startTime, endTime) << \"ms.\" << endl;\n    }\n\n    for( unsigned int i = 0; i < plates.size(); i++ )\n    {\n      plates[i].x = (plates[i].x \/ scale_factor) + offset_x;\n      plates[i].y = (plates[i].y \/ scale_factor) + offset_y;\n      plates[i].width = plates[i].width \/ scale_factor;\n      plates[i].height = plates[i].height \/ scale_factor;\n    }\n\n    vector<PlateRegion> orderedRegions = aggregateRegions(plates);\n\n    return orderedRegions;\n\n  }\n\n}<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n\n This file is part of the GLC-lib library.\n Copyright (C) 2005 Laurent Ribon (laumaya@users.sourceforge.net)\n Version 0.9, packaged on Novemeber, 2005.\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_material.cpp implementation of the GLC_Material class.\n\n#include <QtDebug>\n\n#include \"glc_material.h\"\n#include \"glc_collection.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Constructor Destructor\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nGLC_Material::GLC_Material(const char *pName ,const GLfloat *pAmbiantColor)\n:GLC_Object(pName)\n, m_fShininess(50.0)\t\t\/\/ Par dfaut, shininess 50\n, m_pTexture(NULL)\t\t\t\/\/ Pas de texture\n{\n\n\t\/\/ Initialisation de tableau contenant la couleur\n\tif (pAmbiantColor != 0)\n\t{\n\t\tm_fColAmbiente[0]= pAmbiantColor[0];\n\t\tm_fColAmbiente[1]= pAmbiantColor[1];\n\t\tm_fColAmbiente[2]= pAmbiantColor[2];\n\t\tm_fColAmbiente[3]= pAmbiantColor[3];\n\t}\n\telse\n\t{\t\/\/ By default light's color is dark grey.\n\t\tm_fColAmbiente[0]= 0.2f;\n\t\tm_fColAmbiente[1]= 0.2f;\n\t\tm_fColAmbiente[2]= 0.2f;\n\t\tm_fColAmbiente[3]= 1.0f;\n\t}\n\t\/\/ Les autres \n\t\/\/ Couleur diffuse\n\tm_fColDiffuse[0]= 1.0f;\n\tm_fColDiffuse[1]= 1.0f;\n\tm_fColDiffuse[2]= 1.0f;\n\tm_fColDiffuse[3]= 1.0f;\n\n\t\/\/ Couleur spculaire\n\tm_fColSpeculaire[0]= 1.0f;\n\tm_fColSpeculaire[1]= 1.0f;\n\tm_fColSpeculaire[2]= 1.0f;\n\tm_fColSpeculaire[3]= 1.0f;\n\n\t\/\/ Emission de lumire\n\tm_fColEmission[0]= 0.0f;\n\tm_fColEmission[1]= 0.0f;\n\tm_fColEmission[2]= 0.0f;\n\tm_fColEmission[3]= 1.0f;\n\n}\nGLC_Material::GLC_Material(GLC_Texture* pTexture, const char *pName)\n:GLC_Object(pName)\n, m_fShininess(50.0)\t\t\/\/ By default shininess 50\n, m_pTexture(pTexture)\t\t\t\/\/ Init texture\n{\n\t\/\/ Ambiente Color\n\tm_fColAmbiente[0]= 0.2f;\n\tm_fColAmbiente[1]= 0.2f;\n\tm_fColAmbiente[2]= 0.2f;\n\tm_fColAmbiente[3]= 1.0f;\n\n\t\/\/ Diffuse Color\n\tm_fColDiffuse[0]= 1.0f;\n\tm_fColDiffuse[1]= 1.0f;\n\tm_fColDiffuse[2]= 1.0f;\n\tm_fColDiffuse[3]= 1.0f;\n\n\t\/\/ Specular Color\n\tm_fColSpeculaire[0]= 1.0f;\n\tm_fColSpeculaire[1]= 1.0f;\n\tm_fColSpeculaire[2]= 1.0f;\n\tm_fColSpeculaire[3]= 1.0f;\n\n\t\/\/ Lighting emit\n\tm_fColEmission[0]= 0.0f;\n\tm_fColEmission[1]= 0.0f;\n\tm_fColEmission[2]= 0.0f;\n\tm_fColEmission[3]= 1.0f;\n\n}\n\nGLC_Material::~GLC_Material(void)\n{\n\n\t\/\/ Remove material from Geometries\n\tCGeomMap::iterator iEntry= m_WhereUsed.begin();\n\t\n    while (iEntry != m_WhereUsed.constEnd())\n    {\n        \/\/ Remove material from geometry\n        iEntry.value()->DelMaterial(iEntry.value());\n        ++iEntry;\n    }\n    \/\/ clear whereUSED Hash table\n    m_WhereUsed.clear();\n\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Get Functions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ Get Ambiant color\nvoid GLC_Material::GetColAmbiante(GLfloat* pfCol) const\t\/\/ pfCol[4]\n{\n\tpfCol[0]= m_fColAmbiente[0];\n\tpfCol[1]= m_fColAmbiente[1];\n\tpfCol[2]= m_fColAmbiente[2];\n\tpfCol[3]= m_fColAmbiente[3];\n}\n\n\/\/ Get diffuse color\nvoid GLC_Material::GetColDiffuse(GLfloat* pfCol) const\t\/\/ pfCol[4]\n{\n\tpfCol[0]= m_fColDiffuse[0];\n\tpfCol[1]= m_fColDiffuse[1];\n\tpfCol[2]= m_fColDiffuse[2];\n\tpfCol[3]= m_fColDiffuse[3];\n}\n\n\/\/ Get specular color\nvoid GLC_Material::GetColSpeculaire(GLfloat* pfCol) const\t\/\/ pfCol[4]\n{\n\tpfCol[0]= m_fColSpeculaire[0];\n\tpfCol[1]= m_fColSpeculaire[1];\n\tpfCol[2]= m_fColSpeculaire[2];\n\tpfCol[3]= m_fColSpeculaire[3];\n}\n\n\/\/ Get the emissive color\nvoid GLC_Material::GetLightEmission(GLfloat* pfCol) const\t\/\/ pfCol[4]\n{\n\tpfCol[0]= m_fColEmission[0];\n\tpfCol[1]= m_fColEmission[1];\n\tpfCol[2]= m_fColEmission[2];\n\tpfCol[3]= m_fColEmission[3];\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Set Functions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ Set Ambiant Color\nvoid GLC_Material::SetColAmbiante(const GLfloat* pfCol)\n{\n\tm_fColAmbiente[0]= pfCol[0];\n\tm_fColAmbiente[1]= pfCol[1];\n\tm_fColAmbiente[2]= pfCol[2];\n\tm_fColAmbiente[3]= pfCol[3];\n\n\tUpdateUsed();\n}\n\n\/\/ Set Diffuse color\nvoid GLC_Material::SetColDiffuse(const GLfloat* pfCol)\n{\n\tm_fColDiffuse[0]= pfCol[0];\n\tm_fColDiffuse[1]= pfCol[1];\n\tm_fColDiffuse[2]= pfCol[2];\n\tm_fColDiffuse[3]= pfCol[3];\n\n\tUpdateUsed();\n}\n\n\/\/ Set Specular color\nvoid GLC_Material::SetColSpeculaire(const GLfloat* pfCol)\n{\n\tm_fColSpeculaire[0]= pfCol[0];\n\tm_fColSpeculaire[1]= pfCol[1];\n\tm_fColSpeculaire[2]= pfCol[2];\n\tm_fColSpeculaire[3]= pfCol[3];\n\n\tUpdateUsed();\n}\n\n\/\/ Set Emissive\nvoid GLC_Material::SetLightEmission(const GLfloat* pfCol)\n{\n\tm_fColEmission[0]= pfCol[0];\n\tm_fColEmission[1]= pfCol[1];\n\tm_fColEmission[2]= pfCol[2];\n\tm_fColEmission[3]= pfCol[3];\n\n\tUpdateUsed();\n}\n\n\/\/ Add Geometry to where used hash table\nbool GLC_Material::AddGLC_Geom(GLC_Geometry* pGeom)\n{\n\tCWhereUsed::iterator iGeom= m_WhereUsed.find(pGeom->GetID());\n\t\n\tif (iGeom == m_WhereUsed.end())\n\t{\t\/\/ Ok, ID doesn't exist\t\t\n\t\t\/\/ Add Geometry to where used hash table\n\t\tm_WhereUsed.insert(pGeom->GetID(), pGeom);\t\t\n\t\treturn true;\n\t}\n\telse\n\t{\t\/\/ KO, ID exist\n\t\tqDebug(\"GLC_Material::AddGLC_Geom : Geometry not added\");\n\t\treturn false;\n\t}\n\t\n}\n\/\/ Supprime une gomtrie de la collection\nbool GLC_Material::DelGLC_Geom(GLC_uint Key)\n{\n\tCWhereUsed::iterator iGeom= m_WhereUsed.find(Key);\n\t\n\tif (iGeom != m_WhereUsed.end())\n\t{\t\/\/ Ok, ID exist\t\t\n\t\tm_WhereUsed.remove(Key);\t\/\/ Remove container\n\t\t\n\t\treturn true;\n\t}\n\telse\n\t{\t\/\/ KO doesn't exist\n\t\tqDebug(\"GLC_Material::DelGLC_Geom : Geometry not remove\");\n\t\treturn false;\n\t}\n\t\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ OpenGL Functions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ Execute OpenGL Material\nbool GLC_Material::GlExecute(GLenum Mode)\n{\n\tif (m_pTexture != NULL)\n\t{\n\t\t\/\/ for blend managing\n\t\tglBlendFunc(GL_SRC_ALPHA,GL_ONE);\n\t\tm_pTexture->GlBindTexture();\n\t}\n\tglMaterialfv(GL_FRONT_AND_BACK, GL_AMBIENT, m_fColAmbiente);\n\tglMaterialfv(GL_FRONT_AND_BACK, GL_DIFFUSE, m_fColDiffuse);\n\tglMaterialfv(GL_FRONT_AND_BACK, GL_SPECULAR, m_fColSpeculaire);\n\tglMaterialfv(GL_FRONT_AND_BACK, GL_EMISSION, m_fColEmission);\n\tglMaterialfv(GL_FRONT_AND_BACK, GL_SHININESS, &m_fShininess);\n\n\t\/\/ OpenGL Error handler\n\tGLenum errCode;\n\tif ((errCode= glGetError()) != GL_NO_ERROR)\n\t{\n\t\tconst GLubyte* errString;\n\t\terrString = gluErrorString(errCode);\n\t\tqDebug(\"GLC_Material::GlExecute OpenGL Error %s\", errString);\n\t}\n\n\treturn true;\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Private servicies Functions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ Update geometries which used material\nvoid GLC_Material::UpdateUsed(void)\n{\n\tCGeomMap::iterator iEntry= m_WhereUsed.begin();\n\t\n    while (iEntry != m_WhereUsed.constEnd())\n    {\n        \/\/ Indique aux gomtrie utilisant la matire que celle ci  change\n        iEntry.value()->SetMaterial(this);\n        ++iEntry;\n    }\n\t\n\n}\n\n<commit_msg>Rename some members.<commit_after>\/****************************************************************************\n\n This file is part of the GLC-lib library.\n Copyright (C) 2005 Laurent Ribon (laumaya@users.sourceforge.net)\n Version 0.9, packaged on Novemeber, 2005.\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_material.cpp implementation of the GLC_Material class.\n\n#include <QtDebug>\n\n#include \"glc_material.h\"\n#include \"glc_collection.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Constructor Destructor\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nGLC_Material::GLC_Material(const char *pName ,const GLfloat *pAmbiantColor)\n:GLC_Object(pName)\n, m_fShininess(50.0)\t\t\/\/ Par dfaut, shininess 50\n, m_pTexture(NULL)\t\t\t\/\/ Pas de texture\n{\n\n\t\/\/ Initialisation de tableau contenant la couleur\n\tif (pAmbiantColor != 0)\n\t{\n\t\tm_AmbientColor[0]= pAmbiantColor[0];\n\t\tm_AmbientColor[1]= pAmbiantColor[1];\n\t\tm_AmbientColor[2]= pAmbiantColor[2];\n\t\tm_AmbientColor[3]= pAmbiantColor[3];\n\t}\n\telse\n\t{\t\/\/ By default light's color is dark grey.\n\t\tm_AmbientColor[0]= 0.2f;\n\t\tm_AmbientColor[1]= 0.2f;\n\t\tm_AmbientColor[2]= 0.2f;\n\t\tm_AmbientColor[3]= 1.0f;\n\t}\n\t\/\/ Les autres \n\t\/\/ Couleur diffuse\n\tm_DiffuseColor[0]= 1.0f;\n\tm_DiffuseColor[1]= 1.0f;\n\tm_DiffuseColor[2]= 1.0f;\n\tm_DiffuseColor[3]= 1.0f;\n\n\t\/\/ Couleur spculaire\n\tm_SpecularColor[0]= 1.0f;\n\tm_SpecularColor[1]= 1.0f;\n\tm_SpecularColor[2]= 1.0f;\n\tm_SpecularColor[3]= 1.0f;\n\n\t\/\/ Emission de lumire\n\tm_LightEmission[0]= 0.0f;\n\tm_LightEmission[1]= 0.0f;\n\tm_LightEmission[2]= 0.0f;\n\tm_LightEmission[3]= 1.0f;\n\n}\nGLC_Material::GLC_Material(GLC_Texture* pTexture, const char *pName)\n:GLC_Object(pName)\n, m_fShininess(50.0)\t\t\/\/ By default shininess 50\n, m_pTexture(pTexture)\t\t\t\/\/ Init texture\n{\n\t\/\/ Ambiente Color\n\tm_AmbientColor[0]= 0.2f;\n\tm_AmbientColor[1]= 0.2f;\n\tm_AmbientColor[2]= 0.2f;\n\tm_AmbientColor[3]= 1.0f;\n\n\t\/\/ Diffuse Color\n\tm_DiffuseColor[0]= 1.0f;\n\tm_DiffuseColor[1]= 1.0f;\n\tm_DiffuseColor[2]= 1.0f;\n\tm_DiffuseColor[3]= 1.0f;\n\n\t\/\/ Specular Color\n\tm_SpecularColor[0]= 1.0f;\n\tm_SpecularColor[1]= 1.0f;\n\tm_SpecularColor[2]= 1.0f;\n\tm_SpecularColor[3]= 1.0f;\n\n\t\/\/ Lighting emit\n\tm_LightEmission[0]= 0.0f;\n\tm_LightEmission[1]= 0.0f;\n\tm_LightEmission[2]= 0.0f;\n\tm_LightEmission[3]= 1.0f;\n\n}\n\nGLC_Material::~GLC_Material(void)\n{\n\n\t\/\/ Remove material from Geometries\n\tCGeomMap::iterator iEntry= m_WhereUsed.begin();\n\t\n    while (iEntry != m_WhereUsed.constEnd())\n    {\n        \/\/ Remove material from geometry\n        iEntry.value()->DelMaterial(iEntry.value());\n        ++iEntry;\n    }\n    \/\/ clear whereUSED Hash table\n    m_WhereUsed.clear();\n\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Get Functions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ Get Ambiant color\nvoid GLC_Material::GetAmbientColor(GLfloat* pfCol) const\t\/\/ pfCol[4]\n{\n\tpfCol[0]= m_AmbientColor[0];\n\tpfCol[1]= m_AmbientColor[1];\n\tpfCol[2]= m_AmbientColor[2];\n\tpfCol[3]= m_AmbientColor[3];\n}\n\n\/\/ Get diffuse color\nvoid GLC_Material::GetDiffuseColor(GLfloat* pfCol) const\t\/\/ pfCol[4]\n{\n\tpfCol[0]= m_DiffuseColor[0];\n\tpfCol[1]= m_DiffuseColor[1];\n\tpfCol[2]= m_DiffuseColor[2];\n\tpfCol[3]= m_DiffuseColor[3];\n}\n\n\/\/ Get specular color\nvoid GLC_Material::GetSpecularColor(GLfloat* pfCol) const\t\/\/ pfCol[4]\n{\n\tpfCol[0]= m_SpecularColor[0];\n\tpfCol[1]= m_SpecularColor[1];\n\tpfCol[2]= m_SpecularColor[2];\n\tpfCol[3]= m_SpecularColor[3];\n}\n\n\/\/ Get the emissive color\nvoid GLC_Material::GetLightEmission(GLfloat* pfCol) const\t\/\/ pfCol[4]\n{\n\tpfCol[0]= m_LightEmission[0];\n\tpfCol[1]= m_LightEmission[1];\n\tpfCol[2]= m_LightEmission[2];\n\tpfCol[3]= m_LightEmission[3];\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Set Functions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ Set Ambiant Color\nvoid GLC_Material::SetAmbientColor(const GLfloat* pfCol)\n{\n\tm_AmbientColor[0]= pfCol[0];\n\tm_AmbientColor[1]= pfCol[1];\n\tm_AmbientColor[2]= pfCol[2];\n\tm_AmbientColor[3]= pfCol[3];\n\n\tUpdateUsed();\n}\n\n\/\/ Set Diffuse color\nvoid GLC_Material::SetDiffuseColor(const GLfloat* pfCol)\n{\n\tm_DiffuseColor[0]= pfCol[0];\n\tm_DiffuseColor[1]= pfCol[1];\n\tm_DiffuseColor[2]= pfCol[2];\n\tm_DiffuseColor[3]= pfCol[3];\n\n\tUpdateUsed();\n}\n\n\/\/ Set Specular color\nvoid GLC_Material::SetSpecularColor(const GLfloat* pfCol)\n{\n\tm_SpecularColor[0]= pfCol[0];\n\tm_SpecularColor[1]= pfCol[1];\n\tm_SpecularColor[2]= pfCol[2];\n\tm_SpecularColor[3]= pfCol[3];\n\n\tUpdateUsed();\n}\n\n\/\/ Set Emissive\nvoid GLC_Material::SetLightEmission(const GLfloat* pfCol)\n{\n\tm_LightEmission[0]= pfCol[0];\n\tm_LightEmission[1]= pfCol[1];\n\tm_LightEmission[2]= pfCol[2];\n\tm_LightEmission[3]= pfCol[3];\n\n\tUpdateUsed();\n}\n\n\/\/ Add Geometry to where used hash table\nbool GLC_Material::AddGLC_Geom(GLC_Geometry* pGeom)\n{\n\tCWhereUsed::iterator iGeom= m_WhereUsed.find(pGeom->GetID());\n\t\n\tif (iGeom == m_WhereUsed.end())\n\t{\t\/\/ Ok, ID doesn't exist\t\t\n\t\t\/\/ Add Geometry to where used hash table\n\t\tm_WhereUsed.insert(pGeom->GetID(), pGeom);\t\t\n\t\treturn true;\n\t}\n\telse\n\t{\t\/\/ KO, ID exist\n\t\tqDebug(\"GLC_Material::AddGLC_Geom : Geometry not added\");\n\t\treturn false;\n\t}\n\t\n}\n\/\/ Supprime une gomtrie de la collection\nbool GLC_Material::DelGLC_Geom(GLC_uint Key)\n{\n\tCWhereUsed::iterator iGeom= m_WhereUsed.find(Key);\n\t\n\tif (iGeom != m_WhereUsed.end())\n\t{\t\/\/ Ok, ID exist\t\t\n\t\tm_WhereUsed.remove(Key);\t\/\/ Remove container\n\t\t\n\t\treturn true;\n\t}\n\telse\n\t{\t\/\/ KO doesn't exist\n\t\tqDebug(\"GLC_Material::DelGLC_Geom : Geometry not remove\");\n\t\treturn false;\n\t}\n\t\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ OpenGL Functions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ Execute OpenGL Material\nbool GLC_Material::GlExecute(GLenum Mode)\n{\n\tif (m_pTexture != NULL)\n\t{\n\t\t\/\/ for blend managing\n\t\tglBlendFunc(GL_SRC_ALPHA,GL_ONE);\n\t\tm_pTexture->GlBindTexture();\n\t}\n\tglMaterialfv(GL_FRONT_AND_BACK, GL_AMBIENT, m_AmbientColor);\n\tglMaterialfv(GL_FRONT_AND_BACK, GL_DIFFUSE, m_DiffuseColor);\n\tglMaterialfv(GL_FRONT_AND_BACK, GL_SPECULAR, m_SpecularColor);\n\tglMaterialfv(GL_FRONT_AND_BACK, GL_EMISSION, m_LightEmission);\n\tglMaterialfv(GL_FRONT_AND_BACK, GL_SHININESS, &m_fShininess);\n\n\t\/\/ OpenGL Error handler\n\tGLenum errCode;\n\tif ((errCode= glGetError()) != GL_NO_ERROR)\n\t{\n\t\tconst GLubyte* errString;\n\t\terrString = gluErrorString(errCode);\n\t\tqDebug(\"GLC_Material::GlExecute OpenGL Error %s\", errString);\n\t}\n\n\treturn true;\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Private servicies Functions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ Update geometries which used material\nvoid GLC_Material::UpdateUsed(void)\n{\n\tCGeomMap::iterator iEntry= m_WhereUsed.begin();\n\t\n    while (iEntry != m_WhereUsed.constEnd())\n    {\n        \/\/ Indique aux gomtrie utilisant la matire que celle ci  change\n        iEntry.value()->SetMaterial(this);\n        ++iEntry;\n    }\n\t\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>ToolBarManager: Let XSubToolbarController update itself<commit_after><|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\/QSet>\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    QSet<int> deviceIndexes = backendIface->objectDescriptionIndexes(Phonon::AudioOutputDeviceType);\n\n    QList<int> defaultList = deviceIndexes.toList();\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        foreach (int index, defaultList) {\n            const QHash<QByteArray, QVariant> properties = backendIface->objectDescriptionProperties(Phonon::AudioOutputDeviceType, index);\n            orderedList.insertMulti(-properties.value(\"initialPreference\").toInt(), index);\n        }\n        defaultList = orderedList.values();\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    QSet<int> deviceIndexes = backendIface->objectDescriptionIndexes(Phonon::AudioCaptureDeviceType);\n\n    QList<int> defaultList = deviceIndexes.toList();\n    qSort(defaultList);\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>Fixed a problem that would mess up (actually completely revert) the order of audio devices in case there is no preference for the audio devices stored. Now sound is working again on Windows ;-)<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\/QSet>\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    QSet<int> deviceIndexes = backendIface->objectDescriptionIndexes(Phonon::AudioOutputDeviceType);\n\n    QList<int> defaultList = deviceIndexes.toList();\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    QSet<int> deviceIndexes = backendIface->objectDescriptionIndexes(Phonon::AudioCaptureDeviceType);\n\n    QList<int> defaultList = deviceIndexes.toList();\n    qSort(defaultList);\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>\/*\n * Copyright (c) 2012, Andrew Brown\n * All 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 * 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\"\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#include \"config.h\"\n#include <cassert>\n#include <stdexcept>\n#include \"gloop\/Buffer.hxx\"\nusing namespace std;\nnamespace Gloop {\n\n\/**\n * Constructs an invalid buffer handle.\n *\/\nBuffer::Buffer() {\n    throw runtime_error(\"[Buffer] Default constructor should not be called!\");\n}\n\n\/**\n * Constructs a buffer handle representing an OpenGL buffer.\n *\n * @param name Enumeration for the OpenGL buffer, e.g. `GL_ARRAY_BUFFER`\n * @param binding Enumeration used to look up the current binding, e.g. `GL_ARRAY_BUFFER_BINDING`\n *\/\nBuffer::Buffer(GLenum name, GLenum binding) : _name(name), _binding(binding) {\n    \/\/ pass\n}\n\n\/**\n * Constructs a buffer handle representing the same OpenGL buffer as another one.\n *\n * @param bt Other buffer handle to copy\n *\/\nBuffer::Buffer(const Buffer& bt) : _name(bt._name), _binding(bt._binding) {\n    \/\/ pass\n}\n\n\/**\n * Destructs a buffer handle, leaving the corresponding OpenGL buffer unaffected.\n *\/\nBuffer::~Buffer() {\n    \/\/ pass\n}\n\n\/**\n * Uses a buffer object as the data store for the OpenGL buffer this handle represents.\n *\n * @param bo Handle for the buffer object to use\n *\/\nvoid Buffer::bind(const BufferObject& bo) const {\n    glBindBuffer(_name, bo.id());\n}\n\n\/**\n * Determines the buffer object currently being used as the data store for the buffer.\n *\n * @return Identifier of the buffer object, or zero if nothing bound\n *\/\nGLuint Buffer::binding() const {\n    GLint i;\n    glGetIntegerv(_binding, &i);\n    return i;\n}\n\n\/**\n * Checks if any buffer object is currently being used as the data store for the buffer.\n *\n * @return `true` if a buffer object is being used\n *\/\nbool Buffer::bound() const {\n    return binding() != 0;\n}\n\n\/**\n * Checks if a specific buffer object is currently being used as the data store for the buffer.\n *\n * @param bo Handle for buffer object to check for\n * @return `true` if the buffer object is being used\n *\/\nbool Buffer::bound(const BufferObject& bo) const {\n    return binding() == bo.id();\n}\n\n\/**\n * Allocates or reallocates memory for the data store currently bound to the buffer.\n *\n * @param size Number of bytes to allocate or reallocate\n * @param data Data to initialize memory with, or `NULL` to leave it uninitialized\n * @param usage Hint for how the memory will be used, e.g. `GL_STATIC_DRAW`\n * @pre A buffer object is currently bound to the buffer as its data store\n *\/\nvoid Buffer::data(GLsizeiptr size, const GLvoid* data, GLenum usage) const {\n    assert (bound());\n    glBufferData(_name, size, data, usage);\n}\n\n\/**\n * Changes which OpenGL buffer this handle represents.\n *\n * @param bt Other buffer handle to copy name from\n * @return Reference to this handle\n *\/\nBuffer& Buffer::operator=(const Buffer& bt) {\n    _name = bt._name;\n    _binding = bt._binding;\n}\n\n\/**\n * Checks if another buffer represents the same OpenGL buffer as this one.\n *\n * @param bt Other buffer handle to check\n * @return `true` if the other handle represents the same OpenGL buffer\n *\/\nbool Buffer::operator==(const Buffer& bt) const {\n    return _name == bt._name;\n}\n\n\/**\n * Checks if another buffer does not represent the same OpenGL buffer as this one.\n *\n * @param bt Other buffer handle to check\n * @return `true` if the other handle does not represent the same OpenGL buffer\n *\/\nbool Buffer::operator!=(const Buffer& bt) const {\n    return _name != bt._name;\n}\n\n\/**\n * Compares the name of this buffer handle to that of another one.\n *\n * @param bt Other buffer handle to compare to\n * @return `true` if this handle's identifier is less than the other one's\n *\/\nbool Buffer::operator<(const Buffer& bt) const {\n    return _name < bt._name;\n}\n\n\/**\n * Changes all or some of the data in the buffer object currently bound to the buffer.\n *\n * @param offset Number of bytes from the start of the buffer object to start replacing data\n * @param size Number of bytes to copy into the buffer object\n * @param data Pointer to the data to copy into the buffer object\n * @pre A buffer object is currently bound to the buffer as its data store\n *\/\nvoid Buffer::subData(GLintptr offset, GLsizeiptr size, const GLvoid* data) const {\n    assert (bound());\n    glBufferSubData(_name, offset, size, data);\n}\n\n\/**\n * Unbinds a buffer object from the OpenGL buffer this handle represents.\n *\n * @param bo Handle for the buffer object to unbind\n * @pre Specified buffer object is currently bound to the buffer\n *\/\nvoid Buffer::unbind(const BufferObject& bo) const {\n    assert (bound(bo));\n    glBindBuffer(_name, 0);\n}\n\n\/\/ INSTANCES\n\n\/**\n * Returns a handle for the `GL_ARRAY_BUFFER` buffer.\n *\/\nBuffer Buffer::arrayBuffer() {\n    return Buffer(GL_ARRAY_BUFFER, GL_ARRAY_BUFFER_BINDING);\n}\n\n\/**\n * Returns a handle for the `GL_COPY_READ_BUFFER` buffer.\n *\/\nBuffer Buffer::copyReadBuffer() {\n    return Buffer(GL_COPY_READ_BUFFER, GL_COPY_READ_BUFFER);\n}\n\n\/**\n * Returns a handle for the `GL_COPY_WRITE_BUFFER` buffer.\n *\/\nBuffer Buffer::copyWriteBuffer() {\n    return Buffer(GL_COPY_WRITE_BUFFER, GL_COPY_WRITE_BUFFER);\n}\n\n\/**\n * Returns a handle for the `GL_ELEMENT_ARRAY_BUFFER` buffer.\n *\/\nBuffer Buffer::elementArrayBuffer() {\n    return Buffer(GL_ELEMENT_ARRAY_BUFFER, GL_ELEMENT_ARRAY_BUFFER_BINDING);\n}\n\n\/**\n * Returns a handle for the `GL_PIXEL_PACK_BUFFER`.\n *\/\nBuffer Buffer::pixelPackBuffer() {\n    return Buffer(GL_PIXEL_PACK_BUFFER, GL_PIXEL_PACK_BUFFER_BINDING);\n}\n\n\/**\n * Returns a handle for the `GL_PIXEL_UNPACK_BUFFER`.\n *\/\nBuffer Buffer::pixelUnpackBuffer() {\n    return Buffer(GL_PIXEL_UNPACK_BUFFER, GL_PIXEL_UNPACK_BUFFER_BINDING);\n}\n\n\/**\n * Returns a handle for the `GL_TEXTURE_BUFFER` buffer.\n *\/\nBuffer Buffer::textureBuffer() {\n    return Buffer(GL_TEXTURE_BUFFER, GL_TEXTURE_BUFFER);\n}\n\n\/**\n * Returns a handle for the `GL_TRANSFORM_FEEDBACK_BUFFER`.\n *\/\nBuffer Buffer::transformFeedbackBuffer() {\n    return Buffer(GL_TRANSFORM_FEEDBACK_BUFFER, GL_TRANSFORM_FEEDBACK_BUFFER_BINDING);\n}\n\n\/**\n * Returns a handle for the `GL_UNIFORM_BUFFER` buffer.\n *\/\nBuffer Buffer::uniformBuffer() {\n    return Buffer(GL_UNIFORM_BUFFER, GL_UNIFORM_BUFFER_BINDING);\n}\n\n} \/* namespace Gloop *\/\n<commit_msg>Buffer assignment operator returns reference to itself (closes #63)<commit_after>\/*\n * Copyright (c) 2012, Andrew Brown\n * All 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 * 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\"\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#include \"config.h\"\n#include <cassert>\n#include <stdexcept>\n#include \"gloop\/Buffer.hxx\"\nusing namespace std;\nnamespace Gloop {\n\n\/**\n * Constructs an invalid buffer handle.\n *\/\nBuffer::Buffer() {\n    throw runtime_error(\"[Buffer] Default constructor should not be called!\");\n}\n\n\/**\n * Constructs a buffer handle representing an OpenGL buffer.\n *\n * @param name Enumeration for the OpenGL buffer, e.g. `GL_ARRAY_BUFFER`\n * @param binding Enumeration used to look up the current binding, e.g. `GL_ARRAY_BUFFER_BINDING`\n *\/\nBuffer::Buffer(GLenum name, GLenum binding) : _name(name), _binding(binding) {\n    \/\/ pass\n}\n\n\/**\n * Constructs a buffer handle representing the same OpenGL buffer as another one.\n *\n * @param bt Other buffer handle to copy\n *\/\nBuffer::Buffer(const Buffer& bt) : _name(bt._name), _binding(bt._binding) {\n    \/\/ pass\n}\n\n\/**\n * Destructs a buffer handle, leaving the corresponding OpenGL buffer unaffected.\n *\/\nBuffer::~Buffer() {\n    \/\/ pass\n}\n\n\/**\n * Uses a buffer object as the data store for the OpenGL buffer this handle represents.\n *\n * @param bo Handle for the buffer object to use\n *\/\nvoid Buffer::bind(const BufferObject& bo) const {\n    glBindBuffer(_name, bo.id());\n}\n\n\/**\n * Determines the buffer object currently being used as the data store for the buffer.\n *\n * @return Identifier of the buffer object, or zero if nothing bound\n *\/\nGLuint Buffer::binding() const {\n    GLint i;\n    glGetIntegerv(_binding, &i);\n    return i;\n}\n\n\/**\n * Checks if any buffer object is currently being used as the data store for the buffer.\n *\n * @return `true` if a buffer object is being used\n *\/\nbool Buffer::bound() const {\n    return binding() != 0;\n}\n\n\/**\n * Checks if a specific buffer object is currently being used as the data store for the buffer.\n *\n * @param bo Handle for buffer object to check for\n * @return `true` if the buffer object is being used\n *\/\nbool Buffer::bound(const BufferObject& bo) const {\n    return binding() == bo.id();\n}\n\n\/**\n * Allocates or reallocates memory for the data store currently bound to the buffer.\n *\n * @param size Number of bytes to allocate or reallocate\n * @param data Data to initialize memory with, or `NULL` to leave it uninitialized\n * @param usage Hint for how the memory will be used, e.g. `GL_STATIC_DRAW`\n * @pre A buffer object is currently bound to the buffer as its data store\n *\/\nvoid Buffer::data(GLsizeiptr size, const GLvoid* data, GLenum usage) const {\n    assert (bound());\n    glBufferData(_name, size, data, usage);\n}\n\n\/**\n * Changes which OpenGL buffer this handle represents.\n *\n * @param bt Other buffer handle to copy name from\n * @return Reference to this handle\n *\/\nBuffer& Buffer::operator=(const Buffer& bt) {\n    _name = bt._name;\n    _binding = bt._binding;\n    return (*this);\n}\n\n\/**\n * Checks if another buffer represents the same OpenGL buffer as this one.\n *\n * @param bt Other buffer handle to check\n * @return `true` if the other handle represents the same OpenGL buffer\n *\/\nbool Buffer::operator==(const Buffer& bt) const {\n    return _name == bt._name;\n}\n\n\/**\n * Checks if another buffer does not represent the same OpenGL buffer as this one.\n *\n * @param bt Other buffer handle to check\n * @return `true` if the other handle does not represent the same OpenGL buffer\n *\/\nbool Buffer::operator!=(const Buffer& bt) const {\n    return _name != bt._name;\n}\n\n\/**\n * Compares the name of this buffer handle to that of another one.\n *\n * @param bt Other buffer handle to compare to\n * @return `true` if this handle's identifier is less than the other one's\n *\/\nbool Buffer::operator<(const Buffer& bt) const {\n    return _name < bt._name;\n}\n\n\/**\n * Changes all or some of the data in the buffer object currently bound to the buffer.\n *\n * @param offset Number of bytes from the start of the buffer object to start replacing data\n * @param size Number of bytes to copy into the buffer object\n * @param data Pointer to the data to copy into the buffer object\n * @pre A buffer object is currently bound to the buffer as its data store\n *\/\nvoid Buffer::subData(GLintptr offset, GLsizeiptr size, const GLvoid* data) const {\n    assert (bound());\n    glBufferSubData(_name, offset, size, data);\n}\n\n\/**\n * Unbinds a buffer object from the OpenGL buffer this handle represents.\n *\n * @param bo Handle for the buffer object to unbind\n * @pre Specified buffer object is currently bound to the buffer\n *\/\nvoid Buffer::unbind(const BufferObject& bo) const {\n    assert (bound(bo));\n    glBindBuffer(_name, 0);\n}\n\n\/\/ INSTANCES\n\n\/**\n * Returns a handle for the `GL_ARRAY_BUFFER` buffer.\n *\/\nBuffer Buffer::arrayBuffer() {\n    return Buffer(GL_ARRAY_BUFFER, GL_ARRAY_BUFFER_BINDING);\n}\n\n\/**\n * Returns a handle for the `GL_COPY_READ_BUFFER` buffer.\n *\/\nBuffer Buffer::copyReadBuffer() {\n    return Buffer(GL_COPY_READ_BUFFER, GL_COPY_READ_BUFFER);\n}\n\n\/**\n * Returns a handle for the `GL_COPY_WRITE_BUFFER` buffer.\n *\/\nBuffer Buffer::copyWriteBuffer() {\n    return Buffer(GL_COPY_WRITE_BUFFER, GL_COPY_WRITE_BUFFER);\n}\n\n\/**\n * Returns a handle for the `GL_ELEMENT_ARRAY_BUFFER` buffer.\n *\/\nBuffer Buffer::elementArrayBuffer() {\n    return Buffer(GL_ELEMENT_ARRAY_BUFFER, GL_ELEMENT_ARRAY_BUFFER_BINDING);\n}\n\n\/**\n * Returns a handle for the `GL_PIXEL_PACK_BUFFER`.\n *\/\nBuffer Buffer::pixelPackBuffer() {\n    return Buffer(GL_PIXEL_PACK_BUFFER, GL_PIXEL_PACK_BUFFER_BINDING);\n}\n\n\/**\n * Returns a handle for the `GL_PIXEL_UNPACK_BUFFER`.\n *\/\nBuffer Buffer::pixelUnpackBuffer() {\n    return Buffer(GL_PIXEL_UNPACK_BUFFER, GL_PIXEL_UNPACK_BUFFER_BINDING);\n}\n\n\/**\n * Returns a handle for the `GL_TEXTURE_BUFFER` buffer.\n *\/\nBuffer Buffer::textureBuffer() {\n    return Buffer(GL_TEXTURE_BUFFER, GL_TEXTURE_BUFFER);\n}\n\n\/**\n * Returns a handle for the `GL_TRANSFORM_FEEDBACK_BUFFER`.\n *\/\nBuffer Buffer::transformFeedbackBuffer() {\n    return Buffer(GL_TRANSFORM_FEEDBACK_BUFFER, GL_TRANSFORM_FEEDBACK_BUFFER_BINDING);\n}\n\n\/**\n * Returns a handle for the `GL_UNIFORM_BUFFER` buffer.\n *\/\nBuffer Buffer::uniformBuffer() {\n    return Buffer(GL_UNIFORM_BUFFER, GL_UNIFORM_BUFFER_BINDING);\n}\n\n} \/* namespace Gloop *\/\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* DL Scheme\n* (C) 1999-2007 Jack Lloyd\n*\n* Botan is released under the Simplified BSD License (see license.txt)\n*\/\n\n#include <botan\/dl_algo.h>\n#include <botan\/numthry.h>\n#include <botan\/workfactor.h>\n#include <botan\/der_enc.h>\n#include <botan\/ber_dec.h>\n\nnamespace Botan {\n\nsize_t DL_Scheme_PublicKey::key_length() const\n   {\n   return m_group.get_p().bits();\n   }\n\nsize_t DL_Scheme_PublicKey::estimated_strength() const\n   {\n   return dl_work_factor(key_length());\n   }\n\nAlgorithmIdentifier DL_Scheme_PublicKey::algorithm_identifier() const\n   {\n   return AlgorithmIdentifier(get_oid(),\n                              m_group.DER_encode(group_format()));\n   }\n\nstd::vector<byte> DL_Scheme_PublicKey::public_key_bits() const\n   {\n   return DER_Encoder().encode(m_y).get_contents_unlocked();\n   }\n\nDL_Scheme_PublicKey::DL_Scheme_PublicKey(const AlgorithmIdentifier& alg_id,\n                                         const std::vector<byte>& key_bits,\n                                         DL_Group::Format format)\n   {\n   m_group.BER_decode(alg_id.parameters, format);\n\n   BER_Decoder(key_bits).decode(m_y);\n   }\n\nsecure_vector<byte> DL_Scheme_PrivateKey::private_key_bits() const\n   {\n   return DER_Encoder().encode(m_x).get_contents();\n   }\n\nDL_Scheme_PrivateKey::DL_Scheme_PrivateKey(const AlgorithmIdentifier& alg_id,\n                                           const secure_vector<byte>& key_bits,\n                                           DL_Group::Format format)\n   {\n   m_group.BER_decode(alg_id.parameters, format);\n\n   BER_Decoder(key_bits).decode(m_x);\n   }\n\n\/*\n* Check Public DL Parameters\n*\/\nbool DL_Scheme_PublicKey::check_key(RandomNumberGenerator& rng,\n                                    bool strong) const\n   {\n   if(m_y < 2 || m_y >= group_p())\n      return false;\n   if(!m_group.verify_group(rng, strong))\n      return false;\n   return true;\n   }\n\n\/*\n* Check DL Scheme Private Parameters\n*\/\nbool DL_Scheme_PrivateKey::check_key(RandomNumberGenerator& rng,\n                                     bool strong) const\n   {\n   const BigInt& p = group_p();\n   const BigInt& g = group_g();\n\n   if(m_y < 2 || m_y >= p || m_x < 2 || m_x >= p)\n      return false;\n   if(!m_group.verify_group(rng, strong))\n      return false;\n\n   if(!strong)\n      return true;\n\n   if(m_y != power_mod(g, m_x, p))\n      return false;\n\n   return true;\n   }\n\n}\n<commit_msg>Added DH public key check y^q mod p = 1 against small-subgroup attacks as described in rfc2785<commit_after>\/*\n* DL Scheme\n* (C) 1999-2007 Jack Lloyd\n*\n* Botan is released under the Simplified BSD License (see license.txt)\n*\/\n\n#include <botan\/dl_algo.h>\n#include <botan\/numthry.h>\n#include <botan\/workfactor.h>\n#include <botan\/der_enc.h>\n#include <botan\/ber_dec.h>\n\nnamespace Botan {\n\nsize_t DL_Scheme_PublicKey::key_length() const\n   {\n   return m_group.get_p().bits();\n   }\n\nsize_t DL_Scheme_PublicKey::estimated_strength() const\n   {\n   return dl_work_factor(key_length());\n   }\n\nAlgorithmIdentifier DL_Scheme_PublicKey::algorithm_identifier() const\n   {\n   return AlgorithmIdentifier(get_oid(),\n                              m_group.DER_encode(group_format()));\n   }\n\nstd::vector<byte> DL_Scheme_PublicKey::public_key_bits() const\n   {\n   return DER_Encoder().encode(m_y).get_contents_unlocked();\n   }\n\nDL_Scheme_PublicKey::DL_Scheme_PublicKey(const AlgorithmIdentifier& alg_id,\n                                         const std::vector<byte>& key_bits,\n                                         DL_Group::Format format)\n   {\n   m_group.BER_decode(alg_id.parameters, format);\n\n   BER_Decoder(key_bits).decode(m_y);\n   }\n\nsecure_vector<byte> DL_Scheme_PrivateKey::private_key_bits() const\n   {\n   return DER_Encoder().encode(m_x).get_contents();\n   }\n\nDL_Scheme_PrivateKey::DL_Scheme_PrivateKey(const AlgorithmIdentifier& alg_id,\n                                           const secure_vector<byte>& key_bits,\n                                           DL_Group::Format format)\n   {\n   m_group.BER_decode(alg_id.parameters, format);\n\n   BER_Decoder(key_bits).decode(m_x);\n   }\n\n\/*\n* Check Public DL Parameters\n*\/\nbool DL_Scheme_PublicKey::check_key(RandomNumberGenerator& rng,\n                                    bool strong) const\n   {\n   if(m_y < 2 || m_y >= group_p())\n      return false;\n   if(!m_group.verify_group(rng, strong))\n      return false;\n   if(power_mod(m_y,group_q(),group_p()) != 1)\n      return false;\n   return true;\n   }\n\n\/*\n* Check DL Scheme Private Parameters\n*\/\nbool DL_Scheme_PrivateKey::check_key(RandomNumberGenerator& rng,\n                                     bool strong) const\n   {\n   const BigInt& p = group_p();\n   const BigInt& g = group_g();\n\n   if(m_y < 2 || m_y >= p || m_x < 2 || m_x >= p)\n      return false;\n   if(!m_group.verify_group(rng, strong))\n      return false;\n\n   if(!strong)\n      return true;\n\n   if(m_y != power_mod(g, m_x, p))\n      return false;\n\n   return true;\n   }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\nCopyright (c) 2015 K. S. Ernest 'iFire' Lee\nCopyright (c) AUTHORS.txt\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\/\/ Add a class to handle the Solution file locally\n\/\/ instead of relying on FDesktopPlatformModule.\n\n#include \"QtCreatorSourceCodeAccessPrivatePCH.h\"\n#include \"QtCreatorSourceCodeAccessor.h\"\n#include \"DesktopPlatformModule.h\"\n\n#define LOCTEXT_NAMESPACE \"QtCreatorSourceCodeAccessor\"\nbool FQtCreatorSourceCodeAccessor::CanAccessSourceCode() const\n{\n  return FPaths::FileExists(TEXT(\"\/usr\/bin\/env clang++\"));\n}\n\nFName FQtCreatorSourceCodeAccessor::GetFName() const\n{\n  return FName(\"QtCreatorSourceCodeAccessor\");\n}\n\nFText FQtCreatorSourceCodeAccessor::GetNameText() const \n{\n  return LOCTEXT(\"QtCreatorDisplayName\", \"Qt Creator\");\n}\n\nFText FQtCreatorSourceCodeAccessor::GetDescriptionText() const\n{\n  return LOCTEXT(\"QtCreatorDisplayDesc\", \"Open source code files with Qt Creator\");\n}\n\nbool FQtCreatorSourceCodeAccessor::OpenSolution()\n{\n  FString FullPath;\n  FString SolutionFilenameWithoutExtension = TEXT(\"UE4\");\n  FString CodeSolutionFile = SolutionFilenameWithoutExtension + TEXT(\".pro\");\n\n  if(FDesktopPlatformModule::Get()->GetSolutionPath(FullPath)){\n    if ( FPaths::FileExists( FullPath ) )\n    {\n      FString Editor = FString(TEXT(\"\/usr\/bin\/qtcreator\"));\n      FString Args = FString(TEXT(\"-client \"));\n\n      \/\/ Add this to handle spaces in path names.\n      const FString NewFullPath = FString::Printf(TEXT(\"\\\"%s\\\"\"), *FullPath);\n\n      Args.Append(NewFullPath);\n      if(FLinuxPlatformProcess::CreateProc(*Editor,\n                                           *Args,\n                                           true,\n                                           true,\n                                           false,\n                                           nullptr,\n                                           0,\n                                           nullptr,\n                                           nullptr).IsValid())\n      {\n        return true;\n      }\n    }\n  }\n  return false;\n}\n\nbool FQtCreatorSourceCodeAccessor::OpenFileAtLine(const FString& FullPath, int32 LineNumber, int32 ColumnNumber)\n{\n    FString Editor = FString(TEXT(\"\/usr\/bin\/qtcreator\"));\n    FString Args = FString(TEXT(\"-client \"));\n\n    \/\/ Add this to handle spaces in path names.\n    const FString NewFullPath = FString::Printf(TEXT(\"\\\"%s:%d\\\"\"), *FullPath, LineNumber);\n\n    Args.Append(NewFullPath); \/\/ .Append(TEXT(\":\")).Append(FString::FromInt(LineNumber));\n    if (FLinuxPlatformProcess::CreateProc(*Editor,\n                                          *Args,\n                                          true,\n                                          true,\n                                          false,\n                                          nullptr,\n                                          0,\n                                          nullptr,\n                                          nullptr).IsValid())\n    {\n      return true;\n    }\n\n  return false;\n}\n\nbool FQtCreatorSourceCodeAccessor::OpenSourceFiles(const TArray<FString>& AbsoluteSourcePaths) \n{\n  for ( const FString& SourcePath : AbsoluteSourcePaths ) \n  {\n      FString Editor = FString(TEXT(\"\/usr\/bin\/qtcreator\"));\n      FString Args = FString(TEXT(\"-client \"));\n\n      \/\/ Add this to handle spaces in path names.\n      const FString NewSourcePath = FString::Printf(TEXT(\"\\\"%s\\\"\"), *SourcePath);\n\n      Args.Append(NewSourcePath);\n      if(!(FLinuxPlatformProcess::CreateProc(*Editor,\n                                             *Args,\n                                             true,\n                                             true,\n                                             false,\n                                             nullptr,\n                                             0,\n                                             nullptr,\n                                             nullptr).IsValid()))\n      {\n          return false;\n      }\n  }\n\n  return true;\n}\n\nbool FQtCreatorSourceCodeAccessor::AddSourceFiles(const TArray<FString>& AbsoluteSourcePaths, const TArray<FString>& AvailableModules)\n{\n\treturn false;\n}\n\nbool FQtCreatorSourceCodeAccessor::SaveAllOpenDocuments() const\n{\n  return false;\n}\n\nvoid FQtCreatorSourceCodeAccessor::Tick(const float DeltaTime) \n{\n\n}\n\n#undef LOCTEXT_NAMESPACE\n<commit_msg>Update QtCreatorSourceCodeAccessor.cpp<commit_after>\/*\nCopyright (c) 2015 K. S. Ernest 'iFire' Lee\nCopyright (c) AUTHORS.txt\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\/\/ Add a class to handle the Solution file locally\n\/\/ instead of relying on FDesktopPlatformModule.\n\n#include \"QtCreatorSourceCodeAccessPrivatePCH.h\"\n#include \"QtCreatorSourceCodeAccessor.h\"\n#include \"DesktopPlatformModule.h\"\n\n#define LOCTEXT_NAMESPACE \"QtCreatorSourceCodeAccessor\"\nbool FQtCreatorSourceCodeAccessor::CanAccessSourceCode() const\n{\n  return FPaths::FileExists(TEXT(\"\/usr\/bin\/clang++\"));\n}\n\nFName FQtCreatorSourceCodeAccessor::GetFName() const\n{\n  return FName(\"QtCreatorSourceCodeAccessor\");\n}\n\nFText FQtCreatorSourceCodeAccessor::GetNameText() const \n{\n  return LOCTEXT(\"QtCreatorDisplayName\", \"Qt Creator\");\n}\n\nFText FQtCreatorSourceCodeAccessor::GetDescriptionText() const\n{\n  return LOCTEXT(\"QtCreatorDisplayDesc\", \"Open source code files with Qt Creator\");\n}\n\nbool FQtCreatorSourceCodeAccessor::OpenSolution()\n{\n  FString FullPath;\n  FString SolutionFilenameWithoutExtension = TEXT(\"UE4\");\n  FString CodeSolutionFile = SolutionFilenameWithoutExtension + TEXT(\".pro\");\n\n  if(FDesktopPlatformModule::Get()->GetSolutionPath(FullPath)){\n    if ( FPaths::FileExists( FullPath ) )\n    {\n      FString Editor = FString(TEXT(\"\/usr\/bin\/qtcreator\"));\n      FString Args = FString(TEXT(\"-client \"));\n\n      \/\/ Add this to handle spaces in path names.\n      const FString NewFullPath = FString::Printf(TEXT(\"\\\"%s\\\"\"), *FullPath);\n\n      Args.Append(NewFullPath);\n      if(FLinuxPlatformProcess::CreateProc(*Editor,\n                                           *Args,\n                                           true,\n                                           true,\n                                           false,\n                                           nullptr,\n                                           0,\n                                           nullptr,\n                                           nullptr).IsValid())\n      {\n        return true;\n      }\n    }\n  }\n  return false;\n}\n\nbool FQtCreatorSourceCodeAccessor::OpenFileAtLine(const FString& FullPath, int32 LineNumber, int32 ColumnNumber)\n{\n    FString Editor = FString(TEXT(\"\/usr\/bin\/qtcreator\"));\n    FString Args = FString(TEXT(\"-client \"));\n\n    \/\/ Add this to handle spaces in path names.\n    const FString NewFullPath = FString::Printf(TEXT(\"\\\"%s:%d\\\"\"), *FullPath, LineNumber);\n\n    Args.Append(NewFullPath); \/\/ .Append(TEXT(\":\")).Append(FString::FromInt(LineNumber));\n    if (FLinuxPlatformProcess::CreateProc(*Editor,\n                                          *Args,\n                                          true,\n                                          true,\n                                          false,\n                                          nullptr,\n                                          0,\n                                          nullptr,\n                                          nullptr).IsValid())\n    {\n      return true;\n    }\n\n  return false;\n}\n\nbool FQtCreatorSourceCodeAccessor::OpenSourceFiles(const TArray<FString>& AbsoluteSourcePaths) \n{\n  for ( const FString& SourcePath : AbsoluteSourcePaths ) \n  {\n      FString Editor = FString(TEXT(\"\/usr\/bin\/qtcreator\"));\n      FString Args = FString(TEXT(\"-client \"));\n\n      \/\/ Add this to handle spaces in path names.\n      const FString NewSourcePath = FString::Printf(TEXT(\"\\\"%s\\\"\"), *SourcePath);\n\n      Args.Append(NewSourcePath);\n      if(!(FLinuxPlatformProcess::CreateProc(*Editor,\n                                             *Args,\n                                             true,\n                                             true,\n                                             false,\n                                             nullptr,\n                                             0,\n                                             nullptr,\n                                             nullptr).IsValid()))\n      {\n          return false;\n      }\n  }\n\n  return true;\n}\n\nbool FQtCreatorSourceCodeAccessor::AddSourceFiles(const TArray<FString>& AbsoluteSourcePaths, const TArray<FString>& AvailableModules)\n{\n\treturn false;\n}\n\nbool FQtCreatorSourceCodeAccessor::SaveAllOpenDocuments() const\n{\n  return false;\n}\n\nvoid FQtCreatorSourceCodeAccessor::Tick(const float DeltaTime) \n{\n\n}\n\n#undef LOCTEXT_NAMESPACE\n<|endoftext|>"}
{"text":"<commit_before>\/* Main.cpp\n *\n * Kubo Ryosuke\n *\/\n\n#include \"common\/console\/Console.hpp\"\n#include \"common\/program_options\/ProgramOptions.hpp\"\n#include \"core\/util\/CoreUtil.hpp\"\n#include \"benchmark\/Benchmark.hpp\"\n#include \"logger\/Logger.hpp\"\n#include <fstream>\n\nusing namespace sunfish;\n\nint main(int argc, char** argv, char**) {\n  \/\/ initialize static objects\n  CoreUtil::initialize();\n\n  \/\/ program options\n  ProgramOptions po;\n  po.addOption(\"silent\", \"s\", \"silent mode\");\n  po.addOption(\"out\", \"o\", \"output file name\", true);\n  po.addOption(\"help\", \"h\", \"show this help\");\n  po.parse(argc, argv);\n\n  \/\/ --help or -h\n  if (po.has(\"help\")) {\n    std::cout << po.help();\n    return 0;\n  }\n\n  \/\/ if '--silent' or '-s' is NOT specified.\n  if (!po.has(\"silent\")) {\n    Loggers::error.addStream(std::cerr, ESC_SEQ_COLOR_RED, ESC_SEQ_COLOR_RESET);\n    Loggers::warning.addStream(std::cerr, ESC_SEQ_COLOR_YELLOW, ESC_SEQ_COLOR_RESET);\n    Loggers::message.addStream(std::cerr, ESC_SEQ_COLOR_GREEN, ESC_SEQ_COLOR_RESET);\n    Loggers::send.addStream(std::cerr, true, true, ESC_SEQ_COLOR_BLUE, ESC_SEQ_COLOR_RESET);\n    Loggers::receive.addStream(std::cerr, true, true, ESC_SEQ_COLOR_MAGENTA, ESC_SEQ_COLOR_RESET);\n#if !defined(NDEBUG)\n    Loggers::debug.addStream(std::cerr, ESC_SEQ_COLOR_CYAN, ESC_SEQ_COLOR_RESET);\n    Loggers::develop.addStream(std::cerr, ESC_SEQ_COLOR_WHITE, ESC_SEQ_COLOR_RESET);\n#endif \/\/ !defined(NDEBUG)\n  }\n\n  \/\/ the name of the result file\n  std::string resultFileName;\n  if (po.has(\"out\")) {\n    resultFileName = po.getValue(\"out\");\n  }\n\n  \/\/ output file\n  if (resultFileName.length() != 0) {\n    std::ofstream fout(resultFileName, std::ios::out);\n    if (!fout) {\n      Loggers::error << \"Could not open output file: \" << resultFileName;\n      return 1;\n    }\n    Loggers::message.addStream(fout);\n  }\n\n  \/\/ invalid arguments\n  for (const auto& invalidArgument: po.getInvalidArguments()) {\n    Loggers::warning << \"WARNING: `\" << invalidArgument.arg << \"' is invalid argument: \" << invalidArgument.reason;\n  }\n\n  \/\/ initialization\n  BenchmarkSuite::initialize();\n\n  \/\/ execute\n  BenchmarkSuite::run();\n\n  return 0;\n}\n<commit_msg>Fix main function of benchmark<commit_after>\/* Main.cpp\n *\n * Kubo Ryosuke\n *\/\n\n#include \"common\/console\/Console.hpp\"\n#include \"common\/program_options\/ProgramOptions.hpp\"\n#include \"core\/util\/CoreUtil.hpp\"\n#include \"benchmark\/Benchmark.hpp\"\n#include \"logger\/Logger.hpp\"\n#include <fstream>\n\nusing namespace sunfish;\n\nint main(int argc, char** argv, char**) {\n  \/\/ initialize static objects\n  CoreUtil::initialize();\n\n  \/\/ program options\n  ProgramOptions po;\n  po.addOption(\"silent\", \"s\", \"silent mode\");\n  po.addOption(\"out\", \"o\", \"output file name\", true);\n  po.addOption(\"help\", \"h\", \"show this help\");\n  po.parse(argc, argv);\n\n  \/\/ --help or -h\n  if (po.has(\"help\")) {\n    std::cout << po.help();\n    return 0;\n  }\n\n  \/\/ if '--silent' or '-s' is NOT specified.\n  if (!po.has(\"silent\")) {\n    Loggers::error.addStream(std::cerr, ESC_SEQ_COLOR_RED, ESC_SEQ_COLOR_RESET);\n    Loggers::warning.addStream(std::cerr, ESC_SEQ_COLOR_YELLOW, ESC_SEQ_COLOR_RESET);\n    Loggers::message.addStream(std::cerr, ESC_SEQ_COLOR_GREEN, ESC_SEQ_COLOR_RESET);\n    Loggers::send.addStream(std::cerr, true, true, ESC_SEQ_COLOR_BLUE, ESC_SEQ_COLOR_RESET);\n    Loggers::receive.addStream(std::cerr, true, true, ESC_SEQ_COLOR_MAGENTA, ESC_SEQ_COLOR_RESET);\n#if !defined(NDEBUG)\n    Loggers::debug.addStream(std::cerr, ESC_SEQ_COLOR_CYAN, ESC_SEQ_COLOR_RESET);\n    Loggers::develop.addStream(std::cerr, ESC_SEQ_COLOR_WHITE, ESC_SEQ_COLOR_RESET);\n#endif \/\/ !defined(NDEBUG)\n  }\n\n  \/\/ the name of the result file\n  std::ofstream fout;\n  if (po.has(\"out\")) {\n    std::string resultFileName = po.getValue(\"out\");\n\n    fout.open(resultFileName, std::ios::out);\n    if (!fout) {\n      Loggers::error << \"Could not open output file: \" << resultFileName;\n      return 1;\n    }\n\n    Loggers::message.addStream(fout);\n  }\n\n  \/\/ invalid arguments\n  for (const auto& invalidArgument: po.getInvalidArguments()) {\n    Loggers::warning << \"WARNING: `\" << invalidArgument.arg << \"' is invalid argument: \" << invalidArgument.reason;\n  }\n\n  \/\/ initialization\n  BenchmarkSuite::initialize();\n\n  \/\/ execute\n  BenchmarkSuite::run();\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <iostream>\n#include <vector>\n#include <cstdint>\n#include <cstring>\n\n#include <ffi.h>\n#include <dlfcn.h>\n\nstruct Value {\n  ffi_type *type;\n  union {\n    uint8_t u8;\n    uint16_t u16;\n    uint32_t u32;\n    uint64_t u64;\n    int8_t s8;\n    int16_t s16;\n    int32_t s32;\n    int64_t s64;\n    float f;\n    double d;\n    void *ptr;\n  } value;\n};\n\nstd::ostream &operator<<(std::ostream &out, const Value &v) {\n  if (v.type == &ffi_type_uint8) {\n    out << v.value.u8;\n  } else if (v.type == &ffi_type_uint16) {\n    out << v.value.u16;\n  } else if (v.type == &ffi_type_uint32) {\n    out << v.value.u32;\n  } else if (v.type == &ffi_type_uint64) {\n    out << v.value.u64;\n  } else if (v.type == &ffi_type_sint8) {\n    out << v.value.s8;\n  } else if (v.type == &ffi_type_sint16) {\n    out << v.value.s16;\n  } else if (v.type == &ffi_type_sint32) {\n    out << v.value.s32;\n  } else if (v.type == &ffi_type_sint64) {\n    out << v.value.s64;\n  } else if (v.type == &ffi_type_float) {\n    out << v.value.f;\n  } else if (v.type == &ffi_type_double) {\n    out << v.value.d;\n  } else if (v.type == &ffi_type_pointer) {\n    out << v.value.ptr;\n  }\n  out << std::endl;\n  return out;\n}\n\nclass FFIStack {\n public:\n  void push(uint8_t v) {\n    stack_.push_back(Value{&ffi_type_uint8, {.u8 = v}});\n  }\n  void push(uint16_t v) {\n    stack_.push_back(Value{&ffi_type_uint16, {.u16 = v}});\n  }\n  void push(uint32_t v) {\n    stack_.push_back(Value{&ffi_type_uint32, {.u32 = v}});\n  }\n  void push(uint64_t v) {\n    stack_.push_back(Value{&ffi_type_uint64, {.u64 = v}});\n  }\n  void push(int8_t v) {\n    stack_.push_back(Value{&ffi_type_sint8, {.s8 = v}});\n  }\n  void push(int16_t v) {\n    stack_.push_back(Value{&ffi_type_sint16, {.s16 = v}});\n  }\n  void push(int32_t v) {\n    stack_.push_back(Value{&ffi_type_sint32, {.s32 = v}});\n  }\n  void push(int64_t v) {\n    stack_.push_back(Value{&ffi_type_sint64, {.s64 = v}});\n  }\n  void push(double v) {\n    stack_.push_back(Value{&ffi_type_double, {.d = v}});\n  }\n  void push(float v) {\n    stack_.push_back(Value{&ffi_type_float, {.f = v}});\n  }\n  void push(void *v) {\n    stack_.push_back(Value{&ffi_type_pointer, {.ptr = v}});\n  }\n  void push(Value &v) { stack_.push_back(v); }\n\n  Value pop() {\n    Value v = stack_.back();\n    stack_.pop_back();\n    return v;\n  }\n\n  Value peek() { return stack_.back(); }\n\n  Value &operator[](int i) { return stack_[stack_.size() - i - 1]; }\n\n  void dup() {\n    stack_.push_back(stack_.back());\n  }\n\n  size_t size() {\n    return stack_.size();\n  }\n\n private:\n  std::vector<Value> stack_;\n};\n\nclass Machine {\n public:\n  Machine(std::ostream &out) : out_{out} {};\n  ~Machine() {\n    for (auto &i : cifs_) {\n      delete i->arg_types;\n      delete i;\n    }\n    for (auto &i : libs_) {\n      dlclose(i);\n    }\n  };\n\n  FFIStack stack;\n\n  void pop() { out_ << stack.pop(); }\n\n  void peek() { out_ << stack.peek(); }\n\n  void dlopen() {\n    const char *name = static_cast<const char *>(stack.pop().value.ptr);\n    void *handle = ::dlopen(name, RTLD_LAZY);\n    stack.push(handle);\n    libs_.push_back(handle);\n  }\n\n  void dlsym() {\n    const char *name = static_cast<const char *>(stack.pop().value.ptr);\n    void *handle = stack.pop().value.ptr;\n    void *ptr = ::dlsym(handle, name);\n    stack.push(ptr);\n  }\n\n  void cif() {\n    ffi_cif *cif = new ffi_cif;\n    uint32_t nargs = stack.pop().value.u32;\n    ffi_type *rtype = stack.pop().type;\n    ffi_type **types = new ffi_type*[nargs];\n    for (uint32_t i = 0; i < nargs; i++) {\n      types[i] = stack.pop().type;\n    }\n    ffi_prep_cif(cif, FFI_DEFAULT_ABI, nargs, rtype, types);\n    stack.push(cif);\n    cifs_.push_back(cif);\n  }\n\n  void call() {\n    void (*function)() = reinterpret_cast<void (*)()>(stack.pop().value.ptr);\n    ffi_cif *cif = static_cast<ffi_cif *>(stack.pop().value.ptr);\n    int nargs = cif->nargs;\n    void *args[nargs];\n    Value result {cif->rtype, {0}};\n    for (int i = 0; i < nargs; i++) {\n      args[i] = &stack[i].value;\n    }\n    ffi_call(cif, function, &result.value, args);\n    for (int i = 0; i < nargs; i++) {\n      stack.pop();\n    }\n    stack.push(result);\n  }\n\n  void strlen() {\n    char *str = static_cast<char *>(stack.peek().value.ptr);\n    uint32_t size = std::strlen(str);\n    stack.push(size);\n  }\n\n  void dump() {\n    uint32_t size = stack.pop().value.u32;\n    char *data = static_cast<char *>(stack.peek().value.ptr);\n    out_.write(data, size);\n  }\n\n  void free() { delete static_cast<char *>(stack.pop().value.ptr); }\n\n  void size() {\n    uint32_t size = stack.size();\n    stack.push(size);\n  }\n\n private:\n  std::ostream &out_;\n  std::vector<ffi_cif *> cifs_;\n  std::vector<void *> libs_;\n};\n\nclass Reader {\n public:\n  Reader(Machine &vm, std::istream &in) : vm_{vm}, in_{in} {};\n\n  void read_uint8() {\n    uint8_t i;\n    in_ >> i;\n    vm_.stack.push(i);\n  }\n  void read_uint16() {\n    uint16_t i;\n    in_ >> i;\n    vm_.stack.push(i);\n  }\n  void read_uint32() {\n    uint32_t i;\n    in_ >> i;\n    vm_.stack.push(i);\n  }\n  void read_uint64() {\n    uint64_t i;\n    in_ >> i;\n    vm_.stack.push(i);\n  }\n\n  void read_sint8() {\n    int8_t i;\n    in_ >> i;\n    vm_.stack.push(i);\n  }\n  void read_sint16() {\n    int16_t i;\n    in_ >> i;\n    vm_.stack.push(i);\n  }\n  void read_sint32() {\n    int32_t i;\n    in_ >> i;\n    vm_.stack.push(i);\n  }\n  void read_sint64() {\n    int64_t i;\n    in_ >> i;\n    vm_.stack.push(i);\n  }\n\n  void read_float() {\n    float f;\n    in_ >> f;\n    vm_.stack.push(f);\n  }\n  void read_double() {\n    double d;\n    in_ >> d;\n    vm_.stack.push(d);\n  }\n\n  void read_pointer() {\n    void *ptr = nullptr;\n    in_ >> ptr;\n    vm_.stack.push(ptr);\n  }\n\n  void read(uint32_t size) {\n    char *buffer = new char[size];\n    in_.read(buffer, size);\n    vm_.stack.push(buffer);\n  }\n\n private:\n  Machine &vm_;\n  std::istream &in_;\n};\n\nint main() {\n  Machine vm{std::cout};\n  Reader reader{vm, std::cin};\n\n  while (!std::cin.eof()) {\n    int command = std::cin.get();\n    switch (command) {\n      \/* push signed integer *\/\n      case 'i' + 0: \/* i *\/\n        reader.read_sint8();\n        break;\n      case 'i' + 1: \/* j *\/\n        reader.read_sint16();\n        break;\n      case 'i' + 2: \/* k *\/\n        reader.read_sint32();\n        break;\n      case 'i' + 3: \/* l *\/\n        reader.read_sint64();\n        break;\n\n      \/* push unsigned integer *\/\n      case 'u' + 0: \/* u *\/\n        reader.read_uint8();\n        break;\n      case 'u' + 1: \/* v *\/\n        reader.read_uint16();\n        break;\n      case 'u' + 2: \/* w *\/\n        reader.read_uint32();\n        break;\n      case 'u' + 3: \/* x *\/\n        reader.read_uint64();\n        break;\n\n      \/* push float *\/\n      case 'f':\n        reader.read_float();\n        break;\n      case 'd':\n        reader.read_double();\n        break;\n\n      \/* push pointer *\/\n      case 'p':\n        reader.read_pointer();\n        break;\n\n      \/* peek *\/\n      case 'e':\n        vm.peek();\n        break;\n\n      \/* pop *\/\n      case 'o':\n        vm.pop();\n        break;\n\n      \/* call *\/\n      case 'c':\n        vm.call();\n        break;\n\n      \/* call *\/\n      case 'C':\n        vm.cif();\n        break;\n\n      \/* \"malloc\" *\/\n      case 'M':\n        reader.read(vm.stack.pop().value.u32);\n        break;\n\n      \/* free *\/\n      case 'F':\n        vm.free();\n        break;\n\n      \/* push NULL *\/\n      case 'N':\n        vm.stack.push(nullptr);\n        break;\n\n      \/* dl calls *\/\n      case 'O':\n        vm.dlopen();\n        break;\n      case 'S':\n        vm.dlsym();\n        break;\n\n      \/* strlen *\/\n      case 'L':\n        vm.strlen();\n        break;\n\n      \/* dump *\/\n      case 'D':\n        vm.dump();\n        break;\n\n      \/* duplicate top value *\/\n      case '!':\n        vm.stack.dup();\n        break;\n\n      \/* get stack size *\/\n      case '?':\n        vm.size();\n        break;\n\n      \/* no-op *\/\n      case ' ':\n      case -1:\n        break;\n\n      default:\n        std::cerr << \"invalid op: \" << static_cast<char>(command) << std::endl;\n        break;\n    }\n    std::cout.flush();\n  }\n\n  std::cout << std::endl;\n  return 0;\n}\n<commit_msg>Add a sentinel.<commit_after>#include <iostream>\n#include <vector>\n#include <cstdint>\n#include <cstring>\n\n#include <ffi.h>\n#include <dlfcn.h>\n\nstruct Value {\n  ffi_type *type;\n  union {\n    uint8_t u8;\n    uint16_t u16;\n    uint32_t u32;\n    uint64_t u64;\n    int8_t s8;\n    int16_t s16;\n    int32_t s32;\n    int64_t s64;\n    float f;\n    double d;\n    void *ptr;\n  } value;\n};\n\nstd::ostream &operator<<(std::ostream &out, const Value &v) {\n  if (v.type == &ffi_type_uint8) {\n    out << v.value.u8;\n  } else if (v.type == &ffi_type_uint16) {\n    out << v.value.u16;\n  } else if (v.type == &ffi_type_uint32) {\n    out << v.value.u32;\n  } else if (v.type == &ffi_type_uint64) {\n    out << v.value.u64;\n  } else if (v.type == &ffi_type_sint8) {\n    out << v.value.s8;\n  } else if (v.type == &ffi_type_sint16) {\n    out << v.value.s16;\n  } else if (v.type == &ffi_type_sint32) {\n    out << v.value.s32;\n  } else if (v.type == &ffi_type_sint64) {\n    out << v.value.s64;\n  } else if (v.type == &ffi_type_float) {\n    out << v.value.f;\n  } else if (v.type == &ffi_type_double) {\n    out << v.value.d;\n  } else if (v.type == &ffi_type_pointer) {\n    out << v.value.ptr;\n  }\n  out << \"\\n$\";\n  return out;\n}\n\nclass FFIStack {\n public:\n  void push(uint8_t v) {\n    stack_.push_back(Value{&ffi_type_uint8, {.u8 = v}});\n  }\n  void push(uint16_t v) {\n    stack_.push_back(Value{&ffi_type_uint16, {.u16 = v}});\n  }\n  void push(uint32_t v) {\n    stack_.push_back(Value{&ffi_type_uint32, {.u32 = v}});\n  }\n  void push(uint64_t v) {\n    stack_.push_back(Value{&ffi_type_uint64, {.u64 = v}});\n  }\n  void push(int8_t v) {\n    stack_.push_back(Value{&ffi_type_sint8, {.s8 = v}});\n  }\n  void push(int16_t v) {\n    stack_.push_back(Value{&ffi_type_sint16, {.s16 = v}});\n  }\n  void push(int32_t v) {\n    stack_.push_back(Value{&ffi_type_sint32, {.s32 = v}});\n  }\n  void push(int64_t v) {\n    stack_.push_back(Value{&ffi_type_sint64, {.s64 = v}});\n  }\n  void push(double v) {\n    stack_.push_back(Value{&ffi_type_double, {.d = v}});\n  }\n  void push(float v) {\n    stack_.push_back(Value{&ffi_type_float, {.f = v}});\n  }\n  void push(void *v) {\n    stack_.push_back(Value{&ffi_type_pointer, {.ptr = v}});\n  }\n  void push(Value &v) { stack_.push_back(v); }\n\n  Value pop() {\n    Value v = stack_.back();\n    stack_.pop_back();\n    return v;\n  }\n\n  Value peek() { return stack_.back(); }\n\n  Value &operator[](int i) { return stack_[stack_.size() - i - 1]; }\n\n  void dup() {\n    stack_.push_back(stack_.back());\n  }\n\n  size_t size() {\n    return stack_.size();\n  }\n\n private:\n  std::vector<Value> stack_;\n};\n\nclass Machine {\n public:\n  Machine(std::ostream &out) : out_{out} {};\n  ~Machine() {\n    for (auto &i : cifs_) {\n      delete i->arg_types;\n      delete i;\n    }\n    for (auto &i : libs_) {\n      dlclose(i);\n    }\n  };\n\n  FFIStack stack;\n\n  void pop() { out_ << stack.pop(); }\n\n  void peek() { out_ << stack.peek(); }\n\n  void dlopen() {\n    const char *name = static_cast<const char *>(stack.pop().value.ptr);\n    void *handle = ::dlopen(name, RTLD_LAZY);\n    stack.push(handle);\n    libs_.push_back(handle);\n  }\n\n  void dlsym() {\n    const char *name = static_cast<const char *>(stack.pop().value.ptr);\n    void *handle = stack.pop().value.ptr;\n    void *ptr = ::dlsym(handle, name);\n    stack.push(ptr);\n  }\n\n  void cif() {\n    ffi_cif *cif = new ffi_cif;\n    uint32_t nargs = stack.pop().value.u32;\n    ffi_type *rtype = stack.pop().type;\n    ffi_type **types = new ffi_type*[nargs];\n    for (uint32_t i = 0; i < nargs; i++) {\n      types[i] = stack.pop().type;\n    }\n    ffi_prep_cif(cif, FFI_DEFAULT_ABI, nargs, rtype, types);\n    stack.push(cif);\n    cifs_.push_back(cif);\n  }\n\n  void call() {\n    void (*function)() = reinterpret_cast<void (*)()>(stack.pop().value.ptr);\n    ffi_cif *cif = static_cast<ffi_cif *>(stack.pop().value.ptr);\n    int nargs = cif->nargs;\n    void *args[nargs];\n    Value result {cif->rtype, {0}};\n    for (int i = 0; i < nargs; i++) {\n      args[i] = &stack[i].value;\n    }\n    ffi_call(cif, function, &result.value, args);\n    for (int i = 0; i < nargs; i++) {\n      stack.pop();\n    }\n    stack.push(result);\n  }\n\n  void strlen() {\n    char *str = static_cast<char *>(stack.peek().value.ptr);\n    uint32_t size = std::strlen(str);\n    stack.push(size);\n  }\n\n  void dump() {\n    uint32_t size = stack.pop().value.u32;\n    char *data = static_cast<char *>(stack.peek().value.ptr);\n    out_.write(data, size);\n  }\n\n  void free() { delete static_cast<char *>(stack.pop().value.ptr); }\n\n  void size() {\n    uint32_t size = stack.size();\n    stack.push(size);\n  }\n\n private:\n  std::ostream &out_;\n  std::vector<ffi_cif *> cifs_;\n  std::vector<void *> libs_;\n};\n\nclass Reader {\n public:\n  Reader(Machine &vm, std::istream &in) : vm_{vm}, in_{in} {};\n\n  void read_uint8() {\n    uint8_t i;\n    in_ >> i;\n    vm_.stack.push(i);\n  }\n  void read_uint16() {\n    uint16_t i;\n    in_ >> i;\n    vm_.stack.push(i);\n  }\n  void read_uint32() {\n    uint32_t i;\n    in_ >> i;\n    vm_.stack.push(i);\n  }\n  void read_uint64() {\n    uint64_t i;\n    in_ >> i;\n    vm_.stack.push(i);\n  }\n\n  void read_sint8() {\n    int8_t i;\n    in_ >> i;\n    vm_.stack.push(i);\n  }\n  void read_sint16() {\n    int16_t i;\n    in_ >> i;\n    vm_.stack.push(i);\n  }\n  void read_sint32() {\n    int32_t i;\n    in_ >> i;\n    vm_.stack.push(i);\n  }\n  void read_sint64() {\n    int64_t i;\n    in_ >> i;\n    vm_.stack.push(i);\n  }\n\n  void read_float() {\n    float f;\n    in_ >> f;\n    vm_.stack.push(f);\n  }\n  void read_double() {\n    double d;\n    in_ >> d;\n    vm_.stack.push(d);\n  }\n\n  void read_pointer() {\n    void *ptr = nullptr;\n    in_ >> ptr;\n    vm_.stack.push(ptr);\n  }\n\n  void read(uint32_t size) {\n    char *buffer = new char[size];\n    in_.read(buffer, size);\n    vm_.stack.push(buffer);\n  }\n\n private:\n  Machine &vm_;\n  std::istream &in_;\n};\n\nint main() {\n  Machine vm{std::cout};\n  Reader reader{vm, std::cin};\n\n  while (!std::cin.eof()) {\n    int command = std::cin.get();\n    switch (command) {\n      \/* push signed integer *\/\n      case 'i' + 0: \/* i *\/\n        reader.read_sint8();\n        break;\n      case 'i' + 1: \/* j *\/\n        reader.read_sint16();\n        break;\n      case 'i' + 2: \/* k *\/\n        reader.read_sint32();\n        break;\n      case 'i' + 3: \/* l *\/\n        reader.read_sint64();\n        break;\n\n      \/* push unsigned integer *\/\n      case 'u' + 0: \/* u *\/\n        reader.read_uint8();\n        break;\n      case 'u' + 1: \/* v *\/\n        reader.read_uint16();\n        break;\n      case 'u' + 2: \/* w *\/\n        reader.read_uint32();\n        break;\n      case 'u' + 3: \/* x *\/\n        reader.read_uint64();\n        break;\n\n      \/* push float *\/\n      case 'f':\n        reader.read_float();\n        break;\n      case 'd':\n        reader.read_double();\n        break;\n\n      \/* push pointer *\/\n      case 'p':\n        reader.read_pointer();\n        break;\n\n      \/* peek *\/\n      case 'e':\n        vm.peek();\n        break;\n\n      \/* pop *\/\n      case 'o':\n        vm.pop();\n        break;\n\n      \/* call *\/\n      case 'c':\n        vm.call();\n        break;\n\n      \/* call *\/\n      case 'C':\n        vm.cif();\n        break;\n\n      \/* \"malloc\" *\/\n      case 'M':\n        reader.read(vm.stack.pop().value.u32);\n        break;\n\n      \/* free *\/\n      case 'F':\n        vm.free();\n        break;\n\n      \/* push NULL *\/\n      case 'N':\n        vm.stack.push(nullptr);\n        break;\n\n      \/* dl calls *\/\n      case 'O':\n        vm.dlopen();\n        break;\n      case 'S':\n        vm.dlsym();\n        break;\n\n      \/* strlen *\/\n      case 'L':\n        vm.strlen();\n        break;\n\n      \/* dump *\/\n      case 'D':\n        vm.dump();\n        break;\n\n      \/* duplicate top value *\/\n      case '!':\n        vm.stack.dup();\n        break;\n\n      \/* get stack size *\/\n      case '?':\n        vm.size();\n        break;\n\n      \/* no-op *\/\n      case ' ':\n      case -1:\n        break;\n\n      default:\n        std::cerr << \"invalid op: \" << static_cast<char>(command) << std::endl;\n        break;\n    }\n    std::cout.flush();\n  }\n\n  std::cout << std::endl;\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *  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 *\/\n\n#include <algorithm>\n\n#include \"third_party\/googletest\/src\/include\/gtest\/gtest.h\"\n\n#include \".\/vpx_dsp_rtcd.h\"\n#include \"vpx_ports\/vpx_timer.h\"\n\n#include \"test\/acm_random.h\"\n#include \"test\/register_state_check.h\"\n\nnamespace {\n\nusing ::libvpx_test::ACMRandom;\n\ntypedef void (*HadamardFunc)(const int16_t *a, ptrdiff_t a_stride,\n                             tran_low_t *b);\n\nvoid hadamard_loop(const int16_t *a, int a_stride, int16_t *out) {\n  int16_t b[8];\n  for (int i = 0; i < 8; i += 2) {\n    b[i + 0] = a[i * a_stride] + a[(i + 1) * a_stride];\n    b[i + 1] = a[i * a_stride] - a[(i + 1) * a_stride];\n  }\n  int16_t c[8];\n  for (int i = 0; i < 8; i += 4) {\n    c[i + 0] = b[i + 0] + b[i + 2];\n    c[i + 1] = b[i + 1] + b[i + 3];\n    c[i + 2] = b[i + 0] - b[i + 2];\n    c[i + 3] = b[i + 1] - b[i + 3];\n  }\n  out[0] = c[0] + c[4];\n  out[7] = c[1] + c[5];\n  out[3] = c[2] + c[6];\n  out[4] = c[3] + c[7];\n  out[2] = c[0] - c[4];\n  out[6] = c[1] - c[5];\n  out[1] = c[2] - c[6];\n  out[5] = c[3] - c[7];\n}\n\nvoid reference_hadamard8x8(const int16_t *a, int a_stride, tran_low_t *b) {\n  int16_t buf[64];\n  int16_t buf2[64];\n  for (int i = 0; i < 8; ++i) hadamard_loop(a + i, a_stride, buf + i * 8);\n  for (int i = 0; i < 8; ++i) hadamard_loop(buf + i, 8, buf2 + i * 8);\n\n  for (int i = 0; i < 64; ++i) b[i] = (tran_low_t)buf2[i];\n}\n\nvoid reference_hadamard16x16(const int16_t *a, int a_stride, tran_low_t *b) {\n  \/* The source is a 16x16 block. The destination is rearranged to 8x32.\n   * Input is 9 bit. *\/\n  reference_hadamard8x8(a + 0 + 0 * a_stride, a_stride, b + 0);\n  reference_hadamard8x8(a + 8 + 0 * a_stride, a_stride, b + 64);\n  reference_hadamard8x8(a + 0 + 8 * a_stride, a_stride, b + 128);\n  reference_hadamard8x8(a + 8 + 8 * a_stride, a_stride, b + 192);\n\n  \/* Overlay the 8x8 blocks and combine. *\/\n  for (int i = 0; i < 64; ++i) {\n    \/* 8x8 steps the range up to 15 bits. *\/\n    const tran_low_t a0 = b[0];\n    const tran_low_t a1 = b[64];\n    const tran_low_t a2 = b[128];\n    const tran_low_t a3 = b[192];\n\n    \/* Prevent the result from escaping int16_t. *\/\n    const tran_low_t b0 = (a0 + a1) >> 1;\n    const tran_low_t b1 = (a0 - a1) >> 1;\n    const tran_low_t b2 = (a2 + a3) >> 1;\n    const tran_low_t b3 = (a2 - a3) >> 1;\n\n    \/* Store a 16 bit value. *\/\n    b[0] = b0 + b2;\n    b[64] = b1 + b3;\n    b[128] = b0 - b2;\n    b[192] = b1 - b3;\n\n    ++b;\n  }\n}\n\nclass HadamardTestBase : public ::testing::TestWithParam<HadamardFunc> {\n public:\n  virtual void SetUp() {\n    h_func_ = GetParam();\n    rnd_.Reset(ACMRandom::DeterministicSeed());\n  }\n\n protected:\n  HadamardFunc h_func_;\n  ACMRandom rnd_;\n};\n\nvoid HadamardSpeedTest(const char *name, HadamardFunc const func,\n                       const int16_t *input, int stride, tran_low_t *output,\n                       int times) {\n  int i;\n  vpx_usec_timer timer;\n\n  vpx_usec_timer_start(&timer);\n  for (i = 0; i < times; ++i) {\n    func(input, stride, output);\n  }\n  vpx_usec_timer_mark(&timer);\n\n  const int elapsed_time = static_cast<int>(vpx_usec_timer_elapsed(&timer));\n  printf(\"%s[%12d runs]: %d us\\n\", name, times, elapsed_time);\n}\n\nclass Hadamard8x8Test : public HadamardTestBase {};\n\nvoid HadamardSpeedTest8x8(HadamardFunc const func, int times) {\n  DECLARE_ALIGNED(16, int16_t, input[64]);\n  DECLARE_ALIGNED(16, tran_low_t, output[64]);\n  memset(input, 1, sizeof(input));\n  HadamardSpeedTest(\"Hadamard8x8\", func, input, 8, output, times);\n}\n\nTEST_P(Hadamard8x8Test, CompareReferenceRandom) {\n  DECLARE_ALIGNED(16, int16_t, a[64]);\n  DECLARE_ALIGNED(16, tran_low_t, b[64]);\n  tran_low_t b_ref[64];\n  for (int i = 0; i < 64; ++i) {\n    a[i] = rnd_.Rand9Signed();\n  }\n  memset(b, 0, sizeof(b));\n  memset(b_ref, 0, sizeof(b_ref));\n\n  reference_hadamard8x8(a, 8, b_ref);\n  ASM_REGISTER_STATE_CHECK(h_func_(a, 8, b));\n\n  \/\/ The order of the output is not important. Sort before checking.\n  std::sort(b, b + 64);\n  std::sort(b_ref, b_ref + 64);\n  EXPECT_EQ(0, memcmp(b, b_ref, sizeof(b)));\n}\n\nTEST_P(Hadamard8x8Test, VaryStride) {\n  DECLARE_ALIGNED(16, int16_t, a[64 * 8]);\n  DECLARE_ALIGNED(16, tran_low_t, b[64]);\n  tran_low_t b_ref[64];\n  for (int i = 0; i < 64 * 8; ++i) {\n    a[i] = rnd_.Rand9Signed();\n  }\n\n  for (int i = 8; i < 64; i += 8) {\n    memset(b, 0, sizeof(b));\n    memset(b_ref, 0, sizeof(b_ref));\n\n    reference_hadamard8x8(a, i, b_ref);\n    ASM_REGISTER_STATE_CHECK(h_func_(a, i, b));\n\n    \/\/ The order of the output is not important. Sort before checking.\n    std::sort(b, b + 64);\n    std::sort(b_ref, b_ref + 64);\n    EXPECT_EQ(0, memcmp(b, b_ref, sizeof(b)));\n  }\n}\n\nTEST_P(Hadamard8x8Test, DISABLED_Speed) {\n  HadamardSpeedTest8x8(h_func_, 10);\n  HadamardSpeedTest8x8(h_func_, 10000);\n  HadamardSpeedTest8x8(h_func_, 10000000);\n}\n\nINSTANTIATE_TEST_CASE_P(C, Hadamard8x8Test,\n                        ::testing::Values(&vpx_hadamard_8x8_c));\n\n#if HAVE_SSE2\nINSTANTIATE_TEST_CASE_P(SSE2, Hadamard8x8Test,\n                        ::testing::Values(&vpx_hadamard_8x8_sse2));\n#endif  \/\/ HAVE_SSE2\n\n#if HAVE_SSSE3 && ARCH_X86_64\nINSTANTIATE_TEST_CASE_P(SSSE3, Hadamard8x8Test,\n                        ::testing::Values(&vpx_hadamard_8x8_ssse3));\n#endif  \/\/ HAVE_SSSE3 && ARCH_X86_64\n\n#if HAVE_NEON\nINSTANTIATE_TEST_CASE_P(NEON, Hadamard8x8Test,\n                        ::testing::Values(&vpx_hadamard_8x8_neon));\n#endif  \/\/ HAVE_NEON\n\n\/\/ TODO(jingning): Remove highbitdepth flag when the SIMD functions are\n\/\/ in place and turn on the unit test.\n#if !CONFIG_VP9_HIGHBITDEPTH\n#if HAVE_MSA\nINSTANTIATE_TEST_CASE_P(MSA, Hadamard8x8Test,\n                        ::testing::Values(&vpx_hadamard_8x8_msa));\n#endif  \/\/ HAVE_MSA\n#endif  \/\/ !CONFIG_VP9_HIGHBITDEPTH\n\n#if HAVE_VSX\nINSTANTIATE_TEST_CASE_P(VSX, Hadamard8x8Test,\n                        ::testing::Values(&vpx_hadamard_8x8_vsx));\n#endif  \/\/ HAVE_VSX\n\nclass Hadamard16x16Test : public HadamardTestBase {};\n\nvoid HadamardSpeedTest16x16(HadamardFunc const func, int times) {\n  DECLARE_ALIGNED(16, int16_t, input[256]);\n  DECLARE_ALIGNED(16, tran_low_t, output[256]);\n  memset(input, 1, sizeof(input));\n  HadamardSpeedTest(\"Hadamard16x16\", func, input, 16, output, times);\n}\n\nTEST_P(Hadamard16x16Test, CompareReferenceRandom) {\n  DECLARE_ALIGNED(16, int16_t, a[16 * 16]);\n  DECLARE_ALIGNED(16, tran_low_t, b[16 * 16]);\n  tran_low_t b_ref[16 * 16];\n  for (int i = 0; i < 16 * 16; ++i) {\n    a[i] = rnd_.Rand9Signed();\n  }\n  memset(b, 0, sizeof(b));\n  memset(b_ref, 0, sizeof(b_ref));\n\n  reference_hadamard16x16(a, 16, b_ref);\n  ASM_REGISTER_STATE_CHECK(h_func_(a, 16, b));\n\n  \/\/ The order of the output is not important. Sort before checking.\n  std::sort(b, b + 16 * 16);\n  std::sort(b_ref, b_ref + 16 * 16);\n  EXPECT_EQ(0, memcmp(b, b_ref, sizeof(b)));\n}\n\nTEST_P(Hadamard16x16Test, VaryStride) {\n  DECLARE_ALIGNED(16, int16_t, a[16 * 16 * 8]);\n  DECLARE_ALIGNED(16, tran_low_t, b[16 * 16]);\n  tran_low_t b_ref[16 * 16];\n  for (int i = 0; i < 16 * 16 * 8; ++i) {\n    a[i] = rnd_.Rand9Signed();\n  }\n\n  for (int i = 8; i < 64; i += 8) {\n    memset(b, 0, sizeof(b));\n    memset(b_ref, 0, sizeof(b_ref));\n\n    reference_hadamard16x16(a, i, b_ref);\n    ASM_REGISTER_STATE_CHECK(h_func_(a, i, b));\n\n    \/\/ The order of the output is not important. Sort before checking.\n    std::sort(b, b + 16 * 16);\n    std::sort(b_ref, b_ref + 16 * 16);\n    EXPECT_EQ(0, memcmp(b, b_ref, sizeof(b)));\n  }\n}\n\nTEST_P(Hadamard16x16Test, DISABLED_Speed) {\n  HadamardSpeedTest16x16(h_func_, 10);\n  HadamardSpeedTest16x16(h_func_, 10000);\n  HadamardSpeedTest16x16(h_func_, 10000000);\n}\n\nINSTANTIATE_TEST_CASE_P(C, Hadamard16x16Test,\n                        ::testing::Values(&vpx_hadamard_16x16_c));\n\n#if HAVE_SSE2\nINSTANTIATE_TEST_CASE_P(SSE2, Hadamard16x16Test,\n                        ::testing::Values(&vpx_hadamard_16x16_sse2));\n#endif  \/\/ HAVE_SSE2\n\n#if HAVE_AVX2\nINSTANTIATE_TEST_CASE_P(AVX2, Hadamard16x16Test,\n                        ::testing::Values(&vpx_hadamard_16x16_avx2));\n#endif  \/\/ HAVE_AVX2\n\n#if HAVE_VSX\nINSTANTIATE_TEST_CASE_P(VSX, Hadamard16x16Test,\n                        ::testing::Values(&vpx_hadamard_16x16_vsx));\n#endif  \/\/ HAVE_VSX\n\n#if HAVE_NEON\nINSTANTIATE_TEST_CASE_P(NEON, Hadamard16x16Test,\n                        ::testing::Values(&vpx_hadamard_16x16_neon));\n#endif  \/\/ HAVE_NEON\n\n#if !CONFIG_VP9_HIGHBITDEPTH\n#if HAVE_MSA\nINSTANTIATE_TEST_CASE_P(MSA, Hadamard16x16Test,\n                        ::testing::Values(&vpx_hadamard_16x16_msa));\n#endif  \/\/ HAVE_MSA\n#endif  \/\/ !CONFIG_VP9_HIGHBITDEPTH\n}  \/\/ namespace\n<commit_msg>VPX: Add Hadamard32x32Test<commit_after>\/*\n *  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 *\/\n\n#include <algorithm>\n\n#include \"third_party\/googletest\/src\/include\/gtest\/gtest.h\"\n\n#include \".\/vpx_dsp_rtcd.h\"\n#include \"vpx_ports\/vpx_timer.h\"\n\n#include \"test\/acm_random.h\"\n#include \"test\/register_state_check.h\"\n\nnamespace {\n\nusing ::libvpx_test::ACMRandom;\n\ntypedef void (*HadamardFunc)(const int16_t *a, ptrdiff_t a_stride,\n                             tran_low_t *b);\n\nvoid hadamard_loop(const int16_t *a, int a_stride, int16_t *out) {\n  int16_t b[8];\n  for (int i = 0; i < 8; i += 2) {\n    b[i + 0] = a[i * a_stride] + a[(i + 1) * a_stride];\n    b[i + 1] = a[i * a_stride] - a[(i + 1) * a_stride];\n  }\n  int16_t c[8];\n  for (int i = 0; i < 8; i += 4) {\n    c[i + 0] = b[i + 0] + b[i + 2];\n    c[i + 1] = b[i + 1] + b[i + 3];\n    c[i + 2] = b[i + 0] - b[i + 2];\n    c[i + 3] = b[i + 1] - b[i + 3];\n  }\n  out[0] = c[0] + c[4];\n  out[7] = c[1] + c[5];\n  out[3] = c[2] + c[6];\n  out[4] = c[3] + c[7];\n  out[2] = c[0] - c[4];\n  out[6] = c[1] - c[5];\n  out[1] = c[2] - c[6];\n  out[5] = c[3] - c[7];\n}\n\nvoid reference_hadamard8x8(const int16_t *a, int a_stride, tran_low_t *b) {\n  int16_t buf[64];\n  int16_t buf2[64];\n  for (int i = 0; i < 8; ++i) hadamard_loop(a + i, a_stride, buf + i * 8);\n  for (int i = 0; i < 8; ++i) hadamard_loop(buf + i, 8, buf2 + i * 8);\n\n  for (int i = 0; i < 64; ++i) b[i] = (tran_low_t)buf2[i];\n}\n\nvoid reference_hadamard16x16(const int16_t *a, int a_stride, tran_low_t *b) {\n  \/* The source is a 16x16 block. The destination is rearranged to 8x32.\n   * Input is 9 bit. *\/\n  reference_hadamard8x8(a + 0 + 0 * a_stride, a_stride, b + 0);\n  reference_hadamard8x8(a + 8 + 0 * a_stride, a_stride, b + 64);\n  reference_hadamard8x8(a + 0 + 8 * a_stride, a_stride, b + 128);\n  reference_hadamard8x8(a + 8 + 8 * a_stride, a_stride, b + 192);\n\n  \/* Overlay the 8x8 blocks and combine. *\/\n  for (int i = 0; i < 64; ++i) {\n    \/* 8x8 steps the range up to 15 bits. *\/\n    const tran_low_t a0 = b[0];\n    const tran_low_t a1 = b[64];\n    const tran_low_t a2 = b[128];\n    const tran_low_t a3 = b[192];\n\n    \/* Prevent the result from escaping int16_t. *\/\n    const tran_low_t b0 = (a0 + a1) >> 1;\n    const tran_low_t b1 = (a0 - a1) >> 1;\n    const tran_low_t b2 = (a2 + a3) >> 1;\n    const tran_low_t b3 = (a2 - a3) >> 1;\n\n    \/* Store a 16 bit value. *\/\n    b[0] = b0 + b2;\n    b[64] = b1 + b3;\n    b[128] = b0 - b2;\n    b[192] = b1 - b3;\n\n    ++b;\n  }\n}\n\nvoid reference_hadamard32x32(const int16_t *a, int a_stride, tran_low_t *b) {\n  reference_hadamard16x16(a + 0 + 0 * a_stride, a_stride, b + 0);\n  reference_hadamard16x16(a + 16 + 0 * a_stride, a_stride, b + 256);\n  reference_hadamard16x16(a + 0 + 16 * a_stride, a_stride, b + 512);\n  reference_hadamard16x16(a + 16 + 16 * a_stride, a_stride, b + 768);\n\n  for (int i = 0; i < 256; ++i) {\n    const tran_low_t a0 = b[0];\n    const tran_low_t a1 = b[256];\n    const tran_low_t a2 = b[512];\n    const tran_low_t a3 = b[768];\n\n    const tran_low_t b0 = (a0 + a1) >> 2;\n    const tran_low_t b1 = (a0 - a1) >> 2;\n    const tran_low_t b2 = (a2 + a3) >> 2;\n    const tran_low_t b3 = (a2 - a3) >> 2;\n\n    b[0] = b0 + b2;\n    b[256] = b1 + b3;\n    b[512] = b0 - b2;\n    b[768] = b1 - b3;\n\n    ++b;\n  }\n}\n\nclass HadamardTestBase : public ::testing::TestWithParam<HadamardFunc> {\n public:\n  virtual void SetUp() {\n    h_func_ = GetParam();\n    rnd_.Reset(ACMRandom::DeterministicSeed());\n  }\n\n  void ReferenceHadamard(const int16_t *a, int a_stride, tran_low_t *b,\n                         int bwh) {\n    if (bwh == 32)\n      reference_hadamard32x32(a, a_stride, b);\n    else if (bwh == 16)\n      reference_hadamard16x16(a, a_stride, b);\n    else\n      reference_hadamard8x8(a, a_stride, b);\n  }\n\n  template <int bwh>\n  void CompareReferenceRandom() {\n    const int kBlockSize = bwh * bwh;\n    DECLARE_ALIGNED(16, int16_t, a[kBlockSize]);\n    DECLARE_ALIGNED(16, tran_low_t, b[kBlockSize]);\n    tran_low_t b_ref[kBlockSize];\n    for (int i = 0; i < kBlockSize; ++i) {\n      a[i] = rnd_.Rand9Signed();\n    }\n    memset(b, 0, sizeof(b));\n    memset(b_ref, 0, sizeof(b_ref));\n\n    ReferenceHadamard(a, bwh, b_ref, bwh);\n    ASM_REGISTER_STATE_CHECK(h_func_(a, bwh, b));\n\n    \/\/ The order of the output is not important. Sort before checking.\n    std::sort(b, b + kBlockSize);\n    std::sort(b_ref, b_ref + kBlockSize);\n    EXPECT_EQ(0, memcmp(b, b_ref, sizeof(b)));\n  }\n\n  template <int bwh>\n  void VaryStride() {\n    const int kBlockSize = bwh * bwh;\n    DECLARE_ALIGNED(16, int16_t, a[kBlockSize * 8]);\n    DECLARE_ALIGNED(16, tran_low_t, b[kBlockSize]);\n    tran_low_t b_ref[kBlockSize];\n    for (int i = 0; i < kBlockSize * 8; ++i) {\n      a[i] = rnd_.Rand9Signed();\n    }\n\n    for (int i = 8; i < 64; i += 8) {\n      memset(b, 0, sizeof(b));\n      memset(b_ref, 0, sizeof(b_ref));\n\n      ReferenceHadamard(a, i, b_ref, bwh);\n      ASM_REGISTER_STATE_CHECK(h_func_(a, i, b));\n\n      \/\/ The order of the output is not important. Sort before checking.\n      std::sort(b, b + kBlockSize);\n      std::sort(b_ref, b_ref + kBlockSize);\n      EXPECT_EQ(0, memcmp(b, b_ref, sizeof(b)));\n    }\n  }\n\n protected:\n  HadamardFunc h_func_;\n  ACMRandom rnd_;\n};\n\nvoid HadamardSpeedTest(const char *name, HadamardFunc const func,\n                       const int16_t *input, int stride, tran_low_t *output,\n                       int times) {\n  int i;\n  vpx_usec_timer timer;\n\n  vpx_usec_timer_start(&timer);\n  for (i = 0; i < times; ++i) {\n    func(input, stride, output);\n  }\n  vpx_usec_timer_mark(&timer);\n\n  const int elapsed_time = static_cast<int>(vpx_usec_timer_elapsed(&timer));\n  printf(\"%s[%12d runs]: %d us\\n\", name, times, elapsed_time);\n}\n\nclass Hadamard8x8Test : public HadamardTestBase {};\n\nvoid HadamardSpeedTest8x8(HadamardFunc const func, int times) {\n  DECLARE_ALIGNED(16, int16_t, input[64]);\n  DECLARE_ALIGNED(16, tran_low_t, output[64]);\n  memset(input, 1, sizeof(input));\n  HadamardSpeedTest(\"Hadamard8x8\", func, input, 8, output, times);\n}\n\nTEST_P(Hadamard8x8Test, CompareReferenceRandom) { CompareReferenceRandom<8>(); }\n\nTEST_P(Hadamard8x8Test, VaryStride) { VaryStride<8>(); }\n\nTEST_P(Hadamard8x8Test, DISABLED_Speed) {\n  HadamardSpeedTest8x8(h_func_, 10);\n  HadamardSpeedTest8x8(h_func_, 10000);\n  HadamardSpeedTest8x8(h_func_, 10000000);\n}\n\nINSTANTIATE_TEST_CASE_P(C, Hadamard8x8Test,\n                        ::testing::Values(&vpx_hadamard_8x8_c));\n\n#if HAVE_SSE2\nINSTANTIATE_TEST_CASE_P(SSE2, Hadamard8x8Test,\n                        ::testing::Values(&vpx_hadamard_8x8_sse2));\n#endif  \/\/ HAVE_SSE2\n\n#if HAVE_SSSE3 && ARCH_X86_64\nINSTANTIATE_TEST_CASE_P(SSSE3, Hadamard8x8Test,\n                        ::testing::Values(&vpx_hadamard_8x8_ssse3));\n#endif  \/\/ HAVE_SSSE3 && ARCH_X86_64\n\n#if HAVE_NEON\nINSTANTIATE_TEST_CASE_P(NEON, Hadamard8x8Test,\n                        ::testing::Values(&vpx_hadamard_8x8_neon));\n#endif  \/\/ HAVE_NEON\n\n\/\/ TODO(jingning): Remove highbitdepth flag when the SIMD functions are\n\/\/ in place and turn on the unit test.\n#if !CONFIG_VP9_HIGHBITDEPTH\n#if HAVE_MSA\nINSTANTIATE_TEST_CASE_P(MSA, Hadamard8x8Test,\n                        ::testing::Values(&vpx_hadamard_8x8_msa));\n#endif  \/\/ HAVE_MSA\n#endif  \/\/ !CONFIG_VP9_HIGHBITDEPTH\n\n#if HAVE_VSX\nINSTANTIATE_TEST_CASE_P(VSX, Hadamard8x8Test,\n                        ::testing::Values(&vpx_hadamard_8x8_vsx));\n#endif  \/\/ HAVE_VSX\n\nclass Hadamard16x16Test : public HadamardTestBase {};\n\nvoid HadamardSpeedTest16x16(HadamardFunc const func, int times) {\n  DECLARE_ALIGNED(16, int16_t, input[256]);\n  DECLARE_ALIGNED(16, tran_low_t, output[256]);\n  memset(input, 1, sizeof(input));\n  HadamardSpeedTest(\"Hadamard16x16\", func, input, 16, output, times);\n}\n\nTEST_P(Hadamard16x16Test, CompareReferenceRandom) {\n  CompareReferenceRandom<16>();\n}\n\nTEST_P(Hadamard16x16Test, VaryStride) { VaryStride<16>(); }\n\nTEST_P(Hadamard16x16Test, DISABLED_Speed) {\n  HadamardSpeedTest16x16(h_func_, 10);\n  HadamardSpeedTest16x16(h_func_, 10000);\n  HadamardSpeedTest16x16(h_func_, 10000000);\n}\n\nINSTANTIATE_TEST_CASE_P(C, Hadamard16x16Test,\n                        ::testing::Values(&vpx_hadamard_16x16_c));\n\n#if HAVE_SSE2\nINSTANTIATE_TEST_CASE_P(SSE2, Hadamard16x16Test,\n                        ::testing::Values(&vpx_hadamard_16x16_sse2));\n#endif  \/\/ HAVE_SSE2\n\n#if HAVE_AVX2\nINSTANTIATE_TEST_CASE_P(AVX2, Hadamard16x16Test,\n                        ::testing::Values(&vpx_hadamard_16x16_avx2));\n#endif  \/\/ HAVE_AVX2\n\n#if HAVE_VSX\nINSTANTIATE_TEST_CASE_P(VSX, Hadamard16x16Test,\n                        ::testing::Values(&vpx_hadamard_16x16_vsx));\n#endif  \/\/ HAVE_VSX\n\n#if HAVE_NEON\nINSTANTIATE_TEST_CASE_P(NEON, Hadamard16x16Test,\n                        ::testing::Values(&vpx_hadamard_16x16_neon));\n#endif  \/\/ HAVE_NEON\n\n#if !CONFIG_VP9_HIGHBITDEPTH\n#if HAVE_MSA\nINSTANTIATE_TEST_CASE_P(MSA, Hadamard16x16Test,\n                        ::testing::Values(&vpx_hadamard_16x16_msa));\n#endif  \/\/ HAVE_MSA\n#endif  \/\/ !CONFIG_VP9_HIGHBITDEPTH\n\nclass Hadamard32x32Test : public HadamardTestBase {};\n\nTEST_P(Hadamard32x32Test, CompareReferenceRandom) {\n  CompareReferenceRandom<32>();\n}\n\nTEST_P(Hadamard32x32Test, VaryStride) { VaryStride<32>(); }\n\nINSTANTIATE_TEST_CASE_P(C, Hadamard32x32Test,\n                        ::testing::Values(&vpx_hadamard_32x32_c));\n}  \/\/ namespace\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *            Copyright 2009-2020 The VOTCA Development Team\n *                       (http:\/\/www.votca.org)\n *\n *      Licensed under the Apache License, Version 2.0 (the \"License\")\n *\n * You may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *              http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n\/\/ Local VOTCA includes\n#include \"votca\/xtp\/aomatrix.h\"\n#include \"votca\/xtp\/aotransform.h\"\n\nnamespace votca {\nnamespace xtp {\n\nvoid AOOverlap::Fill(const AOBasis& aobasis) {\n  libint2::initialize();\n  _aomatrix = computeOneBodyIntegrals<libint2::Operator::overlap>(aobasis)[0];\n  libint2::finalize();\n}\n\nEigen::MatrixXd AOOverlap::singleShellOverlap(const AOShell& shell) const {\n  libint2::initialize();\n  libint2::Operator obtype = libint2::Operator::overlap;\n  libint2::Engine engine(obtype, shell.getSize(),\n                         static_cast<int>(shell.getL()), 0);\n\n  const auto& buf = engine.results();\n\n  libint2::Shell s = shell.LibintShell();\n  engine.compute(s, s);\n\n  Eigen::Map<const MatrixLibInt> buf_mat(buf[0], shell.getSize(),\n                                         shell.getSize());\n  libint2::finalize();\n  Eigen::MatrixXd result(buf_mat);\n  return buf_mat;\n}\n\nEigen::MatrixXd AOOverlap::Pseudo_InvSqrt(double etol) {\n  Eigen::SelfAdjointEigenSolver<Eigen::MatrixXd> es(_aomatrix);\n  smallestEigenvalue = es.eigenvalues()(0);\n  Eigen::VectorXd diagonal = Eigen::VectorXd::Zero(es.eigenvalues().size());\n  removedfunctions = 0;\n  for (Index i = 0; i < diagonal.size(); ++i) {\n    if (es.eigenvalues()(i) < etol) {\n      removedfunctions++;\n    } else {\n      diagonal(i) = 1.0 \/ std::sqrt(es.eigenvalues()(i));\n    }\n  }\n\n  return es.eigenvectors() * diagonal.asDiagonal() *\n         es.eigenvectors().transpose();\n}\n\nEigen::MatrixXd AOOverlap::Sqrt() {\n  Eigen::SelfAdjointEigenSolver<Eigen::MatrixXd> es(_aomatrix);\n  smallestEigenvalue = es.eigenvalues()(0);\n  return es.operatorSqrt();\n}\n\n}  \/\/ namespace xtp\n}  \/\/ namespace votca\n<commit_msg>fixed normalisation<commit_after>\/*\n *            Copyright 2009-2020 The VOTCA Development Team\n *                       (http:\/\/www.votca.org)\n *\n *      Licensed under the Apache License, Version 2.0 (the \"License\")\n *\n * You may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *              http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n\/\/ Local VOTCA includes\n#include \"votca\/xtp\/aomatrix.h\"\n#include \"votca\/xtp\/aotransform.h\"\n\nnamespace votca {\nnamespace xtp {\n\nvoid AOOverlap::Fill(const AOBasis& aobasis) {\n  libint2::initialize();\n  _aomatrix = computeOneBodyIntegrals<libint2::Operator::overlap>(aobasis)[0];\n  libint2::finalize();\n}\n\nEigen::MatrixXd AOOverlap::singleShellOverlap(const AOShell& shell) const {\n  libint2::Shell::do_enforce_unit_normalization(false);\n  libint2::initialize();\n  libint2::Operator obtype = libint2::Operator::overlap;\n  libint2::Engine engine(obtype, shell.getSize(),\n                         static_cast<int>(shell.getL()), 0);\n\n  const auto& buf = engine.results();\n\n  libint2::Shell s = shell.LibintShell();\n  engine.compute(s, s);\n\n  Eigen::Map<const MatrixLibInt> buf_mat(buf[0], shell.getNumFunc(),\n                                         shell.getNumFunc());\n\n  libint2::finalize();\n  return buf_mat;\n}\n\nEigen::MatrixXd AOOverlap::Pseudo_InvSqrt(double etol) {\n  Eigen::SelfAdjointEigenSolver<Eigen::MatrixXd> es(_aomatrix);\n  smallestEigenvalue = es.eigenvalues()(0);\n  Eigen::VectorXd diagonal = Eigen::VectorXd::Zero(es.eigenvalues().size());\n  removedfunctions = 0;\n  for (Index i = 0; i < diagonal.size(); ++i) {\n    if (es.eigenvalues()(i) < etol) {\n      removedfunctions++;\n    } else {\n      diagonal(i) = 1.0 \/ std::sqrt(es.eigenvalues()(i));\n    }\n  }\n\n  return es.eigenvectors() * diagonal.asDiagonal() *\n         es.eigenvectors().transpose();\n}\n\nEigen::MatrixXd AOOverlap::Sqrt() {\n  Eigen::SelfAdjointEigenSolver<Eigen::MatrixXd> es(_aomatrix);\n  smallestEigenvalue = es.eigenvalues()(0);\n  return es.operatorSqrt();\n}\n\n}  \/\/ namespace xtp\n}  \/\/ namespace votca\n<|endoftext|>"}
{"text":"<commit_before>\/* This file is part of QJson\n *\n * Copyright (C) 2008 Flavio Castelli <flavio.castelli@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 \"qjson_debug.h\"\n#include \"json_scanner.h\"\n#include \"json_parser.hh\"\n\n#include <ctype.h>\n\n#include <QtCore\/QDebug>\n#include <QtCore\/QRegExp>\n\n#include <cassert>\n\nbool ishexnstring(const QString& string) {\n  for (int i = 0; i < string.length(); i++) {\n    if (isxdigit(string[i] == 0))\n      return false;\n  }\n  return true;\n}\n\nJSonScanner::JSonScanner(QIODevice* io)\n  : m_io (io)\n{\n  m_quotmarkClosed = true;\n  m_quotmarkCount = 0;\n}\n\nstatic QString unescape( const QByteArray& ba, bool* ok ) {\n  assert( ok );\n  *ok = false;\n  QString res;\n  QByteArray seg;\n  bool bs = false;\n  for ( int i = 0, size = ba.size(); i < size; ++i ) {\n    const char ch = ba[i];\n    if ( !bs ) {\n      if ( ch == '\\\\' )\n        bs = true;\n      else\n        seg += ch;\n    } else {\n      bs = false;\n      switch ( ch ) {\n        case 'b':\n          seg += '\\b';\n          break;\n        case 'f':\n          seg += '\\f';\n          break;\n        case 'n':\n          seg += '\\n';\n          break;\n        case 'r':\n          seg += '\\r';\n          break;\n        case 't':\n          seg += '\\t';\n          break;\n        case 'u':\n        {\n          res += QString::fromUtf8( seg );\n          seg.clear();\n\n          if ( i > size - 5 ) {\n            \/\/error\n            return QString();\n          }\n\n          const QString hex_digit1 = QString::fromUtf8( ba.mid( i + 1, 2 ) );\n          const QString hex_digit2 = QString::fromUtf8( ba.mid( i + 3, 2 ) );\n          i += 4;\n\n          if ( !ishexnstring( hex_digit1 ) || !ishexnstring( hex_digit2 ) ) {\n            qCritical() << \"Not an hex string:\" << hex_digit1 << hex_digit2;\n            return QString();\n          }\n          bool hexOk;\n          const ushort hex_code1 = hex_digit1.toShort( &hexOk, 16 );\n          if (!hexOk) {\n            qCritical() << \"error converting hex value to short:\" << hex_digit1;\n            return QString();\n          }\n          const ushort hex_code2 = hex_digit2.toShort( &hexOk, 16 );\n          if (!hexOk) {\n            qCritical() << \"error converting hex value to short:\" << hex_digit2;\n            return QString();\n          }\n\n          res += QChar(hex_code2, hex_code1);\n          break;\n        }\n        case '\\\\':\n          seg  += '\\\\';\n          break;\n        default:\n          seg += ch;\n          break;\n      }\n    }\n  }\n  res += QString::fromUtf8( seg );\n  *ok = true;\n  return res;\n}\n\nint JSonScanner::yylex(YYSTYPE* yylval, yy::location *yylloc)\n{\n  char ch;\n  \n  if (!m_io->isOpen()) {\n    qCritical() << \"JSonScanner::yylex - io device is not open\";\n    return -1;\n  }\n\n  yylloc->step();\n\n  do {\n    bool ret;\n    if (m_io->atEnd()) {\n      qjsonDebug() << \"JSonScanner::yylex - yy::json_parser::token::END\";\n      return yy::json_parser::token::END;\n    }\n    else\n      ret = m_io->getChar(&ch);\n\n    if (!ret) {\n      qCritical() << \"JSonScanner::yylex - error reading from io device\";\n      return -1;\n    }\n\n    qjsonDebug() << \"JSonScanner::yylex - got |\" << ch << \"|\";\n    \n    yylloc->columns();\n    \n    if (ch == '\\n' || ch == '\\r')\n      yylloc->lines();\n      \n  } while (m_quotmarkClosed && (isspace(ch) != 0));\n\n  if (m_quotmarkClosed && ((ch == 't') || (ch == 'T')\n      || (ch == 'n') || (ch == 'N'))) {\n    \/\/ check true & null value\n    const QByteArray buf = m_io->peek(3).toLower();\n\n    if (buf.length() == 3) {\n      if (buf == \"rue\") {\n        m_io->read (3);\n        yylloc->columns(3);\n        qjsonDebug() << \"JSonScanner::yylex - TRUE_VAL\";\n        return yy::json_parser::token::TRUE_VAL;\n      }\n      else if (buf == \"ull\") {\n        m_io->read (3);\n        yylloc->columns(3);\n        qjsonDebug() << \"JSonScanner::yylex - NULL_VAL\";\n        return yy::json_parser::token::NULL_VAL;\n      }\n    }\n  }\n  else if (m_quotmarkClosed && ((ch == 'f') || (ch == 'F'))) {\n    \/\/ check false value\n    const QByteArray buf = m_io->peek(4).toLower();\n    if (buf.length() == 4) {\n      if (buf == \"alse\") {\n        m_io->read (4);\n        yylloc->columns(4);\n        qjsonDebug() << \"JSonScanner::yylex - FALSE_VAL\";\n        return yy::json_parser::token::FALSE_VAL;\n      }\n    }\n  }\n  else if (m_quotmarkClosed && ((ch == 'e') || (ch == 'E'))) {\n    QByteArray ret(1, ch);\n    const QByteArray buf = m_io->peek(1);\n    if (!buf.isEmpty()) {\n      if ((buf[0] == '+' ) || (buf[0] == '-' )) {\n        ret += m_io->read (1);  \n        yylloc->columns();\n      }\n    }\n    *yylval = QVariant(QString::fromUtf8(ret));\n    return yy::json_parser::token::E;\n  }\n  \n  if (ch != '\"' && !m_quotmarkClosed) {\n    \/\/ we're inside a \" \" block\n    QByteArray raw;\n    raw += ch;\n    char prevCh = ch;\n    bool escape_on = (ch == '\\\\') ? true : false;\n\n    while ( true ) {\n      char nextCh;\n      m_io->peek(&nextCh, 1);\n      if ( !escape_on && nextCh == '\\\"' ) {\n        bool ok;\n        const QString str = unescape( raw, &ok );\n        *yylval = ok ? str : QString();\n        return ok ? yy::json_parser::token::STRING : -1;\n      }\n#if 0\n      if ( prevCh == '\\\\' && nextCh != '\"' && nextCh != '\\\\' && nextCh != '\/' &&\n           nextCh != 'b' && nextCh != 'f' && nextCh != 'n' &&\n           nextCh != 'r' && nextCh != 't' && nextCh != 'u') {\n        qjsonDebug() << \"Just read\" << nextCh;\n        qjsonDebug() << \"JSonScanner::yylex - error decoding escaped sequence\";\n        return -1;\n       }\n#endif\n      m_io->read(1); \/\/ consume\n      raw += nextCh;\n      prevCh = nextCh;\n      if (escape_on)\n        escape_on = false;\n      else\n        escape_on = (prevCh == '\\\\') ? true : false;\n#if 0\n      if (nextCh == '\\\\') {\n        char buf;\n        if (m_io->getChar (&buf)) {\n          yylloc->columns();\n          if (((buf != '\"') && (buf != '\\\\') && (buf != '\/') &&\n              (buf != 'b') && (buf != 'f') && (buf != 'n') &&\n              (buf != 'r') && (buf != 't') && (buf != 'u'))) {\n                qjsonDebug() << \"Just read\" << buf;\n                qjsonDebug() << \"JSonScanner::yylex - error decoding escaped sequence\";\n                return -1;\n          }\n        } else {\n          qCritical() << \"JSonScanner::yylex - error decoding escaped sequence : io error\";\n          return -1;\n        }\n      }\n#endif\n    }\n  }\n  else if (isdigit(ch) != 0 && m_quotmarkClosed) {\n    *yylval = QVariant(QString::fromLatin1(QByteArray(&ch,1)));\n    qjsonDebug() << \"JSonScanner::yylex - yy::json_parser::token::DIGIT\";\n    return yy::json_parser::token::DIGIT;\n  }\n  else if (isalnum(ch) != 0) {\n    *yylval = QVariant(QString(QChar::fromLatin1(ch)));\n    qjsonDebug() << \"JSonScanner::yylex - yy::json_parser::token::WORD (\"\n             << ch << \")\";\n    return yy::json_parser::token::STRING;\n  }\n  else if (ch == ':') {\n    \/\/ set yylval\n    qjsonDebug() << \"JSonScanner::yylex - yy::json_parser::token::COLON\";\n    return yy::json_parser::token::COLON;\n  }\n  else if (ch == '\"') {\n    \/\/ yy::json_parser::token::QUOTMARK (\")\n\n    \/\/ set yylval\n    m_quotmarkCount++;\n    if (m_quotmarkCount %2 == 0) {\n      m_quotmarkClosed = true;\n      m_quotmarkCount = 0;\n      qjsonDebug() << \"JSonScanner::yylex - yy::json_parser::token::QUOTMARKCLOSE\";\n      return yy::json_parser::token::QUOTMARKCLOSE;\n    }\n    else {\n      m_quotmarkClosed = false;\n      qjsonDebug() << \"JSonScanner::yylex - yy::json_parser::token::QUOTMARKOPEN\";\n      return yy::json_parser::token::QUOTMARKOPEN;\n    }\n  }\n  else if (ch == ',') {\n    qjsonDebug() << \"JSonScanner::yylex - yy::json_parser::token::COMMA\";\n    return yy::json_parser::token::COMMA;\n  }\n  else if (ch == '.') {\n    qjsonDebug() << \"JSonScanner::yylex - yy::json_parser::token::DOT\";\n    return yy::json_parser::token::DOT;\n  }\n  else if (ch == '-') {\n    qjsonDebug() << \"JSonScanner::yylex - yy::json_parser::token::MINUS\";\n    return yy::json_parser::token::MINUS;\n  }\n  else if (ch == '[') {\n    qjsonDebug() << \"JSonScanner::yylex - yy::json_parser::token::SQUARE_BRACKET_OPEN\";\n    return yy::json_parser::token::SQUARE_BRACKET_OPEN;\n  }\n  else if (ch == ']') {\n    qjsonDebug() << \"JSonScanner::yylex - yy::json_parser::token::SQUARE_BRACKET_CLOSE\";\n    return yy::json_parser::token::SQUARE_BRACKET_CLOSE;\n  }\n  else if (ch == '{') {\n    qjsonDebug() << \"JSonScanner::yylex - yy::json_parser::token::CURLY_BRACKET_OPEN\";\n    return yy::json_parser::token::CURLY_BRACKET_OPEN;\n  }\n  else if (ch == '}') {\n    qjsonDebug() << \"JSonScanner::yylex - yy::json_parser::token::CURLY_BRACKET_CLOSE\";\n    return yy::json_parser::token::CURLY_BRACKET_CLOSE;\n  }\n\n  \/\/unknown char!\n  \/\/TODO yyerror?\n  qCritical() << \"JSonScanner::yylex - unknown char, returning -1\";\n  return -1;\n}\n\n\n<commit_msg>prevent infinite loop inside parser<commit_after>\/* This file is part of QJson\n *\n * Copyright (C) 2008 Flavio Castelli <flavio.castelli@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 \"qjson_debug.h\"\n#include \"json_scanner.h\"\n#include \"json_parser.hh\"\n\n#include <ctype.h>\n\n#include <QtCore\/QDebug>\n#include <QtCore\/QRegExp>\n\n#include <cassert>\n\nbool ishexnstring(const QString& string) {\n  for (int i = 0; i < string.length(); i++) {\n    if (isxdigit(string[i] == 0))\n      return false;\n  }\n  return true;\n}\n\nJSonScanner::JSonScanner(QIODevice* io)\n  : m_io (io)\n{\n  m_quotmarkClosed = true;\n  m_quotmarkCount = 0;\n}\n\nstatic QString unescape( const QByteArray& ba, bool* ok ) {\n  assert( ok );\n  *ok = false;\n  QString res;\n  QByteArray seg;\n  bool bs = false;\n  for ( int i = 0, size = ba.size(); i < size; ++i ) {\n    const char ch = ba[i];\n    if ( !bs ) {\n      if ( ch == '\\\\' )\n        bs = true;\n      else\n        seg += ch;\n    } else {\n      bs = false;\n      switch ( ch ) {\n        case 'b':\n          seg += '\\b';\n          break;\n        case 'f':\n          seg += '\\f';\n          break;\n        case 'n':\n          seg += '\\n';\n          break;\n        case 'r':\n          seg += '\\r';\n          break;\n        case 't':\n          seg += '\\t';\n          break;\n        case 'u':\n        {\n          res += QString::fromUtf8( seg );\n          seg.clear();\n\n          if ( i > size - 5 ) {\n            \/\/error\n            return QString();\n          }\n\n          const QString hex_digit1 = QString::fromUtf8( ba.mid( i + 1, 2 ) );\n          const QString hex_digit2 = QString::fromUtf8( ba.mid( i + 3, 2 ) );\n          i += 4;\n\n          if ( !ishexnstring( hex_digit1 ) || !ishexnstring( hex_digit2 ) ) {\n            qCritical() << \"Not an hex string:\" << hex_digit1 << hex_digit2;\n            return QString();\n          }\n          bool hexOk;\n          const ushort hex_code1 = hex_digit1.toShort( &hexOk, 16 );\n          if (!hexOk) {\n            qCritical() << \"error converting hex value to short:\" << hex_digit1;\n            return QString();\n          }\n          const ushort hex_code2 = hex_digit2.toShort( &hexOk, 16 );\n          if (!hexOk) {\n            qCritical() << \"error converting hex value to short:\" << hex_digit2;\n            return QString();\n          }\n\n          res += QChar(hex_code2, hex_code1);\n          break;\n        }\n        case '\\\\':\n          seg  += '\\\\';\n          break;\n        default:\n          seg += ch;\n          break;\n      }\n    }\n  }\n  res += QString::fromUtf8( seg );\n  *ok = true;\n  return res;\n}\n\nint JSonScanner::yylex(YYSTYPE* yylval, yy::location *yylloc)\n{\n  char ch;\n  \n  if (!m_io->isOpen()) {\n    qCritical() << \"JSonScanner::yylex - io device is not open\";\n    return -1;\n  }\n\n  yylloc->step();\n\n  do {\n    bool ret;\n    if (m_io->atEnd()) {\n      qjsonDebug() << \"JSonScanner::yylex - yy::json_parser::token::END\";\n      return yy::json_parser::token::END;\n    }\n    else\n      ret = m_io->getChar(&ch);\n\n    if (!ret) {\n      qCritical() << \"JSonScanner::yylex - error reading from io device\";\n      return -1;\n    }\n\n    qjsonDebug() << \"JSonScanner::yylex - got |\" << ch << \"|\";\n    \n    yylloc->columns();\n    \n    if (ch == '\\n' || ch == '\\r')\n      yylloc->lines();\n      \n  } while (m_quotmarkClosed && (isspace(ch) != 0));\n\n  if (m_quotmarkClosed && ((ch == 't') || (ch == 'T')\n      || (ch == 'n') || (ch == 'N'))) {\n    \/\/ check true & null value\n    const QByteArray buf = m_io->peek(3).toLower();\n\n    if (buf.length() == 3) {\n      if (buf == \"rue\") {\n        m_io->read (3);\n        yylloc->columns(3);\n        qjsonDebug() << \"JSonScanner::yylex - TRUE_VAL\";\n        return yy::json_parser::token::TRUE_VAL;\n      }\n      else if (buf == \"ull\") {\n        m_io->read (3);\n        yylloc->columns(3);\n        qjsonDebug() << \"JSonScanner::yylex - NULL_VAL\";\n        return yy::json_parser::token::NULL_VAL;\n      }\n    }\n  }\n  else if (m_quotmarkClosed && ((ch == 'f') || (ch == 'F'))) {\n    \/\/ check false value\n    const QByteArray buf = m_io->peek(4).toLower();\n    if (buf.length() == 4) {\n      if (buf == \"alse\") {\n        m_io->read (4);\n        yylloc->columns(4);\n        qjsonDebug() << \"JSonScanner::yylex - FALSE_VAL\";\n        return yy::json_parser::token::FALSE_VAL;\n      }\n    }\n  }\n  else if (m_quotmarkClosed && ((ch == 'e') || (ch == 'E'))) {\n    QByteArray ret(1, ch);\n    const QByteArray buf = m_io->peek(1);\n    if (!buf.isEmpty()) {\n      if ((buf[0] == '+' ) || (buf[0] == '-' )) {\n        ret += m_io->read (1);  \n        yylloc->columns();\n      }\n    }\n    *yylval = QVariant(QString::fromUtf8(ret));\n    return yy::json_parser::token::E;\n  }\n  \n  if (ch != '\"' && !m_quotmarkClosed) {\n    \/\/ we're inside a \" \" block\n    QByteArray raw;\n    raw += ch;\n    char prevCh = ch;\n    bool escape_on = (ch == '\\\\') ? true : false;\n\n    while ( true ) {\n      char nextCh;\n      qint64 ret = m_io->peek(&nextCh, 1);\n      if (ret != 1) {\n        if (m_io->atEnd())\n          return yy::json_parser::token::END;\n        else\n          return -1;\n      } else if ( !escape_on && nextCh == '\\\"' ) {\n        bool ok;\n        const QString str = unescape( raw, &ok );\n        *yylval = ok ? str : QString();\n        return ok ? yy::json_parser::token::STRING : -1;\n      }\n#if 0\n      if ( prevCh == '\\\\' && nextCh != '\"' && nextCh != '\\\\' && nextCh != '\/' &&\n           nextCh != 'b' && nextCh != 'f' && nextCh != 'n' &&\n           nextCh != 'r' && nextCh != 't' && nextCh != 'u') {\n        qjsonDebug() << \"Just read\" << nextCh;\n        qjsonDebug() << \"JSonScanner::yylex - error decoding escaped sequence\";\n        return -1;\n       }\n#endif\n      m_io->read(1); \/\/ consume\n      raw += nextCh;\n      prevCh = nextCh;\n      if (escape_on)\n        escape_on = false;\n      else\n        escape_on = (prevCh == '\\\\') ? true : false;\n#if 0\n      if (nextCh == '\\\\') {\n        char buf;\n        if (m_io->getChar (&buf)) {\n          yylloc->columns();\n          if (((buf != '\"') && (buf != '\\\\') && (buf != '\/') &&\n              (buf != 'b') && (buf != 'f') && (buf != 'n') &&\n              (buf != 'r') && (buf != 't') && (buf != 'u'))) {\n                qjsonDebug() << \"Just read\" << buf;\n                qjsonDebug() << \"JSonScanner::yylex - error decoding escaped sequence\";\n                return -1;\n          }\n        } else {\n          qCritical() << \"JSonScanner::yylex - error decoding escaped sequence : io error\";\n          return -1;\n        }\n      }\n#endif\n    }\n  }\n  else if (isdigit(ch) != 0 && m_quotmarkClosed) {\n    *yylval = QVariant(QString::fromLatin1(QByteArray(&ch,1)));\n    qjsonDebug() << \"JSonScanner::yylex - yy::json_parser::token::DIGIT\";\n    return yy::json_parser::token::DIGIT;\n  }\n  else if (isalnum(ch) != 0) {\n    *yylval = QVariant(QString(QChar::fromLatin1(ch)));\n    qjsonDebug() << \"JSonScanner::yylex - yy::json_parser::token::WORD (\"\n             << ch << \")\";\n    return yy::json_parser::token::STRING;\n  }\n  else if (ch == ':') {\n    \/\/ set yylval\n    qjsonDebug() << \"JSonScanner::yylex - yy::json_parser::token::COLON\";\n    return yy::json_parser::token::COLON;\n  }\n  else if (ch == '\"') {\n    \/\/ yy::json_parser::token::QUOTMARK (\")\n\n    \/\/ set yylval\n    m_quotmarkCount++;\n    if (m_quotmarkCount %2 == 0) {\n      m_quotmarkClosed = true;\n      m_quotmarkCount = 0;\n      qjsonDebug() << \"JSonScanner::yylex - yy::json_parser::token::QUOTMARKCLOSE\";\n      return yy::json_parser::token::QUOTMARKCLOSE;\n    }\n    else {\n      m_quotmarkClosed = false;\n      qjsonDebug() << \"JSonScanner::yylex - yy::json_parser::token::QUOTMARKOPEN\";\n      return yy::json_parser::token::QUOTMARKOPEN;\n    }\n  }\n  else if (ch == ',') {\n    qjsonDebug() << \"JSonScanner::yylex - yy::json_parser::token::COMMA\";\n    return yy::json_parser::token::COMMA;\n  }\n  else if (ch == '.') {\n    qjsonDebug() << \"JSonScanner::yylex - yy::json_parser::token::DOT\";\n    return yy::json_parser::token::DOT;\n  }\n  else if (ch == '-') {\n    qjsonDebug() << \"JSonScanner::yylex - yy::json_parser::token::MINUS\";\n    return yy::json_parser::token::MINUS;\n  }\n  else if (ch == '[') {\n    qjsonDebug() << \"JSonScanner::yylex - yy::json_parser::token::SQUARE_BRACKET_OPEN\";\n    return yy::json_parser::token::SQUARE_BRACKET_OPEN;\n  }\n  else if (ch == ']') {\n    qjsonDebug() << \"JSonScanner::yylex - yy::json_parser::token::SQUARE_BRACKET_CLOSE\";\n    return yy::json_parser::token::SQUARE_BRACKET_CLOSE;\n  }\n  else if (ch == '{') {\n    qjsonDebug() << \"JSonScanner::yylex - yy::json_parser::token::CURLY_BRACKET_OPEN\";\n    return yy::json_parser::token::CURLY_BRACKET_OPEN;\n  }\n  else if (ch == '}') {\n    qjsonDebug() << \"JSonScanner::yylex - yy::json_parser::token::CURLY_BRACKET_CLOSE\";\n    return yy::json_parser::token::CURLY_BRACKET_CLOSE;\n  }\n\n  \/\/unknown char!\n  \/\/TODO yyerror?\n  qCritical() << \"JSonScanner::yylex - unknown char, returning -1\";\n  return -1;\n}\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 \"CommandLine.hxx\"\n#include \"Config.hxx\"\n#include \"net\/Parser.hxx\"\n#include \"io\/Logger.hxx\"\n#include \"util\/StringView.hxx\"\n#include \"util\/IterableSplitString.hxx\"\n#include \"version.h\"\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <stdarg.h>\n#include <getopt.h>\n#include <string.h>\n\nstatic void\nPrintUsage()\n{\n\tputs(\"usage: cm4all-beng-proxy [options]\\n\\n\"\n\t     \"valid options:\\n\"\n#ifdef __GLIBC__\n\t     \" --help\\n\"\n#endif\n\t     \" -h             help (this text)\\n\"\n#ifdef __GLIBC__\n\t     \" --version\\n\"\n#endif\n\t     \" -V             show cm4all-beng-proxy version\\n\"\n#ifdef __GLIBC__\n\t     \" --verbose\\n\"\n#endif\n\t     \" -v             be more verbose\\n\"\n#ifdef __GLIBC__\n\t     \" --quiet\\n\"\n#endif\n\t     \" -q             be quiet\\n\"\n#ifdef __GLIBC__\n\t     \" --config-file file\\n\"\n#endif\n\t     \" -f file        load this configuration file\\n\"\n#ifdef __GLIBC__\n\t     \" --user name\\n\"\n#endif\n\t     \" -u name        switch to another user id\\n\"\n#ifdef __GLIBC__\n\t     \" --logger-user name\\n\"\n#endif\n\t     \" -U name        execute the error logger program with this user id\\n\"\n#ifdef __GLIBC__\n\t     \" --document-root DIR\\n\"\n#endif\n\t     \" -r DIR         set the document root\\n\"\n#ifdef __GLIBC__\n\t     \" --translation-socket PATH\\n\"\n#endif\n\t     \" -t PATH        set the path to the translation server socket\\n\"\n#ifdef __GLIBC__\n\t     \" --cluster-size N\\n\"\n#endif\n\t     \" -C N           set the size of the beng-lb cluster\\n\"\n#ifdef __GLIBC__\n\t     \" --cluster-node N\\n\"\n#endif\n\t     \" -N N           set the index of this node in the beng-lb cluster\\n\"\n#ifdef __GLIBC__\n\t     \" --ua-classes PATH\\n\"\n#endif\n\t     \" -a PATH        load the User-Agent classification rules from this file\\n\"\n#ifdef __GLIBC__\n\t     \" --set NAME=VALUE  tweak an internal variable, see manual for details\\n\"\n#endif\n\t     \" -s NAME=VALUE  \\n\"\n\t     \"\\n\"\n\t     );\n}\n\nstatic void arg_error(const char *argv0, const char *fmt, ...)\n\t__attribute__ ((noreturn))\n\t__attribute__((format(printf,2,3)));\nstatic void arg_error(const char *argv0, const char *fmt, ...) {\n\tif (fmt != NULL) {\n\t\tva_list ap;\n\n\t\tfputs(argv0, stderr);\n\t\tfputs(\": \", stderr);\n\n\t\tva_start(ap, fmt);\n\t\tvfprintf(stderr, fmt, ap);\n\t\tva_end(ap);\n\n\t\tputc('\\n', stderr);\n\t}\n\n\tfprintf(stderr, \"Try '%s --help' for more information.\\n\",\n\t\targv0);\n\texit(1);\n}\n\ntemplate<typename F>\nstatic void\nSplitForEach(const char *p, char separator, F &&f)\n{\n\tfor (auto value : IterableSplitString(p, separator))\n\t\tif (!value.empty())\n\t\t\tf(std::string(value.data, value.size).c_str());\n}\n\nstatic void\nHandleSet(BpConfig &config,\n\t  const char *argv0, const char *p)\n{\n\tconst char *eq;\n\n\teq = strchr(p, '=');\n\tif (eq == NULL)\n\t\targ_error(argv0, \"No '=' found in --set argument\");\n\n\tif (eq == p)\n\t\targ_error(argv0, \"No name found in --set argument\");\n\n\tconst StringView name(p, eq - p);\n\tconst char *const value = eq + 1;\n\n\ttry {\n\t\tconfig.HandleSet(name, value);\n\t} catch (const std::runtime_error &e) {\n\t\targ_error(argv0, \"Error while parsing \\\"--set %.*s\\\": %s\",\n\t\t\t  (int)name.size, name.data, e.what());\n\t}\n}\n\n\/** read configuration options from the command line *\/\nvoid\nParseCommandLine(BpCmdLine &cmdline, BpConfig &config, int argc, char **argv)\n{\n\tint ret;\n\tchar *endptr;\n#ifdef __GLIBC__\n\tstatic const struct option long_options[] = {\n\t\t{\"help\", 0, NULL, 'h'},\n\t\t{\"version\", 0, NULL, 'V'},\n\t\t{\"verbose\", 0, NULL, 'v'},\n\t\t{\"quiet\", 0, NULL, 'q'},\n\t\t{\"config-file\", 1, nullptr, 'f'},\n\t\t{\"user\", 1, NULL, 'u'},\n\t\t{\"logger-user\", 1, NULL, 'U'},\n\t\t{\"document-root\", 1, NULL, 'r'},\n\t\t{\"translation-socket\", 1, NULL, 't'},\n\t\t{\"cluster-size\", 1, NULL, 'C'},\n\t\t{\"cluster-node\", 1, NULL, 'N'},\n\t\t{\"ua-classes\", 1, NULL, 'a'},\n\t\t{\"set\", 1, NULL, 's'},\n\t\t{NULL,0,NULL,0}\n\t};\n#endif\n\tconst char *user_name = NULL;\n\tunsigned verbose = 1;\n\n\twhile (1) {\n#ifdef __GLIBC__\n\t\tint option_index = 0;\n\n\t\tret = getopt_long(argc, argv,\n\t\t\t\t  \"hVvqf:u:U:r:t:B:C:N:s:\",\n\t\t\t\t  long_options, &option_index);\n#else\n\t\tret = getopt(argc, argv,\n\t\t\t     \"hVvqf:u:U:r:t:B:C:N:s:\");\n#endif\n\t\tif (ret == -1)\n\t\t\tbreak;\n\n\t\tswitch (ret) {\n\t\tcase 'h':\n\t\t\tPrintUsage();\n\t\t\texit(0);\n\n\t\tcase 'V':\n\t\t\tprintf(\"cm4all-beng-proxy v%s\\n\", VERSION);\n\t\t\texit(0);\n\n\t\tcase 'v':\n\t\t\t++verbose;\n\t\t\tbreak;\n\n\t\tcase 'q':\n\t\t\tverbose = 0;\n\t\t\tbreak;\n\n\t\tcase 'f':\n\t\t\tcmdline.config_file = optarg;\n\t\t\tbreak;\n\n\t\tcase 'u':\n\t\t\tif (debug_mode)\n\t\t\t\targ_error(argv[0], \"cannot specify a user in debug mode\");\n\n\t\t\tuser_name = optarg;\n\t\t\tbreak;\n\n\t\tcase 'U':\n\t\t\tif (debug_mode)\n\t\t\t\targ_error(argv[0], \"cannot specify a user in debug mode\");\n\n\t\t\tcmdline.logger_user.Lookup(optarg);\n\t\t\tbreak;\n\n\t\tcase 'r':\n\t\t\tconfig.document_root = optarg;\n\t\t\tbreak;\n\n\t\tcase 't':\n\t\t\tconfig.translation_sockets.emplace_front(ParseSocketAddress(optarg, 0, false));\n\t\t\tbreak;\n\n\t\tcase 'C':\n\t\t\tconfig.cluster_size = strtoul(optarg, &endptr, 10);\n\t\t\tif (endptr == optarg || *endptr != 0 ||\n\t\t\t    config.cluster_size > 1024)\n\t\t\t\targ_error(argv[0], \"Invalid cluster size number\");\n\n\t\t\tif (config.cluster_node >= config.cluster_size)\n\t\t\t\tconfig.cluster_node = 0;\n\t\t\tbreak;\n\n\t\tcase 'N':\n\t\t\tconfig.cluster_node = strtoul(optarg, &endptr, 10);\n\t\t\tif (endptr == optarg || *endptr != 0)\n\t\t\t\targ_error(argv[0], \"Invalid cluster size number\");\n\n\t\t\tif ((config.cluster_node != 0 || config.cluster_size != 0) &&\n\t\t\t    config.cluster_node >= config.cluster_size)\n\t\t\t\targ_error(argv[0], \"Cluster node too large\");\n\t\t\tbreak;\n\n\t\tcase 'a':\n\t\t\tcmdline.ua_classification_file = optarg;\n\t\t\tbreak;\n\n\t\tcase 's':\n\t\t\tHandleSet(config, argv[0], optarg);\n\t\t\tbreak;\n\n\t\tcase '?':\n\t\t\targ_error(argv[0], NULL);\n\n\t\tdefault:\n\t\t\texit(1);\n\t\t}\n\t}\n\n\tSetLogLevel(verbose);\n\n\t\/* check non-option arguments *\/\n\n\tif (optind < argc)\n\t\targ_error(argv[0], \"unrecognized argument: %s\", argv[optind]);\n\n\t\/* check completeness *\/\n\n\tif (user_name != NULL) {\n\t\tcmdline.user.Lookup(user_name);\n\t\tif (!cmdline.user.IsComplete())\n\t\t\targ_error(argv[0], \"refusing to run as root\");\n\t} else if (!debug_mode)\n\t\targ_error(argv[0], \"no user name specified (-u)\");\n}\n<commit_msg>bp\/CommandLine: use nullptr instead of NULL<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 \"CommandLine.hxx\"\n#include \"Config.hxx\"\n#include \"net\/Parser.hxx\"\n#include \"io\/Logger.hxx\"\n#include \"util\/StringView.hxx\"\n#include \"util\/IterableSplitString.hxx\"\n#include \"version.h\"\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <stdarg.h>\n#include <getopt.h>\n#include <string.h>\n\nstatic void\nPrintUsage()\n{\n\tputs(\"usage: cm4all-beng-proxy [options]\\n\\n\"\n\t     \"valid options:\\n\"\n#ifdef __GLIBC__\n\t     \" --help\\n\"\n#endif\n\t     \" -h             help (this text)\\n\"\n#ifdef __GLIBC__\n\t     \" --version\\n\"\n#endif\n\t     \" -V             show cm4all-beng-proxy version\\n\"\n#ifdef __GLIBC__\n\t     \" --verbose\\n\"\n#endif\n\t     \" -v             be more verbose\\n\"\n#ifdef __GLIBC__\n\t     \" --quiet\\n\"\n#endif\n\t     \" -q             be quiet\\n\"\n#ifdef __GLIBC__\n\t     \" --config-file file\\n\"\n#endif\n\t     \" -f file        load this configuration file\\n\"\n#ifdef __GLIBC__\n\t     \" --user name\\n\"\n#endif\n\t     \" -u name        switch to another user id\\n\"\n#ifdef __GLIBC__\n\t     \" --logger-user name\\n\"\n#endif\n\t     \" -U name        execute the error logger program with this user id\\n\"\n#ifdef __GLIBC__\n\t     \" --document-root DIR\\n\"\n#endif\n\t     \" -r DIR         set the document root\\n\"\n#ifdef __GLIBC__\n\t     \" --translation-socket PATH\\n\"\n#endif\n\t     \" -t PATH        set the path to the translation server socket\\n\"\n#ifdef __GLIBC__\n\t     \" --cluster-size N\\n\"\n#endif\n\t     \" -C N           set the size of the beng-lb cluster\\n\"\n#ifdef __GLIBC__\n\t     \" --cluster-node N\\n\"\n#endif\n\t     \" -N N           set the index of this node in the beng-lb cluster\\n\"\n#ifdef __GLIBC__\n\t     \" --ua-classes PATH\\n\"\n#endif\n\t     \" -a PATH        load the User-Agent classification rules from this file\\n\"\n#ifdef __GLIBC__\n\t     \" --set NAME=VALUE  tweak an internal variable, see manual for details\\n\"\n#endif\n\t     \" -s NAME=VALUE  \\n\"\n\t     \"\\n\"\n\t     );\n}\n\nstatic void arg_error(const char *argv0, const char *fmt, ...)\n\t__attribute__ ((noreturn))\n\t__attribute__((format(printf,2,3)));\nstatic void arg_error(const char *argv0, const char *fmt, ...) {\n\tif (fmt != nullptr) {\n\t\tva_list ap;\n\n\t\tfputs(argv0, stderr);\n\t\tfputs(\": \", stderr);\n\n\t\tva_start(ap, fmt);\n\t\tvfprintf(stderr, fmt, ap);\n\t\tva_end(ap);\n\n\t\tputc('\\n', stderr);\n\t}\n\n\tfprintf(stderr, \"Try '%s --help' for more information.\\n\",\n\t\targv0);\n\texit(1);\n}\n\ntemplate<typename F>\nstatic void\nSplitForEach(const char *p, char separator, F &&f)\n{\n\tfor (auto value : IterableSplitString(p, separator))\n\t\tif (!value.empty())\n\t\t\tf(std::string(value.data, value.size).c_str());\n}\n\nstatic void\nHandleSet(BpConfig &config,\n\t  const char *argv0, const char *p)\n{\n\tconst char *eq;\n\n\teq = strchr(p, '=');\n\tif (eq == nullptr)\n\t\targ_error(argv0, \"No '=' found in --set argument\");\n\n\tif (eq == p)\n\t\targ_error(argv0, \"No name found in --set argument\");\n\n\tconst StringView name(p, eq - p);\n\tconst char *const value = eq + 1;\n\n\ttry {\n\t\tconfig.HandleSet(name, value);\n\t} catch (const std::runtime_error &e) {\n\t\targ_error(argv0, \"Error while parsing \\\"--set %.*s\\\": %s\",\n\t\t\t  (int)name.size, name.data, e.what());\n\t}\n}\n\n\/** read configuration options from the command line *\/\nvoid\nParseCommandLine(BpCmdLine &cmdline, BpConfig &config, int argc, char **argv)\n{\n\tint ret;\n\tchar *endptr;\n#ifdef __GLIBC__\n\tstatic const struct option long_options[] = {\n\t\t{\"help\", 0, nullptr, 'h'},\n\t\t{\"version\", 0, nullptr, 'V'},\n\t\t{\"verbose\", 0, nullptr, 'v'},\n\t\t{\"quiet\", 0, nullptr, 'q'},\n\t\t{\"config-file\", 1, nullptr, 'f'},\n\t\t{\"user\", 1, nullptr, 'u'},\n\t\t{\"logger-user\", 1, nullptr, 'U'},\n\t\t{\"document-root\", 1, nullptr, 'r'},\n\t\t{\"translation-socket\", 1, nullptr, 't'},\n\t\t{\"cluster-size\", 1, nullptr, 'C'},\n\t\t{\"cluster-node\", 1, nullptr, 'N'},\n\t\t{\"ua-classes\", 1, nullptr, 'a'},\n\t\t{\"set\", 1, nullptr, 's'},\n\t\t{nullptr, 0, nullptr, 0}\n\t};\n#endif\n\tconst char *user_name = nullptr;\n\tunsigned verbose = 1;\n\n\twhile (1) {\n#ifdef __GLIBC__\n\t\tint option_index = 0;\n\n\t\tret = getopt_long(argc, argv,\n\t\t\t\t  \"hVvqf:u:U:r:t:B:C:N:s:\",\n\t\t\t\t  long_options, &option_index);\n#else\n\t\tret = getopt(argc, argv,\n\t\t\t     \"hVvqf:u:U:r:t:B:C:N:s:\");\n#endif\n\t\tif (ret == -1)\n\t\t\tbreak;\n\n\t\tswitch (ret) {\n\t\tcase 'h':\n\t\t\tPrintUsage();\n\t\t\texit(0);\n\n\t\tcase 'V':\n\t\t\tprintf(\"cm4all-beng-proxy v%s\\n\", VERSION);\n\t\t\texit(0);\n\n\t\tcase 'v':\n\t\t\t++verbose;\n\t\t\tbreak;\n\n\t\tcase 'q':\n\t\t\tverbose = 0;\n\t\t\tbreak;\n\n\t\tcase 'f':\n\t\t\tcmdline.config_file = optarg;\n\t\t\tbreak;\n\n\t\tcase 'u':\n\t\t\tif (debug_mode)\n\t\t\t\targ_error(argv[0], \"cannot specify a user in debug mode\");\n\n\t\t\tuser_name = optarg;\n\t\t\tbreak;\n\n\t\tcase 'U':\n\t\t\tif (debug_mode)\n\t\t\t\targ_error(argv[0], \"cannot specify a user in debug mode\");\n\n\t\t\tcmdline.logger_user.Lookup(optarg);\n\t\t\tbreak;\n\n\t\tcase 'r':\n\t\t\tconfig.document_root = optarg;\n\t\t\tbreak;\n\n\t\tcase 't':\n\t\t\tconfig.translation_sockets.emplace_front(ParseSocketAddress(optarg, 0, false));\n\t\t\tbreak;\n\n\t\tcase 'C':\n\t\t\tconfig.cluster_size = strtoul(optarg, &endptr, 10);\n\t\t\tif (endptr == optarg || *endptr != 0 ||\n\t\t\t    config.cluster_size > 1024)\n\t\t\t\targ_error(argv[0], \"Invalid cluster size number\");\n\n\t\t\tif (config.cluster_node >= config.cluster_size)\n\t\t\t\tconfig.cluster_node = 0;\n\t\t\tbreak;\n\n\t\tcase 'N':\n\t\t\tconfig.cluster_node = strtoul(optarg, &endptr, 10);\n\t\t\tif (endptr == optarg || *endptr != 0)\n\t\t\t\targ_error(argv[0], \"Invalid cluster size number\");\n\n\t\t\tif ((config.cluster_node != 0 || config.cluster_size != 0) &&\n\t\t\t    config.cluster_node >= config.cluster_size)\n\t\t\t\targ_error(argv[0], \"Cluster node too large\");\n\t\t\tbreak;\n\n\t\tcase 'a':\n\t\t\tcmdline.ua_classification_file = optarg;\n\t\t\tbreak;\n\n\t\tcase 's':\n\t\t\tHandleSet(config, argv[0], optarg);\n\t\t\tbreak;\n\n\t\tcase '?':\n\t\t\targ_error(argv[0], nullptr);\n\n\t\tdefault:\n\t\t\texit(1);\n\t\t}\n\t}\n\n\tSetLogLevel(verbose);\n\n\t\/* check non-option arguments *\/\n\n\tif (optind < argc)\n\t\targ_error(argv[0], \"unrecognized argument: %s\", argv[optind]);\n\n\t\/* check completeness *\/\n\n\tif (user_name != nullptr) {\n\t\tcmdline.user.Lookup(user_name);\n\t\tif (!cmdline.user.IsComplete())\n\t\t\targ_error(argv[0], \"refusing to run as root\");\n\t} else if (!debug_mode)\n\t\targ_error(argv[0], \"no user name specified (-u)\");\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ See the file \"license.terms\" for information on usage and redistribution of\n\/\/ this file, and for a DISCLAIMER OF ALL WARRANTIES.\n\n\n\/\/---------------------------Includes----------------------------------------------\/\/\n#include <stdio.h>\n#include <stdlib.h>\n#include <errno.h>\n#include <fcntl.h>\n#include <string.h>\n#include <unistd.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n\n\n\/\/---------------------------Defines-----------------------------------------------\/\/\n\/*\n** You should set NEED_FCHDIR to 1 if the chroot() on your\n** system changes the working directory of the calling\n** process to the same directory as the process was chroot()ed\n** to.\n**\n** It is known that you do not need to set this value if you\n** running on Solaris 2.7 and below.\n**\n*\/\n#define NEED_FCHDIR 0\n\n#define TEMP_DIR \"chrootbreak\"\n\n\n\n\/\/---------------------------Start breakChrootEnv----------------------------------\/\/\n\/* Break out of a chroot() environment *\/\nenum tResult breakChrootEnv () {\n  int x;            \/* Used to move up a directory tree *\/\n  struct stat sbuf; \/* The stat() buffer *\/\n\n#ifdef NEED_FCHDIR\n  int dir_fd;       \/* File descriptor to directory *\/\n#endif\n\n\/*\n** First we create the temporary directory if it doesn't exist\n*\/\n  (void)chdir(\"\/tmp\/\");\n\n  if (stat (TEMP_DIR, &sbuf) < 0) {\n    if (errno == ENOENT) {\n      if (mkdir (TEMP_DIR, 0755) < 0) {\n        printf (\"Failed to create %s - %s\\n\", TEMP_DIR, strerror(errno) );\n        return ERR_UNDEFINED;\n      }\n    } else {\n      printf (\"Failed to stat %s - %s\\n\", TEMP_DIR, strerror(errno) );\n      return ERR_UNDEFINED;\n    }\n  } else if (!S_ISDIR (sbuf.st_mode) ) {\n    printf (\"Error - %s is not a directory!\\n\", TEMP_DIR);\n    return ERR_UNDEFINED;\n  }\n\n#ifdef NEED_FCHDIR\n\/*\n** Now we open the current working directory\n**\n** Note: Only required if chroot() changes the calling program's\n**       working directory to the directory given to chroot().\n**\n*\/\n  if ( (dir_fd = open (\".\", O_RDONLY) ) < 0) {\n    printf(\"Failed to open cwd for reading - %s\\n\", strerror(errno) );\n    return ERR_UNDEFINED;\n  }\n#endif\n\n\/*\n** Next we chroot() to the temporary directory\n*\/\n  if (chroot (TEMP_DIR) < 0) {\n    printf(\"Failed to chroot to %s - %s\\n\", TEMP_DIR, strerror(errno) );\n    return ERR_UNDEFINED;\n  }\n\n#ifdef NEED_FCHDIR\n\/*\n** Partially break out of the chroot by doing an fchdir()\n**\n** This only partially breaks out of the chroot() since whilst\n** our current working directory is outside of the chroot() jail,\n** our root directory is still within it. Thus anything which refers\n** to \"\/\" will refer to files under the chroot() point.\n**\n** Note: Only required if chroot() changes the calling program's\n**       working directory to the directory given to chroot().\n**\n*\/\n  if (fchdir(dir_fd)<0) {\n    printf(\"Failed to fchdir - %s\\n\", strerror(errno) );\n    return ERR_UNDEFINED;\n  }\n  close(dir_fd);\n#endif\n\n  \/*\n   * Completely break out of the chroot by recursing up the directory\n   * tree and doing a chroot to the current working directory (which will\n   * be the real \"\/\" at that point). We just do a chdir(\"..\") lots of\n   * times (1024 times for luck :). If we hit the real root directory before\n   * we have finished the loop below it doesn't matter as .. in the root\n   * directory is the same as . in the root.\n   *\n   * We do the final break out by doing a chroot(\".\") which sets the root\n   * directory to the current working directory - at this point the real\n   * root directory.\n   *\/\n\n  for(x=0;x<1024;x++) {\n    (void)chdir(\"..\");\n  }\/\/end for\n\n  (void)chroot(\".\");\n\n  \/*\n   * We're finally out - so exec a shell in interactive mode\n   *\/\n\n   return NOERROR;\n}\/\/end Fct\n\n\n\n\/\/---------------------------Start setEnvParams------------------------------------\/\/\nvoid setEnvParams () {\n   \/\/setenv(\"PS1\", \"$(precmd)$USER@$HOSTNAME:${PWD:-?} \", 1);\n\n   setenv(\"TERM\", \"linux\", 1);\n   setenv(\"PATH\", \"\/sbin:\/vendor\/bin:\/system\/sbin:\/system\/bin:\/system\/xbin\", 1);\n   setenv(\"LD_LIBRARY_PATH\", \"\/vendor\/lib:\/system\/lib\", 1);\n   setenv(\"ANDROID_BOOTLOGO\", \"1\", 1);\n   setenv(\"ANDROID_PROPERTY_WORKSPACE\", \"8,65536\", 1);\n   setenv(\"LOOP_MOUNTPOINT\", \"\/mnt\/obb\", 1);\n   setenv(\"EXTERNAL_STORAGE\", \"\/mnt\/sdcard\", 1);\n   setenv(\"USER\", \"root\", 1);\n   setenv(\"ANDROID_DATA\", \"\/data\", 1);\n   setenv(\"SD_EXT_DIRECTORY\", \"\/sd-ext\", 1);\n   setenv(\"MKSH\", \"\/system\/bin\/sh\", 1);\n   setenv(\"HOME\", \"\/data\", 1);\n   setenv(\"ASEC_MOUNTPOINT\", \"\/mnt\/asec\", 1);\n   setenv(\"HOSTNAME\", \"android\", 1);\n   setenv(\"BOOTCLASSPATH\", \"\/system\/framework\/core.jar:\/system\/framework\/core-junit.jar:\/system\/framework\/bouncycastle.jar:\/system\/framework\/ext.jar:\/system\/framework\/framework.jar:\/system\/framework\/android.policy.jar:\/system\/framework\/services.jar:\/system\/framework\/apache-xml.jar:\/system\/framework\/filterfw.jar\", 1);\n   setenv(\"ANDROID_ROOT\", \"\/system\", 1);\n   setenv(\"SHEL\", \"\/system\/bin\/sh\", 1);\n   setenv(\"ANDROID_ASSETS\", \"\/system\/app\", 1);\n   setenv(\"ANDROID_SOCKET_zygote\", \"9\", 1);\n   unsetenv(\"TMUX\");\n}\/\/end Fct\n\n\n\n\/\/---------------------------Start openShell---------------------------------------\/\/\nenum tResult openShell () {\n   if (execl (\"\/system\/bin\/mksh\", \"mksh\", \"-l\", \"-i\", NULL) < 0) {\n      printf(\"Failed to exec - %s\\n\", strerror(errno) );\n      return ERR_UNDEFINED;   \/\/TODO: Set a better error value\n   }\n\n  return NOERROR;\n}\/\/end Fct\n<commit_msg>Changed default environment variables.<commit_after>\/\/ See the file \"license.terms\" for information on usage and redistribution of\n\/\/ this file, and for a DISCLAIMER OF ALL WARRANTIES.\n\n\n\/\/---------------------------Includes----------------------------------------------\/\/\n#include <stdio.h>\n#include <stdlib.h>\n#include <errno.h>\n#include <fcntl.h>\n#include <string.h>\n#include <unistd.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n\n\n\/\/---------------------------Defines-----------------------------------------------\/\/\n\/*\n** You should set NEED_FCHDIR to 1 if the chroot() on your\n** system changes the working directory of the calling\n** process to the same directory as the process was chroot()ed\n** to.\n**\n** It is known that you do not need to set this value if you\n** running on Solaris 2.7 and below.\n**\n*\/\n#define NEED_FCHDIR 0\n\n#define TEMP_DIR \"chrootbreak\"\n\n\n\n\/\/---------------------------Start breakChrootEnv----------------------------------\/\/\n\/* Break out of a chroot() environment *\/\nenum tResult breakChrootEnv () {\n  int x;            \/* Used to move up a directory tree *\/\n  struct stat sbuf; \/* The stat() buffer *\/\n\n#ifdef NEED_FCHDIR\n  int dir_fd;       \/* File descriptor to directory *\/\n#endif\n\n\/*\n** First we create the temporary directory if it doesn't exist\n*\/\n  (void)chdir(\"\/tmp\/\");\n\n  if (stat (TEMP_DIR, &sbuf) < 0) {\n    if (errno == ENOENT) {\n      if (mkdir (TEMP_DIR, 0755) < 0) {\n        printf (\"Failed to create %s - %s\\n\", TEMP_DIR, strerror(errno) );\n        return ERR_UNDEFINED;\n      }\n    } else {\n      printf (\"Failed to stat %s - %s\\n\", TEMP_DIR, strerror(errno) );\n      return ERR_UNDEFINED;\n    }\n  } else if (!S_ISDIR (sbuf.st_mode) ) {\n    printf (\"Error - %s is not a directory!\\n\", TEMP_DIR);\n    return ERR_UNDEFINED;\n  }\n\n#ifdef NEED_FCHDIR\n\/*\n** Now we open the current working directory\n**\n** Note: Only required if chroot() changes the calling program's\n**       working directory to the directory given to chroot().\n**\n*\/\n  if ( (dir_fd = open (\".\", O_RDONLY) ) < 0) {\n    printf(\"Failed to open cwd for reading - %s\\n\", strerror(errno) );\n    return ERR_UNDEFINED;\n  }\n#endif\n\n\/*\n** Next we chroot() to the temporary directory\n*\/\n  if (chroot (TEMP_DIR) < 0) {\n    printf(\"Failed to chroot to %s - %s\\n\", TEMP_DIR, strerror(errno) );\n    return ERR_UNDEFINED;\n  }\n\n#ifdef NEED_FCHDIR\n\/*\n** Partially break out of the chroot by doing an fchdir()\n**\n** This only partially breaks out of the chroot() since whilst\n** our current working directory is outside of the chroot() jail,\n** our root directory is still within it. Thus anything which refers\n** to \"\/\" will refer to files under the chroot() point.\n**\n** Note: Only required if chroot() changes the calling program's\n**       working directory to the directory given to chroot().\n**\n*\/\n  if (fchdir(dir_fd)<0) {\n    printf(\"Failed to fchdir - %s\\n\", strerror(errno) );\n    return ERR_UNDEFINED;\n  }\n  close(dir_fd);\n#endif\n\n  \/*\n   * Completely break out of the chroot by recursing up the directory\n   * tree and doing a chroot to the current working directory (which will\n   * be the real \"\/\" at that point). We just do a chdir(\"..\") lots of\n   * times (1024 times for luck :). If we hit the real root directory before\n   * we have finished the loop below it doesn't matter as .. in the root\n   * directory is the same as . in the root.\n   *\n   * We do the final break out by doing a chroot(\".\") which sets the root\n   * directory to the current working directory - at this point the real\n   * root directory.\n   *\/\n\n  for(x=0;x<1024;x++) {\n    (void)chdir(\"..\");\n  }\/\/end for\n\n  (void)chroot(\".\");\n\n  \/*\n   * We're finally out - so exec a shell in interactive mode\n   *\/\n\n   return NOERROR;\n}\/\/end Fct\n\n\n\n\/\/---------------------------Start setEnvParams------------------------------------\/\/\nvoid setEnvParams () {\n   \/\/setenv(\"PS1\", \"$(precmd)$USER@$HOSTNAME:${PWD:-?} \", 1);\n\n   \/\/setenv(\"TERM\", \"vt100\", 1);\n   \/\/setenv(\"TERM\", \"linux\", 1);\n   \/\/setenv(\"TERM\", \"xterm-color\", 1);\n   setenv(\"TERM\", \"screen\", 1);\n   setenv(\"PATH\", \"\/sbin:\/vendor\/bin:\/system\/sbin:\/system\/bin:\/system\/xbin\", 1);\n   setenv(\"LD_LIBRARY_PATH\", \"\/vendor\/lib:\/system\/lib\", 1);\n   setenv(\"ANDROID_BOOTLOGO\", \"1\", 1);\n   setenv(\"ANDROID_PROPERTY_WORKSPACE\", \"8,65536\", 1);\n   setenv(\"LOOP_MOUNTPOINT\", \"\/mnt\/obb\", 1);\n   setenv(\"EXTERNAL_STORAGE\", \"\/mnt\/sdcard\", 1);\n   setenv(\"USER\", \"root\", 1);\n   setenv(\"ANDROID_DATA\", \"\/data\", 1);\n   setenv(\"SD_EXT_DIRECTORY\", \"\/sd-ext\", 1);\n   setenv(\"MKSH\", \"\/system\/bin\/mksh\", 1);\n   setenv(\"HOME\", \"\/data\", 1);\n   setenv(\"ASEC_MOUNTPOINT\", \"\/mnt\/asec\", 1);\n   setenv(\"HOSTNAME\", \"android\", 1);\n   setenv(\"BOOTCLASSPATH\", \"\/system\/framework\/core.jar:\/system\/framework\/core-junit.jar:\/system\/framework\/bouncycastle.jar:\/system\/framework\/ext.jar:\/system\/framework\/framework.jar:\/system\/framework\/android.policy.jar:\/system\/framework\/services.jar:\/system\/framework\/apache-xml.jar:\/system\/framework\/filterfw.jar\", 1);\n   setenv(\"ANDROID_ROOT\", \"\/system\", 1);\n   setenv(\"SHELL\", \"\/system\/bin\/mksh\", 1);\n   setenv(\"ANDROID_ASSETS\", \"\/system\/app\", 1);\n   setenv(\"ANDROID_SOCKET_zygote\", \"9\", 1);\n   unsetenv(\"TMUX\");\n}\/\/end Fct\n\n\n\n\/\/---------------------------Start openShell---------------------------------------\/\/\nenum tResult openShell () {\n   if (execl (\"\/system\/bin\/mksh\", \"mksh\", \"-l\", \"-i\", NULL) < 0) {\n      printf(\"Failed to exec - %s\\n\", strerror(errno) );\n      return ERR_UNDEFINED;   \/\/TODO: Set a better error value\n   }\n\n  return NOERROR;\n}\/\/end Fct\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: idlcmain.cxx,v $\n *\n *  $Revision: 1.7 $\n *\n *  last change: $Author: obo $ $Date: 2003-10-20 13:07: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#ifndef _IDLC_IDLC_HXX_\n#include <idlc\/idlc.hxx>\n#endif\n\nusing namespace ::rtl;\n\nint SAL_CALL main( int argc, char** argv )\n{\n    Options options;\n\n    try\n    {\n        if (!options.initOptions(argc, argv))\n           exit(1);\n    }\n    catch( IllegalArgument& e)\n    {\n        fprintf(stderr, \"Illegal argument: %s\\n%s\",\n            e.m_message.getStr(),\n            options.prepareVersion().getStr());\n        exit(99);\n    }\n\n    setIdlc(&options);\n\n    const StringVector& files = options.getInputFiles();\n    sal_Int32   nFiles = files.size();\n    sal_Int32 nErrors = 0;\n    for ( sal_Int32 i=0; i < nFiles; i++ )\n    {\n        OString sysFileName( convertToAbsoluteSystemPath(files[i]) );\n\n        fprintf(stdout, \"%s: compile '%s' ... \\n\",\n            options.getProgramName().getStr(), files[i].getStr());\n        nErrors = compileFile(sysFileName);\n\n        if ( idlc()->getWarningCount() )\n            fprintf(stdout, \"%s: detected %d warnings compiling file '%s'\\n\",\n                    options.getProgramName().getStr(), idlc()->getWarningCount(),\n                    files[i].getStr(), options.prepareVersion().getStr());\n\n        if ( nErrors )\n        {\n            OString strippedFileName(sysFileName.copy(sysFileName.lastIndexOf(SEPARATOR) + 1));\n            OString sysOutputName;\n            if ( options.isValid(\"-O\") )\n            {\n                OString sysOutputName = convertToAbsoluteSystemPath(options.getOption(\"-O\"));\n                sal_Char c = sysOutputName.getStr()[sysOutputName.getLength()-1];\n\n                if ( c != '\/' )\n                    sysOutputName += OString::valueOf('\/');\n\n                sysOutputName += strippedFileName.replaceAt(strippedFileName.getLength() -3 , 3, \"urd\");\n            } else\n            {\n                sysOutputName = strippedFileName.replaceAt(strippedFileName.getLength() -3 , 3, \"urd\");\n            }\n            removeIfExists(sysOutputName);\n        } else\n            nErrors = produceFile(sysFileName);\n\n        idlc()->reset();\n        if ( nErrors > 0 )\n            break;\n    }\n\n    if ( nErrors > 0 )\n    {\n        fprintf(stdout, \"%s: detected %d errors in file '%s'%s\",\n            options.getProgramName().getStr(), nErrors,\n            files[i].getStr(), options.prepareVersion().getStr());\n    } else\n    {\n        fprintf(stdout, \"%s: returned successful%s\",\n            options.getProgramName().getStr(),\n            options.prepareVersion().getStr());\n    }\n    exit(nErrors);\n    return 0;\n}\n<commit_msg>INTEGRATION: CWS ooo20031110 (1.6.46); FILE MERGED 2003\/11\/10 10:40:39 waratah 1.6.46.1: #i22301# resolve for scope issues<commit_after>\/*************************************************************************\n *\n *  $RCSfile: idlcmain.cxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: rt $ $Date: 2003-12-01 16:19: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 _IDLC_IDLC_HXX_\n#include <idlc\/idlc.hxx>\n#endif\n\nusing namespace ::rtl;\n\nint SAL_CALL main( int argc, char** argv )\n{\n    Options options;\n\n    try\n    {\n        if (!options.initOptions(argc, argv))\n           exit(1);\n    }\n    catch( IllegalArgument& e)\n    {\n        fprintf(stderr, \"Illegal argument: %s\\n%s\",\n            e.m_message.getStr(),\n            options.prepareVersion().getStr());\n        exit(99);\n    }\n\n    setIdlc(&options);\n\n    const StringVector& files = options.getInputFiles();\n    sal_Int32   nFiles = files.size();\n    sal_Int32 nErrors = 0;\n    sal_Int32 i;\n    for ( i=0; i < nFiles; i++ )\n    {\n        OString sysFileName( convertToAbsoluteSystemPath(files[i]) );\n\n        fprintf(stdout, \"%s: compile '%s' ... \\n\",\n            options.getProgramName().getStr(), files[i].getStr());\n        nErrors = compileFile(sysFileName);\n\n        if ( idlc()->getWarningCount() )\n            fprintf(stdout, \"%s: detected %d warnings compiling file '%s'\\n\",\n                    options.getProgramName().getStr(), idlc()->getWarningCount(),\n                    files[i].getStr(), options.prepareVersion().getStr());\n\n        if ( nErrors )\n        {\n            OString strippedFileName(sysFileName.copy(sysFileName.lastIndexOf(SEPARATOR) + 1));\n            OString sysOutputName;\n            if ( options.isValid(\"-O\") )\n            {\n                OString sysOutputName = convertToAbsoluteSystemPath(options.getOption(\"-O\"));\n                sal_Char c = sysOutputName.getStr()[sysOutputName.getLength()-1];\n\n                if ( c != '\/' )\n                    sysOutputName += OString::valueOf('\/');\n\n                sysOutputName += strippedFileName.replaceAt(strippedFileName.getLength() -3 , 3, \"urd\");\n            } else\n            {\n                sysOutputName = strippedFileName.replaceAt(strippedFileName.getLength() -3 , 3, \"urd\");\n            }\n            removeIfExists(sysOutputName);\n        } else\n            nErrors = produceFile(sysFileName);\n\n        idlc()->reset();\n        if ( nErrors > 0 )\n            break;\n    }\n\n    if ( nErrors > 0 )\n    {\n        fprintf(stdout, \"%s: detected %d errors in file '%s'%s\",\n            options.getProgramName().getStr(), nErrors,\n            files[i].getStr(), options.prepareVersion().getStr());\n    } else\n    {\n        fprintf(stdout, \"%s: returned successful%s\",\n            options.getProgramName().getStr(),\n            options.prepareVersion().getStr());\n    }\n    exit(nErrors);\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\n#include <core\/map\/map1.h>\n#include <core\/map\/map2.h>\n\n#include <core\/basic\/dart_marker.h>\n#include <core\/basic\/cell_marker.h>\n\nusing namespace cgogn;\n\n\nstruct My_Data_Traits\n{\n\tstatic const unsigned int CHUNK_SIZE = 64;\n};\n\n\n\/\/ typedefs for short writing\ntypedef Map1<My_Data_Traits> MAP1;\ntypedef Map2<My_Data_Traits> MAP2;\n\n\n\n\nvoid fonc_const(const MAP1::VertexAttributeHandler<float>& ah)\n{\n\tfor (const float& f:ah)\n\t{\n\t\tstd::cout << f << std::endl;\n\t}\n\n\t\/\/ equivalent to\n\tfor (MAP1::VertexAttributeHandler<float>::const_iterator it = ah.begin(); it != ah.end(); ++it)\n\t\tstd::cout << *it << std::endl;\n}\n\nvoid fonc_non_const(MAP1::VertexAttributeHandler<float>& ah)\n{\n\tfor (float& f:ah)\n\t{\n\t\tf *= 2.0f;\n\t\tstd::cout << f << std::endl;\n\t}\n\n\t\/\/ equivalent to\n\tfor (MAP1::VertexAttributeHandler<float>::iterator it = ah.begin(); it != ah.end(); ++it)\n\t{\n\t\t*it \/= 2.0f;\n\t}\n}\n\n\nint test1(MAP1& map)\n{\n\t\/\/ add an attribute on vertex of map with\n\tMAP1::VertexAttributeHandler<float> ah = map.addAttribute<float, MAP1::VERTEX>(\"floats\");\n\n\tstd::vector<unsigned int>* uib = cgogn::uint_buffers_thread->getBuffer();\n\tuib->push_back(3);\n\tcgogn::uint_buffers_thread->releaseBuffer(uib);\n\n\tDart d = map.addDart();\n\n\tDartMarker<MAP1> dm(map);\n\tCellMarker<MAP1, MAP1::VERTEX> cm(map);\n\n\tdm.mark(d);\n\n\tstd::cout << \"Darts :\" << std::endl;\n\tfor (Dart d : map)\n\t{\n\t\tstd::cout << d << std::endl;\n\t}\n\n\t\/\/ get ChunkArrayContainer -> get ChunkArray -> fill\n\tChunkArrayContainer<My_Data_Traits::CHUNK_SIZE, unsigned int>& container = map.getAttributeContainer(VERTEX1);\n\tChunkArray<My_Data_Traits::CHUNK_SIZE,float>* att = container.getAttribute<float>(\"floats\");\n\tfor (int i=0;i<10;++i)\n\t\tcontainer.insertLines<1>();\n\tfor(unsigned int i=container.begin(); i!=container.end(); container.next(i))\n\t\t(*att)[i] = 3.0f + 0.1f*float(i);\n\n\t\/\/ access with index\n\tstd::cout << ah[0] << std::endl;\n\n\tfonc_non_const(ah);\n\n\tfonc_const(ah);\n\n\t\/\/\t\/\/ traverse container with for range\n\t\/\/\tfor (float f:ah)\n\t\/\/\t\tstd::cout << f << std::endl;\n\n\treturn 0;\n}\n\n\n\nint main()\n{\n\tcgogn::thread_start();\n\tMAP1 map1;\n\tMAP2 map2;\n\ttest1(map1);\n\tcgogn::thread_end();\n\treturn 0;\n}\n<commit_msg>local variable d was hidden<commit_after>\n#include <core\/map\/map1.h>\n#include <core\/map\/map2.h>\n\n#include <core\/basic\/dart_marker.h>\n#include <core\/basic\/cell_marker.h>\n\nusing namespace cgogn;\n\n\nstruct My_Data_Traits\n{\n\tstatic const unsigned int CHUNK_SIZE = 64;\n};\n\n\n\/\/ typedefs for short writing\ntypedef Map1<My_Data_Traits> MAP1;\ntypedef Map2<My_Data_Traits> MAP2;\n\n\n\n\nvoid fonc_const(const MAP1::VertexAttributeHandler<float>& ah)\n{\n\tfor (const float& f:ah)\n\t{\n\t\tstd::cout << f << std::endl;\n\t}\n\n\t\/\/ equivalent to\n\tfor (MAP1::VertexAttributeHandler<float>::const_iterator it = ah.begin(); it != ah.end(); ++it)\n\t\tstd::cout << *it << std::endl;\n}\n\nvoid fonc_non_const(MAP1::VertexAttributeHandler<float>& ah)\n{\n\tfor (float& f:ah)\n\t{\n\t\tf *= 2.0f;\n\t\tstd::cout << f << std::endl;\n\t}\n\n\t\/\/ equivalent to\n\tfor (MAP1::VertexAttributeHandler<float>::iterator it = ah.begin(); it != ah.end(); ++it)\n\t{\n\t\t*it \/= 2.0f;\n\t}\n}\n\n\nint test1(MAP1& map)\n{\n\t\/\/ add an attribute on vertex of map with\n\tMAP1::VertexAttributeHandler<float> ah = map.addAttribute<float, MAP1::VERTEX>(\"floats\");\n\n\tstd::vector<unsigned int>* uib = cgogn::uint_buffers_thread->getBuffer();\n\tuib->push_back(3);\n\tcgogn::uint_buffers_thread->releaseBuffer(uib);\n\n\tDart d = map.addDart();\n\n\tDartMarker<MAP1> dm(map);\n\tCellMarker<MAP1, MAP1::VERTEX> cm(map);\n\n\tdm.mark(d);\n\n\tstd::cout << \"Darts :\" << std::endl;\n\tfor (Dart dit : map)\n\t{\n\t\tstd::cout << dit << std::endl;\n\t}\n\n\t\/\/ get ChunkArrayContainer -> get ChunkArray -> fill\n\tChunkArrayContainer<My_Data_Traits::CHUNK_SIZE, unsigned int>& container = map.getAttributeContainer(VERTEX1);\n\tChunkArray<My_Data_Traits::CHUNK_SIZE,float>* att = container.getAttribute<float>(\"floats\");\n\tfor (int i=0;i<10;++i)\n\t\tcontainer.insertLines<1>();\n\tfor(unsigned int i=container.begin(); i!=container.end(); container.next(i))\n\t\t(*att)[i] = 3.0f + 0.1f*float(i);\n\n\t\/\/ access with index\n\tstd::cout << ah[0] << std::endl;\n\n\tfonc_non_const(ah);\n\n\tfonc_const(ah);\n\n\t\/\/\t\/\/ traverse container with for range\n\t\/\/\tfor (float f:ah)\n\t\/\/\t\tstd::cout << f << std::endl;\n\n\treturn 0;\n}\n\n\n\nint main()\n{\n\tcgogn::thread_start();\n\tMAP1 map1;\n\tMAP2 map2;\n\ttest1(map1);\n\tcgogn::thread_end();\n\treturn 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  GridZone.cpp\n\/\/  Created by Matt Kaufmann on 01\/07\/14.\n\/\/\n\n#include \"ExampleGame\/Components\/ComponentTypes\/ComponentTypeIds.h\"\n#include \"ExampleGame\/Components\/Grid\/GridCell.h\"\n#include \"ExampleGame\/Components\/Grid\/GridManager.h\"\n#include \"ExampleGame\/Components\/Grid\/GridZone.h\"\n#include \"ExampleGame\/GameSingletons\/GameSingletons.h\"\n#include \"ExampleGame\/Messages\/Declarations.h\"\n#include \"Vajra\/Engine\/Components\/DerivedComponents\/Transform\/Transform.h\"\n\nunsigned int GridZone::componentTypeId = COMPONENT_TYPE_ID_GRID_ZONE;\n\nGridZone::GridZone() : Component() {\n\tthis->init();\n}\n\nGridZone::GridZone(Object* object_) : Component(object_) {\n\tthis->init();\n}\n\nGridZone::~GridZone() {\n\tthis->destroy();\n}\n\nvoid GridZone::GetZoneBounds(int& west, int& east, int& south, int& north) {\n\tTransform* trans = this->GetObject()->GetComponent<Transform>();\n\n\tint centerX, centerZ;\n\tSINGLETONS->GetGridManager()->GetGrid()->GetCoordinates(centerX, centerZ, trans->GetPositionWorld());\n\n\tglm::vec3 forward = trans->GetForward();\n\n\t\/\/ Determine the rough orientation of the object.\n\tif (abs(forward.z) >= abs(forward.x)) {\n\t\tif (forward.z >= 0.0f) {\n\t\t\twest  = centerX + this->westBound;\n\t\t\teast  = centerX + this->eastBound;\n\t\t\tsouth = centerZ + this->southBound;\n\t\t\tnorth = centerZ + this->northBound;\n\t\t}\n\t\telse {\n\t\t\twest  = centerX + this->eastBound;\n\t\t\teast  = centerX + this->westBound;\n\t\t\tsouth = centerZ + this->northBound;\n\t\t\tnorth = centerZ + this->southBound;\n\t\t}\n\t}\n\telse {\n\t\tif (forward.x >= 0.0f) {\n\t\t\twest  = centerX + this->northBound;\n\t\t\teast  = centerX + this->southBound;\n\t\t\tsouth = centerZ + this->westBound;\n\t\t\tnorth = centerZ + this->eastBound;\n\t\t}\n\t\telse {\n\t\t\twest  = centerX + this->southBound;\n\t\t\teast  = centerX + this->northBound;\n\t\t\tsouth = centerZ + this->eastBound;\n\t\t\tnorth = centerZ + this->westBound;\n\t\t}\n\t}\n}\n\nvoid GridZone::SetZoneBounds(int xMin, int zMin, int xMax, int zMax) {\n\tif (xMin <= xMax) {\n\t\tthis->westBound = xMin;\n\t\tthis->eastBound = xMax;\n\t}\n\telse {\n\t\tthis->westBound = xMax;\n\t\tthis->eastBound = xMin;\n\t}\n\tif (zMin <= zMax) {\n\t\tthis->southBound = zMin;\n\t\tthis->northBound = zMax;\n\t}\n\telse {\n\t\tthis->southBound = zMax;\n\t\tthis->northBound = zMin;\n\t}\n}\n\nbool GridZone::IsCellWithinZone(GridCell* cell) {\n\tif (cell != nullptr) {\n\t\tint west, east, south, north;\n\n\t\tthis->GetZoneBounds(west, east, south, north);\n\n\t\treturn ((cell->x >= west) && (cell->x <= east) && (cell->z >= south) && (cell->z <= north));\n\t}\n\n\treturn false;\n}\n\nvoid GridZone::init() {\n\tthis->zoneType = GRID_ZONE_TYPE_UNKNOWN;\n\tthis->westBound = -1;\n\tthis->eastBound = -1;\n\tthis->southBound = -1;\n\tthis->northBound = -1;\n\n\tSINGLETONS->GetGridManager()->GetGrid()->AddGridZone(this->GetObject()->GetId());\n}\n\nvoid GridZone::destroy() {\n\tthis->removeSubscriptionToAllMessageTypes(this->GetTypeId());\n}\n<commit_msg>Fixed calculation of GridZone coordinates<commit_after>\/\/\n\/\/  GridZone.cpp\n\/\/  Created by Matt Kaufmann on 01\/07\/14.\n\/\/\n\n#include \"ExampleGame\/Components\/ComponentTypes\/ComponentTypeIds.h\"\n#include \"ExampleGame\/Components\/Grid\/GridCell.h\"\n#include \"ExampleGame\/Components\/Grid\/GridManager.h\"\n#include \"ExampleGame\/Components\/Grid\/GridZone.h\"\n#include \"ExampleGame\/GameSingletons\/GameSingletons.h\"\n#include \"ExampleGame\/Messages\/Declarations.h\"\n#include \"Vajra\/Engine\/Components\/DerivedComponents\/Transform\/Transform.h\"\n\nunsigned int GridZone::componentTypeId = COMPONENT_TYPE_ID_GRID_ZONE;\n\nGridZone::GridZone() : Component() {\n\tthis->init();\n}\n\nGridZone::GridZone(Object* object_) : Component(object_) {\n\tthis->init();\n}\n\nGridZone::~GridZone() {\n\tthis->destroy();\n}\n\nvoid GridZone::GetZoneBounds(int& west, int& east, int& south, int& north) {\n\tTransform* trans = this->GetObject()->GetComponent<Transform>();\n\n\tint centerX, centerZ;\n\tSINGLETONS->GetGridManager()->GetGrid()->GetCoordinates(centerX, centerZ, trans->GetPositionWorld());\n\n\tglm::vec3 forward = trans->GetForward();\n\n\t\/\/ Determine the rough orientation of the object.\n\tif (abs(forward.z) >= abs(forward.x)) {\n\t\tif (forward.z >= 0.0f) {\n\t\t\twest  = centerX + this->westBound;\n\t\t\teast  = centerX + this->eastBound;\n\t\t\tsouth = centerZ + this->southBound;\n\t\t\tnorth = centerZ + this->northBound;\n\t\t}\n\t\telse {\n\t\t\twest  = centerX - this->eastBound;\n\t\t\teast  = centerX - this->westBound;\n\t\t\tsouth = centerZ - this->northBound;\n\t\t\tnorth = centerZ - this->southBound;\n\t\t}\n\t}\n\telse {\n\t\tif (forward.x >= 0.0f) {\n\t\t\twest  = centerX - this->northBound;\n\t\t\teast  = centerX - this->southBound;\n\t\t\tsouth = centerZ + this->westBound;\n\t\t\tnorth = centerZ + this->eastBound;\n\t\t}\n\t\telse {\n\t\t\twest  = centerX + this->southBound;\n\t\t\teast  = centerX + this->northBound;\n\t\t\tsouth = centerZ - this->eastBound;\n\t\t\tnorth = centerZ - this->westBound;\n\t\t}\n\t}\n}\n\nvoid GridZone::SetZoneBounds(int xMin, int zMin, int xMax, int zMax) {\n\tif (xMin <= xMax) {\n\t\tthis->westBound = xMin;\n\t\tthis->eastBound = xMax;\n\t}\n\telse {\n\t\tthis->westBound = xMax;\n\t\tthis->eastBound = xMin;\n\t}\n\tif (zMin <= zMax) {\n\t\tthis->southBound = zMin;\n\t\tthis->northBound = zMax;\n\t}\n\telse {\n\t\tthis->southBound = zMax;\n\t\tthis->northBound = zMin;\n\t}\n}\n\nbool GridZone::IsCellWithinZone(GridCell* cell) {\n\tif (cell != nullptr) {\n\t\tint west, east, south, north;\n\n\t\tthis->GetZoneBounds(west, east, south, north);\n\n\t\treturn ((cell->x >= west) && (cell->x <= east) && (cell->z >= south) && (cell->z <= north));\n\t}\n\n\treturn false;\n}\n\nvoid GridZone::init() {\n\tthis->zoneType = GRID_ZONE_TYPE_UNKNOWN;\n\tthis->westBound = -1;\n\tthis->eastBound = -1;\n\tthis->southBound = -1;\n\tthis->northBound = -1;\n\n\tSINGLETONS->GetGridManager()->GetGrid()->AddGridZone(this->GetObject()->GetId());\n}\n\nvoid GridZone::destroy() {\n\tthis->removeSubscriptionToAllMessageTypes(this->GetTypeId());\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 <qfeedbackactuator.h>\n#include \"qfeedback.h\"\n#include <QtCore\/QVariant>\n#include <QtCore\/QtPlugin>\n#include <QtGui\/QApplication>\n\nQ_EXPORT_PLUGIN2(feedback_symbian, QFeedbackSymbian)\n\n\n\n#define VIBRA_DEVICE 0\n#define TOUCH_DEVICE 1\n\n\/\/TODO: is activeWindow good enough\n\/\/or should we create a widget for that?\nCCoeControl *QFeedbackSymbian::defaultWidget()\n{\n    QWidget *w = QApplication::activeWindow();\n    return w ? w->winId() : 0;\n}\n\n#ifndef NO_TACTILE_SUPPORT\n#include <touchfeedback.h>\nstatic TTouchLogicalFeedback convertToSymbian(QFeedbackEffect::ThemeEffect effect)\n{\n\n    TTouchLogicalFeedback themeFeedbackSymbian = ETouchFeedbackBasic;\n\n    switch (effect) {\n    case QFeedbackEffect::ThemeBasic:\n        themeFeedbackSymbian = ETouchFeedbackBasic;\n        break;\n    case QFeedbackEffect::ThemeSensitive:\n        themeFeedbackSymbian = ETouchFeedbackSensitive;\n        break;\n#ifdef ADVANCED_TACTILE_SUPPORT\n    case QFeedbackEffect::ThemeBasicButton:\n        themeFeedbackSymbian = ETouchFeedbackBasicButton;\n        break;\n    case QFeedbackEffect::ThemeSensitiveButton:\n        themeFeedbackSymbian = ETouchFeedbackSensitiveButton;\n        break;\n    case QFeedbackEffect::ThemeBasicItem:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemeSensitiveItem:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemeBounceEffect:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemePopupOpen:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemePopupClose:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemeBasicSlider:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemeSensitiveSlider:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemeStopFlick:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemeFlick:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemeEditor:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemeTextSelection:\n        themeFeedbackSymbian = ETouchFeedbackTextSelection;\n        break;\n    case QFeedbackEffect::ThemeBlankSelection:\n        themeFeedbackSymbian = ETouchFeedbackBlankSelection;\n        break;\n    case QFeedbackEffect::ThemeLineSelection:\n        themeFeedbackSymbian = ETouchFeedbackLineSelection;\n        break;\n    case QFeedbackEffect::ThemeEmptyLineSelection:\n        themeFeedbackSymbian = ETouchFeedbackEmptyLineSelection;\n        break;\n    case QFeedbackEffect::ThemeCheckbox:\n        themeFeedbackSymbian = ETouchFeedbackCheckbox;\n        break;\n    case QFeedbackEffect::ThemeMultipleCheckbox:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemeSensitiveKeypad:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemeBasicKeypad:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemeMultitouchActivate:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemeRotateStep:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemeItemDrop:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ItemMoveOver:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ItemPick:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect:::ItemScroll:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::PopUp:\n        themeFeedbackSymbian = ETouchFeedbackPopUp;\n        break;\n    case QFeedbackEffect::LongPress:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n#endif \/\/ADVANCED_TACTILE_SUPPORT\n    default:\n        break;\n    }\n    return themeFeedbackSymbian;\n}\n\n#ifdef ADVANCED_TACTILE_SUPPORT\ntypedef QTouchFeedback MTouchFeedback;\n#else\nclass QTouchFeedback : public MTouchFeedback\n{\npublic:\n\n    static QTouchFeedback *Instance()\n    {\n        return static_cast<QTouchFeedback*>(MTouchFeedback::Instance());\n    }\n\n    void StopFeedback(const CCoeControl* dummy)\n    {\n        Q_UNUSED(dummy);\n    }\n\n    void ModifyFeedback(const CCoeControl* dummy, int intensity)\n    {\n        Q_UNUSED(dummy);\n        Q_UNUSED(intensity);\n    }\n\n    void StartFeedback(const CCoeControl* dummy, int effect, void *event, int intensity, int duration)\n    {\n        Q_UNUSED(dummy);\n        Q_UNUSED(effect);\n        Q_UNUSED(event);\n        Q_UNUSED(intensity);\n        Q_UNUSED(duration);\n        \/\/if there is no advanced feedback, we just do the normal one and return -1\n        MTouchFeedback::Instance()->InstantFeedback(ETouchFeedbackSensitive);\n    }\n};\n#endif \/\/ADVANCED_TACTILE_SUPPORT\n\nQFeedbackInterface::PluginPriority QFeedbackSymbian::pluginPriority()\n{\n    return PluginLowPriority;\n}\n\nbool QFeedbackSymbian::play(QFeedbackEffect::ThemeEffect effect)\n{\n    QTouchFeedback::Instance()->InstantFeedback(convertToSymbian(effect));\n    return true; \/\/there is no way to kno if there was a failure\n}\n\n#endif \/\/NO_TACTILE_SUPPORT\n\nQFeedbackSymbian::QFeedbackSymbian() : m_vibra(0), m_vibraActive(true)\n{\n}\n\nQFeedbackSymbian::~QFeedbackSymbian()\n{\n    delete m_vibra;\n}\n\nCHWRMVibra *QFeedbackSymbian::vibra()\n{\n    if (!m_vibra)\n        m_vibra = CHWRMVibra::NewL();\n\n    return m_vibra;\n}\n\nQList<QFeedbackActuator> QFeedbackSymbian::actuators()\n{\n    QList<QFeedbackActuator> ret;\n#ifndef NO_TACTILE_SUPPORT\n    \/\/if we don't have advanced tactile support then the MTouchFeedback doesn't really support custom effects\n    if (QTouchFeedback::Instance()->TouchFeedbackSupported()) {\n        ret << createFeedbackActuator(TOUCH_DEVICE);\n    }\n#endif \/\/NO_TACTILE_SUPPORT\n    ret << createFeedbackActuator(VIBRA_DEVICE);\n    return ret;\n}\n\nvoid QFeedbackSymbian::setActuatorProperty(const QFeedbackActuator &actuator, ActuatorProperty prop, const QVariant &value)\n{\n    switch(prop)\n    {\n    case Enabled:\n        switch(actuator.id())\n        {\n        case VIBRA_DEVICE:\n            m_vibraActive = value.toBool();\n            break;\n    #ifndef NO_TACTILE_SUPPORT\n        case TOUCH_DEVICE:\n            QTouchFeedback::Instance()->SetFeedbackEnabledForThisApp(value.toBool());\n            break;\n    #endif \/\/NO_TACTILE_SUPPORT\n        default:\n            break;\n        }\n    }\n}\n\nQVariant QFeedbackSymbian::actuatorProperty(const QFeedbackActuator &actuator, ActuatorProperty prop)\n{\n    switch(prop)\n    {\n    case Name:\n        switch(actuator.id())\n        {\n        case VIBRA_DEVICE:\n            return QLatin1String(\"Vibra\");\n        case TOUCH_DEVICE:\n            return QLatin1String(\"Touch\");\n        default:\n            return QString();\n        }\n    case State:\n        {\n            QFeedbackActuator::State ret = QFeedbackActuator::Unknown;\n            switch(actuator.id())\n            {\n            case VIBRA_DEVICE:\n                switch (vibra()->VibraStatus())\n                {\n                case CHWRMVibra::EVibraStatusStopped:\n                    return QFeedbackActuator::Ready;\n                case CHWRMVibra::EVibraStatusOn:\n                    return QFeedbackActuator::Busy;\n                default:\n                    return QFeedbackActuator::Unknown;\n                }\n            case TOUCH_DEVICE:\n                \/\/there is no way of getting the state of the device!\n            default:\n                return QFeedbackActuator::Unknown;\n            }\n            return ret;\n        }\n    case Enabled:\n        switch(actuator.id())\n        {\n        case VIBRA_DEVICE:\n            return m_vibraActive;\n    #ifndef NO_TACTILE_SUPPORT\n        case TOUCH_DEVICE:\n            return QTouchFeedback::Instance()->FeedbackEnabledForThisApp();\n    #endif \/\/NO_TACTILE_SUPPORT\n        default:\n            return false;\n        }\n    default:\n        return QVariant();\n    }\n\n}\n\nbool QFeedbackSymbian::isActuatorCapabilitySupported(QFeedbackActuator::Capability)\n{\n    return false;\n}\n\n\nQFeedbackEffect::ErrorType QFeedbackSymbian::updateEffectProperty(const QFeedbackHapticsEffect *effect, EffectProperty prop)\n{\n\n    switch(prop)\n    {\n    case Intensity:\n        if (effect->state() != QAbstractAnimation::Running)\n            break;\n\n        switch(effect->actuator().id())\n        {\n        case VIBRA_DEVICE:\n            vibra()->StartVibraL(effect->duration() - effect->currentTime(), qRound(100 * effect->intensity()));\n            break;\n#ifndef NO_TACTILE_SUPPORT\n        case TOUCH_DEVICE:\n            QTouchFeedback::Instance()->ModifyFeedback(defaultWidget(), qRound(100 * effect->intensity()));\n            break;\n#endif \/\/NO_TACTILE_SUPPORT\n        default:\n            break;\n        }\n        break;\n\n    }\n\n    return QFeedbackEffect::NoError;\n\n}\n\nQFeedbackEffect::ErrorType QFeedbackSymbian::updateEffectState(const QFeedbackHapticsEffect *effect)\n{\n    switch(effect->actuator().id())\n    {\n    case VIBRA_DEVICE:\n        switch(effect->state())\n        {\n        case QAbstractAnimation::Stopped:\n        case QAbstractAnimation::Paused:\n            vibra()->StopVibraL();\n            break;\n        case QAbstractAnimation::Running:\n            vibra()->StartVibraL(effect->duration() - effect->currentTime(), qRound(100 * effect->intensity()));\n            break;\n        }\n        break;\n#ifndef NO_TACTILE_SUPPORT\n    case TOUCH_DEVICE:\n        switch(effect->state())\n        {\n        case QAbstractAnimation::Paused:\n        case QAbstractAnimation::Stopped:\n            QTouchFeedback::Instance()->StopFeedback(defaultWidget());\n            break;\n        case QAbstractAnimation::Running:\n            QTouchFeedback::Instance()->StartFeedback(defaultWidget(),\n                                         0, \/\/what effect\n                                         0, qRound(effect->intensity() * 100), qMax(0, effect->duration()*1000));\n            break;\n        }\n        break;\n#endif \/\/NO_TACTILE_SUPPORT\n    default:\n        break;\n    }\n    return QFeedbackEffect::NoError;\n}\n\nQAbstractAnimation::State QFeedbackSymbian::actualEffectState(const QFeedbackHapticsEffect *effect)\n{\n    return effect->state();\n}\n<commit_msg>Move a symbol out of a conditional block.<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 <qfeedbackactuator.h>\n#include \"qfeedback.h\"\n#include <QtCore\/QVariant>\n#include <QtCore\/QtPlugin>\n#include <QtGui\/QApplication>\n\nQ_EXPORT_PLUGIN2(feedback_symbian, QFeedbackSymbian)\n\n\n\n#define VIBRA_DEVICE 0\n#define TOUCH_DEVICE 1\n\n\/\/TODO: is activeWindow good enough\n\/\/or should we create a widget for that?\nCCoeControl *QFeedbackSymbian::defaultWidget()\n{\n    QWidget *w = QApplication::activeWindow();\n    return w ? w->winId() : 0;\n}\n\n#ifndef NO_TACTILE_SUPPORT\n#include <touchfeedback.h>\nstatic TTouchLogicalFeedback convertToSymbian(QFeedbackEffect::ThemeEffect effect)\n{\n\n    TTouchLogicalFeedback themeFeedbackSymbian = ETouchFeedbackBasic;\n\n    switch (effect) {\n    case QFeedbackEffect::ThemeBasic:\n        themeFeedbackSymbian = ETouchFeedbackBasic;\n        break;\n    case QFeedbackEffect::ThemeSensitive:\n        themeFeedbackSymbian = ETouchFeedbackSensitive;\n        break;\n#ifdef ADVANCED_TACTILE_SUPPORT\n    case QFeedbackEffect::ThemeBasicButton:\n        themeFeedbackSymbian = ETouchFeedbackBasicButton;\n        break;\n    case QFeedbackEffect::ThemeSensitiveButton:\n        themeFeedbackSymbian = ETouchFeedbackSensitiveButton;\n        break;\n    case QFeedbackEffect::ThemeBasicItem:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemeSensitiveItem:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemeBounceEffect:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemePopupOpen:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemePopupClose:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemeBasicSlider:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemeSensitiveSlider:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemeStopFlick:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemeFlick:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemeEditor:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemeTextSelection:\n        themeFeedbackSymbian = ETouchFeedbackTextSelection;\n        break;\n    case QFeedbackEffect::ThemeBlankSelection:\n        themeFeedbackSymbian = ETouchFeedbackBlankSelection;\n        break;\n    case QFeedbackEffect::ThemeLineSelection:\n        themeFeedbackSymbian = ETouchFeedbackLineSelection;\n        break;\n    case QFeedbackEffect::ThemeEmptyLineSelection:\n        themeFeedbackSymbian = ETouchFeedbackEmptyLineSelection;\n        break;\n    case QFeedbackEffect::ThemeCheckbox:\n        themeFeedbackSymbian = ETouchFeedbackCheckbox;\n        break;\n    case QFeedbackEffect::ThemeMultipleCheckbox:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemeSensitiveKeypad:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemeBasicKeypad:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemeMultitouchActivate:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemeRotateStep:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ThemeItemDrop:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ItemMoveOver:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::ItemPick:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect:::ItemScroll:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n    case QFeedbackEffect::PopUp:\n        themeFeedbackSymbian = ETouchFeedbackPopUp;\n        break;\n    case QFeedbackEffect::LongPress:\n        themeFeedbackSymbian = ETouchFeedbackBasic; \/\/ Effects changing in 10.1 are mapped to basic.\n        break;\n#endif \/\/ADVANCED_TACTILE_SUPPORT\n    default:\n        break;\n    }\n    return themeFeedbackSymbian;\n}\n\n#ifdef ADVANCED_TACTILE_SUPPORT\ntypedef QTouchFeedback MTouchFeedback;\n#else\nclass QTouchFeedback : public MTouchFeedback\n{\npublic:\n\n    static QTouchFeedback *Instance()\n    {\n        return static_cast<QTouchFeedback*>(MTouchFeedback::Instance());\n    }\n\n    void StopFeedback(const CCoeControl* dummy)\n    {\n        Q_UNUSED(dummy);\n    }\n\n    void ModifyFeedback(const CCoeControl* dummy, int intensity)\n    {\n        Q_UNUSED(dummy);\n        Q_UNUSED(intensity);\n    }\n\n    void StartFeedback(const CCoeControl* dummy, int effect, void *event, int intensity, int duration)\n    {\n        Q_UNUSED(dummy);\n        Q_UNUSED(effect);\n        Q_UNUSED(event);\n        Q_UNUSED(intensity);\n        Q_UNUSED(duration);\n        \/\/if there is no advanced feedback, we just do the normal one and return -1\n        MTouchFeedback::Instance()->InstantFeedback(ETouchFeedbackSensitive);\n    }\n};\n#endif \/\/ADVANCED_TACTILE_SUPPORT\n\nbool QFeedbackSymbian::play(QFeedbackEffect::ThemeEffect effect)\n{\n    QTouchFeedback::Instance()->InstantFeedback(convertToSymbian(effect));\n    return true; \/\/there is no way to kno if there was a failure\n}\n\n#endif \/\/NO_TACTILE_SUPPORT\n\nQFeedbackInterface::PluginPriority QFeedbackSymbian::pluginPriority()\n{\n    return PluginLowPriority;\n}\n\nQFeedbackSymbian::QFeedbackSymbian() : m_vibra(0), m_vibraActive(true)\n{\n}\n\nQFeedbackSymbian::~QFeedbackSymbian()\n{\n    delete m_vibra;\n}\n\nCHWRMVibra *QFeedbackSymbian::vibra()\n{\n    if (!m_vibra)\n        m_vibra = CHWRMVibra::NewL();\n\n    return m_vibra;\n}\n\nQList<QFeedbackActuator> QFeedbackSymbian::actuators()\n{\n    QList<QFeedbackActuator> ret;\n#ifndef NO_TACTILE_SUPPORT\n    \/\/if we don't have advanced tactile support then the MTouchFeedback doesn't really support custom effects\n    if (QTouchFeedback::Instance()->TouchFeedbackSupported()) {\n        ret << createFeedbackActuator(TOUCH_DEVICE);\n    }\n#endif \/\/NO_TACTILE_SUPPORT\n    ret << createFeedbackActuator(VIBRA_DEVICE);\n    return ret;\n}\n\nvoid QFeedbackSymbian::setActuatorProperty(const QFeedbackActuator &actuator, ActuatorProperty prop, const QVariant &value)\n{\n    switch(prop)\n    {\n    case Enabled:\n        switch(actuator.id())\n        {\n        case VIBRA_DEVICE:\n            m_vibraActive = value.toBool();\n            break;\n    #ifndef NO_TACTILE_SUPPORT\n        case TOUCH_DEVICE:\n            QTouchFeedback::Instance()->SetFeedbackEnabledForThisApp(value.toBool());\n            break;\n    #endif \/\/NO_TACTILE_SUPPORT\n        default:\n            break;\n        }\n    }\n}\n\nQVariant QFeedbackSymbian::actuatorProperty(const QFeedbackActuator &actuator, ActuatorProperty prop)\n{\n    switch(prop)\n    {\n    case Name:\n        switch(actuator.id())\n        {\n        case VIBRA_DEVICE:\n            return QLatin1String(\"Vibra\");\n        case TOUCH_DEVICE:\n            return QLatin1String(\"Touch\");\n        default:\n            return QString();\n        }\n    case State:\n        {\n            QFeedbackActuator::State ret = QFeedbackActuator::Unknown;\n            switch(actuator.id())\n            {\n            case VIBRA_DEVICE:\n                switch (vibra()->VibraStatus())\n                {\n                case CHWRMVibra::EVibraStatusStopped:\n                    return QFeedbackActuator::Ready;\n                case CHWRMVibra::EVibraStatusOn:\n                    return QFeedbackActuator::Busy;\n                default:\n                    return QFeedbackActuator::Unknown;\n                }\n            case TOUCH_DEVICE:\n                \/\/there is no way of getting the state of the device!\n            default:\n                return QFeedbackActuator::Unknown;\n            }\n            return ret;\n        }\n    case Enabled:\n        switch(actuator.id())\n        {\n        case VIBRA_DEVICE:\n            return m_vibraActive;\n    #ifndef NO_TACTILE_SUPPORT\n        case TOUCH_DEVICE:\n            return QTouchFeedback::Instance()->FeedbackEnabledForThisApp();\n    #endif \/\/NO_TACTILE_SUPPORT\n        default:\n            return false;\n        }\n    default:\n        return QVariant();\n    }\n\n}\n\nbool QFeedbackSymbian::isActuatorCapabilitySupported(QFeedbackActuator::Capability)\n{\n    return false;\n}\n\n\nQFeedbackEffect::ErrorType QFeedbackSymbian::updateEffectProperty(const QFeedbackHapticsEffect *effect, EffectProperty prop)\n{\n\n    switch(prop)\n    {\n    case Intensity:\n        if (effect->state() != QAbstractAnimation::Running)\n            break;\n\n        switch(effect->actuator().id())\n        {\n        case VIBRA_DEVICE:\n            vibra()->StartVibraL(effect->duration() - effect->currentTime(), qRound(100 * effect->intensity()));\n            break;\n#ifndef NO_TACTILE_SUPPORT\n        case TOUCH_DEVICE:\n            QTouchFeedback::Instance()->ModifyFeedback(defaultWidget(), qRound(100 * effect->intensity()));\n            break;\n#endif \/\/NO_TACTILE_SUPPORT\n        default:\n            break;\n        }\n        break;\n\n    }\n\n    return QFeedbackEffect::NoError;\n\n}\n\nQFeedbackEffect::ErrorType QFeedbackSymbian::updateEffectState(const QFeedbackHapticsEffect *effect)\n{\n    switch(effect->actuator().id())\n    {\n    case VIBRA_DEVICE:\n        switch(effect->state())\n        {\n        case QAbstractAnimation::Stopped:\n        case QAbstractAnimation::Paused:\n            vibra()->StopVibraL();\n            break;\n        case QAbstractAnimation::Running:\n            vibra()->StartVibraL(effect->duration() - effect->currentTime(), qRound(100 * effect->intensity()));\n            break;\n        }\n        break;\n#ifndef NO_TACTILE_SUPPORT\n    case TOUCH_DEVICE:\n        switch(effect->state())\n        {\n        case QAbstractAnimation::Paused:\n        case QAbstractAnimation::Stopped:\n            QTouchFeedback::Instance()->StopFeedback(defaultWidget());\n            break;\n        case QAbstractAnimation::Running:\n            QTouchFeedback::Instance()->StartFeedback(defaultWidget(),\n                                         0, \/\/what effect\n                                         0, qRound(effect->intensity() * 100), qMax(0, effect->duration()*1000));\n            break;\n        }\n        break;\n#endif \/\/NO_TACTILE_SUPPORT\n    default:\n        break;\n    }\n    return QFeedbackEffect::NoError;\n}\n\nQAbstractAnimation::State QFeedbackSymbian::actualEffectState(const QFeedbackHapticsEffect *effect)\n{\n    return effect->state();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ opencv related headers\n#include <opencv2\/core\/core.hpp>\n#include <opencv2\/highgui\/highgui.hpp>\n\n\/\/ system related headers\n#include <iostream>\n\n\/\/ pixkit-image\n#include \"..\/..\/..\/modules\/pixkit-image\/include\/pixkit-image.hpp\"\n\n\nvoid main(){\n\tcv::Mat\tsrc,dst;\n\tsrc\t=\tcv::imread(\"2.bmp\",CV_LOAD_IMAGE_GRAYSCALE);\n\tif(!src.empty()){\n\t\t\/\/ process\n\t\tif(pixkit::enhancement::local::CLAHE1987(src,dst,cv::Size(33,33),1)){\n\t\t\t\/\/ write output\n\t\t\tcv::imwrite(\"output.bmp\",dst);\n\t\t\t\/\/ show image\n\t\t\tcv::imshow(\"src\",src);\n\t\t\tcv::imshow(\"dst\",dst);\t\t\t\n\t\t\tcv::waitKey(0);\n\t\t}\n\t}\n}<commit_msg>change example<commit_after>\/\/ opencv related headers\n#include <opencv2\/core\/core.hpp>\n#include <opencv2\/highgui\/highgui.hpp>\n\n\/\/ system related headers\n#include <iostream>\n\n\/\/ pixkit-image\n#include \"..\/..\/..\/modules\/pixkit-image\/include\/pixkit-image.hpp\"\n\n\nvoid main(){\n\tcv::Mat\tsrc,dst;\n\tsrc\t=\tcv::imread(\"2.bmp\",CV_LOAD_IMAGE_GRAYSCALE);\n\tif(!src.empty()){\n\t\t\/\/ process\n\t\tif(pixkit::enhancement::global::MaryKim2008(src,dst,2)){\n\t\t\t\/\/ write output\n\t\t\tcv::imwrite(\"output.bmp\",dst);\n\t\t\t\/\/ show image\n\t\t\tcv::imshow(\"src\",src);\n\t\t\tcv::imshow(\"dst\",dst);\t\t\t\n\t\t\tcv::waitKey(0);\n\t\t}\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n* TLS echo server using BSD sockets\n* (C) 2014 Jack Lloyd\n*     2017 René Korthaus, Rohde & Schwarz Cybersecurity\n*\n* Botan is released under the Simplified BSD License (see license.txt)\n*\/\n\n#include \"cli.h\"\n#include \"sandbox.h\"\n\n#if defined(BOTAN_HAS_TLS) && defined(BOTAN_TARGET_OS_HAS_FILESYSTEM) && \\\n   (defined(BOTAN_TARGET_OS_HAS_SOCKETS) || defined(BOTAN_TARGET_OS_HAS_WINSOCK2))\n\n#if defined(SO_USER_COOKIE)\n#define SOCKET_ID 1\n#else\n#define SOCKET_ID 0\n#endif\n\n#include <botan\/tls_server.h>\n#include <botan\/tls_policy.h>\n#include <botan\/hex.h>\n#include <botan\/internal\/os_utils.h>\n\n#include <list>\n#include <fstream>\n\n#include \"credentials.h\"\n#include \"socket_utils.h\"\n\nnamespace Botan_CLI {\n\nclass TLS_Server final : public Command, public Botan::TLS::Callbacks\n   {\n   public:\n#if SOCKET_ID\n      TLS_Server() : Command(\"tls_server cert key --port=443 --type=tcp --policy= --dump-traces= --max-clients=0 -socket-id=0\")\n#else\n      TLS_Server() : Command(\"tls_server cert key --port=443 --type=tcp --policy= --dump-traces= --max-clients=0\")\n#endif\n         {\n         init_sockets();\n         }\n\n      ~TLS_Server()\n         {\n         stop_sockets();\n         }\n\n      std::string group() const override\n         {\n         return \"tls\";\n         }\n\n      std::string description() const override\n         {\n         return \"Accept TLS\/DTLS connections from TLS\/DTLS clients\";\n         }\n\n      void go() override\n         {\n         const std::string server_crt = get_arg(\"cert\");\n         const std::string server_key = get_arg(\"key\");\n         const int port = get_arg_sz(\"port\");\n         const size_t max_clients = get_arg_sz(\"max-clients\");\n         const std::string transport = get_arg(\"type\");\n         const std::string dump_traces_to = get_arg(\"dump-traces\");\n#if SOCKET_ID\n\t m_socket_id = get_arg_sz(\"socket-id\");\n#endif\n\n         if(transport != \"tcp\" && transport != \"udp\")\n            {\n            throw CLI_Usage_Error(\"Invalid transport type '\" + transport + \"' for TLS\");\n            }\n\n         m_is_tcp = (transport == \"tcp\");\n\n         std::unique_ptr<Botan::TLS::Policy> policy;\n         const std::string policy_file = get_arg(\"policy\");\n         if(policy_file.size() > 0)\n            {\n            std::ifstream policy_stream(policy_file);\n            if(!policy_stream.good())\n               {\n               error_output() << \"Failed reading policy file\\n\";\n               return;\n               }\n            policy.reset(new Botan::TLS::Text_Policy(policy_stream));\n            }\n\n         if(!policy)\n            {\n            policy.reset(new Botan::TLS::Policy);\n            }\n\n         Botan::TLS::Session_Manager_In_Memory session_manager(rng()); \/\/ TODO sqlite3\n\n         Basic_Credentials_Manager creds(rng(), server_crt, server_key);\n\n         output() << \"Listening for new connections on \" << transport << \" port \" << port << std::endl;\n\n\t if(!m_sandbox.init())\n            {\n            error_output() << \"Failed sandboxing\\n\";\n\t    return;\n\t    }\n\n         int server_fd = make_server_socket(port);\n         size_t clients_served = 0;\n\n         while(true)\n            {\n            if(max_clients > 0 && clients_served >= max_clients)\n               break;\n\n            if(m_is_tcp)\n               {\n               m_socket = ::accept(server_fd, nullptr, nullptr);\n               }\n            else\n               {\n               struct sockaddr_in from;\n               socklen_t from_len = sizeof(sockaddr_in);\n\n               \/\/ macOS handles zero size buffers differently - it will return 0 even if there's no incoming data,\n               \/\/ and after that connect() will fail as sockaddr_in from is not initialized\n               int dummy;\n               if(::recvfrom(server_fd, reinterpret_cast<char*>(&dummy), sizeof(dummy), MSG_PEEK, reinterpret_cast<struct sockaddr*>(&from), &from_len) != 0)\n                  {\n                  throw CLI_Error(\"Could not peek next packet\");\n                  }\n\n               if(::connect(server_fd, reinterpret_cast<struct sockaddr*>(&from), from_len) != 0)\n                  {\n                  throw CLI_Error(\"Could not connect UDP socket\");\n                  }\n               m_socket = server_fd;\n               }\n\n            clients_served++;\n\n            Botan::TLS::Server server(\n               *this,\n               session_manager,\n               creds,\n               *policy,\n               rng(),\n               m_is_tcp == false);\n\n            std::unique_ptr<std::ostream> dump_stream;\n\n            if(!dump_traces_to.empty())\n               {\n               uint64_t timestamp = Botan::OS::get_high_resolution_clock();\n               const std::string dump_file =\n                  dump_traces_to + \"\/tls_\" + std::to_string(timestamp) + \".bin\";\n               dump_stream.reset(new std::ofstream(dump_file.c_str()));\n               }\n\n            try\n               {\n               while(!server.is_closed())\n                  {\n                  try\n                     {\n                     uint8_t buf[4 * 1024] = { 0 };\n                     ssize_t got = ::read(m_socket, buf, sizeof(buf));\n\n                     if(got == -1)\n                        {\n                        error_output() << \"Error in socket read - \" << std::strerror(errno) << std::endl;\n                        break;\n                        }\n\n                     if(got == 0)\n                        {\n                        error_output() << \"EOF on socket\" << std::endl;\n                        break;\n                        }\n\n                     if(dump_stream)\n                        {\n                        dump_stream->write(reinterpret_cast<const char*>(buf), got);\n                        }\n\n                     server.received_data(buf, got);\n\n                     while(server.is_active() && !m_pending_output.empty())\n                        {\n                        std::string output = m_pending_output.front();\n                        m_pending_output.pop_front();\n                        server.send(output);\n\n                        if(output == \"quit\\n\")\n                           {\n                           server.close();\n                           }\n                        }\n                     }\n                  catch(std::exception& e)\n                     {\n                     error_output() << \"Connection problem: \" << e.what() << std::endl;\n                     if(m_is_tcp)\n                        {\n                        ::close(m_socket);\n                        m_socket = -1;\n                        }\n                     }\n                  }\n               }\n            catch(Botan::Exception& e)\n               {\n               error_output() << \"Connection failed: \" << e.what() << \"\\n\";\n               }\n\n            if(m_is_tcp)\n               {\n               ::close(m_socket);\n               m_socket = -1;\n               }\n            }\n\n         ::close(server_fd);\n         }\n   private:\n      int make_server_socket(uint16_t port)\n         {\n         const int type = m_is_tcp ? SOCK_STREAM : SOCK_DGRAM;\n\n         int fd = ::socket(PF_INET, type, 0);\n         if(fd == -1)\n            {\n            throw CLI_Error(\"Unable to acquire socket\");\n            }\n\n         sockaddr_in socket_info;\n         Botan::clear_mem(&socket_info, 1);\n         socket_info.sin_family = AF_INET;\n         socket_info.sin_port = htons(port);\n\n         \/\/ FIXME: support limiting listeners\n         socket_info.sin_addr.s_addr = INADDR_ANY;\n\n         if(::bind(fd, reinterpret_cast<struct sockaddr*>(&socket_info), sizeof(struct sockaddr)) != 0)\n            {\n            ::close(fd);\n            throw CLI_Error(\"server bind failed\");\n            }\n\n         if(m_is_tcp)\n            {\n            if(::listen(fd, 100) != 0)\n               {\n               ::close(fd);\n               throw CLI_Error(\"listen failed\");\n               }\n            }\n\t if(m_socket_id > 0)\n            {\n#if SOCKET_ID\n\/\/ Other oses could have other means to trace sockets\n#if defined(SO_USER_COOKIE)\n            if(::setsockopt(fd, SOL_SOCKET, SO_USER_COOKIE, reinterpret_cast<const void *>(&m_socket_id), sizeof(m_socket_id)) != 0)\n               {\n               \/\/ Failed but not world-ending issue\n               output() << \"set socket cookie id failed\" << std::endl;\n\t       }\n#endif\n#endif\n\t    }\n         return fd;\n         }\n\n      bool tls_session_established(const Botan::TLS::Session& session) override\n         {\n         output() << \"Handshake complete, \" << session.version().to_string()\n                  << \" using \" << session.ciphersuite().to_string() << std::endl;\n\n         if(!session.session_id().empty())\n            {\n            output() << \"Session ID \" << Botan::hex_encode(session.session_id()) << std::endl;\n            }\n\n         if(!session.session_ticket().empty())\n            {\n            output() << \"Session ticket \" << Botan::hex_encode(session.session_ticket()) << std::endl;\n            }\n\n         return true;\n         }\n\n      void tls_record_received(uint64_t, const uint8_t input[], size_t input_len) override\n         {\n         for(size_t i = 0; i != input_len; ++i)\n            {\n            const char c = static_cast<char>(input[i]);\n            m_line_buf += c;\n            if(c == '\\n')\n               {\n               m_pending_output.push_back(m_line_buf);\n               m_line_buf.clear();\n               }\n            }\n         }\n\n      void tls_emit_data(const uint8_t buf[], size_t length) override\n         {\n         if(m_is_tcp)\n            {\n            ssize_t sent = ::send(m_socket, buf, length, MSG_NOSIGNAL);\n\n            if(sent == -1)\n               {\n               error_output() << \"Error writing to socket - \" << std::strerror(errno) << std::endl;\n               }\n            else if(sent != static_cast<ssize_t>(length))\n               {\n               error_output() << \"Packet of length \" << length << \" truncated to \" << sent << std::endl;\n               }\n            }\n         else\n            {\n            while(length)\n               {\n               ssize_t sent = ::send(m_socket, buf, length, MSG_NOSIGNAL);\n\n               if(sent == -1)\n                  {\n                  if(errno == EINTR)\n                     {\n                     sent = 0;\n                     }\n                  else\n                     {\n                     throw CLI_Error(\"Socket write failed\");\n                     }\n                  }\n\n               buf += sent;\n               length -= sent;\n               }\n            }\n         }\n\n      void tls_alert(Botan::TLS::Alert alert) override\n         {\n         output() << \"Alert: \" << alert.type_string() << std::endl;\n         }\n\n      std::string tls_server_choose_app_protocol(const std::vector<std::string>&) override\n         {\n         \/\/ we ignore whatever the client sends here\n         return \"echo\/0.1\";\n         }\n\n      int m_socket = -1;\n      bool m_is_tcp = false;\n      uint32_t m_socket_id = 0;\n      std::string m_line_buf;\n      std::list<std::string> m_pending_output;\n      Sandbox m_sandbox;\n   };\n\nBOTAN_REGISTER_COMMAND(\"tls_server\", TLS_Server);\n\n}\n\n#endif\n<commit_msg>Fix tls_server<commit_after>\/*\n* TLS echo server using BSD sockets\n* (C) 2014 Jack Lloyd\n*     2017 René Korthaus, Rohde & Schwarz Cybersecurity\n*\n* Botan is released under the Simplified BSD License (see license.txt)\n*\/\n\n#include \"cli.h\"\n#include \"sandbox.h\"\n\n#if defined(BOTAN_HAS_TLS) && defined(BOTAN_TARGET_OS_HAS_FILESYSTEM) && \\\n   (defined(BOTAN_TARGET_OS_HAS_SOCKETS) || defined(BOTAN_TARGET_OS_HAS_WINSOCK2))\n\n#if defined(SO_USER_COOKIE)\n#define SOCKET_ID 1\n#else\n#define SOCKET_ID 0\n#endif\n\n#include <botan\/tls_server.h>\n#include <botan\/tls_policy.h>\n#include <botan\/hex.h>\n#include <botan\/internal\/os_utils.h>\n\n#include <list>\n#include <fstream>\n\n#include \"credentials.h\"\n#include \"socket_utils.h\"\n\nnamespace Botan_CLI {\n\nclass TLS_Server final : public Command, public Botan::TLS::Callbacks\n   {\n   public:\n#if SOCKET_ID\n      TLS_Server() : Command(\"tls_server cert key --port=443 --type=tcp --policy= --dump-traces= --max-clients=0 -socket-id=0\")\n#else\n      TLS_Server() : Command(\"tls_server cert key --port=443 --type=tcp --policy= --dump-traces= --max-clients=0\")\n#endif\n         {\n         init_sockets();\n         }\n\n      ~TLS_Server()\n         {\n         stop_sockets();\n         }\n\n      std::string group() const override\n         {\n         return \"tls\";\n         }\n\n      std::string description() const override\n         {\n         return \"Accept TLS\/DTLS connections from TLS\/DTLS clients\";\n         }\n\n      void go() override\n         {\n         const std::string server_crt = get_arg(\"cert\");\n         const std::string server_key = get_arg(\"key\");\n         const int port = get_arg_sz(\"port\");\n         const size_t max_clients = get_arg_sz(\"max-clients\");\n         const std::string transport = get_arg(\"type\");\n         const std::string dump_traces_to = get_arg(\"dump-traces\");\n#if SOCKET_ID\n\t m_socket_id = get_arg_sz(\"socket-id\");\n#endif\n\n         if(transport != \"tcp\" && transport != \"udp\")\n            {\n            throw CLI_Usage_Error(\"Invalid transport type '\" + transport + \"' for TLS\");\n            }\n\n         m_is_tcp = (transport == \"tcp\");\n\n         std::unique_ptr<Botan::TLS::Policy> policy;\n         const std::string policy_file = get_arg(\"policy\");\n         if(policy_file.size() > 0)\n            {\n            std::ifstream policy_stream(policy_file);\n            if(!policy_stream.good())\n               {\n               error_output() << \"Failed reading policy file\\n\";\n               return;\n               }\n            policy.reset(new Botan::TLS::Text_Policy(policy_stream));\n            }\n\n         if(!policy)\n            {\n            policy.reset(new Botan::TLS::Policy);\n            }\n\n         Botan::TLS::Session_Manager_In_Memory session_manager(rng()); \/\/ TODO sqlite3\n\n         Basic_Credentials_Manager creds(rng(), server_crt, server_key);\n\n         output() << \"Listening for new connections on \" << transport << \" port \" << port << std::endl;\n\n\t if(!m_sandbox.init())\n            {\n            error_output() << \"Failed sandboxing\\n\";\n\t    return;\n\t    }\n\n         int server_fd = make_server_socket(port);\n         size_t clients_served = 0;\n\n         while(true)\n            {\n            if(max_clients > 0 && clients_served >= max_clients)\n               break;\n\n            if(m_is_tcp)\n               {\n               m_socket = ::accept(server_fd, nullptr, nullptr);\n               }\n            else\n               {\n               struct sockaddr_in from;\n               socklen_t from_len = sizeof(sockaddr_in);\n\n               void* peek_buf = nullptr;\n               size_t peek_len = 0;\n\n#if defined(BOTAN_TARGET_OS_IS_MACOS)\n               \/\/ macOS handles zero size buffers differently - it will return 0 even if there's no incoming data,\n               \/\/ and after that connect() will fail as sockaddr_in from is not initialized\n               int dummy;\n               peek_buf = &dummy;\n               peek_len = sizeof(dummy);\n#endif\n\n               if(::recvfrom(server_fd, peek_buf, peek_len, MSG_PEEK, reinterpret_cast<struct sockaddr*>(&from), &from_len) != 0)\n                  {\n                  throw CLI_Error(\"Could not peek next packet\");\n                  }\n\n               if(::connect(server_fd, reinterpret_cast<struct sockaddr*>(&from), from_len) != 0)\n                  {\n                  throw CLI_Error(\"Could not connect UDP socket\");\n                  }\n               m_socket = server_fd;\n               }\n\n            clients_served++;\n\n            Botan::TLS::Server server(\n               *this,\n               session_manager,\n               creds,\n               *policy,\n               rng(),\n               m_is_tcp == false);\n\n            std::unique_ptr<std::ostream> dump_stream;\n\n            if(!dump_traces_to.empty())\n               {\n               uint64_t timestamp = Botan::OS::get_high_resolution_clock();\n               const std::string dump_file =\n                  dump_traces_to + \"\/tls_\" + std::to_string(timestamp) + \".bin\";\n               dump_stream.reset(new std::ofstream(dump_file.c_str()));\n               }\n\n            try\n               {\n               while(!server.is_closed())\n                  {\n                  try\n                     {\n                     uint8_t buf[4 * 1024] = { 0 };\n                     ssize_t got = ::read(m_socket, buf, sizeof(buf));\n\n                     if(got == -1)\n                        {\n                        error_output() << \"Error in socket read - \" << std::strerror(errno) << std::endl;\n                        break;\n                        }\n\n                     if(got == 0)\n                        {\n                        error_output() << \"EOF on socket\" << std::endl;\n                        break;\n                        }\n\n                     if(dump_stream)\n                        {\n                        dump_stream->write(reinterpret_cast<const char*>(buf), got);\n                        }\n\n                     server.received_data(buf, got);\n\n                     while(server.is_active() && !m_pending_output.empty())\n                        {\n                        std::string output = m_pending_output.front();\n                        m_pending_output.pop_front();\n                        server.send(output);\n\n                        if(output == \"quit\\n\")\n                           {\n                           server.close();\n                           }\n                        }\n                     }\n                  catch(std::exception& e)\n                     {\n                     error_output() << \"Connection problem: \" << e.what() << std::endl;\n                     if(m_is_tcp)\n                        {\n                        ::close(m_socket);\n                        m_socket = -1;\n                        }\n                     }\n                  }\n               }\n            catch(Botan::Exception& e)\n               {\n               error_output() << \"Connection failed: \" << e.what() << \"\\n\";\n               }\n\n            if(m_is_tcp)\n               {\n               ::close(m_socket);\n               m_socket = -1;\n               }\n            }\n\n         ::close(server_fd);\n         }\n   private:\n      int make_server_socket(uint16_t port)\n         {\n         const int type = m_is_tcp ? SOCK_STREAM : SOCK_DGRAM;\n\n         int fd = ::socket(PF_INET, type, 0);\n         if(fd == -1)\n            {\n            throw CLI_Error(\"Unable to acquire socket\");\n            }\n\n         sockaddr_in socket_info;\n         Botan::clear_mem(&socket_info, 1);\n         socket_info.sin_family = AF_INET;\n         socket_info.sin_port = htons(port);\n\n         \/\/ FIXME: support limiting listeners\n         socket_info.sin_addr.s_addr = INADDR_ANY;\n\n         if(::bind(fd, reinterpret_cast<struct sockaddr*>(&socket_info), sizeof(struct sockaddr)) != 0)\n            {\n            ::close(fd);\n            throw CLI_Error(\"server bind failed\");\n            }\n\n         if(m_is_tcp)\n            {\n            if(::listen(fd, 100) != 0)\n               {\n               ::close(fd);\n               throw CLI_Error(\"listen failed\");\n               }\n            }\n\t if(m_socket_id > 0)\n            {\n#if SOCKET_ID\n\/\/ Other oses could have other means to trace sockets\n#if defined(SO_USER_COOKIE)\n            if(::setsockopt(fd, SOL_SOCKET, SO_USER_COOKIE, reinterpret_cast<const void *>(&m_socket_id), sizeof(m_socket_id)) != 0)\n               {\n               \/\/ Failed but not world-ending issue\n               output() << \"set socket cookie id failed\" << std::endl;\n\t       }\n#endif\n#endif\n\t    }\n         return fd;\n         }\n\n      bool tls_session_established(const Botan::TLS::Session& session) override\n         {\n         output() << \"Handshake complete, \" << session.version().to_string()\n                  << \" using \" << session.ciphersuite().to_string() << std::endl;\n\n         if(!session.session_id().empty())\n            {\n            output() << \"Session ID \" << Botan::hex_encode(session.session_id()) << std::endl;\n            }\n\n         if(!session.session_ticket().empty())\n            {\n            output() << \"Session ticket \" << Botan::hex_encode(session.session_ticket()) << std::endl;\n            }\n\n         return true;\n         }\n\n      void tls_record_received(uint64_t, const uint8_t input[], size_t input_len) override\n         {\n         for(size_t i = 0; i != input_len; ++i)\n            {\n            const char c = static_cast<char>(input[i]);\n            m_line_buf += c;\n            if(c == '\\n')\n               {\n               m_pending_output.push_back(m_line_buf);\n               m_line_buf.clear();\n               }\n            }\n         }\n\n      void tls_emit_data(const uint8_t buf[], size_t length) override\n         {\n         if(m_is_tcp)\n            {\n            ssize_t sent = ::send(m_socket, buf, length, MSG_NOSIGNAL);\n\n            if(sent == -1)\n               {\n               error_output() << \"Error writing to socket - \" << std::strerror(errno) << std::endl;\n               }\n            else if(sent != static_cast<ssize_t>(length))\n               {\n               error_output() << \"Packet of length \" << length << \" truncated to \" << sent << std::endl;\n               }\n            }\n         else\n            {\n            while(length)\n               {\n               ssize_t sent = ::send(m_socket, buf, length, MSG_NOSIGNAL);\n\n               if(sent == -1)\n                  {\n                  if(errno == EINTR)\n                     {\n                     sent = 0;\n                     }\n                  else\n                     {\n                     throw CLI_Error(\"Socket write failed\");\n                     }\n                  }\n\n               buf += sent;\n               length -= sent;\n               }\n            }\n         }\n\n      void tls_alert(Botan::TLS::Alert alert) override\n         {\n         output() << \"Alert: \" << alert.type_string() << std::endl;\n         }\n\n      std::string tls_server_choose_app_protocol(const std::vector<std::string>&) override\n         {\n         \/\/ we ignore whatever the client sends here\n         return \"echo\/0.1\";\n         }\n\n      int m_socket = -1;\n      bool m_is_tcp = false;\n      uint32_t m_socket_id = 0;\n      std::string m_line_buf;\n      std::list<std::string> m_pending_output;\n      Sandbox m_sandbox;\n   };\n\nBOTAN_REGISTER_COMMAND(\"tls_server\", TLS_Server);\n\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * GameKeeper Framework\n *\n * Copyright (C) 2013 Karol Herbst <gamekeeper@karolherbst.de>\n *\n * This 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 \"runtime.h\"\n\n#include <gamekeeper\/core\/common.h>\n\n#include <cstdlib>\n\n#include <gamekeeper\/core\/logger.h>\n#include <gamekeeper\/core\/loggerStream.h>\n#include <gamekeeper\/client\/gamekeeper.h>\n#include <gamekeeper\/client\/hypodermic.h>\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 <Hypodermic\/ContainerBuilder.h>\n#include <Hypodermic\/Helpers.h>\n\n#include <gamekeeper\/core\/boostpopropertyresolver.h>\n#include <gamekeeper\/core\/curlfiledownloader.h>\n#ifdef GAMEKEEPER_OS_IS_WINDOWS\n  #include <gamekeeper\/core\/windowsinformation.h>\n  #define OSINFORMATIONCLASS WindowsInformation\n#else\n  #include <gamekeeper\/core\/linuxinformation.h>\n  #define OSINFORMATIONCLASS LinuxInformation\n#endif\n#include <gamekeeper\/core\/log4cpploggerFactory.h>\n#include <gamekeeper\/core\/xdgpaths.h>\n\nnamespace po = boost::program_options;\n\nGAMEKEEPER_NAMESPACE_START(client)\n\nstatic std::shared_ptr<Hypodermic::IContainer> localContainer;\nstatic std::shared_ptr<Hypodermic::IContainer> container;\n\nGameKeeperRuntime::GameKeeperRuntime()\n{\n\tusing namespace gamekeeper::core;\n\tHypodermic::ContainerBuilder containerBuilder;\n\n\t\/\/ set up IoC container\n\tcontainerBuilder.registerType<Log4cppLoggerFactory>()->\n\t        as<LoggerFactory>()->\n\t        singleInstance();\n\tlocalContainer = containerBuilder.build();\n}\n\nGameKeeperRuntime::~GameKeeperRuntime()\n{\n\tdelete this->gameKeeperUI;\n}\n\ngamekeeper::core::Logger&\nGameKeeperRuntime::getUILogger()\n{\n\treturn localContainer->resolve<gamekeeper::core::LoggerFactory>()->getComponentLogger(\"UI.client\");\n}\n\nstatic void\nfillProperties(po::options_description & cmd, po::options_description & file)\n{\n\tpo::options_description descGlobalCmd(\"Global options\");\n\tpo::options_description descNetwork(\"Network options\");\n\n\tdescGlobalCmd.add_options()\n\t\t(\"help,h\", \"produce help message\");\n\n\tdescNetwork.add_options()\n\t\t(\"network.download.max_buffer_size\", po::value<uint32_t>()->default_value(2048));\n\n\tcmd.add(descGlobalCmd);\n\tcmd.add(descNetwork);\n\tfile.add(descNetwork);\n}\n\nint\nGameKeeperRuntime::main(int argc, const char* argv[], GameKeeperUI * gameKeeperUI)\n{\n\tthis->gameKeeperUI = gameKeeperUI;\n\n\tpo::options_description descCmd;\n\tpo::options_description descFile;\n\n\tfillProperties(descCmd, descFile);\n\n\tpo::options_description cmdClient(\"Client options\");\n\tpo::options_description fileClient;\n\tpo::options_description bothClient;\n\tpo::options_description_easy_init cmdClientEasy = cmdClient.add_options();\n\tpo::options_description_easy_init fileClientEasy = fileClient.add_options();\n\tpo::options_description_easy_init bothClientEasy = bothClient.add_options();\n\n\tthis->gameKeeperUI->addOptions(cmdClientEasy, fileClientEasy, bothClientEasy);\n\n\tif(!bothClient.options().empty())\n\t{\n\t\tcmdClient.add(bothClient);\n\t\tfileClient.add(bothClient);\n\t}\n\n\tif(!cmdClient.options().empty())\n\t{\n\t\tdescCmd.add(cmdClient);\n\t}\n\n\tif(!fileClient.options().empty())\n\t{\n\t\tdescFile.add(fileClient);\n\t}\n\n\tpo::variables_map vm;\n\tpo::store(po::parse_command_line(argc, argv, descCmd), vm);\n\t\/\/po::store(po::parse_config_file(\"\", descFile), vm);\n\n\tif(vm.count(\"help\") > 0)\n\t{\n\t\tstd::cout << descCmd << std::endl;\n\t\treturn EXIT_SUCCESS;\n\t}\n\n\tpo::notify(vm);\n\n\tHypodermic::ContainerBuilder containerBuilder;\n\t{\n\t\tusing namespace gamekeeper::core;\n\n\t\t\/\/ set up IoC container\n\t\tcontainerBuilder.registerInstance<LoggerFactory>(\n\t\t\tlocalContainer->resolve<gamekeeper::core::LoggerFactory>())->\n\t\t\tas<LoggerFactory>()->\n\t\t\tsingleInstance();\n\t\tcontainerBuilder.registerType<BoostPOPropertyResolver>(CREATE_CAPTURED([&vm], new BoostPOPropertyResolver(vm)))->\n\t\t\tas<PropertyResolver>()->\n\t\t\tsingleInstance();\n\t\tcontainerBuilder.registerType<OSINFORMATIONCLASS>()->\n\t\t        as<OSInformation>()->\n\t\t        singleInstance();\n\t\tcontainerBuilder.registerType<XDGPaths>(CREATE(new XDGPaths(INJECT(OSInformation))))->\n\t\t        as<OSPaths>()->\n\t\t        singleInstance();\n\t\tcontainerBuilder.registerType<CurlFileDownloader>(\n\t\t\tCREATE(new CurlFileDownloader(INJECT(LoggerFactory), INJECT(PropertyResolver), INJECT(OSPaths))))->\n\t\t        as<FileDownloader>()->\n\t\t        as<HttpFileDownloader>()->\n\t\t        singleInstance();\n\t}\n\tcontainer = containerBuilder.build();\n\n\tstd::shared_ptr<gamekeeper::core::LoggerFactory> loggerFactory = container->resolve<gamekeeper::core::LoggerFactory>();\n\tloggerFactory->getComponentLogger(\"main\") << gamekeeper::core::LogLevel::Debug << \"firing up GameKeeper\" << gamekeeper::core::endl;\n\n\tthis->gameKeeperUI->init(vm);\n\tthis->gameKeeperUI->startEventLoop();\n\tthis->gameKeeperUI->onShutdown();\n\n\treturn EXIT_SUCCESS;\n}\n\nHypodermic::IContainer&\nHypodermicUtil::getContainer()\n{\n\treturn *container;\n}\n\nGAMEKEEPER_NAMESPACE_END(client)\n<commit_msg>client\/runtime: include iostream<commit_after>\/*\n * GameKeeper Framework\n *\n * Copyright (C) 2013 Karol Herbst <gamekeeper@karolherbst.de>\n *\n * This 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 \"runtime.h\"\n\n#include <gamekeeper\/core\/common.h>\n\n#include <cstdlib>\n#include <iostream>\n\n#include <gamekeeper\/core\/logger.h>\n#include <gamekeeper\/core\/loggerStream.h>\n#include <gamekeeper\/client\/gamekeeper.h>\n#include <gamekeeper\/client\/hypodermic.h>\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 <Hypodermic\/ContainerBuilder.h>\n#include <Hypodermic\/Helpers.h>\n\n#include <gamekeeper\/core\/boostpopropertyresolver.h>\n#include <gamekeeper\/core\/curlfiledownloader.h>\n#ifdef GAMEKEEPER_OS_IS_WINDOWS\n  #include <gamekeeper\/core\/windowsinformation.h>\n  #define OSINFORMATIONCLASS WindowsInformation\n#else\n  #include <gamekeeper\/core\/linuxinformation.h>\n  #define OSINFORMATIONCLASS LinuxInformation\n#endif\n#include <gamekeeper\/core\/log4cpploggerFactory.h>\n#include <gamekeeper\/core\/xdgpaths.h>\n\nnamespace po = boost::program_options;\n\nGAMEKEEPER_NAMESPACE_START(client)\n\nstatic std::shared_ptr<Hypodermic::IContainer> localContainer;\nstatic std::shared_ptr<Hypodermic::IContainer> container;\n\nGameKeeperRuntime::GameKeeperRuntime()\n{\n\tusing namespace gamekeeper::core;\n\tHypodermic::ContainerBuilder containerBuilder;\n\n\t\/\/ set up IoC container\n\tcontainerBuilder.registerType<Log4cppLoggerFactory>()->\n\t        as<LoggerFactory>()->\n\t        singleInstance();\n\tlocalContainer = containerBuilder.build();\n}\n\nGameKeeperRuntime::~GameKeeperRuntime()\n{\n\tdelete this->gameKeeperUI;\n}\n\ngamekeeper::core::Logger&\nGameKeeperRuntime::getUILogger()\n{\n\treturn localContainer->resolve<gamekeeper::core::LoggerFactory>()->getComponentLogger(\"UI.client\");\n}\n\nstatic void\nfillProperties(po::options_description & cmd, po::options_description & file)\n{\n\tpo::options_description descGlobalCmd(\"Global options\");\n\tpo::options_description descNetwork(\"Network options\");\n\n\tdescGlobalCmd.add_options()\n\t\t(\"help,h\", \"produce help message\");\n\n\tdescNetwork.add_options()\n\t\t(\"network.download.max_buffer_size\", po::value<uint32_t>()->default_value(2048));\n\n\tcmd.add(descGlobalCmd);\n\tcmd.add(descNetwork);\n\tfile.add(descNetwork);\n}\n\nint\nGameKeeperRuntime::main(int argc, const char* argv[], GameKeeperUI * gameKeeperUI)\n{\n\tthis->gameKeeperUI = gameKeeperUI;\n\n\tpo::options_description descCmd;\n\tpo::options_description descFile;\n\n\tfillProperties(descCmd, descFile);\n\n\tpo::options_description cmdClient(\"Client options\");\n\tpo::options_description fileClient;\n\tpo::options_description bothClient;\n\tpo::options_description_easy_init cmdClientEasy = cmdClient.add_options();\n\tpo::options_description_easy_init fileClientEasy = fileClient.add_options();\n\tpo::options_description_easy_init bothClientEasy = bothClient.add_options();\n\n\tthis->gameKeeperUI->addOptions(cmdClientEasy, fileClientEasy, bothClientEasy);\n\n\tif(!bothClient.options().empty())\n\t{\n\t\tcmdClient.add(bothClient);\n\t\tfileClient.add(bothClient);\n\t}\n\n\tif(!cmdClient.options().empty())\n\t{\n\t\tdescCmd.add(cmdClient);\n\t}\n\n\tif(!fileClient.options().empty())\n\t{\n\t\tdescFile.add(fileClient);\n\t}\n\n\tpo::variables_map vm;\n\tpo::store(po::parse_command_line(argc, argv, descCmd), vm);\n\t\/\/po::store(po::parse_config_file(\"\", descFile), vm);\n\n\tif(vm.count(\"help\") > 0)\n\t{\n\t\tstd::cout << descCmd << std::endl;\n\t\treturn EXIT_SUCCESS;\n\t}\n\n\tpo::notify(vm);\n\n\tHypodermic::ContainerBuilder containerBuilder;\n\t{\n\t\tusing namespace gamekeeper::core;\n\n\t\t\/\/ set up IoC container\n\t\tcontainerBuilder.registerInstance<LoggerFactory>(\n\t\t\tlocalContainer->resolve<gamekeeper::core::LoggerFactory>())->\n\t\t\tas<LoggerFactory>()->\n\t\t\tsingleInstance();\n\t\tcontainerBuilder.registerType<BoostPOPropertyResolver>(CREATE_CAPTURED([&vm], new BoostPOPropertyResolver(vm)))->\n\t\t\tas<PropertyResolver>()->\n\t\t\tsingleInstance();\n\t\tcontainerBuilder.registerType<OSINFORMATIONCLASS>()->\n\t\t        as<OSInformation>()->\n\t\t        singleInstance();\n\t\tcontainerBuilder.registerType<XDGPaths>(CREATE(new XDGPaths(INJECT(OSInformation))))->\n\t\t        as<OSPaths>()->\n\t\t        singleInstance();\n\t\tcontainerBuilder.registerType<CurlFileDownloader>(\n\t\t\tCREATE(new CurlFileDownloader(INJECT(LoggerFactory), INJECT(PropertyResolver), INJECT(OSPaths))))->\n\t\t        as<FileDownloader>()->\n\t\t        as<HttpFileDownloader>()->\n\t\t        singleInstance();\n\t}\n\tcontainer = containerBuilder.build();\n\n\tstd::shared_ptr<gamekeeper::core::LoggerFactory> loggerFactory = container->resolve<gamekeeper::core::LoggerFactory>();\n\tloggerFactory->getComponentLogger(\"main\") << gamekeeper::core::LogLevel::Debug << \"firing up GameKeeper\" << gamekeeper::core::endl;\n\n\tthis->gameKeeperUI->init(vm);\n\tthis->gameKeeperUI->startEventLoop();\n\tthis->gameKeeperUI->onShutdown();\n\n\treturn EXIT_SUCCESS;\n}\n\nHypodermic::IContainer&\nHypodermicUtil::getContainer()\n{\n\treturn *container;\n}\n\nGAMEKEEPER_NAMESPACE_END(client)\n<|endoftext|>"}
{"text":"<commit_before>\/\/ This file is triangularView 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 trmv(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  RealScalar largerEps = 10*test_precision<RealScalar>();\n\n  Index rows = m.rows();\n  Index cols = m.cols();\n\n  MatrixType m1 = MatrixType::Random(rows, cols),\n             m3(rows, cols);\n  VectorType v1 = VectorType::Random(rows);\n\n  Scalar s1 = internal::random<Scalar>();\n\n  m1 = MatrixType::Random(rows, cols);\n\n  \/\/ check with a column-major matrix\n  m3 = m1.template triangularView<Eigen::Lower>();\n  VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Lower>() * v1, largerEps));\n  m3 = m1.template triangularView<Eigen::Upper>();\n  VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Upper>() * v1, largerEps));\n  m3 = m1.template triangularView<Eigen::UnitLower>();\n  VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::UnitLower>() * v1, largerEps));\n  m3 = m1.template triangularView<Eigen::UnitUpper>();\n  VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::UnitUpper>() * v1, largerEps));\n\n  \/\/ check conjugated and scalar multiple expressions (col-major)\n  m3 = m1.template triangularView<Eigen::Lower>();\n  VERIFY(((s1*m3).conjugate() * v1).isApprox((s1*m1).conjugate().template triangularView<Eigen::Lower>() * v1, largerEps));\n  m3 = m1.template triangularView<Eigen::Upper>();\n  VERIFY((m3.conjugate() * v1.conjugate()).isApprox(m1.conjugate().template triangularView<Eigen::Upper>() * v1.conjugate(), largerEps));\n\n  \/\/ check with a row-major matrix\n  m3 = m1.template triangularView<Eigen::Upper>();\n  VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::Lower>() * v1, largerEps));\n  m3 = m1.template triangularView<Eigen::Lower>();\n  VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::Upper>() * v1, largerEps));\n  m3 = m1.template triangularView<Eigen::UnitUpper>();\n  VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::UnitLower>() * v1, largerEps));\n  m3 = m1.template triangularView<Eigen::UnitLower>();\n  VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::UnitUpper>() * v1, largerEps));\n\n  \/\/ check conjugated and scalar multiple expressions (row-major)\n  m3 = m1.template triangularView<Eigen::Upper>();\n  VERIFY((m3.adjoint() * v1).isApprox(m1.adjoint().template triangularView<Eigen::Lower>() * v1, largerEps));\n  m3 = m1.template triangularView<Eigen::Lower>();\n  VERIFY((m3.adjoint() * (s1*v1.conjugate())).isApprox(m1.adjoint().template triangularView<Eigen::Upper>() * (s1*v1.conjugate()), largerEps));\n  m3 = m1.template triangularView<Eigen::UnitUpper>();\n\n  \/\/ check transposed cases:\n  m3 = m1.template triangularView<Eigen::Lower>();\n  VERIFY((v1.transpose() * m3).isApprox(v1.transpose() * m1.template triangularView<Eigen::Lower>(), largerEps));\n  VERIFY((v1.adjoint() * m3).isApprox(v1.adjoint() * m1.template triangularView<Eigen::Lower>(), largerEps));\n  VERIFY((v1.adjoint() * m3.adjoint()).isApprox(v1.adjoint() * m1.template triangularView<Eigen::Lower>().adjoint(), largerEps));\n\n  \/\/ TODO check with sub-matrices\n}\n\nvoid test_product_trmv()\n{\n  int s;\n  for(int i = 0; i < g_repeat ; i++) {\n    CALL_SUBTEST_1( trmv(Matrix<float, 1, 1>()) );\n    CALL_SUBTEST_2( trmv(Matrix<float, 2, 2>()) );\n    CALL_SUBTEST_3( trmv(Matrix3d()) );\n    s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE\/2);\n    CALL_SUBTEST_4( trmv(MatrixXcf(s,internal::random<int>(1,EIGEN_TEST_MAX_SIZE\/2))) );\n    s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE\/2);\n    CALL_SUBTEST_5( trmv(MatrixXcd(s,s)) );\n    s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE);\n    CALL_SUBTEST_6( trmv(Matrix<float,Dynamic,Dynamic,RowMajor>(s, s)) );\n  }\n}\n<commit_msg>fix trmv unit test<commit_after>\/\/ This file is triangularView 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 trmv(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  RealScalar largerEps = 10*test_precision<RealScalar>();\n\n  Index rows = m.rows();\n  Index cols = m.cols();\n\n  MatrixType m1 = MatrixType::Random(rows, cols),\n             m3(rows, cols);\n  VectorType v1 = VectorType::Random(rows);\n\n  Scalar s1 = internal::random<Scalar>();\n\n  m1 = MatrixType::Random(rows, cols);\n\n  \/\/ check with a column-major matrix\n  m3 = m1.template triangularView<Eigen::Lower>();\n  VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Lower>() * v1, largerEps));\n  m3 = m1.template triangularView<Eigen::Upper>();\n  VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Upper>() * v1, largerEps));\n  m3 = m1.template triangularView<Eigen::UnitLower>();\n  VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::UnitLower>() * v1, largerEps));\n  m3 = m1.template triangularView<Eigen::UnitUpper>();\n  VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::UnitUpper>() * v1, largerEps));\n\n  \/\/ check conjugated and scalar multiple expressions (col-major)\n  m3 = m1.template triangularView<Eigen::Lower>();\n  VERIFY(((s1*m3).conjugate() * v1).isApprox((s1*m1).conjugate().template triangularView<Eigen::Lower>() * v1, largerEps));\n  m3 = m1.template triangularView<Eigen::Upper>();\n  VERIFY((m3.conjugate() * v1.conjugate()).isApprox(m1.conjugate().template triangularView<Eigen::Upper>() * v1.conjugate(), largerEps));\n\n  \/\/ check with a row-major matrix\n  m3 = m1.template triangularView<Eigen::Upper>();\n  VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::Lower>() * v1, largerEps));\n  m3 = m1.template triangularView<Eigen::Lower>();\n  VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::Upper>() * v1, largerEps));\n  m3 = m1.template triangularView<Eigen::UnitUpper>();\n  VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::UnitLower>() * v1, largerEps));\n  m3 = m1.template triangularView<Eigen::UnitLower>();\n  VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::UnitUpper>() * v1, largerEps));\n\n  \/\/ check conjugated and scalar multiple expressions (row-major)\n  m3 = m1.template triangularView<Eigen::Upper>();\n  VERIFY((m3.adjoint() * v1).isApprox(m1.adjoint().template triangularView<Eigen::Lower>() * v1, largerEps));\n  m3 = m1.template triangularView<Eigen::Lower>();\n  VERIFY((m3.adjoint() * (s1*v1.conjugate())).isApprox(m1.adjoint().template triangularView<Eigen::Upper>() * (s1*v1.conjugate()), largerEps));\n  m3 = m1.template triangularView<Eigen::UnitUpper>();\n\n  \/\/ check transposed cases:\n  m3 = m1.template triangularView<Eigen::Lower>();\n  VERIFY((v1.transpose() * m3).isApprox(v1.transpose() * m1.template triangularView<Eigen::Lower>(), largerEps));\n  VERIFY((v1.adjoint() * m3).isApprox(v1.adjoint() * m1.template triangularView<Eigen::Lower>(), largerEps));\n  VERIFY((v1.adjoint() * m3.adjoint()).isApprox(v1.adjoint() * m1.template triangularView<Eigen::Lower>().adjoint(), largerEps));\n\n  \/\/ TODO check with sub-matrices\n}\n\nvoid test_product_trmv()\n{\n  int s;\n  for(int i = 0; i < g_repeat ; i++) {\n    CALL_SUBTEST_1( trmv(Matrix<float, 1, 1>()) );\n    CALL_SUBTEST_2( trmv(Matrix<float, 2, 2>()) );\n    CALL_SUBTEST_3( trmv(Matrix3d()) );\n    s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE\/2);\n    CALL_SUBTEST_4( trmv(MatrixXcf(s,s)) );\n    s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE\/2);\n    CALL_SUBTEST_5( trmv(MatrixXcd(s,s)) );\n    s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE);\n    CALL_SUBTEST_6( trmv(Matrix<float,Dynamic,Dynamic,RowMajor>(s, s)) );\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"regexmanager.h\"\n\n#include \"3rd-party\/catch.hpp\"\n#include \"exceptions.h\"\n\nusing namespace newsboat;\n\nTEST_CASE(\"RegexManager throws on invalid `highlight' definition\",\n\t\"[RegexManager]\")\n{\n\tRegexManager rxman;\n\tstd::vector<std::string> params;\n\n\tSECTION(\"on `highlight' without parameters\")\n\t{\n\t\tREQUIRE_THROWS_AS(rxman.handle_action(\"highlight\", params),\n\t\t\tConfigHandlerException);\n\t}\n\n\tSECTION(\"on invalid location\")\n\t{\n\t\tparams = {\"invalidloc\", \"foo\", \"blue\", \"red\"};\n\t\tREQUIRE_THROWS_AS(rxman.handle_action(\"highlight\", params),\n\t\t\tConfigHandlerException);\n\t}\n\n\tSECTION(\"on invalid regex\")\n\t{\n\t\tparams = {\"feedlist\", \"*\", \"blue\", \"red\"};\n\t\tREQUIRE_THROWS_AS(rxman.handle_action(\"highlight\", params),\n\t\t\tConfigHandlerException);\n\t}\n\n\tSECTION(\"on invalid command\")\n\t{\n\t\tREQUIRE_THROWS_AS(\n\t\t\trxman.handle_action(\"an-invalid-command\", params),\n\t\t\tConfigHandlerException);\n\t}\n}\n\nTEST_CASE(\"RegexManager doesn't throw on valid `highlight' definition\",\n\t\"[RegexManager]\")\n{\n\tRegexManager rxman;\n\tstd::vector<std::string> params;\n\n\tparams = {\"articlelist\", \"foo\", \"blue\", \"red\"};\n\tREQUIRE_NOTHROW(rxman.handle_action(\"highlight\", params));\n\n\tparams = {\"feedlist\", \"foo\", \"blue\", \"red\"};\n\tREQUIRE_NOTHROW(rxman.handle_action(\"highlight\", params));\n\n\tparams = {\"feedlist\", \"fbo\", \"blue\", \"red\", \"bold\", \"underline\"};\n\tREQUIRE_NOTHROW(rxman.handle_action(\"highlight\", params));\n\n\tparams = {\"all\", \"fba\", \"blue\", \"red\", \"bold\", \"underline\"};\n\tREQUIRE_NOTHROW(rxman.handle_action(\"highlight\", params));\n}\n\nTEST_CASE(\"RegexManager highlights according to definition\", \"[RegexManager]\")\n{\n\tRegexManager rxman;\n\tstd::string input;\n\n\trxman.handle_action(\"highlight\", {\"articlelist\", \"foo\", \"blue\", \"red\"});\n\tinput = \"xfoox\";\n\trxman.quote_and_highlight(input, \"articlelist\");\n\tREQUIRE(input == \"x<0>foo<\/>x\");\n\n\trxman.handle_action(\"highlight\", {\"feedlist\", \"foo\", \"blue\", \"red\"});\n\tinput = \"yfooy\";\n\trxman.quote_and_highlight(input, \"feedlist\");\n\tREQUIRE(input == \"y<0>foo<\/>y\");\n}\n\nTEST_CASE(\"RegexManager preserves text when there's nothing to highlight\",\n\t\"[RegexManager]\")\n{\n\tRegexManager rxman;\n\tstd::string input = \"xbarx\";\n\trxman.quote_and_highlight(input, \"feedlist\");\n\tREQUIRE(input == \"xbarx\");\n\n\tinput = \"<\";\n\trxman.quote_and_highlight(input, \"feedlist\");\n\tREQUIRE(input == \"<\");\n\n\tinput = \"a<b>\";\n\trxman.quote_and_highlight(input, \"feedlist\");\n\tREQUIRE(input == \"a<b>\");\n}\n\nTEST_CASE(\"`highlight all` adds rules for all locations\", \"[RegexManager]\")\n{\n\tRegexManager rxman;\n\tstd::vector<std::string> params = {\"all\", \"foo\", \"red\"};\n\tREQUIRE_NOTHROW(rxman.handle_action(\"highlight\", params));\n\tstd::string input = \"xxfooyy\";\n\n\tfor (auto location : {\"article\", \"articlelist\", \"feedlist\"}) {\n\t\tSECTION(location)\n\t\t{\n\t\t\trxman.quote_and_highlight(input, location);\n\t\t\tREQUIRE(input == \"xx<0>foo<\/>yy\");\n\t\t}\n\t}\n}\n\nTEST_CASE(\"RegexManager does not hang on regexes that can match empty strings\", \"[RegexManager]\")\n{\n\tRegexManager rxman;\n\tstd::string input = \"The quick brown fox jumps over the lazy dog\";\n\n\trxman.handle_action(\"highlight\", {\"feedlist\", \"w*\", \"blue\", \"red\"});\n\trxman.quote_and_highlight(input, \"feedlist\");\n\tREQUIRE(input == \"The quick bro<0>w<\/>n fox jumps over the lazy dog\");\n}\n\nTEST_CASE(\"RegexManager does not hang on regexes that match empty strings\", \"[RegexManager]\")\n{\n\tRegexManager rxman;\n\tstd::string input = \"The quick brown fox jumps over the lazy dog\";\n\tconst std::string compare = input;\n\n\tSECTION(input)\n\t{\n\t\trxman.handle_action(\"highlight\", {\"feedlist\", \"$\", \"blue\", \"red\"});\n\t\trxman.quote_and_highlight(input, \"feedlist\");\n\t\tREQUIRE(input == compare);\n\t}\n\n\tSECTION(input)\n\t{\n\trxman.handle_action(\"highlight\", {\"feedlist\", \"^\", \"blue\", \"red\"});\n\trxman.quote_and_highlight(input, \"feedlist\");\n\tREQUIRE(input == compare);\n\t}\n\n\tSECTION(input)\n\t{\n\trxman.handle_action(\"highlight\", {\"feedlist\", \"^$\", \"blue\", \"red\"});\n\trxman.quote_and_highlight(input, \"feedlist\");\n\tREQUIRE(input == compare);\n\t}\n}\n<commit_msg>Better section arguments<commit_after>#include \"regexmanager.h\"\n\n#include \"3rd-party\/catch.hpp\"\n#include \"exceptions.h\"\n\nusing namespace newsboat;\n\nTEST_CASE(\"RegexManager throws on invalid `highlight' definition\",\n\t\"[RegexManager]\")\n{\n\tRegexManager rxman;\n\tstd::vector<std::string> params;\n\n\tSECTION(\"on `highlight' without parameters\")\n\t{\n\t\tREQUIRE_THROWS_AS(rxman.handle_action(\"highlight\", params),\n\t\t\tConfigHandlerException);\n\t}\n\n\tSECTION(\"on invalid location\")\n\t{\n\t\tparams = {\"invalidloc\", \"foo\", \"blue\", \"red\"};\n\t\tREQUIRE_THROWS_AS(rxman.handle_action(\"highlight\", params),\n\t\t\tConfigHandlerException);\n\t}\n\n\tSECTION(\"on invalid regex\")\n\t{\n\t\tparams = {\"feedlist\", \"*\", \"blue\", \"red\"};\n\t\tREQUIRE_THROWS_AS(rxman.handle_action(\"highlight\", params),\n\t\t\tConfigHandlerException);\n\t}\n\n\tSECTION(\"on invalid command\")\n\t{\n\t\tREQUIRE_THROWS_AS(\n\t\t\trxman.handle_action(\"an-invalid-command\", params),\n\t\t\tConfigHandlerException);\n\t}\n}\n\nTEST_CASE(\"RegexManager doesn't throw on valid `highlight' definition\",\n\t\"[RegexManager]\")\n{\n\tRegexManager rxman;\n\tstd::vector<std::string> params;\n\n\tparams = {\"articlelist\", \"foo\", \"blue\", \"red\"};\n\tREQUIRE_NOTHROW(rxman.handle_action(\"highlight\", params));\n\n\tparams = {\"feedlist\", \"foo\", \"blue\", \"red\"};\n\tREQUIRE_NOTHROW(rxman.handle_action(\"highlight\", params));\n\n\tparams = {\"feedlist\", \"fbo\", \"blue\", \"red\", \"bold\", \"underline\"};\n\tREQUIRE_NOTHROW(rxman.handle_action(\"highlight\", params));\n\n\tparams = {\"all\", \"fba\", \"blue\", \"red\", \"bold\", \"underline\"};\n\tREQUIRE_NOTHROW(rxman.handle_action(\"highlight\", params));\n}\n\nTEST_CASE(\"RegexManager highlights according to definition\", \"[RegexManager]\")\n{\n\tRegexManager rxman;\n\tstd::string input;\n\n\trxman.handle_action(\"highlight\", {\"articlelist\", \"foo\", \"blue\", \"red\"});\n\tinput = \"xfoox\";\n\trxman.quote_and_highlight(input, \"articlelist\");\n\tREQUIRE(input == \"x<0>foo<\/>x\");\n\n\trxman.handle_action(\"highlight\", {\"feedlist\", \"foo\", \"blue\", \"red\"});\n\tinput = \"yfooy\";\n\trxman.quote_and_highlight(input, \"feedlist\");\n\tREQUIRE(input == \"y<0>foo<\/>y\");\n}\n\nTEST_CASE(\"RegexManager preserves text when there's nothing to highlight\",\n\t\"[RegexManager]\")\n{\n\tRegexManager rxman;\n\tstd::string input = \"xbarx\";\n\trxman.quote_and_highlight(input, \"feedlist\");\n\tREQUIRE(input == \"xbarx\");\n\n\tinput = \"<\";\n\trxman.quote_and_highlight(input, \"feedlist\");\n\tREQUIRE(input == \"<\");\n\n\tinput = \"a<b>\";\n\trxman.quote_and_highlight(input, \"feedlist\");\n\tREQUIRE(input == \"a<b>\");\n}\n\nTEST_CASE(\"`highlight all` adds rules for all locations\", \"[RegexManager]\")\n{\n\tRegexManager rxman;\n\tstd::vector<std::string> params = {\"all\", \"foo\", \"red\"};\n\tREQUIRE_NOTHROW(rxman.handle_action(\"highlight\", params));\n\tstd::string input = \"xxfooyy\";\n\n\tfor (auto location : {\"article\", \"articlelist\", \"feedlist\"}) {\n\t\tSECTION(location)\n\t\t{\n\t\t\trxman.quote_and_highlight(input, location);\n\t\t\tREQUIRE(input == \"xx<0>foo<\/>yy\");\n\t\t}\n\t}\n}\n\nTEST_CASE(\"RegexManager does not hang on regexes that can match empty strings\", \"[RegexManager]\")\n{\n\tRegexManager rxman;\n\tstd::string input = \"The quick brown fox jumps over the lazy dog\";\n\n\trxman.handle_action(\"highlight\", {\"feedlist\", \"w*\", \"blue\", \"red\"});\n\trxman.quote_and_highlight(input, \"feedlist\");\n\tREQUIRE(input == \"The quick bro<0>w<\/>n fox jumps over the lazy dog\");\n}\n\nTEST_CASE(\"RegexManager does not hang on regexes that match empty strings\", \"[RegexManager]\")\n{\n\tRegexManager rxman;\n\tstd::string input = \"The quick brown fox jumps over the lazy dog\";\n\tconst std::string compare = input;\n\n\tSECTION(\"testing end of line empty.\")\n\t{\n\t\trxman.handle_action(\"highlight\", {\"feedlist\", \"$\", \"blue\", \"red\"});\n\t\trxman.quote_and_highlight(input, \"feedlist\");\n\t\tREQUIRE(input == compare);\n\t}\n\n\tSECTION(\"testing begining of line empty\")\n\t{\n\trxman.handle_action(\"highlight\", {\"feedlist\", \"^\", \"blue\", \"red\"});\n\trxman.quote_and_highlight(input, \"feedlist\");\n\tREQUIRE(input == compare);\n\t}\n\n\tSECTION(\"testing empty line\")\n\t{\n\trxman.handle_action(\"highlight\", {\"feedlist\", \"^$\", \"blue\", \"red\"});\n\trxman.quote_and_highlight(input, \"feedlist\");\n\tREQUIRE(input == compare);\n\t}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/* -*-c++-*- OpenSceneGraph - Copyright (C) 1998-2004 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\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\/* file:\tsrc\/osgPlugins\/rot\/ReaderWriterROT.cpp\n * author:\tMike Weiblen http:\/\/mew.cx\/ 2004-07-15\n * copyright:\t(C) 2004 Michael Weiblen\n * license:\tOpenSceneGraph Public License (OSGPL)\n*\/\n\n#include <osg\/Notify>\n#include <osg\/Matrix>\n#include <osg\/MatrixTransform>\n\n#include <osgDB\/ReaderWriter>\n#include <osgDB\/FileNameUtils>\n#include <osgDB\/Registry>\n#include <osgDB\/ReadFile>\n\n#include <stdio.h>\n\n#define EXTENSION_NAME \"rot\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/**\n * An OSG reader plugin for the \".rot\" pseudo-loader, which inserts a\n * rotation transform above the loaded geometry.\n * This pseudo-loader makes it simple to change the orientation of a saved\n * model by specifying a correcting rotation as part of the filename.\n *\n * Usage: <modelfile.ext>.<rx>,<ry>,<rz>.globe\n * where:\n *\t<modelfile.ext> = an model filename.\n *\t<rx> = rotation around X axis [degrees]\n *\t<ry> = rotation around Y axis [degrees]\n *\t<rz> = rotation around Z axis [degrees]\n *\n * example: osgviewer cow.osg.30,60,-90.rot\n *\/\n\nclass ReaderWriterROT : public osgDB::ReaderWriter\n{\npublic:\n    ReaderWriterROT() { }\n    \n    virtual const char* className() const { return \"rotation pseudo-loader\"; }\n\n    virtual bool acceptsExtension(const std::string& extension) const\n    { \n\treturn osgDB::equalCaseInsensitive( extension, EXTENSION_NAME );\n    }\n\n    virtual ReadResult readNode(const std::string& fileName, const osgDB::ReaderWriter::Options* options) const\n    {\n\tstd::string ext = osgDB::getLowerCaseFileExtension(fileName);\n\tif( !acceptsExtension(ext) )\n\t    return ReadResult::FILE_NOT_HANDLED;\n\n\tosg::notify(osg::INFO) << \"ReaderWriterROT( \\\"\" << fileName << \"\\\" )\" << std::endl;\n\n\t\/\/ strip the pseudo-loader extension\n\tstd::string tmpName = osgDB::getNameLessExtension( fileName );\n\n\t\/\/ get the next \"extension\", which actually contains the pseudo-loader parameters\n\tstd::string params = osgDB::getFileExtension( tmpName );\n\tif( params.empty() )\n\t{\n\t    osg::notify(osg::WARN) << \"Missing parameters for \" EXTENSION_NAME \" pseudo-loader\" << std::endl;\n\t    return ReadResult::FILE_NOT_HANDLED;\n\t}\n\n\t\/\/ strip the \"params extension\", which must leave a sub-filename.\n\tstd::string subFileName = osgDB::getNameLessExtension( tmpName );\n\tif( subFileName == tmpName )\n\t{\n\t    osg::notify(osg::WARN) << \"Missing subfilename for \" EXTENSION_NAME \" pseudo-loader\" << std::endl;\n\t    return ReadResult::FILE_NOT_HANDLED;\n\t}\n\n\tosg::notify(osg::INFO) << EXTENSION_NAME \" params = \\\"\" << params << \"\\\"\" << std::endl;\n\n\tint h, p, r;\n\tint count = sscanf( params.c_str(), \"%d,%d,%d\", &h, &p, &r );\n\tif( count != 3 )\n\t{\n\t    osg::notify(osg::WARN) << \"Bad parameters for \" EXTENSION_NAME \" pseudo-loader: \\\"\" << params << \"\\\"\" << std::endl;\n\t    return ReadResult::FILE_NOT_HANDLED;\n\t}\n\n\t\/\/ recursively load the subfile.\n\tosg::Node *node = osgDB::readNodeFile( subFileName, options );\n\tif( !node )\n\t{\n\t    \/\/ propagate the read failure upwards\n\t    osg::notify(osg::WARN) << \"Subfile \\\"\" << subFileName << \"\\\" could not be loaded\" << std::endl;\n\t    return ReadResult::FILE_NOT_HANDLED;\n\t}\n\n\tosg::MatrixTransform *xform = new osg::MatrixTransform;\n\txform->setDataVariance( osg::Object::STATIC );\n\txform->setMatrix( osg::Matrix::rotate(\n\t\tosg::DegreesToRadians( static_cast<float>(r) ), osg::Vec3( 0, 1, 0 ),\n\t\tosg::DegreesToRadians( static_cast<float>(p) ), osg::Vec3( 1, 0, 0 ),\n\t\tosg::DegreesToRadians( static_cast<float>(h) ), osg::Vec3( 0, 0, 1 ) ));\n\txform->addChild( node );\n\treturn xform;\n    }\n};\n\n\n\/\/ Add ourself to the Registry to instantiate the reader\/writer.\nosgDB::RegisterReaderWriterProxy<ReaderWriterROT> g_readerWriter_ROT_Proxy;\n\n\/*EOF*\/\n\n<commit_msg>From Mike Weiblen, \"modified .rot pseudoloader plugin so rotation order actually matches the embedded documentation\"<commit_after>\/* -*-c++-*- OpenSceneGraph - Copyright (C) 1998-2005 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\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\/* file:    src\/osgPlugins\/rot\/ReaderWriterROT.cpp\n * author:    Mike Weiblen http:\/\/mew.cx\/ 2005-06-06\n * copyright:    (C) 2005 Michael Weiblen\n * license:    OpenSceneGraph Public License (OSGPL)\n*\/\n\n#include <osg\/Notify>\n#include <osg\/Matrix>\n#include <osg\/MatrixTransform>\n\n#include <osgDB\/ReaderWriter>\n#include <osgDB\/FileNameUtils>\n#include <osgDB\/Registry>\n#include <osgDB\/ReadFile>\n\n#include <stdio.h>\n\n#define EXTENSION_NAME \"rot\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/**\n * An OSG reader plugin for the \".rot\" pseudo-loader, which inserts a\n * rotation transform above the loaded geometry.\n * This pseudo-loader makes it simple to change the orientation of a saved\n * model by specifying a correcting rotation as part of the filename.\n *\n * Usage: <modelfile.ext>.<rx>,<ry>,<rz>.globe\n * where:\n *    <modelfile.ext> = an model filename.\n *    <rx> = rotation around X axis [degrees]\n *    <ry> = rotation around Y axis [degrees]\n *    <rz> = rotation around Z axis [degrees]\n *\n * example: osgviewer cow.osg.30,60,-90.rot\n *\/\n\nclass ReaderWriterROT : public osgDB::ReaderWriter\n{\npublic:\n    ReaderWriterROT() { }\n    \n    virtual const char* className() const { return \"rotation pseudo-loader\"; }\n\n    virtual bool acceptsExtension(const std::string& extension) const\n    { \n        return osgDB::equalCaseInsensitive( extension, EXTENSION_NAME );\n    }\n\n    virtual ReadResult readNode(const std::string& fileName, const osgDB::ReaderWriter::Options* options) const\n    {\n        std::string ext = osgDB::getLowerCaseFileExtension(fileName);\n        if( !acceptsExtension(ext) )\n            return ReadResult::FILE_NOT_HANDLED;\n\n        osg::notify(osg::INFO) << \"ReaderWriterROT( \\\"\" << fileName << \"\\\" )\" << std::endl;\n\n        \/\/ strip the pseudo-loader extension\n        std::string tmpName = osgDB::getNameLessExtension( fileName );\n\n        \/\/ get the next \"extension\", which actually contains the pseudo-loader parameters\n        std::string params = osgDB::getFileExtension( tmpName );\n        if( params.empty() )\n        {\n            osg::notify(osg::WARN) << \"Missing parameters for \" EXTENSION_NAME \" pseudo-loader\" << std::endl;\n            return ReadResult::FILE_NOT_HANDLED;\n        }\n\n        \/\/ strip the \"params extension\", which must leave a sub-filename.\n        std::string subFileName = osgDB::getNameLessExtension( tmpName );\n        if( subFileName == tmpName )\n        {\n            osg::notify(osg::WARN) << \"Missing subfilename for \" EXTENSION_NAME \" pseudo-loader\" << std::endl;\n            return ReadResult::FILE_NOT_HANDLED;\n        }\n\n        osg::notify(osg::INFO) << EXTENSION_NAME \" params = \\\"\" << params << \"\\\"\" << std::endl;\n\n        int rx, ry, rz;\n        int count = sscanf( params.c_str(), \"%d,%d,%d\", &rx, &ry, &rz );\n        if( count != 3 )\n        {\n            osg::notify(osg::WARN) << \"Bad parameters for \" EXTENSION_NAME \" pseudo-loader: \\\"\" << params << \"\\\"\" << std::endl;\n            return ReadResult::FILE_NOT_HANDLED;\n        }\n\n        \/\/ recursively load the subfile.\n        osg::Node *node = osgDB::readNodeFile( subFileName, options );\n        if( !node )\n        {\n            \/\/ propagate the read failure upwards\n            osg::notify(osg::WARN) << \"Subfile \\\"\" << subFileName << \"\\\" could not be loaded\" << std::endl;\n            return ReadResult::FILE_NOT_HANDLED;\n        }\n\n        osg::MatrixTransform *xform = new osg::MatrixTransform;\n        xform->setDataVariance( osg::Object::STATIC );\n        xform->setMatrix( osg::Matrix::rotate(\n            osg::DegreesToRadians( static_cast<float>(rx) ), osg::Vec3( 1, 0, 0 ),\n            osg::DegreesToRadians( static_cast<float>(ry) ), osg::Vec3( 0, 1, 0 ),\n            osg::DegreesToRadians( static_cast<float>(rz) ), osg::Vec3( 0, 0, 1 ) ));\n        xform->addChild( node );\n        return xform;\n    }\n};\n\n\n\/\/ Add ourself to the Registry to instantiate the reader\/writer.\nosgDB::RegisterReaderWriterProxy<ReaderWriterROT> g_readerWriter_ROT_Proxy;\n\n\/*EOF*\/\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ ***************************************************************************\n\/\/\n\/\/   Generated automatically by genwrapper.\n\/\/   Please DO NOT EDIT this file!\n\/\/\n\/\/ ***************************************************************************\n\n#include <osgIntrospection\/ReflectionMacros>\n#include <osgIntrospection\/TypedMethodInfo>\n#include <osgIntrospection\/Attributes>\n\n#include <osg\/Vec2>\n#include <osg\/Vec3>\n#include <osg\/Vec4>\n#include <osgUtil\/Statistics>\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\nTYPE_NAME_ALIAS(std::pair< unsigned int COMMA  unsigned int >, osgUtil::Statistics::PrimitivePair);\n\nTYPE_NAME_ALIAS(std::map< GLenum COMMA  osgUtil::Statistics::PrimitivePair >, osgUtil::Statistics::PrimitiveValueMap);\n\nTYPE_NAME_ALIAS(std::map< GLenum COMMA  unsigned int >, osgUtil::Statistics::PrimitiveCountMap);\n\nBEGIN_ENUM_REFLECTOR(osgUtil::Statistics::statsType)\n\tI_EnumLabel(osgUtil::Statistics::STAT_NONE);\n\tI_EnumLabel(osgUtil::Statistics::STAT_FRAMERATE);\n\tI_EnumLabel(osgUtil::Statistics::STAT_GRAPHS);\n\tI_EnumLabel(osgUtil::Statistics::STAT_PRIMS);\n\tI_EnumLabel(osgUtil::Statistics::STAT_PRIMSPERVIEW);\n\tI_EnumLabel(osgUtil::Statistics::STAT_PRIMSPERBIN);\n\tI_EnumLabel(osgUtil::Statistics::STAT_DC);\n\tI_EnumLabel(osgUtil::Statistics::STAT_RESTART);\nEND_REFLECTOR\n\nBEGIN_OBJECT_REFLECTOR(osgUtil::Statistics)\n\tI_BaseType(osg::PrimitiveFunctor);\n\tI_Constructor0();\n\tI_Method0(void, reset);\n\tI_Method1(void, setType, IN, osgUtil::Statistics::statsType, t);\n\tI_Method2(void, setVertexArray, IN, unsigned int, count, IN, const osg::Vec3 *, x);\n\tI_Method2(void, setVertexArray, IN, unsigned int, count, IN, const osg::Vec2 *, x);\n\tI_Method2(void, setVertexArray, IN, unsigned int, count, IN, const osg::Vec4 *, x);\n\tI_Method3(void, drawArrays, IN, GLenum, mode, IN, GLint, x, IN, GLsizei, count);\n\tI_Method3(void, drawElements, IN, GLenum, mode, IN, GLsizei, count, IN, const GLubyte *, x);\n\tI_Method3(void, drawElements, IN, GLenum, mode, IN, GLsizei, count, IN, const GLushort *, x);\n\tI_Method3(void, drawElements, IN, GLenum, mode, IN, GLsizei, count, IN, const GLuint *, x);\n\tI_Method1(void, begin, IN, GLenum, mode);\n\tI_Method0(void, vertex);\n\tI_Method3(void, vertex, IN, float, x, IN, float, x, IN, float, x);\n\tI_Method1(void, vertex, IN, const osg::Vec3 &, x);\n\tI_Method1(void, vertex, IN, const osg::Vec2 &, x);\n\tI_Method1(void, vertex, IN, const osg::Vec4 &, x);\n\tI_Method2(void, vertex, IN, float, x, IN, float, x);\n\tI_Method4(void, vertex, IN, float, x, IN, float, x, IN, float, x, IN, float, x);\n\tI_Method0(void, end);\n\tI_Method0(void, addDrawable);\n\tI_Method0(void, addMatrix);\n\tI_Method1(void, addLight, IN, int, np);\n\tI_Method1(void, addImpostor, IN, int, np);\n\tI_Method0(int, getBins);\n\tI_Method1(void, setDepth, IN, int, d);\n\tI_Method1(void, addBins, IN, int, np);\n\tI_Method1(void, setBinNo, IN, int, n);\n\tI_Method0(osgUtil::Statistics::PrimitiveCountMap::iterator, GetPrimitivesBegin);\n\tI_Method0(osgUtil::Statistics::PrimitiveCountMap::iterator, GetPrimitivesEnd);\n\tI_WriteOnlyProperty(int, BinNo);\n\tI_ReadOnlyProperty(int, Bins);\n\tI_WriteOnlyProperty(int, Depth);\n\tI_WriteOnlyProperty(osgUtil::Statistics::statsType, Type);\nEND_REFLECTOR\n\nSTD_MAP_REFLECTOR(std::map< GLenum COMMA  osgUtil::Statistics::PrimitivePair >);\n\nSTD_MAP_REFLECTOR(std::map< GLenum COMMA  unsigned int >);\n\nSTD_PAIR_REFLECTOR(std::pair< unsigned int COMMA  unsigned int >);\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\/Drawable>\n#include <osg\/Geode>\n#include <osg\/Group>\n#include <osg\/LOD>\n#include <osg\/Switch>\n#include <osg\/Transform>\n#include <osg\/Vec2>\n#include <osg\/Vec3>\n#include <osg\/Vec4>\n#include <osgUtil\/Statistics>\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\nTYPE_NAME_ALIAS(std::pair< unsigned int COMMA  unsigned int >, osgUtil::Statistics::PrimitivePair);\n\nTYPE_NAME_ALIAS(std::map< GLenum COMMA  osgUtil::Statistics::PrimitivePair >, osgUtil::Statistics::PrimitiveValueMap);\n\nTYPE_NAME_ALIAS(std::map< GLenum COMMA  unsigned int >, osgUtil::Statistics::PrimitiveCountMap);\n\nBEGIN_ENUM_REFLECTOR(osgUtil::Statistics::statsType)\n\tI_EnumLabel(osgUtil::Statistics::STAT_NONE);\n\tI_EnumLabel(osgUtil::Statistics::STAT_FRAMERATE);\n\tI_EnumLabel(osgUtil::Statistics::STAT_GRAPHS);\n\tI_EnumLabel(osgUtil::Statistics::STAT_PRIMS);\n\tI_EnumLabel(osgUtil::Statistics::STAT_PRIMSPERVIEW);\n\tI_EnumLabel(osgUtil::Statistics::STAT_PRIMSPERBIN);\n\tI_EnumLabel(osgUtil::Statistics::STAT_DC);\n\tI_EnumLabel(osgUtil::Statistics::STAT_RESTART);\nEND_REFLECTOR\n\nBEGIN_OBJECT_REFLECTOR(osgUtil::Statistics)\n\tI_BaseType(osg::PrimitiveFunctor);\n\tI_Constructor0();\n\tI_Method0(void, reset);\n\tI_Method1(void, setType, IN, osgUtil::Statistics::statsType, t);\n\tI_Method2(void, setVertexArray, IN, unsigned int, count, IN, const osg::Vec3 *, x);\n\tI_Method2(void, setVertexArray, IN, unsigned int, count, IN, const osg::Vec2 *, x);\n\tI_Method2(void, setVertexArray, IN, unsigned int, count, IN, const osg::Vec4 *, x);\n\tI_Method3(void, drawArrays, IN, GLenum, mode, IN, GLint, x, IN, GLsizei, count);\n\tI_Method3(void, drawElements, IN, GLenum, mode, IN, GLsizei, count, IN, const GLubyte *, x);\n\tI_Method3(void, drawElements, IN, GLenum, mode, IN, GLsizei, count, IN, const GLushort *, x);\n\tI_Method3(void, drawElements, IN, GLenum, mode, IN, GLsizei, count, IN, const GLuint *, x);\n\tI_Method1(void, begin, IN, GLenum, mode);\n\tI_Method0(void, vertex);\n\tI_Method3(void, vertex, IN, float, x, IN, float, x, IN, float, x);\n\tI_Method1(void, vertex, IN, const osg::Vec3 &, x);\n\tI_Method1(void, vertex, IN, const osg::Vec2 &, x);\n\tI_Method1(void, vertex, IN, const osg::Vec4 &, x);\n\tI_Method2(void, vertex, IN, float, x, IN, float, x);\n\tI_Method4(void, vertex, IN, float, x, IN, float, x, IN, float, x, IN, float, x);\n\tI_Method0(void, end);\n\tI_Method0(void, addDrawable);\n\tI_Method0(void, addMatrix);\n\tI_Method1(void, addLight, IN, int, np);\n\tI_Method1(void, addImpostor, IN, int, np);\n\tI_Method0(int, getBins);\n\tI_Method1(void, setDepth, IN, int, d);\n\tI_Method1(void, addBins, IN, int, np);\n\tI_Method1(void, setBinNo, IN, int, n);\n\tI_Method0(osgUtil::Statistics::PrimitiveCountMap::iterator, GetPrimitivesBegin);\n\tI_Method0(osgUtil::Statistics::PrimitiveCountMap::iterator, GetPrimitivesEnd);\n\tI_WriteOnlyProperty(int, BinNo);\n\tI_ReadOnlyProperty(int, Bins);\n\tI_WriteOnlyProperty(int, Depth);\n\tI_WriteOnlyProperty(osgUtil::Statistics::statsType, Type);\nEND_REFLECTOR\n\nTYPE_NAME_ALIAS(std::set< osg::Node * >, osgUtil::StatsVisitor::NodeSet);\n\nTYPE_NAME_ALIAS(std::set< osg::Drawable * >, osgUtil::StatsVisitor::DrawableSet);\n\nBEGIN_OBJECT_REFLECTOR(osgUtil::StatsVisitor)\n\tI_BaseType(osg::NodeVisitor);\n\tI_Constructor0();\n\tI_Method0(void, reset);\n\tI_Method1(void, apply, IN, osg::Group &, node);\n\tI_Method1(void, apply, IN, osg::Transform &, node);\n\tI_Method1(void, apply, IN, osg::LOD &, node);\n\tI_Method1(void, apply, IN, osg::Switch &, node);\n\tI_Method1(void, apply, IN, osg::Geode &, node);\n\tI_Method1(void, apply, IN, osg::Drawable &, drawable);\n\tI_Method0(void, totalUpStats);\n\tI_Method1(void, print, IN, std::ostream &, out);\nEND_REFLECTOR\n\nSTD_MAP_REFLECTOR(std::map< GLenum COMMA  osgUtil::Statistics::PrimitivePair >);\n\nSTD_MAP_REFLECTOR(std::map< GLenum COMMA  unsigned int >);\n\nSTD_PAIR_REFLECTOR(std::pair< unsigned int COMMA  unsigned int >);\n\nSTD_SET_REFLECTOR(std::set< osg::Drawable * >);\n\n<|endoftext|>"}
{"text":"<commit_before>\/** Copyright 2008, 2009, 2010, 2011, 2012 Roland Olbricht\n*\n* This file is part of Overpass_API.\n*\n* Overpass_API 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* Overpass_API is distributed in the hope that it will be 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 Overpass_API.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include \"resource_manager.h\"\n#include \"scripting_core.h\"\n#include \"..\/expat\/expat_justparse_interface.h\"\n#include \"..\/frontend\/web_output.h\"\n#include \"..\/frontend\/user_interface.h\"\n#include \"..\/statements\/osm_script.h\"\n#include \"..\/statements\/statement.h\"\n#include \"..\/..\/template_db\/dispatcher.h\"\n\n#include <errno.h>\n#include <fcntl.h>\n#include <sys\/mman.h>\n#include <sys\/select.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <unistd.h>\n\n#include <cstdlib>\n#include <cstring>\n#include <fstream>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nint main(int argc, char *argv[])\n{\n  Web_Output error_output(Error_Output::ASSISTING);\n  Statement::set_error_output(&error_output);\n  \n  try\n  {\n    string xml_raw(get_xml_cgi(&error_output));\n    \n    if (error_output.display_encoding_errors())\n      return 0;\n    \n    Statement::Factory stmt_factory;\n    if (!parse_and_validate(stmt_factory, xml_raw, &error_output, parser_execute))\n      return 0;\n    \n    \/\/ open read transaction and log this.\n    int area_level = 0;\n    Dispatcher_Stub dispatcher(\"\", &error_output, xml_raw, area_level);\n    \n    \/\/ set limits - short circuited until forecast gets effective\n    dispatcher.set_limits();\n    \n    Osm_Script_Statement* osm_script = 0;\n    if (!get_statement_stack()->empty())\n      osm_script = dynamic_cast< Osm_Script_Statement* >(get_statement_stack()->front());\n    if (!osm_script || osm_script->get_type() == \"xml\")\n      error_output.write_xml_header\n          (dispatcher.get_timestamp(),\n\t   area_level > 0 ? dispatcher.get_area_timestamp() : \"\");\n    else if (osm_script->get_type() == \"json\")\n      error_output.write_json_header\n          (dispatcher.get_timestamp(),\n\t   area_level > 0 ? dispatcher.get_area_timestamp() : \"\");\n    else\n      ;\n\n    for (vector< Statement* >::const_iterator it(get_statement_stack()->begin());\n\t it != get_statement_stack()->end(); ++it)\n      (*it)->execute(dispatcher.resource_manager());\n\n      for (vector< Statement* >::const_iterator it(get_statement_stack()->begin());\n\t it != get_statement_stack()->end(); ++it)\n      (*it)->execute(dispatcher.resource_manager());\n    \n    if (osm_script && osm_script->get_type() == \"custom\")\n    {\n      uint32 count = osm_script->get_written_elements_count();\n      if (count == 0)\n      {\n        error_output.write_html_header\n            (dispatcher.get_timestamp(),\n\t     area_level > 0 ? dispatcher.get_area_timestamp() : \"\");\n\tcout<<\"<p>No results found.<\/p>\\n\";\n\terror_output.write_footer();\n      }\n      else if (count == 1)\n      {\n\tcout<<\"HTTP\/1.1 302 Found\\n\";\n\tcout<<\"Location: \"\n\t    <<osm_script->adapt_url(\"http:\/\/www.openstreetmap.org\/browse\/{{{type}}}\/{{{id}}}\")\n\t    <<\"\\n\\n\";\n      }\n      else\n      {\n        error_output.write_html_header\n            (dispatcher.get_timestamp(),\n\t     area_level > 0 ? dispatcher.get_area_timestamp() : \"\");\n        cout<<'\\n'<<osm_script->get_output();\n\terror_output.write_footer();\n      }\n    }\n    else\n      error_output.write_footer();\n  }\n  catch(File_Error e)\n  {\n    ostringstream temp;\n    if (e.origin.substr(e.origin.size()-9) == \"::timeout\")\n      temp<<\"open64: \"<<e.error_number<<' '<<e.filename<<' '<<e.origin\n          <<\". Probably the server is overcrowded.\\n\";\n    else\n      temp<<\"open64: \"<<e.error_number<<' '<<e.filename<<' '<<e.origin;\n    error_output.runtime_error(temp.str());\n  }\n  catch(Resource_Error e)\n  {\n    ostringstream temp;\n    if (e.timed_out)\n      temp<<\"Query timed out in \\\"\"<<e.stmt_name<<\"\\\" at line \"<<e.line_number\n          <<\" after \"<<e.runtime<<\" seconds.\";\n    else\n      temp<<\"Query run out of memory in \\\"\"<<e.stmt_name<<\"\\\" at line \"\n          <<e.line_number<<\" using about \"<<e.size\/(1024*1024)<<\" MB of RAM.\";\n    error_output.runtime_error(temp.str());\n  }\n  catch(Exit_Error e) {}\n\n  return 0;\n}\n<commit_msg>Progress with permanent id.<commit_after>\/** Copyright 2008, 2009, 2010, 2011, 2012 Roland Olbricht\n*\n* This file is part of Overpass_API.\n*\n* Overpass_API 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* Overpass_API is distributed in the hope that it will be 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 Overpass_API.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include \"resource_manager.h\"\n#include \"scripting_core.h\"\n#include \"..\/expat\/expat_justparse_interface.h\"\n#include \"..\/frontend\/web_output.h\"\n#include \"..\/frontend\/user_interface.h\"\n#include \"..\/statements\/osm_script.h\"\n#include \"..\/statements\/statement.h\"\n#include \"..\/..\/template_db\/dispatcher.h\"\n\n#include <errno.h>\n#include <fcntl.h>\n#include <sys\/mman.h>\n#include <sys\/select.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <unistd.h>\n\n#include <cstdlib>\n#include <cstring>\n#include <fstream>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nint main(int argc, char *argv[])\n{\n  Web_Output error_output(Error_Output::ASSISTING);\n  Statement::set_error_output(&error_output);\n  \n  try\n  {\n    string xml_raw(get_xml_cgi(&error_output));\n    \n    if (error_output.display_encoding_errors())\n      return 0;\n    \n    Statement::Factory stmt_factory;\n    if (!parse_and_validate(stmt_factory, xml_raw, &error_output, parser_execute))\n      return 0;\n    \n    \/\/ open read transaction and log this.\n    int area_level = 0;\n    Dispatcher_Stub dispatcher(\"\", &error_output, xml_raw, area_level);\n    \n    \/\/ set limits - short circuited until forecast gets effective\n    dispatcher.set_limits();\n    \n    Osm_Script_Statement* osm_script = 0;\n    if (!get_statement_stack()->empty())\n      osm_script = dynamic_cast< Osm_Script_Statement* >(get_statement_stack()->front());\n    if (!osm_script || osm_script->get_type() == \"xml\")\n      error_output.write_xml_header\n          (dispatcher.get_timestamp(),\n\t   area_level > 0 ? dispatcher.get_area_timestamp() : \"\");\n    else if (osm_script->get_type() == \"json\")\n      error_output.write_json_header\n          (dispatcher.get_timestamp(),\n\t   area_level > 0 ? dispatcher.get_area_timestamp() : \"\");\n    else\n      ;\n\n    for (vector< Statement* >::const_iterator it(get_statement_stack()->begin());\n\t it != get_statement_stack()->end(); ++it)\n      (*it)->execute(dispatcher.resource_manager());\n\n    if (osm_script && osm_script->get_type() == \"custom\")\n    {\n      uint32 count = osm_script->get_written_elements_count();\n      if (count == 0)\n      {\n        error_output.write_html_header\n            (dispatcher.get_timestamp(),\n\t     area_level > 0 ? dispatcher.get_area_timestamp() : \"\");\n\tcout<<\"<p>No results found.<\/p>\\n\";\n\terror_output.write_footer();\n      }\n      else if (count == 1)\n      {\n\tcout<<\"Status: 302 Moved\\n\";\n\tcout<<\"Location: \"\n\t    <<osm_script->adapt_url(\"http:\/\/www.openstreetmap.org\/browse\/{{{type}}}\/{{{id}}}\")\n\t    <<\"\\n\\n\";\n      }\n      else\n      {\n        error_output.write_html_header\n            (dispatcher.get_timestamp(),\n\t     area_level > 0 ? dispatcher.get_area_timestamp() : \"\");\n        cout<<'\\n'<<osm_script->get_output();\n\terror_output.write_footer();\n      }\n    }\n    else\n      error_output.write_footer();\n  }\n  catch(File_Error e)\n  {\n    ostringstream temp;\n    if (e.origin.substr(e.origin.size()-9) == \"::timeout\")\n      temp<<\"open64: \"<<e.error_number<<' '<<e.filename<<' '<<e.origin\n          <<\". Probably the server is overcrowded.\\n\";\n    else\n      temp<<\"open64: \"<<e.error_number<<' '<<e.filename<<' '<<e.origin;\n    error_output.runtime_error(temp.str());\n  }\n  catch(Resource_Error e)\n  {\n    ostringstream temp;\n    if (e.timed_out)\n      temp<<\"Query timed out in \\\"\"<<e.stmt_name<<\"\\\" at line \"<<e.line_number\n          <<\" after \"<<e.runtime<<\" seconds.\";\n    else\n      temp<<\"Query run out of memory in \\\"\"<<e.stmt_name<<\"\\\" at line \"\n          <<e.line_number<<\" using about \"<<e.size\/(1024*1024)<<\" MB of RAM.\";\n    error_output.runtime_error(temp.str());\n  }\n  catch(Exit_Error e) {}\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * Copyright (c) 2015 - The CM Authors <legal@clickmatcher.com>\n *   All Rights Reserved.\n *\n * This file is CONFIDENTIAL -- Distribution or duplication of this material or\n * the information contained herein is strictly forbidden unless prior written\n * permission is obtained.\n *\/\n#include <stdlib.h>\n#include <unistd.h>\n#include <signal.h>\n#include \"fnord-base\/io\/filerepository.h\"\n#include \"fnord-base\/io\/fileutil.h\"\n#include \"fnord-base\/application.h\"\n#include \"fnord-base\/logging.h\"\n#include \"fnord-base\/random.h\"\n#include \"fnord-base\/thread\/eventloop.h\"\n#include \"fnord-base\/thread\/threadpool.h\"\n#include \"fnord-base\/wallclock.h\"\n#include \"fnord-base\/VFS.h\"\n#include \"fnord-rpc\/ServerGroup.h\"\n#include \"fnord-rpc\/RPC.h\"\n#include \"fnord-rpc\/RPCClient.h\"\n#include \"fnord-base\/cli\/flagparser.h\"\n#include \"fnord-json\/json.h\"\n#include \"fnord-json\/jsonrpc.h\"\n#include \"fnord-http\/httprouter.h\"\n#include \"fnord-http\/httpserver.h\"\n#include \"fnord-http\/VFSFileServlet.h\"\n#include \"fnord-feeds\/FeedService.h\"\n#include \"fnord-feeds\/RemoteFeedFactory.h\"\n#include \"fnord-feeds\/RemoteFeedReader.h\"\n#include \"fnord-base\/stats\/statsdagent.h\"\n#include \"fnord-sstable\/SSTableServlet.h\"\n#include \"fnord-eventdb\/EventDBServlet.h\"\n#include \"fnord-mdb\/MDB.h\"\n#include \"fnord-mdb\/MDBUtil.h\"\n#include \"common.h\"\n#include \"CustomerNamespace.h\"\n#include \"FeatureSchema.h\"\n#include \"JoinedQuery.h\"\n#include \"analytics\/AnalyticsServlet.h\"\n#include \"analytics\/CTRByPageServlet.h\"\n#include \"analytics\/CTRStatsServlet.h\"\n#include \"analytics\/CTRByPositionQuery.h\"\n#include \"analytics\/CTRByPageQuery.h\"\n#include \"analytics\/TopSearchQueriesQuery.h\"\n#include \"analytics\/DiscoveryKPIQuery.h\"\n#include \"analytics\/DiscoveryCategoryStatsQuery.h\"\n#include \"analytics\/AnalyticsQueryEngine.h\"\n#include \"analytics\/AnalyticsQueryEngine.h\"\n\nusing namespace fnord;\n\nint main(int argc, const char** argv) {\n  fnord::Application::init();\n  fnord::Application::logToStderr();\n\n  fnord::cli::FlagParser flags;\n\n  flags.defineFlag(\n      \"http_port\",\n      fnord::cli::FlagParser::T_INTEGER,\n      false,\n      NULL,\n      \"8000\",\n      \"Start the public http server on this port\",\n      \"<port>\");\n\n  flags.defineFlag(\n      \"artifacts\",\n      cli::FlagParser::T_STRING,\n      true,\n      NULL,\n      NULL,\n      \"artifacts path\",\n      \"<path>\");\n\n  flags.defineFlag(\n      \"loglevel\",\n      fnord::cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      \"INFO\",\n      \"loglevel\",\n      \"<level>\");\n\n  flags.parseArgv(argc, argv);\n\n  Logger::get()->setMinimumLogLevel(\n      strToLogLevel(flags.getString(\"loglevel\")));\n\n  WhitelistVFS vfs;\n\n  \/* start http server *\/\n  fnord::thread::EventLoop ev;\n  fnord::thread::ThreadPool tpool;\n  fnord::http::HTTPRouter http_router;\n  fnord::http::HTTPServer http_server(&http_router, &ev);\n  http_server.listen(flags.getInt(\"http_port\"));\n\n  \/* sstable servlet *\/\n  sstable::SSTableServlet sstable_servlet(\"\/sstable\", &vfs);\n  http_router.addRouteByPrefixMatch(\"\/sstable\", &sstable_servlet);\n\n  \/* file servlet *\/\n  http::VFSFileServlet file_servlet(\"\/file\", &vfs);\n  http_router.addRouteByPrefixMatch(\"\/file\", &file_servlet);\n\n  \/* add all files to whitelist vfs *\/\n  auto dir = flags.getString(\"artifacts\");\n  FileUtil::ls(dir, [&vfs, &dir] (const String& file) -> bool {\n    vfs.registerFile(file, FileUtil::joinPaths(dir, file));\n    fnord::logInfo(\"cm.reportserver\", \"[VFS] Adding file: $0\", file);\n    return true;\n  });\n\n  \/* analytics *\/\n  cm::AnalyticsQueryEngine analytics(8, &vfs);\n  cm::AnalyticsServlet analytics_servlet(&analytics);\n  eventdb::EventDBServlet eventdb_servlet;\n  http_router.addRouteByPrefixMatch(\"\/analytics\", &analytics_servlet, &tpool);\n  http_router.addRouteByPrefixMatch(\"\/eventdb\", &eventdb_servlet, &tpool);\n\n  analytics.registerQueryFactory(\"ctr_by_position\", [] (\n      const cm::AnalyticsQuery& query,\n      const cm::AnalyticsQuery::SubQueryParams params,\n      const Vector<RefPtr<cm::TrafficSegment>>& segments,\n      cm::AnalyticsTableScan* scan) {\n    return new cm::CTRByPositionQuery(scan, segments);\n  });\n\n  analytics.registerQueryFactory(\"ctr_by_page\", [] (\n      const cm::AnalyticsQuery& query,\n      const cm::AnalyticsQuery::SubQueryParams params,\n      const Vector<RefPtr<cm::TrafficSegment>>& segments,\n      cm::AnalyticsTableScan* scan) {\n    return new cm::CTRByPageQuery(scan, segments);\n  });\n\n  analytics.registerQueryFactory(\"discovery_kpis\", [] (\n      const cm::AnalyticsQuery& query,\n      const cm::AnalyticsQuery::SubQueryParams params,\n      const Vector<RefPtr<cm::TrafficSegment>>& segments,\n      cm::AnalyticsTableScan* scan) {\n    return new cm::DiscoveryKPIQuery(\n        scan,\n        segments,\n        query.start_time,\n        query.end_time);\n  });\n\n  analytics.registerQueryFactory(\"discovery_category0_kpis\", [] (\n      const cm::AnalyticsQuery& query,\n      const cm::AnalyticsQuery::SubQueryParams params,\n      const Vector<RefPtr<cm::TrafficSegment>>& segments,\n      cm::AnalyticsTableScan* scan) {\n    return new cm::DiscoveryCategoryStatsQuery(\n        scan,\n        segments,\n        \"queries.category1\",\n        \"queries.category1\",\n        params);\n  });\n\n  analytics.registerQueryFactory(\"discovery_category1_kpis\", [] (\n      const cm::AnalyticsQuery& query,\n      const cm::AnalyticsQuery::SubQueryParams params,\n      const Vector<RefPtr<cm::TrafficSegment>>& segments,\n      cm::AnalyticsTableScan* scan) {\n    return new cm::DiscoveryCategoryStatsQuery(\n        scan,\n        segments,\n        \"queries.category1\",\n        \"queries.category2\",\n        params);\n  });\n\n  analytics.registerQueryFactory(\"discovery_category2_kpis\", [] (\n      const cm::AnalyticsQuery& query,\n      const cm::AnalyticsQuery::SubQueryParams params,\n      const Vector<RefPtr<cm::TrafficSegment>>& segments,\n      cm::AnalyticsTableScan* scan) {\n    return new cm::DiscoveryCategoryStatsQuery(\n        scan,\n        segments,\n        \"queries.category2\",\n        \"queries.category3\",\n        params);\n  });\n\n  analytics.registerQueryFactory(\"discovery_category3_kpis\", [] (\n      const cm::AnalyticsQuery& query,\n      const cm::AnalyticsQuery::SubQueryParams params,\n      const Vector<RefPtr<cm::TrafficSegment>>& segments,\n      cm::AnalyticsTableScan* scan) {\n    return new cm::DiscoveryCategoryStatsQuery(\n        scan,\n        segments,\n        \"queries.category3\",\n        \"queries.category3\",\n        params);\n  });\n\n  analytics.registerQueryFactory(\"top_search_queries\", [] (\n      const cm::AnalyticsQuery& query,\n      const cm::AnalyticsQuery::SubQueryParams params,\n      const Vector<RefPtr<cm::TrafficSegment>>& segments,\n      cm::AnalyticsTableScan* scan) {\n    return new cm::TopSearchQueriesQuery(scan, segments, params);\n  });\n\n  ev.run();\n  return 0;\n}\n\n<commit_msg>TableRepository<commit_after>\/**\n * Copyright (c) 2015 - The CM Authors <legal@clickmatcher.com>\n *   All Rights Reserved.\n *\n * This file is CONFIDENTIAL -- Distribution or duplication of this material or\n * the information contained herein is strictly forbidden unless prior written\n * permission is obtained.\n *\/\n#include <stdlib.h>\n#include <unistd.h>\n#include <signal.h>\n#include \"fnord-base\/io\/filerepository.h\"\n#include \"fnord-base\/io\/fileutil.h\"\n#include \"fnord-base\/application.h\"\n#include \"fnord-base\/logging.h\"\n#include \"fnord-base\/random.h\"\n#include \"fnord-base\/thread\/eventloop.h\"\n#include \"fnord-base\/thread\/threadpool.h\"\n#include \"fnord-base\/wallclock.h\"\n#include \"fnord-base\/VFS.h\"\n#include \"fnord-rpc\/ServerGroup.h\"\n#include \"fnord-rpc\/RPC.h\"\n#include \"fnord-rpc\/RPCClient.h\"\n#include \"fnord-base\/cli\/flagparser.h\"\n#include \"fnord-json\/json.h\"\n#include \"fnord-json\/jsonrpc.h\"\n#include \"fnord-http\/httprouter.h\"\n#include \"fnord-http\/httpserver.h\"\n#include \"fnord-http\/VFSFileServlet.h\"\n#include \"fnord-feeds\/FeedService.h\"\n#include \"fnord-feeds\/RemoteFeedFactory.h\"\n#include \"fnord-feeds\/RemoteFeedReader.h\"\n#include \"fnord-base\/stats\/statsdagent.h\"\n#include \"fnord-sstable\/SSTableServlet.h\"\n#include \"fnord-eventdb\/EventDBServlet.h\"\n#include \"fnord-eventdb\/TableRepository.h\"\n#include \"fnord-mdb\/MDB.h\"\n#include \"fnord-mdb\/MDBUtil.h\"\n#include \"common.h\"\n#include \"CustomerNamespace.h\"\n#include \"FeatureSchema.h\"\n#include \"JoinedQuery.h\"\n#include \"analytics\/AnalyticsServlet.h\"\n#include \"analytics\/CTRByPageServlet.h\"\n#include \"analytics\/CTRStatsServlet.h\"\n#include \"analytics\/CTRByPositionQuery.h\"\n#include \"analytics\/CTRByPageQuery.h\"\n#include \"analytics\/TopSearchQueriesQuery.h\"\n#include \"analytics\/DiscoveryKPIQuery.h\"\n#include \"analytics\/DiscoveryCategoryStatsQuery.h\"\n#include \"analytics\/AnalyticsQueryEngine.h\"\n#include \"analytics\/AnalyticsQueryEngine.h\"\n\nusing namespace fnord;\n\nint main(int argc, const char** argv) {\n  fnord::Application::init();\n  fnord::Application::logToStderr();\n\n  fnord::cli::FlagParser flags;\n\n  flags.defineFlag(\n      \"http_port\",\n      fnord::cli::FlagParser::T_INTEGER,\n      false,\n      NULL,\n      \"8000\",\n      \"Start the public http server on this port\",\n      \"<port>\");\n\n  flags.defineFlag(\n      \"artifacts\",\n      cli::FlagParser::T_STRING,\n      true,\n      NULL,\n      NULL,\n      \"artifacts path\",\n      \"<path>\");\n\n  flags.defineFlag(\n      \"loglevel\",\n      fnord::cli::FlagParser::T_STRING,\n      false,\n      NULL,\n      \"INFO\",\n      \"loglevel\",\n      \"<level>\");\n\n  flags.parseArgv(argc, argv);\n\n  Logger::get()->setMinimumLogLevel(\n      strToLogLevel(flags.getString(\"loglevel\")));\n\n  WhitelistVFS vfs;\n\n  \/* start http server *\/\n  fnord::thread::EventLoop ev;\n  fnord::thread::ThreadPool tpool;\n  fnord::http::HTTPRouter http_router;\n  fnord::http::HTTPServer http_server(&http_router, &ev);\n  http_server.listen(flags.getInt(\"http_port\"));\n\n  \/* sstable servlet *\/\n  sstable::SSTableServlet sstable_servlet(\"\/sstable\", &vfs);\n  http_router.addRouteByPrefixMatch(\"\/sstable\", &sstable_servlet);\n\n  \/* file servlet *\/\n  http::VFSFileServlet file_servlet(\"\/file\", &vfs);\n  http_router.addRouteByPrefixMatch(\"\/file\", &file_servlet);\n\n  \/* add all files to whitelist vfs *\/\n  auto dir = flags.getString(\"artifacts\");\n  FileUtil::ls(dir, [&vfs, &dir] (const String& file) -> bool {\n    vfs.registerFile(file, FileUtil::joinPaths(dir, file));\n    fnord::logInfo(\"cm.reportserver\", \"[VFS] Adding file: $0\", file);\n    return true;\n  });\n\n\n  \/* eventdb *\/\n  eventdb::TableRepository table_repo;\n  eventdb::EventDBServlet eventdb_servlet(&table_repo);\n\n  \/* analytics *\/\n  cm::AnalyticsQueryEngine analytics(8, &vfs);\n  cm::AnalyticsServlet analytics_servlet(&analytics);\n  http_router.addRouteByPrefixMatch(\"\/analytics\", &analytics_servlet, &tpool);\n  http_router.addRouteByPrefixMatch(\"\/eventdb\", &eventdb_servlet, &tpool);\n\n  analytics.registerQueryFactory(\"ctr_by_position\", [] (\n      const cm::AnalyticsQuery& query,\n      const cm::AnalyticsQuery::SubQueryParams params,\n      const Vector<RefPtr<cm::TrafficSegment>>& segments,\n      cm::AnalyticsTableScan* scan) {\n    return new cm::CTRByPositionQuery(scan, segments);\n  });\n\n  analytics.registerQueryFactory(\"ctr_by_page\", [] (\n      const cm::AnalyticsQuery& query,\n      const cm::AnalyticsQuery::SubQueryParams params,\n      const Vector<RefPtr<cm::TrafficSegment>>& segments,\n      cm::AnalyticsTableScan* scan) {\n    return new cm::CTRByPageQuery(scan, segments);\n  });\n\n  analytics.registerQueryFactory(\"discovery_kpis\", [] (\n      const cm::AnalyticsQuery& query,\n      const cm::AnalyticsQuery::SubQueryParams params,\n      const Vector<RefPtr<cm::TrafficSegment>>& segments,\n      cm::AnalyticsTableScan* scan) {\n    return new cm::DiscoveryKPIQuery(\n        scan,\n        segments,\n        query.start_time,\n        query.end_time);\n  });\n\n  analytics.registerQueryFactory(\"discovery_category0_kpis\", [] (\n      const cm::AnalyticsQuery& query,\n      const cm::AnalyticsQuery::SubQueryParams params,\n      const Vector<RefPtr<cm::TrafficSegment>>& segments,\n      cm::AnalyticsTableScan* scan) {\n    return new cm::DiscoveryCategoryStatsQuery(\n        scan,\n        segments,\n        \"queries.category1\",\n        \"queries.category1\",\n        params);\n  });\n\n  analytics.registerQueryFactory(\"discovery_category1_kpis\", [] (\n      const cm::AnalyticsQuery& query,\n      const cm::AnalyticsQuery::SubQueryParams params,\n      const Vector<RefPtr<cm::TrafficSegment>>& segments,\n      cm::AnalyticsTableScan* scan) {\n    return new cm::DiscoveryCategoryStatsQuery(\n        scan,\n        segments,\n        \"queries.category1\",\n        \"queries.category2\",\n        params);\n  });\n\n  analytics.registerQueryFactory(\"discovery_category2_kpis\", [] (\n      const cm::AnalyticsQuery& query,\n      const cm::AnalyticsQuery::SubQueryParams params,\n      const Vector<RefPtr<cm::TrafficSegment>>& segments,\n      cm::AnalyticsTableScan* scan) {\n    return new cm::DiscoveryCategoryStatsQuery(\n        scan,\n        segments,\n        \"queries.category2\",\n        \"queries.category3\",\n        params);\n  });\n\n  analytics.registerQueryFactory(\"discovery_category3_kpis\", [] (\n      const cm::AnalyticsQuery& query,\n      const cm::AnalyticsQuery::SubQueryParams params,\n      const Vector<RefPtr<cm::TrafficSegment>>& segments,\n      cm::AnalyticsTableScan* scan) {\n    return new cm::DiscoveryCategoryStatsQuery(\n        scan,\n        segments,\n        \"queries.category3\",\n        \"queries.category3\",\n        params);\n  });\n\n  analytics.registerQueryFactory(\"top_search_queries\", [] (\n      const cm::AnalyticsQuery& query,\n      const cm::AnalyticsQuery::SubQueryParams params,\n      const Vector<RefPtr<cm::TrafficSegment>>& segments,\n      cm::AnalyticsTableScan* scan) {\n    return new cm::TopSearchQueriesQuery(scan, segments, params);\n  });\n\n  ev.run();\n  return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @file Bun.hpp\n\/\/\/ @author BrainlessLabs\n\/\/\/ @version 0.3\n\/\/\/ @brief The include file for Bun ORM. This file includes all the source\n\/\/\/        to make the class\/struct persist in sqlite. Users need to include\n\/\/\/        only this file.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#include <string>\n#include <memory>\n#include <type_traits>\n#include <boost\/mpl\/bool.hpp>\n#include <boost\/preprocessor.hpp>\n#include <boost\/fusion\/sequence.hpp>\n#include <boost\/fusion\/include\/sequence.hpp>\n#include <boost\/fusion\/adapted\/struct\/adapt_struct.hpp>\n#include <boost\/fusion\/include\/adapt_struct.hpp>\n#include <boost\/fusion\/algorithm\/iteration\/for_each.hpp>\n#include <boost\/fusion\/include\/for_each.hpp>\n#include <boost\/preprocessor\/tuple\/rem.hpp>\n#include <third_party\/fmt\/format.hpp>\n#include \"blib\/bun\/PRef.hpp\"\n\/\/#include \"blib\/bun\/PRefHelper.hpp\"\n#include \"blib\/bun\/DbBackend.hpp\"\n#include \"blib\/bun\/DbLogger.hpp\"\n\/\/#include \"blib\/bun\/QueryHelper.hpp\"\n#include \"blib\/bun\/CppTypeToSQLString.hpp\"\n#include \"blib\/bun\/GlobalFunc.hpp\"\n#include \"blib\/utils\/JSONUtils.hpp\"\n\/\/#include \"blib\/bun\/NxNMappings.hpp\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @basic Basic Persistance Start\n\/\/\/ @details We will be using the Bun class for all the examples and\n\/\/\/          understanding\n\/\/\/          struct Bun {\n\/\/\/            std::string bun_name,\n\/\/\/            float sugar_quantity;\n\/\/\/            float flour_quantity;\n\/\/\/            float milk_quantity;\n\/\/\/            float yeast_quantity;\n\/\/\/            float butter_quantity;\n\/\/\/            int bun_length;\n\/\/\/          };\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/\/ @brief Make this 0 if no log is needed, else make it 1\n#define QUERY_LOG_ON 1\n\/\/\/ @brief Log the query\n#define QUERY_LOG(log_string) BOOST_PP_EXPR_IF(QUERY_LOG_ON, l().info(log_string))\n\n\/\/\/ @brief Macro to output comments\n#define BLIB_MACRO_COMMENTS_ENABLED 0\n#define BLIB_MACRO_COMMENTS_IF(a) BOOST_PP_EXPR_IF(BLIB_MACRO_COMMENTS_ENABLED, a)\n\n\/\/\/ @brief createSchema Helper Macros\n\/\/\/ @details We need to pass only the data members as a tuple to this macro\n\/\/\/ @param ELEMS_TUP = (bun_name, sugar_quantity, flour_quantity, milk_quantity, yeast_quantity, butter_quantity, bun_length)\n\/\/\/ @brief Expands the class members for CREATE TABLE\n#define EXPAND_CLASS_MEMBERS_createSchema_I(z, n, ELEMS_TUP) \", \" BOOST_STRINGIZE(BOOST_PP_TUPLE_ELEM(n, ELEMS_TUP)) \" {}\"\n#define EXPAND_CLASS_MEMBERS_createSchema(ELEMS_TUP) BOOST_PP_REPEAT(BOOST_PP_TUPLE_SIZE(ELEMS_TUP), EXPAND_CLASS_MEMBERS_createSchema_I, ELEMS_TUP)\n\nnamespace blib {\n\tnamespace bun {\n\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\/\/\/ @class IsPersistant\n\t\t\/\/\/ @brief If IsPersistant<Class>::value == true then Class can be persisted.\n\t\t\/\/\/        Specialize this class for all the class which can be persistent.\n\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\ttemplate<typename T>\n\t\tstruct IsPersistant : boost::mpl::bool_<std::is_integral<T>::value> {\n\t\t};\n\n\t\ttemplate<>\n\t\tstruct IsPersistant<std::string> : boost::mpl::bool_<true> {\n\t\t};\n\t}\n}\n\nnamespace blib {\n\tnamespace bun {\n\t\tnamespace __private {\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\t\/\/\/ @class EnclosureType\n\t\t\t\/\/\/ @brief Holds what kind of mapper type\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\tenum class EnclosureType {\n\t\t\t\tkUnknown = 0,\n\t\t\t\tkBaseType,\n\t\t\t\tkVector,\n\t\t\t\tkUniquePointer,\n\t\t\t\tkSharedPointer\n\t\t\t};\n\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\t\/\/\/ @class FindEncloseeTypeMeta\n\t\t\t\/\/\/ @brief Deducts the enclosee type\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\t\t\t\t\n\t\t\ttemplate<typename T>\n\t\t\tstruct FindEncloseeTypeMeta {\n\t\t\t\tusing type = T;\n\t\t\t};\n\n\t\t\ttemplate<typename T>\n\t\t\tstruct FindEncloseeTypeMeta<std::vector<T>> {\n\t\t\t\tusing type = T;\n\t\t\t};\n\n\t\t\ttemplate<typename T>\n\t\t\tstruct FindEncloseeTypeMeta<std::unique_ptr<T>> {\n\t\t\t\tusing type = T;\n\t\t\t};\n\n\t\t\ttemplate<typename T>\n\t\t\tstruct FindEncloseeTypeMeta<std::shared_ptr<T>> {\n\t\t\t\tusing type = T;\n\t\t\t};\n\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\t\/\/\/ @class IsUniquePointer\n\t\t\t\/\/\/ @brief Find if this is a unique pointer\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\ttemplate<typename T>\n\t\t\tstruct IsUniquePointer : boost::mpl::bool_<false> {\n\t\t\t};\n\n\t\t\ttemplate<typename T>\n\t\t\tstruct IsUniquePointer<std::unique_ptr<T>> : boost::mpl::bool_<true> {\n\t\t\t};\n\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\t\/\/\/ @class IsSharedPointer\n\t\t\t\/\/\/ @brief Find if this is a shared pointer\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\ttemplate<typename T>\n\t\t\tstruct IsSharedPointer : boost::mpl::bool_<false> {\n\t\t\t};\n\n\t\t\ttemplate<typename T>\n\t\t\tstruct IsSharedPointer<std::shared_ptr<T>> : boost::mpl::bool_<true> {\n\t\t\t};\n\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\t\/\/\/ @class getValue\n\t\t\t\/\/\/ @brief Get the value\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\t\/\/\/ @fn getValue\n\t\t\t\/\/\/ @brief Get the value\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\ttemplate<typename T>\n\t\t\tauto getValue(T const& a)->T& {\n\t\t\t\treturn a;\n\t\t\t}\n\n\t\t\t\/\/\/ @brief Consider a regular pointer as a shared pointer too\n\t\t\ttemplate<typename T>\n\t\t\tstruct IsSharedPointer<T*> : boost::mpl::bool_<true> {\n\t\t\t};\n\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\t\/\/\/ @class FindEnclosureTypeMeta\n\t\t\t\/\/\/ @brief Deducts the enclosing type\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\t\t\t\n\t\t\ttemplate<typename T>\n\t\t\tstruct FindEnclosureTypeMeta {\n\t\t\t\tstatic const EnclosureType = EnclosureType::kBaseType;\n\t\t\t};\n\n\t\t\ttemplate<typename T>\n\t\t\tstruct FindEnclosureTypeMeta<std::vector<T>> {\n\t\t\t\tstatic const EnclosureType = EnclosureType::kVector;\n\t\t\t};\n\n\t\t\ttemplate<typename T>\n\t\t\tstruct FindEnclosureTypeMeta<std::unique_ptr<T>> {\n\t\t\t\tstatic const EnclosureType = EnclosureType::kUniquePointer;\n\t\t\t};\n\n\t\t\ttemplate<typename T>\n\t\t\tstruct FindEnclosureTypeMeta<std::shared_ptr<T>> {\n\t\t\t\tstatic const EnclosureType = EnclosureType::kSharedPointer;\n\t\t\t};\n\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\t\/\/\/ @class TypeDetails\n\t\t\t\/\/\/ @brief Holds the type details \n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\tstruct TypeDetails {\n\t\t\t\tblib::bun::DbTypes type;\n\t\t\t\tEnclosureType enclouser_type;\n\t\t\t\tbool fundamental_type;\n\n\t\t\t\t\/\/\/ @fn TypeDetails\n\t\t\t\tTypeDetails(blib::bun::DbTypes in_type,\n\t\t\t\t\tEnclosureType in_enclouser_type,\n\t\t\t\t\tbool in_fundamental_type) :type(in_type),\n\t\t\t\t\tenclouser_type(in_enclouser_type),\n\t\t\t\t\tfundamental_type(in_fundamental_type) {}\n\t\t\t};\n\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\t\/\/\/ @class TypeMetaData\n\t\t\t\/\/\/ @brief Contains meta data that will be usieful to get type \n\t\t\t\/\/\/        inferences for a certain type.\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\ttemplate<typename T>\n\t\t\tstruct TypeMetaData {\n\t\t\t\tusing MT = boost::fusion::vector<void>;\n\t\t\t\tstatic std::string const& class_name();\n\t\t\t\tstatic std::map<std::string, TypeDetails> const& type_maps();\n\t\t\t};\n\n\t\t\ttemplate<typename T>\n\t\t\tstruct SqlHelper {\n\t\t\t\tstatic std::string const& createSchema() {\n\t\t\t\t\tstatic const std::string sql = _createSchema();\n\t\t\t\t\treturn sql;\n\t\t\t\t}\n\n\t\t\tprivate:\n\t\t\t\tstatic std::string _createSchema() {\n\t\t\t\t\tstd::string sql;\n\t\t\t\t\treturn sql;\n\t\t\t\t}\n\t\t\t};\n\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\t\/\/\/ @class PRefHelper\n\t\t\t\/\/\/ @brief Helper class for the persistent framework.\n\t\t\t\/\/\/        This class is specialized to persist objects.\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\ttemplate<typename T>\n\t\t\tstruct QueryHelper {\n\t\t\t\tstatic bool _ok;\n\t\t\t\tstatic std::string _create_table_sql;\n\t\t\t\tstatic std::string _delete_table_sql;\n\t\t\t\tstatic std::string _update_table_sql;\n\t\t\t\tstatic std::string _table_name;\n\n\t\t\t\tinline static void createSchema() {\n\t\t\t\t\t_table_name = TypeMetaData<T>::class_name();\n\t\t\t\t}\n\n\t\t\t\tinline static void createSchema(const std::string parent_table, const std::string table) {\n\n\t\t\t\t}\n\n\t\t\t\tinline static void deleteSchema();\n\n\t\t\t\tinline static SimpleOID persistObj(T *);\n\n\t\t\t\tinline static void updateObj(T *, SimpleOID const &);\n\n\t\t\t\tinline static void deleteObj(SimpleOID const &);\n\n\t\t\t\tinline static std::unique_ptr <T> getObj(SimpleOID const &);\n\n\t\t\t\tinline static std::string md5(T *, SimpleOID const &);\n\n\t\t\t\tinline static std::string objToString(T *, SimpleOID const &);\n\n\t\t\t\tinline static std::string objToJson(T *, SimpleOID const &);\n\t\t\t};\n\t\t}\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Helper Macros Start\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/\/ @brief SOCI ORM Helper Macros\n\/\/\/ @details from_base\n\/\/\/ @param ELEMS_TUP = (bun_name, sugar_quantity, flour_quantity, milk_quantity, yeast_quantity, butter_quantity, bun_length)\n#define EXPAND_MEMBER_ASSIGNENTS_from_base_I(z, n, ELEMS_TUP) c.BOOST_PP_TUPLE_ELEM(n, ELEMS_TUP) = v.get<blib::bun::__private::ConvertCPPTypeToSOCISupportType<decltype(c.BOOST_PP_TUPLE_ELEM(n, ELEMS_TUP))>::type>(BOOST_STRINGIZE(BOOST_PP_TUPLE_ELEM(n, ELEMS_TUP)));\n#define EXPAND_MEMBER_ASSIGNENTS_from_base(ELEMS_TUP) BOOST_PP_REPEAT(BOOST_PP_TUPLE_SIZE(ELEMS_TUP), EXPAND_MEMBER_ASSIGNENTS_from_base_I, ELEMS_TUP)\n\n\/\/\/ @details to_base\n\/\/\/ @param ELEMS_TUP = (bun_name, sugar_quantity, flour_quantity, milk_quantity, yeast_quantity, butter_quantity, bun_length)\n#define EXPAND_MEMBER_ASSIGNENTS_to_base_I(z, n, ELEMS_TUP) v.set(BOOST_STRINGIZE(BOOST_PP_TUPLE_ELEM(n, ELEMS_TUP)), blib::bun::__private::convertToSOCISupportedType(c.BOOST_PP_TUPLE_ELEM(n, ELEMS_TUP)));\n#define EXPAND_MEMBER_ASSIGNENTS_to_base(ELEMS_TUP) BOOST_PP_REPEAT(BOOST_PP_TUPLE_SIZE(ELEMS_TUP), EXPAND_MEMBER_ASSIGNENTS_to_base_I, ELEMS_TUP)\n\n\/\/\/ @details type_maps\n#define EXPAND_MEMBER_ASSIGNENTS_generate_type_maps_I(z, n, CLASS_ELEMS_TUP) {\\\nBOOST_STRINGIZE(BOOST_PP_TUPLE_ELEM(BOOST_PP_ADD(1, n), CLASS_ELEMS_TUP)), \\\nTypeDetails(\\\nblib::bun::CppTypeToDbType<FindEncloseeTypeMeta<BOOST_PP_TUPLE_ELEM(0, CLASS_ELEMS_TUP)::BOOST_PP_TUPLE_ELEM(BOOST_PP_ADD(1, n)>::type>::ret,\\\nFindEnclosureTypeMeta<BOOST_PP_TUPLE_ELEM(0, CLASS_ELEMS_TUP)::BOOST_PP_TUPLE_ELEM(BOOST_PP_ADD(1, n), CLASS_ELEMS_TUP)>::type,\\\nstd::is_fundamental<BOOST_PP_TUPLE_ELEM(0, CLASS_ELEMS_TUP)::BOOST_PP_TUPLE_ELEM(BOOST_PP_ADD(1, n)>::value\\\n)\\\n},\n#define EXPAND_MEMBER_ASSIGNENTS_generate_type_maps(CLASS_ELEMS_TUP) BOOST_PP_REPEAT(BOOST_PP_SUB(BOOST_PP_TUPLE_SIZE(CLASS_ELEMS_TUP), 1), EXPAND_MEMBER_ASSIGNENTS_generate_type_maps_I, CLASS_ELEMS_TUP)\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Helper Macros End\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/\/ SPECIALIZE_BUN_HELPER Start\n#define SPECIALIZE_BUN_HELPER(CLASS_ELEMS_TUP) BOOST_FUSION_ADAPT_STRUCT(\\\nBOOST_PP_TUPLE_REM_CTOR(CLASS_ELEMS_TUP)\\\n)\\\nnamespace blib{namespace bun{\\\ntemplate<>\\\nBLIB_MACRO_COMMENTS_IF(\"@brief Lets everyone know that this is a persistant class\");\\\nstruct IsPersistant<BOOST_PP_TUPLE_ELEM(0, CLASS_ELEMS_TUP)> : boost::mpl::bool_<true> {\\\n};\\\nBLIB_MACRO_COMMENTS_IF(\"@brief Mark the class as composite\");\\\ntemplate<>\\\nstruct CppTypeToDbType<BOOST_PP_TUPLE_ELEM(0, CLASS_ELEMS_TUP)>{\\\nstatic const DbTypes ret = DbTypes::kComposite;\\\n};\\\n}\\\nnamespace blib{namespace bun{namespace __private{\\\ntemplate<>\\\nTypeMetaData<BOOST_PP_TUPLE_ELEM(0, CLASS_ELEMS_TUP)>{\\\nusing T=BOOST_PP_TUPLE_ELEM(0, CLASS_ELEMS_TUP);\\\nstatic std::string const& class_name(){\\\nstatic std::string const class_name = BOOST_STRINGIZE(BOOST_PP_TUPLE_ELEM(0, CLASS_ELEMS_TUP));\\\nreturn class_name;\\\n}\\\nstatic std::map<std::string, TypeDetails> const& type_maps(){\\\nstatic const std::map<std::string, TypeDetails> type_map = {\\\nEXPAND_MEMBER_ASSIGNENTS_generate_type_maps(CLASS_ELEMS_TUP);\\\n};\\\nreturn type_map;\\\n}\\\n};\\\n}}}\\\nnamespace soci{\\\nBLIB_MACRO_COMMENTS_IF(\"@brief --Specialization for SOCI ORM Start---\");\\\ntemplate<>\\\nstruct type_conversion<BOOST_PP_TUPLE_ELEM(0, CLASS_ELEMS_TUP)>{\\\ntypedef values base_type;\\\nusing ClassType = BOOST_PP_TUPLE_ELEM(0, CLASS_ELEMS_TUP);\\\ninline static void from_base(values const& v, indicator ind, ClassType& c){\\\nBLIB_MACRO_COMMENTS_IF(\"@brief from_base gets the values from db\");\\\nEXPAND_MEMBER_ASSIGNENTS_from_base(BOOST_PP_TUPLE_POP_FRONT( CLASS_ELEMS_TUP ));\\\n}\\\ninline static void to_base(const ClassType& c, values& v, indicator& ind){\\\nBLIB_MACRO_COMMENTS_IF(\"@brief to_base puts the values to db\");\\\nEXPAND_MEMBER_ASSIGNENTS_to_base(BOOST_PP_TUPLE_POP_FRONT( CLASS_ELEMS_TUP ));\\\n}\\\n};\\\n}\\\n\/\/\/ SPECIALIZE_BUN_HELPER End\n<commit_msg>Adding some more details<commit_after>#pragma once\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @file Bun.hpp\n\/\/\/ @author BrainlessLabs\n\/\/\/ @version 0.3\n\/\/\/ @brief The include file for Bun ORM. This file includes all the source\n\/\/\/        to make the class\/struct persist in sqlite. Users need to include\n\/\/\/        only this file.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#include <string>\n#include <memory>\n#include <set>\n#include <type_traits>\n#include <boost\/mpl\/bool.hpp>\n#include <boost\/preprocessor.hpp>\n#include <boost\/fusion\/sequence.hpp>\n#include <boost\/fusion\/include\/sequence.hpp>\n#include <boost\/fusion\/adapted\/struct\/adapt_struct.hpp>\n#include <boost\/fusion\/include\/adapt_struct.hpp>\n#include <boost\/fusion\/algorithm\/iteration\/for_each.hpp>\n#include <boost\/fusion\/include\/for_each.hpp>\n#include <boost\/preprocessor\/tuple\/rem.hpp>\n#include <third_party\/fmt\/format.hpp>\n#include \"blib\/bun\/PRef.hpp\"\n\/\/#include \"blib\/bun\/PRefHelper.hpp\"\n#include \"blib\/bun\/DbBackend.hpp\"\n#include \"blib\/bun\/DbLogger.hpp\"\n\/\/#include \"blib\/bun\/QueryHelper.hpp\"\n#include \"blib\/bun\/CppTypeToSQLString.hpp\"\n#include \"blib\/bun\/GlobalFunc.hpp\"\n#include \"blib\/utils\/JSONUtils.hpp\"\n\/\/#include \"blib\/bun\/NxNMappings.hpp\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @basic Basic Persistance Start\n\/\/\/ @details We will be using the Bun class for all the examples and\n\/\/\/          understanding\n\/\/\/          struct Bun {\n\/\/\/            std::string bun_name,\n\/\/\/            float sugar_quantity;\n\/\/\/            float flour_quantity;\n\/\/\/            float milk_quantity;\n\/\/\/            float yeast_quantity;\n\/\/\/            float butter_quantity;\n\/\/\/            int bun_length;\n\/\/\/          };\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/\/ @brief Make this 0 if no log is needed, else make it 1\n#define QUERY_LOG_ON 1\n\/\/\/ @brief Log the query\n#define QUERY_LOG(log_string) BOOST_PP_EXPR_IF(QUERY_LOG_ON, l().info(log_string))\n\n\/\/\/ @brief Macro to output comments\n#define BLIB_MACRO_COMMENTS_ENABLED 0\n#define BLIB_MACRO_COMMENTS_IF(a) BOOST_PP_EXPR_IF(BLIB_MACRO_COMMENTS_ENABLED, a)\n\n\/\/\/ @brief createSchema Helper Macros\n\/\/\/ @details We need to pass only the data members as a tuple to this macro\n\/\/\/ @param ELEMS_TUP = (bun_name, sugar_quantity, flour_quantity, milk_quantity, yeast_quantity, butter_quantity, bun_length)\n\/\/\/ @brief Expands the class members for CREATE TABLE\n#define EXPAND_CLASS_MEMBERS_createSchema_I(z, n, ELEMS_TUP) \", \" BOOST_STRINGIZE(BOOST_PP_TUPLE_ELEM(n, ELEMS_TUP)) \" {}\"\n#define EXPAND_CLASS_MEMBERS_createSchema(ELEMS_TUP) BOOST_PP_REPEAT(BOOST_PP_TUPLE_SIZE(ELEMS_TUP), EXPAND_CLASS_MEMBERS_createSchema_I, ELEMS_TUP)\n\nnamespace blib {\n\tnamespace bun {\n\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\/\/\/ @class IsPersistant\n\t\t\/\/\/ @brief If IsPersistant<Class>::value == true then Class can be persisted.\n\t\t\/\/\/        Specialize this class for all the class which can be persistent.\n\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\ttemplate<typename T>\n\t\tstruct IsPersistant : boost::mpl::bool_<std::is_integral<T>::value> {\n\t\t};\n\n\t\ttemplate<>\n\t\tstruct IsPersistant<std::string> : boost::mpl::bool_<true> {\n\t\t};\n\n\t\tnamespace __private {\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\t\/\/\/ @class DbTableType\n\t\t\t\/\/\/ @brief Helper for converting primitive types to db types\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\ttemplate<typename T>\n\t\t\tstruct DbTableType {\n\t\t\t\tusing type = T;\n\t\t\t};\n\n\t\t\ttemplate<typename T>\n\t\t\tstruct PrimitiveType {\n\t\t\t\tblib::bun::SimpleOID oid;\n\t\t\t};\n\t\t}\n\t}\n}\n\nnamespace blib {\n\tnamespace bun {\n\t\tnamespace __private {\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\t\/\/\/ @class EnclosureType\n\t\t\t\/\/\/ @brief Holds what kind of mapper type\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\tenum class EnclosureType {\n\t\t\t\tkUnknown = 0,\n\t\t\t\tkBaseType,\n\t\t\t\tkVector,\n\t\t\t\tkUniquePointer,\n\t\t\t\tkSharedPointer\n\t\t\t};\n\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\t\/\/\/ @class FindEncloseeTypeMeta\n\t\t\t\/\/\/ @brief Deducts the enclosee type\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\t\t\t\t\n\t\t\ttemplate<typename T>\n\t\t\tstruct FindEncloseeTypeMeta {\n\t\t\t\tusing type = T;\n\t\t\t};\n\n\t\t\ttemplate<typename T>\n\t\t\tstruct FindEncloseeTypeMeta<std::vector<T>> {\n\t\t\t\tusing type = T;\n\t\t\t};\n\n\t\t\ttemplate<typename T>\n\t\t\tstruct FindEncloseeTypeMeta<std::unique_ptr<T>> {\n\t\t\t\tusing type = T;\n\t\t\t};\n\n\t\t\ttemplate<typename T>\n\t\t\tstruct FindEncloseeTypeMeta<std::shared_ptr<T>> {\n\t\t\t\tusing type = T;\n\t\t\t};\n\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\t\/\/\/ @class IsUniquePointer\n\t\t\t\/\/\/ @brief Find if this is a unique pointer\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\ttemplate<typename T>\n\t\t\tstruct IsUniquePointer : boost::mpl::bool_<false> {\n\t\t\t};\n\n\t\t\ttemplate<typename T>\n\t\t\tstruct IsUniquePointer<std::unique_ptr<T>> : boost::mpl::bool_<true> {\n\t\t\t};\n\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\t\/\/\/ @class IsSharedPointer\n\t\t\t\/\/\/ @brief Find if this is a shared pointer\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\ttemplate<typename T>\n\t\t\tstruct IsSharedPointer : boost::mpl::bool_<false> {\n\t\t\t};\n\n\t\t\ttemplate<typename T>\n\t\t\tstruct IsSharedPointer<std::shared_ptr<T>> : boost::mpl::bool_<true> {\n\t\t\t};\n\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\t\/\/\/ @class IsContainer\n\t\t\t\/\/\/ @brief True if the variable is a container type\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\ttemplate<typename T>\n\t\t\tstruct IsContainer : boost::mpl::bool_<false> {\n\t\t\t};\n\n\t\t\ttemplate<typename T>\n\t\t\tstruct IsContainer<std::vector<T>> : boost::mpl::bool_<true> {\n\t\t\t};\n\n\t\t\ttemplate<typename T>\n\t\t\tstruct IsContainer<std::list<T>> : boost::mpl::bool_<true> {\n\t\t\t};\n\n\t\t\ttemplate<typename T>\n\t\t\tstruct IsContainer<std::set<T>> : boost::mpl::bool_<true> {\n\t\t\t};\n\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\t\/\/\/ @fn getValue\n\t\t\t\/\/\/ @brief Get the value of a pointer\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\ttemplate<typename T>\n\t\t\tauto getValue(T const& a)->T& {\n\t\t\t\treturn a;\n\t\t\t}\n\n\t\t\t\/\/\/ @brief Consider a regular pointer as a shared pointer too\n\t\t\ttemplate<typename T>\n\t\t\tstruct IsSharedPointer<T*> : boost::mpl::bool_<true> {\n\t\t\t};\n\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\t\/\/\/ @class FindEnclosureTypeMeta\n\t\t\t\/\/\/ @brief Deducts the enclosing type\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\t\t\t\n\t\t\ttemplate<typename T>\n\t\t\tstruct FindEnclosureTypeMeta {\n\t\t\t\tstatic const EnclosureType = EnclosureType::kBaseType;\n\t\t\t};\n\n\t\t\ttemplate<typename T>\n\t\t\tstruct FindEnclosureTypeMeta<std::vector<T>> {\n\t\t\t\tstatic const EnclosureType = EnclosureType::kVector;\n\t\t\t};\n\n\t\t\ttemplate<typename T>\n\t\t\tstruct FindEnclosureTypeMeta<std::unique_ptr<T>> {\n\t\t\t\tstatic const EnclosureType = EnclosureType::kUniquePointer;\n\t\t\t};\n\n\t\t\ttemplate<typename T>\n\t\t\tstruct FindEnclosureTypeMeta<std::shared_ptr<T>> {\n\t\t\t\tstatic const EnclosureType = EnclosureType::kSharedPointer;\n\t\t\t};\n\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\t\/\/\/ @class TypeDetails\n\t\t\t\/\/\/ @brief Holds the type details \n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\tstruct TypeDetails {\n\t\t\t\tblib::bun::DbTypes type;\n\t\t\t\tEnclosureType enclouser_type;\n\t\t\t\tbool fundamental_type;\n\n\t\t\t\t\/\/\/ @fn TypeDetails\n\t\t\t\tTypeDetails(blib::bun::DbTypes in_type,\n\t\t\t\t\tEnclosureType in_enclouser_type,\n\t\t\t\t\tbool in_fundamental_type) :type(in_type),\n\t\t\t\t\tenclouser_type(in_enclouser_type),\n\t\t\t\t\tfundamental_type(in_fundamental_type) {}\n\t\t\t};\n\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\t\/\/\/ @class TypeMetaData\n\t\t\t\/\/\/ @brief Contains meta data that will be usieful to get type \n\t\t\t\/\/\/        inferences for a certain type.\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\ttemplate<typename T>\n\t\t\tstruct TypeMetaData {\n\t\t\t\tusing MT = boost::fusion::vector<void>;\n\t\t\t\tstatic std::string const& class_name();\n\t\t\t\tstatic std::map<std::string, TypeDetails> const& type_maps();\n\t\t\t};\n\n\t\t\ttemplate<typename T>\n\t\t\tstruct SqlHelper {\n\t\t\t\tstatic std::string const& createSchema() {\n\t\t\t\t\tstatic const std::string sql = _createSchema();\n\t\t\t\t\treturn sql;\n\t\t\t\t}\n\n\t\t\tprivate:\n\t\t\t\tstatic std::string _createSchema() {\n\t\t\t\t\tstd::string sql;\n\t\t\t\t\treturn sql;\n\t\t\t\t}\n\t\t\t};\n\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\t\/\/\/ @class PRefHelper\n\t\t\t\/\/\/ @brief Helper class for the persistent framework.\n\t\t\t\/\/\/        This class is specialized to persist objects.\n\t\t\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\t\ttemplate<typename T>\n\t\t\tstruct QueryHelper {\n\t\t\t\tstatic bool _ok;\n\t\t\t\tstatic std::string _create_table_sql;\n\t\t\t\tstatic std::string _delete_table_sql;\n\t\t\t\tstatic std::string _update_table_sql;\n\t\t\t\tstatic std::string _table_name;\n\n\t\t\t\tinline static void createSchema() {\n\t\t\t\t\t_table_name = TypeMetaData<T>::class_name();\n\t\t\t\t}\n\n\t\t\t\tinline static void createSchema(const std::string parent_table, const std::string table) {\n\n\t\t\t\t}\n\n\t\t\t\tinline static void deleteSchema();\n\n\t\t\t\tinline static SimpleOID persistObj(T *);\n\n\t\t\t\tinline static void updateObj(T *, SimpleOID const &);\n\n\t\t\t\tinline static void deleteObj(SimpleOID const &);\n\n\t\t\t\tinline static std::unique_ptr <T> getObj(SimpleOID const &);\n\n\t\t\t\tinline static std::string md5(T *, SimpleOID const &);\n\n\t\t\t\tinline static std::string objToString(T *, SimpleOID const &);\n\n\t\t\t\tinline static std::string objToJson(T *, SimpleOID const &);\n\t\t\t};\n\t\t}\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Helper Macros Start\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/\/ @brief SOCI ORM Helper Macros\n\/\/\/ @details from_base\n\/\/\/ @param ELEMS_TUP = (bun_name, sugar_quantity, flour_quantity, milk_quantity, yeast_quantity, butter_quantity, bun_length)\n#define EXPAND_MEMBER_ASSIGNENTS_from_base_I(z, n, ELEMS_TUP) c.BOOST_PP_TUPLE_ELEM(n, ELEMS_TUP) = v.get<blib::bun::__private::ConvertCPPTypeToSOCISupportType<decltype(c.BOOST_PP_TUPLE_ELEM(n, ELEMS_TUP))>::type>(BOOST_STRINGIZE(BOOST_PP_TUPLE_ELEM(n, ELEMS_TUP)));\n#define EXPAND_MEMBER_ASSIGNENTS_from_base(ELEMS_TUP) BOOST_PP_REPEAT(BOOST_PP_TUPLE_SIZE(ELEMS_TUP), EXPAND_MEMBER_ASSIGNENTS_from_base_I, ELEMS_TUP)\n\n\/\/\/ @details to_base\n\/\/\/ @param ELEMS_TUP = (bun_name, sugar_quantity, flour_quantity, milk_quantity, yeast_quantity, butter_quantity, bun_length)\n#define EXPAND_MEMBER_ASSIGNENTS_to_base_I(z, n, ELEMS_TUP) v.set(BOOST_STRINGIZE(BOOST_PP_TUPLE_ELEM(n, ELEMS_TUP)), blib::bun::__private::convertToSOCISupportedType(c.BOOST_PP_TUPLE_ELEM(n, ELEMS_TUP)));\n#define EXPAND_MEMBER_ASSIGNENTS_to_base(ELEMS_TUP) BOOST_PP_REPEAT(BOOST_PP_TUPLE_SIZE(ELEMS_TUP), EXPAND_MEMBER_ASSIGNENTS_to_base_I, ELEMS_TUP)\n\n\/\/\/ @details type_maps\n#define EXPAND_MEMBER_ASSIGNENTS_generate_type_maps_I(z, n, CLASS_ELEMS_TUP) {\\\nBOOST_STRINGIZE(BOOST_PP_TUPLE_ELEM(BOOST_PP_ADD(1, n), CLASS_ELEMS_TUP)), \\\nTypeDetails(\\\nblib::bun::CppTypeToDbType<FindEncloseeTypeMeta<BOOST_PP_TUPLE_ELEM(0, CLASS_ELEMS_TUP)::BOOST_PP_TUPLE_ELEM(BOOST_PP_ADD(1, n)>::type>::ret,\\\nFindEnclosureTypeMeta<BOOST_PP_TUPLE_ELEM(0, CLASS_ELEMS_TUP)::BOOST_PP_TUPLE_ELEM(BOOST_PP_ADD(1, n), CLASS_ELEMS_TUP)>::type,\\\nstd::is_fundamental<BOOST_PP_TUPLE_ELEM(0, CLASS_ELEMS_TUP)::BOOST_PP_TUPLE_ELEM(BOOST_PP_ADD(1, n)>::value\\\n)\\\n},\n#define EXPAND_MEMBER_ASSIGNENTS_generate_type_maps(CLASS_ELEMS_TUP) BOOST_PP_REPEAT(BOOST_PP_SUB(BOOST_PP_TUPLE_SIZE(CLASS_ELEMS_TUP), 1), EXPAND_MEMBER_ASSIGNENTS_generate_type_maps_I, CLASS_ELEMS_TUP)\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Helper Macros End\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/\/ SPECIALIZE_BUN_HELPER Start\n#define SPECIALIZE_BUN_HELPER(CLASS_ELEMS_TUP) BOOST_FUSION_ADAPT_STRUCT(\\\nBOOST_PP_TUPLE_REM_CTOR(CLASS_ELEMS_TUP)\\\n)\\\nnamespace blib{namespace bun{\\\ntemplate<>\\\nBLIB_MACRO_COMMENTS_IF(\"@brief Lets everyone know that this is a persistant class\");\\\nstruct IsPersistant<BOOST_PP_TUPLE_ELEM(0, CLASS_ELEMS_TUP)> : boost::mpl::bool_<true> {\\\n};\\\nBLIB_MACRO_COMMENTS_IF(\"@brief Mark the class as composite\");\\\ntemplate<>\\\nstruct CppTypeToDbType<BOOST_PP_TUPLE_ELEM(0, CLASS_ELEMS_TUP)>{\\\nstatic const DbTypes ret = DbTypes::kComposite;\\\n};\\\n}\\\nnamespace blib{namespace bun{namespace __private{\\\ntemplate<>\\\nTypeMetaData<BOOST_PP_TUPLE_ELEM(0, CLASS_ELEMS_TUP)>{\\\nusing T=BOOST_PP_TUPLE_ELEM(0, CLASS_ELEMS_TUP);\\\nstatic std::string const& class_name(){\\\nstatic std::string const class_name = BOOST_STRINGIZE(BOOST_PP_TUPLE_ELEM(0, CLASS_ELEMS_TUP));\\\nreturn class_name;\\\n}\\\nstatic std::map<std::string, TypeDetails> const& type_maps(){\\\nstatic const std::map<std::string, TypeDetails> type_map = {\\\nEXPAND_MEMBER_ASSIGNENTS_generate_type_maps(CLASS_ELEMS_TUP);\\\n};\\\nreturn type_map;\\\n}\\\n};\\\n}}}\\\nnamespace soci{\\\nBLIB_MACRO_COMMENTS_IF(\"@brief --Specialization for SOCI ORM Start---\");\\\ntemplate<>\\\nstruct type_conversion<BOOST_PP_TUPLE_ELEM(0, CLASS_ELEMS_TUP)>{\\\ntypedef values base_type;\\\nusing ClassType = BOOST_PP_TUPLE_ELEM(0, CLASS_ELEMS_TUP);\\\ninline static void from_base(values const& v, indicator ind, ClassType& c){\\\nBLIB_MACRO_COMMENTS_IF(\"@brief from_base gets the values from db\");\\\nEXPAND_MEMBER_ASSIGNENTS_from_base(BOOST_PP_TUPLE_POP_FRONT( CLASS_ELEMS_TUP ));\\\n}\\\ninline static void to_base(const ClassType& c, values& v, indicator& ind){\\\nBLIB_MACRO_COMMENTS_IF(\"@brief to_base puts the values to db\");\\\nEXPAND_MEMBER_ASSIGNENTS_to_base(BOOST_PP_TUPLE_POP_FRONT( CLASS_ELEMS_TUP ));\\\n}\\\n};\\\n}\\\n\/\/\/ SPECIALIZE_BUN_HELPER End\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2013 Patrick Huck\n#include \"src\/cmdline\/cmdline.h\"\n#include <boost\/filesystem\/fstream.hpp>\n#include <boost\/iostreams\/stream.hpp>\n#include <boost\/iostreams\/tee.hpp>\n#include \"src\/clean\/clean.h\"\n#include \"src\/aux\/utils.h\"\n\nusing std::cout;\nusing std::endl;\nusing std::ostream;\nnamespace io = boost::iostreams;\nnamespace fs = boost::filesystem;\n\ntypedef io::tee_device<ostream, fs::ofstream> Tee;\ntypedef io::stream<Tee> TeeStream;\n\ncmdline::cmdline()\n: ckon_cmd(\"\"), nCpu(\"1\"), ckon_config_file(\"ckon.cfg\"), ckon_src_dir(\"StRoot\"),\n  ckon_obsolete_dir(\"Obsolete\"), ckon_exclSuffix(\"Gnuplot Options\"),\n  ckon_DontScan(\"dat-files database\"), ckon_NoRootCint(\"YamlCpp\"),\n  ckon_prog_subdir(\"programs\"), ckon_macro_subdir(\"macros\"),\n  ckon_build_dir(\"build\"), ckon_install_dir(\"build\")\n{ }\n\nvoid cmdline::purge() {\n  clean clcont(ckon_src_dir);\n  printf(\"%d files removed.\\n\", clcont.purge());\n}\n\nvoid cmdline::runSetup() {\n  if ( fs::exists(ckon_config_file) || fs::exists(\"configure.ac\") ) {\n    cout << ckon_config_file << \" or configure.ac already exist(s)!\" << endl;\n    if ( utils::askYesOrNo(\"remove and start over\") == 'n' ) return;\n    fs::remove(ckon_config_file);\n    fs::remove(\"configure.ac\");\n    fs::remove(\".autom4te.cfg\");\n  }\n\n  cout << \"write cfgfile\" << endl;\n\n  fs::ofstream cfgfile(ckon_config_file);\n  Tee tee(cout, cfgfile);\n  TeeStream both(tee);\n  both << \"pythia=\" << bPythia << endl;\n  both << \"roofit=\" << bRooFit << endl;\n  both << \"boost=\" << bBoost << endl;\n  both << \"suffix=\" << bSuffix << endl;\n  both << \"[ckon]\" << endl;\n  both << \"src_dir=\" << ckon_src_dir << endl;\n  both << \"obsolete_dir=\" << ckon_obsolete_dir << endl;\n  both << \"prog_subdir=\" << ckon_prog_subdir << endl;\n  both << \"macro_subdir=\" << ckon_macro_subdir << endl;\n  both << \"build_dir=\" << ckon_build_dir << endl;\n  both << \"install_dir=\" << ckon_install_dir << endl;\n  both << \"exclSuffix=\\\"\" << ckon_exclSuffix << \"\\\"\" << endl;\n  both << \"DontScan=\\\"\" << ckon_DontScan << \"\\\"\" << endl;\n  both << \"NoRootCint=\" << ckon_NoRootCint << endl;\n  both.close();\n\n  writeConfigureAc();\n  writeAutom4teCfg();\n\n  cout << endl << \"setup done. check \" << ckon_config_file << endl;\n}\n\nbool cmdline::parse(int argc, char *argv[]) {\n  po::options_description generic(\"Generic Options\");\n  generic.add_options()\n    (\"help,h\", po::bool_switch(&bHelp), \"show this help\")\n    (\"verbose,v\", po::bool_switch(&bVerbose), \"verbose output\")\n    (\",j\", po::value<string>(&nCpu), \"call make with option -j <#cores>\")\n    (\"ckon_cmd\", po::value<string>(&ckon_cmd), \"setup | clean | install\");\n\n  po::options_description config(\"Configuration\");\n  config.add_options()\n    (\"pythia,p\", po::value<bool>(&bPythia), \"link with pythia library\")\n    (\"roofit,r\", po::value<bool>(&bRooFit), \"link with roofit library\")\n    (\"suffix,s\", po::value<bool>(&bSuffix), \"Add suffix + in LinkDef file\")\n    (\"boost,b\", po::value<bool>(&bBoost), \"include BOOST_INC and BOOST_LIB\")\n    (\"ckon.config_file\", po::value<string>(&ckon_config_file), \"config file\")\n    (\"ckon.src_dir\", po::value<string>(&ckon_src_dir), \"source dir\")\n    (\"ckon.obsolete_dir\", po::value<string>(&ckon_obsolete_dir), \"obsolete dir\")\n    (\"ckon.exclSuffix\", po::value<string>(&ckon_exclSuffix), \"no + suffix\")\n    (\"ckon.DontScan\", po::value<string>(&ckon_DontScan), \"no source scan\")\n    (\"ckon.NoRootCint\", po::value<string>(&ckon_NoRootCint), \"no dictionary\")\n    (\"ckon.prog_subdir\", po::value<string>(&ckon_prog_subdir), \"progs subdir\")\n    (\"ckon.macro_subdir\", po::value<string>(&ckon_macro_subdir), \"macro subdir\")\n    (\"ckon.build_dir\", po::value<string>(&ckon_build_dir), \"build dir\")\n    (\"ckon.install_dir\", po::value<string>(&ckon_install_dir), \"install dir\");\n\n  po::options_description allopts;\n  allopts.add(generic).add(config);\n\n  po::positional_options_description posOpts;\n  posOpts.add(\"ckon_cmd\", 1);\n\n  po::variables_map vm;\n\n  try {\n    po::store(\n        po::command_line_parser(argc, argv)\n        .options(allopts).positional(posOpts).run(), vm);\n    if ( fs::exists(ckon_config_file) ) {\n      po::store(\n          po::parse_config_file<char>(ckon_config_file.c_str(), config), vm);\n    }\n\n    po::notify(vm);  \/\/ throws on error\n\n    if ( bHelp ) {  \/\/ --help option\n      cout << \"ckon -- automatic ROOT analyses compiler & linker\" << endl;\n      cout << allopts << endl;\n      return false;\n    }\n\n    bSetup = !ckon_cmd.compare(\"setup\");\n    bClean = !ckon_cmd.compare(\"clean\");\n    bInstall = !ckon_cmd.compare(\"install\");\n\n    if ( bSetup ) { cout << \"run setup\" << endl; runSetup(); return false; }\n    if ( bClean ) { purge(); return false; }\n\n    return true;\n  }\n  catch(const po::error& e) {\n    std::cerr << \"ERROR: \" << e.what() << endl << endl << generic << endl;\n    return false;\n  }\n}\n\nvoid cmdline::writeConfigureAc() {\n  string cfg_ac_str = \"AC_INIT([ana], [0.0])\\n\";\n  cfg_ac_str += \"m4_ifdef([AM_SILENT_RULES], [AM_SILENT_RULES([yes])])\\n\";\n  cfg_ac_str += \"AC_CONFIG_AUX_DIR(config)\\n\";\n  cfg_ac_str += \"m4_pattern_allow([AM_PROG_AR])\\n\";\n  cfg_ac_str += \"m4_ifdef([AM_PROG_AR], [AM_PROG_AR])\\n\";\n  cfg_ac_str += \"AM_INIT_AUTOMAKE([-Wall no-define])\\n\";\n  cfg_ac_str += \"AC_PROG_CXX\\n\";\n  cfg_ac_str += \"AM_PROG_LIBTOOL\\n\";\n  cfg_ac_str += \"ROOTLIBS=`$ROOTSYS\/bin\/root-config --libs`\\n\";\n  cfg_ac_str += \"ROOTINCLUDES=`$ROOTSYS\/bin\/root-config --incdir`\\n\";\n  cfg_ac_str += \"ROOTLIBDIR=`$ROOTSYS\/bin\/root-config --libdir`\\n\";\n  cfg_ac_str += \"ROOTGLIBS=`$ROOTSYS\/bin\/root-config --glibs`\\n\";\n  cfg_ac_str += \"AC_SUBST(ROOTLIBS)\\n\";\n  cfg_ac_str += \"AC_SUBST(ROOTINCLUDES)\\n\";\n  cfg_ac_str += \"AC_SUBST(ROOTGLIBS)\\n\";\n  cfg_ac_str += \"AC_SUBST(ROOTLIBDIR)\\n\";\n  cfg_ac_str += \"AC_CONFIG_FILES([Makefile])\\n\";\n  cfg_ac_str += \"AC_OUTPUT\\n\";\n  fs::ofstream cfg_ac;\n  cfg_ac.open(\"configure.ac\");\n  cfg_ac << cfg_ac_str;\n  cfg_ac.close();\n}\n\nvoid cmdline::writeAutom4teCfg() {\n  string atmte_str = \"begin-language: \\\"Autoconf-without-aclocal-m4\\\"\\n\";\n  atmte_str += \"args: --no-cache\\n\";\n  atmte_str += \"end-language: \\\"Autoconf-without-aclocal-m4\\\"\\n\";\n  fs::ofstream atmte;\n  atmte.open(\".autom4te.cfg\");\n  atmte << atmte_str;\n  atmte.close();\n}\n\n<commit_msg>update help for bool args<commit_after>\/\/ Copyright (c) 2013 Patrick Huck\n#include \"src\/cmdline\/cmdline.h\"\n#include <boost\/filesystem\/fstream.hpp>\n#include <boost\/iostreams\/stream.hpp>\n#include <boost\/iostreams\/tee.hpp>\n#include \"src\/clean\/clean.h\"\n#include \"src\/aux\/utils.h\"\n\nusing std::cout;\nusing std::endl;\nusing std::ostream;\nnamespace io = boost::iostreams;\nnamespace fs = boost::filesystem;\n\ntypedef io::tee_device<ostream, fs::ofstream> Tee;\ntypedef io::stream<Tee> TeeStream;\n\ncmdline::cmdline()\n: ckon_cmd(\"\"), nCpu(\"1\"), ckon_config_file(\"ckon.cfg\"), ckon_src_dir(\"StRoot\"),\n  ckon_obsolete_dir(\"Obsolete\"), ckon_exclSuffix(\"Gnuplot Options\"),\n  ckon_DontScan(\"dat-files database\"), ckon_NoRootCint(\"YamlCpp\"),\n  ckon_prog_subdir(\"programs\"), ckon_macro_subdir(\"macros\"),\n  ckon_build_dir(\"build\"), ckon_install_dir(\"build\")\n{ }\n\nvoid cmdline::purge() {\n  clean clcont(ckon_src_dir);\n  printf(\"%d files removed.\\n\", clcont.purge());\n}\n\nvoid cmdline::runSetup() {\n  if ( fs::exists(ckon_config_file) || fs::exists(\"configure.ac\") ) {\n    cout << ckon_config_file << \" or configure.ac already exist(s)!\" << endl;\n    if ( utils::askYesOrNo(\"remove and start over\") == 'n' ) return;\n    fs::remove(ckon_config_file);\n    fs::remove(\"configure.ac\");\n    fs::remove(\".autom4te.cfg\");\n  }\n\n  cout << \"write cfgfile\" << endl;\n\n  fs::ofstream cfgfile(ckon_config_file);\n  Tee tee(cout, cfgfile);\n  TeeStream both(tee);\n  both << \"pythia=\" << bPythia << endl;\n  both << \"roofit=\" << bRooFit << endl;\n  both << \"boost=\" << bBoost << endl;\n  both << \"suffix=\" << bSuffix << endl;\n  both << \"[ckon]\" << endl;\n  both << \"src_dir=\" << ckon_src_dir << endl;\n  both << \"obsolete_dir=\" << ckon_obsolete_dir << endl;\n  both << \"prog_subdir=\" << ckon_prog_subdir << endl;\n  both << \"macro_subdir=\" << ckon_macro_subdir << endl;\n  both << \"build_dir=\" << ckon_build_dir << endl;\n  both << \"install_dir=\" << ckon_install_dir << endl;\n  both << \"exclSuffix=\\\"\" << ckon_exclSuffix << \"\\\"\" << endl;\n  both << \"DontScan=\\\"\" << ckon_DontScan << \"\\\"\" << endl;\n  both << \"NoRootCint=\" << ckon_NoRootCint << endl;\n  both.close();\n\n  writeConfigureAc();\n  writeAutom4teCfg();\n\n  cout << endl << \"setup done. check \" << ckon_config_file << endl;\n}\n\nbool cmdline::parse(int argc, char *argv[]) {\n  po::options_description generic(\"Generic Options\");\n  generic.add_options()\n    (\"help,h\", po::bool_switch(&bHelp), \"show this help\")\n    (\"verbose,v\", po::bool_switch(&bVerbose), \"verbose output\")\n    (\",j\", po::value<string>(&nCpu), \"call make with option -j <#cores>\")\n    (\"ckon_cmd\", po::value<string>(&ckon_cmd), \"setup | clean | install\");\n\n  po::options_description config(\"Configuration\");\n  config.add_options()\n    (\"pythia,p\", po::value<bool>(&bPythia), \"link with pythia library (bool)\")\n    (\"roofit,r\", po::value<bool>(&bRooFit), \"link with roofit library (bool)\")\n    (\"suffix,s\", po::value<bool>(&bSuffix), \"Add suffix + in LinkDef file (bool)\")\n    (\"boost,b\", po::value<bool>(&bBoost), \"include BOOST_INC and BOOST_LIB (bool)\")\n    (\"ckon.config_file\", po::value<string>(&ckon_config_file), \"config file\")\n    (\"ckon.src_dir\", po::value<string>(&ckon_src_dir), \"source dir\")\n    (\"ckon.obsolete_dir\", po::value<string>(&ckon_obsolete_dir), \"obsolete dir\")\n    (\"ckon.exclSuffix\", po::value<string>(&ckon_exclSuffix), \"no + suffix\")\n    (\"ckon.DontScan\", po::value<string>(&ckon_DontScan), \"no source scan\")\n    (\"ckon.NoRootCint\", po::value<string>(&ckon_NoRootCint), \"no dictionary\")\n    (\"ckon.prog_subdir\", po::value<string>(&ckon_prog_subdir), \"progs subdir\")\n    (\"ckon.macro_subdir\", po::value<string>(&ckon_macro_subdir), \"macro subdir\")\n    (\"ckon.build_dir\", po::value<string>(&ckon_build_dir), \"build dir\")\n    (\"ckon.install_dir\", po::value<string>(&ckon_install_dir), \"install dir\");\n\n  po::options_description allopts;\n  allopts.add(generic).add(config);\n\n  po::positional_options_description posOpts;\n  posOpts.add(\"ckon_cmd\", 1);\n\n  po::variables_map vm;\n\n  try {\n    po::store(\n        po::command_line_parser(argc, argv)\n        .options(allopts).positional(posOpts).run(), vm);\n    if ( fs::exists(ckon_config_file) ) {\n      po::store(\n          po::parse_config_file<char>(ckon_config_file.c_str(), config), vm);\n    }\n\n    po::notify(vm);  \/\/ throws on error\n\n    if ( bHelp ) {  \/\/ --help option\n      cout << \"ckon -- automatic ROOT analyses compiler & linker\" << endl;\n      cout << allopts << endl;\n      return false;\n    }\n\n    bSetup = !ckon_cmd.compare(\"setup\");\n    bClean = !ckon_cmd.compare(\"clean\");\n    bInstall = !ckon_cmd.compare(\"install\");\n\n    if ( bSetup ) { cout << \"run setup\" << endl; runSetup(); return false; }\n    if ( bClean ) { purge(); return false; }\n\n    return true;\n  }\n  catch(const po::error& e) {\n    std::cerr << \"ERROR: \" << e.what() << endl << endl << generic << endl;\n    return false;\n  }\n}\n\nvoid cmdline::writeConfigureAc() {\n  string cfg_ac_str = \"AC_INIT([ana], [0.0])\\n\";\n  cfg_ac_str += \"m4_ifdef([AM_SILENT_RULES], [AM_SILENT_RULES([yes])])\\n\";\n  cfg_ac_str += \"AC_CONFIG_AUX_DIR(config)\\n\";\n  cfg_ac_str += \"m4_pattern_allow([AM_PROG_AR])\\n\";\n  cfg_ac_str += \"m4_ifdef([AM_PROG_AR], [AM_PROG_AR])\\n\";\n  cfg_ac_str += \"AM_INIT_AUTOMAKE([-Wall no-define])\\n\";\n  cfg_ac_str += \"AC_PROG_CXX\\n\";\n  cfg_ac_str += \"AM_PROG_LIBTOOL\\n\";\n  cfg_ac_str += \"ROOTLIBS=`$ROOTSYS\/bin\/root-config --libs`\\n\";\n  cfg_ac_str += \"ROOTINCLUDES=`$ROOTSYS\/bin\/root-config --incdir`\\n\";\n  cfg_ac_str += \"ROOTLIBDIR=`$ROOTSYS\/bin\/root-config --libdir`\\n\";\n  cfg_ac_str += \"ROOTGLIBS=`$ROOTSYS\/bin\/root-config --glibs`\\n\";\n  cfg_ac_str += \"AC_SUBST(ROOTLIBS)\\n\";\n  cfg_ac_str += \"AC_SUBST(ROOTINCLUDES)\\n\";\n  cfg_ac_str += \"AC_SUBST(ROOTGLIBS)\\n\";\n  cfg_ac_str += \"AC_SUBST(ROOTLIBDIR)\\n\";\n  cfg_ac_str += \"AC_CONFIG_FILES([Makefile])\\n\";\n  cfg_ac_str += \"AC_OUTPUT\\n\";\n  fs::ofstream cfg_ac;\n  cfg_ac.open(\"configure.ac\");\n  cfg_ac << cfg_ac_str;\n  cfg_ac.close();\n}\n\nvoid cmdline::writeAutom4teCfg() {\n  string atmte_str = \"begin-language: \\\"Autoconf-without-aclocal-m4\\\"\\n\";\n  atmte_str += \"args: --no-cache\\n\";\n  atmte_str += \"end-language: \\\"Autoconf-without-aclocal-m4\\\"\\n\";\n  fs::ofstream atmte;\n  atmte.open(\".autom4te.cfg\");\n  atmte << atmte_str;\n  atmte.close();\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file\n * @author  Mamadou Babaei <info@babaei.net>\n * @version 0.1.0\n *\n * @section LICENSE\n *\n * (The MIT License)\n *\n * Copyright (c) 2016 - 2019 Mamadou Babaei\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *\n * @section DESCRIPTION\n *\n * Provides common filing and filesystem operations.\n *\/\n\n\n#ifndef CORELIB_FILESYSTEM_HPP\n#define CORELIB_FILESYSTEM_HPP\n\n\n#include <string>\n\nnamespace CoreLib {\nclass FileSystem;\n}\n\nclass CoreLib::FileSystem\n{\npublic:\n    static bool DirExists(const std::string &dir);\n    static bool FileExists(const std::string &file);\n    static std::size_t FileSize(const std::string &file);\n\n    static bool CreateDir(const std::string &dir, const bool parents = true);\n    static bool Erase(const std::string &path, const bool recursive = true);\n    static bool Move(const std::string &from, const std::string &to);\n    static bool CopyFile(const std::string &from, const std::string &to, const bool overwrite = true);\n\n    static bool Read(const std::string &file, std::string &out_data);\n    static bool Write(const std::string &file, const std::string &data);\n};\n\n\n#endif \/* CORELIB_FILESYSTEM_HPP *\/\n<commit_msg>add a create temp dir function<commit_after>\/**\n * @file\n * @author  Mamadou Babaei <info@babaei.net>\n * @version 0.1.0\n *\n * @section LICENSE\n *\n * (The MIT License)\n *\n * Copyright (c) 2016 - 2019 Mamadou Babaei\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *\n * @section DESCRIPTION\n *\n * Provides common filing and filesystem operations.\n *\/\n\n\n#ifndef CORELIB_FILESYSTEM_HPP\n#define CORELIB_FILESYSTEM_HPP\n\n\n#include <string>\n#include <cstdlib>\n#include \"Defines.hpp\"\n\nnamespace CoreLib {\nclass FileSystem;\n}\n\nclass CoreLib::FileSystem\n{\npublic:\n    static bool DirExists(const std::string &dir);\n    static bool FileExists(const std::string &file);\n    static std::size_t FileSize(const std::string &file);\n\n    static bool CreateDir(const std::string &dir, const bool parents = true);\n    static bool Erase(const std::string &path, const bool recursive = true);\n    static bool Move(const std::string &from, const std::string &to);\n    static bool CopyFile(const std::string &from, const std::string &to, const bool overwrite = true);\n\n    static bool Read(const std::string &file, std::string &out_data);\n    static bool Write(const std::string &file, const std::string &data);\n\n    FORCEINLINE static std::string CreateTempDir()\n    {\n        char pattern[] = \"\/tmp\/XXXXXXXX\";\n        return mkdtemp(pattern);\n    }\n};\n\n\n#endif \/* CORELIB_FILESYSTEM_HPP *\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"Vector3.h\"\n\ninline bool Sapphire::Common::FFXIVARR_POSITION3::operator == ( const FFXIVARR_POSITION3 & target ) const\n{\n    return ( this->x == target.x && this->y == target.y && this->z == target.z );\n}\n<commit_msg>using memcmp instead of comparing each float<commit_after>#include <vector>\n\n#include \"Vector3.h\"\n\ninline bool Sapphire::Common::FFXIVARR_POSITION3::operator == ( const FFXIVARR_POSITION3& target ) const\n{\n  return !memcmp( this, &target, sizeof( FFXIVARR_POSITION3 ) );\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef CLPP_CONTEXT_H\n\t#error \"Do not include this file directly.\"\n#endif\n\nnamespace cl {\n\t\/\/================================================================================\n\t\/\/ Basic Constructors and Copy-Assignment\n\t\/\/================================================================================\n\n\tContext::Context():\n\t\tdetail::Wrapper<Device::cl_type>{}\n\t{}\n\n\tContext::Context(Context::cl_type context):\n\t\tm_object{device}\n\t{}\n\n\tContext::Context(const Context & context):\n\t\tdetail::Wrapper<cl_type>{device}\n\t{}\n\n\n\tContext& Context::operator=(const Context & rhs) {\n        if (this != &rhs) {\n            detail::Wrapper<cl_type>::operator=(rhs);\n        }\n        return *this;\n\t}\n\n\n\t\/\/================================================================================\n\t\/\/ Special Constructors\n\t\/\/================================================================================\n\n\ttemplate<typename Function, typename T>\n\tContext::Context(\n\t\tContextProperties const& properties,\n\t\tstd::vector<Device> const& devices,\n\t\tFunction callback,\n\t\tT* user_data\n\t){\n\t\t\/\/ TODO\n\t}\n\n\tContext::Context(\n\t\tContextProperties const& properties,\n\t\tstd::vector<Device> const& devices\n\t){\n\t\t\/\/ TODO\n\t}\n\n\ttemplate<typename Function, typename T>\n\tContext::Context(\n\t\tContextProperties const& properties,\n\t\tDeviceType type,\n\t\tFunction callback,\n\t\tT* user_data\n\t){\n\t\t\/\/ TODO\n\t}\n\n\tContext::Context(\n\t\tContextProperties const& properties,\n\t\tDeviceType type\n\t){\n\t\t\/\/ TODO\n\t}\n\n\t\/\/================================================================================\n\t\/\/ Information access helper methods.\n\t\/\/================================================================================\n\n\tauto Context::getReferenceCount() const -> cl_uint {\n\t\treturn getInfo<cl_uint>(CL_CONTEXT_REFERENCE_COUNT);\n\t}\n\n\tauto Context::getNumDevices() const -> cl_uint {\n\t\treturn getInfo<cl_uint>(CL_CONTEXT_NUM_DEVICES);\n\t}\n\n\tauto Context::getDevices() const -> std::vector<Device> {\n\t\tconst auto device_ids = getInfoVector<cl_device_id>(CL_CONTEXT_DEVICES);\n\t\t      auto devices    = std::vector<Device>{};\t\n\t\tfor (auto&& device_id : device_ids) {\n\t\t\tdevices.emplace_back(device_id);\n\t\t}\n\t\treturn devices;\n\t}\n\n\tauto Context::getProperties() const -> ContextProperties {\n\t\treturn {getInfo<cl_context_properties[]>(CL_CONTEXT_PROPERTIES)};\n\t}\n\n}\n<commit_msg>finalized implementation for context<commit_after>#ifndef CLPP_CONTEXT_H\n\t#error \"Do not include this file directly.\"\n#endif\n\nnamespace cl {\n\t\/\/====================================================================================\n\t\/\/ Basic Constructors and Copy-Assignment\n\t\/\/====================================================================================\n\n\tContext::Context():\n\t\tdetail::Wrapper<Device::cl_type>{}\n\t{}\n\n\tContext::Context(Context::cl_type context):\n\t\tm_object{device}\n\t{}\n\n\tContext::Context(const Context & context):\n\t\tdetail::Wrapper<cl_type>{device}\n\t{}\n\n\n\tContext& Context::operator=(const Context & rhs) {\n        if (this != &rhs) {\n            detail::Wrapper<cl_type>::operator=(rhs);\n        }\n        return *this;\n\t}\n\n\n\t\/\/====================================================================================\n\t\/\/ Special Constructors\n\t\/\/====================================================================================\n\n\ttemplate<typename Function, typename T>\n\tContext::Context(\n\t\tContextProperties const& properties,\n\t\tstd::vector<Device> const& devices,\n\t\tFunction callback,\n\t\tT* user_data\n\t){\n\t\tstruct callback_data {\n\t\t\tFunction callback;\n\t\t\tT* user_data;\n\t\t};\n\t\tauto cbWrapper = new callback_data{callback, user_data};\n\t\tauto ids       = std::vector<cl_device_id>{};\n\t\tids.reserve(devices.size());\n\t\tstd::transform(devices.cbegin(), devices.cend(), ids.begin(),\n\t\t\t[](auto device) {\n\t\t\t\treturn device.get();\n\t\t\t});\t\t\n\t\tauto error  = cl_int{CL_INVALID_VALUE};\n\t\tauto contex = clCreateContext(\n\t\t\tproperties.data().data(),\n\t\t\tids.size(), ids.data(),\n\t\t\t[](\n\t\t\t\tconst char * error_info,\n\t\t\t\tconst void * private_info,\n\t\t\t\tsize_t cb,\n\t\t\t\tvoid * user_data\n\t\t\t) {\n\t\t\t\tauto temp = reinterpret_cast<callback_data*>(user_data);\n\t\t\t\tauto errorString = std::string{error_info};\n\t\t\t\tauto privateData = std::vector{\n\t\t\t\t\treinterpret_cast<const char*>(private_info),\n\t\t\t\t\treinterpret_cast<const char*>(private_info) + cb};\n\t\t\t\tauto userData    = temp->user_data;\n\t\t\t\tdelete temp; \/\/ call delete before calling user's callback\n\t\t\t\t             \/\/ to ensure that data is freed even if the user's\n\t\t\t\t             \/\/ callback throws an exception.\n\t\t\t\ttemp->callback(errorString, privateData, userData);\n\t\t\t},\n\t\t\tstd::addressof(cbWrapper),\n\t\t\tstd::addressof(error)\n\t\t);\n\t\tif (detail::error::handle<exception_type>(error)) {\n\t\t\tm_id = contex;\n\t\t}\n\t}\n\n\tContext::Context(\n\t\tContextProperties const& properties,\n\t\tstd::vector<Device> const& devices\n\t){\n\t\tauto ids = std::vector<cl_device_id>{};\n\t\tids.reserve(devices.size());\n\t\tstd::transform(devices.cbegin(), devices.cend(), ids.begin(),\n\t\t\t[](auto device) {\n\t\t\t\treturn device.get();\n\t\t\t});\n\t\tauto error  = cl_int{CL_INVALID_VALUE};\n\t\tauto contex = clCreateContext(\n\t\t\tproperties.data().data(),\n\t\t\tids.size(), ids.data(),\n\t\t\tnullptr, nullptr,\n\t\t\tstd::addressof(error)\n\t\t);\n\t\tif (detail::error::handle<exception_type>(error)) {\n\t\t\tm_id = contex;\n\t\t}\n\t}\n\n\ttemplate<typename Function, typename T>\n\tContext::Context(\n\t\tContextProperties const& properties,\n\t\tDeviceType type,\n\t\tFunction callback,\n\t\tT* user_data\n\t){\n\t\tstruct callback_data {\n\t\t\tFunction callback;\n\t\t\tT* user_data;\n\t\t};\n\t\tauto cbWrapper = new callback_data{callback, user_data};\n\t\tauto error  = cl_int{CL_INVALID_VALUE};\n\t\tauto contex = clCreateContextFromType(\n\t\t\tproperties.data().data(),\n\t\t\tstatic_cast<std::underlying_type<DeviceType>::type>(type),\n\t\t\t[](\n\t\t\t\tconst char * error_info,\n\t\t\t\tconst void * private_info,\n\t\t\t\tsize_t cb,\n\t\t\t\tvoid * user_data\n\t\t\t) {\n\t\t\t\tauto temp = reinterpret_cast<callback_data*>(user_data);\n\t\t\t\tauto errorString = std::string{error_info};\n\t\t\t\tauto privateData = std::vector{\n\t\t\t\t\treinterpret_cast<const char*>(private_info),\n\t\t\t\t\treinterpret_cast<const char*>(private_info) + cb};\n\t\t\t\tauto userData    = temp->user_data;\n\t\t\t\tdelete temp; \/\/ call delete before calling user's callback\n\t\t\t\t             \/\/ to ensure that data is freed even if the user's\n\t\t\t\t             \/\/ callback throws an exception.\n\t\t\t\ttemp->callback(errorString, privateData, userData);\n\t\t\t},\n\t\t\tstd::addressof(cbWrapper),\n\t\t\tstd::addressof(error)\n\t\t);\n\t\tif (detail::error::handle<exception_type>(error)) {\n\t\t\tm_id = contex;\n\t\t}\n\t}\n\n\tContext::Context(\n\t\tContextProperties const& properties,\n\t\tDeviceType type\n\t){\n\t\tauto error  = cl_int{CL_INVALID_VALUE};\n\t\tauto contex = clCreateContextFromType(\n\t\t\tproperties.data().data(),\n\t\t\tstatic_cast<std::underlying_type<DeviceType>::type>(type),\n\t\t\tnullptr, nullptr,\n\t\t\tstd::addressof(error)\n\t\t);\n\t\tif (detail::error::handle<exception_type>(error)) {\n\t\t\tm_id = contex;\n\t\t}\n\t}\n\n\t\/\/====================================================================================\n\t\/\/ Information access helper methods.\n\t\/\/====================================================================================\n\n\tauto Context::getReferenceCount() const -> cl_uint {\n\t\treturn getInfo<cl_uint>(CL_CONTEXT_REFERENCE_COUNT);\n\t}\n\n\tauto Context::getNumDevices() const -> cl_uint {\n\t\treturn getInfo<cl_uint>(CL_CONTEXT_NUM_DEVICES);\n\t}\n\n\tauto Context::getDevices() const -> std::vector<Device> {\n\t\tconst auto device_ids = getInfoVector<cl_device_id>(CL_CONTEXT_DEVICES);\n\t\t      auto devices    = std::vector<Device>{};\t\n\t\tfor (auto&& device_id : device_ids) {\n\t\t\tdevices.emplace_back(device_id);\n\t\t}\n\t\treturn devices;\n\t}\n\n\tauto Context::getProperties() const -> ContextProperties {\n\t\treturn {getInfo<cl_context_properties[]>(CL_CONTEXT_PROPERTIES)};\n\t}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2012 - 2013 Jolla Ltd.\n** Contact: http:\/\/jolla.com\/\n**\n** This file is part of Qt Creator.\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** 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 Digia.\n**\n****************************************************************************\/\n\n#include \"merdevicexmlparser.h\"\n\n#include <utils\/fileutils.h>\n\n#include <QAbstractMessageHandler>\n#include <QAbstractXmlReceiver>\n#include <QXmlSchema>\n#include <QXmlSchemaValidator>\n#include <QXmlQuery>\n#include <QXmlStreamWriter>\n#include <QStack>\n#include <QFileInfo>\n\n\/\/Parser for:\n\/\/https:\/\/wiki.merproject.org\/wiki\/SDK_on_VirtualBox\/Design\n\n\/\/<devices>\n\/\/ <engine name=\"Mer SDK\" type=\"vbox\">\n\/\/  <subnet>10.220.220<\/subnet\n\/\/ <\/engine>\n\/\/ <device name=\"Nemo N9\" type=\"real\">\n\/\/  <ip>192.168.0.12<\/ip>\n\/\/  <sshkeypath><\/sshkeypath>\n\/\/ <\/device>\n\/\/ <device name=\"SailfishOS Emulator\" type=\"vbox\">\n\/\/  <index>2<\/index>\n\/\/  <subnet>10.220.220<\/subnet>\n\/\/  <sshkeypath><\/sshkeypath>\n\/\/  <mac>08:00:27:7C:A1:AF<\/mac>\n\/\/ <\/device>\n\/\/<\/devices>\n\nconst char DEVICE[] = \"device\";\nconst char DEVICES[] = \"devices\";\nconst char NAME[] = \"name\";\nconst char TYPE[] = \"type\";\nconst char ENGINE[] = \"engine\";\nconst char IP[] = \"ip\";\nconst char SSH_PATH[] = \"sshkeypath\";\nconst char SUBNET[] = \"subnet\";\nconst char MAC[] = \"mac\";\nconst char INDEX[] = \"index\";\n\nnamespace Mer {\n\nnamespace {\n\nclass MessageHandler : public QAbstractMessageHandler\n{\npublic:\n    QString errorString() const\n    {\n        return QObject::tr(\"Error %1:%2:%3 %4\").arg(m_identifier.toString())\n                .arg(m_sourceLocation.line())\n                .arg(m_sourceLocation.column())\n                .arg(m_description);\n    }\n\nprotected:\n    virtual void handleMessage(QtMsgType \/*type*\/, const QString &description,\n                               const QUrl &identifier, const QSourceLocation &sourceLocation)\n    {\n        m_description = description;\n        m_identifier = identifier;\n        m_sourceLocation = sourceLocation;\n    }\n\nprivate:\n    QString m_description;\n    QSourceLocation m_sourceLocation;\n    QUrl m_identifier;\n};\n\nclass XmlReceiver : public QAbstractXmlReceiver\n{\npublic:\n    XmlReceiver(const QXmlNamePool &namePool) : m_namePool(namePool) {}\n\n    QList<MerDeviceData> deviceData() const\n    {\n        return m_devices;\n    }\n\n    MerEngineData engineData() const\n    {\n        return m_engineData;\n    }\n\n\nprotected:\n    virtual void startElement(const QXmlName &name)\n    {\n        const QString element = name.localName(m_namePool);\n        if (element == QLatin1String(DEVICE))\n            m_currentDevice.clear();\n        if (element == QLatin1String(ENGINE))\n            m_engineData.clear();\n        m_currentElementStack.push(element);\n\n    }\n\n    virtual void endElement()\n    {\n        const QString element = m_currentElementStack.pop();\n        if (element == QLatin1String(DEVICE)) {\n            m_devices.append(m_currentDevice);\n            m_currentDevice.clear();\n        }\n        if (element == QLatin1String(ENGINE)) {\n            m_engineData.m_name = m_currentDevice.m_name;\n            m_engineData.m_type = m_currentDevice.m_type;\n            m_currentDevice.clear();\n        }\n    }\n\n    virtual void attribute(const QXmlName &name,\n                           const QStringRef &value)\n    {\n        const QString attributeName = name.localName(m_namePool);\n        const QString attributeValue = value.toString();\n        const QString element = m_currentElementStack.top();\n        if (element == QLatin1String(DEVICE) || element == QLatin1String(ENGINE))\n        {\n            if(attributeName == QLatin1String(NAME))\n                 m_currentDevice.m_name = attributeValue;\n            if(attributeName == QLatin1String(TYPE))\n                 m_currentDevice.m_type = attributeValue;\n        }\n    }\n\n    virtual void characters(const QStringRef &value)\n    {\n        const QString element = m_currentElementStack.top();\n        if (element == QLatin1String(IP))\n            m_currentDevice.m_ip = value.toString();\n        if (element == QLatin1String(SUBNET))\n            m_currentDevice.m_subNet = value.toString();\n        if (element == QLatin1String(MAC))\n            m_currentDevice.m_name = value.toString();\n        if (element == QLatin1String(SSH_PATH))\n            m_currentDevice.m_sshKeyPath = value.toString();\n        if (element == QLatin1String(NAME))\n            m_currentDevice.m_name = value.toString();\n        if (element == QLatin1String(TYPE))\n            m_currentDevice.m_type = value.toString();\n        if (element == QLatin1String(INDEX))\n            m_currentDevice.m_index = value.toString().toInt();\n    }\n\n    virtual void comment(const QString &\/*value*\/)\n    {\n    }\n\n    virtual void startDocument()\n    {\n    }\n\n    virtual void endDocument()\n    {\n    }\n\n    virtual void processingInstruction(const QXmlName &\/*target*\/, const QString &\/*value*\/)\n    {\n    }\n\n    virtual void atomicValue(const QVariant &\/*value*\/)\n    {\n    }\n    virtual void namespaceBinding(const QXmlName &\/*name*\/)\n    {\n    }\n    virtual void startOfSequence()\n    {\n    }\n    virtual void endOfSequence()\n    {\n    }\n\nprivate:\n    QXmlNamePool m_namePool;\n    QStack<QString> m_currentElementStack;\n    QList<MerDeviceData> m_devices;\n    MerDeviceData m_currentDevice;\n    MerEngineData m_engineData;\n    QString m_attributeValue;\n};\n\n#ifdef Q_OS_MAC\n#  define SHARE_PATH \"\/..\/Resources\"\n#else\n#  define SHARE_PATH \"\/..\/share\/qtcreator\"\n#endif\n\nstatic QString applicationDirPath()\n{\n    return QCoreApplication::applicationDirPath();\n}\n\nstatic inline QString sharedDirPath()\n{\n    QString appPath = applicationDirPath();\n\n    return QFileInfo(appPath + QLatin1String(SHARE_PATH)).absoluteFilePath();\n}\n\n} \/\/ Anonymous\n\nclass MerDevicesXmlReaderPrivate\n{\npublic:\n    MerDevicesXmlReaderPrivate()\n        : receiver(new XmlReceiver(query.namePool())),\n          error(false)\n    {}\n\n    ~MerDevicesXmlReaderPrivate()\n    {\n        delete receiver;\n    }\n\n    QXmlQuery query;\n    XmlReceiver *receiver;\n    MessageHandler messageHandler;\n    bool error;\n    QString errorString;\n};\n\nMerDevicesXmlReader::MerDevicesXmlReader(const QString &fileName, QObject *parent)\n    : QObject(parent),\n      d(new MerDevicesXmlReaderPrivate)\n{\n    Utils::FileReader reader;\n    d->error = !reader.fetch(fileName, QIODevice::ReadOnly);\n    if (d->error) {\n        d->errorString = reader.errorString();\n        return;\n    }\n\n    QXmlSchema schema;\n    schema.setMessageHandler(&d->messageHandler);\n\n    Utils::FileReader schemeReader;\n    d->error = !schemeReader.fetch(QString::fromLatin1(\"%1\/mer\/devices.xsd\").arg(sharedDirPath()),\n            QIODevice::ReadOnly);\n    if (d->error) {\n        d->errorString = schemeReader.errorString();\n        return;\n    }\n    schema.load(schemeReader.data());\n    d->error = !schema.isValid();\n    if (d->error) {\n        d->errorString = d->messageHandler.errorString();\n        return;\n    }\n\n    QXmlSchemaValidator validator(schema);\n    validator.setMessageHandler(&d->messageHandler);\n    d->error = !validator.validate(reader.data());\n    if (d->error) {\n        d->errorString = d->messageHandler.errorString();\n        return;\n    }\n\n    d->query.setQuery(QString::fromLatin1(\"doc('%1')\").arg(fileName));\n    d->query.setMessageHandler(&d->messageHandler);\n    d->error = !d->query.isValid();\n    if (d->error) {\n        d->errorString = d->messageHandler.errorString();\n        return;\n    }\n\n    d->error = !d->query.evaluateTo(d->receiver);\n    if (d->error)\n        d->errorString = d->messageHandler.errorString();\n}\n\nMerDevicesXmlReader::~MerDevicesXmlReader()\n{\n    delete d;\n}\n\nbool MerDevicesXmlReader::hasError() const\n{\n    return d->error;\n}\n\nQString MerDevicesXmlReader::errorString() const\n{\n    return d->errorString;\n}\n\nQList<MerDeviceData> MerDevicesXmlReader::deviceData() const\n{\n    return d->receiver->deviceData();\n}\n\nMerEngineData MerDevicesXmlReader::engineData() const\n{\n    return d->receiver->engineData();\n}\n\nvoid MerDeviceData::clear()\n{\n    m_name.clear();\n    m_type.clear();\n    m_ip.clear();\n    m_subNet.clear();\n    m_mac.clear();\n    m_sshKeyPath.clear();\n}\n\nvoid MerEngineData::clear()\n{\n    m_name.clear();\n    m_type.clear();\n    m_subNet.clear();\n}\n\nclass MerDevicesXmlWriterPrivate\n{\npublic:\n    MerDevicesXmlWriterPrivate(const QString &fileName) : fileSaver(fileName, QIODevice::WriteOnly) {}\n\n    Utils::FileSaver fileSaver;\n};\n\nMerDevicesXmlWriter::MerDevicesXmlWriter(const QString &fileName,\n                                         const QList<MerDeviceData> &devices,  const MerEngineData &engine, QObject *parent)\n    : QObject(parent),\n      d(new MerDevicesXmlWriterPrivate(fileName))\n{\n    QByteArray data;\n    QXmlStreamWriter writer(&data);\n    writer.setAutoFormatting(true);\n    writer.writeStartDocument();\n    writer.writeStartElement(QLatin1String(DEVICES));\n    writer.writeStartElement(QLatin1String(ENGINE));\n    writer.writeAttribute(QLatin1String(NAME), engine.m_name);\n    writer.writeAttribute(QLatin1String(TYPE), engine.m_type);\n    writer.writeStartElement(QLatin1String(SUBNET));\n    writer.writeCharacters(engine.m_subNet);\n    writer.writeEndElement(); \/\/ subnet\n    writer.writeEndElement(); \/\/ eninge\n    foreach (const MerDeviceData &data, devices) {\n        writer.writeStartElement(QLatin1String(DEVICE));\n        writer.writeAttribute(QLatin1String(NAME), data.m_name);\n        writer.writeAttribute(QLatin1String(TYPE), data.m_type);\n        if(!data.m_index.isEmpty()) {\n            writer.writeStartElement(QLatin1String(INDEX));\n            writer.writeCharacters(data.m_index);\n            writer.writeEndElement(); \/\/ index\n        }\n        if(!data.m_ip.isEmpty()) {\n            writer.writeStartElement(QLatin1String(IP));\n            writer.writeCharacters(data.m_ip);\n            writer.writeEndElement(); \/\/ ip\n        }\n        if(!data.m_subNet.isEmpty()) {\n            writer.writeStartElement(QLatin1String(SUBNET));\n            writer.writeCharacters(data.m_subNet);\n            writer.writeEndElement(); \/\/ subnet\n        }\n        if(!data.m_sshKeyPath.isEmpty()) {\n            writer.writeStartElement(QLatin1String(SSH_PATH));\n            writer.writeCharacters(data.m_sshKeyPath);\n            writer.writeEndElement(); \/\/ ssh\n        }\n        if(!data.m_mac.isEmpty()) {\n            writer.writeStartElement(QLatin1String(MAC));\n            writer.writeCharacters(data.m_mac);\n            writer.writeEndElement(); \/\/ ssh\n        }\n        writer.writeEndElement(); \/\/ device\n    }\n    writer.writeEndElement(); \/\/ devices\n    writer.writeEndDocument();\n    d->fileSaver.write(data);\n    d->fileSaver.finalize();\n}\n\nMerDevicesXmlWriter::~MerDevicesXmlWriter()\n{\n    delete d;\n}\n\nbool MerDevicesXmlWriter::hasError() const\n{\n    return d->fileSaver.hasError();\n}\n\nQString MerDevicesXmlWriter::errorString() const\n{\n    return d->fileSaver.errorString();\n}\n\n} \/\/ Mer\n<commit_msg>Jolla: Hack for not overwriting devices of type real (cherry picked from commit a6b56a2603fd9fee4e8a9052b97c1adf419446ee)<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2012 - 2013 Jolla Ltd.\n** Contact: http:\/\/jolla.com\/\n**\n** This file is part of Qt Creator.\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** 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 Digia.\n**\n****************************************************************************\/\n\n#include \"merdevicexmlparser.h\"\n\n#include <utils\/fileutils.h>\n\n#include <QAbstractMessageHandler>\n#include <QAbstractXmlReceiver>\n#include <QXmlSchema>\n#include <QXmlSchemaValidator>\n#include <QXmlQuery>\n#include <QXmlStreamWriter>\n#include <QStack>\n#include <QFileInfo>\n\n\/\/Parser for:\n\/\/https:\/\/wiki.merproject.org\/wiki\/SDK_on_VirtualBox\/Design\n\n\/\/<devices>\n\/\/ <engine name=\"Mer SDK\" type=\"vbox\">\n\/\/  <subnet>10.220.220<\/subnet\n\/\/ <\/engine>\n\/\/ <device name=\"Nemo N9\" type=\"real\">\n\/\/  <ip>192.168.0.12<\/ip>\n\/\/  <sshkeypath><\/sshkeypath>\n\/\/ <\/device>\n\/\/ <device name=\"SailfishOS Emulator\" type=\"vbox\">\n\/\/  <index>2<\/index>\n\/\/  <subnet>10.220.220<\/subnet>\n\/\/  <sshkeypath><\/sshkeypath>\n\/\/  <mac>08:00:27:7C:A1:AF<\/mac>\n\/\/ <\/device>\n\/\/<\/devices>\n\nconst char DEVICE[] = \"device\";\nconst char DEVICES[] = \"devices\";\nconst char NAME[] = \"name\";\nconst char TYPE[] = \"type\";\nconst char ENGINE[] = \"engine\";\nconst char IP[] = \"ip\";\nconst char SSH_PATH[] = \"sshkeypath\";\nconst char SUBNET[] = \"subnet\";\nconst char MAC[] = \"mac\";\nconst char INDEX[] = \"index\";\n\nnamespace Mer {\n\nnamespace {\n\nclass MessageHandler : public QAbstractMessageHandler\n{\npublic:\n    QString errorString() const\n    {\n        return QObject::tr(\"Error %1:%2:%3 %4\").arg(m_identifier.toString())\n                .arg(m_sourceLocation.line())\n                .arg(m_sourceLocation.column())\n                .arg(m_description);\n    }\n\nprotected:\n    virtual void handleMessage(QtMsgType \/*type*\/, const QString &description,\n                               const QUrl &identifier, const QSourceLocation &sourceLocation)\n    {\n        m_description = description;\n        m_identifier = identifier;\n        m_sourceLocation = sourceLocation;\n    }\n\nprivate:\n    QString m_description;\n    QSourceLocation m_sourceLocation;\n    QUrl m_identifier;\n};\n\nclass XmlReceiver : public QAbstractXmlReceiver\n{\npublic:\n    XmlReceiver(const QXmlNamePool &namePool) : m_namePool(namePool) {}\n\n    QList<MerDeviceData> deviceData() const\n    {\n        return m_devices;\n    }\n\n    MerEngineData engineData() const\n    {\n        return m_engineData;\n    }\n\n\nprotected:\n    virtual void startElement(const QXmlName &name)\n    {\n        const QString element = name.localName(m_namePool);\n        if (element == QLatin1String(DEVICE))\n            m_currentDevice.clear();\n        if (element == QLatin1String(ENGINE))\n            m_engineData.clear();\n        m_currentElementStack.push(element);\n\n    }\n\n    virtual void endElement()\n    {\n        const QString element = m_currentElementStack.pop();\n        if (element == QLatin1String(DEVICE)) {\n            m_devices.append(m_currentDevice);\n            m_currentDevice.clear();\n        }\n        if (element == QLatin1String(ENGINE)) {\n            m_engineData.m_name = m_currentDevice.m_name;\n            m_engineData.m_type = m_currentDevice.m_type;\n            m_currentDevice.clear();\n        }\n    }\n\n    virtual void attribute(const QXmlName &name,\n                           const QStringRef &value)\n    {\n        const QString attributeName = name.localName(m_namePool);\n        const QString attributeValue = value.toString();\n        const QString element = m_currentElementStack.top();\n        if (element == QLatin1String(DEVICE) || element == QLatin1String(ENGINE))\n        {\n            if(attributeName == QLatin1String(NAME))\n                 m_currentDevice.m_name = attributeValue;\n            if(attributeName == QLatin1String(TYPE))\n                 m_currentDevice.m_type = attributeValue;\n        }\n    }\n\n    virtual void characters(const QStringRef &value)\n    {\n        const QString element = m_currentElementStack.top();\n        if (element == QLatin1String(IP))\n            m_currentDevice.m_ip = value.toString();\n        if (element == QLatin1String(SUBNET))\n            m_currentDevice.m_subNet = value.toString();\n        if (element == QLatin1String(MAC))\n            m_currentDevice.m_name = value.toString();\n        if (element == QLatin1String(SSH_PATH))\n            m_currentDevice.m_sshKeyPath = value.toString();\n        if (element == QLatin1String(NAME))\n            m_currentDevice.m_name = value.toString();\n        if (element == QLatin1String(TYPE))\n            m_currentDevice.m_type = value.toString();\n        if (element == QLatin1String(INDEX))\n            m_currentDevice.m_index = value.toString().toInt();\n    }\n\n    virtual void comment(const QString &\/*value*\/)\n    {\n    }\n\n    virtual void startDocument()\n    {\n    }\n\n    virtual void endDocument()\n    {\n    }\n\n    virtual void processingInstruction(const QXmlName &\/*target*\/, const QString &\/*value*\/)\n    {\n    }\n\n    virtual void atomicValue(const QVariant &\/*value*\/)\n    {\n    }\n    virtual void namespaceBinding(const QXmlName &\/*name*\/)\n    {\n    }\n    virtual void startOfSequence()\n    {\n    }\n    virtual void endOfSequence()\n    {\n    }\n\nprivate:\n    QXmlNamePool m_namePool;\n    QStack<QString> m_currentElementStack;\n    QList<MerDeviceData> m_devices;\n    MerDeviceData m_currentDevice;\n    MerEngineData m_engineData;\n    QString m_attributeValue;\n};\n\n#ifdef Q_OS_MAC\n#  define SHARE_PATH \"\/..\/Resources\"\n#else\n#  define SHARE_PATH \"\/..\/share\/qtcreator\"\n#endif\n\nstatic QString applicationDirPath()\n{\n    return QCoreApplication::applicationDirPath();\n}\n\nstatic inline QString sharedDirPath()\n{\n    QString appPath = applicationDirPath();\n\n    return QFileInfo(appPath + QLatin1String(SHARE_PATH)).absoluteFilePath();\n}\n\n} \/\/ Anonymous\n\nclass MerDevicesXmlReaderPrivate\n{\npublic:\n    MerDevicesXmlReaderPrivate()\n        : receiver(new XmlReceiver(query.namePool())),\n          error(false)\n    {}\n\n    ~MerDevicesXmlReaderPrivate()\n    {\n        delete receiver;\n    }\n\n    QXmlQuery query;\n    XmlReceiver *receiver;\n    MessageHandler messageHandler;\n    bool error;\n    QString errorString;\n};\n\nMerDevicesXmlReader::MerDevicesXmlReader(const QString &fileName, QObject *parent)\n    : QObject(parent),\n      d(new MerDevicesXmlReaderPrivate)\n{\n    Utils::FileReader reader;\n    d->error = !reader.fetch(fileName, QIODevice::ReadOnly);\n    if (d->error) {\n        d->errorString = reader.errorString();\n        return;\n    }\n\n    QXmlSchema schema;\n    schema.setMessageHandler(&d->messageHandler);\n\n    Utils::FileReader schemeReader;\n    d->error = !schemeReader.fetch(QString::fromLatin1(\"%1\/mer\/devices.xsd\").arg(sharedDirPath()),\n            QIODevice::ReadOnly);\n    if (d->error) {\n        d->errorString = schemeReader.errorString();\n        return;\n    }\n    schema.load(schemeReader.data());\n    d->error = !schema.isValid();\n    if (d->error) {\n        d->errorString = d->messageHandler.errorString();\n        return;\n    }\n\n    QXmlSchemaValidator validator(schema);\n    validator.setMessageHandler(&d->messageHandler);\n    d->error = !validator.validate(reader.data());\n    if (d->error) {\n        d->errorString = d->messageHandler.errorString();\n        return;\n    }\n\n    d->query.setQuery(QString::fromLatin1(\"doc('%1')\").arg(fileName));\n    d->query.setMessageHandler(&d->messageHandler);\n    d->error = !d->query.isValid();\n    if (d->error) {\n        d->errorString = d->messageHandler.errorString();\n        return;\n    }\n\n    d->error = !d->query.evaluateTo(d->receiver);\n    if (d->error)\n        d->errorString = d->messageHandler.errorString();\n}\n\nMerDevicesXmlReader::~MerDevicesXmlReader()\n{\n    delete d;\n}\n\nbool MerDevicesXmlReader::hasError() const\n{\n    return d->error;\n}\n\nQString MerDevicesXmlReader::errorString() const\n{\n    return d->errorString;\n}\n\nQList<MerDeviceData> MerDevicesXmlReader::deviceData() const\n{\n    return d->receiver->deviceData();\n}\n\nMerEngineData MerDevicesXmlReader::engineData() const\n{\n    return d->receiver->engineData();\n}\n\nvoid MerDeviceData::clear()\n{\n    m_name.clear();\n    m_type.clear();\n    m_ip.clear();\n    m_subNet.clear();\n    m_mac.clear();\n    m_sshKeyPath.clear();\n}\n\nvoid MerEngineData::clear()\n{\n    m_name.clear();\n    m_type.clear();\n    m_subNet.clear();\n}\n\nclass MerDevicesXmlWriterPrivate\n{\npublic:\n    MerDevicesXmlWriterPrivate(const QString &fileName) : fileSaver(fileName, QIODevice::WriteOnly) {}\n\n    Utils::FileSaver fileSaver;\n};\n\nMerDevicesXmlWriter::MerDevicesXmlWriter(const QString &fileName,\n                                         const QList<MerDeviceData> &devices,  const MerEngineData &engine, QObject *parent)\n    : QObject(parent),\n      d(new MerDevicesXmlWriterPrivate(fileName))\n{\n    QByteArray data;\n    QXmlStreamWriter writer(&data);\n    writer.setAutoFormatting(true);\n    writer.writeStartDocument();\n    writer.writeStartElement(QLatin1String(DEVICES));\n    writer.writeStartElement(QLatin1String(ENGINE));\n    writer.writeAttribute(QLatin1String(NAME), engine.m_name);\n    writer.writeAttribute(QLatin1String(TYPE), engine.m_type);\n    writer.writeStartElement(QLatin1String(SUBNET));\n    writer.writeCharacters(engine.m_subNet);\n    writer.writeEndElement(); \/\/ subnet\n    writer.writeEndElement(); \/\/ eninge\n    foreach (const MerDeviceData &data, devices) {\n        writer.writeStartElement(QLatin1String(DEVICE));\n        writer.writeAttribute(QLatin1String(NAME), data.m_name);\n        writer.writeAttribute(QLatin1String(TYPE), data.m_type);\n        if(!data.m_index.isEmpty()) {\n            writer.writeStartElement(QLatin1String(INDEX));\n            writer.writeCharacters(data.m_index);\n            writer.writeEndElement(); \/\/ index\n        }\n        if(!data.m_ip.isEmpty()) {\n            writer.writeStartElement(QLatin1String(IP));\n            writer.writeCharacters(data.m_ip);\n            writer.writeEndElement(); \/\/ ip\n        }\n        if(!data.m_subNet.isEmpty()) {\n            writer.writeStartElement(QLatin1String(SUBNET));\n            writer.writeCharacters(data.m_subNet);\n            writer.writeEndElement(); \/\/ subnet\n        }\n        if(!data.m_sshKeyPath.isEmpty()) {\n            writer.writeStartElement(QLatin1String(SSH_PATH));\n            writer.writeCharacters(data.m_sshKeyPath);\n            writer.writeEndElement(); \/\/ ssh\n        }\n        if(!data.m_mac.isEmpty()) {\n            writer.writeStartElement(QLatin1String(MAC));\n            writer.writeCharacters(data.m_mac);\n            writer.writeEndElement(); \/\/ ssh\n        }\n        writer.writeEndElement(); \/\/ device\n    }\n    {\n        \/\/ This is a hack. This hack allows external modifications to the xml file for devices\n        \/\/ Only devices that are of type=vbox are overwritten.\n        \/\/ REMOVE THESE LINES\n        \/\/ STARTS HERE\n        Utils::FileReader fileReader;\n        if (fileReader.fetch(fileName)) {\n            QXmlStreamReader xmlReader(fileReader.data());\n            while (!xmlReader.atEnd()) {\n                xmlReader.readNext();\n                if (xmlReader.isStartElement() && xmlReader.name().toLatin1() == DEVICE) {\n                    QXmlStreamAttributes attributes = xmlReader.attributes();\n                    if (attributes.value(QLatin1String(TYPE)) != QLatin1String(\"vbox\")) {\n                        writer.writeStartElement(QLatin1String(DEVICE));\n                        writer.writeAttributes(attributes);\n                        while (xmlReader.readNext()) {\n                            if (xmlReader.isStartElement()) {\n                                writer.writeStartElement(xmlReader.name().toString());\n                                attributes = xmlReader.attributes();\n                                writer.writeAttributes(attributes);\n                            } else if (xmlReader.isEndElement()) {\n                                writer.writeEndElement();\n                                if (xmlReader.name() == DEVICE)\n                                    break;\n                            } else if (xmlReader.isCharacters()) {\n                                writer.writeCharacters(xmlReader.text().toString());\n                            }\n                        }\n                    }\n                }\n            }\n        }\n        \/\/ ENDS HERE\n    }\n    writer.writeEndElement(); \/\/ devices\n    writer.writeEndDocument();\n    d->fileSaver.write(data);\n    d->fileSaver.finalize();\n}\n\nMerDevicesXmlWriter::~MerDevicesXmlWriter()\n{\n    delete d;\n}\n\nbool MerDevicesXmlWriter::hasError() const\n{\n    return d->fileSaver.hasError();\n}\n\nQString MerDevicesXmlWriter::errorString() const\n{\n    return d->fileSaver.errorString();\n}\n\n} \/\/ Mer\n<|endoftext|>"}
{"text":"<commit_before>#include \"MrlWS.h\"\n#include <Arduino.h>\n#if defined(ESP8266)\n#define USE_SERIAL Serial\n\nMrlWS::MrlWS(WebSocketsServer& wsServer) {\n  webSocket = &wsServer;\n  inputHead = 0;\n  inputTail = 0;\n  \n    USE_SERIAL.setDebugOutput(true);\n\n    USE_SERIAL.println();\n    USE_SERIAL.println();\n    USE_SERIAL.println();\n\n    for(uint8_t t = 4; t > 0; t--) {\n        USE_SERIAL.printf(\"[SETUP] BOOT WAIT %d...\\n\", t);\n        USE_SERIAL.flush();\n        delay(1000);\n}\nWiFiMulti.addAP(\"VIDEOTRON9077\",\"UWMF97AMJ9T4N\");\n  while (WiFiMulti.run() != WL_CONNECTED) {\n    delay(100);\n  }\n  webSocket->begin();\n  USE_SERIAL.println(\"webSocketStarted\");\n}\n\nvoid MrlWS::write(unsigned char b) {\n  \/\/unsigned char bu[1];\n\/\/  bu[0] = b;\n\/\/  write(bu,1);\n  outBuffer.concat(String(b));\n  outBuffer.concat(\"\/\");\n}\n\nvoid MrlWS::write(const unsigned char* b, int len) {\n  for (int i = 0; i < len; i++) {\n    outBuffer.concat(String(b[i]));\n    outBuffer.concat(\"\/\");\n  }\n}\n\nvoid MrlWS::flush() {\n  webSocket->sendTXT(num,outBuffer);\n  outBuffer =  \"\";\n}\n\nint MrlWS::available() {\n  if (inputTail >= inputHead) {\n    \/\/USE_SERIAL.printf(\"inputHead: [%u] inputTail: [%u] available\n    return inputTail - inputHead;\n  }\n  else {\n    return MAX_MSG_SIZE - inputHead + inputTail;\n  }\nreturn 0;\n}\n\nunsigned char MrlWS::read() {\n  \/\/USE_SERIAL.print(\"read called\");\n  if (inputHead == inputTail) {\n    return 0;\n  }\n  else {\n    unsigned char retVal = inputBuffer[inputHead++];\n    if (inputHead == MAX_MSG_SIZE) {\n      inputHead = 0;\n    }\n    \/\/USE_SERIAL.println(retVal);\n    return retVal;\n  }\nreturn 0;\n}\n\nvoid MrlWS::webSocketEvent(unsigned char num, WStype_t type, unsigned char* payload, unsigned int lenght) {\n  USE_SERIAL.print(\"in web Socket Event\");\n  this->num = num;\n    switch(type) {\n        case WStype_DISCONNECTED:\n            USE_SERIAL.printf(\"[%u] Disconnected!\\n\", num);\n            break;\n        case WStype_CONNECTED:\n            {\n                IPAddress ip = webSocket->remoteIP(num);\n                USE_SERIAL.printf(\"[%u] Connected from %d.%d.%d.%d url: %s\\n\", num, ip[0], ip[1], ip[2], ip[3], payload);\n        \n        \/\/ send message to client\n        \/\/webSocket->sendTXT(num, \"Connected\");\n            }\n            break;\n        case WStype_TEXT:\n            USE_SERIAL.printf(\"[%u] get Text: %s\\n\", num, payload);\n            \n            for (int i = 0; i < lenght; i++) {\n              inputBuffer[inputTail++] = payload[i];\n              USE_SERIAL.println(payload[i]);\n              if (inputTail == MAX_MSG_SIZE) {\n                inputTail = 0;\n              }\n              if (inputTail == inputHead) {\n                break;\n              }\n            }\n            \n            \/\/ send message to client\n            \/\/ webSocket->sendTXT(num, \"message here\");\n\n            \/\/ send data to all connected clients\n            \/\/ webSocket.broadcastTXT(\"message here\");\n            break;\n        case WStype_BIN:\n            USE_SERIAL.printf(\"[%u] get binary lenght: %u\\n\", num, lenght);\n            hexdump(payload, lenght);\n\n            \/\/ send message to client\n            \/\/ webSocket.sendBIN(num, payload, lenght);\n            break;\n    }\n\n}\n\n#endif\n\r\n<commit_msg>Websocket in MRLComm<commit_after>#include \"MrlWS.h\"\n#include <Arduino.h>\n#if defined(ESP8266)\n#define USE_SERIAL Serial\n\nMrlWS::MrlWS(WebSocketsServer& wsServer) {\n  webSocket = &wsServer;\n  inputHead = 0;\n  inputTail = 0;\n  \n    USE_SERIAL.setDebugOutput(true);\n\n    USE_SERIAL.println();\n    USE_SERIAL.println();\n    USE_SERIAL.println();\n\n    for(uint8_t t = 4; t > 0; t--) {\n        USE_SERIAL.printf(\"[SETUP] BOOT WAIT %d...\\n\", t);\n        USE_SERIAL.flush();\n        delay(1000);\n}\nWiFiMulti.addAP(\"SSID\",\"PASS\");\n  while (WiFiMulti.run() != WL_CONNECTED) {\n    delay(100);\n  }\n  webSocket->begin();\n  USE_SERIAL.println(\"webSocketStarted\");\n}\n\nvoid MrlWS::write(unsigned char b) {\n  \/\/unsigned char bu[1];\n\/\/  bu[0] = b;\n\/\/  write(bu,1);\n  outBuffer.concat(String(b));\n  outBuffer.concat(\"\/\");\n}\n\nvoid MrlWS::write(const unsigned char* b, int len) {\n  for (int i = 0; i < len; i++) {\n    outBuffer.concat(String(b[i]));\n    outBuffer.concat(\"\/\");\n  }\n}\n\nvoid MrlWS::flush() {\n  webSocket->sendTXT(num,outBuffer);\n  outBuffer =  \"\";\n}\n\nint MrlWS::available() {\n  if (inputTail >= inputHead) {\n    \/\/USE_SERIAL.printf(\"inputHead: [%u] inputTail: [%u] available\n    return inputTail - inputHead;\n  }\n  else {\n    return MAX_MSG_SIZE - inputHead + inputTail;\n  }\nreturn 0;\n}\n\nunsigned char MrlWS::read() {\n  \/\/USE_SERIAL.print(\"read called\");\n  if (inputHead == inputTail) {\n    return 0;\n  }\n  else {\n    unsigned char retVal = inputBuffer[inputHead++];\n    if (inputHead == MAX_MSG_SIZE) {\n      inputHead = 0;\n    }\n    \/\/USE_SERIAL.println(retVal);\n    return retVal;\n  }\nreturn 0;\n}\n\nvoid MrlWS::webSocketEvent(unsigned char num, WStype_t type, unsigned char* payload, unsigned int lenght) {\n  USE_SERIAL.print(\"in web Socket Event\");\n  this->num = num;\n    switch(type) {\n        case WStype_DISCONNECTED:\n            USE_SERIAL.printf(\"[%u] Disconnected!\\n\", num);\n            break;\n        case WStype_CONNECTED:\n            {\n                IPAddress ip = webSocket->remoteIP(num);\n                USE_SERIAL.printf(\"[%u] Connected from %d.%d.%d.%d url: %s\\n\", num, ip[0], ip[1], ip[2], ip[3], payload);\n        \n        \/\/ send message to client\n        \/\/webSocket->sendTXT(num, \"Connected\");\n            }\n            break;\n        case WStype_TEXT:\n            USE_SERIAL.printf(\"[%u] get Text: %s\\n\", num, payload);\n            \n            for (int i = 0; i < lenght; i++) {\n              inputBuffer[inputTail++] = payload[i];\n              USE_SERIAL.println(payload[i]);\n              if (inputTail == MAX_MSG_SIZE) {\n                inputTail = 0;\n              }\n              if (inputTail == inputHead) {\n                break;\n              }\n            }\n            \n            \/\/ send message to client\n            \/\/ webSocket->sendTXT(num, \"message here\");\n\n            \/\/ send data to all connected clients\n            \/\/ webSocket.broadcastTXT(\"message here\");\n            break;\n        case WStype_BIN:\n            USE_SERIAL.printf(\"[%u] get binary lenght: %u\\n\", num, lenght);\n            hexdump(payload, lenght);\n\n            \/\/ send message to client\n            \/\/ webSocket.sendBIN(num, payload, lenght);\n            break;\n    }\n\n}\n\n#endif\n\r\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <vulkan\/vulkan.h>\n\n#include \"nova_renderer\/rhi\/command_list.hpp\"\n#include \"nova_renderer\/rhi\/rhi_enums.hpp\"\n#include \"nova_renderer\/rhi\/rhi_types.hpp\"\n\nnamespace nova::renderer::rhi {\n    class VulkanRenderDevice;\n\n    \/*!\n     * \\brief Vulkan implementation of `command_list`\n     *\/\n    class VulkanCommandList final : public CommandList {\n    public:\n        VkCommandBuffer cmds;\n\n        VulkanCommandList(VkCommandBuffer cmds, const VulkanRenderDevice* render_device);\n\n        void resource_barriers(PipelineStage stages_before_barrier,\n                               PipelineStage stages_after_barrier,\n                               const rx::vector<ResourceBarrier>& barriers) override;\n\n        void copy_buffer(Buffer* destination_buffer,\n                         mem::Bytes destination_offset,\n                         Buffer* source_buffer,\n                         mem::Bytes source_offset,\n                         mem::Bytes num_bytes) override;\n\n        void execute_command_lists(const rx::vector<CommandList*>& lists) override;\n\n        void begin_renderpass(Renderpass* renderpass, Framebuffer* framebuffer) override;\n\n        void end_renderpass() override;\n\n        void bind_pipeline(const Pipeline* pipeline) override;\n\n        void bind_descriptor_sets(const rx::vector<DescriptorSet*>& descriptor_sets, const PipelineInterface* pipeline_interface) override;\n\n        void bind_vertex_buffers(const rx::vector<Buffer*>& buffers) override;\n\n        void bind_index_buffer(const Buffer* buffer) override;\n\n        void draw_indexed_mesh(uint32_t num_indices, uint32_t offset, uint32_t num_instances) override;\n\n        void set_scissor_rect(uint32_t x, uint32_t y, uint32_t width, uint32_t height) override;\n\n        void upload_data_to_image(\n            Image* image, size_t width, size_t height, size_t bytes_per_pixel, Buffer* staging_buffer, const void* data) override;\n\n    private:\n        const VulkanRenderDevice& render_device;\n    };\n} \/\/ namespace nova::renderer::rhi\n<commit_msg>[rhi] Trying to manage descriptor binds and updates<commit_after>#pragma once\n\n#include <vulkan\/vulkan.h>\n\n#include \"nova_renderer\/rhi\/command_list.hpp\"\n#include \"nova_renderer\/rhi\/rhi_enums.hpp\"\n#include \"nova_renderer\/rhi\/rhi_types.hpp\"\n\nnamespace nova::renderer::rhi {\n    class VulkanRenderDevice;\n\n    \/*!\n     * \\brief Vulkan implementation of `command_list`\n     *\/\n    class VulkanCommandList final : public CommandList {\n    public:\n        VkCommandBuffer cmds;\n\n        VulkanCommandList(VkCommandBuffer cmds, const VulkanRenderDevice* render_device);\n\n        ~VulkanCommandList() override = default;\n\n        void resource_barriers(PipelineStage stages_before_barrier,\n                               PipelineStage stages_after_barrier,\n                               const rx::vector<ResourceBarrier>& barriers) override;\n\n        void copy_buffer(Buffer* destination_buffer,\n                         mem::Bytes destination_offset,\n                         Buffer* source_buffer,\n                         mem::Bytes source_offset,\n                         mem::Bytes num_bytes) override;\n\n        void execute_command_lists(const rx::vector<CommandList*>& lists) override;\n\n        void begin_renderpass(Renderpass* renderpass, Framebuffer* framebuffer) override;\n\n        void end_renderpass() override;\n\n        void bind_pipeline(const Pipeline* pipeline) override;\n\n        void bind_descriptor_sets(const rx::vector<DescriptorSet*>& descriptor_sets, const PipelineInterface* pipeline_interface) override;\n\n        void bind_vertex_buffers(const rx::vector<Buffer*>& buffers) override;\n\n        void bind_index_buffer(const Buffer* buffer) override;\n\n        void draw_indexed_mesh(uint32_t num_indices, uint32_t offset, uint32_t num_instances) override;\n\n        void set_scissor_rect(uint32_t x, uint32_t y, uint32_t width, uint32_t height) override;\n\n        void upload_data_to_image(\n            Image* image, size_t width, size_t height, size_t bytes_per_pixel, Buffer* staging_buffer, const void* data) override;\n\n    private:\n        const VulkanRenderDevice& render_device;\n    };\n} \/\/ namespace nova::renderer::rhi\n<|endoftext|>"}
{"text":"<commit_before>\/* \n** Copyright 1993 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#if defined(Solaris) && !defined(Solaris251)\n#include \"condor_fix_timeval.h\"\n#include <\/usr\/ucbinclude\/sys\/rusage.h>\n#endif\n\n#define _POSIX_SOURCE\n\n#include \"condor_common.h\"\n#include \"condor_constants.h\"\n#include \"condor_debug.h\"\n#include \"condor_config.h\"\n#include \"proc_obj.h\"\n#include \"filter.h\"\n#include \"alloc.h\"\n\nstatic char *_FileName_ = __FILE__;\t\t\/* Used by EXCEPT (see except.h)     *\/\n\nDBM\t\t*Q;\n\nchar\t*param();\nchar\t*MyName;\nchar\t*Spool;\n\nint\t\tPrioAdjustment;\nint\t\tNewPriority;\nint\t\tPrioritySet;\nint\t\tAdjustmentSet;\nProcFilter\t*PFilter = new ProcFilter();\nint\t\tInvokingUid;\t\t\/\/ user id of person ivoking this program\nchar\t*InvokingUserName;\t\/\/ user name of person ivoking this program\n\nconst int MIN_PRIO = -20;\nconst int MAX_PRIO = 20;\n\n\t\/\/ Prototypes of local interest only\nvoid usage();\nint compute_adj( char * );\nvoid init_params();\nvoid do_it( ProcObj * );\nint calc_prio( int old_prio );\nvoid init_user_credentials();\n\n\t\/\/ Tell folks how to use this program\nvoid\nusage()\n{\n\tfprintf( stderr, \"Usage: %s [{+|-}priority ] [-p priority] \", MyName );\n\tfprintf( stderr, \"[ -a ] [user | cluster | cluster.proc] ...\\n\" );\n\texit( 1 );\n}\n\nint\nmain( int argc, char *argv[] )\n{\n\tchar\tqueue_name[_POSIX_PATH_MAX];\n\tchar\t*arg;\n\tint\t\tprio_adj;\n\tList<ProcObj>\t*proc_list;\n\tProcObj\t\t\t*p;\n\n\tMyName = argv[0];\n\n\tconfig( MyName, (CONTEXT *)0 );\n\tinit_params();\n\n\tif( argc < 2 ) {\n\t\tusage();\n\t}\n\n\tPrioritySet = 0;\n\tAdjustmentSet = 0;\n\n\tfor( argv++; arg = *argv; argv++ ) {\n\t\tif( (arg[0] == '-' || arg[0] == '+') && isdigit(arg[1]) ) {\n\t\t\tPrioAdjustment = compute_adj(arg);\n\t\t\tAdjustmentSet = TRUE;\n\t\t} else if( arg[0] == '-' && arg[1] == 'p' ) {\n\t\t\targv++;\n\t\t\tNewPriority = atoi(*argv);\n\t\t\tPrioritySet = TRUE;\n\t\t} else {\n\t\t\tif( !PFilter->Append(arg) ) {\n\t\t\t\tusage();\n\t\t\t}\n\t\t}\n\t}\n\n\tif( PrioritySet == FALSE && AdjustmentSet == FALSE ) {\n\t\tfprintf( stderr, \n\t\t\t\"You must specify a new priority or priority adjustment.\\n\");\n\t\tusage();\n\t\texit(1);\n\t}\n\n\tif( PrioritySet && (NewPriority < MIN_PRIO || NewPriority > MAX_PRIO) ) {\n\t\tfprintf( stderr, \n\t\t\t\"Invalid priority specified.  Must be between %d and %d.\\n\", \n\t\t\tMIN_PRIO, MAX_PRIO );\n\t\texit(1);\n\t}\n\n\t\t\/* Open job queue *\/\n\t(void)sprintf( queue_name, \"%s\/job_queue\", Spool );\n\tif( (Q=OpenJobQueue(queue_name,O_RDWR,0)) == NULL ) {\n\t\tEXCEPT( \"OpenJobQueue(%s)\", queue_name );\n\t}\n\n\tLockJobQueue( Q, WRITER );\n\n\n\t\t\/\/ Create a list of all procs we're interested in\n\tPFilter->Install();\n\tproc_list = ProcObj::create_list( Q, ProcFilter::Func );\n\n\t\t\/\/ Process the list\n\tproc_list->Rewind();\n\twhile( p = proc_list->Next() ) {\n\t\tdo_it( p );\n\t}\n\n\t\t\/\/ Clean up\n\tLockJobQueue( Q, UNLOCK );\n\tCloseJobQueue( Q );\n\tProcObj::delete_list( proc_list );\n\tdelete PFilter;\n\n#if defined(ALLOC_DEBUG)\n\tprint_alloc_stats();\n#endif\n\n\treturn 0;\n}\n\n\/*\n  Given the old priority of a given process, calculate the new\n  one based on information gotten from the command line arguments.\n*\/\nint\ncalc_prio( int old_prio )\n{\n\tint\t\tanswer;\n\n\tif( AdjustmentSet == TRUE && PrioritySet == FALSE ) {\n\t\tanswer = old_prio + PrioAdjustment;\n\t\tif( answer > MAX_PRIO )\n\t\t\tanswer = MAX_PRIO;\n\t\telse if( answer < MIN_PRIO )\n\t\t\tanswer = MIN_PRIO;\n\t} else {\n\t\tanswer = NewPriority;\n\t}\n\treturn answer;\n}\n\n\/*\n  Given a command line argument specifing a relative adjustment\n  of priority of the form \"+adj\" or \"-adj\", return the correct\n  value as a positive or negative integer.\n*\/\nint\ncompute_adj( char *arg )\n{\n\tchar *ptr;\n\tint val;\n\t\n\tptr = arg+1;\n\n\tval = atoi(ptr);\n\n\tif( *arg == '-' ) {\n\t\treturn( -val );\n\t} else {\n\t\treturn( val );\n\t}\n}\n\nextern \"C\" int SetSyscalls( int foo ) { return foo; }\n\nvoid\ninit_params()\n{\n\tSpool = param(\"SPOOL\");\n\tif( Spool == NULL ) {\n\t\tEXCEPT( \"SPOOL not specified in config file\\n\" );\n\t}\n}\n\nvoid\ndo_it( ProcObj *p )\n{\n\tint\t\told_prio;\n\tint\t\tnew_prio;\n\n\tif( p->perm_to_modify() ) {\n\t\told_prio = p->get_prio();\n\t\tnew_prio = calc_prio( old_prio );\n\t\tp->set_prio( new_prio );\n\t\tp->store( Q );\n\t} else {\n\t\tfprintf( stderr,\n\t\t\t\"%d.%d: Permission Denied\\n\",\n\t\t\tp->get_cluster_id(), p->get_proc_id()\n\t\t);\n\t}\n}\n<commit_msg>added qmgmt support; define USE_QMGMT to use<commit_after>\/* \n** Copyright 1993 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#if defined(Solaris) && !defined(Solaris251)\n#include \"condor_fix_timeval.h\"\n#include <\/usr\/ucbinclude\/sys\/rusage.h>\n#endif\n\n#define _POSIX_SOURCE\n\n#include \"condor_common.h\"\n#include \"condor_constants.h\"\n#include \"condor_debug.h\"\n#include \"condor_config.h\"\n#include \"proc_obj.h\"\n#include \"filter.h\"\n#include \"alloc.h\"\n\nstatic char *_FileName_ = __FILE__;\t\t\/* Used by EXCEPT (see except.h)     *\/\n\n#if DBM_QUEUE\nDBM\t\t*Q;\n#else\n#include \"condor_qmgr.h\"\n#endif\n\nchar\t*param();\nchar\t*MyName;\n#if DBM_QUEUE\nchar\t*Spool;\n#endif\n\nint\t\tPrioAdjustment;\nint\t\tNewPriority;\nint\t\tPrioritySet;\nint\t\tAdjustmentSet;\n#if DBM_QUEUE\nProcFilter\t*PFilter = new ProcFilter();\n#endif\nint\t\tInvokingUid;\t\t\/\/ user id of person ivoking this program\nchar\t*InvokingUserName;\t\/\/ user name of person ivoking this program\n\nconst int MIN_PRIO = -20;\nconst int MAX_PRIO = 20;\n\n\t\/\/ Prototypes of local interest only\nvoid usage();\nint compute_adj( char * );\n#if DBM_QUEUE\nvoid init_params();\nvoid do_it( ProcObj * );\n#else\nvoid ProcArg( const char * );\n#endif\nint calc_prio( int old_prio );\nvoid init_user_credentials();\n\n#if !DBM_QUEUE\nextern \"C\" int gethostname(char*, int);\n#endif\n\nchar\thostname[512];\n\n\t\/\/ Tell folks how to use this program\nvoid\nusage()\n{\n\tfprintf( stderr, \"Usage: %s [{+|-}priority ] [-p priority] \", MyName );\n\tfprintf( stderr, \"[ -a ] [-r host] [user | cluster | cluster.proc] ...\\n\");\n\texit( 1 );\n}\n\nint\nmain( int argc, char *argv[] )\n{\n#if DBM_QUEUE\n\tchar\tqueue_name[_POSIX_PATH_MAX];\n#endif\n\tchar\t*arg;\n\tint\t\tprio_adj;\n#if DBM_QUEUE\n\tList<ProcObj>\t*proc_list;\n\tProcObj\t\t\t*p;\n#else\n\tchar\t\t\t*args[argc - 1];\n\tint\t\t\t\tnArgs = 0;\n\tint\t\t\t\ti;\n\tQmgr_connection\t*q;\n#endif\n\n\tMyName = argv[0];\n\n\tconfig( MyName, (CONTEXT *)0 );\n#if DBM_QUEUE\n\tinit_params();\n#endif\n\n\tif( argc < 2 ) {\n\t\tusage();\n\t}\n\n\tPrioritySet = 0;\n\tAdjustmentSet = 0;\n\n\thostname[0] = '\\0';\n\tfor( argv++; arg = *argv; argv++ ) {\n\t\tif( (arg[0] == '-' || arg[0] == '+') && isdigit(arg[1]) ) {\n\t\t\tPrioAdjustment = compute_adj(arg);\n\t\t\tAdjustmentSet = TRUE;\n\t\t} else if( arg[0] == '-' && arg[1] == 'p' ) {\n\t\t\targv++;\n\t\t\tNewPriority = atoi(*argv);\n\t\t\tPrioritySet = TRUE;\n\t\t} else if( arg[0] == '-' && arg[1] == 'r' ) {\n\t\t\t\/\/ use the given name as the host name to connect to\n\t\t\targv++;\n\t\t\tstrcpy (hostname, *argv);\n\t\t} else {\n#if DBM_QUEUE\n\t\t\tif( !PFilter->Append(arg) ) {\n\t\t\t\tusage();\n\t\t\t}\n#else\t\n\t\t\targs[nArgs] = arg;\n\t\t\tnArgs++;\n#endif\n\t\t}\n\t}\n\n\tif( PrioritySet == FALSE && AdjustmentSet == FALSE ) {\n\t\tfprintf( stderr, \n\t\t\t\"You must specify a new priority or priority adjustment.\\n\");\n\t\tusage();\n\t\texit(1);\n\t}\n\n\tif( PrioritySet && (NewPriority < MIN_PRIO || NewPriority > MAX_PRIO) ) {\n\t\tfprintf( stderr, \n\t\t\t\"Invalid priority specified.  Must be between %d and %d.\\n\", \n\t\t\tMIN_PRIO, MAX_PRIO );\n\t\texit(1);\n\t}\n\n\t\t\/* Open job queue *\/\n#if DBM_QUEUE\n\t(void)sprintf( queue_name, \"%s\/job_queue\", Spool );\n\tif( (Q=OpenJobQueue(queue_name,O_RDWR,0)) == NULL ) {\n\t\tEXCEPT( \"OpenJobQueue(%s)\", queue_name );\n\t}\n\n\tLockJobQueue( Q, WRITER );\n\n\n\t\t\/\/ Create a list of all procs we're interested in\n\tPFilter->Install();\n\tproc_list = ProcObj::create_list( Q, ProcFilter::Func );\n\n\t\t\/\/ Process the list\n\tproc_list->Rewind();\n\twhile( p = proc_list->Next() ) {\n\t\tdo_it( p );\n\t}\n\n\t\t\/\/ Clean up\n\tLockJobQueue( Q, UNLOCK );\n\tCloseJobQueue( Q );\n\tProcObj::delete_list( proc_list );\n\tdelete PFilter;\n#else\n\tif (hostname[0] == '\\0')\n\t{\n\t\t\/\/ hostname was not set at command line; obtain from system\n\t\tif(gethostname(hostname, 200) < 0)\n\t\t{\n\t\t\tEXCEPT(\"gethostname failed, errno = %d\", errno);\n\t\t}\n\t}\n\tif((q = ConnectQ(hostname)) == 0)\n\t{\n\t\tEXCEPT(\"Failed to connect to qmgr on host %s\", hostname);\n\t}\n\tfor(i = 0; i < nArgs; i++)\n\t{\n\t\tProcArg(args[i]);\n\t}\n\tDisconnectQ(q);\n#endif\t\n\n#if defined(ALLOC_DEBUG)\n\tprint_alloc_stats();\n#endif\n\n\treturn 0;\n}\n\n\/*\n  Given the old priority of a given process, calculate the new\n  one based on information gotten from the command line arguments.\n*\/\nint\ncalc_prio( int old_prio )\n{\n\tint\t\tanswer;\n\n\tif( AdjustmentSet == TRUE && PrioritySet == FALSE ) {\n\t\tanswer = old_prio + PrioAdjustment;\n\t\tif( answer > MAX_PRIO )\n\t\t\tanswer = MAX_PRIO;\n\t\telse if( answer < MIN_PRIO )\n\t\t\tanswer = MIN_PRIO;\n\t} else {\n\t\tanswer = NewPriority;\n\t}\n\treturn answer;\n}\n\n\/*\n  Given a command line argument specifing a relative adjustment\n  of priority of the form \"+adj\" or \"-adj\", return the correct\n  value as a positive or negative integer.\n*\/\nint\ncompute_adj( char *arg )\n{\n\tchar *ptr;\n\tint val;\n\t\n\tptr = arg+1;\n\n\tval = atoi(ptr);\n\n\tif( *arg == '-' ) {\n\t\treturn( -val );\n\t} else {\n\t\treturn( val );\n\t}\n}\n\nextern \"C\" int SetSyscalls( int foo ) { return foo; }\n\n#if DBM_QUEUE\nvoid\ninit_params()\n{\n\tSpool = param(\"SPOOL\");\n\tif( Spool == NULL ) {\n\t\tEXCEPT( \"SPOOL not specified in config file\\n\" );\n\t}\n}\n\nvoid\ndo_it( ProcObj *p )\n{\n\tint\t\told_prio;\n\tint\t\tnew_prio;\n\n\tif( p->perm_to_modify() ) {\n\t\told_prio = p->get_prio();\n\t\tnew_prio = calc_prio( old_prio );\n\t\tp->set_prio( new_prio );\n\t\tp->store( Q );\n\t} else {\n\t\tfprintf( stderr,\n\t\t\t\"%d.%d: Permission Denied\\n\",\n\t\t\tp->get_cluster_id(), p->get_proc_id()\n\t\t);\n\t}\n}\n#else\nvoid UpdateJobAd(int cluster, int proc)\n{\n\tint old_prio, new_prio;\n\tif (GetAttributeInt(cluster, proc, \"Prio\", &old_prio) < 0)\n\t{\n\t\tfprintf(stderr, \"Couldn't retrieve current prio for %d.%d.\\n\",\n\t\t\t\tcluster, proc);\n\t\treturn;\n\t}\n\tnew_prio = calc_prio( old_prio );\n\tSetAttributeInt(cluster, proc, \"Prio\", new_prio);\n}\n\nvoid ProcArg(const char* arg)\n{\n\tint\t\tcluster, proc;\n\tchar\t*tmp;\n\n\tif(isdigit(*arg))\n\t\/\/ set prio by cluster\/proc #\n\t{\n\t\tcluster = strtol(arg, &tmp, 10);\n\t\tif(cluster <= 0)\n\t\t{\n\t\t\tfprintf(stderr, \"Invalid cluster # from %s\\n\", arg);\n\t\t\treturn;\n\t\t}\n\t\tif(*tmp == '\\0')\n\t\t\/\/ update prio for all jobs in the cluster\n\t\t{\n\t\t\tint next_cluster = cluster;\n\t\t\tproc = -1;\n\t\t\twhile(next_cluster == cluster) {\n\t\t\t\tif (GetNextJob(cluster, proc, &next_cluster, &proc) < 0) {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tUpdateJobAd(cluster, proc);\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\tif(*tmp == '.')\n\t\t{\n\t\t\tproc = strtol(tmp + 1, &tmp, 10);\n\t\t\tif(proc < 0)\n\t\t\t{\n\t\t\t\tfprintf(stderr, \"Invalid proc # from %s\\n\", arg);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif(*tmp == '\\0')\n\t\t\t\/\/ update prio for proc\n\t\t\t{\n\t\t\t\tUpdateJobAd(cluster, proc);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tfprintf(stderr, \"Warning: unrecognized \\\"%s\\\" skipped\\n\", arg);\n\t\t\treturn;\n\t\t}\n\t\tfprintf(stderr, \"Warning: unrecognized \\\"%s\\\" skipped\\n\", arg);\n\t}\n\telse if(isalpha(*arg) || (arg[0] == '-' && arg[1] == 'a'))\n\t\/\/ update prio by user name\n\t{\n\t\tchar\towner[1000];\n\n\t\tcluster = proc = -1;\n\t\twhile (GetNextJob(cluster, proc, &cluster, &proc) >= 0) {\n\t\t\tif (arg[0] == '-' && arg[1] == 'a') {\n\t\t\t\tUpdateJobAd(cluster, proc);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (GetAttributeString(cluster, proc, \"Owner\", owner) < 0) {\n\t\t\t\t\tfprintf(stderr, \"Couldn't retrieve owner attribute for \"\n\t\t\t\t\t\t\t\"%d.%d\\n\", cluster, proc);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (strcmp(owner, arg) == MATCH) {\n\t\t\t\t\tUpdateJobAd(cluster, proc);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\telse\n\t{\n\t\tfprintf(stderr, \"Warning: unrecognized \\\"%s\\\" skipped\\n\", arg);\n\t}\n}\n#endif\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_COLOR_HPP\n#define MAPNIK_COLOR_HPP\n\n\/\/ mapnik\n#include <mapnik\/config.hpp>\n#include <mapnik\/global.hpp>\n\n\/\/boost\n#include <boost\/operators.hpp>\n\n\/\/ stl\n#include <sstream>\n#include <cstdint>\n\nnamespace mapnik {\n\nclass MAPNIK_DECL color\n    : boost::equality_comparable<color>\n{\nprivate:\n    std::uint8_t red_;\n    std::uint8_t green_;\n    std::uint8_t blue_;\n    std::uint8_t alpha_;\n    bool premultiplied_;\npublic:\n    \/\/ default ctor\n    color()\n      : red_(0xff),\n        green_(0xff),\n        blue_(0xff),\n        alpha_(0xff),\n        premultiplied_(false)\n        {}\n\n    color(std::uint8_t _red, std::uint8_t _green, std::uint8_t _blue, std::uint8_t _alpha = 0xff, bool premultiplied = false)\n      : red_(_red),\n        green_(_green),\n        blue_(_blue),\n        alpha_(_alpha),\n        premultiplied_(premultiplied)\n        {}\n\n    color(std::uint32_t _rgba, bool premultiplied = false)\n      : red_(_rgba & 0xff),\n        green_((_rgba >> 8) & 0xff),\n        blue_((_rgba >> 16) & 0xff),\n        alpha_((_rgba >> 24) & 0xff),\n        premultiplied_(premultiplied) {}\n\n    \/\/ copy ctor\n    color(const color& rhs)\n      : red_(rhs.red_),\n        green_(rhs.green_),\n        blue_(rhs.blue_),\n        alpha_(rhs.alpha_),\n        premultiplied_(rhs.premultiplied_)\n        {}\n\n    \/\/ move ctor\n    color(color && rhs)\n        : red_(std::move(rhs.red_)),\n        green_(std::move(rhs.green_)),\n        blue_(std::move(rhs.blue_)),\n        alpha_(std::move(rhs.alpha_)),\n        premultiplied_(std::move(rhs.premultiplied_)) {}\n\n    color( std::string const& str, bool premultiplied = false);\n\n    std::string to_string() const;\n    std::string to_hex_string() const;\n    bool premultiply();\n    bool demultiply();\n\n    color& operator=(color rhs)\n    {\n        swap(rhs);\n        return *this;\n    }\n\n    inline bool operator==(color const& rhs) const\n    {\n        return (red_== rhs.red()) &&\n               (green_ == rhs.green()) &&\n               (blue_  == rhs.blue()) &&\n               (alpha_ == rhs.alpha());\n    }\n\n    inline std::uint8_t red() const\n    {\n        return red_;\n    }\n\n    inline std::uint8_t green() const\n    {\n        return green_;\n    }\n\n    inline std::uint8_t blue() const\n    {\n        return blue_;\n    }\n\n    inline std::uint8_t alpha() const\n    {\n        return alpha_;\n    }\n\n    inline void set_red(std::uint8_t _red)\n    {\n        red_ = _red;\n    }\n\n    inline void set_green(std::uint8_t _green)\n    {\n        green_ = _green;\n    }\n\n    inline void set_blue(std::uint8_t _blue)\n    {\n        blue_ = _blue;\n    }\n    inline void set_alpha(std::uint8_t _alpha)\n    {\n        alpha_ = _alpha;\n    }\n    inline bool get_premultiplied() const\n    {\n        return premultiplied_;\n    }\n    inline void set_premultiplied(bool status)\n    {\n        premultiplied_ = status;\n    }\n\n    inline unsigned rgba() const\n    {\n        return static_cast<unsigned>((alpha_ << 24) | (blue_ << 16) | (green_ << 8) | (red_)) ;\n    }\nprivate:\n    void swap(color & rhs)\n    {\n        std::swap(red_, rhs.red_);\n        std::swap(green_,rhs.green_);\n        std::swap(blue_,rhs.blue_);\n        std::swap(alpha_,rhs.alpha_);\n    }\n};\n\ntemplate <typename charT, typename traits>\nstd::basic_ostream<charT, traits> &\noperator << ( std::basic_ostream<charT, traits> & s, mapnik::color const& c )\n{\n    std::string hex_string( c.to_string() );\n    s << hex_string;\n    return s;\n}\n\n\/\/ hash\ninline std::size_t hash_value(color const& c)\n{\n    return c.rgba();\n}\n\n}\n\n#endif \/\/ MAPNIK_COLOR_HPP\n<commit_msg>fix operator<<<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_COLOR_HPP\n#define MAPNIK_COLOR_HPP\n\n\/\/ mapnik\n#include <mapnik\/config.hpp>\n#include <mapnik\/global.hpp>\n\n\/\/boost\n#include <boost\/operators.hpp>\n\n\/\/ stl\n#include <sstream>\n#include <cstdint>\n\nnamespace mapnik {\n\nclass MAPNIK_DECL color\n    : boost::equality_comparable<color>\n{\nprivate:\n    std::uint8_t red_;\n    std::uint8_t green_;\n    std::uint8_t blue_;\n    std::uint8_t alpha_;\n    bool premultiplied_;\npublic:\n    \/\/ default ctor\n    color()\n      : red_(0xff),\n        green_(0xff),\n        blue_(0xff),\n        alpha_(0xff),\n        premultiplied_(false)\n        {}\n\n    color(std::uint8_t _red, std::uint8_t _green, std::uint8_t _blue, std::uint8_t _alpha = 0xff, bool premultiplied = false)\n      : red_(_red),\n        green_(_green),\n        blue_(_blue),\n        alpha_(_alpha),\n        premultiplied_(premultiplied)\n        {}\n\n    color(std::uint32_t _rgba, bool premultiplied = false)\n      : red_(_rgba & 0xff),\n        green_((_rgba >> 8) & 0xff),\n        blue_((_rgba >> 16) & 0xff),\n        alpha_((_rgba >> 24) & 0xff),\n        premultiplied_(premultiplied) {}\n\n    \/\/ copy ctor\n    color(const color& rhs)\n      : red_(rhs.red_),\n        green_(rhs.green_),\n        blue_(rhs.blue_),\n        alpha_(rhs.alpha_),\n        premultiplied_(rhs.premultiplied_)\n        {}\n\n    \/\/ move ctor\n    color(color && rhs)\n        : red_(std::move(rhs.red_)),\n        green_(std::move(rhs.green_)),\n        blue_(std::move(rhs.blue_)),\n        alpha_(std::move(rhs.alpha_)),\n        premultiplied_(std::move(rhs.premultiplied_)) {}\n\n    color( std::string const& str, bool premultiplied = false);\n\n    std::string to_string() const;\n    std::string to_hex_string() const;\n    bool premultiply();\n    bool demultiply();\n\n    color& operator=(color rhs)\n    {\n        swap(rhs);\n        return *this;\n    }\n\n    inline bool operator==(color const& rhs) const\n    {\n        return (red_== rhs.red()) &&\n               (green_ == rhs.green()) &&\n               (blue_  == rhs.blue()) &&\n               (alpha_ == rhs.alpha());\n    }\n\n    inline std::uint8_t red() const\n    {\n        return red_;\n    }\n\n    inline std::uint8_t green() const\n    {\n        return green_;\n    }\n\n    inline std::uint8_t blue() const\n    {\n        return blue_;\n    }\n\n    inline std::uint8_t alpha() const\n    {\n        return alpha_;\n    }\n\n    inline void set_red(std::uint8_t _red)\n    {\n        red_ = _red;\n    }\n\n    inline void set_green(std::uint8_t _green)\n    {\n        green_ = _green;\n    }\n\n    inline void set_blue(std::uint8_t _blue)\n    {\n        blue_ = _blue;\n    }\n    inline void set_alpha(std::uint8_t _alpha)\n    {\n        alpha_ = _alpha;\n    }\n    inline bool get_premultiplied() const\n    {\n        return premultiplied_;\n    }\n    inline void set_premultiplied(bool status)\n    {\n        premultiplied_ = status;\n    }\n\n    inline unsigned rgba() const\n    {\n        return static_cast<unsigned>((alpha_ << 24) | (blue_ << 16) | (green_ << 8) | (red_)) ;\n    }\nprivate:\n    void swap(color & rhs)\n    {\n        std::swap(red_, rhs.red_);\n        std::swap(green_,rhs.green_);\n        std::swap(blue_,rhs.blue_);\n        std::swap(alpha_,rhs.alpha_);\n    }\n};\n\ntemplate <typename charT, typename traits>\nstd::basic_ostream<charT, traits> &\noperator << ( std::basic_ostream<charT, traits> & s, mapnik::color const& c )\n{\n    s << c.to_string();\n    return s;\n}\n\n\/\/ hash\ninline std::size_t hash_value(color const& c)\n{\n    return c.rgba();\n}\n\n}\n\n#endif \/\/ MAPNIK_COLOR_HPP\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_TYPE_HH__\n#define __MINIZINC_TYPE_HH__\n\n#include <string>\n#include <sstream>\n#include <cassert>\n\nnamespace MiniZinc {\n\n  class EnvI;\n  \n  \/\/\/ Type of a MiniZinc expression\n  class Type {\n  public:\n    \/\/\/ Type-inst\n    enum TypeInst { TI_PAR, TI_VAR };\n    \/\/\/ Basic type\n    enum BaseType { BT_TOP, BT_BOOL, BT_INT, BT_FLOAT, BT_STRING, BT_ANN,\n                    BT_BOT, BT_UNKNOWN };\n    \/\/\/ Whether the expression is plain or set\n    enum SetType { ST_PLAIN, ST_SET };\n    \/\/\/ Whether the expression is normal or optional\n    enum OptType { OT_PRESENT, OT_OPTIONAL };\n    \/\/\/ Whether the par expression contains a var argument\n    enum ContainsVarType { CV_NO, CV_YES };\n  private:\n    unsigned int _ti : 1;\n    unsigned int _bt : 4;\n    unsigned int _st  : 1;\n    unsigned int _ot  : 1;\n    unsigned int _cv  : 1;\n    \/** \\brief Enumerated type identifier\n     * This is an index into a table in the Env. It is currently limited to\n     * 4095 different enumerated type identifiers.\n     * For a non-array type, this maps directly to the identity of the enum.\n     * For an array type, it maps to a tuple of enum identities.\n     *\/\n    unsigned int _enumId : 12;\n    \/\/\/ Number of array dimensions\n    int _dim : 7;\n  public:\n    \/\/\/ Default constructor\n    Type(void) : _ti(TI_PAR), _bt(BT_UNKNOWN), _st(ST_PLAIN),\n                 _ot(OT_PRESENT), _cv(CV_NO), _enumId(0), _dim(0) {}\n    \n    \/\/\/ Access type-inst\n    TypeInst ti(void) const { return static_cast<TypeInst>(_ti); }\n    \/\/\/ Set type-inst\n    void ti(const TypeInst& t) {\n      _ti = t;\n      if (t==TI_VAR)\n        _cv=CV_YES;\n    }\n\n    \/\/\/ Access basic type\n    BaseType bt(void) const { return static_cast<BaseType>(_bt); }\n    \/\/\/ Set basic type\n    void bt(const BaseType& b) { _bt = b; }\n    \n    \/\/\/ Access set type\n    SetType st(void) const { return static_cast<SetType>(_st); }\n    \/\/\/ Set set type\n    void st(const SetType& s) { _st = s; }\n    \n    \/\/\/ Access opt type\n    OptType ot(void) const { return static_cast<OptType>(_ot); }\n    \/\/\/ Set opt type\n    void ot(const OptType& o) { _ot = o; }\n    \n    \/\/\/ Access var-in-par type\n    bool cv(void) const { return static_cast<ContainsVarType>(_cv) == CV_YES; }\n    \/\/\/ Set var-in-par type\n    void cv(bool b) { _cv = b ? CV_YES : CV_NO; }\n    \n    \/\/\/ Access enum identifier\n    unsigned int enumId(void) const { return _enumId; }\n    \/\/\/ Set enum identifier\n    void enumId(unsigned int eid) { _enumId = eid; }\n    \n    \/\/\/ Access dimensions\n    int dim(void) const { return _dim; }\n    \/\/\/ Set dimensions\n    void dim(int d) { _dim = d; assert(_dim==d); }\n\n  protected:\n    \/\/\/ Constructor\n    Type(const TypeInst& ti, const BaseType& bt, const SetType& st,\n         unsigned int enumId, int dim)\n    : _ti(ti), _bt(bt), _st(st), _ot(OT_PRESENT), _cv(ti==TI_VAR ? CV_YES : CV_NO)\n    , _enumId(enumId), _dim(dim) {}\n  public:\n    static Type parint(int dim=0) {\n      return Type(TI_PAR,BT_INT,ST_PLAIN,0,dim);\n    }\n    static Type parenum(unsigned int enumId, int dim=0) {\n      return Type(TI_PAR,BT_INT,ST_PLAIN,enumId,dim);\n    }\n    static Type parbool(int dim=0) {\n      return Type(TI_PAR,BT_BOOL,ST_PLAIN,0,dim);\n    }\n    static Type parfloat(int dim=0) {\n      return Type(TI_PAR,BT_FLOAT,ST_PLAIN,0,dim);\n    }\n    static Type parstring(int dim=0) {\n      return Type(TI_PAR,BT_STRING,ST_PLAIN,0,dim);\n    }\n    static Type ann(int dim=0) {\n      return Type(TI_PAR,BT_ANN,ST_PLAIN,0,dim);\n    }\n    static Type parsetint(int dim=0) {\n      return Type(TI_PAR,BT_INT,ST_SET,0,dim);\n    }\n    static Type parsetenum(unsigned int enumId, int dim=0) {\n      return Type(TI_PAR,BT_INT,ST_SET,enumId,dim);\n    }\n    static Type parsetbool(int dim=0) {\n      return Type(TI_PAR,BT_BOOL,ST_SET,0,dim);\n    }\n    static Type parsetfloat(int dim=0) {\n      return Type(TI_PAR,BT_FLOAT,ST_SET,0,dim);\n    }\n    static Type parsetstring(int dim=0) {\n      return Type(TI_PAR,BT_STRING,ST_SET,0,dim);\n    }\n    static Type varint(int dim=0) {\n      return Type(TI_VAR,BT_INT,ST_PLAIN,0,dim);\n    }\n    static Type varenumint(unsigned int enumId, int dim=0) {\n      return Type(TI_VAR,BT_INT,ST_PLAIN,enumId,dim);\n    }\n    static Type varbool(int dim=0) {\n      return Type(TI_VAR,BT_BOOL,ST_PLAIN,0,dim);\n    }\n    static Type varfloat(int dim=0) {\n      return Type(TI_VAR,BT_FLOAT,ST_PLAIN,0,dim);\n    }\n    static Type varsetint(int dim=0) {\n      return Type(TI_VAR,BT_INT,ST_SET,0,dim);\n    }\n    static Type varbot(int dim=0) {\n      return Type(TI_VAR,BT_BOT,ST_PLAIN,0,dim);\n    }\n    static Type bot(int dim=0) {\n      return Type(TI_PAR,BT_BOT,ST_PLAIN,0,dim);\n    }\n    static Type top(int dim=0) {\n      return Type(TI_PAR,BT_TOP,ST_PLAIN,0,dim);\n    }\n    static Type vartop(int dim=0) {\n      return Type(TI_VAR,BT_TOP,ST_PLAIN,0,dim);\n    }\n    static Type optvartop(int dim=0) {\n      Type t(TI_VAR,BT_TOP,ST_PLAIN,0,dim);\n      t._ot = OT_OPTIONAL;\n      return t;\n    }\n\n    static Type unboxedint;\n    \n    bool isunknown(void) const { return _bt==BT_UNKNOWN; }\n    bool isplain(void) const {\n      return _dim==0 && _st==ST_PLAIN && _ot==OT_PRESENT;\n    }\n    bool isint(void) const { return _dim==0 && _st==ST_PLAIN && _bt==BT_INT; }\n    bool isbot(void) const { return _bt==BT_BOT; }\n    bool isfloat(void) const { return _dim==0 && _st==ST_PLAIN && _bt==BT_FLOAT; }\n    bool isbool(void) const { return _dim==0 && _st==ST_PLAIN && _bt==BT_BOOL; }\n    bool isstring(void) const { return isplain() && _bt==BT_STRING; }\n    bool isvar(void) const { return _ti!=TI_PAR; }\n    bool isvarbool(void) const { return _ti==TI_VAR && _dim==0 && _st==ST_PLAIN && _bt==BT_BOOL && _ot==OT_PRESENT; }\n    bool isvarfloat(void) const { return _ti==TI_VAR && _dim==0 && _st==ST_PLAIN && _bt==BT_FLOAT && _ot==OT_PRESENT; }\n    bool isvarint(void) const { return _ti==TI_VAR && _dim==0 && _st==ST_PLAIN && _bt==BT_INT && _ot==OT_PRESENT; }\n    bool ispar(void) const { return _ti==TI_PAR; }\n    bool isopt(void) const { return _ot==OT_OPTIONAL; }\n    bool ispresent(void) const { return _ot==OT_PRESENT; }\n    bool is_set(void) const { return _dim==0 && _st==ST_SET; }\n    bool isintset(void) const {\n      return is_set() && (_bt==BT_INT || _bt==BT_BOT);\n    }\n    bool isboolset(void) const {\n      return is_set() && (_bt==BT_BOOL || _bt==BT_BOT);\n    }\n    bool isfloatset(void) const {\n      return is_set() && (_bt==BT_FLOAT || _bt==BT_BOT);\n    }\n    bool isann(void) const { return isplain() && _bt==BT_ANN; }\n    bool isintarray(void) const {\n      return _dim==1 && _st==ST_PLAIN && _ot==OT_PRESENT && _bt==BT_INT;\n    }\n    bool isboolarray(void) const {\n      return _dim==1 && _st==ST_PLAIN && _ot==OT_PRESENT && _bt==BT_BOOL;\n    }\n    bool isintsetarray(void) const {\n      return _dim==1 && _st==ST_SET && _bt==BT_INT;\n    }\n\n    bool operator== (const Type& t) const {\n      return _ti==t._ti && _bt==t._bt && _st==t._st &&\n             _ot==t._ot && _dim==t._dim;\n    }\n    bool operator!= (const Type& t) const {\n      return !this->operator==(t);\n    }\n  \/\/ protected:\n\n    int toInt(void) const {\n      return\n      + ((1-static_cast<int>(_st))<<28)\n      + (static_cast<int>(_bt)<<24)\n      + (static_cast<int>(_ti)<<21)\n      + (static_cast<int>(_ot)<<20)\n      + (static_cast<int>(_enumId)<<8)\n      + (_dim == -1 ? 1 : (_dim == 0 ? 0 : _dim+1));\n    }\n    static Type fromInt(int i) {\n      Type t;\n      t._st = 1-static_cast<SetType>((i >> 28) & 0x1);\n      t._bt = static_cast<BaseType>((i >> 24) & 0xF);\n      t._ti = static_cast<TypeInst>((i >> 21) & 0x7);\n      t._ot = static_cast<OptType>((i >> 20) & 0x1);\n      t._enumId = static_cast<unsigned int>((i >> 8) & 0xFFF);\n      int dim = (i & 0x7F);\n      t._dim =  (dim == 0 ? 0 : (dim==1 ? -1 : dim-1));\n      return t;\n    }\n    std::string toString(EnvI& env) const;\n    std::string nonEnumToString(void) const;\n  public:\n    \/\/\/ Check if \\a bt0 is a subtype of \\a bt1\n    static bool bt_subtype(const Type& t0, const Type& t1) {\n      if (t0.bt() == t1.bt() && (t0.enumId() == t1.enumId() || t1.enumId()==0))\n        return true;\n      switch (t0.bt()) {\n        case BT_BOOL: return (t1.bt()==BT_INT || t1.bt()==BT_FLOAT);\n        case BT_INT: return t1.bt()==BT_FLOAT;\n        default: return false;\n      }\n    }\n\n    \/\/\/ Check if this type is a subtype of \\a t\n    bool isSubtypeOf(const Type& t) const {\n      if (_dim==0 && t._dim!=0 && _st==ST_SET && t._st==ST_PLAIN &&\n          ( bt()==BT_BOT || bt_subtype(*this, t) || t.bt()==BT_TOP) && _ti==TI_PAR &&\n          (_ot==OT_PRESENT || _ot==t._ot) )\n        return true;\n      \/\/ either same dimension or t has variable dimension\n      if (_dim!=t._dim && (_dim==0 || t._dim!=-1))\n        return false;\n      \/\/ same type, this is present or both optional\n      if (_ti==t._ti && bt_subtype(*this,t) && _st==t._st)\n        return _ot==OT_PRESENT || _ot==t._ot;\n      \/\/ this is par other than that same type as t\n      if (_ti==TI_PAR && bt_subtype(*this,t) && _st==t._st)\n        return _ot==OT_PRESENT || _ot==t._ot;\n      if ( _ti==TI_PAR && t._bt==BT_BOT)\n        return true;\n      if ((_ti==t._ti || _ti==TI_PAR) && _bt==BT_BOT && (_st==t._st || _st==ST_PLAIN))\n        return _ot==OT_PRESENT || _ot==t._ot;\n      if (t._bt==BT_TOP && (_ot==OT_PRESENT || _ot==t._ot) &&\n          (t._st==ST_PLAIN || _st==t._st) &&\n          (_ti==TI_PAR || t._ti==TI_VAR))\n        return true;\n      return false;\n    }\n\n    \/\/\/ Compare types\n    int cmp(const Type& t) const {\n      return toInt()<t.toInt() ? -1 : (toInt()>t.toInt() ? 1 : 0);\n    }\n\n  };\n  \n};\n\n#endif\n<commit_msg>Fix subtype check for arrays of enums<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_TYPE_HH__\n#define __MINIZINC_TYPE_HH__\n\n#include <string>\n#include <sstream>\n#include <cassert>\n\nnamespace MiniZinc {\n\n  class EnvI;\n  \n  \/\/\/ Type of a MiniZinc expression\n  class Type {\n  public:\n    \/\/\/ Type-inst\n    enum TypeInst { TI_PAR, TI_VAR };\n    \/\/\/ Basic type\n    enum BaseType { BT_TOP, BT_BOOL, BT_INT, BT_FLOAT, BT_STRING, BT_ANN,\n                    BT_BOT, BT_UNKNOWN };\n    \/\/\/ Whether the expression is plain or set\n    enum SetType { ST_PLAIN, ST_SET };\n    \/\/\/ Whether the expression is normal or optional\n    enum OptType { OT_PRESENT, OT_OPTIONAL };\n    \/\/\/ Whether the par expression contains a var argument\n    enum ContainsVarType { CV_NO, CV_YES };\n  private:\n    unsigned int _ti : 1;\n    unsigned int _bt : 4;\n    unsigned int _st  : 1;\n    unsigned int _ot  : 1;\n    unsigned int _cv  : 1;\n    \/** \\brief Enumerated type identifier\n     * This is an index into a table in the Env. It is currently limited to\n     * 4095 different enumerated type identifiers.\n     * For a non-array type, this maps directly to the identity of the enum.\n     * For an array type, it maps to a tuple of enum identities.\n     *\/\n    unsigned int _enumId : 12;\n    \/\/\/ Number of array dimensions\n    int _dim : 7;\n  public:\n    \/\/\/ Default constructor\n    Type(void) : _ti(TI_PAR), _bt(BT_UNKNOWN), _st(ST_PLAIN),\n                 _ot(OT_PRESENT), _cv(CV_NO), _enumId(0), _dim(0) {}\n    \n    \/\/\/ Access type-inst\n    TypeInst ti(void) const { return static_cast<TypeInst>(_ti); }\n    \/\/\/ Set type-inst\n    void ti(const TypeInst& t) {\n      _ti = t;\n      if (t==TI_VAR)\n        _cv=CV_YES;\n    }\n\n    \/\/\/ Access basic type\n    BaseType bt(void) const { return static_cast<BaseType>(_bt); }\n    \/\/\/ Set basic type\n    void bt(const BaseType& b) { _bt = b; }\n    \n    \/\/\/ Access set type\n    SetType st(void) const { return static_cast<SetType>(_st); }\n    \/\/\/ Set set type\n    void st(const SetType& s) { _st = s; }\n    \n    \/\/\/ Access opt type\n    OptType ot(void) const { return static_cast<OptType>(_ot); }\n    \/\/\/ Set opt type\n    void ot(const OptType& o) { _ot = o; }\n    \n    \/\/\/ Access var-in-par type\n    bool cv(void) const { return static_cast<ContainsVarType>(_cv) == CV_YES; }\n    \/\/\/ Set var-in-par type\n    void cv(bool b) { _cv = b ? CV_YES : CV_NO; }\n    \n    \/\/\/ Access enum identifier\n    unsigned int enumId(void) const { return _enumId; }\n    \/\/\/ Set enum identifier\n    void enumId(unsigned int eid) { _enumId = eid; }\n    \n    \/\/\/ Access dimensions\n    int dim(void) const { return _dim; }\n    \/\/\/ Set dimensions\n    void dim(int d) { _dim = d; assert(_dim==d); }\n\n  protected:\n    \/\/\/ Constructor\n    Type(const TypeInst& ti, const BaseType& bt, const SetType& st,\n         unsigned int enumId, int dim)\n    : _ti(ti), _bt(bt), _st(st), _ot(OT_PRESENT), _cv(ti==TI_VAR ? CV_YES : CV_NO)\n    , _enumId(enumId), _dim(dim) {}\n  public:\n    static Type parint(int dim=0) {\n      return Type(TI_PAR,BT_INT,ST_PLAIN,0,dim);\n    }\n    static Type parenum(unsigned int enumId, int dim=0) {\n      return Type(TI_PAR,BT_INT,ST_PLAIN,enumId,dim);\n    }\n    static Type parbool(int dim=0) {\n      return Type(TI_PAR,BT_BOOL,ST_PLAIN,0,dim);\n    }\n    static Type parfloat(int dim=0) {\n      return Type(TI_PAR,BT_FLOAT,ST_PLAIN,0,dim);\n    }\n    static Type parstring(int dim=0) {\n      return Type(TI_PAR,BT_STRING,ST_PLAIN,0,dim);\n    }\n    static Type ann(int dim=0) {\n      return Type(TI_PAR,BT_ANN,ST_PLAIN,0,dim);\n    }\n    static Type parsetint(int dim=0) {\n      return Type(TI_PAR,BT_INT,ST_SET,0,dim);\n    }\n    static Type parsetenum(unsigned int enumId, int dim=0) {\n      return Type(TI_PAR,BT_INT,ST_SET,enumId,dim);\n    }\n    static Type parsetbool(int dim=0) {\n      return Type(TI_PAR,BT_BOOL,ST_SET,0,dim);\n    }\n    static Type parsetfloat(int dim=0) {\n      return Type(TI_PAR,BT_FLOAT,ST_SET,0,dim);\n    }\n    static Type parsetstring(int dim=0) {\n      return Type(TI_PAR,BT_STRING,ST_SET,0,dim);\n    }\n    static Type varint(int dim=0) {\n      return Type(TI_VAR,BT_INT,ST_PLAIN,0,dim);\n    }\n    static Type varenumint(unsigned int enumId, int dim=0) {\n      return Type(TI_VAR,BT_INT,ST_PLAIN,enumId,dim);\n    }\n    static Type varbool(int dim=0) {\n      return Type(TI_VAR,BT_BOOL,ST_PLAIN,0,dim);\n    }\n    static Type varfloat(int dim=0) {\n      return Type(TI_VAR,BT_FLOAT,ST_PLAIN,0,dim);\n    }\n    static Type varsetint(int dim=0) {\n      return Type(TI_VAR,BT_INT,ST_SET,0,dim);\n    }\n    static Type varbot(int dim=0) {\n      return Type(TI_VAR,BT_BOT,ST_PLAIN,0,dim);\n    }\n    static Type bot(int dim=0) {\n      return Type(TI_PAR,BT_BOT,ST_PLAIN,0,dim);\n    }\n    static Type top(int dim=0) {\n      return Type(TI_PAR,BT_TOP,ST_PLAIN,0,dim);\n    }\n    static Type vartop(int dim=0) {\n      return Type(TI_VAR,BT_TOP,ST_PLAIN,0,dim);\n    }\n    static Type optvartop(int dim=0) {\n      Type t(TI_VAR,BT_TOP,ST_PLAIN,0,dim);\n      t._ot = OT_OPTIONAL;\n      return t;\n    }\n\n    static Type unboxedint;\n    \n    bool isunknown(void) const { return _bt==BT_UNKNOWN; }\n    bool isplain(void) const {\n      return _dim==0 && _st==ST_PLAIN && _ot==OT_PRESENT;\n    }\n    bool isint(void) const { return _dim==0 && _st==ST_PLAIN && _bt==BT_INT; }\n    bool isbot(void) const { return _bt==BT_BOT; }\n    bool isfloat(void) const { return _dim==0 && _st==ST_PLAIN && _bt==BT_FLOAT; }\n    bool isbool(void) const { return _dim==0 && _st==ST_PLAIN && _bt==BT_BOOL; }\n    bool isstring(void) const { return isplain() && _bt==BT_STRING; }\n    bool isvar(void) const { return _ti!=TI_PAR; }\n    bool isvarbool(void) const { return _ti==TI_VAR && _dim==0 && _st==ST_PLAIN && _bt==BT_BOOL && _ot==OT_PRESENT; }\n    bool isvarfloat(void) const { return _ti==TI_VAR && _dim==0 && _st==ST_PLAIN && _bt==BT_FLOAT && _ot==OT_PRESENT; }\n    bool isvarint(void) const { return _ti==TI_VAR && _dim==0 && _st==ST_PLAIN && _bt==BT_INT && _ot==OT_PRESENT; }\n    bool ispar(void) const { return _ti==TI_PAR; }\n    bool isopt(void) const { return _ot==OT_OPTIONAL; }\n    bool ispresent(void) const { return _ot==OT_PRESENT; }\n    bool is_set(void) const { return _dim==0 && _st==ST_SET; }\n    bool isintset(void) const {\n      return is_set() && (_bt==BT_INT || _bt==BT_BOT);\n    }\n    bool isboolset(void) const {\n      return is_set() && (_bt==BT_BOOL || _bt==BT_BOT);\n    }\n    bool isfloatset(void) const {\n      return is_set() && (_bt==BT_FLOAT || _bt==BT_BOT);\n    }\n    bool isann(void) const { return isplain() && _bt==BT_ANN; }\n    bool isintarray(void) const {\n      return _dim==1 && _st==ST_PLAIN && _ot==OT_PRESENT && _bt==BT_INT;\n    }\n    bool isboolarray(void) const {\n      return _dim==1 && _st==ST_PLAIN && _ot==OT_PRESENT && _bt==BT_BOOL;\n    }\n    bool isintsetarray(void) const {\n      return _dim==1 && _st==ST_SET && _bt==BT_INT;\n    }\n\n    bool operator== (const Type& t) const {\n      return _ti==t._ti && _bt==t._bt && _st==t._st &&\n             _ot==t._ot && _dim==t._dim;\n    }\n    bool operator!= (const Type& t) const {\n      return !this->operator==(t);\n    }\n  \/\/ protected:\n\n    int toInt(void) const {\n      return\n      + ((1-static_cast<int>(_st))<<28)\n      + (static_cast<int>(_bt)<<24)\n      + (static_cast<int>(_ti)<<21)\n      + (static_cast<int>(_ot)<<20)\n      + (static_cast<int>(_enumId)<<8)\n      + (_dim == -1 ? 1 : (_dim == 0 ? 0 : _dim+1));\n    }\n    static Type fromInt(int i) {\n      Type t;\n      t._st = 1-static_cast<SetType>((i >> 28) & 0x1);\n      t._bt = static_cast<BaseType>((i >> 24) & 0xF);\n      t._ti = static_cast<TypeInst>((i >> 21) & 0x7);\n      t._ot = static_cast<OptType>((i >> 20) & 0x1);\n      t._enumId = static_cast<unsigned int>((i >> 8) & 0xFFF);\n      int dim = (i & 0x7F);\n      t._dim =  (dim == 0 ? 0 : (dim==1 ? -1 : dim-1));\n      return t;\n    }\n    std::string toString(EnvI& env) const;\n    std::string nonEnumToString(void) const;\n  public:\n    \/\/\/ Check if \\a bt0 is a subtype of \\a bt1\n    static bool bt_subtype(const Type& t0, const Type& t1) {\n      if (t0.bt() == t1.bt() && (t0.dim() != 0 || (t0.enumId() == t1.enumId() || t1.enumId()==0)))\n        return true;\n      switch (t0.bt()) {\n        case BT_BOOL: return (t1.bt()==BT_INT || t1.bt()==BT_FLOAT);\n        case BT_INT: return t1.bt()==BT_FLOAT;\n        default: return false;\n      }\n    }\n\n    \/\/\/ Check if this type is a subtype of \\a t\n    bool isSubtypeOf(const Type& t) const {\n      if (_dim==0 && t._dim!=0 && _st==ST_SET && t._st==ST_PLAIN &&\n          ( bt()==BT_BOT || bt_subtype(*this, t) || t.bt()==BT_TOP) && _ti==TI_PAR &&\n          (_ot==OT_PRESENT || _ot==t._ot) )\n        return true;\n      \/\/ either same dimension or t has variable dimension\n      if (_dim!=t._dim && (_dim==0 || t._dim!=-1))\n        return false;\n      \/\/ same type, this is present or both optional\n      if (_ti==t._ti && bt_subtype(*this,t) && _st==t._st)\n        return _ot==OT_PRESENT || _ot==t._ot;\n      \/\/ this is par other than that same type as t\n      if (_ti==TI_PAR && bt_subtype(*this,t) && _st==t._st)\n        return _ot==OT_PRESENT || _ot==t._ot;\n      if ( _ti==TI_PAR && t._bt==BT_BOT)\n        return true;\n      if ((_ti==t._ti || _ti==TI_PAR) && _bt==BT_BOT && (_st==t._st || _st==ST_PLAIN))\n        return _ot==OT_PRESENT || _ot==t._ot;\n      if (t._bt==BT_TOP && (_ot==OT_PRESENT || _ot==t._ot) &&\n          (t._st==ST_PLAIN || _st==t._st) &&\n          (_ti==TI_PAR || t._ti==TI_VAR))\n        return true;\n      return false;\n    }\n\n    \/\/\/ Compare types\n    int cmp(const Type& t) const {\n      return toInt()<t.toInt() ? -1 : (toInt()>t.toInt() ? 1 : 0);\n    }\n\n  };\n  \n};\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/**\r\n *\r\n * @file ESP8266WiFiMulti.cpp\r\n * @date 16.05.2015\r\n * @author Markus Sattler\r\n *\r\n * Copyright (c) 2015 Markus Sattler. All rights reserved.\r\n * This file is part of the esp8266 core for Arduino environment.\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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA\r\n *\r\n *\/\r\n\r\n#include \"ESP8266WiFiMulti.h\"\r\n#include <limits.h>\r\n\r\nESP8266WiFiMulti::ESP8266WiFiMulti() {\r\n}\r\n\r\nESP8266WiFiMulti::~ESP8266WiFiMulti() {\r\n    APlistClean();\r\n}\r\n\r\nbool ESP8266WiFiMulti::addAP(const char* ssid, const char *passphrase) {\r\n    return APlistAdd(ssid, passphrase);\r\n}\r\n\r\nwl_status_t ESP8266WiFiMulti::run(void) {\r\n\r\n    wl_status_t status = WiFi.status();\r\n    if(status == WL_DISCONNECTED || status == WL_NO_SSID_AVAIL || status == WL_IDLE_STATUS || status == WL_CONNECT_FAILED) {\r\n\r\n        WifiAPlist_t bestNetwork { NULL, NULL };\r\n        int bestNetworkDb = INT_MIN;\r\n        uint8 bestBSSID[6];\r\n        int32_t bestChannel;\r\n\r\n        DEBUG_WIFI_MULTI(\"[WIFI] delete old wifi config...\\n\");\r\n        WiFi.disconnect();\r\n\r\n        DEBUG_WIFI_MULTI(\"[WIFI] start scan\\n\");\r\n        \/\/ WiFi.scanNetworks will return the number of networks found\r\n        int8_t n = WiFi.scanNetworks();\r\n\r\n        DEBUG_WIFI_MULTI(\"[WIFI] scan done\\n\");\r\n        delay(0);\r\n\r\n        if(n <= 0) {\r\n            DEBUG_WIFI_MULTI(\"[WIFI] no networks found\\n\");\r\n        } else {\r\n            DEBUG_WIFI_MULTI(\"[WIFI] %d networks found\\n\", n);\r\n            for(int8_t i = 0; i < n; ++i) {\r\n\r\n                String ssid_scan;\r\n                int32_t rssi_scan;\r\n                uint8_t sec_scan;\r\n                uint8_t* BSSID_scan;\r\n                int32_t chan_scan;\r\n                bool hidden_scan;\r\n\r\n                WiFi.getNetworkInfo(i, ssid_scan, sec_scan, rssi_scan, BSSID_scan, chan_scan, hidden_scan);\r\n\r\n\r\n                bool known = false;\r\n                for(uint32_t x = 0; x < APlist.size(); x++) {\r\n                    WifiAPlist_t entry = APlist[x];\r\n\r\n                    if(ssid_scan == entry.ssid) { \/\/ SSID match\r\n                        known = true;\r\n                        if(rssi_scan > bestNetworkDb) { \/\/ best network\r\n                            if(sec_scan == ENC_TYPE_NONE || entry.passphrase) { \/\/ check for passphrase if not open wlan\r\n                                bestNetworkDb = rssi_scan;\r\n                                bestChannel = chan_scan;\r\n                                memcpy((void*) &bestNetwork, (void*) &entry, sizeof(bestNetwork));\r\n                                memcpy((void*) &bestBSSID, (void*) BSSID_scan, sizeof(bestBSSID));\r\n                            }\r\n                        }\r\n                        break;\r\n                    }\r\n                }\r\n\r\n                if(known) {\r\n                    DEBUG_WIFI_MULTI(\" ---> \");\r\n                } else {\r\n                    DEBUG_WIFI_MULTI(\"      \");\r\n                }\r\n\r\n                DEBUG_WIFI_MULTI(\" %d: [%d][%02X:%02X:%02X:%02X:%02X:%02X] %s (%d) %c\\n\", i, chan_scan, BSSID_scan[0], BSSID_scan[1], BSSID_scan[2], BSSID_scan[3], BSSID_scan[4], BSSID_scan[5], ssid_scan.c_str(), rssi_scan, (sec_scan == ENC_TYPE_NONE) ? ' ' : '*');\r\n                delay(0);\r\n            }\r\n        }\r\n\r\n        DEBUG_WIFI_MULTI(\"\\n\\n\");\r\n        delay(0);\r\n\r\n        if(bestNetwork.ssid) {\r\n            DEBUG_WIFI_MULTI(\"[WIFI] Connecting BSSID: %02X:%02X:%02X:%02X:%02X:%02X SSID: %s Channal: %d (%d)\\n\", bestBSSID[0], bestBSSID[1], bestBSSID[2], bestBSSID[3], bestBSSID[4], bestBSSID[5], bestNetwork.ssid, bestChannel, bestNetworkDb);\r\n\r\n            WiFi.begin(bestNetwork.ssid, bestNetwork.passphrase, bestChannel, bestBSSID);\r\n            status = WiFi.status();\r\n\r\n            \/\/ wait for connection or fail\r\n            while(status != WL_CONNECTED && status != WL_NO_SSID_AVAIL && status != WL_CONNECT_FAILED) {\r\n                delay(10);\r\n                status = WiFi.status();\r\n            }\r\n\r\n            IPAddress ip;\r\n            uint8_t * mac;\r\n            switch(status) {\r\n                case WL_CONNECTED:\r\n                    ip = WiFi.localIP();\r\n                    mac = WiFi.BSSID();\r\n                    DEBUG_WIFI_MULTI(\"[WIFI] Connecting done.\\n\");\r\n                    DEBUG_WIFI_MULTI(\"[WIFI] SSID: %s\\n\", WiFi.SSID());\r\n                    DEBUG_WIFI_MULTI(\"[WIFI] IP: %d.%d.%d.%d\\n\", ip[0], ip[1], ip[2], ip[3]);\r\n                    DEBUG_WIFI_MULTI(\"[WIFI] MAC: %02X:%02X:%02X:%02X:%02X:%02X\\n\", mac[0], mac[1], mac[2], mac[3], mac[4], mac[5]);\r\n                    DEBUG_WIFI_MULTI(\"[WIFI] Channel: %d\\n\", WiFi.channel());\r\n                    break;\r\n                case WL_NO_SSID_AVAIL:\r\n                    DEBUG_WIFI_MULTI(\"[WIFI] Connecting Faild AP not found.\\n\");\r\n                    break;\r\n                case WL_CONNECT_FAILED:\r\n                    DEBUG_WIFI_MULTI(\"[WIFI] Connecting Faild.\\n\");\r\n                    break;\r\n                default:\r\n                    DEBUG_WIFI_MULTI(\"[WIFI] Connecting Faild (%d).\\n\", status);\r\n                    break;\r\n            }\r\n        } else {\r\n            DEBUG_WIFI_MULTI(\"[WIFI] no matching wifi found!\\n\");\r\n        }\r\n    }\r\n    return status;\r\n}\r\n\r\n\/\/ ##################################################################################\r\n\r\nbool ESP8266WiFiMulti::APlistAdd(const char* ssid, const char *passphrase) {\r\n\r\n    WifiAPlist_t newAP;\r\n\r\n    newAP.ssid = (char*) malloc(strlen(ssid));\r\n\r\n    if(!newAP.ssid) {\r\n        return false;\r\n    }\r\n\r\n    strcpy(newAP.ssid, ssid);\r\n\r\n    if(passphrase && *passphrase != 0x00) {\r\n        newAP.passphrase = (char*) malloc(strlen(passphrase));\r\n    }\r\n\r\n    if(!newAP.passphrase) {\r\n        free(newAP.ssid);\r\n        return false;\r\n    }\r\n\r\n    strcpy(newAP.passphrase, passphrase);\r\n\r\n    APlist.push_back(newAP);\r\n    return true;\r\n}\r\n\r\nvoid ESP8266WiFiMulti::APlistClean(void) {\r\n    for(uint32_t i = 0; i < APlist.size(); i++) {\r\n        WifiAPlist_t entry = APlist[i];\r\n        if(entry.ssid) {\r\n            free(entry.ssid);\r\n        }\r\n        if(entry.passphrase) {\r\n            free(entry.passphrase);\r\n        }\r\n    }\r\n    APlist.clear();\r\n}\r\n\r\n<commit_msg>fix #386<commit_after>\/**\r\n *\r\n * @file ESP8266WiFiMulti.cpp\r\n * @date 16.05.2015\r\n * @author Markus Sattler\r\n *\r\n * Copyright (c) 2015 Markus Sattler. All rights reserved.\r\n * This file is part of the esp8266 core for Arduino environment.\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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA\r\n *\r\n *\/\r\n\r\n#include \"ESP8266WiFiMulti.h\"\r\n#include <limits.h>\r\n\r\nESP8266WiFiMulti::ESP8266WiFiMulti() {\r\n}\r\n\r\nESP8266WiFiMulti::~ESP8266WiFiMulti() {\r\n    APlistClean();\r\n}\r\n\r\nbool ESP8266WiFiMulti::addAP(const char* ssid, const char *passphrase) {\r\n    return APlistAdd(ssid, passphrase);\r\n}\r\n\r\nwl_status_t ESP8266WiFiMulti::run(void) {\r\n\r\n    wl_status_t status = WiFi.status();\r\n    if(status == WL_DISCONNECTED || status == WL_NO_SSID_AVAIL || status == WL_IDLE_STATUS || status == WL_CONNECT_FAILED) {\r\n\r\n        WifiAPlist_t bestNetwork { NULL, NULL };\r\n        int bestNetworkDb = INT_MIN;\r\n        uint8 bestBSSID[6];\r\n        int32_t bestChannel;\r\n\r\n        DEBUG_WIFI_MULTI(\"[WIFI] delete old wifi config...\\n\");\r\n        WiFi.disconnect();\r\n\r\n        DEBUG_WIFI_MULTI(\"[WIFI] start scan\\n\");\r\n        \/\/ WiFi.scanNetworks will return the number of networks found\r\n        int8_t n = WiFi.scanNetworks();\r\n\r\n        DEBUG_WIFI_MULTI(\"[WIFI] scan done\\n\");\r\n        delay(0);\r\n\r\n        if(n <= 0) {\r\n            DEBUG_WIFI_MULTI(\"[WIFI] no networks found\\n\");\r\n        } else {\r\n            DEBUG_WIFI_MULTI(\"[WIFI] %d networks found\\n\", n);\r\n            for(int8_t i = 0; i < n; ++i) {\r\n\r\n                String ssid_scan;\r\n                int32_t rssi_scan;\r\n                uint8_t sec_scan;\r\n                uint8_t* BSSID_scan;\r\n                int32_t chan_scan;\r\n                bool hidden_scan;\r\n\r\n                WiFi.getNetworkInfo(i, ssid_scan, sec_scan, rssi_scan, BSSID_scan, chan_scan, hidden_scan);\r\n\r\n                bool known = false;\r\n                for(uint32_t x = 0; x < APlist.size(); x++) {\r\n                    WifiAPlist_t entry = APlist[x];\r\n\r\n                    if(ssid_scan == entry.ssid) { \/\/ SSID match\r\n                        known = true;\r\n                        if(rssi_scan > bestNetworkDb) { \/\/ best network\r\n                            if(sec_scan == ENC_TYPE_NONE || entry.passphrase) { \/\/ check for passphrase if not open wlan\r\n                                bestNetworkDb = rssi_scan;\r\n                                bestChannel = chan_scan;\r\n                                memcpy((void*) &bestNetwork, (void*) &entry, sizeof(bestNetwork));\r\n                                memcpy((void*) &bestBSSID, (void*) BSSID_scan, sizeof(bestBSSID));\r\n                            }\r\n                        }\r\n                        break;\r\n                    }\r\n                }\r\n\r\n                if(known) {\r\n                    DEBUG_WIFI_MULTI(\" ---> \");\r\n                } else {\r\n                    DEBUG_WIFI_MULTI(\"      \");\r\n                }\r\n\r\n                DEBUG_WIFI_MULTI(\" %d: [%d][%02X:%02X:%02X:%02X:%02X:%02X] %s (%d) %c\\n\", i, chan_scan, BSSID_scan[0], BSSID_scan[1], BSSID_scan[2], BSSID_scan[3], BSSID_scan[4], BSSID_scan[5], ssid_scan.c_str(), rssi_scan, (sec_scan == ENC_TYPE_NONE) ? ' ' : '*');\r\n                delay(0);\r\n            }\r\n        }\r\n\r\n        DEBUG_WIFI_MULTI(\"\\n\\n\");\r\n        delay(0);\r\n\r\n        if(bestNetwork.ssid) {\r\n            DEBUG_WIFI_MULTI(\"[WIFI] Connecting BSSID: %02X:%02X:%02X:%02X:%02X:%02X SSID: %s Channal: %d (%d)\\n\", bestBSSID[0], bestBSSID[1], bestBSSID[2], bestBSSID[3], bestBSSID[4], bestBSSID[5], bestNetwork.ssid, bestChannel, bestNetworkDb);\r\n\r\n            WiFi.begin(bestNetwork.ssid, bestNetwork.passphrase, bestChannel, bestBSSID);\r\n            status = WiFi.status();\r\n\r\n            \/\/ wait for connection or fail\r\n            while(status != WL_CONNECTED && status != WL_NO_SSID_AVAIL && status != WL_CONNECT_FAILED) {\r\n                delay(10);\r\n                status = WiFi.status();\r\n            }\r\n\r\n            IPAddress ip;\r\n            uint8_t * mac;\r\n            switch(status) {\r\n                case WL_CONNECTED:\r\n                    ip = WiFi.localIP();\r\n                    mac = WiFi.BSSID();\r\n                    DEBUG_WIFI_MULTI(\"[WIFI] Connecting done.\\n\");\r\n                    DEBUG_WIFI_MULTI(\"[WIFI] SSID: %s\\n\", WiFi.SSID());\r\n                    DEBUG_WIFI_MULTI(\"[WIFI] IP: %d.%d.%d.%d\\n\", ip[0], ip[1], ip[2], ip[3]);\r\n                    DEBUG_WIFI_MULTI(\"[WIFI] MAC: %02X:%02X:%02X:%02X:%02X:%02X\\n\", mac[0], mac[1], mac[2], mac[3], mac[4], mac[5]);\r\n                    DEBUG_WIFI_MULTI(\"[WIFI] Channel: %d\\n\", WiFi.channel());\r\n                    break;\r\n                case WL_NO_SSID_AVAIL:\r\n                    DEBUG_WIFI_MULTI(\"[WIFI] Connecting Faild AP not found.\\n\");\r\n                    break;\r\n                case WL_CONNECT_FAILED:\r\n                    DEBUG_WIFI_MULTI(\"[WIFI] Connecting Faild.\\n\");\r\n                    break;\r\n                default:\r\n                    DEBUG_WIFI_MULTI(\"[WIFI] Connecting Faild (%d).\\n\", status);\r\n                    break;\r\n            }\r\n        } else {\r\n            DEBUG_WIFI_MULTI(\"[WIFI] no matching wifi found!\\n\");\r\n        }\r\n    }\r\n    return status;\r\n}\r\n\r\n\/\/ ##################################################################################\r\n\r\nbool ESP8266WiFiMulti::APlistAdd(const char* ssid, const char *passphrase) {\r\n\r\n    WifiAPlist_t newAP;\r\n\r\n    if(!ssid || strlen(ssid) > 31) {\r\n        \/\/ fail SSID to long or missing!\r\n        return false;\r\n    }\r\n\r\n    if(passphrase && strlen(passphrase) > 63) {\r\n        \/\/ fail passphrase to long!\r\n        return false;\r\n    }\r\n\r\n    newAP.ssid = (char*) malloc((strlen(ssid) + 1));\r\n\r\n    if(!newAP.ssid) {\r\n        return false;\r\n    }\r\n\r\n    strcpy(newAP.ssid, ssid);\r\n\r\n    if(passphrase && *passphrase != 0x00) {\r\n        newAP.passphrase = (char*) malloc((strlen(passphrase) + 1));\r\n        if(!newAP.passphrase) {\r\n            free(newAP.ssid);\r\n            return false;\r\n        }\r\n        strcpy(newAP.passphrase, passphrase);\r\n    }\r\n\r\n    APlist.push_back(newAP);\r\n    return true;\r\n}\r\n\r\nvoid ESP8266WiFiMulti::APlistClean(void) {\r\n    for(uint32_t i = 0; i < APlist.size(); i++) {\r\n        WifiAPlist_t entry = APlist[i];\r\n        if(entry.ssid) {\r\n            free(entry.ssid);\r\n        }\r\n        if(entry.passphrase) {\r\n            free(entry.passphrase);\r\n        }\r\n    }\r\n    APlist.clear();\r\n}\r\n\r\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 2.0.0, packaged on July 2010.\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 Lesser 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 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 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 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\/\/! \\file glc_bsrep.cpp implementation for the GLC_BSRep class.\n\n#include \"glc_bsrep.h\"\n#include \"..\/glc_fileformatexception.h\"\n#include \"..\/glc_tracelog.h\"\n\n\/\/ The binary rep suffix\nconst QString GLC_BSRep::m_Suffix(\"BSRep\");\n\n\/\/ The binary rep magic number\nconst QUuid GLC_BSRep::m_Uuid(\"{d6f97789-36a9-4c2e-b667-0e66c27f839f}\");\n\n\/\/ The binary rep version\nconst quint32 GLC_BSRep::m_Version= 102;\n\n\/\/ Mutex used by compression\nQMutex GLC_BSRep::m_CompressionMutex;\n\n\/\/ Default constructor\nGLC_BSRep::GLC_BSRep(const QString& fileName, bool useCompression)\n: m_FileInfo()\n, m_pFile(NULL)\n, m_DataStream()\n, m_UseCompression(useCompression)\n, m_CompressionLevel(-1)\n{\n\tsetAbsoluteFileName(fileName);\n\tm_DataStream.setVersion(QDataStream::Qt_4_6);\n\tm_DataStream.setFloatingPointPrecision(QDataStream::SinglePrecision);\n}\n\n\/\/ Copy constructor\nGLC_BSRep::GLC_BSRep(const GLC_BSRep& binaryRep)\n: m_FileInfo(binaryRep.m_FileInfo)\n, m_pFile(NULL)\n, m_DataStream()\n, m_UseCompression(binaryRep.m_UseCompression)\n, m_CompressionLevel(binaryRep.m_CompressionLevel)\n{\n\tm_DataStream.setVersion(QDataStream::Qt_4_6);\n\tm_DataStream.setFloatingPointPrecision(binaryRep.m_DataStream.floatingPointPrecision());\n}\n\nGLC_BSRep::~GLC_BSRep()\n{\n\tdelete m_pFile;\n}\n\n\/\/ Return true if the binary rep is up to date\nbool GLC_BSRep::isUsable(const QDateTime& timeStamp)\n{\n\tbool isUpToDate= false;\n\tif (open(QIODevice::ReadOnly))\n\t{\n\t\tif (headerIsOk())\n\t\t{\n\t\t\tisUpToDate= timeStampOk(timeStamp);\n\t\t\tisUpToDate= isUpToDate && close();\n\t\t}\n\t}\n\telse\n\t{\n\t\tQString message(QString(\"GLC_BSRep::loadRep Enable to open the file \") + m_FileInfo.fileName());\n\t\tGLC_FileFormatException fileFormatException(message, m_FileInfo.fileName(), GLC_FileFormatException::FileNotFound);\n\t\tclose();\n\t\tthrow(fileFormatException);\n\t}\n\n\tif (!isUpToDate && GLC_TraceLog::isEnable())\n\t{\n\t\tQStringList stringList(\"GLC_BSRep::isUsable\");\n\t\tstringList.append(\"File \" + m_FileInfo.filePath() + \" not Usable\");\n\t\tGLC_TraceLog::addTrace(stringList);\n\t}\n\treturn isUpToDate;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ name Get Functions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Load the binary rep\nGLC_3DRep GLC_BSRep::loadRep()\n{\n\tGLC_3DRep loadedRep;\n\n\tif (open(QIODevice::ReadOnly))\n\t{\n\t\tif (headerIsOk())\n\t\t{\n\t\t\ttimeStampOk(QDateTime());\n\t\t\tGLC_BoundingBox boundingBox;\n\t\t\tm_DataStream >> boundingBox;\n\t\t\tbool useCompression;\n\t\t\tm_DataStream >> useCompression;\n\t\t\tif (useCompression)\n\t\t\t{\n\t\t\t\tQByteArray CompresseBuffer;\n\t\t\t\tm_DataStream >> CompresseBuffer;\n\t\t\t\tQByteArray uncompressedBuffer= qUncompress(CompresseBuffer);\n\t\t\t\tCompresseBuffer.clear();\n\t\t\t\tQDataStream bufferStream(uncompressedBuffer);\n\t\t\t\tbufferStream >> loadedRep;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tm_DataStream >> loadedRep;\n\t\t\t}\n\n\t\t\tif (!close())\n\t\t\t{\n\t\t\t\tQString message(QString(\"GLC_BSRep::loadRep An error occur when loading file \") + m_FileInfo.fileName());\n\t\t\t\tGLC_FileFormatException fileFormatException(message, m_FileInfo.fileName(), GLC_FileFormatException::WrongFileFormat);\n\t\t\t\tthrow(fileFormatException);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tQString message(QString(\"GLC_BSRep::loadRep File not supported \") + m_FileInfo.fileName());\n\t\t\tGLC_FileFormatException fileFormatException(message, m_FileInfo.fileName(), GLC_FileFormatException::FileNotSupported);\n\t\t\tclose();\n\t\t\tthrow(fileFormatException);\n\t\t}\n\t}\n\telse\n\t{\n\t\tQString message(QString(\"GLC_BSRep::loadRep Enable to open the file \") + m_FileInfo.fileName());\n\t\tGLC_FileFormatException fileFormatException(message, m_FileInfo.fileName(), GLC_FileFormatException::FileNotFound);\n\t\tclose();\n\t\tthrow(fileFormatException);\n\t}\n\n\n\treturn loadedRep;\n}\n\n\/\/ Return the bounding box of the binary representation\nGLC_BoundingBox GLC_BSRep::boundingBox()\n{\n\tGLC_BoundingBox boundingBox;\n\n\tif (open(QIODevice::ReadOnly))\n\t{\n\t\tif (headerIsOk())\n\t\t{\n\t\t\ttimeStampOk(QDateTime());\n\n\t\t\tm_DataStream >> boundingBox;\n\t\t}\n\t}\n\treturn boundingBox;\n}\n\n\/\/ Return bsrep suffix\nQString GLC_BSRep::suffix()\n{\n\treturn m_Suffix;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/name Set Functions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Set the binary representation file name\nvoid GLC_BSRep::setAbsoluteFileName(const QString& fileName)\n{\n\tm_FileInfo.setFile(fileName);\n\tif (m_FileInfo.suffix() != m_Suffix)\n\t{\n\t\tm_FileInfo.setFile(fileName + '.' + m_Suffix);\n\t}\n\n}\n\n\/\/ Save the GLC_3DRep in serialised binary\nbool GLC_BSRep::save(const GLC_3DRep& rep)\n{\n\n\t\/\/! Check if the currentFileInfo is valid and writable\n\tbool saveOk= open(QIODevice::WriteOnly);\n\tif (saveOk)\n\t{\n\t\twriteHeader(rep.lastModified());\n\n\t\t\/\/ Representation Bounding Box\n\t\tm_DataStream << rep.boundingBox();\n\n\t\t\/\/ Compression usage\n\n\t\tif (m_UseCompression && (rep.faceCount() < 1000000))\n\t\t{\n\t\t\tm_DataStream << true;\n\t\t\tQByteArray uncompressedBuffer;\n\t\t\t{\n\t\t\t\tQBuffer buffer(&uncompressedBuffer);\n\t\t\t\tbuffer.open(QIODevice::WriteOnly);\n\t\t\t\tQDataStream bufferStream(&buffer);\n\t\t\t\tbufferStream << rep;\n\t\t\t}\n\t\t\tm_DataStream << qCompress(uncompressedBuffer, m_CompressionLevel);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_DataStream << false;\n\t\t\t\/\/ Binary representation geometry\n\t\t\t\/\/ Add the rep\n\t\t\tm_DataStream << rep;\n\t\t}\n\n\t\t\/\/ Flag the file\n\t\tqint64 offset= sizeof(QUuid);\n\t\toffset+= sizeof(quint32);\n\n\t\tm_pFile->seek(offset);\n\t\tbool writeOk= true;\n\t\tm_DataStream << writeOk;\n\t\t\/\/ Close the file\n\t\tsaveOk= close();\n\t}\n\treturn saveOk;\n}\n\n\n\/\/ Open the file\nbool GLC_BSRep::open(QIODevice::OpenMode mode)\n{\n\tbool openOk= m_FileInfo.exists();\n\tif (openOk || (mode == QIODevice::WriteOnly))\n\t{\n\t\tm_DataStream.setDevice(NULL);\n\t\tdelete m_pFile;\n\t\tm_pFile= new QFile(m_FileInfo.filePath());\n\t\topenOk= m_pFile->open(mode);\n\t\tif (openOk)\n\t\t{\n\t\t\tm_DataStream.setDevice(m_pFile);\n\t\t}\n\t}\n\telse if (GLC_TraceLog::isEnable())\n\t{\n\t\tQStringList stringList(\"GLC_BSRep::open\");\n\t\tstringList.append(\"File \" + m_FileInfo.filePath() + \" doesn't exists\");\n\t\tGLC_TraceLog::addTrace(stringList);\n\t}\n\n\treturn openOk;\n}\n\n\/\/ Close the file\nbool GLC_BSRep::close()\n{\n\tQ_ASSERT(m_pFile != NULL);\n\tQ_ASSERT(m_DataStream.device() != NULL);\n\tbool closeOk= m_DataStream.status() == QDataStream::Ok;\n\tm_DataStream.setDevice(NULL);\n\tm_pFile->close();\n\tdelete m_pFile;\n\tm_pFile= NULL;\n\n\treturn closeOk;\n}\n\n\/\/ Write the header\nvoid GLC_BSRep::writeHeader(const QDateTime& dateTime)\n{\n\tQ_ASSERT(m_pFile != NULL);\n\tQ_ASSERT(m_DataStream.device() != NULL);\n\n\t\/\/ Binary representation Header\n\t\/\/ Add the magic number\n\tm_DataStream << m_Uuid;\n\t\/\/ Add the version\n\tm_DataStream << m_Version;\n\tbool writeFinished= false;\n\tm_DataStream << writeFinished;\n\n\t\/\/ Set the version of the data stream\n\tm_DataStream.setVersion(QDataStream::Qt_4_6);\n\n\t\/\/ Add the time stamp\n\tm_DataStream << dateTime;\n}\n\n\/\/ Check the header\nbool GLC_BSRep::headerIsOk()\n{\n\tQ_ASSERT(m_pFile != NULL);\n\tQ_ASSERT(m_DataStream.device() != NULL);\n\tQ_ASSERT(m_pFile->openMode() == QIODevice::ReadOnly);\n\n\tQUuid uuid;\n\tquint32 version;\n\tbool writeFinished;\n\n\tm_DataStream >> uuid;\n\tm_DataStream >> version;\n\tm_DataStream >> writeFinished;\n\n\t\/\/ Set the version of the data stream\n\tm_DataStream.setVersion(QDataStream::Qt_4_6);\n\n\tbool headerOk= (uuid == m_Uuid) && (version == m_Version) && writeFinished;\n\n\treturn headerOk;\n}\n\n\/\/ Check the time Stamp\nbool GLC_BSRep::timeStampOk(const QDateTime& timeStamp)\n{\n\tQ_ASSERT(m_pFile != NULL);\n\tQ_ASSERT(m_DataStream.device() != NULL);\n\tQ_ASSERT(m_pFile->openMode() == QIODevice::ReadOnly);\n\n\tQDateTime dateTime;\n\tm_DataStream >> dateTime;\n\n\tbool timeStampOk= !timeStamp.isValid() || (dateTime == timeStamp);\n\treturn timeStampOk;\n}\n\n<commit_msg>When loading BSRep to 3DRep, set the 3DRep file name to the BSRep file name.<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 2.0.0, packaged on July 2010.\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 Lesser 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 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 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 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\/\/! \\file glc_bsrep.cpp implementation for the GLC_BSRep class.\n\n#include \"glc_bsrep.h\"\n#include \"..\/glc_fileformatexception.h\"\n#include \"..\/glc_tracelog.h\"\n\n\/\/ The binary rep suffix\nconst QString GLC_BSRep::m_Suffix(\"BSRep\");\n\n\/\/ The binary rep magic number\nconst QUuid GLC_BSRep::m_Uuid(\"{d6f97789-36a9-4c2e-b667-0e66c27f839f}\");\n\n\/\/ The binary rep version\nconst quint32 GLC_BSRep::m_Version= 102;\n\n\/\/ Mutex used by compression\nQMutex GLC_BSRep::m_CompressionMutex;\n\n\/\/ Default constructor\nGLC_BSRep::GLC_BSRep(const QString& fileName, bool useCompression)\n: m_FileInfo()\n, m_pFile(NULL)\n, m_DataStream()\n, m_UseCompression(useCompression)\n, m_CompressionLevel(-1)\n{\n\tsetAbsoluteFileName(fileName);\n\tm_DataStream.setVersion(QDataStream::Qt_4_6);\n\tm_DataStream.setFloatingPointPrecision(QDataStream::SinglePrecision);\n}\n\n\/\/ Copy constructor\nGLC_BSRep::GLC_BSRep(const GLC_BSRep& binaryRep)\n: m_FileInfo(binaryRep.m_FileInfo)\n, m_pFile(NULL)\n, m_DataStream()\n, m_UseCompression(binaryRep.m_UseCompression)\n, m_CompressionLevel(binaryRep.m_CompressionLevel)\n{\n\tm_DataStream.setVersion(QDataStream::Qt_4_6);\n\tm_DataStream.setFloatingPointPrecision(binaryRep.m_DataStream.floatingPointPrecision());\n}\n\nGLC_BSRep::~GLC_BSRep()\n{\n\tdelete m_pFile;\n}\n\n\/\/ Return true if the binary rep is up to date\nbool GLC_BSRep::isUsable(const QDateTime& timeStamp)\n{\n\tbool isUpToDate= false;\n\tif (open(QIODevice::ReadOnly))\n\t{\n\t\tif (headerIsOk())\n\t\t{\n\t\t\tisUpToDate= timeStampOk(timeStamp);\n\t\t\tisUpToDate= isUpToDate && close();\n\t\t}\n\t}\n\telse\n\t{\n\t\tQString message(QString(\"GLC_BSRep::loadRep Enable to open the file \") + m_FileInfo.fileName());\n\t\tGLC_FileFormatException fileFormatException(message, m_FileInfo.fileName(), GLC_FileFormatException::FileNotFound);\n\t\tclose();\n\t\tthrow(fileFormatException);\n\t}\n\n\tif (!isUpToDate && GLC_TraceLog::isEnable())\n\t{\n\t\tQStringList stringList(\"GLC_BSRep::isUsable\");\n\t\tstringList.append(\"File \" + m_FileInfo.filePath() + \" not Usable\");\n\t\tGLC_TraceLog::addTrace(stringList);\n\t}\n\treturn isUpToDate;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ name Get Functions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Load the binary rep\nGLC_3DRep GLC_BSRep::loadRep()\n{\n\tGLC_3DRep loadedRep;\n\n\tif (open(QIODevice::ReadOnly))\n\t{\n\t\tif (headerIsOk())\n\t\t{\n\t\t\ttimeStampOk(QDateTime());\n\t\t\tGLC_BoundingBox boundingBox;\n\t\t\tm_DataStream >> boundingBox;\n\t\t\tbool useCompression;\n\t\t\tm_DataStream >> useCompression;\n\t\t\tif (useCompression)\n\t\t\t{\n\t\t\t\tQByteArray CompresseBuffer;\n\t\t\t\tm_DataStream >> CompresseBuffer;\n\t\t\t\tQByteArray uncompressedBuffer= qUncompress(CompresseBuffer);\n\t\t\t\tCompresseBuffer.clear();\n\t\t\t\tQDataStream bufferStream(uncompressedBuffer);\n\t\t\t\tbufferStream >> loadedRep;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tm_DataStream >> loadedRep;\n\t\t\t}\n\t\t\tloadedRep.setFileName(m_FileInfo.filePath());\n\n\t\t\tif (!close())\n\t\t\t{\n\t\t\t\tQString message(QString(\"GLC_BSRep::loadRep An error occur when loading file \") + m_FileInfo.fileName());\n\t\t\t\tGLC_FileFormatException fileFormatException(message, m_FileInfo.fileName(), GLC_FileFormatException::WrongFileFormat);\n\t\t\t\tthrow(fileFormatException);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tQString message(QString(\"GLC_BSRep::loadRep File not supported \") + m_FileInfo.fileName());\n\t\t\tGLC_FileFormatException fileFormatException(message, m_FileInfo.fileName(), GLC_FileFormatException::FileNotSupported);\n\t\t\tclose();\n\t\t\tthrow(fileFormatException);\n\t\t}\n\t}\n\telse\n\t{\n\t\tQString message(QString(\"GLC_BSRep::loadRep Enable to open the file \") + m_FileInfo.fileName());\n\t\tGLC_FileFormatException fileFormatException(message, m_FileInfo.fileName(), GLC_FileFormatException::FileNotFound);\n\t\tclose();\n\t\tthrow(fileFormatException);\n\t}\n\n\n\treturn loadedRep;\n}\n\n\/\/ Return the bounding box of the binary representation\nGLC_BoundingBox GLC_BSRep::boundingBox()\n{\n\tGLC_BoundingBox boundingBox;\n\n\tif (open(QIODevice::ReadOnly))\n\t{\n\t\tif (headerIsOk())\n\t\t{\n\t\t\ttimeStampOk(QDateTime());\n\n\t\t\tm_DataStream >> boundingBox;\n\t\t}\n\t\tclose();\n\t}\n\treturn boundingBox;\n}\n\n\/\/ Return bsrep suffix\nQString GLC_BSRep::suffix()\n{\n\treturn m_Suffix;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/name Set Functions\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Set the binary representation file name\nvoid GLC_BSRep::setAbsoluteFileName(const QString& fileName)\n{\n\tm_FileInfo.setFile(fileName);\n\tif (m_FileInfo.suffix() != m_Suffix)\n\t{\n\t\tm_FileInfo.setFile(fileName + '.' + m_Suffix);\n\t}\n\n}\n\n\/\/ Save the GLC_3DRep in serialised binary\nbool GLC_BSRep::save(const GLC_3DRep& rep)\n{\n\n\t\/\/! Check if the currentFileInfo is valid and writable\n\tbool saveOk= open(QIODevice::WriteOnly);\n\tif (saveOk)\n\t{\n\t\twriteHeader(rep.lastModified());\n\n\t\t\/\/ Representation Bounding Box\n\t\tm_DataStream << rep.boundingBox();\n\n\t\t\/\/ Compression usage\n\n\t\tif (m_UseCompression && (rep.faceCount() < 1000000))\n\t\t{\n\t\t\tm_DataStream << true;\n\t\t\tQByteArray uncompressedBuffer;\n\t\t\t{\n\t\t\t\tQBuffer buffer(&uncompressedBuffer);\n\t\t\t\tbuffer.open(QIODevice::WriteOnly);\n\t\t\t\tQDataStream bufferStream(&buffer);\n\t\t\t\tbufferStream << rep;\n\t\t\t}\n\t\t\tm_DataStream << qCompress(uncompressedBuffer, m_CompressionLevel);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_DataStream << false;\n\t\t\t\/\/ Binary representation geometry\n\t\t\t\/\/ Add the rep\n\t\t\tm_DataStream << rep;\n\t\t}\n\n\t\t\/\/ Flag the file\n\t\tqint64 offset= sizeof(QUuid);\n\t\toffset+= sizeof(quint32);\n\n\t\tm_pFile->seek(offset);\n\t\tbool writeOk= true;\n\t\tm_DataStream << writeOk;\n\t\t\/\/ Close the file\n\t\tsaveOk= close();\n\t}\n\treturn saveOk;\n}\n\n\n\/\/ Open the file\nbool GLC_BSRep::open(QIODevice::OpenMode mode)\n{\n\tbool openOk= m_FileInfo.exists();\n\tif (openOk || (mode == QIODevice::WriteOnly))\n\t{\n\t\tm_DataStream.setDevice(NULL);\n\t\tdelete m_pFile;\n\t\tm_pFile= new QFile(m_FileInfo.filePath());\n\t\topenOk= m_pFile->open(mode);\n\t\tif (openOk)\n\t\t{\n\t\t\tm_DataStream.setDevice(m_pFile);\n\t\t}\n\t}\n\telse if (GLC_TraceLog::isEnable())\n\t{\n\t\tQStringList stringList(\"GLC_BSRep::open\");\n\t\tstringList.append(\"File \" + m_FileInfo.filePath() + \" doesn't exists\");\n\t\tGLC_TraceLog::addTrace(stringList);\n\t}\n\n\treturn openOk;\n}\n\n\/\/ Close the file\nbool GLC_BSRep::close()\n{\n\tQ_ASSERT(m_pFile != NULL);\n\tQ_ASSERT(m_DataStream.device() != NULL);\n\tbool closeOk= m_DataStream.status() == QDataStream::Ok;\n\tm_DataStream.setDevice(NULL);\n\tm_pFile->close();\n\tdelete m_pFile;\n\tm_pFile= NULL;\n\n\treturn closeOk;\n}\n\n\/\/ Write the header\nvoid GLC_BSRep::writeHeader(const QDateTime& dateTime)\n{\n\tQ_ASSERT(m_pFile != NULL);\n\tQ_ASSERT(m_DataStream.device() != NULL);\n\n\t\/\/ Binary representation Header\n\t\/\/ Add the magic number\n\tm_DataStream << m_Uuid;\n\t\/\/ Add the version\n\tm_DataStream << m_Version;\n\tbool writeFinished= false;\n\tm_DataStream << writeFinished;\n\n\t\/\/ Set the version of the data stream\n\tm_DataStream.setVersion(QDataStream::Qt_4_6);\n\n\t\/\/ Add the time stamp\n\tm_DataStream << dateTime;\n}\n\n\/\/ Check the header\nbool GLC_BSRep::headerIsOk()\n{\n\tQ_ASSERT(m_pFile != NULL);\n\tQ_ASSERT(m_DataStream.device() != NULL);\n\tQ_ASSERT(m_pFile->openMode() == QIODevice::ReadOnly);\n\n\tQUuid uuid;\n\tquint32 version;\n\tbool writeFinished;\n\n\tm_DataStream >> uuid;\n\tm_DataStream >> version;\n\tm_DataStream >> writeFinished;\n\n\t\/\/ Set the version of the data stream\n\tm_DataStream.setVersion(QDataStream::Qt_4_6);\n\n\tbool headerOk= (uuid == m_Uuid) && (version == m_Version) && writeFinished;\n\n\treturn headerOk;\n}\n\n\/\/ Check the time Stamp\nbool GLC_BSRep::timeStampOk(const QDateTime& timeStamp)\n{\n\tQ_ASSERT(m_pFile != NULL);\n\tQ_ASSERT(m_DataStream.device() != NULL);\n\tQ_ASSERT(m_pFile->openMode() == QIODevice::ReadOnly);\n\n\tQDateTime dateTime;\n\tm_DataStream >> dateTime;\n\n\tbool timeStampOk= !timeStamp.isValid() || (dateTime == timeStamp);\n\treturn timeStampOk;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\n\n#include <glm\/glm.hpp>\n#include <unordered_set>\n#include <array>\n\n\n\n\nnamespace mos {\nnamespace io {\n\nclass Mouse {\n\n\npublic:\n  Mouse();\n  enum class Button : int {\n    Button_1 = 0,\n    Button_2 = 1,\n    Button_3 = 2\n  };\n\n  enum class Action : int {\n    Release = 0,\n    Press = 1,\n    Repeat = 2\n  };\n\n  struct Event {\n    Button button;\n    Action action;\n\n    bool operator==(const Event &event) const{\n      return button == event.button && action == event.action;\n    }\n\n  };\n\nprivate:\n  struct EventHash {\n    size_t operator()(const Event& e) const {\n      return ((std::hash<int>()(static_cast<int>(e.button)) ^ (std::hash<int>()(static_cast<int>(e.action)) << 1)) >> 1);\n    }\n  };\npublic:\n\n  using Events = std::unordered_set<Event, EventHash>;\n\n  glm::dvec2 position{};\n  glm::dvec2 old_position{};\n  Events events;\n  std::array<bool, 3> buttons{false, false, false};\n};\n}\n}\n\n\n<commit_msg>All mouse buttons.<commit_after>#pragma once\n\n#include <glm\/glm.hpp>\n#include <unordered_set>\n#include <array>\n\n\n\n\nnamespace mos {\nnamespace io {\n\nclass Mouse {\n\n\npublic:\n  Mouse();\n  enum class Button : int {\n    Button_1 = 0,\n    Button_2 = 1,\n    Button_3 = 2,\n    Button_4 = 3,\n    Button_5 = 4,\n    Button_6 = 5,\n    Button_7 = 6,\n    Button_8 = 7\n  };\n\n  enum class Action : int {\n    Release = 0,\n    Press = 1,\n    Repeat = 2\n  };\n\n  struct Event {\n    Button button;\n    Action action;\n\n    bool operator==(const Event &event) const{\n      return button == event.button && action == event.action;\n    }\n\n  };\n\nprivate:\n  struct EventHash {\n    size_t operator()(const Event& e) const {\n      return ((std::hash<int>()(static_cast<int>(e.button)) ^ (std::hash<int>()(static_cast<int>(e.action)) << 1)) >> 1);\n    }\n  };\npublic:\n\n  using Events = std::unordered_set<Event, EventHash>;\n\n  glm::dvec2 position{};\n  glm::dvec2 old_position{};\n  Events events;\n  std::array<bool, 3> buttons{false, false, false};\n};\n}\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ compare numerical result to analytic calculation for 2D planar detector\n{\n   GeFiCa::Planar2D *detector2 = new GeFiCa::Planar2D(101,101);\n   detector2->MaxIterations=1e5;\n   detector2->Csor=1.995;\n   detector2->V0=800*GeFiCa::volt;\n   detector2->V1=0*GeFiCa::volt;\n   detector2->SetAverageImpurity(1e10\/GeFiCa::cm3);\n   detector2->Dump();\n   cout<<\"press any key to continue\"<<endl;\n   cin.get();\n\n   \/\/use analytic method from 1D planar\n   GeFiCa::Planar1D *detector = new GeFiCa::Planar1D(101);\n   detector->V0=800*GeFiCa::volt;\n   detector->V1=0*GeFiCa::volt;\n   detector->SetAverageImpurity(1e10\/GeFiCa::cm3);\n\n   \/\/ calculate fields with two different methods\n   detector2->CalculatePotential(GeFiCa::kSOR2);\n   detector2->SaveField(\"planar2dSOR2.root\");\n   detector->CalculatePotential(GeFiCa::kAnalytic);\n   detector->SaveField(\"planar1dTRUE.root\");\n\n   \/\/ prepare drawing style\n   gROOT->SetStyle(\"Plain\"); \/\/ pick up a good drawing style to modify\n   gStyle->SetLegendBorderSize(0);\n   gStyle->SetLegendFont(132);\n   gStyle->SetLabelFont(132,\"XY\");\n   gStyle->SetTitleFont(132,\"XY\");\n   gStyle->SetLabelSize(0.05,\"XY\");\n   gStyle->SetTitleSize(0.05,\"XY\");\n   gStyle->SetPadRightMargin(0.01);\n   gStyle->SetPadLeftMargin(0.12);\n   gStyle->SetPadTopMargin(0.02);\n\n   \/\/ generate graphics\n   TChain *tn = new TChain(\"t\");\n   tn->Add(\"planar2dSOR2.root\");\n   tn->Draw(\"v:c1\");\n   TGraph *gn = new TGraph(tn->GetSelectedRows(), tn->GetV2(), tn->GetV1());\n\n   TChain *ta = new TChain(\"t\");\n   ta->Add(\"planar1dTRUE.root\");\n   ta->Draw(\"v:c1\");\n   TGraph *ga = new TGraph(ta->GetSelectedRows(), ta->GetV2(), ta->GetV1());\n\n   \/\/ make final plot\n   gn->SetMarkerColor(kBlue);\n   gn->SetMarkerStyle(kCircle);\n   gn->SetMarkerSize(0.8);\n   ga->SetLineColor(kRed);\n   gn->SetTitle(\";Thickness [cm];Potential [V]\");\n   gn->Draw(\"ap\");\n   ga->Draw(\"l\");\n\n   TLegend *l = new TLegend(0.7,0.6,0.9,0.8);\n   l->AddEntry(ga,\"Analytic\",\"l\");\n   l->AddEntry(gn,\"SOR2\",\"p\");\n   l->Draw();\n\n   gPad->Print(\"planar2d.png\");\n\n   \/\/ calculate capacitance\n   double c = detector->GetCapacitance()\/GeFiCa::pF;\n   cout<<\"capacitance is \"<<c<<\" pF per cm2\"<<endl;\n}\n<commit_msg>removed<commit_after><|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: confprovider2.cxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: dg $ $Date: 2000-11-30 08:38: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#include \"confprovider2.hxx\"\n#include \"apiaccessobj.hxx\"\n\n#ifndef CONFIGMGR_API_PROVIDERIMPL2_HXX_\n#include \"confproviderimpl2.hxx\"\n#endif\n#ifndef CONFIGMGR_MODULE_HXX_\n#include \"configmodule.hxx\"\n#endif\n#ifndef CONFIGMGR_BOOTSTRAP_HXX_\n#include \"bootstrap.hxx\"\n#endif\n#ifndef _CONFIGMGR_TRACER_HXX_\n#include \"tracer.hxx\"\n#endif\n\n#ifndef _OSL_MUTEX_HXX_\n#include <osl\/mutex.hxx>\n#endif\n#ifndef __SGI_STL_ALGORITHM\n#include <stl\/algorithm>\n#endif\n#ifndef _COMPHELPER_SEQUENCE_HXX_\n#include <comphelper\/sequence.hxx>\n#endif\n#ifndef _CPPUHELPER_TYPEPROVIDER_HXX_\n#include <cppuhelper\/typeprovider.hxx>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYVALUE_HPP_\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#endif\n\n#define THISREF() static_cast< ::cppu::OWeakObject* >(this)\n\nnamespace configmgr\n{\n    namespace css  = ::com::sun::star;\n    namespace uno  = css::uno;\n    namespace lang = css::lang;\n    namespace beans = css::beans;\n    using ::rtl::OUString;\n    using ::vos::ORef;\n    using namespace osl;\n\n    namespace\n    {\n        typedef uno::Reference< uno::XInterface > (OConfigurationProviderImpl::*CreatorFunc)(const uno::Sequence< uno::Any >& aArguments);\n        struct ServiceCreationInfo\n        {\n            ServiceInfo const* info;\n            CreatorFunc create;\n        };\n\n        AsciiServiceName const aProviderServices[] =\n        {\n            \"com.sun.star.configuration.ConfigurationProvider\",\n            0\n        };\n        ServiceInfo const aProviderInfo =\n        {\n            \"com.sun.star.comp.configuration.ConfigurationProvider\",\n            aProviderServices\n        };\n\n        static sal_Int32 getCreateServiceDataCount()\n        {\n            return 2;\n        };\n\n        static const ServiceCreationInfo* getCreateServiceData()\n        {\n            static ServiceCreationInfo const createServiceData[] =\n            {\n                { &configapi::aRootElementReadAccessSI, &OConfigurationProviderImpl::createReadAccess },\n                { &configapi::aRootElementUpdateAccessSI, &OConfigurationProviderImpl::createUpdateAccess },\n            };\n            OSL_ENSHURE(sizeof(createServiceData)\/sizeof(createServiceData[0]) == getCreateServiceDataCount(),\n                \"getCreateServiceData : inconsistent data !\");\n            return createServiceData;\n        }\n    }\n\n    static ServiceCreationInfo const* findCreationInfo( const OUString& aServiceSpecifier )\n    {\n        for (int i= 0; i<getCreateServiceDataCount(); ++i)\n        {\n            ServiceCreationInfo const& rCreationInfo = getCreateServiceData()[i];\n\n            ServiceInfo const* pInfo = rCreationInfo.info;\n            if (!pInfo)\n                continue;\n\n            if (AsciiServiceName pImplName = pInfo->implementationName)\n            {\n                if (0 == aServiceSpecifier.compareToAscii(pImplName))\n                    return &rCreationInfo;\n            }\n\n            if (AsciiServiceName const* pNames = pInfo->serviceNames)\n            {\n                while(*pNames)\n                {\n                    if (0 == aServiceSpecifier.compareToAscii(*pNames))\n                        return &rCreationInfo;\n\n                    ++pNames;\n                }\n            }\n        }\n        \/\/ not found\n        return 0;\n    }\n\n    \/\/=============================================================================\n    \/\/= OConfigurationProvider\n    \/\/=============================================================================\n    ServiceInfo const& OConfigurationProvider::staticServiceInfo = aProviderInfo;\n    \/\/-----------------------------------------------------------------------------\n    OConfigurationProvider::OConfigurationProvider(Module& aModule)\n                           :OProvider(aModule,&aProviderInfo)\n                           ,m_pImpl(NULL)\n    {\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    void OConfigurationProvider::connect() throw(uno::Exception)\n    {\n        IConfigSession* pNewSession = m_aModule.connect(m_aModule.getConnectionData(), m_aSecurityOverride);\n        if (!pNewSession)\n            throw uno::Exception(::rtl::OUString::createFromAscii(\"Could not connect to the configuration registry. Please check your settings.\"), NULL);\n        m_pImpl = new OConfigurationProviderImpl(this, pNewSession, m_aModule);\n        m_aModule.setProvider(this);\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    void OConfigurationProvider::disconnect()\n    {\n        if (m_pImpl)\n        {\n            m_aModule.disconnect();\n            m_aModule.disposing(this);\n            delete m_pImpl;\n            m_pImpl = NULL;\n        }\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    bool OConfigurationProvider::isConnected() const\n    {\n        return (m_pImpl != NULL) ? true : false;\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    uno::Reference< uno::XInterface > SAL_CALL OConfigurationProvider::createInstance( const OUString& aServiceSpecifier )\n        throw(uno::Exception, uno::RuntimeException)\n    {\n        MutexGuard aGuard(m_aMutex);\n\n        ensureConnection();\n        CFG_TRACE_INFO(\"going to create a read access instance for %s\", \"missing unicode conversion\");\n\n        if (ServiceCreationInfo const* pInfo = findCreationInfo(aServiceSpecifier))\n        {\n            \/\/ it's a known service name - try to create without args\n            if (CreatorFunc create = pInfo->create)\n            {\n                uno::Sequence< uno::Any > aArguments;\n                return (m_pImpl->*create)(\n                    aArguments);\n            }\n        }\n\n        \/\/ Otherwise try to use it as a configuration node name (and create a deep reader)\n        uno::Sequence< uno::Any > aArguments(1);\n        aArguments[0] <<= aServiceSpecifier;\n        return m_pImpl->createReadAccess(aArguments);\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    uno::Reference< uno::XInterface > SAL_CALL\n        OConfigurationProvider::createInstanceWithArguments( const ::rtl::OUString& aServiceSpecifier, const uno::Sequence< uno::Any >& aArguments )\n            throw(uno::Exception, uno::RuntimeException)\n    {\n        MutexGuard aGuard(m_aMutex);\n        ensureConnection();\n\n        if (ServiceCreationInfo const* pInfo = findCreationInfo(aServiceSpecifier))\n        {\n            \/\/ it's a known service name - try to create without args\n            if (CreatorFunc create = pInfo->create)\n            {\n                return (m_pImpl->*create)(aArguments);\n            }\n        }\n        \/\/ Otherwise try to use it as a configuration node name (and create a deep reader)\n        sal_Int32 nLength = aArguments.getLength();\n        uno::Sequence< uno::Any > aMoreArguments( 1 + nLength );\n\n        aMoreArguments[0] <<= aServiceSpecifier;\n        std::copy(aArguments.getConstArray(),aArguments.getConstArray() + nLength, aMoreArguments.getArray()+1);\n\n        return m_pImpl->createReadAccess(aMoreArguments);\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    uno::Sequence< OUString > SAL_CALL OConfigurationProvider::getAvailableServiceNames(  )\n        throw(uno::RuntimeException)\n    {\n        MutexGuard aGuard(m_aMutex);\n\n        sal_Int32 nCount = 0;\n\n        {\n            for (int i= 0; i<getCreateServiceDataCount(); ++i)\n                nCount += countServices(getCreateServiceData()[i].info);\n        }\n\n        uno::Sequence< OUString > aNames(nCount);\n\n        if (nCount > 0)\n        {\n            sal_Int32 n = 0;\n            for (int i= 0; i<getCreateServiceDataCount(); ++i)\n            {\n                ServiceInfo const* pInfo = getCreateServiceData()[i].info;\n                AsciiServiceName const* pNames = pInfo ? pInfo->serviceNames : 0;\n\n                if (pNames)\n                {\n                    while(*pNames)\n                    {\n                        aNames[n] = OUString::createFromAscii(*pNames);\n                        ++n;\n                        ++pNames;\n                    }\n                }\n            }\n        }\n\n        return aNames;\n    }\n} \/\/ namespace configmgr\n\n\n<commit_msg>#81100# connecting to the module - behaviour changed<commit_after>\/*************************************************************************\n *\n *  $RCSfile: confprovider2.cxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: fs $ $Date: 2000-12-01 13: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#include \"confprovider2.hxx\"\n#include \"apiaccessobj.hxx\"\n\n#ifndef CONFIGMGR_API_PROVIDERIMPL2_HXX_\n#include \"confproviderimpl2.hxx\"\n#endif\n#ifndef CONFIGMGR_MODULE_HXX_\n#include \"configmodule.hxx\"\n#endif\n#ifndef CONFIGMGR_BOOTSTRAP_HXX_\n#include \"bootstrap.hxx\"\n#endif\n#ifndef _CONFIGMGR_TRACER_HXX_\n#include \"tracer.hxx\"\n#endif\n\n#ifndef _OSL_MUTEX_HXX_\n#include <osl\/mutex.hxx>\n#endif\n#ifndef __SGI_STL_ALGORITHM\n#include <stl\/algorithm>\n#endif\n#ifndef _COMPHELPER_SEQUENCE_HXX_\n#include <comphelper\/sequence.hxx>\n#endif\n#ifndef _CPPUHELPER_TYPEPROVIDER_HXX_\n#include <cppuhelper\/typeprovider.hxx>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYVALUE_HPP_\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#endif\n\n#define THISREF() static_cast< ::cppu::OWeakObject* >(this)\n\nnamespace configmgr\n{\n    namespace css  = ::com::sun::star;\n    namespace uno  = css::uno;\n    namespace lang = css::lang;\n    namespace beans = css::beans;\n    using ::rtl::OUString;\n    using ::vos::ORef;\n    using namespace osl;\n\n    namespace\n    {\n        typedef uno::Reference< uno::XInterface > (OConfigurationProviderImpl::*CreatorFunc)(const uno::Sequence< uno::Any >& aArguments);\n        struct ServiceCreationInfo\n        {\n            ServiceInfo const* info;\n            CreatorFunc create;\n        };\n\n        AsciiServiceName const aProviderServices[] =\n        {\n            \"com.sun.star.configuration.ConfigurationProvider\",\n            0\n        };\n        ServiceInfo const aProviderInfo =\n        {\n            \"com.sun.star.comp.configuration.ConfigurationProvider\",\n            aProviderServices\n        };\n\n        static sal_Int32 getCreateServiceDataCount()\n        {\n            return 2;\n        };\n\n        static const ServiceCreationInfo* getCreateServiceData()\n        {\n            static ServiceCreationInfo const createServiceData[] =\n            {\n                { &configapi::aRootElementReadAccessSI, &OConfigurationProviderImpl::createReadAccess },\n                { &configapi::aRootElementUpdateAccessSI, &OConfigurationProviderImpl::createUpdateAccess },\n            };\n            OSL_ENSHURE(sizeof(createServiceData)\/sizeof(createServiceData[0]) == getCreateServiceDataCount(),\n                \"getCreateServiceData : inconsistent data !\");\n            return createServiceData;\n        }\n    }\n\n    static ServiceCreationInfo const* findCreationInfo( const OUString& aServiceSpecifier )\n    {\n        for (int i= 0; i<getCreateServiceDataCount(); ++i)\n        {\n            ServiceCreationInfo const& rCreationInfo = getCreateServiceData()[i];\n\n            ServiceInfo const* pInfo = rCreationInfo.info;\n            if (!pInfo)\n                continue;\n\n            if (AsciiServiceName pImplName = pInfo->implementationName)\n            {\n                if (0 == aServiceSpecifier.compareToAscii(pImplName))\n                    return &rCreationInfo;\n            }\n\n            if (AsciiServiceName const* pNames = pInfo->serviceNames)\n            {\n                while(*pNames)\n                {\n                    if (0 == aServiceSpecifier.compareToAscii(*pNames))\n                        return &rCreationInfo;\n\n                    ++pNames;\n                }\n            }\n        }\n        \/\/ not found\n        return 0;\n    }\n\n    \/\/=============================================================================\n    \/\/= OConfigurationProvider\n    \/\/=============================================================================\n    ServiceInfo const& OConfigurationProvider::staticServiceInfo = aProviderInfo;\n    \/\/-----------------------------------------------------------------------------\n    OConfigurationProvider::OConfigurationProvider(Module& aModule)\n                           :OProvider(aModule,&aProviderInfo)\n                           ,m_pImpl(NULL)\n    {\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    void OConfigurationProvider::connect(const ConnectionSettings& _rSettings) throw(uno::Exception)\n    {\n        IConfigSession* pNewSession = m_aModule.connect(_rSettings);\n        if (!pNewSession)\n            throw uno::Exception(::rtl::OUString::createFromAscii(\"Could not connect to the configuration registry. Please check your settings.\"), NULL);\n        m_pImpl = new OConfigurationProviderImpl(this, pNewSession, m_aModule);\n        m_aModule.setProvider(this);\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    void OConfigurationProvider::disconnect()\n    {\n        if (m_pImpl)\n        {\n            m_aModule.disconnect();\n            m_aModule.disposing(this);\n            delete m_pImpl;\n            m_pImpl = NULL;\n        }\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    bool OConfigurationProvider::isConnected() const\n    {\n        return (m_pImpl != NULL) ? true : false;\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    uno::Reference< uno::XInterface > SAL_CALL OConfigurationProvider::createInstance( const OUString& aServiceSpecifier )\n        throw(uno::Exception, uno::RuntimeException)\n    {\n        MutexGuard aGuard(m_aMutex);\n\n        CFG_TRACE_INFO(\"going to create a read access instance for %s\", \"missing unicode conversion\");\n\n        if (ServiceCreationInfo const* pInfo = findCreationInfo(aServiceSpecifier))\n        {\n            \/\/ it's a known service name - try to create without args\n            if (CreatorFunc create = pInfo->create)\n            {\n                uno::Sequence< uno::Any > aArguments;\n                return (m_pImpl->*create)(\n                    aArguments);\n            }\n        }\n\n        \/\/ Otherwise try to use it as a configuration node name (and create a deep reader)\n        uno::Sequence< uno::Any > aArguments(1);\n        aArguments[0] <<= aServiceSpecifier;\n        return m_pImpl->createReadAccess(aArguments);\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    uno::Reference< uno::XInterface > SAL_CALL\n        OConfigurationProvider::createInstanceWithArguments( const ::rtl::OUString& aServiceSpecifier, const uno::Sequence< uno::Any >& aArguments )\n            throw(uno::Exception, uno::RuntimeException)\n    {\n        MutexGuard aGuard(m_aMutex);\n\n        if (ServiceCreationInfo const* pInfo = findCreationInfo(aServiceSpecifier))\n        {\n            \/\/ it's a known service name - try to create without args\n            if (CreatorFunc create = pInfo->create)\n            {\n                return (m_pImpl->*create)(aArguments);\n            }\n        }\n        \/\/ Otherwise try to use it as a configuration node name (and create a deep reader)\n        sal_Int32 nLength = aArguments.getLength();\n        uno::Sequence< uno::Any > aMoreArguments( 1 + nLength );\n\n        aMoreArguments[0] <<= aServiceSpecifier;\n        std::copy(aArguments.getConstArray(),aArguments.getConstArray() + nLength, aMoreArguments.getArray()+1);\n\n        return m_pImpl->createReadAccess(aMoreArguments);\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    uno::Sequence< OUString > SAL_CALL OConfigurationProvider::getAvailableServiceNames(  )\n        throw(uno::RuntimeException)\n    {\n        MutexGuard aGuard(m_aMutex);\n\n        sal_Int32 nCount = 0;\n\n        {\n            for (int i= 0; i<getCreateServiceDataCount(); ++i)\n                nCount += countServices(getCreateServiceData()[i].info);\n        }\n\n        uno::Sequence< OUString > aNames(nCount);\n\n        if (nCount > 0)\n        {\n            sal_Int32 n = 0;\n            for (int i= 0; i<getCreateServiceDataCount(); ++i)\n            {\n                ServiceInfo const* pInfo = getCreateServiceData()[i].info;\n                AsciiServiceName const* pNames = pInfo ? pInfo->serviceNames : 0;\n\n                if (pNames)\n                {\n                    while(*pNames)\n                    {\n                        aNames[n] = OUString::createFromAscii(*pNames);\n                        ++n;\n                        ++pNames;\n                    }\n                }\n            }\n        }\n\n        return aNames;\n    }\n} \/\/ namespace configmgr\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/------------------------------------------------------------------------------\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\n\/\/ version: $Id$\n\/\/ author:  Lukasz Janyst <ljanyst@cern.ch>\n\/\/------------------------------------------------------------------------------\n\n#include \"cling\/Interpreter\/Interpreter.h\"\n#include \"cling\/MetaProcessor\/MetaProcessor.h\"\n#include \"cling\/UserInterface\/UserInterface.h\"\n\n#include \"clang\/Basic\/LangOptions.h\"\n#include \"clang\/Frontend\/CompilerInstance.h\"\n#include \"clang\/Frontend\/HeaderSearchOptions.h\"\n\n#include \"llvm\/Support\/Signals.h\"\n#include \"llvm\/Support\/PrettyStackTrace.h\"\n#include \"llvm\/Support\/ManagedStatic.h\"\n\n#include <iostream>\n#include <vector>\n#include <string>\n\nint main( int argc, char **argv ) {\n\n  llvm::llvm_shutdown_obj shutdownTrigger;\n\n  \/\/llvm::sys::PrintStackTraceOnErrorSignal();\n  \/\/llvm::PrettyStackTraceProgram X(argc, argv);\n\n  \/\/ Set up the interpreter\n  cling::Interpreter interp(argc, argv);\n  if (interp.getOptions().Help) {\n    return 0;\n  }\n\n  clang::CompilerInstance* CI = interp.getCI();\n  interp.AddIncludePath(\".\");\n\n  for (size_t I = 0, N = interp.getOptions().LibsToLoad.size(); I < N; ++I) {\n    interp.loadFile(interp.getOptions().LibsToLoad[I]);\n  }\n\n   bool ret = true;\n   const std::vector<clang::FrontendInputFile>& Inputs\n     = CI->getInvocation().getFrontendOpts().Inputs;\n\n   \/\/ Interactive means no input (or one input that's \"-\")\n   bool Interactive = Inputs.empty() || (Inputs.size() == 1\n                                         && Inputs[0].File == \"-\");\n\n   cling::UserInterface ui(interp);\n   \/\/ If we are not interactive we're supposed to parse files\n   if (!Interactive) {\n     for (size_t I = 0, N = Inputs.size(); I < N; ++I) {\n       ui.getMetaProcessor()->process((\".x \" + Inputs[I].File).c_str());\n       ret = !CI->getDiagnostics().getClient()->getNumErrors();\n     }\n   }\n   else {\n      cling::UserInterface ui(interp);\n      ui.runInteractively(interp.getOptions().NoLogo);\n   }\n\n   \/\/ if we are running with -verify a reported has to be returned as unsuccess.\n   \/\/ This is relevan especially for the test suite.\n   if (CI->getDiagnosticOpts().VerifyDiagnostics)\n     ret = !CI->getDiagnostics().getClient()->getNumErrors();\n\n   return ret ? 0 : 1;\n}\n<commit_msg>unused include<commit_after>\/\/------------------------------------------------------------------------------\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\n\/\/ version: $Id$\n\/\/ author:  Lukasz Janyst <ljanyst@cern.ch>\n\/\/------------------------------------------------------------------------------\n\n#include \"cling\/Interpreter\/Interpreter.h\"\n#include \"cling\/MetaProcessor\/MetaProcessor.h\"\n#include \"cling\/UserInterface\/UserInterface.h\"\n\n#include \"clang\/Basic\/LangOptions.h\"\n#include \"clang\/Frontend\/CompilerInstance.h\"\n\n#include \"llvm\/Support\/Signals.h\"\n#include \"llvm\/Support\/PrettyStackTrace.h\"\n#include \"llvm\/Support\/ManagedStatic.h\"\n\n#include <iostream>\n#include <vector>\n#include <string>\n\nint main( int argc, char **argv ) {\n\n  llvm::llvm_shutdown_obj shutdownTrigger;\n\n  \/\/llvm::sys::PrintStackTraceOnErrorSignal();\n  \/\/llvm::PrettyStackTraceProgram X(argc, argv);\n\n  \/\/ Set up the interpreter\n  cling::Interpreter interp(argc, argv);\n  if (interp.getOptions().Help) {\n    return 0;\n  }\n\n  clang::CompilerInstance* CI = interp.getCI();\n  interp.AddIncludePath(\".\");\n\n  for (size_t I = 0, N = interp.getOptions().LibsToLoad.size(); I < N; ++I) {\n    interp.loadFile(interp.getOptions().LibsToLoad[I]);\n  }\n\n   bool ret = true;\n   const std::vector<clang::FrontendInputFile>& Inputs\n     = CI->getInvocation().getFrontendOpts().Inputs;\n\n   \/\/ Interactive means no input (or one input that's \"-\")\n   bool Interactive = Inputs.empty() || (Inputs.size() == 1\n                                         && Inputs[0].File == \"-\");\n\n   cling::UserInterface ui(interp);\n   \/\/ If we are not interactive we're supposed to parse files\n   if (!Interactive) {\n     for (size_t I = 0, N = Inputs.size(); I < N; ++I) {\n       ui.getMetaProcessor()->process((\".x \" + Inputs[I].File).c_str());\n       ret = !CI->getDiagnostics().getClient()->getNumErrors();\n     }\n   }\n   else {\n      cling::UserInterface ui(interp);\n      ui.runInteractively(interp.getOptions().NoLogo);\n   }\n\n   \/\/ if we are running with -verify a reported has to be returned as unsuccess.\n   \/\/ This is relevan especially for the test suite.\n   if (CI->getDiagnosticOpts().VerifyDiagnostics)\n     ret = !CI->getDiagnostics().getClient()->getNumErrors();\n\n   return ret ? 0 : 1;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: confprovider2.cxx,v $\n *\n *  $Revision: 1.25 $\n *\n *  last change: $Author: hr $ $Date: 2003-03-19 16:18: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#include <stdio.h>\n\n#include \"confprovider2.hxx\"\n#include \"apiaccessobj.hxx\"\n\n#ifndef CONFIGMGR_API_PROVIDERIMPL2_HXX_\n#include \"confproviderimpl2.hxx\"\n#endif\n#ifndef CONFIGMGR_API_FACTORY_HXX_\n#include \"confapifactory.hxx\"\n#endif\n#ifndef CONFIGMGR_BOOTSTRAP_HXX_\n#include \"bootstrap.hxx\"\n#endif\n#ifndef CONFIGMGR_BOOTSTRAPCONTEXT_HXX_\n#include \"bootstrapcontext.hxx\"\n#endif\n#ifndef CONFIGMGR_WRAPEXCEPTION_HXX\n#include \"wrapexception.hxx\"\n#endif\n#ifndef _CONFIGMGR_TRACER_HXX_\n#include \"tracer.hxx\"\n#endif\n\n#ifndef _OSL_MUTEX_HXX_\n#include <osl\/mutex.hxx>\n#endif\n#ifndef _RTL_USTRBUF_HXX_\n#include <rtl\/ustrbuf.hxx>\n#endif\n#ifndef INCLUDED_ALGORITHM\n#include <algorithm>\n#define INCLUDED_ALGORITHM\n#endif\n#ifndef _COMPHELPER_SEQUENCE_HXX_\n#include <comphelper\/sequence.hxx>\n#endif\n#ifndef _CPPUHELPER_TYPEPROVIDER_HXX_\n#include <cppuhelper\/typeprovider.hxx>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYVALUE_HPP_\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#endif\n#include <com\/sun\/star\/lang\/ServiceNotRegisteredException.hpp>\n\n#define THISREF() static_cast< ::cppu::OWeakObject* >(this)\n\nnamespace configmgr\n{\n    namespace css  = ::com::sun::star;\n    namespace uno  = css::uno;\n    namespace lang = css::lang;\n    namespace beans = css::beans;\n    using ::rtl::OUString;\n    using ::vos::ORef;\n    using namespace osl;\n\n    namespace\n    {\n    \/\/------------------------------------------------------------------------\n        AsciiServiceName const aConfigProviderServices[] =\n        {\n            \"com.sun.star.configuration.ConfigurationProvider\",\n            0\n        };\n        AsciiServiceName const aAdminProviderServices[] =\n        {\n            \"com.sun.star.configuration.AdministrationProvider\",\n            0\n        };\n    \/\/------------------------------------------------------------------------\n\n        ServiceImplementationInfo const aConfigProviderInfo =\n        {\n            \"com.sun.star.comp.configuration.ConfigurationProvider\",\n            aConfigProviderServices,\n            0\n        };\n        ServiceImplementationInfo const aAdminProviderInfo =\n        {\n            \"com.sun.star.comp.configuration.AdministrationProvider\",\n            aAdminProviderServices,\n            aConfigProviderServices\n        };\n    \/\/------------------------------------------------------------------------\n\n        AsciiServiceName const\n            aDefaultProviderServiceAndImplName  = A_DefaultProviderServiceAndImplName;\n\n    \/\/------------------------------------------------------------------------\n\n        AsciiServiceName const aDefaultProviderServices[] =\n        {\n            aDefaultProviderServiceAndImplName,\n            0\n        };\n    \/\/------------------------------------------------------------------------\n\n        ServiceRegistrationInfo const aDefaultProviderInfo =\n        {\n            aDefaultProviderServiceAndImplName,\n            aDefaultProviderServices\n        };\n        SingletonRegistrationInfo const aDefaultProviderSingletonInfo =\n        {\n            A_DefaultProviderSingletonName,\n            aDefaultProviderServiceAndImplName,\n            aDefaultProviderServiceAndImplName,\n            0\n        };\n    \/\/------------------------------------------------------------------------\n        typedef uno::Reference< uno::XInterface > (OConfigurationProviderImpl::*CreatorFunc)(const uno::Sequence< uno::Any >& aArguments);\n        struct ServiceCreationInfo\n        {\n            ServiceRegistrationInfo const* info;\n            CreatorFunc create;\n        };\n\n        static sal_Int32 getCreateServiceDataCount()\n        {\n            return 2;\n        };\n\n        static const ServiceCreationInfo* getCreateServiceData()\n        {\n            static ServiceCreationInfo const createServiceData[] =\n            {\n                { &configapi::aCreateReadAccessSI, &OConfigurationProviderImpl::createReadAccess },\n                { &configapi::aCreateUpdateAccessSI, &OConfigurationProviderImpl::createUpdateAccess },\n            };\n            OSL_ENSURE(sizeof(createServiceData)\/sizeof(createServiceData[0]) == getCreateServiceDataCount(),\n                \"getCreateServiceData : inconsistent data !\");\n            return createServiceData;\n        }\n    \/\/------------------------------------------------------------------------\n    }\n\n    static ServiceCreationInfo const* findCreationInfo( const OUString& aServiceSpecifier )\n    {\n        for (int i= 0; i<getCreateServiceDataCount(); ++i)\n        {\n            ServiceCreationInfo const& rCreationInfo = getCreateServiceData()[i];\n\n            ServiceRegistrationInfo const* pInfo = rCreationInfo.info;\n            if (!pInfo)\n                continue;\n\n            if (AsciiServiceName pImplName = pInfo->implementationName)\n            {\n                if (0 == aServiceSpecifier.compareToAscii(pImplName))\n                    return &rCreationInfo;\n            }\n\n            if (AsciiServiceName const* pNames = pInfo->registeredServiceNames)\n            {\n                while(*pNames)\n                {\n                    if (0 == aServiceSpecifier.compareToAscii(*pNames))\n                        return &rCreationInfo;\n\n                    ++pNames;\n                }\n            }\n        }\n        \/\/ not found\n        return 0;\n    }\n\n    #define ID_PREFETCH     1\n\n    \/\/=============================================================================\n    \/\/= OConfigurationProvider\n    \/\/=============================================================================\n    \/\/ service info export\n    const ServiceRegistrationInfo* getConfigurationProviderServiceInfo()\n    {\n        return getRegistrationInfo(&aConfigProviderInfo);\n    }\n\n    const ServiceRegistrationInfo* getAdminProviderServiceInfo()\n    {\n        return getRegistrationInfo(&aAdminProviderInfo);\n    }\n\n    const ServiceRegistrationInfo* getDefaultProviderServiceInfo()\n    {\n        return &aDefaultProviderInfo;\n    }\n\n    const SingletonRegistrationInfo* getDefaultProviderSingletonInfo()\n    {\n        return &aDefaultProviderSingletonInfo;\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    uno::Reference<uno::XInterface> SAL_CALL\n        getDefaultConfigProviderSingleton( CreationContext const& xContext )\n    {\n        OSL_ENSURE( xContext.is(), \"ERROR: NULL context has no singletons\" );\n\n        UnoContextTunnel aTunnel;\n        aTunnel.passthru( xContext );\n\n        uno::Reference<uno::XInterface> xResult;\n\n        if (xContext.is())\n        try\n        {\n            OUString aSingletonName = SINGLETON(A_DefaultProviderSingletonName);\n            uno::Any aResult = xContext->getValueByName(aSingletonName);\n            aResult >>= xResult;\n        }\n        catch (uno::Exception & )\n        {\n            \/\/ to do: really use the tunneled failure when that is set properly\n            if ( aTunnel.recoverFailure(true).hasValue() )\n            {\n                \/\/ have a failure, but can't recover it\n                \/\/ -> try to regenerate\n                instantiateDefaultProvider(xContext);\n\n                OSL_ENSURE(false, \"Cannot recreate configuration backend instantiation failure - using generic error\");\n            }\n            \/\/ cannot recover any failure\n            throw;\n        }\n\n        return xResult;\n    }\n    \/\/ ------------------------------------------------------------------------\n    \/\/ ----------------------------------------------------------------------------\n    #define TUNNEL_ALL_EXCEPTIONS()     \\\n        WRAP_CONFIGBACKEND_CREATION_EXCEPTIONS1( UnoContextTunnel::tunnelFailure, true)\n\n    \/\/ ----------------------------------------------------------------------------\n    \/\/ ------------------------------------------------------------------------\n\n    uno::Reference< uno::XInterface > SAL_CALL instantiateDefaultProvider( OProvider::CreationContext const & xTargetContext )\n    {\n        CreationContext xContext = UnoContextTunnel::recoverContext(xTargetContext);\n\n        ServiceImplementationInfo const * pProviderInfo =\n            ContextReader::testAdminService(xContext,true) ? &aAdminProviderInfo : &aConfigProviderInfo;\n\n        OConfigurationProvider* pNewProvider = new OConfigurationProvider(xContext,pProviderInfo);\n        uno::Reference< lang::XMultiServiceFactory > aRet( pNewProvider );\n\n        try\n        {\n            pNewProvider->connect();\n        }\n        TUNNEL_ALL_EXCEPTIONS()\n\n        return  aRet;\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    \/\/-----------------------------------------------------------------------------\n    OConfigurationProvider::OConfigurationProvider(\n        CreationContext const & xContext,\n        const ServiceImplementationInfo* pServices\n        )\n                           :OProvider(xContext,pServices)\n                           ,m_pImpl(NULL)\n    {\n        registerProperty(rtl::OUString::createFromAscii(\"PrefetchNodes\"),   ID_PREFETCH, 0,&m_aPrefetchNodes, ::getCppuType(static_cast< uno::Sequence< rtl::OUString > const * >(0) ));\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    OConfigurationProvider::~OConfigurationProvider()\n    {\n        delete m_pImpl;\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    void OConfigurationProvider::connect() throw (uno::Exception)\n    {\n        OSL_ENSURE( m_pImpl == NULL, \"Error: Configuration Provider already is connected\");\n\n        std::auto_ptr<OConfigurationProviderImpl> pNewImpl( new OConfigurationProviderImpl(this, m_xContext) );\n\n        implConnect(*pNewImpl,ContextReader(m_xContext));\n\n        m_pImpl = pNewImpl.release();\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    void SAL_CALL OConfigurationProvider::disposing()\n    {\n        if (m_pImpl)\n            m_pImpl->dispose();\n\n        OProvider::disposing();\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    uno::Reference< uno::XInterface > SAL_CALL OConfigurationProvider::createInstance( const OUString& aServiceSpecifier )\n        throw(uno::Exception, uno::RuntimeException)\n    {\n        \/\/ same as creating with empty sequence of arguments\n        return this->createInstanceWithArguments( aServiceSpecifier, uno::Sequence< uno::Any >() );\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    uno::Reference< uno::XInterface > SAL_CALL\n        OConfigurationProvider::createInstanceWithArguments( const OUString& aServiceSpecifier, const uno::Sequence< uno::Any >& aArguments )\n            throw(uno::Exception, uno::RuntimeException)\n    {\n        OSL_ENSURE(m_pImpl, \"OConfigurationProvider: no implementation available\");\n\n        if (ServiceCreationInfo const* pInfo = findCreationInfo(aServiceSpecifier))\n        {\n            \/\/ it's a known service name - try to create without args\n            if (CreatorFunc create = pInfo->create)\n            {\n                return (m_pImpl->*create)(aArguments);\n            }\n        }\n\n        rtl::OUStringBuffer sMsg;\n        sMsg.appendAscii(\"ConfigurationProvider: Cannot create view - \");\n        sMsg.append( aServiceSpecifier ) .appendAscii(\" is not a valid configuration access service. \");\n\n        throw lang::ServiceNotRegisteredException(sMsg.makeStringAndClear(),*this);\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    uno::Sequence< OUString > SAL_CALL OConfigurationProvider::getAvailableServiceNames(  )\n        throw(uno::RuntimeException)\n    {\n        sal_Int32 nCount = 0;\n        {\n            for (int i= 0; i< getCreateServiceDataCount(); ++i)\n                nCount += countServices(getCreateServiceData()[i].info);\n        }\n\n        uno::Sequence< OUString > aNames(nCount);\n        if (nCount > 0)\n        {\n            sal_Int32 n = 0;\n            for (int i= 0; i<getCreateServiceDataCount(); ++i)\n            {\n                ServiceRegistrationInfo const* pInfo = getCreateServiceData()[i].info;\n                AsciiServiceName const* pNames = pInfo ? pInfo->registeredServiceNames : 0;\n\n                if (pNames)\n                {\n                    while(*pNames)\n                    {\n                        aNames[n] = OUString::createFromAscii(*pNames);\n                        ++n;\n                        ++pNames;\n                    }\n                }\n            }\n        }\n\n        return aNames;\n    }\n\n    \/\/ XInterface\n    \/\/-----------------------------------------------------------------------------\n    ::com::sun::star::uno::Any SAL_CALL OConfigurationProvider::queryInterface( const ::com::sun::star::uno::Type & rType ) throw(::com::sun::star::uno::RuntimeException)\n    {\n\n        uno::Any aRet( OProvider::queryInterface(rType) );\n        if ( !aRet.hasValue() )\n            aRet = queryPropertyInterface(rType);\n        return aRet;\n    }\n\n    \/\/XTypeProvider\n    \/\/-----------------------------------------------------------------------------\n    ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > SAL_CALL OConfigurationProvider::getTypes(  ) throw(::com::sun::star::uno::RuntimeException)\n    {\n        cppu::OTypeCollection aCollection(::getCppuType( (const uno::Reference< beans::XPropertySet > *)0 ),\n                                          ::getCppuType( (const uno::Reference< beans::XFastPropertySet > *)0 ),\n                                          ::getCppuType( (const uno::Reference< beans::XMultiPropertySet > *)0 ),\n                                          OProvider::getTypes());\n        return aCollection.getTypes();\n    }\n\n    \/\/ OPropertyArrayUsageHelper\n    \/\/ -------------------------------------------------------------------------\n    ::cppu::IPropertyArrayHelper* OConfigurationProvider::createArrayHelper( ) const\n    {\n        uno::Sequence< beans::Property > aProps;\n        describeProperties(aProps);\n        return new ::cppu::OPropertyArrayHelper(aProps);\n    }\n    \/\/ -------------------------------------------------------------------------\n    ::cppu::IPropertyArrayHelper & OConfigurationProvider::getInfoHelper()\n    {\n        return *const_cast<OConfigurationProvider*>(this)->getArrayHelper();\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    void SAL_CALL OConfigurationProvider::setFastPropertyValue_NoBroadcast( sal_Int32 nHandle, const ::com::sun::star::uno::Any& rValue)\n                                                 throw (::com::sun::star::uno::Exception)\n    {\n        OProvider::setFastPropertyValue_NoBroadcast( nHandle, rValue );\n\n        uno::Sequence< OUString > aNodeList;\n        rValue >>= aNodeList;\n\n        RequestOptions const aOptions = m_pImpl->getDefaultOptions();\n\n        for (sal_Int32 i = 0; i < aNodeList.getLength(); i++)\n        {\n            using namespace configuration;\n            AbsolutePath aModulePath = AbsolutePath::makeModulePath(aNodeList[i], AbsolutePath::NoValidate());\n            m_pImpl->fetchSubtree(aModulePath , aOptions);\n        }\n    }\n\n} \/\/ namespace configmgr\n\n\n<commit_msg>INTEGRATION: CWS networker2 (1.25.78); FILE MERGED 2003\/12\/18 11:49:36 jb 1.25.78.1: #i23603# Add XLocalized to configuration provider; change requestoptions and localehelper to use UNO Locale objects internally.<commit_after>\/*************************************************************************\n *\n *  $RCSfile: confprovider2.cxx,v $\n *\n *  $Revision: 1.26 $\n *\n *  last change: $Author: obo $ $Date: 2004-01-20 16:23: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#include <stdio.h>\n\n#include \"confprovider2.hxx\"\n#include \"apiaccessobj.hxx\"\n\n#ifndef CONFIGMGR_API_PROVIDERIMPL2_HXX_\n#include \"confproviderimpl2.hxx\"\n#endif\n#ifndef CONFIGMGR_API_FACTORY_HXX_\n#include \"confapifactory.hxx\"\n#endif\n#ifndef CONFIGMGR_BOOTSTRAP_HXX_\n#include \"bootstrap.hxx\"\n#endif\n#ifndef CONFIGMGR_BOOTSTRAPCONTEXT_HXX_\n#include \"bootstrapcontext.hxx\"\n#endif\n#ifndef CONFIGMGR_WRAPEXCEPTION_HXX\n#include \"wrapexception.hxx\"\n#endif\n#ifndef _CONFIGMGR_TRACER_HXX_\n#include \"tracer.hxx\"\n#endif\n\n#ifndef _OSL_MUTEX_HXX_\n#include <osl\/mutex.hxx>\n#endif\n#ifndef _RTL_USTRBUF_HXX_\n#include <rtl\/ustrbuf.hxx>\n#endif\n#ifndef INCLUDED_ALGORITHM\n#include <algorithm>\n#define INCLUDED_ALGORITHM\n#endif\n#ifndef _COMPHELPER_SEQUENCE_HXX_\n#include <comphelper\/sequence.hxx>\n#endif\n#ifndef _CPPUHELPER_TYPEPROVIDER_HXX_\n#include <cppuhelper\/typeprovider.hxx>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYVALUE_HPP_\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#endif\n#include <com\/sun\/star\/lang\/ServiceNotRegisteredException.hpp>\n\n#define THISREF() static_cast< ::cppu::OWeakObject* >(this)\n\nnamespace configmgr\n{\n    namespace css  = ::com::sun::star;\n    namespace uno  = css::uno;\n    namespace lang = css::lang;\n    namespace beans = css::beans;\n    using ::rtl::OUString;\n    using ::vos::ORef;\n    using namespace osl;\n\n    namespace\n    {\n    \/\/------------------------------------------------------------------------\n        AsciiServiceName const aConfigProviderServices[] =\n        {\n            \"com.sun.star.configuration.ConfigurationProvider\",\n            0\n        };\n        AsciiServiceName const aAdminProviderServices[] =\n        {\n            \"com.sun.star.configuration.AdministrationProvider\",\n            0\n        };\n    \/\/------------------------------------------------------------------------\n\n        ServiceImplementationInfo const aConfigProviderInfo =\n        {\n            \"com.sun.star.comp.configuration.ConfigurationProvider\",\n            aConfigProviderServices,\n            0\n        };\n        ServiceImplementationInfo const aAdminProviderInfo =\n        {\n            \"com.sun.star.comp.configuration.AdministrationProvider\",\n            aAdminProviderServices,\n            aConfigProviderServices\n        };\n    \/\/------------------------------------------------------------------------\n\n        AsciiServiceName const\n            aDefaultProviderServiceAndImplName  = A_DefaultProviderServiceAndImplName;\n\n    \/\/------------------------------------------------------------------------\n\n        AsciiServiceName const aDefaultProviderServices[] =\n        {\n            aDefaultProviderServiceAndImplName,\n            0\n        };\n    \/\/------------------------------------------------------------------------\n\n        ServiceRegistrationInfo const aDefaultProviderInfo =\n        {\n            aDefaultProviderServiceAndImplName,\n            aDefaultProviderServices\n        };\n        SingletonRegistrationInfo const aDefaultProviderSingletonInfo =\n        {\n            A_DefaultProviderSingletonName,\n            aDefaultProviderServiceAndImplName,\n            aDefaultProviderServiceAndImplName,\n            0\n        };\n    \/\/------------------------------------------------------------------------\n        typedef uno::Reference< uno::XInterface > (OConfigurationProviderImpl::*CreatorFunc)(const uno::Sequence< uno::Any >& aArguments);\n        struct ServiceCreationInfo\n        {\n            ServiceRegistrationInfo const* info;\n            CreatorFunc create;\n        };\n\n        static sal_Int32 getCreateServiceDataCount()\n        {\n            return 2;\n        };\n\n        static const ServiceCreationInfo* getCreateServiceData()\n        {\n            static ServiceCreationInfo const createServiceData[] =\n            {\n                { &configapi::aCreateReadAccessSI, &OConfigurationProviderImpl::createReadAccess },\n                { &configapi::aCreateUpdateAccessSI, &OConfigurationProviderImpl::createUpdateAccess },\n            };\n            OSL_ENSURE(sizeof(createServiceData)\/sizeof(createServiceData[0]) == getCreateServiceDataCount(),\n                \"getCreateServiceData : inconsistent data !\");\n            return createServiceData;\n        }\n    \/\/------------------------------------------------------------------------\n    }\n\n    static ServiceCreationInfo const* findCreationInfo( const OUString& aServiceSpecifier )\n    {\n        for (int i= 0; i<getCreateServiceDataCount(); ++i)\n        {\n            ServiceCreationInfo const& rCreationInfo = getCreateServiceData()[i];\n\n            ServiceRegistrationInfo const* pInfo = rCreationInfo.info;\n            if (!pInfo)\n                continue;\n\n            if (AsciiServiceName pImplName = pInfo->implementationName)\n            {\n                if (0 == aServiceSpecifier.compareToAscii(pImplName))\n                    return &rCreationInfo;\n            }\n\n            if (AsciiServiceName const* pNames = pInfo->registeredServiceNames)\n            {\n                while(*pNames)\n                {\n                    if (0 == aServiceSpecifier.compareToAscii(*pNames))\n                        return &rCreationInfo;\n\n                    ++pNames;\n                }\n            }\n        }\n        \/\/ not found\n        return 0;\n    }\n\n    #define ID_PREFETCH     1\n\n    \/\/=============================================================================\n    \/\/= OConfigurationProvider\n    \/\/=============================================================================\n    \/\/ service info export\n    const ServiceRegistrationInfo* getConfigurationProviderServiceInfo()\n    {\n        return getRegistrationInfo(&aConfigProviderInfo);\n    }\n\n    const ServiceRegistrationInfo* getAdminProviderServiceInfo()\n    {\n        return getRegistrationInfo(&aAdminProviderInfo);\n    }\n\n    const ServiceRegistrationInfo* getDefaultProviderServiceInfo()\n    {\n        return &aDefaultProviderInfo;\n    }\n\n    const SingletonRegistrationInfo* getDefaultProviderSingletonInfo()\n    {\n        return &aDefaultProviderSingletonInfo;\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    uno::Reference<uno::XInterface> SAL_CALL\n        getDefaultConfigProviderSingleton( CreationContext const& xContext )\n    {\n        OSL_ENSURE( xContext.is(), \"ERROR: NULL context has no singletons\" );\n\n        UnoContextTunnel aTunnel;\n        aTunnel.passthru( xContext );\n\n        uno::Reference<uno::XInterface> xResult;\n\n        if (xContext.is())\n        try\n        {\n            OUString aSingletonName = SINGLETON(A_DefaultProviderSingletonName);\n            uno::Any aResult = xContext->getValueByName(aSingletonName);\n            aResult >>= xResult;\n        }\n        catch (uno::Exception & )\n        {\n            \/\/ to do: really use the tunneled failure when that is set properly\n            if ( aTunnel.recoverFailure(true).hasValue() )\n            {\n                \/\/ have a failure, but can't recover it\n                \/\/ -> try to regenerate\n                instantiateDefaultProvider(xContext);\n\n                OSL_ENSURE(false, \"Cannot recreate configuration backend instantiation failure - using generic error\");\n            }\n            \/\/ cannot recover any failure\n            throw;\n        }\n\n        return xResult;\n    }\n    \/\/ ------------------------------------------------------------------------\n    \/\/ ----------------------------------------------------------------------------\n    #define TUNNEL_ALL_EXCEPTIONS()     \\\n        WRAP_CONFIGBACKEND_CREATION_EXCEPTIONS1( UnoContextTunnel::tunnelFailure, true)\n\n    \/\/ ----------------------------------------------------------------------------\n    \/\/ ------------------------------------------------------------------------\n\n    uno::Reference< uno::XInterface > SAL_CALL instantiateDefaultProvider( OProvider::CreationContext const & xTargetContext )\n    {\n        CreationContext xContext = UnoContextTunnel::recoverContext(xTargetContext);\n\n        ServiceImplementationInfo const * pProviderInfo =\n            ContextReader::testAdminService(xContext,true) ? &aAdminProviderInfo : &aConfigProviderInfo;\n\n        OConfigurationProvider* pNewProvider = new OConfigurationProvider(xContext,pProviderInfo);\n        uno::Reference< lang::XMultiServiceFactory > aRet( pNewProvider );\n\n        try\n        {\n            pNewProvider->connect();\n        }\n        TUNNEL_ALL_EXCEPTIONS()\n\n        return  aRet;\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    \/\/-----------------------------------------------------------------------------\n    OConfigurationProvider::OConfigurationProvider(\n        CreationContext const & xContext,\n        const ServiceImplementationInfo* pServices\n        )\n                           :OProvider(xContext,pServices)\n                           ,m_pImpl(NULL)\n    {\n        registerProperty(rtl::OUString::createFromAscii(\"PrefetchNodes\"),   ID_PREFETCH, 0,&m_aPrefetchNodes, ::getCppuType(static_cast< uno::Sequence< rtl::OUString > const * >(0) ));\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    OConfigurationProvider::~OConfigurationProvider()\n    {\n        delete m_pImpl;\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    void OConfigurationProvider::connect() throw (uno::Exception)\n    {\n        OSL_ENSURE( m_pImpl == NULL, \"Error: Configuration Provider already is connected\");\n\n        std::auto_ptr<OConfigurationProviderImpl> pNewImpl( new OConfigurationProviderImpl(this, m_xContext) );\n\n        implConnect(*pNewImpl,ContextReader(m_xContext));\n\n        m_pImpl = pNewImpl.release();\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    void SAL_CALL OConfigurationProvider::disposing()\n    {\n        if (m_pImpl)\n            m_pImpl->dispose();\n\n        OProvider::disposing();\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    uno::Reference< uno::XInterface > SAL_CALL OConfigurationProvider::createInstance( const OUString& aServiceSpecifier )\n        throw(uno::Exception, uno::RuntimeException)\n    {\n        \/\/ same as creating with empty sequence of arguments\n        return this->createInstanceWithArguments( aServiceSpecifier, uno::Sequence< uno::Any >() );\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    uno::Reference< uno::XInterface > SAL_CALL\n        OConfigurationProvider::createInstanceWithArguments( const OUString& aServiceSpecifier, const uno::Sequence< uno::Any >& aArguments )\n            throw(uno::Exception, uno::RuntimeException)\n    {\n        OSL_ENSURE(m_pImpl, \"OConfigurationProvider: no implementation available\");\n\n        if (ServiceCreationInfo const* pInfo = findCreationInfo(aServiceSpecifier))\n        {\n            \/\/ it's a known service name - try to create without args\n            if (CreatorFunc create = pInfo->create)\n            {\n                return (m_pImpl->*create)(aArguments);\n            }\n        }\n\n        rtl::OUStringBuffer sMsg;\n        sMsg.appendAscii(\"ConfigurationProvider: Cannot create view - \");\n        sMsg.append( aServiceSpecifier ) .appendAscii(\" is not a valid configuration access service. \");\n\n        throw lang::ServiceNotRegisteredException(sMsg.makeStringAndClear(),*this);\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    uno::Sequence< OUString > SAL_CALL OConfigurationProvider::getAvailableServiceNames(  )\n        throw(uno::RuntimeException)\n    {\n        sal_Int32 nCount = 0;\n        {\n            for (int i= 0; i< getCreateServiceDataCount(); ++i)\n                nCount += countServices(getCreateServiceData()[i].info);\n        }\n\n        uno::Sequence< OUString > aNames(nCount);\n        if (nCount > 0)\n        {\n            sal_Int32 n = 0;\n            for (int i= 0; i<getCreateServiceDataCount(); ++i)\n            {\n                ServiceRegistrationInfo const* pInfo = getCreateServiceData()[i].info;\n                AsciiServiceName const* pNames = pInfo ? pInfo->registeredServiceNames : 0;\n\n                if (pNames)\n                {\n                    while(*pNames)\n                    {\n                        aNames[n] = OUString::createFromAscii(*pNames);\n                        ++n;\n                        ++pNames;\n                    }\n                }\n            }\n        }\n\n        return aNames;\n    }\n\n    \/\/ XLocalizable\n    \/\/-----------------------------------------------------------------------------\n    void SAL_CALL OConfigurationProvider::setLocale( const lang::Locale& eLocale )\n        throw (uno::RuntimeException)\n    {\n        OSL_ENSURE(m_pImpl, \"OConfigurationProvider: no implementation available\");\n\n        m_pImpl->setDefaultLocale( eLocale );\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    lang::Locale SAL_CALL OConfigurationProvider::getLocale(  )\n        throw (uno::RuntimeException)\n    {\n        OSL_ENSURE(m_pImpl, \"OConfigurationProvider: no implementation available\");\n\n        return m_pImpl->getDefaultOptions().getUnoLocale();\n    }\n\n    \/\/ XInterface\n    \/\/-----------------------------------------------------------------------------\n    ::com::sun::star::uno::Any SAL_CALL OConfigurationProvider::queryInterface( const ::com::sun::star::uno::Type & rType ) throw(::com::sun::star::uno::RuntimeException)\n    {\n\n        uno::Any aRet( OProvider::queryInterface(rType) );\n        if ( !aRet.hasValue() )\n            aRet = queryPropertyInterface(rType);\n        return aRet;\n    }\n\n    \/\/XTypeProvider\n    \/\/-----------------------------------------------------------------------------\n    ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type > SAL_CALL OConfigurationProvider::getTypes(  ) throw(::com::sun::star::uno::RuntimeException)\n    {\n        cppu::OTypeCollection aCollection(::getCppuType( (const uno::Reference< beans::XPropertySet > *)0 ),\n                                          ::getCppuType( (const uno::Reference< beans::XFastPropertySet > *)0 ),\n                                          ::getCppuType( (const uno::Reference< beans::XMultiPropertySet > *)0 ),\n                                          OProvider::getTypes());\n        return aCollection.getTypes();\n    }\n\n    \/\/ OPropertyArrayUsageHelper\n    \/\/ -------------------------------------------------------------------------\n    ::cppu::IPropertyArrayHelper* OConfigurationProvider::createArrayHelper( ) const\n    {\n        uno::Sequence< beans::Property > aProps;\n        describeProperties(aProps);\n        return new ::cppu::OPropertyArrayHelper(aProps);\n    }\n    \/\/ -------------------------------------------------------------------------\n    ::cppu::IPropertyArrayHelper & OConfigurationProvider::getInfoHelper()\n    {\n        return *const_cast<OConfigurationProvider*>(this)->getArrayHelper();\n    }\n\n    \/\/-----------------------------------------------------------------------------\n    void SAL_CALL OConfigurationProvider::setFastPropertyValue_NoBroadcast( sal_Int32 nHandle, const ::com::sun::star::uno::Any& rValue)\n                                                 throw (::com::sun::star::uno::Exception)\n    {\n        OProvider::setFastPropertyValue_NoBroadcast( nHandle, rValue );\n\n        uno::Sequence< OUString > aNodeList;\n        rValue >>= aNodeList;\n\n        RequestOptions const aOptions = m_pImpl->getDefaultOptions();\n\n        for (sal_Int32 i = 0; i < aNodeList.getLength(); i++)\n        {\n            using namespace configuration;\n            AbsolutePath aModulePath = AbsolutePath::makeModulePath(aNodeList[i], AbsolutePath::NoValidate());\n            m_pImpl->fetchSubtree(aModulePath , aOptions);\n        }\n    }\n\n} \/\/ namespace configmgr\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2011-2012 DarkCore <http:\/\/www.darkpeninsula.eu\/>\n * Copyright (C) 2011-2012 Project SkyFire <http:\/\/www.projectskyfire.org\/>\n * Copyright (C) 2008-2012 TrinityCore <http:\/\/www.trinitycore.org\/>\n * Copyright (C) 2005-2012 MaNGOS <http:\/\/getmangos.com\/>\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\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 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 \"ScriptPCH.h\"\n#include \"ScriptedEscortAI.h\"\n#include \"SpellMgr.h\"\n#include \"Player.h\"\n#include \"Creature.h\"\n\nenum NPC_DefiantTroll\n{\n    DEFIANT_KILL_CREDIT                = 34830,\n    SPELL_LIGHTNING_VISUAL             = 66306,\n    QUEST_GOOD_HELP_IS_HARD_TO_FIND    = 14069,\n    GO_DEPOSIT                         = 195492,\n};\n\nenum Yells\n{\n    SAY_WORK_1    = -1100000,\n    SAY_WORK_2    = -1100001,\n    SAY_WORK_3    = -1100002,\n    SAY_WORK_4    = -1100003,\n    SAY_WORK_5    = -1100004,\n    SAY_WORK_6    = -1100005,\n    SAY_WORK_7    = -1100006,\n    SAY_WORK_8    = -1100007,\n};\n\nclass npc_defiant_troll : public CreatureScript\n{\n    public:\n    npc_defiant_troll() : CreatureScript(\"npc_defiant_troll\") { }\n\n    CreatureAI* GetAI(Creature* creature) const\n    {\n        return new npc_defiant_trollAI(creature);\n    }\n\n    struct npc_defiant_trollAI : public ScriptedAI\n    {\n        npc_defiant_trollAI(Creature* creature) : ScriptedAI(creature) { }\n\n        uint32 rebuffTimer;\n        bool work;\n\n        void Reset ()\n        {\n            rebuffTimer = 0;\n            work = false;\n        }\n\n        void MovementInform(uint32 \/*type*\/, uint32 id)\n        {\n            if (id == 1)\n                work = true;\n        }\n\n        void SpellHit(Unit* caster, const SpellEntry* spell)\n        {\n            if (spell->Id == SPELL_LIGHTNING_VISUAL && caster->GetTypeId() == TYPEID_PLAYER && caster->ToPlayer()->GetQuestStatus(QUEST_GOOD_HELP_IS_HARD_TO_FIND) == QUEST_STATUS_INCOMPLETE && work == false)\n            {\n                caster->ToPlayer()->KilledMonsterCredit(DEFFIANT_KILL_CREDIT, me->GetGUID());\n                switch (urand(0, 7))\n                {\n                    case 0:\n                        DoScriptText(SAY_WORK_1, me);\n                        break;\n                    case 1:\n                        DoScriptText(SAY_WORK_2, me);\n                        break;\n                    case 2:\n                        DoScriptText(SAY_WORK_3, me);\n                        break;\n                    case 3:\n                        DoScriptText(SAY_WORK_4, me);\n                        break;\n                    case 4:\n                        DoScriptText(SAY_WORK_5, me);\n                        break;\n                    case 5:\n                        DoScriptText(SAY_WORK_6, me);\n                        break;\n                    case 6:\n                        DoScriptText(SAY_WORK_7, me);\n                        break;\n                    case 7:\n                        DoScriptText(SAY_WORK_8, me);\n                        break;\n                }\n                \n                me->RemoveAllAuras();\n                me->RemoveFlag(UNIT_NPC_FLAGS, UNIT_NPC_FLAG_GOSSIP);\n                \n                if (GameObject* Deposit = me->FindNearestGameObject(GO_DEPOSIT, 200))\n                    me->GetMotionMaster()->MovePoint(1, Deposit->GetPositionX()-1, Deposit->GetPositionY(), Deposit->GetPositionZ());\n            }\n        }\n\n        void UpdateAI(const uint32 diff)\n        {\n            if (work == true)\n                me->HandleEmoteCommand(467);\n\n            if (rebuffTimer <= diff)\n            {\n                switch (urand(0, 2))\n                {\n                    case 0:\n                        me->HandleEmoteCommand(412);\n                        break;\n                    case 1:\n                        me->HandleEmoteCommand(10);\n                        break;\n                    case 2:\n                        me->HandleEmoteCommand(0);\n                        break;\n                }\n                rebuffTimer = 120000;\n            }\n            else\n                rebuffTimer -= diff;\n\n            if (!UpdateVictim())\n                return;\n\n            DoMeleeAttackIfReady();\n        }\n    };\n\n    bool OnGossipHello(Player* player, Creature* creature)\n    {\n        if (player->GetQuestStatus(QUEST_GOOD_HELP_IS_HARD_TO_FIND) == QUEST_STATUS_INCOMPLETE)\n        {\n            player->CastSpell(creature, SPELL_LIGHTNING_VISUAL, true);\n            SpellEntry const* spell = sSpellStore.LookupEntry(SPELL_LIGHTNING_VISUAL);\n            CAST_AI(npc_defiant_troll::npc_defiant_trollAI, creature->AI())->SpellHit(player, spell);\n            return true;\n        }\n        else\n        {\n            creature->RemoveFlag(UNIT_NPC_FLAGS, UNIT_NPC_FLAG_GOSSIP);\n            return true;\n        }\n    }\n};\n\n\/\/ this can be moved to SAI.\n\/\/ npc_fourth_and_goal_target - http:\/\/www.wowhead.com\/npc=37203\/fourth-and-goal-target\nclass npc_fourth_and_goal_target : public CreatureScript\n{\npublic:\n    npc_fourth_and_goal_target() : CreatureScript(\"npc_fourth_and_goal_target\") { }\n\n    struct npc_fourth_and_goal_targetAI : public ScriptedAI\n    {\n        npc_fourth_and_goal_targetAI(Creature* creature) : ScriptedAI(creature) {}\n\n        void Reset() {}\n\n        void UpdateAI(const uint32 diff)\n        {\n            Unit* target = NULL;\n            target = me->SelectNearestTarget(5.0f);\n            if (target && target->GetTypeId() == TYPEID_PLAYER)\n                if (target->ToPlayer()->GetQuestStatus(28414) == QUEST_STATUS_INCOMPLETE)\n                    target->ToPlayer()->KilledMonsterCredit(37203, 0);\n        }\n    };\n\n    CreatureAI* GetAI(Creature* creature) const\n    {\n        return new npc_fourth_and_goal_targetAI(creature);\n    }\n};\n\nvoid AddSC_kezan()\n{\n    new npc_fourth_and_goal_target;\n    new npc_defiant_troll;\n}<commit_msg>Another Typo<commit_after>\/*\n * Copyright (C) 2011-2012 DarkCore <http:\/\/www.darkpeninsula.eu\/>\n * Copyright (C) 2011-2012 Project SkyFire <http:\/\/www.projectskyfire.org\/>\n * Copyright (C) 2008-2012 TrinityCore <http:\/\/www.trinitycore.org\/>\n * Copyright (C) 2005-2012 MaNGOS <http:\/\/getmangos.com\/>\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\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 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 \"ScriptPCH.h\"\n#include \"ScriptedEscortAI.h\"\n#include \"SpellMgr.h\"\n#include \"Player.h\"\n#include \"Creature.h\"\n\nenum NPC_DefiantTroll\n{\n    DEFIANT_KILL_CREDIT                = 34830,\n    SPELL_LIGHTNING_VISUAL             = 66306,\n    QUEST_GOOD_HELP_IS_HARD_TO_FIND    = 14069,\n    GO_DEPOSIT                         = 195492,\n};\n\nenum Yells\n{\n    SAY_WORK_1    = -1100000,\n    SAY_WORK_2    = -1100001,\n    SAY_WORK_3    = -1100002,\n    SAY_WORK_4    = -1100003,\n    SAY_WORK_5    = -1100004,\n    SAY_WORK_6    = -1100005,\n    SAY_WORK_7    = -1100006,\n    SAY_WORK_8    = -1100007,\n};\n\nclass npc_defiant_troll : public CreatureScript\n{\n    public:\n    npc_defiant_troll() : CreatureScript(\"npc_defiant_troll\") { }\n\n    CreatureAI* GetAI(Creature* creature) const\n    {\n        return new npc_defiant_trollAI(creature);\n    }\n\n    struct npc_defiant_trollAI : public ScriptedAI\n    {\n        npc_defiant_trollAI(Creature* creature) : ScriptedAI(creature) { }\n\n        uint32 rebuffTimer;\n        bool work;\n\n        void Reset ()\n        {\n            rebuffTimer = 0;\n            work = false;\n        }\n\n        void MovementInform(uint32 \/*type*\/, uint32 id)\n        {\n            if (id == 1)\n                work = true;\n        }\n\n        void SpellHit(Unit* caster, const SpellEntry* spell)\n        {\n            if (spell->Id == SPELL_LIGHTNING_VISUAL && caster->GetTypeId() == TYPEID_PLAYER && caster->ToPlayer()->GetQuestStatus(QUEST_GOOD_HELP_IS_HARD_TO_FIND) == QUEST_STATUS_INCOMPLETE && work == false)\n            {\n                caster->ToPlayer()->KilledMonsterCredit(DEFIANT_KILL_CREDIT, me->GetGUID());\n                switch (urand(0, 7))\n                {\n                    case 0:\n                        DoScriptText(SAY_WORK_1, me);\n                        break;\n                    case 1:\n                        DoScriptText(SAY_WORK_2, me);\n                        break;\n                    case 2:\n                        DoScriptText(SAY_WORK_3, me);\n                        break;\n                    case 3:\n                        DoScriptText(SAY_WORK_4, me);\n                        break;\n                    case 4:\n                        DoScriptText(SAY_WORK_5, me);\n                        break;\n                    case 5:\n                        DoScriptText(SAY_WORK_6, me);\n                        break;\n                    case 6:\n                        DoScriptText(SAY_WORK_7, me);\n                        break;\n                    case 7:\n                        DoScriptText(SAY_WORK_8, me);\n                        break;\n                }\n                \n                me->RemoveAllAuras();\n                me->RemoveFlag(UNIT_NPC_FLAGS, UNIT_NPC_FLAG_GOSSIP);\n                \n                if (GameObject* Deposit = me->FindNearestGameObject(GO_DEPOSIT, 200))\n                    me->GetMotionMaster()->MovePoint(1, Deposit->GetPositionX()-1, Deposit->GetPositionY(), Deposit->GetPositionZ());\n            }\n        }\n\n        void UpdateAI(const uint32 diff)\n        {\n            if (work == true)\n                me->HandleEmoteCommand(467);\n\n            if (rebuffTimer <= diff)\n            {\n                switch (urand(0, 2))\n                {\n                    case 0:\n                        me->HandleEmoteCommand(412);\n                        break;\n                    case 1:\n                        me->HandleEmoteCommand(10);\n                        break;\n                    case 2:\n                        me->HandleEmoteCommand(0);\n                        break;\n                }\n                rebuffTimer = 120000;\n            }\n            else\n                rebuffTimer -= diff;\n\n            if (!UpdateVictim())\n                return;\n\n            DoMeleeAttackIfReady();\n        }\n    };\n\n    bool OnGossipHello(Player* player, Creature* creature)\n    {\n        if (player->GetQuestStatus(QUEST_GOOD_HELP_IS_HARD_TO_FIND) == QUEST_STATUS_INCOMPLETE)\n        {\n            player->CastSpell(creature, SPELL_LIGHTNING_VISUAL, true);\n            SpellEntry const* spell = sSpellStore.LookupEntry(SPELL_LIGHTNING_VISUAL);\n            CAST_AI(npc_defiant_troll::npc_defiant_trollAI, creature->AI())->SpellHit(player, spell);\n            return true;\n        }\n        else\n        {\n            creature->RemoveFlag(UNIT_NPC_FLAGS, UNIT_NPC_FLAG_GOSSIP);\n            return true;\n        }\n    }\n};\n\n\/\/ this can be moved to SAI.\n\/\/ npc_fourth_and_goal_target - http:\/\/www.wowhead.com\/npc=37203\/fourth-and-goal-target\nclass npc_fourth_and_goal_target : public CreatureScript\n{\npublic:\n    npc_fourth_and_goal_target() : CreatureScript(\"npc_fourth_and_goal_target\") { }\n\n    struct npc_fourth_and_goal_targetAI : public ScriptedAI\n    {\n        npc_fourth_and_goal_targetAI(Creature* creature) : ScriptedAI(creature) {}\n\n        void Reset() {}\n\n        void UpdateAI(const uint32 diff)\n        {\n            Unit* target = NULL;\n            target = me->SelectNearestTarget(5.0f);\n            if (target && target->GetTypeId() == TYPEID_PLAYER)\n                if (target->ToPlayer()->GetQuestStatus(28414) == QUEST_STATUS_INCOMPLETE)\n                    target->ToPlayer()->KilledMonsterCredit(37203, 0);\n        }\n    };\n\n    CreatureAI* GetAI(Creature* creature) const\n    {\n        return new npc_fourth_and_goal_targetAI(creature);\n    }\n};\n\nvoid AddSC_kezan()\n{\n    new npc_fourth_and_goal_target;\n    new npc_defiant_troll;\n}<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n\n  nomlib - C++11 cross-platform game engine\n\nCopyright (c) 2013, 2014 Jeffrey Carpenter <i8degrees@gmail.com>\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n\n1. Redistributions of source code must retain the above copyright notice, this\n   list of conditions and the following disclaimer.\n2. Redistributions in binary form must reproduce the above copyright notice,\n   this list of conditions and the following disclaimer in the documentation\n   and\/or other materials provided with the distribution.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\nANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\nWARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\nANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\nLOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\nON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n******************************************************************************\/\n#ifndef NOMLIB_STDINT_TYPES_HPP\n#define NOMLIB_STDINT_TYPES_HPP\n\n#include <string> \/\/ std::size_t\n#include <vector>\n#include <limits> \/\/ min && max types\n\n#include \"nomlib\/platforms.hpp\"\n\n\/\/ RTTI for library objects.\n#include \"nomlib\/core\/ObjectTypeInfo.hpp\"\n\n\/*\n  TODO: This should be replaced by an actual CMake script -- think:\n        compile-time check for the necessary feature support for C++11 style\n        headers support.\n\n        Look into why GCC doesn't like the inclusion of <cstdint> -- otherwise\n        known as stdint.h. MSVCPP2013 & llvm-clang are fine with it).\n*\/\n\n#ifndef NOM_PLATFORM_LINUX  \/\/ To be replace with NOM_COMPILER_FEATURE_NULLPTR\n                            \/\/ (see above TODO note).\n  #include <cstdint>\n#else\n  #include <sys\/types.h>\n#endif\n\n\/\/ FIXME: The following declaration is necessary in order to avoid a very\n\/\/ nasty compiling conflict that can happen under Windows anytime the\n\/\/ windef.h header file is included (commonly from windows.h), due to min and\n\/\/ max macros being declared there. This is why macros are evil.\n\/\/\n\/\/ http:\/\/support.microsoft.com\/kb\/143208\n\/\/ http:\/\/stackoverflow.com\/questions\/5004858\/stdmin-gives-error\n#if defined( NOM_PLATFORM_WINDOWS )\n  #undef min\n  #undef max\n#endif\n\n\/\/ Borrowed from \/usr\/include\/MacTypes.h && \/usr\/include\/objc\/objc.h:\n#ifndef NULL\n  #if defined( NOM_COMPILER_FEATURE_NULLPTR )\n    #define NULL nullptr\n  #else\n    #define NULL 0 \/\/__DARWIN_NULL\n  #endif\n#endif \/\/ ! NULL\n\n\/\/ Portable fixed-size data types derive from stdint.h\nnamespace nom {\n\n\/\/\/ \\brief Signed 8-bit integer.\ntypedef int8_t int8;\n\n\/\/\/ \\brief Unsigned 8-bit integer.\ntypedef uint8_t uint8;\n\n\/\/\/ \\brief Signed 16-bit integer.\ntypedef int16_t int16;\n\n\/\/\/ \\brief Unsigned 16-bit integer.\ntypedef uint16_t uint16;\n\n\/\/\/ \\brief Signed 32-bit integer.\ntypedef int32_t int32;\n\n\/\/\/ \\brief Unsigned 16-bit integer.\ntypedef uint32_t uint32;\n\n\/\/\/ \\brief 64-bit integer types\n\/\/\/ \\note As per **\/usr\/include\/MacTypes.h**:\n\/\/\/\n\/\/\/ \"The MS Visual C\/C++ compiler uses __int64 instead of long long\".\n#if defined( NOM_COMPILER_MSVCPP ) && defined( NOM_PLATFORM_ARCH_X86 )\n  typedef signed __int64 int64;\n  typedef unsigned __int64 uint64;\n#else \/\/ Blindly assume a 64-bit architecture\n  typedef int64_t int64;    \/\/typedef signed long long int int64;\n  typedef uint64_t uint64;  \/\/typedef unsigned long long int uint64;\n#endif\n\n\/\/ Additional integer type definitions\n\n\/\/\/ \\brief Unsigned 8-bit character.\ntypedef unsigned char uchar;\n\n\/\/\/ \\brief Variable-size (platform-defined) signed integer.\n\/\/\/ \\deprecated This will be removed in a future version; use int type instead.\ntypedef signed int sint;\n\n\/\/\/ \\brief Variable-size (platform-defined) unsigned integer.\ntypedef unsigned int uint;\n\ntypedef std::size_t size_type;\n\ntypedef intptr_t* int_ptr;\ntypedef uintptr_t* uint_ptr;\n\n\/\/\/ \\deprecated This will be removed in a future version; use int_ptr type\n\/\/\/ instead.\ntypedef sint* sint_ptr;\n\ntypedef int32_t* int32_ptr;\ntypedef uint32_t* uint32_ptr;\n\ntypedef void* void_ptr;\n\ntypedef unsigned long ulong;\n\n\/\/ Definitions for minimum && maximum integral types\n\/\/\n\/\/ http:\/\/en.cppreference.com\/w\/cpp\/types\/numeric_limits\nconst int int_min = std::numeric_limits<int>::lowest();\nconst int int_max = std::numeric_limits<int>::max();\nconst uint uint_min = std::numeric_limits<uint>::lowest();\nconst uint uint_max = std::numeric_limits<uint>::max();\n\nconst int char_min = std::numeric_limits<char>::lowest();\nconst int char_max = std::numeric_limits<char>::max();\nconst uint uchar_min = std::numeric_limits<uchar>::lowest();\nconst uint uchar_max = std::numeric_limits<uchar>::max();\n\n\/\/ Always an unsigned type\nconst size_type size_type_min = std::numeric_limits<size_type>::lowest();\nconst size_type size_type_max = std::numeric_limits<size_type>::max();\n\n\/\/\/ \\brief An integer indicating that there is no match, an error or NULL.\nstatic const int npos = -1;\n\n\/\/\/ \\brief The default standard point size for fonts.\n\/\/\/\n\/\/\/ \\remarks Used in default initialization of nom::Text, nom::UIWidget, etc.\nstatic const int DEFAULT_FONT_SIZE = 12;\n\n\/\/\/ \\brief Alignment types.\n\/\/\/\n\/\/\/ \\remarks See also, nom::Anchor enumeration.\n\/\/\/\n\/\/\/ \\note Borrowed from [maelstrom's screenlib](https:\/\/hg.libsdl.org\/Maelstrom\/)\nenum Alignment: uint32\n{\n  NONE = 0x0,\n  X_LEFT = 0x01,\n  X_CENTER = 0x02,\n  X_RIGHT = 0x4,\n\n  \/\/\/ \\remarks Horizontal\n  X_MASK = ( X_LEFT | X_CENTER | X_RIGHT ),\n\n  Y_TOP = 0x10,\n  Y_CENTER = 0x20,\n  Y_BOTTOM = 0x40,\n\n  \/\/\/ \\remarks Vertical\n  Y_MASK = ( Y_TOP | Y_CENTER | Y_BOTTOM )\n};\n\n\/\/\/ \\note Borrowed from [maelstrom's screenlib](https:\/\/hg.libsdl.org\/Maelstrom\/)\nenum Anchor: uint32\n{\n  None = NONE,                          \/\/ 0\n  Left = X_LEFT,                        \/\/ 1\n  Center = X_CENTER,                    \/\/ 2\n  Right = X_RIGHT,                      \/\/ 4\n\n  TopLeft = Y_TOP | X_LEFT,             \/\/ Hex: 0x11, Dec: 17\n  TopCenter = Y_TOP | X_CENTER,         \/\/ Hex: 0x12, Dec: 18\n  TopRight = Y_TOP | X_RIGHT,           \/\/ Hex: 0x14, Dec: 20\n\n  MiddleLeft = Y_CENTER | X_LEFT,       \/\/ Hex: 0x21, Dec: 33\n  MiddleCenter = Y_CENTER | X_CENTER,   \/\/ Hex: 0x22, Dec: 34\n  MiddleRight = Y_CENTER | X_RIGHT,     \/\/ Hex: 0x24, Dec: 36\n\n  BottomLeft = Y_BOTTOM | X_LEFT,       \/\/ Hex: 0x41, Dec: 65\n  BottomCenter = Y_BOTTOM | X_CENTER,   \/\/ Hex: 0x42, Dec: 66\n  BottomRight = Y_BOTTOM | X_RIGHT      \/\/ Hex: 0x44, Dec: 68\n};\n\ntypedef std::vector<std::string> StringList;\n\n} \/\/ namespace nom\n\n\/\/\/ Ensure our data types have the right sizes using C++11 compile-time asserts.\nstatic_assert ( sizeof ( nom::uint8 ) == 1, \"nom::uint8\" );\nstatic_assert ( sizeof ( nom::int8 ) == 1, \"nom::int8\" );\n\nstatic_assert ( sizeof ( nom::uint16 ) == 2, \"nom::uint16\" );\nstatic_assert ( sizeof ( nom::int16 ) == 2, \"nom::int16\" );\n\nstatic_assert ( sizeof ( nom::uint32 ) == 4, \"nom::uint32\" );\nstatic_assert ( sizeof ( nom::int32 ) == 4, \"nom::int32\" );\n\nstatic_assert ( sizeof ( nom::uint64 ) == 8, \"nom::uint64\" );\nstatic_assert ( sizeof ( nom::int64 ) == 8, \"nom::int64\" );\n\nstatic_assert ( sizeof ( nom::uchar ) == 1, \"nom::uchar\" );\n\n\/\/ Blindly assumes we are on either a 64-bit or 32-bit platform.\n#if defined( NOM_PLATFORM_ARCH_X86_64 )\n  static_assert( sizeof ( nom::ulong ) == 8, \"nom::ulong\" );\n  static_assert( sizeof ( nom::size_type ) == 8, \"nom::size_type\" );\n#else \/\/ #elif defined( NOM_PLATFORM_ARCH_X86_86 )\n  static_assert( sizeof ( nom::ulong ) == 4, \"nom::ulong\" );\n  static_assert( sizeof ( nom::size_type ) == 4, \"nom::size_type\" );\n#endif\n\n\/\/ Blindly assumes we are on either a 64-bit or 32-bit platform.\n#if defined( NOM_PLATFORM_ARCH_X86_64 )\n  static_assert( sizeof(nom::int_ptr) == 8, \"nom::int_ptr\" );\n  static_assert( sizeof(nom::uint_ptr) == 8, \"nom::uint_ptr\" );\n  static_assert( sizeof ( nom::int32_ptr ) == ( sizeof(long) ), \"nom::int32_ptr\" );\n  static_assert( sizeof ( nom::uint32_ptr ) == ( sizeof(nom::ulong) ), \"nom::uint32_ptr\" );\n#else \/\/ #elif defined(NOM_PLATFORM_ARCH_X86)\n  static_assert( sizeof(nom::int_ptr) == 4, \"nom::int_ptr\" );\n  static_assert( sizeof(nom::uint_ptr) == 4, \"nom::uint_ptr\" );\n  static_assert( sizeof( nom::int32_ptr ) == ( sizeof( long ) ), \"nom::int32_ptr\" );\n  static_assert( sizeof( nom::uint32_ptr ) == ( sizeof( nom::ulong ) ), \"nom::uint32_ptr\" );\n#endif\n\n\/\/\/ Additional type definitions\n\nconst nom::sint NOM_EXIT_FAILURE = 1; \/\/ EXIT_FAILURE from cstdlib headers\nconst nom::sint NOM_EXIT_SUCCESS = 0; \/\/ EXIT_SUCCESS from cstdlib headers\n\n\/\/#if defined(HAVE_SDL2)\nconst nom::sint SDL_SUCCESS = 0; \/\/ Non-error return value for SDL2 API\n\/\/#endif\n\n#endif \/\/ include guard defined\n<commit_msg>types.hpp: Add real32, real64 typedefs<commit_after>\/******************************************************************************\n\n  nomlib - C++11 cross-platform game engine\n\nCopyright (c) 2013, 2014 Jeffrey Carpenter <i8degrees@gmail.com>\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n\n1. Redistributions of source code must retain the above copyright notice, this\n   list of conditions and the following disclaimer.\n2. Redistributions in binary form must reproduce the above copyright notice,\n   this list of conditions and the following disclaimer in the documentation\n   and\/or other materials provided with the distribution.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\nANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\nWARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\nANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\nLOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\nON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n******************************************************************************\/\n#ifndef NOMLIB_STDINT_TYPES_HPP\n#define NOMLIB_STDINT_TYPES_HPP\n\n#include <string> \/\/ std::size_t\n#include <vector>\n#include <limits> \/\/ min && max types\n\n#include \"nomlib\/platforms.hpp\"\n\n\/\/ RTTI for library objects.\n#include \"nomlib\/core\/ObjectTypeInfo.hpp\"\n\n\/*\n  TODO: This should be replaced by an actual CMake script -- think:\n        compile-time check for the necessary feature support for C++11 style\n        headers support.\n\n        Look into why GCC doesn't like the inclusion of <cstdint> -- otherwise\n        known as stdint.h. MSVCPP2013 & llvm-clang are fine with it).\n*\/\n\n#ifndef NOM_PLATFORM_LINUX  \/\/ To be replace with NOM_COMPILER_FEATURE_NULLPTR\n                            \/\/ (see above TODO note).\n  #include <cstdint>\n#else\n  #include <sys\/types.h>\n#endif\n\n\/\/ FIXME: The following declaration is necessary in order to avoid a very\n\/\/ nasty compiling conflict that can happen under Windows anytime the\n\/\/ windef.h header file is included (commonly from windows.h), due to min and\n\/\/ max macros being declared there. This is why macros are evil.\n\/\/\n\/\/ http:\/\/support.microsoft.com\/kb\/143208\n\/\/ http:\/\/stackoverflow.com\/questions\/5004858\/stdmin-gives-error\n#if defined( NOM_PLATFORM_WINDOWS )\n  #undef min\n  #undef max\n#endif\n\n\/\/ Borrowed from \/usr\/include\/MacTypes.h && \/usr\/include\/objc\/objc.h:\n#ifndef NULL\n  #if defined( NOM_COMPILER_FEATURE_NULLPTR )\n    #define NULL nullptr\n  #else\n    #define NULL 0 \/\/__DARWIN_NULL\n  #endif\n#endif \/\/ ! NULL\n\n\/\/ Portable fixed-size data types derive from stdint.h\nnamespace nom {\n\n\/\/\/ \\brief Signed 8-bit integer.\ntypedef int8_t int8;\n\n\/\/\/ \\brief Unsigned 8-bit integer.\ntypedef uint8_t uint8;\n\n\/\/\/ \\brief Signed 16-bit integer.\ntypedef int16_t int16;\n\n\/\/\/ \\brief Unsigned 16-bit integer.\ntypedef uint16_t uint16;\n\n\/\/\/ \\brief Signed 32-bit integer.\ntypedef int32_t int32;\n\n\/\/\/ \\brief Unsigned 16-bit integer.\ntypedef uint32_t uint32;\n\n\/\/\/ \\brief 32-bit IEEE floating-point value.\ntypedef float real32;\n\n\/\/\/ \\brief 64-bit IEEE floating-point value.\ntypedef double real64;\n\n\/\/\/ \\brief 64-bit integer types\n\/\/\/ \\note As per **\/usr\/include\/MacTypes.h**:\n\/\/\/\n\/\/\/ \"The MS Visual C\/C++ compiler uses __int64 instead of long long\".\n#if defined( NOM_COMPILER_MSVCPP ) && defined( NOM_PLATFORM_ARCH_X86 )\n  typedef signed __int64 int64;\n  typedef unsigned __int64 uint64;\n#else \/\/ Blindly assume a 64-bit architecture\n  typedef int64_t int64;    \/\/typedef signed long long int int64;\n  typedef uint64_t uint64;  \/\/typedef unsigned long long int uint64;\n#endif\n\n\/\/ Additional integer type definitions\n\n\/\/\/ \\brief Unsigned 8-bit character.\ntypedef unsigned char uchar;\n\n\/\/\/ \\brief Variable-size (platform-defined) signed integer.\n\/\/\/ \\deprecated This will be removed in a future version; use int type instead.\ntypedef signed int sint;\n\n\/\/\/ \\brief Variable-size (platform-defined) unsigned integer.\ntypedef unsigned int uint;\n\ntypedef std::size_t size_type;\n\ntypedef intptr_t* int_ptr;\ntypedef uintptr_t* uint_ptr;\n\n\/\/\/ \\deprecated This will be removed in a future version; use int_ptr type\n\/\/\/ instead.\ntypedef sint* sint_ptr;\n\ntypedef int32_t* int32_ptr;\ntypedef uint32_t* uint32_ptr;\n\ntypedef void* void_ptr;\n\ntypedef unsigned long ulong;\n\n\/\/ Definitions for minimum && maximum integral types\n\/\/\n\/\/ http:\/\/en.cppreference.com\/w\/cpp\/types\/numeric_limits\nconst int int_min = std::numeric_limits<int>::lowest();\nconst int int_max = std::numeric_limits<int>::max();\nconst uint uint_min = std::numeric_limits<uint>::lowest();\nconst uint uint_max = std::numeric_limits<uint>::max();\n\nconst int char_min = std::numeric_limits<char>::lowest();\nconst int char_max = std::numeric_limits<char>::max();\nconst uint uchar_min = std::numeric_limits<uchar>::lowest();\nconst uint uchar_max = std::numeric_limits<uchar>::max();\n\n\/\/ Always an unsigned type\nconst size_type size_type_min = std::numeric_limits<size_type>::lowest();\nconst size_type size_type_max = std::numeric_limits<size_type>::max();\n\n\/\/\/ \\brief An integer indicating that there is no match, an error or NULL.\nstatic const int npos = -1;\n\n\/\/\/ \\brief The default standard point size for fonts.\n\/\/\/\n\/\/\/ \\remarks Used in default initialization of nom::Text, nom::UIWidget, etc.\nstatic const int DEFAULT_FONT_SIZE = 12;\n\n\/\/\/ \\brief Alignment types.\n\/\/\/\n\/\/\/ \\remarks See also, nom::Anchor enumeration.\n\/\/\/\n\/\/\/ \\note Borrowed from [maelstrom's screenlib](https:\/\/hg.libsdl.org\/Maelstrom\/)\nenum Alignment: uint32\n{\n  NONE = 0x0,\n  X_LEFT = 0x01,\n  X_CENTER = 0x02,\n  X_RIGHT = 0x4,\n\n  \/\/\/ \\remarks Horizontal\n  X_MASK = ( X_LEFT | X_CENTER | X_RIGHT ),\n\n  Y_TOP = 0x10,\n  Y_CENTER = 0x20,\n  Y_BOTTOM = 0x40,\n\n  \/\/\/ \\remarks Vertical\n  Y_MASK = ( Y_TOP | Y_CENTER | Y_BOTTOM )\n};\n\n\/\/\/ \\note Borrowed from [maelstrom's screenlib](https:\/\/hg.libsdl.org\/Maelstrom\/)\nenum Anchor: uint32\n{\n  None = NONE,                          \/\/ 0\n  Left = X_LEFT,                        \/\/ 1\n  Center = X_CENTER,                    \/\/ 2\n  Right = X_RIGHT,                      \/\/ 4\n\n  TopLeft = Y_TOP | X_LEFT,             \/\/ Hex: 0x11, Dec: 17\n  TopCenter = Y_TOP | X_CENTER,         \/\/ Hex: 0x12, Dec: 18\n  TopRight = Y_TOP | X_RIGHT,           \/\/ Hex: 0x14, Dec: 20\n\n  MiddleLeft = Y_CENTER | X_LEFT,       \/\/ Hex: 0x21, Dec: 33\n  MiddleCenter = Y_CENTER | X_CENTER,   \/\/ Hex: 0x22, Dec: 34\n  MiddleRight = Y_CENTER | X_RIGHT,     \/\/ Hex: 0x24, Dec: 36\n\n  BottomLeft = Y_BOTTOM | X_LEFT,       \/\/ Hex: 0x41, Dec: 65\n  BottomCenter = Y_BOTTOM | X_CENTER,   \/\/ Hex: 0x42, Dec: 66\n  BottomRight = Y_BOTTOM | X_RIGHT      \/\/ Hex: 0x44, Dec: 68\n};\n\ntypedef std::vector<std::string> StringList;\n\n} \/\/ namespace nom\n\n\/\/\/ Ensure our data types have the right sizes using C++11 compile-time asserts.\nstatic_assert ( sizeof ( nom::uint8 ) == 1, \"nom::uint8\" );\nstatic_assert ( sizeof ( nom::int8 ) == 1, \"nom::int8\" );\n\nstatic_assert ( sizeof ( nom::uint16 ) == 2, \"nom::uint16\" );\nstatic_assert ( sizeof ( nom::int16 ) == 2, \"nom::int16\" );\n\nstatic_assert ( sizeof ( nom::uint32 ) == 4, \"nom::uint32\" );\nstatic_assert ( sizeof ( nom::int32 ) == 4, \"nom::int32\" );\n\nstatic_assert ( sizeof ( nom::uint64 ) == 8, \"nom::uint64\" );\nstatic_assert ( sizeof ( nom::int64 ) == 8, \"nom::int64\" );\n\nstatic_assert ( sizeof ( nom::real32 ) == 4, \"nom::real32\" );\nstatic_assert ( sizeof ( nom::real64 ) == 8, \"nom::real64\" );\n\nstatic_assert ( sizeof ( nom::uchar ) == 1, \"nom::uchar\" );\n\n\/\/ Blindly assumes we are on either a 64-bit or 32-bit platform.\n#if defined( NOM_PLATFORM_ARCH_X86_64 )\n  static_assert( sizeof ( nom::ulong ) == 8, \"nom::ulong\" );\n  static_assert( sizeof ( nom::size_type ) == 8, \"nom::size_type\" );\n#else \/\/ #elif defined( NOM_PLATFORM_ARCH_X86_86 )\n  static_assert( sizeof ( nom::ulong ) == 4, \"nom::ulong\" );\n  static_assert( sizeof ( nom::size_type ) == 4, \"nom::size_type\" );\n#endif\n\n\/\/ Blindly assumes we are on either a 64-bit or 32-bit platform.\n#if defined( NOM_PLATFORM_ARCH_X86_64 )\n  static_assert( sizeof(nom::int_ptr) == 8, \"nom::int_ptr\" );\n  static_assert( sizeof(nom::uint_ptr) == 8, \"nom::uint_ptr\" );\n  static_assert( sizeof ( nom::int32_ptr ) == ( sizeof(long) ), \"nom::int32_ptr\" );\n  static_assert( sizeof ( nom::uint32_ptr ) == ( sizeof(nom::ulong) ), \"nom::uint32_ptr\" );\n#else \/\/ #elif defined(NOM_PLATFORM_ARCH_X86)\n  static_assert( sizeof(nom::int_ptr) == 4, \"nom::int_ptr\" );\n  static_assert( sizeof(nom::uint_ptr) == 4, \"nom::uint_ptr\" );\n  static_assert( sizeof( nom::int32_ptr ) == ( sizeof( long ) ), \"nom::int32_ptr\" );\n  static_assert( sizeof( nom::uint32_ptr ) == ( sizeof( nom::ulong ) ), \"nom::uint32_ptr\" );\n#endif\n\n\/\/\/ Additional type definitions\n\nconst nom::sint NOM_EXIT_FAILURE = 1; \/\/ EXIT_FAILURE from cstdlib headers\nconst nom::sint NOM_EXIT_SUCCESS = 0; \/\/ EXIT_SUCCESS from cstdlib headers\n\n\/\/#if defined(HAVE_SDL2)\nconst nom::sint SDL_SUCCESS = 0; \/\/ Non-error return value for SDL2 API\n\/\/#endif\n\n#endif \/\/ include guard defined\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Created by thaeds on 8\/10\/15.\n\/\/\n\n#include <opencv2\/opencv.hpp>\n#include <iostream>\n#include <vector>\n\n#define KERNAL_COUNT 4\n\nusing namespace std;\nusing namespace cv;\n\nvoid DetectLines(int lineThickness, int lineLength, int lineAnchor, int lineContinue);\nvoid WhitenessFilter(Mat& hsv_image, Mat& result);\nvoid PassFilters(Mat& image, Mat* results, Mat* kernals);\nvoid MultiplyByComplements(Mat* images, Mat* complements, Mat* results);\n\n\/\/ 4 sliders\n    \/\/ line thickness in pixels\nconst int lineThickness_slider_max = 255;\nint lineThickness;\n    \/\/ line threshold to be a start\nconst int lineAnchor_slider_max = 255;\nint lineAnchor;\n    \/\/ line threshold to continue\nconst int lineContinue_slider_max = 255;\nint lineContinue;\n    \/\/ line length minimum to consider\nconst int lineLength_slider_max = 255;\nint lineLength;\n\nconst char* windowName = \"LineDetection\";\nchar* filename = nullptr;\n\nMat src_img;\nMat dst_img;\n\nvoid SliderCallback(int, void*) {\n    cerr << \"Calling DetectLines\" << endl;\n    DetectLines(lineThickness, lineLength, lineAnchor, lineContinue);\n    cerr << \"DetectLines returned\" << endl;\n    imshow(windowName, dst_img);\n}\n\nint main(int argc, char* argv[]) {\n    if(argc != 2) {cerr << \"ERROR, 1 argument expected, the file path of an image\" << endl; return -1;}\n    src_img = imread(argv[1]);\n    if(!src_img.data) {cerr << \"ERROR, unable to load image: \" << argv[1] << endl; return -1;}\n\n    \/\/ Initialize Variables\n    filename = argv[1];\n    dst_img = Mat::zeros(src_img.size(), src_img.type());\n    lineThickness = 20;\n    lineAnchor = 5;\n    lineContinue = 1;\n    lineLength = 1;\n\n    \/\/ Create the window\n    namedWindow(windowName, 0);\n\n    \/\/ Add the sliders\n    createTrackbar(\"Line Thickness (pixels)\", windowName, &lineThickness, lineThickness_slider_max, SliderCallback);\n    createTrackbar(\"Line Length Minimum (pixels)\", windowName, &lineLength, lineLength_slider_max, SliderCallback);\n    createTrackbar(\"Line Anchor Threshold (pixel value)\", windowName, &lineAnchor, lineAnchor_slider_max, SliderCallback);\n    createTrackbar(\"Line Continue Threshold (pixel value)\", windowName, &lineContinue, lineContinue_slider_max, SliderCallback);\n\n    \/\/ Callback to show original image\n    cerr << \"Calling callback\" << endl;\n    SliderCallback(0, nullptr);\n\n    \/\/ Exit on keypress\n    while(waitKey(0) != 'q');\n    return 0;\n}\n\nvoid DetectLines(int lineThickness, int lineLength, int lineAnchor, int lineContinue) {\n    static bool init = true;\n    static Mat kernals[4];\n    static Mat kernalComplements[4];\n    Mat working;\n    Mat kernalResults[KERNAL_COUNT];\n    Mat complementResults[KERNAL_COUNT];\n    src_img = imread(filename);\n    dst_img = Mat::zeros(src_img.size(), src_img.type());\n    if(init) {\n        cerr << \"DetectLines::Initing\" << endl;\n        float karray[2][9][9] = {\n                {\n                        {-1,   -1,   -1,   -1,   -1,   -1,   -1,   -1, -1},\n                        {-1,   -1,   -1,   -1,   -1,   -1,   -1, -1, -1},\n                        {-1,   -1,   -1,   -1,   -1,   -1, -1, -1, -1},\n                        {1,    1,    1,    1,    1, 1, 1, 1, 1},\n                        {1,    1,    1,    1, 1, 1, 1, 1,  1},\n                        {1,    1,    1, 1, 1, 1,  1, 1, 1},\n                        {0,    0, 0, 0,  0, 0, 0, 0, 0},\n                        {0, 0,  0, 0, 0, 0, 0, 0, 0},\n                        {0, 0, 0, 0, 0, 0, 0, 0, 0}\n                },\n\/\/                {\n\/\/                        {-1,   -1,   -1,   -1,   -1,   -1,   -1,   -1, -1},\n\/\/                        {-1,   -1,   -1,   -1,   -1,   -1,   -1, 0,  1},\n\/\/                        {-1,   -1,   -1,   -1,   -1,   0,  1,  1,  1},\n\/\/                        {-1,   -1,   -1,   0,    1, 1, 1, 1, 1},\n\/\/                        {-1,   0,    1,    1, 1, 1, 1, .5, 0},\n\/\/                        {1,    1,    1, 1, 1, .5, 0, 0, 0},\n\/\/                        {1,    1, 1, .5, 0, 0, 0, 0, 0},\n\/\/                        {1, .5, 0, 0, 0, 0, 0, 0, 0},\n\/\/                        {0, 0, 0, 0, 0, 0, 0, 0, 0}\n\/\/                },\n                {\n                        {-.89, -.89, -.89, -.89, -.89, -.89, -.89, 1,  1},\n                        {-.89, -.89, -.89, -.89, -.89, -.89, 1,  1,  1},\n                        {-.89, -.89, -.89, -.89, -.89, 1,  1,  1,  0},\n                        {-.89, -.89, -.89, -.89, 1, 1, 1, 0, 0},\n                        {-.89, -.89, -.89, 1, 1, 1, 0, 0,  0},\n                        {-.89, -.89, 1, 1, 1, 0,  0, 0, 0},\n                        {-.89, 1, 1, 1,  0, 0, 0, 0, 0},\n                        {1, 1,  1, 0, 0, 0, 0, 0, 0},\n                        {1, 1, 0, 0, 0, 0, 0, 0, 0}\n                }\n        };\n\n            Mat kernal1(9, 9, CV_32FC1, karray[0]);\n            kernal1 \/= 27;\n    \/\/        Mat kernal2(9, 9, CV_32FC1, karray[1]);\n    \/\/        kernal2 \/= 25;\n            Mat kernal3(9, 9, CV_32FC1, karray[1]);\n            kernal3 \/= 25;\n\n    \/\/        Mat kernal4 = kernal2.t();\n            Mat kernal5 = kernal1.t();\n\n    \/\/        Mat kernal6;\n            Mat kernal7;\n    \/\/        Mat kernal8;\n\n    \/\/        flip(kernal4, kernal6, 0);\n            flip(kernal3, kernal7, 0);\n    \/\/        flip(kernal2, kernal8, 0);\n\n            kernals[0] = kernal1;\n    \/\/                kernal2,\n            kernals[1] = kernal3;\n    \/\/                kernal4,\n            kernals[2] = kernal5;\n    \/\/                kernal6,\n            kernals[3] = kernal7;\n    \/\/                kernal8\n\n            for(int i = 0; i < KERNAL_COUNT; i++) {\n                Mat kernalComplement;\n                flip(kernals[i], kernalComplement, -1);\n                kernalComplements[i] = kernalComplement;\n            }\n            init = false;\n        }\n\n        \/\/ Resize the image such that the lines are approximitely 3 pixels wide\n        cerr << \"DetectLines::Reducing Image\" << endl;\n        resize(src_img, working, Size(3*src_img.cols\/lineThickness, 3*src_img.rows\/lineThickness), 0, 0, INTER_LANCZOS4);\n\n        \/\/ Convert the image into HSV space to make processing white lines easier\n        cerr << \"DetectLines::Converting to HSV\" << endl;\n        cvtColor(working, working, CV_BGR2HSV);\n\n        \/\/ Calculate each pixel's \"whiteness\" defined as value*(255-saturation);\n        cerr << \"DetectLines::Filtering Whiteness\" << endl;\n        WhitenessFilter(working, working);\n\n        \/\/ Pass directional kernals over image\n        cerr << \"DetectLines::Filtering kernals\" << endl;\n        PassFilters(working, kernalResults, kernals);\n\n        \/\/ Pass directional kernal complements over image (same edge, rotated 180 degrees, 3 pixels between edge and complement)\n        cerr << \"DetectLines::Filtering complements\" << endl;\n        PassFilters(working, complementResults, kernalComplements);\n\n        \/\/ Multiply the results of kernal filter by its complement\n        cerr << \"DetectLines::Multiplying Results\" << endl;\n        MultiplyByComplements(kernalResults, complementResults, kernalResults);\n\n\n        \/\/ LineDrawing implementation reduces detection to single pixel wide lines of a minimum width\n    \/\/    Mat* detectedLines = new Mat(LineDrawing(geometricResults, lineAnchor, lineContinue, lineLength));\n\n        working = Mat::zeros(kernalResults[0].size(), kernalResults[0].type());\n        cerr << \"DetectLines::Thresholding Results\" << endl;\n        for(int i = 0; i < KERNAL_COUNT; i++) {\n            threshold(kernalResults[i], kernalResults[i], lineContinue, 255, CV_THRESH_BINARY);\n            bitwise_or(working, kernalResults[i], working);\n        }\n        resize(working, dst_img, src_img.size(), src_img.type());\n        cerr << \"DetectLines::Converting to BGR\" << endl;\n\/\/        cvtColor(dst_img, dst_img, CV_GRAY2BGR);\n}\n\nvoid WhitenessFilter(Mat& hsv_image, Mat& fin_img) {\n    Mat result = 255 * Mat::ones(hsv_image.size(), CV_16UC1);\n    Mat tmp;\n    hsv_image.convertTo(tmp, CV_16UC3, 1.0);\n    Mat channel[3];\n    split(tmp, channel);\n    result -= channel[1];\n    result = result.mul(channel[2]);\n    result.convertTo(fin_img, CV_8UC1, 1.0\/255);\n}\n\nvoid PassFilters(Mat& image, Mat* results, Mat* kernals) {\n   for(int i = 0; i < KERNAL_COUNT; i++) {\n        filter2D(image, results[i], -1, kernals[i]);\n    }\n}\n\nvoid MultiplyByComplements(Mat* images, Mat* complements, Mat* results) {\n    for(int i = 0; i < KERNAL_COUNT; i++) {\n        Mat image;\n        Mat complement;\n        images[i].convertTo(image, CV_16UC1, 1.0);\n        complements[i].convertTo(complement, CV_16UC1, 1.0);\n        Mat result = Mat::zeros(images[0].size(), CV_16UC1);\n        result = image.mul(complement);\n        result.convertTo(results[i], CV_8UC1, 1.0\/255); \/\/ TODO figure this const out\n    }\n}\n\n\n<commit_msg>fixed memory leak, working code minus line drawing<commit_after>\/\/\n\/\/ Created by thaeds on 8\/10\/15.\n\/\/\n\n\/\/ Compile with:\n\/\/ g++ `pkg-config --cflags opencv` -o test_line_detector test_line_detector.cpp `pkg-config --libs opencv` -std=c++11\n\n#include <opencv2\/opencv.hpp>\n#include <iostream>\n#include <vector>\n\n#define KERNAL_COUNT 4\n\nusing namespace std;\nusing namespace cv;\n\nvoid DetectLines(int lineThickness, int lineLength, int lineAnchor, int lineContinue);\nvoid WhitenessFilter(Mat& hsv_image, Mat& result);\nvoid MultiplyByComplements(Mat* images, Mat* complements, Mat* results);\nvoid initLineDetection();\n\n\/\/ 4 sliders\n    \/\/ line thickness in pixels\nconst int lineThickness_slider_max = 255;\nint lineThickness;\n    \/\/ line threshold to be a start\nconst int lineAnchor_slider_max = 255;\nint lineAnchor;\n    \/\/ line threshold to continue\nconst int lineContinue_slider_max = 255;\nint lineContinue;\n    \/\/ line length minimum to consider\nconst int lineLength_slider_max = 255;\nint lineLength;\n\nconst char* windowName = \"LineDetection\";\nchar* filename = nullptr;\n\nMat src_img;\nMat dst_img;\nMat kernels[KERNAL_COUNT];\nMat kernelComplements[KERNAL_COUNT];\nMat working;\nMat kernelResults[KERNAL_COUNT];\nMat complementResults[KERNAL_COUNT];\n\nvoid SliderCallback(int, void*) {\n    \/\/cerr << \"LineThickness: \" << lineThickness << \" LineLength: \" << lineLength << \" LineAnchor: \" << lineAnchor << \" LineContinue: \" << lineContinue << endl;\n    \/\/cerr << \"Calling DetectLines\" << endl;\n    DetectLines(lineThickness, lineLength, lineAnchor, lineContinue);\n    \/\/cerr << \"DetectLines returned\" << endl;\n    imshow(windowName, dst_img);\n}\n\nint main(int argc, char* argv[]) {\n    if(argc != 2) {cerr << \"ERROR, 1 argument expected, the file path of an image\" << endl; return -1;}\n    src_img = imread(argv[1]);\n    if(!src_img.data) {cerr << \"ERROR, unable to load image: \" << argv[1] << endl; return -1;}\n    filename = argv[1];\n\n    initLineDetection();\n\n    \/\/ Create the window\n    namedWindow(windowName, 1);\n\n    \/\/ Add the sliders\n    createTrackbar(\"Line Thickness (pixels)\", windowName, &lineThickness, lineThickness_slider_max, SliderCallback);\n    createTrackbar(\"Line Length Minimum (pixels)\", windowName, &lineLength, lineLength_slider_max, SliderCallback);\n    createTrackbar(\"Line Anchor Threshold (pixel value)\", windowName, &lineAnchor, lineAnchor_slider_max, SliderCallback);\n    createTrackbar(\"Line Continue Threshold (pixel value)\", windowName, &lineContinue, lineContinue_slider_max, SliderCallback);\n\n    \/\/ Callback to show original image\n    \/\/cerr << \"Calling callback\" << endl;\n    SliderCallback(0, nullptr);\n\n    \/\/ Exit on keypress\n    while(waitKey(0) != 27);\n    return 0;\n}\n\nvoid initLineDetection() {\n    \/\/cerr << \"DetectLines::Initing\" << endl;\n    lineThickness = 20;\n    lineAnchor = 1;\n    lineContinue = 20;\n    lineLength = 1;\n    float karray[2][9][9] = {\n            {\n                    {-1,   -1,   -1,   -1,   -1,   -1,   -1,   -1, -1},\n                    {-1,   -1,   -1,   -1,   -1,   -1,   -1, -1, -1},\n                    {-1,   -1,   -1,   -1,   -1,   -1, -1, -1, -1},\n                    {1,    1,    1,    1,    1, 1, 1, 1, 1},\n                    {1,    1,    1,    1, 1, 1, 1, 1, 1},\n                    {1,    1,    1, 1, 1, 1, 1, 1, 1},\n                    {0,    0, 0, 0, 0, 0, 0, 0, 0},\n                    {0, 0, 0, 0, 0, 0, 0, 0, 0},\n                    {0, 0, 0, 0, 0, 0, 0, 0, 0}\n            },\n\/\/                {\n\/\/                        {-1,   -1,   -1,   -1,   -1,   -1,   -1,   -1, -1},\n\/\/                        {-1,   -1,   -1,   -1,   -1,   -1,   -1, 0,  1},\n\/\/                        {-1,   -1,   -1,   -1,   -1,   0,  1,  1,  1},\n\/\/                        {-1,   -1,   -1,   0,    1, 1, 1, 1, 1},\n\/\/                        {-1,   0,    1,    1, 1, 1, 1, .5, 0},\n\/\/                        {1,    1,    1, 1, 1, .5, 0, 0, 0},\n\/\/                        {1,    1, 1, .5, 0, 0, 0, 0, 0},\n\/\/                        {1, .5, 0, 0, 0, 0, 0, 0, 0},\n\/\/                        {0, 0, 0, 0, 0, 0, 0, 0, 0}\n\/\/                },\n            {\n                    {-.89, -.89, -.89, -.89, -.89, -.89, -.89, 1,  1},\n                    {-.89, -.89, -.89, -.89, -.89, -.89, 1,  1,  1},\n                    {-.89, -.89, -.89, -.89, -.89, 1,  1,  1,  0},\n                    {-.89, -.89, -.89, -.89, 1, 1, 1, 0, 0},\n                    {-.89, -.89, -.89, 1, 1, 1, 0, 0, 0},\n                    {-.89, -.89, 1, 1, 1, 0, 0, 0, 0},\n                    {-.89, 1, 1, 1, 0, 0, 0, 0, 0},\n                    {1, 1, 1, 0, 0, 0, 0, 0, 0},\n                    {1, 1, 0, 0, 0, 0, 0, 0, 0}\n            }\n    };\n\n    Mat kernel1(9, 9, CV_32FC1, karray[0]);\n    kernel1 \/= 27;\n    \/\/        Mat kernel2(9, 9, CV_32FC1, karray[1]);\n    \/\/        kernel2 \/= 25;\n    Mat kernel3(9, 9, CV_32FC1, karray[1]);\n    kernel3 \/= 25;\n\n    \/\/        Mat kernel4 = kernel2.t();\n    Mat kernel5 = kernel1.t();\n\n    \/\/        Mat kernel6;\n    Mat kernel7;\n    \/\/        Mat kernel8;\n\n    \/\/        flip(kernel4, kernel6, 0);\n    flip(kernel3, kernel7, 0);\n    \/\/        flip(kernel2, kernel8, 0);\n\n    kernels[0] = kernel1.clone();\n    \/\/                kernel2,\n    kernels[1] = kernel3.clone();\n    \/\/                kernel4,\n    kernels[2] = kernel5.clone();\n    \/\/                kernel6,\n    kernels[3] = kernel7.clone();\n    \/\/                kernel8\n\n    for (int i = 0; i < KERNAL_COUNT; i++) {\n        Mat kernelComplement;\n        flip(kernels[i], kernelComplement, -1);\n        kernelComplements[i] = kernelComplement.clone();\n    }\n}\n\nvoid DetectLines(int lineThickness, int lineLength, int lineAnchor, int lineContinue) {\n    src_img = imread(filename);\n    dst_img = Mat::zeros(src_img.size(), src_img.type());\n\n    \/\/ Resize the image such that the lines are approximately 3 pixels wide\n    \/\/cerr << \"DetectLines::Reducing Image\" << endl;\n    lineThickness = max(1, lineThickness); \/\/ 0 thickness doesn't make sense\n    resize(src_img, working, Size(3*src_img.cols\/lineThickness, 3*src_img.rows\/lineThickness), 0, 0, INTER_LANCZOS4);\n\n    \/\/ Convert the image into HSV space to make processing white lines easier\n    \/\/cerr << \"DetectLines::Converting to HSV\" << endl;\n    cvtColor(working, working, CV_BGR2HSV);\n\n    \/\/ Calculate each pixel's \"whiteness\" defined as value*(255-saturation);\n    \/\/cerr << \"DetectLines::Filtering Whiteness\" << endl;\n    WhitenessFilter(working, working);\n\n    \/\/ Pass directional kernels over image\n    \/\/cerr << \"DetectLines::Filtering kernels\" << endl;\n    for(size_t i = 0; i < KERNAL_COUNT; i++)\n        filter2D(working, kernelResults[i], -1, kernels[i]);\n\n    \/\/ Pass directional kernel complements over image (same edge, rotated 180 degrees, 3 pixels between edge and complement)\n    \/\/cerr << \"DetectLines::Filtering complements\" << endl;\n    for(size_t i = 0; i < KERNAL_COUNT; i++)\n        filter2D(working, complementResults[i], -1, kernelComplements[i]);\n\n    \/\/ Multiply the results of kernel filter by its complement\n    \/\/cerr << \"DetectLines::Multiplying Results\" << endl;\n    MultiplyByComplements(kernelResults, complementResults, kernelResults);\n\n    \/\/ LineDrawing implementation reduces detection to single pixel wide lines of a minimum width\n\/\/    Mat* detectedLines = new Mat(LineDrawing(geometricResults, lineAnchor, lineContinue, lineLength));\n\n    working = Mat::zeros(kernelResults[0].size(), kernelResults[0].type());\n    \/\/cerr << \"DetectLines::Thresholding Results\" << endl;\n    for(int i = 0; i < KERNAL_COUNT; i++) {\n        threshold(kernelResults[i], kernelResults[i], ((float)lineContinue*lineContinue)\/255, 255, CV_THRESH_BINARY);\n        bitwise_or(working, kernelResults[i], working);\n    }\n    resize(working, dst_img, src_img.size(), src_img.type());\n    \/\/cerr << \"lineContinue: \" << lineContinue << endl;\n}\n\nvoid WhitenessFilter(Mat& hsv_image, Mat& fin_img) {\n    Mat result = 255 * Mat::ones(hsv_image.size(), CV_16UC1);\n    Mat tmp;\n    hsv_image.convertTo(tmp, CV_16UC3, 1.0);\n    Mat channel[3];\n    split(tmp, channel);\n    result = result - channel[1];\n    result = result.mul(channel[2]);\n    result.convertTo(fin_img, CV_8UC1, 1.0\/255);\n}\n\nvoid MultiplyByComplements(Mat* images, Mat* complements, Mat* results) {\n    for(size_t i = 0; i < KERNAL_COUNT; i++) {\n        Mat image;\n        Mat complement;\n        Mat result = Mat::zeros(images[0].size(), CV_16UC1);\n        images[i].convertTo(image, CV_16UC1, 1.0);\n        complements[i].convertTo(complement, CV_16UC1, 1.0);\n        result = image.mul(complement);\n        result.convertTo(results[i], CV_8UC1, 1.0\/255); \/\/ TODO figure this const out\n    }\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n\n  nomlib - C++11 cross-platform game engine\n\nCopyright (c) 2013, Jeffrey Carpenter <jeffrey.carp@gmail.com>\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n\n1. Redistributions of source code must retain the above copyright notice, this\n   list of conditions and the following disclaimer.\n2. Redistributions in binary form must reproduce the above copyright notice,\n   this list of conditions and the following disclaimer in the documentation\n   and\/or other materials provided with the distribution.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\nANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\nWARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\nANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\nLOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\nON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n******************************************************************************\/\n#ifndef NOMLIB_TYPES_HEADERS\n#define NOMLIB_TYPES_HEADERS\n\n#include <cstdint>\n\n\/\/ Portable fixed-size data types derive from stdint.h\nnamespace nom {\n\n\/\/ 8-bit integer types\ntypedef int8_t int8;\ntypedef uint8_t uint8;\n\n\/\/ 16-bit integer types\ntypedef int16_t int16;\ntypedef uint16_t uint16;\n\n\/\/ 32-bit integer types\ntypedef int32_t int32;\ntypedef uint32_t uint32;\n\n\/\/ 64-bit integer types\ntypedef signed long long int int64;\ntypedef unsigned long long int uint64;\n\n\/\/ Additional integer type definitions\n#if defined ( NOM_PLATFORM_ARCH_X86_64 )\n  typedef unsigned long ulong;\n#else \/\/ Blindly assume 32-bit arch\n  typedef long long ulong;\n#endif\n\ntypedef unsigned char uchar;\ntypedef signed int sint;\ntypedef unsigned int uint;\n\n} \/\/ namespace nom\n\n\/\/\/ Ensure our data types have the right sizes using C++11 compile-time asserts.\nstatic_assert ( sizeof ( nom::uint8 ) == 1, \"nom::uint8\" );\nstatic_assert ( sizeof ( nom::int8 ) == 1, \"nom::int8\" );\n\nstatic_assert ( sizeof ( nom::uint16 ) == 2, \"nom::uint16\" );\nstatic_assert ( sizeof ( nom::int16 ) == 2, \"nom::int16\" );\n\nstatic_assert ( sizeof ( nom::uint32 ) == 4, \"nom::uint32\" );\nstatic_assert ( sizeof ( nom::int32 ) == 4, \"nom::int32\" );\n\nstatic_assert ( sizeof ( nom::uint64 ) == 8, \"nom::uint64\" );\nstatic_assert ( sizeof ( nom::int64 ) == 8, \"nom::int64\" );\n\nstatic_assert ( sizeof ( nom::ulong ) == 8, \"nom::ulong\" );\n\n\/\/\/ Something is *seriously* wrong if this fails!\nstatic_assert ( sizeof ( nom::uchar ) == 1, \"nom::uchar\" );\n\n\/\/\/ Additional type definitions\n\nconst nom::sint NOM_EXIT_FAILURE = 1; \/\/ EXIT_FAILURE from cstdlib headers\nconst nom::sint NOM_EXIT_SUCCESS = 0; \/\/ EXIT_SUCCESS from cstdlib headers\n\n#endif \/\/ NOMLIB_TYPES_HEADERS defined\n<commit_msg>types: Introduce size_t typedef<commit_after>\/******************************************************************************\n\n  nomlib - C++11 cross-platform game engine\n\nCopyright (c) 2013, Jeffrey Carpenter <jeffrey.carp@gmail.com>\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n\n1. Redistributions of source code must retain the above copyright notice, this\n   list of conditions and the following disclaimer.\n2. Redistributions in binary form must reproduce the above copyright notice,\n   this list of conditions and the following disclaimer in the documentation\n   and\/or other materials provided with the distribution.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\nANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\nWARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\nANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\nLOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\nON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n******************************************************************************\/\n#ifndef NOMLIB_TYPES_HEADERS\n#define NOMLIB_TYPES_HEADERS\n\n#include <cstdint>\n\n\/\/ Portable fixed-size data types derive from stdint.h\nnamespace nom {\n\n\/\/ 8-bit integer types\ntypedef int8_t int8;\ntypedef uint8_t uint8;\n\n\/\/ 16-bit integer types\ntypedef int16_t int16;\ntypedef uint16_t uint16;\n\n\/\/ 32-bit integer types\ntypedef int32_t int32;\ntypedef uint32_t uint32;\n\n\/\/ 64-bit integer types\ntypedef signed long long int int64;\ntypedef unsigned long long int uint64;\n\n\/\/ Additional integer type definitions\n#if defined ( NOM_PLATFORM_ARCH_X86_64 )\n  typedef unsigned long ulong;\n#else \/\/ Blindly assume 32-bit arch\n  typedef long long ulong;\n#endif\n\ntypedef unsigned char uchar;\ntypedef signed int sint;\ntypedef unsigned int uint;\ntypedef std::size_t size_t;\n\n} \/\/ namespace nom\n\n\/\/\/ Ensure our data types have the right sizes using C++11 compile-time asserts.\nstatic_assert ( sizeof ( nom::uint8 ) == 1, \"nom::uint8\" );\nstatic_assert ( sizeof ( nom::int8 ) == 1, \"nom::int8\" );\n\nstatic_assert ( sizeof ( nom::uint16 ) == 2, \"nom::uint16\" );\nstatic_assert ( sizeof ( nom::int16 ) == 2, \"nom::int16\" );\n\nstatic_assert ( sizeof ( nom::uint32 ) == 4, \"nom::uint32\" );\nstatic_assert ( sizeof ( nom::int32 ) == 4, \"nom::int32\" );\n\nstatic_assert ( sizeof ( nom::uint64 ) == 8, \"nom::uint64\" );\nstatic_assert ( sizeof ( nom::int64 ) == 8, \"nom::int64\" );\n\nstatic_assert ( sizeof ( nom::ulong ) == 8, \"nom::ulong\" );\n\n\/\/\/ Something is *seriously* wrong if this fails!\nstatic_assert ( sizeof ( nom::uchar ) == 1, \"nom::uchar\" );\n\n\/\/\/ Additional type definitions\n\nconst nom::sint NOM_EXIT_FAILURE = 1; \/\/ EXIT_FAILURE from cstdlib headers\nconst nom::sint NOM_EXIT_SUCCESS = 0; \/\/ EXIT_SUCCESS from cstdlib headers\n\n#endif \/\/ NOMLIB_TYPES_HEADERS defined\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: directview.hxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: vg $ $Date: 2003-04-24 14:00:53 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef CONFIGMGR_DIRECTVIEW_HXX_\n#define CONFIGMGR_DIRECTVIEW_HXX_\n\n#ifndef CONFIGMGR_VIEWBEHAVIOR_HXX_\n#include \"viewstrategy.hxx\"\n#endif\n\n#ifndef CONFIGMGR_TREESEGMENT_HXX\n#include \"treesegment.hxx\"\n#endif\n\nnamespace configmgr\n{\n    namespace view\n    {\n\/\/-----------------------------------------------------------------------------\n\/\/ View behavior for direct data access\n\/\/-----------------------------------------------------------------------------\n\n        class DirectViewStrategy : public ViewStrategy\n        {\n            data::TreeSegment m_aTreeSegment;\n        public:\n            explicit\n            DirectViewStrategy(data::TreeSegment const & _aTreeSegment)\n            : m_aTreeSegment(_aTreeSegment)\n            {}\n\n        protected:\n            \/\/ change handling -required\n            virtual bool doHasChanges(Node const& _aNode) const;\n            virtual void doMarkChanged(Node const& _aNode);\n\n            \/\/ direct data access\n            virtual void doReleaseDataSegment() { m_aTreeSegment.clear(); }\n            virtual memory::Segment const * doGetDataSegment()    const { return m_aTreeSegment.getSegment(); }\n            virtual memory::Segment * doGetDataSegmentForUpdate()       { return m_aTreeSegment.getSegment(); }\n\n            \/\/ common attributes\n            virtual node::Attributes doAdjustAttributes(node::Attributes const& _aAttributes) const;\n\n            \/\/ group member access\n            virtual ValueMemberNode doGetValueMember(GroupNode const& _aNode, Name const& _aName, bool _bForUpdate) const;\n\n            \/\/ set element access\n            virtual void doInsertElement(SetNode const& _aNode, Name const& aName, SetNodeEntry const& aNewEntry);\n            virtual void doRemoveElement(SetNode const& _aNode, Name const& aName);\n\n            virtual NodeFactory& doGetNodeFactory();\n\n        private:\n            void implMarkNondefault(SetNode const& _aNode);\n        };\n\/\/-----------------------------------------------------------------------------\n    }\n}\n\n#endif \/\/ CONFIGMGR_DIRECTVIEW_HXX_\n<commit_msg>INTEGRATION: CWS ooo19126 (1.2.180); FILE MERGED 2005\/09\/05 17:05:24 rt 1.2.180.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: directview.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 04:29:14 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n\n#ifndef CONFIGMGR_DIRECTVIEW_HXX_\n#define CONFIGMGR_DIRECTVIEW_HXX_\n\n#ifndef CONFIGMGR_VIEWBEHAVIOR_HXX_\n#include \"viewstrategy.hxx\"\n#endif\n\n#ifndef CONFIGMGR_TREESEGMENT_HXX\n#include \"treesegment.hxx\"\n#endif\n\nnamespace configmgr\n{\n    namespace view\n    {\n\/\/-----------------------------------------------------------------------------\n\/\/ View behavior for direct data access\n\/\/-----------------------------------------------------------------------------\n\n        class DirectViewStrategy : public ViewStrategy\n        {\n            data::TreeSegment m_aTreeSegment;\n        public:\n            explicit\n            DirectViewStrategy(data::TreeSegment const & _aTreeSegment)\n            : m_aTreeSegment(_aTreeSegment)\n            {}\n\n        protected:\n            \/\/ change handling -required\n            virtual bool doHasChanges(Node const& _aNode) const;\n            virtual void doMarkChanged(Node const& _aNode);\n\n            \/\/ direct data access\n            virtual void doReleaseDataSegment() { m_aTreeSegment.clear(); }\n            virtual memory::Segment const * doGetDataSegment()    const { return m_aTreeSegment.getSegment(); }\n            virtual memory::Segment * doGetDataSegmentForUpdate()       { return m_aTreeSegment.getSegment(); }\n\n            \/\/ common attributes\n            virtual node::Attributes doAdjustAttributes(node::Attributes const& _aAttributes) const;\n\n            \/\/ group member access\n            virtual ValueMemberNode doGetValueMember(GroupNode const& _aNode, Name const& _aName, bool _bForUpdate) const;\n\n            \/\/ set element access\n            virtual void doInsertElement(SetNode const& _aNode, Name const& aName, SetNodeEntry const& aNewEntry);\n            virtual void doRemoveElement(SetNode const& _aNode, Name const& aName);\n\n            virtual NodeFactory& doGetNodeFactory();\n\n        private:\n            void implMarkNondefault(SetNode const& _aNode);\n        };\n\/\/-----------------------------------------------------------------------------\n    }\n}\n\n#endif \/\/ CONFIGMGR_DIRECTVIEW_HXX_\n<|endoftext|>"}
{"text":"<commit_before>#include \"libtorrent\/storage.hpp\"\n#include \"libtorrent\/file_pool.hpp\"\n#include \"libtorrent\/hasher.hpp\"\n#include \"libtorrent\/session.hpp\"\n#include \"libtorrent\/aux_\/session_impl.hpp\"\n\n#include <boost\/utility.hpp>\n#include <boost\/filesystem\/operations.hpp>\n#include <boost\/filesystem\/convenience.hpp>\n#include <boost\/thread\/mutex.hpp>\n\n#include \"test.hpp\"\n#include \"setup_transfer.hpp\"\n\nusing namespace libtorrent;\nusing namespace boost::filesystem;\n\nconst int piece_size = 16;\n\nvoid on_read_piece(int ret, disk_io_job const& j, char const* data, int size)\n{\n\tstd::cerr << \"on_read_piece piece: \" << j.piece << std::endl;\n\tTEST_CHECK(ret == size);\n\tTEST_CHECK(std::equal(j.buffer, j.buffer + ret, data));\n}\n\nvoid run_storage_tests(boost::intrusive_ptr<torrent_info> info\n\t, path const& test_path\n\t, libtorrent::storage_mode_t storage_mode)\n{\n\tconst int half = piece_size \/ 2;\n\n\tchar piece0[piece_size] =\n\t{ 6, 6, 6, 6, 6, 6, 6, 6\n\t, 9, 9, 9, 9, 9, 9, 9, 9};\n\n\tchar piece1[piece_size] =\n\t{ 0, 0, 0, 0, 0, 0, 0, 0\n\t, 1, 1, 1, 1, 1, 1, 1, 1};\n\n\tchar piece2[piece_size] =\n\t{ 0, 0, 1, 0, 0, 0, 0, 0\n\t, 1, 1, 1, 1, 1, 1, 1, 1};\n\n\tinfo->set_hash(0, hasher(piece0, piece_size).final());\n\tinfo->set_hash(1, hasher(piece1, piece_size).final());\n\tinfo->set_hash(2, hasher(piece2, piece_size).final());\n\t\n\tinfo->create_torrent();\n\n\tcreate_directory(test_path \/ \"temp_storage\");\n\n\tint num_pieces = (1 + 612 + 17 + piece_size - 1) \/ piece_size;\n\tTEST_CHECK(info->num_pieces() == num_pieces);\n\n\tchar piece[piece_size];\n\n\t{ \/\/ avoid having two storages use the same files\t\n\tfile_pool fp;\n\tboost::scoped_ptr<storage_interface> s(\n\t\tdefault_storage_constructor(info, test_path, fp));\n\n\t\/\/ write piece 1 (in slot 0)\n\ts->write(piece1, 0, 0, half);\n\ts->write(piece1 + half, 0, half, half);\n\n\t\/\/ verify piece 1\n\tTEST_CHECK(s->read(piece, 0, 0, piece_size) == piece_size);\n\tTEST_CHECK(std::equal(piece, piece + piece_size, piece1));\n\t\n\t\/\/ do the same with piece 0 and 2 (in slot 1 and 2)\n\ts->write(piece0, 1, 0, piece_size);\n\ts->write(piece2, 2, 0, piece_size);\n\n\t\/\/ verify piece 0 and 2\n\tTEST_CHECK(s->read(piece, 1, 0, piece_size) == piece_size);\n\tTEST_CHECK(std::equal(piece, piece + piece_size, piece0));\n\n\ts->read(piece, 2, 0, piece_size);\n\tTEST_CHECK(std::equal(piece, piece + piece_size, piece2));\n\t\n\ts->release_files();\n\t}\n\n\t\/\/ make sure the piece_manager can identify the pieces\n\t{\n\tfile_pool fp;\n\tdisk_io_thread io;\n\tboost::shared_ptr<int> dummy(new int);\n\tboost::intrusive_ptr<piece_manager> pm = new piece_manager(dummy, info\n\t\t, test_path, fp, io, default_storage_constructor);\n\tboost::mutex lock;\n\tlibtorrent::aux::piece_checker_data d;\n\n\tstd::vector<bool> pieces;\n\tnum_pieces = 0;\n\tTEST_CHECK(pm->check_fastresume(d, pieces, num_pieces\n\t\t, storage_mode) == false);\n\tbool finished = false;\n\tfloat progress;\n\tnum_pieces = 0;\n\tboost::recursive_mutex mutex;\n\twhile (!finished)\n\t\tboost::tie(finished, progress) = pm->check_files(pieces, num_pieces, mutex);\n\n\tTEST_CHECK(num_pieces == std::count(pieces.begin(), pieces.end()\n\t\t, true));\n\n\n\tboost::function<void(int, disk_io_job const&)> none;\n\tTEST_CHECK(exists(test_path \/ \"temp_storage\"));\n\tpm->async_move_storage(test_path \/ \"temp_storage2\", none);\n\ttest_sleep(2000);\n\tTEST_CHECK(!exists(test_path \/ \"temp_storage\"));\n\tTEST_CHECK(exists(test_path \/ \"temp_storage2\/temp_storage\"));\n\tpm->async_move_storage(test_path , none);\n\ttest_sleep(2000);\n\tTEST_CHECK(!exists(test_path \/ \"temp_storage2\/temp_storage\"));\t\n\tremove_all(test_path \/ \"temp_storage2\");\n\n\tpeer_request r;\n\tr.piece = 0;\n\tr.start = 0;\n\tr.length = piece_size;\n\tpm->async_read(r, bind(&on_read_piece, _1, _2, piece0, piece_size));\n\tr.piece = 1;\n\tpm->async_read(r, bind(&on_read_piece, _1, _2, piece1, piece_size));\n\tr.piece = 2;\n\tpm->async_read(r, bind(&on_read_piece, _1, _2, piece2, piece_size));\n\tpm->async_release_files(none);\n\n\t}\n}\n\nvoid run_test(path const& test_path)\n{\n\tstd::cerr << \"\\n=== \" << test_path << \" ===\\n\" << std::endl;\n\n\tboost::intrusive_ptr<torrent_info> info(new torrent_info());\n\tinfo->set_piece_size(piece_size);\n\tinfo->add_file(\"temp_storage\/test1.tmp\", 17);\n\tinfo->add_file(\"temp_storage\/test2.tmp\", 612);\n\tinfo->add_file(\"temp_storage\/test3.tmp\", 0);\n\tinfo->add_file(\"temp_storage\/test4.tmp\", 0);\n\tinfo->add_file(\"temp_storage\/test5.tmp\", 1);\n\n\tstd::cerr << \"=== test 1 ===\" << std::endl;\n\n\trun_storage_tests(info, test_path, storage_mode_compact);\n\n\t\/\/ make sure the files have the correct size\n\tstd::cerr << file_size(test_path \/ \"temp_storage\" \/ \"test1.tmp\") << std::endl;\n\tTEST_CHECK(file_size(test_path \/ \"temp_storage\" \/ \"test1.tmp\") == 17);\n\tstd::cerr << file_size(test_path \/ \"temp_storage\" \/ \"test2.tmp\") << std::endl;\n\tTEST_CHECK(file_size(test_path \/ \"temp_storage\" \/ \"test2.tmp\") == 31);\n\tTEST_CHECK(exists(test_path \/ \"temp_storage\/test3.tmp\"));\n\tTEST_CHECK(exists(test_path \/ \"temp_storage\/test4.tmp\"));\n\tremove_all(test_path \/ \"temp_storage\");\n\n\/\/ ==============================================\n\n\t\/\/ make sure remap_files works\n\tstd::vector<std::pair<std::string, libtorrent::size_type> > map;\n\tmap.push_back(std::make_pair(std::string(\"temp_storage\/test.tmp\"), 17 + 612 + 1));\n\tbool ret = info->remap_files(map);\n\tTEST_CHECK(ret);\n\n\tstd::cerr << \"=== test 2 ===\" << std::endl;\n\n\trun_storage_tests(info, test_path, storage_mode_compact);\n\n\tstd::cerr << file_size(test_path \/ \"temp_storage\" \/ \"test.tmp\") << std::endl;\n\tTEST_CHECK(file_size(test_path \/ \"temp_storage\" \/ \"test.tmp\") == 48);\n\n\tremove_all(test_path \/ \"temp_storage\");\n\n\/\/ ==============================================\n\t\n\tinfo = new torrent_info();\n\tinfo->set_piece_size(piece_size);\n\tinfo->add_file(\"temp_storage\/test1.tmp\", 17 + 612 + 1);\n\n\tstd::cerr << \"=== test 3 ===\" << std::endl;\n\n\trun_storage_tests(info, test_path, storage_mode_compact);\n\n\t\/\/ 48 = piece_size * 3\n\tTEST_CHECK(file_size(test_path \/ \"temp_storage\" \/ \"test1.tmp\") == 48);\n\tremove_all(test_path \/ \"temp_storage\");\n\n\/\/ ==============================================\n\n\tstd::cerr << \"=== test 4 ===\" << std::endl;\n\n\trun_storage_tests(info, test_path, storage_mode_allocate);\n\n\tstd::cerr << file_size(test_path \/ \"temp_storage\" \/ \"test1.tmp\") << std::endl;\n\tTEST_CHECK(file_size(test_path \/ \"temp_storage\" \/ \"test1.tmp\") == 17 + 612 + 1);\n\n\tremove_all(test_path \/ \"temp_storage\");\n}\n\nint test_main()\n{\n\tstd::vector<path> test_paths;\n\tchar* env = std::getenv(\"TORRENT_TEST_PATHS\");\n\tif (env == 0)\n\t{\n\t\ttest_paths.push_back(initial_path());\n\t}\n\telse\n\t{\n\t\tchar* p = std::strtok(env, \";\");\n\t\twhile (p != 0)\n\t\t{\n\t\t\ttest_paths.push_back(complete(p));\n\t\t\tp = std::strtok(0, \";\");\n\t\t}\n\t}\n\n\tstd::for_each(test_paths.begin(), test_paths.end(), bind(&run_test, _1));\n\treturn 0;\n}\n\n<commit_msg>fixed test_storage<commit_after>#include \"libtorrent\/storage.hpp\"\n#include \"libtorrent\/file_pool.hpp\"\n#include \"libtorrent\/hasher.hpp\"\n#include \"libtorrent\/session.hpp\"\n#include \"libtorrent\/aux_\/session_impl.hpp\"\n\n#include <boost\/utility.hpp>\n#include <boost\/filesystem\/operations.hpp>\n#include <boost\/filesystem\/convenience.hpp>\n#include <boost\/thread\/mutex.hpp>\n\n#include \"test.hpp\"\n#include \"setup_transfer.hpp\"\n\nusing namespace libtorrent;\nusing namespace boost::filesystem;\n\nconst int piece_size = 16;\n\nvoid on_read_piece(int ret, disk_io_job const& j, char const* data, int size)\n{\n\tstd::cerr << \"on_read_piece piece: \" << j.piece << std::endl;\n\tTEST_CHECK(ret == size);\n\tTEST_CHECK(std::equal(j.buffer, j.buffer + ret, data));\n}\n\nvoid run_storage_tests(boost::intrusive_ptr<torrent_info> info\n\t, path const& test_path\n\t, libtorrent::storage_mode_t storage_mode)\n{\n\tconst int half = piece_size \/ 2;\n\n\tchar piece0[piece_size] =\n\t{ 6, 6, 6, 6, 6, 6, 6, 6\n\t, 9, 9, 9, 9, 9, 9, 9, 9};\n\n\tchar piece1[piece_size] =\n\t{ 0, 0, 0, 0, 0, 0, 0, 0\n\t, 1, 1, 1, 1, 1, 1, 1, 1};\n\n\tchar piece2[piece_size] =\n\t{ 0, 0, 1, 0, 0, 0, 0, 0\n\t, 1, 1, 1, 1, 1, 1, 1, 1};\n\n\tinfo->set_hash(0, hasher(piece0, piece_size).final());\n\tinfo->set_hash(1, hasher(piece1, piece_size).final());\n\tinfo->set_hash(2, hasher(piece2, piece_size).final());\n\t\n\tinfo->create_torrent();\n\n\tcreate_directory(test_path \/ \"temp_storage\");\n\n\tint num_pieces = (1 + 612 + 17 + piece_size - 1) \/ piece_size;\n\tTEST_CHECK(info->num_pieces() == num_pieces);\n\n\tchar piece[piece_size];\n\n\t{ \/\/ avoid having two storages use the same files\t\n\tfile_pool fp;\n\tboost::scoped_ptr<storage_interface> s(\n\t\tdefault_storage_constructor(info, test_path, fp));\n\n\t\/\/ write piece 1 (in slot 0)\n\ts->write(piece1, 0, 0, half);\n\ts->write(piece1 + half, 0, half, half);\n\n\t\/\/ verify piece 1\n\tTEST_CHECK(s->read(piece, 0, 0, piece_size) == piece_size);\n\tTEST_CHECK(std::equal(piece, piece + piece_size, piece1));\n\t\n\t\/\/ do the same with piece 0 and 2 (in slot 1 and 2)\n\ts->write(piece0, 1, 0, piece_size);\n\ts->write(piece2, 2, 0, piece_size);\n\n\t\/\/ verify piece 0 and 2\n\tTEST_CHECK(s->read(piece, 1, 0, piece_size) == piece_size);\n\tTEST_CHECK(std::equal(piece, piece + piece_size, piece0));\n\n\ts->read(piece, 2, 0, piece_size);\n\tTEST_CHECK(std::equal(piece, piece + piece_size, piece2));\n\t\n\ts->release_files();\n\t}\n\n\t\/\/ make sure the piece_manager can identify the pieces\n\t{\n\tfile_pool fp;\n\tdisk_io_thread io;\n\tboost::shared_ptr<int> dummy(new int);\n\tboost::intrusive_ptr<piece_manager> pm = new piece_manager(dummy, info\n\t\t, test_path, fp, io, default_storage_constructor);\n\tboost::mutex lock;\n\tlibtorrent::aux::piece_checker_data d;\n\n\tstd::vector<bool> pieces;\n\tnum_pieces = 0;\n\tstd::string error_msg;\n\tTEST_CHECK(pm->check_fastresume(d, pieces, num_pieces\n\t\t, storage_mode, error_msg) == false);\n\tbool finished = false;\n\tfloat progress;\n\tnum_pieces = 0;\n\tboost::recursive_mutex mutex;\n\twhile (!finished)\n\t\tboost::tie(finished, progress) = pm->check_files(pieces, num_pieces, mutex);\n\n\tTEST_CHECK(num_pieces == std::count(pieces.begin(), pieces.end()\n\t\t, true));\n\n\n\tboost::function<void(int, disk_io_job const&)> none;\n\tTEST_CHECK(exists(test_path \/ \"temp_storage\"));\n\tpm->async_move_storage(test_path \/ \"temp_storage2\", none);\n\ttest_sleep(2000);\n\tTEST_CHECK(!exists(test_path \/ \"temp_storage\"));\n\tTEST_CHECK(exists(test_path \/ \"temp_storage2\/temp_storage\"));\n\tpm->async_move_storage(test_path , none);\n\ttest_sleep(2000);\n\tTEST_CHECK(!exists(test_path \/ \"temp_storage2\/temp_storage\"));\t\n\tremove_all(test_path \/ \"temp_storage2\");\n\n\tpeer_request r;\n\tr.piece = 0;\n\tr.start = 0;\n\tr.length = piece_size;\n\tpm->async_read(r, bind(&on_read_piece, _1, _2, piece0, piece_size));\n\tr.piece = 1;\n\tpm->async_read(r, bind(&on_read_piece, _1, _2, piece1, piece_size));\n\tr.piece = 2;\n\tpm->async_read(r, bind(&on_read_piece, _1, _2, piece2, piece_size));\n\tpm->async_release_files(none);\n\n\t}\n}\n\nvoid run_test(path const& test_path)\n{\n\tstd::cerr << \"\\n=== \" << test_path << \" ===\\n\" << std::endl;\n\n\tboost::intrusive_ptr<torrent_info> info(new torrent_info());\n\tinfo->set_piece_size(piece_size);\n\tinfo->add_file(\"temp_storage\/test1.tmp\", 17);\n\tinfo->add_file(\"temp_storage\/test2.tmp\", 612);\n\tinfo->add_file(\"temp_storage\/test3.tmp\", 0);\n\tinfo->add_file(\"temp_storage\/test4.tmp\", 0);\n\tinfo->add_file(\"temp_storage\/test5.tmp\", 1);\n\n\tstd::cerr << \"=== test 1 ===\" << std::endl;\n\n\trun_storage_tests(info, test_path, storage_mode_compact);\n\n\t\/\/ make sure the files have the correct size\n\tstd::cerr << file_size(test_path \/ \"temp_storage\" \/ \"test1.tmp\") << std::endl;\n\tTEST_CHECK(file_size(test_path \/ \"temp_storage\" \/ \"test1.tmp\") == 17);\n\tstd::cerr << file_size(test_path \/ \"temp_storage\" \/ \"test2.tmp\") << std::endl;\n\tTEST_CHECK(file_size(test_path \/ \"temp_storage\" \/ \"test2.tmp\") == 31);\n\tTEST_CHECK(exists(test_path \/ \"temp_storage\/test3.tmp\"));\n\tTEST_CHECK(exists(test_path \/ \"temp_storage\/test4.tmp\"));\n\tremove_all(test_path \/ \"temp_storage\");\n\n\/\/ ==============================================\n\n\t\/\/ make sure remap_files works\n\tstd::vector<std::pair<std::string, libtorrent::size_type> > map;\n\tmap.push_back(std::make_pair(std::string(\"temp_storage\/test.tmp\"), 17 + 612 + 1));\n\tbool ret = info->remap_files(map);\n\tTEST_CHECK(ret);\n\n\tstd::cerr << \"=== test 2 ===\" << std::endl;\n\n\trun_storage_tests(info, test_path, storage_mode_compact);\n\n\tstd::cerr << file_size(test_path \/ \"temp_storage\" \/ \"test.tmp\") << std::endl;\n\tTEST_CHECK(file_size(test_path \/ \"temp_storage\" \/ \"test.tmp\") == 48);\n\n\tremove_all(test_path \/ \"temp_storage\");\n\n\/\/ ==============================================\n\t\n\tinfo = new torrent_info();\n\tinfo->set_piece_size(piece_size);\n\tinfo->add_file(\"temp_storage\/test1.tmp\", 17 + 612 + 1);\n\n\tstd::cerr << \"=== test 3 ===\" << std::endl;\n\n\trun_storage_tests(info, test_path, storage_mode_compact);\n\n\t\/\/ 48 = piece_size * 3\n\tTEST_CHECK(file_size(test_path \/ \"temp_storage\" \/ \"test1.tmp\") == 48);\n\tremove_all(test_path \/ \"temp_storage\");\n\n\/\/ ==============================================\n\n\tstd::cerr << \"=== test 4 ===\" << std::endl;\n\n\trun_storage_tests(info, test_path, storage_mode_allocate);\n\n\tstd::cerr << file_size(test_path \/ \"temp_storage\" \/ \"test1.tmp\") << std::endl;\n\tTEST_CHECK(file_size(test_path \/ \"temp_storage\" \/ \"test1.tmp\") == 17 + 612 + 1);\n\n\tremove_all(test_path \/ \"temp_storage\");\n}\n\nint test_main()\n{\n\tstd::vector<path> test_paths;\n\tchar* env = std::getenv(\"TORRENT_TEST_PATHS\");\n\tif (env == 0)\n\t{\n\t\ttest_paths.push_back(initial_path());\n\t}\n\telse\n\t{\n\t\tchar* p = std::strtok(env, \";\");\n\t\twhile (p != 0)\n\t\t{\n\t\t\ttest_paths.push_back(complete(p));\n\t\t\tp = std::strtok(0, \";\");\n\t\t}\n\t}\n\n\tstd::for_each(test_paths.begin(), test_paths.end(), bind(&run_test, _1));\n\treturn 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Copyright (c) 2019, Vinitha Ranganeni, Brian Lee\n\/\/ All 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\/\/     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 from\n\/\/        this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#ifndef COZMO_GENERIC_ACTION_SPACE_CPP\n#define COZMO_GENERIC_ACTION_SPACE_CPP\n\n#include \"utils\/utils.hpp\"\n#include <Eigen\/Dense>\n#include <cmath>\n#include <iostream>\n\nnamespace libcozmo {\nnamespace actionspace {\n\n\/\/ Generic Action class\nclass GenericAction {\n  public:\n\n    \/\/ Constructor\n\n    \/\/ \\param speed The speed of action\n    \/\/ \\param duration The duration of action\n    \/\/ \\param direction The (x,y) direction of action\n    GenericAction (\n        const double& speed,\n        const double& duration,\n        const Eigen::Vector2d& direction) : \\\n        m_speed(speed),\n        m_duration(duration),\n        m_direction(direction) {}\n    ~GenericAction() {}\n    \n    \/\/ Calculates and returns similarity with another action\n\n    \/\/ \\param other_action The other action to compare to\n    double action_similarity(GenericAction& other_action) const;\n\n    \/\/ Speed of action\n    const double m_speed;\n\n    \/\/ Duration of action\n    const double m_duration;\n\n    \/\/ (x,y) direction vector\n    const Eigen::Vector2d m_direction;\n};\n\n\/\/ Generic Actionspace for Cozmo\nclass GenericActionSpace {\n  public:\n\n    \/\/ Constructor\n    \n    \/\/ \\param min_speed The minimum speed of action\n    \/\/ \\param max_speed The maximum speed of action\n    \/\/ \\param min_duration The minimum duration of action\n    \/\/ \\param max_duration The maximum duration of action\n    \/\/ \\param num_speed The number of values for action linspace\n    \/\/ \\param num_duration The number of values for action linspace\n    \/\/ \\param num_theta The number of theta values\n    GenericActionSpace(\n        const double& min_speed,\n        const double& max_speed,\n        const double& min_duration,\n        const double& max_duration,\n        const int& num_speed,\n        const int& num_duration,\n        const int& num_theta) {\n            m_speeds = utils::linspace(min_speed, max_speed, static_cast<size_t>(num_speed));\n            m_durations = utils::linspace(min_duration, max_duration, num_duration);\n            for (int i = 0; i < num_theta; i++) {\n              double angle = i * 2.0 * M_PI \/ static_cast<double>(num_theta);\n              m_directions.push_back(Eigen::Vector2d(cos(angle), sin(angle)));\n            }\n            m_actions = std::vector<GenericAction*>(num_speed * num_duration * num_theta, nullptr);\n            for (int j = 0; j < num_speed; j++) {\n                for (int k = 0; k < num_duration; k++) {\n                  for (int l = 0; l < num_theta; l++) {\n                    const int id = j * num_duration * num_theta + k * num_theta + l;\n                    m_actions[id] = new GenericAction(\n                      m_speeds[j], \n                      m_durations[k], \n                      m_directions[l]);  \n                  } \n                }\n            }\n        }\n    ~GenericActionSpace() {\n      for (int i = 0; i < m_actions.size(); ++i) { \n          delete(m_actions[i]);\n      }\n      m_actions.clear();\n    }\n\n    \/\/ Assigns pointer to action given action ID\n\n    \/\/ \\param action_id The action ID\n    \/\/ \\param action Pointer for chosen action\n    GenericAction* get_action(const int& action_id) const;\n\n    \/\/ Executes action given action ID\n\n    \/\/ \\param action_id The action ID\n    void execute_action(int& action_id) const;\n\n  private:\n    \/\/ Vector of possible speed\n    std::vector<double> m_speeds;\n    \/\/ Vector of possible durations\n    std::vector<double> m_durations;\n    \/\/ Linspace count for speed and duration \n    \/\/ const int m_num_vals;\n    \/\/ \/\/ Linspace count for angle, in power of 2 and >= 4\n    \/\/ const int m_num_theta;\n    \/\/ \/\/ Vector of actions\n    std::vector<GenericAction*> m_actions;\n    \/\/ Vector of possible directions\n    std::vector<Eigen::Vector2d> m_directions;\n};\n}  \/\/ namespace actionspace\n}  \/\/ namespace libcozmo\n\n#endif<commit_msg>minor edits based on PR<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Copyright (c) 2019, Vinitha Ranganeni, Brian Lee\n\/\/ All 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\/\/     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 from\n\/\/        this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#ifndef COZMO_GENERIC_ACTION_SPACE_CPP\n#define COZMO_GENERIC_ACTION_SPACE_CPP\n\n#include \"utils\/utils.hpp\"\n#include <Eigen\/Dense>\n#include <cmath>\n\nnamespace libcozmo {\nnamespace actionspace {\n\n\/\/ Generic Action class\nclass GenericAction {\n  public:\n\n    \/\/ Constructor\n\n    \/\/ \\param speed The speed of action (m\/s)\n    \/\/ \\param duration The duration of action (s)\n    \/\/ \\param direction The (x,y) direction vector of action (m)\n    GenericAction (\n        const double& speed,\n        const double& duration,\n        const Eigen::Vector2d& direction) : \\\n        m_speed(speed),\n        m_duration(duration),\n        m_direction(direction) {}\n    ~GenericAction() {}\n    \n    \/\/ Calculates and returns similarity with another action\n    \/\/ Similarity is defined by the euclidean distance w.r.t.\n    \/\/ their speed, duration, and direction (x,y calcualted separately)\n\n    \/\/ \\param other_action The other action to compare to\n    double action_similarity(GenericAction& other_action) const;\n\n    \/\/ Speed of action\n    const double m_speed;\n\n    \/\/ Duration of action\n    const double m_duration;\n\n    \/\/ (x,y) direction vector\n    const Eigen::Vector2d m_direction;\n};\n\n\/\/ Generic Actionspace for Cozmo\nclass GenericActionSpace {\n  public:\n\n    \/\/ Constructor\n    \n    \/\/ \\param min_speed The minimum speed of action\n    \/\/ \\param max_speed The maximum speed of action\n    \/\/ \\param min_duration The minimum duration of action\n    \/\/ \\param max_duration The maximum duration of action\n    \/\/ \\param num_speed The number of speed values for the actions\n    \/\/ \\param num_duration The number of duration values for the actions\n    \/\/ \\param num_theta The number of theta values for the actions\n    GenericActionSpace(\n        const double& min_speed,\n        const double& max_speed,\n        const double& min_duration,\n        const double& max_duration,\n        const int& num_speed,\n        const int& num_duration,\n        const int& num_theta) {\n            m_speeds = utils::linspace(min_speed, max_speed, static_cast<size_t>(num_speed));\n            m_durations = utils::linspace(min_duration, max_duration, num_duration);\n            for (int i = 0; i < num_theta; i++) {\n              double angle = i * 2.0 * M_PI \/ static_cast<double>(num_theta);\n              m_directions.push_back(Eigen::Vector2d(cos(angle), sin(angle)));\n            }\n            m_actions = std::vector<GenericAction*>(num_speed * num_duration * num_theta, nullptr);\n            for (int j = 0; j < num_speed; j++) {\n                for (int k = 0; k < num_duration; k++) {\n                  for (int l = 0; l < num_theta; l++) {\n                    const int id = j * num_duration * num_theta + k * num_theta + l;\n                    m_actions[id] = new GenericAction(\n                      m_speeds[j], \n                      m_durations[k], \n                      m_directions[l]);  \n                  } \n                }\n            }\n        }\n    ~GenericActionSpace() {\n      for (int i = 0; i < m_actions.size(); ++i) { \n          delete(m_actions[i]);\n      }\n      m_actions.clear();\n    }\n\n    \/\/ Assigns pointer to action given action ID\n\n    \/\/ \\param action_id The action ID\n    \/\/ \\param action Pointer for chosen action\n    GenericAction* get_action(const int& action_id) const;\n\n    \/\/ Executes action given action ID\n\n    \/\/ \\param action_id The action ID\n    void execute_action(int& action_id) const;\n\n  private:\n    \/\/ Vector of possible speed\n    std::vector<double> m_speeds;\n    \/\/ Vector of possible durations\n    std::vector<double> m_durations;\n    \/\/ Linspace count for speed and duration \n    \/\/ const int m_num_vals;\n    \/\/ \/\/ Linspace count for angle, in power of 2 and >= 4\n    \/\/ const int m_num_theta;\n    \/\/ \/\/ Vector of actions\n    std::vector<GenericAction*> m_actions;\n    \/\/ Vector of possible directions\n    std::vector<Eigen::Vector2d> m_directions;\n};\n}  \/\/ namespace actionspace\n}  \/\/ namespace libcozmo\n\n#endif<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/shared_memory.h\"\n\n#include <sys\/mman.h>\n\n#include \"base\/logging.h\"\n#include \"third_party\/ashmem\/ashmem.h\"\n\nnamespace base {\n\n\/\/ For Android, we use ashmem to implement SharedMemory. ashmem_create_region\n\/\/ will automatically pin the region. We never explicitly call pin\/unpin. When\n\/\/ all the file descriptors from different processes associated with the region\n\/\/ are closed, the memory buffer will go away.\n\nbool SharedMemory::Create(const SharedMemoryCreateOptions& options) {\n  DCHECK_EQ(-1, mapped_file_ );\n\n  \/\/ \"name\" is just a label in ashmem. It is visible in \/proc\/pid\/maps.\n  mapped_file_ = ashmem_create_region(\n      options.name == NULL ? \"\" : options.name.c_str(),\n      options.size);\n  if (-1 == mapped_file_) {\n    DLOG(ERROR) << \"Shared memory creation failed\";\n    return false;\n  }\n\n  int err = ashmem_set_prot_region(mapped_file_,\n                                   PROT_READ | PROT_WRITE | PROT_EXEC);\n  if (err < 0) {\n    DLOG(ERROR) << \"Error \" << err << \" when setting protection of ashmem\";\n    return false;\n  }\n  created_size_ = size;\n\n  return true;\n}\n\nbool SharedMemory::Delete(const std::string& name) {\n  \/\/ Like on Windows, this is intentionally returning true as ashmem will\n  \/\/ automatically releases the resource when all FDs on it are closed.\n  return true;\n}\n\nbool SharedMemory::Open(const std::string& name, bool read_only) {\n  \/\/ ashmem doesn't support name mapping\n  NOTIMPLEMENTED();\n  return false;\n}\n\n}  \/\/ namespace base\n<commit_msg>Fix Android build.<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\/shared_memory.h\"\n\n#include <sys\/mman.h>\n\n#include \"base\/logging.h\"\n#include \"third_party\/ashmem\/ashmem.h\"\n\nnamespace base {\n\n\/\/ For Android, we use ashmem to implement SharedMemory. ashmem_create_region\n\/\/ will automatically pin the region. We never explicitly call pin\/unpin. When\n\/\/ all the file descriptors from different processes associated with the region\n\/\/ are closed, the memory buffer will go away.\n\nbool SharedMemory::Create(const SharedMemoryCreateOptions& options) {\n  DCHECK_EQ(-1, mapped_file_ );\n\n  \/\/ \"name\" is just a label in ashmem. It is visible in \/proc\/pid\/maps.\n  mapped_file_ = ashmem_create_region(\n      options.name == NULL ? \"\" : options.name->c_str(),\n      options.size);\n  if (-1 == mapped_file_) {\n    DLOG(ERROR) << \"Shared memory creation failed\";\n    return false;\n  }\n\n  int err = ashmem_set_prot_region(mapped_file_,\n                                   PROT_READ | PROT_WRITE | PROT_EXEC);\n  if (err < 0) {\n    DLOG(ERROR) << \"Error \" << err << \" when setting protection of ashmem\";\n    return false;\n  }\n  created_size_ = options.size;\n\n  return true;\n}\n\nbool SharedMemory::Delete(const std::string& name) {\n  \/\/ Like on Windows, this is intentionally returning true as ashmem will\n  \/\/ automatically releases the resource when all FDs on it are closed.\n  return true;\n}\n\nbool SharedMemory::Open(const std::string& name, bool read_only) {\n  \/\/ ashmem doesn't support name mapping\n  NOTIMPLEMENTED();\n  return false;\n}\n\n}  \/\/ namespace base\n<|endoftext|>"}
{"text":"<commit_before>\/\/===--- Editor.cpp - Output Of Text ----------------------------*- 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 text manipulation (\"editing\") interface.\n\/\/\n\/\/  Axel Naumann <axel@cern.ch>, 2011-05-12\n\/\/===----------------------------------------------------------------------===\/\/\n\n\n#include \"textinput\/Editor.h\"\n\n#include \"textinput\/Callbacks.h\"\n#include \"textinput\/History.h\"\n#include \"textinput\/KeyBinding.h\"\n#include \"textinput\/TextInput.h\"\n#include \"textinput\/TextInputContext.h\"\n\n#include <algorithm>\n\nnamespace textinput {\n  Editor::EProcessResult\n  Editor::Process(Command cmd, EditorRange& R) {\n    switch (cmd.GetKind()) {\n      case kCKChar:\n        return ProcessChar(cmd.GetChar(), R);\n      case kCKMove:\n        return ProcessMove(cmd.GetMoveID(), R);\n      case kCKCommand:\n        return ProcessCommand(cmd.GetCommandID(), R);\n      case kCKControl:\n      case kCKError:\n        return kPRError;\n    }\n    return kPRError;\n  }\n\n  Range\n  Editor::ResetText() {\n    if (!fContext->GetLine().empty()\n        && !fContext->GetTextInput()->IsInputHidden()\n        && fContext->GetTextInput()->IsAutoHistAddEnabled()) {\n      fContext->GetHistory()->AddLine(fContext->GetLine().GetText());\n    }\n    Range R(0, fContext->GetLine().length());\n    fContext->GetLine().clear();\n    fContext->SetCursor(0);\n    ClearPasteBuf();\n    fSearch.clear();\n    CancelSpecialInputMode(R);\n    if (fReplayHistEntry != (size_t) -1) {\n      fContext->SetLine(fContext->GetHistory()->GetLine(fReplayHistEntry));\n      --fReplayHistEntry; \/\/ intentional overflow to -1\n    }\n    return R;\n  }\n\n  void\n  Editor::SetReverseHistSearchPrompt(Range& RDisplay) {\n    std::string P(\"[bkw'\");\n    SetEditorPrompt(Text(P + fSearch + \"'] \"));\n    RDisplay.ExtendPromptUpdate(Range::kUpdateEditorPrompt);\n  }\n\n  bool\n  Editor::UpdateHistSearch(EditorRange& R) {\n    History* Hist = fContext->GetHistory();\n    Text& Line = fContext->GetLine();\n    size_t NewHistEntry = (size_t) -1;\n    if (fSearch.empty()) {\n      NewHistEntry = 0;\n    } else {\n      size_t startAt = fCurHistEntry;\n      if (startAt == (size_t) -1) {\n        startAt = 0;\n      }\n      for (size_t i = startAt, n = Hist->GetSize(); i < n; ++i) {\n        if (Hist->GetLine(i).find(fSearch) != std::string::npos) {\n          NewHistEntry = i;\n          break;\n        }\n      }\n    }\n    if (NewHistEntry != (size_t) -1) {\n      if (NewHistEntry != fCurHistEntry) {\n        fCurHistEntry = NewHistEntry;\n        Line = Hist->GetLine(fCurHistEntry);\n        R.fEdit.Extend(Range::AllText());\n        R.fDisplay.Extend(Range::AllText());\n        \/\/ Resets mode, thus can't call:\n        \/\/ ProcessMove(kMoveEnd, R);\n        fContext->SetCursor(Line.length());\n      }\n      return true;\n    }\n\n    fCurHistEntry = (size_t) -1;\n    return false;\n  }\n\n  void\n  Editor::CancelSpecialInputMode(Range& DisplayR) {\n    if (fMode == kInputMode) return;\n    fContext->GetKeyBinding()->SetAllowEscModifier(false);\n    SetEditorPrompt(Text());\n    DisplayR.ExtendPromptUpdate(Range::kUpdateEditorPrompt);\n    fMode = kInputMode;\n  }\n\n  Editor::EProcessResult\n  Editor::ProcessChar(char C, EditorRange& R) {\n    if (C < 32) return kPRError;\n\n    if (fMode == kHistSearchMode) {\n      fSearch += C;\n      SetReverseHistSearchPrompt(R.fDisplay);\n      if (UpdateHistSearch(R)) return kPRSuccess;\n      return kPRError;\n    }\n\n    PushUndo();\n    ClearPasteBuf();\n\n    Text& Line = fContext->GetLine();\n    size_t Cursor = fContext->GetCursor();\n\n    if (fOverwrite) {\n      if (Cursor < Line.length()) {\n        Line[Cursor] = C;\n      } else {\n        Line += C;\n      }\n      R.fEdit.Extend(Range(Cursor));\n      R.fDisplay.Extend(Range(Cursor));\n    } else {\n      Line.insert(Cursor, C);\n      R.fEdit.Extend(Range(Cursor));\n      R.fDisplay.Extend(Range(Cursor, Range::End()));\n      fContext->SetCursor(Cursor + 1);\n    }\n    return kPRSuccess;\n  }\n\n  Editor::EProcessResult\n  Editor::ProcessMove(EMoveID M, EditorRange &R) {\n    ClearPasteBuf();\n    CancelSpecialInputMode(R.fDisplay);\n\n    size_t Cursor = fContext->GetCursor();\n    size_t LineLen = fContext->GetLine().length();\n\n    switch (M) {\n      case kMoveEnd: fContext->SetCursor(LineLen); return kPRSuccess;\n      case kMoveFront: fContext->SetCursor(0); return kPRSuccess;\n      case kMoveRight:\n        if (Cursor < LineLen) {\n          fContext->SetCursor(Cursor + 1);\n          return kPRSuccess;\n        } else {\n          return kPRError;\n        }\n      case kMoveLeft:\n        if (Cursor > 0) {\n          fContext->SetCursor(Cursor - 1);\n          return kPRSuccess;\n        } else {\n          return kPRError;\n        }\n      case kMoveNextWord:\n      case kMovePrevWord:\n        fContext->SetCursor(FindWordBoundary(M == kMoveNextWord ? 1 : -1));\n        return kPRSuccess;\n    }\n    return kPRError;\n  }\n\n  Editor::EProcessResult\n  Editor::ProcessCommand(ECommandID M, EditorRange &R) {\n    if (M < kCmd_END_TEXT_MODIFYING_CMDS) {\n      PushUndo();\n    }\n    if (fMode == kHistSearchMode) {\n      if (M == kCmdDelLeft) {\n        if (fSearch.empty()) return kPRError;\n        fSearch.erase(fSearch.length() - 1);\n        SetReverseHistSearchPrompt(R.fDisplay);\n        if (UpdateHistSearch(R)) return kPRSuccess;\n        return kPRError;\n      } else {\n        CancelSpecialInputMode(R.fDisplay);\n        return kPRError;\n      }\n    }\n\n    Text& Line = fContext->GetLine();\n    size_t Cursor = fContext->GetCursor();\n    History* Hist = fContext->GetHistory();\n\n    switch (M) {\n      case kCmdIgnore:\n        return kPRSuccess;\n      case kCmdEnter:\n        fReplayHistEntry = (size_t) -1;\n        fCurHistEntry = (size_t) -1;\n        CancelSpecialInputMode(R.fDisplay);\n        return kPRSuccess;\n      case kCmdDelLeft:\n        if (Cursor == 0) return kPRError;\n        fContext->SetCursor(--Cursor);\n        \/\/ intentional fallthrough:\n      case kCmdDel:\n        if (Cursor == Line.length()) return kPRError;\n        AddToPasteBuf(M == kCmdDel ? 1 : -1, Line[Cursor]);\n        Line.erase(Cursor);\n        R.fEdit.Extend(Range(Cursor));\n        R.fDisplay.Extend(Range(Cursor, Range::End()));\n        return kPRSuccess;\n      case kCmdCutToEnd:\n        AddToPasteBuf(1, Line.GetText().c_str() + Cursor);\n        Line.erase(Cursor, Line.length() - Cursor);\n        R.fEdit.Extend(Range(Cursor));\n        R.fDisplay.Extend(Range(Cursor, Range::End()));\n        return kPRSuccess;\n      case kCmdCutNextWord:\n      {\n        size_t posWord = FindWordBoundary(1);\n        AddToPasteBuf(1, Line.GetText().substr(Cursor, posWord - Cursor));\n        R.fEdit.Extend(Range(Cursor, posWord));\n        R.fDisplay.Extend(Range(Cursor, Range::End()));\n        Line.erase(Cursor, posWord - Cursor);\n        return kPRSuccess;\n      }\n      case kCmdCutPrevWord:\n      {\n        size_t posWord = FindWordBoundary(-1);\n        AddToPasteBuf(-1, Line.GetText().substr(posWord, Cursor - posWord));\n        R.fEdit.Extend(Range(posWord, Cursor));\n        R.fDisplay.Extend(Range(posWord, Range::End()));\n        Line.erase(posWord, Cursor - posWord);\n        fContext->SetCursor(posWord);\n        return kPRSuccess;\n      }\n      case kCmdToggleOverwriteMode:\n        fOverwrite = !fOverwrite;\n        return kPRSuccess;\n      case kCmdInsertMode:\n        fOverwrite = false;\n        return kPRSuccess;\n      case kCmdOverwiteMode:\n        fOverwrite = true;\n        return kPRSuccess;\n      case kCmdCutToFront:\n        R.fEdit.Extend(Range(0, Cursor));\n        R.fDisplay.Extend(Range::AllText());\n        AddToPasteBuf(-1, Line.GetText().substr(0, Cursor));\n        Line.erase(0, Cursor);\n        fContext->SetCursor(0);\n        return kPRSuccess;\n      case kCmdPaste:\n      {\n        size_t PasteLen = fPasteBuf.length();\n        R.fEdit.Extend(Range(Cursor, PasteLen));\n        R.fDisplay.Extend(Range(Cursor, Range::End()));\n        Line.insert(Cursor, fPasteBuf);\n        fContext->SetCursor(Cursor + PasteLen);\n        ClearPasteBuf();\n        return kPRSuccess;\n      }\n      case kCmdSwapThisAndLeftThenMoveRight:\n      {\n        if (Cursor < 1) return kPRError;\n        R.fEdit.Extend(Range(Cursor - 1, Cursor));\n        R.fDisplay.Extend(Range(Cursor - 1, Cursor));\n        char tmp = Line.GetText()[Cursor];\n        Line[Cursor] = Line[Cursor - 1];\n        Line[Cursor] = tmp;\n        \/\/ optional:\n        ProcessMove(kMoveRight, R);\n        return kPRSuccess;\n      }\n      case kCmdToUpperMoveNextWord:\n      {\n        if (Cursor >= Line.length()) return kPRError;\n        Line[Cursor] = toupper(Line[Cursor]);\n        R.fEdit.Extend(Range(Cursor));\n        R.fDisplay.Extend(Range(Cursor));\n        ProcessMove(kMoveNextWord, R);\n        return kPRSuccess;\n      }\n      case kCmdWordToLower:\n      case kCmdWordToUpper:\n      {\n        size_t posWord = FindWordBoundary(1);\n        if (M == kCmdWordToUpper) {\n          for (size_t i = Cursor; i < posWord; ++i) {\n            Line[Cursor] =  toupper(Line[Cursor]);\n          }\n        } else {\n          for (size_t i = Cursor; i < posWord; ++i) {\n            Line[Cursor] =  tolower(Line[Cursor]);\n          }\n        }\n        R.fEdit.Extend(Range(Cursor, posWord - Cursor));\n        R.fDisplay.Extend(Range(Cursor, posWord - Cursor));\n        fContext->SetCursor(posWord);\n        return kPRSuccess;\n      }\n      case kCmdUndo:\n        Line = fUndoBuf.back().first;\n        fContext->SetCursor(fUndoBuf.back().second);\n        fUndoBuf.pop_back();\n        return kPRSuccess;\n      case kCmdHistNewer:\n        \/\/ already newest?\n        if (fCurHistEntry == (size_t)-1) {\n          \/\/ not a history line (\"newer\" doesn't mean anything)?\n          return kPRError;\n        }\n        if (fCurHistEntry == 0) {\n          Hist->ModifyLine(fCurHistEntry, Line.GetText().c_str());\n          Line = fLineNotInHist;\n          fLineNotInHist.clear();\n          fCurHistEntry = (size_t)-1; \/\/ not in hist\n        } else {\n          --fCurHistEntry;\n          Line = Hist->GetLine(fCurHistEntry);\n        }\n        R.fEdit.Extend(Range::AllText());\n        R.fDisplay.Extend(Range::AllText());\n        ProcessMove(kMoveEnd, R);\n        return kPRSuccess;\n      case kCmdHistOlder:\n        \/\/ intentional overflow from -1 to 0:\n        if (fCurHistEntry + 1 >= Hist->GetSize()) {\n          return kPRError;\n        }\n        if (fCurHistEntry == (size_t)-1) {\n          fLineNotInHist = Line.GetText();\n          fCurHistEntry = 0;\n        } else {\n          Hist->ModifyLine(fCurHistEntry, Line.GetText().c_str());\n          ++fCurHistEntry;\n        }\n        Line = Hist->GetLine(fCurHistEntry);\n        R.fEdit.Extend(Range::AllText());\n        R.fDisplay.Extend(Range::AllText());\n        ProcessMove(kMoveEnd, R);\n        return kPRSuccess;\n      case kCmdReverseSearch:\n        fMode = kHistSearchMode;\n        fSearch.clear();\n        SetReverseHistSearchPrompt(R.fDisplay);\n        fContext->GetKeyBinding()->SetAllowEscModifier(true);\n        if (UpdateHistSearch(R)) return kPRSuccess;\n        return kPRError;\n      case kCmdHistReplay:\n        if (fCurHistEntry == (size_t) -1) return kPRError;\n        fReplayHistEntry = fCurHistEntry;\n        return kPRSuccess;\n      case kCmdClearScreen:\n      case kCmd_END_TEXT_MODIFYING_CMDS:\n        return kPRError;\n      case kCmdEsc:\n        \/\/ Already done for all commands:\n        \/\/CancelSpecialInputMode(R);\n        return kPRSuccess;\n      case kCmdComplete:\n      {\n        \/\/ Completion happens below current input.\n        ProcessMove(kMoveEnd, R);\n        std::vector<std::string> completions;\n        TabCompletion* tc = fContext->GetCompletion();\n        if (tc) {\n          bool ret = tc->Complete(Line, Cursor, R, completions);\n          if (ret) {\n            if (!completions.empty()) {\n              fContext->GetTextInput()->DisplayInfo(completions);\n              R.fDisplay.Extend(Range::AllWithPrompt());\n            }\n            fContext->SetCursor(Cursor);\n            return kPRSuccess;\n          }\n        }\n        return kPRError;\n      }\n      case kCmdWindowResize:\n        fContext->GetTextInput()->HandleResize();\n        return kPRSuccess;\n      case kCmdHistComplete:\n        \/\/ Not handled yet, todo.\n        return kPRError;\n    }\n    return kPRError;\n  }\n\n  size_t\n  Editor::FindWordBoundary(int Direction) {\n    static const char space[] = \" \\x9\";\n\n    const Text& Line = fContext->GetLine();\n    size_t Cursor = fContext->GetCursor();\n\n    if (Direction < 0 && Cursor < 2) return 0;\n    size_t ret = Direction > 0 ?\n      Line.GetText().find_first_of(space, Cursor + 1)\n    : Line.GetText().find_last_of(space, Cursor - 2);\n\n    if (ret == std::string::npos) {\n      if (Direction > 0) return Line.length();\n      else return 0;\n    }\n\n    if (Direction < 0)\n      ret += 1;\n\n    if (ret == std::string::npos) {\n      if (Direction > 0) return Line.length();\n      else return 0;\n    }\n    return ret;\n  }\n\n  void\n  Editor::AddToPasteBuf(int Dir, std::string const &T) {\n    if (fCutDirection == Dir) {\n      if (Dir < 0) {\n        fPasteBuf = T + fPasteBuf;\n      } else {\n        fPasteBuf += T;\n      }\n    } else {\n      fCutDirection = Dir;\n      fPasteBuf = T;\n    }\n  }\n\n  void\n  Editor::AddToPasteBuf(int Dir, char T) {\n    if (fCutDirection == Dir) {\n      if (Dir < 0) {\n        fPasteBuf = std::string(1, T) + fPasteBuf;\n      } else {\n        fPasteBuf += T;\n      }\n    } else {\n      fCutDirection = Dir;\n      fPasteBuf = T;\n    }\n  }\n\n  void\n  Editor::PushUndo() {\n    static const size_t MaxUndoBufSize = 100;\n    if (fUndoBuf.size() > MaxUndoBufSize) {\n      fUndoBuf.pop_front();\n    }\n    fUndoBuf.push_back(std::make_pair(fContext->GetLine(),\n                                      fContext->GetCursor()));\n  }\n\n   \/\/ Pin vtables:\n   TabCompletion::~TabCompletion() {}\n   FunKey::~FunKey() {}\n}\n<commit_msg>History line count differs when adding the history line outside TextInput. Update history line index of ^O to reflect that.<commit_after>\/\/===--- Editor.cpp - Output Of Text ----------------------------*- 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 text manipulation (\"editing\") interface.\n\/\/\n\/\/  Axel Naumann <axel@cern.ch>, 2011-05-12\n\/\/===----------------------------------------------------------------------===\/\/\n\n\n#include \"textinput\/Editor.h\"\n\n#include \"textinput\/Callbacks.h\"\n#include \"textinput\/History.h\"\n#include \"textinput\/KeyBinding.h\"\n#include \"textinput\/TextInput.h\"\n#include \"textinput\/TextInputContext.h\"\n\n#include <algorithm>\n\nnamespace textinput {\n  Editor::EProcessResult\n  Editor::Process(Command cmd, EditorRange& R) {\n    switch (cmd.GetKind()) {\n      case kCKChar:\n        return ProcessChar(cmd.GetChar(), R);\n      case kCKMove:\n        return ProcessMove(cmd.GetMoveID(), R);\n      case kCKCommand:\n        return ProcessCommand(cmd.GetCommandID(), R);\n      case kCKControl:\n      case kCKError:\n        return kPRError;\n    }\n    return kPRError;\n  }\n\n  Range\n  Editor::ResetText() {\n    bool addToHist = !fContext->GetLine().empty()\n      && !fContext->GetTextInput()->IsInputHidden()\n      && fContext->GetTextInput()->IsAutoHistAddEnabled();\n    if (addToHist) {\n      fContext->GetHistory()->AddLine(fContext->GetLine().GetText());\n      if (fReplayHistEntry != (size_t) -1) {\n        \/\/ Added a line, thus renumber\n        ++fReplayHistEntry;\n      }\n    }\n    Range R(0, fContext->GetLine().length());\n    fContext->GetLine().clear();\n    fContext->SetCursor(0);\n    ClearPasteBuf();\n    fSearch.clear();\n    CancelSpecialInputMode(R);\n    if (fReplayHistEntry != (size_t) -1) {\n      --fReplayHistEntry; \/\/ intentional overflow to -1\n      fContext->SetLine(fContext->GetHistory()->GetLine(fReplayHistEntry));\n    }\n    return R;\n  }\n\n  void\n  Editor::SetReverseHistSearchPrompt(Range& RDisplay) {\n    std::string P(\"[bkw'\");\n    SetEditorPrompt(Text(P + fSearch + \"'] \"));\n    RDisplay.ExtendPromptUpdate(Range::kUpdateEditorPrompt);\n  }\n\n  bool\n  Editor::UpdateHistSearch(EditorRange& R) {\n    History* Hist = fContext->GetHistory();\n    Text& Line = fContext->GetLine();\n    size_t NewHistEntry = (size_t) -1;\n    if (fSearch.empty()) {\n      NewHistEntry = 0;\n    } else {\n      size_t startAt = fCurHistEntry;\n      if (startAt == (size_t) -1) {\n        startAt = 0;\n      }\n      for (size_t i = startAt, n = Hist->GetSize(); i < n; ++i) {\n        if (Hist->GetLine(i).find(fSearch) != std::string::npos) {\n          NewHistEntry = i;\n          break;\n        }\n      }\n    }\n    if (NewHistEntry != (size_t) -1) {\n      if (NewHistEntry != fCurHistEntry) {\n        fCurHistEntry = NewHistEntry;\n        Line = Hist->GetLine(fCurHistEntry);\n        R.fEdit.Extend(Range::AllText());\n        R.fDisplay.Extend(Range::AllText());\n        \/\/ Resets mode, thus can't call:\n        \/\/ ProcessMove(kMoveEnd, R);\n        fContext->SetCursor(Line.length());\n      }\n      return true;\n    }\n\n    fCurHistEntry = (size_t) -1;\n    return false;\n  }\n\n  void\n  Editor::CancelSpecialInputMode(Range& DisplayR) {\n    if (fMode == kInputMode) return;\n    fContext->GetKeyBinding()->SetAllowEscModifier(false);\n    SetEditorPrompt(Text());\n    DisplayR.ExtendPromptUpdate(Range::kUpdateEditorPrompt);\n    fMode = kInputMode;\n  }\n\n  Editor::EProcessResult\n  Editor::ProcessChar(char C, EditorRange& R) {\n    if (C < 32) return kPRError;\n\n    if (fMode == kHistSearchMode) {\n      fSearch += C;\n      SetReverseHistSearchPrompt(R.fDisplay);\n      if (UpdateHistSearch(R)) return kPRSuccess;\n      return kPRError;\n    }\n\n    PushUndo();\n    ClearPasteBuf();\n\n    Text& Line = fContext->GetLine();\n    size_t Cursor = fContext->GetCursor();\n\n    if (fOverwrite) {\n      if (Cursor < Line.length()) {\n        Line[Cursor] = C;\n      } else {\n        Line += C;\n      }\n      R.fEdit.Extend(Range(Cursor));\n      R.fDisplay.Extend(Range(Cursor));\n    } else {\n      Line.insert(Cursor, C);\n      R.fEdit.Extend(Range(Cursor));\n      R.fDisplay.Extend(Range(Cursor, Range::End()));\n      fContext->SetCursor(Cursor + 1);\n    }\n    return kPRSuccess;\n  }\n\n  Editor::EProcessResult\n  Editor::ProcessMove(EMoveID M, EditorRange &R) {\n    ClearPasteBuf();\n    CancelSpecialInputMode(R.fDisplay);\n\n    size_t Cursor = fContext->GetCursor();\n    size_t LineLen = fContext->GetLine().length();\n\n    switch (M) {\n      case kMoveEnd: fContext->SetCursor(LineLen); return kPRSuccess;\n      case kMoveFront: fContext->SetCursor(0); return kPRSuccess;\n      case kMoveRight:\n        if (Cursor < LineLen) {\n          fContext->SetCursor(Cursor + 1);\n          return kPRSuccess;\n        } else {\n          return kPRError;\n        }\n      case kMoveLeft:\n        if (Cursor > 0) {\n          fContext->SetCursor(Cursor - 1);\n          return kPRSuccess;\n        } else {\n          return kPRError;\n        }\n      case kMoveNextWord:\n      case kMovePrevWord:\n        fContext->SetCursor(FindWordBoundary(M == kMoveNextWord ? 1 : -1));\n        return kPRSuccess;\n    }\n    return kPRError;\n  }\n\n  Editor::EProcessResult\n  Editor::ProcessCommand(ECommandID M, EditorRange &R) {\n    if (M < kCmd_END_TEXT_MODIFYING_CMDS) {\n      PushUndo();\n    }\n    if (fMode == kHistSearchMode) {\n      if (M == kCmdDelLeft) {\n        if (fSearch.empty()) return kPRError;\n        fSearch.erase(fSearch.length() - 1);\n        SetReverseHistSearchPrompt(R.fDisplay);\n        if (UpdateHistSearch(R)) return kPRSuccess;\n        return kPRError;\n      } else {\n        CancelSpecialInputMode(R.fDisplay);\n        return kPRError;\n      }\n    }\n\n    Text& Line = fContext->GetLine();\n    size_t Cursor = fContext->GetCursor();\n    History* Hist = fContext->GetHistory();\n\n    switch (M) {\n      case kCmdIgnore:\n        return kPRSuccess;\n      case kCmdEnter:\n        fReplayHistEntry = (size_t) -1;\n        fCurHistEntry = (size_t) -1;\n        CancelSpecialInputMode(R.fDisplay);\n        return kPRSuccess;\n      case kCmdDelLeft:\n        if (Cursor == 0) return kPRError;\n        fContext->SetCursor(--Cursor);\n        \/\/ intentional fallthrough:\n      case kCmdDel:\n        if (Cursor == Line.length()) return kPRError;\n        AddToPasteBuf(M == kCmdDel ? 1 : -1, Line[Cursor]);\n        Line.erase(Cursor);\n        R.fEdit.Extend(Range(Cursor));\n        R.fDisplay.Extend(Range(Cursor, Range::End()));\n        return kPRSuccess;\n      case kCmdCutToEnd:\n        AddToPasteBuf(1, Line.GetText().c_str() + Cursor);\n        Line.erase(Cursor, Line.length() - Cursor);\n        R.fEdit.Extend(Range(Cursor));\n        R.fDisplay.Extend(Range(Cursor, Range::End()));\n        return kPRSuccess;\n      case kCmdCutNextWord:\n      {\n        size_t posWord = FindWordBoundary(1);\n        AddToPasteBuf(1, Line.GetText().substr(Cursor, posWord - Cursor));\n        R.fEdit.Extend(Range(Cursor, posWord));\n        R.fDisplay.Extend(Range(Cursor, Range::End()));\n        Line.erase(Cursor, posWord - Cursor);\n        return kPRSuccess;\n      }\n      case kCmdCutPrevWord:\n      {\n        size_t posWord = FindWordBoundary(-1);\n        AddToPasteBuf(-1, Line.GetText().substr(posWord, Cursor - posWord));\n        R.fEdit.Extend(Range(posWord, Cursor));\n        R.fDisplay.Extend(Range(posWord, Range::End()));\n        Line.erase(posWord, Cursor - posWord);\n        fContext->SetCursor(posWord);\n        return kPRSuccess;\n      }\n      case kCmdToggleOverwriteMode:\n        fOverwrite = !fOverwrite;\n        return kPRSuccess;\n      case kCmdInsertMode:\n        fOverwrite = false;\n        return kPRSuccess;\n      case kCmdOverwiteMode:\n        fOverwrite = true;\n        return kPRSuccess;\n      case kCmdCutToFront:\n        R.fEdit.Extend(Range(0, Cursor));\n        R.fDisplay.Extend(Range::AllText());\n        AddToPasteBuf(-1, Line.GetText().substr(0, Cursor));\n        Line.erase(0, Cursor);\n        fContext->SetCursor(0);\n        return kPRSuccess;\n      case kCmdPaste:\n      {\n        size_t PasteLen = fPasteBuf.length();\n        R.fEdit.Extend(Range(Cursor, PasteLen));\n        R.fDisplay.Extend(Range(Cursor, Range::End()));\n        Line.insert(Cursor, fPasteBuf);\n        fContext->SetCursor(Cursor + PasteLen);\n        ClearPasteBuf();\n        return kPRSuccess;\n      }\n      case kCmdSwapThisAndLeftThenMoveRight:\n      {\n        if (Cursor < 1) return kPRError;\n        R.fEdit.Extend(Range(Cursor - 1, Cursor));\n        R.fDisplay.Extend(Range(Cursor - 1, Cursor));\n        char tmp = Line.GetText()[Cursor];\n        Line[Cursor] = Line[Cursor - 1];\n        Line[Cursor] = tmp;\n        \/\/ optional:\n        ProcessMove(kMoveRight, R);\n        return kPRSuccess;\n      }\n      case kCmdToUpperMoveNextWord:\n      {\n        if (Cursor >= Line.length()) return kPRError;\n        Line[Cursor] = toupper(Line[Cursor]);\n        R.fEdit.Extend(Range(Cursor));\n        R.fDisplay.Extend(Range(Cursor));\n        ProcessMove(kMoveNextWord, R);\n        return kPRSuccess;\n      }\n      case kCmdWordToLower:\n      case kCmdWordToUpper:\n      {\n        size_t posWord = FindWordBoundary(1);\n        if (M == kCmdWordToUpper) {\n          for (size_t i = Cursor; i < posWord; ++i) {\n            Line[Cursor] =  toupper(Line[Cursor]);\n          }\n        } else {\n          for (size_t i = Cursor; i < posWord; ++i) {\n            Line[Cursor] =  tolower(Line[Cursor]);\n          }\n        }\n        R.fEdit.Extend(Range(Cursor, posWord - Cursor));\n        R.fDisplay.Extend(Range(Cursor, posWord - Cursor));\n        fContext->SetCursor(posWord);\n        return kPRSuccess;\n      }\n      case kCmdUndo:\n        Line = fUndoBuf.back().first;\n        fContext->SetCursor(fUndoBuf.back().second);\n        fUndoBuf.pop_back();\n        return kPRSuccess;\n      case kCmdHistNewer:\n        \/\/ already newest?\n        if (fCurHistEntry == (size_t)-1) {\n          \/\/ not a history line (\"newer\" doesn't mean anything)?\n          return kPRError;\n        }\n        if (fCurHistEntry == 0) {\n          Hist->ModifyLine(fCurHistEntry, Line.GetText().c_str());\n          Line = fLineNotInHist;\n          fLineNotInHist.clear();\n          fCurHistEntry = (size_t)-1; \/\/ not in hist\n        } else {\n          --fCurHistEntry;\n          Line = Hist->GetLine(fCurHistEntry);\n        }\n        R.fEdit.Extend(Range::AllText());\n        R.fDisplay.Extend(Range::AllText());\n        ProcessMove(kMoveEnd, R);\n        return kPRSuccess;\n      case kCmdHistOlder:\n        \/\/ intentional overflow from -1 to 0:\n        if (fCurHistEntry + 1 >= Hist->GetSize()) {\n          return kPRError;\n        }\n        if (fCurHistEntry == (size_t)-1) {\n          fLineNotInHist = Line.GetText();\n          fCurHistEntry = 0;\n        } else {\n          Hist->ModifyLine(fCurHistEntry, Line.GetText().c_str());\n          ++fCurHistEntry;\n        }\n        Line = Hist->GetLine(fCurHistEntry);\n        R.fEdit.Extend(Range::AllText());\n        R.fDisplay.Extend(Range::AllText());\n        ProcessMove(kMoveEnd, R);\n        return kPRSuccess;\n      case kCmdReverseSearch:\n        fMode = kHistSearchMode;\n        fSearch.clear();\n        SetReverseHistSearchPrompt(R.fDisplay);\n        fContext->GetKeyBinding()->SetAllowEscModifier(true);\n        if (UpdateHistSearch(R)) return kPRSuccess;\n        return kPRError;\n      case kCmdHistReplay:\n        if (fCurHistEntry == (size_t) -1) return kPRError;\n        fReplayHistEntry = fCurHistEntry;\n        return kPRSuccess;\n      case kCmdClearScreen:\n      case kCmd_END_TEXT_MODIFYING_CMDS:\n        return kPRError;\n      case kCmdEsc:\n        \/\/ Already done for all commands:\n        \/\/CancelSpecialInputMode(R);\n        return kPRSuccess;\n      case kCmdComplete:\n      {\n        \/\/ Completion happens below current input.\n        ProcessMove(kMoveEnd, R);\n        std::vector<std::string> completions;\n        TabCompletion* tc = fContext->GetCompletion();\n        if (tc) {\n          bool ret = tc->Complete(Line, Cursor, R, completions);\n          if (ret) {\n            if (!completions.empty()) {\n              fContext->GetTextInput()->DisplayInfo(completions);\n              R.fDisplay.Extend(Range::AllWithPrompt());\n            }\n            fContext->SetCursor(Cursor);\n            return kPRSuccess;\n          }\n        }\n        return kPRError;\n      }\n      case kCmdWindowResize:\n        fContext->GetTextInput()->HandleResize();\n        return kPRSuccess;\n      case kCmdHistComplete:\n        \/\/ Not handled yet, todo.\n        return kPRError;\n    }\n    return kPRError;\n  }\n\n  size_t\n  Editor::FindWordBoundary(int Direction) {\n    static const char space[] = \" \\x9\";\n\n    const Text& Line = fContext->GetLine();\n    size_t Cursor = fContext->GetCursor();\n\n    if (Direction < 0 && Cursor < 2) return 0;\n    size_t ret = Direction > 0 ?\n      Line.GetText().find_first_of(space, Cursor + 1)\n    : Line.GetText().find_last_of(space, Cursor - 2);\n\n    if (ret == std::string::npos) {\n      if (Direction > 0) return Line.length();\n      else return 0;\n    }\n\n    if (Direction < 0)\n      ret += 1;\n\n    if (ret == std::string::npos) {\n      if (Direction > 0) return Line.length();\n      else return 0;\n    }\n    return ret;\n  }\n\n  void\n  Editor::AddToPasteBuf(int Dir, std::string const &T) {\n    if (fCutDirection == Dir) {\n      if (Dir < 0) {\n        fPasteBuf = T + fPasteBuf;\n      } else {\n        fPasteBuf += T;\n      }\n    } else {\n      fCutDirection = Dir;\n      fPasteBuf = T;\n    }\n  }\n\n  void\n  Editor::AddToPasteBuf(int Dir, char T) {\n    if (fCutDirection == Dir) {\n      if (Dir < 0) {\n        fPasteBuf = std::string(1, T) + fPasteBuf;\n      } else {\n        fPasteBuf += T;\n      }\n    } else {\n      fCutDirection = Dir;\n      fPasteBuf = T;\n    }\n  }\n\n  void\n  Editor::PushUndo() {\n    static const size_t MaxUndoBufSize = 100;\n    if (fUndoBuf.size() > MaxUndoBufSize) {\n      fUndoBuf.pop_front();\n    }\n    fUndoBuf.push_back(std::make_pair(fContext->GetLine(),\n                                      fContext->GetCursor()));\n  }\n\n   \/\/ Pin vtables:\n   TabCompletion::~TabCompletion() {}\n   FunKey::~FunKey() {}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\/\n\/\/ Serial Queue by Foster Brereton, Sean Parent, and Felix Petriconi\n\/\/\n\/\/ Distributed under the MIT License. (See accompanying LICENSE.md or copy at\n\/\/ https:\/\/opensource.org\/licenses\/MIT)\n\/******************************************************************************\/\n\n#ifndef MUTEXPP_SERIAL_QUEUE_HPP__\n#define MUTEXPP_SERIAL_QUEUE_HPP__\n\n\/******************************************************************************\/\n\n\/\/ stdc++\n#include <future>\n\n\/******************************************************************************\/\n\n#if __APPLE__\n\n\/******************************************************************************\/\n\n#include <dispatch\/dispatch.h>\n\n\/******************************************************************************\/\n\nnamespace mutexpp {\n\n\/******************************************************************************\/\n\nnamespace detail {\n\n\/******************************************************************************\/\n\ntemplate <typename T>\nusing result_of_t = typename std::result_of<T>::type;\n\ntemplate <typename T>\nusing decay_t = typename std::decay<T>::type;\n\ntemplate <class Function, class... Args>\nusing result_type = result_of_t<decay_t<Function>(decay_t<Args>...)>;\n\n\/******************************************************************************\/\n\n} \/\/ namespace detail\n\n\/******************************************************************************\/\n\nclass serial_queue_t {\n    dispatch_queue_t _q = dispatch_queue_create(\"com.mutexpp.serial_queue\", NULL);\n\npublic:\n    serial_queue_t() = default;\n\n    serial_queue_t(const serial_queue_t& rhs) : _q(rhs._q) {\n        dispatch_retain(_q);\n    }\n\n    serial_queue_t(const char* name) : _q{ dispatch_queue_create(name, NULL) } {\n    }\n\n    ~serial_queue_t() {\n        dispatch_release(_q);\n    }\n\n    serial_queue_t& operator=(const serial_queue_t& rhs) {\n        if (_q != rhs._q) {\n            dispatch_release(_q);\n            _q = rhs._q;\n            dispatch_retain(_q);\n        }\n\n        return *this;\n    }\n\n    template <class Function, class... Args>\n    std::future<detail::result_type<Function, Args...>> async(Function&& f, Args&&... args) {\n        using result_type = detail::result_type<Function, Args...>;\n        using packaged_type = std::packaged_task<result_type()>;\n\n        auto p = new packaged_type(std::bind([f](Args&&... args) {\n            return f(std::move(args)...);\n        }, std::forward<Args>(args)...));\n\n        auto result = p->get_future();\n\n        dispatch_async_f(_q,\n                         p,\n                         [](void* f_) {\n                             packaged_type* f = static_cast<packaged_type*>(f_);\n                             (*f)();\n                             delete f;\n                         });\n\n        return result;\n    }\n\n    template <class Function, class... Args>\n    detail::result_type<Function, Args...> sync(Function&& f, Args&&... args) {\n        return async(std::forward<Function>(f), std::forward<Args>(args)...).get();\n    }\n};\n\n\/******************************************************************************\/\n\n} \/\/ namespace mutexpp\n\n\/******************************************************************************\/\n\n#elif _MSC_VER\n\n\/******************************************************************************\/\n\n#include <mfapi.h>\n#include <shlwapi.h>\n\n#pragma comment(lib, \"mfplat\")\n#pragma comment(lib, \"shlwapi\")\n\n\/******************************************************************************\/\n\nnamespace mutexpp {\n\n\/******************************************************************************\/\n\nnamespace detail {\n\n\/******************************************************************************\/\n\ntemplate <class Function, class... Args>\nusing result_type = decltype(std::declval<Function>()(std::declval<Args>()...));\n\n\/******************************************************************************\/\n\nstruct mf_init_t {\n    mf_init_t() {\n        if (MFStartup(MF_VERSION, MFSTARTUP_LITE) != S_OK)\n            throw std::runtime_error(\"MFStartup failed\");\n\n        _ok = true;\n    }\n    ~mf_init_t() {\n        if (_ok)\n            MFShutdown();\n    }\n    bool _ok{false};\n};\n\n\/******************************************************************************\/\n\ntemplate <typename ResultType, typename PackagedType>\nstruct async_wrapper : public IMFAsyncCallback {\n    PackagedType _p;\n    LONG         _rc{1};\n\n    template <typename F>\n    explicit async_wrapper(F&& f) : _p(std::forward<F>(f)) { }\n\n    std::future<ResultType> get_future() { return _p.get_future(); }\n\n    STDMETHODIMP QueryInterface(REFIID riid, void** ppv) {\n        #pragma warning (push)\n        #pragma warning (disable:4838) \/\/ DWORD to int narrowing conversion\n        static const QITAB qit[] = {\n            QITABENT(async_wrapper, IMFAsyncCallback),\n            { 0 }\n        };\n        #pragma warning (pop)\n        return QISearch(this, qit, riid, ppv);\n    }\n\n    STDMETHODIMP_(ULONG) AddRef() {\n        return InterlockedIncrement(&_rc);\n    }\n\n    STDMETHODIMP_(ULONG) Release() {\n        LONG cRef = InterlockedDecrement(&_rc);\n        if (cRef == 0) {\n            delete this;\n        }\n        return cRef;\n    }\n\n    STDMETHODIMP GetParameters(DWORD*, DWORD*) {\n        return E_NOTIMPL;\n    }\n\n    STDMETHODIMP Invoke(IMFAsyncResult* result) {\n        _p();\n        delete this;\n        return S_OK;\n    }\n};\n\n\/******************************************************************************\/\n\n} \/\/ namespace detail\n\n\/******************************************************************************\/\n\nclass serial_queue_t {\n    DWORD _q{0};\n\npublic:\n    serial_queue_t() = default;\n\n    serial_queue_t(const serial_queue_t& rhs) :\n        _q(rhs._q) {\n        MFLockWorkQueue(_q);\n    }\n\n    serial_queue_t(const char* name) {\n        HRESULT hr = MFAllocateSerialWorkQueue(MFASYNC_CALLBACK_QUEUE_MULTITHREADED, &_q);\n\n        if (hr != S_OK)\n            throw std::bad_alloc();\n    }\n\n    ~serial_queue_t() {\n        MFUnlockWorkQueue(_q);\n    }\n\n    serial_queue_t& operator=(const serial_queue_t& rhs) {\n        if (_q != rhs._q) {\n            MFUnlockWorkQueue(_q);\n            _q = rhs._q;\n            MFLockWorkQueue(_q);\n        }\n\n        return *this;\n    }\n\n    template <class Function, class... Args>\n    std::future<detail::result_type<Function, Args...>> async(Function&& f, Args&&... args) {\n        static const detail::mf_init_t init_s;\n\n        using result_type = detail::result_type<Function, Args...>;\n        using packaged_type = std::packaged_task<result_type()>;\n\n        auto p = new detail::async_wrapper<result_type, packaged_type>(std::bind([f](Args&&... args) {\n            return f(std::move(args)...);\n        }, std::forward<Args>(args)...));\n\n        auto result = p->get_future();\n\n        if (MFPutWorkItem(_q, p, nullptr) != S_OK)\n            throw std::runtime_error(\"MFPutWorkItem failed\");\n\n        return result;\n    }\n\n    template <class Function, class... Args>\n    detail::result_type<Function, Args...> sync(Function&& f, Args&&... args) {\n        return async(std::forward<Function>(f), std::forward<Args>(args)...).get();\n    }\n};\n\n\/******************************************************************************\/\n\n} \/\/ namespace mutexpp\n\n\/******************************************************************************\/\n\n#endif \/\/ APPLE, MSC_VER, etc.\n\n\/******************************************************************************\/\n\n#endif \/\/ MUTEXPP_SERIAL_QUEUE_HPP__\n\n\/******************************************************************************\/\n<commit_msg>working on a serial queue wrapper to make adoption easier<commit_after>\/******************************************************************************\/\n\/\/ Serial Queue by Foster Brereton, Sean Parent, and Felix Petriconi\n\/\/\n\/\/ Distributed under the MIT License. (See accompanying LICENSE.md or copy at\n\/\/ https:\/\/opensource.org\/licenses\/MIT)\n\/******************************************************************************\/\n\n#ifndef MUTEXPP_SERIAL_QUEUE_HPP__\n#define MUTEXPP_SERIAL_QUEUE_HPP__\n\n\/******************************************************************************\/\n\n\/\/ stdc++\n#include <future>\n\n\/******************************************************************************\/\n\n#if __APPLE__\n\n\/******************************************************************************\/\n\n#include <dispatch\/dispatch.h>\n\n\/******************************************************************************\/\n\nnamespace mutexpp {\n\n\/******************************************************************************\/\n\nnamespace detail {\n\n\/******************************************************************************\/\n\ntemplate <typename T>\nusing result_of_t = typename std::result_of<T>::type;\n\ntemplate <typename T>\nusing decay_t = typename std::decay<T>::type;\n\ntemplate <class Function, class... Args>\nusing result_type = result_of_t<decay_t<Function>(decay_t<Args>...)>;\n\n\/******************************************************************************\/\n\n} \/\/ namespace detail\n\n\/******************************************************************************\/\n\nclass serial_queue_t {\n    dispatch_queue_t _q = dispatch_queue_create(\"com.mutexpp.serial_queue\", NULL);\n\npublic:\n    serial_queue_t() = default;\n\n    serial_queue_t(const serial_queue_t& rhs) : _q(rhs._q) {\n        dispatch_retain(_q);\n    }\n\n    serial_queue_t(const char* name) : _q{ dispatch_queue_create(name, NULL) } {\n    }\n\n    ~serial_queue_t() {\n        dispatch_release(_q);\n    }\n\n    serial_queue_t& operator=(const serial_queue_t& rhs) {\n        if (_q != rhs._q) {\n            dispatch_release(_q);\n            _q = rhs._q;\n            dispatch_retain(_q);\n        }\n\n        return *this;\n    }\n\n    template <class Function, class... Args>\n    std::future<detail::result_type<Function, Args...>> async(Function&& f, Args&&... args) {\n        using result_type = detail::result_type<Function, Args...>;\n        using packaged_type = std::packaged_task<result_type()>;\n\n        auto p = new packaged_type(std::bind([f](Args&&... args) {\n            return f(std::move(args)...);\n        }, std::forward<Args>(args)...));\n\n        auto result = p->get_future();\n\n        dispatch_async_f(_q,\n                         p,\n                         [](void* f_) {\n                             packaged_type* f = static_cast<packaged_type*>(f_);\n                             (*f)();\n                             delete f;\n                         });\n\n        return result;\n    }\n\n    template <class Function, class... Args>\n    detail::result_type<Function, Args...> sync(Function&& f, Args&&... args) {\n        return async(std::forward<Function>(f), std::forward<Args>(args)...).get();\n    }\n};\n\n\/******************************************************************************\/\n\n} \/\/ namespace mutexpp\n\n\/******************************************************************************\/\n\n#elif _MSC_VER\n\n\/******************************************************************************\/\n\n#include <mfapi.h>\n#include <shlwapi.h>\n\n#pragma comment(lib, \"mfplat\")\n#pragma comment(lib, \"shlwapi\")\n\n\/******************************************************************************\/\n\nnamespace mutexpp {\n\n\/******************************************************************************\/\n\nnamespace detail {\n\n\/******************************************************************************\/\n\ntemplate <class Function, class... Args>\nusing result_type = decltype(std::declval<Function>()(std::declval<Args>()...));\n\n\/******************************************************************************\/\n\nstruct mf_init_t {\n    mf_init_t() {\n        if (MFStartup(MF_VERSION, MFSTARTUP_LITE) != S_OK)\n            throw std::runtime_error(\"MFStartup failed\");\n\n        _ok = true;\n    }\n    ~mf_init_t() {\n        if (_ok)\n            MFShutdown();\n    }\n    bool _ok{false};\n};\n\n\/******************************************************************************\/\n\ntemplate <typename ResultType, typename PackagedType>\nstruct async_wrapper : public IMFAsyncCallback {\n    PackagedType _p;\n    LONG         _rc{1};\n\n    template <typename F>\n    explicit async_wrapper(F&& f) : _p(std::forward<F>(f)) { }\n\n    std::future<ResultType> get_future() { return _p.get_future(); }\n\n    STDMETHODIMP QueryInterface(REFIID riid, void** ppv) {\n        #pragma warning (push)\n        #pragma warning (disable:4838) \/\/ DWORD to int narrowing conversion\n        static const QITAB qit[] = {\n            QITABENT(async_wrapper, IMFAsyncCallback),\n            { 0 }\n        };\n        #pragma warning (pop)\n        return QISearch(this, qit, riid, ppv);\n    }\n\n    STDMETHODIMP_(ULONG) AddRef() {\n        return InterlockedIncrement(&_rc);\n    }\n\n    STDMETHODIMP_(ULONG) Release() {\n        LONG cRef = InterlockedDecrement(&_rc);\n        if (cRef == 0) {\n            delete this;\n        }\n        return cRef;\n    }\n\n    STDMETHODIMP GetParameters(DWORD*, DWORD*) {\n        return E_NOTIMPL;\n    }\n\n    STDMETHODIMP Invoke(IMFAsyncResult* result) {\n        _p();\n        delete this;\n        return S_OK;\n    }\n};\n\n\/******************************************************************************\/\n\n} \/\/ namespace detail\n\n\/******************************************************************************\/\n\nclass serial_queue_t {\n    DWORD _q{0};\n\npublic:\n    serial_queue_t() = default;\n\n    serial_queue_t(const serial_queue_t& rhs) :\n        _q(rhs._q) {\n        MFLockWorkQueue(_q);\n    }\n\n    serial_queue_t(const char* name) {\n        HRESULT hr = MFAllocateSerialWorkQueue(MFASYNC_CALLBACK_QUEUE_MULTITHREADED, &_q);\n\n        if (hr != S_OK)\n            throw std::bad_alloc();\n    }\n\n    ~serial_queue_t() {\n        MFUnlockWorkQueue(_q);\n    }\n\n    serial_queue_t& operator=(const serial_queue_t& rhs) {\n        if (_q != rhs._q) {\n            MFUnlockWorkQueue(_q);\n            _q = rhs._q;\n            MFLockWorkQueue(_q);\n        }\n\n        return *this;\n    }\n\n    template <class Function, class... Args>\n    std::future<detail::result_type<Function, Args...>> async(Function&& f, Args&&... args) {\n        static const detail::mf_init_t init_s;\n\n        using result_type = detail::result_type<Function, Args...>;\n        using packaged_type = std::packaged_task<result_type()>;\n\n        auto p = new detail::async_wrapper<result_type, packaged_type>(std::bind([f](Args&&... args) {\n            return f(std::move(args)...);\n        }, std::forward<Args>(args)...));\n\n        auto result = p->get_future();\n\n        if (MFPutWorkItem(_q, p, nullptr) != S_OK)\n            throw std::runtime_error(\"MFPutWorkItem failed\");\n\n        return result;\n    }\n\n    template <class Function, class... Args>\n    detail::result_type<Function, Args...> sync(Function&& f, Args&&... args) {\n        return async(std::forward<Function>(f), std::forward<Args>(args)...).get();\n    }\n};\n\n\/******************************************************************************\/\n\n} \/\/ namespace mutexpp\n\n\/******************************************************************************\/\n\n#endif \/\/ APPLE, MSC_VER, etc.\n\n\/******************************************************************************\/\n\nnamespace mutexpp {\n\n\/******************************************************************************\/\n\ntemplate <typename T>\nclass serial_wrapper {\npublic:\n    serial_queue_t _q;\n    T              _r;\n\npublic:\n    typedef T value_type;\n\n    template <typename... Args>\n    explicit serial_wrapper(Args&&... args) : _r(std::forward<Args>(args)...) {\n    }\n\n    template <typename F>\n    auto operator()(F&& f) -> decltype(_q.async(std::bind(std::forward<F>(f), std::ref(_r)))) {\n        return _q.async(std::bind(std::forward<F>(f), std::ref(_r)));\n    }\n};\n\n\/******************************************************************************\/\n\n} \/\/ namespace mutexpp\n\n\/******************************************************************************\/\n\n#endif \/\/ MUTEXPP_SERIAL_QUEUE_HPP__\n\n\/******************************************************************************\/\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: FindFirstVolumeMountPointA.cpp,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-08 16:12: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#include \"macros.h\"\n\nDEFINE_DEFAULT_THUNK( kernel32, TRYLOAD, HANDLE, WINAPI, FindFirstVolumeMountPointA, (LPSTR lpszRootPathName, LPSTR lpszVolumeMountPoint, DWORD cchBufferLength) )<commit_msg>INTEGRATION: CWS obo12 (1.3.250); FILE MERGED 2007\/05\/10 11:22:22 obo 1.3.250.1: #i76713# LPSTR -> LPCSTR (Vista PSDK)<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: FindFirstVolumeMountPointA.cpp,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: ihi $ $Date: 2007-06-05 11:01: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#include \"macros.h\"\n\nDEFINE_DEFAULT_THUNK( kernel32, TRYLOAD, HANDLE, WINAPI, FindFirstVolumeMountPointA, (LPCSTR lpszRootPathName, LPSTR lpszVolumeMountPoint, DWORD cchBufferLength) )<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file   RandomTest.cpp\n * @brief  Random class tester.\n * @author zer0\n * @date   2016-04-07\n *\/\n\n#include <gtest\/gtest.h>\n#include <libtbag\/Random.hpp>\n#include <iostream>\n\nusing namespace libtbag;\n\nTEST(RandomStaticTest, gen)\n{\n    int min = 0;\n    int max = 10;\n    int current = 0;\n    int test_count = 100;\n\n    for (int i = 0; i < test_count; ++i) {\n        current = Random::gen(min, max);\n        std::cout << current;\n        ASSERT_GE(current, min);\n        ASSERT_LE(current, max);\n    }\n}\n\n<commit_msg>Remove test code.<commit_after>\/**\n * @file   RandomTest.cpp\n * @brief  Random class tester.\n * @author zer0\n * @date   2016-04-07\n *\/\n\n#include <gtest\/gtest.h>\n#include <libtbag\/Random.hpp>\n\nusing namespace libtbag;\n\nTEST(RandomStaticTest, gen)\n{\n    int min = 0;\n    int max = 10;\n    int current = 0;\n    int test_count = 100;\n\n    for (int i = 0; i < test_count; ++i) {\n        current = Random::gen(min, max);\n        ASSERT_GE(current, min);\n        ASSERT_LE(current, max);\n    }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.\n\/\/ SPDX - License - Identifier: Apache - 2.0\n\n#include <awsdoc\/s3-crt\/s3-crt-demo.h>\n\/\/ snippet-start:[s3-crt.cpp.bucket_operations.list_create_delete]\n#include <iostream>\n#include <fstream>\n#include <aws\/core\/Aws.h>\n#include <aws\/core\/utils\/memory\/stl\/AWSStringStream.h>\n#include <aws\/core\/utils\/logging\/CRTLogSystem.h>\n#include <aws\/s3-crt\/S3CrtClient.h>\n#include <aws\/s3-crt\/model\/CreateBucketRequest.h>\n#include <aws\/s3-crt\/model\/BucketLocationConstraint.h>\n#include <aws\/s3-crt\/model\/DeleteBucketRequest.h>\n#include <aws\/s3-crt\/model\/PutObjectRequest.h>\n#include <aws\/s3-crt\/model\/GetObjectRequest.h>\n#include <aws\/s3-crt\/model\/DeleteObjectRequest.h>\n#include <aws\/core\/utils\/UUID.h>\n\nstatic const char ALLOCATION_TAG[] = \"s3-crt-demo\";\n\n\/\/ List all Amazon Simple Storage Service (Amazon S3) buckets under the account.\nbool ListBuckets(const Aws::S3Crt::S3CrtClient& s3CrtClient, const Aws::String& bucketName) {\n\n    Aws::S3Crt::Model::ListBucketsOutcome outcome = s3CrtClient.ListBuckets();\n\n    if (outcome.IsSuccess()) {\n        std::cout << \"All buckets under my account:\" << std::endl;\n\n        for (auto const& bucket : outcome.GetResult().GetBuckets())\n        {\n            std::cout << \"  * \" << bucket.GetName() << std::endl;\n        }\n        std::cout << std::endl;\n\n        return true;\n    }\n    else {\n        std::cout << \"ListBuckets error:\\n\"<< outcome.GetError() << std::endl << std::endl;\n\n        return false;\n    }\n}\n\n\/\/ Create an Amazon Simple Storage Service (Amazon S3) bucket.\nbool CreateBucket(const Aws::S3Crt::S3CrtClient& s3CrtClient, const Aws::String& bucketName,\n    const Aws::S3Crt::Model::BucketLocationConstraint& locConstraint) {\n\n    std::cout << \"Creating bucket: \\\"\" << bucketName << \"\\\" ...\" << std::endl;\n\n    Aws::S3Crt::Model::CreateBucketRequest request;\n    request.SetBucket(bucketName);\n\n    \/\/  If you don't specify an AWS Region, the bucket is created in the US East (N. Virginia) Region (us-east-1)\n    if (locConstraint != Aws::S3Crt::Model::BucketLocationConstraint::us_east_1)\n    {\n        Aws::S3Crt::Model::CreateBucketConfiguration bucket_config;\n        bucket_config.SetLocationConstraint(locConstraint);\n\n        request.SetCreateBucketConfiguration(bucket_config);\n    }\n\n    Aws::S3Crt::Model::CreateBucketOutcome outcome = s3CrtClient.CreateBucket(request);\n\n    if (outcome.IsSuccess()) {\n        std::cout << \"Bucket created.\" << std::endl << std::endl;\n\n        return true;\n    }\n    else {\n        std::cout << \"CreateBucket error:\\n\" << outcome.GetError() << std::endl << std::endl;\n\n        return false;\n    }\n}\n\n\/\/ Delete an existing Amazon S3 bucket.\nbool DeleteBucket(const Aws::S3Crt::S3CrtClient& s3CrtClient, const Aws::String& bucketName) {\n\n    std::cout << \"Deleting bucket: \\\"\" << bucketName << \"\\\" ...\" << std::endl;\n\n    Aws::S3Crt::Model::DeleteBucketRequest request;\n    request.SetBucket(bucketName);\n\n    Aws::S3Crt::Model::DeleteBucketOutcome outcome = s3CrtClient.DeleteBucket(request);\n\n    if (outcome.IsSuccess()) {\n        std::cout << \"Bucket deleted.\" << std::endl << std::endl;\n\n        return true;\n    }\n    else {\n        std::cout << \"DeleteBucket error:\\n\" << outcome.GetError() << std::endl << std::endl;\n\n        return false;\n    }\n}\n\n\/\/ Put an Amazon S3 object to the bucket.\nbool PutObject(const Aws::S3Crt::S3CrtClient& s3CrtClient, const Aws::String& bucketName, const Aws::String& objectKey, const Aws::String& fileName) {\n\n    std::cout << \"Putting object: \\\"\" << objectKey << \"\\\" to bucket: \\\"\" << bucketName << \"\\\" ...\" << std::endl;\n\n    Aws::S3Crt::Model::PutObjectRequest request;\n    request.SetBucket(bucketName);\n    request.SetKey(objectKey);\n    std::shared_ptr<Aws::IOStream> bodyStream = Aws::MakeShared<Aws::FStream>(ALLOCATION_TAG, fileName.c_str(), std::ios_base::in | std::ios_base::binary);\n    if (!bodyStream->good()) {\n        std::cout << \"Failed to open file: \\\"\" << fileName << \"\\\".\" << std::endl << std::endl;\n        return false;\n    }\n    request.SetBody(bodyStream);\n\n    \/\/A PUT operation turns into a multipart upload using the s3-crt client.\n    \/\/https:\/\/github.com\/aws\/aws-sdk-cpp\/wiki\/Improving-S3-Throughput-with-AWS-SDK-for-CPP-v1.9\n    Aws::S3Crt::Model::PutObjectOutcome outcome = s3CrtClient.PutObject(request);\n\n    if (outcome.IsSuccess()) {\n        std::cout << \"Object added.\" << std::endl << std::endl;\n\n        return true;\n    }\n    else {\n        std::cout << \"PutObject error:\\n\" << outcome.GetError() << std::endl << std::endl;\n\n        return false;\n    }\n}\n\n\/\/ Get the Amazon S3 object from the bucket.\nbool GetObject(const Aws::S3Crt::S3CrtClient& s3CrtClient, const Aws::String& bucketName, const Aws::String& objectKey) {\n\n    std::cout << \"Getting object: \\\"\" << objectKey << \"\\\" from bucket: \\\"\" << bucketName << \"\\\" ...\" << std::endl;\n\n    Aws::S3Crt::Model::GetObjectRequest request;\n    request.SetBucket(bucketName);\n    request.SetKey(objectKey);\n\n    Aws::S3Crt::Model::GetObjectOutcome outcome = s3CrtClient.GetObject(request);\n\n    if (outcome.IsSuccess()) {\n       \/\/Uncomment this line if you wish to have the contents of the file displayed. Not recommended for large files\n       \/\/ because it takes a while.\n       \/\/ std::cout << \"Object content: \" << outcome.GetResult().GetBody().rdbuf() << std::endl << std::endl;\n\n        return true;\n    }\n    else {\n        std::cout << \"GetObject error:\\n\" << outcome.GetError() << std::endl << std::endl;\n\n        return false;\n    }\n}\n\n\/\/ Delete the Amazon S3 object from the bucket.\nbool DeleteObject(const Aws::S3Crt::S3CrtClient& s3CrtClient, const Aws::String& bucketName, const Aws::String& objectKey) {\n\n    std::cout << \"Deleting object: \\\"\" << objectKey << \"\\\" from bucket: \\\"\" << bucketName << \"\\\" ...\" << std::endl;\n\n    Aws::S3Crt::Model::DeleteObjectRequest request;\n    request.SetBucket(bucketName);\n    request.SetKey(objectKey);\n\n    Aws::S3Crt::Model::DeleteObjectOutcome outcome = s3CrtClient.DeleteObject(request);\n\n    if (outcome.IsSuccess()) {\n        std::cout << \"Object deleted.\" << std::endl << std::endl;\n\n        return true;\n    }\n    else {\n        std::cout << \"DeleteObject error:\\n\" << outcome.GetError() << std::endl << std::endl;\n\n        return false;\n    }\n}\n\n\/\/ 1. List all buckets under the account\n\/\/ 2. Create an Amazon S3 bucket\n\/\/ 3. Put an object to the bucket\n\/\/ 4. Get the object\n\/\/ 5. Delete the object\n\/\/ 6. Delete the bucket\nint main(int argc, char* argv[]) {\n\n    Aws::SDKOptions options;\n    \/\/Turn on logging.\n    options.loggingOptions.logLevel = Aws::Utils::Logging::LogLevel::Info;\n    \/\/ Override the default log level for AWS common runtime libraries to see multipart upload entries in the log file.\n    options.loggingOptions.crt_logger_create_fn = []() {\n        return Aws::MakeShared<Aws::Utils::Logging::DefaultCRTLogSystem>(ALLOCATION_TAG, Aws::Utils::Logging::LogLevel::Debug);\n    };\n\n    \/\/ Uncomment the following code to override default global client bootstrap for AWS common runtime libraries.\n    \/\/ options.ioOptions.clientBootstrap_create_fn = []() {\n    \/\/     Aws::Crt::Io::EventLoopGroup eventLoopGroup(0 \/* cpuGroup *\/, 18 \/* threadCount *\/);\n    \/\/     Aws::Crt::Io::DefaultHostResolver defaultHostResolver(eventLoopGroup, 8 \/* maxHosts *\/, 300 \/* maxTTL *\/);\n    \/\/     auto clientBootstrap = Aws::MakeShared<Aws::Crt::Io::ClientBootstrap>(ALLOCATION_TAG, eventLoopGroup, defaultHostResolver);\n    \/\/     clientBootstrap->EnableBlockingShutdown();\n    \/\/     return clientBootstrap;\n    \/\/ };\n\n    \/\/ Uncomment the following code to override default global TLS connection options for AWS common runtime libraries.\n    \/\/ options.ioOptions.tlsConnectionOptions_create_fn = []() {\n    \/\/     Aws::Crt::Io::TlsContextOptions tlsCtxOptions = Aws::Crt::Io::TlsContextOptions::InitDefaultClient();\n    \/\/     Aws::Crt::Io::TlsContext tlsContext(tlsCtxOptions, Aws::Crt::Io::TlsMode::CLIENT);\n    \/\/     return Aws::MakeShared<Aws::Crt::Io::TlsConnectionOptions>(ALLOCATION_TAG, tlsContext.NewConnectionOptions());\n    \/\/ };\n\n    Aws::InitAPI(options);\n    {\n\n        \/\/ TODO: Add a large file to your executable folder, and update file_name to the name of that file.\n        \/\/    File \"ny.json\" (1940 census data; https:\/\/www.archives.gov\/developer\/1940-census#accessportiondataset) \n        \/\/    is an example data file large enough to demonstrate multipart upload.  \n        \/\/ Download \"ny.json\" from https:\/\/nara-1940-census.s3.us-east-2.amazonaws.com\/metadata\/json\/ny.json\n        Aws::String file_name = \"ny.json\";\n        \n        \/\/TODO: Set to your account AWS Region.\n        Aws::String region = Aws::Region::US_EAST_1;\n\n        \/\/The object_key is the unique identifier for the object in the bucket.\n        Aws::String object_key = \"my-object\";\n\n        \/\/ Create a globally unique name for the new bucket.\n        \/\/ Format: \"my-bucket-\" + lowercase UUID.\n        Aws::String uuid = Aws::Utils::UUID::RandomUUID();\n        Aws::String bucket_name = \"my-bucket-\" +\n            Aws::Utils::StringUtils::ToLower(uuid.c_str());\n\n        const double throughput_target_gbps = 5;\n        const uint64_t part_size = 8 * 1024 * 1024; \/\/ 8 MB.\n\n        Aws::S3Crt::ClientConfiguration config;\n        config.region = region;\n        config.throughputTargetGbps = throughput_target_gbps;\n        config.partSize = part_size;\n\n        Aws::S3Crt::S3CrtClient s3_crt_client(config);\n\n        \/\/Use BucketLocationConstraintMapper to get the BucketLocationConstraint enum from the region string.\n        \/\/https:\/\/sdk.amazonaws.com\/cpp\/api\/0.14.3\/namespace_aws_1_1_s3_1_1_model_1_1_bucket_location_constraint_mapper.html#a50d4503d3f481022f969eff1085cfbb0\n        Aws::S3Crt::Model::BucketLocationConstraint locConstraint = Aws::S3Crt::Model::BucketLocationConstraintMapper::GetBucketLocationConstraintForName(region);\n\n        ListBuckets(s3_crt_client, bucket_name);\n\n        CreateBucket(s3_crt_client, bucket_name, locConstraint);\n\n        PutObject(s3_crt_client, bucket_name, object_key, file_name);\n\n        GetObject(s3_crt_client, bucket_name, object_key);\n\n        DeleteObject(s3_crt_client, bucket_name, object_key);\n\n        DeleteBucket(s3_crt_client, bucket_name);\n    }\n    Aws::ShutdownAPI(options);\n\n    return 0;\n}\n\/\/ snippet-end:[s3-crt.cpp.bucket_operations.list_create_delete]\n<commit_msg>added a line to show how to override defaultTrustStore (#2935)<commit_after>\/\/ Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.\n\/\/ SPDX - License - Identifier: Apache - 2.0\n\n#include <awsdoc\/s3-crt\/s3-crt-demo.h>\n\/\/ snippet-start:[s3-crt.cpp.bucket_operations.list_create_delete]\n#include <iostream>\n#include <fstream>\n#include <aws\/core\/Aws.h>\n#include <aws\/core\/utils\/memory\/stl\/AWSStringStream.h>\n#include <aws\/core\/utils\/logging\/CRTLogSystem.h>\n#include <aws\/s3-crt\/S3CrtClient.h>\n#include <aws\/s3-crt\/model\/CreateBucketRequest.h>\n#include <aws\/s3-crt\/model\/BucketLocationConstraint.h>\n#include <aws\/s3-crt\/model\/DeleteBucketRequest.h>\n#include <aws\/s3-crt\/model\/PutObjectRequest.h>\n#include <aws\/s3-crt\/model\/GetObjectRequest.h>\n#include <aws\/s3-crt\/model\/DeleteObjectRequest.h>\n#include <aws\/core\/utils\/UUID.h>\n\nstatic const char ALLOCATION_TAG[] = \"s3-crt-demo\";\n\n\/\/ List all Amazon Simple Storage Service (Amazon S3) buckets under the account.\nbool ListBuckets(const Aws::S3Crt::S3CrtClient& s3CrtClient, const Aws::String& bucketName) {\n\n    Aws::S3Crt::Model::ListBucketsOutcome outcome = s3CrtClient.ListBuckets();\n\n    if (outcome.IsSuccess()) {\n        std::cout << \"All buckets under my account:\" << std::endl;\n\n        for (auto const& bucket : outcome.GetResult().GetBuckets())\n        {\n            std::cout << \"  * \" << bucket.GetName() << std::endl;\n        }\n        std::cout << std::endl;\n\n        return true;\n    }\n    else {\n        std::cout << \"ListBuckets error:\\n\"<< outcome.GetError() << std::endl << std::endl;\n\n        return false;\n    }\n}\n\n\/\/ Create an Amazon Simple Storage Service (Amazon S3) bucket.\nbool CreateBucket(const Aws::S3Crt::S3CrtClient& s3CrtClient, const Aws::String& bucketName,\n    const Aws::S3Crt::Model::BucketLocationConstraint& locConstraint) {\n\n    std::cout << \"Creating bucket: \\\"\" << bucketName << \"\\\" ...\" << std::endl;\n\n    Aws::S3Crt::Model::CreateBucketRequest request;\n    request.SetBucket(bucketName);\n\n    \/\/  If you don't specify an AWS Region, the bucket is created in the US East (N. Virginia) Region (us-east-1)\n    if (locConstraint != Aws::S3Crt::Model::BucketLocationConstraint::us_east_1)\n    {\n        Aws::S3Crt::Model::CreateBucketConfiguration bucket_config;\n        bucket_config.SetLocationConstraint(locConstraint);\n\n        request.SetCreateBucketConfiguration(bucket_config);\n    }\n\n    Aws::S3Crt::Model::CreateBucketOutcome outcome = s3CrtClient.CreateBucket(request);\n\n    if (outcome.IsSuccess()) {\n        std::cout << \"Bucket created.\" << std::endl << std::endl;\n\n        return true;\n    }\n    else {\n        std::cout << \"CreateBucket error:\\n\" << outcome.GetError() << std::endl << std::endl;\n\n        return false;\n    }\n}\n\n\/\/ Delete an existing Amazon S3 bucket.\nbool DeleteBucket(const Aws::S3Crt::S3CrtClient& s3CrtClient, const Aws::String& bucketName) {\n\n    std::cout << \"Deleting bucket: \\\"\" << bucketName << \"\\\" ...\" << std::endl;\n\n    Aws::S3Crt::Model::DeleteBucketRequest request;\n    request.SetBucket(bucketName);\n\n    Aws::S3Crt::Model::DeleteBucketOutcome outcome = s3CrtClient.DeleteBucket(request);\n\n    if (outcome.IsSuccess()) {\n        std::cout << \"Bucket deleted.\" << std::endl << std::endl;\n\n        return true;\n    }\n    else {\n        std::cout << \"DeleteBucket error:\\n\" << outcome.GetError() << std::endl << std::endl;\n\n        return false;\n    }\n}\n\n\/\/ Put an Amazon S3 object to the bucket.\nbool PutObject(const Aws::S3Crt::S3CrtClient& s3CrtClient, const Aws::String& bucketName, const Aws::String& objectKey, const Aws::String& fileName) {\n\n    std::cout << \"Putting object: \\\"\" << objectKey << \"\\\" to bucket: \\\"\" << bucketName << \"\\\" ...\" << std::endl;\n\n    Aws::S3Crt::Model::PutObjectRequest request;\n    request.SetBucket(bucketName);\n    request.SetKey(objectKey);\n    std::shared_ptr<Aws::IOStream> bodyStream = Aws::MakeShared<Aws::FStream>(ALLOCATION_TAG, fileName.c_str(), std::ios_base::in | std::ios_base::binary);\n    if (!bodyStream->good()) {\n        std::cout << \"Failed to open file: \\\"\" << fileName << \"\\\".\" << std::endl << std::endl;\n        return false;\n    }\n    request.SetBody(bodyStream);\n\n    \/\/A PUT operation turns into a multipart upload using the s3-crt client.\n    \/\/https:\/\/github.com\/aws\/aws-sdk-cpp\/wiki\/Improving-S3-Throughput-with-AWS-SDK-for-CPP-v1.9\n    Aws::S3Crt::Model::PutObjectOutcome outcome = s3CrtClient.PutObject(request);\n\n    if (outcome.IsSuccess()) {\n        std::cout << \"Object added.\" << std::endl << std::endl;\n\n        return true;\n    }\n    else {\n        std::cout << \"PutObject error:\\n\" << outcome.GetError() << std::endl << std::endl;\n\n        return false;\n    }\n}\n\n\/\/ Get the Amazon S3 object from the bucket.\nbool GetObject(const Aws::S3Crt::S3CrtClient& s3CrtClient, const Aws::String& bucketName, const Aws::String& objectKey) {\n\n    std::cout << \"Getting object: \\\"\" << objectKey << \"\\\" from bucket: \\\"\" << bucketName << \"\\\" ...\" << std::endl;\n\n    Aws::S3Crt::Model::GetObjectRequest request;\n    request.SetBucket(bucketName);\n    request.SetKey(objectKey);\n\n    Aws::S3Crt::Model::GetObjectOutcome outcome = s3CrtClient.GetObject(request);\n\n    if (outcome.IsSuccess()) {\n       \/\/Uncomment this line if you wish to have the contents of the file displayed. Not recommended for large files\n       \/\/ because it takes a while.\n       \/\/ std::cout << \"Object content: \" << outcome.GetResult().GetBody().rdbuf() << std::endl << std::endl;\n\n        return true;\n    }\n    else {\n        std::cout << \"GetObject error:\\n\" << outcome.GetError() << std::endl << std::endl;\n\n        return false;\n    }\n}\n\n\/\/ Delete the Amazon S3 object from the bucket.\nbool DeleteObject(const Aws::S3Crt::S3CrtClient& s3CrtClient, const Aws::String& bucketName, const Aws::String& objectKey) {\n\n    std::cout << \"Deleting object: \\\"\" << objectKey << \"\\\" from bucket: \\\"\" << bucketName << \"\\\" ...\" << std::endl;\n\n    Aws::S3Crt::Model::DeleteObjectRequest request;\n    request.SetBucket(bucketName);\n    request.SetKey(objectKey);\n\n    Aws::S3Crt::Model::DeleteObjectOutcome outcome = s3CrtClient.DeleteObject(request);\n\n    if (outcome.IsSuccess()) {\n        std::cout << \"Object deleted.\" << std::endl << std::endl;\n\n        return true;\n    }\n    else {\n        std::cout << \"DeleteObject error:\\n\" << outcome.GetError() << std::endl << std::endl;\n\n        return false;\n    }\n}\n\n\/\/ 1. List all buckets under the account\n\/\/ 2. Create an Amazon S3 bucket\n\/\/ 3. Put an object to the bucket\n\/\/ 4. Get the object\n\/\/ 5. Delete the object\n\/\/ 6. Delete the bucket\nint main(int argc, char* argv[]) {\n\n    Aws::SDKOptions options;\n    \/\/Turn on logging.\n    options.loggingOptions.logLevel = Aws::Utils::Logging::LogLevel::Info;\n    \/\/ Override the default log level for AWS common runtime libraries to see multipart upload entries in the log file.\n    options.loggingOptions.crt_logger_create_fn = []() {\n        return Aws::MakeShared<Aws::Utils::Logging::DefaultCRTLogSystem>(ALLOCATION_TAG, Aws::Utils::Logging::LogLevel::Debug);\n    };\n\n    \/\/ Uncomment the following code to override default global client bootstrap for AWS common runtime libraries.\n    \/\/ options.ioOptions.clientBootstrap_create_fn = []() {\n    \/\/     Aws::Crt::Io::EventLoopGroup eventLoopGroup(0 \/* cpuGroup *\/, 18 \/* threadCount *\/);\n    \/\/     Aws::Crt::Io::DefaultHostResolver defaultHostResolver(eventLoopGroup, 8 \/* maxHosts *\/, 300 \/* maxTTL *\/);\n    \/\/     auto clientBootstrap = Aws::MakeShared<Aws::Crt::Io::ClientBootstrap>(ALLOCATION_TAG, eventLoopGroup, defaultHostResolver);\n    \/\/     clientBootstrap->EnableBlockingShutdown();\n    \/\/     return clientBootstrap;\n    \/\/ };\n\n    \/\/ Uncomment the following code to override default global TLS connection options for AWS common runtime libraries.\n    \/\/ options.ioOptions.tlsConnectionOptions_create_fn = []() {\n    \/\/     Aws::Crt::Io::TlsContextOptions tlsCtxOptions = Aws::Crt::Io::TlsContextOptions::InitDefaultClient();\n    \/\/     tlsCtxOptions.OverrideDefaultTrustStore(<CaPathString>, <CaCertString>);\n    \/\/     Aws::Crt::Io::TlsContext tlsContext(tlsCtxOptions, Aws::Crt::Io::TlsMode::CLIENT);\n    \/\/     return Aws::MakeShared<Aws::Crt::Io::TlsConnectionOptions>(ALLOCATION_TAG, tlsContext.NewConnectionOptions());\n    \/\/ };\n\n    Aws::InitAPI(options);\n    {\n\n        \/\/ TODO: Add a large file to your executable folder, and update file_name to the name of that file.\n        \/\/    File \"ny.json\" (1940 census data; https:\/\/www.archives.gov\/developer\/1940-census#accessportiondataset) \n        \/\/    is an example data file large enough to demonstrate multipart upload.  \n        \/\/ Download \"ny.json\" from https:\/\/nara-1940-census.s3.us-east-2.amazonaws.com\/metadata\/json\/ny.json\n        Aws::String file_name = \"ny.json\";\n        \n        \/\/TODO: Set to your account AWS Region.\n        Aws::String region = Aws::Region::US_EAST_1;\n\n        \/\/The object_key is the unique identifier for the object in the bucket.\n        Aws::String object_key = \"my-object\";\n\n        \/\/ Create a globally unique name for the new bucket.\n        \/\/ Format: \"my-bucket-\" + lowercase UUID.\n        Aws::String uuid = Aws::Utils::UUID::RandomUUID();\n        Aws::String bucket_name = \"my-bucket-\" +\n            Aws::Utils::StringUtils::ToLower(uuid.c_str());\n\n        const double throughput_target_gbps = 5;\n        const uint64_t part_size = 8 * 1024 * 1024; \/\/ 8 MB.\n\n        Aws::S3Crt::ClientConfiguration config;\n        config.region = region;\n        config.throughputTargetGbps = throughput_target_gbps;\n        config.partSize = part_size;\n\n        Aws::S3Crt::S3CrtClient s3_crt_client(config);\n\n        \/\/Use BucketLocationConstraintMapper to get the BucketLocationConstraint enum from the region string.\n        \/\/https:\/\/sdk.amazonaws.com\/cpp\/api\/0.14.3\/namespace_aws_1_1_s3_1_1_model_1_1_bucket_location_constraint_mapper.html#a50d4503d3f481022f969eff1085cfbb0\n        Aws::S3Crt::Model::BucketLocationConstraint locConstraint = Aws::S3Crt::Model::BucketLocationConstraintMapper::GetBucketLocationConstraintForName(region);\n\n        ListBuckets(s3_crt_client, bucket_name);\n\n        CreateBucket(s3_crt_client, bucket_name, locConstraint);\n\n        PutObject(s3_crt_client, bucket_name, object_key, file_name);\n\n        GetObject(s3_crt_client, bucket_name, object_key);\n\n        DeleteObject(s3_crt_client, bucket_name, object_key);\n\n        DeleteBucket(s3_crt_client, bucket_name);\n    }\n    Aws::ShutdownAPI(options);\n\n    return 0;\n}\n\/\/ snippet-end:[s3-crt.cpp.bucket_operations.list_create_delete]\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2010 Justin Tulloss\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 <v8.h>\n#include <node.h>\n#include <node_events.h>\n#include <node_buffer.h>\n#include <zmq.h>\n#include <assert.h>\n#include <stdio.h>\n#include <string.h>\n#include <errno.h>\n#include <list>\n#include <unistd.h>\n\nusing namespace v8;\nusing namespace node;\n\nnamespace zmq {\n\nzmq_msg_t z_msg;\n\nstatic Persistent<String> receive_symbol;\nstatic Persistent<String> error_symbol;\nstatic Persistent<String> connect_symbol;\n\n\/\/Forward declare cause they kind of interdepend\nclass Socket;\nclass Context;\n\nclass Context : public EventEmitter {\npublic:\n    static void\n    Initialize (v8::Handle<v8::Object> target) {\n        HandleScope scope;\n\n        Local<FunctionTemplate> t = FunctionTemplate::New(New);\n\n        t->Inherit(EventEmitter::constructor_template);\n        t->InstanceTemplate()->SetInternalFieldCount(1);\n\n        NODE_SET_PROTOTYPE_METHOD(t, \"close\", Close);\n\n        target->Set(String::NewSymbol(\"Context\"), t->GetFunction());\n    }\n\n    void * getCContext() {\n        return context_;\n    }\n\n    void AddSocket(Socket *s) {\n        sockets_.push_front(s);\n    }\n\n    void RemoveSocket(Socket *s) {\n        sockets_.remove(s);\n    }\n\n    void Close(Local<Value> exception = Local<Value>()) {\n        zmq_term(context_);\n        context_ = NULL;\n        Unref();\n    }\n\nprotected:\n    static Handle<Value>\n    New (const Arguments& args) {\n        HandleScope scope;\n\n        Context *context = new Context();\n        context->Wrap(args.This());\n\n        return args.This();\n    }\n\n    static Handle<Value>\n    Close (const Arguments& args) {\n        zmq::Context *context = ObjectWrap::Unwrap<Context>(args.This());\n        HandleScope scope;\n        context->Close();\n        return Undefined();\n    }\n\n    Context () : EventEmitter () {\n        context_ = zmq_init(1);\n    }\n\n    ~Context () {\n        assert(context_ == NULL);\n    }\n\nprivate:\n    void * context_;\n    std::list<Socket *> sockets_;\n};\n\n\nclass Socket : public EventEmitter {\npublic:\n    static void\n    Initialize (v8::Handle<v8::Object> target) {\n        HandleScope scope;\n\n        Local<FunctionTemplate> t = FunctionTemplate::New(New);\n\n        t->Inherit(EventEmitter::constructor_template);\n        t->InstanceTemplate()->SetInternalFieldCount(1);\n\n        NODE_DEFINE_CONSTANT(t, ZMQ_PUB);\n        NODE_DEFINE_CONSTANT(t, ZMQ_SUB);\n        NODE_DEFINE_CONSTANT(t, ZMQ_REQ);\n        NODE_DEFINE_CONSTANT(t, ZMQ_REP);\n        NODE_DEFINE_CONSTANT(t, ZMQ_UPSTREAM);\n        NODE_DEFINE_CONSTANT(t, ZMQ_DOWNSTREAM);\n        NODE_DEFINE_CONSTANT(t, ZMQ_PAIR);\n\n        NODE_SET_PROTOTYPE_METHOD(t, \"bind\", Bind);\n        NODE_SET_PROTOTYPE_METHOD(t, \"connect\", Connect);\n        NODE_SET_PROTOTYPE_METHOD(t, \"send\", Send);\n        NODE_SET_PROTOTYPE_METHOD(t, \"close\", Close);\n\n        receive_symbol = NODE_PSYMBOL(\"receive\");\n        connect_symbol = NODE_PSYMBOL(\"connect\");\n        error_symbol = NODE_PSYMBOL(\"error\");\n\n        target->Set(String::NewSymbol(\"Socket\"), t->GetFunction());\n    }\n\n    int Bind(const char *address) {\n        return zmq_bind(socket_, address);\n    }\n\n    int Connect(const char *address) {\n        return zmq_connect(socket_, address);\n    }\n\n    int Send(char *msg, int length, int flags, void* hint) {\n        int rc;\n        rc = zmq_msg_init_data(&z_msg, msg, length, FreeMessage, hint);\n        if (rc < 0) {\n            return rc;\n        }\n\n        rc = zmq_send(socket_, &z_msg, flags);\n        if (rc < 0) {\n            return rc;\n        }\n\n        return zmq_msg_close(&z_msg);\n    }\n\n    int Recv(int flags, zmq_msg_t* z_msg) {\n        int rc;\n        rc = zmq_msg_init(z_msg);\n        if (rc < 0) {\n            return rc;\n        }\n        return zmq_recv(socket_, z_msg, flags);\n    }\n\n    void Close() {\n        zmq_close(socket_);\n        context_->RemoveSocket(this);\n        socket_ = NULL;\n        Unref();\n    }\n\n    const char * ErrorMessage() {\n        return zmq_strerror(zmq_errno());\n    }\n\nprotected:\n    static Handle<Value>\n    New (const Arguments &args) {\n        HandleScope scope;\n        if (args.Length() != 2) {\n            return ThrowException(Exception::Error(\n                String::New(\"Must pass a context and a type to constructor\")));\n        }\n        Context *context = ObjectWrap::Unwrap<Context>(args[0]->ToObject());\n        if (!args[1]->IsNumber()) {\n            return ThrowException(Exception::TypeError(\n                String::New(\"Type must be an integer\")));\n        }\n        int type = (int) args[1]->ToInteger()->Value();\n\n        Socket *socket = new Socket(context, type);\n        socket->Wrap(args.This());\n\n        return args.This();\n    }\n\n    static Handle<Value>\n    Connect (const Arguments &args) {\n        HandleScope scope;\n        Socket *socket = getSocket(args);\n        if (!args[0]->IsString()) {\n            return ThrowException(Exception::TypeError(\n                String::New(\"Address must be a string!\")));\n        }\n\n        String::Utf8Value address(args[0]->ToString());\n        if (socket->Connect(*address)) {\n            return ThrowException(Exception::Error(\n                String::New(socket->ErrorMessage())));\n        }\n        return Undefined();\n    }\n\n    static Handle<Value>\n    Bind (const Arguments &args) {\n        HandleScope scope;\n        Socket *socket = getSocket(args);\n        if (args[0]->IsString()) {\n            return ThrowException(Exception::TypeError(\n                String::New(\"Address must be a string!\")));\n        }\n\n        String::Utf8Value address(args[0]->ToString());\n        if (!socket->Bind(*address)) {\n            return ThrowException(Exception::Error(\n                String::New(socket->ErrorMessage())));\n        }\n        return Undefined();\n    }\n\n    static Handle<Value>\n    Send (const Arguments &args) {\n        HandleScope scope;\n        Socket *socket = getSocket(args);\n        if (!args.Length() == 1) {\n            return ThrowException(Exception::TypeError(\n                String::New(\"Must pass in a string to send\")));\n        }\n\n        socket->QueueOutgoingMessage(args[0]);\n        socket->AddEvent(ZMQ_POLLOUT);\n\n        return Undefined();\n    }\n\n    static Handle<Value>\n    Close (const Arguments &args) {\n        HandleScope scope;\n\n        Socket *socket = getSocket(args);\n        socket->Close();\n        return Undefined();\n    }\n\n    Socket (Context *context, int type) : EventEmitter () {\n        socket_ = zmq_socket(context->getCContext(), type);\n        context_ = context;\n        context->AddSocket(this);\n        AddEvent(ZMQ_POLLIN | ZMQ_POLLERR);\n    }\n\n    ~Socket () {\n        assert(socket_ == NULL);\n    }\n\nprivate:\n\n    void AddEvent (int flags) {\n        events_ |= flags;\n\n        \/\/ start this if we haven't already\n        revents_ = 0;\n        eio_custom(DoPoll, EIO_PRI_DEFAULT, AfterPoll, this);\n        ev_ref(EV_DEFAULT_UC);\n    }\n\n    void RemoveEvent (int flags) {\n        events_ ^= flags; \/\/TODO: Fix.\n    }\n\n    void QueueOutgoingMessage(Local <Value> message) {\n        Persistent<Value> p_message = Persistent<Value>::New(message);\n        outgoing_.push_back(p_message);\n    }\n\n    static void FreeMessage(void *data, void *message) {\n        String::Utf8Value *js_msg = (String::Utf8Value *)message;\n        delete js_msg;\n    }\n\n    static Socket * getSocket(const Arguments &args) {\n        return ObjectWrap::Unwrap<Socket>(args.This());\n    }\n\n    static int DoPoll(eio_req *req) {\n        Socket *socket = (Socket *) req->data;\n        zmq_pollitem_t pollers[1];\n        zmq_pollitem_t *poller = &pollers[0];\n        poller->socket = socket->socket_;\n        poller->events = socket->events_;\n        zmq_poll(pollers, 1, -1);\n        socket->revents_ = poller->revents;\n        return 0;\n    }\n\n    static int AfterPoll(eio_req *req) {\n        HandleScope scope;\n\n        Socket *socket = (Socket *)req->data;\n        Local <Value> exception;\n\n        if (socket->revents_ & ZMQ_POLLIN) {\n            zmq_msg_t z_msg;\n            if (socket->Recv(0, &z_msg)) {\n                socket->Emit(error_symbol, 1, &exception);\n            }\n            Local <Value>js_msg = String::New(\n                (char *) zmq_msg_data(&z_msg),\n                zmq_msg_size(&z_msg));\n            socket->Emit(receive_symbol, 1, &js_msg);\n            zmq_msg_close(&z_msg);\n\n        }\n\n        if (socket->revents_ & ZMQ_POLLOUT && !socket->outgoing_.empty()) {\n            String::Utf8Value *message = new String::Utf8Value(socket->outgoing_.front());\n            if (socket->Send(**message, message->length(), 0, (void *) message)) {\n                exception = Exception::Error(\n                    String::New(socket->ErrorMessage()));\n                socket->Emit(receive_symbol, 1, &exception);\n            }\n\n            socket->outgoing_.front().Dispose();\n            socket->outgoing_.pop_front();\n\n            if (socket->outgoing_.empty()) {\n                socket->RemoveEvent(ZMQ_POLLOUT);\n            }\n        }\n\n        if (socket->revents_ & ZMQ_POLLERR) {\n            exception = Exception::Error(\n                String::New(socket->ErrorMessage()));\n            socket->Emit(receive_symbol, 1, &exception);\n        }\n\n        socket->revents_ = 0;\n\n        if (socket->events_) {\n            eio_custom(DoPoll, EIO_PRI_DEFAULT, AfterPoll, socket);\n        }\n        else {\n            ev_unref(EV_DEFAULT_UC);\n        }\n\n        return 0;\n    }\n\n    void *socket_;\n    Context *context_;\n    short revents_;\n    short events_;\n    ev_prepare watcher_;\n    std::list< Persistent <Value> > outgoing_;\n};\n\n}\n\nextern \"C\" void\ninit (Handle<Object> target) {\n    HandleScope scope;\n    zmq::Context::Initialize(target);\n    zmq::Socket::Initialize(target);\n}\n<commit_msg>started conversion to ev_idle<commit_after>\/*\n * Copyright (c) 2010 Justin Tulloss\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 <v8.h>\n#include <node.h>\n#include <node_events.h>\n#include <node_buffer.h>\n#include <zmq.h>\n#include <assert.h>\n#include <stdio.h>\n#include <string.h>\n#include <errno.h>\n#include <list>\n#include <unistd.h>\n\nusing namespace v8;\nusing namespace node;\n\nnamespace zmq {\n\nzmq_msg_t z_msg;\n\nstatic Persistent<String> receive_symbol;\nstatic Persistent<String> error_symbol;\nstatic Persistent<String> connect_symbol;\n\n\/\/Forward declare cause they kind of interdepend\nclass Socket;\nclass Context;\n\nclass Context : public EventEmitter {\npublic:\n    static void\n    Initialize (v8::Handle<v8::Object> target) {\n        HandleScope scope;\n\n        Local<FunctionTemplate> t = FunctionTemplate::New(New);\n\n        t->Inherit(EventEmitter::constructor_template);\n        t->InstanceTemplate()->SetInternalFieldCount(1);\n\n        NODE_SET_PROTOTYPE_METHOD(t, \"close\", Close);\n\n        target->Set(String::NewSymbol(\"Context\"), t->GetFunction());\n    }\n\n    void * getCContext() {\n        return context_;\n    }\n\n    void AddSocket(Socket *s) {\n        sockets_.push_back(s);\n        zmq_poller_.data = this;\n        ev_idle_start(EV_DEFAULT_UC_ &zmq_poller_);\n    }\n\n    void RemoveSocket(Socket *s) {\n        sockets_.remove(s);\n    }\n\n    void Close(Local<Value> exception = Local<Value>()) {\n        zmq_term(context_);\n        context_ = NULL;\n        Unref();\n    }\n\nprotected:\n    static Handle<Value>\n    New (const Arguments& args) {\n        HandleScope scope;\n\n        Context *context = new Context();\n        context->Wrap(args.This());\n\n        return args.This();\n    }\n\n    static Handle<Value>\n    Close (const Arguments& args) {\n        zmq::Context *context = ObjectWrap::Unwrap<Context>(args.This());\n        HandleScope scope;\n        context->Close();\n        return Undefined();\n    }\n\n    Context () : EventEmitter () {\n        context_ = zmq_init(1);\n        ev_idle_init(&zmq_poller_, DoPoll);\n    }\n\n    ~Context () {\n        assert(context_ == NULL);\n    }\n\nprivate:\n\n    static void DoPoll(EV_P_ ev_idle *watcher, int revents) {\n        std::list<Socket *>::iterator s;\n        assert(revents == EV_IDLE);\n\n        printf(\"Do Poll!\\n\");\n\n        Context *c = (Context *) watcher->data;\n\n        int i = -1;\n\n        zmq_pollitem_t *pollers = (zmq_pollitem_t *)\n            malloc(c->sockets_.size() * sizeof(zmq_pollitem_t));\n        if (!pollers) return;\n\n        for (s = c->sockets_.begin(); s != c->sockets_.end(); s++) {\n            i++;\n            Socket *k = *s;\n            pollers[i].socket = k->socket_;\n            pollers[i].events = k->events_;\n        }\n\n        zmq_poll(pollers, i + 1, 0); \/\/ Return instantly w\/timeout 0\n\n        i = -1;\n\n        for (s = c->sockets_.begin(); s != c->sockets_.end(); s++) {\n            i++;\n            \/\/s->AfterPoll(pollers[i]->revents);\n        }\n    }\n\n    ev_idle zmq_poller_;\n    void * context_;\n    std::list<Socket *> sockets_;\n};\n\n\nclass Socket : public EventEmitter {\nfriend class Context;\npublic:\n    static void\n    Initialize (v8::Handle<v8::Object> target) {\n        HandleScope scope;\n\n        Local<FunctionTemplate> t = FunctionTemplate::New(New);\n\n        t->Inherit(EventEmitter::constructor_template);\n        t->InstanceTemplate()->SetInternalFieldCount(1);\n\n        NODE_DEFINE_CONSTANT(t, ZMQ_PUB);\n        NODE_DEFINE_CONSTANT(t, ZMQ_SUB);\n        NODE_DEFINE_CONSTANT(t, ZMQ_REQ);\n        NODE_DEFINE_CONSTANT(t, ZMQ_REP);\n        NODE_DEFINE_CONSTANT(t, ZMQ_UPSTREAM);\n        NODE_DEFINE_CONSTANT(t, ZMQ_DOWNSTREAM);\n        NODE_DEFINE_CONSTANT(t, ZMQ_PAIR);\n\n        NODE_SET_PROTOTYPE_METHOD(t, \"bind\", Bind);\n        NODE_SET_PROTOTYPE_METHOD(t, \"connect\", Connect);\n        NODE_SET_PROTOTYPE_METHOD(t, \"send\", Send);\n        NODE_SET_PROTOTYPE_METHOD(t, \"close\", Close);\n\n        receive_symbol = NODE_PSYMBOL(\"receive\");\n        connect_symbol = NODE_PSYMBOL(\"connect\");\n        error_symbol = NODE_PSYMBOL(\"error\");\n\n        target->Set(String::NewSymbol(\"Socket\"), t->GetFunction());\n    }\n\n    int Bind(const char *address) {\n        return zmq_bind(socket_, address);\n    }\n\n    int Connect(const char *address) {\n        return zmq_connect(socket_, address);\n    }\n\n    int Send(char *msg, int length, int flags, void* hint) {\n        int rc;\n        rc = zmq_msg_init_data(&z_msg, msg, length, FreeMessage, hint);\n        if (rc < 0) {\n            return rc;\n        }\n\n        rc = zmq_send(socket_, &z_msg, flags);\n        if (rc < 0) {\n            return rc;\n        }\n\n        return zmq_msg_close(&z_msg);\n    }\n\n    int Recv(int flags, zmq_msg_t* z_msg) {\n        int rc;\n        rc = zmq_msg_init(z_msg);\n        if (rc < 0) {\n            return rc;\n        }\n        return zmq_recv(socket_, z_msg, flags);\n    }\n\n    void Close() {\n        zmq_close(socket_);\n        context_->RemoveSocket(this);\n        socket_ = NULL;\n        Unref();\n    }\n\n    const char * ErrorMessage() {\n        return zmq_strerror(zmq_errno());\n    }\n\nprotected:\n    static Handle<Value>\n    New (const Arguments &args) {\n        HandleScope scope;\n        if (args.Length() != 2) {\n            return ThrowException(Exception::Error(\n                String::New(\"Must pass a context and a type to constructor\")));\n        }\n        Context *context = ObjectWrap::Unwrap<Context>(args[0]->ToObject());\n        if (!args[1]->IsNumber()) {\n            return ThrowException(Exception::TypeError(\n                String::New(\"Type must be an integer\")));\n        }\n        int type = (int) args[1]->ToInteger()->Value();\n\n        Socket *socket = new Socket(context, type);\n        socket->Wrap(args.This());\n\n        return args.This();\n    }\n\n    static Handle<Value>\n    Connect (const Arguments &args) {\n        HandleScope scope;\n        Socket *socket = getSocket(args);\n        if (!args[0]->IsString()) {\n            return ThrowException(Exception::TypeError(\n                String::New(\"Address must be a string!\")));\n        }\n\n        String::Utf8Value address(args[0]->ToString());\n        if (socket->Connect(*address)) {\n            return ThrowException(Exception::Error(\n                String::New(socket->ErrorMessage())));\n        }\n        return Undefined();\n    }\n\n    static Handle<Value>\n    Bind (const Arguments &args) {\n        HandleScope scope;\n        Socket *socket = getSocket(args);\n        if (args[0]->IsString()) {\n            return ThrowException(Exception::TypeError(\n                String::New(\"Address must be a string!\")));\n        }\n\n        String::Utf8Value address(args[0]->ToString());\n        if (!socket->Bind(*address)) {\n            return ThrowException(Exception::Error(\n                String::New(socket->ErrorMessage())));\n        }\n        return Undefined();\n    }\n\n    static Handle<Value>\n    Send (const Arguments &args) {\n        HandleScope scope;\n        Socket *socket = getSocket(args);\n        if (!args.Length() == 1) {\n            return ThrowException(Exception::TypeError(\n                String::New(\"Must pass in a string to send\")));\n        }\n\n        socket->QueueOutgoingMessage(args[0]);\n\n        return Undefined();\n    }\n\n    static Handle<Value>\n    Close (const Arguments &args) {\n        HandleScope scope;\n\n        Socket *socket = getSocket(args);\n        socket->Close();\n        return Undefined();\n    }\n\n    Socket (Context *context, int type) : EventEmitter () {\n        socket_ = zmq_socket(context->getCContext(), type);\n        context_ = context;\n    }\n\n    ~Socket () {\n        assert(socket_ == NULL);\n    }\n\nprivate:\n\n    void QueueOutgoingMessage(Local <Value> message) {\n        Persistent<Value> p_message = Persistent<Value>::New(message);\n        events_ |= ZMQ_POLLOUT;\n        context_->AddSocket(this);\n        outgoing_.push_back(p_message);\n    }\n\n    static void FreeMessage(void *data, void *message) {\n        String::Utf8Value *js_msg = (String::Utf8Value *)message;\n        delete js_msg;\n    }\n\n    static Socket * getSocket(const Arguments &args) {\n        return ObjectWrap::Unwrap<Socket>(args.This());\n    }\n\n    int AfterPoll(int revents) {\n        HandleScope scope;\n\n        printf(\"got events: %x!\\n\", revents);\n\n        Local <Value> exception;\n\n        if (revents & ZMQ_POLLIN) {\n            zmq_msg_t z_msg;\n            if (Recv(0, &z_msg)) {\n                Emit(error_symbol, 1, &exception);\n            }\n            Local <Value>js_msg = String::New(\n                (char *) zmq_msg_data(&z_msg),\n                zmq_msg_size(&z_msg));\n            Emit(receive_symbol, 1, &js_msg);\n            zmq_msg_close(&z_msg);\n\n        }\n\n        if (revents & ZMQ_POLLOUT && !outgoing_.empty()) {\n            String::Utf8Value *message = new String::Utf8Value(outgoing_.front());\n            if (Send(**message, message->length(), 0, (void *) message)) {\n                exception = Exception::Error(\n                    String::New(ErrorMessage()));\n                Emit(receive_symbol, 1, &exception);\n            }\n\n            outgoing_.front().Dispose();\n            outgoing_.pop_front();\n\n            if (outgoing_.empty()) {\n                printf(\"removing socket\\n\");\n                context_->RemoveSocket(this);\n            }\n        }\n\n        return 0;\n    }\n\n    void *socket_;\n    Context *context_;\n    short events_;\n    std::list< Persistent <Value> > outgoing_;\n};\n\n}\n\nextern \"C\" void\ninit (Handle<Object> target) {\n    HandleScope scope;\n    zmq::Context::Initialize(target);\n    zmq::Socket::Initialize(target);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (c) 2010 Justin Tulloss\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 \"zeromq.h\"\n\nnamespace zmq {\n\nstatic Persistent<String> receive_symbol;\nstatic Persistent<String> error_symbol;\nstatic Persistent<String> connect_symbol;\n\nvoid\nContext::Initialize (v8::Handle<v8::Object> target) {\n    HandleScope scope;\n\n    Local<FunctionTemplate> t = FunctionTemplate::New(New);\n\n    t->Inherit(EventEmitter::constructor_template);\n    t->InstanceTemplate()->SetInternalFieldCount(1);\n\n    NODE_SET_PROTOTYPE_METHOD(t, \"close\", Close);\n\n    target->Set(String::NewSymbol(\"Context\"), t->GetFunction());\n}\n\nvoid *\nContext::getCContext() {\n    return context_;\n}\n\nvoid\nContext::AddSocket(Socket *s) {\n    sockets_.push_back(s);\n    zmq_poller_.data = this;\n    ev_idle_start(EV_DEFAULT_UC_ &zmq_poller_);\n}\n\nvoid\nContext::RemoveSocket(Socket *s) {\n    sockets_.remove(s);\n    if (sockets_.empty()) {\n        ev_idle_stop(EV_DEFAULT_UC_ &zmq_poller_);\n    }\n}\n\nvoid\nContext::Close() {\n    zmq_term(context_);\n    context_ = NULL;\n    Unref();\n}\n\nHandle<Value>\nContext::New (const Arguments& args) {\n    HandleScope scope;\n\n    Context *context = new Context();\n    context->Wrap(args.This());\n\n    return args.This();\n}\n\nHandle<Value>\nContext::Close (const Arguments& args) {\n    zmq::Context *context = ObjectWrap::Unwrap<Context>(args.This());\n    HandleScope scope;\n    context->Close();\n    return Undefined();\n}\n\nContext::Context () : EventEmitter () {\n    context_ = zmq_init(1);\n    ev_idle_init(&zmq_poller_, DoPoll);\n}\n\nContext::~Context () {\n    assert(context_ == NULL);\n}\n\nvoid\nContext::DoPoll(EV_P_ ev_idle *watcher, int revents) {\n    std::list<Socket *>::iterator s;\n    assert(revents == EV_IDLE);\n\n    Context *c = (Context *) watcher->data;\n\n    int i = -1;\n\n    zmq_pollitem_t *pollers = (zmq_pollitem_t *)\n        malloc(c->sockets_.size() * sizeof(zmq_pollitem_t));\n    if (!pollers) return;\n\n    for (s = c->sockets_.begin(); s != c->sockets_.end(); s++) {\n        i++;\n        pollers[i].socket = (*s)->socket_;\n        pollers[i].events = (*s)->events_;\n    }\n\n    zmq_poll(pollers, i + 1, 0); \/\/ Return instantly w\/timeout 0\n\n    i = -1;\n\n    for (s = c->sockets_.begin(); s != c->sockets_.end(); s++) {\n        i++;\n        (*s)->AfterPoll(pollers[i].revents);\n    }\n}\n\n\nvoid\nSocket::Initialize (v8::Handle<v8::Object> target) {\n    HandleScope scope;\n\n    Local<FunctionTemplate> t = FunctionTemplate::New(New);\n\n    t->Inherit(EventEmitter::constructor_template);\n    t->InstanceTemplate()->SetInternalFieldCount(1);\n\n    NODE_DEFINE_CONSTANT(t, ZMQ_PUB);\n    NODE_DEFINE_CONSTANT(t, ZMQ_SUB);\n    NODE_DEFINE_CONSTANT(t, ZMQ_REQ);\n    NODE_DEFINE_CONSTANT(t, ZMQ_REP);\n    NODE_DEFINE_CONSTANT(t, ZMQ_UPSTREAM);\n    NODE_DEFINE_CONSTANT(t, ZMQ_DOWNSTREAM);\n    NODE_DEFINE_CONSTANT(t, ZMQ_PAIR);\n\n    NODE_SET_PROTOTYPE_METHOD(t, \"bind\", Bind);\n    NODE_SET_PROTOTYPE_METHOD(t, \"connect\", Connect);\n    NODE_SET_PROTOTYPE_METHOD(t, \"send\", Send);\n    NODE_SET_PROTOTYPE_METHOD(t, \"close\", Close);\n\n    receive_symbol = NODE_PSYMBOL(\"receive\");\n    connect_symbol = NODE_PSYMBOL(\"connect\");\n    error_symbol = NODE_PSYMBOL(\"error\");\n\n    target->Set(String::NewSymbol(\"Socket\"), t->GetFunction());\n}\n\nint\nSocket::Bind(const char *address) {\n    return zmq_bind(socket_, address);\n}\n\nint\nSocket::Connect(const char *address) {\n    return zmq_connect(socket_, address);\n}\n\nint\nSocket::Send(char *msg, int length, int flags, void* hint) {\n    int rc;\n    zmq_msg_t z_msg;\n    rc = zmq_msg_init_data(&z_msg, msg, length, FreeMessage, hint);\n    if (rc < 0) {\n        return rc;\n    }\n\n    rc = zmq_send(socket_, &z_msg, flags);\n    if (rc < 0) {\n        return rc;\n    }\n\n    return zmq_msg_close(&z_msg);\n}\n\nint\nSocket::Recv(int flags, zmq_msg_t* z_msg) {\n    int rc;\n    rc = zmq_msg_init(z_msg);\n    if (rc < 0) {\n        return rc;\n    }\n    return zmq_recv(socket_, z_msg, flags);\n}\n\nvoid\nSocket::Close() {\n    zmq_close(socket_);\n    context_->RemoveSocket(this);\n    socket_ = NULL;\n    Unref();\n}\n\nconst char *\nSocket::ErrorMessage() {\n    return zmq_strerror(zmq_errno());\n}\n\nHandle<Value>\nSocket::New (const Arguments &args) {\n    HandleScope scope;\n    if (args.Length() != 2) {\n        return ThrowException(Exception::Error(\n            String::New(\"Must pass a context and a type to constructor\")));\n    }\n    Context *context = ObjectWrap::Unwrap<Context>(args[0]->ToObject());\n    if (!args[1]->IsNumber()) {\n        return ThrowException(Exception::TypeError(\n            String::New(\"Type must be an integer\")));\n    }\n    int type = (int) args[1]->ToInteger()->Value();\n\n    Socket *socket = new Socket(context, type);\n    socket->Wrap(args.This());\n\n    return args.This();\n}\n\nHandle<Value>\nSocket::Connect (const Arguments &args) {\n    HandleScope scope;\n    Socket *socket = getSocket(args);\n    if (!args[0]->IsString()) {\n        return ThrowException(Exception::TypeError(\n            String::New(\"Address must be a string!\")));\n    }\n\n    String::Utf8Value address(args[0]->ToString());\n    if (socket->Connect(*address)) {\n        return ThrowException(Exception::Error(\n            String::New(socket->ErrorMessage())));\n    }\n    return Undefined();\n}\n\nHandle<Value>\nSocket::Bind (const Arguments &args) {\n    HandleScope scope;\n    Socket *socket = getSocket(args);\n    if (args[0]->IsString()) {\n        return ThrowException(Exception::TypeError(\n            String::New(\"Address must be a string!\")));\n    }\n\n    String::Utf8Value address(args[0]->ToString());\n    if (!socket->Bind(*address)) {\n        return ThrowException(Exception::Error(\n            String::New(socket->ErrorMessage())));\n    }\n    return Undefined();\n}\n\nHandle<Value>\nSocket::Send (const Arguments &args) {\n    HandleScope scope;\n    Socket *socket = getSocket(args);\n    if (!args.Length() == 1) {\n        return ThrowException(Exception::TypeError(\n            String::New(\"Must pass in a string to send\")));\n    }\n\n    socket->QueueOutgoingMessage(args[0]);\n\n    return Undefined();\n}\n\nHandle<Value>\nSocket::Close (const Arguments &args) {\n    HandleScope scope;\n\n    Socket *socket = getSocket(args);\n    socket->Close();\n    return Undefined();\n}\n\nSocket::Socket (Context *context, int type) : EventEmitter () {\n    socket_ = zmq_socket(context->getCContext(), type);\n    events_ = ZMQ_POLLIN;\n    context_ = context;\n    context_->AddSocket(this);\n}\n\nSocket::~Socket () {\n    assert(socket_ == NULL);\n}\n\nvoid\nSocket::QueueOutgoingMessage(Local <Value> message) {\n    Persistent<Value> p_message = Persistent<Value>::New(message);\n    events_ |= ZMQ_POLLOUT;\n    outgoing_.push_back(p_message);\n}\n\nvoid\nSocket::FreeMessage(void *data, void *message) {\n    String::Utf8Value *js_msg = (String::Utf8Value *)message;\n    delete js_msg;\n}\n\nSocket *\nSocket::getSocket(const Arguments &args) {\n    return ObjectWrap::Unwrap<Socket>(args.This());\n}\n\nint\nSocket::AfterPoll(int revents) {\n    HandleScope scope;\n\n    Local <Value> exception;\n\n    if (revents & ZMQ_POLLIN) {\n        zmq_msg_t z_msg;\n        if (Recv(0, &z_msg)) {\n            Emit(error_symbol, 1, &exception);\n        }\n        Local <Value>js_msg = String::New(\n            (char *) zmq_msg_data(&z_msg),\n            zmq_msg_size(&z_msg));\n        Emit(receive_symbol, 1, &js_msg);\n        zmq_msg_close(&z_msg);\n\n    }\n\n    if (revents & ZMQ_POLLOUT && !outgoing_.empty()) {\n        String::Utf8Value *message = new String::Utf8Value(outgoing_.front());\n        if (Send(**message, message->length(), 0, (void *) message)) {\n            exception = Exception::Error(\n                String::New(ErrorMessage()));\n            Emit(receive_symbol, 1, &exception);\n        }\n\n        outgoing_.front().Dispose();\n        outgoing_.pop_front();\n    }\n\n    return 0;\n}\n\n}\n\nextern \"C\" void\ninit (Handle<Object> target) {\n    HandleScope scope;\n    zmq::Context::Initialize(target);\n    zmq::Socket::Initialize(target);\n}\n<commit_msg>fix bind, thanks to jfd@cd16113b613cbe511280<commit_after>\/*\n * Copyright (c) 2010 Justin Tulloss\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 \"zeromq.h\"\n\nnamespace zmq {\n\nstatic Persistent<String> receive_symbol;\nstatic Persistent<String> error_symbol;\nstatic Persistent<String> connect_symbol;\n\nvoid\nContext::Initialize (v8::Handle<v8::Object> target) {\n    HandleScope scope;\n\n    Local<FunctionTemplate> t = FunctionTemplate::New(New);\n\n    t->Inherit(EventEmitter::constructor_template);\n    t->InstanceTemplate()->SetInternalFieldCount(1);\n\n    NODE_SET_PROTOTYPE_METHOD(t, \"close\", Close);\n\n    target->Set(String::NewSymbol(\"Context\"), t->GetFunction());\n}\n\nvoid *\nContext::getCContext() {\n    return context_;\n}\n\nvoid\nContext::AddSocket(Socket *s) {\n    sockets_.push_back(s);\n    zmq_poller_.data = this;\n    ev_idle_start(EV_DEFAULT_UC_ &zmq_poller_);\n}\n\nvoid\nContext::RemoveSocket(Socket *s) {\n    sockets_.remove(s);\n    if (sockets_.empty()) {\n        ev_idle_stop(EV_DEFAULT_UC_ &zmq_poller_);\n    }\n}\n\nvoid\nContext::Close() {\n    zmq_term(context_);\n    context_ = NULL;\n    Unref();\n}\n\nHandle<Value>\nContext::New (const Arguments& args) {\n    HandleScope scope;\n\n    Context *context = new Context();\n    context->Wrap(args.This());\n\n    return args.This();\n}\n\nHandle<Value>\nContext::Close (const Arguments& args) {\n    zmq::Context *context = ObjectWrap::Unwrap<Context>(args.This());\n    HandleScope scope;\n    context->Close();\n    return Undefined();\n}\n\nContext::Context () : EventEmitter () {\n    context_ = zmq_init(1);\n    ev_idle_init(&zmq_poller_, DoPoll);\n}\n\nContext::~Context () {\n    assert(context_ == NULL);\n}\n\nvoid\nContext::DoPoll(EV_P_ ev_idle *watcher, int revents) {\n    std::list<Socket *>::iterator s;\n    assert(revents == EV_IDLE);\n\n    Context *c = (Context *) watcher->data;\n\n    int i = -1;\n\n    zmq_pollitem_t *pollers = (zmq_pollitem_t *)\n        malloc(c->sockets_.size() * sizeof(zmq_pollitem_t));\n    if (!pollers) return;\n\n    for (s = c->sockets_.begin(); s != c->sockets_.end(); s++) {\n        i++;\n        pollers[i].socket = (*s)->socket_;\n        pollers[i].events = (*s)->events_;\n    }\n\n    zmq_poll(pollers, i + 1, 0); \/\/ Return instantly w\/timeout 0\n\n    i = -1;\n\n    for (s = c->sockets_.begin(); s != c->sockets_.end(); s++) {\n        i++;\n        (*s)->AfterPoll(pollers[i].revents);\n    }\n}\n\n\nvoid\nSocket::Initialize (v8::Handle<v8::Object> target) {\n    HandleScope scope;\n\n    Local<FunctionTemplate> t = FunctionTemplate::New(New);\n\n    t->Inherit(EventEmitter::constructor_template);\n    t->InstanceTemplate()->SetInternalFieldCount(1);\n\n    NODE_DEFINE_CONSTANT(t, ZMQ_PUB);\n    NODE_DEFINE_CONSTANT(t, ZMQ_SUB);\n    NODE_DEFINE_CONSTANT(t, ZMQ_REQ);\n    NODE_DEFINE_CONSTANT(t, ZMQ_REP);\n    NODE_DEFINE_CONSTANT(t, ZMQ_UPSTREAM);\n    NODE_DEFINE_CONSTANT(t, ZMQ_DOWNSTREAM);\n    NODE_DEFINE_CONSTANT(t, ZMQ_PAIR);\n\n    NODE_SET_PROTOTYPE_METHOD(t, \"bind\", Bind);\n    NODE_SET_PROTOTYPE_METHOD(t, \"connect\", Connect);\n    NODE_SET_PROTOTYPE_METHOD(t, \"send\", Send);\n    NODE_SET_PROTOTYPE_METHOD(t, \"close\", Close);\n\n    receive_symbol = NODE_PSYMBOL(\"receive\");\n    connect_symbol = NODE_PSYMBOL(\"connect\");\n    error_symbol = NODE_PSYMBOL(\"error\");\n\n    target->Set(String::NewSymbol(\"Socket\"), t->GetFunction());\n}\n\nint\nSocket::Bind(const char *address) {\n    return zmq_bind(socket_, address);\n}\n\nint\nSocket::Connect(const char *address) {\n    return zmq_connect(socket_, address);\n}\n\nint\nSocket::Send(char *msg, int length, int flags, void* hint) {\n    int rc;\n    zmq_msg_t z_msg;\n    rc = zmq_msg_init_data(&z_msg, msg, length, FreeMessage, hint);\n    if (rc < 0) {\n        return rc;\n    }\n\n    rc = zmq_send(socket_, &z_msg, flags);\n    if (rc < 0) {\n        return rc;\n    }\n\n    return zmq_msg_close(&z_msg);\n}\n\nint\nSocket::Recv(int flags, zmq_msg_t* z_msg) {\n    int rc;\n    rc = zmq_msg_init(z_msg);\n    if (rc < 0) {\n        return rc;\n    }\n    return zmq_recv(socket_, z_msg, flags);\n}\n\nvoid\nSocket::Close() {\n    zmq_close(socket_);\n    context_->RemoveSocket(this);\n    socket_ = NULL;\n    Unref();\n}\n\nconst char *\nSocket::ErrorMessage() {\n    return zmq_strerror(zmq_errno());\n}\n\nHandle<Value>\nSocket::New (const Arguments &args) {\n    HandleScope scope;\n    if (args.Length() != 2) {\n        return ThrowException(Exception::Error(\n            String::New(\"Must pass a context and a type to constructor\")));\n    }\n    Context *context = ObjectWrap::Unwrap<Context>(args[0]->ToObject());\n    if (!args[1]->IsNumber()) {\n        return ThrowException(Exception::TypeError(\n            String::New(\"Type must be an integer\")));\n    }\n    int type = (int) args[1]->ToInteger()->Value();\n\n    Socket *socket = new Socket(context, type);\n    socket->Wrap(args.This());\n\n    return args.This();\n}\n\nHandle<Value>\nSocket::Connect (const Arguments &args) {\n    HandleScope scope;\n    Socket *socket = getSocket(args);\n    if (!args[0]->IsString()) {\n        return ThrowException(Exception::TypeError(\n            String::New(\"Address must be a string!\")));\n    }\n\n    String::Utf8Value address(args[0]->ToString());\n    if (socket->Connect(*address)) {\n        return ThrowException(Exception::Error(\n            String::New(socket->ErrorMessage())));\n    }\n    return Undefined();\n}\n\nHandle<Value>\nSocket::Bind (const Arguments &args) {\n    HandleScope scope;\n    Socket *socket = getSocket(args);\n    if (!args[0]->IsString()) {\n        return ThrowException(Exception::TypeError(\n            String::New(\"Address must be a string!\")));\n    }\n\n    String::Utf8Value address(args[0]->ToString());\n    if (socket->Bind(*address)) {\n        return ThrowException(Exception::Error(\n            String::New(socket->ErrorMessage())));\n    }\n    return Undefined();\n}\n\nHandle<Value>\nSocket::Send (const Arguments &args) {\n    HandleScope scope;\n    Socket *socket = getSocket(args);\n    if (!args.Length() == 1) {\n        return ThrowException(Exception::TypeError(\n            String::New(\"Must pass in a string to send\")));\n    }\n\n    socket->QueueOutgoingMessage(args[0]);\n\n    return Undefined();\n}\n\nHandle<Value>\nSocket::Close (const Arguments &args) {\n    HandleScope scope;\n\n    Socket *socket = getSocket(args);\n    socket->Close();\n    return Undefined();\n}\n\nSocket::Socket (Context *context, int type) : EventEmitter () {\n    socket_ = zmq_socket(context->getCContext(), type);\n    events_ = ZMQ_POLLIN;\n    context_ = context;\n    context_->AddSocket(this);\n}\n\nSocket::~Socket () {\n    assert(socket_ == NULL);\n}\n\nvoid\nSocket::QueueOutgoingMessage(Local <Value> message) {\n    Persistent<Value> p_message = Persistent<Value>::New(message);\n    events_ |= ZMQ_POLLOUT;\n    outgoing_.push_back(p_message);\n}\n\nvoid\nSocket::FreeMessage(void *data, void *message) {\n    String::Utf8Value *js_msg = (String::Utf8Value *)message;\n    delete js_msg;\n}\n\nSocket *\nSocket::getSocket(const Arguments &args) {\n    return ObjectWrap::Unwrap<Socket>(args.This());\n}\n\nint\nSocket::AfterPoll(int revents) {\n    HandleScope scope;\n\n    Local <Value> exception;\n\n    if (revents & ZMQ_POLLIN) {\n        zmq_msg_t z_msg;\n        if (Recv(0, &z_msg)) {\n            Emit(error_symbol, 1, &exception);\n        }\n        Local <Value>js_msg = String::New(\n            (char *) zmq_msg_data(&z_msg),\n            zmq_msg_size(&z_msg));\n        Emit(receive_symbol, 1, &js_msg);\n        zmq_msg_close(&z_msg);\n\n    }\n\n    if (revents & ZMQ_POLLOUT && !outgoing_.empty()) {\n        String::Utf8Value *message = new String::Utf8Value(outgoing_.front());\n        if (Send(**message, message->length(), 0, (void *) message)) {\n            exception = Exception::Error(\n                String::New(ErrorMessage()));\n            Emit(receive_symbol, 1, &exception);\n        }\n\n        outgoing_.front().Dispose();\n        outgoing_.pop_front();\n    }\n\n    return 0;\n}\n\n}\n\nextern \"C\" void\ninit (Handle<Object> target) {\n    HandleScope scope;\n    zmq::Context::Initialize(target);\n    zmq::Socket::Initialize(target);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ a quick sample testing the physics code \n\/\/ create some boxes, let them drop.\n\/\/ SPACE key starts the simulation.\n\/\/ \n\/\/ \n\n#include <stdlib.h>\n#include <iostream>\n#include <algorithm>\n#include <cctype>  \/\/ std::tolower\n#include <cstdarg>   \/\/ For va_list, va_start, ...\n#include <cstdio>    \/\/ For vsnprintf\n#include <vector>\n\n\/\/ in project properties, add \"..\/include\" to the vc++ directories include path\n#include \"vecmatquat.h\"   \n#include \"glwin.h\"  \/\/ minimal opengl for windows setup wrapper\n#include \"hull.h\"\n#include \"gjk.h\"\n#include \"wingmesh.h\"\n#include \"physics.h\"\n\nvoid glNormal3fv(const float3 &v) { glNormal3fv(&v.x); }\nvoid glVertex3fv(const float3 &v) { glVertex3fv(&v.x); }\nvoid glColor3fv (const float3 &v) { glColor3fv(&v.x);  }\nvoid glMultMatrix(const float4x4 &m) { glMultMatrixf(&m.x.x); }\n\nfloat g_pitch, g_yaw;\nint g_mouseX, g_mouseY;\nbool g_simulate = 0;\n\ninline float randf(){ return static_cast<float>(rand()) \/ static_cast<float>(RAND_MAX); }\n\nfloat3 vrand(){ return {randf(),randf(),randf()}; }\n\n\nvoid InitTex()  \/\/ create a checkerboard texture \n{\n\tconst int imagedim = 16;\n\tubyte3 checker_image[imagedim * imagedim];\n\tfor (int y = 0; y < imagedim; y++) for (int x = 0; x < imagedim; x++)\n\t\tchecker_image[y * imagedim + x] = ((x\/4 + y\/4) % 2) ? ubyte3(191, 255, 255) : ubyte3(63, 127, 127);\n\tglPixelStorei(GL_UNPACK_ALIGNMENT, 1); \n\tglEnable(GL_TEXTURE_2D); glBindTexture(GL_TEXTURE_2D, 0);\n\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT);     glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT);\n\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR); glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\n\tglTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA, imagedim, imagedim, 0, GL_RGB, GL_UNSIGNED_BYTE, checker_image);\n}\n\nvoid gldraw(const std::vector<float3> &verts, const std::vector<int3> &tris)\n{\n\tglBegin(GL_TRIANGLES);\n\tglColor4f(1, 1, 1, 0.25f);\n\tfor (auto t : tris)\n\t{\n\t\tauto n = TriNormal(verts[t[0]], verts[t[1]], verts[t[2]]);\n\t\tglNormal3fv(n); auto vn = vabs(n);\n\t\tint k = argmax(&vn.x, 3);\n\t\tfor (int j = 0; j < 3; j++)\n\t\t{\n\t\t\tconst auto &v = verts[t[j]];\n\t\t\tglTexCoord2f(v[(k + 1) % 3], v[(k + 2) % 3]);\n\t\t\tglVertex3fv(v);\n\t\t}\n\t}\n\tglEnd();\n}\nvoid wmwire(const WingMesh &m)\n{\n\tglBegin(GL_LINES);\n\tfor (auto e : m.edges)\n\t{\n\t\tglVertex3fv(m.verts[e.v]);\n\t\tglVertex3fv(m.verts[m.edges[e.next].v]);\n\t}\n\tglEnd();\n}\nvoid wmdraw(const WingMesh &m)\n{\n\tauto tris = WingMeshTris(m);\n\tgldraw(m.verts, tris);\n}\n\nvoid rbdraw(const RigidBody *rb,int wireframe)\n{\n\tglPushMatrix();\n\tglMultMatrix(MatrixFromRotationTranslation(rb->orientation, rb->position));\n\tfor (const auto &s :rb->shapes)\n\t\t((wireframe)?wmwire:wmdraw)(s->local_geometry);\n\tglPopMatrix();\n}\n\n\ntemplate<class T> std::vector<T> ArrayOfOne(T t){ std::vector<T> a; a.push_back(t); return a; }\n\n\/\/ int main(int argc, char *argv[])\nint APIENTRY WinMain(HINSTANCE hCurrentInst, HINSTANCE hPreviousInst,\nLPSTR lpszCmdLine, int nCmdShow)\n{\n\tstd::cout << \"Test Physics\\n\";\n\n\textern std::vector<RigidBody*> g_rigidbodies;\n\tauto wma = WingMeshCube({ -1, -1, -1 }, { 1, 1, 1 });\n\tauto wmb = WingMeshCube({ -1, -1, -1 }, { 1, 1, 1 });\n\tauto rba = new RigidBody(ArrayOfOne(wma), {  1.5f, 0.0f, 1.5f });\n\tauto rbb = new RigidBody(ArrayOfOne(wmb), { -1.5f, 0.0f, 1.5f });\n\trbb->orientation = normalize(float4(0.1f, 0.01f, 0.3f, 1.0f));\n\tfor (float z = 5.5f; z < 14.0f; z += 3.0f)\n\t\tnew RigidBody(ArrayOfOne(WingMeshCube({ -0.5f, -0.5f, -0.5f }, { 0.5f, 0.5f, 0.5f })), { 0.0f, 0.0f, z });\n\tfor (float z = 15.0f; z < 20.0f; z += 3.0f)\n\t\tnew RigidBody(ArrayOfOne(WingMeshDual( WingMeshCube({ -0.5f, -0.5f, -0.5f }, { 0.5f, 0.5f, 0.5f }),0.65f)), { 2.0f, -1.0f,  z }) ;\n\n\tstd::vector<WingMesh*> world_geometry;\n\tWingMesh world_slab = WingMeshCube({ -10, -10, -5 }, { 10, 10, -2 });\n\tworld_geometry.push_back(&world_slab);\n\n\n\n\tGLWin glwin(\"TestPhys sample\");\n\n\tglwin.keyboardfunc = [&](unsigned char key, int x, int y)->void \n\t{\n\t\t\tswitch (std::tolower(key))\n\t\t\t{\n\t\t\tcase ' ':\n\t\t\t\tg_simulate = !g_simulate;\n\t\t\t\tbreak;\n\t\t\tcase 'q': case 27:   \/\/ ESC\n\t\t\t\texit(0); break;  \n\t\t\tcase 'r':\n\t\t\t\tfor (auto &rb : g_rigidbodies)\n\t\t\t\t{\n\t\t\t\t\trb->position = rb->position_start;\n\t\t\t\t\t\/\/rb->orientation = rb->orientation_start;  \/\/ when commented out this provides some variation\n\t\t\t\t\trb->momentum = float3(0, 0, 0);\n\t\t\t\t\trb->rotation = float3(0, 0, 0);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tstd::cout << \"unassigned key (\" << (int)key << \"): '\" << key << \"'\\n\";\n\t\t\t\tbreak;\n\t\t\t}\n\t};\n\n\tInitTex();\n\n\twhile (glwin.WindowUp())\n\t{\n\t\tif (glwin.MouseState)  \/\/ on mouse drag \n\t\t{\n\t\t\tg_yaw   += (glwin.MouseX - g_mouseX) * 0.3f;  \/\/ poor man's trackball\n\t\t\tg_pitch += (glwin.MouseY - g_mouseY) * 0.3f;\n\t\t}\n\t\tg_mouseX = glwin.MouseX;\n\t\tg_mouseY = glwin.MouseY;\n\n\t\textern void PhysicsUpdate(const std::vector<WingMesh*> &wgeom);\n\t\tif(g_simulate)\n\t\t\tPhysicsUpdate(world_geometry);\n\n\n\t\tglPushAttrib(GL_ALL_ATTRIB_BITS);\n\t\tglViewport(0, 0, glwin.Width,glwin.Height);  \/\/ Set up the viewport\n\t\tglClearColor(0.1f, 0.1f, 0.15f, 1);\n\t\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\t\tglEnable(GL_DEPTH_TEST);\n\n\t\t\/\/ Set up matrices\n\t\tglMatrixMode(GL_PROJECTION);\n\t\tglPushMatrix();\n\t\tglLoadIdentity();\n\t\tgluPerspective(60, (double)glwin.Width\/ glwin.Height, 0.01, 50);\n\n\t\tglMatrixMode(GL_MODELVIEW);\n\t\tglPushMatrix();\n\t\tgluLookAt(0, -8, 5, 0, 0, 0, 0, 0, 1);\n\t\tglRotatef(g_pitch, 1, 0, 0);\n\t\tglRotatef(g_yaw, 0, 0, 1);\n\n\t\t\/\/ wireframe pass:\n\t\tglColor3f(0, 1, 0.5f);\n\t\trbdraw(rba,1);\n\t\tglColor3f(0, 0.5f, 1.0f);\n\t\trbdraw(rbb, 1);  \/\/ wireframe\n\t\tglColor3f(0, 0.5f, 0.5f);\n\t\tfor (unsigned int i = 2; i < g_rigidbodies.size(); i++)\n\t\t\trbdraw(g_rigidbodies[i], 1);  \/\/ wireframe\n\n\t\tfor (auto &wm : world_geometry)\n\t\t\twmdraw(*wm);\n\n\t\tglEnable(GL_POLYGON_OFFSET_FILL);\n\t\tglPolygonOffset(1., 1. \/ (float)0x10000);\n\t\tglEnable(GL_LIGHTING);\n\t\tglEnable(GL_LIGHT0);\n\t\tglEnable(GL_TEXTURE_2D);\n\t\tglColor3f(0.5f, 0.5f, 0.5f);\n\t\tfor (auto &rb : g_rigidbodies)\n\t\t\trbdraw(rb, 0);\n\n\t\t\/\/ Restore state\n\t\tglPopMatrix();  \/\/should be currently in modelview mode\n\t\tglMatrixMode(GL_PROJECTION);\n\t\tglPopMatrix();\n\t\tglPopAttrib();\n\t\tglMatrixMode(GL_MODELVIEW);  \n\n\t\tglwin.PrintString(\"ESC\/q quits. SPACE to simulate. r to restart\", 5, 0);\n\t\tchar buf[256];\n\t\tsprintf_s(buf, \"simulation %s\", (g_simulate)?\"ON\":\"OFF\");\n\t\tglwin.PrintString(buf, 5, 1);\n\n\t\tglwin.SwapBuffers();\n\t}\n\n\tstd::cout << \"\\n\";\n\treturn 0;\n}\n\n<commit_msg>added a seesaw to test linear and angular constraints<commit_after>\/\/\n\/\/ a quick sample testing the physics code \n\/\/ create some boxes, let them drop.\n\/\/ SPACE key starts the simulation.\n\/\/ \n\/\/ \n\n#include <stdlib.h>\n#include <iostream>\n#include <algorithm>\n#include <cctype>  \/\/ std::tolower\n#include <cstdarg>   \/\/ For va_list, va_start, ...\n#include <cstdio>    \/\/ For vsnprintf\n#include <vector>\n\n\/\/ in project properties, add \"..\/include\" to the vc++ directories include path\n#include \"vecmatquat.h\"   \n#include \"glwin.h\"  \/\/ minimal opengl for windows setup wrapper\n#include \"hull.h\"\n#include \"gjk.h\"\n#include \"wingmesh.h\"\n#include \"physics.h\"\n\nvoid glNormal3fv(const float3 &v) { glNormal3fv(&v.x); }\nvoid glVertex3fv(const float3 &v) { glVertex3fv(&v.x); }\nvoid glColor3fv (const float3 &v) { glColor3fv(&v.x);  }\nvoid glMultMatrix(const float4x4 &m) { glMultMatrixf(&m.x.x); }\n\nfloat g_pitch, g_yaw;\nint g_mouseX, g_mouseY;\nbool g_simulate = 0;\n\ninline float randf(){ return static_cast<float>(rand()) \/ static_cast<float>(RAND_MAX); }\n\nfloat3 vrand(){ return {randf(),randf(),randf()}; }\n\n\nvoid InitTex()  \/\/ create a checkerboard texture \n{\n\tconst int imagedim = 16;\n\tubyte3 checker_image[imagedim * imagedim];\n\tfor (int y = 0; y < imagedim; y++) for (int x = 0; x < imagedim; x++)\n\t\tchecker_image[y * imagedim + x] = ((x\/4 + y\/4) % 2) ? ubyte3(191, 255, 255) : ubyte3(63, 127, 127);\n\tglPixelStorei(GL_UNPACK_ALIGNMENT, 1); \n\tglEnable(GL_TEXTURE_2D); glBindTexture(GL_TEXTURE_2D, 0);\n\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT);     glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT);\n\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR); glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\n\tglTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA, imagedim, imagedim, 0, GL_RGB, GL_UNSIGNED_BYTE, checker_image);\n}\n\nvoid gldraw(const std::vector<float3> &verts, const std::vector<int3> &tris)\n{\n\tglBegin(GL_TRIANGLES);\n\tglColor4f(1, 1, 1, 0.25f);\n\tfor (auto t : tris)\n\t{\n\t\tauto n = TriNormal(verts[t[0]], verts[t[1]], verts[t[2]]);\n\t\tglNormal3fv(n); auto vn = vabs(n);\n\t\tint k = argmax(&vn.x, 3);\n\t\tfor (int j = 0; j < 3; j++)\n\t\t{\n\t\t\tconst auto &v = verts[t[j]];\n\t\t\tglTexCoord2f(v[(k + 1) % 3], v[(k + 2) % 3]);\n\t\t\tglVertex3fv(v);\n\t\t}\n\t}\n\tglEnd();\n}\nvoid wmwire(const WingMesh &m)\n{\n\tglBegin(GL_LINES);\n\tfor (auto e : m.edges)\n\t{\n\t\tglVertex3fv(m.verts[e.v]);\n\t\tglVertex3fv(m.verts[m.edges[e.next].v]);\n\t}\n\tglEnd();\n}\nvoid wmdraw(const WingMesh &m)\n{\n\tauto tris = WingMeshTris(m);\n\tgldraw(m.verts, tris);\n}\n\nvoid rbdraw(const RigidBody *rb,int wireframe)\n{\n\tglPushMatrix();\n\tglMultMatrix(MatrixFromRotationTranslation(rb->orientation, rb->position));\n\tfor (const auto &s :rb->shapes)\n\t\t((wireframe)?wmwire:wmdraw)(s->local_geometry);\n\tglPopMatrix();\n}\n\n\n\nint APIENTRY WinMain(HINSTANCE hCurrentInst, HINSTANCE hPreviousInst,LPSTR lpszCmdLine, int nCmdShow) \/\/ int main(int argc, char *argv[])\n{\n\tstd::cout << \"Test Physics\\n\";\n\n\textern std::vector<RigidBody*> g_rigidbodies;\n\tauto wma = WingMeshCube({ -1, -1, -1 }, { 1, 1, 1 });\n\tauto wmb = WingMeshCube({ -1, -1, -1 }, { 1, 1, 1 });\n\tauto rba = new RigidBody({ wma }, { 1.5f, 0.0f, 1.5f });\n\tauto rbb = new RigidBody({ wmb }, { -1.5f, 0.0f, 1.5f });\n\trbb->orientation = normalize(float4(0.1f, 0.01f, 0.3f, 1.0f));\n\tauto seesaw = new RigidBody({ WingMeshCube({ -3, -0.5f, -0.1f }, { 3, 0.5f, 0.1f }) }, { 0, -2.5, 0.25f });\n\tnew RigidBody({ WingMeshCube({ -0.25f, -0.25f, -0.25f }, { 0.25f, 0.25f, 0.25f }) }, seesaw->position_start + float3( 2.5f, 0, 0.4f));\n\trbscalemass(new RigidBody({ WingMeshCube({ -0.5f, -0.5f, -0.5f }, { 0.5f, 0.5f, 0.5f }) }, seesaw->position_start + float3(-2.5f, 0, 5.0f)),4.0f);\n\tfor (float z = 5.5f; z < 14.0f; z += 3.0f)\n\t\tnew RigidBody({ WingMeshCube({ -0.5f, -0.5f, -0.5f }, { 0.5f, 0.5f, 0.5f }) }, { 0.0f, 0.0f, z });\n\tfor (float z = 15.0f; z < 20.0f; z += 3.0f)\n\t\tnew RigidBody({ WingMeshDual(WingMeshCube({ -0.5f, -0.5f, -0.5f }, { 0.5f, 0.5f, 0.5f }), 0.65f) }, { 2.0f, -1.0f, z });\n\n\tstd::vector<WingMesh*> world_geometry;\n\tWingMesh world_slab = WingMeshCube({ -10, -10, -5 }, { 10, 10, -2 });\n\tworld_geometry.push_back(&world_slab);\n\n\n\n\tGLWin glwin(\"TestPhys sample\");\n\n\tglwin.keyboardfunc = [&](unsigned char key, int x, int y)->void \n\t{\n\t\t\tswitch (std::tolower(key))\n\t\t\t{\n\t\t\tcase ' ':\n\t\t\t\tg_simulate = !g_simulate;\n\t\t\t\tbreak;\n\t\t\tcase 'q': case 27:   \/\/ ESC\n\t\t\t\texit(0); break;  \n\t\t\tcase 'r':\n\t\t\t\tfor (auto &rb : g_rigidbodies)\n\t\t\t\t{\n\t\t\t\t\trb->position = rb->position_start;\n\t\t\t\t\t\/\/rb->orientation = rb->orientation_start;  \/\/ when commented out this provides some variation\n\t\t\t\t\trb->momentum = float3(0, 0, 0);\n\t\t\t\t\trb->rotation = float3(0, 0, 0);\n\t\t\t\t}\n\t\t\t\tseesaw->orientation = { 0, 0, 0, 1 };\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tstd::cout << \"unassigned key (\" << (int)key << \"): '\" << key << \"'\\n\";\n\t\t\t\tbreak;\n\t\t\t}\n\t};\n\n\tInitTex();\n\n\twhile (glwin.WindowUp())\n\t{\n\t\tif (glwin.MouseState)  \/\/ on mouse drag \n\t\t{\n\t\t\tg_yaw   += (glwin.MouseX - g_mouseX) * 0.3f;  \/\/ poor man's trackball\n\t\t\tg_pitch += (glwin.MouseY - g_mouseY) * 0.3f;\n\t\t}\n\t\tg_mouseX = glwin.MouseX;\n\t\tg_mouseY = glwin.MouseY;\n\n\t\tif (g_simulate)\n\t\t{\n\t\t\textern void PhysicsUpdate(const std::vector<WingMesh*> &wgeom);\n\t\t\textern void createangularlimits(RigidBody *rb0, RigidBody *rb1, const float4 &_jointframe, const float3& _jointlimitmin, const float3& _jointlimitmax);\n\t\t\textern void createnail(RigidBody *rb0, const float3 &p0, RigidBody *rb1, const float3 &p1);\n\t\t\tcreatenail(NULL, seesaw->position_start, seesaw, { 0, 0, 0 });\n\t\t\tcreateangularlimits(NULL, seesaw, { 0, 0, 0, 1 }, { 0, -20, 0 }, { 0, 20, 0 });\n\t\t\tPhysicsUpdate(world_geometry);\n\t\t}\n\n\n\t\tglPushAttrib(GL_ALL_ATTRIB_BITS);\n\t\tglViewport(0, 0, glwin.Width,glwin.Height);  \/\/ Set up the viewport\n\t\tglClearColor(0.1f, 0.1f, 0.15f, 1);\n\t\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\t\tglEnable(GL_DEPTH_TEST);\n\n\t\t\/\/ Set up matrices\n\t\tglMatrixMode(GL_PROJECTION);\n\t\tglPushMatrix();\n\t\tglLoadIdentity();\n\t\tgluPerspective(60, (double)glwin.Width\/ glwin.Height, 0.01, 50);\n\n\t\tglMatrixMode(GL_MODELVIEW);\n\t\tglPushMatrix();\n\t\tgluLookAt(0, -8, 5, 0, 0, 0, 0, 0, 1);\n\t\tglRotatef(g_pitch, 1, 0, 0);\n\t\tglRotatef(g_yaw, 0, 0, 1);\n\n\t\t\/\/ wireframe pass:\n\t\tglColor3f(0, 1, 0.5f);\n\t\trbdraw(rba,1);\n\t\tglColor3f(0, 0.5f, 1.0f);\n\t\trbdraw(rbb, 1);  \/\/ wireframe\n\t\tglColor3f(0, 0.5f, 0.5f);\n\t\tfor (unsigned int i = 2; i < g_rigidbodies.size(); i++)\n\t\t\trbdraw(g_rigidbodies[i], 1);  \/\/ wireframe\n\n\t\tfor (auto &wm : world_geometry)\n\t\t\twmdraw(*wm);\n\n\t\tglEnable(GL_POLYGON_OFFSET_FILL);\n\t\tglPolygonOffset(1., 1. \/ (float)0x10000);\n\t\tglEnable(GL_LIGHTING);\n\t\tglEnable(GL_LIGHT0);\n\t\tglEnable(GL_TEXTURE_2D);\n\t\tglColor3f(0.5f, 0.5f, 0.5f);\n\t\tfor (auto &rb : g_rigidbodies)\n\t\t\trbdraw(rb, 0);\n\n\t\t\/\/ Restore state\n\t\tglPopMatrix();  \/\/should be currently in modelview mode\n\t\tglMatrixMode(GL_PROJECTION);\n\t\tglPopMatrix();\n\t\tglPopAttrib();\n\t\tglMatrixMode(GL_MODELVIEW);  \n\n\t\tglwin.PrintString(\"ESC\/q quits. SPACE to simulate. r to restart\", 5, 0);\n\t\tchar buf[256];\n\t\tsprintf_s(buf, \"simulation %s\", (g_simulate)?\"ON\":\"OFF\");\n\t\tglwin.PrintString(buf, 5, 1);\n\n\t\tglwin.SwapBuffers();\n\t}\n\n\tstd::cout << \"\\n\";\n\treturn 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\n\/*\n * Copyright 2011 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n#include \"Test.h\"\n#include \"SkPath.h\"\n#include \"SkLineClipper.h\"\n#include \"SkEdgeClipper.h\"\n\n#include \"SkCanvas.h\"\nstatic void test_hairclipping(skiatest::Reporter* reporter) {\n    SkBitmap bm;\n    bm.setConfig(SkBitmap::kARGB_8888_Config, 4, 4);\n    bm.allocPixels();\n    bm.eraseColor(SK_ColorWHITE);\n    \n    SkPaint paint;\n    paint.setAntiAlias(true);\n\n    SkCanvas canvas(bm);\n    canvas.clipRect(SkRect::MakeWH(4, 2));\n    canvas.drawLine(1.5, 1.5, 3.5, 3.5, paint);\n    \n    \/**\n     *  We had a bug where we misinterpreted the bottom of the clip, and\n     *  would draw another pixel (to the right in this case) on the same\n     *  last scanline. i.e. we would draw to [2,1], even though this hairline\n     *  should just draw to [1,1], [2,2], [3,3] modulo the clip.\n     *\n     *  The result of this entire draw should be that we only draw to [1,1]\n     *\n     *  Fixed in rev. 3366\n     *\/\n    for (int y = 0; y < 4; ++y) {\n        for (int x = 0; x < 4; ++x) {\n            bool nonWhite = (1 == y) && (1 == x);\n            SkPMColor c = *bm.getAddr32(x, y);\n            if (nonWhite) {\n                REPORTER_ASSERT(reporter, 0xFFFFFFFF != c);\n            } else {\n                REPORTER_ASSERT(reporter, 0xFFFFFFFF == c);\n            }\n        }\n    }\n}\n\nstatic void test_edgeclipper(skiatest::Reporter* reporter) {\n    SkEdgeClipper clipper;\n    \n    const SkPoint pts[] = {\n        { SkFloatToScalar(3.0995476e+010),  SkFloatToScalar(42.929779) },\n        { SkFloatToScalar(-3.0995163e+010), SkFloatToScalar(51.050385) },\n        { SkFloatToScalar(-3.0995157e+010), SkFloatToScalar(51.050392) },\n        { SkFloatToScalar(-3.0995134e+010), SkFloatToScalar(51.050400) },\n    };\n\n    const SkRect clip = { 0, 0, SkIntToScalar(300), SkIntToScalar(200) };\n\n    \/\/ this should not assert, even though our choppers do a poor numerical\n    \/\/ job when computing their t values.\n    \/\/ http:\/\/code.google.com\/p\/skia\/issues\/detail?id=444\n    clipper.clipCubic(pts, clip);\n}\n\nstatic void test_intersectline(skiatest::Reporter* reporter) {\n    static const SkScalar L = 0;\n    static const SkScalar T = 0;\n    static const SkScalar R = SkIntToScalar(100);\n    static const SkScalar B = SkIntToScalar(100);\n    static const SkScalar CX = SkScalarHalf(L + R);\n    static const SkScalar CY = SkScalarHalf(T + B);\n    static const SkRect gR = { L, T, R, B };\n\n    size_t i;\n    SkPoint dst[2];\n\n    static const SkPoint gEmpty[] = {\n        \/\/ sides\n        { L, CY }, { L - 10, CY },\n        { R, CY }, { R + 10, CY },\n        { CX, T }, { CX, T - 10 },\n        { CX, B }, { CX, B + 10 },\n        \/\/ corners\n        { L, T }, { L - 10, T - 10 },\n        { L, B }, { L - 10, B + 10 },\n        { R, T }, { R + 10, T - 10 },\n        { R, B }, { R + 10, B + 10 },\n    };\n    for (i = 0; i < SK_ARRAY_COUNT(gEmpty); i += 2) {\n        bool valid = SkLineClipper::IntersectLine(&gEmpty[i], gR, dst);\n        if (valid) {\n            SkDebugf(\"----- [%d] %g %g -> %g %g\\n\", i\/2, dst[0].fX, dst[0].fY, dst[1].fX, dst[1].fY);\n        }\n        REPORTER_ASSERT(reporter, !valid);\n    }\n    \n    static const SkPoint gFull[] = {\n        \/\/ diagonals, chords\n        { L, T }, { R, B },\n        { L, B }, { R, T },\n        { CX, T }, { CX, B },\n        { L, CY }, { R, CY },\n        { CX, T }, { R, CY },\n        { CX, T }, { L, CY },\n        { L, CY }, { CX, B },\n        { R, CY }, { CX, B },\n        \/\/ edges\n        { L, T }, { L, B },\n        { R, T }, { R, B },\n        { L, T }, { R, T },\n        { L, B }, { R, B },\n    };\n    for (i = 0; i < SK_ARRAY_COUNT(gFull); i += 2) {\n        bool valid = SkLineClipper::IntersectLine(&gFull[i], gR, dst);\n        if (!valid || memcmp(&gFull[i], dst, sizeof(dst))) {\n            SkDebugf(\"++++ [%d] %g %g -> %g %g\\n\", i\/2, dst[0].fX, dst[0].fY, dst[1].fX, dst[1].fY);\n        }\n        REPORTER_ASSERT(reporter, valid && !memcmp(&gFull[i], dst, sizeof(dst)));\n    }\n    \n    static const SkPoint gPartial[] = {\n        { L - 10, CY }, { CX, CY }, { L, CY }, { CX, CY },\n        { CX, T - 10 }, { CX, CY }, { CX, T }, { CX, CY },\n        { R + 10, CY }, { CX, CY }, { R, CY }, { CX, CY },\n        { CX, B + 10 }, { CX, CY }, { CX, B }, { CX, CY },\n        \/\/ extended edges\n        { L, T - 10 }, { L, B + 10 }, { L, T }, { L, B },\n        { R, T - 10 }, { R, B + 10 }, { R, T }, { R, B },\n        { L - 10, T }, { R + 10, T }, { L, T }, { R, T },\n        { L - 10, B }, { R + 10, B }, { L, B }, { R, B },\n    };\n    for (i = 0; i < SK_ARRAY_COUNT(gPartial); i += 4) {\n        bool valid = SkLineClipper::IntersectLine(&gPartial[i], gR, dst);\n        if (!valid || memcmp(&gPartial[i+2], dst, sizeof(dst))) {\n            SkDebugf(\"++++ [%d] %g %g -> %g %g\\n\", i\/2, dst[0].fX, dst[0].fY, dst[1].fX, dst[1].fY);\n        }\n        REPORTER_ASSERT(reporter, valid &&\n                                  !memcmp(&gPartial[i+2], dst, sizeof(dst)));\n    }\n    \n}\n\nvoid TestClipper(skiatest::Reporter* reporter) {\n    test_intersectline(reporter);\n    test_edgeclipper(reporter);\n    test_hairclipping(reporter);\n}\n\n#include \"TestClassDef.h\"\nDEFINE_TESTCLASS(\"Clipper\", TestClipperClass, TestClipper)\n<commit_msg>promote floats to scalars for the fixed-point build<commit_after>\n\/*\n * Copyright 2011 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n#include \"Test.h\"\n#include \"SkPath.h\"\n#include \"SkLineClipper.h\"\n#include \"SkEdgeClipper.h\"\n\n#include \"SkCanvas.h\"\nstatic void test_hairclipping(skiatest::Reporter* reporter) {\n    SkBitmap bm;\n    bm.setConfig(SkBitmap::kARGB_8888_Config, 4, 4);\n    bm.allocPixels();\n    bm.eraseColor(SK_ColorWHITE);\n    \n    SkPaint paint;\n    paint.setAntiAlias(true);\n\n    SkCanvas canvas(bm);\n    canvas.clipRect(SkRect::MakeWH(SkIntToScalar(4), SkIntToScalar(2)));\n    canvas.drawLine(SkFloatToScalar(1.5), SkFloatToScalar(1.5),\n                    SkFloatToScalar(3.5), SkFloatToScalar(3.5), paint);\n    \n    \/**\n     *  We had a bug where we misinterpreted the bottom of the clip, and\n     *  would draw another pixel (to the right in this case) on the same\n     *  last scanline. i.e. we would draw to [2,1], even though this hairline\n     *  should just draw to [1,1], [2,2], [3,3] modulo the clip.\n     *\n     *  The result of this entire draw should be that we only draw to [1,1]\n     *\n     *  Fixed in rev. 3366\n     *\/\n    for (int y = 0; y < 4; ++y) {\n        for (int x = 0; x < 4; ++x) {\n            bool nonWhite = (1 == y) && (1 == x);\n            SkPMColor c = *bm.getAddr32(x, y);\n            if (nonWhite) {\n                REPORTER_ASSERT(reporter, 0xFFFFFFFF != c);\n            } else {\n                REPORTER_ASSERT(reporter, 0xFFFFFFFF == c);\n            }\n        }\n    }\n}\n\nstatic void test_edgeclipper(skiatest::Reporter* reporter) {\n    SkEdgeClipper clipper;\n    \n    const SkPoint pts[] = {\n        { SkFloatToScalar(3.0995476e+010),  SkFloatToScalar(42.929779) },\n        { SkFloatToScalar(-3.0995163e+010), SkFloatToScalar(51.050385) },\n        { SkFloatToScalar(-3.0995157e+010), SkFloatToScalar(51.050392) },\n        { SkFloatToScalar(-3.0995134e+010), SkFloatToScalar(51.050400) },\n    };\n\n    const SkRect clip = { 0, 0, SkIntToScalar(300), SkIntToScalar(200) };\n\n    \/\/ this should not assert, even though our choppers do a poor numerical\n    \/\/ job when computing their t values.\n    \/\/ http:\/\/code.google.com\/p\/skia\/issues\/detail?id=444\n    clipper.clipCubic(pts, clip);\n}\n\nstatic void test_intersectline(skiatest::Reporter* reporter) {\n    static const SkScalar L = 0;\n    static const SkScalar T = 0;\n    static const SkScalar R = SkIntToScalar(100);\n    static const SkScalar B = SkIntToScalar(100);\n    static const SkScalar CX = SkScalarHalf(L + R);\n    static const SkScalar CY = SkScalarHalf(T + B);\n    static const SkRect gR = { L, T, R, B };\n\n    size_t i;\n    SkPoint dst[2];\n\n    static const SkPoint gEmpty[] = {\n        \/\/ sides\n        { L, CY }, { L - 10, CY },\n        { R, CY }, { R + 10, CY },\n        { CX, T }, { CX, T - 10 },\n        { CX, B }, { CX, B + 10 },\n        \/\/ corners\n        { L, T }, { L - 10, T - 10 },\n        { L, B }, { L - 10, B + 10 },\n        { R, T }, { R + 10, T - 10 },\n        { R, B }, { R + 10, B + 10 },\n    };\n    for (i = 0; i < SK_ARRAY_COUNT(gEmpty); i += 2) {\n        bool valid = SkLineClipper::IntersectLine(&gEmpty[i], gR, dst);\n        if (valid) {\n            SkDebugf(\"----- [%d] %g %g -> %g %g\\n\", i\/2, dst[0].fX, dst[0].fY, dst[1].fX, dst[1].fY);\n        }\n        REPORTER_ASSERT(reporter, !valid);\n    }\n    \n    static const SkPoint gFull[] = {\n        \/\/ diagonals, chords\n        { L, T }, { R, B },\n        { L, B }, { R, T },\n        { CX, T }, { CX, B },\n        { L, CY }, { R, CY },\n        { CX, T }, { R, CY },\n        { CX, T }, { L, CY },\n        { L, CY }, { CX, B },\n        { R, CY }, { CX, B },\n        \/\/ edges\n        { L, T }, { L, B },\n        { R, T }, { R, B },\n        { L, T }, { R, T },\n        { L, B }, { R, B },\n    };\n    for (i = 0; i < SK_ARRAY_COUNT(gFull); i += 2) {\n        bool valid = SkLineClipper::IntersectLine(&gFull[i], gR, dst);\n        if (!valid || memcmp(&gFull[i], dst, sizeof(dst))) {\n            SkDebugf(\"++++ [%d] %g %g -> %g %g\\n\", i\/2, dst[0].fX, dst[0].fY, dst[1].fX, dst[1].fY);\n        }\n        REPORTER_ASSERT(reporter, valid && !memcmp(&gFull[i], dst, sizeof(dst)));\n    }\n    \n    static const SkPoint gPartial[] = {\n        { L - 10, CY }, { CX, CY }, { L, CY }, { CX, CY },\n        { CX, T - 10 }, { CX, CY }, { CX, T }, { CX, CY },\n        { R + 10, CY }, { CX, CY }, { R, CY }, { CX, CY },\n        { CX, B + 10 }, { CX, CY }, { CX, B }, { CX, CY },\n        \/\/ extended edges\n        { L, T - 10 }, { L, B + 10 }, { L, T }, { L, B },\n        { R, T - 10 }, { R, B + 10 }, { R, T }, { R, B },\n        { L - 10, T }, { R + 10, T }, { L, T }, { R, T },\n        { L - 10, B }, { R + 10, B }, { L, B }, { R, B },\n    };\n    for (i = 0; i < SK_ARRAY_COUNT(gPartial); i += 4) {\n        bool valid = SkLineClipper::IntersectLine(&gPartial[i], gR, dst);\n        if (!valid || memcmp(&gPartial[i+2], dst, sizeof(dst))) {\n            SkDebugf(\"++++ [%d] %g %g -> %g %g\\n\", i\/2, dst[0].fX, dst[0].fY, dst[1].fX, dst[1].fY);\n        }\n        REPORTER_ASSERT(reporter, valid &&\n                                  !memcmp(&gPartial[i+2], dst, sizeof(dst)));\n    }\n    \n}\n\nvoid TestClipper(skiatest::Reporter* reporter) {\n    test_intersectline(reporter);\n    test_edgeclipper(reporter);\n    test_hairclipping(reporter);\n}\n\n#include \"TestClassDef.h\"\nDEFINE_TESTCLASS(\"Clipper\", TestClipperClass, TestClipper)\n<|endoftext|>"}
{"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2017 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/  http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#pragma once\n\n#include \"etl\/expr\/base_temporary_expr.hpp\"\n\n\/\/Get the implementations\n#include \"etl\/impl\/conv.hpp\"\n\nnamespace etl {\n\n\/*!\n * \\brief A transposition expression.\n * \\tparam A The transposed type\n *\/\ntemplate <typename A, typename B, size_t S1, size_t S2, size_t P1, size_t P2, bool Flipped>\nstruct conv_2d_valid_multi_expr : base_temporary_expr_bin<conv_2d_valid_multi_expr<A, B, S1, S2, P1, P2, Flipped>, A, B> {\n    using value_type  = value_t<A>;                                              \/\/\/< The type of value of the expression\n    using this_type   = conv_2d_valid_multi_expr<A, B, S1, S2, P1, P2, Flipped>; \/\/\/< The type of this expression\n    using base_type   = base_temporary_expr_bin<this_type, A, B>;                \/\/\/< The base type\n    using left_traits = decay_traits<A>;                                         \/\/\/< The traits of the sub type\n\n    static constexpr auto storage_order = left_traits::storage_order; \/\/\/< The sub storage order\n\n    \/*!\n     * \\brief Construct a new expression\n     * \\param a The sub expression\n     *\/\n    explicit conv_2d_valid_multi_expr(A a, B b) : base_type(a, b) {\n        \/\/Nothing else to init\n    }\n\n    \/\/ Assignment functions\n\n    \/*!\n     * \\brief Assert that the convolution is done on correct dimensions\n     *\/\n    template <typename I, typename K, typename C, cpp_disable_if(all_fast<A, B, C>::value)>\n    static void check(const I& input, const K& kernel, const C& conv){\n        static_assert(etl::dimensions<I>() == 2, \"Invalid number of dimensions for input of conv2_valid\");\n        static_assert(etl::dimensions<K>() == 3, \"Invalid number of dimensions for kernel of conv2_valid\");\n        static_assert(etl::dimensions<C>() == 2, \"Invalid number of dimensions for conv of conv2_valid\");\n\n        cpp_assert(etl::dim(conv, 0) == etl::dim(kernel, 0), \"Invalid dimensions for conv2_valid\");\n        cpp_assert(etl::dim(conv, 1) == (etl::dim(input, 0) - etl::dim(kernel, 1) + 2 * P1) \/ S1 + 1, \"Invalid dimensions for conv2_valid\");\n        cpp_assert(etl::dim(conv, 2) == (etl::dim(input, 1) - etl::dim(kernel, 2) + 2 * P2) \/ S2 + 1, \"Invalid dimensions for conv2_valid\");\n\n        cpp_unused(input);\n        cpp_unused(kernel);\n        cpp_unused(conv);\n    }\n\n    \/*!\n     * \\brief Assert that the convolution is done on correct dimensions\n     *\/\n    template <typename I, typename K, typename C, cpp_enable_if(all_fast<A, B, C>::value)>\n    static void check(const I& input, const K& kernel, const C& conv){\n        static_assert(etl::dimensions<I>() == 2, \"Invalid number of dimensions for input of conv2_valid\");\n        static_assert(etl::dimensions<K>() == 3, \"Invalid number of dimensions for kernel of conv2_valid\");\n        static_assert(etl::dimensions<C>() == 3, \"Invalid number of dimensions for conv of conv2_valid\");\n\n        static_assert(etl::dim<0, C>() == etl::dim<0, K>(), \"Invalid dimensions for conv2_valid\");\n        static_assert(etl::dim<1, C>() == (etl::dim<0, I>() - etl::dim<1, K>() + 2 * P1) \/ S1 + 1, \"Invalid dimensions for conv2_valid\");\n        static_assert(etl::dim<2, C>() == (etl::dim<1, I>() - etl::dim<2, K>() + 2 * P2) \/ S2 + 1, \"Invalid dimensions for conv2_valid\");\n\n        cpp_unused(input);\n        cpp_unused(kernel);\n        cpp_unused(conv);\n    }\n\n    \/*!\n     * \\brief Assign to a matrix\n     *\n     * \\param c The expression to which assign\n     *\/\n    template<typename C>\n    void assign_to(C&& c)  const {\n        static_assert(all_etl_expr<A, B, C>::value, \"conv2_valid only supported for ETL expressions\");\n\n        auto& a = this->a();\n        auto& b = this->b();\n\n        check(a, b, c);\n\n        standard_evaluator::pre_assign_rhs(a);\n        standard_evaluator::pre_assign_rhs(b);\n        standard_evaluator::pre_assign_lhs(c);\n\n        if \/* constexpr *\/ (Flipped){\n            detail::conv2_valid_multi_flipped_impl<S1, S2, P1, P2>::apply(make_temporary(a), make_temporary(b), c);\n        } else {\n            detail::conv2_valid_multi_impl<S1, S2, P1, P2>::apply(make_temporary(a), make_temporary(b), c);\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        std_add_evaluate(*this, lhs);\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        std_sub_evaluate(*this, lhs);\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        std_mul_evaluate(*this, lhs);\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        std_div_evaluate(*this, lhs);\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        std_mod_evaluate(*this, lhs);\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 conv_2d_valid_multi_expr& expr) {\n        return os << \"conv2_valid_multi(\" << expr._a << \", \" << expr._b << \")\";\n    }\n};\n\n\/*!\n * \\brief Traits for a transpose expression\n * \\tparam A The transposed sub type\n *\/\ntemplate <typename A, typename B, size_t S1, size_t S2, size_t P1, size_t P2, bool Flipped>\nstruct etl_traits<etl::conv_2d_valid_multi_expr<A, B, S1, S2, P1, P2, Flipped>> {\n    using expr_t       = etl::conv_2d_valid_multi_expr<A, B, S1, S2, P1, P2, Flipped>; \/\/\/< The expression type\n    using left_expr_t  = std::decay_t<A>;                                       \/\/\/< The left sub expression type\n    using right_expr_t = std::decay_t<B>;                                       \/\/\/< The right sub expression type\n    using left_traits  = etl_traits<left_expr_t>;                               \/\/\/< The left sub traits\n    using right_traits = etl_traits<right_expr_t>;                              \/\/\/< The right 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         = all_fast<A, B>::value;      \/\/\/< Indicates if the expression is fast\n    static constexpr bool is_linear       = true;                       \/\/\/< 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_gpu          = false;                      \/\/\/< Indicates if the expression can be done on GPU\n    static constexpr bool needs_evaluator = true;                       \/\/\/< Indicates if the expression needs a evaluator visitor\n    static constexpr order storage_order  = left_traits::storage_order; \/\/\/< The expression's storage order\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    using vectorizable = std::true_type;\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        return DD == 0 ? etl::dim<0, B>()\n             : DD == 1 ? (etl::dim<0, A>() - etl::dim<1, B>() + 2 * P1) \/ S1 + 1\n                       : (etl::dim<1, A>() - etl::dim<2, B>() + 2 * P2) \/ S2 + 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, size_t d) {\n        if (d == 0){\n            return etl::dim(e._b, 0);\n        } else if (d == 1){\n            return (etl::dim(e._a, 0) - etl::dim(e._b, 1) + 2 * P1) \/ S1 + 1;\n        } else {\n            return (etl::dim(e._a, 1) - etl::dim(e._b, 2) + 2 * P2) \/ S2 + 1;\n        }\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(e._b, 0))\n            *  ((etl::dim(e._a, 0) - etl::dim(e._b, 1) + 2 * P1) \/ S1 + 1)\n            *  ((etl::dim(e._a, 1) - etl::dim(e._b, 2) + 2 * P2) \/ S2 + 1);\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  (etl::dim<0, B>())\n              * ((etl::dim<0, A>() - etl::dim<1, B>() + 2 * P1) \/ S1 + 1)\n              * ((etl::dim<1, A>() - etl::dim<2, B>() + 2 * P2) \/ S2 + 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 3;\n    }\n};\n\n\/*!\n * \\brief Creates an expression representing the 'valid' 1D convolution of a and b.\n *\n * \\param a The input expression\n * \\param b The kernel expression\n *\n * \\return an expression representing the 'valid' 1D convolution of a and b\n *\/\ntemplate <size_t S1 = 1, size_t S2 = 1, size_t P1 = 0, size_t P2 = 0, typename A, typename B>\nconv_2d_valid_multi_expr<A, B, S1, S2, P1, P1, false> conv_2d_valid_multi(A&& a, B&& b) {\n    static_assert(all_etl_expr<A, B>::value, \"Convolution only supported for ETL expressions\");\n\n    return conv_2d_valid_multi_expr<A, B, S1, S2, P1, P1, false>{a, b};\n}\n\n\/*!\n * \\brief Creates an expression representing the 'valid' 1D convolution of a and b, the result will be stored in c\n *\n * \\param a The input expression\n * \\param b The kernel expression\n * \\param c The result\n *\n * \\return an expression representing the 'valid' 1D convolution of a and b\n *\/\ntemplate <size_t S1 = 1, size_t S2 = 1, size_t P1 = 0, size_t P2 = 0, typename A, typename B, typename C>\nauto conv_2d_valid_multi(A&& a, B&& b, C&& c){\n    static_assert(all_etl_expr<A, B, C>::value, \"Convolution only supported for ETL expressions\");\n\n    c = conv_2d_valid_multi<S1, S2, P1, P2>(a, b);\n\n    return c;\n}\n\n\/*!\n * \\brief Creates an expression representing the 'valid' 1D convolution of a and flipped b.\n *\n * \\param a The input expression\n * \\param b The kernel expression\n *\n * \\return an expression representing the 'valid' 1D convolution of a and b\n *\/\ntemplate <size_t S1 = 1, size_t S2 = 1, size_t P1 = 0, size_t P2 = 0, typename A, typename B>\nconv_2d_valid_multi_expr<A, B, S1, S2, P1, P1, true> conv_2d_valid_multi_flipped(A&& a, B&& b) {\n    static_assert(all_etl_expr<A, B>::value, \"Convolution only supported for ETL expressions\");\n\n    return conv_2d_valid_multi_expr<A, B, S1, S2, P1, P1, true>{a, b};\n}\n\n\/*!\n * \\brief Creates an expression representing the 'valid' 1D convolution of a and flipped b, the result will be stored in c\n *\n * \\param a The input expression\n * \\param b The kernel expression\n * \\param c The result\n *\n * \\return an expression representing the 'valid' 1D convolution of a and b\n *\/\ntemplate <size_t S1 = 1, size_t S2 = 1, size_t P1 = 0, size_t P2 = 0, typename A, typename B, typename C>\nauto conv_2d_valid_multi_flipped(A&& a, B&& b, C&& c){\n    static_assert(all_etl_expr<A, B, C>::value, \"Convolution only supported for ETL expressions\");\n\n    c = conv_2d_valid_multi_flipped<S1, S2, P1, P2>(a, b);\n\n    return c;\n}\n\n} \/\/end of namespace etl\n<commit_msg>Fix assertion<commit_after>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2017 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/  http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#pragma once\n\n#include \"etl\/expr\/base_temporary_expr.hpp\"\n\n\/\/Get the implementations\n#include \"etl\/impl\/conv.hpp\"\n\nnamespace etl {\n\n\/*!\n * \\brief A transposition expression.\n * \\tparam A The transposed type\n *\/\ntemplate <typename A, typename B, size_t S1, size_t S2, size_t P1, size_t P2, bool Flipped>\nstruct conv_2d_valid_multi_expr : base_temporary_expr_bin<conv_2d_valid_multi_expr<A, B, S1, S2, P1, P2, Flipped>, A, B> {\n    using value_type  = value_t<A>;                                              \/\/\/< The type of value of the expression\n    using this_type   = conv_2d_valid_multi_expr<A, B, S1, S2, P1, P2, Flipped>; \/\/\/< The type of this expression\n    using base_type   = base_temporary_expr_bin<this_type, A, B>;                \/\/\/< The base type\n    using left_traits = decay_traits<A>;                                         \/\/\/< The traits of the sub type\n\n    static constexpr auto storage_order = left_traits::storage_order; \/\/\/< The sub storage order\n\n    \/*!\n     * \\brief Construct a new expression\n     * \\param a The sub expression\n     *\/\n    explicit conv_2d_valid_multi_expr(A a, B b) : base_type(a, b) {\n        \/\/Nothing else to init\n    }\n\n    \/\/ Assignment functions\n\n    \/*!\n     * \\brief Assert that the convolution is done on correct dimensions\n     *\/\n    template <typename I, typename K, typename C, cpp_disable_if(all_fast<A, B, C>::value)>\n    static void check(const I& input, const K& kernel, const C& conv){\n        static_assert(etl::dimensions<I>() == 2, \"Invalid number of dimensions for input of conv2_valid\");\n        static_assert(etl::dimensions<K>() == 3, \"Invalid number of dimensions for kernel of conv2_valid\");\n        static_assert(etl::dimensions<C>() == 3, \"Invalid number of dimensions for conv of conv2_valid\");\n\n        cpp_assert(etl::dim(conv, 0) == etl::dim(kernel, 0), \"Invalid dimensions for conv2_valid\");\n        cpp_assert(etl::dim(conv, 1) == (etl::dim(input, 0) - etl::dim(kernel, 1) + 2 * P1) \/ S1 + 1, \"Invalid dimensions for conv2_valid\");\n        cpp_assert(etl::dim(conv, 2) == (etl::dim(input, 1) - etl::dim(kernel, 2) + 2 * P2) \/ S2 + 1, \"Invalid dimensions for conv2_valid\");\n\n        cpp_unused(input);\n        cpp_unused(kernel);\n        cpp_unused(conv);\n    }\n\n    \/*!\n     * \\brief Assert that the convolution is done on correct dimensions\n     *\/\n    template <typename I, typename K, typename C, cpp_enable_if(all_fast<A, B, C>::value)>\n    static void check(const I& input, const K& kernel, const C& conv){\n        static_assert(etl::dimensions<I>() == 2, \"Invalid number of dimensions for input of conv2_valid\");\n        static_assert(etl::dimensions<K>() == 3, \"Invalid number of dimensions for kernel of conv2_valid\");\n        static_assert(etl::dimensions<C>() == 3, \"Invalid number of dimensions for conv of conv2_valid\");\n\n        static_assert(etl::dim<0, C>() == etl::dim<0, K>(), \"Invalid dimensions for conv2_valid\");\n        static_assert(etl::dim<1, C>() == (etl::dim<0, I>() - etl::dim<1, K>() + 2 * P1) \/ S1 + 1, \"Invalid dimensions for conv2_valid\");\n        static_assert(etl::dim<2, C>() == (etl::dim<1, I>() - etl::dim<2, K>() + 2 * P2) \/ S2 + 1, \"Invalid dimensions for conv2_valid\");\n\n        cpp_unused(input);\n        cpp_unused(kernel);\n        cpp_unused(conv);\n    }\n\n    \/*!\n     * \\brief Assign to a matrix\n     *\n     * \\param c The expression to which assign\n     *\/\n    template<typename C>\n    void assign_to(C&& c)  const {\n        static_assert(all_etl_expr<A, B, C>::value, \"conv2_valid only supported for ETL expressions\");\n\n        auto& a = this->a();\n        auto& b = this->b();\n\n        check(a, b, c);\n\n        standard_evaluator::pre_assign_rhs(a);\n        standard_evaluator::pre_assign_rhs(b);\n        standard_evaluator::pre_assign_lhs(c);\n\n        if \/* constexpr *\/ (Flipped){\n            detail::conv2_valid_multi_flipped_impl<S1, S2, P1, P2>::apply(make_temporary(a), make_temporary(b), c);\n        } else {\n            detail::conv2_valid_multi_impl<S1, S2, P1, P2>::apply(make_temporary(a), make_temporary(b), c);\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        std_add_evaluate(*this, lhs);\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        std_sub_evaluate(*this, lhs);\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        std_mul_evaluate(*this, lhs);\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        std_div_evaluate(*this, lhs);\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        std_mod_evaluate(*this, lhs);\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 conv_2d_valid_multi_expr& expr) {\n        return os << \"conv2_valid_multi(\" << expr._a << \", \" << expr._b << \")\";\n    }\n};\n\n\/*!\n * \\brief Traits for a transpose expression\n * \\tparam A The transposed sub type\n *\/\ntemplate <typename A, typename B, size_t S1, size_t S2, size_t P1, size_t P2, bool Flipped>\nstruct etl_traits<etl::conv_2d_valid_multi_expr<A, B, S1, S2, P1, P2, Flipped>> {\n    using expr_t       = etl::conv_2d_valid_multi_expr<A, B, S1, S2, P1, P2, Flipped>; \/\/\/< The expression type\n    using left_expr_t  = std::decay_t<A>;                                       \/\/\/< The left sub expression type\n    using right_expr_t = std::decay_t<B>;                                       \/\/\/< The right sub expression type\n    using left_traits  = etl_traits<left_expr_t>;                               \/\/\/< The left sub traits\n    using right_traits = etl_traits<right_expr_t>;                              \/\/\/< The right 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         = all_fast<A, B>::value;      \/\/\/< Indicates if the expression is fast\n    static constexpr bool is_linear       = true;                       \/\/\/< 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_gpu          = false;                      \/\/\/< Indicates if the expression can be done on GPU\n    static constexpr bool needs_evaluator = true;                       \/\/\/< Indicates if the expression needs a evaluator visitor\n    static constexpr order storage_order  = left_traits::storage_order; \/\/\/< The expression's storage order\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    using vectorizable = std::true_type;\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        return DD == 0 ? etl::dim<0, B>()\n             : DD == 1 ? (etl::dim<0, A>() - etl::dim<1, B>() + 2 * P1) \/ S1 + 1\n                       : (etl::dim<1, A>() - etl::dim<2, B>() + 2 * P2) \/ S2 + 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, size_t d) {\n        if (d == 0){\n            return etl::dim(e._b, 0);\n        } else if (d == 1){\n            return (etl::dim(e._a, 0) - etl::dim(e._b, 1) + 2 * P1) \/ S1 + 1;\n        } else {\n            return (etl::dim(e._a, 1) - etl::dim(e._b, 2) + 2 * P2) \/ S2 + 1;\n        }\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(e._b, 0))\n            *  ((etl::dim(e._a, 0) - etl::dim(e._b, 1) + 2 * P1) \/ S1 + 1)\n            *  ((etl::dim(e._a, 1) - etl::dim(e._b, 2) + 2 * P2) \/ S2 + 1);\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  (etl::dim<0, B>())\n              * ((etl::dim<0, A>() - etl::dim<1, B>() + 2 * P1) \/ S1 + 1)\n              * ((etl::dim<1, A>() - etl::dim<2, B>() + 2 * P2) \/ S2 + 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 3;\n    }\n};\n\n\/*!\n * \\brief Creates an expression representing the 'valid' 1D convolution of a and b.\n *\n * \\param a The input expression\n * \\param b The kernel expression\n *\n * \\return an expression representing the 'valid' 1D convolution of a and b\n *\/\ntemplate <size_t S1 = 1, size_t S2 = 1, size_t P1 = 0, size_t P2 = 0, typename A, typename B>\nconv_2d_valid_multi_expr<A, B, S1, S2, P1, P1, false> conv_2d_valid_multi(A&& a, B&& b) {\n    static_assert(all_etl_expr<A, B>::value, \"Convolution only supported for ETL expressions\");\n\n    return conv_2d_valid_multi_expr<A, B, S1, S2, P1, P1, false>{a, b};\n}\n\n\/*!\n * \\brief Creates an expression representing the 'valid' 1D convolution of a and b, the result will be stored in c\n *\n * \\param a The input expression\n * \\param b The kernel expression\n * \\param c The result\n *\n * \\return an expression representing the 'valid' 1D convolution of a and b\n *\/\ntemplate <size_t S1 = 1, size_t S2 = 1, size_t P1 = 0, size_t P2 = 0, typename A, typename B, typename C>\nauto conv_2d_valid_multi(A&& a, B&& b, C&& c){\n    static_assert(all_etl_expr<A, B, C>::value, \"Convolution only supported for ETL expressions\");\n\n    c = conv_2d_valid_multi<S1, S2, P1, P2>(a, b);\n\n    return c;\n}\n\n\/*!\n * \\brief Creates an expression representing the 'valid' 1D convolution of a and flipped b.\n *\n * \\param a The input expression\n * \\param b The kernel expression\n *\n * \\return an expression representing the 'valid' 1D convolution of a and b\n *\/\ntemplate <size_t S1 = 1, size_t S2 = 1, size_t P1 = 0, size_t P2 = 0, typename A, typename B>\nconv_2d_valid_multi_expr<A, B, S1, S2, P1, P1, true> conv_2d_valid_multi_flipped(A&& a, B&& b) {\n    static_assert(all_etl_expr<A, B>::value, \"Convolution only supported for ETL expressions\");\n\n    return conv_2d_valid_multi_expr<A, B, S1, S2, P1, P1, true>{a, b};\n}\n\n\/*!\n * \\brief Creates an expression representing the 'valid' 1D convolution of a and flipped b, the result will be stored in c\n *\n * \\param a The input expression\n * \\param b The kernel expression\n * \\param c The result\n *\n * \\return an expression representing the 'valid' 1D convolution of a and b\n *\/\ntemplate <size_t S1 = 1, size_t S2 = 1, size_t P1 = 0, size_t P2 = 0, typename A, typename B, typename C>\nauto conv_2d_valid_multi_flipped(A&& a, B&& b, C&& c){\n    static_assert(all_etl_expr<A, B, C>::value, \"Convolution only supported for ETL expressions\");\n\n    c = conv_2d_valid_multi_flipped<S1, S2, P1, P2>(a, b);\n\n    return c;\n}\n\n} \/\/end of namespace etl\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: textedit.hxx,v $\n *\n *  $Revision: 1.4 $\n *\n *  last change: $Author: hr $ $Date: 2003-03-18 16:28: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#ifndef _TEXTEDIT_HXX\n#define _TEXTEDIT_HXX\n\nclass AppEdit;\nclass TextEngine;\nclass TextView;\nclass TextEdit;\nclass BreakpointWindow;\n\n#ifndef _SV_TIMER_HXX \/\/autogen\n#include <vcl\/timer.hxx>\n#endif\n#ifndef _TOOLS_TABLE_HXX \/\/autogen\n#include <tools\/table.hxx>\n#endif\n#ifndef _TOOLS_DEBUG_HXX \/\/autogen\n#include <tools\/debug.hxx>\n#endif\n#ifndef _SFXLSTNER_HXX \/\/autogen\n#include <svtools\/lstner.hxx>\n#endif\n#include <svtools\/svmedit.hxx>\n\n#include \"dataedit.hxx\"\n\n\/\/#include <xtextedt.hxx>\n\nclass TextEditImp : public Window, public SfxListener\n{\nprotected:\n    void            DoSyntaxHighlight( ULONG nPara );\n\n\nprivate:\n    AppEdit *pAppEdit;\n    Link ModifyHdl;\n\n    Timer           aSyntaxIdleTimer;\n    Timer           aImplSyntaxIdleTimer;\n    DECL_LINK( SyntaxTimerHdl, Timer * );\n    Table           aSyntaxLineTable;\n\n    void Notify( SfxBroadcaster& rBC, const SfxHint& rHint );\n\n    void            ImpDoHighlight( const String& rSource, ULONG nLineOff );\n    BOOL            bHighlightning;\n    BOOL            bDoSyntaxHighlight;\n    BOOL            bDelayHighlight;\n\n\n    SbxBase* GetSbxAtMousePos( String &aWord );\n    virtual void MouseMove( const MouseEvent& rMEvt );\n    DECL_LINK( HideVarContents, void* );\n    DECL_LINK( ShowVarContents, void* );\n    Point aTipPos;\n    String aTipWord;\n    ULONG nTipId;\n\n    Timer HideTipTimer;\n    Timer ShowTipTimer;\n\n    BOOL bViewMoved;\n\npublic:\n    TextEditImp( AppEdit *pParent, const WinBits& aBits );\n    ~TextEditImp();\n\n    TextEngine *pTextEngine;\n    TextView *pTextView;\n\n    void SetFont( const Font& rNewFont );\n    BOOL IsModified();\n    void SetModifyHdl( Link l ){ ModifyHdl = l; }\n\n    void                KeyInput( const KeyEvent& rKeyEvent );\n    void                Paint( const Rectangle& rRect );\n    void                MouseButtonUp( const MouseEvent& rMouseEvent );\n    void                MouseButtonDown( const MouseEvent& rMouseEvent );\n\/\/  void                MouseMove( const MouseEvent& rMouseEvent );\n    void                Command( const CommandEvent& rCEvt );\n    \/\/BOOL              Drop( const DropEvent& rEvt );\n    \/\/BOOL              QueryDrop( DropEvent& rEvt );\n\n    BOOL                ViewMoved();\n\n    void DoDelayedSyntaxHighlight( xub_StrLen nPara );\n    void InvalidateSyntaxHighlight();\n    void SyntaxHighlight( BOOL bNew );\n    void BuildKontextMenu( PopupMenu *&pMenu );\n};\n\n\n\nDBG_NAMEEX(TextEdit)\nclass TextEdit : public DataEdit {\n\n    BreakpointWindow    *pBreakpointWindow;\n    BOOL bFileWasUTF8;\n    BOOL bSaveAsUTF8;\n\npublic:\n    TextEdit( AppEdit*, const WinBits& );\n    ~TextEdit();\n    void Highlight( ULONG nLine, xub_StrLen nCol1, xub_StrLen nCol2 );\n    TextEditImp& GetTextEditImp() { return aEdit; }\n\n    void                SetBreakpointWindow( BreakpointWindow *pBPWindow ){ pBreakpointWindow = pBPWindow; }\n    BreakpointWindow    *GetBreakpointWindow(){ return pBreakpointWindow; }\n\n    DATA_FUNC_DEF( aEdit, TextEditImp )\n\n    virtual void BuildKontextMenu( PopupMenu *&pMenu );\n\n    void SaveAsUTF8( BOOL bUTF8 ) { bSaveAsUTF8 = bUTF8; }\n};\n\n#endif\n<commit_msg>INTEGRATION: CWS ooo19126 (1.4.302); FILE MERGED 2005\/09\/05 14:35:59 rt 1.4.302.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: textedit.hxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-07 21:22: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 _TEXTEDIT_HXX\n#define _TEXTEDIT_HXX\n\nclass AppEdit;\nclass TextEngine;\nclass TextView;\nclass TextEdit;\nclass BreakpointWindow;\n\n#ifndef _SV_TIMER_HXX \/\/autogen\n#include <vcl\/timer.hxx>\n#endif\n#ifndef _TOOLS_TABLE_HXX \/\/autogen\n#include <tools\/table.hxx>\n#endif\n#ifndef _TOOLS_DEBUG_HXX \/\/autogen\n#include <tools\/debug.hxx>\n#endif\n#ifndef _SFXLSTNER_HXX \/\/autogen\n#include <svtools\/lstner.hxx>\n#endif\n#include <svtools\/svmedit.hxx>\n\n#include \"dataedit.hxx\"\n\n\/\/#include <xtextedt.hxx>\n\nclass TextEditImp : public Window, public SfxListener\n{\nprotected:\n    void            DoSyntaxHighlight( ULONG nPara );\n\n\nprivate:\n    AppEdit *pAppEdit;\n    Link ModifyHdl;\n\n    Timer           aSyntaxIdleTimer;\n    Timer           aImplSyntaxIdleTimer;\n    DECL_LINK( SyntaxTimerHdl, Timer * );\n    Table           aSyntaxLineTable;\n\n    void Notify( SfxBroadcaster& rBC, const SfxHint& rHint );\n\n    void            ImpDoHighlight( const String& rSource, ULONG nLineOff );\n    BOOL            bHighlightning;\n    BOOL            bDoSyntaxHighlight;\n    BOOL            bDelayHighlight;\n\n\n    SbxBase* GetSbxAtMousePos( String &aWord );\n    virtual void MouseMove( const MouseEvent& rMEvt );\n    DECL_LINK( HideVarContents, void* );\n    DECL_LINK( ShowVarContents, void* );\n    Point aTipPos;\n    String aTipWord;\n    ULONG nTipId;\n\n    Timer HideTipTimer;\n    Timer ShowTipTimer;\n\n    BOOL bViewMoved;\n\npublic:\n    TextEditImp( AppEdit *pParent, const WinBits& aBits );\n    ~TextEditImp();\n\n    TextEngine *pTextEngine;\n    TextView *pTextView;\n\n    void SetFont( const Font& rNewFont );\n    BOOL IsModified();\n    void SetModifyHdl( Link l ){ ModifyHdl = l; }\n\n    void                KeyInput( const KeyEvent& rKeyEvent );\n    void                Paint( const Rectangle& rRect );\n    void                MouseButtonUp( const MouseEvent& rMouseEvent );\n    void                MouseButtonDown( const MouseEvent& rMouseEvent );\n\/\/  void                MouseMove( const MouseEvent& rMouseEvent );\n    void                Command( const CommandEvent& rCEvt );\n    \/\/BOOL              Drop( const DropEvent& rEvt );\n    \/\/BOOL              QueryDrop( DropEvent& rEvt );\n\n    BOOL                ViewMoved();\n\n    void DoDelayedSyntaxHighlight( xub_StrLen nPara );\n    void InvalidateSyntaxHighlight();\n    void SyntaxHighlight( BOOL bNew );\n    void BuildKontextMenu( PopupMenu *&pMenu );\n};\n\n\n\nDBG_NAMEEX(TextEdit)\nclass TextEdit : public DataEdit {\n\n    BreakpointWindow    *pBreakpointWindow;\n    BOOL bFileWasUTF8;\n    BOOL bSaveAsUTF8;\n\npublic:\n    TextEdit( AppEdit*, const WinBits& );\n    ~TextEdit();\n    void Highlight( ULONG nLine, xub_StrLen nCol1, xub_StrLen nCol2 );\n    TextEditImp& GetTextEditImp() { return aEdit; }\n\n    void                SetBreakpointWindow( BreakpointWindow *pBPWindow ){ pBreakpointWindow = pBPWindow; }\n    BreakpointWindow    *GetBreakpointWindow(){ return pBreakpointWindow; }\n\n    DATA_FUNC_DEF( aEdit, TextEditImp )\n\n    virtual void BuildKontextMenu( PopupMenu *&pMenu );\n\n    void SaveAsUTF8( BOOL bUTF8 ) { bSaveAsUTF8 = bUTF8; }\n};\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: sbunoobj.hxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: rt $ $Date: 2005-01-28 16:08:01 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef SB_UNO_OBJ\n#define SB_UNO_OBJ\n\n#ifndef _SBX_SBXOBJECT_HXX \/\/autogen\n#include <svtools\/sbxobj.hxx>\n#endif\n#ifndef __SBX_SBXMETHOD_HXX \/\/autogen\n#include <svtools\/sbxmeth.hxx>\n#endif\n#ifndef __SBX_SBXPROPERTY_HXX \/\/autogen\n#include <svtools\/sbxprop.hxx>\n#endif\n#ifndef __SBX_SBX_FACTORY_HXX \/\/autogen\n#include <svtools\/sbxfac.hxx>\n#endif\n#ifndef __SBX_SBX_HXX \/\/autogen\n#include <svtools\/sbx.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_XMATERIALHOLDER_HPP_\n#include <com\/sun\/star\/beans\/XMaterialHolder.hpp>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_XEXACTNAME_HPP_\n#include <com\/sun\/star\/beans\/XExactName.hpp>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_XINTROSPECTIONACCESS_HPP_\n#include <com\/sun\/star\/beans\/XIntrospectionAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_XINTROSPECTION_HPP_\n#include <com\/sun\/star\/beans\/XIntrospection.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SCRIPT_XINVOCATION_HPP_\n#include <com\/sun\/star\/script\/XInvocation.hpp>\n#endif\n#ifndef _COM_SUN_STAR_REFLECTION_XIDLCLASS_HPP_\n#include <com\/sun\/star\/reflection\/XIdlClass.hpp>\n#endif\n#ifndef _RTL_USTRING_\n#include <rtl\/ustring>\n#endif\n\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::beans;\nusing namespace com::sun::star::script;\nusing namespace com::sun::star::reflection;\n\nclass SbUnoObject: public SbxObject\n{\n    Reference< XIntrospectionAccess > mxUnoAccess;\n    Reference< XMaterialHolder > mxMaterialHolder;\n    Reference< XInvocation > mxInvocation;\n    Reference< XExactName > mxExactName;\n    BOOL bNeedIntrospection;\n    Any maTmpUnoObj;    \/\/ Only to save obj for doIntrospection!\n\n    \/\/ Hilfs-Methode zum Anlegen der dbg_-Properties\n    void implCreateDbgProperties( void );\n\n    \/\/ Hilfs-Methode zum Anlegen aller Properties und Methoden\n    \/\/ (Beim on-demand-Mechanismus erforderlich fuer die dbg_-Properties)\n    void implCreateAll( void );\n\npublic:\n    TYPEINFO();\n    SbUnoObject( const String& aName, const Any& aUnoObj_ );\n    ~SbUnoObject();\n\n    \/\/ #76470 Introspection on Demand durchfuehren\n    void doIntrospection( void );\n\n    \/\/ Find ueberladen, um z.B. NameAccess zu unterstuetzen\n    virtual SbxVariable* Find( const String&, SbxClassType );\n\n    \/\/ Force creation of all properties for debugging\n    void createAllProperties( void  )\n        { implCreateAll(); }\n\n    \/\/ Wert rausgeben\n    Any getUnoAny( void );\n    Reference< XIntrospectionAccess > getIntrospectionAccess( void )    { return mxUnoAccess; }\n    Reference< XInvocation > getInvocation( void )          { return mxInvocation; }\n\n    void SFX_NOTIFY( SfxBroadcaster&, const TypeId&, const SfxHint& rHint, const TypeId& );\n};\nSV_DECL_IMPL_REF(SbUnoObject);\n\n\n\/\/ #67781 Rueckgabewerte der Uno-Methoden loeschen\nvoid clearUnoMethods( void );\n\nclass SbUnoMethod : public SbxMethod\n{\n    friend class SbUnoObject;\n    friend void clearUnoMethods( void );\n\n    Reference< XIdlMethod > m_xUnoMethod;\n    Sequence<ParamInfo>* pParamInfoSeq;\n\n    \/\/ #67781 Verweis auf vorige und naechste Methode in der Methoden-Liste\n    SbUnoMethod* pPrev;\n    SbUnoMethod* pNext;\n\npublic:\n    TYPEINFO();\n\n    SbUnoMethod( const String& aName, SbxDataType eSbxType, Reference< XIdlMethod > xUnoMethod_ );\n    virtual ~SbUnoMethod();\n    virtual SbxInfo* GetInfo();\n\n    const Sequence<ParamInfo>& getParamInfos( void );\n};\n\n\nclass SbUnoProperty : public SbxProperty\n{\n    friend class SbUnoObject;\n\n    \/\/ Daten der Uno-Property\n    Property aUnoProp;\n    UINT32 nId;\n\n    virtual ~SbUnoProperty();\npublic:\n    TYPEINFO();\n    SbUnoProperty( const String& aName, SbxDataType eSbxType,\n        const Property& aUnoProp_, UINT32 nId_ );\n};\n\n\/\/ Factory-Klasse fuer das Anlegen von Uno-Structs per DIM AS NEW\nclass SbUnoFactory : public SbxFactory\n{\npublic:\n    virtual SbxBase* Create( UINT16 nSbxId, UINT32 = SBXCR_SBX );\n    virtual SbxObject* CreateObject( const String& );\n};\n\n\/\/ Wrapper fuer eine Uno-Klasse\nclass SbUnoClass: public SbxObject\n{\n    const Reference< XIdlClass >    m_xClass;\n\npublic:\n    TYPEINFO();\n    SbUnoClass( const String& aName )\n        : SbxObject( aName )\n    {}\n    SbUnoClass( const String& aName, const Reference< XIdlClass >& xClass_ )\n        : SbxObject( aName )\n        , m_xClass( xClass_ )\n    {}\n    \/\/~SbUnoClass();\n\n    \/\/ Find ueberladen, um Elemente on Demand anzulegen\n    virtual SbxVariable* Find( const String&, SbxClassType );\n\n    \/\/ Wert rausgeben\n    const Reference< XIdlClass >& getUnoClass( void ) { return m_xClass; }\n\n    \/\/void SFX_NOTIFY( SfxBroadcaster&, const TypeId&, const SfxHint& rHint, const TypeId& );\n};\nSV_DECL_IMPL_REF(SbUnoClass);\n\n\n\/\/ Funktion, um einen globalen Bezeichner im\n\/\/ UnoScope zu suchen und fuer Sbx zu wrappen\nSbxVariable* findUnoClass( const String& rName );\n\n\n\/\/ #105565 Special Object to wrap a strongly typed Uno Any\nclass SbUnoAnyObject: public SbxObject\n{\n    Any     mVal;\n\npublic:\n    SbUnoAnyObject( const Any& rVal )\n        : SbxObject( String() )\n        , mVal( rVal )\n    {}\n\n    const Any& getValue( void )\n        { return mVal; }\n\n    TYPEINFO();\n};\n\n\n\/\/ #112509 Special SbxArray to transport named parameters for calls\n\/\/ to OLEAutomation objects through the UNO OLE automation bridge\n\nclass AutomationNamedArgsSbxArray : public SbxArray\n{\n    Sequence< ::rtl::OUString >     maNameSeq;\npublic:\n    TYPEINFO();\n    AutomationNamedArgsSbxArray( sal_Int32 nSeqSize )\n        : maNameSeq( nSeqSize )\n    {}\n\n    Sequence< ::rtl::OUString >& getNames( void )\n        { return maNameSeq; }\n};\n\n\nclass StarBASIC;\n\n\/\/ Impl-Methoden fuer RTL\nvoid RTL_Impl_CreateUnoStruct( StarBASIC* pBasic, SbxArray& rPar, BOOL bWrite );\nvoid RTL_Impl_CreateUnoService( StarBASIC* pBasic, SbxArray& rPar, BOOL bWrite );\nvoid RTL_Impl_CreateUnoValue( StarBASIC* pBasic, SbxArray& rPar, BOOL bWrite );\nvoid RTL_Impl_GetProcessServiceManager( StarBASIC* pBasic, SbxArray& rPar, BOOL bWrite );\nvoid RTL_Impl_HasInterfaces( StarBASIC* pBasic, SbxArray& rPar, BOOL bWrite );\nvoid RTL_Impl_IsUnoStruct( StarBASIC* pBasic, SbxArray& rPar, BOOL bWrite );\nvoid RTL_Impl_EqualUnoObjects( StarBASIC* pBasic, SbxArray& rPar, BOOL bWrite );\nvoid RTL_Impl_GetDefaultContext( StarBASIC* pBasic, SbxArray& rPar, BOOL bWrite );\n\n\n\/\/========================================================================\n\/\/ #118116 Collection object\n\nclass BasicCollection : public SbxObject\n{\n    friend class SbiRuntime;\n    SbxArrayRef xItemArray;\n\n    void Initialize();\n    virtual ~BasicCollection();\n    virtual void SFX_NOTIFY( SfxBroadcaster& rBC, const TypeId& rBCType,\n                             const SfxHint& rHint, const TypeId& rHintType );\n    INT32 implGetIndex( SbxVariable* pIndexVar );\n    INT32 implGetIndexForName( const String& rName );\n    void CollAdd( SbxArray* pPar );\n    void CollItem( SbxArray* pPar );\n    void CollRemove( SbxArray* pPar );\n\npublic:\n    TYPEINFO();\n    BasicCollection( const String& rClassname );\n    virtual SbxVariable* Find( const String&, SbxClassType );\n    virtual void Clear();\n};\n\n#endif\n\n\n<commit_msg>INTEGRATION: CWS visibility03 (1.9.8); FILE MERGED 2005\/03\/24 18:01:20 mhu 1.9.8.1: #i45006# Adapted to moved sbx headers.<commit_after>\/*************************************************************************\n *\n *  $RCSfile: sbunoobj.hxx,v $\n *\n *  $Revision: 1.10 $\n *\n *  last change: $Author: obo $ $Date: 2005-04-13 09:13:44 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef SB_UNO_OBJ\n#define SB_UNO_OBJ\n\n#ifndef _SBX_SBXOBJECT_HXX \/\/autogen\n#include <sbxobj.hxx>\n#endif\n#ifndef __SBX_SBXMETHOD_HXX \/\/autogen\n#include <sbxmeth.hxx>\n#endif\n#ifndef __SBX_SBXPROPERTY_HXX \/\/autogen\n#include <sbxprop.hxx>\n#endif\n#ifndef __SBX_SBX_FACTORY_HXX \/\/autogen\n#include <sbxfac.hxx>\n#endif\n#ifndef __SBX_SBX_HXX \/\/autogen\n#include <sbx.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_XMATERIALHOLDER_HPP_\n#include <com\/sun\/star\/beans\/XMaterialHolder.hpp>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_XEXACTNAME_HPP_\n#include <com\/sun\/star\/beans\/XExactName.hpp>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_XINTROSPECTIONACCESS_HPP_\n#include <com\/sun\/star\/beans\/XIntrospectionAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_XINTROSPECTION_HPP_\n#include <com\/sun\/star\/beans\/XIntrospection.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SCRIPT_XINVOCATION_HPP_\n#include <com\/sun\/star\/script\/XInvocation.hpp>\n#endif\n#ifndef _COM_SUN_STAR_REFLECTION_XIDLCLASS_HPP_\n#include <com\/sun\/star\/reflection\/XIdlClass.hpp>\n#endif\n#ifndef _RTL_USTRING_\n#include <rtl\/ustring>\n#endif\n\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::beans;\nusing namespace com::sun::star::script;\nusing namespace com::sun::star::reflection;\n\nclass SbUnoObject: public SbxObject\n{\n    Reference< XIntrospectionAccess > mxUnoAccess;\n    Reference< XMaterialHolder > mxMaterialHolder;\n    Reference< XInvocation > mxInvocation;\n    Reference< XExactName > mxExactName;\n    BOOL bNeedIntrospection;\n    Any maTmpUnoObj;    \/\/ Only to save obj for doIntrospection!\n\n    \/\/ Hilfs-Methode zum Anlegen der dbg_-Properties\n    void implCreateDbgProperties( void );\n\n    \/\/ Hilfs-Methode zum Anlegen aller Properties und Methoden\n    \/\/ (Beim on-demand-Mechanismus erforderlich fuer die dbg_-Properties)\n    void implCreateAll( void );\n\npublic:\n    TYPEINFO();\n    SbUnoObject( const String& aName, const Any& aUnoObj_ );\n    ~SbUnoObject();\n\n    \/\/ #76470 Introspection on Demand durchfuehren\n    void doIntrospection( void );\n\n    \/\/ Find ueberladen, um z.B. NameAccess zu unterstuetzen\n    virtual SbxVariable* Find( const String&, SbxClassType );\n\n    \/\/ Force creation of all properties for debugging\n    void createAllProperties( void  )\n        { implCreateAll(); }\n\n    \/\/ Wert rausgeben\n    Any getUnoAny( void );\n    Reference< XIntrospectionAccess > getIntrospectionAccess( void )    { return mxUnoAccess; }\n    Reference< XInvocation > getInvocation( void )          { return mxInvocation; }\n\n    void SFX_NOTIFY( SfxBroadcaster&, const TypeId&, const SfxHint& rHint, const TypeId& );\n};\nSV_DECL_IMPL_REF(SbUnoObject);\n\n\n\/\/ #67781 Rueckgabewerte der Uno-Methoden loeschen\nvoid clearUnoMethods( void );\n\nclass SbUnoMethod : public SbxMethod\n{\n    friend class SbUnoObject;\n    friend void clearUnoMethods( void );\n\n    Reference< XIdlMethod > m_xUnoMethod;\n    Sequence<ParamInfo>* pParamInfoSeq;\n\n    \/\/ #67781 Verweis auf vorige und naechste Methode in der Methoden-Liste\n    SbUnoMethod* pPrev;\n    SbUnoMethod* pNext;\n\npublic:\n    TYPEINFO();\n\n    SbUnoMethod( const String& aName, SbxDataType eSbxType, Reference< XIdlMethod > xUnoMethod_ );\n    virtual ~SbUnoMethod();\n    virtual SbxInfo* GetInfo();\n\n    const Sequence<ParamInfo>& getParamInfos( void );\n};\n\n\nclass SbUnoProperty : public SbxProperty\n{\n    friend class SbUnoObject;\n\n    \/\/ Daten der Uno-Property\n    Property aUnoProp;\n    UINT32 nId;\n\n    virtual ~SbUnoProperty();\npublic:\n    TYPEINFO();\n    SbUnoProperty( const String& aName, SbxDataType eSbxType,\n        const Property& aUnoProp_, UINT32 nId_ );\n};\n\n\/\/ Factory-Klasse fuer das Anlegen von Uno-Structs per DIM AS NEW\nclass SbUnoFactory : public SbxFactory\n{\npublic:\n    virtual SbxBase* Create( UINT16 nSbxId, UINT32 = SBXCR_SBX );\n    virtual SbxObject* CreateObject( const String& );\n};\n\n\/\/ Wrapper fuer eine Uno-Klasse\nclass SbUnoClass: public SbxObject\n{\n    const Reference< XIdlClass >    m_xClass;\n\npublic:\n    TYPEINFO();\n    SbUnoClass( const String& aName )\n        : SbxObject( aName )\n    {}\n    SbUnoClass( const String& aName, const Reference< XIdlClass >& xClass_ )\n        : SbxObject( aName )\n        , m_xClass( xClass_ )\n    {}\n    \/\/~SbUnoClass();\n\n    \/\/ Find ueberladen, um Elemente on Demand anzulegen\n    virtual SbxVariable* Find( const String&, SbxClassType );\n\n    \/\/ Wert rausgeben\n    const Reference< XIdlClass >& getUnoClass( void ) { return m_xClass; }\n\n    \/\/void SFX_NOTIFY( SfxBroadcaster&, const TypeId&, const SfxHint& rHint, const TypeId& );\n};\nSV_DECL_IMPL_REF(SbUnoClass);\n\n\n\/\/ Funktion, um einen globalen Bezeichner im\n\/\/ UnoScope zu suchen und fuer Sbx zu wrappen\nSbxVariable* findUnoClass( const String& rName );\n\n\n\/\/ #105565 Special Object to wrap a strongly typed Uno Any\nclass SbUnoAnyObject: public SbxObject\n{\n    Any     mVal;\n\npublic:\n    SbUnoAnyObject( const Any& rVal )\n        : SbxObject( String() )\n        , mVal( rVal )\n    {}\n\n    const Any& getValue( void )\n        { return mVal; }\n\n    TYPEINFO();\n};\n\n\n\/\/ #112509 Special SbxArray to transport named parameters for calls\n\/\/ to OLEAutomation objects through the UNO OLE automation bridge\n\nclass AutomationNamedArgsSbxArray : public SbxArray\n{\n    Sequence< ::rtl::OUString >     maNameSeq;\npublic:\n    TYPEINFO();\n    AutomationNamedArgsSbxArray( sal_Int32 nSeqSize )\n        : maNameSeq( nSeqSize )\n    {}\n\n    Sequence< ::rtl::OUString >& getNames( void )\n        { return maNameSeq; }\n};\n\n\nclass StarBASIC;\n\n\/\/ Impl-Methoden fuer RTL\nvoid RTL_Impl_CreateUnoStruct( StarBASIC* pBasic, SbxArray& rPar, BOOL bWrite );\nvoid RTL_Impl_CreateUnoService( StarBASIC* pBasic, SbxArray& rPar, BOOL bWrite );\nvoid RTL_Impl_CreateUnoValue( StarBASIC* pBasic, SbxArray& rPar, BOOL bWrite );\nvoid RTL_Impl_GetProcessServiceManager( StarBASIC* pBasic, SbxArray& rPar, BOOL bWrite );\nvoid RTL_Impl_HasInterfaces( StarBASIC* pBasic, SbxArray& rPar, BOOL bWrite );\nvoid RTL_Impl_IsUnoStruct( StarBASIC* pBasic, SbxArray& rPar, BOOL bWrite );\nvoid RTL_Impl_EqualUnoObjects( StarBASIC* pBasic, SbxArray& rPar, BOOL bWrite );\nvoid RTL_Impl_GetDefaultContext( StarBASIC* pBasic, SbxArray& rPar, BOOL bWrite );\n\n\n\/\/========================================================================\n\/\/ #118116 Collection object\n\nclass BasicCollection : public SbxObject\n{\n    friend class SbiRuntime;\n    SbxArrayRef xItemArray;\n\n    void Initialize();\n    virtual ~BasicCollection();\n    virtual void SFX_NOTIFY( SfxBroadcaster& rBC, const TypeId& rBCType,\n                             const SfxHint& rHint, const TypeId& rHintType );\n    INT32 implGetIndex( SbxVariable* pIndexVar );\n    INT32 implGetIndexForName( const String& rName );\n    void CollAdd( SbxArray* pPar );\n    void CollItem( SbxArray* pPar );\n    void CollRemove( SbxArray* pPar );\n\npublic:\n    TYPEINFO();\n    BasicCollection( const String& rClassname );\n    virtual SbxVariable* Find( const String&, SbxClassType );\n    virtual void Clear();\n};\n\n#endif\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#include <activemq\/util\/Config.h>\n\n#if defined(HAVE_WINSOCK2_H)\n    #include <Winsock2.h>\n    #include <Ws2tcpip.h>\n    #include <sys\/stat.h>\n    #define stat _stat\n#else\n    #include <unistd.h>\n    #include <netdb.h>\n    #include <fcntl.h>\n    #include <sys\/file.h>\n    #include <sys\/socket.h>\n    #include <netinet\/in.h>\n    #include <arpa\/inet.h>\n    #include <string.h>\n#endif\n\n#ifndef SHUT_RDWR\n    #define SHUT_RDWR 2 \/\/ Winsock2 doesn't seem to define this\n#endif\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <stdarg.h>\n#include <ctype.h>\n#include <sys\/types.h>\n\n#include \"TcpSocket.h\"\n#include \"SocketInputStream.h\"\n#include \"SocketOutputStream.h\"\n#include \"SocketError.h\"\n\nusing namespace activemq::network;\nusing namespace activemq::io;\n\n#if defined(HAVE_WINSOCK2_H)\n\n    \/\/ Static socket initializer needed for winsock\n\n    TcpSocket::StaticSocketInitializer::StaticSocketInitializer() {\n        socketInitError = NULL;\n        const WORD version_needed = MAKEWORD(2,2); \/\/ lo-order byte: major version\n        WSAData temp;\n        if( WSAStartup( version_needed, &temp ) ){\n           clear();\n           socketInitError = new SocketException ( __FILE__, __LINE__,\n               \"winsock.dll was not found\");\n        }\n    }\n    TcpSocket::StaticSocketInitializer::~StaticSocketInitializer() {\n        clear();\n        WSACleanup();\n    }\n\n    \/\/ Create static instance of the socket initializer.\n    TcpSocket::StaticSocketInitializer TcpSocket::staticSocketInitializer;\n\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nTcpSocket::TcpSocket() throw (SocketException)\n:\n    socketHandle( INVALID_SOCKET_HANDLE ),\n    inputStream( NULL ),\n    outputStream( NULL )\n{\n\n    try {\n\n#if defined(HAVE_WINSOCK2_H)\n        if( staticSocketInitializer.getSocketInitError() != NULL ) {\n            throw *staticSocketInitializer.getSocketInitError();\n        }\n#endif\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nTcpSocket::TcpSocket( SocketHandle socketHandle )\n:\n    socketHandle( INVALID_SOCKET_HANDLE ),\n    inputStream( NULL ),\n    outputStream( NULL )\n{\n    try {\n\n#if defined(HAVE_WINSOCK2_H)\n        if( staticSocketInitializer.getSocketInitError() != NULL ) {\n            throw *staticSocketInitializer.getSocketInitError();\n        }\n#endif\n\n        this->socketHandle = socketHandle;\n        this->inputStream = new SocketInputStream( socketHandle );\n        this->outputStream = new SocketOutputStream( socketHandle );\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nTcpSocket::~TcpSocket()\n{\n    \/\/ No shutdown, just close - dont want blocking destructor.\n    close();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nInputStream* TcpSocket::getInputStream(){\n    return inputStream;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nOutputStream* TcpSocket::getOutputStream(){\n    return outputStream;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid TcpSocket::connect(const char* host, int port) throw ( SocketException )\n{\n    try{\n\n        if( isConnected() ) {\n            throw SocketException( __FILE__, __LINE__,\n                \"Socket::connect - Socket already connected.  host: %s, port: %d\", host, port );\n        }\n\n        \/\/ Create the socket.\n        checkResult( (int)(socketHandle = ::socket(AF_INET, SOCK_STREAM, 0)) );\n\n        \/\/ Check port value.\n        if (port <= 0 || port > 65535) {\n            close();\n            throw SocketException ( __FILE__, __LINE__,\n                \"Socket::connect- Port out of range: %d\", port );\n        }\n\n#ifdef SO_NOSIGPIPE \/\/ Don't want to get a SIGPIPE on FreeBSD and Mac OS X\n\n        int optval = 1;\n        checkResult( ::setsockopt( socketHandle, SOL_SOCKET, SO_NOSIGPIPE, (char*)&optval, sizeof(optval)) );\n\n#endif\n\n        sockaddr_in target_addr;\n        target_addr.sin_family = AF_INET;\n        target_addr.sin_port = htons( ( short ) port );\n        target_addr.sin_addr.s_addr = 0; \/\/ To be set later down...\n        memset( &target_addr.sin_zero, 0, sizeof( target_addr.sin_zero ) );\n\n        \/\/ Resolve name\n#if defined(HAVE_STRUCT_ADDRINFO)\n        addrinfo hints;\n        memset(&hints, 0, sizeof(addrinfo));\n        hints.ai_family = PF_INET;\n        struct addrinfo *res_ptr = NULL;\n\n        checkResult( ::getaddrinfo( host, NULL, &hints, &res_ptr ) );\n\n        assert(res_ptr->ai_addr->sa_family == AF_INET);\n        \/\/ Porting: On both 32bit and 64 bit systems that we compile to soo far, sin_addr\n        \/\/ is a 32 bit value, not an unsigned long.\n        assert( sizeof( ( ( sockaddr_in* )res_ptr->ai_addr )->sin_addr.s_addr ) == 4 );\n        target_addr.sin_addr.s_addr = ( ( sockaddr_in* )res_ptr->ai_addr )->sin_addr.s_addr;\n        freeaddrinfo( res_ptr );\n#else\n        struct ::hostent *he = ::gethostbyname(host);\n        if( he == NULL ) {\n            throw SocketException( __FILE__, __LINE__, \"Failed to resolve hostname\" );\n        }\n        target_addr.sin_addr.s_addr = *((in_addr_t *)he->h_addr);\n#endif\n\n        \/\/ Attempt the connection to the server.\n        checkResult( ::connect( socketHandle,\n                            ( const sockaddr * )&target_addr,\n                            sizeof( target_addr ) ) );\n\n        \/\/ Create an input\/output stream for this socket.\n        inputStream = new SocketInputStream( socketHandle );\n        outputStream = new SocketOutputStream( socketHandle );\n\n    }\n    catch( SocketException& ex ) {\n        ex.setMark( __FILE__, __LINE__);\n        try{ close(); } catch( cms::CMSException& cx){ \/* Absorb *\/ }\n        throw ex;\n    }\n    catch( ... ){\n        try{ close(); } catch( cms::CMSException& cx){ \/* Absorb *\/ }\n        throw SocketException( __FILE__, __LINE__, \"connect() caught unknown exception\");\n    }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid TcpSocket::close() throw( cms::CMSException )\n{\n    \/\/ Destroy the input stream.\n    if( inputStream != NULL ){\n        delete inputStream;\n        inputStream = NULL;\n    }\n\n    \/\/ Destroy the output stream.\n    if( outputStream != NULL ){\n        delete outputStream;\n        outputStream = NULL;\n    }\n\n    if( isConnected() )\n    {\n        ::shutdown( socketHandle, SHUT_RDWR );\n\n        #if !defined(HAVE_WINSOCK2_H)\n            ::close( socketHandle );\n        #else\n           ::closesocket( socketHandle );\n        #endif\n\n       socketHandle = INVALID_SOCKET_HANDLE;\n    }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint TcpSocket::getSoLinger() const throw( SocketException ){\n\n   try{\n        linger value;\n        socklen_t length = sizeof( value );\n        checkResult(::getsockopt( socketHandle, SOL_SOCKET, SO_LINGER, (char*)&value, &length ));\n\n        return value.l_onoff? value.l_linger : 0;\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid TcpSocket::setSoLinger( int dolinger ) throw( SocketException ){\n\n    try{\n        linger value;\n        value.l_onoff = dolinger != 0;\n        value.l_linger = dolinger;\n        checkResult(::setsockopt( socketHandle, SOL_SOCKET, SO_LINGER, (char*)&value, sizeof(value) ));\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool TcpSocket::getKeepAlive() const throw( SocketException ){\n\n    try{\n        int value;\n        socklen_t length = sizeof( int );\n        checkResult(::getsockopt( socketHandle, SOL_SOCKET, SO_KEEPALIVE, (char*)&value, &length ));\n        return value != 0;\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid TcpSocket::setKeepAlive( const bool keepAlive ) throw( SocketException ){\n\n    try{\n        int value = keepAlive? 1 : 0;\n        checkResult(::setsockopt(socketHandle, SOL_SOCKET, SO_KEEPALIVE, (char*)&value, sizeof(int)) );\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint TcpSocket::getReceiveBufferSize() const throw( SocketException ){\n\n    try{\n        int value;\n        socklen_t length = sizeof( value );\n        checkResult(::getsockopt( socketHandle, SOL_SOCKET, SO_RCVBUF, (char*)&value, &length ));\n        return value;\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid TcpSocket::setReceiveBufferSize( int size ) throw( SocketException ){\n\n    try{\n        checkResult(::setsockopt( socketHandle, SOL_SOCKET, SO_RCVBUF, (char*)&size, sizeof(size) ));\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool TcpSocket::getReuseAddress() const throw( SocketException ){\n\n    try{\n        int value;\n        socklen_t length = sizeof( int );\n        checkResult(::getsockopt( socketHandle, SOL_SOCKET, SO_REUSEADDR, (char*)&value, &length ));\n        return value != 0;\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid TcpSocket::setReuseAddress( bool reuse ) throw( SocketException ){\n\n    try{\n        int value = reuse? 1 : 0;\n        checkResult(::setsockopt( socketHandle, SOL_SOCKET, SO_REUSEADDR, (char*)&value, sizeof(int) ));\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint TcpSocket::getSendBufferSize() const throw( SocketException ){\n\n    try{\n        int value;\n        socklen_t length = sizeof( value );\n        checkResult(::getsockopt( socketHandle, SOL_SOCKET, SO_SNDBUF, (char*)&value, &length ));\n        return value;\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid TcpSocket::setSendBufferSize( int size ) throw( SocketException ){\n\n    try{\n        checkResult(::setsockopt( socketHandle, SOL_SOCKET, SO_SNDBUF, (char*)&size, sizeof(size) ));\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid TcpSocket::setSoTimeout ( const int millisecs ) throw ( SocketException )\n{\n    try{\n\n#if !defined(HAVE_WINSOCK2_H)\n        timeval timot;\n        timot.tv_sec = millisecs \/ 1000;\n        timot.tv_usec = (millisecs % 1000) * 1000;\n#else\n        int timot = millisecs;\n#endif\n\n        checkResult(::setsockopt( socketHandle, SOL_SOCKET, SO_RCVTIMEO, (const char*) &timot, sizeof (timot) ));\n        checkResult(::setsockopt( socketHandle, SOL_SOCKET, SO_SNDTIMEO, (const char*) &timot, sizeof (timot) ));\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint TcpSocket::getSoTimeout() const throw( SocketException )\n{\n    try{\n\n#if !defined(HAVE_WINSOCK2_H)\n        timeval timot;\n        timot.tv_sec = 0;\n        timot.tv_usec = 0;\n        socklen_t size = sizeof(timot);\n#else\n        int timot = 0;\n        int size = sizeof(timot);\n#endif\n\n        checkResult(::getsockopt(socketHandle, SOL_SOCKET, SO_RCVTIMEO, (char*) &timot, &size));\n\n#if !defined(HAVE_WINSOCK2_H)\n        return (timot.tv_sec * 1000) + (timot.tv_usec \/ 1000);\n#else\n        return timot;\n#endif\n\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool TcpSocket::getTcpNoDelay() const throw ( cms::CMSException ) {\n    return false;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid TcpSocket::setTcpNoDelay( bool value ) throw ( cms::CMSException ) {\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid TcpSocket::checkResult( int value ) const throw (SocketException) {\n\n    if( value < 0 ){\n        throw SocketException( __FILE__, __LINE__,\n            SocketError::getErrorString().c_str() );\n    }\n}\n\n\n<commit_msg>http:\/\/issues.apache.org\/activemq\/browse\/AMQCPP-101<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#include <activemq\/util\/Config.h>\n\n#if defined(HAVE_WINSOCK2_H)\n    #include <Winsock2.h>\n    #include <Ws2tcpip.h>\n    #include <sys\/stat.h>\n    #define stat _stat\n#else\n    #include <unistd.h>\n    #include <netdb.h>\n    #include <fcntl.h>\n    #include <sys\/file.h>\n    #include <sys\/socket.h>\n    #include <netinet\/in.h>\n    #include <arpa\/inet.h>\n    #include <string.h>\n    #include <netinet\/tcp.h>\n#endif\n\n#ifndef SHUT_RDWR\n    #define SHUT_RDWR 2 \/\/ Winsock2 doesn't seem to define this\n#endif\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <stdarg.h>\n#include <ctype.h>\n#include <sys\/types.h>\n\n#include \"TcpSocket.h\"\n#include \"SocketInputStream.h\"\n#include \"SocketOutputStream.h\"\n#include \"SocketError.h\"\n\nusing namespace activemq::network;\nusing namespace activemq::io;\n\n#if defined(HAVE_WINSOCK2_H)\n\n    \/\/ Static socket initializer needed for winsock\n\n    TcpSocket::StaticSocketInitializer::StaticSocketInitializer() {\n        socketInitError = NULL;\n        const WORD version_needed = MAKEWORD(2,2); \/\/ lo-order byte: major version\n        WSAData temp;\n        if( WSAStartup( version_needed, &temp ) ){\n           clear();\n           socketInitError = new SocketException ( __FILE__, __LINE__,\n               \"winsock.dll was not found\");\n        }\n    }\n    TcpSocket::StaticSocketInitializer::~StaticSocketInitializer() {\n        clear();\n        WSACleanup();\n    }\n\n    \/\/ Create static instance of the socket initializer.\n    TcpSocket::StaticSocketInitializer TcpSocket::staticSocketInitializer;\n\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nTcpSocket::TcpSocket() throw (SocketException)\n:\n    socketHandle( INVALID_SOCKET_HANDLE ),\n    inputStream( NULL ),\n    outputStream( NULL )\n{\n\n    try {\n\n#if defined(HAVE_WINSOCK2_H)\n        if( staticSocketInitializer.getSocketInitError() != NULL ) {\n            throw *staticSocketInitializer.getSocketInitError();\n        }\n#endif\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nTcpSocket::TcpSocket( SocketHandle socketHandle )\n:\n    socketHandle( INVALID_SOCKET_HANDLE ),\n    inputStream( NULL ),\n    outputStream( NULL )\n{\n    try {\n\n#if defined(HAVE_WINSOCK2_H)\n        if( staticSocketInitializer.getSocketInitError() != NULL ) {\n            throw *staticSocketInitializer.getSocketInitError();\n        }\n#endif\n\n        this->socketHandle = socketHandle;\n        this->inputStream = new SocketInputStream( socketHandle );\n        this->outputStream = new SocketOutputStream( socketHandle );\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nTcpSocket::~TcpSocket()\n{\n    \/\/ No shutdown, just close - dont want blocking destructor.\n    close();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nInputStream* TcpSocket::getInputStream(){\n    return inputStream;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nOutputStream* TcpSocket::getOutputStream(){\n    return outputStream;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid TcpSocket::connect(const char* host, int port) throw ( SocketException )\n{\n    try{\n\n        if( isConnected() ) {\n            throw SocketException( __FILE__, __LINE__,\n                \"Socket::connect - Socket already connected.  host: %s, port: %d\", host, port );\n        }\n\n        \/\/ Create the socket.\n        checkResult( (int)(socketHandle = ::socket(AF_INET, SOCK_STREAM, 0)) );\n\n        \/\/ Check port value.\n        if (port <= 0 || port > 65535) {\n            close();\n            throw SocketException ( __FILE__, __LINE__,\n                \"Socket::connect- Port out of range: %d\", port );\n        }\n\n#ifdef SO_NOSIGPIPE \/\/ Don't want to get a SIGPIPE on FreeBSD and Mac OS X\n\n        int optval = 1;\n        checkResult( ::setsockopt( socketHandle, SOL_SOCKET, SO_NOSIGPIPE, (char*)&optval, sizeof(optval)) );\n\n#endif\n\n        sockaddr_in target_addr;\n        target_addr.sin_family = AF_INET;\n        target_addr.sin_port = htons( ( short ) port );\n        target_addr.sin_addr.s_addr = 0; \/\/ To be set later down...\n        memset( &target_addr.sin_zero, 0, sizeof( target_addr.sin_zero ) );\n\n        \/\/ Resolve name\n#if defined(HAVE_STRUCT_ADDRINFO)\n        addrinfo hints;\n        memset(&hints, 0, sizeof(addrinfo));\n        hints.ai_family = PF_INET;\n        struct addrinfo *res_ptr = NULL;\n\n        checkResult( ::getaddrinfo( host, NULL, &hints, &res_ptr ) );\n\n        assert(res_ptr->ai_addr->sa_family == AF_INET);\n        \/\/ Porting: On both 32bit and 64 bit systems that we compile to soo far, sin_addr\n        \/\/ is a 32 bit value, not an unsigned long.\n        assert( sizeof( ( ( sockaddr_in* )res_ptr->ai_addr )->sin_addr.s_addr ) == 4 );\n        target_addr.sin_addr.s_addr = ( ( sockaddr_in* )res_ptr->ai_addr )->sin_addr.s_addr;\n        freeaddrinfo( res_ptr );\n#else\n        struct ::hostent *he = ::gethostbyname(host);\n        if( he == NULL ) {\n            throw SocketException( __FILE__, __LINE__, \"Failed to resolve hostname\" );\n        }\n        target_addr.sin_addr.s_addr = *((in_addr_t *)he->h_addr);\n#endif\n\n        \/\/ Attempt the connection to the server.\n        checkResult( ::connect( socketHandle,\n                            ( const sockaddr * )&target_addr,\n                            sizeof( target_addr ) ) );\n\n        \/\/ Create an input\/output stream for this socket.\n        inputStream = new SocketInputStream( socketHandle );\n        outputStream = new SocketOutputStream( socketHandle );\n\n    }\n    catch( SocketException& ex ) {\n        ex.setMark( __FILE__, __LINE__);\n        try{ close(); } catch( cms::CMSException& cx){ \/* Absorb *\/ }\n        throw ex;\n    }\n    catch( ... ){\n        try{ close(); } catch( cms::CMSException& cx){ \/* Absorb *\/ }\n        throw SocketException( __FILE__, __LINE__, \"connect() caught unknown exception\");\n    }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid TcpSocket::close() throw( cms::CMSException )\n{\n    \/\/ Destroy the input stream.\n    if( inputStream != NULL ){\n        delete inputStream;\n        inputStream = NULL;\n    }\n\n    \/\/ Destroy the output stream.\n    if( outputStream != NULL ){\n        delete outputStream;\n        outputStream = NULL;\n    }\n\n    if( isConnected() )\n    {\n        ::shutdown( socketHandle, SHUT_RDWR );\n\n        #if !defined(HAVE_WINSOCK2_H)\n            ::close( socketHandle );\n        #else\n           ::closesocket( socketHandle );\n        #endif\n\n       socketHandle = INVALID_SOCKET_HANDLE;\n    }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint TcpSocket::getSoLinger() const throw( SocketException ){\n\n   try{\n        linger value;\n        socklen_t length = sizeof( value );\n        checkResult(::getsockopt( socketHandle, SOL_SOCKET, SO_LINGER, (char*)&value, &length ));\n\n        return value.l_onoff? value.l_linger : 0;\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid TcpSocket::setSoLinger( int dolinger ) throw( SocketException ){\n\n    try{\n        linger value;\n        value.l_onoff = dolinger != 0;\n        value.l_linger = dolinger;\n        checkResult(::setsockopt( socketHandle, SOL_SOCKET, SO_LINGER, (char*)&value, sizeof(value) ));\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool TcpSocket::getKeepAlive() const throw( SocketException ){\n\n    try{\n        int value;\n        socklen_t length = sizeof( int );\n        checkResult(::getsockopt( socketHandle, SOL_SOCKET, SO_KEEPALIVE, (char*)&value, &length ));\n        return value != 0;\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid TcpSocket::setKeepAlive( const bool keepAlive ) throw( SocketException ){\n\n    try{\n        int value = keepAlive? 1 : 0;\n        checkResult(::setsockopt(socketHandle, SOL_SOCKET, SO_KEEPALIVE, (char*)&value, sizeof(int)) );\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint TcpSocket::getReceiveBufferSize() const throw( SocketException ){\n\n    try{\n        int value;\n        socklen_t length = sizeof( value );\n        checkResult(::getsockopt( socketHandle, SOL_SOCKET, SO_RCVBUF, (char*)&value, &length ));\n        return value;\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid TcpSocket::setReceiveBufferSize( int size ) throw( SocketException ){\n\n    try{\n        checkResult(::setsockopt( socketHandle, SOL_SOCKET, SO_RCVBUF, (char*)&size, sizeof(size) ));\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool TcpSocket::getReuseAddress() const throw( SocketException ){\n\n    try{\n        int value;\n        socklen_t length = sizeof( int );\n        checkResult(::getsockopt( socketHandle, SOL_SOCKET, SO_REUSEADDR, (char*)&value, &length ));\n        return value != 0;\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid TcpSocket::setReuseAddress( bool reuse ) throw( SocketException ){\n\n    try{\n        int value = reuse? 1 : 0;\n        checkResult(::setsockopt( socketHandle, SOL_SOCKET, SO_REUSEADDR, (char*)&value, sizeof(int) ));\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint TcpSocket::getSendBufferSize() const throw( SocketException ){\n\n    try{\n        int value;\n        socklen_t length = sizeof( value );\n        checkResult(::getsockopt( socketHandle, SOL_SOCKET, SO_SNDBUF, (char*)&value, &length ));\n        return value;\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid TcpSocket::setSendBufferSize( int size ) throw( SocketException ){\n\n    try{\n        checkResult(::setsockopt( socketHandle, SOL_SOCKET, SO_SNDBUF, (char*)&size, sizeof(size) ));\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid TcpSocket::setSoTimeout ( const int millisecs ) throw ( SocketException )\n{\n    try{\n\n#if !defined(HAVE_WINSOCK2_H)\n        timeval timot;\n        timot.tv_sec = millisecs \/ 1000;\n        timot.tv_usec = (millisecs % 1000) * 1000;\n#else\n        int timot = millisecs;\n#endif\n\n        checkResult(::setsockopt( socketHandle, SOL_SOCKET, SO_RCVTIMEO, (const char*) &timot, sizeof (timot) ));\n        checkResult(::setsockopt( socketHandle, SOL_SOCKET, SO_SNDTIMEO, (const char*) &timot, sizeof (timot) ));\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint TcpSocket::getSoTimeout() const throw( SocketException )\n{\n    try{\n\n#if !defined(HAVE_WINSOCK2_H)\n        timeval timot;\n        timot.tv_sec = 0;\n        timot.tv_usec = 0;\n        socklen_t size = sizeof(timot);\n#else\n        int timot = 0;\n        int size = sizeof(timot);\n#endif\n\n        checkResult(::getsockopt(socketHandle, SOL_SOCKET, SO_RCVTIMEO, (char*) &timot, &size));\n\n#if !defined(HAVE_WINSOCK2_H)\n        return (timot.tv_sec * 1000) + (timot.tv_usec \/ 1000);\n#else\n        return timot;\n#endif\n\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool TcpSocket::getTcpNoDelay() const throw ( cms::CMSException ) {\n\n    try{\n        int value;\n        socklen_t length = sizeof( int );\n        checkResult(::getsockopt( socketHandle, IPPROTO_TCP, TCP_NODELAY, (char*)&value, &length ));\n        return value != 0;\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid TcpSocket::setTcpNoDelay( bool value ) throw ( cms::CMSException ) {\n\n    try{\n        int ivalue = value ? 1 : 0;\n        checkResult(::setsockopt( socketHandle, IPPROTO_TCP, TCP_NODELAY, (char*)&ivalue, sizeof(int) ));\n    }\n    AMQ_CATCH_RETHROW( SocketException )\n    AMQ_CATCHALL_THROW( SocketException )\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid TcpSocket::checkResult( int value ) const throw (SocketException) {\n\n    if( value < 0 ){\n        throw SocketException( __FILE__, __LINE__,\n            SocketError::getErrorString().c_str() );\n    }\n}\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: implsprite.cxx,v $\n *\n *  $Revision: 1.8 $\n *\n *  last change: $Author: obo $ $Date: 2006-09-17 12:53: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_cppcanvas.hxx\"\n\n#ifndef _COM_SUN_STAR_RENDERING_XSPRITE_HPP_\n#include <com\/sun\/star\/rendering\/XSprite.hpp>\n#endif\n#ifndef _COM_SUN_STAR_RENDERING_XANIMATEDSPRITE_HPP_\n#include <com\/sun\/star\/rendering\/XAnimatedSprite.hpp>\n#endif\n\n#ifndef _BGFX_TOOLS_CANVASTOOLS_HXX\n#include <basegfx\/tools\/canvastools.hxx>\n#endif\n#ifndef _BGFX_POLYGON_B2DPOLYPOLYGON_HXX\n#include <basegfx\/polygon\/b2dpolypolygon.hxx>\n#endif\n#ifndef _CANVAS_CANVASTOOLS_HXX\n#include <canvas\/canvastools.hxx>\n#endif\n\n\n#include <implsprite.hxx>\n\n\nusing namespace ::com::sun::star;\n\nnamespace cppcanvas\n{\n    namespace internal\n    {\n\n        ImplSprite::ImplSprite( const uno::Reference< rendering::XSpriteCanvas >&       rParentCanvas,\n                                const uno::Reference< rendering::XSprite >&             rSprite,\n                                const ImplSpriteCanvas::TransformationArbiterSharedPtr& rTransformArbiter ) :\n            mxGraphicDevice(),\n            mxSprite( rSprite ),\n            mxAnimatedSprite(),\n            mpTransformArbiter( rTransformArbiter )\n        {\n            \/\/ Avoiding ternary operator in initializer list (Solaris\n            \/\/ compiler bug, when function call and temporary is\n            \/\/ involved)\n            if( rParentCanvas.is() )\n                mxGraphicDevice = rParentCanvas->getDevice();\n\n            OSL_ENSURE( rParentCanvas.is() , \"ImplSprite::ImplSprite(): Invalid canvas\");\n            OSL_ENSURE( mxGraphicDevice.is(), \"ImplSprite::ImplSprite(): Invalid graphic device\");\n            OSL_ENSURE( mxSprite.is(), \"ImplSprite::ImplSprite(): Invalid sprite\");\n            OSL_ENSURE( mpTransformArbiter.get(), \"ImplSprite::ImplSprite(): Invalid transformation arbiter\");\n        }\n\n        ImplSprite::ImplSprite( const uno::Reference< rendering::XSpriteCanvas >&       rParentCanvas,\n                                const uno::Reference< rendering::XAnimatedSprite >&     rSprite,\n                                const ImplSpriteCanvas::TransformationArbiterSharedPtr& rTransformArbiter ) :\n            mxGraphicDevice(),\n            mxSprite( uno::Reference< rendering::XSprite >(rSprite,\n                                                           uno::UNO_QUERY) ),\n            mxAnimatedSprite( rSprite ),\n            mpTransformArbiter( rTransformArbiter )\n        {\n            \/\/ Avoiding ternary operator in initializer list (Solaris\n            \/\/ compiler bug, when function call and temporary is\n            \/\/ involved)\n            if( rParentCanvas.is() )\n                mxGraphicDevice = rParentCanvas->getDevice();\n\n            OSL_ENSURE( rParentCanvas.is() , \"ImplSprite::ImplSprite(): Invalid canvas\");\n            OSL_ENSURE( mxGraphicDevice.is(), \"ImplSprite::ImplSprite(): Invalid graphic device\");\n            OSL_ENSURE( mxSprite.is(), \"ImplSprite::ImplSprite(): Invalid sprite\");\n            OSL_ENSURE( mpTransformArbiter.get(), \"ImplSprite::ImplSprite(): Invalid transformation arbiter\");\n        }\n\n        ImplSprite::~ImplSprite()\n        {\n            \/\/ hide the sprite on the canvas. If we don't hide the\n            \/\/ sprite, it will stay on the canvas forever, since the\n            \/\/ canvas naturally keeps a list of visible sprites\n            \/\/ (otherwise, it wouldn't be able to paint them\n            \/\/ autonomously)\n            if( mxSprite.is() )\n                mxSprite->hide();\n        }\n\n        void ImplSprite::setAlpha( const double& rAlpha )\n        {\n            OSL_ENSURE( mxSprite.is(), \"ImplSprite::setAlpha(): Invalid sprite\");\n\n            if( mxSprite.is() )\n                mxSprite->setAlpha( rAlpha );\n        }\n\n        void ImplSprite::movePixel( const ::basegfx::B2DPoint& rNewPos )\n        {\n            OSL_ENSURE( mxSprite.is(), \"ImplSprite::movePixel(): Invalid sprite\");\n\n            if( mxSprite.is() )\n            {\n                rendering::ViewState    aViewState;\n                rendering::RenderState  aRenderState;\n\n                ::canvas::tools::initViewState( aViewState );\n                ::canvas::tools::initRenderState( aRenderState );\n\n                mxSprite->move( ::basegfx::unotools::point2DFromB2DPoint( rNewPos ),\n                                aViewState,\n                                aRenderState );\n            }\n        }\n\n        void ImplSprite::move( const ::basegfx::B2DPoint& rNewPos )\n        {\n            OSL_ENSURE( mxSprite.is(), \"ImplSprite::move(): Invalid sprite\");\n\n            if( mxSprite.is() )\n            {\n                rendering::ViewState    aViewState;\n                rendering::RenderState  aRenderState;\n\n                ::canvas::tools::initViewState( aViewState );\n                ::canvas::tools::initRenderState( aRenderState );\n\n                ::canvas::tools::setViewStateTransform( aViewState,\n                                                        mpTransformArbiter->getTransformation() );\n\n                mxSprite->move( ::basegfx::unotools::point2DFromB2DPoint( rNewPos ),\n                                aViewState,\n                                aRenderState );\n            }\n        }\n\n        void ImplSprite::transform( const ::basegfx::B2DHomMatrix& rMatrix )\n        {\n            OSL_ENSURE( mxSprite.is(), \"ImplSprite::transform(): Invalid sprite\");\n\n            if( mxSprite.is() )\n            {\n                geometry::AffineMatrix2D aMatrix;\n\n                mxSprite->transform( ::basegfx::unotools::affineMatrixFromHomMatrix( aMatrix,\n                                                                                     rMatrix ) );\n            }\n        }\n\n        void ImplSprite::setClipPixel( const ::basegfx::B2DPolyPolygon& rClipPoly )\n        {\n            OSL_ENSURE( mxGraphicDevice.is(), \"ImplSprite::setClip(): Invalid canvas\");\n            OSL_ENSURE( mxSprite.is(), \"ImplSprite::transform(): Invalid sprite\");\n\n            if( mxSprite.is() && mxGraphicDevice.is() )\n            {\n                if( rClipPoly.count() == 0 )\n                    mxSprite->clip( uno::Reference< rendering::XPolyPolygon2D >() );\n                else\n                    mxSprite->clip( ::basegfx::unotools::xPolyPolygonFromB2DPolyPolygon( mxGraphicDevice,\n                                                                                         rClipPoly ) );\n            }\n        }\n\n        void ImplSprite::setClip( const ::basegfx::B2DPolyPolygon& rClipPoly )\n        {\n            OSL_ENSURE( mxGraphicDevice.is(), \"ImplSprite::setClip(): Invalid canvas\");\n            OSL_ENSURE( mxSprite.is(), \"ImplSprite::transform(): Invalid sprite\");\n\n            if( mxSprite.is() && mxGraphicDevice.is() )\n            {\n                if( rClipPoly.count() == 0 )\n                {\n                    mxSprite->clip( uno::Reference< rendering::XPolyPolygon2D >() );\n                }\n                else\n                {\n                    ::basegfx::B2DPolyPolygon   aTransformedClipPoly( rClipPoly );\n\n                    \/\/ extract linear part of canvas view transformation (linear means:\n                    \/\/ without translational components)\n                    ::basegfx::B2DHomMatrix     aViewTransform( mpTransformArbiter->getTransformation() );\n                    aViewTransform.set( 0, 2, 0.0 );\n                    aViewTransform.set( 1, 2, 0.0 );\n\n                    \/\/ transform polygon from view to device coordinate space\n                    aTransformedClipPoly.transform( aViewTransform );\n\n                    mxSprite->clip( ::basegfx::unotools::xPolyPolygonFromB2DPolyPolygon( mxGraphicDevice,\n                                                                                         aTransformedClipPoly ) );\n                }\n            }\n        }\n\n        void ImplSprite::show()\n        {\n            OSL_ENSURE( mxSprite.is(), \"ImplSprite::show(): Invalid sprite\");\n\n            if( mxSprite.is() )\n                mxSprite->show();\n        }\n\n        void ImplSprite::hide()\n        {\n            OSL_ENSURE( mxSprite.is(), \"ImplSprite::hide(): Invalid sprite\");\n\n            if( mxSprite.is() )\n                mxSprite->hide();\n        }\n\n        void ImplSprite::setPriority( double fPriority )\n        {\n            OSL_ENSURE( mxSprite.is(), \"ImplSprite::setPriority(): Invalid sprite\");\n\n            if( mxSprite.is() )\n                mxSprite->setPriority(fPriority);\n        }\n\n        uno::Reference< rendering::XSprite > ImplSprite::getUNOSprite() const\n        {\n            return mxSprite;\n        }\n\n        uno::Reference< rendering::XGraphicDevice > ImplSprite::getGraphicDevice() const\n        {\n            return mxGraphicDevice;\n        }\n    }\n}\n<commit_msg>INTEGRATION: CWS presfixes12 (1.8.22); FILE MERGED 2007\/03\/08 21:37:08 thb 1.8.22.1: #i37778# Added extra setClip() method to be able to set no clip - setting a clip with zero polygons by definition clips everything<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: implsprite.cxx,v $\n *\n *  $Revision: 1.9 $\n *\n *  last change: $Author: obo $ $Date: 2007-07-17 15:27: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_cppcanvas.hxx\"\n\n#ifndef _COM_SUN_STAR_RENDERING_XSPRITE_HPP_\n#include <com\/sun\/star\/rendering\/XSprite.hpp>\n#endif\n#ifndef _COM_SUN_STAR_RENDERING_XANIMATEDSPRITE_HPP_\n#include <com\/sun\/star\/rendering\/XAnimatedSprite.hpp>\n#endif\n\n#ifndef _BGFX_TOOLS_CANVASTOOLS_HXX\n#include <basegfx\/tools\/canvastools.hxx>\n#endif\n#ifndef _BGFX_POLYGON_B2DPOLYPOLYGON_HXX\n#include <basegfx\/polygon\/b2dpolypolygon.hxx>\n#endif\n#ifndef _CANVAS_CANVASTOOLS_HXX\n#include <canvas\/canvastools.hxx>\n#endif\n\n\n#include <implsprite.hxx>\n\n\nusing namespace ::com::sun::star;\n\nnamespace cppcanvas\n{\n    namespace internal\n    {\n\n        ImplSprite::ImplSprite( const uno::Reference< rendering::XSpriteCanvas >&       rParentCanvas,\n                                const uno::Reference< rendering::XSprite >&             rSprite,\n                                const ImplSpriteCanvas::TransformationArbiterSharedPtr& rTransformArbiter ) :\n            mxGraphicDevice(),\n            mxSprite( rSprite ),\n            mxAnimatedSprite(),\n            mpTransformArbiter( rTransformArbiter )\n        {\n            \/\/ Avoiding ternary operator in initializer list (Solaris\n            \/\/ compiler bug, when function call and temporary is\n            \/\/ involved)\n            if( rParentCanvas.is() )\n                mxGraphicDevice = rParentCanvas->getDevice();\n\n            OSL_ENSURE( rParentCanvas.is() , \"ImplSprite::ImplSprite(): Invalid canvas\");\n            OSL_ENSURE( mxGraphicDevice.is(), \"ImplSprite::ImplSprite(): Invalid graphic device\");\n            OSL_ENSURE( mxSprite.is(), \"ImplSprite::ImplSprite(): Invalid sprite\");\n            OSL_ENSURE( mpTransformArbiter.get(), \"ImplSprite::ImplSprite(): Invalid transformation arbiter\");\n        }\n\n        ImplSprite::ImplSprite( const uno::Reference< rendering::XSpriteCanvas >&       rParentCanvas,\n                                const uno::Reference< rendering::XAnimatedSprite >&     rSprite,\n                                const ImplSpriteCanvas::TransformationArbiterSharedPtr& rTransformArbiter ) :\n            mxGraphicDevice(),\n            mxSprite( uno::Reference< rendering::XSprite >(rSprite,\n                                                           uno::UNO_QUERY) ),\n            mxAnimatedSprite( rSprite ),\n            mpTransformArbiter( rTransformArbiter )\n        {\n            \/\/ Avoiding ternary operator in initializer list (Solaris\n            \/\/ compiler bug, when function call and temporary is\n            \/\/ involved)\n            if( rParentCanvas.is() )\n                mxGraphicDevice = rParentCanvas->getDevice();\n\n            OSL_ENSURE( rParentCanvas.is() , \"ImplSprite::ImplSprite(): Invalid canvas\");\n            OSL_ENSURE( mxGraphicDevice.is(), \"ImplSprite::ImplSprite(): Invalid graphic device\");\n            OSL_ENSURE( mxSprite.is(), \"ImplSprite::ImplSprite(): Invalid sprite\");\n            OSL_ENSURE( mpTransformArbiter.get(), \"ImplSprite::ImplSprite(): Invalid transformation arbiter\");\n        }\n\n        ImplSprite::~ImplSprite()\n        {\n            \/\/ hide the sprite on the canvas. If we don't hide the\n            \/\/ sprite, it will stay on the canvas forever, since the\n            \/\/ canvas naturally keeps a list of visible sprites\n            \/\/ (otherwise, it wouldn't be able to paint them\n            \/\/ autonomously)\n            if( mxSprite.is() )\n                mxSprite->hide();\n        }\n\n        void ImplSprite::setAlpha( const double& rAlpha )\n        {\n            OSL_ENSURE( mxSprite.is(), \"ImplSprite::setAlpha(): Invalid sprite\");\n\n            if( mxSprite.is() )\n                mxSprite->setAlpha( rAlpha );\n        }\n\n        void ImplSprite::movePixel( const ::basegfx::B2DPoint& rNewPos )\n        {\n            OSL_ENSURE( mxSprite.is(), \"ImplSprite::movePixel(): Invalid sprite\");\n\n            if( mxSprite.is() )\n            {\n                rendering::ViewState    aViewState;\n                rendering::RenderState  aRenderState;\n\n                ::canvas::tools::initViewState( aViewState );\n                ::canvas::tools::initRenderState( aRenderState );\n\n                mxSprite->move( ::basegfx::unotools::point2DFromB2DPoint( rNewPos ),\n                                aViewState,\n                                aRenderState );\n            }\n        }\n\n        void ImplSprite::move( const ::basegfx::B2DPoint& rNewPos )\n        {\n            OSL_ENSURE( mxSprite.is(), \"ImplSprite::move(): Invalid sprite\");\n\n            if( mxSprite.is() )\n            {\n                rendering::ViewState    aViewState;\n                rendering::RenderState  aRenderState;\n\n                ::canvas::tools::initViewState( aViewState );\n                ::canvas::tools::initRenderState( aRenderState );\n\n                ::canvas::tools::setViewStateTransform( aViewState,\n                                                        mpTransformArbiter->getTransformation() );\n\n                mxSprite->move( ::basegfx::unotools::point2DFromB2DPoint( rNewPos ),\n                                aViewState,\n                                aRenderState );\n            }\n        }\n\n        void ImplSprite::transform( const ::basegfx::B2DHomMatrix& rMatrix )\n        {\n            OSL_ENSURE( mxSprite.is(), \"ImplSprite::transform(): Invalid sprite\");\n\n            if( mxSprite.is() )\n            {\n                geometry::AffineMatrix2D aMatrix;\n\n                mxSprite->transform( ::basegfx::unotools::affineMatrixFromHomMatrix( aMatrix,\n                                                                                     rMatrix ) );\n            }\n        }\n\n        void ImplSprite::setClipPixel( const ::basegfx::B2DPolyPolygon& rClipPoly )\n        {\n            OSL_ENSURE( mxGraphicDevice.is(), \"ImplSprite::setClip(): Invalid canvas\");\n            OSL_ENSURE( mxSprite.is(), \"ImplSprite::transform(): Invalid sprite\");\n\n            if( mxSprite.is() && mxGraphicDevice.is() )\n                mxSprite->clip( ::basegfx::unotools::xPolyPolygonFromB2DPolyPolygon( mxGraphicDevice,\n                                                                                         rClipPoly ) );\n        }\n\n        void ImplSprite::setClip( const ::basegfx::B2DPolyPolygon& rClipPoly )\n        {\n            OSL_ENSURE( mxGraphicDevice.is(), \"ImplSprite::setClip(): Invalid canvas\");\n            OSL_ENSURE( mxSprite.is(), \"ImplSprite::transform(): Invalid sprite\");\n\n            if( mxSprite.is() && mxGraphicDevice.is() )\n            {\n                ::basegfx::B2DPolyPolygon   aTransformedClipPoly( rClipPoly );\n\n                \/\/ extract linear part of canvas view transformation (linear means:\n                \/\/ without translational components)\n                ::basegfx::B2DHomMatrix     aViewTransform( mpTransformArbiter->getTransformation() );\n                aViewTransform.set( 0, 2, 0.0 );\n                aViewTransform.set( 1, 2, 0.0 );\n\n                \/\/ transform polygon from view to device coordinate space\n                aTransformedClipPoly.transform( aViewTransform );\n\n                mxSprite->clip( ::basegfx::unotools::xPolyPolygonFromB2DPolyPolygon( mxGraphicDevice,\n                                                                                     aTransformedClipPoly ) );\n            }\n        }\n\n        void ImplSprite::setClip()\n        {\n            OSL_ENSURE( mxGraphicDevice.is(), \"ImplSprite::setClip(): Invalid canvas\");\n            OSL_ENSURE( mxSprite.is(), \"ImplSprite::setClip(): Invalid sprite\");\n\n            if( mxSprite.is() && mxGraphicDevice.is() )\n                mxSprite->clip( uno::Reference< rendering::XPolyPolygon2D >() );\n        }\n\n        void ImplSprite::show()\n        {\n            OSL_ENSURE( mxSprite.is(), \"ImplSprite::show(): Invalid sprite\");\n\n            if( mxSprite.is() )\n                mxSprite->show();\n        }\n\n        void ImplSprite::hide()\n        {\n            OSL_ENSURE( mxSprite.is(), \"ImplSprite::hide(): Invalid sprite\");\n\n            if( mxSprite.is() )\n                mxSprite->hide();\n        }\n\n        void ImplSprite::setPriority( double fPriority )\n        {\n            OSL_ENSURE( mxSprite.is(), \"ImplSprite::setPriority(): Invalid sprite\");\n\n            if( mxSprite.is() )\n                mxSprite->setPriority(fPriority);\n        }\n\n        uno::Reference< rendering::XSprite > ImplSprite::getUNOSprite() const\n        {\n            return mxSprite;\n        }\n\n        uno::Reference< rendering::XGraphicDevice > ImplSprite::getGraphicDevice() const\n        {\n            return mxGraphicDevice;\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: bootstrap.hxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: kr $ $Date: 2001-05-29 14:02: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#ifndef _CPPUHELPER_BOOTSTRAP_HXX_\n#define _CPPUHELPER_BOOTSTRAP_HXX_\n\n#include <com\/sun\/star\/container\/XHierarchicalNameAccess.hpp>\n#include <com\/sun\/star\/registry\/XSimpleRegistry.hpp>\n#include <com\/sun\/star\/uno\/XComponentContext.hpp>\n\nnamespace cppu\n{\n\n\/** Creates a simple registry service instance.\n\n    @rBootstrapPath optional boot strap path for initial components\n    @return simple registry service instance\n*\/\n::com::sun::star::uno::Reference< ::com::sun::star::registry::XSimpleRegistry >\nSAL_CALL createSimpleRegistry(\n    const ::rtl::OUString & rBootstrapPath = ::rtl::OUString() )\n    SAL_THROW( () );\n\n\/** Creates a nested registry service instance.\n\n    @rBootstrapPath optional boot strap path for initial components\n    @return nested registry service instance\n*\/\n::com::sun::star::uno::Reference< ::com::sun::star::registry::XSimpleRegistry >\nSAL_CALL createNestedRegistry(\n    const ::rtl::OUString & rBootstrapPath = ::rtl::OUString() )\n    SAL_THROW( () );\n\n\/** Installs type description manager instance, i.e. registers callback at cppu core.\n\n    @param xTDMgr manager instance\n    @return true, if successfully registered\n*\/\nsal_Bool SAL_CALL installTypeDescriptionManager(\n    ::com::sun::star::uno::Reference< ::com::sun::star::container::XHierarchicalNameAccess > const & xTDMgr )\n    SAL_THROW( () );\n\n\/** Bootstraps an initial component context with service manager upon given registry.\n    This includes insertion of initial services:\n         (registry) service manager, shared lib loader,\n         simple registry, nested registry,\n         implementation registration\n         registry typedescription provider, typedescription manager (also installs it into cppu core)\n\n\n    @param xRegistry registry for service manager and singleton objects of context (may be null)\n    @rBootstrapPath optional boot strap path for initial components\n    @return component context\n*\/\n::com::sun::star::uno::Reference< ::com::sun::star::uno::XComponentContext > SAL_CALL\nbootstrap_InitialComponentContext(\n    ::com::sun::star::uno::Reference< ::com::sun::star::registry::XSimpleRegistry > const & xRegistry,\n    ::rtl::OUString const & rBootstrapPath = ::rtl::OUString() )\n    SAL_THROW( (::com::sun::star::uno::Exception) );\n\n\n\n\/** Bootstraps an initial component context with service manager upon default types and services registry.\n    This includes insertion of initial services:\n         (registry) service manager, shared lib loader,\n         simple registry, nested registry,\n         implementation registration\n         registry typedescription provider, typedescription manager (also installs it into cppu core)\n\n    @return component context\n*\/\n::com::sun::star::uno::Reference< ::com::sun::star::uno::XComponentContext > SAL_CALL\ndefaultBootstrap_InitialComponentContext() SAL_THROW( (::com::sun::star::uno::Exception) );\n\n} \/\/ end namespace cppu\n\n#endif\n\n<commit_msg>updated (#88338#)<commit_after>\/*************************************************************************\n *\n *  $RCSfile: bootstrap.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: kr $ $Date: 2001-07-23 11:13: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#ifndef _CPPUHELPER_BOOTSTRAP_HXX_\n#define _CPPUHELPER_BOOTSTRAP_HXX_\n\n#include <com\/sun\/star\/container\/XHierarchicalNameAccess.hpp>\n#include <com\/sun\/star\/registry\/XSimpleRegistry.hpp>\n#include <com\/sun\/star\/uno\/XComponentContext.hpp>\n\nnamespace cppu\n{\n\n\/** Creates a simple registry service instance.\n\n    @rBootstrapPath optional boot strap path for initial components\n    @return simple registry service instance\n*\/\n::com::sun::star::uno::Reference< ::com::sun::star::registry::XSimpleRegistry >\nSAL_CALL createSimpleRegistry(\n    const ::rtl::OUString & rBootstrapPath = ::rtl::OUString() )\n    SAL_THROW( () );\n\n\/** Creates a nested registry service instance.\n\n    @rBootstrapPath optional boot strap path for initial components\n    @return nested registry service instance\n*\/\n::com::sun::star::uno::Reference< ::com::sun::star::registry::XSimpleRegistry >\nSAL_CALL createNestedRegistry(\n    const ::rtl::OUString & rBootstrapPath = ::rtl::OUString() )\n    SAL_THROW( () );\n\n\/** Installs type description manager instance, i.e. registers callback at cppu core.\n\n    @param xTDMgr manager instance\n    @return true, if successfully registered\n*\/\nsal_Bool SAL_CALL installTypeDescriptionManager(\n    ::com::sun::star::uno::Reference< ::com::sun::star::container::XHierarchicalNameAccess > const & xTDMgr )\n    SAL_THROW( () );\n\n\/** Bootstraps an initial component context with service manager upon given registry.\n    This includes insertion of initial services:\n         (registry) service manager, shared lib loader,\n         simple registry, nested registry,\n         implementation registration\n         registry typedescription provider, typedescription manager (also installs it into cppu core)\n\n\n    @param xRegistry registry for service manager and singleton objects of context (may be null)\n    @rBootstrapPath optional boot strap path for initial components\n    @return component context\n*\/\n::com::sun::star::uno::Reference< ::com::sun::star::uno::XComponentContext > SAL_CALL\nbootstrap_InitialComponentContext(\n    ::com::sun::star::uno::Reference< ::com::sun::star::registry::XSimpleRegistry > const & xRegistry,\n    ::rtl::OUString const & rBootstrapPath = ::rtl::OUString() )\n    SAL_THROW( (::com::sun::star::uno::Exception) );\n\n\n\n\/** Bootstraps an initial component context with service manager upon default types and services registry.\n    This includes insertion of initial services:\n         (registry) service manager, shared lib loader,\n         simple registry, nested registry,\n         implementation registration\n         registry typedescription provider, typedescription manager (also installs it into cppu core)\n\n    this function tries to find its parameters via these bootstrap variables:\n\n    UNO_TYPES         -- a space separated list of file urls of type rdbs\n    UNO_SERVICES      -- a space separated list of file urls of service rdbs\n    UNO_WRITERDB      -- a file url of a write rdb (e.g. user.rdb)\n\n    Please look at http:\/\/udk.openoffice.org\/common\/man\/concept\/uno_default_bootstrapping.html\n    for more info.\n\n    @return component context\n*\/\n::com::sun::star::uno::Reference< ::com::sun::star::uno::XComponentContext > SAL_CALL\ndefaultBootstrap_InitialComponentContext() SAL_THROW( (::com::sun::star::uno::Exception) );\n\n} \/\/ end namespace cppu\n\n#endif\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ File: MetricRegex.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: Implementation of the regular-expression metric.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <MetricRegex.h>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/algorithm\/string.hpp>\n\nusing namespace std;\n\nnamespace Nektar\n{\n    std::string MetricRegex::type = GetMetricFactory().\n        RegisterCreatorFunction(\"REGEX\", MetricRegex::create);\n    \n    \/**\n     * @brief Constructor.\n     *\/\n    MetricRegex::MetricRegex(TiXmlElement *metric, bool generate) : \n        Metric(metric, generate)\n    {\n        \/\/ If we are a derived class, do nothing\n        if (m_type != \"REGEX\")\n        {\n            return;\n        }\n\n        \/\/ Parse Regex expression\n        TiXmlElement *regex = metric->FirstChildElement(\"regex\");\n        ASSERTL0(regex, \"No Regex defined.\");\n        ASSERTL0(regex->GetText(), \"Failed to get text\");\n        m_regex = regex->GetText();\n\n        \/\/ Parse matching values if not generating.\n        if (m_generate)\n        {\n            return;\n        }\n        \n        TiXmlElement *matches = metric->FirstChildElement(\"matches\");\n        ASSERTL0(matches, \"No matches defined.\");\n        TiXmlElement *match = matches->FirstChildElement(\"match\");\n        while (match)\n        {\n            std::vector<MetricRegexFieldValue> tmp;\n            TiXmlElement *field = match->FirstChildElement(\"field\");\n            while (field)\n            {\n                MetricRegexFieldValue v;\n                v.m_value = field->GetText();\n                v.m_useTolerance = false;\n\n                const char * tol = field->Attribute(\"tolerance\");\n                if (tol)\n                {\n                    v.m_useTolerance = true;\n                    v.m_tolerance = atof(tol);\n                }\n                tmp.push_back(v);\n                field = field->NextSiblingElement(\"field\");\n            }\n            m_matches.push_back(tmp);\n\n            match = match->NextSiblingElement(\"match\");\n        }\n    }\n\n    \/**\n     * @brief Test output against a regex expression and set of matches.\n     *\/\n    bool MetricRegex::v_Test(std::istream& pStdout, std::istream& pStderr)\n    {\n        ASSERTL0(m_matches.size(), \"No test conditions defined for Regex.\");\n\n        std::vector<MetricRegexFieldValue> &okValues = m_matches[0];\n        int                                 nMatch   = m_matches.size();\n        bool                                success  = true;\n        boost::cmatch                       matches;\n\n        \/\/ Process output file line by line searching for regex matches\n        std::string line;\n        while (getline(pStdout, line))\n        {\n            \/\/ Test to see if we have a match on this line.\n            if (boost::regex_match(line.c_str(), matches, m_regex))\n            {\n                \/\/ Error if no fields in regex then throw an error.\n                if (matches.size() == 1)\n                {\n                    cerr << \"No test sections in regex!\" << endl;\n                    return false;\n                }\n\n                \/\/ Check each field in turn\n                for (int i = 1; i < matches.size(); ++i)\n                {\n                    std::string match(matches[i].first, matches[i].second);\n                    \n                    if (okValues[i-1].m_useTolerance)\n                    {\n                        double val = fabs(boost::lexical_cast<double>(\n                                                        okValues[i-1].m_value)\n                                          - boost::lexical_cast<double>(match));\n                        \/\/ If the okValues are not within tolerance, failed the\n                        \/\/ test.\n                        if (val > okValues[i-1].m_tolerance)\n                        {\n                            cerr << \"Failed tolerance match.\" << endl;\n                            cerr << \"  Expected: \" << okValues[i-1].m_value\n                                 << \" +\/- \" << okValues[i-1].m_tolerance\n                                 << endl;\n                            cerr << \"  Result:   \" << match << endl;\n                            success = false;\n                        }\n                    }\n                    else\n                    {\n                        \/\/ Case insensitive match.\n                        if (!boost::iequals(match, okValues[i-1].m_value))\n                        {\n                            cerr << \"Failed case-insensitive match.\" << endl;\n                            cerr << \"  Expected: \" << okValues[i-1].m_value\n                                 << endl;\n                            cerr << \"  Result:   \" << match << endl;\n                            success = false;\n                        }\n                    }\n                }\n\n                \/\/ Remove this match from the list of matches.\n                m_matches.erase(m_matches.begin());\n            }\n        }\n\n        if (m_matches.size() != 0)\n        {\n            cerr << \"Expected \" << nMatch << \" matches but only found \"\n                 << (nMatch - m_matches.size()) << \"!\" << endl;\n            success = false;\n        }\n\n        return success;\n    }\n\n    \/**\n     * @brief Test output against a regex expression and set of matches.\n     *\/\n    void MetricRegex::v_Generate(std::istream& pStdout, std::istream& pStderr)\n    {\n        boost::cmatch matches;\n\n        \/\/ Process output file line by line searching for regex matches\n        std::string line;\n        while (getline(pStdout, line))\n        {\n            \/\/ Test to see if we have a match on this line.\n            if (boost::regex_match(line.c_str(), matches, m_regex))\n            {\n                \/\/ Error if no fields in regex then throw an error.\n                ASSERTL0(matches.size() != 1, \"No test sections in regex!\");\n                \n                vector<MetricRegexFieldValue> okValues;\n\n                for (int i = 1; i < matches.size(); ++i)\n                {\n                    \/\/ Create new field.\n                    MetricRegexFieldValue okValue;\n                    okValue.m_useTolerance = false;\n                    okValue.m_value        = std::string(matches[i].first, \n                                                         matches[i].second);\n                    okValues.push_back(okValue);\n                }\n                \n                m_matches.push_back(okValues);\n            }\n        }\n\n        \/\/ If we are not a derived class then create a new structure.\n        if (m_type == \"REGEX\")\n        {\n            \/\/ Remove matches if they already exist.\n            TiXmlElement *matches = m_metric->FirstChildElement(\"matches\");\n            if (matches)\n            {\n                ASSERTL0(m_metric->RemoveChild(matches), \n                         \"Couldn't remove matches from metric!\");\n            }\n\n            \/\/ Create new matches element.\n            matches = new TiXmlElement(\"matches\");\n            m_metric->LinkEndChild(matches);\n            \n            for (int i = 0; i < m_matches.size(); ++i)\n            {\n                TiXmlElement *match = new TiXmlElement(\"match\");\n                matches->LinkEndChild(match);\n                \n                for (int j = 0; j < m_matches[i].size(); ++j)\n                {\n                    TiXmlElement *field = new TiXmlElement(\"field\");\n                    match->LinkEndChild(field);\n                    \n                    field->SetAttribute(\n                        \"id\", boost::lexical_cast<std::string>(j));\n                    \n                    if (m_matches[i][j].m_useTolerance)\n                    {\n                        field->SetAttribute(\n                            \"tolerance\", boost::lexical_cast<\n                                std::string>(m_matches[i][j].m_tolerance));\n                    }\n                    \n                    field->LinkEndChild(new TiXmlText(m_matches[i][j].m_value));\n                }\n            }\n        }\n    }\n}\n<commit_msg>Adding check for bad lexical casts to MetricRegex.<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ File: MetricRegex.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: Implementation of the regular-expression metric.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <MetricRegex.h>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/algorithm\/string.hpp>\n\nusing namespace std;\n\nnamespace Nektar\n{\n    std::string MetricRegex::type = GetMetricFactory().\n        RegisterCreatorFunction(\"REGEX\", MetricRegex::create);\n    \n    \/**\n     * @brief Constructor.\n     *\/\n    MetricRegex::MetricRegex(TiXmlElement *metric, bool generate) : \n        Metric(metric, generate)\n    {\n        \/\/ If we are a derived class, do nothing\n        if (m_type != \"REGEX\")\n        {\n            return;\n        }\n\n        \/\/ Parse Regex expression\n        TiXmlElement *regex = metric->FirstChildElement(\"regex\");\n        ASSERTL0(regex, \"No Regex defined.\");\n        ASSERTL0(regex->GetText(), \"Failed to get text\");\n        m_regex = regex->GetText();\n\n        \/\/ Parse matching values if not generating.\n        if (m_generate)\n        {\n            return;\n        }\n        \n        TiXmlElement *matches = metric->FirstChildElement(\"matches\");\n        ASSERTL0(matches, \"No matches defined.\");\n        TiXmlElement *match = matches->FirstChildElement(\"match\");\n        while (match)\n        {\n            std::vector<MetricRegexFieldValue> tmp;\n            TiXmlElement *field = match->FirstChildElement(\"field\");\n            while (field)\n            {\n                MetricRegexFieldValue v;\n                v.m_value = field->GetText();\n                v.m_useTolerance = false;\n\n                const char * tol = field->Attribute(\"tolerance\");\n                if (tol)\n                {\n                    v.m_useTolerance = true;\n                    v.m_tolerance = atof(tol);\n                }\n                tmp.push_back(v);\n                field = field->NextSiblingElement(\"field\");\n            }\n            m_matches.push_back(tmp);\n\n            match = match->NextSiblingElement(\"match\");\n        }\n    }\n\n    \/**\n     * @brief Test output against a regex expression and set of matches.\n     *\/\n    bool MetricRegex::v_Test(std::istream& pStdout, std::istream& pStderr)\n    {\n        ASSERTL0(m_matches.size(), \"No test conditions defined for Regex.\");\n\n        std::vector<MetricRegexFieldValue> &okValues = m_matches[0];\n        int                                 nMatch   = m_matches.size();\n        bool                                success  = true;\n        boost::cmatch                       matches;\n\n        \/\/ Process output file line by line searching for regex matches\n        std::string line;\n        while (getline(pStdout, line))\n        {\n            \/\/ Test to see if we have a match on this line.\n            if (boost::regex_match(line.c_str(), matches, m_regex))\n            {\n                \/\/ Error if no fields in regex then throw an error.\n                if (matches.size() == 1)\n                {\n                    cerr << \"No test sections in regex!\" << endl;\n                    return false;\n                }\n\n                \/\/ Check each field in turn\n                for (int i = 1; i < matches.size(); ++i)\n                {\n                    std::string match(matches[i].first, matches[i].second);\n                    \n                    if (okValues[i-1].m_useTolerance)\n                    {\n                        double val;\n                        try \n                        {\n                            val = fabs(boost::lexical_cast<double>(\n                                           okValues[i-1].m_value))\n                                - fabs(boost::lexical_cast<double>(match));\n                        }\n                        catch(boost::bad_lexical_cast &e)\n                        {\n                            cerr << \"Could not convert one of \" << match \n                                 << \" (match) or \" << okValues[i-1].m_value\n                                 << \" (comparison value) to double\" << endl;\n                            success = false;\n                            continue;\n                        }\n                        \n                        \/\/ If the okValues are not within tolerance, failed the\n                        \/\/ test.\n                        if (val > okValues[i-1].m_tolerance)\n                        {\n                            cerr << \"Failed tolerance match.\" << endl;\n                            cerr << \"  Expected: \" << okValues[i-1].m_value\n                                 << \" +\/- \" << okValues[i-1].m_tolerance\n                                 << endl;\n                            cerr << \"  Result:   \" << match << endl;\n                            success = false;\n                        }\n                    }\n                    else\n                    {\n                        \/\/ Case insensitive match.\n                        if (!boost::iequals(match, okValues[i-1].m_value))\n                        {\n                            cerr << \"Failed case-insensitive match.\" << endl;\n                            cerr << \"  Expected: \" << okValues[i-1].m_value\n                                 << endl;\n                            cerr << \"  Result:   \" << match << endl;\n                            success = false;\n                        }\n                    }\n                }\n\n                \/\/ Remove this match from the list of matches.\n                m_matches.erase(m_matches.begin());\n            }\n        }\n\n        if (m_matches.size() != 0)\n        {\n            cerr << \"Expected \" << nMatch << \" matches but only found \"\n                 << (nMatch - m_matches.size()) << \"!\" << endl;\n            success = false;\n        }\n\n        return success;\n    }\n\n    \/**\n     * @brief Test output against a regex expression and set of matches.\n     *\/\n    void MetricRegex::v_Generate(std::istream& pStdout, std::istream& pStderr)\n    {\n        boost::cmatch matches;\n\n        \/\/ Process output file line by line searching for regex matches\n        std::string line;\n        while (getline(pStdout, line))\n        {\n            \/\/ Test to see if we have a match on this line.\n            if (boost::regex_match(line.c_str(), matches, m_regex))\n            {\n                \/\/ Error if no fields in regex then throw an error.\n                ASSERTL0(matches.size() != 1, \"No test sections in regex!\");\n                \n                vector<MetricRegexFieldValue> okValues;\n\n                for (int i = 1; i < matches.size(); ++i)\n                {\n                    \/\/ Create new field.\n                    MetricRegexFieldValue okValue;\n                    okValue.m_useTolerance = false;\n                    okValue.m_value        = std::string(matches[i].first, \n                                                         matches[i].second);\n                    okValues.push_back(okValue);\n                }\n                \n                m_matches.push_back(okValues);\n            }\n        }\n\n        \/\/ If we are not a derived class then create a new structure.\n        if (m_type == \"REGEX\")\n        {\n            \/\/ Remove matches if they already exist.\n            TiXmlElement *matches = m_metric->FirstChildElement(\"matches\");\n            if (matches)\n            {\n                ASSERTL0(m_metric->RemoveChild(matches), \n                         \"Couldn't remove matches from metric!\");\n            }\n\n            \/\/ Create new matches element.\n            matches = new TiXmlElement(\"matches\");\n            m_metric->LinkEndChild(matches);\n            \n            for (int i = 0; i < m_matches.size(); ++i)\n            {\n                TiXmlElement *match = new TiXmlElement(\"match\");\n                matches->LinkEndChild(match);\n                \n                for (int j = 0; j < m_matches[i].size(); ++j)\n                {\n                    TiXmlElement *field = new TiXmlElement(\"field\");\n                    match->LinkEndChild(field);\n                    \n                    field->SetAttribute(\n                        \"id\", boost::lexical_cast<std::string>(j));\n                    \n                    if (m_matches[i][j].m_useTolerance)\n                    {\n                        field->SetAttribute(\n                            \"tolerance\", boost::lexical_cast<\n                                std::string>(m_matches[i][j].m_tolerance));\n                    }\n                    \n                    field->LinkEndChild(new TiXmlText(m_matches[i][j].m_value));\n                }\n            }\n        }\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2012 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 <stdio.h>\n\n#include \"client\/linux\/handler\/minidump_descriptor.h\"\n\n#include \"common\/linux\/guid_creator.h\"\n\nnamespace google_breakpad {\n\nMinidumpDescriptor::MinidumpDescriptor(const MinidumpDescriptor& descriptor)\n    : fd_(descriptor.fd_),\n      directory_(descriptor.directory_),\n      c_path_(NULL) {\n  \/\/ The copy constructor is not allowed to be called on a MinidumpDescriptor\n  \/\/ with a valid path_, as getting its c_path_ would require the heap which\n  \/\/ can cause problems in compromised environments.\n  assert(descriptor.path_.empty());\n}\n\nMinidumpDescriptor& MinidumpDescriptor::operator=(\n    const MinidumpDescriptor& descriptor) {\n  assert(descriptor.path_.empty());\n\n  fd_ = descriptor.fd_;\n  directory_ = descriptor.directory_;\n  path_.clear();\n  if (c_path_) {\n    \/\/ This descriptor already had a path set, so generate a new one.\n    c_path_ = NULL;\n    UpdatePath();\n  }\n  return *this;\n}\n\nvoid MinidumpDescriptor::UpdatePath() {\n  assert(fd_ == -1 && !directory_.empty());\n\n  GUID guid;\n  char guid_str[kGUIDStringLength + 1];\n  bool r = CreateGUID(&guid) && GUIDToString(&guid, guid_str, sizeof(guid_str));\n  assert(r);\n\n  path_.clear();\n  path_ = directory_ + \"\/\" + guid_str + \".dmp\";  \n  c_path_ = path_.c_str();\n}\n\n}  \/\/ namespace google_breakpad\n<commit_msg>Fix unused variable warning in optimized build (fix proveded by Matthew Riley)<commit_after>\/\/ Copyright (c) 2012 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 <stdio.h>\n\n#include \"client\/linux\/handler\/minidump_descriptor.h\"\n\n#include \"common\/linux\/guid_creator.h\"\n\nnamespace google_breakpad {\n\nMinidumpDescriptor::MinidumpDescriptor(const MinidumpDescriptor& descriptor)\n    : fd_(descriptor.fd_),\n      directory_(descriptor.directory_),\n      c_path_(NULL) {\n  \/\/ The copy constructor is not allowed to be called on a MinidumpDescriptor\n  \/\/ with a valid path_, as getting its c_path_ would require the heap which\n  \/\/ can cause problems in compromised environments.\n  assert(descriptor.path_.empty());\n}\n\nMinidumpDescriptor& MinidumpDescriptor::operator=(\n    const MinidumpDescriptor& descriptor) {\n  assert(descriptor.path_.empty());\n\n  fd_ = descriptor.fd_;\n  directory_ = descriptor.directory_;\n  path_.clear();\n  if (c_path_) {\n    \/\/ This descriptor already had a path set, so generate a new one.\n    c_path_ = NULL;\n    UpdatePath();\n  }\n  return *this;\n}\n\nvoid MinidumpDescriptor::UpdatePath() {\n  assert(fd_ == -1 && !directory_.empty());\n\n  GUID guid;\n  char guid_str[kGUIDStringLength + 1];\n  if (!CreateGUID(&guid) || !GUIDToString(&guid, guid_str, sizeof(guid_str))) {\n    assert(false);\n  }\n\n  path_.clear();\n  path_ = directory_ + \"\/\" + guid_str + \".dmp\";  \n  c_path_ = path_.c_str();\n}\n\n}  \/\/ namespace google_breakpad\n<|endoftext|>"}
{"text":"<commit_before>#pragma once\r\n\r\n#include<algorithm>\r\n#include<vector>\r\n#include<tuple>\r\n#include<universal\/blas\/matrix.hpp>\r\n#include<mtl\/operation\/qr.hpp>\r\n#include<mtl\/operation\/svd.hpp>\r\nconst double EPS = 1E-9;\r\ndouble k = 0.0000001;\r\nnamespace sw {\r\n    namespace universal {\r\n        namespace blas {\r\n\r\n            template<typename Scalar>\r\n            size_t find_rank(const matrix<Scalar> A) {\r\n                size_t n = num_rows(A);\r\n                size_t m = num_cols(A);\r\n\r\n                size_t rank = 0;\r\n                vector<bool> row(n, false);\r\n                for (size_t i = 0; i < m; ++i) {\r\n                    for (size_t j = 0; j < n; ++j) {\r\n                        if (abs(A[j][i]) > EPS && !row[j]) break;\r\n                    }\r\n\r\n                    if (j != n) {\r\n                        ++rank;\r\n                        row[j] = true;\r\n                        for (size_t p = i + 1; p < m; ++p) A[j][p] \/= A[j][i];\r\n                        for (size_t k = 0; k < n; ++k) {\r\n                            if (abs(A[k][i]) > EPS && k != j) {\r\n                                for (size_t p = i + 1; p < m; ++p)\r\n                                    A[k][p] -= A[j][p] * A[k][i];\r\n                            }\r\n                        }\r\n                    }\r\n                }\r\n                return rank;\r\n            }\r\n            template<typename Scalar>\r\n            void qr(const matrix<Scalar> A, matrix<Scalar> Q, matrix<Scalar> R) {\r\n            \t\t\r\n            }\r\n            \r\n            template<typename Scalar>\r\n            tuple randsvd(const matrix<Scalar> &A) {\r\n                size_t k = min(num_cols(A), num_rows(A));\r\n                size_t n = num_cols(A), m = num_row(A);\r\n                \/\/generate a gaussian random matrix of size n x k omega in this case\r\n                matrix<Scalar> omega,Y,Q,R,B,S,V,D;\r\n                \/\/omega(n x k) x A(m x n) == Y(m x k)\r\n                Y = A * omega;\r\n                tie(Q, R) = qr(Y);\r\n                \/\/implement qr decomposition & svd here\r\n                Q = transpose();\r\n                B = Q * A;\r\n                std::tie(S, V, D) = svd(B,k);\r\n\r\n                return std::make_tuple(S, V, D);\r\n            }\r\n        }\r\n    }\r\n}<commit_msg>Updated randsvd.hpp<commit_after>#pragma once\r\n\r\n#include<algorithm>\r\n#include<vector>\r\n#include<tuple>\r\n#include<universal\/blas\/operators.hpp>\r\n#include<universal\/blas\/matrix.hpp>\r\n#include<mtl\/operation\/qr.hpp>\r\n#include<mtl\/operation\/svd.hpp>\r\nconst double EPS = 1E-9;\r\ndouble k = 0.0000001;\r\nnamespace sw {\r\n    namespace universal {\r\n        namespace blas {\r\n\r\n            template<typename Scalar>\r\n            size_t find_rank(const matrix<Scalar> A) {\r\n                size_t n = num_rows(A);\r\n                size_t m = num_cols(A);\r\n\r\n                size_t rank = 0;\r\n                vector<bool> row(n, false);\r\n                for (size_t i = 0; i < m; ++i) {\r\n                    for (size_t j = 0; j < n; ++j) {\r\n                        if (abs(A[j][i]) > EPS && !row[j]) break;\r\n                    }\r\n\r\n                    if (j != n) {\r\n                        ++rank;\r\n                        row[j] = true;\r\n                        for (size_t p = i + 1; p < m; ++p) A[j][p] \/= A[j][i];\r\n                        for (size_t k = 0; k < n; ++k) {\r\n                            if (abs(A[k][i]) > EPS && k != j) {\r\n                                for (size_t p = i + 1; p < m; ++p)\r\n                                    A[k][p] -= A[j][p] * A[k][i];\r\n                            }\r\n                        }\r\n                    }\r\n                }\r\n                return rank;\r\n            }\r\n            template<typename Scalar>\r\n            void qr(const matrix<Scalar> A, matrix<Scalar> Q, matrix<Scalar> R) {\r\n            \t\/\/R is the upper triangular matrix\r\n            \t\/\/Q is the orthogonal matrix\r\n            \t\r\n            }\r\n            \r\n            template<typename Scalar>\r\n            tuple randsvd(const matrix<Scalar> &A) {\r\n                size_t k = min(num_cols(A), num_rows(A));\r\n                size_t n = num_cols(A), m = num_row(A);\r\n                \/\/generate a gaussian random matrix of size n x k omega in this case\r\n                matrix<Scalar> omega,Y,Q,R,B,S,V,D;\r\n                \/\/omega(n x k) x A(m x n) == Y(m x k)\r\n                Y = A * omega;\r\n                tie(Q, R) = qr(Y);\r\n                \/\/implement qr decomposition & svd here\r\n                Q.transpose();\r\n                B = Q * A;\r\n                std::tie(S, V, D) = svd(B,k);\r\n\r\n                return std::make_tuple(S, V, D);\r\n            }\r\n        }\r\n    }\r\n}<|endoftext|>"}
{"text":"<commit_before>\/\/ This program re-calculates _struct_conn.pdbx_dist_value values\n\/\/ and prints message if it differs by more than 0.002A from the value in file.\n\n#include <gemmi\/gz.hpp>   \/\/ for MaybeGzipped\n#include <gemmi\/mmread.hpp>\n#include <gemmi\/dirwalk.hpp> \/\/ for CifWalk\n#include <cstdio>\n#include <map>\n\nusing namespace gemmi;\n\nvoid check(const char* path) {\n  Structure st = gemmi::read_structure(MaybeGzipped(path));\n  for (Chain& chain : st.models.at(0).chains)\n    for (Residue& res : chain.residues)\n      for (Atom& atom : res.atoms)\n        if (int n = st.cell.is_special_position(atom.pos)) {\n          NearbyImage im = st.cell.find_nearest_image(atom.pos, atom.pos,\n                                                      SymmetryImage::Different);\n          std::printf(\"%s: %s %4d %3s %-3s %c *%d  occ=%.2f  B=%5.1f  d=%.4f\\n\",\n              st.name.c_str(),\n              chain.name_for_pdb().c_str(), res.seq_id_for_pdb(),\n              res.name.c_str(), atom.name.c_str(), (atom.altloc | 0x20),\n              n+1, atom.occ, atom.b_iso, std::sqrt(im.dist_sq));\n        }\n}\n\nint main(int argc, char* argv[]) {\n  if (argc != 2)\n    return 1;\n  int counter = 0;\n  try {\n    for (const char* path : CoorFileWalk(argv[1])) {\n      check(path);\n      if (++counter % 1000 == 0) {\n        std::printf(\"[progress: %d files]\\n\", counter);\n        std::fflush(stdout);\n      }\n    }\n  } catch (std::runtime_error& err) {\n    std::fprintf(stderr, \"Error: %s\\n\", err.what());\n    return 1;\n  }\n  return 0;\n}\n\/\/ vim:sw=2:ts=2:et\n<commit_msg>remove examples\/specpos.cc, it's now part of gemmi-contents<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"kl\/base64.hpp\"\n\n#include <catch2\/catch.hpp>\n#include <boost\/optional.hpp>\n#include <boost\/optional\/optional_io.hpp>\n\nnamespace {\n\ntemplate <std::size_t N>\ngsl::span<const std::byte> as_span(const char (&str)[N])\n{\n    return gsl::span{reinterpret_cast<const std::byte*>(str),\n                     N - 1}; \/\/ get rid of trailing '\\0'\n}\n\ntemplate <size_t N>\nstd::vector<std::byte> as_vector(const char (&str)[N])\n{\n    return std::vector<std::byte>{reinterpret_cast<const std::byte*>(str),\n                                  reinterpret_cast<const std::byte*>(str) + N -\n                                      1}; \/\/ get rid of trailing '\\0'\n}\n} \/\/ namespace anonymous\n\nTEST_CASE(\"base64\")\n{\n    using namespace kl;\n\n    SECTION(\"encode\")\n    {\n        REQUIRE(base64_encode(as_span(\"Hello\")) == \"SGVsbG8=\");\n        REQUIRE(base64_encode(as_span(\"Hello \")) == \"SGVsbG8g\");\n        REQUIRE(base64_encode(as_span(\"Hello W\")) == \"SGVsbG8gVw==\");\n        REQUIRE(base64_encode(as_span(\"Hello Wo\")) == \"SGVsbG8gV28=\");\n        REQUIRE(base64_encode(as_span(\"Hello Wor\")) == \"SGVsbG8gV29y\");\n        REQUIRE(base64_encode(as_span(\"Hello Worl\")) == \"SGVsbG8gV29ybA==\");\n        REQUIRE(base64_encode(as_span(\"Hello World\")) == \"SGVsbG8gV29ybGQ=\");\n        REQUIRE(base64_encode(as_span(\"Hello World!\")) == \"SGVsbG8gV29ybGQh\");\n        REQUIRE(base64_encode(as_span(\"<<???>>\")) == \"PDw\/Pz8+Pg==\");\n    }\n\n    SECTION(\"decode\")\n    {\n        REQUIRE(base64_decode(\"SGVsbG8=\").value() == as_vector(\"Hello\"));\n        REQUIRE(!base64_decode(\"SGVsbG8==\"));\n        REQUIRE(base64_decode(\"SGVsbG8g\").value() == as_vector(\"Hello \"));\n        REQUIRE(base64_decode(\"SGVsbG8gVw==\").value() == as_vector(\"Hello W\"));\n        REQUIRE(base64_decode(\"SGVsbG8gV28=\").value() == as_vector(\"Hello Wo\"));\n        REQUIRE(base64_decode(\"SGVsbG8gV29y\").value() ==\n                as_vector(\"Hello Wor\"));\n        REQUIRE(base64_decode(\"SGVsbG8gV29ybA==\").value() ==\n                as_vector(\"Hello Worl\"));\n        REQUIRE(base64_decode(\"SGVsbG8gV29ybGQ=\").value() ==\n                as_vector(\"Hello World\"));\n        REQUIRE(base64_decode(\"SGVsbG8gV29ybGQh\").value() ==\n                as_vector(\"Hello World!\"));\n    }\n\n    SECTION(\"range>127\")\n    {\n        std::string sps = \"Z0KAH5ZSAUB7YCoQAAADABAAAAMDzgYABJPgABGMP8Y4wMAAknwA\"\n                          \"AjGH+McO0KFSQA==\";\n        std::string pps = \"aMuNSA==\";\n\n        auto sps_decoded = base64_decode(sps);\n        auto pps_decoded = base64_decode(pps);\n\n        REQUIRE(base64_encode(sps_decoded.value()) == sps);\n        REQUIRE(base64_encode(pps_decoded.value()) == pps);\n    }\n\n    SECTION(\"malformed\")\n    {\n        REQUIRE(!base64_decode(\"a\"));\n        REQUIRE(!!base64_decode(\"aaaa\"));\n        REQUIRE(!base64_decode(\"aa=a\"));\n        REQUIRE(!base64_decode(\"a===\"));\n        REQUIRE(!base64_decode(\"a!==\"));\n        REQUIRE(!base64_decode(\"a@!=\"));\n        REQUIRE(!base64_decode(\"aa-a\"));\n        REQUIRE(!!base64_decode(\"aa+a\"));\n    }\n}\n\nTEST_CASE(\"base64 URL variant\")\n{\n    using namespace kl;\n\n    SECTION(\"encode\")\n    {\n        REQUIRE(base64url_encode(as_span(\"Hello\")) == \"SGVsbG8\");\n        REQUIRE(base64url_encode(as_span(\"Hello \")) == \"SGVsbG8g\");\n        REQUIRE(base64url_encode(as_span(\"Hello W\")) == \"SGVsbG8gVw\");\n        REQUIRE(base64url_encode(as_span(\"Hello Wo\")) == \"SGVsbG8gV28\");\n        REQUIRE(base64url_encode(as_span(\"Hello Wor\")) == \"SGVsbG8gV29y\");\n        REQUIRE(base64url_encode(as_span(\"Hello Worl\")) == \"SGVsbG8gV29ybA\");\n        REQUIRE(base64url_encode(as_span(\"Hello World\")) == \"SGVsbG8gV29ybGQ\");\n        REQUIRE(base64url_encode(as_span(\"Hello World!\")) == \"SGVsbG8gV29ybGQh\");\n        REQUIRE(base64url_encode(as_span(\"<<???>>\")) == \"PDw_Pz8-Pg\");\n    }\n\n    SECTION(\"decode\")\n    {\n        REQUIRE(base64url_decode(\"SGVsbG8\").value() == as_vector(\"Hello\"));\n        REQUIRE(base64url_decode(\"SGVsbG8g\").value() == as_vector(\"Hello \"));\n        REQUIRE(base64url_decode(\"SGVsbG8gVw\").value() == as_vector(\"Hello W\"));\n        REQUIRE(base64url_decode(\"SGVsbG8gV28\").value() ==\n                as_vector(\"Hello Wo\"));\n        REQUIRE(base64url_decode(\"SGVsbG8gV29y\").value() ==\n                as_vector(\"Hello Wor\"));\n        REQUIRE(base64url_decode(\"SGVsbG8gV29ybA\").value() ==\n                as_vector(\"Hello Worl\"));\n        REQUIRE(base64url_decode(\"SGVsbG8gV29ybGQ\").value() ==\n                as_vector(\"Hello World\"));\n        REQUIRE(base64url_decode(\"SGVsbG8gV29ybGQh\").value() ==\n                as_vector(\"Hello World!\"));\n    }\n\n    SECTION(\"ignore '=' on the end\")\n    {\n        REQUIRE(base64url_decode(\"SGVsbG8gVw==\").value() ==\n                as_vector(\"Hello W\"));\n        REQUIRE(base64url_decode(\"SGVsbG8gVw=\").value() ==\n                as_vector(\"Hello W\"));\n        REQUIRE(base64url_decode(\"SGVsbG8gVw\").value() == as_vector(\"Hello W\"));\n        REQUIRE(!base64url_decode(\"SGVsbG8gVw===\"));\n    }\n\n    SECTION(\"range>127\")\n    {\n        std::string sps = \"Z0KAH5ZSAUB7YCoQAAADABAAAAMDzgYABJPgABGMP8Y4wMAAknwA\"\n                          \"AjGH-McO0KFSQA==\";\n        std::string pps = \"aMuNSA==\";\n\n        auto sps_decoded = base64url_decode(sps);\n        auto pps_decoded = base64url_decode(pps);\n\n        REQUIRE(base64url_encode(sps_decoded.value()) ==\n                sps.substr(0, sps.length() - 2));\n        REQUIRE(base64url_encode(pps_decoded.value()) ==\n                pps.substr(0, pps.length() - 2));\n    }\n\n    SECTION(\"malformed\")\n    {\n        REQUIRE(!base64url_decode(\"a\"));\n        REQUIRE(!!base64url_decode(\"aaaa\"));\n        REQUIRE(!base64url_decode(\"aa=a\"));\n        REQUIRE(!base64url_decode(\"a===\"));\n        REQUIRE(!base64url_decode(\"a!==\"));\n        REQUIRE(!base64url_decode(\"a@!=\"));\n        REQUIRE(!base64url_decode(\"aa+a\"));\n        REQUIRE(!!base64url_decode(\"aa-a\"));\n    }\n}\n<commit_msg>Fix warning about unintended use of trigraphs inside the input string<commit_after>#include \"kl\/base64.hpp\"\n\n#include <catch2\/catch.hpp>\n#include <boost\/optional.hpp>\n#include <boost\/optional\/optional_io.hpp>\n\nnamespace {\n\ntemplate <std::size_t N>\ngsl::span<const std::byte> as_span(const char (&str)[N])\n{\n    return gsl::span{reinterpret_cast<const std::byte*>(str),\n                     N - 1}; \/\/ get rid of trailing '\\0'\n}\n\ntemplate <size_t N>\nstd::vector<std::byte> as_vector(const char (&str)[N])\n{\n    return std::vector<std::byte>{reinterpret_cast<const std::byte*>(str),\n                                  reinterpret_cast<const std::byte*>(str) + N -\n                                      1}; \/\/ get rid of trailing '\\0'\n}\n} \/\/ namespace anonymous\n\nTEST_CASE(\"base64\")\n{\n    using namespace kl;\n\n    SECTION(\"encode\")\n    {\n        REQUIRE(base64_encode(as_span(\"Hello\")) == \"SGVsbG8=\");\n        REQUIRE(base64_encode(as_span(\"Hello \")) == \"SGVsbG8g\");\n        REQUIRE(base64_encode(as_span(\"Hello W\")) == \"SGVsbG8gVw==\");\n        REQUIRE(base64_encode(as_span(\"Hello Wo\")) == \"SGVsbG8gV28=\");\n        REQUIRE(base64_encode(as_span(\"Hello Wor\")) == \"SGVsbG8gV29y\");\n        REQUIRE(base64_encode(as_span(\"Hello Worl\")) == \"SGVsbG8gV29ybA==\");\n        REQUIRE(base64_encode(as_span(\"Hello World\")) == \"SGVsbG8gV29ybGQ=\");\n        REQUIRE(base64_encode(as_span(\"Hello World!\")) == \"SGVsbG8gV29ybGQh\");\n        REQUIRE(base64_encode(as_span(\"<<!_??_!>>\")) == \"PDwhXz8\/XyE+Pg==\");\n    }\n\n    SECTION(\"decode\")\n    {\n        REQUIRE(base64_decode(\"SGVsbG8=\").value() == as_vector(\"Hello\"));\n        REQUIRE(!base64_decode(\"SGVsbG8==\"));\n        REQUIRE(base64_decode(\"SGVsbG8g\").value() == as_vector(\"Hello \"));\n        REQUIRE(base64_decode(\"SGVsbG8gVw==\").value() == as_vector(\"Hello W\"));\n        REQUIRE(base64_decode(\"SGVsbG8gV28=\").value() == as_vector(\"Hello Wo\"));\n        REQUIRE(base64_decode(\"SGVsbG8gV29y\").value() ==\n                as_vector(\"Hello Wor\"));\n        REQUIRE(base64_decode(\"SGVsbG8gV29ybA==\").value() ==\n                as_vector(\"Hello Worl\"));\n        REQUIRE(base64_decode(\"SGVsbG8gV29ybGQ=\").value() ==\n                as_vector(\"Hello World\"));\n        REQUIRE(base64_decode(\"SGVsbG8gV29ybGQh\").value() ==\n                as_vector(\"Hello World!\"));\n    }\n\n    SECTION(\"range>127\")\n    {\n        std::string sps = \"Z0KAH5ZSAUB7YCoQAAADABAAAAMDzgYABJPgABGMP8Y4wMAAknwA\"\n                          \"AjGH+McO0KFSQA==\";\n        std::string pps = \"aMuNSA==\";\n\n        auto sps_decoded = base64_decode(sps);\n        auto pps_decoded = base64_decode(pps);\n\n        REQUIRE(base64_encode(sps_decoded.value()) == sps);\n        REQUIRE(base64_encode(pps_decoded.value()) == pps);\n    }\n\n    SECTION(\"malformed\")\n    {\n        REQUIRE(!base64_decode(\"a\"));\n        REQUIRE(!!base64_decode(\"aaaa\"));\n        REQUIRE(!base64_decode(\"aa=a\"));\n        REQUIRE(!base64_decode(\"a===\"));\n        REQUIRE(!base64_decode(\"a!==\"));\n        REQUIRE(!base64_decode(\"a@!=\"));\n        REQUIRE(!base64_decode(\"aa-a\"));\n        REQUIRE(!!base64_decode(\"aa+a\"));\n    }\n}\n\nTEST_CASE(\"base64 URL variant\")\n{\n    using namespace kl;\n\n    SECTION(\"encode\")\n    {\n        REQUIRE(base64url_encode(as_span(\"Hello\")) == \"SGVsbG8\");\n        REQUIRE(base64url_encode(as_span(\"Hello \")) == \"SGVsbG8g\");\n        REQUIRE(base64url_encode(as_span(\"Hello W\")) == \"SGVsbG8gVw\");\n        REQUIRE(base64url_encode(as_span(\"Hello Wo\")) == \"SGVsbG8gV28\");\n        REQUIRE(base64url_encode(as_span(\"Hello Wor\")) == \"SGVsbG8gV29y\");\n        REQUIRE(base64url_encode(as_span(\"Hello Worl\")) == \"SGVsbG8gV29ybA\");\n        REQUIRE(base64url_encode(as_span(\"Hello World\")) == \"SGVsbG8gV29ybGQ\");\n        REQUIRE(base64url_encode(as_span(\"Hello World!\")) == \"SGVsbG8gV29ybGQh\");\n        REQUIRE(base64url_encode(as_span(\"<<!_??_!>>\")) == \"PDwhXz8_XyE-Pg\");\n    }\n\n    SECTION(\"decode\")\n    {\n        REQUIRE(base64url_decode(\"SGVsbG8\").value() == as_vector(\"Hello\"));\n        REQUIRE(base64url_decode(\"SGVsbG8g\").value() == as_vector(\"Hello \"));\n        REQUIRE(base64url_decode(\"SGVsbG8gVw\").value() == as_vector(\"Hello W\"));\n        REQUIRE(base64url_decode(\"SGVsbG8gV28\").value() ==\n                as_vector(\"Hello Wo\"));\n        REQUIRE(base64url_decode(\"SGVsbG8gV29y\").value() ==\n                as_vector(\"Hello Wor\"));\n        REQUIRE(base64url_decode(\"SGVsbG8gV29ybA\").value() ==\n                as_vector(\"Hello Worl\"));\n        REQUIRE(base64url_decode(\"SGVsbG8gV29ybGQ\").value() ==\n                as_vector(\"Hello World\"));\n        REQUIRE(base64url_decode(\"SGVsbG8gV29ybGQh\").value() ==\n                as_vector(\"Hello World!\"));\n    }\n\n    SECTION(\"ignore '=' on the end\")\n    {\n        REQUIRE(base64url_decode(\"SGVsbG8gVw==\").value() ==\n                as_vector(\"Hello W\"));\n        REQUIRE(base64url_decode(\"SGVsbG8gVw=\").value() ==\n                as_vector(\"Hello W\"));\n        REQUIRE(base64url_decode(\"SGVsbG8gVw\").value() == as_vector(\"Hello W\"));\n        REQUIRE(!base64url_decode(\"SGVsbG8gVw===\"));\n    }\n\n    SECTION(\"range>127\")\n    {\n        std::string sps = \"Z0KAH5ZSAUB7YCoQAAADABAAAAMDzgYABJPgABGMP8Y4wMAAknwA\"\n                          \"AjGH-McO0KFSQA==\";\n        std::string pps = \"aMuNSA==\";\n\n        auto sps_decoded = base64url_decode(sps);\n        auto pps_decoded = base64url_decode(pps);\n\n        REQUIRE(base64url_encode(sps_decoded.value()) ==\n                sps.substr(0, sps.length() - 2));\n        REQUIRE(base64url_encode(pps_decoded.value()) ==\n                pps.substr(0, pps.length() - 2));\n    }\n\n    SECTION(\"malformed\")\n    {\n        REQUIRE(!base64url_decode(\"a\"));\n        REQUIRE(!!base64url_decode(\"aaaa\"));\n        REQUIRE(!base64url_decode(\"aa=a\"));\n        REQUIRE(!base64url_decode(\"a===\"));\n        REQUIRE(!base64url_decode(\"a!==\"));\n        REQUIRE(!base64url_decode(\"a@!=\"));\n        REQUIRE(!base64url_decode(\"aa+a\"));\n        REQUIRE(!!base64url_decode(\"aa-a\"));\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef __AIRSCHED_COM_CMD_TRAVELSOLUTIONPROVIDER_HPP\n#define __AIRSCHED_COM_CMD_TRAVELSOLUTIONPROVIDER_HPP\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Import section\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ STDAIR\n#include <stdair\/bom\/TravelSolutionTypes.hpp>\n\/\/ AIRSCHED\n#include <airsched\/command\/CmdAbstract.hpp>\n\n\/\/ Forward declarations\nnamespace stdair {\n  class Network;\n  struct BookingRequestStruct;\n}\n\nnamespace AIRSCHED {\n  \n  \/** Class handling the generation \/ instantiation of the travel\n      solution block and travel solutions. *\/\n  class TravelSolutionProvider : public CmdAbstract {\n    friend class AIRSCHED_Service;\n    \n  private:\n    \/\/ \/\/\/\/\/\/\/\/\/\/ Business Methods \/\/\/\/\/\/\/\/\/\n    \/** Calculate and return a list of travel solutions corresponding to a given\n        product demand. *\/\n    static void getTravelSolutions (stdair::TravelSolutionList_T&,\n                                    const stdair::Network&,\n                                    const stdair::BookingRequestStruct&);\n\n    \n    \/** Calculate and return a list of travel solutions corresponding to a given\n        product demand. *\/\n    static void getTravelSolutions (stdair::TravelSolutionList_T&,\n                                    const stdair::OutboundPathList_T&,\n                                    const stdair::BookingRequestStruct&);\n\n    \/** Calculate and return a list of travel solutions corresponding to a given\n        product demand. *\/\n    static void getTravelSolutions (stdair::TravelSolutionList_T&,\n                                    stdair::OutboundPath&,\n                                    const stdair::BookingRequestStruct&);\n  };\n\n}\n#endif \/\/ __AIRSCHED_COM_CMD_TRAVELSOLUTIONPROVIDER_HPP\n<commit_msg>[Cmd] Removed the CmdAbstract, as it is now part of StdAir.<commit_after>#ifndef __AIRSCHED_COM_CMD_TRAVELSOLUTIONPROVIDER_HPP\n#define __AIRSCHED_COM_CMD_TRAVELSOLUTIONPROVIDER_HPP\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Import section\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ STDAIR\n#include <stdair\/bom\/TravelSolutionTypes.hpp>\n#include <stdair\/command\/CmdAbstract.hpp>\n\n\/\/ Forward declarations\nnamespace stdair {\n  class Network;\n  struct BookingRequestStruct;\n}\n\nnamespace AIRSCHED {\n  \n  \/** Class handling the generation \/ instantiation of the travel\n      solution block and travel solutions. *\/\n  class TravelSolutionProvider : public stdair::CmdAbstract {\n    friend class AIRSCHED_Service;\n    \n  private:\n    \/\/ \/\/\/\/\/\/\/\/\/\/ Business Methods \/\/\/\/\/\/\/\/\/\n    \/** Calculate and return a list of travel solutions corresponding to a given\n        product demand. *\/\n    static void getTravelSolutions (stdair::TravelSolutionList_T&,\n                                    const stdair::Network&,\n                                    const stdair::BookingRequestStruct&);\n\n    \n    \/** Calculate and return a list of travel solutions corresponding to a given\n        product demand. *\/\n    static void getTravelSolutions (stdair::TravelSolutionList_T&,\n                                    const stdair::OutboundPathList_T&,\n                                    const stdair::BookingRequestStruct&);\n\n    \/** Calculate and return a list of travel solutions corresponding to a given\n        product demand. *\/\n    static void getTravelSolutions (stdair::TravelSolutionList_T&,\n                                    stdair::OutboundPath&,\n                                    const stdair::BookingRequestStruct&);\n  };\n\n}\n#endif \/\/ __AIRSCHED_COM_CMD_TRAVELSOLUTIONPROVIDER_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Software License Agreement (Apache License)\n *\n * Copyright (c) 2014, Southwest Research Institute\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 <industrial_extrinsic_cal\/calibration_job_definition.h>\n\nusing industrial_extrinsic_cal::CalibrationJob;\nusing std::string;\nint main(int argc, char **argv)\n{\n  ros::init(argc, argv, \"my_node_name\");\n  string camera_file_name(\n      \"\/home\/cgomez\/ros\/hydro\/catkin_ws\/src\/industrial_calibration\/industrial_extrinsic_cal\/yaml\/test1_camera_def.yaml\");\n  string target_file_name(\n      \"\/home\/cgomez\/ros\/hydro\/catkin_ws\/src\/industrial_calibration\/industrial_extrinsic_cal\/yaml\/test1_target_def.yaml\");\n  string caljob_file_name(\n      \"\/home\/cgomez\/ros\/hydro\/catkin_ws\/src\/industrial_calibration\/industrial_extrinsic_cal\/yaml\/test1_caljob_def.yaml\");\n  CalibrationJob Cal_job(camera_file_name, target_file_name, caljob_file_name);\n  \/\/ROS_INFO_STREAM(\"hello world \");\n  if (Cal_job.load())\n  {\n    ROS_INFO_STREAM(\"Calibration job (cal_job, target and camera) yaml parameters loaded.\");\n  }\n  if (Cal_job.run())\n  {\n    ROS_INFO_STREAM(\"Calibration job observations run\");\n  }\n}\n<commit_msg>Added print function. Tried to get original extrinsics to compare to optimized extrinsics. Original extrinsics do not seem correct, more changes to come.<commit_after>\/*\n * Software License Agreement (Apache License)\n *\n * Copyright (c) 2014, Southwest Research Institute\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 <industrial_extrinsic_cal\/calibration_job_definition.h>\n#include <industrial_extrinsic_cal\/observation_data_point.h>\n\nusing industrial_extrinsic_cal::CalibrationJob;\nusing std::string;\n\nvoid print_AAtoH(double x, double y, double z, double tx, double ty, double tz);\nint main(int argc, char **argv)\n{\n  ros::init(argc, argv, \"my_node_name\");\n  string camera_file_name(\n      \"\/home\/cgomez\/ros\/hydro\/catkin_ws\/src\/industrial_calibration\/industrial_extrinsic_cal\/yaml\/test1a_camera_def.yaml\");\n  string target_file_name(\n      \"\/home\/cgomez\/ros\/hydro\/catkin_ws\/src\/industrial_calibration\/industrial_extrinsic_cal\/yaml\/test1_target_def.yaml\");\n  string caljob_file_name(\n      \"\/home\/cgomez\/ros\/hydro\/catkin_ws\/src\/industrial_calibration\/industrial_extrinsic_cal\/yaml\/test1a_caljob_def.yaml\");\n  CalibrationJob Cal_job(camera_file_name, target_file_name, caljob_file_name);\n  \/\/ROS_INFO_STREAM(\"hello world \");\n  if (Cal_job.load())\n  {\n    ROS_INFO_STREAM(\"Calibration job (cal_job, target and camera) yaml parameters loaded.\");\n  }\n\n  industrial_extrinsic_cal::CeresBlocks c_blocks = Cal_job.getCeresBlocks();\n  \/\/c_blocks.static_cameras_.at(0)->camera_parameters_.pb_extrinsics;\n  industrial_extrinsic_cal::P_BLOCK original_extrinsics= c_blocks.static_cameras_.at(0)->camera_parameters_.pb_extrinsics;\/\/c_blocks.getStaticCameraParameterBlockExtrinsics(\"Asus1\");\n\n  if (Cal_job.run())\n  {\n    ROS_INFO_STREAM(\"Calibration job observations and optimization complete\");\n  }\n\n  \/\/industrial_extrinsic_cal::P_BLOCK original_extrinsics= c_blocks.getStaticCameraParameterBlockExtrinsics(\"Asus1\");\n  industrial_extrinsic_cal::P_BLOCK optimized_extrinsics = Cal_job.getExtrinsics();\n\n  printf(\"World to Camera\\n\");\n  printf(\"Original Camera\\n\");\n  print_AAtoH(original_extrinsics[0], original_extrinsics[1], original_extrinsics[2],\n               original_extrinsics[3], original_extrinsics[4], original_extrinsics[5]);\n  printf(\"Optimized Camera\\n\");\n  print_AAtoH(optimized_extrinsics[0], optimized_extrinsics[1], optimized_extrinsics[2],\n               optimized_extrinsics[3], optimized_extrinsics[4], optimized_extrinsics[5]);\n}\n\n\/\/ angle axis to homogeneous transform inverted\nvoid print_AAtoH(double x, double y, double z, double tx, double ty, double tz)\n{\n  double R[9];\n  double aa[3];\n  aa[0] = x;\n  aa[1] = y;\n  aa[2] = z;\n  ceres::AngleAxisToRotationMatrix(aa, R);\n  printf(\"%6.3lf %6.3lf %6.3lf %6.3lf\\n\", R[0], R[3], R[6], tx);\n  printf(\"%6.3lf %6.3lf %6.3lf %6.3lf\\n\", R[1], R[4], R[7], ty);\n  printf(\"%6.3lf %6.3lf %6.3lf %6.3lf\\n\", R[2], R[5], R[8], tz);\n  printf(\"%6.3lf %6.3lf %6.3lf %6.3lf\\n\", 0.0, 0.0, 0.0, 1.0);\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *  encodeinput.cpp - encode test input\n *\n *  Copyright (C) 2011-2014 Intel Corporation\n *    Author: Cong Zhong<congx.zhong@intel.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 *  as published by the Free Software Foundation; either version 2.1\n *  of the License, or (at your option) any later version.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  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 Street, Fifth Floor,\n *  Boston, MA 02110-1301 USA\n *\/\n#ifdef HAVE_CONFIG_H\n#include \"config.h\"\n#endif\n\n#include <stdio.h>\n#include <unistd.h>\n#include <string.h>\n#include <stdlib.h>\n#include <assert.h>\n#include <ctype.h>\n#include \"common\/log.h\"\n#include \"common\/utils.h\"\n\n#include \"encodeinput.h\"\n#include \"encodeInputDecoder.h\"\n\nusing namespace YamiMediaCodec;\n\nEncodeInput * EncodeInput::create(const char* inputFileName, uint32_t fourcc, int width, int height)\n{\n    EncodeInput *input = NULL;\n    if (!inputFileName)\n        return NULL;\n\n    DecodeInput* decodeInput = DecodeInput::create(inputFileName);\n    if (decodeInput) {\n        input = new EncodeInputDecoder(decodeInput);\n    } else if (!strncmp(inputFileName, \"\/dev\/video\", strlen(\"\/dev\/video\"))) {\n        input = new EncodeInputCamera;\n    } else {\n        input =  new EncodeInputFile;\n    }\n\n    if (!input)\n        return NULL;\n\n    if (!(input->init(inputFileName, fourcc, width, height)))\n        return NULL;\n\n    return input;\n}\n\nEncodeInputFile::EncodeInputFile()\n    : m_fp(NULL)\n    , m_buffer(NULL)\n    , m_readToEOS(false)\n{\n}\n\nbool EncodeInputFile::init(const char* inputFileName, uint32_t fourcc, int width, int height)\n{\n    if (!width || !height) {\n        if (!guessResolution(inputFileName, width, height)) {\n            fprintf(stderr, \"failed to guess input width and height\\n\");\n            return false;\n        }\n    }\n    m_width = width;\n    m_height = height;\n    m_fourcc = fourcc;\n\n    if (!m_fourcc)\n        m_fourcc = guessFourcc(inputFileName);\n\n    if (!m_fourcc)\n        m_fourcc = VA_FOURCC('I', '4', '2', '0');\n\n    switch (m_fourcc) {\n    case VA_FOURCC_NV12:\n    case VA_FOURCC('I', '4', '2', '0'):\n    case VA_FOURCC_YV12:\n        m_frameSize = m_width * m_height * 3 \/ 2;\n    break;\n    case VA_FOURCC_YUY2:\n        m_frameSize = m_width * m_height * 2;\n    break;\n    default:\n        ASSERT(0);\n    break;\n    }\n\n    m_fp = fopen(inputFileName, \"r\");\n    if (!m_fp) {\n        fprintf(stderr, \"fail to open input file: %s\", inputFileName);\n        return false;\n    }\n\n    m_buffer = static_cast<uint8_t*>(malloc(m_frameSize));\n    return true;\n}\n\nbool EncodeInputFile::getOneFrameInput(VideoFrameRawData &inputBuffer)\n{\n    if (m_readToEOS)\n        return false;\n\n    uint8_t *buffer = m_buffer;\n    if (inputBuffer.handle)\n        buffer = reinterpret_cast<uint8_t*>(inputBuffer.handle);\n\n    int ret = fread(buffer, sizeof(uint8_t), m_frameSize, m_fp);\n\n    if (ret <= 0) {\n        m_readToEOS = true;\n        return false;\n    }\n\n    if (ret < m_frameSize) {\n        fprintf (stderr, \"data is not enough to read, maybe resolution is wrong\\n\");\n        return false;\n    }\n\n    return fillFrameRawData(&inputBuffer, m_fourcc, m_width, m_height, buffer);\n}\n\nEncodeInputFile::~EncodeInputFile()\n{\n    if(m_fp)\n        fclose(m_fp);\n\n    if(m_buffer)\n        free(m_buffer);\n}\n\nEncodeOutput::EncodeOutput():m_fp(NULL)\n{\n}\n\nEncodeOutput::~EncodeOutput()\n{\n    if (m_fp)\n        fclose(m_fp);\n}\n\nEncodeOutput* EncodeOutput::create(const char* outputFileName, int width , int height)\n{\n    EncodeOutput * output = NULL;\n    if(outputFileName==NULL)\n        return NULL;\n    const char *ext = strrchr(outputFileName,'.');\n    if(ext==NULL)\n        return NULL;\n    ext++;\/\/h264;264;jsv;avc;26l;jvt;ivf\n    if(strcasecmp(ext,\"h264\")==0 ||\n        strcasecmp(ext,\"264\")==0 ||\n        strcasecmp(ext,\"jsv\")==0 ||\n        strcasecmp(ext,\"avc\")==0 ||\n        strcasecmp(ext,\"26l\")==0 ||\n        strcasecmp(ext,\"jvt\")==0 ) {\n            output = new EncodeOutputH264();\n    }\n    else if((strcasecmp(ext,\"ivf\")==0) ||\n            (strcasecmp(ext,\"vp8\")==0)) {\n            output = new EncodeOutputVP8();\n    }\n    else if((strcasecmp(ext,\"jpg\")==0) ||\n               (strcasecmp(ext,\"jpeg\")==0)) {\n               output = new EncodeStreamOutputJpeg();\n   }\n    else\n        return NULL;\n\n    if(!output->init(outputFileName, width, height)) {\n        delete output;\n        return NULL;\n    }\n    return output;\n}\n\nbool EncodeOutput::init(const char* outputFileName, int width , int height)\n{\n    m_fp = fopen(outputFileName, \"w+\");\n    if (!m_fp) {\n        fprintf(stderr, \"fail to open output file: %s\\n\", outputFileName);\n        return false;\n    }\n    return true;\n}\n\nbool EncodeOutput::write(void* data, int size)\n{\n    return fwrite(data, 1, size, m_fp) == size;\n}\n\nconst char* EncodeOutputH264::getMimeType()\n{\n    return YAMI_MIME_H264;\n}\n\nconst char* EncodeStreamOutputJpeg::getMimeType()\n{\n    return \"image\/jpeg\";\n}\n\nconst char* EncodeOutputVP8::getMimeType()\n{\n    return YAMI_MIME_VP8;\n}\n\nvoid setUint32(uint8_t* header, uint32_t value)\n{\n    uint32_t* h = (uint32_t*)header;\n    *h = value;\n}\n\nvoid setUint16(uint8_t* header, uint16_t value)\n{\n    uint16_t* h = (uint16_t*)header;\n    *h = value;\n}\n\nstatic void get_ivf_file_header(uint8_t *header, int width, int height,int count)\n{\n    setUint32(header, 'FIKD');\n    setUint16(header+4, 0);                     \/* version *\/\n    setUint16(header+6,  32);                   \/* headersize *\/\n    setUint32(header+8,  '08PV');               \/* headersize *\/\n    setUint16(header+12, width);                \/* width *\/\n    setUint16(header+14, height);               \/* height *\/\n    setUint32(header+16, 1);                    \/* rate *\/\n    setUint32(header+20, 1);                    \/* scale *\/\n    setUint32(header+24, count);                \/* length *\/\n    setUint32(header+28, 0);                    \/* unused *\/\n}\n\nbool EncodeOutputVP8::init(const char* outputFileName, int width , int height)\n{\n    if (!EncodeOutput::init(outputFileName, width, height))\n        return false;\n    uint8_t header[32];\n    get_ivf_file_header(header, width, height, m_frameCount);\n    return EncodeOutput::write(header, sizeof(header));\n}\n\nbool EncodeOutputVP8::write(void* data, int size)\n{\n    uint8_t header[12];\n    memset(header, 0, sizeof(header));\n    setUint32(header, size);\n    if (!EncodeOutput::write(&header, sizeof(header)))\n        return false;\n    if (!EncodeOutput::write(data, size))\n        return false;\n    m_frameCount++;\n    return true;\n}\nEncodeOutputVP8::EncodeOutputVP8():m_frameCount(0){}\n\nEncodeOutputVP8::~EncodeOutputVP8()\n{\n    if (m_fp && !fseek(m_fp, 24,SEEK_SET)) {\n        EncodeOutput::write(&m_frameCount, sizeof(m_frameCount));\n    }\n}\n\nbool createOutputBuffer(VideoEncOutputBuffer* outputBuffer, int maxOutSize)\n{\n    outputBuffer->data = static_cast<uint8_t*>(malloc(maxOutSize));\n    if (!outputBuffer->data)\n        return false;\n    outputBuffer->bufferSize = maxOutSize;\n    outputBuffer->format = OUTPUT_EVERYTHING;\n    return true;\n}\n\n#ifdef __BUILD_GET_MV__\nbool createMVBuffer(VideoEncMVBuffer* MVBuffer, int Size)\n{\n    MVBuffer->data = static_cast<uint8_t*>(malloc(Size));\n    if (!MVBuffer->data)\n        return false;\n    MVBuffer->bufferSize = Size;\n    return true;\n}\n#endif\n<commit_msg>tests: set default fps to 30 for .vp8 container<commit_after>\/*\n *  encodeinput.cpp - encode test input\n *\n *  Copyright (C) 2011-2014 Intel Corporation\n *    Author: Cong Zhong<congx.zhong@intel.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 *  as published by the Free Software Foundation; either version 2.1\n *  of the License, or (at your option) any later version.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  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 Street, Fifth Floor,\n *  Boston, MA 02110-1301 USA\n *\/\n#ifdef HAVE_CONFIG_H\n#include \"config.h\"\n#endif\n\n#include <stdio.h>\n#include <unistd.h>\n#include <string.h>\n#include <stdlib.h>\n#include <assert.h>\n#include <ctype.h>\n#include \"common\/log.h\"\n#include \"common\/utils.h\"\n\n#include \"encodeinput.h\"\n#include \"encodeInputDecoder.h\"\n\nusing namespace YamiMediaCodec;\n\nEncodeInput * EncodeInput::create(const char* inputFileName, uint32_t fourcc, int width, int height)\n{\n    EncodeInput *input = NULL;\n    if (!inputFileName)\n        return NULL;\n\n    DecodeInput* decodeInput = DecodeInput::create(inputFileName);\n    if (decodeInput) {\n        input = new EncodeInputDecoder(decodeInput);\n    } else if (!strncmp(inputFileName, \"\/dev\/video\", strlen(\"\/dev\/video\"))) {\n        input = new EncodeInputCamera;\n    } else {\n        input =  new EncodeInputFile;\n    }\n\n    if (!input)\n        return NULL;\n\n    if (!(input->init(inputFileName, fourcc, width, height)))\n        return NULL;\n\n    return input;\n}\n\nEncodeInputFile::EncodeInputFile()\n    : m_fp(NULL)\n    , m_buffer(NULL)\n    , m_readToEOS(false)\n{\n}\n\nbool EncodeInputFile::init(const char* inputFileName, uint32_t fourcc, int width, int height)\n{\n    if (!width || !height) {\n        if (!guessResolution(inputFileName, width, height)) {\n            fprintf(stderr, \"failed to guess input width and height\\n\");\n            return false;\n        }\n    }\n    m_width = width;\n    m_height = height;\n    m_fourcc = fourcc;\n\n    if (!m_fourcc)\n        m_fourcc = guessFourcc(inputFileName);\n\n    if (!m_fourcc)\n        m_fourcc = VA_FOURCC('I', '4', '2', '0');\n\n    switch (m_fourcc) {\n    case VA_FOURCC_NV12:\n    case VA_FOURCC('I', '4', '2', '0'):\n    case VA_FOURCC_YV12:\n        m_frameSize = m_width * m_height * 3 \/ 2;\n    break;\n    case VA_FOURCC_YUY2:\n        m_frameSize = m_width * m_height * 2;\n    break;\n    default:\n        ASSERT(0);\n    break;\n    }\n\n    m_fp = fopen(inputFileName, \"r\");\n    if (!m_fp) {\n        fprintf(stderr, \"fail to open input file: %s\", inputFileName);\n        return false;\n    }\n\n    m_buffer = static_cast<uint8_t*>(malloc(m_frameSize));\n    return true;\n}\n\nbool EncodeInputFile::getOneFrameInput(VideoFrameRawData &inputBuffer)\n{\n    if (m_readToEOS)\n        return false;\n\n    uint8_t *buffer = m_buffer;\n    if (inputBuffer.handle)\n        buffer = reinterpret_cast<uint8_t*>(inputBuffer.handle);\n\n    int ret = fread(buffer, sizeof(uint8_t), m_frameSize, m_fp);\n\n    if (ret <= 0) {\n        m_readToEOS = true;\n        return false;\n    }\n\n    if (ret < m_frameSize) {\n        fprintf (stderr, \"data is not enough to read, maybe resolution is wrong\\n\");\n        return false;\n    }\n\n    return fillFrameRawData(&inputBuffer, m_fourcc, m_width, m_height, buffer);\n}\n\nEncodeInputFile::~EncodeInputFile()\n{\n    if(m_fp)\n        fclose(m_fp);\n\n    if(m_buffer)\n        free(m_buffer);\n}\n\nEncodeOutput::EncodeOutput():m_fp(NULL)\n{\n}\n\nEncodeOutput::~EncodeOutput()\n{\n    if (m_fp)\n        fclose(m_fp);\n}\n\nEncodeOutput* EncodeOutput::create(const char* outputFileName, int width , int height)\n{\n    EncodeOutput * output = NULL;\n    if(outputFileName==NULL)\n        return NULL;\n    const char *ext = strrchr(outputFileName,'.');\n    if(ext==NULL)\n        return NULL;\n    ext++;\/\/h264;264;jsv;avc;26l;jvt;ivf\n    if(strcasecmp(ext,\"h264\")==0 ||\n        strcasecmp(ext,\"264\")==0 ||\n        strcasecmp(ext,\"jsv\")==0 ||\n        strcasecmp(ext,\"avc\")==0 ||\n        strcasecmp(ext,\"26l\")==0 ||\n        strcasecmp(ext,\"jvt\")==0 ) {\n            output = new EncodeOutputH264();\n    }\n    else if((strcasecmp(ext,\"ivf\")==0) ||\n            (strcasecmp(ext,\"vp8\")==0)) {\n            output = new EncodeOutputVP8();\n    }\n    else if((strcasecmp(ext,\"jpg\")==0) ||\n               (strcasecmp(ext,\"jpeg\")==0)) {\n               output = new EncodeStreamOutputJpeg();\n   }\n    else\n        return NULL;\n\n    if(!output->init(outputFileName, width, height)) {\n        delete output;\n        return NULL;\n    }\n    return output;\n}\n\nbool EncodeOutput::init(const char* outputFileName, int width , int height)\n{\n    m_fp = fopen(outputFileName, \"w+\");\n    if (!m_fp) {\n        fprintf(stderr, \"fail to open output file: %s\\n\", outputFileName);\n        return false;\n    }\n    return true;\n}\n\nbool EncodeOutput::write(void* data, int size)\n{\n    return fwrite(data, 1, size, m_fp) == size;\n}\n\nconst char* EncodeOutputH264::getMimeType()\n{\n    return YAMI_MIME_H264;\n}\n\nconst char* EncodeStreamOutputJpeg::getMimeType()\n{\n    return \"image\/jpeg\";\n}\n\nconst char* EncodeOutputVP8::getMimeType()\n{\n    return YAMI_MIME_VP8;\n}\n\nvoid setUint32(uint8_t* header, uint32_t value)\n{\n    uint32_t* h = (uint32_t*)header;\n    *h = value;\n}\n\nvoid setUint16(uint8_t* header, uint16_t value)\n{\n    uint16_t* h = (uint16_t*)header;\n    *h = value;\n}\n\nstatic void get_ivf_file_header(uint8_t *header, int width, int height,int count)\n{\n    setUint32(header, 'FIKD');\n    setUint16(header+4, 0);                     \/* version *\/\n    setUint16(header+6,  32);                   \/* headersize *\/\n    setUint32(header+8,  '08PV');               \/* headersize *\/\n    setUint16(header+12, width);                \/* width *\/\n    setUint16(header+14, height);               \/* height *\/\n    setUint32(header+16, 30);                    \/* rate *\/\n    setUint32(header+20, 1);                    \/* scale *\/\n    setUint32(header+24, count);                \/* length *\/\n    setUint32(header+28, 0);                    \/* unused *\/\n}\n\nbool EncodeOutputVP8::init(const char* outputFileName, int width , int height)\n{\n    if (!EncodeOutput::init(outputFileName, width, height))\n        return false;\n    uint8_t header[32];\n    get_ivf_file_header(header, width, height, m_frameCount);\n    return EncodeOutput::write(header, sizeof(header));\n}\n\nbool EncodeOutputVP8::write(void* data, int size)\n{\n    uint8_t header[12];\n    memset(header, 0, sizeof(header));\n    setUint32(header, size);\n    if (!EncodeOutput::write(&header, sizeof(header)))\n        return false;\n    if (!EncodeOutput::write(data, size))\n        return false;\n    m_frameCount++;\n    return true;\n}\nEncodeOutputVP8::EncodeOutputVP8():m_frameCount(0){}\n\nEncodeOutputVP8::~EncodeOutputVP8()\n{\n    if (m_fp && !fseek(m_fp, 24,SEEK_SET)) {\n        EncodeOutput::write(&m_frameCount, sizeof(m_frameCount));\n    }\n}\n\nbool createOutputBuffer(VideoEncOutputBuffer* outputBuffer, int maxOutSize)\n{\n    outputBuffer->data = static_cast<uint8_t*>(malloc(maxOutSize));\n    if (!outputBuffer->data)\n        return false;\n    outputBuffer->bufferSize = maxOutSize;\n    outputBuffer->format = OUTPUT_EVERYTHING;\n    return true;\n}\n\n#ifdef __BUILD_GET_MV__\nbool createMVBuffer(VideoEncMVBuffer* MVBuffer, int Size)\n{\n    MVBuffer->data = static_cast<uint8_t*>(malloc(Size));\n    if (!MVBuffer->data)\n        return false;\n    MVBuffer->bufferSize = Size;\n    return true;\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2021 The IREE Authors\n\/\/\n\/\/ Licensed 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#include \"iree\/compiler\/InputConversion\/TOSA\/Passes.h\"\n\n#include \"iree\/compiler\/Dialect\/Flow\/Transforms\/Passes.h\"\n#include \"iree\/compiler\/InputConversion\/Common\/Passes.h\"\n#include \"mlir\/Conversion\/TosaToLinalg\/TosaToLinalg.h\"\n#include \"mlir\/Conversion\/TosaToSCF\/TosaToSCF.h\"\n#include \"mlir\/Conversion\/TosaToStandard\/TosaToStandard.h\"\n#include \"mlir\/Dialect\/Tosa\/Transforms\/Passes.h\"\n#include \"mlir\/Pass\/PassOptions.h\"\n#include \"mlir\/Pass\/PassRegistry.h\"\n#include \"mlir\/Transforms\/Passes.h\"\n\nnamespace mlir {\nnamespace iree_compiler {\n\nvoid registerTOSAConversionPassPipeline() {\n  PassPipelineRegistration<> tosa(\n      \"iree-tosa-input-transformation-pipeline\",\n      \"Runs the TOSA IREE flow dialect transformation pipeline\",\n      [](OpPassManager &passManager) {\n        buildTOSAInputConversionPassPipeline(passManager);\n      });\n}\n\n\/\/ Prepare TOSA for use as an input to the Flow dialect.\nvoid buildTOSAInputConversionPassPipeline(OpPassManager &passManager) {\n  \/\/ Currently we don't handle SCF ops well and have to convert them all to CFG.\n  \/\/ In the future it would be nice if we could have all of flow be both scf\n  \/\/ and cfg compatible.\n  passManager.addNestedPass<FuncOp>(tosa::createTosaToSCF());\n  passManager.addNestedPass<FuncOp>(createTopLevelSCFToCFGPass());\n\n  \/\/ We also don't handle calls well on the old codepath; until we remove the\n  \/\/ use of the CFG we can continue inlining.\n  passManager.addPass(mlir::createInlinerPass());\n\n  passManager.addNestedPass<FuncOp>(tosa::createTosaMakeBroadcastablePass());\n  passManager.addNestedPass<FuncOp>(tosa::createTosaToStandard());\n  passManager.addNestedPass<FuncOp>(mlir::createCanonicalizerPass());\n  passManager.addNestedPass<FuncOp>(IREE::Flow::createPromoteI1ToI8Pass());\n  passManager.addNestedPass<FuncOp>(tosa::createTosaToLinalg());\n  passManager.addNestedPass<FuncOp>(IREE::Flow::createStripSignednessPass());\n  passManager.addNestedPass<FuncOp>(mlir::createCanonicalizerPass());\n\n  \/\/----------------------------------------------------------------------------\n  \/\/ Entry dialect cleanup\n  \/\/----------------------------------------------------------------------------\n  passManager.addPass(createVerifyCompilerTOSAInputLegality());\n}\n\nnamespace {\n#define GEN_PASS_REGISTRATION\n#include \"iree\/compiler\/InputConversion\/TOSA\/Passes.h.inc\"  \/\/ IWYU pragma: export\n}  \/\/ namespace\n\nvoid registerTOSAConversionPasses() {\n  \/\/ Generated.\n  registerPasses();\n\n  \/\/ Pipelines.\n  registerTOSAConversionPassPipeline();\n}\n\n}  \/\/ namespace iree_compiler\n}  \/\/ namespace mlir\n<commit_msg>Use the entire TosaToLinalg pass chain<commit_after>\/\/ Copyright 2021 The IREE Authors\n\/\/\n\/\/ Licensed 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#include \"iree\/compiler\/InputConversion\/TOSA\/Passes.h\"\n\n#include \"iree\/compiler\/Dialect\/Flow\/Transforms\/Passes.h\"\n#include \"iree\/compiler\/InputConversion\/Common\/Passes.h\"\n#include \"mlir\/Conversion\/TosaToLinalg\/TosaToLinalg.h\"\n#include \"mlir\/Conversion\/TosaToSCF\/TosaToSCF.h\"\n#include \"mlir\/Conversion\/TosaToStandard\/TosaToStandard.h\"\n#include \"mlir\/Dialect\/Tosa\/Transforms\/Passes.h\"\n#include \"mlir\/Pass\/PassOptions.h\"\n#include \"mlir\/Pass\/PassRegistry.h\"\n#include \"mlir\/Transforms\/Passes.h\"\n\nnamespace mlir {\nnamespace iree_compiler {\n\nvoid registerTOSAConversionPassPipeline() {\n  PassPipelineRegistration<> tosa(\n      \"iree-tosa-input-transformation-pipeline\",\n      \"Runs the TOSA IREE flow dialect transformation pipeline\",\n      [](OpPassManager &passManager) {\n        buildTOSAInputConversionPassPipeline(passManager);\n      });\n}\n\n\/\/ Prepare TOSA for use as an input to the Flow dialect.\nvoid buildTOSAInputConversionPassPipeline(OpPassManager &passManager) {\n  \/\/ Currently we don't handle SCF ops well and have to convert them all to CFG.\n  \/\/ In the future it would be nice if we could have all of flow be both scf\n  \/\/ and cfg compatible.\n  passManager.addNestedPass<FuncOp>(tosa::createTosaToSCF());\n  passManager.addNestedPass<FuncOp>(createTopLevelSCFToCFGPass());\n\n  \/\/ We also don't handle calls well on the old codepath; until we remove the\n  \/\/ use of the CFG we can continue inlining.\n  passManager.addPass(mlir::createInlinerPass());\n\n  passManager.addNestedPass<FuncOp>(tosa::createTosaMakeBroadcastablePass());\n  passManager.addNestedPass<FuncOp>(tosa::createTosaToStandard());\n  passManager.addNestedPass<FuncOp>(mlir::createCanonicalizerPass());\n  passManager.addNestedPass<FuncOp>(IREE::Flow::createPromoteI1ToI8Pass());\n  tosa::addTosaToLinalgPasses(passManager);\n  passManager.addNestedPass<FuncOp>(IREE::Flow::createStripSignednessPass());\n  passManager.addNestedPass<FuncOp>(mlir::createCanonicalizerPass());\n\n  \/\/----------------------------------------------------------------------------\n  \/\/ Entry dialect cleanup\n  \/\/----------------------------------------------------------------------------\n  passManager.addPass(createVerifyCompilerTOSAInputLegality());\n}\n\nnamespace {\n#define GEN_PASS_REGISTRATION\n#include \"iree\/compiler\/InputConversion\/TOSA\/Passes.h.inc\"  \/\/ IWYU pragma: export\n}  \/\/ namespace\n\nvoid registerTOSAConversionPasses() {\n  \/\/ Generated.\n  registerPasses();\n\n  \/\/ Pipelines.\n  registerTOSAConversionPassPipeline();\n}\n\n}  \/\/ namespace iree_compiler\n}  \/\/ namespace mlir\n<|endoftext|>"}
{"text":"<commit_before>\/* v.0.16 25 August 2015\n * Kevin CAIN, www.insightdigital.org\n * Adapted from the openMVG libraries,\n * Copyright (c) 2012-2015 Pierre MOULON.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#include \"openMVG\/sfm\/sfm.hpp\"\n#include \"openMVG\/image\/image.hpp\"\n\nusing namespace openMVG;\nusing namespace openMVG::cameras;\nusing namespace openMVG::geometry;\nusing namespace openMVG::image;\nusing namespace openMVG::sfm;\nusing namespace openMVG::features;\n\n#include \"third_party\/cmdLine\/cmdLine.h\"\n#include \"third_party\/progress\/progress.hpp\"\n#include <stdlib.h>\n#include <stdio.h>\n#include <cmath>\n#include <iterator>\n#include <iomanip>\n\n\/\/\/ Naive image bilinear resampling of an image for thumbnail generation\ntemplate <typename ImageT>\nImageT\ncreate_thumbnail\n(\n  const ImageT & image,\n  int thumb_width,\n  int thumb_height\n);\n\n\/* Notes:\n * - An MVE2 scene appears to duplicate camera rot matrix and trans vector per-view data in 'meta.ini'\n *   within the first section of 'synth_0.out'.\n * - We do not save the original, instead we rely on the undistorted image from openMVG.\n * - We do not output thumbnails or EXIF blobs, as these appear only to be used only for the GUI UMVE.\n * - To avoid encoding loss, openMVG images should be written as .PNG if undistorted images are *not* computed.\n * - In OpenMVG, some views may have some missing poses; MVE does *not* require a contiguous camera index.\n *\n *  For information on the target for this conversion, please see the MVE (v2) File format:\n *  https:\/\/github.com\/simonfuhrmann\/mve\/wiki\/MVE-File-Format\n *\/\n\nbool exportToMVE2Format(\n  const SfM_Data & sfm_data,\n  const std::string & sOutDirectory \/\/ Output MVE2 files directory\n  )\n{\n  bool bOk = true;\n  \/\/ Create basis directory structure\n  if (!stlplus::is_folder(sOutDirectory))\n  {\n    cout << \"\\033[1;31mCreating directory:  \" << sOutDirectory << \"\\033[0m\\n\";\n    stlplus::folder_create(sOutDirectory);\n    bOk = stlplus::is_folder(sOutDirectory);\n  }\n\n  if (!bOk)\n  {\n    std::cerr << \"Cannot access one of the desired output directories\" << std::endl;\n\t  return false;\n  }\n\n  \/\/ Export the SfM_Data scene to the MVE2 format\n  {\n    \/\/ Create 'views' subdirectory\n    const string sOutViewsDirectory = stlplus::folder_append_separator(sOutDirectory) + \"views\";\n    if (!stlplus::folder_exists(sOutViewsDirectory))\n    {\n      cout << \"\\033[1;31mCreating directory:  \" << sOutViewsDirectory << \"\\033[0m\\n\";\n      stlplus::folder_create(sOutViewsDirectory);\n    }\n\n    \/\/ Prepare to write bundle file\n    \/\/ Get cameras and features from OpenMVG\n    const size_t cameraCount = std::distance(sfm_data.GetViews().begin(), sfm_data.GetViews().end());\n    \/\/ Tally global set of feature landmarks\n    const Landmarks & landmarks = sfm_data.GetLandmarks();\n    const size_t featureCount = std::distance(landmarks.begin(), landmarks.end());\n    const std::string filename = \"synth_0.out\";\n    std::cout << \"Writing bundle (\" << cameraCount << \" cameras, \"\n        << featureCount << \" features): to \" << filename << \"...\\n\";\n    std::ofstream out(stlplus::folder_append_separator(sOutDirectory) + filename);\n    out << \"drews 1.0\\n\";  \/\/ MVE expects this header\n    out << cameraCount << \" \" << featureCount << \"\\n\";\n\n    \/\/ Export (calibrated) views as undistorted images\n    C_Progress_display my_progress_bar(sfm_data.GetViews().size());\n    std::pair<int,int> w_h_image_size;\n    Image<RGBColor> image, image_ud, thumbnail;\n    std::string sOutViewIteratorDirectory;\n    for(Views::const_iterator iter = sfm_data.GetViews().begin();\n      iter != sfm_data.GetViews().end(); ++iter, ++my_progress_bar)\n    {\n      const View * view = iter->second.get();\n\n      \/\/ Create current view subdirectory 'view_xxxx.mve'\n      std::ostringstream padding;\n      padding << std::setw(4) << std::setfill('0') << view->id_view;\n      sOutViewIteratorDirectory = stlplus::folder_append_separator(sOutViewsDirectory) + \"view_\" + padding.str() + \".mve\";\n\n      \/\/ We have a valid view with a corresponding camera & pose\n      const std::string srcImage = stlplus::create_filespec(sfm_data.s_root_path, view->s_Img_path);\n      const std::string dstImage =\n        stlplus::create_filespec(stlplus::folder_append_separator(sOutViewIteratorDirectory), \"undistorted\",\"png\");\n\n      if (sfm_data.IsPoseAndIntrinsicDefined(view))\n      {\n        if (!stlplus::folder_exists(sOutViewIteratorDirectory))\n        {\n          stlplus::folder_create(sOutViewIteratorDirectory);\n        }\n\n        Intrinsics::const_iterator iterIntrinsic = sfm_data.GetIntrinsics().find(view->id_intrinsic);\n        const IntrinsicBase * cam = iterIntrinsic->second.get();\n        if (cam->have_disto())\n        {\n          \/\/ Undistort and save the image\n          ReadImage(srcImage.c_str(), &image);\n          UndistortImage(image, cam, image_ud, BLACK);\n          WriteImage(dstImage.c_str(), image_ud);\n        }\n        else \/\/ (no distortion)\n        {\n          \/\/ If extensions match, copy the PNG image\n          if (stlplus::extension_part(srcImage) == \"PNG\" ||\n            stlplus::extension_part(srcImage) == \"png\")\n          {\n            stlplus::file_copy(srcImage, dstImage);\n          }\n          else\n          {\n            ReadImage( srcImage.c_str(), &image);\n            WriteImage( dstImage.c_str(), image);\n          }\n        }\n\n        \/\/ Prepare to write an MVE 'meta.ini' file for the current view\n        const Pose3 pose = sfm_data.GetPoseOrDie(view);\n        const Pinhole_Intrinsic * pinhole_cam = static_cast<const Pinhole_Intrinsic *>(cam);\n\n        const Mat3 rotation = pose.rotation();\n        const Vec3 translation = pose.translation();\n        \/\/ Pixel aspect: assuming square pixels\n        const float pixelAspect = 1.f;\n        \/\/ Focal length and principal point must be normalized (0..1)\n        const float flen = pinhole_cam->focal() \/ static_cast<double>(std::max(cam->w(), cam->h()));\n        const float ppX = std::abs(pinhole_cam->principal_point()(0)\/cam->w());\n        const float ppY = std::abs(pinhole_cam->principal_point()(1)\/cam->h());\n\n        \/\/ For each camera, write to bundle:  focal length, radial distortion[0-1], rotation matrix[0-8], translation vector[0-2]\n        std::ostringstream fileOut;\n        fileOut\n          << \"#MVE view meta data is stored in INI-file syntax.\" << fileOut.widen('\\n')\n          << \"#This file is generated, formatting will get lost.\" << fileOut.widen('\\n')\n          << fileOut.widen('\\n')\n          << \"[camera]\" << fileOut.widen('\\n')\n          << \"focal_length = \" << flen << fileOut.widen('\\n')\n          << \"pixel_aspect = \" << pixelAspect << fileOut.widen('\\n')\n          << \"principal_point = \" << ppX << \" \" << ppY << fileOut.widen('\\n')\n          << \"rotation = \" << rotation(0, 0) << \" \" << rotation(0, 1) << \" \" << rotation(0, 2) << \" \"\n          << rotation(1, 0) << \" \" << rotation(1, 1) << \" \" << rotation(1, 2) << \" \"\n          << rotation(2, 0) << \" \" << rotation(2, 1) << \" \" << rotation(2, 2) << fileOut.widen('\\n')\n          << \"translation = \" << translation[0] << \" \" << translation[1] << \" \"\n          << translation[2] << \" \" << fileOut.widen('\\n')\n          << \"[view]\" << fileOut.widen('\\n')\n          << \"id = \" << view->id_view << fileOut.widen('\\n')\n          << \"name = \" << srcImage.c_str() << fileOut.widen('\\n');\n\n        \/\/ To do:  trim any extra separator(s) from openMVG name we receive, e.g.:\n        \/\/ '\/home\/insight\/openMVG_KevinCain\/openMVG_Build\/software\/SfM\/ImageDataset_SceauxCastle\/images\/\/100_7100.JPG'\n        std::ofstream file(\n          stlplus::create_filespec(stlplus::folder_append_separator(sOutViewIteratorDirectory),\n          \"meta\",\"ini\").c_str());\n        file << fileOut.str();\n        file.close();\n\n        out\n          << flen << \" \" << \"0\" << \" \" << \"0\" << \"\\n\"  \/\/ Write '0' distortion values for pre-corrected images\n          << rotation(0, 0) << \" \" << rotation(0, 1) << \" \" << rotation(0, 2) << \"\\n\"\n          << rotation(1, 0) << \" \" << rotation(1, 1) << \" \" << rotation(1, 2) << \"\\n\"\n          << rotation(2, 0) << \" \" << rotation(2, 1) << \" \" << rotation(2, 2) << \"\\n\"\n          << translation[0] << \" \" << translation[1] << \" \" << translation[2] << \"\\n\";\n      }\n      else\n      {\n        \/\/ export a camera without pose & intrinsic info (export {0})\n        \/\/ see: https:\/\/github.com\/simonfuhrmann\/mve\/blob\/952a80b0be48e820b8c72de1d3df06efc3953bd3\/libs\/mve\/bundle_io.cc#L448\n        for (int i = 0; i < 5 * 3; ++i)\n          out << \"0\" << (i % 3 == 2 ? \"\\n\" : \" \");\n        continue;\n      }\n\n      \/\/ Save a thumbnail image \"thumbnail.png\", 50x50 pixels\n      thumbnail = create_thumbnail(image, 50, 50);\n      const std::string dstThumbnailImage =\n        stlplus::create_filespec(stlplus::folder_append_separator(sOutViewIteratorDirectory), \"thumbnail\",\"png\");\n      WriteImage(dstThumbnailImage.c_str(), thumbnail);\n    }\n\n    \/\/ For each feature, write to bundle:  position XYZ[0-3], color RGB[0-2], all ref.view_id & ref.feature_id\n    \/\/ The following method is adapted from Simon Fuhrmann's MVE project:\n    \/\/ https:\/\/github.com\/simonfuhrmann\/mve\/blob\/e3db7bc60ce93fe51702ba77ef480e151f927c23\/libs\/mve\/bundle_io.cc\n\n    for (Landmarks::const_iterator iterLandmarks = landmarks.begin(); iterLandmarks != landmarks.end(); ++iterLandmarks)\n    {\n      const Vec3 exportPoint = iterLandmarks->second.X;\n      out << exportPoint.x() << \" \" << exportPoint.y() << \" \" << exportPoint.z() << \"\\n\";\n      out << 250 << \" \" << 100 << \" \" << 150 << \"\\n\";  \/\/ Write arbitrary RGB color, see above note\n\n      \/\/ Tally set of feature observations\n      const Observations & obs = iterLandmarks->second.obs;\n      const size_t featureCount = std::distance(obs.begin(), obs.end());\n      out << featureCount;\n\n      for (Observations::const_iterator itObs = obs.begin(); itObs != obs.end(); ++itObs)\n      {\n          const IndexT viewId = itObs->first;\n          const IndexT featId = itObs->second.id_feat;\n          out << \" \" << viewId << \" \" << featId << \" 0\";\n      }\n      out << \"\\n\";\n    }\n    out.close();\n  }\n  return bOk;\n}\n\nint main(int argc, char *argv[])\n{\n\n  CmdLine cmd;\n  std::string sSfM_Data_Filename;\n  std::string sOutDir = \"\";\n  cmd.add( make_option('i', sSfM_Data_Filename, \"sfmdata\") );\n  cmd.add( make_option('o', sOutDir, \"outdir\") );\n  std::cout << \"Note:  this program writes output in MVE file format.\\n\";\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|--sfmdata] filename, the SfM_Data file to convert\\n\"\n      << \"[-o|--outdir] path\\n\"\n      << std::endl;\n\n      std::cerr << s << std::endl;\n      return EXIT_FAILURE;\n  }\n\n  \/\/ Create output dir\n  if (!stlplus::folder_exists(sOutDir))\n    stlplus::folder_create(sOutDir);\n\n  \/\/ Read the input SfM scene\n  SfM_Data sfm_data;\n  if (!Load(sfm_data, sSfM_Data_Filename, ESfM_Data(ALL))) {\n    std::cerr << std::endl\n      << \"The input SfM_Data file \\\"\"<< sSfM_Data_Filename << \"\\\" cannot be read.\" << std::endl;\n    return EXIT_FAILURE;\n  }\n\n  if (exportToMVE2Format(sfm_data, stlplus::folder_append_separator(sOutDir) + \"MVE\"))\n    return( EXIT_SUCCESS );\n  else\n    return( EXIT_FAILURE );\n}\n\n\/\/\/ Naive image bilinear resampling of an image for thumbnail generation\n\/\/\/ Inspired by create_thumbnail from MVE (cropping is here ignored)\ntemplate <typename ImageT>\nImageT\ncreate_thumbnail\n(\n  const ImageT & image,\n  int thumb_width,\n  int thumb_height\n)\n{\n  const int width = image.Width();\n  const int height = image.Height();\n  const float image_aspect = static_cast<float>(width) \/ height;\n  const float thumb_aspect = static_cast<float>(thumb_width) \/ thumb_height;\n\n  int rescale_width, rescale_height;\n  if (image_aspect > thumb_aspect)\n  {\n    rescale_width = std::ceil(thumb_height * image_aspect);\n    rescale_height = thumb_height;\n  }\n  else\n  {\n    rescale_width = thumb_width;\n    rescale_height = std::ceil(thumb_width \/ image_aspect);\n  }\n\n  \/\/ Generation of the sampling grid\n  std::vector< std::pair<float,float> > sampling_grid;\n  sampling_grid.reserve(rescale_height * rescale_width);\n  for ( int i = 0 ; i < rescale_height ; ++i )\n  {\n    for ( int j = 0 ; j < rescale_width ; ++j )\n    {\n      const float dx = static_cast<float>(j) * width \/ rescale_width;\n      const float dy = static_cast<float>(i) * height \/ rescale_height;\n      sampling_grid.push_back( std::make_pair( dy , dx ) ) ;\n    }\n  }\n\n  const Sampler2d<SamplerLinear> sampler;\n  ImageT imageOut;\n  GenericRessample(image, sampling_grid, rescale_width, rescale_height, sampler, imageOut);\n  return imageOut;\n}\n<commit_msg>Fixed meta.ini view name in MVE exporter<commit_after>\/* v.0.17 October 14th, 2015\n * Kevin CAIN, www.insightdigital.org\n * Adapted from the openMVG libraries,\n * Copyright (c) 2012-2015 Pierre MOULON.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#include \"openMVG\/sfm\/sfm.hpp\"\n#include \"openMVG\/image\/image.hpp\"\n\nusing namespace openMVG;\nusing namespace openMVG::cameras;\nusing namespace openMVG::geometry;\nusing namespace openMVG::image;\nusing namespace openMVG::sfm;\nusing namespace openMVG::features;\n\n#include \"third_party\/cmdLine\/cmdLine.h\"\n#include \"third_party\/progress\/progress.hpp\"\n#include \"third_party\/stlplus3\/filesystemSimplified\/file_system.hpp\"\n#include <stdlib.h>\n#include <stdio.h>\n#include <cmath>\n#include <iterator>\n#include <iomanip>\n\n\/\/\/ Naive image bilinear resampling of an image for thumbnail generation\ntemplate <typename ImageT>\nImageT\ncreate_thumbnail\n(\n  const ImageT & image,\n  int thumb_width,\n  int thumb_height\n);\n\n\/* Notes:\n * - An MVE2 scene appears to duplicate camera rot matrix and trans vector per-view data in 'meta.ini'\n *   within the first section of 'synth_0.out'.\n * - We do not save the original, instead we rely on the undistorted image from openMVG.\n * - We do not output thumbnails or EXIF blobs, as these appear only to be used only for the GUI UMVE.\n * - To avoid encoding loss, openMVG images should be written as .PNG if undistorted images are *not* computed.\n * - In OpenMVG, some views may have some missing poses; MVE does *not* require a contiguous camera index.\n *\n *  For information on the target for this conversion, please see the MVE (v2) File format:\n *  https:\/\/github.com\/simonfuhrmann\/mve\/wiki\/MVE-File-Format\n *\/\n\nbool exportToMVE2Format(\n  const SfM_Data & sfm_data,\n  const std::string & sOutDirectory \/\/ Output MVE2 files directory\n  )\n{\n  bool bOk = true;\n  \/\/ Create basis directory structure\n  if (!stlplus::is_folder(sOutDirectory))\n  {\n    cout << \"\\033[1;31mCreating directory:  \" << sOutDirectory << \"\\033[0m\\n\";\n    stlplus::folder_create(sOutDirectory);\n    bOk = stlplus::is_folder(sOutDirectory);\n  }\n\n  if (!bOk)\n  {\n    std::cerr << \"Cannot access one of the desired output directories\" << std::endl;\n\t  return false;\n  }\n\n  \/\/ Export the SfM_Data scene to the MVE2 format\n  {\n    \/\/ Create 'views' subdirectory\n    const string sOutViewsDirectory = stlplus::folder_append_separator(sOutDirectory) + \"views\";\n    if (!stlplus::folder_exists(sOutViewsDirectory))\n    {\n      cout << \"\\033[1;31mCreating directory:  \" << sOutViewsDirectory << \"\\033[0m\\n\";\n      stlplus::folder_create(sOutViewsDirectory);\n    }\n\n    \/\/ Prepare to write bundle file\n    \/\/ Get cameras and features from OpenMVG\n    const size_t cameraCount = std::distance(sfm_data.GetViews().begin(), sfm_data.GetViews().end());\n    \/\/ Tally global set of feature landmarks\n    const Landmarks & landmarks = sfm_data.GetLandmarks();\n    const size_t featureCount = std::distance(landmarks.begin(), landmarks.end());\n    const std::string filename = \"synth_0.out\";\n    std::cout << \"Writing bundle (\" << cameraCount << \" cameras, \"\n        << featureCount << \" features): to \" << filename << \"...\\n\";\n    std::ofstream out(stlplus::folder_append_separator(sOutDirectory) + filename);\n    out << \"drews 1.0\\n\";  \/\/ MVE expects this header\n    out << cameraCount << \" \" << featureCount << \"\\n\";\n\n    \/\/ Export (calibrated) views as undistorted images\n    C_Progress_display my_progress_bar(sfm_data.GetViews().size());\n    std::pair<int,int> w_h_image_size;\n    Image<RGBColor> image, image_ud, thumbnail;\n    std::string sOutViewIteratorDirectory;\n    for(Views::const_iterator iter = sfm_data.GetViews().begin();\n      iter != sfm_data.GetViews().end(); ++iter, ++my_progress_bar)\n    {\n      const View * view = iter->second.get();\n\n      \/\/ Create current view subdirectory 'view_xxxx.mve'\n      std::ostringstream padding;\n      padding << std::setw(4) << std::setfill('0') << view->id_view;\n      sOutViewIteratorDirectory = stlplus::folder_append_separator(sOutViewsDirectory) + \"view_\" + padding.str() + \".mve\";\n\n      \/\/ We have a valid view with a corresponding camera & pose\n      const std::string srcImage = stlplus::create_filespec(sfm_data.s_root_path, view->s_Img_path);\n      const std::string dstImage =\n        stlplus::create_filespec(stlplus::folder_append_separator(sOutViewIteratorDirectory), \"undistorted\",\"png\");\n\n      if (sfm_data.IsPoseAndIntrinsicDefined(view))\n      {\n        if (!stlplus::folder_exists(sOutViewIteratorDirectory))\n        {\n          stlplus::folder_create(sOutViewIteratorDirectory);\n        }\n\n        Intrinsics::const_iterator iterIntrinsic = sfm_data.GetIntrinsics().find(view->id_intrinsic);\n        const IntrinsicBase * cam = iterIntrinsic->second.get();\n        if (cam->have_disto())\n        {\n          \/\/ Undistort and save the image\n          ReadImage(srcImage.c_str(), &image);\n          UndistortImage(image, cam, image_ud, BLACK);\n          WriteImage(dstImage.c_str(), image_ud);\n        }\n        else \/\/ (no distortion)\n        {\n          \/\/ If extensions match, copy the PNG image\n          if (stlplus::extension_part(srcImage) == \"PNG\" ||\n            stlplus::extension_part(srcImage) == \"png\")\n          {\n            stlplus::file_copy(srcImage, dstImage);\n          }\n          else\n          {\n            ReadImage( srcImage.c_str(), &image);\n            WriteImage( dstImage.c_str(), image);\n          }\n        }\n\n        \/\/ Prepare to write an MVE 'meta.ini' file for the current view\n        const Pose3 pose = sfm_data.GetPoseOrDie(view);\n        const Pinhole_Intrinsic * pinhole_cam = static_cast<const Pinhole_Intrinsic *>(cam);\n\n        const Mat3 rotation = pose.rotation();\n        const Vec3 translation = pose.translation();\n        \/\/ Pixel aspect: assuming square pixels\n        const float pixelAspect = 1.f;\n        \/\/ Focal length and principal point must be normalized (0..1)\n        const float flen = pinhole_cam->focal() \/ static_cast<double>(std::max(cam->w(), cam->h()));\n        const float ppX = std::abs(pinhole_cam->principal_point()(0)\/cam->w());\n        const float ppY = std::abs(pinhole_cam->principal_point()(1)\/cam->h());\n\n        \/\/ For each camera, write to bundle:  focal length, radial distortion[0-1], rotation matrix[0-8], translation vector[0-2]\n        std::ostringstream fileOut;\n        fileOut\n          << \"# MVE view meta data is stored in INI-file syntax.\" << fileOut.widen('\\n')\n          << \"# This file is generated, formatting will get lost.\" << fileOut.widen('\\n')\n          << fileOut.widen('\\n')\n          << \"[camera]\" << fileOut.widen('\\n')\n          << \"focal_length = \" << flen << fileOut.widen('\\n')\n          << \"pixel_aspect = \" << pixelAspect << fileOut.widen('\\n')\n          << \"principal_point = \" << ppX << \" \" << ppY << fileOut.widen('\\n')\n          << \"rotation = \" << rotation(0, 0) << \" \" << rotation(0, 1) << \" \" << rotation(0, 2) << \" \"\n          << rotation(1, 0) << \" \" << rotation(1, 1) << \" \" << rotation(1, 2) << \" \"\n          << rotation(2, 0) << \" \" << rotation(2, 1) << \" \" << rotation(2, 2) << fileOut.widen('\\n')\n          << \"translation = \" << translation[0] << \" \" << translation[1] << \" \"\n          << translation[2] << \" \" << fileOut.widen('\\n')\n          << fileOut.widen('\\n')\n          << \"[view]\" << fileOut.widen('\\n')\n          << \"id = \" << view->id_view << fileOut.widen('\\n')\n          << \"name = \" << stlplus::filename_part(srcImage.c_str()) << fileOut.widen('\\n');\n\n        \/\/ To do:  trim any extra separator(s) from openMVG name we receive, e.g.:\n        \/\/ '\/home\/insight\/openMVG_KevinCain\/openMVG_Build\/software\/SfM\/ImageDataset_SceauxCastle\/images\/\/100_7100.JPG'\n        std::ofstream file(\n          stlplus::create_filespec(stlplus::folder_append_separator(sOutViewIteratorDirectory),\n          \"meta\",\"ini\").c_str());\n        file << fileOut.str();\n        file.close();\n\n        out\n          << flen << \" \" << \"0\" << \" \" << \"0\" << \"\\n\"  \/\/ Write '0' distortion values for pre-corrected images\n          << rotation(0, 0) << \" \" << rotation(0, 1) << \" \" << rotation(0, 2) << \"\\n\"\n          << rotation(1, 0) << \" \" << rotation(1, 1) << \" \" << rotation(1, 2) << \"\\n\"\n          << rotation(2, 0) << \" \" << rotation(2, 1) << \" \" << rotation(2, 2) << \"\\n\"\n          << translation[0] << \" \" << translation[1] << \" \" << translation[2] << \"\\n\";\n      }\n      else\n      {\n        \/\/ export a camera without pose & intrinsic info (export {0})\n        \/\/ see: https:\/\/github.com\/simonfuhrmann\/mve\/blob\/952a80b0be48e820b8c72de1d3df06efc3953bd3\/libs\/mve\/bundle_io.cc#L448\n        for (int i = 0; i < 5 * 3; ++i)\n          out << \"0\" << (i % 3 == 2 ? \"\\n\" : \" \");\n        continue;\n      }\n\n      \/\/ Save a thumbnail image \"thumbnail.png\", 50x50 pixels\n      thumbnail = create_thumbnail(image, 50, 50);\n      const std::string dstThumbnailImage =\n        stlplus::create_filespec(stlplus::folder_append_separator(sOutViewIteratorDirectory), \"thumbnail\",\"png\");\n      WriteImage(dstThumbnailImage.c_str(), thumbnail);\n    }\n\n    \/\/ For each feature, write to bundle:  position XYZ[0-3], color RGB[0-2], all ref.view_id & ref.feature_id\n    \/\/ The following method is adapted from Simon Fuhrmann's MVE project:\n    \/\/ https:\/\/github.com\/simonfuhrmann\/mve\/blob\/e3db7bc60ce93fe51702ba77ef480e151f927c23\/libs\/mve\/bundle_io.cc\n\n    for (Landmarks::const_iterator iterLandmarks = landmarks.begin(); iterLandmarks != landmarks.end(); ++iterLandmarks)\n    {\n      const Vec3 exportPoint = iterLandmarks->second.X;\n      out << exportPoint.x() << \" \" << exportPoint.y() << \" \" << exportPoint.z() << \"\\n\";\n      out << 250 << \" \" << 100 << \" \" << 150 << \"\\n\";  \/\/ Write arbitrary RGB color, see above note\n\n      \/\/ Tally set of feature observations\n      const Observations & obs = iterLandmarks->second.obs;\n      const size_t featureCount = std::distance(obs.begin(), obs.end());\n      out << featureCount;\n\n      for (Observations::const_iterator itObs = obs.begin(); itObs != obs.end(); ++itObs)\n      {\n          const IndexT viewId = itObs->first;\n          const IndexT featId = itObs->second.id_feat;\n          out << \" \" << viewId << \" \" << featId << \" 0\";\n      }\n      out << \"\\n\";\n    }\n    out.close();\n  }\n  return bOk;\n}\n\nint main(int argc, char *argv[])\n{\n\n  CmdLine cmd;\n  std::string sSfM_Data_Filename;\n  std::string sOutDir = \"\";\n  cmd.add( make_option('i', sSfM_Data_Filename, \"sfmdata\") );\n  cmd.add( make_option('o', sOutDir, \"outdir\") );\n  std::cout << \"Note:  this program writes output in MVE file format.\\n\";\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|--sfmdata] filename, the SfM_Data file to convert\\n\"\n      << \"[-o|--outdir] path\\n\"\n      << std::endl;\n\n      std::cerr << s << std::endl;\n      return EXIT_FAILURE;\n  }\n\n  \/\/ Create output dir\n  if (!stlplus::folder_exists(sOutDir))\n    stlplus::folder_create(sOutDir);\n\n  \/\/ Read the input SfM scene\n  SfM_Data sfm_data;\n  if (!Load(sfm_data, sSfM_Data_Filename, ESfM_Data(ALL))) {\n    std::cerr << std::endl\n      << \"The input SfM_Data file \\\"\"<< sSfM_Data_Filename << \"\\\" cannot be read.\" << std::endl;\n    return EXIT_FAILURE;\n  }\n\n  if (exportToMVE2Format(sfm_data, stlplus::folder_append_separator(sOutDir) + \"MVE\"))\n    return( EXIT_SUCCESS );\n  else\n    return( EXIT_FAILURE );\n}\n\n\/\/\/ Naive image bilinear resampling of an image for thumbnail generation\n\/\/\/ Inspired by create_thumbnail from MVE (cropping is here ignored)\ntemplate <typename ImageT>\nImageT\ncreate_thumbnail\n(\n  const ImageT & image,\n  int thumb_width,\n  int thumb_height\n)\n{\n  const int width = image.Width();\n  const int height = image.Height();\n  const float image_aspect = static_cast<float>(width) \/ height;\n  const float thumb_aspect = static_cast<float>(thumb_width) \/ thumb_height;\n\n  int rescale_width, rescale_height;\n  if (image_aspect > thumb_aspect)\n  {\n    rescale_width = std::ceil(thumb_height * image_aspect);\n    rescale_height = thumb_height;\n  }\n  else\n  {\n    rescale_width = thumb_width;\n    rescale_height = std::ceil(thumb_width \/ image_aspect);\n  }\n\n  \/\/ Generation of the sampling grid\n  std::vector< std::pair<float,float> > sampling_grid;\n  sampling_grid.reserve(rescale_height * rescale_width);\n  for ( int i = 0 ; i < rescale_height ; ++i )\n  {\n    for ( int j = 0 ; j < rescale_width ; ++j )\n    {\n      const float dx = static_cast<float>(j) * width \/ rescale_width;\n      const float dy = static_cast<float>(i) * height \/ rescale_height;\n      sampling_grid.push_back( std::make_pair( dy , dx ) ) ;\n    }\n  }\n\n  const Sampler2d<SamplerLinear> sampler;\n  ImageT imageOut;\n  GenericRessample(image, sampling_grid, rescale_width, rescale_height, sampler, imageOut);\n  return imageOut;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2009, 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#include <libport\/bind.hh>\n#include <libport\/unit-test.hh>\n#include <libport\/path.hh>\n\n\nusing boost::bind;\nusing libport::path;\nusing libport::test_suite;\n\n\n#if defined WIN32\n# define APPLE_LINUX_WINDOWS(Apple, Linux, Windows) Windows\n#elif defined __APPLE__\n# define APPLE_LINUX_WINDOWS(Apple, Linux, Windows) Apple\n#else\n# define APPLE_LINUX_WINDOWS(Apple, Linux, Windows) Linux\n#endif\n\nstatic const std::string separator =\n  APPLE_LINUX_WINDOWS(\"\/\", \"\/\", \"\\\\\");\n\n\/\/ Join path components.\nstatic\nstd::string\noperator\/(const std::string& lhs, const std::string& rhs)\n{\n  return (lhs.empty() ? rhs\n          : rhs.empty() ? lhs\n          : lhs + separator + rhs);\n}\n\nvoid path_ctor(const std::string& path,\n               const std::string& WIN32_IF(volume, \/* nothing *\/),\n               bool valid)\n{\n  if (valid)\n  {\n    BOOST_CHECK_NO_THROW(libport::path p(path));\n#ifdef WIN32\n    libport::path p(path);\n    BOOST_CHECK_EQUAL(p.volume_get(), volume);\n#endif\n  }\n  else\n    BOOST_CHECK_THROW(libport::path p(path), path::invalid_path);\n}\n\nvoid path_absolute(const std::string& path,\n                   bool expected = true)\n{\n  libport::path p(path);\n  BOOST_CHECK_EQUAL(p.absolute_get(), expected);\n}\n\nvoid path_name(const std::string& spath,\n               const std::string& dir,\n               const std::string& base)\n{\n  path path(spath);\n  BOOST_CHECK_EQUAL(path.dirname(), dir);\n  BOOST_CHECK_EQUAL(path.basename(), base);\n}\n\nvoid concat(const std::string& lhs,\n            const std::string& rhs,\n            const std::string& res)\n{\n  BOOST_CHECK(path(lhs) \/ path(rhs) == res);\n}\n\nvoid invalid_concat(const std::string& lhs,\n                    const std::string& rhs)\n{\n  BOOST_CHECK_THROW(path(lhs) \/ path(rhs), path::invalid_path);\n}\n\nvoid exist(const path& p, bool expected = true)\n{\n  BOOST_CHECK_EQUAL(p.exists(), expected);\n}\n\nvoid create(const path& p)\n{\n  \/\/ If the file exists, remove it.\n  if (p.exists())\n    BOOST_CHECK_NO_THROW(p.remove());\n  exist(p, false);\n  p.create();\n  exist(p, true);\n  BOOST_CHECK_NO_THROW(p.remove());\n  exist(p, false);\n}\n\nvoid temporary_files(void)\n{\n  path temp = path::temporary_file();\n  exist(temp, true);\n  BOOST_CHECK_NO_THROW(temp.remove());\n  exist(temp, false);\n}\n\nvoid equal(const path& lhs, const path& rhs)\n{\n  BOOST_CHECK_EQUAL(lhs, rhs);\n}\n\nvoid not_equal(const path& lhs, const path& rhs)\n{\n  BOOST_CHECK_NE(lhs, rhs);\n}\n\nvoid to_string(const path& in, const std::string& out)\n{\n  BOOST_CHECK_EQUAL(in.to_string(), out);\n}\n\n\ntest_suite*\ninit_test_suite()\n{\n  test_suite* suite = BOOST_TEST_SUITE(\"libport::path test suite\");\n\n  \/\/ Test constructors\n  test_suite* ctor_suite = BOOST_TEST_SUITE(\"Construction test suite\");\n  suite->add(ctor_suite);\n# define def(Path, Vol, Valid)                                            \\\n  ctor_suite->add(BOOST_TEST_CASE(bind(path_ctor, Path, Vol, Valid)));\n  def(\"urbi.u\", \"\", true);\n  def(std::string(\"foo\")\/std::string(\"bar.cc\"), \"\", true);\n  def(\"\", \"\", false);\n#ifndef WIN32\n  def(\"\/usr\/local\", \"\", true);\n#else\n  def(\"C:\\\\Documents and Settings\", \"C:\", true);\n  def(\"c:\", \"c:\", true);\n  def(\"\\\\\\\\shared_volume\\\\subdir\", \"\\\\\\\\shared_volume\", true);\n#endif\n#undef def\n\n  \/\/ Test absoluteness\n  test_suite* abs_suite =\n    BOOST_TEST_SUITE(\"Absolute path detection test suite\");\n  suite->add(abs_suite);\n#define def(Path, Abs)                                                  \\\n  abs_suite->add(BOOST_TEST_CASE(bind(path_absolute, Path, Abs)));\n  def(\"relative\", false);\n  def(std::string(\"relative\")\/\"with\"\/\"directories\", false);\n  def(std::string(\"relative\")\/\"with\"\/\"trailing\"\/\"slash\"\/\"\", false);\n#ifndef WIN32\n  def(\"\/\", true);\n  def(\"\/absolute\", true);\n  def(\"\/absolute\/but\/longer\", true);\n  def(\"\/absolute\/with\/trailing\/slash\/\", true);\n  def(\"\/.\/still\/..\/absolute\", true);\n#else\n  def(\"c:\", false);\n  def(\"C:\", false);\n  def(\"C:\\\\\", true);\n  def(\"C:\\\\absolute\", true);\n  def(\"C:\\\\absolute\\\\but\\\\on\\\\stupid\\\\OS\", true);\n  def(\"\\\\\\\\shared_volume\\\\subdir\", true);\n#endif\n#undef def\n\n  \/\/ Test printing.\n  test_suite* to_string_suite = BOOST_TEST_SUITE(\"to_string\");\n  suite->add(to_string_suite);\n# define def(In)                                      \\\n  to_string_suite->add(BOOST_TEST_CASE(bind(to_string, In, In)));\n#ifdef WIN32\n  def(\"C:\\\\Documents and Settings\");\n  def(\"c:\");\n  def(\"\\\\\\\\shared_volume\\\\subdir\");\n  \/\/ def(\"\\\\\");\n#else\n  def(\".\");\n  def(\"\/\");\n  def(\"urbi.u\");\n  def(\"foo\/bar.cc\");\n  def(\"\/usr\/local\");\n#endif\n#undef def\n\n  \/\/ Test equality operator\n  test_suite* eq_suite = BOOST_TEST_SUITE(\"Comparison test suite\");\n  suite->add(eq_suite);\n#define def(lhs, rhs)                                           \\\n  eq_suite->add(BOOST_TEST_CASE(bind(equal, lhs, rhs)));\n  def(\"foo\", \"foo\");\n  def(std::string(\"foo\")\/\"bar\"\/\"baz\"\/\"quux\",\n      std::string(\"foo\")\/\"bar\"\/\"baz\"\/\"quux\");\n#ifndef WIN32\n  def(\"\/foo\/bar\/baz\/quux\", \"\/foo\/bar\/baz\/quux\");\n#endif\n  def(std::string(\"just\")\/\"stay\",\n      std::string(\".\")\/\"just\"\/\".\"\/\".\"\/\"stay\"\/\".\"\/\"\");\n  def(std::string(\".\")\/\"\"\/\"\"\/\"\"\/\"\"\/\".\"\/\"\"\/\"\"\/\"foo\"\/\"\", \"foo\");\n  def(\"foo\", std::string(\"foo\")\/\"\");\n\/\/  def(\"in\/is\/fun\",\n\/\/      \"in\/and\/out\/..\/..\/is\/fun\/too\/..\");\n  def(std::string(\"in\")\/\"and\"\/\"out\"\/\"..\"\/\"..\"\/\"is\"\/\"fun\"\/\"too\"\/\"..\",\n      std::string(\"in\")\/\"and\"\/\"out\"\/\"..\"\/\"..\"\/\"is\"\/\"fun\"\/\"too\"\/\"..\");\n#undef def\n#ifdef WIN32\n#define def(lhs, rhs)                                           \\\n  eq_suite->add(BOOST_TEST_CASE(bind(not_equal, lhs, rhs)));\n  def(\"foo\", \"\\\\\\\\foo\");\n#undef def\n#endif \/\/ WIN32\n\n  \/\/ Test basename\/dirname\n  test_suite* name_suite = BOOST_TEST_SUITE(\"Basename\/dirname test suite\");\n  suite->add(name_suite);\n#define def(path, dir, base)                                    \\\n  name_suite->add(BOOST_TEST_CASE(bind(path_name, path, dir, base)));\n  def(std::string(\"dirname\")\/\"basename\", \"dirname\", \"basename\");\n  def(\"foo\", \".\", \"foo\");\n  def(std::string(\"..\")\/\"..\"\/\"bar\", std::string(\"..\")\/\"..\", \"bar\");\n  \/\/ Standard (and somehow logical) GNU coreutils behavior:\n#ifndef WIN32\n  def(\"\/usr\/local\/gostai\", \"\/usr\/local\", \"gostai\");\n  def(\"\/\", \"\/\", \"\/\");\n#else\n  def(\"\\\\\\\\share\\\\foo\\\\bar\\\\\", \"\\\\\\\\share\\\\foo\", \"bar\");\n#endif\n  def(\".\", \".\", \".\");\n#undef def\n\n  \/\/ Test concatenation\n  test_suite* concat_suite = BOOST_TEST_SUITE(\"Concatenation test suite\");\n  suite->add(concat_suite);\n#define def(lhs, rhs, res)                                      \\\n  concat_suite->add(BOOST_TEST_CASE(bind(concat, lhs, rhs, res)));\n  def(\"foo\", \"bar\", std::string(\"foo\")\/\"bar\");\n  def(std::string(\"foo\")\/\"bar\",\n      std::string(\"baz\")\/\"quux\",\n      std::string(\"foo\")\/\"bar\"\/\"baz\"\/\"quux\");\n  def(std::string(\"foo\")\/\"bar\", \".\",\n      std::string(\"foo\")\/\"bar\");\n\/\/  def(\"foo\/bar\", \"..\/..\", \".\");\n  def(std::string(\"foo\")\/\"bar\", std::string(\"..\")\/\"..\",\n      std::string(\"foo\")\/\"bar\"\/\"..\"\/\"..\");\n#ifndef WIN32\n  def(\"\/foo\", \"bar\", \"\/foo\/bar\");\n  def(\"\/\", \"foo\", \"\/foo\");\n  def(\"\/\", \".\", \"\/\");\n#else\n  def(\"\\\\\\\\share\\\\foo\", \"bar\", \"\\\\\\\\share\\\\foo\\\\bar\");\n  def(\"c:\\\\\", \"foo\", \"c:\\\\foo\");\n  def(\"c:\", \"bar\", \"c:bar\");\n#endif\n#undef def\n#define def(lhs, rhs)                                           \\\n  concat_suite->add(BOOST_TEST_CASE(bind(invalid_concat, lhs, rhs)));\n  def(std::string(\"\")\/\"\", std::string(\"\")\/\"\");\n#ifndef WIN32\n  def(\"foo\", \"\/bar\");\n#else\n  def(\"foo\", \"C:\\\\\\\\bar\");\n  def(\"\\\\\\\\share\\\\foo\", \"\\\\\\\\share\\\\bar\");\n  def(\"c:\", \"d:\");\n#endif\n#undef def\n\n  test_suite* exist_suite = BOOST_TEST_SUITE(\"File existence test suite\");\n  suite->add(exist_suite);\n#define def(path, res)                                          \\\n  exist_suite->add(BOOST_TEST_CASE(bind(exist, path, res)));\n#ifndef WIN32\n  def(\"\/\", true);\n  def(\"\/this\/directory\/does\/not\/exist\", false);\n#else\n  def(\"C:\\\\\", true);\n  def(\"C:\\\\this\\\\directory\\\\does\\\\not\\\\exist\", false);\n#endif\n#undef def\n\n  test_suite* create_suite = BOOST_TEST_SUITE(\"File creation test suite\");\n  suite->add(create_suite);\n#define def(path)                                          \\\n  create_suite->add(BOOST_TEST_CASE(bind(create, path)));\n  def(std::string(\"tests\")\/\"libport\"\/\"creation_test\");\n#undef def\n#define def(path)                                          \\\n  create_suite->add(BOOST_TEST_CASE(temporary_files))\n  def();\n#undef def\n\n  return suite;\n}\n<commit_msg>Style changes.<commit_after>\/*\n * Copyright (C) 2009, 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#include <libport\/bind.hh>\n#include <libport\/unit-test.hh>\n#include <libport\/path.hh>\n\n\nusing boost::bind;\nusing libport::path;\nusing libport::test_suite;\n\n\nstatic const std::string separator = WIN32_IF(\"\\\\\", \"\/\");\n\n\/\/ Join path components.\nstatic\nstd::string\noperator\/(const std::string& lhs, const std::string& rhs)\n{\n  return (lhs.empty() ? rhs\n          : rhs.empty() ? lhs\n          : lhs + separator + rhs);\n}\n\nvoid path_ctor(const std::string& path,\n               const std::string& WIN32_IF(volume, \/* nothing *\/),\n               bool valid)\n{\n  if (valid)\n  {\n    BOOST_CHECK_NO_THROW(libport::path p(path));\n#ifdef WIN32\n    libport::path p(path);\n    BOOST_CHECK_EQUAL(p.volume_get(), volume);\n#endif\n  }\n  else\n    BOOST_CHECK_THROW(libport::path p(path), path::invalid_path);\n}\n\nvoid path_absolute(const std::string& path,\n                   bool expected = true)\n{\n  libport::path p(path);\n  BOOST_CHECK_EQUAL(p.absolute_get(), expected);\n}\n\nvoid path_name(const std::string& spath,\n               const std::string& dir,\n               const std::string& base)\n{\n  path path(spath);\n  BOOST_CHECK_EQUAL(path.dirname(), dir);\n  BOOST_CHECK_EQUAL(path.basename(), base);\n}\n\nvoid concat(const std::string& lhs,\n            const std::string& rhs,\n            const std::string& res)\n{\n  BOOST_CHECK(path(lhs) \/ path(rhs) == res);\n}\n\nvoid invalid_concat(const std::string& lhs,\n                    const std::string& rhs)\n{\n  BOOST_CHECK_THROW(path(lhs) \/ path(rhs), path::invalid_path);\n}\n\nvoid exist(const path& p, bool expected = true)\n{\n  BOOST_CHECK_EQUAL(p.exists(), expected);\n}\n\nvoid create(const path& p)\n{\n  \/\/ If the file exists, remove it.\n  if (p.exists())\n    BOOST_CHECK_NO_THROW(p.remove());\n  exist(p, false);\n  p.create();\n  exist(p, true);\n  BOOST_CHECK_NO_THROW(p.remove());\n  exist(p, false);\n}\n\nvoid temporary_files(void)\n{\n  path temp = path::temporary_file();\n  exist(temp, true);\n  BOOST_CHECK_NO_THROW(temp.remove());\n  exist(temp, false);\n}\n\nvoid equal(const path& lhs, const path& rhs)\n{\n  BOOST_CHECK_EQUAL(lhs, rhs);\n}\n\nvoid not_equal(const path& lhs, const path& rhs)\n{\n  BOOST_CHECK_NE(lhs, rhs);\n}\n\nvoid to_string(const path& in, const std::string& out)\n{\n  BOOST_CHECK_EQUAL(in.to_string(), out);\n}\n\n\ntest_suite*\ninit_test_suite()\n{\n  test_suite* suite = BOOST_TEST_SUITE(\"libport::path test suite\");\n\n  \/\/ Test constructors\n  test_suite* ctor_suite = BOOST_TEST_SUITE(\"Construction test suite\");\n  suite->add(ctor_suite);\n# define def(Path, Vol, Valid)                                            \\\n  ctor_suite->add(BOOST_TEST_CASE(bind(path_ctor, Path, Vol, Valid)));\n  def(\"urbi.u\", \"\", true);\n  def(std::string(\"foo\")\/\"bar.cc\", \"\", true);\n  def(\"\", \"\", false);\n#ifndef WIN32\n  def(\"\/usr\/local\", \"\", true);\n#else\n  def(\"C:\\\\Documents and Settings\", \"C:\", true);\n  def(\"c:\", \"c:\", true);\n  def(\"\\\\\\\\shared_volume\\\\subdir\", \"\\\\\\\\shared_volume\", true);\n#endif\n#undef def\n\n  \/\/ Test absoluteness\n  test_suite* abs_suite =\n    BOOST_TEST_SUITE(\"Absolute path detection test suite\");\n  suite->add(abs_suite);\n#define def(Path, Abs)                                                  \\\n  abs_suite->add(BOOST_TEST_CASE(bind(path_absolute, Path, Abs)));\n  def(\"relative\", false);\n  def(std::string(\"relative\")\/\"with\"\/\"directories\", false);\n  def(std::string(\"relative\")\/\"with\"\/\"trailing\"\/\"slash\"\/\"\", false);\n#ifndef WIN32\n  def(\"\/\", true);\n  def(\"\/absolute\", true);\n  def(\"\/absolute\/but\/longer\", true);\n  def(\"\/absolute\/with\/trailing\/slash\/\", true);\n  def(\"\/.\/still\/..\/absolute\", true);\n#else\n  def(\"c:\", false);\n  def(\"C:\", false);\n  def(\"C:\\\\\", true);\n  def(\"C:\\\\absolute\", true);\n  def(\"C:\\\\absolute\\\\but\\\\on\\\\stupid\\\\OS\", true);\n  def(\"\\\\\\\\shared_volume\\\\subdir\", true);\n#endif\n#undef def\n\n  \/\/ Test printing.\n  test_suite* to_string_suite = BOOST_TEST_SUITE(\"to_string\");\n  suite->add(to_string_suite);\n# define def(In)                                      \\\n  to_string_suite->add(BOOST_TEST_CASE(bind(to_string, In, In)));\n#ifdef WIN32\n  def(\"C:\\\\Documents and Settings\");\n  def(\"c:\");\n  def(\"\\\\\\\\shared_volume\\\\subdir\");\n  \/\/ def(\"\\\\\");\n#else\n  def(\".\");\n  def(\"\/\");\n  def(\"urbi.u\");\n  def(\"foo\/bar.cc\");\n  def(\"\/usr\/local\");\n#endif\n#undef def\n\n  \/\/ Test equality operator\n  test_suite* eq_suite = BOOST_TEST_SUITE(\"Comparison test suite\");\n  suite->add(eq_suite);\n#define def(lhs, rhs)                                           \\\n  eq_suite->add(BOOST_TEST_CASE(bind(equal, lhs, rhs)));\n  def(\"foo\", \"foo\");\n  def(std::string(\"foo\")\/\"bar\"\/\"baz\"\/\"quux\",\n      std::string(\"foo\")\/\"bar\"\/\"baz\"\/\"quux\");\n#ifndef WIN32\n  def(\"\/foo\/bar\/baz\/quux\", \"\/foo\/bar\/baz\/quux\");\n#endif\n  def(std::string(\"just\")\/\"stay\",\n      std::string(\".\")\/\"just\"\/\".\"\/\".\"\/\"stay\"\/\".\"\/\"\");\n  def(std::string(\".\")\/\"\"\/\"\"\/\"\"\/\"\"\/\".\"\/\"\"\/\"\"\/\"foo\"\/\"\", \"foo\");\n  def(\"foo\", std::string(\"foo\")\/\"\");\n\/\/  def(\"in\/is\/fun\",\n\/\/      \"in\/and\/out\/..\/..\/is\/fun\/too\/..\");\n  def(std::string(\"in\")\/\"and\"\/\"out\"\/\"..\"\/\"..\"\/\"is\"\/\"fun\"\/\"too\"\/\"..\",\n      std::string(\"in\")\/\"and\"\/\"out\"\/\"..\"\/\"..\"\/\"is\"\/\"fun\"\/\"too\"\/\"..\");\n#undef def\n#ifdef WIN32\n#define def(lhs, rhs)                                           \\\n  eq_suite->add(BOOST_TEST_CASE(bind(not_equal, lhs, rhs)));\n  def(\"foo\", \"\\\\\\\\foo\");\n#undef def\n#endif \/\/ WIN32\n\n  \/\/ Test basename\/dirname\n  test_suite* name_suite = BOOST_TEST_SUITE(\"Basename\/dirname test suite\");\n  suite->add(name_suite);\n#define def(path, dir, base)                                    \\\n  name_suite->add(BOOST_TEST_CASE(bind(path_name, path, dir, base)));\n  def(std::string(\"dirname\")\/\"basename\", \"dirname\", \"basename\");\n  def(\"foo\", \".\", \"foo\");\n  def(std::string(\"..\")\/\"..\"\/\"bar\", std::string(\"..\")\/\"..\", \"bar\");\n  \/\/ Standard (and somehow logical) GNU coreutils behavior:\n#ifndef WIN32\n  def(\"\/usr\/local\/gostai\", \"\/usr\/local\", \"gostai\");\n  def(\"\/\", \"\/\", \"\/\");\n#else\n  def(\"\\\\\\\\share\\\\foo\\\\bar\\\\\", \"\\\\\\\\share\\\\foo\", \"bar\");\n#endif\n  def(\".\", \".\", \".\");\n#undef def\n\n  \/\/ Test concatenation\n  test_suite* concat_suite = BOOST_TEST_SUITE(\"Concatenation test suite\");\n  suite->add(concat_suite);\n#define def(lhs, rhs, res)                                      \\\n  concat_suite->add(BOOST_TEST_CASE(bind(concat, lhs, rhs, res)));\n  def(\"foo\", \"bar\", std::string(\"foo\")\/\"bar\");\n  def(std::string(\"foo\")\/\"bar\",\n      std::string(\"baz\")\/\"quux\",\n      std::string(\"foo\")\/\"bar\"\/\"baz\"\/\"quux\");\n  def(std::string(\"foo\")\/\"bar\", \".\",\n      std::string(\"foo\")\/\"bar\");\n\/\/  def(\"foo\/bar\", \"..\/..\", \".\");\n  def(std::string(\"foo\")\/\"bar\", std::string(\"..\")\/\"..\",\n      std::string(\"foo\")\/\"bar\"\/\"..\"\/\"..\");\n#ifndef WIN32\n  def(\"\/foo\", \"bar\", \"\/foo\/bar\");\n  def(\"\/\", \"foo\", \"\/foo\");\n  def(\"\/\", \".\", \"\/\");\n#else\n  def(\"\\\\\\\\share\\\\foo\", \"bar\", \"\\\\\\\\share\\\\foo\\\\bar\");\n  def(\"c:\\\\\", \"foo\", \"c:\\\\foo\");\n  def(\"c:\", \"bar\", \"c:bar\");\n#endif\n#undef def\n#define def(lhs, rhs)                                           \\\n  concat_suite->add(BOOST_TEST_CASE(bind(invalid_concat, lhs, rhs)));\n  def(std::string(\"\")\/\"\", std::string(\"\")\/\"\");\n#ifndef WIN32\n  def(\"foo\", \"\/bar\");\n#else\n  def(\"foo\", \"C:\\\\\\\\bar\");\n  def(\"\\\\\\\\share\\\\foo\", \"\\\\\\\\share\\\\bar\");\n  def(\"c:\", \"d:\");\n#endif\n#undef def\n\n  test_suite* exist_suite = BOOST_TEST_SUITE(\"File existence test suite\");\n  suite->add(exist_suite);\n#define def(path, res)                                          \\\n  exist_suite->add(BOOST_TEST_CASE(bind(exist, path, res)));\n#ifndef WIN32\n  def(\"\/\", true);\n  def(\"\/this\/directory\/does\/not\/exist\", false);\n#else\n  def(\"C:\\\\\", true);\n  def(\"C:\\\\this\\\\directory\\\\does\\\\not\\\\exist\", false);\n#endif\n#undef def\n\n  test_suite* create_suite = BOOST_TEST_SUITE(\"File creation test suite\");\n  suite->add(create_suite);\n#define def(path)                                          \\\n  create_suite->add(BOOST_TEST_CASE(bind(create, path)));\n  def(std::string(\"tests\")\/\"libport\"\/\"creation_test\");\n#undef def\n#define def(path)                                          \\\n  create_suite->add(BOOST_TEST_CASE(temporary_files))\n  def();\n#undef def\n\n  return suite;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"list\"\n#include \"gtest\/gtest.h\"\n#include \"logger.h\"\n#include \"alien.h\"\n#include \"space_ship.h\"\n#include \"obstacle.h\"\n#include \"bullet_manager.h\"\n#include \"space.h\"\n\nTEST(logger_test, output_std_container)\n{\n  Logger(TypeLog::WARN) << \"warning\";\n  Logger() << std::list<int>{2,3,4};\n  Logger(TypeLog::ERROR) <<  std::vector<Bullet>(3,Bullet());\n  Logger() << 5;\n  Logger() << Alien() << SpaceShip() << Space(15,14);\n  BulletManager bm;\n  bm.SetAmmo(2);\n  Logger() << Obstacle();\n}\n<commit_msg>format code<commit_after>#include \"list\"\n#include \"gtest\/gtest.h\"\n#include \"logger.h\"\n#include \"alien.h\"\n#include \"space_ship.h\"\n#include \"obstacle.h\"\n#include \"bullet_manager.h\"\n#include \"space.h\"\n\nTEST(logger_test, output_std_container)\n{\n  Logger(TypeLog::WARN) << \"warning\";\n  Logger() << std::list<int>{2, 3, 4};\n  Logger(TypeLog::ERROR) <<  std::vector<Bullet>(3, Bullet());\n  Logger() << 5;\n  Logger() << Alien() << SpaceShip() << Space(15, 14);\n  BulletManager bm;\n  bm.SetAmmo(2);\n  Logger() << Obstacle();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <boost\/python.hpp>\n#include \"ModelInterface.h\"\n#include \"pyToCppModelInterfaceCache.h\"\n\n#include <boost\/python\/stl_iterator.hpp>\n#include <iostream>\n#include <stdexcept>\n#include <boost\/python\/numeric.hpp>\n#include <boost\/python\/tuple.hpp>\n#include <boost\/python\/module.hpp>\n#include <boost\/python\/def.hpp>\n#include <numpy\/noprefix.h>\n\n\nnamespace threeML {\n\ntemplate<typename T>\ninline\nstd::vector<T> to_std_vector(const boost::python::object &iterable) {\n  return std::vector<T>(boost::python::stl_input_iterator<T>(iterable),\n                        boost::python::stl_input_iterator<T>());\n}\n\nvoid pyToCppModelInterfaceCache::setExtSourceBoundaries(const int id, const float lon_min, const float lon_max,\n                                                        const float lat_min, const float lat_max)\n{\n\n  BoundingBox this_boundingBox;\n\n  this_boundingBox.lon_min = lon_min;\n  this_boundingBox.lon_max = lon_max;\n  this_boundingBox.lat_min = lat_min;\n  this_boundingBox.lat_max = lat_max;\n\n  m_boundingBoxes[id] = this_boundingBox;\n\n}\n\nvoid pyToCppModelInterfaceCache::setExtSourceCube(const int id, const numeric::array &cube,\n                                                  const numeric::array &lon, const numeric::array &lat)\n{\n\n  \/\/ Add an extended source to the cache (a map)\n\n  PyArrayObject* cube__ = (PyArrayObject*) cube.ptr();\n\n  unsigned int n_points = (unsigned int) *(cube__->dimensions);\n  unsigned int n_energies = (unsigned int) *(cube__->dimensions+1);\n\n  \/\/ This is n_points * n_energies in size\n\n  double* cube_ = (double *) cube__->data;\n\n  \/\/ These are both n_points in size\n\n  double* lon_ = (double *) ((PyArrayObject*) lon.ptr())->data;\n  double* lat_ = (double *) ((PyArrayObject*) lat.ptr())->data;\n\n  ExtSrcCube this_srcCube;\n\n  for(unsigned int i=0; i < n_points; ++i)\n  {\n\n    float this_lon = (float) lon_[i];\n    float this_lat = (float) lat_[i];\n\n    SkyCoord this_coord(this_lon, this_lat);\n\n    \/\/ A little of pointer algebra\n\n    int this_data_start = i * n_energies;\n    int this_data_stop = this_data_start + n_energies;\n\n    \/\/ Note how this construct avoid the double copy which would\n    \/\/ occur if we were to first create a vector and then\n    \/\/ copy it into a standard map. Here instead the operator\n    \/\/ [] creates an empty vector, which is then filled with\n    \/\/ the assign method\n\n    this_srcCube[this_coord].assign(cube_ + this_data_start, cube_ + this_data_stop);\n\n  }\n\n  \/\/ Finally add to the map\n\n  m_extSources[id] = this_srcCube;\n\n}\n\nbool pyToCppModelInterfaceCache::isInsideAnyExtendedSource(double j2000_ra, double j2000_dec) const {\n  return true;\n}\n\nint pyToCppModelInterfaceCache::getNumberOfPointSources() const {\n\n  return m_nPtSources;\n\n}\n\nvoid pyToCppModelInterfaceCache::getPointSourcePosition(int srcid, double *j2000_ra, double *j2000_dec) const {\n\n  throw std::runtime_error(\"ModelInterfaceCache: point source not yet implemented\");\n}\n\nvoid pyToCppModelInterfaceCache::update() {\n\n  \/\/Empty the cache\n  m_extSources.clear();\n  m_boundingBoxes.clear();\n  m_nExtSources = 0;\n  m_nPtSources = 0;\n\n}\n\nstd::vector<double>\npyToCppModelInterfaceCache::getPointSourceFluxes(int srcid, std::vector<double> energies) const {\n\n  throw std::runtime_error(\"ModelInterfaceCache: point source not yet implemented\");\n\n}\n\nint pyToCppModelInterfaceCache::getNumberOfExtendedSources() const {\n\n  return m_extSources.size();\n\n}\n\nstd::vector<double>\npyToCppModelInterfaceCache::getExtendedSourceFluxes(int srcid, double j2000_ra, double j2000_dec,\n                                               std::vector<double> energies) const {\n\n  SkyCoord sky_pos(j2000_ra, j2000_dec);\n\n  return m_extSources.at(srcid).at(sky_pos);\n\n}\n\nstd::vector<double>\npyToCppModelInterfaceCache::getExtendedSourceFluxes_test(int srcid, double j2000_ra, double j2000_dec) const {\n\n  SkyCoord sky_pos(j2000_ra, j2000_dec);\n\n  return m_extSources.at(srcid).at(sky_pos);\n\n}\n\nstd::string pyToCppModelInterfaceCache::getPointSourceName(int srcid) const {\n\n  \/\/TODO: implement a mechanism to actually keep the true name\n\n  std::stringstream name;\n\n  name << \"Point source \" << srcid;\n\n  return name.str();\n}\n\nstd::string pyToCppModelInterfaceCache::getExtendedSourceName(int srcid) const {\n\n  \/\/TODO: implement a mechanism to actually keep the true name\n\n  std::stringstream name;\n\n  name << \"Extended source \" << srcid;\n\n  return name.str();\n}\n\nvoid pyToCppModelInterfaceCache::getExtendedSourceBoundaries(int srcid, double *j2000_ra_min,\n                                                        double *j2000_ra_max,\n                                                        double *j2000_dec_min,\n                                                        double *j2000_dec_max) const {\n\n  const BoundingBox *this_boundingBox = &m_boundingBoxes.at(srcid);\n\n  *j2000_ra_min = this_boundingBox->lon_min;\n  *j2000_ra_max = this_boundingBox->lon_max;\n  *j2000_dec_min = this_boundingBox->lat_min;\n  *j2000_dec_max = this_boundingBox->lat_max;\n\n}\n\n}\n\nusing namespace threeML;\nusing namespace boost::python;\n\n\/\/This is needed to wrap the interface (i.e., all methods are virtual)\n\/\/contained in ModelInterface.h\nstruct ModelInterfaceCacheWrap: ModelInterface, wrapper<ModelInterface> {\n  int getNumberOfPointSources() const { return this->get_override(\"getNumberOfPointSources\")(); }\n\n  void getPointSourcePosition(int srcid, double *j2000_ra, double *j2000_dec) const {\n    this->get_override(\"getPointSourcePosition\")();\n  }\n\n  std::vector<double> getPointSourceFluxes(int srcid, std::vector<double> energies) const {\n    return this->get_override(\"getPointSourceFluxes\")();\n  }\n\n  std::string getPointSourceName(int srcid) const { return this->get_override(\"getPointSourceName\")(); }\n\n  int getNumberOfExtendedSources() const { return this->get_override(\"getNumberOfExtendedSources\")(); }\n\n  std::vector<double> getExtendedSourceFluxes(int srcid, double j2000_ra, double j2000_dec,\n                                              std::vector<double> energies) const {\n    return this->get_override(\"getExtendedSourceFluxes\")();\n  }\n\n  std::string getExtendedSourceName(int srcid) const { return this->get_override(\"getExtendedSourceName\")(); }\n\n  bool isInsideAnyExtendedSource(double j2000_ra, double j2000_dec) const {\n    return this->get_override(\"isInsideAnyExtendedSource\")();\n  }\n\n  void getExtendedSourceBoundaries(int srcid, double *j2000_ra_min,\n                                   double *j2000_ra_max,\n                                   double *j2000_dec_min,\n                                   double *j2000_dec_max) const { this->get_override(\"getExtendedSourceBoundaries\")(); }\n};\n\ntemplate<class T>\nstruct VecToList {\n  static PyObject *convert(const std::vector<T> &vec) {\n    boost::python::list *l = new boost::python::list();\n\n    for (size_t i = 0; i < vec.size(); i++)\n      (*l).append(vec[i]);\n\n    return l->ptr();\n  }\n};\n\n\nBOOST_PYTHON_MODULE (pyModelInterfaceCache) {\n  \/\/hello\n  to_python_converter<std::vector<double, std::allocator<double> >, VecToList<double> >();\n\n  class_<ModelInterfaceCacheWrap, boost::noncopyable>(\"ModelInterface\")\n      .def(\"getNumberOfPointSources\", pure_virtual(&ModelInterface::getNumberOfPointSources))\n      .def(\"getPointSourcePosition\", pure_virtual(&ModelInterface::getPointSourcePosition))\n      .def(\"getPointSourceFluxes\", pure_virtual(&ModelInterface::getPointSourceFluxes))\n      .def(\"getPointSourceName\", pure_virtual(&ModelInterface::getPointSourceName))\n      .def(\"getNumberOfExtendedSources\", pure_virtual(&ModelInterface::getNumberOfExtendedSources))\n      .def(\"getExtendedSourceFluxes\", pure_virtual(&ModelInterface::getExtendedSourceFluxes))\n      .def(\"getExtendedSourceName\", pure_virtual(&ModelInterface::getExtendedSourceName))\n      .def(\"isInsideAnyExtendedSource\", pure_virtual(&ModelInterface::isInsideAnyExtendedSource))\n      .def(\"getExtendedSourceBoundaries\", pure_virtual(&ModelInterface::getExtendedSourceBoundaries));\n\n  numeric::array::set_module_and_type(\"numpy\", \"ndarray\");\n\n  class_<pyToCppModelInterfaceCache, bases<ModelInterface> >(\"pyToCppModelInterfaceCache\", init< >())\n      .def(\"getNumberOfPointSources\", &pyToCppModelInterfaceCache::getNumberOfPointSources)\n      .def(\"getPointSourcePosition\", &pyToCppModelInterfaceCache::getPointSourcePosition)\n      .def(\"getPointSourceFluxes\", &pyToCppModelInterfaceCache::getPointSourceFluxes)\n      .def(\"getPointSourceName\", &pyToCppModelInterfaceCache::getPointSourceName)\n      .def(\"getNumberOfExtendedSources\", &pyToCppModelInterfaceCache::getNumberOfExtendedSources)\n      .def(\"getExtendedSourceFluxes\", &pyToCppModelInterfaceCache::getExtendedSourceFluxes)\n      .def(\"getExtendedSourceName\", &pyToCppModelInterfaceCache::getExtendedSourceName)\n      .def(\"isInsideAnyExtendedSource\", &pyToCppModelInterfaceCache::isInsideAnyExtendedSource)\n      .def(\"getExtendedSourceBoundaries\", &pyToCppModelInterfaceCache::getExtendedSourceBoundaries)\n      .def(\"setExtSourceBoundaries\", &pyToCppModelInterfaceCache::setExtSourceBoundaries)\n      .def(\"setExtSourceCube\",&pyToCppModelInterfaceCache::setExtSourceCube)\n      .def(\"getExtendedSourceFluxes_test\",&pyToCppModelInterfaceCache::getExtendedSourceFluxes_test);\n}\n<commit_msg>Added the reset() method<commit_after>#include <boost\/python.hpp>\n#include \"ModelInterface.h\"\n#include \"pyToCppModelInterfaceCache.h\"\n\n#include <boost\/python\/stl_iterator.hpp>\n#include <iostream>\n#include <stdexcept>\n#include <boost\/python\/numeric.hpp>\n#include <boost\/python\/tuple.hpp>\n#include <boost\/python\/module.hpp>\n#include <boost\/python\/def.hpp>\n#include <numpy\/noprefix.h>\n\n\nnamespace threeML {\n\ntemplate<typename T>\ninline\nstd::vector<T> to_std_vector(const boost::python::object &iterable) {\n  return std::vector<T>(boost::python::stl_input_iterator<T>(iterable),\n                        boost::python::stl_input_iterator<T>());\n}\n\nvoid pyToCppModelInterfaceCache::setExtSourceBoundaries(const int id, const float lon_min, const float lon_max,\n                                                        const float lat_min, const float lat_max)\n{\n\n  BoundingBox this_boundingBox;\n\n  this_boundingBox.lon_min = lon_min;\n  this_boundingBox.lon_max = lon_max;\n  this_boundingBox.lat_min = lat_min;\n  this_boundingBox.lat_max = lat_max;\n\n  m_boundingBoxes[id] = this_boundingBox;\n\n}\n\nvoid pyToCppModelInterfaceCache::setExtSourceCube(const int id, const numeric::array &cube,\n                                                  const numeric::array &lon, const numeric::array &lat)\n{\n\n  \/\/ Add an extended source to the cache (a map)\n\n  PyArrayObject* cube__ = (PyArrayObject*) cube.ptr();\n\n  unsigned int n_points = (unsigned int) *(cube__->dimensions);\n  unsigned int n_energies = (unsigned int) *(cube__->dimensions+1);\n\n  \/\/ This is n_points * n_energies in size\n\n  double* cube_ = (double *) cube__->data;\n\n  \/\/ These are both n_points in size\n\n  double* lon_ = (double *) ((PyArrayObject*) lon.ptr())->data;\n  double* lat_ = (double *) ((PyArrayObject*) lat.ptr())->data;\n\n  ExtSrcCube this_srcCube;\n\n  for(unsigned int i=0; i < n_points; ++i)\n  {\n\n    float this_lon = (float) lon_[i];\n    float this_lat = (float) lat_[i];\n\n    SkyCoord this_coord(this_lon, this_lat);\n\n    \/\/ A little of pointer algebra\n\n    int this_data_start = i * n_energies;\n    int this_data_stop = this_data_start + n_energies;\n\n    \/\/ Note how this construct avoid the double copy which would\n    \/\/ occur if we were to first create a vector and then\n    \/\/ copy it into a standard map. Here instead the operator\n    \/\/ [] creates an empty vector, which is then filled with\n    \/\/ the assign method\n\n    this_srcCube[this_coord].assign(cube_ + this_data_start, cube_ + this_data_stop);\n\n  }\n\n  \/\/ Finally add to the map\n\n  m_extSources[id] = this_srcCube;\n\n}\n\nbool pyToCppModelInterfaceCache::isInsideAnyExtendedSource(double j2000_ra, double j2000_dec) const {\n  return true;\n}\n\nint pyToCppModelInterfaceCache::getNumberOfPointSources() const {\n\n  return m_nPtSources;\n\n}\n\nvoid pyToCppModelInterfaceCache::getPointSourcePosition(int srcid, double *j2000_ra, double *j2000_dec) const {\n\n  throw std::runtime_error(\"ModelInterfaceCache: point source not yet implemented\");\n}\n\nvoid pyToCppModelInterfaceCache::reset() {\n\n  \/\/Empty the cache\n  m_extSources.clear();\n  m_boundingBoxes.clear();\n  m_nExtSources = 0;\n  m_nPtSources = 0;\n\n}\n\nstd::vector<double>\npyToCppModelInterfaceCache::getPointSourceFluxes(int srcid, std::vector<double> energies) const {\n\n  throw std::runtime_error(\"ModelInterfaceCache: point source not yet implemented\");\n\n}\n\nint pyToCppModelInterfaceCache::getNumberOfExtendedSources() const {\n\n  return m_extSources.size();\n\n}\n\nstd::vector<double>\npyToCppModelInterfaceCache::getExtendedSourceFluxes(int srcid, double j2000_ra, double j2000_dec,\n                                               std::vector<double> energies) const {\n\n  SkyCoord sky_pos(j2000_ra, j2000_dec);\n\n  return m_extSources.at(srcid).at(sky_pos);\n\n}\n\nstd::vector<double>\npyToCppModelInterfaceCache::getExtendedSourceFluxes_test(int srcid, double j2000_ra, double j2000_dec) const {\n\n  SkyCoord sky_pos(j2000_ra, j2000_dec);\n\n  return m_extSources.at(srcid).at(sky_pos);\n\n}\n\nstd::string pyToCppModelInterfaceCache::getPointSourceName(int srcid) const {\n\n  \/\/TODO: implement a mechanism to actually keep the true name\n\n  std::stringstream name;\n\n  name << \"Point source \" << srcid;\n\n  return name.str();\n}\n\nstd::string pyToCppModelInterfaceCache::getExtendedSourceName(int srcid) const {\n\n  \/\/TODO: implement a mechanism to actually keep the true name\n\n  std::stringstream name;\n\n  name << \"Extended source \" << srcid;\n\n  return name.str();\n}\n\nvoid pyToCppModelInterfaceCache::getExtendedSourceBoundaries(int srcid, double *j2000_ra_min,\n                                                        double *j2000_ra_max,\n                                                        double *j2000_dec_min,\n                                                        double *j2000_dec_max) const {\n\n  const BoundingBox *this_boundingBox = &m_boundingBoxes.at(srcid);\n\n  *j2000_ra_min = this_boundingBox->lon_min;\n  *j2000_ra_max = this_boundingBox->lon_max;\n  *j2000_dec_min = this_boundingBox->lat_min;\n  *j2000_dec_max = this_boundingBox->lat_max;\n\n}\n\n}\n\nusing namespace threeML;\nusing namespace boost::python;\n\n\/\/This is needed to wrap the interface (i.e., all methods are virtual)\n\/\/contained in ModelInterface.h\nstruct ModelInterfaceCacheWrap: ModelInterface, wrapper<ModelInterface> {\n  int getNumberOfPointSources() const { return this->get_override(\"getNumberOfPointSources\")(); }\n\n  void getPointSourcePosition(int srcid, double *j2000_ra, double *j2000_dec) const {\n    this->get_override(\"getPointSourcePosition\")();\n  }\n\n  std::vector<double> getPointSourceFluxes(int srcid, std::vector<double> energies) const {\n    return this->get_override(\"getPointSourceFluxes\")();\n  }\n\n  std::string getPointSourceName(int srcid) const { return this->get_override(\"getPointSourceName\")(); }\n\n  int getNumberOfExtendedSources() const { return this->get_override(\"getNumberOfExtendedSources\")(); }\n\n  std::vector<double> getExtendedSourceFluxes(int srcid, double j2000_ra, double j2000_dec,\n                                              std::vector<double> energies) const {\n    return this->get_override(\"getExtendedSourceFluxes\")();\n  }\n\n  std::string getExtendedSourceName(int srcid) const { return this->get_override(\"getExtendedSourceName\")(); }\n\n  bool isInsideAnyExtendedSource(double j2000_ra, double j2000_dec) const {\n    return this->get_override(\"isInsideAnyExtendedSource\")();\n  }\n\n  void getExtendedSourceBoundaries(int srcid, double *j2000_ra_min,\n                                   double *j2000_ra_max,\n                                   double *j2000_dec_min,\n                                   double *j2000_dec_max) const { this->get_override(\"getExtendedSourceBoundaries\")(); }\n};\n\ntemplate<class T>\nstruct VecToList {\n  static PyObject *convert(const std::vector<T> &vec) {\n    boost::python::list *l = new boost::python::list();\n\n    for (size_t i = 0; i < vec.size(); i++)\n      (*l).append(vec[i]);\n\n    return l->ptr();\n  }\n};\n\n\nBOOST_PYTHON_MODULE (pyModelInterfaceCache) {\n  \/\/hello\n  to_python_converter<std::vector<double, std::allocator<double> >, VecToList<double> >();\n\n  class_<ModelInterfaceCacheWrap, boost::noncopyable>(\"ModelInterface\")\n      .def(\"getNumberOfPointSources\", pure_virtual(&ModelInterface::getNumberOfPointSources))\n      .def(\"getPointSourcePosition\", pure_virtual(&ModelInterface::getPointSourcePosition))\n      .def(\"getPointSourceFluxes\", pure_virtual(&ModelInterface::getPointSourceFluxes))\n      .def(\"getPointSourceName\", pure_virtual(&ModelInterface::getPointSourceName))\n      .def(\"getNumberOfExtendedSources\", pure_virtual(&ModelInterface::getNumberOfExtendedSources))\n      .def(\"getExtendedSourceFluxes\", pure_virtual(&ModelInterface::getExtendedSourceFluxes))\n      .def(\"getExtendedSourceName\", pure_virtual(&ModelInterface::getExtendedSourceName))\n      .def(\"isInsideAnyExtendedSource\", pure_virtual(&ModelInterface::isInsideAnyExtendedSource))\n      .def(\"getExtendedSourceBoundaries\", pure_virtual(&ModelInterface::getExtendedSourceBoundaries));\n\n  numeric::array::set_module_and_type(\"numpy\", \"ndarray\");\n\n  class_<pyToCppModelInterfaceCache, bases<ModelInterface> >(\"pyToCppModelInterfaceCache\", init< >())\n      .def(\"getNumberOfPointSources\", &pyToCppModelInterfaceCache::getNumberOfPointSources)\n      .def(\"getPointSourcePosition\", &pyToCppModelInterfaceCache::getPointSourcePosition)\n      .def(\"getPointSourceFluxes\", &pyToCppModelInterfaceCache::getPointSourceFluxes)\n      .def(\"getPointSourceName\", &pyToCppModelInterfaceCache::getPointSourceName)\n      .def(\"getNumberOfExtendedSources\", &pyToCppModelInterfaceCache::getNumberOfExtendedSources)\n      .def(\"getExtendedSourceFluxes\", &pyToCppModelInterfaceCache::getExtendedSourceFluxes)\n      .def(\"getExtendedSourceName\", &pyToCppModelInterfaceCache::getExtendedSourceName)\n      .def(\"isInsideAnyExtendedSource\", &pyToCppModelInterfaceCache::isInsideAnyExtendedSource)\n      .def(\"getExtendedSourceBoundaries\", &pyToCppModelInterfaceCache::getExtendedSourceBoundaries)\n      .def(\"setExtSourceBoundaries\", &pyToCppModelInterfaceCache::setExtSourceBoundaries)\n      .def(\"setExtSourceCube\",&pyToCppModelInterfaceCache::setExtSourceCube)\n      .def(\"getExtendedSourceFluxes_test\",&pyToCppModelInterfaceCache::getExtendedSourceFluxes_test)\n      .def(\"reset\",&pyToCppModelInterfaceCache::reset);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include <boost\/python.hpp>\n#include \"ModelInterface.h\"\n#include \"pyToCppModelInterfaceCache.h\"\n\n#include <boost\/python\/stl_iterator.hpp>\n#include <iostream>\n#include <stdexcept>\n#include <boost\/python\/numeric.hpp>\n#include <boost\/python\/tuple.hpp>\n#include <boost\/python\/module.hpp>\n#include <boost\/python\/def.hpp>\n#include <numpy\/noprefix.h>\n\n\nnamespace threeML {\n\ntemplate<typename T>\ninline\nstd::vector<T> to_std_vector(const boost::python::object &iterable) {\n  return std::vector<T>(boost::python::stl_input_iterator<T>(iterable),\n                        boost::python::stl_input_iterator<T>());\n}\n\nvoid pyToCppModelInterfaceCache::setPtsSourceSpectrum(const int id, const boost::numeric::array& spectrum)\n{\n\n  \/\/ These are both n_points in size\n\n  PyArrayObject* spectrum__ = (PyArrayObject*) spectrum.ptr();\n\n  unsigned int n_energies = (unsigned int) *(spectrum__->dimensions);\n\n  double* spectrum_ = (double *) spectrum__->data;\n\n  m_ptsSources[id].assign(spectrum_, spectrum_ + n_energies);\n\n}\n\nvoid pyToCppModelInterfaceCache::setPtsSourcePosition(const int id, const float lon, const float lat)\n{\n\n  m_ptsSourcesPos[id] = SkyCoord(lon, lat);\n\n}\n\nvoid pyToCppModelInterfaceCache::setExtSourceBoundaries(const int id, const float lon_min, const float lon_max,\n                                                        const float lat_min, const float lat_max)\n{\n\n  BoundingBox this_boundingBox;\n\n  this_boundingBox.lon_min = lon_min;\n  this_boundingBox.lon_max = lon_max;\n  this_boundingBox.lat_min = lat_min;\n  this_boundingBox.lat_max = lat_max;\n\n  m_boundingBoxes[id] = this_boundingBox;\n\n}\n\nvoid pyToCppModelInterfaceCache::setExtSourceCube(const int id, const boost::numeric::array &cube,\n                                                  const boost::numeric::array &lon, const boost::numeric::array &lat)\n{\n\n  \/\/ Add an extended source to the cache (a map)\n\n  PyArrayObject* cube__ = (PyArrayObject*) cube.ptr();\n\n  unsigned int n_points = (unsigned int) *(cube__->dimensions);\n  unsigned int n_energies = (unsigned int) *(cube__->dimensions+1);\n\n  \/\/ This is n_points * n_energies in size\n\n  double* cube_ = (double *) cube__->data;\n\n  \/\/ These are both n_points in size\n\n  double* lon_ = (double *) ((PyArrayObject*) lon.ptr())->data;\n  double* lat_ = (double *) ((PyArrayObject*) lat.ptr())->data;\n\n  ExtSrcCube this_srcCube;\n\n  for(unsigned int i=0; i < n_points; ++i)\n  {\n\n    float this_lon = (float) lon_[i];\n    float this_lat = (float) lat_[i];\n\n    SkyCoord this_coord(this_lon, this_lat);\n\n    \/\/ A little of pointer algebra\n\n    int this_data_start = i * n_energies;\n    int this_data_stop = this_data_start + n_energies;\n\n    \/\/ Note how this construct avoid the double copy which would\n    \/\/ occur if we were to first create a vector and then\n    \/\/ copy it into a standard map. Here instead the operator\n    \/\/ [] creates an empty vector, which is then filled with\n    \/\/ the assign method\n\n    this_srcCube[this_coord].assign(cube_ + this_data_start, cube_ + this_data_stop);\n\n  }\n\n  \/\/ Finally add to the map\n\n  m_extSources[id] = this_srcCube;\n\n}\n\nbool pyToCppModelInterfaceCache::isInsideAnyExtendedSource(double j2000_ra, double j2000_dec) const {\n  return true;\n}\n\nint pyToCppModelInterfaceCache::getNumberOfPointSources() const {\n\n  return m_ptsSourcesPos.size();\n\n}\n\nvoid pyToCppModelInterfaceCache::getPointSourcePosition(int srcid, double *j2000_ra, double *j2000_dec) const {\n\n  try {\n\n    SkyCoord this_position = m_ptsSourcesPos.at(srcid);\n    *j2000_ra = this_position.first;\n    *j2000_dec = this_position.second;\n\n  } catch (...) {\n\n    std::stringstream name;\n\n    name << \"Point source \" << srcid << \" not found in position cache\";\n\n    throw std::runtime_error(name.str());\n\n  }\n\n}\n\n\nvoid pyToCppModelInterfaceCache::reset() {\n\n  \/\/Empty the cache\n\n  m_extSources.clear();\n  m_ptsSources.clear();\n  \/*\n  m_boundingBoxes.clear();\n  m_nExtSources = 0;\n  m_nPtSources = 0;*\/\n\n}\n\nstd::vector<double>\npyToCppModelInterfaceCache::getPointSourceFluxes(int srcid, std::vector<double> energies) const {\n\n\n  if (m_ptsSources.count(srcid) == 0)\n  {\n    \/\/ This happens during the construction of LikeHAWC because there is a energy reweighting\n    \/\/ At that moment the cache is still empty, so let's just return the energy array which\n    \/\/ has the right size.\n\n    \/*\n    std::stringstream name;\n\n    name << \"Point source \" << srcid << \" not found in spectrum cache\";\n\n\n    throw std::runtime_error(name.str());*\/\n\n    std::cerr << \"Point source \" << srcid << \" not found in spectrum cache\" << std::endl;\n\n    return energies;\n\n  } else {\n\n    return m_ptsSources.at(srcid);\n\n  }\n\n\n\n}\n\nint pyToCppModelInterfaceCache::getNumberOfExtendedSources() const {\n\n  \/\/ We use the size of bounding boxes and not of m_extSources because the latter\n  \/\/ could get filled in a second moment\n  return m_boundingBoxes.size();\n\n}\n\nstd::vector<double>\npyToCppModelInterfaceCache::getExtendedSourceFluxes(int srcid, double j2000_ra, double j2000_dec,\n                                               std::vector<double> energies) const {\n\n  SkyCoord sky_pos(j2000_ra, j2000_dec);\n\n  return m_extSources.at(srcid).at(sky_pos);\n\n}\n\nstd::vector<double>\npyToCppModelInterfaceCache::getExtendedSourceFluxes_test(int srcid, double j2000_ra, double j2000_dec) const {\n\n  SkyCoord sky_pos(j2000_ra, j2000_dec);\n\n  return m_extSources.at(srcid).at(sky_pos);\n\n}\n\nstd::string pyToCppModelInterfaceCache::getPointSourceName(int srcid) const {\n\n  \/\/TODO: implement a mechanism to actually keep the true name\n\n  std::stringstream name;\n\n  name << \"Point source \" << srcid;\n\n  return name.str();\n}\n\nstd::string pyToCppModelInterfaceCache::getExtendedSourceName(int srcid) const {\n\n  \/\/TODO: implement a mechanism to actually keep the true name\n\n  std::stringstream name;\n\n  name << \"Extended source \" << srcid;\n\n  return name.str();\n}\n\nvoid pyToCppModelInterfaceCache::getExtendedSourceBoundaries(int srcid, double *j2000_ra_min,\n                                                        double *j2000_ra_max,\n                                                        double *j2000_dec_min,\n                                                        double *j2000_dec_max) const {\n\n  const BoundingBox *this_boundingBox = &m_boundingBoxes.at(srcid);\n\n  *j2000_ra_min = this_boundingBox->lon_min;\n  *j2000_ra_max = this_boundingBox->lon_max;\n  *j2000_dec_min = this_boundingBox->lat_min;\n  *j2000_dec_max = this_boundingBox->lat_max;\n\n}\n\n}\n\nusing namespace threeML;\nusing namespace boost::python;\n\n\/\/This is needed to wrap the interface (i.e., all methods are virtual)\n\/\/contained in ModelInterface.h\nstruct ModelInterfaceCacheWrap: ModelInterface, wrapper<ModelInterface> {\n  int getNumberOfPointSources() const { return this->get_override(\"getNumberOfPointSources\")(); }\n\n  void getPointSourcePosition(int srcid, double *j2000_ra, double *j2000_dec) const {\n    this->get_override(\"getPointSourcePosition\")();\n  }\n\n  std::vector<double> getPointSourceFluxes(int srcid, std::vector<double> energies) const {\n    return this->get_override(\"getPointSourceFluxes\")();\n  }\n\n  std::string getPointSourceName(int srcid) const { return this->get_override(\"getPointSourceName\")(); }\n\n  int getNumberOfExtendedSources() const { return this->get_override(\"getNumberOfExtendedSources\")(); }\n\n  std::vector<double> getExtendedSourceFluxes(int srcid, double j2000_ra, double j2000_dec,\n                                              std::vector<double> energies) const {\n    return this->get_override(\"getExtendedSourceFluxes\")();\n  }\n\n  std::string getExtendedSourceName(int srcid) const { return this->get_override(\"getExtendedSourceName\")(); }\n\n  bool isInsideAnyExtendedSource(double j2000_ra, double j2000_dec) const {\n    return this->get_override(\"isInsideAnyExtendedSource\")();\n  }\n\n  void getExtendedSourceBoundaries(int srcid, double *j2000_ra_min,\n                                   double *j2000_ra_max,\n                                   double *j2000_dec_min,\n                                   double *j2000_dec_max) const { this->get_override(\"getExtendedSourceBoundaries\")(); }\n};\n\ntemplate<class T>\nstruct VecToList {\n  static PyObject *convert(const std::vector<T> &vec) {\n    boost::python::list *l = new boost::python::list();\n\n    for (size_t i = 0; i < vec.size(); i++)\n      (*l).append(vec[i]);\n\n    return l->ptr();\n  }\n};\n\n\nBOOST_PYTHON_MODULE (pyModelInterfaceCache) {\n  \/\/hello\n  to_python_converter<std::vector<double, std::allocator<double> >, VecToList<double> >();\n\n  class_<ModelInterfaceCacheWrap, boost::noncopyable>(\"ModelInterface\")\n      .def(\"getNumberOfPointSources\", pure_virtual(&ModelInterface::getNumberOfPointSources))\n      .def(\"getPointSourcePosition\", pure_virtual(&ModelInterface::getPointSourcePosition))\n      .def(\"getPointSourceFluxes\", pure_virtual(&ModelInterface::getPointSourceFluxes))\n      .def(\"getPointSourceName\", pure_virtual(&ModelInterface::getPointSourceName))\n      .def(\"getNumberOfExtendedSources\", pure_virtual(&ModelInterface::getNumberOfExtendedSources))\n      .def(\"getExtendedSourceFluxes\", pure_virtual(&ModelInterface::getExtendedSourceFluxes))\n      .def(\"getExtendedSourceName\", pure_virtual(&ModelInterface::getExtendedSourceName))\n      .def(\"isInsideAnyExtendedSource\", pure_virtual(&ModelInterface::isInsideAnyExtendedSource))\n      .def(\"getExtendedSourceBoundaries\", pure_virtual(&ModelInterface::getExtendedSourceBoundaries));\n\n  boost::numeric::array::set_module_and_type(\"numpy\", \"ndarray\");\n\n  class_<pyToCppModelInterfaceCache, bases<ModelInterface> >(\"pyToCppModelInterfaceCache\", init< >())\n      .def(\"getNumberOfPointSources\", &pyToCppModelInterfaceCache::getNumberOfPointSources)\n      .def(\"getPointSourcePosition\", &pyToCppModelInterfaceCache::getPointSourcePosition)\n      .def(\"getPointSourceFluxes\", &pyToCppModelInterfaceCache::getPointSourceFluxes)\n      .def(\"getPointSourceName\", &pyToCppModelInterfaceCache::getPointSourceName)\n      .def(\"getNumberOfExtendedSources\", &pyToCppModelInterfaceCache::getNumberOfExtendedSources)\n      .def(\"getExtendedSourceFluxes\", &pyToCppModelInterfaceCache::getExtendedSourceFluxes)\n      .def(\"getExtendedSourceName\", &pyToCppModelInterfaceCache::getExtendedSourceName)\n      .def(\"isInsideAnyExtendedSource\", &pyToCppModelInterfaceCache::isInsideAnyExtendedSource)\n      .def(\"getExtendedSourceBoundaries\", &pyToCppModelInterfaceCache::getExtendedSourceBoundaries)\n      .def(\"setExtSourceBoundaries\", &pyToCppModelInterfaceCache::setExtSourceBoundaries)\n      .def(\"setExtSourceCube\",&pyToCppModelInterfaceCache::setExtSourceCube)\n      .def(\"getExtendedSourceFluxes_test\",&pyToCppModelInterfaceCache::getExtendedSourceFluxes_test)\n      .def(\"reset\",&pyToCppModelInterfaceCache::reset)\n      .def(\"setPtsSourceSpectrum\",&pyToCppModelInterfaceCache::setPtsSourceSpectrum)\n      .def(\"setPtsSourcePosition\",&pyToCppModelInterfaceCache::setPtsSourcePosition);\n}\n<commit_msg>Update pyToCppModelInterfaceCache.cxx<commit_after>#include <boost\/python.hpp>\n#include \"ModelInterface.h\"\n#include \"pyToCppModelInterfaceCache.h\"\n\n#include <boost\/python\/stl_iterator.hpp>\n#include <iostream>\n#include <stdexcept>\n#include <boost\/python\/numeric.hpp>\n#include <boost\/python\/tuple.hpp>\n#include <boost\/python\/module.hpp>\n#include <boost\/python\/def.hpp>\n#include <numpy\/noprefix.h>\n\n\nnamespace threeML {\n\ntemplate<typename T>\ninline\nstd::vector<T> to_std_vector(const boost::python::object &iterable) {\n  return std::vector<T>(boost::python::stl_input_iterator<T>(iterable),\n                        boost::python::stl_input_iterator<T>());\n}\n\nvoid pyToCppModelInterfaceCache::setPtsSourceSpectrum(const int id, const numeric::array& spectrum)\n{\n\n  \/\/ These are both n_points in size\n\n  PyArrayObject* spectrum__ = (PyArrayObject*) spectrum.ptr();\n\n  unsigned int n_energies = (unsigned int) *(spectrum__->dimensions);\n\n  double* spectrum_ = (double *) spectrum__->data;\n\n  m_ptsSources[id].assign(spectrum_, spectrum_ + n_energies);\n\n}\n\nvoid pyToCppModelInterfaceCache::setPtsSourcePosition(const int id, const float lon, const float lat)\n{\n\n  m_ptsSourcesPos[id] = SkyCoord(lon, lat);\n\n}\n\nvoid pyToCppModelInterfaceCache::setExtSourceBoundaries(const int id, const float lon_min, const float lon_max,\n                                                        const float lat_min, const float lat_max)\n{\n\n  BoundingBox this_boundingBox;\n\n  this_boundingBox.lon_min = lon_min;\n  this_boundingBox.lon_max = lon_max;\n  this_boundingBox.lat_min = lat_min;\n  this_boundingBox.lat_max = lat_max;\n\n  m_boundingBoxes[id] = this_boundingBox;\n\n}\n\nvoid pyToCppModelInterfaceCache::setExtSourceCube(const int id, const numeric::array &cube,\n                                                  const numeric::array &lon, const numeric::array &lat)\n{\n\n  \/\/ Add an extended source to the cache (a map)\n\n  PyArrayObject* cube__ = (PyArrayObject*) cube.ptr();\n\n  unsigned int n_points = (unsigned int) *(cube__->dimensions);\n  unsigned int n_energies = (unsigned int) *(cube__->dimensions+1);\n\n  \/\/ This is n_points * n_energies in size\n\n  double* cube_ = (double *) cube__->data;\n\n  \/\/ These are both n_points in size\n\n  double* lon_ = (double *) ((PyArrayObject*) lon.ptr())->data;\n  double* lat_ = (double *) ((PyArrayObject*) lat.ptr())->data;\n\n  ExtSrcCube this_srcCube;\n\n  for(unsigned int i=0; i < n_points; ++i)\n  {\n\n    float this_lon = (float) lon_[i];\n    float this_lat = (float) lat_[i];\n\n    SkyCoord this_coord(this_lon, this_lat);\n\n    \/\/ A little of pointer algebra\n\n    int this_data_start = i * n_energies;\n    int this_data_stop = this_data_start + n_energies;\n\n    \/\/ Note how this construct avoid the double copy which would\n    \/\/ occur if we were to first create a vector and then\n    \/\/ copy it into a standard map. Here instead the operator\n    \/\/ [] creates an empty vector, which is then filled with\n    \/\/ the assign method\n\n    this_srcCube[this_coord].assign(cube_ + this_data_start, cube_ + this_data_stop);\n\n  }\n\n  \/\/ Finally add to the map\n\n  m_extSources[id] = this_srcCube;\n\n}\n\nbool pyToCppModelInterfaceCache::isInsideAnyExtendedSource(double j2000_ra, double j2000_dec) const {\n  return true;\n}\n\nint pyToCppModelInterfaceCache::getNumberOfPointSources() const {\n\n  return m_ptsSourcesPos.size();\n\n}\n\nvoid pyToCppModelInterfaceCache::getPointSourcePosition(int srcid, double *j2000_ra, double *j2000_dec) const {\n\n  try {\n\n    SkyCoord this_position = m_ptsSourcesPos.at(srcid);\n    *j2000_ra = this_position.first;\n    *j2000_dec = this_position.second;\n\n  } catch (...) {\n\n    std::stringstream name;\n\n    name << \"Point source \" << srcid << \" not found in position cache\";\n\n    throw std::runtime_error(name.str());\n\n  }\n\n}\n\n\nvoid pyToCppModelInterfaceCache::reset() {\n\n  \/\/Empty the cache\n\n  m_extSources.clear();\n  m_ptsSources.clear();\n  \/*\n  m_boundingBoxes.clear();\n  m_nExtSources = 0;\n  m_nPtSources = 0;*\/\n\n}\n\nstd::vector<double>\npyToCppModelInterfaceCache::getPointSourceFluxes(int srcid, std::vector<double> energies) const {\n\n\n  if (m_ptsSources.count(srcid) == 0)\n  {\n    \/\/ This happens during the construction of LikeHAWC because there is a energy reweighting\n    \/\/ At that moment the cache is still empty, so let's just return the energy array which\n    \/\/ has the right size.\n\n    \/*\n    std::stringstream name;\n\n    name << \"Point source \" << srcid << \" not found in spectrum cache\";\n\n\n    throw std::runtime_error(name.str());*\/\n\n    std::cerr << \"Point source \" << srcid << \" not found in spectrum cache\" << std::endl;\n\n    return energies;\n\n  } else {\n\n    return m_ptsSources.at(srcid);\n\n  }\n\n\n\n}\n\nint pyToCppModelInterfaceCache::getNumberOfExtendedSources() const {\n\n  \/\/ We use the size of bounding boxes and not of m_extSources because the latter\n  \/\/ could get filled in a second moment\n  return m_boundingBoxes.size();\n\n}\n\nstd::vector<double>\npyToCppModelInterfaceCache::getExtendedSourceFluxes(int srcid, double j2000_ra, double j2000_dec,\n                                               std::vector<double> energies) const {\n\n  SkyCoord sky_pos(j2000_ra, j2000_dec);\n\n  return m_extSources.at(srcid).at(sky_pos);\n\n}\n\nstd::vector<double>\npyToCppModelInterfaceCache::getExtendedSourceFluxes_test(int srcid, double j2000_ra, double j2000_dec) const {\n\n  SkyCoord sky_pos(j2000_ra, j2000_dec);\n\n  return m_extSources.at(srcid).at(sky_pos);\n\n}\n\nstd::string pyToCppModelInterfaceCache::getPointSourceName(int srcid) const {\n\n  \/\/TODO: implement a mechanism to actually keep the true name\n\n  std::stringstream name;\n\n  name << \"Point source \" << srcid;\n\n  return name.str();\n}\n\nstd::string pyToCppModelInterfaceCache::getExtendedSourceName(int srcid) const {\n\n  \/\/TODO: implement a mechanism to actually keep the true name\n\n  std::stringstream name;\n\n  name << \"Extended source \" << srcid;\n\n  return name.str();\n}\n\nvoid pyToCppModelInterfaceCache::getExtendedSourceBoundaries(int srcid, double *j2000_ra_min,\n                                                        double *j2000_ra_max,\n                                                        double *j2000_dec_min,\n                                                        double *j2000_dec_max) const {\n\n  const BoundingBox *this_boundingBox = &m_boundingBoxes.at(srcid);\n\n  *j2000_ra_min = this_boundingBox->lon_min;\n  *j2000_ra_max = this_boundingBox->lon_max;\n  *j2000_dec_min = this_boundingBox->lat_min;\n  *j2000_dec_max = this_boundingBox->lat_max;\n\n}\n\n}\n\nusing namespace threeML;\nusing namespace boost::python;\n\n\/\/This is needed to wrap the interface (i.e., all methods are virtual)\n\/\/contained in ModelInterface.h\nstruct ModelInterfaceCacheWrap: ModelInterface, wrapper<ModelInterface> {\n  int getNumberOfPointSources() const { return this->get_override(\"getNumberOfPointSources\")(); }\n\n  void getPointSourcePosition(int srcid, double *j2000_ra, double *j2000_dec) const {\n    this->get_override(\"getPointSourcePosition\")();\n  }\n\n  std::vector<double> getPointSourceFluxes(int srcid, std::vector<double> energies) const {\n    return this->get_override(\"getPointSourceFluxes\")();\n  }\n\n  std::string getPointSourceName(int srcid) const { return this->get_override(\"getPointSourceName\")(); }\n\n  int getNumberOfExtendedSources() const { return this->get_override(\"getNumberOfExtendedSources\")(); }\n\n  std::vector<double> getExtendedSourceFluxes(int srcid, double j2000_ra, double j2000_dec,\n                                              std::vector<double> energies) const {\n    return this->get_override(\"getExtendedSourceFluxes\")();\n  }\n\n  std::string getExtendedSourceName(int srcid) const { return this->get_override(\"getExtendedSourceName\")(); }\n\n  bool isInsideAnyExtendedSource(double j2000_ra, double j2000_dec) const {\n    return this->get_override(\"isInsideAnyExtendedSource\")();\n  }\n\n  void getExtendedSourceBoundaries(int srcid, double *j2000_ra_min,\n                                   double *j2000_ra_max,\n                                   double *j2000_dec_min,\n                                   double *j2000_dec_max) const { this->get_override(\"getExtendedSourceBoundaries\")(); }\n};\n\ntemplate<class T>\nstruct VecToList {\n  static PyObject *convert(const std::vector<T> &vec) {\n    boost::python::list *l = new boost::python::list();\n\n    for (size_t i = 0; i < vec.size(); i++)\n      (*l).append(vec[i]);\n\n    return l->ptr();\n  }\n};\n\n\nBOOST_PYTHON_MODULE (pyModelInterfaceCache) {\n  \/\/hello\n  to_python_converter<std::vector<double, std::allocator<double> >, VecToList<double> >();\n\n  class_<ModelInterfaceCacheWrap, boost::noncopyable>(\"ModelInterface\")\n      .def(\"getNumberOfPointSources\", pure_virtual(&ModelInterface::getNumberOfPointSources))\n      .def(\"getPointSourcePosition\", pure_virtual(&ModelInterface::getPointSourcePosition))\n      .def(\"getPointSourceFluxes\", pure_virtual(&ModelInterface::getPointSourceFluxes))\n      .def(\"getPointSourceName\", pure_virtual(&ModelInterface::getPointSourceName))\n      .def(\"getNumberOfExtendedSources\", pure_virtual(&ModelInterface::getNumberOfExtendedSources))\n      .def(\"getExtendedSourceFluxes\", pure_virtual(&ModelInterface::getExtendedSourceFluxes))\n      .def(\"getExtendedSourceName\", pure_virtual(&ModelInterface::getExtendedSourceName))\n      .def(\"isInsideAnyExtendedSource\", pure_virtual(&ModelInterface::isInsideAnyExtendedSource))\n      .def(\"getExtendedSourceBoundaries\", pure_virtual(&ModelInterface::getExtendedSourceBoundaries));\n\n  numeric::array::set_module_and_type(\"numpy\", \"ndarray\");\n\n  class_<pyToCppModelInterfaceCache, bases<ModelInterface> >(\"pyToCppModelInterfaceCache\", init< >())\n      .def(\"getNumberOfPointSources\", &pyToCppModelInterfaceCache::getNumberOfPointSources)\n      .def(\"getPointSourcePosition\", &pyToCppModelInterfaceCache::getPointSourcePosition)\n      .def(\"getPointSourceFluxes\", &pyToCppModelInterfaceCache::getPointSourceFluxes)\n      .def(\"getPointSourceName\", &pyToCppModelInterfaceCache::getPointSourceName)\n      .def(\"getNumberOfExtendedSources\", &pyToCppModelInterfaceCache::getNumberOfExtendedSources)\n      .def(\"getExtendedSourceFluxes\", &pyToCppModelInterfaceCache::getExtendedSourceFluxes)\n      .def(\"getExtendedSourceName\", &pyToCppModelInterfaceCache::getExtendedSourceName)\n      .def(\"isInsideAnyExtendedSource\", &pyToCppModelInterfaceCache::isInsideAnyExtendedSource)\n      .def(\"getExtendedSourceBoundaries\", &pyToCppModelInterfaceCache::getExtendedSourceBoundaries)\n      .def(\"setExtSourceBoundaries\", &pyToCppModelInterfaceCache::setExtSourceBoundaries)\n      .def(\"setExtSourceCube\",&pyToCppModelInterfaceCache::setExtSourceCube)\n      .def(\"getExtendedSourceFluxes_test\",&pyToCppModelInterfaceCache::getExtendedSourceFluxes_test)\n      .def(\"reset\",&pyToCppModelInterfaceCache::reset)\n      .def(\"setPtsSourceSpectrum\",&pyToCppModelInterfaceCache::setPtsSourceSpectrum)\n      .def(\"setPtsSourcePosition\",&pyToCppModelInterfaceCache::setPtsSourcePosition);\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Tweak some things to be compatible with libpng 1.4.<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright © 2016, Prosoft Engineering, Inc. (A.K.A \"Prosoft\")\n\/\/ All 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 Prosoft 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\" 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 PROSOFT ENGINEERING, INC. 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#if !_WIN32\n#include <unistd.h>\n#else\n#include <windows.h>\n#include <process.h> \/\/ _getpid()\n#endif\n\n#include <fstream>\n#include <string>\n\nnamespace {\n    prosoft::filesystem::path process_name() {\n        const int mypid =\n        #if !_WIN32\n            ::getpid();\n        #else\n            ::_getpid();\n        #endif\n        using namespace prosoft::filesystem;\n        return path{std::to_string(mypid)};\n    }\n    \n    prosoft::filesystem::path process_name(const char* s) {\n        return  process_name().concat(\"_\").concat(s);\n    }\n\n    template<typename T>\n    const T& create_file(const T& p, std::ios::openmode mode = std::ios::binary) {\n        std::ofstream stream(p.c_str(), mode);\n        REQUIRE(stream);\n        return p;\n    }\n    \n    \/\/ Microsoft's compiler offers std::ofstream with wide character support as an extension, but Mingw posix does not.\n    \/\/ Since Mingw is currently only for compiling, always fail. Could use CreateFile() instead for both compilers.\n#ifdef __MINGW32__\n    template<>\n    const filesystem::basic_path<prosoft::u16string>& create_file(const filesystem::basic_path<prosoft::u16string>& p, std::ios::openmode) {\n        REQUIRE(false); \/\/ always fail\n        return p;\n    }\n#endif\n    \n    class RAII_remove { \/\/ cleanup for test cases\n        using path_type = prosoft::filesystem::path;\n        const path_type& m_p;\n    public:\n        RAII_remove(const path_type& p) : m_p(p) {}\n        RAII_remove(path_type&&) = delete;\n        RAII_remove(const RAII_remove&) = delete;\n        RAII_remove(RAII_remove&&) = delete;\n        ~RAII_remove() {\n            prosoft::filesystem::error_code ec;\n            prosoft::filesystem::remove(m_p, ec);\n            CHECK(!ec); \/\/ REQUIRE throws an exception on failure\n        }\n    };\n    #define PS_RAII_REMOVE___(p,R,C) RAII_remove  R##C(p)\n    #define PS_RAII_REMOVE__(p,R,C) PS_RAII_REMOVE___(p,R,C)\n    #define PS_RAII_REMOVE(p) PS_RAII_REMOVE__(p, r, __COUNTER__)\n}\n<commit_msg>Fix unused function warning<commit_after>\/\/ Copyright © 2016-2018, Prosoft Engineering, Inc. (A.K.A \"Prosoft\")\n\/\/ All 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 Prosoft 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\" 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 PROSOFT ENGINEERING, INC. 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#if !_WIN32\n#include <unistd.h>\n#else\n#include <windows.h>\n#include <process.h> \/\/ _getpid()\n#endif\n\n#include <fstream>\n#include <string>\n\nnamespace {\n    prosoft::filesystem::path process_name() {\n        const int mypid =\n        #if !_WIN32\n            ::getpid();\n        #else\n            ::_getpid();\n        #endif\n        using namespace prosoft::filesystem;\n        return path{std::to_string(mypid)};\n    }\n    \n    inline\n    prosoft::filesystem::path process_name(const char* s) {\n        return  process_name().concat(\"_\").concat(s);\n    }\n\n    template<typename T>\n    const T& create_file(const T& p, std::ios::openmode mode = std::ios::binary) {\n        std::ofstream stream(p.c_str(), mode);\n        REQUIRE(stream);\n        return p;\n    }\n    \n    \/\/ Microsoft's compiler offers std::ofstream with wide character support as an extension, but Mingw posix does not.\n    \/\/ Since Mingw is currently only for compiling, always fail. Could use CreateFile() instead for both compilers.\n#ifdef __MINGW32__\n    template<>\n    const filesystem::basic_path<prosoft::u16string>& create_file(const filesystem::basic_path<prosoft::u16string>& p, std::ios::openmode) {\n        REQUIRE(false); \/\/ always fail\n        return p;\n    }\n#endif\n    \n    class RAII_remove { \/\/ cleanup for test cases\n        using path_type = prosoft::filesystem::path;\n        const path_type& m_p;\n    public:\n        RAII_remove(const path_type& p) : m_p(p) {}\n        RAII_remove(path_type&&) = delete;\n        RAII_remove(const RAII_remove&) = delete;\n        RAII_remove(RAII_remove&&) = delete;\n        ~RAII_remove() {\n            prosoft::filesystem::error_code ec;\n            prosoft::filesystem::remove(m_p, ec);\n            CHECK(!ec); \/\/ REQUIRE throws an exception on failure\n        }\n    };\n    #define PS_RAII_REMOVE___(p,R,C) RAII_remove  R##C(p)\n    #define PS_RAII_REMOVE__(p,R,C) PS_RAII_REMOVE___(p,R,C)\n    #define PS_RAII_REMOVE(p) PS_RAII_REMOVE__(p, r, __COUNTER__)\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ @(#)root\/hist:$Id$\n\/\/ Author: Rene Brun   05\/04\/2003\n\n\/*************************************************************************\n * Copyright (C) 1995-2003, 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 \"TF12.h\"\n#include \"TH1.h\"\n#include \"TVirtualPad.h\"\n\nClassImp(TF12);\n\n\/** \\class TF12\n    \\ingroup Hist\n A projection of a TF2 along X or Y\n\nIt has the same behaviour as a TF1\n\nExample of a function\n    TF2 *f2 = new TF2(\"f2\",\"sin(x)*sin(y)\/(x*y)\",0,5,0,5);\n    TF12 *f12 = new TF12(\"f12\",f2,0.1,\"y\");\n    f12->Draw();\n*\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ TF12 default constructor\n\nTF12::TF12(): TF1()\n{\n   fCase = 0;\n   fF2   = 0;\n   fXY   = 0;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ TF12 normal constructor.\n\/\/\/\n\/\/\/ Create a TF12 (special TF1) from a projection of a TF2\n\/\/\/ for a fix value of Y if option=\"X\" or X if option=\"Y\"\n\/\/\/ This value may be changed at any time via TF12::SetXY(xy)\n\nTF12::TF12(const char *name, TF2 *f2, Double_t xy, Option_t *option)\n      :TF1(name,\"x\",0,0)\n{\n   SetName(name);\n   fF2 = f2;\n   TString opt=option;\n   opt.ToLower();\n   if (!f2) {\n      Error(\"TF12\",\"Pointer to TF2 is null\");\n      return;\n   }\n   SetXY(xy);\n   if (opt.Contains(\"y\")) {\n      fXmin = f2->GetYmin();\n      fXmax = f2->GetYmax();\n      fCase = 1;\n   } else {\n      fXmin = f2->GetXmin();\n      fXmax = f2->GetXmax();\n      fCase = 0;\n   }\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ F2 default destructor.\n\nTF12::~TF12()\n{\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Copy constructor.\n\nTF12::TF12(const TF12 &f12) : TF1(f12)\n{\n   ((TF12&)f12).Copy(*this);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Copy this F2 to a new F2.\n\nvoid TF12::Copy(TObject &obj) const\n{\n   TF1::Copy(obj);\n   ((TF12&)obj).fXY      = fXY;\n   ((TF12&)obj).fCase    = fCase;\n   ((TF12&)obj).fF2      = fF2;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Draw a copy of this function with its current attributes.\n\/\/\/\n\/\/\/ This function MUST be used instead of Draw when you want to draw\n\/\/\/ the same function with different parameters settings in the same canvas.\n\/\/\/\n\/\/\/ Possible option values are:\n\/\/\/\n\/\/\/ option | description\n\/\/\/ -------|----------------------------------------\n\/\/\/ \"SAME\" | superimpose on top of existing picture\n\/\/\/ \"L\"    | connect all computed points with a straight line\n\/\/\/ \"C\"    | connect all computed points with a smooth curve\n\/\/\/\n\/\/\/ Note that the default value is \"F\". Therefore to draw on top\n\/\/\/ of an existing picture, specify option \"SL\"\n\nTF1 *TF12::DrawCopy(Option_t *option) const\n{\n   TF12 *newf2 = new TF12();\n   Copy(*newf2);\n   newf2->AppendPad(option);\n   newf2->SetBit(kCanDelete);\n   return newf2;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Evaluate this formula\n\/\/\/\n\/\/\/   Computes the value of the referenced TF2 for a fix value of X or Y\n\nDouble_t TF12::Eval(Double_t x, Double_t \/*y*\/, Double_t \/*z*\/, Double_t \/*t*\/) const\n{\n   if (!fF2) return 0;\n   if (fCase == 0) {\n      return fF2->Eval(x,fXY,0);\n   } else {\n      return fF2->Eval(fXY,x,0);\n   }\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Evaluate this function at point x[0]\n\/\/\/\n\/\/\/ x[0] is the value along X if fCase =0, the value along Y if fCase=1\n\/\/\/ if params is non null, the array will be used instead of the internal TF2\n\/\/\/ parameters\n\nDouble_t TF12::EvalPar(const Double_t *x, const Double_t *params)\n{\n   if (!fF2) return 0;\n   Double_t xx[2];\n   if (fCase == 0) {\n      xx[0] = x[0];\n      xx[1] = fXY;\n   } else {\n      xx[0] = fXY;\n      xx[1] = x[0];\n   }\n   fF2->InitArgs(xx,params);\n   return fF2->EvalPar(xx,params);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Save primitive as a C++ statement(s) on output stream out\n\nvoid TF12::SavePrimitive(std::ostream & \/*out*\/, Option_t * \/*option*\/ \/*= \"\"*\/)\n{\n   Error(\"SavePrimitive\",\"Function not yet implemented\");\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Set the value of the constant for the TF2\n\/\/\/\n\/\/\/   constant in X when projecting along Y\n\/\/\/   constant in Y when projecting along X\n\/\/\/  The function title is set to include the value of the constant\n\/\/\/  The current pad is updated\n\nvoid TF12::SetXY(Double_t xy)\n{\n   fXY = xy;\n   if (!fF2) return;\n   if (fCase == 0) SetTitle(Form(\"%s (y=%g)\",fF2->GetTitle(),xy));\n   else            SetTitle(Form(\"%s (x=%g)\",fF2->GetTitle(),xy));\n   if (fHistogram) fHistogram->SetTitle(GetTitle());\n   if (gPad) gPad->Modified();\n}\n<commit_msg>Doxygen fix<commit_after>\/\/ @(#)root\/hist:$Id$\n\/\/ Author: Rene Brun   05\/04\/2003\n\n\/*************************************************************************\n * Copyright (C) 1995-2003, 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 \"TF12.h\"\n#include \"TH1.h\"\n#include \"TVirtualPad.h\"\n\nClassImp(TF12);\n\n\/** \\class TF12\n    \\ingroup Hist\n A projection of a TF2 along X or Y\n\nIt has the same behaviour as a TF1\n\nExample of a function\n\n~~~ {.cpp}\n    TF2 *f2 = new TF2(\"f2\",\"sin(x)*sin(y)\/(x*y)\",0,5,0,5);\n    TF12 *f12 = new TF12(\"f12\",f2,0.1,\"y\");\n    f12->Draw();\n~~~\n\n*\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ TF12 default constructor\n\nTF12::TF12(): TF1()\n{\n   fCase = 0;\n   fF2   = 0;\n   fXY   = 0;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ TF12 normal constructor.\n\/\/\/\n\/\/\/ Create a TF12 (special TF1) from a projection of a TF2\n\/\/\/ for a fix value of Y if option=\"X\" or X if option=\"Y\"\n\/\/\/ This value may be changed at any time via TF12::SetXY(xy)\n\nTF12::TF12(const char *name, TF2 *f2, Double_t xy, Option_t *option)\n      :TF1(name,\"x\",0,0)\n{\n   SetName(name);\n   fF2 = f2;\n   TString opt=option;\n   opt.ToLower();\n   if (!f2) {\n      Error(\"TF12\",\"Pointer to TF2 is null\");\n      return;\n   }\n   SetXY(xy);\n   if (opt.Contains(\"y\")) {\n      fXmin = f2->GetYmin();\n      fXmax = f2->GetYmax();\n      fCase = 1;\n   } else {\n      fXmin = f2->GetXmin();\n      fXmax = f2->GetXmax();\n      fCase = 0;\n   }\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ F2 default destructor.\n\nTF12::~TF12()\n{\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Copy constructor.\n\nTF12::TF12(const TF12 &f12) : TF1(f12)\n{\n   ((TF12&)f12).Copy(*this);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Copy this F2 to a new F2.\n\nvoid TF12::Copy(TObject &obj) const\n{\n   TF1::Copy(obj);\n   ((TF12&)obj).fXY      = fXY;\n   ((TF12&)obj).fCase    = fCase;\n   ((TF12&)obj).fF2      = fF2;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Draw a copy of this function with its current attributes.\n\/\/\/\n\/\/\/ This function MUST be used instead of Draw when you want to draw\n\/\/\/ the same function with different parameters settings in the same canvas.\n\/\/\/\n\/\/\/ Possible option values are:\n\/\/\/\n\/\/\/ option | description\n\/\/\/ -------|----------------------------------------\n\/\/\/ \"SAME\" | superimpose on top of existing picture\n\/\/\/ \"L\"    | connect all computed points with a straight line\n\/\/\/ \"C\"    | connect all computed points with a smooth curve\n\/\/\/\n\/\/\/ Note that the default value is \"F\". Therefore to draw on top\n\/\/\/ of an existing picture, specify option \"SL\"\n\nTF1 *TF12::DrawCopy(Option_t *option) const\n{\n   TF12 *newf2 = new TF12();\n   Copy(*newf2);\n   newf2->AppendPad(option);\n   newf2->SetBit(kCanDelete);\n   return newf2;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Evaluate this formula\n\/\/\/\n\/\/\/   Computes the value of the referenced TF2 for a fix value of X or Y\n\nDouble_t TF12::Eval(Double_t x, Double_t \/*y*\/, Double_t \/*z*\/, Double_t \/*t*\/) const\n{\n   if (!fF2) return 0;\n   if (fCase == 0) {\n      return fF2->Eval(x,fXY,0);\n   } else {\n      return fF2->Eval(fXY,x,0);\n   }\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Evaluate this function at point x[0]\n\/\/\/\n\/\/\/ x[0] is the value along X if fCase =0, the value along Y if fCase=1\n\/\/\/ if params is non null, the array will be used instead of the internal TF2\n\/\/\/ parameters\n\nDouble_t TF12::EvalPar(const Double_t *x, const Double_t *params)\n{\n   if (!fF2) return 0;\n   Double_t xx[2];\n   if (fCase == 0) {\n      xx[0] = x[0];\n      xx[1] = fXY;\n   } else {\n      xx[0] = fXY;\n      xx[1] = x[0];\n   }\n   fF2->InitArgs(xx,params);\n   return fF2->EvalPar(xx,params);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Save primitive as a C++ statement(s) on output stream out\n\nvoid TF12::SavePrimitive(std::ostream & \/*out*\/, Option_t * \/*option*\/ \/*= \"\"*\/)\n{\n   Error(\"SavePrimitive\",\"Function not yet implemented\");\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Set the value of the constant for the TF2\n\/\/\/\n\/\/\/   constant in X when projecting along Y\n\/\/\/   constant in Y when projecting along X\n\/\/\/  The function title is set to include the value of the constant\n\/\/\/  The current pad is updated\n\nvoid TF12::SetXY(Double_t xy)\n{\n   fXY = xy;\n   if (!fF2) return;\n   if (fCase == 0) SetTitle(Form(\"%s (y=%g)\",fF2->GetTitle(),xy));\n   else            SetTitle(Form(\"%s (x=%g)\",fF2->GetTitle(),xy));\n   if (fHistogram) fHistogram->SetTitle(GetTitle());\n   if (gPad) gPad->Modified();\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Fix MSVC build<commit_after><|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 *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: CollectionView.cxx,v $\n *\n *  $Revision: 1.5 $\n *\n *  last change: $Author: hr $ $Date: 2006-06-20 03:01:31 $\n *\n *  The Contents of this file are made available subject to\n *  the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n *    GNU Lesser General Public License Version 2.1\n *    =============================================\n *    Copyright 2005 by Sun Microsystems, Inc.\n *    901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *    This library is free software; you can redistribute it and\/or\n *    modify it under the terms of the GNU Lesser General Public\n *    License version 2.1, as published by the Free Software Foundation.\n *\n *    This library is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *    Lesser General Public License for more details.\n *\n *    You should have received a copy of the GNU Lesser General Public\n *    License along with this library; if not, write to the Free Software\n *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *    MA  02111-1307  USA\n *\n ************************************************************************\/\n#ifndef DBAUI_COLLECTIONVIEW_HXX\n#include \"CollectionView.hxx\"\n#endif\n#ifndef DBAUI_COLLECTIONVIEW_HRC\n#include \"CollectionView.hrc\"\n#endif\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n#ifndef _DBAUI_MODULE_DBU_HXX_\n#include \"moduledbu.hxx\"\n#endif\n#ifndef _DBU_DLG_HRC_\n#include \"dbu_dlg.hrc\"\n#endif\n#ifndef _COMPHELPER_INTERACTION_HXX_\n#include <comphelper\/interaction.hxx>\n#endif\n#ifndef _TOOLKIT_HELPER_VCLUNOHELPER_HXX_\n#include <toolkit\/helper\/vclunohelper.hxx>\n#endif\n#ifndef SVT_QUERYFOLDER_HXX\n#include <svtools\/QueryFolderName.hxx>\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_XINITIALIZATION_HPP_\n#include <com\/sun\/star\/lang\/XInitialization.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XCHILD_HPP_\n#include <com\/sun\/star\/container\/XChild.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_BEANS_PROPERTYVALUE_HPP_\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#endif\n#ifndef _SV_MSGBOX_HXX\n#include <vcl\/msgbox.hxx>\n#endif\n#ifndef DBACCESS_SHARED_DBUSTRINGS_HRC\n#include \"dbustrings.hrc\"\n#endif\n#ifndef DBAUI_TOOLS_HXX\n#include \"UITools.hxx\"\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XHIERARCHICALNAMECONTAINER_HPP_\n#include <com\/sun\/star\/container\/XHierarchicalNameContainer.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UCB_INTERACTIVEAUGMENTEDIOEXCEPTION_HPP_\n#include <com\/sun\/star\/ucb\/InteractiveAugmentedIOException.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UCB_IOERRORCODE_HPP_\n#include <com\/sun\/star\/ucb\/IOErrorCode.hpp>\n#endif\n#ifndef _COM_SUN_STAR_TASK_XINTERACTIONHANDLER_HPP_\n#include <com\/sun\/star\/task\/XInteractionHandler.hpp>\n#endif\n#ifndef _COM_SUN_STAR_TASK_INTERACTIONCLASSIFICATION_HPP_\n#include <com\/sun\/star\/task\/InteractionClassification.hpp>\n#endif\n#ifndef _COM_SUN_STAR_AWT_XWINDOW_HPP_\n#include <com\/sun\/star\/awt\/XWindow.hpp>\n#endif\n#ifndef INCLUDED_SVTOOLS_VIEWOPTIONS_HXX\n#include <svtools\/viewoptions.hxx>\n#endif\n#ifndef _OSL_THREAD_H_\n#include <osl\/thread.h>\n#endif\n\n#define FILEDIALOG_DEF_IMAGEBORDER  10\n\/\/.........................................................................\nnamespace dbaui\n{\n\/\/.........................................................................\n\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::ucb;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::beans;\nusing namespace ::com::sun::star::container;\nusing namespace ::com::sun::star::ucb;\nusing namespace ::com::sun::star::task;\nusing namespace comphelper;\n\/\/ -----------------------------------------------------------------------------\nDBG_NAME(OCollectionView)\nOCollectionView::OCollectionView( Window * pParent\n                                 ,const Reference< XContent>& _xContent\n                                 ,const ::rtl::OUString& _sDefaultName\n                                 ,const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _xORB)\n    : ModalDialog( pParent, ModuleRes(DLG_COLLECTION_VIEW))\n    , m_aFTCurrentPath( this, ResId( FT_EXPLORERFILE_CURRENTPATH ) )\n    , m_aNewFolder(     this, ResId( BTN_EXPLORERFILE_NEWFOLDER ) )\n    , m_aUp(            this, ResId( BTN_EXPLORERFILE_UP ) )\n    , m_aView(          this, ResId( CTRL_VIEW ) ,FILEVIEW_SHOW_TITLE )\n    , m_aFTName(        this, ResId( FT_EXPLORERFILE_FILENAME ) )\n    , m_aName(          this, ResId( ED_EXPLORERFILE_FILENAME ) )\n    , m_aFL(            this, ResId( FL_1 ) )\n    , m_aPB_OK(         this, ResId( BTN_EXPLORERFILE_SAVE ) )\n    , m_aPB_CANCEL(     this, ResId( PB_CANCEL ) )\n    , m_aPB_HELP(       this, ResId( PB_HELP ) )\n    , m_sPath(          ResId( STR_PATHNAME ) )\n    , m_xContent(_xContent)\n    , m_xORB(_xORB)\n    , m_bCreateForm(sal_True)\n{\n    DBG_CTOR(OCollectionView,NULL);\n    FreeResource();\n\n    OSL_ENSURE(m_xContent.is(),\"No valid content!\");\n    m_aView.Initialize(m_xContent,String());\n    m_aFTCurrentPath.SetStyle( m_aFTCurrentPath.GetStyle() | WB_PATHELLIPSIS );\n    initCurrentPath();\n\n    m_aName.SetText(_sDefaultName);\n    m_aName.GrabFocus();\n\n    m_aNewFolder.SetStyle( m_aNewFolder.GetStyle() | WB_NOPOINTERFOCUS );\n    m_aUp.SetModeImage(ModuleRes(IMG_NAVIGATION_BTN_UP_SC));\n    m_aUp.SetModeImage(ModuleRes(IMG_NAVIGATION_BTN_UP_SCH),BMP_COLOR_HIGHCONTRAST);\n    m_aNewFolder.SetModeImage(ModuleRes(IMG_NAVIGATION_CREATEFOLDER_SC));\n    m_aNewFolder.SetModeImage(ModuleRes(IMG_NAVIGATION_CREATEFOLDER_SCH),BMP_COLOR_HIGHCONTRAST);\n\n    m_aView.SetDoubleClickHdl( LINK( this, OCollectionView, Dbl_Click_FileView ) );\n    m_aView.EnableAutoResize();\n    m_aUp.SetClickHdl( LINK( this, OCollectionView, Up_Click ) );\n    m_aNewFolder.SetClickHdl( LINK( this, OCollectionView, NewFolder_Click ) );\n    m_aPB_OK.SetClickHdl( LINK( this, OCollectionView, Save_Click ) );\n}\n\/\/ -----------------------------------------------------------------------------\nOCollectionView::~OCollectionView( )\n{\n    DBG_DTOR(OCollectionView,NULL);\n}\n\/\/ -----------------------------------------------------------------------------\nReference< XContent> OCollectionView::getSelectedFolder() const\n{\n    return m_xContent;\n}\n\/\/ -----------------------------------------------------------------------------\nIMPL_LINK( OCollectionView, Save_Click, PushButton*, EMPTYARG )\n{\n    ::rtl::OUString sName = m_aName.GetText();\n    if ( !sName.getLength() )\n        return 0;\n    try\n    {\n        ::rtl::OUString sSubFolder = m_aView.GetCurrentURL();\n        sal_Int32 nIndex = sName.lastIndexOf('\/') + 1;\n        if ( nIndex )\n        {\n            if ( nIndex == 1 ) \/\/ special handling for root\n            {\n                Reference<XChild> xChild(m_xContent,UNO_QUERY);\n                Reference<XNameAccess> xNameAccess(xChild,UNO_QUERY);\n                while( xNameAccess.is() )\n                {\n                    xNameAccess.set(xChild->getParent(),UNO_QUERY);\n                    if ( xNameAccess.is() )\n                    {\n                        m_xContent.set(xNameAccess,UNO_QUERY);\n                        xChild.set(m_xContent,UNO_QUERY);\n                    }\n                }\n                m_aView.Initialize(m_xContent,String());\n                initCurrentPath();\n            }\n            sSubFolder = sName.copy(0,nIndex-1);\n            sName = sName.copy(nIndex);\n            Reference<XHierarchicalNameContainer> xHier(m_xContent,UNO_QUERY);\n            OSL_ENSURE(xHier.is(),\"XHierarchicalNameContainer not supported!\");\n            if ( sSubFolder.getLength() && xHier.is() )\n            {\n                if ( xHier->hasByHierarchicalName(sSubFolder) )\n                {\n                    m_xContent.set(xHier->getByHierarchicalName(sSubFolder),UNO_QUERY);\n                }\n                else \/\/ sub folder doesn't exist\n                {\n                    Sequence< Any > aValues(2);\n                    PropertyValue aValue;\n                    aValue.Name = ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"ResourceName\"));\n                    aValue.Value <<= sSubFolder;\n                    aValues[0] <<= aValue;\n\n                    aValue.Name = ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"ResourceType\"));\n                    aValue.Value <<= ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"folder\"));\n                    aValues[1] <<= aValue;\n\n                    InteractionClassification eClass = InteractionClassification_ERROR;\n                    ::com::sun::star::ucb::IOErrorCode eError = IOErrorCode_NOT_EXISTING_PATH;\n                    ::rtl::OUString sTemp;\n                    InteractiveAugmentedIOException aException(sTemp,Reference<XInterface>(),eClass,eError,aValues);\n\n\n                    Reference<XInitialization> xIni(m_xORB->createInstance(::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"com.sun.star.task.InteractionHandler\"))),UNO_QUERY);\n                    if ( xIni.is() )\n                    {\n                        aValue.Name = ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"Parent\"));\n                        aValue.Value <<= VCLUnoHelper::GetInterface( this );\n                        Sequence< Any > aArgs(1);\n                        aArgs[0] <<= makeAny(aValue);\n                        xIni->initialize(aArgs);\n                        OInteractionRequest* pRequest = new OInteractionRequest(makeAny(aException));\n                        Reference< XInteractionRequest > xRequest(pRequest);\n\n                        OInteractionApprove* pApprove = new OInteractionApprove;\n                        pRequest->addContinuation(pApprove);\n\n                        Reference< XInteractionHandler > xHandler(xIni,UNO_QUERY);\n                        xHandler->handle(xRequest);\n                    }\n                    return 0;\n                }\n            }\n        }\n        Reference<XNameContainer> xNameContainer(m_xContent,UNO_QUERY);\n        if ( xNameContainer.is() )\n        {\n            Reference< XContent> xContent;\n            if ( xNameContainer->hasByName(sName) )\n            {\n                QueryBox aBox( this, WB_YES_NO, ModuleRes( STR_ALREADYEXISTOVERWRITE ) );\n                if ( aBox.Execute() != RET_YES )\n                    return 0;\n                xNameContainer->removeByName(sName);\n            }\n            m_aName.SetText(sName);\n            EndDialog( TRUE );\n        }\n    }\n    catch(Exception)\n    {\n        OSL_ENSURE(0,\"Exception caught!\");\n    }\n    return 0;\n}\n\/\/ -----------------------------------------------------------------------------\nIMPL_LINK( OCollectionView, NewFolder_Click, PushButton*, EMPTYARG )\n{\n    try\n    {\n        Reference<XHierarchicalNameContainer> xNameContainer(m_xContent,UNO_QUERY);\n        if ( dbaui::insertHierachyElement(this,xNameContainer,String(),m_bCreateForm) )\n            m_aView.Initialize(m_xContent,String());\n    }\n    catch(Exception)\n    {\n        OSL_ENSURE(0,\"Exception caught!\");\n    }\n    return 0;\n}\n\/\/ -----------------------------------------------------------------------------\nIMPL_LINK( OCollectionView, Up_Click, PushButton*, EMPTYARG )\n{\n    try\n    {\n        Reference<XChild> xChild(m_xContent,UNO_QUERY);\n        if ( xChild.is() )\n        {\n            Reference<XNameAccess> xNameAccess(xChild->getParent(),UNO_QUERY);\n            if ( xNameAccess.is() )\n            {\n                m_xContent.set(xNameAccess,UNO_QUERY);\n                m_aView.Initialize(m_xContent,String());\n                initCurrentPath();\n            }\n            else\n                m_aUp.Disable();\n        }\n    }\n    catch(Exception)\n    {\n        OSL_ENSURE(0,\"Exception caught!\");\n    }\n    return 0;\n}\n\/\/ -----------------------------------------------------------------------------\nIMPL_LINK( OCollectionView, Dbl_Click_FileView, SvtFileView*, EMPTYARG )\n{\n    try\n    {\n        Reference<XNameAccess> xNameAccess(m_xContent,UNO_QUERY);\n        if ( xNameAccess.is() )\n        {\n            ::rtl::OUString sSubFolder = m_aView.GetCurrentURL();\n            sal_Int32 nIndex = sSubFolder.lastIndexOf('\/') + 1;\n            sSubFolder = sSubFolder.getToken(0,'\/',nIndex);\n            if ( sSubFolder.getLength() )\n            {\n                Reference< XContent> xContent;\n                if ( xNameAccess->hasByName(sSubFolder) )\n                    xContent.set(xNameAccess->getByName(sSubFolder),UNO_QUERY);\n                if ( xContent.is() )\n                {\n                    m_xContent = xContent;\n                    m_aView.Initialize(m_xContent,String());\n                    initCurrentPath();\n                }\n            }\n        }\n    }\n    catch(Exception)\n    {\n        OSL_ENSURE(0,\"Exception caught!\");\n    }\n    return 0;\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OCollectionView::initCurrentPath()\n{\n    BOOL bEnable = FALSE;\n    try\n    {\n        if ( m_xContent.is() )\n        {\n            ::rtl::OUString sCID = m_xContent->getIdentifier()->getContentIdentifier();\n            const static ::rtl::OUString sFormsCID(RTL_CONSTASCII_USTRINGPARAM(\"private:forms\"));\n            m_bCreateForm = sFormsCID.compareTo(sCID) == 0;\n            m_aFTCurrentPath.SetText(sCID.copy(8));\n            Reference<XChild> xChild(m_xContent,UNO_QUERY);\n            bEnable = xChild.is() && Reference<XNameAccess>(xChild->getParent(),UNO_QUERY).is();\n        }\n    }\n    catch(Exception)\n    {\n        OSL_ENSURE(0,\"Exception caught!\");\n    }\n    m_aUp.Enable(bEnable);\n}\n\/\/ -----------------------------------------------------------------------------\n::rtl::OUString OCollectionView::getName() const\n{\n    return m_aName.GetText();\n}\n\/\/ -----------------------------------------------------------------------------\n\/\/.........................................................................\n}   \/\/ namespace dbaui\n\/\/.........................................................................\n\n\n<commit_msg>INTEGRATION: CWS qiq (1.4.124); FILE MERGED 2006\/06\/27 12:22:06 fs 1.4.124.2: RESYNC: (1.4-1.5); FILE MERGED 2006\/05\/17 11:44:41 fs 1.4.124.1: ::dbaui::insertHierarchyElement needs an ORB now<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: CollectionView.cxx,v $\n *\n *  $Revision: 1.6 $\n *\n *  last change: $Author: obo $ $Date: 2006-07-10 15:25: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#ifndef DBAUI_COLLECTIONVIEW_HXX\n#include \"CollectionView.hxx\"\n#endif\n#ifndef DBAUI_COLLECTIONVIEW_HRC\n#include \"CollectionView.hrc\"\n#endif\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n#ifndef _DBAUI_MODULE_DBU_HXX_\n#include \"moduledbu.hxx\"\n#endif\n#ifndef _DBU_DLG_HRC_\n#include \"dbu_dlg.hrc\"\n#endif\n#ifndef _COMPHELPER_INTERACTION_HXX_\n#include <comphelper\/interaction.hxx>\n#endif\n#ifndef _TOOLKIT_HELPER_VCLUNOHELPER_HXX_\n#include <toolkit\/helper\/vclunohelper.hxx>\n#endif\n#ifndef SVT_QUERYFOLDER_HXX\n#include <svtools\/QueryFolderName.hxx>\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_XINITIALIZATION_HPP_\n#include <com\/sun\/star\/lang\/XInitialization.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XCHILD_HPP_\n#include <com\/sun\/star\/container\/XChild.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_BEANS_PROPERTYVALUE_HPP_\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#endif\n#ifndef _SV_MSGBOX_HXX\n#include <vcl\/msgbox.hxx>\n#endif\n#ifndef DBACCESS_SHARED_DBUSTRINGS_HRC\n#include \"dbustrings.hrc\"\n#endif\n#ifndef DBAUI_TOOLS_HXX\n#include \"UITools.hxx\"\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XHIERARCHICALNAMECONTAINER_HPP_\n#include <com\/sun\/star\/container\/XHierarchicalNameContainer.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UCB_INTERACTIVEAUGMENTEDIOEXCEPTION_HPP_\n#include <com\/sun\/star\/ucb\/InteractiveAugmentedIOException.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UCB_IOERRORCODE_HPP_\n#include <com\/sun\/star\/ucb\/IOErrorCode.hpp>\n#endif\n#ifndef _COM_SUN_STAR_TASK_XINTERACTIONHANDLER_HPP_\n#include <com\/sun\/star\/task\/XInteractionHandler.hpp>\n#endif\n#ifndef _COM_SUN_STAR_TASK_INTERACTIONCLASSIFICATION_HPP_\n#include <com\/sun\/star\/task\/InteractionClassification.hpp>\n#endif\n#ifndef _COM_SUN_STAR_AWT_XWINDOW_HPP_\n#include <com\/sun\/star\/awt\/XWindow.hpp>\n#endif\n#ifndef INCLUDED_SVTOOLS_VIEWOPTIONS_HXX\n#include <svtools\/viewoptions.hxx>\n#endif\n#ifndef _OSL_THREAD_H_\n#include <osl\/thread.h>\n#endif\n\n#define FILEDIALOG_DEF_IMAGEBORDER  10\n\/\/.........................................................................\nnamespace dbaui\n{\n\/\/.........................................................................\n\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::ucb;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::beans;\nusing namespace ::com::sun::star::container;\nusing namespace ::com::sun::star::ucb;\nusing namespace ::com::sun::star::task;\nusing namespace comphelper;\n\/\/ -----------------------------------------------------------------------------\nDBG_NAME(OCollectionView)\nOCollectionView::OCollectionView( Window * pParent\n                                 ,const Reference< XContent>& _xContent\n                                 ,const ::rtl::OUString& _sDefaultName\n                                 ,const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _xORB)\n    : ModalDialog( pParent, ModuleRes(DLG_COLLECTION_VIEW))\n    , m_aFTCurrentPath( this, ResId( FT_EXPLORERFILE_CURRENTPATH ) )\n    , m_aNewFolder(     this, ResId( BTN_EXPLORERFILE_NEWFOLDER ) )\n    , m_aUp(            this, ResId( BTN_EXPLORERFILE_UP ) )\n    , m_aView(          this, ResId( CTRL_VIEW ) ,FILEVIEW_SHOW_TITLE )\n    , m_aFTName(        this, ResId( FT_EXPLORERFILE_FILENAME ) )\n    , m_aName(          this, ResId( ED_EXPLORERFILE_FILENAME ) )\n    , m_aFL(            this, ResId( FL_1 ) )\n    , m_aPB_OK(         this, ResId( BTN_EXPLORERFILE_SAVE ) )\n    , m_aPB_CANCEL(     this, ResId( PB_CANCEL ) )\n    , m_aPB_HELP(       this, ResId( PB_HELP ) )\n    , m_sPath(          ResId( STR_PATHNAME ) )\n    , m_xContent(_xContent)\n    , m_xORB(_xORB)\n    , m_bCreateForm(sal_True)\n{\n    DBG_CTOR(OCollectionView,NULL);\n    FreeResource();\n\n    OSL_ENSURE(m_xContent.is(),\"No valid content!\");\n    m_aView.Initialize(m_xContent,String());\n    m_aFTCurrentPath.SetStyle( m_aFTCurrentPath.GetStyle() | WB_PATHELLIPSIS );\n    initCurrentPath();\n\n    m_aName.SetText(_sDefaultName);\n    m_aName.GrabFocus();\n\n    m_aNewFolder.SetStyle( m_aNewFolder.GetStyle() | WB_NOPOINTERFOCUS );\n    m_aUp.SetModeImage(ModuleRes(IMG_NAVIGATION_BTN_UP_SC));\n    m_aUp.SetModeImage(ModuleRes(IMG_NAVIGATION_BTN_UP_SCH),BMP_COLOR_HIGHCONTRAST);\n    m_aNewFolder.SetModeImage(ModuleRes(IMG_NAVIGATION_CREATEFOLDER_SC));\n    m_aNewFolder.SetModeImage(ModuleRes(IMG_NAVIGATION_CREATEFOLDER_SCH),BMP_COLOR_HIGHCONTRAST);\n\n    m_aView.SetDoubleClickHdl( LINK( this, OCollectionView, Dbl_Click_FileView ) );\n    m_aView.EnableAutoResize();\n    m_aUp.SetClickHdl( LINK( this, OCollectionView, Up_Click ) );\n    m_aNewFolder.SetClickHdl( LINK( this, OCollectionView, NewFolder_Click ) );\n    m_aPB_OK.SetClickHdl( LINK( this, OCollectionView, Save_Click ) );\n}\n\/\/ -----------------------------------------------------------------------------\nOCollectionView::~OCollectionView( )\n{\n    DBG_DTOR(OCollectionView,NULL);\n}\n\/\/ -----------------------------------------------------------------------------\nReference< XContent> OCollectionView::getSelectedFolder() const\n{\n    return m_xContent;\n}\n\/\/ -----------------------------------------------------------------------------\nIMPL_LINK( OCollectionView, Save_Click, PushButton*, EMPTYARG )\n{\n    ::rtl::OUString sName = m_aName.GetText();\n    if ( !sName.getLength() )\n        return 0;\n    try\n    {\n        ::rtl::OUString sSubFolder = m_aView.GetCurrentURL();\n        sal_Int32 nIndex = sName.lastIndexOf('\/') + 1;\n        if ( nIndex )\n        {\n            if ( nIndex == 1 ) \/\/ special handling for root\n            {\n                Reference<XChild> xChild(m_xContent,UNO_QUERY);\n                Reference<XNameAccess> xNameAccess(xChild,UNO_QUERY);\n                while( xNameAccess.is() )\n                {\n                    xNameAccess.set(xChild->getParent(),UNO_QUERY);\n                    if ( xNameAccess.is() )\n                    {\n                        m_xContent.set(xNameAccess,UNO_QUERY);\n                        xChild.set(m_xContent,UNO_QUERY);\n                    }\n                }\n                m_aView.Initialize(m_xContent,String());\n                initCurrentPath();\n            }\n            sSubFolder = sName.copy(0,nIndex-1);\n            sName = sName.copy(nIndex);\n            Reference<XHierarchicalNameContainer> xHier(m_xContent,UNO_QUERY);\n            OSL_ENSURE(xHier.is(),\"XHierarchicalNameContainer not supported!\");\n            if ( sSubFolder.getLength() && xHier.is() )\n            {\n                if ( xHier->hasByHierarchicalName(sSubFolder) )\n                {\n                    m_xContent.set(xHier->getByHierarchicalName(sSubFolder),UNO_QUERY);\n                }\n                else \/\/ sub folder doesn't exist\n                {\n                    Sequence< Any > aValues(2);\n                    PropertyValue aValue;\n                    aValue.Name = ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"ResourceName\"));\n                    aValue.Value <<= sSubFolder;\n                    aValues[0] <<= aValue;\n\n                    aValue.Name = ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"ResourceType\"));\n                    aValue.Value <<= ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"folder\"));\n                    aValues[1] <<= aValue;\n\n                    InteractionClassification eClass = InteractionClassification_ERROR;\n                    ::com::sun::star::ucb::IOErrorCode eError = IOErrorCode_NOT_EXISTING_PATH;\n                    ::rtl::OUString sTemp;\n                    InteractiveAugmentedIOException aException(sTemp,Reference<XInterface>(),eClass,eError,aValues);\n\n\n                    Reference<XInitialization> xIni(m_xORB->createInstance(::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"com.sun.star.task.InteractionHandler\"))),UNO_QUERY);\n                    if ( xIni.is() )\n                    {\n                        aValue.Name = ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"Parent\"));\n                        aValue.Value <<= VCLUnoHelper::GetInterface( this );\n                        Sequence< Any > aArgs(1);\n                        aArgs[0] <<= makeAny(aValue);\n                        xIni->initialize(aArgs);\n                        OInteractionRequest* pRequest = new OInteractionRequest(makeAny(aException));\n                        Reference< XInteractionRequest > xRequest(pRequest);\n\n                        OInteractionApprove* pApprove = new OInteractionApprove;\n                        pRequest->addContinuation(pApprove);\n\n                        Reference< XInteractionHandler > xHandler(xIni,UNO_QUERY);\n                        xHandler->handle(xRequest);\n                    }\n                    return 0;\n                }\n            }\n        }\n        Reference<XNameContainer> xNameContainer(m_xContent,UNO_QUERY);\n        if ( xNameContainer.is() )\n        {\n            Reference< XContent> xContent;\n            if ( xNameContainer->hasByName(sName) )\n            {\n                QueryBox aBox( this, WB_YES_NO, ModuleRes( STR_ALREADYEXISTOVERWRITE ) );\n                if ( aBox.Execute() != RET_YES )\n                    return 0;\n                xNameContainer->removeByName(sName);\n            }\n            m_aName.SetText(sName);\n            EndDialog( TRUE );\n        }\n    }\n    catch(Exception)\n    {\n        OSL_ENSURE(0,\"Exception caught!\");\n    }\n    return 0;\n}\n\/\/ -----------------------------------------------------------------------------\nIMPL_LINK( OCollectionView, NewFolder_Click, PushButton*, EMPTYARG )\n{\n    try\n    {\n        Reference<XHierarchicalNameContainer> xNameContainer(m_xContent,UNO_QUERY);\n        if ( dbaui::insertHierachyElement(this,m_xORB,xNameContainer,String(),m_bCreateForm) )\n            m_aView.Initialize(m_xContent,String());\n    }\n    catch(Exception)\n    {\n        OSL_ENSURE(0,\"Exception caught!\");\n    }\n    return 0;\n}\n\/\/ -----------------------------------------------------------------------------\nIMPL_LINK( OCollectionView, Up_Click, PushButton*, EMPTYARG )\n{\n    try\n    {\n        Reference<XChild> xChild(m_xContent,UNO_QUERY);\n        if ( xChild.is() )\n        {\n            Reference<XNameAccess> xNameAccess(xChild->getParent(),UNO_QUERY);\n            if ( xNameAccess.is() )\n            {\n                m_xContent.set(xNameAccess,UNO_QUERY);\n                m_aView.Initialize(m_xContent,String());\n                initCurrentPath();\n            }\n            else\n                m_aUp.Disable();\n        }\n    }\n    catch(Exception)\n    {\n        OSL_ENSURE(0,\"Exception caught!\");\n    }\n    return 0;\n}\n\/\/ -----------------------------------------------------------------------------\nIMPL_LINK( OCollectionView, Dbl_Click_FileView, SvtFileView*, EMPTYARG )\n{\n    try\n    {\n        Reference<XNameAccess> xNameAccess(m_xContent,UNO_QUERY);\n        if ( xNameAccess.is() )\n        {\n            ::rtl::OUString sSubFolder = m_aView.GetCurrentURL();\n            sal_Int32 nIndex = sSubFolder.lastIndexOf('\/') + 1;\n            sSubFolder = sSubFolder.getToken(0,'\/',nIndex);\n            if ( sSubFolder.getLength() )\n            {\n                Reference< XContent> xContent;\n                if ( xNameAccess->hasByName(sSubFolder) )\n                    xContent.set(xNameAccess->getByName(sSubFolder),UNO_QUERY);\n                if ( xContent.is() )\n                {\n                    m_xContent = xContent;\n                    m_aView.Initialize(m_xContent,String());\n                    initCurrentPath();\n                }\n            }\n        }\n    }\n    catch(Exception)\n    {\n        OSL_ENSURE(0,\"Exception caught!\");\n    }\n    return 0;\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OCollectionView::initCurrentPath()\n{\n    BOOL bEnable = FALSE;\n    try\n    {\n        if ( m_xContent.is() )\n        {\n            ::rtl::OUString sCID = m_xContent->getIdentifier()->getContentIdentifier();\n            const static ::rtl::OUString sFormsCID(RTL_CONSTASCII_USTRINGPARAM(\"private:forms\"));\n            m_bCreateForm = sFormsCID.compareTo(sCID) == 0;\n            m_aFTCurrentPath.SetText(sCID.copy(8));\n            Reference<XChild> xChild(m_xContent,UNO_QUERY);\n            bEnable = xChild.is() && Reference<XNameAccess>(xChild->getParent(),UNO_QUERY).is();\n        }\n    }\n    catch(Exception)\n    {\n        OSL_ENSURE(0,\"Exception caught!\");\n    }\n    m_aUp.Enable(bEnable);\n}\n\/\/ -----------------------------------------------------------------------------\n::rtl::OUString OCollectionView::getName() const\n{\n    return m_aName.GetText();\n}\n\/\/ -----------------------------------------------------------------------------\n\/\/.........................................................................\n}   \/\/ namespace dbaui\n\/\/.........................................................................\n\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: JoinController.hxx,v $\n *\n *  $Revision: 1.17 $\n *\n *  last change: $Author: rt $ $Date: 2004-09-09 09:43: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#ifndef DBAUI_JOINCONTROLLER_HXX\n#define DBAUI_JOINCONTROLLER_HXX\n\n#ifndef DBAUI_SINGLEDOCCONTROLLER_HXX\n#include \"singledoccontroller.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_IO_XOBJECTOUTPUTSTREAM_HPP_\n#include <com\/sun\/star\/io\/XObjectOutputStream.hpp>\n#endif\n#ifndef _COM_SUN_STAR_IO_XOBJECTINPUTSTREAM_HPP_\n#include <com\/sun\/star\/io\/XObjectInputStream.hpp>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_XPROPERTYSET_HPP_\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#endif\n#ifndef DBAUI_JOINTABLEVIEW_HXX\n#include \"JoinTableView.hxx\"\n#endif\n#ifndef DBAUI_JOINDESIGNVIEW_HXX\n#include \"JoinDesignView.hxx\"\n#endif\n#ifndef _MEMORY_\n#include <memory>\n#endif\n\nclass VCLXWindow;\nnamespace dbaui\n{\n    class OTableConnectionData;\n    class OTableWindowData;\n    class OAddTableDlg;\n    class OTableWindow;\n    typedef OSingleDocumentController OJoinController_BASE;\n    class OJoinController : public OJoinController_BASE\n    {\n    protected:\n        ::std::vector<OTableConnectionData*>    m_vTableConnectionData;\n        ::std::vector<OTableWindowData*>        m_vTableData;\n\n        Fraction                                m_aZoom;\n        ::dbtools::SQLExceptionInfo             m_aExceptionInfo;\n\n        OAddTableDlg*   m_pAddTabDlg;       \/\/ is set by the first call of execute, the owner is the design view\n\n        sal_Bool        m_bViewsAllowed;    \/\/ true when the Add Table dialog should also show views\n\n        \/\/ state of a feature. 'feature' may be the handle of a ::com::sun::star::util::URL somebody requested a dispatch interface for OR a toolbar slot.\n        virtual FeatureState    GetState(sal_uInt16 nId) const;\n        \/\/ execute a feature\n        virtual void            Execute(sal_uInt16 nId, const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue>& aArgs);\n\n        \/** loads the information for the windows.\n            @param  _aViewProps\n                The properties which comes from the layout information.\n        *\/\n        void loadTableWindows(const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue>& _aViewProps);\n\n        \/** loads the information for one window.\n            @param  _rTable\n                The properties which comes from the layout information.\n        *\/\n        void loadTableWindow(const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue>& _rTable);\n\n        \/** saves the TableWindows structure in a sequence of property values\n            @param  _rViewProps\n                Contains the new sequence.\n        *\/\n        void saveTableWindows(::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue>& _rViewProps);\n\n        virtual ~OJoinController();\n    public:\n        OJoinController(const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rM);\n\n        virtual void setModified(sal_Bool _bModified=sal_True);\n\n        \/** erase the data in the data vector\n            @param  _pData\n                    the data whioch should be erased\n        *\/\n        void removeConnectionData(OTableConnectionData* _pData);\n\n        ::std::vector< OTableWindowData*>*      getTableWindowData()        { return &m_vTableData; }\n        ::std::vector< OTableConnectionData*>*  getTableConnectionData()    { return &m_vTableConnectionData;}\n\n        void SaveTabWinsPosSize( OJoinTableView::OTableWindowMap* pTabWinList, long nOffsetX, long nOffsetY );\n\n        \/\/ should the statement be parsed by our own sql parser\n        inline sal_Bool     isViewAllowed()         const { return m_bViewsAllowed; }\n\n        void            SaveTabWinPosSize(OTableWindow* pTabWin, long nOffsetX, long nOffsetY);\n\n        \/\/ XEventListener\n        virtual void SAL_CALL disposing( const ::com::sun::star::lang::EventObject& Source ) throw(::com::sun::star::uno::RuntimeException);\n\n        \/\/ ::com::sun::star::lang::XComponent\n        virtual void    SAL_CALL disposing();\n        \/\/ ::com::sun::star::frame::XController\n        virtual sal_Bool SAL_CALL suspend(sal_Bool bSuspend) throw( ::com::sun::star::uno::RuntimeException );\n\n\n        \/**\n            only defines a method to save a SQLException in d&d methods to show the error at a later state\n            set the internal member m_aExceptionInfo to _rInfo\n        *\/\n        void setErrorOccured(const ::dbtools::SQLExceptionInfo& _rInfo)\n        {\n            m_aExceptionInfo = _rInfo;\n        }\n        \/**\n            just returns the internal member and clears it\n        *\/\n        ::dbtools::SQLExceptionInfo clearOccuredError()\n        {\n            ::dbtools::SQLExceptionInfo aInfo = m_aExceptionInfo;\n            m_aExceptionInfo = ::dbtools::SQLExceptionInfo();\n            return aInfo;\n        }\n    protected:\n        virtual OTableWindowData* createTableWindowData() = 0;\n        \/\/ ask the user if the design should be saved when it is modified\n        virtual short saveModified() = 0;\n        \/\/ called when the orignal state should be reseted (first time load)\n        virtual void reset()         = 0;\n        virtual void AddSupportedFeatures();\n\n        virtual OJoinDesignView*    getJoinView();\n    };\n}\n#endif \/\/ DBAUI_JOINCONTROLLER_HXX\n\n<commit_msg>INTEGRATION: CWS docking4 (1.17.8); FILE MERGED 2004\/09\/30 11:04:49 fs 1.17.8.1: #i33338# AddSupportedFeatures -> describeSupportedFeatures<commit_after>\/*************************************************************************\n *\n *  $RCSfile: JoinController.hxx,v $\n *\n *  $Revision: 1.18 $\n *\n *  last change: $Author: obo $ $Date: 2004-11-16 14:31:13 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the License); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an AS IS basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef DBAUI_JOINCONTROLLER_HXX\n#define DBAUI_JOINCONTROLLER_HXX\n\n#ifndef DBAUI_SINGLEDOCCONTROLLER_HXX\n#include \"singledoccontroller.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_IO_XOBJECTOUTPUTSTREAM_HPP_\n#include <com\/sun\/star\/io\/XObjectOutputStream.hpp>\n#endif\n#ifndef _COM_SUN_STAR_IO_XOBJECTINPUTSTREAM_HPP_\n#include <com\/sun\/star\/io\/XObjectInputStream.hpp>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_XPROPERTYSET_HPP_\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#endif\n#ifndef DBAUI_JOINTABLEVIEW_HXX\n#include \"JoinTableView.hxx\"\n#endif\n#ifndef DBAUI_JOINDESIGNVIEW_HXX\n#include \"JoinDesignView.hxx\"\n#endif\n#ifndef _MEMORY_\n#include <memory>\n#endif\n\nclass VCLXWindow;\nnamespace dbaui\n{\n    class OTableConnectionData;\n    class OTableWindowData;\n    class OAddTableDlg;\n    class OTableWindow;\n    typedef OSingleDocumentController OJoinController_BASE;\n    class OJoinController : public OJoinController_BASE\n    {\n    protected:\n        ::std::vector<OTableConnectionData*>    m_vTableConnectionData;\n        ::std::vector<OTableWindowData*>        m_vTableData;\n\n        Fraction                                m_aZoom;\n        ::dbtools::SQLExceptionInfo             m_aExceptionInfo;\n\n        OAddTableDlg*   m_pAddTabDlg;       \/\/ is set by the first call of execute, the owner is the design view\n\n        sal_Bool        m_bViewsAllowed;    \/\/ true when the Add Table dialog should also show views\n\n        \/\/ state of a feature. 'feature' may be the handle of a ::com::sun::star::util::URL somebody requested a dispatch interface for OR a toolbar slot.\n        virtual FeatureState    GetState(sal_uInt16 nId) const;\n        \/\/ execute a feature\n        virtual void            Execute(sal_uInt16 nId, const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue>& aArgs);\n\n        \/** loads the information for the windows.\n            @param  _aViewProps\n                The properties which comes from the layout information.\n        *\/\n        void loadTableWindows(const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue>& _aViewProps);\n\n        \/** loads the information for one window.\n            @param  _rTable\n                The properties which comes from the layout information.\n        *\/\n        void loadTableWindow(const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue>& _rTable);\n\n        \/** saves the TableWindows structure in a sequence of property values\n            @param  _rViewProps\n                Contains the new sequence.\n        *\/\n        void saveTableWindows(::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue>& _rViewProps);\n\n        virtual ~OJoinController();\n    public:\n        OJoinController(const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rM);\n\n        virtual void setModified(sal_Bool _bModified=sal_True);\n\n        \/** erase the data in the data vector\n            @param  _pData\n                    the data whioch should be erased\n        *\/\n        void removeConnectionData(OTableConnectionData* _pData);\n\n        ::std::vector< OTableWindowData*>*      getTableWindowData()        { return &m_vTableData; }\n        ::std::vector< OTableConnectionData*>*  getTableConnectionData()    { return &m_vTableConnectionData;}\n\n        void SaveTabWinsPosSize( OJoinTableView::OTableWindowMap* pTabWinList, long nOffsetX, long nOffsetY );\n\n        \/\/ should the statement be parsed by our own sql parser\n        inline sal_Bool     isViewAllowed()         const { return m_bViewsAllowed; }\n\n        void            SaveTabWinPosSize(OTableWindow* pTabWin, long nOffsetX, long nOffsetY);\n\n        \/\/ XEventListener\n        virtual void SAL_CALL disposing( const ::com::sun::star::lang::EventObject& Source ) throw(::com::sun::star::uno::RuntimeException);\n\n        \/\/ ::com::sun::star::lang::XComponent\n        virtual void    SAL_CALL disposing();\n        \/\/ ::com::sun::star::frame::XController\n        virtual sal_Bool SAL_CALL suspend(sal_Bool bSuspend) throw( ::com::sun::star::uno::RuntimeException );\n\n\n        \/**\n            only defines a method to save a SQLException in d&d methods to show the error at a later state\n            set the internal member m_aExceptionInfo to _rInfo\n        *\/\n        void setErrorOccured(const ::dbtools::SQLExceptionInfo& _rInfo)\n        {\n            m_aExceptionInfo = _rInfo;\n        }\n        \/**\n            just returns the internal member and clears it\n        *\/\n        ::dbtools::SQLExceptionInfo clearOccuredError()\n        {\n            ::dbtools::SQLExceptionInfo aInfo = m_aExceptionInfo;\n            m_aExceptionInfo = ::dbtools::SQLExceptionInfo();\n            return aInfo;\n        }\n    protected:\n        virtual OTableWindowData* createTableWindowData() = 0;\n        \/\/ ask the user if the design should be saved when it is modified\n        virtual short saveModified() = 0;\n        \/\/ called when the orignal state should be reseted (first time load)\n        virtual void reset()         = 0;\n        virtual void describeSupportedFeatures();\n\n        virtual OJoinDesignView*    getJoinView();\n    };\n}\n#endif \/\/ DBAUI_JOINCONTROLLER_HXX\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"ofMain.h\"\n\nbool isDirectionKey(int key) {\n\treturn\n\tkey == OF_KEY_LEFT ||\n\tkey == OF_KEY_RIGHT ||\n\tkey == OF_KEY_UP ||\n\tkey == OF_KEY_DOWN;\n}\n\nofVec2f getDirectionFromKey(int key) {\n\tswitch(key) {\n\t\tcase OF_KEY_LEFT: return ofVec2f(-1, 0);\n\t\tcase OF_KEY_RIGHT: return ofVec2f(+1, 0);\n\t\tcase OF_KEY_UP: return ofVec2f(0, -1);\n\t\tcase OF_KEY_DOWN: return ofVec2f(0, +1);\n\t}\n\treturn ofVec2f(0, 0);\n}\n\nclass Draggable {\nprotected:\n\tofVec2f position;\n\t\n\tofVec2f mouseStart, positionStart;\n\tbool dragging, selected, command;\n\t\n\tvirtual bool isHit(ofVec2f v) = 0;\n\t\npublic:\n\tDraggable()\n\t:dragging(false)\n\t,selected(false)\n\t,command(false) {\n\t\t\n\t}\n\tvoid setPosition(ofVec2f position) {\n\t\tthis->position = position;\n\t}\n\tvoid mousePressed(ofMouseEventArgs& mouse) {\n\t\tif(mouse.button == OF_MOUSE_BUTTON_LEFT) {\n\t\t\tif(isHit(mouse)) {\n\t\t\t\tdragging = true;\n\t\t\t\tselected = true;\n\t\t\t\tmouseStart = mouse;\n\t\t\t\tpositionStart = position;\n\t\t\t} else {\n\t\t\t\tdragging = false;\n\t\t\t\tselected = false;\n\t\t\t}\n\t\t}\n\t}\n\tvoid mouseMoved(ofMouseEventArgs& mouse) {\n\t\tif(dragging) {\n\t\t\tofVec2f offset = mouse - mouseStart;\n\t\t\tposition = positionStart + offset;\n\t\t}\n\t}\n\tvoid mouseDragged(ofMouseEventArgs& mouse) {\n\t\tmouseMoved(mouse);\n\t}\n\tvoid mouseReleased(ofMouseEventArgs& mouse) {\n\t\tif(mouse.button == OF_MOUSE_BUTTON_LEFT) {\n\t\t\tdragging = false;\n\t\t}\n\t}\n\tvoid keyPressed(ofKeyEventArgs& key) {\n\t\tif(selected && isDirectionKey(key.key)) {\n\t\t\tfloat multiplier = command ? .25 : 1;\n\t\t\tposition += multiplier * getDirectionFromKey(key.key);\n\t\t}\n\t\tif(key.key == OF_KEY_COMMAND) {\n\t\t\tcommand = true;\n\t\t}\n\t}\n\tvoid keyReleased(ofKeyEventArgs& key) {\n\t\tif(key.key == OF_KEY_COMMAND) {\n\t\t\tcommand = false;\n\t\t}\n\t}\n\tvirtual void draw(ofEventArgs& args) = 0;\n\tvoid enableControlEvents() {\n\t\tofAddListener(ofEvents().keyPressed, this, &Draggable::keyPressed);\n\t\tofAddListener(ofEvents().keyReleased, this, &Draggable::keyReleased);\n\t\tofAddListener(ofEvents().mousePressed, this, &Draggable::mousePressed);\n\t\tofAddListener(ofEvents().mouseReleased, this, &Draggable::mouseReleased);\n\t\tofAddListener(ofEvents().mouseMoved, this, &Draggable::mouseMoved);\n\t\tofAddListener(ofEvents().mouseDragged, this, &Draggable::mouseDragged);\n\t}\n\tvoid disableControlEvents() {\n\t\tofRemoveListener(ofEvents().keyPressed, this, &Draggable::keyPressed);\n\t\tofRemoveListener(ofEvents().keyReleased, this, &Draggable::keyReleased);\n\t\tofRemoveListener(ofEvents().mousePressed, this, &Draggable::mousePressed);\n\t\tofRemoveListener(ofEvents().mouseReleased, this, &Draggable::mouseReleased);\n\t\tofRemoveListener(ofEvents().mouseMoved, this, &Draggable::mouseMoved);\n\t\tofRemoveListener(ofEvents().mouseDragged, this, &Draggable::mouseDragged);\n\t}\n\tvoid enableDrawEvent() {\n\t\tofAddListener(ofEvents().draw, this, &Draggable::draw);\n\t}\n\tvoid disableDrawEvent() {\n\t\tofRemoveListener(ofEvents().draw, this, &Draggable::draw);\n\t}\n};\n\nclass DraggableCircle : public Draggable {\nprotected:\n\tfloat clickRadiusSquared;\n\t\n\tbool isHit(ofVec2f v) {\n\t\tfloat dx = position.x - v.x, dy = position.y - v.y;\n\t\tfloat distanceSquared = dx * dx + dy * dy;\n\t\treturn distanceSquared < clickRadiusSquared;\n\t}\npublic:\n\tDraggableCircle()\n\t:clickRadiusSquared(100) {\n\t}\n\tvoid setClickRadius(float clickRadius = 10) {\n\t\tthis->clickRadiusSquared = clickRadius * clickRadius;\n\t}\n};\n\nclass Tag : public DraggableCircle {\npublic:\n\tvoid draw(ofEventArgs& args) {\n\t\tfloat r = sqrt(clickRadiusSquared);\n\t\tofPushStyle();\n\t\tofNoFill();\n\t\tofSetLineWidth(2);\n\t\tif(selected) {\n\t\t\tofSetColor(ofColor::yellow);\n\t\t\tofCircle(position, r + 4);\n\t\t}\n\t\tif(dragging) {\n\t\t\tofSetColor(ofColor::red);\n\t\t\tofCircle(position, r + 2);\n\t\t}\n\t\tofFill();\n\t\tofSetColor(ofColor::white);\n\t\tofCircle(position, r);\n\t\tofPopStyle();\n\t}\n};\n\nclass ofApp : public ofBaseApp {\npublic:\n\tvector<Tag> p;\n\t\n\tvoid setup() {\n\t\tp.resize(12);\n\t\tfor(int i = 0; i < p.size(); i++) {\n\t\t\tp[i].setPosition(ofVec2f(ofRandomWidth(), ofRandomHeight()));\n\t\t\tp[i].setClickRadius(64);\n\t\t\tp[i].enableControlEvents();\n\t\t\tp[i].enableDrawEvent();\n\t\t}\n\t}\n\tvoid update() {\n\t\t\n\t}\n\tvoid draw() {\n\t\tofBackground(0);\n\t}\n};\n\nint main() {\n\tofSetupOpenGL(1280, 720, OF_WINDOW);\n\tofRunApp(new ofApp());\n}<commit_msg>better click handling, need to separate selection from dragging classes<commit_after>#include \"ofMain.h\"\n\nbool isDirectionKey(int key) {\n\treturn\n\tkey == OF_KEY_LEFT ||\n\tkey == OF_KEY_RIGHT ||\n\tkey == OF_KEY_UP ||\n\tkey == OF_KEY_DOWN;\n}\n\nofVec2f getDirectionFromKey(int key) {\n\tswitch(key) {\n\t\tcase OF_KEY_LEFT: return ofVec2f(-1, 0);\n\t\tcase OF_KEY_RIGHT: return ofVec2f(+1, 0);\n\t\tcase OF_KEY_UP: return ofVec2f(0, -1);\n\t\tcase OF_KEY_DOWN: return ofVec2f(0, +1);\n\t}\n\treturn ofVec2f(0, 0);\n}\n\nclass EventWatcher {\npublic:\n\tvirtual void mousePressed(ofMouseEventArgs& mouse) {}\n\tvirtual void mouseMoved(ofMouseEventArgs& mouse) {}\n\tvirtual void mouseDragged(ofMouseEventArgs& mouse) {}\n\tvirtual void mouseReleased(ofMouseEventArgs& mouse) {}\n\tvirtual void keyPressed(ofKeyEventArgs& key) {}\n\tvirtual void keyReleased(ofKeyEventArgs& key) {}\n\tvirtual void draw(ofEventArgs& args) {}\n\tvoid enableControlEvents() {\n\t\tofAddListener(ofEvents().keyPressed, this, &EventWatcher::keyPressed);\n\t\tofAddListener(ofEvents().keyReleased, this, &EventWatcher::keyReleased);\n\t\tofAddListener(ofEvents().mousePressed, this, &EventWatcher::mousePressed);\n\t\tofAddListener(ofEvents().mouseReleased, this, &EventWatcher::mouseReleased);\n\t\tofAddListener(ofEvents().mouseMoved, this, &EventWatcher::mouseMoved);\n\t\tofAddListener(ofEvents().mouseDragged, this, &EventWatcher::mouseDragged);\n\t}\n\tvoid disableControlEvents() {\n\t\tofRemoveListener(ofEvents().keyPressed, this, &EventWatcher::keyPressed);\n\t\tofRemoveListener(ofEvents().keyReleased, this, &EventWatcher::keyReleased);\n\t\tofRemoveListener(ofEvents().mousePressed, this, &EventWatcher::mousePressed);\n\t\tofRemoveListener(ofEvents().mouseReleased, this, &EventWatcher::mouseReleased);\n\t\tofRemoveListener(ofEvents().mouseMoved, this, &EventWatcher::mouseMoved);\n\t\tofRemoveListener(ofEvents().mouseDragged, this, &EventWatcher::mouseDragged);\n\t}\n\tvoid enableDrawEvent() {\n\t\tofAddListener(ofEvents().draw, this, &EventWatcher::draw);\n\t}\n\tvoid disableDrawEvent() {\n\t\tofRemoveListener(ofEvents().draw, this, &EventWatcher::draw);\n\t}\n};\n\nclass DraggablePoint {\npublic:\n\tofVec2f position, positionStart;\n\tbool selected, dragging;\n\t\n\tDraggablePoint()\n\t:selected(false)\n\t,dragging(false) {\n\t}\n\tbool isHit(ofVec2f v, float clickRadiusSquared) {\n\t\treturn position.distanceSquared(v) < clickRadiusSquared;\n\t}\n\tvoid draw(float clickRadiusSquared) {\n\t\tfloat r = sqrt(clickRadiusSquared);\n\t\tofPushStyle();\n\t\tofNoFill();\n\t\tofSetLineWidth(2);\n\t\tif(selected) {\n\t\t\tofSetColor(ofColor::yellow);\n\t\t\tofCircle(position, r + 4);\n\t\t}\n\t\tif(dragging) {\n\t\t\tofSetColor(ofColor::red);\n\t\t\tofCircle(position, r + 2);\n\t\t}\n\t\tofFill();\n\t\tofSetColor(ofColor::white);\n\t\tofCircle(position, r);\n\t\tofPopStyle();\n\t}\n};\n\nclass DraggablePoints : public EventWatcher {\nprotected:\n\tvector<DraggablePoint> points;\n\tset<unsigned int> selected;\n\t\n\tofVec2f mouseStart, positionStart;\n\tfloat pointSize, clickRadiusSquared;\n\t\npublic:\n\tDraggablePoints()\n\t:clickRadiusSquared(0) {\n\t}\n\tunsigned int size() {\n\t\treturn points.size();\n\t}\n\tvoid add(const ofVec2f& v) {\n\t\tpoints.push_back(DraggablePoint());\n\t\tpoints.back().position = v;\n\t}\n\tvoid setClickRadius(float clickRadius) {\n\t\tthis->clickRadiusSquared = clickRadius * clickRadius;\n\t}\n\tvoid mousePressed(ofMouseEventArgs& mouse) {\n\t\tbool shift = ofGetKeyPressed(OF_KEY_SHIFT);\n\t\tbool hitAny = false;\n\t\tfor(int i = 0; i < size(); i++) {\n\t\t\tbool hit = points[i].isHit(mouse, clickRadiusSquared);\n\t\t\tif(hit && (shift || !hitAny)) {\n\t\t\t\tpoints[i].selected = true;\n\t\t\t\tselected.insert(i);\n\t\t\t\thitAny = true;\n\t\t\t} else if(!shift) {\n\t\t\t\tpoints[i].selected = false;\n\t\t\t\tselected.erase(i);\n\t\t\t}\n\t\t}\n\t\tmouseStart = mouse;\n\t\tcachePositions();\n\t}\n\tvoid mouseDragged(ofMouseEventArgs& mouse) {\n\t\tofVec2f offset = mouse - mouseStart;\n\t\tfor(set<unsigned int>::iterator itr = selected.begin(); itr != selected.end(); itr++) {\n\t\t\tpoints[*itr].position = points[*itr].positionStart + offset;\n\t\t}\n\t}\n\tvoid mouseReleased(ofMouseEventArgs& mouse) {\n\t\tcachePositions();\n\t}\n\tvoid keyPressed(ofKeyEventArgs& key) {\n\t\tif(isDirectionKey(key.key)) {\n\t\t\tfloat multiplier = ofGetKeyPressed(OF_KEY_COMMAND) ? .25 : 1;\n\t\t\tofVec2f offset = multiplier * getDirectionFromKey(key.key);\n\t\t\tfor(set<unsigned int>::iterator itr = selected.begin(); itr != selected.end(); itr++) {\n\t\t\t\tpoints[*itr].position += offset;\n\t\t\t}\n\t\t}\n\t}\n\tvoid cachePositions() {\n\t\tfor(set<unsigned int>::iterator itr = selected.begin(); itr != selected.end(); itr++) {\n\t\t\tpoints[*itr].positionStart = points[*itr].position;\n\t\t}\n\t}\n\tvoid draw(ofEventArgs& args) {\n\t\tfor(int i = 0; i < size(); i++) {\n\t\t\tpoints[i].draw(clickRadiusSquared);\n\t\t}\n\t}\n};\n\nclass ofApp : public ofBaseApp {\npublic:\n\tDraggablePoints points;\n\t\n\tvoid setup() {\n\t\tpoints.enableControlEvents();\n\t\tpoints.enableDrawEvent();\n\t\tpoints.setClickRadius(64);\n\t\tfor(int i = 0; i < 12; i++) {\n\t\t\tpoints.add(ofVec2f(ofRandomWidth(), ofRandomHeight()));\n\t\t}\n\t}\n\tvoid update() {\n\t\t\n\t}\n\tvoid draw() {\n\t\tofBackground(0);\n\t}\n};\n\nint main() {\n\tofSetupOpenGL(1280, 720, OF_WINDOW);\n\tofRunApp(new ofApp());\n}<|endoftext|>"}
{"text":"<commit_before>#include \"troengame.h\"\n\/\/ STD\n#include <iostream>\n\/\/ OSG\n#include <osgGA\/TrackballManipulator>\n#include <osgGA\/NodeTrackerManipulator>\n#include <osgViewer\/ViewerEventHandlers>\n#include <osg\/LineWidth>\n\n\/\/ troen\n#include \"sampleosgviewer.h\"\n#include \"updatebikepositioncallback.h\"\n\n#include \"input\/bikeinputstate.h\"\n#include \"input\/keyboard.h\"\n#include \"input\/gamepad.h\"\n\n#include \"util\/chronotimer.h\"\n#include \"util\/gldebugdrawer.h\"\n\n#include \"model\/physicsworld.h\"\n\n#include \"controller\/bikecontroller.h\"\n#include \"controller\/levelcontroller.h\"\n\nusing namespace troen;\n\n\/\/ TODO: pass as parameter to troengame\n#define USE_GAMEPAD true\n\nTroenGame::TroenGame(QThread* thread \/*= NULL*\/) :\n\tm_gameThread(thread)\n{\n\tif (m_gameThread == NULL) {\n\t\tm_gameThread = new QThread(this);\n\t}\n\tmoveToThread(m_gameThread);\n\tm_gameThread->start(QThread::HighestPriority);\n}\n\nTroenGame::~TroenGame()\n{\n}\n\nbool TroenGame::initialize()\n{\n\tm_rootNode = new osg::Group;\n\n\t\/\/ careful about the order of initialization\n\t\/\/ TODO\n\t\/\/ initialize sound  here\n\n\tstd::cout << \"[TroenGame::initialize] initializing game ...\" << std::endl;\n\n\tstd::cout << \"[TroenGame::initialize] models and scenegraph ...\" << std::endl;\n\tinitializeControllers();\n\tcomposeSceneGraph();\n\n\tstd::cout << \"[TroenGame::initialize] views & viewer ...\" << std::endl;\n\tinitializeViews();\n\tinitializeViewer();\n\n\tstd::cout << \"[TroenGame::initialize] input ...\" << std::endl;\n\tinitializeInput();\n\n\tstd::cout << \"[TroenGame::initialize] timer ...\" << std::endl;\n\tinitializeTimer();\n\t\n\tstd::cout << \"[TroenGame::initialize] physics ...\" << std::endl;\n\tinitializePhysicsWorld();\n\n\tstd::cout << \"[TroenGame::initialize] successfully initialized !\" << std::endl;\n\treturn true;\n}\n\nbool TroenGame::initializeControllers()\n{\n\tm_levelController = std::make_shared<LevelController>();\n\tm_bikeController = std::make_shared<BikeController>();\n\treturn true;\n}\n\nbool TroenGame::composeSceneGraph()\n{\n\tm_rootNode->addChild(m_levelController->getViewNode());\n\tm_rootNode->addChild(m_bikeController->getViewNode());\n\treturn true;\n}\n\nbool TroenGame::initializeInput()\n{\n\t\/\/ TODO\n\t\/\/ dw: clean this up, move it to the appropriate place\n\tosg::ref_ptr<input::BikeInputState> bikeInputState = new input::BikeInputState();\n\tm_bikeController->setInputState(bikeInputState);\n\n\t\/\/m_childNode->setUpdateCallback(new UpdateBikePositionCallback(m_bike));\n\n\tosg::ref_ptr<input::Keyboard> keyboardHandler = new input::Keyboard(bikeInputState);\n\tstd::shared_ptr<input::Gamepad> gamepad = std::make_shared<input::Gamepad>(bikeInputState);\n\n\tif (USE_GAMEPAD)\n\t{\n\t\tif (gamepad->checkConnection())\n\t\t{\n\t\t\tstd::cout << \"[TroenGame::initializeInput] Gamepad connected on port \" << gamepad->getPort() << std::endl;\n\t\t\tbikeInputState->setPollingDevice(gamepad);\n\t\t} else\n\t\t{\n\t\t\tstd::cout << \"[TroenGame::initializeInput] USE_GAMEPAD true but no gamepad connected!\" << std::endl;\n\t\t}\n\t}\n\n\tm_gameView->addEventHandler(keyboardHandler);\n\n\treturn true;\n}\n\nbool TroenGame::initializeViews()\n{\n\tm_gameView = new osgViewer::View;\n\n\tosg::ref_ptr<osgGA::NodeTrackerManipulator> manipulator\n\t\t= new osgGA::NodeTrackerManipulator;\n\tmanipulator->setTrackerMode(osgGA::NodeTrackerManipulator::NODE_CENTER_AND_ROTATION);\n\n\tm_bikeController->attachTrackingCamera(manipulator);\n\n\tm_gameView->setCameraManipulator(manipulator.get());\n\tm_gameView->setSceneData(m_rootNode);\n\tm_gameView->setUpViewInWindow(100, 100, 1280, 720, 0);\n\t\/\/m_gameView->setUpViewOnSingleScreen(0);\n\n\t\/\/ TODO\n\t\/\/ (possibly multiple ones for multiple rendering passes)\n\treturn true;\n}\n\nbool TroenGame::initializeViewer()\n{\n\tm_sampleOSGViewer = new SampleOSGViewer();\n\tm_sampleOSGViewer->addView(m_gameView);\n\treturn true;\n}\n\nbool TroenGame::initializeTimer()\n{\n\tm_timer = std::make_shared<util::ChronoTimer>(false, true);\n\treturn true;\n}\n\nbool TroenGame::initializePhysicsWorld()\n{\n\tm_physicsWorld = std::make_shared<PhysicsWorld>();\n\t\n\tm_physicsWorld->addRigidBodies(m_levelController->getRigidBodies());\n\t\/\/ m_physicsWorld->addRigidBodies(m_bikeController->getRigidBodies());\n\tm_bikeController->attachWorld(m_physicsWorld);\n\treturn true;\n}\n\nvoid TroenGame::startGameLoop()\n{\n\t\/\/ game loop from here:\n\t\/\/ http:\/\/entropyinteractive.com\/2011\/02\/game-engine-design-the-game-loop\/\n\n\t\/\/ INITIALIZATION\n\tinitialize();\n\tm_timer->start();\n\n\t\/\/ GAME LOOP VARIABLES\n\tlong double nextTime = m_timer->elapsed();\n\tconst long double minMillisecondsBetweenFrames = 10;\n\tconst long double maxMillisecondsBetweenFrames = 50;\n\tint skippedFrames = 0;\n\tint maxSkippedFrames = 4;\n\n\tbool notAdded = true;\n\n\t\/\/ GAME LOOP\n\twhile (!m_sampleOSGViewer->done())\n\t{\n\t\tlong double currTime = m_timer->elapsed();\n\t\t\/\/ are we significantly behind? if yes, \"resync\", force rendering\n\t\tif ((currTime - nextTime) > maxMillisecondsBetweenFrames)\n\t\t\tnextTime = currTime;\n\t\t\/\/ is it time to render the next frame?\n\t\tif (currTime >= nextTime)\n\t\t{\n\t\t\t\/\/std::cout << \"difference: \" << currTime - nextTime << std::endl;\n\t\t\t\/\/ assign the time for the next update\n\t\t\tnextTime += minMillisecondsBetweenFrames;\n\n\t\t\t\/\/ LOOP REALLY STARTS HERE:\n\t\t\t\/* FROM GameProg Info session:\n\t\t\trunAI()\n\t\t\t\/\/ (network \/ multiplayer)\n\t\t\tupdateModels() and checkForUserInput()\n\t\t\tstepSimulation() (Physics) + updateViews()\n\t\t\t\/\/render();*\/\n\n\t\t\tm_bikeController->updateModel();\n\n\t\t\tm_physicsWorld->stepSimulation(currTime);\n\n\t\t\t\/\/ do we have extra time (to draw the frame) or did we skip too many frames already?\n\t\t\tif (currTime < nextTime || (skippedFrames > maxSkippedFrames))\n\t\t\t{\n\t\t\t\t\/\/std::cout << \"drawing\" << std::endl;\n\t\t\t\temit newFrame(currTime);\n\t\t\t\tm_sampleOSGViewer->frame();\n#ifdef DEBUG\t\t\t\t\n\t\t\t\tif (notAdded) {\n\t\t\t\t\tm_rootNode->addChild(m_physicsWorld->m_debug->getSceneGraph());\n\t\t\t\t\tnotAdded = false;\n\t\t\t\t}\n#endif\t\t\t\t\n\t\t\t\tskippedFrames = 0;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tskippedFrames++;\n\t\t\t}\n\t\t}\n\t\telse \/\/ WAIT\n\t\t{\n\t\t\t\/\/ calculate the time to sleep\n\t\t\tlong double sleepTime = (nextTime - currTime);\n\t\t\t\/\/ sanity check\n\t\t\tif (sleepTime > 0)\n\t\t\t{\n\t\t\t\t\/\/ sleep until nextTime\n\t\t\t\t\/\/std::cout << \"sleep for: \" << sleepTime << std::endl;\n\t\t\t\tm_gameThread->msleep(sleepTime);\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ SHUTDOWN\n\tshutdown();\n}\n\nbool TroenGame::shutdown()\n{\n\t\/\/ clean up in reverse order from initialization\n\n\t\/\/ physics\n\tm_physicsWorld.reset();\n\t\/\/timer\n\tm_timer.reset();\n\t\/\/input\n\n\t\/\/viewer & views\n\tm_sampleOSGViewer = NULL;\n\tm_gameView = NULL;\n\n\t\/\/ models & scenegraph\n\tm_rootNode = NULL;\n\tm_bikeController.reset();\n\tm_levelController.reset();\n\n\tstd::cout << \"[TroenGame::shutdown] shutdown complete \" << std::endl;\n\treturn true;\n}\n<commit_msg>#6 first try to integrate motion blur; doesn't work with ATI?<commit_after>#include \"troengame.h\"\n\/\/ STD\n#include <iostream>\n\/\/ OSG\n#include <osgGA\/TrackballManipulator>\n#include <osgGA\/NodeTrackerManipulator>\n#include <osgViewer\/ViewerEventHandlers>\n#include <osg\/LineWidth>\n\n\/\/ troen\n#include \"sampleosgviewer.h\"\n#include \"updatebikepositioncallback.h\"\n\n#include \"input\/bikeinputstate.h\"\n#include \"input\/keyboard.h\"\n#include \"input\/gamepad.h\"\n\n#include \"util\/chronotimer.h\"\n#include \"util\/gldebugdrawer.h\"\n\n#include \"model\/physicsworld.h\"\n\n#include \"controller\/bikecontroller.h\"\n#include \"controller\/levelcontroller.h\"\n\nusing namespace troen;\n\n\/\/ TODO: pass as parameter to troengame\n#define USE_GAMEPAD true\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/ TODO: move MotionBlurOperation into own class if it's working with nVidia and we are optimistic to get it working for ATI\n\n#include <osgDB\/ReadFile>\n#include <osgUtil\/Optimizer>\n#include <osgViewer\/Viewer>\n#include <iostream>\n\nclass MotionBlurOperation : public osg::Operation\n{\npublic:\n\tMotionBlurOperation(double persistence) :\n\t\tosg::Operation(\"MotionBlur\", true),\n\t\tcleared_(false),\n\t\tpersistence_(persistence)\n\t{\n\t\t}\n\n\tvirtual void operator () (osg::Object* object)\n\t{\n\t\tosg::GraphicsContext* gc = dynamic_cast<osg::GraphicsContext*>(object);\n\t\tif (!gc) return;\n\n\t\tdouble t = gc->getState()->getFrameStamp()->getSimulationTime();\n\n\t\tif (!cleared_)\n\t\t{\n\t\t\t\/\/ clear the accumulation buffer\n\t\t\tglClearColor(0, 0, 0, 0);\n\t\t\tglClear(GL_ACCUM_BUFFER_BIT);\n\t\t\tcleared_ = true;\n\t\t\tt0_ = t;\n\t\t}\n\n\t\tdouble dt = fabs(t - t0_);\n\t\tt0_ = t;\n\n\t\t\/\/ compute the blur factor\n\t\tdouble s = powf(0.2, dt \/ persistence_);\n\n\t\t\/\/ scale, accumulate and return\n\t\tglAccum(GL_MULT, s);\n\t\tglAccum(GL_ACCUM, 1 - s);\n\t\tglAccum(GL_RETURN, 1.0f);\n\t}\n\nprivate:\n\tbool cleared_;\n\tdouble t0_;\n\tdouble persistence_;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\n\nTroenGame::TroenGame(QThread* thread \/*= NULL*\/) :\n\tm_gameThread(thread)\n{\n\tif (m_gameThread == NULL) {\n\t\tm_gameThread = new QThread(this);\n\t}\n\tmoveToThread(m_gameThread);\n\tm_gameThread->start(QThread::HighestPriority);\n}\n\nTroenGame::~TroenGame()\n{\n}\n\nbool TroenGame::initialize()\n{\n\tm_rootNode = new osg::Group;\n\n\t\/\/ careful about the order of initialization\n\t\/\/ TODO\n\t\/\/ initialize sound  here\n\n\tstd::cout << \"[TroenGame::initialize] initializing game ...\" << std::endl;\n\n\tstd::cout << \"[TroenGame::initialize] models and scenegraph ...\" << std::endl;\n\tinitializeControllers();\n\tcomposeSceneGraph();\n\n\tstd::cout << \"[TroenGame::initialize] views & viewer ...\" << std::endl;\n\tinitializeViews();\n\tinitializeViewer();\n\n\tstd::cout << \"[TroenGame::initialize] input ...\" << std::endl;\n\tinitializeInput();\n\n\tstd::cout << \"[TroenGame::initialize] timer ...\" << std::endl;\n\tinitializeTimer();\n\t\n\tstd::cout << \"[TroenGame::initialize] physics ...\" << std::endl;\n\tinitializePhysicsWorld();\n\n\tstd::cout << \"[TroenGame::initialize] successfully initialized !\" << std::endl;\n\treturn true;\n}\n\nbool TroenGame::initializeControllers()\n{\n\tm_levelController = std::make_shared<LevelController>();\n\tm_bikeController = std::make_shared<BikeController>();\n\treturn true;\n}\n\nbool TroenGame::composeSceneGraph()\n{\n\tm_rootNode->addChild(m_levelController->getViewNode());\n\tm_rootNode->addChild(m_bikeController->getViewNode());\n\treturn true;\n}\n\nbool TroenGame::initializeInput()\n{\n\t\/\/ TODO\n\t\/\/ dw: clean this up, move it to the appropriate place\n\tosg::ref_ptr<input::BikeInputState> bikeInputState = new input::BikeInputState();\n\tm_bikeController->setInputState(bikeInputState);\n\n\t\/\/m_childNode->setUpdateCallback(new UpdateBikePositionCallback(m_bike));\n\n\tosg::ref_ptr<input::Keyboard> keyboardHandler = new input::Keyboard(bikeInputState);\n\tstd::shared_ptr<input::Gamepad> gamepad = std::make_shared<input::Gamepad>(bikeInputState);\n\n\tif (USE_GAMEPAD)\n\t{\n\t\tif (gamepad->checkConnection())\n\t\t{\n\t\t\tstd::cout << \"[TroenGame::initializeInput] Gamepad connected on port \" << gamepad->getPort() << std::endl;\n\t\t\tbikeInputState->setPollingDevice(gamepad);\n\t\t} else\n\t\t{\n\t\t\tstd::cout << \"[TroenGame::initializeInput] USE_GAMEPAD true but no gamepad connected!\" << std::endl;\n\t\t}\n\t}\n\n\tm_gameView->addEventHandler(keyboardHandler);\n\n\treturn true;\n}\n\nbool TroenGame::initializeViews()\n{\n\tm_gameView = new osgViewer::View;\n\n\tosg::ref_ptr<osgGA::NodeTrackerManipulator> manipulator\n\t\t= new osgGA::NodeTrackerManipulator;\n\tmanipulator->setTrackerMode(osgGA::NodeTrackerManipulator::NODE_CENTER_AND_ROTATION);\n\n\tm_bikeController->attachTrackingCamera(manipulator);\n\n\tm_gameView->setCameraManipulator(manipulator.get());\n\tm_gameView->setSceneData(m_rootNode);\n\tm_gameView->setUpViewInWindow(100, 100, 1280, 720, 0);\n\t\/\/m_gameView->setUpViewOnSingleScreen(0);\n\n\t\/\/ TODO\n\t\/\/ (possibly multiple ones for multiple rendering passes)\n\treturn true;\n}\n\nbool TroenGame::initializeViewer()\n{\n\tm_sampleOSGViewer = new SampleOSGViewer();\n\tm_sampleOSGViewer->addView(m_gameView);\n\n\tdouble persistence = 0.25;\n\tosgViewer::Viewer::Windows windows;\n\tm_sampleOSGViewer->getWindows(windows);\n\tfor (osgViewer::Viewer::Windows::iterator itr = windows.begin();\n\t\titr != windows.end();\n\t\t++itr)\n\t{\n\t\t(*itr)->add(new MotionBlurOperation(persistence));\n\t}\n\n\t\n\treturn true;\n}\n\nbool TroenGame::initializeTimer()\n{\n\tm_timer = std::make_shared<util::ChronoTimer>(false, true);\n\treturn true;\n}\n\nbool TroenGame::initializePhysicsWorld()\n{\n\tm_physicsWorld = std::make_shared<PhysicsWorld>();\n\t\n\tm_physicsWorld->addRigidBodies(m_levelController->getRigidBodies());\n\t\/\/ m_physicsWorld->addRigidBodies(m_bikeController->getRigidBodies());\n\tm_bikeController->attachWorld(m_physicsWorld);\n\treturn true;\n}\n\nvoid TroenGame::startGameLoop()\n{\n\t\/\/ game loop from here:\n\t\/\/ http:\/\/entropyinteractive.com\/2011\/02\/game-engine-design-the-game-loop\/\n\n\t\/\/ INITIALIZATION\n\tinitialize();\n\tm_timer->start();\n\n\t\/\/ GAME LOOP VARIABLES\n\tlong double nextTime = m_timer->elapsed();\n\tconst long double minMillisecondsBetweenFrames = 10;\n\tconst long double maxMillisecondsBetweenFrames = 50;\n\tint skippedFrames = 0;\n\tint maxSkippedFrames = 4;\n\n\tbool notAdded = true;\n\n\t\/\/ GAME LOOP\n\twhile (!m_sampleOSGViewer->done())\n\t{\n\t\tlong double currTime = m_timer->elapsed();\n\t\t\/\/ are we significantly behind? if yes, \"resync\", force rendering\n\t\tif ((currTime - nextTime) > maxMillisecondsBetweenFrames)\n\t\t\tnextTime = currTime;\n\t\t\/\/ is it time to render the next frame?\n\t\tif (currTime >= nextTime)\n\t\t{\n\t\t\t\/\/std::cout << \"difference: \" << currTime - nextTime << std::endl;\n\t\t\t\/\/ assign the time for the next update\n\t\t\tnextTime += minMillisecondsBetweenFrames;\n\n\t\t\t\/\/ LOOP REALLY STARTS HERE:\n\t\t\t\/* FROM GameProg Info session:\n\t\t\trunAI()\n\t\t\t\/\/ (network \/ multiplayer)\n\t\t\tupdateModels() and checkForUserInput()\n\t\t\tstepSimulation() (Physics) + updateViews()\n\t\t\t\/\/render();*\/\n\n\t\t\tm_bikeController->updateModel();\n\n\t\t\tm_physicsWorld->stepSimulation(currTime);\n\n\t\t\t\/\/ do we have extra time (to draw the frame) or did we skip too many frames already?\n\t\t\tif (currTime < nextTime || (skippedFrames > maxSkippedFrames))\n\t\t\t{\n\t\t\t\t\/\/std::cout << \"drawing\" << std::endl;\n\t\t\t\temit newFrame(currTime);\n\t\t\t\tm_sampleOSGViewer->frame();\n#ifdef DEBUG\t\t\t\t\n\t\t\t\tif (notAdded) {\n\t\t\t\t\tm_rootNode->addChild(m_physicsWorld->m_debug->getSceneGraph());\n\t\t\t\t\tnotAdded = false;\n\t\t\t\t}\n#endif\t\t\t\t\n\t\t\t\tskippedFrames = 0;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tskippedFrames++;\n\t\t\t}\n\t\t}\n\t\telse \/\/ WAIT\n\t\t{\n\t\t\t\/\/ calculate the time to sleep\n\t\t\tlong double sleepTime = (nextTime - currTime);\n\t\t\t\/\/ sanity check\n\t\t\tif (sleepTime > 0)\n\t\t\t{\n\t\t\t\t\/\/ sleep until nextTime\n\t\t\t\t\/\/std::cout << \"sleep for: \" << sleepTime << std::endl;\n\t\t\t\tm_gameThread->msleep(sleepTime);\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ SHUTDOWN\n\tshutdown();\n}\n\nbool TroenGame::shutdown()\n{\n\t\/\/ clean up in reverse order from initialization\n\n\t\/\/ physics\n\tm_physicsWorld.reset();\n\t\/\/timer\n\tm_timer.reset();\n\t\/\/input\n\n\t\/\/viewer & views\n\tm_sampleOSGViewer = NULL;\n\tm_gameView = NULL;\n\n\t\/\/ models & scenegraph\n\tm_rootNode = NULL;\n\tm_bikeController.reset();\n\tm_levelController.reset();\n\n\tstd::cout << \"[TroenGame::shutdown] shutdown complete \" << std::endl;\n\treturn true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Chrome Token Signing Native Host\n *\n * This 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 \"Logger.h\"\n#include <cstdio>\n#include <string>\n#ifndef _WIN32\n#include <unistd.h>\n#include <iostream>\n#else\n#include <time.h>\n#endif\n\nusing namespace std;\n\nvoid printCurrentDateTime(FILE *log) {\n    time_t now = time(0);\n    tm *ltm = localtime(&now);\n    int year = 1900 + ltm->tm_year;\n    int month = ltm->tm_mon;\n    int day = ltm->tm_mday;\n    int hour = ltm->tm_hour;\n    int min = ltm->tm_min;\n    int sec = ltm->tm_sec;\n    \/\/Date format yyyy-MM-dd hh:mm:ss\n    fprintf(log, \"%i-%i-%i %i:%i:%i \",year, month, day, hour, min, sec);\n}\n\nstring getLogFilePath() {\n#ifdef _WIN32\n    return string(getenv(\"TEMP\"))+\"\\\\chrome-signing.log\";\n#else\n    return string(getenv(\"HOME\"))+\"\/tmp\/chrome-signing.log\";\n#endif\n}\n\nbool logFileExist() {\n\treturn fopen(getLogFilePath().c_str(), \"r\");\n}\n\nvoid Logger::writeLog(const char *functionName, const char *fileName, int lineNumber, const char *message, ...) {\n\tif (!logFileExist()) {\n\t\treturn;\n\t}\n    FILE *log = fopen(getLogFilePath().c_str(), \"a\");\n    if (!log) {\n        return;\n    }\n    printCurrentDateTime(log);\n#ifndef _WIN32\n    fprintf(log, \"[%i] \", getpid());\n#endif\n    fprintf(log, \"%s() [%s:%i] \", functionName, fileName, lineNumber);\n    va_list args;\n    va_start(args, message);\n    vfprintf(log, message, args);\n    va_end(args);\n    fprintf(log, \"\\n\");\n    fclose(log);\n}\n<commit_msg>Closing log file after checking its existance. Improved date time format<commit_after>\/*\n * Chrome Token Signing Native Host\n *\n * This 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 \"Logger.h\"\n#include <cstdio>\n#include <string>\n#ifndef _WIN32\n#include <unistd.h>\n#include <iostream>\n#else\n#include <time.h>\n#endif\n\nusing namespace std;\n\nstring transformIntegerFormat(int &value) {\n\tif (value > 9) {\n\t\treturn (to_string(value));\n\t}\n\treturn (\"0\" + to_string(value));\n}\n\nvoid printCurrentDateTime(FILE *log) {\n    time_t now = time(0);\n    tm *ltm = localtime(&now);\n    int year = 1900 + ltm->tm_year;\n\tstring month = transformIntegerFormat(ltm->tm_mon);\n\tstring day = transformIntegerFormat(ltm->tm_mday);\n\tstring hour = transformIntegerFormat(ltm->tm_hour);\n\tstring min = transformIntegerFormat(ltm->tm_min);\n\tstring sec = transformIntegerFormat(ltm->tm_sec);\n    \/\/Date format yyyy-MM-dd hh:mm:ss\n\tfprintf(log, \"%i-%s-%s %s:%s:%s \", year, month.c_str(), day.c_str(), hour.c_str(), min.c_str(), sec.c_str());\n}\n\nstring getLogFilePath() {\n#ifdef _WIN32\n    return string(getenv(\"TEMP\"))+\"\\\\chrome-signing.log\";\n#else\n    return string(getenv(\"HOME\"))+\"\/tmp\/chrome-signing.log\";\n#endif\n}\n\nbool logFileExist() {\n\tFILE *file = fopen(getLogFilePath().c_str(), \"r\");\n\tif (!file) {\n\t\treturn false;\n\t}\n\tfclose(file);\n\treturn true;\n}\n\nvoid Logger::writeLog(const char *functionName, const char *fileName, int lineNumber, const char *message, ...) {\n\tif (!logFileExist()) {\n\t\treturn;\n\t}\n    FILE *log = fopen(getLogFilePath().c_str(), \"a\");\n    if (!log) {\n        return;\n    }\n    printCurrentDateTime(log);\n#ifndef _WIN32\n    fprintf(log, \"[%i] \", getpid());\n#endif\n    fprintf(log, \"%s() [%s:%i] \", functionName, fileName, lineNumber);\n    va_list args;\n    va_start(args, message);\n    vfprintf(log, message, args);\n    va_end(args);\n    fprintf(log, \"\\n\");\n    fclose(log);\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"luatagtransform.h\"\n\n#include <stdexcept>\n#include <boost\/format.hpp>\n\nusing namespace valhalla::mjolnir;\n\nnamespace {\n\nvoid CheckLuaFuncExists(lua_State* state, const std::string &func_name) {\n\n  lua_getglobal(state, func_name.c_str());\n\n  if (!lua_isfunction (state, -1)) {\n    throw std::runtime_error((boost::format(\"Lua script does not contain a function %1%.\")\n    % func_name).str());\n  }\n  lua_pop(state,1);\n}\n\n}\n\nLuaTagTransform::LuaTagTransform()\n{\n  \/\/ Create a new lua state\n  waystate_ = luaL_newstate();\n  nodestate_ = luaL_newstate();\n\n}\n\nLuaTagTransform::~LuaTagTransform(){\n\n  if (waystate_ != NULL) {\n    lua_close(waystate_);\n  }\n  if (nodestate_ != NULL) {\n    lua_close(nodestate_);\n  }\n}\n\nvoid LuaTagTransform::OpenLib() const {\n\n  luaL_openlibs(waystate_);\n  luaL_openlibs(nodestate_);\n\n  \/\/check if way script and function exists.\n  luaL_dofile(waystate_, luawayscript_.c_str());\n  CheckLuaFuncExists(waystate_, luawayfunc_);\n\n  \/\/check if node script and function exists.\n  luaL_dofile(nodestate_, luanodescript_.c_str());\n  CheckLuaFuncExists(nodestate_, luanodefunc_);\n}\n\nvoid LuaTagTransform::SetLuaWayFunc(std::string luawayfunc) {\n  luawayfunc_ = luawayfunc;\n}\n\nvoid LuaTagTransform::SetLuaNodeFunc(std::string luanodefunc) {\n  luanodefunc_ = luanodefunc;\n}\n\nstd::string LuaTagTransform::GetLuaWayFunc() const {\n  return luawayfunc_;\n}\n\nstd::string LuaTagTransform::GetLuaNodeFunc() const {\n  return luanodefunc_;\n}\n\nvoid LuaTagTransform::SetLuaWayScript(std::string luawayscript) {\n  luawayscript_ = luawayscript;\n}\n\nvoid LuaTagTransform::SetLuaNodeScript(std::string luanodescript) {\n  luanodescript_ = luanodescript;\n}\n\nstd::string LuaTagTransform::GetLuaWayScript() const {\n  return luawayscript_;\n}\n\nstd::string LuaTagTransform::GetLuaNodeScript() const {\n  return luanodescript_;\n}\n\nnamespace{\nvoid stackdump_g(lua_State* l)\n{\n    int i;\n    int top = lua_gettop(l);\n\n    printf(\"total in stack %d\\n\",top);\n\n    for (i = 1; i <= top; i++)\n    {  \/* repeat for each level *\/\n        int t = lua_type(l, i);\n        switch (t) {\n            case LUA_TSTRING:  \/* strings *\/\n                printf(\"string: '%s'\\n\", lua_tostring(l, i));\n                break;\n            case LUA_TBOOLEAN:  \/* booleans *\/\n                printf(\"boolean %s\\n\",lua_toboolean(l, i) ? \"true\" : \"false\");\n                break;\n            case LUA_TNUMBER:  \/* numbers *\/\n                printf(\"number: %g\\n\", lua_tonumber(l, i));\n                break;\n            default:  \/* other values *\/\n                printf(\"%s\\n\", lua_typename(l, t));\n                break;\n        }\n        printf(\"  \");  \/* put a separator *\/\n    }\n    printf(\"\\n\");  \/* end the listing *\/\n}\n}\n\nTags LuaTagTransform::TransformInLua(bool isWay, const Tags &maptags) {\n\n  \/\/grab the proper function out of the lua code\n  lua_State* state;\n  if (isWay){\n    lua_getglobal(waystate_,luawayfunc_.c_str());\n    state = waystate_;\n  }\n  else {\n    lua_getglobal(nodestate_,luanodefunc_.c_str());\n    state = nodestate_;\n  }\n\n  \/\/set up the lua table (map)\n  int count = 0;\n  lua_newtable(state);\n  for (const auto& tag : maptags) {\n    lua_pushstring(state, tag.first.c_str());\n    lua_pushstring(state, tag.second.c_str());\n    lua_rawset(state, -3);\n    count++;\n  }\n\n  \/\/tell lua how many items are in the map\n  lua_pushinteger(state, count);\n\n  \/\/call lua\n  if (lua_pcall(state, 2, isWay ? 4 : 2, 0)) {\n    fprintf(stderr, \"Failed to execute lua function for basic tag processing: %s\\n\", lua_tostring(state, -1));\n  }\n\n  \/\/if we dont care about it we stop looking\n  Tags result;\n  \/*if(lua_tonumber(state, 1))\n    return result;*\/\n\n  \/\/osm2pgsql has extra info for roads and polygons which we dont care about\n  if(isWay) {\n    lua_pop(state,1);\n    lua_pop(state,1);\n  }\n\n  \/\/pull out the keys and values into a map\n  lua_pushnil(state);\n  while (lua_next(state,-2) != 0) {\n    const char* key = lua_tostring(state,-2);\n    const char* value = lua_tostring(state,-1);\n    result[key] = value;\n    lua_pop(state,1);\n  }\n\n  \/\/pull out an int which if its 1 means we dont care about this way\/node\n  int filter = lua_tointeger(state, -2);\n  lua_pop(state,2);\n\n  return result;\n}\n\n<commit_msg>return empty result if filter = 1.  TODO check filter before populating the map.<commit_after>#include \"luatagtransform.h\"\n\n#include <stdexcept>\n#include <boost\/format.hpp>\n\nusing namespace valhalla::mjolnir;\n\nnamespace {\n\nvoid CheckLuaFuncExists(lua_State* state, const std::string &func_name) {\n\n  lua_getglobal(state, func_name.c_str());\n\n  if (!lua_isfunction (state, -1)) {\n    throw std::runtime_error((boost::format(\"Lua script does not contain a function %1%.\")\n    % func_name).str());\n  }\n  lua_pop(state,1);\n}\n\n}\n\nLuaTagTransform::LuaTagTransform()\n{\n  \/\/ Create a new lua state\n  waystate_ = luaL_newstate();\n  nodestate_ = luaL_newstate();\n\n}\n\nLuaTagTransform::~LuaTagTransform(){\n\n  if (waystate_ != NULL) {\n    lua_close(waystate_);\n  }\n  if (nodestate_ != NULL) {\n    lua_close(nodestate_);\n  }\n}\n\nvoid LuaTagTransform::OpenLib() const {\n\n  luaL_openlibs(waystate_);\n  luaL_openlibs(nodestate_);\n\n  \/\/check if way script and function exists.\n  luaL_dofile(waystate_, luawayscript_.c_str());\n  CheckLuaFuncExists(waystate_, luawayfunc_);\n\n  \/\/check if node script and function exists.\n  luaL_dofile(nodestate_, luanodescript_.c_str());\n  CheckLuaFuncExists(nodestate_, luanodefunc_);\n}\n\nvoid LuaTagTransform::SetLuaWayFunc(std::string luawayfunc) {\n  luawayfunc_ = luawayfunc;\n}\n\nvoid LuaTagTransform::SetLuaNodeFunc(std::string luanodefunc) {\n  luanodefunc_ = luanodefunc;\n}\n\nstd::string LuaTagTransform::GetLuaWayFunc() const {\n  return luawayfunc_;\n}\n\nstd::string LuaTagTransform::GetLuaNodeFunc() const {\n  return luanodefunc_;\n}\n\nvoid LuaTagTransform::SetLuaWayScript(std::string luawayscript) {\n  luawayscript_ = luawayscript;\n}\n\nvoid LuaTagTransform::SetLuaNodeScript(std::string luanodescript) {\n  luanodescript_ = luanodescript;\n}\n\nstd::string LuaTagTransform::GetLuaWayScript() const {\n  return luawayscript_;\n}\n\nstd::string LuaTagTransform::GetLuaNodeScript() const {\n  return luanodescript_;\n}\n\nnamespace{\nvoid stackdump_g(lua_State* l)\n{\n    int i;\n    int top = lua_gettop(l);\n\n    printf(\"total in stack %d\\n\",top);\n\n    for (i = 1; i <= top; i++)\n    {  \/* repeat for each level *\/\n        int t = lua_type(l, i);\n        switch (t) {\n            case LUA_TSTRING:  \/* strings *\/\n                printf(\"string: '%s'\\n\", lua_tostring(l, i));\n                break;\n            case LUA_TBOOLEAN:  \/* booleans *\/\n                printf(\"boolean %s\\n\",lua_toboolean(l, i) ? \"true\" : \"false\");\n                break;\n            case LUA_TNUMBER:  \/* numbers *\/\n                printf(\"number: %g\\n\", lua_tonumber(l, i));\n                break;\n            default:  \/* other values *\/\n                printf(\"%s\\n\", lua_typename(l, t));\n                break;\n        }\n        printf(\"  \");  \/* put a separator *\/\n    }\n    printf(\"\\n\");  \/* end the listing *\/\n}\n}\n\nTags LuaTagTransform::TransformInLua(bool isWay, const Tags &maptags) {\n\n  \/\/grab the proper function out of the lua code\n  lua_State* state;\n  if (isWay){\n    lua_getglobal(waystate_,luawayfunc_.c_str());\n    state = waystate_;\n  }\n  else {\n    lua_getglobal(nodestate_,luanodefunc_.c_str());\n    state = nodestate_;\n  }\n\n  \/\/set up the lua table (map)\n  int count = 0;\n  lua_newtable(state);\n  for (const auto& tag : maptags) {\n    lua_pushstring(state, tag.first.c_str());\n    lua_pushstring(state, tag.second.c_str());\n    lua_rawset(state, -3);\n    count++;\n  }\n\n  \/\/tell lua how many items are in the map\n  lua_pushinteger(state, count);\n\n  \/\/call lua\n  if (lua_pcall(state, 2, isWay ? 4 : 2, 0)) {\n    fprintf(stderr, \"Failed to execute lua function for basic tag processing: %s\\n\", lua_tostring(state, -1));\n  }\n\n  \/\/TODO:  if we dont care about it we stop looking.  Look for filter = 1\n  Tags result;\n  \/*if(lua_tonumber(state, 1))\n    return result;*\/\n\n  \/\/osm2pgsql has extra info for roads and polygons which we dont care about\n  if(isWay) {\n    lua_pop(state,1);\n    lua_pop(state,1);\n  }\n\n  \/\/pull out the keys and values into a map\n  lua_pushnil(state);\n  while (lua_next(state,-2) != 0) {\n    const char* key = lua_tostring(state,-2);\n    const char* value = lua_tostring(state,-1);\n    result[key] = value;\n    lua_pop(state,1);\n  }\n\n  \/\/pull out an int which if its 1 means we dont care about this way\/node\n  int filter = lua_tointeger(state, -2);\n  lua_pop(state,2);\n\n  if (filter)\n    result.clear();\n\n  return result;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/* ****************************************************************************** *\\\n\nCopyright (C) 2012-2014 Intel Corporation.  All rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n- Redistributions of source code must retain the above copyright notice,\nthis list 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- Neither the name of Intel Corporation nor the names of its contributors\nmay be used to endorse or promote products derived from this software\nwithout specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY INTEL CORPORATION \"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 INTEL CORPORATION 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\nFile Name: mfx_library_iterator_linux.cpp\n\n\\* ****************************************************************************** *\/\n\n\n#if !defined(_WIN32) && !defined(_WIN64)\n\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <dirent.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <unistd.h>\n\n#include \"mfx_library_iterator.h\"\n\n#include \"mfx_dispatcher.h\"\n#include \"mfx_dispatcher_log.h\"\n\n#define MFX_PCI_DIR \"\/sys\/bus\/pci\/devices\"\n#define MFX_PCI_DISPLAY_CONTROLLER_CLASS 0x03\n\nstatic const char mfx_storage_opt[] = \"\/opt\/intel\";\n\n#ifndef __APPLE__\n#if defined(__linux__) && defined(__x86_64__)\n    static const char mfx_folder[] = \"mediasdk\/lib64\";\n    static const char mfx_so_hw_base_name[] = \"libmfxhw64-p.so\";\n    static const char mfx_so_sw_base_name[] = \"libmfxsw64-p.so\";\n#else\n    static const char mfx_folder[] = \"mediasdk\/lib32\";\n    static const char mfx_so_hw_base_name[] = \"libmfxhw32-p.so\";\n    static const char mfx_so_sw_base_name[] = \"libmfxsw32-p.so\";\n#endif\n\n#else\n#if defined(__x86_64__)\nstatic const char mfx_folder[] = \"mediasdk\/lib64\";\nstatic const char mfx_so_hw_base_name[] = \"libmfxhw64.dylib\";\nstatic const char mfx_so_sw_base_name[] = \"libmfxsw64.dylib\";\n#else\nstatic const char mfx_folder[] = \"mediasdk\/lib32\";\nstatic const char mfx_so_hw_base_name[] = \"libmfxhw32.dylib\";\nstatic const char mfx_so_sw_base_name[] = \"libmfxsw32.dylib\";\n#endif\n#endif  \/\/ifndef __APPLE__\n\nstatic int mfx_dir_filter(const struct dirent* dir_ent)\n{\n    if (!dir_ent) return 0;\n    if (!strcmp(dir_ent->d_name, \".\")) return 0;\n    if (!strcmp(dir_ent->d_name, \"..\")) return 0;\n    return 1;\n}\n\ntypedef int (*fsort)(const struct dirent**, const struct dirent**);\n\nstatic mfxU32 mfx_init_adapters(struct mfx_disp_adapters** p_adapters)\n{\n    mfxU32 adapters_num = 0;\n    int i = 0;\n    struct mfx_disp_adapters* adapters = NULL;\n    struct dirent** dir_entries = NULL;\n    int entries_num = scandir(MFX_PCI_DIR, &dir_entries, mfx_dir_filter, (fsort)alphasort);\n\n    \/\/ sizeof(MFX_PCI_DIR) = 20, sizeof(dirent::d_name) <= 256, sizeof(\"class\"|\"vendor\"|\"device\") = 6\n    char file_name[300] = {0};\n    \/\/ sizeof(\"0xzzzzzz\") = 8\n    char str[16] = {0};\n    FILE* file = NULL;\n\n    for (i = 0; i < entries_num; ++i)\n    {\n        long int class_id = 0, vendor_id = 0, device_id = 0;\n\n        if (!dir_entries[i]) continue;\n        \/\/ obtaining device class id\n        snprintf(file_name, sizeof(file_name)\/sizeof(file_name[0]), \"%s\/%s\/%s\", MFX_PCI_DIR, dir_entries[i]->d_name, \"class\");\n        file = fopen(file_name, \"r\");\n        if (file)\n        {\n            if (fgets(str, sizeof(str), file))\n            {\n                class_id = strtol(str, NULL, 16);\n            }\n            fclose(file);\n\n            if (MFX_PCI_DISPLAY_CONTROLLER_CLASS == (class_id >> 16))\n            {\n                \/\/ obtaining device vendor id\n                snprintf(file_name, sizeof(file_name)\/sizeof(file_name[0]), \"%s\/%s\/%s\", MFX_PCI_DIR, dir_entries[i]->d_name, \"vendor\");\n                file = fopen(file_name, \"r\");\n                if (file)\n                {\n                    if (fgets(str, sizeof(str), file))\n                    {\n                        vendor_id = strtol(str, NULL, 16);\n                    }\n                    fclose(file);\n                }\n                \/\/ obtaining device id\n                snprintf(file_name, sizeof(file_name)\/sizeof(file_name[0]), \"%s\/%s\/%s\", MFX_PCI_DIR, dir_entries[i]->d_name, \"device\");\n                file = fopen(file_name, \"r\");\n                if (file)\n                {\n                    if (fgets(str, sizeof(str), file))\n                    {\n                        device_id = strtol(str, NULL, 16);\n                    }\n                    fclose(file);\n                }\n                \/\/ adding valid adaptor to the list\n                if (vendor_id && device_id)\n                {\n                    struct mfx_disp_adapters* tmp_adapters = NULL;\n\n                    tmp_adapters = (mfx_disp_adapters*)realloc(adapters,\n                                                               (adapters_num+1)*sizeof(struct mfx_disp_adapters));\n\n                    if (tmp_adapters)\n                    {\n                        adapters = tmp_adapters;\n                        adapters[adapters_num].vendor_id = vendor_id;\n                        adapters[adapters_num].device_id = device_id;\n                        ++adapters_num;\n                    }\n                }\n            }\n        }\n        free(dir_entries[i]);\n    }\n    if (entries_num) free(dir_entries);\n    if (p_adapters) *p_adapters = adapters;\n    return adapters_num;\n}\n\nstatic mfxU32 mfx_list_libraries(const char* path, bool search_hw, struct mfx_libs** p_libs)\n{\n    mfxU32 libs_num = 0;\n    size_t len = 0;\n    int i = 0;\n    struct mfx_libs* libs = NULL;\n    struct dirent** dir_entries = NULL;\n    int entries_num = scandir(path, &dir_entries, mfx_dir_filter, (fsort)alphasort);\n\n    for (i = 0; i < entries_num; ++i)\n    {\n        unsigned long int major = 0, minor = 0;\n        char* p_major = NULL;\n        char* p_minor = NULL;\n        char* p = NULL;\n        bool b_skip = false;\n\n        if (!dir_entries[i]) continue;\n\n        len = strlen(dir_entries[i]->d_name);\n        if (len < MFX_MIN_REAL_LIBNAME) goto skip;\n        if (len > MFX_MAX_REAL_LIBNAME) goto skip;\n\n        if (search_hw)\n        {\n            if (strncmp(dir_entries[i]->d_name, mfx_so_hw_base_name, MFX_SO_BASE_NAME_LEN)) goto skip;\n        }\n        else\n        {\n            if (strncmp(dir_entries[i]->d_name, mfx_so_sw_base_name, MFX_SO_BASE_NAME_LEN)) goto skip;\n        }\n\n        for (p = &(dir_entries[i]->d_name[MFX_SO_BASE_NAME_LEN]); !b_skip && *p; ++p)\n        {\n            if ('.' == *p)\n            {\n                if (!p_major) p_major = p;\n                else if (!p_minor) p_minor = p;\n                else b_skip = true;\n            }\n            else if (!strchr(\"0123456789\", *p))\n            {\n                b_skip = true;\n            }\n        }\n        if (b_skip) goto skip;\n\n        if (!p_major || !p_minor) goto skip;\n        if (p_major != &(dir_entries[i]->d_name[MFX_SO_BASE_NAME_LEN])) goto skip;\n        ++p_major;\n        if (p_major == p_minor) goto skip;\n        ++p_minor;\n        if (!(*p_minor)) goto skip;\n\n        major = strtoul(p_major, NULL, 10);\n        minor = strtoul(p_minor, NULL, 10);\n        if ((major <= 0xFFFF) && (minor <= 0xFFFF))\n        {\n            struct mfx_libs* tmp_libs = NULL;\n            tmp_libs = (mfx_libs*)realloc(libs,\n                                          (libs_num+1)*sizeof(struct mfx_libs));\n            if (tmp_libs)\n            {\n                libs = tmp_libs;\n                strncpy(libs[libs_num].name, dir_entries[i]->d_name, MFX_MAX_REAL_LIBNAME);\n                libs[libs_num].name[MFX_MAX_REAL_LIBNAME] = 0;\n                libs[libs_num].version.Major = (mfxU16)major;\n                libs[libs_num].version.Minor = (mfxU16)minor;\n                ++libs_num;\n            }\n        }\n\n    skip:\n        free(dir_entries[i]);\n    }\n    if (entries_num) free(dir_entries);\n    if (p_libs) *p_libs = libs;\n    return libs_num;\n}\n\nnamespace MFX\n{\n\nmfxStatus SelectImplementationType(const mfxU32 adapterNum, mfxIMPL *pImplInterface, mfxU32 *pVendorID, mfxU32 *pDeviceID)\n{\n    mfx_disp_adapters* adapters = NULL;\n    int adapters_num = mfx_init_adapters(&adapters);\n    if (pVendorID && pDeviceID && adapterNum < adapters_num)\n    {\n        *pVendorID = adapters[adapterNum].vendor_id;\n        *pDeviceID = adapters[adapterNum].device_id;\n    }\n    if (adapters_num) free(adapters);\n\n    if (adapterNum >= adapters_num)\n        return MFX_ERR_UNSUPPORTED;\n\n    if ((*pImplInterface == MFX_IMPL_VIA_D3D9) ||\n        (*pImplInterface == MFX_IMPL_VIA_D3D11) )\n        return MFX_ERR_UNSUPPORTED;\n\n    *pImplInterface = MFX_IMPL_VIA_VAAPI;\n    return MFX_ERR_NONE;\n}\n\nMFXLibraryIterator::MFXLibraryIterator(void)\n{\n    m_implType = MFX_LIB_PSEUDO;\n\n    m_vendorID = 0;\n    m_deviceID = 0;\n\n    m_lastLibIndex = -1;\n\n    m_adapters = NULL;\n    m_adapters_num = mfx_init_adapters(&m_adapters);\n\n    m_path[0] = '\\0';\n    m_libs = NULL;\n    m_libs_num = 0;\n}\n\nMFXLibraryIterator::~MFXLibraryIterator(void)\n{\n    Release();\n    if (m_adapters_num) free(m_adapters);\n}\n\nvoid MFXLibraryIterator::Release(void)\n{\n    m_implType = MFX_LIB_PSEUDO;\n\n    m_vendorID = 0;\n    m_deviceID = 0;\n\n    m_lastLibIndex = -1;\n    if (m_libs)\n    {\n        free(m_libs);\n        m_libs = NULL;\n    }\n    m_libs_num = 0;\n}\n\nmfxStatus MFXLibraryIterator::Init(eMfxImplType implType, mfxIMPL impl, const mfxU32 adapter_num, int storageID)\n{\n    \/\/ release the object before initialization\n    Release();\n\n    \/\/ check error(s)\n    if (MFX_LIB_HARDWARE == implType)\n    {\n        if (!m_adapters_num || (adapter_num >= m_adapters_num))\n        {\n            return MFX_ERR_UNSUPPORTED;\n        }\n        m_vendorID = m_adapters[adapter_num].vendor_id;\n        m_deviceID = m_adapters[adapter_num].device_id;\n    }\n    else if (MFX_LIB_SOFTWARE != implType)\n    {\n        return MFX_ERR_UNSUPPORTED;\n    }\n    if (MFX_STORAGE_ID_OPT != storageID)\n    {\n        return MFX_ERR_UNSUPPORTED;\n    }\n\n    \/\/ set the required library's implementation type\n    m_implType = implType;\n\n    snprintf(m_path, sizeof(m_path)\/sizeof(m_path[0]),\n             \"%s\/%s\/%04x\/%04x\", mfx_storage_opt, mfx_folder, m_vendorID, m_deviceID);\n\n    m_libs_num = mfx_list_libraries(m_path, (MFX_LIB_HARDWARE == implType), &m_libs);\n\n    if (!m_libs_num)\n    {\n        Release();\n        return MFX_ERR_UNSUPPORTED;\n    }\n\n    return MFX_ERR_NONE;\n}\n\nmfxStatus MFXLibraryIterator::SelectDLLVersion(char *pPath, size_t pathSize,\n                                               eMfxImplType* pImplType, mfxVersion minVersion)\n{\n    if (m_lastLibIndex < 0)\n    {\n        for (int i = m_libs_num - 1; i >= 0; i--)\n        {\n            if (m_libs[i].version.Major == minVersion.Major && m_libs[i].version.Minor >= minVersion.Minor)\n            {\n                    m_lastLibIndex = i;\n                    break;\n            }\n        }\n    }\n    else\n        m_lastLibIndex--;\n\n    if (m_lastLibIndex < 0)\n        return MFX_ERR_NOT_FOUND;\n\n    if (m_libs[m_lastLibIndex].version.Major != minVersion.Major ||\n        m_libs[m_lastLibIndex].version.Minor < minVersion.Minor)\n    {\n        m_lastLibIndex = -1;\n        return MFX_ERR_NOT_FOUND;\n    }\n\n    snprintf(pPath, pathSize, \"%s\/%s\", m_path, m_libs[m_lastLibIndex].name);\n\n    if (pImplType) *pImplType = (!m_vendorID && !m_deviceID)? MFX_LIB_SOFTWARE: MFX_LIB_HARDWARE;\n\n    return MFX_ERR_NONE;\n}\n\nmfxIMPL MFXLibraryIterator::GetImplementationType()\n{\n    mfxIMPL implInterface;\n    MFX::SelectImplementationType(0, &implInterface, NULL, NULL);\n    return implInterface;\n}\n\nbool MFXLibraryIterator::GetSubKeyName(msdk_disp_char *subKeyName, size_t length) const\n{\n    return false;\n}\n\n} \/\/ namespace MFX\n\n#endif \/\/ #if !defined(_WIN32) && !defined(_WIN64)\n<commit_msg>fix for proper library path load for MSS 2017<commit_after>\/* ****************************************************************************** *\\\n\nCopyright (C) 2012-2014 Intel Corporation.  All rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n- Redistributions of source code must retain the above copyright notice,\nthis list 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- Neither the name of Intel Corporation nor the names of its contributors\nmay be used to endorse or promote products derived from this software\nwithout specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY INTEL CORPORATION \"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 INTEL CORPORATION 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\nFile Name: mfx_library_iterator_linux.cpp\n\n\\* ****************************************************************************** *\/\n\n\n#if !defined(_WIN32) && !defined(_WIN64)\n\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <dirent.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <unistd.h>\n\n#include \"mfx_library_iterator.h\"\n\n#include \"mfx_dispatcher.h\"\n#include \"mfx_dispatcher_log.h\"\n\n#define MFX_PCI_DIR \"\/sys\/bus\/pci\/devices\"\n#define MFX_PCI_DISPLAY_CONTROLLER_CLASS 0x03\n\nstatic const char mfx_storage_opt[] = \"\/opt\/intel\";\n\n#ifndef __APPLE__\n#if defined(__linux__) && defined(__x86_64__)\n    static const char mfx_folder[] = \"mediasdk\/lib64\";\n    static const char mfx_so_hw_base_name[] = \"libmfxhw64-p.so\";\n    static const char mfx_so_sw_base_name[] = \"libmfxsw64-p.so\";\n#else\n    static const char mfx_folder[] = \"mediasdk\/lib32\";\n    static const char mfx_so_hw_base_name[] = \"libmfxhw32-p.so\";\n    static const char mfx_so_sw_base_name[] = \"libmfxsw32-p.so\";\n#endif\n\n#else\n#if defined(__x86_64__)\nstatic const char mfx_folder[] = \"mediasdk\/lib64\";\nstatic const char mfx_so_hw_base_name[] = \"libmfxhw64.dylib\";\nstatic const char mfx_so_sw_base_name[] = \"libmfxsw64.dylib\";\n#else\nstatic const char mfx_folder[] = \"mediasdk\/lib32\";\nstatic const char mfx_so_hw_base_name[] = \"libmfxhw32.dylib\";\nstatic const char mfx_so_sw_base_name[] = \"libmfxsw32.dylib\";\n#endif\n#endif  \/\/ifndef __APPLE__\n\nstatic int mfx_dir_filter(const struct dirent* dir_ent)\n{\n    if (!dir_ent) return 0;\n    if (!strcmp(dir_ent->d_name, \".\")) return 0;\n    if (!strcmp(dir_ent->d_name, \"..\")) return 0;\n    return 1;\n}\n\ntypedef int (*fsort)(const struct dirent**, const struct dirent**);\n\nstatic mfxU32 mfx_init_adapters(struct mfx_disp_adapters** p_adapters)\n{\n    mfxU32 adapters_num = 0;\n    int i = 0;\n    struct mfx_disp_adapters* adapters = NULL;\n    struct dirent** dir_entries = NULL;\n    int entries_num = scandir(MFX_PCI_DIR, &dir_entries, mfx_dir_filter, (fsort)alphasort);\n\n    \/\/ sizeof(MFX_PCI_DIR) = 20, sizeof(dirent::d_name) <= 256, sizeof(\"class\"|\"vendor\"|\"device\") = 6\n    char file_name[300] = {0};\n    \/\/ sizeof(\"0xzzzzzz\") = 8\n    char str[16] = {0};\n    FILE* file = NULL;\n\n    for (i = 0; i < entries_num; ++i)\n    {\n        long int class_id = 0, vendor_id = 0, device_id = 0;\n\n        if (!dir_entries[i]) continue;\n        \/\/ obtaining device class id\n        snprintf(file_name, sizeof(file_name)\/sizeof(file_name[0]), \"%s\/%s\/%s\", MFX_PCI_DIR, dir_entries[i]->d_name, \"class\");\n        file = fopen(file_name, \"r\");\n        if (file)\n        {\n            if (fgets(str, sizeof(str), file))\n            {\n                class_id = strtol(str, NULL, 16);\n            }\n            fclose(file);\n\n            if (MFX_PCI_DISPLAY_CONTROLLER_CLASS == (class_id >> 16))\n            {\n                \/\/ obtaining device vendor id\n                snprintf(file_name, sizeof(file_name)\/sizeof(file_name[0]), \"%s\/%s\/%s\", MFX_PCI_DIR, dir_entries[i]->d_name, \"vendor\");\n                file = fopen(file_name, \"r\");\n                if (file)\n                {\n                    if (fgets(str, sizeof(str), file))\n                    {\n                        vendor_id = strtol(str, NULL, 16);\n                    }\n                    fclose(file);\n                }\n                \/\/ obtaining device id\n                snprintf(file_name, sizeof(file_name)\/sizeof(file_name[0]), \"%s\/%s\/%s\", MFX_PCI_DIR, dir_entries[i]->d_name, \"device\");\n                file = fopen(file_name, \"r\");\n                if (file)\n                {\n                    if (fgets(str, sizeof(str), file))\n                    {\n                        device_id = strtol(str, NULL, 16);\n                    }\n                    fclose(file);\n                }\n                \/\/ adding valid adaptor to the list\n                if (vendor_id && device_id)\n                {\n                    struct mfx_disp_adapters* tmp_adapters = NULL;\n\n                    tmp_adapters = (mfx_disp_adapters*)realloc(adapters,\n                                                               (adapters_num+1)*sizeof(struct mfx_disp_adapters));\n\n                    if (tmp_adapters)\n                    {\n                        adapters = tmp_adapters;\n                        adapters[adapters_num].vendor_id = vendor_id;\n                        adapters[adapters_num].device_id = device_id;\n                        ++adapters_num;\n                    }\n                }\n            }\n        }\n        free(dir_entries[i]);\n    }\n    if (entries_num) free(dir_entries);\n    if (p_adapters) *p_adapters = adapters;\n    return adapters_num;\n}\n\nstatic mfxU32 mfx_list_libraries(const char* path, bool search_hw, struct mfx_libs** p_libs)\n{\n    mfxU32 libs_num = 0;\n    size_t len = 0;\n    int i = 0;\n    struct mfx_libs* libs = NULL;\n    struct dirent** dir_entries = NULL;\n    int entries_num = scandir(path, &dir_entries, mfx_dir_filter, (fsort)alphasort);\n\n    for (i = 0; i < entries_num; ++i)\n    {\n        unsigned long int major = 0, minor = 0;\n        char* p_major = NULL;\n        char* p_minor = NULL;\n        char* p = NULL;\n        bool b_skip = false;\n\n        if (!dir_entries[i]) continue;\n\n        len = strlen(dir_entries[i]->d_name);\n        if (len < MFX_MIN_REAL_LIBNAME) goto skip;\n        if (len > MFX_MAX_REAL_LIBNAME) goto skip;\n\n        if (search_hw)\n        {\n            if (strncmp(dir_entries[i]->d_name, mfx_so_hw_base_name, MFX_SO_BASE_NAME_LEN)) goto skip;\n        }\n        else\n        {\n            if (strncmp(dir_entries[i]->d_name, mfx_so_sw_base_name, MFX_SO_BASE_NAME_LEN)) goto skip;\n        }\n\n        for (p = &(dir_entries[i]->d_name[MFX_SO_BASE_NAME_LEN]); !b_skip && *p; ++p)\n        {\n            if ('.' == *p)\n            {\n                if (!p_major) p_major = p;\n                else if (!p_minor) p_minor = p;\n                else b_skip = true;\n            }\n            else if (!strchr(\"0123456789\", *p))\n            {\n                b_skip = true;\n            }\n        }\n        if (b_skip) goto skip;\n\n        if (!p_major || !p_minor) goto skip;\n        if (p_major != &(dir_entries[i]->d_name[MFX_SO_BASE_NAME_LEN])) goto skip;\n        ++p_major;\n        if (p_major == p_minor) goto skip;\n        ++p_minor;\n        if (!(*p_minor)) goto skip;\n\n        major = strtoul(p_major, NULL, 10);\n        minor = strtoul(p_minor, NULL, 10);\n        if ((major <= 0xFFFF) && (minor <= 0xFFFF))\n        {\n            struct mfx_libs* tmp_libs = NULL;\n            tmp_libs = (mfx_libs*)realloc(libs,\n                                          (libs_num+1)*sizeof(struct mfx_libs));\n            if (tmp_libs)\n            {\n                libs = tmp_libs;\n                strncpy(libs[libs_num].name, dir_entries[i]->d_name, MFX_MAX_REAL_LIBNAME);\n                libs[libs_num].name[MFX_MAX_REAL_LIBNAME] = 0;\n                libs[libs_num].version.Major = (mfxU16)major;\n                libs[libs_num].version.Minor = (mfxU16)minor;\n                ++libs_num;\n            }\n        }\n\n    skip:\n        free(dir_entries[i]);\n    }\n    if (entries_num) free(dir_entries);\n    if (p_libs) *p_libs = libs;\n    return libs_num;\n}\n\nnamespace MFX\n{\n\nmfxStatus SelectImplementationType(const mfxU32 adapterNum, mfxIMPL *pImplInterface, mfxU32 *pVendorID, mfxU32 *pDeviceID)\n{\n    mfx_disp_adapters* adapters = NULL;\n    int adapters_num = mfx_init_adapters(&adapters);\n    if (pVendorID && pDeviceID && adapterNum < adapters_num)\n    {\n        *pVendorID = adapters[adapterNum].vendor_id;\n        *pDeviceID = adapters[adapterNum].device_id;\n    }\n    if (adapters_num) free(adapters);\n\n    if (adapterNum >= adapters_num)\n        return MFX_ERR_UNSUPPORTED;\n\n    if ((*pImplInterface == MFX_IMPL_VIA_D3D9) ||\n        (*pImplInterface == MFX_IMPL_VIA_D3D11) )\n        return MFX_ERR_UNSUPPORTED;\n\n    *pImplInterface = MFX_IMPL_VIA_VAAPI;\n    return MFX_ERR_NONE;\n}\n\nMFXLibraryIterator::MFXLibraryIterator(void)\n{\n    m_implType = MFX_LIB_PSEUDO;\n\n    m_vendorID = 0;\n    m_deviceID = 0;\n\n    m_lastLibIndex = -1;\n\n    m_adapters = NULL;\n    m_adapters_num = mfx_init_adapters(&m_adapters);\n\n    m_path[0] = '\\0';\n    m_libs = NULL;\n    m_libs_num = 0;\n}\n\nMFXLibraryIterator::~MFXLibraryIterator(void)\n{\n    Release();\n    if (m_adapters_num) free(m_adapters);\n}\n\nvoid MFXLibraryIterator::Release(void)\n{\n    m_implType = MFX_LIB_PSEUDO;\n\n    m_vendorID = 0;\n    m_deviceID = 0;\n\n    m_lastLibIndex = -1;\n    if (m_libs)\n    {\n        free(m_libs);\n        m_libs = NULL;\n    }\n    m_libs_num = 0;\n}\n\nmfxStatus MFXLibraryIterator::Init(eMfxImplType implType, mfxIMPL impl, const mfxU32 adapter_num, int storageID)\n{\n    \/\/ release the object before initialization\n    Release();\n\n    \/\/ check error(s)\n    if (MFX_LIB_HARDWARE == implType)\n    {\n        if (!m_adapters_num || (adapter_num >= m_adapters_num))\n        {\n            return MFX_ERR_UNSUPPORTED;\n        }\n        m_vendorID = m_adapters[adapter_num].vendor_id;\n        m_deviceID = m_adapters[adapter_num].device_id;\n    }\n    else if (MFX_LIB_SOFTWARE != implType)\n    {\n        return MFX_ERR_UNSUPPORTED;\n    }\n    if (MFX_STORAGE_ID_OPT != storageID)\n    {\n        return MFX_ERR_UNSUPPORTED;\n    }\n\n    \/\/ set the required library's implementation type\n    m_implType = implType;\n\n    snprintf(m_path, sizeof(m_path)\/sizeof(m_path[0]),\"%s\/%s\", mfx_storage_opt, mfx_folder);\n\n    m_libs_num = mfx_list_libraries(m_path, (MFX_LIB_HARDWARE == implType), &m_libs);\n\n    if (!m_libs_num)\n    {\n        Release();\n        return MFX_ERR_UNSUPPORTED;\n    }\n\n    return MFX_ERR_NONE;\n}\n\nmfxStatus MFXLibraryIterator::SelectDLLVersion(char *pPath, size_t pathSize,\n                                               eMfxImplType* pImplType, mfxVersion minVersion)\n{\n    if (m_lastLibIndex < 0)\n    {\n        for (int i = m_libs_num - 1; i >= 0; i--)\n        {\n            if (m_libs[i].version.Major == minVersion.Major && m_libs[i].version.Minor >= minVersion.Minor)\n            {\n                    m_lastLibIndex = i;\n                    break;\n            }\n        }\n    }\n    else\n        m_lastLibIndex--;\n\n    if (m_lastLibIndex < 0)\n        return MFX_ERR_NOT_FOUND;\n\n    if (m_libs[m_lastLibIndex].version.Major != minVersion.Major ||\n        m_libs[m_lastLibIndex].version.Minor < minVersion.Minor)\n    {\n        m_lastLibIndex = -1;\n        return MFX_ERR_NOT_FOUND;\n    }\n\n    snprintf(pPath, pathSize, \"%s\/%s\", m_path, m_libs[m_lastLibIndex].name);\n\n    if (pImplType) *pImplType = (!m_vendorID && !m_deviceID)? MFX_LIB_SOFTWARE: MFX_LIB_HARDWARE;\n\n    return MFX_ERR_NONE;\n}\n\nmfxIMPL MFXLibraryIterator::GetImplementationType()\n{\n    mfxIMPL implInterface;\n    MFX::SelectImplementationType(0, &implInterface, NULL, NULL);\n    return implInterface;\n}\n\nbool MFXLibraryIterator::GetSubKeyName(msdk_disp_char *subKeyName, size_t length) const\n{\n    return false;\n}\n\n} \/\/ namespace MFX\n\n#endif \/\/ #if !defined(_WIN32) && !defined(_WIN64)\n<|endoftext|>"}
{"text":"<commit_before>\/* Copyright (c) 2011, Diego Souza                                                 *\/\n\/* All 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 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 <ORGANIZATION> 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\" AND *\/\n\/* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED   *\/\n\/* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE          *\/\n\/* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE    *\/\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#include <cstdlib>\n#include <lift\/list.h>\n#include <lift\/llist.h>\n#include <lift\/algo\/search.h>\n#include <UnitTest++.h>\n\nnamespace lift_test\n{\n\n  namespace algo_test\n  {\n\n    TEST(binary_search_should_return_the_index_of_the_element_when_such_exists)\n    {\n      gvalue_t *elem = gvalue_init_from_int(1);\n      \/\/ not efficient but any list will do it\n      list_t *ll = llist_init();\n\n      list_append(ll, gvalue_init_from_int(0));\n      list_append(ll, gvalue_init_from_int(1));\n      list_append(ll, gvalue_init_from_int(2));\n      list_append(ll, gvalue_init_from_int(3));\n      list_append(ll, gvalue_init_from_int(4));\n\n      CHECK(1 == binary_search(ll, elem));\n      llist_destroy(ll);\n      gvalue_destroy(elem);\n    }\n\n    TEST(binary_search_should_return_NOT_FOUND_if_the_element_is_not_on_the_list)\n    {\n      gvalue_t *elem = gvalue_init_from_int(4);\n      \/\/ not efficient but any list will do it\n      list_t *ll = llist_init();\n\n      list_append(ll, gvalue_init_from_int(0));\n      list_append(ll, gvalue_init_from_int(1));\n      list_append(ll, gvalue_init_from_int(2));\n      list_append(ll, gvalue_init_from_int(3));\n\n      CHECK(NOT_FOUND == binary_search(ll, elem));\n      llist_destroy(ll);\n      gvalue_destroy(elem);\n    }\n\n    TEST(binary_search_should_return_NOT_FOUND_when_the_list_is_empty)\n    {\n      gvalue_t *elem = gvalue_init_from_int(0);\n      \/\/ not efficient but any list will do it\n      list_t *ll = llist_init();\n\n      CHECK(NOT_FOUND == binary_search(ll, elem));\n      llist_destroy(ll);\n      gvalue_destroy(elem);\n    }\n\n    TEST(least_elem_on_the_entire_list_returns_the_minimum)\n    {\n      list_t *ll = llist_init();\n\n      list_append(ll, gvalue_init_from_int(0));\n      list_append(ll, gvalue_init_from_int(1));\n      list_append(ll, gvalue_init_from_int(2));\n      list_append(ll, gvalue_init_from_int(3));\n      list_append(ll, gvalue_init_from_int(4));\n\n      CHECK(list_head(ll) == least_elem(ll, list_head(ll), list_last(ll)));\n      llist_destroy(ll);\n    }\n\n    TEST(least_elem_on_the_empty_list_returns_NULL)\n    {\n      list_t *ll = llist_init();\n\n      CHECK(NULL == least_elem(ll, list_head(ll), list_last(ll)));\n      llist_destroy(ll);\n    }\n\n    TEST(greatest_elem_on_the_entire_list_returns_the_maximum)\n    {\n      list_t *ll = llist_init();\n\n      list_append(ll, gvalue_init_from_int(0));\n      list_append(ll, gvalue_init_from_int(1));\n      list_append(ll, gvalue_init_from_int(2));\n      list_append(ll, gvalue_init_from_int(3));\n      list_append(ll, gvalue_init_from_int(4));\n\n      CHECK(list_last(ll) == greatest_elem(ll, list_head(ll), list_last(ll)));\n      llist_destroy(ll);\n    }\n\n    TEST(greatest_elem_on_the_empty_list_returns_NULL)\n    {\n      list_t *ll = llist_init();\n\n      CHECK(NULL == greatest_elem(ll, list_head(ll), list_last(ll)));\n      llist_destroy(ll);\n    }\n  }\n\n}\n<commit_msg>testing least_elem and greatest_elem on unordered lists<commit_after>\/* Copyright (c) 2011, Diego Souza                                                 *\/\n\/* All 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 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 <ORGANIZATION> 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\" AND *\/\n\/* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED   *\/\n\/* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE          *\/\n\/* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE    *\/\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#include <cstdlib>\n#include <lift\/list.h>\n#include <lift\/llist.h>\n#include <lift\/algo\/search.h>\n#include <UnitTest++.h>\n\nnamespace lift_test\n{\n\n  namespace algo_test\n  {\n\n    TEST(binary_search_should_return_the_index_of_the_element_when_such_exists)\n    {\n      gvalue_t *elem = gvalue_init_from_int(1);\n      \/\/ not efficient but any list will do it\n      list_t *ll = llist_init();\n\n      list_append(ll, gvalue_init_from_int(0));\n      list_append(ll, gvalue_init_from_int(1));\n      list_append(ll, gvalue_init_from_int(2));\n      list_append(ll, gvalue_init_from_int(3));\n      list_append(ll, gvalue_init_from_int(4));\n\n      CHECK(1 == binary_search(ll, elem));\n      llist_destroy(ll);\n      gvalue_destroy(elem);\n    }\n\n    TEST(binary_search_should_return_NOT_FOUND_if_the_element_is_not_on_the_list)\n    {\n      gvalue_t *elem = gvalue_init_from_int(4);\n      \/\/ not efficient but any list will do it\n      list_t *ll = llist_init();\n\n      list_append(ll, gvalue_init_from_int(0));\n      list_append(ll, gvalue_init_from_int(1));\n      list_append(ll, gvalue_init_from_int(2));\n      list_append(ll, gvalue_init_from_int(3));\n\n      CHECK(NOT_FOUND == binary_search(ll, elem));\n      llist_destroy(ll);\n      gvalue_destroy(elem);\n    }\n\n    TEST(binary_search_should_return_NOT_FOUND_when_the_list_is_empty)\n    {\n      gvalue_t *elem = gvalue_init_from_int(0);\n      \/\/ not efficient but any list will do it\n      list_t *ll = llist_init();\n\n      CHECK(NOT_FOUND == binary_search(ll, elem));\n      llist_destroy(ll);\n      gvalue_destroy(elem);\n    }\n\n    TEST(least_elem_on_the_entire_list_returns_the_minimum)\n    {\n      list_t *ll = llist_init();\n\n      list_append(ll, gvalue_init_from_int(0));\n      list_append(ll, gvalue_init_from_int(1));\n      list_append(ll, gvalue_init_from_int(2));\n      list_append(ll, gvalue_init_from_int(3));\n      list_append(ll, gvalue_init_from_int(4));\n\n      CHECK(list_head(ll) == least_elem(ll, list_head(ll), list_last(ll)));\n      llist_destroy(ll);\n    }\n\n    TEST(least_elem_on_the_empty_list_returns_NULL)\n    {\n      list_t *ll = llist_init();\n\n      CHECK(NULL == least_elem(ll, list_head(ll), list_last(ll)));\n      llist_destroy(ll);\n    }\n\n    TEST(least_elem_on_unordered_list_also_returns_the_minimum)\n    {\n      list_t *ll = llist_init();\n\n      list_append(ll, gvalue_init_from_int(3));\n      list_append(ll, gvalue_init_from_int(4));\n      list_append(ll, gvalue_init_from_int(1));\n      list_append(ll, gvalue_init_from_int(0));\n      list_append(ll, gvalue_init_from_int(2));\n\n      CHECK(list_prev(ll, list_last(ll)) == least_elem(ll, list_head(ll), list_last(ll)));\n      llist_destroy(ll);\n    }\n\n    TEST(greatest_elem_on_the_entire_list_returns_the_maximum)\n    {\n      list_t *ll = llist_init();\n\n      list_append(ll, gvalue_init_from_int(0));\n      list_append(ll, gvalue_init_from_int(1));\n      list_append(ll, gvalue_init_from_int(2));\n      list_append(ll, gvalue_init_from_int(3));\n      list_append(ll, gvalue_init_from_int(4));\n\n      CHECK(list_last(ll) == greatest_elem(ll, list_head(ll), list_last(ll)));\n      llist_destroy(ll);\n    }\n\n    TEST(greatest_elem_on_unordered_list_also_returns_the_maximum)\n    {\n      list_t *ll = llist_init();\n\n      list_append(ll, gvalue_init_from_int(3));\n      list_append(ll, gvalue_init_from_int(4));\n      list_append(ll, gvalue_init_from_int(1));\n      list_append(ll, gvalue_init_from_int(0));\n      list_append(ll, gvalue_init_from_int(2));\n\n      CHECK(list_next(ll, list_head(ll)) == greatest_elem(ll, list_head(ll), list_last(ll)));\n      llist_destroy(ll);\n    }\n\n    TEST(greatest_elem_on_the_empty_list_returns_NULL)\n    {\n      list_t *ll = llist_init();\n\n      CHECK(NULL == greatest_elem(ll, list_head(ll), list_last(ll)));\n      llist_destroy(ll);\n    }\n  }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright 2010-2012 RethinkDB, all rights reserved.\n#include \"containers\/uuid.hpp\"\n\n#include <sys\/stat.h>\n#include <string.h>\n#include <fcntl.h>\n#include <openssl\/sha.h>\n\n#include \"errors.hpp\"\n#define BOOST_UUID_NO_TYPE_TRAITS\n#include <boost\/uuid\/uuid.hpp>\n#include <boost\/uuid\/uuid_generators.hpp>\n#include <boost\/uuid\/uuid_io.hpp>\n\n#include \"containers\/printf_buffer.hpp\"\n\n#include \"utils.hpp\"\n#include \"thread_local.hpp\"\n\nstatic const char *const magic_unset_uuid = \"UNSET_UUID_____\";\nuuid_t::uuid_t() {\n    rassert(strlen(magic_unset_uuid) == kStaticSize-1);\n    memcpy(data_, magic_unset_uuid, kStaticSize);\n}\nbool uuid_t::is_unset() const {\n    return !memcmp(data_, magic_unset_uuid, kStaticSize);\n}\n\nbool uuid_t::is_nil() const {\n    for (size_t i = 0; i < kStaticSize; ++i) {\n        if (data_[i] != 0) return false;\n    }\n    return true;\n}\n\nbool operator==(const uuid_t& x, const uuid_t& y) {\n    return memcmp(x.data(), y.data(), uuid_t::static_size()) == 0;\n}\n\nbool operator<(const uuid_t& x, const uuid_t& y) {\n    return memcmp(x.data(), y.data(), uuid_t::static_size()) < 0;\n}\n\nuuid_t from_boost_uuid(const boost::uuids::uuid& uuid) {\n    CT_ASSERT(sizeof(uuid_t) == sizeof(boost::uuids::uuid));\n\n    uuid_t ret;\n    memcpy(ret.data(), uuid.data, uuid_t::static_size());\n    return ret;\n}\n\nboost::uuids::uuid as_boost_uuid(const uuid_t& uuid) {\n    boost::uuids::uuid ret;\n    memcpy(ret.data, uuid.data(), uuid_t::static_size());\n    return ret;\n}\n\nstatic __thread bool next_uuid_initialized = false;\nstatic __thread uint8_t next_uuid[uuid_t::kStaticSize];\n\nuuid_t get_and_increment_uuid() {\n    uuid_t result;\n\n    \/\/ Copy over the next_uuid buffer\n    uint8_t *result_buffer = result.data();\n    memcpy(result_buffer, next_uuid, uuid_t::static_size());\n\n    \/\/ Increment the next_uuid buffer\n    bool carry = true;\n    for (size_t i = uuid_t::static_size(); carry && i > 0; --i) {\n        next_uuid[i - 1] = next_uuid[i - 1] + 1;\n        carry = (next_uuid[i - 1] == 0);\n    }\n\n    return result;\n}\n\n\/\/ TODO(sam):  Make sure this isn't messed up somehow.\nvoid hash_uuid(uuid_t *uuid) {\n    CT_ASSERT(SHA_DIGEST_LENGTH >= uuid_t::kStaticSize);\n    uint8_t output_buffer[SHA_DIGEST_LENGTH];\n    SHA_CTX ctx;\n\n    \/\/ SHA-1 hash the UUID\n    guarantee(SHA1_Init(&ctx) == 1);\n    guarantee(SHA1_Update(&ctx, uuid->data(), uuid_t::static_size()) == 1);\n    guarantee(SHA1_Final(output_buffer, &ctx) == 1);\n\n    \/\/ Set some bits to obey standard for version 4 UUIDs.\n    output_buffer[6] = ((output_buffer[6] & 0x0f) | 0x40);\n    output_buffer[8] = ((output_buffer[8] & 0x3f) | 0x80);\n\n    \/\/ Copy the beginning of the hash into our uuid\n    memcpy(uuid->data(), output_buffer, uuid_t::static_size());\n}\n\nvoid initialize_dev_random_uuid() {\n    int random_fd = open(\"\/dev\/urandom\", O_RDONLY);\n    guarantee(random_fd != -1);\n    ssize_t readres = read(random_fd, next_uuid, uuid_t::static_size());\n    guarantee(readres == static_cast<ssize_t>(uuid_t::static_size()));\n    close(random_fd);\n}\n\nuuid_t generate_uuid() {\n    if (!next_uuid_initialized) {\n        initialize_dev_random_uuid();\n        next_uuid_initialized = true;\n    }\n    uuid_t result = get_and_increment_uuid();\n    hash_uuid(&result);\n    return result;\n}\n\nuuid_t nil_uuid() {\n    uuid_t ret;\n    memset(ret.data(), 0, uuid_t::static_size());\n    return ret;\n}\n\nvoid debug_print(append_only_printf_buffer_t *buf, const uuid_t& id) {\n    buf->appendf(\"%s\", uuid_to_str(id).c_str());\n}\n\nvoid push_hex(std::string *s, uint8_t byte) {\n    const char *buf = \"0123456789abcdef\";\n    s->push_back(buf[byte >> 4]);\n    s->push_back(buf[byte & 0x0f]);\n}\n\nstd::string uuid_to_str(uuid_t id) {\n    const uint8_t *data = id.data();\n\n    std::string ret;\n    ret.reserve(uuid_t::kStringSize);\n    size_t i = 0;\n    for (; i < 4; ++i) {\n        push_hex(&ret, data[i]);\n    }\n    ret.push_back('-');\n    for (; i < 6; ++i) {\n        push_hex(&ret, data[i]);\n    }\n    ret.push_back('-');\n    for (; i < 8; ++i) {\n        push_hex(&ret, data[i]);\n    }\n    ret.push_back('-');\n    for (; i < 10; ++i) {\n        push_hex(&ret, data[i]);\n    }\n    ret.push_back('-');\n    CT_ASSERT(uuid_t::kStaticSize == 16);  \/\/ This code just feels this assertion in its bones.\n    for (; i < uuid_t::kStaticSize; ++i) {\n        push_hex(&ret, data[i]);\n    }\n\n    return ret;\n}\n\nuuid_t str_to_uuid(const std::string &uuid) {\n    return from_boost_uuid(boost::uuids::string_generator()(uuid));\n}\n\nMUST_USE bool from_hexdigit(int ch, int *out) {\n    if (isdigit(ch)) {\n        *out = ch - '0';\n        return true;\n    }\n    ch = tolower(ch);\n    if ('a' <= ch && ch <= 'f') {  \/\/ Death to EBCDIC.\n        *out = 10 + (ch - 'a');\n        return true;\n    }\n    return false;\n}\n\nMUST_USE bool str_to_uuid(const std::string &str, uuid_t *uuid) {\n    if (str.size() != uuid_t::kStaticSize * 2 + 4) {\n        return false;\n    }\n\n    uint8_t *data = uuid->data();\n\n    size_t j = 0;\n    for (size_t i = 0; i < uuid_t::kStaticSize; ++i) {\n        \/\/ Uh oh.. a for\/switch loop!\n        switch (i) {\n        case 4:\n        case 6:\n        case 8:\n        case 10:\n            rassert(j < uuid_t::kStringSize);\n            if (str[j] != '-') {\n                return false;\n            }\n            ++j;\n            \/\/ fall through\n        default: {\n            rassert(j < uuid_t::kStringSize);\n            int high;\n            if (!from_hexdigit(str[j], &high)) {\n                return false;\n            }\n            ++j;\n            rassert(j < uuid_t::kStringSize);\n            int low;\n            if (!from_hexdigit(str[j], &low)) {\n                return false;\n            }\n            ++j;\n            data[i] = ((high << 4) | low);\n        } break;\n        }\n    }\n\n    rassert(j == uuid_t::kStringSize);\n    return true;\n}\n\nbool is_uuid(const std::string& str) {\n    try {\n        str_to_uuid(str);\n    } catch (...) {\n        return false;\n    }\n    return true;\n}\n<commit_msg>Made old exception-throwing str_to_uuid function not use boost.<commit_after>\/\/ Copyright 2010-2012 RethinkDB, all rights reserved.\n#include \"containers\/uuid.hpp\"\n\n#include <sys\/stat.h>\n#include <string.h>\n#include <fcntl.h>\n#include <openssl\/sha.h>\n\n#include \"errors.hpp\"\n#define BOOST_UUID_NO_TYPE_TRAITS\n#include <boost\/uuid\/uuid.hpp>\n#include <boost\/uuid\/uuid_generators.hpp>\n#include <boost\/uuid\/uuid_io.hpp>\n\n#include \"containers\/printf_buffer.hpp\"\n\n#include \"utils.hpp\"\n#include \"thread_local.hpp\"\n\nstatic const char *const magic_unset_uuid = \"UNSET_UUID_____\";\nuuid_t::uuid_t() {\n    rassert(strlen(magic_unset_uuid) == kStaticSize-1);\n    memcpy(data_, magic_unset_uuid, kStaticSize);\n}\nbool uuid_t::is_unset() const {\n    return !memcmp(data_, magic_unset_uuid, kStaticSize);\n}\n\nbool uuid_t::is_nil() const {\n    for (size_t i = 0; i < kStaticSize; ++i) {\n        if (data_[i] != 0) return false;\n    }\n    return true;\n}\n\nbool operator==(const uuid_t& x, const uuid_t& y) {\n    return memcmp(x.data(), y.data(), uuid_t::static_size()) == 0;\n}\n\nbool operator<(const uuid_t& x, const uuid_t& y) {\n    return memcmp(x.data(), y.data(), uuid_t::static_size()) < 0;\n}\n\nuuid_t from_boost_uuid(const boost::uuids::uuid& uuid) {\n    CT_ASSERT(sizeof(uuid_t) == sizeof(boost::uuids::uuid));\n\n    uuid_t ret;\n    memcpy(ret.data(), uuid.data, uuid_t::static_size());\n    return ret;\n}\n\nboost::uuids::uuid as_boost_uuid(const uuid_t& uuid) {\n    boost::uuids::uuid ret;\n    memcpy(ret.data, uuid.data(), uuid_t::static_size());\n    return ret;\n}\n\nstatic __thread bool next_uuid_initialized = false;\nstatic __thread uint8_t next_uuid[uuid_t::kStaticSize];\n\nuuid_t get_and_increment_uuid() {\n    uuid_t result;\n\n    \/\/ Copy over the next_uuid buffer\n    uint8_t *result_buffer = result.data();\n    memcpy(result_buffer, next_uuid, uuid_t::static_size());\n\n    \/\/ Increment the next_uuid buffer\n    bool carry = true;\n    for (size_t i = uuid_t::static_size(); carry && i > 0; --i) {\n        next_uuid[i - 1] = next_uuid[i - 1] + 1;\n        carry = (next_uuid[i - 1] == 0);\n    }\n\n    return result;\n}\n\n\/\/ TODO(sam):  Make sure this isn't messed up somehow.\nvoid hash_uuid(uuid_t *uuid) {\n    CT_ASSERT(SHA_DIGEST_LENGTH >= uuid_t::kStaticSize);\n    uint8_t output_buffer[SHA_DIGEST_LENGTH];\n    SHA_CTX ctx;\n\n    \/\/ SHA-1 hash the UUID\n    guarantee(SHA1_Init(&ctx) == 1);\n    guarantee(SHA1_Update(&ctx, uuid->data(), uuid_t::static_size()) == 1);\n    guarantee(SHA1_Final(output_buffer, &ctx) == 1);\n\n    \/\/ Set some bits to obey standard for version 4 UUIDs.\n    output_buffer[6] = ((output_buffer[6] & 0x0f) | 0x40);\n    output_buffer[8] = ((output_buffer[8] & 0x3f) | 0x80);\n\n    \/\/ Copy the beginning of the hash into our uuid\n    memcpy(uuid->data(), output_buffer, uuid_t::static_size());\n}\n\nvoid initialize_dev_random_uuid() {\n    int random_fd = open(\"\/dev\/urandom\", O_RDONLY);\n    guarantee(random_fd != -1);\n    ssize_t readres = read(random_fd, next_uuid, uuid_t::static_size());\n    guarantee(readres == static_cast<ssize_t>(uuid_t::static_size()));\n    close(random_fd);\n}\n\nuuid_t generate_uuid() {\n    if (!next_uuid_initialized) {\n        initialize_dev_random_uuid();\n        next_uuid_initialized = true;\n    }\n    uuid_t result = get_and_increment_uuid();\n    hash_uuid(&result);\n    return result;\n}\n\nuuid_t nil_uuid() {\n    uuid_t ret;\n    memset(ret.data(), 0, uuid_t::static_size());\n    return ret;\n}\n\nvoid debug_print(append_only_printf_buffer_t *buf, const uuid_t& id) {\n    buf->appendf(\"%s\", uuid_to_str(id).c_str());\n}\n\nvoid push_hex(std::string *s, uint8_t byte) {\n    const char *buf = \"0123456789abcdef\";\n    s->push_back(buf[byte >> 4]);\n    s->push_back(buf[byte & 0x0f]);\n}\n\nstd::string uuid_to_str(uuid_t id) {\n    const uint8_t *data = id.data();\n\n    std::string ret;\n    ret.reserve(uuid_t::kStringSize);\n    size_t i = 0;\n    for (; i < 4; ++i) {\n        push_hex(&ret, data[i]);\n    }\n    ret.push_back('-');\n    for (; i < 6; ++i) {\n        push_hex(&ret, data[i]);\n    }\n    ret.push_back('-');\n    for (; i < 8; ++i) {\n        push_hex(&ret, data[i]);\n    }\n    ret.push_back('-');\n    for (; i < 10; ++i) {\n        push_hex(&ret, data[i]);\n    }\n    ret.push_back('-');\n    CT_ASSERT(uuid_t::kStaticSize == 16);  \/\/ This code just feels this assertion in its bones.\n    for (; i < uuid_t::kStaticSize; ++i) {\n        push_hex(&ret, data[i]);\n    }\n\n    return ret;\n}\n\nuuid_t str_to_uuid(const std::string &uuid) {\n    uuid_t ret;\n    if (str_to_uuid(uuid, &ret)) {\n        return ret;\n    } else {\n        throw std::runtime_error(\"invalid uuid\");  \/\/ Sigh.\n    }\n}\n\nMUST_USE bool from_hexdigit(int ch, int *out) {\n    if (isdigit(ch)) {\n        *out = ch - '0';\n        return true;\n    }\n    ch = tolower(ch);\n    if ('a' <= ch && ch <= 'f') {  \/\/ Death to EBCDIC.\n        *out = 10 + (ch - 'a');\n        return true;\n    }\n    return false;\n}\n\nMUST_USE bool str_to_uuid(const std::string &str, uuid_t *uuid) {\n    if (str.size() != uuid_t::kStaticSize * 2 + 4) {\n        return false;\n    }\n\n    uint8_t *data = uuid->data();\n\n    size_t j = 0;\n    for (size_t i = 0; i < uuid_t::kStaticSize; ++i) {\n        \/\/ Uh oh.. a for\/switch loop!\n        switch (i) {\n        case 4:\n        case 6:\n        case 8:\n        case 10:\n            rassert(j < uuid_t::kStringSize);\n            if (str[j] != '-') {\n                return false;\n            }\n            ++j;\n            \/\/ fall through\n        default: {\n            rassert(j < uuid_t::kStringSize);\n            int high;\n            if (!from_hexdigit(str[j], &high)) {\n                return false;\n            }\n            ++j;\n            rassert(j < uuid_t::kStringSize);\n            int low;\n            if (!from_hexdigit(str[j], &low)) {\n                return false;\n            }\n            ++j;\n            data[i] = ((high << 4) | low);\n        } break;\n        }\n    }\n\n    rassert(j == uuid_t::kStringSize);\n    return true;\n}\n\nbool is_uuid(const std::string& str) {\n    try {\n        str_to_uuid(str);\n    } catch (...) {\n        return false;\n    }\n    return true;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * @file statistic.hpp\n *\n * Definition of the policy type for the statistic class.\n *\n * You should define your own statistic that looks like EmptyStatistic.\n *\/\n\n#ifndef __MLPACK_CORE_TREE_STATISTIC_HPP\n#define __MLPACK_CORE_TREE_STATISTIC_HPP\n\nnamespace mlpack {\nnamespace tree {\n\n\/**\n * Empty statistic if you are not interested in storing statistics in your\n * tree.  Use this as a template for your own.\n *\/\nclass EmptyStatistic\n{\n  public:\n    EmptyStatistic() {}\n    ~EmptyStatistic() {}\n\n    \/**\n     * This constructor is called when a leaf is created.\n     *\n     * @param dataset Matrix that the tree is being built on.\n     * @param begin Starting index corresponding to this leaf.\n     * @param count Number of points held in this leaf.\n     *\/\n    template<typename MatType>\n    EmptyStatistic(const MatType& \/* dataset *\/,\n                   const size_t \/* begin *\/,\n                   const size_t \/* count *\/)\n    { }\n\n    \/**\n     * This constructor is called when a non-leaf node is created.\n     * This lets you build fast bottom-up statistics when building trees.\n     *\n     * @param dataset Matrix that the tree is being built on.\n     * @param begin Starting index corresponding to this leaf.\n     * @param count Number of points held in this leaf.\n     * @param leftStat EmptyStatistic object of the left child node.\n     * @param rightStat EmptyStatistic object of the right child node.\n     *\/\n    template<typename MatType>\n    EmptyStatistic(const MatType& \/* dataset *\/,\n                   const size_t \/* start *\/,\n                   const size_t \/* count *\/,\n                   const EmptyStatistic& \/* leftStat *\/,\n                   const EmptyStatistic& \/* rightStat *\/)\n    { }\n  public:\n    \/**\n     * Returns a string representation of this object.\n     *\/\n    std::string ToString() const\n    {\n      std::stringstream convert;\n      convert << \"EmptyStatistic [\" << this << \"]\" << std::endl;\n      return convert.str();\n    }\n};\n\n}; \/\/ namespace tree\n}; \/\/ namespace mlpack\n\n#endif \/\/ __MLPACK_CORE_TREE_STATISTIC_HPP\n<commit_msg>Simplify constructors; we don't use any of the odd ones.<commit_after>\/**\n * @file statistic.hpp\n *\n * Definition of the policy type for the statistic class.\n *\n * You should define your own statistic that looks like EmptyStatistic.\n *\/\n\n#ifndef __MLPACK_CORE_TREE_STATISTIC_HPP\n#define __MLPACK_CORE_TREE_STATISTIC_HPP\n\nnamespace mlpack {\nnamespace tree {\n\n\/**\n * Empty statistic if you are not interested in storing statistics in your\n * tree.  Use this as a template for your own.\n *\/\nclass EmptyStatistic\n{\n  public:\n    EmptyStatistic() { }\n    ~EmptyStatistic() { }\n\n    \/**\n     * This constructor is called when a node is finished being created.  The\n     * node is finished, and its children are finished, but it is not\n     * necessarily true that the statistics of other nodes are initialized yet.\n     *\n     * @param node Node which this corresponds to.\n     *\/\n    template<typename TreeType>\n    EmptyStatistic(TreeType& \/* node *\/) { }\n\n  public:\n    \/**\n     * Returns a string representation of this object.\n     *\/\n    std::string ToString() const\n    {\n      std::stringstream convert;\n      convert << \"EmptyStatistic [\" << this << \"]\" << std::endl;\n      return convert.str();\n    }\n};\n\n}; \/\/ namespace tree\n}; \/\/ namespace mlpack\n\n#endif \/\/ __MLPACK_CORE_TREE_STATISTIC_HPP\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * Performance test: logistic.\n * \n * This test runs a simple logistic model 100 times with a fixed\n * seed. The test records to a csv file information about the current\n * build, whether the values match the expected known values, whether\n * values are identical between runs, and the runtime in seconds for\n * each of the 100 individual runs.\n * \n * The output file is a csv file located at\n * test\/performance\/performance.csv.  If the file is empty, a header\n * line will be written.  If the file is not empty and the header line\n * of the file matches, a data row will be appended.  If the file is\n * not empty and the header line is different, a header row and a data\n * row will be appended.\n * \n * Below are the test routines in this test.\n * 1. run: Runs the model 100 times. This test should always\n *    succeed. Test failure indicates that the model could not be run.\n * 2. values_from_tagged_version: Compares the first run's final\n *    iteration against known values. Test will succeed if the values\n *    match the known values; the test will fail otherwise.\n * 3. values_same_run_to_run: Compares the first run's final iteration\n *    against all runs' final iterations. Test will succeed if all the \n *    values match; the test will fail otherwise.\n * 4. write_results_to_disk: Writes the results to disk. Test will\n *    succeed if writing to an empty file or to one with a matching\n *    header; the test will fail if the header in the existing file\n *    does not match the current header.\n *\n * Note: the values_from_tagged_version will need to be updated\n * if Stan's RNG changes, the seeding mechanism changes, or the\n * algorithm changes. The other routines should be fine.\n *\n * Each run of this test produces a single, csv row with 106 columns\n * in the output file:\n *   1. current date. Formatted using std::ctime: \"Www Mmm dd hh:mm:ss yyyy\"\n *   2. git hash. The current 40-character SHA-1 git hash or \"NA\".\n *   3. git date. The date of the last commit or \"NA\".\n *   4. model name. \"logistic\"\n *   5. matches tagged version. Either \"yes\" or \"no\".\n *   6. all values the same. Either \"yes\" or \"no\".\n *   7--106. run time (in seconds).\n *\/\n\n#include <gtest\/gtest.h>\n#include <test\/test-models\/performance\/logistic.hpp>\n#include <stan\/version.hpp>\n#include <ctime>\n#include <test\/performance\/utility.hpp>\n#include <boost\/algorithm\/string\/trim.hpp>\n\n\nclass performance : public ::testing::Test {\npublic:\n  static void SetUpTestCase() {\n    N = 2;\n    seconds_per_run.resize(N);\n    last_draws_per_run.resize(N);\n    matches_tagged_version = false;\n    all_values_same = false;\n  }\n\n  static int N;\n  static std::vector<double> seconds_per_run;\n  static std::vector<std::vector<double> > last_draws_per_run;\n  static bool matches_tagged_version;\n  static bool all_values_same;\n};\n\nint performance::N;\nstd::vector<double> performance::seconds_per_run;\nstd::vector<std::vector<double> > performance::last_draws_per_run;\nbool performance::matches_tagged_version;\nbool performance::all_values_same;\n\n\nusing stan::test::performance::run_command_output;\nusing stan::test::performance::run_command;\nusing stan::test::performance::get_last_iteration_from_file;\nusing stan::test::performance::quote;\nusing stan::test::performance::get_git_hash;\nusing stan::test::performance::get_git_date;\nusing stan::test::performance::get_date;\n\nTEST_F(performance, run) {\n  clock_t t;\n  for (int n = 0; n < N; ++n) {\n    std::cout << \"iteration: \" << n << \" \/ \" << N << std::endl;\n    t = clock();      \/\/ start timer\n    stan::test::performance::command<stan_model>(1000,\n                                                 10000,\n                                                 \"src\/test\/test-models\/performance\/logistic.data.R\",\n                                                 \"test\/performance\/logistic_output.csv\",\n                                                 0U);\n    t = clock() - t;  \/\/ end timer\n    seconds_per_run[n] = static_cast<double>(t) \/ CLOCKS_PER_SEC; \n    last_draws_per_run[n] \n      = get_last_iteration_from_file(\"test\/performance\/logistic_output.csv\");\n  }\n  SUCCEED();\n}\n\n\/\/ evaluate\nTEST_F(performance, values_from_tagged_version) {\n  int N_values = 8;\n  ASSERT_EQ(N_values, last_draws_per_run[0].size())\n    << \"last tagged version, 2.5.0, had \" << N_values << \" elements\";\n  \n  std::vector<double> first_run = last_draws_per_run[0];\n  EXPECT_FLOAT_EQ(-65.9431, first_run[0])\n    << \"lp__: index 0\";\n\n  EXPECT_FLOAT_EQ(0.99914801, first_run[1])\n    << \"accept_stat__: index 1\";\n\n  EXPECT_FLOAT_EQ(0.92122698, first_run[2])\n    << \"stepsize__: index 2\";\n\n  EXPECT_FLOAT_EQ(3, first_run[3])\n    << \"treedepth__: index 3\";\n\n  EXPECT_FLOAT_EQ(7, first_run[4])\n    << \"n_leapfrog__: index 4\";\n\n  EXPECT_FLOAT_EQ(0, first_run[5])\n    << \"n_divergent__: index 5\";\n\n  EXPECT_FLOAT_EQ(1.4754699, first_run[6])\n    << \"beta.1: index 6\";\n\n  EXPECT_FLOAT_EQ(-0.79085201, first_run[7])\n    << \"beta.2: index 7\";\n  \n  matches_tagged_version = !HasNonfatalFailure();\n}\n\nTEST_F(performance, values_same_run_to_run) {\n  int N_values = last_draws_per_run[0].size();\n  \n  for (int i = 0; i < N_values; i++) {\n    double expected_value = last_draws_per_run[0][i];\n    for (int n = 1; n < N; n++) {\n      EXPECT_FLOAT_EQ(expected_value, last_draws_per_run[n][i])\n        << \"expecting run to run values to be the same. Found run \"\n        << n << \" to have different values than the 0th run for \"\n        << \"index: \" << i;\n    }\n  }\n  all_values_same = !HasNonfatalFailure();\n}\n\nTEST_F(performance, check_output_is_same) {\n  std::ifstream file_stream;\n  file_stream.open(\"test\/performance\/logistic_output.csv\", \n                   std::ios_base::in);\n  ASSERT_TRUE(file_stream.good());\n\n  std::string line, expected;\n\n  getline(file_stream, line);\n  expected = \"# stan_version_major = \" + stan::MAJOR_VERSION; \n  ASSERT_EQ(expected, line);\n  ASSERT_TRUE(file_stream.good());\n\n\n  getline(file_stream, line);\n  expected = \"# stan_version_minor = \" + stan::MINOR_VERSION; \n  ASSERT_EQ(expected, line);\n  ASSERT_TRUE(file_stream.good());\n\n  getline(file_stream, line);\n  expected = \"# stan_version_patch = \" + stan::PATCH_VERSION; \n  ASSERT_EQ(expected, line);\n  ASSERT_TRUE(file_stream.good());\n\n  getline(file_stream, line);\n  ASSERT_EQ(\"# model = logistic_model\", line);\n  ASSERT_TRUE(file_stream.good());\n\n  getline(file_stream, line);\n  ASSERT_EQ(\"lp__,accept_stat__,stepsize__,treedepth__,n_leapfrog__,n_divergent__,beta.1,beta.2\", line);\n  ASSERT_TRUE(file_stream.good());\n\n  getline(file_stream, line);\n  ASSERT_EQ(\"# Adaptation terminated\", line);\n  ASSERT_TRUE(file_stream.good());\n\n  file_stream.close();\n}\n\nTEST_F(performance, write_results_to_disk) {\n  std::stringstream header;\n  std::stringstream line;\n\n  \/\/ current date \/ time\n  header << quote(\"date\");\n  line << quote(get_date());\n  \n  \/\/ git hash\n  header << \",\" << quote(\"git hash\") << \",\" << quote(\"git date\");\n  line << \",\" << quote(get_git_hash()) << \",\" << quote(get_git_date());\n\n  \/\/ model name: \"logistic\"\n  header << \",\" << quote(\"model name\");\n  line << \",\" << quote(\"logistic\");\n\n  \/\/ matches tagged values\n  header << \",\" << quote(\"matches tagged version\");\n  line << \",\" << quote(matches_tagged_version ? \"yes\" : \"no\");\n  \n  \/\/ all values same\n  header << \",\" << quote(\"all values same\");\n  line << \",\" << quote(all_values_same ? \"yes\" : \"no\");\n\n  \/\/ N times\n  for (int n = 0; n < N; n++) {\n    std::stringstream ss;\n    ss << \"run \" << n+1;\n    header << \",\" << quote(ss.str());\n    line << \",\" << seconds_per_run[n];\n  }\n\n\n  \/\/ append output to: test\/performance\/performance.csv\n  bool write_header = false;\n  std::fstream file_stream;\n  \n  file_stream.open(\"test\/performance\/performance.csv\", \n                   std::ios_base::in);\n  if (file_stream.peek() == std::fstream::traits_type::eof()) {\n    write_header = true;\n  } else {\n    std::string file_header;\n    std::getline(file_stream, file_header);\n    \n    EXPECT_EQ(file_header, header.str()) \n      << \"header of file is different\";\n    if (file_header != header.str())\n      write_header = true;\n  }\n  file_stream.close();\n\n  file_stream.open(\"test\/performance\/performance.csv\",\n                   std::ios_base::app);\n  if (write_header)\n    file_stream << header.str() << std::endl;\n  file_stream << line.str() << std::endl;\n  file_stream.close();\n}\n<commit_msg>Setting number of runs back to 100<commit_after>\/**\n * Performance test: logistic.\n * \n * This test runs a simple logistic model 100 times with a fixed\n * seed. The test records to a csv file information about the current\n * build, whether the values match the expected known values, whether\n * values are identical between runs, and the runtime in seconds for\n * each of the 100 individual runs.\n * \n * The output file is a csv file located at\n * test\/performance\/performance.csv.  If the file is empty, a header\n * line will be written.  If the file is not empty and the header line\n * of the file matches, a data row will be appended.  If the file is\n * not empty and the header line is different, a header row and a data\n * row will be appended.\n * \n * Below are the test routines in this test.\n * 1. run: Runs the model 100 times. This test should always\n *    succeed. Test failure indicates that the model could not be run.\n * 2. values_from_tagged_version: Compares the first run's final\n *    iteration against known values. Test will succeed if the values\n *    match the known values; the test will fail otherwise.\n * 3. values_same_run_to_run: Compares the first run's final iteration\n *    against all runs' final iterations. Test will succeed if all the \n *    values match; the test will fail otherwise.\n * 4. write_results_to_disk: Writes the results to disk. Test will\n *    succeed if writing to an empty file or to one with a matching\n *    header; the test will fail if the header in the existing file\n *    does not match the current header.\n *\n * Note: the values_from_tagged_version will need to be updated\n * if Stan's RNG changes, the seeding mechanism changes, or the\n * algorithm changes. The other routines should be fine.\n *\n * Each run of this test produces a single, csv row with 106 columns\n * in the output file:\n *   1. current date. Formatted using std::ctime: \"Www Mmm dd hh:mm:ss yyyy\"\n *   2. git hash. The current 40-character SHA-1 git hash or \"NA\".\n *   3. git date. The date of the last commit or \"NA\".\n *   4. model name. \"logistic\"\n *   5. matches tagged version. Either \"yes\" or \"no\".\n *   6. all values the same. Either \"yes\" or \"no\".\n *   7--106. run time (in seconds).\n *\/\n\n#include <gtest\/gtest.h>\n#include <test\/test-models\/performance\/logistic.hpp>\n#include <stan\/version.hpp>\n#include <ctime>\n#include <test\/performance\/utility.hpp>\n#include <boost\/algorithm\/string\/trim.hpp>\n\n\nclass performance : public ::testing::Test {\npublic:\n  static void SetUpTestCase() {\n    N = 100;\n    seconds_per_run.resize(N);\n    last_draws_per_run.resize(N);\n    matches_tagged_version = false;\n    all_values_same = false;\n  }\n\n  static int N;\n  static std::vector<double> seconds_per_run;\n  static std::vector<std::vector<double> > last_draws_per_run;\n  static bool matches_tagged_version;\n  static bool all_values_same;\n};\n\nint performance::N;\nstd::vector<double> performance::seconds_per_run;\nstd::vector<std::vector<double> > performance::last_draws_per_run;\nbool performance::matches_tagged_version;\nbool performance::all_values_same;\n\n\nusing stan::test::performance::run_command_output;\nusing stan::test::performance::run_command;\nusing stan::test::performance::get_last_iteration_from_file;\nusing stan::test::performance::quote;\nusing stan::test::performance::get_git_hash;\nusing stan::test::performance::get_git_date;\nusing stan::test::performance::get_date;\n\nTEST_F(performance, run) {\n  clock_t t;\n  for (int n = 0; n < N; ++n) {\n    std::cout << \"iteration: \" << n << \" \/ \" << N << std::endl;\n    t = clock();      \/\/ start timer\n    stan::test::performance::command<stan_model>(1000,\n                                                 10000,\n                                                 \"src\/test\/test-models\/performance\/logistic.data.R\",\n                                                 \"test\/performance\/logistic_output.csv\",\n                                                 0U);\n    t = clock() - t;  \/\/ end timer\n    seconds_per_run[n] = static_cast<double>(t) \/ CLOCKS_PER_SEC; \n    last_draws_per_run[n] \n      = get_last_iteration_from_file(\"test\/performance\/logistic_output.csv\");\n  }\n  SUCCEED();\n}\n\n\/\/ evaluate\nTEST_F(performance, values_from_tagged_version) {\n  int N_values = 8;\n  ASSERT_EQ(N_values, last_draws_per_run[0].size())\n    << \"last tagged version, 2.5.0, had \" << N_values << \" elements\";\n  \n  std::vector<double> first_run = last_draws_per_run[0];\n  EXPECT_FLOAT_EQ(-65.9431, first_run[0])\n    << \"lp__: index 0\";\n\n  EXPECT_FLOAT_EQ(0.99914801, first_run[1])\n    << \"accept_stat__: index 1\";\n\n  EXPECT_FLOAT_EQ(0.92122698, first_run[2])\n    << \"stepsize__: index 2\";\n\n  EXPECT_FLOAT_EQ(3, first_run[3])\n    << \"treedepth__: index 3\";\n\n  EXPECT_FLOAT_EQ(7, first_run[4])\n    << \"n_leapfrog__: index 4\";\n\n  EXPECT_FLOAT_EQ(0, first_run[5])\n    << \"n_divergent__: index 5\";\n\n  EXPECT_FLOAT_EQ(1.4754699, first_run[6])\n    << \"beta.1: index 6\";\n\n  EXPECT_FLOAT_EQ(-0.79085201, first_run[7])\n    << \"beta.2: index 7\";\n  \n  matches_tagged_version = !HasNonfatalFailure();\n}\n\nTEST_F(performance, values_same_run_to_run) {\n  int N_values = last_draws_per_run[0].size();\n  \n  for (int i = 0; i < N_values; i++) {\n    double expected_value = last_draws_per_run[0][i];\n    for (int n = 1; n < N; n++) {\n      EXPECT_FLOAT_EQ(expected_value, last_draws_per_run[n][i])\n        << \"expecting run to run values to be the same. Found run \"\n        << n << \" to have different values than the 0th run for \"\n        << \"index: \" << i;\n    }\n  }\n  all_values_same = !HasNonfatalFailure();\n}\n\nTEST_F(performance, check_output_is_same) {\n  std::ifstream file_stream;\n  file_stream.open(\"test\/performance\/logistic_output.csv\", \n                   std::ios_base::in);\n  ASSERT_TRUE(file_stream.good());\n\n  std::string line, expected;\n\n  getline(file_stream, line);\n  expected = \"# stan_version_major = \" + stan::MAJOR_VERSION; \n  ASSERT_EQ(expected, line);\n  ASSERT_TRUE(file_stream.good());\n\n\n  getline(file_stream, line);\n  expected = \"# stan_version_minor = \" + stan::MINOR_VERSION; \n  ASSERT_EQ(expected, line);\n  ASSERT_TRUE(file_stream.good());\n\n  getline(file_stream, line);\n  expected = \"# stan_version_patch = \" + stan::PATCH_VERSION; \n  ASSERT_EQ(expected, line);\n  ASSERT_TRUE(file_stream.good());\n\n  getline(file_stream, line);\n  ASSERT_EQ(\"# model = logistic_model\", line);\n  ASSERT_TRUE(file_stream.good());\n\n  getline(file_stream, line);\n  ASSERT_EQ(\"lp__,accept_stat__,stepsize__,treedepth__,n_leapfrog__,n_divergent__,beta.1,beta.2\", line);\n  ASSERT_TRUE(file_stream.good());\n\n  getline(file_stream, line);\n  ASSERT_EQ(\"# Adaptation terminated\", line);\n  ASSERT_TRUE(file_stream.good());\n\n  file_stream.close();\n}\n\nTEST_F(performance, write_results_to_disk) {\n  std::stringstream header;\n  std::stringstream line;\n\n  \/\/ current date \/ time\n  header << quote(\"date\");\n  line << quote(get_date());\n  \n  \/\/ git hash\n  header << \",\" << quote(\"git hash\") << \",\" << quote(\"git date\");\n  line << \",\" << quote(get_git_hash()) << \",\" << quote(get_git_date());\n\n  \/\/ model name: \"logistic\"\n  header << \",\" << quote(\"model name\");\n  line << \",\" << quote(\"logistic\");\n\n  \/\/ matches tagged values\n  header << \",\" << quote(\"matches tagged version\");\n  line << \",\" << quote(matches_tagged_version ? \"yes\" : \"no\");\n  \n  \/\/ all values same\n  header << \",\" << quote(\"all values same\");\n  line << \",\" << quote(all_values_same ? \"yes\" : \"no\");\n\n  \/\/ N times\n  for (int n = 0; n < N; n++) {\n    std::stringstream ss;\n    ss << \"run \" << n+1;\n    header << \",\" << quote(ss.str());\n    line << \",\" << seconds_per_run[n];\n  }\n\n\n  \/\/ append output to: test\/performance\/performance.csv\n  bool write_header = false;\n  std::fstream file_stream;\n  \n  file_stream.open(\"test\/performance\/performance.csv\", \n                   std::ios_base::in);\n  if (file_stream.peek() == std::fstream::traits_type::eof()) {\n    write_header = true;\n  } else {\n    std::string file_header;\n    std::getline(file_stream, file_header);\n    \n    EXPECT_EQ(file_header, header.str()) \n      << \"header of file is different\";\n    if (file_header != header.str())\n      write_header = true;\n  }\n  file_stream.close();\n\n  file_stream.open(\"test\/performance\/performance.csv\",\n                   std::ios_base::app);\n  if (write_header)\n    file_stream << header.str() << std::endl;\n  file_stream << line.str() << std::endl;\n  file_stream.close();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"copy_root_tree.hh\"\n\n\/\/ Root tree copy function\n\/\/\n\/\/ NOTE: I don't recommend trying to understand the variable buffer\n\/\/ classes until you see the general workflow.\n\/\/\n\/\/ The main work is done in copy_root_tree below, skip down to that to\n\/\/ understand what is going on.\n\/\/\n\n#include \"HdfTuple.hh\"\n\n#include \"TFile.h\"\n#include \"TTree.h\"\n#include \"TLeaf.h\"\n\n#include <memory>\n#include <regex>\n#include <iostream>\n\n\/\/ ______________________________________________________________________\n\/\/ Variable buffer classes\n\/\/\n\/\/ These classes act as glue between HDF and ROOT: they hold pointers\n\/\/ to the buffers that ROOT will read into, and as such are\n\/\/ \"ROOT-side\" buffers.\n\/\/\n\/\/ The constructors are given a reference to a `VariableFillers`\n\/\/ container, which contains the \"HDF5-side\" logic. Each of the\n\/\/ VariableFiller objects contains a \"filler\" function that the HDF5\n\/\/ writer will call to read from the ROOT buffer.\n\/\/\n\/\/ Some of the filler functions close over an index vector. This\n\/\/ vector is incremented by the HDF5 Writer to read out successive\n\/\/ entires in a std::vector stored in the root file.\n\/\/\n\/\/ If this all seems complicated, it's because it's the deep internals\n\/\/ of the code. Try to understand the copy_root_tree function first.\n\n\/\/ Base class, just to hold a virtual destructor\nclass IBuffer\n{\npublic:\n  virtual ~IBuffer() {}\n};\n\n\/\/ Simple variables types are stored in the `Buffer` class.\ntemplate <typename T>\nclass Buffer: public IBuffer\n{\npublic:\n  Buffer(VariableFillers& vars, TTree& tt, const std::string& name);\nprivate:\n  T _buffer;\n};\n\n\/\/ Buffer for vector types\ntemplate <typename T>\nclass VBuf: public IBuffer\n{\npublic:\n  \/\/ These require an index for the vector (`idx`)\n  VBuf(VariableFillers& vars, std::vector<size_t>& idx, TTree& tt,\n       const std::string& name, T default_value = T());\n  ~VBuf();\nprivate:\n  std::vector<T>* _buffer;\n};\n\n\/\/ Buffer for vectors of vectors\ntemplate <typename T>\nclass VVBuf: public IBuffer\n{\npublic:\n  VVBuf(VariableFillers& vars, std::vector<size_t>& idx, TTree& tt,\n       const std::string& name, T default_value = T());\n  ~VVBuf();\nprivate:\n  std::vector<std::vector<T> >* _buffer;\n};\n\n\/\/ _____________________________________________________________________\n\/\/ main copy root tree function\n\/\/\n\/\/ The basic workflow is as follows:\n\/\/\n\/\/  - Define the ROOT-side buffers that we'll read the information\n\/\/    into. At the same time, define HDF-side objects that read out of\n\/\/    these buffers and copy the information into the HDF5 buffer.\n\/\/\n\/\/  - Build the output HDF5 files\n\/\/\n\/\/  - Loop over the input tree and fill the output files\n\/\/\n\/\/ Note that this means the event loop happens last: most of the work\n\/\/ is just setting up the read and write buffers.\n\nvoid copy_root_tree(TTree& tt, H5::Group& fg, const TreeCopyOpts& opts) {\n\n  \/\/ define the buffers for root to read into\n  std::vector<std::unique_ptr<IBuffer> > buffers;\n\n  \/\/ this keeps track of the things we couldn't read\n  std::set<std::string> skipped;\n\n\n  \/\/ Each `VariableFiller` must be constructed with a \"filler\"\n  \/\/ function (or callable object), which takes no arguments and\n  \/\/ returns the variable we want to write out. In this case they are\n  \/\/ implemented as closures over the buffers that ROOT is reading\n  \/\/ into.\n\n  \/\/ This is the 1d variables\n  VariableFillers vars;\n\n  \/\/ These are 2d variables (i.e. vector<T> in the root file)\n  \/\/\n  \/\/ We also need an index which the HDF5 writer increments as it\n  \/\/ fills. This is shared with the ROOT buffers to index entries in\n  \/\/ std::vectors\n  VariableFillers vars2d;\n  std::vector<size_t> idx(1,0);\n\n  \/\/ 3d variables (index is now 2d)\n  VariableFillers vars3d;\n  std::vector<size_t> idx2(2,0);\n\n  \/\/ Iterate over all the leaf names. There are some duplicates in the\n  \/\/ list of keys, so we have to build the set ourselves.\n  std::regex branch_filter(opts.branch_regex);\n  TIter next(tt.GetListOfLeaves());\n  TLeaf* leaf;\n  std::set<std::string> leaf_names;\n  while ((leaf = dynamic_cast<TLeaf*>(next()))) {\n    leaf_names.insert(leaf->GetName());\n  }\n  if (leaf_names.size() == 0) throw std::logic_error(\"no branches found\");\n\n  \/\/ Loop over all the leafs, assign buffers to each\n  \/\/\n  \/\/ These `Buffer` classes are defined above. The buffers turn the\n  \/\/ branchs on, so we can set them all off to start.\n  tt.SetBranchStatus(\"*\", false);\n  for (const auto& lname: leaf_names) {\n    bool keep = true;\n    if (opts.branch_regex.size() > 0) {\n      keep = std::regex_search(lname, branch_filter);\n    }\n    if (opts.verbose) {\n      std::cout << (keep ? \"found \" : \"rejecting \") << lname << std::endl;\n    }\n    if (!keep) continue;\n\n    leaf = tt.GetLeaf(lname.c_str());\n    std::string leaf_type = leaf->GetTypeName();\n    if (leaf_type == \"Int_t\") {\n      buffers.emplace_back(new Buffer<int>(vars, tt, lname));\n    } else if (leaf_type == \"Float_t\") {\n      buffers.emplace_back(new Buffer<float>(vars, tt, lname));\n    } else if (leaf_type == \"Double_t\") {\n      buffers.emplace_back(new Buffer<double>(vars, tt, lname));\n    } else if (leaf_type == \"Bool_t\") {\n      buffers.emplace_back(new Buffer<bool>(vars, tt, lname));\n    } else if (leaf_type == \"Long64_t\") {\n      buffers.emplace_back(new Buffer<long long>(vars, tt, lname));\n    } else if (leaf_type == \"UInt_t\") {\n      buffers.emplace_back(new Buffer<unsigned int>(vars, tt, lname));\n    } else if (leaf_type == \"vector<float>\") {\n      buffers.emplace_back(new VBuf<float>(vars2d, idx, tt, lname, NAN));\n    } else if (leaf_type == \"vector<double>\") {\n      buffers.emplace_back(new VBuf<double>(vars2d, idx, tt, lname, NAN));\n    } else if (leaf_type == \"vector<int>\") {\n      buffers.emplace_back(new VBuf<int>(vars2d, idx, tt, lname, 0));\n    } else if (leaf_type == \"vector<unsigned int>\") {\n      buffers.emplace_back(new VBuf<unsigned int>(vars2d, idx, tt, lname, 0));\n    } else if (leaf_type == \"vector<bool>\") {\n      buffers.emplace_back(new VBuf<bool>(vars2d, idx, tt, lname, 0));\n    } else if (leaf_type == \"vector<vector<int> >\") {\n      buffers.emplace_back(new VVBuf<int>(vars3d, idx2, tt, lname, 0));\n    } else if (leaf_type == \"vector<vector<unsigned int> >\") {\n      buffers.emplace_back(new VVBuf<unsigned int>(vars3d, idx2, tt, lname, 0));\n    } else if (leaf_type == \"vector<vector<float> >\") {\n      buffers.emplace_back(new VVBuf<float>(vars3d, idx2, tt, lname, NAN));\n    } else if (leaf_type == \"vector<vector<double> >\") {\n      buffers.emplace_back(new VVBuf<double>(vars3d, idx2, tt, lname, NAN));\n    } else if (leaf_type == \"vector<vector<bool> >\") {\n      buffers.emplace_back(new VVBuf<bool>(vars3d, idx2, tt, lname, 0));\n    } else {\n      skipped.insert(leaf_type);\n    }\n  }\n\n  \/\/ Build HDF5 Outputs\n  \/\/\n  \/\/ In the simple case where we're not reading vectors, we store one\n  \/\/ dataset with the same name as the tree. If there are vectors, we\n  \/\/ instead create a group with the same name as the tree, and name\n  \/\/ the datasets 1d, 2d, etc.\n  \/\/\n  const std::string tree_name = tt.GetName();\n\n  std::unique_ptr<WriterXd> writer1d;\n  std::unique_ptr<WriterXd> writer2d;\n  std::unique_ptr<WriterXd> writer3d;\n  std::unique_ptr<H5::Group> top_group;\n  if (opts.vector_lengths.size() > 0) {\n    if (opts.vector_lengths.size() > 2) throw std::logic_error(\n      \"we don't support outputs with rank > 3\");\n    size_t length = opts.vector_lengths.at(0);\n    top_group.reset(new H5::Group(fg.createGroup(tree_name)));\n    if (opts.vector_lengths.size() > 1) {\n      size_t length2 = opts.vector_lengths.at(1);\n      if (vars3d.size() > 0) {\n        writer3d.reset(new WriterXd(*top_group, \"3d\", vars3d,\n                                    {length, length2}, opts.chunk_size));\n      }\n    }\n    if (vars2d.size() > 0) {\n      writer2d.reset(new WriterXd(*top_group, \"2d\", vars2d,\n                                  {length}, opts.chunk_size));\n    }\n    if (vars.size() > 0) {\n      writer1d.reset(new WriterXd(*top_group, \"1d\",\n                                  vars, {}, opts.chunk_size));\n    }\n  } else {\n    if (vars.size() > 0) {\n      writer1d.reset(new WriterXd(fg, tree_name, vars, {}, opts.chunk_size));\n    }\n  }\n\n  \/\/ Main event loop\n  \/\/\n  \/\/ Very little actually happens here since the buffers are already\n  \/\/ defined, as are the HDF5 reader functions.\n  \/\/\n  size_t n_entries = tt.GetEntries();\n  int print_interval = opts.print_interval;\n  if (print_interval == -1) {\n    print_interval = std::max(1UL, n_entries \/ 100);\n  }\n  for (size_t iii = 0; iii < n_entries; iii++) {\n    if (opts.n_entries && iii >= opts.n_entries) break;\n    if (print_interval && (iii % print_interval == 0)) {\n      std::cout << \"events processed: \" << iii\n                << \" (\" << std::round(iii*1e2 \/ n_entries) << \"%)\"\n                << std::endl;\n    }\n    tt.GetEntry(iii);\n    if (writer1d) writer1d->fill_while_incrementing();\n    if (writer2d) writer2d->fill_while_incrementing(idx);\n    if (writer3d) writer3d->fill_while_incrementing(idx2);\n  }\n\n  \/\/ Flush the memory buffers on the HDF5 side. (This is done by the\n  \/\/ destructor automatically, but we do it here to make any errors\n  \/\/ more explicit.)\n  if (writer1d) writer1d->flush();\n  if (writer2d) writer2d->flush();\n  if (writer3d) writer3d->flush();\n\n  \/\/ Print the names of any classes that we were't able to read from\n  \/\/ the root file.\n  if (opts.verbose) {\n    for (const auto& name: skipped) {\n      std::cerr << \"could not read branch of type \" << name << std::endl;\n    }\n  }\n}\n\n\n\/\/ ______________________________________________________________________\n\/\/ Buffer implementation\n\n\/\/ 1d buffer\ntemplate <typename T>\nBuffer<T>::Buffer(VariableFillers& vars, TTree& tt,\n                  const std::string& name)\n{\n  tt.SetBranchStatus(name.c_str(), true);\n  tt.SetBranchAddress(name.c_str(), &_buffer);\n  T& buf = _buffer;\n  vars.add<T>(name, [&buf](){return buf;});\n}\n\n\/\/ 2d buffer\ntemplate <typename T>\nVBuf<T>::VBuf(VariableFillers& vars, std::vector<size_t>& idx, TTree& tt,\n              const std::string& name, T default_value):\n  _buffer(new std::vector<T>)\n{\n  tt.SetBranchStatus(name.c_str(), true);\n  tt.SetBranchAddress(name.c_str(), &_buffer);\n  std::vector<T>& buf = *_buffer;\n  auto filler = [&buf, &idx, default_value]() -> T {\n    if (idx.at(0) < buf.size()) {\n      return buf.at(idx.at(0));\n    } else {\n      return default_value;\n    }\n  };\n  vars.add<T>(name, filler);\n}\ntemplate <typename T>\nVBuf<T>::~VBuf() {\n  delete _buffer;\n}\n\n\n\/\/ 3d buffers\ntemplate <typename T>\nVVBuf<T>::VVBuf(VariableFillers& vars, std::vector<size_t>& idx, TTree& tt,\n                const std::string& name, T default_value):\n  _buffer(new std::vector<std::vector<T> >)\n{\n  tt.SetBranchStatus(name.c_str(), true);\n  tt.SetBranchAddress(name.c_str(), &_buffer);\n  std::vector<std::vector<T> >& buf = *_buffer;\n  auto filler = [&buf, &idx, default_value]() -> T {\n    size_t idx1 = idx.at(0);\n    size_t idx2 = idx.at(1);\n    if (idx1 < buf.size()) {\n      if (idx2 < buf.at(idx1).size()) {\n        return buf.at(idx1).at(idx2);\n      }\n    }\n    return default_value;\n  };\n  vars.add<T>(name, filler);\n}\ntemplate <typename T>\nVVBuf<T>::~VVBuf() {\n  delete _buffer;\n}\n\n<commit_msg>Fix for progress printouts<commit_after>#include \"copy_root_tree.hh\"\n\n\/\/ Root tree copy function\n\/\/\n\/\/ NOTE: I don't recommend trying to understand the variable buffer\n\/\/ classes until you see the general workflow.\n\/\/\n\/\/ The main work is done in copy_root_tree below, skip down to that to\n\/\/ understand what is going on.\n\/\/\n\n#include \"HdfTuple.hh\"\n\n#include \"TFile.h\"\n#include \"TTree.h\"\n#include \"TLeaf.h\"\n\n#include <memory>\n#include <regex>\n#include <iostream>\n\n\/\/ ______________________________________________________________________\n\/\/ Variable buffer classes\n\/\/\n\/\/ These classes act as glue between HDF and ROOT: they hold pointers\n\/\/ to the buffers that ROOT will read into, and as such are\n\/\/ \"ROOT-side\" buffers.\n\/\/\n\/\/ The constructors are given a reference to a `VariableFillers`\n\/\/ container, which contains the \"HDF5-side\" logic. Each of the\n\/\/ VariableFiller objects contains a \"filler\" function that the HDF5\n\/\/ writer will call to read from the ROOT buffer.\n\/\/\n\/\/ Some of the filler functions close over an index vector. This\n\/\/ vector is incremented by the HDF5 Writer to read out successive\n\/\/ entires in a std::vector stored in the root file.\n\/\/\n\/\/ If this all seems complicated, it's because it's the deep internals\n\/\/ of the code. Try to understand the copy_root_tree function first.\n\n\/\/ Base class, just to hold a virtual destructor\nclass IBuffer\n{\npublic:\n  virtual ~IBuffer() {}\n};\n\n\/\/ Simple variables types are stored in the `Buffer` class.\ntemplate <typename T>\nclass Buffer: public IBuffer\n{\npublic:\n  Buffer(VariableFillers& vars, TTree& tt, const std::string& name);\nprivate:\n  T _buffer;\n};\n\n\/\/ Buffer for vector types\ntemplate <typename T>\nclass VBuf: public IBuffer\n{\npublic:\n  \/\/ These require an index for the vector (`idx`)\n  VBuf(VariableFillers& vars, std::vector<size_t>& idx, TTree& tt,\n       const std::string& name, T default_value = T());\n  ~VBuf();\nprivate:\n  std::vector<T>* _buffer;\n};\n\n\/\/ Buffer for vectors of vectors\ntemplate <typename T>\nclass VVBuf: public IBuffer\n{\npublic:\n  VVBuf(VariableFillers& vars, std::vector<size_t>& idx, TTree& tt,\n       const std::string& name, T default_value = T());\n  ~VVBuf();\nprivate:\n  std::vector<std::vector<T> >* _buffer;\n};\n\n\/\/ _____________________________________________________________________\n\/\/ main copy root tree function\n\/\/\n\/\/ The basic workflow is as follows:\n\/\/\n\/\/  - Define the ROOT-side buffers that we'll read the information\n\/\/    into. At the same time, define HDF-side objects that read out of\n\/\/    these buffers and copy the information into the HDF5 buffer.\n\/\/\n\/\/  - Build the output HDF5 files\n\/\/\n\/\/  - Loop over the input tree and fill the output files\n\/\/\n\/\/ Note that this means the event loop happens last: most of the work\n\/\/ is just setting up the read and write buffers.\n\nvoid copy_root_tree(TTree& tt, H5::Group& fg, const TreeCopyOpts& opts) {\n\n  \/\/ define the buffers for root to read into\n  std::vector<std::unique_ptr<IBuffer> > buffers;\n\n  \/\/ this keeps track of the things we couldn't read\n  std::set<std::string> skipped;\n\n\n  \/\/ Each `VariableFiller` must be constructed with a \"filler\"\n  \/\/ function (or callable object), which takes no arguments and\n  \/\/ returns the variable we want to write out. In this case they are\n  \/\/ implemented as closures over the buffers that ROOT is reading\n  \/\/ into.\n\n  \/\/ This is the 1d variables\n  VariableFillers vars;\n\n  \/\/ These are 2d variables (i.e. vector<T> in the root file)\n  \/\/\n  \/\/ We also need an index which the HDF5 writer increments as it\n  \/\/ fills. This is shared with the ROOT buffers to index entries in\n  \/\/ std::vectors\n  VariableFillers vars2d;\n  std::vector<size_t> idx(1,0);\n\n  \/\/ 3d variables (index is now 2d)\n  VariableFillers vars3d;\n  std::vector<size_t> idx2(2,0);\n\n  \/\/ Iterate over all the leaf names. There are some duplicates in the\n  \/\/ list of keys, so we have to build the set ourselves.\n  std::regex branch_filter(opts.branch_regex);\n  TIter next(tt.GetListOfLeaves());\n  TLeaf* leaf;\n  std::set<std::string> leaf_names;\n  while ((leaf = dynamic_cast<TLeaf*>(next()))) {\n    leaf_names.insert(leaf->GetName());\n  }\n  if (leaf_names.size() == 0) throw std::logic_error(\"no branches found\");\n\n  \/\/ Loop over all the leafs, assign buffers to each\n  \/\/\n  \/\/ These `Buffer` classes are defined above. The buffers turn the\n  \/\/ branchs on, so we can set them all off to start.\n  tt.SetBranchStatus(\"*\", false);\n  for (const auto& lname: leaf_names) {\n    bool keep = true;\n    if (opts.branch_regex.size() > 0) {\n      keep = std::regex_search(lname, branch_filter);\n    }\n    if (opts.verbose) {\n      std::cout << (keep ? \"found \" : \"rejecting \") << lname << std::endl;\n    }\n    if (!keep) continue;\n\n    leaf = tt.GetLeaf(lname.c_str());\n    std::string leaf_type = leaf->GetTypeName();\n    if (leaf_type == \"Int_t\") {\n      buffers.emplace_back(new Buffer<int>(vars, tt, lname));\n    } else if (leaf_type == \"Float_t\") {\n      buffers.emplace_back(new Buffer<float>(vars, tt, lname));\n    } else if (leaf_type == \"Double_t\") {\n      buffers.emplace_back(new Buffer<double>(vars, tt, lname));\n    } else if (leaf_type == \"Bool_t\") {\n      buffers.emplace_back(new Buffer<bool>(vars, tt, lname));\n    } else if (leaf_type == \"Long64_t\") {\n      buffers.emplace_back(new Buffer<long long>(vars, tt, lname));\n    } else if (leaf_type == \"UInt_t\") {\n      buffers.emplace_back(new Buffer<unsigned int>(vars, tt, lname));\n    } else if (leaf_type == \"vector<float>\") {\n      buffers.emplace_back(new VBuf<float>(vars2d, idx, tt, lname, NAN));\n    } else if (leaf_type == \"vector<double>\") {\n      buffers.emplace_back(new VBuf<double>(vars2d, idx, tt, lname, NAN));\n    } else if (leaf_type == \"vector<int>\") {\n      buffers.emplace_back(new VBuf<int>(vars2d, idx, tt, lname, 0));\n    } else if (leaf_type == \"vector<unsigned int>\") {\n      buffers.emplace_back(new VBuf<unsigned int>(vars2d, idx, tt, lname, 0));\n    } else if (leaf_type == \"vector<bool>\") {\n      buffers.emplace_back(new VBuf<bool>(vars2d, idx, tt, lname, 0));\n    } else if (leaf_type == \"vector<vector<int> >\") {\n      buffers.emplace_back(new VVBuf<int>(vars3d, idx2, tt, lname, 0));\n    } else if (leaf_type == \"vector<vector<unsigned int> >\") {\n      buffers.emplace_back(new VVBuf<unsigned int>(vars3d, idx2, tt, lname, 0));\n    } else if (leaf_type == \"vector<vector<float> >\") {\n      buffers.emplace_back(new VVBuf<float>(vars3d, idx2, tt, lname, NAN));\n    } else if (leaf_type == \"vector<vector<double> >\") {\n      buffers.emplace_back(new VVBuf<double>(vars3d, idx2, tt, lname, NAN));\n    } else if (leaf_type == \"vector<vector<bool> >\") {\n      buffers.emplace_back(new VVBuf<bool>(vars3d, idx2, tt, lname, 0));\n    } else {\n      skipped.insert(leaf_type);\n    }\n  }\n\n  \/\/ Build HDF5 Outputs\n  \/\/\n  \/\/ In the simple case where we're not reading vectors, we store one\n  \/\/ dataset with the same name as the tree. If there are vectors, we\n  \/\/ instead create a group with the same name as the tree, and name\n  \/\/ the datasets 1d, 2d, etc.\n  \/\/\n  const std::string tree_name = tt.GetName();\n\n  std::unique_ptr<WriterXd> writer1d;\n  std::unique_ptr<WriterXd> writer2d;\n  std::unique_ptr<WriterXd> writer3d;\n  std::unique_ptr<H5::Group> top_group;\n  if (opts.vector_lengths.size() > 0) {\n    if (opts.vector_lengths.size() > 2) throw std::logic_error(\n      \"we don't support outputs with rank > 3\");\n    size_t length = opts.vector_lengths.at(0);\n    top_group.reset(new H5::Group(fg.createGroup(tree_name)));\n    if (opts.vector_lengths.size() > 1) {\n      size_t length2 = opts.vector_lengths.at(1);\n      if (vars3d.size() > 0) {\n        writer3d.reset(new WriterXd(*top_group, \"3d\", vars3d,\n                                    {length, length2}, opts.chunk_size));\n      }\n    }\n    if (vars2d.size() > 0) {\n      writer2d.reset(new WriterXd(*top_group, \"2d\", vars2d,\n                                  {length}, opts.chunk_size));\n    }\n    if (vars.size() > 0) {\n      writer1d.reset(new WriterXd(*top_group, \"1d\",\n                                  vars, {}, opts.chunk_size));\n    }\n  } else {\n    if (vars.size() > 0) {\n      writer1d.reset(new WriterXd(fg, tree_name, vars, {}, opts.chunk_size));\n    }\n  }\n\n  \/\/ Main event loop\n  \/\/\n  \/\/ Very little actually happens here since the buffers are already\n  \/\/ defined, as are the HDF5 reader functions.\n  \/\/\n  size_t n_entries = tt.GetEntries();\n  if (opts.n_entries) n_entries = std::min(n_entries, opts.n_entries);\n  int print_interval = opts.print_interval;\n  if (print_interval == -1) {\n    print_interval = std::max(1UL, n_entries \/ 100);\n  }\n  for (size_t iii = 0; iii < n_entries; iii++) {\n    if (print_interval && (iii % print_interval == 0)) {\n      std::cout << \"events processed: \" << iii\n                << \" (\" << std::round(iii*1e2 \/ n_entries) << \"% of \"\n                << n_entries << \")\" << std::endl;\n    }\n    tt.GetEntry(iii);\n    if (writer1d) writer1d->fill_while_incrementing();\n    if (writer2d) writer2d->fill_while_incrementing(idx);\n    if (writer3d) writer3d->fill_while_incrementing(idx2);\n  }\n\n  \/\/ Flush the memory buffers on the HDF5 side. (This is done by the\n  \/\/ destructor automatically, but we do it here to make any errors\n  \/\/ more explicit.)\n  if (writer1d) writer1d->flush();\n  if (writer2d) writer2d->flush();\n  if (writer3d) writer3d->flush();\n\n  \/\/ Print the names of any classes that we were't able to read from\n  \/\/ the root file.\n  if (opts.verbose) {\n    for (const auto& name: skipped) {\n      std::cerr << \"could not read branch of type \" << name << std::endl;\n    }\n  }\n}\n\n\n\/\/ ______________________________________________________________________\n\/\/ Buffer implementation\n\n\/\/ 1d buffer\ntemplate <typename T>\nBuffer<T>::Buffer(VariableFillers& vars, TTree& tt,\n                  const std::string& name)\n{\n  tt.SetBranchStatus(name.c_str(), true);\n  tt.SetBranchAddress(name.c_str(), &_buffer);\n  T& buf = _buffer;\n  vars.add<T>(name, [&buf](){return buf;});\n}\n\n\/\/ 2d buffer\ntemplate <typename T>\nVBuf<T>::VBuf(VariableFillers& vars, std::vector<size_t>& idx, TTree& tt,\n              const std::string& name, T default_value):\n  _buffer(new std::vector<T>)\n{\n  tt.SetBranchStatus(name.c_str(), true);\n  tt.SetBranchAddress(name.c_str(), &_buffer);\n  std::vector<T>& buf = *_buffer;\n  auto filler = [&buf, &idx, default_value]() -> T {\n    if (idx.at(0) < buf.size()) {\n      return buf.at(idx.at(0));\n    } else {\n      return default_value;\n    }\n  };\n  vars.add<T>(name, filler);\n}\ntemplate <typename T>\nVBuf<T>::~VBuf() {\n  delete _buffer;\n}\n\n\n\/\/ 3d buffers\ntemplate <typename T>\nVVBuf<T>::VVBuf(VariableFillers& vars, std::vector<size_t>& idx, TTree& tt,\n                const std::string& name, T default_value):\n  _buffer(new std::vector<std::vector<T> >)\n{\n  tt.SetBranchStatus(name.c_str(), true);\n  tt.SetBranchAddress(name.c_str(), &_buffer);\n  std::vector<std::vector<T> >& buf = *_buffer;\n  auto filler = [&buf, &idx, default_value]() -> T {\n    size_t idx1 = idx.at(0);\n    size_t idx2 = idx.at(1);\n    if (idx1 < buf.size()) {\n      if (idx2 < buf.at(idx1).size()) {\n        return buf.at(idx1).at(idx2);\n      }\n    }\n    return default_value;\n  };\n  vars.add<T>(name, filler);\n}\ntemplate <typename T>\nVVBuf<T>::~VVBuf() {\n  delete _buffer;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/**\n * Performance test: logistic.\n *\n * This test runs a simple logistic model 100 times with a fixed\n * seed. The test records to a csv file information about the current\n * build, whether the values match the expected known values, whether\n * values are identical between runs, and the runtime in seconds for\n * each of the 100 individual runs.\n *\n * The output file is a csv file located at\n * test\/performance\/performance.csv.  If the file is empty, a header\n * line will be written.  If the file is not empty and the header line\n * of the file matches, a data row will be appended.  If the file is\n * not empty and the header line is different, a header row and a data\n * row will be appended.\n *\n * Below are the test routines in this test.\n * 1. run: Runs the model 100 times. This test should always\n *    succeed. Test failure indicates that the model could not be run.\n * 2. values_from_tagged_version: Compares the first run's final\n *    iteration against known values. Test will succeed if the values\n *    match the known values; the test will fail otherwise.\n * 3. values_same_run_to_run: Compares the first run's final iteration\n *    against all runs' final iterations. Test will succeed if all the\n *    values match; the test will fail otherwise.\n * 4. write_results_to_disk: Writes the results to disk. Test will\n *    succeed if writing to an empty file or to one with a matching\n *    header; the test will fail if the header in the existing file\n *    does not match the current header.\n *\n * Note: the values_from_tagged_version will need to be updated\n * if Stan's RNG changes, the seeding mechanism changes, or the\n * algorithm changes. The other routines should be fine.\n *\n * Each run of this test produces a single, csv row with 106 columns\n * in the output file:\n *   1. current date. Formatted using std::ctime: \"Www Mmm dd hh:mm:ss yyyy\"\n *   2. git hash. The current 40-character SHA-1 git hash or \"NA\".\n *   3. git date. The date of the last commit or \"NA\".\n *   4. model name. \"logistic\"\n *   5. matches tagged version. Either \"yes\" or \"no\".\n *   6. all values the same. Either \"yes\" or \"no\".\n *   7--106. run time (in seconds).\n *\/\n\n#include <gtest\/gtest.h>\n#include <test\/test-models\/performance\/logistic.hpp>\n#include <stan\/version.hpp>\n#include <ctime>\n#include <test\/performance\/utility.hpp>\n#include <boost\/algorithm\/string\/trim.hpp>\n\n\nclass performance : public ::testing::Test {\npublic:\n  static void SetUpTestCase() {\n    N = 100;\n    seconds_per_run.resize(N);\n    last_draws_per_run.resize(N);\n    matches_tagged_version = false;\n    all_values_same = false;\n  }\n\n  static int N;\n  static std::vector<double> seconds_per_run;\n  static std::vector<std::vector<double> > last_draws_per_run;\n  static bool matches_tagged_version;\n  static bool all_values_same;\n};\n\nint performance::N;\nstd::vector<double> performance::seconds_per_run;\nstd::vector<std::vector<double> > performance::last_draws_per_run;\nbool performance::matches_tagged_version;\nbool performance::all_values_same;\n\n\nusing stan::test::performance::run_command_output;\nusing stan::test::performance::run_command;\nusing stan::test::performance::get_last_iteration_from_file;\nusing stan::test::performance::quote;\nusing stan::test::performance::get_git_hash;\nusing stan::test::performance::get_git_date;\nusing stan::test::performance::get_date;\n\nTEST_F(performance, run) {\n  clock_t t;\n  for (int n = 0; n < N; ++n) {\n    std::cout << \"iteration: \" << n << \" \/ \" << N << std::endl;\n    t = clock();      \/\/ start timer\n    stan::test::performance::command<stan_model>(1000,\n                                                 10000,\n                                                 \"src\/test\/test-models\/performance\/logistic.data.R\",\n                                                 \"test\/performance\/logistic_output.csv\",\n                                                 0U);\n    t = clock() - t;  \/\/ end timer\n    seconds_per_run[n] = static_cast<double>(t) \/ CLOCKS_PER_SEC;\n    last_draws_per_run[n]\n      = get_last_iteration_from_file(\"test\/performance\/logistic_output.csv\");\n  }\n  SUCCEED();\n}\n\n\/\/ evaluate\nTEST_F(performance, values_from_tagged_version) {\n  int N_values = 9;\n  ASSERT_EQ(N_values, last_draws_per_run[0].size())\n    << \"last tagged version, 2.9.0, had \" << N_values << \" elements\";\n\n  std::vector<double> first_run = last_draws_per_run[0];\n  EXPECT_FLOAT_EQ(-65.319603, first_run[0])\n    << \"lp__: index 0\";\n\n  EXPECT_FLOAT_EQ(0.96712297, first_run[1])\n    << \"accept_stat__: index 1\";\n\n  EXPECT_FLOAT_EQ(1.06545, first_run[2])\n    << \"stepsize__: index 2\";\n\n  EXPECT_FLOAT_EQ(2, first_run[3])\n    << \"treedepth__: index 3\";\n\n  EXPECT_FLOAT_EQ(3, first_run[4])\n    << \"n_leapfrog__: index 4\";\n\n  EXPECT_FLOAT_EQ(0, first_run[5])\n    << \"divergent__: index 5\";\n\n  EXPECT_FLOAT_EQ(66.090698, first_run[6])\n    << \"energy__: index 6\";\n\n  EXPECT_FLOAT_EQ(1.4068201, first_run[7])\n    << \"beta.1: index 7\";\n\n  EXPECT_FLOAT_EQ(-0.59367198, first_run[8])\n    << \"beta.2: index 8\";\n\n  matches_tagged_version = !HasNonfatalFailure();\n}\n\nTEST_F(performance, values_same_run_to_run) {\n  int N_values = last_draws_per_run[0].size();\n\n  for (int i = 0; i < N_values; i++) {\n    double expected_value = last_draws_per_run[0][i];\n    for (int n = 1; n < N; n++) {\n      EXPECT_FLOAT_EQ(expected_value, last_draws_per_run[n][i])\n        << \"expecting run to run values to be the same. Found run \"\n        << n << \" to have different values than the 0th run for \"\n        << \"index: \" << i;\n    }\n  }\n  all_values_same = !HasNonfatalFailure();\n}\n\nTEST_F(performance, check_output_is_same) {\n  std::ifstream file_stream;\n  file_stream.open(\"test\/performance\/logistic_output.csv\",\n                   std::ios_base::in);\n  ASSERT_TRUE(file_stream.good());\n\n  std::string line, expected;\n\n  getline(file_stream, line);\n  ASSERT_EQ(\"lp__,accept_stat__,stepsize__,treedepth__,n_leapfrog__,divergent__,energy__,beta.1,beta.2\", line);\n  ASSERT_TRUE(file_stream.good());\n\n  getline(file_stream, line);\n  ASSERT_EQ(\"# Adaptation terminated\", line);\n  ASSERT_TRUE(file_stream.good());\n\n  file_stream.close();\n}\n\nTEST_F(performance, write_results_to_disk) {\n  std::stringstream header;\n  std::stringstream line;\n\n  \/\/ current date \/ time\n  header << quote(\"date\");\n  line << quote(get_date());\n\n  \/\/ git hash\n  header << \",\" << quote(\"git hash\") << \",\" << quote(\"git date\");\n  line << \",\" << quote(get_git_hash()) << \",\" << quote(get_git_date());\n\n  \/\/ model name: \"logistic\"\n  header << \",\" << quote(\"model name\");\n  line << \",\" << quote(\"logistic\");\n\n  \/\/ matches tagged values\n  header << \",\" << quote(\"matches tagged version\");\n  line << \",\" << quote(matches_tagged_version ? \"yes\" : \"no\");\n\n  \/\/ all values same\n  header << \",\" << quote(\"all values same\");\n  line << \",\" << quote(all_values_same ? \"yes\" : \"no\");\n\n  \/\/ N times\n  for (int n = 0; n < N; n++) {\n    std::stringstream ss;\n    ss << \"run \" << n+1;\n    header << \",\" << quote(ss.str());\n    line << \",\" << seconds_per_run[n];\n  }\n\n\n  \/\/ append output to: test\/performance\/performance.csv\n  bool write_header = false;\n  std::fstream file_stream;\n\n  file_stream.open(\"test\/performance\/performance.csv\",\n                   std::ios_base::in);\n  if (file_stream.peek() == std::fstream::traits_type::eof()) {\n    write_header = true;\n  } else {\n    std::string file_header;\n    std::getline(file_stream, file_header);\n\n    EXPECT_EQ(file_header, header.str())\n      << \"header of file is different\";\n    if (file_header != header.str())\n      write_header = true;\n  }\n  file_stream.close();\n\n  file_stream.open(\"test\/performance\/performance.csv\",\n                   std::ios_base::app);\n  if (write_header)\n    file_stream << header.str() << std::endl;\n  file_stream << line.str() << std::endl;\n  file_stream.close();\n}\n<commit_msg>Fixes #2332. Updates performance test.<commit_after>\/**\n * Performance test: logistic.\n *\n * This test runs a simple logistic model 100 times with a fixed\n * seed. The test records to a csv file information about the current\n * build, whether the values match the expected known values, whether\n * values are identical between runs, and the runtime in seconds for\n * each of the 100 individual runs.\n *\n * The output file is a csv file located at\n * test\/performance\/performance.csv.  If the file is empty, a header\n * line will be written.  If the file is not empty and the header line\n * of the file matches, a data row will be appended.  If the file is\n * not empty and the header line is different, a header row and a data\n * row will be appended.\n *\n * Below are the test routines in this test.\n * 1. run: Runs the model 100 times. This test should always\n *    succeed. Test failure indicates that the model could not be run.\n * 2. values_from_tagged_version: Compares the first run's final\n *    iteration against known values. Test will succeed if the values\n *    match the known values; the test will fail otherwise.\n * 3. values_same_run_to_run: Compares the first run's final iteration\n *    against all runs' final iterations. Test will succeed if all the\n *    values match; the test will fail otherwise.\n * 4. write_results_to_disk: Writes the results to disk. Test will\n *    succeed if writing to an empty file or to one with a matching\n *    header; the test will fail if the header in the existing file\n *    does not match the current header.\n *\n * Note: the values_from_tagged_version will need to be updated\n * if Stan's RNG changes, the seeding mechanism changes, or the\n * algorithm changes. The other routines should be fine.\n *\n * Each run of this test produces a single, csv row with 106 columns\n * in the output file:\n *   1. current date. Formatted using std::ctime: \"Www Mmm dd hh:mm:ss yyyy\"\n *   2. git hash. The current 40-character SHA-1 git hash or \"NA\".\n *   3. git date. The date of the last commit or \"NA\".\n *   4. model name. \"logistic\"\n *   5. matches tagged version. Either \"yes\" or \"no\".\n *   6. all values the same. Either \"yes\" or \"no\".\n *   7--106. run time (in seconds).\n *\/\n\n#include <gtest\/gtest.h>\n#include <test\/test-models\/performance\/logistic.hpp>\n#include <stan\/version.hpp>\n#include <ctime>\n#include <test\/performance\/utility.hpp>\n#include <boost\/algorithm\/string\/trim.hpp>\n\n\nclass performance : public ::testing::Test {\npublic:\n  static void SetUpTestCase() {\n    N = 100;\n    seconds_per_run.resize(N);\n    last_draws_per_run.resize(N);\n    matches_tagged_version = false;\n    all_values_same = false;\n  }\n\n  static int N;\n  static std::vector<double> seconds_per_run;\n  static std::vector<std::vector<double> > last_draws_per_run;\n  static bool matches_tagged_version;\n  static bool all_values_same;\n};\n\nint performance::N;\nstd::vector<double> performance::seconds_per_run;\nstd::vector<std::vector<double> > performance::last_draws_per_run;\nbool performance::matches_tagged_version;\nbool performance::all_values_same;\n\n\nusing stan::test::performance::run_command_output;\nusing stan::test::performance::run_command;\nusing stan::test::performance::get_last_iteration_from_file;\nusing stan::test::performance::quote;\nusing stan::test::performance::get_git_hash;\nusing stan::test::performance::get_git_date;\nusing stan::test::performance::get_date;\n\nTEST_F(performance, run) {\n  clock_t t;\n  for (int n = 0; n < N; ++n) {\n    std::cout << \"iteration: \" << n << \" \/ \" << N << std::endl;\n    t = clock();      \/\/ start timer\n    stan::test::performance::command<stan_model>(1000,\n                                                 10000,\n                                                 \"src\/test\/test-models\/performance\/logistic.data.R\",\n                                                 \"test\/performance\/logistic_output.csv\",\n                                                 0U);\n    t = clock() - t;  \/\/ end timer\n    seconds_per_run[n] = static_cast<double>(t) \/ CLOCKS_PER_SEC;\n    last_draws_per_run[n]\n      = get_last_iteration_from_file(\"test\/performance\/logistic_output.csv\");\n  }\n  SUCCEED();\n}\n\n\/\/ evaluate\nTEST_F(performance, values_from_tagged_version) {\n  int N_values = 9;\n  ASSERT_EQ(N_values, last_draws_per_run[0].size())\n    << \"last tagged version, 2.16.0, had \" << N_values << \" elements\";\n\n  std::vector<double> first_run = last_draws_per_run[0];\n  EXPECT_FLOAT_EQ(-65.508499, first_run[0])\n    << \"lp__: index 0\";\n\n  EXPECT_FLOAT_EQ(0.78501701, first_run[1])\n    << \"accept_stat__: index 1\";\n\n  EXPECT_FLOAT_EQ(0.76857001, first_run[2])\n    << \"stepsize__: index 2\";\n\n  EXPECT_FLOAT_EQ(1, first_run[3])\n    << \"treedepth__: index 3\";\n\n  EXPECT_FLOAT_EQ(3, first_run[4])\n    << \"n_leapfrog__: index 4\";\n\n  EXPECT_FLOAT_EQ(0, first_run[5])\n    << \"divergent__: index 5\";\n\n  EXPECT_FLOAT_EQ(68.208702, first_run[6])\n    << \"energy__: index 6\";\n\n  EXPECT_FLOAT_EQ(1.4087501, first_run[7])\n    << \"beta.1: index 7\";\n\n  EXPECT_FLOAT_EQ(-0.69222099, first_run[8])\n    << \"beta.2: index 8\";\n\n  matches_tagged_version = !HasNonfatalFailure();\n}\n\nTEST_F(performance, values_same_run_to_run) {\n  int N_values = last_draws_per_run[0].size();\n\n  for (int i = 0; i < N_values; i++) {\n    double expected_value = last_draws_per_run[0][i];\n    for (int n = 1; n < N; n++) {\n      EXPECT_FLOAT_EQ(expected_value, last_draws_per_run[n][i])\n        << \"expecting run to run values to be the same. Found run \"\n        << n << \" to have different values than the 0th run for \"\n        << \"index: \" << i;\n    }\n  }\n  all_values_same = !HasNonfatalFailure();\n}\n\nTEST_F(performance, check_output_is_same) {\n  std::ifstream file_stream;\n  file_stream.open(\"test\/performance\/logistic_output.csv\",\n                   std::ios_base::in);\n  ASSERT_TRUE(file_stream.good());\n\n  std::string line, expected;\n\n  getline(file_stream, line);\n  ASSERT_EQ(\"lp__,accept_stat__,stepsize__,treedepth__,n_leapfrog__,divergent__,energy__,beta.1,beta.2\", line);\n  ASSERT_TRUE(file_stream.good());\n\n  getline(file_stream, line);\n  ASSERT_EQ(\"# Adaptation terminated\", line);\n  ASSERT_TRUE(file_stream.good());\n\n  file_stream.close();\n}\n\nTEST_F(performance, write_results_to_disk) {\n  std::stringstream header;\n  std::stringstream line;\n\n  \/\/ current date \/ time\n  header << quote(\"date\");\n  line << quote(get_date());\n\n  \/\/ git hash\n  header << \",\" << quote(\"git hash\") << \",\" << quote(\"git date\");\n  line << \",\" << quote(get_git_hash()) << \",\" << quote(get_git_date());\n\n  \/\/ model name: \"logistic\"\n  header << \",\" << quote(\"model name\");\n  line << \",\" << quote(\"logistic\");\n\n  \/\/ matches tagged values\n  header << \",\" << quote(\"matches tagged version\");\n  line << \",\" << quote(matches_tagged_version ? \"yes\" : \"no\");\n\n  \/\/ all values same\n  header << \",\" << quote(\"all values same\");\n  line << \",\" << quote(all_values_same ? \"yes\" : \"no\");\n\n  \/\/ N times\n  for (int n = 0; n < N; n++) {\n    std::stringstream ss;\n    ss << \"run \" << n+1;\n    header << \",\" << quote(ss.str());\n    line << \",\" << seconds_per_run[n];\n  }\n\n\n  \/\/ append output to: test\/performance\/performance.csv\n  bool write_header = false;\n  std::fstream file_stream;\n\n  file_stream.open(\"test\/performance\/performance.csv\",\n                   std::ios_base::in);\n  if (file_stream.peek() == std::fstream::traits_type::eof()) {\n    write_header = true;\n  } else {\n    std::string file_header;\n    std::getline(file_stream, file_header);\n\n    EXPECT_EQ(file_header, header.str())\n      << \"header of file is different\";\n    if (file_header != header.str())\n      write_header = true;\n  }\n  file_stream.close();\n\n  file_stream.open(\"test\/performance\/performance.csv\",\n                   std::ios_base::app);\n  if (write_header)\n    file_stream << header.str() << std::endl;\n  file_stream << line.str() << std::endl;\n  file_stream.close();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n Module:       FGEngine.cpp\n Author:       Jon Berndt\n Date started: 01\/21\/99\n Called by:    FGAircraft\n\n ------------- Copyright (C) 1999  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 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--------------------------------------------------------------------------------\nSee header file.\n\nHISTORY\n--------------------------------------------------------------------------------\n01\/21\/99   JSB   Created\n09\/03\/99   JSB   Changed Rocket thrust equation to correct -= Thrust instead of\n                 += Thrust (thanks to Tony Peden)\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nINCLUDES\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%*\/\n\n#include \"FGEngine.h\"\n#include \"FGTank.h\"\n#include \"FGPropeller.h\"\n#include \"FGNozzle.h\"\n#include \"input_output\/FGXMLParse.h\"\n#include \"math\/FGColumnVector3.h\"\n#include <fstream>\n\nnamespace JSBSim {\n\nstatic const char *IdSrc = \"$Id: FGEngine.cpp,v 1.30 2009\/10\/15 03:47:52 dpculp Exp $\";\nstatic const char *IdHdr = ID_ENGINE;\n\n\/*%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nCLASS IMPLEMENTATION\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%*\/\n\nFGEngine::FGEngine(FGFDMExec* exec, Element* engine_element, int engine_number)\n                      : EngineNumber(engine_number)\n{\n  Element* local_element;\n  FGColumnVector3 location, orientation;\n\n  Name = \"\";\n  Type = etUnknown;\n  X = Y = Z = 0.0;\n  EnginePitch = EngineYaw = 0.0;\n  SLFuelFlowMax = 0.0;\n  MaxThrottle = 1.0;\n  MinThrottle = 0.0;\n  unsigned int i;\n\n  ResetToIC(); \/\/ initialize dynamic terms\n\n  FDMExec = exec;\n  State = FDMExec->GetState();\n  Atmosphere = FDMExec->GetAtmosphere();\n  FCS = FDMExec->GetFCS();\n  Propulsion = FDMExec->GetPropulsion();\n  Aircraft = FDMExec->GetAircraft();\n  Propagate = FDMExec->GetPropagate();\n  Auxiliary = FDMExec->GetAuxiliary();\n\n  PropertyManager = FDMExec->GetPropertyManager();\n\n  Name = engine_element->GetAttributeValue(\"name\");\n\n\/\/ Find and set engine location\n\n  local_element = engine_element->GetParent()->FindElement(\"location\");\n  if (local_element)  location = local_element->FindElementTripletConvertTo(\"IN\");\n  else      cerr << \"No engine location found for this engine.\" << endl;\n\n  local_element = engine_element->GetParent()->FindElement(\"orient\");\n  if (local_element)  orientation = local_element->FindElementTripletConvertTo(\"RAD\");\n\/\/  else          cerr << \"No engine orientation found for this engine.\" << endl;\n\/\/ Jon: The engine orientation has a default and is not normally used.\n\n  SetPlacement(location, orientation);\n\n  \/\/ Load thruster\n  local_element = engine_element->GetParent()->FindElement(\"thruster\");\n  if (local_element) {\n    if (!LoadThruster(local_element)) exit(-1);\n  } else {\n    cerr << \"No thruster definition supplied with engine definition.\" << endl;\n  }\n\n  \/\/ Build and initialize the feed tank vector.\n  for (i=0; i<(Propulsion->GetNumTanks()); i++) {\n    SourceTanks.push_back(0);\n  }\n\n  \/\/ Load feed tank[s] references\n  local_element = engine_element->GetParent()->FindElement(\"feed\");\n  if (local_element) {\n    while (local_element) {\n      int tankID = (int)local_element->GetDataAsNumber();\n      AddFeedTank( tankID , Propulsion->GetTank(tankID)->GetPriority());\n      local_element = engine_element->GetParent()->FindNextElement(\"feed\");\n    }\n  } else {\n    cerr << \"No feed tank specified in engine definition.\" << endl;\n  }\n\n  string property_name, base_property_name;\n  base_property_name = CreateIndexedPropertyName(\"propulsion\/engine\", EngineNumber);\n\n  property_name = base_property_name + \"\/set-running\";\n  PropertyManager->Tie( property_name.c_str(), this, &FGEngine::GetRunning, &FGEngine::SetRunning );\n  property_name = base_property_name + \"\/thrust-lbs\";\n  PropertyManager->Tie( property_name.c_str(), Thruster, &FGThruster::GetThrust);\n  property_name = base_property_name + \"\/fuel-flow-rate-pps\";\n  PropertyManager->Tie( property_name.c_str(), this, &FGEngine::GetFuelFlowRate);\n\n  Debug(0);\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nFGEngine::~FGEngine()\n{\n  delete Thruster;\n  Debug(1);\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nvoid FGEngine::ResetToIC(void)\n{\n  Throttle = 0.0;\n  Mixture = 1.0;\n  Starter = false;\n  FuelExpended = 0.0;\n  Starved = Running = Cranking = false;\n  PctPower = 0.0;\n  TrimMode = false;\n  FuelFlow_gph = 0.0;\n  FuelFlow_pph = 0.0;\n  FuelFreeze = false;\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\/\/ This base class function should be called from within the\n\/\/ derived class' Calculate() function before any other calculations are done.\n\/\/ This base class method removes fuel from the fuel tanks as appropriate,\n\/\/ and sets the starved flag if necessary.\n\/\/ This version of the fuel consumption code should never see an oxidizer tank.\n\nvoid FGEngine::ConsumeFuel(void)\n{\n  if (FuelFreeze) return;\n  if (TrimMode) return;\n\n  unsigned int i;\n  double Fshortage, FuelNeeded;\n  FGTank* Tank;\n  unsigned int TanksWithFuel = 0;\n  Fshortage = FuelNeeded = 0.0;\n  double FuelToBurn;\n  unsigned int CurrentPriority = 1;\n  vector <int> FeedList;\n  Starved = false;\n\n  FuelToBurn = CalcFuelNeed();\n\n  while (FuelToBurn > 0.0) {\n\n    \/\/ Count how many fuel tanks with the current priority level have fuel.\n    \/\/ If none, then try next lower priority.  Build the feed list.\n    while ((TanksWithFuel == 0.0) && (CurrentPriority <= Propulsion->GetNumTanks())) {\n      for (i=0; i<Propulsion->GetNumTanks(); i++) {\n        if (SourceTanks[i] != 0) {\n          Tank = Propulsion->GetTank(i);\n          if (Tank->GetType() == FGTank::ttFUEL) {\n            if ((Tank->GetContents() > 0.0) && ((unsigned int)Tank->GetPriority() == CurrentPriority)) {\n               ++TanksWithFuel;\n               FeedList.push_back(i);\n             } \n          } else {\n             cerr << \"No oxidizer tanks should be used for this engine type.\" << endl;\n          }\n        }\n      }\n      if (TanksWithFuel == 0) CurrentPriority++;\n    }\n\n    \/\/ No fuel found at any priority!\n    if (TanksWithFuel == 0) {\n      Starved = true;\n      return;\n    }\n\n    \/\/ Remove equal amount of fuel from each feed tank.  \n    FuelNeeded = FuelToBurn\/TanksWithFuel;\n    for (i=0; i<FeedList.size(); i++) {\n      Tank = Propulsion->GetTank(FeedList[i]);\n      Tank->Drain(FuelNeeded); \n      FuelToBurn -= FuelNeeded;\n    }\n\n    \/\/ check if we were not able to burn all the fuel we needed to at this priority level\n    if (FuelToBurn > 0.001) {\n      CurrentPriority++;\n      TanksWithFuel = 0;\n      FeedList.clear();\n    }\n \n  }  \/\/ while\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\ndouble FGEngine::CalcFuelNeed(void)\n{\n  double dT = State->Getdt()*Propulsion->GetRate();\n  FuelFlowRate = SLFuelFlowMax*PctPower;\n  FuelExpended = FuelFlowRate*dT;\n  return FuelExpended;\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nvoid FGEngine::SetPlacement(FGColumnVector3& location, FGColumnVector3& orientation)\n{\n  X = location(eX);\n  Y = location(eY);\n  Z = location(eZ);\n  EnginePitch = orientation(ePitch);\n  EngineYaw = orientation (eYaw);\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nvoid FGEngine::AddFeedTank(int tkID, int priority)\n{\n  SourceTanks[tkID] = priority;\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nFGColumnVector3& FGEngine::GetBodyForces(void)\n{\n  return Thruster->GetBodyForces();\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nFGColumnVector3& FGEngine::GetMoments(void)\n{\n  return Thruster->GetMoments();\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nbool FGEngine::LoadThruster(Element *thruster_element)\n{\n  string token, fullpath, localpath;\n  string thruster_filename, thruster_fullpathname, thrType;\n  string enginePath = FDMExec->GetEnginePath();\n  string aircraftPath = FDMExec->GetFullAircraftPath();\n  ifstream thruster_file;\n  FGColumnVector3 location, orientation;\n  string separator = \"\/\";\n\n  fullpath = enginePath + separator;\n  localpath = aircraftPath + separator + \"Engines\" + separator;\n\n  thruster_filename = thruster_element->GetAttributeValue(\"file\");\n  if ( !thruster_filename.empty()) {\n    thruster_fullpathname = fullpath + thruster_filename + \".xml\";\n    thruster_file.open(thruster_fullpathname.c_str());\n    if ( !thruster_file.is_open()) {\n      thruster_fullpathname = localpath + thruster_filename + \".xml\";\n      thruster_file.open(thruster_fullpathname.c_str());\n      if ( !thruster_file.is_open()) {\n        cerr << \"Could not open thruster file: \" << thruster_filename << \".xml\" << endl;\n        return false;\n      } else {\n        thruster_file.close();\n      }\n    } else {\n      thruster_file.close();\n    }\n  } else {\n    cerr << \"No thruster filename given.\" << endl;\n    return false;\n  }\n\n  document = LoadXMLDocument(thruster_fullpathname);\n  document->SetParent(thruster_element);\n\n  thrType = document->GetName();\n\n  if (thrType == \"propeller\") {\n    Thruster = new FGPropeller(FDMExec, document, EngineNumber);\n  } else if (thrType == \"nozzle\") {\n    Thruster = new FGNozzle(FDMExec, document, EngineNumber);\n  } else if (thrType == \"direct\") {\n    Thruster = new FGThruster( FDMExec, document, EngineNumber);\n  }\n\n  Thruster->SetdeltaT(State->Getdt() * Propulsion->GetRate());\n\n  Debug(2);\n  return true;\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 FGEngine::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\n    }\n    if (from == 2) { \/\/ After thruster loading\n      cout << \"      X = \" << Thruster->GetLocationX() << endl;\n      cout << \"      Y = \" << Thruster->GetLocationY() << endl;\n      cout << \"      Z = \" << Thruster->GetLocationZ() << endl;\n      cout << \"      Pitch = \" << radtodeg*Thruster->GetAnglesToBody(ePitch) << \" degrees\" << endl;\n      cout << \"      Yaw = \" << radtodeg*Thruster->GetAnglesToBody(eYaw) << \" degrees\" << endl;\n    }\n  }\n  if (debug_lvl & 2 ) { \/\/ Instantiation\/Destruction notification\n    if (from == 0) cout << \"Instantiated: FGEngine\" << endl;\n    if (from == 1) cout << \"Destroyed:    FGEngine\" << 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>This is the looping fix.<commit_after>\/*%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n Module:       FGEngine.cpp\n Author:       Jon Berndt\n Date started: 01\/21\/99\n Called by:    FGAircraft\n\n ------------- Copyright (C) 1999  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 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--------------------------------------------------------------------------------\nSee header file.\n\nHISTORY\n--------------------------------------------------------------------------------\n01\/21\/99   JSB   Created\n09\/03\/99   JSB   Changed Rocket thrust equation to correct -= Thrust instead of\n                 += Thrust (thanks to Tony Peden)\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nINCLUDES\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%*\/\n\n#include \"FGEngine.h\"\n#include \"FGTank.h\"\n#include \"FGPropeller.h\"\n#include \"FGNozzle.h\"\n#include \"input_output\/FGXMLParse.h\"\n#include \"math\/FGColumnVector3.h\"\n#include <fstream>\n\nnamespace JSBSim {\n\nstatic const char *IdSrc = \"$Id: FGEngine.cpp,v 1.31 2009\/10\/15 13:30:42 dpculp Exp $\";\nstatic const char *IdHdr = ID_ENGINE;\n\n\/*%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nCLASS IMPLEMENTATION\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%*\/\n\nFGEngine::FGEngine(FGFDMExec* exec, Element* engine_element, int engine_number)\n                      : EngineNumber(engine_number)\n{\n  Element* local_element;\n  FGColumnVector3 location, orientation;\n\n  Name = \"\";\n  Type = etUnknown;\n  X = Y = Z = 0.0;\n  EnginePitch = EngineYaw = 0.0;\n  SLFuelFlowMax = 0.0;\n  MaxThrottle = 1.0;\n  MinThrottle = 0.0;\n  unsigned int i;\n\n  ResetToIC(); \/\/ initialize dynamic terms\n\n  FDMExec = exec;\n  State = FDMExec->GetState();\n  Atmosphere = FDMExec->GetAtmosphere();\n  FCS = FDMExec->GetFCS();\n  Propulsion = FDMExec->GetPropulsion();\n  Aircraft = FDMExec->GetAircraft();\n  Propagate = FDMExec->GetPropagate();\n  Auxiliary = FDMExec->GetAuxiliary();\n\n  PropertyManager = FDMExec->GetPropertyManager();\n\n  Name = engine_element->GetAttributeValue(\"name\");\n\n\/\/ Find and set engine location\n\n  local_element = engine_element->GetParent()->FindElement(\"location\");\n  if (local_element)  location = local_element->FindElementTripletConvertTo(\"IN\");\n  else      cerr << \"No engine location found for this engine.\" << endl;\n\n  local_element = engine_element->GetParent()->FindElement(\"orient\");\n  if (local_element)  orientation = local_element->FindElementTripletConvertTo(\"RAD\");\n\/\/  else          cerr << \"No engine orientation found for this engine.\" << endl;\n\/\/ Jon: The engine orientation has a default and is not normally used.\n\n  SetPlacement(location, orientation);\n\n  \/\/ Load thruster\n  local_element = engine_element->GetParent()->FindElement(\"thruster\");\n  if (local_element) {\n    if (!LoadThruster(local_element)) exit(-1);\n  } else {\n    cerr << \"No thruster definition supplied with engine definition.\" << endl;\n  }\n\n  \/\/ Build and initialize the feed tank vector.\n  for (i=0; i<(Propulsion->GetNumTanks()); i++) {\n    SourceTanks.push_back(0);\n  }\n\n  \/\/ Load feed tank[s] references\n  local_element = engine_element->GetParent()->FindElement(\"feed\");\n  if (local_element) {\n    while (local_element) {\n      int tankID = (int)local_element->GetDataAsNumber();\n      AddFeedTank( tankID , Propulsion->GetTank(tankID)->GetPriority());\n      local_element = engine_element->GetParent()->FindNextElement(\"feed\");\n    }\n  } else {\n    cerr << \"No feed tank specified in engine definition.\" << endl;\n  }\n\n  string property_name, base_property_name;\n  base_property_name = CreateIndexedPropertyName(\"propulsion\/engine\", EngineNumber);\n\n  property_name = base_property_name + \"\/set-running\";\n  PropertyManager->Tie( property_name.c_str(), this, &FGEngine::GetRunning, &FGEngine::SetRunning );\n  property_name = base_property_name + \"\/thrust-lbs\";\n  PropertyManager->Tie( property_name.c_str(), Thruster, &FGThruster::GetThrust);\n  property_name = base_property_name + \"\/fuel-flow-rate-pps\";\n  PropertyManager->Tie( property_name.c_str(), this, &FGEngine::GetFuelFlowRate);\n\n  Debug(0);\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nFGEngine::~FGEngine()\n{\n  delete Thruster;\n  Debug(1);\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nvoid FGEngine::ResetToIC(void)\n{\n  Throttle = 0.0;\n  Mixture = 1.0;\n  Starter = false;\n  FuelExpended = 0.0;\n  Starved = Running = Cranking = false;\n  PctPower = 0.0;\n  TrimMode = false;\n  FuelFlow_gph = 0.0;\n  FuelFlow_pph = 0.0;\n  FuelFreeze = false;\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\/\/ This base class function should be called from within the\n\/\/ derived class' Calculate() function before any other calculations are done.\n\/\/ This base class method removes fuel from the fuel tanks as appropriate,\n\/\/ and sets the starved flag if necessary.\n\/\/ This version of the fuel consumption code should never see an oxidizer tank.\n\nvoid FGEngine::ConsumeFuel(void)\n{\n  if (FuelFreeze) return;\n  if (TrimMode) return;\n\n  unsigned int i;\n  double Fshortage, FuelNeeded;\n  FGTank* Tank;\n  unsigned int TanksWithFuel = 0;\n  Fshortage = FuelNeeded = 0.0;\n  double FuelToBurn;\n  unsigned int CurrentPriority = 1;\n  vector <int> FeedList;\n  Starved = false;\n\n  FuelToBurn = CalcFuelNeed();\n\n  while (FuelToBurn > 0.0) {\n\n    \/\/ Count how many fuel tanks with the current priority level have fuel.\n    \/\/ If none, then try next lower priority.  Build the feed list.\n    while ((TanksWithFuel == 0.0) && (CurrentPriority <= Propulsion->GetNumTanks())) {\n      for (i=0; i<Propulsion->GetNumTanks(); i++) {\n        if (SourceTanks[i] != 0) {\n          Tank = Propulsion->GetTank(i);\n          if (Tank->GetType() == FGTank::ttFUEL) {\n            if ((Tank->GetContents() > 0.0) && ((unsigned int)Tank->GetPriority() == CurrentPriority)) {\n               ++TanksWithFuel;\n               FeedList.push_back(i);\n             } \n          } else {\n             cerr << \"No oxidizer tanks should be used for this engine type.\" << endl;\n          }\n        }\n      }\n      if (TanksWithFuel == 0) CurrentPriority++;\n    }\n\n    \/\/ No fuel found at any priority!\n    if (TanksWithFuel == 0) {\n      Starved = true;\n      return;\n    }\n\n    \/\/ Remove equal amount of fuel from each feed tank.  \n    FuelNeeded = FuelToBurn\/TanksWithFuel;\n    for (i=0; i<FeedList.size(); i++) {\n      Tank = Propulsion->GetTank(FeedList[i]);\n      Tank->Drain(FuelNeeded); \n      FuelToBurn -= FuelNeeded;\n    }\n\n    \/\/ check if we were not able to burn all the fuel we needed to at this priority level\n    if (FuelToBurn > 0.0) {\n      CurrentPriority++;\n      TanksWithFuel = 0;\n      FeedList.clear();\n    }\n \n  }  \/\/ while\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\ndouble FGEngine::CalcFuelNeed(void)\n{\n  double dT = State->Getdt()*Propulsion->GetRate();\n  FuelFlowRate = SLFuelFlowMax*PctPower;\n  FuelExpended = FuelFlowRate*dT;\n  return FuelExpended;\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nvoid FGEngine::SetPlacement(FGColumnVector3& location, FGColumnVector3& orientation)\n{\n  X = location(eX);\n  Y = location(eY);\n  Z = location(eZ);\n  EnginePitch = orientation(ePitch);\n  EngineYaw = orientation (eYaw);\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nvoid FGEngine::AddFeedTank(int tkID, int priority)\n{\n  SourceTanks[tkID] = priority;\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nFGColumnVector3& FGEngine::GetBodyForces(void)\n{\n  return Thruster->GetBodyForces();\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nFGColumnVector3& FGEngine::GetMoments(void)\n{\n  return Thruster->GetMoments();\n}\n\n\/\/%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nbool FGEngine::LoadThruster(Element *thruster_element)\n{\n  string token, fullpath, localpath;\n  string thruster_filename, thruster_fullpathname, thrType;\n  string enginePath = FDMExec->GetEnginePath();\n  string aircraftPath = FDMExec->GetFullAircraftPath();\n  ifstream thruster_file;\n  FGColumnVector3 location, orientation;\n  string separator = \"\/\";\n\n  fullpath = enginePath + separator;\n  localpath = aircraftPath + separator + \"Engines\" + separator;\n\n  thruster_filename = thruster_element->GetAttributeValue(\"file\");\n  if ( !thruster_filename.empty()) {\n    thruster_fullpathname = fullpath + thruster_filename + \".xml\";\n    thruster_file.open(thruster_fullpathname.c_str());\n    if ( !thruster_file.is_open()) {\n      thruster_fullpathname = localpath + thruster_filename + \".xml\";\n      thruster_file.open(thruster_fullpathname.c_str());\n      if ( !thruster_file.is_open()) {\n        cerr << \"Could not open thruster file: \" << thruster_filename << \".xml\" << endl;\n        return false;\n      } else {\n        thruster_file.close();\n      }\n    } else {\n      thruster_file.close();\n    }\n  } else {\n    cerr << \"No thruster filename given.\" << endl;\n    return false;\n  }\n\n  document = LoadXMLDocument(thruster_fullpathname);\n  document->SetParent(thruster_element);\n\n  thrType = document->GetName();\n\n  if (thrType == \"propeller\") {\n    Thruster = new FGPropeller(FDMExec, document, EngineNumber);\n  } else if (thrType == \"nozzle\") {\n    Thruster = new FGNozzle(FDMExec, document, EngineNumber);\n  } else if (thrType == \"direct\") {\n    Thruster = new FGThruster( FDMExec, document, EngineNumber);\n  }\n\n  Thruster->SetdeltaT(State->Getdt() * Propulsion->GetRate());\n\n  Debug(2);\n  return true;\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 FGEngine::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\n    }\n    if (from == 2) { \/\/ After thruster loading\n      cout << \"      X = \" << Thruster->GetLocationX() << endl;\n      cout << \"      Y = \" << Thruster->GetLocationY() << endl;\n      cout << \"      Z = \" << Thruster->GetLocationZ() << endl;\n      cout << \"      Pitch = \" << radtodeg*Thruster->GetAnglesToBody(ePitch) << \" degrees\" << endl;\n      cout << \"      Yaw = \" << radtodeg*Thruster->GetAnglesToBody(eYaw) << \" degrees\" << endl;\n    }\n  }\n  if (debug_lvl & 2 ) { \/\/ Instantiation\/Destruction notification\n    if (from == 0) cout << \"Instantiated: FGEngine\" << endl;\n    if (from == 1) cout << \"Destroyed:    FGEngine\" << 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 Copyright 2016 Nervana Systems Inc.\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n      http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 <fstream>\n#include <numeric>\n#include <sstream>\n\n#include <curl\/curl.h>\n#include <curl\/easy.h>\n#include <curl\/curlbuild.h>\n\n#include \"json.hpp\"\n#include \"manifest_nds.hpp\"\n#include \"interface.hpp\"\n#include \"cpio.hpp\"\n\nusing namespace std;\nusing namespace nervana;\n\nnetwork_client::network_client(const std::string& baseurl,\n                               const std::string& token,\n                               size_t             collection_id,\n                               size_t             block_size,\n                               size_t             shard_count,\n                               size_t             shard_index)\n    : m_baseurl(baseurl)\n    , m_token(token)\n    , m_collection_id(collection_id)\n    , m_shard_count(shard_count)\n    , m_shard_index(shard_index)\n    , m_macrobatch_size(block_size)\n{\n    curl_global_init(CURL_GLOBAL_ALL);\n}\n\nnetwork_client::~network_client()\n{\n    curl_global_cleanup();\n}\n\nsize_t network_client::callback(void* ptr, size_t size, size_t nmemb, void* stream)\n{\n    stringstream& ss = *(stringstream*)stream;\n    \/\/ callback used by curl.  writes data from ptr into the\n    \/\/ stringstream passed in to `stream`.\n    ss.write((const char*)ptr, size * nmemb);\n    return size * nmemb;\n}\n\nvoid network_client::get(const string& url, stringstream& stream)\n{\n    \/\/ reuse curl connection across requests\n    void* m_curl = curl_easy_init();\n\n    \/\/ given a url, make an HTTP GET request and fill stream with\n    \/\/ the body of the response\n\n    curl_easy_setopt(m_curl, CURLOPT_URL, url.c_str());\n    curl_easy_setopt(m_curl, CURLOPT_WRITEFUNCTION, callback);\n    curl_easy_setopt(m_curl, CURLOPT_WRITEDATA, &stream);\n    curl_easy_setopt(m_curl, CURLOPT_NOPROXY, \"127.0.0.1,localhost\");\n\n    \/\/ Perform the request, res will get the return code\n    CURLcode res = curl_easy_perform(m_curl);\n\n    \/\/ Check for errors\n    long http_code = 0;\n    curl_easy_getinfo(m_curl, CURLINFO_RESPONSE_CODE, &http_code);\n    if (http_code != 200 || res != CURLE_OK)\n    {\n        stringstream ss;\n        ss << \"HTTP GET on \\n'\" << url << \"' failed. \";\n        ss << \"status code: \" << http_code;\n        if (res != CURLE_OK)\n        {\n            ss << \" curl return: \" << curl_easy_strerror(res);\n        }\n\n        curl_easy_cleanup(m_curl);\n        throw std::runtime_error(ss.str());\n    }\n\n    curl_easy_cleanup(m_curl);\n}\n\nstring network_client::load_block_url(size_t block_num)\n{\n    stringstream ss;\n    ss << m_baseurl << \"\/macrobatch\/?\";\n    ss << \"macro_batch_index=\" << block_num;\n    ss << \"&macro_batch_max_size=\" << m_macrobatch_size;\n    ss << \"&collection_id=\" << m_collection_id;\n    ss << \"&shard_count=\" << m_shard_count;\n    ss << \"&shard_index=\" << m_shard_index;\n    ss << \"&token=\" << m_token;\n    return ss.str();\n}\n\nstring network_client::metadata_url()\n{\n    stringstream ss;\n    ss << m_baseurl << \"\/object_count\/?\";\n    ss << \"macro_batch_max_size=\" << m_macrobatch_size;\n    ss << \"&collection_id=\" << m_collection_id;\n    ss << \"&shard_count=\" << m_shard_count;\n    ss << \"&shard_index=\" << m_shard_index;\n    ss << \"&token=\" << m_token;\n    return ss.str();\n}\n\nmanifest_nds_builder& manifest_nds_builder::filename(const std::string& filename)\n{\n    parse_json(filename);\n    return *this;\n}\n\nmanifest_nds_builder& manifest_nds_builder::base_url(const std::string& url)\n{\n    m_base_url = url;\n    return *this;\n}\n\nmanifest_nds_builder& manifest_nds_builder::token(const std::string& token)\n{\n    m_token = token;\n    return *this;\n}\n\nmanifest_nds_builder& manifest_nds_builder::collection_id(size_t collection_id)\n{\n    m_collection_id = collection_id;\n    return *this;\n}\n\nmanifest_nds_builder& manifest_nds_builder::block_size(size_t block_size)\n{\n    m_block_size = block_size;\n    return *this;\n}\n\nmanifest_nds_builder& manifest_nds_builder::elements_per_record(size_t elements_per_record)\n{\n    m_elements_per_record = elements_per_record;\n    return *this;\n}\n\nmanifest_nds_builder& manifest_nds_builder::shard_count(size_t shard_count)\n{\n    m_shard_count = shard_count;\n    return *this;\n}\n\nmanifest_nds_builder& manifest_nds_builder::shard_index(size_t shard_index)\n{\n    m_shard_index = shard_index;\n    return *this;\n}\n\nmanifest_nds_builder& manifest_nds_builder::shuffle(bool enable)\n{\n    m_shuffle = enable;\n    return *this;\n}\n\nmanifest_nds_builder& manifest_nds_builder::seed(uint32_t seed)\n{\n    m_seed = seed;\n    return *this;\n}\n\nvoid manifest_nds_builder::parse_json(const std::string& filename)\n{\n    \/\/ parse json\n    nlohmann::json j;\n    try\n    {\n        ifstream ifs(filename);\n        ifs >> j;\n    }\n    catch (std::exception& ex)\n    {\n        stringstream ss;\n        ss << \"Error while parsing manifest json: \" << filename << \" : \";\n        ss << ex.what();\n        throw std::runtime_error(ss.str());\n    }\n\n    \/\/ extract manifest params from parsed json\n    try\n    {\n        interface::config::parse_value(m_base_url, \"url\", j, interface::config::mode::REQUIRED);\n\n        auto val = j.find(\"params\");\n        if (val != j.end())\n        {\n            nlohmann::json params = *val;\n            interface::config::parse_value(\n                m_token, \"token\", params, interface::config::mode::REQUIRED);\n            interface::config::parse_value(\n                m_collection_id, \"collection_id\", params, interface::config::mode::REQUIRED);\n        }\n        else\n        {\n            throw std::runtime_error(\"couldn't find key 'params' in nds manifest file.\");\n        }\n    }\n    catch (std::exception& ex)\n    {\n        stringstream ss;\n        ss << \"Error while pulling config out of manifest json: \" << filename << \" : \";\n        ss << ex.what();\n        throw std::runtime_error(ss.str());\n    }\n}\n\nmanifest_nds manifest_nds_builder::create()\n{\n    if (m_base_url == \"\")\n    {\n        throw invalid_argument(\"base_url is required\");\n    }\n    if (m_token == \"\")\n    {\n        throw invalid_argument(\"token is required\");\n    }\n    if (m_collection_id == -1)\n    {\n        throw invalid_argument(\"collection_id is required\");\n    }\n    if (m_elements_per_record == -1)\n    {\n        throw invalid_argument(\"elements_per_record is required\");\n    }\n\n    return manifest_nds(m_base_url,\n                        m_token,\n                        m_collection_id,\n                        m_block_size,\n                        m_elements_per_record,\n                        m_shard_count,\n                        m_shard_index,\n                        m_shuffle,\n                        m_seed);\n}\n\nstd::shared_ptr<manifest_nds> manifest_nds_builder::make_shared()\n{\n    return std::shared_ptr<manifest_nds>(new manifest_nds(m_base_url,\n                                                          m_token,\n                                                          m_collection_id,\n                                                          m_block_size,\n                                                          m_elements_per_record,\n                                                          m_shard_count,\n                                                          m_shard_index,\n                                                          m_shuffle,\n                                                          m_seed));\n}\n\nmanifest_nds::manifest_nds(const std::string& base_url,\n                           const std::string& token,\n                           size_t             collection_id,\n                           size_t             block_size,\n                           size_t             elements_per_record,\n                           size_t             shard_count,\n                           size_t             shard_index,\n                           bool               enable_shuffle,\n                           uint32_t           seed)\n    : m_base_url(base_url)\n    , m_token(token)\n    , m_collection_id(collection_id)\n    , m_block_size(block_size)\n    , m_elements_per_record(elements_per_record)\n    , m_shard_count(shard_count)\n    , m_shard_index(shard_index)\n    , m_network_client{base_url, token, collection_id, block_size, shard_count, shard_index}\n    , m_current_block_number{0}\n    , m_shuffle{enable_shuffle}\n    , m_rnd{seed ? seed : random_device{}()}\n{\n    load_metadata();\n\n    m_block_load_sequence.reserve(m_block_count);\n    m_block_load_sequence.resize(m_block_count);\n    iota(m_block_load_sequence.begin(), m_block_load_sequence.end(), 0);\n\n    if (m_shuffle)\n    {\n        shuffle(m_block_load_sequence.begin(), m_block_load_sequence.end(), m_rnd);\n    }\n\n    \/\/ \/\/ parse json\n    \/\/ nlohmann::json j;\n    \/\/ try\n    \/\/ {\n    \/\/     ifstream ifs(filename);\n    \/\/     ifs >> j;\n    \/\/ }\n    \/\/ catch (std::exception& ex)\n    \/\/ {\n    \/\/     stringstream ss;\n    \/\/     ss << \"Error while parsing manifest json: \" << filename << \" : \";\n    \/\/     ss << ex.what();\n    \/\/     throw std::runtime_error(ss.str());\n    \/\/ }\n\n    \/\/ \/\/ extract manifest params from parsed json\n    \/\/ try\n    \/\/ {\n    \/\/     interface::config::parse_value(m_baseurl, \"url\", j, interface::config::mode::REQUIRED);\n\n    \/\/     auto val = j.find(\"params\");\n    \/\/     if (val != j.end())\n    \/\/     {\n    \/\/         nlohmann::json params = *val;\n    \/\/         interface::config::parse_value(m_token, \"token\", params, interface::config::mode::REQUIRED);\n    \/\/         interface::config::parse_value(m_collection_id, \"collection_id\", params, interface::config::mode::REQUIRED);\n    \/\/     }\n    \/\/     else\n    \/\/     {\n    \/\/         throw std::runtime_error(\"couldn't find key 'params' in nds manifest file.\");\n    \/\/     }\n    \/\/ }\n    \/\/ catch (std::exception& ex)\n    \/\/ {\n    \/\/     stringstream ss;\n    \/\/     ss << \"Error while pulling config out of manifest json: \" << filename << \" : \";\n    \/\/     ss << ex.what();\n    \/\/     throw std::runtime_error(ss.str());\n    \/\/ }\n}\n\nencoded_record_list* manifest_nds::next()\n{\n    encoded_record_list* rc = nullptr;\n\n    if (m_current_block_number < m_block_count)\n    {\n        rc = load_block(m_block_load_sequence[m_current_block_number]);\n\n        m_current_block_number++;\n    }\n\n    return rc;\n}\n\nencoded_record_list* manifest_nds::load_block(size_t block_index)\n{\n    \/\/ not much use in mutlithreading here since in most cases, our next step is\n    \/\/ to shuffle the entire BufferPair, which requires the entire buffer loaded.\n    m_current_block.clear();\n\n    \/\/ get data from url and write it into cpio_stream\n    stringstream stream;\n    string       url = m_network_client.load_block_url(block_index);\n    m_network_client.get(url, stream);\n\n    \/\/ parse cpio_stream into dest one record (consisting of multiple elements) at a time\n    nervana::cpio::reader reader(stream);\n    size_t                record_count = reader.record_count();\n    for (size_t record_number = 0; record_number < record_count; record_number++)\n    {\n        encoded_record record;\n        for (size_t element = 0; element < m_elements_per_record; element++)\n        {\n            vector<char> buffer;\n            string       filename = reader.read(buffer);\n            if (filename == cpio::CPIO_TRAILER || filename == cpio::AEON_TRAILER)\n            {\n                break;\n            }\n            record.add_element(buffer);\n        }\n        m_current_block.add_record(record);\n    }\n    return &m_current_block;\n}\n\nstring manifest_nds::cache_id()\n{\n    stringstream contents;\n    contents << m_base_url << m_collection_id;\n    std::size_t  h = std::hash<std::string>()(contents.str());\n    stringstream ss;\n    ss << std::hex << h;\n    return ss.str();\n}\n\nbool manifest_nds::is_likely_json(const std::string filename)\n{\n    \/\/ check the first character of the file to see if it is a json\n    \/\/ object.  If so, we want to parse this as an NDS Manifest\n    \/\/ instead of a CSV\n    ifstream f(filename);\n    char     first_char;\n\n    f.get(first_char);\n\n    return first_char == '{';\n}\n\nsize_t manifest_nds::write_data(void* ptr, size_t size, size_t nmemb, void* stream)\n{\n    stringstream& ss = *(stringstream*)stream;\n    \/\/ callback used by curl.  writes data from ptr into the\n    \/\/ stringstream passed in to `stream`.\n\n    ss.write((const char*)ptr, size * nmemb);\n    return size * nmemb;\n}\n\nvoid manifest_nds::load_metadata()\n{\n    \/\/ fetch metadata and store in local attributes\n\n    stringstream json_stream;\n    string       url = m_network_client.metadata_url();\n    m_network_client.get(url, json_stream);\n    string         json_str = json_stream.str();\n    nlohmann::json metadata;\n\n    try\n    {\n        metadata = nlohmann::json::parse(json_str);\n    }\n    catch (std::exception& ex)\n    {\n        stringstream ss;\n        ss << \"exception parsing metadata from nds \";\n        ss << url << \" \" << ex.what() << \" \";\n        ss << json_str;\n        throw std::runtime_error(ss.str());\n    }\n\n    nervana::interface::config::parse_value(\n        m_record_count, \"record_count\", metadata, nervana::interface::config::mode::REQUIRED);\n    nervana::interface::config::parse_value(m_block_count,\n                                            \"macro_batch_per_shard\",\n                                            metadata,\n                                            nervana::interface::config::mode::REQUIRED);\n}\n<commit_msg>Exception refs in manifest_nds caught as const<commit_after>\/*\n Copyright 2016 Nervana Systems Inc.\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n      http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 <fstream>\n#include <numeric>\n#include <sstream>\n\n#include <curl\/curl.h>\n#include <curl\/easy.h>\n#include <curl\/curlbuild.h>\n\n#include \"json.hpp\"\n#include \"manifest_nds.hpp\"\n#include \"interface.hpp\"\n#include \"cpio.hpp\"\n\nusing namespace std;\nusing namespace nervana;\n\nnetwork_client::network_client(const std::string& baseurl,\n                               const std::string& token,\n                               size_t             collection_id,\n                               size_t             block_size,\n                               size_t             shard_count,\n                               size_t             shard_index)\n    : m_baseurl(baseurl)\n    , m_token(token)\n    , m_collection_id(collection_id)\n    , m_shard_count(shard_count)\n    , m_shard_index(shard_index)\n    , m_macrobatch_size(block_size)\n{\n    curl_global_init(CURL_GLOBAL_ALL);\n}\n\nnetwork_client::~network_client()\n{\n    curl_global_cleanup();\n}\n\nsize_t network_client::callback(void* ptr, size_t size, size_t nmemb, void* stream)\n{\n    stringstream& ss = *(stringstream*)stream;\n    \/\/ callback used by curl.  writes data from ptr into the\n    \/\/ stringstream passed in to `stream`.\n    ss.write((const char*)ptr, size * nmemb);\n    return size * nmemb;\n}\n\nvoid network_client::get(const string& url, stringstream& stream)\n{\n    \/\/ reuse curl connection across requests\n    void* m_curl = curl_easy_init();\n\n    \/\/ given a url, make an HTTP GET request and fill stream with\n    \/\/ the body of the response\n\n    curl_easy_setopt(m_curl, CURLOPT_URL, url.c_str());\n    curl_easy_setopt(m_curl, CURLOPT_WRITEFUNCTION, callback);\n    curl_easy_setopt(m_curl, CURLOPT_WRITEDATA, &stream);\n    curl_easy_setopt(m_curl, CURLOPT_NOPROXY, \"127.0.0.1,localhost\");\n\n    \/\/ Perform the request, res will get the return code\n    CURLcode res = curl_easy_perform(m_curl);\n\n    \/\/ Check for errors\n    long http_code = 0;\n    curl_easy_getinfo(m_curl, CURLINFO_RESPONSE_CODE, &http_code);\n    if (http_code != 200 || res != CURLE_OK)\n    {\n        stringstream ss;\n        ss << \"HTTP GET on \\n'\" << url << \"' failed. \";\n        ss << \"status code: \" << http_code;\n        if (res != CURLE_OK)\n        {\n            ss << \" curl return: \" << curl_easy_strerror(res);\n        }\n\n        curl_easy_cleanup(m_curl);\n        throw std::runtime_error(ss.str());\n    }\n\n    curl_easy_cleanup(m_curl);\n}\n\nstring network_client::load_block_url(size_t block_num)\n{\n    stringstream ss;\n    ss << m_baseurl << \"\/macrobatch\/?\";\n    ss << \"macro_batch_index=\" << block_num;\n    ss << \"&macro_batch_max_size=\" << m_macrobatch_size;\n    ss << \"&collection_id=\" << m_collection_id;\n    ss << \"&shard_count=\" << m_shard_count;\n    ss << \"&shard_index=\" << m_shard_index;\n    ss << \"&token=\" << m_token;\n    return ss.str();\n}\n\nstring network_client::metadata_url()\n{\n    stringstream ss;\n    ss << m_baseurl << \"\/object_count\/?\";\n    ss << \"macro_batch_max_size=\" << m_macrobatch_size;\n    ss << \"&collection_id=\" << m_collection_id;\n    ss << \"&shard_count=\" << m_shard_count;\n    ss << \"&shard_index=\" << m_shard_index;\n    ss << \"&token=\" << m_token;\n    return ss.str();\n}\n\nmanifest_nds_builder& manifest_nds_builder::filename(const std::string& filename)\n{\n    parse_json(filename);\n    return *this;\n}\n\nmanifest_nds_builder& manifest_nds_builder::base_url(const std::string& url)\n{\n    m_base_url = url;\n    return *this;\n}\n\nmanifest_nds_builder& manifest_nds_builder::token(const std::string& token)\n{\n    m_token = token;\n    return *this;\n}\n\nmanifest_nds_builder& manifest_nds_builder::collection_id(size_t collection_id)\n{\n    m_collection_id = collection_id;\n    return *this;\n}\n\nmanifest_nds_builder& manifest_nds_builder::block_size(size_t block_size)\n{\n    m_block_size = block_size;\n    return *this;\n}\n\nmanifest_nds_builder& manifest_nds_builder::elements_per_record(size_t elements_per_record)\n{\n    m_elements_per_record = elements_per_record;\n    return *this;\n}\n\nmanifest_nds_builder& manifest_nds_builder::shard_count(size_t shard_count)\n{\n    m_shard_count = shard_count;\n    return *this;\n}\n\nmanifest_nds_builder& manifest_nds_builder::shard_index(size_t shard_index)\n{\n    m_shard_index = shard_index;\n    return *this;\n}\n\nmanifest_nds_builder& manifest_nds_builder::shuffle(bool enable)\n{\n    m_shuffle = enable;\n    return *this;\n}\n\nmanifest_nds_builder& manifest_nds_builder::seed(uint32_t seed)\n{\n    m_seed = seed;\n    return *this;\n}\n\nvoid manifest_nds_builder::parse_json(const std::string& filename)\n{\n    \/\/ parse json\n    nlohmann::json j;\n    try\n    {\n        ifstream ifs(filename);\n        ifs >> j;\n    }\n    catch (const std::exception& ex)\n    {\n        stringstream ss;\n        ss << \"Error while parsing manifest json: \" << filename << \" : \";\n        ss << ex.what();\n        throw std::runtime_error(ss.str());\n    }\n\n    \/\/ extract manifest params from parsed json\n    try\n    {\n        interface::config::parse_value(m_base_url, \"url\", j, interface::config::mode::REQUIRED);\n\n        auto val = j.find(\"params\");\n        if (val != j.end())\n        {\n            nlohmann::json params = *val;\n            interface::config::parse_value(\n                m_token, \"token\", params, interface::config::mode::REQUIRED);\n            interface::config::parse_value(\n                m_collection_id, \"collection_id\", params, interface::config::mode::REQUIRED);\n        }\n        else\n        {\n            throw std::runtime_error(\"couldn't find key 'params' in nds manifest file.\");\n        }\n    }\n    catch (const std::exception& ex)\n    {\n        stringstream ss;\n        ss << \"Error while pulling config out of manifest json: \" << filename << \" : \";\n        ss << ex.what();\n        throw std::runtime_error(ss.str());\n    }\n}\n\nmanifest_nds manifest_nds_builder::create()\n{\n    if (m_base_url == \"\")\n    {\n        throw invalid_argument(\"base_url is required\");\n    }\n    if (m_token == \"\")\n    {\n        throw invalid_argument(\"token is required\");\n    }\n    if (m_collection_id == -1)\n    {\n        throw invalid_argument(\"collection_id is required\");\n    }\n    if (m_elements_per_record == -1)\n    {\n        throw invalid_argument(\"elements_per_record is required\");\n    }\n\n    return manifest_nds(m_base_url,\n                        m_token,\n                        m_collection_id,\n                        m_block_size,\n                        m_elements_per_record,\n                        m_shard_count,\n                        m_shard_index,\n                        m_shuffle,\n                        m_seed);\n}\n\nstd::shared_ptr<manifest_nds> manifest_nds_builder::make_shared()\n{\n    return std::shared_ptr<manifest_nds>(new manifest_nds(m_base_url,\n                                                          m_token,\n                                                          m_collection_id,\n                                                          m_block_size,\n                                                          m_elements_per_record,\n                                                          m_shard_count,\n                                                          m_shard_index,\n                                                          m_shuffle,\n                                                          m_seed));\n}\n\nmanifest_nds::manifest_nds(const std::string& base_url,\n                           const std::string& token,\n                           size_t             collection_id,\n                           size_t             block_size,\n                           size_t             elements_per_record,\n                           size_t             shard_count,\n                           size_t             shard_index,\n                           bool               enable_shuffle,\n                           uint32_t           seed)\n    : m_base_url(base_url)\n    , m_token(token)\n    , m_collection_id(collection_id)\n    , m_block_size(block_size)\n    , m_elements_per_record(elements_per_record)\n    , m_shard_count(shard_count)\n    , m_shard_index(shard_index)\n    , m_network_client{base_url, token, collection_id, block_size, shard_count, shard_index}\n    , m_current_block_number{0}\n    , m_shuffle{enable_shuffle}\n    , m_rnd{seed ? seed : random_device{}()}\n{\n    load_metadata();\n\n    m_block_load_sequence.reserve(m_block_count);\n    m_block_load_sequence.resize(m_block_count);\n    iota(m_block_load_sequence.begin(), m_block_load_sequence.end(), 0);\n\n    if (m_shuffle)\n    {\n        shuffle(m_block_load_sequence.begin(), m_block_load_sequence.end(), m_rnd);\n    }\n\n    \/\/ \/\/ parse json\n    \/\/ nlohmann::json j;\n    \/\/ try\n    \/\/ {\n    \/\/     ifstream ifs(filename);\n    \/\/     ifs >> j;\n    \/\/ }\n    \/\/ catch (std::exception& ex)\n    \/\/ {\n    \/\/     stringstream ss;\n    \/\/     ss << \"Error while parsing manifest json: \" << filename << \" : \";\n    \/\/     ss << ex.what();\n    \/\/     throw std::runtime_error(ss.str());\n    \/\/ }\n\n    \/\/ \/\/ extract manifest params from parsed json\n    \/\/ try\n    \/\/ {\n    \/\/     interface::config::parse_value(m_baseurl, \"url\", j, interface::config::mode::REQUIRED);\n\n    \/\/     auto val = j.find(\"params\");\n    \/\/     if (val != j.end())\n    \/\/     {\n    \/\/         nlohmann::json params = *val;\n    \/\/         interface::config::parse_value(m_token, \"token\", params, interface::config::mode::REQUIRED);\n    \/\/         interface::config::parse_value(m_collection_id, \"collection_id\", params, interface::config::mode::REQUIRED);\n    \/\/     }\n    \/\/     else\n    \/\/     {\n    \/\/         throw std::runtime_error(\"couldn't find key 'params' in nds manifest file.\");\n    \/\/     }\n    \/\/ }\n    \/\/ catch (std::exception& ex)\n    \/\/ {\n    \/\/     stringstream ss;\n    \/\/     ss << \"Error while pulling config out of manifest json: \" << filename << \" : \";\n    \/\/     ss << ex.what();\n    \/\/     throw std::runtime_error(ss.str());\n    \/\/ }\n}\n\nencoded_record_list* manifest_nds::next()\n{\n    encoded_record_list* rc = nullptr;\n\n    if (m_current_block_number < m_block_count)\n    {\n        rc = load_block(m_block_load_sequence[m_current_block_number]);\n\n        m_current_block_number++;\n    }\n\n    return rc;\n}\n\nencoded_record_list* manifest_nds::load_block(size_t block_index)\n{\n    \/\/ not much use in mutlithreading here since in most cases, our next step is\n    \/\/ to shuffle the entire BufferPair, which requires the entire buffer loaded.\n    m_current_block.clear();\n\n    \/\/ get data from url and write it into cpio_stream\n    stringstream stream;\n    string       url = m_network_client.load_block_url(block_index);\n    m_network_client.get(url, stream);\n\n    \/\/ parse cpio_stream into dest one record (consisting of multiple elements) at a time\n    nervana::cpio::reader reader(stream);\n    size_t                record_count = reader.record_count();\n    for (size_t record_number = 0; record_number < record_count; record_number++)\n    {\n        encoded_record record;\n        for (size_t element = 0; element < m_elements_per_record; element++)\n        {\n            vector<char> buffer;\n            string       filename = reader.read(buffer);\n            if (filename == cpio::CPIO_TRAILER || filename == cpio::AEON_TRAILER)\n            {\n                break;\n            }\n            record.add_element(buffer);\n        }\n        m_current_block.add_record(record);\n    }\n    return &m_current_block;\n}\n\nstring manifest_nds::cache_id()\n{\n    stringstream contents;\n    contents << m_base_url << m_collection_id;\n    std::size_t  h = std::hash<std::string>()(contents.str());\n    stringstream ss;\n    ss << std::hex << h;\n    return ss.str();\n}\n\nbool manifest_nds::is_likely_json(const std::string filename)\n{\n    \/\/ check the first character of the file to see if it is a json\n    \/\/ object.  If so, we want to parse this as an NDS Manifest\n    \/\/ instead of a CSV\n    ifstream f(filename);\n    char     first_char;\n\n    f.get(first_char);\n\n    return first_char == '{';\n}\n\nsize_t manifest_nds::write_data(void* ptr, size_t size, size_t nmemb, void* stream)\n{\n    stringstream& ss = *(stringstream*)stream;\n    \/\/ callback used by curl.  writes data from ptr into the\n    \/\/ stringstream passed in to `stream`.\n\n    ss.write((const char*)ptr, size * nmemb);\n    return size * nmemb;\n}\n\nvoid manifest_nds::load_metadata()\n{\n    \/\/ fetch metadata and store in local attributes\n\n    stringstream json_stream;\n    string       url = m_network_client.metadata_url();\n    m_network_client.get(url, json_stream);\n    string         json_str = json_stream.str();\n    nlohmann::json metadata;\n\n    try\n    {\n        metadata = nlohmann::json::parse(json_str);\n    }\n    catch (const std::exception& ex)\n    {\n        stringstream ss;\n        ss << \"exception parsing metadata from nds \";\n        ss << url << \" \" << ex.what() << \" \";\n        ss << json_str;\n        throw std::runtime_error(ss.str());\n    }\n\n    nervana::interface::config::parse_value(\n        m_record_count, \"record_count\", metadata, nervana::interface::config::mode::REQUIRED);\n    nervana::interface::config::parse_value(m_block_count,\n                                            \"macro_batch_per_shard\",\n                                            metadata,\n                                            nervana::interface::config::mode::REQUIRED);\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 <gtest\/gtest.h>\n\n#include <queue>\n#include <string>\n#include <vector>\n\n#include <sys\/wait.h>\n\n#include \"base\/bind.h\"\n#include \"base\/eintr_wrapper.h\"\n#include \"base\/file_util.h\"\n#include \"base\/synchronization\/waitable_event.h\"\n#include \"base\/threading\/thread.h\"\n#include \"chrome\/browser\/chromeos\/process_proxy\/process_output_watcher.h\"\n\nstruct TestCase {\n  std::string str;\n  ProcessOutputType type;\n\n  TestCase(const char* expected_string,\n           size_t expected_string_length,\n           ProcessOutputType expected_type)\n      : str(expected_string, expected_string_length),\n        type(expected_type) {\n  }\n  TestCase(const std::string& expected_string, ProcessOutputType expected_type)\n      : str(expected_string),\n        type(expected_type) {\n  }\n};\n\nclass ProcessWatcherExpectations {\n public:\n  ProcessWatcherExpectations() {}\n\n  void Init(const std::vector<TestCase>& expectations) {\n    received_from_out_ = 0;\n\n    for (size_t i = 0; i < expectations.size(); i++) {\n      out_expectations_.append(expectations[i].str.c_str(),\n                               expectations[i].str.length());\n    }\n  }\n\n  bool CheckExpectations(const std::string& data, ProcessOutputType type) {\n    EXPECT_EQ(PROCESS_OUTPUT_TYPE_OUT, type);\n    if (!type == PROCESS_OUTPUT_TYPE_OUT)\n      return false;\n\n    EXPECT_LT(received_from_out_, out_expectations_.length());\n    if (received_from_out_ >= out_expectations_.length())\n      return false;\n\n    EXPECT_EQ(received_from_out_,\n              out_expectations_.find(data, received_from_out_));\n\n    received_from_out_ += data.length();\n    return true;\n  }\n\n  bool IsDone() {\n    return received_from_out_ >= out_expectations_.length();\n  }\n\n private:\n  std::string out_expectations_;\n  size_t received_from_out_;\n};\n\nclass ProcessOutputWatcherTest : public testing::Test {\npublic:\n  void StartWatch(int pt, int stop,\n                  const std::vector<TestCase>& expectations) {\n    expectations_.Init(expectations);\n\n    \/\/ This will delete itself.\n    ProcessOutputWatcher* crosh_watcher = new ProcessOutputWatcher(pt, stop,\n        base::Bind(&ProcessOutputWatcherTest::OnRead, base::Unretained(this)));\n    crosh_watcher->Start();\n  }\n\n  void OnRead(ProcessOutputType type, const std::string& output) {\n    bool success = expectations_.CheckExpectations(output, type);\n    if (!success || expectations_.IsDone())\n      all_data_received_->Signal();\n  }\n\n protected:\n  std::string VeryLongString() {\n    std::string result = \"0123456789\";\n    for (int i = 0; i < 8; i++)\n      result = result.append(result);\n    return result;\n  }\n\n  scoped_ptr<base::WaitableEvent> all_data_received_;\n\n private:\n  ProcessWatcherExpectations expectations_;\n  std::vector<TestCase> exp;\n};\n\n\nTEST_F(ProcessOutputWatcherTest, OutputWatcher) {\n  all_data_received_.reset(new base::WaitableEvent(true, false));\n\n  base::Thread output_watch_thread(\"ProcessOutpuWatchThread\");\n  ASSERT_TRUE(output_watch_thread.Start());\n\n  int pt_pipe[2], stop_pipe[2];\n  ASSERT_FALSE(HANDLE_EINTR(pipe(pt_pipe)));\n  ASSERT_FALSE(HANDLE_EINTR(pipe(stop_pipe)));\n\n  \/\/ TODO(tbarzic): We don't support stderr anymore, so this can be simplified.\n  std::vector<TestCase> test_cases;\n  test_cases.push_back(TestCase(\"testing output\\n\", PROCESS_OUTPUT_TYPE_OUT));\n  test_cases.push_back(TestCase(\"testing error\\n\", PROCESS_OUTPUT_TYPE_OUT));\n  test_cases.push_back(TestCase(\"testing error1\\n\", PROCESS_OUTPUT_TYPE_OUT));\n  test_cases.push_back(TestCase(\"testing output1\\n\", PROCESS_OUTPUT_TYPE_OUT));\n  test_cases.push_back(TestCase(\"testing output2\\n\", PROCESS_OUTPUT_TYPE_OUT));\n  test_cases.push_back(TestCase(\"testing output3\\n\", PROCESS_OUTPUT_TYPE_OUT));\n  test_cases.push_back(TestCase(VeryLongString(), PROCESS_OUTPUT_TYPE_OUT));\n  test_cases.push_back(TestCase(\"testing error2\\n\", PROCESS_OUTPUT_TYPE_OUT));\n  test_cases.push_back(TestCase(\"line with \\0 in it\\n\",\n                                arraysize(\"line with \\0 in it \\n\"),\n                                PROCESS_OUTPUT_TYPE_OUT));\n\n  output_watch_thread.message_loop()->PostTask(FROM_HERE,\n      base::Bind(&ProcessOutputWatcherTest::StartWatch, base::Unretained(this),\n                 pt_pipe[0], stop_pipe[0], test_cases));\n\n  for (size_t i = 0; i < test_cases.size(); i++) {\n    \/\/ Let's make inputs not NULL terminated.\n    const std::string& test_str = test_cases[i].str;\n    ssize_t test_size = test_str.length() * sizeof(*test_str.c_str());\n    EXPECT_EQ(test_size,\n              file_util::WriteFileDescriptor(pt_pipe[1], test_str.c_str(),\n                                             test_size));\n  }\n\n  all_data_received_->Wait();\n\n  \/\/ Send stop signal. It is not important which string we send.\n  EXPECT_EQ(1, file_util::WriteFileDescriptor(stop_pipe[1], \"q\", 1));\n\n  EXPECT_NE(-1, HANDLE_EINTR(close(stop_pipe[1])));\n  EXPECT_NE(-1, HANDLE_EINTR(close(pt_pipe[1])));\n\n  output_watch_thread.Stop();\n};\n\n<commit_msg>Fix ProcessOutputWatcherTest.OutputWatcher under ASAN<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 <gtest\/gtest.h>\n\n#include <queue>\n#include <string>\n#include <vector>\n\n#include <sys\/wait.h>\n\n#include \"base\/bind.h\"\n#include \"base\/eintr_wrapper.h\"\n#include \"base\/file_util.h\"\n#include \"base\/synchronization\/waitable_event.h\"\n#include \"base\/threading\/thread.h\"\n#include \"chrome\/browser\/chromeos\/process_proxy\/process_output_watcher.h\"\n\nstruct TestCase {\n  std::string str;\n  bool should_send_terminating_null;\n\n  TestCase(const std::string& expected_string,\n           bool send_terminating_null)\n      : str(expected_string),\n        should_send_terminating_null(send_terminating_null) {\n  }\n};\n\nclass ProcessWatcherExpectations {\n public:\n  ProcessWatcherExpectations() {}\n\n  void Init(const std::vector<TestCase>& expectations) {\n    received_from_out_ = 0;\n\n    for (size_t i = 0; i < expectations.size(); i++) {\n      out_expectations_.append(expectations[i].str);\n      if (expectations[i].should_send_terminating_null)\n        out_expectations_.append(std::string(\"\", 1));\n    }\n  }\n\n  bool CheckExpectations(const std::string& data, ProcessOutputType type) {\n    EXPECT_EQ(PROCESS_OUTPUT_TYPE_OUT, type);\n    if (!type == PROCESS_OUTPUT_TYPE_OUT)\n      return false;\n\n    EXPECT_LT(received_from_out_, out_expectations_.length());\n    if (received_from_out_ >= out_expectations_.length())\n      return false;\n\n    EXPECT_EQ(received_from_out_,\n              out_expectations_.find(data, received_from_out_));\n\n    received_from_out_ += data.length();\n    return true;\n  }\n\n  bool IsDone() {\n    return received_from_out_ >= out_expectations_.length();\n  }\n\n private:\n  std::string out_expectations_;\n  size_t received_from_out_;\n};\n\nclass ProcessOutputWatcherTest : public testing::Test {\npublic:\n  void StartWatch(int pt, int stop,\n                  const std::vector<TestCase>& expectations) {\n    expectations_.Init(expectations);\n\n    \/\/ This will delete itself.\n    ProcessOutputWatcher* crosh_watcher = new ProcessOutputWatcher(pt, stop,\n        base::Bind(&ProcessOutputWatcherTest::OnRead, base::Unretained(this)));\n    crosh_watcher->Start();\n  }\n\n  void OnRead(ProcessOutputType type, const std::string& output) {\n    bool success = expectations_.CheckExpectations(output, type);\n    if (!success || expectations_.IsDone())\n      all_data_received_->Signal();\n  }\n\n protected:\n  std::string VeryLongString() {\n    std::string result = \"0123456789\";\n    for (int i = 0; i < 8; i++)\n      result = result.append(result);\n    return result;\n  }\n\n  void RunTest(const std::vector<TestCase>& test_cases) {\n    all_data_received_.reset(new base::WaitableEvent(true, false));\n\n    base::Thread output_watch_thread(\"ProcessOutpuWatchThread\");\n    ASSERT_TRUE(output_watch_thread.Start());\n\n    int pt_pipe[2], stop_pipe[2];\n    ASSERT_FALSE(HANDLE_EINTR(pipe(pt_pipe)));\n    ASSERT_FALSE(HANDLE_EINTR(pipe(stop_pipe)));\n\n    output_watch_thread.message_loop()->PostTask(FROM_HERE,\n        base::Bind(&ProcessOutputWatcherTest::StartWatch,\n                   base::Unretained(this),\n                   pt_pipe[0], stop_pipe[0], test_cases));\n\n    for (size_t i = 0; i < test_cases.size(); i++) {\n      const std::string& test_str = test_cases[i].str;\n      \/\/ Let's make inputs not NULL terminated, unless other is specified in\n      \/\/ the test case.\n      ssize_t test_size = test_str.length() * sizeof(*test_str.c_str());\n      if (test_cases[i].should_send_terminating_null)\n        test_size += sizeof(*test_str.c_str());\n      EXPECT_EQ(test_size,\n                file_util::WriteFileDescriptor(pt_pipe[1], test_str.c_str(),\n                                               test_size));\n    }\n\n    all_data_received_->Wait();\n\n    \/\/ Send stop signal. It is not important which string we send.\n    EXPECT_EQ(1, file_util::WriteFileDescriptor(stop_pipe[1], \"q\", 1));\n\n    EXPECT_NE(-1, HANDLE_EINTR(close(stop_pipe[1])));\n    EXPECT_NE(-1, HANDLE_EINTR(close(pt_pipe[1])));\n\n    output_watch_thread.Stop();\n  }\n\n  scoped_ptr<base::WaitableEvent> all_data_received_;\n\n private:\n  ProcessWatcherExpectations expectations_;\n  std::vector<TestCase> exp;\n};\n\n\nTEST_F(ProcessOutputWatcherTest, OutputWatcher) {\n  std::vector<TestCase> test_cases;\n  test_cases.push_back(TestCase(\"testing output\\n\", false));\n  test_cases.push_back(TestCase(\"testing error\\n\", false));\n  test_cases.push_back(TestCase(\"testing error1\\n\", false));\n  test_cases.push_back(TestCase(\"testing output1\\n\", false));\n  test_cases.push_back(TestCase(\"testing output2\\n\", false));\n  test_cases.push_back(TestCase(\"testing output3\\n\", false));\n  test_cases.push_back(TestCase(VeryLongString(), false));\n  test_cases.push_back(TestCase(\"testing error2\\n\", false));\n\n  RunTest(test_cases);\n};\n\n\/\/ Verifies that sending '\\0' generates PROCESS_OUTPUT_TYPE_OUT event and does\n\/\/ not terminate output watcher.\nTEST_F(ProcessOutputWatcherTest, SendNull) {\n  std::vector<TestCase> test_cases;\n  \/\/ This will send '\\0' to output wathcer.\n  test_cases.push_back(TestCase(\"\", true));\n  \/\/ Let's verify that next input also gets detected (i.e. output watcher does\n  \/\/ not exit after seeing '\\0' from previous test case).\n  test_cases.push_back(TestCase(\"a\", true));\n\n  RunTest(test_cases);\n};\n<|endoftext|>"}
{"text":"<commit_before>#include \"TileType.h\"\n\n#include \"util\/Exception.h\"\n\nnamespace map {\n\n\n\nstd::string to_string(TileType enum_value) {\n    switch (enum_value) {\n        CASE_ENUM_TO_STRING(TileType::ROAD);\n        CASE_ENUM_TO_STRING(TileType::TOP_LEFT);\n        CASE_ENUM_TO_STRING(TileType::TOP);\n        CASE_ENUM_TO_STRING(TileType::RIGHT_TOP);\n        CASE_ENUM_TO_STRING(TileType::TOP_LEFT_SE);\n        CASE_ENUM_TO_STRING(TileType::RIGHT_TOP_LEFT);\n        CASE_ENUM_TO_STRING(TileType::RIGHT_TOP_SW);\n        CASE_ENUM_TO_STRING(TileType::LEFT);\n        CASE_ENUM_TO_STRING(TileType::GRASS);\n        CASE_ENUM_TO_STRING(TileType::RIGHT);\n        CASE_ENUM_TO_STRING(TileType::TOP_LEFT_BOTTOM);\n        CASE_ENUM_TO_STRING(TileType::NW_SW_SE_NE);\n        CASE_ENUM_TO_STRING(TileType::BOTTOM_RIGHT_TOP);\n        CASE_ENUM_TO_STRING(TileType::TOP_LEFT_RIGHT_BOTTOM);\n        CASE_ENUM_TO_STRING(TileType::LEFT_BOTTOM);\n        CASE_ENUM_TO_STRING(TileType::BOTTOM);\n        CASE_ENUM_TO_STRING(TileType::BOTTOM_RIGHT);\n        CASE_ENUM_TO_STRING(TileType::LEFT_BOTTOM_NE);\n        CASE_ENUM_TO_STRING(TileType::LEFT_BOTTOM_RIGHT);\n        CASE_ENUM_TO_STRING(TileType::BOTTOM_RIGHT_NW);\n        CASE_ENUM_TO_STRING(TileType::BUSH);\n        CASE_ENUM_TO_STRING(TileType::LEFT_RIGHT);\n        CASE_ENUM_TO_STRING(TileType::TOP_BOTTOM);\n        CASE_ENUM_TO_STRING(TileType::TOP_SW_SE);\n        CASE_ENUM_TO_STRING(TileType::LEFT_SE_NE);\n        CASE_ENUM_TO_STRING(TileType::BOTTOM_NE_NW);\n        CASE_ENUM_TO_STRING(TileType::RIGHT_NW_SW);\n        CASE_ENUM_TO_STRING(TileType::NE_NW);\n        CASE_ENUM_TO_STRING(TileType::NW_SW);\n        CASE_ENUM_TO_STRING(TileType::SW_SE);\n        CASE_ENUM_TO_STRING(TileType::SE_NE);\n        CASE_ENUM_TO_STRING(TileType::NE);\n        CASE_ENUM_TO_STRING(TileType::NW);\n        CASE_ENUM_TO_STRING(TileType::SW);\n        CASE_ENUM_TO_STRING(TileType::SE);\n        CASE_ENUM_TO_STRING(TileType::NE_NW_SW);\n        CASE_ENUM_TO_STRING(TileType::SE_NE_NW);\n        CASE_ENUM_TO_STRING(TileType::SW_SE_NE);\n        CASE_ENUM_TO_STRING(TileType::NW_SW_SE);\n        CASE_ENUM_TO_STRING(TileType::NW_SE);\n        CASE_ENUM_TO_STRING(TileType::NE_SW);\n        case TileType::LAST:\n            break;\n    }\n    throw util::Exception(\"to_string(ETileType) - invalid argument\", util::from_Enum<int>(enum_value));\n}\n}\n<commit_msg>formatting<commit_after>#include \"TileType.h\"\n\n#include \"util\/Exception.h\"\n\nnamespace map {\n\nstd::string to_string(TileType enum_value) {\n    switch (enum_value) {\n        CASE_ENUM_TO_STRING(TileType::ROAD);\n        CASE_ENUM_TO_STRING(TileType::TOP_LEFT);\n        CASE_ENUM_TO_STRING(TileType::TOP);\n        CASE_ENUM_TO_STRING(TileType::RIGHT_TOP);\n        CASE_ENUM_TO_STRING(TileType::TOP_LEFT_SE);\n        CASE_ENUM_TO_STRING(TileType::RIGHT_TOP_LEFT);\n        CASE_ENUM_TO_STRING(TileType::RIGHT_TOP_SW);\n        CASE_ENUM_TO_STRING(TileType::LEFT);\n        CASE_ENUM_TO_STRING(TileType::GRASS);\n        CASE_ENUM_TO_STRING(TileType::RIGHT);\n        CASE_ENUM_TO_STRING(TileType::TOP_LEFT_BOTTOM);\n        CASE_ENUM_TO_STRING(TileType::NW_SW_SE_NE);\n        CASE_ENUM_TO_STRING(TileType::BOTTOM_RIGHT_TOP);\n        CASE_ENUM_TO_STRING(TileType::TOP_LEFT_RIGHT_BOTTOM);\n        CASE_ENUM_TO_STRING(TileType::LEFT_BOTTOM);\n        CASE_ENUM_TO_STRING(TileType::BOTTOM);\n        CASE_ENUM_TO_STRING(TileType::BOTTOM_RIGHT);\n        CASE_ENUM_TO_STRING(TileType::LEFT_BOTTOM_NE);\n        CASE_ENUM_TO_STRING(TileType::LEFT_BOTTOM_RIGHT);\n        CASE_ENUM_TO_STRING(TileType::BOTTOM_RIGHT_NW);\n        CASE_ENUM_TO_STRING(TileType::BUSH);\n        CASE_ENUM_TO_STRING(TileType::LEFT_RIGHT);\n        CASE_ENUM_TO_STRING(TileType::TOP_BOTTOM);\n        CASE_ENUM_TO_STRING(TileType::TOP_SW_SE);\n        CASE_ENUM_TO_STRING(TileType::LEFT_SE_NE);\n        CASE_ENUM_TO_STRING(TileType::BOTTOM_NE_NW);\n        CASE_ENUM_TO_STRING(TileType::RIGHT_NW_SW);\n        CASE_ENUM_TO_STRING(TileType::NE_NW);\n        CASE_ENUM_TO_STRING(TileType::NW_SW);\n        CASE_ENUM_TO_STRING(TileType::SW_SE);\n        CASE_ENUM_TO_STRING(TileType::SE_NE);\n        CASE_ENUM_TO_STRING(TileType::NE);\n        CASE_ENUM_TO_STRING(TileType::NW);\n        CASE_ENUM_TO_STRING(TileType::SW);\n        CASE_ENUM_TO_STRING(TileType::SE);\n        CASE_ENUM_TO_STRING(TileType::NE_NW_SW);\n        CASE_ENUM_TO_STRING(TileType::SE_NE_NW);\n        CASE_ENUM_TO_STRING(TileType::SW_SE_NE);\n        CASE_ENUM_TO_STRING(TileType::NW_SW_SE);\n        CASE_ENUM_TO_STRING(TileType::NW_SE);\n        CASE_ENUM_TO_STRING(TileType::NE_SW);\n        case TileType::LAST:\n            break;\n    }\n    throw util::Exception(\"to_string(ETileType) - invalid argument\", util::from_Enum<int>(enum_value));\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2013\n * Alessio Sclocco <a.sclocco@vu.nl>\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\n *\/\n\n#include <string>\n#include <vector>\n#include <cmath>\n#include <x86intrin.h>\n#include <omp.h>\nusing std::string;\nusing std::vector;\nusing std::make_pair;\nusing std::pow;\nusing std::ceil;\n\n#include <Observation.hpp>\nusing AstroData::Observation;\n#include <Bins.hpp>\nusing PulsarSearch::getNrSamplesPerBin;\n\n\n#ifndef FOLDING_CPU_HPP\n#define FOLDING_CPU_HPP\n\nnamespace PulsarSearch {\n\n\/\/ OpenMP folding algorithm\ntemplate< typename T > void folding(const unsigned int second, const Observation< T > & observation, const T * const __restrict__ samples, T * const __restrict__ bins, unsigned int * const __restrict__ counters);\ntemplate< typename T > void folding(const Observation< T > & observation, const T * const __restrict__ samples, T * const __restrict__ bins, unsigned int * const __restrict__ counters);\n\n\n\/\/ Implementation\ntemplate< typename T > void folding(const unsigned int second, const Observation< T > & observation, const T * const __restrict__ samples, T * const __restrict__ bins, unsigned int * const __restrict__ counters) {\n\tfor ( unsigned int globalSample = 0; globalSample < observation.getNrSamplesPerSecond(); globalSample++ ) {\n\t\tconst unsigned int sample = ( second * observation.getNrSamplesPerSecond() ) + globalSample;\n\n\t\t#pragma omp parallel for schedule(static)\n\t\tfor ( unsigned int periodIndex = 0; periodIndex < observation.getNrPeriods(); periodIndex++ ) {\n\t\t\tconst unsigned int periodValue = observation.getNrBins() * (periodIndex + 1);\n\t\t\tconst float phase = ( sample \/ static_cast< float >(periodValue) ) - ( sample \/ periodValue );\n\t\t\tconst unsigned int bin = static_cast< unsigned int >(phase * static_cast< float >(observation.getNrBins()));\n\t\t\t\n\t\t\t#pragma omp parallel for schedule(static)\n\t\t\tfor ( unsigned int dm = 0; dm < observation.getNrDMs(); dm++ ) {\n\t\t\t\tconst unsigned int globalItem = (bin * observation.getNrPeriods() * observation.getNrPaddedDMs()) + (periodIndex * observation.getNrPaddedDMs()) + dm;\n\t\t\t\tT cValue = samples[(globalSample * observation.getNrPaddedDMs()) + dm];\n\t\t\t\tconst unsigned int pCounter = counters[globalItem];\n\t\t\t\tconst T pValue = bins[globalItem];\n\t\t\t\tunsigned int cCounter = pCounter + 1;\n\n\t\t\t\tif ( pCounter != 0 ) {\n\t\t\t\t\tcValue = pValue + ( ( cValue - pValue ) \/ cCounter );\n\t\t\t\t}\n\t\t\t\tbins[globalItem] = cValue;\n\t\t\t\tcounters[globalItem] = cCounter;\n\t\t\t}\n\t\t}\n\t}\n}\n\ntemplate< typename T > void folding(const Observation< T > & observation, const T * const __restrict__ samples, T * const __restrict__ bins, unsigned int * const __restrict__ counters) {\n\tvector< unsigned int > * samplesPerBin = getNrSamplesPerBin(observation);\n\n\t#pragma omp parallel for schedule(static)\n\tfor ( unsigned int periodIndex = 0; periodIndex < observation.getNrPeriods(); periodIndex++ ) {\n\t\tconst unsigned int periodValue = observation.getFirstPeriod() + (periodIndex * observation.getPeriodStep());\n\n\t\t#pragma omp parallel for schedule(static)\n\t\tfor ( unsigned int bin = 0; bin < observation.getNrBins(); bin++ ) {\n\t\t\tfor ( unsigned int dm = 0; dm < observation.getNrDMs(); dm++ ) {\n\t\t\t\tconst unsigned int pCounter = counters[(bin * observation.getNrPeriods() * observation.getNrPaddedDMs()) + (periodIndex * observation.getNrPaddedDMs()) + dm];\n\t\t\t\tunsigned int sample = (bin * periodIndex) + bin + ((pCounter \/ samplesPerBin->at((periodIndex * observation.getNrPaddedBins()) + bin)) * periodValue) + (pCounter % samplesPerBin->at((periodIndex * observation.getNrPaddedBins()) + bin));\n\t\t\t\tT foldedSample = 0;\n\t\t\t\tunsigned int foldedCounter = 0;\n\n\t\t\t\tif ( (sample % observation.getNrSamplesPerSecond()) == 0 ) {\n\t\t\t\t\tsample = 0;\n\t\t\t\t} else {\n\t\t\t\t\tsample = (sample % observation.getNrSamplesPerSecond()) - (sample \/ observation.getNrSamplesPerSecond());\n\t\t\t\t}\n\t\t\t\twhile ( sample < observation.getNrSamplesPerSecond() ) {\n\t\t\t\t\tfoldedSample += samples[(sample * observation.getNrPaddedDMs()) + dm];\n\t\t\t\t\tfoldedCounter++;\n\n\t\t\t\t\tif ( (foldedCounter + pCounter) % samplesPerBin->at((periodIndex * observation.getNrPaddedBins()) + bin) == 0 ) {\n\t\t\t\t\t\tsample += periodValue;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tsample++;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif ( foldedCounter > 0 ) {\n\t\t\t\t\tconst T pValue = bins[(bin * observation.getNrPeriods() * observation.getNrPaddedDMs()) + (periodIndex * observation.getNrPaddedDMs()) + dm];\n\t\t\t\t\tfloat addedFraction = static_cast< float >(foldedCounter) \/ (foldedCounter + pCounter);\n\n\t\t\t\t\tfoldedSample \/= foldedCounter;\n\t\t\t\t\tcounters[(bin * observation.getNrPeriods() * observation.getNrPaddedDMs()) + (periodIndex * observation.getNrPaddedDMs()) + dm] = pCounter + foldedCounter;\n\t\t\t\t\tbins[(bin * observation.getNrPeriods() * observation.getNrPaddedDMs()) + (periodIndex * observation.getNrPaddedDMs()) + dm] = (addedFraction * foldedSample) + ((1.0f - addedFraction) * pValue);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n} \/\/ PulsarSearch\n\n#endif \/\/ FOLDING_CPU_HPP<commit_msg>New CPU algorithm, solves a bug of the previous version.<commit_after>\/*\n * Copyright (C) 2013\n * Alessio Sclocco <a.sclocco@vu.nl>\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program.  If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\n *\/\n\n#include <string>\n#include <vector>\n#include <cmath>\n#include <x86intrin.h>\n#include <omp.h>\nusing std::string;\nusing std::vector;\nusing std::make_pair;\nusing std::pow;\nusing std::ceil;\n\n#include <Observation.hpp>\nusing AstroData::Observation;\n#include <Bins.hpp>\nusing PulsarSearch::getNrSamplesPerBin;\n\n\n#ifndef FOLDING_CPU_HPP\n#define FOLDING_CPU_HPP\n\nnamespace PulsarSearch {\n\n\/\/ OpenMP folding algorithm\ntemplate< typename T > void folding(const unsigned int second, const Observation< T > & observation, const T * const __restrict__ samples, T * const __restrict__ bins, unsigned int * const __restrict__ counters);\n\n\n\/\/ Implementation\ntemplate< typename T > void folding(const unsigned int second, const Observation< T > & observation, const T * const __restrict__ samples, T * const __restrict__ bins, unsigned int * const __restrict__ counters) {\n\tvector< unsigned int > * samplesPerBin = getNrSamplesPerBin(observation);\n\n\t#pragma omp parallel for schedule(static)\n\tfor ( unsigned int periodIndex = 0; periodIndex < observation.getNrPeriods(); periodIndex++ ) {\n\t\tconst unsigned int periodValue = observation.getFirstPeriod() + (periodIndex * observation.getPeriodStep());\n\n\t\t#pragma omp parallel for schedule(static)\n\t\tfor ( unsigned int bin = 0; bin < observation.getNrBins(); bin++ ) {\n\t\t\tconst unsigned int pCounter = counters[(periodIndex * observation.getNrPaddedBins()) + bin];\n\t\t\tunsigned int sample = samplesPerBin->at((periodIndex * 2 * observation.getNrPaddedBins()) + (bin * 2) + 1) + ((pCounter \/ samplesPerBin->at((periodIndex * 2 * observation.getNrPaddedBins()) + (bin * 2))) * periodValue) + (pCounter % samplesPerBin->at((periodIndex * 2 * observation.getNrPaddedBins()) + (bin * 2)));\n\n\t\t\tif ( (sample \/ observation.getNrSamplesPerSecond()) == second ) {\n\t\t\t\tsample %= observation.getNrSamplesPerSecond();\n\t\t\t}\n\t\t\tfor ( unsigned int dm = 0; dm < observation.getNrDMs(); dm++ ) {\n\t\t\t\tT foldedSample = 0;\n\t\t\t\tunsigned int foldedCounter = 0;\n\t\t\t\t\n\t\t\t\twhile ( sample < observation.getNrSamplesPerSecond() ) {\n\t\t\t\t\tfoldedSample += samples[(sample * observation.getNrPaddedDMs()) + dm];\n\t\t\t\t\tfoldedCounter++;\n\n\t\t\t\t\tif ( (foldedCounter + pCounter) % samplesPerBin->at((periodIndex * 2 * observation.getNrPaddedBins()) + (bin * 2)) == 0 ) {\n\t\t\t\t\t\tsample += periodValue;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tsample++;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif ( foldedCounter > 0 ) {\n\t\t\t\t\tconst T pValue = bins[(bin * observation.getNrPeriods() * observation.getNrPaddedDMs()) + (periodIndex * observation.getNrPaddedDMs()) + dm];\n\t\t\t\t\tfloat addedFraction = static_cast< float >(foldedCounter) \/ (foldedCounter + pCounter);\n\n\t\t\t\t\tfoldedSample \/= foldedCounter;\n\t\t\t\t\tbins[(bin * observation.getNrPeriods() * observation.getNrPaddedDMs()) + (periodIndex * observation.getNrPaddedDMs()) + dm] = (addedFraction * foldedSample) + ((1.0f - addedFraction) * pValue);\n\t\t\t\t\tif ( dm == observation.getNrDMs - 1 ) {\n\t\t\t\t\t\tcounters[(periodIndex * observation.getNrPaddedBins()) + bin] = pCounter + foldedCounter;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n} \/\/ PulsarSearch\n\n#endif \/\/ FOLDING_CPU_HPP<|endoftext|>"}
{"text":"<commit_before>\n\/*\n * Copyright 2007 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 \"SkPictureFlat.h\"\n#include \"SkPicturePlayback.h\"\n#include \"SkPictureRecord.h\"\n\n#include \"SkBitmapDevice.h\"\n#include \"SkCanvas.h\"\n#include \"SkChunkAlloc.h\"\n#include \"SkPicture.h\"\n#include \"SkRegion.h\"\n#include \"SkStream.h\"\n#include \"SkTDArray.h\"\n#include \"SkTSearch.h\"\n#include \"SkTime.h\"\n\n#include \"SkReader32.h\"\n#include \"SkWriter32.h\"\n#include \"SkRTree.h\"\n#include \"SkBBoxHierarchyRecord.h\"\n\nSK_DEFINE_INST_COUNT(SkPicture)\n\n#define DUMP_BUFFER_SIZE 65536\n\n\/\/#define ENABLE_TIME_DRAW    \/\/ dumps milliseconds for each draw\n\n\n#ifdef SK_DEBUG\n\/\/ enable SK_DEBUG_TRACE to trace DrawType elements when\n\/\/     recorded and played back\n\/\/ #define SK_DEBUG_TRACE\n\/\/ enable SK_DEBUG_SIZE to see the size of picture components\n\/\/ #define SK_DEBUG_SIZE\n\/\/ enable SK_DEBUG_DUMP to see the contents of recorded elements\n\/\/ #define SK_DEBUG_DUMP\n\/\/ enable SK_DEBUG_VALIDATE to check internal structures for consistency\n\/\/ #define SK_DEBUG_VALIDATE\n#endif\n\n#if defined SK_DEBUG_TRACE || defined SK_DEBUG_DUMP\nconst char* DrawTypeToString(DrawType drawType) {\n    switch (drawType) {\n        case UNUSED: SkDebugf(\"DrawType UNUSED\\n\"); SkASSERT(0); break;\n        case CLIP_PATH: return \"CLIP_PATH\";\n        case CLIP_REGION: return \"CLIP_REGION\";\n        case CLIP_RECT: return \"CLIP_RECT\";\n        case CLIP_RRECT: return \"CLIP_RRECT\";\n        case CONCAT: return \"CONCAT\";\n        case DRAW_BITMAP: return \"DRAW_BITMAP\";\n        case DRAW_BITMAP_MATRIX: return \"DRAW_BITMAP_MATRIX\";\n        case DRAW_BITMAP_NINE: return \"DRAW_BITMAP_NINE\";\n        case DRAW_BITMAP_RECT_TO_RECT: return \"DRAW_BITMAP_RECT_TO_RECT\";\n        case DRAW_CLEAR: return \"DRAW_CLEAR\";\n        case DRAW_DATA: return \"DRAW_DATA\";\n        case DRAW_OVAL: return \"DRAW_OVAL\";\n        case DRAW_PAINT: return \"DRAW_PAINT\";\n        case DRAW_PATH: return \"DRAW_PATH\";\n        case DRAW_PICTURE: return \"DRAW_PICTURE\";\n        case DRAW_POINTS: return \"DRAW_POINTS\";\n        case DRAW_POS_TEXT: return \"DRAW_POS_TEXT\";\n        case DRAW_POS_TEXT_TOP_BOTTOM: return \"DRAW_POS_TEXT_TOP_BOTTOM\";\n        case DRAW_POS_TEXT_H: return \"DRAW_POS_TEXT_H\";\n        case DRAW_POS_TEXT_H_TOP_BOTTOM: return \"DRAW_POS_TEXT_H_TOP_BOTTOM\";\n        case DRAW_RECT: return \"DRAW_RECT\";\n        case DRAW_RRECT: return \"DRAW_RRECT\";\n        case DRAW_SPRITE: return \"DRAW_SPRITE\";\n        case DRAW_TEXT: return \"DRAW_TEXT\";\n        case DRAW_TEXT_ON_PATH: return \"DRAW_TEXT_ON_PATH\";\n        case DRAW_TEXT_TOP_BOTTOM: return \"DRAW_TEXT_TOP_BOTTOM\";\n        case DRAW_VERTICES: return \"DRAW_VERTICES\";\n        case RESTORE: return \"RESTORE\";\n        case ROTATE: return \"ROTATE\";\n        case SAVE: return \"SAVE\";\n        case SAVE_LAYER: return \"SAVE_LAYER\";\n        case SCALE: return \"SCALE\";\n        case SET_MATRIX: return \"SET_MATRIX\";\n        case SKEW: return \"SKEW\";\n        case TRANSLATE: return \"TRANSLATE\";\n        case NOOP: return \"NOOP\";\n        default:\n            SkDebugf(\"DrawType error 0x%08x\\n\", drawType);\n            SkASSERT(0);\n            break;\n    }\n    SkASSERT(0);\n    return NULL;\n}\n#endif\n\n#ifdef SK_DEBUG_VALIDATE\nstatic void validateMatrix(const SkMatrix* matrix) {\n    SkScalar scaleX = matrix->getScaleX();\n    SkScalar scaleY = matrix->getScaleY();\n    SkScalar skewX = matrix->getSkewX();\n    SkScalar skewY = matrix->getSkewY();\n    SkScalar perspX = matrix->getPerspX();\n    SkScalar perspY = matrix->getPerspY();\n    if (scaleX != 0 && skewX != 0)\n        SkDebugf(\"scaleX != 0 && skewX != 0\\n\");\n    SkASSERT(scaleX == 0 || skewX == 0);\n    SkASSERT(scaleY == 0 || skewY == 0);\n    SkASSERT(perspX == 0);\n    SkASSERT(perspY == 0);\n}\n#endif\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSkPicture::SkPicture() {\n    fRecord = NULL;\n    fPlayback = NULL;\n    fWidth = fHeight = 0;\n}\n\nSkPicture::SkPicture(const SkPicture& src) : INHERITED() {\n    fWidth = src.fWidth;\n    fHeight = src.fHeight;\n    fRecord = NULL;\n\n    \/*  We want to copy the src's playback. However, if that hasn't been built\n        yet, we need to fake a call to endRecording() without actually calling\n        it (since it is destructive, and we don't want to change src).\n     *\/\n    if (src.fPlayback) {\n        fPlayback = SkNEW_ARGS(SkPicturePlayback, (*src.fPlayback));\n    } else if (src.fRecord) {\n        \/\/ here we do a fake src.endRecording()\n        fPlayback = SkNEW_ARGS(SkPicturePlayback, (*src.fRecord));\n    } else {\n        fPlayback = NULL;\n    }\n}\n\nSkPicture::~SkPicture() {\n    SkSafeUnref(fRecord);\n    SkDELETE(fPlayback);\n}\n\nvoid SkPicture::swap(SkPicture& other) {\n    SkTSwap(fRecord, other.fRecord);\n    SkTSwap(fPlayback, other.fPlayback);\n    SkTSwap(fWidth, other.fWidth);\n    SkTSwap(fHeight, other.fHeight);\n}\n\nSkPicture* SkPicture::clone() const {\n    SkPicture* clonedPicture = SkNEW(SkPicture);\n    clone(clonedPicture, 1);\n    return clonedPicture;\n}\n\nvoid SkPicture::clone(SkPicture* pictures, int count) const {\n    SkPictCopyInfo copyInfo;\n\n    for (int i = 0; i < count; i++) {\n        SkPicture* clone = &pictures[i];\n\n        clone->fWidth = fWidth;\n        clone->fHeight = fHeight;\n        clone->fRecord = NULL;\n\n        if (NULL != clone->fRecord) {\n            clone->fRecord->unref();\n            clone->fRecord = NULL;\n        }\n        SkDELETE(clone->fPlayback);\n\n        \/*  We want to copy the src's playback. However, if that hasn't been built\n            yet, we need to fake a call to endRecording() without actually calling\n            it (since it is destructive, and we don't want to change src).\n         *\/\n        if (fPlayback) {\n            clone->fPlayback = SkNEW_ARGS(SkPicturePlayback, (*fPlayback, &copyInfo));\n        } else if (fRecord) {\n            \/\/ here we do a fake src.endRecording()\n            clone->fPlayback = SkNEW_ARGS(SkPicturePlayback, (*fRecord, true));\n        } else {\n            clone->fPlayback = NULL;\n        }\n    }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSkCanvas* SkPicture::beginRecording(int width, int height,\n                                    uint32_t recordingFlags) {\n    if (fPlayback) {\n        SkDELETE(fPlayback);\n        fPlayback = NULL;\n    }\n\n    if (NULL != fRecord) {\n        fRecord->unref();\n        fRecord = NULL;\n    }\n\n    SkBitmap bm;\n    bm.setConfig(SkBitmap::kNo_Config, width, height);\n    SkAutoTUnref<SkBaseDevice> dev(SkNEW_ARGS(SkBitmapDevice, (bm)));\n\n    \/\/ Must be set before calling createBBoxHierarchy\n    fWidth = width;\n    fHeight = height;\n\n    if (recordingFlags & kOptimizeForClippedPlayback_RecordingFlag) {\n        SkBBoxHierarchy* tree = this->createBBoxHierarchy();\n        SkASSERT(NULL != tree);\n        fRecord = SkNEW_ARGS(SkBBoxHierarchyRecord, (recordingFlags, tree, dev));\n        tree->unref();\n    } else {\n        fRecord = SkNEW_ARGS(SkPictureRecord, (recordingFlags, dev));\n    }\n    fRecord->beginRecording();\n\n    return fRecord;\n}\n\nSkBBoxHierarchy* SkPicture::createBBoxHierarchy() const {\n    \/\/ These values were empirically determined to produce reasonable\n    \/\/ performance in most cases.\n    static const int kRTreeMinChildren = 6;\n    static const int kRTreeMaxChildren = 11;\n\n    SkScalar aspectRatio = SkScalarDiv(SkIntToScalar(fWidth),\n                                       SkIntToScalar(fHeight));\n    bool sortDraws = false;  \/\/ Do not sort draw calls when bulk loading.\n\n    return SkRTree::Create(kRTreeMinChildren, kRTreeMaxChildren,\n                           aspectRatio, sortDraws);\n}\n\nSkCanvas* SkPicture::getRecordingCanvas() const {\n    \/\/ will be null if we are not recording\n    return fRecord;\n}\n\nvoid SkPicture::endRecording() {\n    if (NULL == fPlayback) {\n        if (NULL != fRecord) {\n            fRecord->endRecording();\n            fPlayback = SkNEW_ARGS(SkPicturePlayback, (*fRecord));\n            fRecord->unref();\n            fRecord = NULL;\n        }\n    }\n    SkASSERT(NULL == fRecord);\n}\n\nvoid SkPicture::draw(SkCanvas* surface, SkDrawPictureCallback* callback) {\n    this->endRecording();\n    if (fPlayback) {\n        fPlayback->draw(*surface, callback);\n    }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"SkStream.h\"\n\nbool SkPicture::StreamIsSKP(SkStream* stream, SkPictInfo* pInfo) {\n    if (NULL == stream) {\n        return false;\n    }\n\n    SkPictInfo info;\n    if (!stream->read(&info, sizeof(SkPictInfo))) {\n        return false;\n    }\n    if (PICTURE_VERSION != info.fVersion\n#ifndef DELETE_THIS_CODE_WHEN_SKPS_ARE_REBUILT_AT_V13_AND_ALL_OTHER_INSTANCES_TOO\n        \/\/ V13 is backwards compatible with V12\n        && PRIOR_PRIOR_PICTURE_VERSION != info.fVersion  \/\/ TODO: remove when .skps regenerated\n#endif\n#ifndef DELETE_THIS_CODE_WHEN_SKPS_ARE_REBUILT_AT_V14_AND_ALL_OTHER_INSTANCES_TOO\n        \/\/ V14 is backwards compatible with V13\n        && PRIOR_PICTURE_VERSION2 != info.fVersion  \/\/ TODO: remove when .skps regenerated\n#endif\n        ) {\n        return false;\n    }\n\n    if (pInfo != NULL) {\n        *pInfo = info;\n    }\n    return true;\n}\n\nSkPicture::SkPicture(SkPicturePlayback* playback, int width, int height)\n    : fPlayback(playback)\n    , fRecord(NULL)\n    , fWidth(width)\n    , fHeight(height) {}\n\nSkPicture* SkPicture::CreateFromStream(SkStream* stream, InstallPixelRefProc proc) {\n    SkPictInfo info;\n\n    if (!StreamIsSKP(stream, &info)) {\n        return NULL;\n    }\n\n    SkPicturePlayback* playback;\n    \/\/ Check to see if there is a playback to recreate.\n    if (stream->readBool()) {\n        playback = SkPicturePlayback::CreateFromStream(stream, info, proc);\n        if (NULL == playback) {\n            return NULL;\n        }\n    } else {\n        playback = NULL;\n    }\n\n    return SkNEW_ARGS(SkPicture, (playback, info.fWidth, info.fHeight));\n}\n\nvoid SkPicture::serialize(SkWStream* stream, EncodeBitmap encoder) const {\n    SkPicturePlayback* playback = fPlayback;\n\n    if (NULL == playback && fRecord) {\n        playback = SkNEW_ARGS(SkPicturePlayback, (*fRecord));\n    }\n\n    SkPictInfo info;\n\n    info.fVersion = PICTURE_VERSION;\n    info.fWidth = fWidth;\n    info.fHeight = fHeight;\n    info.fFlags = SkPictInfo::kCrossProcess_Flag;\n#ifdef SK_SCALAR_IS_FLOAT\n    info.fFlags |= SkPictInfo::kScalarIsFloat_Flag;\n#endif\n    if (8 == sizeof(void*)) {\n        info.fFlags |= SkPictInfo::kPtrIs64Bit_Flag;\n    }\n\n    stream->write(&info, sizeof(info));\n    if (playback) {\n        stream->writeBool(true);\n        playback->serialize(stream, encoder);\n        \/\/ delete playback if it is a local version (i.e. cons'd up just now)\n        if (playback != fPlayback) {\n            SkDELETE(playback);\n        }\n    } else {\n        stream->writeBool(false);\n    }\n}\n\nbool SkPicture::willPlayBackBitmaps() const {\n    if (!fPlayback) return false;\n    return fPlayback->containsBitmaps();\n}\n\n#ifdef SK_BUILD_FOR_ANDROID\nvoid SkPicture::abortPlayback() {\n    if (NULL == fPlayback) {\n        return;\n    }\n    fPlayback->abort();\n}\n#endif\n<commit_msg>Add 'skiapict' magic bytes to SkPicture format.<commit_after>\n\/*\n * Copyright 2007 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 \"SkPictureFlat.h\"\n#include \"SkPicturePlayback.h\"\n#include \"SkPictureRecord.h\"\n\n#include \"SkBitmapDevice.h\"\n#include \"SkCanvas.h\"\n#include \"SkChunkAlloc.h\"\n#include \"SkPicture.h\"\n#include \"SkRegion.h\"\n#include \"SkStream.h\"\n#include \"SkTDArray.h\"\n#include \"SkTSearch.h\"\n#include \"SkTime.h\"\n\n#include \"SkReader32.h\"\n#include \"SkWriter32.h\"\n#include \"SkRTree.h\"\n#include \"SkBBoxHierarchyRecord.h\"\n\nSK_DEFINE_INST_COUNT(SkPicture)\n\n#define DUMP_BUFFER_SIZE 65536\n\n\/\/#define ENABLE_TIME_DRAW    \/\/ dumps milliseconds for each draw\n\n\n#ifdef SK_DEBUG\n\/\/ enable SK_DEBUG_TRACE to trace DrawType elements when\n\/\/     recorded and played back\n\/\/ #define SK_DEBUG_TRACE\n\/\/ enable SK_DEBUG_SIZE to see the size of picture components\n\/\/ #define SK_DEBUG_SIZE\n\/\/ enable SK_DEBUG_DUMP to see the contents of recorded elements\n\/\/ #define SK_DEBUG_DUMP\n\/\/ enable SK_DEBUG_VALIDATE to check internal structures for consistency\n\/\/ #define SK_DEBUG_VALIDATE\n#endif\n\n#if defined SK_DEBUG_TRACE || defined SK_DEBUG_DUMP\nconst char* DrawTypeToString(DrawType drawType) {\n    switch (drawType) {\n        case UNUSED: SkDebugf(\"DrawType UNUSED\\n\"); SkASSERT(0); break;\n        case CLIP_PATH: return \"CLIP_PATH\";\n        case CLIP_REGION: return \"CLIP_REGION\";\n        case CLIP_RECT: return \"CLIP_RECT\";\n        case CLIP_RRECT: return \"CLIP_RRECT\";\n        case CONCAT: return \"CONCAT\";\n        case DRAW_BITMAP: return \"DRAW_BITMAP\";\n        case DRAW_BITMAP_MATRIX: return \"DRAW_BITMAP_MATRIX\";\n        case DRAW_BITMAP_NINE: return \"DRAW_BITMAP_NINE\";\n        case DRAW_BITMAP_RECT_TO_RECT: return \"DRAW_BITMAP_RECT_TO_RECT\";\n        case DRAW_CLEAR: return \"DRAW_CLEAR\";\n        case DRAW_DATA: return \"DRAW_DATA\";\n        case DRAW_OVAL: return \"DRAW_OVAL\";\n        case DRAW_PAINT: return \"DRAW_PAINT\";\n        case DRAW_PATH: return \"DRAW_PATH\";\n        case DRAW_PICTURE: return \"DRAW_PICTURE\";\n        case DRAW_POINTS: return \"DRAW_POINTS\";\n        case DRAW_POS_TEXT: return \"DRAW_POS_TEXT\";\n        case DRAW_POS_TEXT_TOP_BOTTOM: return \"DRAW_POS_TEXT_TOP_BOTTOM\";\n        case DRAW_POS_TEXT_H: return \"DRAW_POS_TEXT_H\";\n        case DRAW_POS_TEXT_H_TOP_BOTTOM: return \"DRAW_POS_TEXT_H_TOP_BOTTOM\";\n        case DRAW_RECT: return \"DRAW_RECT\";\n        case DRAW_RRECT: return \"DRAW_RRECT\";\n        case DRAW_SPRITE: return \"DRAW_SPRITE\";\n        case DRAW_TEXT: return \"DRAW_TEXT\";\n        case DRAW_TEXT_ON_PATH: return \"DRAW_TEXT_ON_PATH\";\n        case DRAW_TEXT_TOP_BOTTOM: return \"DRAW_TEXT_TOP_BOTTOM\";\n        case DRAW_VERTICES: return \"DRAW_VERTICES\";\n        case RESTORE: return \"RESTORE\";\n        case ROTATE: return \"ROTATE\";\n        case SAVE: return \"SAVE\";\n        case SAVE_LAYER: return \"SAVE_LAYER\";\n        case SCALE: return \"SCALE\";\n        case SET_MATRIX: return \"SET_MATRIX\";\n        case SKEW: return \"SKEW\";\n        case TRANSLATE: return \"TRANSLATE\";\n        case NOOP: return \"NOOP\";\n        default:\n            SkDebugf(\"DrawType error 0x%08x\\n\", drawType);\n            SkASSERT(0);\n            break;\n    }\n    SkASSERT(0);\n    return NULL;\n}\n#endif\n\n#ifdef SK_DEBUG_VALIDATE\nstatic void validateMatrix(const SkMatrix* matrix) {\n    SkScalar scaleX = matrix->getScaleX();\n    SkScalar scaleY = matrix->getScaleY();\n    SkScalar skewX = matrix->getSkewX();\n    SkScalar skewY = matrix->getSkewY();\n    SkScalar perspX = matrix->getPerspX();\n    SkScalar perspY = matrix->getPerspY();\n    if (scaleX != 0 && skewX != 0)\n        SkDebugf(\"scaleX != 0 && skewX != 0\\n\");\n    SkASSERT(scaleX == 0 || skewX == 0);\n    SkASSERT(scaleY == 0 || skewY == 0);\n    SkASSERT(perspX == 0);\n    SkASSERT(perspY == 0);\n}\n#endif\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSkPicture::SkPicture() {\n    fRecord = NULL;\n    fPlayback = NULL;\n    fWidth = fHeight = 0;\n}\n\nSkPicture::SkPicture(const SkPicture& src) : INHERITED() {\n    fWidth = src.fWidth;\n    fHeight = src.fHeight;\n    fRecord = NULL;\n\n    \/*  We want to copy the src's playback. However, if that hasn't been built\n        yet, we need to fake a call to endRecording() without actually calling\n        it (since it is destructive, and we don't want to change src).\n     *\/\n    if (src.fPlayback) {\n        fPlayback = SkNEW_ARGS(SkPicturePlayback, (*src.fPlayback));\n    } else if (src.fRecord) {\n        \/\/ here we do a fake src.endRecording()\n        fPlayback = SkNEW_ARGS(SkPicturePlayback, (*src.fRecord));\n    } else {\n        fPlayback = NULL;\n    }\n}\n\nSkPicture::~SkPicture() {\n    SkSafeUnref(fRecord);\n    SkDELETE(fPlayback);\n}\n\nvoid SkPicture::swap(SkPicture& other) {\n    SkTSwap(fRecord, other.fRecord);\n    SkTSwap(fPlayback, other.fPlayback);\n    SkTSwap(fWidth, other.fWidth);\n    SkTSwap(fHeight, other.fHeight);\n}\n\nSkPicture* SkPicture::clone() const {\n    SkPicture* clonedPicture = SkNEW(SkPicture);\n    clone(clonedPicture, 1);\n    return clonedPicture;\n}\n\nvoid SkPicture::clone(SkPicture* pictures, int count) const {\n    SkPictCopyInfo copyInfo;\n\n    for (int i = 0; i < count; i++) {\n        SkPicture* clone = &pictures[i];\n\n        clone->fWidth = fWidth;\n        clone->fHeight = fHeight;\n        clone->fRecord = NULL;\n\n        if (NULL != clone->fRecord) {\n            clone->fRecord->unref();\n            clone->fRecord = NULL;\n        }\n        SkDELETE(clone->fPlayback);\n\n        \/*  We want to copy the src's playback. However, if that hasn't been built\n            yet, we need to fake a call to endRecording() without actually calling\n            it (since it is destructive, and we don't want to change src).\n         *\/\n        if (fPlayback) {\n            clone->fPlayback = SkNEW_ARGS(SkPicturePlayback, (*fPlayback, &copyInfo));\n        } else if (fRecord) {\n            \/\/ here we do a fake src.endRecording()\n            clone->fPlayback = SkNEW_ARGS(SkPicturePlayback, (*fRecord, true));\n        } else {\n            clone->fPlayback = NULL;\n        }\n    }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSkCanvas* SkPicture::beginRecording(int width, int height,\n                                    uint32_t recordingFlags) {\n    if (fPlayback) {\n        SkDELETE(fPlayback);\n        fPlayback = NULL;\n    }\n\n    if (NULL != fRecord) {\n        fRecord->unref();\n        fRecord = NULL;\n    }\n\n    SkBitmap bm;\n    bm.setConfig(SkBitmap::kNo_Config, width, height);\n    SkAutoTUnref<SkBaseDevice> dev(SkNEW_ARGS(SkBitmapDevice, (bm)));\n\n    \/\/ Must be set before calling createBBoxHierarchy\n    fWidth = width;\n    fHeight = height;\n\n    if (recordingFlags & kOptimizeForClippedPlayback_RecordingFlag) {\n        SkBBoxHierarchy* tree = this->createBBoxHierarchy();\n        SkASSERT(NULL != tree);\n        fRecord = SkNEW_ARGS(SkBBoxHierarchyRecord, (recordingFlags, tree, dev));\n        tree->unref();\n    } else {\n        fRecord = SkNEW_ARGS(SkPictureRecord, (recordingFlags, dev));\n    }\n    fRecord->beginRecording();\n\n    return fRecord;\n}\n\nSkBBoxHierarchy* SkPicture::createBBoxHierarchy() const {\n    \/\/ These values were empirically determined to produce reasonable\n    \/\/ performance in most cases.\n    static const int kRTreeMinChildren = 6;\n    static const int kRTreeMaxChildren = 11;\n\n    SkScalar aspectRatio = SkScalarDiv(SkIntToScalar(fWidth),\n                                       SkIntToScalar(fHeight));\n    bool sortDraws = false;  \/\/ Do not sort draw calls when bulk loading.\n\n    return SkRTree::Create(kRTreeMinChildren, kRTreeMaxChildren,\n                           aspectRatio, sortDraws);\n}\n\nSkCanvas* SkPicture::getRecordingCanvas() const {\n    \/\/ will be null if we are not recording\n    return fRecord;\n}\n\nvoid SkPicture::endRecording() {\n    if (NULL == fPlayback) {\n        if (NULL != fRecord) {\n            fRecord->endRecording();\n            fPlayback = SkNEW_ARGS(SkPicturePlayback, (*fRecord));\n            fRecord->unref();\n            fRecord = NULL;\n        }\n    }\n    SkASSERT(NULL == fRecord);\n}\n\nvoid SkPicture::draw(SkCanvas* surface, SkDrawPictureCallback* callback) {\n    this->endRecording();\n    if (fPlayback) {\n        fPlayback->draw(*surface, callback);\n    }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"SkStream.h\"\n\nstatic const char kMagic[] = { 's', 'k', 'i', 'a', 'p', 'i', 'c', 't' };\n\nbool SkPicture::StreamIsSKP(SkStream* stream, SkPictInfo* pInfo) {\n    if (NULL == stream) {\n        return false;\n    }\n\n    \/\/ Check magic bytes.\n    char magic[sizeof(kMagic)];\n    stream->read(magic, sizeof(kMagic));\n    if (0 != memcmp(magic, kMagic, sizeof(kMagic))) {\n        return false;\n    }\n\n    SkPictInfo info;\n    if (!stream->read(&info, sizeof(SkPictInfo))) {\n        return false;\n    }\n    if (PICTURE_VERSION != info.fVersion\n#ifndef DELETE_THIS_CODE_WHEN_SKPS_ARE_REBUILT_AT_V13_AND_ALL_OTHER_INSTANCES_TOO\n        \/\/ V13 is backwards compatible with V12\n        && PRIOR_PRIOR_PICTURE_VERSION != info.fVersion  \/\/ TODO: remove when .skps regenerated\n#endif\n#ifndef DELETE_THIS_CODE_WHEN_SKPS_ARE_REBUILT_AT_V14_AND_ALL_OTHER_INSTANCES_TOO\n        \/\/ V14 is backwards compatible with V13\n        && PRIOR_PICTURE_VERSION2 != info.fVersion  \/\/ TODO: remove when .skps regenerated\n#endif\n        ) {\n        return false;\n    }\n\n    if (pInfo != NULL) {\n        *pInfo = info;\n    }\n    return true;\n}\n\nSkPicture::SkPicture(SkPicturePlayback* playback, int width, int height)\n    : fPlayback(playback)\n    , fRecord(NULL)\n    , fWidth(width)\n    , fHeight(height) {}\n\nSkPicture* SkPicture::CreateFromStream(SkStream* stream, InstallPixelRefProc proc) {\n    SkPictInfo info;\n\n    if (!StreamIsSKP(stream, &info)) {\n        return NULL;\n    }\n\n    SkPicturePlayback* playback;\n    \/\/ Check to see if there is a playback to recreate.\n    if (stream->readBool()) {\n        playback = SkPicturePlayback::CreateFromStream(stream, info, proc);\n        if (NULL == playback) {\n            return NULL;\n        }\n    } else {\n        playback = NULL;\n    }\n\n    return SkNEW_ARGS(SkPicture, (playback, info.fWidth, info.fHeight));\n}\n\nvoid SkPicture::serialize(SkWStream* stream, EncodeBitmap encoder) const {\n    SkPicturePlayback* playback = fPlayback;\n\n    if (NULL == playback && fRecord) {\n        playback = SkNEW_ARGS(SkPicturePlayback, (*fRecord));\n    }\n\n    SkPictInfo info;\n\n    info.fVersion = PICTURE_VERSION;\n    info.fWidth = fWidth;\n    info.fHeight = fHeight;\n    info.fFlags = SkPictInfo::kCrossProcess_Flag;\n#ifdef SK_SCALAR_IS_FLOAT\n    info.fFlags |= SkPictInfo::kScalarIsFloat_Flag;\n#endif\n    if (8 == sizeof(void*)) {\n        info.fFlags |= SkPictInfo::kPtrIs64Bit_Flag;\n    }\n\n    \/\/ Write 8 magic bytes to ID this file format.\n    SkASSERT(sizeof(kMagic) == 8);\n    stream->write(kMagic, sizeof(kMagic));\n\n    stream->write(&info, sizeof(info));\n    if (playback) {\n        stream->writeBool(true);\n        playback->serialize(stream, encoder);\n        \/\/ delete playback if it is a local version (i.e. cons'd up just now)\n        if (playback != fPlayback) {\n            SkDELETE(playback);\n        }\n    } else {\n        stream->writeBool(false);\n    }\n}\n\nbool SkPicture::willPlayBackBitmaps() const {\n    if (!fPlayback) return false;\n    return fPlayback->containsBitmaps();\n}\n\n#ifdef SK_BUILD_FOR_ANDROID\nvoid SkPicture::abortPlayback() {\n    if (NULL == fPlayback) {\n        return;\n    }\n    fPlayback->abort();\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Remove empty line<commit_after><|endoftext|>"}
{"text":"<commit_before>#include \"DebugArguments.h\"\n#include \"Module.h\"\n\nnamespace Halide {\nnamespace Internal {\n\nusing std::vector;\n\nvoid debug_arguments(LoweredFunc *func) {\n    internal_assert(func);\n    vector<Stmt> stmts;\n    Expr header = Call::make(Int(32), \"halide_print\", {Expr(\"Entering Pipeline \" + func->name + \"\\n\")}, Call::Extern);\n    stmts.push_back(Evaluate::make(header));\n    for (LoweredArgument arg : func->args) {\n        vector<Expr> print_args;\n        switch (arg.kind) {\n        case Argument::InputScalar: {\n            std::ostringstream type;\n            type << arg.type;\n            print_args.push_back(Expr(\" Input \" + type.str() + \" \" + arg.name + \": \"));\n            print_args.push_back(Variable::make(arg.type, arg.name));\n            print_args.push_back(Expr(\"\\n\"));\n            break;\n        }\n        case Argument::InputBuffer: {\n            print_args.push_back(Expr(\" Input Buffer \" + arg.name + \": \"));\n            print_args.push_back(Variable::make(type_of<halide_buffer_t *>(), arg.name + \".buffer\"));\n            print_args.push_back(Expr(\"\\n\"));\n            break;\n        }\n        case Argument::OutputBuffer: {\n            print_args.push_back(Expr(\" Output Buffer \" + arg.name + \": \"));\n            print_args.push_back(Variable::make(type_of<halide_buffer_t *>(), arg.name + \".buffer\"));\n            print_args.push_back(Expr(\"\\n\"));\n            break;\n        }                                                                  }\n        Expr str = Call::make(type_of<char *>(), Call::stringify, print_args, Call::Intrinsic);\n        Expr p = Call::make(Int(32), \"halide_print\", {str}, Call::Extern);\n        stmts.push_back(Evaluate::make(p));\n    }    \n\n    stmts.push_back(func->body);\n\n    Expr footer = Call::make(Int(32), \"halide_print\", {Expr(\"Exiting Pipeline \" + func->name + \"\\n\")}, Call::Extern);   \n    stmts.push_back(Evaluate::make(footer));\n\n    func->body = Block::make(stmts);\n}\n\n}\n}\n<commit_msg>Simplify DebugArguments using print from IROperator<commit_after>#include \"DebugArguments.h\"\n#include \"IROperator.h\"\n#include \"Module.h\"\n\nnamespace Halide {\nnamespace Internal {\n\nusing std::vector;\n\nvoid debug_arguments(LoweredFunc *func) {\n    internal_assert(func);\n    vector<Stmt> stmts;\n    stmts.push_back(Evaluate::make(print(\"Entering Pipeline \" + func->name)));\n    for (LoweredArgument arg : func->args) {\n        std::ostringstream name;\n        Expr scalar_var = Variable::make(arg.type, arg.name);\n        Expr buffer_var = Variable::make(type_of<halide_buffer_t *>(), arg.name + \".buffer\");\n        Expr value;\n        switch (arg.kind) {\n        case Argument::InputScalar: {\n            name << \" Input \" << arg.type << ' ' << arg.name << ':';\n            value = scalar_var;\n            break;\n        }\n        case Argument::InputBuffer: {\n            name << \" Input Buffer \" << arg.name << ':';\n            value = buffer_var;\n            break;\n        }\n        case Argument::OutputBuffer: {\n            name << \" Output Buffer \" << arg.name << ':';\n            value = buffer_var;\n            break;\n        }                                                                  }\n        stmts.push_back(Evaluate::make(print(name.str(), value)));\n    }\n    stmts.push_back(func->body);\n    stmts.push_back(Evaluate::make(print(\"Exiting Pipeline \" + func->name)));\n    func->body = Block::make(stmts);\n}\n\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/  CMatrix.hpp\n\/\/  OpenJam\n\/\/\n\/\/  Created by yev on 3\/28\/14.\n\/\/  Copyright (c) 2014 Yevgeniy Logachev. All rights reserved.\n\/\/\n\n#ifndef CMATRIX_HPP\n#define CMATRIX_HPP\n\n#include \"Global.h\"\n#include \"CVector.hpp\"\n\nnamespace jam\n{\n\ntemplate<class T, uint32_t COLS, uint32_t ROWS>\nclass CMatrix\n{\npublic:\n    typedef T TMatrix[ROWS][COLS];\n    \npublic:\n    CMatrix()\n    {\n        memset(m_Matrix, 0, sizeof(m_Matrix));\n    }\n    \n    CMatrix(const TMatrix matrix)\n    {\n        memcpy(m_Matrix, matrix, sizeof(m_Matrix));\n    }\n    \n    ~CMatrix()\n    {\n    }\n    \n    INL const T* operator()() const\n    {\n        return *m_Matrix;\n    }\n    \n    static const CMatrix<T, COLS, ROWS> Identity()\n    {\n        static_assert(COLS == ROWS, \"Identity matrix must be square\");\n        \n        CMatrix<T, COLS, ROWS> out;\n        for (uint32_t i = 0; i < COLS; ++i)\n        {\n            out.Set(i, i, static_cast<T>(1));\n        }\n        \n        return out;\n    }\n    \n    static const CMatrix<T, COLS, ROWS> Perspective(float fov, float aspect, float zNear, float zFar)\n    {\n        static_assert(COLS >= 3 && ROWS >= 3, \"Works only with 3D matrix\");\n        \n        CMatrix<T, COLS, ROWS> out = CMatrix<T, COLS, ROWS>::Identity();\n        \n        float r = fov * (0.5f * (3.1415f \/ 180.0f));\n        float deltaZ = zFar - zNear;\n        float s = sin(r);\n        if (deltaZ == 0.0 || s == 0.0 || aspect == 0.0)\n        {\n            return out;\n        }\n        \n        float cotangent = cos(r) \/ s;\n        \n        out.Set(0, 0, static_cast<T>(cotangent \/ aspect));\n        out.Set(1, 1, static_cast<T>(cotangent));\n        out.Set(2, 2, static_cast<T>(-(zFar + zNear) \/ deltaZ));\n        out.Set(3, 2, static_cast<T>(-1.0));\n        out.Set(2, 3, static_cast<T>(-2.0 * zNear * zFar \/ deltaZ));\n        out.Set(3, 3, static_cast<T>(0.0));\n        \n        return out;\n    }\n    \n    static const CMatrix<T, COLS, ROWS> Orthographic(float left, float right, float top, float bottom, float _near, float _far)\n    {\n        static_assert(COLS >= 3 && ROWS >= 3, \"Works only with 3D matrix\");\n        \n        float tx = -((right + left) \/ (right - left));\n        float ty = -((top + bottom) \/ (top - bottom));\n        float tz = -((_far + _near) \/ (_far - _near));\n        \n        CMatrix<T, COLS, ROWS> out;\n        \n        out.Set(0, 0, static_cast<T>(2.0 \/ (right - left)));\n        out.Set(0, 3, static_cast<T>(tx));\n        out.Set(1, 1, static_cast<T>(2.0 \/ (top - bottom)));\n        out.Set(1, 3, static_cast<T>(ty));\n        out.Set(2, 2, static_cast<T>(-2.0 \/ (_far - _near)));\n        out.Set(2, 3, static_cast<T>(tz));\n        out.Set(3, 3, static_cast<T>(1.0));\n        \n        return out;\n    }\n    \n    INL CMatrix<T, COLS, ROWS>& Transpose()\n    {\n        for (uint64_t i = 0; i < ROWS; ++i)\n        {\n            for (uint64_t j = i + 1; j < COLS; ++j)\n            {\n                std::swap(m_Matrix[i][j], m_Matrix[j][i]);\n            }\n        }\n        \n        return *this;\n    }\n    \n    INL bool IsEqual(const TMatrix matrix)\n    {\n        return memcmp(m_Matrix, matrix, sizeof(m_Matrix)) == 0;\n    }\n    \n    template<uint32_t N>\n    INL CMatrix<T, COLS, ROWS>& Translate(const CVector<T, N>& translation)\n    {\n        uint32_t size = std::min(ROWS, N);\n        for (uint32_t i = 0; i < size; ++i)\n        {\n            m_Matrix[i][COLS - 1] = translation.Get(i);\n        }\n        \n        return *this;\n    }\n    \n    template<uint32_t N>\n    INL CMatrix<T, COLS, ROWS>& Rotate(const CVector<T, N>& rotation)\n    {\n        if (N == 2)\n        {\n            \/\/ TODO: 2d rotation matrix\n        }\n        else if (N == 3 && ROWS >= 3 && COLS >= 3)\n        {\n            T A      = static_cast<T>(cos(static_cast<double>(rotation.X())));\n            T B      = static_cast<T>(sin(static_cast<double>(rotation.X())));\n            T C      = static_cast<T>(cos(static_cast<double>(rotation.Y())));\n            T D      = static_cast<T>(sin(static_cast<double>(rotation.Y())));\n            T E      = static_cast<T>(cos(static_cast<double>(rotation.Z())));\n            T F      = static_cast<T>(sin(static_cast<double>(rotation.Z())));\n            \n            T AD     =   A * D;\n            T BD     =   B * D;\n            \n            m_Matrix[0][0] =   C * E;\n            m_Matrix[1][0] =  -C * F;\n            m_Matrix[2][0] =  -D;\n            m_Matrix[0][1] = -BD * E + A * F;\n            m_Matrix[1][1] =  BD * F + A * E;\n            m_Matrix[2][1] =  -B * C;\n            m_Matrix[0][2] =  AD * E + B * F;\n            m_Matrix[1][2] = -AD * F + B * E;\n            m_Matrix[2][2] =   A * C;\n        }\n        else\n        {\n            \/\/ TODO: handle this\n        }\n        \n        return *this;\n    }\n    \n    template<uint32_t N>\n    INL CMatrix<T, COLS, ROWS>& Scale(const CVector<T, N>& scale)\n    {\n        static_assert(COLS == ROWS, \"Matrix must be square\");\n        \n        uint32_t size = std::min(ROWS, N);\n        for (uint32_t i = 0; i < size; ++i)\n        {\n            m_Matrix[i][i] = scale.Get(i);\n        }\n        \n        return *this;\n    }\n    \n    INL CVector<T, 3> Up() const\n    {\n        \/\/ TODO:\n        CVector<T, 3> upVector;\n        \n        \/*upVector.X(m_Matrix[1]);\n        upVector.Y(m_Matrix[5]);\n        upVector.Z(m_Matrix[9]);*\/\n        \n        upVector.Normalize();\n        \n        return upVector;\n    }\n    \n    INL CVector<T, 3> Forward() const\n    {\n        \/\/ TODO:\n        CVector<T, 3> upVector;\n        \n        \/*upVector.X(m_Matrix[2]);\n        upVector.Y(m_Matrix[6]);\n        upVector.Z(m_Matrix[10]);*\/\n        \n        upVector.Normalize();\n        \n        return upVector;\n    }\n    \n    INL CVector<T, 3> Right() const\n    {\n        CVector<T, 3> upVector;\n        \n        \/*upVector.X(m_Matrix[0]);\n        upVector.Y(m_Matrix[4]);\n        upVector.Z(m_Matrix[8]);*\/\n        \n        upVector.Normalize();\n        \n        return upVector;\n    }\n    \n    INL void Set(uint32_t x, uint32_t y, T element)\n    {\n        if (x < COLS && y < ROWS)\n        {\n            m_Matrix[x][y] = element;\n        }\n    }\n    \n    INL T Get(uint32_t x, uint32_t y) const\n    {\n        if (x < COLS && y < ROWS)\n        {\n            return m_Matrix[x][y];\n        }\n        \n        return static_cast<T>(0);\n    }\n    INL void SwapElement(uint32_t x1, uint32_t y1, uint32_t x2, uint32_t y2)\n    {\n        if (x1 < COLS && y1 < ROWS && x2 < COLS && y2 < ROWS)\n        {\n            std::swap(m_Matrix[x1][y1], m_Matrix[x2][y2]);\n        }\n    }\n    \n    INL CMatrix<T, COLS, ROWS> operator*(const CMatrix<T, COLS, ROWS>& matrix)\n    {\n        CMatrix<T, COLS, ROWS> result = *this;\n        \n        result *= matrix;\n        \n        return result;\n    }\n    \n    INL CMatrix<T, COLS, ROWS>& operator*=(const CMatrix<T, COLS, ROWS>& matrix)\n    {\n        \/\/ TODO: try constexpr\n        TMatrix result = {{0}, };\n        \n        for (uint64_t i = 0; i < ROWS; ++i)\n        {\n            for (uint64_t j = 0; j < COLS; ++j)\n            {\n                for (uint64_t k = 0; k < COLS; ++k)\n                {\n                    result[i][j] += m_Matrix[i][k] * matrix.Get(k, j);\n                }\n            }\n        }\n        \n        memcpy(m_Matrix, result, sizeof(m_Matrix));\n        \n        return *this;\n    }\n    \n    INL CMatrix<T, COLS, ROWS> operator+(const CMatrix<T, COLS, ROWS>& matrix)\n    {\n        CMatrix<T, COLS, ROWS> result = *this;\n        \n        result += matrix;\n        \n        return result;\n    }\n    \n    INL CMatrix<T, COLS, ROWS>& operator+=(const CMatrix<T, COLS, ROWS>& matrix)\n    {\n        for (uint64_t i = 0; i < ROWS; ++i)\n        {\n            for (uint64_t j = 0; j < COLS; ++j)\n            {\n                m_Matrix[i][j] += matrix.Get(i, j);\n            }\n        }\n        \n        return *this;\n    }\n    \n    INL CMatrix<T, COLS, ROWS> operator-(const CMatrix<T, COLS, ROWS>& matrix)\n    {\n        CMatrix<T, COLS, ROWS> result = *this;\n        \n        result -= matrix;\n        \n        return result;\n    }\n    \n    INL CMatrix<T, COLS, ROWS>& operator-=(const CMatrix<T, COLS, ROWS>& matrix)\n    {\n        for (uint64_t i = 0; i < ROWS; ++i)\n        {\n            for (uint64_t j = 0; j < COLS; ++j)\n            {\n                m_Matrix[i][j] -= matrix.Get(i, j);\n            }\n        }\n        \n        return *this;\n    }\n    \n    INL CMatrix<T, COLS, ROWS>& operator=(const TMatrix matrix)\n    {\n        memcpy(m_Matrix, matrix, sizeof(m_Matrix));\n    }\n    \n    void Dump() const\n    {\n        printf(\"{\\n\");\n        for (uint64_t i = 0; i < ROWS; ++i)\n        {\n            for (uint64_t j = 0; j < COLS; ++j)\n            {\n                printf(\"\\t%f\\t\", m_Matrix[i][j]);\n            }\n            printf(\"\\n\");\n        }\n        printf(\"}\\n\");\n    }\n    \nprivate:\n    static_assert(COLS > 0 && ROWS > 0, \"CMatrix cannot be zero-dimensioned\");\n    TMatrix m_Matrix;\n};\n\ntypedef CMatrix<float, 4, 4> CMatrix4x4f;\ntypedef CMatrix<double, 4, 4> CMatrix4x4d;\ntypedef CMatrix<int32_t, 4, 4> CMatrix4x4i;\n\n}; \/\/ namespace jam\n\n#endif \/* defined(CMatrix_HPP) *\/\n<commit_msg>* matrix improvments<commit_after>\/\/\n\/\/  CMatrix.hpp\n\/\/  OpenJam\n\/\/\n\/\/  Created by yev on 3\/28\/14.\n\/\/  Copyright (c) 2014 Yevgeniy Logachev. All rights reserved.\n\/\/\n\n#ifndef CMATRIX_HPP\n#define CMATRIX_HPP\n\n#include \"Global.h\"\n#include \"CVector.hpp\"\n\nnamespace jam\n{\n\ntemplate<class T, uint32_t COLS, uint32_t ROWS>\nclass CMatrix\n{\npublic:\n    typedef T TMatrix[ROWS][COLS];\n    \npublic:\n    CMatrix()\n    {\n        memset(m_Matrix, 0, sizeof(m_Matrix));\n    }\n    \n    CMatrix(const TMatrix matrix)\n    {\n        memcpy(m_Matrix, matrix, sizeof(m_Matrix));\n    }\n    \n    ~CMatrix()\n    {\n    }\n    \n    INL const T* operator()() const\n    {\n        return *m_Matrix;\n    }\n    \n    INL static const CMatrix<T, COLS, ROWS> Identity()\n    {\n        static_assert(COLS == ROWS, \"Identity matrix must be square\");\n        \n        CMatrix<T, COLS, ROWS> out;\n        for (uint32_t i = 0; i < COLS; ++i)\n        {\n            out.Set(i, i, static_cast<T>(1));\n        }\n        \n        return out;\n    }\n    \n    INL static const CMatrix<T, COLS, ROWS> Perspective(float fov, float aspect, float zNear, float zFar)\n    {\n        static_assert(COLS >= 3 && ROWS >= 3, \"Works only with 3D matrix\");\n        \n        CMatrix<T, COLS, ROWS> out = CMatrix<T, COLS, ROWS>::Identity();\n        \n        float r = fov * (0.5f * (3.1415f \/ 180.0f));\n        float deltaZ = zFar - zNear;\n        float s = sin(r);\n        if (deltaZ == 0.0 || s == 0.0 || aspect == 0.0)\n        {\n            \/\/ TODO: fire log\n            return out;\n        }\n        \n        float cotangent = cos(r) \/ s;\n        \n        out.Set(0, 0, static_cast<T>(cotangent \/ aspect));\n        out.Set(1, 1, static_cast<T>(cotangent));\n        out.Set(2, 2, static_cast<T>(-(zFar + zNear) \/ deltaZ));\n        out.Set(3, 2, static_cast<T>(-1.0));\n        out.Set(2, 3, static_cast<T>(-2.0 * zNear * zFar \/ deltaZ));\n        out.Set(3, 3, static_cast<T>(0.0));\n        \n        return out;\n    }\n    \n    INL static const CMatrix<T, COLS, ROWS> Orthographic(float left, float right, float top, float bottom, float _near, float _far)\n    {\n        static_assert(COLS >= 3 && ROWS >= 3, \"Works only with 3D matrix\");\n        \n        float tx = -((right + left) \/ (right - left));\n        float ty = -((top + bottom) \/ (top - bottom));\n        float tz = -((_far + _near) \/ (_far - _near));\n        \n        CMatrix<T, COLS, ROWS> out;\n        \n        out.Set(0, 0, static_cast<T>(2.0 \/ (right - left)));\n        out.Set(0, 3, static_cast<T>(tx));\n        out.Set(1, 1, static_cast<T>(2.0 \/ (top - bottom)));\n        out.Set(1, 3, static_cast<T>(ty));\n        out.Set(2, 2, static_cast<T>(-2.0 \/ (_far - _near)));\n        out.Set(2, 3, static_cast<T>(tz));\n        out.Set(3, 3, static_cast<T>(1.0));\n        \n        return out;\n    }\n    \n    INL CMatrix<T, COLS, ROWS>& Transpose()\n    {\n        for (uint64_t i = 0; i < ROWS; ++i)\n        {\n            for (uint64_t j = i + 1; j < COLS; ++j)\n            {\n                std::swap(m_Matrix[i][j], m_Matrix[j][i]);\n            }\n        }\n        \n        return *this;\n    }\n    \n    INL bool IsEqual(const TMatrix matrix)\n    {\n        return memcmp(m_Matrix, matrix, sizeof(m_Matrix)) == 0;\n    }\n    \n    template<uint32_t N>\n    INL CMatrix<T, COLS, ROWS>& Translate(const CVector<T, N>& translation)\n    {\n        uint32_t size = std::min(ROWS, N);\n        for (uint32_t i = 0; i < size; ++i)\n        {\n            m_Matrix[i][COLS - 1] = translation.Get(i);\n        }\n        \n        return *this;\n    }\n    \n    template<uint32_t N>\n    INL CMatrix<T, COLS, ROWS>& Rotate(const CVector<T, N>& rotation)\n    {\n        if (N == 2)\n        {\n            \/\/ TODO: 2d rotation matrix\n        }\n        else if (N == 3 && ROWS >= 3 && COLS >= 3)\n        {\n            T A = static_cast<T>(cos(static_cast<double>(rotation.X())));\n            T B = static_cast<T>(sin(static_cast<double>(rotation.X())));\n            T C = static_cast<T>(cos(static_cast<double>(rotation.Y())));\n            T D = static_cast<T>(sin(static_cast<double>(rotation.Y())));\n            T E = static_cast<T>(cos(static_cast<double>(rotation.Z())));\n            T F = static_cast<T>(sin(static_cast<double>(rotation.Z())));\n            T AD = A * D;\n            T BD = B * D;\n            \n            m_Matrix[0][0] =   C * E;\n            m_Matrix[1][0] =  -C * F;\n            m_Matrix[2][0] =  -D;\n            m_Matrix[0][1] = -BD * E + A * F;\n            m_Matrix[1][1] =  BD * F + A * E;\n            m_Matrix[2][1] =  -B * C;\n            m_Matrix[0][2] =  AD * E + B * F;\n            m_Matrix[1][2] = -AD * F + B * E;\n            m_Matrix[2][2] =   A * C;\n        }\n        else\n        {\n            \/\/ TODO: handle this\n        }\n        \n        return *this;\n    }\n    \n    template<uint32_t N>\n    INL CMatrix<T, COLS, ROWS>& Scale(const CVector<T, N>& scale)\n    {\n        static_assert(COLS == ROWS, \"Matrix must be square\");\n        \n        uint32_t size = std::min(ROWS, N);\n        for (uint32_t i = 0; i < size; ++i)\n        {\n            m_Matrix[i][i] = scale.Get(i);\n        }\n        \n        return *this;\n    }\n    \n    template<uint32_t N>\n    INL CVector<T, N> Up() const\n    {\n        CVector<T, N> upVector;\n        \n        upVector.X(Get(0, 1));\n        upVector.Y(Get(1, 1));\n        upVector.Z(Get(2, 1));\n        \n        upVector.Normalize();\n        \n        return upVector;\n    }\n    \n    template<uint32_t N>\n    INL CVector<T, N> Forward() const\n    {\n        CVector<T, N> upVector;\n        \n        upVector.X(Get(0, 2));\n        upVector.Y(Get(1, 2));\n        upVector.Z(Get(2, 2));\n        \n        upVector.Normalize();\n        \n        return upVector;\n    }\n    \n    template<uint32_t N>\n    INL CVector<T, N> Right() const\n    {\n        CVector<T, N> upVector;\n        \n        upVector.X(Get(0, 0));\n        upVector.Y(Get(1, 0));\n        upVector.Z(Get(2, 0));\n        \n        upVector.Normalize();\n        \n        return upVector;\n    }\n    \n    INL void Set(uint32_t x, uint32_t y, T element)\n    {\n        if (x < COLS && y < ROWS)\n        {\n            m_Matrix[x][y] = element;\n        }\n    }\n    \n    INL T Get(uint32_t x, uint32_t y) const\n    {\n        if (x < COLS && y < ROWS)\n        {\n            return m_Matrix[x][y];\n        }\n        \n        return static_cast<T>(0);\n    }\n    INL void SwapElement(uint32_t x1, uint32_t y1, uint32_t x2, uint32_t y2)\n    {\n        if (x1 < COLS && y1 < ROWS && x2 < COLS && y2 < ROWS)\n        {\n            std::swap(m_Matrix[x1][y1], m_Matrix[x2][y2]);\n        }\n    }\n    \n    template<uint32_t COLS2, uint32_t ROWS2>\n    INL CMatrix<T, COLS, ROWS> operator*(const CMatrix<T, COLS2, ROWS2>& matrix)\n    {\n        CMatrix<T, COLS, ROWS> result(*this);\n        result *= matrix;\n        \n        return result;\n    }\n    \n    template<uint32_t COLS2, uint32_t ROWS2>\n    INL CMatrix<T, COLS, ROWS>& operator*=(const CMatrix<T, COLS2, ROWS2>& matrix)\n    {\n        static_assert(COLS == ROWS2, \"Matrix must be consistent\");\n        \n        TMatrix result = {{0}, };\n        \n        for (uint64_t i = 0; i < ROWS; ++i)\n        {\n            for (uint64_t j = 0; j < COLS; ++j)\n            {\n                for (uint64_t k = 0; k < COLS; ++k)\n                {\n                    result[i][j] += m_Matrix[i][k] * matrix.Get(k, j);\n                }\n            }\n        }\n        \n        memcpy(m_Matrix, result, sizeof(m_Matrix));\n        \n        return *this;\n    }\n    \n    template<uint32_t COLS2, uint32_t ROWS2>\n    INL CMatrix<T, COLS, ROWS> operator+(const CMatrix<T, COLS2, ROWS2>& matrix)\n    {\n        CMatrix<T, COLS, ROWS> result(*this);\n        result += matrix;\n        \n        return result;\n    }\n    \n    template<uint32_t COLS2, uint32_t ROWS2>\n    INL CMatrix<T, COLS, ROWS>& operator+=(const CMatrix<T, COLS2, ROWS2>& matrix)\n    {\n        for (uint64_t i = 0; i < ROWS; ++i)\n        {\n            for (uint64_t j = 0; j < COLS; ++j)\n            {\n                m_Matrix[i][j] += matrix.Get(i, j);\n            }\n        }\n        \n        return *this;\n    }\n    \n    template<uint32_t COLS2, uint32_t ROWS2>\n    INL CMatrix<T, COLS, ROWS> operator-(const CMatrix<T, COLS2, ROWS2>& matrix)\n    {\n        CMatrix<T, COLS, ROWS> result(*this);\n        result -= matrix;\n        \n        return result;\n    }\n    \n    template<uint32_t COLS2, uint32_t ROWS2>\n    INL CMatrix<T, COLS, ROWS>& operator-=(const CMatrix<T, COLS2, ROWS2>& matrix)\n    {\n        for (uint64_t i = 0; i < ROWS; ++i)\n        {\n            for (uint64_t j = 0; j < COLS; ++j)\n            {\n                m_Matrix[i][j] -= matrix.Get(i, j);\n            }\n        }\n        \n        return *this;\n    }\n    \n    INL CMatrix<T, COLS, ROWS>& operator=(const TMatrix matrix)\n    {\n        memcpy(m_Matrix, matrix, sizeof(m_Matrix));\n    }\n    \n    void Dump() const\n    {\n        printf(\"{\\n\");\n        for (uint64_t i = 0; i < ROWS; ++i)\n        {\n            for (uint64_t j = 0; j < COLS; ++j)\n            {\n                printf(\"\\t%f\\t\", m_Matrix[i][j]);\n            }\n            printf(\"\\n\");\n        }\n        printf(\"}\\n\");\n    }\n    \nprivate:\n    static_assert(COLS > 0 && ROWS > 0, \"CMatrix cannot be zero-dimensioned\");\n    TMatrix m_Matrix;\n};\n\ntypedef CMatrix<float, 2, 2> CMatrix2x2f;\ntypedef CMatrix<double, 2, 2> CMatrix2x2d;\ntypedef CMatrix<int32_t, 2, 2> CMatrix2x2i;\ntypedef CMatrix<uint32_t, 2, 2> CMatrix2x2u;\n    \ntypedef CMatrix<float, 3, 3> CMatrix3x3f;\ntypedef CMatrix<double, 3, 3> CMatrix3x3d;\ntypedef CMatrix<int32_t, 3, 3> CMatrix3x3i;\ntypedef CMatrix<uint32_t, 3, 3> CMatrix3x3u;\n    \ntypedef CMatrix<float, 4, 4> CMatrix4x4f;\ntypedef CMatrix<double, 4, 4> CMatrix4x4d;\ntypedef CMatrix<int32_t, 4, 4> CMatrix4x4i;\ntypedef CMatrix<uint32_t, 4, 4> CMatrix4x4u;\n    \n\n}; \/\/ namespace jam\n\n#endif \/* defined(CMatrix_HPP) *\/\n<|endoftext|>"}
{"text":"<commit_before>#include \"tgbot\/net\/BoostHttpOnlySslClient.h\"\n\n#include <boost\/asio\/ssl.hpp>\n\n#include <cstddef>\n#include <vector>\n\nusing namespace std;\nusing namespace boost::asio;\nusing namespace boost::asio::ip;\n\nnamespace TgBot {\n\nBoostHttpOnlySslClient::BoostHttpOnlySslClient() : _httpParser() {\n}\n\nBoostHttpOnlySslClient::~BoostHttpOnlySslClient() {\n}\n\nstring BoostHttpOnlySslClient::makeRequest(const Url& url, const vector<HttpReqArg>& args) const {\n    tcp::resolver resolver(_ioService);\n    tcp::resolver::query query(url.host, \"443\");\n\n    ssl::context context(ssl::context::tlsv12_client);\n    context.set_default_verify_paths();\n\n    ssl::stream<tcp::socket> socket(_ioService, context);\n\n    connect(socket.lowest_layer(), resolver.resolve(query));\n\n    #ifdef TGBOT_DISABLE_NAGLES_ALGORITHM\n    socket.lowest_layer().set_option(tcp::no_delay(true));\n    #endif \/\/TGBOT_DISABLE_NAGLES_ALGORITHM\n    #ifdef TGBOT_CHANGE_SOCKET_BUFFER_SIZE\n    #if _WIN64 || __amd64__ || __x86_64__ || __MINGW64__ || __aarch64__ || __powerpc64__\n    socket.lowest_layer().set_option(socket_base::send_buffer_size(65536));\n    socket.lowest_layer().set_option(socket_base::receive_buffer_size(65536));\n    #else \/\/for 32-bit\n    socket.lowest_layer().set_option(socket_base::send_buffer_size(32768));\n    socket.lowest_layer().set_option(socket_base::receive_buffer_size(32768));\n    #endif \/\/Processor architecture\n    #endif \/\/TGBOT_CHANGE_SOCKET_BUFFER_SIZE\n    socket.set_verify_mode(ssl::verify_none);\n    socket.set_verify_callback(ssl::rfc2818_verification(url.host));\n\n    socket.handshake(ssl::stream<tcp::socket>::client);\n\n    string requestText = _httpParser.generateRequest(url, args, false);\n    write(socket, buffer(requestText.c_str(), requestText.length()));\n\n    string response;\n\n    #ifdef TGBOT_CHANGE_READ_BUFFER_SIZE\n    #if _WIN64 || __amd64__ || __x86_64__ || __MINGW64__ || __aarch64__ || __powerpc64__\n    char buff[65536];\n    #else \/\/for 32-bit\n    char buff[32768];\n    #endif \/\/Processor architecture\n    #else\n    char buff[1024];\n    #endif \/\/TGBOT_CHANGE_READ_BUFFER_SIZE\n\n    boost::system::error_code error;\n    while (!error) {\n        std::size_t bytes = read(socket, buffer(buff), error);\n        response += string(buff, bytes);\n    }\n\n    return _httpParser.extractBody(response);\n}\n\n}\n<commit_msg>Fixes https:\/\/github.com\/reo7sp\/tgbot-cpp\/issues\/13 for boost. Changed timeout to 20s compared to issue. Works at least for me.<commit_after>#include \"tgbot\/net\/BoostHttpOnlySslClient.h\"\n\n#include <boost\/asio\/ssl.hpp>\n\n#include <cstddef>\n#include <vector>\n\nusing namespace std;\nusing namespace boost::asio;\nusing namespace boost::asio::ip;\n\nnamespace TgBot {\n\nBoostHttpOnlySslClient::BoostHttpOnlySslClient() : _httpParser() {\n}\n\nBoostHttpOnlySslClient::~BoostHttpOnlySslClient() {\n}\n\nstring BoostHttpOnlySslClient::makeRequest(const Url& url, const vector<HttpReqArg>& args) const {\n    tcp::resolver resolver(_ioService);\n    tcp::resolver::query query(url.host, \"443\");\n\n    ssl::context context(ssl::context::tlsv12_client);\n    context.set_default_verify_paths();\n\n    ssl::stream<tcp::socket> socket(_ioService, context);\n\n    connect(socket.lowest_layer(), resolver.resolve(query));\n\n    #ifdef TGBOT_DISABLE_NAGLES_ALGORITHM\n    socket.lowest_layer().set_option(tcp::no_delay(true));\n    #endif \/\/TGBOT_DISABLE_NAGLES_ALGORITHM\n    #ifdef TGBOT_CHANGE_SOCKET_BUFFER_SIZE\n    #if _WIN64 || __amd64__ || __x86_64__ || __MINGW64__ || __aarch64__ || __powerpc64__\n    socket.lowest_layer().set_option(socket_base::send_buffer_size(65536));\n    socket.lowest_layer().set_option(socket_base::receive_buffer_size(65536));\n    #else \/\/for 32-bit\n    socket.lowest_layer().set_option(socket_base::send_buffer_size(32768));\n    socket.lowest_layer().set_option(socket_base::receive_buffer_size(32768));\n    #endif \/\/Processor architecture\n    #endif \/\/TGBOT_CHANGE_SOCKET_BUFFER_SIZE\n    socket.set_verify_mode(ssl::verify_none);\n    socket.set_verify_callback(ssl::rfc2818_verification(url.host));\n\n    socket.handshake(ssl::stream<tcp::socket>::client);\n\n    string requestText = _httpParser.generateRequest(url, args, false);\n    write(socket, buffer(requestText.c_str(), requestText.length()));\n\n    fd_set fileDescriptorSet;\n    struct timeval timeStruct;\n    \n    \/\/ set the timeout to 20 seconds\n    timeStruct.tv_sec = 20;\n    timeStruct.tv_usec = 0;\n    FD_ZERO(&fileDescriptorSet);\n    \n    \/\/ We'll need to get the underlying native socket for this select call, in order\n    \/\/ to add a simple timeout on the read:\n    \n    int nativeSocket = socket.lowest_layer().native_handle();\n    \n    FD_SET(nativeSocket,&fileDescriptorSet);        \n    select(nativeSocket+1,&fileDescriptorSet,NULL,NULL,&timeStruct);\n    \n    if(!FD_ISSET(nativeSocket,&fileDescriptorSet)){ \/\/ timeout\n        \n        std::string sMsg(\"TIMEOUT on read client data. Client IP: \");\n        \n        sMsg.append(socket.next_layer().remote_endpoint().address().to_string());\n        _ioService.reset();\n        \n        throw std::exception();\n    }      \n    \n    string response;\n\n    #ifdef TGBOT_CHANGE_READ_BUFFER_SIZE\n    #if _WIN64 || __amd64__ || __x86_64__ || __MINGW64__ || __aarch64__ || __powerpc64__\n    char buff[65536];\n    #else \/\/for 32-bit\n    char buff[32768];\n    #endif \/\/Processor architecture\n    #else\n    char buff[1024];\n    #endif \/\/TGBOT_CHANGE_READ_BUFFER_SIZE\n\n    boost::system::error_code error;\n    while (!error) {\n        std::size_t bytes = read(socket, buffer(buff), error);\n        response += string(buff, bytes);\n    }\n\n    return _httpParser.extractBody(response);\n}\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/******************************************************************************\n * Copyright (c) 2016-2017 Sergey Alexandrov\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 FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n ******************************************************************************\/\n\n#include <cmath>\n#include <fstream>\n#include <iostream>\n#include <string>\n#include <vector>\n\n#include <boost\/filesystem.hpp>\n#include <boost\/format.hpp>\n\n#include <opencv2\/core\/core.hpp>\n#include <opencv2\/highgui\/highgui.hpp>\n#include <opencv2\/imgproc\/imgproc.hpp>\n\n#include <radical\/radiometric_response.h>\n\n#include \"grabbers\/grabber.h\"\n\n#include \"utils\/plot_radiometric_response.h\"\n#include \"utils\/program_options.h\"\n\n#include \"calibration.h\"\n#include \"dataset.h\"\n#include \"dataset_collection.h\"\n#include \"engel_calibration.h\"\n\n#if HAVE_CERES\n#include \"debevec_calibration.h\"\n#define DEFAULT_METHOD \"debevec\"\n#else\n#define DEFAULT_METHOD \"engel\"\n#endif\n\nclass Options : public OptionsBase {\n public:\n  std::string data_source = \"\";\n  std::string output;\n  double convergence_threshold = 1e-5;\n  std::string calibration_method = DEFAULT_METHOD;\n  bool no_visualization = false;\n  std::string save_dataset = \"\";\n  DatasetCollection::Parameters dc;\n  unsigned int verbosity = 1;\n  unsigned int num_pixels = 5;\n  bool interactive = false;\n  double smoothing = 50;\n  bool print = false;\n\n protected:\n  virtual void addOptions(boost::program_options::options_description& desc) override {\n    namespace po = boost::program_options;\n    desc.add_options()(\"output,o\", po::value<std::string>(&output),\n                       \"Output filename with calibrated response function (default: camera model name + \\\".\\\" + camera \"\n                       \"serial number + \\\".crf\\\" suffix)\");\n    desc.add_options()(\"threshold,t\", po::value<double>(&convergence_threshold),\n                       \"Threshold for energy update after which convergence is declared (default: 1e-5)\");\n    desc.add_options()(\"method,m\", po::value<std::string>(&calibration_method)->default_value(calibration_method),\n                       \"Calibration method to use\");\n    desc.add_options()(\"no-visualization\", po::bool_switch(&no_visualization),\n                       \"Do not visualize the calibration process and results\");\n    desc.add_options()(\"save-dataset,s\", po::value<std::string>(&save_dataset),\n                       \"Save collected dataset in the given directory\");\n    desc.add_options()(\"verbosity,v\", po::value<unsigned int>(&verbosity)->default_value(verbosity),\n                       \"Verbosity level (0 - silent, 1 - normal, 2 - verbose)\");\n    desc.add_options()(\"num-pixels\", po::value<unsigned int>(&num_pixels)->default_value(num_pixels),\n                       \"Number of pixels\");\n    desc.add_options()(\"interactive\", po::bool_switch(&interactive), \"Wait for a keypress after each optimization iteration\");\n    desc.add_options()(\"smoothing\", po::value<double>(&smoothing)->default_value(smoothing), \"Smoothing lambda\");\n    desc.add_options()(\"print\", po::bool_switch(&print), \"Print calibrated response function to stdout\");\n\n    boost::program_options::options_description dcopt(\"Data collection\");\n    dcopt.add_options()(\"exposure-min\", po::value<int>(&dc.exposure_min),\n                        \"Minimum exposure (default: depends on the camera)\");\n    dcopt.add_options()(\"exposure-max\", po::value<int>(&dc.exposure_max),\n                        \"Maximum exposure (default: depends on the camera)\");\n    dcopt.add_options()(\"factor,f\", po::value<float>(&dc.exposure_factor),\n                        \"Multiplication factor for exposure (default: to cover desired exposure range in 30 steps)\");\n    dcopt.add_options()(\"average,a\",\n                        po::value<unsigned int>(&dc.num_average_frames)->default_value(dc.num_average_frames),\n                        \"Number of consecutive frames to average into each image\");\n    dcopt.add_options()(\"images,i\", po::value<unsigned int>(&dc.num_images)->default_value(dc.num_images),\n                        \"Number of images to take at each exposure setting\");\n    dcopt.add_options()(\"lag,l\",\n                        po::value<unsigned int>(&dc.exposure_control_lag)->default_value(dc.exposure_control_lag),\n                        \"Number of frames to skip after changing exposure setting\");\n    dcopt.add_options()(\"valid-min\",\n                        po::value<unsigned int>(&dc.valid_intensity_min)->default_value(dc.valid_intensity_min),\n                        \"Minimum valid intensity value of the sensor\");\n    dcopt.add_options()(\"valid-max\",\n                        po::value<unsigned int>(&dc.valid_intensity_max)->default_value(dc.valid_intensity_max),\n                        \"Maximum valid intensity value of the sensor\");\n    dcopt.add_options()(\"bloom-radius\", po::value<unsigned int>(&dc.bloom_radius)->default_value(dc.bloom_radius),\n                        \"Radius of the blooming effect\");\n    desc.add(dcopt);\n  }\n\n  virtual void addPositional(boost::program_options::options_description& desc,\n                             boost::program_options::positional_options_description& positional) override {\n    namespace po = boost::program_options;\n    desc.add_options()(\"data-source\", po::value<std::string>(&data_source),\n                       \"Data source, either a camera (\\\"asus\\\", \\\"intel\\\"), or a path to dataset\");\n    positional.add(\"data-source\", -1);\n  }\n\n  virtual void printHelp() override {\n    std::cout << \"Usage: calibrate_radiometric_response [options] <data-source>\" << std::endl;\n    std::cout << \"\" << std::endl;\n    std::cout << \"Calibrate radiometric response of a camera. Two algorithms are available:\" << std::endl;\n    std::cout << \" * Engel et al. (A Photometrically Calibrated Benchmark For Monocular Visual Odometry)\" << std::endl;\n    std::cout << \" * Debevec and Malik (Recovering High Dynamic Range Radiance Maps from Photographs)\" << std::endl;\n    std::cout << \"\" << std::endl;\n    std::cout << \"Working range of the sensor can be specified with --valid-min\/--valid-max options.\" << std::endl;\n    std::cout << \"Pixels with intensity values outside this range do not contribute to the energy and\" << std::endl;\n    std::cout << \"irradiance computation, however radiometric response is estimated for them as well.\" << std::endl;\n    std::cout << \"\" << std::endl;\n  }\n\n  virtual void validate() override {\n    if (dc.valid_intensity_max > 255) {\n      throw boost::program_options::error(\"maximum valid intensity can not exceed 255\");\n    }\n    if (dc.valid_intensity_min > 255) {\n      throw boost::program_options::error(\"minimum valid intensity can not exceed 255\");\n    }\n  }\n};\n\nint main(int argc, const char** argv) {\n  Options options;\n  if (!options.parse(argc, argv))\n    return 1;\n\n  auto imshow = [&options](const cv::Mat& image, int w = -1) {\n    if (!options.no_visualization) {\n      cv::imshow(\"Calibration\", image);\n      cv::waitKey(w);\n    }\n  };\n\n  auto data = Dataset::load(options.data_source);\n  if (data) {\n    if (!options(\"output\")) {\n      auto dir = boost::filesystem::canonical(options.data_source);\n      options.output = (dir \/ dir.filename()).string() + \".crf\";\n    }\n    if (options.verbosity)\n      std::cout << \"Loaded dataset from: \" << options.data_source << std::endl;\n  } else {\n    grabbers::Grabber::Ptr grabber;\n\n    try {\n      grabber = grabbers::createGrabber(options.data_source);\n    } catch (grabbers::GrabberException&) {\n      std::cerr << \"Failed to create a grabber\"\n                << (options.data_source != \"\" ? \" for camera \" + options.data_source : \"\") << std::endl;\n      return 1;\n    }\n\n    grabber->setAutoExposureEnabled(false);\n    grabber->setAutoWhiteBalanceEnabled(false);\n\n    if (!options(\"output\"))\n      options.output = grabber->getCameraUID() + \".crf\";\n    if (!options(\"exposure-min\"))\n      options.dc.exposure_min = grabber->getExposureRange().first;\n    if (!options(\"exposure-max\"))\n      options.dc.exposure_max = grabber->getExposureRange().second;\n    if (!options(\"factor\"))\n      options.dc.exposure_factor = std::pow(1.0f * options.dc.exposure_max \/ options.dc.exposure_min, 1.0f \/ 30);\n\n    \/\/ Change exposure to requested min value, wait some time until it works\n    cv::Mat frame;\n    for (size_t i = 0; i < 100; ++i) {\n      grabber->grabFrame(frame);\n      imshow(frame, 30);\n      grabber->setExposure(options.dc.exposure_min);\n    }\n\n    DatasetCollection data_collection(grabber, options.dc);\n\n    while (grabber->hasMoreFrames()) {\n      grabber->grabFrame(frame);\n      imshow(frame, 30);\n      if (data_collection.addFrame(frame))\n        break;\n    }\n\n    data = data_collection.getDataset();\n\n    if (options.save_dataset != \"\") {\n      if (options.verbosity)\n        std::cout << \"Saving dataset to: \" << options.save_dataset << std::endl;\n      data->save(options.save_dataset);\n      std::ofstream file(options.save_dataset + \"\/DESCRIPTION.txt\");\n      if (file.is_open()) {\n        file << \"Camera: \" << grabber->getCameraUID() << std::endl;\n        file << \"Resolution: \" << data->getImageSize() << std::endl;\n        file << \"Exposure range: \" << options.dc.exposure_min << \" \" << options.dc.exposure_max << std::endl;\n        file << \"Exposure factor: \" << options.dc.exposure_factor << std::endl;\n        file << \"Images per exposure time: \" << options.dc.num_images << std::endl;\n        file << \"Frames averaged into an image: \" << options.dc.num_average_frames << std::endl;\n        file.close();\n      }\n    }\n  }\n\n  Calibration::Ptr calibration;\n\n  if (options.calibration_method == \"engel\") {\n    auto cal = std::make_shared<EngelCalibration>();\n    cal->setConvergenceThreshold(options.convergence_threshold);\n    calibration = cal;\n  } else if (options.calibration_method == \"debevec\") {\n#if HAVE_CERES\n    auto cal = std::make_shared<DebevecCalibration>();\n    cal->setNumPixels(options.num_pixels);\n    cal->setSmoothingLambda(options.smoothing);\n    calibration = cal;\n#else\n    std::cerr << \"Debevec calibration is not supported because the project was compiled without Ceres.\\n\";\n    return 2;\n#endif\n  } else {\n    std::cerr << \"Unknown calibration method: \" << options.calibration_method\n              << \". Please specify \\\"engel\\\" or \\\"debevec\\\".\\n\";\n    return 1;\n  }\n\n  auto limshow = [=](const cv::Mat& image) {\n    cv::imshow(\"Calibration\", image);\n    cv::waitKey(options.interactive ? -1 : 1);\n  };\n\n  calibration->setValidPixelRange(static_cast<unsigned char>(options.dc.valid_intensity_min), static_cast<unsigned char>(options.dc.valid_intensity_max));\n  calibration->setVerbosity(options.verbosity);\n  if (!options.no_visualization)\n    calibration->setVisualizeProgress(limshow);\n\n  cv::Mat response = calibration->calibrate(*data);\n\n  if (options.verbosity)\n    std::cout << \"Done, writing response to: \" << options.output << std::endl;\n  radical::RadiometricResponse rr(response);\n  rr.save(options.output);\n\n  imshow(utils::plotRadiometricResponse(rr));\n\n  if (options.print) {\n    std::vector<cv::Mat> response_channels;\n    cv::split(response, response_channels);\n    for (const auto& ch : response_channels) {\n      for (int i = 0; i < ch.total(); ++i)\n        std::cout << ch.at<float>(i) << \" \";\n      std::cout << std::endl;\n    }\n  }\n\n  return 0;\n}\n<commit_msg>Fix a warning<commit_after>\/******************************************************************************\n * Copyright (c) 2016-2017 Sergey Alexandrov\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 FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n ******************************************************************************\/\n\n#include <cmath>\n#include <fstream>\n#include <iostream>\n#include <string>\n#include <vector>\n\n#include <boost\/filesystem.hpp>\n#include <boost\/format.hpp>\n\n#include <opencv2\/core\/core.hpp>\n#include <opencv2\/highgui\/highgui.hpp>\n#include <opencv2\/imgproc\/imgproc.hpp>\n\n#include <radical\/radiometric_response.h>\n\n#include \"grabbers\/grabber.h\"\n\n#include \"utils\/plot_radiometric_response.h\"\n#include \"utils\/program_options.h\"\n\n#include \"calibration.h\"\n#include \"dataset.h\"\n#include \"dataset_collection.h\"\n#include \"engel_calibration.h\"\n\n#if HAVE_CERES\n#include \"debevec_calibration.h\"\n#define DEFAULT_METHOD \"debevec\"\n#else\n#define DEFAULT_METHOD \"engel\"\n#endif\n\nclass Options : public OptionsBase {\n public:\n  std::string data_source = \"\";\n  std::string output;\n  double convergence_threshold = 1e-5;\n  std::string calibration_method = DEFAULT_METHOD;\n  bool no_visualization = false;\n  std::string save_dataset = \"\";\n  DatasetCollection::Parameters dc;\n  unsigned int verbosity = 1;\n  unsigned int num_pixels = 5;\n  bool interactive = false;\n  double smoothing = 50;\n  bool print = false;\n\n protected:\n  virtual void addOptions(boost::program_options::options_description& desc) override {\n    namespace po = boost::program_options;\n    desc.add_options()(\"output,o\", po::value<std::string>(&output),\n                       \"Output filename with calibrated response function (default: camera model name + \\\".\\\" + camera \"\n                       \"serial number + \\\".crf\\\" suffix)\");\n    desc.add_options()(\"threshold,t\", po::value<double>(&convergence_threshold),\n                       \"Threshold for energy update after which convergence is declared (default: 1e-5)\");\n    desc.add_options()(\"method,m\", po::value<std::string>(&calibration_method)->default_value(calibration_method),\n                       \"Calibration method to use\");\n    desc.add_options()(\"no-visualization\", po::bool_switch(&no_visualization),\n                       \"Do not visualize the calibration process and results\");\n    desc.add_options()(\"save-dataset,s\", po::value<std::string>(&save_dataset),\n                       \"Save collected dataset in the given directory\");\n    desc.add_options()(\"verbosity,v\", po::value<unsigned int>(&verbosity)->default_value(verbosity),\n                       \"Verbosity level (0 - silent, 1 - normal, 2 - verbose)\");\n    desc.add_options()(\"num-pixels\", po::value<unsigned int>(&num_pixels)->default_value(num_pixels),\n                       \"Number of pixels\");\n    desc.add_options()(\"interactive\", po::bool_switch(&interactive), \"Wait for a keypress after each optimization iteration\");\n    desc.add_options()(\"smoothing\", po::value<double>(&smoothing)->default_value(smoothing), \"Smoothing lambda\");\n    desc.add_options()(\"print\", po::bool_switch(&print), \"Print calibrated response function to stdout\");\n\n    boost::program_options::options_description dcopt(\"Data collection\");\n    dcopt.add_options()(\"exposure-min\", po::value<int>(&dc.exposure_min),\n                        \"Minimum exposure (default: depends on the camera)\");\n    dcopt.add_options()(\"exposure-max\", po::value<int>(&dc.exposure_max),\n                        \"Maximum exposure (default: depends on the camera)\");\n    dcopt.add_options()(\"factor,f\", po::value<float>(&dc.exposure_factor),\n                        \"Multiplication factor for exposure (default: to cover desired exposure range in 30 steps)\");\n    dcopt.add_options()(\"average,a\",\n                        po::value<unsigned int>(&dc.num_average_frames)->default_value(dc.num_average_frames),\n                        \"Number of consecutive frames to average into each image\");\n    dcopt.add_options()(\"images,i\", po::value<unsigned int>(&dc.num_images)->default_value(dc.num_images),\n                        \"Number of images to take at each exposure setting\");\n    dcopt.add_options()(\"lag,l\",\n                        po::value<unsigned int>(&dc.exposure_control_lag)->default_value(dc.exposure_control_lag),\n                        \"Number of frames to skip after changing exposure setting\");\n    dcopt.add_options()(\"valid-min\",\n                        po::value<unsigned int>(&dc.valid_intensity_min)->default_value(dc.valid_intensity_min),\n                        \"Minimum valid intensity value of the sensor\");\n    dcopt.add_options()(\"valid-max\",\n                        po::value<unsigned int>(&dc.valid_intensity_max)->default_value(dc.valid_intensity_max),\n                        \"Maximum valid intensity value of the sensor\");\n    dcopt.add_options()(\"bloom-radius\", po::value<unsigned int>(&dc.bloom_radius)->default_value(dc.bloom_radius),\n                        \"Radius of the blooming effect\");\n    desc.add(dcopt);\n  }\n\n  virtual void addPositional(boost::program_options::options_description& desc,\n                             boost::program_options::positional_options_description& positional) override {\n    namespace po = boost::program_options;\n    desc.add_options()(\"data-source\", po::value<std::string>(&data_source),\n                       \"Data source, either a camera (\\\"asus\\\", \\\"intel\\\"), or a path to dataset\");\n    positional.add(\"data-source\", -1);\n  }\n\n  virtual void printHelp() override {\n    std::cout << \"Usage: calibrate_radiometric_response [options] <data-source>\" << std::endl;\n    std::cout << \"\" << std::endl;\n    std::cout << \"Calibrate radiometric response of a camera. Two algorithms are available:\" << std::endl;\n    std::cout << \" * Engel et al. (A Photometrically Calibrated Benchmark For Monocular Visual Odometry)\" << std::endl;\n    std::cout << \" * Debevec and Malik (Recovering High Dynamic Range Radiance Maps from Photographs)\" << std::endl;\n    std::cout << \"\" << std::endl;\n    std::cout << \"Working range of the sensor can be specified with --valid-min\/--valid-max options.\" << std::endl;\n    std::cout << \"Pixels with intensity values outside this range do not contribute to the energy and\" << std::endl;\n    std::cout << \"irradiance computation, however radiometric response is estimated for them as well.\" << std::endl;\n    std::cout << \"\" << std::endl;\n  }\n\n  virtual void validate() override {\n    if (dc.valid_intensity_max > 255) {\n      throw boost::program_options::error(\"maximum valid intensity can not exceed 255\");\n    }\n    if (dc.valid_intensity_min > 255) {\n      throw boost::program_options::error(\"minimum valid intensity can not exceed 255\");\n    }\n  }\n};\n\nint main(int argc, const char** argv) {\n  Options options;\n  if (!options.parse(argc, argv))\n    return 1;\n\n  auto imshow = [&options](const cv::Mat& image, int w = -1) {\n    if (!options.no_visualization) {\n      cv::imshow(\"Calibration\", image);\n      cv::waitKey(w);\n    }\n  };\n\n  auto data = Dataset::load(options.data_source);\n  if (data) {\n    if (!options(\"output\")) {\n      auto dir = boost::filesystem::canonical(options.data_source);\n      options.output = (dir \/ dir.filename()).string() + \".crf\";\n    }\n    if (options.verbosity)\n      std::cout << \"Loaded dataset from: \" << options.data_source << std::endl;\n  } else {\n    grabbers::Grabber::Ptr grabber;\n\n    try {\n      grabber = grabbers::createGrabber(options.data_source);\n    } catch (grabbers::GrabberException&) {\n      std::cerr << \"Failed to create a grabber\"\n                << (options.data_source != \"\" ? \" for camera \" + options.data_source : \"\") << std::endl;\n      return 1;\n    }\n\n    grabber->setAutoExposureEnabled(false);\n    grabber->setAutoWhiteBalanceEnabled(false);\n\n    if (!options(\"output\"))\n      options.output = grabber->getCameraUID() + \".crf\";\n    if (!options(\"exposure-min\"))\n      options.dc.exposure_min = grabber->getExposureRange().first;\n    if (!options(\"exposure-max\"))\n      options.dc.exposure_max = grabber->getExposureRange().second;\n    if (!options(\"factor\"))\n      options.dc.exposure_factor = std::pow(1.0f * options.dc.exposure_max \/ options.dc.exposure_min, 1.0f \/ 30);\n\n    \/\/ Change exposure to requested min value, wait some time until it works\n    cv::Mat frame;\n    for (size_t i = 0; i < 100; ++i) {\n      grabber->grabFrame(frame);\n      imshow(frame, 30);\n      grabber->setExposure(options.dc.exposure_min);\n    }\n\n    DatasetCollection data_collection(grabber, options.dc);\n\n    while (grabber->hasMoreFrames()) {\n      grabber->grabFrame(frame);\n      imshow(frame, 30);\n      if (data_collection.addFrame(frame))\n        break;\n    }\n\n    data = data_collection.getDataset();\n\n    if (options.save_dataset != \"\") {\n      if (options.verbosity)\n        std::cout << \"Saving dataset to: \" << options.save_dataset << std::endl;\n      data->save(options.save_dataset);\n      std::ofstream file(options.save_dataset + \"\/DESCRIPTION.txt\");\n      if (file.is_open()) {\n        file << \"Camera: \" << grabber->getCameraUID() << std::endl;\n        file << \"Resolution: \" << data->getImageSize() << std::endl;\n        file << \"Exposure range: \" << options.dc.exposure_min << \" \" << options.dc.exposure_max << std::endl;\n        file << \"Exposure factor: \" << options.dc.exposure_factor << std::endl;\n        file << \"Images per exposure time: \" << options.dc.num_images << std::endl;\n        file << \"Frames averaged into an image: \" << options.dc.num_average_frames << std::endl;\n        file.close();\n      }\n    }\n  }\n\n  Calibration::Ptr calibration;\n\n  if (options.calibration_method == \"engel\") {\n    auto cal = std::make_shared<EngelCalibration>();\n    cal->setConvergenceThreshold(options.convergence_threshold);\n    calibration = cal;\n  } else if (options.calibration_method == \"debevec\") {\n#if HAVE_CERES\n    auto cal = std::make_shared<DebevecCalibration>();\n    cal->setNumPixels(options.num_pixels);\n    cal->setSmoothingLambda(options.smoothing);\n    calibration = cal;\n#else\n    std::cerr << \"Debevec calibration is not supported because the project was compiled without Ceres.\\n\";\n    return 2;\n#endif\n  } else {\n    std::cerr << \"Unknown calibration method: \" << options.calibration_method\n              << \". Please specify \\\"engel\\\" or \\\"debevec\\\".\\n\";\n    return 1;\n  }\n\n  auto limshow = [=](const cv::Mat& image) {\n    cv::imshow(\"Calibration\", image);\n    cv::waitKey(options.interactive ? -1 : 1);\n  };\n\n  calibration->setValidPixelRange(static_cast<unsigned char>(options.dc.valid_intensity_min), static_cast<unsigned char>(options.dc.valid_intensity_max));\n  calibration->setVerbosity(options.verbosity);\n  if (!options.no_visualization)\n    calibration->setVisualizeProgress(limshow);\n\n  cv::Mat response = calibration->calibrate(*data);\n\n  if (options.verbosity)\n    std::cout << \"Done, writing response to: \" << options.output << std::endl;\n  radical::RadiometricResponse rr(response);\n  rr.save(options.output);\n\n  imshow(utils::plotRadiometricResponse(rr));\n\n  if (options.print) {\n    std::vector<cv::Mat> response_channels;\n    cv::split(response, response_channels);\n    for (const auto& ch : response_channels) {\n      for (int i = 0; i < static_cast<int>(ch.total()); ++i)\n        std::cout << ch.at<float>(i) << \" \";\n      std::cout << std::endl;\n    }\n  }\n\n  return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n Itay Marom\n Cisco Systems, Inc.\n*\/\n\n\/*\nCopyright (c) 2015-2015 Cisco Systems, Inc.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*\/\n\n#include \"trex_astf_batch.h\"\n#include \"trex_global.h\"\n#include \"utl_sync_barrier.h\"\n\n\nvoid \nTrexDpCoreAstfBatch::start_astf() {\n    dsec_t d_time_flow;\n\n    CParserOption *go=&CGlobalInfo::m_options;\n\n    \/* do we need to disable this tread client port *\/\n    bool disable_client=false;\n    if (go->m_astf_mode==CParserOption::OP_ASTF_MODE_SERVR_ONLY) {\n        disable_client=true;\n    }else{\n        uint8_t p1;\n        uint8_t p2;\n        m_core->get_port_ids(p1,p2);\n        if (go->m_astf_mode==CParserOption::OP_ASTF_MODE_CLIENT_MASK && \n           ((go->m_astf_client_mask & (0x1<<p1))==0) ){\n            disable_client=true;\n        }\n    }\n\n    if ( !m_core->Create_tcp() ) {\n        fprintf(stderr,\" ERROR in tcp object creation \\n\");\n        return;\n    }\n\n    d_time_flow = m_core->m_tcp_fif_d_time; \/* set by Create_tcp function *\/\n\n    double d_phase= 0.01 + (double)m_core->m_thread_id * m_core->m_tcp_fif_d_time \/ (double)m_core->m_max_threads;\n\n\n    if ( CGlobalInfo::is_realtime()  ) {\n        if (d_phase > 0.2 ) {\n            d_phase =  0.01 + m_core->m_thread_id * 0.01;\n        }\n    }\n    dsec_t c_stop_sec = d_phase + m_core->m_yaml_info.m_duration_sec;\n    m_core->m_stop_time_sec = c_stop_sec;\n    m_core->m_cur_flow_id = 1;\n    m_core->m_stats.clear();\n\n    double old_offset=0.0;\n\n    \/* we are delaying only the generation of the traffic \n         timers\/rx should Work immediately \n      *\/\n\n    m_core->m_tcp_fif_d_time = d_time_flow;\n\n    \/* sync all core to the same time *\/\n    CSyncBarrier * b=m_core->get_sync_b();\n    if (b) {\n       assert(b->sync_barrier(m_core->m_thread_id)==0);\n    }\n    dsec_t now= now_sec() ;\n    m_core->m_cur_time_sec = now;\n\n    CGenNode *node=0;\n\n    if (!disable_client){\n        node = m_core->create_node();\n        node->m_type = CGenNode::TCP_TX_FIF;\n        node->m_time = now + d_phase + 0.1; \/* phase the transmit a bit *\/\n        m_core->m_node_gen.add_node(node);\n    }\n\n    node = m_core->create_node() ;\n    node->m_type = CGenNode::TCP_RX_FLUSH;\n    node->m_time = now;\n    m_core->m_node_gen.add_node(node);\n\n    node = m_core->create_node();\n    node->m_type = CGenNode::TCP_TW;\n    node->m_time = now;\n    m_core->m_node_gen.add_node(node);\n\n    node = m_core->create_node();\n    node->m_type = CGenNode::FLOW_SYNC;\n    node->m_time = now;\n    m_core->m_node_gen.add_node(node);\n\n#ifdef _DEBUG\n    if ( m_core->m_preview_mode.getVMode() >2 ) {\n\n        CGenNode::DumpHeader(stdout);\n    }\n#endif\n\n    m_core->m_node_gen.flush_file(c_stop_sec, d_time_flow, false, m_core, old_offset);\n\n\n#ifdef VALG\n    CALLGRIND_STOP_INSTRUMENTATION;\n    printf (\" %llu \\n\",os_get_hr_tick_64()-_start_time);\n#endif\n    if ( !CGlobalInfo::m_options.preview.getNoCleanFlowClose() &&  (m_core->is_terminated_by_master()==false) ) {\n        \/* clean close *\/\n        m_core->m_node_gen.flush_file(0, d_time_flow, true, m_core, old_offset);\n    }\n\n    if (m_core->m_preview_mode.getVMode() > 1 ) {\n        fprintf(stdout,\"\\n\\n\");\n        fprintf(stdout,\"\\n\\n\");\n        fprintf(stdout,\"file stats \\n\");\n        fprintf(stdout,\"=================\\n\");\n        m_core->m_stats.dump(stdout);\n    }\n    m_core->m_node_gen.close_file(m_core);\n}\n\n\n\nvoid\nTrexAstfBatch::shutdown() {\n    \/* shutdown all DP cores *\/\n    send_msg_to_all_dp(new TrexDpQuit());\n        \n    \/* stop the latency core *\/\n    get_mg()->stop();\n    delay(1000);\n}\n\n\nvoid\nTrexAstfBatch::publish_async_data() {\n    std::string json;\n\n    \/* backward compatible *\/\n    get_mg()->dump_json(json);\n    get_publisher()->publish_json(json);\n\n    \/* more info *\/\n    get_mg()->dump_json_v2(json);\n    get_publisher()->publish_json(json);\n\n    CSTTCp *lpstt = get_platform_api().get_fl()->m_stt_cp;\n    if (lpstt) {\n        \/\/if ( m_stats_cnt%4==0) { \/* could be significat, reduce the freq *\/\n        if (lpstt->dump_json(json)) {\n            get_publisher()->publish_json(json);\n        }\n        \/\/}\n    }\n}\n\n<commit_msg>astf- duration is for traffic and not from app start time<commit_after>\/*\n Itay Marom\n Cisco Systems, Inc.\n*\/\n\n\/*\nCopyright (c) 2015-2015 Cisco Systems, Inc.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*\/\n\n#include \"trex_astf_batch.h\"\n#include \"trex_global.h\"\n#include \"utl_sync_barrier.h\"\n\n\nvoid \nTrexDpCoreAstfBatch::start_astf() {\n    dsec_t d_time_flow;\n\n    CParserOption *go=&CGlobalInfo::m_options;\n\n    \/* do we need to disable this tread client port *\/\n    bool disable_client=false;\n    if (go->m_astf_mode==CParserOption::OP_ASTF_MODE_SERVR_ONLY) {\n        disable_client=true;\n    }else{\n        uint8_t p1;\n        uint8_t p2;\n        m_core->get_port_ids(p1,p2);\n        if (go->m_astf_mode==CParserOption::OP_ASTF_MODE_CLIENT_MASK && \n           ((go->m_astf_client_mask & (0x1<<p1))==0) ){\n            disable_client=true;\n        }\n    }\n\n    if ( !m_core->Create_tcp() ) {\n        fprintf(stderr,\" ERROR in tcp object creation \\n\");\n        return;\n    }\n\n    d_time_flow = m_core->m_tcp_fif_d_time; \/* set by Create_tcp function *\/\n\n    double d_phase= 0.01 + (double)m_core->m_thread_id * m_core->m_tcp_fif_d_time \/ (double)m_core->m_max_threads;\n\n\n    if ( CGlobalInfo::is_realtime()  ) {\n        if (d_phase > 0.2 ) {\n            d_phase =  0.01 + m_core->m_thread_id * 0.01;\n        }\n    }\n    m_core->m_cur_flow_id = 1;\n    m_core->m_stats.clear();\n\n    double old_offset=0.0;\n\n    \/* we are delaying only the generation of the traffic \n         timers\/rx should Work immediately \n      *\/\n\n    m_core->m_tcp_fif_d_time = d_time_flow;\n\n    \/* sync all core to the same time *\/\n    CSyncBarrier * b=m_core->get_sync_b();\n    if (b) {\n       assert(b->sync_barrier(m_core->m_thread_id)==0);\n    }\n    dsec_t now= now_sec() ;\n\n    dsec_t c_stop_sec = now + d_phase + m_core->m_yaml_info.m_duration_sec;\n\n    m_core->m_stop_time_sec = c_stop_sec;\n\n    m_core->m_cur_time_sec = now;\n\n    CGenNode *node=0;\n\n    if (!disable_client){\n        node = m_core->create_node();\n        node->m_type = CGenNode::TCP_TX_FIF;\n        node->m_time = now + d_phase + 0.1; \/* phase the transmit a bit *\/\n        m_core->m_node_gen.add_node(node);\n    }\n\n    node = m_core->create_node() ;\n    node->m_type = CGenNode::TCP_RX_FLUSH;\n    node->m_time = now;\n    m_core->m_node_gen.add_node(node);\n\n    node = m_core->create_node();\n    node->m_type = CGenNode::TCP_TW;\n    node->m_time = now;\n    m_core->m_node_gen.add_node(node);\n\n    node = m_core->create_node();\n    node->m_type = CGenNode::FLOW_SYNC;\n    node->m_time = now;\n    m_core->m_node_gen.add_node(node);\n\n#ifdef _DEBUG\n    if ( m_core->m_preview_mode.getVMode() >2 ) {\n\n        CGenNode::DumpHeader(stdout);\n    }\n#endif\n\n    m_core->m_node_gen.flush_file(c_stop_sec, d_time_flow, false, m_core, old_offset);\n\n\n#ifdef VALG\n    CALLGRIND_STOP_INSTRUMENTATION;\n    printf (\" %llu \\n\",os_get_hr_tick_64()-_start_time);\n#endif\n    if ( !CGlobalInfo::m_options.preview.getNoCleanFlowClose() &&  (m_core->is_terminated_by_master()==false) ) {\n        \/* clean close *\/\n        m_core->m_node_gen.flush_file(0, d_time_flow, true, m_core, old_offset);\n    }\n\n    if (m_core->m_preview_mode.getVMode() > 1 ) {\n        fprintf(stdout,\"\\n\\n\");\n        fprintf(stdout,\"\\n\\n\");\n        fprintf(stdout,\"file stats \\n\");\n        fprintf(stdout,\"=================\\n\");\n        m_core->m_stats.dump(stdout);\n    }\n    m_core->m_node_gen.close_file(m_core);\n}\n\n\n\nvoid\nTrexAstfBatch::shutdown() {\n    \/* shutdown all DP cores *\/\n    send_msg_to_all_dp(new TrexDpQuit());\n        \n    \/* stop the latency core *\/\n    get_mg()->stop();\n    delay(1000);\n}\n\n\nvoid\nTrexAstfBatch::publish_async_data() {\n    std::string json;\n\n    \/* backward compatible *\/\n    get_mg()->dump_json(json);\n    get_publisher()->publish_json(json);\n\n    \/* more info *\/\n    get_mg()->dump_json_v2(json);\n    get_publisher()->publish_json(json);\n\n    CSTTCp *lpstt = get_platform_api().get_fl()->m_stt_cp;\n    if (lpstt) {\n        \/\/if ( m_stats_cnt%4==0) { \/* could be significat, reduce the freq *\/\n        if (lpstt->dump_json(json)) {\n            get_publisher()->publish_json(json);\n        }\n        \/\/}\n    }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    Persons Model\n    Copyright (C) 2012  Martin Klapetek <martin.klapetek@gmail.com>\n    Copyright (C) 2012  Aleix Pol Gonzalez <aleixpol@blue-systems.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\n#include \"persons-model.h\"\n#include \"persons-model-item.h\"\n#include \"persons-model-contact-item.h\"\n#include \"resource-watcher-service.h\"\n#include \"nepomuk-tp-channel-delegate.h\"\n\n#include <Soprano\/Query\/QueryLanguage>\n#include <Soprano\/QueryResultIterator>\n#include <Soprano\/Model>\n#include <Soprano\/Vocabulary\/NAO>\n\n#include <Nepomuk2\/ResourceManager>\n#include <Nepomuk2\/Variant>\n#include <Nepomuk2\/Vocabulary\/PIMO>\n#include <Nepomuk2\/Vocabulary\/NCO>\n#include <Nepomuk2\/Vocabulary\/NIE>\n#include <Nepomuk2\/SimpleResource>\n#include <Nepomuk2\/SimpleResourceGraph>\n#include <Nepomuk2\/StoreResourcesJob>\n#include <KDebug>\n\nstruct PersonsModelPrivate {\n    PersonsModelPrivate() : ktpDelegate(0) {}\n\n    void initKTPDelegate() { if(!ktpDelegate) ktpDelegate = new NepomukTpChannelDelegate; }\n\n    NepomukTpChannelDelegate *ktpDelegate;\n};\n\nPersonsModel::PersonsModel(QObject *parent, bool init, const QString& customQuery)\n    : QStandardItemModel(parent)\n    , d_ptr(new PersonsModelPrivate)\n{\n    QHash<int, QByteArray> names = roleNames();\n    names.insert(PersonsModel::EmailRole, \"email\");\n    names.insert(PersonsModel::PhoneRole, \"phone\");\n    names.insert(PersonsModel::ContactIdRole, \"contactId\");\n    names.insert(PersonsModel::ContactTypeRole, \"contactType\");\n    names.insert(PersonsModel::IMRole, \"im\");\n    names.insert(PersonsModel::NickRole, \"nick\");\n    names.insert(PersonsModel::UriRole, \"uri\");\n    names.insert(PersonsModel::NameRole, \"name\");\n    names.insert(PersonsModel::PhotoRole, \"photo\");\n    names.insert(PersonsModel::ContactsCountRole, \"contactsCount\");\n    names.insert(PersonsModel::ResourceTypeRole, \"resourceType\");\n    names.insert(PersonsModel::ContactActionsRole, \"contactActions\");\n    setRoleNames(names);\n\n    if(init) {\n        QString nco_query = customQuery;\n        if(customQuery.isEmpty())\n            nco_query = QString::fromUtf8(\n            \"select DISTINCT ?uri ?pimo_groundingOccurrence ?nco_hasIMAccount \"\n                \"?nco_imNickname ?telepathy_statusType ?nco_imID ?nco_imAccountType ?nco_hasEmailAddress \"\n                \"?nco_imStatus ?nie_url ?nao_prefLabel \"\n\n                \"WHERE { \"\n                    \"?uri a nco:PersonContact. \"\n\n                    \"OPTIONAL { ?pimo_groundingOccurrence  pimo:groundingOccurrence  ?uri. }\"\n                    \"OPTIONAL { ?uri  nao:prefLabel  ?nao_prefLabel. }\"\n\n                    \"OPTIONAL { \"\n                        \"?uri                     nco:hasIMAccount            ?nco_hasIMAccount. \"\n                        \"OPTIONAL { ?nco_hasIMAccount          nco:imNickname              ?nco_imNickname. } \"\n                        \"OPTIONAL { ?nco_hasIMAccount          telepathy:statusType        ?telepathy_statusType. } \"\n                        \"OPTIONAL { ?nco_hasIMAccount          nco:imStatus                ?nco_imStatus. } \"\n                        \"OPTIONAL { ?nco_hasIMAccount          nco:imID                    ?nco_imID. } \"\n                        \"OPTIONAL { ?nco_hasIMAccount          nco:imAccountType           ?nco_imAccountType. } \"\n                    \" } \"\n                    \"OPTIONAL {\"\n                        \"?uri                       nco:photo                   ?phRes. \"\n                        \"?phRes                     nie:url                     ?nie_url. \"\n                    \" } \"\n                    \"OPTIONAL { \"\n                        \"?uri                       nco:hasEmailAddress         ?nco_hasEmailAddress. \"\n                        \"?nco_hasEmailAddress       nco:emailAddress            ?nco_emailAddress. \"\n                    \" } \"\n                \"}\");\n\n        QMetaObject::invokeMethod(this, \"query\", Qt::QueuedConnection, Q_ARG(QString, nco_query));\n        new ResourceWatcherService(this);\n    }\n}\n\ntemplate <class T>\nQList<QStandardItem*> toStandardItems(const QList<T*>& items)\n{\n    QList<QStandardItem*> ret;\n    foreach(QStandardItem* it, items) {\n        ret += it;\n    }\n    return ret;\n}\n\nQHash<QString, QUrl> initUriToBinding()\n{\n    QHash<QString, QUrl> ret;\n    QList<QUrl> list;\n    list\n    << Nepomuk2::Vocabulary::NCO::imNickname()\n    << Nepomuk2::Vocabulary::NCO::imAccountType()\n    << Nepomuk2::Vocabulary::NCO::imID()\n    << Soprano::Vocabulary::NAO::prefLabel()\n    \/\/                      << Nepomuk2::Vocabulary::Telepathy::statusType()\n    \/\/                      << Nepomuk2::Vocabulary::Telepathy::accountIdentifier()\n    << QUrl(QLatin1String(\"http:\/\/nepomuk.kde.org\/ontologies\/2009\/06\/20\/telepathy#statusType\"))\n    << Nepomuk2::Vocabulary::NCO::imStatus()\n    << Nepomuk2::Vocabulary::NCO::hasIMAccount()\n    << Nepomuk2::Vocabulary::NCO::emailAddress()\n    << Nepomuk2::Vocabulary::NIE::url();\n\n    foreach(const QUrl& keyUri, list) {\n        QString keyString = keyUri.toString();\n        \/\/convert every key to correspond to the nepomuk bindings\n        keyString = keyString.mid(keyString.lastIndexOf(QLatin1Char('\/')) + 1).replace(QLatin1Char('#'), QLatin1Char('_'));\n        ret[keyString] = keyUri;\n    }\n    return ret;\n}\n\nvoid PersonsModel::query(const QString& nco_query)\n{\n    Q_ASSERT(rowCount()==0);\n    QHash<QString, QUrl> uriToBinding = initUriToBinding();\n\n    Soprano::Model* m = Nepomuk2::ResourceManager::instance()->mainModel();\n    Soprano::QueryResultIterator it = m->executeQuery(nco_query, Soprano::Query::QueryLanguageSparql);\n    QHash<QUrl, PersonsModelContactItem*> contacts;\n    QHash<QUrl, PersonsModelItem*> persons;\n\n    while(it.next()) {\n        QUrl currentUri = it[QLatin1String(\"uri\")].uri();\n        if (currentUri == QUrl(QLatin1String(\"nepomuk:\/me\"))) {\n            continue;\n        }\n        PersonsModelContactItem* contactNode = contacts.value(currentUri);\n        bool newContact = !contactNode;\n        if(!contactNode) {\n            contactNode = new PersonsModelContactItem(currentUri);\n        }\n\n        for(QHash<QString, QUrl>::const_iterator iter=uriToBinding.constBegin(), itEnd=uriToBinding.constEnd(); iter!=itEnd; ++iter) {\n            contactNode->addData(iter.value(), it[iter.key()].toString());\n        }\n\n        QUrl pimoPersonUri = it[QLatin1String(\"pimo_groundingOccurrence\")].uri();\n        if (pimoPersonUri == QUrl(QLatin1String(\"nepomuk:\/me\"))) {\n            continue;\n        }\n\n        if (pimoPersonUri.isEmpty()) {\n            \/\/TODO: look for other contacts and possibly automerge\n            contacts.insert(currentUri, contactNode);\n        } else {\n            QHash< QUrl, PersonsModelItem* >::const_iterator pos = persons.constFind(pimoPersonUri);\n            if (pos == persons.constEnd()) {\n                pos = persons.insert(pimoPersonUri, new PersonsModelItem(pimoPersonUri));\n            }\n            pos.value()->appendRow(contactNode);\n        }\n    }\n\n    invisibleRootItem()->appendRows(toStandardItems(persons.values()));\n    invisibleRootItem()->appendRows(toStandardItems(contacts.values()));\n    emit peopleAdded();\n    d_ptr->initKTPDelegate();\n    kDebug() << \"Model ready\";\n}\n\nvoid PersonsModel::unmerge(const QUrl& contactUri, const QUrl& personUri)\n{\n    Nepomuk2::Resource oldPerson(personUri);\n    Q_ASSERT(oldPerson.property(Nepomuk2::Vocabulary::PIMO::groundingOccurrence()).toUrlList().size()>=2 && \"there's nothing to unmerge...\");\n    oldPerson.removeProperty(Nepomuk2::Vocabulary::PIMO::groundingOccurrence(), contactUri);\n    if (!oldPerson.hasProperty(Nepomuk2::Vocabulary::PIMO::groundingOccurrence())) {\n        oldPerson.remove();\n    }\n\n    Nepomuk2::SimpleResource newPerson;\n    newPerson.addType( Nepomuk2::Vocabulary::PIMO::Person() );\n    newPerson.setProperty(Nepomuk2::Vocabulary::PIMO::groundingOccurrence(), contactUri);\n\n    Nepomuk2::SimpleResourceGraph graph;\n    graph << newPerson;\n\n    KJob * job = Nepomuk2::storeResources( graph );\n    job->setProperty(\"uri\", contactUri);\n    job->setObjectName(\"Unmerge\");\n    connect(job, SIGNAL(finished(KJob*)), SLOT(jobFinished(KJob*)));\n    job->start();\n}\n\nvoid PersonsModel::merge(const QList< QUrl >& persons)\n{\n    KJob* job = Nepomuk2::mergeResources( persons );\n    job->setObjectName(\"Merge\");\n    connect(job, SIGNAL(finished(KJob*)), SLOT(jobFinished(KJob*)));\n}\n\nvoid PersonsModel::merge(const QVariantList& persons)\n{\n    QList<QUrl> conv;\n    foreach(const QVariant& p, persons)\n        conv += p.toUrl();\n    merge(conv);\n}\n\nvoid PersonsModel::jobFinished(KJob* job)\n{\n    if(job->error()!=0) {\n        kWarning() << job->objectName() << \" failed for \"<< job->property(\"uri\").toString() << job->errorText() << job->errorString();\n    } else {\n        kWarning() << job->objectName() << \" done: \"<< job->property(\"uri\").toString();\n    }\n}\n\nQModelIndex PersonsModel::findRecursively(int role, const QVariant& value, const QModelIndex& idx) const\n{\n    if(idx.isValid() && data(idx, role)==value)\n        return idx;\n    int rows = rowCount(idx);\n    for(int i=0; i<rows; i++) {\n        QModelIndex ret = findRecursively(role, value, index(i, 0, idx));\n        if(ret.isValid())\n            return ret;\n    }\n    return QModelIndex();\n}\n\nQModelIndex PersonsModel::indexForUri(const QUrl& uri) const\n{\n    return findRecursively(PersonsModel::UriRole, uri);\n}\n\nvoid PersonsModel::createPerson(const Nepomuk2::Resource& res)\n{\n    Q_ASSERT(!indexForUri(res.uri()).isValid());\n    \/\/pass only the uri as that will not add the contacts from groundingOccurrence\n    \/\/rationale: if we're adding contacts to the person, we need to check the model\n    \/\/           if those contacts are not already in the model and if they are,\n    \/\/           we need to remove them from the toplevel and put them only under\n    \/\/           the person item. In the time of creation, the model() call from\n    \/\/           PersonsModelItem is null, so we cannot check the model.\n    \/\/           Furthermore this slot is used only when new pimo:Person is created\n    \/\/           in Nepomuk and in that case Nepomuk *always* signals propertyAdded\n    \/\/           with \"groundingOccurrence\", so we get the contacts either way.\n    appendRow(new PersonsModelItem(res.uri()));\n}\n\nvoid PersonsModel::createContact(const Nepomuk2::Resource& res)\n{\n    appendRow(new PersonsModelContactItem(res.uri()));\n}\n\nPersonsModelContactItem* PersonsModel::contactForIMAccount(const QUrl& uri) const\n{\n    QStandardItem* it = itemFromIndex(findRecursively(PersonsModel::IMAccountUriRole, uri));\n    return dynamic_cast<PersonsModelContactItem*>(it);\n}\n\nvoid PersonsModel::createPersonFromContacts(const QList<QUrl>& contacts)\n{\n    Nepomuk2::SimpleResource newPimoPerson;\n    newPimoPerson.addType(Nepomuk2::Vocabulary::PIMO::Person());\n\n    foreach(const QUrl &contact, contacts) {\n        newPimoPerson.addProperty(Nepomuk2::Vocabulary::PIMO::groundingOccurrence(), contact);\n    }\n\n    Nepomuk2::SimpleResourceGraph graph;\n    graph << newPimoPerson;\n\n    KJob *job = Nepomuk2::storeResources( graph, Nepomuk2::IdentifyNew, Nepomuk2::OverwriteProperties );\n    connect(job, SIGNAL(finished(KJob*)), this, SLOT(jobFinished(KJob*)));\n    \/\/the new person will be added to the model by the resourceCreated and propertyAdded Nepomuk signals\n}\n\nvoid PersonsModel::removePerson(const QUrl &uri)\n{\n    Nepomuk2::Resource oldPerson(uri);\n    oldPerson.remove();\n}\n\nvoid PersonsModel::removePersonFromModel(const QModelIndex &index)\n{\n    PersonsModelItem *person = dynamic_cast<PersonsModelItem*>(itemFromIndex(index));\n\n    for (int i = 0; i < person->rowCount(); i++) {\n        \/\/reparent the contacts to toplevel\n        invisibleRootItem()->appendRow(person->takeChild(i));\n    }\n\n    removeRow(index.row());\n}\n\nNepomukTpChannelDelegate* PersonsModel::tpChannelDelegate() const\n{\n    return d_ptr->ktpDelegate;\n}\n<commit_msg>Don't split the PIMO:Person on unmerge into two new ones, for now<commit_after>\/*\n    Persons Model\n    Copyright (C) 2012  Martin Klapetek <martin.klapetek@gmail.com>\n    Copyright (C) 2012  Aleix Pol Gonzalez <aleixpol@blue-systems.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\n#include \"persons-model.h\"\n#include \"persons-model-item.h\"\n#include \"persons-model-contact-item.h\"\n#include \"resource-watcher-service.h\"\n#include \"nepomuk-tp-channel-delegate.h\"\n\n#include <Soprano\/Query\/QueryLanguage>\n#include <Soprano\/QueryResultIterator>\n#include <Soprano\/Model>\n#include <Soprano\/Vocabulary\/NAO>\n\n#include <Nepomuk2\/ResourceManager>\n#include <Nepomuk2\/Variant>\n#include <Nepomuk2\/Vocabulary\/PIMO>\n#include <Nepomuk2\/Vocabulary\/NCO>\n#include <Nepomuk2\/Vocabulary\/NIE>\n#include <Nepomuk2\/SimpleResource>\n#include <Nepomuk2\/SimpleResourceGraph>\n#include <Nepomuk2\/StoreResourcesJob>\n#include <KDebug>\n\nstruct PersonsModelPrivate {\n    PersonsModelPrivate() : ktpDelegate(0) {}\n\n    void initKTPDelegate() { if(!ktpDelegate) ktpDelegate = new NepomukTpChannelDelegate; }\n\n    NepomukTpChannelDelegate *ktpDelegate;\n};\n\nPersonsModel::PersonsModel(QObject *parent, bool init, const QString& customQuery)\n    : QStandardItemModel(parent)\n    , d_ptr(new PersonsModelPrivate)\n{\n    QHash<int, QByteArray> names = roleNames();\n    names.insert(PersonsModel::EmailRole, \"email\");\n    names.insert(PersonsModel::PhoneRole, \"phone\");\n    names.insert(PersonsModel::ContactIdRole, \"contactId\");\n    names.insert(PersonsModel::ContactTypeRole, \"contactType\");\n    names.insert(PersonsModel::IMRole, \"im\");\n    names.insert(PersonsModel::NickRole, \"nick\");\n    names.insert(PersonsModel::UriRole, \"uri\");\n    names.insert(PersonsModel::NameRole, \"name\");\n    names.insert(PersonsModel::PhotoRole, \"photo\");\n    names.insert(PersonsModel::ContactsCountRole, \"contactsCount\");\n    names.insert(PersonsModel::ResourceTypeRole, \"resourceType\");\n    names.insert(PersonsModel::ContactActionsRole, \"contactActions\");\n    setRoleNames(names);\n\n    if(init) {\n        QString nco_query = customQuery;\n        if(customQuery.isEmpty())\n            nco_query = QString::fromUtf8(\n            \"select DISTINCT ?uri ?pimo_groundingOccurrence ?nco_hasIMAccount \"\n                \"?nco_imNickname ?telepathy_statusType ?nco_imID ?nco_imAccountType ?nco_hasEmailAddress \"\n                \"?nco_imStatus ?nie_url ?nao_prefLabel \"\n\n                \"WHERE { \"\n                    \"?uri a nco:PersonContact. \"\n\n                    \"OPTIONAL { ?pimo_groundingOccurrence  pimo:groundingOccurrence  ?uri. }\"\n                    \"OPTIONAL { ?uri  nao:prefLabel  ?nao_prefLabel. }\"\n\n                    \"OPTIONAL { \"\n                        \"?uri                     nco:hasIMAccount            ?nco_hasIMAccount. \"\n                        \"OPTIONAL { ?nco_hasIMAccount          nco:imNickname              ?nco_imNickname. } \"\n                        \"OPTIONAL { ?nco_hasIMAccount          telepathy:statusType        ?telepathy_statusType. } \"\n                        \"OPTIONAL { ?nco_hasIMAccount          nco:imStatus                ?nco_imStatus. } \"\n                        \"OPTIONAL { ?nco_hasIMAccount          nco:imID                    ?nco_imID. } \"\n                        \"OPTIONAL { ?nco_hasIMAccount          nco:imAccountType           ?nco_imAccountType. } \"\n                    \" } \"\n                    \"OPTIONAL {\"\n                        \"?uri                       nco:photo                   ?phRes. \"\n                        \"?phRes                     nie:url                     ?nie_url. \"\n                    \" } \"\n                    \"OPTIONAL { \"\n                        \"?uri                       nco:hasEmailAddress         ?nco_hasEmailAddress. \"\n                        \"?nco_hasEmailAddress       nco:emailAddress            ?nco_emailAddress. \"\n                    \" } \"\n                \"}\");\n\n        QMetaObject::invokeMethod(this, \"query\", Qt::QueuedConnection, Q_ARG(QString, nco_query));\n        new ResourceWatcherService(this);\n    }\n}\n\ntemplate <class T>\nQList<QStandardItem*> toStandardItems(const QList<T*>& items)\n{\n    QList<QStandardItem*> ret;\n    foreach(QStandardItem* it, items) {\n        ret += it;\n    }\n    return ret;\n}\n\nQHash<QString, QUrl> initUriToBinding()\n{\n    QHash<QString, QUrl> ret;\n    QList<QUrl> list;\n    list\n    << Nepomuk2::Vocabulary::NCO::imNickname()\n    << Nepomuk2::Vocabulary::NCO::imAccountType()\n    << Nepomuk2::Vocabulary::NCO::imID()\n    << Soprano::Vocabulary::NAO::prefLabel()\n    \/\/                      << Nepomuk2::Vocabulary::Telepathy::statusType()\n    \/\/                      << Nepomuk2::Vocabulary::Telepathy::accountIdentifier()\n    << QUrl(QLatin1String(\"http:\/\/nepomuk.kde.org\/ontologies\/2009\/06\/20\/telepathy#statusType\"))\n    << Nepomuk2::Vocabulary::NCO::imStatus()\n    << Nepomuk2::Vocabulary::NCO::hasIMAccount()\n    << Nepomuk2::Vocabulary::NCO::emailAddress()\n    << Nepomuk2::Vocabulary::NIE::url();\n\n    foreach(const QUrl& keyUri, list) {\n        QString keyString = keyUri.toString();\n        \/\/convert every key to correspond to the nepomuk bindings\n        keyString = keyString.mid(keyString.lastIndexOf(QLatin1Char('\/')) + 1).replace(QLatin1Char('#'), QLatin1Char('_'));\n        ret[keyString] = keyUri;\n    }\n    return ret;\n}\n\nvoid PersonsModel::query(const QString& nco_query)\n{\n    Q_ASSERT(rowCount()==0);\n    QHash<QString, QUrl> uriToBinding = initUriToBinding();\n\n    Soprano::Model* m = Nepomuk2::ResourceManager::instance()->mainModel();\n    Soprano::QueryResultIterator it = m->executeQuery(nco_query, Soprano::Query::QueryLanguageSparql);\n    QHash<QUrl, PersonsModelContactItem*> contacts;\n    QHash<QUrl, PersonsModelItem*> persons;\n\n    while(it.next()) {\n        QUrl currentUri = it[QLatin1String(\"uri\")].uri();\n        if (currentUri == QUrl(QLatin1String(\"nepomuk:\/me\"))) {\n            continue;\n        }\n        PersonsModelContactItem* contactNode = contacts.value(currentUri);\n        bool newContact = !contactNode;\n        if(!contactNode) {\n            contactNode = new PersonsModelContactItem(currentUri);\n        }\n\n        for(QHash<QString, QUrl>::const_iterator iter=uriToBinding.constBegin(), itEnd=uriToBinding.constEnd(); iter!=itEnd; ++iter) {\n            contactNode->addData(iter.value(), it[iter.key()].toString());\n        }\n\n        QUrl pimoPersonUri = it[QLatin1String(\"pimo_groundingOccurrence\")].uri();\n        if (pimoPersonUri == QUrl(QLatin1String(\"nepomuk:\/me\"))) {\n            continue;\n        }\n\n        if (pimoPersonUri.isEmpty()) {\n            \/\/TODO: look for other contacts and possibly automerge\n            contacts.insert(currentUri, contactNode);\n        } else {\n            QHash< QUrl, PersonsModelItem* >::const_iterator pos = persons.constFind(pimoPersonUri);\n            if (pos == persons.constEnd()) {\n                pos = persons.insert(pimoPersonUri, new PersonsModelItem(pimoPersonUri));\n            }\n            pos.value()->appendRow(contactNode);\n        }\n    }\n\n    invisibleRootItem()->appendRows(toStandardItems(persons.values()));\n    invisibleRootItem()->appendRows(toStandardItems(contacts.values()));\n    emit peopleAdded();\n    d_ptr->initKTPDelegate();\n    kDebug() << \"Model ready\";\n}\n\nvoid PersonsModel::unmerge(const QUrl& contactUri, const QUrl& personUri)\n{\n    Nepomuk2::Resource oldPerson(personUri);\n    Q_ASSERT(oldPerson.property(Nepomuk2::Vocabulary::PIMO::groundingOccurrence()).toUrlList().size()>=2 && \"there's nothing to unmerge...\");\n    oldPerson.removeProperty(Nepomuk2::Vocabulary::PIMO::groundingOccurrence(), contactUri);\n    if (!oldPerson.hasProperty(Nepomuk2::Vocabulary::PIMO::groundingOccurrence())) {\n        oldPerson.remove();\n    }\n\n\/\/     Nepomuk2::SimpleResource newPerson;\n\/\/     newPerson.addType( Nepomuk2::Vocabulary::PIMO::Person() );\n\/\/     newPerson.setProperty(Nepomuk2::Vocabulary::PIMO::groundingOccurrence(), contactUri);\n\/\/\n\/\/     Nepomuk2::SimpleResourceGraph graph;\n\/\/     graph << newPerson;\n\/\/\n\/\/     KJob * job = Nepomuk2::storeResources( graph );\n\/\/     job->setProperty(\"uri\", contactUri);\n\/\/     job->setObjectName(\"Unmerge\");\n\/\/     connect(job, SIGNAL(finished(KJob*)), SLOT(jobFinished(KJob*)));\n\/\/     job->start();\n}\n\nvoid PersonsModel::merge(const QList< QUrl >& persons)\n{\n    KJob* job = Nepomuk2::mergeResources( persons );\n    job->setObjectName(\"Merge\");\n    connect(job, SIGNAL(finished(KJob*)), SLOT(jobFinished(KJob*)));\n}\n\nvoid PersonsModel::merge(const QVariantList& persons)\n{\n    QList<QUrl> conv;\n    foreach(const QVariant& p, persons)\n        conv += p.toUrl();\n    merge(conv);\n}\n\nvoid PersonsModel::jobFinished(KJob* job)\n{\n    if(job->error()!=0) {\n        kWarning() << job->objectName() << \" failed for \"<< job->property(\"uri\").toString() << job->errorText() << job->errorString();\n    } else {\n        kWarning() << job->objectName() << \" done: \"<< job->property(\"uri\").toString();\n    }\n}\n\nQModelIndex PersonsModel::findRecursively(int role, const QVariant& value, const QModelIndex& idx) const\n{\n    if(idx.isValid() && data(idx, role)==value)\n        return idx;\n    int rows = rowCount(idx);\n    for(int i=0; i<rows; i++) {\n        QModelIndex ret = findRecursively(role, value, index(i, 0, idx));\n        if(ret.isValid())\n            return ret;\n    }\n    return QModelIndex();\n}\n\nQModelIndex PersonsModel::indexForUri(const QUrl& uri) const\n{\n    return findRecursively(PersonsModel::UriRole, uri);\n}\n\nvoid PersonsModel::createPerson(const Nepomuk2::Resource& res)\n{\n    Q_ASSERT(!indexForUri(res.uri()).isValid());\n    \/\/pass only the uri as that will not add the contacts from groundingOccurrence\n    \/\/rationale: if we're adding contacts to the person, we need to check the model\n    \/\/           if those contacts are not already in the model and if they are,\n    \/\/           we need to remove them from the toplevel and put them only under\n    \/\/           the person item. In the time of creation, the model() call from\n    \/\/           PersonsModelItem is null, so we cannot check the model.\n    \/\/           Furthermore this slot is used only when new pimo:Person is created\n    \/\/           in Nepomuk and in that case Nepomuk *always* signals propertyAdded\n    \/\/           with \"groundingOccurrence\", so we get the contacts either way.\n    appendRow(new PersonsModelItem(res.uri()));\n}\n\nvoid PersonsModel::createContact(const Nepomuk2::Resource& res)\n{\n    appendRow(new PersonsModelContactItem(res.uri()));\n}\n\nPersonsModelContactItem* PersonsModel::contactForIMAccount(const QUrl& uri) const\n{\n    QStandardItem* it = itemFromIndex(findRecursively(PersonsModel::IMAccountUriRole, uri));\n    return dynamic_cast<PersonsModelContactItem*>(it);\n}\n\nvoid PersonsModel::createPersonFromContacts(const QList<QUrl>& contacts)\n{\n    Nepomuk2::SimpleResource newPimoPerson;\n    newPimoPerson.addType(Nepomuk2::Vocabulary::PIMO::Person());\n\n    foreach(const QUrl &contact, contacts) {\n        newPimoPerson.addProperty(Nepomuk2::Vocabulary::PIMO::groundingOccurrence(), contact);\n    }\n\n    Nepomuk2::SimpleResourceGraph graph;\n    graph << newPimoPerson;\n\n    KJob *job = Nepomuk2::storeResources( graph, Nepomuk2::IdentifyNew, Nepomuk2::OverwriteProperties );\n    connect(job, SIGNAL(finished(KJob*)), this, SLOT(jobFinished(KJob*)));\n    \/\/the new person will be added to the model by the resourceCreated and propertyAdded Nepomuk signals\n}\n\nvoid PersonsModel::removePerson(const QUrl &uri)\n{\n    Nepomuk2::Resource oldPerson(uri);\n    oldPerson.remove();\n}\n\nvoid PersonsModel::removePersonFromModel(const QModelIndex &index)\n{\n    PersonsModelItem *person = dynamic_cast<PersonsModelItem*>(itemFromIndex(index));\n\n    for (int i = 0; i < person->rowCount(); i++) {\n        \/\/reparent the contacts to toplevel\n        invisibleRootItem()->appendRow(person->takeChild(i));\n    }\n\n    removeRow(index.row());\n}\n\nNepomukTpChannelDelegate* PersonsModel::tpChannelDelegate() const\n{\n    return d_ptr->ktpDelegate;\n}\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>optimize<commit_after><|endoftext|>"}
{"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: t; c-basic-offset: 4 -*- vim:set ts=4 sw=4 sts=4 noet: *\/\n#include \"mathml.h\"\n\n#include <cstring>\n\nnamespace flint {\nnamespace mathml {\n\nnamespace {\n\nconst char *kScalarConstantElement[] = {\n\t\"eulergamma\",\n\t\"exponentiale\",\n\t\"pi\"\n};\n\nconst int kNumScalarConstantElement = static_cast<int>(sizeof(kScalarConstantElement)\/sizeof(kScalarConstantElement[0]));\n\n}\n\nbool IsScalarConstantElement(const std::string &name)\n{\n\tfor (int i=0;i<kNumScalarConstantElement;i++) {\n\t\tif (std::strcmp(name.c_str(), kScalarConstantElement[i]) == 0)\n\t\t\treturn true;\n\t}\n\treturn false;\n}\n\n}\n}\n<commit_msg>Use range-based for<commit_after>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: t; c-basic-offset: 4 -*- vim:set ts=4 sw=4 sts=4 noet: *\/\n#include \"mathml.h\"\n\n#include <cstring>\n\nnamespace flint {\nnamespace mathml {\n\nnamespace {\n\nconst char *kScalarConstantElement[] = {\n\t\"eulergamma\",\n\t\"exponentiale\",\n\t\"pi\"\n};\n\n}\n\nbool IsScalarConstantElement(const std::string &name)\n{\n\tfor (const char *e : kScalarConstantElement) {\n\t\tif (std::strcmp(name.c_str(), e) == 0)\n\t\t\treturn true;\n\t}\n\treturn false;\n}\n\n}\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/                                                                            \/\/\n\/\/ This file is part of Swift2D.                                              \/\/\n\/\/                                                                            \/\/\n\/\/ Copyright: (c) 2011-2014 Simon Schneegans & Felix Lauer                    \/\/\n\/\/                                                                            \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <swift2d\/behaviors\/MoveBehavior.hpp>\n\n#include <swift2d\/scene\/SceneObject.hpp>\n\nnamespace swift {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nMoveBehavior::MoveBehavior()\n  : LinearSpeed()\n  , AngularSpeed() {\n\n  LinearSpeed.set(0);\n  AngularSpeed.set(0);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid MoveBehavior::update(double time) {\n  auto user_transform(get_user()->Transform.get());\n  math::rotate(user_transform, AngularSpeed.get() * time);\n  math::translate(user_transform, LinearSpeed.get() * time, 0);\n  get_user()->Transform.set(user_transform);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid MoveBehavior::accept(SavableObjectVisitor& visitor) {\n  Component::accept(visitor);\n  visitor.add_member(\"LinearSpeed\", LinearSpeed);\n  visitor.add_member(\"AngularSpeed\", AngularSpeed);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n}\n<commit_msg>fixed occasional non-rotating-move-behavior bug<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/                                                                            \/\/\n\/\/ This file is part of Swift2D.                                              \/\/\n\/\/                                                                            \/\/\n\/\/ Copyright: (c) 2011-2014 Simon Schneegans & Felix Lauer                    \/\/\n\/\/                                                                            \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <swift2d\/behaviors\/MoveBehavior.hpp>\n\n#include <swift2d\/scene\/SceneObject.hpp>\n\nnamespace swift {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nMoveBehavior::MoveBehavior()\n  : LinearSpeed(0)\n  , AngularSpeed(0) {}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid MoveBehavior::update(double time) {\n  auto user_transform(get_user()->Transform.get());\n  math::rotate(user_transform, AngularSpeed.get() * time);\n  math::translate(user_transform, LinearSpeed.get() * time, 0);\n  get_user()->Transform.set(user_transform);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid MoveBehavior::accept(SavableObjectVisitor& visitor) {\n  Component::accept(visitor);\n  visitor.add_member(\"LinearSpeed\", LinearSpeed);\n  visitor.add_member(\"AngularSpeed\", AngularSpeed);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"circuits\/circuit.h\"\n#include \"matrix\/matrix.h\"\n#include \"gtest\/gtest.h\"\n#include <iostream>\n#include <stdio.h>\n\n\nusing namespace std;\n\n\nTEST(ElementStampsTest, Resistor) {\n    \/\/ Arrange\n                      \/\/ (val)(a)(b)\n    Element resistor(\"R1\", 10, 1, 2);\n    int numVariables = 2;\n\n    double matrix[MAX_NODES+1][MAX_NODES+2];\n    init(numVariables, matrix);\n\n    \/\/ Act\n    resistor.applyStamp(matrix, numVariables);\n\n    \/\/ Assert\n    double expected[MAX_NODES+1][MAX_NODES+2] = {\n        {0,    0,    0, 0},\n        {0,  0.1, -0.1, 0},\n        {0, -0.1,  0.1, 0}\n    };\n    for (int i=1; i<=numVariables; i++) {\n        for (int j=1; j<=numVariables+1; j++) {\n            EXPECT_EQ(expected[i][j], matrix[i][j]);\n        }\n    }\n}\n\n\nTEST(ElementStampsTest, VCCS) {\n    \/*\n     * Voltage Controlled Current Source\n     * (a.k.a. Transconductance)\n     *\/\n\n    \/\/ Arrange\n                              \/\/ (val)(a)(b)(c)(d)\n    Element transconductance(\"G1\", 10, 1, 2, 3, 4);\n    int numVariables = 4;\n\n    double matrix[MAX_NODES+1][MAX_NODES+2];\n    init(numVariables, matrix);\n\n    \/\/ Act\n    transconductance.applyStamp(matrix, numVariables);\n\n    \/\/ Assert\n    double expected[MAX_NODES+1][MAX_NODES+2] = {\n        {0, 0 , 0 ,   0 ,   0 , 0},\n        {0, 0 , 0 ,  10 , -10 , 0},\n        {0, 0 , 0 , -10 ,  10 , 0},\n        {0, 0 , 0 ,   0 ,   0 , 0},\n        {0, 0 , 0 ,   0 ,   0 , 0}\n    };\n    for (int i=1; i<=numVariables; i++) {\n        for (int j=1; j<=numVariables+1; j++) {\n            EXPECT_EQ(expected[i][j], matrix[i][j]);\n        }\n    }\n}\n\n\nTEST(ElementStampsTest, CurrentSource) {\n    \/\/ Arrange\n                           \/\/ (val)(a)(b)\n    Element currentSource(\"I1\", 10, 1, 2);\n    int numVariables = 2;\n\n    double matrix[MAX_NODES+1][MAX_NODES+2];\n    init(numVariables, matrix);\n\n    \/\/ Act\n    currentSource.applyStamp(matrix, numVariables);\n\n    \/\/ Assert\n    double expected[MAX_NODES+1][MAX_NODES+2] = {\n        {0, 0 , 0 ,  0},\n        {0, 0 , 0 , -10},\n        {0, 0 , 0 ,  10}\n    };\n    for (int i=1; i<=numVariables; i++) {\n        for (int j=1; j<=numVariables+1; j++) {\n            EXPECT_EQ(expected[i][j], matrix[i][j]);\n        }\n    }\n}\n\n\nTEST(ElementStampsTest, VoltageSource) {\n    \/\/ Arrange\n                           \/\/ (val)(a)(b)\n    Element voltageSource(\"V1\", 10, 1, 2);\n    int numVariables = 2;\n\n    double matrix[MAX_NODES+1][MAX_NODES+2];\n    \/\/ Bad smell about the need of this member function...\n    \/\/ Without it, only first part of matrix would be populated!\n    vector<string> dummyVariablesList(10);\n    voltageSource.addCurrentVariables(numVariables, dummyVariablesList);\n\n    \/\/ Important!!! Should be initialized after updating numVariables\n    \/\/ with extra current variables!\n    init(numVariables, matrix);\n\n    \/\/ Act\n    voltageSource.applyStamp(matrix, numVariables);\n\n    \/\/ Assert\n    double expected[MAX_NODES+1][MAX_NODES+2] = {\n        { 0,  0 , 0 ,  0 ,   0 },\n        { 0,  0 , 0 ,  1 ,   0 },\n        { 0,  0 , 0 , -1 ,   0 },\n        { 0, -1 , 1 ,  0 , -10 }\n    };\n    for (int i=1; i<=numVariables; i++) {\n        for (int j=1; j<=numVariables+1; j++) {\n            EXPECT_EQ(expected[i][j], matrix[i][j]);\n        }\n    }\n}\n\n\nTEST(ElementStampsTest, VCVS) {\n    \/*\n     * Voltage Controlled Voltage Source\n     * (a.k.a. Voltage Amplifier)\n     *\/\n    \/\/ Arrange\n                              \/\/ (val)(a)(b)(c)(d)\n    Element voltageAmplifier(\"E1\", 10, 1, 2, 3, 4);\n    int numVariables = 4;\n\n    double matrix[MAX_NODES+1][MAX_NODES+2];\n    \/\/ Bad smell about the need of this member function...\n    \/\/ Without it, only first part of matrix would be populated!\n    vector<string> dummyVariablesList(10);\n    voltageAmplifier.addCurrentVariables(numVariables, dummyVariablesList);\n\n    \/\/ Important!!! Should be initialized after updating numVariables\n    \/\/ with extra current variables!\n    init(numVariables, matrix);\n\n    \/\/ Act\n    voltageAmplifier.applyStamp(matrix, numVariables);\n\n    \/\/ Assert\n    double expected[MAX_NODES+1][MAX_NODES+2] = {\n       \/\/ 0    1    2   3     4   jx   i\n        { 0 ,  0 ,  0 , 0 ,   0 ,  0 , 0 },\n        { 0 ,  0 ,  0 , 0 ,   0 ,  1 , 0 },\n        { 0 ,  0 ,  0 , 0 ,   0 , -1 , 0 },\n        { 0 ,  0 ,  0 , 0 ,   0 ,  0 , 0 },\n        { 0 ,  0 ,  0 , 0 ,   0 ,  0 , 0 },\n        { 0 , -1 , +1, 10 , -10 ,  0 , 0 }\n    };\n    for (int i=1; i<=numVariables; i++) {\n        for (int j=1; j<=numVariables+1; j++) {\n            EXPECT_EQ(expected[i][j], matrix[i][j]);\n        }\n    }\n}\n\n\nTEST(ElementStampsTest, CCCS) {\n    \/*\n     * Current Controlled Current Source\n     * (a.k.a. Current Amplifier)\n     *\/\n    \/\/ Arrange\n                              \/\/ (val)(a)(b)(c)(d)\n    Element currentAmplifier(\"F1\", 10, 1, 2, 3, 4);\n    int numVariables = 4;\n\n    double matrix[MAX_NODES+1][MAX_NODES+2];\n    \/\/ Bad smell about the need of this member function...\n    \/\/ Without it, only first part of matrix would be populated!\n    vector<string> dummyVariablesList(10);\n    currentAmplifier.addCurrentVariables(numVariables, dummyVariablesList);\n\n    \/\/ Important!!! Should be initialized after updating numVariables\n    \/\/ with extra current variables!\n    init(numVariables, matrix);\n\n    \/\/ Act\n    currentAmplifier.applyStamp(matrix, numVariables);\n\n    \/\/ Assert\n    double expected[MAX_NODES+1][MAX_NODES+2] = {\n       \/\/ 0    1    2    3    4    jx   i\n        { 0 ,  0 ,  0 ,  0 ,  0 ,   0 , 0 },\n        { 0 ,  0 ,  0 ,  0 ,  0 ,  10 , 0 },\n        { 0 ,  0 ,  0 ,  0 ,  0 , -10 , 0 },\n        { 0 ,  0 ,  0 ,  0 ,  0 ,   1 , 0 },\n        { 0 ,  0 ,  0 ,  0 ,  0 ,  -1 , 0 },\n        { 0 ,  0 ,  0 , -1 ,  1 ,   0 , 0 }\n    };\n    for (int i=1; i<=numVariables; i++) {\n        for (int j=1; j<=numVariables+1; j++) {\n            EXPECT_EQ(expected[i][j], matrix[i][j]);\n        }\n    }\n}\n\n\nTEST(ElementStampsTest, CCVS) {\n    \/*\n     * Current Controlled Voltage Source\n     * (a.k.a. Transresistance)\n     *\/\n    \/\/ Arrange\n                             \/\/ (val)(a)(b)(c)(d)\n    Element transresistance(\"H1\", 10, 1, 2, 3, 4);\n    int numVariables = 4;\n\n    double matrix[MAX_NODES+1][MAX_NODES+2];\n    \/\/ Bad smell about the need of this member function...\n    \/\/ Without it, only first part of matrix would be populated!\n    vector<string> dummyVariablesList(10);\n    transresistance.addCurrentVariables(numVariables, dummyVariablesList);\n\n    \/\/ Important!!! Should be initialized after updating numVariables\n    \/\/ with extra current variables!\n    init(numVariables, matrix);\n\n    \/\/ Act\n    transresistance.applyStamp(matrix, numVariables);\n\n    \/\/ Assert\n    double expected[MAX_NODES+1][MAX_NODES+2] = {\n       \/\/ 0    1    2    3    4   jx   jy   i\n        { 0 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 , 0 },\n        { 0 ,  0 ,  0 ,  0 ,  0 ,  0 ,  1 , 0 },\n        { 0 ,  0 ,  0 ,  0 ,  0 ,  0 , -1 , 0 },\n        { 0 ,  0 ,  0 ,  0 ,  0 ,  1 ,  0 , 0 },\n        { 0 ,  0 ,  0 ,  0 ,  0 , -1 ,  0 , 0 },\n        { 0 ,  0 ,  0 , -1 ,  1 ,  0 ,  0 , 0 },\n        { 0 , -1 ,  1 ,  0 ,  0 , 10 ,  0 , 0 },\n    };\n    for (int i=1; i<=numVariables; i++) {\n        for (int j=1; j<=numVariables+1; j++) {\n            EXPECT_EQ(expected[i][j], matrix[i][j]);\n        }\n    }\n}\n\n\nTEST(ElementStampsTest, OpAmp) {\n    \/*\n     * Operational Amplifier\n     * (a.k.a. Op Amp)\n     *\/\n    \/\/ Arrange\n                    \/\/ (x)-> dont care!\n                    \/\/ (x)(a)(b)(c)(d)\n    Element opamp(\"O1\", 0, 1, 2, 3, 4);\n    int numVariables = 4;\n\n    double matrix[MAX_NODES+1][MAX_NODES+2];\n    \/\/ Bad smell about the need of this member function...\n    \/\/ Without it, only first part of matrix would be populated!\n    vector<string> dummyVariablesList(10);\n    opamp.addCurrentVariables(numVariables, dummyVariablesList);\n\n    \/\/ Important!!! Should be initialized after updating numVariables\n    \/\/ with extra current variables!\n    init(numVariables, matrix);\n\n    \/\/ Act\n    opamp.applyStamp(matrix, numVariables);\n\n    \/\/ Assert\n    double expected[MAX_NODES+1][MAX_NODES+2] = {\n       \/\/ 0    1    2    3    4   jx   i\n        { 0 ,  0 ,  0 ,  0 ,  0 ,  0 , 0 },\n        { 0 ,  0 ,  0 ,  0 ,  0 ,  1 , 0 },\n        { 0 ,  0 ,  0 ,  0 ,  0 , -1 , 0 },\n        { 0 ,  0 ,  0 ,  0 ,  0 ,  0 , 0 },\n        { 0 ,  0 ,  0 ,  0 ,  0 ,  0 , 0 },\n        { 0 ,  0 ,  0 ,  1 , -1 ,  0 , 0 },\n    };\n    for (int i=1; i<=numVariables; i++) {\n        for (int j=1; j<=numVariables+1; j++) {\n            EXPECT_EQ(expected[i][j], matrix[i][j]);\n        }\n    }\n}\n\n\nTEST(CircuitStampsTest, SimpleCircuit) {\n    \/\/ Arrange\n    int numNodes = 6;\n    int numElements = 9;\n    int numVariables = 9;\n    double matrix[MAX_NODES+1][MAX_NODES+2];\n    vector<Element> netlist(MAX_ELEMS);\n    \/\/ From netlist data\/simples.net\n    \/\/ Changes order (not netlist parameters order)! Value first!\n                     \/\/ ( name, val, a, b, ... )\n    netlist[1] = Element(\"R0102\", 1, 1, 2);\n    netlist[2] = Element(\"R0301\", 1, 3, 1);\n    netlist[3] = Element(\"R0403\", 1, 4, 3);\n    netlist[4] = Element(\"R0004\", 1, 0, 4);\n    netlist[5] = Element(\"R0502\", 1, 5, 2);\n    netlist[6] = Element(\"R0605\", 1, 6, 5);\n    netlist[7] = Element(\"O0300\", 0, 3, 0, 1, 0); \/\/ OpAmps have no value!!!\n    netlist[8] = Element(\"O0600\", 0, 6, 0, 5, 4);\n    netlist[9] = Element(\"V0200\", 1, 2, 0);\n    \/\/ Bad smell about the need of this member function...\n    \/\/ Without it, only first part of matrix would be populated!\n    vector<string> dummyVariablesList(10);\n    int pivotNumVariables = numNodes;\n    netlist[7].addCurrentVariables(pivotNumVariables, dummyVariablesList);\n    netlist[8].addCurrentVariables(pivotNumVariables, dummyVariablesList);\n    netlist[9].addCurrentVariables(pivotNumVariables, dummyVariablesList);\n\n    Circuit circuit(\n        numElements,\n        numNodes,\n        numVariables,\n        netlist\n    );\n    init(circuit.getNumVariables(), matrix);\n\n    \/\/ Act\n    circuit.applyStamps(matrix);\n\n    \/\/ Assert\n    double expected[MAX_NODES+1][MAX_NODES+2] = {\n        {  0 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 },\n        {  0 ,  2 , -1 , -1 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 },\n        {  0 , -1 ,  2 ,  0 ,  0 , -1 ,  0 ,  0 ,  0 ,  1 ,  0 },\n        {  0 , -1 ,  0 ,  2 , -1 ,  0 ,  0 ,  1 ,  0 ,  0 ,  0 },\n        {  0 ,  0 ,  0 , -1 ,  2 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 },\n        {  0 ,  0 , -1 ,  0 ,  0 ,  2 , -1 ,  0 ,  0 ,  0 ,  0 },\n        {  0 ,  0 ,  0 ,  0 ,  0 , -1 ,  1 ,  0 ,  1 ,  0 ,  0 },\n        {  0 ,  1 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 },\n        {  0 ,  0 ,  0 ,  0 , -1 ,  1 ,  0 ,  0 ,  0 ,  0 ,  0 },\n        {  0 ,  0 , -1 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 , -1 },\n    };\n    for (int i=1; i<=circuit.getNumVariables(); i++) {\n        for (int j=1; j<=circuit.getNumVariables()+1; j++) {\n            EXPECT_EQ(expected[i][j], matrix[i][j]);\n        }\n    }\n}\n<commit_msg>Improves verbosity of tests<commit_after>#include \"circuits\/circuit.h\"\n#include \"matrix\/matrix.h\"\n#include \"gtest\/gtest.h\"\n#include <iostream>\n#include <stdio.h>\n\n\nusing namespace std;\n\n\nTEST(ElementStampsTest, Resistor) {\n    \/\/ Arrange\n                      \/\/ (val)(a)(b)\n    Element resistor(\"R1\", 10, 1, 2);\n    int numVariables = 2;\n\n    double matrix[MAX_NODES+1][MAX_NODES+2];\n    init(numVariables, matrix);\n\n    \/\/ Act\n    resistor.applyStamp(matrix, numVariables);\n\n    \/\/ Assert\n    double expected[MAX_NODES+1][MAX_NODES+2] = {\n        {0,    0,    0, 0},\n        {0,  0.1, -0.1, 0},\n        {0, -0.1,  0.1, 0}\n    };\n    for (int i=1; i<=numVariables; i++) {\n        for (int j=1; j<=numVariables+1; j++) {\n            EXPECT_EQ(expected[i][j], matrix[i][j]);\n        }\n    }\n    print(numVariables, matrix);\n}\n\n\nTEST(ElementStampsTest, VCCS) {\n    \/*\n     * Voltage Controlled Current Source\n     * (a.k.a. Transconductance)\n     *\/\n\n    \/\/ Arrange\n                              \/\/ (val)(a)(b)(c)(d)\n    Element transconductance(\"G1\", 10, 1, 2, 3, 4);\n    int numVariables = 4;\n\n    double matrix[MAX_NODES+1][MAX_NODES+2];\n    init(numVariables, matrix);\n\n    \/\/ Act\n    transconductance.applyStamp(matrix, numVariables);\n\n    \/\/ Assert\n    double expected[MAX_NODES+1][MAX_NODES+2] = {\n        {0, 0 , 0 ,   0 ,   0 , 0},\n        {0, 0 , 0 ,  10 , -10 , 0},\n        {0, 0 , 0 , -10 ,  10 , 0},\n        {0, 0 , 0 ,   0 ,   0 , 0},\n        {0, 0 , 0 ,   0 ,   0 , 0}\n    };\n    for (int i=1; i<=numVariables; i++) {\n        for (int j=1; j<=numVariables+1; j++) {\n            EXPECT_EQ(expected[i][j], matrix[i][j]);\n        }\n    }\n    print(numVariables, matrix);\n}\n\n\nTEST(ElementStampsTest, CurrentSource) {\n    \/\/ Arrange\n                           \/\/ (val)(a)(b)\n    Element currentSource(\"I1\", 10, 1, 2);\n    int numVariables = 2;\n\n    double matrix[MAX_NODES+1][MAX_NODES+2];\n    init(numVariables, matrix);\n\n    \/\/ Act\n    currentSource.applyStamp(matrix, numVariables);\n\n    \/\/ Assert\n    double expected[MAX_NODES+1][MAX_NODES+2] = {\n        {0, 0 , 0 ,  0},\n        {0, 0 , 0 , -10},\n        {0, 0 , 0 ,  10}\n    };\n    for (int i=1; i<=numVariables; i++) {\n        for (int j=1; j<=numVariables+1; j++) {\n            EXPECT_EQ(expected[i][j], matrix[i][j]);\n        }\n    }\n    print(numVariables, matrix);\n}\n\n\nTEST(ElementStampsTest, VoltageSource) {\n    \/\/ Arrange\n                           \/\/ (val)(a)(b)\n    Element voltageSource(\"V1\", 10, 1, 2);\n    int numVariables = 2;\n\n    double matrix[MAX_NODES+1][MAX_NODES+2];\n    \/\/ Bad smell about the need of this member function...\n    \/\/ Without it, only first part of matrix would be populated!\n    vector<string> dummyVariablesList(10);\n    voltageSource.addCurrentVariables(numVariables, dummyVariablesList);\n\n    \/\/ Important!!! Should be initialized after updating numVariables\n    \/\/ with extra current variables!\n    init(numVariables, matrix);\n\n    \/\/ Act\n    voltageSource.applyStamp(matrix, numVariables);\n\n    \/\/ Assert\n    double expected[MAX_NODES+1][MAX_NODES+2] = {\n        { 0,  0 , 0 ,  0 ,   0 },\n        { 0,  0 , 0 ,  1 ,   0 },\n        { 0,  0 , 0 , -1 ,   0 },\n        { 0, -1 , 1 ,  0 , -10 }\n    };\n    for (int i=1; i<=numVariables; i++) {\n        for (int j=1; j<=numVariables+1; j++) {\n            EXPECT_EQ(expected[i][j], matrix[i][j]);\n        }\n    }\n    print(numVariables, matrix);\n}\n\n\nTEST(ElementStampsTest, VCVS) {\n    \/*\n     * Voltage Controlled Voltage Source\n     * (a.k.a. Voltage Amplifier)\n     *\/\n    \/\/ Arrange\n                              \/\/ (val)(a)(b)(c)(d)\n    Element voltageAmplifier(\"E1\", 10, 1, 2, 3, 4);\n    int numVariables = 4;\n\n    double matrix[MAX_NODES+1][MAX_NODES+2];\n    \/\/ Bad smell about the need of this member function...\n    \/\/ Without it, only first part of matrix would be populated!\n    vector<string> dummyVariablesList(10);\n    voltageAmplifier.addCurrentVariables(numVariables, dummyVariablesList);\n\n    \/\/ Important!!! Should be initialized after updating numVariables\n    \/\/ with extra current variables!\n    init(numVariables, matrix);\n\n    \/\/ Act\n    voltageAmplifier.applyStamp(matrix, numVariables);\n\n    \/\/ Assert\n    double expected[MAX_NODES+1][MAX_NODES+2] = {\n       \/\/ 0    1    2   3     4   jx   i\n        { 0 ,  0 ,  0 , 0 ,   0 ,  0 , 0 },\n        { 0 ,  0 ,  0 , 0 ,   0 ,  1 , 0 },\n        { 0 ,  0 ,  0 , 0 ,   0 , -1 , 0 },\n        { 0 ,  0 ,  0 , 0 ,   0 ,  0 , 0 },\n        { 0 ,  0 ,  0 , 0 ,   0 ,  0 , 0 },\n        { 0 , -1 , +1, 10 , -10 ,  0 , 0 }\n    };\n    for (int i=1; i<=numVariables; i++) {\n        for (int j=1; j<=numVariables+1; j++) {\n            EXPECT_EQ(expected[i][j], matrix[i][j]);\n        }\n    }\n    print(numVariables, matrix);\n}\n\n\nTEST(ElementStampsTest, CCCS) {\n    \/*\n     * Current Controlled Current Source\n     * (a.k.a. Current Amplifier)\n     *\/\n    \/\/ Arrange\n                              \/\/ (val)(a)(b)(c)(d)\n    Element currentAmplifier(\"F1\", 10, 1, 2, 3, 4);\n    int numVariables = 4;\n\n    double matrix[MAX_NODES+1][MAX_NODES+2];\n    \/\/ Bad smell about the need of this member function...\n    \/\/ Without it, only first part of matrix would be populated!\n    vector<string> dummyVariablesList(10);\n    currentAmplifier.addCurrentVariables(numVariables, dummyVariablesList);\n\n    \/\/ Important!!! Should be initialized after updating numVariables\n    \/\/ with extra current variables!\n    init(numVariables, matrix);\n\n    \/\/ Act\n    currentAmplifier.applyStamp(matrix, numVariables);\n\n    \/\/ Assert\n    double expected[MAX_NODES+1][MAX_NODES+2] = {\n       \/\/ 0    1    2    3    4    jx   i\n        { 0 ,  0 ,  0 ,  0 ,  0 ,   0 , 0 },\n        { 0 ,  0 ,  0 ,  0 ,  0 ,  10 , 0 },\n        { 0 ,  0 ,  0 ,  0 ,  0 , -10 , 0 },\n        { 0 ,  0 ,  0 ,  0 ,  0 ,   1 , 0 },\n        { 0 ,  0 ,  0 ,  0 ,  0 ,  -1 , 0 },\n        { 0 ,  0 ,  0 , -1 ,  1 ,   0 , 0 }\n    };\n    for (int i=1; i<=numVariables; i++) {\n        for (int j=1; j<=numVariables+1; j++) {\n            EXPECT_EQ(expected[i][j], matrix[i][j]);\n        }\n    }\n    print(numVariables, matrix);\n}\n\n\nTEST(ElementStampsTest, CCVS) {\n    \/*\n     * Current Controlled Voltage Source\n     * (a.k.a. Transresistance)\n     *\/\n    \/\/ Arrange\n                             \/\/ (val)(a)(b)(c)(d)\n    Element transresistance(\"H1\", 10, 1, 2, 3, 4);\n    int numVariables = 4;\n\n    double matrix[MAX_NODES+1][MAX_NODES+2];\n    \/\/ Bad smell about the need of this member function...\n    \/\/ Without it, only first part of matrix would be populated!\n    vector<string> dummyVariablesList(10);\n    transresistance.addCurrentVariables(numVariables, dummyVariablesList);\n\n    \/\/ Important!!! Should be initialized after updating numVariables\n    \/\/ with extra current variables!\n    init(numVariables, matrix);\n\n    \/\/ Act\n    transresistance.applyStamp(matrix, numVariables);\n\n    \/\/ Assert\n    double expected[MAX_NODES+1][MAX_NODES+2] = {\n       \/\/ 0    1    2    3    4   jx   jy   i\n        { 0 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 , 0 },\n        { 0 ,  0 ,  0 ,  0 ,  0 ,  0 ,  1 , 0 },\n        { 0 ,  0 ,  0 ,  0 ,  0 ,  0 , -1 , 0 },\n        { 0 ,  0 ,  0 ,  0 ,  0 ,  1 ,  0 , 0 },\n        { 0 ,  0 ,  0 ,  0 ,  0 , -1 ,  0 , 0 },\n        { 0 ,  0 ,  0 , -1 ,  1 ,  0 ,  0 , 0 },\n        { 0 , -1 ,  1 ,  0 ,  0 , 10 ,  0 , 0 },\n    };\n    for (int i=1; i<=numVariables; i++) {\n        for (int j=1; j<=numVariables+1; j++) {\n            EXPECT_EQ(expected[i][j], matrix[i][j]);\n        }\n    }\n    print(numVariables, matrix);\n}\n\n\nTEST(ElementStampsTest, OpAmp) {\n    \/*\n     * Operational Amplifier\n     * (a.k.a. Op Amp)\n     *\/\n    \/\/ Arrange\n                    \/\/ (x)-> dont care!\n                    \/\/ (x)(a)(b)(c)(d)\n    Element opamp(\"O1\", 0, 1, 2, 3, 4);\n    int numVariables = 4;\n\n    double matrix[MAX_NODES+1][MAX_NODES+2];\n    \/\/ Bad smell about the need of this member function...\n    \/\/ Without it, only first part of matrix would be populated!\n    vector<string> dummyVariablesList(10);\n    opamp.addCurrentVariables(numVariables, dummyVariablesList);\n\n    \/\/ Important!!! Should be initialized after updating numVariables\n    \/\/ with extra current variables!\n    init(numVariables, matrix);\n\n    \/\/ Act\n    opamp.applyStamp(matrix, numVariables);\n\n    \/\/ Assert\n    double expected[MAX_NODES+1][MAX_NODES+2] = {\n       \/\/ 0    1    2    3    4   jx   i\n        { 0 ,  0 ,  0 ,  0 ,  0 ,  0 , 0 },\n        { 0 ,  0 ,  0 ,  0 ,  0 ,  1 , 0 },\n        { 0 ,  0 ,  0 ,  0 ,  0 , -1 , 0 },\n        { 0 ,  0 ,  0 ,  0 ,  0 ,  0 , 0 },\n        { 0 ,  0 ,  0 ,  0 ,  0 ,  0 , 0 },\n        { 0 ,  0 ,  0 ,  1 , -1 ,  0 , 0 },\n    };\n    for (int i=1; i<=numVariables; i++) {\n        for (int j=1; j<=numVariables+1; j++) {\n            EXPECT_EQ(expected[i][j], matrix[i][j]);\n        }\n    }\n    print(numVariables, matrix);\n}\n\n\nTEST(CircuitStampsTest, SimpleCircuit) {\n    \/\/ Arrange\n    int numNodes = 6;\n    int numElements = 9;\n    int numVariables = 9;\n    double matrix[MAX_NODES+1][MAX_NODES+2];\n    vector<Element> netlist(MAX_ELEMS);\n    \/\/ From netlist data\/simples.net\n    \/\/ Changes order (not netlist parameters order)! Value first!\n                     \/\/ ( name, val, a, b, ... )\n    netlist[1] = Element(\"R0102\", 1, 1, 2);\n    netlist[2] = Element(\"R0301\", 1, 3, 1);\n    netlist[3] = Element(\"R0403\", 1, 4, 3);\n    netlist[4] = Element(\"R0004\", 1, 0, 4);\n    netlist[5] = Element(\"R0502\", 1, 5, 2);\n    netlist[6] = Element(\"R0605\", 1, 6, 5);\n    netlist[7] = Element(\"O0300\", 0, 3, 0, 1, 0); \/\/ OpAmps have no value!!!\n    netlist[8] = Element(\"O0600\", 0, 6, 0, 5, 4);\n    netlist[9] = Element(\"V0200\", 1, 2, 0);\n    \/\/ Bad smell about the need of this member function...\n    \/\/ Without it, only first part of matrix would be populated!\n    vector<string> dummyVariablesList(10);\n    int pivotNumVariables = numNodes;\n    netlist[7].addCurrentVariables(pivotNumVariables, dummyVariablesList);\n    netlist[8].addCurrentVariables(pivotNumVariables, dummyVariablesList);\n    netlist[9].addCurrentVariables(pivotNumVariables, dummyVariablesList);\n\n    Circuit circuit(\n        numElements,\n        numNodes,\n        numVariables,\n        netlist\n    );\n    init(circuit.getNumVariables(), matrix);\n\n    \/\/ Act\n    circuit.applyStamps(matrix);\n\n    \/\/ Assert\n    double expected[MAX_NODES+1][MAX_NODES+2] = {\n        {  0 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 },\n        {  0 ,  2 , -1 , -1 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 },\n        {  0 , -1 ,  2 ,  0 ,  0 , -1 ,  0 ,  0 ,  0 ,  1 ,  0 },\n        {  0 , -1 ,  0 ,  2 , -1 ,  0 ,  0 ,  1 ,  0 ,  0 ,  0 },\n        {  0 ,  0 ,  0 , -1 ,  2 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 },\n        {  0 ,  0 , -1 ,  0 ,  0 ,  2 , -1 ,  0 ,  0 ,  0 ,  0 },\n        {  0 ,  0 ,  0 ,  0 ,  0 , -1 ,  1 ,  0 ,  1 ,  0 ,  0 },\n        {  0 ,  1 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 },\n        {  0 ,  0 ,  0 ,  0 , -1 ,  1 ,  0 ,  0 ,  0 ,  0 ,  0 },\n        {  0 ,  0 , -1 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 ,  0 , -1 },\n    };\n    for (int i=1; i<=circuit.getNumVariables(); i++) {\n        for (int j=1; j<=circuit.getNumVariables()+1; j++) {\n            EXPECT_EQ(expected[i][j], matrix[i][j]);\n        }\n    }\n    print(numVariables, matrix);\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2015.  All rights reserved\n *\/\n#include    \"..\/StroikaPreComp.h\"\n\n#include    \"..\/Characters\/Character.h\"\n#include    \"..\/Characters\/String.h\"\n#include    \"..\/Characters\/StringBuilder.h\"\n\n#include    \"InputStream.h\"\n\n\n\nusing   namespace   Stroika::Foundation;\nusing   namespace   Stroika::Foundation::Streams;\n\n\nusing   Characters::Character;\nusing   Characters::String;\nusing   Memory::BLOB;\nusing   Memory::Byte;\n\n\n\n\n\n\/*\n ********************************************************************************\n ************************* Streams::InputStream<ELEMENT_TYPE> *******************\n ********************************************************************************\n *\/\ntemplate    <>\ntemplate    <>\nString InputStream<Character>::ReadLine () const\n{\n    Require (IsSeekable ());\n    String      result;\n    while (true) {\n        Character   c   =   ReadCharacter ();\n        if (c.GetCharacterCode () == '\\0') {\n            \/\/ EOF\n            return result;\n        }\n        result.push_back (c);\n        if (c == '\\n') {\n            return result;\n        }\n        else if (c == '\\r') {\n            Character   c   =   ReadCharacter ();\n            \/\/ if CR is follwed by LF, append that to result too before returning. Otherwise, put the character back\n            if (c == '\\n') {\n                result.push_back (c);\n                return result;\n            }\n            else {\n                Seek (Whence::eFromCurrent, -1);\n            }\n            return result;\n        }\n    }\n}\n\n\ntemplate    <>\ntemplate    <>\nCharacters::Character   InputStream<Characters::Character>::ReadCharacter () const\n{\n    Characters::Character   c;\n    if (Read (&c, &c + 1) == 1) {\n        return c;\n    }\n    return '\\0';\n}\n\n\ntemplate    <>\ntemplate    <>\nTraversal::Iterable<String> InputStream<Character>::ReadLines () const\n{\n    InputStream<Character> copyOfStream =  *this;\n    return Traversal::CreateGenerator<String> ([copyOfStream] () -> Memory::Optional<String> {\n        String  line = copyOfStream.ReadLine ();\n        if (line.empty ())\n        {\n            return Memory::Optional<String> ();\n        }\n        else {\n            return line;\n        }\n    });\n}\n\n\ntemplate    <>\ntemplate    <>\nString InputStream<Character>::ReadAll () const\n{\n    Characters::StringBuilder result;\n    while (true) {\n        Character buf[16 * 1024];\n        size_t n = Read (std::begin (buf), std::end (buf));\n        Assert (0 <= n and n <= NEltsOf (buf));\n        if (n == 0) {\n            break;\n        }\n        else {\n            result.Append (std::begin (buf), std::begin (buf) + n);\n        }\n    }\n    return result.str ();\n}\n\n\ntemplate    <>\ntemplate    <>\nMemory::BLOB InputStream<Byte>::ReadAll () const\n{\n    if (this->IsSeekable ()) {\n        SeekOffsetType  size = this->GetOffsetToEndOfStream ();\n        if (size >= numeric_limits<size_t>::max ()) {\n            Execution::DoThrow<bad_alloc> (bad_alloc ());\n        }\n        size_t sb = static_cast<size_t> (size);\n        if (sb == 0) {\n            return BLOB ();\n        }\n        Byte* b = new Byte[sb];   \/\/ if this fails, we had no way to create the BLOB\n        size_t n = this->Read (b, b + sb);\n        Assert (n <= sb);\n        return BLOB::Attach (b, b + n);\n    }\n    else {\n        \/\/ Less efficient implementation\n        vector<Byte>    r;\n        size_t          n;\n        Byte            buf[32 * 1024];\n        while ( (n = this->Read (std::begin (buf), std::end (buf))) != 0) {\n            r.insert (r.end (), std::begin (buf), std::begin (buf) + n);\n        }\n        return BLOB (r);\n    }\n}\n<commit_msg>InputStream<Character>::ReadLine () performance tweak - use StringBuilder<commit_after>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2015.  All rights reserved\n *\/\n#include    \"..\/StroikaPreComp.h\"\n\n#include    \"..\/Characters\/Character.h\"\n#include    \"..\/Characters\/String.h\"\n#include    \"..\/Characters\/StringBuilder.h\"\n\n#include    \"InputStream.h\"\n\n\n\nusing   namespace   Stroika::Foundation;\nusing   namespace   Stroika::Foundation::Streams;\n\n\nusing   Characters::Character;\nusing   Characters::String;\nusing   Characters::StringBuilder;\nusing   Memory::BLOB;\nusing   Memory::Byte;\n\n\n\n\n\n\/*\n ********************************************************************************\n ************************* Streams::InputStream<ELEMENT_TYPE> *******************\n ********************************************************************************\n *\/\ntemplate    <>\ntemplate    <>\nString InputStream<Character>::ReadLine () const\n{\n    Require (IsSeekable ());\n    StringBuilder\tresult;\n    while (true) {\n        Character   c   =   ReadCharacter ();\n        if (c.GetCharacterCode () == '\\0') {\n            \/\/ EOF\n            return result.str ();\n        }\n        result.push_back (c);\n        if (c == '\\n') {\n            return result.str ();\n        }\n        else if (c == '\\r') {\n            Character   c   =   ReadCharacter ();\n            \/\/ if CR is follwed by LF, append that to result too before returning. Otherwise, put the character back\n            if (c == '\\n') {\n                result.push_back (c);\n                return result.str ();\n            }\n            else {\n                Seek (Whence::eFromCurrent, -1);\n            }\n            return result.str ();\n        }\n    }\n}\n\n\ntemplate    <>\ntemplate    <>\nCharacters::Character   InputStream<Characters::Character>::ReadCharacter () const\n{\n    Characters::Character   c;\n    if (Read (&c, &c + 1) == 1) {\n        return c;\n    }\n    return '\\0';\n}\n\n\ntemplate    <>\ntemplate    <>\nTraversal::Iterable<String> InputStream<Character>::ReadLines () const\n{\n    InputStream<Character> copyOfStream =  *this;\n    return Traversal::CreateGenerator<String> ([copyOfStream] () -> Memory::Optional<String> {\n        String  line = copyOfStream.ReadLine ();\n        if (line.empty ())\n        {\n            return Memory::Optional<String> ();\n        }\n        else {\n            return line;\n        }\n    });\n}\n\n\ntemplate    <>\ntemplate    <>\nString InputStream<Character>::ReadAll () const\n{\n    Characters::StringBuilder result;\n    while (true) {\n        Character buf[16 * 1024];\n        size_t n = Read (std::begin (buf), std::end (buf));\n        Assert (0 <= n and n <= NEltsOf (buf));\n        if (n == 0) {\n            break;\n        }\n        else {\n            result.Append (std::begin (buf), std::begin (buf) + n);\n        }\n    }\n    return result.str ();\n}\n\n\ntemplate    <>\ntemplate    <>\nMemory::BLOB InputStream<Byte>::ReadAll () const\n{\n    if (this->IsSeekable ()) {\n        SeekOffsetType  size = this->GetOffsetToEndOfStream ();\n        if (size >= numeric_limits<size_t>::max ()) {\n            Execution::DoThrow<bad_alloc> (bad_alloc ());\n        }\n        size_t sb = static_cast<size_t> (size);\n        if (sb == 0) {\n            return BLOB ();\n        }\n        Byte* b = new Byte[sb];   \/\/ if this fails, we had no way to create the BLOB\n        size_t n = this->Read (b, b + sb);\n        Assert (n <= sb);\n        return BLOB::Attach (b, b + n);\n    }\n    else {\n        \/\/ Less efficient implementation\n        vector<Byte>    r;\n        size_t          n;\n        Byte            buf[32 * 1024];\n        while ( (n = this->Read (std::begin (buf), std::end (buf))) != 0) {\n            r.insert (r.end (), std::begin (buf), std::begin (buf) + n);\n        }\n        return BLOB (r);\n    }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n *  This file is part of Poedit (http:\/\/poedit.net)\n *\n *  Copyright (C) 2000-2014 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 <wx\/sizer.h>\n#include <wx\/statline.h>\n#include <wx\/combobox.h>\n#include <wx\/radiobut.h>\n#include <wx\/textctrl.h>\n#include <wx\/editlbox.h>\n#include <wx\/xrc\/xmlres.h>\n#include <wx\/intl.h>\n#include <wx\/config.h>\n#include <wx\/tokenzr.h>\n#include <wx\/stattext.h>\n#include <wx\/notebook.h>\n\n#include <memory>\n\n#include \"propertiesdlg.h\"\n#include \"language.h\"\n#include \"pluralforms\/pl_evaluate.h\"\n\n\nPropertiesDialog::PropertiesDialog(wxWindow *parent, bool fileExistsOnDisk, int initialPage)\n    : m_validatedPlural(-1), m_validatedLang(-1)\n{\n    wxXmlResource::Get()->LoadDialog(this, parent, \"properties\");\n\n    m_team = XRCCTRL(*this, \"team_name\", wxTextCtrl);\n    m_teamEmail = XRCCTRL(*this, \"team_email\", wxTextCtrl);\n    m_project = XRCCTRL(*this, \"prj_name\", wxTextCtrl);\n    m_language = XRCCTRL(*this, \"language\", LanguageCtrl);\n    m_charset = XRCCTRL(*this, \"charset\", wxComboBox);\n    m_basePath = XRCCTRL(*this, \"basepath\", wxTextCtrl);\n    m_sourceCodeCharset = XRCCTRL(*this, \"source_code_charset\", wxComboBox);\n\n    m_pluralFormsDefault = XRCCTRL(*this, \"plural_forms_default\", wxRadioButton);\n    m_pluralFormsCustom = XRCCTRL(*this, \"plural_forms_custom\", wxRadioButton);\n    m_pluralFormsExpr = XRCCTRL(*this, \"plural_forms_expr\", wxTextCtrl);\n    m_pluralFormsExpr->SetWindowVariant(wxWINDOW_VARIANT_SMALL);\n\n    \/\/ my custom controls:\n    m_keywords = new wxEditableListBox(this, -1, _(\"Additional keywords\"));\n    m_paths = new wxEditableListBox(this, -1, _(\"Paths\"));\n    m_excludedPaths = new wxEditableListBox(this, -1, _(\"Excluded paths\"));\n\n    m_paths->SetMinSize(wxSize(-1, 90));\n    m_excludedPaths->SetMinSize(wxSize(-1, 90));\n\n#ifdef __WXOSX__\n    for (auto l: {m_keywords, m_paths, m_excludedPaths})\n    {\n        for (auto c: l->GetChildren())\n        {\n            c->SetWindowVariant(wxWINDOW_VARIANT_SMALL);\n            for (auto c2: c->GetChildren())\n                c2->SetWindowVariant(wxWINDOW_VARIANT_SMALL);\n        }\n    }\n#endif \/\/ __WXOSX__\n\n    wxXmlResource::Get()->AttachUnknownControl(\"keywords\", m_keywords);\n    wxXmlResource::Get()->AttachUnknownControl(\"paths\", m_paths);\n    wxXmlResource::Get()->AttachUnknownControl(\"excluded_paths\", m_excludedPaths);\n\n    \/\/ Controls setup:\n    m_project->SetHint(_(\"Name of the project the translation is for\"));\n    m_pluralFormsExpr->SetHint(_(\"e.g. nplurals=2; plural=(n > 1);\"));\n\n    Layout();\n    GetSizer()->SetSizeHints(this);\n\n    if (!fileExistsOnDisk)\n        DisableSourcesControls();\n\n    auto nb = XRCCTRL(*this, \"properties_notebook\", wxNotebook);\n    nb->SetSelection(initialPage);\n\n    m_language->Bind(wxEVT_TEXT, &PropertiesDialog::OnLanguageChanged, this);\n    m_language->Bind(wxEVT_COMBOBOX, &PropertiesDialog::OnLanguageChanged, this);\n\n    m_pluralFormsDefault->Bind(wxEVT_RADIOBUTTON, &PropertiesDialog::OnPluralFormsDefault, this);\n    m_pluralFormsCustom->Bind(wxEVT_RADIOBUTTON, &PropertiesDialog::OnPluralFormsCustom, this);\n    m_pluralFormsExpr->Bind(\n        wxEVT_UPDATE_UI,\n        [=](wxUpdateUIEvent& e){ e.Enable(m_pluralFormsCustom->GetValue()); });\n    m_pluralFormsExpr->Bind(\n        wxEVT_TEXT,\n        [=](wxCommandEvent& e){ m_validatedPlural = -1; e.Skip(); });\n    Bind(wxEVT_UPDATE_UI,\n        [=](wxUpdateUIEvent& e){ e.Enable(Validate()); },\n        wxID_OK);\n    CallAfter([=]{\n        m_project->SetFocus();\n    });\n}\n\n\nnamespace\n{\n\n#define UTF_8_CHARSET  _(\"UTF-8 (recommended)\")\n\nvoid SetCharsetToCombobox(wxComboBox *ctrl, const wxString& value)\n{\n    static const wxString all_charsets[] =\n        {\n        UTF_8_CHARSET,\n        \/\/ and legacy ones\n        \"iso-8859-1\",\n        \"iso-8859-2\",\n        \"iso-8859-3\",\n        \"iso-8859-4\",\n        \"iso-8859-5\",\n        \"iso-8859-6\",\n        \"iso-8859-7\",\n        \"iso-8859-8\",\n        \"iso-8859-9\",\n        \"iso-8859-10\",\n        \"iso-8859-11\",\n        \"iso-8859-12\",\n        \"iso-8859-13\",\n        \"iso-8859-14\",\n        \"iso-8859-15\",\n        \"koi8-r\",\n        \"windows-1250\",\n        \"windows-1251\",\n        \"windows-1252\",\n        \"windows-1253\",\n        \"windows-1254\",\n        \"windows-1255\",\n        \"windows-1256\",\n        \"windows-1257\"\n        };\n\n    ctrl->Clear();\n    for ( int i = 0; i < (int)WXSIZEOF(all_charsets); i++ )\n        ctrl->Append(all_charsets[i]);\n\n    const wxString low = value.Lower();\n    if ( low == \"utf-8\" || low == \"utf8\" )\n        ctrl->SetValue(UTF_8_CHARSET);\n    else\n        ctrl->SetValue(value);\n}\n\nwxString GetCharsetFromCombobox(wxComboBox *ctrl)\n{\n    wxString c = ctrl->GetValue();\n    if ( c == UTF_8_CHARSET )\n        c = \"UTF-8\";\n    return c;\n}\n\nvoid GetStringsFromControl(wxEditableListBox *box, wxArrayString& output)\n{\n    wxArrayString arr;\n    box->GetStrings(arr);\n\n    output.clear();\n    for (auto x: arr)\n    {\n        if (!x.empty())\n            output.push_back(x);\n    }\n}\n\nvoid GetPathsFromControl(wxEditableListBox *box, wxArrayString& output)\n{\n    wxArrayString arr;\n    box->GetStrings(arr);\n\n    output.clear();\n    for (auto x: arr)\n    {\n        if (!x.empty() && (x.Last() == '\/' || x.Last() == '\\\\'))\n            x.RemoveLast();\n        if (!x.empty())\n            output.push_back(x);\n    }\n}\n\n} \/\/ anonymous namespace\n\n\nvoid PropertiesDialog::TransferTo(Catalog *cat)\n{\n    SetCharsetToCombobox(m_charset, cat->Header().Charset);\n    SetCharsetToCombobox(m_sourceCodeCharset, cat->Header().SourceCodeCharset);\n\n    #define SET_VAL(what,what2) m_##what2->SetValue(cat->Header().what)\n    SET_VAL(Team, team);\n    SET_VAL(TeamEmail, teamEmail);\n    SET_VAL(Project, project);\n    SET_VAL(BasePath, basePath);\n    #undef SET_VAL\n\n    m_language->SetLang(cat->Header().Lang);\n    OnLanguageValueChanged(m_language->GetValue());\n\n    wxString pf_def = cat->Header().Lang.DefaultPluralFormsExpr();\n    wxString pf_cat = cat->Header().GetHeader(\"Plural-Forms\");\n    if (pf_cat == \"nplurals=INTEGER; plural=EXPRESSION;\")\n        pf_cat = pf_def;\n\n    m_pluralFormsExpr->SetValue(pf_cat);\n    if (!pf_cat.empty() && pf_cat == pf_def)\n        m_pluralFormsDefault->SetValue(true);\n    else\n        m_pluralFormsCustom->SetValue(true);\n\n    m_paths->SetStrings(cat->Header().SearchPaths);\n    m_excludedPaths->SetStrings(cat->Header().SearchPathsExcluded);\n    m_keywords->SetStrings(cat->Header().Keywords);\n}\n\n\nvoid PropertiesDialog::TransferFrom(Catalog *cat)\n{\n    cat->Header().Charset = GetCharsetFromCombobox(m_charset);\n    cat->Header().SourceCodeCharset = GetCharsetFromCombobox(m_sourceCodeCharset);\n\n    #define GET_VAL(what,what2) cat->Header().what = m_##what2->GetValue()\n    GET_VAL(Team, team);\n    GET_VAL(TeamEmail, teamEmail);\n    GET_VAL(Project, project);\n    GET_VAL(BasePath, basePath);\n    #undef GET_VAL\n\n    Language lang = m_language->GetLang();\n    if (lang.IsValid())\n        cat->Header().Lang = lang;\n\n    GetStringsFromControl(m_keywords, cat->Header().Keywords);\n    GetPathsFromControl(m_paths, cat->Header().SearchPaths);\n    GetPathsFromControl(m_excludedPaths, cat->Header().SearchPathsExcluded);\n\n    if (!cat->Header().SearchPaths.empty() && cat->Header().BasePath.empty())\n        cat->Header().BasePath = \".\";\n\n    m_keywords->GetStrings(cat->Header().Keywords);\n\n    wxString pluralForms;\n    if (m_pluralFormsDefault->GetValue() && cat->Header().Lang.IsValid())\n    {\n        pluralForms = cat->Header().Lang.DefaultPluralFormsExpr();\n    }\n\n    if (pluralForms.empty())\n    {\n        pluralForms = m_pluralFormsExpr->GetValue().Strip(wxString::both);\n        if ( !pluralForms.empty() && !pluralForms.EndsWith(\";\") )\n            pluralForms += \";\";\n    }\n    cat->Header().SetHeaderNotEmpty(\"Plural-Forms\", pluralForms);\n}\n\n\nvoid PropertiesDialog::DisableSourcesControls()\n{\n    m_basePath->Disable();\n    for (auto p: {m_paths, m_excludedPaths})\n    {\n        p->Disable();\n        for (auto c: p->GetChildren())\n            c->Disable();\n    }\n\n    auto label = XRCCTRL(*this, \"sources_path_label\", wxStaticText);\n    label->SetLabel(_(\"Please save the file first. This section cannot be edited until then.\"));\n    label->SetForegroundColour(*wxRED);\n}\n\n\nvoid PropertiesDialog::OnLanguageChanged(wxCommandEvent& event)\n{\n    m_validatedLang = -1;\n    OnLanguageValueChanged(event.GetString());\n    event.Skip();\n}\n\nvoid PropertiesDialog::OnLanguageValueChanged(const wxString& langstr)\n{\n    Language lang = Language::TryParse(langstr.ToStdWstring());\n    wxString pluralForm = lang.DefaultPluralFormsExpr();\n    if (pluralForm.empty())\n    {\n        m_pluralFormsDefault->Disable();\n        m_pluralFormsCustom->SetValue(true);\n    }\n    else\n    {\n        m_pluralFormsDefault->Enable();\n        if (m_pluralFormsExpr->GetValue().empty() ||\n            m_pluralFormsExpr->GetValue() == pluralForm)\n        {\n            m_pluralFormsDefault->SetValue(true);\n        }\n    }\n}\n\nvoid PropertiesDialog::OnPluralFormsDefault(wxCommandEvent& event)\n{\n    m_rememberedPluralForm = m_pluralFormsExpr->GetValue();\n\n    Language lang = m_language->GetLang();\n    if (lang.IsValid())\n    {\n        wxString defaultForm = lang.DefaultPluralFormsExpr();\n        if (!defaultForm.empty())\n            m_pluralFormsExpr->SetValue(defaultForm);\n    }\n\n    event.Skip();\n}\n\nvoid PropertiesDialog::OnPluralFormsCustom(wxCommandEvent& event)\n{\n    if (!m_rememberedPluralForm.empty())\n        m_pluralFormsExpr->SetValue(m_rememberedPluralForm);\n\n    event.Skip();\n}\n\n\nbool PropertiesDialog::Validate()\n{\n    if (m_validatedPlural == -1)\n    {\n        m_validatedPlural = 1;\n        if (m_pluralFormsCustom->GetValue())\n        {\n            wxString form = m_pluralFormsExpr->GetValue();\n            if (!form.empty())\n            {\n                std::unique_ptr<PluralFormsCalculator> calc(PluralFormsCalculator::make(form.ToAscii()));\n                if (!calc)\n                    m_validatedPlural = 0;\n            }\n        }\n    }\n\n    if (m_validatedLang == -1)\n    {\n        m_validatedLang = m_language->IsValid() ? 1 : 0;\n    }\n\n    return m_validatedLang == 1 &&\n           m_validatedPlural == 1 &&\n           !m_project->GetValue().empty();\n}\n<commit_msg>Fix ugly look of plural forms expr field on Windows.<commit_after>\/*\n *  This file is part of Poedit (http:\/\/poedit.net)\n *\n *  Copyright (C) 2000-2014 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 <wx\/sizer.h>\n#include <wx\/statline.h>\n#include <wx\/combobox.h>\n#include <wx\/radiobut.h>\n#include <wx\/textctrl.h>\n#include <wx\/editlbox.h>\n#include <wx\/xrc\/xmlres.h>\n#include <wx\/intl.h>\n#include <wx\/config.h>\n#include <wx\/tokenzr.h>\n#include <wx\/stattext.h>\n#include <wx\/notebook.h>\n\n#include <memory>\n\n#include \"propertiesdlg.h\"\n#include \"language.h\"\n#include \"pluralforms\/pl_evaluate.h\"\n\n\nPropertiesDialog::PropertiesDialog(wxWindow *parent, bool fileExistsOnDisk, int initialPage)\n    : m_validatedPlural(-1), m_validatedLang(-1)\n{\n    wxXmlResource::Get()->LoadDialog(this, parent, \"properties\");\n\n    m_team = XRCCTRL(*this, \"team_name\", wxTextCtrl);\n    m_teamEmail = XRCCTRL(*this, \"team_email\", wxTextCtrl);\n    m_project = XRCCTRL(*this, \"prj_name\", wxTextCtrl);\n    m_language = XRCCTRL(*this, \"language\", LanguageCtrl);\n    m_charset = XRCCTRL(*this, \"charset\", wxComboBox);\n    m_basePath = XRCCTRL(*this, \"basepath\", wxTextCtrl);\n    m_sourceCodeCharset = XRCCTRL(*this, \"source_code_charset\", wxComboBox);\n\n    m_pluralFormsDefault = XRCCTRL(*this, \"plural_forms_default\", wxRadioButton);\n    m_pluralFormsCustom = XRCCTRL(*this, \"plural_forms_custom\", wxRadioButton);\n    m_pluralFormsExpr = XRCCTRL(*this, \"plural_forms_expr\", wxTextCtrl);\n#if defined(__WXMSW__) && !wxCHECK_VERSION(3,1,0)\n    m_pluralFormsExpr->SetFont(m_pluralFormsExpr->GetFont().Smaller());\n#else\n    m_pluralFormsExpr->SetWindowVariant(wxWINDOW_VARIANT_SMALL);\n#endif\n\n    \/\/ my custom controls:\n    m_keywords = new wxEditableListBox(this, -1, _(\"Additional keywords\"));\n    m_paths = new wxEditableListBox(this, -1, _(\"Paths\"));\n    m_excludedPaths = new wxEditableListBox(this, -1, _(\"Excluded paths\"));\n\n    m_paths->SetMinSize(wxSize(-1, 90));\n    m_excludedPaths->SetMinSize(wxSize(-1, 90));\n\n#ifdef __WXOSX__\n    for (auto l: {m_keywords, m_paths, m_excludedPaths})\n    {\n        for (auto c: l->GetChildren())\n        {\n            c->SetWindowVariant(wxWINDOW_VARIANT_SMALL);\n            for (auto c2: c->GetChildren())\n                c2->SetWindowVariant(wxWINDOW_VARIANT_SMALL);\n        }\n    }\n#endif \/\/ __WXOSX__\n\n    wxXmlResource::Get()->AttachUnknownControl(\"keywords\", m_keywords);\n    wxXmlResource::Get()->AttachUnknownControl(\"paths\", m_paths);\n    wxXmlResource::Get()->AttachUnknownControl(\"excluded_paths\", m_excludedPaths);\n\n    \/\/ Controls setup:\n    m_project->SetHint(_(\"Name of the project the translation is for\"));\n    m_pluralFormsExpr->SetHint(_(\"e.g. nplurals=2; plural=(n > 1);\"));\n\n    Layout();\n    GetSizer()->SetSizeHints(this);\n\n    if (!fileExistsOnDisk)\n        DisableSourcesControls();\n\n    auto nb = XRCCTRL(*this, \"properties_notebook\", wxNotebook);\n    nb->SetSelection(initialPage);\n\n    m_language->Bind(wxEVT_TEXT, &PropertiesDialog::OnLanguageChanged, this);\n    m_language->Bind(wxEVT_COMBOBOX, &PropertiesDialog::OnLanguageChanged, this);\n\n    m_pluralFormsDefault->Bind(wxEVT_RADIOBUTTON, &PropertiesDialog::OnPluralFormsDefault, this);\n    m_pluralFormsCustom->Bind(wxEVT_RADIOBUTTON, &PropertiesDialog::OnPluralFormsCustom, this);\n    m_pluralFormsExpr->Bind(\n        wxEVT_UPDATE_UI,\n        [=](wxUpdateUIEvent& e){ e.Enable(m_pluralFormsCustom->GetValue()); });\n    m_pluralFormsExpr->Bind(\n        wxEVT_TEXT,\n        [=](wxCommandEvent& e){ m_validatedPlural = -1; e.Skip(); });\n    Bind(wxEVT_UPDATE_UI,\n        [=](wxUpdateUIEvent& e){ e.Enable(Validate()); },\n        wxID_OK);\n    CallAfter([=]{\n        m_project->SetFocus();\n    });\n}\n\n\nnamespace\n{\n\n#define UTF_8_CHARSET  _(\"UTF-8 (recommended)\")\n\nvoid SetCharsetToCombobox(wxComboBox *ctrl, const wxString& value)\n{\n    static const wxString all_charsets[] =\n        {\n        UTF_8_CHARSET,\n        \/\/ and legacy ones\n        \"iso-8859-1\",\n        \"iso-8859-2\",\n        \"iso-8859-3\",\n        \"iso-8859-4\",\n        \"iso-8859-5\",\n        \"iso-8859-6\",\n        \"iso-8859-7\",\n        \"iso-8859-8\",\n        \"iso-8859-9\",\n        \"iso-8859-10\",\n        \"iso-8859-11\",\n        \"iso-8859-12\",\n        \"iso-8859-13\",\n        \"iso-8859-14\",\n        \"iso-8859-15\",\n        \"koi8-r\",\n        \"windows-1250\",\n        \"windows-1251\",\n        \"windows-1252\",\n        \"windows-1253\",\n        \"windows-1254\",\n        \"windows-1255\",\n        \"windows-1256\",\n        \"windows-1257\"\n        };\n\n    ctrl->Clear();\n    for ( int i = 0; i < (int)WXSIZEOF(all_charsets); i++ )\n        ctrl->Append(all_charsets[i]);\n\n    const wxString low = value.Lower();\n    if ( low == \"utf-8\" || low == \"utf8\" )\n        ctrl->SetValue(UTF_8_CHARSET);\n    else\n        ctrl->SetValue(value);\n}\n\nwxString GetCharsetFromCombobox(wxComboBox *ctrl)\n{\n    wxString c = ctrl->GetValue();\n    if ( c == UTF_8_CHARSET )\n        c = \"UTF-8\";\n    return c;\n}\n\nvoid GetStringsFromControl(wxEditableListBox *box, wxArrayString& output)\n{\n    wxArrayString arr;\n    box->GetStrings(arr);\n\n    output.clear();\n    for (auto x: arr)\n    {\n        if (!x.empty())\n            output.push_back(x);\n    }\n}\n\nvoid GetPathsFromControl(wxEditableListBox *box, wxArrayString& output)\n{\n    wxArrayString arr;\n    box->GetStrings(arr);\n\n    output.clear();\n    for (auto x: arr)\n    {\n        if (!x.empty() && (x.Last() == '\/' || x.Last() == '\\\\'))\n            x.RemoveLast();\n        if (!x.empty())\n            output.push_back(x);\n    }\n}\n\n} \/\/ anonymous namespace\n\n\nvoid PropertiesDialog::TransferTo(Catalog *cat)\n{\n    SetCharsetToCombobox(m_charset, cat->Header().Charset);\n    SetCharsetToCombobox(m_sourceCodeCharset, cat->Header().SourceCodeCharset);\n\n    #define SET_VAL(what,what2) m_##what2->SetValue(cat->Header().what)\n    SET_VAL(Team, team);\n    SET_VAL(TeamEmail, teamEmail);\n    SET_VAL(Project, project);\n    SET_VAL(BasePath, basePath);\n    #undef SET_VAL\n\n    m_language->SetLang(cat->Header().Lang);\n    OnLanguageValueChanged(m_language->GetValue());\n\n    wxString pf_def = cat->Header().Lang.DefaultPluralFormsExpr();\n    wxString pf_cat = cat->Header().GetHeader(\"Plural-Forms\");\n    if (pf_cat == \"nplurals=INTEGER; plural=EXPRESSION;\")\n        pf_cat = pf_def;\n\n    m_pluralFormsExpr->SetValue(pf_cat);\n    if (!pf_cat.empty() && pf_cat == pf_def)\n        m_pluralFormsDefault->SetValue(true);\n    else\n        m_pluralFormsCustom->SetValue(true);\n\n    m_paths->SetStrings(cat->Header().SearchPaths);\n    m_excludedPaths->SetStrings(cat->Header().SearchPathsExcluded);\n    m_keywords->SetStrings(cat->Header().Keywords);\n}\n\n\nvoid PropertiesDialog::TransferFrom(Catalog *cat)\n{\n    cat->Header().Charset = GetCharsetFromCombobox(m_charset);\n    cat->Header().SourceCodeCharset = GetCharsetFromCombobox(m_sourceCodeCharset);\n\n    #define GET_VAL(what,what2) cat->Header().what = m_##what2->GetValue()\n    GET_VAL(Team, team);\n    GET_VAL(TeamEmail, teamEmail);\n    GET_VAL(Project, project);\n    GET_VAL(BasePath, basePath);\n    #undef GET_VAL\n\n    Language lang = m_language->GetLang();\n    if (lang.IsValid())\n        cat->Header().Lang = lang;\n\n    GetStringsFromControl(m_keywords, cat->Header().Keywords);\n    GetPathsFromControl(m_paths, cat->Header().SearchPaths);\n    GetPathsFromControl(m_excludedPaths, cat->Header().SearchPathsExcluded);\n\n    if (!cat->Header().SearchPaths.empty() && cat->Header().BasePath.empty())\n        cat->Header().BasePath = \".\";\n\n    m_keywords->GetStrings(cat->Header().Keywords);\n\n    wxString pluralForms;\n    if (m_pluralFormsDefault->GetValue() && cat->Header().Lang.IsValid())\n    {\n        pluralForms = cat->Header().Lang.DefaultPluralFormsExpr();\n    }\n\n    if (pluralForms.empty())\n    {\n        pluralForms = m_pluralFormsExpr->GetValue().Strip(wxString::both);\n        if ( !pluralForms.empty() && !pluralForms.EndsWith(\";\") )\n            pluralForms += \";\";\n    }\n    cat->Header().SetHeaderNotEmpty(\"Plural-Forms\", pluralForms);\n}\n\n\nvoid PropertiesDialog::DisableSourcesControls()\n{\n    m_basePath->Disable();\n    for (auto p: {m_paths, m_excludedPaths})\n    {\n        p->Disable();\n        for (auto c: p->GetChildren())\n            c->Disable();\n    }\n\n    auto label = XRCCTRL(*this, \"sources_path_label\", wxStaticText);\n    label->SetLabel(_(\"Please save the file first. This section cannot be edited until then.\"));\n    label->SetForegroundColour(*wxRED);\n}\n\n\nvoid PropertiesDialog::OnLanguageChanged(wxCommandEvent& event)\n{\n    m_validatedLang = -1;\n    OnLanguageValueChanged(event.GetString());\n    event.Skip();\n}\n\nvoid PropertiesDialog::OnLanguageValueChanged(const wxString& langstr)\n{\n    Language lang = Language::TryParse(langstr.ToStdWstring());\n    wxString pluralForm = lang.DefaultPluralFormsExpr();\n    if (pluralForm.empty())\n    {\n        m_pluralFormsDefault->Disable();\n        m_pluralFormsCustom->SetValue(true);\n    }\n    else\n    {\n        m_pluralFormsDefault->Enable();\n        if (m_pluralFormsExpr->GetValue().empty() ||\n            m_pluralFormsExpr->GetValue() == pluralForm)\n        {\n            m_pluralFormsDefault->SetValue(true);\n        }\n    }\n}\n\nvoid PropertiesDialog::OnPluralFormsDefault(wxCommandEvent& event)\n{\n    m_rememberedPluralForm = m_pluralFormsExpr->GetValue();\n\n    Language lang = m_language->GetLang();\n    if (lang.IsValid())\n    {\n        wxString defaultForm = lang.DefaultPluralFormsExpr();\n        if (!defaultForm.empty())\n            m_pluralFormsExpr->SetValue(defaultForm);\n    }\n\n    event.Skip();\n}\n\nvoid PropertiesDialog::OnPluralFormsCustom(wxCommandEvent& event)\n{\n    if (!m_rememberedPluralForm.empty())\n        m_pluralFormsExpr->SetValue(m_rememberedPluralForm);\n\n    event.Skip();\n}\n\n\nbool PropertiesDialog::Validate()\n{\n    if (m_validatedPlural == -1)\n    {\n        m_validatedPlural = 1;\n        if (m_pluralFormsCustom->GetValue())\n        {\n            wxString form = m_pluralFormsExpr->GetValue();\n            if (!form.empty())\n            {\n                std::unique_ptr<PluralFormsCalculator> calc(PluralFormsCalculator::make(form.ToAscii()));\n                if (!calc)\n                    m_validatedPlural = 0;\n            }\n        }\n    }\n\n    if (m_validatedLang == -1)\n    {\n        m_validatedLang = m_language->IsValid() ? 1 : 0;\n    }\n\n    return m_validatedLang == 1 &&\n           m_validatedPlural == 1 &&\n           !m_project->GetValue().empty();\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n*\/\n\n#ifndef CORO_DEFINED\n#define CORO_DEFINED 1\n\n#ifdef VALGRIND\n#define USE_VALGRIND\n#endif\n\n#include \"taskimpl.hpp\"\n\n#if defined(__SYMBIAN32__)\n\t#define CORO_STACK_SIZE     8192\n\t#define CORO_STACK_SIZE_MIN 1024\n#else\n\t\/\/#define CORO_DEFAULT_STACK_SIZE     (65536\/2)\n\t\/\/#define CORO_DEFAULT_STACK_SIZE  (65536*4)\n\n\t\/\/128k needed on PPC due to parser\n\t#define CORO_DEFAULT_STACK_SIZE (128*1024)\n\t#define CORO_STACK_SIZE_MIN 8192\n#endif\n\n#if !defined(__MINGW32__) && defined(WIN32)\n#if defined(BUILDING_CORO_DLL) || defined(BUILDING_IOVMALL_DLL)\n#define CORO_API __declspec(dllexport)\n#else\n#define CORO_API __declspec(dllimport)\n#endif\n\n#else\n#define CORO_API\n#endif\n\n\/*\n#if defined(__amd64__) && !defined(__x86_64__)\n\t#define __x86_64__ 1\n#endif\n*\/\n\n\/\/ Pick which coro implementation to use\n\/\/ The make file can set -DUSE_FIBERS, -DUSE_UCONTEXT or -DUSE_SETJMP to force this choice.\n#if !defined(USE_FIBERS) && !defined(USE_UCONTEXT) && !defined(USE_SETJMP)\n\n#if defined(WIN32) && defined(HAS_FIBERS)\n#\tdefine USE_FIBERS\n#elif defined(HAS_UCONTEXT)\n\/\/#elif defined(HAS_UCONTEXT) && !defined(__x86_64__)\n#\tif !defined(USE_UCONTEXT)\n#\t\tdefine USE_UCONTEXT\n#\tendif\n#else\n#\tdefine USE_SETJMP\n#endif\n\n#endif\n\n#if defined(USE_FIBERS)\n\t#define CORO_IMPLEMENTATION \"fibers\"\n#elif defined(USE_UCONTEXT)\n\t#include <sys\/ucontext.h>\n\t#define CORO_IMPLEMENTATION \"ucontext\"\n#elif defined(USE_SETJMP)\n\t#include <setjmp.h>\n\t#define CORO_IMPLEMENTATION \"setjmp\"\n#endif\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\ntypedef struct Coro Coro;\n\nstruct Coro\n{\n\tsize_t requestedStackSize;\n\tsize_t allocatedStackSize;\n\tvoid *stack;\n\n#ifdef USE_VALGRIND\n\tunsigned int valgrindStackId;\n#endif\n\n#if defined(USE_FIBERS)\n\tvoid *fiber;\n#elif defined(USE_UCONTEXT)\n\tucontext_t env;\n#elif defined(USE_SETJMP)\n\tjmp_buf env;\n#endif\n\n\tunsigned char isMain;\n};\n\nCORO_API Coro *Coro_new(void);\nCORO_API void Coro_free(Coro *self);\n\n\/\/ stack\n\nCORO_API void *Coro_stack(Coro *self);\nCORO_API size_t Coro_stackSize(Coro *self);\nCORO_API void Coro_setStackSize_(Coro *self, size_t sizeInBytes);\nCORO_API size_t Coro_bytesLeftOnStack(Coro *self);\nCORO_API int Coro_stackSpaceAlmostGone(Coro *self);\n\nCORO_API void Coro_initializeMainCoro(Coro *self);\n\ntypedef void (CoroStartCallback)(void *);\n\nCORO_API void Coro_startCoro_(Coro *self, Coro *other, void *context, CoroStartCallback *callback);\nCORO_API void Coro_switchTo_(Coro *self, Coro *next);\nCORO_API void Coro_setup(Coro *self, void *arg); \/\/ private\n\n#ifdef __cplusplus\n}\n#endif\n#endif\n<commit_msg>Making stack smaller<commit_after>\/*\n*\/\n\n#ifndef CORO_DEFINED\n#define CORO_DEFINED 1\n\n#ifdef VALGRIND\n#define USE_VALGRIND\n#endif\n\n#include \"taskimpl.hpp\"\n\n\n\/*#if defined(__SYMBIAN32__)\n\t#define CORO_STACK_SIZE     8192\n\t#define CORO_STACK_SIZE_MIN 1024\n#else\n\t\/\/#define CORO_DEFAULT_STACK_SIZE     (65536\/2)\n\t\/\/#define CORO_DEFAULT_STACK_SIZE  (65536*4)\n\n\t\/\/128k needed on PPC due to parser\n\t#define CORO_DEFAULT_STACK_SIZE (128*1024)\n\t#define CORO_STACK_SIZE_MIN 8192\n#endif*\/\n\/\/TODO: In a special testing mode, munmap the page above (below)\n\/\/the stack so we can get an error if it overflows\n#define CORO_DEFAULT_STACK_SIZE 8192\n#define CORO_STACK_SIZE_MIN 1024\n\n#if !defined(__MINGW32__) && defined(WIN32)\n#if defined(BUILDING_CORO_DLL) || defined(BUILDING_IOVMALL_DLL)\n#define CORO_API __declspec(dllexport)\n#else\n#define CORO_API __declspec(dllimport)\n#endif\n\n#else\n#define CORO_API\n#endif\n\n\/*\n#if defined(__amd64__) && !defined(__x86_64__)\n\t#define __x86_64__ 1\n#endif\n*\/\n\n\/\/ Pick which coro implementation to use\n\/\/ The make file can set -DUSE_FIBERS, -DUSE_UCONTEXT or -DUSE_SETJMP to force this choice.\n#if !defined(USE_FIBERS) && !defined(USE_UCONTEXT) && !defined(USE_SETJMP)\n\n#if defined(WIN32) && defined(HAS_FIBERS)\n#\tdefine USE_FIBERS\n#elif defined(HAS_UCONTEXT)\n\/\/#elif defined(HAS_UCONTEXT) && !defined(__x86_64__)\n#\tif !defined(USE_UCONTEXT)\n#\t\tdefine USE_UCONTEXT\n#\tendif\n#else\n#\tdefine USE_SETJMP\n#endif\n\n#endif\n\n#if defined(USE_FIBERS)\n\t#define CORO_IMPLEMENTATION \"fibers\"\n#elif defined(USE_UCONTEXT)\n\t#include <sys\/ucontext.h>\n\t#define CORO_IMPLEMENTATION \"ucontext\"\n#elif defined(USE_SETJMP)\n\t#include <setjmp.h>\n\t#define CORO_IMPLEMENTATION \"setjmp\"\n#endif\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\ntypedef struct Coro Coro;\n\nstruct Coro\n{\n\tsize_t requestedStackSize;\n\tsize_t allocatedStackSize;\n\tvoid *stack;\n\n#ifdef USE_VALGRIND\n\tunsigned int valgrindStackId;\n#endif\n\n#if defined(USE_FIBERS)\n\tvoid *fiber;\n#elif defined(USE_UCONTEXT)\n\tucontext_t env;\n#elif defined(USE_SETJMP)\n\tjmp_buf env;\n#endif\n\n\tunsigned char isMain;\n};\n\nCORO_API Coro *Coro_new(void);\nCORO_API void Coro_free(Coro *self);\n\n\/\/ stack\n\nCORO_API void *Coro_stack(Coro *self);\nCORO_API size_t Coro_stackSize(Coro *self);\nCORO_API void Coro_setStackSize_(Coro *self, size_t sizeInBytes);\nCORO_API size_t Coro_bytesLeftOnStack(Coro *self);\nCORO_API int Coro_stackSpaceAlmostGone(Coro *self);\n\nCORO_API void Coro_initializeMainCoro(Coro *self);\n\ntypedef void (CoroStartCallback)(void *);\n\nCORO_API void Coro_startCoro_(Coro *self, Coro *other, void *context, CoroStartCallback *callback);\nCORO_API void Coro_switchTo_(Coro *self, Coro *next);\nCORO_API void Coro_setup(Coro *self, void *arg); \/\/ private\n\n#ifdef __cplusplus\n}\n#endif\n#endif\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\/\/ Framebuffer tests:\n\/\/   Various tests related for Frambuffers.\n\/\/\n\n#include \"test_utils\/ANGLETest.h\"\n#include \"test_utils\/gl_raii.h\"\n\nusing namespace angle;\n\nclass FramebufferFormatsTest : public ANGLETest\n{\n  protected:\n    FramebufferFormatsTest() : mFramebuffer(0), mTexture(0), mRenderbuffer(0), mProgram(0)\n    {\n        setWindowWidth(128);\n        setWindowHeight(128);\n        setConfigRedBits(8);\n        setConfigGreenBits(8);\n        setConfigBlueBits(8);\n        setConfigAlphaBits(8);\n    }\n\n    void checkBitCount(GLuint fbo, GLenum channel, GLint minBits)\n    {\n        glBindFramebuffer(GL_FRAMEBUFFER, fbo);\n\n        GLint bits = 0;\n        glGetIntegerv(channel, &bits);\n\n        if (minBits == 0)\n        {\n            EXPECT_EQ(minBits, bits);\n        }\n        else\n        {\n            EXPECT_GE(bits, minBits);\n        }\n    }\n\n    void testBitCounts(GLuint fbo,\n                       GLint minRedBits,\n                       GLint minGreenBits,\n                       GLint minBlueBits,\n                       GLint minAlphaBits,\n                       GLint minDepthBits,\n                       GLint minStencilBits)\n    {\n        checkBitCount(fbo, GL_RED_BITS, minRedBits);\n        checkBitCount(fbo, GL_GREEN_BITS, minGreenBits);\n        checkBitCount(fbo, GL_BLUE_BITS, minBlueBits);\n        checkBitCount(fbo, GL_ALPHA_BITS, minAlphaBits);\n        checkBitCount(fbo, GL_DEPTH_BITS, minDepthBits);\n        checkBitCount(fbo, GL_STENCIL_BITS, minStencilBits);\n    }\n\n    void testTextureFormat(GLenum internalFormat,\n                           GLint minRedBits,\n                           GLint minGreenBits,\n                           GLint minBlueBits,\n                           GLint minAlphaBits)\n    {\n        glGenTextures(1, &mTexture);\n        glBindTexture(GL_TEXTURE_2D, mTexture);\n        glTexStorage2DEXT(GL_TEXTURE_2D, 1, internalFormat, 1, 1);\n\n        glFramebufferTexture2D(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0, GL_TEXTURE_2D, mTexture, 0);\n\n        testBitCounts(mFramebuffer, minRedBits, minGreenBits, minBlueBits, minAlphaBits, 0, 0);\n    }\n\n    void testRenderbufferMultisampleFormat(int minESVersion,\n                                           GLenum attachmentType,\n                                           GLenum internalFormat)\n    {\n        \/\/ TODO(geofflang): Figure out why this is broken on Intel OpenGL\n        if (IsIntel() && getPlatformRenderer() == EGL_PLATFORM_ANGLE_TYPE_OPENGL_ANGLE)\n        {\n            std::cout << \"Test skipped on Intel OpenGL.\" << std::endl;\n            return;\n        }\n\n        int clientVersion = getClientMajorVersion();\n        if (clientVersion < minESVersion)\n        {\n            return;\n        }\n\n        \/\/ Check that multisample is supported with at least two samples (minimum required is 1)\n        bool supports2Samples = false;\n\n        if (clientVersion == 2)\n        {\n            if (extensionEnabled(\"ANGLE_framebuffer_multisample\"))\n            {\n                int maxSamples;\n                glGetIntegerv(GL_MAX_SAMPLES_ANGLE, &maxSamples);\n                supports2Samples = maxSamples >= 2;\n            }\n        }\n        else\n        {\n            assert(clientVersion >= 3);\n            int maxSamples;\n            glGetIntegerv(GL_MAX_SAMPLES, &maxSamples);\n            supports2Samples = maxSamples >= 2;\n        }\n\n        if (!supports2Samples)\n        {\n            return;\n        }\n\n        glGenRenderbuffers(1, &mRenderbuffer);\n        glBindRenderbuffer(GL_RENDERBUFFER, mRenderbuffer);\n\n        EXPECT_GL_NO_ERROR();\n        glRenderbufferStorageMultisampleANGLE(GL_RENDERBUFFER, 2, internalFormat, 128, 128);\n        EXPECT_GL_NO_ERROR();\n        glFramebufferRenderbuffer(GL_FRAMEBUFFER, attachmentType, GL_RENDERBUFFER, mRenderbuffer);\n        EXPECT_GL_NO_ERROR();\n    }\n\n    void testZeroHeightRenderbuffer()\n    {\n        glGenRenderbuffers(1, &mRenderbuffer);\n        glBindRenderbuffer(GL_RENDERBUFFER, mRenderbuffer);\n        glRenderbufferStorage(GL_RENDERBUFFER, GL_RGBA8, 1, 0);\n        glFramebufferRenderbuffer(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0, GL_RENDERBUFFER,\n                                  mRenderbuffer);\n        EXPECT_GL_NO_ERROR();\n    }\n\n    void SetUp() override\n    {\n        ANGLETest::SetUp();\n\n        glGenFramebuffers(1, &mFramebuffer);\n        glBindFramebuffer(GL_FRAMEBUFFER, mFramebuffer);\n    }\n\n    void TearDown() override\n    {\n        ANGLETest::TearDown();\n\n        if (mTexture != 0)\n        {\n            glDeleteTextures(1, &mTexture);\n            mTexture = 0;\n        }\n\n        if (mRenderbuffer != 0)\n        {\n            glDeleteRenderbuffers(1, &mRenderbuffer);\n            mRenderbuffer = 0;\n        }\n\n        if (mFramebuffer != 0)\n        {\n            glDeleteFramebuffers(1, &mFramebuffer);\n            mFramebuffer = 0;\n        }\n\n        if (mProgram != 0)\n        {\n            glDeleteProgram(mProgram);\n            mProgram = 0;\n        }\n    }\n\n    GLuint mFramebuffer;\n    GLuint mTexture;\n    GLuint mRenderbuffer;\n    GLuint mProgram;\n};\n\nTEST_P(FramebufferFormatsTest, RGBA4)\n{\n    testTextureFormat(GL_RGBA4, 4, 4, 4, 4);\n}\n\nTEST_P(FramebufferFormatsTest, RGB565)\n{\n    testTextureFormat(GL_RGB565, 5, 6, 5, 0);\n}\n\nTEST_P(FramebufferFormatsTest, RGB8)\n{\n    if (getClientMajorVersion() < 3 && !extensionEnabled(\"GL_OES_rgb8_rgba8\"))\n    {\n        std::cout << \"Test skipped due to missing ES3 or GL_OES_rgb8_rgba8.\" << std::endl;\n        return;\n    }\n\n    testTextureFormat(GL_RGB8_OES, 8, 8, 8, 0);\n}\n\nTEST_P(FramebufferFormatsTest, BGRA8)\n{\n    if (!extensionEnabled(\"GL_EXT_texture_format_BGRA8888\"))\n    {\n        std::cout << \"Test skipped due to missing GL_EXT_texture_format_BGRA8888.\" << std::endl;\n        return;\n    }\n\n    testTextureFormat(GL_BGRA8_EXT, 8, 8, 8, 8);\n}\n\nTEST_P(FramebufferFormatsTest, RGBA8)\n{\n    if (getClientMajorVersion() < 3 && !extensionEnabled(\"GL_OES_rgb8_rgba8\"))\n    {\n        std::cout << \"Test skipped due to missing ES3 or GL_OES_rgb8_rgba8.\" << std::endl;\n        return;\n    }\n\n    testTextureFormat(GL_RGBA8_OES, 8, 8, 8, 8);\n}\n\nTEST_P(FramebufferFormatsTest, RenderbufferMultisample_DEPTH16)\n{\n    testRenderbufferMultisampleFormat(2, GL_DEPTH_ATTACHMENT, GL_DEPTH_COMPONENT16);\n}\n\nTEST_P(FramebufferFormatsTest, RenderbufferMultisample_DEPTH24)\n{\n    testRenderbufferMultisampleFormat(3, GL_DEPTH_ATTACHMENT, GL_DEPTH_COMPONENT24);\n}\n\nTEST_P(FramebufferFormatsTest, RenderbufferMultisample_DEPTH32F)\n{\n    if (getClientMajorVersion() < 3)\n    {\n        std::cout << \"Test skipped due to missing ES3.\" << std::endl;\n        return;\n    }\n\n    testRenderbufferMultisampleFormat(3, GL_DEPTH_ATTACHMENT, GL_DEPTH_COMPONENT32F);\n}\n\nTEST_P(FramebufferFormatsTest, RenderbufferMultisample_DEPTH24_STENCIL8)\n{\n    testRenderbufferMultisampleFormat(3, GL_DEPTH_STENCIL_ATTACHMENT, GL_DEPTH24_STENCIL8);\n}\n\nTEST_P(FramebufferFormatsTest, RenderbufferMultisample_DEPTH32F_STENCIL8)\n{\n    if (getClientMajorVersion() < 3)\n    {\n        std::cout << \"Test skipped due to missing ES3.\" << std::endl;\n        return;\n    }\n\n    testRenderbufferMultisampleFormat(3, GL_DEPTH_STENCIL_ATTACHMENT, GL_DEPTH32F_STENCIL8);\n}\n\nTEST_P(FramebufferFormatsTest, RenderbufferMultisample_STENCIL_INDEX8)\n{\n    \/\/ TODO(geofflang): Figure out how to support GLSTENCIL_INDEX8 on desktop GL\n    if (GetParam().getRenderer() == EGL_PLATFORM_ANGLE_TYPE_OPENGL_ANGLE)\n    {\n        std::cout << \"Test skipped on Desktop OpenGL.\" << std::endl;\n        return;\n    }\n\n    testRenderbufferMultisampleFormat(2, GL_STENCIL_ATTACHMENT, GL_STENCIL_INDEX8);\n}\n\n\/\/ Test that binding an incomplete cube map is rejected by ANGLE.\nTEST_P(FramebufferFormatsTest, IncompleteCubeMap)\n{\n    \/\/ First make a complete CubeMap.\n    glGenTextures(1, &mTexture);\n    glBindTexture(GL_TEXTURE_CUBE_MAP, mTexture);\n    glTexImage2D(GL_TEXTURE_CUBE_MAP_POSITIVE_X, 0, GL_RGBA, 8, 8, 0, GL_RGBA, GL_UNSIGNED_BYTE,\n                 nullptr);\n    glTexImage2D(GL_TEXTURE_CUBE_MAP_POSITIVE_Y, 0, GL_RGBA, 8, 8, 0, GL_RGBA, GL_UNSIGNED_BYTE,\n                 nullptr);\n    glTexImage2D(GL_TEXTURE_CUBE_MAP_POSITIVE_Z, 0, GL_RGBA, 8, 8, 0, GL_RGBA, GL_UNSIGNED_BYTE,\n                 nullptr);\n    glTexImage2D(GL_TEXTURE_CUBE_MAP_NEGATIVE_X, 0, GL_RGBA, 8, 8, 0, GL_RGBA, GL_UNSIGNED_BYTE,\n                 nullptr);\n    glTexImage2D(GL_TEXTURE_CUBE_MAP_NEGATIVE_Y, 0, GL_RGBA, 8, 8, 0, GL_RGBA, GL_UNSIGNED_BYTE,\n                 nullptr);\n    glTexImage2D(GL_TEXTURE_CUBE_MAP_NEGATIVE_Z, 0, GL_RGBA, 8, 8, 0, GL_RGBA, GL_UNSIGNED_BYTE,\n                 nullptr);\n    glTexParameteri(GL_TEXTURE_CUBE_MAP, GL_TEXTURE_MIN_FILTER, GL_NEAREST);\n    glTexParameteri(GL_TEXTURE_CUBE_MAP, GL_TEXTURE_MAG_FILTER, GL_NEAREST);\n\n    glFramebufferTexture2D(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0, GL_TEXTURE_CUBE_MAP_POSITIVE_X,\n                           mTexture, 0);\n\n    \/\/ Verify the framebuffer is complete.\n    ASSERT_GLENUM_EQ(GL_FRAMEBUFFER_COMPLETE, glCheckFramebufferStatus(GL_FRAMEBUFFER));\n\n    \/\/ Make the CubeMap cube-incomplete.\n    glTexImage2D(GL_TEXTURE_CUBE_MAP_NEGATIVE_Z, 0, GL_RGBA, 16, 16, 0, GL_RGBA, GL_UNSIGNED_BYTE,\n                 nullptr);\n\n    \/\/ Verify the framebuffer is incomplete.\n    ASSERT_GLENUM_EQ(GL_FRAMEBUFFER_INCOMPLETE_ATTACHMENT,\n                     glCheckFramebufferStatus(GL_FRAMEBUFFER));\n\n    \/\/ Verify drawing with the incomplete framebuffer produces a GL error\n    const std::string &vs = \"attribute vec4 position; void main() { gl_Position = position; }\";\n    const std::string &ps = \"void main() { gl_FragColor = vec4(1, 0, 0, 1); }\";\n    mProgram = CompileProgram(vs, ps);\n    ASSERT_NE(0u, mProgram);\n    drawQuad(mProgram, \"position\", 0.5f);\n    ASSERT_GL_ERROR(GL_INVALID_FRAMEBUFFER_OPERATION);\n}\n\n\/\/ Test that a renderbuffer with zero height but nonzero width is handled without crashes\/asserts.\nTEST_P(FramebufferFormatsTest, ZeroHeightRenderbuffer)\n{\n    if (getClientMajorVersion() < 3)\n    {\n        std::cout << \"Test skipped due to missing ES3\" << std::endl;\n        return;\n    }\n\n    testZeroHeightRenderbuffer();\n}\n\n\/\/ Use this to select which configurations (e.g. which renderer, which GLES major version) these\n\/\/ tests should be run against.\nANGLE_INSTANTIATE_TEST(FramebufferFormatsTest,\n                       ES2_D3D9(),\n                       ES2_D3D11(),\n                       ES3_D3D11(),\n                       ES2_OPENGL(),\n                       ES3_OPENGL(),\n                       ES2_OPENGLES(),\n                       ES3_OPENGLES());\n\nclass FramebufferTest_ES3 : public ANGLETest\n{\n  protected:\n    FramebufferTest_ES3() : mFramebuffer(0), mRenderbuffer(0) {}\n\n    void SetUp() override\n    {\n        ANGLETest::SetUp();\n\n        glGenFramebuffers(1, &mFramebuffer);\n        glGenRenderbuffers(1, &mRenderbuffer);\n    }\n\n    void TearDown() override\n    {\n        glDeleteFramebuffers(1, &mFramebuffer);\n        glDeleteRenderbuffers(1, &mRenderbuffer);\n\n        ANGLETest::TearDown();\n    }\n\n    GLuint mFramebuffer;\n    GLuint mRenderbuffer;\n};\n\n\/\/ Covers invalidating an incomplete framebuffer. This should be a no-op, but should not error.\nTEST_P(FramebufferTest_ES3, InvalidateIncomplete)\n{\n    glBindFramebuffer(GL_FRAMEBUFFER, mFramebuffer);\n    glBindRenderbuffer(GL_RENDERBUFFER, mRenderbuffer);\n    glFramebufferRenderbuffer(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0, GL_RENDERBUFFER, mRenderbuffer);\n    EXPECT_GLENUM_EQ(GL_FRAMEBUFFER_INCOMPLETE_ATTACHMENT,\n                     glCheckFramebufferStatus(GL_FRAMEBUFFER));\n\n    std::vector<GLenum> attachments;\n    attachments.push_back(GL_COLOR_ATTACHMENT0);\n\n    glInvalidateFramebuffer(GL_FRAMEBUFFER, 1, attachments.data());\n    EXPECT_GL_NO_ERROR();\n}\n\n\/\/ Test that the framebuffer state tracking robustly handles a depth-only attachment being set\n\/\/ as a depth-stencil attachment. It is equivalent to detaching the depth-stencil attachment.\nTEST_P(FramebufferTest_ES3, DepthOnlyAsDepthStencil)\n{\n    glBindFramebuffer(GL_FRAMEBUFFER, mFramebuffer);\n    glBindRenderbuffer(GL_RENDERBUFFER, mRenderbuffer);\n    glRenderbufferStorage(GL_RENDERBUFFER, GL_DEPTH_COMPONENT16, 4, 4);\n\n    glFramebufferRenderbuffer(GL_FRAMEBUFFER, GL_DEPTH_STENCIL_ATTACHMENT, GL_RENDERBUFFER,\n                              mRenderbuffer);\n    EXPECT_GLENUM_NE(GL_FRAMEBUFFER_COMPLETE, glCheckFramebufferStatus(GL_FRAMEBUFFER));\n}\n\nTEST_P(FramebufferTest_ES3, CompleteWithNonZeroBaseLevel)\n{\n    \/\/ This fails on Windows OpenGL, NVIDIA Linux, and Mac OSX.\n    if ((IsWindows() && IsOpenGL()) || (IsNVIDIA() && IsLinux()) || IsOSX())\n    {\n        std::cout << \"Test skipped due to driver bug on Windows OpenGL, NVIDIA Linux, and Mac OSX.\"\n                  << std::endl;\n        return;\n    }\n\n    GLint level = 1;\n    GLTexture tex;\n    glBindTexture(GL_TEXTURE_2D, tex.get());\n    glTexImage2D(GL_TEXTURE_2D, level, GL_RGBA, 8, 8, 0, GL_RGBA, GL_UNSIGNED_BYTE, nullptr);\n    glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);\n    glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);\n    glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_BASE_LEVEL, level);\n\n    glBindFramebuffer(GL_FRAMEBUFFER, mFramebuffer);\n    glFramebufferTexture2D(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0, GL_TEXTURE_2D, tex.get(), level);\n\n    \/\/ Verify the framebuffer is complete.\n    ASSERT_GLENUM_EQ(GL_FRAMEBUFFER_COMPLETE, glCheckFramebufferStatus(GL_FRAMEBUFFER));\n}\n\nANGLE_INSTANTIATE_TEST(FramebufferTest_ES3, ES3_D3D11(), ES3_OPENGL(), ES3_OPENGLES());\n<commit_msg>Revert \"Fbo attaching non-zero base level texture should be complete\"<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\/\/ Framebuffer tests:\n\/\/   Various tests related for Frambuffers.\n\/\/\n\n#include \"test_utils\/ANGLETest.h\"\n\nusing namespace angle;\n\nclass FramebufferFormatsTest : public ANGLETest\n{\n  protected:\n    FramebufferFormatsTest() : mFramebuffer(0), mTexture(0), mRenderbuffer(0), mProgram(0)\n    {\n        setWindowWidth(128);\n        setWindowHeight(128);\n        setConfigRedBits(8);\n        setConfigGreenBits(8);\n        setConfigBlueBits(8);\n        setConfigAlphaBits(8);\n    }\n\n    void checkBitCount(GLuint fbo, GLenum channel, GLint minBits)\n    {\n        glBindFramebuffer(GL_FRAMEBUFFER, fbo);\n\n        GLint bits = 0;\n        glGetIntegerv(channel, &bits);\n\n        if (minBits == 0)\n        {\n            EXPECT_EQ(minBits, bits);\n        }\n        else\n        {\n            EXPECT_GE(bits, minBits);\n        }\n    }\n\n    void testBitCounts(GLuint fbo,\n                       GLint minRedBits,\n                       GLint minGreenBits,\n                       GLint minBlueBits,\n                       GLint minAlphaBits,\n                       GLint minDepthBits,\n                       GLint minStencilBits)\n    {\n        checkBitCount(fbo, GL_RED_BITS, minRedBits);\n        checkBitCount(fbo, GL_GREEN_BITS, minGreenBits);\n        checkBitCount(fbo, GL_BLUE_BITS, minBlueBits);\n        checkBitCount(fbo, GL_ALPHA_BITS, minAlphaBits);\n        checkBitCount(fbo, GL_DEPTH_BITS, minDepthBits);\n        checkBitCount(fbo, GL_STENCIL_BITS, minStencilBits);\n    }\n\n    void testTextureFormat(GLenum internalFormat,\n                           GLint minRedBits,\n                           GLint minGreenBits,\n                           GLint minBlueBits,\n                           GLint minAlphaBits)\n    {\n        glGenTextures(1, &mTexture);\n        glBindTexture(GL_TEXTURE_2D, mTexture);\n        glTexStorage2DEXT(GL_TEXTURE_2D, 1, internalFormat, 1, 1);\n\n        glFramebufferTexture2D(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0, GL_TEXTURE_2D, mTexture, 0);\n\n        testBitCounts(mFramebuffer, minRedBits, minGreenBits, minBlueBits, minAlphaBits, 0, 0);\n    }\n\n    void testRenderbufferMultisampleFormat(int minESVersion,\n                                           GLenum attachmentType,\n                                           GLenum internalFormat)\n    {\n        \/\/ TODO(geofflang): Figure out why this is broken on Intel OpenGL\n        if (IsIntel() && getPlatformRenderer() == EGL_PLATFORM_ANGLE_TYPE_OPENGL_ANGLE)\n        {\n            std::cout << \"Test skipped on Intel OpenGL.\" << std::endl;\n            return;\n        }\n\n        int clientVersion = getClientMajorVersion();\n        if (clientVersion < minESVersion)\n        {\n            return;\n        }\n\n        \/\/ Check that multisample is supported with at least two samples (minimum required is 1)\n        bool supports2Samples = false;\n\n        if (clientVersion == 2)\n        {\n            if (extensionEnabled(\"ANGLE_framebuffer_multisample\"))\n            {\n                int maxSamples;\n                glGetIntegerv(GL_MAX_SAMPLES_ANGLE, &maxSamples);\n                supports2Samples = maxSamples >= 2;\n            }\n        }\n        else\n        {\n            assert(clientVersion >= 3);\n            int maxSamples;\n            glGetIntegerv(GL_MAX_SAMPLES, &maxSamples);\n            supports2Samples = maxSamples >= 2;\n        }\n\n        if (!supports2Samples)\n        {\n            return;\n        }\n\n        glGenRenderbuffers(1, &mRenderbuffer);\n        glBindRenderbuffer(GL_RENDERBUFFER, mRenderbuffer);\n\n        EXPECT_GL_NO_ERROR();\n        glRenderbufferStorageMultisampleANGLE(GL_RENDERBUFFER, 2, internalFormat, 128, 128);\n        EXPECT_GL_NO_ERROR();\n        glFramebufferRenderbuffer(GL_FRAMEBUFFER, attachmentType, GL_RENDERBUFFER, mRenderbuffer);\n        EXPECT_GL_NO_ERROR();\n    }\n\n    void testZeroHeightRenderbuffer()\n    {\n        glGenRenderbuffers(1, &mRenderbuffer);\n        glBindRenderbuffer(GL_RENDERBUFFER, mRenderbuffer);\n        glRenderbufferStorage(GL_RENDERBUFFER, GL_RGBA8, 1, 0);\n        glFramebufferRenderbuffer(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0, GL_RENDERBUFFER,\n                                  mRenderbuffer);\n        EXPECT_GL_NO_ERROR();\n    }\n\n    void SetUp() override\n    {\n        ANGLETest::SetUp();\n\n        glGenFramebuffers(1, &mFramebuffer);\n        glBindFramebuffer(GL_FRAMEBUFFER, mFramebuffer);\n    }\n\n    void TearDown() override\n    {\n        ANGLETest::TearDown();\n\n        if (mTexture != 0)\n        {\n            glDeleteTextures(1, &mTexture);\n            mTexture = 0;\n        }\n\n        if (mRenderbuffer != 0)\n        {\n            glDeleteRenderbuffers(1, &mRenderbuffer);\n            mRenderbuffer = 0;\n        }\n\n        if (mFramebuffer != 0)\n        {\n            glDeleteFramebuffers(1, &mFramebuffer);\n            mFramebuffer = 0;\n        }\n\n        if (mProgram != 0)\n        {\n            glDeleteProgram(mProgram);\n            mProgram = 0;\n        }\n    }\n\n    GLuint mFramebuffer;\n    GLuint mTexture;\n    GLuint mRenderbuffer;\n    GLuint mProgram;\n};\n\nTEST_P(FramebufferFormatsTest, RGBA4)\n{\n    testTextureFormat(GL_RGBA4, 4, 4, 4, 4);\n}\n\nTEST_P(FramebufferFormatsTest, RGB565)\n{\n    testTextureFormat(GL_RGB565, 5, 6, 5, 0);\n}\n\nTEST_P(FramebufferFormatsTest, RGB8)\n{\n    if (getClientMajorVersion() < 3 && !extensionEnabled(\"GL_OES_rgb8_rgba8\"))\n    {\n        std::cout << \"Test skipped due to missing ES3 or GL_OES_rgb8_rgba8.\" << std::endl;\n        return;\n    }\n\n    testTextureFormat(GL_RGB8_OES, 8, 8, 8, 0);\n}\n\nTEST_P(FramebufferFormatsTest, BGRA8)\n{\n    if (!extensionEnabled(\"GL_EXT_texture_format_BGRA8888\"))\n    {\n        std::cout << \"Test skipped due to missing GL_EXT_texture_format_BGRA8888.\" << std::endl;\n        return;\n    }\n\n    testTextureFormat(GL_BGRA8_EXT, 8, 8, 8, 8);\n}\n\nTEST_P(FramebufferFormatsTest, RGBA8)\n{\n    if (getClientMajorVersion() < 3 && !extensionEnabled(\"GL_OES_rgb8_rgba8\"))\n    {\n        std::cout << \"Test skipped due to missing ES3 or GL_OES_rgb8_rgba8.\" << std::endl;\n        return;\n    }\n\n    testTextureFormat(GL_RGBA8_OES, 8, 8, 8, 8);\n}\n\nTEST_P(FramebufferFormatsTest, RenderbufferMultisample_DEPTH16)\n{\n    testRenderbufferMultisampleFormat(2, GL_DEPTH_ATTACHMENT, GL_DEPTH_COMPONENT16);\n}\n\nTEST_P(FramebufferFormatsTest, RenderbufferMultisample_DEPTH24)\n{\n    testRenderbufferMultisampleFormat(3, GL_DEPTH_ATTACHMENT, GL_DEPTH_COMPONENT24);\n}\n\nTEST_P(FramebufferFormatsTest, RenderbufferMultisample_DEPTH32F)\n{\n    if (getClientMajorVersion() < 3)\n    {\n        std::cout << \"Test skipped due to missing ES3.\" << std::endl;\n        return;\n    }\n\n    testRenderbufferMultisampleFormat(3, GL_DEPTH_ATTACHMENT, GL_DEPTH_COMPONENT32F);\n}\n\nTEST_P(FramebufferFormatsTest, RenderbufferMultisample_DEPTH24_STENCIL8)\n{\n    testRenderbufferMultisampleFormat(3, GL_DEPTH_STENCIL_ATTACHMENT, GL_DEPTH24_STENCIL8);\n}\n\nTEST_P(FramebufferFormatsTest, RenderbufferMultisample_DEPTH32F_STENCIL8)\n{\n    if (getClientMajorVersion() < 3)\n    {\n        std::cout << \"Test skipped due to missing ES3.\" << std::endl;\n        return;\n    }\n\n    testRenderbufferMultisampleFormat(3, GL_DEPTH_STENCIL_ATTACHMENT, GL_DEPTH32F_STENCIL8);\n}\n\nTEST_P(FramebufferFormatsTest, RenderbufferMultisample_STENCIL_INDEX8)\n{\n    \/\/ TODO(geofflang): Figure out how to support GLSTENCIL_INDEX8 on desktop GL\n    if (GetParam().getRenderer() == EGL_PLATFORM_ANGLE_TYPE_OPENGL_ANGLE)\n    {\n        std::cout << \"Test skipped on Desktop OpenGL.\" << std::endl;\n        return;\n    }\n\n    testRenderbufferMultisampleFormat(2, GL_STENCIL_ATTACHMENT, GL_STENCIL_INDEX8);\n}\n\n\/\/ Test that binding an incomplete cube map is rejected by ANGLE.\nTEST_P(FramebufferFormatsTest, IncompleteCubeMap)\n{\n    \/\/ First make a complete CubeMap.\n    glGenTextures(1, &mTexture);\n    glBindTexture(GL_TEXTURE_CUBE_MAP, mTexture);\n    glTexImage2D(GL_TEXTURE_CUBE_MAP_POSITIVE_X, 0, GL_RGBA, 8, 8, 0, GL_RGBA, GL_UNSIGNED_BYTE,\n                 nullptr);\n    glTexImage2D(GL_TEXTURE_CUBE_MAP_POSITIVE_Y, 0, GL_RGBA, 8, 8, 0, GL_RGBA, GL_UNSIGNED_BYTE,\n                 nullptr);\n    glTexImage2D(GL_TEXTURE_CUBE_MAP_POSITIVE_Z, 0, GL_RGBA, 8, 8, 0, GL_RGBA, GL_UNSIGNED_BYTE,\n                 nullptr);\n    glTexImage2D(GL_TEXTURE_CUBE_MAP_NEGATIVE_X, 0, GL_RGBA, 8, 8, 0, GL_RGBA, GL_UNSIGNED_BYTE,\n                 nullptr);\n    glTexImage2D(GL_TEXTURE_CUBE_MAP_NEGATIVE_Y, 0, GL_RGBA, 8, 8, 0, GL_RGBA, GL_UNSIGNED_BYTE,\n                 nullptr);\n    glTexImage2D(GL_TEXTURE_CUBE_MAP_NEGATIVE_Z, 0, GL_RGBA, 8, 8, 0, GL_RGBA, GL_UNSIGNED_BYTE,\n                 nullptr);\n    glTexParameteri(GL_TEXTURE_CUBE_MAP, GL_TEXTURE_MIN_FILTER, GL_NEAREST);\n    glTexParameteri(GL_TEXTURE_CUBE_MAP, GL_TEXTURE_MAG_FILTER, GL_NEAREST);\n\n    glFramebufferTexture2D(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0, GL_TEXTURE_CUBE_MAP_POSITIVE_X,\n                           mTexture, 0);\n\n    \/\/ Verify the framebuffer is complete.\n    ASSERT_GLENUM_EQ(GL_FRAMEBUFFER_COMPLETE, glCheckFramebufferStatus(GL_FRAMEBUFFER));\n\n    \/\/ Make the CubeMap cube-incomplete.\n    glTexImage2D(GL_TEXTURE_CUBE_MAP_NEGATIVE_Z, 0, GL_RGBA, 16, 16, 0, GL_RGBA, GL_UNSIGNED_BYTE,\n                 nullptr);\n\n    \/\/ Verify the framebuffer is incomplete.\n    ASSERT_GLENUM_EQ(GL_FRAMEBUFFER_INCOMPLETE_ATTACHMENT,\n                     glCheckFramebufferStatus(GL_FRAMEBUFFER));\n\n    \/\/ Verify drawing with the incomplete framebuffer produces a GL error\n    const std::string &vs = \"attribute vec4 position; void main() { gl_Position = position; }\";\n    const std::string &ps = \"void main() { gl_FragColor = vec4(1, 0, 0, 1); }\";\n    mProgram = CompileProgram(vs, ps);\n    ASSERT_NE(0u, mProgram);\n    drawQuad(mProgram, \"position\", 0.5f);\n    ASSERT_GL_ERROR(GL_INVALID_FRAMEBUFFER_OPERATION);\n}\n\n\/\/ Test that a renderbuffer with zero height but nonzero width is handled without crashes\/asserts.\nTEST_P(FramebufferFormatsTest, ZeroHeightRenderbuffer)\n{\n    if (getClientMajorVersion() < 3)\n    {\n        std::cout << \"Test skipped due to missing ES3\" << std::endl;\n        return;\n    }\n\n    testZeroHeightRenderbuffer();\n}\n\n\/\/ Use this to select which configurations (e.g. which renderer, which GLES major version) these\n\/\/ tests should be run against.\nANGLE_INSTANTIATE_TEST(FramebufferFormatsTest,\n                       ES2_D3D9(),\n                       ES2_D3D11(),\n                       ES3_D3D11(),\n                       ES2_OPENGL(),\n                       ES3_OPENGL(),\n                       ES2_OPENGLES(),\n                       ES3_OPENGLES());\n\nclass FramebufferTest_ES3 : public ANGLETest\n{\n  protected:\n    FramebufferTest_ES3() : mFramebuffer(0), mRenderbuffer(0) {}\n\n    void SetUp() override\n    {\n        ANGLETest::SetUp();\n\n        glGenFramebuffers(1, &mFramebuffer);\n        glGenRenderbuffers(1, &mRenderbuffer);\n    }\n\n    void TearDown() override\n    {\n        glDeleteFramebuffers(1, &mFramebuffer);\n        glDeleteRenderbuffers(1, &mRenderbuffer);\n        ANGLETest::TearDown();\n    }\n\n    GLuint mFramebuffer;\n    GLuint mRenderbuffer;\n};\n\n\/\/ Covers invalidating an incomplete framebuffer. This should be a no-op, but should not error.\nTEST_P(FramebufferTest_ES3, InvalidateIncomplete)\n{\n    glBindFramebuffer(GL_FRAMEBUFFER, mFramebuffer);\n    glBindRenderbuffer(GL_RENDERBUFFER, mRenderbuffer);\n    glFramebufferRenderbuffer(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0, GL_RENDERBUFFER, mRenderbuffer);\n    EXPECT_GLENUM_EQ(GL_FRAMEBUFFER_INCOMPLETE_ATTACHMENT,\n                     glCheckFramebufferStatus(GL_FRAMEBUFFER));\n\n    std::vector<GLenum> attachments;\n    attachments.push_back(GL_COLOR_ATTACHMENT0);\n\n    glInvalidateFramebuffer(GL_FRAMEBUFFER, 1, attachments.data());\n    EXPECT_GL_NO_ERROR();\n}\n\n\/\/ Test that the framebuffer state tracking robustly handles a depth-only attachment being set\n\/\/ as a depth-stencil attachment. It is equivalent to detaching the depth-stencil attachment.\nTEST_P(FramebufferTest_ES3, DepthOnlyAsDepthStencil)\n{\n    glBindFramebuffer(GL_FRAMEBUFFER, mFramebuffer);\n    glBindRenderbuffer(GL_RENDERBUFFER, mRenderbuffer);\n    glRenderbufferStorage(GL_RENDERBUFFER, GL_DEPTH_COMPONENT16, 4, 4);\n\n    glFramebufferRenderbuffer(GL_FRAMEBUFFER, GL_DEPTH_STENCIL_ATTACHMENT, GL_RENDERBUFFER,\n                              mRenderbuffer);\n    EXPECT_GLENUM_NE(GL_FRAMEBUFFER_COMPLETE, glCheckFramebufferStatus(GL_FRAMEBUFFER));\n}\n\nANGLE_INSTANTIATE_TEST(FramebufferTest_ES3, ES3_D3D11(), ES3_OPENGL(), ES3_OPENGLES());\n<|endoftext|>"}
{"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/hwpf\/fapi2\/include\/error_info_defs.H $             *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2011,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 error_info_defs.H\n\/\/\/ @brief Defines to support the Error Information class\n\/\/\/\n\n#ifndef FAPI2_ERRORINFO_DEFS_H_\n#define FAPI2_ERRORINFO_DEFS_H_\n\n#include <stdint.h>\n#include <target.H>\n\n#if !defined(MINIMUM_FFDC) && !defined(FAPI2_NO_FFDC)\n    #include <variable_buffer.H>\n    #include <utility>\n#endif\nnamespace fapi2\n{\n\n\/\/\/\n\/\/\/ @brief Type to hold the ffdc data to be sent to hostboot\n\/\/\/\n\/\/\/ Note: Typical data sent seems to be register\/addresss info\n\/\/\/       rather than use extra space converting stuff just\n\/\/\/       send a uint64 always\n\/\/\/\nstruct sbeFfdc_t\n{\n    uint32_t  size;\n    uint64_t  data;\n};\n\n\/\/ 10 entries limits the size of SbeFfdcData_t to 128 bytes\nenum\n{\n    MAX_SBE_FFDC_ENTRIES = 10\n};\n\n\/\/ Data type for SBE ffdc buffer sent through fifo\ntypedef struct\n{\n    uint32_t  fapiRc;      \/\/ Return code from failure\n    uint32_t  ffdcLength;  \/\/ length of Fapi FFDC data (in bytes)\n    struct sbeFfdc_t ffdcData[MAX_SBE_FFDC_ENTRIES]; \/\/ fapi FFDC data\n} SbeFfdcData_t; \/\/ 128 bytes\n\n\/\/\/\n\/\/\/ @brief Type to hold the ffdc element in the ffdc class\n\/\/\/ Needed so that the size can be squirled away before the\n\/\/\/ macro is called.\n\/\/\/\nstruct ffdc_struct\n{\n    const void* ptr;\n    int16_t size;\n};\n\n\nclass ffdc_t\n{\n    public:\n        ffdc_t(void)\n        {}\n\n        void operator=(const ffdc_t& i )\n        {\n            iv_value.ptr  = i.ptr();\n            iv_value.size = i.size();\n        }\n\n        operator const void* () const\n        {\n            return iv_value.ptr;\n        }\n        operator uint8_t() const\n        {\n            return *(reinterpret_cast<const uint8_t*>(iv_value.ptr));\n        }\n\n        int16_t size(void) const\n        {\n            return iv_value.size;\n        }\n        int16_t& size(void)\n        {\n            return iv_value.size;\n        }\n\n        const void* ptr(void) const\n        {\n            return iv_value.ptr;\n        }\n        const void*& ptr(void)\n        {\n            return iv_value.ptr;\n        }\n\n    private:\n        struct ffdc_struct iv_value = {}; \/\/init to zero\n};\n\n\/\/\/\n\/\/\/ @brief Enumeration of ErrorInfo FFDC sizes that are used to indicate a\n\/\/\/        special type that cannot simply be memcopied\nenum ErrorInfoFfdcSize\n{\n    EI_FFDC_SIZE_BUF    = 0xffff,   \/\/ fapi2::buffer<T>\n    EI_FFDC_SIZE_TARGET = 0xfffe,   \/\/ fapi2::Target\n    EI_FFDC_SIZE_VBUF   = 0xfffd,   \/\/ fapi2::variable_buffer\n    EI_FFDC_MAX_SIZE    = 0x1000,   \/\/ Limit regular FFDC capture to 4kb\n};\n\n\/\/\/\n\/\/\/ @brief Enumeration of error log severity.\n\/\/\/\nenum errlSeverity_t\n{\n    FAPI2_ERRL_SEV_UNDEFINED     = 0x00, \/\/\/ Used internally by ffdc mechanism\n    FAPI2_ERRL_SEV_RECOVERED     = 0x10, \/\/\/ Not seen by customer\n    FAPI2_ERRL_SEV_PREDICTIVE    = 0x20, \/\/\/ Error recovered but customer will see\n    FAPI2_ERRL_SEV_UNRECOVERABLE = 0x40  \/\/\/ Unrecoverable, general\n};\n\n\/\/\/\n\/\/\/ @brief Enumeration of ErrorInfo types\n\/\/\/\nenum ErrorInfoType\n{\n    EI_TYPE_FFDC              = 0,\n    EI_TYPE_HW_CALLOUT        = 1,\n    EI_TYPE_PROCEDURE_CALLOUT = 2,\n    EI_TYPE_BUS_CALLOUT       = 3,\n    EI_TYPE_CDG               = 4, \/\/ Target Callout\/Deconfig\/GARD\n    EI_TYPE_CHILDREN_CDG      = 5, \/\/ Children Callout\/Deconfig\/GARD\n    EI_TYPE_COLLECT_TRACE     = 6,\n    EI_LAST_TYPE              = EI_TYPE_COLLECT_TRACE + 1,\n};\n\n#ifndef MINIMUM_FFDC\n\/\/\/\n\/\/\/ @enum HwCallout\n\/\/\/\n\/\/\/ This enumeration defines the possible Hardware Callouts that are not\n\/\/\/ represented by fapi2::Targets\n\/\/\/\n\/\/\/ Note that platform code may depend on the enum values starting at 0 and\n\/\/\/ incrementing in order to efficiently convert to a platform callout value\n\/\/\/ so do not reorder without consulting all platforms\n\/\/\/\nnamespace HwCallouts\n{\nenum HwCallout\n{\n    \/\/ Where indicated, a HW Callout in FAPI Error XML must include a\n    \/\/ reference target that is used to identify the HW. e.g. for\n    \/\/ TOD_CLOCK, the proc chip that the clock is attached to must be\n    \/\/ specified\n    TOD_CLOCK           = 0, \/\/ Include proc-chip ref (or child chiplet)\n    MEM_REF_CLOCK       = 1, \/\/ Include membuf-chip ref (or child chiplet)\n    PROC_REF_CLOCK      = 2, \/\/ Include proc-chip ref (or child chiplet)\n    PCI_REF_CLOCK       = 3, \/\/ Include proc-chip ref (or child chiplet)\n    FLASH_CONTROLLER_PART      = 4,\n    PNOR_PART                  = 5,\n    SBE_SEEPROM_PART           = 6,\n    VPD_PART                   = 7,\n    LPC_SLAVE_PART             = 8,\n    GPIO_EXPANDER_PART         = 9,\n    SPIVID_SLAVE_PART          = 10,\n};\n}\n\n\/\/\/\n\/\/\/ @enum ProcedureCallout\n\/\/\/\n\/\/\/ This enumeration defines the possible Procedure Callouts\n\/\/\/ These instruct the customer\/customer-engineer what to do\n\/\/\/\n\/\/\/ Note that platform code may depend on the enum values starting at 0 and\n\/\/\/ incrementing in order to efficiently convert to a platform callout value\n\/\/\/ so do not reorder without consulting all platforms\n\/\/\/\nnamespace ProcedureCallouts\n{\nenum ProcedureCallout\n{\n    CODE                  = 0, \/\/ Code problem\n    LVL_SUPPORT           = 1, \/\/ Call next level of support\n    MEMORY_PLUGGING_ERROR = 2, \/\/ DIMM Plugging error\n    BUS_CALLOUT           = 3, \/\/ Bus Called Out\n};\n}\n\n\/\/\/\n\/\/\/ @enum CalloutPriority\n\/\/\/\n\/\/\/ This enumeration defines the possible Procedure and Target callout priorities\n\/\/\/\n\/\/\/ Note that platform code may depend on the enum values starting at 0 and\n\/\/\/ incrementing in order to efficiently convert to a platform priority value\n\/\/\/ so do not reorder without consulting all platforms\n\/\/\/\nnamespace CalloutPriorities\n{\nenum CalloutPriority\n{\n    LOW = 0,\n    MEDIUM = 1,\n    HIGH   = 2,\n};\n}\n\n\/\/\/\n\/\/\/ @enum CollectTrace\n\/\/\/\n\/\/\/ This enumeration defines the possible firmware traces to collect\n\/\/\/\nnamespace CollectTraces\n{\nconst uint32_t TRACE_SIZE = 256; \/\/ limit collected trace size\nenum CollectTrace\n{\n    FSI              = 1,\n    SCOM             = 2,\n    SCAN             = 3,\n    MBOX             = 4,\n};\n}\n\n\/\/ NOTE - this assumes no buffer_t or variable_buffers are passed\n\/\/        data is converted to a uint64_t when placed into the sbe ffdc\n\/\/        buffer\ninline fapi2::ffdc_t getFfdcData( sbeFfdc_t& i_sbeFfdc )\n{\n    fapi2::ffdc_t temp;\n\n    \/\/ passed in size is a uint32_t but, needs to be uint16_t\n    temp.size() = static_cast<uint16_t>(i_sbeFfdc.size);\n\n    if(temp.size() == EI_FFDC_SIZE_TARGET)\n    {\n#ifdef FAPI2_ENABLE_PLATFORM_GET_TARGET\n        uint64_t targetData = i_sbeFfdc.data;\n        fapi2::TargetType type = static_cast<fapi2::TargetType>(targetData >> 32);\n        uint8_t instance = static_cast<uint8_t>(targetData & 0xFFFFFFFF);\n        \/\/ call hostboot to get the fapi2 target reference\n        temp.ptr() = static_cast<void*>(getTarget<TARGET_TYPE_ALL>(type, instance));\n#endif\n    }\n    else\n    {\n        \/\/ adjust the pointer based on the data size.\n        temp.ptr() = static_cast<void*>(reinterpret_cast<uint8_t*>(&i_sbeFfdc.data) +\n                                        (sizeof(uint64_t) - i_sbeFfdc.size));\n    }\n\n    return temp;\n}\n#endif\n\/\/\/\n\/\/\/ @brief Get FFDC Size\n\/\/\/\n\/\/\/ This is called by the FAPI_SET_HWP_ERROR macro to find out the size of\n\/\/\/ FFDC data. If the data is of a special type that is handled differently\n\/\/\/ than types that are simply memcopied then it is handled by a template\n\/\/\/ specialization.\n\/\/\/ If this function template is instantiated with a pointer, the compile\n\/\/\/ will fail.\n\/\/\/\n\/\/\/ @return uint16_t. Size of the FFDC data\n\/\/\/\ntemplate<typename T>\ninline uint16_t getErrorInfoFfdcSize(const T&)\n{\n    static_assert(sizeof(T) <= EI_FFDC_MAX_SIZE,\n                  \"FFDC too large to capture\");\n    return sizeof(T);\n}\n#if !defined(MINIMUM_FFDC) && !defined(FAPI2_NO_FFDC)\n\/\/\/\n\/\/\/ @brief Compile error if caller tries to get the FFDC size of a pointer\n\/\/\/\ntemplate<typename T>\ninline uint16_t getErrorInfoFfdcSize(const T*)\n{\n    static_assert(std::is_pointer<T>::value,\n                  \"pointer passed to getErrorInfoFfdcSize\");\n    return 0;\n}\n#endif\n\/\/\/\n\/\/\/ @brief Get FFDC Size specialization for fapi2::Target\n\/\/\/\ntemplate<fapi2::TargetType T, typename V>\ninline uint16_t getErrorInfoFfdcSize(const fapi2::Target<T, V>&)\n{\n    return EI_FFDC_SIZE_TARGET;\n}\n\n#if !defined(MINIMUM_FFDC) && !defined(FAPI2_NO_FFDC)\n\/\/\/\n\/\/\/ @brief Get FFDC Size specialization for variable buffers\n\/\/\/\ntemplate<>\ninline uint16_t getErrorInfoFfdcSize(const fapi2::variable_buffer& i_thing)\n{\n    \/\/ Limit a variable buffer to 4kb bytes, and we can memcpy the storage.\n    return std::min(static_cast<uint32_t>(EI_FFDC_MAX_SIZE),\n                    i_thing.getLength<uint8_t>());\n}\n#endif\n};\n\n#endif \/\/ FAPI2_ERRORINFO_DEFS_H_\n<commit_msg>Change ffdc_t size member to size_t from int16_t<commit_after>\/* IBM_PROLOG_BEGIN_TAG                                                   *\/\n\/* This is an automatically generated prolog.                             *\/\n\/*                                                                        *\/\n\/* $Source: src\/import\/hwpf\/fapi2\/include\/error_info_defs.H $             *\/\n\/*                                                                        *\/\n\/* OpenPOWER HostBoot Project                                             *\/\n\/*                                                                        *\/\n\/* Contributors Listed Below - COPYRIGHT 2011,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 error_info_defs.H\n\/\/\/ @brief Defines to support the Error Information class\n\/\/\/\n\n#ifndef FAPI2_ERRORINFO_DEFS_H_\n#define FAPI2_ERRORINFO_DEFS_H_\n\n#include <stdint.h>\n#include <target.H>\n\n#if !defined(MINIMUM_FFDC) && !defined(FAPI2_NO_FFDC)\n    #include <variable_buffer.H>\n    #include <utility>\n#endif\nnamespace fapi2\n{\n\n\/\/\/\n\/\/\/ @brief Type to hold the ffdc data to be sent to hostboot\n\/\/\/\n\/\/\/ Note: Typical data sent seems to be register\/addresss info\n\/\/\/       rather than use extra space converting stuff just\n\/\/\/       send a uint64 always\n\/\/\/\nstruct sbeFfdc_t\n{\n    uint32_t  size;\n    uint64_t  data;\n};\n\n\/\/ 10 entries limits the size of SbeFfdcData_t to 128 bytes\nenum\n{\n    MAX_SBE_FFDC_ENTRIES = 10\n};\n\n\/\/ Data type for SBE ffdc buffer sent through fifo\ntypedef struct\n{\n    uint32_t  fapiRc;      \/\/ Return code from failure\n    uint32_t  ffdcLength;  \/\/ length of Fapi FFDC data (in bytes)\n    struct sbeFfdc_t ffdcData[MAX_SBE_FFDC_ENTRIES]; \/\/ fapi FFDC data\n} SbeFfdcData_t; \/\/ 128 bytes\n\n\/\/\/\n\/\/\/ @brief Type to hold the ffdc element in the ffdc class\n\/\/\/ Needed so that the size can be squirled away before the\n\/\/\/ macro is called.\n\/\/\/\nstruct ffdc_struct\n{\n    const void* ptr;\n    size_t size;\n};\n\n\nclass ffdc_t\n{\n    public:\n        ffdc_t(void)\n        {}\n\n        void operator=(const ffdc_t& i )\n        {\n            iv_value.ptr  = i.ptr();\n            iv_value.size = i.size();\n        }\n\n        operator const void* () const\n        {\n            return iv_value.ptr;\n        }\n        operator uint8_t() const\n        {\n            return *(reinterpret_cast<const uint8_t*>(iv_value.ptr));\n        }\n\n        size_t size(void) const\n        {\n            return iv_value.size;\n        }\n        size_t& size(void)\n        {\n            return iv_value.size;\n        }\n\n        const void* ptr(void) const\n        {\n            return iv_value.ptr;\n        }\n        const void*& ptr(void)\n        {\n            return iv_value.ptr;\n        }\n\n    private:\n        struct ffdc_struct iv_value = {}; \/\/init to zero\n};\n\n\/\/\/\n\/\/\/ @brief Enumeration of ErrorInfo FFDC sizes that are used to indicate a\n\/\/\/        special type that cannot simply be memcopied\nenum ErrorInfoFfdcSize\n{\n    EI_FFDC_SIZE_BUF    = 0xffff,   \/\/ fapi2::buffer<T>\n    EI_FFDC_SIZE_TARGET = 0xfffe,   \/\/ fapi2::Target\n    EI_FFDC_SIZE_VBUF   = 0xfffd,   \/\/ fapi2::variable_buffer\n    EI_FFDC_MAX_SIZE    = 0x1000,   \/\/ Limit regular FFDC capture to 4kb\n};\n\n\/\/\/\n\/\/\/ @brief Enumeration of error log severity.\n\/\/\/\nenum errlSeverity_t\n{\n    FAPI2_ERRL_SEV_UNDEFINED     = 0x00, \/\/\/ Used internally by ffdc mechanism\n    FAPI2_ERRL_SEV_RECOVERED     = 0x10, \/\/\/ Not seen by customer\n    FAPI2_ERRL_SEV_PREDICTIVE    = 0x20, \/\/\/ Error recovered but customer will see\n    FAPI2_ERRL_SEV_UNRECOVERABLE = 0x40  \/\/\/ Unrecoverable, general\n};\n\n\/\/\/\n\/\/\/ @brief Enumeration of ErrorInfo types\n\/\/\/\nenum ErrorInfoType\n{\n    EI_TYPE_FFDC              = 0,\n    EI_TYPE_HW_CALLOUT        = 1,\n    EI_TYPE_PROCEDURE_CALLOUT = 2,\n    EI_TYPE_BUS_CALLOUT       = 3,\n    EI_TYPE_CDG               = 4, \/\/ Target Callout\/Deconfig\/GARD\n    EI_TYPE_CHILDREN_CDG      = 5, \/\/ Children Callout\/Deconfig\/GARD\n    EI_TYPE_COLLECT_TRACE     = 6,\n    EI_LAST_TYPE              = EI_TYPE_COLLECT_TRACE + 1,\n};\n\n#ifndef MINIMUM_FFDC\n\/\/\/\n\/\/\/ @enum HwCallout\n\/\/\/\n\/\/\/ This enumeration defines the possible Hardware Callouts that are not\n\/\/\/ represented by fapi2::Targets\n\/\/\/\n\/\/\/ Note that platform code may depend on the enum values starting at 0 and\n\/\/\/ incrementing in order to efficiently convert to a platform callout value\n\/\/\/ so do not reorder without consulting all platforms\n\/\/\/\nnamespace HwCallouts\n{\nenum HwCallout\n{\n    \/\/ Where indicated, a HW Callout in FAPI Error XML must include a\n    \/\/ reference target that is used to identify the HW. e.g. for\n    \/\/ TOD_CLOCK, the proc chip that the clock is attached to must be\n    \/\/ specified\n    TOD_CLOCK           = 0, \/\/ Include proc-chip ref (or child chiplet)\n    MEM_REF_CLOCK       = 1, \/\/ Include membuf-chip ref (or child chiplet)\n    PROC_REF_CLOCK      = 2, \/\/ Include proc-chip ref (or child chiplet)\n    PCI_REF_CLOCK       = 3, \/\/ Include proc-chip ref (or child chiplet)\n    FLASH_CONTROLLER_PART      = 4,\n    PNOR_PART                  = 5,\n    SBE_SEEPROM_PART           = 6,\n    VPD_PART                   = 7,\n    LPC_SLAVE_PART             = 8,\n    GPIO_EXPANDER_PART         = 9,\n    SPIVID_SLAVE_PART          = 10,\n};\n}\n\n\/\/\/\n\/\/\/ @enum ProcedureCallout\n\/\/\/\n\/\/\/ This enumeration defines the possible Procedure Callouts\n\/\/\/ These instruct the customer\/customer-engineer what to do\n\/\/\/\n\/\/\/ Note that platform code may depend on the enum values starting at 0 and\n\/\/\/ incrementing in order to efficiently convert to a platform callout value\n\/\/\/ so do not reorder without consulting all platforms\n\/\/\/\nnamespace ProcedureCallouts\n{\nenum ProcedureCallout\n{\n    CODE                  = 0, \/\/ Code problem\n    LVL_SUPPORT           = 1, \/\/ Call next level of support\n    MEMORY_PLUGGING_ERROR = 2, \/\/ DIMM Plugging error\n    BUS_CALLOUT           = 3, \/\/ Bus Called Out\n};\n}\n\n\/\/\/\n\/\/\/ @enum CalloutPriority\n\/\/\/\n\/\/\/ This enumeration defines the possible Procedure and Target callout priorities\n\/\/\/\n\/\/\/ Note that platform code may depend on the enum values starting at 0 and\n\/\/\/ incrementing in order to efficiently convert to a platform priority value\n\/\/\/ so do not reorder without consulting all platforms\n\/\/\/\nnamespace CalloutPriorities\n{\nenum CalloutPriority\n{\n    LOW = 0,\n    MEDIUM = 1,\n    HIGH   = 2,\n};\n}\n\n\/\/\/\n\/\/\/ @enum CollectTrace\n\/\/\/\n\/\/\/ This enumeration defines the possible firmware traces to collect\n\/\/\/\nnamespace CollectTraces\n{\nconst uint32_t TRACE_SIZE = 256; \/\/ limit collected trace size\nenum CollectTrace\n{\n    FSI              = 1,\n    SCOM             = 2,\n    SCAN             = 3,\n    MBOX             = 4,\n};\n}\n\n\/\/ NOTE - this assumes no buffer_t or variable_buffers are passed\n\/\/        data is converted to a uint64_t when placed into the sbe ffdc\n\/\/        buffer\ninline fapi2::ffdc_t getFfdcData( sbeFfdc_t& i_sbeFfdc )\n{\n    fapi2::ffdc_t temp;\n\n    temp.size() = static_cast<size_t>(i_sbeFfdc.size);\n\n    if(temp.size() == EI_FFDC_SIZE_TARGET)\n    {\n#ifdef FAPI2_ENABLE_PLATFORM_GET_TARGET\n        uint64_t targetData = i_sbeFfdc.data;\n        fapi2::TargetType type = static_cast<fapi2::TargetType>(targetData >> 32);\n        uint8_t instance = static_cast<uint8_t>(targetData & 0xFFFFFFFF);\n        \/\/ call hostboot to get the fapi2 target reference\n        temp.ptr() = static_cast<void*>(getTarget<TARGET_TYPE_ALL>(type, instance));\n#endif\n    }\n    else\n    {\n        \/\/ adjust the pointer based on the data size.\n        temp.ptr() = static_cast<void*>(reinterpret_cast<uint8_t*>(&i_sbeFfdc.data) +\n                                        (sizeof(uint64_t) - i_sbeFfdc.size));\n    }\n\n    return temp;\n}\n#endif\n\/\/\/\n\/\/\/ @brief Get FFDC Size\n\/\/\/\n\/\/\/ This is called by the FAPI_SET_HWP_ERROR macro to find out the size of\n\/\/\/ FFDC data. If the data is of a special type that is handled differently\n\/\/\/ than types that are simply memcopied then it is handled by a template\n\/\/\/ specialization.\n\/\/\/ If this function template is instantiated with a pointer, the compile\n\/\/\/ will fail.\n\/\/\/\n\/\/\/ @return uint16_t. Size of the FFDC data\n\/\/\/\ntemplate<typename T>\ninline uint16_t getErrorInfoFfdcSize(const T&)\n{\n    static_assert(sizeof(T) <= EI_FFDC_MAX_SIZE,\n                  \"FFDC too large to capture\");\n    return sizeof(T);\n}\n#if !defined(MINIMUM_FFDC) && !defined(FAPI2_NO_FFDC)\n\/\/\/\n\/\/\/ @brief Compile error if caller tries to get the FFDC size of a pointer\n\/\/\/\ntemplate<typename T>\ninline uint16_t getErrorInfoFfdcSize(const T*)\n{\n    static_assert(std::is_pointer<T>::value,\n                  \"pointer passed to getErrorInfoFfdcSize\");\n    return 0;\n}\n#endif\n\/\/\/\n\/\/\/ @brief Get FFDC Size specialization for fapi2::Target\n\/\/\/\ntemplate<fapi2::TargetType T, typename V>\ninline uint16_t getErrorInfoFfdcSize(const fapi2::Target<T, V>&)\n{\n    return EI_FFDC_SIZE_TARGET;\n}\n\n#if !defined(MINIMUM_FFDC) && !defined(FAPI2_NO_FFDC)\n\/\/\/\n\/\/\/ @brief Get FFDC Size specialization for variable buffers\n\/\/\/\ntemplate<>\ninline uint16_t getErrorInfoFfdcSize(const fapi2::variable_buffer& i_thing)\n{\n    \/\/ Limit a variable buffer to 4kb bytes, and we can memcpy the storage.\n    return std::min(static_cast<uint32_t>(EI_FFDC_MAX_SIZE),\n                    i_thing.getLength<uint8_t>());\n}\n#endif\n};\n\n#endif \/\/ FAPI2_ERRORINFO_DEFS_H_\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\/browser_main_parts.h\"\n\n#include \"browser\/browser_context.h\"\n#include \"browser\/web_ui_controller_factory.h\"\n#include \"net\/proxy\/proxy_resolver_v8.h\"\n\n#if defined(USE_AURA)\n#include \"ui\/gfx\/screen.h\"\n#include \"ui\/views\/widget\/desktop_aura\/desktop_screen.h\"\n#endif\n\n#if defined(USE_AURA) && defined(USE_X11)\n#include \"chrome\/browser\/ui\/libgtk2ui\/gtk2_ui.h\"\n#include \"ui\/views\/linux_ui\/linux_ui.h\"\n#include \"ui\/wm\/core\/wm_state.h\"\n#endif\n\n#if defined(TOOLKIT_VIEWS)\n#include \"browser\/views\/views_delegate.h\"\n#endif\n\n#if defined(OS_WIN)\n#include \"ui\/base\/l10n\/l10n_util.h\"\n#include \"ui\/base\/l10n\/l10n_util_win.h\"\n#include \"ui\/gfx\/platform_font_win.h\"\n#endif\n\nnamespace brightray {\n\n#if defined(OS_WIN)\nnamespace {\n\n\/\/ gfx::Font callbacks\nvoid AdjustUIFont(LOGFONT* logfont) {\n  l10n_util::AdjustUIFont(logfont);\n}\n\nint GetMinimumFontSize() {\n  return 10;\n}\n\n}  \/\/ namespace\n#endif\n\nBrowserMainParts::BrowserMainParts() {\n}\n\nBrowserMainParts::~BrowserMainParts() {\n}\n\nvoid BrowserMainParts::PreEarlyInitialization() {\n#if defined(OS_MACOSX)\n  IncreaseFileDescriptorLimit();\n#endif\n\n#if defined(USE_AURA) && defined(USE_X11)\n  views::LinuxUI::SetInstance(BuildGtk2UI());\n#endif\n}\n\nvoid BrowserMainParts::ToolkitInitialized() {\n#if defined(USE_AURA) && defined(USE_X11)\n  views::LinuxUI::instance()->Initialize();\n  wm_state_.reset(new wm::WMState);\n#endif\n\n#if defined(TOOLKIT_VIEWS)\n  views_delegate_.reset(new ViewsDelegate);\n#endif\n\n#if defined(OS_WIN)\n  gfx::PlatformFontWin::adjust_font_callback = &AdjustUIFont;\n  gfx::PlatformFontWin::get_minimum_font_size_callback = &GetMinimumFontSize;\n#endif\n}\n\nvoid BrowserMainParts::PreMainMessageLoopStart() {\n#if defined(OS_MACOSX)\n  InitializeMainNib();\n#endif\n}\n\nvoid BrowserMainParts::PreMainMessageLoopRun() {\n  browser_context_.reset(CreateBrowserContext());\n  browser_context_->Initialize();\n\n  web_ui_controller_factory_.reset(\n      new WebUIControllerFactory(browser_context_.get()));\n  content::WebUIControllerFactory::RegisterFactory(\n      web_ui_controller_factory_.get());\n}\n\nvoid BrowserMainParts::PostMainMessageLoopRun() {\n  browser_context_.reset();\n}\n\nint BrowserMainParts::PreCreateThreads() {\n#if defined(USE_AURA)\n  gfx::Screen::SetScreenInstance(gfx::SCREEN_TYPE_NATIVE,\n                                 views::CreateDesktopScreen());\n#endif\n\n  InitProxyResolverV8();\n  return 0;\n}\n\nBrowserContext* BrowserMainParts::CreateBrowserContext() {\n  return new BrowserContext;\n}\n\nvoid BrowserMainParts::InitProxyResolverV8() {\n#if defined(OS_WIN)\n  net::ProxyResolverV8::CreateIsolate();\n#else\n  net::ProxyResolverV8::RememberDefaultIsolate();\n#endif\n}\n\n}  \/\/ namespace brightray\n<commit_msg>Interface of ProxyResolverV8 has changed.<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\/browser_main_parts.h\"\n\n#include \"browser\/browser_context.h\"\n#include \"browser\/web_ui_controller_factory.h\"\n#include \"net\/proxy\/proxy_resolver_v8.h\"\n\n#if defined(USE_AURA)\n#include \"ui\/gfx\/screen.h\"\n#include \"ui\/views\/widget\/desktop_aura\/desktop_screen.h\"\n#endif\n\n#if defined(USE_AURA) && defined(USE_X11)\n#include \"chrome\/browser\/ui\/libgtk2ui\/gtk2_ui.h\"\n#include \"ui\/views\/linux_ui\/linux_ui.h\"\n#include \"ui\/wm\/core\/wm_state.h\"\n#endif\n\n#if defined(TOOLKIT_VIEWS)\n#include \"browser\/views\/views_delegate.h\"\n#endif\n\n#if defined(OS_WIN)\n#include \"ui\/base\/l10n\/l10n_util.h\"\n#include \"ui\/base\/l10n\/l10n_util_win.h\"\n#include \"ui\/gfx\/platform_font_win.h\"\n#endif\n\nnamespace brightray {\n\n#if defined(OS_WIN)\nnamespace {\n\n\/\/ gfx::Font callbacks\nvoid AdjustUIFont(LOGFONT* logfont) {\n  l10n_util::AdjustUIFont(logfont);\n}\n\nint GetMinimumFontSize() {\n  return 10;\n}\n\n}  \/\/ namespace\n#endif\n\nBrowserMainParts::BrowserMainParts() {\n}\n\nBrowserMainParts::~BrowserMainParts() {\n}\n\nvoid BrowserMainParts::PreEarlyInitialization() {\n#if defined(OS_MACOSX)\n  IncreaseFileDescriptorLimit();\n#endif\n\n#if defined(USE_AURA) && defined(USE_X11)\n  views::LinuxUI::SetInstance(BuildGtk2UI());\n#endif\n}\n\nvoid BrowserMainParts::ToolkitInitialized() {\n#if defined(USE_AURA) && defined(USE_X11)\n  views::LinuxUI::instance()->Initialize();\n  wm_state_.reset(new wm::WMState);\n#endif\n\n#if defined(TOOLKIT_VIEWS)\n  views_delegate_.reset(new ViewsDelegate);\n#endif\n\n#if defined(OS_WIN)\n  gfx::PlatformFontWin::adjust_font_callback = &AdjustUIFont;\n  gfx::PlatformFontWin::get_minimum_font_size_callback = &GetMinimumFontSize;\n#endif\n}\n\nvoid BrowserMainParts::PreMainMessageLoopStart() {\n#if defined(OS_MACOSX)\n  InitializeMainNib();\n#endif\n}\n\nvoid BrowserMainParts::PreMainMessageLoopRun() {\n  browser_context_.reset(CreateBrowserContext());\n  browser_context_->Initialize();\n\n  web_ui_controller_factory_.reset(\n      new WebUIControllerFactory(browser_context_.get()));\n  content::WebUIControllerFactory::RegisterFactory(\n      web_ui_controller_factory_.get());\n}\n\nvoid BrowserMainParts::PostMainMessageLoopRun() {\n  browser_context_.reset();\n}\n\nint BrowserMainParts::PreCreateThreads() {\n#if defined(USE_AURA)\n  gfx::Screen::SetScreenInstance(gfx::SCREEN_TYPE_NATIVE,\n                                 views::CreateDesktopScreen());\n#endif\n\n  InitProxyResolverV8();\n  return 0;\n}\n\nBrowserContext* BrowserMainParts::CreateBrowserContext() {\n  return new BrowserContext;\n}\n\nvoid BrowserMainParts::InitProxyResolverV8() {\n  net::ProxyResolverV8::EnsureIsolateCreated();\n}\n\n}  \/\/ namespace brightray\n<|endoftext|>"}
{"text":"<commit_before>#include <pd_view.h>\n#include <pd_backend.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstruct Line\n{\n    const char* text;\n    bool breakpoint;        \/\/ TODO: Flags\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstruct DissassemblyData\n{\n    char* code;\n    Line* lines;\n    int lineCount;\n    uint64_t pc;\n    uint64_t location;\n    uint8_t locationSize;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic void splitIntoLines(DissassemblyData* data, char* code, size_t size)\n{\n    int lineCount = 0;\n    Line* lines;\n\n    char* target = code;\n    char* targetEnd = code + size;\n\n    free(data->lines);\n\n    \/\/ so this is really waste of memory but will do for now\n\n    data->lines = lines = (Line*)malloc(sizeof(Line) * size);\n    memset(lines, 0, sizeof(Line) * size);\n\n    lines[0].text = target;\n    lineCount++;\n\n    while (target < targetEnd)\n    {\n        char c = *target;\n\n        if (*target == '\\r')\n        {\n            *target++ = 0;\n            c = *target;\n        }\n\n        if (*target == '\\n')\n        {\n            *target = 0;\n            lines[lineCount++].text = target + 1;\n        }\n\n        target++;\n    }\n\n    *target++ = 0;\n    data->lineCount = lineCount;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic void* createInstance(PDUI* uiFuncs, ServiceFunc* serviceFunc)\n{\n    (void)serviceFunc;\n    DissassemblyData* userData = (DissassemblyData*)malloc(sizeof(DissassemblyData));\n    memset(userData, 0, sizeof(DissassemblyData));\n\n    (void)uiFuncs;\n    (void)serviceFunc;\n\n    return userData;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic void destroyInstance(void* userData)\n{\n    free(userData);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic void setDisassemblyCode(DissassemblyData* data, PDReader* inEvents)\n{\n    const char* stringBuffer;\n\n    PDRead_findString(inEvents, &stringBuffer, \"string_buffer\", 0);\n\n    \/\/printf(\"Got disassembly\\n\");\n    \/\/printf(\"disassembly %s\\n\", stringBuffer);\n\n    free(data->code);\n\n    if (!stringBuffer)\n        return;\n\n    data->code = strdup(stringBuffer);\n\n    splitIntoLines(data, data->code, strlen(stringBuffer));\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid renderUI(DissassemblyData* data, PDUI* uiFuncs)\n{\n    if (!data->code)\n        return;\n\n    uiFuncs->text(\"\");  \/\/ TODO: Temporary\n\n    char tempBuffer[64];\n    sprintf(tempBuffer, \"%04X\", (uint16_t)data->pc);\n\n    for (int i = 0; i < data->lineCount; ++i)\n    {\n        if (strstr(data->lines[i].text, tempBuffer))\n        {\n            PDRect rect;\n            PDVec2 pos = uiFuncs->getCursorPos();\n            rect.x = pos.x;\n            rect.y = pos.y - 11;\n            rect.width = -1;\n            rect.height = 14;\n            uiFuncs->fillRect(rect, PD_COLOR_32(200, 0, 0, 127));\n        }\n\n        uiFuncs->text(data->lines[i].text);\n    }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic void updateRegisters(DissassemblyData* data, PDReader* reader)\n{\n    PDReaderIterator it;\n\n    if (PDRead_findArray(reader, &it, \"registers\", 0) == PDReadStatus_notFound)\n        return;\n\n    while (PDRead_getNextEntry(reader, &it))\n    {\n        const char* name = \"\";\n\n        PDRead_findString(reader, &name, \"name\", it);\n\n        if (!strcmp(name, \"pc\"))\n        {\n            PDRead_findU64(reader, &data->pc, \"register\", it);\n        }\n    }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic int update(void* userData, PDUI* uiFuncs, PDReader* inEvents, PDWriter* writer)\n{\n    uint32_t event;\n\n    DissassemblyData* data = (DissassemblyData*)userData;\n\n    while ((event = PDRead_getEvent(inEvents)) != 0)\n    {\n        switch (event)\n        {\n            case PDEventType_setDisassembly:\n            {\n                setDisassemblyCode(data, inEvents);\n                break;\n            }\n\n            case PDEventType_setExceptionLocation:\n            {\n                PDRead_findU64(inEvents, &data->location, \"address\", 0);\n                PDRead_findU8(inEvents, &data->locationSize, \"address_size\", 0);\n                break;\n            }\n\n            case PDEventType_setRegisters:\n                updateRegisters(data, inEvents); break;\n\n        }\n    }\n\n    renderUI(data, uiFuncs);\n\n    \/\/ Temporary req\n\n    PDWrite_eventBegin(writer, PDEventType_getDisassembly);\n    PDWrite_u64(writer, \"address_start\", 0);\n    PDWrite_u32(writer, \"instruction_count\", (uint32_t)10);\n    PDWrite_eventEnd(writer);\n\n    return 0;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic PDViewPlugin plugin =\n{\n    \"Disassembly\",\n    createInstance,\n    destroyInstance,\n    update,\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nextern \"C\"\n{\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n    PD_EXPORT void InitPlugin(RegisterPlugin* registerPlugin, void* privateData)\n    {\n        registerPlugin(PD_VIEW_API_VERSION, &plugin, privateData);\n    }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n}\n\n<commit_msg>Use new disassembly format that is array based<commit_after>#include <pd_view.h>\n#include <pd_backend.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstruct Line\n{\n    uint64_t address;\n    const char* text;\n    bool breakpoint;\n    uint8_t addressSize;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstruct DisassemblyRange\n{\n    Line* lines;\n    int lineCount;\n    uint64_t rangeStart;\n    uint64_t rangeEnd;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstruct DissassemblyData\n{\n\tDisassemblyRange range;\n\tuint64_t location;\n\tuint64_t pc;\n\tuint8_t locationSize;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic void* createInstance(PDUI* uiFuncs, ServiceFunc* serviceFunc)\n{\n    (void)serviceFunc;\n    DissassemblyData* userData = (DissassemblyData*)malloc(sizeof(DissassemblyData));\n    memset(userData, 0, sizeof(DissassemblyData));\n\n    (void)uiFuncs;\n    (void)serviceFunc;\n\n    return userData;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic void destroyInstance(void* userData)\n{\n    free(userData);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic void freeRange(DisassemblyRange* range)\n{\n\tfor (int i = 0, end = range->lineCount; i < end; ++i)\n\t\tfree((void*)range->lines[i].text);\n\n\tfree(range->lines);\n\n\trange->lineCount = 0;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic void setDisassemblyCode(DissassemblyData* data, PDReader* reader)\n{\n\tLine* line;\n\n    PDReaderIterator it;\n\n    if (PDRead_findArray(reader, &it, \"disassembly\", 0) == PDReadStatus_notFound)\n        return;\n\n\tfreeRange(&data->range);\n\n    int linesCount = 0;\n\n    PDReaderIterator t = it;\n\n    while (PDRead_getNextEntry(reader, &t))\n    {\n    \tlinesCount++;\n    }\n\n    data->range.lines = line = (Line*)malloc((size_t)linesCount * sizeof(Line));\n    data->range.lineCount = linesCount;\n\n    while (PDRead_getNextEntry(reader, &it))\n    {\n    \tconst char* text;\n    \tline->breakpoint = false;\n\n\t\tline->addressSize = (uint8_t)PDRead_findU64(reader, &line->address, \"address\", it);\n\n\t\tPDRead_findString(reader, &text, \"line\", it);\n\n\t\tline->text = strdup(text);\n\n\t\tline++;\n    }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid renderUI(DissassemblyData* data, PDUI* uiFuncs)\n{\n    uiFuncs->text(\"\");  \/\/ TODO: Temporary\n\n    for (int i = 0; i < data->range.lineCount; ++i)\n    {\n        if (data->range.lines[i].address == data->pc) \n        {\n            PDRect rect;\n            PDVec2 pos = uiFuncs->getCursorPos();\n            rect.x = pos.x;\n            rect.y = pos.y;\n            rect.width = 400;\n            rect.height = 14;\n            uiFuncs->fillRect(rect, PD_COLOR_32(200, 0, 0, 127));\n        }\n\n        uiFuncs->text(\"0x%04x %s\", (uint64_t)data->range.lines[i].address, data->range.lines[i].text);\n    }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic void updateRegisters(DissassemblyData* data, PDReader* reader)\n{\n    PDReaderIterator it;\n\n    if (PDRead_findArray(reader, &it, \"registers\", 0) == PDReadStatus_notFound)\n        return;\n\n    while (PDRead_getNextEntry(reader, &it))\n    {\n        const char* name = \"\";\n\n        PDRead_findString(reader, &name, \"name\", it);\n\n        if (!strcmp(name, \"pc\"))\n        {\n            PDRead_findU64(reader, &data->pc, \"register\", it);\n        }\n    }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic int update(void* userData, PDUI* uiFuncs, PDReader* inEvents, PDWriter* writer)\n{\n    uint32_t event;\n\n    DissassemblyData* data = (DissassemblyData*)userData;\n\n    while ((event = PDRead_getEvent(inEvents)) != 0)\n    {\n        switch (event)\n        {\n            case PDEventType_setDisassembly:\n            {\n                setDisassemblyCode(data, inEvents);\n                break;\n            }\n\n            case PDEventType_setExceptionLocation:\n            {\n                PDRead_findU64(inEvents, &data->location, \"address\", 0);\n                PDRead_findU8(inEvents, &data->locationSize, \"address_size\", 0);\n                break;\n            }\n\n            case PDEventType_setRegisters:\n                updateRegisters(data, inEvents); break;\n\n        }\n    }\n\n    renderUI(data, uiFuncs);\n\n    \/\/ Temporary req\n\n\tint pc = (int)(data->pc) - 0x20;\n\n\tif (pc < 0)\n\t\tpc = 0;\n\n    PDWrite_eventBegin(writer, PDEventType_getDisassembly);\n    PDWrite_u64(writer, \"address_start\", (uint64_t)pc); \n    PDWrite_u32(writer, \"instruction_count\", (uint32_t)20);\n    PDWrite_eventEnd(writer);\n\n    return 0;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic PDViewPlugin plugin =\n{\n    \"Disassembly\",\n    createInstance,\n    destroyInstance,\n    update,\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nextern \"C\"\n{\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nPD_EXPORT void InitPlugin(RegisterPlugin* registerPlugin, void* privateData)\n{\n\tregisterPlugin(PD_VIEW_API_VERSION, &plugin, privateData);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/\/ StringUtil.hh for fluxbox \n\/\/ Copyright (c) 2001 - 2006 Henrik Kinnunen (fluxgen at fluxbox dot org)\n\/\/ \n\/\/ Permission is hereby granted, free of charge, to any person obtaining a\n\/\/ copy of this software and associated documentation files (the \"Software\"),\n\/\/ to deal in the Software without restriction, including without limitation\n\/\/ the rights to use, copy, modify, merge, publish, distribute, sublicense,\n\/\/ and\/or sell copies of the Software, and to permit persons to whom the\n\/\/ Software is furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. 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 FBTK_STRINGUTIL_HH\n#define FBTK_STRINGUTIL_HH\n\n#include <string>\n\nnamespace FbTk {\n\nnamespace StringUtil {\n\n\/\/\/ \\@{\n\/\/\/ @param in - input string, might be 0xab or 0123\n\/\/\/ @param out - result if extraction was ok\n\/\/\/ @return 1 - ok, result stored in 'out'\nint extractNumber(const std::string& in, unsigned int& out);\nint extractNumber(const std::string& in, int& out);\nint extractNumber(const std::string& in, long& out);\nint extractNumber(const std::string& in, long long& out);\nint extractNumber(const std::string& in, unsigned long& out);\nint extractNumber(const std::string& in, unsigned long long& out);\n\/\/\/ \\@}\n\n\/\/\/ creates a number to a string\nstd::string number2String(long long num);\nstd::string number2HexString(long long num);\n\n\/\/\/ Similar to `strstr' but this function ignores the case of both strings\nconst char *strcasestr(const char *str, const char *ptn);\n\n\/\/\/ expands ~ to value of ${HOME} enviroment variable\nstd::string expandFilename(const std::string &filename);\n\n\/\/\/ @return extension of filename (ex: filename.txt will return txt)\nstd::string findExtension(const std::string &filename);\n\n\/\/\/ is the char after a 'trigger' part of an alphabet?\n\/\/\/ @param in - string to analyze\n\/\/\/ @param trigger - check for char after trigger\n\/\/\/ @param alphabet - contains chars to search for\n\/\/\/ @param len_alphabet - length of alphabet\n\/\/\/ @param found - position of found char in alphabet (optional)\n\/\/\/ @return position of trigger if found\n\/\/\/ @return std::string::npos if nothing found\nstd::string::size_type findCharFromAlphabetAfterTrigger(const std::string& in, \n    char trigger,\n    const char alphabet[], size_t len_alphabet, size_t* found);\n\n\/\/\/ @return copy of original with find_string replaced with \"replace\"\nstd::string replaceString(const std::string &original, \n                          const char *find_string,\n                          const char *replace);\n\n\/\/\/  returns string between character first and last\nint getStringBetween(std::string& out, const char *instr,\n                     char first, char last,\n                     const char *ok_chars=\" \\t\\n\", bool allow_nesting = false);\n\n\/\/\/ @return lower case letters of conv\nstd::string toLower(const std::string &conv);\n\/\/\/ @return upper case letters of conv\nstd::string toUpper(const std::string &conv);\n#ifdef basename\n#undef basename\n#endif \/\/ basename\nstd::string basename(const std::string &basename);\n\n\n\/\/\/ removes the first whitespace characters of the string\nstd::string::size_type removeFirstWhitespace(std::string &str);\nstd::string::size_type removeTrailingWhitespace(std::string &str);\n\n\/\/\/ splits input at first non-leading whitespace and returns both parts\nvoid getFirstWord(const std::string &in, std::string &first, std::string &rest);\n\ntemplate <typename Container>\nstatic void stringTokensBetween(Container &container, const std::string &in,\n        std::string &rest, char first, char last,\n        const char *ok_chars = \" \\t\\n\", bool allow_nesting = true) {\n\n    std::string token;\n    int err = 0, pos = 0;\n\n    while (true) {\n        err = getStringBetween(token, in.c_str() + pos, first, last, ok_chars,\n                               allow_nesting);\n        if (err <= 0)\n            break;\n        container.push_back(token);\n        pos += err;\n    }\n\n    rest = in.c_str() + pos;\n\n}\n\n\/\/\/ Breaks a string into tokens\ntemplate <typename Container>\nstatic void\nstringtok (Container &container, std::string const &in,\n           const char * const delimiters = \" \\t\\n\") {\n\n    const std::string::size_type len = in.length();\n    std::string::size_type i = 0;\n\n    while ( i < len ) {\n        \/\/ eat leading whitespace\n        i = in.find_first_not_of(delimiters, i);\n        if (i == std::string::npos)\n            return;   \/\/ nothing left but white space\n\n        \/\/ find the end of the token\n        std::string::size_type j = in.find_first_of(delimiters, i);\n\n        \/\/ push token\n        if (j == std::string::npos) {\n            container.push_back(in.substr(i));\n            return;\n        } else\n            container.push_back(in.substr(i, j-i));\n\n        \/\/ set up for next loop\n        i = j + 1;\n    }\n}\n\n} \/\/ end namespace StringUtil\n\n} \/\/ end namespace FbTk\n\n\n#endif \/\/ FBTK_STRINGUTIL_HH\n<commit_msg>Reduce the scope of the variable err in stringTokensBetween.<commit_after>\/\/ StringUtil.hh for fluxbox \n\/\/ Copyright (c) 2001 - 2006 Henrik Kinnunen (fluxgen at fluxbox dot org)\n\/\/ \n\/\/ Permission is hereby granted, free of charge, to any person obtaining a\n\/\/ copy of this software and associated documentation files (the \"Software\"),\n\/\/ to deal in the Software without restriction, including without limitation\n\/\/ the rights to use, copy, modify, merge, publish, distribute, sublicense,\n\/\/ and\/or sell copies of the Software, and to permit persons to whom the\n\/\/ Software is furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. 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 FBTK_STRINGUTIL_HH\n#define FBTK_STRINGUTIL_HH\n\n#include <string>\n\nnamespace FbTk {\n\nnamespace StringUtil {\n\n\/\/\/ \\@{\n\/\/\/ @param in - input string, might be 0xab or 0123\n\/\/\/ @param out - result if extraction was ok\n\/\/\/ @return 1 - ok, result stored in 'out'\nint extractNumber(const std::string& in, unsigned int& out);\nint extractNumber(const std::string& in, int& out);\nint extractNumber(const std::string& in, long& out);\nint extractNumber(const std::string& in, long long& out);\nint extractNumber(const std::string& in, unsigned long& out);\nint extractNumber(const std::string& in, unsigned long long& out);\n\/\/\/ \\@}\n\n\/\/\/ creates a number to a string\nstd::string number2String(long long num);\nstd::string number2HexString(long long num);\n\n\/\/\/ Similar to `strstr' but this function ignores the case of both strings\nconst char *strcasestr(const char *str, const char *ptn);\n\n\/\/\/ expands ~ to value of ${HOME} enviroment variable\nstd::string expandFilename(const std::string &filename);\n\n\/\/\/ @return extension of filename (ex: filename.txt will return txt)\nstd::string findExtension(const std::string &filename);\n\n\/\/\/ is the char after a 'trigger' part of an alphabet?\n\/\/\/ @param in - string to analyze\n\/\/\/ @param trigger - check for char after trigger\n\/\/\/ @param alphabet - contains chars to search for\n\/\/\/ @param len_alphabet - length of alphabet\n\/\/\/ @param found - position of found char in alphabet (optional)\n\/\/\/ @return position of trigger if found\n\/\/\/ @return std::string::npos if nothing found\nstd::string::size_type findCharFromAlphabetAfterTrigger(const std::string& in, \n    char trigger,\n    const char alphabet[], size_t len_alphabet, size_t* found);\n\n\/\/\/ @return copy of original with find_string replaced with \"replace\"\nstd::string replaceString(const std::string &original, \n                          const char *find_string,\n                          const char *replace);\n\n\/\/\/  returns string between character first and last\nint getStringBetween(std::string& out, const char *instr,\n                     char first, char last,\n                     const char *ok_chars=\" \\t\\n\", bool allow_nesting = false);\n\n\/\/\/ @return lower case letters of conv\nstd::string toLower(const std::string &conv);\n\/\/\/ @return upper case letters of conv\nstd::string toUpper(const std::string &conv);\n#ifdef basename\n#undef basename\n#endif \/\/ basename\nstd::string basename(const std::string &basename);\n\n\n\/\/\/ removes the first whitespace characters of the string\nstd::string::size_type removeFirstWhitespace(std::string &str);\nstd::string::size_type removeTrailingWhitespace(std::string &str);\n\n\/\/\/ splits input at first non-leading whitespace and returns both parts\nvoid getFirstWord(const std::string &in, std::string &first, std::string &rest);\n\ntemplate <typename Container>\nstatic void stringTokensBetween(Container &container, const std::string &in,\n        std::string &rest, char first, char last,\n        const char *ok_chars = \" \\t\\n\", bool allow_nesting = true) {\n\n    std::string token;\n    int pos = 0;\n\n    while (true) {\n        int err = getStringBetween(token, in.c_str() + pos, first, last, ok_chars,\n                               allow_nesting);\n        if (err <= 0)\n            break;\n        container.push_back(token);\n        pos += err;\n    }\n\n    rest = in.c_str() + pos;\n\n}\n\n\/\/\/ Breaks a string into tokens\ntemplate <typename Container>\nstatic void\nstringtok (Container &container, std::string const &in,\n           const char * const delimiters = \" \\t\\n\") {\n\n    const std::string::size_type len = in.length();\n    std::string::size_type i = 0;\n\n    while ( i < len ) {\n        \/\/ eat leading whitespace\n        i = in.find_first_not_of(delimiters, i);\n        if (i == std::string::npos)\n            return;   \/\/ nothing left but white space\n\n        \/\/ find the end of the token\n        std::string::size_type j = in.find_first_of(delimiters, i);\n\n        \/\/ push token\n        if (j == std::string::npos) {\n            container.push_back(in.substr(i));\n            return;\n        } else\n            container.push_back(in.substr(i, j-i));\n\n        \/\/ set up for next loop\n        i = j + 1;\n    }\n}\n\n} \/\/ end namespace StringUtil\n\n} \/\/ end namespace FbTk\n\n\n#endif \/\/ FBTK_STRINGUTIL_HH\n<|endoftext|>"}
{"text":"<commit_before>\/* ---------------------------------------------------------------------\n * Numenta Platform for Intelligent Computing (NuPIC)\n * Copyright (C) 2014, 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 * Definitions for the Connections class in C++\n *\/\n\n#ifndef NTA_CONNECTIONS_HPP\n#define NTA_CONNECTIONS_HPP\n\n#include <vector>\n#include <utility>\n#include <nta\/types\/Types.hpp>\n#include <nta\/math\/Math.hpp>\n\nnamespace nta\n{\n\n  namespace algorithms\n  {\n\n    namespace connections\n    {\n      typedef UInt32 CellIdx;\n      typedef unsigned char SegmentIdx;\n      typedef unsigned char SynapseIdx;\n      typedef Real32 Permanence;\n      typedef UInt64 Iteration;\n\n      \/**\n       * Cell class used in Connections.\n       *\n       * @b Description\n       * The Cell class is a data structure that points to a particular cell.\n       *\n       * @param idx Index of cell.\n       *\n       *\/\n      struct Cell\n      {\n        CellIdx idx;\n\n        Cell(CellIdx idx) : idx(idx) {}\n        Cell() {}\n\n        bool operator==(const Cell &other) const;\n        bool operator<=(const Cell &other) const;\n        bool operator<(const Cell &other) const;\n        bool operator>=(const Cell &other) const;\n        bool operator>(const Cell &other) const;\n      };\n\n      \/**\n       * Segment class used in Connections.\n       *\n       * @b Description\n       * The Segment class is a data structure that points to a particular\n       * segment on a particular cell.\n       *\n       * @param idx     Index of segment.\n       * @param cellIdx Index of cell.\n       *\n       *\/\n      struct Segment\n      {\n        SegmentIdx idx;\n        Cell cell;\n\n        Segment(SegmentIdx idx, Cell cell) : idx(idx), cell(cell) {}\n        Segment() {}\n\n        bool operator==(const Segment &other) const;\n        bool operator<=(const Segment &other) const;\n        bool operator<(const Segment &other) const;\n        bool operator>=(const Segment &other) const;\n        bool operator>(const Segment &other) const;\n      };\n\n      \/**\n       * Synapse class used in Connections.\n       *\n       * @b Description\n       * The Synapse class is a data structure that points to a particular\n       * synapse on a particular segment on a particular cell.\n       *\n       * @param idx        Index of synapse in segment.\n       * @param segmentIdx Index of segment in cell.\n       * @param cellIdx    Index of cell.\n       *\n       *\/\n      struct Synapse\n      {\n        SynapseIdx idx;\n        Segment segment;\n\n        Synapse(SynapseIdx idx, Segment segment) : idx(idx), segment(segment) {}\n        Synapse() {}\n\n        bool operator==(const Synapse &other) const;\n      };\n\n      \/**\n       * SynapseData class used in Connections.\n       *\n       * @b Description\n       * The SynapseData class is a data structure that contains the data for a\n       * synapse on a segment.\n       *\n       * @param presynapticCellIdx Cell that this synapse gets input from.\n       * @param permanence         Permanence of synapse.\n       * @param destroyed          Whether this synapse has been destroyed.\n       *\n       *\/\n      struct SynapseData\n      {\n        Cell presynapticCell;\n        Permanence permanence;\n        bool destroyed;\n      };\n\n      \/**\n       * SegmentData class used in Connections.\n       *\n       * @b Description\n       * The SegmentData class is a data structure that contains the data for a\n       * segment on a cell.\n       *\n       * @param synapses          Data for synapses that this segment contains.\n       * @param destroyed         Whether this segment has been destroyed.\n       * @param lastUsedIteration The iteration that this segment was last used at.\n       *\n       *\/\n      struct SegmentData\n      {\n        std::vector<SynapseData> synapses;\n        bool destroyed;\n        Iteration lastUsedIteration;\n      };\n\n      \/**\n       * CellData class used in Connections.\n       *\n       * @b Description\n       * The CellData class is a data structure that contains the data for a\n       * cell.\n       *\n       * @param segments Data for segments that this cell contains.\n       *\n       *\/\n      struct CellData\n      {\n        std::vector<SegmentData> segments;\n      };\n\n      \/**\n       * Activity class used in Connections.\n       *\n       * @b Description\n       * The Activity class is a data structure that represents the\n       * activity of a collection of cells, as computed by propagating\n       * input through connections.\n       *\n       *\/\n      struct Activity\n      {\n        std::map< Cell, std::vector<Segment> > activeSegmentsForCell;\n        std::map<Segment, UInt> numActiveSynapsesForSegment;\n      };\n\n      \/**\n       * Connections implementation in C++.\n       *\n       * @b Description\n       * The Connections class is a data structure that represents the\n       * connections of a collection of cells. It is used in the HTM\n       * learning algorithms to store and access data related to the\n       * connectivity of cells.\n       *\n       * It's main utility is to provide a common, optimized data structure\n       * that all HTM learning algorithms can use. It is flexible enough to\n       * support any learning algorithm that operates on a collection of cells.\n       *\n       * Each type of connection (proximal, distal, apical) should be\n       * represented by a different instantiation of this class. This class\n       * will help compute the activity along those connections due to active\n       * input cells. The responsibility for what effect that activity has on\n       * the cells and connections lies in the user of this class.\n       *\n       * This class is optimized to store connections between cells, and\n       * compute the activity of cells due to input over the connections.\n       *\n       *\/\n      class Connections\n      {\n      public:\n        Connections(CellIdx numCells);\n\n        virtual ~Connections() {}\n\n        \/**\n         * Creates a segment on the specified cell.\n         *\n         * @param cell Cell to create segment on.\n         *\n         * @retval Created segment.\n         *\/\n        Segment createSegment(const Cell& cell);\n\n        \/**\n         * Creates a synapse on the specified segment.\n         *\n         * @param segment         Segment to create synapse on.\n         * @param presynapticCell Cell to synapse on.\n         * @param permanence      Initial permanence of new synapse.\n         *\n         * @reval Created synapse.\n         *\/\n        Synapse createSynapse(const Segment& segment,\n                              const Cell& presynapticCell,\n                              Permanence permanence);\n\n        \/**\n         * Destroys segment.\n         *\n         * @param segment Segment to destroy.\n         *\/\n        void destroySegment(const Segment& segment);\n\n        \/**\n         * Destroys synapse.\n         *\n         * @param synapse Synapse to destroy.\n         *\/\n        void destroySynapse(const Synapse& synapse);\n\n        \/**\n         * Updates a synapse's permanence.\n         *\n         * @param synapse    Synapse to update.\n         * @param permanence New permanence.\n         *\/\n        void updateSynapsePermanence(const Synapse& synapse,\n                                     Permanence permanence);\n\n        \/**\n         * Gets the segments for a cell.\n         *\n         * @param cell Cell to get segments for.\n         *\n         * @retval Segments on cell.\n         *\/\n        std::vector<Segment> segmentsForCell(const Cell& cell) const;\n\n        \/**\n         * Gets the synapses for a segment.\n         *\n         * @param segment Segment to get synapses for.\n         *\n         * @retval Synapses on segment.\n         *\/\n        std::vector<Synapse> synapsesForSegment(const Segment& segment);\n\n        \/**\n         * Gets the data for a segment.\n         *\n         * @param segment Segment to get data for.\n         *\n         * @retval Segment data.\n         *\/\n        SegmentData dataForSegment(const Segment& segment) const;\n\n        \/**\n         * Gets the data for a synapse.\n         *\n         * @param synapse Synapse to get data for.\n         *\n         * @retval Synapse data.\n         *\/\n        SynapseData dataForSynapse(const Synapse& synapse) const;\n\n        \/**\n         * Gets the segment with the most active synapses due to given input,\n         * from among all the segments on all the given cells.\n         *\n         * @param cells            Cells to look among.\n         * @param input            Active cells in the input.\n         * @param synapseThreshold Only consider segments with number of active synapses greater than this threshold.\n         * @param retSegment       Segment to return.\n         *\n         * @retval Segment found?\n         *\/\n        bool mostActiveSegmentForCells(const std::vector<Cell>& cells,\n                                       std::vector<Cell> input,\n                                       UInt synapseThreshold,\n                                       Segment& retSegment) const;\n\n        \/**\n         * Gets the segment that was least recently used from among all the\n         * segments on the given cell.\n         *\n         * @param cell       Cell whose segments to consider.\n         * @param retSegment Segment to return.\n         *\n         * @retval False if cell has no segments.\n         *\/\n        bool leastRecentlyUsedSegment(const Cell& cell,\n                                      Segment& retSegment) const;\n\n        \/**\n         * Forward-propagates input to synapses, dendrites, and cells, to\n         * compute their activity.\n         *\n         * @param input               Active cells in the input.\n         * @param permanenceThreshold Only consider synapses with permanences greater than this threshold.\n         * @param synapseThreshold    Only consider segments with number of active synapses greater than this threshold.\n         *\n         * @retval Activity to return.\n         *\/\n        Activity computeActivity(const std::vector<Cell>& input,\n                                 Permanence permanenceThreshold,\n                                 UInt synapseThreshold,\n                                 bool recordIteration=true);\n\n        \/**\n         * Gets the active segments from activity.\n         *\n         * @param activity Activity.\n         *\n         * @retval Active segments.\n         *\/\n        std::vector<Segment> activeSegments(const Activity& activity);\n\n        \/**\n         * Gets the active cells from activity.\n         *\n         * @param activity Activity.\n         *\n         * @retval Active cells.\n         *\/\n        std::vector<Cell> activeCells(const Activity& activity);\n\n        \/\/ Debugging\n\n        \/**\n         * Gets the number of segments.\n         *\n         * @retval Number of segments.\n         *\/\n        UInt numSegments() const;\n\n        \/**\n         * Gets the number of synapses.\n         *\n         * @retval Number of synapses.\n         *\/\n        UInt numSynapses() const;\n\n      private:\n        std::vector<CellData> cells_;\n        \/\/ Mapping (presynaptic cell => synapses) used in forward propagation\n        std::map< Cell, std::vector<Synapse> > synapsesForPresynapticCell_;\n        UInt numSegments_;\n        UInt numSynapses_;\n        Iteration iteration_;\n      }; \/\/ end class Connections\n\n    } \/\/ end namespace connections\n\n  } \/\/ end namespace algorithms\n\n} \/\/ end namespace nta\n\n#endif \/\/ NTA_CONNECTIONS_HPP\n<commit_msg>Added TODO<commit_after>\/* ---------------------------------------------------------------------\n * Numenta Platform for Intelligent Computing (NuPIC)\n * Copyright (C) 2014, 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 * Definitions for the Connections class in C++\n *\/\n\n#ifndef NTA_CONNECTIONS_HPP\n#define NTA_CONNECTIONS_HPP\n\n#include <vector>\n#include <utility>\n#include <nta\/types\/Types.hpp>\n#include <nta\/math\/Math.hpp>\n\nnamespace nta\n{\n\n  namespace algorithms\n  {\n\n    namespace connections\n    {\n      typedef UInt32 CellIdx;\n      typedef unsigned char SegmentIdx;\n      typedef unsigned char SynapseIdx;\n      typedef Real32 Permanence;\n      typedef UInt64 Iteration;\n\n      \/**\n       * Cell class used in Connections.\n       *\n       * @b Description\n       * The Cell class is a data structure that points to a particular cell.\n       *\n       * @param idx Index of cell.\n       *\n       *\/\n      struct Cell\n      {\n        CellIdx idx;\n\n        Cell(CellIdx idx) : idx(idx) {}\n        Cell() {}\n\n        bool operator==(const Cell &other) const;\n        bool operator<=(const Cell &other) const;\n        bool operator<(const Cell &other) const;\n        bool operator>=(const Cell &other) const;\n        bool operator>(const Cell &other) const;\n      };\n\n      \/**\n       * Segment class used in Connections.\n       *\n       * @b Description\n       * The Segment class is a data structure that points to a particular\n       * segment on a particular cell.\n       *\n       * @param idx     Index of segment.\n       * @param cellIdx Index of cell.\n       *\n       *\/\n      struct Segment\n      {\n        SegmentIdx idx;\n        Cell cell;\n\n        Segment(SegmentIdx idx, Cell cell) : idx(idx), cell(cell) {}\n        Segment() {}\n\n        bool operator==(const Segment &other) const;\n        bool operator<=(const Segment &other) const;\n        bool operator<(const Segment &other) const;\n        bool operator>=(const Segment &other) const;\n        bool operator>(const Segment &other) const;\n      };\n\n      \/**\n       * Synapse class used in Connections.\n       *\n       * @b Description\n       * The Synapse class is a data structure that points to a particular\n       * synapse on a particular segment on a particular cell.\n       *\n       * @param idx        Index of synapse in segment.\n       * @param segmentIdx Index of segment in cell.\n       * @param cellIdx    Index of cell.\n       *\n       *\/\n      struct Synapse\n      {\n        SynapseIdx idx;\n        Segment segment;\n\n        Synapse(SynapseIdx idx, Segment segment) : idx(idx), segment(segment) {}\n        Synapse() {}\n\n        bool operator==(const Synapse &other) const;\n      };\n\n      \/**\n       * SynapseData class used in Connections.\n       *\n       * @b Description\n       * The SynapseData class is a data structure that contains the data for a\n       * synapse on a segment.\n       *\n       * @param presynapticCellIdx Cell that this synapse gets input from.\n       * @param permanence         Permanence of synapse.\n       * @param destroyed          Whether this synapse has been destroyed.\n       *\n       *\/\n      struct SynapseData\n      {\n        Cell presynapticCell;\n        Permanence permanence;\n        bool destroyed;\n      };\n\n      \/**\n       * SegmentData class used in Connections.\n       *\n       * @b Description\n       * The SegmentData class is a data structure that contains the data for a\n       * segment on a cell.\n       *\n       * @param synapses          Data for synapses that this segment contains.\n       * @param destroyed         Whether this segment has been destroyed.\n       * @param lastUsedIteration The iteration that this segment was last used at.\n       *\n       *\/\n      struct SegmentData\n      {\n        std::vector<SynapseData> synapses;\n        bool destroyed;\n        Iteration lastUsedIteration;\n      };\n\n      \/**\n       * CellData class used in Connections.\n       *\n       * @b Description\n       * The CellData class is a data structure that contains the data for a\n       * cell.\n       *\n       * @param segments Data for segments that this cell contains.\n       *\n       *\/\n      struct CellData\n      {\n        std::vector<SegmentData> segments;\n      };\n\n      \/**\n       * Activity class used in Connections.\n       *\n       * @b Description\n       * The Activity class is a data structure that represents the\n       * activity of a collection of cells, as computed by propagating\n       * input through connections.\n       *\n       *\/\n      struct Activity\n      {\n        std::map< Cell, std::vector<Segment> > activeSegmentsForCell;\n        std::map<Segment, UInt> numActiveSynapsesForSegment;\n      };\n\n      \/**\n       * Connections implementation in C++.\n       *\n       * @b Description\n       * The Connections class is a data structure that represents the\n       * connections of a collection of cells. It is used in the HTM\n       * learning algorithms to store and access data related to the\n       * connectivity of cells.\n       *\n       * It's main utility is to provide a common, optimized data structure\n       * that all HTM learning algorithms can use. It is flexible enough to\n       * support any learning algorithm that operates on a collection of cells.\n       *\n       * Each type of connection (proximal, distal, apical) should be\n       * represented by a different instantiation of this class. This class\n       * will help compute the activity along those connections due to active\n       * input cells. The responsibility for what effect that activity has on\n       * the cells and connections lies in the user of this class.\n       *\n       * This class is optimized to store connections between cells, and\n       * compute the activity of cells due to input over the connections.\n       *\n       *\/\n      class Connections\n      {\n      public:\n        \/\/ TODO: Using CellIdx below limits numCells to 1 less than its true\n        \/\/ upper limit. Fix this.\n        Connections(CellIdx numCells);\n\n        virtual ~Connections() {}\n\n        \/**\n         * Creates a segment on the specified cell.\n         *\n         * @param cell Cell to create segment on.\n         *\n         * @retval Created segment.\n         *\/\n        Segment createSegment(const Cell& cell);\n\n        \/**\n         * Creates a synapse on the specified segment.\n         *\n         * @param segment         Segment to create synapse on.\n         * @param presynapticCell Cell to synapse on.\n         * @param permanence      Initial permanence of new synapse.\n         *\n         * @reval Created synapse.\n         *\/\n        Synapse createSynapse(const Segment& segment,\n                              const Cell& presynapticCell,\n                              Permanence permanence);\n\n        \/**\n         * Destroys segment.\n         *\n         * @param segment Segment to destroy.\n         *\/\n        void destroySegment(const Segment& segment);\n\n        \/**\n         * Destroys synapse.\n         *\n         * @param synapse Synapse to destroy.\n         *\/\n        void destroySynapse(const Synapse& synapse);\n\n        \/**\n         * Updates a synapse's permanence.\n         *\n         * @param synapse    Synapse to update.\n         * @param permanence New permanence.\n         *\/\n        void updateSynapsePermanence(const Synapse& synapse,\n                                     Permanence permanence);\n\n        \/**\n         * Gets the segments for a cell.\n         *\n         * @param cell Cell to get segments for.\n         *\n         * @retval Segments on cell.\n         *\/\n        std::vector<Segment> segmentsForCell(const Cell& cell) const;\n\n        \/**\n         * Gets the synapses for a segment.\n         *\n         * @param segment Segment to get synapses for.\n         *\n         * @retval Synapses on segment.\n         *\/\n        std::vector<Synapse> synapsesForSegment(const Segment& segment);\n\n        \/**\n         * Gets the data for a segment.\n         *\n         * @param segment Segment to get data for.\n         *\n         * @retval Segment data.\n         *\/\n        SegmentData dataForSegment(const Segment& segment) const;\n\n        \/**\n         * Gets the data for a synapse.\n         *\n         * @param synapse Synapse to get data for.\n         *\n         * @retval Synapse data.\n         *\/\n        SynapseData dataForSynapse(const Synapse& synapse) const;\n\n        \/**\n         * Gets the segment with the most active synapses due to given input,\n         * from among all the segments on all the given cells.\n         *\n         * @param cells            Cells to look among.\n         * @param input            Active cells in the input.\n         * @param synapseThreshold Only consider segments with number of active synapses greater than this threshold.\n         * @param retSegment       Segment to return.\n         *\n         * @retval Segment found?\n         *\/\n        bool mostActiveSegmentForCells(const std::vector<Cell>& cells,\n                                       std::vector<Cell> input,\n                                       UInt synapseThreshold,\n                                       Segment& retSegment) const;\n\n        \/**\n         * Gets the segment that was least recently used from among all the\n         * segments on the given cell.\n         *\n         * @param cell       Cell whose segments to consider.\n         * @param retSegment Segment to return.\n         *\n         * @retval False if cell has no segments.\n         *\/\n        bool leastRecentlyUsedSegment(const Cell& cell,\n                                      Segment& retSegment) const;\n\n        \/**\n         * Forward-propagates input to synapses, dendrites, and cells, to\n         * compute their activity.\n         *\n         * @param input               Active cells in the input.\n         * @param permanenceThreshold Only consider synapses with permanences greater than this threshold.\n         * @param synapseThreshold    Only consider segments with number of active synapses greater than this threshold.\n         *\n         * @retval Activity to return.\n         *\/\n        Activity computeActivity(const std::vector<Cell>& input,\n                                 Permanence permanenceThreshold,\n                                 UInt synapseThreshold,\n                                 bool recordIteration=true);\n\n        \/**\n         * Gets the active segments from activity.\n         *\n         * @param activity Activity.\n         *\n         * @retval Active segments.\n         *\/\n        std::vector<Segment> activeSegments(const Activity& activity);\n\n        \/**\n         * Gets the active cells from activity.\n         *\n         * @param activity Activity.\n         *\n         * @retval Active cells.\n         *\/\n        std::vector<Cell> activeCells(const Activity& activity);\n\n        \/\/ Debugging\n\n        \/**\n         * Gets the number of segments.\n         *\n         * @retval Number of segments.\n         *\/\n        UInt numSegments() const;\n\n        \/**\n         * Gets the number of synapses.\n         *\n         * @retval Number of synapses.\n         *\/\n        UInt numSynapses() const;\n\n      private:\n        std::vector<CellData> cells_;\n        \/\/ Mapping (presynaptic cell => synapses) used in forward propagation\n        std::map< Cell, std::vector<Synapse> > synapsesForPresynapticCell_;\n        UInt numSegments_;\n        UInt numSynapses_;\n        Iteration iteration_;\n      }; \/\/ end class Connections\n\n    } \/\/ end namespace connections\n\n  } \/\/ end namespace algorithms\n\n} \/\/ end namespace nta\n\n#endif \/\/ NTA_CONNECTIONS_HPP\n<|endoftext|>"}
{"text":"<commit_before>#include <OpenCL\/opencl.h>\n\n#undef PV_USE_OPENCL\n\n#include \"..\/src\/columns\/HyPerCol.hpp\"\n#include \"..\/src\/layers\/LIF.hpp\"\n#include \"..\/src\/arch\/opencl\/CLDevice.hpp\"\n#include \"..\/src\/arch\/opencl\/CLKernel.hpp\"\n#include \"..\/src\/arch\/opencl\/CLBuffer.hpp\"\n#include \"..\/src\/utils\/Timer.hpp\"\n\n#include <assert.h>\n#include <stdio.h>\n#include <stdlib.h>\n\n\/\/ include the kernel for CPU calculations (without OpenCL)\n\/\/\n#undef PV_USE_OPENCL\n#include \"..\/src\/kernels\/LIF_update_state.cl\"\n\nnamespace PV {\n\nint test_LIF(int argc, char * argv[])\n{\n   Timer timer;\n   CLKernel * kernel;\n\n   int status = CL_SUCCESS;\n   int nWarm = 10, nLoops = 100;\n\n   HyPerCol * hc = new HyPerCol(\"test_cl_lif column\", argc, argv, \"..\");\n   LIF      * l1 = new LIF(\"test_cl_lif layer\", hc);\n\n   const PVLayerLoc * loc = l1->getLayerLoc();\n\n   const int nx = loc->nx;\n   const int ny = loc->ny;\n   const int nf = loc->nf;\n   const int nb = loc->nb;\n\n   const int nxl = l1->nxl;\n   const int nyl = l1->nyl;\n\n   kernel = l1->krUpdate;\n\n   \/\/printf(\"Executing on device...\");\n   \/\/kernel->run(nx*ny, nxl*nyl);\n\n   \/\/ Check results for accuracy\n   \/\/\n   \/\/printf(\"\\nChecking results...\");\n   \/\/   d_rnd_state->copyFromDevice();\n   \/\/   status = check_results(rnd_state, rnd_state2, NX*NY);\n   if (status != CL_SUCCESS) {\n      exit(status);\n   }\n\n   \/\/printf(\" CORRECT\\n\");\n\n   for (int n = 0; n < nWarm; n++) {\n      kernel->run(nx*ny, nxl*nyl);\n   }\n\n   printf(\"Timing %d loops on device... \", nLoops);\n   timer.start();\n   for (int n = 0; n < nLoops; n++) {\n      kernel->run(nx*ny, nxl*nyl);\n   }\n   status |= kernel->finish();\n   timer.stop();\n   timer.elapsed_time();\n\n   l1->clActivity->copyFromDevice();\n   \/\/ TODO - give kernel real input\n   \/\/for (int k = 0; k < 10; k++) {\n   \/\/   printf(\"A==%f\\n\", l1->clayer->activity->data[k]);\n   \/\/}\n\n   printf(\"Timing %d loops on host..... \", nLoops);\n\n   float time = l1->parent->simulationTime();\n   float dt   = l1->parent->getDeltaTime();\n\n   pvdata_t * phiExc   = l1->getChannel(CHANNEL_EXC);\n   pvdata_t * phiInh   = l1->getChannel(CHANNEL_INH);\n   pvdata_t * phiInhB  = l1->getChannel(CHANNEL_INHB);\n   pvdata_t * activity = l1->clayer->activity->data;\n\n   timer.reset();\n   timer.start();\n   for (int n = 0; n < nLoops; n++) {\n      LIF_update_state(time, dt, nx, ny, nf, nb,\n                       &(l1->lParams), l1->rand_state,\n                       l1->clayer->V, l1->Vth,\n                       l1->G_E, l1->G_I, l1->G_IB,\n                       phiExc, phiInh, phiInhB, activity);\n   }\n   timer.stop();\n   timer.elapsed_time();\n\n   \/\/ Shutdown and cleanup\n   \/\/\n   \/\/   clReleaseMemObject(d_rnd_state);\n   \/\/   delete cld;\n\n   printf(\"Finished...\\n\");\n\n   return status;\n}\n\n};\n\nint main(int argc, char * argv[])\n{\n   return PV::test_LIF(argc, argv);\n}\n\n#ifdef NOTYET\nint check_results(uint4 * rnd_state, uint4 * rnd_state2, int count)\n{\n   uint4 state;\n\n   for (int k = 0; k < count; k++) {\n      state = cl_random_get(rnd_state2[k]);\n      if (state.s0 != rnd_state[k].s0) {\n         printf(\"check_results: results differ at k==%d, rnd_state==%d, rnd_state2==%d\\n\",\n                k, state.s0, rnd_state[k].s0);\n         return 1;\n      }\n   }\n   return 0;\n}\n\nvoid c_rand(uint4 * rnd_state, int count)\n{\n   for (int k = 0; k < count; k++) {\n      rnd_state[k] = cl_random_get(rnd_state[k]);\n   }\n}\n#endif\n<commit_msg>Removed include of opencl.h<commit_after>#undef PV_USE_OPENCL\n\n#include \"..\/src\/columns\/HyPerCol.hpp\"\n#include \"..\/src\/layers\/LIF.hpp\"\n#include \"..\/src\/arch\/opencl\/CLDevice.hpp\"\n#include \"..\/src\/arch\/opencl\/CLKernel.hpp\"\n#include \"..\/src\/arch\/opencl\/CLBuffer.hpp\"\n#include \"..\/src\/utils\/Timer.hpp\"\n\n#include <assert.h>\n#include <stdio.h>\n#include <stdlib.h>\n\n\/\/ include the kernel for CPU calculations (without OpenCL)\n\/\/\n#undef PV_USE_OPENCL\n#include \"..\/src\/kernels\/LIF_update_state.cl\"\n\nnamespace PV {\n\nint test_LIF(int argc, char * argv[])\n{\n   Timer timer;\n   CLKernel * kernel;\n\n   int status = CL_SUCCESS;\n   int nWarm = 10, nLoops = 100;\n\n   HyPerCol * hc = new HyPerCol(\"test_cl_lif column\", argc, argv, \"..\");\n   LIF      * l1 = new LIF(\"test_cl_lif layer\", hc);\n\n   const PVLayerLoc * loc = l1->getLayerLoc();\n\n   const int nx = loc->nx;\n   const int ny = loc->ny;\n   const int nf = loc->nf;\n   const int nb = loc->nb;\n\n   const int nxl = l1->nxl;\n   const int nyl = l1->nyl;\n\n   kernel = l1->krUpdate;\n\n   \/\/printf(\"Executing on device...\");\n   \/\/kernel->run(nx*ny, nxl*nyl);\n\n   \/\/ Check results for accuracy\n   \/\/\n   \/\/printf(\"\\nChecking results...\");\n   \/\/   d_rnd_state->copyFromDevice();\n   \/\/   status = check_results(rnd_state, rnd_state2, NX*NY);\n   if (status != CL_SUCCESS) {\n      exit(status);\n   }\n\n   \/\/printf(\" CORRECT\\n\");\n\n   for (int n = 0; n < nWarm; n++) {\n      kernel->run(nx*ny, nxl*nyl);\n   }\n\n   printf(\"Timing %d loops on device... \", nLoops);\n   timer.start();\n   for (int n = 0; n < nLoops; n++) {\n      kernel->run(nx*ny, nxl*nyl);\n   }\n   status |= kernel->finish();\n   timer.stop();\n   timer.elapsed_time();\n\n   l1->clActivity->copyFromDevice();\n   \/\/ TODO - give kernel real input\n   \/\/for (int k = 0; k < 10; k++) {\n   \/\/   printf(\"A==%f\\n\", l1->clayer->activity->data[k]);\n   \/\/}\n\n   printf(\"Timing %d loops on host..... \", nLoops);\n\n   float time = l1->parent->simulationTime();\n   float dt   = l1->parent->getDeltaTime();\n\n   pvdata_t * phiExc   = l1->getChannel(CHANNEL_EXC);\n   pvdata_t * phiInh   = l1->getChannel(CHANNEL_INH);\n   pvdata_t * phiInhB  = l1->getChannel(CHANNEL_INHB);\n   pvdata_t * activity = l1->clayer->activity->data;\n\n   timer.reset();\n   timer.start();\n   for (int n = 0; n < nLoops; n++) {\n      LIF_update_state(time, dt, nx, ny, nf, nb,\n                       &(l1->lParams), l1->rand_state,\n                       l1->clayer->V, l1->Vth,\n                       l1->G_E, l1->G_I, l1->G_IB,\n                       phiExc, phiInh, phiInhB, activity);\n   }\n   timer.stop();\n   timer.elapsed_time();\n\n   \/\/ Shutdown and cleanup\n   \/\/\n   \/\/   clReleaseMemObject(d_rnd_state);\n   \/\/   delete cld;\n\n   printf(\"Finished...\\n\");\n\n   return status;\n}\n\n};\n\nint main(int argc, char * argv[])\n{\n   return PV::test_LIF(argc, argv);\n}\n\n#ifdef NOTYET\nint check_results(uint4 * rnd_state, uint4 * rnd_state2, int count)\n{\n   uint4 state;\n\n   for (int k = 0; k < count; k++) {\n      state = cl_random_get(rnd_state2[k]);\n      if (state.s0 != rnd_state[k].s0) {\n         printf(\"check_results: results differ at k==%d, rnd_state==%d, rnd_state2==%d\\n\",\n                k, state.s0, rnd_state[k].s0);\n         return 1;\n      }\n   }\n   return 0;\n}\n\nvoid c_rand(uint4 * rnd_state, int count)\n{\n   for (int k = 0; k < count; k++) {\n      rnd_state[k] = cl_random_get(rnd_state[k]);\n   }\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#ifndef TYPES_HPP\n#define TYPES_HPP\n\n#ifdef ANDROID_PLATFORM\n\t#include <android_native_app_glue.h>\n\t#include <EGL\/egl.h>\n\t#include <GLES2\/gl2.h>\n\t#include <GLES2\/gl2ext.h>\n\t#include <SLES\/OpenSLES.h>\n\t#include <SLES\/OpenSLES_Android.h>\n\t#include <SLES\/OpenSLES_AndroidConfiguration.h>\n#elif\tdefined(WINDOWS_PLATFORM)\n\t#include <windows.h>\n\t#include \"GLee.h\"\n\t#include <GL\/gl.h>\n\t#include <GL\/glu.h>\n#elif\tdefined(LINUX_PLATFORM)\n\t#define GLX_GLXEXT_LEGACY\n\t#include \"GLee.h\"\n\t#include <GL\/glx.h>\n\t#include <GL\/gl.h>\n\t#include <GL\/glu.h>\n\t#include \"glxext.h\"\n\t#include <cstdarg>\n\t#include <cstdio>\n#endif\n\n#ifdef LINUX_PLATFORM\n\t#include <stdint.h>\n#elif\tdefined(ANDROID_PLATFORM)\n\t#define\tintptr_t\tint\n#elif\tdefined(WINDOWS_PLATFORM)\n\t#define unordered_map map\n\t#define unordered_set set\n#endif\n\n#include <cstdlib>\n#include <cstring>\n\n#include <string>\n#include <vector>\n#include <deque>\n#include <queue>\n#include <stack>\n#include <set>\n#include <map>\n\n#if defined(LINUX_PLATFORM) || defined(ANDROID_PLATFORM)\n\t#include <unordered_map>\n\t#include <unordered_set>\n#endif\n\n#include \"Math.hpp\"\n#include \"..\/Debug\/Debug.hpp\"\n\ntypedef unsigned int\t \tGLenum;\ntypedef unsigned char\t \tGLboolean;\ntypedef unsigned int\t \tGLbitfield;\ntypedef signed char\t \t\tGLbyte;\ntypedef short\t\t\t \tGLshort;\ntypedef int\t\t\t \t\tGLint;\ntypedef int\t\t\t \t\tGLsizei;\ntypedef unsigned char\t \tGLubyte;\ntypedef unsigned short \t\tGLushort;\ntypedef unsigned int\t\tGLuint;\ntypedef float\t\t\t\tGLfloat;\ntypedef float\t\t\t\tGLclampf;\ntypedef double\t\t\t\tGLdouble;\ntypedef double\t\t\t\tGLclampd;\ntypedef void\t\t\t\tGLvoid;\ntypedef unsigned char\t\tBYTE;\n\nnamespace MPACK\n{\n\tnamespace Core\n\t{\n\t\ttypedef int\t\tint32_t;\n\t\ttypedef int32_t\t \tReturnValue;\n\n\t\tconst ReturnValue RETURN_VALUE_OK   = 0;\n\t\tconst ReturnValue RETURN_VALUE_KO   = -1;\n\t\tconst ReturnValue RETURN_VALUE_EXIT = -2;\n\n\t\ttypedef void (*Param0CallbackFunc)();\n\t\ttypedef void (*Param1PtrCallbackFunc)(void*);\n\t\ttypedef void (*Param2PtrCallbackFunc)(void*, void*);\n\n\t\tstruct Param1PtrCallbackStruct\n\t\t{\n\t\t\tParam1PtrCallbackStruct(Param1PtrCallbackFunc function, void *param1)\n\t\t\t\t:\tfunction(function), param1(param1)\n\t\t\t{\n\t\t\t}\n\n\t\t\tParam1PtrCallbackFunc function;\n\t\t\tvoid *param1;\n\n\t\t\tbool operator== (const Param1PtrCallbackStruct &other)\n\t\t\t{\n\t\t\t\tif(function!=other.function)\n\t\t\t\t\treturn false;\n\t\t\t\tif(param1!=other.param1)\n\t\t\t\t\treturn false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t};\n\n\t\tstruct Param2PtrCallbackStruct\n\t\t{\n\t\t\tParam2PtrCallbackStruct(Param2PtrCallbackFunc function, void *param1)\n\t\t\t\t:\tfunction(function), param1(param1)\n\t\t\t{\n\t\t\t}\n\n\t\t\tParam2PtrCallbackFunc function;\n\t\t\tvoid *param1;\n\n\t\t\tbool operator== (const Param2PtrCallbackStruct &other)\n\t\t\t{\n\t\t\t\tif(function!=other.function)\n\t\t\t\t\treturn false;\n\t\t\t\tif(param1!=other.param1)\n\t\t\t\t\treturn false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t};\n\t}\n}\n\n#endif\n<commit_msg>Updated Types.hpp<commit_after>#ifndef TYPES_HPP\n#define TYPES_HPP\n\n#ifdef ANDROID_PLATFORM\n\t#include <android_native_app_glue.h>\n\t#include <EGL\/egl.h>\n\t#include <GLES2\/gl2.h>\n\t#include <GLES2\/gl2ext.h>\n\t#include <SLES\/OpenSLES.h>\n\t#include <SLES\/OpenSLES_Android.h>\n\t#include <SLES\/OpenSLES_AndroidConfiguration.h>\n#elif\tdefined(WINDOWS_PLATFORM)\n\t#include <windows.h>\n\t#include \"GLee.h\"\n\t#include <GL\/gl.h>\n\t#include <GL\/glu.h>\n#elif\tdefined(LINUX_PLATFORM)\n\t#define GLX_GLXEXT_LEGACY\n\t#include \"GLee.h\"\n\t#include <GL\/glx.h>\n\t#include <GL\/gl.h>\n\t#include <GL\/glu.h>\n\t#include \"glxext.h\"\n\t#include <cstdarg>\n\t#include <cstdio>\n#endif\n\n#ifdef LINUX_PLATFORM\n\t#include <stdint.h>\n#elif\tdefined(ANDROID_PLATFORM)\n\t#define\tintptr_t\tint\n#elif\tdefined(WINDOWS_PLATFORM)\n\t#define unordered_map map\n\t#define unordered_set set\n#endif\n\n#include <cstdlib>\n#include <cstring>\n\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <deque>\n#include <queue>\n#include <stack>\n#include <list>\n#include <set>\n#include <map>\n\n#if defined(LINUX_PLATFORM) || defined(ANDROID_PLATFORM)\n\t#include <unordered_map>\n\t#include <unordered_set>\n#endif\n\n#include \"Math.hpp\"\n#include \"..\/Debug\/Debug.hpp\"\n\ntypedef unsigned int\t \tGLenum;\ntypedef unsigned char\t \tGLboolean;\ntypedef unsigned int\t \tGLbitfield;\ntypedef signed char\t \t\tGLbyte;\ntypedef short\t\t\t \tGLshort;\ntypedef int\t\t\t \t\tGLint;\ntypedef int\t\t\t \t\tGLsizei;\ntypedef unsigned char\t \tGLubyte;\ntypedef unsigned short \t\tGLushort;\ntypedef unsigned int\t\tGLuint;\ntypedef float\t\t\t\tGLfloat;\ntypedef float\t\t\t\tGLclampf;\ntypedef double\t\t\t\tGLdouble;\ntypedef double\t\t\t\tGLclampd;\ntypedef void\t\t\t\tGLvoid;\ntypedef unsigned char\t\tBYTE;\n\nnamespace MPACK\n{\n\tnamespace Core\n\t{\n\t\ttypedef int\t\tint32_t;\n\t\ttypedef int32_t\t \tReturnValue;\n\n\t\tconst ReturnValue RETURN_VALUE_OK   = 0;\n\t\tconst ReturnValue RETURN_VALUE_KO   = -1;\n\t\tconst ReturnValue RETURN_VALUE_EXIT = -2;\n\n\t\ttypedef void (*Param0CallbackFunc)();\n\t\ttypedef void (*Param1PtrCallbackFunc)(void*);\n\t\ttypedef void (*Param2PtrCallbackFunc)(void*, void*);\n\n\t\tstruct Param1PtrCallbackStruct\n\t\t{\n\t\t\tParam1PtrCallbackStruct(Param1PtrCallbackFunc function, void *param1)\n\t\t\t\t:\tfunction(function), param1(param1)\n\t\t\t{\n\t\t\t}\n\n\t\t\tParam1PtrCallbackFunc function;\n\t\t\tvoid *param1;\n\n\t\t\tbool operator== (const Param1PtrCallbackStruct &other)\n\t\t\t{\n\t\t\t\tif(function!=other.function)\n\t\t\t\t\treturn false;\n\t\t\t\tif(param1!=other.param1)\n\t\t\t\t\treturn false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t};\n\n\t\tstruct Param2PtrCallbackStruct\n\t\t{\n\t\t\tParam2PtrCallbackStruct(Param2PtrCallbackFunc function, void *param1)\n\t\t\t\t:\tfunction(function), param1(param1)\n\t\t\t{\n\t\t\t}\n\n\t\t\tParam2PtrCallbackFunc function;\n\t\t\tvoid *param1;\n\n\t\t\tbool operator== (const Param2PtrCallbackStruct &other)\n\t\t\t{\n\t\t\t\tif(function!=other.function)\n\t\t\t\t\treturn false;\n\t\t\t\tif(param1!=other.param1)\n\t\t\t\t\treturn false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t};\n\t}\n}\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  $RCSfile: ik_typedef.hxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: np $ $Date: 2002-11-29 10:20:03 $\n *\n *  The Contents of this file are made available subject to the terms of\n *  either of the following licenses\n *\n *         - GNU Lesser General Public License Version 2.1\n *         - Sun Industry Standards Source License Version 1.1\n *\n *  Sun Microsystems Inc., October, 2000\n *\n *  GNU Lesser General Public License Version 2.1\n *  =============================================\n *  Copyright 2000 by Sun Microsystems, Inc.\n *  901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n *  This library is free software; you can redistribute it and\/or\n *  modify it under the terms of the GNU Lesser General Public\n *  License version 2.1, as published by the Free Software Foundation.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Lesser General Public License for more details.\n *\n *  You should have received a copy of the GNU Lesser General Public\n *  License along with this library; if not, write to the Free Software\n *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n *  MA  02111-1307  USA\n *\n *\n *  Sun Industry Standards Source License Version 1.1\n *  =================================================\n *  The contents of this file are subject to the Sun Industry Standards\n *  Source License Version 1.1 (the \"License\"); You may not use this file\n *  except in compliance with the License. You may obtain a copy of the\n *  License at http:\/\/www.openoffice.org\/license.html.\n *\n *  Software provided under this License is provided on an \"AS IS\" basis,\n *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n *  See the License for the specific provisions governing your rights and\n *  obligations concerning the Software.\n *\n *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n *  Copyright: 2000 by Sun Microsystems, Inc.\n *\n *  All Rights Reserved.\n *\n *  Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef ARY_IDL_IK_TYPEDEF_HXX\n#define ARY_IDL_IK_TYPEDEF_HXX\n\n\n\n\/\/ USED SERVICES\n    \/\/ BASE CLASSES\n#include <ary\/idl\/ik_ce.hxx>\n    \/\/ COMPONENTS\n    \/\/ PARAMETERS\n\nnamespace ary\n{\nnamespace idl\n{\n\nnamespace ifc_typedef\n{\n\nusing ifc_ce::Dyn_CeIterator;\nusing ifc_ce::DocText;\n\n\nstruct attr: public ifc_ce::attr\n{\n    static Type_id      DefiningType(\n                            const CodeEntity &  i_ce );\n};\n\nstruct xref : public ifc_ce::xref\n{\n    static void         Get_SynonymTypedefs(\n                            Dyn_CeIterator &    o_result,\n                            const CodeEntity &  i_ce );\n    static void         Get_AsReturns(\n                            Dyn_CeIterator &    o_result,\n                            const CodeEntity &  i_ce );\n    static void         Get_AsParameters(\n                            Dyn_CeIterator &    o_result,\n                            const CodeEntity &  i_ce );\n    static void         Get_AsDataTypes(\n                            Dyn_CeIterator &    o_result,\n                            const CodeEntity &  i_ce );\n};\n\nstruct doc : public ifc_ce::doc\n{\n};\n\n}   \/\/ namespace ifc_typedef\n\n}   \/\/ namespace idl\n}   \/\/ namespace ary\n\n\n#endif\n<commit_msg>INTEGRATION: CWS ooo19126 (1.2.132); FILE MERGED 2005\/09\/05 13:09:29 rt 1.2.132.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: ik_typedef.hxx,v $\n *\n *  $Revision: 1.3 $\n *\n *  last change: $Author: rt $ $Date: 2005-09-07 16:18: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 ARY_IDL_IK_TYPEDEF_HXX\n#define ARY_IDL_IK_TYPEDEF_HXX\n\n\n\n\/\/ USED SERVICES\n    \/\/ BASE CLASSES\n#include <ary\/idl\/ik_ce.hxx>\n    \/\/ COMPONENTS\n    \/\/ PARAMETERS\n\nnamespace ary\n{\nnamespace idl\n{\n\nnamespace ifc_typedef\n{\n\nusing ifc_ce::Dyn_CeIterator;\nusing ifc_ce::DocText;\n\n\nstruct attr: public ifc_ce::attr\n{\n    static Type_id      DefiningType(\n                            const CodeEntity &  i_ce );\n};\n\nstruct xref : public ifc_ce::xref\n{\n    static void         Get_SynonymTypedefs(\n                            Dyn_CeIterator &    o_result,\n                            const CodeEntity &  i_ce );\n    static void         Get_AsReturns(\n                            Dyn_CeIterator &    o_result,\n                            const CodeEntity &  i_ce );\n    static void         Get_AsParameters(\n                            Dyn_CeIterator &    o_result,\n                            const CodeEntity &  i_ce );\n    static void         Get_AsDataTypes(\n                            Dyn_CeIterator &    o_result,\n                            const CodeEntity &  i_ce );\n};\n\nstruct doc : public ifc_ce::doc\n{\n};\n\n}   \/\/ namespace ifc_typedef\n\n}   \/\/ namespace idl\n}   \/\/ namespace ary\n\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>changes<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/ KMail startup and initialize code\n\/\/ Author: Stefan Taferner <taferner@alpin.or.at>\n\n#ifdef HAVE_CONFIG_H\n#include <config.h>\n#endif\n#include <errno.h>\n#include <sys\/types.h>\n#include <signal.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n\n#include <qtimer.h>\n\n#include <kuniqueapplication.h>\n#include <klocale.h>\n#include <kglobal.h>\n#include <ksimpleconfig.h>\n#include <kstandarddirs.h>\n#include <knotifyclient.h>\n#include <dcopclient.h>\n#include <kcrash.h>\n\n#include \"kmkernel.h\" \/\/control center\n\n#undef Status \/\/ stupid X headers\n#include \"kmailIface_stub.h\" \/\/ to call control center of master kmail\n\n#include <kaboutdata.h>\n\n#include \"kmversion.h\"\n\n\n\/\/ OLD about text.  This is horrbly outdated.\n\/*const char* aboutText =\n    \"KMail [\" KMAIL_VERSION \"] by\\n\\n\"\n    \"Stefan Taferner <taferner@kde.org>,\\n\"\n    \"Markus Wbben <markus.wuebben@kde.org>\\n\\n\"\n    \"based on the work of:\\n\"\n    \"Lynx <lynx@topaz.hknet.com>,\\n\"\n    \"Stephan Meyer <Stephan.Meyer@pobox.com>,\\n\"\n    \"and the above authors.\\n\\n\"\n    \"This program is covered by the GPL.\\n\\n\"\n    \"Please send bugreports to taferner@kde.org\";\n*\/\n\nstatic KCmdLineOptions kmoptions[] =\n{\n  { \"s\", 0 , 0 },\n  { \"subject <subject>\",\tI18N_NOOP(\"Set subject of message.\"), 0 },\n  { \"c\", 0 , 0 },\n  { \"cc <address>\",\t\tI18N_NOOP(\"Send CC: to 'address'.\"), 0 },\n  { \"b\", 0 , 0 },\n  { \"bcc <address>\",\t\tI18N_NOOP(\"Send BCC: to 'address'.\"), 0 },\n  { \"h\", 0 , 0 },\n  { \"header <header>\",\t\tI18N_NOOP(\"Add 'header' to message.\"), 0 },\n  { \"msg <file>\",\t\tI18N_NOOP(\"Read message body from 'file'.\"), 0 },\n  { \"body <text>\",              I18N_NOOP(\"Set body of message.\"), 0 },\n  { \"attach <url>\",             I18N_NOOP(\"Add an attachment to the mail. This can be repeated.\"), 0 },\n  { \"check\",\t\t\tI18N_NOOP(\"Only check for new mail.\"), 0 },\n  { \"composer\",\t\t\tI18N_NOOP(\"Only open composer window.\"), 0 },\n  { \"+[address]\",\t\tI18N_NOOP(\"Send message to 'address'.\"), 0 },\n\/\/  { \"+[file]\",                  I18N_NOOP(\"Show message from file 'file'.\"), 0 },\n  { 0, 0, 0}\n};\n\n\/\/-----------------------------------------------------------------------------\n\nextern \"C\" {\n\nstatic void setSignalHandler(void (*handler)(int));\n\n\/\/ Crash recovery signal handler\nstatic void signalHandler(int sigId)\n{\n  setSignalHandler(SIG_DFL);\n  fprintf(stderr, \"*** KMail got signal %d (Exiting)\\n\", sigId);\n  \/\/ try to cleanup all windows\n  kernel->dumpDeadLetters();\n  ::exit(-1); \/\/\n}\n\n\/\/ Crash recovery signal handler\nstatic void crashHandler(int sigId)\n{\n  setSignalHandler(SIG_DFL);\n  fprintf(stderr, \"*** KMail got signal %d (Crashing)\\n\", sigId);\n  \/\/ try to cleanup all windows\n  kernel->dumpDeadLetters();\n  \/\/ Return to DrKonqi.\n}\n\/\/-----------------------------------------------------------------------------\n\n\nstatic void setSignalHandler(void (*handler)(int))\n{\n  signal(SIGKILL, handler);\n  signal(SIGTERM, handler);\n  signal(SIGHUP,  handler);\n  KCrash::setEmergencySaveFunction(crashHandler);\n}\n\n}\n\/\/-----------------------------------------------------------------------------\n\nclass KMailApplication : public KUniqueApplication\n{\npublic:\n  KMailApplication() : KUniqueApplication() { };\n\n  virtual int newInstance();\n\n  void commitData(QSessionManager& sm) {\n    kernel->notClosedByUser();\n    KApplication::commitData( sm );\n  }\n};\n\nint KMailApplication::newInstance()\n{\n  QString to, cc, bcc, subj, body;\n  KURL messageFile = QString::null;\n  KURL::List attachURLs;\n  bool mailto = false;\n  bool checkMail = false;\n  \/\/bool viewOnly = false;\n\n  \/\/ process args:\n  KCmdLineArgs *args = KCmdLineArgs::parsedArgs();\n  if (args->getOption(\"subject\"))\n  {\n     mailto = true;\n     subj = QString::fromLocal8Bit(args->getOption(\"subject\"));\n  }\n\n  if (args->getOption(\"cc\"))\n  {\n     mailto = true;\n     cc = QString::fromLocal8Bit(args->getOption(\"cc\"));\n  }\n\n  if (args->getOption(\"bcc\"))\n  {\n     mailto = true;\n     bcc = QString::fromLocal8Bit(args->getOption(\"bcc\"));\n  }\n\n  if (args->getOption(\"msg\"))\n  {\n     mailto = true;\n     messageFile = QString::fromLocal8Bit(args->getOption(\"msg\"));\n  }\n\n  if (args->getOption(\"body\"))\n  {\n     mailto = true;\n     body = QString::fromLocal8Bit(args->getOption(\"body\"));\n  }\n\n  QCStringList attachList = args->getOptionList(\"attach\");\n  if (!attachList.isEmpty())\n  {\n     mailto = true;\n     for ( QCStringList::Iterator it = attachList.begin() ; it != attachList.end() ; ++it )\n       if ( !(*it).isEmpty() )\n         attachURLs += KURL( QString::fromLocal8Bit( *it ) );\n  }\n\n  if (args->isSet(\"composer\"))\n    mailto = true;\n\n  if (args->isSet(\"check\"))\n    checkMail = true;\n\n  for(int i= 0; i < args->count(); i++)\n  {\n    if (!to.isEmpty())\n      to += \", \";\n     if (strncasecmp(args->arg(i),\"mailto:\",7)==0)\n       to += args->arg(i);\n     else\n       to += args->arg(i);\n     mailto = true;\n  }\n\n  args->clear();\n\n  if (!kernel->firstInstance() || !kapp->isRestored())\n    kernel->action (mailto, checkMail, to, cc, bcc, subj, body, messageFile, attachURLs);\n  kernel->setFirstInstance(FALSE);\n  return 0;\n}\n\nnamespace\n{\nQString getMyHostName(void)\n{\n  char hostNameC[256];\n  \/\/ null terminate this C string\n  hostNameC[255] = 0;\n  \/\/ set the string to 0 length if gethostname fails\n  if(gethostname(hostNameC, 255))\n    hostNameC[0] = 0;\n  return QString::fromLocal8Bit(hostNameC);\n}\n}\n\nstatic void checkConfigUpdates() {\n#if KDE_VERSION >= 306\n  KConfig * config = kapp->config();\n  const QString updateFile = QString::fromLatin1(\"kmail.upd\");\n  QStringList updates;\n  updates << \"9\"\n\t  << \"3.1-update-identities\"\n\t  << \"3.1-use-identity-uoids\"\n          << \"3.1-new-mail-notification\";\n  for ( QStringList::const_iterator it = updates.begin() ; it != updates.end() ; ++it )\n    config->checkUpdate( *it, updateFile );\n#endif\n}\n\nint main(int argc, char *argv[])\n{\n  \/\/ WABA: KMail is a KUniqueApplication. Unfortunately this makes debugging\n  \/\/ a bit harder: You should pass --nofork as commandline argument when using\n  \/\/ a debugger. In gdb you can do this by typing \"set args --nofork\" before\n  \/\/ typing \"run\".\n\n  KAboutData about(\"kmail\", I18N_NOOP(\"KMail\"),\n                   KMAIL_VERSION,\n\t\t   I18N_NOOP(\"The KDE Email client.\"),\n\t\t   KAboutData::License_GPL,\n                   I18N_NOOP(\"(c) 1997-2002, The KMail developers\"),\n\t\t   0,\n\t\t   \"http:\/\/kmail.kde.org\");\n  about.addAuthor( \"Michael H\\303\\244ckel\", I18N_NOOP(\"Current maintainer\"), \"haeckel@kde.org\" );\n  about.addAuthor( \"Don Sanders\", I18N_NOOP(\"Core developer and maintainer\"), \"sanders@kde.org\" );\n  about.addAuthor( \"Stefan Taferner \", I18N_NOOP(\"Original author\"), \"taferner@kde.org\" );\n  about.addAuthor( \"Ingo Kl\\303\\266cker\", I18N_NOOP(\"Encryption\"), \"kloecker@kde.de\" );\n  about.addAuthor( \"Marc Mutz\", I18N_NOOP(\"Core developer\"), \"mutz@kde.org\" );\n  about.addAuthor( \"Daniel Naber\", I18N_NOOP(\"Documentation\"), \"daniel.naber@t-online.de\" );\n  about.addAuthor( \"Andreas Gungl\", I18N_NOOP(\"Encryption\"), \"a.gungl@gmx.de\" );\n\n  about.addAuthor( \"Toyohiro Asukai\", 0, \"toyohiro@ksmplus.com\" );\n  about.addAuthor( \"Waldo Bastian\", 0, \"bastian@kde.org\" );\n  about.addAuthor( \"Carsten Burghardt\", 0, \"carsten.burghardt@web.de\" );\n  about.addAuthor( \"Steven Brown\", 0, \"swbrown@ucsd.edu\" );\n  about.addAuthor( \"Cristi Dumitrescu\", 0, \"cristid@chip.ro\" );\n  about.addAuthor( \"Philippe Fremy\", 0, \"pfremy@chez.com\" );\n  about.addAuthor( \"Kurt Granroth\", 0, \"granroth@kde.org\" );\n  about.addAuthor( \"Heiko Hund\", 0, \"heiko@ist.eigentlich.net\" );\n  about.addAuthor( \"Igor Janssen\", 0, \"rm@linux.ru.net\" );\n  about.addAuthor( \"Matt Johnston\", 0, \"matt@caifex.org\" );\n  about.addAuthor( \"Christer Kaivo-oja\", 0, \"whizkid@telia.com\" );\n  about.addAuthor( \"Lars Knoll\", 0, \"knoll@kde.org\" );\n  about.addAuthor( \"J. Nick Koston\", 0, \"bdraco@darkorb.net\" );\n  about.addAuthor( \"Stephan Kulow\", 0, \"coolo@kde.org\" );\n  about.addAuthor( \"Guillaume Laurent\", 0, \"glaurent@telegraph-road.org\" );\n  about.addAuthor( \"Sam Magnuson\", 0, \"sam@trolltech.com\" );\n  about.addAuthor( \"Laurent Montel\", 0, \"lmontel@mandrakesoft.com\" );\n  about.addAuthor( \"Matt Newell\", 0, \"newellm@proaxis.com\" );\n  about.addAuthor( \"Denis Perchine\", 0, \"dyp@perchine.com\" );\n  about.addAuthor( \"Samuel Penn\", 0, \"sam@bifrost.demon.co.uk\" );\n  about.addAuthor( \"Carsten Pfeiffer\", 0, \"pfeiffer@kde.org\" );\n  about.addAuthor( \"Sven Radej\", 0, \"radej@kde.org\" );\n  about.addAuthor( \"Mark Roberts\", 0, \"mark@taurine.demon.co.uk\" );\n  about.addAuthor( \"Wolfgang Rohdewald\", 0, \"wrohdewald@dplanet.ch\" );\n  about.addAuthor( \"Espen Sand\", 0, \"espen@kde.org\" );\n  about.addAuthor( \"Jan Simonson\", 0, \"jan@simonson.pp.se\" );\n  about.addAuthor( \"George Staikos\", 0, \"staikos@kde.org\" );\n  about.addAuthor( \"Jason Stephenson\", 0, \"panda@mis.net\" );\n  about.addAuthor( \"Jacek Stolarczyk\", 0, \"jacek@mer.chemia.polsl.gliwice.pl\" );\n  about.addAuthor( \"Roberto S. Teixeira\", 0, \"maragato@kde.org\" );\n  about.addAuthor( \"Ronen Tzur\", 0, \"rtzur@shani.net\" );\n  about.addAuthor( \"Mario Weilguni\", 0, \"mweilguni@sime.com\" );\n  about.addAuthor( \"Wynn Wilkes\", 0, \"wynnw@calderasystems.com\" );\n  about.addAuthor( \"Robert D. Williams\", 0, \"rwilliams@kde.org\" );\n  about.addAuthor( \"Markus Wuebben\", 0, \"markus.wuebben@kde.org\" );\n  about.addAuthor( \"Thorsten Zachmann\", 0, \"t.zachmann@zagge.de\" );\n  about.addAuthor( \"Karl-Heinz Zimmer\", 0, \"khz@kde.org\" );\n\n  KCmdLineArgs::init(argc, argv, &about);\n  KCmdLineArgs::addCmdLineOptions( kmoptions ); \/\/ Add kmail options\n\n  if (!KMailApplication::start())\n     return 0;\n\n  KMailApplication app;\n  KGlobal::locale()->insertCatalogue(\"libkdenetwork\");\n\n  \/\/ Check that all updates have been run on the config file:\n  checkConfigUpdates();\n\n  \/\/ Check and create a lock file to prevent concurrent access to kmail files\n  const QString lockLocation = locateLocal(\"appdata\", \"lock\");\n  KSimpleConfig config(lockLocation);\n  int oldPid = config.readNumEntry(\"pid\", -1);\n  const QString oldHostName = config.readEntry(\"hostname\");\n  const QString hostName = getMyHostName();\n  \/\/ proceed if there is no lock at present\n  if (oldPid != -1 &&\n  \/\/ proceed if the lock is our pid, or if the lock is from the same host\n      oldPid != getpid() && hostName != oldHostName &&\n  \/\/ proceed if the pid doesn't exist\n      (kill(oldPid, 0) != -1 || errno != ESRCH))\n  {\n    QString msg = i18n(\"Only one instance of KMail can be run at \"\n      \"any one time. It is already running on a different display \"\n      \"with PID %1 on host %2 according to the lock file located \"\n      \"at %3.\").arg(oldPid).arg(oldHostName).arg(lockLocation);\n\n    KNotifyClient::userEvent( msg,  KNotifyClient::Messagebox,\n      KNotifyClient::Error );\n    fprintf(stderr, \"*** KMail is already running with PID %d on host %s\\n\",\n            oldPid, oldHostName.local8Bit().data());\n    return 1;\n  }\n\n  config.writeEntry(\"pid\", getpid());\n  config.writeEntry(\"hostname\", hostName);\n  config.sync();\n\n  kapp->dcopClient()->suspend(); \/\/ Don't handle DCOP requests yet\n\n  \/\/local, do the init\n  KMKernel kmailKernel;\n  kmailKernel.init();\n  kapp->dcopClient()->setDefaultObject( kmailKernel.objId() );\n\n  \/\/ and session management\n  kmailKernel.doSessionManagement();\n\n  \/\/ any dead letters?\n  kmailKernel.recoverDeadLetters();\n\n  setSignalHandler(signalHandler);\n\n  kapp->dcopClient()->resume(); \/\/ Ok. We are ready for DCOP requests.\n  \/\/ Go!\n  int ret = kapp->exec();\n\n  \/\/ clean up\n  kmailKernel.cleanup();\n  config.writeEntry(\"pid\", -1);\n  config.sync();\n  return ret;\n}\n\n<commit_msg>No Don, this goes to far.<commit_after>\/\/ KMail startup and initialize code\n\/\/ Author: Stefan Taferner <taferner@alpin.or.at>\n\n#ifdef HAVE_CONFIG_H\n#include <config.h>\n#endif\n#include <errno.h>\n#include <sys\/types.h>\n#include <signal.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n\n#include <qtimer.h>\n\n#include <kuniqueapplication.h>\n#include <klocale.h>\n#include <kglobal.h>\n#include <ksimpleconfig.h>\n#include <kstandarddirs.h>\n#include <knotifyclient.h>\n#include <dcopclient.h>\n#include <kcrash.h>\n\n#include \"kmkernel.h\" \/\/control center\n\n#undef Status \/\/ stupid X headers\n#include \"kmailIface_stub.h\" \/\/ to call control center of master kmail\n\n#include <kaboutdata.h>\n\n#include \"kmversion.h\"\n\n\n\/\/ OLD about text.  This is horrbly outdated.\n\/*const char* aboutText =\n    \"KMail [\" KMAIL_VERSION \"] by\\n\\n\"\n    \"Stefan Taferner <taferner@kde.org>,\\n\"\n    \"Markus Wbben <markus.wuebben@kde.org>\\n\\n\"\n    \"based on the work of:\\n\"\n    \"Lynx <lynx@topaz.hknet.com>,\\n\"\n    \"Stephan Meyer <Stephan.Meyer@pobox.com>,\\n\"\n    \"and the above authors.\\n\\n\"\n    \"This program is covered by the GPL.\\n\\n\"\n    \"Please send bugreports to taferner@kde.org\";\n*\/\n\nstatic KCmdLineOptions kmoptions[] =\n{\n  { \"s\", 0 , 0 },\n  { \"subject <subject>\",\tI18N_NOOP(\"Set subject of message.\"), 0 },\n  { \"c\", 0 , 0 },\n  { \"cc <address>\",\t\tI18N_NOOP(\"Send CC: to 'address'.\"), 0 },\n  { \"b\", 0 , 0 },\n  { \"bcc <address>\",\t\tI18N_NOOP(\"Send BCC: to 'address'.\"), 0 },\n  { \"h\", 0 , 0 },\n  { \"header <header>\",\t\tI18N_NOOP(\"Add 'header' to message.\"), 0 },\n  { \"msg <file>\",\t\tI18N_NOOP(\"Read message body from 'file'.\"), 0 },\n  { \"body <text>\",              I18N_NOOP(\"Set body of message.\"), 0 },\n  { \"attach <url>\",             I18N_NOOP(\"Add an attachment to the mail. This can be repeated.\"), 0 },\n  { \"check\",\t\t\tI18N_NOOP(\"Only check for new mail.\"), 0 },\n  { \"composer\",\t\t\tI18N_NOOP(\"Only open composer window.\"), 0 },\n  { \"+[address]\",\t\tI18N_NOOP(\"Send message to 'address'.\"), 0 },\n\/\/  { \"+[file]\",                  I18N_NOOP(\"Show message from file 'file'.\"), 0 },\n  { 0, 0, 0}\n};\n\n\/\/-----------------------------------------------------------------------------\n\nextern \"C\" {\n\nstatic void setSignalHandler(void (*handler)(int));\n\n\/\/ Crash recovery signal handler\nstatic void signalHandler(int sigId)\n{\n  setSignalHandler(SIG_DFL);\n  fprintf(stderr, \"*** KMail got signal %d (Exiting)\\n\", sigId);\n  \/\/ try to cleanup all windows\n  kernel->dumpDeadLetters();\n  ::exit(-1); \/\/\n}\n\n\/\/ Crash recovery signal handler\nstatic void crashHandler(int sigId)\n{\n  setSignalHandler(SIG_DFL);\n  fprintf(stderr, \"*** KMail got signal %d (Crashing)\\n\", sigId);\n  \/\/ try to cleanup all windows\n  kernel->dumpDeadLetters();\n  \/\/ Return to DrKonqi.\n}\n\/\/-----------------------------------------------------------------------------\n\n\nstatic void setSignalHandler(void (*handler)(int))\n{\n  signal(SIGKILL, handler);\n  signal(SIGTERM, handler);\n  signal(SIGHUP,  handler);\n  KCrash::setEmergencySaveFunction(crashHandler);\n}\n\n}\n\/\/-----------------------------------------------------------------------------\n\nclass KMailApplication : public KUniqueApplication\n{\npublic:\n  KMailApplication() : KUniqueApplication() { };\n\n  virtual int newInstance();\n\n  void commitData(QSessionManager& sm) {\n    kernel->notClosedByUser();\n    KApplication::commitData( sm );\n  }\n};\n\nint KMailApplication::newInstance()\n{\n  QString to, cc, bcc, subj, body;\n  KURL messageFile = QString::null;\n  KURL::List attachURLs;\n  bool mailto = false;\n  bool checkMail = false;\n  \/\/bool viewOnly = false;\n\n  \/\/ process args:\n  KCmdLineArgs *args = KCmdLineArgs::parsedArgs();\n  if (args->getOption(\"subject\"))\n  {\n     mailto = true;\n     subj = QString::fromLocal8Bit(args->getOption(\"subject\"));\n  }\n\n  if (args->getOption(\"cc\"))\n  {\n     mailto = true;\n     cc = QString::fromLocal8Bit(args->getOption(\"cc\"));\n  }\n\n  if (args->getOption(\"bcc\"))\n  {\n     mailto = true;\n     bcc = QString::fromLocal8Bit(args->getOption(\"bcc\"));\n  }\n\n  if (args->getOption(\"msg\"))\n  {\n     mailto = true;\n     messageFile = QString::fromLocal8Bit(args->getOption(\"msg\"));\n  }\n\n  if (args->getOption(\"body\"))\n  {\n     mailto = true;\n     body = QString::fromLocal8Bit(args->getOption(\"body\"));\n  }\n\n  QCStringList attachList = args->getOptionList(\"attach\");\n  if (!attachList.isEmpty())\n  {\n     mailto = true;\n     for ( QCStringList::Iterator it = attachList.begin() ; it != attachList.end() ; ++it )\n       if ( !(*it).isEmpty() )\n         attachURLs += KURL( QString::fromLocal8Bit( *it ) );\n  }\n\n  if (args->isSet(\"composer\"))\n    mailto = true;\n\n  if (args->isSet(\"check\"))\n    checkMail = true;\n\n  for(int i= 0; i < args->count(); i++)\n  {\n    if (!to.isEmpty())\n      to += \", \";\n     if (strncasecmp(args->arg(i),\"mailto:\",7)==0)\n       to += args->arg(i);\n     else\n       to += args->arg(i);\n     mailto = true;\n  }\n\n  args->clear();\n\n  if (!kernel->firstInstance() || !kapp->isRestored())\n    kernel->action (mailto, checkMail, to, cc, bcc, subj, body, messageFile, attachURLs);\n  kernel->setFirstInstance(FALSE);\n  return 0;\n}\n\nnamespace\n{\nQString getMyHostName(void)\n{\n  char hostNameC[256];\n  \/\/ null terminate this C string\n  hostNameC[255] = 0;\n  \/\/ set the string to 0 length if gethostname fails\n  if(gethostname(hostNameC, 255))\n    hostNameC[0] = 0;\n  return QString::fromLocal8Bit(hostNameC);\n}\n}\n\nstatic void checkConfigUpdates() {\n#if KDE_VERSION >= 306\n  KConfig * config = kapp->config();\n  const QString updateFile = QString::fromLatin1(\"kmail.upd\");\n  QStringList updates;\n  updates << \"9\"\n\t  << \"3.1-update-identities\"\n\t  << \"3.1-use-identity-uoids\"\n          << \"3.1-new-mail-notification\";\n  for ( QStringList::const_iterator it = updates.begin() ; it != updates.end() ; ++it )\n    config->checkUpdate( *it, updateFile );\n#endif\n}\n\nint main(int argc, char *argv[])\n{\n  \/\/ WABA: KMail is a KUniqueApplication. Unfortunately this makes debugging\n  \/\/ a bit harder: You should pass --nofork as commandline argument when using\n  \/\/ a debugger. In gdb you can do this by typing \"set args --nofork\" before\n  \/\/ typing \"run\".\n\n  KAboutData about(\"kmail\", I18N_NOOP(\"KMail\"),\n                   KMAIL_VERSION,\n\t\t   I18N_NOOP(\"The KDE Email client.\"),\n\t\t   KAboutData::License_GPL,\n                   I18N_NOOP(\"(c) 1997-2002, The KMail developers\"),\n\t\t   0,\n\t\t   \"http:\/\/kmail.kde.org\");\n  about.addAuthor( \"Michael H\\303\\244ckel\", I18N_NOOP(\"Current maintainer\"), \"haeckel@kde.org\" );\n  about.addAuthor( \"Don Sanders\", I18N_NOOP(\"Core developer and former maintainer\"), \"sanders@kde.org\" );\n  about.addAuthor( \"Stefan Taferner \", I18N_NOOP(\"Original author\"), \"taferner@kde.org\" );\n  about.addAuthor( \"Ingo Kl\\303\\266cker\", I18N_NOOP(\"Encryption\"), \"kloecker@kde.de\" );\n  about.addAuthor( \"Marc Mutz\", I18N_NOOP(\"Core developer\"), \"mutz@kde.org\" );\n  about.addAuthor( \"Daniel Naber\", I18N_NOOP(\"Documentation\"), \"daniel.naber@t-online.de\" );\n  about.addAuthor( \"Andreas Gungl\", I18N_NOOP(\"Encryption\"), \"a.gungl@gmx.de\" );\n\n  about.addAuthor( \"Toyohiro Asukai\", 0, \"toyohiro@ksmplus.com\" );\n  about.addAuthor( \"Waldo Bastian\", 0, \"bastian@kde.org\" );\n  about.addAuthor( \"Carsten Burghardt\", 0, \"carsten.burghardt@web.de\" );\n  about.addAuthor( \"Steven Brown\", 0, \"swbrown@ucsd.edu\" );\n  about.addAuthor( \"Cristi Dumitrescu\", 0, \"cristid@chip.ro\" );\n  about.addAuthor( \"Philippe Fremy\", 0, \"pfremy@chez.com\" );\n  about.addAuthor( \"Kurt Granroth\", 0, \"granroth@kde.org\" );\n  about.addAuthor( \"Heiko Hund\", 0, \"heiko@ist.eigentlich.net\" );\n  about.addAuthor( \"Igor Janssen\", 0, \"rm@linux.ru.net\" );\n  about.addAuthor( \"Matt Johnston\", 0, \"matt@caifex.org\" );\n  about.addAuthor( \"Christer Kaivo-oja\", 0, \"whizkid@telia.com\" );\n  about.addAuthor( \"Lars Knoll\", 0, \"knoll@kde.org\" );\n  about.addAuthor( \"J. Nick Koston\", 0, \"bdraco@darkorb.net\" );\n  about.addAuthor( \"Stephan Kulow\", 0, \"coolo@kde.org\" );\n  about.addAuthor( \"Guillaume Laurent\", 0, \"glaurent@telegraph-road.org\" );\n  about.addAuthor( \"Sam Magnuson\", 0, \"sam@trolltech.com\" );\n  about.addAuthor( \"Laurent Montel\", 0, \"lmontel@mandrakesoft.com\" );\n  about.addAuthor( \"Matt Newell\", 0, \"newellm@proaxis.com\" );\n  about.addAuthor( \"Denis Perchine\", 0, \"dyp@perchine.com\" );\n  about.addAuthor( \"Samuel Penn\", 0, \"sam@bifrost.demon.co.uk\" );\n  about.addAuthor( \"Carsten Pfeiffer\", 0, \"pfeiffer@kde.org\" );\n  about.addAuthor( \"Sven Radej\", 0, \"radej@kde.org\" );\n  about.addAuthor( \"Mark Roberts\", 0, \"mark@taurine.demon.co.uk\" );\n  about.addAuthor( \"Wolfgang Rohdewald\", 0, \"wrohdewald@dplanet.ch\" );\n  about.addAuthor( \"Espen Sand\", 0, \"espen@kde.org\" );\n  about.addAuthor( \"Jan Simonson\", 0, \"jan@simonson.pp.se\" );\n  about.addAuthor( \"George Staikos\", 0, \"staikos@kde.org\" );\n  about.addAuthor( \"Jason Stephenson\", 0, \"panda@mis.net\" );\n  about.addAuthor( \"Jacek Stolarczyk\", 0, \"jacek@mer.chemia.polsl.gliwice.pl\" );\n  about.addAuthor( \"Roberto S. Teixeira\", 0, \"maragato@kde.org\" );\n  about.addAuthor( \"Ronen Tzur\", 0, \"rtzur@shani.net\" );\n  about.addAuthor( \"Mario Weilguni\", 0, \"mweilguni@sime.com\" );\n  about.addAuthor( \"Wynn Wilkes\", 0, \"wynnw@calderasystems.com\" );\n  about.addAuthor( \"Robert D. Williams\", 0, \"rwilliams@kde.org\" );\n  about.addAuthor( \"Markus Wuebben\", 0, \"markus.wuebben@kde.org\" );\n  about.addAuthor( \"Thorsten Zachmann\", 0, \"t.zachmann@zagge.de\" );\n  about.addAuthor( \"Karl-Heinz Zimmer\", 0, \"khz@kde.org\" );\n\n  KCmdLineArgs::init(argc, argv, &about);\n  KCmdLineArgs::addCmdLineOptions( kmoptions ); \/\/ Add kmail options\n\n  if (!KMailApplication::start())\n     return 0;\n\n  KMailApplication app;\n  KGlobal::locale()->insertCatalogue(\"libkdenetwork\");\n\n  \/\/ Check that all updates have been run on the config file:\n  checkConfigUpdates();\n\n  \/\/ Check and create a lock file to prevent concurrent access to kmail files\n  const QString lockLocation = locateLocal(\"appdata\", \"lock\");\n  KSimpleConfig config(lockLocation);\n  int oldPid = config.readNumEntry(\"pid\", -1);\n  const QString oldHostName = config.readEntry(\"hostname\");\n  const QString hostName = getMyHostName();\n  \/\/ proceed if there is no lock at present\n  if (oldPid != -1 &&\n  \/\/ proceed if the lock is our pid, or if the lock is from the same host\n      oldPid != getpid() && hostName != oldHostName &&\n  \/\/ proceed if the pid doesn't exist\n      (kill(oldPid, 0) != -1 || errno != ESRCH))\n  {\n    QString msg = i18n(\"Only one instance of KMail can be run at \"\n      \"any one time. It is already running on a different display \"\n      \"with PID %1 on host %2 according to the lock file located \"\n      \"at %3.\").arg(oldPid).arg(oldHostName).arg(lockLocation);\n\n    KNotifyClient::userEvent( msg,  KNotifyClient::Messagebox,\n      KNotifyClient::Error );\n    fprintf(stderr, \"*** KMail is already running with PID %d on host %s\\n\",\n            oldPid, oldHostName.local8Bit().data());\n    return 1;\n  }\n\n  config.writeEntry(\"pid\", getpid());\n  config.writeEntry(\"hostname\", hostName);\n  config.sync();\n  \n  kapp->dcopClient()->suspend(); \/\/ Don't handle DCOP requests yet\n\n  \/\/local, do the init\n  KMKernel kmailKernel;\n  kmailKernel.init();\n  kapp->dcopClient()->setDefaultObject( kmailKernel.objId() );\n\n  \/\/ and session management\n  kmailKernel.doSessionManagement();\n\n  \/\/ any dead letters?\n  kmailKernel.recoverDeadLetters();\n\n  setSignalHandler(signalHandler);\n\n  kapp->dcopClient()->resume(); \/\/ Ok. We are ready for DCOP requests.\n  \/\/ Go!\n  int ret = kapp->exec();\n\n  \/\/ clean up\n  kmailKernel.cleanup();\n  config.writeEntry(\"pid\", -1);\n  config.sync();\n  return ret;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\/**\n  @file  sparse_adjacency_matrices.cc\n  @brief Tool for calculating persistent homology of sparse adjacency matrices\n\n  This is a tool shipped by 'Aleph - A Library for Exploring Persistent\n  Homology'. It calculates the persistent homology of sparse adjacency\n  matrices, i.e. data sets containing *multiple* graphs, using either\n  a degree filtration or a filtration based on the *sum* of degrees.\n\n  Original author: Bastian Rieck\n*\/\n\n#include <aleph\/geometry\/RipsExpander.hh>\n\n#include <aleph\/math\/KahanSummation.hh>\n\n#include <aleph\/persistentHomology\/Calculation.hh>\n\n#include <aleph\/topology\/FloydWarshall.hh>\n#include <aleph\/topology\/Simplex.hh>\n#include <aleph\/topology\/SimplicialComplex.hh>\n\n#include <aleph\/topology\/filtrations\/Data.hh>\n#include <aleph\/topology\/filtrations\/Degree.hh>\n\n#include <aleph\/topology\/io\/GML.hh>\n#include <aleph\/topology\/io\/SparseAdjacencyMatrix.hh>\n\n#include <aleph\/utilities\/Format.hh>\n#include <aleph\/utilities\/String.hh>\n\n#include <getopt.h>\n\n#include <algorithm>\n#include <fstream>\n#include <iostream>\n#include <limits>\n#include <stdexcept>\n#include <string>\n#include <vector>\n\n#include <cmath>\n\nusing DataType          = float;\nusing VertexType        = std::size_t;\nusing Simplex           = aleph::topology::Simplex<DataType, VertexType>;\nusing SimplicialComplex = aleph::topology::SimplicialComplex<Simplex>;\n\nstd::vector<DataType> closenessCentrality( const SimplicialComplex& K )\n{\n  auto M = aleph::topology::floydWarshall( K, 1 );\n  auto n = M.numRows();\n\n  std::vector<DataType> result;\n  result.reserve( n );\n\n  for( decltype(n) i = 0; i < n; i++ )\n  {\n    aleph::math::KahanSummation<DataType> sum = DataType();\n\n    for( decltype(n) j = 0; j < n; j++ )\n      if( std::isfinite( M(i,j) ) )\n        sum += M(i,j);\n\n    result.push_back( DataType(n) \/ sum );\n  }\n\n  return result;\n}\n\nvoid usage()\n{\n  std::cerr << \"Usage: sparse_adjacency_matrices FILE\\n\"\n            << \"\\n\"\n            << \"Loads a set of sparse adjacency matrices from FILE and performs\\n\"\n            << \"several operations with them. By default, the tool will extract\\n\"\n            << \"all graphs from the file, use a degree-based filtration, and do\\n\"\n            << \"a conversion to GML. Furthermore, persistence diagrams of every\\n\"\n            << \"graph will be calculated.\\n\"\n            << \"\\n\"\n            << \"Optional arguments:\\n\"\n            << \"\\n\"\n            << \" --dimension D: Expand simplicial complexes up to dimension D\\n\"\n            << \" --infinity I:  Use factor I for unpaired points in a diagram\\n\"\n            << \"\\n\"\n            << \"Flags:\\n\"\n            << \"\\n\"\n            << \" --closeness-centrality: Calculates closeness centrality filtration\\n\"\n            << \" --graphs:               Stores converted graphs in GML format\\n\"\n            << \" --sum:                  Calculates degree sum filtration\\n\"\n            << \"\\n\"\n            << \"\\n\";\n}\n\nint main( int argc, char** argv )\n{\n  static option commandLineOptions[] =\n  {\n    { \"dimension\"           , required_argument, nullptr, 'd' },\n    { \"infinity\"            , required_argument, nullptr, 'f' },\n    { \"output\"              , required_argument, nullptr, 'o' },\n    { \"closeness-centrality\", no_argument      , nullptr, 'c' },\n    { \"sum\"                 , no_argument      , nullptr, 's' },\n    { nullptr               , 0                , nullptr,  0  }\n  };\n\n  unsigned dimension                = 0;\n  bool calculateClosenessCentrality = false;\n  bool storeGraphs                  = false;\n  bool useSumOfDegrees              = false;\n  DataType infinity                 = DataType(2);\n  std::string output                = \"\/tmp\";\n\n  {\n    int option = 0;\n    while( ( option = getopt_long( argc, argv, \"d:f:o:cgs\", commandLineOptions, nullptr ) ) != -1 )\n    {\n      switch( option )\n      {\n      case 'd':\n        dimension = static_cast<unsigned>( std::stoul( optarg  ) );\n        break;\n      case 'f':\n        infinity = aleph::utilities::convert<DataType>( optarg );\n        break;\n      case 'o':\n        output = optarg;\n        break;\n      case 'c':\n        calculateClosenessCentrality = true;\n        break;\n      case 'g':\n        storeGraphs = true;\n        break;\n      case 's':\n        useSumOfDegrees = true;\n        break;\n      default:\n        throw std::runtime_error( \"Unknown command-line arugment\" );\n      }\n    }\n  }\n\n  if( ( argc - optind ) < 1 )\n  {\n    usage();\n    return -1;\n  }\n\n  \/\/ Check that the output parameter at least *looks* like a directory\n  if( output.back() != '\/' )\n    output.push_back( '\/' );\n\n  std::string filename = argv[optind++];\n\n  std::vector<SimplicialComplex> simplicialComplexes;\n  std::vector<std::string> labels;\n\n  aleph::topology::io::SparseAdjacencyMatrixReader reader;\n  reader.setReadGraphLabels();\n\n  std::cerr << \"* Reading '\" << filename << \"'...\";\n\n  reader( filename, simplicialComplexes );\n\n  std::cerr << \"finished\\n\"\n            << \"* Read \" << simplicialComplexes.size() << \" simplicial complexes\\n\";\n\n  \/\/ Calculate closeness centrality ------------------------------------\n\n  if( calculateClosenessCentrality )\n  {\n    std::size_t index = 0;\n\n    for( auto&& K : simplicialComplexes )\n    {\n      K.sort();\n      auto cc         = closenessCentrality( K );\n      auto outputPath = output\n                      + aleph::utilities::format( index, simplicialComplexes.size() )\n                      + \"_closeness_centrality.txt\";\n\n      std::cerr << \"* Storing closeness centrality values in '\" << outputPath << \"'\\n\";\n\n      std::ofstream out( outputPath );\n      for( auto&& value : cc )\n        out << value << \"\\n\";\n\n      ++index;\n    }\n  }\n\n  \/\/ Expand simplicial complexes ---------------------------------------\n\n  aleph::geometry::RipsExpander<SimplicialComplex> expander;\n\n  if( dimension != 0 )\n  {\n    std::cerr << \"* Expanding simplicial complexes to dimension \" << dimension << \"...\";\n\n    for( auto&& K : simplicialComplexes )\n      expander( K, dimension );\n\n    std::cerr << \"finished\\n\";\n  }\n\n  \/\/ Calculate degrees -------------------------------------------------\n\n  DataType maxDegree = 0;\n\n  std::cerr << \"* Calculating degree-based filtration...\";\n\n  for( auto&& K : simplicialComplexes )\n  {\n    std::vector<unsigned> degrees_;\n    aleph::topology::filtrations::degrees( K, std::back_inserter( degrees_ ) );\n\n    std::vector<DataType> degrees( degrees_.begin(), degrees_.end() );\n\n    if( !degrees.empty() )\n    {\n      maxDegree\n        = std::max( maxDegree,\n                    *std::max_element( degrees.begin(), degrees.end() ) );\n    }\n\n    if( useSumOfDegrees )\n      K = expander.assignData( K, degrees.begin(), degrees.end(), DataType(0), [] ( DataType a, DataType b ) { return a+b; } );\n    else\n      K = expander.assignMaximumData( K, degrees.begin(), degrees.end() );\n\n    K.sort( aleph::topology::filtrations::Data<Simplex>() );\n  }\n\n  std::cerr << \"finished\\n\"\n            << \"* Identified maximum degree as D=\" << maxDegree << \"\\n\";\n\n  \/\/ Store graphs ------------------------------------------------------\n\n  if( storeGraphs )\n  {\n    aleph::topology::io::GMLWriter writer;\n\n    for( std::size_t i = 0; i < simplicialComplexes.size(); i++ )\n    {\n      auto filename = output\n                      + aleph::utilities::format( i, simplicialComplexes.size() )\n                      + \".gml\";\n\n      std::cerr << \"* Storing graph in '\" << filename << \"'...\";\n\n      writer( filename, simplicialComplexes[i] );\n\n      std::cerr << \"finished\\n\";\n    }\n  }\n\n  \/\/ Calculate persistent homology -------------------------------------\n\n  {\n    std::size_t index = 0;\n\n    for( auto&& K : simplicialComplexes )\n    {\n      bool dualize                    = true;\n      bool includeAllUnpairedCreators = true;\n\n      auto diagrams\n        = aleph::calculatePersistenceDiagrams( K,\n                                               dualize,\n                                               includeAllUnpairedCreators );\n\n      for( auto&& diagram : diagrams )\n      {\n        diagram.removeDiagonal();\n\n        auto outputPath = output\n                        + aleph::utilities::format( index, simplicialComplexes.size() )\n                        + \"_d\"\n                        + std::to_string( diagram.dimension() )\n                        + \".txt\";\n\n        std::ofstream out( outputPath );\n\n        for( auto&& point : diagram )\n        {\n          if( point.isUnpaired() )\n            out << point.x() << \"\\t\" << infinity * maxDegree << \"\\n\";\n          else\n            out << point.x() << \"\\t\" << point.y() << \"\\n\";\n        }\n      }\n\n      ++index;\n    }\n  }\n\n  \/\/ Store labels ------------------------------------------------------\n\n  {\n    std::vector<std::string> labels;\n    reader.graphLabels( std::back_inserter( labels ) );\n\n    auto outputPath = output\n                    + \"Labels.txt\";\n\n    std::cerr << \"* Storing labels in '\" << outputPath << \"'\\n\";\n\n    std::ofstream out( outputPath );\n    for( auto&& label : labels )\n      out << label << \"\\n\";\n  }\n}\n<commit_msg>Added missing command-line argument<commit_after>\/**\n  @file  sparse_adjacency_matrices.cc\n  @brief Tool for calculating persistent homology of sparse adjacency matrices\n\n  This is a tool shipped by 'Aleph - A Library for Exploring Persistent\n  Homology'. It calculates the persistent homology of sparse adjacency\n  matrices, i.e. data sets containing *multiple* graphs, using either\n  a degree filtration or a filtration based on the *sum* of degrees.\n\n  Original author: Bastian Rieck\n*\/\n\n#include <aleph\/geometry\/RipsExpander.hh>\n\n#include <aleph\/math\/KahanSummation.hh>\n\n#include <aleph\/persistentHomology\/Calculation.hh>\n\n#include <aleph\/topology\/FloydWarshall.hh>\n#include <aleph\/topology\/Simplex.hh>\n#include <aleph\/topology\/SimplicialComplex.hh>\n\n#include <aleph\/topology\/filtrations\/Data.hh>\n#include <aleph\/topology\/filtrations\/Degree.hh>\n\n#include <aleph\/topology\/io\/GML.hh>\n#include <aleph\/topology\/io\/SparseAdjacencyMatrix.hh>\n\n#include <aleph\/utilities\/Format.hh>\n#include <aleph\/utilities\/String.hh>\n\n#include <getopt.h>\n\n#include <algorithm>\n#include <fstream>\n#include <iostream>\n#include <limits>\n#include <stdexcept>\n#include <string>\n#include <vector>\n\n#include <cmath>\n\nusing DataType          = float;\nusing VertexType        = std::size_t;\nusing Simplex           = aleph::topology::Simplex<DataType, VertexType>;\nusing SimplicialComplex = aleph::topology::SimplicialComplex<Simplex>;\n\nstd::vector<DataType> closenessCentrality( const SimplicialComplex& K )\n{\n  auto M = aleph::topology::floydWarshall( K, 1 );\n  auto n = M.numRows();\n\n  std::vector<DataType> result;\n  result.reserve( n );\n\n  for( decltype(n) i = 0; i < n; i++ )\n  {\n    aleph::math::KahanSummation<DataType> sum = DataType();\n\n    for( decltype(n) j = 0; j < n; j++ )\n      if( std::isfinite( M(i,j) ) )\n        sum += M(i,j);\n\n    result.push_back( DataType(n) \/ sum );\n  }\n\n  return result;\n}\n\nvoid usage()\n{\n  std::cerr << \"Usage: sparse_adjacency_matrices FILE\\n\"\n            << \"\\n\"\n            << \"Loads a set of sparse adjacency matrices from FILE and performs\\n\"\n            << \"several operations with them. By default, the tool will extract\\n\"\n            << \"all graphs from the file, use a degree-based filtration, and do\\n\"\n            << \"a conversion to GML. Furthermore, persistence diagrams of every\\n\"\n            << \"graph will be calculated.\\n\"\n            << \"\\n\"\n            << \"Optional arguments:\\n\"\n            << \"\\n\"\n            << \" --dimension D: Expand simplicial complexes up to dimension D\\n\"\n            << \" --infinity I:  Use factor I for unpaired points in a diagram\\n\"\n            << \"\\n\"\n            << \"Flags:\\n\"\n            << \"\\n\"\n            << \" --closeness-centrality: Calculates closeness centrality filtration\\n\"\n            << \" --graphs:               Stores converted graphs in GML format\\n\"\n            << \" --sum:                  Calculates degree sum filtration\\n\"\n            << \"\\n\"\n            << \"\\n\";\n}\n\nint main( int argc, char** argv )\n{\n  static option commandLineOptions[] =\n  {\n    { \"dimension\"           , required_argument, nullptr, 'd' },\n    { \"infinity\"            , required_argument, nullptr, 'f' },\n    { \"output\"              , required_argument, nullptr, 'o' },\n    { \"closeness-centrality\", no_argument      , nullptr, 'c' },\n    { \"graphs\"              , no_argument      , nullptr, 'g' },\n    { \"sum\"                 , no_argument      , nullptr, 's' },\n    { nullptr               , 0                , nullptr,  0  }\n  };\n\n  unsigned dimension                = 0;\n  bool calculateClosenessCentrality = false;\n  bool storeGraphs                  = false;\n  bool useSumOfDegrees              = false;\n  DataType infinity                 = DataType(2);\n  std::string output                = \"\/tmp\";\n\n  {\n    int option = 0;\n    while( ( option = getopt_long( argc, argv, \"d:f:o:cgs\", commandLineOptions, nullptr ) ) != -1 )\n    {\n      switch( option )\n      {\n      case 'd':\n        dimension = static_cast<unsigned>( std::stoul( optarg  ) );\n        break;\n      case 'f':\n        infinity = aleph::utilities::convert<DataType>( optarg );\n        break;\n      case 'o':\n        output = optarg;\n        break;\n      case 'c':\n        calculateClosenessCentrality = true;\n        break;\n      case 'g':\n        storeGraphs = true;\n        break;\n      case 's':\n        useSumOfDegrees = true;\n        break;\n      default:\n        throw std::runtime_error( \"Unknown command-line arugment\" );\n      }\n    }\n  }\n\n  if( ( argc - optind ) < 1 )\n  {\n    usage();\n    return -1;\n  }\n\n  \/\/ Check that the output parameter at least *looks* like a directory\n  if( output.back() != '\/' )\n    output.push_back( '\/' );\n\n  std::string filename = argv[optind++];\n\n  std::vector<SimplicialComplex> simplicialComplexes;\n  std::vector<std::string> labels;\n\n  aleph::topology::io::SparseAdjacencyMatrixReader reader;\n  reader.setReadGraphLabels();\n\n  std::cerr << \"* Reading '\" << filename << \"'...\";\n\n  reader( filename, simplicialComplexes );\n\n  std::cerr << \"finished\\n\"\n            << \"* Read \" << simplicialComplexes.size() << \" simplicial complexes\\n\";\n\n  \/\/ Calculate closeness centrality ------------------------------------\n\n  if( calculateClosenessCentrality )\n  {\n    std::size_t index = 0;\n\n    for( auto&& K : simplicialComplexes )\n    {\n      K.sort();\n      auto cc         = closenessCentrality( K );\n      auto outputPath = output\n                      + aleph::utilities::format( index, simplicialComplexes.size() )\n                      + \"_closeness_centrality.txt\";\n\n      std::cerr << \"* Storing closeness centrality values in '\" << outputPath << \"'\\n\";\n\n      std::ofstream out( outputPath );\n      for( auto&& value : cc )\n        out << value << \"\\n\";\n\n      ++index;\n    }\n  }\n\n  \/\/ Expand simplicial complexes ---------------------------------------\n\n  aleph::geometry::RipsExpander<SimplicialComplex> expander;\n\n  if( dimension != 0 )\n  {\n    std::cerr << \"* Expanding simplicial complexes to dimension \" << dimension << \"...\";\n\n    for( auto&& K : simplicialComplexes )\n      expander( K, dimension );\n\n    std::cerr << \"finished\\n\";\n  }\n\n  \/\/ Calculate degrees -------------------------------------------------\n\n  DataType maxDegree = 0;\n\n  std::cerr << \"* Calculating degree-based filtration...\";\n\n  for( auto&& K : simplicialComplexes )\n  {\n    std::vector<unsigned> degrees_;\n    aleph::topology::filtrations::degrees( K, std::back_inserter( degrees_ ) );\n\n    std::vector<DataType> degrees( degrees_.begin(), degrees_.end() );\n\n    if( !degrees.empty() )\n    {\n      maxDegree\n        = std::max( maxDegree,\n                    *std::max_element( degrees.begin(), degrees.end() ) );\n    }\n\n    if( useSumOfDegrees )\n      K = expander.assignData( K, degrees.begin(), degrees.end(), DataType(0), [] ( DataType a, DataType b ) { return a+b; } );\n    else\n      K = expander.assignMaximumData( K, degrees.begin(), degrees.end() );\n\n    K.sort( aleph::topology::filtrations::Data<Simplex>() );\n  }\n\n  std::cerr << \"finished\\n\"\n            << \"* Identified maximum degree as D=\" << maxDegree << \"\\n\";\n\n  \/\/ Store graphs ------------------------------------------------------\n\n  if( storeGraphs )\n  {\n    aleph::topology::io::GMLWriter writer;\n\n    for( std::size_t i = 0; i < simplicialComplexes.size(); i++ )\n    {\n      auto filename = output\n                      + aleph::utilities::format( i, simplicialComplexes.size() )\n                      + \".gml\";\n\n      std::cerr << \"* Storing graph in '\" << filename << \"'...\";\n\n      writer( filename, simplicialComplexes[i] );\n\n      std::cerr << \"finished\\n\";\n    }\n  }\n\n  \/\/ Calculate persistent homology -------------------------------------\n\n  {\n    std::size_t index = 0;\n\n    for( auto&& K : simplicialComplexes )\n    {\n      bool dualize                    = true;\n      bool includeAllUnpairedCreators = true;\n\n      auto diagrams\n        = aleph::calculatePersistenceDiagrams( K,\n                                               dualize,\n                                               includeAllUnpairedCreators );\n\n      for( auto&& diagram : diagrams )\n      {\n        diagram.removeDiagonal();\n\n        auto outputPath = output\n                        + aleph::utilities::format( index, simplicialComplexes.size() )\n                        + \"_d\"\n                        + std::to_string( diagram.dimension() )\n                        + \".txt\";\n\n        std::ofstream out( outputPath );\n\n        for( auto&& point : diagram )\n        {\n          if( point.isUnpaired() )\n            out << point.x() << \"\\t\" << infinity * maxDegree << \"\\n\";\n          else\n            out << point.x() << \"\\t\" << point.y() << \"\\n\";\n        }\n      }\n\n      ++index;\n    }\n  }\n\n  \/\/ Store labels ------------------------------------------------------\n\n  {\n    std::vector<std::string> labels;\n    reader.graphLabels( std::back_inserter( labels ) );\n\n    auto outputPath = output\n                    + \"Labels.txt\";\n\n    std::cerr << \"* Storing labels in '\" << outputPath << \"'\\n\";\n\n    std::ofstream out( outputPath );\n    for( auto&& label : labels )\n      out << label << \"\\n\";\n  }\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/==============================================================================\r\n\/\/ Computer mathematical functions\r\n\/\/==============================================================================\r\n\r\n#include \"computermath.h\"\r\n\r\n\/\/==============================================================================\r\n\r\n#include <math.h>\r\n\r\n\/\/==============================================================================\r\n\r\ndouble factorial(double pNb)\r\n{\r\n    double res = 1.0;\r\n\r\n    while (pNb > 1.0)\r\n        res *= pNb--;\r\n\r\n    return res;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble arbitraryLog(double pNb, double pBase)\r\n{\r\n    return log(pNb)\/log(pBase);\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble factorOf(double pNb1, double pNb2)\r\n{\r\n    return !((int) pNb1 % (int) pNb2);\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble quotient(double pNb1, double pNb2)\r\n{\r\n    return pNb2?(int) pNb1\/(int) pNb2:pNb1\/0.0;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble rem(double pNb1, double pNb2)\r\n{\r\n    return pNb2?(int) pNb1 % (int) pNb2:pNb1\/0.0;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble xOr(double pNb1, double pNb2)\r\n{\r\n    return (pNb1 != 0)^(pNb2 != 0);\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble gcdPair(double pNb1, double pNb2)\r\n{\r\n    #define EVEN(pNb) !(pNb & 1)\r\n\r\n    uint32_t intNb1 = fabs(pNb1);\r\n    uint32_t intNb2 = fabs(pNb2);\r\n\r\n    if (!intNb1)\r\n        return intNb2;\r\n\r\n    if (!intNb2)\r\n        return intNb1;\r\n\r\n    int shift = 0;\r\n\r\n    while (EVEN(intNb1) && EVEN(intNb2)) {\r\n        ++shift;\r\n\r\n        intNb1 >>= 1;\r\n        intNb2 >>= 1;\r\n    }\r\n\r\n    do {\r\n        if (EVEN(intNb1))\r\n          intNb1 >>= 1;\r\n        else if (EVEN(intNb2))\r\n            intNb2 >>= 1;\r\n        else if (intNb1 >= intNb2)\r\n            intNb1 = (intNb1-intNb2) >> 1;\r\n        else\r\n            intNb2 = (intNb2-intNb1) >> 1;\r\n    } while (intNb1);\r\n\r\n    return intNb2 << shift;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble lcmPair(double pNb1, double pNb2)\r\n{\r\n    return (pNb1*pNb2)\/gcdPair(pNb1, pNb2);\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble gcd(int pCount, ...)\r\n{\r\n    if (!pCount)\r\n        return 1.0;\r\n\r\n    va_list parameters;\r\n    double *storage1, *storage2, *tempStorage;\r\n    int i, iMax, j = 0;\r\n\r\n    storage1 = new double[pCount];\r\n    storage2 = new double[pCount >> 1];\r\n\r\n    va_start(parameters, pCount);\r\n        for (i = 0, iMax = pCount-1; i < iMax; i += 2) {\r\n            double param1, param2;\r\n\r\n            param1 = va_arg(parameters, double);\r\n            param2 = va_arg(parameters, double);\r\n\r\n            storage1[j++] = gcdPair(param1, param2);\r\n        }\r\n\r\n        if (i < pCount)\r\n            storage1[j++] = va_arg(parameters, double);\r\n    va_end(parameters);\r\n\r\n    while (j != 1) {\r\n        pCount = j;\r\n        j = 0;\r\n\r\n        for (i = 0, iMax = j-1; i < iMax; i += 2)\r\n            storage2[j++] = gcdPair(storage1[i], storage1[i+1]);\r\n\r\n        if (i < j)\r\n            storage2[j++] = storage1[i];\r\n\r\n        tempStorage = storage1;\r\n\r\n        storage1 = storage2;\r\n        storage2 = tempStorage;\r\n    }\r\n\r\n    double res = storage1[0];\r\n\r\n    delete[] storage1;\r\n    delete[] storage2;\r\n\r\n    return res;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble lcm(int pCount, ...)\r\n{\r\n    if (!pCount)\r\n        return 1.0;\r\n\r\n    va_list parameters;\r\n    double *storage1, *storage2, *tempStorage;\r\n    int i, iMax, j = 0;\r\n\r\n    storage1 = new double[pCount];\r\n    storage2 = new double[pCount >> 1];\r\n\r\n    va_start(parameters, pCount);\r\n        for (i = 0, iMax = pCount-1; i < iMax; i += 2) {\r\n            double param1, param2;\r\n\r\n            param1 = va_arg(parameters, double);\r\n            param2 = va_arg(parameters, double);\r\n\r\n            storage1[j++] = lcmPair(param1, param2);\r\n        }\r\n\r\n        if (i < pCount)\r\n            storage1[j++] = va_arg(parameters, double);\r\n    va_end(parameters);\r\n\r\n    while (j != 1) {\r\n        pCount = j;\r\n        j = 0;\r\n\r\n        for (i = 0, iMax = j-1; i < iMax; i += 2)\r\n            storage2[j++] = lcmPair(storage1[i], storage1[i+1]);\r\n\r\n        if (i < j)\r\n            storage2[j++] = storage1[i];\r\n\r\n        tempStorage = storage1;\r\n\r\n        storage1 = storage2;\r\n        storage2 = tempStorage;\r\n    }\r\n\r\n    double res = storage1[0];\r\n\r\n    delete[] storage1;\r\n    delete[] storage2;\r\n\r\n    return res;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble max(int pCount, ...)\r\n{\r\n    if (!pCount)\r\n        return strtod(\"NAN\", NULL);\r\n\r\n    va_list parameters;\r\n    double best, attempt;\r\n\r\n    va_start(parameters, pCount);\r\n        best = va_arg(parameters, double);\r\n\r\n        while (--pCount) {\r\n            attempt = va_arg(parameters, double);\r\n\r\n            if (attempt > best)\r\n                best = attempt;\r\n        }\r\n    va_end(parameters);\r\n\r\n    return best;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble min(int pCount, ...)\r\n{\r\n    if (!pCount)\r\n        return strtod(\"NAN\", NULL);\r\n\r\n    va_list parameters;\r\n    double best, attempt;\r\n\r\n    va_start(parameters, pCount);\r\n        best = va_arg(parameters, double);\r\n\r\n        while (--pCount) {\r\n            attempt = va_arg(parameters, double);\r\n\r\n            if (attempt < best)\r\n                best = attempt;\r\n        }\r\n    va_end(parameters);\r\n\r\n    return best;\r\n}\r\n\r\n\/\/==============================================================================\r\n\/\/ End of file\r\n\/\/==============================================================================\r\n<commit_msg>Fixed the CellML-based multi-parametr gcd and lcm functions which were wrong (loops for ever).<commit_after>\/\/==============================================================================\r\n\/\/ Computer mathematical functions\r\n\/\/==============================================================================\r\n\r\n#include \"computermath.h\"\r\n\r\n\/\/==============================================================================\r\n\r\n#include <math.h>\r\n\r\n\/\/==============================================================================\r\n\r\ndouble factorial(double pNb)\r\n{\r\n    double res = 1.0;\r\n\r\n    while (pNb > 1.0)\r\n        res *= pNb--;\r\n\r\n    return res;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble arbitraryLog(double pNb, double pBase)\r\n{\r\n    return log(pNb)\/log(pBase);\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble factorOf(double pNb1, double pNb2)\r\n{\r\n    return !((int) pNb1 % (int) pNb2);\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble quotient(double pNb1, double pNb2)\r\n{\r\n    return pNb2?(int) pNb1\/(int) pNb2:pNb1\/0.0;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble rem(double pNb1, double pNb2)\r\n{\r\n    return pNb2?(int) pNb1 % (int) pNb2:pNb1\/0.0;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble xOr(double pNb1, double pNb2)\r\n{\r\n    return (pNb1 != 0)^(pNb2 != 0);\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble gcdPair(double pNb1, double pNb2)\r\n{\r\n    #define EVEN(pNb) !(pNb & 1)\r\n\r\n    uint32_t intNb1 = fabs(pNb1);\r\n    uint32_t intNb2 = fabs(pNb2);\r\n\r\n    if (!intNb1)\r\n        return intNb2;\r\n\r\n    if (!intNb2)\r\n        return intNb1;\r\n\r\n    int shift = 0;\r\n\r\n    while (EVEN(intNb1) && EVEN(intNb2)) {\r\n        ++shift;\r\n\r\n        intNb1 >>= 1;\r\n        intNb2 >>= 1;\r\n    }\r\n\r\n    do {\r\n        if (EVEN(intNb1))\r\n          intNb1 >>= 1;\r\n        else if (EVEN(intNb2))\r\n            intNb2 >>= 1;\r\n        else if (intNb1 >= intNb2)\r\n            intNb1 = (intNb1-intNb2) >> 1;\r\n        else\r\n            intNb2 = (intNb2-intNb1) >> 1;\r\n    } while (intNb1);\r\n\r\n    return intNb2 << shift;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble lcmPair(double pNb1, double pNb2)\r\n{\r\n    return (pNb1*pNb2)\/gcdPair(pNb1, pNb2);\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble gcd(int pCount, ...)\r\n{\r\n    if (!pCount)\r\n        return 1.0;\r\n\r\n    va_list parameters;\r\n\r\n    va_start(parameters, pCount);\r\n        double res = va_arg(parameters, double);\r\n\r\n        while (--pCount)\r\n            res = gcdPair(res, va_arg(parameters, double));\r\n    va_end(parameters);\r\n\r\n    return res;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble lcm(int pCount, ...)\r\n{\r\n    if (!pCount)\r\n        return 1.0;\r\n\r\n    va_list parameters;\r\n\r\n    va_start(parameters, pCount);\r\n        double res = va_arg(parameters, double);\r\n\r\n        while (--pCount)\r\n            res = lcmPair(res, va_arg(parameters, double));\r\n    va_end(parameters);\r\n\r\n    return res;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble max(int pCount, ...)\r\n{\r\n    if (!pCount)\r\n        return strtod(\"NAN\", NULL);\r\n\r\n    va_list parameters;\r\n\r\n    va_start(parameters, pCount);\r\n        double res = va_arg(parameters, double);\r\n        double otherParameter;\r\n\r\n        while (--pCount) {\r\n            otherParameter = va_arg(parameters, double);\r\n\r\n            if (otherParameter > res)\r\n                res = otherParameter;\r\n        }\r\n    va_end(parameters);\r\n\r\n    return res;\r\n}\r\n\r\n\/\/==============================================================================\r\n\r\ndouble min(int pCount, ...)\r\n{\r\n    if (!pCount)\r\n        return strtod(\"NAN\", NULL);\r\n\r\n    va_list parameters;\r\n\r\n    va_start(parameters, pCount);\r\n        double res = va_arg(parameters, double);\r\n        double otherParameter;\r\n\r\n        while (--pCount) {\r\n            otherParameter = va_arg(parameters, double);\r\n\r\n            if (otherParameter < res)\r\n                res = otherParameter;\r\n        }\r\n    va_end(parameters);\r\n\r\n    return res;\r\n}\r\n\r\n\/\/==============================================================================\r\n\/\/ End of file\r\n\/\/==============================================================================\r\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Filename: panda.cxx\n\/\/ Created by:  drose (15May00)\n\/\/ \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"panda.h\"\n\n#include \"config_device.h\"\n#include \"config_display.h\"\n#include \"config_pnmimagetypes.h\"\n#include \"config_pgraph.h\"\n#ifdef DO_PSTATS\n#include \"config_pstats.h\"\n#endif\n\n\/\/ By including checkPandaVersion.h, we guarantee that runtime\n\/\/ attempts to load libpanda.so\/.dll will fail if they inadvertently\n\/\/ link with the wrong version of libdtool.so\/.dll.\n\n#include \"checkPandaVersion.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: init_libpanda\n\/\/  Description: Initializes the library.  This must be called at\n\/\/               least once before any of the functions or classes in\n\/\/               this library can be used.  Normally it will be\n\/\/               called by the static initializers and need not be\n\/\/               called explicitly, but special cases exist.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid\ninit_libpanda() {\n  init_libdevice();\n  init_libdisplay();\n  init_libpgraph();\n  init_libpnmimagetypes();\n#ifdef DO_PSTATS\n  init_libpstatclient();\n#endif\n}\n<commit_msg>pnmimagetypes must be listed first<commit_after>\/\/ Filename: panda.cxx\n\/\/ Created by:  drose (15May00)\n\/\/ \n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"panda.h\"\n\n#include \"config_pnmimagetypes.h\"\n#include \"config_device.h\"\n#include \"config_display.h\"\n#include \"config_pgraph.h\"\n#ifdef DO_PSTATS\n#include \"config_pstats.h\"\n#endif\n\n\/\/ By including checkPandaVersion.h, we guarantee that runtime\n\/\/ attempts to load libpanda.so\/.dll will fail if they inadvertently\n\/\/ link with the wrong version of libdtool.so\/.dll.\n\n#include \"checkPandaVersion.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/     Function: init_libpanda\n\/\/  Description: Initializes the library.  This must be called at\n\/\/               least once before any of the functions or classes in\n\/\/               this library can be used.  Normally it will be\n\/\/               called by the static initializers and need not be\n\/\/               called explicitly, but special cases exist.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid\ninit_libpanda() {\n  init_libpnmimagetypes();\n  init_libdevice();\n  init_libdisplay();\n  init_libpgraph();\n#ifdef DO_PSTATS\n  init_libpstatclient();\n#endif\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef LIGHTGBM_OBJECTIVE_BINARY_OBJECTIVE_HPP_\n#define LIGHTGBM_OBJECTIVE_BINARY_OBJECTIVE_HPP_\n\n#include <LightGBM\/objective_function.h>\n\n#include <cstring>\n#include <cmath>\n\nnamespace LightGBM {\n\/*!\n* \\brief Objective function for binary classification\n*\/\nclass BinaryLogloss: public ObjectiveFunction {\npublic:\n  explicit BinaryLogloss(const ObjectiveConfig& config, std::function<bool(label_t)> is_pos = nullptr) {\n    sigmoid_ = static_cast<double>(config.sigmoid);\n    if (sigmoid_ <= 0.0) {\n      Log::Fatal(\"Sigmoid parameter %f should be greater than zero\", sigmoid_);\n    }\n    is_unbalance_ = config.is_unbalance;\n    scale_pos_weight_ = static_cast<double>(config.scale_pos_weight);\n    if(is_unbalance_ && std::fabs(scale_pos_weight_ - 1.0f) > 1e-6) {\n      Log::Fatal(\"Cannot set is_unbalance and scale_pos_weight at the same time\");\n    }\n    is_pos_ = is_pos;\n    if (is_pos_ == nullptr) {\n      is_pos_ = [](label_t label) {return label > 0; };\n    }\n  }\n\n  explicit BinaryLogloss(const std::vector<std::string>& strs) {\n    sigmoid_ = -1;\n    for (auto str : strs) {\n      auto tokens = Common::Split(str.c_str(), ':');\n      if (tokens.size() == 2) {\n        if (tokens[0] == std::string(\"sigmoid\")) {\n          Common::Atof(tokens[1].c_str(), &sigmoid_);\n        }\n      }\n    }\n    if (sigmoid_ <= 0.0) {\n      Log::Fatal(\"Sigmoid parameter %f should be greater than zero\", sigmoid_);\n    }\n  }\n\n  ~BinaryLogloss() {}\n\n  void Init(const Metadata& metadata, data_size_t num_data) override {\n    num_data_ = num_data;\n    label_ = metadata.label();\n    weights_ = metadata.weights();\n    data_size_t cnt_positive = 0;\n    data_size_t cnt_negative = 0;\n    \/\/ count for positive and negative samples\n    #pragma omp parallel for schedule(static) reduction(+:cnt_positive, cnt_negative)\n    for (data_size_t i = 0; i < num_data_; ++i) {\n      if (is_pos_(label_[i])) {\n        ++cnt_positive;\n      } else {\n        ++cnt_negative;\n      }\n    }\n    if (cnt_negative == 0 || cnt_positive == 0) {\n      Log::Warning(\"Contains only one class\");\n      \/\/ not need to boost.\n      num_data_ = 0;\n    }\n    Log::Info(\"Number of positive: %d, number of negative: %d\", cnt_positive, cnt_negative);\n    \/\/ use -1 for negative class, and 1 for positive class\n    label_val_[0] = -1;\n    label_val_[1] = 1;\n    \/\/ weight for label\n    label_weights_[0] = 1.0f;\n    label_weights_[1] = 1.0f;\n    \/\/ if using unbalance, change the labels weight\n    if (is_unbalance_ && cnt_positive > 0 && cnt_negative > 0) {\n      if (cnt_positive > cnt_negative) {\n        label_weights_[1] = 1.0f;\n        label_weights_[0] = static_cast<double>(cnt_positive) \/ cnt_negative;\n      } else {\n        label_weights_[1] = static_cast<double>(cnt_negative) \/ cnt_positive;\n        label_weights_[0] = 1.0f;\n      }\n    }\n    label_weights_[1] *= scale_pos_weight_;\n  }\n\n  void GetGradients(const double* score, score_t* gradients, score_t* hessians) const override {\n    if (weights_ == nullptr) {\n      #pragma omp parallel for schedule(static)\n      for (data_size_t i = 0; i < num_data_; ++i) {\n        \/\/ get label and label weights\n        const int is_pos = is_pos_(label_[i]);\n        const int label = label_val_[is_pos];\n        const double label_weight = label_weights_[is_pos];\n        \/\/ calculate gradients and hessians\n        const double response = -label * sigmoid_ \/ (1.0f + std::exp(label * sigmoid_ * score[i]));\n        const double abs_response = fabs(response);\n        gradients[i] = static_cast<score_t>(response * label_weight);\n        hessians[i] = static_cast<score_t>(abs_response * (sigmoid_ - abs_response) * label_weight);\n      }\n    } else {\n      #pragma omp parallel for schedule(static)\n      for (data_size_t i = 0; i < num_data_; ++i) {\n        \/\/ get label and label weights\n        const int is_pos = is_pos_(label_[i]);\n        const int label = label_val_[is_pos];\n        const double label_weight = label_weights_[is_pos];\n        \/\/ calculate gradients and hessians\n        const double response = -label * sigmoid_ \/ (1.0f + std::exp(label * sigmoid_ * score[i]));\n        const double abs_response = fabs(response);\n        gradients[i] = static_cast<score_t>(response * label_weight  * weights_[i]);\n        hessians[i] = static_cast<score_t>(abs_response * (sigmoid_ - abs_response) * label_weight * weights_[i]);\n      }\n    }\n  }\n\n  const char* GetName() const override {\n    return \"binary\";\n  }\n\n  void ConvertOutput(const double* input, double* output) const override {\n    output[0] = 1.0f \/ (1.0f + std::exp(-sigmoid_ * input[0]));\n  }\n\n  std::string ToString() const override {\n    std::stringstream str_buf;\n    str_buf << GetName() << \" \";\n    str_buf << \"sigmoid:\" << sigmoid_;\n    return str_buf.str();\n  }\n\n  bool SkipEmptyClass() const override { return true; }\n\n  bool NeedAccuratePrediction() const override { return false; }\n\nprivate:\n  \/*! \\brief Number of data *\/\n  data_size_t num_data_;\n  \/*! \\brief Pointer of label *\/\n  const label_t* label_;\n  \/*! \\brief True if using unbalance training *\/\n  bool is_unbalance_;\n  \/*! \\brief Sigmoid parameter *\/\n  double sigmoid_;\n  \/*! \\brief Values for positive and negative labels *\/\n  int label_val_[2];\n  \/*! \\brief Weights for positive and negative labels *\/\n  double label_weights_[2];\n  \/*! \\brief Weights for data *\/\n  const label_t* weights_;\n  double scale_pos_weight_;\n  std::function<bool(label_t)> is_pos_;\n};\n\n}  \/\/ namespace LightGBM\n#endif   \/\/ LightGBM_OBJECTIVE_BINARY_OBJECTIVE_HPP_\n<commit_msg>Enable boost_from_average as default for binary objective (#1361)<commit_after>#ifndef LIGHTGBM_OBJECTIVE_BINARY_OBJECTIVE_HPP_\n#define LIGHTGBM_OBJECTIVE_BINARY_OBJECTIVE_HPP_\n\n#include <LightGBM\/objective_function.h>\n\n#include <cstring>\n#include <cmath>\n\nnamespace LightGBM {\n\/*!\n* \\brief Objective function for binary classification\n*\/\nclass BinaryLogloss: public ObjectiveFunction {\npublic:\n  explicit BinaryLogloss(const ObjectiveConfig& config, std::function<bool(label_t)> is_pos = nullptr) {\n    sigmoid_ = static_cast<double>(config.sigmoid);\n    if (sigmoid_ <= 0.0) {\n      Log::Fatal(\"Sigmoid parameter %f should be greater than zero\", sigmoid_);\n    }\n    is_unbalance_ = config.is_unbalance;\n    scale_pos_weight_ = static_cast<double>(config.scale_pos_weight);\n    if(is_unbalance_ && std::fabs(scale_pos_weight_ - 1.0f) > 1e-6) {\n      Log::Fatal(\"Cannot set is_unbalance and scale_pos_weight at the same time\");\n    }\n    is_pos_ = is_pos;\n    if (is_pos_ == nullptr) {\n      is_pos_ = [](label_t label) {return label > 0; };\n    }\n  }\n\n  explicit BinaryLogloss(const std::vector<std::string>& strs) {\n    sigmoid_ = -1;\n    for (auto str : strs) {\n      auto tokens = Common::Split(str.c_str(), ':');\n      if (tokens.size() == 2) {\n        if (tokens[0] == std::string(\"sigmoid\")) {\n          Common::Atof(tokens[1].c_str(), &sigmoid_);\n        }\n      }\n    }\n    if (sigmoid_ <= 0.0) {\n      Log::Fatal(\"Sigmoid parameter %f should be greater than zero\", sigmoid_);\n    }\n  }\n\n  ~BinaryLogloss() {}\n\n  void Init(const Metadata& metadata, data_size_t num_data) override {\n    num_data_ = num_data;\n    label_ = metadata.label();\n    weights_ = metadata.weights();\n    data_size_t cnt_positive = 0;\n    data_size_t cnt_negative = 0;\n    \/\/ count for positive and negative samples\n    #pragma omp parallel for schedule(static) reduction(+:cnt_positive, cnt_negative)\n    for (data_size_t i = 0; i < num_data_; ++i) {\n      if (is_pos_(label_[i])) {\n        ++cnt_positive;\n      } else {\n        ++cnt_negative;\n      }\n    }\n    if (cnt_negative == 0 || cnt_positive == 0) {\n      Log::Warning(\"Contains only one class\");\n      \/\/ not need to boost.\n      num_data_ = 0;\n    }\n    Log::Info(\"Number of positive: %d, number of negative: %d\", cnt_positive, cnt_negative);\n    \/\/ use -1 for negative class, and 1 for positive class\n    label_val_[0] = -1;\n    label_val_[1] = 1;\n    \/\/ weight for label\n    label_weights_[0] = 1.0f;\n    label_weights_[1] = 1.0f;\n    \/\/ if using unbalance, change the labels weight\n    if (is_unbalance_ && cnt_positive > 0 && cnt_negative > 0) {\n      if (cnt_positive > cnt_negative) {\n        label_weights_[1] = 1.0f;\n        label_weights_[0] = static_cast<double>(cnt_positive) \/ cnt_negative;\n      } else {\n        label_weights_[1] = static_cast<double>(cnt_negative) \/ cnt_positive;\n        label_weights_[0] = 1.0f;\n      }\n    }\n    label_weights_[1] *= scale_pos_weight_;\n  }\n\n  void GetGradients(const double* score, score_t* gradients, score_t* hessians) const override {\n    if (weights_ == nullptr) {\n      #pragma omp parallel for schedule(static)\n      for (data_size_t i = 0; i < num_data_; ++i) {\n        \/\/ get label and label weights\n        const int is_pos = is_pos_(label_[i]);\n        const int label = label_val_[is_pos];\n        const double label_weight = label_weights_[is_pos];\n        \/\/ calculate gradients and hessians\n        const double response = -label * sigmoid_ \/ (1.0f + std::exp(label * sigmoid_ * score[i]));\n        const double abs_response = fabs(response);\n        gradients[i] = static_cast<score_t>(response * label_weight);\n        hessians[i] = static_cast<score_t>(abs_response * (sigmoid_ - abs_response) * label_weight);\n      }\n    } else {\n      #pragma omp parallel for schedule(static)\n      for (data_size_t i = 0; i < num_data_; ++i) {\n        \/\/ get label and label weights\n        const int is_pos = is_pos_(label_[i]);\n        const int label = label_val_[is_pos];\n        const double label_weight = label_weights_[is_pos];\n        \/\/ calculate gradients and hessians\n        const double response = -label * sigmoid_ \/ (1.0f + std::exp(label * sigmoid_ * score[i]));\n        const double abs_response = fabs(response);\n        gradients[i] = static_cast<score_t>(response * label_weight  * weights_[i]);\n        hessians[i] = static_cast<score_t>(abs_response * (sigmoid_ - abs_response) * label_weight * weights_[i]);\n      }\n    }\n  }\n  \n  \/\/ implement custom average to boost from (if enabled among options)\n  double BoostFromScore() const override {\n    double suml = 0.0f;\n    double sumw = 0.0f;\n    if (weights_ != nullptr) {\n      #pragma omp parallel for schedule(static) reduction(+:suml,sumw)\n      for (data_size_t i = 0; i < num_data_; ++i) {\n        suml += label_[i] * weights_[i];\n        sumw += weights_[i];\n      }\n    } else {\n      sumw = static_cast<double>(num_data_);\n      #pragma omp parallel for schedule(static) reduction(+:suml)\n      for (data_size_t i = 0; i < num_data_; ++i) {\n        suml += label_[i];\n      }\n    }\n    double pavg = suml \/ sumw;\n    double initscore = std::log(pavg \/ (1.0f - pavg)) \/ sigmoid_;\n    Log::Info(\"[%s:%s]: pavg=%f -> initscore=%f\",  GetName(), __func__, pavg, initscore);\n    return initscore;\n  }\n\n  const char* GetName() const override {\n    return \"binary\";\n  }\n\n  void ConvertOutput(const double* input, double* output) const override {\n    output[0] = 1.0f \/ (1.0f + std::exp(-sigmoid_ * input[0]));\n  }\n\n  std::string ToString() const override {\n    std::stringstream str_buf;\n    str_buf << GetName() << \" \";\n    str_buf << \"sigmoid:\" << sigmoid_;\n    return str_buf.str();\n  }\n\n  bool SkipEmptyClass() const override { return true; }\n\n  bool NeedAccuratePrediction() const override { return false; }\n\nprivate:\n  \/*! \\brief Number of data *\/\n  data_size_t num_data_;\n  \/*! \\brief Pointer of label *\/\n  const label_t* label_;\n  \/*! \\brief True if using unbalance training *\/\n  bool is_unbalance_;\n  \/*! \\brief Sigmoid parameter *\/\n  double sigmoid_;\n  \/*! \\brief Values for positive and negative labels *\/\n  int label_val_[2];\n  \/*! \\brief Weights for positive and negative labels *\/\n  double label_weights_[2];\n  \/*! \\brief Weights for data *\/\n  const label_t* weights_;\n  double scale_pos_weight_;\n  std::function<bool(label_t)> is_pos_;\n};\n\n}  \/\/ namespace LightGBM\n#endif   \/\/ LightGBM_OBJECTIVE_BINARY_OBJECTIVE_HPP_\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#include <fstream>\n\n\/\/ Local includes\n#include \"tetgen_io.h\"\n#include \"mesh_base.h\"\n#include \"cell_tet4.h\"\n#include \"cell_tet10.h\"\n#include \"mesh_data.h\"\n\nnamespace libMesh\n{\n\n\/\/ ------------------------------------------------------------\n\/\/ TetgenIO class members\nvoid TetGenIO::read (const std::string& name)\n{\n  \/\/ This is a serial-only process for now;\n  \/\/ the Mesh should be read on processor 0 and\n  \/\/ broadcast later\n  libmesh_assert(libMesh::processor_id() == 0);\n\n  std::string name_node, name_ele, dummy;\n\n  \/\/ tetgen only works in 3D\n  MeshInput<MeshBase>::mesh().set_mesh_dimension(3);\n\n#if LIBMESH_DIM < 3\n  libMesh::err << \"Cannot open dimension 3 mesh file when configured without 3D support.\" <<\n                  std::endl;\n  libmesh_error();\n#endif\n\n  \/\/ Check name for *.node or *.ele extension.\n  \/\/ Set std::istream for node_stream and ele_stream.\n  \/\/\n  if (name.rfind(\".node\") < name.size())\n    {\n      name_node = name;\n      dummy     = name;\n      int position = dummy.rfind(\".node\");\n      name_ele     = dummy.replace(position, 5, \".ele\");\n    }\n  else if (name.rfind(\".ele\") < name.size())\n    {\n      name_ele = name;\n      dummy    = name;\n      int position = dummy.rfind(\".ele\");\n      name_node    = dummy.replace(position, 4, \".node\");\n    }\n  else\n    {\n      libMesh::err << \"ERROR: Unrecognized file name: \"\n\t\t    << name << std::endl;\n      libmesh_error();\n    }\n\n\n\n  \/\/ Set the streams from which to read in\n  std::ifstream node_stream (name_node.c_str());\n  std::ifstream ele_stream  (name_ele.c_str());\n\n  if ( !node_stream.good() || !ele_stream.good() )\n    {\n      libMesh::err << \"ERROR: One or both Input file(s) not good.\" << std::endl\n\t\t    << \"Error checking files \"\n\t\t    << name_node << \" and \"\n\t\t    << name_ele  << std::endl;\n      libmesh_error();\n    }\n  libMesh::out<< \"TetGenIO found the tetgen files to read \" <<std::endl;\n\n  \/\/ Skip the comment lines at the beginning\n  this->skip_comment_lines (node_stream, '#');\n  this->skip_comment_lines (ele_stream, '#');\n\n  \/\/ Read the nodes and elements from the streams\n  this->read_nodes_and_elem (node_stream, ele_stream);\n  libMesh::out<< \"TetGenIO read in nodes and elements \" <<std::endl;\n}\n\n\n\nvoid TetGenIO::read_nodes_and_elem (std::istream& node_stream,\n\t\t\t\t    std::istream& ele_stream)\n{\n  _num_nodes    = 0;\n  _num_elements = 0;\n\n  \/\/ Read all the datasets.\n  this->node_in    (node_stream);\n  this->element_in (ele_stream);\n\n  \/\/ Tell the MeshData object that we are finished\n  \/\/ reading data.\n  if (this->_mesh_data != NULL)\n    this->_mesh_data->close_foreign_id_maps ();\n\n  \/\/ some more clean-up\n  _assign_nodes.clear();\n}\n\n\n\n\/\/----------------------------------------------------------------------\n\/\/ Function to read in the node table.\nvoid TetGenIO::node_in (std::istream& node_stream)\n{\n  \/\/ Check input buffer\n  libmesh_assert (node_stream.good());\n\n  \/\/ Get a reference to the mesh\n  MeshBase& mesh = MeshInput<MeshBase>::mesh();\n\n  unsigned int dimension=0, nAttributes=0, BoundaryMarkers=0;\n\n  node_stream >> _num_nodes       \/\/ Read the number of nodes from the stream\n\t      >> dimension        \/\/ Read the dimension from the stream\n\t      >> nAttributes      \/\/ Read the number of attributes from stream\n\t      >> BoundaryMarkers; \/\/ Read if or not boundary markers are included in *.node (0 or 1)\n\n  \/\/ Read the nodal coordinates from the node_stream (*.node file).\n  unsigned int node_lab=0;\n  Point xyz;\n  Real dummy;\n\n  \/\/ If present, make room for node attributes to be stored.\n  this->node_attributes.resize(nAttributes);\n  for (unsigned i=0; i<nAttributes; ++i)\n    this->node_attributes[i].resize(_num_nodes);\n\n\n  for (unsigned int i=0; i<_num_nodes; i++)\n    {\n      \/\/ Check input buffer\n      libmesh_assert (node_stream.good());\n\n      node_stream >> node_lab  \/\/ node number\n\t\t  >> xyz(0)    \/\/ x-coordinate value\n\t\t  >> xyz(1)    \/\/ y-coordinate value\n\t\t  >> xyz(2);   \/\/ z-coordinate value\n\n      \/\/ Read and store attributes from the stream.\n      for (unsigned int j=0; j<nAttributes; j++)\n\tnode_stream >> node_attributes[j][i];\n\n      \/\/ Read (and discard) boundary marker if BoundaryMarker=1.\n      \/\/ TODO: should we store this somehow?\n      if (BoundaryMarkers == 1)\n\tnode_stream >> dummy;\n\n      \/\/ Store the new position of the node under its label.\n      \/\/_assign_nodes.insert (std::make_pair(node_lab,i));\n      _assign_nodes[node_lab] = i;\n\n      \/\/ do this irrespective whether MeshData exists\n      Node* newnode = mesh.add_point(xyz, i);\n\n      \/\/ Add node to the nodes vector &\n      \/\/ tell the MeshData object the foreign node id.\n      if (this->_mesh_data != NULL)\n\tthis->_mesh_data->add_foreign_node_id (newnode, node_lab);\n    }\n}\n\n\n\n\/\/----------------------------------------------------------------------\n\/\/ Function to read in the element table.\nvoid TetGenIO::element_in (std::istream& ele_stream)\n{\n  \/\/ Check input buffer\n  libmesh_assert (ele_stream.good());\n\n  \/\/ Get a reference to the mesh\n  MeshBase& mesh = MeshInput<MeshBase>::mesh();\n\n  \/\/ Read the elements from the ele_stream (*.ele file).\n  unsigned int element_lab=0, n_nodes=0, nAttri=0;\n\n  ele_stream >> _num_elements \/\/ Read the number of tetrahedrons from the stream.\n\t     >> n_nodes       \/\/ Read the number of nodes per tetrahedron from the stream (defaults to 4).\n\t     >> nAttri;       \/\/ Read the number of attributes from stream.\n\n  \/\/ Vector that assigns element nodes to their correct position.\n  \/\/ TetGen is normaly 0-based\n  \/\/ (right now this is strictly not necessary since it is the identity map,\n  \/\/  but in the future TetGen could change their numbering scheme.)\n  static const unsigned int assign_elm_nodes[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9};\n\n  \/\/ If present, make room for element attributes to be stored.\n  this->element_attributes.resize(nAttri);\n  for (unsigned i=0; i<nAttri; ++i)\n    this->element_attributes[i].resize(_num_elements);\n\n  for (unsigned int i=0; i<_num_elements; i++)\n    {\n      libmesh_assert (ele_stream.good());\n\n      \/\/ TetGen only supports Tet4 and Tet10 elements.\n      Elem* elem;\n\n      if (n_nodes==4)\n\telem = new Tet4;\n\n      else if (n_nodes==10)\n\telem = new Tet10;\n\n      else\n\t{\n\t  libMesh::err << \"Elements with \" << n_nodes\n\t\t        << \" nodes are not supported in the LibMesh tetgen module\\n\";\n\t  libmesh_error();\n\t}\n      elem->set_id(i);\n\n      \/\/ Since we know the ID, it's more correct to call insert_elem() here than add_elem()\n      mesh.insert_elem (elem);\n\n      libmesh_assert (elem != NULL);\n      libmesh_assert (elem->n_nodes() == n_nodes);\n\n      \/\/ Read the element label\n      ele_stream >> element_lab;\n\n      \/\/ Add the element to the mesh &\n      \/\/ tell the MeshData object the foreign element id\n      if (this->_mesh_data != NULL)\n\tthis->_mesh_data->add_foreign_elem_id (elem, element_lab);\n\n      \/\/ Read node labels\n      for (unsigned int j=0; j<n_nodes; j++)\n\t{\n\t  unsigned long int node_label;\n\t  ele_stream >> node_label;\n\n\t  \/\/ Assign node to element\n\t  elem->set_node(assign_elm_nodes[j]) =\n\t    mesh.node_ptr(_assign_nodes[node_label]);\n\t}\n\n      \/\/ Read and store attributes from the stream.\n      for (unsigned int j=0; j<nAttri; j++)\n\tele_stream >> this->element_attributes[j][i];\n    }\n}\n\n\n\/**\n * This method implements writing a mesh to a specified \".poly\" file.\n * \".poly\" files defines so called Piecewise Linear Complex (PLC).\n *\/\nvoid TetGenIO::write (const std::string& fname)\n{\n  \/\/ libmesh_assert three dimensions (should be extended later)\n  libmesh_assert (MeshOutput<MeshBase>::mesh().mesh_dimension() == 3);\n\n  if (!(fname.rfind(\".poly\") < fname.size()))\n    {\n      libMesh::err << \"ERROR: Unrecognized file name: \"\n                    << fname << std::endl;\n      libmesh_error();\n    }\n\n  \/\/ Open the output file stream\n  std::ofstream out (fname.c_str());\n\n  \/\/ Make sure it opened correctly\n  if (!out.good())\n    libmesh_file_error(fname.c_str());\n\n  \/\/ Get a reference to the mesh\n  const MeshBase& mesh = MeshOutput<MeshBase>::mesh();\n\n  \/\/ Begin interfacing with the .poly file\n  {\n    \/\/ header:\n    out << \"# poly file output generated by libmesh\\n\"\n\t<< mesh.n_nodes() << \" 3 0 0\\n\";\n\n    \/\/ write the nodes:\n    for (unsigned int v=0; v<mesh.n_nodes(); v++)\n      out << v << \" \"\n\t  << mesh.point(v)(0) << \" \"\n\t  << mesh.point(v)(1) << \" \"\n\t  << mesh.point(v)(2) << \"\\n\";\n  }\n\n  {\n    \/\/ write the connectivity:\n    out << \"# Facets:\\n\"\n\t<< mesh.n_elem() << \" 0\\n\";\n\n\/\/     const_active_elem_iterator       it (mesh.elements_begin());\n\/\/     const const_active_elem_iterator end(mesh.elements_end());\n\n    MeshBase::const_element_iterator       it  = mesh.active_elements_begin();\n    const MeshBase::const_element_iterator end = mesh.active_elements_end();\n\n    for ( ; it != end; ++it)\n      out << \"1\\n3 \" \/\/ no. of facet polygons\n        \/\/\t  << (*it)->n_nodes() << \" \"\n\t  << (*it)->node(0)   << \" \"\n\t  << (*it)->node(1)   << \" \"\n\t  << (*it)->node(2)   << \"\\n\";\n  }\n\n  \/\/ end of the file\n  out << \"0\\n\"; \/\/ no holes output!\n  out << \"\\n\\n# end of file\\n\";\n}\n\n} \/\/ namespace libMesh\n\n<commit_msg>Fixing stupid bug in TetGenIO.<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#include <fstream>\n\n\/\/ Local includes\n#include \"tetgen_io.h\"\n#include \"mesh_base.h\"\n#include \"cell_tet4.h\"\n#include \"cell_tet10.h\"\n#include \"mesh_data.h\"\n\nnamespace libMesh\n{\n\n\/\/ ------------------------------------------------------------\n\/\/ TetgenIO class members\nvoid TetGenIO::read (const std::string& name)\n{\n  \/\/ This is a serial-only process for now;\n  \/\/ the Mesh should be read on processor 0 and\n  \/\/ broadcast later\n  libmesh_assert(libMesh::processor_id() == 0);\n\n  std::string name_node, name_ele, dummy;\n\n  \/\/ tetgen only works in 3D\n  MeshInput<MeshBase>::mesh().set_mesh_dimension(3);\n\n#if LIBMESH_DIM < 3\n  libMesh::err << \"Cannot open dimension 3 mesh file when configured without 3D support.\" <<\n                  std::endl;\n  libmesh_error();\n#endif\n\n  \/\/ Check name for *.node or *.ele extension.\n  \/\/ Set std::istream for node_stream and ele_stream.\n  \/\/\n  if (name.rfind(\".node\") < name.size())\n    {\n      name_node = name;\n      dummy     = name;\n      int position = dummy.rfind(\".node\");\n      name_ele     = dummy.replace(position, 5, \".ele\");\n    }\n  else if (name.rfind(\".ele\") < name.size())\n    {\n      name_ele = name;\n      dummy    = name;\n      int position = dummy.rfind(\".ele\");\n      name_node    = dummy.replace(position, 4, \".node\");\n    }\n  else\n    {\n      libMesh::err << \"ERROR: Unrecognized file name: \"\n\t\t    << name << std::endl;\n      libmesh_error();\n    }\n\n\n\n  \/\/ Set the streams from which to read in\n  std::ifstream node_stream (name_node.c_str());\n  std::ifstream ele_stream  (name_ele.c_str());\n\n  if ( !node_stream.good() || !ele_stream.good() )\n    {\n      libMesh::err << \"ERROR: One or both Input file(s) not good.\" << std::endl\n\t\t    << \"Error checking files \"\n\t\t    << name_node << \" and \"\n\t\t    << name_ele  << std::endl;\n      libmesh_error();\n    }\n  libMesh::out<< \"TetGenIO found the tetgen files to read \" <<std::endl;\n\n  \/\/ Skip the comment lines at the beginning\n  this->skip_comment_lines (node_stream, '#');\n  this->skip_comment_lines (ele_stream, '#');\n\n  \/\/ Read the nodes and elements from the streams\n  this->read_nodes_and_elem (node_stream, ele_stream);\n  libMesh::out<< \"TetGenIO read in nodes and elements \" <<std::endl;\n}\n\n\n\nvoid TetGenIO::read_nodes_and_elem (std::istream& node_stream,\n\t\t\t\t    std::istream& ele_stream)\n{\n  _num_nodes    = 0;\n  _num_elements = 0;\n\n  \/\/ Read all the datasets.\n  this->node_in    (node_stream);\n  this->element_in (ele_stream);\n\n  \/\/ Tell the MeshData object that we are finished\n  \/\/ reading data.\n  if (this->_mesh_data != NULL)\n    this->_mesh_data->close_foreign_id_maps ();\n\n  \/\/ some more clean-up\n  _assign_nodes.clear();\n}\n\n\n\n\/\/----------------------------------------------------------------------\n\/\/ Function to read in the node table.\nvoid TetGenIO::node_in (std::istream& node_stream)\n{\n  \/\/ Check input buffer\n  libmesh_assert (node_stream.good());\n\n  \/\/ Get a reference to the mesh\n  MeshBase& mesh = MeshInput<MeshBase>::mesh();\n\n  unsigned int dimension=0, nAttributes=0, BoundaryMarkers=0;\n\n  node_stream >> _num_nodes       \/\/ Read the number of nodes from the stream\n\t      >> dimension        \/\/ Read the dimension from the stream\n\t      >> nAttributes      \/\/ Read the number of attributes from stream\n\t      >> BoundaryMarkers; \/\/ Read if or not boundary markers are included in *.node (0 or 1)\n\n  \/\/ Read the nodal coordinates from the node_stream (*.node file).\n  unsigned int node_lab=0;\n  Point xyz;\n  Real dummy;\n\n  \/\/ If present, make room for node attributes to be stored.\n  this->node_attributes.resize(nAttributes);\n  for (unsigned i=0; i<nAttributes; ++i)\n    this->node_attributes[i].resize(_num_nodes);\n\n\n  for (unsigned int i=0; i<_num_nodes; i++)\n    {\n      \/\/ Check input buffer\n      libmesh_assert (node_stream.good());\n\n      node_stream >> node_lab  \/\/ node number\n\t\t  >> xyz(0)    \/\/ x-coordinate value\n\t\t  >> xyz(1)    \/\/ y-coordinate value\n\t\t  >> xyz(2);   \/\/ z-coordinate value\n\n      \/\/ Read and store attributes from the stream.\n      for (unsigned int j=0; j<nAttributes; j++)\n\tnode_stream >> node_attributes[j][i];\n\n      \/\/ Read (and discard) boundary marker if BoundaryMarker=1.\n      \/\/ TODO: should we store this somehow?\n      if (BoundaryMarkers == 1)\n\tnode_stream >> dummy;\n\n      \/\/ Store the new position of the node under its label.\n      \/\/_assign_nodes.insert (std::make_pair(node_lab,i));\n      _assign_nodes[node_lab] = i;\n\n      \/\/ do this irrespective whether MeshData exists\n      Node* newnode = mesh.add_point(xyz, i);\n\n      \/\/ Add node to the nodes vector &\n      \/\/ tell the MeshData object the foreign node id.\n      if (this->_mesh_data != NULL)\n\tthis->_mesh_data->add_foreign_node_id (newnode, node_lab);\n    }\n}\n\n\n\n\/\/----------------------------------------------------------------------\n\/\/ Function to read in the element table.\nvoid TetGenIO::element_in (std::istream& ele_stream)\n{\n  \/\/ Check input buffer\n  libmesh_assert (ele_stream.good());\n\n  \/\/ Get a reference to the mesh\n  MeshBase& mesh = MeshInput<MeshBase>::mesh();\n\n  \/\/ Read the elements from the ele_stream (*.ele file).\n  unsigned int element_lab=0, n_nodes=0, nAttri=0;\n\n  ele_stream >> _num_elements \/\/ Read the number of tetrahedrons from the stream.\n\t     >> n_nodes       \/\/ Read the number of nodes per tetrahedron from the stream (defaults to 4).\n\t     >> nAttri;       \/\/ Read the number of attributes from stream.\n\n  \/\/ Vector that assigns element nodes to their correct position.\n  \/\/ TetGen is normaly 0-based\n  \/\/ (right now this is strictly not necessary since it is the identity map,\n  \/\/  but in the future TetGen could change their numbering scheme.)\n  static const unsigned int assign_elm_nodes[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9};\n\n  \/\/ If present, make room for element attributes to be stored.\n  this->element_attributes.resize(nAttri);\n  for (unsigned i=0; i<nAttri; ++i)\n    this->element_attributes[i].resize(_num_elements);\n\n  for (unsigned int i=0; i<_num_elements; i++)\n    {\n      libmesh_assert (ele_stream.good());\n\n      \/\/ TetGen only supports Tet4 and Tet10 elements.\n      Elem* elem;\n\n      if (n_nodes==4)\n\telem = new Tet4;\n\n      else if (n_nodes==10)\n\telem = new Tet10;\n\n      else\n\t{\n\t  libMesh::err << \"Elements with \" << n_nodes\n\t\t        << \" nodes are not supported in the LibMesh tetgen module\\n\";\n\t  libmesh_error();\n\t}\n      elem->set_id(i);\n\n      mesh.add_elem (elem);\n\n      libmesh_assert (elem != NULL);\n      libmesh_assert (elem->n_nodes() == n_nodes);\n\n      \/\/ Read the element label\n      ele_stream >> element_lab;\n\n      \/\/ Add the element to the mesh &\n      \/\/ tell the MeshData object the foreign element id\n      if (this->_mesh_data != NULL)\n\tthis->_mesh_data->add_foreign_elem_id (elem, element_lab);\n\n      \/\/ Read node labels\n      for (unsigned int j=0; j<n_nodes; j++)\n\t{\n\t  unsigned long int node_label;\n\t  ele_stream >> node_label;\n\n\t  \/\/ Assign node to element\n\t  elem->set_node(assign_elm_nodes[j]) =\n\t    mesh.node_ptr(_assign_nodes[node_label]);\n\t}\n\n      \/\/ Read and store attributes from the stream.\n      for (unsigned int j=0; j<nAttri; j++)\n\tele_stream >> this->element_attributes[j][i];\n    }\n}\n\n\n\/**\n * This method implements writing a mesh to a specified \".poly\" file.\n * \".poly\" files defines so called Piecewise Linear Complex (PLC).\n *\/\nvoid TetGenIO::write (const std::string& fname)\n{\n  \/\/ libmesh_assert three dimensions (should be extended later)\n  libmesh_assert (MeshOutput<MeshBase>::mesh().mesh_dimension() == 3);\n\n  if (!(fname.rfind(\".poly\") < fname.size()))\n    {\n      libMesh::err << \"ERROR: Unrecognized file name: \"\n                    << fname << std::endl;\n      libmesh_error();\n    }\n\n  \/\/ Open the output file stream\n  std::ofstream out (fname.c_str());\n\n  \/\/ Make sure it opened correctly\n  if (!out.good())\n    libmesh_file_error(fname.c_str());\n\n  \/\/ Get a reference to the mesh\n  const MeshBase& mesh = MeshOutput<MeshBase>::mesh();\n\n  \/\/ Begin interfacing with the .poly file\n  {\n    \/\/ header:\n    out << \"# poly file output generated by libmesh\\n\"\n\t<< mesh.n_nodes() << \" 3 0 0\\n\";\n\n    \/\/ write the nodes:\n    for (unsigned int v=0; v<mesh.n_nodes(); v++)\n      out << v << \" \"\n\t  << mesh.point(v)(0) << \" \"\n\t  << mesh.point(v)(1) << \" \"\n\t  << mesh.point(v)(2) << \"\\n\";\n  }\n\n  {\n    \/\/ write the connectivity:\n    out << \"# Facets:\\n\"\n\t<< mesh.n_elem() << \" 0\\n\";\n\n\/\/     const_active_elem_iterator       it (mesh.elements_begin());\n\/\/     const const_active_elem_iterator end(mesh.elements_end());\n\n    MeshBase::const_element_iterator       it  = mesh.active_elements_begin();\n    const MeshBase::const_element_iterator end = mesh.active_elements_end();\n\n    for ( ; it != end; ++it)\n      out << \"1\\n3 \" \/\/ no. of facet polygons\n        \/\/\t  << (*it)->n_nodes() << \" \"\n\t  << (*it)->node(0)   << \" \"\n\t  << (*it)->node(1)   << \" \"\n\t  << (*it)->node(2)   << \"\\n\";\n  }\n\n  \/\/ end of the file\n  out << \"0\\n\"; \/\/ no holes output!\n  out << \"\\n\\n# end of file\\n\";\n}\n\n} \/\/ namespace libMesh\n\n<|endoftext|>"}
{"text":"<commit_before>\/*************************************************************************\n *\n *  OpenOffice.org - a multi-platform office productivity suite\n *\n *  $RCSfile: sttresid.hxx,v $\n *\n *  $Revision: 1.2 $\n *\n *  last change: $Author: rt $ $Date: 2007-04-26 09:39: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 _STTRESID_HXX_\n#define _STTRESID_HXX_\n\n#include <tools\/resmgr.hxx>\n#include <tools\/resid.hxx>\n\nclass SttResId : public ResId\n{\n    static ResMgr* getSttResMgr();\n    public:\n    SttResId( sal_uInt32 nId ) : ResId( nId, *getSttResMgr() ) {}\n};\n\n\n#endif\n<commit_msg>INTEGRATION: CWS changefileheader (1.2.46); FILE MERGED 2008\/03\/28 16:03:35 rt 1.2.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: sttresid.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 _STTRESID_HXX_\n#define _STTRESID_HXX_\n\n#include <tools\/resmgr.hxx>\n#include <tools\/resid.hxx>\n\nclass SttResId : public ResId\n{\n    static ResMgr* getSttResMgr();\n    public:\n    SttResId( sal_uInt32 nId ) : ResId( nId, *getSttResMgr() ) {}\n};\n\n\n#endif\n<|endoftext|>"}
{"text":"<commit_before>#include \"includes.h\"\n\nusing namespace std::chrono;\nusing std::chrono::system_clock;\nusing std::chrono::milliseconds;\n\nsystem_clock::time_point now_millis()\n{\n    return time_point_cast<milliseconds>(system_clock::now());\n}\nTEST_CASE(\"dequeue-empty-nowait\", \"[mpmc_blocking_q]\")\n{\n    size_t q_size = 100;\n    milliseconds tolerance_wait(10);\n    spdlog::details::mpmc_blocking_queue<int> q(q_size);\n    int popped_item;\n\n    auto millis_0 = now_millis();\n    auto rv = q.dequeue_for(popped_item, milliseconds::zero());\n    auto millis_1 = now_millis();\n\n    REQUIRE(rv == false);\n    REQUIRE((millis_1-millis_0) <= tolerance_wait);\n\n}\n\nTEST_CASE(\"dequeue-empty-wait\", \"[mpmc_blocking_q]\")\n{\n\n    size_t q_size = 100;\n    milliseconds wait_ms(250);\n    milliseconds tolerance_wait(10);\n\n    spdlog::details::mpmc_blocking_queue<int> q(q_size);\n    int popped_item;\n    auto millis_0 = now_millis();\n    auto rv = q.dequeue_for(popped_item, wait_ms);\n    auto millis_1 = now_millis();\n    auto delta_ms = millis_1 - millis_0;\n\n    REQUIRE(rv == false);\n    REQUIRE(delta_ms >= wait_ms);\n    REQUIRE(delta_ms <= wait_ms + tolerance_wait);\n}\n\n\nTEST_CASE(\"enqueue_nowait\", \"[mpmc_blocking_q]\")\n{\n\n    size_t q_size = 1;\n    spdlog::details::mpmc_blocking_queue<int> q(q_size);\n    milliseconds tolerance_wait(10);\n\n    q.enqueue(1);\n    REQUIRE(q.overrun_counter() == 0);\n\n    auto millis_0 = now_millis();\n    q.enqueue_nowait(2);\n    auto millis_1 = now_millis();\n    REQUIRE((millis_1-millis_0) <= tolerance_wait);\n    REQUIRE(q.overrun_counter() == 1);\n}\n\nTEST_CASE(\"bad_queue\", \"[mpmc_blocking_q]\")\n{\n    size_t q_size = 0;\n    spdlog::details::mpmc_blocking_queue<int> q(q_size);\n    q.enqueue_nowait(1);\n    REQUIRE(q.overrun_counter() == 1);\n    int i;\n    REQUIRE(q.dequeue_for(i, milliseconds(0)) == false);\n}\n\nTEST_CASE(\"empty_queue\", \"[mpmc_blocking_q]\")\n{\n    size_t q_size = 10;\n    spdlog::details::mpmc_blocking_queue<int> q(q_size);\n    int i;\n    REQUIRE(q.dequeue_for(i, milliseconds(10)) == false);\n}\n\nTEST_CASE(\"full_queue\", \"[mpmc_blocking_q]\")\n{\n    size_t q_size = 100;\n    spdlog::details::mpmc_blocking_queue<int> q(q_size);\n    for(int i = 0; i < static_cast<int>(q_size); i++)\n    {\n        q.enqueue(std::move(i));\n    }\n\n    q.enqueue_nowait(123456);\n    REQUIRE(q.overrun_counter() == 1);\n\n    for(int i = 1; i < static_cast<int>(q_size); i++)\n    {\n        int item;\n        q.dequeue_for(item, milliseconds(0));\n        REQUIRE(item == i);\n    }\n    \n    \/\/ last item pushed has overridden the oldest.\n    int item;\n    q.dequeue_for(item, milliseconds(0));\n    REQUIRE(item == 123456);\n}<commit_msg>Added some mpmc_q tests<commit_after>#include \"includes.h\"\n\nusing namespace std::chrono;\nusing std::chrono::system_clock;\nusing std::chrono::milliseconds;\n\nsystem_clock::time_point now_millis()\n{\n    return time_point_cast<milliseconds>(system_clock::now());\n}\nTEST_CASE(\"dequeue-empty-nowait\", \"[mpmc_blocking_q]\")\n{\n    size_t q_size = 100;\n    milliseconds tolerance_wait(10);\n    spdlog::details::mpmc_blocking_queue<int> q(q_size);\n    int popped_item;\n\n    auto millis_0 = now_millis();\n    auto rv = q.dequeue_for(popped_item, milliseconds::zero());\n    auto millis_1 = now_millis();\n\n    REQUIRE(rv == false);\n    REQUIRE((millis_1-millis_0) <= tolerance_wait);\n\n}\n\nTEST_CASE(\"dequeue-empty-wait\", \"[mpmc_blocking_q]\")\n{\n\n    size_t q_size = 100;\n    milliseconds wait_ms(250);\n    milliseconds tolerance_wait(10);\n\n    spdlog::details::mpmc_blocking_queue<int> q(q_size);\n    int popped_item;\n    auto millis_0 = now_millis();\n    auto rv = q.dequeue_for(popped_item, wait_ms);\n    auto millis_1 = now_millis();\n    auto delta_ms = millis_1 - millis_0;\n\n    REQUIRE(rv == false);\n    REQUIRE(delta_ms >= wait_ms);\n    REQUIRE(delta_ms <= wait_ms + tolerance_wait);\n}\n\n\nTEST_CASE(\"enqueue_nowait\", \"[mpmc_blocking_q]\")\n{\n\n    size_t q_size = 1;\n    spdlog::details::mpmc_blocking_queue<int> q(q_size);\n    milliseconds tolerance_wait(10);\n\n    q.enqueue(1);\n    REQUIRE(q.overrun_counter() == 0);\n\n    auto millis_0 = now_millis();\n    q.enqueue_nowait(2);\n    auto millis_1 = now_millis();\n    REQUIRE((millis_1-millis_0) <= tolerance_wait);\n    REQUIRE(q.overrun_counter() == 1);\n}\n\nTEST_CASE(\"bad_queue\", \"[mpmc_blocking_q]\")\n{\n    size_t q_size = 0;\n    spdlog::details::mpmc_blocking_queue<int> q(q_size);\n    q.enqueue_nowait(1);\n    REQUIRE(q.overrun_counter() == 1);\n    int i;\n    REQUIRE(q.dequeue_for(i, milliseconds(0)) == false);\n}\n\nTEST_CASE(\"empty_queue\", \"[mpmc_blocking_q]\")\n{\n    size_t q_size = 10;\n    spdlog::details::mpmc_blocking_queue<int> q(q_size);\n    int i;\n    REQUIRE(q.dequeue_for(i, milliseconds(10)) == false);\n}\n\nTEST_CASE(\"full_queue\", \"[mpmc_blocking_q]\")\n{\n    size_t q_size = 100;\n    spdlog::details::mpmc_blocking_queue<int> q(q_size);\n    for(int i = 0; i < static_cast<int>(q_size); i++)\n    {\n        q.enqueue(std::move(i));\n    }\n\n    q.enqueue_nowait(123456);\n    REQUIRE(q.overrun_counter() == 1);\n\n    for(int i = 1; i < static_cast<int>(q_size); i++)\n    {\n        int item=-1;\n        q.dequeue_for(item, milliseconds(0));\n        REQUIRE(item == i);\n    }\n\n    \/\/ last item pushed has overridden the oldest.\n    int item=-1;\n    q.dequeue_for(item, milliseconds(0));\n    REQUIRE(item == 123456);\n}<|endoftext|>"}
{"text":"<commit_before>#ifndef PYTHONIC_NUMPY_CONCATENATE_HPP\n#define PYTHONIC_NUMPY_CONCATENATE_HPP\n\n#include \"pythonic\/utils\/proxy.hpp\"\n#include \"pythonic\/types\/ndarray.hpp\"\n\nnamespace pythonic {\n\n    namespace numpy {\n        template<class T, size_t N, size_t M>\n            types::ndarray<T,N> concatenate(types::array<types::ndarray<T,N>, M> const & ai) {\n                long n = 1;\n                long shape[N];\n                shape[0] = 0L;\n                for(auto const& a : ai) {\n                    shape[0] += a.shape[0];\n                    n *= a.size();\n                }\n                std::copy(ai[0].shape.begin() +1 , ai[0].shape.end(), &shape[1]);\n\n                T* buffer = (T*)malloc(sizeof(T) * n);\n                T* iter = buffer;\n                for(auto const& a : ai) \n                    iter = std::copy(a.fbegin(), a.fend(), iter);\n\n                return types::ndarray<T,N>(buffer, shape);\n            }\n        PROXY(pythonic::numpy, concatenate);\n\n    }\n\n}\n\n#endif\n\n<commit_msg>Fix bug in np.concatenate<commit_after>#ifndef PYTHONIC_NUMPY_CONCATENATE_HPP\n#define PYTHONIC_NUMPY_CONCATENATE_HPP\n\n#include \"pythonic\/utils\/proxy.hpp\"\n#include \"pythonic\/types\/ndarray.hpp\"\n\nnamespace pythonic {\n\n    namespace numpy {\n        template<class T, size_t N, size_t M>\n            types::ndarray<T,N> concatenate(types::array<types::ndarray<T,N>, M> const & ai) {\n                long n = 0;\n                long shape[N];\n                shape[0] = 0L;\n                for(auto const& a : ai) {\n                    shape[0] += a.shape[0];\n                    n += a.size();\n                }\n                std::copy(ai[0].shape.begin() +1 , ai[0].shape.end(), &shape[1]);\n\n                T* buffer = (T*)malloc(sizeof(T) * n);\n                T* iter = buffer;\n                for(auto const& a : ai) {\n                    iter = std::copy(a.fbegin(), a.fend(), iter);\n                }\n\n                return types::ndarray<T,N>(buffer, shape);\n            }\n\n        template<class T, size_t N, class A>\n            void _concatenate_helper(types::array<T, N>& a, A const& t, utils::int_<1>) {\n                a[N - 1] = std::get<N-1>(t);\n            }\n        template<class T, size_t N, class A, size_t M>\n            void _concatenate_helper(types::array<T, N>& a, A const& t, utils::int_<M>) {\n                a[N - M] = std::get<N-M>(t);\n                _concatenate_helper(a, t, utils::int_<M-1>());\n            }\n        template<class... Types>\n            typename assignable<typename __combined<Types...>::type>::type\n            concatenate(std::tuple<Types...> const& args) {\n                types::array<typename assignable<typename __combined<Types...>::type>::type, sizeof...(Types)> params;\n                _concatenate_helper(params, args, utils::int_<sizeof...(Types)>());\n                return concatenate(params);\n            }\n        PROXY(pythonic::numpy, concatenate);\n\n    }\n\n}\n\n#endif\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\/perception\/obstacle\/fusion\/probabilistic_fusion\/pbf_sensor_manager.h\"\n\n#include \"modules\/common\/log.h\"\n\nnamespace apollo {\nnamespace perception {\n\nPbfSensorManager *PbfSensorManager::Instance() {\n  static PbfSensorManager sensor_manager;\n  return &sensor_manager;\n}\n\nPbfSensorManager::PbfSensorManager() {}\n\nPbfSensorManager::~PbfSensorManager() {\n  std::map<std::string, PbfSensor *>::iterator it = sensors_.begin();\n  for (; it != sensors_.end(); ++it) {\n    if (it->second != nullptr) {\n      delete (it->second);\n      it->second = nullptr;\n    }\n  }\n  sensors_.clear();\n}\n\nbool PbfSensorManager::Init() {\n  sensors_.clear();\n\n  std::string sensor_id = GetSensorType(VELODYNE_64);\n  SensorType type = VELODYNE_64;\n\n  PbfSensor *velodyne_64 = new PbfSensor(type, sensor_id);\n  sensors_[sensor_id] = velodyne_64;\n\n  sensor_id = GetSensorType(RADAR);\n  type = RADAR;\n  PbfSensor *radar = new PbfSensor(type, sensor_id);\n  if (sensors_.find(sensor_id) == sensors_.end()) {\n    sensors_[sensor_id] = radar;\n  } else {\n    AERROR << \"The velodyne 64 and radar sensor ids are conflict.\";\n    return false;\n  }\n  return true;\n}\n\nvoid PbfSensorManager::AddSensorMeasurements(const SensorObjects &objects) {\n  std::string sensor_id = GetSensorType(objects.sensor_type);\n  SensorType type = objects.sensor_type;\n\n  std::map<std::string, PbfSensor *>::iterator it = sensors_.find(sensor_id);\n  PbfSensor *sensor = nullptr;\n  if (it == sensors_.end()) {\n    AWARN << \"Cannot find sensor \" << sensor_id\n          << \" and create one in SensorManager\";\n    sensor = new PbfSensor(type, sensor_id);\n    if (sensor == nullptr) {\n      AERROR << \"Fail to create PbfSensor. sensor_id = \" << sensor_id;\n      return;\n    }\n    sensors_[sensor_id] = sensor;\n  } else {\n    sensor = it->second;\n  }\n  sensor->AddFrame(objects);\n}\n\nvoid PbfSensorManager::GetLatestSensorFrames(\n    double time_stamp, const std::string &sensor_id,\n    std::vector<PbfSensorFramePtr> *frames) {\n  if (frames == nullptr) {\n    return;\n  }\n  std::map<std::string, PbfSensor *>::iterator it = sensors_.find(sensor_id);\n  if (it == sensors_.end()) {\n    return;\n  }\n  return it->second->QueryLatestFrames(time_stamp, frames);\n}\n\nvoid PbfSensorManager::GetLatestFrames(const double time_stamp,\n                                       std::vector<PbfSensorFramePtr> *frames) {\n  if (frames == nullptr) {\n    return;\n  }\n  frames->clear();\n  for (std::map<std::string, PbfSensor *>::iterator it = sensors_.begin();\n       it != sensors_.end(); ++it) {\n    PbfSensor *sensor = it->second;\n    PbfSensorFramePtr frame = sensor->QueryLatestFrame(time_stamp);\n    if (frame != nullptr) {\n      frames->push_back(frame);\n    }\n  }\n  int frame_size = static_cast<int>(frames->size());\n  for (int i = 0; i < frame_size - 1; i++) {\n    for (int j = i + 1; j < frame_size; j++) {\n      if ((*frames)[j]->timestamp < (*frames)[i]->timestamp) {\n        PbfSensorFramePtr tf = (*frames)[i];\n        (*frames)[i] = (*frames)[j];\n        (*frames)[j] = tf;\n      }\n    }\n  }\n}\n\nPbfSensor *PbfSensorManager::GetSensor(const std::string &sensor_id) {\n  std::map<std::string, PbfSensor *>::iterator it = sensors_.find(sensor_id);\n  PbfSensor *sensor = nullptr;\n  if (it != sensors_.end()) {\n    sensor = it->second;\n  }\n  return sensor;\n}\n\nbool PbfSensorManager::GetPose(const std::string &sensor_id, double time_stamp,\n                               Eigen::Matrix4d *pose) {\n  if (pose == nullptr) {\n    AERROR << \"output parameter pose is nullptr\";\n    return false;\n  }\n\n  std::map<std::string, PbfSensor *>::iterator it = sensors_.find(sensor_id);\n  if (it == sensors_.end()) {\n    AERROR << \"Failed to find sensor for \" << sensor_id;\n    return false;\n  }\n\n  PbfSensor *sensor = it->second;\n  return sensor->GetPose(time_stamp, pose);\n}\n\n}  \/\/ namespace perception\n}  \/\/ namespace apollo\n<commit_msg>Perception: fixed memory leak for radar sensor.<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\/perception\/obstacle\/fusion\/probabilistic_fusion\/pbf_sensor_manager.h\"\n\n#include \"modules\/common\/log.h\"\n\nnamespace apollo {\nnamespace perception {\n\nPbfSensorManager *PbfSensorManager::Instance() {\n  static PbfSensorManager sensor_manager;\n  return &sensor_manager;\n}\n\nPbfSensorManager::PbfSensorManager() {}\n\nPbfSensorManager::~PbfSensorManager() {\n  std::map<std::string, PbfSensor *>::iterator it = sensors_.begin();\n  for (; it != sensors_.end(); ++it) {\n    if (it->second != nullptr) {\n      delete (it->second);\n      it->second = nullptr;\n    }\n  }\n  sensors_.clear();\n}\n\nbool PbfSensorManager::Init() {\n  sensors_.clear();\n\n  std::string sensor_id = GetSensorType(VELODYNE_64);\n  SensorType type = VELODYNE_64;\n\n  PbfSensor *velodyne_64 = new PbfSensor(type, sensor_id);\n  sensors_[sensor_id] = velodyne_64;\n\n  sensor_id = GetSensorType(RADAR);\n  type = RADAR;\n  PbfSensor *radar = new PbfSensor(type, sensor_id);\n  if (radar == nullptr) {\n    AERROR << \"Fail to create PbfSensor. sensor_id = \" << sensor_id;\n    return false;\n  }\n  if (sensors_.find(sensor_id) == sensors_.end()) {\n    sensors_[sensor_id] = radar;\n  } else {\n    AERROR << \"The velodyne 64 and radar sensor ids are conflict.\";\n    delete radar;\n    return false;\n  }\n  return true;\n}\n\nvoid PbfSensorManager::AddSensorMeasurements(const SensorObjects &objects) {\n  std::string sensor_id = GetSensorType(objects.sensor_type);\n  SensorType type = objects.sensor_type;\n\n  std::map<std::string, PbfSensor *>::iterator it = sensors_.find(sensor_id);\n  PbfSensor *sensor = nullptr;\n  if (it == sensors_.end()) {\n    AWARN << \"Cannot find sensor \" << sensor_id\n          << \" and create one in SensorManager\";\n    sensor = new PbfSensor(type, sensor_id);\n    if (sensor == nullptr) {\n      AERROR << \"Fail to create PbfSensor. sensor_id = \" << sensor_id;\n      return;\n    }\n    sensors_[sensor_id] = sensor;\n  } else {\n    sensor = it->second;\n  }\n  sensor->AddFrame(objects);\n}\n\nvoid PbfSensorManager::GetLatestSensorFrames(\n    double time_stamp, const std::string &sensor_id,\n    std::vector<PbfSensorFramePtr> *frames) {\n  if (frames == nullptr) {\n    return;\n  }\n  std::map<std::string, PbfSensor *>::iterator it = sensors_.find(sensor_id);\n  if (it == sensors_.end()) {\n    return;\n  }\n  return it->second->QueryLatestFrames(time_stamp, frames);\n}\n\nvoid PbfSensorManager::GetLatestFrames(const double time_stamp,\n                                       std::vector<PbfSensorFramePtr> *frames) {\n  if (frames == nullptr) {\n    return;\n  }\n  frames->clear();\n  for (std::map<std::string, PbfSensor *>::iterator it = sensors_.begin();\n       it != sensors_.end(); ++it) {\n    PbfSensor *sensor = it->second;\n    PbfSensorFramePtr frame = sensor->QueryLatestFrame(time_stamp);\n    if (frame != nullptr) {\n      frames->push_back(frame);\n    }\n  }\n  int frame_size = static_cast<int>(frames->size());\n  for (int i = 0; i < frame_size - 1; i++) {\n    for (int j = i + 1; j < frame_size; j++) {\n      if ((*frames)[j]->timestamp < (*frames)[i]->timestamp) {\n        PbfSensorFramePtr tf = (*frames)[i];\n        (*frames)[i] = (*frames)[j];\n        (*frames)[j] = tf;\n      }\n    }\n  }\n}\n\nPbfSensor *PbfSensorManager::GetSensor(const std::string &sensor_id) {\n  std::map<std::string, PbfSensor *>::iterator it = sensors_.find(sensor_id);\n  PbfSensor *sensor = nullptr;\n  if (it != sensors_.end()) {\n    sensor = it->second;\n  }\n  return sensor;\n}\n\nbool PbfSensorManager::GetPose(const std::string &sensor_id, double time_stamp,\n                               Eigen::Matrix4d *pose) {\n  if (pose == nullptr) {\n    AERROR << \"output parameter pose is nullptr\";\n    return false;\n  }\n\n  std::map<std::string, PbfSensor *>::iterator it = sensors_.find(sensor_id);\n  if (it == sensors_.end()) {\n    AERROR << \"Failed to find sensor for \" << sensor_id;\n    return false;\n  }\n\n  PbfSensor *sensor = it->second;\n  return sensor->GetPose(time_stamp, pose);\n}\n\n}  \/\/ namespace perception\n}  \/\/ namespace apollo\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>Fix MinGW build.<commit_after><|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 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: M. Adam, J. Allard, B. Andre, P-J. Bensoussan, S. Cotin, C. Duriez,*\n* H. Delingette, F. Falipou, F. Faure, S. Fonteneau, L. Heigeas, C. Mendoza,  *\n* M. Nesme, P. Neumann, J-P. de la Plata Alcade, F. Poyer and F. Roy          *\n*                                                                             *\n* Contact information: contact@sofa-framework.org                             *\n******************************************************************************\/\n#include <iostream>\n#include <fstream>\n#include <sofa\/helper\/ArgumentParser.h>\n#include <sofa\/simulation\/common\/xml\/initXml.h>\n#include <sofa\/simulation\/tree\/TreeSimulation.h>\n#include <sofa\/simulation\/tree\/GNode.h>\n#include <sofa\/component\/init.h>\n#include <sofa\/helper\/Factory.h>\n#include <sofa\/helper\/BackTrace.h>\n#include <sofa\/helper\/system\/FileRepository.h>\n#include <sofa\/gui\/GUIManager.h>\n#include <sofa\/helper\/system\/gl.h>\n#include <sofa\/helper\/system\/glut.h>\n#include <sofa\/helper\/system\/atomic.h>\n\n#ifdef SOFA_GPU_CUDA\n#include <sofa\/gpu\/cuda\/mycuda.h>\n#endif\n\n#ifndef WIN32\n#include <dlfcn.h>\nbool loadPlugin(const char* filename)\n{\n    void *handle;\n    handle=dlopen(filename, RTLD_LAZY);\n    if (!handle)\n    {\n        std::cerr<<\"Error loading plugin \"<<filename<<\": \"<<dlerror()<<std::endl;\n        return false;\n    }\n    std::cerr<<\"Plugin \"<<filename<<\" loaded.\"<<std::endl;\n    return true;\n}\n#else\nbool loadPlugin(const char* filename)\n{\n    HINSTANCE DLLHandle;\n    DLLHandle = LoadLibraryA(filename); \/\/warning: issue between unicode and ansi encoding on Visual c++ -> force to ansi-> dirty!\n    if (DLLHandle == NULL)\n    {\n        std::cerr<<\"Error loading plugin \"<<filename<<std::endl;\n        return false;\n    }\n    std::cerr<<\"Plugin \"<<filename<<\" loaded.\"<<std::endl;\n    return true;\n}\n#endif\n\n\/\/ ---------------------------------------------------------------------\n\/\/ ---\n\/\/ ---------------------------------------------------------------------\nint main(int argc, char** argv)\n{\n    \/\/std::cout << \"Using \" << sofa::helper::system::atomic<int>::getImplName()<<\" atomics.\" << std::endl;\n\n    sofa::helper::BackTrace::autodump();\n\n\n    std::string fileName ;\n    bool        startAnim = false;\n    bool        printFactory = false;\n    bool        loadRecent = false;\n    bool        temporaryFile = false;\n    std::string dimension=\"800x600\";\n    bool fullScreen = false;\n\n    std::string gui = \"\";\n    std::vector<std::string> plugins;\n    std::vector<std::string> files;\n\n    std::string gui_help = \"choose the UI (\";\n    gui_help += sofa::gui::GUIManager::ListSupportedGUI('|');\n    gui_help += \")\";\n\n    sofa::helper::parse(&files, \"This is a SOFA application. Here are the command line arguments\")\n    .option(&startAnim,'s',\"start\",\"start the animation loop\")\n    .option(&printFactory,'p',\"factory\",\"print factory logs\")\n    .option(&gui,'g',\"gui\",gui_help.c_str())\n    .option(&plugins,'l',\"load\",\"load given plugins\")\n    .option(&loadRecent,'r',\"recent\",\"load most recently opened file\")\n    .option(&dimension,'d',\"dimension\",\"width and height of the viewer\")\n    .option(&fullScreen,'f',\"fullScreen\",\"start in full screen\")\n    .option(&temporaryFile,'t',\"temporary\",\"the loaded scene won't appear in history of opened files\")\n    (argc,argv);\n\n    if(gui!=\"batch\") glutInit(&argc,argv);\n#ifdef SOFA_GPU_CUDA\n    sofa::gpu::cuda::mycudaInit();\n#endif\n    sofa::simulation::setSimulation(new sofa::simulation::tree::TreeSimulation());\n    sofa::component::init();\n    sofa::simulation::xml::initXml();\n\n    if (!files.empty()) fileName = files[0];\n\n    for (unsigned int i=0; i<plugins.size(); i++)\n        loadPlugin(plugins[i].c_str());\n\n\n    if (int err=sofa::gui::GUIManager::Init(argv[0],gui.c_str()))\n        return err;\n\n    if (fileName.empty())\n    {\n        if (loadRecent) \/\/ try to reload the latest scene\n        {\n            std::string scenes = \"config\/Sofa.ini\";\n            scenes = sofa::helper::system::DataRepository.getFile( scenes );\n            std::ifstream mrulist(scenes.c_str());\n            std::getline(mrulist,fileName);\n            mrulist.close();\n        }\n        else\n            fileName = \"Demos\/liver.scn\";\n\n        fileName = sofa::helper::system::DataRepository.getFile(fileName);\n    }\n\n\n    if (int err=sofa::gui::GUIManager::createGUI(NULL))\n        return err;\n\n    sofa::simulation::tree::GNode* groot = dynamic_cast<sofa::simulation::tree::GNode*>( sofa::simulation::tree::getSimulation()->load(fileName.c_str()));\n    if (groot==NULL)  groot = new sofa::simulation::tree::GNode;\n\n    sofa::simulation::tree::getSimulation()->init(groot);\n    sofa::gui::GUIManager::SetScene(groot,fileName.c_str(), temporaryFile);\n\n\n    \/\/=======================================\n    \/\/Apply Options\n\n    if (startAnim)  groot->setAnimate(true);\n\n    \/\/Dimension Option\n    std::string::size_type separator=dimension.find_first_of('x');\n    if (separator != std::string::npos)\n    {\n        std::string stringWidth=dimension.substr(0,separator);\n        std::string stringHeight=dimension.substr(separator+1);\n        sofa::gui::GUIManager::SetDimension(atoi(stringWidth.c_str()), atoi(stringHeight.c_str()));\n    }\n\n    if (printFactory)\n    {\n        std::cout << \"\/\/\/\/\/\/\/\/\/\/ FACTORY \/\/\/\/\/\/\/\/\/\/\" << std::endl;\n        sofa::helper::printFactoryLog();\n        std::cout << \"\/\/\/\/\/\/\/\/ END FACTORY \/\/\/\/\/\/\/\/\" << std::endl;\n    }\n\n    if (fullScreen) sofa::gui::GUIManager::SetFullScreen();\n\n    \/\/=======================================\n    \/\/ Run the main loop\n    if (int err=sofa::gui::GUIManager::MainLoop(groot,fileName.c_str()))\n        return err;\n    groot = dynamic_cast<sofa::simulation::tree::GNode*>( sofa::gui::GUIManager::CurrentSimulation() );\n\n\n    if (groot!=NULL) sofa::simulation::tree::getSimulation()->unload(groot);\n    return 0;\n}\n<commit_msg>r5550\/sofa-dev : ADD: new option ('-s' or simu) to select the type of simu used by Sofa. By default, we use the TreeSimulation (\"tree\"). If you want to use the BoostKernel, just do: runSofa -s bgl<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 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: M. Adam, J. Allard, B. Andre, P-J. Bensoussan, S. Cotin, C. Duriez,*\n* H. Delingette, F. Falipou, F. Faure, S. Fonteneau, L. Heigeas, C. Mendoza,  *\n* M. Nesme, P. Neumann, J-P. de la Plata Alcade, F. Poyer and F. Roy          *\n*                                                                             *\n* Contact information: contact@sofa-framework.org                             *\n******************************************************************************\/\n#include <iostream>\n#include <fstream>\n#include <sofa\/helper\/ArgumentParser.h>\n#include <sofa\/simulation\/common\/xml\/initXml.h>\n#include <sofa\/simulation\/common\/Node.h>\n#ifdef SOFA_DEV\n#include <sofa\/simulation\/bgl\/BglSimulation.h>\n#endif\n#include <sofa\/simulation\/tree\/TreeSimulation.h>\n#include <sofa\/component\/init.h>\n#include <sofa\/helper\/Factory.h>\n#include <sofa\/helper\/BackTrace.h>\n#include <sofa\/helper\/system\/FileRepository.h>\n#include <sofa\/gui\/GUIManager.h>\n#include <sofa\/helper\/system\/gl.h>\n#include <sofa\/helper\/system\/glut.h>\n#include <sofa\/helper\/system\/atomic.h>\n\n#ifdef SOFA_GPU_CUDA\n#include <sofa\/gpu\/cuda\/mycuda.h>\n#endif\n\n#ifndef WIN32\n#include <dlfcn.h>\nbool loadPlugin(const char* filename)\n{\n    void *handle;\n    handle=dlopen(filename, RTLD_LAZY);\n    if (!handle)\n    {\n        std::cerr<<\"Error loading plugin \"<<filename<<\": \"<<dlerror()<<std::endl;\n        return false;\n    }\n    std::cerr<<\"Plugin \"<<filename<<\" loaded.\"<<std::endl;\n    return true;\n}\n#else\nbool loadPlugin(const char* filename)\n{\n    HINSTANCE DLLHandle;\n    DLLHandle = LoadLibraryA(filename); \/\/warning: issue between unicode and ansi encoding on Visual c++ -> force to ansi-> dirty!\n    if (DLLHandle == NULL)\n    {\n        std::cerr<<\"Error loading plugin \"<<filename<<std::endl;\n        return false;\n    }\n    std::cerr<<\"Plugin \"<<filename<<\" loaded.\"<<std::endl;\n    return true;\n}\n#endif\n\n\/\/ ---------------------------------------------------------------------\n\/\/ ---\n\/\/ ---------------------------------------------------------------------\nint main(int argc, char** argv)\n{\n    \/\/std::cout << \"Using \" << sofa::helper::system::atomic<int>::getImplName()<<\" atomics.\" << std::endl;\n\n    sofa::helper::BackTrace::autodump();\n\n\n    std::string fileName ;\n    bool        startAnim = false;\n    bool        printFactory = false;\n    bool        loadRecent = false;\n    bool        temporaryFile = false;\n    std::string dimension=\"800x600\";\n    bool fullScreen = false;\n\n    std::string gui = \"\";\n    std::string simulationType = \"tree\";\n    std::vector<std::string> plugins;\n    std::vector<std::string> files;\n\n    std::string gui_help = \"choose the UI (\";\n    gui_help += sofa::gui::GUIManager::ListSupportedGUI('|');\n    gui_help += \")\";\n\n    sofa::helper::parse(&files, \"This is a SOFA application. Here are the command line arguments\")\n    .option(&startAnim,'a',\"start\",\"start the animation loop\")\n    .option(&printFactory,'p',\"factory\",\"print factory logs\")\n    .option(&gui,'g',\"gui\",gui_help.c_str())\n    .option(&simulationType,'s',\"simu\",\"select the type of simulation (bgl, tree)\")\n    .option(&plugins,'l',\"load\",\"load given plugins\")\n    .option(&loadRecent,'r',\"recent\",\"load most recently opened file\")\n    .option(&dimension,'d',\"dimension\",\"width and height of the viewer\")\n    .option(&fullScreen,'f',\"fullScreen\",\"start in full screen\")\n    .option(&temporaryFile,'t',\"temporary\",\"the loaded scene won't appear in history of opened files\")\n    (argc,argv);\n\n    if(gui!=\"batch\") glutInit(&argc,argv);\n#ifdef SOFA_GPU_CUDA\n    sofa::gpu::cuda::mycudaInit();\n#endif\n\n#ifdef SOFA_DEV\n    if (simulationType == \"bgl\")\n    {\n        sofa::simulation::setSimulation(new sofa::simulation::bgl::BglSimulation());\n    }\n    else\n#endif\n    {\n        sofa::simulation::setSimulation(new sofa::simulation::tree::TreeSimulation());\n    }\n    sofa::component::init();\n    sofa::simulation::xml::initXml();\n\n    if (!files.empty()) fileName = files[0];\n\n    for (unsigned int i=0; i<plugins.size(); i++)\n        loadPlugin(plugins[i].c_str());\n\n\n    if (int err=sofa::gui::GUIManager::Init(argv[0],gui.c_str()))\n        return err;\n\n    if (fileName.empty())\n    {\n        if (loadRecent) \/\/ try to reload the latest scene\n        {\n            std::string scenes = \"config\/Sofa.ini\";\n            scenes = sofa::helper::system::DataRepository.getFile( scenes );\n            std::ifstream mrulist(scenes.c_str());\n            std::getline(mrulist,fileName);\n            mrulist.close();\n        }\n        else\n            fileName = \"Demos\/liver.scn\";\n\n        fileName = sofa::helper::system::DataRepository.getFile(fileName);\n    }\n\n\n    if (int err=sofa::gui::GUIManager::createGUI(NULL))\n        return err;\n\n    sofa::simulation::Node* groot = dynamic_cast<sofa::simulation::Node*>( sofa::simulation::getSimulation()->load(fileName.c_str()));\n    if (groot==NULL)  groot = sofa::simulation::getSimulation()->newNode(\"\");\n\n    sofa::simulation::getSimulation()->init(groot);\n    sofa::gui::GUIManager::SetScene(groot,fileName.c_str(), temporaryFile);\n\n\n    \/\/=======================================\n    \/\/Apply Options\n\n    if (startAnim)  groot->setAnimate(true);\n\n    \/\/Dimension Option\n    std::string::size_type separator=dimension.find_first_of('x');\n    if (separator != std::string::npos)\n    {\n        std::string stringWidth=dimension.substr(0,separator);\n        std::string stringHeight=dimension.substr(separator+1);\n        sofa::gui::GUIManager::SetDimension(atoi(stringWidth.c_str()), atoi(stringHeight.c_str()));\n    }\n\n    if (printFactory)\n    {\n        std::cout << \"\/\/\/\/\/\/\/\/\/\/ FACTORY \/\/\/\/\/\/\/\/\/\/\" << std::endl;\n        sofa::helper::printFactoryLog();\n        std::cout << \"\/\/\/\/\/\/\/\/ END FACTORY \/\/\/\/\/\/\/\/\" << std::endl;\n    }\n\n    if (fullScreen) sofa::gui::GUIManager::SetFullScreen();\n\n    \/\/=======================================\n    \/\/ Run the main loop\n    if (int err=sofa::gui::GUIManager::MainLoop(groot,fileName.c_str()))\n        return err;\n    groot = dynamic_cast<sofa::simulation::Node*>( sofa::gui::GUIManager::CurrentSimulation() );\n\n\n    if (groot!=NULL) sofa::simulation::getSimulation()->unload(groot);\n    return 0;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2016 Kimball Thurston\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining\n\/\/ a 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,\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 SOFTWARE\n\/\/ OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\/\/\n\n#include <base\/uri.h>\n#include <base\/scope_guard.h>\n#include <base\/contract.h>\n#include <base\/cmd_line.h>\n#include <base\/posix_file_system.h>\n#include <media\/reader.h>\n#include <media\/writer.h>\n#include <media\/sample.h>\n#include <image\/plane.h>\n#include <image\/plane_ops.h>\n#include <sstream>\n#include <iostream>\n#include <fstream>\n#include <typeindex>\n\nnamespace\n{\n\nusing namespace image;\n\nplane test_refcount( void )\n{\n\tfloat v = 1.F;\n\tplane x = create_plane( 1920, 1080, v );\n\/\/\tstd::cout << std::endl;\n\tplane y = create_plane( 1920, 1080, v );\n\/\/\tstd::cout << std::endl;\n\tplane z = create_plane( 1920, 1080, v );\n\/\/\tstd::cout << std::endl;\n\n\t\/\/ x, y, z should be in separate graphs\n\/\/\tstd::cout << std::endl;\n\/\/\tstd::cout << \"constructed x, y, z: \" << x.id() << \", \" << y.id() << \", \" << z.id() << std::endl;\n\/\/\tstd::cout << std::endl;\n\n\t\/\/ and now s will copy \/ combine them to 1\n\tplane s = x + y + z;\n\/\/\tfor ( size_t n = 0; n != 10000; ++n )\n\/\/\t{\n\/\/\t\tif ( n % 2 == 0 )\n\/\/\t\t\ts += s;\n\/\/\t\telse\n\/\/\t\t\ts -= s;\n\/\/\t}\n\n\/\/\tstd::cout << std::endl;\n\/\/\tstd::cout << \"sum finished: \" << s.id() << std::endl;\n\/\/\tstd::cout << std::endl;\n\ts \/= 3.0;\n\/\/\tstd::cout << std::endl;\n\/\/\tstd::cout << \"ave finished: \" << s.id() << std::endl;\n\/\/\tstd::cout << std::endl;\n\n\t\/\/ make a dangling reference in the graph\n\/\/\tstd::cout << std::endl;\n\tplane t = s + 1.F;\n\/\/\tstd::cout << std::endl << \"function finished\" << std::endl;\n\n\treturn s;\/\/( x + y + z ) \/ 3.0;\n}\n\nint safemain( int argc, char *argv[] )\n{\n\tauto avev = sum( test_refcount() ) \/ static_cast<double>( 1920 * 1080 );\n\/\/\tstd::cout << \"sum created: id \" << avev.id() << std::endl;\n\n\t\/\/ should only be one reference left at this point\n\/\/\tavev.graph_ptr()->dump_refs( std::cout );\n\tavev.graph_ptr()->dump_dot( \"graphOrig.dot\" );\n\n\/\/\tavev.graph_ptr()->clean_graph();\n\/\/\tavev.graph_ptr()->dump_dot( \"graphClean.dot\" );\n\n\tavev.graph_ptr()->optimize();\n\tavev.graph_ptr()->dump_dot( \"graphOpt.dot\" );\n\t\n\t\/\/ force the graph to be processed\n\tstd::cout << \"Initiating processing...\" << std::endl;\n\tdouble ave = static_cast<double>( avev );\n\tstd::cout << \"Processing finished!\" << std::endl;\n\tstd::cout << \"ave: \" << ave << std::endl;\n\n\/\/\tavev.graph_ptr()->clean_graph();\n\/\/\tavev.graph_ptr()->dump_dot( \"graphClean.dot\" );\n\n#if 0\n\tbase::cmd_line options(\n\t\targv[0],\n\t\tbase::cmd_line::option(\n\t\t\t0, std::string(),\n\t\t\t\"<input_file>\", base::cmd_line::arg<1>,\n\t\t\t\"Input file pattern to transcode\", true ),\n\t\tbase::cmd_line::option(\n\t\t\t0, std::string(),\n\t\t\t\"<output_file>\", base::cmd_line::arg<1>,\n\t\t\t\"Output file pattern to create\", true )\n\t);\n\n\tauto errhandler = base::make_guard( [&]() { std::cerr << options << std::endl; } );\n\toptions.parse( argc, argv );\n\terrhandler.dismiss();\n\n\tmedia::metadata outputOptions;\n\tauto &inP = options[\"<input_file>\"];\n\tauto &outP = options[\"<output_file>\"];\n\tif ( inP && outP )\n\t{\n\t\tbase::uri inputU( inP.value() );\n\t\tif ( ! inputU )\n\t\t\tinputU.set_scheme( \"file\" );\n\t\tbase::uri outputU( outP.value() );\n\t\tif ( ! outputU )\n\t\t\toutputU.set_scheme( \"file\" );\n\n\t\tmedia::container c = media::reader::open( inputU );\n\t\tstd::vector<media::track_description> tds;\n\t\tfor ( auto &vt: c.video_tracks() )\n\t\t{\n\t\t\tstd::cout << \"Converting track '\" << vt->name() << \"' frames \" << vt->begin() << \" - \" << vt->end() << \" @ rate \" << vt->rate() << std::endl;\n\n\t\t\tmedia::sample s( vt->begin(), vt->rate() );\n\n\t\t\ttds.push_back( media::TRACK_VIDEO );\n\t\t\ttds.back().rate( vt->rate() );\n\t\t\ttds.back().offset( vt->begin() );\n\t\t\ttds.back().duration( vt->end() - vt->begin() + 1 );\n\t\t\ttds.back().set_option( \"compression\", \"piz\" );\n\t\t}\n\n\t\tmedia::container oc = media::writer::open( outputU, tds, outputOptions );\n\t\tsize_t ovt = 0;\n\t\tfor ( auto &vt: c.video_tracks() )\n\t\t{\n\t\t\tfor ( int64_t f = vt->begin(); f <= vt->end(); ++f )\n\t\t\t{\n\t\t\t\tmedia::sample s( f, vt->rate() );\n\t\t\t\n\t\t\t\tauto curFrm = s( vt );\n\t\t\t\tif ( f == vt->begin() )\n\t\t\t\t\tstd::cout << \" size: \" << curFrm->width() << \" x \" << curFrm->height() << \", \" << curFrm->size() << \" channels\" << std::endl;\n\n\t\t\t\toc.video_tracks()[ovt]->store( f, curFrm );\n\t\t\t}\n\t\t\t++ovt;\n\t\t}\n\t}\n#endif\n\treturn 0;\n}\n\n}\n\nint main( int argc, char *argv[] )\n{\n\ttry\n\t{\n\t\treturn safemain( argc, argv );\n\t}\n\tcatch ( const std::exception &e )\n\t{\n\t\tbase::print_exception( std::cerr, e );\n\t}\n}\n<commit_msg>add cpu info print for now<commit_after>\/\/\n\/\/ Copyright (c) 2016 Kimball Thurston\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining\n\/\/ a 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,\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 SOFTWARE\n\/\/ OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\/\/\n\n#include <base\/uri.h>\n#include <base\/scope_guard.h>\n#include <base\/contract.h>\n#include <base\/cmd_line.h>\n#include <base\/cpu_features.h>\n#include <base\/posix_file_system.h>\n#include <media\/reader.h>\n#include <media\/writer.h>\n#include <media\/sample.h>\n#include <image\/plane.h>\n#include <image\/plane_ops.h>\n#include <sstream>\n#include <iostream>\n#include <fstream>\n#include <typeindex>\n\nnamespace\n{\n\nusing namespace image;\n\nplane test_refcount( void )\n{\n\tfloat v = 1.F;\n\tplane x = create_plane( 1920, 1080, v );\n\/\/\tstd::cout << std::endl;\n\tplane y = create_plane( 1920, 1080, v );\n\/\/\tstd::cout << std::endl;\n\tplane z = create_plane( 1920, 1080, v );\n\/\/\tstd::cout << std::endl;\n\n\t\/\/ x, y, z should be in separate graphs\n\/\/\tstd::cout << std::endl;\n\/\/\tstd::cout << \"constructed x, y, z: \" << x.id() << \", \" << y.id() << \", \" << z.id() << std::endl;\n\/\/\tstd::cout << std::endl;\n\n\t\/\/ and now s will copy \/ combine them to 1\n\tplane s = x + y + z;\n\/\/\tfor ( size_t n = 0; n != 10000; ++n )\n\/\/\t{\n\/\/\t\tif ( n % 2 == 0 )\n\/\/\t\t\ts += s;\n\/\/\t\telse\n\/\/\t\t\ts -= s;\n\/\/\t}\n\n\/\/\tstd::cout << std::endl;\n\/\/\tstd::cout << \"sum finished: \" << s.id() << std::endl;\n\/\/\tstd::cout << std::endl;\n\ts \/= 3.0;\n\/\/\tstd::cout << std::endl;\n\/\/\tstd::cout << \"ave finished: \" << s.id() << std::endl;\n\/\/\tstd::cout << std::endl;\n\n\t\/\/ make a dangling reference in the graph\n\/\/\tstd::cout << std::endl;\n\tplane t = s + 1.F;\n\/\/\tstd::cout << std::endl << \"function finished\" << std::endl;\n\n\treturn s;\/\/( x + y + z ) \/ 3.0;\n}\n\nint safemain( int argc, char *argv[] )\n{\n\tstd::cout << \"CPU features:\\n\";\n\tbase::cpu::output( std::cout );\n\tstd::cout << \"\\nStarting graph generation...\" << std::endl;\n\n\tauto avev = sum( test_refcount() ) \/ static_cast<double>( 1920 * 1080 );\n\/\/\tstd::cout << \"sum created: id \" << avev.id() << std::endl;\n\n\t\/\/ should only be one reference left at this point\n\/\/\tavev.graph_ptr()->dump_refs( std::cout );\n\tavev.graph_ptr()->dump_dot( \"graphOrig.dot\" );\n\n\/\/\tavev.graph_ptr()->clean_graph();\n\/\/\tavev.graph_ptr()->dump_dot( \"graphClean.dot\" );\n\n\tavev.graph_ptr()->optimize();\n\tavev.graph_ptr()->dump_dot( \"graphOpt.dot\" );\n\t\n\t\/\/ force the graph to be processed\n\tstd::cout << \"Initiating processing...\" << std::endl;\n\tdouble ave = static_cast<double>( avev );\n\tstd::cout << \"Processing finished!\" << std::endl;\n\tstd::cout << \"ave: \" << ave << std::endl;\n\n\/\/\tavev.graph_ptr()->clean_graph();\n\/\/\tavev.graph_ptr()->dump_dot( \"graphClean.dot\" );\n\n#if 0\n\tbase::cmd_line options(\n\t\targv[0],\n\t\tbase::cmd_line::option(\n\t\t\t0, std::string(),\n\t\t\t\"<input_file>\", base::cmd_line::arg<1>,\n\t\t\t\"Input file pattern to transcode\", true ),\n\t\tbase::cmd_line::option(\n\t\t\t0, std::string(),\n\t\t\t\"<output_file>\", base::cmd_line::arg<1>,\n\t\t\t\"Output file pattern to create\", true )\n\t);\n\n\tauto errhandler = base::make_guard( [&]() { std::cerr << options << std::endl; } );\n\toptions.parse( argc, argv );\n\terrhandler.dismiss();\n\n\tmedia::metadata outputOptions;\n\tauto &inP = options[\"<input_file>\"];\n\tauto &outP = options[\"<output_file>\"];\n\tif ( inP && outP )\n\t{\n\t\tbase::uri inputU( inP.value() );\n\t\tif ( ! inputU )\n\t\t\tinputU.set_scheme( \"file\" );\n\t\tbase::uri outputU( outP.value() );\n\t\tif ( ! outputU )\n\t\t\toutputU.set_scheme( \"file\" );\n\n\t\tmedia::container c = media::reader::open( inputU );\n\t\tstd::vector<media::track_description> tds;\n\t\tfor ( auto &vt: c.video_tracks() )\n\t\t{\n\t\t\tstd::cout << \"Converting track '\" << vt->name() << \"' frames \" << vt->begin() << \" - \" << vt->end() << \" @ rate \" << vt->rate() << std::endl;\n\n\t\t\tmedia::sample s( vt->begin(), vt->rate() );\n\n\t\t\ttds.push_back( media::TRACK_VIDEO );\n\t\t\ttds.back().rate( vt->rate() );\n\t\t\ttds.back().offset( vt->begin() );\n\t\t\ttds.back().duration( vt->end() - vt->begin() + 1 );\n\t\t\ttds.back().set_option( \"compression\", \"piz\" );\n\t\t}\n\n\t\tmedia::container oc = media::writer::open( outputU, tds, outputOptions );\n\t\tsize_t ovt = 0;\n\t\tfor ( auto &vt: c.video_tracks() )\n\t\t{\n\t\t\tfor ( int64_t f = vt->begin(); f <= vt->end(); ++f )\n\t\t\t{\n\t\t\t\tmedia::sample s( f, vt->rate() );\n\t\t\t\n\t\t\t\tauto curFrm = s( vt );\n\t\t\t\tif ( f == vt->begin() )\n\t\t\t\t\tstd::cout << \" size: \" << curFrm->width() << \" x \" << curFrm->height() << \", \" << curFrm->size() << \" channels\" << std::endl;\n\n\t\t\t\toc.video_tracks()[ovt]->store( f, curFrm );\n\t\t\t}\n\t\t\t++ovt;\n\t\t}\n\t}\n#endif\n\treturn 0;\n}\n\n}\n\nint main( int argc, char *argv[] )\n{\n\ttry\n\t{\n\t\treturn safemain( argc, argv );\n\t}\n\tcatch ( const std::exception &e )\n\t{\n\t\tbase::print_exception( std::cerr, e );\n\t}\n}\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_EXCEPTIONS_HH\n#define DUNE_GDT_EXCEPTIONS_HH\n\n#include <dune\/stuff\/common\/exceptions.hh>\n\nnamespace Dune {\nnamespace GDT {\nnamespace Exceptions {\n\n\nclass operator_error : public Dune::Exception\n{\n};\n\nclass prolongation_error : operator_error\n{\n};\n\nclass darcy_operator_error : public operator_error\n{\n};\n\n\n} \/\/ namespace Exceptions\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_EXCEPTIONS_HH\n<commit_msg>[exceptions] fix 59cd2f6<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_EXCEPTIONS_HH\n#define DUNE_GDT_EXCEPTIONS_HH\n\n#include <dune\/stuff\/common\/exceptions.hh>\n\nnamespace Dune {\nnamespace GDT {\nnamespace Exceptions {\n\n\nclass operator_error : public Dune::Exception\n{\n};\n\nclass prolongation_error : public operator_error\n{\n};\n\nclass darcy_operator_error : public operator_error\n{\n};\n\n\n} \/\/ namespace Exceptions\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_EXCEPTIONS_HH\n<|endoftext|>"}
{"text":"<commit_before>\/*\r\n * $Id$\r\n *\r\n * Copyright(C) 1998-2004 Satoshi Nakamura\r\n * All rights reserved.\r\n *\r\n *\/\r\n\r\n#include <qmaccount.h>\r\n#include <qmapplication.h>\r\n#include <qmdocument.h>\r\n#include <qmfolder.h>\r\n#include <qmmessage.h>\r\n#include <qmmessageholder.h>\r\n#include <qmtemplate.h>\r\n\r\n#include <qsconv.h>\r\n#include <qsosutil.h>\r\n\r\n#include \"templateprocessor.h\"\r\n#include \"..\/model\/editmessage.h\"\r\n#include \"..\/model\/templatemanager.h\"\r\n#include \"..\/ui\/editframewindow.h\"\r\n#include \"..\/ui\/encodingmodel.h\"\r\n#include \"..\/ui\/externaleditor.h\"\r\n#include \"..\/ui\/foldermodel.h\"\r\n#include \"..\/ui\/messageselectionmodel.h\"\r\n#include \"..\/ui\/securitymodel.h\"\r\n\r\nusing namespace qm;\r\nusing namespace qs;\r\n\r\n\r\n\/****************************************************************************\r\n *\r\n * TemplateProcessor\r\n *\r\n *\/\r\n\r\nqm::TemplateProcessor::TemplateProcessor(Document* pDocument,\r\n\t\t\t\t\t\t\t\t\t\t FolderModelBase* pFolderModel,\r\n\t\t\t\t\t\t\t\t\t\t MessageSelectionModel* pMessageSelectionModel,\r\n\t\t\t\t\t\t\t\t\t\t EncodingModel* pEncodingModel,\r\n\t\t\t\t\t\t\t\t\t\t SecurityModel* pSecurityModel,\r\n\t\t\t\t\t\t\t\t\t\t EditFrameWindowManager* pEditFrameWindowManager,\r\n\t\t\t\t\t\t\t\t\t\t ExternalEditorManager* pExternalEditorManager,\r\n\t\t\t\t\t\t\t\t\t\t HWND hwnd,\r\n\t\t\t\t\t\t\t\t\t\t Profile* pProfile,\r\n\t\t\t\t\t\t\t\t\t\t bool bExternalEditor) :\r\n\tpDocument_(pDocument),\r\n\tpFolderModel_(pFolderModel),\r\n\tpMessageSelectionModel_(pMessageSelectionModel),\r\n\tpEncodingModel_(pEncodingModel),\r\n\tpSecurityModel_(pSecurityModel),\r\n\tpEditFrameWindowManager_(pEditFrameWindowManager),\r\n\tpExternalEditorManager_(pExternalEditorManager),\r\n\thwnd_(hwnd),\r\n\tpProfile_(pProfile),\r\n\tbExternalEditor_(bExternalEditor)\r\n{\r\n\tassert(pDocument_);\r\n\tassert(pFolderModel);\r\n\tassert(pMessageSelectionModel);\r\n\tassert(pEditFrameWindowManager_);\r\n\tassert(hwnd_);\r\n\tassert(pProfile_);\r\n}\r\n\r\nqm::TemplateProcessor::~TemplateProcessor()\r\n{\r\n}\r\n\r\nbool qm::TemplateProcessor::process(const WCHAR* pwszTemplateName,\r\n\t\t\t\t\t\t\t\t\tbool bReverseExternalEditor) const\r\n{\r\n\tTemplateContext::ArgumentList l;\r\n\treturn process(pwszTemplateName, l, bReverseExternalEditor, 0);\r\n}\r\n\r\nbool qm::TemplateProcessor::process(const WCHAR* pwszTemplateName,\r\n\t\t\t\t\t\t\t\t\tconst TemplateContext::ArgumentList& listArgument,\r\n\t\t\t\t\t\t\t\t\tbool bReverseExternalEditor,\r\n\t\t\t\t\t\t\t\t\tAccount* pAccountForced) const\r\n{\r\n\tassert(pwszTemplateName);\r\n\t\r\n\tAccount* pAccount = pAccountForced;\r\n\tFolder* pFolder = 0;\r\n\tif (!pAccount) {\r\n\t\tstd::pair<Account*, Folder*> p(pFolderModel_->getCurrent());\r\n\t\tpAccount = p.first ? p.first : p.second ? p.second->getAccount() : 0;\r\n\t\tif (!pAccount)\r\n\t\t\treturn false;\r\n\t}\r\n\t\r\n\tconst Template* pTemplate = pDocument_->getTemplateManager()->getTemplate(\r\n\t\tpAccount, pFolder, pwszTemplateName);\r\n\tif (!pTemplate)\r\n\t\treturn false;\r\n\t\r\n\tMessagePtrLock mpl(pMessageSelectionModel_->getFocusedMessage());\r\n\tMessageHolder* pmh = 0;\r\n\tif (!pAccountForced)\r\n\t\tpmh = mpl;\r\n\t\r\n\tAccountLock lock;\r\n\tMessageHolderList listSelected;\r\n\tif (!pAccountForced)\r\n\t\tpMessageSelectionModel_->getSelectedMessages(&lock, 0, &listSelected);\r\n\t\r\n\tconst WCHAR* pwszBodyCharset = 0;\r\n\tif (pEncodingModel_)\r\n\t\tpwszBodyCharset = pEncodingModel_->getEncoding();\r\n\t\r\n\tMacroErrorHandlerImpl handler;\r\n\tMessage msg;\r\n\tTemplateContext context(pmh, pmh ? &msg : 0, listSelected, pAccount,\r\n\t\tpDocument_, hwnd_, pwszBodyCharset, pSecurityModel_->getSecurityMode(),\r\n\t\tpProfile_, &handler, listArgument);\r\n\t\r\n\twstring_ptr wstrValue;\r\n\tswitch (pTemplate->getValue(context, &wstrValue)) {\r\n\tcase Template::RESULT_SUCCESS:\r\n\t\tbreak;\r\n\tcase Template::RESULT_ERROR:\r\n\t\treturn false;\r\n\tcase Template::RESULT_CANCEL:\r\n\t\treturn true;\r\n\tdefault:\r\n\t\tassert(false);\r\n\t\treturn false;\r\n\t}\r\n\t\r\n\tbool bExternalEditor = bExternalEditor_;\r\n\tif (pProfile_->getInt(L\"Global\", L\"UseExternalEditor\", 0) != 0)\r\n\t\tbExternalEditor = !bExternalEditor;\r\n\tif (bReverseExternalEditor)\r\n\t\tbExternalEditor = !bExternalEditor;\r\n\t\r\n\tif (bExternalEditor) {\r\n\t\treturn pExternalEditorManager_->open(wstrValue.get());\r\n\t}\r\n\telse {\r\n\t\tMessageCreator creator;\r\n\t\tstd::auto_ptr<Message> pMessage(creator.createMessage(\r\n\t\t\tpDocument_, wstrValue.get(), -1));\r\n\t\tif (!pMessage.get())\r\n\t\t\treturn false;\r\n\t\t\r\n\t\tstd::auto_ptr<EditMessage> pEditMessage(new EditMessage(pProfile_,\r\n\t\t\tpDocument_, pAccount, pSecurityModel_->getSecurityMode()));\r\n\t\tif (!pEditMessage->setMessage(pMessage))\r\n\t\t\treturn false;\r\n\t\t\r\n\t\tif (!pEditFrameWindowManager_->open(pEditMessage))\r\n\t\t\treturn false;\r\n\t}\r\n\t\r\n\treturn true;\r\n}\r\n\r\n\r\n\/****************************************************************************\r\n *\r\n * TemplateProcessor::MacroErrorHandlerImpl\r\n *\r\n *\/\r\n\r\nqm::TemplateProcessor::MacroErrorHandlerImpl::MacroErrorHandlerImpl()\r\n{\r\n}\r\n\r\nqm::TemplateProcessor::MacroErrorHandlerImpl::~MacroErrorHandlerImpl()\r\n{\r\n}\r\n\r\nvoid qm::TemplateProcessor::MacroErrorHandlerImpl::parseError(Code code,\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t  const WCHAR* pwsz)\r\n{\r\n\t\/\/ TODO\r\n}\r\n\r\nvoid qm::TemplateProcessor::MacroErrorHandlerImpl::processError(Code code,\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tconst WCHAR* pwsz)\r\n{\r\n\t\/\/ TODO\r\n}\r\n<commit_msg>Fix folder specific templates are not used. <BTS:740><commit_after>\/*\r\n * $Id$\r\n *\r\n * Copyright(C) 1998-2004 Satoshi Nakamura\r\n * All rights reserved.\r\n *\r\n *\/\r\n\r\n#include <qmaccount.h>\r\n#include <qmapplication.h>\r\n#include <qmdocument.h>\r\n#include <qmfolder.h>\r\n#include <qmmessage.h>\r\n#include <qmmessageholder.h>\r\n#include <qmtemplate.h>\r\n\r\n#include <qsconv.h>\r\n#include <qsosutil.h>\r\n\r\n#include \"templateprocessor.h\"\r\n#include \"..\/model\/editmessage.h\"\r\n#include \"..\/model\/templatemanager.h\"\r\n#include \"..\/ui\/editframewindow.h\"\r\n#include \"..\/ui\/encodingmodel.h\"\r\n#include \"..\/ui\/externaleditor.h\"\r\n#include \"..\/ui\/foldermodel.h\"\r\n#include \"..\/ui\/messageselectionmodel.h\"\r\n#include \"..\/ui\/securitymodel.h\"\r\n\r\nusing namespace qm;\r\nusing namespace qs;\r\n\r\n\r\n\/****************************************************************************\r\n *\r\n * TemplateProcessor\r\n *\r\n *\/\r\n\r\nqm::TemplateProcessor::TemplateProcessor(Document* pDocument,\r\n\t\t\t\t\t\t\t\t\t\t FolderModelBase* pFolderModel,\r\n\t\t\t\t\t\t\t\t\t\t MessageSelectionModel* pMessageSelectionModel,\r\n\t\t\t\t\t\t\t\t\t\t EncodingModel* pEncodingModel,\r\n\t\t\t\t\t\t\t\t\t\t SecurityModel* pSecurityModel,\r\n\t\t\t\t\t\t\t\t\t\t EditFrameWindowManager* pEditFrameWindowManager,\r\n\t\t\t\t\t\t\t\t\t\t ExternalEditorManager* pExternalEditorManager,\r\n\t\t\t\t\t\t\t\t\t\t HWND hwnd,\r\n\t\t\t\t\t\t\t\t\t\t Profile* pProfile,\r\n\t\t\t\t\t\t\t\t\t\t bool bExternalEditor) :\r\n\tpDocument_(pDocument),\r\n\tpFolderModel_(pFolderModel),\r\n\tpMessageSelectionModel_(pMessageSelectionModel),\r\n\tpEncodingModel_(pEncodingModel),\r\n\tpSecurityModel_(pSecurityModel),\r\n\tpEditFrameWindowManager_(pEditFrameWindowManager),\r\n\tpExternalEditorManager_(pExternalEditorManager),\r\n\thwnd_(hwnd),\r\n\tpProfile_(pProfile),\r\n\tbExternalEditor_(bExternalEditor)\r\n{\r\n\tassert(pDocument_);\r\n\tassert(pFolderModel);\r\n\tassert(pMessageSelectionModel);\r\n\tassert(pEditFrameWindowManager_);\r\n\tassert(hwnd_);\r\n\tassert(pProfile_);\r\n}\r\n\r\nqm::TemplateProcessor::~TemplateProcessor()\r\n{\r\n}\r\n\r\nbool qm::TemplateProcessor::process(const WCHAR* pwszTemplateName,\r\n\t\t\t\t\t\t\t\t\tbool bReverseExternalEditor) const\r\n{\r\n\tTemplateContext::ArgumentList l;\r\n\treturn process(pwszTemplateName, l, bReverseExternalEditor, 0);\r\n}\r\n\r\nbool qm::TemplateProcessor::process(const WCHAR* pwszTemplateName,\r\n\t\t\t\t\t\t\t\t\tconst TemplateContext::ArgumentList& listArgument,\r\n\t\t\t\t\t\t\t\t\tbool bReverseExternalEditor,\r\n\t\t\t\t\t\t\t\t\tAccount* pAccountForced) const\r\n{\r\n\tassert(pwszTemplateName);\r\n\t\r\n\tAccount* pAccount = pAccountForced;\r\n\tFolder* pFolder = 0;\r\n\tif (!pAccount) {\r\n\t\tstd::pair<Account*, Folder*> p(pFolderModel_->getCurrent());\r\n\t\tpAccount = p.first ? p.first : p.second ? p.second->getAccount() : 0;\r\n\t\tif (!pAccount)\r\n\t\t\treturn false;\r\n\t\tpFolder = p.second;\r\n\t}\r\n\t\r\n\tconst Template* pTemplate = pDocument_->getTemplateManager()->getTemplate(\r\n\t\tpAccount, pFolder, pwszTemplateName);\r\n\tif (!pTemplate)\r\n\t\treturn false;\r\n\t\r\n\tMessagePtrLock mpl(pMessageSelectionModel_->getFocusedMessage());\r\n\tMessageHolder* pmh = 0;\r\n\tif (!pAccountForced)\r\n\t\tpmh = mpl;\r\n\t\r\n\tAccountLock lock;\r\n\tMessageHolderList listSelected;\r\n\tif (!pAccountForced)\r\n\t\tpMessageSelectionModel_->getSelectedMessages(&lock, 0, &listSelected);\r\n\t\r\n\tconst WCHAR* pwszBodyCharset = 0;\r\n\tif (pEncodingModel_)\r\n\t\tpwszBodyCharset = pEncodingModel_->getEncoding();\r\n\t\r\n\tMacroErrorHandlerImpl handler;\r\n\tMessage msg;\r\n\tTemplateContext context(pmh, pmh ? &msg : 0, listSelected, pAccount,\r\n\t\tpDocument_, hwnd_, pwszBodyCharset, pSecurityModel_->getSecurityMode(),\r\n\t\tpProfile_, &handler, listArgument);\r\n\t\r\n\twstring_ptr wstrValue;\r\n\tswitch (pTemplate->getValue(context, &wstrValue)) {\r\n\tcase Template::RESULT_SUCCESS:\r\n\t\tbreak;\r\n\tcase Template::RESULT_ERROR:\r\n\t\treturn false;\r\n\tcase Template::RESULT_CANCEL:\r\n\t\treturn true;\r\n\tdefault:\r\n\t\tassert(false);\r\n\t\treturn false;\r\n\t}\r\n\t\r\n\tbool bExternalEditor = bExternalEditor_;\r\n\tif (pProfile_->getInt(L\"Global\", L\"UseExternalEditor\", 0) != 0)\r\n\t\tbExternalEditor = !bExternalEditor;\r\n\tif (bReverseExternalEditor)\r\n\t\tbExternalEditor = !bExternalEditor;\r\n\t\r\n\tif (bExternalEditor) {\r\n\t\treturn pExternalEditorManager_->open(wstrValue.get());\r\n\t}\r\n\telse {\r\n\t\tMessageCreator creator;\r\n\t\tstd::auto_ptr<Message> pMessage(creator.createMessage(\r\n\t\t\tpDocument_, wstrValue.get(), -1));\r\n\t\tif (!pMessage.get())\r\n\t\t\treturn false;\r\n\t\t\r\n\t\tstd::auto_ptr<EditMessage> pEditMessage(new EditMessage(pProfile_,\r\n\t\t\tpDocument_, pAccount, pSecurityModel_->getSecurityMode()));\r\n\t\tif (!pEditMessage->setMessage(pMessage))\r\n\t\t\treturn false;\r\n\t\t\r\n\t\tif (!pEditFrameWindowManager_->open(pEditMessage))\r\n\t\t\treturn false;\r\n\t}\r\n\t\r\n\treturn true;\r\n}\r\n\r\n\r\n\/****************************************************************************\r\n *\r\n * TemplateProcessor::MacroErrorHandlerImpl\r\n *\r\n *\/\r\n\r\nqm::TemplateProcessor::MacroErrorHandlerImpl::MacroErrorHandlerImpl()\r\n{\r\n}\r\n\r\nqm::TemplateProcessor::MacroErrorHandlerImpl::~MacroErrorHandlerImpl()\r\n{\r\n}\r\n\r\nvoid qm::TemplateProcessor::MacroErrorHandlerImpl::parseError(Code code,\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t  const WCHAR* pwsz)\r\n{\r\n\t\/\/ TODO\r\n}\r\n\r\nvoid qm::TemplateProcessor::MacroErrorHandlerImpl::processError(Code code,\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tconst WCHAR* pwsz)\r\n{\r\n\t\/\/ TODO\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before>\/**\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 * @file eggBinner.cxx\n * @author drose\n * @date 2000-02-17\n *\/\n\n#include \"eggBinner.h\"\n#include \"eggRenderState.h\"\n#include \"eggPrimitive.h\"\n#include \"eggNurbsSurface.h\"\n#include \"eggNurbsCurve.h\"\n#include \"eggPatch.h\"\n#include \"eggSwitchCondition.h\"\n#include \"eggGroup.h\"\n#include \"dcast.h\"\n\n\/**\n *\n *\/\nEggBinner::\nEggBinner(EggLoader &loader) :\n  _loader(loader)\n{\n}\n\n\/**\n * May be overridden in derived classes to perform some setup work as each\n * node is encountered.  This will be called once for each node in the egg\n * hierarchy.\n *\/\nvoid EggBinner::\nprepare_node(EggNode *node) {\n  if (node->is_of_type(EggPrimitive::get_class_type())) {\n    EggPrimitive *egg_prim = DCAST(EggPrimitive, node);\n    PT(EggRenderState) render_state = new EggRenderState(_loader);\n    render_state->fill_state(egg_prim);\n    egg_prim->set_user_data(render_state);\n  }\n}\n\n\/**\n *\n *\/\nint EggBinner::\nget_bin_number(const EggNode *node) {\n  if (node->is_of_type(EggPrimitive::get_class_type())) {\n    return (int)BN_polyset;\n\n  } else if (node->is_of_type(EggGroup::get_class_type())) {\n    const EggGroup *group = DCAST(EggGroup, node);\n    if (group->has_lod()) {\n      return (int)BN_lod;\n    }\n\n  } else if (node->is_of_type(EggNurbsSurface::get_class_type())) {\n    return (int)BN_nurbs_surface;\n\n  } else if (node->is_of_type(EggNurbsCurve::get_class_type())) {\n    return (int)BN_nurbs_curve;\n\n  } else if (node->is_of_type(EggPatch::get_class_type())) {\n    return (int)BN_patches;\n  }\n\n  return (int)BN_none;\n}\n\n\/**\n * May be overridden in derived classes to define a name for each new bin,\n * based on its bin number, and a sample child.\n *\/\nstring EggBinner::\nget_bin_name(int bin_number, const EggNode *child) {\n  if (bin_number == BN_polyset || bin_number == BN_patches) {\n    return DCAST(EggPrimitive, child)->get_sort_name();\n  }\n\n  return string();\n}\n\n\/**\n *\n *\/\nbool EggBinner::\nsorts_less(int bin_number, const EggNode *a, const EggNode *b) {\n  switch (bin_number) {\n  case BN_polyset:\n  case BN_patches:\n    {\n      const EggPrimitive *pa, *pb;\n      DCAST_INTO_R(pa, a, false);\n      DCAST_INTO_R(pb, b, false);\n\n      \/\/ Different render states are binned separately.\n      const EggRenderState *rsa, *rsb;\n      DCAST_INTO_R(rsa, pa->get_user_data(EggRenderState::get_class_type()), false);\n      DCAST_INTO_R(rsb, pb->get_user_data(EggRenderState::get_class_type()), false);\n      int compare = rsa->compare_to(*rsb);\n      if (compare != 0) {\n        return (compare < 0);\n      }\n\n      if (bin_number == BN_patches) {\n        \/\/ For patches only, we group together patches of similar size.\n        const EggPatch *patch_a, *patch_b;\n        DCAST_INTO_R(patch_a, a, false);\n        DCAST_INTO_R(patch_b, b, false);\n        if (patch_a->size() != patch_b->size()) {\n          return patch_a->size() < patch_b->size();\n        }\n      }\n\n      \/\/ Also, if the primitive was given a name (that does not begin with a\n      \/\/ digit), it gets binned with similar-named primitives.\n      return pa->get_sort_name() < pb->get_sort_name();\n    }\n\n  case BN_lod:\n    {\n      const EggGroup *ga = DCAST(EggGroup, a);\n      const EggGroup *gb = DCAST(EggGroup, b);\n\n      const EggSwitchCondition &swa = ga->get_lod();\n      const EggSwitchCondition &swb = gb->get_lod();\n\n      \/\/ For now, this is the only kind of switch condition there is.\n      const EggSwitchConditionDistance &swda =\n        *DCAST(EggSwitchConditionDistance, &swa);\n      const EggSwitchConditionDistance &swdb =\n        *DCAST(EggSwitchConditionDistance, &swb);\n\n      \/\/ Group LOD nodes in order by switching center.\n      return (swda._center.compare_to(swdb._center) < 0);\n    }\n\n  case BN_nurbs_surface:\n  case BN_nurbs_curve:\n    \/\/ Nurbs curves and surfaces are always binned individually.\n    return a < b;\n\n  case BN_none:\n    break;\n  }\n\n  \/\/ Shouldn't get here.\n  return false;\n}\n<commit_msg>Fix regression loading nurbs surface\/curve and patches from .egg<commit_after>\/**\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 * @file eggBinner.cxx\n * @author drose\n * @date 2000-02-17\n *\/\n\n#include \"eggBinner.h\"\n#include \"eggRenderState.h\"\n#include \"eggPrimitive.h\"\n#include \"eggNurbsSurface.h\"\n#include \"eggNurbsCurve.h\"\n#include \"eggPatch.h\"\n#include \"eggSwitchCondition.h\"\n#include \"eggGroup.h\"\n#include \"dcast.h\"\n\n\/**\n *\n *\/\nEggBinner::\nEggBinner(EggLoader &loader) :\n  _loader(loader)\n{\n}\n\n\/**\n * May be overridden in derived classes to perform some setup work as each\n * node is encountered.  This will be called once for each node in the egg\n * hierarchy.\n *\/\nvoid EggBinner::\nprepare_node(EggNode *node) {\n  if (node->is_of_type(EggPrimitive::get_class_type())) {\n    EggPrimitive *egg_prim = DCAST(EggPrimitive, node);\n    PT(EggRenderState) render_state = new EggRenderState(_loader);\n    render_state->fill_state(egg_prim);\n    egg_prim->set_user_data(render_state);\n  }\n}\n\n\/**\n *\n *\/\nint EggBinner::\nget_bin_number(const EggNode *node) {\n  if (node->is_of_type(EggNurbsSurface::get_class_type())) {\n    return (int)BN_nurbs_surface;\n\n  } else if (node->is_of_type(EggNurbsCurve::get_class_type())) {\n    return (int)BN_nurbs_curve;\n\n  } else if (node->is_of_type(EggPatch::get_class_type())) {\n    return (int)BN_patches;\n\n  } else if (node->is_of_type(EggPrimitive::get_class_type())) {\n    return (int)BN_polyset;\n\n  } else if (node->is_of_type(EggGroup::get_class_type())) {\n    const EggGroup *group = DCAST(EggGroup, node);\n    if (group->has_lod()) {\n      return (int)BN_lod;\n    }\n  }\n\n  return (int)BN_none;\n}\n\n\/**\n * May be overridden in derived classes to define a name for each new bin,\n * based on its bin number, and a sample child.\n *\/\nstring EggBinner::\nget_bin_name(int bin_number, const EggNode *child) {\n  if (bin_number == BN_polyset || bin_number == BN_patches) {\n    return DCAST(EggPrimitive, child)->get_sort_name();\n  }\n\n  return string();\n}\n\n\/**\n *\n *\/\nbool EggBinner::\nsorts_less(int bin_number, const EggNode *a, const EggNode *b) {\n  switch (bin_number) {\n  case BN_polyset:\n  case BN_patches:\n    {\n      const EggPrimitive *pa, *pb;\n      DCAST_INTO_R(pa, a, false);\n      DCAST_INTO_R(pb, b, false);\n\n      \/\/ Different render states are binned separately.\n      const EggRenderState *rsa, *rsb;\n      DCAST_INTO_R(rsa, pa->get_user_data(EggRenderState::get_class_type()), false);\n      DCAST_INTO_R(rsb, pb->get_user_data(EggRenderState::get_class_type()), false);\n      int compare = rsa->compare_to(*rsb);\n      if (compare != 0) {\n        return (compare < 0);\n      }\n\n      if (bin_number == BN_patches) {\n        \/\/ For patches only, we group together patches of similar size.\n        const EggPatch *patch_a, *patch_b;\n        DCAST_INTO_R(patch_a, a, false);\n        DCAST_INTO_R(patch_b, b, false);\n        if (patch_a->size() != patch_b->size()) {\n          return patch_a->size() < patch_b->size();\n        }\n      }\n\n      \/\/ Also, if the primitive was given a name (that does not begin with a\n      \/\/ digit), it gets binned with similar-named primitives.\n      return pa->get_sort_name() < pb->get_sort_name();\n    }\n\n  case BN_lod:\n    {\n      const EggGroup *ga = DCAST(EggGroup, a);\n      const EggGroup *gb = DCAST(EggGroup, b);\n\n      const EggSwitchCondition &swa = ga->get_lod();\n      const EggSwitchCondition &swb = gb->get_lod();\n\n      \/\/ For now, this is the only kind of switch condition there is.\n      const EggSwitchConditionDistance &swda =\n        *DCAST(EggSwitchConditionDistance, &swa);\n      const EggSwitchConditionDistance &swdb =\n        *DCAST(EggSwitchConditionDistance, &swb);\n\n      \/\/ Group LOD nodes in order by switching center.\n      return (swda._center.compare_to(swdb._center) < 0);\n    }\n\n  case BN_nurbs_surface:\n  case BN_nurbs_curve:\n    \/\/ Nurbs curves and surfaces are always binned individually.\n    return a < b;\n\n  case BN_none:\n    break;\n  }\n\n  \/\/ Shouldn't get here.\n  return false;\n}\n<|endoftext|>"}
{"text":"<commit_before>\n\/\/ Copyright (c) 2012, 2013, 2014 Pierre MOULON.\n\n\/\/ This Source Code Form is subject to the terms of the Mozilla Public\n\/\/ License, v. 2.0. If a copy of the MPL was not distributed with this\n\/\/ file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#ifndef OPENMVG_SFM_DATA_IO_GT_HPP\n#define OPENMVG_SFM_DATA_IO_GT_HPP\n\n#include \"sfm_data_io.hpp\"\n\n#include \"openMVG\/geometry\/pose3.hpp\"\n#include \"openMVG\/exif\/exif_IO_EasyExif.hpp\"\n\n#include \"third_party\/stlplus3\/filesystemSimplified\/file_system.hpp\"\n\n#include <fstream>\n#include <vector>\n\nnamespace openMVG {\nnamespace sfm {\n\nusing namespace openMVG::cameras;\nusing namespace openMVG::exif;\n\nstatic bool read_openMVG_Camera(const std::string & camName, Pinhole_Intrinsic & cam, geometry::Pose3 & pose)\n{\n  std::vector<double> val;\n  if (stlplus::extension_part(camName) == \"bin\")\n  {\n    std::ifstream in(camName.c_str(), std::ios::in|std::ios::binary);\n    if (!in.is_open())\n    {\n      std::cerr << \"Error: failed to open file '\" << camName << \"' for reading\" << std::endl;\n      return false;\n    }\n    val.resize(12);\n    in.read((char*)&val[0],(std::streamsize)12*sizeof(double));\n    if (in.fail())\n    {\n      val.clear();\n      return false;\n    }\n  }\n  else\n  {\n    std::ifstream ifs;\n    ifs.open( camName.c_str(), std::ifstream::in);\n    if (!ifs.is_open()) {\n      std::cerr << \"Error: failed to open file '\" << camName << \"' for reading\" << std::endl;\n      return false;\n    }\n    while (ifs.good())\n    {\n      double valT;\n      ifs >> valT;\n      if (!ifs.fail())\n        val.push_back(valT);\n    }\n  }\n\n  \/\/Update the camera from file value\n  Mat34 P;\n  if (stlplus::extension_part(camName) == \"bin\")\n  {\n    P << val[0], val[3], val[6], val[9],\n      val[1], val[4], val[7], val[10],\n      val[2], val[5], val[8], val[11];\n  }\n  else\n  {\n    P << val[0], val[1], val[2], val[3],\n      val[4], val[5], val[6], val[7],\n      val[8], val[9], val[10], val[11];\n  }\n  Mat3 K, R;\n  Vec3 t;\n  KRt_From_P(P, &K, &R, &t);\n  cam = Pinhole_Intrinsic(0,0,K);\n  \/\/ K.transpose() is applied to give [R t] to the constructor instead of P = K [R t]\n  pose = geometry::Pose3(K.transpose() * P);\n  return true;\n}\n\nstatic bool read_Strecha_Camera(const std::string & camName, Pinhole_Intrinsic & cam, geometry::Pose3 & pose)\n{\n  std::ifstream ifs;\n  ifs.open( camName.c_str(), std::ifstream::in);\n  if (!ifs.is_open()) {\n    std::cerr << \"Error: failed to open file '\" << camName << \"' for reading\" << std::endl;\n    return false;\n  }\n  std::vector<double> val;\n  while (ifs.good() && !ifs.eof())\n  {\n    double valT;\n    ifs >> valT;\n    if (!ifs.fail())\n      val.push_back(valT);\n  }\n\n  if (val.size() == 3*3 +3 +3*3 +3 + 3 || val.size() == 26) \/\/Strecha cam\n  {\n    Mat3 K, R;\n    K << val[0], val[1], val[2],\n      val[3], val[4], val[5],\n      val[6], val[7], val[8];\n    R << val[12], val[13], val[14],\n      val[15], val[16], val[17],\n      val[18], val[19], val[20];\n\n    Vec3 C (val[21], val[22], val[23]);\n    \/\/ R need to be transposed\n    cam = Pinhole_Intrinsic(0,0,K);\n    cam.setWidth(val[24]);\n    cam.setHeight(val[25]);\n    pose = geometry::Pose3(R.transpose(), C);\n  }\n  else\n  {\n    return false;\n  }\n  return true;\n}\n\n\/**\n@brief Reads a set of Pinhole Cameras and its poses from a ground truth dataset.\n@param[in] sGTPath, the directory where the camera files are located.\n@param[out] sfm_data, the SfM_Data structure to put views\/poses\/intrinsics in.\n**\/\nbool readGt(\n  std::string sGTPath,\n  SfM_Data & sfm_data\n  )\n{\n  \/\/ IF GT_Folder exists, perform evaluation of the quality of rotation estimates\n  if (!stlplus::is_folder(sGTPath)) {\n    std::cout << std::endl << \"There is not valid GT data to read from \" << sGTPath << std::endl;\n    return false;\n  }\n\n  \/\/ Switch between case to choose the file reader according to the file types in GT path\n  bool (*fcnReadCamPtr)(const std::string &, Pinhole_Intrinsic &, geometry::Pose3&);\n  std::string suffix;\n  if (!stlplus::folder_wildcard(sGTPath, \"*.bin\", false, true).empty())\n  {\n    std::cout << \"\\nusing openMVG Camera\";\n    fcnReadCamPtr = &read_openMVG_Camera;\n    suffix = \"bin\";\n  }\n  else if (!stlplus::folder_wildcard(sGTPath, \"*.png.camera\", false, true).empty())\n  {\n    std::cout << \"\\nusing Strechas Camera (png)\";\n    fcnReadCamPtr = &read_Strecha_Camera;\n    suffix = \"png.camera\";\n  }\n  else if (!stlplus::folder_wildcard(sGTPath, \"*.jpg.camera\", false, true).empty())\n  {\n    std::cout << \"\\nusing Strechas Camera (jpg)\";\n    fcnReadCamPtr = &read_Strecha_Camera;\n    suffix = \"jpg.camera\";\n  }\n  else if (!stlplus::folder_wildcard(sGTPath, \"*.PNG.camera\", false, true).empty())\n  {\n    std::cout << \"\\nusing Strechas Camera (PNG)\";\n    fcnReadCamPtr = &read_Strecha_Camera;\n    suffix = \"PNG.camera\";\n  }\n  else if (!stlplus::folder_wildcard(sGTPath, \"*.JPG.camera\", false, true).empty())\n  {\n    std::cout << \"\\nusing Strechas Camera (JPG)\";\n    fcnReadCamPtr = &read_Strecha_Camera;\n    suffix = \"jpg.camera\";\n  }\n  else\n  {\n    std::cerr << \"Unsupported camera type. Please write your camera reader.\" << std::endl;\n    return EXIT_FAILURE;\n  }\n\n  std::cout << std::endl << \"Read rotation and translation estimates\" << std::endl;\n  std::string sImgPath = stlplus::folder_down(stlplus::folder_up(sGTPath), \"images\");\n  std::map< std::string, Mat3 > map_R_gt;\n  \/\/Try to read .suffix camera (parse camera names)\n  std::vector<std::string> vec_camfilenames =\n    stlplus::folder_wildcard(sGTPath, \"*.\"+suffix, false, true);\n  std::sort(vec_camfilenames.begin(), vec_camfilenames.end());\n  if (!vec_camfilenames.empty())\n  {\n    IndexT id = 0;\n    for (std::vector<std::string>::const_iterator iter = vec_camfilenames.begin();\n      iter != vec_camfilenames.end(); ++iter, ++id)\n    {\n      geometry::Pose3 pose;\n      std::shared_ptr<Pinhole_Intrinsic> pinholeIntrinsic = std::make_shared<Pinhole_Intrinsic>();\n      bool loaded = fcnReadCamPtr(stlplus::create_filespec(sGTPath, *iter), *pinholeIntrinsic.get(), pose);\n      if (!loaded)\n      {\n        std::cout << \"Failed to load: \" << *iter << std::endl;\n        return false;\n      }\n\n      std::string sImgName = stlplus::basename_part(*iter);\n      std::string sImgFile = stlplus::create_filespec(sImgPath, sImgName);\n\n      \/\/ Generate UID\n      Exif_IO_EasyExif exifReader;\n      std::cout << \"open \" << exifReader.open( sImgFile ) << std::endl;\n      size_t uid = computeUID(exifReader, sImgName);\n      std::cout << uid << \" \" << (IndexT) uid << \" \" << stlplus::basename_part(*iter) << std::endl;\n\n      \/\/ Update intrinsics with width and height of image\n      sfm_data.views.emplace((IndexT)uid, std::make_shared<View>(stlplus::basename_part(*iter), (IndexT)uid, id, id, pinholeIntrinsic->w(), pinholeIntrinsic->h()));\n      sfm_data.poses.emplace(id, pose);\n      sfm_data.intrinsics.emplace(id, pinholeIntrinsic);\n    }\n  }\n  return true;\n}\n\n} \/\/ namespace sfm\n} \/\/ namespace openMVG\n\n#endif \/\/ OPENMVG_SFM_DATA_IO_GT_HPP<commit_msg>add some const and remove debug log #157<commit_after>\n\/\/ Copyright (c) 2012, 2013, 2014 Pierre MOULON.\n\n\/\/ This Source Code Form is subject to the terms of the Mozilla Public\n\/\/ License, v. 2.0. If a copy of the MPL was not distributed with this\n\/\/ file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#ifndef OPENMVG_SFM_DATA_IO_GT_HPP\n#define OPENMVG_SFM_DATA_IO_GT_HPP\n\n#include \"sfm_data_io.hpp\"\n\n#include \"openMVG\/geometry\/pose3.hpp\"\n#include \"openMVG\/exif\/exif_IO_EasyExif.hpp\"\n\n#include \"third_party\/stlplus3\/filesystemSimplified\/file_system.hpp\"\n\n#include <fstream>\n#include <vector>\n\nnamespace openMVG {\nnamespace sfm {\n\nusing namespace openMVG::cameras;\nusing namespace openMVG::exif;\n\nstatic bool read_openMVG_Camera(const std::string & camName, Pinhole_Intrinsic & cam, geometry::Pose3 & pose)\n{\n  std::vector<double> val;\n  if (stlplus::extension_part(camName) == \"bin\")\n  {\n    std::ifstream in(camName.c_str(), std::ios::in|std::ios::binary);\n    if (!in.is_open())\n    {\n      std::cerr << \"Error: failed to open file '\" << camName << \"' for reading\" << std::endl;\n      return false;\n    }\n    val.resize(12);\n    in.read((char*)&val[0],(std::streamsize)12*sizeof(double));\n    if (in.fail())\n    {\n      val.clear();\n      return false;\n    }\n  }\n  else\n  {\n    std::ifstream ifs;\n    ifs.open( camName.c_str(), std::ifstream::in);\n    if (!ifs.is_open()) {\n      std::cerr << \"Error: failed to open file '\" << camName << \"' for reading\" << std::endl;\n      return false;\n    }\n    while (ifs.good())\n    {\n      double valT;\n      ifs >> valT;\n      if (!ifs.fail())\n        val.push_back(valT);\n    }\n  }\n\n  \/\/Update the camera from file value\n  Mat34 P;\n  if (stlplus::extension_part(camName) == \"bin\")\n  {\n    P << val[0], val[3], val[6], val[9],\n      val[1], val[4], val[7], val[10],\n      val[2], val[5], val[8], val[11];\n  }\n  else\n  {\n    P << val[0], val[1], val[2], val[3],\n      val[4], val[5], val[6], val[7],\n      val[8], val[9], val[10], val[11];\n  }\n  Mat3 K, R;\n  Vec3 t;\n  KRt_From_P(P, &K, &R, &t);\n  cam = Pinhole_Intrinsic(0,0,K);\n  \/\/ K.transpose() is applied to give [R t] to the constructor instead of P = K [R t]\n  pose = geometry::Pose3(K.transpose() * P);\n  return true;\n}\n\nstatic bool read_Strecha_Camera(const std::string & camName, Pinhole_Intrinsic & cam, geometry::Pose3 & pose)\n{\n  std::ifstream ifs;\n  ifs.open( camName.c_str(), std::ifstream::in);\n  if (!ifs.is_open()) {\n    std::cerr << \"Error: failed to open file '\" << camName << \"' for reading\" << std::endl;\n    return false;\n  }\n  std::vector<double> val;\n  while (ifs.good() && !ifs.eof())\n  {\n    double valT;\n    ifs >> valT;\n    if (!ifs.fail())\n      val.push_back(valT);\n  }\n\n  if (val.size() == 3*3 +3 +3*3 +3 + 3 || val.size() == 26) \/\/Strecha cam\n  {\n    Mat3 K, R;\n    K << val[0], val[1], val[2],\n      val[3], val[4], val[5],\n      val[6], val[7], val[8];\n    R << val[12], val[13], val[14],\n      val[15], val[16], val[17],\n      val[18], val[19], val[20];\n\n    Vec3 C (val[21], val[22], val[23]);\n    \/\/ R need to be transposed\n    cam = Pinhole_Intrinsic(0,0,K);\n    cam.setWidth(val[24]);\n    cam.setHeight(val[25]);\n    pose = geometry::Pose3(R.transpose(), C);\n  }\n  else\n  {\n    return false;\n  }\n  return true;\n}\n\n\/**\n@brief Reads a set of Pinhole Cameras and its poses from a ground truth dataset.\n@param[in] sGTPath, the directory where the camera files are located.\n@param[out] sfm_data, the SfM_Data structure to put views\/poses\/intrinsics in.\n**\/\nbool readGt(\n  std::string sGTPath,\n  SfM_Data & sfm_data\n  )\n{\n  \/\/ IF GT_Folder exists, perform evaluation of the quality of rotation estimates\n  if (!stlplus::is_folder(sGTPath)) {\n    std::cout << std::endl << \"There is not valid GT data to read from \" << sGTPath << std::endl;\n    return false;\n  }\n\n  \/\/ Switch between case to choose the file reader according to the file types in GT path\n  bool (*fcnReadCamPtr)(const std::string &, Pinhole_Intrinsic &, geometry::Pose3&);\n  std::string suffix;\n  if (!stlplus::folder_wildcard(sGTPath, \"*.bin\", false, true).empty())\n  {\n    std::cout << \"\\nusing openMVG Camera\";\n    fcnReadCamPtr = &read_openMVG_Camera;\n    suffix = \"bin\";\n  }\n  else if (!stlplus::folder_wildcard(sGTPath, \"*.png.camera\", false, true).empty())\n  {\n    std::cout << \"\\nusing Strechas Camera (png)\";\n    fcnReadCamPtr = &read_Strecha_Camera;\n    suffix = \"png.camera\";\n  }\n  else if (!stlplus::folder_wildcard(sGTPath, \"*.jpg.camera\", false, true).empty())\n  {\n    std::cout << \"\\nusing Strechas Camera (jpg)\";\n    fcnReadCamPtr = &read_Strecha_Camera;\n    suffix = \"jpg.camera\";\n  }\n  else if (!stlplus::folder_wildcard(sGTPath, \"*.PNG.camera\", false, true).empty())\n  {\n    std::cout << \"\\nusing Strechas Camera (PNG)\";\n    fcnReadCamPtr = &read_Strecha_Camera;\n    suffix = \"PNG.camera\";\n  }\n  else if (!stlplus::folder_wildcard(sGTPath, \"*.JPG.camera\", false, true).empty())\n  {\n    std::cout << \"\\nusing Strechas Camera (JPG)\";\n    fcnReadCamPtr = &read_Strecha_Camera;\n    suffix = \"jpg.camera\";\n  }\n  else\n  {\n    std::cerr << \"Unsupported camera type. Please write your camera reader.\" << std::endl;\n    return EXIT_FAILURE;\n  }\n\n  std::cout << std::endl << \"Read rotation and translation estimates\" << std::endl;\n  const std::string sImgPath = stlplus::folder_down(stlplus::folder_up(sGTPath), \"images\");\n  std::map< std::string, Mat3 > map_R_gt;\n  \/\/Try to read .suffix camera (parse camera names)\n  std::vector<std::string> vec_camfilenames =\n    stlplus::folder_wildcard(sGTPath, \"*.\"+suffix, false, true);\n  std::sort(vec_camfilenames.begin(), vec_camfilenames.end());\n  if (!vec_camfilenames.empty())\n  {\n    IndexT id = 0;\n    for (std::vector<std::string>::const_iterator iter = vec_camfilenames.begin();\n      iter != vec_camfilenames.end(); ++iter, ++id)\n    {\n      geometry::Pose3 pose;\n      std::shared_ptr<Pinhole_Intrinsic> pinholeIntrinsic = std::make_shared<Pinhole_Intrinsic>();\n      bool loaded = fcnReadCamPtr(stlplus::create_filespec(sGTPath, *iter), *pinholeIntrinsic.get(), pose);\n      if (!loaded)\n      {\n        std::cout << \"Failed to load: \" << *iter << std::endl;\n        return false;\n      }\n\n      const std::string sImgName = stlplus::basename_part(*iter);\n      const std::string sImgFile = stlplus::create_filespec(sImgPath, sImgName);\n\n      \/\/ Generate UID\n      Exif_IO_EasyExif exifReader;\n      const size_t uid = computeUID(exifReader, sImgName);\n\n      \/\/ Update intrinsics with width and height of image\n      sfm_data.views.emplace((IndexT)uid, std::make_shared<View>(stlplus::basename_part(*iter), (IndexT)uid, id, id, pinholeIntrinsic->w(), pinholeIntrinsic->h()));\n      sfm_data.poses.emplace(id, pose);\n      sfm_data.intrinsics.emplace(id, pinholeIntrinsic);\n    }\n  }\n  return true;\n}\n\n} \/\/ namespace sfm\n} \/\/ namespace openMVG\n\n#endif \/\/ OPENMVG_SFM_DATA_IO_GT_HPP<|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#include <atomic>\n#include <memory>\n\n#include <errno.h>\n#include <fcntl.h>\n#include <unistd.h>\n#include <android\/log.h>\n#include <android\/looper.h>\n\n#define LOGE(...) do { \\\n    fprintf(stderr, __VA_ARGS__); \\\n    __android_log_print(ANDROID_LOG_ERROR, \"REALM\", __VA_ARGS__); \\\n} while (0)\n\nnamespace realm {\nnamespace util {\ntemplate<typename Callback>\nclass EventLoopSignal : public std::enable_shared_from_this<EventLoopSignal<Callback>> {\npublic:\n    EventLoopSignal(Callback&& callback)\n    : m_callback(std::move(callback))\n    {\n        ALooper* looper = ALooper_forThread();\n        if (!looper) {\n            return;\n        }\n\n        int message_pipe[2];\n        \/\/ pipe2 became part of bionic from API 9. But there are some devices with API > 10 that still have problems.\n        \/\/ See https:\/\/github.com\/realm\/realm-java\/issues\/3945 .\n        if (pipe(message_pipe)) {\n            int err = errno;\n            LOGE(\"could not create WeakRealmNotifier ALooper message pipe: %s.\", strerror(err));\n            return;\n        }\n        if (fcntl(message_pipe[0], F_SETFL, O_NONBLOCK) == -1 || fcntl(message_pipe[1], F_SETFL, O_NONBLOCK) == -1) {\n            int err = errno;\n            LOGE(\"could not set ALooper message pipe non-blocking: %s.\", strerror(err));\n            \/\/ It still works in blocking mode.\n        }\n\n        if (ALooper_addFd(looper, message_pipe[0], 3 \/* LOOPER_ID_USER *\/,\n                          ALOOPER_EVENT_INPUT | ALOOPER_EVENT_HANGUP,\n                          &looper_callback, nullptr) != 1) {\n            LOGE(\"Error adding WeakRealmNotifier callback to looper.\");\n            ::close(message_pipe[0]);\n            ::close(message_pipe[1]);\n\n            return;\n        }\n\n        m_message_pipe.read = message_pipe[0];\n        m_message_pipe.write = message_pipe[1];\n        m_thread_has_looper = true;\n    }\n\n    ~EventLoopSignal()\n    {\n        bool flag = true;\n        if (m_thread_has_looper.compare_exchange_strong(flag, false)) {\n            \/\/ closing one end of the pipe here will trigger ALOOPER_EVENT_HANGUP\n            \/\/in the callback which will do the rest of the cleanup\n            ::close(m_message_pipe.write);\n        }\n    }\n\n    EventLoopSignal(EventLoopSignal&&) = delete;\n    EventLoopSignal& operator=(EventLoopSignal&&) = delete;\n    EventLoopSignal(EventLoopSignal const&) = delete;\n    EventLoopSignal& operator=(EventLoopSignal const&) = delete;\n\n    void notify()\n    {\n        if (m_thread_has_looper) {\n            \/\/ Pass ourself over the pipe so that we can od work on the target\n            \/\/ thread. This requires forming a new shared_ptr to ensure we\n            \/\/ continue to exist until then.\n            auto ptr = new std::shared_ptr<EventLoopSignal>(this->shared_from_this());\n            if (write(m_message_pipe.write, &ptr, sizeof(ptr)) != sizeof(ptr)) {\n                delete ptr;\n                LOGE(\"Buffer overrun when writing to WeakRealmNotifier's ALooper message pipe.\");\n            }\n        }\n    }\n\nprivate:\n    Callback m_callback;\n    std::atomic<bool> m_thread_has_looper{false};\n\n    \/\/ pipe file descriptor pair we use to signal ALooper\n    struct {\n      int read = -1;\n      int write = -1;\n    } m_message_pipe;\n\n    static int looper_callback(int fd, int events, void*)\n    {\n        if ((events & ALOOPER_EVENT_INPUT) != 0) {\n            std::shared_ptr<EventLoopSignal>* ptr = nullptr;\n            while (read(fd, &ptr, sizeof(ptr)) == sizeof(ptr)) {\n                (*ptr)->m_callback();\n                delete ptr;\n            }\n        }\n\n        if ((events & ALOOPER_EVENT_HANGUP) != 0) {\n            \/\/ this callback is always invoked on the looper thread so it's fine to get the looper like this\n            ALooper_removeFd(ALooper_forThread(), fd);\n            ::close(fd);\n        }\n\n        if ((events & ALOOPER_EVENT_ERROR) != 0) {\n            LOGE(\"Unexpected error on WeakRealmNotifier's ALooper message pipe.\");\n        }\n\n        \/\/ return 1 to continue receiving events\n        return 1;\n    }\n};\n} \/\/ namespace util\n} \/\/ namespace realm\n<commit_msg>Fix resource leaking in the android event loop (#331)<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#include <algorithm>\n#include <memory>\n#include <mutex>\n#include <shared_mutex>\n#include <vector>\n\n#include <errno.h>\n#include <fcntl.h>\n#include <unistd.h>\n#include <android\/log.h>\n#include <android\/looper.h>\n\n#define LOGE(...) do { \\\n    fprintf(stderr, __VA_ARGS__); \\\n    __android_log_print(ANDROID_LOG_ERROR, \"REALM\", __VA_ARGS__); \\\n} while (0)\n\nnamespace realm {\nnamespace util {\ntemplate<typename Callback>\nclass EventLoopSignal : public std::enable_shared_from_this<EventLoopSignal<Callback>> {\npublic:\n    EventLoopSignal(Callback&& callback)\n    : m_callback(std::move(callback)), m_looper(ALooper_forThread()) {\n        if (!m_looper) {\n            return;\n        }\n        ALooper_acquire(m_looper);\n        \/\/ Delay the alooper initialization to the first time notify called.\n    }\n\n    ~EventLoopSignal()\n    {\n        if (!m_looper) {\n            return;\n        }\n\n        if (inited) {\n            ALooper_removeFd(m_looper, m_message_pipe.read);\n            ::close(m_message_pipe.write);\n            ::close(m_message_pipe.read);\n            {\n                std::unique_lock<std::shared_timed_mutex> lock(s_mutex);\n                s_weak_ptrs.erase(std::remove(s_weak_ptrs.begin(), s_weak_ptrs.end(), &m_weak), s_weak_ptrs.end());\n            }\n        }\n        ALooper_release(m_looper);\n    }\n\n    EventLoopSignal(EventLoopSignal&&) = delete;\n    EventLoopSignal& operator=(EventLoopSignal&&) = delete;\n    EventLoopSignal(EventLoopSignal const&) = delete;\n    EventLoopSignal& operator=(EventLoopSignal const&) = delete;\n\n    void notify()\n    {\n        if (m_looper) {\n            init();\n            notify_fd(m_message_pipe.write);\n        }\n    }\n\nprivate:\n    Callback m_callback;\n    \/\/ Acquire a ref to looper since we may init\/destroy in a different thread.\n    ALooper* m_looper;\n    \/\/ weak_ptr points to this.\n    std::weak_ptr<EventLoopSignal> m_weak;\n    \/\/ Flag to avoid checking the weak_ptr.\n    bool inited = false;\n\n    \/\/ We cannot unregister in the looper callback since it may not be called at all (eg. IntentService).\n    \/\/ And we have to ensure the looper callback has a valid this pointer to use.\n    \/\/ To achieve that, a list is used to maintain every weak_ptr to this object, and check if the data in the\n    \/\/ callback param is in the list.\n    static std::vector<std::weak_ptr<EventLoopSignal>*> s_weak_ptrs;\n    static std::shared_timed_mutex s_mutex; \/\/ shared_mutex is available from C++ 17\n\n    \/\/ pipe file descriptor pair we use to signal ALooper\n    struct {\n      int read = -1;\n      int write = -1;\n    } m_message_pipe;\n\n    \/\/ We need to delay the init to the first time notify since we cannot get the weak_ptr in the contructor.\n    inline void init()\n    {\n        if (inited) {\n            return;\n        }\n        inited = true;\n\n        m_weak = this->shared_from_this();\n        {\n            std::unique_lock<std::shared_timed_mutex> lock(s_mutex);\n            s_weak_ptrs.push_back(&m_weak);\n        }\n\n        int message_pipe[2];\n        \/\/ pipe2 became part of bionic from API 9. But there are some devices with API > 10 that still have problems.\n        \/\/ See https:\/\/github.com\/realm\/realm-java\/issues\/3945 .\n        if (pipe(message_pipe)) {\n            int err = errno;\n            LOGE(\"could not create WeakRealmNotifier ALooper message pipe: %s.\", strerror(err));\n            return;\n        }\n        if (fcntl(message_pipe[0], F_SETFL, O_NONBLOCK) == -1 || fcntl(message_pipe[1], F_SETFL, O_NONBLOCK) == -1) {\n            int err = errno;\n            LOGE(\"could not set ALooper message pipe non-blocking: %s.\", strerror(err));\n            \/\/ It still works in blocking mode.\n        }\n\n        if (ALooper_addFd(m_looper, message_pipe[0], ALOOPER_POLL_CALLBACK,\n                          ALOOPER_EVENT_INPUT,\n                          &looper_callback, &m_weak) != 1) {\n            LOGE(\"Error adding WeakRealmNotifier callback to looper.\");\n            ::close(message_pipe[0]);\n            ::close(message_pipe[1]);\n\n            return;\n        }\n\n        m_message_pipe.read = message_pipe[0];\n        m_message_pipe.write = message_pipe[1];\n    }\n\n    static int looper_callback(int, int events, void* data)\n    {\n        if ((events & ALOOPER_EVENT_INPUT) != 0) {\n            std::shared_ptr<EventLoopSignal> shared;\n            {\n                std::shared_lock<std::shared_timed_mutex> lock(s_mutex);\n                auto weak = static_cast<std::weak_ptr<EventLoopSignal>*>(data);\n                if (std::find(s_weak_ptrs.begin(), s_weak_ptrs.end(), weak) != s_weak_ptrs.end()) {\n                    \/\/ Even if the weak_ptr can be found in the list, the object still can be destroyed in between.\n                    \/\/ But share_ptr can ensure we either have a valid pointer or the object has gone.\n                    shared = weak->lock();\n                }\n            }\n            if (shared) {\n                \/\/ By holding a shared_ptr, this object won't be destroyed in the m_callback.\n                shared->m_callback();\n            }\n        }\n\n        if ((events & ALOOPER_EVENT_ERROR) != 0) {\n            LOGE(\"Unexpected error on WeakRealmNotifier's ALooper message pipe.\");\n        }\n\n        \/\/ return 1 to continue receiving events\n        return 1;\n    }\n\n    \/\/ Write a byte to a pipe to notify anyone waiting for data on the pipe\n    static void notify_fd(int fd)\n    {\n        while (true) {\n            char c = 0;\n            ssize_t ret = write(fd, &c, 1);\n            if (ret == 1) {\n                break;\n            }\n\n            \/\/ If the pipe's buffer is full, we need to read some of the old data in\n            \/\/ it to make space. We don't just read in the code waiting for\n            \/\/ notifications so that we can notify multiple waiters with a single\n            \/\/ write.\n            if (ret != 0) {\n                int err = errno;\n                if (err != EAGAIN) {\n                    throw std::system_error(err, std::system_category());\n                }\n            }\n            std::vector<uint8_t> buff(1024);\n            read(fd, buff.data(), buff.size());\n        }\n    }\n};\n\ntemplate<typename Callback>\nstd::vector<std::weak_ptr<EventLoopSignal<Callback>>*> EventLoopSignal<Callback>::s_weak_ptrs;\ntemplate<typename Callback>\nstd::shared_timed_mutex EventLoopSignal<Callback>::s_mutex;\n\n} \/\/ namespace util\n} \/\/ namespace realm\n<|endoftext|>"}
{"text":"<commit_before>\/*\n    fastsim.cpp  -  Don Cross  -  1 July 2016.\n    \n    A simulation of mutually repulsive particles trapped on the surface of a sphere.\n    This is also known as the Thompson Problem.\n    See:  https:\/\/en.wikipedia.org\/wiki\/Thomson_problem\n*\/\n\n#include <iostream>\n#include <iomanip>\n#include <fstream>\n#include <vector>\n#include <cstdint>\n#include <cmath>\n#include <cstring>\n\nnamespace Electrons\n{\n    \/\/ Vector ---------------------------------------------------------------\n\n    struct Vector\n    {\n        double  x;\n        double  y;\n        double  z;\n        \n        Vector(): x(0), y(0), z(0) {}\n        Vector(double _x, double _y, double _z): x(_x), y(_y), z(_z) {}\n        \n        void Reset()\n        {\n            x = 0;\n            y = 0;\n            z = 0;\n        }\n        \n        double MagSquared() const \n        {\n            return (x*x) + (y*y) + (z*z);\n        }\n        \n        double Mag() const\n        {\n            return sqrt(MagSquared());\n        }\n        \n        Vector UnitVector() const\n        {\n            double r = Mag();\n            if (r < 1.0e-9)\n            {\n                throw \"Cannot find unit vector for near-zero magnitude vector.\";\n            }\n            return Vector(x\/r, y\/r, z\/r);\n        }\n        \n        Vector& operator += (const Vector& other)\n        {\n            x += other.x;\n            y += other.y;\n            z += other.z;\n            return *this;\n        }\n        \n        Vector& operator -= (const Vector& other)\n        {\n            x -= other.x;\n            y -= other.y;\n            z -= other.z;\n            return *this;\n        }\n        \n        static double Dot(const Vector& a, const Vector& b)\n        {\n            return (a.x*b.x) + (a.y*b.y) + (a.z*b.z);\n        }\n    };\n    \n    typedef std::vector<Vector> VectorList;\n    \n    inline Vector operator + (const Vector& a, const Vector& b)\n    {\n        return Vector(a.x + b.x, a.y + b.y, a.z + b.z);\n    }\n    \n    inline Vector operator - (const Vector& a, const Vector& b)\n    {\n        return Vector(a.x - b.x, a.y - b.y, a.z - b.z);\n    }\n    \n    inline Vector operator * (double s, const Vector& v)\n    {\n        return Vector(s*v.x, s*v.y, s*v.z);\n    }\n    \n    \/\/ Particle ---------------------------------------------------------------\n    \n    struct Particle\n    {\n        Vector position;\n        Vector force;\n        \n        Particle(): position(), force() {}\n        Particle(const Vector& _position): position(_position), force() {}\n        Particle(const Vector& _position, const Vector& _force): position(_position), force(_force) {}\n    };\n    \n    typedef std::vector<Particle> ParticleList;\n\n    \/\/ JSON output ------------------------------------------------------------\n    \n    void Print(std::ostream& output, double t)\n    {\n        using namespace std;\n        output << setprecision(14) << fixed;\n        if (t >= 0.0) output << \" \";\n        output << t;\n    }\n    \n    void JsonIndent(std::ostream& output, int indent)\n    {\n        int spaces = 4*indent;\n        for (int i=0; i < spaces; ++i)\n        {\n            output << \" \";\n        }\n    }\n    \n    void JsonPrint(std::ostream& output, const Vector& v)\n    {\n        output << \"{\\\"x\\\":\"; \n        Print(output, v.x); \n        output << \", \\\"y\\\":\"; \n        Print(output, v.y);\n        output << \", \\\"z\\\":\";\n        Print(output, v.z);\n        output << \"}\";\n    }\n    \n    void JsonPrint(std::ostream& output, const Particle& p)\n    {\n        output << \"{\\\"position\\\":\";\n        JsonPrint(output, p.position);\n        output << \", \\\"force\\\":\";\n        JsonPrint(output, p.force);\n        output << \"}\";\n    }\n    \n    void JsonPrint(std::ostream& output, const VectorList& list, int indent)\n    {\n        using namespace std;\n        JsonIndent(output, indent);\n        output << \"[\\n\";\n        bool first = true;\n        for (const Vector& v : list) \n        {\n            JsonIndent(output, indent);\n            output << (first ? \"    \" : \",   \");\n            JsonPrint(output, v);\n            output << \"\\n\";\n            first = false;\n        }\n        JsonIndent(output, indent);\n        output << \"]\\n\";\n    }\n    \n    \/\/ Random generators ------------------------------------------------------------\n    \n    double Random(std::ifstream& infile)\n    {\n        using namespace std;\n        \n        uint64_t data;\n        infile.read((char *)&data, sizeof(data));\n        if (!infile) throw \"Read failure generating random number.\";\n        \n        \/\/ Convert the 64-bit integer to double-precision floating point.\n        \/\/ Divide by maximum possible value to get a number in the closed range [0, +1].\n        double x = static_cast<double>(data) \/ static_cast<double>(UINT64_MAX);\n        \n        \/\/ Convert to the closed range [-1, +1].        \n        return 1.0 - (2.0 * x);\n    }\n\n    Vector RandomSpherePoint(std::ifstream& infile)\n    {    \n        \/\/ Algorithm for picking a random point on a sphere.\n        \/\/ Avoids any clustering of points.\n        \/\/ See equations (9), (10), (11) in:\n        \/\/ http:\/\/mathworld.wolfram.com\/SpherePointPicking.html\n        while (true)\n        {\n            double a = Random(infile);\n            double b = Random(infile);\n            double mag = (a*a) + (b*b);\n            if (mag < 1.0)\n            {\n                double root = 2.0 * sqrt(1.0 - mag);\n                return Vector(a*root, b*root, 1.0 - (2.0*mag));\n            }\n        }\n    }\n\n    \/\/ Simulation ---------------------------------------------------------------\n\n    class Simulation\n    {\n    private:\n        ParticleList particles;\n        int frame;        \n    \n    public:\n        Simulation(int numPoints)       \/\/ create an initial random state\n            : frame(0)\n        {\n            using namespace std;\n            \n            if (numPoints < 0) throw \"Number of points not allowed to be negative.\";        \n            ifstream infile(\"\/dev\/urandom\", ios::in | ios::binary);\n            if (!infile) throw \"Could not open \/dev\/urandom to obtain random numbers.\";\n            particles.reserve(static_cast<ParticleList::size_type>(numPoints));\n            for (int i=0; i < numPoints; ++i)\n            {\n                particles.push_back(Particle(RandomSpherePoint(infile)));\n            }\n        }\n        \n        int ParticleCount() const\n        {\n            return static_cast<int>(particles.size());\n        }\n        \n        int FrameNumber() const\n        {\n            return frame;\n        }\n        \n        void JsonPrint(std::ostream& output, int indent) const\n        {\n            using namespace std;\n            \n            JsonIndent(output, indent);\n            output << \"{\\\"frame\\\": \" << frame << \", \\\"particles\\\": [\\n\";\n            bool first = true;\n            for (const Particle& p : particles) \n            {\n                JsonIndent(output, indent);\n                output << (first ? \"    \" : \",   \");\n                Electrons::JsonPrint(output, p);\n                output << \"\\n\";\n                first = false;\n            }\n            JsonIndent(output, indent);\n            output << \"]}\\n\";\n        }\n        \n        double Update(double dt)\n        {\n            ++frame;\n        \n            \/\/ Reset each particle's force to a zero vector.\n            for (Particle& p : particles)\n            {\n                p.force.Reset();\n            }\n            \n            \/\/ Compute force between each unique pair of particles.\n            const ParticleList::size_type numParticles = particles.size();\n            for (ParticleList::size_type i=0; i < numParticles-1; ++i)\n            {\n                for (ParticleList::size_type j=i+1; j < numParticles; ++j)\n                {\n                    AddForces(particles[i], particles[j]);\n                }\n            }\n            \n            \/\/ The particles can only move along the surface of the sphere,\n            \/\/ so eliminate the radial component of all forces, \n            \/\/ leaving tangential forces.\n            double maxForceMag = 0;\n            for (Particle& p : particles)\n            {\n                \/\/ Calculate radial component using dot product and subtract\n                \/\/ to get tangential component.\n                p.force -= Vector::Dot(p.force, p.position) * p.position;\n                double forceMag = p.force.Mag();\n                if (forceMag > maxForceMag)\n                {\n                    maxForceMag = forceMag;\n                }\n                p.position = ((dt * p.force) + p.position).UnitVector();\n            }\n            \n            return maxForceMag;\n        }\n        \n        bool Converge(double dt, int maxFrames)\n        {\n            const double forceTolerance = 1.0e-10;\n            double force = 1;\n            while (force > forceTolerance)\n            {\n                force = Update(dt);                \n                \/\/std::cout << \"i=\" << i << \", F=\" << force << \", dt=\" << dt << std::endl;\n                if (frame > maxFrames)\n                {\n                    \/\/ Simulation did not converge within specified number of frames.\n                    return false;\n                }\n            }\n            return true;\n        }\n        \n    private:\n        void static AddForces(Particle& a, Particle& b)\n        {\n            \/\/ Force of electrically charged particles:\n            \/\/ F = k*q1*q2\/r^2.\n            \/\/ We simplify the problem as:  F = 1\/r^2.\n            \/\/ Force is along the direction of the line passing through both.\n            Vector dp = a.position - b.position;\n            double forcemag = 1.0 \/ dp.MagSquared();\n            Vector force = forcemag * dp.UnitVector();\n            a.force += force;\n            b.force -= force;\n        }\n    };\n}\n\n\/\/======================================================================================\n\nclass StandardDeviationCalculator\n{\n    \/\/ https:\/\/en.wikipedia.org\/wiki\/Algorithms_for_calculating_variance#Online_algorithm    \nprivate:\n    int n;\n    double mean;\n    double sum;\n    double max;\n    double min;\n\npublic:\n    StandardDeviationCalculator(): n(0), mean(0.0), sum(0.0), max(0.0), min(0.0) {}\n    \n    int NumData() const\n    {\n        return n;\n    }\n        \n    void Append(double x)\n    {\n        ++n;\n        if (n == 1)\n        {\n            max = min = x;\n        }\n        else\n        {\n            if (x < min) min = x;\n            if (x > max) max = x;\n        }\n        double delta = x - mean;\n        mean += delta\/n;\n        sum += delta*(x - mean);\n    }    \n    \n    bool HasData() const\n    {\n        return n >= 1;\n    }\n    \n    bool CanCalculateVariance() const\n    {\n        return n >= 2;\n    }\n    \n    double Mean() const\n    {\n        if (HasData())\n        {\n            return mean;\n        }\n        throw \"No data to calculate mean\";\n    }\n    \n    double Variance() const\n    {\n        if (CanCalculateVariance())\n        {\n            return sum \/ (n - 1);\n        }\n        throw \"Not enough data to calculate variance\";\n    }\n    \n    double Deviation() const\n    {\n        return sqrt(Variance());\n    }\n    \n    double Minimum() const\n    {\n        if (HasData())\n        {\n            return min;\n        }\n        throw \"No data to calculate minimum\";\n    }\n    \n    double Maximum() const\n    {\n        if (HasData())\n        {\n            return max;\n        }\n        throw \"No data to calculate maximum\";\n    }\n};\n\n\/\/======================================================================================\n\nconst int MaxParticles = 1000;\n    \nvoid PrintUsage()\n{\n    std::cout <<\n        \"\\n\"\n        \"USAGE:\\n\"\n        \"\\n\"\n        \"fastsim fixed N dt\\n\"\n        \"    Run multiple simulations on N particles with time increment dt.\\n\"\n        \"\\n\";\n}\n\n\nint ScanNumParticles(const char *text)\n{\n    int n = atoi(text);\n    if (n<1 || n>MaxParticles)\n    {\n        throw \"Invalid number of particles.\";\n    }\n    return n;\n}\n\n\ndouble ScanTimeIncrement(const char *text)\n{\n    double dt = atof(text);\n    if (dt <= 0.0)\n    {\n        throw \"Time increment must be a positive real number.\";\n    }\n    return dt;\n}\n\nbool TryFixedIncrement(int n, double dt)\n{\n    using namespace std;\n    using namespace Electrons;\n    \n    const int NumTrials = 40;\n    const int MaxFrames = 1000000;\n    cout << setprecision(10) << fixed;\n    StandardDeviationCalculator sd;\n    for (int trial=0; trial < NumTrials; ++trial)\n    {\n        Simulation sim(n);\n        if (sim.Converge(dt, MaxFrames))\n        {\n            cout << \"trial=\" << trial << \", frames=\" << sim.FrameNumber() << endl;\n            sd.Append(static_cast<double>(sim.FrameNumber()));\n        }\n        else\n        {\n            cout << \"trial=\" << trial << \", *** NO CONVERGENCE ***\" << endl;\n            return false;\n        }\n    }\n    \n    cout << endl;\n    cout << setprecision(2);\n    cout << \n        \"frames: count=\" << sd.NumData() <<\n        \", mean=\" << sd.Mean() << \n        \", stdev=\" << sd.Deviation() << \n        \", min=\" << static_cast<int>(sd.Minimum()) <<\n        \", max=\" << static_cast<int>(sd.Maximum()) <<\n        endl;\n    \n    return true;\n}\n\n\/\/======================================================================================\n\nint main(int argc, const char *argv[])\n{\n    using namespace std;\n    using namespace Electrons;\n    try \n    {\n        if (argc > 1)\n        {\n            const char *verb = argv[1];\n            if (!strcmp(verb, \"fixed\") && (argc == 4))\n            {\n                int n = ScanNumParticles(argv[2]);\n                double dt = ScanTimeIncrement(argv[3]);\n                if (TryFixedIncrement(n, dt))\n                {\n                    return 0;\n                }\n                return 1;\n            }\n        }\n    \n        PrintUsage();\n        return 2;\n    }\n    catch (const char *message)\n    {\n        cerr << \"EXCEPTION: \" << message << endl;\n        return 3;\n    }\n}\n\n<commit_msg>Added range command to home in on ideal fixed dt value for a given number of particles.<commit_after>\/*\n    fastsim.cpp  -  Don Cross  -  1 July 2016.\n    \n    A simulation of mutually repulsive particles trapped on the surface of a sphere.\n    This is also known as the Thompson Problem.\n    See:  https:\/\/en.wikipedia.org\/wiki\/Thomson_problem\n*\/\n\n#include <iostream>\n#include <iomanip>\n#include <fstream>\n#include <vector>\n#include <cstdint>\n#include <cmath>\n#include <cstring>\n\nnamespace Electrons\n{\n    \/\/ Vector ---------------------------------------------------------------\n\n    struct Vector\n    {\n        double  x;\n        double  y;\n        double  z;\n        \n        Vector(): x(0), y(0), z(0) {}\n        Vector(double _x, double _y, double _z): x(_x), y(_y), z(_z) {}\n        \n        void Reset()\n        {\n            x = 0;\n            y = 0;\n            z = 0;\n        }\n        \n        double MagSquared() const \n        {\n            return (x*x) + (y*y) + (z*z);\n        }\n        \n        double Mag() const\n        {\n            return sqrt(MagSquared());\n        }\n        \n        Vector UnitVector() const\n        {\n            double r = Mag();\n            if (r < 1.0e-9)\n            {\n                throw \"Cannot find unit vector for near-zero magnitude vector.\";\n            }\n            return Vector(x\/r, y\/r, z\/r);\n        }\n        \n        Vector& operator += (const Vector& other)\n        {\n            x += other.x;\n            y += other.y;\n            z += other.z;\n            return *this;\n        }\n        \n        Vector& operator -= (const Vector& other)\n        {\n            x -= other.x;\n            y -= other.y;\n            z -= other.z;\n            return *this;\n        }\n        \n        static double Dot(const Vector& a, const Vector& b)\n        {\n            return (a.x*b.x) + (a.y*b.y) + (a.z*b.z);\n        }\n    };\n    \n    typedef std::vector<Vector> VectorList;\n    \n    inline Vector operator + (const Vector& a, const Vector& b)\n    {\n        return Vector(a.x + b.x, a.y + b.y, a.z + b.z);\n    }\n    \n    inline Vector operator - (const Vector& a, const Vector& b)\n    {\n        return Vector(a.x - b.x, a.y - b.y, a.z - b.z);\n    }\n    \n    inline Vector operator * (double s, const Vector& v)\n    {\n        return Vector(s*v.x, s*v.y, s*v.z);\n    }\n    \n    \/\/ Particle ---------------------------------------------------------------\n    \n    struct Particle\n    {\n        Vector position;\n        Vector force;\n        \n        Particle(): position(), force() {}\n        Particle(const Vector& _position): position(_position), force() {}\n        Particle(const Vector& _position, const Vector& _force): position(_position), force(_force) {}\n    };\n    \n    typedef std::vector<Particle> ParticleList;\n\n    \/\/ JSON output ------------------------------------------------------------\n    \n    void Print(std::ostream& output, double t)\n    {\n        using namespace std;\n        output << setprecision(14) << fixed;\n        if (t >= 0.0) output << \" \";\n        output << t;\n    }\n    \n    void JsonIndent(std::ostream& output, int indent)\n    {\n        int spaces = 4*indent;\n        for (int i=0; i < spaces; ++i)\n        {\n            output << \" \";\n        }\n    }\n    \n    void JsonPrint(std::ostream& output, const Vector& v)\n    {\n        output << \"{\\\"x\\\":\"; \n        Print(output, v.x); \n        output << \", \\\"y\\\":\"; \n        Print(output, v.y);\n        output << \", \\\"z\\\":\";\n        Print(output, v.z);\n        output << \"}\";\n    }\n    \n    void JsonPrint(std::ostream& output, const Particle& p)\n    {\n        output << \"{\\\"position\\\":\";\n        JsonPrint(output, p.position);\n        output << \", \\\"force\\\":\";\n        JsonPrint(output, p.force);\n        output << \"}\";\n    }\n    \n    void JsonPrint(std::ostream& output, const VectorList& list, int indent)\n    {\n        using namespace std;\n        JsonIndent(output, indent);\n        output << \"[\\n\";\n        bool first = true;\n        for (const Vector& v : list) \n        {\n            JsonIndent(output, indent);\n            output << (first ? \"    \" : \",   \");\n            JsonPrint(output, v);\n            output << \"\\n\";\n            first = false;\n        }\n        JsonIndent(output, indent);\n        output << \"]\\n\";\n    }\n    \n    \/\/ Random generators ------------------------------------------------------------\n    \n    double Random(std::ifstream& infile)\n    {\n        using namespace std;\n        \n        uint64_t data;\n        infile.read((char *)&data, sizeof(data));\n        if (!infile) throw \"Read failure generating random number.\";\n        \n        \/\/ Convert the 64-bit integer to double-precision floating point.\n        \/\/ Divide by maximum possible value to get a number in the closed range [0, +1].\n        double x = static_cast<double>(data) \/ static_cast<double>(UINT64_MAX);\n        \n        \/\/ Convert to the closed range [-1, +1].        \n        return 1.0 - (2.0 * x);\n    }\n\n    Vector RandomSpherePoint(std::ifstream& infile)\n    {    \n        \/\/ Algorithm for picking a random point on a sphere.\n        \/\/ Avoids any clustering of points.\n        \/\/ See equations (9), (10), (11) in:\n        \/\/ http:\/\/mathworld.wolfram.com\/SpherePointPicking.html\n        while (true)\n        {\n            double a = Random(infile);\n            double b = Random(infile);\n            double mag = (a*a) + (b*b);\n            if (mag < 1.0)\n            {\n                double root = 2.0 * sqrt(1.0 - mag);\n                return Vector(a*root, b*root, 1.0 - (2.0*mag));\n            }\n        }\n    }\n\n    \/\/ Simulation ---------------------------------------------------------------\n\n    class Simulation\n    {\n    private:\n        ParticleList particles;\n        int frame;        \n    \n    public:\n        Simulation(int numPoints)       \/\/ create an initial random state\n            : frame(0)\n        {\n            using namespace std;\n            \n            if (numPoints < 0) throw \"Number of points not allowed to be negative.\";        \n            ifstream infile(\"\/dev\/urandom\", ios::in | ios::binary);\n            if (!infile) throw \"Could not open \/dev\/urandom to obtain random numbers.\";\n            particles.reserve(static_cast<ParticleList::size_type>(numPoints));\n            for (int i=0; i < numPoints; ++i)\n            {\n                particles.push_back(Particle(RandomSpherePoint(infile)));\n            }\n        }\n        \n        int ParticleCount() const\n        {\n            return static_cast<int>(particles.size());\n        }\n        \n        int FrameNumber() const\n        {\n            return frame;\n        }\n        \n        void JsonPrint(std::ostream& output, int indent) const\n        {\n            using namespace std;\n            \n            JsonIndent(output, indent);\n            output << \"{\\\"frame\\\": \" << frame << \", \\\"particles\\\": [\\n\";\n            bool first = true;\n            for (const Particle& p : particles) \n            {\n                JsonIndent(output, indent);\n                output << (first ? \"    \" : \",   \");\n                Electrons::JsonPrint(output, p);\n                output << \"\\n\";\n                first = false;\n            }\n            JsonIndent(output, indent);\n            output << \"]}\\n\";\n        }\n        \n        double Update(double dt)\n        {\n            ++frame;\n        \n            \/\/ Reset each particle's force to a zero vector.\n            for (Particle& p : particles)\n            {\n                p.force.Reset();\n            }\n            \n            \/\/ Compute force between each unique pair of particles.\n            const ParticleList::size_type numParticles = particles.size();\n            for (ParticleList::size_type i=0; i < numParticles-1; ++i)\n            {\n                for (ParticleList::size_type j=i+1; j < numParticles; ++j)\n                {\n                    AddForces(particles[i], particles[j]);\n                }\n            }\n            \n            \/\/ The particles can only move along the surface of the sphere,\n            \/\/ so eliminate the radial component of all forces, \n            \/\/ leaving tangential forces.\n            double maxForceMag = 0;\n            for (Particle& p : particles)\n            {\n                \/\/ Calculate radial component using dot product and subtract\n                \/\/ to get tangential component.\n                p.force -= Vector::Dot(p.force, p.position) * p.position;\n                double forceMag = p.force.Mag();\n                if (forceMag > maxForceMag)\n                {\n                    maxForceMag = forceMag;\n                }\n                p.position = ((dt * p.force) + p.position).UnitVector();\n            }\n            \n            return maxForceMag;\n        }\n        \n        bool Converge(double dt, int maxFrames)\n        {\n            const double forceTolerance = 1.0e-10;\n            double force = 1;\n            while (force > forceTolerance)\n            {\n                force = Update(dt);                \n                \/\/std::cout << \"i=\" << i << \", F=\" << force << \", dt=\" << dt << std::endl;\n                if (frame > maxFrames)\n                {\n                    \/\/ Simulation did not converge within specified number of frames.\n                    return false;\n                }\n            }\n            return true;\n        }\n        \n    private:\n        void static AddForces(Particle& a, Particle& b)\n        {\n            \/\/ Force of electrically charged particles:\n            \/\/ F = k*q1*q2\/r^2.\n            \/\/ We simplify the problem as:  F = 1\/r^2.\n            \/\/ Force is along the direction of the line passing through both.\n            Vector dp = a.position - b.position;\n            double forcemag = 1.0 \/ dp.MagSquared();\n            Vector force = forcemag * dp.UnitVector();\n            a.force += force;\n            b.force -= force;\n        }\n    };\n}\n\n\/\/======================================================================================\n\nclass StandardDeviationCalculator\n{\n    \/\/ https:\/\/en.wikipedia.org\/wiki\/Algorithms_for_calculating_variance#Online_algorithm    \nprivate:\n    int n;\n    double mean;\n    double sum;\n    double max;\n    double min;\n\npublic:\n    StandardDeviationCalculator(): n(0), mean(0.0), sum(0.0), max(0.0), min(0.0) {}\n    \n    int NumData() const\n    {\n        return n;\n    }\n        \n    void Append(double x)\n    {\n        ++n;\n        if (n == 1)\n        {\n            max = min = x;\n        }\n        else\n        {\n            if (x < min) min = x;\n            if (x > max) max = x;\n        }\n        double delta = x - mean;\n        mean += delta\/n;\n        sum += delta*(x - mean);\n    }    \n    \n    bool HasData() const\n    {\n        return n >= 1;\n    }\n    \n    bool CanCalculateVariance() const\n    {\n        return n >= 2;\n    }\n    \n    double Mean() const\n    {\n        if (HasData())\n        {\n            return mean;\n        }\n        throw \"No data to calculate mean\";\n    }\n    \n    double Variance() const\n    {\n        if (CanCalculateVariance())\n        {\n            return sum \/ (n - 1);\n        }\n        throw \"Not enough data to calculate variance\";\n    }\n    \n    double Deviation() const\n    {\n        return sqrt(Variance());\n    }\n    \n    double Minimum() const\n    {\n        if (HasData())\n        {\n            return min;\n        }\n        throw \"No data to calculate minimum\";\n    }\n    \n    double Maximum() const\n    {\n        if (HasData())\n        {\n            return max;\n        }\n        throw \"No data to calculate maximum\";\n    }\n};\n\n\/\/======================================================================================\n\nconst int MaxParticles = 1000;\n    \nvoid PrintUsage()\n{\n    std::cout <<\n        \"\\n\"\n        \"USAGE:\\n\"\n        \"\\n\"\n        \"fastsim fixed N dt\\n\"\n        \"    Run multiple simulations on N particles with time increment dt.\\n\"\n        \"\\n\";\n}\n\n\nint ScanNumParticles(const char *text)\n{\n    int n = atoi(text);\n    if (n<1 || n>MaxParticles)\n    {\n        throw \"Invalid number of particles.\";\n    }\n    return n;\n}\n\n\ndouble ScanTimeIncrement(const char *text)\n{\n    double dt = atof(text);\n    if (dt <= 0.0)\n    {\n        throw \"Time increment must be a positive real number.\";\n    }\n    return dt;\n}\n\nbool TryFixedIncrement(int n, double dt, int &maxframes)\n{\n    using namespace std;\n    using namespace Electrons;\n    \n    maxframes = -1;\n    \n    const int NumTrials = 100;\n    const int MaxFrames = 1000000;\n    cout << setprecision(10) << fixed;\n    StandardDeviationCalculator sd;\n    for (int trial=0; trial < NumTrials; ++trial)\n    {\n        Simulation sim(n);\n        if (sim.Converge(dt, MaxFrames))\n        {\n            \/\/cout << \"trial=\" << trial << \", frames=\" << sim.FrameNumber() << endl;\n            sd.Append(static_cast<double>(sim.FrameNumber()));\n        }\n        else\n        {\n            cout << \"trial=\" << trial << \", *** NO CONVERGENCE ***\" << endl;\n            return false;\n        }\n    }\n    \n    maxframes = static_cast<int>(sd.Maximum());\n    \n    \/\/cout << endl;\n    cout << \n        \"frames: count=\" << sd.NumData() <<\n        \", dt=\" << setprecision(6) << dt << setprecision(2) <<\n        \", mean=\" << sd.Mean() << \n        \", stdev=\" << sd.Deviation() << \n        \", min=\" << static_cast<int>(sd.Minimum()) <<\n        \", max=\" << maxframes <<\n        endl;        \n    \n    return true;\n}\n\n\/\/======================================================================================\n\nint main(int argc, const char *argv[])\n{\n    using namespace std;\n    using namespace Electrons;\n    try \n    {\n        if (argc > 1)\n        {\n            const char *verb = argv[1];\n            if (!strcmp(verb, \"fixed\") && (argc == 4))\n            {\n                int maxframes = 0;\n                int n = ScanNumParticles(argv[2]);\n                double dt = ScanTimeIncrement(argv[3]);\n                if (TryFixedIncrement(n, dt, maxframes))\n                {\n                    return 0;\n                }\n                return 1;\n            }\n            \n            if (!strcmp(verb, \"range\") && (argc == 6))\n            {\n                int n = ScanNumParticles(argv[2]);\n                double dt1 = ScanTimeIncrement(argv[3]);\n                double dt2 = ScanTimeIncrement(argv[4]);\n                double inc = ScanTimeIncrement(argv[5]);\n                int bestframes = 0;\n                double bestdt = 0;\n                for (double dt = dt1; dt <= dt2; dt += inc)\n                {\n                    int maxframes = 0;\n                    if (TryFixedIncrement(n, dt, maxframes))\n                    {\n                        if (bestframes==0 || maxframes<bestframes)\n                        {\n                            cout << \"BEST: dt=\" << setprecision(6) << dt << \", maxframes=\" << maxframes << endl;\n                            bestframes = maxframes;\n                            bestdt = dt;\n                        }\n                    }\n                }\n                \n                if (bestframes > 0)\n                {\n                    cout << endl;\n                    cout << \"Final answer: dt=\" << setprecision(6) << bestdt << \", frames=\" << bestframes << endl;\n                }\n                return 0;\n            }\n        }\n    \n        PrintUsage();\n        return 2;\n    }\n    catch (const char *message)\n    {\n        cerr << \"EXCEPTION: \" << message << endl;\n        return 3;\n    }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include \"OgreMeshLoader.h\"\n#include <sofa\/helper\/system\/SetDirectory.h>\n#include <sofa\/core\/ObjectFactory.h>\n\n\nnamespace sofa\n{\nnamespace component\n{\nnamespace loader\n{\n\nSOFA_DECL_CLASS(OgreMeshLoader)\n\nint OgreMeshLoaderClass = core::RegisterObject(\"Specific mesh loader for Ogre compiled mesh files.\")\n        .add< OgreMeshLoader >()\n        ;\n\nOgreMeshLoader::OgreMeshLoader():\n    core::loader::MeshLoader(),\n    texCoords(initData(&texCoords,\"texcoords\",\"Texture coordinates of the mesh\"))\n{\n\n}\n\nbool OgreMeshLoader::load()\n{\n    sout << \"Loading MESH file: \" << m_filename << sendl;\n    bool fileRead = false;\n    try\n    {\n        Ogre::MeshPtr mesh = Ogre::MeshManager::getSingleton().load(m_filename.getFullPath(),\"General\");\n        fileRead = this->readMesh(mesh.getPointer());\n    }\n    catch (Ogre::Exception& e)\n    {\n        serr << e.getFullDescription() << sendl;\n        fileRead = false;\n    }\n    return fileRead;\n}\n\nbool OgreMeshLoader::readMesh(Ogre::Mesh* mesh)\n{\n    using namespace Ogre;\n    helper::vector<sofa::defaulttype::Vector3>& vertices = *(positions.beginEdit());\n    helper::vector< helper::fixed_array <unsigned int,3> >& indices = *(triangles.beginEdit());\n    helper::vector<sofa::defaulttype::Vector2>& coords = *(texCoords.beginEdit());\n    helper::vector<sofa::defaulttype::Vector3>& normal = *(normals.beginEdit());\n\n    bool added_shared = false;\n    size_t vertex_count   = 0;\n    size_t index_count    = 0;\n    size_t current_offset = 0;\n    size_t shared_offset  = 0;\n    size_t next_offset    = 0;\n    size_t index_offset   = 0;\n\n    \/\/ Calculate how many vertices and indices we're going to need\n    for(int i = 0; i < mesh->getNumSubMeshes(); i++)\n    {\n        SubMesh* submesh = mesh->getSubMesh(i);\n\n        \/\/ We only need to add the shared vertices once\n        if(submesh->useSharedVertices)\n        {\n            if(!added_shared)\n            {\n                VertexData* vertex_data = mesh->sharedVertexData;\n                vertex_count += vertex_data->vertexCount;\n                added_shared = true;\n            }\n        }\n        else\n        {\n            VertexData* vertex_data = submesh->vertexData;\n            vertex_count += vertex_data->vertexCount;\n        }\n\n        \/\/ Add the indices\n        Ogre::IndexData* index_data = submesh->indexData;\n        index_count += index_data->indexCount;\n    }\n\n    \/\/ Allocate space for the vertices and indices\n    vertices.reserve(vertex_count);\n    coords.reserve(vertex_count);\n    indices.reserve(index_count \/ 3);\n\n    added_shared = false;\n\n    \/\/ Run through the submeshes again, adding the data into the arrays\n    for(int i = 0; i < mesh->getNumSubMeshes(); i++)\n    {\n        SubMesh* submesh = mesh->getSubMesh(i);\n\n        Ogre::VertexData* vertex_data = submesh->useSharedVertices ? mesh->sharedVertexData : submesh->vertexData;\n        if((!submesh->useSharedVertices)||(submesh->useSharedVertices && !added_shared))\n        {\n            if(submesh->useSharedVertices)\n            {\n                added_shared = true;\n                shared_offset = current_offset;\n            }\n            readMeshVertices(vertex_data,vertices);\n            readMeshTexCoords(vertex_data,coords);\n            readMeshNormals(vertex_data,normal);\n            next_offset += vertex_data->vertexCount;\n        }\n\n        Ogre::IndexData* index_data = submesh->indexData;\n\n        size_t numTris = index_data->indexCount \/ 3;\n        unsigned short* pShort;\n        unsigned int* pInt;\n        Ogre::HardwareIndexBufferSharedPtr ibuf = index_data->indexBuffer;\n        bool use32bitindexes = (ibuf->getType() == Ogre::HardwareIndexBuffer::IT_32BIT);\n        if (use32bitindexes) pInt = static_cast<unsigned int*>(ibuf->lock(Ogre::HardwareBuffer::HBL_READ_ONLY));\n        else pShort = static_cast<unsigned short*>(ibuf->lock(Ogre::HardwareBuffer::HBL_READ_ONLY));\n\n        for(size_t k = 0; k < numTris; ++k)\n        {\n            size_t offset = (submesh->useSharedVertices)?shared_offset:current_offset;\n            helper::fixed_array <unsigned int,3> tri;\n            unsigned int vindex = use32bitindexes? *pInt++ : *pShort++;\n            tri[0] = vindex + offset;\n            vindex = use32bitindexes? *pInt++ : *pShort++;\n            tri[1] = vindex + offset;\n            vindex = use32bitindexes? *pInt++ : *pShort++;\n            tri[2] = vindex + offset;\n            indices.push_back(tri);\n            index_offset += 3;\n        }\n        ibuf->unlock();\n        current_offset = next_offset;\n    }\n    positions.endEdit();\n    triangles.endEdit();\n    texCoords.endEdit();\n    normals.endEdit();\n\n    return true;\n}\n\nvoid OgreMeshLoader::readMeshVertices(Ogre::VertexData* vertexData,\n        helper::vector< sofa::defaulttype::Vector3 >& vertices)\n{\n    const Ogre::VertexElement* posElem =\n        vertexData->vertexDeclaration->findElementBySemantic(Ogre::VES_POSITION);\n\n    if( !posElem ) return;\n\n    Ogre::HardwareVertexBufferSharedPtr vbuf =\n        vertexData->vertexBufferBinding->getBuffer(posElem->getSource());\n    unsigned char* vertex =\n        static_cast<unsigned char*>(vbuf->lock(Ogre::HardwareBuffer::HBL_READ_ONLY));\n    Ogre::Real* pReal;\n    for(size_t j = 0; j < vertexData->vertexCount; ++j, vertex += vbuf->getVertexSize())\n    {\n        posElem->baseVertexPointerToElement(vertex, &pReal);\n        sofa::defaulttype::Vector3 pt;\n        pt[0] = (*pReal++);\n        pt[1] = (*pReal++);\n        pt[2] = (*pReal++);\n        vertices.push_back(pt);\n    }\n    vbuf->unlock();\n}\n\n\/*   void OgreMeshLoader::readMeshIndices(Ogre::VertexData* vertexData,\n     helper::vector< helper::fixed_array <unsigned int,3> >& indices)\n   {\n\n   }*\/\n\nvoid OgreMeshLoader::readMeshNormals(Ogre::VertexData* vertexData,\n        helper::vector< sofa::defaulttype::Vector3 >& normal)\n{\n    const Ogre::VertexElement* normalElem =\n        vertexData->vertexDeclaration->findElementBySemantic(Ogre::VES_TEXTURE_COORDINATES);\n\n    if( ! normalElem ) return;\n\n    Ogre::HardwareVertexBufferSharedPtr vbuf =\n        vertexData->vertexBufferBinding->getBuffer(normalElem->getSource());\n    unsigned char* vertex =\n        static_cast<unsigned char*>(vbuf->lock(Ogre::HardwareBuffer::HBL_READ_ONLY));\n    Ogre::Real* pReal;\n    for(size_t j = 0; j < vertexData->vertexCount; ++j, vertex += vbuf->getVertexSize())\n    {\n        normalElem->baseVertexPointerToElement(vertex, &pReal);\n        sofa::defaulttype::Vector3 n;\n        n[0] = (*pReal++);\n        n[1] = (*pReal++);\n        n[2] = (*pReal++);\n        normal.push_back(n);\n    }\n    vbuf->unlock();\n}\n\nvoid OgreMeshLoader::readMeshTexCoords(Ogre::VertexData* vertexData,\n        helper::vector< sofa::defaulttype::Vector2>& coords)\n{\n    const Ogre::VertexElement* coordElem =\n        vertexData->vertexDeclaration->findElementBySemantic(Ogre::VES_TEXTURE_COORDINATES);\n\n    if( !coordElem ) return;\n\n    Ogre::HardwareVertexBufferSharedPtr vbuf =\n        vertexData->vertexBufferBinding->getBuffer(coordElem->getSource());\n    unsigned char* vertex =\n        static_cast<unsigned char*>(vbuf->lock(Ogre::HardwareBuffer::HBL_READ_ONLY));\n    Ogre::Real* pReal;\n    for(size_t j = 0; j < vertexData->vertexCount; ++j, vertex += vbuf->getVertexSize())\n    {\n        coordElem->baseVertexPointerToElement(vertex, &pReal);\n        sofa::defaulttype::Vector2 coord;\n        coord[0] = (*pReal++);\n        coord[1] = (*pReal++);\n        coords.push_back(coord);\n    }\n    vbuf->unlock();\n\n}\n\n} \/\/namespace loader\n} \/\/namespace component\n} \/\/ namespace sofa\n<commit_msg>r9656\/sofa-dev : FIX: [QtOgreViewer] bad copy paste in OgreMeshLoader::readMeshNormals<commit_after>#include \"OgreMeshLoader.h\"\n#include <sofa\/helper\/system\/SetDirectory.h>\n#include <sofa\/core\/ObjectFactory.h>\n\n\nnamespace sofa\n{\nnamespace component\n{\nnamespace loader\n{\n\nSOFA_DECL_CLASS(OgreMeshLoader)\n\nint OgreMeshLoaderClass = core::RegisterObject(\"Specific mesh loader for Ogre compiled mesh files.\")\n        .add< OgreMeshLoader >()\n        ;\n\nOgreMeshLoader::OgreMeshLoader():\n    core::loader::MeshLoader(),\n    texCoords(initData(&texCoords,\"texcoords\",\"Texture coordinates of the mesh\"))\n{\n\n}\n\nbool OgreMeshLoader::load()\n{\n    sout << \"Loading MESH file: \" << m_filename << sendl;\n    bool fileRead = false;\n    try\n    {\n        Ogre::MeshPtr mesh = Ogre::MeshManager::getSingleton().load(m_filename.getFullPath(),\"General\");\n        fileRead = this->readMesh(mesh.getPointer());\n    }\n    catch (Ogre::Exception& e)\n    {\n        serr << e.getFullDescription() << sendl;\n        fileRead = false;\n    }\n    return fileRead;\n}\n\nbool OgreMeshLoader::readMesh(Ogre::Mesh* mesh)\n{\n    using namespace Ogre;\n    helper::vector<sofa::defaulttype::Vector3>& vertices = *(positions.beginEdit());\n    helper::vector< helper::fixed_array <unsigned int,3> >& indices = *(triangles.beginEdit());\n    helper::vector<sofa::defaulttype::Vector2>& coords = *(texCoords.beginEdit());\n    helper::vector<sofa::defaulttype::Vector3>& normal = *(normals.beginEdit());\n\n    bool added_shared = false;\n    size_t vertex_count   = 0;\n    size_t index_count    = 0;\n    size_t current_offset = 0;\n    size_t shared_offset  = 0;\n    size_t next_offset    = 0;\n    size_t index_offset   = 0;\n\n    \/\/ Calculate how many vertices and indices we're going to need\n    for(int i = 0; i < mesh->getNumSubMeshes(); i++)\n    {\n        SubMesh* submesh = mesh->getSubMesh(i);\n\n        \/\/ We only need to add the shared vertices once\n        if(submesh->useSharedVertices)\n        {\n            if(!added_shared)\n            {\n                VertexData* vertex_data = mesh->sharedVertexData;\n                vertex_count += vertex_data->vertexCount;\n                added_shared = true;\n            }\n        }\n        else\n        {\n            VertexData* vertex_data = submesh->vertexData;\n            vertex_count += vertex_data->vertexCount;\n        }\n\n        \/\/ Add the indices\n        Ogre::IndexData* index_data = submesh->indexData;\n        index_count += index_data->indexCount;\n    }\n\n    \/\/ Allocate space for the vertices and indices\n    vertices.reserve(vertex_count);\n    coords.reserve(vertex_count);\n    indices.reserve(index_count \/ 3);\n\n    added_shared = false;\n\n    \/\/ Run through the submeshes again, adding the data into the arrays\n    for(int i = 0; i < mesh->getNumSubMeshes(); i++)\n    {\n        SubMesh* submesh = mesh->getSubMesh(i);\n\n        Ogre::VertexData* vertex_data = submesh->useSharedVertices ? mesh->sharedVertexData : submesh->vertexData;\n        if((!submesh->useSharedVertices)||(submesh->useSharedVertices && !added_shared))\n        {\n            if(submesh->useSharedVertices)\n            {\n                added_shared = true;\n                shared_offset = current_offset;\n            }\n            readMeshVertices(vertex_data,vertices);\n            readMeshTexCoords(vertex_data,coords);\n            readMeshNormals(vertex_data,normal);\n            next_offset += vertex_data->vertexCount;\n        }\n\n        Ogre::IndexData* index_data = submesh->indexData;\n\n        size_t numTris = index_data->indexCount \/ 3;\n        unsigned short* pShort;\n        unsigned int* pInt;\n        Ogre::HardwareIndexBufferSharedPtr ibuf = index_data->indexBuffer;\n        bool use32bitindexes = (ibuf->getType() == Ogre::HardwareIndexBuffer::IT_32BIT);\n        if (use32bitindexes) pInt = static_cast<unsigned int*>(ibuf->lock(Ogre::HardwareBuffer::HBL_READ_ONLY));\n        else pShort = static_cast<unsigned short*>(ibuf->lock(Ogre::HardwareBuffer::HBL_READ_ONLY));\n\n        for(size_t k = 0; k < numTris; ++k)\n        {\n            size_t offset = (submesh->useSharedVertices)?shared_offset:current_offset;\n            helper::fixed_array <unsigned int,3> tri;\n            unsigned int vindex = use32bitindexes? *pInt++ : *pShort++;\n            tri[0] = vindex + offset;\n            vindex = use32bitindexes? *pInt++ : *pShort++;\n            tri[1] = vindex + offset;\n            vindex = use32bitindexes? *pInt++ : *pShort++;\n            tri[2] = vindex + offset;\n            indices.push_back(tri);\n            index_offset += 3;\n        }\n        ibuf->unlock();\n        current_offset = next_offset;\n    }\n    positions.endEdit();\n    triangles.endEdit();\n    texCoords.endEdit();\n    normals.endEdit();\n\n    return true;\n}\n\nvoid OgreMeshLoader::readMeshVertices(Ogre::VertexData* vertexData,\n        helper::vector< sofa::defaulttype::Vector3 >& vertices)\n{\n    const Ogre::VertexElement* posElem =\n        vertexData->vertexDeclaration->findElementBySemantic(Ogre::VES_POSITION);\n\n    if( !posElem ) return;\n\n    Ogre::HardwareVertexBufferSharedPtr vbuf =\n        vertexData->vertexBufferBinding->getBuffer(posElem->getSource());\n    unsigned char* vertex =\n        static_cast<unsigned char*>(vbuf->lock(Ogre::HardwareBuffer::HBL_READ_ONLY));\n    Ogre::Real* pReal;\n    for(size_t j = 0; j < vertexData->vertexCount; ++j, vertex += vbuf->getVertexSize())\n    {\n        posElem->baseVertexPointerToElement(vertex, &pReal);\n        sofa::defaulttype::Vector3 pt;\n        pt[0] = (*pReal++);\n        pt[1] = (*pReal++);\n        pt[2] = (*pReal++);\n        vertices.push_back(pt);\n    }\n    vbuf->unlock();\n}\n\n\/*   void OgreMeshLoader::readMeshIndices(Ogre::VertexData* vertexData,\n     helper::vector< helper::fixed_array <unsigned int,3> >& indices)\n   {\n\n   }*\/\n\nvoid OgreMeshLoader::readMeshNormals(Ogre::VertexData* vertexData,\n        helper::vector< sofa::defaulttype::Vector3 >& normal)\n{\n    const Ogre::VertexElement* normalElem =\n        vertexData->vertexDeclaration->findElementBySemantic(Ogre::VES_NORMAL);\n\n    if( ! normalElem ) return;\n\n    Ogre::HardwareVertexBufferSharedPtr vbuf =\n        vertexData->vertexBufferBinding->getBuffer(normalElem->getSource());\n    unsigned char* vertex =\n        static_cast<unsigned char*>(vbuf->lock(Ogre::HardwareBuffer::HBL_READ_ONLY));\n    Ogre::Real* pReal;\n    for(size_t j = 0; j < vertexData->vertexCount; ++j, vertex += vbuf->getVertexSize())\n    {\n        normalElem->baseVertexPointerToElement(vertex, &pReal);\n        sofa::defaulttype::Vector3 n;\n        n[0] = (*pReal++);\n        n[1] = (*pReal++);\n        n[2] = (*pReal++);\n        normal.push_back(n);\n    }\n    vbuf->unlock();\n}\n\nvoid OgreMeshLoader::readMeshTexCoords(Ogre::VertexData* vertexData,\n        helper::vector< sofa::defaulttype::Vector2>& coords)\n{\n    const Ogre::VertexElement* coordElem =\n        vertexData->vertexDeclaration->findElementBySemantic(Ogre::VES_TEXTURE_COORDINATES);\n\n    if( !coordElem ) return;\n\n    Ogre::HardwareVertexBufferSharedPtr vbuf =\n        vertexData->vertexBufferBinding->getBuffer(coordElem->getSource());\n    unsigned char* vertex =\n        static_cast<unsigned char*>(vbuf->lock(Ogre::HardwareBuffer::HBL_READ_ONLY));\n    Ogre::Real* pReal;\n    for(size_t j = 0; j < vertexData->vertexCount; ++j, vertex += vbuf->getVertexSize())\n    {\n        coordElem->baseVertexPointerToElement(vertex, &pReal);\n        sofa::defaulttype::Vector2 coord;\n        coord[0] = (*pReal++);\n        coord[1] = (*pReal++);\n        coords.push_back(coord);\n    }\n    vbuf->unlock();\n\n}\n\n} \/\/namespace loader\n} \/\/namespace component\n} \/\/ namespace sofa\n<|endoftext|>"}
{"text":"<commit_before>\/\/\/\n\/\/\/ @file  phi_vector.hpp\n\/\/\/ @brief The PhiCache class calculates the partial sieve function\n\/\/\/        (a.k.a. Legendre-sum) using the recursive formula:\n\/\/\/        phi(x, a) = phi(x, a - 1) - phi(x \/ primes[a], a - 1).\n\/\/\/        phi(x, a) counts the numbers <= x that are not divisible by\n\/\/\/        any of the first a primes. The algorithm used is an\n\/\/\/        optimized version of the algorithm described in Tomás\n\/\/\/        Oliveira e Silva's paper [1]. I have added 5 optimizations\n\/\/\/        to my implementation which significantly speed up the\n\/\/\/        calculation:\n\/\/\/\n\/\/\/        * Cache results of phi(x, a)\n\/\/\/        * Calculate phi(x, a) using formula [2] if a <= 6\n\/\/\/        * Calculate phi(x, a) using pi(x) lookup table\n\/\/\/        * Calculate all phi(x, a) = 1 upfront\n\/\/\/        * Stop recursion at c instead of 1\n\/\/\/\n\/\/\/       [1] Tomás Oliveira e Silva, Computing pi(x): the combinatorial\n\/\/\/           method, Revista do DETUA, vol. 4, no. 6, March 2006, p. 761.\n\/\/\/           http:\/\/sweet.ua.pt\/tos\/bib\/5.4.pdf\n\/\/\/       [2] phi(x, a) = (x \/ pp) * φ(pp) + phi(x % pp, a)\n\/\/\/           with pp = 2 * 3 * ... * prime[a] \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#ifndef PHI_VECTOR_HPP\n#define PHI_VECTOR_HPP\n\n#include <PiTable.hpp>\n#include <primecount-internal.hpp>\n#include <fast_div.hpp>\n#include <imath.hpp>\n#include <PhiTiny.hpp>\n\n#include <stdint.h>\n#include <array>\n#include <cstdlib>\n#include <vector>\n#include <limits>\n\n#ifdef _OPENMP\n  #include <omp.h>\n#endif\n\nnamespace {\n\nusing namespace std;\nusing namespace primecount;\n\n\/\/\/ Cache phi(x, a) results if a < MAX_A\nconst int MAX_A = 100;\n\ntemplate <typename Primes>\nclass PhiCache\n{\npublic:\n  PhiCache(Primes& primes, PiTable& pi)\n    : primes_(primes),\n      pi_(pi)\n  { }\n\n  \/\/\/ Calculate phi(x, a) using the recursive formula:\n  \/\/\/ phi(x, a) = phi(x, a - 1) - phi(x \/ prime(a), a - 1)\n  \/\/\/\n  template <int SIGN>\n  int64_t phi(int64_t x, int64_t a)\n  {\n    if (x <= prime(a))\n      return SIGN;\n    else if (is_phi_tiny(a))\n      return phi_tiny(x, a) * SIGN;\n    else if (is_pix(x, a))\n      return (pi_[x] - a + 1) * SIGN;\n    else if (is_cached(x, a))\n      return cache_[a][x] * SIGN;\n\n    int64_t sqrtx = isqrt(x);\n    int64_t pi_sqrtx = a;\n    int64_t c = PhiTiny::get_c(sqrtx);\n    int64_t sum = 0;\n\n    if (sqrtx < pi_.size() && sqrtx < prime(a))\n      pi_sqrtx = pi_[sqrtx];\n\n    \/\/ Move out of the loop the calculations where phi(x2, i) = 1\n    \/\/ phi(x, a) = 1 if prime(a) >= x\n    \/\/ x2 = x \/ prime(i + 1)\n    \/\/ phi(x2, i) = 1 if prime(i) >= x \/ prime(i + 1)\n    \/\/ phi(x2, i) = 1 if prime(i) >= sqrt(x)\n    \/\/ phi(x2, i) = 1 if i >= pi(sqrt(x))\n    \/\/ \\sum_{i = pi(sqrt(x))}^{a - 1} phi(x2, i) = a - pi(sqrt(x))\n    \/\/\n    sum += (pi_sqrtx - a) * SIGN;\n    sum += phi_tiny(x, c) * SIGN;\n\n    for (int64_t i = c; i < pi_sqrtx; i++)\n    {\n      int64_t x2 = fast_div(x, prime(i + 1));\n\n      if (is_pix(x2, i))\n        sum += (pi_[x2] - i + 1) * -SIGN;\n      else\n        sum += phi<-SIGN>(x2, i);\n    }\n\n    update_cache(x, a, sum);\n\n    return sum;\n  }\n\nprivate:\n  using T = uint16_t;\n  array<vector<T>, MAX_A> cache_;\n  Primes& primes_;\n  PiTable& pi_;\n\n  int64_t prime(int64_t i) const\n  {\n    return primes_[i];\n  }\n\n  void update_cache(uint64_t x, uint64_t a, int64_t sum)\n  {\n    if (a < cache_.size() &&\n        x <= numeric_limits<T>::max())\n    {\n      if (x >= cache_[a].size())\n        cache_[a].resize(x + 1, 0);\n\n      cache_[a][x] = (T) abs(sum);\n    }\n  }\n\n  bool is_pix(int64_t x, int64_t a) const\n  {\n    return x < pi_.size() &&\n           x < isquare(prime(a + 1));\n  }\n\n  bool is_cached(uint64_t x, uint64_t a) const\n  {\n    return a < cache_.size() && \n           x < cache_[a].size() && \n           cache_[a][x];\n  }\n};\n\n\/\/\/ Returns a vector with phi(x, i - 1) values such that\n\/\/\/ phi[i] = phi(x, i - 1) for 1 <= i <= a.\n\/\/\/ phi(x, a) counts the numbers <= x that are not\n\/\/\/ divisible by any of the first a primes.\n\/\/\/\ntemplate <typename Primes>\nvector<int64_t> phi_vector(int64_t x,\n                           int64_t a,\n                           Primes& primes,\n                           PiTable& pi, \n                           int threads = 1)\n{\n  int64_t size = a + 1;\n  int64_t c = PhiTiny::get_c(primes[a]);\n\n  if (primes[a] > x)\n    a = pi[x];\n\n  vector<int64_t> phi;\n  phi.reserve(size);\n  phi.resize(a + 1, (x > 0) ? -1 : 0);\n  phi.resize(size, x > 0);\n\n  if (x > 0 && a > c)\n  {\n    phi[c] = phi_tiny(x, c - 1);\n    PhiCache<Primes> cache(primes, pi);\n\n    int64_t limit = a;\n    int64_t sqrtx = isqrt(x);\n    int64_t thread_threshold = ipow(10ll, 10);\n    threads = ideal_num_threads(threads, x, thread_threshold);\n\n    if (sqrtx < pi.size())\n      limit = min(a, pi[sqrtx] + 1);\n\n    #pragma omp parallel for num_threads(threads) schedule(dynamic, 16) firstprivate(cache)\n    for (int64_t i = c + 1; i <= limit; i++)\n      phi[i] = cache.template phi<-1>(x \/ primes[i - 1], i - 2);\n\n    \/\/ calculate phi(x, a) using partial results\n    for (int64_t i = c + 1; i <= a; i++)\n      phi[i] += phi[i - 1];\n  }\n\n  return phi;\n}\n\n} \/\/ namespace\n\n#endif\n<commit_msg>Remove space<commit_after>\/\/\/\n\/\/\/ @file  phi_vector.hpp\n\/\/\/ @brief The PhiCache class calculates the partial sieve function\n\/\/\/        (a.k.a. Legendre-sum) using the recursive formula:\n\/\/\/        phi(x, a) = phi(x, a - 1) - phi(x \/ primes[a], a - 1).\n\/\/\/        phi(x, a) counts the numbers <= x that are not divisible by\n\/\/\/        any of the first a primes. The algorithm used is an\n\/\/\/        optimized version of the algorithm described in Tomás\n\/\/\/        Oliveira e Silva's paper [1]. I have added 5 optimizations\n\/\/\/        to my implementation which significantly speed up the\n\/\/\/        calculation:\n\/\/\/\n\/\/\/        * Cache results of phi(x, a)\n\/\/\/        * Calculate phi(x, a) using formula [2] if a <= 6\n\/\/\/        * Calculate phi(x, a) using pi(x) lookup table\n\/\/\/        * Calculate all phi(x, a) = 1 upfront\n\/\/\/        * Stop recursion at c instead of 1\n\/\/\/\n\/\/\/       [1] Tomás Oliveira e Silva, Computing pi(x): the combinatorial\n\/\/\/           method, Revista do DETUA, vol. 4, no. 6, March 2006, p. 761.\n\/\/\/           http:\/\/sweet.ua.pt\/tos\/bib\/5.4.pdf\n\/\/\/       [2] phi(x, a) = (x \/ pp) * φ(pp) + phi(x % pp, a)\n\/\/\/           with pp = 2 * 3 * ... * prime[a] \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#ifndef PHI_VECTOR_HPP\n#define PHI_VECTOR_HPP\n\n#include <PiTable.hpp>\n#include <primecount-internal.hpp>\n#include <fast_div.hpp>\n#include <imath.hpp>\n#include <PhiTiny.hpp>\n\n#include <stdint.h>\n#include <array>\n#include <cstdlib>\n#include <vector>\n#include <limits>\n\n#ifdef _OPENMP\n  #include <omp.h>\n#endif\n\nnamespace {\n\nusing namespace std;\nusing namespace primecount;\n\n\/\/\/ Cache phi(x, a) results if a < MAX_A\nconst int MAX_A = 100;\n\ntemplate <typename Primes>\nclass PhiCache\n{\npublic:\n  PhiCache(Primes& primes, PiTable& pi)\n    : primes_(primes),\n      pi_(pi)\n  { }\n\n  \/\/\/ Calculate phi(x, a) using the recursive formula:\n  \/\/\/ phi(x, a) = phi(x, a - 1) - phi(x \/ prime(a), a - 1)\n  \/\/\/\n  template <int SIGN>\n  int64_t phi(int64_t x, int64_t a)\n  {\n    if (x <= prime(a))\n      return SIGN;\n    else if (is_phi_tiny(a))\n      return phi_tiny(x, a) * SIGN;\n    else if (is_pix(x, a))\n      return (pi_[x] - a + 1) * SIGN;\n    else if (is_cached(x, a))\n      return cache_[a][x] * SIGN;\n\n    int64_t sqrtx = isqrt(x);\n    int64_t pi_sqrtx = a;\n    int64_t c = PhiTiny::get_c(sqrtx);\n    int64_t sum = 0;\n\n    if (sqrtx < pi_.size() && sqrtx < prime(a))\n      pi_sqrtx = pi_[sqrtx];\n\n    \/\/ Move out of the loop the calculations where phi(x2, i) = 1\n    \/\/ phi(x, a) = 1 if prime(a) >= x\n    \/\/ x2 = x \/ prime(i + 1)\n    \/\/ phi(x2, i) = 1 if prime(i) >= x \/ prime(i + 1)\n    \/\/ phi(x2, i) = 1 if prime(i) >= sqrt(x)\n    \/\/ phi(x2, i) = 1 if i >= pi(sqrt(x))\n    \/\/ \\sum_{i = pi(sqrt(x))}^{a - 1} phi(x2, i) = a - pi(sqrt(x))\n    \/\/\n    sum += (pi_sqrtx - a) * SIGN;\n    sum += phi_tiny(x, c) * SIGN;\n\n    for (int64_t i = c; i < pi_sqrtx; i++)\n    {\n      int64_t x2 = fast_div(x, prime(i + 1));\n\n      if (is_pix(x2, i))\n        sum += (pi_[x2] - i + 1) * -SIGN;\n      else\n        sum += phi<-SIGN>(x2, i);\n    }\n\n    update_cache(x, a, sum);\n\n    return sum;\n  }\n\nprivate:\n  using T = uint16_t;\n  array<vector<T>, MAX_A> cache_;\n  Primes& primes_;\n  PiTable& pi_;\n\n  int64_t prime(int64_t i) const\n  {\n    return primes_[i];\n  }\n\n  void update_cache(uint64_t x, uint64_t a, int64_t sum)\n  {\n    if (a < cache_.size() &&\n        x <= numeric_limits<T>::max())\n    {\n      if (x >= cache_[a].size())\n        cache_[a].resize(x + 1, 0);\n\n      cache_[a][x] = (T) abs(sum);\n    }\n  }\n\n  bool is_pix(int64_t x, int64_t a) const\n  {\n    return x < pi_.size() &&\n           x < isquare(prime(a + 1));\n  }\n\n  bool is_cached(uint64_t x, uint64_t a) const\n  {\n    return a < cache_.size() && \n           x < cache_[a].size() && \n           cache_[a][x];\n  }\n};\n\n\/\/\/ Returns a vector with phi(x, i - 1) values such that\n\/\/\/ phi[i] = phi(x, i - 1) for 1 <= i <= a.\n\/\/\/ phi(x, a) counts the numbers <= x that are not\n\/\/\/ divisible by any of the first a primes.\n\/\/\/\ntemplate <typename Primes>\nvector<int64_t> phi_vector(int64_t x,\n                           int64_t a,\n                           Primes& primes,\n                           PiTable& pi,\n                           int threads = 1)\n{\n  int64_t size = a + 1;\n  int64_t c = PhiTiny::get_c(primes[a]);\n\n  if (primes[a] > x)\n    a = pi[x];\n\n  vector<int64_t> phi;\n  phi.reserve(size);\n  phi.resize(a + 1, (x > 0) ? -1 : 0);\n  phi.resize(size, x > 0);\n\n  if (x > 0 && a > c)\n  {\n    phi[c] = phi_tiny(x, c - 1);\n    PhiCache<Primes> cache(primes, pi);\n\n    int64_t limit = a;\n    int64_t sqrtx = isqrt(x);\n    int64_t thread_threshold = ipow(10ll, 10);\n    threads = ideal_num_threads(threads, x, thread_threshold);\n\n    if (sqrtx < pi.size())\n      limit = min(a, pi[sqrtx] + 1);\n\n    #pragma omp parallel for num_threads(threads) schedule(dynamic, 16) firstprivate(cache)\n    for (int64_t i = c + 1; i <= limit; i++)\n      phi[i] = cache.template phi<-1>(x \/ primes[i - 1], i - 2);\n\n    \/\/ calculate phi(x, a) using partial results\n    for (int64_t i = c + 1; i <= a; i++)\n      phi[i] += phi[i - 1];\n  }\n\n  return phi;\n}\n\n} \/\/ namespace\n\n#endif\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: qp_spline_st_boundary_mapper.cc\n **\/\n\n#include \"modules\/planning\/optimizer\/qp_spline_st_speed\/qp_spline_st_boundary_mapper.h\"\n\n#include <algorithm>\n#include <limits>\n\n#include \"modules\/planning\/proto\/decision.pb.h\"\n\n#include \"modules\/common\/log.h\"\n#include \"modules\/common\/math\/line_segment2d.h\"\n#include \"modules\/common\/math\/vec2d.h\"\n#include \"modules\/common\/util\/util.h\"\n#include \"modules\/planning\/common\/planning_gflags.h\"\n#include \"modules\/planning\/math\/double.h\"\n\nnamespace apollo {\nnamespace planning {\n\nusing ErrorCode = apollo::common::ErrorCode;\nusing VehicleParam = apollo::common::config::VehicleParam;\nusing PathPoint = apollo::common::PathPoint;\nusing Box2d = apollo::common::math::Box2d;\nusing Vec2d = apollo::common::math::Vec2d;\n\nQPSplineSTBoundaryMapper::QPSplineSTBoundaryMapper(\n    const STBoundaryConfig& st_boundary_config, const VehicleParam& veh_param)\n    : STBoundaryMapper(st_boundary_config, veh_param) {}\n\nErrorCode QPSplineSTBoundaryMapper::get_graph_boundary(\n    const common::TrajectoryPoint& initial_planning_point,\n    const DecisionData& decision_data, const PathData& path_data,\n    const double planning_distance, const double planning_time,\n    std::vector<STGraphBoundary>* const obs_boundary) const {\n  if (obs_boundary) {\n    AERROR << \"obs_boundary is NULL.\";\n    return ErrorCode::PLANNING_ERROR_FAILED;\n  }\n\n  if (planning_time < 0.0) {\n    AERROR << \"Fail to get params since planning_time < 0.\";\n    return ErrorCode::PLANNING_ERROR_FAILED;\n  }\n\n  if (path_data.path().num_of_points() < 2) {\n    AERROR << \"Fail to get params because of too few path points. path points \"\n              \"size: \"\n           << path_data.path().num_of_points() << \".\";\n    return ErrorCode::PLANNING_ERROR_FAILED;\n  }\n\n  obs_boundary->clear();\n\n  \/*\n  const auto& planning_data = processed_data.planning_data();\n  const auto& main_decision = planning_data.main_decision();\n  QUIT_IF(!planning_data.has_main_decision(), ErrorCode::PLANNING_SKIP,\n          Level::X_ERROR, \"Skip mapping because no decision. \\n%s\",\n          planning_data.DebugString().c_str());\n\n  ErrorCode ret = ErrorCode::PLANNING_OK;\n\n  if (main_decision.has_stop()) {\n    ret = map_main_decision_stop(\n        main_decision.stop(), processed_data_proxy.target_reference_line_raw(),\n        planning_distance, planning_time, obs_boundary);\n    QUIT_IF(ret != ErrorCode::PLANNING_OK && ret != ErrorCode::PLANNING_SKIP,\n            ret, Level::X_ERROR,\n            \"Failed to get_params since map_main_decision_stop error.\");\n    obs_boundary->back().set_id(\"main decision stop\");\n  } else if (main_decision.has_change_lane()) {\n    if (main_decision.change_lane().has_default_lane_stop()) {\n      ret = map_main_decision_stop(\n          main_decision.change_lane().default_lane_stop(),\n          processed_data_proxy.default_reference_line_raw(), planning_distance,\n          planning_time, obs_boundary);\n      QUIT_IF(ret != ErrorCode::PLANNING_OK && ret != ErrorCode::PLANNING_SKIP,\n              ret, Level::X_ERROR,\n              \"Fail to get_params due to map default lane stop error.\");\n      obs_boundary->back().set_id(\"default_lane stop\");\n    }\n    if (main_decision.change_lane().has_target_lane_stop()) {\n      ret = map_main_decision_stop(\n          main_decision.change_lane().target_lane_stop(),\n          processed_data_proxy.target_reference_line_raw(), planning_distance,\n          planning_time, obs_boundary);\n      QUIT_IF(ret != ErrorCode::PLANNING_OK && ret != ErrorCode::PLANNING_SKIP,\n              ret, Level::X_ERROR,\n              \"Fail to get_params due to map target lane stop error.\");\n      obs_boundary->back().set_id(\"target_lane stop\");\n    }\n  } else if (main_decision.has_mission_complete()) {\n    ret = map_main_decision_mission_complete(\n        processed_data_proxy.target_reference_line_raw(), planning_distance,\n        planning_time, obs_boundary);\n    QUIT_IF(ret != ErrorCode::PLANNING_OK && ret != ErrorCode::PLANNING_SKIP,\n            ret, Level::X_ERROR,\n            \"Failed to get_params since map_mission_complete error.\");\n  }\n  *\/\n\n  const auto& static_obs_vec = decision_data.StaticObstacles();\n  for (const auto* obs : static_obs_vec) {\n    if (obs == nullptr) {\n      continue;\n    }\n    ErrorCode err = map_obstacle_without_trajectory(\n        initial_planning_point, *obs, path_data, planning_distance,\n        planning_time, obs_boundary);\n    if (err != ErrorCode::PLANNING_OK) {\n      AERROR << \"Fail to map static obstacle with id[\" << obs->Id() << \"].\";\n      return ErrorCode::PLANNING_ERROR_FAILED;\n    }\n  }\n\n  const auto& dynamic_obs_vec = decision_data.DynamicObstacles();\n  for (const auto* obs : dynamic_obs_vec) {\n    if (obs == nullptr) {\n      continue;\n    }\n    for (auto& obj_decision : obs->Decisions()) {\n      if (obj_decision.has_follow()) {\n        ErrorCode err = map_obstacle_with_planning(initial_planning_point, *obs,\n                                                   path_data, planning_distance,\n                                                   planning_time, obs_boundary);\n        if (err != ErrorCode::PLANNING_OK) {\n          AERROR << \"Fail to map follow dynamic obstacle with id \" << obs->Id()\n                 << \".\";\n          return ErrorCode::PLANNING_ERROR_FAILED;\n        }\n      } else if (obj_decision.has_overtake() || obj_decision.has_yield()) {\n        ErrorCode err = map_obstacle_with_prediction_trajectory(\n            initial_planning_point, *obs, obj_decision, path_data,\n            planning_distance, planning_time, obs_boundary);\n        if (err != ErrorCode::PLANNING_OK) {\n          AERROR << \"Fail to map dynamic obstacle with id \" << obs->Id() << \".\";\n          return ErrorCode::PLANNING_OK;\n        }\n      }\n    }\n  }\n  return ErrorCode::PLANNING_OK;\n}\n\nErrorCode QPSplineSTBoundaryMapper::map_obstacle_with_planning(\n    const common::TrajectoryPoint& initial_planning_point,\n    const Obstacle& obstacle, const PathData& path_data,\n    const double planning_distance, const double planning_time,\n    std::vector<STGraphBoundary>* const boundary) const {\n  return ErrorCode::PLANNING_OK;\n}\n\nErrorCode QPSplineSTBoundaryMapper::map_obstacle_with_prediction_trajectory(\n    const common::TrajectoryPoint& initial_planning_point,\n    const Obstacle& obstacle, const ObjectDecisionType obj_decision,\n    const PathData& path_data, const double planning_distance,\n    const double planning_time,\n    std::vector<STGraphBoundary>* const boundary) const {\n  std::vector<STPoint> lower_points;\n  std::vector<STPoint> upper_points;\n\n  const double speed = obstacle.Speed();\n  const double minimal_follow_time = st_boundary_config().minimal_follow_time();\n  double follow_distance = -1.0;\n  if (obj_decision.has_follow()) {\n    follow_distance = std::fmax(speed * minimal_follow_time,\n                                std::fabs(obj_decision.follow().distance_s())) +\n                      vehicle_param().front_edge_to_center();\n  }\n\n  bool skip = true;\n  std::vector<STPoint> boundary_points;\n\n  for (uint32_t i = 0; i < obstacle.prediction_trajectories().size(); ++i) {\n    const auto& trajectory = obstacle.prediction_trajectories()[i];\n    for (uint32_t j = 0; j < trajectory.num_of_points(); ++i) {\n      const auto& trajectory_point = trajectory.trajectory_point_at(j);\n      \/\/ TODO: fix trajectory point relative time issue.\n      double trajectory_point_time =\n          trajectory_point.relative_time() +\n          trajectory.start_timestamp();  \/\/ -curr_timestamp.\n      const Box2d obs_box(\n          Vec2d(trajectory_point.path_point().x(),\n                trajectory_point.path_point().y()),\n          trajectory_point.path_point().theta(),\n          obstacle.Length() * st_boundary_config().expending_coeff(),\n          obstacle.Width() * st_boundary_config().expending_coeff());\n      uint64_t low = 0;\n      uint64_t high = path_data.path().num_of_points() - 1;\n    }\n  }\n\n  return ErrorCode::PLANNING_OK;\n}\n\nErrorCode QPSplineSTBoundaryMapper::map_obstacle_without_trajectory(\n    const common::TrajectoryPoint& initial_planning_point,\n    const Obstacle& obstacle, const PathData& path_data,\n    const double planning_distance, const double planning_time,\n    std::vector<STGraphBoundary>* const boundary) const {\n  return ErrorCode::PLANNING_OK;\n}\n\n}  \/\/ namespace planning\n}  \/\/ namespace apollo\n<commit_msg>added map_boundary_by_prediction_trajectory.<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: qp_spline_st_boundary_mapper.cc\n **\/\n\n#include \"modules\/planning\/optimizer\/qp_spline_st_speed\/qp_spline_st_boundary_mapper.h\"\n\n#include <algorithm>\n#include <limits>\n\n#include \"modules\/planning\/proto\/decision.pb.h\"\n\n#include \"modules\/common\/log.h\"\n#include \"modules\/common\/math\/line_segment2d.h\"\n#include \"modules\/common\/math\/vec2d.h\"\n#include \"modules\/common\/util\/util.h\"\n#include \"modules\/planning\/common\/planning_gflags.h\"\n#include \"modules\/planning\/math\/double.h\"\n\nnamespace apollo {\nnamespace planning {\n\nusing ErrorCode = apollo::common::ErrorCode;\nusing VehicleParam = apollo::common::config::VehicleParam;\nusing PathPoint = apollo::common::PathPoint;\nusing Box2d = apollo::common::math::Box2d;\nusing Vec2d = apollo::common::math::Vec2d;\n\nQPSplineSTBoundaryMapper::QPSplineSTBoundaryMapper(\n    const STBoundaryConfig& st_boundary_config, const VehicleParam& veh_param)\n    : STBoundaryMapper(st_boundary_config, veh_param) {}\n\nErrorCode QPSplineSTBoundaryMapper::get_graph_boundary(\n    const common::TrajectoryPoint& initial_planning_point,\n    const DecisionData& decision_data, const PathData& path_data,\n    const double planning_distance, const double planning_time,\n    std::vector<STGraphBoundary>* const obs_boundary) const {\n  if (obs_boundary) {\n    AERROR << \"obs_boundary is NULL.\";\n    return ErrorCode::PLANNING_ERROR_FAILED;\n  }\n\n  if (planning_time < 0.0) {\n    AERROR << \"Fail to get params since planning_time < 0.\";\n    return ErrorCode::PLANNING_ERROR_FAILED;\n  }\n\n  if (path_data.path().num_of_points() < 2) {\n    AERROR << \"Fail to get params because of too few path points. path points \"\n              \"size: \"\n           << path_data.path().num_of_points() << \".\";\n    return ErrorCode::PLANNING_ERROR_FAILED;\n  }\n\n  obs_boundary->clear();\n\n  \/*\n  const auto& planning_data = processed_data.planning_data();\n  const auto& main_decision = planning_data.main_decision();\n  QUIT_IF(!planning_data.has_main_decision(), ErrorCode::PLANNING_SKIP,\n          Level::X_ERROR, \"Skip mapping because no decision. \\n%s\",\n          planning_data.DebugString().c_str());\n\n  ErrorCode ret = ErrorCode::PLANNING_OK;\n\n  if (main_decision.has_stop()) {\n    ret = map_main_decision_stop(\n        main_decision.stop(), processed_data_proxy.target_reference_line_raw(),\n        planning_distance, planning_time, obs_boundary);\n    QUIT_IF(ret != ErrorCode::PLANNING_OK && ret != ErrorCode::PLANNING_SKIP,\n            ret, Level::X_ERROR,\n            \"Failed to get_params since map_main_decision_stop error.\");\n    obs_boundary->back().set_id(\"main decision stop\");\n  } else if (main_decision.has_change_lane()) {\n    if (main_decision.change_lane().has_default_lane_stop()) {\n      ret = map_main_decision_stop(\n          main_decision.change_lane().default_lane_stop(),\n          processed_data_proxy.default_reference_line_raw(), planning_distance,\n          planning_time, obs_boundary);\n      QUIT_IF(ret != ErrorCode::PLANNING_OK && ret != ErrorCode::PLANNING_SKIP,\n              ret, Level::X_ERROR,\n              \"Fail to get_params due to map default lane stop error.\");\n      obs_boundary->back().set_id(\"default_lane stop\");\n    }\n    if (main_decision.change_lane().has_target_lane_stop()) {\n      ret = map_main_decision_stop(\n          main_decision.change_lane().target_lane_stop(),\n          processed_data_proxy.target_reference_line_raw(), planning_distance,\n          planning_time, obs_boundary);\n      QUIT_IF(ret != ErrorCode::PLANNING_OK && ret != ErrorCode::PLANNING_SKIP,\n              ret, Level::X_ERROR,\n              \"Fail to get_params due to map target lane stop error.\");\n      obs_boundary->back().set_id(\"target_lane stop\");\n    }\n  } else if (main_decision.has_mission_complete()) {\n    ret = map_main_decision_mission_complete(\n        processed_data_proxy.target_reference_line_raw(), planning_distance,\n        planning_time, obs_boundary);\n    QUIT_IF(ret != ErrorCode::PLANNING_OK && ret != ErrorCode::PLANNING_SKIP,\n            ret, Level::X_ERROR,\n            \"Failed to get_params since map_mission_complete error.\");\n  }\n  *\/\n\n  const auto& static_obs_vec = decision_data.StaticObstacles();\n  for (const auto* obs : static_obs_vec) {\n    if (obs == nullptr) {\n      continue;\n    }\n    ErrorCode err = map_obstacle_without_trajectory(\n        initial_planning_point, *obs, path_data, planning_distance,\n        planning_time, obs_boundary);\n    if (err != ErrorCode::PLANNING_OK) {\n      AERROR << \"Fail to map static obstacle with id[\" << obs->Id() << \"].\";\n      return ErrorCode::PLANNING_ERROR_FAILED;\n    }\n  }\n\n  const auto& dynamic_obs_vec = decision_data.DynamicObstacles();\n  for (const auto* obs : dynamic_obs_vec) {\n    if (obs == nullptr) {\n      continue;\n    }\n    for (auto& obj_decision : obs->Decisions()) {\n      if (obj_decision.has_follow()) {\n        ErrorCode err = map_obstacle_with_planning(initial_planning_point, *obs,\n                                                   path_data, planning_distance,\n                                                   planning_time, obs_boundary);\n        if (err != ErrorCode::PLANNING_OK) {\n          AERROR << \"Fail to map follow dynamic obstacle with id \" << obs->Id()\n                 << \".\";\n          return ErrorCode::PLANNING_ERROR_FAILED;\n        }\n      } else if (obj_decision.has_overtake() || obj_decision.has_yield()) {\n        ErrorCode err = map_obstacle_with_prediction_trajectory(\n            initial_planning_point, *obs, obj_decision, path_data,\n            planning_distance, planning_time, obs_boundary);\n        if (err != ErrorCode::PLANNING_OK) {\n          AERROR << \"Fail to map dynamic obstacle with id \" << obs->Id() << \".\";\n          return ErrorCode::PLANNING_OK;\n        }\n      }\n    }\n  }\n  return ErrorCode::PLANNING_OK;\n}\n\nErrorCode QPSplineSTBoundaryMapper::map_obstacle_with_planning(\n    const common::TrajectoryPoint& initial_planning_point,\n    const Obstacle& obstacle, const PathData& path_data,\n    const double planning_distance, const double planning_time,\n    std::vector<STGraphBoundary>* const boundary) const {\n  return ErrorCode::PLANNING_OK;\n}\n\nErrorCode QPSplineSTBoundaryMapper::map_obstacle_with_prediction_trajectory(\n    const common::TrajectoryPoint& initial_planning_point,\n    const Obstacle& obstacle, const ObjectDecisionType obj_decision,\n    const PathData& path_data, const double planning_distance,\n    const double planning_time,\n    std::vector<STGraphBoundary>* const boundary) const {\n  std::vector<STPoint> lower_points;\n  std::vector<STPoint> upper_points;\n\n  const double speed = obstacle.Speed();\n  const double minimal_follow_time = st_boundary_config().minimal_follow_time();\n  double follow_distance = -1.0;\n  if (obj_decision.has_follow()) {\n    follow_distance = std::fmax(speed * minimal_follow_time,\n                                std::fabs(obj_decision.follow().distance_s())) +\n                      vehicle_param().front_edge_to_center();\n  }\n\n  bool skip = true;\n  std::vector<STPoint> boundary_points;\n  const auto& adc_path_points = path_data.path().path_points();\n  if (obstacle.prediction_trajectories().size() == 0) {\n    AWARN << \"Obstacle (id = \" << obstacle.Id()\n          << \") has NO prediction trajectory.\";\n  }\n\n  for (uint32_t i = 0; i < obstacle.prediction_trajectories().size(); ++i) {\n    const auto& trajectory = obstacle.prediction_trajectories()[i];\n    for (uint32_t j = 0; j < trajectory.num_of_points(); ++i) {\n      const auto& trajectory_point = trajectory.trajectory_point_at(j);\n      \/\/ TODO: fix trajectory point relative time issue.\n      double trajectory_point_time =\n          trajectory_point.relative_time() +\n          trajectory.start_timestamp();  \/\/ -curr_timestamp.\n      const Box2d obs_box(\n          Vec2d(trajectory_point.path_point().x(),\n                trajectory_point.path_point().y()),\n          trajectory_point.path_point().theta(),\n          obstacle.Length() * st_boundary_config().expending_coeff(),\n          obstacle.Width() * st_boundary_config().expending_coeff());\n      int64_t low = 0;\n      int64_t high = static_cast<int64_t>(path_data.path().num_of_points()) - 1;\n      bool find_low = false;\n      bool find_high = false;\n      while (low < high) {\n        if (find_low && find_high) {\n          break;\n        }\n        if (!find_low) {\n          if (!check_overlap(adc_path_points[low], vehicle_param(), obs_box,\n                             st_boundary_config().boundary_buffer())) {\n            ++low;\n          } else {\n            find_low = true;\n          }\n        }\n        if (!find_high) {\n          if (!check_overlap(adc_path_points[high], vehicle_param(), obs_box,\n                             st_boundary_config().boundary_buffer())) {\n            --high;\n          } else {\n            find_high = true;\n          }\n        }\n      }\n      if (find_high && find_low) {\n        lower_points.emplace_back(\n            adc_path_points[low].s() - st_boundary_config().point_extension(),\n            trajectory_point_time);\n        upper_points.emplace_back(\n            adc_path_points[high].s() + st_boundary_config().point_extension(),\n            trajectory_point_time);\n      } else {\n        if (obj_decision.has_yield() || obj_decision.has_overtake()) {\n          AINFO << \"Point[\" << j << \"] cannot find low or high index.\";\n        }\n      }\n\n      if (lower_points.size() > 0) {\n        boundary_points.clear();\n        const double buffer = st_boundary_config().follow_buffer();\n        boundary_points.emplace_back(lower_points.at(0).s() - buffer,\n                                     lower_points.at(0).t());\n        boundary_points.emplace_back(lower_points.back().s() - buffer,\n                                     lower_points.back().t());\n        boundary_points.emplace_back(upper_points.back().s() + buffer +\n                                         st_boundary_config().boundary_buffer(),\n                                     upper_points.back().t());\n        boundary_points.emplace_back(upper_points.at(0).s() + buffer,\n                                     upper_points.at(0).t());\n        if (lower_points.at(0).t() > lower_points.back().t() ||\n            upper_points.at(0).t() > upper_points.back().t()) {\n          AWARN << \"lower\/upper points are reversed.\";\n        }\n\n        \/\/ change boundary according to obj_decision.\n        STGraphBoundary::BoundaryType b_type =\n            STGraphBoundary::BoundaryType::UNKNOWN;\n        if (obj_decision.has_follow()) {\n          boundary_points.at(0).set_s(boundary_points.at(0).s() -\n                                      follow_distance);\n          boundary_points.at(1).set_s(boundary_points.at(1).s() -\n                                      follow_distance);\n          boundary_points.at(3).set_t(-1.0);\n          b_type = STGraphBoundary::BoundaryType::FOLLOW;\n        } else if (obj_decision.has_yield()) {\n          const double dis = std::fabs(obj_decision.yield().distance_s());\n          \/\/ TODO: remove the arbitrary numbers in this part.\n          if (boundary_points.at(0).s() - dis < 0.0) {\n            boundary_points.at(0).set_s(\n                std::fmax(boundary_points.at(0).s() - 2.0, 0.0));\n          } else {\n            boundary_points.at(0).set_s(\n                std::fmax(boundary_points.at(0).s() - dis, 0.0));\n          }\n          if (boundary_points.at(1).s() - dis < 0.0) {\n            boundary_points.at(1).set_s(\n                std::fmax(boundary_points.at(0).s() - 4.0, 0.0));\n          } else {\n            boundary_points.at(1).set_s(\n                std::fmax(boundary_points.at(0).s() - dis, 0.0));\n          }\n          b_type = STGraphBoundary::BoundaryType::YIELD;\n        } else if (obj_decision.has_overtake()) {\n          const double dis = std::fabs(obj_decision.overtake().distance_s());\n          boundary_points.at(2).set_s(boundary_points.at(2).s() + dis);\n          boundary_points.at(3).set_s(boundary_points.at(3).s() + dis);\n        }\n\n        const double area = get_area(boundary_points);\n        if (Double::compare(area, 0.0) > 0) {\n          boundary->emplace_back(boundary_points);\n          boundary->back().set_boundary_type(b_type);\n          skip = false;\n        }\n      }\n    }\n  }\n  return skip ? ErrorCode::PLANNING_SKIP : ErrorCode::PLANNING_OK;\n}\n\nErrorCode QPSplineSTBoundaryMapper::map_obstacle_without_trajectory(\n    const common::TrajectoryPoint& initial_planning_point,\n    const Obstacle& obstacle, const PathData& path_data,\n    const double planning_distance, const double planning_time,\n    std::vector<STGraphBoundary>* const boundary) const {\n  return ErrorCode::PLANNING_OK;\n}\n\n}  \/\/ namespace planning\n}  \/\/ namespace apollo\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Copyright (c) 2017 offa\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 \"danek\/internal\/ToString.h\"\n#include \"danek\/internal\/ConfigItem.h\"\n#include \"danek\/internal\/ConfigScope.h\"\n#include \"danek\/internal\/UidIdentifierProcessor.h\"\n#include <sstream>\n#include <regex>\n\nnamespace danek\n{\n\n    namespace\n    {\n        std::string indent(std::size_t level)\n        {\n            constexpr std::size_t indentCount = 4;\n            return std::string(level * indentCount, ' ');\n        }\n\n        std::string escape(const std::string& str)\n        {\n            std::string output = str;\n\n            output = std::regex_replace(output, std::regex(\"%\"), \"%%\");\n            output = std::regex_replace(output, std::regex(\"\\t\"), \"%t\");\n            output = std::regex_replace(output, std::regex(\"\\n\"), \"%n\");\n            output = std::regex_replace(output, std::regex(\"\\\"\"), \"%\\\"\");\n\n            return output;\n        }\n\n\n        std::string expandUid(const std::string& name, bool expand)\n        {\n            if( expand == false )\n            {\n                UidIdentifierProcessor uidIdProc;\n                StringBuffer nameBuf;\n                return uidIdProc.unexpand(name.c_str(), nameBuf);\n            }\n            return name;\n        }\n\n    }\n\n\n    std::string toString(const ConfigItem& item, const std::string& name, bool expandUidNames, std::size_t indentLevel)\n    {\n        const std::string nameStr = expandUid(name, expandUidNames);\n        std::stringstream os;\n\n        os << indent(indentLevel);\n\n        switch(item.type())\n        {\n            case ConfType::String:\n                os << nameStr << \" = \\\"\" << escape(item.stringVal()) << \"\\\";\\n\";\n                break;\n            case ConfType::List:\n                {\n                    os << nameStr << \" = [\";\n                    const auto values = item.listVal();\n\n                    if( values.empty() == false )\n                    {\n                        using OItr = std::ostream_iterator<std::string>;\n                        const auto l = [](const auto& v) { return \"\\\"\" + escape(v) + \"\\\"\"; };\n                        std::transform(values.cbegin(), std::prev(values.cend()), OItr{os, \", \"}, l);\n                        std::transform(std::prev(values.cend()), values.cend(), OItr{os}, l);\n                    }\n\n                    os << \"];\\n\";\n                }\n                break;\n            case ConfType::Scope:\n                {\n                    os << nameStr << \" {\\n\";\n                    StringBuffer buffer;\n                    item.scopeVal()->dump(buffer, expandUidNames, indentLevel + 1);\n                    os << indent(indentLevel) << \"}\\n\";\n                }\n                break;\n            default:\n                break;\n        }\n\n        return os.str();\n    }\n\n}\n<commit_msg>Quotes are added by the escape() function; simplification possible for list transformation.<commit_after>\/\/ Copyright (c) 2017 offa\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 \"danek\/internal\/ToString.h\"\n#include \"danek\/internal\/ConfigItem.h\"\n#include \"danek\/internal\/ConfigScope.h\"\n#include \"danek\/internal\/UidIdentifierProcessor.h\"\n#include <sstream>\n#include <regex>\n\nnamespace danek\n{\n\n    namespace\n    {\n        std::string indent(std::size_t level)\n        {\n            constexpr std::size_t indentCount = 4;\n            return std::string(level * indentCount, ' ');\n        }\n\n        std::string escape(const std::string& str)\n        {\n            std::string output = str;\n\n            output = std::regex_replace(output, std::regex(\"%\"), \"%%\");\n            output = std::regex_replace(output, std::regex(\"\\t\"), \"%t\");\n            output = std::regex_replace(output, std::regex(\"\\n\"), \"%n\");\n            output = std::regex_replace(output, std::regex(\"\\\"\"), \"%\\\"\");\n\n            return \"\\\"\" + output + \"\\\"\";\n        }\n\n\n        std::string expandUid(const std::string& name, bool expand)\n        {\n            if( expand == false )\n            {\n                UidIdentifierProcessor uidIdProc;\n                StringBuffer nameBuf;\n                return uidIdProc.unexpand(name.c_str(), nameBuf);\n            }\n            return name;\n        }\n\n    }\n\n\n    std::string toString(const ConfigItem& item, const std::string& name, bool expandUidNames, std::size_t indentLevel)\n    {\n        const std::string nameStr = expandUid(name, expandUidNames);\n        std::stringstream os;\n\n        os << indent(indentLevel);\n\n        switch(item.type())\n        {\n            case ConfType::String:\n                os << nameStr << \" = \" << escape(item.stringVal()) << \";\\n\";\n                break;\n            case ConfType::List:\n                {\n                    os << nameStr << \" = [\";\n                    const auto values = item.listVal();\n\n                    if( values.empty() == false )\n                    {\n                        using OItr = std::ostream_iterator<std::string>;\n                        std::transform(values.cbegin(), std::prev(values.cend()), OItr{os, \", \"}, escape);\n                        std::transform(std::prev(values.cend()), values.cend(), OItr{os}, escape);\n                    }\n\n                    os << \"];\\n\";\n                }\n                break;\n            case ConfType::Scope:\n                {\n                    os << nameStr << \" {\\n\";\n                    StringBuffer buffer;\n                    item.scopeVal()->dump(buffer, expandUidNames, indentLevel + 1);\n                    os << indent(indentLevel) << \"}\\n\";\n                }\n                break;\n            default:\n                break;\n        }\n\n        return os.str();\n    }\n\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/---------------------------------------------------------------------------\n\/\/    $Id$\n\/\/    Version: $Name$\n\/\/\n\/\/    Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2010, 2011, 2012 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#include <deal.II\/dofs\/dof_handler.h>\n#include <deal.II\/hp\/dof_handler.h>\n\n#include <deal.II\/numerics\/vectors.templates.h>\n\nDEAL_II_NAMESPACE_OPEN\n\n\nnamespace VectorTools\n{\n\n  void\n  subtract_mean_value(Vector<double>     &v,\n                      const std::vector<bool> &p_select)\n  {\n    const unsigned int n = v.size();\n    Assert(n == p_select.size(),\n           ExcDimensionMismatch(n, p_select.size()));\n\n    double       s       = 0;\n    unsigned int counter = 0;\n\n    for (unsigned int i=0; i<n; ++i)\n      if (p_select[i])\n        {\n          s += v(i);\n          ++counter;\n        }\n    Assert (counter > 0, ExcNoComponentSelected());\n\n    s \/= counter;\n\n    for (unsigned int i=0; i<n; ++i)\n      if (p_select[i])\n        v(i) -= s;\n  }\n}\n\n\n\/\/ ---------------------------- explicit instantiations --------------------\n#include \"vector_tools.inst\"\n\n\nDEAL_II_NAMESPACE_CLOSE\n<commit_msg>Use the now correct name for a header file.<commit_after>\/\/---------------------------------------------------------------------------\n\/\/    $Id$\n\/\/    Version: $Name$\n\/\/\n\/\/    Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2010, 2011, 2012 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#include <deal.II\/dofs\/dof_handler.h>\n#include <deal.II\/hp\/dof_handler.h>\n\n#include <deal.II\/numerics\/vector_tools.templates.h>\n\nDEAL_II_NAMESPACE_OPEN\n\n\nnamespace VectorTools\n{\n\n  void\n  subtract_mean_value(Vector<double>     &v,\n                      const std::vector<bool> &p_select)\n  {\n    const unsigned int n = v.size();\n    Assert(n == p_select.size(),\n           ExcDimensionMismatch(n, p_select.size()));\n\n    double       s       = 0;\n    unsigned int counter = 0;\n\n    for (unsigned int i=0; i<n; ++i)\n      if (p_select[i])\n        {\n          s += v(i);\n          ++counter;\n        }\n    Assert (counter > 0, ExcNoComponentSelected());\n\n    s \/= counter;\n\n    for (unsigned int i=0; i<n; ++i)\n      if (p_select[i])\n        v(i) -= s;\n  }\n}\n\n\n\/\/ ---------------------------- explicit instantiations --------------------\n#include \"vector_tools.inst\"\n\n\nDEAL_II_NAMESPACE_CLOSE\n<|endoftext|>"}
{"text":"<commit_before>#ifndef RANDOM_NUMBER_GENERATORS_HPP\n#define RANDOM_NUMBER_GENERATORS_HPP\n#include <cmath>\n#include <vector>\n#include <cassert>\n#include <iostream>\n\nnamespace RandomNumberGenerators {\n\ninline float uniform()\n\/* Uniform random number generator x(n+1)= a*x(n) mod c\n\t\t\t\twith a = pow(7,5) and c = pow(2,31)-1.\n\t\t\t\tCopyright (c) Tao Pang 1997. *\/\n\t{\n\t\tconst int ia=16807,ic=2147483647,iq=127773,ir=2836;\n\t\tint il,ih,it;\n\t\tfloat rc;\n\t\tstatic int iseed = rand();\n\t\tih = iseed\/iq;\n\t\til = iseed%iq;\n\t\tit = ia*il-ir*ih;\n\t\tif (it > 0)\n\t\t{\n\t\t\tiseed = it;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tiseed = ic+it;\n\t\t}\n\t\trc = ic;\n\t\treturn iseed\/rc;\n\t}\n\ninline float gaussian(float mean, float sigma)\n{\n\n\tfloat x1, x2, w, y1, y2;\n \n\tdo {\n\t\tx1 = 2.0 * uniform() - 1.0;\n\t\tx2 = 2.0 * uniform() - 1.0;\n\t\tw = x1 * x1 + x2 * x2;\n\t} while ( w >= 1.0 );\n\n\tw = sqrt( (-2.0 * log( w ) ) \/ w );\n\ty1 = x1 * w;\n\ty2 = x2 * w;\n\t\n\tfloat ret = y1*sigma + mean;\n\n\treturn ret;\n}\n\ninline std::size_t uniformInteger(std::size_t upperBound=1) {\n\n\t\n\t\/\/\/ @bug there was a man entry about how this leads to a lousy uniform\n\t\/\/\/ @bug distribution in practice. should probably review\n\tassert(upperBound > 0);\n\treturn ((rand()) % ((int)upperBound));\n}\n\n\t\n\t\n\n\/\/\/ Randomizes from probabilistically weighted distribution. Thus,\n\/\/\/ sum of passed in weights should be 1.0\ninline std::size_t weightedRandomNormalized(std::vector<float> weights) {\n\n#ifdef WIN32\t\n    \/\/ Choose a random bounded mass between 0 and 1\n\tfloat cutoff = ((float)(rand())) \/ RAND_MAX;\n#endif \n\n#ifdef LINUX\n    \/\/ Choose a random bounded mass between 0 and 1\n\tfloat cutoff = ((float)(random())) \/ RAND_MAX;\n#endif\n\n#ifdef MACOS\n    \/\/ Choose a random bounded mass between 0 and 1\n\tfloat cutoff = ((float)(rand())) \/ RAND_MAX;\n#endif\n\n    \/\/ Sum up mass, stopping when cutoff is reached. This is the typical\n    \/\/ weighted sampling algorithm.\n\tfloat mass = 0;\n\tfor (std::size_t i = 0; i< weights.size() ; i) {\n\t\tmass += weights[i];\n\t\tif (mass >= cutoff)\n\t\t\treturn i;\n\t}\n\n    \/\/ Just in case something slips through the cracks\n\treturn weights.size()-1;\n}\n\ninline std::size_t weightedRandom(const std::vector<int> & weights, unsigned int weightTotalHint = 0) {\n\t\n\n\tif (weightTotalHint == 0)\t{\t\t\n\t\tfor (std::size_t i = 0; i < weights.size();i++) \n\t\t\tweightTotalHint += weights[i];\n\t}\n\t\n\tint sampledSum = uniformInteger(weightTotalHint);\n\tint sum = 0;\n\t\n\tfor (std::size_t i = 0; i < weights.size();i++) {\n\t\tsum += weights[i];\n\t\tif (sampledSum <= sum)\n\t\t\treturn i;\n\t}\n\treturn weights.size()-1;\n}\n\n}\n#endif\n<commit_msg>bugfix weightedRandomNormalized<commit_after>#ifndef RANDOM_NUMBER_GENERATORS_HPP\n#define RANDOM_NUMBER_GENERATORS_HPP\n#include <cmath>\n#include <vector>\n#include <cassert>\n#include <iostream>\n\nnamespace RandomNumberGenerators {\n\ninline float uniform()\n\/* Uniform random number generator x(n+1)= a*x(n) mod c\n\t\t\t\twith a = pow(7,5) and c = pow(2,31)-1.\n\t\t\t\tCopyright (c) Tao Pang 1997. *\/\n\t{\n\t\tconst int ia=16807,ic=2147483647,iq=127773,ir=2836;\n\t\tint il,ih,it;\n\t\tfloat rc;\n\t\tstatic int iseed = rand();\n\t\tih = iseed\/iq;\n\t\til = iseed%iq;\n\t\tit = ia*il-ir*ih;\n\t\tif (it > 0)\n\t\t{\n\t\t\tiseed = it;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tiseed = ic+it;\n\t\t}\n\t\trc = ic;\n\t\treturn iseed\/rc;\n\t}\n\ninline float gaussian(float mean, float sigma)\n{\n\n\tfloat x1, x2, w, y1, y2;\n \n\tdo {\n\t\tx1 = 2.0 * uniform() - 1.0;\n\t\tx2 = 2.0 * uniform() - 1.0;\n\t\tw = x1 * x1 + x2 * x2;\n\t} while ( w >= 1.0 );\n\n\tw = sqrt( (-2.0 * log( w ) ) \/ w );\n\ty1 = x1 * w;\n\ty2 = x2 * w;\n\t\n\tfloat ret = y1*sigma + mean;\n\n\treturn ret;\n}\n\ninline std::size_t uniformInteger(std::size_t upperBound=1) {\n\n\t\n\t\/\/\/ @bug there was a man entry about how this leads to a lousy uniform\n\t\/\/\/ @bug distribution in practice. should probably review\n\tassert(upperBound > 0);\n\treturn ((rand()) % ((int)upperBound));\n}\n\n\t\n\t\n\n\/\/\/ Randomizes from probabilistically weighted distribution. Thus,\n\/\/\/ sum of passed in weights should be 1.0\ninline std::size_t weightedRandomNormalized(std::vector<float> weights) {\n\n#ifdef WIN32\t\n    \/\/ Choose a random bounded mass between 0 and 1\n\tfloat cutoff = ((float)(rand())) \/ RAND_MAX;\n#endif \n\n#ifdef LINUX\n    \/\/ Choose a random bounded mass between 0 and 1\n\tfloat cutoff = ((float)(random())) \/ RAND_MAX;\n#endif\n\n#ifdef MACOS\n    \/\/ Choose a random bounded mass between 0 and 1\n\tfloat cutoff = ((float)(rand())) \/ RAND_MAX;\n#endif\n\n    \/\/ Sum up mass, stopping when cutoff is reached. This is the typical\n    \/\/ weighted sampling algorithm.\n\tfloat mass = 0;\n\tfor (std::size_t i = 0; i< weights.size() ; i++) {\n\t\tmass += weights[i];\n\t\tif (mass >= cutoff)\n\t\t\treturn i;\n\t}\n\n    \/\/ Just in case something slips through the cracks\n\treturn weights.size()-1;\n}\n\ninline std::size_t weightedRandom(const std::vector<int> & weights, unsigned int weightTotalHint = 0) {\n\t\n\n\tif (weightTotalHint == 0)\t{\t\t\n\t\tfor (std::size_t i = 0; i < weights.size();i++) \n\t\t\tweightTotalHint += weights[i];\n\t}\n\t\n\tint sampledSum = uniformInteger(weightTotalHint);\n\tint sum = 0;\n\t\n\tfor (std::size_t i = 0; i < weights.size();i++) {\n\t\tsum += weights[i];\n\t\tif (sampledSum <= sum)\n\t\t\treturn i;\n\t}\n\treturn weights.size()-1;\n}\n\n}\n#endif\n<|endoftext|>"}
{"text":"<commit_before>AliAnalysisTaskPhiCorrelations *AddTaskPhiCorrelationsCombined(Int_t analysisMode = 0, Bool_t ppRun = kFALSE, const char* outputFileName = 0, Bool_t eventMixing = kTRUE, Int_t zVtxAxis = 0, const char* containerName = \"histosPhiCorrelations\", const char* folderName = \"PWG4_PhiCorrelations\", const char* suffix = \"\")\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(\"AddTaskPhiCorrelations\", \"No analysis manager to connect to.\");\n    return NULL;\n  }  \n  \n  \/\/ Create the task and configure it.\n  \/\/===========================================================================\n  TString combinedName;\n  if(suffix!=\"\")\n    combinedName.Form(\"%s_%s\", containerName, suffix);\n  else\n    combinedName=containerName;\n  \n  AliAnalysisTaskPhiCorrelations* ana = new  AliAnalysisTaskPhiCorrelations(combinedName);\n  ana->SetMode(analysisMode);\/\/ data or corrections mode\n  \n  ana->SetDebugLevel(0); \n\n  Int_t bit = 128;\n  ana->SetFilterBit(bit);  \n  \n  Printf(\"AddTaskPhiCorrelations:\\n\\n\\n++++++++++ Using bit %d ++++++++++++\\n\\n\\n\", bit);\n  \n  ana->SetTrackEtaCut(0.9);\n\n  ana->SetPtMin(0.5);\n\n  ana->SetReduceMemoryFootprint(kTRUE);\n  \n  ana->SetEventMixing(eventMixing);\n  ana->SetUseVtxAxis(zVtxAxis);\n  \n  ana->SetZVertex(10);\n  \n  if (ppRun)\n  {\n    Printf(\"AddTaskPhiCorrelations:\\n\\n\\n+++++++++++++++ Configuring for p+p! +++++++++++++++++\\n\\n\\n\");\n    ana->SetCentralityMethod(\"\"); \/\/ only for pp\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  if (!outputFileName)\n    outputFileName = AliAnalysisManager::GetCommonFileName();\n  \n  AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(combinedName, TList::Class(),AliAnalysisManager::kOutputContainer,Form(\"%s:%s\", outputFileName, folderName));\n  \n  mgr->ConnectInput  (ana, 0, mgr->GetCommonInputContainer());\n  mgr->ConnectOutput (ana, 0, coutput1 );\n   \n  return ana;\n}\n<commit_msg>Do not reduce memory footprint in the analysis macro<commit_after>AliAnalysisTaskPhiCorrelations *AddTaskPhiCorrelationsCombined(Int_t analysisMode = 0, Bool_t ppRun = kFALSE, const char* outputFileName = 0, Bool_t eventMixing = kTRUE, Int_t zVtxAxis = 0, const char* containerName = \"histosPhiCorrelations\", const char* folderName = \"PWG4_PhiCorrelations\", const char* suffix = \"\")\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(\"AddTaskPhiCorrelations\", \"No analysis manager to connect to.\");\n    return NULL;\n  }  \n  \n  \/\/ Create the task and configure it.\n  \/\/===========================================================================\n  TString combinedName;\n  if(suffix!=\"\")\n    combinedName.Form(\"%s_%s\", containerName, suffix);\n  else\n    combinedName=containerName;\n  \n  AliAnalysisTaskPhiCorrelations* ana = new  AliAnalysisTaskPhiCorrelations(combinedName);\n  ana->SetMode(analysisMode);\/\/ data or corrections mode\n  \n  ana->SetDebugLevel(0); \n\n  Int_t bit = 128;\n  ana->SetFilterBit(bit);  \n  \n  Printf(\"AddTaskPhiCorrelations:\\n\\n\\n++++++++++ Using bit %d ++++++++++++\\n\\n\\n\", bit);\n  \n  ana->SetTrackEtaCut(0.9);\n\n  ana->SetPtMin(0.5);\n\n  \/\/ana->SetReduceMemoryFootprint(kTRUE);\n  \n  ana->SetEventMixing(eventMixing);\n  ana->SetUseVtxAxis(zVtxAxis);\n  \n  ana->SetZVertex(10);\n  \n  if (ppRun)\n  {\n    Printf(\"AddTaskPhiCorrelations:\\n\\n\\n+++++++++++++++ Configuring for p+p! +++++++++++++++++\\n\\n\\n\");\n    ana->SetCentralityMethod(\"\"); \/\/ only for pp\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  if (!outputFileName)\n    outputFileName = AliAnalysisManager::GetCommonFileName();\n  \n  AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(combinedName, TList::Class(),AliAnalysisManager::kOutputContainer,Form(\"%s:%s\", outputFileName, folderName));\n  \n  mgr->ConnectInput  (ana, 0, mgr->GetCommonInputContainer());\n  mgr->ConnectOutput (ana, 0, coutput1 );\n   \n  return ana;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Copyright (C) 2013 Google Inc. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n *     * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *     * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following disclaimer\n * in the documentation and\/or other materials provided with the\n * distribution.\n *     * Neither the name of Google Inc. nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n#include \"config.h\"\n#include \"ServiceWorkerGlobalScope.h\"\n\n#include \"bindings\/core\/v8\/ScriptPromise.h\"\n#include \"bindings\/core\/v8\/ScriptState.h\"\n#include \"bindings\/core\/v8\/V8ThrowException.h\"\n#include \"core\/events\/Event.h\"\n#include \"core\/fetch\/MemoryCache.h\"\n#include \"core\/fetch\/ResourceLoaderOptions.h\"\n#include \"core\/inspector\/ScriptCallStack.h\"\n#include \"core\/inspector\/WorkerInspectorController.h\"\n#include \"core\/loader\/ThreadableLoader.h\"\n#include \"core\/workers\/WorkerClients.h\"\n#include \"core\/workers\/WorkerThreadStartupData.h\"\n#include \"modules\/EventTargetModules.h\"\n#include \"modules\/fetch\/GlobalFetch.h\"\n#include \"modules\/serviceworkers\/CacheStorage.h\"\n#include \"modules\/serviceworkers\/InspectorServiceWorkerCacheAgent.h\"\n#include \"modules\/serviceworkers\/ServiceWorkerClients.h\"\n#include \"modules\/serviceworkers\/ServiceWorkerGlobalScopeClient.h\"\n#include \"modules\/serviceworkers\/ServiceWorkerThread.h\"\n#include \"modules\/serviceworkers\/WaitUntilObserver.h\"\n#include \"platform\/network\/ResourceRequest.h\"\n#include \"platform\/weborigin\/KURL.h\"\n#include \"public\/platform\/WebServiceWorkerSkipWaitingCallbacks.h\"\n#include \"public\/platform\/WebURL.h\"\n#include \"wtf\/CurrentTime.h\"\n\nnamespace blink {\n\nclass ServiceWorkerGlobalScope::SkipWaitingCallback final : public WebServiceWorkerSkipWaitingCallbacks {\n    WTF_MAKE_NONCOPYABLE(SkipWaitingCallback);\npublic:\n    explicit SkipWaitingCallback(PassRefPtrWillBeRawPtr<ScriptPromiseResolver> resolver)\n        : m_resolver(resolver) { }\n    ~SkipWaitingCallback() { }\n\n    void onSuccess() override\n    {\n        m_resolver->resolve();\n    }\n\nprivate:\n    RefPtrWillBePersistent<ScriptPromiseResolver> m_resolver;\n};\n\nPassRefPtrWillBeRawPtr<ServiceWorkerGlobalScope> ServiceWorkerGlobalScope::create(ServiceWorkerThread* thread, PassOwnPtrWillBeRawPtr<WorkerThreadStartupData> startupData)\n{\n    RefPtrWillBeRawPtr<ServiceWorkerGlobalScope> context = adoptRefWillBeNoop(new ServiceWorkerGlobalScope(startupData->m_scriptURL, startupData->m_userAgent, thread, monotonicallyIncreasingTime(), startupData->m_starterOrigin, startupData->m_workerClients.release()));\n\n    context->applyContentSecurityPolicyFromString(startupData->m_contentSecurityPolicy, startupData->m_contentSecurityPolicyType);\n\n    return context.release();\n}\n\nServiceWorkerGlobalScope::ServiceWorkerGlobalScope(const KURL& url, const String& userAgent, ServiceWorkerThread* thread, double timeOrigin, const SecurityOrigin* starterOrigin, PassOwnPtrWillBeRawPtr<WorkerClients> workerClients)\n    : WorkerGlobalScope(url, userAgent, thread, timeOrigin, starterOrigin, workerClients)\n    , m_didEvaluateScript(false)\n    , m_hadErrorInTopLevelEventHandler(false)\n    , m_eventNestingLevel(0)\n{\n    workerInspectorController()->registerModuleAgent(InspectorServiceWorkerCacheAgent::create(this));\n}\n\nServiceWorkerGlobalScope::~ServiceWorkerGlobalScope()\n{\n}\n\nvoid ServiceWorkerGlobalScope::didEvaluateWorkerScript()\n{\n    m_didEvaluateScript = true;\n}\n\nCacheStorage* ServiceWorkerGlobalScope::caches(ExecutionContext* context)\n{\n    if (!m_caches)\n        m_caches = CacheStorage::create(ServiceWorkerGlobalScopeClient::from(context)->cacheStorage());\n    return m_caches;\n}\n\nScriptPromise ServiceWorkerGlobalScope::fetch(ScriptState* scriptState, const RequestInfo& input, const Dictionary& init, ExceptionState& exceptionState)\n{\n    return GlobalFetch::fetch(scriptState, *this, input, init, exceptionState);\n}\n\nServiceWorkerClients* ServiceWorkerGlobalScope::clients()\n{\n    if (!m_clients)\n        m_clients = ServiceWorkerClients::create();\n    return m_clients;\n}\n\nvoid ServiceWorkerGlobalScope::close(ExceptionState& exceptionState)\n{\n    exceptionState.throwDOMException(InvalidAccessError, \"Not supported.\");\n}\n\nScriptPromise ServiceWorkerGlobalScope::skipWaiting(ScriptState* scriptState)\n{\n    RefPtrWillBeRawPtr<ScriptPromiseResolver> resolver = ScriptPromiseResolver::create(scriptState);\n    ScriptPromise promise = resolver->promise();\n\n    ExecutionContext* executionContext = scriptState->executionContext();\n    ServiceWorkerGlobalScopeClient::from(executionContext)->skipWaiting(new SkipWaitingCallback(resolver));\n    return promise;\n}\n\nbool ServiceWorkerGlobalScope::addEventListener(const AtomicString& eventType, PassRefPtr<EventListener> listener, bool useCapture)\n{\n    if (m_didEvaluateScript) {\n        if (eventType == EventTypeNames::install) {\n            RefPtrWillBeRawPtr<ConsoleMessage> consoleMessage = ConsoleMessage::create(JSMessageSource, WarningMessageLevel, \"Event handler of 'install' event must be added on the initial evaluation of worker script.\");\n            addMessageToWorkerConsole(consoleMessage.release());\n        } else if (eventType == EventTypeNames::activate) {\n            RefPtrWillBeRawPtr<ConsoleMessage> consoleMessage = ConsoleMessage::create(JSMessageSource, WarningMessageLevel, \"Event handler of 'activate' event must be added on the initial evaluation of worker script.\");\n            addMessageToWorkerConsole(consoleMessage.release());\n        }\n    }\n    return WorkerGlobalScope::addEventListener(eventType, listener, useCapture);\n}\n\nconst AtomicString& ServiceWorkerGlobalScope::interfaceName() const\n{\n    return EventTargetNames::ServiceWorkerGlobalScope;\n}\n\nbool ServiceWorkerGlobalScope::dispatchEvent(PassRefPtrWillBeRawPtr<Event> event)\n{\n    m_eventNestingLevel++;\n    bool result = WorkerGlobalScope::dispatchEvent(event.get());\n    if (event->interfaceName() == EventNames::ErrorEvent && m_eventNestingLevel == 2 && !event->defaultPrevented())\n        m_hadErrorInTopLevelEventHandler = true;\n    m_eventNestingLevel--;\n    return result;\n}\n\nvoid ServiceWorkerGlobalScope::dispatchExtendableEvent(PassRefPtrWillBeRawPtr<Event> event, WaitUntilObserver* observer)\n{\n    ASSERT(m_eventNestingLevel == 0);\n    m_hadErrorInTopLevelEventHandler = false;\n\n    observer->willDispatchEvent();\n    dispatchEvent(event);\n    observer->didDispatchEvent(m_hadErrorInTopLevelEventHandler);\n}\n\nvoid ServiceWorkerGlobalScope::trace(Visitor* visitor)\n{\n    visitor->trace(m_clients);\n    visitor->trace(m_caches);\n    WorkerGlobalScope::trace(visitor);\n}\n\nvoid ServiceWorkerGlobalScope::importScripts(const Vector<String>& urls, ExceptionState& exceptionState)\n{\n    \/\/ Bust the MemoryCache to ensure script requests reach the browser-side\n    \/\/ and get added to and retrieved from the ServiceWorker's script cache.\n    \/\/ FIXME: Revisit in light of the solution to crbug\/388375.\n    for (Vector<String>::const_iterator it = urls.begin(); it != urls.end(); ++it)\n        MemoryCache::removeURLFromCache(this->executionContext(), completeURL(*it));\n    WorkerGlobalScope::importScripts(urls, exceptionState);\n}\n\nvoid ServiceWorkerGlobalScope::logExceptionToConsole(const String& errorMessage, int scriptId, const String& sourceURL, int lineNumber, int columnNumber, PassRefPtrWillBeRawPtr<ScriptCallStack> callStack)\n{\n    WorkerGlobalScope::logExceptionToConsole(errorMessage, scriptId, sourceURL, lineNumber, columnNumber, callStack);\n    RefPtrWillBeRawPtr<ConsoleMessage> consoleMessage = ConsoleMessage::create(JSMessageSource, ErrorMessageLevel, errorMessage, sourceURL, lineNumber);\n    consoleMessage->setScriptId(scriptId);\n    consoleMessage->setCallStack(callStack);\n    addMessageToWorkerConsole(consoleMessage.release());\n}\n\n} \/\/ namespace blink\n<commit_msg>ServiceWorker: Add null check of ExecutionContext in skipWaiting.<commit_after>\/*\n * Copyright (C) 2013 Google Inc. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n *     * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *     * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following disclaimer\n * in the documentation and\/or other materials provided with the\n * distribution.\n *     * Neither the name of Google Inc. nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n#include \"config.h\"\n#include \"ServiceWorkerGlobalScope.h\"\n\n#include \"bindings\/core\/v8\/ScriptPromise.h\"\n#include \"bindings\/core\/v8\/ScriptState.h\"\n#include \"bindings\/core\/v8\/V8ThrowException.h\"\n#include \"core\/events\/Event.h\"\n#include \"core\/fetch\/MemoryCache.h\"\n#include \"core\/fetch\/ResourceLoaderOptions.h\"\n#include \"core\/inspector\/ScriptCallStack.h\"\n#include \"core\/inspector\/WorkerInspectorController.h\"\n#include \"core\/loader\/ThreadableLoader.h\"\n#include \"core\/workers\/WorkerClients.h\"\n#include \"core\/workers\/WorkerThreadStartupData.h\"\n#include \"modules\/EventTargetModules.h\"\n#include \"modules\/fetch\/GlobalFetch.h\"\n#include \"modules\/serviceworkers\/CacheStorage.h\"\n#include \"modules\/serviceworkers\/InspectorServiceWorkerCacheAgent.h\"\n#include \"modules\/serviceworkers\/ServiceWorkerClients.h\"\n#include \"modules\/serviceworkers\/ServiceWorkerGlobalScopeClient.h\"\n#include \"modules\/serviceworkers\/ServiceWorkerThread.h\"\n#include \"modules\/serviceworkers\/WaitUntilObserver.h\"\n#include \"platform\/network\/ResourceRequest.h\"\n#include \"platform\/weborigin\/KURL.h\"\n#include \"public\/platform\/WebServiceWorkerSkipWaitingCallbacks.h\"\n#include \"public\/platform\/WebURL.h\"\n#include \"wtf\/CurrentTime.h\"\n\nnamespace blink {\n\nclass ServiceWorkerGlobalScope::SkipWaitingCallback final : public WebServiceWorkerSkipWaitingCallbacks {\n    WTF_MAKE_NONCOPYABLE(SkipWaitingCallback);\npublic:\n    explicit SkipWaitingCallback(PassRefPtrWillBeRawPtr<ScriptPromiseResolver> resolver)\n        : m_resolver(resolver) { }\n    ~SkipWaitingCallback() { }\n\n    void onSuccess() override\n    {\n        m_resolver->resolve();\n    }\n\nprivate:\n    RefPtrWillBePersistent<ScriptPromiseResolver> m_resolver;\n};\n\nPassRefPtrWillBeRawPtr<ServiceWorkerGlobalScope> ServiceWorkerGlobalScope::create(ServiceWorkerThread* thread, PassOwnPtrWillBeRawPtr<WorkerThreadStartupData> startupData)\n{\n    RefPtrWillBeRawPtr<ServiceWorkerGlobalScope> context = adoptRefWillBeNoop(new ServiceWorkerGlobalScope(startupData->m_scriptURL, startupData->m_userAgent, thread, monotonicallyIncreasingTime(), startupData->m_starterOrigin, startupData->m_workerClients.release()));\n\n    context->applyContentSecurityPolicyFromString(startupData->m_contentSecurityPolicy, startupData->m_contentSecurityPolicyType);\n\n    return context.release();\n}\n\nServiceWorkerGlobalScope::ServiceWorkerGlobalScope(const KURL& url, const String& userAgent, ServiceWorkerThread* thread, double timeOrigin, const SecurityOrigin* starterOrigin, PassOwnPtrWillBeRawPtr<WorkerClients> workerClients)\n    : WorkerGlobalScope(url, userAgent, thread, timeOrigin, starterOrigin, workerClients)\n    , m_didEvaluateScript(false)\n    , m_hadErrorInTopLevelEventHandler(false)\n    , m_eventNestingLevel(0)\n{\n    workerInspectorController()->registerModuleAgent(InspectorServiceWorkerCacheAgent::create(this));\n}\n\nServiceWorkerGlobalScope::~ServiceWorkerGlobalScope()\n{\n}\n\nvoid ServiceWorkerGlobalScope::didEvaluateWorkerScript()\n{\n    m_didEvaluateScript = true;\n}\n\nCacheStorage* ServiceWorkerGlobalScope::caches(ExecutionContext* context)\n{\n    if (!m_caches)\n        m_caches = CacheStorage::create(ServiceWorkerGlobalScopeClient::from(context)->cacheStorage());\n    return m_caches;\n}\n\nScriptPromise ServiceWorkerGlobalScope::fetch(ScriptState* scriptState, const RequestInfo& input, const Dictionary& init, ExceptionState& exceptionState)\n{\n    return GlobalFetch::fetch(scriptState, *this, input, init, exceptionState);\n}\n\nServiceWorkerClients* ServiceWorkerGlobalScope::clients()\n{\n    if (!m_clients)\n        m_clients = ServiceWorkerClients::create();\n    return m_clients;\n}\n\nvoid ServiceWorkerGlobalScope::close(ExceptionState& exceptionState)\n{\n    exceptionState.throwDOMException(InvalidAccessError, \"Not supported.\");\n}\n\nScriptPromise ServiceWorkerGlobalScope::skipWaiting(ScriptState* scriptState)\n{\n    ExecutionContext* executionContext = scriptState->executionContext();\n    \/\/ FIXME: short-term fix, see details at: https:\/\/codereview.chromium.org\/535193002\/.\n    if (!executionContext)\n        return ScriptPromise();\n\n    RefPtrWillBeRawPtr<ScriptPromiseResolver> resolver = ScriptPromiseResolver::create(scriptState);\n    ScriptPromise promise = resolver->promise();\n\n    ServiceWorkerGlobalScopeClient::from(executionContext)->skipWaiting(new SkipWaitingCallback(resolver));\n    return promise;\n}\n\nbool ServiceWorkerGlobalScope::addEventListener(const AtomicString& eventType, PassRefPtr<EventListener> listener, bool useCapture)\n{\n    if (m_didEvaluateScript) {\n        if (eventType == EventTypeNames::install) {\n            RefPtrWillBeRawPtr<ConsoleMessage> consoleMessage = ConsoleMessage::create(JSMessageSource, WarningMessageLevel, \"Event handler of 'install' event must be added on the initial evaluation of worker script.\");\n            addMessageToWorkerConsole(consoleMessage.release());\n        } else if (eventType == EventTypeNames::activate) {\n            RefPtrWillBeRawPtr<ConsoleMessage> consoleMessage = ConsoleMessage::create(JSMessageSource, WarningMessageLevel, \"Event handler of 'activate' event must be added on the initial evaluation of worker script.\");\n            addMessageToWorkerConsole(consoleMessage.release());\n        }\n    }\n    return WorkerGlobalScope::addEventListener(eventType, listener, useCapture);\n}\n\nconst AtomicString& ServiceWorkerGlobalScope::interfaceName() const\n{\n    return EventTargetNames::ServiceWorkerGlobalScope;\n}\n\nbool ServiceWorkerGlobalScope::dispatchEvent(PassRefPtrWillBeRawPtr<Event> event)\n{\n    m_eventNestingLevel++;\n    bool result = WorkerGlobalScope::dispatchEvent(event.get());\n    if (event->interfaceName() == EventNames::ErrorEvent && m_eventNestingLevel == 2 && !event->defaultPrevented())\n        m_hadErrorInTopLevelEventHandler = true;\n    m_eventNestingLevel--;\n    return result;\n}\n\nvoid ServiceWorkerGlobalScope::dispatchExtendableEvent(PassRefPtrWillBeRawPtr<Event> event, WaitUntilObserver* observer)\n{\n    ASSERT(m_eventNestingLevel == 0);\n    m_hadErrorInTopLevelEventHandler = false;\n\n    observer->willDispatchEvent();\n    dispatchEvent(event);\n    observer->didDispatchEvent(m_hadErrorInTopLevelEventHandler);\n}\n\nvoid ServiceWorkerGlobalScope::trace(Visitor* visitor)\n{\n    visitor->trace(m_clients);\n    visitor->trace(m_caches);\n    WorkerGlobalScope::trace(visitor);\n}\n\nvoid ServiceWorkerGlobalScope::importScripts(const Vector<String>& urls, ExceptionState& exceptionState)\n{\n    \/\/ Bust the MemoryCache to ensure script requests reach the browser-side\n    \/\/ and get added to and retrieved from the ServiceWorker's script cache.\n    \/\/ FIXME: Revisit in light of the solution to crbug\/388375.\n    for (Vector<String>::const_iterator it = urls.begin(); it != urls.end(); ++it)\n        MemoryCache::removeURLFromCache(this->executionContext(), completeURL(*it));\n    WorkerGlobalScope::importScripts(urls, exceptionState);\n}\n\nvoid ServiceWorkerGlobalScope::logExceptionToConsole(const String& errorMessage, int scriptId, const String& sourceURL, int lineNumber, int columnNumber, PassRefPtrWillBeRawPtr<ScriptCallStack> callStack)\n{\n    WorkerGlobalScope::logExceptionToConsole(errorMessage, scriptId, sourceURL, lineNumber, columnNumber, callStack);\n    RefPtrWillBeRawPtr<ConsoleMessage> consoleMessage = ConsoleMessage::create(JSMessageSource, ErrorMessageLevel, errorMessage, sourceURL, lineNumber);\n    consoleMessage->setScriptId(scriptId);\n    consoleMessage->setCallStack(callStack);\n    addMessageToWorkerConsole(consoleMessage.release());\n}\n\n} \/\/ namespace blink\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\n#include <osgParticle\/ParticleEffect>\n#include <osgParticle\/ParticleSystemUpdater>\n#include <osg\/Geode>\n\nusing namespace osgParticle;\n\nParticleEffect::ParticleEffect(const ParticleEffect& copy, const osg::CopyOp& copyop):\n    osg::Group(copy,copyop),\/*,\n    _particleSystem(copy._particleSystem.valid()?copy._particleSystem->clone():0)*\/\n    _useLocalParticleSystem(copy._useLocalParticleSystem),\n    _defaultParticleTemplate(copy._defaultParticleTemplate),\n    _position(copy._position),\n    _scale(copy._scale),\n    _intensity(copy._intensity),\n    _startTime(copy._startTime),\n    _emitterDuration(copy._emitterDuration),\n    _wind(copy._wind)\n{\n}\n\nvoid ParticleEffect::setUseLocalParticleSystem(bool local)\n{\n    if (_useLocalParticleSystem==local) return;\n    \n    _useLocalParticleSystem = local;\n    buildEffect();\n}\n\nvoid ParticleEffect::setDefaultParticleTemplate(const Particle& p)\n{\n    _defaultParticleTemplate = p;\n    setUpEmitterAndProgram();\n}\n\nvoid ParticleEffect::setPosition(const osg::Vec3& position)\n{\n    if (_position==position) return;\n\n    _position = position;\n    setUpEmitterAndProgram();\n}\n\nvoid ParticleEffect::setScale(float scale)\n{\n    if (_scale==scale) return;\n\n    _scale = scale;\n    setUpEmitterAndProgram();\n}\n\nvoid ParticleEffect::setIntensity(float intensity)\n{\n    if (_intensity==intensity) return;\n\n    _intensity = intensity;\n    setUpEmitterAndProgram();\n}\n\nvoid ParticleEffect::setStartTime(double startTime)\n{\n    if (_startTime==startTime) return;\n    \n    _startTime =startTime;\n    setUpEmitterAndProgram();\n}\n\nvoid ParticleEffect::setEmitterDuration(double duration)\n{\n    if (_emitterDuration==duration) return;\n\n    _emitterDuration = duration;\n    setUpEmitterAndProgram();\n}\n\nvoid ParticleEffect::setParticleDuration(double duration)\n{\n    if (_defaultParticleTemplate.getLifeTime()==duration) return;\n\n    _defaultParticleTemplate.setLifeTime(duration);\n    \n    setUpEmitterAndProgram();\n}\n\nvoid ParticleEffect::setWind(const osg::Vec3& wind)\n{\n    if (_wind==wind) return;\n\n    _wind = wind;\n    setUpEmitterAndProgram();\n}\n\nvoid ParticleEffect::setParticleSystem(ParticleSystem* ps)\n{\n    if (_particleSystem==ps) return;\n    \n    _particleSystem = ps;\n    buildEffect();\n}\n\nvoid ParticleEffect::setDefaults()\n{\n    _useLocalParticleSystem = true;\n    _scale = 1.0f;\n    _intensity = 1.0f;\n    _startTime = 0.0;\n    _emitterDuration = 1.0;\n    _wind.set(0.0f,0.0f,0.0f);\n}\n\nvoid ParticleEffect::buildEffect()\n{\n    setUpEmitterAndProgram();\n\n    Emitter* emitter = getEmitter();\n    Program* program = getProgram();\n    ParticleSystem* particleSystem = getParticleSystem();\n\n    if (!emitter || !particleSystem || !program) return; \n\n\n    \/\/ clear the children.\n    removeChild(0,getNumChildren());\n    \n    \/\/ add the emitter\n    addChild(emitter);\n    \n    \/\/ add the program to update the particles\n    addChild(program);\n\n    \/\/ add the particle system updater.\n    osgParticle::ParticleSystemUpdater *psu = new osgParticle::ParticleSystemUpdater;\n    psu->addParticleSystem(particleSystem);\n    addChild(psu);\n\n    if (_useLocalParticleSystem)\n    {\n        \/\/ add the geode to the scene graph\n        osg::Geode *geode = new osg::Geode;\n        geode->addDrawable(particleSystem);\n        addChild(geode);\n    }\n}\n\n<commit_msg>Added setTextureFileName method.<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\n#include <osgParticle\/ParticleEffect>\n#include <osgParticle\/ParticleSystemUpdater>\n#include <osg\/Geode>\n\nusing namespace osgParticle;\n\nParticleEffect::ParticleEffect(const ParticleEffect& copy, const osg::CopyOp& copyop):\n    osg::Group(copy,copyop),\/*,\n    _particleSystem(copy._particleSystem.valid()?copy._particleSystem->clone():0)*\/\n    _useLocalParticleSystem(copy._useLocalParticleSystem),\n    _defaultParticleTemplate(copy._defaultParticleTemplate),\n    _position(copy._position),\n    _scale(copy._scale),\n    _intensity(copy._intensity),\n    _startTime(copy._startTime),\n    _emitterDuration(copy._emitterDuration),\n    _wind(copy._wind)\n{\n}\n\nvoid ParticleEffect::setUseLocalParticleSystem(bool local)\n{\n    if (_useLocalParticleSystem==local) return;\n    \n    _useLocalParticleSystem = local;\n    buildEffect();\n}\n\nvoid ParticleEffect::setTextureFileName(const std::string& filename)\n{\n    _textureFileName = filename;\n    setUpEmitterAndProgram();\n}\n\nvoid ParticleEffect::setDefaultParticleTemplate(const Particle& p)\n{\n    _defaultParticleTemplate = p;\n    setUpEmitterAndProgram();\n}\n\nvoid ParticleEffect::setPosition(const osg::Vec3& position)\n{\n    if (_position==position) return;\n\n    _position = position;\n    setUpEmitterAndProgram();\n}\n\nvoid ParticleEffect::setScale(float scale)\n{\n    if (_scale==scale) return;\n\n    _scale = scale;\n    setUpEmitterAndProgram();\n}\n\nvoid ParticleEffect::setIntensity(float intensity)\n{\n    if (_intensity==intensity) return;\n\n    _intensity = intensity;\n    setUpEmitterAndProgram();\n}\n\nvoid ParticleEffect::setStartTime(double startTime)\n{\n    if (_startTime==startTime) return;\n    \n    _startTime =startTime;\n    setUpEmitterAndProgram();\n}\n\nvoid ParticleEffect::setEmitterDuration(double duration)\n{\n    if (_emitterDuration==duration) return;\n\n    _emitterDuration = duration;\n    setUpEmitterAndProgram();\n}\n\nvoid ParticleEffect::setParticleDuration(double duration)\n{\n    if (_defaultParticleTemplate.getLifeTime()==duration) return;\n\n    _defaultParticleTemplate.setLifeTime(duration);\n    \n    setUpEmitterAndProgram();\n}\n\nvoid ParticleEffect::setWind(const osg::Vec3& wind)\n{\n    if (_wind==wind) return;\n\n    _wind = wind;\n    setUpEmitterAndProgram();\n}\n\nvoid ParticleEffect::setParticleSystem(ParticleSystem* ps)\n{\n    if (_particleSystem==ps) return;\n    \n    _particleSystem = ps;\n    buildEffect();\n}\n\nvoid ParticleEffect::setDefaults()\n{\n    _useLocalParticleSystem = true;\n    _scale = 1.0f;\n    _intensity = 1.0f;\n    _startTime = 0.0;\n    _emitterDuration = 1.0;\n    _wind.set(0.0f,0.0f,0.0f);\n}\n\nvoid ParticleEffect::buildEffect()\n{\n    setUpEmitterAndProgram();\n\n    Emitter* emitter = getEmitter();\n    Program* program = getProgram();\n    ParticleSystem* particleSystem = getParticleSystem();\n\n    if (!emitter || !particleSystem || !program) return; \n\n\n    \/\/ clear the children.\n    removeChild(0,getNumChildren());\n    \n    \/\/ add the emitter\n    addChild(emitter);\n    \n    \/\/ add the program to update the particles\n    addChild(program);\n\n    \/\/ add the particle system updater.\n    osgParticle::ParticleSystemUpdater *psu = new osgParticle::ParticleSystemUpdater;\n    psu->addParticleSystem(particleSystem);\n    addChild(psu);\n\n    if (_useLocalParticleSystem)\n    {\n        \/\/ add the geode to the scene graph\n        osg::Geode *geode = new osg::Geode;\n        geode->addDrawable(particleSystem);\n        addChild(geode);\n    }\n}\n\n<|endoftext|>"}
{"text":"<commit_before>\n#include <fstream>\n#include <iostream>\n#include <sstream>\n#include <string>\nusing namespace std;\n\n#include <unistd.h> \/\/ sleep\n\nfloat cpu_percentage()\n{\n  string stat_line;\n  size_t line_start_pos;\n  size_t line_end_pos;\n  unsigned long long current_user;\n  unsigned long long current_system;\n  unsigned long long current_nice;\n  unsigned long long current_idle;\n  unsigned long long next_user;\n  unsigned long long next_system;\n  unsigned long long next_nice;\n  unsigned long long next_idle;\n  unsigned long long diff_user;\n  unsigned long long diff_system;\n  unsigned long long diff_nice;\n  unsigned long long diff_idle;\n  istringstream iss;\n\n  ifstream stat_file(\"\/proc\/stat\");\n  getline(stat_file, stat_line);\n  stat_file.close();\n\n  \/\/ skip \"cpu\"\n  line_start_pos = stat_line.find_first_not_of(\" \", 3);\n  line_end_pos = stat_line.find_first_of(' ', line_start_pos);\n  line_end_pos = stat_line.find_first_of(' ', line_end_pos + 1);\n  line_end_pos = stat_line.find_first_of(' ', line_end_pos + 1);\n  line_end_pos = stat_line.find_first_of(' ', line_end_pos + 1);\n\n  iss.str( stat_line.substr( line_start_pos, line_end_pos - line_start_pos ) );\n  iss >> current_user >> current_nice >> current_system >> current_idle;\n  iss.clear();\n\n  sleep(1);\n\n  stat_file.open(\"\/proc\/stat\");\n  getline(stat_file, stat_line);\n  stat_file.close();\n\n  \/\/ skip \"cpu\"\n  line_start_pos = stat_line.find_first_not_of(\" \", 3);\n  line_end_pos = stat_line.find_first_of(' ', line_start_pos);\n  line_end_pos = stat_line.find_first_of(' ', line_end_pos + 1);\n  line_end_pos = stat_line.find_first_of(' ', line_end_pos + 1);\n  line_end_pos = stat_line.find_first_of(' ', line_end_pos + 1);\n\n  iss.str( stat_line.substr( line_start_pos, line_end_pos - line_start_pos ) );\n  iss >> next_user >> next_nice >> next_system >> next_idle;\n  iss.clear();\n\n  diff_user   = next_user - current_user;\n  diff_system = next_system - current_system;\n  diff_nice   = next_nice - current_nice;\n  diff_idle   = next_idle - current_idle;\n\n  return static_cast<float>(diff_user + diff_system + diff_nice)\/static_cast<float>(diff_user + diff_system + diff_nice + diff_idle)*100.0;\n}\n\nstring cpu_string()\n{\n  string meter = \"[          ]\";\n  int meter_count = 0;\n  float percentage;\n  ostringstream oss;\n  oss.precision( 1 );\n  oss.setf( ios::fixed | ios::right );\n\n  percentage = cpu_percentage();\n  meter_count = 1;\n  while(meter_count*9.99 < percentage)\n    {\n    meter[meter_count] = '|';\n    meter_count++;\n    }\n\n  oss << meter;\n  oss.width( 5 );\n  oss << percentage;\n  oss << \"%\";\n\n  return oss.str();\n}\n\nstring mem_string()\n{\n  unsigned int total_mem;\n  unsigned int used_mem;\n  unsigned int unused_mem;\n  size_t line_start_pos;\n  size_t line_end_pos;\n  istringstream iss;\n  ostringstream oss;\n  string mem_line;\n\n  ifstream meminfo_file( \"\/proc\/meminfo\" );\n  getline( meminfo_file, mem_line );\n  line_start_pos = mem_line.find_first_of( ':' );\n  line_start_pos++;\n  line_end_pos = mem_line.find_first_of( 'k' );\n  iss.str( mem_line.substr( line_start_pos, line_end_pos - line_start_pos ) );\n  iss >> total_mem;\n\n  used_mem = total_mem;\n\n  for( unsigned int i = 0; i < 3; i++ )\n    {\n    getline( meminfo_file, mem_line );\n    line_start_pos = mem_line.find_first_of( ':' );\n    line_start_pos++;\n    line_end_pos = mem_line.find_first_of( 'k' );\n    iss.str( mem_line.substr( line_start_pos, line_end_pos - line_start_pos ) );\n    iss >> unused_mem;\n    used_mem -= unused_mem;\n    }\n  meminfo_file.close();\n\n  oss << used_mem \/ 1024 << '\/' << total_mem \/ 1024 << \"MB\";\n\n  return oss.str();\n}\n\nstring load_string()\n{\n  ifstream loadavg_file( \"\/proc\/loadavg\" );\n  string load_line;\n  getline( loadavg_file, load_line );\n  loadavg_file.close();\n\n  return load_line.substr( 0, 14 );\n}\n\nint main(int argc, char** argv)\n{\n  try\n  {\n  std::cout << mem_string() << ' ' << cpu_string() << ' ' << load_string();\n  }\n  catch(const exception &e)\n  {\n    cerr << \"Error: \" << e.what() << endl;\n    return 1;\n  }\n  \n  return 0;\n}\n\n<commit_msg>Make cpu usage timing interval user option.<commit_after>\n#include <fstream>\n#include <iostream>\n#include <sstream>\n#include <string>\nusing namespace std;\n\n#include <unistd.h> \/\/ sleep\n\nfloat cpu_percentage( unsigned int cpu_usage_delay )\n{\n  string stat_line;\n  size_t line_start_pos;\n  size_t line_end_pos;\n  unsigned long long current_user;\n  unsigned long long current_system;\n  unsigned long long current_nice;\n  unsigned long long current_idle;\n  unsigned long long next_user;\n  unsigned long long next_system;\n  unsigned long long next_nice;\n  unsigned long long next_idle;\n  unsigned long long diff_user;\n  unsigned long long diff_system;\n  unsigned long long diff_nice;\n  unsigned long long diff_idle;\n  istringstream iss;\n\n  ifstream stat_file(\"\/proc\/stat\");\n  getline(stat_file, stat_line);\n  stat_file.close();\n\n  \/\/ skip \"cpu\"\n  line_start_pos = stat_line.find_first_not_of(\" \", 3);\n  line_end_pos = stat_line.find_first_of(' ', line_start_pos);\n  line_end_pos = stat_line.find_first_of(' ', line_end_pos + 1);\n  line_end_pos = stat_line.find_first_of(' ', line_end_pos + 1);\n  line_end_pos = stat_line.find_first_of(' ', line_end_pos + 1);\n\n  iss.str( stat_line.substr( line_start_pos, line_end_pos - line_start_pos ) );\n  iss >> current_user >> current_nice >> current_system >> current_idle;\n  iss.clear();\n\n  usleep( cpu_usage_delay );\n\n  stat_file.open(\"\/proc\/stat\");\n  getline(stat_file, stat_line);\n  stat_file.close();\n\n  \/\/ skip \"cpu\"\n  line_start_pos = stat_line.find_first_not_of(\" \", 3);\n  line_end_pos = stat_line.find_first_of(' ', line_start_pos);\n  line_end_pos = stat_line.find_first_of(' ', line_end_pos + 1);\n  line_end_pos = stat_line.find_first_of(' ', line_end_pos + 1);\n  line_end_pos = stat_line.find_first_of(' ', line_end_pos + 1);\n\n  iss.str( stat_line.substr( line_start_pos, line_end_pos - line_start_pos ) );\n  iss >> next_user >> next_nice >> next_system >> next_idle;\n  iss.clear();\n\n  diff_user   = next_user - current_user;\n  diff_system = next_system - current_system;\n  diff_nice   = next_nice - current_nice;\n  diff_idle   = next_idle - current_idle;\n\n  return static_cast<float>(diff_user + diff_system + diff_nice)\/static_cast<float>(diff_user + diff_system + diff_nice + diff_idle)*100.0;\n}\n\nstring cpu_string( unsigned int cpu_usage_delay )\n{\n  string meter = \"[          ]\";\n  int meter_count = 0;\n  float percentage;\n  ostringstream oss;\n  oss.precision( 1 );\n  oss.setf( ios::fixed | ios::right );\n\n  percentage = cpu_percentage( cpu_usage_delay );\n  meter_count = 1;\n  while(meter_count*9.99 < percentage)\n    {\n    meter[meter_count] = '|';\n    meter_count++;\n    }\n\n  oss << meter;\n  oss.width( 5 );\n  oss << percentage;\n  oss << \"%\";\n\n  return oss.str();\n}\n\nstring mem_string()\n{\n  unsigned int total_mem;\n  unsigned int used_mem;\n  unsigned int unused_mem;\n  size_t line_start_pos;\n  size_t line_end_pos;\n  istringstream iss;\n  ostringstream oss;\n  string mem_line;\n\n  ifstream meminfo_file( \"\/proc\/meminfo\" );\n  getline( meminfo_file, mem_line );\n  line_start_pos = mem_line.find_first_of( ':' );\n  line_start_pos++;\n  line_end_pos = mem_line.find_first_of( 'k' );\n  iss.str( mem_line.substr( line_start_pos, line_end_pos - line_start_pos ) );\n  iss >> total_mem;\n\n  used_mem = total_mem;\n\n  for( unsigned int i = 0; i < 3; i++ )\n    {\n    getline( meminfo_file, mem_line );\n    line_start_pos = mem_line.find_first_of( ':' );\n    line_start_pos++;\n    line_end_pos = mem_line.find_first_of( 'k' );\n    iss.str( mem_line.substr( line_start_pos, line_end_pos - line_start_pos ) );\n    iss >> unused_mem;\n    used_mem -= unused_mem;\n    }\n  meminfo_file.close();\n\n  oss << used_mem \/ 1024 << '\/' << total_mem \/ 1024 << \"MB\";\n\n  return oss.str();\n}\n\nstring load_string()\n{\n  ifstream loadavg_file( \"\/proc\/loadavg\" );\n  string load_line;\n  getline( loadavg_file, load_line );\n  loadavg_file.close();\n\n  return load_line.substr( 0, 14 );\n}\n\nint main(int argc, char** argv)\n{\n  unsigned int cpu_usage_delay = 900000;\n  if( argc > 1 )\n    {\n    try\n    {\n      istringstream iss( argv[1] );\n      iss.exceptions ( ifstream::failbit | ifstream::badbit );\n      unsigned int status_interval;\n      iss >> status_interval;\n      cpu_usage_delay = status_interval * 1000000 - 100000;\n    }\n    catch(const exception &e)\n    {\n      cerr << \"Usage: \" << argv[0] << \" [tmux_status-interval(seconds)]\" << endl;\n      return 1;\n    }\n    }\n\n  std::cout << mem_string() << ' ' << cpu_string( cpu_usage_delay ) << ' ' << load_string();\n  \n  return 0;\n}\n\n<|endoftext|>"}
{"text":"<commit_before>#include <cstdlib>\n#include <ctime>\n#include <iostream>\n#include <vector>\n#include <fstream>\n#include <algorithm>\n\n#include \"SuMo.h\"\n#include \"Timer.h\"\n\nusing namespace std;\n\/* subtract pedestal values on-line *\/\nstatic bool PED_SUBTRCT = false;\n\nstatic int LIMIT_READOUT_RATE = 6000;  \/\/usecs limit between event polling\nstatic int NUM_SEQ_TIMEOUTS = 100;    \/\/ number of sequential timeouts before ending run\nconst float MAX_INT_TIMER = 800.;    \/\/ max cpu timer before ending run (secs)\n\/* note: usb timeout defined in include\/stdUSB.h *\/\n\nbool overwriteExistingFile = false;\n\nint SuMo::log_data(unsigned int NUM_READS, int trig_mode, int acq_rate, const char *log_filename) {\n    int check_event;\n    int asic_baseline[psecSampleCells];\n    int count = 0;\n    int psec_cnt = 0;\n    int last_k;\n    float _now_, t = 0.;\n    Timer timer = Timer();\n    time_t now;\n    short sample;\n    int *Meta;\n\n\n    char logDataFilename[300];\n    char logMetaFilename[300];\n    char logPedFilename[300];\n    char delim = ' ';\n\n    \/\/ 'scalar' mode\n    ofstream rate_fs;\n    if (trig_mode == 2) {\n        char logRateFilename[300];\n        sprintf(logRateFilename, \"%s.rate\", log_filename);\n        rate_fs.open(logRateFilename, ios::trunc);\n    }\n\n\n    sprintf(logDataFilename, \"%s.acdc\", log_filename);\n    sprintf(logMetaFilename, \"%s.meta\", log_filename);\n    sprintf(logPedFilename, \"%s.ped\", log_filename);\n\n    \/\/ check if file exists, inquire whether to overwrite\n    string temp;\n    while (fileExists(logDataFilename)) {\n        cout << \"file already exists, try new filename: (or enter to overwrite \/ ctrl-C to quit): \";\n        getline(cin, temp);\n        if (temp.empty()) break;\n        sprintf(logDataFilename, \"%s.acdc\", temp.c_str());\n        sprintf(logMetaFilename, \"%s.meta\", temp.c_str());\n        sprintf(logPedFilename, \"%s.ped\", temp.c_str());\n    }\n\n    \/* open up file stream *\/\n    ofstream dataofs, pedofs, metaofs;\n    dataofs.open(logDataFilename, ios::trunc);\n\n\n    \/* Create header *\/\n    dataofs << \"Event\" << delim << \"Board\" << delim << \"Ch\";\n    for (int i = 0; i < psecSampleCells; i++) {\n        dataofs << delim << \"C\" << i;\n    }\n    dataofs << endl;\n\n    pedofs.open(logPedFilename, ios::trunc);\n    \/\/ Create Header\n    pedofs << \"Board\" << delim << \"Ch\";\n    for (int i = 0; i < psecSampleCells; i++) {\n        pedofs << delim << \"C\" << i;\n    }\n    pedofs << endl;\n\n    \/* Print out pedestal data *\/\n    for (int board = 0; board < numFrontBoards; board++) {\n        \/\/ Skip inactive boards\n        if (!DC_ACTIVE[board]) continue;\n        for (int channel = 0; channel < AC_CHANNELS; channel++) {\n            pedofs << board << delim << channel + 1;\n            for (int i = 0; i < psecSampleCells; i++) {\n                pedofs << delim << PED_DATA[board][channel][i];\n            }\n            pedofs << endl;\n        }\n    }\n\n    pedofs.close();\n\n    metaofs.open(logMetaFilename, ios::trunc);\n\n    \/\/ Create header\n    metaofs << \"Event\" << delim << \"Board\" << delim;\n    metaofs << \"count\" << delim << \"aa\" << delim << \"time\" << delim << \"datetime\" << delim\n            << \"events\" << delim << \"bin_count_rise\" << delim << \"self_trig_settings_2\" << delim\n            << \"sys_coincidence_width\" << delim << \"coincidence_num_chips\" << delim\n            << \"coincidence_num_chans\" << delim << \"self_trig_settings\" << delim\n            << \"trig_en\" << delim << \"trig_wait_for_sys\" << delim << \"trig_rate_only\" << delim\n            << \"trig_sign\" << delim << \"use_sma_trig_input\" << delim\n            << \"use_coincidence_settings\" << delim << \"use_trig_valid_as_reset\" << delim\n            << \"coinc_window\" << delim << \"reg_self_trig\" << delim\n            << \"counts_of_sys_no_local\" << delim << \"sys_trig_count\" << delim\n            << \"resets_from_firmw\" << delim << \"firmware_version\" << delim\n            << \"self_trig_mask\" << delim << \"dig_timestamp_lo\" << delim\n            << \"dig_timestamp_mid\" << delim << \"dig_timestamp_hi\" << delim\n            << \"dig_event_count\" << delim << \"event_count\" << delim\n            << \"timestamp_hi\" << delim << \"timestamp_mid\" << delim\n            << \"timestamp_lo\" << delim << \"CC_BIN_COUNT\" << delim\n            << \"CC_EVENT_COUNT\" << delim << \"CC_TIMESTAMP_LO\" << delim\n            << \"CC_TIMESTAMP_MID\" << delim << \"CC_TIMESTAMP_HI\" << delim;\n    for (int n = 0; n < 5; n++) metaofs << \"ro_cnt_chip_\" << n << delim;\n    for (int n = 0; n < 5; n++) metaofs << \"ro_target_cnt_chip_\" << n << delim;\n    for (int n = 0; n < 5; n++) metaofs << \"vbias_chip_\" << n << delim;\n    for (int n = 0; n < 5; n++) metaofs << \"trigger_threshold_chip_\" << n << delim;\n    for (int n = 0; n < 5; n++) metaofs << \"ro_dac_value_chip_\" << n << delim;\n    for (int n = 1; n <= AC_CHANNELS; n++) metaofs << \"self_trig_scalar_ch_\" << n << delim;\n    metaofs << \"time_from_valid_to_trig\" << delim << \"firmware_reset_time\" << delim\n            << \"last_coincidence_num_chans\" << endl;\n\n    int meta_skip[] = {5, 6, 65, 66, 67, 68, 69, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109};\n\n\n\n\n\n    \/\/ read all front end cards\n    bool all[numFrontBoards];\n    for (int i = 0; i < numFrontBoards; i++) all[i] = true;\n\n    load_ped();\n\n    int number_of_frontend_cards = 0;\n\n    for (int board = 0; board < numFrontBoards; board++) {\n        if (DC_ACTIVE[board]) number_of_frontend_cards++;\n\n    }\n\n    cout << \"--------------------------------------------------------------\" << endl;\n    cout << \"number of front-end boards detected = \" << number_of_frontend_cards\n         << \" of \" << numFrontBoards << \" address slots in system\" << endl;\n    cout << \"Trying for \" << NUM_READS << \" events logged to disk, in a timeout window of \"\n         << MAX_INT_TIMER << \" seconds\" << endl;\n    cout << \"--------------------------------------------------------------\" << endl << endl;\n\n    usleep(100000);\n\n\n    bool reset_event = true;\n\n    \/\/ set read mode to NULL\n    set_usb_read_mode(0);\n    if (mode == USB2x) set_usb_read_mode_slaveDevice(0);\n    system_card_trig_valid(false);\n    if (mode == USB2x) system_slave_card_trig_valid(false);\n\n    \/\/check system trigger number\n    read_CC(false, false, 100);\n    int board_trigger = CC_EVENT_COUNT_FROMCC0;\n    int last_board_trigger = board_trigger;\n\n    \/* cpu time zero *\/\n    timer.start();\n\n    for (int event = 0; event < NUM_READS; event++) {\n        set_usb_read_mode(0);\n        if (mode == USB2x) set_usb_read_mode_slaveDevice(0);\n\n        time(&now);\n        t = timer.stop();\n        \/\/ interrupt if past specified logging time\n        if (t > MAX_INT_TIMER) {\n            cout << endl << \"readout timed out at \" << t << \"on event \" << event << endl;\n            break;\n        }\n\n        \/\/ trig_mode = 1 is external source or PSEC4 self trigger\n        \/\/ trig_mode = 0 is over software (USB), i.e. calibration logging\n        if (trig_mode == 0) {\n            manage_cc_fifo(1);\n            if (mode == USB2x) manage_cc_fifo_slaveDevice(1);\n\n            \/\/ 'rate-only' mode, only pull data every second\n            if (trig_mode == 2) usleep(3e6);\n\n            prep_sync();\n            if (mode == USB2x) software_trigger_slaveDevice((unsigned int) 15);\n            software_trigger((unsigned int) 15);\n            make_sync();\n\n            \/\/acq rate limit\n            usleep(LIMIT_READOUT_RATE); \/\/ somewhat arbitrary hard-coded rate limitation\n            \/\/system_card_trig_valid(false);\n            \/\/if(mode == USB2x) system_slave_card_trig_valid(false);\n        } else {\n            manage_cc_fifo(1);\n            if (mode == USB2x) manage_cc_fifo_slaveDevice(1);\n            usleep(100);\n            for (int iii = 0; iii < 2; iii++) {\n                system_card_trig_valid(false);\n                if (mode == USB2x) system_slave_card_trig_valid(false);\n            }\n\n            \/\/send in trig 'valid' signal\n            sys_wait(100);\n            prep_sync();\n            if (mode == USB2x) system_slave_card_trig_valid(true);\n            system_card_trig_valid(true);\n            make_sync();\n            \/\/}\n            \/\/acq rate limit\n            usleep(acq_rate + LIMIT_READOUT_RATE);\n        }\n        int num_pulls = 0;\n        int evts = 0;\n        int digs = 0;\n        while (board_trigger == last_board_trigger && t < MAX_INT_TIMER) {\n\n            read_CC(false, false, 100);\n            board_trigger = CC_EVENT_COUNT_FROMCC0;\n            cout << \"waiting for trigger...     on system event: \"\n                 << board_trigger << \" & readout attempt \" << event\n                 << \" @time \" << t << \"                        \\r\";\n            cout.flush();\n            usleep(1000);\n            t = timer.stop();\n            num_pulls++;\n            if (num_pulls > 100) break;\n            \/\/if(num_pulls > 10)  break;   \/\/use this is board trigger does not iterate\n        }\n\n        last_board_trigger = board_trigger;\n        if (mode == USB2x) system_slave_card_trig_valid(false);\n        system_card_trig_valid(false);\n        \/\/set_usb_read_mode_slaveDevice(0), set_usb_read_mode(0);\n        evts = read_CC(false, false, 0);\n        for (int chkdig = 0; chkdig < numFrontBoards; chkdig++)\n            digs += DIGITIZING_START_FLAG[chkdig];\n\n        if (evts == 0 || evts != digs) {\n            cout << \"    --NULL--       \" << endl;\n            reset_event = true;\n            event = event - 1;             \/\/repeat event\n            continue;\n        }\n\n            \/\/ show event number at terminal\n        else {\n            if ((event + 1) % 1 == 0 || event == 0) {\n                print_to_terminal(event, NUM_READS, CC_EVENT_COUNT_FROMCC0, board_trigger, t);\n            }\n        }\n        \/**************************************\/\n        \/\/Do bulk read on all front-end cards\n        int numBoards = read_AC(1, all, false);\n        \/**************************************\/\n        sys_wait(10000);\n\n        for (int jj = 0; jj < 2; jj++) {\n            \/\/prep_sync();\n            \/\/turn off 'trig valid flag' until checking if data in buffer\n            if (mode == USB2x) system_slave_card_trig_valid(false);\n            system_card_trig_valid(false);\n            if (mode == USB2x) set_usb_read_mode_slaveDevice(0);\n            set_usb_read_mode(0);\n        }\n        reset_event = true; \/\/have event, go ahead and reset for next event\n\n        \/\/ form data for filesave\n        for (int board = 0; board < numFrontBoards; board++) {\n            if (BOARDS_READOUT[board] && numBoards > 0) {\n                psec_cnt = 0;\n                \/\/ assign meta data\n                Meta = get_AC_info(false, board, false, event, t, t, evts);\n                \/\/ wraparound_correction\n                int baseline[psecSampleCells];\n                unwrap_baseline(baseline, board);\n                for (int ch = 0; ch < AC_CHANNELS; ch++) {\n                    dataofs << event << delim << board << delim << ch + 1;\n\n                    if (ch > 0 && ch % 6 == 0) psec_cnt++;\n\n                    for (int cell = 0; cell < psecSampleCells; cell++) {\n                        asic_baseline[cell] = baseline[cell];\n                        sample = adcDat[board]->AC_RAW_DATA[psec_cnt][ch % 6 * 256 + cell];\n                        sample -= PED_DATA[board][ch][cell];\n                        adcDat[board]->Data[ch][baseline[cell]] = (unsigned int) sample;\n                    }\n                    for (int wrap: adcDat[board]->Data[ch]) {\n                        dataofs << delim << dec << wrap; \/\/ std::dec\n                    }\n                    dataofs << endl;\n                }\n\n                metaofs << event << delim << board;\n                for (int cell = 0; cell < psecSampleCells; cell++) {\n                    adcDat[board]->Meta[cell] = Meta[cell];\n                    \/\/ Only log the meaningful meta values\n                    if (cell <= 112 && find(begin(meta_skip), end(meta_skip), cell) == end(meta_skip)) {\n                        metaofs << delim << Meta[cell];\n                    }\n                }\n                metaofs << endl;\n            }\n            \/\/ if timeout on only some, but not all boards\n            else if (numBoards > 0 && BOARDS_TIMEOUT[board] && DC_ACTIVE[board]) {\n                for (int i = 0; i < AC_CHANNELS; i++) {\n                    if (i > 0 && i % 6 == 0) psec_cnt++;\n\n                    for (int j = 0; j < psecSampleCells; j++) {\n                        sample = 0xFF;\n                        adcDat[board]->Data[i][j] = sample;\n                    }\n                }\n            }\n        }\n\n\n\n        last_k = event;\n\n        \/\/ LOGGING\n    }\n\n    cout << endl;\n    cout << \"Done on readout:  \" << last_k + 1 << \" :: @time \" << t << \" sec\" << endl;\n\n    cleanup();\n\n\n    dump_data();\n\n    if (trig_mode == 2) rate_fs.close();\n\n    cout << \"Data saved in file: \" << logDataFilename << endl << \"*****\" << endl;\n\n    dataofs.close();\n    pedofs.close();\n    metaofs.close();\n\n\n    return 0;\n}\n\n\nvoid SuMo::print_to_terminal(int k, int NUM_READS, int cc_event, int board_trig, double t) {\n    cout << \"\\r\" << \"Readout:  \" << k + 1 << \" of \" << NUM_READS;\n    cout << \" :: system|sw evt-\" << cc_event << \"|\" << board_trig;\n    cout << \" :: evtflags-\";\n    for (int evt_flag = 0; evt_flag < numFrontBoards; evt_flag++) cout << EVENT_FLAG[evt_flag];\n    cout << \" :: digflags-\";\n    for (int dig_flag = 0; dig_flag < numFrontBoards; dig_flag++) cout << DIGITIZING_START_FLAG[dig_flag];\n    cout << \" :: @time \" << t << \" sec \" << flush;\n}\n<commit_msg>changed so heading for cells does not have \"C\"<commit_after>#include <cstdlib>\n#include <ctime>\n#include <iostream>\n#include <vector>\n#include <fstream>\n#include <algorithm>\n\n#include \"SuMo.h\"\n#include \"Timer.h\"\n\nusing namespace std;\n\/* subtract pedestal values on-line *\/\nstatic bool PED_SUBTRCT = false;\n\nstatic int LIMIT_READOUT_RATE = 6000;  \/\/usecs limit between event polling\nstatic int NUM_SEQ_TIMEOUTS = 100;    \/\/ number of sequential timeouts before ending run\nconst float MAX_INT_TIMER = 800.;    \/\/ max cpu timer before ending run (secs)\n\/* note: usb timeout defined in include\/stdUSB.h *\/\n\nbool overwriteExistingFile = false;\n\nint SuMo::log_data(unsigned int NUM_READS, int trig_mode, int acq_rate, const char *log_filename) {\n    int check_event;\n    int asic_baseline[psecSampleCells];\n    int count = 0;\n    int psec_cnt = 0;\n    int last_k;\n    float _now_, t = 0.;\n    Timer timer = Timer();\n    time_t now;\n    short sample;\n    int *Meta;\n\n\n    char logDataFilename[300];\n    char logMetaFilename[300];\n    char logPedFilename[300];\n    char delim = ' ';\n\n    \/\/ 'scalar' mode\n    ofstream rate_fs;\n    if (trig_mode == 2) {\n        char logRateFilename[300];\n        sprintf(logRateFilename, \"%s.rate\", log_filename);\n        rate_fs.open(logRateFilename, ios::trunc);\n    }\n\n\n    sprintf(logDataFilename, \"%s.acdc\", log_filename);\n    sprintf(logMetaFilename, \"%s.meta\", log_filename);\n    sprintf(logPedFilename, \"%s.ped\", log_filename);\n\n    \/\/ check if file exists, inquire whether to overwrite\n    string temp;\n    while (fileExists(logDataFilename)) {\n        cout << \"file already exists, try new filename: (or enter to overwrite \/ ctrl-C to quit): \";\n        getline(cin, temp);\n        if (temp.empty()) break;\n        sprintf(logDataFilename, \"%s.acdc\", temp.c_str());\n        sprintf(logMetaFilename, \"%s.meta\", temp.c_str());\n        sprintf(logPedFilename, \"%s.ped\", temp.c_str());\n    }\n\n    \/* open up file stream *\/\n    ofstream dataofs, pedofs, metaofs;\n    dataofs.open(logDataFilename, ios::trunc);\n\n\n    \/* Create header *\/\n    dataofs << \"Event\" << delim << \"Board\" << delim << \"Ch\";\n    for (int i = 0; i < psecSampleCells; i++) {\n        dataofs << delim << i;\n    }\n    dataofs << endl;\n\n    pedofs.open(logPedFilename, ios::trunc);\n    \/\/ Create Header\n    pedofs << \"Board\" << delim << \"Ch\";\n    for (int i = 0; i < psecSampleCells; i++) {\n        pedofs << delim << i;\n    }\n    pedofs << endl;\n\n    \/* Print out pedestal data *\/\n    for (int board = 0; board < numFrontBoards; board++) {\n        \/\/ Skip inactive boards\n        if (!DC_ACTIVE[board]) continue;\n        for (int channel = 0; channel < AC_CHANNELS; channel++) {\n            pedofs << board << delim << channel + 1;\n            for (int i = 0; i < psecSampleCells; i++) {\n                pedofs << delim << PED_DATA[board][channel][i];\n            }\n            pedofs << endl;\n        }\n    }\n\n    pedofs.close();\n\n    metaofs.open(logMetaFilename, ios::trunc);\n\n    \/\/ Create header\n    metaofs << \"Event\" << delim << \"Board\" << delim;\n    metaofs << \"count\" << delim << \"aa\" << delim << \"time\" << delim << \"datetime\" << delim\n            << \"events\" << delim << \"bin_count_rise\" << delim << \"self_trig_settings_2\" << delim\n            << \"sys_coincidence_width\" << delim << \"coincidence_num_chips\" << delim\n            << \"coincidence_num_chans\" << delim << \"self_trig_settings\" << delim\n            << \"trig_en\" << delim << \"trig_wait_for_sys\" << delim << \"trig_rate_only\" << delim\n            << \"trig_sign\" << delim << \"use_sma_trig_input\" << delim\n            << \"use_coincidence_settings\" << delim << \"use_trig_valid_as_reset\" << delim\n            << \"coinc_window\" << delim << \"reg_self_trig\" << delim\n            << \"counts_of_sys_no_local\" << delim << \"sys_trig_count\" << delim\n            << \"resets_from_firmw\" << delim << \"firmware_version\" << delim\n            << \"self_trig_mask\" << delim << \"dig_timestamp_lo\" << delim\n            << \"dig_timestamp_mid\" << delim << \"dig_timestamp_hi\" << delim\n            << \"dig_event_count\" << delim << \"event_count\" << delim\n            << \"timestamp_hi\" << delim << \"timestamp_mid\" << delim\n            << \"timestamp_lo\" << delim << \"CC_BIN_COUNT\" << delim\n            << \"CC_EVENT_COUNT\" << delim << \"CC_TIMESTAMP_LO\" << delim\n            << \"CC_TIMESTAMP_MID\" << delim << \"CC_TIMESTAMP_HI\" << delim;\n    for (int n = 0; n < 5; n++) metaofs << \"ro_cnt_chip_\" << n << delim;\n    for (int n = 0; n < 5; n++) metaofs << \"ro_target_cnt_chip_\" << n << delim;\n    for (int n = 0; n < 5; n++) metaofs << \"vbias_chip_\" << n << delim;\n    for (int n = 0; n < 5; n++) metaofs << \"trigger_threshold_chip_\" << n << delim;\n    for (int n = 0; n < 5; n++) metaofs << \"ro_dac_value_chip_\" << n << delim;\n    for (int n = 1; n <= AC_CHANNELS; n++) metaofs << \"self_trig_scalar_ch_\" << n << delim;\n    metaofs << \"time_from_valid_to_trig\" << delim << \"firmware_reset_time\" << delim\n            << \"last_coincidence_num_chans\" << endl;\n\n    int meta_skip[] = {5, 6, 65, 66, 67, 68, 69, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109};\n\n\n\n\n\n    \/\/ read all front end cards\n    bool all[numFrontBoards];\n    for (int i = 0; i < numFrontBoards; i++) all[i] = true;\n\n    load_ped();\n\n    int number_of_frontend_cards = 0;\n\n    for (int board = 0; board < numFrontBoards; board++) {\n        if (DC_ACTIVE[board]) number_of_frontend_cards++;\n\n    }\n\n    cout << \"--------------------------------------------------------------\" << endl;\n    cout << \"number of front-end boards detected = \" << number_of_frontend_cards\n         << \" of \" << numFrontBoards << \" address slots in system\" << endl;\n    cout << \"Trying for \" << NUM_READS << \" events logged to disk, in a timeout window of \"\n         << MAX_INT_TIMER << \" seconds\" << endl;\n    cout << \"--------------------------------------------------------------\" << endl << endl;\n\n    usleep(100000);\n\n\n    bool reset_event = true;\n\n    \/\/ set read mode to NULL\n    set_usb_read_mode(0);\n    if (mode == USB2x) set_usb_read_mode_slaveDevice(0);\n    system_card_trig_valid(false);\n    if (mode == USB2x) system_slave_card_trig_valid(false);\n\n    \/\/check system trigger number\n    read_CC(false, false, 100);\n    int board_trigger = CC_EVENT_COUNT_FROMCC0;\n    int last_board_trigger = board_trigger;\n\n    \/* cpu time zero *\/\n    timer.start();\n\n    for (int event = 0; event < NUM_READS; event++) {\n        set_usb_read_mode(0);\n        if (mode == USB2x) set_usb_read_mode_slaveDevice(0);\n\n        time(&now);\n        t = timer.stop();\n        \/\/ interrupt if past specified logging time\n        if (t > MAX_INT_TIMER) {\n            cout << endl << \"readout timed out at \" << t << \"on event \" << event << endl;\n            break;\n        }\n\n        \/\/ trig_mode = 1 is external source or PSEC4 self trigger\n        \/\/ trig_mode = 0 is over software (USB), i.e. calibration logging\n        if (trig_mode == 0) {\n            manage_cc_fifo(1);\n            if (mode == USB2x) manage_cc_fifo_slaveDevice(1);\n\n            \/\/ 'rate-only' mode, only pull data every second\n            if (trig_mode == 2) usleep(3e6);\n\n            prep_sync();\n            if (mode == USB2x) software_trigger_slaveDevice((unsigned int) 15);\n            software_trigger((unsigned int) 15);\n            make_sync();\n\n            \/\/acq rate limit\n            usleep(LIMIT_READOUT_RATE); \/\/ somewhat arbitrary hard-coded rate limitation\n            \/\/system_card_trig_valid(false);\n            \/\/if(mode == USB2x) system_slave_card_trig_valid(false);\n        } else {\n            manage_cc_fifo(1);\n            if (mode == USB2x) manage_cc_fifo_slaveDevice(1);\n            usleep(100);\n            for (int iii = 0; iii < 2; iii++) {\n                system_card_trig_valid(false);\n                if (mode == USB2x) system_slave_card_trig_valid(false);\n            }\n\n            \/\/send in trig 'valid' signal\n            sys_wait(100);\n            prep_sync();\n            if (mode == USB2x) system_slave_card_trig_valid(true);\n            system_card_trig_valid(true);\n            make_sync();\n            \/\/}\n            \/\/acq rate limit\n            usleep(acq_rate + LIMIT_READOUT_RATE);\n        }\n        int num_pulls = 0;\n        int evts = 0;\n        int digs = 0;\n        while (board_trigger == last_board_trigger && t < MAX_INT_TIMER) {\n\n            read_CC(false, false, 100);\n            board_trigger = CC_EVENT_COUNT_FROMCC0;\n            cout << \"waiting for trigger...     on system event: \"\n                 << board_trigger << \" & readout attempt \" << event\n                 << \" @time \" << t << \"                        \\r\";\n            cout.flush();\n            usleep(1000);\n            t = timer.stop();\n            num_pulls++;\n            if (num_pulls > 100) break;\n            \/\/if(num_pulls > 10)  break;   \/\/use this is board trigger does not iterate\n        }\n\n        last_board_trigger = board_trigger;\n        if (mode == USB2x) system_slave_card_trig_valid(false);\n        system_card_trig_valid(false);\n        \/\/set_usb_read_mode_slaveDevice(0), set_usb_read_mode(0);\n        evts = read_CC(false, false, 0);\n        for (int chkdig = 0; chkdig < numFrontBoards; chkdig++)\n            digs += DIGITIZING_START_FLAG[chkdig];\n\n        if (evts == 0 || evts != digs) {\n            cout << \"    --NULL--       \" << endl;\n            reset_event = true;\n            event = event - 1;             \/\/repeat event\n            continue;\n        }\n\n            \/\/ show event number at terminal\n        else {\n            if ((event + 1) % 1 == 0 || event == 0) {\n                print_to_terminal(event, NUM_READS, CC_EVENT_COUNT_FROMCC0, board_trigger, t);\n            }\n        }\n        \/**************************************\/\n        \/\/Do bulk read on all front-end cards\n        int numBoards = read_AC(1, all, false);\n        \/**************************************\/\n        sys_wait(10000);\n\n        for (int jj = 0; jj < 2; jj++) {\n            \/\/prep_sync();\n            \/\/turn off 'trig valid flag' until checking if data in buffer\n            if (mode == USB2x) system_slave_card_trig_valid(false);\n            system_card_trig_valid(false);\n            if (mode == USB2x) set_usb_read_mode_slaveDevice(0);\n            set_usb_read_mode(0);\n        }\n        reset_event = true; \/\/have event, go ahead and reset for next event\n\n        \/\/ form data for filesave\n        for (int board = 0; board < numFrontBoards; board++) {\n            if (BOARDS_READOUT[board] && numBoards > 0) {\n                psec_cnt = 0;\n                \/\/ assign meta data\n                Meta = get_AC_info(false, board, false, event, t, t, evts);\n                \/\/ wraparound_correction\n                int baseline[psecSampleCells];\n                unwrap_baseline(baseline, board);\n                for (int ch = 0; ch < AC_CHANNELS; ch++) {\n                    dataofs << event << delim << board << delim << ch + 1;\n\n                    if (ch > 0 && ch % 6 == 0) psec_cnt++;\n\n                    for (int cell = 0; cell < psecSampleCells; cell++) {\n                        asic_baseline[cell] = baseline[cell];\n                        sample = adcDat[board]->AC_RAW_DATA[psec_cnt][ch % 6 * 256 + cell];\n                        sample -= PED_DATA[board][ch][cell];\n                        adcDat[board]->Data[ch][baseline[cell]] = (unsigned int) sample;\n                    }\n                    for (int wrap: adcDat[board]->Data[ch]) {\n                        dataofs << delim << dec << wrap; \/\/ std::dec\n                    }\n                    dataofs << endl;\n                }\n\n                metaofs << event << delim << board;\n                for (int cell = 0; cell < psecSampleCells; cell++) {\n                    adcDat[board]->Meta[cell] = Meta[cell];\n                    \/\/ Only log the meaningful meta values\n                    if (cell <= 112 && find(begin(meta_skip), end(meta_skip), cell) == end(meta_skip)) {\n                        metaofs << delim << Meta[cell];\n                    }\n                }\n                metaofs << endl;\n            }\n            \/\/ if timeout on only some, but not all boards\n            else if (numBoards > 0 && BOARDS_TIMEOUT[board] && DC_ACTIVE[board]) {\n                for (int i = 0; i < AC_CHANNELS; i++) {\n                    if (i > 0 && i % 6 == 0) psec_cnt++;\n\n                    for (int j = 0; j < psecSampleCells; j++) {\n                        sample = 0xFF;\n                        adcDat[board]->Data[i][j] = sample;\n                    }\n                }\n            }\n        }\n\n\n\n        last_k = event;\n\n        \/\/ LOGGING\n    }\n\n    cout << endl;\n    cout << \"Done on readout:  \" << last_k + 1 << \" :: @time \" << t << \" sec\" << endl;\n\n    cleanup();\n\n\n    dump_data();\n\n    if (trig_mode == 2) rate_fs.close();\n\n    cout << \"Data saved in file: \" << logDataFilename << endl << \"*****\" << endl;\n\n    dataofs.close();\n    pedofs.close();\n    metaofs.close();\n\n\n    return 0;\n}\n\n\nvoid SuMo::print_to_terminal(int k, int NUM_READS, int cc_event, int board_trig, double t) {\n    cout << \"\\r\" << \"Readout:  \" << k + 1 << \" of \" << NUM_READS;\n    cout << \" :: system|sw evt-\" << cc_event << \"|\" << board_trig;\n    cout << \" :: evtflags-\";\n    for (int evt_flag = 0; evt_flag < numFrontBoards; evt_flag++) cout << EVENT_FLAG[evt_flag];\n    cout << \" :: digflags-\";\n    for (int dig_flag = 0; dig_flag < numFrontBoards; dig_flag++) cout << DIGITIZING_START_FLAG[dig_flag];\n    cout << \" :: @time \" << t << \" sec \" << flush;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/! @file getfullyqualifiedname.cpp\n\/\/! @author George Fleming <v-geflem@microsoft.com>\n\/\/! @brief Implements GetFullyQualifiedName on Linux\n\n#include <errno.h>\n#include <sys\/types.h>\n#include <sys\/socket.h>\n#include <netdb.h>\n#include \"getcomputername.h\"\n#include \"getfullyqualifiedname.h\"\n\n\/\/! @brief GetFullyQualifiedName retrieves the fully qualified dns name of the host\n\/\/!\n\/\/! @exception errno Passes these errors via errno to GetLastError:\n\/\/! - ERROR_INVALID_FUNCTION: getlogin_r() returned an unrecognized error code (from GetComputerName)\n\/\/! - ERROR_INVALID_ADDRESS:  buffer is an invalid address (from GetComputerName)\n\/\/! - ERROR_GEN_FAILURE: buffer not large enough (from GetComputerName)\n\/\/! - ERROR_BAD_NET_NAME: Cannot determine network short name\n\/\/!\n\/\/! @retval username as UTF-8 string, or null if unsuccessful\n\/\/!\n\nchar *GetFullyQualifiedName()\n{\n    errno = 0;\n\n    char *computerName = GetComputerName();\n    if (computerName == NULL)\n    {\n        return NULL;\n    }\n\n    struct addrinfo hints, *info;\n\n    memset(&hints, 0, sizeof hints);\n    hints.ai_family = AF_UNSPEC; \/*either IPV4 or IPV6*\/\n    hints.ai_socktype = SOCK_STREAM;\n    hints.ai_flags = AI_CANONNAME;\n\n    \/* There are several ways to get the domain name:\n     * uname(2), gethostbyname(3), resolver(3), getdomainname(2),\n     * and getaddrinfo(3).  Some of these are not portable, some aren't\n     * POSIX compliant, and some are being deprecated. getaddrinfo seems\n     * to be the best choice.\n     *\/\n    if (getaddrinfo(computerName, \"http\", &hints, &info) != 0)\n    {\n        errno = ERROR_BAD_NET_NAME;\n        return NULL;\n    }\n\n    \/\/ info is actually a link-list.  We'll just return the first full name\n\n    char *fullName = strndup(info->ai_canonname, strlen(info->ai_canonname));\n\n    freeaddrinfo(info);\n    free(computerName);\n    return fullName;\n}\n<commit_msg>Fix memory leak in GetFullyQualifiedName()<commit_after>\/\/! @file getfullyqualifiedname.cpp\n\/\/! @author George Fleming <v-geflem@microsoft.com>\n\/\/! @brief Implements GetFullyQualifiedName on Linux\n\n#include <errno.h>\n#include <sys\/types.h>\n#include <sys\/socket.h>\n#include <netdb.h>\n#include \"getcomputername.h\"\n#include \"getfullyqualifiedname.h\"\n\n\/\/! @brief GetFullyQualifiedName retrieves the fully qualified dns name of the host\n\/\/!\n\/\/! @exception errno Passes these errors via errno to GetLastError:\n\/\/! - ERROR_INVALID_FUNCTION: getlogin_r() returned an unrecognized error code (from GetComputerName)\n\/\/! - ERROR_INVALID_ADDRESS:  buffer is an invalid address (from GetComputerName)\n\/\/! - ERROR_GEN_FAILURE: buffer not large enough (from GetComputerName)\n\/\/! - ERROR_BAD_NET_NAME: Cannot determine network short name\n\/\/!\n\/\/! @retval username as UTF-8 string, or null if unsuccessful\n\/\/!\n\nchar *GetFullyQualifiedName()\n{\n    errno = 0;\n\n    char *computerName = GetComputerName();\n    if (computerName == NULL)\n    {\n        return NULL;\n    }\n\n    struct addrinfo hints, *info;\n\n    memset(&hints, 0, sizeof hints);\n    hints.ai_family = AF_UNSPEC; \/*either IPV4 or IPV6*\/\n    hints.ai_socktype = SOCK_STREAM;\n    hints.ai_flags = AI_CANONNAME;\n\n    \/* There are several ways to get the domain name:\n     * uname(2), gethostbyname(3), resolver(3), getdomainname(2),\n     * and getaddrinfo(3).  Some of these are not portable, some aren't\n     * POSIX compliant, and some are being deprecated. getaddrinfo seems\n     * to be the best choice.\n     *\/\n    char *fullName = NULL;\n    if (getaddrinfo(computerName, \"http\", &hints, &info) != 0)\n    {\n        goto exit;\n    }\n\n    \/\/ return the first canonical name in the list\n    fullName = strndup(info->ai_canonname, strlen(info->ai_canonname));\n\n    \/\/ only free info if getaddrinfo was successful\n    freeaddrinfo(info);\nexit:\n    free(computerName);\n    return fullName;\n}\n<|endoftext|>"}
{"text":"<commit_before>\/\/ Scintilla source code edit control\n\/** @file AutoComplete.cxx\n ** Defines the auto completion list box.\n **\/\n\/\/ Copyright 1998-2003 by Neil Hodgson <neilh@scintilla.org>\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include <stdlib.h>\n#include <string.h>\n#include <stdio.h>\n#include <assert.h>\n\n#include \"Platform.h\"\n\n#include \"CharacterSet.h\"\n#include \"AutoComplete.h\"\n#include \"Scintilla.h\"\n\n#ifdef SCI_NAMESPACE\nusing namespace Scintilla;\n#endif\n\nAutoComplete::AutoComplete() :\n\tactive(false),\n\tseparator(' '),\n\ttypesep('?'),\n\tignoreCase(false),\n\tchooseSingle(false),\n\tlb(0),\n\tposStart(0),\n\tstartLen(0),\n\tcancelAtStartPos(true),\n\tautoHide(true),\n\tdropRestOfWord(false),\n\tignoreCaseBehaviour(SC_CASEINSENSITITIVEBEHAVIOUR_RESPECTCASE) {\n\tlb = ListBox::Allocate();\n\tstopChars[0] = '\\0';\n\tfillUpChars[0] = '\\0';\n}\n\nAutoComplete::~AutoComplete() {\n\tif (lb) {\n\t\tlb->Destroy();\n\t\tdelete lb;\n\t\tlb = 0;\n\t}\n}\n\nbool AutoComplete::Active() const {\n\treturn active;\n}\n\nvoid AutoComplete::Start(Window &parent, int ctrlID,\n\tint position, Point location, int startLen_,\n\tint lineHeight, bool unicodeMode, int technology) {\n\tif (active) {\n\t\tCancel();\n\t}\n\tlb->Create(parent, ctrlID, location, lineHeight, unicodeMode, technology);\n\tlb->Clear();\n\tactive = true;\n\tstartLen = startLen_;\n\tposStart = position;\n}\n\nvoid AutoComplete::SetStopChars(const char *stopChars_) {\n\tstrncpy(stopChars, stopChars_, sizeof(stopChars));\n\tstopChars[sizeof(stopChars) - 1] = '\\0';\n}\n\nbool AutoComplete::IsStopChar(char ch) {\n\treturn ch && strchr(stopChars, ch);\n}\n\nvoid AutoComplete::SetFillUpChars(const char *fillUpChars_) {\n\tstrncpy(fillUpChars, fillUpChars_, sizeof(fillUpChars));\n\tfillUpChars[sizeof(fillUpChars) - 1] = '\\0';\n}\n\nbool AutoComplete::IsFillUpChar(char ch) {\n\treturn ch && strchr(fillUpChars, ch);\n}\n\nvoid AutoComplete::SetSeparator(char separator_) {\n\tseparator = separator_;\n}\n\nchar AutoComplete::GetSeparator() const {\n\treturn separator;\n}\n\nvoid AutoComplete::SetTypesep(char separator_) {\n\ttypesep = separator_;\n}\n\nchar AutoComplete::GetTypesep() const {\n\treturn typesep;\n}\n\nvoid AutoComplete::SetList(const char *list) {\n\tlb->SetList(list, separator, typesep);\n}\n\nvoid AutoComplete::Show(bool show) {\n\tlb->Show(show);\n\tif (show)\n\t\tlb->Select(0);\n}\n\nvoid AutoComplete::Cancel() {\n\tif (lb->Created()) {\n\t\tlb->Clear();\n\t\tlb->Destroy();\n\t\tactive = false;\n\t}\n}\n\n\nvoid AutoComplete::Move(int delta) {\n\tint count = lb->Length();\n\tint current = lb->GetSelection();\n\tcurrent += delta;\n\tif (current >= count)\n\t\tcurrent = count - 1;\n\tif (current < 0)\n\t\tcurrent = 0;\n\tlb->Select(current);\n}\n\nvoid AutoComplete::Select(const char *word) {\n\tsize_t lenWord = strlen(word);\n\tint location = -1;\n\tconst int maxItemLen=1000;\n\tint start = 0; \/\/ lower bound of the api array block to search\n\tint end = lb->Length() - 1; \/\/ upper bound of the api array block to search\n\twhile ((start <= end) && (location == -1)) { \/\/ Binary searching loop\n\t\tint pivot = (start + end) \/ 2;\n\t\tchar item[maxItemLen];\n\t\tlb->GetValue(pivot, item, maxItemLen);\n\t\tint cond;\n\t\tif (ignoreCase)\n\t\t\tcond = CompareNCaseInsensitive(word, item, lenWord);\n\t\telse\n\t\t\tcond = strncmp(word, item, lenWord);\n\t\tif (!cond) {\n\t\t\t\/\/ Find first match\n\t\t\twhile (pivot > start) {\n\t\t\t\tlb->GetValue(pivot-1, item, maxItemLen);\n\t\t\t\tif (ignoreCase)\n\t\t\t\t\tcond = CompareNCaseInsensitive(word, item, lenWord);\n\t\t\t\telse\n\t\t\t\t\tcond = strncmp(word, item, lenWord);\n\t\t\t\tif (0 != cond)\n\t\t\t\t\tbreak;\n\t\t\t\t--pivot;\n\t\t\t}\n\t\t\tlocation = pivot;\n\t\t\tif (ignoreCase\n\t\t\t\t&& ignoreCaseBehaviour == SC_CASEINSENSITITIVEBEHAVIOUR_RESPECTCASE) {\n\t\t\t\t\/\/ Check for exact-case match\n\t\t\t\tfor (; pivot <= end; pivot++) {\n\t\t\t\t\tlb->GetValue(pivot, item, maxItemLen);\n\t\t\t\t\tif (!strncmp(word, item, lenWord)) {\n\t\t\t\t\t\tlocation = pivot;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tif (CompareNCaseInsensitive(word, item, lenWord))\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t} else if (cond < 0) {\n\t\t\tend = pivot - 1;\n\t\t} else if (cond > 0) {\n\t\t\tstart = pivot + 1;\n\t\t}\n\t}\n\tif (location == -1 && autoHide)\n\t\tCancel();\n\telse\n\t\tlb->Select(location);\n}\n\n<commit_msg>Matched spelling change.<commit_after>\/\/ Scintilla source code edit control\n\/** @file AutoComplete.cxx\n ** Defines the auto completion list box.\n **\/\n\/\/ Copyright 1998-2003 by Neil Hodgson <neilh@scintilla.org>\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include <stdlib.h>\n#include <string.h>\n#include <stdio.h>\n#include <assert.h>\n\n#include \"Platform.h\"\n\n#include \"CharacterSet.h\"\n#include \"AutoComplete.h\"\n#include \"Scintilla.h\"\n\n#ifdef SCI_NAMESPACE\nusing namespace Scintilla;\n#endif\n\nAutoComplete::AutoComplete() :\n\tactive(false),\n\tseparator(' '),\n\ttypesep('?'),\n\tignoreCase(false),\n\tchooseSingle(false),\n\tlb(0),\n\tposStart(0),\n\tstartLen(0),\n\tcancelAtStartPos(true),\n\tautoHide(true),\n\tdropRestOfWord(false),\n\tignoreCaseBehaviour(SC_CASEINSENSITIVEBEHAVIOUR_RESPECTCASE) {\n\tlb = ListBox::Allocate();\n\tstopChars[0] = '\\0';\n\tfillUpChars[0] = '\\0';\n}\n\nAutoComplete::~AutoComplete() {\n\tif (lb) {\n\t\tlb->Destroy();\n\t\tdelete lb;\n\t\tlb = 0;\n\t}\n}\n\nbool AutoComplete::Active() const {\n\treturn active;\n}\n\nvoid AutoComplete::Start(Window &parent, int ctrlID,\n\tint position, Point location, int startLen_,\n\tint lineHeight, bool unicodeMode, int technology) {\n\tif (active) {\n\t\tCancel();\n\t}\n\tlb->Create(parent, ctrlID, location, lineHeight, unicodeMode, technology);\n\tlb->Clear();\n\tactive = true;\n\tstartLen = startLen_;\n\tposStart = position;\n}\n\nvoid AutoComplete::SetStopChars(const char *stopChars_) {\n\tstrncpy(stopChars, stopChars_, sizeof(stopChars));\n\tstopChars[sizeof(stopChars) - 1] = '\\0';\n}\n\nbool AutoComplete::IsStopChar(char ch) {\n\treturn ch && strchr(stopChars, ch);\n}\n\nvoid AutoComplete::SetFillUpChars(const char *fillUpChars_) {\n\tstrncpy(fillUpChars, fillUpChars_, sizeof(fillUpChars));\n\tfillUpChars[sizeof(fillUpChars) - 1] = '\\0';\n}\n\nbool AutoComplete::IsFillUpChar(char ch) {\n\treturn ch && strchr(fillUpChars, ch);\n}\n\nvoid AutoComplete::SetSeparator(char separator_) {\n\tseparator = separator_;\n}\n\nchar AutoComplete::GetSeparator() const {\n\treturn separator;\n}\n\nvoid AutoComplete::SetTypesep(char separator_) {\n\ttypesep = separator_;\n}\n\nchar AutoComplete::GetTypesep() const {\n\treturn typesep;\n}\n\nvoid AutoComplete::SetList(const char *list) {\n\tlb->SetList(list, separator, typesep);\n}\n\nvoid AutoComplete::Show(bool show) {\n\tlb->Show(show);\n\tif (show)\n\t\tlb->Select(0);\n}\n\nvoid AutoComplete::Cancel() {\n\tif (lb->Created()) {\n\t\tlb->Clear();\n\t\tlb->Destroy();\n\t\tactive = false;\n\t}\n}\n\n\nvoid AutoComplete::Move(int delta) {\n\tint count = lb->Length();\n\tint current = lb->GetSelection();\n\tcurrent += delta;\n\tif (current >= count)\n\t\tcurrent = count - 1;\n\tif (current < 0)\n\t\tcurrent = 0;\n\tlb->Select(current);\n}\n\nvoid AutoComplete::Select(const char *word) {\n\tsize_t lenWord = strlen(word);\n\tint location = -1;\n\tconst int maxItemLen=1000;\n\tint start = 0; \/\/ lower bound of the api array block to search\n\tint end = lb->Length() - 1; \/\/ upper bound of the api array block to search\n\twhile ((start <= end) && (location == -1)) { \/\/ Binary searching loop\n\t\tint pivot = (start + end) \/ 2;\n\t\tchar item[maxItemLen];\n\t\tlb->GetValue(pivot, item, maxItemLen);\n\t\tint cond;\n\t\tif (ignoreCase)\n\t\t\tcond = CompareNCaseInsensitive(word, item, lenWord);\n\t\telse\n\t\t\tcond = strncmp(word, item, lenWord);\n\t\tif (!cond) {\n\t\t\t\/\/ Find first match\n\t\t\twhile (pivot > start) {\n\t\t\t\tlb->GetValue(pivot-1, item, maxItemLen);\n\t\t\t\tif (ignoreCase)\n\t\t\t\t\tcond = CompareNCaseInsensitive(word, item, lenWord);\n\t\t\t\telse\n\t\t\t\t\tcond = strncmp(word, item, lenWord);\n\t\t\t\tif (0 != cond)\n\t\t\t\t\tbreak;\n\t\t\t\t--pivot;\n\t\t\t}\n\t\t\tlocation = pivot;\n\t\t\tif (ignoreCase\n\t\t\t\t&& ignoreCaseBehaviour == SC_CASEINSENSITIVEBEHAVIOUR_RESPECTCASE) {\n\t\t\t\t\/\/ Check for exact-case match\n\t\t\t\tfor (; pivot <= end; pivot++) {\n\t\t\t\t\tlb->GetValue(pivot, item, maxItemLen);\n\t\t\t\t\tif (!strncmp(word, item, lenWord)) {\n\t\t\t\t\t\tlocation = pivot;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tif (CompareNCaseInsensitive(word, item, lenWord))\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t} else if (cond < 0) {\n\t\t\tend = pivot - 1;\n\t\t} else if (cond > 0) {\n\t\t\tstart = pivot + 1;\n\t\t}\n\t}\n\tif (location == -1 && autoHide)\n\t\tCancel();\n\telse\n\t\tlb->Select(location);\n}\n\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#include <vw\/Mosaic\/GigapanQuadTreeConfig.h>\n\n#include <boost\/bind.hpp>\n\n#include <boost\/filesystem\/path.hpp>\n#include <boost\/filesystem\/operations.hpp>\n#include <boost\/filesystem\/fstream.hpp>\n#include <boost\/filesystem\/convenience.hpp>\nnamespace fs = boost::filesystem;\n\nnamespace vw {\nnamespace mosaic {\n\n  struct GigapanQuadTreeConfigData {\n    BBox2 m_longlat_bbox;\n\n\n    std::vector<std::pair<std::string,vw::BBox2i> > branch_func( QuadTreeGenerator const&, std::string const& name, BBox2i const& region ) const;\n    void metadata_func( QuadTreeGenerator const&, QuadTreeGenerator::TileInfo const& info ) const;\n\n    public:\n      GigapanQuadTreeConfigData() : m_longlat_bbox(0, 0, 0, 0) {}\n  };\n\n  GigapanQuadTreeConfig::GigapanQuadTreeConfig()\n    : m_data( new GigapanQuadTreeConfigData() )\n  {}\n\n  std::string GigapanQuadTreeConfig::image_path( QuadTreeGenerator const& qtree, std::string const& name ) {\n    return QuadTreeGenerator::tiered_image_path()(qtree, name);\n  }\n\n  void GigapanQuadTreeConfig::configure( QuadTreeGenerator& qtree ) const {\n    qtree.set_image_path_func( &image_path );\n    qtree.set_cull_images( true );\n    qtree.set_metadata_func( boost::bind(&GigapanQuadTreeConfigData::metadata_func,m_data,_1,_2) );\n    \n    if (m_data->m_longlat_bbox.width() != 0 || m_data->m_longlat_bbox.height() != 0) {\n      qtree.set_branch_func( boost::bind(&GigapanQuadTreeConfigData::branch_func,m_data,_1,_2,_3) );\n    }\n  }\n\n  void GigapanQuadTreeConfig::set_longlat_bbox( BBox2 const& bbox ) {\n    m_data->m_longlat_bbox = bbox;\n  }\n\n  std::vector<std::pair<std::string,vw::BBox2i> > GigapanQuadTreeConfigData::branch_func( QuadTreeGenerator const& qtree, std::string const& name, BBox2i const& region ) const {\n    std::vector<std::pair<std::string,vw::BBox2i> > children;\n    if( region.height() > qtree.get_tile_size() ) {\n\n      Vector2i dims = qtree.get_dimensions();\n      double aspect_ratio = 2 * (region.width()\/region.height()) * ( (m_longlat_bbox.width()\/dims.x()) \/ (m_longlat_bbox.height()\/dims.y()) );\n\n      double bottom_lat = m_longlat_bbox.max().y() - region.max().y()*m_longlat_bbox.height() \/ dims.y();\n      double top_lat = m_longlat_bbox.max().y() - region.min().y()*m_longlat_bbox.height() \/ dims.y();\n      bool top_merge = ( bottom_lat > 0 ) && ( ( 1.0 \/ cos(M_PI\/180 * bottom_lat) ) > aspect_ratio );\n      bool bottom_merge = ( top_lat < 0 ) && ( ( 1.0 \/ cos(M_PI\/180 * top_lat) ) > aspect_ratio );\n\n      if( top_merge ) {\n        children.push_back( std::make_pair( name + \"4\", BBox2i( region.min(), region.max() - Vector2i(0,region.height()\/2) ) ) );\n      }\n      else {\n        children.push_back( std::make_pair( name + \"0\", BBox2i( (region + region.min()) \/ 2 ) ) );\n        children.push_back( std::make_pair( name + \"1\", BBox2i( (region + Vector2i(region.max().x(),region.min().y())) \/ 2 ) ) );\n      }\n      if( bottom_merge ) {\n        children.push_back( std::make_pair( name + \"5\", BBox2i( region.min() + Vector2i(0,region.height()\/2), region.max() ) ) );\n      }\n      else {\n        children.push_back( std::make_pair( name + \"2\", BBox2i( (region + Vector2i(region.min().x(),region.max().y())) \/ 2 ) ) );\n        children.push_back( std::make_pair( name + \"3\", BBox2i( (region + region.max()) \/ 2 ) ) );\n      }\n    }\n    return children;\n  }\n\n  void GigapanQuadTreeConfigData::metadata_func( QuadTreeGenerator const& qtree, QuadTreeGenerator::TileInfo const& info ) const {\n    bool root_node = ( info.name.size() == 0 );\n    \n    \n    if ( root_node) { \n      std::ostringstream json;\n      fs::path file_path( info.filepath, fs::native );\n      int base_len = file_path.branch_path().native_file_string().size() + 1;\n      fs::path json_path = change_extension( file_path, \".json\" );\n\n      json << \"{\" << std::endl\n           << \"  width: \" << qtree.get_dimensions()[0] << \",\" << std::endl\n           << \"  height: \" << qtree.get_dimensions()[1] << \",\" << std::endl\n           << \"  nlevels: \" << qtree.get_tree_levels() << std::endl\n           << \"}\" << std::endl;\n\n      fs::ofstream jsonfs(json_path);\n      jsonfs << json.str();  \n    }\n  }\n} \/\/ namespace mosaic\n} \/\/ namespace vw\n<commit_msg>changed to real json<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#include <vw\/Mosaic\/GigapanQuadTreeConfig.h>\n\n#include <boost\/bind.hpp>\n\n#include <boost\/filesystem\/path.hpp>\n#include <boost\/filesystem\/operations.hpp>\n#include <boost\/filesystem\/fstream.hpp>\n#include <boost\/filesystem\/convenience.hpp>\nnamespace fs = boost::filesystem;\n\nnamespace vw {\nnamespace mosaic {\n\n  struct GigapanQuadTreeConfigData {\n    BBox2 m_longlat_bbox;\n\n\n    std::vector<std::pair<std::string,vw::BBox2i> > branch_func( QuadTreeGenerator const&, std::string const& name, BBox2i const& region ) const;\n    void metadata_func( QuadTreeGenerator const&, QuadTreeGenerator::TileInfo const& info ) const;\n\n    public:\n      GigapanQuadTreeConfigData() : m_longlat_bbox(0, 0, 0, 0) {}\n  };\n\n  GigapanQuadTreeConfig::GigapanQuadTreeConfig()\n    : m_data( new GigapanQuadTreeConfigData() )\n  {}\n\n  std::string GigapanQuadTreeConfig::image_path( QuadTreeGenerator const& qtree, std::string const& name ) {\n    return QuadTreeGenerator::tiered_image_path()(qtree, name);\n  }\n\n  void GigapanQuadTreeConfig::configure( QuadTreeGenerator& qtree ) const {\n    qtree.set_image_path_func( &image_path );\n    qtree.set_cull_images( true );\n    qtree.set_metadata_func( boost::bind(&GigapanQuadTreeConfigData::metadata_func,m_data,_1,_2) );\n    \n    if (m_data->m_longlat_bbox.width() != 0 || m_data->m_longlat_bbox.height() != 0) {\n      qtree.set_branch_func( boost::bind(&GigapanQuadTreeConfigData::branch_func,m_data,_1,_2,_3) );\n    }\n  }\n\n  void GigapanQuadTreeConfig::set_longlat_bbox( BBox2 const& bbox ) {\n    m_data->m_longlat_bbox = bbox;\n  }\n\n  std::vector<std::pair<std::string,vw::BBox2i> > GigapanQuadTreeConfigData::branch_func( QuadTreeGenerator const& qtree, std::string const& name, BBox2i const& region ) const {\n    std::vector<std::pair<std::string,vw::BBox2i> > children;\n    if( region.height() > qtree.get_tile_size() ) {\n\n      Vector2i dims = qtree.get_dimensions();\n      double aspect_ratio = 2 * (region.width()\/region.height()) * ( (m_longlat_bbox.width()\/dims.x()) \/ (m_longlat_bbox.height()\/dims.y()) );\n\n      double bottom_lat = m_longlat_bbox.max().y() - region.max().y()*m_longlat_bbox.height() \/ dims.y();\n      double top_lat = m_longlat_bbox.max().y() - region.min().y()*m_longlat_bbox.height() \/ dims.y();\n      bool top_merge = ( bottom_lat > 0 ) && ( ( 1.0 \/ cos(M_PI\/180 * bottom_lat) ) > aspect_ratio );\n      bool bottom_merge = ( top_lat < 0 ) && ( ( 1.0 \/ cos(M_PI\/180 * top_lat) ) > aspect_ratio );\n\n      if( top_merge ) {\n        children.push_back( std::make_pair( name + \"4\", BBox2i( region.min(), region.max() - Vector2i(0,region.height()\/2) ) ) );\n      }\n      else {\n        children.push_back( std::make_pair( name + \"0\", BBox2i( (region + region.min()) \/ 2 ) ) );\n        children.push_back( std::make_pair( name + \"1\", BBox2i( (region + Vector2i(region.max().x(),region.min().y())) \/ 2 ) ) );\n      }\n      if( bottom_merge ) {\n        children.push_back( std::make_pair( name + \"5\", BBox2i( region.min() + Vector2i(0,region.height()\/2), region.max() ) ) );\n      }\n      else {\n        children.push_back( std::make_pair( name + \"2\", BBox2i( (region + Vector2i(region.min().x(),region.max().y())) \/ 2 ) ) );\n        children.push_back( std::make_pair( name + \"3\", BBox2i( (region + region.max()) \/ 2 ) ) );\n      }\n    }\n    return children;\n  }\n\n  void GigapanQuadTreeConfigData::metadata_func( QuadTreeGenerator const& qtree, QuadTreeGenerator::TileInfo const& info ) const {\n    bool root_node = ( info.name.size() == 0 );\n    \n    \n    if ( root_node) { \n      std::ostringstream json;\n      fs::path file_path( info.filepath, fs::native );\n      int base_len = file_path.branch_path().native_file_string().size() + 1;\n      fs::path json_path = change_extension( file_path, \".json\" );\n\n      json << \"{\" << std::endl\n           << \"  \\\"width\\\": \" << qtree.get_dimensions()[0] << \",\" << std::endl\n           << \"  \\\"height\\\": \" << qtree.get_dimensions()[1] << \",\" << std::endl\n           << \"  \\\"nlevels\\\": \" << qtree.get_tree_levels() << std::endl\n           << \"}\" << std::endl;\n\n      fs::ofstream jsonfs(json_path);\n      jsonfs << json.str();  \n    }\n  }\n} \/\/ namespace mosaic\n} \/\/ namespace vw\n<|endoftext|>"}
{"text":"<commit_before>\/\/===------ SimplifyInstructions.cpp - Remove redundant instructions ------===\/\/\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 a utility pass used for testing the InstructionSimplify analysis.\n\/\/ The analysis is applied to every instruction, and if it simplifies then the\n\/\/ instruction is replaced by the simplification.  If you are looking for a pass\n\/\/ that performs serious instruction folding, use the instcombine pass instead.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Transforms\/Utils\/SimplifyInstructions.h\"\n#include \"llvm\/ADT\/DepthFirstIterator.h\"\n#include \"llvm\/ADT\/SmallPtrSet.h\"\n#include \"llvm\/ADT\/Statistic.h\"\n#include \"llvm\/Analysis\/AssumptionCache.h\"\n#include \"llvm\/Analysis\/InstructionSimplify.h\"\n#include \"llvm\/Analysis\/TargetLibraryInfo.h\"\n#include \"llvm\/IR\/DataLayout.h\"\n#include \"llvm\/IR\/Dominators.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/IR\/Type.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/Transforms\/Utils\/Local.h\"\n#include \"llvm\/Transforms\/Scalar.h\"\nusing namespace llvm;\n\n#define DEBUG_TYPE \"instsimplify\"\n\nSTATISTIC(NumSimplified, \"Number of redundant instructions removed\");\n\nstatic bool runImpl(Function &F, const DominatorTree *DT, const TargetLibraryInfo *TLI,\n                    AssumptionCache *AC) {\n  const DataLayout &DL = F.getParent()->getDataLayout();\n  SmallPtrSet<const Instruction*, 8> S1, S2, *ToSimplify = &S1, *Next = &S2;\n  bool Changed = false;\n\n  do {\n    for (BasicBlock *BB : depth_first(&F.getEntryBlock()))\n      \/\/ Here be subtlety: the iterator must be incremented before the loop\n      \/\/ body (not sure why), so a range-for loop won't work here.\n      for (BasicBlock::iterator BI = BB->begin(), BE = BB->end(); BI != BE;) {\n        Instruction *I = &*BI++;\n        \/\/ The first time through the loop ToSimplify is empty and we try to\n        \/\/ simplify all instructions.  On later iterations ToSimplify is not\n        \/\/ empty and we only bother simplifying instructions that are in it.\n        if (!ToSimplify->empty() && !ToSimplify->count(I))\n          continue;\n        \/\/ Don't waste time simplifying unused instructions.\n        if (!I->use_empty())\n          if (Value *V = SimplifyInstruction(I, DL, TLI, DT, AC)) {\n            \/\/ Mark all uses for resimplification next time round the loop.\n            for (User *U : I->users())\n              Next->insert(cast<Instruction>(U));\n            I->replaceAllUsesWith(V);\n            ++NumSimplified;\n            Changed = true;\n          }\n        bool res = RecursivelyDeleteTriviallyDeadInstructions(I, TLI);\n        if (res)  {\n          \/\/ RecursivelyDeleteTriviallyDeadInstruction can remove\n          \/\/ more than one instruction, so simply incrementing the\n          \/\/ iterator does not work. When instructions get deleted\n          \/\/ re-iterate instead.\n          BI = BB->begin(); BE = BB->end();\n          Changed |= res;\n        }\n      }\n\n    \/\/ Place the list of instructions to simplify on the next loop iteration\n    \/\/ into ToSimplify.\n    std::swap(ToSimplify, Next);\n    Next->clear();\n  } while (!ToSimplify->empty());\n\n  return Changed;\n}\n\nnamespace {\n  struct InstSimplifier : public FunctionPass {\n    static char ID; \/\/ Pass identification, replacement for typeid\n    InstSimplifier() : FunctionPass(ID) {\n      initializeInstSimplifierPass(*PassRegistry::getPassRegistry());\n    }\n\n    void getAnalysisUsage(AnalysisUsage &AU) const override {\n      AU.setPreservesCFG();\n      AU.addRequired<AssumptionCacheTracker>();\n      AU.addRequired<TargetLibraryInfoWrapperPass>();\n    }\n\n    \/\/\/ runOnFunction - Remove instructions that simplify.\n    bool runOnFunction(Function &F) override {\n      if (skipFunction(F))\n        return false;\n\n      const DominatorTreeWrapperPass *DTWP =\n          getAnalysisIfAvailable<DominatorTreeWrapperPass>();\n      const DominatorTree *DT = DTWP ? &DTWP->getDomTree() : nullptr;\n      const TargetLibraryInfo *TLI =\n          &getAnalysis<TargetLibraryInfoWrapperPass>().getTLI();\n      AssumptionCache *AC =\n          &getAnalysis<AssumptionCacheTracker>().getAssumptionCache(F);\n      return runImpl(F, DT, TLI, AC);\n    }\n  };\n}\n\nchar InstSimplifier::ID = 0;\nINITIALIZE_PASS_BEGIN(InstSimplifier, \"instsimplify\",\n                      \"Remove redundant instructions\", false, false)\nINITIALIZE_PASS_DEPENDENCY(AssumptionCacheTracker)\nINITIALIZE_PASS_DEPENDENCY(TargetLibraryInfoWrapperPass)\nINITIALIZE_PASS_END(InstSimplifier, \"instsimplify\",\n                    \"Remove redundant instructions\", false, false)\nchar &llvm::InstructionSimplifierID = InstSimplifier::ID;\n\n\/\/ Public interface to the simplify instructions pass.\nFunctionPass *llvm::createInstructionSimplifierPass() {\n  return new InstSimplifier();\n}\n\nPreservedAnalyses InstSimplifierPass::run(Function &F,\n                                      FunctionAnalysisManager &AM) {\n  auto *DT = AM.getCachedResult<DominatorTreeAnalysis>(F);\n  auto &TLI = AM.getResult<TargetLibraryAnalysis>(F);\n  auto &AC = AM.getResult<AssumptionAnalysis>(F);\n  bool Changed = runImpl(F, DT, &TLI, &AC);\n  if (!Changed)\n    return PreservedAnalyses::all();\n  \/\/ FIXME: This should also 'preserve the CFG'.\n  return PreservedAnalyses::none();\n}\n<commit_msg>Explicitly require DominatorTreeAnalysis pass for instsimplify pass.<commit_after>\/\/===------ SimplifyInstructions.cpp - Remove redundant instructions ------===\/\/\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 a utility pass used for testing the InstructionSimplify analysis.\n\/\/ The analysis is applied to every instruction, and if it simplifies then the\n\/\/ instruction is replaced by the simplification.  If you are looking for a pass\n\/\/ that performs serious instruction folding, use the instcombine pass instead.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Transforms\/Utils\/SimplifyInstructions.h\"\n#include \"llvm\/ADT\/DepthFirstIterator.h\"\n#include \"llvm\/ADT\/SmallPtrSet.h\"\n#include \"llvm\/ADT\/Statistic.h\"\n#include \"llvm\/Analysis\/AssumptionCache.h\"\n#include \"llvm\/Analysis\/InstructionSimplify.h\"\n#include \"llvm\/Analysis\/TargetLibraryInfo.h\"\n#include \"llvm\/IR\/DataLayout.h\"\n#include \"llvm\/IR\/Dominators.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/IR\/Type.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/Transforms\/Utils\/Local.h\"\n#include \"llvm\/Transforms\/Scalar.h\"\nusing namespace llvm;\n\n#define DEBUG_TYPE \"instsimplify\"\n\nSTATISTIC(NumSimplified, \"Number of redundant instructions removed\");\n\nstatic bool runImpl(Function &F, const DominatorTree *DT, const TargetLibraryInfo *TLI,\n                    AssumptionCache *AC) {\n  const DataLayout &DL = F.getParent()->getDataLayout();\n  SmallPtrSet<const Instruction*, 8> S1, S2, *ToSimplify = &S1, *Next = &S2;\n  bool Changed = false;\n\n  do {\n    for (BasicBlock *BB : depth_first(&F.getEntryBlock()))\n      \/\/ Here be subtlety: the iterator must be incremented before the loop\n      \/\/ body (not sure why), so a range-for loop won't work here.\n      for (BasicBlock::iterator BI = BB->begin(), BE = BB->end(); BI != BE;) {\n        Instruction *I = &*BI++;\n        \/\/ The first time through the loop ToSimplify is empty and we try to\n        \/\/ simplify all instructions.  On later iterations ToSimplify is not\n        \/\/ empty and we only bother simplifying instructions that are in it.\n        if (!ToSimplify->empty() && !ToSimplify->count(I))\n          continue;\n        \/\/ Don't waste time simplifying unused instructions.\n        if (!I->use_empty())\n          if (Value *V = SimplifyInstruction(I, DL, TLI, DT, AC)) {\n            \/\/ Mark all uses for resimplification next time round the loop.\n            for (User *U : I->users())\n              Next->insert(cast<Instruction>(U));\n            I->replaceAllUsesWith(V);\n            ++NumSimplified;\n            Changed = true;\n          }\n        bool res = RecursivelyDeleteTriviallyDeadInstructions(I, TLI);\n        if (res)  {\n          \/\/ RecursivelyDeleteTriviallyDeadInstruction can remove\n          \/\/ more than one instruction, so simply incrementing the\n          \/\/ iterator does not work. When instructions get deleted\n          \/\/ re-iterate instead.\n          BI = BB->begin(); BE = BB->end();\n          Changed |= res;\n        }\n      }\n\n    \/\/ Place the list of instructions to simplify on the next loop iteration\n    \/\/ into ToSimplify.\n    std::swap(ToSimplify, Next);\n    Next->clear();\n  } while (!ToSimplify->empty());\n\n  return Changed;\n}\n\nnamespace {\n  struct InstSimplifier : public FunctionPass {\n    static char ID; \/\/ Pass identification, replacement for typeid\n    InstSimplifier() : FunctionPass(ID) {\n      initializeInstSimplifierPass(*PassRegistry::getPassRegistry());\n    }\n\n    void getAnalysisUsage(AnalysisUsage &AU) const override {\n      AU.setPreservesCFG();\n      AU.addRequired<DominatorTreeWrapperPass>();\n      AU.addRequired<AssumptionCacheTracker>();\n      AU.addRequired<TargetLibraryInfoWrapperPass>();\n    }\n\n    \/\/\/ runOnFunction - Remove instructions that simplify.\n    bool runOnFunction(Function &F) override {\n      if (skipFunction(F))\n        return false;\n\n      const DominatorTree *DT =\n          &getAnalysis<DominatorTreeWrapperPass>().getDomTree();\n      const TargetLibraryInfo *TLI =\n          &getAnalysis<TargetLibraryInfoWrapperPass>().getTLI();\n      AssumptionCache *AC =\n          &getAnalysis<AssumptionCacheTracker>().getAssumptionCache(F);\n      return runImpl(F, DT, TLI, AC);\n    }\n  };\n}\n\nchar InstSimplifier::ID = 0;\nINITIALIZE_PASS_BEGIN(InstSimplifier, \"instsimplify\",\n                      \"Remove redundant instructions\", false, false)\nINITIALIZE_PASS_DEPENDENCY(AssumptionCacheTracker)\nINITIALIZE_PASS_DEPENDENCY(DominatorTreeWrapperPass)\nINITIALIZE_PASS_DEPENDENCY(TargetLibraryInfoWrapperPass)\nINITIALIZE_PASS_END(InstSimplifier, \"instsimplify\",\n                    \"Remove redundant instructions\", false, false)\nchar &llvm::InstructionSimplifierID = InstSimplifier::ID;\n\n\/\/ Public interface to the simplify instructions pass.\nFunctionPass *llvm::createInstructionSimplifierPass() {\n  return new InstSimplifier();\n}\n\nPreservedAnalyses InstSimplifierPass::run(Function &F,\n                                      FunctionAnalysisManager &AM) {\n  auto &DT = AM.getResult<DominatorTreeAnalysis>(F);\n  auto &TLI = AM.getResult<TargetLibraryAnalysis>(F);\n  auto &AC = AM.getResult<AssumptionAnalysis>(F);\n  bool Changed = runImpl(F, &DT, &TLI, &AC);\n  if (!Changed)\n    return PreservedAnalyses::all();\n  \/\/ FIXME: This should also 'preserve the CFG'.\n  return PreservedAnalyses::none();\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"GapsParameters.h\"\r\n#include \"utils\/Archive.h\"\r\n#include \"utils\/GapsPrint.h\"\r\n#include \"file_parser\/FileParser.h\"\r\n\r\nvoid GapsParameters::print() const\r\n{\r\n    gaps_printf(\"\\n---- C++ Parameters ----\\n\\n\");\r\n    gaps_printf(\"transposeData: %s\\n\", transposeData ? \"TRUE\" : \"FALSE\");\r\n    gaps_printf(\"nGenes: %d\\n\", nGenes);\r\n    gaps_printf(\"nSamples: %d\\n\", nSamples);\r\n    gaps_printf(\"nPatterns: %d\\n\", nPatterns);\r\n    gaps_printf(\"nIterations: %d\\n\", nIterations);\r\n    gaps_printf(\"seed: %d\\n\", seed);\r\n    gaps_printf(\"\\n\");\r\n    gaps_printf(\"maxThreads: %d\\n\", maxThreads);\r\n    gaps_printf(\"printMessages: %s\\n\", printMessages ? \"TRUE\" : \"FALSE\");\r\n    gaps_printf(\"outputFrequency: %d\\n\", outputFrequency);\r\n    gaps_printf(\"snapshotFrequency: %d\\n\", snapshotFrequency);\r\n    gaps_printf(\"\\n\");\r\n    gaps_printf(\"useSparseOptimization: %s\\n\", useSparseOptimization ? \"TRUE\" : \"FALSE\");\r\n    gaps_printf(\"asynchronousUpdates: %s\\n\", asynchronousUpdates ? \"TRUE\" : \"FALSE\");\r\n    gaps_printf(\"takePumpSamples: %s\\n\", takePumpSamples ? \"TRUE\" : \"FALSE\");\r\n    gaps_printf(\"\\n\");\r\n    gaps_printf(\"runningDistributed: %s\\n\", runningDistributed ? \"TRUE\" : \"FALSE\");\r\n    gaps_printf(\"printThreadUsage: %s\\n\", printThreadUsage ? \"TRUE\" : \"FALSE\");\r\n    gaps_printf(\"workerID: %d\\n\", workerID);\r\n    gaps_printf(\"\\n\");\r\n    gaps_printf(\"alphaA: %f\\n\", alphaA);\r\n    gaps_printf(\"alphaP: %f\\n\", alphaP);\r\n    gaps_printf(\"maxGibbsMassA: %f\\n\", maxGibbsMassA);\r\n    gaps_printf(\"maxGibbsMassP: %f\\n\", maxGibbsMassP);\r\n    gaps_printf(\"\\n\");\r\n    gaps_printf(\"useCheckPoint: %s\\n\", useCheckPoint ? \"TRUE\" : \"FALSE\");\r\n    gaps_printf(\"checkpointInterval: %d\\n\", checkpointInterval);\r\n    gaps_printf(\"checkpointFile: %s\\n\", checkpointFile.c_str());\r\n    gaps_printf(\"checkpointOutFile: %s\\n\", checkpointOutFile.c_str());\r\n    gaps_printf(\"\\n\");\r\n    gaps_printf(\"subsetData: %s\\n\", subsetData ? \"TRUE\" : \"FALSE\");\r\n    gaps_printf(\"subsetGenes: %s\\n\", subsetGenes ? \"TRUE\" : \"FALSE\");\r\n    gaps_printf(\"dataIndicesSubset.size(): %lu\\n\", dataIndicesSubset.size());\r\n    gaps_printf(\"\\n\");\r\n    gaps_printf(\"useFixedPatterns: %s\\n\", useFixedPatterns ? \"TRUE\" : \"FALSE\");\r\n    gaps_printf(\"whichMatrixFixed: %c\\n\", whichMatrixFixed);\r\n    gaps_printf(\"fixedPatterns.nRow(): %d\\n\", fixedPatterns.nRow());\r\n    gaps_printf(\"fixedPatterns.nCol(): %d\\n\", fixedPatterns.nCol());\r\n    gaps_printf(\"\\n------------------------\\n\\n\");\r\n}\r\n\r\nvoid GapsParameters::calculateDataDimensions(const std::string &file)\r\n{\r\n    FileParser fp(file);\r\n    nGenes = transposeData ? fp.nCol() : fp.nRow();\r\n    nSamples = transposeData ? fp.nRow() : fp.nCol();\r\n    if (subsetData && subsetGenes)\r\n    {\r\n        nGenes = dataIndicesSubset.size();\r\n    }\r\n    if (subsetData && !subsetGenes)\r\n    {\r\n        nSamples = dataIndicesSubset.size();\r\n    }\r\n}\r\n\r\nvoid GapsParameters::calculateDataDimensions(const Matrix &mat)\r\n{\r\n    nGenes = transposeData ? mat.nCol() : mat.nRow();\r\n    nSamples = transposeData ? mat.nRow() : mat.nCol();\r\n    if (subsetData && subsetGenes)\r\n    {\r\n        nGenes = dataIndicesSubset.size();\r\n    }\r\n    if (subsetData && !subsetGenes)\r\n    {\r\n        nSamples = dataIndicesSubset.size();\r\n    }\r\n}\r\n\r\nArchive& operator<<(Archive &ar, const GapsParameters &p)\r\n{\r\n    ar << p.seed << p.nGenes << p.nSamples << p.nPatterns << p.nIterations\r\n        << p.alphaA << p.alphaP << p.maxGibbsMassA << p.maxGibbsMassP\r\n        << p.useSparseOptimization << p.checkpointInterval;\r\n    return ar;\r\n}\r\n\r\nArchive& operator>>(Archive &ar, GapsParameters &p)\r\n{\r\n    ar >> p.seed >> p.nGenes >> p.nSamples >> p.nPatterns >> p.nIterations\r\n        >> p.alphaA >> p.alphaP >> p.maxGibbsMassA >> p.maxGibbsMassP\r\n        >> p.useSparseOptimization >> p.checkpointInterval;\r\n    return ar;\r\n}\r\n<commit_msg>not broken<commit_after>#include \"GapsParameters.h\"\r\n#include \"utils\/Archive.h\"\r\n#include \"utils\/GapsPrint.h\"\r\n#include \"file_parser\/FileParser.h\"\r\n\r\nvoid GapsParameters::print() const\r\n{\r\n    gaps_printf(\"\\n---- C++ Parameters ----\\n\\n\");\r\n    gaps_printf(\"transposeData: %s\\n\", transposeData ? \"TRUE\" : \"FALSE\");\r\n    gaps_printf(\"nGenes: %d\\n\", nGenes);\r\n    gaps_printf(\"nSamples: %d\\n\", nSamples);\r\n    gaps_printf(\"nPatterns: %d\\n\", nPatterns);\r\n    gaps_printf(\"nIterations: %d\\n\", nIterations);\r\n    gaps_printf(\"seed: %d\\n\", seed);\r\n    gaps_printf(\"\\n\");\r\n    gaps_printf(\"maxThreads: %d\\n\", maxThreads);\r\n    gaps_printf(\"printMessages: %s\\n\", printMessages ? \"TRUE\" : \"FALSE\");\r\n    gaps_printf(\"outputFrequency: %d\\n\", outputFrequency);\r\n    gaps_printf(\"snapshotFrequency: %d\\n\", snapshotFrequency);\r\n    gaps_printf(\"\\n\");\r\n    gaps_printf(\"useSparseOptimization: %s\\n\", useSparseOptimization ? \"TRUE\" : \"FALSE\");\r\n    gaps_printf(\"asynchronousUpdates: %s\\n\", asynchronousUpdates ? \"TRUE\" : \"FALSE\");\r\n    gaps_printf(\"takePumpSamples: %s\\n\", takePumpSamples ? \"TRUE\" : \"FALSE\");\r\n    gaps_printf(\"\\n\");\r\n    gaps_printf(\"runningDistributed: %s\\n\", runningDistributed ? \"TRUE\" : \"FALSE\");\r\n    gaps_printf(\"printThreadUsage: %s\\n\", printThreadUsage ? \"TRUE\" : \"FALSE\");\r\n    gaps_printf(\"workerID: %d\\n\", workerID);\r\n    gaps_printf(\"\\n\");\r\n    gaps_printf(\"alphaA: %f\\n\", alphaA);\r\n    gaps_printf(\"alphaP: %f\\n\", alphaP);\r\n    gaps_printf(\"maxGibbsMassA: %f\\n\", maxGibbsMassA);\r\n    gaps_printf(\"maxGibbsMassP: %f\\n\", maxGibbsMassP);\r\n    gaps_printf(\"\\n\");\r\n    gaps_printf(\"useCheckPoint: %s\\n\", useCheckPoint ? \"TRUE\" : \"FALSE\");\r\n    gaps_printf(\"checkpointInterval: %d\\n\", checkpointInterval);\r\n    gaps_printf(\"checkpointFile: %s\\n\", checkpointFile.c_str());\r\n    gaps_printf(\"checkpointOutFile: %s\\n\", checkpointOutFile.c_str());\r\n    gaps_printf(\"\\n\");\r\n    gaps_printf(\"subsetData: %s\\n\", subsetData ? \"TRUE\" : \"FALSE\");\r\n    gaps_printf(\"subsetGenes: %s\\n\", subsetGenes ? \"TRUE\" : \"FALSE\");\r\n    gaps_printf(\"dataIndicesSubset.size(): %lu\\n\", dataIndicesSubset.size());\r\n    gaps_printf(\"\\n\");\r\n    gaps_printf(\"useFixedPatterns: %s\\n\", useFixedPatterns ? \"TRUE\" : \"FALSE\");\r\n    gaps_printf(\"whichMatrixFixed: %c\\n\", whichMatrixFixed);\r\n    gaps_printf(\"fixedPatterns.nRow(): %d\\n\", fixedPatterns.nRow());\r\n    gaps_printf(\"fixedPatterns.nCol(): %d\\n\", fixedPatterns.nCol());\r\n    gaps_printf(\"\\n------------------------\\n\\n\");\r\n}\r\n\r\nGapsParameters::GapsParameters(){}\r\n\r\nvoid GapsParameters::calculateDataDimensions(const std::string &file)\r\n{\r\n    FileParser fp(file);\r\n    nGenes = transposeData ? fp.nCol() : fp.nRow();\r\n    nSamples = transposeData ? fp.nRow() : fp.nCol();\r\n    if (subsetData && subsetGenes)\r\n    {\r\n        nGenes = dataIndicesSubset.size();\r\n    }\r\n    if (subsetData && !subsetGenes)\r\n    {\r\n        nSamples = dataIndicesSubset.size();\r\n    }\r\n}\r\n\r\nvoid GapsParameters::calculateDataDimensions(const Matrix &mat)\r\n{\r\n    nGenes = transposeData ? mat.nCol() : mat.nRow();\r\n    nSamples = transposeData ? mat.nRow() : mat.nCol();\r\n    if (subsetData && subsetGenes)\r\n    {\r\n        nGenes = dataIndicesSubset.size();\r\n    }\r\n    if (subsetData && !subsetGenes)\r\n    {\r\n        nSamples = dataIndicesSubset.size();\r\n    }\r\n}\r\n\r\nArchive& operator<<(Archive &ar, const GapsParameters &p)\r\n{\r\n    ar << p.seed << p.nGenes << p.nSamples << p.nPatterns << p.nIterations\r\n        << p.alphaA << p.alphaP << p.maxGibbsMassA << p.maxGibbsMassP\r\n        << p.useSparseOptimization << p.checkpointInterval;\r\n    return ar;\r\n}\r\n\r\nArchive& operator>>(Archive &ar, GapsParameters &p)\r\n{\r\n    ar >> p.seed >> p.nGenes >> p.nSamples >> p.nPatterns >> p.nIterations\r\n        >> p.alphaA >> p.alphaP >> p.maxGibbsMassA >> p.maxGibbsMassP\r\n        >> p.useSparseOptimization >> p.checkpointInterval;\r\n    return ar;\r\n}\r\n<|endoftext|>"}
{"text":"<commit_before><commit_msg>VCL: Rearrange most of the rest of the functions in outdev.hxx<commit_after><|endoftext|>"}
{"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2011.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/  http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/=======================================================================\n\n#include <boost\/variant\/apply_visitor.hpp>\n\n#include \"GetTypeVisitor.hpp\"\n\n#include \"ast\/Value.hpp\"\n\n#include \"Context.hpp\"\n#include \"Variable.hpp\"\n\nusing namespace eddic;\n\nType GetTypeVisitor::operator()(const ast::Litteral&) const {\n    return Type(BaseType::STRING, false);\n}\n\nType GetTypeVisitor::operator()(const ast::Integer&) const {\n    return Type(BaseType::INT, false);\n}\n\nType GetTypeVisitor::operator()(const ast::Plus&) const;\n    return Type(BaseType::INT, false);\n}\n\nType GetTypeVisitor::operator()(const ast::Minus&) const;\n    return Type(BaseType::INT, false);\n}\n\nType GetTypeVisitor::operator()(const ast::VariableValue& variable) const {\n    return variable.Content->context->getVariable(variable.Content->variableName)->type();\n}\n\nType GetTypeVisitor::operator()(const ast::ArrayValue& array) const {\n    return array.Content->context->getVariable(array.Content->arrayName)->type();\n}\n\nType GetTypeVisitor::operator()(const ast::ComposedValue& value) const {\n    \/\/No need to recurse into operations because type are enforced in the check variables phase\n    return boost::apply_visitor(*this, value.Content->first);\n}\n\nType GetTypeVisitor::operator()(const ast::FunctionCall& call) const {\n    std::string name = call.Content->functionName;\n\n    assert(name != \"println\" && name != \"print\");\n\n    return call.Content->function->returnType;\n}\n<commit_msg>Little typo fix<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 <boost\/variant\/apply_visitor.hpp>\n\n#include \"GetTypeVisitor.hpp\"\n\n#include \"ast\/Value.hpp\"\n\n#include \"Context.hpp\"\n#include \"Variable.hpp\"\n\nusing namespace eddic;\n\nType GetTypeVisitor::operator()(const ast::Litteral&) const {\n    return Type(BaseType::STRING, false);\n}\n\nType GetTypeVisitor::operator()(const ast::Integer&) const {\n    return Type(BaseType::INT, false);\n}\n\nType GetTypeVisitor::operator()(const ast::Plus&) const {\n    return Type(BaseType::INT, false);\n}\n\nType GetTypeVisitor::operator()(const ast::Minus&) const {\n    return Type(BaseType::INT, false);\n}\n\nType GetTypeVisitor::operator()(const ast::VariableValue& variable) const {\n    return variable.Content->context->getVariable(variable.Content->variableName)->type();\n}\n\nType GetTypeVisitor::operator()(const ast::ArrayValue& array) const {\n    return array.Content->context->getVariable(array.Content->arrayName)->type();\n}\n\nType GetTypeVisitor::operator()(const ast::ComposedValue& value) const {\n    \/\/No need to recurse into operations because type are enforced in the check variables phase\n    return boost::apply_visitor(*this, value.Content->first);\n}\n\nType GetTypeVisitor::operator()(const ast::FunctionCall& call) const {\n    std::string name = call.Content->functionName;\n\n    assert(name != \"println\" && name != \"print\");\n\n    return call.Content->function->returnType;\n}\n<|endoftext|>"}
{"text":"<commit_before>#ifndef COFFEE_MILL_PDB_SEQ\n#define COFFEE_MILL_PDB_SEQ\n#include <mill\/pdb\/PDBChain.hpp>\n#include <mill\/util\/string.hpp>\n#include <algorithm>\n#include <map>\n\nnamespace mill\n{\n\ninline const char* pdb_seq_usage() noexcept\n{\n    return \"usage: mill pdb seq [parameters...]\\n\"\n           \"    $ mill pdb seq model.pdb\\n\"\n           \"      print sequences for each chain\\n\";\n}\n\nstruct amino_acid_code\n{\n    char operator()(std::string const& s) const {return codes.at(s);}\n    std::string const& operator()(char s) const\n    {\n        return std::find_if(codes.cbegin(), codes.cend(),\n            [=](const std::pair<std::string, char>& p){return p.second==s;}\n            )->first;\n    }\n\n    char               at(const std::string& s) const {return codes.at(s);}\n    std::string const& at(const char s) const\n    {\n        const auto found = std::find_if(codes.cbegin(), codes.cend(),\n            [=](const std::pair<std::string, char>& p){return p.second==s;}\n            );\n        if(found != codes.cend())\n        {\n            return found->first;\n        }\n        else\n        {\n            throw std::out_of_range(\"invalid amino acid code\");\n        }\n    }\n\n    std::map<std::string, char> codes = {\n        {\"ALA\", 'A'},\n        {\"ASX\", 'B'},\n        {\"CYS\", 'C'},\n        {\"ASP\", 'D'},\n        {\"GLU\", 'E'},\n        {\"PHE\", 'F'},\n        {\"GLY\", 'G'},\n        {\"HIS\", 'H'},\n        {\"ILE\", 'I'},\n        {\"LYS\", 'K'},\n        {\"LEU\", 'L'},\n        {\"MET\", 'M'},\n        {\"ASN\", 'N'},\n        {\"PRO\", 'P'},\n        {\"GLN\", 'Q'},\n        {\"ARG\", 'R'},\n        {\"SER\", 'S'},\n        {\"THR\", 'T'},\n        {\"SEC\", 'U'},\n        {\"VAL\", 'V'},\n        {\"TRP\", 'W'},\n        {\"XAA\", 'X'},\n        {\"TYR\", 'Y'},\n        {\"GLX\", 'Z'}\n    };\n};\n\ntemplate<typename Iterator>\nstruct residue_name_iterator\n{\n    residue_name_iterator(Iterator iter) : iter_(iter){}\n\n    std::string operator*() const\n    {\n        return remove_all(' ', iter_->residue_name());\n    }\n\n    residue_name_iterator& operator++()\n    {\n        ++iter_;\n        return *this;\n    }\n    residue_name_iterator& operator++(int)\n    {\n        const auto tmp = *this;\n        ++(*this);\n        return tmp;\n    }\n\n    Iterator iter_;\n};\n\ntemplate<typename Iterator>\ninline residue_name_iterator<Iterator>\nwrap_residue_name(Iterator iter)\n{\n    return residue_name_iterator<Iterator>(iter);\n}\n\ntemplate<typename Iterator>\ninline bool operator==(residue_name_iterator<Iterator> const& lhs,\n                       residue_name_iterator<Iterator> const& rhs)\n{\n    return lhs.iter_ == rhs.iter_;\n}\n\ntemplate<typename Iterator>\ninline bool operator<(residue_name_iterator<Iterator> const& lhs,\n                      residue_name_iterator<Iterator> const& rhs)\n{\n    return lhs.iter_ < rhs.iter_;\n}\n\ntemplate<typename Iterator>\ninline bool operator!=(residue_name_iterator<Iterator> const& lhs,\n                       residue_name_iterator<Iterator> const& rhs)\n{\n    return !(lhs == rhs);\n}\n\ntemplate<typename Iterator>\ninline bool operator<=(residue_name_iterator<Iterator> const& lhs,\n                       residue_name_iterator<Iterator> const& rhs)\n{\n    return (lhs < rhs) || (lhs == rhs);\n}\n\ntemplate<typename Iterator>\ninline bool operator>(residue_name_iterator<Iterator> const& lhs,\n                       residue_name_iterator<Iterator> const& rhs)\n{\n    return !(lhs <= rhs);\n}\n\ntemplate<typename Iterator>\ninline bool operator>=(residue_name_iterator<Iterator> const& lhs,\n                       residue_name_iterator<Iterator> const& rhs)\n{\n    return !(lhs < rhs);\n}\n\nstruct generate_sequence\n{\n    char operator()(const std::string& res) const\n    {\n        if(res.size() == 1)\n        {\n            return res.front();\n        }\n        else if(res[0] == 'D' && res.size() == 2)\n        {\n            return res[1];\n        }\n        else if(res.size() == 3)\n        {\n            return amino.at(res);\n        }\n        else\n            throw std::invalid_argument(\"unknown sequence: \" + res);\n    }\n    amino_acid_code amino;\n};\n\n\/\/ argv := {\"seq\", \"file.pdb\"}\ntemplate<typename vectorT>\nint mode_pdb_seq(int argument_c, const char **argument_v)\n{\n    if(argument_c < 2)\n    {\n        std::cerr << \"error: mill pdb seq: too few arguments\\n\";\n        std::cerr << pdb_seq_usage() << std::endl;\n        return 1;\n    }\n    const std::string pdbname(argument_v[1]);\n\n    if(pdbname == \"help\")\n    {\n        std::cerr << pdb_seq_usage() << std::endl;\n        return 0;\n    }\n\n    PDBReader<vectorT> reader;\n    for(auto&& chain : reader.parse(reader.read(pdbname)))\n    {\n        std::string sequence(chain.size(), ' ');\n        std::transform(wrap_residue_name(chain.cbegin()),\n                       wrap_residue_name(chain.cend()),\n                       sequence.begin(),\n                       generate_sequence());\n        std::cout << \"chain \" << chain.chain_id() << \": \" << sequence << std::endl;\n    }\n    return 0;\n}\n\n} \/\/ mill\n#endif \/* COFFEE_MILL_PDB_SEQ *\/\n<commit_msg>:recycle: use utility class for amino acid code<commit_after>#ifndef COFFEE_MILL_PDB_SEQ\n#define COFFEE_MILL_PDB_SEQ\n#include <mill\/pdb\/PDBChain.hpp>\n#include <mill\/util\/string.hpp>\n#include <mill\/util\/amino_acid_code.hpp>\n#include <algorithm>\n#include <map>\n\nnamespace mill\n{\n\ninline const char* pdb_seq_usage() noexcept\n{\n    return \"usage: mill pdb seq [parameters...]\\n\"\n           \"    $ mill pdb seq model.pdb\\n\"\n           \"      print sequences for each chain\\n\";\n}\n\ntemplate<typename Iterator>\nstruct residue_name_iterator\n{\n    residue_name_iterator(Iterator iter) : iter_(iter){}\n\n    std::string operator*() const\n    {\n        return remove_all(' ', iter_->residue_name());\n    }\n\n    residue_name_iterator& operator++()\n    {\n        ++iter_;\n        return *this;\n    }\n    residue_name_iterator& operator++(int)\n    {\n        const auto tmp = *this;\n        ++(*this);\n        return tmp;\n    }\n\n    Iterator iter_;\n};\n\ntemplate<typename Iterator>\ninline residue_name_iterator<Iterator>\nwrap_residue_name(Iterator iter)\n{\n    return residue_name_iterator<Iterator>(iter);\n}\n\ntemplate<typename Iterator>\ninline bool operator==(residue_name_iterator<Iterator> const& lhs,\n                       residue_name_iterator<Iterator> const& rhs)\n{\n    return lhs.iter_ == rhs.iter_;\n}\n\ntemplate<typename Iterator>\ninline bool operator<(residue_name_iterator<Iterator> const& lhs,\n                      residue_name_iterator<Iterator> const& rhs)\n{\n    return lhs.iter_ < rhs.iter_;\n}\n\ntemplate<typename Iterator>\ninline bool operator!=(residue_name_iterator<Iterator> const& lhs,\n                       residue_name_iterator<Iterator> const& rhs)\n{\n    return !(lhs == rhs);\n}\n\ntemplate<typename Iterator>\ninline bool operator<=(residue_name_iterator<Iterator> const& lhs,\n                       residue_name_iterator<Iterator> const& rhs)\n{\n    return (lhs < rhs) || (lhs == rhs);\n}\n\ntemplate<typename Iterator>\ninline bool operator>(residue_name_iterator<Iterator> const& lhs,\n                       residue_name_iterator<Iterator> const& rhs)\n{\n    return !(lhs <= rhs);\n}\n\ntemplate<typename Iterator>\ninline bool operator>=(residue_name_iterator<Iterator> const& lhs,\n                       residue_name_iterator<Iterator> const& rhs)\n{\n    return !(lhs < rhs);\n}\n\nstruct generate_sequence\n{\n    char operator()(const std::string& res) const\n    {\n        if(res.size() == 1)\n        {\n            return res.front();\n        }\n        else if(res[0] == 'D' && res.size() == 2)\n        {\n            return res[1];\n        }\n        else if(res.size() == 3)\n        {\n            return amino.at(res);\n        }\n        else\n            throw std::invalid_argument(\"unknown sequence: \" + res);\n    }\n    amino_acid_code amino;\n};\n\n\/\/ argv := {\"seq\", \"file.pdb\"}\ntemplate<typename vectorT>\nint mode_pdb_seq(int argument_c, const char **argument_v)\n{\n    if(argument_c < 2)\n    {\n        std::cerr << \"error: mill pdb seq: too few arguments\\n\";\n        std::cerr << pdb_seq_usage() << std::endl;\n        return 1;\n    }\n    const std::string pdbname(argument_v[1]);\n\n    if(pdbname == \"help\")\n    {\n        std::cerr << pdb_seq_usage() << std::endl;\n        return 0;\n    }\n\n    PDBReader<vectorT> reader;\n    for(auto&& chain : reader.parse(reader.read(pdbname)))\n    {\n        std::string sequence(chain.size(), ' ');\n        std::transform(wrap_residue_name(chain.cbegin()),\n                       wrap_residue_name(chain.cend()),\n                       sequence.begin(),\n                       generate_sequence());\n        std::cout << \"chain \" << chain.chain_id() << \": \" << sequence << std::endl;\n    }\n    return 0;\n}\n\n} \/\/ mill\n#endif \/* COFFEE_MILL_PDB_SEQ *\/\n<|endoftext|>"}
{"text":"<commit_before>\/**************************************************************** \n  This is the Spark Core library for the AM2321 Humidity and Temperature sensor\n\n  This sensor uses custom protocol based on the I2C communication\n  and supports both one and two wires configuration.\n  \n  This Library only supports the 2 wires configuration.\n  \n  Written by Ed Wios.\n  Oct 2014\n ***************************************************************\/\n \n#include \"AM2321.h\"\n\nAM2321::AM2321() {\n  SSDA = _SSDA;\n  SSCL = _SSCL;\n}\n\nvoid delay10us(void)\n{\n    delayMicroseconds(10);\n}\n\n\/*************************************************\n    I2C Start sequence \n*************************************************\/\nvoid AM2321::I2C_Start()\n{\n  pinMode(SSDA, OUTPUT);\n  digitalWrite(SSDA,1);\n  digitalWrite(SSCL,1);\n  delay10us();\n  digitalWrite(SSDA,0);\n  delay10us();\n  digitalWrite(SSCL,0); \n}\n\n\/*************************************************\n    I2C Stop sequence\n*************************************************\/\nvoid AM2321::I2C_Stop()\n{\n    pinMode(SSDA, OUTPUT);\n    digitalWrite(SSDA,0);\n    delay10us();\n    digitalWrite(SSCL,1);\n    delay10us();\n    digitalWrite(SSDA,1);\n}\n\n\/*************************************************\n    I2C Ack sequence \n*************************************************\/\nvoid AM2321::Ack(void)\n{\n   pinMode(SSDA, OUTPUT);\n   digitalWrite(SSDA,0);\n   digitalWrite(SSCL,0);\n   delay10us();\n   digitalWrite(SSCL,1);\n   delay10us();\t\n   digitalWrite(SSCL,0);\n   digitalWrite(SSDA,1);\n}\n\n\/*************************************************\n    AM2321 specific: No ACK back to I2C slave \n*************************************************\/\nvoid AM2321::NoAck(void)\n{\n   pinMode(SSDA, OUTPUT);\n   digitalWrite(SSDA,1);  \n   digitalWrite(SSCL,0);\n   delay10us();\n   digitalWrite(SSCL,1);\n   delay10us();\n   digitalWrite(SSDA,1);\n   digitalWrite(SSCL,0);\n}\n\n\/*************************************************\n    Test if AM2321 has returned ACK \n*************************************************\/\nint AM2321::Test_Ack()\n{\n   int ACK_Flag=0;\n   digitalWrite(SSCL,0);\n   pinMode(SSDA, INPUT);    \n   delay10us();\n   digitalWrite(SSCL,1);\n   delay10us();\n   if(digitalRead(SSDA)==0)\n     ACK_Flag = 1;\n   else \n     ACK_Flag = 0;\n   digitalWrite(SSCL,0);\n   pinMode(SSDA, OUTPUT);    \n   digitalWrite(SSDA,1);\n   return ACK_Flag;\n}\n\n\/*************************************************\n    Send 1 byte of data to the I2C slave\n    Will not consider ACK from slave\n*************************************************\/\nvoid AM2321::SendData(unsigned char buffer)\n{\n    unsigned char BitCnt=8; \/\/ 8-bit\n    pinMode(SSDA, OUTPUT);\n    digitalWrite(SSDA,1);\n    do\n    {\n        digitalWrite(SSCL,0);\n        delay10us();\n        if((buffer&0x80)==0)\n            digitalWrite(SSDA,0);\n        else\n            digitalWrite(SSDA,1);\n        digitalWrite(SSCL,1);\n        delay10us();\n        buffer=buffer<<1; \/\/ Left shift buffer\n        BitCnt--;\n    }\n    while(BitCnt);\n    digitalWrite(SSCL,0);        \n}\n\n\/*************************************************\n    Receive 1 byte from I2C slave into the buffer \n    Must be followed by ACK() afterwards\n*************************************************\/\nunsigned char AM2321::ReceiveData()\n{\n  unsigned char BitCnt=8,IIC_RX_Data=0;\n  pinMode(SSDA,INPUT);\n  do\n  {\n     digitalWrite(SSCL,0);\n\t   delay10us();  \n\t   IIC_RX_Data <<= 1;\n\t   BitCnt--;\t  \n\t   digitalWrite(SSCL,1);\n\t   delay10us();\n     if(digitalRead(SSDA)==1)\n       IIC_RX_Data = IIC_RX_Data|0x01;\n     else\n       IIC_RX_Data = IIC_RX_Data&0xfe;    \n   } while(BitCnt);\n   digitalWrite(SSCL,0);\n   return IIC_RX_Data;\n}\n\n\/*************************************************\n    Write bytes to I2C slave from the buffer\n    by calling SendData\n    Must be followed by ACK() afterwards\n*************************************************\/\nint AM2321::WriteNByte(unsigned char sla,unsigned char *s,unsigned char n)\n{\n   unsigned char i;\n\n   I2C_Start();\n   SendData(sla); \/\/ Send device address\n   if(!Test_Ack())\n   {\t\n      WR_Flag = 1;\n      return(0);\n   }\n   for(i=0;i<n;i++) \/\/ Send buffer to slave\n   {\n      SendData(*(s+i));\n\t  if(!Test_Ack())\n\t  {\n\t    WR_Flag = 2;\n\t\treturn(0);\n\t  }\n   }\n   I2C_Stop();\n   return(1);\n}\n\nint AM2321::ReadNByte(unsigned char Sal, unsigned char *p,unsigned char n)\n{\n  unsigned char i;\n  I2C_Start();\n  SendData((Sal)| 0x01); \/\/ Send device Read address\n  if(!Test_Ack())\n  {\n  \tWR_Flag = 1;\n\treturn(0);\n  }\n  \/\/ Then must wait > 30us according to manual\n  delay10us();  \n  delay10us();\n  delay10us(); \n        \n  \/\/ Now we can start reading data from AM2321\n  for(i=0;i<n-1;i++)\n  {\n     *(p+i)=ReceiveData();\n     Ack(); \n  }\n  *(p+n-1)=ReceiveData();        \n  NoAck();\n  I2C_Stop();\n  return(1);\t \n}\n\n\/*************************************************\n    Calc CRC from received buffer \n*************************************************\/\nunsigned int AM2321::CRC16(unsigned char *ptr, unsigned char len)\n{\n   unsigned int crc=0xffff;\n   unsigned char i;\n   while(len--)\n   {\n       crc ^=*ptr++;\n       for(i=0;i<8;i++)\n\t   {\n\t       if(crc & 0x1)\n\t\t   {\n\t\t      crc>>=1;\n\t\t\t  crc^=0xa001;\n\t\t   }\n\t\t   else\n\t\t   {\n\t\t      crc>>=1;\n\t\t   }\n\t   }\n   }\n   return crc;\n}\n\n\/*************************************************\n    Affirm if CRC matches \n*************************************************\/\nunsigned char AM2321::CheckCRC(unsigned char *ptr,unsigned char len)\n{\n  unsigned int crc;\n\tcrc=(unsigned int)CRC16(ptr,len-2);\n\tif(ptr[len-1]==(crc>>8) && ptr[len-2]==(crc & 0x00ff))\n\t{\n\t    return 0xff;\n\t}\n\telse\n\t{\n\t   return 0x0;\n\t}\n}\n\n\/*************************************************\n    Wake up the AM2321 \n    AM2321 will NOT ack when wake up, however,\n    according to the manual, ACK clock MUST be \n    sent or error will occur.\n    A delay of at least 1.5ms is REQUIRED\n    before I2C stop.\n*************************************************\/\n\nvoid AM2321::Waken(void)\n{\n    I2C_Start();\n    SendData(IIC_Add);        \/\/ Send device address\n    Test_Ack();               \/\/ AM2321 will not ACK when waking up\n    delayMicroseconds(2000);  \/\/ Delay at least 1.5ms\n    I2C_Stop();\t\n}\n\n\n\/*************************************************\n    Clear the buffer \n*************************************************\/\nvoid AM2321::Clear_Data (void)\n{\n  int i;\n  for(i=0;i<IIC_RX_Length;i++)\n  {\n    IIC_RX_Buffer[i] = 0x00;\n  }\n}\n\n\/*************************************************\n    Initialize and ready the I\/O pins\n    Clear the buffer\n*************************************************\/\n\nbool AM2321::begin()\n{\n    SSDA = _SSDA;\n    SSCL = _SSCL;\n\n    pinMode(SSCL, OUTPUT);\n    pinMode(SSDA, OUTPUT);\n    digitalWrite(SSCL,1);\n    digitalWrite(SSDA,1);\n    Clear_Data();\n\n    \/\/ Todo: check and verify Device ID and\n    \/\/ return FAIL if device ID not match\n    return true;\n}\n\n\/*************************************************\n    Read the device ID of AM2321 \n    Shall return 0x2321\n*************************************************\/\nunsigned int AM2321::readID()\n{\n    unsigned int m = 0;\n\n    Clear_Data();\n    WR_Flag = 0;\n    Waken();\n\n    IIC_TX_Buffer[0] = 0x03;\n    IIC_TX_Buffer[1] = 0x08;\n    IIC_TX_Buffer[2] = 0x07;\n    if (WriteNByte(IIC_Add,IIC_TX_Buffer,3)) {\n        \/\/Wait at least 2ms for device to response with data\n        delayMicroseconds(2000);    \n        ReadNByte(IIC_Add,IIC_RX_Buffer,7);\n        digitalWrite(SSCL,1); digitalWrite(SSDA,1); \/\/Release the lines\n        if (!WR_Flag) {\n            m = IIC_RX_Buffer[2]*256+IIC_RX_Buffer[3];\n        } else {\n            m = 0xFFFF;\n        }\n    } else {\n        m = 0xFFFF;\n    }\n    return m;\n}\n\nfloat AM2321::readTemperature()\n{\n    float temp = 0.0;\n\n    Clear_Data();\n    WR_Flag = 0;\n    Waken();\n    \/\/Wait at least 2ms for device to response with data\n    IIC_TX_Buffer[0] = 0x03;\n    IIC_TX_Buffer[1] = 0x00;\n    IIC_TX_Buffer[2] = 0x04;\n    if (WriteNByte(IIC_Add,IIC_TX_Buffer,3)) {\n        delayMicroseconds(2000);    \n        ReadNByte(IIC_Add,IIC_RX_Buffer,8);\n        digitalWrite(SSCL,1); digitalWrite(SSDA,1);\n        if (!WR_Flag) {\n            temp = (IIC_RX_Buffer[4]*256+IIC_RX_Buffer[5])\/10.0;\n        } else {\n            temp = 999.9;\n        }\n    } else {\n        temp = 999.9;\n    }\n    return temp;\n}\n\nfloat AM2321::readHumidity()\n{\n    float humi = 0.0;\n    \n    Clear_Data();\n    WR_Flag = 0;\n    Waken();\n    IIC_TX_Buffer[0] = 0x03;\n    IIC_TX_Buffer[1] = 0x00;\n    IIC_TX_Buffer[2] = 0x04;\n    if (!WriteNByte(IIC_Add,IIC_TX_Buffer,3)) {\n        humi = 999.9;\n    } else {\n        \/\/Wait at least 2ms for device to response with data\n        delayMicroseconds(2000);    \n        ReadNByte(IIC_Add,IIC_RX_Buffer,8);\n        digitalWrite(SSCL,1); digitalWrite(SSDA,1);\n        if (!WR_Flag) {\n            humi = (IIC_RX_Buffer[2]*256+IIC_RX_Buffer[3])\/10.0;\n        } else {\n            humi = 999.9;\n        }\n    }\n    return humi;\n}\n\n<commit_msg>Added readAll()<commit_after>\/**************************************************************** \n  This is the Spark Core library for the AM2321 Humidity and Temperature sensor\n\n  This sensor uses custom protocol based on the I2C communication\n  and supports both one and two wires configuration.\n  \n  This Library only supports the 2 wires configuration.\n  \n  Written by Ed Wios.\n  Oct 2014\n ***************************************************************\/\n \n#include \"AM2321.h\"\n\nAM2321::AM2321() {\n  SSDA = _SSDA;\n  SSCL = _SSCL;\n}\n\nvoid delay10us(void)\n{\n    delayMicroseconds(10);\n}\n\n\/*************************************************\n    I2C Start sequence \n*************************************************\/\nvoid AM2321::I2C_Start()\n{\n  pinMode(SSDA, OUTPUT);\n  digitalWrite(SSDA,1);\n  digitalWrite(SSCL,1);\n  delay10us();\n  digitalWrite(SSDA,0);\n  delay10us();\n  digitalWrite(SSCL,0); \n}\n\n\/*************************************************\n    I2C Stop sequence\n*************************************************\/\nvoid AM2321::I2C_Stop()\n{\n    pinMode(SSDA, OUTPUT);\n    digitalWrite(SSDA,0);\n    delay10us();\n    digitalWrite(SSCL,1);\n    delay10us();\n    digitalWrite(SSDA,1);\n}\n\n\/*************************************************\n    I2C Ack sequence \n*************************************************\/\nvoid AM2321::Ack(void)\n{\n   pinMode(SSDA, OUTPUT);\n   digitalWrite(SSDA,0);\n   digitalWrite(SSCL,0);\n   delay10us();\n   digitalWrite(SSCL,1);\n   delay10us();\t\n   digitalWrite(SSCL,0);\n   digitalWrite(SSDA,1);\n}\n\n\/*************************************************\n    AM2321 specific: No ACK back to I2C slave \n*************************************************\/\nvoid AM2321::NoAck(void)\n{\n   pinMode(SSDA, OUTPUT);\n   digitalWrite(SSDA,1);  \n   digitalWrite(SSCL,0);\n   delay10us();\n   digitalWrite(SSCL,1);\n   delay10us();\n   digitalWrite(SSDA,1);\n   digitalWrite(SSCL,0);\n}\n\n\/*************************************************\n    Test if AM2321 has returned ACK \n*************************************************\/\nint AM2321::Test_Ack()\n{\n   int ACK_Flag=0;\n   digitalWrite(SSCL,0);\n   pinMode(SSDA, INPUT);    \n   delay10us();\n   digitalWrite(SSCL,1);\n   delay10us();\n   if(digitalRead(SSDA)==0)\n     ACK_Flag = 1;\n   else \n     ACK_Flag = 0;\n   digitalWrite(SSCL,0);\n   pinMode(SSDA, OUTPUT);    \n   digitalWrite(SSDA,1);\n   return ACK_Flag;\n}\n\n\/*************************************************\n    Send 1 byte of data to the I2C slave\n    Will not consider ACK from slave\n*************************************************\/\nvoid AM2321::SendData(unsigned char buffer)\n{\n    unsigned char BitCnt=8; \/\/ 8-bit\n    pinMode(SSDA, OUTPUT);\n    digitalWrite(SSDA,1);\n    do\n    {\n        digitalWrite(SSCL,0);\n        delay10us();\n        if((buffer&0x80)==0)\n            digitalWrite(SSDA,0);\n        else\n            digitalWrite(SSDA,1);\n        digitalWrite(SSCL,1);\n        delay10us();\n        buffer=buffer<<1; \/\/ Left shift buffer\n        BitCnt--;\n    }\n    while(BitCnt);\n    digitalWrite(SSCL,0);        \n}\n\n\/*************************************************\n    Receive 1 byte from I2C slave into the buffer \n    Must be followed by ACK() afterwards\n*************************************************\/\nunsigned char AM2321::ReceiveData()\n{\n  unsigned char BitCnt=8,IIC_RX_Data=0;\n  pinMode(SSDA,INPUT);\n  do\n  {\n     digitalWrite(SSCL,0);\n\t   delay10us();  \n\t   IIC_RX_Data <<= 1;\n\t   BitCnt--;\t  \n\t   digitalWrite(SSCL,1);\n\t   delay10us();\n     if(digitalRead(SSDA)==1)\n       IIC_RX_Data = IIC_RX_Data|0x01;\n     else\n       IIC_RX_Data = IIC_RX_Data&0xfe;    \n   } while(BitCnt);\n   digitalWrite(SSCL,0);\n   return IIC_RX_Data;\n}\n\n\/*************************************************\n    Write bytes to I2C slave from the buffer\n    by calling SendData\n    Must be followed by ACK() afterwards\n*************************************************\/\nint AM2321::WriteNByte(unsigned char sla,unsigned char *s,unsigned char n)\n{\n   unsigned char i;\n\n   I2C_Start();\n   SendData(sla); \/\/ Send device address\n   if(!Test_Ack())\n   {\t\n      WR_Flag = 1;\n      return(0);\n   }\n   for(i=0;i<n;i++) \/\/ Send buffer to slave\n   {\n      SendData(*(s+i));\n\t  if(!Test_Ack())\n\t  {\n\t    WR_Flag = 2;\n\t\treturn(0);\n\t  }\n   }\n   I2C_Stop();\n   return(1);\n}\n\nint AM2321::ReadNByte(unsigned char Sal, unsigned char *p,unsigned char n)\n{\n  unsigned char i;\n  I2C_Start();\n  SendData((Sal)| 0x01); \/\/ Send device Read address\n  if(!Test_Ack())\n  {\n  \tWR_Flag = 1;\n\treturn(0);\n  }\n  \/\/ Then must wait > 30us according to manual\n  delay10us();  \n  delay10us();\n  delay10us(); \n        \n  \/\/ Now we can start reading data from AM2321\n  for(i=0;i<n-1;i++)\n  {\n     *(p+i)=ReceiveData();\n     Ack(); \n  }\n  *(p+n-1)=ReceiveData();        \n  NoAck();\n  I2C_Stop();\n  return(1);\t \n}\n\n\/*************************************************\n    Calc CRC from received buffer \n*************************************************\/\nunsigned int AM2321::CRC16(unsigned char *ptr, unsigned char len)\n{\n   unsigned int crc=0xffff;\n   unsigned char i;\n   while(len--)\n   {\n       crc ^=*ptr++;\n       for(i=0;i<8;i++)\n\t   {\n\t       if(crc & 0x1)\n\t\t   {\n\t\t      crc>>=1;\n\t\t\t  crc^=0xa001;\n\t\t   }\n\t\t   else\n\t\t   {\n\t\t      crc>>=1;\n\t\t   }\n\t   }\n   }\n   return crc;\n}\n\n\/*************************************************\n    Affirm if CRC matches \n*************************************************\/\nunsigned char AM2321::CheckCRC(unsigned char *ptr,unsigned char len)\n{\n  unsigned int crc;\n\tcrc=(unsigned int)CRC16(ptr,len-2);\n\tif(ptr[len-1]==(crc>>8) && ptr[len-2]==(crc & 0x00ff))\n\t{\n\t    return 0xff;\n\t}\n\telse\n\t{\n\t   return 0x0;\n\t}\n}\n\n\/*************************************************\n    Wake up the AM2321 \n    AM2321 will NOT ack when wake up, however,\n    according to the manual, ACK clock MUST be \n    sent or error will occur.\n    A delay of at least 1.5ms is REQUIRED\n    before I2C stop.\n*************************************************\/\n\nvoid AM2321::WakeUp(void)\n{\n    I2C_Start();\n    SendData(IIC_Add);        \/\/ Send device address\n    Test_Ack();               \/\/ AM2321 will not ACK when waking up\n    delayMicroseconds(2000);  \/\/ Delay at least 1.5ms\n    I2C_Stop();\t\n}\n\n\n\/*************************************************\n    Clear the buffer \n*************************************************\/\nvoid AM2321::Clear_Data (void)\n{\n  int i;\n  for(i=0;i<IIC_RX_Length;i++)\n  {\n    IIC_RX_Buffer[i] = 0x00;\n  }\n}\n\n\/*************************************************\n    Initialize and ready the I\/O pins\n    Clear the buffer\n*************************************************\/\n\nbool AM2321::begin()\n{\n    SSDA = _SSDA;\n    SSCL = _SSCL;\n\n    pinMode(SSCL, OUTPUT);\n    pinMode(SSDA, OUTPUT);\n    digitalWrite(SSCL,1);\n    digitalWrite(SSDA,1);\n    Clear_Data();\n\n    \/\/ Todo: check and verify Device ID and\n    \/\/ return FAIL if device ID not match\n    return true;\n}\n\n\/*************************************************\n    Read the device ID of AM2321 \n    Shall return 0x2321\n*************************************************\/\nunsigned int AM2321::readID()\n{\n    unsigned int m = 0;\n\n    Clear_Data();\n    WR_Flag = 0;\n    WakeUp();\n    IIC_TX_Buffer[0] = 0x03;\n    IIC_TX_Buffer[1] = 0x08;\n    IIC_TX_Buffer[2] = 0x07;\n    if (WriteNByte(IIC_Add,IIC_TX_Buffer,3)) {\n        \/\/Wait at least 2ms for device to response with data\n        delayMicroseconds(2000);    \n        ReadNByte(IIC_Add,IIC_RX_Buffer,7);\n        digitalWrite(SSCL,1); digitalWrite(SSDA,1); \/\/Release the lines\n        if (!WR_Flag) {\n            m = IIC_RX_Buffer[2]*256+IIC_RX_Buffer[3];\n        } else {\n            m = 0xFFFF;\n        }\n    } else {\n        m = 0xFFFF;\n    }\n    return m;\n}\n\nfloat AM2321::readTemperature()\n{\n    float temp = 0.0;\n\n    Clear_Data();\n    WR_Flag = 0;\n    WakeUp();\n    IIC_TX_Buffer[0] = 0x03;\n    IIC_TX_Buffer[1] = 0x00;\n    IIC_TX_Buffer[2] = 0x04;\n    if (WriteNByte(IIC_Add,IIC_TX_Buffer,3)) {\n        \/\/Wait at least 2ms for device to response with data\n        delayMicroseconds(2000);    \n        ReadNByte(IIC_Add,IIC_RX_Buffer,8);\n        digitalWrite(SSCL,1); digitalWrite(SSDA,1);\n        if (!WR_Flag) {\n            temp = (IIC_RX_Buffer[4]*256+IIC_RX_Buffer[5])\/10.0;\n        } else {\n            temp = 999.9;\n        }\n    } else {\n        temp = 999.9;\n    }\n    return temp;\n}\n\nfloat AM2321::readHumidity()\n{\n    float humi = 0.0;\n    \n    Clear_Data();\n    WR_Flag = 0;\n    WakeUp();\n    IIC_TX_Buffer[0] = 0x03;\n    IIC_TX_Buffer[1] = 0x00;\n    IIC_TX_Buffer[2] = 0x04;\n    if (!WriteNByte(IIC_Add,IIC_TX_Buffer,3)) {\n        humi = 999.9;\n    } else {\n        \/\/Wait at least 2ms for device to response with data\n        delayMicroseconds(2000);    \n        ReadNByte(IIC_Add,IIC_RX_Buffer,8);\n        digitalWrite(SSCL,1); digitalWrite(SSDA,1);\n        if (!WR_Flag) {\n            humi = (IIC_RX_Buffer[2]*256+IIC_RX_Buffer[3])\/10.0;\n        } else {\n            humi = 999.9;\n        }\n    }\n    return humi;\n}\n\n\/*************************************************\n    Read both temperature and humidity from AM2321 \n    Results returned as unsigned long\n    aaaabbbb where aaaa is the humidity*10 and\n    bbbb is temperature*10\n*************************************************\/\nunsigned long AM2321::readAll()\n{\n    unsigned long m = 0;\n\n    Clear_Data();\n    WR_Flag = 0;\n    WakeUp();\n    IIC_TX_Buffer[0] = 0x03;\n    IIC_TX_Buffer[1] = 0x00;\n    IIC_TX_Buffer[2] = 0x04;\n    if (!WriteNByte(IIC_Add,IIC_TX_Buffer,3)) {\n        m = 0xFFFFFFFF;\n    } else {\n        \/\/Wait at least 2ms for device to response with data\n        delayMicroseconds(2000);    \n        ReadNByte(IIC_Add,IIC_RX_Buffer,8);\n        digitalWrite(SSCL,1); digitalWrite(SSDA,1);\n        if (!WR_Flag) {\n            m = (IIC_RX_Buffer[2]<<24) + (IIC_RX_Buffer[3]<<16) + (IIC_RX_Buffer[4]<<8) + IIC_RX_Buffer[5];\n        } else {\n            m = 0xFFFFFFFF;\n        }\n    }\n    return  m;   \n}\n<|endoftext|>"}
{"text":"<commit_before>\/*\n * Delegate helper pooling.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"Stock.hxx\"\n#include \"stock\/MapStock.hxx\"\n#include \"stock\/Stock.hxx\"\n#include \"stock\/Item.hxx\"\n#include \"async.hxx\"\n#include \"failure.hxx\"\n#include \"system\/fd_util.h\"\n#include \"system\/sigutil.h\"\n#include \"pevent.hxx\"\n#include \"spawn\/exec.hxx\"\n#include \"spawn\/ChildOptions.hxx\"\n#include \"gerrno.h\"\n#include \"pool.hxx\"\n\n#include <daemon\/log.h>\n\n#include <assert.h>\n#include <unistd.h>\n#include <sched.h>\n#include <sys\/un.h>\n#include <sys\/socket.h>\n\nstruct delegate_info {\n    const char *helper;\n\n    const ChildOptions *options;\n\n    int fds[2];\n    sigset_t signals;\n};\n\nstruct delegate_process {\n    StockItem stock_item;\n\n    const char *uri;\n\n    pid_t pid;\n    int fd;\n\n    struct event event;\n};\n\n\/*\n * libevent callback\n *\n *\/\n\nstatic void\ndelegate_stock_event(int fd, short event, void *ctx)\n{\n    struct delegate_process *process = (struct delegate_process *)ctx;\n\n    assert(fd == process->fd);\n\n    p_event_consumed(&process->event, process->stock_item.pool);\n\n    if ((event & EV_TIMEOUT) == 0) {\n        assert((event & EV_READ) != 0);\n\n        char buffer;\n        ssize_t nbytes = recv(fd, &buffer, sizeof(buffer), MSG_DONTWAIT);\n        if (nbytes < 0)\n            daemon_log(2, \"error on idle delegate process: %s\\n\",\n                       strerror(errno));\n        else if (nbytes > 0)\n            daemon_log(2, \"unexpected data from idle delegate process\\n\");\n    }\n\n    stock_del(process->stock_item);\n    pool_commit();\n}\n\n\/*\n * clone() function\n *\n *\/\n\nstatic int\ndelegate_stock_fn(void *ctx)\n{\n    struct delegate_info *info = (struct delegate_info *)ctx;\n\n    install_default_signal_handlers();\n    leave_signal_section(&info->signals);\n\n    info->options->Apply(true);\n\n    dup2(info->fds[1], STDIN_FILENO);\n    close(info->fds[0]);\n    close(info->fds[1]);\n\n    Exec e;\n    info->options->jail.InsertWrapper(e, nullptr);\n    e.Append(info->helper);\n    e.DoExec();\n}\n\n\/*\n * stock class\n *\n *\/\n\nstatic constexpr struct delegate_process &\nToDelegateProcess(StockItem &item)\n{\n    return ContainerCast2(item, &delegate_process::stock_item);\n}\n\nstatic struct pool *\ndelegate_stock_pool(void *ctx gcc_unused, struct pool &parent,\n                    const char *uri gcc_unused)\n{\n    return pool_new_linear(&parent, \"delegate_stock\", 512);\n}\n\nstatic void\ndelegate_stock_create(gcc_unused void *ctx, StockItem &item,\n                      const char *uri, void *_info,\n                      gcc_unused struct pool &caller_pool,\n                      gcc_unused struct async_operation_ref &async_ref)\n{\n    auto *process = &ToDelegateProcess(item);\n    struct delegate_info *const info = (struct delegate_info *)_info;\n    const auto *const options = info->options;\n\n    if (socketpair_cloexec(AF_UNIX, SOCK_STREAM, 0, info->fds) < 0) {\n        GError *error = new_error_errno_msg(\"socketpair() failed: %s\");\n        stock_item_failed(item, error);\n        return;\n    }\n\n    int clone_flags = SIGCHLD;\n    clone_flags = options->ns.GetCloneFlags(clone_flags);\n\n    \/* avoid race condition due to libevent signal handler in child\n       process *\/\n    enter_signal_section(&info->signals);\n\n    char stack[8192];\n    long pid = clone(delegate_stock_fn, stack + sizeof(stack),\n                     clone_flags, info);\n    if (pid < 0) {\n        GError *error = new_error_errno_msg(\"clone() failed\");\n        leave_signal_section(&info->signals);\n        close(info->fds[0]);\n        close(info->fds[1]);\n        stock_item_failed(item, error);\n        return;\n    }\n\n    leave_signal_section(&info->signals);\n\n    close(info->fds[1]);\n\n    process->uri = uri;\n    process->pid = pid;\n    process->fd = info->fds[0];\n\n    event_set(&process->event, process->fd, EV_READ|EV_TIMEOUT,\n              delegate_stock_event, process);\n\n    stock_item_available(process->stock_item);\n}\n\nstatic bool\ndelegate_stock_borrow(gcc_unused void *ctx, StockItem &item)\n{\n    auto *process = &ToDelegateProcess(item);\n\n    p_event_del(&process->event, process->stock_item.pool);\n    return true;\n}\n\nstatic void\ndelegate_stock_release(gcc_unused void *ctx, StockItem &item)\n{\n    auto *process = &ToDelegateProcess(item);\n    static const struct timeval tv = {\n        .tv_sec = 60,\n        .tv_usec = 0,\n    };\n\n    p_event_add(&process->event, &tv,\n                process->stock_item.pool, \"delegate_process\");\n}\n\nstatic void\ndelegate_stock_destroy(gcc_unused void *ctx, StockItem &item)\n{\n    auto *process = &ToDelegateProcess(item);\n\n    p_event_del(&process->event, process->stock_item.pool);\n    close(process->fd);\n}\n\nstatic constexpr StockClass delegate_stock_class = {\n    .item_size = sizeof(struct delegate_process),\n    .pool = delegate_stock_pool,\n    .create = delegate_stock_create,\n    .borrow = delegate_stock_borrow,\n    .release = delegate_stock_release,\n    .destroy = delegate_stock_destroy,\n};\n\n\n\/*\n * interface\n *\n *\/\n\nStockMap *\ndelegate_stock_new(struct pool *pool)\n{\n    return hstock_new(*pool, delegate_stock_class, nullptr, 0, 16);\n}\n\nvoid\ndelegate_stock_get(StockMap *delegate_stock, struct pool *pool,\n                   const char *helper,\n                   const ChildOptions &options,\n                   StockGetHandler &handler,\n                   struct async_operation_ref &async_ref)\n{\n    const char *uri = helper;\n\n    char options_buffer[4096];\n    *options.MakeId(options_buffer) = 0;\n    if (*options_buffer != 0)\n        uri = p_strcat(pool, helper, \"|\", options_buffer, nullptr);\n\n    auto info = NewFromPool<struct delegate_info>(*pool);\n    info->helper = helper;\n    info->options = &options;\n\n    hstock_get(*delegate_stock, *pool, uri, info, handler, async_ref);\n}\n\nvoid\ndelegate_stock_put(StockMap *delegate_stock,\n                   StockItem &item, bool destroy)\n{\n    auto *process = &ToDelegateProcess(item);\n\n    hstock_put(*delegate_stock, process->uri, item, destroy);\n}\n\nint\ndelegate_stock_item_get(StockItem &item)\n{\n    auto *process = &ToDelegateProcess(item);\n\n    return process->fd;\n}\n<commit_msg>delegate\/Stock: rename the structs with CamelCase<commit_after>\/*\n * Delegate helper pooling.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"Stock.hxx\"\n#include \"stock\/MapStock.hxx\"\n#include \"stock\/Stock.hxx\"\n#include \"stock\/Item.hxx\"\n#include \"async.hxx\"\n#include \"failure.hxx\"\n#include \"system\/fd_util.h\"\n#include \"system\/sigutil.h\"\n#include \"pevent.hxx\"\n#include \"spawn\/exec.hxx\"\n#include \"spawn\/ChildOptions.hxx\"\n#include \"gerrno.h\"\n#include \"pool.hxx\"\n\n#include <daemon\/log.h>\n\n#include <assert.h>\n#include <unistd.h>\n#include <sched.h>\n#include <sys\/un.h>\n#include <sys\/socket.h>\n\nstruct DelegateArgs {\n    const char *helper;\n\n    const ChildOptions *options;\n\n    int fds[2];\n    sigset_t signals;\n};\n\nstruct DelegateProcess {\n    StockItem stock_item;\n\n    const char *uri;\n\n    pid_t pid;\n    int fd;\n\n    struct event event;\n};\n\n\/*\n * libevent callback\n *\n *\/\n\nstatic void\ndelegate_stock_event(int fd, short event, void *ctx)\n{\n    auto *process = (DelegateProcess *)ctx;\n\n    assert(fd == process->fd);\n\n    p_event_consumed(&process->event, process->stock_item.pool);\n\n    if ((event & EV_TIMEOUT) == 0) {\n        assert((event & EV_READ) != 0);\n\n        char buffer;\n        ssize_t nbytes = recv(fd, &buffer, sizeof(buffer), MSG_DONTWAIT);\n        if (nbytes < 0)\n            daemon_log(2, \"error on idle delegate process: %s\\n\",\n                       strerror(errno));\n        else if (nbytes > 0)\n            daemon_log(2, \"unexpected data from idle delegate process\\n\");\n    }\n\n    stock_del(process->stock_item);\n    pool_commit();\n}\n\n\/*\n * clone() function\n *\n *\/\n\nstatic int\ndelegate_stock_fn(void *ctx)\n{\n    auto *info = (DelegateArgs *)ctx;\n\n    install_default_signal_handlers();\n    leave_signal_section(&info->signals);\n\n    info->options->Apply(true);\n\n    dup2(info->fds[1], STDIN_FILENO);\n    close(info->fds[0]);\n    close(info->fds[1]);\n\n    Exec e;\n    info->options->jail.InsertWrapper(e, nullptr);\n    e.Append(info->helper);\n    e.DoExec();\n}\n\n\/*\n * stock class\n *\n *\/\n\nstatic constexpr DelegateProcess &\nToDelegateProcess(StockItem &item)\n{\n    return ContainerCast2(item, &DelegateProcess::stock_item);\n}\n\nstatic struct pool *\ndelegate_stock_pool(void *ctx gcc_unused, struct pool &parent,\n                    const char *uri gcc_unused)\n{\n    return pool_new_linear(&parent, \"delegate_stock\", 512);\n}\n\nstatic void\ndelegate_stock_create(gcc_unused void *ctx, StockItem &item,\n                      const char *uri, void *_info,\n                      gcc_unused struct pool &caller_pool,\n                      gcc_unused struct async_operation_ref &async_ref)\n{\n    auto *process = &ToDelegateProcess(item);\n    auto *const info = (DelegateArgs *)_info;\n    const auto *const options = info->options;\n\n    if (socketpair_cloexec(AF_UNIX, SOCK_STREAM, 0, info->fds) < 0) {\n        GError *error = new_error_errno_msg(\"socketpair() failed: %s\");\n        stock_item_failed(item, error);\n        return;\n    }\n\n    int clone_flags = SIGCHLD;\n    clone_flags = options->ns.GetCloneFlags(clone_flags);\n\n    \/* avoid race condition due to libevent signal handler in child\n       process *\/\n    enter_signal_section(&info->signals);\n\n    char stack[8192];\n    long pid = clone(delegate_stock_fn, stack + sizeof(stack),\n                     clone_flags, info);\n    if (pid < 0) {\n        GError *error = new_error_errno_msg(\"clone() failed\");\n        leave_signal_section(&info->signals);\n        close(info->fds[0]);\n        close(info->fds[1]);\n        stock_item_failed(item, error);\n        return;\n    }\n\n    leave_signal_section(&info->signals);\n\n    close(info->fds[1]);\n\n    process->uri = uri;\n    process->pid = pid;\n    process->fd = info->fds[0];\n\n    event_set(&process->event, process->fd, EV_READ|EV_TIMEOUT,\n              delegate_stock_event, process);\n\n    stock_item_available(process->stock_item);\n}\n\nstatic bool\ndelegate_stock_borrow(gcc_unused void *ctx, StockItem &item)\n{\n    auto *process = &ToDelegateProcess(item);\n\n    p_event_del(&process->event, process->stock_item.pool);\n    return true;\n}\n\nstatic void\ndelegate_stock_release(gcc_unused void *ctx, StockItem &item)\n{\n    auto *process = &ToDelegateProcess(item);\n    static const struct timeval tv = {\n        .tv_sec = 60,\n        .tv_usec = 0,\n    };\n\n    p_event_add(&process->event, &tv,\n                process->stock_item.pool, \"delegate_process\");\n}\n\nstatic void\ndelegate_stock_destroy(gcc_unused void *ctx, StockItem &item)\n{\n    auto *process = &ToDelegateProcess(item);\n\n    p_event_del(&process->event, process->stock_item.pool);\n    close(process->fd);\n}\n\nstatic constexpr StockClass delegate_stock_class = {\n    .item_size = sizeof(DelegateProcess),\n    .pool = delegate_stock_pool,\n    .create = delegate_stock_create,\n    .borrow = delegate_stock_borrow,\n    .release = delegate_stock_release,\n    .destroy = delegate_stock_destroy,\n};\n\n\n\/*\n * interface\n *\n *\/\n\nStockMap *\ndelegate_stock_new(struct pool *pool)\n{\n    return hstock_new(*pool, delegate_stock_class, nullptr, 0, 16);\n}\n\nvoid\ndelegate_stock_get(StockMap *delegate_stock, struct pool *pool,\n                   const char *helper,\n                   const ChildOptions &options,\n                   StockGetHandler &handler,\n                   struct async_operation_ref &async_ref)\n{\n    const char *uri = helper;\n\n    char options_buffer[4096];\n    *options.MakeId(options_buffer) = 0;\n    if (*options_buffer != 0)\n        uri = p_strcat(pool, helper, \"|\", options_buffer, nullptr);\n\n    auto info = NewFromPool<DelegateArgs>(*pool);\n    info->helper = helper;\n    info->options = &options;\n\n    hstock_get(*delegate_stock, *pool, uri, info, handler, async_ref);\n}\n\nvoid\ndelegate_stock_put(StockMap *delegate_stock,\n                   StockItem &item, bool destroy)\n{\n    auto *process = &ToDelegateProcess(item);\n\n    hstock_put(*delegate_stock, process->uri, item, destroy);\n}\n\nint\ndelegate_stock_item_get(StockItem &item)\n{\n    auto *process = &ToDelegateProcess(item);\n\n    return process->fd;\n}\n<|endoftext|>"}
{"text":"<commit_before>#include \"ros\/ros.h\"\n#include \"geometry_msgs\/Twist.h\" \/\/ Not sure if necessary\n#include \"geometry_msgs\/Pose.h\"  \/\/ Ditto\n#include \"uranus_dp\/GetM.h\"\n#include \"uranus_dp\/GetC.h\"\n#include \"uranus_dp\/GetD.h\"\n#include \"uranus_dp\/GetG.h\"\n#include \"uranus_dp\/GetR.h\"\n#include \"uranus_dp\/GetT.h\"\n#include \"uranus_dp\/GetJ.h\"\n#include <eigen_conversions\/eigen_msg.h>\n\nEigen::Matrix3d           skew(const Eigen::Vector3d &v);\nEigen::Matrix<double,4,3> angularTransformationMatrix(const Eigen::Quaterniond &q);\n\nbool getM(uranus_dp::GetM::Request &req, uranus_dp::GetM::Response &resp)\n{\n    \/\/ 1st row\n    resp.M[0]  = 1;\n    resp.M[1]  = 1;\n    resp.M[2]  = 1;\n    resp.M[3]  = 1;\n    resp.M[4]  = 1;\n    resp.M[5]  = 1;\n\n    \/\/ 2nd row\n    resp.M[6]  = 1;\n    resp.M[7]  = 1;\n    resp.M[8]  = 1;\n    resp.M[9]  = 1;\n    resp.M[10] = 1;\n    resp.M[11] = 1;\n\n    \/\/ 3rd row\n    resp.M[12] = 1;\n    resp.M[13] = 1;\n    resp.M[14] = 1;\n    resp.M[15] = 1;\n    resp.M[16] = 1;\n    resp.M[17] = 1;\n\n    \/\/ 4th row\n    resp.M[18] = 1;\n    resp.M[19] = 1;\n    resp.M[20] = 1;\n    resp.M[21] = 1;\n    resp.M[22] = 1;\n    resp.M[23] = 1;\n\n    \/\/ 5th row\n    resp.M[24] = 1;\n    resp.M[25] = 1;\n    resp.M[26] = 1;\n    resp.M[27] = 1;\n    resp.M[28] = 1;\n    resp.M[29] = 1;\n\n    \/\/ 6th row\n    resp.M[30] = 1;\n    resp.M[31] = 1;\n    resp.M[32] = 1;\n    resp.M[33] = 1;\n    resp.M[34] = 1;\n    resp.M[35] = 1;\n\n    return true;\n}\n\nbool getC(uranus_dp::GetC::Request &req, uranus_dp::GetC::Response &resp)\n{\n    \/\/ 1st row\n    resp.C[0]  = 1;\n    resp.C[1]  = 1;\n    resp.C[2]  = 1;\n    resp.C[3]  = 1;\n    resp.C[4]  = 1;\n    resp.C[5]  = 1;\n\n    \/\/ 2nd row\n    resp.C[6]  = 1;\n    resp.C[7]  = 1;\n    resp.C[8]  = 1;\n    resp.C[9]  = 1;\n    resp.C[10] = 1;\n    resp.C[11] = 1;\n\n    \/\/ 3rd row\n    resp.C[12] = 1;\n    resp.C[13] = 1;\n    resp.C[14] = 1;\n    resp.C[15] = 1;\n    resp.C[16] = 1;\n    resp.C[17] = 1;\n\n    \/\/ 4th row\n    resp.C[18] = 1;\n    resp.C[19] = 1;\n    resp.C[20] = 1;\n    resp.C[21] = 1;\n    resp.C[22] = 1;\n    resp.C[23] = 1;\n\n    \/\/ 5th row\n    resp.C[24] = 1;\n    resp.C[25] = 1;\n    resp.C[26] = 1;\n    resp.C[27] = 1;\n    resp.C[28] = 1;\n    resp.C[29] = 1;\n\n    \/\/ 6th row\n    resp.C[30] = 1;\n    resp.C[31] = 1;\n    resp.C[32] = 1;\n    resp.C[33] = 1;\n    resp.C[34] = 1;\n    resp.C[35] = 1;\n\n    return true;\n}\n\nbool getD(uranus_dp::GetD::Request &req, uranus_dp::GetD::Response &resp)\n{\n    \/\/ 1st row\n    resp.D[0]  = 1;\n    resp.D[1]  = 1;\n    resp.D[2]  = 1;\n    resp.D[3]  = 1;\n    resp.D[4]  = 1;\n    resp.D[5]  = 1;\n\n    \/\/ 2nd row\n    resp.D[6]  = 1;\n    resp.D[7]  = 1;\n    resp.D[8]  = 1;\n    resp.D[9]  = 1;\n    resp.D[10] = 1;\n    resp.D[11] = 1;\n\n    \/\/ 3rd row\n    resp.D[12] = 1;\n    resp.D[13] = 1;\n    resp.D[14] = 1;\n    resp.D[15] = 1;\n    resp.D[16] = 1;\n    resp.D[17] = 1;\n\n    \/\/ 4th row\n    resp.D[18] = 1;\n    resp.D[19] = 1;\n    resp.D[20] = 1;\n    resp.D[21] = 1;\n    resp.D[22] = 1;\n    resp.D[23] = 1;\n\n    \/\/ 5th row\n    resp.D[24] = 1;\n    resp.D[25] = 1;\n    resp.D[26] = 1;\n    resp.D[27] = 1;\n    resp.D[28] = 1;\n    resp.D[29] = 1;\n\n    \/\/ 6th row\n    resp.D[30] = 1;\n    resp.D[31] = 1;\n    resp.D[32] = 1;\n    resp.D[33] = 1;\n    resp.D[34] = 1;\n    resp.D[35] = 1;\n\n    return true;\n}\n\nbool getG(uranus_dp::GetG::Request &req, uranus_dp::GetG::Response &resp)\n{\n    resp.g[0] = 1;\n    resp.g[1] = 1;\n    resp.g[2] = 1;\n    resp.g[3] = 1;\n    resp.g[4] = 1;\n    resp.g[5] = 1;\n\n    return true;\n}\n\nbool getR(uranus_dp::GetR::Request &req, uranus_dp::GetR::Response &resp)\n{\n    Eigen::Quaterniond q;\n    tf::quaternionMsgToEigen(req.q, q);\n\n    Eigen::Matrix3d R = q.matrix();\n\n    for (int i = 0; i < 9; i++)\n    {\n        resp.R[i] = R(i);\n    }\n\n    return true;\n}\n\nbool getT(uranus_dp::GetT::Request &req, uranus_dp::GetT::Response &resp)\n{\n    Eigen::Quaterniond q;\n    tf::quaternionMsgToEigen(req.q, q);\n    Eigen::Matrix<double,4,3> T = angularTransformationMatrix(q);\n\n    for (int i = 0; i < 12; i++)\n    {\n        resp.T[i] = T(i);\n    }\n\n    return true;\n}\n\nbool getJ(uranus_dp::GetJ::Request &req, uranus_dp::GetJ::Response &resp)\n{\n    Eigen::Quaterniond q;\n    tf::quaternionMsgToEigen(req.q, q);\n    Eigen::Matrix3d R = q.matrix();\n    Eigen::Matrix<double,4,3> T = angularTransformationMatrix(q);\n    Eigen::Matrix<double,7,6> J;\n    J << R, Eigen::MatrixXd::Zero(3,3),\n         Eigen::MatrixXd::Zero(4,3), T;\n\n    for (int i = 0; i < 42; i++)\n    {\n        resp.J[i] = J(i);\n    }\n\n    return true;\n}\n\nEigen::Matrix3d skew(const Eigen::Vector3d &v)\n{\n    Eigen::Matrix3d S;\n    S << 0, -v(2), v(1),\n         v(2), 0, -v(0),\n         -v(1), v(0), 0;\n    return S;\n}\n\nEigen::Matrix<double,4,3> angularTransformationMatrix(const Eigen::Quaterniond &q)\n{\n    Eigen::Matrix<double,4,3> T;\n\n    T << -q.vec().transpose(),\n         q.w()*Eigen::MatrixXd::Identity(3,3) + skew(q.vec());\n\n    return T;\n}\n\nint main(int argc, char **argv)\n{\n    ros::init(argc, argv, \"model_server\");\n    ros::NodeHandle nh;\n\n    ros::ServiceServer serviceM = nh.advertiseService(\"get_m\", getM);\n    ros::ServiceServer serviceC = nh.advertiseService(\"get_c\", getC);\n    ros::ServiceServer serviceD = nh.advertiseService(\"get_d\", getD);\n    ros::ServiceServer serviceG = nh.advertiseService(\"get_g\", getG);\n    ros::ServiceServer serviceR = nh.advertiseService(\"get_r\", getR);\n    ros::spin();\n\n    return 0;\n}\n<commit_msg>More legible function name<commit_after>#include \"ros\/ros.h\"\n#include \"geometry_msgs\/Twist.h\" \/\/ Not sure if necessary\n#include \"geometry_msgs\/Pose.h\"  \/\/ Ditto\n#include \"uranus_dp\/GetM.h\"\n#include \"uranus_dp\/GetC.h\"\n#include \"uranus_dp\/GetD.h\"\n#include \"uranus_dp\/GetG.h\"\n#include \"uranus_dp\/GetR.h\"\n#include \"uranus_dp\/GetT.h\"\n#include \"uranus_dp\/GetJ.h\"\n#include <eigen_conversions\/eigen_msg.h>\n\nEigen::Matrix3d           skew(const Eigen::Vector3d &v);\nEigen::Matrix<double,4,3> angularTransformationMatrix(const Eigen::Quaterniond &q);\n\nbool getM(uranus_dp::GetM::Request &req, uranus_dp::GetM::Response &resp)\n{\n    \/\/ 1st row\n    resp.M[0]  = 1;\n    resp.M[1]  = 1;\n    resp.M[2]  = 1;\n    resp.M[3]  = 1;\n    resp.M[4]  = 1;\n    resp.M[5]  = 1;\n\n    \/\/ 2nd row\n    resp.M[6]  = 1;\n    resp.M[7]  = 1;\n    resp.M[8]  = 1;\n    resp.M[9]  = 1;\n    resp.M[10] = 1;\n    resp.M[11] = 1;\n\n    \/\/ 3rd row\n    resp.M[12] = 1;\n    resp.M[13] = 1;\n    resp.M[14] = 1;\n    resp.M[15] = 1;\n    resp.M[16] = 1;\n    resp.M[17] = 1;\n\n    \/\/ 4th row\n    resp.M[18] = 1;\n    resp.M[19] = 1;\n    resp.M[20] = 1;\n    resp.M[21] = 1;\n    resp.M[22] = 1;\n    resp.M[23] = 1;\n\n    \/\/ 5th row\n    resp.M[24] = 1;\n    resp.M[25] = 1;\n    resp.M[26] = 1;\n    resp.M[27] = 1;\n    resp.M[28] = 1;\n    resp.M[29] = 1;\n\n    \/\/ 6th row\n    resp.M[30] = 1;\n    resp.M[31] = 1;\n    resp.M[32] = 1;\n    resp.M[33] = 1;\n    resp.M[34] = 1;\n    resp.M[35] = 1;\n\n    return true;\n}\n\nbool getC(uranus_dp::GetC::Request &req, uranus_dp::GetC::Response &resp)\n{\n    \/\/ 1st row\n    resp.C[0]  = 1;\n    resp.C[1]  = 1;\n    resp.C[2]  = 1;\n    resp.C[3]  = 1;\n    resp.C[4]  = 1;\n    resp.C[5]  = 1;\n\n    \/\/ 2nd row\n    resp.C[6]  = 1;\n    resp.C[7]  = 1;\n    resp.C[8]  = 1;\n    resp.C[9]  = 1;\n    resp.C[10] = 1;\n    resp.C[11] = 1;\n\n    \/\/ 3rd row\n    resp.C[12] = 1;\n    resp.C[13] = 1;\n    resp.C[14] = 1;\n    resp.C[15] = 1;\n    resp.C[16] = 1;\n    resp.C[17] = 1;\n\n    \/\/ 4th row\n    resp.C[18] = 1;\n    resp.C[19] = 1;\n    resp.C[20] = 1;\n    resp.C[21] = 1;\n    resp.C[22] = 1;\n    resp.C[23] = 1;\n\n    \/\/ 5th row\n    resp.C[24] = 1;\n    resp.C[25] = 1;\n    resp.C[26] = 1;\n    resp.C[27] = 1;\n    resp.C[28] = 1;\n    resp.C[29] = 1;\n\n    \/\/ 6th row\n    resp.C[30] = 1;\n    resp.C[31] = 1;\n    resp.C[32] = 1;\n    resp.C[33] = 1;\n    resp.C[34] = 1;\n    resp.C[35] = 1;\n\n    return true;\n}\n\nbool getD(uranus_dp::GetD::Request &req, uranus_dp::GetD::Response &resp)\n{\n    \/\/ 1st row\n    resp.D[0]  = 1;\n    resp.D[1]  = 1;\n    resp.D[2]  = 1;\n    resp.D[3]  = 1;\n    resp.D[4]  = 1;\n    resp.D[5]  = 1;\n\n    \/\/ 2nd row\n    resp.D[6]  = 1;\n    resp.D[7]  = 1;\n    resp.D[8]  = 1;\n    resp.D[9]  = 1;\n    resp.D[10] = 1;\n    resp.D[11] = 1;\n\n    \/\/ 3rd row\n    resp.D[12] = 1;\n    resp.D[13] = 1;\n    resp.D[14] = 1;\n    resp.D[15] = 1;\n    resp.D[16] = 1;\n    resp.D[17] = 1;\n\n    \/\/ 4th row\n    resp.D[18] = 1;\n    resp.D[19] = 1;\n    resp.D[20] = 1;\n    resp.D[21] = 1;\n    resp.D[22] = 1;\n    resp.D[23] = 1;\n\n    \/\/ 5th row\n    resp.D[24] = 1;\n    resp.D[25] = 1;\n    resp.D[26] = 1;\n    resp.D[27] = 1;\n    resp.D[28] = 1;\n    resp.D[29] = 1;\n\n    \/\/ 6th row\n    resp.D[30] = 1;\n    resp.D[31] = 1;\n    resp.D[32] = 1;\n    resp.D[33] = 1;\n    resp.D[34] = 1;\n    resp.D[35] = 1;\n\n    return true;\n}\n\nbool getG(uranus_dp::GetG::Request &req, uranus_dp::GetG::Response &resp)\n{\n    resp.g[0] = 1;\n    resp.g[1] = 1;\n    resp.g[2] = 1;\n    resp.g[3] = 1;\n    resp.g[4] = 1;\n    resp.g[5] = 1;\n\n    return true;\n}\n\nbool getR(uranus_dp::GetR::Request &req, uranus_dp::GetR::Response &resp)\n{\n    Eigen::Quaterniond q;\n    tf::quaternionMsgToEigen(req.q, q);\n\n    Eigen::Matrix3d R = q.toRotationMatrix();\n\n    for (int i = 0; i < 9; i++)\n    {\n        resp.R[i] = R(i);\n    }\n\n    return true;\n}\n\nbool getT(uranus_dp::GetT::Request &req, uranus_dp::GetT::Response &resp)\n{\n    Eigen::Quaterniond q;\n    tf::quaternionMsgToEigen(req.q, q);\n    Eigen::Matrix<double,4,3> T = angularTransformationMatrix(q);\n\n    for (int i = 0; i < 12; i++)\n    {\n        resp.T[i] = T(i);\n    }\n\n    return true;\n}\n\nbool getJ(uranus_dp::GetJ::Request &req, uranus_dp::GetJ::Response &resp)\n{\n    Eigen::Quaterniond q;\n    tf::quaternionMsgToEigen(req.q, q);\n    Eigen::Matrix3d R = q.toRotationMatrix();\n    Eigen::Matrix<double,4,3> T = angularTransformationMatrix(q);\n    Eigen::Matrix<double,7,6> J;\n    J << R, Eigen::MatrixXd::Zero(3,3),\n         Eigen::MatrixXd::Zero(4,3), T;\n\n    for (int i = 0; i < 42; i++)\n    {\n        resp.J[i] = J(i);\n    }\n\n    return true;\n}\n\nEigen::Matrix3d skew(const Eigen::Vector3d &v)\n{\n    Eigen::Matrix3d S;\n    S << 0, -v(2), v(1),\n         v(2), 0, -v(0),\n         -v(1), v(0), 0;\n    return S;\n}\n\nEigen::Matrix<double,4,3> angularTransformationMatrix(const Eigen::Quaterniond &q)\n{\n    Eigen::Matrix<double,4,3> T;\n\n    T << -q.vec().transpose(),\n         q.w()*Eigen::MatrixXd::Identity(3,3) + skew(q.vec());\n\n    return T;\n}\n\nint main(int argc, char **argv)\n{\n    ros::init(argc, argv, \"model_server\");\n    ros::NodeHandle nh;\n\n    ros::ServiceServer serviceM = nh.advertiseService(\"get_m\", getM);\n    ros::ServiceServer serviceC = nh.advertiseService(\"get_c\", getC);\n    ros::ServiceServer serviceD = nh.advertiseService(\"get_d\", getD);\n    ros::ServiceServer serviceG = nh.advertiseService(\"get_g\", getG);\n    ros::ServiceServer serviceR = nh.advertiseService(\"get_r\", getR);\n    ros::spin();\n\n    return 0;\n}\n<|endoftext|>"}